[ { "path": ".gitattributes", "content": "src/test/resources/samples/* linguist-vendored\n" }, { "path": ".gitignore", "content": ".DS_Store\n.gradle/\n.idea/\n.sourcerer\nbuild/\nsourcerer-app.iml\nsourcerer-app.ipr\nsourcerer-app.iws\napp.iml\napp.ipr\napp.iws\n/confluence/target\n/dependencies\n/dist\n/gh-pages\n/ideaSDK\n/out\n/tmp\n*.versionsBackup\n/ultimate/dependencies\n/ultimate/ideaSDK\n/ultimate/out\n/ultimate/tmp\ntmp_repo\n" }, { "path": "CODE_OF_CONDUCT.md", "content": "# Contributor Code of Conduct\n\nAs contributors and maintainers of this project, we pledge to respect all people who contribute through reporting issues, posting feature requests, updating documentation, submitting pull requests or patches, and other activities.\n\nWe are committed to making participation in this project a harassment-free experience for everyone, regardless of level of experience, gender, gender identity and expression, sexual orientation, disability, personal appearance, body size, race, ethnicity, age, or religion.\n\nExamples of unacceptable behavior by participants include the use of sexual language or imagery, derogatory comments or personal attacks, trolling, public or private harassment, insults, or other unprofessional conduct.\n\nProject maintainers have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct. Project maintainers who do not follow the Code of Conduct may be removed from the project team.\n\nInstances of abusive, harassing, or otherwise unacceptable behavior may be reported by opening an issue or contacting one or more of the project maintainers.\n\nThis Code of Conduct is adapted from the [Contributor Covenant](http:contributor-covenant.org), version 1.0.0, available at https://www.contributor-covenant.org/version/1/0/0/code-of-conduct.html\n" }, { "path": "CONTRIBUTING.md", "content": "# Contribution\n\nWe welcome contributions to [Sourcerer App](https://github.com/sourcerer-io/sourcerer-app) by the community.\n\nSee [README](https://github.com/sourcerer-io/sourcerer-app) for more information about prerequirements and building project.\n\n## How to report a problem\n\nPlease search before creating a new issue. Feel free to add issues related to the app or [sourcerer](https://sourcerer.io) site.\n\n## Submitting сhanges\n\n* Open a new issue in the [issue tracker](https://github.com/sourcerer-io/sourcerer-app/issues).\n* Fork and clone the repo with `git clone https://github.com/your-username/sourcerer-app.git`.\n* Create a new branch based off the `develop` branch.\n* Make changes.\n* Make sure all tests pass.\n* Submit a pull request, referencing any issues it addresses.\n\nWe will review your Pull Request as soon as possible. Thank you for contributing!\n\n## Integration testing\n\nWe will work on a special environment for contributors in the nearest future. For now one should use his personal or additional account on site.\n\n## Style guides\n### Commit messages\n\nFormat:\n```type(component): message (jira issue tag, github issue number with #)```\n\nMessage types:\n* **feat** is used when new feature is provided;\n* **wip** is used when making regular commit and changes don't match any other types;\n* **fix** is used when you fix a bug;\n* **chore** is used when changes are about organization, not about logic;\n* **docs** is used when you add/change documentation.\nComponent is a decomposition unit your commit affected. Write message in present simple.\n\nExamples:\nfeat(logger): add rotating\nchore: remove redundant commas, add copyright\nwip: pass models to routers\nfix: program exit is prevented when button is pressed (COMP-1, #123)\n\n### Kotlin style guide\n* Code has a column limit of 80 characters.\n* Inline comments should be indented with 2 spaces from code.\n\nWe are using [Kotlin Coding Conventions](https://kotlinlang.org/docs/reference/coding-conventions.html).\n\n## Code of conduct\nWe value input from each member of the community, however we urge you to abide by [code of conduct](https://github.com/sourcerer-io/sourcerer-app/blob/master/CODE_OF_CONDUCT.md).\n" }, { "path": "Dockerfile", "content": "FROM nginx:1.13\n\nCOPY deploy/default.conf /etc/nginx/conf.d\n\nRUN mkdir /files\nCOPY build/libs/sourcerer-app.jar /files/download\nCOPY src/install/install /files/install\n" }, { "path": "LICENSE.md", "content": "Copyright 2017 Sourcerer, Inc. https://sourcerer.io\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" }, { "path": "README.md", "content": "

\n \n \"Sourcerer\"\n \n  sourcerer.io \n \n \n \n

\n\nA visual profile for software engineers.\n
\n\n

\n \"sergey\"\n

\n\nFeatures\n========\n* Profile creation with a single click\n* Support of 100 languages (even exotic ones like COBOL)\n* Detection of more than [1,000 libraries](https://github.com/sourcerer-io/awesome-libraries) in code with per-line statistics\n* Visual presentation your development experience\n* *Finally!* Summary of all repositories you've contributed to :tada:\n* Interesting facts about yourself\n\nCreating your profile is just the first step for us at Sourcerer. Some of the things on our roadmap include:\n* Engineers to follow and learn from\n* Technology and libraries you should know about\n* Projects that could use your help\n\nGet started\n===========\nThe easiest way to get started is with your open source repos. Go to [sourcerer.io/start](https://sourcerer.io/start), and select *Build with GitHub* and watch your profile build. \n\nFor closed source repos, you will need to use this app. If you already created an account using GitHub, you would have received an email with credentials for the app. If not, You will need a new account, which you can get at [sourcerer.io/join](https://sourcerer.io/join).\n\nShowcase\n========\n
\n \n \n \n \n \n \n \n \n \n \n \n \n \n
\"chdemko\"\"chendaniely\"\"lauragift21\"\"maracuja-juice\"
\"marisbotero\"\"nordes\"\"ppapadeas\"\"praharshjain\"
\n
\n\nRequirements\n============\n* Web browser\n\nor\n\n* Linux or macOS or Windows\n* Java 8+ Platform ([JRE](http://www.oracle.com/technetwork/java/javase/downloads/jre8-downloads-2133155.html) for Linux and Windows or [JDK](http://www.oracle.com/technetwork/java/javase/downloads/jdk8-downloads-2133151.html) for macOS)\n* Bash for Windows (`git bash` should suffice)\n\nUsage\n=====\nTo install sourcerer run the following command in bash:\n\n```\ncurl -s https://sourcerer.io/app/install | bash\n```\n\nTo run wizard use `sourcerer` command for macOS and Linux, `java -jar sourcerer.jar` in folder `Users\\user\\.sourcerer` for Windows.\n\nUse parameter `--help` for additional info.\n\n\nInternals\n=========\nThe app looks at repos locally on your machine, and then sends stats to sourcerer.io. The best way to verify is to look at the code. Protobuf messages declared in [src/main/proto/sourcerer.proto](https://github.com/sourcerer-io/sourcerer-app/blob/develop/src/main/proto/sourcerer.proto) is a good start as it describes the client-server protocol.\nThe Sourcerer app does **NOT** upload source code anywhere, and it **NEVER** will.\n\nFAQ\n===\n### How can I process private repos?\nWe process only public repos using GitHub OAuth. To process private repos you need to run sourcerer app locally. See [Get started](#get-started) for instructions. Sourcerer app sends only statistical information to our servers and never sends code.\n\n### Why do you need GitHub permissions?\nWe use emails to identify commit authorship, read orgs access to get list of public repositories that you've contributed to. You also need to grant access to read this public information from an organization.\n\n### Other questions\nSee [sourcerer.io/faq](https://sourcerer.io/faq).\n\nContributing\n============\nWe love contributions! Check out the [Contribution guide](https://github.com/sourcerer-io/sourcerer-app/blob/master/CONTRIBUTING.md) for more information. Simplest and really helpful for the community would be contribution meta information to our [supported libraries list](https://github.com/sourcerer-io/awesome-libraries). If you an author of a library you show definitely add yours to the list or you can help to someone whose work you use.\n\n[![0](https://sourcerer.io/fame/sergey48k/sourcerer-io/sourcerer-app/images/0)](https://sourcerer.io/fame/sergey48k/sourcerer-io/sourcerer-app/links/0)\n[![1](https://sourcerer.io/fame/sergey48k/sourcerer-io/sourcerer-app/images/1)](https://sourcerer.io/fame/sergey48k/sourcerer-io/sourcerer-app/links/1)\n[![2](https://sourcerer.io/fame/sergey48k/sourcerer-io/sourcerer-app/images/2)](https://sourcerer.io/fame/sergey48k/sourcerer-io/sourcerer-app/links/2)\n[![3](https://sourcerer.io/fame/sergey48k/sourcerer-io/sourcerer-app/images/3)](https://sourcerer.io/fame/sergey48k/sourcerer-io/sourcerer-app/links/3)\n[![4](https://sourcerer.io/fame/sergey48k/sourcerer-io/sourcerer-app/images/4)](https://sourcerer.io/fame/sergey48k/sourcerer-io/sourcerer-app/links/4)\n[![5](https://sourcerer.io/fame/sergey48k/sourcerer-io/sourcerer-app/images/5)](https://sourcerer.io/fame/sergey48k/sourcerer-io/sourcerer-app/links/5)\n[![6](https://sourcerer.io/fame/sergey48k/sourcerer-io/sourcerer-app/images/6)](https://sourcerer.io/fame/sergey48k/sourcerer-io/sourcerer-app/links/6)\n[![7](https://sourcerer.io/fame/sergey48k/sourcerer-io/sourcerer-app/images/7)](https://sourcerer.io/fame/sergey48k/sourcerer-io/sourcerer-app/links/7)\n\nBuild\n=====\nTo build and run this application locally, you'll need latest versions of Git, Gradle and JDK installed on your computer. From your command line:\n\n```\n# Clone this repository\n$ git clone https://github.com/sourcerer-io/sourcerer-app.git\n\n# Go into the repository\n$ cd sourcerer-app\n\n# Build\n$ gradle build\n\n# Run the app\n$ java -jar build/libs/sourcerer-app.jar\n```\n\nLicense\n=======\nSourcerer is under the MIT license. See the [LICENSE](https://github.com/sourcerer-io/sourcerer-app/blob/develop/LICENSE.md) for more information.\n\nLinks\n=====\n* [Sourcerer Site](https://sourcerer.io/)\n* [Sourcerer Blog](https://blog.sourcerer.io)\n* [Follow Sourcerer on Twitter](https://twitter.com/sourcerer_io)\n* [Follow Sourcerer on Facebook](https://www.facebook.com/sourcerer.io/)\n" }, { "path": "build.gradle", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n\nbuildscript {\n ext.kotlin_version = '1.2.31'\n repositories {\n mavenCentral()\n jcenter()\n }\n dependencies {\n classpath \"org.jetbrains.kotlin:kotlin-gradle-plugin:$kotlin_version\"\n classpath \"com.google.protobuf:protobuf-gradle-plugin:0.8.10\"\n classpath \"org.junit.platform:junit-platform-gradle-plugin:1.0.1\"\n }\n}\n\nplugins {\n id 'de.fuerstenau.buildconfig' version '1.1.8'\n}\n\napply plugin: \"idea\"\napply plugin: \"java\"\napply plugin: \"kotlin\"\napply plugin: \"application\"\napply plugin: \"com.google.protobuf\"\napply plugin: \"org.junit.platform.gradle.plugin\"\n\nbuildConfig {\n clsName = 'BuildConfig'\n packageName = 'app'\n\n // API.\n def apiBasePath = project.hasProperty('api') ? api : 'https://sourcerer.io/api/commit'\n buildConfigField 'String', 'API_BASE_PATH', apiBasePath\n\n // Common.\n buildConfigField 'String', 'PROFILE_URL', 'https://sourcerer.io/'\n\n // App version.\n buildConfigField 'int', 'VERSION_CODE', '30'\n buildConfigField 'String', 'VERSION', '0.3.18'\n\n // Logging.\n buildConfigField 'String', 'ENV', project.hasProperty('env') ? env : 'production'\n buildConfigField 'String', 'LOG_LEVEL', project.hasProperty('log') ? log : 'info'\n buildConfigField 'boolean', 'SILENT_USER_OUTPUT', project.hasProperty('silent') ? silent : 'false'\n buildConfigField 'boolean', 'SENTRY_ENABLED', project.hasProperty('sentry') ? sentry : 'false'\n buildConfigField 'String', 'SENTRY_DSN', 'https://0263d6473bd24a9ba40e25aa5fb0a242:c5451dc815074bff8ce3fb9f0851f2f5@sentry.io/233260'\n buildConfigField 'boolean', 'PRINT_STACK_TRACE', 'false'\n\n // Google Analytics.\n buildConfigField 'String', 'GA_BASE_PATH', 'https://www.google-analytics.com'\n buildConfigField 'String', 'GA_TRACKING_ID', 'UA-107129190-2'\n buildConfigField 'boolean', 'IS_GA_ENABLED', 'true'\n\n // Models storage path.\n buildConfigField 'String', 'LIBRARY_MODELS_URL', 'https://storage.googleapis.com/sourcerer-app/library-models/v2/'\n\n // Hashing.\n buildConfigField 'boolean', 'COMMIT_HASHER_ENABLED', project.hasProperty('commit-hasher-enabled') ? project.property('commit-hasher-enabled').toString() : 'true'\n buildConfigField 'boolean', 'FACT_HASHER_ENABLED', project.hasProperty('fact-hasher-enabled') ? project.property('fact-hasher-enabled').toString() : 'true'\n buildConfigField 'boolean', 'LONGEVITY_ENABLED', project.hasProperty('longevity-enabled') ? project.property('longevity-enabled').toString() : 'false'\n buildConfigField 'long', 'HEARTBEAT_RATE', project.hasProperty('heartbeat-rate') ? project.property('heartbeat-rate').toString() : '60000'\n buildConfigField 'boolean', 'META_HASHER_ENABLED', project.hasProperty('meta-hasher-enabled') ? project.property('meta-hasher-enabled').toString() : 'true'\n buildConfigField 'boolean', 'DISTANCES_ENABLED', project.hasProperty('distances-enabled') ? project.property('distances-enabled').toString() : 'true'\n\n buildConfig\n}\n\njunitPlatform {\n filters {\n engines {\n include 'spek'\n }\n }\n}\n\ntask cleanData {\n delete 'build/libs/data'\n delete 'build/kotlin/data'\n}\n\ntest.dependsOn cleanData\n\nmainClassName = \"app.MainKt\"\n\nrepositories {\n mavenCentral()\n jcenter()\n maven { url \"https://dl.bintray.com/jetbrains/spek\" }\n flatDir {\n dirs 'libs'\n }\n}\n\ndependencies {\n compile \"org.jetbrains.kotlin:kotlin-stdlib-jre8:$kotlin_version\"\n compile \"org.jetbrains.kotlin:kotlin-reflect:$kotlin_version\"\n compile \"com.beust:jcommander:1.72\"\n compile 'com.google.protobuf:protobuf-java:3.5.1'\n compile 'commons-codec:commons-codec:1.5'\n compile 'com.fasterxml.jackson.core:jackson-databind:2.9.5'\n compile 'com.fasterxml.jackson.module:jackson-module-kotlin:2.9.5'\n compile 'com.fasterxml.jackson.dataformat:jackson-dataformat-yaml:2.9.5'\n compile 'io.reactivex.rxjava2:rxjava:2.1.12'\n compile 'com.github.kittinunf.fuel:fuel:1.12.1'\n compile 'com.github.kittinunf.fuel:fuel-rxjava:1.12.1'\n compile 'org.eclipse.jgit:org.eclipse.jgit:4.9.0.201710071750-r'\n compile 'org.slf4j:slf4j-nop:1.7.2'\n compile 'io.sentry:sentry:1.7.3'\n compile 'org.json:json:20180813'\n\n testCompile 'commons-io:commons-io:2.6'\n testCompile 'org.jetbrains.kotlin:kotlin-test'\n testCompile 'org.jetbrains.spek:spek-api:1.1.5'\n testCompile 'org.junit.platform:junit-platform-runner:1.0.1'\n testRuntime 'org.jetbrains.spek:spek-junit-platform-engine:1.1.5'\n}\n\nprotobuf {\n protoc {\n artifact = \"com.google.protobuf:protoc:3.5.1\"\n }\n}\n\nsourceSets.main.java.srcDirs += 'build/generated/source/proto/main/java'\nsourceSets.test.java.srcDirs += 'src/test/kotlin'\ncompileKotlin.dependsOn ':generateProto'\n\n// Include dependent libraries in archive.\njar {\n manifest {\n attributes \"Main-Class\": \"$mainClassName\"\n }\n\n from {\n configurations.compile.collect { it.isDirectory() ? it : zipTree(it) }\n } {\n exclude \"META-INF/*.SF\"\n exclude \"META-INF/*.DSA\"\n exclude \"META-INF/*.RSA\"\n }\n\n baseName 'sourcerer-app'\n}\n" }, { "path": "deploy/GradleDockerfile", "content": "FROM gradle:4.2.0\n\nUSER root\nWORKDIR /root/app\n" }, { "path": "deploy/Jenkinsfile", "content": "// Copyright 2017 Sourcerer, Inc. All Rights Reserved.\n// Author: Maxim Rusak (maxim@sourcerer.io)\n\ndef label = \"sourcerer-app-${UUID.randomUUID().toString()}\"\n\ndef namespace = 'sandbox'\nif (env.BRANCH_NAME == 'master') {\n namespace = 'production'\n} else if (env.BRANCH_NAME == 'develop') {\n namespace = 'staging'\n}\n\npodTemplate(label: label,\n containers: [\n containerTemplate(name: 'jnlp', image: 'gcr.io/sourcerer-1377/jenkins-slave:v4', args: '${computer.jnlpmac} ${computer.name}'),\n containerTemplate(name: 'gradle', image: 'gcr.io/sourcerer-1377/gradle:4.2.0', ttyEnabled: true, command: 'tail -f /dev/null')\n ],\n envVars: [\n envVar(key: 'NAMESPACE', value: namespace),\n envVar(key: 'CONTAINER_TAG', value: \"${namespace}.${env.BUILD_NUMBER}.${System.currentTimeMillis()}\")\n ],\n volumes: [\n hostPathVolume(hostPath: '/var/run/docker.sock', mountPath: '/var/run/docker.sock'),\n hostPathVolume(hostPath: '/usr/bin/docker', mountPath: '/usr/bin/docker')\n ]\n) {\n node(label) {\n stage('checkout') {\n checkout scm\n }\n\n stage('build jar and test') {\n container('gradle') {\n sh(\"./do.sh build_jar_inside\")\n }\n }\n\n stage('build nginx') {\n container('gradle') {\n sh(\"./do.sh build_prod_inside\")\n }\n }\n\n stage('push') {\n sh(\"./do.sh push\")\n }\n \n stage('deploy') {\n println \"Deploying to ${namespace} kubernetes namespace\"\n sh(\"./do.sh deploy\")\n }\n }\n}\n\n" }, { "path": "deploy/default.conf", "content": "geo $dollar {\n default \"$\";\n}\n\nserver {\n listen 80 default_server;\n server_name _;\n\n location /install {\n alias /files/install;\n\n sub_filter \"${dollar}SERVER_EXT\" 'https://$host';\n sub_filter_types *;\n }\n\n location / {\n root /files/;\n }\n}\n" }, { "path": "deploy/production_env.sh", "content": "export REPLICAS=\"2\"\n" }, { "path": "deploy/sandbox_env.sh", "content": "export REPLICAS=\"1\"\n" }, { "path": "deploy/sourcerer-app.yaml", "content": "apiVersion: v1\nkind: Service\nmetadata:\n name: sourcerer-app\n labels:\n app: sourcerer-app\nspec:\n type: ClusterIP\n ports:\n - port: 80\n targetPort: 80\n selector:\n app: sourcerer-app\n---\napiVersion: apps/v1beta1\nkind: Deployment\nmetadata:\n name: sourcerer-app\nspec:\n replicas: $REPLICAS\n template:\n metadata:\n labels:\n app: sourcerer-app\n spec:\n containers:\n - name: sourcerer-app\n image: gcr.io/sourcerer-1377/sourcerer-app:$CONTAINER_TAG\n imagePullPolicy: Always\n resources:\n requests:\n cpu: 100m\n memory: 100Mi\n" }, { "path": "deploy/staging_env.sh", "content": "export REPLICAS=\"0\"\n" }, { "path": "do.sh", "content": "#!/bin/bash\n\n# Copyright 2017 Sourcerer, Inc. All Rights Reserved.\n# Author: Maxim Rusak (maxim@sourcerer.io)\n\nset -x\n\nfn_exists() {\n type $1 2>/dev/null | grep -q 'is a function'\n}\n\nCOMMAND=$1\nshift\nARGUMENTS=${@}\n\nCONTAINER_TAG=\"${CONTAINER_TAG:-latest}\"\nNAMESPACE=\"${NAMESPACE:-sandbox}\"\nLOG=\"${LOG:-debug}\"\nVOLUME=\"${BUILD_VOLUME:-$PWD}\"\nPROJECT=sourcerer-app\nPORT=3182\nREPO_NAME=gcr.io/sourcerer-1377/$PROJECT:$CONTAINER_TAG\nGRADLE_VERSION=4.2.0\n\n#--------------------#\n#----- Commands -----#\n#--------------------#\n\n# run only inside build container\nbuild_jar_inside() {\n if [ \"${NAMESPACE}\" == \"sandbox\" ]; then\n API=\"https://sandbox.sourcerer/api/commit\"\n LOG=\"debug\"\n elif [ \"${NAMESPACE}\" == \"staging\" ]; then\n API=\"https://staging.sourcerer/api/commit\"\n LOG=\"info\"\n elif [ \"${NAMESPACE}\" == \"local\" ]; then\n API=\"http://localhost:3181\"\n LOG=\"debug\"\n else\n API=\"https://sourcerer.io/api/commit\"\n LOG=\"info\"\n fi\n gradle -Penv=${NAMESPACE} -Plog=${LOG} -Papi=${API} build\n}\n\nbuild_jar() {\n docker run -i -v ${VOLUME}:/home/gradle/app --workdir=/home/gradle/app \\\n -e LOG=${LOG} -e NAMESPACE=${NAMESPACE} \\\n gradle:${GRADLE_VERSION} \\\n ./do.sh build_jar_inside\n}\n\nbuild_prod_inside() {\n docker build -t ${REPO_NAME} .\n}\n\ndeploy() {\n source ./deploy/${NAMESPACE}_env.sh\n envsubst < ./deploy/sourcerer-app.yaml > /tmp/deploy.yaml\n kubectl --namespace=${NAMESPACE} apply -f /tmp/deploy.yaml\n}\n\n######################\n\nrun_jar() {\n docker run -i -v ${VOLUME}:/app --workdir=/app gradle:${GRADLE_VERSION} \\\n java -jar build/libs/app.jar\n}\n\nrun_prod() {\n docker run -i -p ${PORT}:80 ${REPO_NAME}\n}\n\npush() {\n gcloud docker -- push ${REPO_NAME}\n}\n\n#---------------------#\n#----- Execution -----#\n#---------------------#\n\nfn_exists ${COMMAND}\nif [ $? -eq 0 ]; then\n ${COMMAND} ${ARGUMENTS}\nelse\n echo \"Command not found\"\nfi\n" }, { "path": "src/install/install", "content": "#!/usr/bin/env bash\n# Copyright 2017 Sourcerer, Inc. All Rights Reserved.\n# License: MIT, https://github.com/sourcerer-io/sourcerer-app/blob/master/LICENSE.md\n# Source code: https://github.com/sourcerer-io\n\necho \"Installing sourcerer app..\"\nSERVER=$SERVER_EXT\nDOWNLOAD_URL=$SERVER/app/download\nSCRIPT_DIR=$HOME/.sourcerer\nJAR_DIR=$SCRIPT_DIR\n\nif [ -f $SCRIPT_DIR/sourcerer ] ; then\n read -p \"Previous version of sourcerer is detected. Reinstall it? [Y/n] \" yesno < /dev/tty\n if [ \"$yesno\" ] && [ \"$yesno\" = \"n\" ] ; then\n echo \"Exiting\"\n exit\n fi\nfi\n\nmkdir -p $SCRIPT_DIR\nmkdir -p $JAR_DIR\ncurl -s $DOWNLOAD_URL > $JAR_DIR/sourcerer.jar\n\ncat < $SCRIPT_DIR/sourcerer\n#!/usr/bin/env bash\n# Copyright 2017 Sourcerer, Inc. All Rights Reserved.\n# License: MIT, https://github.com/sourcerer-io/sourcerer-app/blob/master/LICENSE.md\n# Source code: https://github.com/sourcerer-io\n\nif [ \"\\$1\" = \"--uninstall\" ] ; then\n read -p \"The script will uninstall sourcerer app. Proceed? [Y/n] \" yesno < /dev/tty\n if [ \"$yesno\" ] && [ \"$yesno\" = \"n\" ] ; then\n echo \"Exiting\"\n exit\n fi\n\n rm -f /usr/local/bin/sourcerer\n rm $SCRIPT_DIR/sourcerer\n rm -r $JAR_DIR\n\n echo \"Done!\"\n exit\nfi\n\nVERSION=0\nif which java > /dev/null ; then\n VERSION_STR=\\$(java -version 2>&1 | awk -F '\"' '/version/ {print \\$2}')\n MAJOR_VERSION=\\$(echo \\$VERSION_STR | cut -d. -f1)\n MINOR_VERSION=\\$(echo \\$VERSION_STR | cut -d. -f2)\n\n if [[ \"\\$MAJOR_VERSION\" = \"10\" || \"\\$MAJOR_VERSION\" > \"10\" ]]; then # Format: 10\n VERSION=10\n elif [[ \"\\$MAJOR_VERSION\" = \"9\" ]]; then # Format: 9.0.1\n VERSION=9\n elif [[ \"\\$MAJOR_VERSION\" = \"1\" && \"\\$MINOR_VERSION\" = \"8\" ]]; then # Format: 1.8.1\n VERSION=8\n else\n echo \"Installed $VERSION_STR version of Java is not supported.\"\n fi\nfi\n\nif [ \\$VERSION = 0 ] ; then\n if [ `uname` = \"Darwin\" ] ; then\n echo \"Sourcerer requires JDK 8+ installed on the system. You can download it from:\"\n echo \"http://www.oracle.com/technetwork/java/javase/downloads/jdk8-downloads-2133151.html\"\n else\n echo \"Sourcerer requires JRE 8+ installed on the system. You can download it from:\"\n echo \"http://www.oracle.com/technetwork/java/javase/downloads/jre8-downloads-2133155.html\"\n fi\n exit 1\nfi\n\n# Java 9 and 10 requires additional parameters.\nif [[ \\$VERSION = 9 ]] ; then\n java --add-modules java.activation --add-opens java.base/java.nio=ALL-UNNAMED -jar $JAR_DIR/sourcerer.jar \"\\$@\"\nelif [[ \\$VERSION = 10 ]] ; then\n java --add-opens java.base/java.nio=ALL-UNNAMED -jar $JAR_DIR/sourcerer.jar \"\\$@\"\nelse\n java -jar $JAR_DIR/sourcerer.jar \"\\$@\"\nfi\nEOF\n\nchmod +x $SCRIPT_DIR/sourcerer\n\n{\n rm -f /usr/local/bin/sourcerer 2> /dev/null &&\n ln -s $SCRIPT_DIR/sourcerer /usr/local/bin/sourcerer 2> /dev/null &&\n echo 'Done!' &&\n echo 'Run sourcerer to start hashing your repos!'\n} || {\n echo 'We installed app to ~/.sourcerer/sourcerer.'\n echo 'You can add it to $PATH or run specified command to finish installation:'\n echo \"sudo ln -s $SCRIPT_DIR/sourcerer /usr/local/bin/sourcerer\"\n echo 'Then run sourcerer to start hashing your repos!'\n}\n" }, { "path": "src/main/kotlin/app/Analytics.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app\n\nimport com.github.kittinunf.fuel.core.FuelError\nimport com.github.kittinunf.fuel.core.FuelManager\nimport com.github.kittinunf.fuel.core.Method\nimport com.github.kittinunf.fuel.core.Request\nimport com.google.protobuf.InvalidProtocolBufferException\nimport java.security.InvalidParameterException\n\ntypealias Param = Pair\n\n/**\n * Google Analytics events tracking.\n */\nobject Analytics {\n private val IS_ENABLED = BuildConfig.IS_GA_ENABLED\n private val BASE_PATH = BuildConfig.GA_BASE_PATH\n private val BASE_URL = \"/virtual/app/\"\n private val PROTOCOL_VERSION = \"1\"\n private val TRACKING_ID = BuildConfig.GA_TRACKING_ID\n private val DATA_SOURCE = \"app\"\n\n private val HIT_PAGEVIEW = \"pageview\"\n private val HIT_EXCEPTION = \"exception\"\n\n private val fuelManager = FuelManager()\n\n var uuid: String = \"\" // Should be set on start of the app.\n var username: String = \"\" // Should be set on successful authorization.\n\n init {\n fuelManager.basePath = BASE_PATH\n }\n\n private fun post(params: List): Request {\n return fuelManager.request(Method.POST, \"/collect\", params)\n }\n\n /**\n * Google Analytics Measurement Protocol is used to track events.\n * User iteration data is sent to GA endpoint via POST request.\n * Events (or hits) mapped to virtual urls with \"Data Source\" parameter.\n * Used parameters:\n * - v: Protocol Version (Required)\n * - tid: Tracking ID - used to specify GA account (Required)\n * - cid: Client ID - anonymous client id (UUID type 4)\n * - uid: User ID - username\n * - t: Hit Type - type of event\n * - dp: Document Path - virtual url\n */\n fun trackEvent(event: String, params: List = listOf()) {\n if (!IS_ENABLED || (username.isEmpty() && uuid.isEmpty())) {\n return\n }\n\n val idParams = mutableListOf()\n if (uuid.isNotEmpty()) {\n idParams.add(\"cid\" to uuid)\n }\n if (username.isNotEmpty()) {\n idParams.add(\"uid\" to username)\n }\n\n val defaultParams = listOf(\"v\" to PROTOCOL_VERSION,\n \"tid\" to TRACKING_ID,\n \"ds\" to DATA_SOURCE,\n \"t\" to HIT_PAGEVIEW,\n \"dp\" to BASE_URL + event)\n\n try {\n // Send event to GA with united params.\n val (_, _, result) = post(params +\n defaultParams.filter { !params.contains(it) } +\n idParams).responseString()\n val (_, e) = result\n if (e != null) { throw e }\n } catch (e: Throwable) {\n Logger.error(e, \"Error while sending GA report\", logOnly = true)\n }\n }\n\n fun trackError(e: Throwable? = null) {\n val url = if (e != null) getErrorUrl(e) else \"\"\n val separator = if (url.isNotEmpty()) \"/\" else \"\"\n trackEvent(\"error\" + separator + url, listOf(\"t\" to HIT_EXCEPTION))\n }\n\n private fun getErrorUrl(e: Throwable): String {\n // Mapping for request exceptions.\n when (e) {\n is FuelError -> return \"request\"\n is InvalidParameterException -> return \"request/parsing\"\n is InvalidProtocolBufferException -> return \"request/parsing\"\n }\n\n // Get concrete class of exception name removing all common parts.\n val name = e.javaClass.simpleName.replace(\"Exception\", \"\")\n .replace(\"Error\", \"\")\n .replace(\"Throwable\", \"\")\n\n if (name.length == 0 || name.length == 1) {\n return name\n }\n\n // Divide CamelCased words in class name by dashes.\n val nameCapitalized = name.toUpperCase()\n var url = name[0].toString()\n for (i in 1..name.length - 1) {\n if (name[i] == nameCapitalized[i]) {\n url += \"-\"\n }\n url += name[i]\n }\n\n return url.toLowerCase()\n }\n}\n" }, { "path": "src/main/kotlin/app/FactCodes.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n\npackage app\n\nobject FactCodes {\n val COMMIT_DAY_WEEK = 1 // Day of week fun fact and graph.\n val COMMIT_DAY_TIME = 2 // Day time fun fact.\n\n val COMMIT_LINE_NUM_AVG = 8 // Average number of lines per commit fun fact.\n val COMMIT_NUM = 9 // Used for averaging COMMIT_LINE_NUM_AVG between repos.\n // A map of line numbers to commits number. Used in a commit histogram.\n val COMMIT_NUM_TO_LINE_NUM = 12\n val COMMIT_SHARE = 16 // Used for commit share chart.\n val COMMIT_SHARE_REPO_AVG = 17 // Used for commit share chart.\n val LINE_LONGEVITY = 3 // Used for longevity graph.\n val LINE_LONGEVITY_REPO = 4 // Used for longevity graph.\n val LINE_LEN_AVG = 10 // Average length of line fun fact.\n val LINE_NUM = 11 // Used for averaging LINE_LEN_AVG between repos.\n val REPO_DATE_START = 5 // Repo summary info. Date of first contribution.\n val REPO_DATE_END = 6 // Repo summary info. Date of last contribution.\n val REPO_TEAM_SIZE = 7 // Repo summary info. Number of contributors.\n val VARIABLE_NAMING = 13 // Variables naming fun fact.\n val VARIABLE_NAMING_SNAKE_CASE = 0\n val VARIABLE_NAMING_CAMEL_CASE = 1\n val VARIABLE_NAMING_OTHER = 2\n val INDENTATION = 14\n val INDENTATION_TABS = 0\n val INDENTATION_SPACES = 1\n\n val COLLEAGUES = 15\n}\n" }, { "path": "src/main/kotlin/app/Logger.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app\n\nimport io.sentry.Sentry\nimport io.sentry.context.Context\nimport io.sentry.event.Breadcrumb\nimport io.sentry.event.UserBuilder\nimport io.sentry.event.BreadcrumbBuilder\nimport java.util.*\n\n\n/**\n * Singleton class that logs events of different levels.\n */\nobject Logger {\n object Events {\n val START = \"start\"\n val AUTH = \"auth\"\n val CONFIG_SETUP = \"config/setup\"\n val CONFIG_CHANGED = \"config/changed\"\n val HASHING_REPO_SUCCESS = \"hashing/repo/success\"\n val HASHING_SUCCESS = \"hashing/success\"\n val EXIT = \"exit\"\n }\n\n /**\n * Current log level. All that higher than this level will not be displayed.\n */\n @kotlin.PublishedApi\n internal val LEVEL : Int\n\n /**\n * Error level.\n */\n @kotlin.PublishedApi\n internal const val ERROR = 0\n\n /**\n * Warning level.\n */\n @kotlin.PublishedApi\n internal const val WARN = 1\n\n /**\n * Information level.\n */\n @kotlin.PublishedApi\n internal const val INFO = 2\n\n /**\n * Debug level.\n */\n @kotlin.PublishedApi\n internal const val DEBUG = 3\n\n /**\n * Trace level. For extremely detailed and high volume debug logs.\n */\n @kotlin.PublishedApi\n internal const val TRACE = 4\n\n const val SILENT = BuildConfig.SILENT_USER_OUTPUT\n const val SENTRY_ENABLED = BuildConfig.SENTRY_ENABLED\n\n /**\n * Print stack trace on error log.\n */\n private const val PRINT_STACK_TRACE = BuildConfig.PRINT_STACK_TRACE\n\n /**\n * Context of Sentry error reporting software for adding info.\n */\n private val sentryContext: Context?\n\n /**\n * Username used for error reporting.\n */\n var username: String? = null\n set(value) {\n if (SENTRY_ENABLED) {\n sentryContext?.user = UserBuilder().setUsername(value).build()\n }\n Analytics.username = value ?: \"\"\n }\n\n var uuid: String? = null\n set(value) {\n Analytics.uuid = value ?: \"\"\n }\n\n init {\n if (SENTRY_ENABLED) {\n Sentry.init(BuildConfig.SENTRY_DSN)\n sentryContext = Sentry.getContext()\n addTags()\n } else {\n sentryContext = null\n }\n LEVEL = configLevelValue()\n }\n\n private fun configLevelValue() : Int {\n val a = mapOf(\"trace\" to TRACE, \"debug\" to DEBUG, \"info\" to INFO,\n \"warn\" to WARN, \"error\" to ERROR)\n return a.getValue(BuildConfig.LOG_LEVEL)\n }\n\n /**\n * Utils.\n */\n private fun Double.format(digits: Int, digitsFloating: Int) =\n java.lang.String.format(\"%${digits}.${digitsFloating}f\", this)\n\n private fun generateIndent(num: Int): String {\n return 0.rangeTo(num).fold(\"\") { ind, _ -> ind + \" \" }\n }\n\n /**\n * CLI messages and pretty printing.\n */\n fun print(message: Any, indentLine: Boolean = false) {\n if (!SILENT) {\n print(message.toString(), indentLine)\n }\n }\n\n fun print(message: String, indentLine: Boolean = false) {\n if (!SILENT) {\n if (indentLine) {\n println()\n }\n println(message)\n }\n }\n\n fun printCommit(commitMessage: String, commitHash: String,\n percents: Double) {\n if (!SILENT) {\n val percentsStr = percents.format(6, 2)\n val hash = commitHash.substring(0, 7)\n val messageTrim = if (commitMessage.length > 59) {\n commitMessage.substring(0, 56).plus(\"...\")\n } else commitMessage\n println(\" [$percentsStr%] * $hash $messageTrim\")\n }\n }\n\n private val commitDetailIndent = generateIndent(10) + \"|\" +\n generateIndent(8)\n fun printCommitDetail(message: String) {\n if (!SILENT) {\n val messageTrim = if (message.length > 59) {\n message.substring(0, 56).plus(\"...\")\n } else message\n println(commitDetailIndent + messageTrim)\n }\n }\n\n /**\n * Log error message with exception info.\n * Don't log private information with this method.\n *\n * @property e the exception if presented.\n * @property message the message for user and logs.\n * @property logOnly only log to console, no additional actions.\n */\n fun error(e: Throwable, message: String = \"\", logOnly: Boolean = false) {\n val finalMessage = if (message.isNotBlank()) { message + \": \" }\n else { \"\" } + e.message\n if (LEVEL >= ERROR) {\n println(\"[e] $finalMessage\")\n if (PRINT_STACK_TRACE) {\n e.printStackTrace()\n }\n }\n if (!logOnly) {\n Analytics.trackError(e)\n capture(e)\n }\n addBreadcrumb(finalMessage, Breadcrumb.Level.ERROR)\n }\n\n /**\n * Log warning message. Don't log private information with this method.\n */\n inline fun warn(message: () -> String) {\n val msg = message()\n if (LEVEL >= WARN) {\n println(\"[w] $msg.\")\n }\n addBreadcrumb(msg, Breadcrumb.Level.WARNING)\n }\n\n /**\n * Log information message. Don't log private information with this method.\n */\n inline fun info(event: String = \"\", message: () -> String) {\n val msg = message()\n if (LEVEL >= INFO) {\n println(\"[i] $msg.\")\n }\n if (event.isNotBlank()) {\n Analytics.trackEvent(event)\n }\n addBreadcrumb(msg, Breadcrumb.Level.INFO)\n }\n\n /**\n * Log debug message.\n */\n inline fun debug(message: () -> String) {\n if (LEVEL >= DEBUG) {\n println(\"[d] ${message()}.\")\n }\n }\n\n /**\n * Log trace message.\n */\n inline fun trace(message: () -> String) {\n if (LEVEL >= TRACE) {\n println(\"[t] ${message()}.\")\n }\n }\n\n val isTrace: Boolean\n inline get() = LEVEL >= TRACE\n\n @kotlin.PublishedApi\n internal fun addBreadcrumb(message: String, level: Breadcrumb.Level) {\n if (SENTRY_ENABLED) {\n sentryContext?.recordBreadcrumb(BreadcrumbBuilder()\n .setMessage(message)\n .setLevel(level)\n .setTimestamp(Date())\n .build())\n }\n }\n\n private fun addTags() {\n if (SENTRY_ENABLED) {\n val default = \"unavailable\"\n val osName = System.getProperty(\"os.name\", default)\n val osVersion = System.getProperty(\"os.version\", default)\n val javaVendor = System.getProperty(\"java.vendor\", default)\n val javaVersion = System.getProperty(\"java.version\", default)\n\n sentryContext?.addTag(\"environment\", BuildConfig.ENV)\n sentryContext?.addTag(\"log-level\", BuildConfig.LOG_LEVEL)\n sentryContext?.addTag(\"version\", BuildConfig.VERSION)\n sentryContext?.addTag(\"version-code\", BuildConfig.VERSION_CODE\n .toString())\n sentryContext?.addTag(\"os-name\", osName)\n sentryContext?.addTag(\"os-version\", osVersion)\n sentryContext?.addTag(\"java-vendor\", javaVendor)\n sentryContext?.addTag(\"java-version\", javaVersion)\n }\n }\n\n private fun capture(e: Throwable) {\n if (SENTRY_ENABLED) {\n Sentry.capture(e)\n }\n }\n}\n" }, { "path": "src/main/kotlin/app/Main.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app\n\nimport app.api.ServerApi\nimport app.config.FileConfigurator\nimport app.model.LocalRepo\nimport app.ui.ConsoleUi\nimport app.utils.CommandConfig\nimport app.utils.CommandAdd\nimport app.utils.CommandList\nimport app.utils.CommandRemove\nimport app.utils.FileHelper.toPath\nimport app.utils.Options\nimport app.utils.PasswordHelper\nimport app.utils.RepoHelper\nimport app.utils.UiHelper\nimport com.beust.jcommander.JCommander\nimport com.beust.jcommander.MissingCommandException\nimport java.nio.file.Files\nimport java.nio.file.Path\nimport java.security.GeneralSecurityException\nimport javax.net.ssl.TrustManager\nimport javax.net.ssl.X509TrustManager\nimport java.security.cert.X509Certificate\nimport javax.net.ssl.HttpsURLConnection\nimport javax.net.ssl.SSLContext\n\nfun main(argv : Array) {\n Thread.setDefaultUncaughtExceptionHandler { _, e: Throwable ->\n Logger.error(e, \"Uncaught exception\")\n }\n if (BuildConfig.ENV != \"production\") {\n disableSslChecks()\n }\n Main(argv)\n}\n\nclass Main(argv: Array) {\n private val configurator = FileConfigurator()\n private val api = ServerApi(configurator)\n\n init {\n Logger.uuid = configurator.getUuidPersistent()\n Logger.info(Logger.Events.START) { \"App started\" }\n\n val options = Options()\n val commandAdd = CommandAdd()\n val commandConfig = CommandConfig()\n val commandList = CommandList()\n val commandRemove = CommandRemove()\n val jc: JCommander = JCommander.newBuilder()\n .programName(\"sourcerer\") // Used for usage method.\n .addObject(options)\n .addCommand(commandAdd.name, commandAdd)\n .addCommand(commandConfig.name, commandConfig)\n .addCommand(commandList.name, commandList)\n .addCommand(commandRemove.name, commandRemove)\n .build()\n\n try {\n jc.parse(*argv)\n options.password = PasswordHelper.hashPassword(options.password)\n configurator.setOptions(options)\n\n if (options.help) {\n showHelp(jc)\n } else if (options.setup) {\n doSetup()\n } else when (jc.parsedCommand) {\n commandAdd.name -> doAdd(commandAdd)\n commandConfig.name -> doConfig(commandConfig)\n commandList.name -> doList()\n commandRemove.name -> doRemove(commandRemove)\n else -> startUi()\n }\n } catch (e: MissingCommandException) {\n Logger.warn { \"No such command: ${e.unknownCommand}\" }\n }\n\n Logger.info(Logger.Events.EXIT) { \"App finished\" }\n }\n\n private fun startUi() {\n ConsoleUi(api, configurator)\n }\n\n private fun doAdd(commandAdd: CommandAdd) {\n val paths = commandAdd.paths\n paths.forEach {\n val path = it.toPath()\n val hashAll = commandAdd.hashAll\n if (commandAdd.recursive) {\n Files.walk(path)\n .filter { p -> RepoHelper.isValidGitRepo(p) }\n .forEach { p -> processPath(p, hashAll) }\n } else {\n processPath(path, hashAll)\n }\n }\n }\n\n private fun processPath(path: Path, hashAll: Boolean) {\n if (RepoHelper.isValidRepo(path)) {\n val localRepo = LocalRepo(path.toString())\n localRepo.hashAllContributors = hashAll\n configurator.addLocalRepoPersistent(localRepo)\n configurator.saveToFile()\n Logger.print(\"Added git repository at $path.\")\n Logger.info(Logger.Events.CONFIG_CHANGED) { \"Config changed\" }\n } else {\n Logger.warn { \"No valid git repository found at specified path $path\" }\n }\n }\n\n private fun doConfig(commandOptions: CommandConfig) {\n val (key, value) = commandOptions.pair\n\n if (!arrayListOf(\"username\", \"password\").contains(key)) {\n Logger.warn { \"No such key $key\" }\n return\n }\n\n when (key) {\n \"username\" -> configurator.setUsernamePersistent(value)\n \"password\" -> configurator.setPasswordPersistent(value)\n }\n\n configurator.saveToFile()\n\n Logger.info(Logger.Events.CONFIG_CHANGED) { \"Config changed\" }\n }\n\n private fun doList() {\n RepoHelper.printRepos(configurator.getLocalRepos(),\n \"Tracked repositories:\",\n \"No tracked repositories\")\n }\n\n private fun doRemove(commandRemove: CommandRemove) {\n val path = commandRemove.path\n // Don't validate because repository may be deleted already.\n if (path != null) {\n configurator.removeLocalRepoPersistent(LocalRepo(path))\n configurator.saveToFile()\n Logger.print(\"Repository removed from tracking list.\")\n\n Logger.info(Logger.Events.CONFIG_CHANGED) { \"Config changed\" }\n } else {\n Logger.print(\"Repository not found in tracking list.\")\n }\n }\n\n private fun doSetup() {\n if (!configurator.isFirstLaunch()) {\n if (UiHelper.confirm(\"Are you sure that you want to setup \"\n + \"Sourcerer again?\", defaultIsYes = false)) {\n configurator.resetAndSave()\n }\n }\n startUi()\n }\n\n private fun showHelp(jc: JCommander) {\n Logger.print(\"Sourcerer hashes your git repositories into intelligent \"\n + \"engineering profiles.\")\n Logger.print(\"If you don't have an account, please, proceed to \" +\n \"https://sourcerer.io/join\")\n Logger.print(\"More info at https://sourcerer.io and \" +\n \"https://github.com/sourcerer-io\")\n jc.usage() // Will show detailed info about usage based on annotations.\n }\n}\n\nfun disableSslChecks() {\n // Create a trust manager that does not validate certificate chains.\n val trustAllCerts = arrayOf(object : X509TrustManager {\n override fun getAcceptedIssuers(): Array {\n return arrayOf()\n }\n override fun checkClientTrusted(certs: Array,\n authType: String) {}\n override fun checkServerTrusted(certs: Array,\n authType: String) {}\n })\n\n // Install the all-trusting trust manager.\n try {\n val sc = SSLContext.getInstance(\"SSL\")\n sc.init(null, trustAllCerts, java.security.SecureRandom())\n HttpsURLConnection.setDefaultSSLSocketFactory(sc.getSocketFactory())\n } catch (e: GeneralSecurityException) {}\n\n // Skip server name checking.\n HttpsURLConnection.setDefaultHostnameVerifier { _, _ -> true }\n}\n" }, { "path": "src/main/kotlin/app/api/Api.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.api\n\nimport app.model.*\n\ninterface Api {\n companion object {\n val OUT_OF_DATE = 1\n val STATUS_CLONING = 80\n val PROCESS_STATUS_START = 100\n val PROCESS_STATUS_COMPLETE = 200\n val PROCESS_STATUS_FAIL = 1000\n val CODE_SUCCESS = 0\n val PROCESS_ERROR_TOO_MUCH_COMMITS = 4\n val PROCESS_ERROR_NO_COMMITS = 5\n val PROCESS_ERROR_PROCESSOR = 6\n val PROCESS_ERROR_EMPTY_REPO = 8\n val PROCESS_ERROR_NO_ACCESS = 9\n }\n\n fun authorize(): Result\n fun getUser(): Result\n fun postUser(user: User): Result\n fun postRepo(repo: Repo): Result\n fun postCommits(commitsList: List): Result\n fun deleteCommits(commitsList: List): Result\n fun postFacts(factsList: List): Result\n fun postAuthors(authorsList: List): Result\n fun postProcessCreate(requestNumEntries: Int): Result\n fun postProcess(processEntries: List): Result\n fun postAuthorDistances(authorDistanceList: List):\n Result\n}\n" }, { "path": "src/main/kotlin/app/api/ApiError.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.api\n\nimport app.Logger\nimport app.model.Error\nimport app.model.Errors\nimport com.github.kittinunf.fuel.core.FuelError\nimport com.google.protobuf.InvalidProtocolBufferException\nimport java.nio.charset.Charset\nimport java.security.InvalidParameterException\n\nclass ApiError(exception: Exception) : Exception(exception.message) {\n companion object {\n private val AUTH_ERROR_CODES = listOf(401, 403)\n }\n\n // Response content.\n var httpStatusCode: Int = 0\n var httpResponseMessage: String = \"\"\n var httpBodyMessage: String = \"\"\n\n // Server errors from response.\n var serverErrors = listOf()\n\n // Type of errors.\n var isParseError = false\n var isAuthError: Boolean = false\n get() = AUTH_ERROR_CODES.contains(httpStatusCode)\n\n constructor(fuelError: FuelError) : this(fuelError as Exception) {\n httpStatusCode = fuelError.response.statusCode\n httpResponseMessage = fuelError.response.responseMessage\n if (fuelError.response.headers[\"Content-Type\"]\n ?.contains(\"application/octet-stream\") == true) {\n try {\n serverErrors = Errors(fuelError.response.data).errors\n } catch (e: Exception) {\n Logger.error(e, \"Error while parsing errors from server\")\n }\n } else {\n httpBodyMessage = fuelError.response.data\n .toString(Charset.defaultCharset())\n }\n }\n\n constructor(parseException: InvalidProtocolBufferException) :\n this(parseException as Exception) {\n isParseError = true\n }\n\n constructor(parseException: InvalidParameterException) :\n this(parseException as Exception) {\n isParseError = true\n }\n\n fun isWithServerCode(serverErrorCode: Int): Boolean {\n return serverErrors.find { error ->\n error.code == serverErrorCode } != null\n }\n}\n\nfun ApiError?.ifNotNullThrow() {\n if (this != null) {\n throw this\n }\n}\n\nfun ApiError?.isWithServerCode(serverErrorCode: Int): Boolean {\n if (this != null) {\n return this.isWithServerCode(serverErrorCode)\n }\n return false\n}\n" }, { "path": "src/main/kotlin/app/api/MockApi.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.api\n\nimport app.Logger\nimport app.model.*\n\nclass MockApi( // GET requests.\n var mockUser: User = User(),\n var mockRepo: Repo = Repo(),\n var mockProcessEntries: List = listOf()) : Api {\n // POST requests.\n // In case of multiple requests.\n var receivedRepos: MutableList = mutableListOf()\n var receivedAddedCommits: MutableList = mutableListOf()\n var receivedFacts: MutableList = mutableListOf()\n var receivedAuthors: MutableList = mutableListOf()\n var receivedUsers: MutableList = mutableListOf()\n var receivedProcessCreate: MutableList = mutableListOf()\n var receivedProcess: MutableList = mutableListOf()\n var receivedDistances: MutableList = mutableListOf()\n\n // DELETE requests.\n var receivedDeletedCommits: MutableList = mutableListOf()\n\n override fun authorize(): Result {\n Logger.debug { \"MockApi: authorize request\" }\n return Result()\n }\n\n override fun getUser(): Result {\n Logger.debug { \"MockApi: getUser request\" }\n return Result(mockUser)\n }\n\n override fun postUser(user: User): Result {\n Logger.debug { \"MockApi: postUser request\" }\n receivedUsers.add(user)\n return Result()\n }\n\n override fun postRepo(repo: Repo): Result {\n Logger.debug { \"MockApi: postRepo request\" }\n receivedRepos.add(repo)\n return Result(mockRepo)\n }\n\n override fun postCommits(commitsList: List): Result {\n Logger.debug {\n \"MockApi: postCommits request (${commitsList.size} commits)\"\n }\n receivedAddedCommits.addAll(commitsList)\n return Result()\n }\n\n override fun deleteCommits(commitsList: List): Result {\n Logger.debug {\n \"MockApi: deleteCommits request (${commitsList.size} commits)\" }\n receivedDeletedCommits.addAll(commitsList)\n return Result()\n }\n\n override fun postFacts(factsList: List): Result {\n Logger.debug { \"MockApi: postFacts request (${factsList.size} facts)\" }\n receivedFacts.addAll(factsList)\n return Result()\n }\n\n override fun postAuthors(authorsList: List): Result {\n Logger.debug { \"MockApi: postAuthors request (${authorsList.size} \" +\n \"stats)\" }\n receivedAuthors.addAll(authorsList)\n return Result()\n }\n\n override fun postProcessCreate(requestNumEntries: Int): Result {\n Logger.debug { \"MockApi: postProcessCreate request \" +\n \"($requestNumEntries entries requested)\" }\n receivedProcessCreate.add(\n Process(requestNumEntries = requestNumEntries))\n return Result(Process(entries = mockProcessEntries))\n }\n\n override fun postProcess(processEntries: List): Result {\n Logger.debug { \"MockApi: postProcess request (${processEntries.size} \" +\n \"entries updated)\" }\n receivedProcess.add(Process(entries = processEntries))\n return Result()\n }\n\n override fun postAuthorDistances(authorDistanceList:\n List): Result {\n Logger.debug { \"MockApi: postAuthorDistances request (${authorDistanceList\n .size} distances)\" }\n receivedDistances.addAll(authorDistanceList)\n return Result()\n }\n}\n" }, { "path": "src/main/kotlin/app/api/Result.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.api\n\ndata class Result (val data: T? = null, val error: ApiError? = null) {\n fun getOrThrow(): T {\n if (error == null) {\n return data!!\n }\n throw error\n }\n\n fun onErrorThrow() {\n if (error != null) {\n throw error\n }\n }\n}\n" }, { "path": "src/main/kotlin/app/api/ServerApi.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.api\n\nimport app.BuildConfig\nimport app.Logger\nimport app.config.Configurator\nimport app.model.*\nimport com.github.kittinunf.fuel.core.FuelManager\nimport com.github.kittinunf.fuel.core.Method\nimport com.github.kittinunf.fuel.core.Request\nimport com.github.kittinunf.fuel.core.Response\nimport com.google.protobuf.InvalidProtocolBufferException\nimport java.security.InvalidParameterException\n\nclass ServerApi (private val configurator: Configurator) : Api {\n companion object {\n private val HEADER_VERSION_CODE = \"app-version-code\"\n private val HEADER_CONTENT_TYPE = \"Content-Type\"\n private val HEADER_CONTENT_TYPE_PROTO = \"application/octet-stream\"\n private val HEADER_COOKIE = \"Cookie\"\n private val HEADER_SET_COOKIE = \"Set-Cookie\"\n private val KEY_TOKEN = \"Token=\"\n }\n\n val fuelManager = FuelManager()\n private var token = \"\"\n\n private fun cookieRequestInterceptor() = { req: Request ->\n if (token.isNotEmpty()) {\n req.header(Pair(HEADER_COOKIE, KEY_TOKEN + token))\n }\n req\n }\n\n private fun cookieResponseInterceptor() = { _: Request, res: Response ->\n val newToken = res.headers[HEADER_SET_COOKIE]\n ?.find { it.startsWith(KEY_TOKEN) }\n if (newToken != null && newToken.isNotBlank()) {\n token = newToken.substringAfter(KEY_TOKEN).substringBefore(';')\n }\n res\n }\n\n init {\n fuelManager.basePath = BuildConfig.API_BASE_PATH\n fuelManager.addRequestInterceptor { cookieRequestInterceptor() }\n fuelManager.addResponseInterceptor { cookieResponseInterceptor() }\n }\n\n private val username\n get() = configurator.getUsername()\n\n private val password\n get() = configurator.getPassword()\n\n private fun post(path: String): Request {\n return fuelManager.request(Method.POST, path)\n }\n\n private fun get(path: String): Request {\n return fuelManager.request(Method.GET, path)\n }\n\n private fun delete(path: String): Request {\n return fuelManager.request(Method.DELETE, path)\n }\n\n private fun createRequestGetToken(): Request {\n return post(\"/auth\").authenticate(username, password)\n .header(getVersionCodeHeader())\n }\n\n private fun createRequestGetUser(): Request {\n return get(\"/user\")\n }\n\n private fun createRequestPostUser(user: User): Request {\n return post(\"/user\").header(getContentTypeHeader())\n .body(user.serialize())\n }\n\n private fun createRequestPostRepo(repo: Repo): Request {\n return post(\"/repo\").header(getContentTypeHeader())\n .body(repo.serialize())\n }\n\n private fun createRequestPostCommits(commits: CommitGroup): Request {\n return post(\"/commits\").header(getContentTypeHeader())\n .body(commits.serialize())\n }\n\n private fun createRequestDeleteCommits(commits: CommitGroup): Request {\n return delete(\"/commits\").header(getContentTypeHeader())\n .body(commits.serialize())\n }\n\n private fun createRequestPostFacts(facts: FactGroup): Request {\n return post(\"/facts\").header(getContentTypeHeader())\n .body(facts.serialize())\n }\n\n private fun createRequestPostAuthors(authors: AuthorGroup): Request {\n return post(\"/authors\").header(getContentTypeHeader())\n .body(authors.serialize())\n }\n\n private fun createRequestPostProcessCreate(process: Process): Request {\n return post(\"/process/create\").header(getContentTypeHeader())\n .body(process.serialize())\n }\n\n private fun createRequestPostProcess(process: Process): Request {\n return post(\"/process\").header(getContentTypeHeader())\n .body(process.serialize())\n }\n\n private fun createRequestPostAuthorDistances(distances:\n AuthorDistanceGroup): Request {\n return post(\"/distances\").header(getContentTypeHeader())\n .body(distances.serialize())\n }\n\n private fun makeRequest(request: Request,\n requestName: String,\n parser: (ByteArray) -> T): Result {\n var error: ApiError? = null\n var data: T? = null\n\n try {\n Logger.debug { \"Request $requestName initialized\" }\n val (_, res, result) = request.responseString()\n val (_, e) = result\n if (e == null) {\n Logger.debug { \"Request $requestName success\" }\n data = parser(res.data)\n } else {\n error = ApiError(e)\n }\n } catch (e: InvalidProtocolBufferException) {\n error = ApiError(e)\n } catch (e: InvalidParameterException) {\n error = ApiError(e)\n }\n\n return Result(data, error)\n }\n\n private fun getVersionCodeHeader(): Pair {\n return Pair(HEADER_VERSION_CODE, BuildConfig.VERSION_CODE.toString())\n }\n\n private fun getContentTypeHeader(): Pair {\n return Pair(HEADER_CONTENT_TYPE, HEADER_CONTENT_TYPE_PROTO)\n }\n\n override fun authorize(): Result {\n return makeRequest(createRequestGetToken(), \"getToken\", {})\n }\n\n override fun getUser(): Result {\n return makeRequest(createRequestGetUser(), \"getUser\",\n { body -> User(body) })\n }\n\n override fun postUser(user: User): Result {\n return makeRequest(createRequestPostUser(user), \"postUser\", {})\n }\n\n override fun postRepo(repo: Repo): Result {\n if (repo.rehash.isBlank()) {\n throw IllegalArgumentException()\n }\n\n return makeRequest(createRequestPostRepo(repo), \"getRepo\",\n { body -> Repo(body) })\n }\n\n override fun postCommits(commitsList: List): Result {\n val commits = CommitGroup(commitsList)\n return makeRequest(createRequestPostCommits(commits),\n \"postCommits\", {})\n }\n\n override fun deleteCommits(commitsList: List): Result {\n val commits = CommitGroup(commitsList)\n return makeRequest(createRequestDeleteCommits(commits),\n \"deleteCommits\", {})\n }\n\n override fun postFacts(factsList: List): Result {\n val facts = FactGroup(factsList)\n return makeRequest(createRequestPostFacts(facts), \"postFacts\", {})\n }\n\n override fun postAuthors(authorsList: List): Result {\n val authors = AuthorGroup(authorsList)\n return makeRequest(createRequestPostAuthors(authors), \"postAuthors\", {})\n }\n\n override fun postProcessCreate(requestNumEntries: Int): Result {\n val process = Process(requestNumEntries = requestNumEntries)\n return makeRequest(createRequestPostProcessCreate(process),\n \"postProcessCreate\", { body -> Process(body) })\n }\n\n override fun postProcess(processEntries: List): Result {\n // TODO(anatoly): Restrict possible status and error codes on CS.\n val process = Process(entries = processEntries)\n return makeRequest(createRequestPostProcess(process), \"postProcess\", {})\n }\n\n override fun postAuthorDistances(authorDistanceList: List):\n Result {\n val distances = AuthorDistanceGroup(authorDistanceList)\n return makeRequest(createRequestPostAuthorDistances(distances),\n \"postDistances\", {})\n }\n}\n" }, { "path": "src/main/kotlin/app/config/Config.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.config\n\nimport app.model.LocalRepo\nimport app.utils.Options\n\n/**\n * Config data class.\n */\nclass Config (\n var uuid: String = \"\",\n var username: String = \"\",\n var password: String = \"\",\n var localRepos: MutableSet = mutableSetOf()\n) {\n fun addRepo(repo: LocalRepo) {\n localRepos.remove(repo) // Fields may be updated.\n localRepos.add(repo)\n }\n\n fun removeRepo(repo: LocalRepo) {\n localRepos.remove(repo)\n }\n\n fun merge(config: Config): Config {\n if (config.username.isNotEmpty()) {\n username = config.username\n }\n if (config.password.isNotEmpty()) {\n password = config.password\n }\n if (config.localRepos.isNotEmpty()) {\n localRepos = config.localRepos\n }\n\n return this\n }\n\n fun merge(options: Options): Config {\n if (options.username.isNotEmpty()) {\n username = options.username\n }\n if (options.password.isNotEmpty()) {\n password = options.password\n }\n\n return this\n }\n}\n" }, { "path": "src/main/kotlin/app/config/Configurator.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.config\n\nimport app.model.LocalRepo\nimport app.model.User\nimport app.utils.Options\n\ninterface Configurator {\n fun setOptions(options: Options)\n fun getUsername(): String\n fun getPassword(): String\n fun isValidCredentials(): Boolean\n fun getLocalRepos(): List\n fun getUser(): User\n fun setUsernameCurrent(username: String)\n fun setPasswordCurrent(password: String)\n fun getUuidPersistent(): String\n fun setUsernamePersistent(username: String)\n fun setPasswordPersistent(password: String)\n fun addLocalRepoPersistent(localRepo: LocalRepo)\n fun removeLocalRepoPersistent(localRepo: LocalRepo)\n fun setUser(user: User)\n fun isFirstLaunch(): Boolean\n fun loadFromFile()\n fun saveToFile()\n fun resetAndSave()\n}\n" }, { "path": "src/main/kotlin/app/config/FileConfigurator.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.config\n\nimport app.Logger\nimport app.model.LocalRepo\nimport app.model.User\nimport app.utils.FileHelper\nimport app.utils.Options\nimport app.utils.PasswordHelper\nimport com.fasterxml.jackson.annotation.JsonAutoDetect.Visibility\nimport com.fasterxml.jackson.annotation.PropertyAccessor\nimport com.fasterxml.jackson.core.JsonParseException\nimport com.fasterxml.jackson.databind.JsonMappingException\nimport com.fasterxml.jackson.databind.ObjectMapper\nimport com.fasterxml.jackson.dataformat.yaml.YAMLFactory\nimport com.fasterxml.jackson.module.kotlin.KotlinModule\nimport java.io.IOException\nimport java.nio.file.Files\nimport java.nio.file.InvalidPathException\nimport java.nio.file.NoSuchFileException\nimport java.util.UUID\n\n/**\n * Singleton class that manage configs and CLI options.\n */\nclass FileConfigurator : Configurator {\n /**\n * Persistent configuration file name.\n */\n private val CONFIG_FILE_NAME = \"config.yaml\"\n\n // Config levels are presented in priority decreasing order.\n\n /**\n * Configuration based on CLI arguments or temporary user entered data.\n */\n private var current: Config = Config()\n\n /**\n * Persistent configuration saved in config file in YAML format.\n */\n private var persistent: Config = Config()\n\n /**\n * Default configuration.\n */\n private val default: Config = Config()\n\n /**\n * Merger of all configuration levels. Is used to get properties.\n */\n private val config: Config\n get() = default.merge(persistent).merge(current)\n\n /**\n * Command-line arguments. Updates [current] on set.\n */\n private var options: Options = Options()\n\n /**\n * Used to temporarily save list of repos that known by server.\n */\n private var user: User = User()\n\n /**\n * Jackson's ObjectMapper.\n */\n private val mapper = createMapper()\n\n /**\n * Initializer that loads persistent config.\n */\n init {\n loadFromFile()\n assignUuidIfMissing()\n }\n\n /**\n * Generates UUID for analytics on install.\n */\n private fun assignUuidIfMissing() {\n if (persistent.uuid.isNotEmpty()) {\n return\n }\n persistent.uuid = UUID.randomUUID().toString()\n }\n\n /**\n * Creates and setups Jackson's ObjectMapper.\n */\n private fun createMapper(): ObjectMapper {\n return ObjectMapper(YAMLFactory()) // Enable YAML parsing.\n // Map only fields (not getters, etc).\n .setVisibility(PropertyAccessor.ALL, Visibility.NONE)\n .setVisibility(PropertyAccessor.FIELD, Visibility.ANY)\n .registerModule(KotlinModule()) // Enable Kotlin support.\n }\n\n override fun setOptions(options: Options) {\n current.merge(options)\n this.options = options\n }\n\n /**\n * Gets username from merger of all configuration levels.\n */\n override fun getUsername(): String {\n return config.username\n }\n\n /**\n * Gets hashed password from merger of all configuration levels.\n */\n override fun getPassword(): String {\n return config.password\n }\n\n /**\n * Checks for non empty credentials from merger of all configuration levels.\n */\n override fun isValidCredentials(): Boolean {\n return config.username.isNotEmpty() && config.password.isNotEmpty()\n }\n\n /**\n * Gets list of repos from merger of all configuration levels.\n */\n override fun getLocalRepos(): List {\n return config.localRepos.toList()\n }\n\n /**\n * Gets temprorary saved user information.\n */\n override fun getUser(): User {\n return user\n }\n\n /**\n * Sets username to current launch temprorary config.\n */\n override fun setUsernameCurrent(username: String) {\n current.username = username\n }\n\n /**\n * Sets and hashes password to current launch temprorary config.\n */\n override fun setPasswordCurrent(password: String) {\n current.password = PasswordHelper.hashPassword(password)\n }\n\n /**\n * Gets UUID.\n */\n override fun getUuidPersistent(): String {\n return persistent.uuid\n }\n\n /**\n * Sets username to persistent config. Use [saveToFile] to save.\n */\n override fun setUsernamePersistent(username: String) {\n persistent.username = username\n }\n\n /**\n * Sets and hashes password to persistent config. Use [saveToFile] to save.\n */\n override fun setPasswordPersistent(password: String) {\n persistent.password = PasswordHelper.hashPassword(password)\n }\n\n /**\n * Add repo to persistent config. Use [saveToFile] to save.\n */\n override fun addLocalRepoPersistent(localRepo: LocalRepo) {\n persistent.addRepo(localRepo)\n }\n\n /**\n * Remove repo from persistent config. Use [saveToFile] to save.\n */\n override fun removeLocalRepoPersistent(localRepo: LocalRepo) {\n persistent.removeRepo(localRepo)\n }\n\n /**\n * Temporarily sets info about user.\n */\n override fun setUser(user: User) {\n this.user = user\n }\n\n /**\n * Defines whether this is the first run. If any fields are defined then no.\n */\n override fun isFirstLaunch(): Boolean {\n return persistent.password.isEmpty()\n && persistent.username.isEmpty()\n && persistent.localRepos.isEmpty()\n }\n\n /**\n * Loads [persistent] configuration from config file.\n */\n override fun loadFromFile() {\n // Сonfig initialization in case an exception is thrown.\n var loadConfig = Config()\n\n try {\n loadConfig = Files.newBufferedReader(FileHelper\n .getPath(CONFIG_FILE_NAME)).use {\n mapper.readValue(it, Config::class.java)\n }\n } catch (e: IOException) {\n if (e is NoSuchFileException){\n Logger.warn { \"No config file found\" }\n } else {\n Logger.error(e, \"Cannot access config file\")\n }\n } catch (e: SecurityException) {\n Logger.error(e, \"Cannot access config file\")\n } catch (e: InvalidPathException) {\n Logger.error(e, \"Cannot access config file\")\n } catch (e: JsonParseException) {\n Logger.error(e, \"Cannot parse config file\")\n } catch (e: JsonMappingException) {\n Logger.error(e, \"Cannot parse config file\")\n } catch (e: IllegalStateException) {\n Logger.error(e, \"Cannot parse config file\")\n }\n\n persistent = loadConfig\n }\n\n /**\n * Saves [persistent] configuration to config file.\n */\n override fun saveToFile() {\n try {\n Files.newBufferedWriter(FileHelper.getPath(CONFIG_FILE_NAME)).use {\n mapper.writeValue(it, persistent)\n }\n } catch (e: IOException) {\n Logger.error(e, \"Cannot save config file\")\n } catch (e: SecurityException) {\n Logger.error(e, \"Cannot save config file\")\n } catch (e: InvalidPathException) {\n Logger.error(e, \"Cannot save config file\")\n } catch (e: JsonParseException) {\n Logger.error(e, \"Cannot parse config file\")\n } catch (e: JsonMappingException) {\n Logger.error(e, \"Cannot parse config file\")\n } catch (e: IllegalStateException) {\n Logger.error(e, \"Cannot parse config file\")\n }\n }\n\n /**\n * Resets all configurations, CLI options and config file.\n */\n override fun resetAndSave() {\n options = Options()\n persistent = Config()\n saveToFile()\n }\n}\n" }, { "path": "src/main/kotlin/app/config/MockConfigurator.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.config\n\nimport app.model.LocalRepo\nimport app.model.User\nimport app.utils.Options\n\nclass MockConfigurator(var mockUsername: String = \"\",\n var mockPassword: String = \"\",\n var mockIsValidCredentials: Boolean = true,\n var mockIsFirstLaunch: Boolean = true,\n var mockUser: User = User(),\n var mockLocalRepos: MutableList =\n mutableListOf(),\n var uuid: String = \"\") : Configurator {\n var mockCurrent: Config = Config()\n var mockPersistent: Config = Config()\n var mockOptions: Options = Options()\n\n override fun setOptions(options: Options) {\n mockOptions = options\n }\n\n override fun getUsername(): String {\n return mockUsername\n }\n\n override fun getPassword(): String {\n return mockPassword\n }\n\n override fun isValidCredentials(): Boolean {\n return mockIsValidCredentials\n }\n\n override fun getLocalRepos(): List {\n return mockLocalRepos\n }\n\n override fun getUser(): User {\n return mockUser\n }\n\n override fun setUsernameCurrent(username: String) {\n mockCurrent.username = username\n }\n\n override fun setPasswordCurrent(password: String) {\n mockCurrent.password = password\n }\n\n override fun getUuidPersistent(): String {\n return uuid\n }\n\n override fun setUsernamePersistent(username: String) {\n mockPersistent.username = username\n }\n\n override fun setPasswordPersistent(password: String) {\n mockPersistent.password = password\n }\n\n override fun addLocalRepoPersistent(localRepo: LocalRepo) {\n mockPersistent.localRepos.remove(localRepo)\n mockPersistent.localRepos.add(localRepo)\n }\n\n override fun removeLocalRepoPersistent(localRepo: LocalRepo) {\n mockPersistent.localRepos.remove(localRepo)\n }\n\n override fun setUser(user: User) {\n mockUser = user\n }\n\n override fun isFirstLaunch(): Boolean {\n return mockIsFirstLaunch\n }\n\n override fun loadFromFile() {}\n\n override fun saveToFile() {}\n\n override fun resetAndSave() {}\n}\n" }, { "path": "src/main/kotlin/app/extractors/CExtractor.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.extractors\n\nclass CExtractor : ExtractorInterface {\n companion object {\n const val LANGUAGE_NAME = Lang.C\n val importRegex = Regex(\"\"\"^([^\\n]*#include)\\s[^\\n]*\"\"\")\n val commentRegex = Regex(\"\"\"^([^\\n]*//)[^\\n]*\"\"\")\n val extractImportRegex =\n Regex(\"\"\"#include\\s+[\"<](\\w+)[/\\w+]*\\.\\w+[\">]\"\"\")\n }\n\n override fun extractImports(fileContent: List): List {\n val imports = mutableSetOf()\n\n fileContent.forEach {\n val res = extractImportRegex.find(it)\n if (res != null) {\n val lineLib = res.groupValues.last()\n imports.add(lineLib)\n }\n }\n\n return imports.toList()\n }\n\n override fun tokenize(line: String): List {\n var newLine = importRegex.replace(line, \"\")\n newLine = commentRegex.replace(newLine, \"\")\n return super.tokenize(newLine)\n }\n\n override fun mapImportToIndex(import: String, lang: String,\n startsWith: Boolean): String? {\n // TODO(lyaronskaya): Add C to libraries.\n return super.mapImportToIndex(import, Lang.CPP, startsWith = true)\n }\n\n override fun getLanguageName(): String? {\n return LANGUAGE_NAME\n }\n}\n" }, { "path": "src/main/kotlin/app/extractors/CSharpExtractor.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.extractors\n\nclass CSharpExtractor : ExtractorInterface {\n companion object {\n const val LANGUAGE_NAME = Lang.CSHARP\n val importRegex = Regex(\"\"\"^.*using\\s+(\\w+[.\\w+]*)\"\"\")\n val commentRegex = Regex(\"\"\"^([^\\n]*//)[^\\n]*\"\"\")\n val extractImportRegex = Regex(\"\"\"using\\s+(\\w+[.\\w+]*)\"\"\")\n }\n\n override fun extractImports(fileContent: List): List {\n val imports = mutableSetOf()\n\n fileContent.forEach {\n val res = extractImportRegex.find(it)\n if (res != null) {\n imports.add(res.groupValues[1])\n }\n }\n\n return imports.toList()\n }\n\n override fun tokenize(line: String): List {\n var newLine = importRegex.replace(line, \"\")\n newLine = commentRegex.replace(newLine, \"\")\n return super.tokenize(newLine)\n }\n\n override fun mapImportToIndex(import: String, lang: String,\n startsWith: Boolean): String? {\n return super.mapImportToIndex(import, lang, startsWith = true)\n }\n\n override fun getLanguageName(): String? {\n return LANGUAGE_NAME\n }\n}\n" }, { "path": "src/main/kotlin/app/extractors/ClassifierManager.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.extractors\n\nimport app.BuildConfig\nimport app.Logger\nimport app.model.Classifier\nimport app.model.LibraryMeta\nimport app.utils.FileHelper\nimport org.apache.http.client.methods.HttpGet\nimport org.apache.http.impl.client.HttpClientBuilder\nimport java.io.FileOutputStream\n\nclass ClassifierManager {\n companion object {\n private const val CLASSIFIERS_DIR = \"classifiers\"\n private const val DATA_EXT = \".pb\"\n private const val LIBS_META_DIR = ClassifierManager.CLASSIFIERS_DIR\n private const val LIBS_META_FILENAME = \"libraries_meta.pb\"\n }\n\n val cache = hashMapOf()\n val libsMeta = getLibraryMeta()\n\n /**\n * Returns libraries used in a line.\n */\n fun estimate(line: List, libraries: List): List {\n return libraries.filter { libId ->\n if (!cache.containsKey(libId)) {\n // Library not downloaded from cloud storage.\n if (FileHelper.notExists(libId + DATA_EXT, CLASSIFIERS_DIR)) {\n Logger.info { \"Downloading $libId classifier\" }\n downloadClassifier(libId)\n Logger.info { \"Finished downloading $libId classifier\" }\n }\n\n // Library not loaded from local storage.\n Logger.info { \"Loading $libId evaluator\" }\n loadClassifier(libId)\n Logger.info { \"$libId evaluator ready\" }\n }\n\n // Check line for usage of a library.\n val prediction = cache[libId]!!.evaluate(line)\n // Prediction based on two classes.\n val prob = prediction[cache[libId]!!.libraries.indexOf(libId)]\n // Define lower bound of classifier output\n // that depends on data used to create the model.\n // TODO(lyaronskaya): move thresholds to protobuf.\n if (libId == \"rb.rails\") {\n prob > 0.91\n } else if (libId == \"py.flask\") {\n prob > 0.95\n } else if (libId.startsWith(Lang.KOTLIN)) {\n prob > 0.8\n } else if (libId.startsWith(Lang.PLPGSQL)) {\n prob > 0.7\n } else if (libId.startsWith(Lang.PHP)) {\n prob > 0.75\n } else if (libId.startsWith(Lang.PYTHON)) {\n prob > 0.75\n } else if (libId.startsWith(Lang.SCALA)) {\n prob > 0.85\n } else if (libId.startsWith(Lang.GO)) {\n prob > 0.75\n } else if (libId.startsWith(Lang.JAVA)) {\n prob > 0.9\n } else if (libId.startsWith(Lang.CRYSTAL)) {\n prob > 0.7\n } else if (libId.startsWith(Lang.PERL)) {\n prob > 0.8\n } else if (libId.startsWith(\"rb.dry-\")) {\n prob > 0.85\n } else if (libId == \"js.q\") {\n prob > 0.9\n } else if (libId == \"cpp.gflags\") {\n prob > 0.9\n } else if (libId == \"dart.flutter\") {\n prob > 0.85\n }\n else if (libId.startsWith(Lang.CPP)) {\n prob > 0.8\n }\n else if (libId.startsWith(Lang.JAVASCRIPT)) {\n prob > 0.7\n }\n else {\n prob > 0.5\n }\n }\n }\n\n /**\n * Downloads libraries from cloud.\n */\n private fun downloadClassifier(libId: String) {\n val file = FileHelper.getFile(libId + DATA_EXT, CLASSIFIERS_DIR)\n val langId = libId.split('.')[0]\n val url = \"${BuildConfig.LIBRARY_MODELS_URL}$langId/$libId$DATA_EXT\"\n val builder = HttpClientBuilder.create()\n val client = builder.build()\n try {\n client.execute(HttpGet(url)).use { response ->\n val entity = response.entity\n if (entity != null) {\n FileOutputStream(file).use { outstream ->\n entity.writeTo(outstream)\n outstream.flush()\n outstream.close()\n }\n }\n\n }\n } catch (e: Exception) {\n Logger.error(e, \"Failed to download $libId classifier\")\n }\n }\n\n /**\n * Loads libraries from local storage to cache.\n */\n private fun loadClassifier(libId: String) {\n val bytesArray = FileHelper.getFile(libId + DATA_EXT, CLASSIFIERS_DIR)\n .readBytes()\n cache[libId] = Classifier(bytesArray)\n }\n\n /**\n * Downloads libraries meta data from cloud.\n */\n private fun downloadLibrariesMeta() {\n val file = FileHelper.getFile(LIBS_META_FILENAME, LIBS_META_DIR)\n val url = BuildConfig.LIBRARY_MODELS_URL + LIBS_META_FILENAME\n val builder = HttpClientBuilder.create()\n val client = builder.build()\n try {\n client.execute(HttpGet(url)).use { response ->\n val entity = response.entity\n if (entity != null) {\n FileOutputStream(file).use { outstream ->\n entity.writeTo(outstream)\n outstream.flush()\n outstream.close()\n }\n }\n }\n } catch (e: Exception) {\n Logger.error(e, \"Failed to download $LIBS_META_FILENAME\")\n }\n }\n\n /**\n * Loads libraries meta data from local storage.\n */\n private fun getLibraryMeta(): LibraryMeta {\n Logger.info { \"Downloading $LIBS_META_FILENAME\" }\n downloadLibrariesMeta()\n Logger.info { \"Finished downloading $LIBS_META_FILENAME\" }\n\n val bytesArray = FileHelper.getFile(LIBS_META_FILENAME,\n LIBS_META_DIR).readBytes()\n return LibraryMeta(bytesArray)\n }\n}\n" }, { "path": "src/main/kotlin/app/extractors/CommonExtractor.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.extractors\n\nimport app.model.CommitStats\nimport app.model.DiffFile\n\nclass CommonExtractor(private val langName: String) : ExtractorInterface {\n override fun extract(files: List): List {\n files.map { file -> file.lang = langName }\n return super.extract(files)\n }\n}\n" }, { "path": "src/main/kotlin/app/extractors/CppExtractor.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.extractors\n\nimport app.model.CommitStats\nimport app.model.DiffFile\n\nclass CppExtractor : ExtractorInterface {\n companion object {\n const val LANGUAGE_NAME = Lang.CPP\n const val TEMPLATE = \"template\"\n val importRegex = Regex(\"\"\"^([^\\n]*#include)\\s[^\\n]*\"\"\")\n val commentRegex = Regex(\"\"\"^([^\\n]*//)[^\\n]*\"\"\")\n val extractImportRegex = Regex(\"\"\"#include\\s+[\"<](\\w+[/\\w+]*(\\.\\w+)?)[\">]\"\"\")\n val templateRegex = Regex(\"\"\"template\\s*<\"\"\")\n }\n\n override fun extractImports(fileContent: List): List {\n val imports = mutableSetOf()\n\n fileContent.forEach {\n val res = extractImportRegex.find(it)\n if (res != null) {\n val lineLib = res.groupValues\n .last { !it.startsWith(\".\") && it != \"\"}\n imports.add(lineLib)\n }\n }\n return imports.toSet().toList()\n }\n\n override fun extract(files: List): List {\n val stats = super.extract(files).toMutableList()\n\n // Templates fun fact.\n val allAdded = files.map{ file -> file.getAllAdded() }.flatten()\n val allDeleted = files.map{ file -> file.getAllDeleted() }.flatten()\n\n val templateAllAdded = allAdded.filter { isTemplate(it) }.size\n val templateAllDeleted = allDeleted.filter { isTemplate(it) }.size\n\n if (templateAllAdded > 0 || templateAllDeleted > 0) {\n stats.add(CommitStats(\n templateAllAdded, templateAllDeleted, ExtractorInterface.TYPE_SYNTAX,\n tech = LANGUAGE_NAME + ExtractorInterface.SEPARATOR + TEMPLATE\n ))\n }\n\n return stats\n }\n\n override fun tokenize(line: String): List {\n var newLine = importRegex.replace(line, \"\")\n newLine = commentRegex.replace(newLine, \"\")\n return super.tokenize(newLine)\n }\n\n override fun mapImportToIndex(import: String, lang: String,\n startsWith: Boolean): String? {\n return super.mapImportToIndex(import, lang, startsWith = true)\n }\n\n override fun getLanguageName(): String? {\n return LANGUAGE_NAME\n }\n\n private fun isTemplate(line: String): Boolean {\n return line.contains(templateRegex)\n }\n}\n" }, { "path": "src/main/kotlin/app/extractors/CrystalExtractor.kt", "content": "// Copyright 2019 Sourcerer Inc. All Rights Reserved.\n// Author: Anton Maminov (anton.maminov@gmail.com)\n\npackage app.extractors\n\nclass CrystalExtractor : ExtractorInterface {\n companion object {\n const val LANGUAGE_NAME = Lang.CRYSTAL\n val importRegex = Regex(\"\"\"require\\s+\\\"(\\w+)\\\"\"\"\")\n val commentRegex = Regex(\"\"\"^([^\\n]*#)[^\\n]*\"\"\")\n val extractImportRegex = Regex(\"\"\"require\\s+\\\"(.+)\\\"\"\"\")\n val includeRegex = Regex(\"\"\"include\\s+(\\w+)::.+\"\"\")\n }\n\n override fun extractImports(fileContent: List): List {\n val imports = mutableSetOf()\n\n fileContent.forEach {\n val res = extractImportRegex.find(it)\n if (res != null) {\n val lineLib = res.groupValues.last { it != \"\" }\n imports.add(lineLib)\n }\n }\n\n if (imports.isEmpty()) {\n fileContent.forEach {\n val res = includeRegex.find(it)\n if (res != null) {\n imports.add(res.groupValues.last().toLowerCase())\n }\n }\n }\n\n return imports.toList()\n }\n\n override fun tokenize(line: String): List {\n var newLine = importRegex.replace(line, \"\")\n newLine = commentRegex.replace(newLine, \"\")\n return super.tokenize(newLine)\n }\n\n override fun mapImportToIndex(import: String, lang: String,\n startsWith: Boolean): String? {\n return super.mapImportToIndex(import, lang, startsWith = true)\n }\n\n override fun getLanguageName(): String? {\n return LANGUAGE_NAME\n }\n}\n" }, { "path": "src/main/kotlin/app/extractors/CssExtractor.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.extractors\n\nimport app.model.CommitStats\nimport app.model.DiffFile\n\nclass CssExtractor : ExtractorInterface {\n companion object {\n const val LANGUAGE_NAME = Lang.CSS\n val FILE_EXTS = listOf(\"css\", \"scss\", \"less\", \"sass\")\n }\n\n override fun extract(files: List): List {\n files.map { file -> file.lang = LANGUAGE_NAME }\n val stats = FILE_EXTS.filter { it != \"css\" }.map { extension ->\n val result = files.filter { it.extension == extension }\n .fold(Pair(0, 0)) { total, file ->\n val currentNumAdded = file.getAllAdded()\n .filter { it.isNotBlank() }.size\n val currentNumDeleted = file.getAllDeleted()\n .filter { it.isNotBlank() }.size\n Pair(total.first + currentNumAdded,\n total.second + currentNumDeleted)}.toList()\n\n CommitStats(numLinesAdded = result[0],\n numLinesDeleted = result[1],\n type = ExtractorInterface.TYPE_LIBRARY,\n tech = extension)\n }.filter { it.numLinesAdded > 0 || it.numLinesDeleted > 0 }\n\n return stats + super.extract(files)\n }\n\n override fun getLanguageName(): String? {\n return LANGUAGE_NAME\n }\n}\n" }, { "path": "src/main/kotlin/app/extractors/DMExtractor.kt", "content": "// Copyright 2019 Sourcerer Inc. All Rights Reserved.\n// Author: Nickolas Gupton (nickolas@gupton.xyz)\n\npackage app.extractors\n\nimport app.model.CommitStats\nimport app.model.DiffFile\n\nclass DMExtractor : ExtractorInterface {\n companion object {\n const val LANGUAGE_NAME = Lang.DM\n }\n\n override fun extractLibStats(files: List): List {\n val mapExtension = \".dmm\"\n val spriteExtension = \".dmi\"\n\n val mapFiles = files.filter { it.path.endsWith(mapExtension) }\n val spriteFiles = files.filter { it.path.endsWith(spriteExtension) }\n\n // Add stats from *.dmm files.\n val mapStats = listOf(CommitStats(\n numLinesAdded = mapFiles.map { it.getAllAdded().size }.sum(),\n numLinesDeleted = mapFiles.map { it.getAllDeleted().size }.sum(),\n type = ExtractorInterface.TYPE_LIBRARY,\n tech = \"dm.byond-mapping\"\n )).filter { it.numLinesAdded > 0 || it.numLinesDeleted > 0 }\n\n // Add stats from *.dmi files.\n val spriteStats = listOf(CommitStats(\n numLinesAdded = spriteFiles.map { it.getAllAdded().size }.sum(),\n numLinesDeleted = spriteFiles.map { it.getAllDeleted().size }.sum(),\n type = ExtractorInterface.TYPE_LIBRARY,\n tech = \"dm.byond-sprites\"\n )).filter { it.numLinesAdded > 0 || it.numLinesDeleted > 0 }\n\n return mapStats + spriteStats;\n }\n\n override fun getLanguageName(): String? {\n return LANGUAGE_NAME\n }\n}\n" }, { "path": "src/main/kotlin/app/extractors/DartExtractor.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Alexander Surkov (alex@sourcerer.io)\n\npackage app.extractors\n\nobject DartExtractor : ExtractorBase(\n language = Lang.DART,\n importRegex = Regex(\"\"\"^import ['\"](.+)['\"];$\"\"\"),\n commentRegex = Regex(\"(//.+$)|(/[*].*?[*]/)\"))\n" }, { "path": "src/main/kotlin/app/extractors/DevopsExtractor.kt", "content": "// Copyright 2019 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.extractors\n\nimport app.model.CommitStats\nimport app.model.DiffFile\n\nclass DevopsExtractor(private val techName: String) : ExtractorInterface {\n companion object {\n const val DEVOPS = \"devops.\"\n const val JENKINS = \"jenkins\"\n const val CIRCLECI = \"circleci\"\n const val GITLAB_CI = \"gitlab-ci\"\n const val GITHUB_ACTIONS = \"github-actions\"\n const val TRAVIS = \"travis\"\n const val K8S = \"k8s\"\n const val DOCKER = \"docker\"\n const val DRONE = \"drone\"\n }\n\n override fun extract(files: List): List {\n return listOf(CommitStats(\n numLinesAdded = files.map { it.getAllAdded().size }.sum(),\n numLinesDeleted = files.map { it.getAllDeleted().size }.sum(),\n type = ExtractorInterface.TYPE_LIBRARY,\n tech = DEVOPS + techName\n )).filter { it.numLinesAdded > 0 || it.numLinesDeleted > 0 }\n }\n}\n" }, { "path": "src/main/kotlin/app/extractors/ElixirExtractor.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Alexander Surkov (alex@sourcerer.io)\n\npackage app.extractors\n\nobject ElixirExtractor : ExtractorBase(\n language = Lang.ELIXIR,\n importRegex = Regex(\"\"\"^\\s+(?:use|import|require) ([a-zA-Z_][a-zA-Z0-9_]*)\"\"\"),\n commentRegex = Regex(\"\"\"#.*$\"\"\"))\n" }, { "path": "src/main/kotlin/app/extractors/Extractor.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n\npackage app.extractors\n\nimport app.model.CommitStats\nimport app.model.DiffFile\n\nclass Extractor : ExtractorInterface {\n companion object {\n val RESTRICTED_EXTS = listOf(\".min.js\")\n }\n\n override fun extract(files: List): List {\n return files\n .filter { file -> !RESTRICTED_EXTS.contains(file.extension) }\n .mapNotNull { file ->\n Heuristics.analyze(file)\n }\n .fold(mutableListOf()) { accStats, stats ->\n accStats.addAll(stats)\n accStats\n }\n }\n}\n" }, { "path": "src/main/kotlin/app/extractors/ExtractorBase.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Alexander Surkov (alex@sourcerer.io)\n\npackage app.extractors\n\nopen class ExtractorBase(private val language: String,\n private val importRegex: Regex,\n private val commentRegex: Regex,\n private val importStartsWith: Boolean = false) :\n ExtractorInterface {\n override fun extractImports(fileContent: List): List {\n val imports = mutableSetOf()\n\n fileContent.forEach {\n val line = commentRegex.replace(it, \"\")\n val res = importRegex.find(line)\n if (res != null) {\n val lineLib = res.groupValues[1]\n imports.add(lineLib)\n }\n }\n\n return imports.toList()\n }\n\n override fun tokenize(line: String): List {\n var newLine = importRegex.replace(line, \"\")\n newLine = commentRegex.replace(newLine, \"\")\n return super.tokenize(newLine)\n }\n\n override fun mapImportToIndex(import: String, lang: String, startsWith: Boolean): String? {\n return super.mapImportToIndex(import, lang, startsWith = importStartsWith)\n }\n\n override fun getLanguageName(): String? {\n return language\n }\n}\n" }, { "path": "src/main/kotlin/app/extractors/ExtractorInterface.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n\npackage app.extractors\n\nimport app.model.*\n\ninterface ExtractorInterface {\n companion object {\n const val TYPE_LANGUAGE = 1\n const val TYPE_LIBRARY = 2\n const val TYPE_KEYWORD = 3\n const val TYPE_SYNTAX = 4\n const val SEPARATOR = \">\"\n\n private val classifierManager = ClassifierManager()\n\n val stringRegex = Regex(\"\"\"(\".+?\"|'.+?')\"\"\")\n val splitRegex = Regex(\"\"\"\\s|,|;|\\*|\\n|\\(|\\)|\\[|]|\\{|}|\\+|=|&|\\$|\"\"\" +\n \"\"\"!=|\\.|>|<|#|@|:|\\?|!\"\"\")\n }\n\n // Identify libs used in a line with classifiers.\n fun determineLibs(line: String, importedLibs: List): List {\n val lang = getLanguageName()\n if (lang != null) {\n return classifierManager.estimate(tokenize(line), importedLibs)\n }\n return listOf()\n }\n\n // Should be defined for each language otherwise libs extraction disabled.\n fun extractImports(fileContent: List): List {\n return listOf()\n }\n\n // Should be defined for additional statistics like keywords.\n fun extract(files: List): List {\n val lang = getLanguageName()\n if (lang != null) {\n files.forEach { file -> file.lang = lang }\n }\n\n return extractLangStats(files) + extractLibStats(files)\n }\n\n fun extractLangStats(files: List): List {\n return files.filter { file -> file.lang.isNotBlank() }\n .groupBy { file -> file.lang }\n .map { (language, files) -> CommitStats(\n numLinesAdded = files.fold(0) { total, file ->\n total + file.getAllAdded().size },\n numLinesDeleted = files.fold(0) { total, file ->\n total + file.getAllDeleted().size },\n type = TYPE_LANGUAGE,\n tech = language)\n }\n }\n\n fun extractLibStats(files: List): List {\n val oldLibs = extractLibsOfDiffs(files.map { Pair(it.lang, it.old) })\n val newLibs = extractLibsOfDiffs(files.map { Pair(it.lang, it.new) })\n\n val allLibsIds = oldLibs.keys + newLibs.keys\n\n return allLibsIds.map { libId -> CommitStats(\n numLinesAdded = newLibs.getOrDefault(libId, 0),\n numLinesDeleted = oldLibs.getOrDefault(libId, 0),\n type = TYPE_LIBRARY,\n tech = libId\n ) }.filter { it.numLinesAdded > 0 || it.numLinesDeleted > 0 }\n }\n\n fun extractLibsOfDiffs(diffs: List>):\n Map {\n val libsCount = mutableMapOf()\n\n // Extract imports from files.\n diffs.forEach { (_, diff) ->\n diff.imports = extractImports(diff.content)\n }\n\n // Skip library stats calculation if no imports found.\n if (!diffs.any({ (_, diff) -> diff.imports.isNotEmpty() })) {\n return mapOf()\n }\n\n // Determine libraries used in each line.\n diffs.filter { (lang, _) -> lang.isNotBlank() }\n .forEach { (lang, diff) ->\n val importedLibs = diff.imports.mapNotNull { import ->\n mapImportToIndex(import, lang)\n }\n\n diff.getAllDiffs().forEach { line ->\n determineLibs(line, importedLibs).forEach { libId ->\n libsCount[libId] = libsCount.getOrDefault(libId, 0) + 1\n }\n }\n }\n\n return libsCount\n }\n\n fun tokenize(line: String): List {\n // TODO(lyaronskaya): Multiline comment regex.\n\n // TODO(anatoly): Optimize this regex, better to get rid of it.\n val newLine = stringRegex.replace(line, \"\")\n\n val tokens = newLine.split(' ', '[', ',', ';', '*', '\\n', ')', '(',\n '[', ']', '}', '{', '+', '-', '=', '&', '$', '!', '.', '>', '<',\n '#', '@', ':', '?', ']')\n .filter {\n it.isNotBlank() && !it.contains('\"') && !it.contains('\\'') &&\n it != \"-\" && it != \"@\"\n }\n\n return tokens\n }\n\n fun getLanguageName(): String? {\n return null\n }\n\n fun mapImportToIndex(import: String, lang: String,\n startsWith: Boolean = false): String? {\n val libsMeta = classifierManager.libsMeta\n if (!libsMeta.importToIndexMap.contains(lang)) return null\n\n if (startsWith) {\n val map = libsMeta.importToIndexMap[lang]\n val baseImports = map!!.keys.filter { import.startsWith(it) }\n if (baseImports.isEmpty()) {\n return null\n }\n val baseImport = baseImports.reduce { acc, s ->\n if (s.length > acc.length) s else acc\n }\n return map[baseImport]\n }\n\n return libsMeta.importToIndexMap[lang]!![import]\n }\n\n}\n" }, { "path": "src/main/kotlin/app/extractors/FSharpExtractor.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Tuomas Hietanen\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.extractors\n\nclass FSharpExtractor : ExtractorInterface {\n companion object {\n const val LANGUAGE_NAME = Lang.FSHARP\n val importRegex = Regex(\"\"\"^.*open\\s+(\\w+[.\\w+]*)\"\"\")\n val commentRegex = Regex(\"\"\"^([^\\n]*//)[^\\n]*\"\"\")\n val extractImportRegex = Regex(\"\"\"open\\s+(\\w+[.\\w+]*)\"\"\")\n }\n\n override fun extractImports(fileContent: List): List {\n val imports = mutableSetOf()\n\n fileContent.forEach {\n val res = extractImportRegex.find(it)\n if (res != null) {\n imports.add(res.groupValues[1])\n }\n }\n\n return imports.toList()\n }\n\n override fun tokenize(line: String): List {\n var newLine = importRegex.replace(line, \"\")\n newLine = commentRegex.replace(newLine, \"\")\n return super.tokenize(newLine)\n }\n\n override fun mapImportToIndex(import: String, lang: String,\n startsWith: Boolean): String? {\n // The behaviour of fsharp library classifier is the same as for csharp.\n return super.mapImportToIndex(import, Lang.CSHARP, startsWith = true)\n }\n\n override fun getLanguageName(): String? {\n return LANGUAGE_NAME\n }\n}\n" }, { "path": "src/main/kotlin/app/extractors/GoExtractor.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.extractors\n\nclass GoExtractor : ExtractorInterface {\n companion object {\n const val LANGUAGE_NAME = Lang.GO\n val importRegex = Regex(\"\"\"^(.*import)\\s[^\\n]*\"\"\")\n val commentRegex = Regex(\"\"\"^([^\\n]*//)[^\\n]*\"\"\")\n val singleImportRegex = Regex(\"\"\"import\\s+\"(.+?)\"\"\"\")\n val multipleImportRegex = Regex(\"\"\"import[\\s\\t\\n]+\\((.+?)\\)\"\"\",\n RegexOption.DOT_MATCHES_ALL)\n val separatorsRegex = Regex(\"\"\"(\\t+|\\n+|\\s+|\")\"\"\")\n }\n\n override fun extractImports(fileContent: List): List {\n val imports = mutableSetOf()\n\n fileContent.forEach {\n val res = singleImportRegex.find(it)\n if (res != null) {\n val lineLib = res.groupValues.last()\n imports.add(lineLib)\n }\n }\n val contentJoined = fileContent.joinToString(separator = \"\")\n multipleImportRegex.findAll(contentJoined).forEach { matchResult ->\n imports.addAll(matchResult.groupValues.last()\n .split(separatorsRegex)\n .filter { it.isNotEmpty() }\n .map { it.replace(\"\\\"\", \"\") })\n }\n\n return imports.toList()\n }\n\n override fun tokenize(line: String): List {\n var newLine = importRegex.replace(line, \"\")\n newLine = commentRegex.replace(newLine, \"\")\n return super.tokenize(newLine)\n }\n\n override fun mapImportToIndex(import: String, lang: String,\n startsWith: Boolean): String? {\n return super.mapImportToIndex(import, lang, startsWith = true)\n }\n\n override fun getLanguageName(): String? {\n return LANGUAGE_NAME\n }\n}\n" }, { "path": "src/main/kotlin/app/extractors/Heuristics.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Alexander Surkov (alex@sourcerer.io)\n\npackage app.extractors\n\nimport app.model.DiffFile\nimport app.model.CommitStats\n\nval ActionscriptRegex = Regex(\n \"^\\\\s*(package\\\\s+[a-z0-9_\\\\.]+|import\\\\s+[a-zA-Z0-9_\\\\.]+;|class\\\\s+[A-Za-z0-9_]+\\\\s+extends\\\\s+[A-Za-z0-9_]+)\",\n RegexOption.MULTILINE\n)\nval CoqRegex = Regex(\n \"\"\"^Require\\s\"\"\",\n RegexOption.MULTILINE\n)\nval CommonLispRegex = Regex(\n \"^\\\\s*\\\\((defun|in-package|defpackage) \",\n setOf(RegexOption.MULTILINE, RegexOption.IGNORE_CASE)\n)\nval CppRegex = Regex(\n \"(template |class |namespace |#include )\",\n RegexOption.MULTILINE\n)\nval DRegex = Regex(\n \"^module\\\\s+[\\\\w.]*\\\\s*;|import\\\\s+[\\\\w\\\\s,.:]*;|\\\\w+\\\\s+\\\\w+\\\\s*\\\\(.*\\\\)(?:\\\\(.*\\\\))?\\\\s*\\\\{[^}]*\\\\}|unittest\\\\s*(?:\\\\(.*\\\\))?\\\\s*\\\\{[^}]*\\\\}\",\n RegexOption.MULTILINE\n)\nval DtraceRegex = Regex(\n \"^(\\\\w+:\\\\w*:\\\\w*:\\\\w*|BEGIN|END|provider\\\\s+|(tick|profile)-\\\\w+\\\\s+\\\\{[^}]*\\\\}|#pragma\\\\s+D\\\\s+(option|attributes|depends_on)\\\\s|#pragma\\\\s+ident\\\\s)\",\n RegexOption.MULTILINE\n)\nval FilterscriptRegex = Regex(\n \"#include|#pragma\\\\s+(rs|version)|__attribute__\"\n)\nval FSharpRegex = Regex(\n \"^\\\\s*(#light|import|let|module|namespace|open|type)\",\n RegexOption.MULTILINE\n)\nval ForthRegex = Regex(\n \"^: \"\n)\nval ForthFsRegex = Regex(\n \"^(: |new-device)\"\n)\nval FortranRegex = Regex(\n \"^([c*][^abd-z]| (subroutine|program|end|data)\\\\s|\\\\s*!)\",\n RegexOption.IGNORE_CASE\n)\nval GlslRegex = Regex(\n \"^\\\\s*(#version|precision|uniform|varying|vec[234])\",\n RegexOption.IGNORE_CASE\n)\nval IdlRegex = Regex(\n \"^\\\\s*function[ \\\\w,]+$\",\n RegexOption.MULTILINE\n)\nval IniPropsRegex = Regex(\n \"\\\\w+\\\\s*=\\\\s*\",\n RegexOption.IGNORE_CASE\n)\nval LexRegex = Regex(\n \"^(%[%{}]xs|<.*>)\",\n RegexOption.MULTILINE\n)\nval LimboRegex = Regex(\n \"^\\\\w+\\\\s*:\\\\s*module\\\\s*\\\\{\",\n RegexOption.MULTILINE\n)\nval MathematicaRegex = Regex(\n \"\\\\*\\\\)$\",\n RegexOption.MULTILINE\n)\nval MatlabRegex = Regex(\n \"\"\"(^\\s*%)|(^end$)\"\"\",\n RegexOption.MULTILINE\n)\nval MRegexs = setOf(\n Regex(\n \"^\\\\s*;\",\n RegexOption.MULTILINE\n ),\n Regex(\n \"^\\\\w+\\\\s;\",\n RegexOption.MULTILINE\n )\n)\nval MakefileRegex = Regex(\n \"([\\\\/\\\\\\\\].*:\\\\s+.*\\\\s\\\\\\\\$|: \\\\\\\\$|^ : |^[\\\\w\\\\s\\\\/\\\\\\\\.]+\\\\w+\\\\.\\\\w+\\\\s*:\\\\s+[\\\\w\\\\s\\\\/\\\\\\\\.]+\\\\w+\\\\.\\\\w+)\"\n)\nval MufRegex =Regex(\n \"^: \",\n RegexOption.MULTILINE\n)\nval NewLispRegex = Regex(\n \"^\\\\s*\\\\(define \",\n RegexOption.MULTILINE\n)\nval NotSqlRegex = Regex(\n \"begin|boolean|package|exception\",\n RegexOption.IGNORE_CASE\n)\nval ObjectiveCRegex = Regex(\n \"^\\\\s*(@(interface|class|protocol|property|end|synchronised|selector|implementation)\\\\b|#import\\\\s+.+\\\\.h[\\\">])\",\n RegexOption.MULTILINE\n)\nval OcamlRegex = Regex(\n \"(^\\\\s*module)|let rec |match\\\\s+(\\\\S+\\\\s)+with\",\n RegexOption.MULTILINE\n)\nval PascalRegex = Regex(\n \"(^\\\\s*uses)|(function)|(program)\",\n setOf(RegexOption.MULTILINE, RegexOption.IGNORE_CASE)\n)\nval Perl5Regex = Regex(\n \"\\\\buse\\\\s+(?:strict\\\\b|v?5\\\\.)\"\n)\nval Perl6Regex = Regex(\n \"^\\\\s*(?:use\\\\s+v6\\\\b|\\\\bmodule\\\\b|\\\\b(?:my\\\\s+)?class\\\\b)\",\n RegexOption.MULTILINE\n)\nval PhpRegex = Regex(\n \"^<\\\\?(?:php)?\"\n)\nval PhpIlluminateRegex = Regex(\n \"(Auth|Bootstrap|Bus|Console|Events|Exceptions|Http|Providers\" +\n \"|Support|Testing|Validation)\")\nval PicoLispRegex = Regex(\n \"^\\\\((de|class|rel|code|data|must)\\\\s\",\n RegexOption.MULTILINE\n)\nval PlpgsqlRegexs = setOf(\n Regex(\n \"^\\\\\\\\i\\\\b|AS \\\\$\\\\$|LANGUAGE '?plpgsql'?\",\n setOf(RegexOption.MULTILINE, RegexOption.IGNORE_CASE)\n ),\n Regex(\n \"SECURITY (DEFINER|INVOKER)\",\n RegexOption.IGNORE_CASE\n ),\n Regex(\n \"BEGIN( WORK| TRANSACTION)?;\",\n RegexOption.IGNORE_CASE\n )\n)\nval PlsqlRegexs = setOf(\n Regex(\n \"\\\\\\$\\\\\\$PLSQL_|XMLTYPE|sysdate|systimestamp|\\\\.nextval|connect by|AUTHID (DEFINER|CURRENT_USER)\",\n RegexOption.IGNORE_CASE\n ),\n Regex(\n \"constructor\\\\W+function\",\n RegexOption.IGNORE_CASE\n )\n)\nval PovRaySdlRegex = Regex(\n \"^\\\\s*#(declare|local|macro|while)\\\\s\", RegexOption.MULTILINE\n)\nval PrologRegex = Regex(\n \"^[^#]*:-\",\n RegexOption.MULTILINE\n)\nval PythonRegex = Regex(\n \"(^(import|from|class|def)\\\\s)\",\n RegexOption.MULTILINE\n)\nval RRegex = Regex(\n \"<-|^\\\\s*#\"\n)\nval RebolRegex = Regex(\n \"\\\\bRebol\\\\b\",\n RegexOption.IGNORE_CASE\n)\nval RoffRegex = Regex(\n \"^\\\\.[a-z][a-z](\\\\s|$)\",\n setOf(RegexOption.MULTILINE, RegexOption.IGNORE_CASE)\n)\nval RustRegex = Regex(\n \"^(use |fn |mod |pub |macro_rules|impl|#!?\\\\[)\",\n RegexOption.MULTILINE\n)\nval RenderscriptRegex = Regex(\n \"#include|#pragma\\\\s+(rs|version)|__attribute__\"\n)\nval ScalaRegex = Regex(\n \"^\\\\s*import (scala|java)\\\\./.match(data) || /^\\\\s*val\\\\s+\\\\w+\\\\s*=/.match(data) || /^\\\\s*class\\\\b\",\n RegexOption.MULTILINE\n)\nval SmalltalkRegex = Regex(\n \"![\\\\w\\\\s]+methodsFor: \"\n)\nval SqlplRegexs = setOf(\n Regex(\n \"(alter module)|(language sql)|(begin( NOT)+ atomic)\",\n RegexOption.IGNORE_CASE\n ),\n Regex(\n \"signal SQLSTATE '[0-9]+'\",\n RegexOption.IGNORE_CASE\n )\n)\nval StandardMlRegex = Regex(\n \"=> |case\\\\s+(\\\\S+\\\\s)+of\"\n)\nval SupercolliderRegexs = setOf(\n Regex(\"\\\\^(this|super)\\\\.\"),\n Regex(\"^\\\\s*(\\\\+|\\\\*)\\\\s*\\\\w+\\\\s*\\\\{\", RegexOption.MULTILINE),\n Regex(\"^\\\\s*~\\\\w+\\\\s*=\\\\.\", RegexOption.MULTILINE)\n)\nval TexRegex = Regex(\n \"\\\\\\\\\\\\w+\\\\{\"\n)\nval TypescriptRegex = Regex(\n \"^\\\\s*(import.+(from\\\\s+|require\\\\()['\\\"]react|\\\\/\\\\/\\\\/\\\\s*\n // Required fields in k8s config: apiVersion, kind, metadata.\n buf.contains(\"apiVersion\") && buf.contains(\"kind\")\n && buf.contains(\"metadata\")\n}\n\nval bootstrapWebpackExp = { buf: String ->\n // Handling php projects with bootstrap Webpack.\n buf.contains(\"/******/ (function(modules) { // webpackBootstrap\")\n}\n\n/**\n * Heuristics to detect a programming language by file extension and content.\n * Inspired by GitHub Liguist heuristics (https://github.com/github/linguist).\n */\nobject Heuristics\n{\n /**\n * Returns a list of language commit stats extracted from the given file.\n */\n fun analyze(file: DiffFile) : List? {\n val buf = toBuf(file.new.content)\n var extractor: ExtractorInterface? = null\n\n // Look for an extractor by a file extension. If failed, then fallback\n // to generic content analysis.\n val extractorFactory = HeuristicsMap[file.extension]\n if (extractorFactory != null) {\n extractor = extractorFactory(buf, file.path.toLowerCase())\n } else {\n if (XmlRegex.containsMatchIn(buf)) {\n extractor = CommonExtractor(Lang.XML)\n }\n }\n\n return extractor?.extract(listOf(file))\n }\n\n /**\n * Returns a portion of the file content not exceeding the limit.\n */\n private const val HEURISTICS_CONSIDER_BYTES = 50 * 1024\n private fun toBuf(lines: List) : String {\n var buf = \"\"\n for (line in lines) {\n buf += \"$line\\n\"\n if (buf.length > HEURISTICS_CONSIDER_BYTES) {\n break\n }\n }\n return buf\n }\n}\n\n/**\n * A map of file extensions to language extracters.\n */\nval HeuristicsMap = mapOf ExtractorInterface?>(\n \"4\" to { _, _ ->\n CommonExtractor(Lang.ROFF)\n },\n \"4th\" to { _, _ ->\n CommonExtractor(Lang.FORTH)\n },\n \"a51\" to { _, _ ->\n CommonExtractor(Lang.ASSEMBLY)\n },\n \"al\" to { _, _ ->\n PerlExtractor(Lang.PERL)\n },\n \"as\" to { buf, _ ->\n if (ActionscriptRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.ACTIONSCRIPT)\n } else CommonExtractor(Lang.ANGELSCRIPT)\n },\n \"asm\" to { _, _ ->\n CommonExtractor(Lang.ASSEMBLY)\n },\n \"b\" to { _, _ ->\n CommonExtractor(Lang.LIMBO)\n },\n \"bas\" to { _, _ ->\n CommonExtractor(Lang.VISUALBASIC)\n },\n \"bat\" to { _, _ ->\n CommonExtractor(Lang.DOSBATCH)\n },\n \"bbx\" to { _, _ ->\n CommonExtractor(Lang.TEX)\n },\n \"bdy\" to { _, _ ->\n CommonExtractor(Lang.PLSQL)\n },\n \"boot\" to { _, _ ->\n CommonExtractor(Lang.CLOJURE)\n },\n \"c\" to { _, _ ->\n CExtractor()\n },\n \"cake\" to { _, _ ->\n CSharpExtractor()\n },\n \"cbl\" to { _, _ ->\n CommonExtractor(Lang.COBOL)\n },\n \"cbx\" to { _, _ ->\n CommonExtractor(Lang.TEX)\n },\n \"cc\" to { _, _ ->\n CppExtractor()\n },\n \"cgi\" to { buf, _ ->\n if (Perl5Regex.containsMatchIn(buf)) {\n PerlExtractor(Lang.PERL)\n } else null\n },\n \"cl\" to { _, _ ->\n CommonExtractor(Lang.COMMONLISP)\n },\n \"cl2\" to { _, _ ->\n CommonExtractor(Lang.CLOJURE)\n },\n \"clj\" to { _, _ ->\n CommonExtractor(Lang.CLOJURE)\n },\n \"cljc\" to { _, _ ->\n CommonExtractor(Lang.CLOJURE)\n },\n \"cljscm\" to { _, _ ->\n CommonExtractor(Lang.CLOJURE)\n },\n \"cljs\" to { _, _ ->\n CommonExtractor(Lang.CLOJURE)\n },\n \"cljx\" to { _, _ ->\n CommonExtractor(Lang.CLOJURE)\n },\n \"cls\" to { buf, _ ->\n if (TexRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.TEX)\n } else {\n CommonExtractor(Lang.VISUALBASIC)\n }\n },\n \"cob\" to { _, _ ->\n CommonExtractor(Lang.COBOL)\n },\n \"coffee\" to { _, _ ->\n CommonExtractor(Lang.COFFEESCRIPT)\n },\n \"cp\" to { _, _ ->\n CppExtractor()\n },\n \"cpp\" to { _, _ ->\n CppExtractor()\n },\n \"cr\" to { _, _ ->\n CrystalExtractor()\n },\n \"cpy\" to { _, _ ->\n CommonExtractor(Lang.COBOL)\n },\n \"cql\" to { _, _ ->\n CommonExtractor(Lang.SQL)\n },\n \"cs\" to { buf, _ ->\n if (SmalltalkRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.SMALLTALK)\n } else {\n CSharpExtractor()\n }\n },\n \"cshtml\" to { _, _ ->\n CSharpExtractor()\n },\n \"css\" to { _, _ ->\n CssExtractor()\n },\n \"csx\" to { _, _ ->\n CSharpExtractor()\n },\n \"cu\" to { _, _ ->\n CommonExtractor(Lang.CUDA)\n },\n \"cuh\" to { _, _ ->\n CommonExtractor(Lang.CUDA)\n },\n \"cxx\" to { _, _ ->\n CppExtractor()\n },\n \"c++\" to { _, _ ->\n CppExtractor()\n },\n \"d\" to { buf, _ ->\n if (DRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.D)\n } else if (DtraceRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.DTRACE)\n } else if (MakefileRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.MAKEFILE)\n } else null\n },\n \"dart\" to { _, _ ->\n DartExtractor\n },\n \"db2\" to { _, _ ->\n CommonExtractor(Lang.SQLPL)\n },\n \"ddl\" to { buf, _ ->\n if (PlsqlRegexs.any { re -> re.containsMatchIn(buf)}) {\n CommonExtractor(Lang.PLSQL) // Oracle\n } else if (!NotSqlRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.SQL) // Generic SQL\n } else null\n },\n \"dlm\" to { _, _ ->\n CommonExtractor(Lang.IDL)\n },\n \"dm\" to { _, _ ->\n DMExtractor()\n },\n \"dmm\" to { _, _ ->\n DMExtractor()\n },\n \"dmi\" to { _, _ ->\n DMExtractor()\n },\n \"dpr\" to { _, _ ->\n CommonExtractor(Lang.PASCAL)\n },\n \"edn\" to { _, _ ->\n CommonExtractor(Lang.CLOJURE)\n },\n \"el\" to { _, _ ->\n CommonExtractor(Lang.EMACSLISP)\n },\n \"elc\" to { _, _ ->\n CommonExtractor(Lang.EMACSLISP)\n },\n \"eliom\" to { _, _ ->\n CommonExtractor(Lang.OCAML)\n },\n \"elm\" to { _, _ ->\n CommonExtractor(Lang.ELM)\n },\n \"erl\" to { _, _ ->\n CommonExtractor(Lang.ERLANG)\n },\n \"ex\" to { _, _ ->\n ElixirExtractor\n },\n \"exs\" to { _, _ ->\n ElixirExtractor\n },\n \"f\" to { buf, _ ->\n if (ForthRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.FORTH)\n } else if (buf.contains(\"flowop\")) {\n CommonExtractor(Lang.FILEBENCHWML)\n } else if (FortranRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.FORTRAN)\n } else null\n },\n \"f03\" to { _, _ ->\n CommonExtractor(Lang.FORTRAN)\n },\n \"f08\" to { _, _ ->\n CommonExtractor(Lang.FORTRAN)\n },\n \"f15\" to { _, _ ->\n CommonExtractor(Lang.FORTRAN)\n },\n \"f90\" to { _, _ ->\n CommonExtractor(Lang.FORTRAN)\n },\n \"f95\" to { _, _ ->\n CommonExtractor(Lang.FORTRAN)\n },\n \"factor\" to { _, _ ->\n CommonExtractor(Lang.FACTOR)\n },\n \"fcgi\" to { buf, _ ->\n if (Perl5Regex.containsMatchIn(buf)) {\n PerlExtractor(Lang.PERL)\n } else {\n CommonExtractor(Lang.LUA)\n }\n },\n \"fnc\" to { _, _ ->\n CommonExtractor(Lang.PLSQL)\n },\n \"for\" to { buf, _ ->\n if (ForthRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.FORTH)\n } else if (FortranRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.FORTRAN)\n } else null\n },\n \"forth\" to { _, _ ->\n CommonExtractor(Lang.FORTH)\n },\n \"fp\" to { _, _ ->\n CommonExtractor(Lang.GLSL)\n },\n \"fr\" to { _, _ ->\n CommonExtractor(Lang.FORTH)\n },\n \"frag\" to { _, _ ->\n CommonExtractor(Lang.GLSL)\n },\n \"frg\" to { _, _ ->\n CommonExtractor(Lang.GLSL)\n },\n \"frt\" to { _, _ ->\n CommonExtractor(Lang.FORTH)\n },\n \"fs\" to { buf, _ ->\n if (ForthFsRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.FORTH)\n } else if (FSharpRegex.containsMatchIn(buf)) {\n FSharpExtractor()\n } else if (GlslRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.GLSL)\n } else if (FilterscriptRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.FILTERSCRIPT)\n } else null\n },\n \"fsh\" to { _, _ ->\n CommonExtractor(Lang.GLSL)\n },\n \"fsx\" to { _, _ ->\n FSharpExtractor()\n },\n \"fth\" to { _, _ ->\n CommonExtractor(Lang.FORTH)\n },\n \"fxml\" to { _, _ ->\n CommonExtractor(Lang.XML)\n },\n \"glsl\" to { _, _ ->\n CommonExtractor(Lang.GLSL)\n },\n \"go\" to { _, _ ->\n GoExtractor()\n },\n \"gradle\" to { _, _ ->\n CommonExtractor(Lang.GRADLE)\n },\n \"groovy\" to { _, _ ->\n CommonExtractor(Lang.GROOVY)\n },\n \"h\" to { buf, _ ->\n if (ObjectiveCRegex.containsMatchIn(buf)) {\n ObjectiveCExtractor()\n } else if (CppRegex.containsMatchIn(buf)) {\n CppExtractor()\n } else CExtractor()\n },\n \"h++\" to { _, _ ->\n CppExtractor()\n },\n \"hh\" to { _, _ ->\n CppExtractor()\n },\n \"hic\" to { _, _ ->\n CommonExtractor(Lang.CLOJURE)\n },\n \"hl\" to { _, _ ->\n CommonExtractor(Lang.CLOJURE)\n },\n \"hpp\" to { _, _ ->\n CppExtractor()\n },\n \"htm\" to { _, _ ->\n CommonExtractor(Lang.HTML)\n },\n \"html\" to { _, _ ->\n CommonExtractor(Lang.HTML)\n },\n \"hs\" to { _, _ ->\n CommonExtractor(Lang.HASKELL)\n },\n \"hrl\" to { _, _ ->\n CommonExtractor(Lang.ERLANG)\n },\n \"hx\" to { _, _ ->\n CommonExtractor(Lang.HAXE)\n },\n \"hxx\" to { _, _ ->\n CppExtractor()\n },\n \"hy\" to { _, _ ->\n CommonExtractor(Lang.HY)\n },\n \"ijs\" to { _, _ ->\n CommonExtractor(Lang.J)\n },\n \"inc\" to { buf, _ ->\n if (PhpRegex.containsMatchIn(buf)) {\n PhpExtractor()\n } else if (PovRaySdlRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.POVRAYSDL)\n } else if (PascalRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.PASCAL)\n } else {\n CommonExtractor(Lang.ASSEMBLY)\n }\n },\n \"inl\" to { _, _ ->\n CppExtractor()\n },\n \"ino\" to { _, _ ->\n CommonExtractor(Lang.ARDUINO)\n },\n \"ipynb\" to { _, _ ->\n IPythonExtractor()\n },\n \"java\" to { _, _ ->\n JavaExtractor()\n },\n \"jl\" to { _, _ ->\n CommonExtractor(Lang.JULIA)\n },\n \"js\" to { buf, _ ->\n if (bootstrapWebpackExp(buf)) {\n null\n }\n else JavascriptExtractor()\n },\n \"jsx\" to { _, _ ->\n JavascriptExtractor()\n },\n \"kt\" to { _, _ ->\n KotlinExtractor()\n },\n \"kojo\" to { _, _ ->\n ScalaExtractor\n },\n \"l\" to { buf, _ ->\n if (CommonLispRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.COMMONLISP)\n } else if (LexRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.LEX)\n } else if (RoffRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.ROFF)\n } else if (PicoLispRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.PICOLISP)\n } else null\n },\n \"lbx\" to { _, _ ->\n CommonExtractor(Lang.TEX)\n },\n \"less\" to { _, _ ->\n CssExtractor()\n },\n \"lhs\" to { _, _ ->\n CommonExtractor(Lang.HASKELL)\n },\n \"lisp\" to { buf, _ ->\n if (CommonLispRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.COMMONLISP)\n } else if (NewLispRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.NEWLISP)\n } else null\n },\n \"litcoffee\" to { _, _ ->\n CommonExtractor(Lang.COFFEESCRIPT)\n },\n \"lsp\" to { buf, _ ->\n if (CommonLispRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.COMMONLISP)\n } else if (NewLispRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.NEWLISP)\n } else null\n },\n \"lua\" to { _, _ ->\n CommonExtractor(Lang.LUA)\n },\n \"m\" to { buf, _ ->\n if (ObjectiveCRegex.containsMatchIn(buf)) {\n ObjectiveCExtractor()\n } else if (buf.contains(\":- module\")) {\n CommonExtractor(Lang.MERCURY)\n } else if (MufRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.MUF)\n } else if (MRegexs.any { re -> re.containsMatchIn(buf)}) {\n CommonExtractor(Lang.M)\n } else if (MathematicaRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.MATHEMATICA)\n } else if (MatlabRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.MATLAB)\n } else if (LimboRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.LIMBO)\n } else {\n CommonExtractor(Lang.WOLFRAM)\n }\n },\n \"make\" to { _, _ ->\n CommonExtractor(Lang.MAKEFILE)\n },\n \"makefile\" to { _, _ ->\n CommonExtractor(Lang.MAKEFILE)\n },\n \"mat\" to { _, _ ->\n CommonExtractor(Lang.MATLAB)\n },\n \"mjml\" to { _, _ ->\n CommonExtractor(Lang.XML)\n },\n \"ml\" to { buf, _ ->\n if (OcamlRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.OCAML)\n } else if (StandardMlRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.STANDARDML)\n } else null\n },\n \"mli\" to { _, _ ->\n CommonExtractor(Lang.OCAML)\n },\n \"mlx\" to { _, _ ->\n CommonExtractor(Lang.MATLAB)\n },\n \"mm\" to { _, _ ->\n ObjectiveCExtractor()\n },\n \"ms\" to { _, _ ->\n CommonExtractor(Lang.ROFF)\n },\n \"mt\" to { _, _ ->\n CommonExtractor(Lang.MATHEMATICA)\n },\n \"muf\" to { _, _ ->\n CommonExtractor(Lang.MUF)\n },\n \"mysql\" to { _, _ ->\n CommonExtractor(Lang.SQL)\n },\n \"n\" to { _, _ ->\n CommonExtractor(Lang.ROFF)\n },\n \"nasm\" to { _, _ ->\n CommonExtractor(Lang.ASSEMBLY)\n },\n \"nb\" to { buf, _ ->\n if (MathematicaRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.MATHEMATICA)\n } else CommonExtractor(Lang.WOLFRAM)\n },\n \"nl\" to { _, _ ->\n CommonExtractor(Lang.NEWLISP)\n },\n \"nr\" to { _, _ ->\n CommonExtractor(Lang.ROFF)\n },\n \"oxygene\" to { _, _ ->\n CommonExtractor(Lang.OXYGENE)\n },\n \"P\" to { _, _ ->\n CommonExtractor(Lang.PROLOG)\n },\n \"p6\" to { _, _ ->\n PerlExtractor(Lang.PERL6)\n },\n \"p8\" to { _, _ ->\n CommonExtractor(Lang.LUA)\n },\n \"pas\" to { _, _ ->\n CommonExtractor(Lang.PASCAL)\n },\n \"pascal\" to { _, _ ->\n CommonExtractor(Lang.PASCAL)\n },\n \"pck\" to { _, _ ->\n CommonExtractor(Lang.PLSQL)\n },\n \"pd_lua\" to { _, _ ->\n CommonExtractor(Lang.LUA)\n },\n \"pde\" to { _, _ ->\n CommonExtractor(Lang.PROCESSING)\n },\n \"php\" to { buf, path ->\n if (buf.contains(\"\n PhpExtractor()\n },\n \"php3\" to { _, _ ->\n PhpExtractor()\n },\n \"php4\" to { _, _ ->\n PhpExtractor()\n },\n \"php5\" to { _, _ ->\n PhpExtractor()\n },\n \"phps\" to { _, _ ->\n PhpExtractor()\n },\n \"pkb\" to { _, _ ->\n CommonExtractor(Lang.PLSQL)\n },\n \"pks\" to { _, _ ->\n CommonExtractor(Lang.PLSQL)\n },\n \"pl\" to { buf, _ ->\n if (PrologRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.PROLOG)\n } else if (Perl6Regex.containsMatchIn(buf)) {\n PerlExtractor(Lang.PERL6)\n } else {\n PerlExtractor(Lang.PERL)\n }\n },\n \"plb\" to { _, _ ->\n CommonExtractor(Lang.PLSQL)\n },\n \"pls\" to { _, _ ->\n CommonExtractor(Lang.PLSQL)\n },\n \"plsql\" to { _, _ ->\n CommonExtractor(Lang.PLSQL)\n },\n \"pm\" to { buf, _ ->\n if (Perl5Regex.containsMatchIn(buf)) {\n PerlExtractor(Lang.PERL)\n } else if (Perl6Regex.containsMatchIn(buf)) {\n PerlExtractor(Lang.PERL6)\n } else if (XpmRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.XPM)\n } else null\n },\n \"pm6\" to { _, _ ->\n PerlExtractor(Lang.PERL6)\n },\n \"pom\" to { _, _ ->\n CommonExtractor(Lang.MAVENPOM)\n },\n \"pov\" to { _, _ ->\n CommonExtractor(Lang.POVRAYSDL)\n },\n \"pp\" to { buf, _ ->\n if (PascalRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.PASCAL)\n } else {\n CommonExtractor(Lang.PUPPET)\n }\n },\n \"prc\" to { _, _ ->\n CommonExtractor(Lang.PLSQL)\n },\n \"pro\" to { buf, _ ->\n if (PrologRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.PROLOG)\n } else if (buf.contains(\"last_client=\")) {\n CommonExtractor(Lang.INI)\n } else if (buf.contains(\"HEADERS\") || buf.contains(\"SOURCES\")) {\n CommonExtractor(Lang.QMAKE)\n } else if (IdlRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.IDL)\n } else null\n },\n \"prolog\" to { _, _ ->\n CommonExtractor(Lang.PROLOG)\n },\n \"props\" to { buf, _ ->\n if (XmlPropsRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.XML)\n } else if (IniPropsRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.INI)\n } else null\n },\n \"ps1\" to { _, _ ->\n CommonExtractor(Lang.POWERSHELL)\n },\n \"psd1\" to { _, _ ->\n CommonExtractor(Lang.POWERSHELL)\n },\n \"psm1\" to { _, _ ->\n CommonExtractor(Lang.POWERSHELL)\n },\n \"py\" to { _, _ ->\n PythonExtractor()\n },\n \"py3\" to { _, _ ->\n PythonExtractor()\n },\n \"qml\" to { _, _ ->\n CommonExtractor(Lang.QML)\n },\n \"r\" to { buf, _ ->\n if (RebolRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.REBOL)\n } else if (RRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.R)\n } else null\n },\n \"r2\" to { _, _ ->\n CommonExtractor(Lang.REBOL)\n },\n \"r3\" to { _, _ ->\n CommonExtractor(Lang.REBOL)\n },\n \"rb\" to { _, _ ->\n RubyExtractor()\n },\n \"rbw\" to { _, _ ->\n RubyExtractor()\n },\n \"rd\" to { _, _ ->\n CommonExtractor(Lang.R)\n },\n \"re\" to { _, _ ->\n CommonExtractor(Lang.OCAML)\n },\n \"reb\" to { _, _ ->\n CommonExtractor(Lang.REBOL)\n },\n \"rebol\" to { _, _ ->\n CommonExtractor(Lang.REBOL)\n },\n \"rno\" to { _, _ ->\n CommonExtractor(Lang.ROFF)\n },\n \"rpy\" to { buf, _ ->\n if (PythonRegex.containsMatchIn(buf)) {\n PythonExtractor()\n } else CommonExtractor(Lang.RENPY)\n },\n \"rs\" to { buf, _ ->\n if (RustRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.RUST)\n } else if (RenderscriptRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.RENDERSCRIPT)\n } else null\n },\n \"rsh\" to { _, _ ->\n CommonExtractor(Lang.RENDERSCRIPT)\n },\n \"rsx\" to { _, _ ->\n CommonExtractor(Lang.R)\n },\n \"s\" to { _, _ ->\n CommonExtractor(Lang.ASSEMBLY)\n },\n \"sas\" to { _, _ ->\n CommonExtractor(Lang.SAS)\n },\n \"sass\" to { _, _ ->\n CssExtractor()\n },\n \"sbt\" to { _, _ ->\n ScalaExtractor\n },\n \"sc\" to { buf, _ ->\n if (SupercolliderRegexs.any { re -> re.containsMatchIn(buf) }) {\n CommonExtractor(Lang.SUPERCOLLIDER)\n } else if (ScalaRegex.containsMatchIn(buf)) {\n ScalaExtractor\n } else null\n },\n \"scala\" to { _, _ ->\n ScalaExtractor\n },\n \"scd\" to { _, _ ->\n CommonExtractor(Lang.SUPERCOLLIDER)\n },\n \"sch\" to { _, _ ->\n CommonExtractor(Lang.SCHEME)\n },\n \"scm\" to { _, _ ->\n CommonExtractor(Lang.SCHEME)\n },\n \"scss\" to { _, _ ->\n CssExtractor()\n },\n \"sexp\" to { _, _ ->\n CommonExtractor(Lang.COMMONLISP)\n },\n \"sh\" to { _, _ ->\n CommonExtractor(Lang.SHELL)\n },\n \"shader\" to { _, _ ->\n CommonExtractor(Lang.GLSL)\n },\n \"sld\" to { _, _ ->\n CommonExtractor(Lang.SCHEME)\n },\n \"sls\" to { _, _ ->\n CommonExtractor(Lang.SCHEME)\n },\n \"sol\" to { _, _ ->\n CommonExtractor(Lang.SOLIDITY)\n },\n \"spc\" to { _, _ ->\n CommonExtractor(Lang.PLSQL)\n },\n \"sps\" to { _, _ ->\n CommonExtractor(Lang.SCHEME)\n },\n \"sql\" to { buf, _ ->\n if (PlpgsqlRegexs.any { re -> re.containsMatchIn(buf)}) {\n PlpgsqlExtractor // PostgreSQL.\n } else if (SqlplRegexs.any { re -> re.containsMatchIn(buf)}) {\n CommonExtractor(Lang.SQLPL) // IBM DB2.\n } else if (PlsqlRegexs.any { re -> re.containsMatchIn(buf)}) {\n CommonExtractor(Lang.PLSQL) // Oracle.\n } else {\n CommonExtractor(Lang.SQL) // Generic SQL.\n }\n },\n \"ss\" to { _, _ ->\n CommonExtractor(Lang.SCHEME)\n },\n \"st\" to { _, _ ->\n CommonExtractor(Lang.SMALLTALK)\n },\n \"swift\" to { _, _ ->\n SwiftExtractor\n },\n \"t\" to { buf, _ ->\n if (Perl6Regex.containsMatchIn(buf)) {\n PerlExtractor(Lang.PERL6)\n } else {\n PerlExtractor(Lang.PERL)\n }\n },\n \"tab\" to { _, _ ->\n CommonExtractor(Lang.SQL)\n },\n \"tcl\" to { _, _ ->\n CommonExtractor(Lang.TCL)\n },\n \"tesc\" to { _, _ ->\n CommonExtractor(Lang.GLSL)\n },\n \"tese\" to { _, _ ->\n CommonExtractor(Lang.GLSL)\n },\n \"tex\" to { _, _ ->\n CommonExtractor(Lang.TEX)\n },\n \"tmac\" to { _, _ ->\n CommonExtractor(Lang.ROFF)\n },\n \"toc\" to { _, _ ->\n CommonExtractor(Lang.TEX)\n },\n \"tpb\" to { _, _ ->\n CommonExtractor(Lang.PLSQL)\n },\n \"tps\" to { _, _ ->\n CommonExtractor(Lang.PLSQL)\n },\n \"trg\" to { _, _ ->\n CommonExtractor(Lang.PLSQL)\n },\n \"ts\" to { buf, _ ->\n if (XmltsRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.XML)\n } else {\n TypescriptExtractor()\n }\n },\n \"tsx\" to { buf, _ ->\n if (TypescriptRegex.containsMatchIn(buf)) {\n TypescriptExtractor()\n } else if (XmlRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.XML)\n } else null\n },\n \"udf\" to { _, _ ->\n CommonExtractor(Lang.SQL)\n },\n \"ux\" to { _, _ ->\n CommonExtractor(Lang.XML)\n },\n \"v\" to { buf, _ ->\n if (CoqRegex.containsMatchIn(buf)) {\n CommonExtractor(Lang.COQ)\n } else {\n CommonExtractor(Lang.VERILOG)\n }\n },\n \"vb\" to { _, _ ->\n CommonExtractor(Lang.VISUALBASIC)\n },\n \"vba\" to { _, _ ->\n CommonExtractor(Lang.VBA)\n },\n \"vhdl\" to { _, _ ->\n CommonExtractor(Lang.VHDL)\n },\n \"vbhtml\" to { _, _ ->\n CommonExtractor(Lang.VISUALBASIC)\n },\n \"vim\" to { _, _ ->\n CommonExtractor(Lang.VIML)\n },\n \"viw\" to { _, _ ->\n CommonExtractor(Lang.SQL)\n },\n \"vrx\" to { _, _ ->\n CommonExtractor(Lang.GLSL)\n },\n \"vsh\" to { _, _ ->\n CommonExtractor(Lang.GLSL)\n },\n \"vue\" to { _, _ ->\n JavascriptExtractor()\n },\n \"svelte\" to { _, _ ->\n JavascriptExtractor()\n },\n \"vw\" to { _, _ ->\n CommonExtractor(Lang.PLSQL)\n },\n \"wl\" to { _, _ ->\n CommonExtractor(Lang.MATHEMATICA)\n },\n \"wlt\" to { _, _ ->\n CommonExtractor(Lang.MATHEMATICA)\n },\n \"xml\" to { _, _ ->\n CommonExtractor(Lang.XML)\n },\n \"xpm\" to { _, _ ->\n CommonExtractor(Lang.XPM)\n },\n \"xtend\" to { _, _ ->\n CommonExtractor(Lang.XTEND)\n },\n \"yap\" to { _, _ ->\n CommonExtractor(Lang.PROLOG)\n },\n // DevOps.\n \"yaml\" to { buf, _ ->\n when {\n k8sExp(buf) -> {\n DevopsExtractor(DevopsExtractor.K8S)\n }\n else -> null\n }\n },\n \"yml\" to { buf, path ->\n when {\n path.endsWith(\"docker-compose.yml\") -> {\n DevopsExtractor(DevopsExtractor.DOCKER)\n }\n path.endsWith(\".gitlab-ci.yml\") -> {\n DevopsExtractor(DevopsExtractor.GITLAB_CI)\n }\n path.endsWith(\".travis.yml\") -> {\n DevopsExtractor(DevopsExtractor.TRAVIS)\n }\n path.endsWith(\".circleci/config.yml\") -> {\n DevopsExtractor(DevopsExtractor.CIRCLECI)\n }\n path.endsWith(\".drone.yml\") -> {\n DevopsExtractor(DevopsExtractor.DRONE)\n }\n path.contains(\".github/workflows/\") -> {\n DevopsExtractor(DevopsExtractor.GITHUB_ACTIONS)\n }\n k8sExp(buf) -> {\n DevopsExtractor(DevopsExtractor.K8S)\n }\n else -> null\n }\n },\n \"json\" to { buf, _ ->\n when {\n k8sExp(buf) -> {\n DevopsExtractor(DevopsExtractor.K8S)\n }\n else -> null\n }\n },\n \"dockerfile\" to { _, _ ->\n DevopsExtractor(DevopsExtractor.DOCKER)\n },\n \"jenkinsfile\" to { _, _ ->\n DevopsExtractor(DevopsExtractor.JENKINS)\n },\n \"\" to { _, path ->\n when {\n path.endsWith(\"dockerfile\") -> {\n DevopsExtractor(DevopsExtractor.DOCKER)\n }\n path.endsWith(\"jenkinsfile\") -> {\n DevopsExtractor(DevopsExtractor.JENKINS)\n }\n else -> null\n }\n }\n)\n" }, { "path": "src/main/kotlin/app/extractors/IPythonExtractor.kt", "content": "// Copyright 2019 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n\npackage app.extractors\n\nimport app.model.CommitStats\nimport app.model.DiffContent\nimport app.model.DiffFile\nimport app.model.DiffRange\nimport org.json.JSONObject\n\nclass IPythonExtractor : ExtractorInterface{\n companion object {\n const val LANGUAGE_NAME = Lang.PYTHON\n private val pythonExtractor = PythonExtractor()\n }\n\n private fun getCodeContent(diffContent: DiffContent): DiffContent {\n if (diffContent.content.isEmpty()) {\n return diffContent\n }\n\n val code = JSONObject(\n diffContent.content.joinToString(\"\\n\"))\n .optJSONArray(\"cells\")?.let {\n 0.until(it.length()).map { i -> it.optJSONObject(i) }\n }?.filter {\n it.optString(\"cell_type\") == \"code\"\n }?.filter {\n it.optJSONArray(\"source\") != null\n }?.map { it.optJSONArray(\"source\").map {line -> line.toString()}}\n\n val content = code?.fold(mutableListOf()) {\n acc: MutableList, x: List ->\n acc.addAll(x)\n acc\n } ?: listOf()\n\n return DiffContent(content = content,\n ranges = listOf(DiffRange(0, content.size)),\n imports = diffContent.imports)\n }\n\n override fun extract(files: List): List {\n files.forEach { file ->\n file.old = getCodeContent(file.old)\n file.new = getCodeContent(file.new)\n file.lang = LANGUAGE_NAME\n }\n return pythonExtractor.extract(files)\n }\n\n override fun extractImports(fileContent: List): List {\n return pythonExtractor.extractImports(fileContent)\n }\n\n override fun tokenize(line: String): List {\n return pythonExtractor.tokenize(line)\n }\n\n override fun getLanguageName(): String? {\n return LANGUAGE_NAME\n }\n}\n" }, { "path": "src/main/kotlin/app/extractors/JavaExtractor.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n\npackage app.extractors\n\nimport app.model.CommitStats\nimport app.model.DiffFile\n\nclass JavaExtractor : ExtractorInterface {\n companion object {\n const val LANGUAGE_NAME = Lang.JAVA\n val KEYWORDS = listOf(\"abstract\", \"continue\", \"for\", \"new\", \"switch\",\n \"assert\", \"default\", \"goto\", \"package\", \"synchronized\", \"boolean\",\n \"do\", \"if\", \"private\", \"this\", \"break\", \"double\", \"implements\",\n \"protected\", \"throw\", \"byte\", \"else\", \"import\", \"public\", \"throws\",\n \"case\", \"enum\", \"instanceof\", \"return\", \"transient\", \"catch\",\n \"extends\", \"int\", \"short\", \"try\", \"char\", \"final\", \"interface\",\n \"static\", \"void\", \"class\", \"finally\", \"long\", \"strictfp\",\n \"volatile\", \"const\", \"float\", \"native\", \"super\", \"while\")\n val importRegex = Regex(\"\"\"^(.*import)\\s[^\\n]*\"\"\")\n val commentRegex = Regex(\"\"\"^([^\\n]*//)[^\\n]*\"\"\")\n val packageRegex = Regex(\"\"\"^(.*package)\\s[^\\n]*\"\"\")\n val extractImportRegex = Regex(\"\"\"import\\s+(\\w+[.\\w+]*)\"\"\")\n }\n\n override fun extract(files: List): List {\n val stats = super.extract(files).toMutableList()\n\n // Keywords stats.\n val added = files.fold(mutableListOf(), { total, file ->\n total.addAll(file.getAllAdded())\n total\n })\n val deleted = files.fold(mutableListOf(), { total, file ->\n total.addAll(file.getAllDeleted())\n total\n })\n\n KEYWORDS.forEach { keyword ->\n val totalAdded = added.count { line -> line.contains(keyword)}\n val totalDeleted = deleted.count { line -> line.contains(keyword)}\n if (totalAdded > 0 || totalDeleted > 0) {\n stats.add(CommitStats(\n numLinesAdded = totalAdded,\n numLinesDeleted = totalDeleted,\n type = ExtractorInterface.TYPE_KEYWORD,\n tech = LANGUAGE_NAME + ExtractorInterface.SEPARATOR +\n keyword\n ))\n }\n }\n\n return stats\n }\n\n override fun extractImports(fileContent: List): List {\n val imports = mutableSetOf()\n\n fileContent.forEach {\n val res = extractImportRegex.find(it)\n if (res != null) {\n val importedName = res.groupValues[1]\n imports.add(importedName)\n }\n }\n\n return imports.toList()\n }\n\n override fun tokenize(line: String): List {\n var newLine = importRegex.replace(line, \"\")\n newLine = commentRegex.replace(newLine, \"\")\n newLine = packageRegex.replace(newLine, \"\")\n return super.tokenize(newLine)\n }\n\n override fun mapImportToIndex(import: String, lang: String,\n startsWith: Boolean): String? {\n return super.mapImportToIndex(import, lang, startsWith = true)\n }\n\n override fun getLanguageName(): String? {\n return LANGUAGE_NAME\n }\n}\n" }, { "path": "src/main/kotlin/app/extractors/JavascriptExtractor.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.extractors\n\nimport app.model.CommitStats\nimport app.model.DiffFile\n\nclass JavascriptExtractor : ExtractorInterface {\n companion object {\n const val LANGUAGE_NAME = Lang.JAVASCRIPT\n val splitRegex = Regex(\"\"\"\\s+|,|;|:|\\*|\\n|\\(|\\)|\\[|]|\\{|}|\\+|=|\\.|>|<|#|@|\\$\"\"\")\n val multilineCommentRegex = Regex(\"\"\"/\\*.+?\\*/\"\"\")\n val twoOrMoreWordsRegex = Regex(\"\"\"(\".+?\\s.+?\"|'.+?\\s.+?')\"\"\")\n val commentRegex = Regex(\"\"\"^([^\\n]*//)[^\\n]*\"\"\")\n }\n\n override fun extractImports(fileContent: List): List {\n val line = fileContent.map { line -> commentRegex.replace(line, \"\") }\n .joinToString(separator = \" \").toLowerCase()\n val fileTokens = multilineCommentRegex.replace(\n twoOrMoreWordsRegex.replace(line, \"\"), \"\").split(splitRegex)\n return fileTokens.distinct()\n }\n\n override fun extractLibStats(files: List): List {\n val vueExtension = \".vue\"\n val svelteExtension = \".svelte\"\n val quasarConf = \"quasar.conf.js\"\n\n val vueFiles = files.filter { it.path.endsWith(vueExtension) }\n val svelteFiles = files.filter { it.path.endsWith(svelteExtension) }\n val quasarFile = files.find { it.path.endsWith(quasarConf) }\n val otherFiles = files.filter {\n !it.path.endsWith(vueExtension) &&\n !it.path.endsWith(svelteExtension) &&\n !it.path.endsWith(quasarConf)\n }\n\n // Add stats from *.vue files.\n val vueStats = listOf(CommitStats(\n numLinesAdded = vueFiles.map { it.getAllAdded().size }.sum(),\n numLinesDeleted = vueFiles.map { it.getAllDeleted().size }.sum(),\n type = ExtractorInterface.TYPE_LIBRARY,\n tech = \"js.vue\"\n )).filter { it.numLinesAdded > 0 || it.numLinesDeleted > 0 }\n\n // Add stats from *.svelte files.\n val svelteStats = listOf(CommitStats(\n numLinesAdded = svelteFiles.map { it.getAllAdded().size }.sum(),\n numLinesDeleted = svelteFiles.map { it.getAllDeleted().size }.sum(),\n type = ExtractorInterface.TYPE_LIBRARY,\n tech = \"js.svelte\"\n )).filter { it.numLinesAdded > 0 || it.numLinesDeleted > 0 }\n\n var stats = vueStats + svelteStats + super.extractLibStats(otherFiles)\n if (quasarFile == null) {\n return stats;\n }\n\n val quasarStats = listOf(CommitStats(\n numLinesAdded = quasarFile.getAllAdded().size,\n numLinesDeleted = quasarFile.getAllDeleted().size,\n type = ExtractorInterface.TYPE_LIBRARY,\n tech = \"js.quasar\"\n )).filter { it.numLinesAdded > 0 || it.numLinesDeleted > 0 }\n\n return quasarStats + stats;\n }\n\n override fun tokenize(line: String): List {\n return super.tokenize(commentRegex.replace(line, \"\"))\n }\n\n override fun mapImportToIndex(import: String, lang: String,\n startsWith: Boolean): String? {\n return super.mapImportToIndex(import, lang, startsWith = true)\n }\n\n override fun getLanguageName(): String? {\n return LANGUAGE_NAME\n }\n}\n" }, { "path": "src/main/kotlin/app/extractors/KotlinExtractor.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.extractors\n\nclass KotlinExtractor : ExtractorInterface {\n companion object {\n const val LANGUAGE_NAME = Lang.KOTLIN\n val importRegex = Regex(\"\"\"^(.*import)\\s[^\\n]*\"\"\")\n val commentRegex = Regex(\"\"\"^([^\\n]*//)[^\\n]*\"\"\")\n val packageRegex = Regex(\"\"\"^(.*package)\\s[^\\n]*\"\"\")\n val extractImportRegex = Regex(\"\"\"import\\s+(\\w+[.\\w+]*)\"\"\")\n }\n\n override fun extractImports(fileContent: List): List {\n val imports = mutableSetOf()\n\n fileContent.forEach {\n val res = extractImportRegex.find(it)\n if (res != null) {\n val importedName = res.groupValues[1]\n imports.add(importedName)\n }\n }\n\n return imports.toList()\n }\n\n override fun tokenize(line: String): List {\n var newLine = importRegex.replace(line, \"\")\n newLine = commentRegex.replace(newLine, \"\")\n newLine = packageRegex.replace(newLine, \"\")\n return super.tokenize(newLine)\n }\n\n override fun mapImportToIndex(import: String, lang: String,\n startsWith: Boolean): String? {\n return super.mapImportToIndex(import, lang, startsWith = true)\n }\n\n override fun getLanguageName(): String? {\n return LANGUAGE_NAME\n }\n}\n" }, { "path": "src/main/kotlin/app/extractors/Languages.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Alexander Surkov (alex@sourcerer.io)\n\npackage app.extractors\n\nobject Lang {\n const val ACTIONSCRIPT = \"actionscript\" // ActionScript\n const val ANGELSCRIPT = \"angelscript\" // AngelScript\n const val ASSEMBLY = \"assembly\" // Assembly\n const val ARDUINO = \"arduino\" // Arduino\n const val C = \"c\" // C\n const val COQ = \"coq\" // Coq\n const val CPP = \"cpp\" // C++\n const val CRYSTAL = \"crystal\" // Crystal\n const val CSHARP = \"csharp\" // C#\n const val CSS = \"css\" // CSS\n const val CLOJURE = \"clojure\" // Clojure\n const val COBOL = \"cobol\" // COBOL\n const val COFFEESCRIPT = \"coffeescript\" // CoffeeScript\n const val COMMONLISP = \"lisp\" // Common Lisp\n const val CUDA = \"cuda\" // Cuda\n const val D = \"d\" // D\n const val DART = \"dart\" // Dart\n const val DM = \"dm\" // DM Language\n const val DOSBATCH = \"dosbatch\" // DOS Batch\n const val DTRACE = \"dtrace\" // DTrace\n const val ELIXIR = \"elixir\" // Elixir\n const val ELM = \"elm\" // Elm\n const val EMACSLISP = \"emacslisp\" // Emacs Lisp\n const val ERLANG = \"erlang\" // Erlang\n const val FACTOR = \"factor\" // Factor\n const val FILEBENCHWML = \"filebench_wml\" // Filebench WML\n const val FILTERSCRIPT = \"filterscript\" // Filterscript\n const val FORTH = \"forth\" // Forth\n const val FORTRAN = \"fortran\" // Fortran\n const val FSHARP = \"fsharp\" // F#\n const val GLSL = \"glsl\" // GLSL\n const val GO = \"go\" // Go\n const val GRADLE = \"gradle\" // Gradle\n const val GROOVY = \"groovy\" // Groovy\n const val HACK = \"hack\" // Hack\n const val HASKELL = \"haskell\" // Haskell\n const val HAXE = \"haxe\" // Haxe\n const val HTML = \"html\" // HTML\n const val HY = \"hy\" // Hy\n const val IDL = \"idl\" // IDL\n const val INI = \"ini\" // INI\n const val J = \"j\" // J\n const val JAVA = \"java\" // Java\n const val JAVASCRIPT = \"javascript\" // JavaScript\n const val JULIA = \"julia\" // Julia\n const val KOTLIN = \"kotlin\" // Kotlin\n const val LIMBO = \"limbo\" // Limbo\n const val LEX = \"lex\" // Lex\n const val LUA = \"lua\" // Lua\n const val M = \"m\" // M\n const val MAKEFILE = \"makefile\" // Makefile\n const val MATHEMATICA = \"mathematica\" // Mathematica\n const val MATLAB = \"matlab\" // Matlab\n const val MAVENPOM = \"maven\" // Maven POM\n const val MUF = \"muf\" // MUF\n const val MERCURY = \"mercury\" // Mercury\n const val NEWLISP = \"newlisp\" // NewLisp\n const val OBJECTIVEC = \"objectivec\" // Objective-C\n const val OCAML = \"ocaml\" // OCaml\n const val OXYGENE = \"oxygene\" // Oxygene\n const val PASCAL = \"pascal\" // Pascal\n const val PERL = \"perl\" // Perl\n const val PERL6 = \"perl6\" // Perl 6\n const val PHP = \"php\" // PHP\n const val PICOLISP = \"picolisp\" // PicoLisp\n const val PLPGSQL = \"plpgsql\" // PLpgSQL\n const val PLSQL = \"plsql\" // PLSQL\n const val POVRAYSDL = \"pov-ray_sdl\" // POV-Ray SDL\n const val POWERSHELL = \"powershell\" // PowerShell\n const val PUPPET = \"puppet\" // Puppet\n const val PROCESSING = \"processing\" // Processing\n const val PROLOG = \"prolog\" // Prolog\n const val PYTHON = \"python\" // Python\n const val QMAKE = \"qmake\" // QMake\n const val QML = \"qml\" // QML\n const val R = \"r\" // R\n const val REBOL = \"rebol\" // Rebol\n const val RENDERSCRIPT = \"renderscript\" // RenderScript\n const val RENPY = \"renpy\" // Ren'Py\n const val ROFF = \"roff\" // Roff\n const val RUBY = \"ruby\" // Ruby\n const val RUST = \"rust\" // Rust\n const val SAS = \"sas\" // SAS\n const val SCALA = \"scala\" // Scala\n const val SCHEME = \"scheme\" // Scheme\n const val SHELL = \"shell\" // Shell\n const val SMALLTALK = \"smalltalk\" // Smalltalk\n const val SOLIDITY = \"solidity\" // Solidity\n const val SQL = \"sql\" // SQL\n const val SQLPL = \"sqlpl\" // SQLPL\n const val STANDARDML = \"standard_ml\" // Standard ML\n const val SUPERCOLLIDER = \"supercollider\" // SuperCollider\n const val SWIFT = \"swift\" // Swift\n const val TCL = \"tcl\" // Tcl\n const val TEX = \"tex\" // TeX\n const val TYPESCRIPT = \"typescript\" // TypeScript\n const val VERILOG = \"verilog\" // Verilog\n const val VISUALBASIC = \"visualbasic\" // Visual Basic\n const val VBA = \"visualbasicforapps\" // Visual Basic for Applications\n const val VHDL = \"vhdl\" // VHDL\n const val VIML = \"viml\" // Vim L\n const val VUE = \"vue\" // Vue\n const val SVELTE = \"svelte\" // Svelte\n const val WOLFRAM = \"wolframlanguage\" // Wolfram Language\n const val XML = \"xml\" // XML\n const val XPM = \"xpm\" // XPM\n const val XTEND = \"xtend\" // Xtend\n}\n" }, { "path": "src/main/kotlin/app/extractors/ObjectiveCExtractor.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.extractors\n\nclass ObjectiveCExtractor : ExtractorInterface {\n companion object {\n const val LANGUAGE_NAME = Lang.OBJECTIVEC\n val importRegex = Regex(\"\"\"^([^\\n]*[#@](import|include))\\s[^\\n]*\"\"\")\n val commentRegex = Regex(\"\"\"^([^\\n]*//)[^\\n]*\"\"\")\n val sharpImportIncludeRegex =\n Regex(\"\"\"[#@](import|include)\\s+[\"<](\\w+)[/\\w+]*\\.\\w+[\">]\"\"\")\n val atImportRegex = Regex(\"\"\"@import\\s+(\\w+)\"\"\")\n }\n\n override fun extractImports(fileContent: List): List {\n val imports = mutableSetOf()\n\n fileContent.forEach {\n val res = sharpImportIncludeRegex.findAll(it) +\n atImportRegex.findAll(it)\n if (res.toList().isNotEmpty()) {\n val lineLib = res.toList().map { it.groupValues }.last().last()\n imports.add(lineLib)\n }\n }\n\n return imports.toList()\n }\n\n override fun tokenize(line: String): List {\n var newLine = importRegex.replace(line, \"\")\n newLine = commentRegex.replace(newLine, \"\")\n return super.tokenize(newLine)\n }\n\n override fun getLanguageName(): String? {\n return LANGUAGE_NAME\n }\n}\n" }, { "path": "src/main/kotlin/app/extractors/PerlExtractor.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Alexander Surkov (alex@sourcerer.io)\n\npackage app.extractors\n\nclass PerlExtractor(private val language: String) : ExtractorBase(\n language,\n importRegex = Regex(\"\"\"^use (.+);\"\"\"),\n commentRegex = Regex(\"\"\"([^\\n]*#.*$)\"\"\"),\n importStartsWith = true) {\n\n override fun mapImportToIndex(import: String, lang: String,\n startsWith: Boolean): String? {\n // Perl and Perl6 share libraries\n return super.mapImportToIndex(import, Lang.PERL, startsWith)\n }\n}" }, { "path": "src/main/kotlin/app/extractors/PhpExtractor.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.extractors\n\nclass PhpExtractor : ExtractorInterface {\n companion object {\n const val LANGUAGE_NAME = Lang.PHP\n val importRegex = Regex(\"\"\"^(.*require|require_once|include|\"\"\" +\n \"\"\"include_once|use)\\s[^\\n]*\"\"\")\n val commentRegex = Regex(\"\"\"^([^\\n]*//)[^\\n]*\"\"\")\n val useRegex = Regex(\"\"\"use\\s+(\\w+)[\\\\\\w+]*\"\"\")\n val requireIncludeRegex = Regex(\"\"\"(require|require_once|include|\"\"\" +\n \"\"\"\"include_once)\\s*[(]?'(\\w+)[.\\w+]*'[)]?\"\"\")\n }\n\n override fun extractImports(fileContent: List): List {\n val imports = mutableSetOf()\n\n fileContent.forEach {\n val res = useRegex.findAll(it) + requireIncludeRegex.findAll(it)\n if (res.toList().isNotEmpty()) {\n val lineLib = res.toList().map { it.groupValues }.last().last()\n imports.add(lineLib)\n }\n }\n\n return imports.toList()\n }\n\n override fun tokenize(line: String): List {\n var newLine = importRegex.replace(line, \"\")\n newLine = commentRegex.replace(newLine, \"\")\n return super.tokenize(newLine)\n }\n\n override fun getLanguageName(): String? {\n return LANGUAGE_NAME\n }\n}\n" }, { "path": "src/main/kotlin/app/extractors/PlpgsqlExtractor.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Alexander Surkov (alex@sourcerer.io)\n\npackage app.extractors\n\nobject PlpgsqlExtractor : ExtractorBase(\n language = Lang.PLPGSQL,\n importRegex = Regex(\"\"\".+CREATE (?:EXTENSION|LANGUAGE) ([a-zA-Z_][a-zA-Z0-9_]*)\"\"\"),\n commentRegex = Regex(\"\"\"(--.*$)|(/[*].*?[*]/)\"\"\"))\n" }, { "path": "src/main/kotlin/app/extractors/PythonExtractor.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.extractors\n\nimport app.model.CommitStats\nimport app.model.DiffFile\n\nclass PythonExtractor : ExtractorInterface {\n companion object {\n const val LANGUAGE_NAME = Lang.PYTHON\n const val COMPREHENSION_MAP = \"map\"\n const val COMPREHENSION_LIST = \"list\"\n val docImportRegex = Regex(\"\"\"^([^\\n]*#|\\s*\\\"\\\"\\\"|\\s*import|\"\"\" +\n \"\"\"\\s*from)[^\\n]*\"\"\")\n val commentRegex = Regex(\"\"\"^(.*#).*\"\"\")\n val extractImportRegex = Regex(\"\"\"(from\\s+(\\w+)[.\\w+]*\\s+import|\"\"\" +\n \"\"\"import\\s+(\\w+(,\\s*\\w+)*))(as\\s+)*\"\"\")\n val mapRegex = Regex(\"\"\"(map\\([^,]+?,)\"\"\")\n val listRegex = Regex(\"\"\"\\[.+? for .+? in .+?]\"\"\")\n val lineEndRegex = Regex(\"\"\",\\s*\"\"\")\n }\n\n override fun extract(files: List): List {\n val stats = super.extract(files).toMutableList()\n\n // List comprehension fun fact.\n val allAdded = files.map{ file -> file.getAllAdded() }.flatten()\n val allDeleted = files.map{ file -> file.getAllDeleted() }.flatten()\n\n val mapAllAdded = allAdded.fold(0) { total, line ->\n total + mapRegex.findAll(line).toList().size }\n val mapAllDeleted = allDeleted.fold(0) { total, line ->\n total + mapRegex.findAll(line).toList().size }\n\n val listAllAdded = allAdded.fold(0) { total, line ->\n total + listRegex.findAll(line).toList().size }\n val listAllDeleted = allDeleted.fold(0) { total, line ->\n total + listRegex.findAll(line).toList().size }\n\n if (mapAllAdded > 0 || mapAllDeleted > 0) {\n stats.add(CommitStats(\n mapAllAdded, mapAllDeleted, ExtractorInterface.TYPE_SYNTAX,\n tech = LANGUAGE_NAME + ExtractorInterface.SEPARATOR +\n COMPREHENSION_MAP\n ))\n }\n\n if (listAllAdded > 0 || listAllDeleted > 0) {\n stats.add(CommitStats(\n listAllAdded, listAllDeleted, ExtractorInterface.TYPE_SYNTAX,\n tech = LANGUAGE_NAME + ExtractorInterface.SEPARATOR +\n COMPREHENSION_LIST\n ))\n }\n\n return stats\n }\n\n override fun extractImports(fileContent: List): List {\n val imports = mutableSetOf()\n\n fileContent.forEach {\n val res = extractImportRegex.find(it)\n if (res != null) {\n val lineLibs = res.groupValues.last {\n it != \"\" && !it.startsWith(',')\n }.split(lineEndRegex)\n imports.addAll(lineLibs)\n }\n }\n\n val filteredImports = imports.filter { import ->\n !import.endsWith(\"_pb\") && !import.endsWith(\"_pb2\")\n }.toMutableList()\n if (filteredImports.size < imports.size) {\n filteredImports.add(\"pb\")\n }\n return filteredImports\n\n }\n\n override fun tokenize(line: String): List {\n var newLine = docImportRegex.replace(line, \"\")\n newLine = commentRegex.replace(newLine, \"\")\n return super.tokenize(newLine)\n }\n\n override fun getLanguageName(): String? {\n return LANGUAGE_NAME\n }\n}\n" }, { "path": "src/main/kotlin/app/extractors/RubyExtractor.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.extractors\n\nclass RubyExtractor : ExtractorInterface {\n companion object {\n const val LANGUAGE_NAME = Lang.RUBY\n val importRegex = Regex(\"\"\"(require\\s+'(\\w+)'|load\\s+'(\\w+)\\.\\w+')\"\"\")\n val commentRegex = Regex(\"\"\"^([^\\n]*#)[^\\n]*\"\"\")\n val extractImportRegex =\n Regex(\"\"\"(require\\s+'(.+)'|load\\s+'(\\w+)\\.\\w+')\"\"\")\n val includeRegex = Regex(\"\"\"include\\s+(\\w+)::.+\"\"\")\n }\n\n override fun extractImports(fileContent: List): List {\n val imports = mutableSetOf()\n\n fileContent.forEach {\n val res = extractImportRegex.find(it)\n if (res != null) {\n val lineLib = res.groupValues.last { it != \"\" }\n imports.add(lineLib)\n }\n }\n\n // Try to parse `include ` when imports are in external file.\n if (imports.isEmpty()) {\n fileContent.forEach {\n val res = includeRegex.find(it)\n if (res != null) {\n imports.add(res.groupValues.last().toLowerCase())\n }\n }\n }\n\n return imports.toList()\n }\n\n override fun tokenize(line: String): List {\n var newLine = importRegex.replace(line, \"\")\n newLine = commentRegex.replace(newLine, \"\")\n return super.tokenize(newLine)\n }\n \n override fun mapImportToIndex(import: String, lang: String,\n startsWith: Boolean): String? {\n return super.mapImportToIndex(import, lang, startsWith = true)\n }\n\n override fun determineLibs(line: String,\n importedLibs: List): List {\n // TODO(lyaronskaya): Case with no imports.\n val libraries = importedLibs + \"rb.rails\"\n\n return super.determineLibs(line, libraries)\n }\n\n override fun getLanguageName(): String? {\n return LANGUAGE_NAME\n }\n}\n" }, { "path": "src/main/kotlin/app/extractors/RustExtractor.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Alexander Surkov (alex@sourcerer.io)\n\npackage app.extractors\n\nclass RustExtractor : ExtractorInterface {\n companion object {\n const val LANGUAGE_NAME = Lang.RUST\n val importRegex = Regex(\"\"\"^extern crate \\w+;$\"\"\")\n val commentRegex = Regex(\"(//.+$)|(/[*].*?[*]/)\")\n val extractImportRegex = Regex(\"\"\"^extern crate (\\w+);$\"\"\")\n }\n\n override fun extractImports(fileContent: List): List {\n val imports = mutableSetOf()\n\n fileContent.forEach {\n val res = extractImportRegex.find(it)\n if (res != null) {\n val lineLib = res.groupValues[1]\n imports.add(lineLib)\n }\n }\n\n return imports.toList()\n }\n\n override fun tokenize(line: String): List {\n var newLine = importRegex.replace(line, \"\")\n newLine = commentRegex.replace(newLine, \"\")\n return super.tokenize(newLine)\n }\n\n override fun getLanguageName(): String? {\n return LANGUAGE_NAME\n }\n}\n" }, { "path": "src/main/kotlin/app/extractors/ScalaExtractor.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Alexander Surkov (alex@sourcerer.io)\n\npackage app.extractors\n\nobject ScalaExtractor : ExtractorBase(\n language = Lang.SCALA,\n importRegex = Regex(\"\"\"^import (?:_root_\\.)?((?:\\.?[a-z]+)+\\.)\"\"\"),\n commentRegex = Regex(\"(//.+$)|(/[*].*?[*]/)\"),\n importStartsWith = true)\n" }, { "path": "src/main/kotlin/app/extractors/SwiftExtractor.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.extractors\n\nobject SwiftExtractor : ExtractorBase(\n language = Lang.SWIFT,\n importRegex = Regex(\"\"\"import\\s+(\\w+)\"\"\"),\n commentRegex = Regex(\"\"\"^([^\\n]*//)[^\\n]*\"\"\"))\n" }, { "path": "src/main/kotlin/app/extractors/TypescriptExtractor.kt", "content": "// Copyright 2019 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n\npackage app.extractors\n\nimport app.model.CommitStats\nimport app.model.DiffFile\n\nclass TypescriptExtractor : ExtractorInterface{\n companion object {\n const val LANGUAGE_NAME = Lang.TYPESCRIPT\n private val javascriptExtractor = JavascriptExtractor()\n }\n\n override fun extract(files: List): List {\n files.forEach { file ->\n file.lang = Lang.JAVASCRIPT\n }\n val libStats = javascriptExtractor.extractLibStats(files)\n\n files.forEach { file ->\n file.lang = LANGUAGE_NAME\n }\n return super.extractLangStats(files) + libStats\n }\n\n override fun extractImports(fileContent: List): List {\n return javascriptExtractor.extractImports(fileContent)\n }\n\n override fun tokenize(line: String): List {\n return javascriptExtractor.tokenize(line)\n }\n\n override fun mapImportToIndex(import: String, lang: String,\n startsWith: Boolean): String? {\n return super.mapImportToIndex(import, Lang.JAVASCRIPT, startsWith = true)\n }\n\n override fun getLanguageName(): String? {\n return LANGUAGE_NAME\n }\n}\n" }, { "path": "src/main/kotlin/app/hashers/AuthorDistanceHasher.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n\npackage app.hashers\n\nimport app.api.Api\nimport app.model.AuthorDistance\nimport app.model.Repo\nimport io.reactivex.Observable\nimport java.util.concurrent.TimeUnit\n\nclass AuthorDistanceHasher(\n private val serverRepo: Repo,\n private val api: Api,\n private val emails: HashSet,\n private val userEmails: HashSet) {\n fun updateFromObservable(observable: Observable,\n onError: (Throwable) -> Unit) {\n val authorScores = hashMapOf()\n emails.forEach { authorScores[it] = 0.0 }\n\n // Store the time of the earliest commit for a path by user.\n val authorPathLastContribution = hashMapOf()\n\n observable.subscribe({\n val email = it.email!!\n val paths = it.paths!!\n val time = it.date!!\n if (email in userEmails) {\n paths.forEach { path ->\n authorPathLastContribution[path] = time\n }\n }\n else {\n val score = paths\n .filter { path -> path in authorPathLastContribution }\n .filter { path ->\n val authorTime = authorPathLastContribution[path]!!\n val timeDelta = TimeUnit.DAYS.convert(\n authorTime - time, TimeUnit.SECONDS)\n timeDelta < 365\n }.size\n authorScores[email] = authorScores[email]!! + score\n }\n }, onError, {\n val stats = mutableListOf()\n authorScores.forEach { email, value ->\n if (email !in userEmails) {\n stats.add(AuthorDistance(serverRepo, email, value))\n }\n }\n postDistancesToServer(stats)\n })\n }\n\n private fun postDistancesToServer(stats: List) {\n if (stats.isNotEmpty()) {\n api.postAuthorDistances(stats).onErrorThrow()\n }\n }\n}\n" }, { "path": "src/main/kotlin/app/hashers/CodeLongevity.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Alexander Surkov (alex@sourcerer.io)\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.hashers\n\nimport app.FactCodes\nimport app.Logger\nimport app.api.Api\nimport app.model.Author\nimport app.model.Repo\nimport app.model.Fact\nimport app.utils.FileHelper\nimport io.reactivex.Observable\nimport org.eclipse.jgit.diff.DiffEntry\nimport org.eclipse.jgit.diff.RawText\nimport org.eclipse.jgit.api.Git\nimport org.eclipse.jgit.lib.AnyObjectId\nimport org.eclipse.jgit.lib.Repository\nimport org.eclipse.jgit.revwalk.RevCommit\nimport org.eclipse.jgit.revwalk.RevWalk\nimport org.eclipse.jgit.treewalk.TreeWalk\n\nimport java.io.FileInputStream\nimport java.io.FileNotFoundException\nimport java.io.FileOutputStream\nimport java.io.ObjectOutputStream\nimport java.io.ObjectInputStream\nimport java.io.Serializable\nimport java.lang.Exception\nimport java.text.SimpleDateFormat\nimport java.util.Date\n\n/**\n * Represents a code line in a file revision.\n */\nclass RevCommitLine(val commit: RevCommit, val fileId: AnyObjectId,\n val file: String, val line: Int,\n val isDeleted: Boolean) {\n\n val id : String\n get() = \"${fileId.name}:$line\"\n}\n\n/**\n * Represents a code line in repo's history.\n *\n * TODO(Alex): the text arg is solely for testing proposes (remove it)\n */\nclass CodeLine(val repo: Repository,\n val from: RevCommitLine, val to: RevCommitLine) {\n\n // TODO(alex): oldId and newId may be computed as a hash built from commit,\n // file name and line number, if we are going to send the data outside a\n // local machine.\n\n /**\n * Id of the code line in a revision when the line was added. Used to\n * identify a line and update its lifetime computed at the previous\n * iteration.\n */\n val oldId : String\n get() = from.id\n\n /**\n * Id of the code line in a revision, where the line was deleted, or a head\n * revision, if the line is alive.\n */\n val newId : String\n get() = to.id\n\n /**\n * The code line's age in seconds.\n */\n var age : Long = 0\n get() {\n if (field == 0L) {\n field = (to.commit.commitTime - from.commit.commitTime).toLong()\n }\n return field\n }\n\n /**\n * The code line text.\n */\n val text : String\n get() = RawText(repo.open(from.fileId).bytes).getString(from.line)\n\n /**\n * Email address of the line's author.\n */\n val authorEmail : String\n get() = from.commit.authorIdent.emailAddress\n\n /**\n * Email address of the line's changer.\n */\n val editorEmail : String?\n get() = if (isDeleted) to.commit.authorIdent.emailAddress else null\n\n /**\n * A date when the line was changed.\n */\n val editDate : Date\n get() = Date(to.commit.commitTime.toLong() * 1000)\n\n /**\n * True if the line is deleted.\n */\n val isDeleted : Boolean\n get() = to.isDeleted\n\n /**\n * A pretty print of a code line; debugging.\n */\n override fun toString() : String {\n val df = SimpleDateFormat(\"yyyy-MM-dd HH:mm z\")\n val fd = df.format(Date(from.commit.commitTime.toLong() * 1000))\n val td = df.format(Date(to.commit.commitTime.toLong() * 1000))\n val fc = \"${from.commit.name} '${from.commit.shortMessage}'\"\n val tc = \"${to.commit.name} '${to.commit.shortMessage}'\"\n val revState = if (isDeleted) \"deleted in\" else \"last known as\"\n val state = if (isDeleted) \"deleted\" else \"alive\"\n return \"Line '$text' - '${from.file}:${from.line}' added in $fc $fd\\n\" +\n \" $revState '${to.file}:${to.line}' in $tc $td,\\n\" +\n \" age: $age s - $state\"\n }\n}\n\n/**\n * Detects colleagues and their 'work vicinity' from commits.\n */\nclass Colleagues(private val serverRepo: Repo) {\n // A map of pairs to pairs of\n // , which indicates to a minimum time in ms between all line\n // changes for these two colleagues in a given month (yyyy-mm).\n private val map: HashMap,\n HashMap> = hashMapOf()\n\n fun collect(line: CodeLine) {\n // TODO(alex): ignore same user emails\n val authorEmail = line.authorEmail\n val editorEmail = line.editorEmail\n if (editorEmail == null || authorEmail == editorEmail) {\n return\n }\n val emails = Pair(authorEmail, editorEmail)\n\n val dates = map.getOrPut(emails, { hashMapOf() })\n val month = SimpleDateFormat(\"yyyy-MM\").format(line.editDate)\n\n Logger.trace { \"collected colleague, age: ${line.age}\" }\n val vicinity = dates.getOrPut(month, { line.age })\n if (vicinity > line.age) {\n dates[month] = line.age\n }\n }\n\n fun calculateAndSendFacts(api: Api) {\n // Expose colleagues iff colleague1 edited colleague2 code and\n // colleague2 edited colleauge1 code.\n val auxHash = hashSetOf>()\n for ((pair, dates) in map) {\n val email1 = pair.first\n val email2 = pair.second\n if (auxHash.contains(Pair(email2, email1))) {\n continue\n }\n\n val min1 = dates.minBy { (_, vicinity) -> vicinity }!!\n val dates2 = map[Pair(email2, email1)]\n if (dates2 != null) {\n auxHash.add(Pair(email1, email2))\n\n val min2 = dates2.minBy { (_, vicinity) -> vicinity }!!\n val min: Long =\n if (min1.value < min2.value) { min1.value }\n else { min2.value }\n\n val stats = mutableListOf()\n stats.add(Fact(serverRepo,\n FactCodes.COLLEAGUES,\n value = email1,\n value2 = email2,\n value3 = min.toString()))\n\n api.postFacts(stats).onErrorThrow()\n }\n }\n }\n\n /**\n * Return colleagues in a form of for the given\n * email, where time indicates a minimal time in ms between all line edits\n * by these colleagues in a given month (yyyy-mm).\n */\n fun get(email: String) : List> {\n return map\n .filter { (pair, _) -> pair.first == email || pair.second == email }\n .flatMap { (pair, dates) ->\n val colleagueEmail =\n if (email == pair.first) pair.second else pair.first\n\n val list = mutableListOf>()\n dates.forEach { month, vicinity ->\n list.add(Triple(colleagueEmail, month, vicinity))\n }\n return list\n }\n }\n}\n\n/**\n * A data class used to store line age information.\n */\nclass CodeLineAges : Serializable, Cloneable {\n /**\n * A pair of (line age sum, line count) representing an aggregated line\n * ages.\n */\n data class AggrAge(var sum: Long = 0L, var count: Int = 0) : Serializable\n\n /**\n * A code line info: an (age, email) pair.\n */\n data class LineInfo(var age: Long, var email: String) : Serializable\n\n /**\n * Aggregated code line ages for user emails, collected from all deleted\n * lines.\n */\n var aggrAges: HashMap = hashMapOf()\n\n /**\n * A map of existing code lines ids to their ages at the revision.\n */\n var lastingLines: HashMap = hashMapOf()\n\n public override fun clone(): CodeLineAges {\n val clone = CodeLineAges()\n aggrAges.forEach { (email, age) ->\n clone.aggrAges[email] = age.copy() }\n lastingLines.forEach { (email, line) ->\n clone.lastingLines[email] = line.copy() }\n return clone\n }\n}\n\n/**\n * Used to compute age of code lines in the repo.\n */\nclass CodeLongevity(\n private val serverRepo: Repo,\n private val emails: HashSet,\n private val git: Git) {\n\n val repo: Repository = git.repository\n val revWalk = RevWalk(repo)\n val head: RevCommit =\n try { revWalk.parseCommit(CommitCrawler.getDefaultBranchHead(git)) }\n catch(e: Exception) { throw Exception(\"No branch\") }\n\n val dataPath = FileHelper.getPath(serverRepo.rehash, \"longevity\")\n val colleagues = Colleagues(serverRepo)\n\n /**\n * Updates code line age statistics on the server.\n */\n private fun calculateAndSendFacts(ages: CodeLineAges, api: Api) {\n var repoTotal = 0\n var repoSum: Long = 0\n val aggrAges : HashMap = hashMapOf()\n\n ages.aggrAges.forEach { (email, aggrAge) ->\n repoSum += aggrAge.sum\n repoTotal += aggrAge.count\n if (emails.contains(email)) {\n aggrAges[email] = aggrAge\n }\n }\n\n ages.lastingLines.forEach { (_, info) ->\n val aggrAge =\n aggrAges.getOrPut(info.email, { CodeLineAges.AggrAge() })\n aggrAge.sum += info.age\n aggrAge.count += 1\n\n repoSum += info.age\n repoTotal += 1\n }\n\n val secondsInDay = 86400\n val repoAvg = if (repoTotal > 0) { repoSum / repoTotal } else 0\n val stats = mutableListOf()\n stats.add(Fact(repo = serverRepo,\n code = FactCodes.LINE_LONGEVITY_REPO,\n value = repoAvg.toString()))\n val repoAvgDays = repoAvg / secondsInDay\n Logger.info { \"Repo average code line age is $repoAvgDays days, \" +\n \"lines total: $repoTotal\" }\n\n for (email in emails) {\n val aggrAge = aggrAges[email] ?: CodeLineAges.AggrAge()\n val avg = if (aggrAge.count > 0) { aggrAge.sum / aggrAge.count }\n else 0\n stats.add(Fact(repo = serverRepo,\n code = FactCodes.LINE_LONGEVITY,\n value = avg.toString(),\n author = Author(email = email)))\n }\n\n if (stats.size > 0) {\n api.postFacts(stats).onErrorThrow()\n Logger.info { \"Sent ${stats.size} facts to server\" }\n }\n\n colleagues.calculateAndSendFacts(api)\n }\n\n /**\n * Scans the repo to extract code line ages.\n */\n fun updateFromObservable(diffObservable: Observable =\n CommitCrawler.getJGitObservable(git),\n onError: (Throwable) -> Unit = {},\n api: Api,\n onDataComplete: (CodeLineAges) -> Unit = {}) {\n var storedHead: RevCommit? = null\n var ageData = CodeLineAges()\n\n // Load existing age data if any. Expected format: commit id and\n // CodeLineAges structure following it.\n try {\n val file = dataPath.toFile()\n val iStream = ObjectInputStream(FileInputStream(file))\n val storedHeadId = iStream.readUTF()\n Logger.debug { \"Stored repo head: $storedHeadId\" }\n storedHead = revWalk.parseCommit(repo.resolve(storedHeadId))\n if (storedHead == head) {\n return // TODO(anatoly): Send saved stats in such case.\n }\n ageData = (iStream.readObject() ?: CodeLineAges()) as CodeLineAges\n }\n catch(e: FileNotFoundException) { }\n catch(e: Exception) { Logger.error(e, \"Failed to read longevity \" +\n \"data. CAUTION: data will be recomputed.\") }\n\n // Update ages.\n getLinesObservable(storedHead, diffObservable, onError).subscribe({\n line ->\n Logger.trace { \"Scanning: $line\" }\n if (line.isDeleted) {\n if (ageData.lastingLines.contains(line.oldId)) {\n line.age += ageData.lastingLines.remove(line.oldId)!!.age\n }\n val aggrAge = ageData.aggrAges.getOrPut(line.authorEmail,\n { CodeLineAges.AggrAge() } )\n aggrAge.sum += line.age\n aggrAge.count += 1\n\n colleagues.collect(line)\n } else {\n var age = line.age\n if (ageData.lastingLines.contains(line.oldId)) {\n age += ageData.lastingLines.remove(line.oldId)!!.age\n }\n ageData.lastingLines[line.newId] = CodeLineAges.LineInfo(age,\n line.authorEmail)\n }\n }, onError, {\n // Store ages for subsequent runs.\n try {\n val file = dataPath.toFile()\n val oStream = ObjectOutputStream(FileOutputStream(file))\n oStream.writeUTF(head.name)\n oStream.writeObject(ageData)\n }\n catch(e: Exception) {\n Logger.error(e, \"Failed to save longevity data. \" +\n \"CAUTION: data will be recomputed on a next run.\")\n }\n onDataComplete(ageData)\n calculateAndSendFacts(ageData, api)\n })\n }\n\n /**\n * Clears the stored age data if any.\n */\n fun dropSavedData() {\n dataPath.toFile().delete()\n }\n\n /**\n * Returns a list of code lines, both alive and deleted, between\n * the revisions of the repo.\n */\n fun getLinesList(tail : RevCommit? = null,\n diffObservable: Observable =\n CommitCrawler.getJGitObservable(git),\n onError: (Throwable) -> Unit = {}) : List {\n val codeLines: MutableList = mutableListOf()\n getLinesObservable(tail, diffObservable, onError).blockingSubscribe {\n line -> codeLines.add(line)\n }\n return codeLines\n }\n\n /**\n * Returns an observable for for code lines, both alive and deleted, between\n * the revisions of the repo.\n */\n fun getLinesObservable(tail : RevCommit? = null,\n diffObservable: Observable,\n onError: (Throwable) -> Unit)\n : Observable =\n Observable.create { subscriber ->\n\n val headWalk = TreeWalk(repo)\n headWalk.isRecursive = true\n headWalk.addTree(head.tree)\n\n val files: MutableMap> = mutableMapOf()\n\n // Build a map of file names and their code lines.\n while (headWalk.next()) {\n try {\n val path = headWalk.pathString\n val fileId = headWalk.getObjectId(0)\n val fileLoader = repo.open(fileId)\n if (!RawText.isBinary(fileLoader.openStream())) {\n val fileText = RawText(fileLoader.bytes)\n val lines = ArrayList(fileText.size())\n for (idx in 0 until fileText.size()) {\n lines.add(RevCommitLine(head, fileId, path, idx, false))\n }\n files[path] = lines\n }\n } catch (e: Exception) {\n // TODO(anatoly): better fix of exceptions.\n }\n }\n\n diffObservable\n .takeWhile { (commit, _) -> commit != tail }\n .subscribe( { (commit, diffs) ->\n // A step back in commits history. Update the files map according\n // to the diff. Traverse the diffs backwards to handle double\n // renames properly.\n // TODO(alex): cover file renames by tests (see APP-132 issue).\n for ((diff, editList) in diffs!!.asReversed()) {\n val oldPath = diff.oldPath\n val oldId = diff.oldId.toObjectId()\n val newPath = diff.newPath\n val newId = diff.newId.toObjectId()\n Logger.trace { \"old: '$oldPath', new: '$newPath'\" }\n\n // File was deleted, initialize the line array in the files map.\n if (diff.changeType == DiffEntry.ChangeType.DELETE) {\n val fileLoader = repo.open(oldId)\n val fileText = RawText(fileLoader.bytes)\n files[oldPath] = ArrayList(fileText.size())\n }\n\n // If a file was deleted, then the new path is /dev/null.\n val path = if (newPath != DiffEntry.DEV_NULL) {\n newPath\n } else {\n oldPath\n }\n val lines = files[path]!!\n\n\n // Update the lines array according to diff insertions.\n // Traverse the edit list backwards to keep indices of\n // the edit list and the lines array in sync.\n for (edit in editList.asReversed()) {\n // Insertion case: track the lines.\n val insCount = edit.lengthB\n if (insCount > 0) {\n val insStart = edit.beginB\n val insEnd = edit.endB\n Logger.trace { \"ins ($insStart, $insEnd)\" }\n\n for (idx in insStart until insEnd) {\n val from = RevCommitLine(commit!!, newId,\n newPath, idx, false)\n try {\n val to = lines[idx]\n val cl = CodeLine(repo, from, to)\n Logger.trace { \"Collected: $cl\" }\n subscriber.onNext(cl)\n }\n catch(e: IndexOutOfBoundsException) {\n Logger.error(e, \"No line at $idx; commit: \" +\n \"${commit.name}; \" +\n \"'${commit.shortMessage}'\")\n throw e\n }\n }\n lines.subList(insStart, insEnd).clear()\n }\n }\n\n // Update the lines array according to diff deletions.\n for (edit in editList) {\n // Deletion case. Chase down the deleted lines through the\n // history.\n val delCount = edit.lengthA\n if (delCount > 0) {\n val delStart = edit.beginA\n val delEnd = edit.endA\n Logger.trace { \"del ($delStart, $delEnd)\" }\n\n val tmpLines = ArrayList(delCount)\n for (idx in delStart until delEnd) {\n tmpLines.add(RevCommitLine(commit!!, oldId,\n oldPath, idx, true))\n }\n lines.addAll(delStart, tmpLines)\n }\n }\n\n // File was renamed, tweak the files map.\n if (diff.changeType == DiffEntry.ChangeType.RENAME) {\n files[oldPath] = files.remove(newPath)!!\n }\n }\n }, onError, {\n // If a tail revision was given then the map has to contain\n // unclaimed code lines, i.e. the lines added before the tail\n // revision. Push them all into the result lines list, so the\n // caller can update their ages properly.\n if (tail != null) {\n val tailWalk = TreeWalk(repo)\n tailWalk.isRecursive = true\n tailWalk.addTree(tail.tree)\n\n while (tailWalk.next()) {\n val filePath = tailWalk.pathString\n val lines = files[filePath]\n if (lines != null) {\n val fileId = tailWalk.getObjectId(0)\n for (idx in 0 until lines.size) {\n val from = RevCommitLine(tail, fileId,\n filePath, idx, false)\n val cl = CodeLine(repo, from, lines[idx])\n Logger.trace { \"Collected (tail): $cl\" }\n subscriber.onNext(cl)\n }\n }\n }\n }\n subscriber.onComplete()\n })\n }\n}\n" }, { "path": "src/main/kotlin/app/hashers/CommitCrawler.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n\npackage app.hashers\n\nimport app.Logger\nimport app.model.Author\nimport app.model.Commit\nimport app.model.DiffContent\nimport app.model.DiffFile\nimport app.model.DiffRange\nimport app.model.Repo\nimport app.utils.EmptyRepoException\nimport io.reactivex.Observable\nimport java.io.BufferedReader\nimport java.io.InputStreamReader\nimport org.apache.commons.codec.digest.DigestUtils\nimport org.eclipse.jgit.api.Git\nimport org.eclipse.jgit.diff.DiffEntry\nimport org.eclipse.jgit.diff.DiffFormatter\nimport org.eclipse.jgit.diff.EditList\nimport org.eclipse.jgit.diff.RawText\nimport org.eclipse.jgit.lib.ObjectId\nimport org.eclipse.jgit.lib.Repository\nimport org.eclipse.jgit.revwalk.RevCommit\nimport org.eclipse.jgit.revwalk.RevWalk\nimport org.eclipse.jgit.treewalk.filter.PathFilter\nimport org.eclipse.jgit.treewalk.TreeWalk\nimport org.eclipse.jgit.util.io.DisabledOutputStream\nimport java.util.LinkedList\n\ndata class JgitData(var commit: RevCommit? = null,\n var list: List? = null,\n var paths: List? = null,\n var date: Long? = null,\n var email: String? = null,\n var coauthors: List? = null)\n\ndata class JgitDiff(val diffEntry: DiffEntry, val editList: EditList)\n\n/**\n* Iterates over the diffs between commits in the repo's history.\n*/\nobject CommitCrawler {\n private const val REMOTE_HEAD = \"refs/remotes/origin/HEAD\"\n private const val REMOTE_MASTER_BRANCH = \"refs/remotes/origin/master\"\n private const val LOCAL_MASTER_BRANCH = \"refs/heads/master\"\n private const val LOCAL_HEAD = \"HEAD\"\n private val REFS = listOf(REMOTE_HEAD, REMOTE_MASTER_BRANCH,\n LOCAL_MASTER_BRANCH, LOCAL_HEAD)\n private val CONF_FILE_PATH = \".sourcerer-conf\"\n private val MAX_DIFF_SIZE = 600000\n private val coauthoredRegex = Regex(\"\"\"Co-authored-by: (.+) <(.+)>\"\"\")\n\n fun getDefaultBranchHead(git: Git): ObjectId {\n for (ref in REFS) {\n val branch = git.repository.resolve(ref) ?: continue\n\n Logger.debug { \"Hashing from $ref\" }\n return branch\n }\n throw EmptyRepoException(\"No remote default, master or HEAD found\")\n }\n\n fun fetchRehashesAndAuthors(git: Git):\n Triple, HashSet, HashMap> {\n val head: RevCommit = RevWalk(git.repository)\n .parseCommit(getDefaultBranchHead(git))\n\n val revWalk = RevWalk(git.repository)\n revWalk.markStart(head)\n\n val commitsRehashes = LinkedList()\n val emails = hashSetOf()\n val names = hashMapOf()\n val commitsCount = hashMapOf()\n val coauthorsList = mutableListOf()\n\n var commit: RevCommit? = revWalk.next()\n while (commit != null) {\n commitsRehashes.add(DigestUtils.sha256Hex(commit.name))\n val email = commit.authorIdent.emailAddress.toLowerCase()\n val name = commit.authorIdent.name\n if (!emails.contains(email)) {\n emails.add(email)\n names[email] = name\n } else {\n if (name.length > names[email]!!.length) {\n names[email] = name\n }\n }\n val coauthors = getCoauthors(commit.fullMessage)\n coauthorsList.addAll(coauthors)\n\n commitsCount[email] = commitsCount.getOrDefault(email, 0) + 1\n\n commit.disposeBody()\n commit = revWalk.next()\n }\n revWalk.dispose()\n\n val authors = emails.map { email -> Author(names[email]!!, email) }\n .toHashSet()\n authors.addAll(coauthorsList)\n\n return Triple(commitsRehashes, authors, commitsCount)\n }\n\n fun getJGitObservable(git: Git,\n totalCommitCount: Int = 0,\n extractCommit: Boolean = true,\n extractDiffs: Boolean = true,\n extractPaths: Boolean = false,\n extractDate: Boolean = false,\n extractEmail: Boolean = false,\n extractCoauthors: Boolean = false,\n filteredEmails: HashSet? = null,\n tail : RevCommit? = null) :\n Observable = Observable.create { subscriber ->\n val repo: Repository = git.repository\n val revWalk = RevWalk(repo)\n val head: RevCommit =\n try { revWalk.parseCommit(getDefaultBranchHead(git)) }\n catch(e: Exception) { throw Exception(\"No head was found!\") }\n\n val df = DiffFormatter(DisabledOutputStream.INSTANCE)\n df.setRepository(repo)\n df.isDetectRenames = true\n\n val confTreeWalk = TreeWalk(repo)\n confTreeWalk.addTree(head.getTree())\n confTreeWalk.setFilter(PathFilter.create(CONF_FILE_PATH))\n\n var ignoredPaths =\n if (confTreeWalk.next()) {\n getIgnoredPaths(repo, confTreeWalk.getObjectId(0))\n }\n else {\n listOf()\n }\n\n var commitCount = 0\n revWalk.markStart(head)\n var commit: RevCommit? = revWalk.next() // Move the walker to the head.\n while (commit != null && commit != tail) {\n commitCount++\n val parentCommit: RevCommit? = revWalk.next()\n\n // Smart casts are not yet supported for a mutable variable captured\n // in an inline lambda, see\n // https://youtrack.jetbrains.com/issue/KT-7186.\n if (Logger.isTrace) {\n val commitName = commit.name\n val commitMsg = commit.shortMessage\n Logger.trace { \"commit: $commitName; '$commitMsg'\" }\n if (parentCommit != null) {\n val parentCommitName = parentCommit.name\n val parentCommitMsg = parentCommit.shortMessage\n Logger.trace { \"parent commit: $parentCommitName; \" +\n \"'$parentCommitMsg'\" }\n }\n else {\n Logger.trace { \"parent commit: null\" }\n }\n }\n\n val perc = if (totalCommitCount != 0) {\n (commitCount.toDouble() / totalCommitCount) * 100\n } else 0.0\n Logger.printCommit(commit.shortMessage, commit.name, perc)\n\n val email = commit.authorIdent.emailAddress.toLowerCase()\n if (filteredEmails != null && !filteredEmails.contains(email)) {\n commit = parentCommit\n continue\n }\n val paths = mutableListOf()\n\n val diffEntries = df.scan(parentCommit, commit)\n .filter { diff ->\n diff.changeType != DiffEntry.ChangeType.COPY\n }\n .filter { diff ->\n val path = diff.newPath\n for (cnv in VendorConventions) {\n if (cnv.containsMatchIn(path) ||\n cnv.containsMatchIn(diff.oldPath)) {\n return@filter false\n }\n }\n\n val fileId =\n if (path != DiffEntry.DEV_NULL) {\n diff.newId.toObjectId()\n } else {\n diff.oldId.toObjectId()\n }\n val stream = try {\n repo.open(fileId).openStream()\n } catch (e: Exception) {\n null\n }\n stream != null && !RawText.isBinary(stream)\n }\n .filter { diff ->\n val filePath =\n if (diff.getNewPath() != DiffEntry.DEV_NULL) {\n diff.getNewPath()\n } else {\n diff.getOldPath()\n }\n\n // Update ignored paths list. The config file has retroactive\n // force, i.e. if it was added at this commit, then we presume\n // it is applied to all commits, preceding this commit.\n if (diff.getOldPath() == CONF_FILE_PATH) {\n ignoredPaths =\n getIgnoredPaths(repo, diff.getNewId().toObjectId())\n }\n\n if (!ignoredPaths.any { path ->\n if (path.endsWith(\"/\")) {\n filePath.startsWith(path)\n }\n else {\n path == filePath\n }\n }) {\n paths.add(filePath)\n true\n } else false\n }\n\n val jgitData = JgitData()\n if (extractCommit) {\n jgitData.commit = commit\n }\n if (extractDiffs) {\n val diffEdits = diffEntries\n .map { diff ->\n JgitDiff(diff, df.toFileHeader(diff).toEditList())\n }\n .filter { diff ->\n diff.editList.fold(0) { acc, edit ->\n acc + edit.lengthA + edit.lengthB\n } < MAX_DIFF_SIZE\n }\n jgitData.list = diffEdits\n }\n if (extractPaths) {\n jgitData.paths = paths\n }\n if (extractDate) {\n jgitData.date = commit.authorIdent.getWhen().time / 1000\n }\n if (extractEmail) {\n jgitData.email = email\n }\n if (extractCoauthors) {\n jgitData.coauthors = getCoauthors(commit.fullMessage)\n }\n\n subscriber.onNext(jgitData)\n commit = parentCommit\n }\n\n subscriber.onComplete()\n }\n\n fun getObservable(git: Git,\n repo: Repo): Observable {\n return getObservable(git, getJGitObservable(git), repo)\n }\n\n fun getObservable(git: Git,\n jgitObservable: Observable,\n repo: Repo): Observable {\n return jgitObservable.map( { jgitData ->\n // Mapping and stats extraction.\n val commit = Commit(jgitData.commit!!, jgitData.coauthors)\n commit.diffs = getDiffFiles(git.repository, jgitData.list!!)\n\n // Count lines on all non-binary files. This is additional\n // statistics to CommitStats because not all file extensions\n // may be supported.\n commit.numLinesAdded = commit.diffs.fold(0) { total, file ->\n total + file.getAllAdded().size\n }\n commit.numLinesDeleted = commit.diffs.fold(0) { total, file ->\n total + file.getAllDeleted().size\n }\n commit.repo = repo\n\n commit\n })\n }\n\n private fun getDiffFiles(jgitRepo: Repository,\n jgitDiffs: List) : List {\n return jgitDiffs\n .map { (diff, edits) ->\n // TODO(anatoly): Can produce exception for large object.\n // Investigate for size.\n val new = try {\n getContentByObjectId(jgitRepo, diff.newId.toObjectId())\n } catch (e: Exception) {\n Logger.error(e)\n null\n }\n val old = try {\n getContentByObjectId(jgitRepo, diff.oldId.toObjectId())\n } catch (e: Exception) {\n Logger.error(e)\n null\n }\n\n val diffFiles = mutableListOf()\n if (new != null && old != null) {\n val path = when (diff.changeType) {\n DiffEntry.ChangeType.DELETE -> diff.oldPath\n else -> diff.newPath\n }\n diffFiles.add(DiffFile(path = path,\n changeType = diff.changeType,\n old = DiffContent(old, edits.map { edit ->\n DiffRange(edit.beginA, edit.endA)\n }),\n new = DiffContent(new, edits.map { edit ->\n DiffRange(edit.beginB, edit.endB)\n })\n ))\n }\n diffFiles\n }\n .flatten()\n }\n\n private fun getContentByObjectId(repo: Repository,\n objectId: ObjectId): List {\n return try {\n val obj = repo.open(objectId)\n val rawText = RawText(obj.bytes)\n val content = ArrayList(rawText.size())\n for (i in 0..(rawText.size() - 1)) {\n content.add(rawText.getString(i))\n }\n return content\n } catch (e: Exception) {\n listOf()\n }\n }\n\n /**\n * Return a list of paths that should be ignored in commit analysis.\n */\n private fun getIgnoredPaths(repo: Repository, objectId: ObjectId?): List {\n return try {\n if (objectId == null) {\n return listOf()\n }\n\n val list = mutableListOf()\n val fileLoader = repo.open(objectId)\n val reader =\n BufferedReader(InputStreamReader(fileLoader.openStream()))\n var collectIgnored = false\n for (line in reader.lines()) {\n if (line == \"\" || line.startsWith(\"#\")) {\n continue\n }\n\n if (line.startsWith(\"[\")) {\n collectIgnored = (line == \"[ignore]\")\n continue\n }\n\n if (collectIgnored) {\n list.add(line)\n }\n }\n list\n }\n catch(e: Exception) {\n listOf()\n }\n }\n\n private fun getCoauthors(message: String): List {\n val coauthorsResult = coauthoredRegex.findAll(message)\n val coauthors = mutableListOf()\n if (coauthorsResult.toList().isNotEmpty()) {\n coauthorsResult.toList().map { result ->\n val coauthorName = result.groupValues[1]\n val coauthorEmail = result.groupValues[2].toLowerCase()\n coauthors.add(Author(coauthorName, coauthorEmail))\n }\n }\n return coauthors\n }\n}\n" }, { "path": "src/main/kotlin/app/hashers/CommitHasher.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.hashers\n\nimport app.Logger\nimport app.api.Api\nimport app.extractors.Extractor\nimport app.model.Commit\nimport app.model.Repo\nimport io.reactivex.Observable\nimport java.util.concurrent.TimeUnit\n\n/**\n * CommitHasher hashes repository and uploads stats to server.\n */\nclass CommitHasher(private val serverRepo: Repo = Repo(),\n private val api: Api,\n private val rehashes: List,\n private val emails: HashSet) {\n\n init {\n // Delete locally missing commits from server. If found at least one\n // common commit then preceding commits are not deleted because hash of\n // a commit calculated including hashes of its parents.\n val firstOverlapCommitRehash = findFirstOverlappingCommitRehash()\n val deletedCommits = serverRepo.commits\n .takeWhile { it.rehash != firstOverlapCommitRehash }\n deleteCommitsOnServer(deletedCommits)\n }\n\n // Hash added and missing server commits and send them to server.\n fun updateFromObservable(observable: Observable,\n onError: (Throwable) -> Unit) {\n val knownCommits = serverRepo.commits.toHashSet()\n\n observable\n // Don't hash known to server commits.\n .filter { commit -> !knownCommits.contains(commit) }\n // Hash only commits made by authors with specified emails.\n .filter { commit -> emails.contains(commit.author.email) }\n .map { commit ->\n Logger.printCommitDetail(\"Extracting stats\")\n\n // Mapping and stats extraction.\n commit.stats = Extractor().extract(commit.diffs)\n val statsNumStr = if (commit.stats.isNotEmpty()) {\n commit.stats.size.toString()\n } else \"No\"\n\n Logger.printCommitDetail(\"$statsNumStr technology stats found\")\n Logger.debug { commit.stats.toString() }\n\n commit\n }\n // Group ready commits by time and count. Max payload 10 mb,\n // one commit with stats takes around 1 kb, so pack by max 1000\n // with 10x margin of safety.\n .buffer(20, TimeUnit.SECONDS, 1000)\n .subscribe({ commitsBundle -> // OnNext.\n val coauthorsCommits = commitsBundle\n .filter { it.coauthors.isNotEmpty() }\n .fold(mutableListOf()) { acc, commit ->\n acc.addAll(commit.coauthors.map { coauthor ->\n val newCommit = commit.copy()\n newCommit.author = coauthor\n newCommit\n })\n acc\n }\n commitsBundle.addAll(coauthorsCommits)\n postCommitsToServer(commitsBundle) // Send ready commits.\n }, onError)\n }\n\n private fun findFirstOverlappingCommitRehash(): String? {\n val serverHistoryRehashes = serverRepo.commits\n .map { commit -> commit.rehash }\n .toHashSet()\n return rehashes.firstOrNull { rehash ->\n serverHistoryRehashes.contains(rehash)\n }\n }\n\n private fun postCommitsToServer(commits: List) {\n if (commits.isNotEmpty()) {\n api.postCommits(commits).onErrorThrow()\n Logger.info { \"Sent ${commits.size} added commits to server\" }\n }\n }\n\n private fun deleteCommitsOnServer(commits: List) {\n if (commits.isNotEmpty()) {\n api.deleteCommits(commits).onErrorThrow()\n Logger.info { \"Sent ${commits.size} deleted commits to server\" }\n }\n }\n}\n" }, { "path": "src/main/kotlin/app/hashers/FactHasher.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n\npackage app.hashers\n\nimport app.FactCodes\nimport app.Logger\nimport app.api.Api\nimport app.extractors.Extractor\nimport app.model.Author\nimport app.model.Commit\nimport app.model.Fact\nimport app.model.Repo\nimport io.reactivex.Observable\nimport java.time.LocalDateTime\nimport java.time.ZoneOffset\n\n/**\n * CommitHasher hashes repository and uploads stats to server.\n */\nclass FactHasher(private val serverRepo: Repo = Repo(),\n private val api: Api,\n private val rehashes: List,\n private val emails: HashSet) {\n private val fsDayWeek = hashMapOf>()\n private val fsDayTime = hashMapOf>()\n private val fsRepoDateStart = hashMapOf()\n private val fsRepoDateEnd = hashMapOf()\n private val fsCommitLineNumAvg = hashMapOf()\n private val fsCommitNum = hashMapOf()\n private val fsLineLenAvg = hashMapOf()\n private val fsLineNum = hashMapOf()\n private val fsLinesPerCommits = hashMapOf>()\n private val fsVariableNaming = hashMapOf>()\n private val fsIndentation = hashMapOf>()\n\n private val varNamingRegex = Regex(\"[a-z][A-Z]\")\n\n init {\n for (author in emails) {\n fsDayWeek[author] = Array(7) { 0 }\n fsDayTime[author] = Array(24) { 0 }\n fsRepoDateStart[author] = -1\n fsRepoDateEnd[author] = -1\n fsCommitLineNumAvg[author] = 0.0\n fsCommitNum[author] = 0\n fsLineLenAvg[author] = 0.0\n fsLineNum.put(author, 0)\n // TODO(anatoly): Do the bin computations on the go.\n fsLinesPerCommits[author] = Array(rehashes.size) {0}\n fsVariableNaming.put(author, Array(3) { 0 })\n fsIndentation.put(author, Array(2) { 0 })\n }\n }\n\n fun updateFromObservable(observable: Observable,\n onError: (Throwable) -> Unit) {\n observable\n .filter { commit -> emails.contains(commit.author.email) }\n .subscribe(onNext, onError, { // OnComplete.\n try {\n postFactsToServer(createFacts())\n } catch (e: Throwable) {\n onError(e)\n }\n })\n }\n\n private val onNext: (Commit) -> Unit = { commit ->\n // Calculate facts.\n val email = commit.author.email\n val timestamp = commit.dateTimestamp\n val dateTime = LocalDateTime.ofEpochSecond(timestamp, 0,\n ZoneOffset.ofTotalSeconds(commit.dateTimeZoneOffset * 60))\n\n // DayWeek.\n val factDayWeek = fsDayWeek[email] ?: Array(7) { 0 }\n // The value is numbered from 1 (Monday) to 7 (Sunday).\n factDayWeek[dateTime.dayOfWeek.value - 1] += 1\n fsDayWeek[email] = factDayWeek\n\n // DayTime.\n val factDayTime = fsDayTime[email] ?: Array(24) { 0 }\n // Hour from 0 to 23.\n factDayTime[dateTime.hour] += 1\n fsDayTime[email] = factDayTime\n\n // RepoDateStart.\n fsRepoDateStart[email] = timestamp\n\n // RepoDateEnd.\n if (fsRepoDateEnd[email]!! == -1L) {\n fsRepoDateEnd[email] = timestamp\n }\n\n // Commits.\n val numCommits = fsCommitNum[email]!! + 1\n val numLinesCurrent = commit.numLinesAdded + commit.numLinesDeleted\n\n fsCommitNum[email] = numCommits\n fsCommitLineNumAvg[email] = calcIncAvg(fsCommitLineNumAvg[email]!!,\n numLinesCurrent.toDouble(), numCommits.toLong())\n\n val lines = commit.getAllAdded() + commit.getAllDeleted()\n lines.forEachIndexed { index, line ->\n fsLineLenAvg[email] = calcIncAvg(fsLineLenAvg[email]!!,\n line.length.toDouble(), fsLineNum[email]!! + index + 1)\n }\n fsLineNum[email] = fsLineNum[email]!! + lines.size\n\n fsLinesPerCommits[email]!![numCommits - 1] += lines.size\n\n // Variable naming.\n lines.forEach { line ->\n val tokens = Extractor().tokenize(line)\n val underscores = tokens.count { it.contains('_') }\n val camelCases = tokens.count {\n !it.contains('_') && it.contains(varNamingRegex)\n }\n val others = tokens.size - underscores - camelCases\n fsVariableNaming[email]!![FactCodes.VARIABLE_NAMING_SNAKE_CASE] +=\n underscores\n fsVariableNaming[email]!![FactCodes.VARIABLE_NAMING_CAMEL_CASE] +=\n camelCases\n fsVariableNaming[email]!![FactCodes.VARIABLE_NAMING_OTHER] +=\n others\n }\n\n // Indentation.\n fsIndentation[email]!![FactCodes.INDENTATION_SPACES] +=\n lines.count { it.isNotBlank() && it.startsWith(\" \") &&\n !it.contains(\"\\t\")}\n fsIndentation[email]!![FactCodes.INDENTATION_TABS] +=\n lines.count { it.startsWith(\"\\t\") }\n }\n\n private fun createFacts(): List {\n val fs = mutableListOf()\n emails.forEach { email ->\n val author = Author(email = email)\n fsDayTime[email]?.forEachIndexed { hour, count -> if (count > 0) {\n fs.add(Fact(serverRepo, FactCodes.COMMIT_DAY_TIME, hour,\n count.toString(), author))\n }}\n fsDayWeek[email]?.forEachIndexed { day, count -> if (count > 0) {\n fs.add(Fact(serverRepo, FactCodes.COMMIT_DAY_WEEK, day,\n count.toString(), author))\n }}\n fsVariableNaming[email]?.forEachIndexed { naming, count ->\n if (count > 0) {\n fs.add(Fact(serverRepo, FactCodes.VARIABLE_NAMING, naming,\n count.toString(), author))\n }\n }\n fsIndentation[email]?.forEachIndexed { indentation, count ->\n if (count > 0) {\n fs.add(Fact(serverRepo, FactCodes.INDENTATION, indentation,\n count.toString(), author))\n }\n }\n\n fs.add(Fact(serverRepo, FactCodes.REPO_DATE_START, 0,\n fsRepoDateStart[email].toString(), author))\n fs.add(Fact(serverRepo, FactCodes.REPO_DATE_END, 0,\n fsRepoDateEnd[email].toString(), author))\n fs.add(Fact(serverRepo, FactCodes.COMMIT_NUM, 0,\n fsCommitNum[email].toString(), author))\n fs.add(Fact(serverRepo, FactCodes.COMMIT_LINE_NUM_AVG, 0,\n fsCommitLineNumAvg[email].toString(), author))\n fs.add(Fact(serverRepo, FactCodes.LINE_NUM, 0,\n fsLineNum[email].toString(), author))\n fs.add(Fact(serverRepo, FactCodes.LINE_LEN_AVG, 0,\n fsLineLenAvg[email].toString(), author))\n val linesPerCommits = fsLinesPerCommits[email]!!\n .sliceArray(IntRange(0, fsCommitNum[email]!! - 1))\n addCommitsPerLinesFacts(fs, linesPerCommits, author)\n }\n return fs\n }\n\n private fun postFactsToServer(facts: List) {\n if (facts.isNotEmpty()) {\n api.postFacts(facts).onErrorThrow()\n Logger.info { \"Sent ${facts.size} facts to server\" }\n }\n }\n\n /**\n * Computes the average of a numerical sequence.\n * Calculated numbers is never bigger than maximum element of sequence.\n * No overflow due to summing of elements.\n * @param prev previous value of average\n * @param element new element of sequence\n * @param count number of element in sequence\n * @return new value of average with considering of new element\n */\n private fun calcIncAvg(prev: Double, element: Double,\n count: Long): Double {\n return prev * (1 - 1.0 / count) + element / count\n }\n\n private fun addCommitsPerLinesFacts(fs: MutableList,\n linesPerCommits: Array,\n author: Author) {\n if (linesPerCommits.isEmpty()) return\n\n var max = linesPerCommits[0]\n var min = linesPerCommits[0]\n for (lines in linesPerCommits) {\n if (lines > max) {\n max = lines\n }\n if (lines < min) {\n min = lines\n }\n }\n\n val numBins = Math.min(10, max - min + 1)\n val binSize = (max - min + 1) / numBins.toDouble()\n val bins = Array(numBins) { 0 }\n for (numLines in linesPerCommits) {\n if (numLines == 0) {\n continue\n }\n\n val binId = Math.floor((numLines - min) / binSize).toInt()\n bins[binId]++\n }\n\n for ((binId, numCommits) in bins.withIndex()) {\n if (numCommits == 0) {\n continue\n }\n\n val numLines = Math.floor(min + binId * binSize).toInt()\n fs.add(Fact(serverRepo, FactCodes.COMMIT_NUM_TO_LINE_NUM,\n numLines, numCommits.toString(), author))\n }\n }\n}\n" }, { "path": "src/main/kotlin/app/hashers/MetaHasher.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.hashers\n\nimport app.FactCodes\nimport app.Logger\nimport app.api.Api\nimport app.model.Author\nimport app.model.Fact\nimport app.model.Repo\nimport java.util.*\nimport kotlin.collections.HashSet\n\n/**\n * MetaHasher hashes repository and uploads stats to server.\n */\nclass MetaHasher(private val serverRepo: Repo = Repo(),\n private val api: Api) {\n fun calculateAndSendFacts(authors: HashSet,\n commitsCount: HashMap,\n userEmails: List) {\n // Sometimes contributors use multiple emails to contribute to single\n // project, as we don't know exactly who is who (except current user),\n // let's at least filter authors by similarity.\n val otherAuthors = authors.filter { author ->\n !userEmails.contains(author.email)\n }\n // Current user may not be a contributor of repo.\n val isUserAuthor = otherAuthors.size < authors.size\n val numAuthors = getAuthorsNum(otherAuthors) +\n if (isUserAuthor) 1 else 0\n\n val facts = mutableListOf()\n\n // Repository facts: team size.\n facts.add(FactCodes.REPO_TEAM_SIZE, 0, numAuthors)\n\n // Repository facts: commit share.\n val numAllCommits = commitsCount.values.fold(0) { acc, i -> acc + i }\n val avgCommits = Math.round(numAllCommits.toDouble() / numAuthors)\n .toInt()\n facts.add(FactCodes.COMMIT_SHARE_REPO_AVG, 0, avgCommits)\n\n if (isUserAuthor) {\n val numUserCommits = userEmails\n .mapNotNull { email -> commitsCount[email] }\n .fold(0) { acc, i -> acc + i }\n val userEmail = userEmails.first()\n facts.add(FactCodes.COMMIT_SHARE, 0, numUserCommits, userEmail)\n }\n\n postFactsToServer(facts)\n }\n\n private fun getAuthorsNum(authors: List): Int {\n val names = authors.map { it.name }\n val emails = authors.map { it.email.split(\"@\")[0] }\n val namesQgrams = names.map { getThreegrams(it) }\n val emailsQgrams = emails.map { getThreegrams(it) }\n\n val results = Array(authors.size) { Array(authors.size) {0} }\n\n for (i in 0..authors.size-2) {\n for (j in i+1 until authors.size) {\n if (isSameAuthor(namesQgrams[i], namesQgrams[j])) {\n results[j][i] = 1\n }\n if (isSameAuthor(emailsQgrams[i], emailsQgrams[j])) {\n results[j][i] = 1\n }\n }\n }\n\n return results.filter { it.sum() == 0 }.size\n }\n\n private fun isSameAuthor(firstThreegrams: Set,\n secondThreegrams: Set): Boolean {\n val intersectionSize = firstThreegrams.intersect(secondThreegrams).size\n val unionSize = firstThreegrams.union(secondThreegrams).size\n val jaccardValue = intersectionSize.toFloat() / unionSize\n return jaccardValue >= 0.3\n }\n\n private fun getThreegrams(str: String): Set {\n val threegrams = mutableSetOf()\n for (i in 0..str.length-3) {\n threegrams.add(listOf(str[i], str[i+1], str[i+2]).joinToString(\"\"))\n }\n return threegrams\n }\n\n private fun postFactsToServer(facts: List) {\n if (facts.isNotEmpty()) {\n api.postFacts(facts).onErrorThrow()\n Logger.info { \"Sent ${facts.size} facts to server\" }\n }\n }\n\n private fun MutableList.add(code: Int, key: Int, value: Any,\n email: String? = null) {\n val fact = if (email != null) {\n Fact(serverRepo, code, key, value.toString(), Author(email = email))\n } else {\n Fact(serverRepo, code, key, value.toString())\n }\n\n this.add(fact)\n }\n}\n" }, { "path": "src/main/kotlin/app/hashers/RepoHasher.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.hashers\n\nimport app.BuildConfig\nimport app.Logger\nimport app.api.Api\nimport app.config.Configurator\nimport app.model.Author\nimport app.model.LocalRepo\nimport app.model.ProcessEntry\nimport app.model.Repo\nimport app.utils.EmptyRepoException\nimport app.utils.FileHelper.toPath\nimport app.utils.HashingException\nimport app.utils.RepoHelper\nimport app.utils.batch\nimport org.eclipse.jgit.api.Git\nimport java.io.File\nimport java.io.IOException\nimport kotlin.collections.HashSet\n\nclass RepoHasher(private val api: Api,\n private val configurator: Configurator) {\n fun update(localRepo: LocalRepo) {\n Logger.debug { \"RepoHasher.update call: $localRepo\" }\n val processEntryId = localRepo.processEntryId\n\n if (!RepoHelper.isValidRepo(localRepo.path.toPath())) {\n // TODO(anatoly): Send empty repo.\n throw IllegalArgumentException(\"Invalid repo $localRepo\")\n }\n\n val git = loadGit(localRepo.path)\n try {\n Logger.info { \"Hashing of repo started\" }\n updateProcess(processEntryId, Api.PROCESS_STATUS_START)\n\n val (rehashes, authors, commitsCount) =\n CommitCrawler.fetchRehashesAndAuthors(git)\n localRepo.parseGitConfig(git.repository.config)\n val serverRepo = initServerRepo(localRepo, rehashes.last,\n processEntryId)\n\n // Get repo setup (commits, emails to hash) from server.\n postRepoFromServer(serverRepo)\n\n // Send all repo emails for invites.\n postAuthorsToServer(authors, serverRepo)\n\n // Choose emails to filter commits with.\n val emails = authors.map { author -> author.email }.toHashSet()\n val filteredEmails = if (localRepo.hashAllContributors) {\n emails\n } else {\n filterEmails(emails, serverRepo)\n }\n\n // Common error handling for subscribers.\n // Exceptions can't be thrown out of reactive chain.\n val errors = mutableListOf()\n val onError: (Throwable) -> Unit = {\n e -> errors.add(e)\n Logger.error(e, \"Hashing error\")\n }\n\n // Only code longevity needs to calculate each commit, if it's\n // disabled then read only author's emails.\n val crawlerEmails = if (!BuildConfig.LONGEVITY_ENABLED) {\n filteredEmails\n } else null\n val jgitObservable = CommitCrawler.getJGitObservable(git,\n rehashes.size, filteredEmails = crawlerEmails,\n extractCoauthors = true\n ).publish()\n val observable = CommitCrawler.getObservable(git,\n jgitObservable, serverRepo)\n\n // Hash by all plugins.\n if (BuildConfig.COMMIT_HASHER_ENABLED) {\n CommitHasher(serverRepo, api, rehashes, filteredEmails)\n .updateFromObservable(observable, onError)\n }\n if (BuildConfig.FACT_HASHER_ENABLED) {\n FactHasher(serverRepo, api, rehashes, filteredEmails)\n .updateFromObservable(observable, onError)\n }\n if (BuildConfig.LONGEVITY_ENABLED) {\n CodeLongevity(serverRepo, filteredEmails, git)\n .updateFromObservable(jgitObservable, onError, api)\n }\n if (BuildConfig.META_HASHER_ENABLED) {\n val userEmail = configurator.getUser().emails.map { it.email }\n MetaHasher(serverRepo, api)\n .calculateAndSendFacts(authors = authors,\n commitsCount = commitsCount,\n userEmails = userEmail)\n }\n if (BuildConfig.DISTANCES_ENABLED) {\n val userEmails = configurator.getUser().emails.map { it.email }.toHashSet()\n val pathsObservable = CommitCrawler.getJGitObservable(git,\n extractCommit = false, extractDate = true,\n extractDiffs = false, extractEmail = true,\n extractPaths = true)\n AuthorDistanceHasher(serverRepo, api, emails, userEmails)\n .updateFromObservable(pathsObservable, onError)\n }\n\n // Start and synchronously wait until all subscribers complete.\n Logger.print(\"Stats computation. May take a while...\")\n jgitObservable.connect()\n\n if (errors.isNotEmpty()) {\n throw HashingException(errors)\n }\n Logger.info(Logger.Events.HASHING_REPO_SUCCESS)\n { \"Hashing repo completed\" }\n updateProcess(processEntryId, Api.PROCESS_STATUS_COMPLETE)\n } catch (e: EmptyRepoException) {\n updateProcess(processEntryId, Api.PROCESS_STATUS_FAIL,\n Api.PROCESS_ERROR_EMPTY_REPO)\n throw e\n } catch (e: Throwable) {\n updateProcess(processEntryId, Api.PROCESS_STATUS_FAIL)\n throw e\n } finally {\n closeGit(git)\n }\n }\n\n private fun loadGit(path: String): Git {\n return try {\n Git.open(File(path))\n } catch (e: IOException) {\n throw IllegalStateException(\"Cannot access repository at $path\")\n }\n }\n\n private fun closeGit(git: Git) {\n git.repository?.close()\n git.close()\n }\n\n private fun postRepoFromServer(serverRepo: Repo) {\n val repo = api.postRepo(serverRepo).getOrThrow()\n serverRepo.commits = repo.commits\n Logger.info {\n \"Received repo from server with ${serverRepo.commits.size} commits\"\n }\n Logger.debug { serverRepo.toString() }\n }\n\n private fun postAuthorsToServer(authors: HashSet,\n serverRepo: Repo) {\n authors.forEach { author -> author.repo = serverRepo }\n for (authorsBatch in authors.asSequence().batch(1000)) {\n api.postAuthors(authorsBatch).onErrorThrow()\n }\n }\n\n private fun initServerRepo(localRepo: LocalRepo,\n initCommitRehash: String,\n processEntryId: Int?): Repo {\n val rehash = RepoHelper.calculateRepoRehash(initCommitRehash, localRepo)\n val repo = Repo(initialCommitRehash = initCommitRehash,\n rehash = rehash,\n meta = localRepo.meta,\n processEntryId = processEntryId ?: 0)\n Logger.debug { \"Local repo path: ${localRepo.path}\" }\n Logger.debug { \"Repo remote: ${localRepo.remoteOrigin}\" }\n Logger.debug { \"Repo rehash: $rehash\" }\n return repo\n }\n\n private fun filterEmails(emails: HashSet,\n serverRepo: Repo): HashSet {\n val knownEmails = hashSetOf()\n knownEmails.addAll(configurator.getUser().emails.map { it.email })\n knownEmails.addAll(serverRepo.emails)\n\n return knownEmails.filter { emails.contains(it) }.toHashSet()\n }\n\n private fun updateProcess(processEntryId: Int?, status: Int,\n errorCode: Int = 0) {\n if (processEntryId == null) {\n return\n }\n\n val processEntry = ProcessEntry(id = processEntryId, status = status,\n errorCode = errorCode)\n api.postProcess(listOf(processEntry)).onErrorThrow()\n }\n}\n" }, { "path": "src/main/kotlin/app/hashers/Vendors.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Alexander Surkov (alex@sourcerer.io),\n\n// Inspired by GitHub Liguist heuristics (https://github.com/github/linguist).\n\npackage app.hashers\n\n/**\n * List of regexps that are matched against file pathname. Used to filter out\n * vendor specific files from the repo statistics.\n */\nval VendorConventions = listOf(\n // Caches\n Regex(\"\"\"(^|/)cache/\"\"\"),\n\n // Dependencies\n Regex(\"\"\"^[Dd]ependencies/\"\"\"),\n\n // Distributions\n Regex(\"\"\"(^|/)dist/\"\"\"),\n\n // C deps\n Regex(\"\"\"^deps/\"\"\"),\n Regex(\"\"\"(^|/)configure$\"\"\"),\n Regex(\"\"\"(^|/)config.guess$\"\"\"),\n Regex(\"\"\"(^|/)config.sub$\"\"\"),\n\n // stuff autogenerated by autoconf - still C deps\n Regex(\"\"\"(^|/)aclocal.m4\"\"\"),\n Regex(\"\"\"(^|/)libtool.m4\"\"\"),\n Regex(\"\"\"(^|/)ltoptions.m4\"\"\"),\n Regex(\"\"\"(^|/)ltsugar.m4\"\"\"),\n Regex(\"\"\"(^|/)ltversion.m4\"\"\"),\n Regex(\"\"\"(^|/)lt~obsolete.m4\"\"\"),\n\n // Linters\n Regex(\"\"\"cpplint.py\"\"\"),\n\n // Node dependencies\n Regex(\"\"\"node_modules/\"\"\"),\n\n // Bower Components\n Regex(\"\"\"bower_components/\"\"\"),\n\n // Erlang bundles\n Regex(\"\"\"^rebar$\"\"\"),\n Regex(\"\"\"erlang.mk\"\"\"),\n\n // Go dependencies\n Regex(\"\"\"Godeps/_workspace/\"\"\"),\n\n // GNU indent profiles\n Regex(\"\"\".indent.pro\"\"\"),\n\n // Minified JavaScript and CSS\n Regex(\"\"\"(\\.|-)min\\.(js|css)$\"\"\"),\n\n // Stylesheets imported from packages\n Regex(\"\"\"([^\\s]*)import\\.(css|less|scss|styl)$\"\"\"),\n\n // Bootstrap css and js\n Regex(\"\"\"(^|/)bootstrap([^.]*)\\.(js|css|less|scss|styl)$\"\"\"),\n Regex(\"\"\"(^|/)custom\\.bootstrap([^\\s]*)(js|css|less|scss|styl)$\"\"\"),\n\n // Font Awesome\n Regex(\"\"\"(^|/)font-awesome\\.(css|less|scss|styl)$\"\"\"),\n Regex(\"\"\"(^|/)font-awesome/.*\\.(css|less|scss|styl)$\"\"\"),\n\n // Foundation css\n Regex(\"\"\"(^|/)foundation\\.(css|less|scss|styl)$\"\"\"),\n\n // Normalize.css\n Regex(\"\"\"(^|/)normalize\\.(css|less|scss|styl)$\"\"\"),\n\n // Skeleton.css\n Regex(\"\"\"(^|/)skeleton\\.(css|less|scss|styl)$\"\"\"),\n\n // Bourbon css\n Regex(\"\"\"(^|/)[Bb]ourbon/.*\\.(css|less|scss|styl)$\"\"\"),\n\n // Animate.css\n Regex(\"\"\"(^|/)animate\\.(css|less|scss|styl)$\"\"\"),\n\n // Materialize.css\n Regex(\"\"\"(^|/)materialize\\.(css|less|scss|styl|js)$\"\"\"),\n\n // Select2\n Regex(\"\"\"(^|/)select2/.*\\.(css|scss|js)$\"\"\"),\n\n // Vendored dependencies\n Regex(\"\"\"third[-_]?party/\"\"\"),\n Regex(\"\"\"3rd[-_]?party/\"\"\"),\n Regex(\"\"\"vendors?/\"\"\"),\n Regex(\"\"\"extern(al)?/\"\"\"),\n Regex(\"\"\"(^|/)[Vv]+endor/\"\"\"),\n\n // Debian packaging\n Regex(\"\"\"^debian/\"\"\"),\n\n // Haxelib projects often contain a neko bytecode file named run.n\n Regex(\"\"\"run.n$\"\"\"),\n\n // Bootstrap Datepicker\n Regex(\"\"\"bootstrap-datepicker/\"\"\"),\n\n // Commonly Bundled JavaScript frameworks\n\n // jQuery\n Regex(\"\"\"(^|/)jquery([^.]*)\\.js$\"\"\"),\n Regex(\"\"\"(^|/)jquery\\-\\d\\.\\d+(\\.\\d+)?\\.js$\"\"\"),\n\n // jQuery UI\n Regex(\"\"\"(^|/)jquery\\-ui(\\-\\d\\.\\d+(\\.\\d+)?)?(\\.\\w+)?\\.(js|css)$\"\"\"),\n Regex(\"\"\"(^|/)jquery\\.(ui|effects)\\.([^.]*)\\.(js|css)$\"\"\"),\n\n // jQuery Gantt\n Regex(\"\"\"jquery.fn.gantt.js\"\"\"),\n\n // jQuery fancyBox\n Regex(\"\"\"jquery.fancybox.(js|css)\"\"\"),\n\n // Fuel UX\n Regex(\"\"\"fuelux.js\"\"\"),\n\n // jQuery File Upload\n Regex(\"\"\"(^|/)jquery\\.fileupload(-\\w+)?\\.js$\"\"\"),\n\n // jQuery dataTables\n Regex(\"\"\"jquery.dataTables.js\"\"\"),\n\n // bootboxjs\n Regex(\"\"\"bootbox.js\"\"\"),\n\n // pdf-worker\n Regex(\"\"\"pdf.worker.js\"\"\"),\n\n // Slick\n Regex(\"\"\"(^|/)slick\\.\\w+.js$\"\"\"),\n\n // Leaflet plugins\n Regex(\"\"\"(^|/)Leaflet\\.Coordinates-\\d+\\.\\d+\\.\\d+\\.src\\.js$\"\"\"),\n Regex(\"\"\"leaflet.draw-src.js\"\"\"),\n Regex(\"\"\"leaflet.draw.css\"\"\"),\n Regex(\"\"\"Control.FullScreen.css\"\"\"),\n Regex(\"\"\"Control.FullScreen.js\"\"\"),\n Regex(\"\"\"leaflet.spin.js\"\"\"),\n Regex(\"\"\"wicket-leaflet.js\"\"\"),\n\n // Sublime Text workspace files\n Regex(\"\"\".sublime-project\"\"\"),\n Regex(\"\"\".sublime-workspace\"\"\"),\n\n // VS Code workspace files\n Regex(\"\"\".vscode\"\"\"),\n\n // Prototype\n Regex(\"\"\"(^|/)prototype(.*)\\.js$\"\"\"),\n Regex(\"\"\"(^|/)effects\\.js$\"\"\"),\n Regex(\"\"\"(^|/)controls\\.js$\"\"\"),\n Regex(\"\"\"(^|/)dragdrop\\.js$\"\"\"),\n\n // Typescript definition files\n Regex(\"\"\"(.*?)\\.d\\.ts$\"\"\"),\n\n // MooTools\n Regex(\"\"\"(^|/)mootools([^.]*)\\d+\\.\\d+.\\d+([^.]*)\\.js$\"\"\"),\n\n // Dojo\n Regex(\"\"\"(^|/)dojo\\.js$\"\"\"),\n\n // MochiKit\n Regex(\"\"\"(^|/)MochiKit\\.js$\"\"\"),\n\n // YUI\n Regex(\"\"\"(^|/)yahoo-([^.]*)\\.js$\"\"\"),\n Regex(\"\"\"(^|/)yui([^.]*)\\.js$\"\"\"),\n\n // WYS editors\n Regex(\"\"\"(^|/)ckeditor\\.js$\"\"\"),\n Regex(\"\"\"(^|/)tiny_mce([^.]*)\\.js$\"\"\"),\n Regex(\"\"\"(^|/)tiny_mce/(langs|plugins|themes|utils)\"\"\"),\n\n // Ace Editor\n Regex(\"\"\"(^|/)ace-builds/\"\"\"),\n\n // Fontello CSS files\n Regex(\"\"\"(^|/)fontello(.*?)\\.css$\"\"\"),\n\n // MathJax\n Regex(\"\"\"(^|/)MathJax/\"\"\"),\n\n // Chart.js\n Regex(\"\"\"(^|/)Chart\\.js$\"\"\"),\n\n // CodeMirror\n Regex(\"\"\"(^|/)[Cc]ode[Mm]irror/(\\d+\\.\\d+/)?(lib|mode|theme|addon|keymap|demo)\"\"\"),\n\n // SyntaxHighlighter - http://alexgorbatchev.com/\n Regex(\"\"\"(^|/)shBrush([^.]*)\\.js$\"\"\"),\n Regex(\"\"\"(^|/)shCore\\.js$\"\"\"),\n Regex(\"\"\"(^|/)shLegacy\\.js$\"\"\"),\n\n // AngularJS\n Regex(\"\"\"(^|/)angular([^.]*)\\.js$\"\"\"),\n\n // D3.js\n Regex(\"\"\"(^|\\/)d3(\\.v\\d+)?([^.]*)\\.js$\"\"\"),\n\n // React\n Regex(\"\"\"(^|/)react(-[^.]*)?\\.js$\"\"\"),\n\n // flow-typed\n Regex(\"\"\"(^|/)flow-typed/.*\\.js$\"\"\"),\n\n // Modernizr\n Regex(\"\"\"(^|/)modernizr\\-\\d\\.\\d+(\\.\\d+)?\\.js$\"\"\"),\n Regex(\"\"\"(^|/)modernizr\\.custom\\.\\d+\\.js$\"\"\"),\n\n // Knockout\n Regex(\"\"\"(^|/)knockout-(\\d+\\.){3}(debug\\.)?js$\"\"\"),\n\n // Python\n\n // Sphinx\n Regex(\"\"\"(^|/)docs?/_?(build|themes?|templates?|static)/\"\"\"),\n\n // django\n Regex(\"\"\"(^|/)admin_media/\"\"\"),\n Regex(\"\"\"(^|/)env/\"\"\"),\n\n // Fabric\n Regex(\"\"\"^fabfile\\.py$\"\"\"),\n\n // WAF\n Regex(\"\"\"^waf$\"\"\"),\n\n // .osx\n Regex(\"\"\"^.osx$\"\"\"),\n\n // Obj-C\n\n // Xcode\n Regex(\"\"\"\\.xctemplate/\"\"\"),\n Regex(\"\"\"\\.imageset/\"\"\"),\n Regex(\"\"\"\\.xc.*/\"\"\"),\n Regex(\"\"\"(^|/)Info\\.plist$\"\"\"),\n Regex(\"\"\"\\.storyboard$\"\"\"),\n\n // Carthage\n Regex(\"\"\"(^|/)Carthage/\"\"\"),\n\n // Sparkle\n Regex(\"\"\"(^|/)Sparkle/\"\"\"),\n\n // Crashlytics\n Regex(\"\"\"Crashlytics.framework/\"\"\"),\n\n // Fabric\n Regex(\"\"\"Fabric.framework/\"\"\"),\n\n // BuddyBuild\n Regex(\"\"\"BuddyBuildSDK.framework/\"\"\"),\n\n // Realm\n Regex(\"\"\"Realm.framework\"\"\"),\n\n // RealmSwift\n Regex(\"\"\"RealmSwift.framework\"\"\"),\n\n // git config files\n Regex(\"\"\"gitattributes$\"\"\"),\n Regex(\"\"\"gitignore$\"\"\"),\n Regex(\"\"\"gitmodules$\"\"\"),\n\n // Groovy\n\n // Gradle\n Regex(\"\"\"(^|/)gradlew$\"\"\"),\n Regex(\"\"\"(^|/)gradlew\\.bat$\"\"\"),\n Regex(\"\"\"(^|/)gradle/wrapper/\"\"\"),\n\n // Java\n\n // Maven\n Regex(\"\"\"(^|/)mvnw$\"\"\"),\n Regex(\"\"\"(^|/)mvnw\\.cmd$\"\"\"),\n Regex(\"\"\"(^|/)\\.mvn/wrapper/\"\"\"),\n\n // .NET\n\n // Visual Studio IntelliSense\n Regex(\"\"\"-vsdoc\\.js$\"\"\"),\n Regex(\"\"\"\\.intellisense\\.js$\"\"\"),\n\n // jQuery validation plugin (MS bundles this with asp.net mvc),\n Regex(\"\"\"(^|/)jquery([^.]*)\\.validate(\\.unobtrusive)?\\.js$\"\"\"),\n Regex(\"\"\"(^|/)jquery([^.]*)\\.unobtrusive\\-ajax\\.js$\"\"\"),\n\n // Microsoft Ajax\n Regex(\"\"\"(^|/)[Mm]icrosoft([Mm]vc)?([Aa]jax|[Vv]alidation)(\\.debug)?\\.js$\"\"\"),\n\n // NuGet\n Regex(\"\"\"^[Pp]ackages\\/.+\\.\\d+\\/\"\"\"),\n\n // ExtJS\n Regex(\"\"\"(^|/)extjs/.*?\\.js$\"\"\"),\n Regex(\"\"\"(^|/)extjs/.*?\\.xml$\"\"\"),\n Regex(\"\"\"(^|/)extjs/.*?\\.txt$\"\"\"),\n Regex(\"\"\"(^|/)extjs/.*?\\.html$\"\"\"),\n Regex(\"\"\"(^|/)extjs/.*?\\.properties$\"\"\"),\n Regex(\"\"\"(^|/)extjs/.sencha/\"\"\"),\n Regex(\"\"\"(^|/)extjs/docs/\"\"\"),\n Regex(\"\"\"(^|/)extjs/builds/\"\"\"),\n Regex(\"\"\"(^|/)extjs/cmd/\"\"\"),\n Regex(\"\"\"(^|/)extjs/examples/\"\"\"),\n Regex(\"\"\"(^|/)extjs/locale/\"\"\"),\n Regex(\"\"\"(^|/)extjs/packages/\"\"\"),\n Regex(\"\"\"(^|/)extjs/plugins/\"\"\"),\n Regex(\"\"\"(^|/)extjs/resources/\"\"\"),\n Regex(\"\"\"(^|/)extjs/src/\"\"\"),\n Regex(\"\"\"(^|/)extjs/welcome/\"\"\"),\n\n // Html5shiv\n Regex(\"\"\"(^|/)html5shiv\\.js$\"\"\"),\n\n // Test fixtures\n Regex(\"\"\"^[Tt]ests?/fixtures/\"\"\"),\n Regex(\"\"\"^[Ss]pecs?/fixtures/\"\"\"),\n\n // PhoneGap/Cordova\n Regex(\"\"\"(^|/)cordova([^.]*)\\.js$\"\"\"),\n Regex(\"\"\"(^|/)cordova\\-\\d\\.\\d(\\.\\d)?\\.js$\"\"\"),\n\n // Foundation js\n Regex(\"\"\"foundation(\\..*)?\\.js$\"\"\"),\n\n // Vagrant\n Regex(\"\"\"^Vagrantfile$\"\"\"),\n\n // .DS_Stores\n Regex(\"\"\".[Dd][Ss]_[Ss]tore$\"\"\"),\n\n // R packages\n Regex(\"\"\"^vignettes/\"\"\"),\n Regex(\"\"\"^inst/extdata/\"\"\"),\n\n // Octicons\n Regex(\"\"\"octicons.css\"\"\"),\n Regex(\"\"\"sprockets-octicons.scss\"\"\"),\n\n // Typesafe Activator\n Regex(\"\"\"(^|/)activator$\"\"\"),\n Regex(\"\"\"(^|/)activator\\.bat$\"\"\"),\n\n // ProGuard\n Regex(\"\"\"proguard.pro\"\"\"),\n Regex(\"\"\"proguard-rules.pro\"\"\"),\n\n // PuPHPet\n Regex(\"\"\"^puphpet/\"\"\"),\n\n // Android Google APIs\n Regex(\"\"\"(^|/)\\.google_apis/\"\"\"),\n\n // Jenkins Pipeline\n Regex(\"\"\"^Jenkinsfile$\"\"\"),\n\n // generated by BUCKLESCRIPT\n Regex(\"\"\"\\.bs\\.js$\"\"\")\n)\n" }, { "path": "src/main/kotlin/app/model/Author.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.model\n\nimport app.Protos\nimport com.google.protobuf.InvalidProtocolBufferException\nimport java.security.InvalidParameterException\n\n/**\n * Commit author.\n */\ndata class Author(\n var name: String = \"\",\n var email: String = \"\",\n var repo: Repo = Repo()\n) {\n @Throws(InvalidParameterException::class)\n constructor(proto: Protos.Author) : this() {\n email = proto.email\n name = proto.name\n repo = Repo(proto.repoRehash)\n }\n\n @Throws(InvalidProtocolBufferException::class)\n constructor(bytes: ByteArray) : this(Protos.Author.parseFrom(bytes))\n\n constructor(serialized: String) : this(serialized.toByteArray())\n\n fun getProto(): Protos.Author {\n return Protos.Author.newBuilder()\n .setEmail(email)\n .setName(name)\n .setRepoRehash(repo.rehash)\n .build()\n }\n\n fun serialize(): ByteArray {\n return getProto().toByteArray()\n }\n\n // Email defines user identity.\n override fun equals(other: Any?): Boolean {\n if (other is Author) {\n return email == other.email\n }\n return false\n }\n\n override fun hashCode(): Int {\n return email.hashCode()\n }\n}\n" }, { "path": "src/main/kotlin/app/model/AuthorDistance.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n\npackage app.model\n\nimport app.Protos\nimport com.google.protobuf.InvalidProtocolBufferException\nimport java.security.InvalidParameterException\n\ndata class AuthorDistance(\n var repo: Repo = Repo(),\n var email: String = \"\",\n var score: Double = 0.0\n) {\n @Throws(InvalidParameterException::class)\n constructor(proto: Protos.AuthorDistance) : this() {\n repo = Repo(rehash = proto.repoRehash)\n email = proto.email\n score = proto.score\n }\n\n @Throws(InvalidProtocolBufferException::class)\n constructor(bytes: ByteArray) : this(Protos.AuthorDistance.parseFrom(bytes))\n\n constructor(serialized: String) : this(serialized.toByteArray())\n\n fun getProto(): Protos.AuthorDistance {\n return Protos.AuthorDistance.newBuilder()\n .setRepoRehash(repo.rehash)\n .setEmail(email)\n .setScore(score)\n .build()\n }\n\n fun serialize(): ByteArray {\n return getProto().toByteArray()\n }\n}\n" }, { "path": "src/main/kotlin/app/model/AuthorDistanceGroup.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n\npackage app.model\n\nimport app.Protos\nimport com.google.protobuf.InvalidProtocolBufferException\nimport java.security.InvalidParameterException\n\ndata class AuthorDistanceGroup(\n var stats: List = listOf()\n) {\n @Throws(InvalidParameterException::class)\n constructor(proto: Protos.AuthorDistanceGroup) : this() {\n stats = proto.authorDistancesList.map { AuthorDistance(it) }\n }\n\n @Throws(InvalidProtocolBufferException::class)\n constructor(bytes: ByteArray) : this(Protos.AuthorDistanceGroup.parseFrom\n (bytes))\n\n constructor(serialized: String) : this(serialized.toByteArray())\n\n fun getProto(): Protos.AuthorDistanceGroup {\n return Protos.AuthorDistanceGroup.newBuilder()\n .addAllAuthorDistances(stats.map { it.getProto() })\n .build()\n }\n\n fun serialize(): ByteArray {\n return getProto().toByteArray()\n }\n}\n" }, { "path": "src/main/kotlin/app/model/AuthorGroup.kt", "content": "package app.model\n\nimport app.Protos\nimport com.google.protobuf.InvalidProtocolBufferException\nimport java.security.InvalidParameterException\n\n/**\n * Group of commit authors.\n */\ndata class AuthorGroup(\n var authors: List = listOf()\n) {\n @Throws(InvalidParameterException::class)\n constructor(proto: Protos.AuthorGroup) : this() {\n authors = proto.authorsList.map { it -> Author(it) }\n }\n\n @Throws(InvalidProtocolBufferException::class)\n constructor(bytes: ByteArray) : this(Protos.AuthorGroup.parseFrom(bytes))\n\n constructor(serialized: String) : this(serialized.toByteArray())\n\n fun getProto(): Protos.AuthorGroup {\n return Protos.AuthorGroup.newBuilder()\n .addAllAuthors(authors.map { it -> it.getProto() })\n .build()\n }\n\n fun serialize(): ByteArray {\n return getProto().toByteArray()\n }\n}\n" }, { "path": "src/main/kotlin/app/model/Classifier.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n\npackage app.model\n\nimport app.ClassifierProtos\nimport com.google.protobuf.InvalidProtocolBufferException\nimport java.security.InvalidParameterException\n\nclass Classifier {\n var tokens: List\n var libraries: List\n var idf: Map\n var weights: Map>\n var biases: Map\n\n @Throws(InvalidParameterException::class)\n constructor(proto: ClassifierProtos.Classifier) {\n tokens = proto.tokensList\n libraries = proto.librariesList\n idf = tokens.zip(proto.idfList).toMap()\n weights = libraries.zip(proto.weightsList.partition(tokens.size)\n .map {it: List -> tokens.zip(it).toMap()}).toMap()\n biases = libraries.zip(proto.biasesList).toMap()\n }\n\n @Throws(InvalidProtocolBufferException::class)\n constructor(bytes: ByteArray) : this(ClassifierProtos.Classifier\n .parseFrom(bytes))\n\n fun evaluate(input: List): List {\n val inputTokens = input.filter { it in tokens}\n val tokensWithWeight = inputTokens.groupBy { it }\n .map { (token, tokens) -> Pair(token, tokens.size * idf[token]!!) }\n .toMap()\n val norm = Math.sqrt(tokensWithWeight\n .map { (_, tfidf) -> tfidf * tfidf }\n .sum() + 1e-7)\n val output = if (libraries.size == 2) {\n val secondDecision = Math.exp(tokensWithWeight\n .map { (token, tfidf) ->\n tfidf / norm * weights[libraries[0]]!![token]!!\n }\n .sum() + biases[libraries[0]]!!)\n listOf(1.0, secondDecision)\n } else libraries.map {\n Math.exp(tokensWithWeight\n .map { (token, tfidf) -> tfidf / norm * weights[it]!![token]!! }\n .sum() + biases[it]!!)\n }\n val norm2 = output.sum()\n val probs = output.map { it / norm2 }\n\n return probs\n }\n\n private fun List.partition(size: Int): List> {\n return this.withIndex()\n .groupBy { it.index / size }\n .map { group -> group.value.map { it.value } }\n }\n}\n" }, { "path": "src/main/kotlin/app/model/Commit.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.model\n\nimport app.Protos\nimport com.google.protobuf.InvalidProtocolBufferException\nimport org.apache.commons.codec.digest.DigestUtils\nimport org.eclipse.jgit.revwalk.RevCommit\nimport java.security.InvalidParameterException\n\n/**\n * Commit.\n */\ndata class Commit(\n var rehash: String = \"\",\n var repo: Repo = Repo(),\n // Tree rehash used for adjustments of stats due to rebase and fraud.\n var treeRehash: String = \"\",\n var author: Author = Author(),\n var coauthors: List = mutableListOf(),\n var dateTimestamp: Long = 0,\n var dateTimeZoneOffset: Int = 0,\n var isQommit: Boolean = false,\n var numLinesAdded: Int = 0,\n var numLinesDeleted: Int = 0,\n var stats: List = mutableListOf()\n) {\n // Wrapping JGit's RevCommit.\n var raw: RevCommit? = null // Not sent to sever.\n var diffs: List = listOf()\n\n constructor(revCommit: RevCommit, coauthorsList: List? = null) :\n this() {\n raw = revCommit\n\n rehash = DigestUtils.sha256Hex(revCommit.id.name)\n author = Author(revCommit.authorIdent.name,\n revCommit.authorIdent.emailAddress.toLowerCase())\n dateTimestamp = revCommit.authorIdent.getWhen().time / 1000\n dateTimeZoneOffset = revCommit.authorIdent.timeZoneOffset\n treeRehash = DigestUtils.sha256Hex(revCommit.tree.name)\n if (coauthorsList != null) {\n coauthors = coauthorsList\n }\n }\n\n @Throws(InvalidParameterException::class)\n constructor(proto: Protos.Commit) : this() {\n rehash = proto.rehash\n repo = Repo(rehash = proto.repoRehash)\n treeRehash = proto.treeRehash\n author = Author(proto.authorName, proto.authorEmail)\n dateTimestamp = proto.date\n isQommit = proto.isQommit\n numLinesAdded = proto.numLinesAdded\n numLinesDeleted = proto.numLinesDeleted\n stats = proto.statsList.map { CommitStats(it) }\n }\n\n @Throws(InvalidProtocolBufferException::class)\n constructor(bytes: ByteArray) : this(Protos.Commit.parseFrom(bytes))\n\n constructor(serialized: String) : this(serialized.toByteArray())\n\n fun getProto(): Protos.Commit {\n return Protos.Commit.newBuilder()\n .setRehash(rehash)\n .setRepoRehash(repo.rehash)\n .setTreeRehash(treeRehash)\n .setAuthorName(author.name)\n .setAuthorEmail(author.email)\n .setDate(dateTimestamp)\n .setIsQommit(isQommit)\n .setNumLinesAdded(numLinesAdded)\n .setNumLinesDeleted(numLinesDeleted)\n .addAllStats(stats.map { it.getProto() })\n .build()\n }\n\n fun serialize(): ByteArray {\n return getProto().toByteArray()\n }\n\n override fun equals(other: Any?): Boolean {\n if (this === other) return true\n if (other?.javaClass != javaClass) return false\n return rehash == (other as Commit).rehash\n }\n\n override fun hashCode(): Int {\n return rehash.hashCode()\n }\n\n fun getAllAdded(): List {\n return diffs.map { it.getAllAdded() }.flatten()\n }\n\n fun getAllDeleted(): List {\n return diffs.map { it.getAllDeleted() }.flatten()\n }\n}\n" }, { "path": "src/main/kotlin/app/model/CommitGroup.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.model\n\nimport app.Protos\nimport com.google.protobuf.InvalidProtocolBufferException\nimport java.security.InvalidParameterException\n\n/**\n * Tech stats on a commit.\n */\ndata class CommitGroup(\n var commits: List = listOf()\n) {\n @Throws(InvalidParameterException::class)\n constructor(proto: Protos.CommitGroup) : this() {\n commits = proto.commitsList.map { it -> Commit(it) }\n }\n\n @Throws(InvalidProtocolBufferException::class)\n constructor(bytes: ByteArray) : this(Protos.CommitGroup.parseFrom(bytes))\n\n constructor(serialized: String) : this(serialized.toByteArray())\n\n fun getProto(): Protos.CommitGroup {\n return Protos.CommitGroup.newBuilder()\n .addAllCommits(commits.map { it -> it.getProto() })\n .build()\n }\n\n fun serialize(): ByteArray {\n return getProto().toByteArray()\n }\n}\n" }, { "path": "src/main/kotlin/app/model/CommitStats.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.model\n\nimport app.Protos\nimport com.google.protobuf.InvalidProtocolBufferException\nimport java.security.InvalidParameterException\n\n/**\n * Tech stats on a commit.\n */\ndata class CommitStats(\n var numLinesAdded: Int = 0,\n var numLinesDeleted: Int = 0,\n var type: Int = 0,\n var tech: String = \"\"\n) {\n @Throws(InvalidParameterException::class)\n constructor(proto: Protos.CommitStats) : this() {\n numLinesAdded = proto.numLinesAdded\n numLinesDeleted = proto.numLinesDeleted\n type = proto.type\n tech = proto.tech\n }\n\n @Throws(InvalidProtocolBufferException::class)\n constructor(bytes: ByteArray) : this(Protos.CommitStats.parseFrom(bytes))\n\n constructor(serialized: String) : this(serialized.toByteArray())\n\n fun getProto(): Protos.CommitStats {\n return Protos.CommitStats.newBuilder()\n .setNumLinesAdded(numLinesAdded)\n .setNumLinesDeleted(numLinesDeleted)\n .setType(type)\n .setTech(tech)\n .build()\n }\n\n fun serialize(): ByteArray {\n return getProto().toByteArray()\n }\n}\n" }, { "path": "src/main/kotlin/app/model/DiffContent.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.model\n\nclass DiffContent(\n val content: List = listOf(),\n val ranges: List = listOf(),\n var imports: List = listOf()\n) {\n fun getAllDiffs(): List {\n return ranges.fold(mutableListOf()) { total, range ->\n total.addAll(content.subList(range.start, range.end))\n total\n }\n }\n}\n" }, { "path": "src/main/kotlin/app/model/DiffFile.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.model\n\nimport app.utils.FileHelper\nimport org.eclipse.jgit.diff.DiffEntry\n\nclass DiffFile(\n val path: String = \"\",\n val changeType: DiffEntry.ChangeType,\n var old: DiffContent = DiffContent(),\n var new: DiffContent = DiffContent(),\n var lang: String = \"\"\n) {\n val extension: String = FileHelper.getFileExtension(path)\n\n fun getAllAdded(): List {\n return new.getAllDiffs()\n }\n\n fun getAllDeleted(): List {\n return old.getAllDiffs()\n }\n}\n" }, { "path": "src/main/kotlin/app/model/DiffRange.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.model\n\n/**\n * [start] (inclusive) and [end] (exclusive) specifies range of changed lines.\n */\ndata class DiffRange(val start: Int, val end: Int)\n" }, { "path": "src/main/kotlin/app/model/Error.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.model\n\nimport app.Protos\nimport com.google.protobuf.InvalidProtocolBufferException\nimport java.security.InvalidParameterException\n\ndata class Error(\n var code: Int = 0,\n var message: String = \"\"\n) {\n @Throws(InvalidParameterException::class)\n constructor(proto: Protos.Error) : this() {\n code = proto.code\n message = proto.message\n }\n\n @Throws(InvalidProtocolBufferException::class)\n constructor(bytes: ByteArray) : this(Protos.Error.parseFrom(bytes))\n\n constructor(serialized: String) : this(serialized.toByteArray())\n\n fun getProto(): Protos.Error {\n return Protos.Error.newBuilder()\n .setCode(code)\n .setMessage(message)\n .build()\n }\n\n fun serialize(): ByteArray {\n return getProto().toByteArray()\n }\n}\n" }, { "path": "src/main/kotlin/app/model/Errors.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.model\n\nimport app.Protos\nimport com.google.protobuf.InvalidProtocolBufferException\nimport java.security.InvalidParameterException\n\ndata class Errors (\n var errors: List = listOf()\n) {\n @Throws(InvalidParameterException::class)\n constructor(proto: Protos.Errors) : this() {\n errors = proto.errorsList.map { error -> Error(error) }\n }\n\n @Throws(InvalidProtocolBufferException::class)\n constructor(bytes: ByteArray) : this(Protos.Errors.parseFrom(bytes))\n\n constructor(serialized: String) : this(serialized.toByteArray())\n\n fun getProto(): Protos.Errors {\n return Protos.Errors.newBuilder()\n .addAllErrors(errors.map { error -> error.getProto() })\n .build()\n }\n\n fun serialize(): ByteArray {\n return getProto().toByteArray()\n }\n}\n" }, { "path": "src/main/kotlin/app/model/Fact.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.model\n\nimport app.Protos\nimport com.google.protobuf.InvalidProtocolBufferException\nimport java.security.InvalidParameterException\n\n/**\n * Key-value statistics for fun facts.\n */\ndata class Fact(\n var repo: Repo = Repo(),\n var code: Int = 0,\n var key: Int = 0,\n var value: String = \"\",\n var author: Author = Author(),\n var value2: String = \"\",\n var value3: String = \"\"\n) {\n @Throws(InvalidParameterException::class)\n constructor(proto: Protos.Fact) : this() {\n repo = Repo(rehash = proto.repoRehash)\n author = Author(\"\", proto.email)\n code = proto.code\n key = proto.key\n value = \"\"\n }\n\n @Throws(InvalidProtocolBufferException::class)\n constructor(bytes: ByteArray) : this(Protos.Fact.parseFrom(bytes))\n\n constructor(serialized: String) : this(serialized.toByteArray())\n\n fun getProto(): Protos.Fact {\n return Protos.Fact.newBuilder()\n .setRepoRehash(repo.rehash)\n .setEmail(author.email)\n .setCode(code)\n .setKey(key)\n .setValue1(value)\n .setValue2(value2)\n .setValue3(value3)\n .build()\n }\n\n fun serialize(): ByteArray {\n return getProto().toByteArray()\n }\n}\n" }, { "path": "src/main/kotlin/app/model/FactGroup.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.model\n\nimport app.Protos\nimport com.google.protobuf.InvalidProtocolBufferException\nimport java.security.InvalidParameterException\n\n/**\n * Group of key-value facts.\n */\ndata class FactGroup(\n var stats: List = listOf()\n) {\n @Throws(InvalidParameterException::class)\n constructor(proto: Protos.FactGroup) : this() {\n stats = proto.factsList.map { it -> Fact(it) }\n }\n\n @Throws(InvalidProtocolBufferException::class)\n constructor(bytes: ByteArray) : this(Protos.FactGroup.parseFrom(bytes))\n\n constructor(serialized: String) : this(serialized.toByteArray())\n\n fun getProto(): Protos.FactGroup {\n return Protos.FactGroup.newBuilder()\n .addAllFacts(stats.map { it -> it.getProto() })\n .build()\n }\n\n fun serialize(): ByteArray {\n return getProto().toByteArray()\n }\n}\n" }, { "path": "src/main/kotlin/app/model/LibraryMeta.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n\npackage app.model\n\nimport app.ClassifierProtos\nimport com.google.protobuf.InvalidProtocolBufferException\nimport java.security.InvalidParameterException\n\ndata class Library (\n val id: String,\n val imports: List,\n val version: Int\n)\n\nclass LibraryMeta (\n var langLibraries: HashMap> = hashMapOf()\n){\n var importToIndexMap = buildImportToIndexMap(langLibraries)\n\n fun buildImportToIndexMap(langLibraries: HashMap>):\n HashMap> {\n val importToIndexMap = hashMapOf>()\n\n for ((lang, libs) in langLibraries) {\n val map = hashMapOf()\n libs.forEach { lib -> lib.imports.forEach { import ->\n map[import] = lib.id\n }}\n importToIndexMap[lang] = map\n }\n\n return importToIndexMap\n }\n\n @Throws(InvalidParameterException::class)\n constructor(proto: ClassifierProtos.LibrariesMeta) : this() {\n val tempMap = proto.languagesList.associateBy({ lang -> lang.id },\n { lang ->\n lang.librariesList.map { lib ->\n Library(lib.id, lib.importsList, lib.version)\n }\n })\n langLibraries = HashMap(tempMap)\n importToIndexMap = buildImportToIndexMap(langLibraries)\n }\n\n @Throws(InvalidProtocolBufferException::class)\n constructor(bytes: ByteArray) :\n this(ClassifierProtos.LibrariesMeta.parseFrom(bytes))\n\n constructor(serialized: String) : this(serialized.toByteArray())\n\n fun getProto(): ClassifierProtos.LibrariesMeta {\n return ClassifierProtos.LibrariesMeta.newBuilder()\n .addAllLanguages(langLibraries.map({ (langId, libs) ->\n ClassifierProtos.Language.newBuilder()\n .setId(langId)\n .addAllLibraries(libs.map { lib ->\n ClassifierProtos.Library.newBuilder()\n .setId(lib.id)\n .setVersion(lib.version)\n .addAllImports(lib.imports)\n .build()\n })\n .build()\n }))\n .build()\n }\n\n fun serialize(): ByteArray {\n return getProto().toByteArray()\n }\n}\n" }, { "path": "src/main/kotlin/app/model/LocalRepo.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.model\n\nimport com.fasterxml.jackson.annotation.JsonIgnore\nimport org.eclipse.jgit.lib.Config\n\ndata class LocalRepo(var path: String = \"\") {\n var hashAllContributors: Boolean = false\n\n @JsonIgnore var author: Author = Author()\n @JsonIgnore var remoteOrigin: String = \"\"\n @JsonIgnore var meta = RepoMeta()\n @JsonIgnore var processEntryId: Int? = 0\n\n fun parseGitConfig(config: Config) {\n author = Author(\n name = config.getString(\"user\", null, \"name\") ?: \"\",\n email = config.getString(\"user\", null, \"email\") ?: \"\")\n remoteOrigin = config.getString(\"remote\", \"origin\", \"url\") ?: \"\"\n }\n\n override fun toString(): String {\n return path\n }\n}\n" }, { "path": "src/main/kotlin/app/model/Process.kt", "content": "package app.model\n\nimport app.Protos\nimport com.google.protobuf.InvalidProtocolBufferException\nimport java.security.InvalidParameterException\n\n/**\n * Used to describe processing of multiple repos.\n */\ndata class Process(\n var id: Int = 0,\n var requestNumEntries: Int = 0,\n var entries: List = mutableListOf()\n) {\n @Throws(InvalidParameterException::class)\n constructor(proto: Protos.Process) : this() {\n id = proto.id\n requestNumEntries = proto.requestNumEntries\n entries = proto.entriesList.map { ProcessEntry(it) }\n }\n\n @Throws(InvalidProtocolBufferException::class)\n constructor(bytes: ByteArray) : this(Protos.Process.parseFrom(bytes))\n\n constructor(serialized: String) : this(serialized.toByteArray())\n\n fun getProto(): Protos.Process {\n return Protos.Process.newBuilder()\n .setId(id)\n .setRequestNumEntries(requestNumEntries)\n .addAllEntries(entries.map { it.getProto() })\n .build()\n }\n\n fun serialize(): ByteArray {\n return getProto().toByteArray()\n }\n}\n" }, { "path": "src/main/kotlin/app/model/ProcessEntry.kt", "content": "package app.model\n\nimport app.Protos\nimport com.google.protobuf.InvalidProtocolBufferException\nimport java.security.InvalidParameterException\n\n/**\n * Used to describe processing of a single repo.\n */\ndata class ProcessEntry(\n var id: Int = 0,\n var status: Int = 0,\n var errorCode: Int = 0\n) {\n @Throws(InvalidParameterException::class)\n constructor(proto: Protos.ProcessEntry) : this() {\n id = proto.id\n status = proto.status\n errorCode = proto.errorCode\n }\n\n @Throws(InvalidProtocolBufferException::class)\n constructor(bytes: ByteArray) : this(Protos.ProcessEntry.parseFrom(bytes))\n\n constructor(serialized: String) : this(serialized.toByteArray())\n\n fun getProto(): Protos.ProcessEntry {\n return Protos.ProcessEntry.newBuilder()\n .setId(id)\n .setStatus(status)\n .setErrorCode(errorCode)\n .build()\n }\n\n fun serialize(): ByteArray {\n return getProto().toByteArray()\n }\n}\n" }, { "path": "src/main/kotlin/app/model/Repo.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.model\n\nimport app.Protos\nimport com.google.protobuf.InvalidProtocolBufferException\nimport java.security.InvalidParameterException\n\n/**\n * Repository.\n */\ndata class Repo(\n // Basic info.\n var rehash: String = \"\",\n var initialCommitRehash: String = \"\",\n\n // Authors' email filter for hashed commits. If empty list then hash\n // only commits that created by current user.\n var emails: List = listOf(),\n\n // Raw commits server history. Used to find overlap of commits.\n var commits: List = listOf(),\n\n // Meta info about repo. Is not used for a locally run app.\n var meta: RepoMeta = RepoMeta(),\n\n // Processing session id, used to check the processing status.\n var processEntryId: Int = 0\n) {\n @Throws(InvalidParameterException::class)\n constructor(proto: Protos.Repo) : this() {\n rehash = proto.rehash\n initialCommitRehash = proto.initialCommitRehash\n emails = proto.emailsList\n commits = proto.commitsList.map { Commit(it) }\n processEntryId = proto.processEntryId\n }\n\n @Throws(InvalidProtocolBufferException::class)\n constructor(bytes: ByteArray) : this(Protos.Repo.parseFrom(bytes))\n\n constructor(serialized: String) : this(serialized.toByteArray())\n\n fun getProto(): Protos.Repo {\n return Protos.Repo.newBuilder()\n .setRehash(rehash)\n .setInitialCommitRehash(rehash)\n .addAllEmails(emails)\n .addAllCommits(commits.map { it.getProto() })\n .setMeta(meta.getProto())\n .setProcessEntryId(processEntryId)\n .build()\n }\n\n fun serialize(): ByteArray {\n return getProto().toByteArray()\n }\n\n override fun equals(other: Any?): Boolean {\n if (this === other) return true\n if (other?.javaClass != javaClass) return false\n return rehash == (other as Repo).rehash\n }\n\n override fun hashCode(): Int {\n return rehash.hashCode()\n }\n}\n" }, { "path": "src/main/kotlin/app/model/RepoMeta.kt", "content": "package app.model\n\nimport app.Protos\nimport com.google.protobuf.InvalidProtocolBufferException\nimport java.security.InvalidParameterException\n\n/**\n * Meta info about repo. Is not used for a locally run app.\n */\ndata class RepoMeta(\n var hosterId: String = \"\",\n var service: String = \"\",\n var name: String = \"\",\n var ownerName: String = \"\",\n var description: String = \"\",\n var htmlUrl: String = \"\",\n var cloneUrl: String = \"\"\n) {\n @Throws(InvalidParameterException::class)\n constructor(proto: Protos.RepoMeta) : this() {\n hosterId = proto.hosterId\n service = proto.service\n name = proto.name\n ownerName = proto.ownerName\n description = proto.description\n htmlUrl = proto.htmlUrl\n cloneUrl = proto.cloneUrl\n }\n\n @Throws(InvalidProtocolBufferException::class)\n constructor(bytes: ByteArray) : this(Protos.RepoMeta.parseFrom(bytes))\n\n constructor(serialized: String) : this(serialized.toByteArray())\n\n fun getProto(): Protos.RepoMeta {\n return Protos.RepoMeta.newBuilder()\n .setHosterId(hosterId)\n .setService(service)\n .setName(name)\n .setOwnerName(ownerName)\n .setDescription(description)\n .setHtmlUrl(htmlUrl)\n .setCloneUrl(cloneUrl)\n .build()\n }\n\n fun serialize(): ByteArray {\n return getProto().toByteArray()\n }\n}\n" }, { "path": "src/main/kotlin/app/model/User.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.model\n\nimport app.Protos\nimport com.google.protobuf.InvalidProtocolBufferException\nimport java.security.InvalidParameterException\n\n/**\n * User information.\n */\ndata class User (\n var repos: MutableList = mutableListOf(),\n var emails: HashSet = hashSetOf()\n) {\n @Throws(InvalidParameterException::class)\n constructor(proto: Protos.User) : this() {\n repos = proto.reposList.map { repo -> Repo(repo) }\n .toMutableList()\n emails = proto.emailsList.map { email -> UserEmail(email) }.toHashSet()\n }\n\n @Throws(InvalidProtocolBufferException::class)\n constructor(bytes: ByteArray) : this(Protos.User.parseFrom(bytes))\n\n constructor(serialized: String) : this(serialized.toByteArray())\n\n fun getProto(): Protos.User {\n return Protos.User.newBuilder()\n .addAllRepos(repos.map { repo -> repo.getProto() })\n .addAllEmails(emails.map { email -> email.getProto() })\n .build()\n }\n\n fun serialize(): ByteArray {\n return getProto().toByteArray()\n }\n}\n" }, { "path": "src/main/kotlin/app/model/UserEmail.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.model\n\nimport app.Protos\nimport com.google.protobuf.InvalidProtocolBufferException\nimport java.security.InvalidParameterException\n\n/**\n * User information.\n */\nclass UserEmail(\n var email: String = \"\",\n var primary: Boolean = false,\n var verified: Boolean = false\n) {\n @Throws(InvalidParameterException::class)\n constructor(proto: Protos.UserEmail) : this() {\n email = proto.email\n primary = proto.primary\n verified = proto.verified\n }\n\n @Throws(InvalidProtocolBufferException::class)\n constructor(bytes: ByteArray) : this(Protos.UserEmail.parseFrom(bytes))\n\n constructor(serialized: String) : this(serialized.toByteArray())\n\n fun getProto(): Protos.UserEmail {\n return Protos.UserEmail.newBuilder()\n .setEmail(email)\n .setPrimary(primary)\n .setVerified(verified)\n .build()\n }\n\n fun serialize(): ByteArray {\n return getProto().toByteArray()\n }\n\n override fun toString(): String {\n val primary = if (this.primary) \" (Primary)\" else \"\"\n val verified = if (this.verified) \"Confirmed\" else \"Not confirmed\"\n return \"${this.email}$primary — $verified\"\n }\n\n override fun equals(other: Any?): Boolean {\n if (other is UserEmail) {\n return email == other.email\n }\n return false\n }\n\n override fun hashCode(): Int {\n return email.hashCode()\n }\n}\n" }, { "path": "src/main/kotlin/app/ui/AddRepoState.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.ui\n\nimport app.Logger\nimport app.api.Api\nimport app.config.Configurator\nimport app.model.LocalRepo\nimport app.utils.FileHelper.toPath\nimport app.utils.RepoHelper\nimport app.utils.UiHelper\nimport java.nio.file.Files\nimport java.nio.file.Path\n\n/**\n * Add repository dialog console UI state.\n */\nclass AddRepoState constructor(private val context: Context,\n private val api: Api,\n private val configurator: Configurator)\n : ConsoleState {\n override fun doAction() {\n if (configurator.getLocalRepos().isNotEmpty()) return\n\n while (true) {\n Logger.print(\"\")\n Logger.print(\"Type one or more paths to repository. You can specify \" +\n \"multiple repository paths separated by space on the same line.\")\n Logger.print(\"If you finished specifying repositories, just hit 'Enter' to continue.\")\n val pathsString = readLine() ?: \"\"\n\n if (pathsString.isEmpty()) {\n if (configurator.getLocalRepos().isEmpty()) {\n Logger.print(\"Add at least one valid repository.\")\n } else {\n Logger.print(\"Finished processing git repositories\")\n break // User finished to add repos.\n }\n } else {\n val paths: List = pathsString.split(' ')\n paths.forEach {\n val path = it.toPath()\n if (RepoHelper.isValidRepo(path)) {\n processPath(path)\n } else {\n Files.walk(path)\n .filter { p -> RepoHelper.isValidGitRepo(p) }\n .forEach { p -> processPath(p) }\n }\n }\n }\n }\n\n Logger.info(Logger.Events.CONFIG_SETUP) { \"Config setup\" }\n }\n\n private fun processPath(path: Path) {\n if (RepoHelper.isValidRepo(path)) {\n Logger.print(\"Added git repository at $path.\")\n val localRepo = LocalRepo(path.toString())\n localRepo.hashAllContributors = UiHelper.confirm(\"Do you \"\n + \"want to hash commits of all contributors?\",\n defaultIsYes = true)\n configurator.addLocalRepoPersistent(localRepo)\n configurator.saveToFile()\n Logger.print(\"Successfully processed $path\")\n } else {\n Logger.warn { \"No valid git repository found at specified path $path\" }\n Logger.print(\"Make sure that master branch with at least \" +\n \"one commit exists.\")\n }\n }\n\n override fun next() {\n context.changeState(EmailState(context, api, configurator))\n }\n}\n" }, { "path": "src/main/kotlin/app/ui/AuthState.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.ui\n\nimport app.BuildConfig\nimport app.Logger\nimport app.api.Api\nimport app.config.Configurator\nimport app.utils.PasswordHelper\nimport app.api.ApiError\nimport app.api.ifNotNullThrow\nimport app.api.isWithServerCode\n\n/**\n * Authorization console UI state.\n */\nclass AuthState constructor(private val context: Context,\n private val api: Api,\n private val configurator: Configurator)\n : ConsoleState {\n var username = \"\"\n var password = \"\"\n var retry = true\n var authorized = false\n\n override fun doAction() {\n if (!configurator.isValidCredentials()) {\n getUsername()\n getPassword()\n }\n\n authorized = tryAuth()\n while (!authorized && retry) {\n getPassword()\n authorized = tryAuth()\n }\n }\n\n override fun next() {\n if (authorized) {\n context.changeState(ListRepoState(context, api, configurator))\n } else {\n context.changeState(CloseState())\n }\n }\n\n fun getUsername() {\n Logger.print(\"Enter username:\")\n username = readLine() ?: \"\"\n configurator.setUsernameCurrent(username)\n }\n\n fun getPassword() {\n Logger.print(\"Enter password:\")\n password = PasswordHelper.readPassword()\n configurator.setPasswordCurrent(password)\n }\n\n fun saveCredentialsIfChanged() {\n if (username.isNotEmpty()) {\n configurator.setUsernamePersistent(username)\n }\n if (password.isNotEmpty()) {\n configurator.setPasswordPersistent(password)\n }\n if (username.isNotEmpty() || password.isNotEmpty()) {\n configurator.saveToFile()\n }\n }\n\n fun tryAuth(): Boolean {\n try {\n Logger.print(\"Signing in...\")\n val (_, error) = api.authorize()\n if (error.isWithServerCode(Api.OUT_OF_DATE)) {\n Logger.print(\"App is out of date. Please get new version at \" +\n \"https://sourcerer.io\")\n retry = false\n return false\n }\n // Other request errors should be processed by try/catch.\n error.ifNotNullThrow()\n\n val user = api.getUser().getOrThrow()\n configurator.setUser(user)\n\n Logger.print(\"Signed in successfully. Your profile page is \" +\n BuildConfig.PROFILE_URL + configurator.getUsername())\n\n saveCredentialsIfChanged()\n Logger.username = configurator.getUsername()\n Logger.info(Logger.Events.AUTH) { \"Auth success\" }\n\n return true\n } catch (e: ApiError) {\n if (e.isAuthError) {\n if(e.httpBodyMessage.isNotBlank()) {\n Logger.print(e.httpBodyMessage)\n } else {\n Logger.print(\"Authentication error. Try again.\")\n }\n } else {\n Logger.print(\"Connection problems. Try again later.\")\n Logger.error(e)\n retry = false\n }\n }\n\n return false\n }\n}\n" }, { "path": "src/main/kotlin/app/ui/CloseState.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.ui\n\nimport app.Logger\n\n/**\n * On application close console UI state.\n */\nclass CloseState : ConsoleState {\n override fun doAction() {\n Logger.print(\"You could use console commands to control repositories.\",\n indentLine = true)\n Logger.print(\"For more info run application with flag --help.\")\n // TODO(anatoly): Check for problems for display support message.\n Logger.print(\"Feel free to contact us on any problem by \" +\n \"support@sourcerer.io.\")\n }\n\n override fun next() {\n }\n}\n" }, { "path": "src/main/kotlin/app/ui/ConsoleState.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.ui\n\n/**\n * State pattern interface for console user interface.\n */\ninterface ConsoleState {\n fun doAction()\n fun next()\n}\n" }, { "path": "src/main/kotlin/app/ui/ConsoleUi.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.ui\n\nimport app.api.Api\nimport app.config.Configurator\n\n/**\n * Console user interface.\n */\nclass ConsoleUi(api: Api,\n configurator: Configurator) : Context {\n var state: ConsoleState = OpenState(this, api, configurator)\n\n init {\n changeState(state)\n }\n\n override fun changeState(state: ConsoleState) {\n this.state = state\n state.doAction()\n state.next()\n }\n}\n" }, { "path": "src/main/kotlin/app/ui/Context.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.ui\n\n/**\n * State pattern context.\n */\ninterface Context {\n fun changeState(state: ConsoleState)\n}\n" }, { "path": "src/main/kotlin/app/ui/EmailState.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.ui\n\nimport app.Logger\nimport app.api.Api\nimport app.config.Configurator\nimport app.hashers.CommitCrawler\nimport app.model.LocalRepo\nimport app.model.User\nimport app.model.UserEmail\nimport app.utils.UiHelper\nimport org.eclipse.jgit.api.Git\nimport java.io.File\n\n/**\n * Update repositories console UI state.\n */\nclass EmailState constructor(private val context: Context,\n private val api: Api,\n private val configurator: Configurator)\n : ConsoleState {\n override fun doAction() {\n val user = configurator.getUser()\n\n if (user.emails.isNotEmpty()) {\n Logger.print(\"List of your emails:\", indentLine = true)\n user.emails.forEach { email -> println(email) }\n } else {\n // Shouldn't really happen. User always have primary email.\n Logger.print(\"Add at least one email to build your profile.\",\n indentLine = true)\n }\n\n val knownEmails = user.emails.map { it.email }\n val newEmails = hashSetOf()\n val configEmails = hashSetOf()\n // TODO(anatoly): Tell about web editing emails, when it's ready.\n // TODO(anatoly): Add global config parsing.\n // TODO(anatoly): Add user config parsing.\n\n // Add emails from git configs.\n val reposEmails = hashMapOf>()\n for (repo in configurator.getLocalRepos()) {\n var git: Git? = null\n try {\n git = Git.open(File(repo.path))\n var email = git.repository.config\n .getString(\"user\", null, \"email\") ?: \"\"\n email = email.toLowerCase()\n if (email.isNotEmpty() && !knownEmails.contains(email)) {\n configEmails.add(email)\n }\n // Fetch and save emails from repo for \"no-email\" warning.\n val (_, authors) = CommitCrawler.fetchRehashesAndAuthors(git)\n reposEmails.put(repo, authors.map { it.email }.toHashSet())\n } catch (e: Exception) {\n Logger.error(e, \"Error while parsing repo\")\n } finally {\n if (git != null) {\n git.repository?.close()\n git.close()\n }\n }\n }\n\n if (configEmails.isNotEmpty()) {\n Logger.print(\"Your git config contains untracked emails:\")\n configEmails.forEach { email -> println(email) }\n if (UiHelper.confirm(\"Do you want to add this emails to your \" +\n \"account?\", defaultIsYes = true)) {\n newEmails.addAll(configEmails)\n }\n }\n\n // Show warning if no commits\n val reposUserMissing = mutableListOf()\n for (repo in configurator.getLocalRepos()) {\n val presentedEmails = reposEmails.get(repo)\n val updatedEmails = knownEmails + newEmails\n if (presentedEmails != null) {\n var userMissing = true\n for (email in presentedEmails) {\n if (updatedEmails.contains(email)) {\n userMissing = false\n break\n }\n }\n if (userMissing) {\n reposUserMissing.add(repo)\n }\n }\n }\n if (reposUserMissing.isNotEmpty()) {\n if (reposUserMissing.size == 1) {\n Logger.print(\"${reposUserMissing.first()} repo does not \" +\n \"contains commits from emails you've specified\")\n } else {\n Logger.print(\"Following repos do not contain commits from \" +\n \"emails you've specified:\")\n reposUserMissing.forEach { Logger.print(it) }\n }\n }\n\n // Ask user to enter his emails.\n if (UiHelper.confirm(\"Do you want to specify additional emails \" +\n \"that you use in repositories?\", defaultIsYes = false)) {\n while (true) {\n Logger.print(\"Type a email, or hit Enter to continue.\")\n val email = (readLine() ?: \"\").toLowerCase()\n if (email.isBlank()) break\n if (!knownEmails.contains(email)) newEmails.add(email)\n }\n }\n\n if (newEmails.isNotEmpty()) {\n val newUserEmails = newEmails.map { UserEmail(email = it) }\n // We will need new emails during hashing.\n user.emails.addAll(newUserEmails)\n\n // Send new emails to server.\n val userNewEmails = User(emails = newUserEmails.toHashSet())\n api.postUser(userNewEmails)\n }\n\n // Warn user about need of confirmation.\n if (user.emails.filter { email -> !email.verified }.isNotEmpty() ||\n newEmails.isNotEmpty()) {\n Logger.print(\"Confirm your emails to show all statistics in \" +\n \"profile.\")\n }\n }\n\n override fun next() {\n context.changeState(UpdateRepoState(context, api, configurator))\n }\n}\n" }, { "path": "src/main/kotlin/app/ui/ListRepoState.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.ui\n\nimport app.api.Api\nimport app.config.Configurator\nimport app.utils.RepoHelper\n\n/**\n * List tracked repositories console UI state.\n */\nclass ListRepoState constructor(private val context: Context,\n private val api: Api,\n private val configurator: Configurator)\n : ConsoleState {\n override fun doAction() {\n RepoHelper.printRepos(configurator.getLocalRepos(),\n \"Tracked repositories:\")\n }\n\n override fun next() {\n context.changeState(AddRepoState(context, api, configurator))\n }\n}\n" }, { "path": "src/main/kotlin/app/ui/OpenState.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.ui\n\nimport app.Logger\nimport app.api.Api\nimport app.config.Configurator\n\n/**\n * On application open console UI state.\n */\nclass OpenState constructor(private val context: Context,\n private val api: Api,\n private val configurator: Configurator)\n : ConsoleState {\n override fun doAction() {\n if (!configurator.isValidCredentials()) {\n Logger.print(\"Sourcerer hashes your git repositories into \" +\n \"intelligent engineering profiles.\")\n Logger.print(\"If you don't have an account, please, sign up at \" +\n \"https://sourcerer.io/join\")\n } else {\n Logger.print(\"Sourcerer. Use flag --help to list available \" +\n \"commands.\")\n }\n }\n\n override fun next() {\n context.changeState(AuthState(context, api, configurator))\n }\n}\n" }, { "path": "src/main/kotlin/app/ui/UpdateRepoState.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.ui\n\nimport app.BuildConfig\nimport app.hashers.RepoHasher\nimport app.Logger\nimport app.api.Api\nimport app.config.Configurator\nimport app.model.LocalRepo\nimport app.model.ProcessEntry\nimport app.utils.HashingException\nimport java.util.*\nimport kotlin.concurrent.fixedRateTimer\n\n/**\n * Update repositories console UI state.\n */\nclass UpdateRepoState constructor(private val context: Context,\n private val api: Api,\n private val configurator: Configurator)\n : ConsoleState {\n override fun doAction() {\n Logger.info { \"Hashing started\" }\n\n // TODO(anatoly): Move code to RepoHasher.\n val localRepos = configurator.getLocalRepos()\n assignProcess(localRepos)\n\n val heartbeatTimer = runHeartbeatTimer(localRepos)\n for (repo in localRepos) {\n try {\n Logger.print(\"Hashing $repo repository...\", indentLine = true)\n RepoHasher(api, configurator).update(repo)\n Logger.print(\"Hashing $repo completed.\")\n } catch (e: HashingException) {\n e.errors.forEach { error ->\n Logger.error(error, \"Error while hashing\")\n }\n } catch (e: Throwable) {\n Logger.error(e, \"Error while hashing\")\n }\n }\n heartbeatTimer.cancel()\n\n Logger.print(\"The repositories have been hashed.\")\n Logger.print(\"Take a look at the updates in your profile at \" +\n BuildConfig.PROFILE_URL + configurator.getUsername(),\n indentLine = true)\n Logger.info(Logger.Events.HASHING_SUCCESS) { \"Hashing success\" }\n }\n\n override fun next() {\n context.changeState(CloseState())\n }\n\n // Notify server about processing start and get processing ids.\n private fun assignProcess(localRepos: List) {\n val process = api.postProcessCreate(requestNumEntries = localRepos.size)\n .getOrThrow()\n if (process.entries.isEmpty()) return\n process.entries.subList(0, localRepos.size).forEachIndexed { index, e ->\n localRepos[index].processEntryId = e.id\n }\n }\n\n private fun runHeartbeatTimer(localRepos: List): Timer {\n val entries = localRepos.filter { it.processEntryId != null}\n .map { ProcessEntry(id = it.processEntryId!!) }\n return fixedRateTimer(\n name = \"heartbeat\",\n daemon = true,\n initialDelay = BuildConfig.HEARTBEAT_RATE,\n period = BuildConfig.HEARTBEAT_RATE,\n action = {\n try {\n api.postProcess(entries).onErrorThrow()\n } catch (e: Throwable) {\n Logger.error(e)\n }\n }\n )\n }\n}\n" }, { "path": "src/main/kotlin/app/utils/CommandAdd.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.utils\n\nimport com.beust.jcommander.Parameter\nimport com.beust.jcommander.Parameters\n\n@Parameters(separators = \"=\",\n commandDescription = \"Add a repository to tracking list\")\nclass CommandAdd {\n // Command name for CLI.\n val name = \"add\"\n\n @Parameter(names = arrayOf(\"-r\", \"--recursive\"),\n description = \"Should search recursively in the specified directory\")\n var recursive: Boolean = false\n\n // Path to analyzed repository.\n @Parameter(description = \"REPOPATH\")\n var paths: List = arrayListOf()\n\n // Hash commits of all contributors.\n @Parameter(names = arrayOf(\"-a\", \"--all\"),\n description = \"Hash commits of all contributors.\")\n var hashAll: Boolean = false\n}\n" }, { "path": "src/main/kotlin/app/utils/CommandConfig.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.utils\n\nimport com.beust.jcommander.Parameter\nimport com.beust.jcommander.Parameters\n\n@Parameters(separators = \"=\",\n commandDescription = \"Configure Sourcerer app\")\nclass CommandConfig {\n // Command name for CLI.\n val name = \"config\"\n\n // Key value pair of configurable parameters.\n @Parameter(description = \"KEY VALUE\", arity = 2, order = 0)\n var pair: List = arrayListOf()\n}\n" }, { "path": "src/main/kotlin/app/utils/CommandList.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.utils\n\nimport com.beust.jcommander.Parameters\n\n@Parameters(separators = \"=\",\n commandDescription = \"List tracked repositories\")\nclass CommandList {\n // Command name for CLI.\n val name = \"list\"\n}\n" }, { "path": "src/main/kotlin/app/utils/CommandRemove.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.utils\n\nimport com.beust.jcommander.Parameter\nimport com.beust.jcommander.Parameters\n\n@Parameters(separators = \"=\",\n commandDescription = \"Remove a repository from tracking list\")\nclass CommandRemove {\n // Command name for CLI.\n val name = \"remove\"\n\n // Path to analyzed repository.\n @Parameter(description = \"REPOPATH\")\n var path: String? = null\n}\n" }, { "path": "src/main/kotlin/app/utils/FileHelper.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.utils\n\nimport java.io.File\nimport java.net.URLDecoder\nimport java.nio.file.Files\nimport java.nio.file.Paths\nimport java.nio.file.Path\n\n/*\n * Wrapper around Java Path and File classes to work the sourcerer's files.\n */\nobject FileHelper {\n private val dirName = \"data\"\n private val jarPath = getJarPath()\n private val settingsPath = jarPath.resolve(dirName)\n\n private val specificExts = listOf(\".min.js\")\n\n fun getPath(name: String, vararg parts: String): Path {\n val path = settingsPath.resolve(Paths.get(\"\", *parts))\n if (Files.notExists(path)) {\n Files.createDirectories(path)\n }\n return path.resolve(name)\n }\n\n fun getFile(name: String, vararg parts: String): File {\n return getPath(name, *parts).toFile()\n }\n\n fun notExists(name:String, vararg parts: String): Boolean {\n return Files.notExists(getPath(name, *parts))\n }\n\n fun getFileExtension(path: String): String {\n val fileName = Paths.get(path).fileName.toString().toLowerCase()\n for (ext in specificExts) {\n if (fileName.endsWith(ext)) {\n return ext\n }\n }\n return fileName.substringAfterLast(delimiter = '.',\n missingDelimiterValue = \"\")\n }\n\n fun getJarPath(): Path {\n val fullPathURI = FileHelper::class.java.protectionDomain.\n codeSource.location.toURI()\n val fullPath = Paths.get(fullPathURI)\n val root = fullPath.root\n // Removing jar filename.\n return root.resolve(fullPath.subpath(0, fullPath.nameCount - 1))\n }\n\n fun String.toPath(): Path {\n val substitutePath = if (this.startsWith(\"~\" + File.separator)) {\n System.getProperty(\"user.home\") + this.substring(1)\n } else { this }\n return Paths.get(substitutePath).toAbsolutePath().normalize()\n }\n}\n" }, { "path": "src/main/kotlin/app/utils/HashingException.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.utils\n\nclass HashingException(val errors: List) : Exception()\n\nclass EmptyRepoException(message: String) : Exception(message)\n" }, { "path": "src/main/kotlin/app/utils/Metrics.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Alexander Surkov (alex@sourcerer.io)\n\npackage app.utils\n\nimport kotlin.system.*\n\nobject Metrics {\n override fun toString(): String {\n var str: String = \"\"\n\n var total: Long = 0\n for ((_, item) in timing.items) {\n total += item.time\n }\n\n str += timing.toStringHelper(total)\n\n for ((tag, value) in numerical) {\n str += \"$tag: $value\\n\"\n }\n\n return str\n }\n\n fun recordTime(tag: String, block: () -> T) : T {\n val parentItem = timingStack.get(timingStack.lastIndex)\n var item = parentItem.items.getOrPut(tag, { TimingData() })\n\n timingStack.add(item)\n\n val start = System.currentTimeMillis()\n val result = block()\n item.time += System.currentTimeMillis() - start\n\n timingStack.subList(timingStack.lastIndex, timingStack.lastIndex + 1).clear()\n\n return result\n }\n\n fun recordMetric(tag: String, metric: Long)\n {\n var v = numerical.getOrDefault(tag, 0)\n numerical.put(tag, v + metric);\n }\n\n class TimingData {\n var time: Long = 0\n var items = mutableMapOf()\n\n fun toStringHelper(total: Long, offset: String = \"\"): String {\n var str = \"\"\n for ((tag, item) in items) {\n str += \"$offset$tag: ${item.time} ms, ${item.time * 100 / total}%\\n\"\n str += item.toStringHelper(total, \"$offset \")\n }\n return str\n }\n }\n\n private val timing = TimingData()\n private val timingStack = mutableListOf(timing)\n private var nestedTiming: Boolean = true\n\n private val numerical = mutableMapOf()\n}\n\n/**\n * Records a block's execution time in milliseconds and assigns it a tag in\n * calls hierarchy.\n */\nfun recordTime(tag: String, block: () -> T) : T {\n return Metrics.recordTime(tag, block)\n}\n\n/**\n * Records a numeric metric of given tag.\n */\nfun recordMetric(tag: String, metric: Long)\n{\n return Metrics.recordMetric(tag, metric)\n}\n" }, { "path": "src/main/kotlin/app/utils/Misc.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.utils\n\n// TODO(anatoly): Replace with chunked from new Kotlin version.\n// SO #34498368 @ Jayson Minard.\nfun Sequence.batch(n: Int): Sequence> {\n return BatchingSequence(this, n)\n}\n\nclass BatchingSequence(val source: Sequence,\n val batchSize: Int) : Sequence> {\n override fun iterator(): Iterator> = object :\n AbstractIterator>() {\n val iterate = if (batchSize > 0) source.iterator() else\n emptyList().iterator()\n override fun computeNext() {\n if (iterate.hasNext()) setNext(iterate.asSequence()\n .take(batchSize).toList())\n else done()\n }\n }\n}\n" }, { "path": "src/main/kotlin/app/utils/Options.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.utils\n\nimport com.beust.jcommander.Parameter\n\nclass Options {\n // Sourcerer account username.\n @Parameter(names = arrayOf(\"-u\", \"--username\"),\n description = \"Sourcerer account username\",\n order = 0)\n var username: String = \"\"\n\n // Sourcerer account password.\n @Parameter(names = arrayOf(\"-p\", \"--password\"),\n description = \"Sourcerer account password\",\n order = 1)\n var password: String = \"\"\n\n // List options and commands.\n @Parameter(names = arrayOf(\"-h\", \"--help\"),\n description = \"List options and commands\",\n order = 2)\n var help: Boolean = false\n\n // Cleanup configs and run setup again.\n @Parameter(names = arrayOf(\"--setup\"),\n description = \"Cleanup configs and run setup again\",\n order = 3)\n var setup: Boolean = false\n\n // Uninstall. Runs by install script, added to display info in help.\n @Parameter(names = arrayOf(\"--uninstall\"),\n description = \"Remove Sourcerer App\",\n order = 4)\n var uninstall: Boolean = false\n}\n" }, { "path": "src/main/kotlin/app/utils/PasswordHelper.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.utils\n\nimport org.apache.commons.codec.digest.DigestUtils\nimport java.io.IOError\n\n/**\n * Class for hashing and reading passwords.\n */\nobject PasswordHelper {\n fun hashPassword(password: String): String {\n return if (password.isEmpty()) {\n \"\"\n }\n else {\n DigestUtils.sha256Hex(password)\n }\n }\n\n fun readPassword(): String {\n val password: String\n val console = System.console()\n if (console != null) {\n password = try {\n System.console().readPassword().joinToString(\"\")\n } catch (e: IOError) {\n \"\"\n }\n } else {\n password = readLine() ?: \"\"\n }\n\n return password\n }\n}\n" }, { "path": "src/main/kotlin/app/utils/RepoHelper.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.utils\n\nimport app.Logger\nimport app.hashers.CommitCrawler\nimport app.model.LocalRepo\nimport org.apache.commons.codec.digest.DigestUtils\nimport org.eclipse.jgit.api.Git\nimport org.eclipse.jgit.lib.ObjectId\nimport org.eclipse.jgit.lib.Repository\nimport java.io.File\nimport java.nio.file.Files\nimport java.nio.file.InvalidPathException\nimport java.nio.file.Path\nimport java.nio.file.Paths\n\n/**\n * Class for utility functions on repos.\n */\nobject RepoHelper {\n fun isValidRepo(path: Path): Boolean {\n if (!isDirectory(path)) {\n return false\n }\n\n var git: Git? = null\n var repository: Repository? = null\n val commitId: ObjectId?\n try {\n git = Git.open(path.toFile())\n repository = git.repository\n commitId = CommitCrawler.getDefaultBranchHead(git)\n } catch (e: Exception) {\n Logger.error(e, \"Cannot access repository at specified path\")\n return false\n } finally {\n repository?.close()\n git?.close()\n }\n\n if (commitId != null) {\n return true\n }\n return false\n }\n\n fun isDirectory(path: Path): Boolean {\n return try {\n path.toFile().isDirectory\n } catch (e: InvalidPathException) {\n Logger.error(e, \"Invalid path\")\n false\n } catch (e: UnsupportedOperationException) {\n Logger.error(e, \"Invalid path\")\n false\n } catch (e: SecurityException) {\n Logger.error(e, \"Cannot access repository at specified path\")\n false\n }\n }\n\n fun isValidGitRepo(p: Path) = (Files.isDirectory(p)\n && p.fileName.toString().equals(\".git\", ignoreCase = true))\n\n /* To identify and distinguish different repos we calculate its rehash.\n Repos may have forks. Such repos should be tracked independently.\n Therefore, rehash of repo calculated by values of:\n - Rehash of initial commit;\n - Hash of remote origin;\n - If remote origin not presented: repo local path and username.\n To associate forked repos with primary repo rehash of initial commit\n stored separately too. */\n fun calculateRepoRehash(initialCommitRehash: String,\n localRepo: LocalRepo): String {\n val username = try { System.getProperty(\"user.name\") }\n catch (e: Exception) { \"\" }\n\n var repoRehash = initialCommitRehash\n if (localRepo.remoteOrigin.isNotBlank()) {\n repoRehash += localRepo.remoteOrigin\n } else {\n repoRehash += localRepo.path + username\n }\n\n return DigestUtils.sha256Hex(repoRehash)\n }\n\n fun printRepos(localRepos: List)\n {\n for (repo in localRepos) {\n Logger.print(repo)\n }\n }\n\n fun printRepos(localRepos: List, title: String) {\n if (localRepos.isNotEmpty()) {\n Logger.print(title, indentLine = true)\n printRepos(localRepos)\n }\n }\n\n fun printRepos(localRepos: List, title: String, empty: String) {\n if (localRepos.isNotEmpty()) {\n Logger.print(title, indentLine = true)\n printRepos(localRepos)\n } else {\n Logger.print(empty, indentLine = true)\n }\n }\n}\n" }, { "path": "src/main/kotlin/app/utils/RequestException.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.utils\n\nimport com.github.kittinunf.fuel.core.FuelError\nimport com.google.protobuf.InvalidProtocolBufferException\nimport java.nio.charset.Charset\nimport java.security.InvalidParameterException\n\nclass RequestException(exception: Exception) : Exception(exception.message) {\n private val AUTH_ERROR_CODES = listOf(401, 403)\n\n var httpStatusCode: Int = 0\n var httpResponseMessage: String = \"\"\n var httpBodyMessage: String = \"\"\n\n var isAuthError: Boolean = false\n get() = AUTH_ERROR_CODES.contains(httpStatusCode)\n\n var isParseError = false\n\n constructor(fuelError: FuelError) : this(fuelError as Exception) {\n httpStatusCode = fuelError.response.statusCode\n httpResponseMessage = fuelError.response.responseMessage\n httpBodyMessage = fuelError.response.data\n .toString(Charset.defaultCharset())\n }\n\n constructor(parseException: InvalidProtocolBufferException) :\n this(parseException as Exception) {\n isParseError = true\n }\n\n constructor(parseException: InvalidParameterException) :\n this(parseException as Exception) {\n isParseError = true\n }\n}\n" }, { "path": "src/main/kotlin/app/utils/UiHelper.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage app.utils\n\nimport app.Logger\n\nobject UiHelper {\n fun confirm(message: String, defaultIsYes: Boolean): Boolean {\n val yes = if (defaultIsYes) \"Y\" else \"y\"\n val no = if (!defaultIsYes) \"N\" else \"n\"\n Logger.print(\"$message [$yes/$no]\")\n val oppositeDefaultValue = if (defaultIsYes) no else yes\n if ((readLine() ?: \"\").toLowerCase() == oppositeDefaultValue) {\n return !defaultIsYes\n }\n return defaultIsYes\n }\n}\n" }, { "path": "src/main/proto/classifier.proto", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\nsyntax = \"proto3\";\n\n// Java compiler settings.\npackage app;\noption java_package = \"app\";\noption java_outer_classname = \"ClassifierProtos\";\n\nmessage Classifier {\n repeated string tokens = 1;\n repeated string libraries = 2;\n repeated float idf = 3;\n repeated float weights = 4;\n repeated float biases = 5;\n}\n\nmessage Library {\n string id = 1;\n repeated string imports = 2;\n int32 version = 3;\n}\n\nmessage Language {\n string id = 1;\n repeated Library libraries = 2;\n}\n\nmessage LibrariesMeta {\n repeated Language languages = 1;\n}\n" }, { "path": "src/main/proto/sourcerer.proto", "content": "// Copyright 2017 Sourcerer, Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n\nsyntax = \"proto3\";\n\n// Java compiler settings.\npackage app;\noption java_package = \"app\";\noption java_outer_classname = \"Protos\";\n\n// Commit.\nmessage Commit {\n // Re-hash of hash of a commit.\n string rehash = 1;\n\n // Hash of repo.\n string repo_rehash = 2;\n\n // Re-hash of hash of tree object of a commit.\n string tree_rehash = 3;\n\n // Information about author of a commit.\n string author_name = 4;\n string author_email = 5;\n\n // Timestamp of a commit creation in seconds UTC+0.\n uint64 date = 6;\n\n // Is quality commit.\n bool is_qommit = 7;\n\n // Number of lines for a whole commit.\n int32 num_lines_added = 8;\n int32 num_lines_deleted = 9;\n\n // Tech stats on a commit.\n repeated CommitStats stats = 10;\n}\n\n// Tech stats on a commit.\nmessage CommitStats {\n // Number of lines for a specific technology.\n int32 num_lines_added = 1;\n int32 num_lines_deleted = 2;\n\n // Technology type (language/framework/library).\n int32 type = 3;\n\n // Technology name.\n string tech = 4;\n}\n\n// Used to send multiple commits in one request.\nmessage CommitGroup {\n repeated Commit commits = 1;\n}\n\n// Key-value statistics for fun facts.\nmessage Fact {\n int32 code = 1;\n int32 key = 2;\n string value1 = 3;\n string value2 = 4;\n string value3 = 5;\n string value4 = 6;\n string email = 7;\n string repo_rehash = 8;\n}\n\n// Used to send multiple stats in one request.\nmessage FactGroup {\n repeated Fact facts = 1;\n}\n\n// Used to authors for invitational procedures.\nmessage Author {\n string email = 1;\n string name = 3;\n string repo_rehash = 2;\n}\n\nmessage AuthorGroup {\n repeated Author authors = 1;\n}\n\n// User properties and indentity information about repos.\nmessage User {\n // List of known repos containing basic information for indentifying repo.\n repeated Repo repos = 1;\n // List of known emails.\n repeated UserEmail emails = 2;\n}\n\n// Email of user with its status information.\nmessage UserEmail {\n string email = 1;\n bool primary = 2;\n bool verified = 3;\n}\n\n// Repository parameters for hashing.\nmessage Repo {\n // Repository rehash according to initial commit rehash, remote and user\n // handle if no remote presented.\n string rehash = 1;\n\n // Rehash of first commit in repo. Used for indentifying forks.\n string initial_commit_rehash = 2;\n\n // Authors' email filter for hashed commits. If empty list then hash only\n // commits that created by current user.\n repeated string emails = 4;\n\n // Raw commits server history. Used to find overlap of commits. Hashing\n // starts after last commit from the overlap.\n repeated Commit commits = 5;\n\n // Meta info about repo. Is not used for a locally run app.\n RepoMeta meta = 6;\n\n // Processing session id, used to check the processing status.\n uint32 process_entry_id = 7;\n}\n\n// Meta info about repo. Is not used for a locally run app.\nmessage RepoMeta {\n string hosterId = 1;\n string service = 6;\n string name = 2;\n string ownerName = 3;\n string description = 7;\n string htmlUrl = 4;\n string cloneUrl = 5;\n}\n\n// Errors from server.\nmessage Error {\n uint32 code = 1;\n string message = 2;\n}\n\nmessage Errors {\n repeated Error errors = 1;\n}\n\n// Status of processing.\nmessage Process {\n uint32 id = 1;\n repeated ProcessEntry entries = 4;\n uint32 request_num_entries = 5;\n}\n\nmessage ProcessEntry {\n uint32 id = 1;\n uint32 status = 2;\n uint32 error_code = 3;\n}\n\nmessage AuthorDistance {\n string email = 1;\n double score = 2;\n string repo_rehash = 3;\n}\n\nmessage AuthorDistanceGroup {\n repeated AuthorDistance author_distances = 1;\n}\n" }, { "path": "src/main/resources/data/imports/cpp.txt", "content": "opencv:opencv\nopencv2:opencv\nprotobuf:protobuf\npb:protobuf" }, { "path": "src/main/resources/data/imports/python.txt", "content": "cv2:opencv\ncv:opencv" }, { "path": "src/main/resources/data/libraries/cs_libraries.txt", "content": "Dapper\nMicrosoft.AspNet.SignalR\nNancy\nMicrosoft.EntityFrameworkCore\nAutoMapper\nNewtonsoft.Json\nMicrosoft.AspNetCore.Mvc\nRestSharp\nMicrosoft.Xna.Framework\nOpenRA\nMicrosoft.Bot\nServiceStack\nPushSharp\nCefSharp\nMaterialDesign*\nReactiveUI\nAbp\nOrleans\nHangfire\nHumanizer\nPolly\nNLog\nFluentValidation\nAvalonia\nAkka\nStackExchange.Redis\nSenparc\nBenchmarkDotNet\nMvvmCross\nEventStore\nSystem.Reactive\nAccord\nQuartz\nIdentityServer3\nMoq\nSwashbuckle\nNinject\nRefit\nStateless\nImageProcessor\nPrism\nMongoDB.Driver\nLanguageExt\nMassive\nLiteDB" }, { "path": "src/main/resources/data/libraries/java_libraries.txt", "content": "io.reactivex\nretrofit2\nokhttp3\ncom.google.common\nbutterknife\ncom.github.mikephil.charting\ncom.bumptech.glide\ncom.squareup.leakcanary\norg.springframework\norg.greenrobot.eventbus\ncom.nostra13.universalimageloader\norg.springframework.boot\ncom.airbnb.lottie\ncom.google.zxing\ncom.squareup.picasso\nio.reactivex\ncom.facebook.fresco\ncom.blankj.utilcode\ncom.badlogic.gdx\ncom.github.chrisbanes.photoview\nio.netty\ncom.afollestad.material-dialogs\ncom.netflix.hystrix\ncom.jeremyfeinstein.slidingmenu\ncom.alibaba.dubbo\ncom.alibaba.fastjson\ncom.loopj.android.http\ncom.tencent.tinker\norg.androidannotations\ncom.viewpagerindicator\ncom.chad.library\ncom.daimajia.swipelayout\norg.greenrobot.greendao\ncom.gc.materialdesign\ncom.handmark.pulltorefresh\ncom.facebook.stetho\nio.realm\ncom.alibaba.druid\ncom.orhanobut.logger\norg.deeplearning4j\ncom.google.android.agera\nspark\nio.vertx\ncom.airbnb.android.react.lottie\nzipkin\ncom.facebook.presto\ndagger\norg.junit\ncom.lmax.disruptor\ncom.jakewharton.rxbinding2\norg.physical_web\norg.apache.kafka\ncom.google.inject\ncom.google.auto\nio.druid\norg.mockito\ncom.zaxxer.hikari\ncom.codahale.metrics\nus.codecraft.webmagic\ncom.squareup.otto\nokio\norg.apache.hadoop\nopennlp\norg.apache.velocity\nfreemarker\ncom.google.gwt\norg.hamcrest\norg.hornetq\norg.eclipse.hudson\norg.quartz\ngnu.trove\norg.dozer\ncom.googlecode.jmapper\norg.mapstruct\norg.modelmapper\nma.glasnost.orika\nfr.xebia.extras.selma\nnet.sf.cglib\ncom.github.benmanes.caffeine\ncom.github.sviperll.adt4j\ncom.google.auto.common\norg.inferred.freebuilder\ncom.squareup.javapoet\nio.airlift.airline\ncom.typesafe.config\ninfo.macias.kaconf\norg.aeonbits.owner\norg.jacop\norg.apache.commons.csv\ncom.fasterxml.jackson.dataformat.csv\ncom.univocity.parsers\nnet.openhft.chronicle\norg.exist\ncom.vladmihalcea.flexypool\ncom.zaxxer.hikari\nredis.clients.jedis\nio.searchbox\ncom.justinsb.etcd\norg.jinq\nch.vorburger.mariadb4j\ncom.facebook.presto\nio.realm\norg.redisson\nio.requery\ncom.speedment\norg.apache.avro\ncom.leansoft.bigqueue\ncom.google.protobuf\nuk.co.real_logic.sbe\ncom.squareup.tape2\ncom.squareup.wire\ncom.hypotemoose.cal\nnet.fortuna.ical4j\norg.joda.time\norg.threeten.bp\nnet.time4j\norg.codejargon.feather\ncom.netflix.governator\ncom.google.inject\norg.zalando.fauxpas\norg.hotswap.agent\ncom.github.javaparser\ncom.github.javaparser.symbolsolver\norg.springsource\ncom.github.mtakaki.dropwizard.circuitbreaker\nnet.jodah.failsafe\ncom.netflix.hystrix\nio.github.resilience4j\ncom.netflix.zuul\ncom.badlogicgames.packr\norg.skife.waffles\njanala\ncom.aol.cyclops\norg.derive4j\norg.jooq.lambda\ncom.codepoetics.protonpack\none.util.streamex\ncom.github.davidmoten.geo\ncom.graphhopper\norg.mapsforge\norg.locationtech.spatial4j\norg.agrona\norg.eclipse.collections\norg.jctools\ncom.koloboke\norg.asynchttpclient\nfeign\nrestql.core\ncom.netflix.ribbon\norg.zalando.riptide\ncom.github.jsonldjava\ncom.google.code.siren4j\norg.imgscalr\nnet.sourceforge.tess4j\nnet.coobird.thumbnailator\ncom.twelvemonkeys\ncom.google.zxing\ncom.google.gson\ncom.zaxxer.hikari.json\norg.zalando.jackson.datatype.money\ncom.cedarsoftware.util.io\ncom.bluelinelabs.logansquare\ncom.squareup.moshi\ncom.alibaba.fastjson\ncom.bazaarvoice.jolt\ncom.jayway.jsonpath\norg.jsfr.json\norg.zalando.logbook\norg.zalando.tracer\njsat\ncom.cloudera.oryx\nio.aeron\nzmq\norg.zalando.nakadi\norg.jivesoftware.smack\ncom.googlecode.cqengine\nnet.jodah.failsafe\nio.github.resilience4j.circuitbreaker\nme.ramswaroop.jbot\ncom.google.common.jimfs\ncom.googlecode.lanterna\nnet.jodah.typetools\ncom.ecwid.consul.v1\ncom.netflix.eureka\norg.automon\nnet.bull.javamelody\ncom.googlecode.jmxtrans\nnudge4j\ncom.navercorp.pinpoint\norg.stagemonitor\ncom.palantir.opensource.sysmon\norg.bytedeco.javacpp\ncom.sun.jna\njnr.ffi\nedu.illinois.cs.cogcomp\ncomsat\ncom.twitter.finagle\nio.grpc\ncom.facebook.nifty\nde.slub.urn\norg.simpleflatmapper\norg.xhtmlrenderer\ncom.networknt\norg.orienteer\norg.reactivestreams\nio.reactivex\ncom.linkedin.restli\norg.restexpress\norg.restlet\ncom.hendrix.erdos\norg.graphstream\norg.jgrapht\ncom.mxgraph\nedu.mines.jtk\ntech.tablesaw\norg.hdiv\nio.jsonwebtoken\norg.keyczar\nme.gosimple.nbvcxz\norg.pac4j\ncom.google.flatbuffers\norg.nustaq.serialization\ncom.esotericsoftware.kryo\norg.msgpack\norg.nanohttpd\ncom.tngtech.archunit\norg.awaitility\ncom.squareup.burst\nnet.jodah.concurrentunit\ncucumber\nlv.ctco.cukes\nbr.com.six2six.fixturefactory\ncom.galenframework\nj8spec\nio.codearte.jfairy\ncom.tngtech.java.junit.dataprovider\ncom.insightfullogic.lambdabehave\norg.mockito\ncom.github.dreamhead.moco\norg.mutabilitydetector\norg.powermock\nguru.nidi.ramltester\ncom.carrotsearch.randomizedtesting\nio.restassured\norg.spockframework\norg.testcontainers\ncom.google.common.truth\ncom.dexvis.dex\norg.gephi\ncom.google.common\nru.lanwen.verbalregex\nio.minio\ncom.github.underscore\nedu.uci.ics.crawler4j\ncom.blade" }, { "path": "src/main/resources/data/libraries/js_libraries.txt", "content": "react\nd3\nvue\nsvelte\nangular\njquery\nmeteor\nsocketio\nthree\nexpress\nredux\nmoment\nmaterial-ui\njquery-file-upload\nlodash\naxios\nreact-router\nasync\nunderscore\nfullpage\nimmutable\npdf\nember\nkoa\nrequest\npostcss\nangular\nmaterial\nfetch\npjax\npug\nless\nbootstrap\nflux\nq\nmongoose\nmocha\nhandlebars\nriot\ntesseract\npassport\nbrowserify\nmustache\nsequelize\nreact-bootstrap\njquery-ui\njquery-mobile\nmysql\ndatepicker\nsmartcrop\nnormalizr\nvuex\nreact-redux\nknockout\nwtf\njquery-cookie\nredis\nwinston\nvalidate\ngql\ngraphql\nuglify\nhttp-proxy\npurify\nng-file-upload" }, { "path": "src/main/resources/data/libraries/kotlin_libraries.txt", "content": "com.winterbe.expekt\ncom.github.vassilibykov.adventkt\nme.lazmaid.kraph\ncom.github.kittinunf.fuel\nimgui\norg.mapdb\nuy.kohesive.kovert\nio.reactivex.rxkotlin\ncom.compass.snail\nio.kweb\ncom.github.andrewoma.kwery\ncom.github.pgutkowski.kgraphql\nio.vertx\norg.spekframework.spek2\ncom.oneeyedmen.konsent\ncom.github.salomonbrys.kotson\norg.jire.kton\nio.kotlintest\nktx\norg.kotlinprimavera\norg.kottpd\ncom.almasb.fxgl\norg.wasabifx.wasabi\ncom.fboldog.ext4klaxon\nnet.yested\nua.com.lavi.komock\nkotlinx.nosql\nspark\ncom.github.kittinunf.result\ncom.nivabit.kuery\nio.thelandscape.krawler\nio.tekniq\ncom.beust.klaxon\ncom.github.shyiko.levelkt\nio.javalin\nkategory\ntornadofx\nkotliquery\nkhttp\novr\ncom.hexagonkt\ncom.nhaarman.mockito_kotlin\nio.ktor\ncom.codepoetics.klenses\nio.polymorphicpanda.kspec\ncom.natpryce.hamkrest\norg.http4k\ncom.vaadin\nio.mockk\nkara\norg.funktionale\ncom.github.fluidsonic.fluid.json\ncom.squareup.sqldelight\norg.amshove.kluent\ncom.danneu.kog\norg.jetbrains.exposed" }, { "path": "src/test/delete_repo.sh", "content": "for REPO_PATH in tmp_repo original_repo forked_repo; do \n rm -rf $REPO_PATH\ndone\n" }, { "path": "src/test/kotlin/test/tests/extractors/DirToLangMap.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Alexander Surkov (alex@sourcerer.io)\n\npackage test.tests.extractors\n\n// Special cases, when language code name is not a dir name in lower case.\nval dirToLangMap = mapOf(\n \"DOS Batch\" to \"dosbatch\",\n \"C#\" to \"csharp\",\n \"C++\" to \"cpp\",\n \"Common Lisp\" to \"lisp\",\n \"F#\" to \"fsharp\",\n \"Filebench WML\" to \"filebench_wml\",\n \"Objective-C\" to \"objectivec\",\n \"Perl 6\" to \"perl6\",\n \"POV-Ray SDL\" to \"pov-ray_sdl\",\n \"Ren'Py\" to \"renpy\",\n \"Visual Basic\" to \"visualbasic\",\n \"Wolfram Language\" to \"wolframlanguage\",\n \"DM\" to \"dm\"\n)\n" }, { "path": "src/test/kotlin/test/tests/extractors/ExtractorTest.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage test.tests.extractors\n\nimport app.extractors.*\nimport junit.framework.TestCase.assertTrue\nimport org.jetbrains.spek.api.Spek\nimport org.jetbrains.spek.api.dsl.given\nimport org.jetbrains.spek.api.dsl.it\nimport org.jetbrains.spek.api.dsl.xit\nimport kotlin.test.assertEquals\nimport kotlin.test.assertNull\n\nfun assertExtractsLineLibraries(expectedLibrary: String, actualLine: String,\n extractor: ExtractorInterface) {\n val actualLineLibraries =\n extractor.determineLibs(actualLine, listOf(expectedLibrary))\n assertTrue(expectedLibrary in actualLineLibraries)\n}\n\nfun assertExtractsNoLibraries(actualLine: String,\n extractor: ExtractorInterface) {\n val actualLineLibraries =\n extractor.determineLibs(actualLine, listOf())\n assertEquals(listOf(), actualLineLibraries)\n}\n\nfun assertExtractsImport(expectedImport: String, actualLine: String,\n extractor: ExtractorInterface) {\n val actualLineImport = extractor.extractImports(listOf(actualLine))\n assertTrue(expectedImport in actualLineImport)\n}\n\nfun assertMapsIndex(expectedIndex: String, actualImport: String,\n language: String, extractor: ExtractorInterface) {\n val actualIndex = extractor.mapImportToIndex(actualImport, language)\n assertEquals(expectedIndex, actualIndex)\n}\n\nfun assertMapsNothing(actualImport: String, language: String,\n extractor: ExtractorInterface) {\n val actualIndex = extractor.mapImportToIndex(actualImport, language)\n assertNull(actualIndex)\n}\n\nclass ExtractorTest : Spek({\n given(\" code line contains library code\" ) {\n it(\"python extractor extracts the library\") {\n val line = \"with tf.Session() as sess\"\n assertExtractsLineLibraries(\"py.tensorflow\",\n line, PythonExtractor())\n }\n\n it(\"java extractor extracts the library\") {\n val line = \"Parcelable wrapped = Parcels.wrap(new Example(\\\"Andy\\\", 42));\"\n assertExtractsLineLibraries(\"java.parceler\",\n line, JavaExtractor())\n }\n\n it(\"javascript extractor extracts the library\") {\n val line = \"new Vue({\"\n assertExtractsLineLibraries(\"js.vue\",\n line, JavascriptExtractor())\n }\n\n it(\"typescript extractor extracts the library\") {\n val line = \"new Vue({\"\n assertExtractsLineLibraries(\"js.vue\",\n line, TypescriptExtractor())\n }\n\n it(\"ruby extractor extracts the library\") {\n val line1 = \"img = Magick::Image.read_inline(Base64.encode64(image)).first\"\n assertExtractsLineLibraries(\"rb.rmagick\",\n line1, RubyExtractor())\n val line2 = \"fximages << {image: img.adaptive_threshold(3, 3, 0), name: \\\"Adaptive Threshold\\\"}\"\n assertExtractsLineLibraries(\"rb.rmagick\",\n line2, RubyExtractor())\n }\n\n it(\"go extractor extracts the library\") {\n val line = \"if DB, found = revel.Config.String(\\\"bloggo.db\\\"); !found {\"\n assertExtractsLineLibraries(\"go.revel\",\n line, GoExtractor())\n }\n\n it(\"objectiveC extractor extracts the library\") {\n val line = \"[[NSFileManager defaultManager] removeItemAtURL:[RLMRealmConfiguration defaultConfiguration].fileURL error:nil];\"\n assertExtractsLineLibraries(\"objc.realm\",\n line, ObjectiveCExtractor())\n }\n\n it(\"cpp extractor extracts the library\") {\n val line1 = \"leveldb::Options options;\"\n assertExtractsLineLibraries(\"cpp.level-db\",\n line1, CppExtractor())\n val line2 = \"leveldb::Status status = leveldb::DB::Open(options, \\\"./testdb\\\", &tmp);\"\n assertExtractsLineLibraries(\"cpp.level-db\",\n line2, CppExtractor())\n }\n\n it(\"csharp extractor extracts the library\") {\n val line = \"Algorithm = (h, v, i) => new ContrastiveDivergenceLearning(h, v)\"\n assertExtractsLineLibraries(\"cs.accord-net\",\n line, CSharpExtractor())\n }\n\n it(\"fsharp extractor extracts the library\") {\n val line = \"Algorithm = fun (h, v, i) -> ContrastiveDivergenceLearning(h, v)\"\n assertExtractsLineLibraries(\"cs.accord-net\",\n line, FSharpExtractor())\n }\n\n it(\"php extractor extracts the library\") {\n val line = \"public function listRepos(string \\$user, int \\$limit): Call;\"\n assertExtractsLineLibraries(\"php.retrofit-php\",\n line, PhpExtractor())\n }\n\n xit(\"c extractor extracts the library\") {\n val line = \"grpc_test_init(argc, argv);\"\n assertExtractsLineLibraries(\"c.grpc\",\n line, CExtractor())\n }\n\n it(\"kotlin extractor extracts the library\") {\n val line = \"FuelManager.instance.apply {\"\n assertExtractsLineLibraries(\"kt.fuel\",\n line, KotlinExtractor())\n }\n\n it(\"ruby extractor extracts rails\") {\n val line = \"class Article < ActiveRecord::Base\"\n assertExtractsLineLibraries(\"rb.rails\",\n line, RubyExtractor())\n }\n }\n\n given(\"code line doesn't use libraries\" ) {\n it(\"python extractor returns empty list\") {\n val line = \"from collections import Counter\"\n assertExtractsNoLibraries(line, PythonExtractor())\n }\n\n it(\"java extractor returns empty list\") {\n val line = \"throw new RuntimeException(e);\"\n assertExtractsNoLibraries(line, JavaExtractor())\n }\n\n it(\"javascript extractor returns empty list\") {\n val line = \"console.log(self.commits[0].html_url)\"\n assertExtractsNoLibraries(line, JavascriptExtractor())\n }\n\n it(\"ruby extractor returns empty list\") {\n val line = \"require \\\"RMagick\\\"\"\n assertExtractsNoLibraries(line, RubyExtractor())\n }\n\n it(\"go extractor returns empty list\") {\n val line = \"var found bool\"\n assertExtractsNoLibraries(line, GoExtractor())\n }\n\n it(\"objectivec extractor returns empty list\") {\n val line = \"@end\"\n assertExtractsNoLibraries(line, ObjectiveCExtractor())\n }\n\n it(\"php extractor returns empty list\") {\n val line = \"\"\n val extractor = CppExtractor()\n assertExtractsImport(import, line, extractor)\n val actualImport = extractor.extractImports(listOf(line))[0]\n assertMapsIndex(lib, actualImport, Lang.CPP, extractor)\n }\n }\n\n given(\"Crystal\") {\n it(\"Crystal require\") {\n var line = \"require \\\"kemal\\\"\"\n assertExtractsImport(\"kemal\", line, CrystalExtractor())\n }\n\n it(\"Crystal include\") {\n var line = \" include JSON::Serializable\"\n assertExtractsImport(\"json\", line, CrystalExtractor())\n }\n\n it(\"Crystal comment\") {\n var lines = listOf(\"# include JSON::Serializable\")\n val extractor = CrystalExtractor()\n var actualLineImports = extractor.extractImports(lines)\n actualLineImports.forEach {\n assertMapsNothing(it, Lang.CRYSTAL, extractor)\n }\n }\n }\n\n given(\"Elixir\") {\n it(\"Elixir comment\") {\n var lines = listOf(\"# use Ecto.Repo\")\n var actualLineImports = ElixirExtractor.extractImports(lines)\n actualLineImports.forEach {\n assertMapsNothing(it, Lang.ELIXIR, ElixirExtractor)\n }\n }\n it(\"Elixir use\") {\n var line = \" use Ecto.Repo\"\n val import = \"Ecto\"\n assertExtractsImport(import, line, ElixirExtractor)\n }\n it(\"Elixir import\") {\n var line = \" import Ecto.Repo\"\n val import = \"Ecto\"\n assertExtractsImport(import, line, ElixirExtractor)\n }\n it(\"Elixir require\") {\n var line = \" require Ecto.Repo\"\n val import = \"Ecto\"\n assertExtractsImport(import, line, ElixirExtractor)\n }\n }\n\n given(\"Perl\") {\n it(\"Perl single-line comment\") {\n var lines = listOf(\"#use Test::Base;\")\n var actualLineImports = PerlExtractor(Lang.PERL).extractImports(lines)\n assertTrue(actualLineImports.isEmpty())\n }\n it(\"Perl use\") {\n var line = \"\"\"use Test::Base;\"\"\"\n val import = \"Test::Base\"\n assertExtractsImport(import, line, PerlExtractor(Lang.PERL))\n }\n it(\"Perl import with string\") {\n var line = \"use Dancer2 ':syntax';\"\n val import = \"Dancer2 ':syntax'\"\n assertExtractsImport(import, line, PerlExtractor(Lang.PERL))\n }\n it(\"maps import\") {\n val import = \"Dancer2 ':syntax'\"\n assertMapsIndex(\"perl.Dancer2\", import, Lang.PERL,\n PerlExtractor(Lang.PERL))\n }\n it(\"maps import in perl6 language\") {\n val import = \"Dancer2 ':syntax'\"\n assertMapsIndex(\"perl.Dancer2\", import, Lang.PERL6,\n PerlExtractor(Lang.PERL6))\n }\n }\n\n given(\"PLpgSQL\") {\n it(\"PLpgSQL single-line comment\") {\n var lines = listOf(\"-- CREATE EXTENSION ltree\")\n var actualLineImports = PlpgsqlExtractor.extractImports(lines)\n actualLineImports.forEach {\n assertMapsNothing(it, Lang.PLPGSQL, PlpgsqlExtractor)\n }\n }\n it(\"PLpgSQL multi-line comment\") {\n var lines = listOf(\"/* CREATE EXTENSION ltree */\")\n var actualLineImports = PlpgsqlExtractor.extractImports(lines)\n actualLineImports.forEach {\n assertMapsNothing(it, Lang.PLPGSQL, PlpgsqlExtractor)\n }\n }\n it(\"PLpgSQL extension\") {\n var line = \"\"\" execute(\"CREATE EXTENSION ltree\")\"\"\"\n val import = \"ltree\"\n assertExtractsImport(import, line, PlpgsqlExtractor)\n }\n it(\"PLpgSQL language\") {\n var line = \"\"\" execute(\"CREATE LANGUAGE plr\")\"\"\"\n val import = \"plr\"\n assertExtractsImport(import, line, PlpgsqlExtractor)\n }\n }\n\n given(\"Ruby\") {\n it(\"Ruby imports\") {\n var line = \"require 'dry-monads'\"\n assertExtractsImport(\"dry-monads\", line, RubyExtractor())\n line = \" include Apotomo::Rails::ControllerMethods\"\n assertExtractsImport(\"apotomo\", line, RubyExtractor())\n }\n }\n\n given(\"Rust\") {\n it(\"Rust imports\") {\n var lines = listOf(\n \"extern crate foo;\",\n \"extern crate boo;\"\n )\n var actualLineImports = RustExtractor().extractImports(lines)\n assertEquals(actualLineImports, listOf(\"foo\", \"boo\"))\n\n lines = listOf(\n \"// extern crate foo;\",\n \"/* extern crate boo; */\"\n )\n actualLineImports = RustExtractor().extractImports(lines)\n assertTrue(actualLineImports.isEmpty())\n }\n }\n\n given(\"Scala\") {\n it(\"Scala single-line comment\") {\n val lines = listOf(\"// import users._\")\n val actualLineImports = ScalaExtractor.extractImports(lines)\n assertTrue(actualLineImports.isEmpty())\n }\n it(\"Scala multi-line comment\") {\n val lines = listOf(\"/* import users._ */\")\n val actualLineImports = ScalaExtractor.extractImports(lines)\n assertTrue(actualLineImports.isEmpty())\n }\n it(\"Scala imports\") {\n val line = \"import users._\"\n assertExtractsImport(\"users.\", line, ScalaExtractor)\n }\n it(\"Scala imports _root_\") {\n val line = \"import _root_.users._\"\n assertExtractsImport(\"users.\", line, ScalaExtractor)\n }\n it(\"Scala imports compound name\") {\n val line = \"import com.google.selfdrivingcar.camera.Lens\"\n assertExtractsImport(\"com.google.selfdrivingcar.camera.\", line,\n ScalaExtractor)\n }\n it(\"Scala imports multiple import\") {\n val line = \"import akka.stream.scaladsl.{Flow, Sink, Source}\"\n assertExtractsImport(\"akka.stream.scaladsl.\", line, ScalaExtractor)\n }\n it(\"maps import to index\") {\n val lib = \"scala.slick\"\n val line = \"import slick.jdbc.JdbcProfile\"\n val extractor = ScalaExtractor\n\n assertExtractsImport(\"slick.jdbc.\", line, extractor)\n\n val actualImport = extractor.extractImports(listOf(line))[0]\n assertMapsIndex(lib, actualImport, Lang.SCALA, extractor)\n }\n }\n\n given(\"Swift\") {\n it(\"Swift single-line comment\") {\n val lines = listOf(\"// class City: RLMObject {\")\n val actualLineImports = SwiftExtractor.extractImports(lines)\n assertTrue(actualLineImports.isEmpty())\n }\n it(\"Swift multi-line comment\") {\n val lines = listOf(\"/* class City: RLMObject { */\")\n val actualLineImports = SwiftExtractor.extractImports(lines)\n assertTrue(actualLineImports.isEmpty())\n }\n it(\"Swift imports\") {\n val line = \"import UIKit\"\n assertExtractsImport(\"UIKit\", line, SwiftExtractor)\n }\n it(\"Swift no libraries\") {\n val line = \"import Foundation\"\n assertExtractsNoLibraries(line, SwiftExtractor)\n }\n it(\"Swift libraries\") {\n val line = \"class City: RLMObject {\"\n assertExtractsLineLibraries(\"swift.realm\", line, SwiftExtractor)\n }\n }\n})\n" }, { "path": "src/test/kotlin/test/tests/extractors/HeuristicsTest.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Alexander Surkov (alex@sourcerer.io)\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage test.tests.extractors\n\nimport app.model.DiffFile\nimport app.model.DiffContent\nimport app.extractors.*\nimport app.model.DiffRange\nimport org.apache.commons.io.FilenameUtils\nimport org.eclipse.jgit.diff.DiffEntry.ChangeType\nimport org.jetbrains.spek.api.Spek\nimport org.jetbrains.spek.api.dsl.given\nimport org.jetbrains.spek.api.dsl.it\nimport java.io.File\nimport kotlin.test.assertEquals\nimport kotlin.test.assertFalse\nimport kotlin.test.assertNotEquals\nimport kotlin.test.assertTrue\n\nconst val LANG_SAMPLES_PATH = \"src/test/resources/samples/langs/\"\nconst val DEVOPS_SAMPLES_PATH = \"src/test/resources/samples/devops/\"\n\nfun assertLang(file: File, expectedLang: String) {\n val diffFile = DiffFile(\n file.path,\n changeType = ChangeType.ADD,\n new = DiffContent(content = file.readLines())\n // TODO(anatoly): Should we specify ranges here?\n )\n Extractor().extract(listOf(diffFile))\n\n val actualLang = diffFile.lang\n\n // TODO(anatoly): Add support for all languages of samples.\n var todoSample = false\n for (wc in ignoredSamplesWildcards) {\n if (FilenameUtils.wildcardMatchOnSystem(file.path, wc)) {\n todoSample = true\n break\n }\n }\n\n if (todoSample) {\n assertNotEquals(expectedLang, actualLang, \"Unexpected lang for ${file.path}\")\n }\n else {\n assertEquals(expectedLang, actualLang, \"Unexpected lang for ${file.path}\")\n }\n}\n\nfun assertTech(file: File, expectedTech: String) {\n val content = file.readLines()\n val diffFile = DiffFile(\n file.path,\n changeType = ChangeType.ADD,\n new = DiffContent(\n content = content,\n ranges = listOf(DiffRange(start = 0, end = content.size))\n )\n )\n\n val stats = Extractor().extract(listOf(diffFile))\n\n assertFalse(\"No stats for $file\") {\n stats.isEmpty()\n }\n\n assertTrue(\"Wrong type for $file\") {\n stats.first().type == ExtractorInterface.TYPE_LIBRARY\n }\n\n val actualTech = stats.first().tech\n\n assertEquals(expectedTech, actualTech, \"Unexpected tech for ${file.path}\")\n}\n\nclass HeuristicsTest : Spek({\n given(\"heuristics test\") {\n it(\"all language samples\") {\n for (dir in File(LANG_SAMPLES_PATH).listFiles()) {\n val expectedLang = dirToLangMap.getOrDefault(\n dir.name, dir.name.toLowerCase()\n )\n for (file in dir.walkTopDown()) {\n if (file.isFile) assertLang(file, expectedLang)\n }\n }\n }\n it(\"all devops samples\") {\n for (dir in File(DEVOPS_SAMPLES_PATH).listFiles()) {\n val expectedTech = DevopsExtractor.DEVOPS + dir.name\n\n for (file in dir.walkTopDown()) {\n if (!file.isFile) continue\n\n var skip = false\n for (wc in ignoredSamplesWildcards) {\n if (FilenameUtils.wildcardMatchOnSystem(file.path,\n wc)) {\n skip = true\n break\n }\n }\n if (skip) break\n\n assertTech(file, expectedTech)\n }\n }\n }\n }\n})\n" }, { "path": "src/test/kotlin/test/tests/extractors/IgnoredSamplesWildcards.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Alexander Surkov (alex@sourcerer.io)\n\npackage test.tests.extractors\n\n/**\n * A list of all file names whose language recognition needs to be checked\n * or fixed.\n */\nvar ignoredSamplesWildcards = listOf(\n \"*/.DS_Store\",\n \"*/1C Enterprise/*\",\n \"*/ABAP/*\",\n \"*/AppleScript/*\",\n \"*/Apex/*\",\n \"*/APL/*\",\n \"*/API Blueprint/*\",\n \"*/Alloy/*\",\n \"*/Apollo Guidance Computer/*\",\n \"*/ASN.1/*\",\n \"*/Awk/*\",\n \"*/Ant Build System/*\",\n \"*/Alpine Abuild/*\",\n \"*/AspectJ/*\",\n \"*/AMPL/*\",\n \"*/AutoHotkey/*\",\n \"*/AsciiDoc/*\",\n \"*/Agda/*\",\n \"*/ATS/*\",\n \"*/ApacheConf/*\",\n \"*/AGS Script/*\",\n \"*/Adobe Font Metrics/*\",\n \"*/Brightscript/*\",\n \"*/Bluespec/*\",\n \"*/Blade/*\",\n \"*/Brainfuck/*\",\n \"*/BlitzBasic/*\",\n \"*/BitBake/*\",\n \"*/Ballerina/*\",\n \"*/BlitzMax/*\",\n \"*/C/script\",\n \"*/C/*.cats\",\n \"*/C/jni_layer.h\",\n \"*/C++/Field.h\",\n \"*/C++/rpc.h\",\n \"*/C++/*.inc\",\n \"*/C++/*.re\",\n \"*/C++/*.ino\",\n \"*/C++/*.ipp\",\n \"*/CartoCSS/*.mss\",\n \"*/CLIPS/*\",\n \"*/CMake/*\",\n \"*/COBOL/*.ccp\",\n \"*/CSON/*\",\n \"*/CSV/*\",\n \"*/CWeb/*\",\n \"*/CartoCSS/*\",\n \"*/Ceylon/*\",\n \"*/Chapel/*\",\n \"*/Charity/*\",\n \"*/Cirru/*\",\n \"*/Clarion/*\",\n \"*/Clean/*\",\n \"*/Click/*\",\n \"*/Closure Templates/*\",\n \"*/CoNLL-U/*\",\n \"*/CoffeeScript/*.cake\",\n \"*/CoffeeScript/*.cjsx\",\n \"*/ColdFusion/*\",\n \"*/ColdFusion CFC/*\",\n \"*/Common Workflow Language/*\",\n \"*/Component Pascal/*\",\n \"*/Cool/*\",\n \"*/Creole/*\",\n \"*/Csound/*\",\n \"*/Csound Document/*\",\n \"*/Csound Score/*\",\n \"*/Cycript/*\",\n \"*/DIGITAL Command Language/*\",\n \"*/DNS Zone/*\",\n \"*/DataWeave/*\",\n \"*/Diff/*\",\n \"*/Dockerfile/*\",\n \"*/Dogescript/*\",\n \"*/E/*\",\n \"*/EBNF/*\",\n \"*/ECL/*\",\n \"*/ECLiPSe/*\",\n \"*/EJS/*\",\n \"*/EQ/*\",\n \"*/Eagle/*\",\n \"*/Easybuild/*\",\n \"*/Edje Data Collection/*\",\n \"*/Eiffel/*\",\n \"*/Elixir/filenames/*\",\n \"*/Emacs Lisp/*\",\n \"*/EmberScript/*\",\n \"*/Erlang/*.es\",\n \"*/Erlang/*.src\",\n \"*/Erlang/*.escript\",\n \"*/Erlang/factorial\",\n \"*/Erlang/release\",\n \"*/Erlang/*.xrl\",\n \"*/Erlang/filenames/*\",\n \"*/Erlang/*.yrl\",\n \"*/FLUX/*\",\n \"*/Fantom/*\",\n \"*/Formatted/*\",\n \"*/FreeMarker/*\",\n \"*/Frege/*\",\n \"*/G-code/*\",\n \"*/GAMS/*\",\n \"*/GAP/*\",\n \"*/GCC Machine Description/*\",\n \"*/GDB/*\",\n \"*/GDScript/*\",\n \"*/GN/*\",\n \"*/Game Maker Language/*\",\n \"*/Genie/*\",\n \"*/Gerber Image/*\",\n \"*/Gnuplot/*\",\n \"*/Golo/*\",\n \"*/Gosu/*\",\n \"*/Grace/*\",\n \"*/Grammatical Framework/*\",\n \"*/Graph Modeling Language/*\",\n \"*/GraphQL/*\",\n \"*/Graphviz (DOT)/*\",\n \"*/Groovy/*\",\n \"*/Groovy Server Pages/*\",\n \"*/HCL/*\",\n \"*/HLSL/*\",\n \"*/HTML/*.inc\",\n \"*/HTML/*.hl\",\n \"*/HTML/*.st\",\n \"*/HTML/*.xht\",\n \"*/HTML+Django/*\",\n \"*/HTML+ECR/*\",\n \"*/HTML+EEX/*\",\n \"*/HTML+ERB/*\",\n \"*/HXML/*\",\n \"*/Hack/*.hh\",\n \"*/Haml/*\",\n \"*/Handlebars/*\",\n \"*/HyPhy/*\",\n \"*/IGOR Pro/*\",\n \"*/INI/filenames/*.spec\",\n \"*/INI/filenames/.editorconfig\",\n \"*/INI/filenames/.gitconfig\",\n \"*/Idris/*\",\n \"*/Inform 7/*\",\n \"*/Inno Setup/*\",\n \"*/Ioke/*\",\n \"*/Isabelle/*\",\n \"*/Isabelle ROOT/*\",\n \"*/J/hashbang\",\n \"*/JFlex/*\",\n \"*/JSON/*\",\n \"*/JSON5/*\",\n \"*/JSONLD/*\",\n \"*/JSONiq/*\",\n \"*/JSX/*\",\n \"*/Jasmin/*\",\n \"*/JavaScript/*.mjs\",\n \"*/JavaScript/*.xsjs\",\n \"*/JavaScript/*.jscad\",\n \"*/JavaScript/js\",\n \"*/JavaScript/jquery-1.4.2.min.js\",\n \"*/JavaScript/jquery-1.6.1.min.js\",\n \"*/JavaScript/*.gs\",\n \"*/JavaScript/*.es\",\n \"*/JavaScript/*.jsb\",\n \"*/JavaScript/*.frag\",\n \"*/JavaScript/*.xsjslib\",\n \"*/JavaScript/js2\",\n \"*/Jison/*\",\n \"*/Jison Lex/*\",\n \"*/Jolie/*\",\n \"*/Julia/julia\",\n \"*/KRL/*\",\n \"*/KiCad Layout/*\",\n \"*/KiCad Legacy Layout/*\",\n \"*/KiCad Schematic/*\",\n \"*/Kit/*\",\n \"*/LFE/*\",\n \"*/LOLCODE/*\",\n \"*/LSL/*\",\n \"*/Lasso/*\",\n \"*/Latte/*\",\n \"*/Lean/*\",\n \"*/Less/*\",\n \"*/Linker Script/*\",\n \"*/Linux Kernel Module/*\",\n \"*/Liquid/*\",\n \"*/Literate Agda/*\",\n \"*/Literate CoffeeScript/*\",\n \"*/LiveScript/*\",\n \"*/Logos/*\",\n \"*/Logtalk/*\",\n \"*/LookML/*\",\n \"*/LoomScript/*\",\n \"*/M/mileage.m\",\n \"*/M4/*\",\n \"*/M4Sugar/*\",\n \"*/MAXScript/*\",\n \"*/MQL4/*\",\n \"*/MQL5/*\",\n \"*/MTML/*\",\n \"*/Makefile/makefile\",\n \"*/Makefile/filenames/*\",\n \"*/Markdown/*\",\n \"*/Marko/*\",\n \"*/Mask/*\",\n \"*/Matlab/CVX/functions/@cvx/functions.m\",\n \"*/Matlab/CVX/functions/Contents.m\",\n \"*/Maven POM/*\",\n \"*/Max/*\",\n \"*/MediaWiki/*\",\n \"*/Mercury/expr.moo\",\n \"*/Meson/*\",\n \"*/Metal/*\",\n \"*/Modelica/*\",\n \"*/Modula-2/*\",\n \"*/Module Management System/*\",\n \"*/Monkey/*\",\n \"*/Moocode/*\",\n \"*/MoonScript/*\",\n \"*/NCL/*\",\n \"*/NL/*\",\n \"*/NSIS/*\",\n \"*/Nearley/*\",\n \"*/Nemerle/*\",\n \"*/NetLinx/*\",\n \"*/NetLinx+ERB/*\",\n \"*/NetLogo/*\",\n \"*/Nextflow/*\",\n \"*/Nginx/*\",\n \"*/Nim/*\",\n \"*/Nit/*\",\n \"*/Nix/*\",\n \"*/Nu/*\",\n \"*/OCaml/sigset.ml\",\n \"*/OCaml/common.ml\",\n \"*/OCaml/date.ml\",\n \"*/Objective-C/cocoa_monitor.m\",\n \"*/Objective-C++/*\",\n \"*/Objective-J/*\",\n \"*/Omgrofl/*\",\n \"*/Opa/*\",\n \"*/Opal/*\",\n \"*/OpenCL/*\",\n \"*/OpenEdge ABL/*\",\n \"*/OpenRC runscript/*\",\n \"*/OpenSCAD/*\",\n \"*/Org/*\",\n \"*/Ox/*\",\n \"*/Oz/*\",\n \"*/P4/*\",\n \"*/PAWN/*\",\n \"*/PHP/*.fcgi\",\n \"*/PHP/php*\",\n \"*/PHP/filenames/.php_cs\",\n \"*/PHP/filenames/.php_cs.dist\",\n \"*/Pan/*\",\n \"*/Papyrus/*\",\n \"*/Parrot Assembly/*\",\n \"*/Parrot Internal Representation/*\",\n \"*/Pep8/*\",\n \"*/Perl/perl\",\n \"*/Perl/filenames/cpanfile\",\n \"*/Perl/filenames/Rexfile\",\n \"*/Perl/filenames/ack\",\n \"*/Perl/feedgnuplot\",\n \"*/Perl 6/man-or-boy.t\",\n \"*/Pic/*\",\n \"*/Pickle/*\",\n \"*/PigLatin/*\",\n \"*/Pike/*\",\n \"*/Pod/*\",\n \"*/PogoScript/*\",\n \"*/Pony/*\",\n \"*/PostCSS/*\",\n \"*/PostScript/*\",\n \"*/PowerBuilder/*\",\n \"*/Prolog/dleak-report\",\n \"*/Propeller Spin/*\",\n \"*/Protocol Buffer/*\",\n \"*/Public Key/*\",\n \"*/Pug/*\",\n \"*/PureBasic/*\",\n \"*/PureScript/*\",\n \"*/Python/*.pyi\",\n \"*/Python/python*\",\n \"*/Python/*.gypi\",\n \"*/Python/filenames/*\",\n \"*/Python/*.spec\",\n \"*/Python/*.pyde\",\n \"*/Python/*.cgi\",\n \"*/Python/*.bzl\",\n \"*/Python/*.pyp\",\n \"*/Python/*.fcgi\",\n \"*/QML/*\",\n \"*/QMake/qmake\",\n \"*/QMake/functions.pri\",\n \"*/R/filenames/expr-dist\",\n \"*/R/git-punchcard\",\n \"*/RAML/*\",\n \"*/RDoc/*\",\n \"*/REXX/*\",\n \"*/RMarkdown/*\",\n \"*/RPC/*\",\n \"*/RPM Spec/*\",\n \"*/RUNOFF/*\",\n \"*/Racket/*\",\n \"*/Ragel/*\",\n \"*/Rascal/*\",\n \"*/Reason/*\",\n \"*/Red/*\",\n \"*/Regular Expression/*\",\n \"*/Ring/*\",\n \"*/RobotFramework/*\",\n \"*/Ruby/*spec\",\n \"*/Ruby/rexpl\",\n \"*/Ruby/ruby*\",\n \"*/Ruby/*jbuilder\",\n \"*/Ruby/filenames/*\",\n \"*/Ruby/*.fcgi\",\n \"*/Ruby/*.rabl\",\n \"*/Ruby/macruby\",\n \"*/Ruby/*.rake\",\n \"*/Ruby/shoes-swt\",\n \"*/SCSS/*\",\n \"*/SMT/*\",\n \"*/SPARQL/*\",\n \"*/SQF/*\",\n \"*/SQL/hostcache_set_state.inc\",\n \"*/SQL/AvailableInSearchSel.prc\",\n \"*/SQLPL/check_reorg.sql\",\n \"*/SQLPL/runstats.sql\",\n \"*/SQLPL/sleep.sql\",\n \"*/SQLPL/create_stuff.sql\",\n \"*/SRecode Template/*\",\n \"*/STON/*\",\n \"*/Sage/*\",\n \"*/SaltStack/*\",\n \"*/Sass/*\",\n \"*/Scala/99*\",\n \"*/Scala/scala\",\n \"*/Scaml/*\",\n \"*/Scilab/*\",\n \"*/ShaderLab/*\",\n \"*/Shell/*.command\",\n \"*/Shell/*zsh\",\n \"*/Shell/99-bottles-of-beer\",\n \"*/Shell/*cgi\",\n \"*/Shell/plugin\",\n \"*/Shell/*bash\",\n \"*/Shell/sh\",\n \"*/Shell/filenames/*\",\n \"*/Shell/sbt\",\n \"*/Shell/*.tool\",\n \"*/Shell/string-chopping\",\n \"*/ShellSession/*\",\n \"*/Shen/*\",\n \"*/Slash/*\",\n \"*/Slim/*\",\n \"*/Smali/*\",\n \"*/SourcePawn/*\",\n \"*/Squirrel/*\",\n \"*/Stan/*\",\n \"*/Standard ML/*\",\n \"*/Stata/*\",\n \"*/Stylus/*\",\n \"*/SubRip Text/*\",\n \"*/Sublime Text Config/*\",\n \"*/SugarSS/*\",\n \"*/SystemVerilog/*\",\n \"*/TI Program/*\",\n \"*/TLA/*\",\n \"*/TOML/*\",\n \"*/TXL/*\",\n \"*/Tcl/filenames/starfield\",\n \"*/Tcl/filenames/owh\",\n \"*/Tcl/*.tm\",\n \"*/Tea/*\",\n \"*/Terra/*\",\n \"*/Text/*\",\n \"*/Thrift/*\",\n \"*/Turing/*\",\n \"*/Turtle/*\",\n \"*/Type Language/*\",\n \"*/Unity3D Asset/*\",\n \"*/Unix Assembly/*\",\n \"*/Uno/*\",\n \"*/UnrealScript/*\",\n \"*/UrWeb/*\",\n \"*/VCL/*\",\n \"*/VHDL/*\",\n \"*/Vim script/*\",\n \"*/Volt/*\",\n \"*/Wavefront Material/*\",\n \"*/Wavefront Object/*\",\n \"*/Web Ontology Language/*\",\n \"*/WebAssembly/*\",\n \"*/WebIDL/*\",\n \"*/World of Warcraft Addon Data/*\",\n \"*/X10/*\",\n \"*/XC/*\",\n \"*/XCompose/*\",\n \"*/XML/XmlIO.pluginspec\",\n \"*/XML/*.wixproj\",\n \"*/XML/*.proj\",\n \"*/XML/*.sch\",\n \"*/XML/*.mm\",\n \"*/XML/*.config\",\n \"*/XML/*.targets\",\n \"*/XML/*.mod\",\n \"*/XPages/*\",\n \"*/XProc/*\",\n \"*/XQuery/*\",\n \"*/XS/*\",\n \"*/XSLT/*\",\n \"*/Xojo/*\",\n \"*/YAML/*\",\n \"*/YANG/*\",\n \"*/YARA/*\",\n \"*/Zephir/*\",\n \"*/Zimpl/*\",\n \"*/desktop/*\",\n \"*/eC/*\",\n \"*/edn/*\",\n \"*/fish/*\",\n \"*/reStructuredText/*\",\n \"*/sed/*\",\n \"*/wdl/*\",\n \"*/wisp/*\",\n \"*/xBase/*\"\n)\n" }, { "path": "src/test/kotlin/test/tests/hashers/AuthorDistanceHasherTest.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n\npackage test.tests.hashers\n\nimport app.FactCodes\nimport app.api.MockApi\nimport app.hashers.AuthorDistanceHasher\nimport app.hashers.CommitCrawler\nimport app.model.Author\nimport app.model.AuthorDistance\nimport app.model.Fact\nimport app.model.Repo\nimport org.eclipse.jgit.api.Git\nimport org.jetbrains.spek.api.Spek\nimport org.jetbrains.spek.api.dsl.given\nimport org.jetbrains.spek.api.dsl.it\nimport test.utils.TestRepo\nimport java.io.File\nimport java.util.*\nimport kotlin.test.assertTrue\nimport kotlin.test.fail\n\nclass AuthorDistanceHasherTest : Spek({\n given(\"repo with a file\") {\n val testRepoPath = \"../author_distance_hasher\"\n val testRepo = TestRepo(testRepoPath)\n val serverRepo = Repo(rehash = \"test_repo_rehash\")\n val api = MockApi(mockRepo = serverRepo)\n val fileName = \"test1.txt\"\n val author1 = Author(\"First Author\", \"first.author@gmail.com\")\n val author2 = Author(\"Second Author\", \"second.author@gmail.com\")\n val author3 = Author(\"Third Author\", \"third.author@gmail.com\")\n val emails = hashSetOf(author1.email, author2.email, author3.email)\n\n testRepo.createFile(fileName, listOf(\"line1\", \"line2\"))\n testRepo.commit(message = \"initial commit\",\n author = author1,\n date = Calendar.Builder().setDate(2017, 1, 1).setTimeOfDay\n (0, 0, 0).build().time)\n\n testRepo.deleteLines(fileName, 1, 1)\n testRepo.commit(message = \"delete second line\",\n author = author2,\n date = Calendar.Builder().setDate(2017, 1, 1).setTimeOfDay\n (0, 1, 0).build().time)\n\n testRepo.deleteLines(fileName, 0, 0)\n testRepo.commit(message = \"delete first line\",\n author = author1,\n date = Calendar.Builder().setDate(2018, 1, 1).setTimeOfDay\n (0, 1, 0).build().time)\n testRepo.insertLines(fileName, 0, listOf(\"line1\"))\n testRepo.commit(message = \"add first line\",\n author = author3,\n date = Calendar.Builder().setDate(2019, 1, 1).setTimeOfDay\n (0, 1, 0).build().time)\n\n val gitHasher = Git.open(File(testRepoPath))\n it(\"extracts colleagues\") {\n val observable = CommitCrawler.getJGitObservable(gitHasher,\n extractCommit = false, extractDate = true,\n extractDiffs = false, extractEmail = true,\n extractPaths = true)\n AuthorDistanceHasher(serverRepo, api, emails,\n hashSetOf(author2.email)).updateFromObservable(observable,\n onError = { _ -> fail(\"exception\") })\n\n assertTrue(api.receivedDistances.contains(\n AuthorDistance(repo = serverRepo,\n email = author1.email,\n score = 1.0)))\n\n assertTrue(api.receivedDistances.contains(\n AuthorDistance(repo = serverRepo,\n email = author3.email,\n score = 0.0)))\n }\n\n afterGroup {\n testRepo.destroy()\n }\n }\n})\n" }, { "path": "src/test/kotlin/test/tests/hashers/CodeLongevityTest.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Alexander Surkov (alex@sourcerer.io)\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage test.tests.hashers\n\nimport app.api.MockApi\nimport app.FactCodes\nimport app.hashers.CodeLine\nimport app.hashers.CodeLineAges\nimport app.hashers.CodeLongevity\nimport app.hashers.RevCommitLine\nimport app.model.*\n\nimport test.utils.TestRepo\n\nimport kotlin.test.assertEquals\nimport kotlin.test.assertTrue\nimport kotlin.test.fail\n\nimport org.eclipse.jgit.revwalk.RevCommit\n\nimport org.jetbrains.spek.api.Spek\nimport org.jetbrains.spek.api.dsl.given\nimport org.jetbrains.spek.api.dsl.it\n\nimport java.util.Calendar\nimport kotlin.test.assertNotNull\n\n/**\n * Testing class.\n */\nclass CodeLongevityTest : Spek({\n\n /**\n * Assert function to test RevCommitLine object.\n */\n fun assertRevCommitLine(expectedCommit: RevCommit,\n expectedFile: String,\n expectedLineNum: Int,\n actualLine: RevCommitLine,\n messsage: String = \"\") {\n\n assertEquals(expectedCommit, actualLine.commit, \"$messsage commit\")\n assertEquals(expectedFile, actualLine.file, \"$messsage file name\")\n assertEquals(expectedLineNum, actualLine.line, \"$messsage line num\")\n }\n\n /**\n * Assert function to test CodeLine object.\n */\n fun assertCodeLine(lineText: String, isDeleted: Boolean,\n fromCommit: RevCommit, fromFile: String,\n fromLineNum: Int, toCommit: RevCommit, toFile: String,\n toLineNum: Int, actualLine: CodeLine) {\n\n assertRevCommitLine(fromCommit, fromFile, fromLineNum, actualLine.from,\n \"'$lineText' from_commit\")\n assertRevCommitLine(toCommit, toFile, toLineNum, actualLine.to,\n \"'$lineText' to_commit\")\n\n assertEquals(lineText, actualLine.text, \"line text\")\n assertEquals(isDeleted, actualLine.isDeleted, \"'$lineText' \" +\n \"line is deleted\")\n }\n\n Runtime.getRuntime().exec(\"rm -r ./.sourcerer/longevity\").waitFor()\n\n given(\"'line collecting #1'\") {\n val testRepoPath = \"../CodeLongevity_lc1\"\n val testRepo = TestRepo(testRepoPath)\n val fileName = \"test1.txt\"\n val emails = hashSetOf(testRepo.userEmail)\n\n // t1: initial insertion\n testRepo.createFile(fileName, listOf(\"line1\", \"line2\"))\n val rev1 = testRepo.commit(\"initial commit\")\n val lines1 = CodeLongevity(Repo(), emails, testRepo.git)\n .getLinesList(onError = { _ -> fail(\"exception\") })\n\n it(\"'t1: initial insertion'\") {\n assertEquals(2, lines1.size)\n assertCodeLine(\"line1\", false,\n rev1, fileName, 0,\n rev1, fileName, 0,\n lines1[0])\n assertCodeLine(\"line2\", false,\n rev1, fileName, 1,\n rev1, fileName, 1,\n lines1[1])\n }\n\n // t2: subsequent insertion\n testRepo.insertLines(fileName, 1, listOf(\"line in the middle\"))\n val rev2 = testRepo.commit(\"insert line\")\n val lines2 = CodeLongevity(Repo(), emails, testRepo.git)\n .getLinesList(onError = { _ -> fail(\"exception\") })\n\n it(\"'t2: subsequent insertion'\") {\n assertEquals(3, lines2.size)\n assertCodeLine(\"line in the middle\", false,\n rev2, fileName, 1,\n rev2, fileName, 1,\n lines2[0])\n assertCodeLine(\"line1\", false,\n rev1, fileName, 0,\n rev2, fileName, 0,\n lines2[1])\n assertCodeLine(\"line2\", false,\n rev1, fileName, 1,\n rev2, fileName, 2,\n lines2[2])\n }\n\n // t3: subsequent deletion\n testRepo.deleteLines(fileName, 2, 2)\n val rev3 = testRepo.commit(\"delete line\")\n val lines3 = CodeLongevity(Repo(), emails, testRepo.git)\n .getLinesList(onError = { _ -> fail(\"exception\") })\n\n it(\"'t3: subsequent deletion'\") {\n assertEquals(3, lines3.size)\n assertCodeLine(\"line in the middle\", false,\n rev2, fileName, 1,\n rev3, fileName, 1,\n lines3[0])\n assertCodeLine(\"line1\", false,\n rev1, fileName, 0,\n rev3, fileName, 0,\n lines3[1])\n assertCodeLine(\"line2\", true,\n rev1, fileName, 1,\n rev3, fileName, 2,\n lines3[2])\n }\n\n // t4: file deletion\n testRepo.deleteFile(fileName)\n val rev4 = testRepo.commit(\"delete file\")\n val lines4 = CodeLongevity(Repo(), emails, testRepo.git)\n .getLinesList(onError = { _ -> fail(\"exception\") })\n\n it(\"'t4: file deletion'\") {\n assertEquals(3, lines4.size)\n assertCodeLine(\"line in the middle\", true,\n rev2, fileName, 1,\n rev4, fileName, 1,\n lines4[0])\n assertCodeLine(\"line1\", true,\n rev1, fileName, 0,\n rev4, fileName, 0,\n lines4[1])\n\n assertCodeLine(\"line2\", true,\n rev1, fileName, 1,\n rev3, fileName, 2,\n lines4[2])\n }\n\n afterGroup {\n testRepo.destroy()\n }\n }\n\n given(\"'line collecting #2'\") {\n val testRepoPath = \"../CodeLongevity_lc2\"\n val testRepo = TestRepo(testRepoPath)\n val fileName = \"test1.txt\"\n val emails = hashSetOf(testRepo.userEmail)\n\n // t2.1: initial insertion\n val fileContent = listOf(\n \"line0\",\n \"line1\",\n \"line2\",\n \"line3\",\n \"line4\",\n \"line5\",\n \"line6\",\n \"line7\",\n \"line8\",\n \"line9\",\n \"line10\",\n \"line11\",\n \"line12\",\n \"line13\",\n \"line14\",\n \"line15\",\n \"line16\",\n \"line17\",\n \"line18\"\n )\n testRepo.createFile(fileName, fileContent)\n val rev1 = testRepo.commit(\"initial commit\")\n val lines1 = CodeLongevity(Repo(), emails, testRepo.git)\n .getLinesList(onError = { _ -> fail(\"exception\") })\n\n it(\"'t2.1: initial insertion'\") {\n assertEquals(fileContent.size, lines1.size)\n for (idx in 0 .. fileContent.size - 1) {\n assertCodeLine(fileContent[idx], false,\n rev1, fileName, idx,\n rev1, fileName, idx,\n lines1[idx])\n }\n }\n\n // t2.2: ins+del\n\n // Diff:\n // 0 0 line0\n // 1 1 line1\n // 2 2 line2\n // 3 - line3\n // 4 - line4\n // 5 - line5\n // 3 + Proof addition 1\n // 6 4 line6\n // 7 5 line7\n // 8 6 line8\n // 9 - line9\n // 10 - line10\n // 11 - line11\n // 7 + Proof addition 2\n // 12 8 line12\n // 13 9 line13\n // 14 10 line14\n // 15 - line15\n // 16 - line16\n // 17 - line17\n // 18 - line18\n // 11 + Proof addition 3\n\n testRepo.deleteLines(fileName, 15, 18)\n testRepo.deleteLines(fileName, 9, 11)\n testRepo.deleteLines(fileName, 3, 5)\n testRepo.insertLines(fileName, 3, listOf(\"Proof addition 1\"))\n testRepo.insertLines(fileName, 7, listOf(\"Proof addition 2\"))\n testRepo.insertLines(fileName, 11, listOf(\"Proof addition 3\"))\n val rev2 = testRepo.commit(\"insert+delete\")\n\n val lines2 = CodeLongevity(Repo(), emails, testRepo.git)\n .getLinesList(onError = { _ -> fail(\"exception\") })\n\n it(\"'t2.2: ins+del'\") {\n assertEquals(22, lines2.size)\n assertCodeLine(\"Proof addition 3\", false,\n rev2, fileName, 11, rev2,\n fileName, 11, lines2[0])\n assertCodeLine(\"Proof addition 2\", false,\n rev2, fileName, 7,\n rev2, fileName, 7, lines2[1])\n assertCodeLine(\"Proof addition 1\", false,\n rev2, fileName, 3,\n rev2, fileName, 3, lines2[2])\n assertCodeLine(\"line0\", false,\n rev1, fileName, 0,\n rev2, fileName, 0, lines2[3])\n assertCodeLine(\"line1\", false,\n rev1, fileName, 1,\n rev2, fileName, 1, lines2[4])\n assertCodeLine(\"line2\", false,\n rev1, fileName, 2,\n rev2, fileName, 2, lines2[5])\n assertCodeLine(\"line3\", true,\n rev1, fileName, 3,\n rev2, fileName, 3, lines2[6])\n assertCodeLine(\"line4\", true,\n rev1, fileName, 4,\n rev2, fileName, 4, lines2[7])\n assertCodeLine(\"line5\", true,\n rev1, fileName, 5,\n rev2, fileName, 5, lines2[8])\n assertCodeLine(\"line6\", false,\n rev1, fileName, 6,\n rev2, fileName, 4, lines2[9])\n assertCodeLine(\"line7\", false,\n rev1, fileName, 7,\n rev2, fileName, 5, lines2[10])\n assertCodeLine(\"line8\", false,\n rev1, fileName, 8,\n rev2, fileName, 6, lines2[11])\n assertCodeLine(\"line9\", true,\n rev1, fileName, 9,\n rev2, fileName, 9, lines2[12])\n assertCodeLine(\"line10\", true,\n rev1, fileName, 10,\n rev2, fileName, 10, lines2[13])\n assertCodeLine(\"line11\", true,\n rev1, fileName, 11,\n rev2, fileName, 11, lines2[14])\n assertCodeLine(\"line12\", false,\n rev1, fileName, 12,\n rev2, fileName, 8, lines2[15])\n }\n\n afterGroup {\n testRepo.destroy()\n }\n }\n\n given(\"'line collecting #3: between revisions'\") {\n val testRepoPath = \"../CodeLongevity_lc3\"\n val testRepo = TestRepo(testRepoPath)\n val fileName = \"test1.txt\"\n val emails = hashSetOf(testRepo.userEmail)\n\n testRepo.createFile(fileName, listOf(\"line1\", \"line2\"))\n val rev1 = testRepo.commit(\"initial commit\")\n testRepo.insertLines(fileName, 1, listOf(\"line15\"))\n val rev2 = testRepo.commit(\"insert line\")\n testRepo.deleteLines(fileName, 2, 2)\n val rev3 = testRepo.commit(\"delete line2\")\n\n val lines1 = CodeLongevity(Repo(), emails, testRepo.git)\n .getLinesList(onError = { _ -> fail(\"exception\") })\n val lines1_line15 = lines1[0]\n val lines1_line1 = lines1[1]\n val lines1_line2 = lines1[2]\n\n it(\"'before'\") {\n assertEquals(3, lines1.size)\n assertCodeLine(\"line15\", false,\n rev2, fileName, 1,\n rev3, fileName, 1,\n lines1_line15)\n assertCodeLine(\"line1\", false,\n rev1, fileName, 0,\n rev3, fileName, 0,\n lines1_line1)\n assertCodeLine(\"line2\", true,\n rev1, fileName, 1,\n rev3, fileName, 2,\n lines1_line2)\n }\n\n testRepo.deleteLines(fileName, 0, 0)\n val rev4 = testRepo.commit(\"delete line1\")\n\n val lines2 = CodeLongevity(Repo(), emails, testRepo.git)\n .getLinesList(rev3, onError = { _ -> fail(\"exception\") })\n val lines2_line1 = lines2[0]\n val lines2_line15 = lines2[1]\n\n it(\"'after'\") {\n assertEquals(2, lines2.size)\n assertCodeLine(\"line1\", true,\n rev3, fileName, 0,\n rev4, fileName, 0,\n lines2_line1)\n assertEquals(lines1_line1.newId, lines2_line1.oldId,\n \"line1 old and new ids matching\")\n\n assertCodeLine(\"line15\", false,\n rev3, fileName, 1,\n rev4, fileName, 0,\n lines2_line15)\n assertEquals(lines1_line15.newId, lines2_line15.oldId,\n \"line15 old and new ids matching\")\n\n }\n\n afterGroup {\n testRepo.destroy()\n }\n }\n\n given(\"'line storage #1'\") {\n val testRepoPath = \"../CodeLongevity_ls1\"\n val testRepo = TestRepo(testRepoPath)\n val testRehash = \"rehash_ls1\"\n val fileName = \"test1.txt\"\n val email = testRepo.userEmail\n val emails = hashSetOf(email)\n val api = MockApi()\n\n testRepo.createFile(fileName, listOf(\"line1\", \"line2\"))\n testRepo.commit(message = \"initial commit\",\n date = Calendar.Builder().setTimeOfDay(0, 0, 0).build().time)\n testRepo.insertLines(fileName, 1, listOf(\"line15\"))\n testRepo.commit(message = \"insert line\",\n date = Calendar.Builder().setTimeOfDay(0, 1, 0).build().time)\n\n var t1Ages: CodeLineAges? = null\n CodeLongevity(Repo(rehash = testRehash), emails, testRepo.git)\n .updateFromObservable(onError = { _ -> fail(\"exception\") },\n onDataComplete = { t1Ages = it.clone() },\n api = api)\n val t1Lines = CodeLongevity(Repo(rehash = testRehash), emails,\n testRepo.git).getLinesList(onError = { _ -> fail(\"exception\") })\n\n it(\"'t1'\") {\n assertNotNull(t1Ages)\n assertTrue(t1Ages!!.aggrAges.isEmpty(),\n \"t1_ages: aggr ages is empty\")\n assertEquals(3, t1Ages!!.lastingLines.count(),\n \"t1_ages: lasting lines count\")\n for (line in t1Lines) {\n assertEquals(t1Ages!!.lastingLines[line.newId]!!.age, line.age,\n \"t1_ages: line age at '${line.newId}'\")\n }\n }\n\n testRepo.deleteLines(fileName, 2, 2)\n testRepo.commit(message = \"delete line2\",\n date = Calendar.Builder().setTimeOfDay(0, 3, 0).build().time)\n\n var t2Ages: CodeLineAges? = null\n CodeLongevity(Repo(rehash = testRehash), emails, testRepo.git)\n .updateFromObservable(onError = { _ -> fail(\"exception\") },\n onDataComplete = { t2Ages = it.clone() },\n api = api)\n val t2Lines = CodeLongevity(Repo(rehash = testRehash), emails,\n testRepo.git).getLinesList(onError = { _ -> fail(\"exception\") })\n\n it(\"'t2'\") {\n assertNotNull(t2Ages)\n assertEquals(1, t2Ages!!.aggrAges[email]!!.count,\n \"t2_ages: aggr ages count\")\n assertEquals(180, t2Ages!!.aggrAges[email]!!.sum,\n \"t2_ages: aggr ages sum\") // line2\n assertEquals(2, t2Ages!!.lastingLines.count(),\n \"t2_ages: lasting lines count\")\n\n val line1 = t2Lines.find { line -> line.text == \"line1\" }!!\n val line15 = t2Lines.find { line -> line.text == \"line15\" }!!\n assertEquals(180, t2Ages!!.lastingLines[line1.newId]!!.age,\n \"t2_ages: 'line1' line age\")\n assertEquals(120, t2Ages!!.lastingLines[line15.newId]!!.age,\n \"t2_ages: 'line15' line age\")\n }\n\n afterGroup {\n CodeLongevity(Repo(rehash = testRehash), emails, testRepo.git)\n .dropSavedData()\n testRepo.destroy()\n }\n }\n\n given(\"'longevity stats #1'\") {\n val testRepoPath = \"../CodeLongevity_lngstats1\"\n val testRepo = TestRepo(testRepoPath)\n val testRehash = \"rehash_lngstats1\"\n val fileName = \"test1.txt\"\n val author1 = Author(testRepo.userName, testRepo.userEmail)\n val author2 = Author(\"Vasya Pupkin\", \"vasya@pupkin.me\")\n val emails = hashSetOf(testRepo.userEmail)\n\n val serverRepo = Repo(rehash = testRehash)\n val api = MockApi(mockRepo = serverRepo)\n\n testRepo.createFile(fileName, listOf(\"line1\", \"line2\"))\n testRepo.commit(message = \"initial commit\",\n author = author1,\n date = Calendar.Builder().setTimeOfDay(0, 0, 0)\n .build().time)\n\n testRepo.insertLines(fileName, 1, listOf(\"line15\"))\n testRepo.commit(message = \"insert line\",\n author = author2,\n date = Calendar.Builder().setTimeOfDay(0, 1, 0)\n .build().time)\n\n testRepo.insertLines(fileName, 2, listOf(\"line17\"))\n testRepo.commit(message = \"insert line2\",\n author = author1,\n date = Calendar.Builder().setTimeOfDay(0, 3, 0)\n .build().time)\n\n testRepo.deleteLines(fileName, 2, 2)\n testRepo.commit(message = \"delete line\",\n author = author1,\n date = Calendar.Builder().setTimeOfDay(0, 4, 0)\n .build().time)\n\n CodeLongevity(serverRepo, emails, testRepo.git).updateFromObservable(\n onError = { _ -> fail(\"exception\") }, api = api)\n\n it(\"'t1'\") {\n assertTrue(api.receivedFacts.contains(\n Fact(repo = serverRepo,\n code = FactCodes.LINE_LONGEVITY_REPO,\n value = (720 / 4).toString())\n ))\n\n assertTrue(api.receivedFacts.contains(\n Fact(repo = serverRepo,\n code = FactCodes.LINE_LONGEVITY,\n author = author1,\n value = (540 / 3).toString())\n ))\n }\n\n afterGroup {\n CodeLongevity(Repo(rehash = testRehash), emails, testRepo.git)\n .dropSavedData()\n testRepo.destroy()\n }\n }\n\n given(\"'longevity stats #2'\") {\n val testRepoPath = \"../CodeLongevity_lngstats2\"\n val testRepo = TestRepo(testRepoPath)\n val testRehash = \"rehash_lngstats2\"\n val fileName = \"test1.txt\"\n val author1 = Author(testRepo.userName, testRepo.userEmail)\n val author2 = Author(\"Vasya Pupkin\", \"vasya@pupkin.me\")\n val emails = hashSetOf(author1.email, author2.email)\n\n val serverRepo = Repo(rehash = testRehash)\n val mockApi = MockApi(mockRepo = serverRepo)\n\n testRepo.createFile(fileName, listOf(\"line1\", \"line2\"))\n testRepo.commit(message = \"initial commit\",\n author = author1,\n date = Calendar.Builder().setTimeOfDay(0, 0, 0)\n .build().time)\n\n testRepo.deleteLines(fileName, 1, 1)\n testRepo.commit(message = \"delete line\",\n author = author2,\n date = Calendar.Builder().setTimeOfDay(0, 1, 0)\n .build().time)\n\n CodeLongevity(serverRepo, emails, testRepo.git)\n .updateFromObservable(onError = { _ -> fail(\"exception\") },\n api = mockApi)\n\n it(\"'t1'\") {\n assertTrue(mockApi.receivedFacts.contains(\n Fact(repo = serverRepo,\n code = FactCodes.LINE_LONGEVITY_REPO,\n value = (60).toString())\n ))\n\n assertTrue(mockApi.receivedFacts.contains(\n Fact(repo = serverRepo,\n code = FactCodes.LINE_LONGEVITY,\n author = author1,\n value = (60).toString())\n ))\n\n assertTrue(mockApi.receivedFacts.contains(\n Fact(repo = serverRepo,\n code = FactCodes.LINE_LONGEVITY,\n author = author2,\n value = (0).toString())\n ))\n }\n\n afterGroup {\n CodeLongevity(Repo(rehash = testRehash), emails, testRepo.git)\n .dropSavedData()\n testRepo.destroy()\n }\n }\n})\n" }, { "path": "src/test/kotlin/test/tests/hashers/ColleaguesTest.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Alexander Surkov (alex@sourcerer.io)\n\npackage test.tests.hashers\n\nimport app.api.MockApi\nimport app.FactCodes\nimport app.hashers.CodeLine\nimport app.hashers.CodeLineAges\nimport app.hashers.CodeLongevity\nimport app.hashers.CommitCrawler\nimport app.hashers.RevCommitLine\nimport app.model.*\n\nimport test.utils.TestRepo\n\nimport kotlin.test.assertEquals\nimport kotlin.test.assertTrue\nimport kotlin.test.fail\n\nimport org.eclipse.jgit.revwalk.RevCommit\n\nimport org.jetbrains.spek.api.Spek\nimport org.jetbrains.spek.api.dsl.given\nimport org.jetbrains.spek.api.dsl.it\n\nimport java.util.Calendar\nimport kotlin.test.assertNotNull\n\n/**\n * Testing class.\n */\nclass ColleaguesTest : Spek({\n given(\"'colleagues #1'\") {\n val testRepoPath = \"../colleagues1\"\n val testRepo = TestRepo(testRepoPath)\n val testRehash = \"rehash_colleagues1\"\n val fileName = \"test1.txt\"\n val author1 = Author(testRepo.userName, testRepo.userEmail)\n val author2 = Author(\"Vasya Pupkin\", \"vasya@pupkin.me\")\n val emails = hashSetOf(author1.email, author2.email)\n\n val serverRepo = Repo(rehash = testRehash)\n\n it(\"'t1'\") {\n val mockApi = MockApi(mockRepo = serverRepo)\n\n testRepo.createFile(fileName, listOf(\"line1\", \"line2\"))\n testRepo.commit(message = \"initial commit\",\n author = author1,\n date = Calendar.Builder().setTimeOfDay(0, 0, 0)\n .build().time)\n\n testRepo.deleteLines(fileName, 1, 1)\n testRepo.commit(message = \"delete line\",\n author = author1,\n date = Calendar.Builder().setTimeOfDay(0, 1, 0)\n .build().time)\n\n testRepo.deleteLines(fileName, 0, 0)\n testRepo.commit(message = \"delete line #2\",\n author = author2,\n date = Calendar.Builder().setTimeOfDay(0, 1, 0)\n .build().time)\n\n val cl = CodeLongevity(serverRepo, emails, testRepo.git)\n cl.updateFromObservable(onError = { _ -> fail(\"exception\") },\n api = mockApi)\n\n val triple1 = cl.colleagues.get(author1.email)[0]\n assertEquals(triple1.first, author2.email,\n \"Wrong colleague email #1\")\n assertEquals(triple1.second, \"1970-01\", \"Wrong colleague month #1\")\n assertEquals(triple1.third, 60, \"Wrong colleague vicinity #1\")\n\n val triple2 = cl.colleagues.get(author2.email)[0]\n assertEquals(triple2.first, author1.email,\n \"Wrong colleague email #1\")\n assertEquals(triple2.second, \"1970-01\", \"Wrong colleague month #1\")\n assertEquals(triple2.third, 60, \"Wrong colleague vicinity #1\")\n }\n\n afterGroup {\n CodeLongevity(Repo(rehash = testRehash), emails, testRepo.git)\n .dropSavedData()\n testRepo.destroy()\n }\n }\n\n given(\"'colleagues stats'\") {\n val testRepoPath = \"../colleagues_stats\"\n val testRepo = TestRepo(testRepoPath)\n val testRehash = \"rehash_colleagues_stats\"\n val fileName = \"test1.txt\"\n val author1 = Author(testRepo.userName, testRepo.userEmail)\n val author2 = Author(\"Vasya Pupkin\", \"vasya@pupkin.me\")\n val emails = hashSetOf(author1.email, author2.email)\n\n val serverRepo = Repo(rehash = testRehash)\n\n it(\"'t1'\") {\n val mockApi = MockApi(mockRepo = serverRepo)\n\n testRepo.createFile(fileName, listOf(\"line1\", \"line2\"))\n testRepo.commit(message = \"initial commit\",\n author = author1,\n date = Calendar.Builder().setTimeOfDay(0, 0, 0)\n .build().time)\n\n testRepo.deleteLines(fileName, 1, 1)\n testRepo.commit(message = \"delete line\",\n author = author2,\n date = Calendar.Builder().setTimeOfDay(0, 1, 0)\n .build().time)\n\n testRepo.insertLines(fileName, 1, listOf(\"line in the end\"))\n testRepo.commit(message = \"insert line\",\n author = author2,\n date = Calendar.Builder().setTimeOfDay(0, 10, 0)\n .build().time)\n\n testRepo.deleteLines(fileName, 1, 1)\n testRepo.commit(message = \"delete line #2\",\n author = author1,\n date = Calendar.Builder().setTimeOfDay(0, 20, 0)\n .build().time)\n\n CodeLongevity(serverRepo, emails, testRepo.git)\n .updateFromObservable(\n onError = { _ -> fail(\"exception\") },\n api = mockApi)\n\n assertTrue(mockApi.receivedFacts.contains(\n Fact(repo = serverRepo,\n code = FactCodes.COLLEAGUES,\n value = author2.email,\n value2 = author1.email,\n value3 = (60).toString())\n ))\n }\n\n afterGroup {\n CodeLongevity(Repo(rehash = testRehash), emails, testRepo.git)\n .dropSavedData()\n testRepo.destroy()\n }\n }\n})\n" }, { "path": "src/test/kotlin/test/tests/hashers/CommitHasherTest.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage test.tests.hashers\n\nimport app.api.MockApi\nimport app.extractors.ExtractorInterface\nimport app.hashers.CommitHasher\nimport app.hashers.CommitCrawler\nimport app.model.*\nimport app.utils.RepoHelper\nimport org.eclipse.jgit.api.Git\nimport org.jetbrains.spek.api.Spek\nimport org.jetbrains.spek.api.dsl.given\nimport org.jetbrains.spek.api.dsl.it\nimport test.utils.TestRepo\nimport java.io.File\nimport java.util.stream.StreamSupport.stream\nimport kotlin.streams.toList\nimport kotlin.test.assertEquals\nimport kotlin.test.assertTrue\n\nclass CommitHasherTest : Spek({\n fun getRepoRehash(git: Git, localRepo: LocalRepo): String {\n\n val initialRevCommit = stream(git.log().call().spliterator(), false)\n .toList().first()\n return RepoHelper.calculateRepoRehash(Commit(initialRevCommit).rehash,\n localRepo)\n }\n\n fun getLastCommit(git: Git): Commit {\n val revCommits = stream(git.log().call().spliterator(), false).toList()\n val lastCommit = Commit(revCommits.first())\n return lastCommit\n }\n\n fun cleanRepos() {\n Runtime.getRuntime().exec(\"src/test/delete_repo.sh\").waitFor()\n }\n\n val userName = \"First Contributor\"\n val userEmail = \"test@domain.com\"\n\n val secondUserName = \"Second Contributor\"\n val secondUserEmail = \"test2@domain.com\"\n\n // Creation of test repo.\n cleanRepos()\n val repoPath = \"./tmp_repo/.git\"\n val git = Git.init().setGitDir(File(repoPath)).call()\n val config = git.repository.config\n config.setString(\"user\", null, \"name\", userName)\n config.setString(\"user\", null, \"email\", userEmail)\n config.save()\n\n // Common parameters for CommitHasher.\n val gitHasher = Git.open(File(repoPath))\n val initialCommit = Commit(git.commit().setMessage(\"Initial commit\").call())\n val repoRehash = RepoHelper.calculateRepoRehash(initialCommit.rehash,\n LocalRepo(repoPath).also { it.author = Author(userName, userEmail) })\n val repo = Repo(rehash = repoRehash,\n initialCommitRehash = initialCommit.rehash)\n val emails = hashSetOf(userEmail, secondUserEmail)\n\n given(\"repo with initial commit and no history\") {\n repo.commits = listOf()\n\n val errors = mutableListOf()\n val mockApi = MockApi(mockRepo = repo)\n val observable = CommitCrawler.getObservable(gitHasher, repo)\n CommitHasher(repo, mockApi, repo.commits.map {it.rehash}, emails)\n .updateFromObservable(observable, { e -> errors.add(e) })\n\n it (\"has no errors\") {\n assertEquals(0, errors.size)\n }\n\n it(\"send added commits\") {\n assertEquals(1, mockApi.receivedAddedCommits.size)\n }\n\n it(\"doesn't send deleted commits\") {\n assertEquals(0, mockApi.receivedDeletedCommits.size)\n }\n }\n\n given(\"repo with initial commit\") {\n repo.commits = listOf(getLastCommit(git))\n\n val errors = mutableListOf()\n val mockApi = MockApi(mockRepo = repo)\n val observable = CommitCrawler.getObservable(gitHasher, repo)\n CommitHasher(repo, mockApi, repo.commits.map {it.rehash}, emails)\n .updateFromObservable(observable, { e -> errors.add(e) })\n\n it (\"has no errors\") {\n assertEquals(0, errors.size)\n }\n\n it(\"doesn't send added commits\") {\n assertEquals(0, mockApi.receivedAddedCommits.size)\n }\n\n it(\"doesn't send deleted commits\") {\n assertEquals(0, mockApi.receivedDeletedCommits.size)\n }\n }\n\n given(\"happy path: added one commit\") {\n repo.commits = listOf(getLastCommit(git))\n\n val errors = mutableListOf()\n val mockApi = MockApi(mockRepo = repo)\n val revCommit = git.commit().setMessage(\"Second commit.\").call()\n val addedCommit = Commit(revCommit)\n val observable = CommitCrawler.getObservable(gitHasher, repo)\n CommitHasher(repo, mockApi, repo.commits.map {it.rehash}, emails)\n .updateFromObservable(observable, { e -> errors.add(e) })\n\n it (\"has no errors\") {\n assertEquals(0, errors.size)\n }\n\n it(\"doesn't send deleted commits\") {\n assertEquals(0, mockApi.receivedDeletedCommits.size)\n }\n\n it(\"posts one commit as added\") {\n assertEquals(1, mockApi.receivedAddedCommits.size)\n }\n\n it(\"should be that the posted commit is added one\") {\n assertEquals(addedCommit, mockApi.receivedAddedCommits.last())\n }\n }\n\n /*given(\"happy path: added a few new commits\") {\n repo.commits = listOf(getLastCommit(git))\n\n val errors = mutableListOf()\n val mockApi = MockApi(mockRepo = repo)\n\n val otherAuthorsNames = listOf(\"a\", \"b\", \"a\")\n val otherAuthorsEmails = listOf(\"a@a\", \"b@b\", \"a@a\")\n for (i in 0..2) {\n git.commit().setMessage(\"Create $i.\")\n .setAuthor(otherAuthorsNames.get(i),\n otherAuthorsEmails.get(i))\n .call()\n }\n val authorCommits = mutableListOf()\n for (i in 0..4) {\n val message = \"Created $i by author.\"\n val revCommit = git.commit().setMessage(message).call()\n authorCommits.add(Commit(revCommit))\n }\n val observable = CommitCrawler.getObservable(gitHasher, repo)\n CommitHasher(repo, mockApi, repo.commits.map {it.rehash}, emails)\n .updateFromObservable(observable, { e -> errors.add(e) })\n\n it (\"has no errors\") {\n assertEquals(0, errors.size)\n }\n\n it(\"posts five commits as added\") {\n assertEquals(5, mockApi.receivedAddedCommits.size)\n }\n\n it(\"doesn't send deleted commits \") {\n assertEquals(0, mockApi.receivedDeletedCommits.size)\n }\n\n it(\"processes author's commits\") {\n assertEquals(authorCommits.asReversed(),\n mockApi.receivedAddedCommits)\n }\n }\n\n given(\"fork event\") {\n val forkedRepoPath = \"./forked_repo/\"\n val originalRepoPath = \"./original_repo/\"\n val forked = Git.cloneRepository()\n .setURI(\"https://github.com/yaronskaya/sourcerer-app.git\")\n .setDirectory(File(forkedRepoPath))\n .call()\n val original = Git.cloneRepository()\n .setURI(\"https://github.com/sourcerer-io/sourcerer-app.git\")\n .setDirectory(File(originalRepoPath))\n .call()\n val forkedLocalRepo = LocalRepo(forkedRepoPath)\n val originalLocalRepo = LocalRepo(originalRepoPath)\n\n val forkedRepoRehash = getRepoRehash(forked, forkedLocalRepo)\n val originalRepoRehash = getRepoRehash(original, originalLocalRepo)\n\n it(\"assigns different hashes for the original and the forked repos\") {\n assertNotEquals(originalRepoRehash, forkedRepoRehash)\n }\n\n forked.repository.close()\n forked.close()\n original.repository.close()\n original.close()\n }\n\n given(\"lost server\") {\n repo.commits = listOf(getLastCommit(git))\n\n val errors = mutableListOf()\n val mockApi = MockApi(mockRepo = repo)\n\n // Add some commits.\n val addedCommits = mutableListOf()\n for (i in 0..3) {\n val message = \"Created $i by author.\"\n val revCommit = git.commit().setMessage(message).call()\n addedCommits.add(Commit(revCommit))\n }\n\n // Remove one commit from server history.\n val removedCommit = addedCommits.removeAt(1)\n repo.commits = addedCommits.toList().asReversed()\n\n val observable = CommitCrawler.getObservable(gitHasher, repo)\n CommitHasher(repo, mockApi, repo.commits.map {it.rehash}, emails)\n .updateFromObservable(observable, { e -> errors.add(e) })\n\n it (\"has no errors\") {\n assertEquals(0, errors.size)\n }\n\n it(\"adds posts one commit as added and received commit is lost one\") {\n assertEquals(1, mockApi.receivedAddedCommits.size)\n assertEquals(removedCommit, mockApi.receivedAddedCommits.last())\n }\n\n it(\"doesn't posts deleted commits\") {\n assertEquals(0, mockApi.receivedDeletedCommits.size)\n }\n }*/\n\n given(\"commits with syntax stats\") {\n\n val lines = listOf(\"x = [i**2 for i in range(9999)]\", \"def fn()\", \"x \" +\n \"= 1\",\n \"x = map(lambda x: x**2, range(9999))\",\n \"x = map(lambda x: x**2, map(lambda x: x**3, range(10))\",\n \"x = map(lambda x: x**2, range(10)),\" +\n \"map(lambda x: x**3, range(10)))\")\n\n val author = Author(userName, userEmail)\n\n val testRepoPath = \"../testrepo-commit-hasher-\"\n val testRepo = TestRepo(testRepoPath + \"python-facts\")\n\n val mockApi = MockApi(mockRepo = repo)\n val observable = CommitCrawler.getObservable(testRepo.git, repo)\n\n it(\"sends stats\") {\n for (i in 0..lines.size - 1) {\n val line = lines[i]\n val fileName = \"file$i.py\"\n testRepo.createFile(fileName, listOf(line))\n testRepo.commit(message = \"$line in $fileName\", author = author)\n }\n\n val errors = mutableListOf()\n\n val rehashes = (0..lines.size - 1).map { \"r$it\" }\n\n CommitHasher(repo, mockApi, rehashes, emails)\n .updateFromObservable(observable, { e -> errors.add(e) })\n\n assertEquals(0, errors.size)\n\n val syntaxStats = mockApi.receivedAddedCommits\n .fold(mutableListOf()) { allStats, commit ->\n allStats.addAll(commit.stats)\n allStats\n }.filter { it.type == ExtractorInterface.TYPE_SYNTAX }\n\n val mapStats = syntaxStats.filter { it.tech == \"python>map\" }\n val listStats = syntaxStats.filter { it.tech == \"python>list\" }\n assertEquals(3, mapStats.size)\n assertEquals(1, listStats.size)\n assertEquals(5, mapStats.map { it.numLinesAdded }.sum())\n assertEquals(0, mapStats.map { it.numLinesDeleted }.sum())\n\n assertEquals(1, listStats.map { it.numLinesAdded }.sum())\n assertEquals(0, listStats.map { it.numLinesDeleted }.sum())\n }\n\n afterGroup {\n testRepo.destroy()\n }\n }\n\n given(\"cpp repo\") {\n val testRepo = TestRepo(\"../testrepo-commit-hasher-cpp-stats\")\n val lines = listOf(\"#include \",\n \"template \",\n \"struct Play {\",\n \" using type = cons, xs...>>;\", \"};\",\n \" template\")\n\n val author = Author(userName, userEmail)\n\n val mockApi = MockApi(mockRepo = repo)\n val observable = CommitCrawler.getObservable(testRepo.git, repo)\n\n it(\"sends stats\") {\n for (i in 0..lines.size - 1) {\n val line = lines[i]\n val fileName = \"file$i.cpp\"\n testRepo.createFile(fileName, listOf(line))\n testRepo.commit(message = \"$line in $fileName\", author = author)\n }\n\n val errors = mutableListOf()\n\n val rehashes = (0..lines.size - 1).map { \"r$it\" }\n\n CommitHasher(repo, mockApi, rehashes, emails)\n .updateFromObservable(observable, { e -> errors.add(e) })\n\n assertEquals(0, errors.size)\n\n val syntaxStats = mockApi.receivedAddedCommits\n .fold(mutableListOf()) { allStats, commit ->\n allStats.addAll(commit.stats)\n allStats\n }.filter { it.type == ExtractorInterface.TYPE_SYNTAX }\n\n val templateStats = syntaxStats.filter { it.tech == \"cpp>template\" }\n assertEquals(2, templateStats.size)\n assertEquals(2, templateStats.map { it.numLinesAdded }.sum())\n assertEquals(0, templateStats.map { it.numLinesDeleted }.sum())\n }\n\n }\n given(\"commits with svelte files\") {\n val lines = listOf(\"line 1\", \"line 2\")\n\n val author = Author(userName, userEmail)\n\n val testRepoPath = \"../testrepo-extractor-\"\n val testRepo = TestRepo(testRepoPath + \"svelte\")\n\n val mockApi = MockApi(mockRepo = repo)\n val observable = CommitCrawler.getObservable(testRepo.git, repo)\n\n it(\"sends stats\") {\n for (i in 0..lines.size - 1) {\n val line = lines[i]\n val fileName = \"file$i.svelte\"\n testRepo.createFile(fileName, listOf(line))\n testRepo.commit(message = \"$line in $fileName\", author = author)\n }\n\n val errors = mutableListOf()\n\n val rehashes = (0..lines.size - 1).map { \"r$it\" }\n\n CommitHasher(repo, mockApi, rehashes, emails)\n .updateFromObservable(observable, { e -> errors.add(e) })\n\n assertEquals(0, errors.size)\n\n val syntaxStats = mockApi.receivedAddedCommits\n .fold(mutableListOf()) { allStats, commit ->\n allStats.addAll(commit.stats)\n allStats\n }.filter { it.type == ExtractorInterface.TYPE_LIBRARY }\n\n val svelteStats = syntaxStats.filter { it.tech == \"js.svelte\" }\n assertEquals(2, svelteStats.size)\n assertEquals(2, svelteStats.map { it.numLinesAdded }.sum())\n assertEquals(0, svelteStats.map { it.numLinesDeleted }.sum())\n }\n\n afterGroup {\n testRepo.destroy()\n }\n }\n\n given(\"commits with quasar files\") {\n val lines = listOf(\"module.exports = function (ctx) { }\")\n\n val author = Author(userName, userEmail)\n\n val testRepoPath = \"../testrepo-extractor-\"\n val testRepo = TestRepo(testRepoPath + \"quasar\")\n\n val mockApi = MockApi(mockRepo = repo)\n val observable = CommitCrawler.getObservable(testRepo.git, repo)\n\n it(\"sends stats\") {\n val fileName = \"quasar.conf.js\"\n testRepo.createFile(fileName, lines)\n testRepo.commit(message = \"add quasar config\", author = author)\n\n val errors = mutableListOf()\n\n val rehashes = (0..lines.size - 1).map { \"r$it\" }\n\n CommitHasher(repo, mockApi, rehashes, emails)\n .updateFromObservable(observable, { e -> errors.add(e) })\n\n assertEquals(0, errors.size)\n\n val syntaxStats = mockApi.receivedAddedCommits\n .fold(mutableListOf()) { allStats, commit ->\n allStats.addAll(commit.stats)\n allStats\n }.filter { it.type == ExtractorInterface.TYPE_LIBRARY }\n\n val quasarStats = syntaxStats.filter { it.tech == \"js.quasar\" }\n assertEquals(1, quasarStats.size)\n assertEquals(1, quasarStats.map { it.numLinesAdded }.sum())\n assertEquals(0, quasarStats.map { it.numLinesDeleted }.sum())\n }\n\n afterGroup {\n testRepo.destroy()\n }\n }\n\n given(\"commits with typescript files\") {\n val lines = listOf(\"new Vue({\", \"line 2\")\n\n val author = Author(userName, userEmail)\n\n val testRepoPath = \"../testrepo-extractor-\"\n val testRepo = TestRepo(testRepoPath + \"typescript\")\n\n val mockApi = MockApi(mockRepo = repo)\n val observable = CommitCrawler.getObservable(testRepo.git, repo)\n\n it(\"sends stats\") {\n for (i in 0..lines.size - 1) {\n val line = lines[i]\n val fileName = \"file$i.ts\"\n testRepo.createFile(fileName, listOf(line))\n testRepo.commit(message = \"$line in $fileName\", author = author)\n }\n\n val errors = mutableListOf()\n\n val rehashes = (0..lines.size - 1).map { \"r$it\" }\n\n CommitHasher(repo, mockApi, rehashes, emails)\n .updateFromObservable(observable, { e -> errors.add(e) })\n\n assertEquals(0, errors.size)\n\n val stats = mockApi.receivedAddedCommits\n .fold(mutableListOf()) { allStats, commit ->\n allStats.addAll(commit.stats)\n allStats\n }\n val languageStats = stats.filter { it.type == ExtractorInterface.TYPE_LANGUAGE }\n val techStats = stats.filter { it.type == ExtractorInterface.TYPE_LIBRARY }\n assertEquals(2, languageStats.size)\n languageStats.forEach { stat ->\n assertEquals(\"typescript\", stat.tech)\n }\n assertEquals(1, techStats.map { it.numLinesAdded }.sum())\n techStats.forEach { stat ->\n assertEquals(\"js.vue\", stat.tech)\n }\n }\n\n afterGroup {\n testRepo.destroy()\n }\n }\n\n given(\"commits with scss stats\") {\n\n val lines = listOf(\"first line in css file\", \"\",\n \"third line in css file\")\n\n val author = Author(userName, userEmail)\n\n val testRepoPath = \"../testrepo-extractor-\"\n val testRepo = TestRepo(testRepoPath + \"css\")\n\n val mockApi = MockApi(mockRepo = repo)\n val observable = CommitCrawler.getObservable(testRepo.git, repo)\n\n it(\"sends stats\") {\n for (i in 0..lines.size - 1) {\n val line = lines[i]\n val fileName = \"file$i.scss\"\n testRepo.createFile(fileName, listOf(line))\n testRepo.commit(message = \"$line in $fileName\", author = author)\n }\n\n val errors = mutableListOf()\n\n val rehashes = (0..lines.size - 1).map { \"r$it\" }\n\n CommitHasher(repo, mockApi, rehashes, emails)\n .updateFromObservable(observable, { e -> errors.add(e) })\n\n assertEquals(0, errors.size)\n\n val syntaxStats = mockApi.receivedAddedCommits\n .fold(mutableListOf()) { allStats, commit ->\n allStats.addAll(commit.stats)\n allStats\n }.filter { it.type == ExtractorInterface.TYPE_LIBRARY }\n\n val scssStats = syntaxStats.filter { it.tech == \"scss\" }\n assertEquals(2, scssStats.size)\n assertEquals(2, scssStats.map { it.numLinesAdded }.sum())\n assertEquals(0, scssStats.map { it.numLinesDeleted }.sum())\n }\n\n afterGroup {\n testRepo.destroy()\n }\n }\n\n given(\"commit with multiple authors\") {\n val lines = listOf(\"line 1\", \"line 2\", \"line 3\", \"line 4\")\n\n val author1 = Author(userName, userEmail)\n val author2 = Author(secondUserName, secondUserEmail)\n\n val testRepoPath = \"../testrepo-multiple-authors\"\n val testRepo = TestRepo(testRepoPath)\n\n val mockApi = MockApi(mockRepo = repo)\n\n it(\"sends stats\") {\n for (i in 0..lines.size - 1) {\n val line = lines[i]\n val fileName = \"file$i.ext\"\n testRepo.createFile(fileName, listOf(line))\n val message = \"$line in $fileName\\n\\nCo-authored-by: ${author2\n .name} <${author2.email}>\"\n testRepo.commit(message = message, author = author1)\n }\n val gitHasherIn = Git.open(File(testRepoPath))\n val jgitObservable = CommitCrawler.getJGitObservable(gitHasherIn,\n extractCoauthors = true)\n val observable = CommitCrawler.getObservable(gitHasherIn,\n jgitObservable, repo)\n\n val errors = mutableListOf()\n\n val rehashes = (0..lines.size - 1).map { \"r$it\" }\n\n CommitHasher(repo, mockApi, rehashes, emails)\n .updateFromObservable(observable, { e -> errors.add(e) })\n\n assertEquals(0, errors.size)\n\n val stats = mockApi.receivedAddedCommits\n val actualAuthors = stats.map { it.author }.toHashSet()\n assertEquals(2, actualAuthors.size)\n assertTrue(author1 in actualAuthors)\n assertTrue(author2 in actualAuthors)\n }\n }\n\n cleanRepos()\n})\n" }, { "path": "src/test/kotlin/test/tests/hashers/FactHasherTest.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n\npackage test.tests.hashers\n\nimport app.FactCodes\nimport app.api.MockApi\nimport app.hashers.CommitCrawler\nimport app.hashers.FactHasher\nimport app.model.Author\nimport app.model.Fact\nimport app.model.Repo\nimport org.jetbrains.spek.api.Spek\nimport org.jetbrains.spek.api.dsl.given\nimport org.jetbrains.spek.api.dsl.it\nimport test.utils.TestRepo\nimport test.utils.assertFactDouble\nimport test.utils.assertFactInt\nimport java.util.*\nimport kotlin.test.assertEquals\nimport kotlin.test.assertTrue\n\nclass FactHasherTest : Spek({\n val authorEmail1 = \"test1@domain.com\"\n val authorEmail2 = \"test2@domain.com\"\n val author1 = Author(\"Test1\", authorEmail1)\n val author2 = Author(\"Test2\", authorEmail2)\n\n val repoPath = \"../testrepo-fact-hasher-\"\n val repo = Repo(rehash = \"rehash\", commits = listOf())\n\n fun createDate(year: Int = 2017, month: Int = 1, day: Int = 1,\n hour: Int = 0, minute: Int = 0, seconds: Int = 0): Date {\n val cal = Calendar.getInstance()\n // Month in calendar is 0-based.\n cal.set(year, month - 1, day, hour, minute, seconds)\n return cal.time\n }\n\n given(\"commits for date facts\") {\n val testRepo = TestRepo(repoPath + \"date-facts\")\n val emails = hashSetOf(authorEmail1, authorEmail2)\n val mockApi = MockApi(mockRepo = repo)\n val facts = mockApi.receivedFacts\n\n afterEachTest {\n facts.clear()\n }\n\n it(\"sends initial facts\") {\n testRepo.createFile(\"test1.txt\", listOf(\"line1\", \"line2\"))\n testRepo.commit(message = \"initial commit\",\n author = author1,\n date = createDate(year = 2017, month = 1, day = 1, // Sunday.\n hour = 13, minute = 0, seconds = 0))\n\n val errors = mutableListOf()\n val observable = CommitCrawler.getObservable(testRepo.git, repo)\n FactHasher(repo, mockApi, listOf(\"r1\"), emails)\n .updateFromObservable(observable, { e -> errors.add(e) })\n\n assertEquals(0, errors.size)\n assertTrue(facts.contains(Fact(repo, FactCodes.COMMIT_DAY_TIME, 13,\n \"1\", author1)))\n assertTrue(facts.contains(Fact(repo, FactCodes.COMMIT_DAY_WEEK, 6,\n \"1\", author1)))\n }\n\n it(\"sends more facts\") {\n testRepo.createFile(\"test2.txt\", listOf(\"line1\", \"line2\"))\n testRepo.commit(message = \"second commit\",\n author = author2,\n date = createDate(year=2017, month = 1, day = 2, // Monday.\n hour = 18, minute = 0, seconds = 0))\n\n testRepo.createFile(\"test3.txt\", listOf(\"line1\", \"line2\"))\n testRepo.commit(message = \"third commit\",\n author = author1,\n date = createDate(year=2017, month = 1, day = 2, // Monday.\n hour = 13, minute = 0, seconds = 0))\n\n val errors = mutableListOf()\n val observable = CommitCrawler.getObservable(testRepo.git, repo)\n FactHasher(repo, mockApi, listOf(\"r1\", \"r2\"), emails)\n .updateFromObservable(observable, { e -> errors.add(e) })\n\n assertEquals(0, errors.size)\n assertTrue(facts.contains(Fact(repo, FactCodes.COMMIT_DAY_TIME, 18,\n \"1\", author2)))\n assertTrue(facts.contains(Fact(repo, FactCodes.COMMIT_DAY_WEEK, 0,\n \"1\", author2)))\n assertTrue(facts.contains(Fact(repo, FactCodes.COMMIT_DAY_TIME, 13,\n \"2\", author1)))\n assertTrue(facts.contains(Fact(repo, FactCodes.COMMIT_DAY_WEEK, 0,\n \"1\", author1)))\n }\n\n afterGroup {\n testRepo.destroy()\n }\n }\n\n given(\"test of repo facts\") {\n val testRepo = TestRepo(repoPath + \"repo-facts\")\n val emails = hashSetOf(authorEmail1, authorEmail2)\n val mockApi = MockApi(mockRepo = repo)\n val facts = mockApi.receivedFacts\n\n afterEachTest {\n facts.clear()\n }\n\n it(\"sends facts\") {\n val startAuthor1 = createDate(year = 2016, month = 2, day = 10,\n hour = 13, minute = 0, seconds = 0)\n val midAuthor1 = createDate(year = 2016, month = 10, day = 5,\n hour = 10, minute = 0, seconds = 0)\n val startAuthor2 = createDate(year = 2017, month = 1, day = 1,\n hour = 12, minute = 10, seconds = 10)\n val midAuthor2 = createDate(year = 2017, month = 2, day = 2,\n hour = 15, minute = 0, seconds = 0)\n val endAuthor1 = createDate(year = 2017, month = 4, day = 5,\n hour = 13, minute = 0, seconds = 0)\n val endAuthor2 = createDate(year = 2017, month = 5, day = 15,\n hour = 15, minute = 0, seconds = 0)\n\n testRepo.createFile(\"test1.txt\", listOf(\"line1\", \"line2\"))\n testRepo.commit(message = \"author1 -> start\",\n author = author1,\n date = startAuthor1)\n\n testRepo.insertLines(\"test1.txt\", 0, listOf(\"line3\"))\n testRepo.commit(message = \"author1 -> mid\",\n author = author1,\n date = midAuthor1)\n\n testRepo.createFile(\"test2.txt\", listOf(\"line4\"))\n testRepo.commit(message = \"author2 -> start\",\n author = author2,\n date = startAuthor2)\n\n testRepo.insertLines(\"test2.txt\", 0, listOf(\"line5\"))\n testRepo.commit(message = \"author2 -> mid\",\n author = author2,\n date = midAuthor2)\n\n testRepo.insertLines(\"test1.txt\", 0, listOf(\"line6\"))\n testRepo.commit(message = \"author1 -> end\",\n author = author1,\n date = endAuthor1)\n\n testRepo.insertLines(\"test2.txt\", 0, listOf(\"line7\"))\n testRepo.commit(message = \"author2 -> end\",\n author = author2,\n date = endAuthor2)\n\n val errors = mutableListOf()\n val observable = CommitCrawler.getObservable(testRepo.git, repo)\n FactHasher(repo, mockApi,\n listOf(\"r1\", \"r2\", \"r3\", \"r4\", \"r5\", \"r6\"), emails)\n .updateFromObservable(observable, { e -> errors.add(e) })\n\n assertEquals(0, errors.size)\n assertTrue(facts.contains(Fact(repo, FactCodes.REPO_DATE_START, 0,\n (startAuthor1.time/1000).toString(), author1)))\n assertTrue(facts.contains(Fact(repo, FactCodes.REPO_DATE_START, 0,\n (startAuthor2.time/1000).toString(), author2)))\n assertTrue(facts.contains(Fact(repo, FactCodes.REPO_DATE_END, 0,\n (endAuthor1.time/1000).toString(), author1)))\n assertTrue(facts.contains(Fact(repo, FactCodes.REPO_DATE_END, 0,\n (endAuthor2.time/1000).toString(), author2)))\n }\n\n afterGroup {\n testRepo.destroy()\n }\n }\n\n given(\"test of commit facts\") {\n val testRepo = TestRepo(repoPath + \"commit-facts\")\n val emails = hashSetOf(authorEmail1, authorEmail2)\n val mockApi = MockApi(mockRepo = repo)\n val facts = mockApi.receivedFacts\n val lines = listOf(\n \"All my rap, if shortly, is about the thing that\",\n \"For so many years so many cities have been under hoof\",\n \"To go uphill when gets lucky. Then downhill when feels sick\",\n \"I'm not really a Gulliver, but still the city is under hoof\",\n \"City under hoof, city under hoof\",\n \"Traffic lights, state duties, charges and customs\",\n \"I don't know whether this path is wade or to the bottom\",\n \"You live under a thumb, I have a city under my hoof\",\n \"All my rap, if shortly, is about the thing that\",\n \"For so many years so many cities have been under hoof\",\n \"To go uphill when gets lucky. Then downhill when feels sick\",\n \"I'm not really a Gulliver, but still the city is under hoof\",\n \"City under hoof, city under hoof\",\n \"Traffic lights, state duties, charges and customs\",\n \"I don't know whether this path is wade or to the bottom\",\n \"You live under a thumb, I have a city under my hoof\",\n \"All my rap, if shortly, is about the thing that\",\n \"For so many years so many cities have been under hoof\",\n \"To go uphill when gets lucky. Then downhill when feels sick\",\n \"I'm not really a Gulliver, but still the city is under hoof\",\n \"City under hoof, city under hoof\",\n \"Traffic lights, state duties, charges and customs\",\n \"I don't know whether this path is wade or to the bottom\",\n \"You live under a thumb, I have a city under my hoof\"\n )\n val linesLenAvg = lines.fold (0) { acc, s -> acc + s.length } /\n lines.size.toDouble()\n\n afterEachTest {\n facts.clear()\n }\n\n it(\"sends facts\") {\n testRepo.createFile(\"test1.txt\", listOf())\n\n testRepo.insertLines(\"test1.txt\", 0, lines.subList(0, 3))\n testRepo.commit(message = \"Commit 1\", author = author1)\n\n testRepo.insertLines(\"test1.txt\", 0, lines.subList(3, 6))\n testRepo.commit(message = \"Commit 2\", author = author1)\n\n testRepo.insertLines(\"test1.txt\", 0, lines.subList(6, 9))\n testRepo.commit(message = \"Commit 3\", author = author1)\n\n testRepo.insertLines(\"test1.txt\", 0, lines.subList(9, 12))\n testRepo.commit(message = \"Commit 4\", author = author1)\n\n testRepo.insertLines(\"test1.txt\", 0, lines.subList(12, 16))\n testRepo.commit(message = \"Commit 5\", author = author1)\n\n testRepo.insertLines(\"test1.txt\", 0, lines.subList(16, 24))\n testRepo.commit(message = \"Commit 6\", author = author1)\n\n val errors = mutableListOf()\n val observable = CommitCrawler.getObservable(testRepo.git, repo)\n FactHasher(repo, mockApi,\n listOf(\"r1\", \"r2\", \"r3\", \"r4\", \"r5\", \"r6\"), emails)\n .updateFromObservable(observable, { e -> errors.add(e) })\n\n assertEquals(0, errors.size)\n assertFactInt(FactCodes.COMMIT_NUM, 0, 6, author1, facts)\n assertFactDouble(FactCodes.COMMIT_LINE_NUM_AVG, 0, 4.0, author1,\n facts)\n assertFactInt(FactCodes.LINE_NUM, 0, 24, author1, facts)\n assertFactDouble(FactCodes.LINE_LEN_AVG, 0, linesLenAvg, author1,\n facts)\n assertFactInt(FactCodes.COMMIT_NUM_TO_LINE_NUM, 3, 4, author1,\n facts)\n assertFactInt(FactCodes.COMMIT_NUM_TO_LINE_NUM, 4, 1, author1,\n facts)\n assertFactInt(FactCodes.COMMIT_NUM_TO_LINE_NUM, 8, 1, author1,\n facts)\n }\n\n afterGroup {\n testRepo.destroy()\n }\n }\n\n given(\"commits for naming convention facts\") {\n val testRepo = TestRepo(repoPath + \"file-facts\")\n val emails = hashSetOf(authorEmail1)\n val mockApi = MockApi(mockRepo = repo)\n val facts = mockApi.receivedFacts\n\n afterEachTest {\n facts.clear()\n }\n\n val lines = listOf(\"camelCase1\", \"camelCase2\", \"snake_case\", \"fn()\")\n\n it(\"sends facts\") {\n for (i in 0..lines.size - 1) {\n val line = lines[i]\n val fileName = \"file$i.txt\"\n testRepo.createFile(fileName, listOf(line))\n testRepo.commit(message = \"$line in $fileName\",\n author = author1)\n }\n\n val errors = mutableListOf()\n val observable = CommitCrawler.getObservable(testRepo.git, repo)\n val rehashes = (0..lines.size - 1).map { \"r$it\" }\n\n FactHasher(repo, mockApi, rehashes, emails)\n .updateFromObservable(observable, { e -> errors.add(e) })\n assertEquals(0, errors.size)\n\n assertFactInt(FactCodes.VARIABLE_NAMING,\n FactCodes.VARIABLE_NAMING_SNAKE_CASE, 1, author1, facts)\n assertFactInt(FactCodes.VARIABLE_NAMING,\n FactCodes.VARIABLE_NAMING_CAMEL_CASE, 2, author1, facts)\n assertFactInt(FactCodes.VARIABLE_NAMING,\n FactCodes.VARIABLE_NAMING_OTHER, 1, author1, facts)\n }\n\n afterGroup {\n testRepo.destroy()\n }\n }\n\n given(\"commits for indentation facts\") {\n val testRepo = TestRepo(repoPath + \"indentation-facts\")\n val emails = hashSetOf(authorEmail1)\n val mockApi = MockApi(mockRepo = repo)\n val facts = mockApi.receivedFacts\n\n afterEachTest {\n facts.clear()\n }\n\n val lines = listOf(\"\\tdef test()\", \"\\t\\tdef fn()\", \"a b c d\", \" \",\n \" def fn()\")\n\n it(\"sends facts\") {\n for (i in 0..lines.size - 1) {\n val line = lines[i]\n val fileName = \"file$i.txt\"\n testRepo.createFile(fileName, listOf(line))\n testRepo.commit(message = \"$line in $fileName\",\n author = author1)\n }\n\n val errors = mutableListOf()\n val observable = CommitCrawler.getObservable(testRepo.git, repo)\n val rehashes = (0..lines.size - 1).map { \"r$it\" }\n\n FactHasher(repo, mockApi, rehashes, emails)\n .updateFromObservable(observable, { e -> errors.add(e) })\n assertEquals(0, errors.size)\n\n assertFactInt(FactCodes.INDENTATION,\n FactCodes.INDENTATION_TABS, 2, author1, facts)\n assertFactInt(FactCodes.INDENTATION,\n FactCodes.INDENTATION_SPACES, 1, author1, facts)\n }\n\n afterGroup {\n testRepo.destroy()\n }\n }\n})\n" }, { "path": "src/test/kotlin/test/tests/hashers/IgnorePathsTest.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Alexander Surkov (alex@sourcerer.io)\n\npackage test.tests.hashers\n\nimport app.api.MockApi\nimport app.extractors.ExtractorInterface\nimport app.hashers.CommitHasher\nimport app.hashers.CommitCrawler\nimport app.model.*\nimport org.jetbrains.spek.api.Spek\nimport org.jetbrains.spek.api.dsl.given\nimport org.jetbrains.spek.api.dsl.it\nimport test.utils.TestRepo\nimport kotlin.test.assertEquals\n\nclass IgnorePathsTest : Spek({\n fun cleanRepos() {\n Runtime.getRuntime().exec(\"src/test/delete_repo.sh\").waitFor()\n }\n\n val userName = \"Contributor\"\n val userEmail = \"test@domain.com\"\n\n // Creation of test repo.\n cleanRepos()\n\n given(\"commits with syntax stats\") {\n val lines = listOf(\"x = [i**2 for i range(9999)]\", \"def fn()\", \"x = 1\",\n \"x = map(lambda x: x**2, range(9999))\",\n \"x = map(lambda x: x**2, map(lambda x: x**3, range(10))\",\n \"x = map(lambda x: x**2, range(10)),\" +\n \"map(lambda x: x**3, range(10)))\")\n\n val author = Author(userName, userEmail)\n val emails = hashSetOf(userEmail)\n\n val testRepoPath = \"../IgnorePaths_t1\"\n val testRepo = TestRepo(testRepoPath)\n\n val testRehash = \"rehash_IgnorePaths_t1\"\n val serverRepo = Repo(rehash = testRehash)\n\n val mockApi = MockApi(mockRepo = serverRepo)\n val observable = CommitCrawler.getObservable(testRepo.git, serverRepo)\n\n it(\"t1\") {\n testRepo.createFile(\"test.py\", lines)\n testRepo.commit(message = \"commit1\", author = author)\n\n testRepo.createFile(\"ignore.py\", lines)\n testRepo.commit(message = \"commit2\", author = author)\n\n // Add config, ignore.py from previous commit should be\n // ignored for stats.\n testRepo.createFile(\".sourcerer-conf\",\n listOf(\"[ignore]\", \"ignore.py\", \"#test.py\"))\n testRepo.commit(message = \"commit3\", author = author)\n\n // Uncomment test.py file in config and delete it. The change\n // should be ignored for statistics.\n testRepo.deleteLines(\".sourcerer-conf\", 1, 1)\n testRepo.insertLines(\".sourcerer-conf\", 1, listOf(\"test.py\"))\n testRepo.commit(message = \"commit4\", author = author)\n\n testRepo.deleteFile(\"test.py\")\n testRepo.commit(message = \"commit5\", author = author)\n\n val errors = mutableListOf()\n CommitHasher(serverRepo, mockApi, listOf(\"rehashes\"), emails)\n .updateFromObservable(observable, { e -> errors.add(e) })\n if (errors.size > 0) {\n println(errors[0].message)\n }\n assertEquals(0, errors.size)\n\n val syntaxStats = mockApi.receivedAddedCommits\n .fold(mutableListOf()) { allStats, commit ->\n allStats.addAll(commit.stats)\n allStats\n }.filter { it.type == ExtractorInterface.TYPE_SYNTAX }\n\n val mapStats = syntaxStats.filter { it.tech == \"python>map\" }\n assertEquals(1, mapStats.size)\n assertEquals(5, mapStats.map { it.numLinesAdded }.sum())\n assertEquals(0, mapStats.map { it.numLinesDeleted }.sum())\n }\n\n afterGroup {\n testRepo.destroy()\n }\n }\n\n cleanRepos()\n})\n" }, { "path": "src/test/kotlin/test/tests/hashers/IgnoreVendorsTest.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Alexander Surkov (alex@sourcerer.io)\n\npackage test.tests.hashers\n\nimport app.api.MockApi\nimport app.hashers.CommitHasher\nimport app.hashers.CommitCrawler\nimport app.model.*\nimport org.jetbrains.spek.api.Spek\nimport org.jetbrains.spek.api.dsl.given\nimport org.jetbrains.spek.api.dsl.it\nimport test.utils.TestRepo\nimport kotlin.test.assertEquals\n\nclass IgnoreVendorsTest : Spek({\n fun cleanRepos() {\n Runtime.getRuntime().exec(\"src/test/delete_repo.sh\").waitFor()\n }\n\n val userName = \"Contributor\"\n val userEmail = \"test@domain.com\"\n\n // Creation of test repo.\n cleanRepos()\n\n given(\"Ignove vendor files\") {\n val author = Author(userName, userEmail)\n val emails = hashSetOf(userEmail)\n\n val testRepoPath = \"../IgnoreVendors_t1\"\n val testRepo = TestRepo(testRepoPath)\n\n val testRehash = \"rehash_IgnoreVendors_t1\"\n val serverRepo = Repo(rehash = testRehash)\n\n val mockApi = MockApi(mockRepo = serverRepo)\n val observable = CommitCrawler.getObservable(testRepo.git, serverRepo)\n\n it(\"t1: JS\") {\n val lines = listOf(\n \"let i = 0\"\n )\n\n testRepo.createFile(\"lala.js\", lines)\n testRepo.createFile(\"pdf.worker.js\", lines)\n testRepo.commit(message = \"commit1\", author = author)\n\n val errors = mutableListOf()\n CommitHasher(serverRepo, mockApi, listOf(\"rehashes\"), emails)\n .updateFromObservable(observable, { e -> errors.add(e) })\n if (errors.size > 0) {\n println(errors[0].message)\n }\n assertEquals(0, errors.size)\n\n val mapStats = mockApi.receivedAddedCommits\n .fold(mutableListOf()) { allStats, commit ->\n allStats.addAll(commit.stats)\n allStats\n }\n\n assertEquals(1, mapStats.size)\n assertEquals(1, mapStats.map { it.numLinesAdded }.sum())\n assertEquals(0, mapStats.map { it.numLinesDeleted }.sum())\n }\n\n it(\"t2: ipynb files\") {\n val lines = \"\"\"{\n \"cells\": [\n {\n \"cell_type\": \"code\",\n \"execution_count\": 1,\n \"metadata\": {},\n \"outputs\": [\n {\n \"data\": {\n \"text/html\": [\n \"\"\n ],\n \"text/plain\": [\n \"\"\n ]\n },\n \"metadata\": {},\n \"output_type\": \"display_data\"\n }\n ],\n \"source\": [\n \"from IPython.core.display import display, HTML\",\n \"display(HTML(\\\"\\\"))\"\n ]\n }]}\"\"\".split(\"\\n\")\n\n testRepo.createFile(\"lala.ipynb\", lines)\n testRepo.commit(message = \"commit with ipython\", author = author)\n\n val errors = mutableListOf()\n CommitHasher(serverRepo, mockApi, listOf(\"rehashes\"), emails)\n .updateFromObservable(observable, { e -> errors.add(e) })\n assertEquals(0, errors.size)\n\n val stats = mockApi.receivedAddedCommits\n .fold(mutableListOf()) { allStats, commit ->\n allStats.addAll(commit.stats)\n allStats\n }\n\n assertEquals(3, stats.size)\n assertEquals(4, stats.map { it.numLinesAdded }.sum())\n assertEquals(0, stats.map { it.numLinesDeleted }.sum())\n }\n\n afterGroup {\n testRepo.destroy()\n }\n }\n\n cleanRepos()\n})\n" }, { "path": "src/test/kotlin/test/tests/hashers/MetaHasherTest.kt", "content": "// Copyright 2018 Sourcerer Inc. All Rights Reserved.\n// Author: Liubov Yaronskaya (lyaronskaya@sourcerer.io)\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage test.tests.hashers\n\nimport app.FactCodes\nimport app.api.MockApi\nimport app.hashers.MetaHasher\nimport app.model.Author\nimport app.model.Repo\nimport org.jetbrains.spek.api.Spek\nimport org.jetbrains.spek.api.dsl.given\nimport org.jetbrains.spek.api.dsl.it\nimport test.utils.TestRepo\nimport test.utils.assertFactInt\nimport test.utils.assertNoFact\n\nclass MetaHasherTest : Spek({\n val repoPath = \"../testrepo-meta-hasher-\"\n val repo = Repo(rehash = \"rehash\", commits = listOf())\n\n given(\"repo for team size fact\") {\n val testRepo = TestRepo(repoPath + \"team-size-fact\")\n val authors = hashSetOf(\n Author(\"Alexander Ivanov\", \"ivanov.alexander@gmail.com\"),\n Author(\"Maxim Zayac\", \"maxim95@sourcerer.io\"),\n Author(\"yablonskaya\", \"lyablonskaya@sourcerer.io\"),\n Author(\"Lubov Yablonskaya\", \"lyablonskaya@sourcerer.io\"),\n Author(\"Alexander Ivanov\", \"aleks@riseup.net\"),\n Author(\"Roman Romov\", \"roman.romov@gmail.com\"),\n Author(\"Liubov Yablonskaya\", \"lyablonskaya@sourcerer.io\"),\n Author(\"Taleh Yandex\", \"yandex007@ya.ru\"),\n Author(\"Maxim Zayac\", \"mak-zayac@yandex.ru\"),\n Author(\"Dmitry Yablokov\", \"dmitry.yablokov@gmail.com\"),\n Author(\"yablokov\", \"yablokov@phystech.edu\"),\n Author(\"Yablokov Dmitriy Andreevich\", \"d.yablokov@tinkoff.ru\"),\n Author(\"Dmitry Yablokov\", \"yablokov@phystech.edu\"),\n Author(\"Dmitry Yablokov\", \"yablokov@yandex-team.ru\"),\n Author(\"John Brown\", \"john@mail.mail\"),\n Author(\"Johnny Brown\", \"john123@mail.mail\"))\n val commits = hashMapOf(\n Pair(\"aleks@upupup.net\", 0),\n Pair(\"d.yablokov@tinkoff.ru\", 10),\n Pair(\"dmitry.yablokov@gmail.com\", 10),\n Pair(\"ivanov.alexander@gmail.com\", 10),\n Pair(\"john123@mail.mail\", 10),\n Pair(\"john@mail.mail\", 10),\n Pair(\"lyablonskaya@sourcerer.io\", 10),\n Pair(\"mak-zayac@yandex.ru\", 10),\n Pair(\"maxim95@sourcerer.io\", 10),\n Pair(\"roman.romov@gmail.com\", 10),\n Pair(\"yablokov@phystech.edu\", 10),\n Pair(\"yablokov@yandex-team.ru\", 20),\n Pair(\"yandex007@ya.ru\", 20)\n )\n val userEmails = listOf(\n \"john123@mail.mail\",\n \"john@mail.mail\"\n )\n val authorsList = authors.toList()\n val mockApi = MockApi(mockRepo = repo)\n val facts = mockApi.receivedFacts\n\n afterEachTest {\n facts.clear()\n }\n\n it(\"sends facts\") {\n for (i in 0..authors.size - 1) {\n val line = \"line number $i\"\n val fileName = \"file$i.txt\"\n testRepo.createFile(fileName, listOf(line))\n testRepo.commit(message = \"$line in $fileName\",\n author = authorsList[i])\n }\n\n MetaHasher(repo, mockApi).calculateAndSendFacts(authors, commits,\n userEmails)\n\n assertFactInt(FactCodes.COMMIT_SHARE, 0, 20,\n Author(email = userEmails.first()), facts = facts)\n assertFactInt(FactCodes.COMMIT_SHARE_REPO_AVG, 0, 20, facts = facts)\n assertFactInt(FactCodes.REPO_TEAM_SIZE, 0, 7, facts = facts)\n }\n\n it(\"sends facts (user not contributor)\") {\n for (i in 0..authors.size - 1) {\n val line = \"line number $i\"\n val fileName = \"file$i.txt\"\n testRepo.createFile(fileName, listOf(line))\n testRepo.commit(message = \"$line in $fileName\",\n author = authorsList[i])\n }\n\n MetaHasher(repo, mockApi).calculateAndSendFacts(authors, commits,\n listOf())\n\n assertNoFact(FactCodes.COMMIT_SHARE, 0,\n Author(email = userEmails.first()), facts = facts)\n assertFactInt(FactCodes.COMMIT_SHARE_REPO_AVG, 0, 20, facts = facts)\n assertFactInt(FactCodes.REPO_TEAM_SIZE, 0, 7, facts = facts)\n }\n\n afterGroup {\n testRepo.destroy()\n }\n }\n})\n" }, { "path": "src/test/kotlin/test/tests/utils/FileHelperTest.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Ryan Osilla (ryan@sourcerer.io)\n\npackage test.tests.utils\n\nimport org.jetbrains.spek.api.Spek\nimport org.jetbrains.spek.api.dsl.given\nimport org.jetbrains.spek.api.dsl.it\nimport kotlin.test.assertEquals\nimport app.utils.FileHelper.toPath\nimport java.nio.file.Paths\n\nfun testPath(expectedPath: String, actualPath: String) {\n assertEquals(Paths.get(expectedPath), actualPath.toPath())\n}\n\nclass FileHelperTest : Spek({\n given(\"relative path test\") {\n it(\"basic\") {\n val home = System.getProperty(\"user.home\")\n testPath(\"/Users/user/repo\", \"/Users/user/repo\")\n testPath(\"/Users/user/repo\", \"/Users/user/../user/repo/../repo\")\n testPath(\"$home/test\", \"~/test\")\n testPath(\"$home/test1\", \"~/test/../test1\")\n }\n }\n})\n" }, { "path": "src/test/kotlin/test/utils/FactHelper.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage test.utils\n\nimport app.model.Author\nimport app.model.Fact\nimport kotlin.test.assertEquals\nimport kotlin.test.assertNotNull\nimport kotlin.test.assertNull\nimport kotlin.test.assertTrue\n\nfun getFact(code: Int, key: Int, author: Author? = null,\n facts: List): Fact {\n val fact = facts.find { fact -> fact.code == code && fact.key == key &&\n (author == null || fact.author == author) }\n assertNotNull(fact)\n return fact!!\n}\n\nfun assertFactInt(code: Int, key: Int, value: Int, author: Author? = null,\n facts: List) {\n val fact = getFact(code, key, author, facts)\n assertEquals(value, fact.value.toInt())\n}\n\nfun assertNoFact(code: Int, key: Int, author: Author? = null,\n facts: List) {\n val fact = facts.find { fact -> fact.code == code && fact.key == key &&\n (author == null || fact.author == author) }\n assertNull(fact)\n}\n\nfun assertFactDouble(code: Int, key: Int, value: Double, author: Author? = null,\n facts: List) {\n val fact = getFact(code, key, author, facts)\n assertTrue(Math.abs(value - fact.value.toDouble()) < 0.1,\n \"Expected approximately <$value>, actual <${fact.value}>\")\n}\n" }, { "path": "src/test/kotlin/test/utils/TestRepo.kt", "content": "// Copyright 2017 Sourcerer Inc. All Rights Reserved.\n// Author: Alexander Surkov (alex@sourcerer.io)\n// Author: Anatoly Kislov (anatoly@sourcerer.io)\n\npackage test.utils\n\nimport app.model.Author\nimport java.io.BufferedReader\nimport java.io.BufferedWriter\nimport java.io.File\nimport java.io.FileReader\nimport java.io.FileWriter\nimport java.io.StringWriter\n\nimport org.eclipse.jgit.api.Git\nimport org.eclipse.jgit.lib.PersonIdent\nimport org.eclipse.jgit.revwalk.RevCommit\nimport java.util.*\n\n/**\n * A wrapper around Git repo allowing to add/remove/edit files and make commits.\n */\nclass TestRepo(val repoPath: String) {\n val userName = \"Contributor\"\n val userEmail = \"test@sourcerer.com\"\n\n val git = initGit()\n\n init {\n val config = git.repository.config\n config.setString(\"user\", null, \"name\", userName)\n config.setString(\"user\", null, \"email\", userEmail)\n config.save()\n }\n\n private fun initGit(): Git {\n destroy() // Remove repo directory if exists.\n return Git.init().setDirectory(File(repoPath)).call()\n }\n\n fun createFile(fileName: String, content: List) {\n val file = File(\"$repoPath/$fileName\")\n val writer = BufferedWriter(FileWriter(file))\n for (line in content) {\n writer.write(line)\n writer.newLine()\n }\n writer.close()\n git.add().addFilepattern(fileName).call();\n }\n\n fun deleteFile(fileName: String) {\n File(\"$repoPath/$fileName\").delete()\n }\n\n fun insertLines(fileName: String, insIndex: Int, insLines: List) {\n val file = File(\"$repoPath/$fileName\")\n val reader = BufferedReader(FileReader(file))\n\n val tmpStrWriter = StringWriter()\n val tmpWriter = BufferedWriter(tmpStrWriter)\n\n var lineIdx = 0\n for (line in reader.lines()) {\n // Insertion case\n if (lineIdx == insIndex) {\n for (insLine in insLines) {\n tmpWriter.write(insLine)\n tmpWriter.newLine()\n }\n }\n\n tmpWriter.write(line)\n tmpWriter.newLine()\n lineIdx++\n }\n\n // Append case\n if (lineIdx == insIndex) {\n for (insLine in insLines) {\n tmpWriter.write(insLine)\n tmpWriter.newLine()\n }\n }\n\n tmpWriter.flush()\n\n val writer = FileWriter(file)\n writer.write(tmpStrWriter.toString())\n writer.close()\n }\n\n fun deleteLines(fileName: String, startIndex: Int, endIndex: Int) {\n val file = File(\"$repoPath/$fileName\")\n val reader = BufferedReader(FileReader(file))\n\n val tmpStrWriter = StringWriter()\n val tmpWriter = BufferedWriter(tmpStrWriter)\n\n var lineIdx = 0\n for (line in reader.lines()) {\n if (lineIdx < startIndex || lineIdx > endIndex) {\n tmpWriter.write(line)\n tmpWriter.newLine() \n }\n lineIdx++\n }\n tmpWriter.flush()\n\n val writer = FileWriter(file)\n writer.write(tmpStrWriter.toString())\n writer.close()\n }\n\n fun commit(message: String,\n author: Author = Author(userName, userEmail),\n date: Date = Date(),\n timeZone: TimeZone = TimeZone.getDefault()): RevCommit {\n val personIdent = PersonIdent(author.name, author.email, date, timeZone)\n return git.commit().setMessage(message).setAll(true)\n .setAuthor(personIdent).setCommitter(personIdent).call()\n }\n\n fun destroy() {\n Runtime.getRuntime().exec(\"rm -r $repoPath\").waitFor()\n }\n}\n" }, { "path": "src/test/resources/samples/devops/circleci/.circleci/config.yml", "content": "version: 2\njobs:\n build:\n docker:\n - image: circleci/:\n steps:\n - checkout\n - run: \n test:\n docker:\n - image: circleci/:\n steps:\n - checkout\n - run: \nworkflows:\n version: 2\n build_and_test:\n jobs:\n - build\n - test\n" }, { "path": "src/test/resources/samples/devops/docker/Dockerfile", "content": "FROM python:3\nENV PYTHONUNBUFFERED 1\nRUN mkdir /code\nWORKDIR /code\nCOPY requirements.txt /code/\nRUN pip install -r requirements.txt\nCOPY . /code/\n" }, { "path": "src/test/resources/samples/devops/docker/alpine.Dockerfile", "content": "FROM alpine:3.4\n\nRUN apk update\nRUN apk add vim\nRUN apk add curl\n" }, { "path": "src/test/resources/samples/devops/docker/docker-compose.yml", "content": "version: '3'\n\nservices:\n db:\n image: postgres\n web:\n build: .\n command: python manage.py runserver 0.0.0.0:8000\n volumes:\n - .:/code\n ports:\n - \"8000:8000\"\n depends_on:\n - db\n" }, { "path": "src/test/resources/samples/devops/drone/.drone.yml", "content": "---\nkind: pipeline\nname: default\n\nplatform:\n os: linux\n arch: amd64\n\nsteps:\n- name: test\n image: alpine:3.8\n commands:\n - apk add curl\n - sleep 45\n - curl http://database:9200\n\nservices:\n- name: database\n image: elasticsearch:5-alpine\n ports:\n - 9200\n" }, { "path": "src/test/resources/samples/devops/github-actions/.github/workflows/ci.yml", "content": "name: Greet Everybody\n# This workflow is triggered on pushes to the repository.\non: [push]\n\njobs:\n build:\n # Job name is Greeting\n name: Greeting\n # This job runs on Linux\n runs-on: ubuntu-latest\n steps:\n # This step uses the hello-world-action stored in this workflow's repository.\n - uses: ./hello-world-action\n with:\n who-to-greet: 'Octocat'\n id: hello\n # This step prints the time.\n - run: echo \"The time was ${{ steps.hello.outputs.time }}\"\n" }, { "path": "src/test/resources/samples/devops/gitlab-ci/.gitlab-ci.yml", "content": "image: \"dev.gitlab.org:5005/gitlab/gitlab-build-images:ruby-2.6.3-golang-1.11-git-2.22-chrome-73.0-node-12.x-yarn-1.16-postgresql-9.6-graphicsmagick-1.3.29\"\n\nvariables:\n RAILS_ENV: \"test\"\n NODE_ENV: \"test\"\n SIMPLECOV: \"true\"\n GIT_DEPTH: \"20\"\n GIT_SUBMODULE_STRATEGY: \"none\"\n GET_SOURCES_ATTEMPTS: \"3\"\n KNAPSACK_RSPEC_SUITE_REPORT_PATH: knapsack/${CI_PROJECT_NAME}/rspec_report-master.json\n FLAKY_RSPEC_SUITE_REPORT_PATH: rspec_flaky/report-suite.json\n BUILD_ASSETS_IMAGE: \"false\"\n\nbefore_script:\n - date\n - source scripts/utils.sh\n - source scripts/prepare_build.sh\n - date\n\nafter_script:\n - date\n\nstages:\n - build\n - prepare\n - merge\n - test\n - review\n - qa\n - post-test\n - pages\n\ninclude:\n - local: .gitlab/ci/global.gitlab-ci.yml\n - local: .gitlab/ci/cng.gitlab-ci.yml\n - local: .gitlab/ci/docs.gitlab-ci.yml\n - local: .gitlab/ci/frontend.gitlab-ci.yml\n - local: .gitlab/ci/memory.gitlab-ci.yml\n - local: .gitlab/ci/pages.gitlab-ci.yml\n - local: .gitlab/ci/qa.gitlab-ci.yml\n - local: .gitlab/ci/reports.gitlab-ci.yml\n - local: .gitlab/ci/rails.gitlab-ci.yml\n - local: .gitlab/ci/review.gitlab-ci.yml\n - local: .gitlab/ci/setup.gitlab-ci.yml\n - local: .gitlab/ci/test-metadata.gitlab-ci.yml\n - local: .gitlab/ci/yaml.gitlab-ci.yml\n" }, { "path": "src/test/resources/samples/devops/jenkins/Jenkinsfile", "content": "node {\n\tstage 'Checkout'\n\t\tcheckout scm\n\n\tstage 'Build'\n\t\tbat 'nuget restore SolutionName.sln'\n\t\tbat \"\\\"${tool 'MSBuild'}\\\" SolutionName.sln /p:Configuration=Release /p:Platform=\\\"Any CPU\\\" /p:ProductVersion=1.0.0.${env.BUILD_NUMBER}\"\n\n\tstage 'Archive'\n\t\tarchive 'ProjectName/bin/Release/**'\n\n}\n" }, { "path": "src/test/resources/samples/devops/k8s/postgres-manifest.yaml", "content": "apiVersion: \"acid.zalan.do/v1\"\nkind: postgresql\nmetadata:\n name: acid-minimal-cluster\n namespace: default\nspec:\n teamId: \"ACID\"\n volume:\n size: 1Gi\n numberOfInstances: 2\n users:\n zalando: # database owner\n - superuser\n - createdb\n foo_user: [] # role for application foo\n databases:\n foo: zalando # dbname: owner\n postgresql:\n version: \"10\"\n" }, { "path": "src/test/resources/samples/devops/k8s/rss-site.json", "content": "{\n \"apiVersion\": \"v1\",\n \"kind\": \"Pod\",\n \"metadata\": {\n \"name\": \"rss-site\",\n \"labels\": {\n \"app\": \"web\"\n }\n },\n \"spec\": {\n \"containers\": [{\n \"name\": \"front-end\",\n \"image\": \"nginx\",\n \"ports\": [{\n \"containerPort\": \"80\"\n }]\n },\n {\n \"name\": \"rss-reader\",\n \"image\": \"nickchase/rss-php-nginx:v1\",\n \"ports\": [{\n \"containerPort\": \"88\"\n }]\n }]\n }\n}\n" }, { "path": "src/test/resources/samples/devops/k8s/rss-site.yml", "content": "apiVersion: \"v1\"\nkind: \"Pod\"\nmetadata:\n name: \"rss-site\"\n labels:\n app: \"web\"\nspec:\n containers:\n - name: \"front-end\"\n image: \"nginx\"\n ports:\n - containerPort\": \"80\"\n - name: \"rss-reader\"\n image: \"nickchase/rss-php-nginx:v1\"\n ports:\n - containerPort\": \"88\"\n" }, { "path": "src/test/resources/samples/devops/travis/.travis.yml", "content": "sudo: required\n\nlanguage: ruby\n\nservices:\n - docker\n\nbefore_install:\n - echo \"Testing Docker Hub credentials\"\n - docker login -e=$DOCKER_EMAIL -u=$DOCKER_USERNAME -p=$DOCKER_PASSWORD\n - echo \"Docker Hub credentials are working\"\n - docker build -t build-springxd-base .\n\nscript:\n - docker ps -a\n\nafter_success:\n - echo \"Test Success - Branch($TRAVIS_BRANCH) Pull Request($TRAVIS_PULL_REQUEST) Tag($TRAVIS_TAG)\"\n - if [[ \"$TRAVIS_BRANCH\" == \"master\" ]]; then echo -e \"Push Container to Docker Hub\"; fi\n - docker login -e=$DOCKER_EMAIL -u=$DOCKER_USERNAME -p=$DOCKER_PASSWORD\n - export REPO=jayjohnson/springxd-base\n - export TAG=`if [ \"$TRAVIS_BRANCH\" == \"master\" ]; then echo \"latest\"; else echo $TRAVIS_BRANCH ; fi`\n - docker build -f Dockerfile -t $REPO:$COMMIT .\n - docker tag $REPO:$COMMIT $REPO:$TAG\n - docker tag $REPO:$COMMIT $REPO:travis-$TRAVIS_BUILD_NUMBER\n - docker push $REPO\n" }, { "path": "src/test/resources/samples/langs/1C Enterprise/Catalog.ИсходящиеПисьма.Form.ФормаЭлемента.Form.Module.bsl", "content": "&НаСервереБезКонтекста\nФункция ПолучитьКонтактноеЛицоПоЭлектроннойПочте(ЭлектроннаяПочта)\n\tЗапрос = Новый Запрос;\n\tЗапрос.Текст = \"ВЫБРАТЬ КонтактноеЛицо ИЗ Справочник.Контрагенты ГДЕ ЭлектроннаяПочта = &ЭлектроннаяПочта\";\n\tЗапрос.Параметры.Вставить(\"ЭлектроннаяПочта\", СокрЛП(ЭлектроннаяПочта));\n\tВыборка = Запрос.Выполнить().Выбрать();\n\tКонтактноеЛицо = \"\";\n\tЕсли Выборка.Следующий() Тогда\n\t\tКонтактноеЛицо = Выборка.КонтактноеЛицо;\n\tКонецЕсли;\n\tВозврат КонтактноеЛицо;\nКонецФункции\n\n&НаСервереБезКонтекста\nФункция ПолучитьКонтактноеЛицоПоПолучателю(Получатель)\n\tЗапрос = Новый Запрос;\n\tЗапрос.Текст = \"ВЫБРАТЬ КонтактноеЛицо ИЗ Справочник.Контрагенты ГДЕ Ссылка = &Получатель\";\n\tЗапрос.Параметры.Вставить(\"Получатель\", Получатель);\n\tВыборка = Запрос.Выполнить().Выбрать();\n\tКонтактноеЛицо = \"\";\n\tЕсли Выборка.Следующий() Тогда\n\t\tКонтактноеЛицо = Выборка.КонтактноеЛицо;\n\tКонецЕсли;\n\tВозврат КонтактноеЛицо;\nКонецФункции\n\n&НаСервереБезКонтекста\nПроцедура ДобавитьПолучателей(Получатель, Получатели)\t\n\tЗапрос = Новый Запрос;\n\tЗапрос.Текст = \"ВЫБРАТЬ ЭлектроннаяПочта ИЗ Справочник.Контрагенты ГДЕ Ссылка \";\n\tЕсли ТипЗнч(Получатели) = Тип(\"Массив\") Тогда\n\t\tЗапрос.Текст = Запрос.Текст + \"В (&Получатели)\";\n\tИначе\n\t\tЗапрос.Текст = Запрос.Текст + \"= &Получатели\";\n\tКонецЕсли;\n\tЗапрос.Параметры.Вставить(\"Получатели\", Получатели);\n\tВыборка = Запрос.Выполнить().Выбрать();\n\tПока Выборка.Следующий() Цикл\n\t\tЕсли Получатель <> \"\" Тогда\n\t\t\tПолучатель = Получатель + \"; \";\n\t\tКонецЕсли;\n\t\tПолучатель = Получатель + Выборка.ЭлектроннаяПочта;\n\tКонецЦикла;\nКонецПроцедуры\n\n&НаСервере\nПроцедура ПриСозданииНаСервере(Отказ, СтандартнаяОбработка)\n\tЕсли Параметры.Ключ.Пустая() Тогда\n\t\tЗаголовок = \"Исходящее письмо (Создание)\";\n\t\tОбъект.Дата = ТекущаяДата();\n\t\tПоШаблону = Параметры.Свойство(\"ПоШаблону\");\n\t\tВходящееПисьмо = Параметры.ВходящееПисьмо;\n\t\tЕсли ПоШаблону = Истина Тогда\n\t\t\tЭлементы.ЗаполнитьПоШаблону.Видимость = Истина;\n\t\t\tРаботаСПочтой.ЗаполнитьПисьмоПоШаблону(Объект, Содержимое);\n\t\tИначеЕсли Не ВходящееПисьмо.Пустая() Тогда\n\t\t\tРаботаСПочтой.ЗаполнитьОтветНаПисьмо(ВходящееПисьмо, Объект, Содержимое);\n\t\tКонецЕсли;\n\t\tАдресаты = Параметры.Адресаты;\n\t\tЕсли Адресаты <> Неопределено Тогда\n\t\t\tЗапрос = Новый Запрос;\n\t\t\tЗапрос.Текст = \"ВЫБРАТЬ\n\t\t\t |\tКонтрагенты.ЭлектроннаяПочта\n\t\t\t |ИЗ\n\t\t\t |\tСправочник.Контрагенты КАК Контрагенты\n\t\t\t |ГДЕ\n\t\t\t |\tКонтрагенты.Ссылка В(&Адресаты)\n\t\t\t |\tИ Контрагенты.ЭлектроннаяПочта <> \"\"\"\"\";\n\t\t\tЗапрос.УстановитьПараметр(\"Адресаты\", Адресаты);\t\t\t \n\t\t\tПолучатель = \"\";\n\t\t\tВыборка = Запрос.Выполнить().Выбрать();\n\t\t\tПока Выборка.Следующий() Цикл\n\t\t\t\tЕсли Получатель <> \"\" Тогда\n\t\t\t\t\tПолучатель = Получатель + \"; \";\n\t\t\t\tКонецЕсли;\n\t\t\t\tПолучатель = Получатель + Выборка.ЭлектроннаяПочта;\n\t\t\tКонецЦикла;\n\t\t\tОбъект.Получатель = Получатель;\n\t\tКонецЕсли;\n\tКонецЕсли;\nКонецПроцедуры\n\n&НаСервере\nПроцедура ПриЧтенииНаСервере(ТекущийОбъект)\n\tСодержимое = ТекущийОбъект.Содержимое.Получить();\n\tЗаголовок = ТекущийОбъект.Наименование + \" (Исходящее письмо)\";\n\tЕсли РаботаСПочтой.ПисьмоОтправлено(ТекущийОбъект.Ссылка) Тогда\n\t\tЗаголовок = Заголовок + \" - Отправлено\";\n\tКонецЕсли;\nКонецПроцедуры\n\n&НаСервере\nПроцедура ПередЗаписьюНаСервере(Отказ, ТекущийОбъект, ПараметрыЗаписи)\n\tТекущийОбъект.Содержимое = Новый ХранилищеЗначения(Содержимое, Новый СжатиеДанных());\n\tТекущийОбъект.Текст = Содержимое.ПолучитьТекст();\nКонецПроцедуры\n\n&НаСервере\nФункция ОтправитьПисьмо(Ошибка)\n\tЕсли Не Записать() Тогда\n\t\tОшибка = \"ОшибкаЗаписи\";\n\t\tВозврат Ложь;\n\tКонецЕсли;\n\tЕсли Не РаботаСПочтой.ОтправитьПисьмо(Объект.Ссылка) Тогда\n\t\tОшибка = \"ОшибкаОтправки\";\n\t\tВозврат Ложь;\n\tКонецЕсли;\n\tЗаголовок = Заголовок + \" - Отправлено\";\n\tВозврат Истина;\nКонецФункции\n\n&НаКлиенте\nФункция ОтправитьПисьмоКлиент()\n\tОшибка = \"\";\n\tЕсли Не ОтправитьПисьмо(Ошибка) Тогда\n\t\tЕсли Ошибка = \"ОшибкаОтправки\" Тогда\n\t\t\tКнопки = Новый СписокЗначений;\n\t\t\tКнопки.Добавить(1, \"Настроить почту\");\n\t\t\tКнопки.Добавить(2, \"Закрыть\");\n\t\t\t\n\t\t\tОп = Новый ОписаниеОповещения(\n\t\t\t\t\"ОтправитьПисьмоКлиентВопросЗавершение\",\n\t\t\t\tЭтотОбъект);\n\t\t\tПоказатьВопрос(Оп,\n\t\t\t\t\"Не указаны настройки интернет почты!\", \n\t\t\t\tКнопки, , 1);\n\t\tКонецЕсли;\n\t\tВозврат Ложь;\n\tКонецЕсли;\n\t\n\tНавигационнаяСсылка = ПолучитьНавигационнуюСсылку(Объект.Ссылка);\n\tПоказатьОповещениеПользователя(\"Письмо отправлено\", НавигационнаяСсылка, Объект.Наименование);\n\tОповеститьОбИзменении(Объект.Ссылка);\n\tВозврат Истина;\nКонецФункции\n\n&НаКлиенте\nПроцедура ОтправитьПисьмоКлиентВопросЗавершение(Результат, Параметры) Экспорт\n\tЕсли Результат = 1 Тогда\n\t\tОткрытьФорму(\"ОбщаяФорма.НастройкаПочты\");\n\tКонецЕсли;\nКонецПроцедуры\n\n&НаКлиенте\nПроцедура Отправить(Команда)\n\tОтправитьПисьмоКлиент();\nКонецПроцедуры\n\n&НаКлиенте\nПроцедура ОтправитьИЗакрыть(Команда)\n\tЕсли Не ОтправитьПисьмоКлиент() Тогда\n\t\tВозврат;\n\tКонецЕсли;\n\tЗакрыть();\nКонецПроцедуры\n\n&НаКлиенте\nПроцедура ВставитьСтрокуВТекущуюПозицию(Поле, Документ, Строка)\n\tПерем Начало, Конец;\n\tПоле.ПолучитьГраницыВыделения(Начало, Конец);\n\tПозиция = Документ.ПолучитьПозициюПоЗакладке(Начало);\n\tДокумент.Удалить(Начало, Конец);\n\tНачало = Документ.ПолучитьЗакладкуПоПозиции(Позиция);\n\tДокумент.Вставить(Начало, Строка);\n\tПозиция = Позиция + СтрДлина(Строка);\n\tЗакладка = Документ.ПолучитьЗакладкуПоПозиции(Позиция);\n\tПоле.УстановитьГраницыВыделения(Закладка, Закладка);\nКонецПроцедуры\n\n&НаКлиенте\nПроцедура ВставитьКонтактноеЛицо(Команда)\n\tЕсли Объект.Контрагент.Пустая() Тогда\n\t\tСообщить(\"Выберите контрагента\");\n\tИначе\n\t\tКонтактноеЛицо = ПолучитьКонтактноеЛицоПоПолучателю(Объект.Контрагент);\n\t\tВставитьСтрокуВТекущуюПозицию(Элементы.Содержимое, Содержимое, КонтактноеЛицо + \" \");\n\tКонецЕсли;\t\nКонецПроцедуры\n\n&НаСервере\nПроцедура ПослеЗаписиНаСервере(ТекущийОбъект, ПараметрыЗаписи)\n\tЗаголовок = ТекущийОбъект.Наименование + \" (Исходящее письмо)\";\nКонецПроцедуры\n\n&НаКлиенте\nПроцедура КонтрагентПриИзменении(Элемент)\n\tДобавитьПолучателей(Объект.Получатель, Объект.Контрагент);\nКонецПроцедуры\n\n&НаКлиенте\nПроцедура ВыделитьВажное(Команда)\n\tПерем Начало, Конец;\n ВсеВажное = Истина;\n Элементы.Содержимое.ПолучитьГраницыВыделения(Начало, Конец);\n Если Начало = Конец Тогда\n Возврат;\n КонецЕсли;\n \n НаборТекстовыхЭлементов = Новый Массив();\n Для Каждого ТекстовыйЭлемент Из Содержимое.СформироватьЭлементы(Начало, Конец) Цикл\n Если Тип(ТекстовыйЭлемент) = Тип(\"ТекстФорматированногоДокумента\") Тогда\n НаборТекстовыхЭлементов.Добавить(ТекстовыйЭлемент); \n КонецЕсли; \n КонецЦикла;\n \n Для Каждого ТекстовыйЭлемент Из НаборТекстовыхЭлементов Цикл\n Если ТекстовыйЭлемент.Шрифт.Жирный <> Истина И\n ТекстовыйЭлемент.ЦветТекста <> Новый Цвет(255, 0, 0) Тогда\n ВсеВажное = Ложь;\n Прервать;\n КонецЕсли;\n КонецЦикла;\n \n Для Каждого ТекстовыйЭлемент Из НаборТекстовыхЭлементов Цикл\n ТекстовыйЭлемент.Шрифт = Новый Шрифт(ТекстовыйЭлемент.Шрифт, , , Не ВсеВажное);\n ТекстовыйЭлемент.ЦветТекста = Новый Цвет(?(ВсеВажное, 0, 255), 0, 0);\n КонецЦикла;\nКонецПроцедуры\n\n&НаКлиенте\nПроцедура ЗаполнитьПоШаблону(Команда)\n\tЕсли Объект.Контрагент.Пустая() Тогда\n\t\tСообщить(\"Выберите контрагента\");\n\tИначе\n\t\tНайтиИЗаменить(\"[Контрагент]\", Объект.Контрагент);\n\t\tНайтиИЗаменить(\"[КонтактноеЛицо]\", ПолучитьКонтактноеЛицоПоПолучателю(Объект.Контрагент));\n\tКонецЕсли;\n\tНайтиИЗаменить(\"[ДатаПисьма]\", Объект.Дата);\nКонецПроцедуры\n\n&НаКлиенте\nПроцедура НайтиИЗаменить(СтрокаДляПоиска, СтрокаДляЗамены)\n\tПерем ВставленныйТекст, ШрифтОформления, ЦветТекстаОформления, ЦветФонаОформления, НавигационнаяСсылкаОформления;\n\tРезультатПоиска = Содержимое.НайтиТекст(СтрокаДляПоиска);\n\tПока ((РезультатПоиска <> Неопределено) И (РезультатПоиска.ЗакладкаНачала <> Неопределено) И (РезультатПоиска.ЗакладкаКонца <> Неопределено)) Цикл\n\t\tПозицияНачалаСледующегоЦиклаПоиска = Содержимое.ПолучитьПозициюПоЗакладке(РезультатПоиска.ЗакладкаНачала) + СтрДлина(СтрокаДляЗамены);\n\t\tМассивЭлементовДляОформления = Содержимое.ПолучитьЭлементы(РезультатПоиска.ЗакладкаНачала, РезультатПоиска.ЗакладкаКонца);\n\t\tДля Каждого ЭлементДляОформления Из МассивЭлементовДляОформления Цикл\n\t\t\tЕсли Тип(ЭлементДляОформления) = Тип(\"ТекстФорматированногоДокумента\") Тогда\n\t\t\t\tШрифтОформления = ЭлементДляОформления.Шрифт;\n\t\t\t\tЦветТекстаОформления = ЭлементДляОформления.ЦветТекста;\n\t\t\t\tЦветФонаОформления = ЭлементДляОформления.ЦветФона;\n\t\t\t\tНавигационнаяСсылкаОформления = ЭлементДляОформления.НавигационнаяССылка;\n\t\t\t\tПрервать;\n\t\t\tКонецЕсли;\n\t\tКонецЦикла;\t\n\t\tСодержимое.Удалить(РезультатПоиска.ЗакладкаНачала, РезультатПоиска.ЗакладкаКонца);\n\t\tВставленныйТекст = Содержимое.Вставить(РезультатПоиска.ЗакладкаНачала, СтрокаДляЗамены);\n\t\tЕсли ВставленныйТекст <> Неопределено И ШрифтОформления <> Неопределено Тогда\n\t\t\tВставленныйТекст.Шрифт = ШрифтОформления;\n\t\tКонецЕсли;\n\t\tЕсли ВставленныйТекст <> Неопределено И ЦветТекстаОформления <> Неопределено Тогда\n\t\t\tВставленныйТекст.ЦветТекста = ЦветТекстаОформления;\n\t\tКонецЕсли;\n\t\tЕсли ВставленныйТекст <> Неопределено И ЦветФонаОформления <> Неопределено Тогда\n\t\t\tВставленныйТекст.ЦветФона = ЦветФонаОформления;\n\t\tКонецЕсли;\n\t\tЕсли ВставленныйТекст <> Неопределено И НавигационнаяСсылкаОформления <> Неопределено Тогда\n\t\t\tВставленныйТекст.НавигационнаяССылка = НавигационнаяСсылкаОформления;\n\t\tКонецЕсли;\n\t\t\n\t\tРезультатПоиска = Содержимое.НайтиТекст(СтрокаДляПоиска, Содержимое.ПолучитьЗакладкуПоПозиции(ПозицияНачалаСледующегоЦиклаПоиска));\n\tКонецЦикла;\nКонецПроцедуры\n\n" }, { "path": "src/test/resources/samples/langs/1C Enterprise/Catalog.Товары.Command.ПечатьПрайсЛиста.CommandModule.bsl", "content": "&НаСервере\nФункция ПечатнаяФорма(ПараметрКоманды)\n\tТабличныйДокумент = Новый ТабличныйДокумент;\n\tТабличныйДокумент.ОтображатьСетку = Истина;\n\tТабличныйДокумент.ОтображатьЗаголовки = Истина;\n\t\n\tСформирован = Ложь;\n\tТабМакет = Справочники.Товары.ПолучитьМакет(\"МакетПрайсЛиста\"); \n\n\tШапка = ТабМакет.ПолучитьОбласть(\"Шапка\");\n\tТабличныйДокумент.Вывести(Шапка);\n\n\tОбластьНоменклатура = ТабМакет.ПолучитьОбласть(\"ОбластьНоменклатура\");\n\t\n\tЗапрос = Новый Запрос;\n Запрос.Текст = \"ВЫБРАТЬ\n | Товары.Код КАК Код,\n | Товары.Наименование КАК Наименование,\n | Товары.Артикул КАК Артикул,\n | Товары.ФайлКартинки КАК Картинка,\n | Товары.Описание КАК Описание,\n | Товары.Вид КАК Вид,\n | ЦеныТоваров.Цена КАК Цена\n |ИЗ\n | РегистрСведений.ЦеныТоваров КАК ЦеныТоваров\n | ЛЕВОЕ СОЕДИНЕНИЕ Справочник.Товары КАК Товары\n | ПО ЦеныТоваров.Товар = Товары.Ссылка\n |ГДЕ\n | Товары.ЭтоГруппа = ЛОЖЬ\n | И ЦеныТоваров.ВидЦен = &ВидЦен\n |\n |УПОРЯДОЧИТЬ ПО\n | Вид,\n | Товары.Родитель.Код,\n | Код\";\n\n Запрос.УстановитьПараметр(\"ВидЦен\", Справочники.ВидыЦен.НайтиПоНаименованию(\"Розничная\"));\n\t\t\t\t\t\t\n\tВыборка = Запрос.Выполнить().Выбрать();\n\tПока Выборка.Следующий() Цикл\n\t\tОбластьНоменклатура.Параметры.Заполнить(Выборка);\n\t\t\n\t\tОписание = \"\";\n\t\t\n\t\tЧтение = Новый ЧтениеHTML();\n\t\tЧтение.УстановитьСтроку(Выборка.Описание);\n\t\t\n\t\tДокDOM = Новый ПостроительDOM();\n\t\tHTML = ДокDOM.Прочитать(Чтение);\n\t\t\n\t\tЕсли Не HTML.ЭлементДокумента = Неопределено Тогда\n\t\t\tДля Каждого Узел из HTML.ЭлементДокумента.ДочерниеУзлы Цикл \n\t\t\t\tЕсли Узел.ИмяУзла = \"body\" Тогда\n\t\t\t\t\tДля Каждого ЭлементОписания из Узел.ДочерниеУзлы Цикл \n\t\t\t\t\t\tОписание = Описание + ЭлементОписания.ТекстовоеСодержимое;\n\t\t\t\t\tКонецЦикла;\n\t\t\t\tКонецЕсли;\n\t\t\tКонецЦикла;\n\t\tКонецЕсли;\n\t\tОбластьНоменклатура.Параметры.Описание = Описание;\n\t\t\n\t\tЕсли (Выборка.Картинка <> Null) Тогда \n\t\t\tОбластьНоменклатура.Параметры.ПараметрКартинки = Новый Картинка(Выборка.Картинка.ДанныеФайла.Получить());\n\t\tКонецЕсли;\n\t\t\n\t\tТабличныйДокумент.Вывести(ОбластьНоменклатура, Выборка.Уровень());\n\t\tСформирован = Истина;\n\tКонецЦикла;\n\t\n\tЕсли Сформирован Тогда\n\t\tВозврат ТабличныйДокумент;\n\tИначе \t\n\t\tВозврат Неопределено;\n\tКонецЕсли;\t\nКонецФункции\n\n&НаКлиенте\nПроцедура ОбработкаКоманды(ПараметрКоманды, ПараметрыВыполненияКоманды)\n\tТабличныйДокумент = ПечатнаяФорма(ПараметрКоманды);\n\t\n\tЕсли ТабличныйДокумент <> Неопределено Тогда\n\t\tТабличныйДокумент.Показать();\n\tКонецЕсли;\t\n\t\nКонецПроцедуры\n" }, { "path": "src/test/resources/samples/langs/1C Enterprise/CommonModule.ОбменМобильныеОбщее.Module.bsl", "content": "// Процедура на основании анализа типа данных заменяет их на данные, удаляющие\n// информацию из узла в котором их не должно быть\n//\n// Параметры:\n// Данные\t– Объект, набор записей,... который нужно преобразовать\n//\nПроцедура УдалениеДанных(Данные) \n\t\n\t// Получаем объект описания метаданного, соответствующий данным\n\tОбъектМетаданных = ?(ТипЗнч(Данные) = Тип(\"УдалениеОбъекта\"), Данные.Ссылка.Метаданные(), Данные.Метаданные());\n // Проверяем тип, интересуют только те типы, которые реализованы на мобильной платформе\n\tЕсли Метаданные.Справочники.Содержит(ОбъектМетаданных)\n\t \tИЛИ Метаданные.Документы.Содержит(ОбъектМетаданных) Тогда\n\t\t\n\t\t// Перенос удаления объекта для объектных\n\t\tДанные = Новый УдалениеОбъекта(Данные.Ссылка);\n\t\t\n\tИначеЕсли Метаданные.РегистрыСведений.Содержит(ОбъектМетаданных)\n\t\tИЛИ Метаданные.РегистрыНакопления.Содержит(ОбъектМетаданных)\n\t\tИЛИ Метаданные.Последовательности.Содержит(ОбъектМетаданных) Тогда\n\t\t\n\t\t// Очищаем данные\n\t\tДанные.Очистить();\n\t\t\n\tКонецЕсли;\t\n\t\nКонецПроцедуры\n\n// Функция формирует пакет обмена, который будет отправлен узлу \"УзелОбмена\" \n//\n// Параметры:\n// УзелОбмена\t– узел плана обмена \"мобильные\", с которым осуществляется обмен\n//\n// Возвращаемое значение:\n// сформированный пакет, помещенный в хранилище значения\nФункция СформироватьПакетОбмена(УзелОбмена) Экспорт\n \n\tЗаписьXML = Новый ЗаписьXML;\n\t\n\tЗаписьXML.УстановитьСтроку(\"UTF-8\");\n\tЗаписьXML.ЗаписатьОбъявлениеXML();\n \n\tЗаписьСообщения = ПланыОбмена.СоздатьЗаписьСообщения();\n ЗаписьСообщения.НачатьЗапись(ЗаписьXML, УзелОбмена);\t\t\t\t\t\n \n\tЗаписьXML.ЗаписатьСоответствиеПространстваИмен(\"xsi\", \"http://www.w3.org/2001/XMLSchema-instance\");\n\tЗаписьXML.ЗаписатьСоответствиеПространстваИмен(\"v8\", \"http://v8.1c.ru/data\");\n \n\tТипДанныхУдаления = Тип(\"УдалениеОбъекта\");\n \n\tВыборкаИзменений = ПланыОбмена.ВыбратьИзменения(УзелОбмена, ЗаписьСообщения.НомерСообщения);\n\tПока ВыборкаИзменений.Следующий() Цикл\n\t\t\n\t\tДанные = ВыборкаИзменений.Получить();\n \n\t\t// Если перенос данных не нужен, то, возможно, необходимо записать удаление данных\n\t\tЕсли Не ОбменМобильныеПереопределяемый.НуженПереносДанных(Данные, УзелОбмена) Тогда\n\t\t\t\n\t\t\t// Получаем значение с возможным удалением данных\n\t\t\tУдалениеДанных(Данные); \n \n\t\tКонецЕсли;\t\n\t\t\n\t\t// Записываем данные в сообщение\n\t\tОбменМобильныеПереопределяемый.ЗаписатьДанные(ЗаписьXML, Данные);\n \n КонецЦикла;\n \n\tЗаписьСообщения.ЗакончитьЗапись();\n \n\tВозврат Новый ХранилищеЗначения(ЗаписьXML.Закрыть(), Новый СжатиеДанных(9));\n \nКонецФункции\n\n// Процедура вносит в информационную базу данные, которые присланы из узла \"УзелОбмена\" \n//\n// Параметры:\n// УзелОбмена\t– узел плана обмена \"мобильные\", с которым осуществляется обмен\n// ДанныеОбмена - пакет обмена полученный из узла УзелОбмена, помещен в ХранилищеЗначения\n//\nПроцедура ПринятьПакетОбмена(УзелОбмена, ДанныеОбмена) Экспорт\n \n\tЧтениеXML = Новый ЧтениеXML;\n\tЧтениеXML.УстановитьСтроку(ДанныеОбмена.Получить());\n ЧтениеСообщения = ПланыОбмена.СоздатьЧтениеСообщения();\n\tЧтениеСообщения.НачатьЧтение(ЧтениеXML);\n ПланыОбмена.УдалитьРегистрациюИзменений(ЧтениеСообщения.Отправитель,ЧтениеСообщения.НомерПринятого);\n\n НачатьТранзакцию();\n Пока ВозможностьЧтенияXML(ЧтениеXML) Цикл\n \n\t\tДанные = ОбменМобильныеПереопределяемый.ПрочитатьДанные(ЧтениеXML);\n \n\t\tЕсли Не Данные = Неопределено Тогда\n\t\t\t\n Данные.ОбменДанными.Отправитель = ЧтениеСообщения.Отправитель;\n Данные.ОбменДанными.Загрузка = Истина;\n \n Данные.Записать();\n \n КонецЕсли;\n \n КонецЦикла;\n ЗафиксироватьТранзакцию();\n \n ЧтениеСообщения.ЗакончитьЧтение();\n ЧтениеXML.Закрыть();\n \nКонецПроцедуры\n" }, { "path": "src/test/resources/samples/langs/1C Enterprise/Document.РасходТовара.ObjectModule.bsl", "content": "//////////////////////////////////////////////////////////////////////////////// \r\r\n// ПРОЦЕДУРЫ И ФУНКЦИИ\r\r\n//\r\r\n\r\r\n// Формирование печатной формы документа\r\r\n// \r\r\n// Параметры: \r\r\n// Нет. \r\r\n// \r\r\n// Возвращаемое значение: \r\r\n// ТабличныйДокумент - Сформированный табличный документ.\r\r\nПроцедура ПечатнаяФорма(ТабличныйДокумент) Экспорт\r\n\r\r\n\tМакет = Документы.РасходТовара.ПолучитьМакет(\"МакетПечати\");\r\n\r\r\n\t// Заголовок\r\r\n\tОбласть = Макет.ПолучитьОбласть(\"Заголовок\");\r\r\n\tТабличныйДокумент.Вывести(Область);\r\n\r\r\n\t// Шапка\r\r\n\tШапка = Макет.ПолучитьОбласть(\"Шапка\");\r\r\n\tШапка.Параметры.Заполнить(ЭтотОбъект);\r\r\n\tТабличныйДокумент.Вывести(Шапка);\r\n\r\r\n\t// Товары\r\r\n\tОбласть = Макет.ПолучитьОбласть(\"ТоварыШапка\");\r\r\n\tТабличныйДокумент.Вывести(Область);\r\r\n\tОбластьТовары = Макет.ПолучитьОбласть(\"Товары\");\r\n\r\r\n\tДля каждого ТекСтрокаТовары Из Товары Цикл\r\n\r\r\n\t\tОбластьТовары.Параметры.Заполнить(ТекСтрокаТовары);\r\r\n\t\tТабличныйДокумент.Вывести(ОбластьТовары);\r\n\r\r\n\tКонецЦикла;\r\r\n\r\nКонецПроцедуры\r\r\n\r\n// Формирование печатной формы документа\r\n// \r\n// Параметры: \r\n// Нет. \r\n// \r\n// Возвращаемое значение: \r\n// ТабличныйДокумент - Сформированный табличный документ.\r\nПроцедура Пересчитать() Экспорт\r\n\r\n\tДля каждого ТекСтрокаТовары Из Товары Цикл\r\n\r\n\t\tТекСтрокаТовары.Сумма = ТекСтрокаТовары.Количество * ТекСтрокаТовары.Цена;\r\n\r\n\tКонецЦикла;\r\n\r\nКонецПроцедуры\r\n\r\n////////////////////////////////////////////////////////////////////////////////\r\r\n// ОБРАБОТЧИКИ СОБЫТИЙ ОБЪЕКТА\r\r\n\r\nПроцедура ОбработкаПроведения(Отказ, Режим)\r\n\r\n\t// Формирование движений регистров накопления ТоварныеЗапасы и Продажи.\r\n\tДвижения.ТоварныеЗапасы.Записывать = Истина;\r\n\tДвижения.Продажи.Записывать = Истина;\r\n\tЕсли Режим = РежимПроведенияДокумента.Оперативный Тогда\r\n\t\tДвижения.ТоварныеЗапасы.БлокироватьДляИзменения = Истина;\r\n\tКонецЕсли;\t\r\n\r\n\t// Создадим запрос, чтобы получать информацию об услугах\r\n\tЗапрос = Новый Запрос(\"ВЫБРАТЬ\r\n\t\t\t\t\t\t | ТоварыВДокументе.НомерСтроки КАК НомерСтроки\r\n\t\t\t\t\t\t |ИЗ\r\n\t\t\t\t\t\t | Документ.РасходТовара.Товары КАК ТоварыВДокументе\r\n\t\t\t\t\t\t |ГДЕ\r\n\t\t\t\t\t\t | ТоварыВДокументе.Ссылка = &Ссылка\r\n\t\t\t\t\t\t | И ТоварыВДокументе.Товар.Вид = ЗНАЧЕНИЕ(Перечисление.ВидыТоваров.Услуга)\");\r\n\r\n\tЗапрос.УстановитьПараметр(\"Ссылка\", Ссылка);\r\n\tРезультатУслуги = Запрос.Выполнить().Выгрузить();\r\n\tРезультатУслуги.Индексы.Добавить(\"НомерСтроки\");\r\n\r\n\tДля каждого ТекСтрокаТовары Из Товары Цикл\r\n\r\n\t\tСтрока = РезультатУслуги.Найти(ТекСтрокаТовары.НомерСтроки, \"НомерСтроки\");\r\n\t\tЕсли Строка = Неопределено Тогда\r\n\t\t\t\r\n\t\t\t// Не услуга\r\n\t\t\tДвижение = Движения.ТоварныеЗапасы.Добавить();\r\n\t\t\tДвижение.ВидДвижения = ВидДвиженияНакопления.Расход;\r\n\t\t\tДвижение.Период = Дата;\r\n\t\t\tДвижение.Товар = ТекСтрокаТовары.Товар;\r\n\t\t\tДвижение.Склад = Склад;\r\n\t\t\tДвижение.Количество = ТекСтрокаТовары.Количество;\r\n\r\n\t\tКонецЕсли;\r\n\r\n\t\tДвижение = Движения.Продажи.Добавить();\r\n\t\tДвижение.Период = Дата;\r\n\t\tДвижение.Товар = ТекСтрокаТовары.Товар;\r\n\t\tДвижение.Покупатель = Покупатель;\r\n\t\tДвижение.Количество = ТекСтрокаТовары.Количество;\r\n\t\tДвижение.Сумма = ТекСтрокаТовары.Сумма;\r\n\r\n\tКонецЦикла;\r\n\r\n\t// Формирование движения регистра накопления Взаиморасчеты.\r\n\tДвижения.Взаиморасчеты.Записывать = Истина;\r\n\tДвижение = Движения.Взаиморасчеты.Добавить();\r\n\tДвижение.ВидДвижения = ВидДвиженияНакопления.Расход;\r\n\tДвижение.Период = Дата;\r\n\tДвижение.Контрагент = Покупатель;\r\n\tДвижение.Валюта = Валюта;\r\n\r\n\tЕсли Валюта.Пустая() Тогда\r\n\t\tДвижение.Сумма = Товары.Итог(\"Сумма\");\r\n\tИначе\r\n\r\n\t\tКурс = РегистрыСведений.КурсыВалют.ПолучитьПоследнее(Дата, Новый Структура(\"Валюта\", Валюта)).Курс;\r\n\r\n\t\tЕсли Курс = 0 Тогда\r\n\t\t\tДвижение.Сумма = Товары.Итог(\"Сумма\");\r\n\t\tИначе\r\n\t\t\tДвижение.Сумма = Товары.Итог(\"Сумма\") / Курс;\r\n\t\tКонецЕсли;\r\n\r\n\tКонецЕсли;\r\n\r\n\t//Запишем движения\r\n\tДвижения.Записать();\r\n\t\r\n\t//Контроль остатков при оперативном проведении\r\n\tЕсли Режим = РежимПроведенияДокумента.Оперативный Тогда\r\n\t\t// Создадим запрос, чтобы контролировать остатки по товарам\r\n\t\tЗапрос = Новый Запрос(\"ВЫБРАТЬ\r\n\t\t\t\t\t\t\t | ТоварыВДокументе.Товар КАК Товар,\r\n\t\t\t\t\t\t\t | СУММА(ТоварыВДокументе.Количество) КАК Количество,\r\n\t\t\t\t\t\t\t | МАКСИМУМ(ТоварыВДокументе.НомерСтроки) КАК НомерСтроки\r\n\t\t\t\t\t\t\t |\r\n\t\t\t\t\t\t\t |ПОМЕСТИТЬ ТребуетсяТовара\r\n\t\t\t\t\t\t\t |\r\n\t\t\t\t\t\t\t |ИЗ\r\n\t\t\t\t\t\t\t | Документ.РасходТовара.Товары КАК ТоварыВДокументе\r\n\t\t\t\t\t\t\t |\r\n\t\t\t\t\t\t\t |ГДЕ\r\n\t\t\t\t\t\t\t | ТоварыВДокументе.Ссылка = &Ссылка\r\n\t\t\t\t\t\t\t | И ТоварыВДокументе.Товар.Вид = ЗНАЧЕНИЕ(Перечисление.ВидыТоваров.Товар)\r\n\t\t\t\t\t\t\t |\r\n\t\t\t\t\t\t\t |СГРУППИРОВАТЬ ПО\r\n\t\t\t\t\t\t\t | ТоварыВДокументе.Товар\r\n\t\t\t\t\t\t\t |\r\n\t\t\t\t\t\t\t |ИНДЕКСИРОВАТЬ ПО\r\n\t\t\t\t\t\t\t | Товар\r\n\t\t\t\t\t\t\t |;\r\n\t\t\t\t\t\t\t |\r\n\t\t\t\t\t\t\t |////////////////////////////////////////////////////////////////////////////////\r\n\t\t\t\t\t\t\t |ВЫБРАТЬ\r\n\t\t\t\t\t\t\t | ПРЕДСТАВЛЕНИЕ(ТребуетсяТовара.Товар) КАК ТоварПредставление,\r\n\t\t\t\t\t\t\t | ВЫБОР\r\n\t\t\t\t\t\t\t | КОГДА - ЕСТЬNULL(ТоварныеЗапасыОстатки.КоличествоОстаток, 0) > ТоварыВДокументе.Количество\r\n\t\t\t\t\t\t\t | ТОГДА ТоварыВДокументе.Количество\r\n\t\t\t\t\t\t\t | ИНАЧЕ - ЕСТЬNULL(ТоварныеЗапасыОстатки.КоличествоОстаток, 0)\r\n\t\t\t\t\t\t\t | КОНЕЦ КАК Нехватка,\r\n\t\t\t\t\t\t\t | ТоварыВДокументе.Количество - ВЫБОР\r\n\t\t\t\t\t\t\t | КОГДА - ЕСТЬNULL(ТоварныеЗапасыОстатки.КоличествоОстаток, 0) > ТоварыВДокументе.Количество\r\n\t\t\t\t\t\t\t | ТОГДА ТоварыВДокументе.Количество\r\n\t\t\t\t\t\t\t | ИНАЧЕ - ЕСТЬNULL(ТоварныеЗапасыОстатки.КоличествоОстаток, 0)\r\n\t\t\t\t\t\t\t | КОНЕЦ КАК МаксимальноеКоличество,\r\n\t\t\t\t\t\t\t | ТребуетсяТовара.НомерСтроки КАК НомерСтроки\r\n\t\t\t\t\t\t\t |\r\n\t\t\t\t\t\t\t |ИЗ\r\n\t\t\t\t\t\t\t | ТребуетсяТовара КАК ТребуетсяТовара\r\n\t\t\t\t\t\t\t | ЛЕВОЕ СОЕДИНЕНИЕ РегистрНакопления.ТоварныеЗапасы.Остатки(\r\n\t\t\t\t\t\t\t | ,\r\n\t\t\t\t\t\t\t | Товар В\r\n\t\t\t\t\t\t\t | (ВЫБРАТЬ\r\n\t\t\t\t\t\t\t | ТребуетсяТовара.Товар\r\n\t\t\t\t\t\t\t | ИЗ\r\n\t\t\t\t\t\t\t | ТребуетсяТовара)\r\n\t\t\t\t\t\t\t | И Склад = &Склад) КАК ТоварныеЗапасыОстатки\r\n\t\t\t\t\t\t\t | ПО ТребуетсяТовара.Товар = ТоварныеЗапасыОстатки.Товар\r\n\t\t\t\t\t\t\t | ЛЕВОЕ СОЕДИНЕНИЕ Документ.РасходТовара.Товары КАК ТоварыВДокументе\r\n\t\t\t\t\t\t\t | ПО ТребуетсяТовара.Товар = ТоварыВДокументе.Товар\r\n\t\t\t\t\t\t\t | И ТребуетсяТовара.НомерСтроки = ТоварыВДокументе.НомерСтроки\r\n\t\t\t\t\t\t\t |\r\n\t\t\t\t\t\t\t |ГДЕ\r\n\t\t\t\t\t\t\t | ТоварыВДокументе.Ссылка = &Ссылка И\r\n\t\t\t\t\t\t\t | 0 > ЕСТЬNULL(ТоварныеЗапасыОстатки.КоличествоОстаток, 0)\r\n\t\t\t\t\t\t\t |\r\n\t\t\t\t\t\t\t |УПОРЯДОЧИТЬ ПО\r\n\t\t\t\t\t\t\t | НомерСтроки\");\r\n\r\n\t\tЗапрос.УстановитьПараметр(\"Склад\", Склад);\r\n\t\tЗапрос.УстановитьПараметр(\"Ссылка\", Ссылка);\r\n\t\tРезультатСНехваткой = Запрос.Выполнить();\r\n\r\n\t\tВыборкаРезультатаСНехваткой = РезультатСНехваткой.Выбрать();\r\n\r\n\t\t// Выдадим ошибки для строк, в которых не хватает остатка\r\n\t\tПока ВыборкаРезультатаСНехваткой.Следующий() Цикл\r\n\r\n\t\t\tСообщение = Новый СообщениеПользователю();\r\n\t\t\tСообщение.Текст = НСтр(\"ru = 'Не хватает '\", \"ru\") \r\n\t\t\t\t+ ВыборкаРезультатаСНехваткой.Нехватка \r\n\t\t\t\t+ НСтр(\"ru = ' единиц товара'\", \"ru\") + \"\"\"\" \r\n\t\t\t\t+ ВыборкаРезультатаСНехваткой.ТоварПредставление \r\n\t\t\t\t+ \"\"\"\" \r\n\t\t\t\t+ НСтр(\"ru = ' на складе'\", \"ru\") \r\n\t\t\t\t+ \"\"\"\" \r\n\t\t\t\t+ Склад \r\n\t\t\t\t+ \"\"\".\" \r\n\t\t\t\t+ НСтр(\"ru = 'Максимальное количество: '\", \"ru\") \r\n\t\t\t\t+ ВыборкаРезультатаСНехваткой.МаксимальноеКоличество \r\n\t\t\t\t+ \".\";\r\n\t\t\tСообщение.Поле = НСтр(\"ru = 'Товары'\", \"ru\") \r\n\t\t\t\t+ \"[\" \r\n\t\t\t\t+ (ВыборкаРезультатаСНехваткой.НомерСтроки - 1) \r\n\t\t\t\t+ \"].\" \r\n\t\t\t\t+ НСтр(\"ru = 'Количество'\", \"ru\");\r\n\t\t\tСообщение.УстановитьДанные(ЭтотОбъект);\r\n\t\t\tСообщение.Сообщить();\r\n\t\t\tОтказ = Истина;\r\n\r\n\t\tКонецЦикла;\r\n\r\n\tКонецЕсли;\r\n\t\r\nКонецПроцедуры\r\n\r\nПроцедура ОбработкаПроверкиЗаполнения(Отказ, ПроверяемыеРеквизиты)\t\t\r\n\t// Проверим заполненность поля \"Покупатель\"\r\r\n\tЕсли Покупатель.Пустая() Тогда\r\n\r\r\n\t\t// Если поле Покупатель не заполнено, сообщим об этом пользователю\r\r\n\t\tСообщение = Новый СообщениеПользователю();\r\r\n\t\tСообщение.Текст = НСтр(\"ru = 'Не указан Покупатель, для которого выписывается накладная!'\", \"ru\");\r\r\n\t\tСообщение.Поле = НСтр(\"ru = 'Покупатель'\", \"ru\");\r\n\t\tСообщение.УстановитьДанные(ЭтотОбъект);\r\n\r\r\n\t\tСообщение.Сообщить();\r\r\n\r\r\n\t\t// Сообщим платформе, что мы сами обработали проверку заполнения поля \"Покупатель\"\r\r\n\t\tПроверяемыеРеквизиты.Удалить(ПроверяемыеРеквизиты.Найти(\"Покупатель\"));\r\r\n\t\t// Так как информация в документе не консистентна, то продолжать работу дальше смысла нет\r\r\n\t\tОтказ = Истина;\r\n\r\r\n\tКонецЕсли;\r\r\n\r\n\t//Если склад не заполнен, то проверим есть ли в документе что-то кроме услуг\r\n\tЕсли Склад.Пустая() И Товары.Количество() > 0 Тогда\r\n\r\n\t\t// Создадим запрос, чтобы получать информацию об товарах\r\n\t\tЗапрос = Новый Запрос(\"ВЫБРАТЬ\r\n\t\t\t\t\t\t\t | Количество(*) КАК Количество\r\n\t\t\t\t\t\t\t |ИЗ\r\n\t\t\t\t\t\t\t | Справочник.Товары КАК Товары\r\n\t\t\t\t\t\t\t |ГДЕ\r\n\t\t\t\t\t\t\t | Товары.Ссылка В (&ТоварыВДокументе)\r\n\t\t\t\t\t\t\t | И Товары.Вид = ЗНАЧЕНИЕ(Перечисление.ВидыТоваров.Товар)\");\r\n\r\n\t\tЗапрос.УстановитьПараметр(\"ТоварыВДокументе\", Товары.ВыгрузитьКолонку(\"Товар\"));\r\n\t\tВыборка = Запрос.Выполнить().Выбрать();\r\n\t\tВыборка.Следующий();\r\n\t\tЕсли Выборка.Количество = 0 Тогда\r\n\t\t\t// Сообщим платформе, что мы сами обработали проверку заполнения поля \"Склад\"\r\n\t\t\tПроверяемыеРеквизиты.Удалить(ПроверяемыеРеквизиты.Найти(\"Склад\"));\r\n\t\tКонецЕсли;\r\n\r\n\tКонецЕсли;\r\n\r\r\nКонецПроцедуры\r\n\r\nПроцедура ОбработкаЗаполнения(ДанныеЗаполнения, СтандартнаяОбработка)\r\n\r\n\tЕсли ТипЗнч(ДанныеЗаполнения) = Тип(\"СправочникСсылка.Контрагенты\") Тогда\r\n\r\n\t\tЗапросПоКонтрагенту = Новый Запрос(\"ВЫБРАТЬ\r\n\t\t |\tКонтрагенты.ЭтоГруппа,\r\n\t\t |\tКонтрагенты.ВидЦен\r\n\t\t |ИЗ\r\n\t\t |\tСправочник.Контрагенты КАК Контрагенты\r\n\t\t |ГДЕ\r\n\t\t |\tКонтрагенты.Ссылка = &КонтрагентСсылка\");\r\n\t\tЗапросПоКонтрагенту.УстановитьПараметр(\"КонтрагентСсылка\", ДанныеЗаполнения);\r\n\t\tВыборка = ЗапросПоКонтрагенту.Выполнить().Выбрать();\r\n\t\tЕсли Выборка.Следующий() И Выборка.ЭтоГруппа Тогда\r\n\t\t\tВозврат;\r\n\t\tКонецЕсли;\r\n\t\t\r\n\t\tВидЦен = Выборка.ВидЦен;\r\n\t\tПокупатель = ДанныеЗаполнения.Ссылка;\r\n\r\n\tИначеЕсли ТипЗнч(ДанныеЗаполнения) = Тип(\"Структура\") Тогда\r\n\r\n\t\tЗначение = Неопределено;\r\n\r\n\t\tЕсли ДанныеЗаполнения.Свойство(\"Покупатель\", Значение) Тогда\r\n\t\t\tВидЦен = Значение.ВидЦен;\r\n\t\tКонецЕсли;\r\n\r\n\tКонецЕсли;\r\n\r\nКонецПроцедуры\r\n\r\n" }, { "path": "src/test/resources/samples/langs/1C Enterprise/ci_before_script.os", "content": "Каталог = ОбъединитьПути(ТекущийКаталог(), \"libs\\oscript-library\\src\");\nЗагрузчик_Оригинал_ИмяФайла = ОбъединитьПути(Каталог, \"package-loader.os\");\n\nФайлы = НайтиФайлы(Каталог, , Ложь);\nДля Каждого ВыбФайл Из Файлы Цикл\n\n Если ВыбФайл.ЭтоФайл() Тогда\n Продолжить;\n КонецЕсли;\n\n Загрузчик_ИмяФайла = ОбъединитьПути(ВыбФайл.ПолноеИмя, \"package-loader.os\");\n Загрузчик_Файл = Новый Файл(Загрузчик_ИмяФайла);\n\n Если Загрузчик_Файл.Существует() Тогда\n Продолжить;\n КонецЕсли;\n\n КопироватьФайл(Загрузчик_Оригинал_ИмяФайла, Загрузчик_ИмяФайла);\n\nКонецЦикла;" }, { "path": "src/test/resources/samples/langs/1C Enterprise/test_canCompile.os", "content": "#Использовать \"../libs/oscript-library/src/v8runner\"\n#Использовать \"../libs/oscript-library/src/tempfiles\"\n\nПерем Лог;\nПерем КодВозврата;\n\nПроцедура Инициализация()\n\n\tЛог = Логирование.ПолучитьЛог(\"oscript.app.gitlab-test_CanCompile\");\n\tКодВозврата = 0;\n\nКонецПроцедуры\n\nПроцедура ВыполнитьТест()\n\n\tКонфигуратор = Новый УправлениеКонфигуратором();\n\n\tПараметрыЗапуска = Конфигуратор.ПолучитьПараметрыЗапуска();\n\tКомандаЗапуска = \"/LoadConfigFromFiles \"\"%1\"\"\";\n\tКомандаЗапуска = СтрШаблон(КомандаЗапуска, ТекущийКаталог() + \"\\source\\cf\");\n\n\tЛог.Информация(\"Команда обновления конфигурации: \" + КомандаЗапуска);\n\n\tПараметрыЗапуска.Добавить(КомандаЗапуска);\n\n\tПопытка\n\t Конфигуратор.ВыполнитьКоманду(ПараметрыЗапуска);\n\tИсключение\n\n\t Лог.Ошибка(Конфигуратор.ВыводКоманды());\n\t КодВозврата = 1;\n\n\tКонецПопытки;\n\n\tУдалитьФайлы(Конфигуратор.ПутьКВременнойБазе());\n\nКонецПроцедуры\n\nИнициализация();\nВыполнитьТест();\n\nЗавершитьРаботу(КодВозврата);" }, { "path": "src/test/resources/samples/langs/ABAP/cl_csv_parser.abap", "content": "*/**\n* The MIT License (MIT)\n* Copyright (c) 2012 René van Mil\n* \n* Permission is hereby granted, free of charge, to any person obtaining\n* a copy of this software and associated documentation files (the\n* \"Software\"), to deal in the Software without restriction, including\n* without limitation the rights to use, copy, modify, merge, publish,\n* distribute, sublicense, and/or sell copies of the Software, and to\n* permit persons to whom the Software is furnished to do so, subject to\n* the following conditions:\n* \n* The above copyright notice and this permission notice shall be\n* included in all copies or substantial portions of the Software.\n* \n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n*/\n\n*----------------------------------------------------------------------*\n* CLASS CL_CSV_PARSER DEFINITION\n*----------------------------------------------------------------------*\n*\n*----------------------------------------------------------------------*\nclass cl_csv_parser definition\n public\n inheriting from cl_object\n final\n create public .\n\n public section.\n*\"* public components of class CL_CSV_PARSER\n*\"* do not include other source files here!!!\n\n type-pools abap .\n methods constructor\n importing\n !delegate type ref to if_csv_parser_delegate\n !csvstring type string\n !separator type c\n !skip_first_line type abap_bool .\n methods parse\n raising\n cx_csv_parse_error .\n protected section.\n*\"* protected components of class CL_CSV_PARSER\n*\"* do not include other source files here!!!\n private section.\n*\"* private components of class CL_CSV_PARSER\n*\"* do not include other source files here!!!\n\n constants _textindicator type c value '\"'. \"#EC NOTEXT\n data _delegate type ref to if_csv_parser_delegate .\n data _csvstring type string .\n data _separator type c .\n type-pools abap .\n data _skip_first_line type abap_bool .\n\n methods _lines\n returning\n value(returning) type stringtab .\n methods _parse_line\n importing\n !line type string\n returning\n value(returning) type stringtab\n raising\n cx_csv_parse_error .\nendclass. \"CL_CSV_PARSER DEFINITION\n\n\n\n*----------------------------------------------------------------------*\n* CLASS CL_CSV_PARSER IMPLEMENTATION\n*----------------------------------------------------------------------*\n*\n*----------------------------------------------------------------------*\nclass cl_csv_parser implementation.\n\n\n* ---------------------------------------------------------------------------------------+\n* | Instance Public Method CL_CSV_PARSER->CONSTRUCTOR\n* +-------------------------------------------------------------------------------------------------+\n* | [--->] DELEGATE TYPE REF TO IF_CSV_PARSER_DELEGATE\n* | [--->] CSVSTRING TYPE STRING\n* | [--->] SEPARATOR TYPE C\n* | [--->] SKIP_FIRST_LINE TYPE ABAP_BOOL\n* +--------------------------------------------------------------------------------------\n method constructor.\n super->constructor( ).\n _delegate = delegate.\n _csvstring = csvstring.\n _separator = separator.\n _skip_first_line = skip_first_line.\n endmethod. \"constructor\n\n\n* ---------------------------------------------------------------------------------------+\n* | Instance Public Method CL_CSV_PARSER->PARSE\n* +-------------------------------------------------------------------------------------------------+\n* | [!CX!] CX_CSV_PARSE_ERROR\n* +--------------------------------------------------------------------------------------\n method parse.\n data msg type string.\n if _csvstring is initial.\n message e002(csv) into msg.\n raise exception type cx_csv_parse_error\n exporting\n message = msg.\n endif.\n\n \" Get the lines\n data is_first_line type abap_bool value abap_true.\n data lines type standard table of string.\n lines = _lines( ).\n field-symbols type string.\n loop at lines assigning .\n \" Should we skip the first line?\n if _skip_first_line = abap_true and is_first_line = abap_true.\n is_first_line = abap_false.\n continue.\n endif.\n \" Parse the line\n data values type standard table of string.\n values = _parse_line( ).\n \" Send values to delegate\n _delegate->values_found( values ).\n endloop.\n endmethod. \"parse\n\n\n* ---------------------------------------------------------------------------------------+\n* | Instance Private Method CL_CSV_PARSER->_LINES\n* +-------------------------------------------------------------------------------------------------+\n* | [<-()] RETURNING TYPE STRINGTAB\n* +--------------------------------------------------------------------------------------\n method _lines.\n split _csvstring at cl_abap_char_utilities=>cr_lf into table returning.\n endmethod. \"_lines\n\n\n* ---------------------------------------------------------------------------------------+\n* | Instance Private Method CL_CSV_PARSER->_PARSE_LINE\n* +-------------------------------------------------------------------------------------------------+\n* | [--->] LINE TYPE STRING\n* | [<-()] RETURNING TYPE STRINGTAB\n* | [!CX!] CX_CSV_PARSE_ERROR\n* +--------------------------------------------------------------------------------------\n method _parse_line.\n data msg type string.\n\n data csvvalue type string.\n data csvvalues type standard table of string.\n\n data char type c.\n data pos type i value 0.\n data len type i.\n len = strlen( line ).\n while pos < len.\n char = line+pos(1).\n if char <> _separator.\n if char = _textindicator.\n data text_ended type abap_bool.\n text_ended = abap_false.\n while text_ended = abap_false.\n pos = pos + 1.\n if pos < len.\n char = line+pos(1).\n if char = _textindicator.\n text_ended = abap_true.\n else.\n if char is initial. \" Space\n concatenate csvvalue ` ` into csvvalue.\n else.\n concatenate csvvalue char into csvvalue.\n endif.\n endif.\n else.\n \" Reached the end of the line while inside a text value\n \" This indicates an error in the CSV formatting\n text_ended = abap_true.\n message e003(csv) into msg.\n raise exception type cx_csv_parse_error\n exporting\n message = msg.\n endif.\n endwhile.\n \" Check if next character is a separator, otherwise the CSV formatting is incorrect\n data nextpos type i.\n nextpos = pos + 1.\n if nextpos < len and line+nextpos(1) <> _separator.\n message e003(csv) into msg.\n raise exception type cx_csv_parse_error\n exporting\n message = msg.\n endif.\n else.\n if char is initial. \" Space\n concatenate csvvalue ` ` into csvvalue.\n else.\n concatenate csvvalue char into csvvalue.\n endif.\n endif.\n else.\n append csvvalue to csvvalues.\n clear csvvalue.\n endif.\n pos = pos + 1.\n endwhile.\n append csvvalue to csvvalues. \" Don't forget the last value\n\n returning = csvvalues.\n endmethod. \"_parse_line\nendclass. \"CL_CSV_PARSER IMPLEMENTATION" }, { "path": "src/test/resources/samples/langs/AGS Script/GlobalScript.asc", "content": "// main global script file\r\n\r\n// A function that initializes a bunch of stuff.\r\nfunction initialize_control_panel() { \r\n // Centre the control panel\r\n gPanel.Centre(); \r\n // Centre the Restart dialog as well\r\n gRestartYN.Centre(); \r\n if (!IsSpeechVoxAvailable()) { \r\n // If there is no speech-vox file, and therefore no speech,\r\n // disable all the controls related with speech.\r\n lblVoice.Visible = false; \r\n btnVoice.Visible = false; \r\n sldVoice.Visible = false;\r\n }\r\n else {\r\n // If there *is*, then set it to voice and text. It's best to use\r\n // both whenever possible, for the player's sake.\r\n SetVoiceMode(eSpeechVoiceAndText); \r\n // And reflect this in the control panel.\r\n btnVoice.Text = \"Voice and Text\"; \r\n }\r\n if (!System.SupportsGammaControl) {\r\n // If we can't change the gamma settings, disable the relevant options.\r\n sldGamma.Visible = false; \r\n lblGamma.Visible = false;\r\n } \r\n \r\n //And now, set all the defaults\r\n System.Volume = 100;\r\n sldAudio.Value = System.Volume;\r\n SetGameSpeed(40);\r\n sldSpeed.Value = 40;\r\n if (IsSpeechVoxAvailable()) {\r\n SetVoiceMode(eSpeechVoiceAndText);\r\n btnVoice.Text = \"Voice and Text\";\r\n sldVoice.Value = 255;\r\n SetSpeechVolume(255);\r\n }\r\n if (System.SupportsGammaControl) {\r\n System.Gamma = 100;\r\n sldGamma.Value = 100;\r\n }\r\n}\r\n\r\n// Called when the game starts, before the first room is loaded\r\nfunction game_start() { \r\n // Put the code all in a function and then just call the function. \r\n // It saves cluttering up places like game_start.\r\n initialize_control_panel(); \r\n // Use the KeyboardMovement module to, per default, replicate the standard\r\n // keyboard movement of most Sierra games. See KeyboardMovement.txt for more info\r\n KeyboardMovement.SetMode(eKeyboardMovement_Tapping); \r\n}\r\n\r\nfunction repeatedly_execute() {\r\n \r\n // Put here anything you want to happen every game cycle, even when\r\n // the game is paused. This will not run when the game is blocked\r\n // inside a command like a blocking Walk()\r\n \r\n if (IsGamePaused() == 1) return;\r\n\r\n // Put here anything you want to happen every game cycle, but not\r\n // when the game is paused.\r\n}\r\n\r\nfunction repeatedly_execute_always() {\r\n \r\n // Put anything you want to happen every game cycle, even\r\n // when the game is blocked inside a command like a\r\n // blocking Walk().\r\n // You cannot run blocking commands from this function.\r\n \r\n}\r\n\r\nfunction show_inventory_window () \r\n{\r\n gInventory.Visible = true;\r\n // switch to the Use cursor (to select items with)\r\n mouse.Mode = eModeInteract;\r\n // But, override the appearance to look like the arrow\r\n mouse.UseModeGraphic(eModePointer);\r\n}\r\n\r\nfunction show_save_game_dialog()\r\n{\r\n gSaveGame.Visible = true;\r\n // Get the list of save games\r\n lstSaveGamesList.FillSaveGameList();\r\n if (lstSaveGamesList.ItemCount > 0)\r\n {\r\n // If there is at least one, set the default text\r\n // to be the first game's name\r\n txtNewSaveName.Text = lstSaveGamesList.Items[0];\r\n }\r\n else\r\n {\r\n // No save games yet, default empty text.\r\n txtNewSaveName.Text = \"\";\r\n }\r\n mouse.UseModeGraphic(eModePointer);\r\n gIconbar.Visible = false;\r\n}\r\n\r\nfunction show_restore_game_dialog()\r\n{\r\n gRestoreGame.Visible = true;\r\n lstRestoreGamesList.FillSaveGameList();\r\n mouse.UseModeGraphic(eModePointer);\r\n gIconbar.Visible = false;\r\n}\r\n\r\nfunction close_save_game_dialog()\r\n{\r\n gSaveGame.Visible = false;\r\n mouse.UseDefaultGraphic();\r\n gIconbar.Visible = true;\r\n}\r\n\r\nfunction close_restore_game_dialog()\r\n{\r\n gRestoreGame.Visible = false;\r\n mouse.UseDefaultGraphic();\r\n gIconbar.Visible = true;\r\n}\r\n\r\n// Called when a key is pressed. keycode holds the key's ASCII code\r\nfunction on_key_press(eKeyCode keycode) {\r\n // The following is called before \"if game is paused keycode=0\", so\r\n // it'll happen even when the game is paused.\r\n \r\n if ((keycode == eKeyEscape) && gRestartYN.Visible) {\r\n //Use ESC to cancel restart.\r\n gRestartYN.Visible = false; \r\n gIconbar.Visible = true;\r\n // If the panel's not ON, then the player must have gotten here by tapping F9,\r\n // therefore his cursor needs restoring. If the panel IS on, then it doesn't,\r\n // because it's already a pointer. Get used to thinking like this!!\r\n if (!gPanel.Visible) mouse.UseDefaultGraphic(); \r\n return;\r\n }\r\n if ((keycode == eKeyEscape) && gPanel.Visible) {\r\n // Use ESC to turn the panel off.\r\n gPanel.Visible = false; \r\n mouse.UseDefaultGraphic();\r\n gIconbar.Visible = true;\r\n return;\r\n }\r\n if ((keycode == eKeyEscape) && (gSaveGame.Visible))\r\n {\r\n // Use ESC to close the save game dialog\r\n close_save_game_dialog();\r\n return;\r\n }\r\n if ((keycode == eKeyEscape) && (gRestoreGame.Visible))\r\n {\r\n // Use ESC to close the restore game dialog\r\n close_restore_game_dialog();\r\n return;\r\n }\r\n \r\n if (keycode == eKeyReturn) { \r\n // ENTER, in this case merely confirms restart\r\n if (gRestartYN.Visible) RestartGame();\r\n }\r\n\r\n if (IsGamePaused() || (IsInterfaceEnabled() == 0))\r\n {\r\n // If the game is paused with a modal GUI on the\r\n // screen, or the player interface is disabled in\r\n // a cut scene, ignore any keypresses.\r\n return;\r\n }\r\n\r\n // FUNCTION KEYS AND SYSTEM SHORTCUTS\r\n if (keycode == eKeyEscape) {\r\n // ESC\r\n gPanel.Visible = true; \r\n gIconbar.Visible = false;\r\n mouse.UseModeGraphic(eModePointer);\r\n }\r\n if (keycode == eKeyCtrlQ) QuitGame(1); // Ctrl-Q\r\n if (keycode == eKeyF5) show_save_game_dialog(); // F5\r\n if (keycode == eKeyF7) show_restore_game_dialog(); // F7\r\n if (keycode == eKeyF9) {\r\n // F9, asks the player to confirm restarting (so much better to always confirm first)\r\n gRestartYN.Visible = true; \r\n gIconbar.Visible = false;\r\n mouse.UseModeGraphic(eModePointer);\r\n }\r\n if (keycode == eKeyF12) SaveScreenShot(\"scrnshot.bmp\"); // F12\r\n if (keycode == eKeyTab) show_inventory_window(); // Tab, show inventory\r\n\r\n // GAME COMMAND SHORTCUTS\r\n if (keycode == 'W') mouse.Mode=eModeWalkto; //Notice this alternate way to indicate keycodes.\r\n if (keycode == 'L') mouse.Mode=eModeLookat; //Note that all we do here is set modes.\r\n if (keycode == 'U') mouse.Mode=eModeInteract; //If you want something else to happen, such as GUI buttons highlighting,\r\n if (keycode == 'T') mouse.Mode=eModeTalkto; //you'll need some more scripting done.\r\n if (keycode == 'I') mouse.Mode=eModeUseinv; //But this will, as-is, give you some standard keyboard shortcuts your players will very much appreciate.\r\n\r\n // For extra cursor modes, such as pick up, feel free to add as you will.\r\n // Uncomment the line below if you use the \"Pick Up\" mode.\r\n //if (keycode == 'P' || keycode == 'G') mouse.Mode=eModePickup; \r\n\r\n // DEBUG FUNCTIONS\r\n if (keycode == eKeyCtrlS) Debug(0,0); // Ctrl-S, give all inventory\r\n if (keycode == eKeyCtrlV) Debug(1,0); // Ctrl-V, version\r\n if (keycode == eKeyCtrlA) Debug(2,0); // Ctrl-A, show walkable areas\r\n if (keycode == eKeyCtrlX) Debug(3,0); // Ctrl-X, teleport to room\r\n if (keycode == eKeyCtrlW && game.debug_mode) \r\n player.PlaceOnWalkableArea(); //Ctrl-W, move to walkable area \r\n}\r\n\r\n\r\nfunction on_mouse_click(MouseButton button) {\r\n // called when a mouse button is clicked. button is either LEFT or RIGHT\r\n if (IsGamePaused() == 1) {\r\n // Game is paused, so do nothing (ie. don't allow mouse click)\r\n }\r\n else if (button == eMouseLeft) {\r\n ProcessClick(mouse.x, mouse.y, mouse.Mode );\r\n }\r\n else if (button == eMouseRight || button == eMouseWheelSouth){\r\n // right-click our mouse-wheel down, so cycle cursor\r\n mouse.SelectNextMode();\r\n }\r\n else if (button == eMouseMiddle) { \r\n // Middle-button-click, default make character walk to clicked area (a little shortcut)\r\n // Could have been just \"player.Walk(mouse.x,mouse.y)\", but it's best to\r\n // leave our options open - what if you have a special script triggered\r\n // on \"walking\" mode?\r\n ProcessClick(mouse.x, mouse.y, eModeWalkto); \r\n }\r\n else if (button == eMouseWheelNorth) { \r\n // Mouse-wheel up, cycle cursors \r\n // If mode isn't WALK, set the previous mode (notice usage of numbers instead\r\n // of eNums, when it suits us)...\r\n if (mouse.Mode>0) mouse.Mode=mouse.Mode-1; \r\n else \r\n { \r\n // ...but if it is WALK mode...\r\n if (player.ActiveInventory!=null) \r\n {\r\n //...and the player has a selected inventory item, set mouse mode to UseInv. \r\n mouse.Mode=eModeUseinv; \r\n }\r\n else \r\n {\r\n // If they don't, however, just set it to mode TALK (change this line if you add more cursor modes)\r\n mouse.Mode=eModeTalkto; \r\n }\r\n }\r\n }\r\n}\r\n\r\nfunction interface_click(int interface, int button) {\r\n // This function is obsolete, from 2.62 and earlier versions.\r\n}\r\n\r\nfunction btnInvUp_Click(GUIControl *control, MouseButton button) {\r\n invCustomInv.ScrollUp();\r\n}\r\n\r\nfunction btnInvDown_Click(GUIControl *control, MouseButton button) {\r\n invCustomInv.ScrollDown();\r\n}\r\n\r\nfunction btnInvOK_Click(GUIControl *control, MouseButton button) {\r\n\t// They pressed the OK button, close the GUI\r\n\tgInventory.Visible = false;\r\n\tmouse.UseDefaultGraphic();\r\n}\r\n\r\nfunction btnInvSelect_Click(GUIControl *control, MouseButton button) {\r\n \r\n\t// They pressed SELECT, so switch to the Get cursor\r\n\tmouse.Mode = eModeInteract;\r\n\t// But, override the appearance to look like the arrow\r\n\tmouse.UseModeGraphic(eModePointer);\r\n}\r\n\r\nfunction btnIconInv_Click(GUIControl *control, MouseButton button) {\r\n \r\n show_inventory_window();\r\n}\r\n\r\nfunction btnIconCurInv_Click(GUIControl *control, MouseButton button) {\r\n \r\n if (player.ActiveInventory != null)\r\n mouse.Mode = eModeUseinv;\r\n}\r\n\r\nfunction btnIconSave_Click(GUIControl *control, MouseButton button) \r\n{\r\n show_save_game_dialog();\r\n}\r\n\r\nfunction btnIconLoad_Click(GUIControl *control, MouseButton button) \r\n{\r\n show_restore_game_dialog();\r\n}\r\n\r\nfunction btnIconExit_Click(GUIControl *control, MouseButton button) {\r\n \r\n QuitGame(1);\r\n}\r\n\r\nfunction btnIconAbout_Click(GUIControl *control, MouseButton button) {\r\n \r\n gPanel.Visible=true;\r\n gIconbar.Visible=false;\r\n mouse.UseModeGraphic(eModePointer);\r\n}\r\n\r\nfunction cEgo_Look()\r\n{\r\n Display(\"Damn, I'm looking good!\");\r\n}\r\n\r\nfunction cEgo_Interact()\r\n{\r\n Display(\"You rub your hands up and down your clothes.\");\r\n}\r\n\r\nfunction cEgo_Talk()\r\n{\r\n Display(\"Talking to yourself is a sign of madness!\");\r\n}\r\n\r\n//START OF CONTROL PANEL FUNCTIONS\r\nfunction btnSave_OnClick(GUIControl *control, MouseButton button)\r\n{\r\n gPanel.Visible = false;\r\n mouse.UseDefaultGraphic();\r\n gIconbar.Visible = true;\r\n Wait(1);\r\n btnIconSave_Click(btnIconSave, eMouseLeft);\r\n}\r\n\r\nfunction gControl_OnClick(GUI *theGui, MouseButton button)\r\n{\r\n\r\n}\r\n\r\nfunction btnAbout_OnClick(GUIControl *control, MouseButton button)\r\n{\r\nDisplay(\"Adventure Game Studio run-time engine default game.\");\r\n}\r\n\r\nfunction btnQuit_OnClick(GUIControl *control, MouseButton button)\r\n{\r\n gPanel.Visible = false;\r\n Wait(1);\r\n QuitGame(1);\r\n gPanel.Visible = true;\r\n gIconbar.Visible = false;\r\n mouse.UseModeGraphic(eModePointer);\r\n}\r\n\r\nfunction btnLoad_OnClick(GUIControl *control, MouseButton button)\r\n{\r\n gPanel.Visible = false;\r\n mouse.UseDefaultGraphic();\r\n gIconbar.Visible = true;\r\n Wait(1);\r\n btnIconLoad_Click(btnIconLoad, eMouseLeft);\r\n}\r\n\r\nfunction btnResume_OnClick(GUIControl *control, MouseButton button)\r\n{\r\n gPanel.Visible = false;\r\n mouse.UseDefaultGraphic();\r\n gIconbar.Visible = true;\r\n}\r\n\r\nfunction sldAudio_OnChange(GUIControl *control)\r\n{\r\n System.Volume = sldAudio.Value;\r\n}\r\n\r\nfunction sldVoice_OnChange(GUIControl *control)\r\n{\r\n // Sets voice volume. Note that we don't check for the existence of speech.vox - \r\n // we did that in game_start, so if it's not there the slider won't even be available.\r\n SetSpeechVolume(sldVoice.Value); \r\n}\r\n\r\nfunction btnVoice_OnClick(GUIControl *control, MouseButton button)\r\n{\r\n // Note that we don't check for the existence of speech.vox - we did that in game_start,\r\n // so if it's not there the button won't even be available.\r\n if (btnVoice.Text == \"Voice and Text\") { \r\n SetVoiceMode(eSpeechVoiceOnly); \r\n btnVoice.Text = \"Voice only\";\r\n }\r\n else if (btnVoice.Text == \"Voice only\") {\r\n SetVoiceMode(eSpeechTextOnly);\r\n btnVoice.Text = \"Text only\";\r\n }\r\n else if (btnVoice.Text == \"Text only\") {\r\n SetVoiceMode(eSpeechVoiceAndText);\r\n btnVoice.Text = \"Voice and Text\";\r\n }\r\n}\r\n\r\nfunction sldGamma_OnChange(GUIControl *control)\r\n{\r\n // Set the gamma. Note there's no need to check for anything else, as we ensured,\r\n // in game_start, that the slider won't even appear if it's not possible to do this.\r\n System.Gamma = sldGamma.Value; \r\n}\r\n\r\nfunction btnDefault_OnClick(GUIControl *control, MouseButton button)\r\n{\r\n // Reset everything to default. You'll have to edit these as well as the sliders\r\n // if you'd rather have different default parameters.\r\n System.Volume = 100;\r\n sldAudio.Value = System.Volume;\r\n sldSpeed.Value = 40;\r\n SetGameSpeed(40);\r\n if (IsSpeechVoxAvailable()) {\r\n SetVoiceMode(eSpeechVoiceAndText);\r\n btnVoice.Text = \"Voice and Text\";\r\n sldVoice.Value = 255;\r\n SetSpeechVolume(255);\r\n }\r\n if (System.SupportsGammaControl) {\r\n System.Gamma = 100;\r\n sldGamma.Value = 100;\r\n }\r\n}\r\n//END OF CONTROL PANEL FUNCTIONS\r\n\r\nfunction dialog_request(int param) \r\n{\r\n // This is used by the dialog text parser if you need to process\r\n // text that the player types in to the parser.\r\n // It is not used by default.\r\n}\r\n\r\nfunction sldSpeed_OnChange(GUIControl *control)\r\n{\r\n SetGameSpeed(sldSpeed.Value);\r\n}\r\n\r\nfunction btnRestart_OnClick(GUIControl *control, MouseButton button)\r\n{\r\n gRestartYN.Visible=true;\r\n gIconbar.Visible=false;\r\n}\r\n\r\nfunction btnRestartYes_OnClick(GUIControl *control, MouseButton button)\r\n{\r\n RestartGame();\r\n}\r\n\r\nfunction btnRestartNo_OnClick(GUIControl *control, MouseButton button)\r\n{\r\n gRestartYN.Visible = false;\r\n gIconbar.Visible = true;\r\n // If the panel's not ON, then the player must have gotten here by tapping F9,\r\n // therefore his cursor needs restoring. If the panel IS on, then it doesn't,\r\n // because it's already a pointer. Get used to thinking like this!!\r\n if (!gPanel.Visible) mouse.UseDefaultGraphic(); \r\n}\r\n\r\nfunction btnCancelSave_OnClick(GUIControl *control, MouseButton button)\r\n{\r\n close_save_game_dialog();\r\n}\r\n\r\nfunction btnSaveGame_OnClick(GUIControl *control, MouseButton button)\r\n{\r\n int gameSlotToSaveInto = lstSaveGamesList.ItemCount + 1;\r\n int i = 0;\r\n while (i < lstSaveGamesList.ItemCount)\r\n {\r\n if (lstSaveGamesList.Items[i] == txtNewSaveName.Text)\r\n {\r\n gameSlotToSaveInto = lstSaveGamesList.SaveGameSlots[i];\r\n }\r\n i++;\r\n }\r\n SaveGameSlot(gameSlotToSaveInto, txtNewSaveName.Text);\r\n close_save_game_dialog();\r\n}\r\n\r\nfunction btnCancelRestore_OnClick(GUIControl *control, MouseButton button)\r\n{\r\n close_restore_game_dialog();\r\n}\r\n\r\nfunction btnRestoreGame_OnClick(GUIControl *control, MouseButton button)\r\n{\r\n if (lstRestoreGamesList.SelectedIndex >= 0)\r\n {\r\n RestoreGameSlot(lstRestoreGamesList.SaveGameSlots[lstRestoreGamesList.SelectedIndex]);\r\n }\r\n close_restore_game_dialog();\r\n}\r\n\r\nfunction lstSaveGamesList_OnSelectionCh(GUIControl *control)\r\n{\r\n txtNewSaveName.Text = lstSaveGamesList.Items[lstSaveGamesList.SelectedIndex];\r\n}\r\n\r\nfunction txtNewSaveName_OnActivate(GUIControl *control)\r\n{\r\n // Pressing return in the text box simulates clicking the Save button\r\n btnSaveGame_OnClick(control, eMouseLeft);\r\n}\r\n\r\nfunction btnDeleteSave_OnClick(GUIControl *control, MouseButton button)\r\n{\r\n if (lstSaveGamesList.SelectedIndex >= 0)\r\n {\r\n DeleteSaveSlot(lstSaveGamesList.SaveGameSlots[lstSaveGamesList.SelectedIndex]);\r\n lstSaveGamesList.FillSaveGameList();\r\n }\r\n}\r\n" }, { "path": "src/test/resources/samples/langs/AGS Script/GlobalScript.ash", "content": "// Main header script - this will be included into every script in\r\n// the game (local and global). Do not place functions here; rather,\r\n// place import definitions and #define names here to be used by all\r\n// scripts.\r\n" }, { "path": "src/test/resources/samples/langs/AGS Script/KeyboardMovement_102.asc", "content": "// Main script for module 'KeyboardMovement'\r\n\r\n//****************************************************************************************************\r\n// DEFINITIONS\r\n//****************************************************************************************************\r\n\r\n#define DISTANCE 10000// distance player walks in Tapping mode before he stops\r\n\r\nenum KeyboardMovement_Directions {\r\n\teKeyboardMovement_Stop, \r\n\teKeyboardMovement_DownLeft, \r\n\teKeyboardMovement_Down, \r\n\teKeyboardMovement_DownRight, \r\n\teKeyboardMovement_Left, \r\n\teKeyboardMovement_Right, \r\n\teKeyboardMovement_UpLeft, \r\n\teKeyboardMovement_Up, \r\n\teKeyboardMovement_UpRight\r\n};\r\n\r\n//****************************************************************************************************\r\n// VARIABLES\r\n//****************************************************************************************************\r\n\r\n// keycodes as variables for future key customization functions (static variables?):\r\nint KeyboardMovement_KeyDown = 380; // down arrow\r\nint KeyboardMovement_KeyLeft = 375; // left arrow\r\nint KeyboardMovement_KeyRight = 377; // right arrow\r\nint KeyboardMovement_KeyUp = 372; // up arrow\r\nint KeyboardMovement_KeyDownRight = 381; // PgDn (numpad)\r\nint KeyboardMovement_KeyUpRight = 373; // PgUp (numpad)\r\nint KeyboardMovement_KeyDownLeft = 379; // End (numpad)\r\nint KeyboardMovement_KeyUpLeft = 371; // Home (numpad)\r\nint KeyboardMovement_KeyStop = 376; // 5 (numpad)\r\n\r\nKeyboardMovement_Modes KeyboardMovement_Mode = eKeyboardMovement_None; // stores current keyboard control mode (disabled by default)\r\n\r\nKeyboardMovement_Directions KeyboardMovement_CurrentDirection = eKeyboardMovement_Stop; // stores current walking direction of player character\r\n\r\n//****************************************************************************************************\r\n// USER FUNCTIONS\r\n//****************************************************************************************************\r\n\r\n//====================================================================================================\r\n\r\nstatic function KeyboardMovement::SetMode(KeyboardMovement_Modes mode) {\r\n\tKeyboardMovement_Mode = mode;\r\n}\r\n\r\n//====================================================================================================\r\n\r\n// key customization functions here\r\n\r\n//====================================================================================================\r\n\r\n//****************************************************************************************************\r\n// EVENT HANDLER FUNCTIONS\r\n//****************************************************************************************************\r\n\r\n//====================================================================================================\r\n\r\nfunction repeatedly_execute() {\r\n\r\n\t//--------------------------------------------------\r\n\t// Pressing mode\r\n\t//--------------------------------------------------\r\n\r\n\tif ((IsGamePaused() == true) || (KeyboardMovement_Mode != eKeyboardMovement_Pressing) || (IsInterfaceEnabled() == false) || (player.on == false)) return 0;\r\n\t // if game is paused, module or mode disabled, interface disabled or player character hidden, quit function\r\n\r\n\tKeyboardMovement_Directions newdirection; // declare variable storing new direction\r\n\r\n\t// get new direction:\r\n\tif ( ((IsKeyPressed(KeyboardMovement_KeyDown)) && (IsKeyPressed(KeyboardMovement_KeyRight))) || (IsKeyPressed(KeyboardMovement_KeyDownRight)) ) newdirection = eKeyboardMovement_DownRight; // if down&right arrows or PgDn (numeric pad) held down, set new direction to Down-Right\r\n\telse if ( ((IsKeyPressed(KeyboardMovement_KeyUp)) && (IsKeyPressed(KeyboardMovement_KeyRight))) || (IsKeyPressed(KeyboardMovement_KeyUpRight)) ) newdirection = eKeyboardMovement_UpRight; // up&right arrows or PgUp (numpad)\r\n\telse if ( ((IsKeyPressed(KeyboardMovement_KeyDown)) && (IsKeyPressed(KeyboardMovement_KeyLeft))) || (IsKeyPressed(KeyboardMovement_KeyDownLeft)) ) newdirection = eKeyboardMovement_DownLeft; // down&left arrows or End (numpad)\r\n\telse if ( ((IsKeyPressed(KeyboardMovement_KeyUp)) && (IsKeyPressed(KeyboardMovement_KeyLeft))) || (IsKeyPressed(KeyboardMovement_KeyUpLeft)) ) newdirection = eKeyboardMovement_UpLeft; // up&left arrows or Home (numpad)\r\n\telse if (IsKeyPressed(KeyboardMovement_KeyDown)) newdirection = eKeyboardMovement_Down; // down arrow\r\n\telse if (IsKeyPressed(KeyboardMovement_KeyLeft)) newdirection = eKeyboardMovement_Left; // left arrow\r\n\telse if (IsKeyPressed(KeyboardMovement_KeyRight)) newdirection = eKeyboardMovement_Right; // right arrow\r\n\telse if (IsKeyPressed(KeyboardMovement_KeyUp)) newdirection = eKeyboardMovement_Up; // up arrow\r\n\telse newdirection = eKeyboardMovement_Stop; // if none of the above held down, set it to stop player character\r\n\r\n\tif (IsKeyPressed(KeyboardMovement_KeyStop)) newdirection = eKeyboardMovement_Stop; // if 5 (numeric pad) held down, stop player character, regardless of whether some of the above are held down\r\n\r\n\tif (newdirection != KeyboardMovement_CurrentDirection) { // if new direction is different from current direction\r\n\r\n\t\tif (newdirection == eKeyboardMovement_Stop) player.StopMoving(); // if new direction is the Stop command, stop movement of player character\r\n\t\telse { // if new direction is NOT the Stop command\r\n\r\n\t\t\tint dx, dy; // declare variables storing new walk coordinates\r\n\t\t\tif (newdirection == eKeyboardMovement_DownRight) {\r\n\t\t\t\tdx = DISTANCE;\r\n\t\t\t\tdy = DISTANCE;\r\n\t\t\t}\r\n\t\t\telse if (newdirection == eKeyboardMovement_UpRight) {\r\n\t\t\t\tdx = DISTANCE;\r\n\t\t\t\tdy = -DISTANCE;\r\n\t\t\t}\r\n\t\t\telse if (newdirection == eKeyboardMovement_DownLeft) {\r\n\t\t\t\tdx = -DISTANCE;\r\n\t\t\t\tdy = DISTANCE;\r\n\t\t\t}\r\n\t\t\telse if (newdirection == eKeyboardMovement_UpLeft) {\r\n\t\t\t\tdx = -DISTANCE;\r\n\t\t\t\tdy = -DISTANCE;\r\n\t\t\t}\r\n\t\t\telse if (newdirection == eKeyboardMovement_Down) {\r\n\t\t\t\tdx = 0;\r\n\t\t\t\tdy = DISTANCE;\r\n\t\t\t}\r\n\t\t\telse if (newdirection == eKeyboardMovement_Left) {\r\n\t\t\t\tdx = -DISTANCE;\r\n\t\t\t\tdy = 0;\r\n\t\t\t}\r\n\t\t\telse if (newdirection == eKeyboardMovement_Right) {\r\n\t\t\t\tdx = DISTANCE;\r\n\t\t\t\tdy = 0;\r\n\t\t\t}\r\n\t\t\telse if (newdirection == eKeyboardMovement_Up) {\r\n\t\t\t\tdx = 0;\r\n\t\t\t\tdy = -DISTANCE;\r\n\t\t\t}\r\n\r\n\t\t\tplayer.WalkStraight(player.x + dx, player.y + dy, eNoBlock); // walk player character to the new coordinates\r\n\t\t}\r\n\t\tKeyboardMovement_CurrentDirection = newdirection; // update current direction to new direction\r\n\r\n\t}\r\n\r\n}\r\n\r\n//====================================================================================================\r\n\r\nfunction on_key_press(int keycode) {\r\n\r\n\t//--------------------------------------------------\r\n\t// Tapping mode\r\n\t//--------------------------------------------------\r\n\r\n\tif ((IsGamePaused() == true) || (KeyboardMovement_Mode != eKeyboardMovement_Tapping) || (IsInterfaceEnabled() == false) || (player.on == false)) return 0;\r\n\t // if game is paused, module or mode disabled, interface disabled or player character hidden, quit function\r\n\r\n\tKeyboardMovement_Directions newdirection; // declare variable storing new direction\r\n\r\n\t// get new direction:\r\n\tif (keycode == KeyboardMovement_KeyDownRight) newdirection = eKeyboardMovement_DownRight; // if down-right key pressed, set new direction to Down-Right\r\n\telse if (keycode == KeyboardMovement_KeyUpRight) newdirection = eKeyboardMovement_UpRight;\r\n\telse if (keycode == KeyboardMovement_KeyDownLeft) newdirection = eKeyboardMovement_DownLeft;\r\n\telse if (keycode == KeyboardMovement_KeyUpLeft) newdirection = eKeyboardMovement_UpLeft;\r\n\telse if (keycode == KeyboardMovement_KeyDown) newdirection = eKeyboardMovement_Down;\r\n\telse if (keycode == KeyboardMovement_KeyLeft) newdirection = eKeyboardMovement_Left;\r\n\telse if (keycode == KeyboardMovement_KeyRight) newdirection = eKeyboardMovement_Right;\r\n\telse if (keycode == KeyboardMovement_KeyUp) newdirection = eKeyboardMovement_Up;\r\n\telse if (keycode == KeyboardMovement_KeyStop) newdirection = eKeyboardMovement_Stop; // if stop key pressed, set to stop player character\r\n\r\n\tif (newdirection != KeyboardMovement_CurrentDirection) { // if new direction is different from current direction\r\n\r\n\t\tif (newdirection == eKeyboardMovement_Stop) player.StopMoving(); // if new direction is the Stop command, stop movement of player character\r\n\t\telse { // if new direction is NOT the Stop command\r\n\r\n\t\t\tint dx, dy; // declare variables storing new walk coordinates\r\n\t\t\tif (newdirection == eKeyboardMovement_DownRight) {\r\n\t\t\t\tdx = DISTANCE;\r\n\t\t\t\tdy = DISTANCE;\r\n\t\t\t}\r\n\t\t\telse if (newdirection == eKeyboardMovement_UpRight) {\r\n\t\t\t\tdx = DISTANCE;\r\n\t\t\t\tdy = -DISTANCE;\r\n\t\t\t}\r\n\t\t\telse if (newdirection == eKeyboardMovement_DownLeft) {\r\n\t\t\t\tdx = -DISTANCE;\r\n\t\t\t\tdy = DISTANCE;\r\n\t\t\t}\r\n\t\t\telse if (newdirection == eKeyboardMovement_UpLeft) {\r\n\t\t\t\tdx = -DISTANCE;\r\n\t\t\t\tdy = -DISTANCE;\r\n\t\t\t}\r\n\t\t\telse if (newdirection == eKeyboardMovement_Down) {\r\n\t\t\t\tdx = 0;\r\n\t\t\t\tdy = DISTANCE;\r\n\t\t\t}\r\n\t\t\telse if (newdirection == eKeyboardMovement_Left) {\r\n\t\t\t\tdx = -DISTANCE;\r\n\t\t\t\tdy = 0;\r\n\t\t\t}\r\n\t\t\telse if (newdirection == eKeyboardMovement_Right) {\r\n\t\t\t\tdx = DISTANCE;\r\n\t\t\t\tdy = 0;\r\n\t\t\t}\r\n\t\t\telse if (newdirection == eKeyboardMovement_Up) {\r\n\t\t\t\tdx = 0;\r\n\t\t\t\tdy = -DISTANCE;\r\n\t\t\t}\r\n\r\n\t\t\tplayer.WalkStraight(player.x + dx, player.y + dy, eNoBlock); // walk player character to the new coordinates\r\n\t\t}\r\n\t\tKeyboardMovement_CurrentDirection = newdirection; // update current direction to new direction\r\n\r\n\t}\r\n\telse { // if new direction is same as current direction\r\n\t\tplayer.StopMoving(); // stop player character\r\n\t\tKeyboardMovement_CurrentDirection = eKeyboardMovement_Stop; // update current direction\r\n\t}\r\n\r\n}\r\n\r\n//====================================================================================================\r\n\r\nfunction on_event(EventType event, int data) {\r\n\r\n\tif (event == eEventLeaveRoom) KeyboardMovement_CurrentDirection = eKeyboardMovement_Stop;\r\n\r\n}\r\n\r\n//====================================================================================================\r\n" }, { "path": "src/test/resources/samples/langs/AGS Script/KeyboardMovement_102.ash", "content": "// Script header for module 'KeyboardMovement'\r\n\r\n#define KeyboardMovement_VERSION 101\r\n\r\nenum KeyboardMovement_Modes {\r\n\teKeyboardMovement_None, \r\n\teKeyboardMovement_Tapping, \r\n\teKeyboardMovement_Pressing\r\n};\r\n\r\nstruct KeyboardMovement {\r\n\timport static function SetMode(KeyboardMovement_Modes mode);\r\n};\r\n" }, { "path": "src/test/resources/samples/langs/AMPL/CT2.mod", "content": "param num_beams; # number of beams\n\nparam num_rows >= 1, integer; # number of rows\nparam num_cols >= 1, integer; # number of columns \n\nset BEAMS := 1 .. num_beams; # set of beams\n\nset ROWS := 1 .. num_rows;\t # set of rows\nset COLUMNS := 1 .. num_cols;\t # set of columns\n\n# values for entries of each beam\nparam beam_values {BEAMS, ROWS, COLUMNS} >= 0; \n\n# values of tumor\nparam tumor_values {ROWS, COLUMNS} >= 0; \n\n# values of critical area\nparam critical_values {ROWS, COLUMNS} >= 0; \n\n# critical maximum dosage requirement\nparam critical_max;\n\n# tumor minimum dosage requirement\nparam tumor_min;\n\n# dosage scalar of each beam\nvar X {i in BEAMS} >= 0;\n\n\n# define the tumor area which includes the locations where tumor exists\nset tumor_area := {k in ROWS, h in COLUMNS: tumor_values[k,h] > 0};\n\n# define critical area \nset critical_area := {k in ROWS, h in COLUMNS: critical_values[k,h] > 0};\n\nvar S {(k,h) in tumor_area} >= 0;\nvar T {(k,h) in critical_area} >= 0;\n\n# maximize total dosage in tumor area\nmaximize total_tumor_dosage: sum {i in BEAMS} sum {(k,h) in tumor_area} X[i] * beam_values[i,k,h];\n\n# minimize total dosage in critical area\nminimize total_critical_dosage: sum {i in BEAMS} sum {(k,h) in critical_area} X[i] * beam_values[i,k,h];\n\n# minimize total tumor slack\nminimize total_tumor_slack: sum {(k,h) in tumor_area} S[k,h];\n\n# minimize total critical area slack\nminimize total_critical_slack: sum {(k,h) in critical_area} T[k,h];\n\n# total dosage at each tumor location [k,h] should be >= min tumor dosage with slack variable\nsubject to tumor_limit {(k,h) in tumor_area} : sum {i in BEAMS} X[i] * beam_values[i,k,h] == tumor_min - S[k,h];\n\n# total dosage at each critical location [k,h] should be = max critical dosage with slack variable\nsubject to critical_limit {(k,h) in critical_area} : sum {i in BEAMS} X[i] * beam_values[i,k,h] == critical_max + T[k,h];\n\n\n\n" }, { "path": "src/test/resources/samples/langs/AMPL/toy.ampl", "content": "# A toy knapsack problem from the LocalSolver docs written in AMPL.\n\nset I;\nparam Value{I};\nparam Weight{I};\nparam KnapsackBound;\nvar Take{I} binary;\n\nmaximize TotalValue: sum{i in I} Take[i] * Value[i];\ns.t. WeightLimit: sum{i in I} Take[i] * Weight[i] <= KnapsackBound;\n\ndata;\n\nparam:\nI: Weight Value :=\n0 10 1\n1 60 10\n2 30 15\n3 40 40\n4 30 60\n5 20 90\n6 20 100\n7 2 15;\n\nparam KnapsackBound := 102;\n" }, { "path": "src/test/resources/samples/langs/API Blueprint/actions.apib", "content": "FORMAT: 1A\n\n# Advanced Action API\nA resource action is – in fact – a state transition. This API example demonstrates an action - state transition - to another resource.\n\n## API Blueprint\n+ [Previous: Resource Model](11.%20Resource%20Model.md)\n+ [This: Raw API Blueprint](https://raw.github.com/apiaryio/api-blueprint/master/examples/11.%20Advanced%20Action.md)\n\n# Tasks [/tasks/tasks{?status,priority}]\n\n+ Parameters\n + status (string)\n + priority (number)\n\n## List All Tasks [GET]\n\n+ Response 200 (application/json)\n\n [\n {\n \"id\": 123,\n \"name\": \"Exercise in gym\",\n \"done\": false,\n \"type\": \"task\"\n },\n {\n \"id\": 124,\n \"name\": \"Shop for groceries\",\n \"done\": true,\n \"type\": \"task\"\n }\n ]\n\n## Retrieve Task [GET /task/{id}]\nThis is a state transition to another resource\n\n+ Parameters\n + id (string)\n\n+ Response 200 (application/json)\n\n {\n \"id\": 123,\n \"name\": \"Go to gym\",\n \"done\": false,\n \"type\": \"task\"\n }\n\n## Delete Task [DELETE /task/{id}]\n\n+ Parameters\n + id (string)\n\n+ Response 204\n" }, { "path": "src/test/resources/samples/langs/API Blueprint/attributes.apib", "content": "FORMAT: 1A\n\n# Attributes API\nThis API example demonstrates how to describe body attributes of a request or response message.\n\nIn this case, the description is complementary (and duplicate!) to the provided JSON example in the body section. The [Advanced Attributes](09.%20Advanced%20Attributes.md) API example will demonstrate how to avoid duplicates and how to reuse attributes descriptions.\n\n## API Blueprint\n+ [Previous: Parameters](07.%20Parameters.md)\n+ [This: Raw API Blueprint](https://raw.github.com/apiaryio/api-blueprint/master/examples/08.%20Attributes.md)\n+ [Next: Advanced Attributes](09.%20Advanced%20Attributes.md)\n\n# Group Coupons\n\n## Coupon [/coupons/{id}]\nA coupon contains information about a percent-off or amount-off discount you might want to apply to a customer.\n\n### Retrieve a Coupon [GET]\nRetrieves the coupon with the given ID.\n\n+ Response 200 (application/json)\n\n + Attributes (object)\n + id: 250FF (string)\n + created: 1415203908 (number) - Time stamp\n + percent_off: 25 (number)\n\n A positive integer between 1 and 100 that represents the discount the coupon will apply.\n\n + redeem_by (number) - Date after which the coupon can no longer be redeemed\n\n + Body\n\n {\n \"id\": \"250FF\",\n \"created\": 1415203908,\n \"percent_off\": 25,\n \"redeem_by:\" null\n }\n" }, { "path": "src/test/resources/samples/langs/API Blueprint/simple.apib", "content": "FORMAT: 1A\n\n# The Simplest API\nThis is one of the simplest APIs written in the **API Blueprint**.\nOne plain resource combined with a method and that's it! We will explain what is going on in the next installment - [Resource and Actions](02.%20Resource%20and%20Actions.md).\n\n**Note:** As we progress through the examples, do not also forget to view the [Raw](https://raw.github.com/apiaryio/api-blueprint/master/examples/01.%20Simplest%20API.md) code to see what is really going on in the API Blueprint, as opposed to just seeing the output of the Github Markdown parser.\n\nAlso please keep in mind that every single example in this course is a **real API Blueprint** and as such you can **parse** it with the [API Blueprint parser](https://github.com/apiaryio/drafter) or one of its [bindings](https://github.com/apiaryio/drafter#bindings).\n\n## API Blueprint\n+ [This: Raw API Blueprint](https://raw.github.com/apiaryio/api-blueprint/master/examples/01.%20Simplest%20API.md)\n+ [Next: Resource and Actions](02.%20Resource%20and%20Actions.md)\n\n# GET /message\n+ Response 200 (text/plain)\n\n Hello World!\n" }, { "path": "src/test/resources/samples/langs/APL/DeepakChopra.apl", "content": "⍝ You can try this at http://tryapl.org/\n⍝ I can not explain how much I suddenly love this crypto-language\n\n\n\nStarts ← 'Experiential truth ' 'The physical world ' 'Non-judgment ' 'Quantum physics '\nMiddles ← 'nurtures an ' 'projects onto ' 'imparts reality to ' 'constructs with '\nQualifiers ← 'abundance of ' 'the barrier of ' 'self-righteous ' 'potential '\nFinishes ← 'marvel.' 'choices.' 'creativity.' 'actions.'\n\nrf ← {(?⍴⍵)⊃⍵}\nerf ← {rf ¨ ⍵}\n\ndeepak ← {erf Starts Middles Qualifiers Finishes}\n\n\n\ndeepak ⍬" }, { "path": "src/test/resources/samples/langs/APL/UT.dyalog", "content": ":NameSpace UT\n\n sac ← 0\n expect_orig ← expect ← ⎕NS⍬\n exception ← ⍬\n nexpect_orig ← nexpect ← ⎕NS⍬\n\n ∇ {Z}←{Conf}run Argument;PRE_test;POST_test;TEST_step;COVER_step;FromSpace\n \n load_display_if_not_already_loaded\n load_salt_scripts_into_current_namespace_if_configured\n \n FromSpace←1⊃⎕RSI\n \n PRE_test←{}\n POST_test←{}\n COVER_step←{}\n :If 0≠⎕NC'Conf'\n :If Conf has'cover_target'\n PRE_test←{{}⎕PROFILE'start'}\n POST_test←{{}⎕PROFILE'stop'}\n :EndIf\n :EndIf\n \n :If is_function Argument\n TEST_step←single_function_test_function\n COVER_file←Argument,'_coverage.html'\n \n :ElseIf is_list_of_functions Argument\n TEST_step←list_of_functions_test_function\n COVER_file←'list_coverage.html'\n \n :ElseIf is_file Argument\n TEST_step←file_test_function\n COVER_file←(get_file_name Argument),'_coverage.html'\n \n :ElseIf is_dir Argument\n test_files←test_files_in_dir Argument\n TEST_step←test_dir_function\n Argument←test_files\n :EndIf\n \n :If 0≠⎕NC'Conf'\n :If Conf has'cover_target'\n COVER_step←{Conf,←⊂('cover_file'COVER_file)\n generate_coverage_page Conf}\n :EndIf\n :EndIf\n \n PRE_test ⍬\n Z←FromSpace TEST_step Argument\n POST_test ⍬\n COVER_step ⍬\n ∇\n\n ∇ load_display_if_not_already_loaded\n :If 0=⎕NC'#.DISPLAY'\n 'DISPLAY'#.⎕CY'display'\n :EndIf\n ∇\n\n ∇ load_salt_scripts_into_current_namespace_if_configured\n :If 0≠⎕NC'#.UT.appdir'\n :If ⍬≢#.UT.appdir\n ⎕SE.SALT.Load #.UT.appdir,'src/*.dyalog -target=#'\n ⎕SE.SALT.Load #.UT.appdir,'test/*.dyalog -target=#'\n :EndIf\n :EndIf\n ∇\n\n ∇ Z←FromSpace single_function_test_function TestName\n Z←run_ut FromSpace TestName\n ∇\n\n ∇ Z←FromSpace list_of_functions_test_function ListOfNames;t\n t←⎕TS\n Z←run_ut¨{FromSpace ⍵}¨ListOfNames\n t←⎕TS-t\n ('Test execution report')print_passed_crashed_failed Z t\n ∇\n\n ∇ Z←FromSpace file_test_function FilePath;FileNS;Functions;TestFunctions;t\n FileNS←⎕SE.SALT.Load FilePath,' -target=#'\n Functions←↓FileNS.⎕NL 3\n TestFunctions←(is_test¨Functions)/Functions\n :If (0/⍬,⊂0/'')≡TestFunctions\n ⎕←'No test functions found'\n Z←⍬\n :Else\n t←⎕TS\n Z←run_ut¨{FileNS ⍵}¨TestFunctions\n t←⎕TS-t\n (FilePath,' tests')print_passed_crashed_failed Z t\n :EndIf\n ∇\n\n ∇ Z←FromSpace test_dir_function Test_files\n :If Test_files≡⍬/⍬,⊂''\n ⎕←'No test files found'\n Z←⍬\n :Else\n Z←#.UT.run¨Test_files\n :EndIf\n ∇\n\n ∇ Z←get_file_name Argument;separator\n separator←⊃⌽(Argument∊'/\\')/⍳⍴Argument\n Z←¯7↓separator↓Argument\n ∇\n\n ∇ generate_coverage_page Conf;ProfileData;CoverResults;HTML\n ProfileData←⎕PROFILE'data'\n ToCover←retrieve_coverables¨(⊃'cover_target'in Conf)\n :If (⍴ToCover)≡(⍴⊂1)\n ToCover←⊃ToCover\n :EndIf\n Representations←get_representation¨ToCover\n CoverResults←ProfileData∘generate_cover_result¨↓ToCover,[1.5]Representations\n HTML←generate_html CoverResults\n Conf write_html_to_page HTML\n ⎕PROFILE'clear'\n ∇\n\n ∇ Z←retrieve_coverables Something;nc;functions\n nc←⎕NC Something\n :If nc=3\n Z←Something\n :ElseIf nc=9\n functions←strip¨↓⍎Something,'.⎕NL 3'\n Z←{(Something,'.',⍵)}¨functions\n :EndIf\n ∇\n\n ∇ Z←strip input\n Z←(input≠' ')/input\n ∇\n\n ∇ Z←get_representation Function;nc;rep\n nc←⎕NC⊂Function\n :If nc=3.1\n rep←↓⎕CR Function\n rep[1]←⊂'∇',⊃rep[1]\n rep,←⊂'∇'\n rep←↑rep\n :Else\n rep←⎕CR Function\n :EndIf\n Z←rep\n ∇\n\n ∇ Z←ProfileData generate_cover_result(name representation);Indices;lines;functionlines;covered_lines\n Indices←({name≡⍵}¨ProfileData[;1])/⍳⍴ProfileData[;1]\n lines←ProfileData[Indices;2]\n nc←⎕NC⊂name\n :If 3.1=nc\n functionlines←¯2+⍴↓representation\n :Else\n functionlines←⊃⍴↓representation\n :EndIf\n covered_lines←(⍬∘≢¨lines)/lines\n Z←(nc lines functionlines covered_lines representation)\n ∇\n\n ∇ Z←generate_html CoverResults;Covered;Total;Percentage;CoverageText;ColorizedCode;Timestamp;Page\n Covered←⊃⊃+/{⍴4⊃⍵}¨CoverResults\n Total←⊃⊃+/{3⊃⍵}¨CoverResults\n Percentage←100×Covered÷Total\n CoverageText←'Coverage: ',Percentage,'% (',Covered,'/',Total,')'\n ColorizedCode←⊃,/{colorize_code_by_coverage ⍵}¨CoverResults\n Timestamp←generate_timestamp_text\n Page←⍬\n Page,←⊂⍬,''\n Page,←⊂⍬,''\n Page,←⊂⍬,''\n Page,←⊂⍬,CoverageText\n Page,←⊂⍬,'
'\n      Page,←ColorizedCode\n      Page,←⊂⍬,'
'\n Page,←Timestamp\n Page,←⊂⍬,''\n Z←Page\n ∇\n\n ∇ Z←colorize_code_by_coverage CoverResult;Colors;Ends;Code\n :If 3.1=⊃CoverResult\n Colors←(2+3⊃CoverResult)⍴⊂''\n Colors[1]←⊂''\n Colors[⍴Colors]←⊂''\n Ends←(2+3⊃CoverResult)⍴⊂''\n Ends[1]←⊂''\n Ends[⍴Ends]←⊂''\n :Else\n Colors←(3⊃CoverResult)⍴⊂''\n Ends←(3⊃CoverResult)⍴⊂''\n :EndIf\n Colors[1+4⊃CoverResult]←⊂''\n Ends[1+4⊃CoverResult]←⊂''\n Code←↓5⊃CoverResult\n Z←Colors,[1.5]Code\n Z←{⍺,(⎕UCS 13),⍵}/Z,Ends\n ∇\n\n ∇ Z←generate_timestamp_text;TS;YYMMDD;HHMMSS\n TS←⎕TS\n YYMMDD←⊃{⍺,'-',⍵}/3↑TS\n HHMMSS←⊃{⍺,':',⍵}/3↑3↓TS\n Z←'Page generated: ',YYMMDD,'|',HHMMSS\n ∇\n\n ∇ Conf write_html_to_page Page;tie;filename\n filename←(⊃'cover_out'in Conf),(⊃'cover_file'in Conf)\n :Trap 22\n tie←filename ⎕NTIE 0\n filename ⎕NERASE tie\n filename ⎕NCREATE tie\n :Else\n tie←filename ⎕NCREATE 0\n :EndTrap\n Simple_array←⍕⊃,/Page\n (⎕UCS'UTF-8'⎕UCS Simple_array)⎕NAPPEND tie\n ∇\n\n ∇ Z←is_function Argument\n Z←'_TEST'≡¯5↑Argument\n ∇\n\n ∇ Z←is_list_of_functions Argument\n Z←2=≡Argument\n ∇\n\n ∇ Z←is_file Argument\n Z←'.dyalog'≡¯7↑Argument\n ∇\n\n ∇ Z←is_dir Argument;attr\n :If 'Linux'≡5↑⊃'.'⎕WG'APLVersion'\n Z←'yes'≡⊃⎕CMD'test -d ',Argument,' && echo yes || echo no'\n :Else\n 'gfa'⎕NA'I kernel32|GetFileAttributes* <0t'\n :If Z←¯1≠attr←gfa⊂Argument ⍝ If file exists\n Z←⊃2 16⊤attr ⍝ Return bit 4\n :EndIf\n :EndIf\n ∇\n\n\n ∇ Z←test_files_in_dir Argument\n :If 'Linux'≡5↑⊃'.'⎕WG'APLVersion'\n Z←⎕SH'find ',Argument,' -name \\*_tests.dyalog'\n :Else\n #.⎕CY'files'\n Z←#.Files.Dir Argument,'\\*_tests.dyalog'\n Z←(Argument,'\\')∘,¨Z\n :EndIf\n ∇\n\n ∇ Z←run_ut ut_data;returned;crashed;pass;crash;fail;message\n (returned crashed time)←execute_function ut_data\n (pass crash fail)←determine_pass_crash_or_fail returned crashed\n message←determine_message pass fail crashed(2⊃ut_data)returned time\n print_message_to_screen message\n Z←(pass crash fail)\n ∇\n\n ∇ Z←execute_function ut_data;function;t\n reset_UT_globals\n function←(⍕(⊃ut_data[1])),'.',⊃ut_data[2]\n :Trap sac\n :If 3.2≡⎕NC⊂function\n t←⎕TS\n Z←(⍎function,' ⍬')0\n t←⎕TS-t\n :Else\n t←⎕TS\n Z←(⍎function)0\n t←⎕TS-t\n :EndIf\n \n :Else\n Z←(↑⎕DM)1\n :If exception≢⍬\n expect←exception\n Z[2]←0\n t←⎕TS-t\n :EndIf\n :EndTrap\n Z,←⊂t\n ∇\n\n ∇ reset_UT_globals\n expect_orig ← expect← ⎕NS⍬\n exception←⍬\n nexpect_orig ← nexpect← ⎕NS⍬\n ∇\n\n ∇ Z←is_test FunctionName;wsIndex\n wsIndex←FunctionName⍳' '\n FunctionName←(wsIndex-1)↑FunctionName\n Z←'_TEST'≡¯5↑FunctionName\n ∇\n\n ∇ Heading print_passed_crashed_failed(ArrayRes time)\n ⎕←'-----------------------------------------'\n ⎕←Heading\n ⎕←' ⍋ Passed: ',+/{1⊃⍵}¨ArrayRes\n ⎕←' ⍟ Crashed: ',+/{2⊃⍵}¨ArrayRes\n ⎕←' ⍒ Failed: ',+/{3⊃⍵}¨ArrayRes\n ⎕←' ○ Runtime: ',time[5],'m',time[6],'s',time[7],'ms'\n ∇\n \n determine_pass_crash_or_fail←{\n r c←⍵ ⋄ 0≠c:0 1 0 ⋄ z←(0 0 1)(1 0 0)\n expect_orig≢expect:(⎕IO+expect≡r)⊃z ⋄ (⎕IO+nexpect≢r)⊃z\n }\n\n ∇ Z←determine_message(pass fail crashed name returned time)\n :If crashed\n Z←'CRASHED: 'failure_message name returned\n :ElseIf pass\n Z←'Passed ',time[5],'m',time[6],'s',time[7],'ms'\n :Else\n Z←'FAILED: 'failure_message name returned\n :EndIf\n ∇\n\n ∇ print_message_to_screen message\n ⎕←message\n ∇\n\n ∇ Z←term_to_text Term;Text;Rows\n Text←#.DISPLAY Term\n Rows←1⊃⍴Text\n Z←(Rows 4⍴''),Text\n ∇\n\n ∇ Z←Cause failure_message(name returned);hdr;exp;expterm;got;gotterm\n hdr←Cause,name\n exp←'Expected'\n expterm←term_to_text #.UT.expect\n got←'Got'\n gotterm←term_to_text returned\n Z←align_and_join_message_parts hdr exp expterm got gotterm\n ∇\n\n ∇ Z←align_and_join_message_parts Parts;hdr;exp;expterm;got;gotterm;R1;C1;R2;C2;W\n (hdr exp expterm got gotterm)←Parts\n (R1 C1)←⍴expterm\n (R2 C2)←⍴gotterm\n W←⊃⊃⌈/C1 C2(⍴hdr)(⍴exp)(⍴got)\n Z←(W↑hdr),[0.5](W↑exp)\n Z←Z⍪(R1 W↑expterm)\n Z←Z⍪(W↑got)\n Z←Z⍪(R2 W↑gotterm)\n ∇\n\n ∇ Z←confparam in config\n Z←1↓⊃({confparam≡⊃⍵}¨config)/config\n ∇\n\n ∇ Z←config has confparam\n Z←∨/{confparam≡⊃⍵}¨config\n ∇\n\n:EndNameSpace\n" }, { "path": "src/test/resources/samples/langs/APL/hashbang", "content": "#!/usr/local/bin/apl --script\nNEWLINE ← ⎕UCS 10\nHEADERS ← 'Content-Type: text/plain', NEWLINE\nHEADERS\n⍝ ⎕←HEADERS\n⍝ ⍕⎕TS\n)OFF\n" }, { "path": "src/test/resources/samples/langs/ASN.1/example.asn", "content": "MyShopPurchaseOrders DEFINITIONS AUTOMATIC TAGS ::= BEGIN\n\nPurchaseOrder ::= SEQUENCE {\ndateOfOrder\tDATE,\ncustomer \tCustomerInfo,\nitems \tListOfItems\n}\n\nCustomerInfo ::= SEQUENCE {\ncompanyName\t VisibleString (SIZE (3..50)),\nbillingAddress\tAddress,\ncontactPhone NumericString (SIZE (7..12))\n}\n\nAddress::= SEQUENCE {\nstreet\t VisibleString (SIZE (5 .. 50)) OPTIONAL,\ncity\t VisibleString (SIZE (2..30)),\nstate\t VisibleString (SIZE(2) ^ FROM (\"A\"..\"Z\")),\nzipCode\tNumericString (SIZE(5 | 9))\n}\n\nListOfItems ::= SEQUENCE (SIZE (1..100)) OF Item\n\nItem ::= SEQUENCE {\nitemCode\t INTEGER (1..99999),\ncolor \tVisibleString (\"Black\" | \"Blue\" | \"Brown\"),\npower \tINTEGER (110 | 220),\ndeliveryTime \tINTEGER (8..12 | 14..19),\nquantity\t INTEGER (1..1000),\nunitPrice\t REAL (1.00 .. 9999.00),\nisTaxable\t BOOLEAN\n}\nEND\n" }, { "path": "src/test/resources/samples/langs/ATS/CoYonedaLemma.dats", "content": "(* ****** ****** *)\n//\n// HX-2014-01\n// CoYoneda Lemma:\n//\n(* ****** ****** *)\n//\n#include\n\"share/atspre_staload.hats\"\n//\n(* ****** ****** *)\n\nstaload\n\"libats/ML/SATS/basis.sats\"\nstaload\n\"libats/ML/SATS/list0.sats\"\n\n(* ****** ****** *)\n\nstaload _ = \"libats/ML/DATS/list0.dats\"\n\n(* ****** ****** *)\n\nsortdef ftype = type -> type\n\n(* ****** ****** *)\n\ninfixr (->) ->>\ntypedef ->> (a:type, b:type) = a - b\n\n(* ****** ****** *)\n\ntypedef\nfunctor(F:ftype) =\n {a,b:type} (a ->> b) ->> F(a) ->> F(b)\n\n(* ****** ****** *)\n\ntypedef\nlist0 (a:type) = list0 (a)\nextern\nval functor_list0 : functor (list0)\n\n(* ****** ****** *)\n\nimplement\nfunctor_list0{a,b}\n (f) = lam xs => list0_map (xs, f)\n\n(* ****** ****** *)\n\ndatatype\nCoYoneda\n (F:ftype, r:type) = {a:type} CoYoneda of (a ->> r, F(a))\n// end of [CoYoneda]\n\n(* ****** ****** *)\n//\nextern\nfun CoYoneda_phi\n : {F:ftype}functor(F) -> {r:type} (F (r) ->> CoYoneda (F, r))\nextern\nfun CoYoneda_psi\n : {F:ftype}functor(F) -> {r:type} (CoYoneda (F, r) ->> F (r))\n//\n(* ****** ****** *)\n\nimplement\nCoYoneda_phi(ftor) = lam (fx) => CoYoneda (lam x => x, fx)\nimplement\nCoYoneda_psi(ftor) = lam (CoYoneda(f, fx)) => ftor (f) (fx)\n\n(* ****** ****** *)\n\ndatatype int0 = I of (int)\ndatatype bool = True | False // boxed boolean\n\n(* ****** ****** *)\n//\nfun bool2string\n (x:bool): string =\n(\n case+ x of True() => \"True\" | False() => \"False\"\n)\n//\nimplement\nfprint_val (out, x) = fprint (out, bool2string(x))\n//\n(* ****** ****** *)\n\nfun int2bool (i: int0): bool =\n let val+I(i) = i in if i > 0 then True else False end\n\n(* ****** ****** *)\n\nval myintlist0 = g0ofg1($list{int0}((I)1, (I)0, (I)1, (I)0, (I)0))\nval myboolist0 = CoYoneda{list0,bool}{int0}(lam (i) => int2bool(i), myintlist0)\nval myboolist0 = CoYoneda_psi{list0}(functor_list0){bool}(myboolist0)\n\n(* ****** ****** *)\n\nval ((*void*)) = fprintln! (stdout_ref, \"myboolist0 = \", myboolist0)\n\n(* ****** ****** *)\n\nimplement main0 () = ()\n\n(* ****** ****** *)\n\n(* end of [CoYonedaLemma.dats] *)\n" }, { "path": "src/test/resources/samples/langs/ATS/DiningPhil2.dats", "content": "(* ****** ****** *)\n//\n// HX-2013-11\n//\n// Implementing a variant of\n// the problem of Dining Philosophers\n//\n(* ****** ****** *)\n//\n#include\n\"share/atspre_define.hats\"\n#include\n\"share/atspre_staload.hats\"\n//\n(* ****** ****** *)\n\nstaload\nUN = \"prelude/SATS/unsafe.sats\"\n\n(* ****** ****** *)\n\nstaload \"libc/SATS/stdlib.sats\"\nstaload \"libc/SATS/unistd.sats\"\n\n(* ****** ****** *)\n\nstaload \"{$LIBATSHWXI}/teaching/mythread/SATS/channel.sats\"\n\n(* ****** ****** *)\n\nstaload _ = \"libats/DATS/deqarray.dats\"\nstaload _ = \"{$LIBATSHWXI}/teaching/mythread/DATS/channel.dats\"\n\n(* ****** ****** *)\n\nstaload \"./DiningPhil2.sats\"\n\n(* ****** ****** *)\n\nimplement phil_left (n) = n\nimplement phil_right (n) = (n+1) \\nmod NPHIL\n\n(* ****** ****** *)\n//\nextern\nfun randsleep (n: intGte(1)): void\n//\nimplement\nrandsleep (n) =\n ignoret (sleep($UN.cast{uInt}(rand() mod n + 1)))\n// end of [randsleep]\n//\n(* ****** ****** *)\n\nimplement\nphil_think (n) =\n{\nval () = println! (\"phil_think(\", n, \") starts\")\nval () = randsleep (6)\nval () = println! (\"phil_think(\", n, \") finishes\")\n}\n\n(* ****** ****** *)\n\nimplement\nphil_dine (n, lf, rf) =\n{\nval () = println! (\"phil_dine(\", n, \") starts\")\nval () = randsleep (3)\nval () = println! (\"phil_dine(\", n, \") finishes\")\n}\n\n(* ****** ****** *)\n\nimplement\nphil_loop (n) = let\n//\nval () = phil_think (n)\n//\nval nl = phil_left (n)\nval nr = phil_right (n)\n//\nval ch_lfork = fork_changet (nl)\nval ch_rfork = fork_changet (nr)\n//\nval lf = channel_takeout (ch_lfork)\nval () = println! (\"phil_loop(\", n, \") picks left fork\")\n//\nval () = randsleep (2) // HX: try to actively induce deadlock\n//\nval rf = channel_takeout (ch_rfork)\nval () = println! (\"phil_loop(\", n, \") picks right fork\")\n//\nval () = phil_dine (n, lf, rf)\n//\nval ch_forktray = forktray_changet ()\nval () = channel_insert (ch_forktray, lf)\nval () = channel_insert (ch_forktray, rf)\n//\nin\n phil_loop (n)\nend // end of [phil_loop]\n\n(* ****** ****** *)\n\nimplement\ncleaner_wash (f) =\n{\nval f = fork_get_num (f)\nval () = println! (\"cleaner_wash(\", f, \") starts\")\nval () = randsleep (1)\nval () = println! (\"cleaner_wash(\", f, \") finishes\")\n}\n\n(* ****** ****** *)\n\nimplement\ncleaner_return (f) =\n{\n val n = fork_get_num (f)\n val ch = fork_changet (n)\n val () = channel_insert (ch, f)\n}\n\n(* ****** ****** *)\n\nimplement\ncleaner_loop () = let\n//\nval ch = forktray_changet ()\nval f0 = channel_takeout (ch)\n//\nval () = cleaner_wash (f0)\nval () = cleaner_return (f0)\n//\nin\n cleaner_loop ()\nend // end of [cleaner_loop]\n\n(* ****** ****** *)\n\ndynload \"DiningPhil2.sats\"\ndynload \"DiningPhil2_fork.dats\"\ndynload \"DiningPhil2_thread.dats\"\n\n(* ****** ****** *)\n\nlocal\n//\nstaload\n\"{$LIBATSHWXI}/teaching/mythread/SATS/mythread.sats\"\n//\nin (* in of [local] *)\n//\nval () = mythread_create_cloptr (llam () => phil_loop (0))\nval () = mythread_create_cloptr (llam () => phil_loop (1))\nval () = mythread_create_cloptr (llam () => phil_loop (2))\nval () = mythread_create_cloptr (llam () => phil_loop (3))\nval () = mythread_create_cloptr (llam () => phil_loop (4))\n//\nval () = mythread_create_cloptr (llam () => cleaner_loop ())\n//\nend // end of [local]\n\n(* ****** ****** *)\n\nimplement\nmain0 () =\n{\n//\nval () = println! (\"DiningPhil2: starting\")\nval ((*void*)) = while (true) ignoret (sleep(1))\n//\n} (* end of [main0] *)\n\n(* ****** ****** *)\n\n(* end of [DiningPhil2.dats] *)\n" }, { "path": "src/test/resources/samples/langs/ATS/DiningPhil2.sats", "content": "(* ****** ****** *)\n//\n// HX-2013-11\n//\n// Implementing a variant of\n// the problem of Dining Philosophers\n//\n(* ****** ****** *)\n\n#include\n\"share/atspre_define.hats\"\n\n(* ****** ****** *)\n\nstaload \"{$LIBATSHWXI}/teaching/mythread/SATS/channel.sats\"\n\n(* ****** ****** *)\n\n%{#\n#define NPHIL 5\n%} // end of [%{#]\n#define NPHIL 5\n\n(* ****** ****** *)\n\ntypedef nphil = natLt(NPHIL)\n\n(* ****** ****** *)\n\nfun phil_left (n: nphil): nphil\nfun phil_right (n: nphil): nphil\n\n(* ****** ****** *)\n//\nfun phil_loop (n: nphil): void\n//\n(* ****** ****** *)\n\nfun cleaner_loop ((*void*)): void\n\n(* ****** ****** *)\n\nabsvtype fork_vtype = ptr\nvtypedef fork = fork_vtype\n\n(* ****** ****** *)\n\nfun fork_get_num (!fork): nphil\n\n(* ****** ****** *)\n\nfun phil_dine\n (n: nphil, lf: !fork, rf: !fork): void\n// end of [phil_dine]\n\nfun phil_think (n: nphil): void\n\n(* ****** ****** *)\n\nfun cleaner_wash (f: !fork): void\nfun cleaner_return (f: fork): void\n\n(* ****** ****** *)\n//\nfun fork_changet (n: nphil): channel(fork)\n//\nfun forktray_changet ((*void*)): channel(fork)\n//\n(* ****** ****** *)\n\n(* end of [DiningPhil2.sats] *)\n" }, { "path": "src/test/resources/samples/langs/ATS/DiningPhil2_fork.dats", "content": "(* ****** ****** *)\n//\n// HX-2013-11\n//\n// Implementing a variant of\n// the problem of Dining Philosophers\n//\n(* ****** ****** *)\n//\n#include\n\"share/atspre_define.hats\"\n#include\n\"share/atspre_staload.hats\"\n//\n(* ****** ****** *)\n\nstaload\nUN = \"prelude/SATS/unsafe.sats\"\n\n(* ****** ****** *)\n\nstaload \"{$LIBATSHWXI}/teaching/mythread/SATS/channel.sats\"\n\n(* ****** ****** *)\n\nstaload _ = \"libats/DATS/deqarray.dats\"\nstaload _ = \"{$LIBATSHWXI}/teaching/mythread/DATS/channel.dats\"\n\n(* ****** ****** *)\n\nstaload \"./DiningPhil2.sats\"\n\n(* ****** ****** *)\n\ndatavtype fork = FORK of (nphil)\n\n(* ****** ****** *)\n\nassume fork_vtype = fork\n\n(* ****** ****** *)\n\nimplement\nfork_get_num (f) = let val FORK(n) = f in n end\n\n(* ****** ****** *)\n\nlocal\n\nval\nthe_forkarray = let\n//\ntypedef t = channel(fork)\n//\nimplement\narray_tabulate$fopr\n (n) = ch where\n{\n val n = $UN.cast{nphil}(n)\n val ch = channel_create_exn (i2sz(2))\n val () = channel_insert (ch, FORK (n))\n}\n//\nin\n arrayref_tabulate (i2sz(NPHIL))\nend // end of [val]\n\nin (* in of [local] *)\n\nimplement fork_changet (n) = the_forkarray[n]\n\nend // end of [local]\n\n(* ****** ****** *)\n\nlocal\n\nval the_forktray =\n channel_create_exn (i2sz(NPHIL+1))\n\nin (* in of [local] *)\n\nimplement forktray_changet () = the_forktray\n\nend // end of [local]\n\n(* ****** ****** *)\n\n(* end of [DiningPhil2_fork.dats] *)\n" }, { "path": "src/test/resources/samples/langs/ATS/DiningPhil2_thread.dats", "content": "(* ****** ****** *)\n//\n// HX-2013-11\n//\n// Implementing a variant of\n// the problem of Dining Philosophers\n//\n(* ****** ****** *)\n//\n#include \"share/atspre_define.hats\"\n#include \"share/atspre_staload.hats\"\n//\n(* ****** ****** *)\n\nstaload \"{$LIBATSHWXI}/teaching/mythread/SATS/mythread.sats\"\n\n(* ****** ****** *)\n\nlocal\n//\n#include \"{$LIBATSHWXI}/teaching/mythread/DATS/mythread.dats\"\n//\nin (* in of [local] *)\n//\n// HX: it is intentionally left to be empty\n//\nend // end of [local]\n\n(* ****** ****** *)\n\nlocal\n//\n#include \"{$LIBATSHWXI}/teaching/mythread/DATS/mythread_posix.dats\"\n//\nin (* in of [local] *)\n//\n// HX: it is intentionally left to be empty\n//\nend // end of [local]\n\n(* ****** ****** *)\n\n(* end of [DiningPhil2_thread.dats] *)\n" }, { "path": "src/test/resources/samples/langs/ATS/YonedaLemma.dats", "content": "(* ****** ****** *)\n//\n// HX-2014-01\n// Yoneda Lemma:\n// The hardest \"trivial\" theorem :)\n//\n(* ****** ****** *)\n//\n#include\n\"share/atspre_staload.hats\"\n//\n(* ****** ****** *)\n\nstaload\n\"libats/ML/SATS/basis.sats\"\nstaload\n\"libats/ML/SATS/list0.sats\"\nstaload\n\"libats/ML/SATS/option0.sats\"\n\n(* ****** ****** *)\n\nstaload _ = \"libats/ML/DATS/list0.dats\"\nstaload _ = \"libats/ML/DATS/option0.dats\"\n\n(* ****** ****** *)\n\nsortdef ftype = type -> type\n\n(* ****** ****** *)\n\ninfixr (->) ->>\ntypedef ->> (a:type, b:type) = a - b\n\n(* ****** ****** *)\n\ntypedef\nfunctor(F:ftype) =\n {a,b:type} (a ->> b) ->> F(a) ->> F(b)\n\n(* ****** ****** *)\n\ntypedef\nlist0 (a:type) = list0 (a)\nextern\nval functor_list0 : functor (list0)\n\n(* ****** ****** *)\n\nimplement\nfunctor_list0{a,b}\n (f) = lam xs => list0_map (xs, f)\n\n(* ****** ****** *)\n\ntypedef\noption0 (a:type) = option0 (a) \nextern\nval functor_option0 : functor (option0)\n \n(* ****** ****** *)\n\nimplement\nfunctor_option0{a,b}\n (f) = lam opt => option0_map (opt, f)\n\n(* ****** ****** *)\n\nextern\nval functor_homres\n : {c:type} functor (lam(r:type) => c ->> r)\n\n(* ****** ****** *)\n\nimplement\nfunctor_homres{c}{a,b} (f) = lam (r) => lam (x) => f (r(x))\n\n(* ****** ****** *)\n//\nextern\nfun Yoneda_phi : {F:ftype}functor(F) ->\n {a:type}F(a) ->> ({r:type}(a ->> r) ->> F(r))\nextern\nfun Yoneda_psi : {F:ftype}functor(F) ->\n {a:type}({r:type}(a ->> r) ->> F(r)) ->> F(a)\n//\n(* ****** ****** *)\n//\nimplement\nYoneda_phi\n (ftor) = lam(fx) => lam (m) => ftor(m)(fx)\n//\nimplement\nYoneda_psi (ftor) = lam(mf) => mf(lam x => x)\n//\n(* ****** ****** *)\n\n(*\n\n(* ****** ****** *)\n//\n// HX-2014-01-05:\n// Another version based on Natural Transformation\n//\n(* ****** ****** *)\n\ntypedef\nnatrans(F:ftype, G:ftype) = {x:type} (F(x) ->> G(x))\n\n(* ****** ****** *)\n//\nextern\nfun Yoneda_phi_nat : {F:ftype}functor(F) ->\n {a:type} F(a) ->> natrans(lam (r:type) => (a ->> r), F)\nextern\nfun Yoneda_psi_nat : {F:ftype}functor(F) ->\n {a:type} natrans(lam (r:type) => (a ->> r), F) ->> F(a)\n//\n(* ****** ****** *)\n//\nimplement\nYoneda_phi_nat\n (ftor) = lam(fx) => lam (m) => ftor(m)(fx)\n//\nimplement\nYoneda_psi_nat (ftor) = lam(mf) => mf(lam x => x)\n//\n(* ****** ****** *)\n\n*)\n\n(* ****** ****** *)\n\ndatatype bool = True | False // boxed boolean\n\n(* ****** ****** *)\n//\nfun bool2string\n (x:bool): string =\n(\n case+ x of True() => \"True\" | False() => \"False\"\n)\n//\nimplement\nfprint_val (out, x) = fprint (out, bool2string(x))\n//\n(* ****** ****** *)\n//\nval myboolist0 =\n $list_t{bool}(True, False, True, False, False)\nval myboolist0 = g0ofg1_list (myboolist0)\n//\n(* ****** ****** *)\n//\nextern\nval Yoneda_bool_list0 : {r:type} (bool ->> r) ->> list0(r)\n//\nimplement\nYoneda_bool_list0 =\n Yoneda_phi(functor_list0){bool}(myboolist0)\n//\n(* ****** ****** *)\n//\nval myboolist1 =\n Yoneda_psi(functor_list0){bool}(Yoneda_bool_list0)\n//\n(* ****** ****** *)\n\nval () = fprintln! (stdout_ref, \"myboolist0 = \", myboolist0)\nval () = fprintln! (stdout_ref, \"myboolist1 = \", myboolist1)\n\n(* ****** ****** *)\n\nimplement main0 () = ()\n\n(* ****** ****** *)\n\n(* end of [YonedaLemma.dats] *)\n" }, { "path": "src/test/resources/samples/langs/ATS/basis_ssntype.sats", "content": "(*\n* The MIT License (MIT)\n*\n* Copyright (c) 2014 Hongwei Xi\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 deal\n* in the Software without restriction, including without limitation the rights\n* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n* 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 all\n* 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* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n* SOFTWARE.)\n*)\n\n// Source: https://github.com/githwxi/ATS-Postiats-contrib/blob/201d635062d0ea64ff5ba5457a4ea0bb4d5ae202/contrib/libats-/hwxi/teaching/mysession-g/SATS/basis_ssntype.sats\n\n(*\n** Basis for g-session types\n*)\n\n(* ****** ****** *)\n//\nstaload\n\"./basis_intset.sats\"\n//\n(* ****** ****** *)\n//\nfun{}\nchannel_cap(): intGte(1) \n//\n(* ****** ****** *)\n//\nabstype\nsession_msg\n (i:int, j:int, a:vt@ype)\n//\n(* ****** ****** *)\n\nabstype ssession_nil\nabstype ssession_cons(a:type, ssn:type)\n\n(* ****** ****** *)\n//\nstadef msg = session_msg\n//\nstadef nil = ssession_nil\n//\nstadef :: = ssession_cons\nstadef cons = ssession_cons\n//\n(* ****** ****** *)\n//\nabstype\nsession_append\n (ssn1: type, ssn2: type)\n//\nstadef append = session_append\n//\n(* ****** ****** *)\n//\nabstype\nsession_choose\n(\n i:int, ssn1:type, ssn2:type\n) (* session_choose *)\n//\nstadef choose = session_choose\n//\n(* ****** ****** *)\n//\nabstype\nsession_repeat\n(\n i:int, ssn:type(*body*)\n) (* session_repeat *)\n//\nstadef repeat = session_repeat\n//\n(* ****** ****** *)\n//\ntypedef\nsession_sing\n(\n i: int\n, j: int\n, a:vt@ype\n) = cons(msg(i, j, a), nil)\n//\n(* ****** ****** *)\n//\nabsvtype\nchannel1_vtype\n (G:iset, n:int, ssn:type) = ptr\n//\nvtypedef\nchannel1\n (G:iset, n:int, ssn:type) = channel1_vtype(G, n, ssn)\n//\nvtypedef\ncchannel1\n (G:iset, n:int, ssn:type) = channel1_vtype(ncomp(n, G), n, ssn)\n//\n(* ****** ****** *)\n//\nfun{}\nchannel1_get_nrole\n {n:int}{ssn:type}{G:iset}\n (chan: !channel1(G, n, ssn)): int(n)\n//\nfun{}\nchannel1_get_group\n {n:int}{ssn:type}{G:iset}\n (chan: !channel1(G, n, ssn)): intset(n,G)\n//\n(* ****** ****** *)\n//\nfun\n{a:vt0p}\nchannel1_close\n {n:int}{ssn:type}{G:iset}(chan: channel1(G, n, nil)): void\n//\n(* ****** ****** *)\n//\nfun{}\nchannel1_skipin\n {a:vt0p}\n {n:int}{ssn:type}{G:iset}\n {i,j:nat | ismbr(G, i); ismbr(G, j)}\n(\n !channel1(G, n, msg(i, j, a)::ssn) >> channel1(G, n, ssn)\n) : void // end-of-function\npraxi\nlemma_channel1_skipin\n {a:vt0p}\n {n:int}{ssn:type}{G:iset}\n {i,j:nat | ismbr(G, i); ismbr(G, j)}\n(\n !channel1(G, n, msg(i, j, a)::ssn) >> channel1(G, n, ssn)\n) : void // lemma_channel1_skipin\n//\nfun{}\nchannel1_skipex\n {a:vt0p}\n {n:int}{ssn:type}{G:iset}\n {i,j:nat | ~ismbr(G, i); ~ismbr(G, j)}\n(\n !channel1(G, n, msg(i, j, a)::ssn) >> channel1(G, n, ssn)\n) : void // end-of-function\npraxi\nlemma_channel1_skipex\n {a:vt0p}\n {n:int}{ssn:type}{G:iset}\n {i,j:nat | ~ismbr(G, i); ~ismbr(G, j)}\n(\n !channel1(G, n, msg(i, j, a)::ssn) >> channel1(G, n, ssn)\n) : void // lemma_channel1_skipex\n//\n(* ****** ****** *)\n//\nfun\n{a:vt0p}\nchannel1_send\n {n:int}{ssn:type}{G:iset}\n {i,j:nat | i < n; j < n; ismbr(G, i); ~ismbr(G, j)}\n(\n !channel1(G, n, msg(i, j, a)::ssn) >> channel1(G, n, ssn), int(i), int(j), a\n) : void // end of [channel1_send]\n//\nfun\n{a:vt0p}\nchannel1_recv\n {n:int}{ssn:type}{G:iset}\n {i,j:nat | i < n; j < n; ~ismbr(G, i); ismbr(G, j)}\n(\n !channel1(G, n, msg(i, j, a)::ssn) >> channel1(G, n, ssn), int(i), int(j), &a? >> a\n) : void // end of [channel1_recv]\n//\nfun\n{a:vt0p}\nchannel1_recv_val\n {n:int}{ssn:type}{G:iset}\n {i,j:nat | i < n; j < n; ~ismbr(G, i); ismbr(G, j)}\n (!channel1(G, n, msg(i, j, a)::ssn) >> channel1(G, n, ssn), int(i), int(j)): (a)\n//\n(* ****** ****** *)\n\nfun{}\nchannel1_append\n {n:int}\n {ssn1,ssn2:type}\n {G:iset}\n(\n chan: !channel1(G, n, append(ssn1, ssn2)) >> channel1(G, n, ssn2)\n, fserv: (!channel1(G, n, ssn1) >> channel1(G, n, nil)) - void\n) : void // end of [channel1_append]\n\n(* ****** ****** *)\n//\ndatatype\nchoosetag\n(\n a:type, b:type, c:type\n) =\n | choosetag_l(a, b, a) of ()\n | choosetag_r(a, b, b) of ()\n//\n(* ****** ****** *)\n//\nfun{}\nchannel1_choose_l\n {n:int}\n {ssn1,ssn2:type}\n {G:iset}\n {i:nat | i < n; ismbr(G, i)}\n(\n !channel1(G, n, choose(i,ssn1,ssn2)) >> channel1(G, n, ssn1), i: int(i)\n) : void // end of [channel1_choose_l]\n//\nfun{}\nchannel1_choose_r\n {n:int}\n {ssn1,ssn2:type}\n {G:iset}\n {i:nat | i < n; ismbr(G, i)}\n(\n !channel1(G, n, choose(i,ssn1,ssn2)) >> channel1(G, n, ssn2), i: int(i)\n) : void // end of [channel1_choose_r]\n//\nfun{}\nchannel1_choose_tag\n {n:int}\n {ssn1,ssn2:type}\n {G:iset}\n {i:nat | i < n; ~isnil(G); ~ismbr(G, i)}\n(\n !channel1(G, n, choose(i,ssn1,ssn2)) >> channel1(G, n, ssn_chosen), i: int(i)\n) : #[ssn_chosen:type] choosetag(ssn1, ssn2, ssn_chosen)\n//\n(* ****** ****** *)\n//\nfun{}\nchannel1_repeat_0\n {n:int}\n {ssn:type}\n {G:iset}\n {i:nat | i < n; ismbr(G, i)}\n(\n !channel1(G, n, repeat(i,ssn)) >> channel1(G, n, nil), i: int(i)\n) : void // end of [channel1_repeat_nil]\n//\nfun{}\nchannel1_repeat_1\n {n:int}\n {ssn:type}\n {G:iset}\n {i:nat | i < n; ismbr(G, i)}\n(\n !channel1(G, n, repeat(i,ssn)) >> channel1(G, n, append(ssn,repeat(i,ssn))), i: int(i)\n) : void // end of [channel1_repeat_more]\n//\nfun{}\nchannel1_repeat_tag\n {n:int}\n {ssn:type}\n {G:iset}\n {i:nat | i < n; ~isnil(G); ~ismbr(G, i)}\n(\n !channel1(G, n, repeat(i,ssn)) >> channel1(G, n, ssn_chosen), i: int(i)\n) : #[ssn_chosen:type] choosetag(nil, append(ssn,repeat(i,ssn)), ssn_chosen)\n//\n(* ****** ****** *)\n//\n(*\n//\n// HX-2015-03-06:\n// This one does not work with sschoose!!!\n//\nfun{}\nchannel1_link\n {n:int}{ssn:type}\n {G1,G2:iset | isnil(G1*G2)}\n (channel1(G1, n, ssn), channel1(G2, n, ssn)): channel1(G1+G2, n, ssn)\n*)\n//\nfun{}\nchannel1_link\n {n:int}{ssn:type}\n {G1,G2:iset | isful(G1+G2,n)}\n (channel1(G1, n, ssn), channel1(G2, n, ssn)): channel1(G1*G2, n, ssn)\n//\n(* ****** ****** *)\n//\nfun{}\nchannel1_link_elim\n {n:int}{ssn:type}{G:iset}(channel1(G, n, ssn), cchannel1(G, n, ssn)): void\n//\n(* ****** ****** *)\n//\nfun{}\ncchannel1_create_exn\n {n:nat}{ssn:type}{G:iset}\n(\n nrole: int(n), G: intset(n), fserv: channel1(G, n, ssn) - void\n) : cchannel1(G, n, ssn) // end of [cchannel1_create_exn]\n//\n(* ****** ****** *)\n\n(* end of [basis_ssntype.sats] *)\n" }, { "path": "src/test/resources/samples/langs/ATS/csv_parse.hats", "content": "(*\n* The MIT License (MIT)\n*\n* Copyright (c) 2014 Hongwei Xi\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 deal\n* in the Software without restriction, including without limitation the rights\n* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n* 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 all\n* 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* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n* SOFTWARE.)\n*)\n\n// Source: https://github.com/githwxi/ATS-Postiats-contrib/blob/0f26aa0df8542d2ae21df9be1e13208f66f571d6/contrib/libats-/hwxi/teaching/mygrading/HATS/csv_parse.hats\n\n(* ****** ****** *)\n//\n// Author: Hongwei Xi\n// Authoremail: gmhwxiATgmailDOTcom\n// Start time: the first of July, 2016\n//\n(* ****** ****** *)\n//\n#ifdef\nMYGRADING_HATS\n#then\n#else\n//\nextern\nfun\ncsv_parse_line\n(\n line: string\n) : List0_vt(Strptr1)\n//\n#endif // #ifdef\n//\n(* ****** ****** *)\n\nlocal\n//\nstaload\nUN = \"prelude/SATS/unsafe.sats\"\n//\nextern\nfun{}\ngetpos(): int\n//\nextern\nfun{}\nis_end(): bool\n//\nextern\nfun{}\nchar_at(): int\n//\nextern\nfun{}\nStrptr1_at(i0: int): Strptr1\n//\nextern\nfun{}\nrmove(): void\nextern\nfun{}\nrmove_while(test: char - bool): void\n//\nin (* in-of-local *)\n//\nimplement\n{}(*tmp*)\nrmove_while\n (test) = let\n//\nval c0 = char_at()\n//\nin\n//\nif c0 >= 0 then\n if test(int2char0(c0)) then (rmove(); rmove_while(test)) else ()\n// end of [if]\n//\nend // end of [rmove_while]\n\n(* ****** ****** *)\n\nimplement\ncsv_parse_line\n (line) = let\n//\nval line = g1ofg0(line)\n//\nvar i: int = 0\nval p_i = addr@i\n//\nval n0 = sz2i(length(line))\n//\nmacdef get_i() = $UN.ptr0_get(p_i)\nmacdef inc_i() = $UN.ptr0_addby(p_i, 1)\nmacdef set_i(i0) = $UN.ptr0_set(p_i, ,(i0))\n//\nimplement\ngetpos<>() = get_i()\n//\nimplement\nis_end<>() = get_i() >= n0\n//\nimplement\nchar_at<>() = let\n val i = get_i()\n val i = ckastloc_gintGte(i, 0)\n//\nin\n if i < n0 then char2u2int0(line[i]) else ~1\nend // end of [char_at]\n//\nimplement\nStrptr1_at<>(i0) = let\n//\n val i1 = get_i()\n val i0 = ckastloc_gintGte(i0, 0)\n val i1 = ckastloc_gintBtwe(i1, i0, n0)\n//\nin\n $UN.castvwtp0(\n string_make_substring(line, i2sz(i0), i2sz(i1-i0))\n ) (* $UN.castvwtp0 *)\nend // end of [Strptr1_at]\n//\nimplement\nrmove<>() =\n if get_i() < n0 then inc_i()\n//\nvtypedef res_vt = List0_vt(Strptr1)\n//\nfun\nloop\n(\n i: int, res: res_vt\n) : res_vt =\nif\nis_end()\nthen res\nelse let\n val () =\n (\n if i > 0 then rmove()\n )\n val i0 = getpos()\n var f0 =\n (\n lam@(c: char) = c != ','\n )\n val () = rmove_while($UN.cast(addr@f0))\n val s0 = Strptr1_at(i0)\nin\n loop(i+1, list_vt_cons(s0, res))\nend // end of [else]\n//\nin\n list_vt_reverse(loop(0(*i*), list_vt_nil((*void*))))\nend // end of [csv_parse_line]\n\nend // end of [local]\n\n(* ****** ****** *)\n\n(* end of [csv_parse.hats] *)\n" }, { "path": "src/test/resources/samples/langs/ATS/intinf_vt.dats", "content": "(***********************************************************************)\n(* *)\n(* ATS/contrib/atshwxi *)\n(* *)\n(***********************************************************************)\n\n(*\n** Copyright (C) 2013 Hongwei Xi, ATS Trustful Software, Inc.\n**\n** Permission is hereby granted, free of charge, to any person obtaining a\n** copy of this software and associated documentation files (the \"Software\"),\n** to deal in the Software without restriction, including without limitation\n** the rights to use, copy, modify, merge, publish, distribute, sublicense,\n** and/or sell copies of the Software, and to permit persons to whom the\n** Software is furnished to do so, subject to the following stated 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\n** OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n** FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n** THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n** LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n** FROM OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n** IN THE SOFTWARE.\n*)\n\n// Source: https://github.com/githwxi/ATS-Postiats-contrib/blob/04a984d9c08c1831f7dda8a05ce356db01f81850/contrib/libats-/hwxi/intinf/DATS/intinf_vt.dats\n\n(* ****** ****** *)\n//\n// Author: Hongwei Xi\n// Authoremail: hwxi AT gmail DOT com\n// Start Time: April, 2013\n//\n(* ****** ****** *)\n\n#include\n\"share/atspre_define.hats\"\n\n(* ****** ****** *)\n\nstaload\nUN = \"prelude/SATS/unsafe.sats\"\n\n(* ****** ****** *)\n\nstaload\nGMP = \"{$LIBGMP}/SATS/gmp.sats\"\n\n(* ****** ****** *)\n\nvtypedef mpz = $GMP.mpz_vt0ype\n\n(* ****** ****** *)\n//\nstaload \"./../SATS/intinf.sats\"\nstaload \"./../SATS/intinf_vt.sats\"\n//\n(* ****** ****** *)\n\nmacdef i2u (x) = g1int2uint_int_uint (,(x))\n\n(* ****** ****** *)\n\nlocal\n\nassume\nintinf_vtype\n (i: int) = // HX: [i] is a fake\n [l:addr] (mpz @ l, mfree_gc_v (l) | ptr l)\n// end of [intinf_vtype]\n\nin (* in of [local] *)\n\nimplement{}\nintinf_make_int\n (i) = (x) where\n{\n//\nval x = ptr_alloc ()\nval () = $GMP.mpz_init_set_int (!(x.2), i)\n//\n} (* end of [intinf_make_int] *)\n\nimplement{}\nintinf_make_uint\n (i) = (x) where\n{\n//\nval x = ptr_alloc ()\nval () = $GMP.mpz_init_set_uint (!(x.2), i)\n//\n} (* end of [intinf_make_uint] *)\n\nimplement{}\nintinf_make_lint\n (i) = (x) where\n{\n//\nval x = ptr_alloc ()\nval () = $GMP.mpz_init_set_lint (!(x.2), i)\n//\n} (* end of [intinf_make_lint] *)\n\nimplement{}\nintinf_make_ulint\n (i) = (x) where\n{\n//\nval x = ptr_alloc ()\nval () = $GMP.mpz_init_set_ulint (!(x.2), i)\n//\n} (* end of [intinf_make_ulint] *)\n\n(* ****** ****** *)\n\nimplement{}\nintinf_free (x) = let\n val (pfat, pfgc | p) = x\n val () = $GMP.mpz_clear (!p) in ptr_free (pfgc, pfat | p)\nend (* end of [intinf_free] *)\n\n(* ****** ****** *)\n\nimplement{}\nintinf_get_int (x) = $GMP.mpz_get_int (!(x.2))\nimplement{}\nintinf_get_lint (x) = $GMP.mpz_get_lint (!(x.2))\n\n(* ****** ****** *)\n\nimplement{}\nintinf_get_strptr\n (x, base) = $GMP.mpz_get_str_null (base, !(x.2))\n// end of [intinf_get_strptr]\n\n(* ****** ****** *)\n\nimplement{}\nfprint_intinf_base\n (out, x, base) = let\n val nsz = $GMP.mpz_out_str (out, base, !(x.2))\nin\n//\nif (nsz = 0) then\n exit_errmsg (1, \"libgmp/gmp: fprint_intinf_base\")\n// end of [if]\n//\nend (* fprint_intinf_base *)\n\n(* ****** ****** *)\n\nimplement{\n} neg_intinf0\n (x) = (x) where\n{\n//\nval () = $GMP.mpz_neg (!(x.2))\n//\n} (* end of [neg_intinf0] *)\n\nimplement{\n} neg_intinf1\n (x) = (y) where\n{\n//\nval y = ptr_alloc ()\nval () = $GMP.mpz_init (!(y.2))\nval () = $GMP.mpz_neg (!(y.2), !(x.2))\n//\n} (* end of [neg_intinf1] *)\n\n(* ****** ****** *)\n\nimplement{\n} abs_intinf0\n (x) = (x) where\n{\n//\nval () = $GMP.mpz_abs (!(x.2))\n//\n} (* end of [abs_intinf0] *)\n\nimplement{\n} abs_intinf1\n (x) = (y) where\n{\n//\nval y = ptr_alloc ()\nval () = $GMP.mpz_init (!(y.2))\nval () = $GMP.mpz_abs (!(y.2), !(x.2))\n//\n} (* end of [abs_intinf1] *)\n\n(* ****** ****** *)\n\nimplement{}\nsucc_intinf0 (x) = add_intinf0_int (x, 1)\nimplement{}\nsucc_intinf1 (x) = add_intinf1_int (x, 1)\n\n(* ****** ****** *)\n\nimplement{}\npred_intinf0 (x) = sub_intinf0_int (x, 1)\nimplement{}\npred_intinf1 (x) = sub_intinf1_int (x, 1)\n\n(* ****** ****** *)\n\nimplement{}\nadd_intinf0_int\n (x, y) = (x) where\n{\n//\nval () = $GMP.mpz_add2_int (!(x.2), y)\n//\n} (* end of [add_intinf0_int] *)\n\nimplement{}\nadd_intinf1_int\n (x, y) = (z) where\n{\n//\nval z = ptr_alloc ()\nval () = $GMP.mpz_init (!(z.2))\nval () = $GMP.mpz_add3_int (!(z.2), !(x.2), y)\n//\n} (* end of [add_intinf1_int] *)\n\n(* ****** ****** *)\n\nimplement{}\nadd_int_intinf0 (x, y) = add_intinf0_int (y, x)\nimplement{}\nadd_int_intinf1 (x, y) = add_intinf1_int (y, x)\n\n(* ****** ****** *)\n\nimplement{}\nadd_intinf0_intinf1\n (x, y) = (x) where\n{\n//\nval () = $GMP.mpz_add2_mpz (!(x.2), !(y.2))\n//\n} (* end of [add_intinf0_intinf1] *)\n\nimplement{}\nadd_intinf1_intinf0\n (x, y) = (y) where\n{\n//\nval () = $GMP.mpz_add2_mpz (!(y.2), !(x.2))\n//\n} (* end of [add_intinf1_intinf0] *)\n\n(* ****** ****** *)\n\nimplement{}\nadd_intinf1_intinf1\n (x, y) = (z) where\n{\n//\nval z = ptr_alloc ()\nval () = $GMP.mpz_init (!(z.2))\nval () = $GMP.mpz_add3_mpz (!(z.2), !(x.2), !(y.2))\n//\n} (* end of [add_intinf1_intinf1] *)\n\n(* ****** ****** *)\n\nimplement{}\nsub_intinf0_int\n (x, y) = (x) where\n{\n//\nval () = $GMP.mpz_sub2_int (!(x.2), y)\n//\n} (* end of [sub_intinf0_int] *)\n\nimplement{}\nsub_intinf1_int\n (x, y) = (z) where\n{\n//\nval z = ptr_alloc ()\nval () = $GMP.mpz_init (!(z.2))\nval () = $GMP.mpz_sub3_int (!(z.2), !(x.2), y)\n//\n} (* end of [sub_intinf1_int] *)\n\n(* ****** ****** *)\n\nimplement{}\nsub_int_intinf0 (x, y) = let\n val z = sub_intinf0_int (y, x) in neg_intinf0 (z)\nend (* end of [sub_int_intinf0] *)\n\nimplement{}\nsub_int_intinf1 (x, y) = let\n val z = sub_intinf1_int (y, x) in neg_intinf0 (z)\nend (* end of [sub_int_intinf1] *)\n\n(* ****** ****** *)\n\nimplement{}\nsub_intinf0_intinf1\n (x, y) = (x) where\n{\n//\nval () = $GMP.mpz_sub2_mpz (!(x.2), !(y.2))\n//\n} (* end of [sub_intinf0_intinf1] *)\n\nimplement{}\nsub_intinf1_intinf0\n (x, y) = neg_intinf0 (sub_intinf0_intinf1 (y, x))\n// end of [sub_intinf1_intinf0]\n\nimplement{}\nsub_intinf1_intinf1\n (x, y) = (z) where\n{\n//\nval z = ptr_alloc ()\nval () = $GMP.mpz_init (!(z.2))\nval () = $GMP.mpz_sub3_mpz (!(z.2), !(x.2), !(y.2))\n//\n} (* end of [sub_intinf1_intinf1] *)\n\n(* ****** ****** *)\n\nimplement{}\nmul_intinf0_int\n (x, y) = (x) where\n{\n//\nval () = $GMP.mpz_mul2_int (!(x.2), y)\n//\n} (* end of [mul_intinf0_int] *)\n\nimplement{}\nmul_intinf1_int\n (x, y) = (z) where\n{\n//\nval z = ptr_alloc ()\nval () = $GMP.mpz_init (!(z.2))\nval () = $GMP.mpz_mul3_int (!(z.2), !(x.2), y)\n//\n} (* end of [mul_intinf1_int] *)\n\n(* ****** ****** *)\n\nimplement{}\nmul_int_intinf0 (x, y) = mul_intinf0_int (y, x)\nimplement{}\nmul_int_intinf1 (x, y) = mul_intinf1_int (y, x)\n\n(* ****** ****** *)\n\nimplement{}\nmul_intinf0_intinf1\n (x, y) = (x) where\n{\n//\nval () = $GMP.mpz_mul2_mpz (!(x.2), !(y.2))\n//\n} (* end of [mul_intinf0_intinf1] *)\n\nimplement{}\nmul_intinf1_intinf0\n (x, y) = (y) where\n{\n//\nval () = $GMP.mpz_mul2_mpz (!(y.2), !(x.2))\n//\n} (* end of [mul_intinf0_intinf1] *)\n\n(* ****** ****** *)\n\nimplement{}\nmul_intinf1_intinf1\n (x, y) = (z) where\n{\n//\nval z = ptr_alloc ()\nval () = $GMP.mpz_init (!(z.2))\nval () = $GMP.mpz_mul3_mpz (!(z.2), !(x.2), !(y.2))\n//\n} (* end of [mul_intinf1_intinf1] *)\n\n(* ****** ****** *)\n\nimplement{}\ndiv_intinf0_int\n {i,j} (x, y) = let\nin\n//\nif y >= 0 then let\n val () = $GMP.mpz_tdiv2_q_uint (!(x.2), i2u(y)) in x\nend else let\n val () = $GMP.mpz_tdiv2_q_uint (!(x.2), i2u(~y)) in neg_intinf0 (x)\nend // end of [if]\n//\nend (* end of [div_intinf0_int] *)\n\nimplement{}\ndiv_intinf1_int\n {i,j} (x, y) = let\n//\nval z = ptr_alloc ()\nval () = $GMP.mpz_init (!(z.2))\n//\nin\n//\nif y >= 0 then let\n val () = $GMP.mpz_tdiv3_q_uint (!(z.2), !(x.2), i2u(y)) in z\nend else let\n val () = $GMP.mpz_tdiv3_q_uint (!(z.2), !(x.2), i2u(~y)) in neg_intinf0 (z)\nend // end of [if]\n//\nend (* end of [div_intinf1_int] *)\n\n(* ****** ****** *)\n\nimplement{}\ndiv_intinf0_intinf1\n (x, y) = (x) where\n{\n//\nval () = $GMP.mpz_tdiv2_q_mpz (!(x.2), !(y.2))\n//\n} (* end of [div_intinf0_intinf1] *)\n\n(* ****** ****** *)\n\nimplement{}\ndiv_intinf1_intinf1\n (x, y) = (z) where\n{\n//\nval z = ptr_alloc ()\nval () = $GMP.mpz_init (!(z.2))\nval () = $GMP.mpz_tdiv3_q_mpz (!(z.2), !(x.2), !(y.2))\n//\n} (* end of [div_intinf1_intinf1] *)\n\n(* ****** ****** *)\n\nimplement{}\nndiv_intinf0_int (x, y) = div_intinf0_int (x, y)\nimplement{}\nndiv_intinf1_int (x, y) = div_intinf1_int (x, y)\n\n(* ****** ****** *)\n\nimplement{}\nnmod_intinf0_int\n {i,j} (x, y) = let\n//\nval r =\n $GMP.mpz_fdiv_uint (!(x.2), i2u(y))\nval () = intinf_free (x)\n//\nin\n $UN.cast{intBtw(0,j)}(r)\nend (* end of [nmod_intinf0_int] *)\n\nimplement{}\nnmod_intinf1_int\n {i,j} (x, y) = let\n//\nval r = $GMP.mpz_fdiv_uint (!(x.2), i2u(y))\n//\nin\n $UN.cast{intBtw(0,j)}(r)\nend (* end of [nmod_intinf1_int] *)\n\n(* ****** ****** *)\n//\n// comparison-functions\n//\n(* ****** ****** *)\n\nimplement{}\nlt_intinf_int\n {i,j} (x, y) = let\n//\nval sgn = $GMP.mpz_cmp_int (!(x.2), y)\nval ans = (if sgn < 0 then true else false): bool\n//\nin\n $UN.cast{bool(i < j)}(sgn)\nend // end of [lt_intinf_int]\n\nimplement{}\nlt_intinf_intinf\n {i,j} (x, y) = let\n//\nval sgn = $GMP.mpz_cmp_mpz (!(x.2), !(y.2))\nval ans = (if sgn < 0 then true else false): bool\n//\nin\n $UN.cast{bool(i < j)}(sgn)\nend // end of [lt_intinf_intinf]\n\n(* ****** ****** *)\n\nimplement{}\nlte_intinf_int\n {i,j} (x, y) = let\n//\nval sgn = $GMP.mpz_cmp_int (!(x.2), y)\nval ans = (if sgn <= 0 then true else false): bool\n//\nin\n $UN.cast{bool(i <= j)}(sgn)\nend // end of [lte_intinf_int]\n\nimplement{}\nlte_intinf_intinf\n {i,j} (x, y) = let\n//\nval sgn = $GMP.mpz_cmp_mpz (!(x.2), !(y.2))\nval ans = (if sgn <= 0 then true else false): bool\n//\nin\n $UN.cast{bool(i <= j)}(sgn)\nend // end of [lte_intinf_intinf]\n\n(* ****** ****** *)\n\nimplement{}\ngt_intinf_int\n {i,j} (x, y) = let\n//\nval sgn = $GMP.mpz_cmp_int (!(x.2), y)\nval ans = (if sgn > 0 then true else false): bool\n//\nin\n $UN.cast{bool(i > j)}(sgn)\nend // end of [gt_intinf_int]\n\nimplement{}\ngt_intinf_intinf\n {i,j} (x, y) = let\n//\nval sgn = $GMP.mpz_cmp_mpz (!(x.2), !(y.2))\nval ans = (if sgn > 0 then true else false): bool\n//\nin\n $UN.cast{bool(i > j)}(sgn)\nend // end of [gt_intinf_intinf]\n\n(* ****** ****** *)\n\nimplement{}\ngte_intinf_int\n {i,j} (x, y) = let\n//\nval sgn = $GMP.mpz_cmp_int (!(x.2), y)\nval ans = (if sgn >= 0 then true else false): bool\n//\nin\n $UN.cast{bool(i >= j)}(sgn)\nend // end of [gte_intinf_int]\n\nimplement{}\ngte_intinf_intinf\n {i,j} (x, y) = let\n//\nval sgn = $GMP.mpz_cmp_mpz (!(x.2), !(y.2))\nval ans = (if sgn >= 0 then true else false): bool\n//\nin\n $UN.cast{bool(i >= j)}(sgn)\nend // end of [gte_intinf_intinf]\n\n(* ****** ****** *)\n\nimplement{}\neq_intinf_int\n {i,j} (x, y) = let\n//\nval sgn = $GMP.mpz_cmp_int (!(x.2), y)\nval ans = (if sgn = 0 then true else false): bool\n//\nin\n $UN.cast{bool(i == j)}(sgn)\nend // end of [eq_intinf_int]\n\nimplement{}\neq_intinf_intinf\n {i,j} (x, y) = let\n//\nval sgn = $GMP.mpz_cmp_mpz (!(x.2), !(y.2))\nval ans = (if sgn = 0 then true else false): bool\n//\nin\n $UN.cast{bool(i == j)}(sgn)\nend // end of [eq_intinf_intinf]\n\n(* ****** ****** *)\n\nimplement{}\nneq_intinf_int\n {i,j} (x, y) = let\n//\nval sgn = $GMP.mpz_cmp_int (!(x.2), y)\nval ans = (if sgn != 0 then true else false): bool\n//\nin\n $UN.cast{bool(i != j)}(sgn)\nend // end of [neq_intinf_int]\n\nimplement{}\nneq_intinf_intinf\n {i,j} (x, y) = let\n//\nval sgn = $GMP.mpz_cmp_mpz (!(x.2), !(y.2))\nval ans = (if sgn != 0 then true else false): bool\n//\nin\n $UN.cast{bool(i != j)}(sgn)\nend // end of [neq_intinf_intinf]\n\n(* ****** ****** *)\n\nimplement{}\ncompare_intinf_int\n {i,j} (x, y) = let\n//\nval sgn = $GMP.mpz_cmp_int (!(x.2), y)\nval sgn = (if sgn < 0 then ~1 else (if sgn > 0 then 1 else 0)): int\n//\nin\n $UN.cast{int(sgn(i-j))}(sgn)\nend // end of [compare_intinf_int]\n\nimplement{}\ncompare_int_intinf\n {i,j} (x, y) = let\n//\nval sgn = $GMP.mpz_cmp_int (!(y.2), x)\nval sgn = (if sgn > 0 then ~1 else (if sgn < 0 then 1 else 0)): int\n//\nin\n $UN.cast{int(sgn(i-j))}(sgn)\nend // end of [compare_int_intinf]\n\nimplement{}\ncompare_intinf_intinf\n {i,j} (x, y) = let\n//\nval sgn = $GMP.mpz_cmp_mpz (!(x.2), !(y.2))\nval sgn = (if sgn < 0 then ~1 else (if sgn > 0 then 1 else 0)): int\n//\nin\n $UN.cast{int(sgn(i-j))}(sgn)\nend // end of [compare_intinf_intinf]\n\n(* ****** ****** *)\n\nimplement{}\npow_intinf_int\n (base, exp) = r where\n{\n//\nval r = ptr_alloc ()\nval () = $GMP.mpz_init (!(r.2))\nval () = $GMP.mpz_pow_uint (!(r.2), !(base.2), i2u(exp))\n//\n} (* end of [pow_intinf_int] *)\n\n(* ****** ****** *)\n\nend // end of [local]\n\n(* ****** ****** *)\n\nimplement{}\nprint_intinf (x) = fprint_intinf (stdout_ref, x)\nimplement{}\nprerr_intinf (x) = fprint_intinf (stderr_ref, x)\nimplement{}\nfprint_intinf (out, x) = fprint_intinf_base (out, x, 10(*base*))\n\n(* ****** ****** *)\n\n(* end of [intinf_vt.dats] *)\n" }, { "path": "src/test/resources/samples/langs/ActionScript/FooBar.as", "content": "// A sample for Actionscript.\n\npackage foobar\n{\n\timport flash.display.MovieClip;\n\n\tclass Bar\n\t{\n\t\tpublic function getNumber():Number\n\t\t{\n\t\t\treturn 10;\n\t\t}\n\t}\n\n\tclass Foo extends Bar\n\t{\n\t\tprivate var ourNumber:Number = 25;\n\n\t\toverride public function getNumber():Number\n\t\t{\n\t\t\treturn ourNumber;\n\t\t}\n\t}\n\n\tclass Main extends MovieClip\n\t{\n\t\tpublic function Main()\n\t\t{\n\t\t\tvar x:Bar = new Bar();\n\t\t\tvar y:Foo = new Foo();\n\t\t\ttrace(x.getNumber());\n\t\t\ttrace(y.getNumber());\n\t\t}\n\t}\n}\n" }, { "path": "src/test/resources/samples/langs/ActionScript/HelloWorld.as", "content": "package mypackage\n{\n\tpublic class Hello\n\t{\n\t\t/* Let's say hello!\n\t\t * This is just a test script for Linguist's Actionscript detection.\n\t\t */\n\t\tpublic function sayHello():void\n\t\t{\n\t\t\ttrace(\"Hello, world\");\n\t\t}\n\t}\n}\n" }, { "path": "src/test/resources/samples/langs/Adobe Font Metrics/OpenSansCondensed-Bold.afm", "content": "StartFontMetrics 2.0\nComment Generated by FontForge 20170719\nComment Creation Date: Sun Jul 23 19:47:25 2017\nFontName OpenSansCondensed-Bold\nFullName Open Sans Condensed Bold\nFamilyName Open Sans Condensed\nWeight Bold\nNotice (Digitized data copyright (c) 2010-2011, Google Corporation.)\nItalicAngle 0\nIsFixedPitch false\nUnderlinePosition -205\nUnderlineThickness 102\nVersion 1.11\nEncodingScheme ISO10646-1\nFontBBox -667 -290 1046 1062\nCapHeight 714\nXHeight 544\nAscender 760\nDescender -240\nStartCharMetrics 939\nC 32 ; WX 247 ; N space ; B 0 0 0 0 ;\nC 33 ; WX 270 ; N exclam ; B 54 -14 216 714 ;\nC 34 ; WX 445 ; N quotedbl ; B 59 456 388 714 ;\nC 35 ; WX 543 ; N numbersign ; B 20 0 525 714 ;\nC 36 ; WX 462 ; N dollar ; B 36 -59 427 760 ;\nC 37 ; WX 758 ; N percent ; B 30 -9 729 725 ;\nC 38 ; WX 581 ; N ampersand ; B 28 -10 572 725 ;\nC 39 ; WX 246 ; N quotesingle ; B 59 456 188 714 ;\nC -1 ; WX 462 ; N six.os ; B 36 -10 427 724 ;\nC -1 ; WX 420 ; N seven.os ; B 19 -170 402 544 ;\nC -1 ; WX 462 ; N eight.os ; B 35 -10 429 724 ;\nC -1 ; WX 461 ; N nine.os ; B 33 -182 424 564 ;\nC -1 ; WX 496 ; N g.alt ; B 36 -241 442 555 ;\nC -1 ; WX 496 ; N gcircumflex.alt ; B 36 -241 442 767 ;\nC -1 ; WX 496 ; N gbreve.alt ; B 36 -241 442 766 ;\nC -1 ; WX 496 ; N gdot.alt ; B 36 -241 442 756 ;\nC -1 ; WX 496 ; N gcommaaccent.alt ; B 36 -241 442 767 ;\nC -1 ; WX 0 ; N cyrotmarkcomb ; B -203 591 203 714 ;\nEndCharMetrics\nStartKernData\nStartKernPairs 15878\nKPX quotedbl uni1ECA 20\nKPX quotedbl uni1EC8 20\nKPX quotedbl Idotaccent 20\nKPX quotedbl Iogonek 20\nKPX quotedbl Imacron 20\nKPX quotedbl Idieresis 20\nKPX quotedbl Icircumflex 20\nKPX quotedbl Iacute 20\nKPX quotedbl Igrave 20\nKPX quotedbl I 20\nKPX quotedbl uni1EF9 20\nKPX quoteleft q -20\nKPX quoteleft o -20\nKPX quoteleft g -9\nKPX quoteleft e -20\nKPX quoteleft d -20\nKPX quoteleft c -20\nKPX quoteleft Z 20\nKPX Delta C -9\nKPX Delta A -20\nKPX Delta question 20\nKPX Delta period -41\nKPX Delta comma -41\nKPX Delta quotesingle 41\nKPX Delta quotedbl 41\nEndKernPairs\nEndKernData\nEndFontMetrics\n" }, { "path": "src/test/resources/samples/langs/Adobe Font Metrics/SpecialElite.afm", "content": "StartFontMetrics 2.0\nComment Generated by FontForge 20170719\nComment Creation Date: Sun Jul 23 19:52:19 2017\nFontName SpecialElite-Regular\nFullName Special Elite\nFamilyName Special Elite\nWeight Book\nNotice (Copyright (c) 2010 by Brian J. Bonislawsky DBA Astigmatic (AOETI). All rights reserved. Available under the Apache 2.0 licence.http://www.apache.org/licenses/LICENSE-2.0.html)\nItalicAngle 0\nIsFixedPitch false\nUnderlinePosition -133\nUnderlineThickness 20\nVersion 1.000\nEncodingScheme ISO10646-1\nFontBBox -33 -322 1052 959\nCapHeight 714\nXHeight 487\nAscender 688\nDescender -225\nStartCharMetrics 371\nC 32 ; WX 292 ; N space ; B 0 0 0 0 ;\nC 33 ; WX 276 ; N exclam ; B 73 0 207 702 ;\nC 34 ; WX 352 ; N quotedbl ; B 48 449 295 704 ;\nC 35 ; WX 554 ; N numbersign ; B 31 -2 524 713 ;\nC 36 ; WX 526 ; N dollar ; B 31 -201 498 919 ;\nC 37 ; WX 666 ; N percent ; B 32 -186 642 872 ;\nC 38 ; WX 676 ; N ampersand ; B 31 -5 645 705 ;\nC 39 ; WX 196 ; N quotesingle ; B 48 449 143 703 ;\nC 40 ; WX 279 ; N parenleft ; B 55 -71 243 757 ;\nC 41 ; WX 281 ; N parenright ; B 37 -59 229 770 ;\nC 42 ; WX 522 ; N asterisk ; B 32 276 493 707 ;\nC 43 ; WX 496 ; N plus ; B 29 131 465 560 ;\nC 44 ; WX 336 ; N comma ; B 39 -197 290 251 ;\nC 45 ; WX 636 ; N hyphen ; B 63 273 573 397 ;\nC 46 ; WX 349 ; N period ; B 52 -3 298 245 ;\nC 47 ; WX 557 ; N slash ; B 23 -41 536 760 ;\nC 48 ; WX 610 ; N zero ; B 55 0 560 720 ;\nC 49 ; WX 569 ; N one ; B 27 -12 572 712 ;\nC 50 ; WX 573 ; N two ; B 50 -25 541 680 ;\nC 51 ; WX 557 ; N three ; B 44 -25 514 694 ;\nC 52 ; WX 612 ; N four ; B 15 4 584 708 ;\nC 53 ; WX 537 ; N five ; B 47 0 505 690 ;\nC 54 ; WX 588 ; N six ; B 48 -10 548 707 ;\nC 55 ; WX 555 ; N seven ; B 15 -34 549 734 ;\nC 56 ; WX 598 ; N eight ; B 51 1 551 720 ;\nC 57 ; WX 584 ; N nine ; B 48 -2 539 715 ;\nC 58 ; WX 343 ; N colon ; B 51 -3 297 518 ;\nC 59 ; WX 328 ; N semicolon ; B 45 -197 297 518 ;\nC 60 ; WX 463 ; N less ; B 31 120 401 565 ;\nC 61 ; WX 636 ; N equal ; B 63 186 573 513 ;\nC 62 ; WX 463 ; N greater ; B 62 120 433 565 ;\nC 63 ; WX 470 ; N question ; B 34 2 442 729 ;\nC 64 ; WX 665 ; N at ; B 46 -4 618 680 ;\nC 65 ; WX 549 ; N A ; B -1 -16 550 703 ;\nC 66 ; WX 604 ; N B ; B 29 -6 557 704 ;\nC 67 ; WX 579 ; N C ; B 46 -13 531 700 ;\nC 68 ; WX 622 ; N D ; B 36 -17 579 713 ;\nC 69 ; WX 638 ; N E ; B 38 -16 587 691 ;\nC 70 ; WX 605 ; N F ; B 29 -9 595 709 ;\nC 71 ; WX 615 ; N G ; B 45 -3 586 710 ;\nC 72 ; WX 652 ; N H ; B 40 -20 622 690 ;\nC 73 ; WX 495 ; N I ; B 26 -24 469 710 ;\nC 74 ; WX 541 ; N J ; B 16 -3 539 703 ;\nC 75 ; WX 582 ; N K ; B 28 -5 584 711 ;\nC 76 ; WX 602 ; N L ; B 23 -14 583 718 ;\nC 77 ; WX 697 ; N M ; B 46 -10 655 704 ;\nC 78 ; WX 627 ; N N ; B 41 -15 595 700 ;\nC 79 ; WX 616 ; N O ; B 42 -30 574 702 ;\nC 80 ; WX 553 ; N P ; B 30 -12 527 689 ;\nC 81 ; WX 602 ; N Q ; B 42 -98 571 711 ;\nC 82 ; WX 636 ; N R ; B 14 -9 624 706 ;\nC 83 ; WX 588 ; N S ; B 51 -13 547 690 ;\nC 84 ; WX 594 ; N T ; B 25 1 564 707 ;\nC 85 ; WX 621 ; N U ; B 24 -6 611 710 ;\nC 86 ; WX 611 ; N V ; B -1 -15 614 726 ;\nC 87 ; WX 643 ; N W ; B 8 0 614 689 ;\nC 88 ; WX 582 ; N X ; B 3 -1 580 697 ;\nC 89 ; WX 561 ; N Y ; B -21 -2 562 719 ;\nC 90 ; WX 592 ; N Z ; B 49 -1 551 709 ;\nC 91 ; WX 312 ; N bracketleft ; B 85 -72 297 754 ;\nC 92 ; WX 557 ; N backslash ; B 21 -41 534 760 ;\nC 249 ; WX 639 ; N ugrave ; B 5 -28 624 679 ;\nC 250 ; WX 639 ; N uacute ; B 5 -28 624 682 ;\nC 251 ; WX 639 ; N ucircumflex ; B 5 -28 624 691 ;\nC 252 ; WX 639 ; N udieresis ; B 5 -28 624 649 ;\nC 253 ; WX 592 ; N yacute ; B 0 -232 596 666 ;\nC 254 ; WX 552 ; N thorn ; B -33 -221 512 699 ;\nC 255 ; WX 592 ; N ydieresis ; B 0 -232 596 643 ;\nC -1 ; WX 549 ; N Amacron ; B -1 -16 550 809 ;\nC -1 ; WX 565 ; N amacron ; B 38 -6 561 619 ;\nC -1 ; WX 549 ; N Abreve ; B -1 -16 550 890 ;\nC -1 ; WX 565 ; N abreve ; B 38 -6 561 686 ;\nC -1 ; WX 549 ; N Aogonek ; B -1 -138 589 703 ;\nC -1 ; WX 565 ; N aogonek ; B 38 -118 624 502 ;\nC -1 ; WX 579 ; N Cacute ; B 46 -13 531 900 ;\nC -1 ; WX 547 ; N cacute ; B 39 -22 506 693 ;\nC -1 ; WX 579 ; N Ccircumflex ; B 46 -13 531 890 ;\nC -1 ; WX 547 ; N ccircumflex ; B 39 -22 506 689 ;\nC -1 ; WX 579 ; N Cdotaccent ; B 46 -13 531 859 ;\nC -1 ; WX 547 ; N cdotaccent ; B 39 -22 506 657 ;\nC -1 ; WX 579 ; N Ccaron ; B 46 -13 531 918 ;\nC -1 ; WX 547 ; N ccaron ; B 39 -22 506 710 ;\nC -1 ; WX 622 ; N Dcaron ; B 36 -17 579 924 ;\nC -1 ; WX 750 ; N dcaron ; B 40 -26 716 704 ;\nC -1 ; WX 623 ; N Dcroat ; B 36 -17 580 713 ;\nC -1 ; WX 603 ; N dcroat ; B 40 -26 597 714 ;\nC -1 ; WX 638 ; N Emacron ; B 38 -16 587 798 ;\nC -1 ; WX 543 ; N emacron ; B 40 -23 501 616 ;\nC -1 ; WX 638 ; N Ebreve ; B 38 -16 587 876 ;\nC -1 ; WX 543 ; N ebreve ; B 40 -23 501 683 ;\nC -1 ; WX 638 ; N Edotaccent ; B 38 -16 587 848 ;\nC -1 ; WX 543 ; N edotaccent ; B 40 -23 501 659 ;\nC -1 ; WX 638 ; N Eogonek ; B 38 -113 610 691 ;\nC -1 ; WX 543 ; N eogonek ; B 40 -145 501 499 ;\nC -1 ; WX 638 ; N Ecaron ; B 38 -16 587 913 ;\nC -1 ; WX 543 ; N ecaron ; B 40 -23 501 714 ;\nC -1 ; WX 615 ; N Gcircumflex ; B 45 -3 586 906 ;\nC -1 ; WX 583 ; N gcircumflex ; B 42 -224 562 676 ;\nC -1 ; WX 615 ; N Gbreve ; B 45 -3 586 899 ;\nC -1 ; WX 583 ; N gbreve ; B 42 -224 562 667 ;\nC -1 ; WX 615 ; N Gdotaccent ; B 45 -3 586 871 ;\nC -1 ; WX 583 ; N gdotaccent ; B 42 -224 562 637 ;\nC -1 ; WX 615 ; N Gcommaaccent ; B 45 -253 586 710 ;\nC -1 ; WX 583 ; N gcommaaccent ; B 42 -224 562 734 ;\nC -1 ; WX 652 ; N Hcircumflex ; B 40 -20 622 897 ;\nC -1 ; WX 616 ; N hcircumflex ; B 5 -29 601 688 ;\nC -1 ; WX 652 ; N Hbar ; B 40 -20 622 690 ;\nC -1 ; WX 616 ; N hbar ; B 5 -29 601 683 ;\nC -1 ; WX 495 ; N Itilde ; B 26 -24 469 859 ;\nC -1 ; WX 568 ; N itilde ; B 36 -42 568 615 ;\nC -1 ; WX 495 ; N Imacron ; B 26 -24 469 819 ;\nC -1 ; WX 568 ; N imacron ; B 36 -42 568 585 ;\nC -1 ; WX 495 ; N Ibreve ; B 26 -24 469 901 ;\nC -1 ; WX 568 ; N ibreve ; B 36 -42 568 661 ;\nC -1 ; WX 495 ; N Iogonek ; B 26 -154 469 710 ;\nC -1 ; WX 568 ; N iogonek ; B 36 -149 568 674 ;\nC -1 ; WX 495 ; N Idotaccent ; B 26 -24 469 873 ;\nC -1 ; WX 568 ; N dotlessi ; B 36 -42 568 468 ;\nC -1 ; WX 1036 ; N IJ ; B 26 -24 1034 710 ;\nC -1 ; WX 983 ; N ij ; B 36 -236 913 683 ;\nC -1 ; WX 541 ; N Jcircumflex ; B 16 -3 539 913 ;\nC -1 ; WX 415 ; N jcircumflex ; B -12 -236 405 699 ;\nC -1 ; WX 582 ; N Kcommaaccent ; B 28 -253 584 711 ;\nC -1 ; WX 620 ; N kcommaaccent ; B 11 -253 600 683 ;\nC -1 ; WX 620 ; N kgreenlandic ; B 11 -28 600 482 ;\nC -1 ; WX 602 ; N Lacute ; B 23 -14 583 923 ;\nC -1 ; WX 540 ; N lacute ; B 4 -28 538 902 ;\nC -1 ; WX 602 ; N Lcommaaccent ; B 23 -267 583 718 ;\nC -1 ; WX 540 ; N lcommaaccent ; B 4 -267 538 682 ;\nC -1 ; WX 602 ; N Lcaron ; B 23 -14 583 794 ;\nC -1 ; WX 582 ; N lcaron ; B 4 -28 549 704 ;\nC -1 ; WX 781 ; N Ldot ; B 23 -14 748 718 ;\nC -1 ; WX 571 ; N ldotaccent ; B 4 -28 538 682 ;\nC -1 ; WX 603 ; N Lslash ; B 24 -14 584 718 ;\nC -1 ; WX 541 ; N lslash ; B 4 -28 538 682 ;\nC -1 ; WX 627 ; N Nacute ; B 41 -15 595 894 ;\nC -1 ; WX 632 ; N nacute ; B 32 -23 612 696 ;\nC -1 ; WX 627 ; N Ncommaaccent ; B 41 -268 595 700 ;\nC -1 ; WX 632 ; N ncommaaccent ; B 32 -268 612 491 ;\nC -1 ; WX 627 ; N Ncaron ; B 41 -15 595 900 ;\nC -1 ; WX 632 ; N ncaron ; B 32 -23 612 712 ;\nC -1 ; WX 815 ; N napostrophe ; B 34 -23 795 704 ;\nC -1 ; WX 627 ; N Eng ; B 41 -320 595 700 ;\nC -1 ; WX 605 ; N eng ; B 32 -322 534 491 ;\nC -1 ; WX 616 ; N Omacron ; B 42 -30 574 815 ;\nC -1 ; WX 583 ; N omacron ; B 40 -34 543 598 ;\nC -1 ; WX 616 ; N Obreve ; B 42 -30 574 891 ;\nC -1 ; WX 583 ; N obreve ; B 40 -34 543 675 ;\nC -1 ; WX 616 ; N Ohungarumlaut ; B 42 -30 574 907 ;\nC -1 ; WX 583 ; N ohungarumlaut ; B 40 -34 545 693 ;\nC -1 ; WX 1018 ; N OE ; B 42 -30 967 702 ;\nC -1 ; WX 958 ; N oe ; B 40 -34 916 499 ;\nC -1 ; WX 636 ; N Racute ; B 14 -9 624 910 ;\nC -1 ; WX 579 ; N racute ; B 28 -16 566 693 ;\nC -1 ; WX 636 ; N Rcommaaccent ; B 14 -268 624 706 ;\nC -1 ; WX 579 ; N rcommaaccent ; B 28 -272 566 495 ;\nC -1 ; WX 636 ; N Rcaron ; B 14 -9 624 927 ;\nC -1 ; WX 579 ; N rcaron ; B 28 -16 566 698 ;\nC -1 ; WX 588 ; N Sacute ; B 51 -13 547 900 ;\nC -1 ; WX 519 ; N sacute ; B 48 -31 481 713 ;\nC -1 ; WX 588 ; N Scircumflex ; B 51 -13 547 904 ;\nC -1 ; WX 519 ; N scircumflex ; B 48 -31 481 710 ;\nC -1 ; WX 588 ; N Scedilla ; B 51 -145 547 690 ;\nC -1 ; WX 519 ; N scedilla ; B 48 -145 481 496 ;\nC -1 ; WX 588 ; N Scaron ; B 51 -13 547 904 ;\nC -1 ; WX 519 ; N scaron ; B 48 -31 481 710 ;\nC -1 ; WX 594 ; N Tcommaaccent ; B 25 -263 564 707 ;\nC -1 ; WX 510 ; N tcommaaccent ; B 0 -282 488 694 ;\nC -1 ; WX 594 ; N Tcaron ; B 25 1 564 920 ;\nC -1 ; WX 713 ; N tcaron ; B 0 -34 680 704 ;\nC -1 ; WX 594 ; N Tbar ; B 25 1 564 707 ;\nC -1 ; WX 510 ; N tbar ; B 0 -34 488 694 ;\nC -1 ; WX 621 ; N Utilde ; B 24 -6 611 850 ;\nC -1 ; WX 638 ; N utilde ; B 5 -28 624 636 ;\nC -1 ; WX 621 ; N Umacron ; B 24 -6 611 811 ;\nC -1 ; WX 638 ; N umacron ; B 5 -28 624 587 ;\nC -1 ; WX 621 ; N Ubreve ; B 24 -6 611 888 ;\nC -1 ; WX 638 ; N ubreve ; B 5 -28 624 665 ;\nC -1 ; WX 621 ; N Uring ; B 24 -6 611 959 ;\nC -1 ; WX 638 ; N uring ; B 5 -28 624 738 ;\nC -1 ; WX 621 ; N Uhungarumlaut ; B 24 -6 611 918 ;\nC -1 ; WX 638 ; N uhungarumlaut ; B 5 -28 624 691 ;\nC -1 ; WX 621 ; N Uogonek ; B 24 -136 611 710 ;\nC -1 ; WX 638 ; N uogonek ; B 5 -147 671 487 ;\nC -1 ; WX 643 ; N Wcircumflex ; B 8 0 614 901 ;\nC -1 ; WX 678 ; N wcircumflex ; B 5 -10 674 685 ;\nC -1 ; WX 561 ; N Ycircumflex ; B -21 -2 562 934 ;\nC -1 ; WX 592 ; N ycircumflex ; B 0 -232 596 691 ;\nC -1 ; WX 561 ; N Ydieresis ; B -21 -2 562 885 ;\nC -1 ; WX 592 ; N Zacute ; B 49 -1 551 905 ;\nC -1 ; WX 528 ; N zacute ; B 45 -22 487 684 ;\nC -1 ; WX 592 ; N Zdotaccent ; B 49 -1 551 866 ;\nC -1 ; WX 528 ; N zdotaccent ; B 45 -22 487 632 ;\nC -1 ; WX 592 ; N Zcaron ; B 49 -1 551 917 ;\nC -1 ; WX 528 ; N zcaron ; B 45 -22 487 688 ;\nC -1 ; WX 915 ; N AEacute ; B -11 -16 864 904 ;\nC -1 ; WX 888 ; N aeacute ; B 38 -23 846 670 ;\nC -1 ; WX 617 ; N Oslashacute ; B 43 -41 574 912 ;\nC -1 ; WX 583 ; N oslashacute ; B 40 -73 543 697 ;\nC -1 ; WX 415 ; N dotlessj ; B -12 -236 344 478 ;\nC -1 ; WX 281 ; N circumflex ; B 0 558 282 746 ;\nC -1 ; WX 281 ; N caron ; B 0 558 282 746 ;\nC -1 ; WX 281 ; N breve ; B 0 585 282 746 ;\nC -1 ; WX 132 ; N dotaccent ; B 0 600 133 729 ;\nC -1 ; WX 214 ; N ring ; B 0 547 215 780 ;\nC -1 ; WX 211 ; N ogonek ; B 0 -145 212 13 ;\nC -1 ; WX 283 ; N tilde ; B 0 583 284 701 ;\nC -1 ; WX 352 ; N hungarumlaut ; B 0 591 353 763 ;\nC -1 ; WX 185 ; N uni0312 ; B 28 474 152 694 ;\nC -1 ; WX 185 ; N uni0315 ; B 38 470 162 690 ;\nC -1 ; WX 192 ; N uni0326 ; B 32 -253 156 -33 ;\nC -1 ; WX 666 ; N mu ; B 24 -219 643 487 ;\nC -1 ; WX 643 ; N Wgrave ; B 8 0 614 895 ;\nC -1 ; WX 678 ; N wgrave ; B 5 -10 674 688 ;\nC -1 ; WX 643 ; N Wacute ; B 8 0 614 898 ;\nC -1 ; WX 678 ; N wacute ; B 5 -10 674 682 ;\nC -1 ; WX 643 ; N Wdieresis ; B 8 0 614 868 ;\nC -1 ; WX 678 ; N wdieresis ; B 5 -10 674 649 ;\nC -1 ; WX 561 ; N Ygrave ; B -21 -2 562 900 ;\nC -1 ; WX 592 ; N ygrave ; B 0 -232 596 666 ;\nC -1 ; WX 611 ; N endash ; B 50 270 551 391 ;\nC -1 ; WX 1113 ; N emdash ; B 51 270 1052 391 ;\nC -1 ; WX 265 ; N quoteleft ; B 41 390 217 704 ;\nC -1 ; WX 264 ; N quoteright ; B 54 390 230 704 ;\nC -1 ; WX 274 ; N quotesinglbase ; B 46 -138 223 176 ;\nC -1 ; WX 470 ; N quotedblleft ; B 41 390 422 704 ;\nC -1 ; WX 469 ; N quotedblright ; B 54 390 436 704 ;\nC -1 ; WX 479 ; N quotedblbase ; B 46 -138 428 176 ;\nC -1 ; WX 389 ; N dagger ; B 30 -16 359 724 ;\nC -1 ; WX 396 ; N daggerdbl ; B 35 -16 364 728 ;\nC -1 ; WX 316 ; N bullet ; B 50 246 266 479 ;\nC -1 ; WX 1063 ; N ellipsis ; B 52 -3 1016 245 ;\nC -1 ; WX 897 ; N perthousand ; B 33 -230 873 828 ;\nC -1 ; WX 296 ; N guilsinglleft ; B 44 149 232 434 ;\nC -1 ; WX 295 ; N guilsinglright ; B 63 149 251 434 ;\nC -1 ; WX 486 ; N fraction ; B -11 -53 501 748 ;\nC -1 ; WX 732 ; N Euro ; B 31 71 683 590 ;\nC -1 ; WX 757 ; N trademark ; B 60 303 703 693 ;\nC -1 ; WX 585 ; N partialdiff ; B 36 -47 553 772 ;\nC -1 ; WX 564 ; N product ; B 26 -17 534 707 ;\nC -1 ; WX 577 ; N minus ; B 63 282 514 395 ;\nC -1 ; WX 565 ; N approxequal ; B 59 137 513 522 ;\nC -1 ; WX 593 ; N notequal ; B 44 71 554 644 ;\nC -1 ; WX 1041 ; N fi ; B 20 -42 1041 702 ;\nC -1 ; WX 1013 ; N fl ; B 20 -29 1011 702 ;\nC -1 ; WX 292 ; N .notdef ; B 0 0 0 0 ;\nC -1 ; WX 0 ; N .null ; B 0 0 0 0 ;\nC -1 ; WX 292 ; N nonmarkingreturn ; B 0 0 0 0 ;\nEndCharMetrics\nStartKernData\nStartKernPairs 6408\nKPX quotedbl period -104\nKPX quotedbl comma -103\nKPX quotedbl Jcircumflex -34\nKPX quotedbl Aogonek -31\nKPX quotedbl Abreve -31\nKPX quotedbl Amacron -31\nKPX quotedbl AEacute -31\nKPX quotedbl Aacute -31\nKPX quotedbl Acircumflex -31\nKPX quotedbl Atilde -31\nKPX quotedbl Agrave -31\nKPX quotedbl Aring -31\nKPX quotedbl Adieresis -31\nKPX quotedbl AE -31\nKPX quotedbl J -34\nKPX quotedbl A -31\nKPX quotedbl quotedblbase -117\nKPX quotedbl quotesinglbase -117\nKPX quotedbl ellipsis -104\nKPX quotedbl slash -73\nKPX quotedbl ampersand -22\nKPX quotedbl four -27\nKPX ampersand Ycircumflex -40\nKPX ampersand Ygrave -40\nKPX ampersand Ydieresis -40\nKPX ampersand Yacute -40\nKPX ampersand Y -40\nKPX ampersand V -36\nKPX quotesingle period -97\nKPX quotesingle comma -97\nKPX quotesingle Jcircumflex -34\nKPX quotesingle Aogonek -31\nKPX quotesingle Abreve -31\nKPX quotesingle Amacron -31\nKPX hyphen T -28\nKPX hyphen one -68\nKPX hyphen B -25\nKPX hyphen seven -56\nKPX slash rcommaaccent -27\nKPX slash ncommaaccent -29\nKPX slash gcommaaccent -61\nKPX slash Jcircumflex -29\nKPX slash iogonek -26\nKPX slash ibreve -26\nKPX slash imacron -26\nKPX slash itilde -26\nKPX slash oslashacute -54\nKPX slash nacute -29\nKPX slash eng -29\nKPX slash ncaron -29\nKPX slash racute -27\nKPX slash scedilla -43\nKPX slash scircumflex -43\nKPX slash sacute -43\nKPX slash rcaron -27\nKPX slash ohungarumlaut -54\nKPX slash obreve -54\nKPX slash omacron -54\nKPX slash wgrave -23\nKPX slash wcircumflex -23\nKPX slash wdieresis -23\nKPX slash wacute -23\nKPX slash zdotaccent -41\nKPX J ebreve -32\nKPX J emacron -32\nKPX J edieresis -32\nKPX J ecircumflex -32\nKPX J egrave -32\nKPX J eacute -32\nKPX J e -32\nKPX J Aogonek -34\nKPX J Abreve -34\nKPX J Amacron -34\nKPX J AEacute -34\nKPX J Aacute -34\nKPX J Acircumflex -34\nKPX J Atilde -34\nKPX J Agrave -34\nKPX J Aring -34\nKPX J Adieresis -34\nKPX J AE -34\nKPX J A -34\nKPX J comma -29\nKPX J period -30\nKPX J v -29\nKPX J hyphen -30\nKPX J quotedblbase -34\nKPX J quotesinglbase -34\nKPX J guilsinglright -25\nKPX J guilsinglleft -25\nKPX J emdash -30\nKPX J endash -30\nKPX J guillemotright -25\nKPX J guillemotleft -25\nKPX J germandbls -36\nKPX J ellipsis -30\nKPX J slash -34\nKPX J p -28\nKPX J m -35\nKPX J b 54\nKPX K ycircumflex -60\nKPX K ygrave -60\nKPX K ydieresis -60\nKPX K yacute -60\nKPX K y -60\nKPX K wgrave -36\nKPX K wcircumflex -36\nKPX K wdieresis -36\nKPX K wacute -36\nKPX K w -36\nKPX K uogonek -25\nKPX K uhungarumlaut -25\nKPX K uring -25\nKPX K ubreve -25\nKPX K umacron -25\nKPX K utilde -25\nKPX K udieresis -25\nKPX K ucircumflex -25\nKPX K ugrave -25\nKPX K uacute -25\nKPX K u -25\nKPX K q -23\nKPX K oslashacute -28\nKPX K ohungarumlaut -28\nKPX K obreve -28\nKPX K omacron -28\nKPX K otilde -28\nKPX K odieresis -28\nKPX K ocircumflex -28\nKPX K ograve -28\nKPX K oacute -28\nKPX K eth -28\nKPX K oe -28\nKPX K oslash -28\nKPX K o -28\nKPX K dcaron -24\nKPX K d -24\nKPX K ccaron -27\nKPX K cdotaccent -27\nKPX K ccircumflex -27\nKPX K cacute -27\nKPX K ccedilla -27\nKPX K c -27\nKPX K ecaron -27\nKPX K eogonek -27\nKPX K edotaccent -27\nKPX K ebreve -27\nKPX K emacron -27\nKPX K edieresis -27\nKPX K ecircumflex -27\nKPX K egrave -27\nKPX K eacute -27\nKPX K e -27\nKPX K v -49\nKPX K hyphen -38\nKPX K guilsinglleft -24\nKPX K emdash -38\nKPX K endash -38\nKPX K guillemotleft -24\nKPX K b 49\nKPX L ycircumflex -36\nKPX L ygrave -36\nKPX L ydieresis -36\nKPX L yacute -36\nKPX L y -36\nKPX L wgrave -23\nKPX L wcircumflex -23\nKPX L wdieresis -23\nKPX L wacute -23\nKPX L w -23\nKPX L V -43\nKPX L Tcommaaccent -36\nKPX L Tbar -36\nKPX L Tcaron -36\nKPX L T -36\nKPX L quoteright -49\nKPX L v -32\nKPX L quoteleft -54\nKPX L quotedblright -49\nKPX L quotedblleft -54\nKPX L trademark -29\nKPX L backslash -50\nKPX L asterisk -30\nKPX trademark Aring -24\nKPX trademark Adieresis -24\nKPX trademark Yacute 29\nKPX trademark AE -24\nKPX trademark Y 29\nKPX trademark A -24\nKPX trademark b 31\nEndKernPairs\nEndKernData\nEndFontMetrics\n" }, { "path": "src/test/resources/samples/langs/Adobe Font Metrics/lambda.afm", "content": "StartFontMetrics 2.0\nComment Generated by FontForge 20170719\nComment Creation Date: Sun Jul 23 23:14:02 2017\nFontName Greek_Lambda_Character-Regular\nFullName Greek_Lambda_Character Regular\nFamilyName Greek_Lambda_Character\nWeight Regular\nNotice (NONE. NADA. PUBLIC DOMAIN, BOI)\nItalicAngle 0\nIsFixedPitch false\nUnderlinePosition -175\nUnderlineThickness 90\nVersion 020.017\nEncodingScheme ISO10646-1\nFontBBox 33 -177 566 760\nStartCharMetrics 5\nC 13 ; WX 602 ; N uni000D ; B 0 0 0 0 ;\nC 32 ; WX 602 ; N space ; B 0 0 0 0 ;\nC -1 ; WX 602 ; N lambda ; B 33 0 566 760 ;\nC -1 ; WX 602 ; N .notdef ; B 50 -177 551 706 ;\nC -1 ; WX 0 ; N NULL ; B 0 0 0 0 ;\nEndCharMetrics\nEndFontMetrics\n" }, { "path": "src/test/resources/samples/langs/Agda/NatCat.agda", "content": "module NatCat where\r\n\r\nopen import Relation.Binary.PropositionalEquality\r\n\r\n-- If you can show that a relation only ever has one inhabitant\r\n-- you get the category laws for free\r\nmodule\r\n EasyCategory\r\n (obj : Set)\r\n (_⟶_ : obj → obj → Set)\r\n (_∘_ : ∀ {x y z} → x ⟶ y → y ⟶ z → x ⟶ z)\r\n (id : ∀ x → x ⟶ x)\r\n (single-inhabitant : (x y : obj) (r s : x ⟶ y) → r ≡ s)\r\n where\r\n\r\n idʳ : ∀ x y (r : x ⟶ y) → r ∘ id y ≡ r\r\n idʳ x y r = single-inhabitant x y (r ∘ id y) r \r\n\r\n idˡ : ∀ x y (r : x ⟶ y) → id x ∘ r ≡ r\r\n idˡ x y r = single-inhabitant x y (id x ∘ r) r\r\n\r\n ∘-assoc : ∀ w x y z (r : w ⟶ x) (s : x ⟶ y) (t : y ⟶ z) → (r ∘ s) ∘ t ≡ r ∘ (s ∘ t)\r\n ∘-assoc w x y z r s t = single-inhabitant w z ((r ∘ s) ∘ t) (r ∘ (s ∘ t))\r\n\r\nopen import Data.Nat\r\n\r\nsame : (x y : ℕ) (r s : x ≤ y) → r ≡ s\r\nsame .0 y z≤n z≤n = refl\r\nsame .(suc m) .(suc n) (s≤s {m} {n} r) (s≤s s) = cong s≤s (same m n r s)\r\n\r\n≤-trans : ∀ x y z → x ≤ y → y ≤ z → x ≤ z\r\n≤-trans .0 y z z≤n s = z≤n\r\n≤-trans .(suc m) .(suc n) .(suc n₁) (s≤s {m} {n} r) (s≤s {.n} {n₁} s) = s≤s (≤-trans m n n₁ r s)\r\n\r\n≤-refl : ∀ x → x ≤ x\r\n≤-refl zero = z≤n\r\n≤-refl (suc x) = s≤s (≤-refl x)\r\n\r\nmodule Nat-EasyCategory = EasyCategory ℕ _≤_ (λ {x}{y}{z} → ≤-trans x y z) ≤-refl same\r\n" }, { "path": "src/test/resources/samples/langs/Alloy/file_system.als", "content": "module examples/systems/file_system\n\n/*\n * Model of a generic file system.\n */\n\nabstract sig Object {}\n\nsig Name {}\n\nsig File extends Object {} { some d: Dir | this in d.entries.contents }\n\nsig Dir extends Object {\n entries: set DirEntry,\n parent: lone Dir\n} {\n parent = this.~@contents.~@entries\n all e1, e2 : entries | e1.name = e2.name => e1 = e2\n this !in this.^@parent\n this != Root => Root in this.^@parent\n}\n\none sig Root extends Dir {} { no parent }\n\nlone sig Cur extends Dir {}\n\nsig DirEntry {\n name: Name,\n contents: Object\n} {\n one this.~entries\n}\n\n\n/**\n * all directories besides root have one parent\n */\npred OneParent_buggyVersion {\n all d: Dir - Root | one d.parent\n}\n\n/**\n * all directories besides root have one parent\n */\npred OneParent_correctVersion {\n all d: Dir - Root | (one d.parent && one contents.d)\n}\n\n/**\n * Only files may be linked (that is, have more than one entry)\n * That is, all directories are the contents of at most one directory entry\n */\npred NoDirAliases {\n all o: Dir | lone o.~contents\n}\n\ncheck { OneParent_buggyVersion => NoDirAliases } for 5 expect 1\n\ncheck { OneParent_correctVersion => NoDirAliases } for 5 expect 0\n" }, { "path": "src/test/resources/samples/langs/Alloy/marksweepgc.als", "content": "module examples/systems/marksweepgc\n\n/*\n * Model of mark and sweep garbage collection.\n */\n\n// a node in the heap\nsig Node {}\n\nsig HeapState {\n left, right : Node -> lone Node,\n marked : set Node,\n freeList : lone Node\n}\n\npred clearMarks[hs, hs' : HeapState] {\n // clear marked set\n no hs'.marked\n // left and right fields are unchanged\n hs'.left = hs.left\n hs'.right = hs.right\n}\n\n/**\n * simulate the recursion of the mark() function using transitive closure\n */\nfun reachable[hs: HeapState, n: Node] : set Node {\n n + n.^(hs.left + hs.right)\n}\n\npred mark[hs: HeapState, from : Node, hs': HeapState] {\n hs'.marked = hs.reachable[from]\n hs'.left = hs.left\n hs'.right = hs.right\n}\n\n/**\n * complete hack to simulate behavior of code to set freeList\n */\npred setFreeList[hs, hs': HeapState] {\n // especially hackish\n hs'.freeList.*(hs'.left) in (Node - hs.marked)\n all n: Node |\n (n !in hs.marked) => {\n no hs'.right[n]\n hs'.left[n] in (hs'.freeList.*(hs'.left))\n n in hs'.freeList.*(hs'.left)\n } else {\n hs'.left[n] = hs.left[n]\n hs'.right[n] = hs.right[n]\n }\n hs'.marked = hs.marked\n}\n\npred GC[hs: HeapState, root : Node, hs': HeapState] {\n some hs1, hs2: HeapState |\n hs.clearMarks[hs1] && hs1.mark[root, hs2] && hs2.setFreeList[hs']\n}\n\nassert Soundness1 {\n all h, h' : HeapState, root : Node |\n h.GC[root, h'] =>\n (all live : h.reachable[root] | {\n h'.left[live] = h.left[live]\n h'.right[live] = h.right[live]\n })\n}\n\nassert Soundness2 {\n all h, h' : HeapState, root : Node |\n h.GC[root, h'] =>\n no h'.reachable[root] & h'.reachable[h'.freeList]\n}\n\nassert Completeness {\n all h, h' : HeapState, root : Node |\n h.GC[root, h'] =>\n (Node - h'.reachable[root]) in h'.reachable[h'.freeList]\n}\n\ncheck Soundness1 for 3 expect 0\ncheck Soundness2 for 3 expect 0\ncheck Completeness for 3 expect 0\n" }, { "path": "src/test/resources/samples/langs/Alloy/views.als", "content": "module examples/systems/views\n\n/*\n * Model of views in object-oriented programming.\n *\n * Two object references, called the view and the backing,\n * are related by a view mechanism when changes to the\n * backing are automatically propagated to the view. Note\n * that the state of a view need not be a projection of the\n * state of the backing; the keySet method of Map, for\n * example, produces two view relationships, and for the\n * one in which the map is modified by changes to the key\n * set, the value of the new map cannot be determined from\n * the key set. Note that in the iterator view mechanism,\n * the iterator is by this definition the backing object,\n * since changes are propagated from iterator to collection\n * and not vice versa. Oddly, a reference may be a view of\n * more than one backing: there can be two iterators on the\n * same collection, eg. A reference cannot be a view under\n * more than one view type.\n *\n * A reference is made dirty when it is a backing for a view\n * with which it is no longer related by the view invariant.\n * This usually happens when a view is modified, either\n * directly or via another backing. For example, changing a\n * collection directly when it has an iterator invalidates\n * it, as does changing the collection through one iterator\n * when there are others.\n *\n * More work is needed if we want to model more closely the\n * failure of an iterator when its collection is invalidated.\n *\n * As a terminological convention, when there are two\n * complementary view relationships, we will give them types\n * t and t'. For example, KeySetView propagates from map to\n * set, and KeySetView' propagates from set to map.\n *\n * author: Daniel Jackson\n */\n\nopen util/ordering[State] as so\nopen util/relation as rel\n\nsig Ref {}\nsig Object {}\n\n-- t->b->v in views when v is view of type t of backing b\n-- dirty contains refs that have been invalidated\nsig State {\n refs: set Ref,\n obj: refs -> one Object,\n views: ViewType -> refs -> refs,\n dirty: set refs\n-- , anyviews: Ref -> Ref -- for visualization\n }\n-- {anyviews = ViewType.views}\n\nsig Map extends Object {\n keys: set Ref,\n map: keys -> one Ref\n }{all s: State | keys + Ref.map in s.refs}\nsig MapRef extends Ref {}\nfact {State.obj[MapRef] in Map}\n\nsig Iterator extends Object {\n left, done: set Ref,\n lastRef: lone done\n }{all s: State | done + left + lastRef in s.refs}\nsig IteratorRef extends Ref {}\nfact {State.obj[IteratorRef] in Iterator}\n\nsig Set extends Object {\n elts: set Ref\n }{all s: State | elts in s.refs}\nsig SetRef extends Ref {}\nfact {State.obj[SetRef] in Set}\n\nabstract sig ViewType {}\none sig KeySetView, KeySetView', IteratorView extends ViewType {}\nfact ViewTypes {\n State.views[KeySetView] in MapRef -> SetRef\n State.views[KeySetView'] in SetRef -> MapRef\n State.views[IteratorView] in IteratorRef -> SetRef\n all s: State | s.views[KeySetView] = ~(s.views[KeySetView'])\n }\n\n/**\n * mods is refs modified directly or by view mechanism\n * doesn't handle possibility of modifying an object and its view at once?\n * should we limit frame conds to non-dirty refs?\n */\npred modifies [pre, post: State, rs: set Ref] {\n let vr = pre.views[ViewType], mods = rs.*vr {\n all r: pre.refs - mods | pre.obj[r] = post.obj[r]\n all b: mods, v: pre.refs, t: ViewType |\n b->v in pre.views[t] => viewFrame [t, pre.obj[v], post.obj[v], post.obj[b]]\n post.dirty = pre.dirty +\n {b: pre.refs | some v: Ref, t: ViewType |\n b->v in pre.views[t] && !viewFrame [t, pre.obj[v], post.obj[v], post.obj[b]]\n }\n }\n }\n\npred allocates [pre, post: State, rs: set Ref] {\n no rs & pre.refs\n post.refs = pre.refs + rs\n }\n\n/** \n * models frame condition that limits change to view object from v to v' when backing object changes to b'\n */\npred viewFrame [t: ViewType, v, v', b': Object] {\n t in KeySetView => v'.elts = dom [b'.map]\n t in KeySetView' => b'.elts = dom [v'.map]\n t in KeySetView' => (b'.elts) <: (v.map) = (b'.elts) <: (v'.map)\n t in IteratorView => v'.elts = b'.left + b'.done\n }\n\npred MapRef.keySet [pre, post: State, setRefs: SetRef] {\n post.obj[setRefs].elts = dom [pre.obj[this].map]\n modifies [pre, post, none]\n allocates [pre, post, setRefs]\n post.views = pre.views + KeySetView->this->setRefs + KeySetView'->setRefs->this\n }\n\npred MapRef.put [pre, post: State, k, v: Ref] {\n post.obj[this].map = pre.obj[this].map ++ k->v\n modifies [pre, post, this]\n allocates [pre, post, none]\n post.views = pre.views\n }\n\npred SetRef.iterator [pre, post: State, iterRef: IteratorRef] {\n let i = post.obj[iterRef] {\n i.left = pre.obj[this].elts\n no i.done + i.lastRef\n }\n modifies [pre,post,none]\n allocates [pre, post, iterRef]\n post.views = pre.views + IteratorView->iterRef->this\n }\n\npred IteratorRef.remove [pre, post: State] {\n let i = pre.obj[this], i' = post.obj[this] {\n i'.left = i.left\n i'.done = i.done - i.lastRef\n no i'.lastRef\n }\n modifies [pre,post,this]\n allocates [pre, post, none]\n pre.views = post.views\n }\n\npred IteratorRef.next [pre, post: State, ref: Ref] {\n let i = pre.obj[this], i' = post.obj[this] {\n ref in i.left\n i'.left = i.left - ref\n i'.done = i.done + ref\n i'.lastRef = ref\n }\n modifies [pre, post, this]\n allocates [pre, post, none]\n pre.views = post.views\n }\n\npred IteratorRef.hasNext [s: State] {\n some s.obj[this].left\n }\n\nassert zippishOK {\n all\n ks, vs: SetRef,\n m: MapRef,\n ki, vi: IteratorRef,\n k, v: Ref |\n let s0=so/first,\n s1=so/next[s0],\n s2=so/next[s1],\n s3=so/next[s2],\n s4=so/next[s3],\n s5=so/next[s4],\n s6=so/next[s5],\n s7=so/next[s6] |\n ({\n precondition [s0, ks, vs, m]\n no s0.dirty\n ks.iterator [s0, s1, ki]\n vs.iterator [s1, s2, vi]\n ki.hasNext [s2]\n vi.hasNext [s2]\n ki.this/next [s2, s3, k]\n vi.this/next [s3, s4, v]\n m.put [s4, s5, k, v]\n ki.remove [s5, s6]\n vi.remove [s6, s7]\n } => no State.dirty)\n }\n\npred precondition [pre: State, ks, vs, m: Ref] {\n // all these conditions and other errors discovered in scope of 6 but 8,3\n // in initial state, must have view invariants hold\n (all t: ViewType, b, v: pre.refs |\n b->v in pre.views[t] => viewFrame [t, pre.obj[v], pre.obj[v], pre.obj[b]])\n // sets are not aliases\n-- ks != vs\n // sets are not views of map\n-- no (ks+vs)->m & ViewType.pre.views\n // no iterator currently on either set\n-- no Ref->(ks+vs) & ViewType.pre.views\n }\n\ncheck zippishOK for 6 but 8 State, 3 ViewType expect 1\n\n/** \n * experiment with controlling heap size\n */\nfact {all s: State | #s.obj < 5}\n" }, { "path": "src/test/resources/samples/langs/Alpine Abuild/filenames/APKBUILD", "content": "# Contributor: Natanael Copa \n# Maintainer: Natanael Copa \npkgname=abuild\npkgver=2.27.0\n_ver=${pkgver%_git*}\npkgrel=0\npkgdesc=\"Script to build Alpine Packages\"\nurl=\"http://git.alpinelinux.org/cgit/abuild/\"\narch=\"all\"\nlicense=\"GPL2\"\ndepends=\"fakeroot sudo pax-utils openssl apk-tools>=2.0.7-r1 libc-utils\n\tattr tar pkgconf patch\"\nif [ \"$CBUILD\" = \"$CHOST\" ]; then\n\tdepends=\"$depends curl\"\nfi\nmakedepends_build=\"pkgconfig\"\nmakedepends_host=\"openssl-dev\"\nmakedepends=\"$makedepends_host $makedepends_build\"\ninstall=\"$pkgname.pre-install $pkgname.pre-upgrade\"\nsubpackages=\"apkbuild-cpan:cpan apkbuild-gem-resolver:gems\"\noptions=\"suid\"\npkggroups=\"abuild\"\nsource=\"http://dev.alpinelinux.org/archive/abuild/abuild-$_ver.tar.xz\n\t\"\n\n_builddir=\"$srcdir/$pkgname-$_ver\"\nprepare() {\n\tcd \"$_builddir\"\n\tfor i in $source; do\n\t\tcase $i in\n\t\t*.patch)\n\t\t\tmsg \"Applying $i\"\n\t\t\tpatch -p1 -i \"$srcdir\"/$i || return 1\n\t\t\t;;\n\t\tesac\n\tdone\n\tsed -i -e \"/^CHOST=/s/=.*/=$CHOST/\" abuild.conf\n}\n\nbuild() {\n\tcd \"$_builddir\"\n\tmake || return 1\n}\n\npackage() {\n\tcd \"$_builddir\"\n\tmake install DESTDIR=\"$pkgdir\" || return 1\n\tinstall -m 644 abuild.conf \"$pkgdir\"/etc/abuild.conf || return 1\n\tinstall -d -m 775 -g abuild \"$pkgdir\"/var/cache/distfiles || return 1\n}\n\ncpan() {\n\tpkgdesc=\"Script to generate perl APKBUILD from CPAN\"\n\tdepends=\"perl perl-libwww perl-json\"\n\tarch=\"noarch\"\n\tmkdir -p \"$subpkgdir\"/usr/bin\n\tmv \"$pkgdir\"/usr/bin/apkbuild-cpan \"$subpkgdir\"/usr/bin/\n}\n\ngems() {\n\tpkgdesc=\"APKBUILD dependency resolver for RubyGems\"\n\tdepends=\"ruby ruby-augeas\"\n\tarch=\"noarch\"\n\tmkdir -p \"$subpkgdir\"/usr/bin\n\tmv \"$pkgdir\"/usr/bin/apkbuild-gem-resolver \"$subpkgdir\"/usr/bin/\n}\n\nmd5sums=\"c67e4c971c54b4d550e16db3ba331f96 abuild-2.27.0.tar.xz\"\nsha256sums=\"c8db017e3dd168edb20ceeb91971535cf66b8c95f29d3288f88ac755bffc60e5 abuild-2.27.0.tar.xz\"\nsha512sums=\"98e1da4e47f3ab68700b3bc992c83e103f770f3196e433788ee74145f57cd33e5239c87f0a7a15f7266840d5bad893fc8c0d4c826d663df53deaee2678c56984 abuild-2.27.0.tar.xz\"\n" }, { "path": "src/test/resources/samples/langs/AngelScript/botmanager.as", "content": "/*\n*\tThis is a sample script.\n*/\n\n#include \"BotManagerInterface.acs\"\n\nBotManager::BotManager g_BotManager( @CreateDumbBot );\n\nCConCommand@ m_pAddBot;\n\nvoid PluginInit()\n{\n\tg_BotManager.PluginInit();\n\t\n\t@m_pAddBot = @CConCommand( \"addbot\", \"Adds a new bot with the given name\", @AddBotCallback );\n}\n\nvoid AddBotCallback( const CCommand@ args )\n{\n\tif( args.ArgC() < 2 )\n\t{\n\t\tg_Game.AlertMessage( at_console, \"Usage: addbot \" );\n\t\treturn;\n\t}\n\t\n\tBotManager::BaseBot@ pBot = g_BotManager.CreateBot( args[ 1 ] );\n\t\n\tif( pBot !is null )\n\t{\n\t\tg_Game.AlertMessage( at_console, \"Created bot \" + args[ 1 ] + \"\\n\" );\n\t}\n\telse\n\t{\n\t\tg_Game.AlertMessage( at_console, \"Could not create bot\\n\" );\n\t}\n}\n\nfinal class DumbBot : BotManager::BaseBot\n{\t\n\tDumbBot( CBasePlayer@ pPlayer )\n\t{\n\t\tsuper( pPlayer );\n\t}\n\t\n\tvoid Think()\n\t{\n\t\tBotManager::BaseBot::Think();\n\t\t\n\t\t// If the bot is dead and can be respawned, send a button press\n\t\tif( Player.pev.deadflag >= DEAD_RESPAWNABLE )\n\t\t{\n\t\t\tPlayer.pev.button |= IN_ATTACK;\n\t\t}\n\t\telse\n\t\t\tPlayer.pev.button &= ~IN_ATTACK;\n\t\t\n\t\tKeyValueBuffer@ pInfoBuffer = g_EngineFuncs.GetInfoKeyBuffer( Player.edict() );\n\t\t\n\t\tpInfoBuffer.SetValue( \"topcolor\", Math.RandomLong( 0, 255 ) );\n\t\tpInfoBuffer.SetValue( \"bottomcolor\", Math.RandomLong( 0, 255 ) );\n\t\t\n\t\tif( Math.RandomLong( 0, 100 ) > 10 )\n\t\t\tPlayer.pev.button |= IN_ATTACK;\n\t\telse\n\t\t\tPlayer.pev.button &= ~IN_ATTACK;\n\t\t\t\n\t\tfor( uint uiIndex = 0; uiIndex < 3; ++uiIndex )\n\t\t{\n\t\t\tm_vecVelocity[ uiIndex ] = Math.RandomLong( -50, 50 );\n\t\t}\n\t}\n}\n\nBotManager::BaseBot@ CreateDumbBot( CBasePlayer@ pPlayer )\n{\n\treturn @DumbBot( pPlayer );\n}\n" }, { "path": "src/test/resources/samples/langs/AngelScript/payload.as", "content": "// Sample script.\n// Source: https://github.com/codecat/ssbd-payload\n\narray g_payloadBeginTriggers;\narray g_teamForceFields;\n\n[GameMode]\nclass Payload : TeamVersusGameMode\n{\n\t[Editable]\n\tUnitFeed PayloadUnit;\n\n\t[Editable]\n\tUnitFeed FirstNode;\n\n\t[Editable default=10]\n\tint PrepareTime;\n\n\t[Editable default=300]\n\tint TimeLimit;\n\n\t[Editable default=90]\n\tint TimeAddCheckpoint;\n\n\t[Editable default=2]\n\tfloat TimeOvertime;\n\n\t[Editable default=1000]\n\tint TimePayloadHeal;\n\n\t[Editable default=1]\n\tint PayloadHeal;\n\n\tPayloadBehavior@ m_payload;\n\n\tint m_tmStarting;\n\tint m_tmStarted;\n\tint m_tmLimitCustom;\n\tint m_tmOvertime;\n\tint m_tmInOvertime;\n\n\tPayloadHUD@ m_payloadHUD;\n\tPayloadClassSwitchWindow@ m_switchClass;\n\n\tarray@ m_switchedSidesData;\n\n\tPayload(Scene@ scene)\n\t{\n\t\tsuper(scene);\n\n\t\tm_tmRespawnCountdown = 5000;\n\n\t\t@m_payloadHUD = PayloadHUD(m_guiBuilder);\n\t\t@m_switchTeam = PayloadTeamSwitchWindow(m_guiBuilder);\n\t\t@m_switchClass = PayloadClassSwitchWindow(m_guiBuilder);\n\t}\n\n\tvoid UpdateFrame(int ms, GameInput& gameInput, MenuInput& menuInput) override\n\t{\n\t\tTeamVersusGameMode::UpdateFrame(ms, gameInput, menuInput);\n\n\t\tm_payloadHUD.Update(ms);\n\n\t\tif (Network::IsServer())\n\t\t{\n\t\t\tuint64 tmNow = CurrPlaytimeLevel();\n\n\t\t\tif (m_tmStarting == 0)\n\t\t\t{\n\t\t\t\tif (GetPlayersInTeam(0) > 0 && GetPlayersInTeam(1) > 0)\n\t\t\t\t{\n\t\t\t\t\tm_tmStarting = tmNow;\n\t\t\t\t\t(Network::Message(\"GameStarting\") << m_tmStarting).SendToAll();\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (m_tmStarting > 0 && m_tmStarted == 0 && tmNow - m_tmStarting > PrepareTime * 1000)\n\t\t\t{\n\t\t\t\tm_tmStarted = tmNow;\n\t\t\t\t(Network::Message(\"GameStarted\") << m_tmStarted).SendToAll();\n\n\t\t\t\tfor (uint i = 0; i < g_payloadBeginTriggers.length(); i++)\n\t\t\t\t{\n\t\t\t\t\tWorldScript@ ws = WorldScript::GetWorldScript(g_scene, g_payloadBeginTriggers[i]);\n\t\t\t\t\tws.Execute();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (!m_ended && m_tmStarted > 0)\n\t\t\tCheckTimeReached(ms);\n\t}\n\n\tstring NameForTeam(int index) override\n\t{\n\t\tif (index == 0)\n\t\t\treturn \"Defenders\";\n\t\telse if (index == 1)\n\t\t\treturn \"Attackers\";\n\n\t\treturn \"Unknown\";\n\t}\n\n\tvoid CheckTimeReached(int dt)\n\t{\n\t\t// Check if time limit is not reached yet\n\t\tif (m_tmLimitCustom - (CurrPlaytimeLevel() - m_tmStarted) > 0)\n\t\t{\n\t\t\t// Don't need to continue checking\n\t\t\tm_tmOvertime = 0;\n\t\t\tm_tmInOvertime = 0;\n\t\t\treturn;\n\t\t}\n\n\t\t// Count how long we're in overtime for later time limit fixing when we reach a checkpoint\n\t\tif (m_tmOvertime > 0)\n\t\t\tm_tmInOvertime += dt;\n\n\t\t// Check if there are any attackers still inside\n\t\tif (m_payload.AttackersInside() > 0)\n\t\t{\n\t\t\t// We have overtime\n\t\t\tm_tmOvertime = int(TimeOvertime * 1000);\n\t\t\treturn;\n\t\t}\n\n\t\t// If we have overtime\n\t\tif (m_tmOvertime > 0)\n\t\t{\n\t\t\t// Decrease timer\n\t\t\tm_tmOvertime -= dt;\n\t\t\tif (m_tmOvertime <= 0)\n\t\t\t{\n\t\t\t\t// Overtime countdown reached, time limit reached\n\t\t\t\tTimeReached();\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\t// No overtime, so time limit is reached\n\t\t\tTimeReached();\n\t\t}\n\t}\n\n\tvoid TimeReached()\n\t{\n\t\tif (!Network::IsServer())\n\t\t\treturn;\n\n\t\t(Network::Message(\"TimeReached\")).SendToAll();\n\t\tSetWinner(false);\n\t}\n\n\tbool ShouldFreezeControls() override\n\t{\n\t\treturn m_switchClass.m_visible\n\t\t || TeamVersusGameMode::ShouldFreezeControls();\n\t}\n\n\tbool ShouldDisplayCursor() override\n\t{\n\t\treturn m_switchClass.m_visible\n\t\t || TeamVersusGameMode::ShouldDisplayCursor();\n\t}\n\n\tbool CanSwitchTeams() override\n\t{\n\t\treturn m_tmStarted == 0;\n\t}\n\n\tPlayerRecord@ CreatePlayerRecord() override\n\t{\n\t\treturn PayloadPlayerRecord();\n\t}\n\n\tint GetPlayerClassCount(PlayerClass playerClass, TeamVersusScore@ team)\n\t{\n\t\tif (team is null)\n\t\t\treturn 0;\n\n\t\tint ret = 0;\n\t\tfor (uint i = 0; i < team.m_players.length(); i++)\n\t\t{\n\t\t\tif (team.m_players[i].peer == 255)\n\t\t\t\tcontinue;\n\t\t\tauto record = cast(team.m_players[i]);\n\t\t\tif (record.playerClass == playerClass)\n\t\t\t\tret++;\n\t\t}\n\t\treturn ret;\n\t}\n\n\tvoid PlayerClassesUpdated()\n\t{\n\t\tm_switchClass.PlayerClassesUpdated();\n\t}\n\n\tvoid SetWinner(bool attackers)\n\t{\n\t\tif (attackers)\n\t\t\tprint(\"Attackers win!\");\n\t\telse\n\t\t\tprint(\"Defenders win!\");\n\n\t\tm_payloadHUD.Winner(attackers);\n\t\tEndMatch();\n\t}\n\n\tvoid DisplayPlayerName(int idt, SpriteBatch& sb, PlayerRecord@ record, PlayerHusk@ plr, vec2 pos) override\n\t{\n\t\tTeamVersusGameMode::DisplayPlayerName(idt, sb, record, plr, pos);\n\n\t\tm_payloadHUD.DisplayPlayerName(idt, sb, cast(record), plr, pos);\n\t}\n\n\tvoid RenderFrame(int idt, SpriteBatch& sb) override\n\t{\n\t\tPlayer@ player = GetLocalPlayer();\n\t\tif (player !is null)\n\t\t{\n\t\t\tPlayerHealgun@ healgun = cast(player.m_currWeapon);\n\t\t\tif (healgun !is null)\n\t\t\t\thealgun.RenderMarkers(idt, sb);\n\t\t}\n\n\t\tTeamVersusGameMode::RenderFrame(idt, sb);\n\t}\n\n\tvoid RenderWidgets(PlayerRecord@ player, int idt, SpriteBatch& sb) override\n\t{\n\t\tm_payloadHUD.Draw(sb, idt);\n\n\t\tTeamVersusGameMode::RenderWidgets(player, idt, sb);\n\n\t\tm_switchClass.Draw(sb, idt);\n\t}\n\n\tvoid GoNextMap() override\n\t{\n\t\tif (m_switchedSidesData !is null)\n\t\t{\n\t\t\tTeamVersusGameMode::GoNextMap();\n\t\t\treturn;\n\t\t}\n\n\t\tChangeLevel(GetCurrentLevelFilename());\n\t}\n\n\tvoid SpawnPlayers() override\n\t{\n\t\tif (m_switchedSidesData is null)\n\t\t{\n\t\t\tTeamVersusGameMode::SpawnPlayers();\n\t\t\treturn;\n\t\t}\n\n\t\tif (Network::IsServer())\n\t\t{\n\t\t\tfor (uint i = 0; i < m_switchedSidesData.length(); i += 2)\n\t\t\t{\n\t\t\t\tuint peer = uint(m_switchedSidesData[i].GetInteger());\n\t\t\t\tuint team = uint(m_switchedSidesData[i + 1].GetInteger());\n\n\t\t\t\tTeamVersusScore@ joinScore = FindTeamScore(team);\n\t\t\t\tif (joinScore is m_teamScores[0])\n\t\t\t\t\t@joinScore = m_teamScores[1];\n\t\t\t\telse\n\t\t\t\t\t@joinScore = m_teamScores[0];\n\n\t\t\t\tfor (uint j = 0; j < g_players.length(); j++)\n\t\t\t\t{\n\t\t\t\t\tif (g_players[j].peer != peer)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tSpawnPlayer(j, vec2(), 0, joinScore.m_team);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid Save(SValueBuilder& builder) override\n\t{\n\t\tif (m_switchedSidesData is null)\n\t\t{\n\t\t\tbuilder.PushArray(\"teams\");\n\t\t\tfor (uint i = 0; i < g_players.length(); i++)\n\t\t\t{\n\t\t\t\tif (g_players[i].peer == 255)\n\t\t\t\t\tcontinue;\n\t\t\t\tbuilder.PushInteger(g_players[i].peer);\n\t\t\t\tbuilder.PushInteger(g_players[i].team);\n\t\t\t}\n\t\t\tbuilder.PopArray();\n\t\t}\n\n\t\tTeamVersusGameMode::Save(builder);\n\t}\n\n\tvoid Start(uint8 peer, SValue@ save, StartMode sMode) override\n\t{\n\t\tif (save !is null)\n\t\t\t@m_switchedSidesData = GetParamArray(UnitPtr(), save, \"teams\", false);\n\n\t\tTeamVersusGameMode::Start(peer, save, sMode);\n\n\t\tm_tmLimit = 0; // infinite time limit as far as VersusGameMode is concerned\n\t\tm_tmLimitCustom = TimeLimit * 1000; // 5 minutes by default\n\n\t\t@m_payload = cast(PayloadUnit.FetchFirst().GetScriptBehavior());\n\n\t\tif (m_payload is null)\n\t\t\tPrintError(\"PayloadUnit is not a PayloadBehavior!\");\n\n\t\tUnitPtr unitFirstNode = FirstNode.FetchFirst();\n\t\tif (unitFirstNode.IsValid())\n\t\t{\n\t\t\tauto node = cast(unitFirstNode.GetScriptBehavior());\n\t\t\tif (node !is null)\n\t\t\t\t@m_payload.m_targetNode = node;\n\t\t\telse\n\t\t\t\tPrintError(\"First target node is not a PayloadNode script!\");\n\t\t}\n\t\telse\n\t\t\tPrintError(\"First target node was not set!\");\n\n\t\tWorldScript::PayloadNode@ prevNode;\n\n\t\tfloat totalDistance = 0.0f;\n\n\t\tUnitPtr unitNode = unitFirstNode;\n\t\twhile (unitNode.IsValid())\n\t\t{\n\t\t\tauto node = cast(unitNode.GetScriptBehavior());\n\t\t\tif (node is null)\n\t\t\t\tbreak;\n\n\t\t\tunitNode = node.NextNode.FetchFirst();\n\n\t\t\t@node.m_prevNode = prevNode;\n\t\t\t@node.m_nextNode = cast(unitNode.GetScriptBehavior());\n\n\t\t\tif (prevNode !is null)\n\t\t\t\ttotalDistance += dist(prevNode.Position, node.Position);\n\n\t\t\t@prevNode = node;\n\t\t}\n\n\t\tfloat currDistance = 0.0f;\n\n\t\tauto distNode = cast(unitFirstNode.GetScriptBehavior());\n\t\twhile (distNode !is null)\n\t\t{\n\t\t\tif (distNode.m_prevNode is null)\n\t\t\t\tdistNode.m_locationFactor = 0.0f;\n\t\t\telse\n\t\t\t{\n\t\t\t\tcurrDistance += dist(distNode.m_prevNode.Position, distNode.Position);\n\t\t\t\tdistNode.m_locationFactor = currDistance / totalDistance;\n\t\t\t}\n\n\t\t\t@distNode = distNode.m_nextNode;\n\t\t}\n\n\t\tm_payloadHUD.AddCheckpoints();\n\t}\n\n\tvoid SpawnPlayer(int i, vec2 pos = vec2(), int unitId = 0, uint team = 0) override\n\t{\n\t\tTeamVersusGameMode::SpawnPlayer(i, pos, unitId, team);\n\n\t\tPayloadPlayerRecord@ record = cast(g_players[i]);\n\t\trecord.HandlePlayerClass();\n\n\t\tif (g_players[i].local)\n\t\t{\n\t\t\t//TODO: This doesn't work well\n\t\t\tbool localAttackers = (team == HashString(\"player_1\"));\n\t\t\tfor (uint j = 0; j < g_teamForceFields.length(); j++)\n\t\t\t{\n\t\t\t\tbool hasCollision = (localAttackers != g_teamForceFields[j].Attackers);\n\n\t\t\t\tauto units = g_teamForceFields[j].Units.FetchAll();\n\t\t\t\tfor (uint k = 0; k < units.length(); k++)\n\t\t\t\t{\n\t\t\t\t\tPhysicsBody@ body = units[k].GetPhysicsBody();\n\t\t\t\t\tif (body is null)\n\t\t\t\t\t{\n\t\t\t\t\t\tPrintError(\"PhysicsBody for unit \" + units[k].GetDebugName() + \"is null\");\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tbody.SetActive(hasCollision);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n" }, { "path": "src/test/resources/samples/langs/Ant Build System/filenames/ant.xml", "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 \n \n\n \n \n\n \n \n \n \n\n \n \n \n \n \n \n\n \n \n \n\n \n\t\n\t\n \n \n \n\n\n \n\n \n\n \n \n\n \n \n\n \n \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": "src/test/resources/samples/langs/Ant Build System/filenames/build.xml", "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 \n \n\n \n \n\n \n \n \n \n\n \n \n \n \n \n \n\n \n \n \n\n \n\t\n\t\n \n \n \n\n\n \n\n \n\n \n \n\n \n \n\n \n \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": "src/test/resources/samples/langs/ApacheConf/apache.vhost", "content": "#######################\n# HOSTNAME\n######################\n\n\n ServerAdmin patrick@heysparkbox.com\n DocumentRoot \"/var/www/HOSTNAME\"\n ServerName HOSTNAME\n\n \n Options Indexes MultiViews FollowSymLinks\n AllowOverride All\n Order allow,deny\n Allow from all\n DirectoryIndex index.php\n \n\n" }, { "path": "src/test/resources/samples/langs/ApacheConf/filenames/.htaccess", "content": "ServerSignature Off\nRewriteCond %{REQUEST_METHOD} ^(HEAD|TRACE|DELETE|TRACK) [NC,OR]\nRewriteCond %{THE_REQUEST} (\\\\r|\\\\n|%0A|%0D) [NC,OR]\n\nRewriteCond %{HTTP_REFERER} (<|>|’|%0A|%0D|%27|%3C|%3E|%00) [NC,OR]\nRewriteCond %{HTTP_COOKIE} (<|>|’|%0A|%0D|%27|%3C|%3E|%00) [NC,OR]\nRewriteCond %{REQUEST_URI} ^/(,|;|:|<|>|”>|”<|/|\\\\\\.\\.\\\\).{0,9999} [NC,OR]\n\nRewriteCond %{HTTP_USER_AGENT} ^$ [OR]\nRewriteCond %{HTTP_USER_AGENT} ^(java|curl|wget) [NC,OR]\nRewriteCond %{HTTP_USER_AGENT} (winhttp|HTTrack|clshttp|archiver|loader|email|harvest|extract|grab|miner) [NC,OR]\nRewriteCond %{HTTP_USER_AGENT} (libwww-perl|curl|wget|python|nikto|scan) [NC,OR]\nRewriteCond %{HTTP_USER_AGENT} (<|>|’|%0A|%0D|%27|%3C|%3E|%00) [NC,OR]\n\n#Block mySQL injects\nRewriteCond %{QUERY_STRING} (;|<|>|’|”|\\)|%0A|%0D|%22|%27|%3C|%3E|%00).*(/\\*|union|select|insert|cast|set|declare|drop|update|md5|benchmark) [NC,OR]\n\nRewriteCond %{QUERY_STRING} \\.\\./\\.\\. [OR]\n\nRewriteCond %{QUERY_STRING} (localhost|loopback|127\\.0\\.0\\.1) [NC,OR]\nRewriteCond %{QUERY_STRING} \\.[a-z0-9] [NC,OR]\nRewriteCond %{QUERY_STRING} (<|>|’|%0A|%0D|%27|%3C|%3E|%00) [NC]\n# Note: The final RewriteCond must NOT use the [OR] flag.\n\n# Return 403 Forbidden error.\nRewriteRule .* index.php [F]\n" }, { "path": "src/test/resources/samples/langs/ApacheConf/filenames/apache2.conf", "content": "# This is the main Apache HTTP server configuration file. It contains the\n# configuration directives that give the server its instructions.\n# See for detailed information.\n# In particular, see\n# \n# for a discussion of each configuration directive.\n#\n# Do NOT simply read the instructions in here without understanding\n# what they do. They're here only as hints or reminders. If you are unsure\n# consult the online docs. You have been warned.\n#\n# Configuration and logfile names: If the filenames you specify for many\n# of the server's control files begin with \"/\" (or \"drive:/\" for Win32), the\n# server will use that explicit path. If the filenames do *not* begin\n# with \"/\", the value of ServerRoot is prepended -- so \"/var/log/apache2/foo.log\"\n# with ServerRoot set to \"\" will be interpreted by the\n# server as \"//var/log/apache2/foo.log\".\n\n#\n# ServerRoot: The top of the directory tree under which the server's\n# configuration, error, and log files are kept.\n#\n# Do not add a slash at the end of the directory path. If you point\n# ServerRoot at a non-local disk, be sure to point the LockFile directive\n# at a local disk. If you wish to share the same ServerRoot for multiple\n# httpd daemons, you will need to change at least LockFile and PidFile.\n#\nServerRoot \"\"\n\n#\n# Listen: Allows you to bind Apache to specific IP addresses and/or\n# ports, instead of the default. See also the \n# directive.\n#\n# Change this to Listen on specific IP addresses as shown below to\n# prevent Apache from glomming onto all bound IP addresses.\n#\n#Listen 12.34.56.78:80\nListen 80\n\n#\n# Dynamic Shared Object (DSO) Support\n#\n# To be able to use the functionality of a module which was built as a DSO you\n# have to place corresponding `LoadModule' lines at this location so the\n# directives contained in it are actually available _before_ they are used.\n# Statically compiled modules (those listed by `httpd -l') do not need\n# to be loaded here.\n#\n# Example:\n# LoadModule foo_module modules/mod_foo.so\n#\nLoadModule authn_file_module /usr/lib/apache2/modules/mod_authn_file.so\nLoadModule authn_dbm_module /usr/lib/apache2/modules/mod_authn_dbm.so\nLoadModule authn_anon_module /usr/lib/apache2/modules/mod_authn_anon.so\nLoadModule authn_dbd_module /usr/lib/apache2/modules/mod_authn_dbd.so\nLoadModule authn_default_module /usr/lib/apache2/modules/mod_authn_default.so\nLoadModule authn_alias_module /usr/lib/apache2/modules/mod_authn_alias.so\nLoadModule authz_host_module /usr/lib/apache2/modules/mod_authz_host.so\nLoadModule authz_groupfile_module /usr/lib/apache2/modules/mod_authz_groupfile.so\nLoadModule authz_user_module /usr/lib/apache2/modules/mod_authz_user.so\nLoadModule authz_dbm_module /usr/lib/apache2/modules/mod_authz_dbm.so\nLoadModule authz_owner_module /usr/lib/apache2/modules/mod_authz_owner.so\nLoadModule authnz_ldap_module /usr/lib/apache2/modules/mod_authnz_ldap.so\nLoadModule authz_default_module /usr/lib/apache2/modules/mod_authz_default.so\nLoadModule auth_basic_module /usr/lib/apache2/modules/mod_auth_basic.so\nLoadModule auth_digest_module /usr/lib/apache2/modules/mod_auth_digest.so\nLoadModule file_cache_module /usr/lib/apache2/modules/mod_file_cache.so\nLoadModule cache_module /usr/lib/apache2/modules/mod_cache.so\nLoadModule disk_cache_module /usr/lib/apache2/modules/mod_disk_cache.so\nLoadModule mem_cache_module /usr/lib/apache2/modules/mod_mem_cache.so\nLoadModule dbd_module /usr/lib/apache2/modules/mod_dbd.so\nLoadModule dumpio_module /usr/lib/apache2/modules/mod_dumpio.so\nLoadModule ext_filter_module /usr/lib/apache2/modules/mod_ext_filter.so\nLoadModule include_module /usr/lib/apache2/modules/mod_include.so\nLoadModule filter_module /usr/lib/apache2/modules/mod_filter.so\nLoadModule charset_lite_module /usr/lib/apache2/modules/mod_charset_lite.so\nLoadModule deflate_module /usr/lib/apache2/modules/mod_deflate.so\nLoadModule ldap_module /usr/lib/apache2/modules/mod_ldap.so\nLoadModule log_forensic_module /usr/lib/apache2/modules/mod_log_forensic.so\nLoadModule env_module /usr/lib/apache2/modules/mod_env.so\nLoadModule mime_magic_module /usr/lib/apache2/modules/mod_mime_magic.so\nLoadModule cern_meta_module /usr/lib/apache2/modules/mod_cern_meta.so\nLoadModule expires_module /usr/lib/apache2/modules/mod_expires.so\nLoadModule headers_module /usr/lib/apache2/modules/mod_headers.so\nLoadModule ident_module /usr/lib/apache2/modules/mod_ident.so\nLoadModule usertrack_module /usr/lib/apache2/modules/mod_usertrack.so\nLoadModule unique_id_module /usr/lib/apache2/modules/mod_unique_id.so\nLoadModule setenvif_module /usr/lib/apache2/modules/mod_setenvif.so\nLoadModule version_module /usr/lib/apache2/modules/mod_version.so\nLoadModule proxy_module /usr/lib/apache2/modules/mod_proxy.so\nLoadModule proxy_connect_module /usr/lib/apache2/modules/mod_proxy_connect.so\nLoadModule proxy_ftp_module /usr/lib/apache2/modules/mod_proxy_ftp.so\nLoadModule proxy_http_module /usr/lib/apache2/modules/mod_proxy_http.so\nLoadModule proxy_ajp_module /usr/lib/apache2/modules/mod_proxy_ajp.so\nLoadModule proxy_balancer_module /usr/lib/apache2/modules/mod_proxy_balancer.so\nLoadModule ssl_module /usr/lib/apache2/modules/mod_ssl.so\nLoadModule mime_module /usr/lib/apache2/modules/mod_mime.so\nLoadModule dav_module /usr/lib/apache2/modules/mod_dav.so\nLoadModule status_module /usr/lib/apache2/modules/mod_status.so\nLoadModule autoindex_module /usr/lib/apache2/modules/mod_autoindex.so\nLoadModule asis_module /usr/lib/apache2/modules/mod_asis.so\nLoadModule info_module /usr/lib/apache2/modules/mod_info.so\nLoadModule suexec_module /usr/lib/apache2/modules/mod_suexec.so\nLoadModule cgid_module /usr/lib/apache2/modules/mod_cgid.so\nLoadModule cgi_module /usr/lib/apache2/modules/mod_cgi.so\nLoadModule dav_fs_module /usr/lib/apache2/modules/mod_dav_fs.so\nLoadModule dav_lock_module /usr/lib/apache2/modules/mod_dav_lock.so\nLoadModule vhost_alias_module /usr/lib/apache2/modules/mod_vhost_alias.so\nLoadModule negotiation_module /usr/lib/apache2/modules/mod_negotiation.so\nLoadModule dir_module /usr/lib/apache2/modules/mod_dir.so\nLoadModule imagemap_module /usr/lib/apache2/modules/mod_imagemap.so\nLoadModule actions_module /usr/lib/apache2/modules/mod_actions.so\nLoadModule speling_module /usr/lib/apache2/modules/mod_speling.so\nLoadModule userdir_module /usr/lib/apache2/modules/mod_userdir.so\nLoadModule alias_module /usr/lib/apache2/modules/mod_alias.so\nLoadModule rewrite_module /usr/lib/apache2/modules/mod_rewrite.so\n\n\n#\n# If you wish httpd to run as a different user or group, you must run\n# httpd as root initially and it will switch.\n#\n# User/Group: The name (or #number) of the user/group to run httpd as.\n# It is usually good practice to create a dedicated user and group for\n# running httpd, as with most system services.\n#\nUser daemon\nGroup daemon\n\n\n# 'Main' server configuration\n#\n# The directives in this section set up the values used by the 'main'\n# server, which responds to any requests that aren't handled by a\n# definition. These values also provide defaults for\n# any containers you may define later in the file.\n#\n# All of these directives may appear inside containers,\n# in which case these default settings will be overridden for the\n# virtual host being defined.\n#\n\n#\n# ServerAdmin: Your address, where problems with the server should be\n# e-mailed. This address appears on some server-generated pages, such\n# as error documents. e.g. admin@your-domain.com\n#\nServerAdmin you@example.com\n\n#\n# ServerName gives the name and port that the server uses to identify itself.\n# This can often be determined automatically, but we recommend you specify\n# it explicitly to prevent problems during startup.\n#\n# If your host doesn't have a registered DNS name, enter its IP address here.\n#\n#ServerName www.example.com:80\n\n#\n# DocumentRoot: The directory out of which you will serve your\n# documents. By default, all requests are taken from this directory, but\n# symbolic links and aliases may be used to point to other locations.\n#\nDocumentRoot \"/usr/share/apache2/default-site/htdocs\"\n\n#\n# Each directory to which Apache has access can be configured with respect\n# to which services and features are allowed and/or disabled in that\n# directory (and its subdirectories).\n#\n# First, we configure the \"default\" to be a very restrictive set of\n# features.\n#\n\n Options FollowSymLinks\n AllowOverride None\n Order deny,allow\n Deny from all\n\n\n#\n# Note that from this point forward you must specifically allow\n# particular features to be enabled - so if something's not working as\n# you might expect, make sure that you have specifically enabled it\n# below.\n#\n\n#\n# This should be changed to whatever you set DocumentRoot to.\n#\n\n #\n # Possible values for the Options directive are \"None\", \"All\",\n # or any combination of:\n # Indexes Includes FollowSymLinks SymLinksifOwnerMatch ExecCGI MultiViews\n #\n # Note that \"MultiViews\" must be named *explicitly* --- \"Options All\"\n # doesn't give it to you.\n #\n # The Options directive is both complicated and important. Please see\n # http://httpd.apache.org/docs/2.2/mod/core.html#options\n # for more information.\n #\n Options Indexes FollowSymLinks\n\n #\n # AllowOverride controls what directives may be placed in .htaccess files.\n # It can be \"All\", \"None\", or any combination of the keywords:\n # Options FileInfo AuthConfig Limit\n #\n AllowOverride None\n\n #\n # Controls who can get stuff from this server.\n #\n Order allow,deny\n Allow from all\n\n\n\n#\n# DirectoryIndex: sets the file that Apache will serve if a directory\n# is requested.\n#\n\n DirectoryIndex index.html\n\n\n#\n# The following lines prevent .htaccess and .htpasswd files from being\n# viewed by Web clients.\n#\n\n Order allow,deny\n Deny from all\n Satisfy All\n\n\n#\n# ErrorLog: The location of the error log file.\n# If you do not specify an ErrorLog directive within a \n# container, error messages relating to that virtual host will be\n# logged here. If you *do* define an error logfile for a \n# container, that host's errors will be logged there and not here.\n#\nErrorLog /var/log/apache2/error_log\n\n#\n# LogLevel: Control the number of messages logged to the error_log.\n# Possible values include: debug, info, notice, warn, error, crit,\n# alert, emerg.\n#\nLogLevel warn\n\n\n #\n # The following directives define some format nicknames for use with\n # a CustomLog directive (see below).\n #\n LogFormat \"%h %l %u %t \\\"%r\\\" %>s %b \\\"%{Referer}i\\\" \\\"%{User-Agent}i\\\"\" combined\n LogFormat \"%h %l %u %t \\\"%r\\\" %>s %b\" common\n\n \n # You need to enable mod_logio.c to use %I and %O\n LogFormat \"%h %l %u %t \\\"%r\\\" %>s %b \\\"%{Referer}i\\\" \\\"%{User-Agent}i\\\" %I %O\" combinedio\n \n\n #\n # The location and format of the access logfile (Common Logfile Format).\n # If you do not define any access logfiles within a \n # container, they will be logged here. Contrariwise, if you *do*\n # define per- access logfiles, transactions will be\n # logged therein and *not* in this file.\n #\n CustomLog /var/log/apache2/access_log common\n\n #\n # If you prefer a logfile with access, agent, and referer information\n # (Combined Logfile Format) you can use the following directive.\n #\n #CustomLog /var/log/apache2/access_log combined\n\n\n\n #\n # Redirect: Allows you to tell clients about documents that used to\n # exist in your server's namespace, but do not anymore. The client\n # will make a new request for the document at its new location.\n # Example:\n # Redirect permanent /foo http://www.example.com/bar\n\n #\n # Alias: Maps web paths into filesystem paths and is used to\n # access content that does not live under the DocumentRoot.\n # Example:\n # Alias /webpath /full/filesystem/path\n #\n # If you include a trailing / on /webpath then the server will\n # require it to be present in the URL. You will also likely\n # need to provide a section to allow access to\n # the filesystem path.\n\n #\n # ScriptAlias: This controls which directories contain server scripts.\n # ScriptAliases are essentially the same as Aliases, except that\n # documents in the target directory are treated as applications and\n # run by the server when requested rather than as documents sent to the\n # client. The same rules about trailing \"/\" apply to ScriptAlias\n # directives as to Alias.\n #\n ScriptAlias /cgi-bin/ \"/usr/lib/cgi-bin/\"\n\n\n\n\n #\n # ScriptSock: On threaded servers, designate the path to the UNIX\n # socket used to communicate with the CGI daemon of mod_cgid.\n #\n #Scriptsock /var/run/apache2/cgisock\n\n\n#\n# \"/usr/lib/cgi-bin\" should be changed to whatever your ScriptAliased\n# CGI directory exists, if you have that configured.\n#\n\n AllowOverride None\n Options None\n Order allow,deny\n Allow from all\n\n\n#\n# DefaultType: the default MIME type the server will use for a document\n# if it cannot otherwise determine one, such as from filename extensions.\n# If your server contains mostly text or HTML documents, \"text/plain\" is\n# a good value. If most of your content is binary, such as applications\n# or images, you may want to use \"application/octet-stream\" instead to\n# keep browsers from trying to display binary files as though they are\n# text.\n#\nDefaultType text/plain\n\n\n #\n # TypesConfig points to the file containing the list of mappings from\n # filename extension to MIME-type.\n #\n TypesConfig /etc/apache2/mime.types\n\n #\n # AddType allows you to add to or override the MIME configuration\n # file specified in TypesConfig for specific file types.\n #\n #AddType application/x-gzip .tgz\n #\n # AddEncoding allows you to have certain browsers uncompress\n # information on the fly. Note: Not all browsers support this.\n #\n #AddEncoding x-compress .Z\n #AddEncoding x-gzip .gz .tgz\n #\n # If the AddEncoding directives above are commented-out, then you\n # probably should define those extensions to indicate media types:\n #\n AddType application/x-compress .Z\n AddType application/x-gzip .gz .tgz\n\n #\n # AddHandler allows you to map certain file extensions to \"handlers\":\n # actions unrelated to filetype. These can be either built into the server\n # or added with the Action directive (see below)\n #\n # To use CGI scripts outside of ScriptAliased directories:\n # (You will also need to add \"ExecCGI\" to the \"Options\" directive.)\n #\n #AddHandler cgi-script .cgi\n\n # For type maps (negotiated resources):\n #AddHandler type-map var\n\n #\n # Filters allow you to process content before it is sent to the client.\n #\n # To parse .shtml files for server-side includes (SSI):\n # (You will also need to add \"Includes\" to the \"Options\" directive.)\n #\n #AddType text/html .shtml\n #AddOutputFilter INCLUDES .shtml\n\n\n#\n# The mod_mime_magic module allows the server to use various hints from the\n# contents of the file itself to determine its type. The MIMEMagicFile\n# directive tells the module where the hint definitions are located.\n#\n#MIMEMagicFile /etc/apache2/magic\n\n#\n# Customizable error responses come in three flavors:\n# 1) plain text 2) local redirects 3) external redirects\n#\n# Some examples:\n#ErrorDocument 500 \"The server made a boo boo.\"\n#ErrorDocument 404 /missing.html\n#ErrorDocument 404 \"/cgi-bin/missing_handler.pl\"\n#ErrorDocument 402 http://www.example.com/subscription_info.html\n#\n\n#\n# EnableMMAP and EnableSendfile: On systems that support it,\n# memory-mapping or the sendfile syscall is used to deliver\n# files. This usually improves server performance, but must\n# be turned off when serving from networked-mounted\n# filesystems or if support for these functions is otherwise\n# broken on your system.\n#\n#EnableMMAP off\n#EnableSendfile off\n\n# Supplemental configuration\n#\n# The configuration files in the /etc/apache2/extra/ directory can be\n# included to add extra features or to modify the default configuration of\n# the server, or you may simply copy their contents here and change as\n# necessary.\n\n# Server-pool management (MPM specific)\n#Include /etc/apache2/extra/httpd-mpm.conf\n\n# Multi-language error messages\n#Include /etc/apache2/extra/httpd-multilang-errordoc.conf\n\n# Fancy directory listings\n#Include /etc/apache2/extra/httpd-autoindex.conf\n\n# Language settings\n#Include /etc/apache2/extra/httpd-languages.conf\n\n# User home directories\n#Include /etc/apache2/extra/httpd-userdir.conf\n\n# Real-time info on requests and configuration\n#Include /etc/apache2/extra/httpd-info.conf\n\n# Virtual hosts\n#Include /etc/apache2/extra/httpd-vhosts.conf\n\n# Local access to the Apache HTTP Server Manual\n#Include /etc/apache2/extra/httpd-manual.conf\n\n# Distributed authoring and versioning (WebDAV)\n#Include /etc/apache2/extra/httpd-dav.conf\n\n# Various default settings\n#Include /etc/apache2/extra/httpd-default.conf\n\n# Secure (SSL/TLS) connections\n#Include /etc/apache2/extra/httpd-ssl.conf\n#\n# Note: The following must must be present to support\n# starting without SSL on platforms with no /dev/random equivalent\n# but a statically compiled-in mod_ssl.\n#\n\nSSLRandomSeed startup builtin\nSSLRandomSeed connect builtin\n\n" }, { "path": "src/test/resources/samples/langs/ApacheConf/filenames/httpd.conf", "content": "#\n# This is the main Apache HTTP server configuration file. It contains the\n# configuration directives that give the server its instructions.\n# See for detailed information.\n# In particular, see \n# \n# for a discussion of each configuration directive.\n#\n# Do NOT simply read the instructions in here without understanding\n# what they do. They're here only as hints or reminders. If you are unsure\n# consult the online docs. You have been warned. \n#\n# Configuration and logfile names: If the filenames you specify for many\n# of the server's control files begin with \"/\" (or \"drive:/\" for Win32), the\n# server will use that explicit path. If the filenames do *not* begin\n# with \"/\", the value of ServerRoot is prepended -- so \"log/foo_log\"\n# with ServerRoot set to \"/usr\" will be interpreted by the\n# server as \"/usr/log/foo_log\".\n\n#\n# ServerRoot: The top of the directory tree under which the server's\n# configuration, error, and log files are kept.\n#\n# Do not add a slash at the end of the directory path. If you point\n# ServerRoot at a non-local disk, be sure to point the LockFile directive\n# at a local disk. If you wish to share the same ServerRoot for multiple\n# httpd daemons, you will need to change at least LockFile and PidFile.\n#\nServerRoot \"/usr\"\n\n#\n# Listen: Allows you to bind Apache to specific IP addresses and/or\n# ports, instead of the default. See also the \n# directive.\n#\n# Change this to Listen on specific IP addresses as shown below to \n# prevent Apache from glomming onto all bound IP addresses.\n#\n#Listen 12.34.56.78:80\nListen 80\n\n#\n# Dynamic Shared Object (DSO) Support\n#\n# To be able to use the functionality of a module which was built as a DSO you\n# have to place corresponding `LoadModule' lines at this location so the\n# directives contained in it are actually available _before_ they are used.\n# Statically compiled modules (those listed by `httpd -l') do not need\n# to be loaded here.\n#\n# Example:\n# LoadModule foo_module modules/mod_foo.so\n#\nLoadModule authn_file_module libexec/apache2/mod_authn_file.so\nLoadModule authn_dbm_module libexec/apache2/mod_authn_dbm.so\nLoadModule authn_anon_module libexec/apache2/mod_authn_anon.so\nLoadModule authn_dbd_module libexec/apache2/mod_authn_dbd.so\nLoadModule authn_default_module libexec/apache2/mod_authn_default.so\nLoadModule authz_host_module libexec/apache2/mod_authz_host.so\nLoadModule authz_groupfile_module libexec/apache2/mod_authz_groupfile.so\nLoadModule authz_user_module libexec/apache2/mod_authz_user.so\nLoadModule authz_dbm_module libexec/apache2/mod_authz_dbm.so\nLoadModule authz_owner_module libexec/apache2/mod_authz_owner.so\nLoadModule authz_default_module libexec/apache2/mod_authz_default.so\nLoadModule auth_basic_module libexec/apache2/mod_auth_basic.so\nLoadModule auth_digest_module libexec/apache2/mod_auth_digest.so\nLoadModule cache_module libexec/apache2/mod_cache.so\nLoadModule disk_cache_module libexec/apache2/mod_disk_cache.so\nLoadModule mem_cache_module libexec/apache2/mod_mem_cache.so\nLoadModule dbd_module libexec/apache2/mod_dbd.so\nLoadModule dumpio_module libexec/apache2/mod_dumpio.so\nLoadModule reqtimeout_module libexec/apache2/mod_reqtimeout.so\nLoadModule ext_filter_module libexec/apache2/mod_ext_filter.so\nLoadModule include_module libexec/apache2/mod_include.so\nLoadModule filter_module libexec/apache2/mod_filter.so\nLoadModule substitute_module libexec/apache2/mod_substitute.so\nLoadModule deflate_module libexec/apache2/mod_deflate.so\nLoadModule log_config_module libexec/apache2/mod_log_config.so\nLoadModule log_forensic_module libexec/apache2/mod_log_forensic.so\nLoadModule logio_module libexec/apache2/mod_logio.so\nLoadModule env_module libexec/apache2/mod_env.so\nLoadModule mime_magic_module libexec/apache2/mod_mime_magic.so\nLoadModule cern_meta_module libexec/apache2/mod_cern_meta.so\nLoadModule expires_module libexec/apache2/mod_expires.so\nLoadModule headers_module libexec/apache2/mod_headers.so\nLoadModule ident_module libexec/apache2/mod_ident.so\nLoadModule usertrack_module libexec/apache2/mod_usertrack.so\n#LoadModule unique_id_module libexec/apache2/mod_unique_id.so\nLoadModule setenvif_module libexec/apache2/mod_setenvif.so\nLoadModule version_module libexec/apache2/mod_version.so\nLoadModule proxy_module libexec/apache2/mod_proxy.so\nLoadModule proxy_connect_module libexec/apache2/mod_proxy_connect.so\nLoadModule proxy_ftp_module libexec/apache2/mod_proxy_ftp.so\nLoadModule proxy_http_module libexec/apache2/mod_proxy_http.so\nLoadModule proxy_scgi_module libexec/apache2/mod_proxy_scgi.so\nLoadModule proxy_ajp_module libexec/apache2/mod_proxy_ajp.so\nLoadModule proxy_balancer_module libexec/apache2/mod_proxy_balancer.so\nLoadModule ssl_module libexec/apache2/mod_ssl.so\nLoadModule mime_module libexec/apache2/mod_mime.so\nLoadModule dav_module libexec/apache2/mod_dav.so\nLoadModule status_module libexec/apache2/mod_status.so\nLoadModule autoindex_module libexec/apache2/mod_autoindex.so\nLoadModule asis_module libexec/apache2/mod_asis.so\nLoadModule info_module libexec/apache2/mod_info.so\nLoadModule cgi_module libexec/apache2/mod_cgi.so\nLoadModule dav_fs_module libexec/apache2/mod_dav_fs.so\nLoadModule vhost_alias_module libexec/apache2/mod_vhost_alias.so\nLoadModule negotiation_module libexec/apache2/mod_negotiation.so\nLoadModule dir_module libexec/apache2/mod_dir.so\nLoadModule imagemap_module libexec/apache2/mod_imagemap.so\nLoadModule actions_module libexec/apache2/mod_actions.so\nLoadModule speling_module libexec/apache2/mod_speling.so\nLoadModule userdir_module libexec/apache2/mod_userdir.so\nLoadModule alias_module libexec/apache2/mod_alias.so\nLoadModule rewrite_module libexec/apache2/mod_rewrite.so\n#LoadModule perl_module libexec/apache2/mod_perl.so\n#LoadModule php5_module libexec/apache2/libphp5.so\n#LoadModule hfs_apple_module libexec/apache2/mod_hfs_apple.so\n\n\n\n#\n# If you wish httpd to run as a different user or group, you must run\n# httpd as root initially and it will switch. \n#\n# User/Group: The name (or #number) of the user/group to run httpd as.\n# It is usually good practice to create a dedicated user and group for\n# running httpd, as with most system services.\n#\nUser _www\nGroup _www\n\n\n\n\n# 'Main' server configuration\n#\n# The directives in this section set up the values used by the 'main'\n# server, which responds to any requests that aren't handled by a\n# definition. These values also provide defaults for\n# any containers you may define later in the file.\n#\n# All of these directives may appear inside containers,\n# in which case these default settings will be overridden for the\n# virtual host being defined.\n#\n\n#\n# ServerAdmin: Your address, where problems with the server should be\n# e-mailed. This address appears on some server-generated pages, such\n# as error documents. e.g. admin@your-domain.com\n#\nServerAdmin you@example.com\n\n#\n# ServerName gives the name and port that the server uses to identify itself.\n# This can often be determined automatically, but we recommend you specify\n# it explicitly to prevent problems during startup.\n#\n# If your host doesn't have a registered DNS name, enter its IP address here.\n#\n#ServerName www.example.com:80\n\n#\n# DocumentRoot: The directory out of which you will serve your\n# documents. By default, all requests are taken from this directory, but\n# symbolic links and aliases may be used to point to other locations.\n#\nDocumentRoot \"/Library/WebServer/Documents\"\n\n#\n# Each directory to which Apache has access can be configured with respect\n# to which services and features are allowed and/or disabled in that\n# directory (and its subdirectories). \n#\n# First, we configure the \"default\" to be a very restrictive set of \n# features. \n#\n\n Options FollowSymLinks\n AllowOverride None\n Order deny,allow\n Deny from all\n\n\n#\n# Note that from this point forward you must specifically allow\n# particular features to be enabled - so if something's not working as\n# you might expect, make sure that you have specifically enabled it\n# below.\n#\n\n#\n# This should be changed to whatever you set DocumentRoot to.\n#\n\n #\n # Possible values for the Options directive are \"None\", \"All\",\n # or any combination of:\n # Indexes Includes FollowSymLinks SymLinksifOwnerMatch ExecCGI MultiViews\n #\n # Note that \"MultiViews\" must be named *explicitly* --- \"Options All\"\n # doesn't give it to you.\n #\n # The Options directive is both complicated and important. Please see\n # http://httpd.apache.org/docs/2.2/mod/core.html#options\n # for more information.\n #\n Options Indexes FollowSymLinks MultiViews\n\n #\n # AllowOverride controls what directives may be placed in .htaccess files.\n # It can be \"All\", \"None\", or any combination of the keywords:\n # Options FileInfo AuthConfig Limit\n #\n AllowOverride None\n\n #\n # Controls who can get stuff from this server.\n #\n Order allow,deny\n Allow from all\n\n\n\n#\n# DirectoryIndex: sets the file that Apache will serve if a directory\n# is requested.\n#\n\n DirectoryIndex index.html\n\n\n#\n# The following lines prevent .htaccess and .htpasswd files from being \n# viewed by Web clients. \n#\n\n Order allow,deny\n Deny from all\n Satisfy All\n\n\n#\n# Apple specific filesystem protection.\n#\n\n Order allow,deny\n Deny from all\n Satisfy All\n\n\n Order allow,deny\n Deny from all\n Satisfy All\n\n\n#\n# ErrorLog: The location of the error log file.\n# If you do not specify an ErrorLog directive within a \n# container, error messages relating to that virtual host will be\n# logged here. If you *do* define an error logfile for a \n# container, that host's errors will be logged there and not here.\n#\nErrorLog \"/private/var/log/apache2/error_log\"\n\n#\n# LogLevel: Control the number of messages logged to the error_log.\n# Possible values include: debug, info, notice, warn, error, crit,\n# alert, emerg.\n#\nLogLevel warn\n\n\n #\n # The following directives define some format nicknames for use with\n # a CustomLog directive (see below).\n #\n LogFormat \"%h %l %u %t \\\"%r\\\" %>s %b \\\"%{Referer}i\\\" \\\"%{User-Agent}i\\\"\" combined\n LogFormat \"%h %l %u %t \\\"%r\\\" %>s %b\" common\n\n \n # You need to enable mod_logio.c to use %I and %O\n LogFormat \"%h %l %u %t \\\"%r\\\" %>s %b \\\"%{Referer}i\\\" \\\"%{User-Agent}i\\\" %I %O\" combinedio\n \n\n #\n # The location and format of the access logfile (Common Logfile Format).\n # If you do not define any access logfiles within a \n # container, they will be logged here. Contrariwise, if you *do*\n # define per- access logfiles, transactions will be\n # logged therein and *not* in this file.\n #\n CustomLog \"/private/var/log/apache2/access_log\" common\n\n #\n # If you prefer a logfile with access, agent, and referer information\n # (Combined Logfile Format) you can use the following directive.\n #\n #CustomLog \"/private/var/log/apache2/access_log\" combined\n\n\n\n #\n # Redirect: Allows you to tell clients about documents that used to \n # exist in your server's namespace, but do not anymore. The client \n # will make a new request for the document at its new location.\n # Example:\n # Redirect permanent /foo http://www.example.com/bar\n\n #\n # Alias: Maps web paths into filesystem paths and is used to\n # access content that does not live under the DocumentRoot.\n # Example:\n # Alias /webpath /full/filesystem/path\n #\n # If you include a trailing / on /webpath then the server will\n # require it to be present in the URL. You will also likely\n # need to provide a section to allow access to\n # the filesystem path.\n\n #\n # ScriptAlias: This controls which directories contain server scripts. \n # ScriptAliases are essentially the same as Aliases, except that\n # documents in the target directory are treated as applications and\n # run by the server when requested rather than as documents sent to the\n # client. The same rules about trailing \"/\" apply to ScriptAlias\n # directives as to Alias.\n #\n ScriptAliasMatch ^/cgi-bin/((?!(?i:webobjects)).*$) \"/Library/WebServer/CGI-Executables/$1\"\n\n\n\n\n #\n # ScriptSock: On threaded servers, designate the path to the UNIX\n # socket used to communicate with the CGI daemon of mod_cgid.\n #\n #Scriptsock /private/var/run/cgisock\n\n\n#\n# \"/Library/WebServer/CGI-Executables\" should be changed to whatever your ScriptAliased\n# CGI directory exists, if you have that configured.\n#\n\n AllowOverride None\n Options None\n Order allow,deny\n Allow from all\n\n\n#\n# DefaultType: the default MIME type the server will use for a document\n# if it cannot otherwise determine one, such as from filename extensions.\n# If your server contains mostly text or HTML documents, \"text/plain\" is\n# a good value. If most of your content is binary, such as applications\n# or images, you may want to use \"application/octet-stream\" instead to\n# keep browsers from trying to display binary files as though they are\n# text.\n#\nDefaultType text/plain\n\n\n #\n # TypesConfig points to the file containing the list of mappings from\n # filename extension to MIME-type.\n #\n TypesConfig /private/etc/apache2/mime.types\n\n #\n # AddType allows you to add to or override the MIME configuration\n # file specified in TypesConfig for specific file types.\n #\n #AddType application/x-gzip .tgz\n #\n # AddEncoding allows you to have certain browsers uncompress\n # information on the fly. Note: Not all browsers support this.\n #\n #AddEncoding x-compress .Z\n #AddEncoding x-gzip .gz .tgz\n #\n # If the AddEncoding directives above are commented-out, then you\n # probably should define those extensions to indicate media types:\n #\n AddType application/x-compress .Z\n AddType application/x-gzip .gz .tgz\n\n #\n # AddHandler allows you to map certain file extensions to \"handlers\":\n # actions unrelated to filetype. These can be either built into the server\n # or added with the Action directive (see below)\n #\n # To use CGI scripts outside of ScriptAliased directories:\n # (You will also need to add \"ExecCGI\" to the \"Options\" directive.)\n #\n #AddHandler cgi-script .cgi\n\n # For type maps (negotiated resources):\n #AddHandler type-map var\n\n #\n # Filters allow you to process content before it is sent to the client.\n #\n # To parse .shtml files for server-side includes (SSI):\n # (You will also need to add \"Includes\" to the \"Options\" directive.)\n #\n #AddType text/html .shtml\n #AddOutputFilter INCLUDES .shtml\n\n\n#\n# The mod_mime_magic module allows the server to use various hints from the\n# contents of the file itself to determine its type. The MIMEMagicFile\n# directive tells the module where the hint definitions are located.\n#\n#MIMEMagicFile /private/etc/apache2/magic\n\n#\n# Customizable error responses come in three flavors:\n# 1) plain text 2) local redirects 3) external redirects\n#\n# Some examples:\n#ErrorDocument 500 \"The server made a boo boo.\"\n#ErrorDocument 404 /missing.html\n#ErrorDocument 404 \"/cgi-bin/missing_handler.pl\"\n#ErrorDocument 402 http://www.example.com/subscription_info.html\n#\n\n#\n# MaxRanges: Maximum number of Ranges in a request before\n# returning the entire resource, or one of the special\n# values 'default', 'none' or 'unlimited'.\n# Default setting is to accept 200 Ranges.\n#MaxRanges unlimited\n\n#\n# EnableMMAP and EnableSendfile: On systems that support it, \n# memory-mapping or the sendfile syscall is used to deliver\n# files. This usually improves server performance, but must\n# be turned off when serving from networked-mounted \n# filesystems or if support for these functions is otherwise\n# broken on your system.\n#\n#EnableMMAP off\n#EnableSendfile off\n\n# 6894961\nTraceEnable off\n\n# Supplemental configuration\n#\n# The configuration files in the /private/etc/apache2/extra/ directory can be \n# included to add extra features or to modify the default configuration of \n# the server, or you may simply copy their contents here and change as \n# necessary.\n\n# Server-pool management (MPM specific)\nInclude /private/etc/apache2/extra/httpd-mpm.conf\n\n# Multi-language error messages\n#Include /private/etc/apache2/extra/httpd-multilang-errordoc.conf\n\n# Fancy directory listings\nInclude /private/etc/apache2/extra/httpd-autoindex.conf\n\n# Language settings\nInclude /private/etc/apache2/extra/httpd-languages.conf\n\n# User home directories\nInclude /private/etc/apache2/extra/httpd-userdir.conf\n\n# Real-time info on requests and configuration\n#Include /private/etc/apache2/extra/httpd-info.conf\n\n# Virtual hosts\n#Include /private/etc/apache2/extra/httpd-vhosts.conf\n\n# Local access to the Apache HTTP Server Manual\nInclude /private/etc/apache2/extra/httpd-manual.conf\n\n# Distributed authoring and versioning (WebDAV)\n#Include /private/etc/apache2/extra/httpd-dav.conf\n\n# Various default settings\n#Include /private/etc/apache2/extra/httpd-default.conf\n\n# Secure (SSL/TLS) connections\n#Include /private/etc/apache2/extra/httpd-ssl.conf\n#\n# Note: The following must must be present to support\n# starting without SSL on platforms with no /dev/random equivalent\n# but a statically compiled-in mod_ssl.\n#\n\nSSLRandomSeed startup builtin\nSSLRandomSeed connect builtin\n\n\nInclude /private/etc/apache2/other/*.conf\n" }, { "path": "src/test/resources/samples/langs/Apex/ArrayUtils.cls", "content": "/* ============================================================\n * This code is part of the \"apex-lang\" open source project avaiable at:\n * \n * http://code.google.com/p/apex-lang/\n *\n * This code is licensed under the Apache License, Version 2.0. You may obtain a \n * copy of the License at:\n * \n * http://www.apache.org/licenses/LICENSE-2.0\n * ============================================================\n */\nglobal class ArrayUtils { \n \n global static String[] EMPTY_STRING_ARRAY = new String[]{};\n global static Integer MAX_NUMBER_OF_ELEMENTS_IN_LIST {get{return 1000;}}\n \n global static List objectToString(List objects){\n List strings = null;\n if(objects != null){\n \tstrings = new List();\n \tif(objects.size() > 0){\n\t for(Object obj : objects){\n\t if(obj instanceof String){\n\t strings.add((String)obj);\n\t }\n\t }\n \t}\n }\n return strings;\n }\n\n global static Object[] reverse(Object[] anArray) {\n if (anArray == null) {\n return null;\n }\n Integer i = 0;\n Integer j = anArray.size() - 1;\n Object tmp;\n while (j > i) {\n tmp = anArray[j];\n anArray[j] = anArray[i];\n anArray[i] = tmp;\n j--;\n i++;\n }\n return anArray;\n }\n \n global static SObject[] reverse(SObject[] anArray) {\n if (anArray == null) {\n return null;\n }\n Integer i = 0;\n Integer j = anArray.size() - 1;\n SObject tmp;\n while (j > i) {\n tmp = anArray[j];\n anArray[j] = anArray[i];\n anArray[i] = tmp;\n j--;\n i++;\n }\n return anArray;\n }\n \n global static List lowerCase(List strs){\n List returnValue = null;\n if(strs != null){\n returnValue = new List();\n \tif(strs.size() > 0){\n\t for(String str : strs){\n\t returnValue.add(str == null ? null : str.toLowerCase());\n\t }\n }\n }\n return returnValue;\n }\n \n global static List upperCase(List strs){\n List returnValue = null;\n if(strs != null){\n returnValue = new List();\n if(strs.size() > 0){\n\t for(String str : strs){\n\t returnValue.add(str == null ? null : str.toUpperCase());\n\t }\n }\n }\n return returnValue;\n }\n \n global static List trim(List strs){\n List returnValue = null;\n if(strs != null){\n returnValue = new List();\n if(strs.size() > 0){\n\t for(String str : strs){\n\t returnValue.add(str == null ? null : str.trim());\n\t }\n }\n }\n return returnValue;\n }\n \n global static Object[] mergex(Object[] array1, Object[] array2){\n if(array1 == null){ return array2; }\n if(array2 == null){ return array1; }\n Object[] merged = new Object[array1.size() + array2.size()];\n for(Integer i = 0; i < array1.size(); i++){\n merged[i] = array1[i];\n }\n for(Integer i = 0; i < array2.size(); i++){\n merged[i+array1.size()] = array2[i];\n }\n return merged;\n } \n \n global static SObject[] mergex(SObject[] array1, SObject[] array2){\n if(array1 == null){ return array2; }\n if(array2 == null){ return array1; }\n if(array1.size() <= 0){ return array2; }\n List merged = new List();\n for(SObject sObj : array1){ merged.add(sObj); }\n for(SObject sObj : array2){ merged.add(sObj); }\n return merged;\n } \n \n global static Boolean isEmpty(Object[] objectArray){\n if(objectArray == null){\n return true;\n }\n return objectArray.size() == 0;\n }\n \n global static Boolean isEmpty(SObject[] objectArray){\n if(objectArray == null){\n return true;\n }\n return objectArray.size() == 0;\n }\n \n global static Boolean isNotEmpty(Object[] objectArray){\n return !isEmpty(objectArray);\n }\n \n global static Boolean isNotEmpty(SObject[] objectArray){\n return !isEmpty(objectArray);\n }\n \n global static Object[] pluck(SObject[] objectArray, String fieldName){\n if(isEmpty(objectArray) || fieldName == null || fieldName.trim() == null || fieldName.trim().length() == 0){\n return new Object[]{};\n }\n Object[] plucked = new Object[objectArray.size()];\n for(Integer i = 0; i < objectArray.size(); i++){\n plucked[i] = objectArray[i].get(fieldName);\n }\n return plucked;\n }\n \n \n global static String toString(Object[] objectArray){\n if(objectArray == null){\n return 'null'; \n }\n String returnValue = '{';\n for(Integer i = 0; i < objectArray.size(); i++){\n if(i!=0){ returnValue += ','; }\n returnValue += '\\'' + objectArray[i] + '\\'';\n }\n returnValue += '}';\n return returnValue; \n }\n \n global static String toString(SObject[] objectArray){\n if(objectArray == null){\n return 'null'; \n }\n String returnValue = '{';\n for(Integer i = 0; i < objectArray.size(); i++){\n if(i!=0){ returnValue += ','; }\n returnValue += '\\'' + objectArray[i] + '\\'';\n }\n returnValue += '}';\n return returnValue; \n }\n \n global static void assertArraysAreEqual(Object[] expected, Object[] actual){\n //check to see if one param is null but the other is not\n System.assert((expected == null && actual == null)|| (expected != null && actual != null),\n 'Assertion failed, the following two arrays are not equal. Expected: ' \n + ArrayUtils.toString(expected) + ', Actual: ' + ArrayUtils.toString(actual));\n if(expected != null && actual != null){\n System.assert(expected.size() == actual.size(), 'Assertion failed, the following two arrays are not equal. Expected: ' \n + ArrayUtils.toString(expected) + ', Actual: ' + ArrayUtils.toString(actual));\n for(Integer i = 0; i < expected.size(); i++){\n System.assert(expected[i] == actual[i], 'Assertion failed, the following two arrays are not equal. Expected: ' \n + ArrayUtils.toString(expected) + ', Actual: ' + ArrayUtils.toString(actual));\n }\n }\n }\n \n global static void assertArraysAreEqual(SObject[] expected, SObject[] actual){\n //check to see if one param is null but the other is not\n System.assert((expected == null && actual == null)|| (expected != null && actual != null),\n 'Assertion failed, the following two arrays are not equal. Expected: ' \n + ArrayUtils.toString(expected) + ', Actual: ' + ArrayUtils.toString(actual));\n if(expected != null && actual != null){\n System.assert(expected.size() == actual.size(), 'Assertion failed, the following two arrays are not equal. Expected: ' \n + ArrayUtils.toString(expected) + ', Actual: ' + ArrayUtils.toString(actual));\n for(Integer i = 0; i < expected.size(); i++){\n System.assert(expected[i] == actual[i], 'Assertion failed, the following two arrays are not equal. Expected: ' \n + ArrayUtils.toString(expected) + ', Actual: ' + ArrayUtils.toString(actual));\n }\n }\n }\n \n global static List merg(List list1, List list2) {\n List returnList = new List();\n if(list1 != null && list2 != null && (list1.size()+list2.size()) > MAX_NUMBER_OF_ELEMENTS_IN_LIST){\n throw new IllegalArgumentException('Lists cannot be merged because new list would be greater than maximum number of elements in a list: ' + MAX_NUMBER_OF_ELEMENTS_IN_LIST);\n }\n if(isNotEmpty(list1)){\n for(Object elmt : list1){\n returnList.add(elmt);\n }\n }\n if(isNotEmpty(list2)){\n for(Object elmt : list2){\n returnList.add(elmt);\n }\n }\n return returnList;\n }\n\n \n global static List merg(List list1, List list2) {\n if(list1 != null && list2 != null && (list1.size()+list2.size()) > MAX_NUMBER_OF_ELEMENTS_IN_LIST){\n throw new IllegalArgumentException('Lists cannot be merged because new list would be greater than maximum number of elements in a list: ' + MAX_NUMBER_OF_ELEMENTS_IN_LIST);\n }\n if(isEmpty(list1) && isEmpty(list2)){\n return null;\n }\n List returnList = new List();\n if(list1 != null){\n for(SObject elmt : list1){\n returnList.add(elmt);\n }\n }\n if(list2 != null){\n for(SObject elmt : list2){\n returnList.add(elmt);\n }\n }\n return returnList;\n }\n \n global static List subset(List aList, Integer count) {\n return subset(aList,0,count);\n }\n\n global static List subset(List list1, Integer startIndex, Integer count) {\n List returnList = new List();\n if(list1 != null && list1.size() > 0 && startIndex >= 0 && startIndex <= list1.size()-1 && count > 0){\n for(Integer i = startIndex; i < list1.size() && i - startIndex < count; i++){\n returnList.add(list1.get(i));\n }\n }\n return returnList;\n }\n\n \n global static List subset(List aList, Integer count) {\n return subset(aList,0,count);\n }\n\n global static List subset(List list1, Integer startIndex, Integer count) {\n List returnList = null;\n if(list1 != null && list1.size() > 0 && startIndex <= list1.size()-1 && count > 0){\n returnList = new List();\n for(Integer i = startIndex; i < list1.size() && i - startIndex < count; i++){\n returnList.add(list1.get(i));\n }\n }\n return returnList;\n }\n \n //===============================================\n //LIST/ARRAY SORTING\n //===============================================\n\n //FOR FORCE.COM PRIMITIVES (Double,Integer,ID,etc.):\n global static List qsort(List theList) {\n return qsort(theList,new PrimitiveComparator());\n }\n\n global static List qsort(List theList, Boolean sortAsc) {\n return qsort(theList,new PrimitiveComparator(),sortAsc);\n }\n \n global static List qsort(List theList, ObjectComparator comparator) {\n return qsort(theList,comparator,true);\n }\n \n global static List qsort(List theList, ObjectComparator comparator, Boolean sortAsc) {\n return qsort(theList, 0, (theList == null ? 0 : theList.size()-1),comparator,sortAsc);\n }\n \n\n \n //FOR SALESFORCE OBJECTS (sObjects):\n global static List qsort(List theList, ISObjectComparator comparator) {\n return qsort(theList,comparator,true);\n }\n \n global static List qsort(List theList, ISObjectComparator comparator,Boolean sortAsc ) {\n return qsort(theList, 0, (theList == null ? 0 : theList.size()-1),comparator,sortAsc);\n }\n\n private static List qsort(List theList,\n Integer lo0, \n Integer hi0, \n ObjectComparator comparator,\n Boolean sortAsc){\n Integer lo = lo0;\n Integer hi = hi0;\n \n if (lo >= hi) {\n return theList;\n } else if( lo == hi - 1 ) {\n \n if (( comparator.compare(theList[lo],theList[hi])>0 && sortAsc) || \n (comparator.compare(theList[lo],theList[hi])<0 && !sortAsc) \n ) {\n Object prs = theList[lo];\n theList[lo] = theList[hi];\n theList[hi] = prs;\n }\n return theList;\n }\n\n Object pivot = theList[(lo + hi) / 2];\n theList[(lo + hi) / 2] = theList[hi];\n theList[hi] = pivot;\n\n while( lo < hi ) {\n while ((comparator.compare(theList[lo], pivot)<=0 && lo < hi && sortAsc) || \n (comparator.compare(theList[lo], pivot)>=0 && lo < hi && !sortAsc)\n ) { lo++; }\n while (( comparator.compare(pivot,theList[hi])<=0 && lo < hi && sortAsc) ||\n ( comparator.compare(pivot,theList[hi])>=0 && lo < hi && !sortAsc)\n ) { hi--; }\n \n if( lo < hi ){\n Object prs = theList[lo];\n theList[lo] = theList[hi];\n theList[hi] = prs;\n }\n }\n\n theList[hi0] = theList[hi];\n theList[hi] = pivot;\n \n qsort(theList, lo0, lo-1,comparator,sortAsc);\n qsort(theList, hi+1, hi0,comparator,sortAsc);\n return theList;\n } \n \n \n private static List qsort(List theList,\n Integer lo0, \n Integer hi0, \n ISObjectComparator comparator,\n Boolean sortAsc){\n Integer lo = lo0;\n Integer hi = hi0;\n \n if (lo >= hi) {\n return theList;\n } else if( lo == hi - 1 ) {\n \n if (( comparator.compare(theList[lo],theList[hi])>0 && sortAsc) || \n (comparator.compare(theList[lo],theList[hi])<0 && !sortAsc) \n ) {\n SObject prs = theList[lo];\n theList[lo] = theList[hi];\n theList[hi] = prs;\n }\n return theList;\n }\n\n SObject pivot = theList[(lo + hi) / 2];\n theList[(lo + hi) / 2] = theList[hi];\n theList[hi] = pivot;\n\n while( lo < hi ) {\n while ((comparator.compare(theList[lo], pivot)<=0 && lo < hi && sortAsc) || \n (comparator.compare(theList[lo], pivot)>=0 && lo < hi && !sortAsc)\n ) { lo++; }\n while (( comparator.compare(pivot,theList[hi])<=0 && lo < hi && sortAsc) ||\n ( comparator.compare(pivot,theList[hi])>=0 && lo < hi && !sortAsc)\n ) { hi--; }\n \n if( lo < hi ){\n SObject prs = theList[lo];\n theList[lo] = theList[hi];\n theList[hi] = prs;\n }\n }\n\n theList[hi0] = theList[hi];\n theList[hi] = pivot;\n \n qsort(theList, lo0, lo-1,comparator,sortAsc);\n qsort(theList, hi+1, hi0,comparator,sortAsc);\n return theList;\n }\n/*\n global static List unique(List theList) {\n List uniques = new List();\n Set keys = new Set(); \n if(theList != null && theList.size() > 0){\n for(Object obj : theList){\n if(keys.contains(obj)){\n continue;\n } else {\n keys.add(obj);\n uniques.add(obj);\n }\n }\n }\n return uniques;\n }\n\n global static List unique(List theList) {\n if(theList == null){\n return null;\n }\n List uniques = createEmptySObjectList(theList.get(0));\n Set keys = new Set(); \n if(theList != null && theList.size() > 0){\n String key = null;\n for(SObject obj : theList){\n key = obj == null ? null : ''+obj;\n if(keys.contains(key)){\n continue;\n } else {\n keys.add(key);\n uniques.add(obj);\n }\n }\n }\n return uniques;\n }\n*/\n\n\n}" }, { "path": "src/test/resources/samples/langs/Apex/BooleanUtils.cls", "content": "/* ============================================================\n * This code is part of the \"apex-lang\" open source project avaiable at:\n * \n * http://code.google.com/p/apex-lang/\n *\n * This code is licensed under the Apache License, Version 2.0. You may obtain a \n * copy of the License at:\n * \n * http://www.apache.org/licenses/LICENSE-2.0\n * ============================================================\n */\nglobal class BooleanUtils {\n\n global static Boolean isFalse(Boolean bool)\n {\n if(bool==null)\n return false;\n else\n return !bool;\n }\n \n global static Boolean isNotFalse(Boolean bool)\n {\n if(bool==null)\n return true;\n else\n return bool;\n }\n \n global static Boolean isNotTrue(Boolean bool)\n {\n if(bool==null)\n return true;\n else\n return !bool;\n }\n \n global static Boolean isTrue(Boolean bool)\n {\n if(bool==null)\n return false;\n else\n return bool;\n }\n \n global static Boolean negate(Boolean bool)\n {\n if(bool==null)\n return null;\n else\n return !bool;\n }\n \n global static Boolean toBooleanDefaultIfNull(Boolean bool, Boolean defaultVal)\n {\n if(bool==null)\n return defaultVal;\n else\n return bool;\n }\n \n global static Boolean toBoolean(Integer value)\n {\n if(value==null)\n return false;\n else\n {\n if(value==0)\n return false;\n else\n return true;\n }\n }\n \n global static Boolean strToBoolean(String value)\r\n {\r\n if(value==null)\r\n return false;\r\n else\r\n {\r\n if(StringUtils.equalsIgnoreCase(value,'true'))\r\n return true;\r\n else\r\n return false;\r\n }\r\n }\r\n \n /************************************/\n //Converts an int to a boolean specifying \n //the conversion values.\n // Parameters:\n // value - the Integer to convert, may be null\n // trueValue - the value to match for true, may be null\n // falseValue - the value to match for false, may be null \n //Returns:\n // true or false \n //Throws:\n // java.lang.IllegalArgumentException - if no match\n /************************************/\n global static Boolean toBoolean(Integer value,\n Integer trueValue,\n Integer falseValue)\n {\n if(value==trueValue)\n return true;\n else if(value==falseValue)\n return false;\n else\n throw new IllegalArgumentException();\n }\n \n \n global static Integer toInteger(Boolean bool)\n {\n if(bool==null)\n throw new IllegalArgumentException();\n else\n {\n if(bool)\n return 1;\n else\n return 0;\n }\n }\n \n \n global static String toStringYesNo(Boolean bool)\n {\n if(bool==null)\n return null;\n else\n {\n if(bool)\n return 'yes';\n else\n return 'no';\n }\n }\n \n global static String toStringYN(Boolean bool)\r\n {\r\n if(bool==null)\r\n return null;\r\n else\r\n {\r\n if(bool)\r\n return 'Y';\r\n else\r\n return 'N';\r\n }\r\n }\r\n \r\n \r\n global static String toString(Boolean bool,\n String trueString,\n String falseString)\n {\n if(bool==null)\n return null; \n else\n {\n if(bool)\n return trueString;\n else\n return falseString;\n }\n }\n \n global static Boolean xor(Boolean[] boolArray)\n {\n if(boolArray==null || boolArray.size()==0)\n throw new IllegalArgumentException();\n else\n {\n Boolean firstItem=boolArray[0];\n for(Boolean bool:boolArray)\n {\n if(bool!=firstItem)\n return false;\n }\n return true;\n } \n } \n\n}" }, { "path": "src/test/resources/samples/langs/Apex/EmailUtils.cls", "content": "/* ============================================================\n * Contributor: Caleb Sidel\n * \n * This code is part of the \"apex-lang\" open source project avaiable at:\n * \n * http://code.google.com/p/apex-lang/\n *\n * This code is licensed under the Apache License, Version 2.0. You may obtain a \n * copy of the License at:\n * \n * http://www.apache.org/licenses/LICENSE-2.0\n * ============================================================\n */\nglobal class EmailUtils {\n \n global static void sendEmailWithStandardAttachments(List recipients,String emailSubject,String body,Boolean useHTML,List attachmentIDs) {\n List stdAttachments = [SELECT id, name, body FROM Attachment WHERE Id IN:attachmentIDs];\n sendEmailWithStandardAttachments(recipients, emailSubject, body, useHTML, stdAttachments);\n }\n \n global static void sendEmailWithStandardAttachments(List recipients,String emailSubject,String body,Boolean useHTML,List stdAttachments) {\n List fileAttachments = new List();\n \n for(Attachment attachment : stdAttachments) {\n Messaging.EmailFileAttachment fileAttachment = new Messaging.EmailFileAttachment();\n fileAttachment.setFileName(attachment.Name);\n fileAttachment.setBody(attachment.Body);\n fileAttachments.add(fileAttachment);\n }\n sendEmail(recipients, emailSubject, body, useHTML, fileAttachments);\n }\n \n global static void sendTextEmail(List recipients,String emailSubject,String textBody) { \n sendEmail(recipients, emailSubject, textBody, false, null);\n }\n \n global static void sendHTMLEmail(List recipients,String emailSubject,String htmlBody) { \n sendEmail(recipients, emailSubject, htmlBody, true, null);\n }\n \n global static void sendEmail(List recipients,String emailSubject,String body,Boolean useHTML,List fileAttachments) { \n if(recipients == null) return;\n if(recipients.size() == 0) return;\n // Create a new single email message object\n // that will send out a single email to the addresses in the To, CC & BCC list.\n Messaging.SingleEmailMessage mail = new Messaging.SingleEmailMessage(); \n //the email is not saved as an activity.\n mail.setSaveAsActivity(false);\n // Assign the addresses for the To lists to the mail object.\n mail.setToAddresses(recipients); \n // Specify the subject line for your email address.\n mail.setSubject(emailSubject);\n // Set to True if you want to BCC yourself on the email.\n mail.setBccSender(false);\n // The email address of the user executing the Apex Code will be used.\n mail.setUseSignature(false);\n if (useHTML) {\n // Specify the html content of the email.\n mail.setHtmlBody(body);\n } else {\n // Specify the text content of the email.\n mail.setPlainTextBody(body);\n }\n // Specify FileAttachments\n if(fileAttachments != null && fileAttachments.size() > 0) {\n mail.setFileAttachments(fileAttachments);\n }\n // Send the email you have created.\n Messaging.sendEmail(new Messaging.SingleEmailMessage[] { mail });\n }\n\n /**\n * null => false\n * '' => false\n * ' ' => false\n * 'x' => false\n * 'x@' => false\n * 'x@x' => false\n * 'x@x.x' => true\n */\n global static Boolean isValidEmailAddress(String str){\n if(str != null && str.trim() != null && str.trim().length() > 0){\n String[] split = str.split('@');\n if(split != null && split.size() == 2){\n\t split = split[1].split('\\\\.');\n\t if(split != null && split.size() >= 2){\n\t return true;\n\t }\n }\n }\n return false;\n }\n\n global static Boolean isNotValidEmailAddress(String str){\n \treturn !isValidEmailAddress(str);\n }\n\n}" }, { "path": "src/test/resources/samples/langs/Apex/GeoUtils.cls", "content": "public class GeoUtils {\n\t// generate a KML string given a page reference, call getContent() \n\t// then cleanup the output.\n\tpublic static string generateFromContent(PageReference pr) { \n\t\tstring ret = ''; \n\t\ttry { \n\t ret = (string) pr.getContent().toString();\n\t\t\t\n\t\t\tret = ret.replaceAll('\"','\\'' ); // get content produces quote chars \\\" \n\t ret = ret.replaceAll( '&','&');// we need to escape these in the node value\n } catch (exception e ) { \n \tsystem.debug( 'ERROR '+e); \n }\n \t\t\n \t\tret = ret.replaceAll('\\n',' ');\t// must use ALL since many new line may get \n ret = ret.replaceAll('\\r',' ');\t// get these also!\n // system.debug( ret); // dump the KML \n return ret ;\n\t}\n\t\n\tpublic static Map geo_response = new Map{'200'=>'G_GEO_SUCCESS',\n '400'=>'G_GEO_BAD_REQUEST',\n '500'=>'G_GEO_SERVER_ERROR',\n '601'=>'G_GEO_MISSING_ADDRESS',\n '602'=>'G_GEO_UNKNOWN_ADDRESS',\n '603'=>'G_GEO_UNAVAILABLE_ADDRESS',\n '604'=>'G_GEO_UNKNOWN_DIRECTIONS',\n '610'=>'G_GEO_BAD_KEY',\n '620'=>'G_GEO_TOO_MANY_QUERIES'\n };\n \n\tpublic static string accountAddressString ( account acct ) {\n \t// form an address string given an account object\n \tstring adr = acct.billingstreet + ',' + acct.billingcity + ',' + acct.billingstate; \n if ( acct.billingpostalcode != null ) adr += ',' + acct.billingpostalcode; \n if ( acct.billingcountry != null ) adr += ',' + acct.billingcountry; \n adr = adr.replaceAll('\\\"', '' );\n adr = adr.replaceAll('\\'', '' );\n adr = adr.replaceAll( '\\n', ' ' ); \n adr = adr.replaceAll( '\\r', ' ' ); \n system.debug( adr ); \n return adr;\t\n }\n \n\tpublic static testmethod void t1() { \n\t\tPageReference pageRef = Page.kmlPreviewTemplate;\n Test.setCurrentPage(pageRef);\n system.assert ( GeoUtils.generateFromContent( pageRef ) != null );\n Account a = new Account( name='foo', billingstreet='main', billingcity='springfield',billingstate='il',\n billingpostalcode='9',billingcountry='us');\n insert a;\n system.assertEquals( 'main,springfield,il,9,us',accountAddressString( a) );\n \n\t}\n}" }, { "path": "src/test/resources/samples/langs/Apex/LanguageUtils.cls", "content": "/* ============================================================\n * This code is part of the \"apex-lang\" open source project avaiable at:\n * \n * http://code.google.com/p/apex-lang/\n *\n * This code is licensed under the Apache License, Version 2.0. You may obtain a \n * copy of the License at:\n * \n * http://www.apache.org/licenses/LICENSE-2.0\n * ============================================================\n */\nglobal class LanguageUtils {\n\n global static final String HTTP_LANGUAGE_CODE_PARAMETER_KEY = 'l';\n\tglobal static final String DEFAULT_LANGUAGE_CODE = 'en_us';\n\n global static Set SUPPORTED_LANGUAGE_CODES = new Set{\n 'zh-cn' //Chinese (Simplified)\n ,'zh-tw' //Chinese (Traditional)\n ,'nl-nl' //Dutch\n ,'en-us' //English\n ,'fi' //Finnish\n ,'fr' //French\n ,'de' //German\n ,'it' //Italian\n ,'ja' //Japanese\n ,'ko' //Korean\n ,'pl' //Polish\n ,'pt-br' //Portuguese (Brazilian)\n ,'ru' //Russian\n ,'es' //Spanish\n ,'sv' //Swedish\n ,'th' //Thai\n ,'cs' //Czech\n ,'da' //Danish\n ,'hu' //Hungarian\n ,'in' //Indonesian\n ,'tr' //Turkish\n };\n \n private static Map DEFAULTS = new Map{\n 'en'=>'en-us'\n ,'zh'=>'zh-cn'\n ,'nl'=>'nl-nl'\n ,'pt'=>'pt-br'\n };\n \n\n global static String getLangCodeByHttpParam(){\n \tString returnValue = null;\n final Set LANGUAGE_CODE_SET = getSuppLangCodeSet();\n if(ApexPages.currentPage() != null && ApexPages.currentPage().getParameters() != null){\n\t String LANGUAGE_HTTP_PARAMETER = \n\t StringUtils.lowerCase(\n\t StringUtils.replaceChars( \n\t ApexPages.currentPage().getParameters().get(HTTP_LANGUAGE_CODE_PARAMETER_KEY)\n\t , '_' //underscore\n\t , '-' //dash\n\t )\n\t );\n\t if(DEFAULTS.containsKey(LANGUAGE_HTTP_PARAMETER)){\n\t LANGUAGE_HTTP_PARAMETER = DEFAULTS.get(LANGUAGE_HTTP_PARAMETER);\n\t }\n\t if(StringUtils.isNotBlank(LANGUAGE_HTTP_PARAMETER)\n\t && SUPPORTED_LANGUAGE_CODES.contains(LANGUAGE_HTTP_PARAMETER)){\n\t returnValue = LANGUAGE_HTTP_PARAMETER;\n\t } \n }\n return returnValue;\n }\n\n global static String getLangCodeByBrowser(){\n final String LANGUAGES_FROM_BROWSER_AS_STRING = ApexPages.currentPage().getHeaders().get('Accept-Language');\n final List LANGUAGES_FROM_BROWSER_AS_LIST = splitAndFilterAcceptLanguageHeader(LANGUAGES_FROM_BROWSER_AS_STRING);\n if(LANGUAGES_FROM_BROWSER_AS_LIST != null && LANGUAGES_FROM_BROWSER_AS_LIST.size() > 0){\n for(String languageFromBrowser : LANGUAGES_FROM_BROWSER_AS_LIST){\n if(DEFAULTS.containsKey(languageFromBrowser)){\n languageFromBrowser = DEFAULTS.get(languageFromBrowser);\n }\n if(SUPPORTED_LANGUAGE_CODES.contains(languageFromBrowser)){\n return languageFromBrowser;\n }\n } \n }\n return null;\n }\n \n global static String getLangCodeByUser(){\n return UserInfo.getLanguage();\n }\n \n global static String getLangCodeByHttpParamOrIfNullThenBrowser(){\n return StringUtils.defaultString(getLangCodeByHttpParam(),getLangCodeByBrowser());\n }\n\n global static String getLangCodeByHttpParamOrIfNullThenUser(){\n return StringUtils.defaultString(getLangCodeByHttpParam(),getLangCodeByUser());\n }\n \n global static String getLangCodeByBrowserOrIfNullThenHttpParam(){\n return StringUtils.defaultString(getLangCodeByBrowser(),getLangCodeByHttpParam());\n }\n \n global static String getLangCodeByBrowserOrIfNullThenUser(){\n return StringUtils.defaultString(getLangCodeByBrowser(),getLangCodeByUser());\n }\n \n private static List splitAndFilterAcceptLanguageHeader(String header){\n List returnList = new List();\n String[] tokens = StringUtils.split(header,',');\n if(tokens != null){\n for(String token : tokens){\n if(token != null ){\n if(token.contains(';')){\n token = token.substring(0,token.indexOf(';',0));\n }\n returnList.add(token);\n if(StringUtils.length(token) > 2){\n returnList.add(StringUtils.substring(token,0,2));\n }\n }\n } \n }\n return returnList;\n }\n \n private static Set getSuppLangCodeSet(){\n Set langCodes = new Set();\n for(String langCode : SUPPORTED_LANGUAGE_CODES){\n if(langCode != null){ \n langCodes.add(StringUtils.lowerCase(langCode));\n }\n }\n return langCodes;\n }\n\n\t\n\tglobal static String getLanguageName(String displayLanguageCode, String languageCode){\n\t\treturn translatedLanguageNames.get(filterLanguageCode(displayLanguageCode)).get(filterLanguageCode(languageCode));\n\t}\n\t\n\tglobal static Map getAllLanguages(){\n\t\treturn getAllLanguages(DEFAULT_LANGUAGE_CODE);\n\t}\n\t\n\tglobal static Map getAllLanguages(String displayLanguageCode){\n\t\treturn translatedLanguageNames.get(filterLanguageCode(displayLanguageCode));\n\t}\n\t\n\tprivate static String filterLanguageCode(String displayLanguageCode){\n\t\tdisplayLanguageCode = StringUtils.lowerCase(displayLanguageCode);\n\t\tif(DEFAULTS.containsKey(displayLanguageCode)){\n\t\t\tdisplayLanguageCode = StringUtils.replaceChars(DEFAULTS.get(displayLanguageCode),'-','_');\n\t\t}\n\t\tif(!translatedLanguageNames.containsKey(displayLanguageCode)){\n\t\t\tdisplayLanguageCode = DEFAULT_LANGUAGE_CODE; \n\t\t}\n\t\treturn displayLanguageCode;\n\t}\n\n\tprivate static final Map> translatedLanguageNames = new Map>{\n\t\t'cs'=> new Map{\n'cs'=>'Čeština'\n,'da'=>'Dánština'\n,'de'=>'Němčina'\n,'en_us'=>'Angličtina (Spojené státy)'\n,'es'=>'Španělština'\n,'es_mx'=>'Mexická španělština'\n,'fi'=>'Finština'\n,'fr'=>'Francouzština'\n,'hu'=>'Maďarština'\n,'in'=>'Indonéština'\n,'it'=>'Italština'\n,'ja'=>'Japonština'\n,'ko'=>'Korejština'\n,'nl_nl'=>'Nizozemština'\n,'pl'=>'Polština'\n,'pt_br'=>'Portugalština (Brazílie)'\n,'ro'=>'Rumunština'\n,'ru'=>'Ruština'\n,'sv'=>'Švédština'\n,'th'=>'Thajská'\n,'tr'=>'Turečtina'\n,'zh_cn'=>'Čínština (zjednodušená)'\n,'zh_tw'=>'Čínština (tradiční)'\n}\n,'da'=> new Map{\n'cs'=>'Tjekkisk'\n,'da'=>'Dansk'\n,'de'=>'Tysk'\n,'en_us'=>'Engelsk (USA)'\n,'es'=>'Spansk'\n,'es_mx'=>'Mexicansk spansk'\n,'fi'=>'Finsk'\n,'fr'=>'Fransk'\n,'hu'=>'Ungarsk'\n,'in'=>'Indonesisk'\n,'it'=>'Italiensk'\n,'ja'=>'Japansk'\n,'ko'=>'Koreansk'\n,'nl_nl'=>'Hollandsk'\n,'pl'=>'Polsk'\n,'pt_br'=>'Portugisisk (Brasilien)'\n,'ro'=>'Rumænsk'\n,'ru'=>'Russisk'\n,'sv'=>'Svensk'\n,'th'=>'Thai'\n,'tr'=>'Tyrkisk'\n,'zh_cn'=>'Kinesisk (forenklet)'\n,'zh_tw'=>'Kinesisk (traditionelt)'\n}\n,'de'=> new Map{\n'cs'=>'Tschechisch'\n,'da'=>'Dänisch'\n,'de'=>'Deutsch'\n,'en_us'=>'Englisch (Vereinigte Staaten)'\n,'es'=>'Spanisch'\n,'es_mx'=>'Mexican Spanish'\n,'fi'=>'Finnisch'\n,'fr'=>'Französisch'\n,'hu'=>'Ungarisch'\n,'in'=>'Indonesisch'\n,'it'=>'Italienisch'\n,'ja'=>'Japanisch'\n,'ko'=>'Koreanisch'\n,'nl_nl'=>'Niederländisch'\n,'pl'=>'Polnisch'\n,'pt_br'=>'Portugiesisch (Brasilien)'\n,'ro'=>'Rumänisch'\n,'ru'=>'Russisch'\n,'sv'=>'Schwedisch'\n,'th'=>'Thai'\n,'tr'=>'Türkisch'\n,'zh_cn'=>'Chinesisch (Taiwan)'\n,'zh_tw'=>'Chinesisch (traditionell)'\n}\n,'en_us'=> new Map{\n'cs'=>'Czech'\n,'da'=>'Danish'\n,'de'=>'German'\n,'en_us'=>'English (United States)'\n,'es'=>'Spanish'\n,'es_mx'=>'Mexican Spanish'\n,'fi'=>'Finnish'\n,'fr'=>'French'\n,'hu'=>'Hungarian'\n,'in'=>'Indonesian'\n,'it'=>'Italian'\n,'ja'=>'Japanese'\n,'ko'=>'Korean'\n,'nl_nl'=>'Dutch'\n,'pl'=>'Polish'\n,'pt_br'=>'Portuguese (Brazilian)'\n,'ro'=>'Romanian'\n,'ru'=>'Russian'\n,'sv'=>'Swedish'\n,'th'=>'Thai'\n,'tr'=>'Turkish'\n,'zh_cn'=>'Chinese (Simplified)'\n,'zh_tw'=>'Chinese (Traditional)'\n}\n,'es'=> new Map{\n'cs'=>'Checa'\n,'da'=>'Danés'\n,'de'=>'Alemán'\n,'en_us'=>'Inglés (Estados Unidos)'\n,'es'=>'Español'\n,'es_mx'=>'El español de México'\n,'fi'=>'Finlandés'\n,'fr'=>'Francés'\n,'hu'=>'Húngaro'\n,'in'=>'Indonesia'\n,'it'=>'Italiano'\n,'ja'=>'Japonés'\n,'ko'=>'Corea'\n,'nl_nl'=>'Neerlandés'\n,'pl'=>'Polaco'\n,'pt_br'=>'Portugués (brasileño)'\n,'ro'=>'Rumano'\n,'ru'=>'Rusia'\n,'sv'=>'Sueco'\n,'th'=>'Tailandia'\n,'tr'=>'Turquía'\n,'zh_cn'=>'Chino (simplificado)'\n,'zh_tw'=>'Chino (tradicional)'\n}\n,'es_mx'=> new Map{\n'cs'=>'Checa'\n,'da'=>'Danés'\n,'de'=>'Alemán'\n,'en_us'=>'Inglés (Estados Unidos)'\n,'es'=>'Español'\n,'es_mx'=>'El español de México'\n,'fi'=>'Finlandés'\n,'fr'=>'Francés'\n,'hu'=>'Húngaro'\n,'in'=>'Indonesia'\n,'it'=>'Italiano'\n,'ja'=>'Japonés'\n,'ko'=>'Corea'\n,'nl_nl'=>'Neerlandés'\n,'pl'=>'Polaco'\n,'pt_br'=>'Portugués (brasileño)'\n,'ro'=>'Rumano'\n,'ru'=>'Rusia'\n,'sv'=>'Sueco'\n,'th'=>'Tailandia'\n,'tr'=>'Turquía'\n,'zh_cn'=>'Chino (simplificado)'\n,'zh_tw'=>'Chino (tradicional)'\n}\n,'fi'=> new Map{\n'cs'=>'Tšekki'\n,'da'=>'Tanska'\n,'de'=>'Saksa'\n,'en_us'=>'Englanti (Yhdysvallat)'\n,'es'=>'Espanja'\n,'es_mx'=>'Meksikon espanja'\n,'fi'=>'Suomen'\n,'fr'=>'Ranska'\n,'hu'=>'Unkari'\n,'in'=>'Indonesia'\n,'it'=>'Italia'\n,'ja'=>'Japani'\n,'ko'=>'Korea'\n,'nl_nl'=>'Hollanti'\n,'pl'=>'Puola'\n,'pt_br'=>'Portugali (Brasilia)'\n,'ro'=>'Romania'\n,'ru'=>'Venäjä'\n,'sv'=>'Ruotsi'\n,'th'=>'Thaimaalaisen'\n,'tr'=>'Turkki'\n,'zh_cn'=>'Kiina (yksinkertaistettu)'\n,'zh_tw'=>'Kiina (perinteinen)'\n}\n,'fr'=> new Map{\n'cs'=>'Tchèque'\n,'da'=>'Danois'\n,'de'=>'Allemand'\n,'en_us'=>'Anglais (Etats Unis)'\n,'es'=>'Espagnol'\n,'es_mx'=>'Espagnol mexicain'\n,'fi'=>'Finnois'\n,'fr'=>'Français'\n,'hu'=>'Hongrois'\n,'in'=>'Indonésien'\n,'it'=>'Italien'\n,'ja'=>'Japonais'\n,'ko'=>'Coréen'\n,'nl_nl'=>'Néerlandais'\n,'pl'=>'Polonais'\n,'pt_br'=>'Portugais (brésilien)'\n,'ro'=>'Roumain'\n,'ru'=>'Russe'\n,'sv'=>'Suédois'\n,'th'=>'Thai'\n,'tr'=>'Turc'\n,'zh_cn'=>'Chinois (simplifié)'\n,'zh_tw'=>'Chinois (Traditionnel)'\n}\n,'hu'=> new Map{\n'cs'=>'Cseh'\n,'da'=>'Dán'\n,'de'=>'Német'\n,'en_us'=>'Angol (Egyesült Államok)'\n,'es'=>'Spanyol'\n,'es_mx'=>'Mexikói spanyol'\n,'fi'=>'Finn'\n,'fr'=>'Francia'\n,'hu'=>'Magyar'\n,'in'=>'Indonéz'\n,'it'=>'Olasz'\n,'ja'=>'Japán'\n,'ko'=>'Koreai'\n,'nl_nl'=>'Holland'\n,'pl'=>'Lengyel'\n,'pt_br'=>'Portugál (brazíliai)'\n,'ro'=>'Román'\n,'ru'=>'Orosz'\n,'sv'=>'Svéd'\n,'th'=>'Thaiföldi'\n,'tr'=>'Török'\n,'zh_cn'=>'Kínai (egyszerűsített)'\n,'zh_tw'=>'Kínai (hagyományos)'\n}\n,'in'=> new Map{\n'cs'=>'Ceko'\n,'da'=>'Denmark'\n,'de'=>'Jerman'\n,'en_us'=>'Inggris (Amerika Serikat)'\n,'es'=>'Spanyol'\n,'es_mx'=>'Meksiko Spanyol'\n,'fi'=>'Finlandia'\n,'fr'=>'Prancis'\n,'hu'=>'Hungaria'\n,'in'=>'Indonesia'\n,'it'=>'Italia'\n,'ja'=>'Jepang'\n,'ko'=>'Korea'\n,'nl_nl'=>'Belanda'\n,'pl'=>'Polish'\n,'pt_br'=>'Portugis (Brasil)'\n,'ro'=>'Romanian'\n,'ru'=>'Russian'\n,'sv'=>'Swedia'\n,'th'=>'Thai'\n,'tr'=>'Turkish'\n,'zh_cn'=>'Cina (Sederhana)'\n,'zh_tw'=>'Cina (Tradisional)'\n}\n,'it'=> new Map{\n'cs'=>'Ceco'\n,'da'=>'Danese'\n,'de'=>'Tedesco'\n,'en_us'=>'Inglese (Stati Uniti)'\n,'es'=>'Spagnolo'\n,'es_mx'=>'Spagnolo messicano'\n,'fi'=>'Finlandese'\n,'fr'=>'Francese'\n,'hu'=>'Ungherese'\n,'in'=>'Indonesiano'\n,'it'=>'Italiano'\n,'ja'=>'Giapponese'\n,'ko'=>'Coreano'\n,'nl_nl'=>'Olandese'\n,'pl'=>'Polacco'\n,'pt_br'=>'Portoghese (brasiliano)'\n,'ro'=>'Rumeno'\n,'ru'=>'Russo'\n,'sv'=>'Svedese'\n,'th'=>'Thai'\n,'tr'=>'Turco'\n,'zh_cn'=>'Cinese (semplificato)'\n,'zh_tw'=>'Cinese (tradizionale)'\n}\n,'ja'=> new Map{\n'cs'=>'チェコ語'\n,'da'=>'デンマーク語'\n,'de'=>'ドイツ語'\n,'en_us'=>'英語（アメリカ合衆国）'\n,'es'=>'スペイン語'\n,'es_mx'=>'メキシコのスペイン語'\n,'fi'=>'フィンランド語'\n,'fr'=>'フランス語'\n,'hu'=>'ハンガリー語'\n,'in'=>'インドネシア語'\n,'it'=>'イタリア語'\n,'ja'=>'日本語'\n,'ko'=>'韓国語'\n,'nl_nl'=>'オランダ語'\n,'pl'=>'ポーランド語'\n,'pt_br'=>'ポルトガル語（ブラジル）'\n,'ro'=>'ルーマニア語'\n,'ru'=>'ロシア語'\n,'sv'=>'スウェーデン語'\n,'th'=>'タイ'\n,'tr'=>'トルコ語'\n,'zh_cn'=>'中国語（簡体字）'\n,'zh_tw'=>'中国語（繁体字）'\n}\n,'ko'=> new Map{\n'cs'=>'체코어'\n,'da'=>'덴마크어'\n,'de'=>'독일어'\n,'en_us'=>'영어 (미국)'\n,'es'=>'스페인어'\n,'es_mx'=>'멕시코 스페인'\n,'fi'=>'핀란드어'\n,'fr'=>'프랑스어'\n,'hu'=>'헝가리어'\n,'in'=>'인도네시 아어'\n,'it'=>'이탈리아어'\n,'ja'=>'일본어'\n,'ko'=>'한국어'\n,'nl_nl'=>'네덜란드'\n,'pl'=>'폴란드어'\n,'pt_br'=>'포르투갈어 (브라질)'\n,'ro'=>'루마니아어'\n,'ru'=>'러시아어'\n,'sv'=>'스웨덴어'\n,'th'=>'타이어'\n,'tr'=>'터키어'\n,'zh_cn'=>'중국어 (간체)'\n,'zh_tw'=>'중국어 (번체)'\n}\n,'nl_nl'=> new Map{\n'cs'=>'Tsjechisch'\n,'da'=>'Deens'\n,'de'=>'Duits'\n,'en_us'=>'Engels (Verenigde Staten)'\n,'es'=>'Spaans'\n,'es_mx'=>'Mexicaans Spaans'\n,'fi'=>'Fins'\n,'fr'=>'Frans'\n,'hu'=>'Hongaars'\n,'in'=>'Indonesisch'\n,'it'=>'Italiaans'\n,'ja'=>'Japans'\n,'ko'=>'Koreaans'\n,'nl_nl'=>'Nederlandse'\n,'pl'=>'Pools'\n,'pt_br'=>'Portugees (Braziliaans)'\n,'ro'=>'Roemeens'\n,'ru'=>'Russisch'\n,'sv'=>'Zweeds'\n,'th'=>'Thais'\n,'tr'=>'Turks'\n,'zh_cn'=>'Chinese (Simplified)'\n,'zh_tw'=>'Chinees (traditioneel)'\n}\n,'pl'=> new Map{\n'cs'=>'Czeski'\n,'da'=>'Duński'\n,'de'=>'Niemiecki'\n,'en_us'=>'Angielski (Stany Zjednoczone)'\n,'es'=>'Hiszpański'\n,'es_mx'=>'Mexican hiszpański'\n,'fi'=>'Fiński'\n,'fr'=>'Francuski'\n,'hu'=>'Węgierski'\n,'in'=>'Indonezyjski'\n,'it'=>'Włoski'\n,'ja'=>'Japoński'\n,'ko'=>'Koreański'\n,'nl_nl'=>'Niderlandzki'\n,'pl'=>'Polska'\n,'pt_br'=>'Portugalski (Brazylia)'\n,'ro'=>'Rumuński'\n,'ru'=>'Rosyjski'\n,'sv'=>'Szwedzki'\n,'th'=>'Taj'\n,'tr'=>'Turecki'\n,'zh_cn'=>'Chiński (uproszczony)'\n,'zh_tw'=>'Chiński (tradycyjny)'\n}\n,'pt_br'=> new Map{\n'cs'=>'Tcheco'\n,'da'=>'Dinamarquês'\n,'de'=>'Alemão'\n,'en_us'=>'Inglês (Estados Unidos)'\n,'es'=>'Espanhol'\n,'es_mx'=>'Espanhol mexicano'\n,'fi'=>'Finlandês'\n,'fr'=>'Francês'\n,'hu'=>'Húngaro'\n,'in'=>'Indonésio'\n,'it'=>'Italiano'\n,'ja'=>'Japonês'\n,'ko'=>'Coreano'\n,'nl_nl'=>'Holandês'\n,'pl'=>'Polonês'\n,'pt_br'=>'Português (Brasil)'\n,'ro'=>'Romeno'\n,'ru'=>'Russo'\n,'sv'=>'Sueco'\n,'th'=>'Tailandês'\n,'tr'=>'Turco'\n,'zh_cn'=>'Chinês (simplificado)'\n,'zh_tw'=>'Chinês (Tradicional)'\n}\n,'ro'=> new Map{\n'cs'=>'Cehă'\n,'da'=>'Daneză'\n,'de'=>'Germană'\n,'en_us'=>'În limba engleză (Statele Unite)'\n,'es'=>'Spaniolă'\n,'es_mx'=>'Mexicane Spanish'\n,'fi'=>'Finlandeză'\n,'fr'=>'Franţuzesc'\n,'hu'=>'Maghiară'\n,'in'=>'Indoneziană'\n,'it'=>'Italiană'\n,'ja'=>'Japoneză'\n,'ko'=>'Coreeană'\n,'nl_nl'=>'Olandeză'\n,'pl'=>'Poloneză'\n,'pt_br'=>'Portuguese (Brazilian)'\n,'ro'=>'Român'\n,'ru'=>'Rus'\n,'sv'=>'Suedez'\n,'th'=>'Thai'\n,'tr'=>'Turcă'\n,'zh_cn'=>'Chineză (simplificată)'\n,'zh_tw'=>'Chineză (Tradiţională)'\n}\n,'ru'=> new Map{\n'cs'=>'Чешский'\n,'da'=>'Датский'\n,'de'=>'Немецкий'\n,'en_us'=>'Английский (США)'\n,'es'=>'Испанский'\n,'es_mx'=>'Мексиканские Испанский'\n,'fi'=>'Финский'\n,'fr'=>'Французский'\n,'hu'=>'Венгерский'\n,'in'=>'Индонезийский'\n,'it'=>'Итальянский'\n,'ja'=>'Японский'\n,'ko'=>'Корейский'\n,'nl_nl'=>'Голландский'\n,'pl'=>'Польский'\n,'pt_br'=>'Португальский (бразильский)'\n,'ro'=>'Румынский'\n,'ru'=>'Русский'\n,'sv'=>'Шведский'\n,'th'=>'Тайский'\n,'tr'=>'Турецкий'\n,'zh_cn'=>'Китайский (упрощенный)'\n,'zh_tw'=>'Китайский (традиционный)'\n}\n,'sv'=> new Map{\n'cs'=>'Tjeckiska'\n,'da'=>'Danska'\n,'de'=>'Tyska'\n,'en_us'=>'Engelska (USA)'\n,'es'=>'Spanska'\n,'es_mx'=>'Mexikansk spanska'\n,'fi'=>'Finska'\n,'fr'=>'Franska'\n,'hu'=>'Ungerska'\n,'in'=>'Indonesiska'\n,'it'=>'Italienska'\n,'ja'=>'Japanska'\n,'ko'=>'Koreanska'\n,'nl_nl'=>'Nederländska'\n,'pl'=>'Polska'\n,'pt_br'=>'Portugisiska (Brasilien)'\n,'ro'=>'Rumänska'\n,'ru'=>'Ryska'\n,'sv'=>'Svenska'\n,'th'=>'Thai'\n,'tr'=>'Turkiska'\n,'zh_cn'=>'Kinesiska (förenklad)'\n,'zh_tw'=>'Kinesiska (traditionell)'\n}\n,'th'=> new Map{\n'cs'=>'สาธารณรัฐ เช็ ก'\n,'da'=>'เดนมาร์ก'\n,'de'=>'เยอรมัน'\n,'en_us'=>'ภาษา อังกฤษ States (United)'\n,'es'=>'สเปน'\n,'es_mx'=>'สเปน เม็ก ซิ กัน'\n,'fi'=>'ฟินแลนด์'\n,'fr'=>'ฝรั่งเศส'\n,'hu'=>'ฮังการี'\n,'in'=>'อินโดนีเซีย'\n,'it'=>'อิตาเลียน'\n,'ja'=>'ญี่ปุ่น'\n,'ko'=>'เกาหลี'\n,'nl_nl'=>'ดัตช์'\n,'pl'=>'เงา'\n,'pt_br'=>'โปรตุเกส (บราซิล)'\n,'ro'=>'โรมาเนีย'\n,'ru'=>'ภาษา รัสเซีย'\n,'sv'=>'สวีเดน'\n,'th'=>'ไทย'\n,'tr'=>'ภาษา ตุรกี'\n,'zh_cn'=>'จีน (ประยุกต์)'\n,'zh_tw'=>'ภาษา จีน (ดั้งเดิม)'\n}\n,'tr'=> new Map{\n'cs'=>'Çekçe'\n,'da'=>'Danca'\n,'de'=>'Almanca'\n,'en_us'=>'İngilizce (ABD)'\n,'es'=>'İspanyolca'\n,'es_mx'=>'Mexican İspanyolca'\n,'fi'=>'Fince'\n,'fr'=>'Fransızca'\n,'hu'=>'Macarca'\n,'in'=>'Endonezya Dili'\n,'it'=>'İtalyanca'\n,'ja'=>'Japonca'\n,'ko'=>'Korece'\n,'nl_nl'=>'Hollanda Dili'\n,'pl'=>'Lehçe'\n,'pt_br'=>'Portekizce (Brezilya)'\n,'ro'=>'Romence'\n,'ru'=>'Rusça'\n,'sv'=>'İsveççe'\n,'th'=>'Tay'\n,'tr'=>'Türkçe'\n,'zh_cn'=>'Çince (Basitleştirilmiş)'\n,'zh_tw'=>'Çince (Geleneksel)'\n}\n,'zh_cn'=> new Map{\n'cs'=>'捷克文'\n,'da'=>'丹麦文'\n,'de'=>'德语'\n,'en_us'=>'英语（美国）'\n,'es'=>'西班牙语'\n,'es_mx'=>'墨西哥西班牙语'\n,'fi'=>'芬兰文'\n,'fr'=>'法语'\n,'hu'=>'匈牙利文'\n,'in'=>'印度尼西亚文'\n,'it'=>'意大利语'\n,'ja'=>'日语'\n,'ko'=>'韩文'\n,'nl_nl'=>'荷兰文'\n,'pl'=>'波兰文'\n,'pt_br'=>'葡萄牙语（巴西）'\n,'ro'=>'罗马尼亚文'\n,'ru'=>'俄文'\n,'sv'=>'瑞典文'\n,'th'=>'泰国'\n,'tr'=>'土耳其文'\n,'zh_cn'=>'中文（简体）'\n,'zh_tw'=>'中文（繁体）'\n}\n,'zh_tw'=> new Map{\n'cs'=>'捷克文'\n,'da'=>'丹麥文'\n,'de'=>'德語'\n,'en_us'=>'英語（美國）'\n,'es'=>'西班牙語'\n,'es_mx'=>'墨西哥西班牙語'\n,'fi'=>'芬蘭文'\n,'fr'=>'法語'\n,'hu'=>'匈牙利文'\n,'in'=>'印度尼西亞文'\n,'it'=>'意大利語'\n,'ja'=>'日語'\n,'ko'=>'韓文'\n,'nl_nl'=>'荷蘭文'\n,'pl'=>'波蘭文'\n,'pt_br'=>'葡萄牙語（巴西）'\n,'ro'=>'羅馬尼亞文'\n,'ru'=>'俄文'\n,'sv'=>'瑞典文'\n,'th'=>'泰國'\n,'tr'=>'土耳其文'\n,'zh_cn'=>'中文（簡體）'\n,'zh_tw'=>'中文（繁體）'\n}\n\n\t}; \n \n}" }, { "path": "src/test/resources/samples/langs/Apex/TwilioAPI.cls", "content": "/*\nCopyright (c) 2012 Twilio, Inc.\n\nPermission is hereby granted, free of charge, to any person\nobtaining a copy of this software and associated documentation\nfiles (the \"Software\"), to deal in the Software without\nrestriction, including without limitation the rights to use,\ncopy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the\nSoftware is furnished to do so, subject to the following\nconditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\nOF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\nNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\nHOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\nWHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\nFROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\nOTHER DEALINGS IN THE SOFTWARE.\n*/\n/**\n * Entry point for accessing Twilio resources that are pre-configured\n * with credentials from the Twilio Config custom setting (TwilioConfig__c).\n *\n * To set up your Twilio credentials:\n * 1. Get a Twilio account at http://www.twilio.com/try-twilio\n * 2. Find your Twilio Account Sid and Auth Token at https://www.twilio.com/user/account\n * 3. Log into Salesforce and go to: Setup | Develop | Custom Settings | Manage Twilio Config\n * 4. Create a new Twilo Config instance\n * 5. Copy and paste your Account Sid and Auth Token and click Save\n *\n * NOTE: The Application Sid field is for use with the Twilio Client softphone\n * SDK for Javascript. It is not required for the rest of the Twilio API.\n *\n * Now you can get easy access to Twilio from your Apex code by calling:\n *\n * TwilioRestClient restClient = TwilioAPI.getDefaultClient();\n * restClient.getAccount().getCalls(); \n * // etc. \n */\nglobal class TwilioAPI {\n\n\tprivate class MissingTwilioConfigCustomSettingsException extends Exception {}\n\n\tprivate static TwilioRestClient client;\n\t\n private TwilioAPI() {}\n \n /**\n * Get a TwilioRestClient pre-populated with your TwilioConfig credentials\n */\n public static TwilioRestClient getDefaultClient() {\n \tif (client==null) {\n \t\tTwilioConfig__c twilioCfg = getTwilioConfig();\n\t \tTwilioAPI.client = new TwilioRestClient(twilioCfg.AccountSid__c, twilioCfg.AuthToken__c);\n \t}\n\t \treturn TwilioAPI.client;\n }\n \n /**\n * Get your primary account using your TwilioConfig credentials\n */\n public static TwilioAccount getDefaultAccount() {\n \treturn getDefaultClient().getAccount();\n }\n \n /**\n * Get a new Twilio Client capability token generator pre-populated\n * with your TwilioConfig credentials\n */\n public static TwilioCapability createCapability() {\n\t\tTwilioConfig__c twilioCfg = getTwilioConfig();\n\t\treturn new TwilioCapability(twilioCfg.AccountSid__c, twilioCfg.AuthToken__c); \t\n }\n \n /**\n * Get a new TwilioRestClient authorized with the credentials provided\n */\n public static TwilioRestClient createClient(String accountSid, String authToken) {\n \treturn new TwilioRestClient(accountSid, authToken);\n }\n \n /**\n * Load the org default TwilioConfig record\n */\n public static TwilioConfig__c getTwilioConfig() {\n \tTwilioConfig__c twilioCfg;\n \tif (Test.isRunningTest()) {\n \t\ttwilioCfg = new TwilioConfig__c();\n \t\ttwilioCfg.AccountSid__c = 'ACba8bc05eacf94afdae398e642c9cc32d'; // dummy sid\n \t\ttwilioCfg.AuthToken__c = '12345678901234567890123456789012'; // dummy token\n \t} else {\n \t\ttwilioCfg = TwilioConfig__c.getOrgDefaults();\n\t \tif (twilioCfg==null)\n\t \t\tthrow new MissingTwilioConfigCustomSettingsException('Please enter your Twilio account credentials under Twilio Config custom settings (go to Setup | Develop | Custom Settings | Manage Twilio Config)');\n \t}\n \t\treturn twilioCfg;\n }\n\n \n @isTest\n static void test_TwilioAPI() {\n\t\tSystem.assertEquals('ACba8bc05eacf94afdae398e642c9cc32d', TwilioAPI.getTwilioConfig().AccountSid__c);\n\t\tSystem.assertEquals('12345678901234567890123456789012', TwilioAPI.getTwilioConfig().AuthToken__c);\n\t\tSystem.assertEquals('ACba8bc05eacf94afdae398e642c9cc32d', TwilioAPI.getDefaultClient().getAccountSid());\n\t\tSystem.assertEquals('ACba8bc05eacf94afdae398e642c9cc32d', TwilioAPI.getDefaultClient().getAccount().getSid());\n\t\tSystem.assertEquals('ACba8bc05eacf94afdae398e642c9cc32d', TwilioAPI.getDefaultAccount().getSid());\n\t}\n\t\n}" }, { "path": "src/test/resources/samples/langs/Apollo Guidance Computer/BURN_BABY_BURN--MASTER_IGNITION_ROUTINE.agc", "content": "# Copyright:\tPublic domain.\n# Filename:\tBURN_BABY_BURN--MASTER_IGNITION_ROUTINE.agc\n# Purpose: \tPart of the source code for Luminary 1A build 099.\n#\t\tIt is part of the source code for the Lunar Module's (LM)\n#\t\tApollo Guidance Computer (AGC), for Apollo 11.\n# Assembler:\tyaYUL\n# Contact:\tRon Burkey .\n# Website:\twww.ibiblio.org/apollo.\n# Pages:\t731-751\n# Mod history:\t2009-05-19 RSB\tAdapted from the corresponding \n#\t\t\t\tLuminary131 file, using page \n#\t\t\t\timages from Luminary 1A.\n#\t\t2009-06-07 RSB\tCorrected 3 typos.\n#\t\t2009-07-23 RSB\tAdded Onno's notes on the naming\n#\t\t\t\tof this function, which he got from\n#\t\t\t\tDon Eyles.\n#\n# This source code has been transcribed or otherwise adapted from\n# digitized images of a hardcopy from the MIT Museum. The digitization\n# was performed by Paul Fjeld, and arranged for by Deborah Douglas of\n# the Museum. Many thanks to both. The images (with suitable reduction\n# in storage size and consequent reduction in image quality as well) are\n# available online at www.ibiblio.org/apollo. If for some reason you\n# find that the images are illegible, contact me at info@sandroid.org\n# about getting access to the (much) higher-quality images which Paul\n# actually created.\n#\n# Notations on the hardcopy document read, in part:\n#\n#\tAssemble revision 001 of AGC program LMY99 by NASA 2021112-61\n#\t16:27 JULY 14, 1969 \n\n# Page 731\n## At the get-together of the AGC developers celebrating the 40th anniversary\n## of the first moonwalk, Don Eyles (one of the authors of this routine along\n## with Peter Adler) has related to us a little interesting history behind the\n## naming of the routine.
\n##
\n## It traces back to 1965 and the Los Angeles riots, and was inspired \n## by disc jockey extraordinaire and radio station owner Magnificent Montague.\n## Magnificent Montague used the phrase \"Burn, baby! BURN!\" when spinning the \n## hottest new records. Magnificent Montague was the charismatic voice of\n## soul music in Chicago, New York, and Los Angeles from the mid-1950s to \n## the mid-1960s.\n# BURN, BABY, BURN -- MASTER IGNITION ROUTINE\n\n\t\tBANK\t36\n\t\tSETLOC\tP40S\n\t\tBANK\n\t\tEBANK=\tWHICH\n\t\tCOUNT*\t$$/P40\n\n# THE MASTER IGNITION ROUTINE IS DESIGNED FOR USE BY THE FOLLOWING LEM PROGRAMS: P12, P40, P42, P61, P63.\n# IT PERFORMS ALL FUNCTIONS IMMEDIATELY ASSOCIATED WITH APS OR DPS IGNITION: IN PARTICULAR, EVERYTHING LYING\n# BETWEEN THE PRE-IGNITION TIME CHECK -- ARE WE WITHIN 45 SECONDS OF TIG? -- AND TIG + 26 SECONDS, WHEN DPS\n# PROGRAMS THROTTLE UP.\n#\n# VARIATIONS AMONG PROGRAMS ARE ACCOMODATED BY MEANS OF TABLES CONTAINING CONSTANTS (FOR AVEGEXIT, FOR\n# WAITLIST, FOR PINBALL) AND TCF INSTRUCTIONS. USERS PLACE THE ADRES OF THE HEAD OF THE APPROPRIATE TABLE\n# (OF P61TABLE FOR P61LM, FOR EXAMPLE) IN ERASABLE REGISTER `WHICH' (E4). THE IGNITION ROUTINE THEN INDEXES BY\n# WHICH TO OBTAIN OR EXECUTE THE PROPER TABLE ENTRY. THE IGNITION ROUTINE IS INITIATED BY A TCF BURNBABY,\n# THROUGH BANKJUMP IF NECESSARY. THERE IS NO RETURN.\n#\n# THE MASTER IGNITION ROUTINE WAS CONCEIVED AND EXECUTED, AND (NOTA BENE) IS MAINTAINED BY ADLER AND EYLES.\n#\n# \t\t HONI SOIT QUI MAL Y PENSE\n#\n#\t***********************************************\n#\t\tTABLES FOR THE IGNITION ROUTINE\n#\t***********************************************\n#\n#\t\t\tNOLI SE TANGERE\n\nP12TABLE\tVN\t0674\t\t# (0)\n\t\tTCF\tULLGNOT\t\t# (1)\n\t\tTCF\tCOMFAIL3\t# (2)\n\t\tTCF\tGOCUTOFF\t# (3)\n\t\tTCF\tTASKOVER\t# (4)\n\t\tTCF\tP12SPOT\t\t# (5)\n\t\tDEC\t0\t\t# (6)\tNO ULLAGE\n\t\tEBANK=\tWHICH\n\t\t2CADR\tSERVEXIT\t# (7)\n\n\t\tTCF\tDISPCHNG\t# (11)\n\t\tTCF\tWAITABIT\t# (12)\n\t\tTCF\tP12IGN\t\t# (13)\n\nP40TABLE\tVN\t0640\t\t# (0)\n\t\tTCF\tULLGNOT\t\t# (1)\n\t\tTCF\tCOMFAIL4\t# (2)\n\t\tTCF\tGOPOST\t\t# (3)\n\t\tTCF\tTASKOVER\t# (4)\n\t\tTCF\tP40SPOT\t\t# (5)\n# Page 732\n\t\tDEC\t2240\t\t# (6)\n\t\tEBANK=\tOMEGAQ\n\t\t2CADR\tSTEERING\t# (7)\n\n\t\tTCF\tP40SJUNK\t# (11)\n\t\tTCF\tWAITABIT\t# (12)\n\t\tTCF\tP40IGN\t\t# (13)\n\t\tTCF\tREP40ALM\t# (14)\n\nP41TABLE\tTCF\tP41SPOT\t\t# (5)\n\t\tDEC\t-1\t\t# (6)\n\t\tEBANK=\tOMEGAQ\n\t\t2CADR\tCALCN85\t\t# (7)\n\n\t\tTCF\tCOMMON\t\t# (11)\n\t\tTCF\tTIGTASK\t\t# (12)\n\nP42TABLE\tVN\t0640\t\t# (0)\n\t\tTCF\tWANTAPS\t\t# (1)\n\t\tTCF\tCOMFAIL4\t# (2)\n\t\tTCF\tGOPOST\t\t# (3)\n\t\tTCF\tTASKOVER\t# (4)\n\t\tTCF\tP42SPOT\t\t# (5)\n\t\tDEC\t2640\t\t# (6)\n\t\tEBANK=\tOMEGAQ\n\t\t2CADR\tSTEERING\t# (7)\n\n\t\tTCF\tP40SJUNK\t# (11)\n\t\tTCF\tWAITABIT\t# (12)\n\t\tTCF\tP42IGN\t\t# (13)\n\t\tTCF\tP42STAGE\t# (14)\n\nP63TABLE\tVN\t0662\t\t# (0)\n\t\tTCF\tULLGNOT\t\t# (1)\n\t\tTCF\tCOMFAIL3\t# (2)\n\t\tTCF\tV99RECYC\t# (3)\n\t\tTCF\tTASKOVER\t# (4)\n\t\tTCF\tP63SPOT\t\t# (5)\n\t\tDEC\t2240\t\t# (6)\n\t\tEBANK=\tWHICH\n\t\t2CADR\tSERVEXIT\t# (7)\n\n\t\tTCF\tDISPCHNG\t# (11)\n\t\tTCF\tWAITABIT\t# (12)\n# Page 733\n\t\tTCF\tP63IGN\t\t# (13)\n\nABRTABLE\tVN\t0663\t\t# (0)\n\t\tTCF\tULLGNOT\t\t# (1)\n\t\tTCF\tCOMFAIL3\t# (2)\n\t\tTCF\tGOCUTOFF\t# (3)\n\t\tTCF\tTASKOVER\t# (4)\n\t\tNOOP\t\t\t# (5)\n\t\tNOOP\t\t\t# (6)\n\t\tNOOP\t\t\t# (7)\n\t\tNOOP\n\t\tTCF\tDISPCHNG\t# (11)\n\t\tTCF\tWAITABIT\t# (12)\n\t\tTCF\tABRTIGN\t\t# (13)\n\n#\t*********************************\n#\tGENERAL PURPOSE IGNITION ROUTINES\n#\t*********************************\n\nBURNBABY\tTC\tPHASCHNG\t# GROUP 4 RESTARTS HERE\n\t\tOCT\t04024\n\n\t\tCAF\tZERO\t\t# EXTIRPATE JUNK LEFT IN DVTOTAL\n\t\tTS\tDVTOTAL\n\t\tTS\tDVTOTAL +1\n\n\t\tTC\tBANKCALL\t# P40AUTO MUST BE BANKCALLED EVEN FROM ITS\n\t\tCADR\tP40AUTO\t\t# OWN BANK TO SET UP RETURN PROPERLY\n\nB*RNB*B*\tEXTEND\n\t\tDCA\tTIG\t\t# STORE NOMINAL TIG FOR OBLATENESS COMP.\n\t\tDXCH\tGOBLTIME\t# AND FOR P70 OR P71.\n\n\t\tINHINT\n\t\tTC\tIBNKCALL\n\t\tCADR\tENGINOF3\n\t\tRELINT\n\n\t\tINDEX\tWHICH\n\t\tTCF\t5\n\nP42SPOT\t\t=\tP40SPOT\t\t# (5)\nP12SPOT\t\t=\tP40SPOT\t\t# (5)\nP63SPOT\t\t=\tP41SPOT\t\t# (5)\tIN P63 CLOKTASK ALREADY GOING\nP40SPOT\t\tCS\tCNTDNDEX\t# (5)\n# Page 734\n\t\tTC\tBANKCALL\t# MUST BE BANKCALLED FOR GENERALIZED\n\t\tCADR\tSTCLOK2\t\t# \tRETURN\nP41SPOT\t\tTC\tINTPRET\t\t# (5)\n\t\tDLOAD\tDSU\n\t\t\tTIG\n\t\t\tD29.9SEC\n\t\tSTCALL\tTDEC1\n\t\t\tINITCDUW\n\t\tBOFF\tCALL\n\t\t\tMUNFLAG\n\t\t\tGOMIDAV\n\t\t\tCSMPREC\n\t\tVLOAD\tMXV\n\t\t\tVATT1\n\t\t\tREFSMMAT\n\t\tVSR1\n\t\tSTOVL\tV(CSM)\t\t# CSM VELOCITY -- M/CS*2(7)\n\t\t\tRATT1\n\t\tVSL4\tMXV\n\t\t\tREFSMMAT\n\t\tSTCALL\tR(CSM)\t\t# CSM POSITION -- M*2(24)\n\t\t\tMUNGRAV\n\t\tSTODL\tG(CSM)\t\t# CSM GRAVITY VEC. -- M/CS*2(7)\n\t\t\tTAT\n\t\tSTORE\tTDEC1\t\t# RELOAD TDEC1 FOR MIDTOAV.\nGOMIDAV\t\tCALRB\n\t\t\tMIDTOAV1\n\t\tTCF\tCALLT-35\t# MADE IT IN TIME.\n\n\t\tEXTEND\t\t\t# TIG WAS SLIPPED, SO RESET TIG TO 29.9\n\t\tDCA\tPIPTIME1\t# SECONDS AFTER THE TIME TO WHICH WE DID\n\t\tDXCH\tTIG\t\t# INTEGRATE.\n\t\tEXTEND\n\t\tDCA\tD29.9SEC\n\t\tDAS\tTIG\n\nCALLT-35\tDXCH\tMPAC\n\t\tDXCH\tSAVET-30\t# DELTA-T UNTIL TIG-30\n\t\tEXTEND\n\t\tDCS\t5SECDP\n\t\tDAS\tSAVET-30\t# DELTA-T UNTIL TIG-35\n\t\tEXTEND\n\t\tDCA\tSAVET-30\n\t\tTC\tLONGCALL\n\t\tEBANK=\tTTOGO\n\t\t2CADR\tTIG-35\n\n\t\tTC\tPHASCHNG\n\t\tOCT\t20254\t\t# 4.25SPOT FOR TIG-35 RESTART.\n# Page 735\n\t\tTC\tCHECKMM\n\t\tDEC\t63\n\t\tTCF\tENDOFJOB\t# NOT P63\n\t\tCS\tCNTDNDEX\t# P63 CAN START DISPLAYING NOW.\n\t\tTS\tDISPDEX\n\t\tTC\tINTPRET\n\t\tVLOAD\tABVAL\n\t\t\tVN1\n\t\tSTORE\tABVEL\t\t# INITIALIZE ABVEL FOR P63 DISPLAY\n\t\tEXIT\n\t\tTCF\tENDOFJOB\n\n#\t********************************\n\nTIG-35\t\tCAF\t5SEC\n\t\tTC\tTWIDDLE\n\t\tADRES\tTIG-30\n\n\t\tTC\tPHASCHNG\n\t\tOCT\t40154\t\t# 4.15SPOT FOR TIG-30 RESTART\n\n\t\tCS\tBLANKDEX\t# BLANK DSKY FOR 5 SECONDS\n\t\tTS\tDISPDEX\n\n\t\tINDEX\tWHICH\n\t\tCS\t6\t\t# CHECK ULLAGE TIME.\n\t\tEXTEND\n\t\tBZMF\tTASKOVER\n\t\tCAF\t4.9SEC\t\t# SET UP TASK TO RESTORE DISPLAY AT TIG-30\n\t\tTC\tTWIDDLE\n\t\tADRES\tTIG-30.1\n\n\t\tCAF\tPRIO17\t\t# A NEGATIVE ULLAGE TIME INDICATES P41, IN\n\t\tTC\tNOVAC\t\t# WHICH CASE WE HAVE TO SET UP A JOB TO\n\t\tEBANK=\tTTOGO\t\t# BLANK THE DSKY FOR FIVE SECONDS, SINCE\n\t\t2CADR\tP41BLANK\t# CLOKJOB IS NOT RUNNING DURING P41.\n\n\t\tTCF\tTASKOVER\n\nP41BLANK\tTC\tBANKCALL\t# BLANK DSKY.\n\t\tCADR\tCLEANDSP\n\t\tTCF\tENDOFJOB\n\nTIG-30.1\tCAF\tPRIO17\t\t# SET UP JOB TO RESTORE DISPLAY AT TIG-30\n\t\tTC\tNOVAC\n\t\tEBANK=\tTTOGO\n\t\t2CADR\tTIG-30A\n\n\t\tTCF\tTASKOVER\n# Page 736\nTIG-30A\t\tCAF\tV16N85B\n\t\tTC\tBANKCALL\t# RESTORE DISPLAY.\n\t\tCADR\tREGODSP\t\t# REGODSP DOES A TCF ENDOFJOB\n\n#\t********************************\n\nTIG-30\t\tCAF\tS24.9SEC\n\t\tTC\tTWIDDLE\n\t\tADRES\tTIG-5\n\n\t\tCS\tCNTDNDEX\t# START UP CLOKTASK AGAIN\n\t\tTS\tDISPDEX\n\n\t\tINDEX\tWHICH\t\t# PICK UP APPROPRIATE ULLAGE -- ON TIME\n\t\tCA\t6\t\t# Was CAF --- RSB 2009.\n\t\tEXTEND\n\t\tBZMF\tULLGNOT\t\t# DON'T SET UP ULLAGE IF DT IS NEG OR ZERO\n\t\tTS\tSAVET-30\t# SAVE DELTA-T FOR RESTART\n\t\tTC\tTWIDDLE\n\t\tADRES\tULLGTASK\n\n\t\tCA\tTHREE\t\t# RESTART PROTECT ULLGTASK (1.3SPOT)\n\t\tTS\tL\n\t\tCS\tTHREE\n\t\tDXCH\t-PHASE1\n\t\tCS\tTIME1\n\t\tTS\tTBASE1\n\n\t\tINDEX\tWHICH\n\t\tTCF\t1\n\nWANTAPS\t\tCS\tFLGWRD10\t# (1) FOR P42 ENSURE APSFLAG IS SET. IF IT\n\t\tMASK\tAPSFLBIT\t# WASN'T SET, DAP WILL BE INITIALIZED TO\n\t\tADS\tFLGWRD10\t# ASCENT VALUES BY 1/ACCS IN 2 SECONDS.\n\nULLGNOT\t\tEXTEND\t\t\t# (1)\n\t\tINDEX\tWHICH\n\t\tDCA\t7\t\t# LOAD AVEGEXIT WITH APPROPRIATE 2CADR\n\t\tDXCH\tAVEGEXIT\n\n\t\tCAF\tTWO\t\t# 4.2SPOT RESTARTS IMMEDIATELY AT REDO4.2\n\t\tTS\tL\n\t\tCS\tTWO\t\t# AND ALSO AT TIG-5 AT THE CORRECT TIME.\n\t\tDXCH\t-PHASE4\n\n\t\tCS\tTIME1\n\t\tTS\tTBASE4\t\t# SET TBASE4 FOR TIG-5 RESTART\n\nREDO2.17\tEXTEND\n# Page 737\n\t\tDCA\tNEG0\t\t# CLEAR OUT GROUP 2 SO LAMBERT CAN START\n\t\tDXCH\t-PHASE2\t\t# IF NEEDED.\n\nREDO4.2\t\tCCS\tPHASE5\t\t# IF SERVICER GOING?\n\t\tTCF\tTASKOVER\t# YES, DON'T START IT UP AGAIN.\n\n\t\tTC\tPOSTJUMP\n\t\tCADR\tPREREAD\t\t# PREREAD END THIS TASK\n\n# \t*********************************\n\nULLGTASK\tTC\tONULLAGE\t# THIS COMES AT TIG-7.5 OR TIG-3.5\n\t\tTC\tPHASCHNG\n\t\tOCT\t1\n\t\tTCF\tTASKOVER\n\n# \t*********************************\n\nTIG-5\t\tEXTEND\n\t\tDCA\tNEG0\t\t# INSURE THAT GROUP 3 IS INACTIVE.\n\t\tDXCH\t-PHASE3\n\n\t\tCAF\t5SEC\n\t\tTC\tTWIDDLE\n\t\tADRES\tTIG-0\n\n\t\tTC\tDOWNFLAG\t# RESET IGNFLAG AND ASINFLAG\n\t\tADRES\tIGNFLAG\t\t# \tFOR LIGHT-UP LOGIC.\n\t\tTC\tDOWNFLAG\n\t\tADRES\tASTNFLAG\n\t\t\n\t\tINDEX\tWHICH\n\t\tTCF\t11\n\nP40SJUNK\tCCS\tPHASE3\t\t# (11) P40 AND P42. S40.13 IN PROGRESS?\n\t\tTCF\tDISPCHNG\t# YES\n\n\t\tCAF\tPRIO20\n\t\tTC\tFINDVAC\n\t\tEBANK=\tTTOGO\n\t\t2CADR\tS40.13\n\n\t\tTC\tPHASCHNG\t# 3.5SPOT FOR S40.13\n\t\tOCT\t00053\nDISPCHNG\tCS\tVB99DEX\t\t# (11)\n\t\tTS\tDISPDEX\n\n# Page 738\t\t\nCOMMON\t\tTC\tPHASCHNG\t# RESTART TIG-0 (4.7SPOT)\n\t\tOCT\t40074\n\t\tTCF\tTASKOVER\n\n# \t*********************************\n\nTIG-0\t\tCS\tFLAGWRD7\t# SET IGNFLAG SINCE TIG HAS ARRIVED\n\t\tMASK\tIGNFLBIT\n\t\tADS\tFLAGWRD7\n\n\t\tTC\tCHECKMM\t\t# IN P63 CASE, THROTTLE-UP IS ZOOMTIME\n\t\tDEC\t63\t\t# AFTER NOMINAL IGNITION, NOT ACTUAL\n\t\tTCF\tIGNYET?\n\t\tCA\tZOOMTIME\n\t\tTC\tWAITLIST\n\t\tEBANK=\tDVCNTR\n\t\t2CADR\tP63ZOOM\n\n\t\tTC\t2PHSCHNG\n\t\tOCT\t40033\n\n\t\tOCT\t05014\n\t\tOCT\t77777\n\nIGNYET?\t\tCAF\tASTNBIT\t\t# CHECK ASTNFLAG: HAS ASTRONAUT RESPONDED\n\t\tMASK\tFLAGWRD7\t# TO OUR ENGINE ENABLE REQUEST?\n\t\tEXTEND\n\t\tINDEX\tWHICH\n\t\tBZF\t12\t\t# BRANCH IF HE HAS NOT RESPONDED YET\n\nIGNITION\tCS\tFLAGWRD5\t# INSURE ENGONFLG IS SET.\n\t\tMASK\tENGONBIT\n\t\tADS\tFLAGWRD5\n\t\tCS\tPRIO30\t\t# TURN ON THE ENGINE.\n\t\tEXTEND\n\t\tRAND\tDSALMOUT\n\t\tAD\tBIT13\n\t\tEXTEND\n\t\tWRITE\tDSALMOUT\n\t\tEXTEND\t\t\t# SET TEVENT FOR DOWNLINK\n\t\tDCA\tTIME2\n\t\tDXCH\tTEVENT\n\n\t\tEXTEND\t\t\t# UPDATE TIG USING TGO FROM S40.13\n\t\tDCA\tTGO\n\t\tDXCH\tTIG\n\t\tEXTEND\n\t\tDCA\tTIME2\n\t\tDAS\tTIG\n\n# Page 739\n\t\tCS\tFLUNDBIT\t# PERMIT GUIDANCE LOOP DISPLAYS\n\t\tMASK\tFLAGWRD8\n\t\tTS\tFLAGWRD8\n\n\t\tINDEX\tWHICH\n\t\tTCF\t13\n\nP63IGN\t\tEXTEND\t\t\t# (13)\tINITIATE BURN DISPLAYS\n\t\tDCA\tDSP2CADR\n\t\tDXCH\tAVGEXIT\n\n\t\tCA\tZ\t\t# ASSASSINATE CLOKTASK\n\t\tTS\tDISPDEX\n\n\t\tCS\tFLAGWRD9\t# SET FLAG FOR P70-P71\n\t\tMASK\tLETABBIT\n\t\tADS\tFLAGWRD9\n\t\t\n\t\tCS\tFLAGWRD7\t# SET SWANDISP TO ENABLE R10.\n\t\tMASK\tSWANDBIT\n\t\tADS\tFLAGWRD7\n\t\t\n\t\tCS\tPULSES\t\t# MAKE SURE DAP IS NOT IN MINIMUM-IMPULSE\n\t\tMASK\tDAPBOOLS\t# MODE, IN CASE OF SWITCH TO P66\n\t\tTS\tDAPBOOLS\n\n\t\tEXTEND\t\t\t# INITIALIZE TIG FOR P70 AND P71.\n\t\tDCA\tTIME2\n\t\tDXCH\tTIG\n\n\t\tCAF\tZERO\t\t# INITIALIZE WCHPHASE, AND FLPASS0\n\t\tTS\tWCHPHASE\n\t\tTS\tWCHPHOLD\t# ALSO WHCPHOLD\n\t\tCA\tTWO\n\t\tTS\tFLPASS0\n\n\t\tTCF\tP42IGN\nP40IGN\t\tCS\tFLAGWRD5\t# (13)\n\t\tMASK\tNOTHRBIT\n\t\tEXTEND\n\t\tBZF\tP42IGN\n\t\tCA\tZOOMTIME\n\t\tTC\tWAITLIST\n\t\tEBANK=\tDVCNTR\n\t\t2CADR\tP40ZOOM\n\nP63IGN1\t\tTC\t2PHSCHNG\n\t\tOCT\t40033\t\t# 3.3SPOT FOR ZOOM RESTART.\n\t\tOCT\t05014\t\t# TYPE C RESTARTS HERE IMMEDIATELY\n\t\tOCT\t77777\n\n# Page 740\n\t\tTCF\tP42IGN\nP12IGN\t\tCAF\tEBANK6\n\t\tTS\tEBANK\n\t\tEBANK=\tAOSQ\n\n\t\tCA\tIGNAOSQ\t\t# INITIALIZE DAP BIAS ACCELERATION\n\t\tTS\tAOSQ\t\t# ESTIMATES AT P12 IGNITION.\n\t\tCA\tIGNAOSR\n\t\tTS\tAOSR\n\n\t\tCAF\tEBANK7\n\t\tTS\tEBANK\n\t\tEBANK=\tDVCNTR\n\nABRTIGN\t\tCA\tZ\t\t# (13) KILL CLOKTASK\n\t\tTS\tDISPDEX\n\n\t\tEXTEND\t\t\t# CONNECT ASCENT GYIDANCE TO SERVICER.\n\t\tDCA\tATMAGADR\n\t\tDXCH\tAVGEXIT\n\n\t\tCS\tFLAGWRD7\t# ENABLE R10.\n\t\tMASK\tSWANDBIT\n\t\tADS\tFLAGWRD7\n\nP42IGN\t\tCS\tDRIFTBIT\t# ENSURE THAT POWERED-FLIGHT SWITCHING\n\t\tMASK\tDAPBOOLS\t# CURVES ARE USED.\n\t\tTS\tDAPBOOLS\n\t\tCAF\tIMPULBIT\t# EXAMINE IMPULSE SWITCH\n\t\tMASK\tFLAGWRD2\n\t\tCCS\tA\n\t\tTCF\tIMPLBURN\n\nDVMONCON\tTC\tDOWNFLAG\n\t\tADRES\tIGNFLAG\t\t# CONNECT DVMON\n\t\tTC\tDOWNFLAG\n\t\tADRES\tASTNFLAG\n\t\tTC\tDOWNFLAG\n\t\tADRES\tIDLEFLAG\n\n\t\tTC\tPHASCHNG\n\t\tOCT\t40054\n\n\t\tTC\tFIXDELAY\t# TURN ULLAGE OFF HALF A SECOND AFTER\n\t\tDEC\t50\t\t# LIGHT UP.\n\nULLAGOFF\tTC\tNOULLAGE\n\nWAITABIT\tEXTEND\t\t\t# KILL GROUP 4\n\t\tDCA\tNEG0\n# Page 741\n\t\tDXCH\t-PHASE4\n\n\t\tTCF\tTASKOVER\n\nTIGTASK\t\tTC\tPOSTJUMP\t# (12)\n\t\tCADR\tTIGTASK1\n\n#\t********************************\n\n\t\tBANK\t31\n\t\tSETLOC\tP40S3\n\t\tBANK\n\t\tCOUNT*\t$$/P40\n\nTIGTASK1\tCAF\tPRIO16\n\t\tTC\tNOVAC\n\t\tEBANK=\tTRKMKCNT\n\t\t2CADR\tTIGNOW\n\n\t\tTC\tPHASCHNG\n\t\tOCT\t6\t\t# KILL GROUP 6\n\n\t\tTCF\tTASKOVER\n\n#\t********************************\n\nP63ZOOM\t\tEXTEND\n\t\tDCA\tLUNLANAD\n\t\tDXCH\tAVEGEXIT\n\n\t\tTC\tIBNKCALL\n\t\tCADR\tFLATOUT\n\t\tTCF\tP40ZOOMA\n\nP40ZOOM\t\tCAF\tBIT13\n\t\tTS\tTHRUST\n\t\tCAF\tBIT4\n\n\t\tEXTEND\n\t\tWOR\tCHAN14\n\nP40ZOOMA\tTC\tPHASCHNG\n\t\tOCT\t3\n\t\tTCF\tTASKOVER\n\n\t\tEBANK=\tDVCNTR\nLUNLANAD\t2CADR\tLUNLAND\n\n# Page 742\nZOOM\t\t=\tP40ZOOMA\n\t\tBANK\t36\n\t\tSETLOC\tP40S\n\t\tBANK\n\t\tCOUNT*\t$$/P40\n\n#\t********************************\n\nCOMFAIL\t\tTC\tUPFLAG\t\t# (15)\n\t\tADRES\tIDLEFLAG\n\t\tTC\tUPFLAG\t\t# SET FLAG TO SUPRESS CONFLICTING DISPLAY\n\t\tADRES\tFLUNDISP\n\t\tCAF\tFOUR\t\t# RESET DVMON\n\t\tTS\tDVCNTR\n\t\tCCS\tPHASE6\t\t# CLOCKTASK ACTIVE?\n\t\tTCF\t+3\t\t# YES\n\t\tTC\tBANKCALL\t# OTHERWISE, START IT UP\n\t\tCADR\tSTCLOK1\n \t+3\tCS\tVB97DEX\n \t\tTS\tDISPDEX\n\t\tTC\tPHASCHNG\t# TURN OFF GROUP 4.\n\t\tOCT\t00004\n\t\tTCF\tENDOFJOB\n\nCOMFAIL1\tINDEX\tWHICH\n\t\tTCF\t2\n\nCOMFAIL3\tCA\tZ\t\t# (15)\tKILL CLOKTASK USING Z\n\t\tTCF\t+2\n\nCOMFAIL4\tCS\tCNTDNDEX\n\t\tTS\tDISPDEX\n\n\t\tTC\tDOWNFLAG\t# RECONNECT DV MONITOR\n\t\tADRES\tIDLEFLAG\n\t\tTC\tDOWNFLAG\t# PERMIT GUIDANCE LOOP DISPLAYS\n\t\tADRES\tFLUNDISP\n\t\tTCF\tENDOFJOB\n\nCOMFAIL2\tTC\tPHASCHNG\t# KILL ZOOM RESTART PROTECTION\n\t\tOCT\t00003\n\n\t\tINHINT\n\t\tTC\tKILLTASK\t# KILL ZOOM IN CASE IT'S STILL TO COME\n\t\tCADR\tZOOM\n\t\tTC\tIBNKCALL\t# COMMAND ENGINE OFF\n\t\tCADR\tENGINOF4\n\t\tTC\tUPFLAG\t\t# SET THE DRIFT BIT FOR THE DAP.\n\t\tADRES\tDRIFTDFL\n# Page 743\n\t\tTC\tINVFLAG\t\t# USE OTHER RCS SYSTEM\n\t\tADRES\tAORBTFLG\n\t\tTC\tUPFLAG\t\t# TURN ON ULLAGE\n\t\tADRES\tULLAGFLG\n\t\tCAF\tBIT1\n\t\tINHINT\n\t\tTC\tTWIDDLE\n\t\tADRES\tTIG-5\n\t\tTCF\tENDOFJOB\n\n#\t***********************************\n#\tSUBROUTINES OF THE IGNITION ROUTINE\n#\t***********************************\n\nINVFLAG\t\tCA\tQ\n\t\tTC\tDEBIT\n\t\tCOM\n\t\tEXTEND\n\t\tRXOR\tLCHAN\n\t\tTCF\tCOMFLAG\n\n#\t***********************************\n\nNOULLAGE\tCS\tULLAGER\t\t# MUST BE CALLED IN A TASK OR UNDER INHINT\n\t\tMASK\tDAPBOOLS\n\t\tTS\tDAPBOOLS\n\t\tTC\tQ\n\n#\t***********************************\n\nONULLAGE\tCS\tDAPBOOLS\t# TURN ON ULLAGE. MUST BE CALLED IN\n\t\tMASK\tULLAGER\t\t# A TASK OR WHILE INHINTED.\n\t\tADS\tDAPBOOLS\n\t\tTC\tQ\n\n# \t***********************************\n\nSTCLOK1\t\tCA\tZERO\t\t# THIS ROUTINE STARTS THE COUNT-DOWN\nSTCLOK2\t\tTS\tDISPDEX\t\t# (CLOKTASK AND CLOKJOB). SETTING\nSTCLOK3\t\tTC\tMAKECADR\t# SETTING DISPDEX POSITIVE KILLS IT.\n\t\tTS\tTBASE4\t\t# RETURN SAVE (NOT FOR RESTARTS).\n\t\tEXTEND\n\t\tDCA\tTIG\n\t\tDXCH\tMPAC\n\t\tEXTEND\n\t\tDCS\tTIME2\n# Page 744\t\t\n\t\tDAS\tMPAC\t\t# HAVE TIG -- TIME2, UNDOUBTEDLY A + NUMBER\n\t\tTC\tTPAGREE\t\t# POSITIVE, SINCE WE PASSED THE\n\t\tCAF\t1SEC\t\t# 45 SECOND CHECK.\n\t\tTS\tQ\n\t\tDXCH\tMPAC\n\t\tMASK\tLOW5\t\t# RESTRICT MAGNITUDE OF NUMBER IN A\n\t\tEXTEND\n\t\tDV\tQ\n\t\tCA\tL\t\t# GET REMAINDER\n\t\tAD\tTWO\n\t\tINHINT\n\t\tTC\tTWIDDLE\n\t\tADRES\tCLOKTASK\n\t\tTC\t2PHSCHNG\n\t\tOCT\t40036\t\t# 6.3SPOT FOR CLOKTASK\n\t\tOCT\t05024\n\t\tOCT\t13000\n\n\t\tCA\tTBASE4\n\t\tTC\tBANKJUMP\n\nCLOKTASK\tCS\tTIME1\t\t# SET TBASE6 FOR GROUP 6 RESTART\n\t\tTS\tTBASE6\n\n\t\tCCS\tDISPDEX\n\t\tTCF\tKILLCLOK\n\t\tNOOP\n\t\tCAF\tPRIO27\n\t\tTC\tNOVAC\n\t\tEBANK=\tTTOGO\n\t\t2CADR\tCLOKJOB\n\n\t\tTC\tFIXDELAY\t# WAIT A SECOND BEFORE STARTING OVER\n\t\tDEC\t100\n\t\tTCF\tCLOKTASK\n\nKILLCLOK\tEXTEND\t\t\t# KILL RESTART\n\t\tDCA\tNEG0\n\t\tDXCH\t-PHASE6\n\t\tTCF\tTASKOVER\n\nCLOKJOB\t\tEXTEND\n\t\tDCS\tTIG\n\t\tDXCH\tTTOGO\n\t\tEXTEND\n# Page 745\t\t\n\t\tDCA\tTIME2\n\t\tDAS\tTTOGO\n\t\tINHINT\n\t\tCCS\tDISPDEX\t\t# IF DISPDEX HAS BEEN SET POSITIVE BY A\n\t\tTCF\tENDOFJOB\t# TASK OR A HIGHER PRIORITY JOB SINCE THE\n\t\tTCF\tENDOFJOB\t# LAST CLOKTASK, AVOID USING IT AS AN\n\t\tCOM\t\t\t# INDEX.\n\t\tRELINT\t\t\t# ***** DISPDEX MUST NEVER B -0 *****\n\t\tINDEX\tA\n\t\tTCF\tDISPNOT -1\t# (-1 DUE TO EFFECT OF CCS)\n\nVB97DEX\t\t=\tOCT35\t\t# NEGATIVE OF THIS IS PROPER FOR DISPDEX\n\n \t-35\tCS\tZERO\t\t# INDICATE VERB 97 PASTE\n \t\tTS\tNVWORD1\n\t\tCA\tNVWORD \t+2\t# NVWORD+2 CONTAINS V06 & APPROPRIATE NOUN\n\t\tTC\tBANKCALL\n\t\tCADR\tCLOCPLAY\n\t\tTCF\tSTOPCLOK\t# TERMINATE CLOKTASK ON THE WAY TO P00H\n\t\tTCF\tCOMFAIL1\n\t\tTCF\tCOMFAIL2\n\n\t\t\t\t\t# THIS DISPLAY IS CALLED VIA ASTNCLOK\n \t-25\tCAF\tV06N61\t\t# IT IS PRIMARILY USED BY THE CREW IN P63\n \t\tTC\tBANKCALL\t# TO RESET HIS EVENT TIMER TO AGREE WITH\n\t\tCADR\tREFLASH\t\t# TIG.\n\t\tTCF\tSTOPCLOK\n\t\tTCF\tASTNRETN\n\t\tTCF\t-6\n\nCNTDNDEX\t=\tLOW4\t\t# OCT17: NEGATIVE PROPER FOR DISPDEX\n\n \t-17\tINDEX\tWHICH\t\t# THIS DISPLAY COMES UP AT ONE SECOND\n\t\t# Was CAF --- RSB 2009\n \t\tCA\t0\t\t# INTERVALS. IT IS NORMALLY OPERATED\n\t\tTC\tBANKCALL\t# BETWEEN TIG-30 SECONDS AND TIG-5 SECONDS\n\t\tCADR\tREGODSP\t\t# REGODSP DOES ITS OWN TCF ENDOFJOB\n\nVB99DEX\t\t=\tELEVEN\t\t# OCT13: NEGATIVE PROPER FOR DISPDEX\n\nV99RECYC\tEQUALS\n\n \t-13\tCS\tBIT9\t\t# INDICATE VERB 99 PASTE\n \t\tTS\tNVWORD1\n\t\tINDEX\tWHICH\t\t# THIS IS THE \"PLEASE ENABLE ENGINE\"\n\t\t# Was CAF --- RSB 2004\n\t\tCA\t0\t\t# DISPLAY; IT IS INITIATED AT TIG-5 SEC.\n\t\tTC\tBANKCALL\t# THE DISPLAY IS A V99NXX, WHERE XX IS\n\t\tCADR\tCLOCPLAY\t# NOUN THAT HAD PREVIOUSLY BEEN DISPLAYED\n\t\tTCF\tSTOPCLOK\t# TERMINATE GOTOP00H TURNS OFF ULLAGE.\n\t\tTCF\t*PROCEED\n\t\tTCF\t*ENTER\n\n# Page 746\nBLANKDEX\t=\tTWO\t\t# NEGATIVE OF THIS IS PROPER FOR DISPDEX\n\n\t-2\tTC\tBANKCALL\t# BLANK DSKY. THE DSKY IS BLANKED FOR\n \t\tCADR\tCLEANDSP\t# 5 SECONDS AT TIG-35 TO INDICATE THAT\nDISPNOT\t\tTCF\tENDOFJOB\t# AVERAGE G IS STARTING.\n\nSTOPCLOK\tTC\tNULLCLOK\t# STOP CLOKTASK & TURN OFF ULLAGE ON THE\n\t\tTCF\tGOTOP00H\t# WAY TO P00 (GOTOP00H RELINTS)\n\nNULLCLOK\tINHINT\n\t\tEXTEND\n\t\tQXCH\tP40/RET\n\t\tTC\tNOULLAGE\t# TURN OFF ULLAGE ...\n\t\tTC\tKILLTASK\t#\tDON'T LET IT COME ON, EITHER ...\n\t\tCADR\tULLGTASK\n\t\tTC\tPHASCHNG\t#\t\tNOT EVEN IF THERE'S A RESTART.\n\t\tOCT\t1\n\t\tCA\tZ\t\t# KILL CLOKTASK\n\t\tTS\tDISPDEX\n\t\tTC\tP40/RET\n\nASTNRETN\tTC\tPHASCHNG\n\t\tOCT\t04024\n\t\tCAF\tZERO\t\t# STOP DISPLAYING BUT KEEP RUNNING\n\t\tTS\tDISPDEX\n\t\tCAF\tPRIO13\n\t\tTC\tFINDVAC\n\t\tEBANK=\tSTARIND\n\t\t2CADR\tASTNRET\n\n\t\tTCF\tENDOFJOB\n\n*PROCEED\tTC\tUPFLAG\n\t\tADRES\tASTNFLAG\n\n\t\tTCF\tIGNITE\n\n*ENTER\t\tINHINT\n\t\tINDEX\tWHICH\n\t\tTCF\t3\n\nGOPOST\t\tCAF\tPRIO12\t\t# (3) MUST BE LOWER PRIORITY THAN CLOKJOB\n\t\tTC\tFINDVAC\n\t\tEBANK=\tTTOGO\n\t\t2CADR\tPOSTBURN\n\n# Page 747\n\t\tINHINT\t\t\t# SET UP THE DAP FOR COASTING FLIGHT.\n\t\tTC\tIBNKCALL\n\t\tCADR\tALLCOAST\n\t\tTC\tNULLCLOK\n\t\tTC\tPHASCHNG\t# 4.13 RESTART FOR POSTBURN\n\t\tOCT\t00134\n\n\t\tTCF\tENDOFJOB\n\nGOCUTOFF\tCAF\tPRIO17\t\t# (3)\n\t\tTC\tFINDVAC\n\t\tEBANK=\tTGO\n\t\t2CADR\tCUTOFF\n\n\t\tTC\tDOWNFLAG\n\t\tADRES\tFLUNDISP\n\n\t\tINHINT\t\t\t# SET UP THE DAP FOR COASTING FLIGHT.\n\t\tTC\tIBNKCALL\n\t\tCADR\tALLCOAST\n\t\tTC\tNULLCLOK\n\t\tTC\tPHASCHNG\n\t\tOCT\t07024\n\t\tOCT\t17000\n\t\tEBANK=\tTGO\n\t\t2CADR\tCUTOFF\n\n\t\tTCF\tENDOFJOB\n\nIGNITE\t\tCS\tFLAGWRD7\t# (2)\n\t\tMASK\tIGNFLBIT\n\t\tCCS\tA\n\t\tTCF\tIGNITE1\n\t\tCAF\tBIT1\n\t\tINHINT\n\t\tTC\tTWIDDLE\n\t\tADRES\tIGNITION\n\n\t\tCAF\tOCT23\t\t# IMMEDIATE RESTART AT IGNITION\n\t\tTS\tL\n\t\tCOM\n\t\tDXCH\t-PHASE4\n\nIGNITE1\t\tCS\tCNTDNDEX\t# RESTORE OLD DISPLAY.\n\t\tTS\tDISPDEX\n\n\t\tTCF\tENDOFJOB\n\n# Page 748\n#\t********************************\n\nP40ALM\t\tTC\tALARM\t\t# PROGRAM SELECTION NOT CONSISTENT WITH\n\t\tOCT\t1706\t\t# VEHICLE CONFIGURATION\n\nREP40ALM\tCAF\tV05N09\t\t# (14)\n\t\tTC\tBANKCALL\n\t\tCADR\tGOFLASH\n\n\t\tTCF\tGOTOP00H\t# V34E \t\tTERMINATE\n\t\tTCF\t+2\t\t# PROCEED \tCHECK FOR P42\n\t\tTCF\tREP40ALM\t# V32E\t\tREDISPLAY ALARM\n\n\t\tINDEX\tWHICH\t\t# FOR P42, ALLOW CREW TO PRECEED EVEN\n\t\tTCF\t14\t\t# THOUGH VEHICLE IS UNSTAGED.\n\n#\t********************************\n\n\t\tBANK\t31\n\t\tSETLOC\tP40S2\n\t\tBANK\n\n\t\tCOUNT*\t$$/P40\n\nP40AUTO\t\tTC\tMAKECADR\t# HELLO THERE.\n\t\tTS\tTEMPR60\t\t# FOR GENERALIZED RETURN TO OTHER BANKS.\nP40A/P\t\tTC\tBANKCALL\t# SUBROUTINE TO CHECK PGNCS CONTROL\n\t\tCADR\tG+N,AUTO\t# AND AUTO STABILIZATION MODES\n\t\tCCS\tA\t\t# +0 INDICATES IN PGNCS, IN AUTO\n\t\tTCF\tTURNITON\t# + INDICATES NOT IN PGNCS AND/OR AUTO\n\t\tCAF\tAPSFLBIT\t# ARE WE ON THE DESCENT STAGE?\n\t\tMASK\tFLGWRD10\n\t\tCCS\tA\n\t\tTCF\tGOBACK\t\t# RETURN\n\t\tCAF\tBIT5\t\t# YES, CHECK FOR AUTO-THROTTLE MODE\n\t\tEXTEND\n\t\tRAND\tCHAN30\n\t\tEXTEND\n\t\tBZF\tGOBACK\t\t# IN AUTO-THROTTLE MODE -- RETURN\nTURNITON\tCAF\tP40A/PMD\t# DISPLAYS V50N25 R1=203 PLEASE PERFORM\n\t\tTC\tBANKCALL\t# CHECKLIST 203 TURN ON PGNCS ETC.\n\t\tCADR\tGOPERF1\n\t\tTCF\tGOTOP00H\t# V34E TERMINATE\n\t\tTCF\tP40A/P\t\t# RECYCLE\nGOBACK\t\tCA\tTEMPR60\n\t\tTC\tBANKJUMP\t# GOODBYE. COME AGAIN SOON.\n\nP40A/PMD\tOCT\t00203\n\n# Page 749\n\t\tBANK\t36\n\t\tSETLOC\tP40S\n\t\tBANK\n\n\t\tCOUNT*\t$$/P40\n\n#\t**********************************\n#\tCONSTANTS FOR THE IGNITION ROUTINE\n#\t**********************************\n\nSERVCADR\t=\tP63TABLE +7\n\nP40ADRES\tADRES\tP40TABLE\n\nP41ADRES\tADRES\tP41TABLE -5\n\nP42ADRES\tADRES\tP42TABLE\n\n\t\tEBANK=\tDVCNTR\nDSP2CADR\t2CADR\tP63DISPS -2\n\n\t\tEBANK=\tDVCNTR\nATMAGADR\t2CADR\tATMAG\n\n?\t\t=\tGOTOP00H\n\nD29.9SEC\t2DEC\t2990\n\nS24.9SEC\tDEC\t2490\n\n4.9SEC\t\tDEC\t490\n\nOCT20\t\t=\tBIT5\n\nV06N61\t\tVN\t0661\n\n# Page 750\n# KILLTASK\n# MOD NO: NEW PROGRAM\n# MOD BY: COVELLI\n#\n# FUNCTIONAL DESCRIPTION:\n#\n#\tKILLTASK IS USED TO REMOVE A TASK FROM THE WAITLIST BY SUBSTITUTING A NULL TASK CALLED `NULLTASK' (OF COURSE),\n#\tWHICH MERELY DOES A TC TASKOVER. IF THE SAME TASK IS SCHEDULED MORE THAN ONCE, ONLY THE ONE WHICH WILL OCCUR\n#\tFIRST IS REMOVED. IF THE TASK IS NOT SCHEDULED, KILLTASK TAKES NO ACTION AND RETURNS WITH NO ALARM. KILLTASK\n#\tLEAVES INTERRUPTS INHIBITED SO CALLER MUST RELINT\n#\n# CALLING SEQUENCE\n#\tL\tTC\tKILLTASK\t# IN FIXED-FIXED\n#\tL+1\tCADR\t????????\t# CADR (NOT 2CADR) OF TASK TO BE REMOVED.\n#\tL+2\t(RELINT)\t\t# RETURN\n#\n# EXIT MODE: AT L+2 OF CALLING SEQUENCE.\n#\n# ERASABLE INITIALIZATION: NONE.\n#\n# OUTPUT: 2CADR OF NULLTASK IN LST2\n#\n# DEBRIS: ITEMP1 - ITEMP4, A, L, Q.\n\n\t\tEBANK=\tLST2\n\t\tBLOCK\t3\t\t# KILLTASK MUST BE IN FIXED-FIXED.\n\t\tSETLOC\tFFTAG6\n\t\tBANK\n\t\tCOUNT*\t$$/KILL\nKILLTASK\tCA\tKILLBB\n\t\tINHINT\n\t\tLXCH\tA\n\t\tINDEX\tQ\n\t\tCA\t0\t\t# GET CADR.\n\t\tLXCH\tBBANK\n\t\tTCF\tKILLTSK2\t# CONTINUE IN SWITCHED FIXED.\n\n\t\tEBANK=\tLST2\nKILLBB\t\tBBCON\tKILLTSK2\n\n\t\tBANK\t27\n\n\t\tSETLOC\tP40S1\n\t\tBANK\n\t\tCOUNT*\t$$/KILL\n\nKILLTSK2\tLXCH\tITEMP2\t\t# SAVE CALLER'S BBANK\n# Page 751\n\t\tINCR\tQ\n\t\tEXTEND\n\t\tQXCH\tITEMP1\t\t# RETURN 2ADR IN ITEMP1,ITEMP2\n\n\t\tTS\tITEMP3\t\t# CADR IS IN A\n\t\tMASK\tLOW10\n\t\tAD\tBIT11\n\t\tTS\tITEMP4\t\t# GENADR OF TASK\n\n\t\tCS\tLOW10\n\t\tMASK\tITEMP3\n\t\tTS\tITEMP3\t\t# FBANK OF TASK\n\n\t\tZL\nADRSCAN\t\tINDEX\tL\n\t\tCS\tLST2\n\t\tAD\tITEMP4\t\t# COMPARE GENADRS\n\t\tEXTEND\n\t\tBZF\tTSTFBANK\t# IF THEY MATCH, COMPARE FBANKS\nLETITLIV\tCS\tLSTLIM\n\t\tAD\tL\n\t\tEXTEND\t\t\t# ARE WE DONE?\n\t\tBZF\tDEAD\t\t# YES -- DONE, SO RETURN\n\t\tINCR\tL\n\t\tINCR\tL\n\t\tTCF\tADRSCAN\t\t# CONTINUE LOOP.\n\nDEAD\t\tDXCH\tITEMP1\n\t\tDTCB\n\nTSTFBANK\tCS\tLOW10\n\t\tINDEX\tL\n\t\tMASK\tLST2 \t+1\t# COMPARE FBANKS ONLY.\n\t\tEXTEND\n\t\tSU\tITEMP3\n\t\tEXTEND\n\t\tBZF\tKILLDEAD\t# MATCH -- KILL IT.\n\t\tTCF\tLETITLIV\t# NO MATCH -- CONTINUE.\n\nKILLDEAD\tCA\tTCTSKOVR\n\t\tINDEX\tL\n\t\tTS\tLST2\t\t# REMOVE TASK BY INSERTING TASKOVER\n\t\tTCF\tDEAD\n\nLSTLIM\t\tEQUALS\tBIT5\t\t# DEC 16\n" }, { "path": "src/test/resources/samples/langs/AppleScript/Convert To PDF.applescript", "content": "(*\nCopyright 2003 Apple Computer, Inc.\n\nYou may incorporate this Apple sample code into your program(s) without\nrestriction. This Apple sample code has been provided \"AS IS\" and the\nresponsibility for its operation is yours. You are not permitted to\nredistribute this Apple sample code as \"Apple sample code\" after having\nmade changes. If you're going to redistribute the code, we require\nthat you make it clear that the code was descended from Apple sample\ncode, but that you've made changes.\n*)\n\nproperty type_list : {\"JPEG\", \"GIFf\", \"PICT\", \"TIFF\", \"PDF\", \"TEXT\"}\nproperty extension_list : {\"jpg\", \"gif\", \"pct\", \"tif\", \"pdf\", \"rtf\"}\n--html is not currently handled\n\non run {}\n\ttell application \"Finder\" to set FinderSelection to the selection as alias list\n\t\n\tset FS to FinderSelection\n\t--Ideally, this list could be passed to the open handler\n\t\n\tset SelectionCount to number of FS -- count\t\n\tif SelectionCount is 0 then\n\t\tset FS to userPicksFolder()\n\telse if the SelectionCount is 1 then\n\t\tset MyPath to path to me\n\t\tif MyPath is item 1 of FS then\n\t\t\t--If I'm a droplet then I was double-clicked\n\t\t\tset FS to userPicksFolder()\n\t\tend if\n\telse\n\t\t--I'm not a double-clicked droplet\n\tend if\n\topen FS\nend run\n\non userPicksFolder()\n\tset these_items to {}\n\tset these_items to (choose file with prompt \"Select a file to convert to PDF:\" of type {\"JPEG\", \"GIFf\", \"PICT\", \"TIFF\", \"TEXT\", \"RTF\"}) as list\nend userPicksFolder\n\non open these_items\n\tset thesefiles to {}\n\tset the item_info to {}\n\trepeat with i from 1 to the count of these_items\n\t\tset this_item to (item i of these_items)\n\t\tset the item_info to info for this_item\n\t\t\n\t\tif folder of the item_info is true then --if the item is a folder\n\t\t\tprocessFolder(this_item)\n\t\telse if ((folder of the item_info is false) and (alias of the item_info is false)) and (the file type of the item_info is in the type_list) or ((the name extension of the item_info) is in the extension_list) then\n\t\t\t\n\t\t\tset theFilePath to (item i of these_items as string)\n\t\t\tset thePOSIXFilePath to POSIX path of theFilePath as string\n\t\t\tprocessFile(thePOSIXFilePath)\n\t\tend if\n\tend repeat\nend open\n\n--process folders \non processFolder(theFolder)\n\tset these_items to list folder theFolder without invisibles\n\trepeat with i from 1 to the count of these_items\n\t\tset this_item to alias ((theFolder as text) & (item i of these_items))\n\t\tset the item_info to info for this_item\n\t\tif folder of the item_info is true then\n\t\t\tprocessFolder(this_item)\n\t\telse if (alias of the item_info is false) and ((the file type of the item_info is in the type_list) or the name extension of the item_info is in the extension_list) then\n\t\t\tset theFilePath to (this_item as string)\n\t\t\tset thePOSIXFilePath to POSIX path of theFilePath as string\n\t\t\tprocessFile(thePOSIXFilePath)\n\t\tend if\n\tend repeat\nend processFolder\n\non processFile(thePOSIXFileName)\n\ttry\n\t\tset terminalCommand to \"\"\n\t\tset convertCommand to \"/System/Library/Printers/Libraries/./convert \"\n\t\tset newFileName to thePOSIXFileName & \".pdf\"\n\t\tset terminalCommand to convertCommand & \"-f \" & \"\\\"\" & thePOSIXFileName & \"\\\"\" & \" -o \" & \"\\\"\" & newFileName & \"\\\"\" & \" -j \\\"application/pdf\\\"\"\n\t\t\n\t\tdo shell script terminalCommand\n\tend try\nend processFile\n\n" }, { "path": "src/test/resources/samples/langs/AppleScript/Convert To PostScript.applescript", "content": "(*\n\nCopyright 2003 Apple Computer, Inc.\n\nYou may incorporate this Apple sample code into your program(s) without\nrestriction. This Apple sample code has been provided \"AS IS\" and the\nresponsibility for its operation is yours. You are not permitted to\nredistribute this Apple sample code as \"Apple sample code\" after having\nmade changes. If you're going to redistribute the code, we require\nthat you make it clear that the code was descended from Apple sample\ncode, but that you've made changes.\n*)\n\nproperty type_list : {\"JPEG\", \"GIFf\", \"PICT\", \"TIFF\", \"PDF\", \"TEXT\"}\nproperty extension_list : {\"jpg\", \"gif\", \"pct\", \"tif\", \"pdf\", \"rtf\"}\n--html is not currently handled\n\non run {}\n\ttell application \"Finder\" to set FinderSelection to the selection as alias list\n\t\n\tset FS to FinderSelection\n\t--Ideally, this list could be passed to the open handler\n\t\n\tset SelectionCount to number of FS -- count\t\n\tif SelectionCount is 0 then\n\t\tset FS to userPicksFolder()\n\telse if the SelectionCount is 1 then\n\t\tset MyPath to path to me\n\t\tif MyPath is item 1 of FS then\n\t\t\t--If I'm a droplet then I was double-clicked\n\t\t\tset FS to userPicksFolder()\n\t\tend if\n\telse\n\t\t--I'm not a double-clicked droplet\n\tend if\n\topen FS\nend run\n\non userPicksFolder()\n\tset these_items to {}\n\tset these_items to (choose file with prompt \"Select a file to convert to PostScript:\" of type {\"JPEG\", \"GIFf\", \"PICT\", \"TIFF\", \"TEXT\", \"RTF\"}) as list\nend userPicksFolder\n\n\non open these_items\n\tset thesefiles to {}\n\tset the item_info to {}\n\trepeat with i from 1 to the count of these_items\n\t\tset this_item to (item i of these_items)\n\t\tset the item_info to info for this_item\n\t\t\n\t\tif folder of the item_info is true then --if the item is a folder\n\t\t\tprocessFolder(this_item)\n\t\telse if ((folder of the item_info is false) and (alias of the item_info is false)) and (the file type of the item_info is in the type_list) or ((the name extension of the item_info) is in the extension_list) then\n\t\t\t\n\t\t\tset theFilePath to (item i of these_items as string)\n\t\t\tset thePOSIXFilePath to POSIX path of theFilePath as string\n\t\t\tprocessFile(thePOSIXFilePath)\n\t\tend if\n\tend repeat\nend open\n\n--process folders \non processFolder(theFolder)\n\tset these_items to list folder theFolder without invisibles\n\trepeat with i from 1 to the count of these_items\n\t\tset this_item to alias ((theFolder as text) & (item i of these_items))\n\t\tset the item_info to info for this_item\n\t\tif folder of the item_info is true then\n\t\t\tprocessFolder(this_item)\n\t\telse if (alias of the item_info is false) and ((the file type of the item_info is in the type_list) or the name extension of the item_info is in the extension_list) then\n\t\t\tset theFilePath to (this_item as string)\n\t\t\tset thePOSIXFilePath to POSIX path of theFilePath as string\n\t\t\tprocessFile(thePOSIXFilePath)\n\t\tend if\n\tend repeat\nend processFolder\n\n--need to pass the URL to Terminal\non processFile(thePOSIXFileName)\n\ttry\n\t\tset terminalCommand to \"\"\n\t\tset convertCommand to \"/System/Library/Printers/Libraries/./convert \"\n\t\tset newFileName to thePOSIXFileName & \".ps\"\n\t\tset terminalCommand to convertCommand & \"-f \" & \"\\\"\" & thePOSIXFileName & \"\\\"\" & \" -o \" & \"\\\"\" & newFileName & \"\\\"\" & \" -j \\\"application/postscript\\\"\"\n\t\t\n\t\tdo shell script terminalCommand\n\tend try\nend processFile\n\n\n" }, { "path": "src/test/resources/samples/langs/AppleScript/Count Messages in All Mailboxes.applescript", "content": "(*\nCount Messages in All Mailboxes\n\nCopyright 2002-2012 Apple Inc. All rights reserved.\n\nYou may incorporate this Apple sample code into your program(s) without\nrestriction. This Apple sample code has been provided \"AS IS\" and the\nresponsibility for its operation is yours. You are not permitted to\nredistribute this Apple sample code as \"Apple sample code\" after having\nmade changes. If you're going to redistribute the code, we require\nthat you make it clear that the code was descended from Apple sample\ncode, but that you've made changes.\n*)\n\n(*\nThis script goes through each mailbox, gets the total message count and\nthe unread count, then displays the final output in a new email message.\n*)\n\ntell application \"Mail\"\n\tset localMailboxes to every mailbox\n\tif (count of localMailboxes) is greater than 0 then\n\t\tset messageCountDisplay to \"Local mailboxes (On My Mac)\" & return & my getMessageCountsForMailboxes(localMailboxes)\n\telse\n\t\tset messageCountDisplay to \"\"\n\tend if\n\t\n\tset everyAccount to every account\n\trepeat with eachAccount in everyAccount\n\t\tset accountMailboxes to every mailbox of eachAccount\n\t\tif (count of accountMailboxes) is greater than 0 then\n\t\t\tset messageCountDisplay to messageCountDisplay & return & \"Mailboxes for Account: \" & name of eachAccount & return & my getMessageCountsForMailboxes(accountMailboxes)\n\t\tend if\n\tend repeat\n\t\n\tset outputMessage to make new outgoing message with properties {content:messageCountDisplay, subject:\"Message counts for all my mailboxes\", visible:true}\n\ttell outputMessage\n\t\tset font to \"Courier\"\n\t\tset size to 12\n\tend tell\nend tell\n\non getMessageCountsForMailboxes(theMailboxes)\n\t-- (list of mailboxes)\n\t-- returns string\n\t\n\tset displayString to \"\"\n\t\n\ttell application \"Mail\"\n\t\trepeat with eachMailbox in theMailboxes\n\t\t\tset mailboxName to name of eachMailbox\n\t\t\tset messageCount to (count of (messages of eachMailbox)) as string\n\t\t\tset unreadCount to unread count of eachMailbox as string\n\t\t\t\n\t\t\tset displayString to displayString & \" \" & my padString(mailboxName, 40) & \" \" & messageCount & \" (\" & unreadCount & \" unread)\" & return\n\t\tend repeat\n\tend tell\n\t\n\treturn displayString\nend getMessageCountsForMailboxes\n\non padString(theString, fieldLength)\n\t-- (string, integer)\n\t-- returns string\n\t\n\tset stringLength to length of theString\n\t\n\tif stringLength is greater than fieldLength then\n\t\tset paddedString to (text from character 1 to character (fieldLength - 3) of theString) & \"...\"\n\telse -- stringLength is less than or equal to fieldLength\n\t\tset paddedString to theString\n\t\t\n\t\tset paddingLength to fieldLength - stringLength\n\t\trepeat paddingLength times\n\t\t\tset paddedString to paddedString & space\n\t\tend repeat\n\tend if\n\t\n\treturn paddedString\nend padString" }, { "path": "src/test/resources/samples/langs/AppleScript/Crazy Message Text.applescript", "content": "(*\nCrazy Message Text\n\nCopyright 2002-2012 Apple Inc. All rights reserved.\n\nYou may incorporate this Apple sample code into your program(s) without\nrestriction. This Apple sample code has been provided \"AS IS\" and the\nresponsibility for its operation is yours. You are not permitted to\nredistribute this Apple sample code as \"Apple sample code\" after having\nmade changes. If you're going to redistribute the code, we require\nthat you make it clear that the code was descended from Apple sample\ncode, but that you've made changes.\n*)\n\n(*\nThis script takes a string from the user and then makes a new message\nwhere each letter has a different font, size, and color.\n*)\n\nproperty lowFontSize : 36\nproperty highFontSize : 72\nproperty messageText : \"Happy Birthday!\"\n\nrepeat\n\tset userInput to display dialog \"Enter some message text:\" & return & return & \"Minimum Character Size: \" & (lowFontSize as string) & return & \"Maximum Character Size: \" & (highFontSize as string) default answer messageText buttons {\"Cancel\", \"Set Prefs\", \"Continue\"} default button 3\n\t\n\tif the button returned of userInput is \"Set Prefs\" then\n\t\tset minimumFontSize to 9\n\t\t\n\t\tdisplay dialog \"Enter the minimum font size to use:\" & return & return & \"(Must be at least \" & (minimumFontSize as string) & \")\" default answer lowFontSize buttons {\"OK\"}\n\t\tset newFontSize to text returned of the result as integer\n\t\tif newFontSize is greater than or equal to minimumFontSize then\n\t\t\tset lowFontSize to newFontSize\n\t\telse\n\t\t\tset lowFontSize to minimumFontSize\n\t\tend if\n\t\t\n\t\tdisplay dialog \"Enter the maximum font size to use:\" & return & return & \"(Must be greater than \" & (lowFontSize as string) & \")\" default answer highFontSize buttons {\"OK\"}\n\t\tset newFontSize to text returned of the result as integer\n\t\tif newFontSize is greater than lowFontSize then\n\t\t\tset highFontSize to newFontSize\n\t\telse\n\t\t\tset highFontSize to lowFontSize\n\t\tend if\n\t\t\n\telse -- button returned of userInput is \"Continue\"\n\t\tset theText to text returned of userInput\n\t\tif theText is not \"\" then\n\t\t\tset messageText to theText\n\t\tend if\n\t\texit repeat\n\tend if\nend repeat\n\nset fontList to {\"American Typewriter\", \"American Typewriter Light\", \"American Typewriter Bold\", \"American Typewriter Condensed\", \"American Typewriter Condensed Light\", \"American Typewriter Condensed Bold\", \"Arial\", \"Arial Italic\", \"Arial Bold\", \"Arial Bold Italic\", \"Arial Black\", \"Baskerville\", \"Baskerville Italic\", \"Baskerville SemiBold\", \"Baskerville Bold\", \"Baskerville SemiBold Italic\", \"Baskerville Bold Italic\", \"Big Caslon Medium\", \"Comic Sans MS\", \"Comic Sans MS Bold\", \"Copperplate\", \"Copperplate Light\", \"Copperplate Bold\", \"Didot\", \"Didot Italic\", \"Didot Bold\", \"Futura Medium\", \"Futura Medium Italic\", \"Futura Condensed Medium\", \"Futura Condensed ExtraBold\", \"Geneva\", \"Gill Sans\", \"Gill Sans Italic\", \"Gill Sans Light\", \"Gill Sans Light Italic\", \"Gill Sans Bold\", \"Gill Sans Bold Italic\", \"Herculanum\", \"Lucida Grande\", \"Lucida Grande Bold\", \"Marker Felt Thin\", \"Marker Felt Wide\", \"Optima Regular\", \"Optima Italic\", \"Optima Bold\", \"Optima Bold Italic\", \"Optima ExtraBlack\", \"Papyrus\", \"Verdana\", \"Verdana Italic\", \"Verdana Bold\", \"Verdana Bold Italic\", \"Zapfino\"}\n\ntell application \"Mail\"\n\tactivate\n\tset crazyTextMessage to make new outgoing message with properties {content:messageText, visible:true}\n\t\n\ttell crazyTextMessage\n\t\trepeat with eachCharacter in characters\n\t\t\tset font of eachCharacter to (some item of fontList)\n\t\t\tset size of eachCharacter to (random number from lowFontSize to highFontSize)\n\t\t\tset color of eachCharacter to {random number from 0 to 65535, random number from 0 to 65535, random number from 0 to 65535}\n\t\tend repeat\n\tend tell\nend tell" }, { "path": "src/test/resources/samples/langs/AppleScript/Get User Name.applescript", "content": "(*\nGet User Name\n\nThis script uses UI element scripting to get the name for the\ncurrent user.\n\nIf \"Enable access for assistive devices\" is not checked,\nthis script will open the Universal Access System Preference and ask\nthe user to check the checkbox.\n\nCopyright 2007 Apple Inc.\n\nYou may incorporate this Apple sample code into your program(s) without\nrestriction. This Apple sample code has been provided \"AS IS\" and the\nresponsibility for its operation is yours. You are not permitted to\nredistribute this Apple sample code as \"Apple sample code\" after having\nmade changes. If you're going to redistribute the code, we require\nthat you make it clear that the code was descended from Apple sample\ncode, but that you've made changes.\n*)\n\ntell application \"System Preferences\"\n\tactivate\n\tset current pane to pane \"com.apple.preferences.users\"\nend tell\n\ntell application \"System Events\"\n\tif UI elements enabled then\n\t\ttell tab group 1 of window \"Accounts\" of process \"System Preferences\"\n\t\t\tclick radio button 1\n\t\t\tdelay 2\n\t\t\tget value of text field 1\n\t\tend tell\n\telse\n\t\ttell application \"System Preferences\"\n\t\t\tactivate\n\t\t\tset current pane to pane \"com.apple.preference.universalaccess\"\n\t\t\tdisplay dialog \"UI element scripting is not enabled. Check \\\"Enable access for assistive devices\\\"\"\n\t\tend tell\n\tend if\nend tell" }, { "path": "src/test/resources/samples/langs/AppleScript/Time Of Day.applescript", "content": "(* \n Speaks the date and time of day\n \n Copyright 2008 Apple Inc. All rights reserved.\n \n You may incorporate this Apple sample code into your program(s) without\n restriction. This Apple sample code has been provided \"AS IS\" and the\n responsibility for its operation is yours. You are not permitted to\n redistribute this Apple sample code as \"Apple sample code\" after having\n made changes. If you're going to redistribute the code, we require\n that you make it clear that the code was descended from Apple sample\n code, but that you've made changes.\n *)\n\non isVoiceOverRunning()\n\tset isRunning to false\n\ttell application \"System Events\"\n\t\tset isRunning to (name of processes) contains \"VoiceOver\"\n\tend tell\n\treturn isRunning\nend isVoiceOverRunning\n\non isVoiceOverRunningWithAppleScript()\n\tif isVoiceOverRunning() then\n\t\tset isRunningWithAppleScript to true\n\t\t\n\t\t-- is AppleScript enabled on VoiceOver --\n\t\ttell application \"VoiceOver\"\n\t\t\ttry\n\t\t\t\tset x to bounds of vo cursor\n\t\t\ton error\n\t\t\t\tset isRunningWithAppleScript to false\n\t\t\tend try\n\t\tend tell\n\t\treturn isRunningWithAppleScript\n\tend if\n\treturn false\nend isVoiceOverRunningWithAppleScript\n\nset currentDate to current date\nset amPM to \"AM\"\nset currentHour to (currentDate's hours)\nset currentMinutes to currentDate's minutes\n\nif (currentHour > 12 and currentHour < 24) then\n\tset amPM to \"PM\"\nelse\n\tset amPM to \"AM\"\nend if\n\n-- make minutes below 10 sound nice\nif currentMinutes < 10 then\n\tset currentMinutes to (\"0\" & currentMinutes) as text\nend if\n\n-- ensure 0:nn gets set to 12:nn AM\nif currentHour is equal to 0 then\n\tset currentHour to 12\nend if\n\n-- readjust for 12 hour time\nif (currentHour > 12) then\n\tset currentHour to (currentHour - 12)\nend if\n\nset currentTime to ((currentDate's month) as text) & \" \" & ((currentDate's day) as text) & \", \" & (currentHour as text) & \":\" & ((currentMinutes) as text) & \" \" & amPM as text\n\nif isVoiceOverRunningWithAppleScript() then\n\ttell application \"VoiceOver\"\n\t\toutput currentTime\n\tend tell\nelse\n\tsay currentTime\n\tdelay 2\nend if\n" }, { "path": "src/test/resources/samples/langs/AppleScript/center.applescript", "content": "set windowWidth to 800\nset windowHeight to 600\ndelay 0.1\n\nset AppleScript's text item delimiters to \"x\"\n\nset res to text returned of (display dialog \"Enter the width x height:\" default answer ((windowWidth & windowHeight) as text))\n\nif res is \"\" then\n display dialog \"You need to enter a correct response\"\n return\nend if\nset {windowWidth, windowHeight} to text items of res\n\nset AppleScript's text item delimiters to \"\"\n\ntell application \"Safari\"\n set screen_width to (do JavaScript \"screen.availWidth\" in document 1)\n set screen_height to (do JavaScript \"screen.availHeight\" in document 1)\nend tell\n\ntell application \"System Events\"\n set myFrontMost to name of first item of (processes whose frontmost is true)\nend tell\n\ntell application \"Finder\"\n set {desktopTop, desktopLeft, desktopRight, desktopBottom} to bounds of desktop\nend tell\n\ntry\n tell application \"System Events\"\n tell process myFrontMost\n set {{w, h}} to size of drawer of window 1\n end tell\n end tell\non error\n set {w, h} to {0, 0}\nend try\n\ntell application \"System Events\"\n tell process myFrontMost\n try\n set {{w, h}} to size of drawer of window 1\n on error\n set {w, h} to {0, 0}\n end try\n set position of window 1 to {((screen_width - windowWidth) / 2), ((screen_height - windowHeight) / 2.0) - desktopTop}\n set size of window 1 to {windowWidth -w, windowHeight}\n end tell\nend tell" }, { "path": "src/test/resources/samples/langs/AsciiDoc/encoding.asciidoc", "content": "Gregory Romé has written an AsciiDoc plugin for the Redmine project management application.\n\nhttps://github.com/foo-users/foo\nへと `vicmd` キーマップを足してみている試み、\nアニメーションgifです。\n\ntag::romé[]\nGregory Romé has written an AsciiDoc plugin for the Redmine project management application.\nend::romé[]\n\n== Überschrift\n\n* Codierungen sind verrückt auf älteren Versionen von Ruby" }, { "path": "src/test/resources/samples/langs/AsciiDoc/list.asc", "content": "AsciiDoc Home Page\n==================\n\nTitle\n-----\n\nExample Articles\n~~~~~~~~~~~~~~~~\n- Item 1\n\n- Item 2\n\n- Item 3\n" }, { "path": "src/test/resources/samples/langs/AsciiDoc/sample.adoc", "content": "Document Title\n==============\nDoc Writer \n:idprefix: id_\n\nPreamble paragraph.\n\nNOTE: This is test, only a test.\n\n== Section A\n\n*Section A* paragraph.\n\n=== Section A Subsection\n\n*Section A* 'subsection' paragraph.\n\n== Section B\n\n*Section B* paragraph.\n\n.Section B list\n* Item 1\n* Item 2\n* Item 3\n" }, { "path": "src/test/resources/samples/langs/AspectJ/CacheAspect.aj", "content": "package com.blogspot.miguelinlas3.aspectj.cache;\n\nimport java.util.Map;\nimport java.util.WeakHashMap;\n\nimport org.aspectj.lang.JoinPoint;\n\nimport com.blogspot.miguelinlas3.aspectj.cache.marker.Cachable;\n\n/**\n * This simple aspect simulates the behaviour of a very simple cache\n * \n * @author migue\n *\n */\npublic aspect CacheAspect {\n\n\tpublic pointcut cache(Cachable cachable): execution(@Cachable * * (..)) && @annotation(cachable);\n\t\n\tObject around(Cachable cachable): cache(cachable){\n\t\n\t\tString evaluatedKey = this.evaluateKey(cachable.scriptKey(), thisJoinPoint);\n\t\t\n\t\tif(cache.containsKey(evaluatedKey)){\n\t\t\tSystem.out.println(\"Cache hit for key \" + evaluatedKey);\n\t\t\treturn this.cache.get(evaluatedKey);\n\t\t}\n\t\t\n\t\tSystem.out.println(\"Cache miss for key \" + evaluatedKey);\n\t\tObject value = proceed(cachable);\n\t\tcache.put(evaluatedKey, value);\n\t\treturn value;\n\t}\n\t\n\tprotected String evaluateKey(String key, JoinPoint joinPoint) {\n\t\t// TODO add some smart staff to allow simple scripting in @Cachable annotation\n\t\treturn key;\n\t}\n\t\n\tprotected Map cache = new WeakHashMap();\n}\n" }, { "path": "src/test/resources/samples/langs/AspectJ/OptimizeRecursionCache.aj", "content": "package aspects.caching;\r\n\r\nimport java.util.Map;\r\n\r\n/**\r\n * Cache aspect for optimize recursive functions.\r\n * \r\n * @author Migueli\r\n * @date 05/11/2013\r\n * @version 1.0\r\n *\r\n */\r\npublic abstract aspect OptimizeRecursionCache {\r\n\t\t\r\n\t@SuppressWarnings(\"rawtypes\")\r\n\tprivate Map _cache;\r\n\t\r\n\tpublic OptimizeRecursionCache() {\r\n\t\t_cache = getCache();\r\n\t}\r\n\t\r\n\t@SuppressWarnings(\"rawtypes\")\r\n\tabstract public Map getCache();\r\n\t\r\n\tabstract public pointcut operation(Object o);\r\n\r\n\tpointcut topLevelOperation(Object o): operation(o) && !cflowbelow(operation(Object));\r\n\r\n\tbefore(Object o) : topLevelOperation(o) {\r\n\t\tSystem.out.println(\"Seeking value for \" + o);\r\n\t}\r\n\r\n\tObject around(Object o) : operation(o) {\r\n\t\tObject cachedValue = _cache.get(o);\r\n\t\tif (cachedValue != null) {\r\n\t\t\tSystem.out.println(\"Found cached value for \" + o + \": \" + cachedValue);\r\n\t\t\treturn cachedValue;\r\n\t\t}\r\n\t\treturn proceed(o);\r\n\t}\r\n\r\n\t@SuppressWarnings(\"unchecked\")\r\n\tafter(Object o) returning(Object result) : topLevelOperation(o) {\r\n\t\t_cache.put(o, result);\r\n\t}\r\n\t\r\n\tafter(Object o) returning(Object result) : topLevelOperation(o) {\r\n\t\tSystem.out.println(\"cache size: \" + _cache.size());\r\n\t}\r\n}\r\n" }, { "path": "src/test/resources/samples/langs/Assembly/External Interrupt.a51", "content": "\tORG\t0000h\n\tSJMP\tSTART\n\tORG\t0003h\n\tLCALL\tINT0_ISR\n\tRETI\n\tORG\t000Bh\n\tLCALL\tT0_ISR\n\tRETI\n\tORG\t0013h\n\tLCALL\tINT1_ISR\n\tRETI\n\tORG\t001Bh\n\tLCALL\tT1_ISR\n\tRETI\n\tORG\t0023h\n\tLCALL\tUART_ISR\n\tRETI\n\tORG\t0030h\nSTART:\n\tMOV\tA,#11111110b\n\tSETB\tIT0\t; Set External Interrupt 0 to be falling edge triggered\n\tSETB\tEX0\t; Enable External Interrut 0\n\tSETB\tEA\t; Enable Interrupt\nLEFT:\t\t\t\n\tCJNE\tA,#01111111b,LOOP1\n\tJMP\tRIGHT\nLOOP1:\n\tMOV\tP1,A\n\tRL\tA\t\n\tLCALL\tDELAY\n\tSJMP\tLEFT\t\nRIGHT:\n\tCJNE\tA,#11111110b,LOOP2\n\tJMP\tLEFT\nLOOP2:\n\tMOV\tP1,A\n\tRR\tA\t\n\tLCALL\tDELAY\n\tSJMP\tRIGHT\n\t\nINT0_ISR:\n\tMOV\tR1,#3\nFLASH:\n\tMOV\tP1,#00h\n\tLCALL\tDELAY\n\tMOV\tP1,#0FFh\n\tLCALL\tDELAY\n\tDJNZ\tR1,FLASH\n\tRET\nT0_ISR:\n\tRET\nINT1_ISR:\n\tRET\nT1_ISR:\n\tRET\nUART_ISR:\n\tRET\n\nDELAY:\tMOV\tR5,#20\t;R5*20 mS\nD1: MOV\tR6,#40\nD2: MOV\tR7,#249\n\tDJNZ\tR7,$\n \tDJNZ\tR6,D2\n \tDJNZ\tR5,D1\n \tRET\n\tEND\n" }, { "path": "src/test/resources/samples/langs/Assembly/FASM.asm", "content": "\n; flat assembler interface for Win32\n; Copyright (c) 1999-2014, Tomasz Grysztar.\n; All rights reserved.\n\n\tformat\tPE console\n\nsection '.text' code readable executable\n\nstart:\n\n\tmov\t[con_handle],STD_OUTPUT_HANDLE\n\tmov\tesi,_logo\n\tcall\tdisplay_string\n\n\tcall\tget_params\n\tjc\tinformation\n\n\tcall\tinit_memory\n\n\tmov\tesi,_memory_prefix\n\tcall\tdisplay_string\n\tmov\teax,[memory_end]\n\tsub\teax,[memory_start]\n\tadd\teax,[additional_memory_end]\n\tsub\teax,[additional_memory]\n\tshr\teax,10\n\tcall\tdisplay_number\n\tmov\tesi,_memory_suffix\n\tcall\tdisplay_string\n\n\tcall\t[GetTickCount]\n\tmov\t[start_time],eax\n\n\tcall\tpreprocessor\n\tcall\tparser\n\tcall\tassembler\n\tcall\tformatter\n\n\tcall\tdisplay_user_messages\n\tmovzx\teax,[current_pass]\n\tinc\teax\n\tcall\tdisplay_number\n\tmov\tesi,_passes_suffix\n\tcall\tdisplay_string\n\tcall\t[GetTickCount]\n\tsub\teax,[start_time]\n\txor\tedx,edx\n\tmov\tebx,100\n\tdiv\tebx\n\tor\teax,eax\n\tjz\tdisplay_bytes_count\n\txor\tedx,edx\n\tmov\tebx,10\n\tdiv\tebx\n\tpush\tedx\n\tcall\tdisplay_number\n\tmov\tdl,'.'\n\tcall\tdisplay_character\n\tpop\teax\n\tcall\tdisplay_number\n\tmov\tesi,_seconds_suffix\n\tcall\tdisplay_string\n display_bytes_count:\n\tmov\teax,[written_size]\n\tcall\tdisplay_number\n\tmov\tesi,_bytes_suffix\n\tcall\tdisplay_string\n\txor\tal,al\n\tjmp\texit_program\n\ninformation:\n\tmov\tesi,_usage\n\tcall\tdisplay_string\n\tmov\tal,1\n\tjmp\texit_program\n\nget_params:\n\tmov\t[input_file],0\n\tmov\t[output_file],0\n\tmov\t[symbols_file],0\n\tmov\t[memory_setting],0\n\tmov\t[passes_limit],100\n\tcall\t[GetCommandLine]\n\tmov\tesi,eax\n\tmov\tedi,params\n find_command_start:\n\tlodsb\n\tcmp\tal,20h\n\tje\tfind_command_start\n\tcmp\tal,22h\n\tje\tskip_quoted_name\n skip_name:\n\tlodsb\n\tcmp\tal,20h\n\tje\tfind_param\n\tor\tal,al\n\tjz\tall_params\n\tjmp\tskip_name\n skip_quoted_name:\n\tlodsb\n\tcmp\tal,22h\n\tje\tfind_param\n\tor\tal,al\n\tjz\tall_params\n\tjmp\tskip_quoted_name\n find_param:\n\tlodsb\n\tcmp\tal,20h\n\tje\tfind_param\n\tcmp\tal,'-'\n\tje\toption_param\n\tcmp\tal,0Dh\n\tje\tall_params\n\tor\tal,al\n\tjz\tall_params\n\tcmp\t[input_file],0\n\tjne\tget_output_file\n\tmov\t[input_file],edi\n\tjmp\tprocess_param\n get_output_file:\n\tcmp\t[output_file],0\n\tjne\tbad_params\n\tmov\t[output_file],edi\n process_param:\n\tcmp\tal,22h\n\tje\tstring_param\n copy_param:\n\tstosb\n\tlodsb\n\tcmp\tal,20h\n\tje\tparam_end\n\tcmp\tal,0Dh\n\tje\tparam_end\n\tor\tal,al\n\tjz\tparam_end\n\tjmp\tcopy_param\n string_param:\n\tlodsb\n\tcmp\tal,22h\n\tje\tstring_param_end\n\tcmp\tal,0Dh\n\tje\tparam_end\n\tor\tal,al\n\tjz\tparam_end\n\tstosb\n\tjmp\tstring_param\n option_param:\n\tlodsb\n\tcmp\tal,'m'\n\tje\tmemory_option\n\tcmp\tal,'M'\n\tje\tmemory_option\n\tcmp\tal,'p'\n\tje\tpasses_option\n\tcmp\tal,'P'\n\tje\tpasses_option\n\tcmp\tal,'s'\n\tje\tsymbols_option\n\tcmp\tal,'S'\n\tje\tsymbols_option\n bad_params:\n\tstc\n\tret\n get_option_value:\n\txor\teax,eax\n\tmov\tedx,eax\n get_option_digit:\n\tlodsb\n\tcmp\tal,20h\n\tje\toption_value_ok\n\tcmp\tal,0Dh\n\tje\toption_value_ok\n\tor\tal,al\n\tjz\toption_value_ok\n\tsub\tal,30h\n\tjc\tinvalid_option_value\n\tcmp\tal,9\n\tja\tinvalid_option_value\n\timul\tedx,10\n\tjo\tinvalid_option_value\n\tadd\tedx,eax\n\tjc\tinvalid_option_value\n\tjmp\tget_option_digit\n option_value_ok:\n\tdec\tesi\n\tclc\n\tret\n invalid_option_value:\n\tstc\n\tret\n memory_option:\n\tlodsb\n\tcmp\tal,20h\n\tje\tmemory_option\n\tcmp\tal,0Dh\n\tje\tbad_params\n\tor\tal,al\n\tjz\tbad_params\n\tdec\tesi\n\tcall\tget_option_value\n\tor\tedx,edx\n\tjz\tbad_params\n\tcmp\tedx,1 shl (32-10)\n\tjae\tbad_params\n\tmov\t[memory_setting],edx\n\tjmp\tfind_param\n passes_option:\n\tlodsb\n\tcmp\tal,20h\n\tje\tpasses_option\n\tcmp\tal,0Dh\n\tje\tbad_params\n\tor\tal,al\n\tjz\tbad_params\n\tdec\tesi\n\tcall\tget_option_value\n\tor\tedx,edx\n\tjz\tbad_params\n\tcmp\tedx,10000h\n\tja\tbad_params\n\tmov\t[passes_limit],dx\n\tjmp\tfind_param\n symbols_option:\n\tmov\t[symbols_file],edi\n find_symbols_file_name:\n\tlodsb\n\tcmp\tal,20h\n\tjne\tprocess_param\n\tjmp\tfind_symbols_file_name\n param_end:\n\tdec\tesi\n string_param_end:\n\txor\tal,al\n\tstosb\n\tjmp\tfind_param\n all_params:\n\tcmp\t[input_file],0\n\tje\tbad_params\n\tclc\n\tret\n\ninclude 'system.inc'\n\ninclude '..\\errors.inc'\ninclude '..\\symbdump.inc'\ninclude '..\\preproce.inc'\ninclude '..\\parser.inc'\ninclude '..\\exprpars.inc'\ninclude '..\\assemble.inc'\ninclude '..\\exprcalc.inc'\ninclude '..\\formats.inc'\ninclude '..\\x86_64.inc'\ninclude '..\\avx.inc'\n\ninclude '..\\tables.inc'\ninclude '..\\messages.inc'\n\nsection '.data' data readable writeable\n\ninclude '..\\version.inc'\n\n_copyright db 'Copyright (c) 1999-2014, Tomasz Grysztar',0Dh,0Ah,0\n\n_logo db 'flat assembler version ',VERSION_STRING,0\n_usage db 0Dh,0Ah\n db 'usage: fasm [output]',0Dh,0Ah\n db 'optional settings:',0Dh,0Ah\n db ' -m set the limit in kilobytes for the available memory',0Dh,0Ah\n db ' -p set the maximum allowed number of passes',0Dh,0Ah\n db ' -s dump symbolic information for debugging',0Dh,0Ah\n db 0\n_memory_prefix db ' (',0\n_memory_suffix db ' kilobytes memory)',0Dh,0Ah,0\n_passes_suffix db ' passes, ',0\n_seconds_suffix db ' seconds, ',0\n_bytes_suffix db ' bytes.',0Dh,0Ah,0\n\nalign 4\n\ninclude '..\\variable.inc'\n\ncon_handle dd ?\nmemory_setting dd ?\nstart_time dd ?\nbytes_count dd ?\ndisplayed_count dd ?\ncharacter db ?\nlast_displayed rb 2\n\nparams rb 1000h\noptions rb 1000h\nbuffer rb 4000h\n\nstack 10000h\n\nsection '.idata' import data readable writeable\n\n dd 0,0,0,rva kernel_name,rva kernel_table\n dd 0,0,0,0,0\n\n kernel_table:\n ExitProcess dd rva _ExitProcess\n CreateFile dd rva _CreateFileA\n ReadFile dd rva _ReadFile\n WriteFile dd rva _WriteFile\n CloseHandle dd rva _CloseHandle\n SetFilePointer dd rva _SetFilePointer\n GetCommandLine dd rva _GetCommandLineA\n GetEnvironmentVariable dd rva _GetEnvironmentVariable\n GetStdHandle dd rva _GetStdHandle\n VirtualAlloc dd rva _VirtualAlloc\n VirtualFree dd rva _VirtualFree\n GetTickCount dd rva _GetTickCount\n GetSystemTime dd rva _GetSystemTime\n GlobalMemoryStatus dd rva _GlobalMemoryStatus\n dd 0\n\n kernel_name db 'KERNEL32.DLL',0\n\n _ExitProcess dw 0\n db 'ExitProcess',0\n _CreateFileA dw 0\n db 'CreateFileA',0\n _ReadFile dw 0\n db 'ReadFile',0\n _WriteFile dw 0\n db 'WriteFile',0\n _CloseHandle dw 0\n db 'CloseHandle',0\n _SetFilePointer dw 0\n db 'SetFilePointer',0\n _GetCommandLineA dw 0\n db 'GetCommandLineA',0\n _GetEnvironmentVariable dw 0\n db 'GetEnvironmentVariableA',0\n _GetStdHandle dw 0\n db 'GetStdHandle',0\n _VirtualAlloc dw 0\n db 'VirtualAlloc',0\n _VirtualFree dw 0\n db 'VirtualFree',0\n _GetTickCount dw 0\n db 'GetTickCount',0\n _GetSystemTime dw 0\n db 'GetSystemTime',0\n _GlobalMemoryStatus dw 0\n db 'GlobalMemoryStatus',0\n\nsection '.reloc' fixups data readable discardable\n" }, { "path": "src/test/resources/samples/langs/Assembly/forth.nasm", "content": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; A Forth by Chris Hinsley\n;; nasm -f macho forth.nasm\n;; ld -o forth -e _main forth.o\n;; ./forth\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\t%define VERSION_NUM 30\n\n\t; various buffer area sizes\n\t%define DATA_STACK_SIZE 1024\n\t%define USER_DEFS_SIZE (64*1024)\n\t%define NUM_HASH_CHAINS 64\n\t%define MAX_LINE_SIZE 128\n\n\t%define SYS_exit 1\n\t%define SYS_read 3\n\t%define SYS_write 4\n\t%define SYS_open 5\n\t%define SYS_close 6\n\t%define SYS_unlink 10\n\t%define\tSYS_mprotect 74\n\t%define SYS_fsync 95\n\t%define SYS_rename 128\n\t%define SYS_stat 188\n\t%define SYS_lseek 199\n\t%define SYS_fstat 189\n\t%define SYS_ftruncate 201\n\n\t%define PROT_READ 0x01\t\t;pages can be read\n\t%define PROT_WRITE 0x02\t\t;pages can be written\n\t%define PROT_EXEC 0x04\t\t;pages can be executed\n\t%define PROT_ALL (PROT_READ | PROT_WRITE | PROT_EXEC)\n\t%define PAGE_SIZE 4096\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;\n; some NASM codeing macros\n;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\t%macro loopstart 0\n\t\t%push loopstart\n\t%$loop_start:\n\t%endmacro\n\n\t%macro break 0\n\t\tjmp %$loop_exit\n\t%endmacro\n\n\t%macro breakif 1\n\t\tj%+1 %$loop_exit\n\t%endmacro\n\n\t%macro loopend 0\n\t\tjmp %$loop_start\n\t%$loop_exit:\n\t\t%pop\n\t%endmacro\n\n\t%macro repeat 0\n\t\t%push repeat\n\t%$loop_start:\n\t%endmacro\n\n\t%macro until 1\n\t\tj%-1 %$loop_start\n\t%$loop_exit:\n\t\t%pop\n\t%endmacro\n\n\t%macro if 1\n\t\t%push if\n\t\tj%-1 %$ifnot\n\t%endmacro\n\n\t%macro else 0\n\t\t%ifctx if\n\t\t\t%repl else\n\t\t\tjmp %$ifend\n\t\t%$ifnot:\n\t\t%else\n\t\t\t%error \"expected `if' before `else'\"\n\t\t%endif\n\t%endmacro\n\n\t%macro endif 0\n\t\t%ifctx if\n\t\t%$ifnot:\n\t\t\t%pop\n\t\t%elifctx else\n\t\t%$ifend:\n\t\t\t%pop\n\t\t%else\n\t\t\t%error \"expected `if' or `else' before `endif'\"\n\t\t%endif\n\t%endmacro\n\n;;;;;;;;;;;;;;;;\n; base VM macros\n;;;;;;;;;;;;;;;;\n\n\t; eip\tForths IP\n\t; esp\tForths R\n\t; ebp\tForths S\n\t; ebx\tForths TOS\n\n\t; push on to return stack\n\t%macro PUSHRSP 1\n\t\tpush %1\n\t%endm\n\n\t; pop top of return stack\n\t%macro POPRSP 1\n\t\tpop %1\n\t%endm\n\n\t; save into return stack\n\t%macro PUTRSP 2\n\t\t%if (%2 = 0)\n\t\t\tmov [esp], %1\n\t\t%elif ((%2 >= -128) && (%2 < 128))\n\t\t\tmov [byte esp + %2], %1\n\t\t%else\n\t\t\tmov [long esp + %2], %1\n\t\t%endif\n\t%endm\n\n\t; load from return stack\n\t%macro PICKRSP 2\n\t\t%if (%2 = 0)\n\t\t\tmov %1, [esp]\n\t\t%elif ((%2 >= -128) && (%2 < 128))\n\t\t\tmov %1, [byte esp + %2]\n\t\t%else\n\t\t\tmov %1, [long esp + %2]\n\t\t%endif\n\t%endm\n\n\t; set return stack\n\t%macro SETRSP 1\n\t\tmov esp, %1\n\t%endm\n\n\t; get return stack\n\t%macro GETRSP 1\n\t\tmov %1, esp\n\t%endm\n\n\t; adjust return stack\n\t%macro ADDRSP 1\n\t\t%if ((%1 >= -128) && (%1 < 128))\n\t\t\tadd esp, byte %1\n\t\t%else\n\t\t\tadd esp, %1\n\t\t%endif\n\t%endm\n\n\t; push on to data stack\n\t%macro PUSHDSP 1\n\t\tsub ebp, byte 4\n\t\tmov [ebp], %1\n\t%endm\n\n\t; pop top of data stack\n\t%macro POPDSP 1\n\t\tmov %1, [ebp]\n\t\tadd ebp, byte 4\n\t%endm\n\n\t; save into data stack\n\t%macro PUTDSP 2\n\t\t%if (%2 = 0)\n\t\t\tmov [ebp], %1\n\t\t%elif ((%2 >= -128) && (%2 < 128))\n\t\t\tmov [byte ebp + %2], %1\n\t\t%else\n\t\t\tmov [long ebp + %2], %1\n\t\t%endif\n\t%endm\n\n\t; load from data stack\n\t%macro PICKDSP 2\n\t\t%if (%2 = 0)\n\t\t\tmov %1, [ebp]\n\t\t%elif ((%2 >= -128) && (%2 < 128))\n\t\t\tmov %1, [byte ebp + %2]\n\t\t%else\n\t\t\tmov %1, [long ebp + %2]\n\t\t%endif\n\t%endm\n\n\t; set data stack\n\t%macro SETDSP 1\n\t\tmov ebp, %1\n\t%endm\n\n\t; get data stack\n\t%macro GETDSP 1\n\t\tmov %1, ebp\n\t%endm\n\n\t; adjust data stack\n\t%macro ADDDSP 1\n\t\t%if ((%1 >= -128) && (%1 < 128))\n\t\t\tadd ebp, byte %1\n\t\t%else\n\t\t\tadd ebp, %1\n\t\t%endif\n\t%endm\n\n\t; load value onto data stack\n\t%macro LOADTOS 1\n\t\tPUSHDSP ebx\n\t\tmov ebx, %1\n\t%endm\n\n\t; move from data to return stack\n\t%macro TORSP 0\n\t\tPUSHRSP ebx\n\t\tPOPDSP ebx\n\t%endm\n\n\t; move from return to data stack\n\t%macro FROMRSP 0\n\t\tPUSHDSP ebx\n\t\tPOPRSP ebx\n\t%endm\n\n\t; copy from return to data stack\n\t%macro FETCHRSP 0\n\t\tPUSHDSP ebx\n\t\tPICKRSP ebx, 0\n\t%endm\n\n\t; align reg\n\t%define DP_ALIGN 3\n\t%macro ALIGNREG 1\n\t\tadd %1, byte DP_ALIGN\n\t\tand %1, byte ~DP_ALIGN\n\t%endm\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n; dictionary building macros\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\t; format of dictionary entry flag byte\n\t%define F_IMMED 0x80\n\t%define F_HIDDEN 0x20\n\t%define F_LENMASK 0x1f\n\n\t%define NULL 0\n\t%define H_LLINK 0\n\t%define H_HLINK 4\n\t%define H_NSIZE 8\n\t%define H_NAME 9\n\n\t%define XT_BODY -12\n\t%define XT_LENGTH -8\n\t%define XT_COMPILE -4\n\t%define XT_SIZE 12\n\t\n\t%macro defword 4\n\t\t%push newword\n\t\t%strlen len %1\n\t\talign 4\n\tdic_%3:\n\t\tdd NULL\t\t\t\t; LATEST list link\n\t\tdd NULL\t\t\t\t; hash chain link\n\t\tdb len + %2\t\t\t; flags + length byte\n\t\tdb %1\t\t\t\t; the name\n\t\tdd %3\t\t\t\t; body pointer\n\t\tdd %$code_end - %3\t; code length\n\t\tdd %4\t\t\t\t; compile action word\n\t%3:\n\t%endm\t\t\t\t\t; assembler code follows\n\n\t%macro defword_end 0\n\t%$code_end:\n\t\t%pop\n\t%endm\n\n\t%macro defvar 4\n\t\tdefword %1, %2, %3, WORD_INLINE_COMMA\n\t\tLOADTOS var_%3\n\t\tret\n\t\tdefword_end\n\t\talign 4\n\tvar_%3:\n\t\tdd %4\n\t%endm\n\n\t%macro defvar2 5\n\t\tdefword %1, %2, %3, WORD_INLINE_COMMA\n\t\tLOADTOS var_%3\n\t\tret\n\t\tdefword_end\n\t\talign 4\n\tvar_%3:\n\t\tdd %4\n\t\tdd %5\n\t%endm\n\n\t%macro defconst 4\n\t\tdefword %1, %2, %3, WORD_INLINE_COMMA\n\t\tLOADTOS %4\n\t\tret\n\t\tdefword_end\n\t%endm\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;\n; entry point\n;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\tSECTION .text\n\tglobal _main\n_main:\n\t; use mprotect to allow read/write/execute of the data section\n\tmov edx, forth_start\n\tand edx, -PAGE_SIZE\t\t;start address\n\tmov ecx, forth_end\n\tsub ecx, edx\t\t\t;length\n\tmov ebx, PROT_ALL\t\t;flags\n\tpush ebx\n\tpush ecx\n\tpush edx\n\tpush 0\t\t\t\t\t;padding\n\tmov eax, SYS_mprotect\n\tint 0x80\n\tadd esp, 16\n\tjmp forth_start\n\n\tSECTION .data\nforth_start:\n\t; init data and return stacks, saving initial positions\n\t; in Forth vars R0 and S0\n\tcld\n\tGETRSP [var_WORD_SZ]\n\tSETDSP [var_WORD_SZ]\n\tADDRSP -DATA_STACK_SIZE\n\tGETRSP [var_WORD_RZ]\n\n\t; link built in dictionary\n\tmov esi, dictionary_start\n\txor edi, edi\n\trepeat\n\t\tlodsd\n\t\tmov [eax + H_LLINK], edi\n\t\tmov edi, eax\n\t\tpush esi\n\t\tmov cl, [eax + H_NSIZE]\n\t\tand ecx, F_LENMASK\n\t\tlea esi, [eax + H_NAME]\n\t\tcall strhashi\n\t\tand ebx, NUM_HASH_CHAINS-1\n\t\tmov esi, hash_buckets\n\t\tmov eax, [esi + (ebx * 4)]\n\t\tmov [esi + (ebx * 4)], edi\n\t\tmov [edi + H_HLINK], eax\n\t\tpop esi\n\t\tcmp esi, dictionary_end\n\tuntil z\n\tmov [var_WORD_LATEST], edi\n\n\t; run temp interpreter loop till we can get into the real QUIT word\n\tcall WORD_LBRAC\t\t\t; interpret state\n\tLOADTOS 666q\t\t\t; octal !\n\tTORSP\n\tLOADTOS 0\n\tTORSP\n\tLOADTOS bootfile\n\tTORSP\n\tcall WORD_SYS_OPEN\n\tcall WORD_SYSCALL\n\tADDRSP 12\n\tTORSP\t\t\t\t\t; ( fd ) of \"forth.f\"\n\tloopstart\n\t\tLOADTOS tib_buffer\n\t\tLOADTOS MAX_LINE_SIZE\n\t\tFETCHRSP\t\t\t; ( c-addr len fd )\n\t\tcall WORD_READLINE\t; ( num flag flag )\n\t\tcall WORD_DROP2\n\t\tLOADTOS tib_buffer\n\t\tcall WORD_SWAP\n\t\tcall WORD_INHASH\n\t\tcall WORD_STORE2\n\t\tLOADTOS 0\n\t\tcall WORD_TOIN\n\t\tcall WORD_STORE\n\t\tcall WORD_INTERPRET\n\tloopend\t\t\t\t\t; and loop till QUIT takes over\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n; a few case insensative string operations\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\t%macro to_lower 1\n\t\t; lower case check\n\t\tcmp %1, 'A'\n\t\tif ge\n\t\t\tcmp %1, 'Z'\n\t\t\tif le\n\t\t\t\t; make it lower case\n\t\t\t\tadd %1, byte 'a' - 'A'\n\t\t\tendif\n\t\tendif\n\t%endm\n\nstrcpyi:\n\ttest ecx, ecx\n\tif nz\n\tstrcpyi_l1:\n\t\tlodsb\n\t\tto_lower al\n\t\tstosb\n\t\tloop strcpyi_l1\n\tendif\n\tret\n\nstrcmpi:\n\ttest ecx, ecx\n\tif nz\n\tstrcmpi_l1:\n\t\tlodsb\n\t\tmov bl, [edi]\n\t\tlea edi, [edi + 1]\n\t\tto_lower al\n\t\tto_lower bl\n\t\tcmp bl, al\n\t\tif z\n\t\t\tloop strcmpi_l1\n\t\tendif\n\tendif\n\tret\n\n;;;;;;;;;;;;;;;\n; hash function\n;;;;;;;;;;;;;;;\n\nstrhashi:\n\tmov ebx, 5381\n\ttest ecx, ecx\n\tif nz\n\t\tmov edx, 33\n\tstrhashi_l1:\n\t\tlodsb\n\t\tmovzx eax, al\n\t\tto_lower eax\n\t\timul ebx, edx\n\t\tadd ebx, eax\n\t\tloop strhashi_l1\n\tendif\n\tret\n\n;;;;;;;;;;;;;;;;;;;\n; syscall functions\n;;;;;;;;;;;;;;;;;;;\n\n_syscall:\n\tint 0x80\n\tif c\n\t\tneg eax\n\tendif\n\tret\n\n_lsyscall:\n\tint 0x80\n\tif c\n\t\tnot eax\n\t\tnot edx\n\t\tadd eax, 1\n\t\tadc edx, 0\n\tendif\n\tret\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n; built in variables\n; STATE\t\tIs the interpreter executing code (0) or compiling a word (non-zero)?\n; LATEST\tPoints to the latest (most recently defined) word in the dictionary.\n; DP\t\tPoints to the next free byte of memory. When compiling, compiled words go here.\n; S0\t\tStores the address of the top of the parameter stack.\n; R0\t\tThe address of the top of the return stack.\n; BASE\t\tThe current base for printing and reading numbers.\n; #IN\t\tThe current input buffer descriptor.\n; >IN\t\tThe current input offset.\n; SOURCEFD\tThe current input source file descriptor.\n; BLK\t\tThe current block number.\n; CHARBUF\tSingle char buffer.\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\tdefvar \"state\", 0, WORD_STATE, 0\n\tdefvar \"dp\", 0, WORD_DP, dictionary_start\n\tdefvar \"latest\", 0, WORD_LATEST, 0\n\tdefvar \"s0\", 0, WORD_SZ, 0\n\tdefvar \"r0\", 0, WORD_RZ, 0\n\tdefvar \"base\", 0, WORD_BASE, 10\n\tdefvar2 \"#IN\", 0, WORD_INHASH, 0, 0\n\tdefvar \">in\", 0, WORD_TOIN, 0\n\tdefvar \"sourcefd\", 0, WORD_SOURCEFD, 0\n\tdefvar \"blk\", 0, WORD_BLK, 0\n\tdefvar \"charbuf\", 0, WORD_CHARBUF, 0\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n; built in constants\n; VERSION\t\tThe current version of this FORTH.\n; WORDBUF\t\tThe address of the buffer WORD uses.\n; LINESIZE\t\tThe line buffer size.\n; F_IMMED\t\tThe IMMEDIATE flag's actual value.\n; F_HIDDEN\t\tThe HIDDEN flag's actual value.\n; F_LENMASK\t\tThe length mask in the flags/len byte.\n; H_NSIZE\t\tThe flags/len field offset.\n; H_NAME\t\tThe name field offset.\n; XT_BODY\t\tThe xt body pointer.\n; XT_LENGTH\t\tThe xt length field offset.\n; XT_COMPILE\tThe xt compile field offset.\n; XT_SIZE\t\tThe xt size offset.\n; SYS_*\t\t\tThe numeric codes of various syscalls.\n; O_*\t\t\tVarious sycall flags/modes.\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\tdefconst \"version\", 0, WORD_VERSION, VERSION_NUM\n\tdefconst \"wordbuf\", 0, WORD_WORDBUF, word_buf\n\tdefconst \"linesize\", 0, WORD_LINESIZE, MAX_LINE_SIZE\n\tdefconst \"f_immed\", 0, WORD__F_IMMED, F_IMMED\n\tdefconst \"f_hidden\", 0, WORD__F_HIDDEN, F_HIDDEN\n\tdefconst \"f_lenmask\", 0, WORD__F_LENMASK, F_LENMASK\n\tdefconst \"h_nsize\", 0, WORD__H_NSIZE, H_NSIZE\n\tdefconst \"h_name\", 0, WORD__H_NAME, H_NAME\n\tdefconst \"xt_body\", 0, WORD__XT_BODY, XT_BODY\n\tdefconst \"xt_length\", 0, WORD__XT_LENGTH, XT_LENGTH\n\tdefconst \"xt_compile\", 0, WORD__XT_COMPILE, XT_COMPILE\n\tdefconst \"xt_size\", 0, WORD__XT_SIZE, XT_SIZE\n\n\tdefconst \"sys_exit\", 0, WORD_SYS_EXIT, SYS_exit\n\tdefconst \"sys_open\", 0, WORD_SYS_OPEN, SYS_open\n\tdefconst \"sys_close\", 0, WORD_SYS_CLOSE, SYS_close\n\tdefconst \"sys_read\", 0, WORD_SYS_READ, SYS_read\n\tdefconst \"sys_write\", 0, WORD_SYS_WRITE, SYS_write\n\tdefconst \"sys_unlink\", 0, WORD_SYS_UNLINK, SYS_unlink\n\tdefconst \"sys_rename\", 0, WORD_SYS_RENAME, SYS_rename\n\tdefconst \"sys_ftruncate\", 0, WORD_SYS_FTRUNCATE, SYS_ftruncate\n\tdefconst \"sys_fsync\", 0, WORD_SYS_FSYNC, SYS_fsync\n\tdefconst \"sys_lseek\", 0, WORD_SYS_LSEEK, SYS_lseek\n\tdefconst \"sys_fstat\", 0, WORD_SYS_FSTAT, SYS_fstat\n\tdefconst \"sys_stat\", 0, WORD_SYS_STAT, SYS_stat\n\n\tdefconst \"o_rdonly\", 0, WORD_O_RDONLY, 0x0\n\tdefconst \"o_wronly\", 0, WORD_O_WRONLY, 0x1\n\tdefconst \"o_rdwr\", 0, WORD_O_RDWR, 0x2\n\tdefconst \"o_creat\", 0, WORD_O_CREAT, 0x100\n\tdefconst \"o_excl\", 0, WORD_O_EXCL, 0x200\n\tdefconst \"o_trunc\", 0, WORD_O_TRUNC, 0x1000\n\tdefconst \"o_append\", 0, WORD_O_APPEND, 0x2000\n\tdefconst \"o_nonblock\", 0, WORD_O_NONBLOCK, 0x4000\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;\n; data stack ordering words\n;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\tdefword \"dsp@\", 0, WORD_DSPFETCH, WORD_INLINE_COMMA\n\tPUSHDSP ebx\n\tGETDSP ebx\n\tret\n\tdefword_end\n\n\tdefword \"dsp!\", 0, WORD_DSPSTORE, WORD_INLINE_COMMA\n\tSETDSP ebx\n\tPOPDSP ebx\n\tret\n\tdefword_end\n\n\tdefword \"drop\", 0, WORD_DROP, WORD_INLINE_COMMA\n\tPOPDSP ebx\n\tret\n\tdefword_end\n\n\tdefword \"swap\", 0, WORD_SWAP, WORD_INLINE_COMMA\n\txchg ebx, [ebp]\n\tret\n\tdefword_end\n\n\tdefword \"dup\", 0, WORD_DUP, WORD_INLINE_COMMA\n\tPUSHDSP ebx\n\tret\n\tdefword_end\n\n\tdefword \"over\", 0, WORD_OVER, WORD_INLINE_COMMA\n\tPUSHDSP ebx\n\tPICKDSP ebx, 4\n\tret\n\tdefword_end\n\n\tdefword \"rot\", 0, WORD_ROT, WORD_INLINE_COMMA\n\tmov eax, ebx\n\tPICKDSP ecx, 0\n\tPICKDSP ebx, 4\n\tPUTDSP eax, 0\n\tPUTDSP ecx, 4\n\tret\n\tdefword_end\n\n\tdefword \"-rot\", 0, WORD_NROT, WORD_INLINE_COMMA\n\tmov eax, ebx\n\tPICKDSP ebx, 0\n\tPICKDSP ecx, 4\n\tPUTDSP ecx, 0\n\tPUTDSP eax, 4\n\tret\n\tdefword_end\n\n\tdefword \"2drop\", 0, WORD_DROP2, WORD_INLINE_COMMA\n\tPICKDSP ebx, 4\n\tADDDSP 8\n\tret\n\tdefword_end\n\n\tdefword \"2dup\", 0, WORD_DUP2, WORD_INLINE_COMMA\n\tPICKDSP eax, 0\n\tADDDSP -8\n\tPUTDSP eax, 0\n\tPUTDSP ebx, 4\n\tret\n\tdefword_end\n\n\tdefword \"2swap\", 0, WORD_SWAP2, WORD_INLINE_COMMA\n\tmov eax, ebx\n\tPICKDSP ecx, 0\n\tPICKDSP ebx, 4\n\tPICKDSP edx, 8\n\tPUTDSP edx, 0\n\tPUTDSP eax, 4\n\tPUTDSP ecx, 8\n\tret\n\tdefword_end\n\n\tdefword \"2rot\", 0, WORD_ROT2, WORD_INLINE_COMMA\n\tmov eax, ebx\n\tPICKDSP ecx, 16\n\tPICKDSP ebx, 12\n\tPICKDSP edx, 8\n\tPICKDSP edi, 4\n\tPICKDSP esi, 0\n\tPUTDSP edx, 16\n\tPUTDSP edi, 12\n\tPUTDSP esi, 8\n\tPUTDSP eax, 4\n\tPUTDSP ecx, 0\n\tret\n\tdefword_end\n\n\tdefword \"?dup\", 0, WORD_QDUP, WORD_INLINE_COMMA\n\ttest ebx, ebx\n\tif nz\n\t\tPUSHDSP ebx\n\tendif\n\tret\n\tdefword_end\n\n\tdefword \"!?dup\", 0, WORD_NQDUP, WORD_INLINE_COMMA\n\ttest ebx, ebx\n\tif z\n\t\tPUSHDSP ebx\n\tendif\n\tret\n\tdefword_end\n\n\tdefword \"nip\", 0, WORD_NIP, WORD_INLINE_COMMA\n\tADDDSP 4\n\tret\n\tdefword_end\n\n\tdefword \"tuck\", 0, WORD_TUCK, WORD_INLINE_COMMA\n\tPICKDSP eax, 0\n\tPUTDSP ebx, 0\n\tPUSHDSP eax\n\tret\n\tdefword_end\n\n\tdefword \"pick\", 0, WORD_PICK, WORD_INLINE_COMMA\n\tmov ebx, [ebp + (ebx * 4)]\n\tret\n\tdefword_end\n\n\tdefword \"2tuck\", 0, WORD_TUCK2, WORD_INLINE_COMMA\n\tPICKDSP eax, 0\n\tPICKDSP ecx, 4\n\tPICKDSP edx, 8\n\tADDDSP -8\n\tPUTDSP eax, 0\n\tPUTDSP ecx, 4\n\tPUTDSP edx, 8\n\tPUTDSP ebx, 12\n\tPUTDSP eax, 16\n\tret\n\tdefword_end\n\n\tdefword \"2nip\", 0, WORD_NIP2, WORD_INLINE_COMMA\n\tPICKDSP eax, 0\n\tADDDSP 8\n\tPUTDSP eax, 0\n\tret\n\tdefword_end\n\n\tdefword \"2over\", 0, WORD_OVER2, WORD_INLINE_COMMA\n\tADDDSP -8\n\tPUTDSP ebx, 4\n\tPICKDSP ebx, 16\n\tPUTDSP ebx, 0\n\tPICKDSP ebx, 12\n\tret\n\tdefword_end\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n; return stack ordering words\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\tdefword \">r\", 0, WORD_TOR, WORD_INLINE_COMMA\n\tTORSP\n\tret\n\tdefword_end\n\n\tdefword \"r>\", 0, WORD_FROMR, WORD_INLINE_COMMA\n\tFROMRSP\n\tret\n\tdefword_end\n\n\tdefword \"2>r\", 0, WORD_TOR2, WORD_INLINE_COMMA\n\tADDRSP -8\n\tPICKDSP ecx, 0\n\tPUTRSP ebx, 0\n\tPUTRSP ecx, 4\n\tPICKDSP ebx, 4\n\tADDDSP 8\n\tret\n\tdefword_end\n\n\tdefword \"2r>\", 0, WORD_FROMR2, WORD_INLINE_COMMA\n\tADDDSP -8\n\tPUTDSP ebx, 4\n\tPICKRSP ebx, 0\n\tPICKRSP ecx, 4\n\tPUTDSP ecx, 0\n\tADDRSP 8\n\tret\n\tdefword_end\n\n\tdefword \"rsp@\", 0, WORD_RSPFETCH, WORD_INLINE_COMMA\n\tPUSHDSP ebx\n\tGETRSP ebx\n\tret\n\tdefword_end\n\n\tdefword \"r@\", 0, WORD_RFETCH, WORD_INLINE_COMMA\n\tPUSHDSP ebx\n\tPICKRSP ebx, 0\n\tret\n\tdefword_end\n\n\tdefword \"r!\", 0, WORD_RSTORE, WORD_INLINE_COMMA\n\tPUTRSP ebx, 0\n\tPOPDSP ebx\n\tret\n\tdefword_end\n\n\tdefword \"2r@\", 0, WORD_RFETCH2, WORD_INLINE_COMMA\n\tADDDSP -8\n\tPUTDSP ebx, 4\n\tPICKRSP ebx, 4\n\tPICKRSP ecx, 0\n\tPUTDSP ecx, 0\n\tret\n\tdefword_end\n\n\tdefword \"rsp!\", 0, WORD_RSPSTORE, WORD_INLINE_COMMA\n\tSETRSP ebx\n\tPOPDSP ebx\n\tret\n\tdefword_end\n\n\tdefword \"rdrop\", 0, WORD_RDROP, WORD_INLINE_COMMA\n\tADDRSP 4\n\tret\n\tdefword_end\n\n\tdefword \"2rdrop\", 0, WORD_RDROP2, WORD_INLINE_COMMA\n\tADDRSP 8\n\tret\n\tdefword_end\n\n\tdefword \"n>r\", 0, WORD_NTOR, WORD_CALL_COMMA\n\tPUSHDSP ebx\n\tPICKRSP eax, 0\n\tmov ecx, ebx\n\tinc ecx\n\tneg ebx\n\tlea esp, [esp + (ebx * 4)]\n\tmov esi, ebp\n\tmov edi, esp\n\trep movsd\n\tmov ebp, esi\n\tPOPDSP ebx\n\tjmp eax\n\tdefword_end\n\n\tdefword \"nr>\", 0, WORD_NFROMR, WORD_CALL_COMMA\n\tPUSHDSP ebx\n\tPOPRSP eax\n\tPICKRSP ebx, 0\n\tinc ebx\n\tmov ecx, ebx\n\tneg ebx\n\tlea ebp, [ebp + (ebx * 4)]\n\tmov esi, esp\n\tmov edi, ebp\n\trep movsd\n\tmov esp, esi\n\tPOPDSP ebx\n\tjmp eax\n\tdefword_end\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n; memory fetch and store words\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\tdefword \"!\", 0, WORD_STORE, WORD_INLINE_COMMA\n\tPICKDSP eax, 0\n\tmov [ebx], eax\n\tPICKDSP ebx, 4\n\tADDDSP 8\n\tret\n\tdefword_end\n\n\tdefword \"@\", 0, WORD_FETCH, WORD_INLINE_COMMA\n\tmov ebx, [ebx]\n\tret\n\tdefword_end\n\n\tdefword \"+!\", 0, WORD_ADDSTORE, WORD_INLINE_COMMA\n\tPICKDSP eax, 0\n\tadd [ebx], eax\n\tPICKDSP ebx, 4\n\tADDDSP 8\n\tret\n\tdefword_end\n\n\tdefword \"-!\", 0, WORD_SUBSTORE, WORD_INLINE_COMMA\n\tPICKDSP eax, 0\n\tsub [ebx], eax\n\tPICKDSP ebx, 4\n\tADDDSP 8\n\tret\n\tdefword_end\n\n\tdefword \"c!\", 0, WORD_STOREBYTE, WORD_INLINE_COMMA\n\tPICKDSP eax, 0\n\tmov [ebx], al\n\tPICKDSP ebx, 4\n\tADDDSP 8\n\tret\n\tdefword_end\n\n\tdefword \"c+!\", 0, WORD_ADDBYTE, WORD_INLINE_COMMA\n\tPICKDSP eax, 0\n\tadd [ebx], al\n\tPICKDSP ebx, 4\n\tADDDSP 8\n\tret\n\tdefword_end\n\n\tdefword \"c@\", 0, WORD_FETCHBYTE, WORD_INLINE_COMMA\n\tmov eax, ebx\n\txor ebx, ebx\n\tmov bl, [eax]\n\tret\n\tdefword_end\n\n\tdefword \"w!\", 0, WORD_STORESHORT, WORD_INLINE_COMMA\n\tPICKDSP eax, 0\n\tmov [ebx], ax\n\tPICKDSP ebx, 4\n\tADDDSP 8\n\tret\n\tdefword_end\n\n\tdefword \"w@\", 0, WORD_FETCHSHORT, WORD_INLINE_COMMA\n\tmov eax, ebx\n\txor ebx, ebx\n\tmov bx, [eax]\n\tret\n\tdefword_end\n\n\tdefword \"2!\", 0, WORD_STORE2, WORD_INLINE_COMMA\n\tPICKDSP ecx, 4\n\tPICKDSP edx, 0\n\tmov [ebx + 4], ecx\n\tmov [ebx], edx\n\tPICKDSP ebx, 8\n\tADDDSP 12\n\tret\n\tdefword_end\n\n\tdefword \"2@\", 0, WORD_FETCH2, WORD_INLINE_COMMA\n\tADDDSP -4\n\tmov ecx, [ebx +4]\n\tmov ebx, [ebx]\n\tPUTDSP ecx, 0\n\tret\n\tdefword_end\n\n\tdefword \"blank\", 0, WORD_BLANK, WORD_CALL_COMMA\n\tmov ecx, ebx\n\tPICKDSP ebx, 4\n\tPICKDSP edi, 0\n\tADDDSP 8\n\tmov eax, 0x20\n\trep stosb\n\tret\n\tdefword_end\n\n\tdefword \"erase\", 0, WORD_ERASE, WORD_CALL_COMMA\n\tmov ecx, ebx\n\tPICKDSP ebx, 4\n\tPICKDSP edi, 0\n\tADDDSP 8\n\txor eax, eax\n\trep stosb\n\tret\n\tdefword_end\n\n\tdefword \"fill\", 0, WORD_FILL, WORD_CALL_COMMA\n\tmov eax, ebx\n\tPICKDSP ebx, 8\n\tPICKDSP edi, 4\n\tPICKDSP ecx, 0\n\tADDDSP 12\n\trep stosb\n\tret\n\tdefword_end\n\n\tdefword \"cmove>\", 0, WORD_CMOVEB, WORD_CALL_COMMA\n\tmov ecx, ebx\n\tPICKDSP ebx, 8\n\tPICKDSP esi, 4\n\tPICKDSP edi, 0\n\tADDDSP 12\n\tlea esi, [esi + ecx - 1]\n\tlea edi, [edi + ecx - 1]\n\tstd\n\trep movsb\n\tcld\n\tret\n\tdefword_end\n\n\tdefword \"cmove\", 0, WORD_CMOVE, WORD_CALL_COMMA\n\tmov ecx, ebx\n\tPICKDSP ebx, 8\n\tPICKDSP esi, 4\n\tPICKDSP edi, 0\n\tADDDSP 12\n\trep movsb\n\tret\n\tdefword_end\n\n\tdefword \"move\", 0, WORD_MOVE, WORD_CALL_COMMA\n\tmov ecx, ebx\n\tPICKDSP ebx, 8\n\tPICKDSP esi, 4\n\tPICKDSP edi, 0\n\tADDDSP 12\n\tcmp esi, edi\n\tif a\n\t\trep movsb\n\telse\n\t\tlea esi, [esi + ecx -1]\n\t\tlea edi, [edi + ecx -1]\n\t\tstd\n\t\trep movsb\n\t\tcld\n\tendif\n\tret\n\tdefword_end\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n; single precision alu words\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\tdefword \"+\", 0, WORD_ADD, WORD_INLINE_COMMA\n\tadd ebx, [ebp]\n\tADDDSP 4\n\tret\n\tdefword_end\n\n\tdefword \"-\", 0, WORD_SUB, WORD_INLINE_COMMA\n\tmov eax, ebx\n\tPOPDSP ebx\n\tsub ebx, eax\n\tret\n\tdefword_end\n\n\tdefword \"*\", 0, WORD_MULL, WORD_INLINE_COMMA\n\timul ebx, [ebp]\n\tADDDSP 4\n\tret\n\tdefword_end\n\n\tdefword \"/\", 0, WORD_DIV, WORD_INLINE_COMMA\n\tPOPDSP eax\n\tcdq\n\tidiv ebx\n\tmov ebx, eax\n\tret\n\tdefword_end\n\n\tdefword \"mod\", 0, WORD_MOD, WORD_INLINE_COMMA\n\tPOPDSP eax\n\tcdq\n\tidiv ebx\n\tmov ebx, edx\n\tret\n\tdefword_end\n\n\tdefword \"1+\", 0, WORD_INCR, WORD_INLINE_COMMA\n\tadd ebx, byte 1\n\tret\n\tdefword_end\n\n\tdefword \"1-\", 0, WORD_DECR, WORD_INLINE_COMMA\n\tsub ebx, byte 1\n\tret\n\tdefword_end\n\n\tdefword \"4+\", 0, WORD_INCR4, WORD_INLINE_COMMA\n\tadd ebx, byte 4\n\tret\n\tdefword_end\n\n\tdefword \"4-\", 0, WORD_DECR4, WORD_INLINE_COMMA\n\tsub ebx, byte 4\n\tret\n\tdefword_end\n\n\tdefword \"2+\", 0, WORD_INCR2, WORD_INLINE_COMMA\n\tadd ebx, byte 2\n\tret\n\tdefword_end\n\n\tdefword \"2-\", 0, WORD_DECR2, WORD_INLINE_COMMA\n\tsub ebx, byte 2\n\tret\n\tdefword_end\n\n\tdefword \"2*\", 0, WORD_TWOMUL, WORD_INLINE_COMMA\n\tshl ebx, byte 1\n\tret\n\tdefword_end\n\n\tdefword \"2/\", 0, WORD_TWODIV, WORD_INLINE_COMMA\n\tsar ebx, byte 1\n\tret\n\tdefword_end\n\n\tdefword \"abs\", 0, WORD_ABS, WORD_INLINE_COMMA\n\tmov eax, ebx\n\tsar eax, byte 31\n\tadd ebx, eax\n\txor ebx, eax\n\tret\n\tdefword_end\n\n\tdefword \"min\", 0, WORD_MIN, WORD_INLINE_COMMA\n\tPOPDSP eax\n\tcmp ebx, eax\n\tif g\n\t\tmov ebx, eax\n\tendif\n\tret\n\tdefword_end\n\n\tdefword \"max\", 0, WORD_MAX, WORD_INLINE_COMMA\n\tPOPDSP eax\n\tcmp ebx, eax\n\tif l\n\t\tmov ebx, eax\n\tendif\n\tret\n\tdefword_end\n\n\tdefword \"lshift\", 0, WORD_LSHIFT, WORD_INLINE_COMMA\n\tmov ecx, ebx\n\tPOPDSP ebx\n\tshl ebx, cl\n\tret\n\tdefword_end\n\n\tdefword \"rshift\", 0, WORD_RSHIFT, WORD_INLINE_COMMA\n\tmov ecx, ebx\n\tPOPDSP ebx\n\tshr ebx, cl\n\tret\n\tdefword_end\n\n\tdefword \"and\", 0, WORD_AND, WORD_INLINE_COMMA\n\tand ebx, [ebp]\n\tADDDSP 4\n\tret\n\tdefword_end\n\n\tdefword \"or\", 0, WORD_OR, WORD_INLINE_COMMA\n\tor ebx, [ebp]\n\tADDDSP 4\n\tret\n\tdefword_end\n\n\tdefword \"xor\", 0, WORD_XOR, WORD_INLINE_COMMA\n\txor ebx, [ebp]\n\tADDDSP 4\n\tret\n\tdefword_end\n\n\tdefword \"negate\", 0, WORD_NEGATE, WORD_INLINE_COMMA\n\tneg ebx\n\tret\n\tdefword_end\n\n\tdefword \"invert\", 0, WORD_INVERT, WORD_INLINE_COMMA\n\tnot ebx\n\tret\n\tdefword_end\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n; single precision comparision words\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\tdefword \"=\", 0, WORD_EQ, WORD_INLINE_COMMA\n\tcmp [ebp], ebx\n\tsete bl\n\tADDDSP 4\n\tmovzx ebx, bl\n\tneg ebx\n\tret\n\tdefword_end\n\n\tdefword \"<>\", 0, WORD_NE, WORD_INLINE_COMMA\n\tcmp [ebp], ebx\n\tsetne bl\n\tADDDSP 4\n\tmovzx ebx, bl\n\tneg ebx\n\tret\n\tdefword_end\n\n\tdefword \"<\", 0, WORD_LT, WORD_INLINE_COMMA\n\tcmp [ebp], ebx\n\tsetl bl\n\tADDDSP 4\n\tmovzx ebx, bl\n\tneg ebx\n\tret\n\tdefword_end\n\n\tdefword \">\", 0, WORD_GT, WORD_INLINE_COMMA\n\tcmp [ebp], ebx\n\tsetg bl\n\tADDDSP 4\n\tmovzx ebx, bl\n\tneg ebx\n\tret\n\tdefword_end\n\n\tdefword \"u<\", 0, WORD_ULT, WORD_INLINE_COMMA\n\tcmp [ebp], ebx\n\tsetb bl\n\tADDDSP 4\n\tmovzx ebx, bl\n\tneg ebx\n\tret\n\tdefword_end\n\n\tdefword \"u>\", 0, WORD_UGT, WORD_INLINE_COMMA\n\tcmp [ebp], ebx\n\tseta bl\n\tADDDSP 4\n\tmovzx ebx, bl\n\tneg ebx\n\tret\n\tdefword_end\n\n\tdefword \"u<=\", 0, WORD_ULTEQ, WORD_INLINE_COMMA\n\tcmp [ebp], ebx\n\tsetbe bl\n\tADDDSP 4\n\tmovzx ebx, bl\n\tneg ebx\n\tret\n\tdefword_end\n\n\tdefword \"u>=\", 0, WORD_UGTEQ, WORD_INLINE_COMMA\n\tcmp [ebp], ebx\n\tsetae bl\n\tADDDSP 4\n\tmovzx ebx, bl\n\tneg ebx\n\tret\n\tdefword_end\n\n\tdefword \"<=\", 0, WORD_LTEQ, WORD_INLINE_COMMA\n\tcmp [ebp], ebx\n\tsetle bl\n\tADDDSP 4\n\tmovzx ebx, bl\n\tneg ebx\n\tret\n\tdefword_end\n\n\tdefword \">=\", 0, WORD_GTEQ, WORD_INLINE_COMMA\n\tcmp [ebp], ebx\n\tsetge bl\n\tADDDSP 4\n\tmovzx ebx, bl\n\tneg ebx\n\tret\n\tdefword_end\n\n\tdefword \"0=\", 0, WORD_ZEQ, WORD_INLINE_COMMA\n\ttest ebx, ebx\n\tsetz bl\n\tmovzx ebx, bl\n\tneg ebx\n\tret\n\tdefword_end\n\n\tdefword \"0<>\", 0, WORD_ZNE, WORD_INLINE_COMMA\n\ttest ebx, ebx\n\tsetnz bl\n\tmovzx ebx, bl\n\tneg ebx\n\tret\n\tdefword_end\n\n\tdefword \"0<\", 0, WORD_ZLT, WORD_INLINE_COMMA\n\ttest ebx, ebx\n\tsetl bl\n\tmovzx ebx, bl\n\tneg ebx\n\tret\n\tdefword_end\n\n\tdefword \"0>\", 0, WORD_ZGT, WORD_INLINE_COMMA\n\ttest ebx, ebx\n\tsetg bl\n\tmovzx ebx, bl\n\tneg ebx\n\tret\n\tdefword_end\n\n\tdefword \"0<=\", 0, WORD_ZLTEQ, WORD_INLINE_COMMA\n\ttest ebx, ebx\n\tsetle bl\n\tmovzx ebx, bl\n\tneg ebx\n\tret\n\tdefword_end\n\n\tdefword \"0>=\", 0, WORD_ZGTEQ, WORD_INLINE_COMMA\n\ttest ebx, ebx\n\tsetge bl\n\tmovzx ebx, bl\n\tneg ebx\n\tret\n\tdefword_end\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n; double precision ALU words\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\tdefword \"s>d\", 0, WORD_STOD, WORD_INLINE_COMMA\n\tmov eax, ebx\n\tcdq\n\tPUSHDSP eax\n\tmov ebx, edx\n\tret\n\tdefword_end\n\n\tdefword \"d>s\", 0, WORD_DTOS, WORD_INLINE_COMMA\n\tPOPDSP ebx\n\tret\n\tdefword_end\n\n\tdefword \"d+\", 0, WORD_DPLUS, WORD_INLINE_COMMA\n\tPICKDSP ecx, 8\n\tPICKDSP edx, 4\n\tPICKDSP eax, 0\n\tadd eax, ecx\n\tadc ebx, edx\n\tPUTDSP eax, 8\n\tADDDSP 8\n\tret\n\tdefword_end\n\n\tdefword \"d-\", 0, WORD_DMINUS, WORD_INLINE_COMMA\n\tPICKDSP ecx, 8\n\tPICKDSP edx, 4\n\tPICKDSP eax, 0\n\tsub ecx, eax\n\tsbb edx, ebx\n\tPUTDSP ecx, 8\n\tmov ebx, edx\n\tADDDSP 8\n\tret\n\tdefword_end\n\n\tdefword \"d2*\", 0, WORD_D2STAR, WORD_INLINE_COMMA\n\tPICKDSP eax, 0\n\tshl eax, 1\n\trcl ebx, 1\n\tPUTDSP eax, 0\n\tret\n\tdefword_end\n\n\tdefword \"d2/\", 0, WORD_D2SLASH, WORD_INLINE_COMMA\n\tPICKDSP eax, 0\n\tsar ebx, 1\n\trcr eax, 1\n\tPUTDSP eax, 0\n\tret\n\tdefword_end\n\n\tdefword \"*/\", 0, WORD_MULDIV, WORD_INLINE_COMMA\n\tPICKDSP edx, 4\n\tPICKDSP eax, 0\n\timul edx\n\tidiv ebx\n\tmov ebx, eax\n\tADDDSP 8\n\tret\n\tdefword_end\n\n\tdefword \"*/mod\", 0, WORD_STARSMOD, WORD_INLINE_COMMA\n\tPICKDSP edx, 4\n\tPICKDSP eax, 0\n\timul edx\n\tidiv ebx\n\tPUTDSP edx, 4\n\tADDDSP 4\n\tmov ebx, eax\n\tret\n\tdefword_end\n\n\tdefword \"/mod\", 0, WORD_DIVMOD, WORD_INLINE_COMMA\n\tPICKDSP eax, 0\n\tcdq\n\tidiv ebx\n\tPUTDSP edx, 0\n\tmov ebx, eax\n\tret\n\tdefword_end\n\n\tdefword \"dnegate\", 0, WORD_DNEGATE, WORD_INLINE_COMMA\n\tPICKDSP eax, 0\n\tnot eax\n\tnot ebx\n\tadd eax, 1\n\tadc ebx, 0\n\tPUTDSP eax, 0\n\tret\n\tdefword_end\n\n\tdefword \"dabs\", 0, WORD_DABS, WORD_INLINE_COMMA\n\ttest ebx, ebx\n\tif l\n\t\tPICKDSP eax, 0\n\t\tnot eax\n\t\tnot ebx\n\t\tadd eax, 1\n\t\tadc ebx, 0\n\t\tPUTDSP eax, 0\n\tendif\n\tret\n\tdefword_end\n\n\tdefword \"dmax\", 0, WORD_DMAX, WORD_INLINE_COMMA\n\tPICKDSP ecx, 8\n\tPICKDSP edx, 4\n\tPICKDSP eax, 0\n\tADDDSP 8\n\tmov esi, ecx\n\tmov edi, edx\n\tsub esi, eax\n\tsbb edi, ebx\n\tif l\n\t\tPUTDSP eax, 0\n\telse\n\t\tmov ebx, edx\n\tendif\n\tret\n\tdefword_end\n\n\tdefword \"dmin\", 0, WORD_DMIN, WORD_INLINE_COMMA\n\tPICKDSP ecx, 8\n\tPICKDSP edx, 4\n\tPICKDSP eax, 0\n\tADDDSP 8\n\tmov esi, ecx\n\tmov edi, edx\n\tsub esi, eax\n\tsbb edi, ebx\n\tif ge\n\t\tPUTDSP eax, 0\n\telse\n\t\tmov ebx, edx\n\tendif\n\tret\n\tdefword_end\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n; double precision comparision words\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\tdefword \"d0=\", 0, WORD_DZEQ, WORD_INLINE_COMMA\n\tor ebx, [ebp]\n\tsetz bl\n\tADDDSP 4\n\tmovzx ebx, bl\n\tneg ebx\n\tret\n\tdefword_end\n\n\tdefword \"d0<>\", 0, WORD_DZNEQ, WORD_INLINE_COMMA\n\tor ebx, [ebp]\n\tsetnz bl\n\tADDDSP 4\n\tmovzx ebx, bl\n\tneg ebx\n\tret\n\tdefword_end\n\n\tdefword \"d0<\", 0, WORD_DZLT, WORD_INLINE_COMMA\n\ttest ebx, ebx\n\tsetl bl\n\tADDDSP 4\n\tmovzx ebx, bl\n\tneg ebx\n\tret\n\tdefword_end\n\n\tdefword \"d=\", 0, WORD_DEQ, WORD_INLINE_COMMA\n\tPICKDSP ecx, 8\n\tPICKDSP eax, 4\n\tsub ecx, [ebp]\n\tsbb eax, ebx\n\tsetz bl\n\tADDDSP 12\n\tmovzx ebx, bl\n\tneg ebx\n\tret\n\tdefword_end\n\n\tdefword \"d<>\", 0, WORD_DNEQ, WORD_INLINE_COMMA\n\tPICKDSP ecx, 8\n\tPICKDSP eax, 4\n\tsub ecx, [ebp]\n\tsbb eax, ebx\n\tsetnz bl\n\tADDDSP 12\n\tmovzx ebx, bl\n\tneg ebx\n\tret\n\tdefword_end\n\n\tdefword \"d<\", 0, WORD_DLT, WORD_INLINE_COMMA\n\tPICKDSP ecx, 8\n\tPICKDSP eax, 4\n\tsub ecx, [ebp]\n\tsbb eax, ebx\n\tsetl bl\n\tADDDSP 12\n\tmovzx ebx, bl\n\tneg ebx\n\tret\n\tdefword_end\n\n\tdefword \"du<\", 0, WORD_DULT, WORD_INLINE_COMMA\n\tPICKDSP ecx, 8\n\tPICKDSP eax, 4\n\tsub ecx, [ebp]\n\tsbb eax, ebx\n\tsetb bl\n\tADDDSP 12\n\tmovzx ebx, bl\n\tneg ebx\n\tret\n\tdefword_end\n\n;;;;;;;;;;;;;;;;;;;;;;;\n; mixed precision words\n;;;;;;;;;;;;;;;;;;;;;;;\n\n\tdefword \"m+\", 0, WORD_MPLUS, WORD_INLINE_COMMA\n\tPICKDSP eax, 4\n\tPICKDSP edx, 0\n\tadd eax, ebx\n\tadc edx, 0\n\tPUTDSP eax, 4\n\tmov ebx, edx\n\tADDDSP 4\n\tret\n\tdefword_end\n\n\tdefword \"m-\", 0, WORD_MMINUS, WORD_INLINE_COMMA\n\tPICKDSP eax, 4\n\tPICKDSP edx, 0\n\tsub eax, ebx\n\tsbb edx, 0\n\tPUTDSP eax, 4\n\tmov ebx, edx\n\tADDDSP 4\n\tret\n\tdefword_end\n\n\tdefword \"m*\", 0, WORD_MULSTAR, WORD_INLINE_COMMA\n\tPICKDSP eax, 0\n\timul ebx\n\tPUTDSP eax, 0\n\tmov ebx, edx\n\tret\n\tdefword_end\n\n\tdefword \"m/\", 0, WORD_MSLASH, WORD_INLINE_COMMA\n\tPICKDSP eax, 4\n\tPICKDSP edx, 0\n\tidiv ebx\n\tmov ebx, eax\n\tADDDSP 8\n\tret\n\tdefword_end\n\n\tdefword \"um*\", 0, WORD_UMULSTAR, WORD_INLINE_COMMA\n\tPICKDSP eax, 0\n\tmul ebx\n\tPUTDSP eax, 0\n\tmov ebx, edx\n\tret\n\tdefword_end\n\n\tdefword \"um/mod\", 0, WORD_UMDIVMOD, WORD_INLINE_COMMA\n\tPICKDSP eax, 4\n\tPICKDSP edx, 0\n\tdiv ebx\n\tPUTDSP edx, 4\n\tmov ebx, eax\n\tADDDSP 4\n\tret\n\tdefword_end\n\n\tdefword \"fm/mod\", 0, WORD_FMDIVMOD, WORD_INLINE_COMMA\n\tPICKDSP edx, 0\n\tPICKDSP eax, 4\n\tmov ecx, ebx\n\tADDDSP 4\n\txor ecx, edx\n\tidiv ebx\n\ttest ecx, ecx\n\tif s\n\t\ttest edx, edx\n\t\tif nz\n\t\t\tdec eax\n\t\t\tadd edx, ebx\n\t\tendif\n\tendif\n\tPUTDSP edx, 0\n\tmov ebx, eax\n\tret\n\tdefword_end\n\n\tdefword \"sm/rem\", 0, WORD_SMDIVREM, WORD_INLINE_COMMA\n\tPICKDSP eax, 4\n\tPICKDSP edx, 0\n\tidiv ebx\n\tPUTDSP edx, 4\n\tmov ebx, eax\n\tADDDSP 4\n\tret\n\tdefword_end\n\n\tdefword \"u/mod\", 0, WORD_UDIVMOD, WORD_INLINE_COMMA\n\txor edx, edx\n\tPICKDSP eax, 0\n\tdiv ebx\n\tPUTDSP edx, 0\n\tmov ebx, eax\n\tret\n\tdefword_end\n\n\tdefword \"dm*\", 0, WORD_DMULSTAR, WORD_CALL_COMMA\n\tcall WORD_TUCK\n\tcall WORD_MULL\n\tTORSP\n\tcall WORD_UMULSTAR\n\tFROMRSP\n\tcall WORD_ADD\n\tret\n\tdefword_end\n\n;;;;;;;;;;;;;;;;;;;;\n; control flow words\n;;;;;;;;;;;;;;;;;;;;\n\n\tdefword \"branch\", 0, WORD_BRANCH, WORD_INLINE_COMMA\ni_jmp:\n\tjmp strict near i_ret\n\tret\n\tdefword_end\n\n\tdefword \"0branch\", 0, WORD_ZBRANCH, WORD_INLINE_COMMA\n\tmov eax, ebx\n\tPOPDSP ebx\n\ttest eax, eax\n\tjz strict near i_jmp\n\tret\n\tdefword_end\n\n\tdefword \"exit\", 0, WORD_EXIT, WORD_EXIT_COMMA\ni_ret:\n\tret\n\tdefword_end\n\n\tdefword \"exit,\", 0, WORD_EXIT_COMMA, WORD_CALL_COMMA\n\tmov edi, [var_WORD_DP]\n\tsub edi, 5\n\tcmp edi, [lastcall]\t; are we just after a call instruction ?\n\tif z\n\t\tmov al, [i_jmp]\n\t\tmov [edi], al\t; change it to a jmp\n\tendif\n\tmov edi, [var_WORD_DP]\n\tmov al, [i_ret]\n\tstosb\n\tmov [var_WORD_DP], edi\n\tPOPDSP ebx\n\tret\n\tdefword_end\n\n\tdefword \"execute\", 0, WORD_EXECUTE, WORD_CALL_COMMA\n\tmov eax, ebx\t; Get xt into eax\n\tPOPDSP ebx\t\t; After xt runs its ret will continue executing the current word.\n\tjmp eax\t\t\t; and jump to it.\n\tdefword_end\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;\n; terminal input words\n;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\tdefword \"read-char\", 0, WORD_READCHAR, WORD_CALL_COMMA\n\tmov ecx, var_WORD_CHARBUF\t; 2nd param: buffer\n\tmov edx, 1\t\t\t\t\t; 3rd param: max length\n\tpush edx\n\tpush ecx\n\tpush ebx\n\tmov eax, SYS_read\t\t\t; syscall: read\n\tcall _syscall\n\tadd esp, 12\n\txor ebx, ebx\n\ttest eax, eax\n\tif be\n\t\tmov ebx, -1\n\tendif\n\tret\n\tdefword_end\n\n\tdefword \"read-line\", 0, WORD_READLINE, WORD_CALL_COMMA\n\tcall WORD_NROT\n\tcall WORD_OVER\n\tcall WORD_ADD\n\tcall WORD_OVER\t\t; ( fd start end cur )\nreadline_l1:\n\tPICKDSP eax, 0\n\tcmp ebx, eax\n\tjz readline_l4\n\tPUSHDSP ebx\n\tPICKDSP ebx, 12\n\tcall WORD_READCHAR\n\ttest ebx, ebx\n\tjz readline_l2\n\tcall WORD_DROP\n\tcall WORD_DROP2\n\tcall WORD_DROP2\n\tLOADTOS 0\n\tLOADTOS 0\n\tLOADTOS -1\n\tjmp readline_l5\nreadline_l2:\n\tmov ebx, [var_WORD_CHARBUF]\n\tcmp ebx, 10\t\t\t; LF\n\tjz readline_l3\n\tcall WORD_OVER\n\tcall WORD_STOREBYTE\n\tcall WORD_INCR\n\tjmp readline_l1\nreadline_l3:\n\tcall WORD_DROP\nreadline_l4:\n\tcall WORD_NIP\n\tcall WORD_SWAP\n\tcall WORD_SUB\n\tcall WORD_NIP\n\tLOADTOS -1\n\tLOADTOS 0\nreadline_l5:\n\tret\n\tdefword_end\n\n\tdefword \"key\", 0, WORD_KEY, WORD_CALL_COMMA\n\tPUSHDSP ebx\n\txor ebx, ebx\t\t; stdin\n\tcall WORD_READCHAR\n\tmov ebx, [var_WORD_CHARBUF]\n\tret\n\tdefword_end\n\n\tdefword \"accept\", 0, WORD_ACCEPT, WORD_CALL_COMMA\n\tcall WORD_OVER\n\tcall WORD_ADD\n\tcall WORD_OVER\t; ( start end cur )\naccept_l1:\n\tcall WORD_KEY\n\tcmp ebx, 127\t; BS\n\tjz accept_l2\n\tcmp ebx, 10\t\t; LF\n\tjz accept_l3\n\tcall WORD_OVER\t; ( start end cur key cur )\n\tcall WORD_STOREBYTE\n\tcall WORD_INCR\t; ( start end cur' )\n\tPICKDSP eax, 0\n\tcmp ebx, eax\n\tjz accept_l4\n\tjmp accept_l1\naccept_l2:\n\tPICKDSP eax, 4\t; ( start end cur' )\n\tcmp ebx, eax\n\tjz accept_l1\n\tcall WORD_DECR\n\tjmp accept_l1\naccept_l3:\n\tcall WORD_DROP\t; ( start end cur' )\naccept_l4:\n\tcall WORD_NIP\n\tcall WORD_SWAP\n\tcall WORD_SUB\n\tret\n\tdefword_end\n\n\tdefword \"tabs>spaces\", 0, WORD_TABSTOSPACES, WORD_CALL_COMMA\n\tmov ecx, ebx\n\tPOPDSP esi\n\ttest ecx, ecx\n\tif nz\n\t\trepeat\n\t\t\tlodsb\n\t\t\tcmp al, 9\t;TAB\n\t\t\tif z\n\t\t\t\tmov byte [esi - 1], ' '\n\t\t\tendif\n\t\t\tdec ecx\n\t\tuntil z\n\tendif\n\tPOPDSP ebx\n\tret\n\tdefword_end\n\n;;;;;;;;;;;;;;;;;;;;;;;\n; terminal output words\n;;;;;;;;;;;;;;;;;;;;;;;\n\n\tdefword \"type-fd\", 0, WORD_TYPE_FD, WORD_CALL_COMMA\n\tPICKDSP edx, 0\t\t\t; 3rd param: length of string\n\tPICKDSP ecx, 4\t\t\t; 2nd param: address of string\n\tADDDSP 8\t\t\t\t; 1st param: FD in ebx\n\tmov eax, SYS_write\t\t; write syscall\n\tpush edx\n\tpush ecx\n\tpush ebx\n\tcall _syscall\n\tadd esp, 12\n\tPOPDSP ebx\n\tret\n\tdefword_end\n\n\tdefword \"type\", 0, WORD_TYPE, WORD_CALL_COMMA\n\tLOADTOS 1\t\t\t\t; stdout\n\tcall WORD_TYPE_FD\n\tret\n\tdefword_end\n\n\tdefword \"emit\", 0, WORD_EMIT, WORD_CALL_COMMA\n\tmov [emit_scratch], bl\t; write needs the address of the byte to write\n\tmov ebx, emit_scratch\n\tLOADTOS 1\n\tcall WORD_TYPE\n\tret\n\tdefword_end\n\n;;;;;;;;;;;;;;;;;;;\n; system call words\n;;;;;;;;;;;;;;;;;;;\n\n\tdefword \"syscall\", 0, WORD_SYSCALL, WORD_CALL_COMMA\n\tpop eax\n\tmov [syscallret], eax\t; save return address\n\tmov eax, ebx\t\t\t; System call number (see )\n\tcall _syscall\n\tmov ebx, eax\t\t\t; Result (negative for -errno)\n\tjmp [syscallret]\t\t; return to caller\n\tdefword_end\n\n\tdefword \"lsyscall\", 0, WORD_LSYSCALL, WORD_CALL_COMMA\n\tpop eax\n\tmov [syscallret], eax\t; save return address\n\tmov eax, ebx\t\t\t; System call number (see )\n\tcall _lsyscall\n\tPUSHDSP eax\n\tmov ebx, edx\t\t\t; Result (negative for -errno)\n\tjmp [syscallret]\t\t; return to caller\n\tdefword_end\n\n;;;;;;;;;;;;;;\n; string words\n;;;;;;;;;;;;;;\n\n\tdefword \"count\", 0, WORD_COUNT, WORD_CALL_COMMA\n\txor eax, eax\n\tmov al, [ebx]\n\tinc ebx\n\tLOADTOS eax\n\tret\n\tdefword_end\n\n\tdefword \"-trailing\", 0, WORD_TRAILING, WORD_CALL_COMMA\n\ttest ebx, ebx\n\tif nz\n\t\tPICKDSP esi, 0\n\t\tmov ecx, ebx\n\t\tadd esi, ebx\n\t\tdec esi\n\t\tstd\n\ttrailing_l1:\n\t\tlodsb\n\t\tcmp al, ' '\n\t\tif be\n\t\t\tloop trailing_l1\n\t\tendif\n\t\tmov ebx, ecx\n\t\tcld\n\tendif\n\tret\n\tdefword_end\n\n\tdefword \"/string\", 0, WORD_SSTRING, WORD_CALL_COMMA\n\tmov eax, ebx\n\tPOPDSP ebx\n\tPICKDSP ecx, 0\n\tsub ebx, eax\n\tadd ecx, eax\n\tPUTDSP ecx, 0\n\tret\n\tdefword_end\n\n\tdefword \"compare\", 0, WORD_COMPARE, WORD_CALL_COMMA\n\tPICKDSP esi, 8\n\tPICKDSP edx, 4\n\tPICKDSP edi, 0\n\tADDDSP 12\n\tmov ecx, ebx\n\tcmp edx, ebx\n\tif be\n\t\tmov ecx, edx\n\tendif\n\ttest ecx, ecx\t\t; ecx lowest length\n\tjnz compare_l2\n\tcmp edx, ebx\n\tjz compare_l3\t\t; both are 0 length\n\tjmp compare_l4\t\t; otherwise the longest wins\ncompare_l2:\n\tcmpsb\n\tjnz compare_l4\t\t; chars not same\n\tloop compare_l2\n\tcmp edx, ebx\t\t; all chars same\n\tjnz compare_l4\t\t; strings not same size\ncompare_l3:\n\txor ebx, ebx\t\t; same\n\tjmp compare_l7\ncompare_l4:\n\tja compare_l6\ncompare_l5:\n\tmov ebx, -1\n\tjmp compare_l7\ncompare_l6:\n\tmov ebx, 1\ncompare_l7:\n\tret\n\tdefword_end\n\n\tdefword \"icompare\", 0, WORD_COMPAREI, WORD_CALL_COMMA\n\tPICKDSP esi, 8\n\tPICKDSP edx, 4\n\tPICKDSP edi, 0\n\tADDDSP 12\n\tmov ecx, ebx\n\tcmp edx, ebx\n\tif be\n\t\tmov ecx, edx\n\tendif\n\ttest ecx, ecx\t\t; ecx lowest length\n\tjnz comparei_l2\n\tcmp edx, ebx\n\tjz comparei_l3\t\t; both are 0 length\n\tjmp comparei_l4\t\t; otherwise the longest wins\ncomparei_l2:\n\tmov al, [esi]\n\tmov ah, [edi]\n\tto_lower al\n\tto_lower ah\n\tcmp ah, al\n\tjnz comparei_l4\t\t; chars not same\n\tinc edi\n\tinc esi\n\tloop comparei_l2\n\tcmp edx, ebx\t\t; all chars same\n\tjnz comparei_l4\t\t; strings not same size\ncomparei_l3:\n\txor ebx, ebx\t\t; same\n\tjmp comparei_l7\ncomparei_l4:\n\tja comparei_l6\ncomparei_l5:\n\tmov ebx, -1\n\tjmp comparei_l7\ncomparei_l6:\n\tmov ebx, 1\ncomparei_l7:\n\tret\n\tdefword_end\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n; dictionary searching words\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\tdefword \"find\", 0, WORD_FIND, WORD_CALL_COMMA\n\tcall WORD_DUP\n\tcall WORD_COUNT\n\tcall WORD_FIND_DICT\n\ttest ebx, ebx\n\tif nz\n\t\tmov dl, [ebx + H_NSIZE]\n\t\tcall WORD_TCFA\n\t\tLOADTOS 1\n\t\tand edx, F_IMMED\n\t\tif z\n\t\t\tneg ebx\n\t\tendif\n\t\tcall WORD_ROT\n\t\tcall WORD_DROP\n\tendif\n\tret\n\tdefword_end\n\n\tdefword \"(find)\", 0, WORD_FIND_DICT, WORD_CALL_COMMA\n\tmov ecx, ebx\t\t\t; ecx = length\n\tPOPDSP edi\t\t\t\t; edi = address\n\tPUSHRSP ecx\n\tmov esi, edi\n\tcall strhashi\n\tand ebx, NUM_HASH_CHAINS-1\n\tmov esi, hash_buckets\n\tmov edx, [esi + (ebx * 4)]\n\tPOPRSP ecx\t\t\t\t; edx can now scan back through this hash chain\nfindd_l1:\n\ttest edx, edx\t\t\t; NULL pointer? (end of the linked list)\n\tje findd_l4\n\txor eax, eax\n\tmov al, [edx + H_NSIZE]\t; al = flags+length field\n\tand al, (F_HIDDEN|F_LENMASK)\t; al = name length\n\tcmp al, cl\t\t\t\t; Length is the same?\n\tjne findd_l2\n\tPUSHRSP ecx\t\t\t\t; Save the length\n\tPUSHRSP edi\t\t\t\t; Save the address (repe cmpsb will move this pointer)\n\tlea esi, [edx + H_NAME]\t; Dictionary string we are checking against.\n\tcall strcmpi\n\tPOPRSP edi\n\tPOPRSP ecx\n\tjne findd_l2\t\t\t; Not the same.\n\tmov ebx, edx\n\tret\nfindd_l2:\n\tmov edx, [edx + H_HLINK]\t; Move back through the link field to the previous word\n\tjmp findd_l1\t\t\t; .. and loop.\nfindd_l4:\n\txor ebx, ebx\t\t\t; Return zero to indicate not found.\n\tret\n\tdefword_end\n\n\tdefword \">cfa\", 0, WORD_TCFA, WORD_CALL_COMMA\n\tadd ebx, H_NSIZE\n\tmov al, [ebx]\t\t\t; Load flags+len into al.\n\tinc ebx\t\t\t\t\t; skip flags+len byte.\n\tand eax, F_LENMASK\t\t; Just the length, not the flags.\n\tadd ebx, eax\t\t\t; skip the name\n\tadd ebx, XT_SIZE\t\t; skip to the xt\n\tret\n\tdefword_end\n\n\tdefword \"(bucket)\", 0, WORD_BUCKET, WORD_CALL_COMMA\n\tmov ecx, ebx\t\t; ecx = length\n\tPOPDSP ebx\t\t\t; ebx = address of name\n\tPUSHRSP esi\n\tmov esi, ebx\n\tcall strhashi\n\tand ebx, NUM_HASH_CHAINS-1\n\tmov esi, hash_buckets\n\tlea ebx, [esi + (ebx * 4)]\n\tPOPRSP esi\n\tret\n\tdefword_end\n\n\tdefword \"unused\", 0, WORD_UNUSED, WORD_CALL_COMMA\n\tLOADTOS forth_end\n\tLOADTOS [var_WORD_DP]\n\tcall WORD_SUB\n\tret\n\tdefword_end\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;\n; dictionary building words\n;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\tdefword \"align\", 0, WORD_ALIGNDP, WORD_CALL_COMMA\n\tmov eax, [var_WORD_DP]\n\tALIGNREG eax\n\tmov [var_WORD_DP], eax\n\tret\n\tdefword_end\n\n\tdefword \"header,\", 0, WORD_HEADER_COMMA, WORD_CALL_COMMA\n\tmov ecx, ebx\t\t\t\t; ecx = length\n\tPOPDSP ebx\t\t\t\t\t; ebx = address of name\n\tcall WORD_ALIGNDP\t\t\t; align header\n\tmov edi, [var_WORD_DP]\t\t; edi is the address of the header\n\tmov eax, [var_WORD_LATEST]\t; Get link pointer\n\tmov [edi + H_LLINK], eax\t; and store it in the header.\n\tmov [var_WORD_LATEST], edi\n\tPUSHRSP ebx\t\t\t\t\t; hash chain\n\tPUSHRSP ecx\n\tmov esi, ebx\n\tcall strhashi\n\tand ebx, NUM_HASH_CHAINS-1\n\tmov esi, hash_buckets\n\tmov eax, [esi + (ebx * 4)]\n\tmov [esi + (ebx * 4)], edi\n\tmov [edi + H_HLINK], eax\t; and store it in the header.\n\tPOPRSP ecx\n\tPOPRSP esi\n\tmov [edi + H_NSIZE], cl\t\t; Store the length/flags byte.\n\tadd edi, H_NAME\n\tcall strcpyi\n\tmov ecx, XT_SIZE\n\txor eax, eax\n\trep stosb\t\t\t\t\t; clear the gap till the xt\n\tmov [var_WORD_DP], edi\n\tmov long [edi + XT_COMPILE], WORD_CALL_COMMA\t;compile action\n\tPOPDSP ebx\n\tret\n\tdefword_end\n\n\tdefword \"lit,\", 0, WORD_LIT_COMMA, WORD_CALL_COMMA\n\tmov esi, litc_l1\n\tmov edi, [var_WORD_DP]\n\tmov ecx, litc_l2 - litc_l1 - 4\n\trep movsb\n\tmov [var_WORD_DP], edi\n\tret\n\tdefword_end\nlitc_l1:\n\tLOADTOS 0xBAADF00D\nlitc_l2:\n\n\tdefword \"slits\", 0, WORD_SLITS, WORD_CALL_COMMA\n\tPUSHDSP ebx\n\tPOPRSP esi\n\txor eax, eax\n\tlodsb\t\t\t\t; get the length of the string\n\tPUSHDSP esi\t\t\t; push the address of the start of the string\n\tmov ebx, eax\t\t; push length on the stack\n\tadd esi, eax\t\t; skip past the string\n \tjmp esi\n\tdefword_end\n\n\tdefword \"clits\", 0, WORD_CLITS, WORD_CALL_COMMA\n\tFROMRSP\n\txor eax, eax\n\tmov al, [ebx]\n\tlea eax, [ebx + eax + 1]\n \tjmp eax\n\tdefword_end\n\n\tdefword \",\", 0, WORD_COMMA, WORD_CALL_COMMA\n\tmov edi, [var_WORD_DP]\t; DP\n\tmov eax, ebx\n\tstosd\t\t\t\t\t; Store it.\n\tmov [var_WORD_DP], edi\t; Update DP (incremented)\n\tPOPDSP ebx\n\tret\n\tdefword_end\n\n\tdefword \"c,\", 0, WORD_CHAR_COMMA, WORD_CALL_COMMA\n\tmov eax, ebx\n\tmov edi, [var_WORD_DP]\t; DP\n\tstosb\t\t\t\t\t; Store it.\n\tmov [var_WORD_DP], edi\t; Update DP (incremented)\n\tPOPDSP ebx\n\tret\n\tdefword_end\n\n\tdefword \":\", 0, WORD_COLON, WORD_CALL_COMMA\n\tcall WORD_PARSENAME\n\tcall WORD_HEADER_COMMA\t; Create the dictionary entry / header\n\tmov eax, [var_WORD_DP]\n\tmov [eax + XT_BODY], eax\n\tcall WORD_LATEST\n\tcall WORD_FETCH\n\tcall WORD_HIDDEN\t\t; Make the word hidden\n\tcall WORD_RBRAC\t\t\t; Go into compile mode.\n\tret\n\tdefword_end\n\n\tdefword \"create\", 0, WORD_CREATE, WORD_CALL_COMMA\n\tcall WORD_PARSENAME\n\tcall WORD_HEADER_COMMA\n\tmov esi, create_l1\n\tmov edi, [var_WORD_DP]\n\tPUSHRSP edi\n\tmov ecx, create_l4 - create_l1\n\trep movsb\n\tmov [var_WORD_DP], edi\n\tmov edx, edi\n\tcall WORD_ALIGNDP\n\tPOPRSP eax\n\tmov edi, [var_WORD_DP]\n\tsub edx, eax\n\tmov [eax + create_l2 - create_l1 - 4], edi\n\tmov [eax + XT_BODY], edi\n\tmov [eax + XT_LENGTH], edx\n\tret\n\tdefword_end\ncreate_l1:\n\tLOADTOS 0xBAADF00D\ncreate_l2:\n\tcall strict near create_l3\ncreate_l3:\n\tret\ncreate_l4:\n\n\tdefword \"dodoes\", 0, WORD_DODOES, WORD_CALL_COMMA\n\tcall WORD_LATEST\n\tcall WORD_FETCH\n\tcall WORD_TCFA\n\tadd ebx, create_l3 - create_l1 - 4\n\tPOPDSP eax\n\tsub eax, ebx\n\tsub eax, 4\n\tmov [ebx], eax\n\tPOPDSP ebx\n\tret\n\tdefword_end\n\n\tdefword \"does>\", F_IMMED, WORD_DOES, WORD_CALL_COMMA\n\tcall WORD_LIT_COMMA\n\tLOADTOS [var_WORD_DP]\n\tadd ebx, 10\n\tcall WORD_COMMA\n\tLOADTOS WORD_DODOES\n\tcall WORD_COMPILE_COMMA\n\tLOADTOS 0\n\tmov bl, [does_l1]\n\tcall WORD_CHAR_COMMA\ndoes_l1:\n\tret\n\tdefword_end\n\n\tdefword \"postpone\", F_IMMED, WORD_POSTPONE, WORD_CALL_COMMA\n\tcall WORD_PARSENAME\n\tcall WORD_FIND_DICT\n\tmov dl, [ebx + H_NSIZE]\n\tcall WORD_TCFA\n\tand edx, F_IMMED\n\tif z\n\t\tcall WORD_LIT_COMMA\n\t\tcall WORD_COMMA\n\t\tLOADTOS WORD_COMPILE_COMMA\n\tendif\n\tjmp WORD_COMPILE_COMMA\n\tret\n\tdefword_end\n\n\tdefword \"call,\", 0, WORD_CALL_COMMA, WORD_CALL_COMMA\n\tmov edi, [var_WORD_DP]\n\tmov [lastcall], edi\t; record last location of last call\n\tmov esi, i_call\n\tmovsb\n\tmov eax, ebx\n\tsub eax, 4\n\tsub eax, edi\n\tstosd\n\tmov [var_WORD_DP], edi\n\tPOPDSP ebx\n\tret\n\tdefword_end\n\n\tdefword \"inline,\", 0, WORD_INLINE_COMMA, WORD_CALL_COMMA\n\tmov ecx, [ebx + XT_LENGTH]\n\tdec ecx\t\t\t\t\t; actual code length minus ret\n\tmov esi, ebx\n\tmov edi, [var_WORD_DP]\n\trep movsb\t\t\t\t; inline copy the code\n\tmov [var_WORD_DP], edi\t; update DP\n\tPOPDSP ebx\n\tret\n\tdefword_end\n\n\tdefword \"compile,\", 0, WORD_COMPILE_COMMA, WORD_INLINE_COMMA\n\tcall [ebx + XT_COMPILE]\n\tret\n\tdefword_end\n\n\tdefword \";\", F_IMMED, WORD_SEMICOLON, WORD_CALL_COMMA\n\tLOADTOS WORD_EXIT\ni_call:\n\tcall strict near WORD_COMPILE_COMMA\n\tcall WORD_LATEST\n\tcall WORD_FETCH\n\tcall WORD_HIDDEN\t\t\t; toggle hidden flag -- unhide the word (see below for definition).\n\tcall WORD_LBRAC\t\t\t\t; go back to IMMEDIATE mode.\n\tmov edx, ebx\n\tmov ebx, [var_WORD_LATEST]\n\tcall WORD_TCFA\n\tmov ecx, [var_WORD_DP]\n\tsub ecx, ebx\n\tmov [ebx + XT_LENGTH], ecx\t; set code size of word\n\tmov ebx, edx\n\tret\n\tdefword_end\n\n\tdefword \"immediate\", 0, WORD_IMMEDIATE, WORD_CALL_COMMA\n\tmov edi, [var_WORD_LATEST]\t; LATEST word.\n\tadd edi, H_NSIZE\t\t\t; Point to name/flags byte.\n\txor byte [edi], F_IMMED\t\t; Toggle the IMMED bit.\n\tret\n\tdefword_end\n\n\tdefword \"hidden\", 0, WORD_HIDDEN, WORD_CALL_COMMA\n\tadd ebx, H_NSIZE\t\t\t; Point to name/flags byte.\n\txor byte [ebx], F_HIDDEN\t; Toggle the HIDDEN bit.\n\tPOPDSP ebx\n\tret\n\tdefword_end\n\n\tdefword \"[\", F_IMMED, WORD_LBRAC, WORD_CALL_COMMA\n\tmov long [var_WORD_STATE], 0\t; Set STATE to 0.\n\tret\n\tdefword_end\n\n\tdefword \"]\", 0, WORD_RBRAC, WORD_CALL_COMMA\n\tmov long [var_WORD_STATE], 1\t; Set STATE to 1.\n\tret\n\tdefword_end\n\n;;;;;;;;;;;;;;;;;;;;;\n; source buffer words\n;;;;;;;;;;;;;;;;;;;;;\n\n\tdefword \"source\", 0, WORD_SOURCE, WORD_CALL_COMMA\n\tcall WORD_INHASH\n\tcall WORD_FETCH2\n\tret\n\tdefword_end\n\n\tdefword \"refill\", 0, WORD_REFILL, WORD_CALL_COMMA\n\tLOADTOS tib_buffer\n\tcall WORD_LINESIZE\t; ( tib len )\n\tcall WORD_OVER\n\tcall WORD_SWAP\t\t; ( tib tib len )\n\tcall WORD_ACCEPT\t; read line into TIB\n\tcall WORD_DUP2\n\tcall WORD_TABSTOSPACES\n\tcall WORD_INHASH\n\tcall WORD_STORE2\t; set as current WORD_SOURCE\n\tLOADTOS 0\n\tcall WORD_TOIN\n\tcall WORD_STORE\t\t; set to start of buffer\n\tLOADTOS -1\n\tret\n\tdefword_end\n\n\tdefword \"isspace?\", 0, WORD_ISSPACE, WORD_CALL_COMMA\n\tLOADTOS ' '\n\tcall WORD_ULTEQ\n\tret\n\tdefword_end\n\n\tdefword \"isnotspace?\", 0, WORD_ISNOTSPACE, WORD_CALL_COMMA\n\tcall WORD_ISSPACE\n\tcall WORD_ZEQ\n\tret\n\tdefword_end\n\n\tdefword \"xt-skip\", 0, WORD_XTSKIP, WORD_CALL_COMMA\n\tTORSP\nxtskip_l1:\n\ttest ebx, ebx\n\tjz xtskip_l3\n\tcall WORD_OVER\n\tcall WORD_FETCHBYTE\n\tFETCHRSP\n\tcall WORD_EXECUTE\n\ttest ebx, ebx\n\tjz xtskip_l2\n\tmov ebx, 1\n\tcall WORD_SSTRING\n\tjmp xtskip_l1\nxtskip_l2:\n\tcall WORD_DROP\nxtskip_l3:\n\tADDRSP 4\n\tret\n\tdefword_end\n\n;;;;;;;;;;;;;;;;;;;;;;\n; input parseing words\n;;;;;;;;;;;;;;;;;;;;;;\n\n\tdefword \"parse-name\", 0, WORD_PARSENAME, WORD_CALL_COMMA\n\tcall WORD_SOURCE\n\tcall WORD_TOIN\n\tcall WORD_FETCH\n\tcall WORD_SSTRING\n\tLOADTOS WORD_ISSPACE\n\tcall WORD_XTSKIP\n\tcall WORD_OVER\n\tTORSP\n\tLOADTOS WORD_ISNOTSPACE\n\tcall WORD_XTSKIP\n\tcall WORD_DUP2\n\tLOADTOS 1\n\tcall WORD_MIN\n\tcall WORD_ADD\n\tcall WORD_SOURCE\n\tcall WORD_DROP\n\tcall WORD_SUB\n\tcall WORD_TOIN\n\tcall WORD_STORE\n\tcall WORD_DROP\n\tFROMRSP\n\tcall WORD_TUCK\n\tcall WORD_SUB\n; code to print out \"P CR\"\n;LOADTOS 80\n;call WORD_EMIT\n;LOADTOS 32\n;call WORD_EMIT\n;call WORD_DUP2\n;call WORD_TYPE\n;LOADTOS 10\n;call WORD_EMIT\n\tret\n\tdefword_end\n\n\tdefword \"word-name\", 0, WORD_WORDNAME, WORD_CALL_COMMA\n\tcall WORD_PARSENAME\t\t; ( start len )\n\tLOADTOS word_buf\t\t; ( string size buf )\n\tcall WORD_DUP2\t\t\t; ( string size buf size buf )\n\tcall WORD_STOREBYTE\t\t; ( string size buf )\n\tcall WORD_INCR\t\t\t; ( string size buf+1 )\n\tcall WORD_SWAP\t\t\t; ( string buf+1 size )\n\tcall WORD_CMOVE\n\tLOADTOS word_buf\t\t; ( cstring )\n; debug code to print out \"N CR\"\n;LOADTOS 78\n;call WORD_EMIT\n;LOADTOS 32\n;call WORD_EMIT\n;call WORD_DUP2\n;call WORD_TYPE\n;LOADTOS 10\n;call WORD_EMIT\n\tret\n\tdefword_end\n\n\tdefword \"interp-name\", 0, WORD_INTERPNAME, WORD_CALL_COMMA\n\tcall WORD_PARSENAME\t\t\t; ( start len )\n\tLOADTOS intep_name_buf\t\t; ( string size buf )\n\tcall WORD_DUP2\t\t\t\t; ( string size buf size buf )\n\tcall WORD_STOREBYTE\t\t\t; ( string size buf )\n\tcall WORD_INCR\t\t\t\t; ( string size buf+1 )\n\tcall WORD_SWAP\t\t\t\t; ( string buf+1 size )\n\tcall WORD_CMOVE\n\tLOADTOS intep_name_buf\t\t;( cstring )\n\tret\n\tdefword_end\n\n\tdefword \"interpret\", 0, WORD_INTERPRET, WORD_CALL_COMMA\n\tloopstart\n\t\tcall WORD_INTERPNAME\n\t\tmov al, [ebx]\n\t\ttest al, al\n\t\tbreakif z\n\t\t; debug code to print out \"I CR\"\n\t\t;LOADTOS 73\n\t\t;call WORD_EMIT\n\t\t;LOADTOS 32\n\t\t;call WORD_EMIT\n\t\t;call WORD_DUP\n\t\t;call WORD_COUNT\n\t\t;call WORD_TYPE\n\t\t;LOADTOS 10\n\t\t;call WORD_EMIT\n\t\tcall WORD_INTERP\n\tloopend\n\tcall WORD_DROP\n\tret\n\tdefword_end\n\n\tdefword \"interp\", 0, WORD_INTERP, WORD_CALL_COMMA\n\tcall WORD_FIND\t\t\t\t; ( cstring 0 | xt 1 | xt | -1 )\n\tmov eax, ebx\n\tPOPDSP ebx\n\ttest eax, eax\n\tjz tryasnumber\n\tjle nonimediate\nexecuteword:\n\tmov eax, ebx\n\tPOPDSP ebx\n\tjmp eax\nnonimediate:\n\tmov eax, [var_WORD_STATE]\n\ttest eax, eax\t\t\t\t; are we in imedeate mode ?\n\tjz executeword\n\tjmp WORD_COMPILE_COMMA\t\t; compile xt\ntryasnumber:\n\tcall WORD_COUNT\t\t\t\t; ( adr len )\n\tLOADTOS 0\n\tLOADTOS 0\n\tcall WORD_SWAP2\t\t\t\t; ( 0d addr len )\n\tcall WORD_TOSNUMBER\t\t\t; ( d addr len )\n\ttest ebx, ebx\n\tjnz parseproblem\n\tcall WORD_DROP2\n\tcall WORD_DROP\t\t\t\t; ( num )\n\tmov eax, [var_WORD_STATE]\n\ttest eax, eax\n\tif nz\n\t\tcall WORD_LIT_COMMA\t\t; compile LIT\n\t\tcall WORD_COMMA\t\t\t; compile value\n\tendif\n\tret\nparseproblem:\n\tLOADTOS errmsg\n\tLOADTOS errmsgend - errmsg\n\tLOADTOS 2\n\tcall WORD_TYPE_FD\n\tLOADTOS errmsgnl\n\tLOADTOS 1\n\tLOADTOS 2\n\tcall WORD_TYPE_FD\n\tLOADTOS tib_buffer\n\tLOADTOS [var_WORD_TOIN]\n\tLOADTOS 2\n\tcall WORD_TYPE_FD\n\tLOADTOS errmsgnl\n\tLOADTOS 1\n\tLOADTOS 2\n\tcall WORD_TYPE_FD\n\tcall WORD_DROP2\n\tcall WORD_DROP2\n\tret\n\tdefword_end\n\n\tdefword \">number\", 0, WORD_TONUMBER, WORD_CALL_COMMA\n\tcall WORD_OVER\n\tcall WORD_ADD\n\tcall WORD_SWAP\t\t\t; ( ud end cur )\ntonumber_l1:\n\tPICKDSP eax, 0\n\tcmp ebx, eax\n\tjz near tonumber_l4\n\tcall WORD_DUP\n\tcall WORD_FETCHBYTE\t\t; ( ud end cur char )\n\tto_lower ebx\n\tsub ebx, byte '0'\n\tjb tonumber_l3\t\t\t; < '0'?\n\tcmp ebx, byte 10\n\tjb tonumber_l2\t\t\t; <= '9' ?\n\tsub ebx, byte 'a' - '0'\n\tjb tonumber_l3\t\t\t; < 'a' ?\n\tadd ebx, byte 10\ntonumber_l2:\n\tcmp ebx, [var_WORD_BASE]\n\tjge tonumber_l3\t\t\t; >= WORD_BASE ?\n\tTORSP\n\tcall WORD_SWAP2\t\t\t; ( end cur ud )\n\tLOADTOS [var_WORD_BASE]\n\tcall WORD_DMULSTAR\n\tFROMRSP\n\tcall WORD_MPLUS\t\t\t; ( end cur ud' )\n\tcall WORD_SWAP2\n\tcall WORD_INCR\t\t\t; ( ud' end cur' )\n\tjmp tonumber_l1\ntonumber_l3:\n\tcall WORD_DROP\ntonumber_l4:\n\tcall WORD_SWAP\n\tcall WORD_OVER\n\tcall WORD_SUB\t\t\t; ( ud' c-addr u2 )\n\tret\n\tdefword_end\n\n\tdefword \">snumber\", 0, WORD_TOSNUMBER, WORD_CALL_COMMA\n\ttest ebx, ebx\n\tif nz\n\t\tPICKDSP eax, 0\n\t\tmov cl, [eax]\n\t\tcmp cl, '-'\n\t\tjnz WORD_TONUMBER\t; not '-'\n\t\tinc eax\n\t\tPUTDSP eax, 0\n\t\tdec ebx\n\t\tcall WORD_TONUMBER\n\t\tcall WORD_SWAP2\n\t\tcall WORD_DNEGATE\n\t\tcall WORD_SWAP2\n\tendif\n\tret\n\tdefword_end\n\n;;;;;;;;;;;\n; tick word\n;;;;;;;;;;;\n\n\tdefword \"ticks\", 0, WORD_TICKS, WORD_CALL_COMMA\n\tsub ebp, byte 8\n\trdtsc\n\tmov [byte ebp -4], ebx\n\tmov [ebp], eax\n\tmov ebx, edx\n\tret\n\tdefword_end\n\n;;;;;;;;;;;\n; test word\n;;;;;;;;;;;\n\n\tdefword \"test\", 0, WORD_TEST, WORD_CALL_COMMA\n\tret\n\tdefword_end\n\n;;;;;;;;;;;;;;;;;\n; read/write data\n;;;;;;;;;;;;;;;;;\n\n\talign 4\nsyscallret:\n\t; return address saved by syscall\n\tdd 0\nlastcall:\n\t; last call layed down by compiler\n\tdd 0\n\ntib_buffer:\n\t; keyboard input buffer\n\ttimes MAX_LINE_SIZE db 0\nword_buf:\n\t; static buffer where WORD returns. Subsequent calls\n\t; overwrite this buffer.\n\ttimes MAX_LINE_SIZE db 0\nintep_name_buf:\n\t; static buffer where INTERPNAME returns. Subsequent calls\n\t; overwrite this buffer.\n\ttimes MAX_LINE_SIZE db 0\nemit_scratch:\n\t; scratch used by EMIT\n\tdb 0\nerrmsg:\n\tdb \"PARSE ERROR:\"\nerrmsgend:\nerrmsgnl:\n\tdb 10\nbootfile:\n\tdb \"forth.f\"\n\tdb 0\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n; dictionary hash table (64)\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\talign 4\nhash_buckets:\n\tdd 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0\n\tdd 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0\n\tdd 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0\n\tdd 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n; addresses of all built in dictionary words.\n; this ends up as part of the user space after booting !\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\talign 4\ndictionary_start:\n\tdd dic_WORD_ABS\n\tdd dic_WORD_ACCEPT\n\tdd dic_WORD_ADD\n\tdd dic_WORD_ADDBYTE\n\tdd dic_WORD_ADDSTORE\n\tdd dic_WORD_ALIGNDP\n\tdd dic_WORD_AND\n\tdd dic_WORD_BASE\n\tdd dic_WORD_BLANK\n\tdd dic_WORD_BLK\n\tdd dic_WORD_BRANCH\n\tdd dic_WORD_BUCKET\n\tdd dic_WORD_CALL_COMMA\n\tdd dic_WORD_CHARBUF\n\tdd dic_WORD_CHAR_COMMA\n\tdd dic_WORD_CLITS\n\tdd dic_WORD_CMOVE\n\tdd dic_WORD_CMOVEB\n\tdd dic_WORD_COLON\n\tdd dic_WORD_COMMA\n\tdd dic_WORD_COMPARE\n\tdd dic_WORD_COMPAREI\n\tdd dic_WORD_COMPILE_COMMA\n\tdd dic_WORD_COUNT\n\tdd dic_WORD_CREATE\n\tdd dic_WORD_D2SLASH\n\tdd dic_WORD_D2STAR\n\tdd dic_WORD_DABS\n\tdd dic_WORD_DECR\n\tdd dic_WORD_DECR2\n\tdd dic_WORD_DECR4\n\tdd dic_WORD_DEQ\n\tdd dic_WORD_DIV\n\tdd dic_WORD_DIVMOD\n\tdd dic_WORD_DLT\n\tdd dic_WORD_DMAX\n\tdd dic_WORD_DMIN\n\tdd dic_WORD_DMINUS\n\tdd dic_WORD_DMULSTAR\n\tdd dic_WORD_DNEGATE\n\tdd dic_WORD_DNEQ\n\tdd dic_WORD_DODOES\n\tdd dic_WORD_DOES\n\tdd dic_WORD_DP\n\tdd dic_WORD_DPLUS\n\tdd dic_WORD_DROP\n\tdd dic_WORD_DROP2\n\tdd dic_WORD_DSPFETCH\n\tdd dic_WORD_DSPSTORE\n\tdd dic_WORD_DTOS\n\tdd dic_WORD_DULT\n\tdd dic_WORD_DUP\n\tdd dic_WORD_DUP2\n\tdd dic_WORD_DZEQ\n\tdd dic_WORD_DZLT\n\tdd dic_WORD_DZNEQ\n\tdd dic_WORD_EMIT\n\tdd dic_WORD_EQ\n\tdd dic_WORD_ERASE\n\tdd dic_WORD_EXECUTE\n\tdd dic_WORD_EXIT\n\tdd dic_WORD_FETCH\n\tdd dic_WORD_FETCH2\n\tdd dic_WORD_FETCHBYTE\n\tdd dic_WORD_FETCHSHORT\n\tdd dic_WORD_FILL\n\tdd dic_WORD_FIND\n\tdd dic_WORD_FIND_DICT\n\tdd dic_WORD_FMDIVMOD\n\tdd dic_WORD_FROMR\n\tdd dic_WORD_FROMR2\n\tdd dic_WORD_GT\n\tdd dic_WORD_GTEQ\n\tdd dic_WORD_HEADER_COMMA\n\tdd dic_WORD_HIDDEN\n\tdd dic_WORD_IMMEDIATE\n\tdd dic_WORD_INCR\n\tdd dic_WORD_INCR2\n\tdd dic_WORD_INCR4\n\tdd dic_WORD_INHASH\n\tdd dic_WORD_INLINE_COMMA\n\tdd dic_WORD_INTERP\n\tdd dic_WORD_INTERPNAME\n\tdd dic_WORD_INTERPRET\n\tdd dic_WORD_INVERT\n\tdd dic_WORD_ISNOTSPACE\n\tdd dic_WORD_ISSPACE\n\tdd dic_WORD_KEY\n\tdd dic_WORD_LATEST\n\tdd dic_WORD_LBRAC\n\tdd dic_WORD_LINESIZE\n\tdd dic_WORD_LIT_COMMA\n\tdd dic_WORD_LSHIFT\n\tdd dic_WORD_LSYSCALL\n\tdd dic_WORD_LT\n\tdd dic_WORD_LTEQ\n\tdd dic_WORD_MAX\n\tdd dic_WORD_MIN\n\tdd dic_WORD_MMINUS\n\tdd dic_WORD_MOD\n\tdd dic_WORD_MOVE\n\tdd dic_WORD_MPLUS\n\tdd dic_WORD_MSLASH\n\tdd dic_WORD_MULDIV\n\tdd dic_WORD_MULL\n\tdd dic_WORD_MULSTAR\n\tdd dic_WORD_NE\n\tdd dic_WORD_NEGATE\n\tdd dic_WORD_NFROMR\n\tdd dic_WORD_NIP\n\tdd dic_WORD_NIP2\n\tdd dic_WORD_NQDUP\n\tdd dic_WORD_NROT\n\tdd dic_WORD_NTOR\n\tdd dic_WORD_OR\n\tdd dic_WORD_OVER\n\tdd dic_WORD_OVER2\n\tdd dic_WORD_O_APPEND\n\tdd dic_WORD_O_CREAT\n\tdd dic_WORD_O_EXCL\n\tdd dic_WORD_O_NONBLOCK\n\tdd dic_WORD_O_RDONLY\n\tdd dic_WORD_O_RDWR\n\tdd dic_WORD_O_TRUNC\n\tdd dic_WORD_O_WRONLY\n\tdd dic_WORD_PARSENAME\n\tdd dic_WORD_PICK\n\tdd dic_WORD_POSTPONE\n\tdd dic_WORD_QDUP\n\tdd dic_WORD_RBRAC\n\tdd dic_WORD_RDROP\n\tdd dic_WORD_RDROP2\n\tdd dic_WORD_READCHAR\n\tdd dic_WORD_READLINE\n\tdd dic_WORD_REFILL\n\tdd dic_WORD_RFETCH\n\tdd dic_WORD_RFETCH2\n\tdd dic_WORD_ROT\n\tdd dic_WORD_ROT2\n\tdd dic_WORD_RSHIFT\n\tdd dic_WORD_RSPFETCH\n\tdd dic_WORD_RSPSTORE\n\tdd dic_WORD_RSTORE\n\tdd dic_WORD_RZ\n\tdd dic_WORD_SEMICOLON\n\tdd dic_WORD_SLITS\n\tdd dic_WORD_SMDIVREM\n\tdd dic_WORD_SOURCE\n\tdd dic_WORD_SOURCEFD\n\tdd dic_WORD_SSTRING\n\tdd dic_WORD_STARSMOD\n\tdd dic_WORD_STATE\n\tdd dic_WORD_STOD\n\tdd dic_WORD_STORE\n\tdd dic_WORD_STORE2\n\tdd dic_WORD_STOREBYTE\n\tdd dic_WORD_STORESHORT\n\tdd dic_WORD_SUB\n\tdd dic_WORD_SUBSTORE\n\tdd dic_WORD_SWAP\n\tdd dic_WORD_SWAP2\n\tdd dic_WORD_SYSCALL\n\tdd dic_WORD_SYS_CLOSE\n\tdd dic_WORD_SYS_EXIT\n\tdd dic_WORD_SYS_FSTAT\n\tdd dic_WORD_SYS_FSYNC\n\tdd dic_WORD_SYS_FTRUNCATE\n\tdd dic_WORD_SYS_LSEEK\n\tdd dic_WORD_SYS_OPEN\n\tdd dic_WORD_SYS_READ\n\tdd dic_WORD_SYS_RENAME\n\tdd dic_WORD_SYS_STAT\n\tdd dic_WORD_SYS_UNLINK\n\tdd dic_WORD_SYS_WRITE\n\tdd dic_WORD_SZ\n\tdd dic_WORD_TABSTOSPACES\n\tdd dic_WORD_TCFA\n\tdd dic_WORD_TICKS\n\tdd dic_WORD_TOIN\n\tdd dic_WORD_TONUMBER\n\tdd dic_WORD_TOR\n\tdd dic_WORD_TOR2\n\tdd dic_WORD_TOSNUMBER\n\tdd dic_WORD_TRAILING\n\tdd dic_WORD_TUCK\n\tdd dic_WORD_TUCK2\n\tdd dic_WORD_TWODIV\n\tdd dic_WORD_TWOMUL\n\tdd dic_WORD_TYPE\n\tdd dic_WORD_TYPE_FD\n\tdd dic_WORD_UDIVMOD\n\tdd dic_WORD_UGT\n\tdd dic_WORD_UGTEQ\n\tdd dic_WORD_ULT\n\tdd dic_WORD_ULTEQ\n\tdd dic_WORD_UMDIVMOD\n\tdd dic_WORD_UMULSTAR\n\tdd dic_WORD_UNUSED\n\tdd dic_WORD_VERSION\n\tdd dic_WORD_WORDBUF\n\tdd dic_WORD_WORDNAME\n\tdd dic_WORD_XOR\n\tdd dic_WORD_XTSKIP\n\tdd dic_WORD_ZBRANCH\n\tdd dic_WORD_ZEQ\n\tdd dic_WORD_ZGT\n\tdd dic_WORD_ZGTEQ\n\tdd dic_WORD_ZLT\n\tdd dic_WORD_ZLTEQ\n\tdd dic_WORD_ZNE\n\tdd dic_WORD__F_HIDDEN\n\tdd dic_WORD__F_IMMED\n\tdd dic_WORD__F_LENMASK\n\tdd dic_WORD__H_NAME\n\tdd dic_WORD__H_NSIZE\n\tdd dic_WORD__XT_BODY\n\tdd dic_WORD__XT_COMPILE\n\tdd dic_WORD__XT_LENGTH\n\tdd dic_WORD__XT_SIZE\n\tdd dic_WORD_TEST\ndictionary_end:\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;\n; room for user dictionary\n;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\ttimes USER_DEFS_SIZE db 0\nforth_end:\n" }, { "path": "src/test/resources/samples/langs/Assembly/fp_sqr32_160_comba.inc", "content": "\r\n push r2\r\n dint\r\n nop\r\n bis #MPYDLYWRTEN,&MPY32CTL0\r\n bic #MPYDLY32,&MPY32CTL0\r\n mov #SUMEXT,r13\r\n clr r12\r\n\r\n mov @r15+,r4\r\n mov @r15+,r5\r\n\r\n mov @r15+,r6\r\n mov @r15+,r7\r\n\r\n mov @r15+,r8\r\n mov @r15+,r9\r\n\r\n mov @r15+,r10\r\n mov @r15+,r11\r\n\r\n sub #2*8,r15\r\n\r\n /* SELF_STEP_FIRST */\r\n mov r4,&MPY32L\r\n mov r5,&MPY32H\r\n mov r4,&OP2L\r\n mov r5,&OP2H\r\n\r\n /* COLUMN_END */\r\n mov &RES0,2*0(r14)\r\n mov &RES1,2*(0+1)(r14)\r\n mov &RES2,&RES0\r\n mov &RES3,&RES1\r\n mov r12,&RES2\r\n clr &RES3\r\n\r\n /* STEP_1 */\r\n mov r4,&MAC32L\r\n mov r5,&MAC32H\r\n mov r6,&OP2L\r\n mov r7,&OP2H\r\n add &SUMEXT,r12\r\n mov r6,&OP2L\r\n mov r7,&OP2H\r\n\r\n /* COLUMN_END */\r\n mov &RES0,2*2(r14)\r\n add @r13,r12\r\n mov &RES1,2*(2+1)(r14)\r\n mov &RES2,&RES0\r\n mov &RES3,&RES1\r\n mov r12,&RES2\r\n clr &RES3\r\n clr r12\r\n\r\n /* STEP_1 */\r\n mov r4,&MAC32L\r\n mov r5,&MAC32H\r\n mov r8,&OP2L\r\n mov r9,&OP2H\r\n add &SUMEXT,r12\r\n mov r8,&OP2L\r\n mov r9,&OP2H\r\n\r\n /* SELF_STEP */\r\n mov r6,&MAC32L\r\n mov r7,&MAC32H\r\n add @r13,r12\r\n mov r6,&OP2L\r\n mov r7,&OP2H\r\n\r\n /* COLUMN_END */\r\n mov &RES0,2*4(r14)\r\n add @r13,r12\r\n mov &RES1,2*(4+1)(r14)\r\n mov &RES2,&RES0\r\n mov &RES3,&RES1\r\n mov r12,&RES2\r\n clr &RES3\r\n clr r12\r\n\r\n /* STEP_1 */\r\n mov r4,&MAC32L\r\n mov r5,&MAC32H\r\n mov r10,&OP2L\r\n mov r11,&OP2H\r\n add &SUMEXT,r12\r\n mov r10,&OP2L\r\n mov r11,&OP2H\r\n\r\n /* STEP_2MORE */\r\n mov r6,&MAC32L\r\n mov r7,&MAC32H\r\n add @r13,r12\r\n mov r8,&OP2L\r\n mov r9,&OP2H\r\n add &SUMEXT,r12\r\n mov r8,&OP2L\r\n mov r9,&OP2H\r\n\r\n /* COLUMN_END */\r\n mov &RES0,2*6(r14)\r\n add @r13,r12\r\n mov &RES1,2*(6+1)(r14)\r\n mov &RES2,&RES0\r\n mov &RES3,&RES1\r\n mov r12,&RES2\r\n clr &RES3\r\n clr r12\r\n\r\n /* STEP_1 */\r\n mov r4,&MAC32L\r\n mov r5,&MAC32H\r\n mov 2*8(r15),&OP2L\r\n mov 2*9(r15),&OP2H\r\n add &SUMEXT,r12\r\n mov 2*8(r15),&OP2L\r\n mov 2*9(r15),&OP2H\r\n\r\n /* STEP_2MORE */\r\n mov r6,&MAC32L\r\n mov r7,&MAC32H\r\n add @r13,r12\r\n mov r10,&OP2L\r\n mov r11,&OP2H\r\n add &SUMEXT,r12\r\n mov r10,&OP2L\r\n mov r11,&OP2H\r\n\r\n /* SELF_STEP */\r\n mov r8,&MAC32L\r\n mov r9,&MAC32H\r\n add @r13,r12\r\n mov r8,&OP2L\r\n mov r9,&OP2H\r\n\r\n /* COLUMN_END */\r\n mov &RES0,2*8(r14)\r\n add @r13,r12\r\n mov &RES1,2*(8+1)(r14)\r\n mov &RES2,&RES0\r\n mov &RES3,&RES1\r\n mov r12,&RES2\r\n clr &RES3\r\n clr r12\r\n\r\n mov 2*8(r15),r4\r\n mov 2*(8+1)(r15),r5\r\n\r\n /* STEP_1 */\r\n mov r6,&MAC32L\r\n mov r7,&MAC32H\r\n mov r4,&OP2L\r\n mov r5,&OP2H\r\n add &SUMEXT,r12\r\n mov r4,&OP2L\r\n mov r5,&OP2H\r\n\r\n /* STEP_2MORE */\r\n mov r8,&MAC32L\r\n mov r9,&MAC32H\r\n add @r13,r12\r\n mov r10,&OP2L\r\n mov r11,&OP2H\r\n add &SUMEXT,r12\r\n mov r10,&OP2L\r\n mov r11,&OP2H\r\n\r\n /* COLUMN_END */\r\n mov &RES0,2*10(r14)\r\n add @r13,r12\r\n mov &RES1,2*(10+1)(r14)\r\n mov &RES2,&RES0\r\n mov &RES3,&RES1\r\n mov r12,&RES2\r\n clr &RES3\r\n clr r12\r\n\r\n /* STEP_1 */\r\n mov r8,&MAC32L\r\n mov r9,&MAC32H\r\n mov r4,&OP2L\r\n mov r5,&OP2H\r\n add &SUMEXT,r12\r\n mov r4,&OP2L\r\n mov r5,&OP2H\r\n\r\n /* SELF_STEP */\r\n mov r10,&MAC32L\r\n mov r11,&MAC32H\r\n add @r13,r12\r\n mov r10,&OP2L\r\n mov r11,&OP2H\r\n\r\n /* COLUMN_END */\r\n mov &RES0,2*12(r14)\r\n add @r13,r12\r\n mov &RES1,2*(12+1)(r14)\r\n mov &RES2,&RES0\r\n mov &RES3,&RES1\r\n mov r12,&RES2\r\n clr &RES3\r\n clr r12\r\n\r\n /* STEP_1 */\r\n mov r10,&MAC32L\r\n mov r11,&MAC32H\r\n mov r4,&OP2L\r\n mov r5,&OP2H\r\n add &SUMEXT,r12\r\n mov r4,&OP2L\r\n mov r5,&OP2H\r\n\r\n /* COLUMN_END */\r\n mov &RES0,2*14(r14)\r\n add @r13,r12\r\n mov &RES1,2*(14+1)(r14)\r\n mov &RES2,&RES0\r\n mov &RES3,&RES1\r\n mov r12,&RES2\r\n clr &RES3\r\n clr r12\r\n\r\n /* SELF_STEP_1 */\r\n mov r4,&MAC32L\r\n mov r5,&MAC32H\r\n mov r4,&OP2L\r\n mov r5,&OP2H\r\n\r\n /* COLUMN_END */\r\n mov &RES0,2*16(r14)\r\n add @r13,r12\r\n mov &RES1,2*(16+1)(r14)\r\n mov &RES2,&RES0\r\n mov &RES3,&RES1\r\n mov r12,&RES2\r\n clr &RES3\r\n clr r12\r\n\r\n /* END */\r\n mov &RES0,2*18(r14)\r\n mov &RES1,2*(18+1)(r14)\r\n pop r2\r\n eint\r\n" }, { "path": "src/test/resources/samples/langs/Assembly/lib.inc", "content": "\n; ------------------------------------------------------------------------\n; 显示 AL 中的数字\n; ------------------------------------------------------------------------\nDispAL:\n\tpush\tecx\n\tpush\tedx\n\tpush\tedi\n\n\tmov\tedi, [dwDispPos]\n\n\tmov\tah, 0Fh\t\t\t; 0000b: 黑底 1111b: 白字\n\tmov\tdl, al\n\tshr\tal, 4\n\tmov\tecx, 2\n.begin:\n\tand\tal, 01111b\n\tcmp\tal, 9\n\tja\t.1\n\tadd\tal, '0'\n\tjmp\t.2\n.1:\n\tsub\tal, 0Ah\n\tadd\tal, 'A'\n.2:\n\tmov\t[gs:edi], ax\n\tadd\tedi, 2\n\n\tmov\tal, dl\n\tloop\t.begin\n\t;add\tedi, 2\n\n\tmov\t[dwDispPos], edi\n\n\tpop\tedi\n\tpop\tedx\n\tpop\tecx\n\n\tret\n; DispAL 结束-------------------------------------------------------------\n\n\n; ------------------------------------------------------------------------\n; 显示一个整形数\n; ------------------------------------------------------------------------\nDispInt:\n\tmov\teax, [esp + 4]\n\tshr\teax, 24\n\tcall\tDispAL\n\n\tmov\teax, [esp + 4]\n\tshr\teax, 16\n\tcall\tDispAL\n\n\tmov\teax, [esp + 4]\n\tshr\teax, 8\n\tcall\tDispAL\n\n\tmov\teax, [esp + 4]\n\tcall\tDispAL\n\n\tmov\tah, 07h\t\t\t; 0000b: 黑底 0111b: 灰字\n\tmov\tal, 'h'\n\tpush\tedi\n\tmov\tedi, [dwDispPos]\n\tmov\t[gs:edi], ax\n\tadd\tedi, 4\n\tmov\t[dwDispPos], edi\n\tpop\tedi\n\n\tret\n; DispInt 结束------------------------------------------------------------\n\n; ------------------------------------------------------------------------\n; 显示一个字符串\n; ------------------------------------------------------------------------\nDispStr:\n\tpush\tebp\n\tmov\tebp, esp\n\tpush\tebx\n\tpush\tesi\n\tpush\tedi\n\n\tmov\tesi, [ebp + 8]\t; pszInfo\n\tmov\tedi, [dwDispPos]\n\tmov\tah, 0Fh\n.1:\n\tlodsb\n\ttest\tal, al\n\tjz\t.2\n\tcmp\tal, 0Ah\t; 是回车吗?\n\tjnz\t.3\n\tpush\teax\n\tmov\teax, edi\n\tmov\tbl, 160\n\tdiv\tbl\n\tand\teax, 0FFh\n\tinc\teax\n\tmov\tbl, 160\n\tmul\tbl\n\tmov\tedi, eax\n\tpop\teax\n\tjmp\t.1\n.3:\n\tmov\t[gs:edi], ax\n\tadd\tedi, 2\n\tjmp\t.1\n\n.2:\n\tmov\t[dwDispPos], edi\n\n\tpop\tedi\n\tpop\tesi\n\tpop\tebx\n\tpop\tebp\n\tret\n; DispStr 结束------------------------------------------------------------\n\n; ------------------------------------------------------------------------\n; 换行\n; ------------------------------------------------------------------------\nDispReturn:\n\tpush\tszReturn\n\tcall\tDispStr\t\t\t;printf(\"\\n\");\n\tadd\tesp, 4\n\n\tret\n; DispReturn 结束---------------------------------------------------------\n\n\n; ------------------------------------------------------------------------\n; 内存拷贝，仿 memcpy\n; ------------------------------------------------------------------------\n; void* MemCpy(void* es:pDest, void* ds:pSrc, int iSize);\n; ------------------------------------------------------------------------\nMemCpy:\n\tpush\tebp\n\tmov\tebp, esp\n\n\tpush\tesi\n\tpush\tedi\n\tpush\tecx\n\n\tmov\tedi, [ebp + 8]\t; Destination\n\tmov\tesi, [ebp + 12]\t; Source\n\tmov\tecx, [ebp + 16]\t; Counter\n.1:\n\tcmp\tecx, 0\t\t; 判断计数器\n\tjz\t.2\t\t; 计数器为零时跳出\n\n\tmov\tal, [ds:esi]\t\t; ┓\n\tinc\tesi\t\t\t; ┃\n\t\t\t\t\t; ┣ 逐字节移动\n\tmov\tbyte [es:edi], al\t; ┃\n\tinc\tedi\t\t\t; ┛\n\n\tdec\tecx\t\t; 计数器减一\n\tjmp\t.1\t\t; 循环\n.2:\n\tmov\teax, [ebp + 8]\t; 返回值\n\n\tpop\tecx\n\tpop\tedi\n\tpop\tesi\n\tmov\tesp, ebp\n\tpop\tebp\n\n\tret\t\t\t; 函数结束，返回\n; MemCpy 结束-------------------------------------------------------------\n\n" }, { "path": "src/test/resources/samples/langs/Assembly/macros.inc", "content": "BLARGG_MACROS_INCLUDED = 1\n\n; Allows extra error checking with modified version\n; of ca65. Otherwise acts like a constant of 0.\nADDR = 0\n\n; Switches to Segment and places Line there.\n; Line can be an .align directive, .res, .byte, etc.\n; Examples:\n; seg_data BSS, .align 256\n; seg_data RODATA, {message: .byte \"Test\",0}\n.macro seg_data Segment, Line\n\t.pushseg\n\t.segment .string(Segment)\n\t\tLine\n\t.popseg\n.endmacro\n\n; Reserves Size bytes in Segment for Name.\n; If Size is omitted, reserves one byte.\n.macro seg_res Segment, Name, Size\n\t.ifblank Size\n\t\tseg_data Segment, Name: .res 1\n\t.else\n\t\tseg_data Segment, Name: .res Size\n\t.endif\n.endmacro\n\n; Shortcuts for zeropage, bss, and stack\n.define zp_res seg_res ZEROPAGE,\n.define nv_res seg_res NVRAM,\n.define bss_res seg_res BSS,\n.define sp_res seg_res STACK,\n.define zp_byte zp_res\n\n; Copies byte from Src to Addr. If Src begins with #,\n; it sets Addr to the immediate value.\n; Out: A = byte copied\n; Preserved: X, Y\n.macro mov Addr, Src\n\tlda Src\n\tsta Addr\n.endmacro\n\n; Copies word from Src to Addr. If Src begins with #,\n; it sets Addr the immediate value.\n; Out: A = high byte of word\n; Preserved: X, Y\n.macro movw Addr, Src\n\t.if .match( .left( 1, {Src} ), # )\n\t\tlda #<(.right( .tcount( {Src} )-1, {Src} ))\n\t\tsta Addr\n\t\tlda #>(.right( .tcount( {Src} )-1, {Src} ))\n\t\tsta 1+(Addr)\n\t.else\n\t\tlda Src\n\t\tsta Addr\n\t\tlda 1+(Src)\n\t\tsta 1+(Addr)\n\t.endif\n.endmacro\n\n; Increments 16-bit value at Addr.\n; Out: EQ/NE based on resulting 16-bit value\n; Preserved: A, X, Y\n.macro incw Addr\n\t.local @Skip\n\tinc Addr\n\tbne @Skip\n\tinc 1+(Addr)\n@Skip:\n.endmacro\n\n; Adds Src to word at Addr.\n; Out: A = high byte of result, carry set appropriately\n; Preserved: X, Y\n.macro addw Addr, Src\n\t.if .match( .left( 1, {Src} ), # )\n\t\taddw_ Addr,(.right( .tcount( {Src} )-1, {Src} ))\n\t.else\n\t\tlda Addr\n\t\tclc\n\t\tadc Src\n\t\tsta Addr\n\t\t\n\t\tlda 1+(Addr)\n\t\tadc 1+(Src)\n\t\tsta 1+(Addr)\n\t.endif\n.endmacro\n.macro addw_ Addr, Imm\n\tlda Addr\n\tclc\n\tadc #> 8) <> 0\n\t\tlda 1+(Addr)\n\t\tadc #>Imm\n\t\tsta 1+(Addr)\n\t;.else\n\t; .local @Skip\n\t; bcc @Skip\n\t; inc 1+(Addr)\n\t;@Skip:\n\t;.endif\n.endmacro\n\n; Splits list of words into tables of low and high bytes\n; Example: split_words foo, {$1234, $5678}\n; expands to:\n; foo_l: $34, $78\n; foo_h: $12, $56\n; foo_count = 2\n.macro split_words Label, Words\n\t.ident (.concat (.string(Label), \"_l\")): .lobytes Words\n\t.ident (.concat (.string(Label), \"_h\")): .hibytes Words\n\t.ident (.concat (.string(Label), \"_count\")) = * - .ident (.concat (.string(Label), \"_h\"))\n.endmacro\n\n.macro SELECT Bool, True, False, Extra\n\t.ifndef Bool\n\t\tFalse Extra\n\t.elseif Bool <> 0\n\t\tTrue Extra\n\t.else\n\t\tFalse Extra\n\t.endif\n.endmacro\n\n.macro DEFAULT Name, Value\n\t.ifndef Name\n\t\tName = Value\n\t.endif\n.endmacro\n\n.ifp02\n\t; 6502 doesn't define these alternate names\n\t.define blt bcc\n\t.define bge bcs\n.endif\n.define jlt jcc\n.define jge jcs\n\n; Jxx Target = Bxx Target, except it can go farther than\n; 128 bytes. Implemented via branch around a JMP.\n\n; Don't use ca65's longbranch, because they fail for @labels\n;.macpack longbranch\n\n.macro jeq Target\n\tbne *+5\n\tjmp Target\n.endmacro\n\n.macro jne Target\n\tbeq *+5\n\tjmp Target\n.endmacro\n\n.macro jmi Target\n\tbpl *+5\n\tjmp Target\n.endmacro\n\n.macro jpl Target\n\tbmi *+5\n\tjmp Target\n.endmacro\n\n.macro jcs Target\n\tbcc *+5\n\tjmp Target\n.endmacro\n\n.macro jcc Target\n\tbcs *+5\n\tjmp Target\n.endmacro\n\n.macro jvs Target\n\tbvc *+5\n\tjmp Target\n.endmacro\n\n.macro jvc Target\n\tbvs *+5\n\tjmp Target\n.endmacro\n\n\n; Passes constant data to routine in addr\n; Preserved: A, X, Y\n.macro jsr_with_addr routine,data\n\t.local Addr\n\tpha\n\tlda #Addr\n\tsta addr+1\n\tpla\n\tjsr routine\n\tseg_data RODATA,{Addr: data}\n.endmacro\n\n; Calls routine multiple times, with A having the\n; value 'start' the first time, 'start+step' the\n; second time, up to 'end' for the last time.\n.macro for_loop routine,start,end,step\n\t.local @for_loop\n\tlda #start\n@for_loop:\n\tpha\n\tjsr routine\n\tpla\n\tclc\n\tadc #step\n\tcmp #<((end)+(step))\n\tbne @for_loop\n.endmacro\n\n; Calls routine n times. The value of A in the routine\n; counts from 0 to n-1.\n.macro loop_n_times routine,n\n\tfor_loop routine,0,n-1,+1\n.endmacro\n\n; Same as for_loop, except uses 16-bit value in YX.\n; -256 <= step <= 255\n.macro for_loop16 routine,start,end,step\n.if (step) < -256 || (step) > 255\n\t.error \"Step must be within -256 to 255\"\n.endif\n\t.local @for_loop_skip\n\t.local @for_loop\n\tldy #>(start)\n\tlda #<(start)\n@for_loop:\n\ttax\n\tpha\n\ttya\n\tpha\n\tjsr routine\n\tpla\n\ttay\n\tpla\n\tclc\n\tadc #step\n.if (step) > 0\n\tbcc @for_loop_skip\n\tiny\n.else\n\tbcs @for_loop_skip\n\tdey\n.endif\n@for_loop_skip:\n\tcmp #<((end)+(step))\n\tbne @for_loop\n\tcpy #>((end)+(step))\n\tbne @for_loop\n.endmacro\n\n; Stores byte at addr\n; Preserved: X, Y\n.macro setb addr, byte\n\tlda #byte\n\tsta addr\n.endmacro\n\n; Stores word at addr\n; Preserved: X, Y\n.macro setw addr, word\n\tlda #<(word)\n\tsta addr\n\tlda #>(word)\n\tsta addr+1\n.endmacro\n\n; Loads XY with 16-bit immediate or value at address\n.macro ldxy Arg\n\t.if .match( .left( 1, {Arg} ), # )\n\t\tldy #<(.right( .tcount( {Arg} )-1, {Arg} ))\n\t\tldx #>(.right( .tcount( {Arg} )-1, {Arg} ))\n\t.else\n\t\tldy (Arg)\n\t\tldx (Arg)+1\n\t.endif\n.endmacro\n\n; Increments XY as 16-bit register, in CONSTANT time.\n; Z flag set based on entire result.\n; Preserved: A\n; Time: 7 clocks\n.macro inxy\n\tiny ; 2\n\tbeq *+4 ; 3\n\t\t; -1\n\tbne *+3 ; 3\n\t\t; -1\n\tinx ; 2\n.endmacro\n\n; Negates A and adds it to operand\n.macro subaf Operand\n\teor #$FF\n\tsec\n\tadc Operand\n.endmacro\n\n; Initializes CPU registers to reasonable values\n; Preserved: A, Y\n.macro init_cpu_regs\n\tsei\n\tcld ; unnecessary on NES, but might help on clone\n\tldx #$FF\n\ttxs\n\t.ifndef BUILD_NSF\n\t\tinx\n\t\tstx PPUCTRL\n\t.endif\n.endmacro\n" }, { "path": "src/test/resources/samples/langs/AutoHotkey/hello.ahk", "content": "MsgBox, Hello`, World!\n" }, { "path": "src/test/resources/samples/langs/Awk/test.awk", "content": "#!/bin/awk -f\n\nBEGIN {\n # It is not possible to define output file names here because\n # FILENAME is not define in the BEGIN section\n n = \"\";\n printf \"Generating data files ...\";\n network_max_bandwidth_in_byte = 10000000;\n network_max_packet_per_second = 1000000;\n last3 = 0;\n last4 = 0;\n last5 = 0;\n last6 = 0;\n}\n{\n if ($1 ~ /Average/)\n { # Skip the Average values\n n = \"\";\n next;\n }\n\n if ($2 ~ /all/)\n { # This is the cpu info\n print $3 > FILENAME\".cpu.user.dat\";\n#\t print $4 > FILENAME\".cpu.nice.dat\";\n print $5 > FILENAME\".cpu.system.dat\";\n# print $6 > FILENAME\".cpu.iowait.dat\";\n print $7 > FILENAME\".cpu.idle.dat\";\n print 100-$7 > FILENAME\".cpu.busy.dat\";\n }\n if ($2 ~ /eth0/)\n { # This is the eth0 network info\n if ($3 > network_max_packet_per_second)\n\tprint last3 > FILENAME\".net.rxpck.dat\"; # Total number of packets received per second.\n else\n\t{\n\t last3 = $3;\n\t print $3 > FILENAME\".net.rxpck.dat\"; # Total number of packets received per second.\n\t}\n if ($4 > network_max_packet_per_second)\n\tprint last4 > FILENAME\".net.txpck.dat\"; # Total number of packets transmitted per second.\n else\n\t{\n\t last4 = $4;\n\t print $4 > FILENAME\".net.txpck.dat\"; # Total number of packets transmitted per second.\n\t}\n if ($5 > network_max_bandwidth_in_byte)\n\tprint last5 > FILENAME\".net.rxbyt.dat\"; # Total number of bytes received per second.\n else\n\t{\n\t last5 = $5;\n\t print $5 > FILENAME\".net.rxbyt.dat\"; # Total number of bytes received per second.\n\t}\n if ($6 > network_max_bandwidth_in_byte)\n\tprint last6 > FILENAME\".net.txbyt.dat\"; # Total number of bytes transmitted per second.\n else\n\t{\n\t last6 = $6;\n\t print $6 > FILENAME\".net.txbyt.dat\"; # Total number of bytes transmitted per second.\n\t}\n# print $7 > FILENAME\".net.rxcmp.dat\"; # Number of compressed packets received per second (for cslip etc.).\n# print $8 > FILENAME\".net.txcmp.dat\"; # Number of compressed packets transmitted per second.\n# print $9 > FILENAME\".net.rxmcst.dat\"; # Number of multicast packets received per second.\n }\n\n # Detect which is the next info to be parsed\n if ($2 ~ /proc|cswch|tps|kbmemfree|totsck/)\n {\n n = $2;\n }\n\n # Only get lines with numbers (real data !)\n if ($2 ~ /[0-9]/)\n {\n if (n == \"proc/s\")\n\t{ # This is the proc/s info\n\t print $2 > FILENAME\".proc.dat\";\n#\t n = \"\";\n\t}\n if (n == \"cswch/s\")\n\t{ # This is the context switches per second info\n\t print $2 > FILENAME\".ctxsw.dat\";\n#\t n = \"\";\n\t}\n if (n == \"tps\")\n\t{ # This is the disk info\n\t print $2 > FILENAME\".disk.tps.dat\"; # total transfers per second\n\t print $3 > FILENAME\".disk.rtps.dat\"; # read requests per second\n\t print $4 > FILENAME\".disk.wtps.dat\"; # write requests per second\n\t print $5 > FILENAME\".disk.brdps.dat\"; # block reads per second\n\t print $6 > FILENAME\".disk.bwrps.dat\"; # block writes per second\n#\t n = \"\";\n\t}\n if (n == \"kbmemfree\")\n\t{ # This is the mem info\n\t print $2 > FILENAME\".mem.kbmemfree.dat\"; # Amount of free memory available in kilobytes.\n\t print $3 > FILENAME\".mem.kbmemused.dat\"; # Amount of used memory in kilobytes. This does not take into account memory used by the kernel itself.\n\t print $4 > FILENAME\".mem.memused.dat\"; # Percentage of used memory.\n# It appears the kbmemshrd has been removed from the sysstat output - ntolia\n#\t print $X > FILENAME\".mem.kbmemshrd.dat\"; # Amount of memory shared by the system in kilobytes. Always zero with 2.4 kernels.\n#\t print $5 > FILENAME\".mem.kbbuffers.dat\"; # Amount of memory used as buffers by the kernel in kilobytes.\n\t print $6 > FILENAME\".mem.kbcached.dat\"; # Amount of memory used to cache data by the kernel in kilobytes.\n#\t print $7 > FILENAME\".mem.kbswpfree.dat\"; # Amount of free swap space in kilobytes.\n#\t print $8 > FILENAME\".mem.kbswpused.dat\"; # Amount of used swap space in kilobytes.\n\t print $9 > FILENAME\".mem.swpused.dat\"; # Percentage of used swap space.\n#\t n = \"\";\n \t}\n if (n == \"totsck\")\n\t{ # This is the socket info\n\t print $2 > FILENAME\".sock.totsck.dat\"; # Total number of used sockets.\n\t print $3 > FILENAME\".sock.tcpsck.dat\"; # Number of TCP sockets currently in use.\n#\t print $4 > FILENAME\".sock.udpsck.dat\"; # Number of UDP sockets currently in use.\n#\t print $5 > FILENAME\".sock.rawsck.dat\"; # Number of RAW sockets currently in use.\n#\t print $6 > FILENAME\".sock.ip-frag.dat\"; # Number of IP fragments currently in use.\n#\t n = \"\";\n \t}\n }\n}\nEND {\n print \" '\" FILENAME \"' done.\";\n}\n" }, { "path": "src/test/resources/samples/langs/Ballerina/hello-world-service.bal", "content": "import ballerina.lang.messages;\nimport ballerina.net.http;\nimport ballerina.doc;\n\n@doc:Description {value:\"By default Ballerina assumes that the service is to be exposed via HTTP/1.1 using the system default port and that all requests coming to the HTTP server will be delivered to this service.\"}\nservice helloWorld {\n @doc:Description {value:\"All resources are invoked with an argument of type message, the built-in reference type representing a network invocation.\"}\n resource sayHello (message m) {\n // Creates an empty message.\n message response = {};\n // A util method that can be used to set string payload.\n messages:setStringPayload(response, \"Hello, World!\");\n // Reply keyword sends the response back to the client.\n reply response;\n }\n}\n" }, { "path": "src/test/resources/samples/langs/Ballerina/hello-world.bal", "content": "import ballerina.lang.system;\n\nfunction main (string[] args) {\n system:println(\"Hello, World!\");\n}\n\n" }, { "path": "src/test/resources/samples/langs/Ballerina/json.bal", "content": "import ballerina.lang.system;\n\nfunction main (string[] args) {\n // JSON string value.\n json j1 = \"Apple\";\n system:println(j1);\n\n // JSON number value.\n json j2 = 5.36;\n system:println(j2);\n\n // JSON true value.\n json j3 = true;\n system:println(j3);\n\n // JSON false value.\n json j4 = false;\n system:println(j4);\n\n // JSON null value.\n json j5 = null;\n\n //JSON Objects.\n json j6 = {name:\"apple\", color:\"red\", price:j2};\n system:println(j6);\n\n //JSON Arrays. They are arrays of any JSON value.\n json j7 = [1, false, null, \"foo\",\n {first:\"John\", last:\"Pala\"}];\n system:println(j7);\n}\n" }, { "path": "src/test/resources/samples/langs/Ballerina/var.bal", "content": "import ballerina.lang.system;\n\nfunction divideBy10 (int d) (int, int) {\n return d / 10, d % 10;\n}\n\nfunction main (string[] args) {\n //Here the variable type is inferred type from the initial value. This is same as \"int k = 5\";\n var k = 5;\n system:println(10 + k);\n\n //Here the type of the 'strVar' is 'string'.\n var strVar = \"Hello!\";\n system:println(strVar);\n\n //Multiple assignment with 'var' allows you to define the variable then and there.\n //Variable type is inferred from the right-hand side.\n var q, r = divideBy10(6);\n system:println(\"06/10: \" + \"quotient=\" + q + \" \" +\n \"remainder=\" + r);\n\n //To ignore a particular return value in a multiple assignment statement, use '_'.\n var q1, _ = divideBy10(57);\n system:println(\"57/10: \" + \"quotient=\" + q1);\n\n var _, r1 = divideBy10(9);\n system:println(\"09/10: \" + \"remainder=\" + r1);\n}\n" }, { "path": "src/test/resources/samples/langs/Ballerina/xml.bal", "content": "import ballerina.lang.system;\n\nfunction main (string[] args) {\n\n\t// XML element. Can only have one root element.\n xml x1 = xml `The Lost World`;\n system:println(x1);\n\n // XML text\n xml x2 = xml `Hello, world!`;\n system:println(x2);\n\n // XML comment\n xml x3 = xml ``;\n system:println(x3);\n\n // XML processing instruction\n xml x4 = xml ``;\n system:println(x4);\n\n // Multiple XML items can be combined to form a sequence of XML. The resulting sequence is again an XML on its own.\n xml x5 = x1 + x2 + x3 + x4;\n system:println(\"\\nResulting XML sequence:\");\n system:println(x5);\n\n}\n" }, { "path": "src/test/resources/samples/langs/BitBake/gstreamer-libav.bb", "content": "include gstreamer1.0-libav.inc\n\nLIC_FILES_CHKSUM = \"file://COPYING;md5=b234ee4d69f5fce4486a80fdaf4a4263 \\\n file://COPYING.LIB;md5=6762ed442b3822387a51c92d928ead0d \\\n file://ext/libav/gstav.h;beginline=1;endline=18;md5=a752c35267d8276fd9ca3db6994fca9c \\\n file://gst-libs/ext/libav/LICENSE;md5=23a54f59b82572c203a559346e89ed57 \\\n file://gst-libs/ext/libav/COPYING.GPLv2;md5=b234ee4d69f5fce4486a80fdaf4a4263 \\\n file://gst-libs/ext/libav/COPYING.GPLv3;md5=d32239bcb673463ab874e80d47fae504 \\\n file://gst-libs/ext/libav/COPYING.LGPLv2.1;md5=bd7a443320af8c812e4c18d1b79df004 \\\n file://gst-libs/ext/libav/COPYING.LGPLv3;md5=e6a600fd5e1d9cbde2d983680233ad02\"\n\nSRC_URI = \" \\\n http://gstreamer.freedesktop.org/src/gst-libav/gst-libav-${PV}.tar.xz \\\n file://0001-Disable-yasm-for-libav-when-disable-yasm.patch \\\n \"\nSRC_URI[md5sum] = \"86540dee14d31daf976eb2713f2294f3\"\nSRC_URI[sha256sum] = \"585eb7971006100ad771a852e07bd2f3e23bcc6eb0b1253a40b5a0e40e4e7418\"\n\nLIBAV_EXTRA_CONFIGURE_COMMON_ARG = \"--target-os=linux \\\n --cc='${CC}' --as='${CC}' --ld='${CC}' --nm='${NM}' --ar='${AR}' \\\n --ranlib='${RANLIB}' \\\n ${GSTREAMER_1_0_DEBUG}\"\n\nS = \"${WORKDIR}/gst-libav-${PV}\"\n\n" }, { "path": "src/test/resources/samples/langs/BitBake/qtbase-native.bb", "content": "require qt5-git.inc\nrequire ${PN}.inc\n\ndo_install_append() {\n # for modules which are still using syncqt and call qtPrepareTool(QMAKE_SYNCQT, syncqt)\n # e.g. qt3d, qtwayland\n ln -sf syncqt.pl ${D}${OE_QMAKE_PATH_QT_BINS}/syncqt\n}\n\nQT_MODULE_BRANCH = \"release\"\n# v5.2.1 + 168 commits\nSRCREV = \"08cbbde61778276ccdda73d89fd64d02c623779f\"\n\n" }, { "path": "src/test/resources/samples/langs/Blade/hello.blade", "content": "\n\n\n @yield('title', 'We love GitHub')\n @stack('scripts')\n @stack('styles')\n\n\n @include('partials.nav')\n\n @yield('content')\n\n
    \n @foreach($foo as $bar)\n
  • {{ $bar }}
    • \n @endforeach\n
\n\n {!! $raw_content !!}\n\n\n" }, { "path": "src/test/resources/samples/langs/Blade/hello.blade.php", "content": "\n\n\n @yield('title', 'We love GitHub')\n @stack('scripts')\n @stack('styles')\n\n\n @include('partials.nav')\n\n @yield('content')\n\n
    \n @foreach($foo as $bar)\n
  • {{ $bar }}
    • \n @endforeach\n
\n\n {!! $raw_content !!}\n\n\n" }, { "path": "src/test/resources/samples/langs/BlitzBasic/HalfAndDouble.bb", "content": "\nLocal bk = CreateBank(8)\nPokeFloat bk, 0, -1\nPrint Bin(PeekInt(bk, 0))\nPrint %1000000000000000\nPrint Bin(1 Shl 31)\nPrint $1f\nPrint $ff\nPrint $1f + (127 - 15)\nPrint Hex(%01111111100000000000000000000000)\nPrint Hex(~%11111111100000000000000000000000)\n\nPrint Bin(FloatToHalf(-2.5))\nPrint HalfToFloat(FloatToHalf(-200000000000.0))\n\nPrint Bin(FToI(-2.5))\n\nWaitKey\nEnd\n\n\n; Half-precision (16-bit) arithmetic library\n;============================================\n\nGlobal Half_CBank_\n\nFunction FToI(f#)\n\tIf Half_CBank_ = 0 Then Half_CBank_ = CreateBank(4)\n\tPokeFloat Half_CBank_, 0, f\n\tReturn PeekInt(Half_CBank_, 0)\nEnd Function\n\nFunction HalfToFloat#(h)\n\tLocal signBit, exponent, fraction, fBits\n\t\n\tsignBit = (h And 32768) <> 0\n\texponent = (h And %0111110000000000) Shr 10\n\tfraction = (h And %0000001111111111)\n\t\n\tIf exponent = $1F Then exponent = $FF : ElseIf exponent Then exponent = (exponent - 15) + 127\n\tfBits = (signBit Shl 31) Or (exponent Shl 23) Or (fraction Shl 13)\n\t\n\tIf Half_CBank_ = 0 Then Half_CBank_ = CreateBank(4)\n\tPokeInt Half_CBank_, 0, fBits\n\tReturn PeekFloat(Half_CBank_, 0)\nEnd Function\n\nFunction FloatToHalf(f#)\n\tLocal signBit, exponent, fraction, fBits\n\t\n\tIf Half_CBank_ = 0 Then Half_CBank_ = CreateBank(4)\n\tPokeFloat Half_CBank_, 0, f\n\tfBits = PeekInt(Half_CBank_, 0)\n\t\n\tsignBit = (fBits And (1 Shl 31)) <> 0\n\texponent = (fBits And $7F800000) Shr 23\n\tfraction = fBits And $007FFFFF\n\t\n\tIf exponent\n\t\texponent = exponent - 127\n\t\tIf Abs(exponent) > $1F\n\t\t\tIf exponent <> ($FF - 127) Then fraction = 0\n\t\t\texponent = $1F * Sgn(exponent)\n\t\tElse\n\t\t\texponent = exponent + 15\n\t\tEndIf\n\t\texponent = exponent And %11111\n\tEndIf\n\tfraction = fraction Shr 13\n\t\n\tReturn (signBit Shl 15) Or (exponent Shl 10) Or fraction\nEnd Function\n\nFunction HalfAdd(l, r)\n\t\nEnd Function\n\nFunction HalfSub(l, r)\n\t\nEnd Function\n\nFunction HalfMul(l, r)\n\t\nEnd Function\n\nFunction HalfDiv(l, r)\n\t\nEnd Function\n\nFunction HalfLT(l, r)\n\t\nEnd Function\n\nFunction HalfGT(l, r)\n\t\nEnd Function\n\n\n; Double-precision (64-bit) arithmetic library)\n;===============================================\n\nGlobal DoubleOut[1], Double_CBank_\n\nFunction DoubleToFloat#(d[1])\n\t\nEnd Function\n\nFunction FloatToDouble(f#)\n\t\nEnd Function\n\nFunction IntToDouble(i)\n\t\nEnd Function\n\nFunction SefToDouble(s, e, f)\n\t\nEnd Function\n\nFunction DoubleAdd(l, r)\n\t\nEnd Function\n\nFunction DoubleSub(l, r)\n\t\nEnd Function\n\nFunction DoubleMul(l, r)\n\t\nEnd Function\n\nFunction DoubleDiv(l, r)\n\t\nEnd Function\n\nFunction DoubleLT(l, r)\n\t\nEnd Function\n\nFunction DoubleGT(l, r)\n\t\nEnd Function\n\n\n;~IDEal Editor Parameters:\n;~F#1A#20#2F\n;~C#Blitz3D" }, { "path": "src/test/resources/samples/langs/BlitzBasic/LList.bb", "content": "\n; Double-linked list container class\n;====================================\n\n; with thanks to MusicianKool, for concept and issue fixes\n\n\nType LList\n\tField head_.ListNode\n\tField tail_.ListNode\nEnd Type\n\nType ListNode\n\tField pv_.ListNode\n\tField nx_.ListNode\n\tField Value\nEnd Type\n\nType Iterator\n\tField Value\n\tField l_.LList\n\tField cn_.ListNode, cni_\nEnd Type\n\n\n;Create a new LList object\nFunction CreateList.LList()\n\tLocal l.LList = New LList\n\t\n\tl\\head_ = New ListNode\n\tl\\tail_ = New ListNode\n\t\n\tl\\head_\\nx_ = l\\tail_\t\t;End caps\n\tl\\head_\\pv_ = l\\head_\t\t;These make it more or less safe to iterate freely\n\tl\\head_\\Value = 0\n\t\n\tl\\tail_\\nx_ = l\\tail_\n\tl\\tail_\\pv_ = l\\head_\n\tl\\tail_\\Value = 0\n\t\n\tReturn l\nEnd Function\n\n;Free a list and all elements (not any values)\nFunction FreeList(l.LList)\n\tClearList l\n\tDelete l\\head_\n\tDelete l\\tail_\n\tDelete l\nEnd Function\n\n;Remove all the elements from a list (does not free values)\nFunction ClearList(l.LList)\n\tLocal n.ListNode = l\\head_\\nx_\n\tWhile n <> l\\tail_\n\t\tLocal nx.ListNode = n\\nx_\n\t\tDelete n\n\t\tn = nx\n\tWend\n\tl\\head_\\nx_ = l\\tail_\n\tl\\tail_\\pv_ = l\\head_\nEnd Function\n\n;Count the number of elements in a list (slow)\nFunction ListLength(l.LList)\n\tLocal i.Iterator = GetIterator(l), elems\n\tWhile EachIn(i)\n\t\telems = elems + 1\n\tWend\n\tReturn elems\nEnd Function\n\n;Return True if a list contains a given value\nFunction ListContains(l.LList, Value)\n\tReturn (ListFindNode(l, Value) <> Null)\nEnd Function\n\n;Create a linked list from the intvalues in a bank (slow)\nFunction ListFromBank.LList(bank)\n\tLocal l.LList = CreateList()\n\tLocal size = BankSize(bank), p\n\t\n\tFor p = 0 To size - 4 Step 4\n\t\tListAddLast l, PeekInt(bank, p)\n\tNext\n\t\n\tReturn l\nEnd Function\n\n;Create a bank containing all the values in a list (slow)\nFunction ListToBank(l.LList)\n\tLocal size = ListLength(l) * 4\n\tLocal bank = CreateBank(size)\n\t\n\tLocal i.Iterator = GetIterator(l), p = 0\n\tWhile EachIn(i)\n\t\tPokeInt bank, p, i\\Value\n\t\tp = p + 4\n\tWend\n\t\n\tReturn bank\nEnd Function\n\n;Swap the contents of two list objects\nFunction SwapLists(l1.LList, l2.LList)\n\tLocal tempH.ListNode = l1\\head_, tempT.ListNode = l1\\tail_\n\tl1\\head_ = l2\\head_\n\tl1\\tail_ = l2\\tail_\n\tl2\\head_ = tempH\n\tl2\\tail_ = tempT\nEnd Function\n\n;Create a new list containing the same values as the first\nFunction CopyList.LList(lo.LList)\n\tLocal ln.LList = CreateList()\n\tLocal i.Iterator = GetIterator(lo) : While EachIn(i)\n\t\tListAddLast ln, i\\Value\n\tWend\n\tReturn ln\nEnd Function\n\n;Reverse the order of elements of a list\nFunction ReverseList(l.LList)\n\tLocal n1.ListNode, n2.ListNode, tmp.ListNode\n\t\n\tn1 = l\\head_\n\tn2 = l\\head_\\nx_\n\t\n\tWhile n1 <> l\\tail_\n\t\tn1\\pv_ = n2\n\t\ttmp = n2\\nx_\n\t\tn2\\nx_ = n1\n\t\tn1 = n2\n\t\tn2 = tmp\n\tWend\n\t\n\ttmp = l\\head_\n\tl\\head_ = l\\tail_\n\tl\\tail_ = tmp\n\t\n\tl\\head_\\pv_ = l\\head_\n\tl\\tail_\\nx_ = l\\tail_\nEnd Function\n\n;Search a list to retrieve the first node with the given value\nFunction ListFindNode.ListNode(l.LList, Value)\n\tLocal n.ListNode = l\\head_\\nx_\n\t\n\tWhile n <> l\\tail_\n\t\tIf n\\Value = Value Then Return n\n\t\tn = n\\nx_\n\tWend\n\t\n\tReturn Null\nEnd Function\n\n;Append a value to the end of a list (fast) and return the node\nFunction ListAddLast.ListNode(l.LList, Value)\n\tLocal n.ListNode = New ListNode\n\t\n\tn\\pv_ = l\\tail_\\pv_\n\tn\\nx_ = l\\tail_\n\tn\\Value = Value\n\t\n\tl\\tail_\\pv_ = n\n\tn\\pv_\\nx_ = n\n\t\n\tReturn n\nEnd Function\n\n;Attach a value to the start of a list (fast) and return the node\nFunction ListAddFirst.ListNode(l.LList, Value)\n\tLocal n.ListNode = New ListNode\n\t\n\tn\\pv_ = l\\head_\n\tn\\nx_ = l\\head_\\nx_\n\tn\\Value = Value\n\t\n\tl\\head_\\nx_ = n\n\tn\\nx_\\pv_ = n\n\t\n\tReturn n\nEnd Function\n\n;Remove the first occurence of the given value from a list\nFunction ListRemove(l.LList, Value)\n\tLocal n.ListNode = ListFindNode(l, Value)\n\tIf n <> Null Then RemoveListNode n\nEnd Function\n\n;Remove a node from a list\nFunction RemoveListNode(n.ListNode)\n\tn\\pv_\\nx_ = n\\nx_\n\tn\\nx_\\pv_ = n\\pv_\n\tDelete n\nEnd Function\n\n;Return the value of the element at the given position from the start of the list,\n;or backwards from the end of the list for a negative index\nFunction ValueAtIndex(l.LList, index)\n\tLocal n.ListNode = ListNodeAtIndex(l, index)\n\tIf n <> Null Then Return n\\Value : Else Return 0\nEnd Function\n\n;Return the ListNode at the given position from the start of the list, or backwards\n;from the end of the list for a negative index, or Null if invalid\nFunction ListNodeAtIndex.ListNode(l.LList, index)\n\tLocal e, n.ListNode\n\t\n\tIf index >= 0\n\t\tn = l\\head_\n\t\tFor e = 0 To index\n\t\t\tn = n\\nx_\n\t\tNext\n\t\tIf n = l\\tail_ Then n = Null\t;Beyond the end of the list - not valid\n\t\t\n\tElse\t;Negative index - count backward\n\t\tn = l\\tail_\n\t\tFor e = 0 To index Step -1\n\t\t\tn = n\\pv_\n\t\tNext\n\t\tIf n = l\\head_ Then n = Null\t;Before the start of the list - not valid\n\t\t\n\tEndIf\n\t\n\tReturn n\nEnd Function\n\n;Replace a value at the given position (added by MusicianKool)\nFunction ReplaceValueAtIndex(l.LList,index,value)\n\tLocal n.ListNode = ListNodeAtIndex(l,index)\n\tIf n <> Null Then n\\Value = value:Else Return 0\nEnd Function\n\n;Remove and return a value at the given position (added by MusicianKool)\nFunction RemoveNodeAtIndex(l.LList,index)\n\tLocal n.ListNode = ListNodeAtIndex(l,index),tval\n\tIf n <> Null Then tval = n\\Value:RemoveListNode(n):Return tval:Else Return 0\nEnd Function\n\n;Retrieve the first value from a list\nFunction ListFirst(l.LList)\n\tIf l\\head_\\nx_ <> l\\tail_ Then Return l\\head_\\nx_\\Value\nEnd Function\n\n;Retrieve the last value from a list\nFunction ListLast(l.LList)\n\tIf l\\tail_\\pv_ <> l\\head_ Then Return l\\tail_\\pv_\\Value\nEnd Function\n\n;Remove the first element from a list, and return its value\nFunction ListRemoveFirst(l.LList)\n\tLocal val\n\tIf l\\head_\\nx_ <> l\\tail_\n\t\tval = l\\head_\\nx_\\Value\n\t\tRemoveListNode l\\head_\\nx_\n\tEndIf\n\tReturn val\nEnd Function\n\n;Remove the last element from a list, and return its value\nFunction ListRemoveLast(l.LList)\n\tLocal val\n\tIf l\\tail_\\pv_ <> l\\head_\n\t\tval = l\\tail_\\pv_\\Value\n\t\tRemoveListNode l\\tail_\\pv_\n\tEndIf\n\tReturn val\nEnd Function\n\n;Insert a value into a list before the specified node, and return the new node\nFunction InsertBeforeNode.ListNode(Value, n.ListNode)\n\tLocal bef.ListNode = New ListNode\n\t\n\tbef\\pv_ = n\\pv_\n\tbef\\nx_ = n\n\tbef\\Value = Value\n\t\n\tn\\pv_ = bef\n\tbef\\pv_\\nx_ = bef\n\t\n\tReturn bef\nEnd Function\n\n;Insert a value into a list after the specified node, and return then new node\nFunction InsertAfterNode.ListNode(Value, n.ListNode)\n\tLocal aft.ListNode = New ListNode\n\t\n\taft\\nx_ = n\\nx_\n\taft\\pv_ = n\n\taft\\Value = Value\n\t\n\tn\\nx_ = aft\n\taft\\nx_\\pv_ = aft\n\t\n\tReturn aft\nEnd Function\n\n;Get an iterator object to use with a loop\n;This function means that most programs won't have to think about deleting iterators manually\n;(in general only a small, constant number will be created)\nFunction GetIterator.Iterator(l.LList)\n\tLocal i.Iterator\n\t\n\tIf l = Null Then RuntimeError \"Cannot create Iterator for Null\"\n\t\n\tFor i = Each Iterator\t\t;See if there's an available iterator at the moment\n\t\tIf i\\l_ = Null Then Exit\n\tNext\n\t\n\tIf i = Null Then i = New Iterator\t;If there wasn't, create one\n\t\n\ti\\l_ = l\n\ti\\cn_ = l\\head_\n\ti\\cni_ = -1\n\ti\\Value = 0\t\t;No especial reason why this has to be anything, but meh\n\t\n\tReturn i\nEnd Function\n\n;Use as the argument to While to iterate over the members of a list\nFunction EachIn(i.Iterator)\n\t\n\ti\\cn_ = i\\cn_\\nx_\n\t\n\tIf i\\cn_ <> i\\l_\\tail_\t\t;Still items in the list\n\t\ti\\Value = i\\cn_\\Value\n\t\ti\\cni_ = i\\cni_ + 1\n\t\tReturn True\n\t\t\n\tElse\n\t\ti\\l_ = Null\t\t;Disconnect from the list, having reached the end\n\t\ti\\cn_ = Null\n\t\ti\\cni_ = -1\n\t\tReturn False\n\t\t\n\tEndIf\nEnd Function\n\n;Remove from the containing list the element currently pointed to by an iterator\nFunction IteratorRemove(i.Iterator)\n\tIf (i\\cn_ <> i\\l_\\head_) And (i\\cn_ <> i\\l_\\tail_)\n\t\tLocal temp.ListNode = i\\cn_\n\t\t\n\t\ti\\cn_ = i\\cn_\\pv_\n\t\ti\\cni_ = i\\cni_ - 1\n\t\ti\\Value = 0\n\t\t\n\t\tRemoveListNode temp\n\t\t\n\t\tReturn True\n\tElse\n\t\tReturn False\n\tEndIf\nEnd Function\n\n;Call this before breaking out of an EachIn loop, to disconnect the iterator from the list\nFunction IteratorBreak(i.Iterator)\n\ti\\l_ = Null\n\ti\\cn_ = Null\n\ti\\cni_ = -1\n\ti\\Value = 0\nEnd Function\n\n\n;~IDEal Editor Parameters:\n;~F#5#A#10#18#2A#32#3E#47#4C#58#66#6F#78#8F#9B#A9#B7#BD#C5#CC\n;~F#E3#E9#EF#F4#F9#103#10D#11B#12B#13F#152#163\n;~C#Blitz3D" }, { "path": "src/test/resources/samples/langs/BlitzBasic/PObj.bb", "content": "\nLocal i, start, result\n\nLocal s.Sum3Obj = New Sum3Obj\n\nFor i = 1 To 100000\n\ts = New Sum3Obj\n\tresult = Handle Before s\n\tDelete s\nNext\n\nstart = MilliSecs()\nFor i = 1 To 1000000\n\tresult = Sum3_(MakeSum3Obj(i, i, i))\nNext\nstart = MilliSecs() - start\nPrint start\n\nstart = MilliSecs()\nFor i = 1 To 1000000\n\tresult = Sum3(i, i, i)\nNext\nstart = MilliSecs() - start\nPrint start\n\nWaitKey\nEnd\n\n\nFunction Sum3(a, b, c)\n\tReturn a + b + c\nEnd Function\n\n\nType Sum3Obj\n\tField isActive\n\tField a, b, c\nEnd Type\n\nFunction MakeSum3Obj(a, b, c)\n\tLocal s.Sum3Obj = Last Sum3Obj\n\tIf s\\isActive Then s = New Sum3Obj\n\ts\\isActive = True\n\ts\\a = a\n\ts\\b = b\n\ts\\c = c\n\t\n\tRestore label\n\tRead foo\n\t\n\tReturn Handle(s)\nEnd Function\n\n.label\nData (10 + 2), 12, 14\n:\nFunction Sum3_(a_)\n\tLocal a.Sum3Obj = Object.Sum3Obj a_\n\tLocal return_ = a\\a + a\\b + a\\c\n\tInsert a Before First Sum3Obj :: a\\isActive = False\n\tReturn return_\nEnd Function\n\n\n;~IDEal Editor Parameters:\n;~C#Blitz3D" }, { "path": "src/test/resources/samples/langs/BlitzMax/sample.bmx", "content": "SuperStrict\n\nFramework Brl.StandardIO\n\nType TMyType\n\tField property:int\n\n\tFunction A:int(param:int)\n\t\t'do nothing\n\tEnd Function\n\n\tMethod B:int(param:int)\n\t\t'do nothing\n\tEnd Method\nEnd Type\n\n\nGlobal my:TMyType = new TMyType\n?Win32\n\tmy.A()\n\tmy.B()\n?Linux\n\tmy.B()\n\tmy.A()\n?" }, { "path": "src/test/resources/samples/langs/Bluespec/TL.bsv", "content": "package TL;\n\ninterface TL;\n method Action ped_button_push();\n\n (* always_enabled *)\n method Action set_car_state_N(Bool x);\n (* always_enabled *)\n method Action set_car_state_S(Bool x);\n (* always_enabled *)\n method Action set_car_state_E(Bool x);\n (* always_enabled *)\n method Action set_car_state_W(Bool x);\n\n method Bool lampRedNS();\n method Bool lampAmberNS();\n method Bool lampGreenNS();\n\n method Bool lampRedE();\n method Bool lampAmberE();\n method Bool lampGreenE();\n\n method Bool lampRedW();\n method Bool lampAmberW();\n method Bool lampGreenW();\n\n method Bool lampRedPed();\n method Bool lampAmberPed();\n method Bool lampGreenPed();\nendinterface: TL\n\ntypedef enum {\n AllRed,\n GreenNS, AmberNS,\n GreenE, AmberE,\n GreenW, AmberW,\n GreenPed, AmberPed} TLstates deriving (Eq, Bits);\n\ntypedef UInt#(5) Time32;\ntypedef UInt#(20) CtrSize;\n\n(* synthesize *)\nmodule sysTL(TL);\n Time32 allRedDelay = 2;\n Time32 amberDelay = 4;\n Time32 nsGreenDelay = 20;\n Time32 ewGreenDelay = 10;\n Time32 pedGreenDelay = 10;\n Time32 pedAmberDelay = 6;\n\n CtrSize clocks_per_sec = 100;\n\n Reg#(TLstates) state <- mkReg(AllRed);\n Reg#(TLstates) next_green <- mkReg(GreenNS);\n Reg#(Time32) secs <- mkReg(0);\n Reg#(Bool) ped_button_pushed <- mkReg(False);\n Reg#(Bool) car_present_N <- mkReg(True);\n Reg#(Bool) car_present_S <- mkReg(True);\n Reg#(Bool) car_present_E <- mkReg(True);\n Reg#(Bool) car_present_W <- mkReg(True);\n Bool car_present_NS = car_present_N || car_present_S;\n Reg#(CtrSize) cycle_ctr <- mkReg(0);\n\n rule dec_cycle_ctr (cycle_ctr != 0);\n cycle_ctr <= cycle_ctr - 1;\n endrule\n\n Rules low_priority_rule = (rules\n rule inc_sec (cycle_ctr == 0);\n secs <= secs + 1;\n cycle_ctr <= clocks_per_sec;\n endrule endrules);\n\n function Action next_state(TLstates ns);\n action\n state <= ns;\n secs <= 0;\n endaction\n endfunction: next_state\n\n function TLstates green_seq(TLstates x);\n case (x)\n GreenNS: return (GreenE);\n GreenE: return (GreenW);\n GreenW: return (GreenNS);\n endcase\n endfunction\n\n function Bool car_present(TLstates x);\n case (x)\n GreenNS: return (car_present_NS);\n GreenE: return (car_present_E);\n GreenW: return (car_present_W);\n endcase\n endfunction\n\n function Rules make_from_green_rule(TLstates green_state, Time32 delay, Bool car_is_present, TLstates ns);\n return (rules\n rule from_green (state == green_state && (secs >= delay || !car_is_present));\n next_state(ns);\n endrule endrules);\n endfunction: make_from_green_rule\n\n function Rules make_from_amber_rule(TLstates amber_state, TLstates ng);\n return (rules\n rule from_amber (state == amber_state && secs >= amberDelay);\n next_state(AllRed);\n next_green <= ng;\n endrule endrules);\n endfunction: make_from_amber_rule\n\n Rules hprs[7];\n\n hprs[1] = make_from_green_rule(GreenNS, nsGreenDelay, car_present_NS, AmberNS);\n hprs[2] = make_from_amber_rule(AmberNS, GreenE);\n hprs[3] = make_from_green_rule(GreenE, ewGreenDelay, car_present_E, AmberE);\n hprs[4] = make_from_amber_rule(AmberE, GreenW);\n hprs[5] = make_from_green_rule(GreenW, ewGreenDelay, car_present_W, AmberW);\n hprs[6] = make_from_amber_rule(AmberW, GreenNS);\n\n hprs[0] = (rules\n rule fromAllRed (state == AllRed && secs >= allRedDelay);\n if (ped_button_pushed) action\n ped_button_pushed <= False;\n next_state(GreenPed);\n endaction else if (car_present(next_green))\n next_state(next_green);\n else if (car_present(green_seq(next_green)))\n next_state(green_seq(next_green));\n else if (car_present(green_seq(green_seq(next_green))))\n next_state(green_seq(green_seq(next_green)));\n else\n noAction;\n endrule: fromAllRed endrules);\n\n Rules high_priority_rules = hprs[0];\n for (Integer i = 1; i<7; i=i+1)\n high_priority_rules = rJoin(hprs[i], high_priority_rules);\n\n addRules(preempts(high_priority_rules, low_priority_rule));\n\n method Action ped_button_push();\n ped_button_pushed <= True;\n endmethod: ped_button_push\n\n method Action set_car_state_N(b) ; car_present_N <= b; endmethod\n method Action set_car_state_S(b) ; car_present_S <= b; endmethod\n method Action set_car_state_E(b) ; car_present_E <= b; endmethod\n method Action set_car_state_W(b) ; car_present_W <= b; endmethod\n\n method lampRedNS() = (!(state == GreenNS || state == AmberNS));\n method lampAmberNS() = (state == AmberNS);\n method lampGreenNS() = (state == GreenNS);\n method lampRedE() = (!(state == GreenE || state == AmberE));\n method lampAmberE() = (state == AmberE);\n method lampGreenE() = (state == GreenE);\n method lampRedW() = (!(state == GreenW || state == AmberW));\n method lampAmberW() = (state == AmberW);\n method lampGreenW() = (state == GreenW);\n\n method lampRedPed() = (!(state == GreenPed || state == AmberPed));\n method lampAmberPed() = (state == AmberPed);\n method lampGreenPed() = (state == GreenPed);\n\nendmodule: sysTL\n\nendpackage: TL\n" }, { "path": "src/test/resources/samples/langs/Bluespec/TbTL.bsv", "content": "package TbTL;\n\nimport TL::*;\n\ninterface Lamp;\n method Bool changed;\n method Action show_offs;\n method Action show_ons;\n method Action reset;\nendinterface\n\nmodule mkLamp#(String name, Bool lamp)(Lamp);\n Reg#(Bool) prev <- mkReg(False);\n\n method changed = (prev != lamp);\n\n method Action show_offs;\n if (prev && !lamp)\n $write (name + \" off, \");\n endmethod\n\n method Action show_ons;\n if (!prev && lamp)\n $write (name + \" on, \");\n endmethod\n\n method Action reset;\n prev <= lamp;\n endmethod\nendmodule\n\n\n(* synthesize *)\nmodule mkTest();\n let dut <- sysTL;\n\n Reg#(Bit#(16)) ctr <- mkReg(0);\n\n Reg#(Bool) carN <- mkReg(False);\n Reg#(Bool) carS <- mkReg(False);\n Reg#(Bool) carE <- mkReg(False);\n Reg#(Bool) carW <- mkReg(False);\n\n Lamp lamps[12];\n\n lamps[0] <- mkLamp(\"0: NS red \", dut.lampRedNS);\n lamps[1] <- mkLamp(\"1: NS amber\", dut.lampAmberNS);\n lamps[2] <- mkLamp(\"2: NS green\", dut.lampGreenNS);\n lamps[3] <- mkLamp(\"3: E red \", dut.lampRedE);\n lamps[4] <- mkLamp(\"4: E amber\", dut.lampAmberE);\n lamps[5] <- mkLamp(\"5: E green\", dut.lampGreenE);\n lamps[6] <- mkLamp(\"6: W red \", dut.lampRedW);\n lamps[7] <- mkLamp(\"7: W amber\", dut.lampAmberW);\n lamps[8] <- mkLamp(\"8: W green\", dut.lampGreenW);\n\n lamps[9] <- mkLamp(\"9: Ped red \", dut.lampRedPed);\n lamps[10] <- mkLamp(\"10: Ped amber\", dut.lampAmberPed);\n lamps[11] <- mkLamp(\"11: Ped green\", dut.lampGreenPed);\n\n rule start (ctr == 0);\n $dumpvars;\n endrule\n\n rule detect_cars;\n dut.set_car_state_N(carN);\n dut.set_car_state_S(carS);\n dut.set_car_state_E(carE);\n dut.set_car_state_W(carW);\n endrule\n\n rule go;\n ctr <= ctr + 1;\n if (ctr == 5000) carN <= True;\n if (ctr == 6500) carN <= False;\n if (ctr == 12_000) dut.ped_button_push;\n endrule\n\n rule stop (ctr > 32768);\n $display(\"TESTS FINISHED\");\n $finish(0);\n endrule\n\n function do_offs(l) = l.show_offs;\n function do_ons(l) = l.show_ons;\n function do_reset(l) = l.reset;\n\n function do_it(f);\n action\n for (Integer i=0; i<12; i=i+1)\n f(lamps[i]);\n endaction\n endfunction\n\n function any_changes();\n Bool b = False;\n for (Integer i=0; i<12; i=i+1)\n b = b || lamps[i].changed;\n return b;\n endfunction\n\n rule show (any_changes());\n do_it(do_offs);\n do_it(do_ons);\n do_it(do_reset);\n $display(\"(at time %d)\", $time);\n endrule\nendmodule\n\nendpackage\n" }, { "path": "src/test/resources/samples/langs/Brainfuck/factor.b", "content": "* factor an arbitrarily large positive integer\n*\n* Copyright (C) 1999 by Brian Raiter\n* under the GNU General Public License\n\n>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>-\n\n*\n* read in the number\n*\n\n<<<<<<<<<+\n[-[>>>>>>>>>>][-]<<<<<<<<<<[[->>>>>>>>>>+<<<<<<<<<<]<<<<<<<<<<]\n >>>>>>>>>>,----------]\n>>>>>>>>>>[------------------------------------->>>>>>>>>->]\n<[+>[>>>>>>>>>+>]<-<<<<<<<<<<]-\n\n*\n* display the number and initialize the loop variable to two\n*\n\n[>++++++++++++++++++++++++++++++++++++++++++++++++.\n ------------------------------------------------<<<<<<<<<<<]\n++++++++++++++++++++++++++++++++++++++++++++++++++++++++++.\n--------------------------.[-]\n>>>>>>>>>>>>++<<<<+\n\n*\n* the main loop\n*\n\n[ [-]>>\n\n *\n * make copies of the number and the loop variable\n *\n\n [>>>>[-]>[-]>[-]>[-]\n >[-]>[-]\n <<<<<<<[->>>+>+<<<<]>>>>>>>>]\n <<<<<<<<<<[>>>>>>[-<<<<+>>>>]<<<<<<<<<<<<<<<<]>>>>>>>>>>\n [>[->>>+>>+<<<<<]>>>>>>>>>]\n <<<<<<<<<<[>>>>>>[-<<<<<+>>>>>]<<<<<<<<<<<<<<<<]>>>>>>>>>>\n\n *\n * divide the number by the loop variable\n *\n\n [>>>[-]>>>[-]>[-]>>>] initialize\n <<<<<<<<<<[<<<<<<<<<<]\n >>>>>>>>>[-]>>>>>>>+<<<<<<<<[+]+\n [ ->> double divisor until above dividend\n [>>>>>>[->++<]>>>>]<<<<<<<<<<\n [>>>>>>>>[-]>[-]\n <<<<[->>>++<<<]<<<<<<<<<<<<<<<]>>>>>>>>>>\n [>>>>>>>>[->+<[->+<[->+<[->+<[->+<[->+<[->+<[->+<[->+<\n [->--------->>>>>>>>>+<<<<<<<<<<[->+<]]]]]]]]]]]>>]\n <<<<<<<<<<[>>>>>>>>>[-<+<<<+>>>>]<<<<<<<<<<<<<<<<<<<]>>>>>>>>>>\n [>>>>>>>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>\n [-<--------->>>>>>>>>>>+<<<<<<<<<<[-<+>]]]]]]]]]]]>>>]\n <<<<<<<<<<\n [>>>>[->>>+>>+<<<<<]<<<<<<<<<<<<<<]\n >>>>>>>>>>[>>>>>>>[-<<<+>>>]>>>]<<<<<<<<<<\n [>>>>>>>>[->-<]>\n [<<<<<<<<<[<[-]>>>>>>>>>>[-<<<<<<<<<<+>>>>>>>>>>]<<<<<<<<<<<<<<<<<<<]\n >>>>>>>>>>>>>>>>>>>]\n <<<<<<<<<<<<<<<<<<<]\n >>>>>>>>>[+[+[+[+[+[+[+[+[+[+[[-]<+>]]]]]]]]]]]<\n ]\n >>>>>>>>\n [ subtract divisor from dividend\n <<<<<<\n [>>>>>>>>[-]>[-]<<<<<[->>>+>+<<<<]>>>>>>]<<<<<<<<<<\n [>>>>>>>>[-<<<<+>>>>]<<<[->>>+>+<<<<]<<<<<<<<<<<<<<<]>>>>>>>>>>\n [>>>>>>>>>[-<<<<+>>>>]>]<<<<<<<<<<\n [>>>>>>>>[-<->]<<<<<<<<<<<<<<<<<<]>>>>>>>>>>\n [>>>>>>>[->+<[->+<[->+<[->+<[->+<[->+<[->+<[->+<[->+<[->+<\n [++++++++++[+>-<]>>>>>>>>>>-<<<<<<<<<<]]]]]]]]]]]>>>]\n >>>>>>>+\n [ if difference is nonnegative then\n [-]<<<<<<<<<<<<<<<<< replace dividend and increment quotient\n [>>>>[-]>>>>[-<<<<+>>>>]<<[->>+<<]<<<<<<<<<<<<<<<<]>>>>>>>>>>\n [>>>>>>>>[->+<<<+>>]>>]<<<<<<<<<<\n [>>>[->>>>>>+<<<<<<]<<<<<<<<<<<<<]>>>>>>>>>>\n [>>>>>>>>>[-<<<<<<+>>>>>>[-<<<<<<+>>>>>>\n [-<<<<<<+>>>>>>[-<<<<<<+>>>>>>\n [-<<<<<<+>>>>>>[-<<<<<<+>>>>>>\n [-<<<<<<+>>>>>>[-<<<<<<+>>>>>>\n [-<<<<<<+>>>>>>[-<<<<<<--------->>>>>>>>>>>>>>>>+<<<<<<<<<<\n [-<<<<<<+>>>>>>]]]]]]]]]]]>]\n >>>>>>>\n ] halve divisor and loop until zero\n <<<<<<<<<<<<<<<<<[<<<<<<<<<<]>>>>>>>>>>\n [>>>>>>>>[-]<<[->+<]<[->>>+<<<]>>>>>]<<<<<<<<<<\n [+>>>>>>>[-<<<<<<<+>>>>>>>[-<<<<<<<->>>>>>+>\n [-<<<<<<<+>>>>>>>[-<<<<<<<->>>>>>+>\n [-<<<<<<<+>>>>>>>[-<<<<<<<->>>>>>+>\n [-<<<<<<<+>>>>>>>[-<<<<<<<->>>>>>+>\n [-<<<<<<<+>>>>>>>]]]]]]]]]<<<<<<<\n [->>>>>>>+<<<<<<<]-<<<<<<<<<<]\n >>>>>>>\n [-<<<<<<<<<<<+>>>>>>>>>>>]\n >>>[>>>>>>>[-<<<<<<<<<<<+++++>>>>>>>>>>>]>>>]<<<<<<<<<<\n [+>>>>>>>>[-<<<<<<<<+>>>>>>>>[-<<<<<<<<->>>>>+>>>\n [-<<<<<<<<+>>>>>>>>[-<<<<<<<<->>>>>+>>>\n [-<<<<<<<<+>>>>>>>>[-<<<<<<<<->>>>>+>>>\n [-<<<<<<<<+>>>>>>>>[-<<<<<<<<->>>>>+>>>\n [-<<<<<<<<+>>>>>>>>]]]]]]]]]<<<<<<<<\n [->>>>>>>>+<<<<<<<<]-<<<<<<<<<<]\n >>>>>>>>[-<<<<<<<<<<<<<+>>>>>>>>>>>>>]>>\n [>>>>>>>>[-<<<<<<<<<<<<<+++++>>>>>>>>>>>>>]>>]<<<<<<<<<<\n [<<<<<<<<<<]>>>>>>>>>>\n >>>>>>\n ]\n <<<<<<\n\n *\n * make copies of the loop variable and the quotient\n *\n\n [>>>[->>>>+>+<<<<<]>>>>>>>]\n <<<<<<<<<<\n [>>>>>>>[-<<<<+>>>>]<<<<<[->>>>>+>>+<<<<<<<]<<<<<<<<<<<<]\n >>>>>>>>>>[>>>>>>>[-<<<<<+>>>>>]>>>]<<<<<<<<<<\n\n *\n * break out of the loop if the quotient is larger than the loop variable\n *\n\n [>>>>>>>>>[-<->]<\n [<<<<<<<<\n [<<[-]>>>>>>>>>>[-<<<<<<<<<<+>>>>>>>>>>]<<<<<<<<<<<<<<<<<<]\n >>>>>>>>>>>>>>>>>>]<<<<<<<<<<<<<<<<<<]\n >>>>>>>>[>-<[+[+[+[+[+[+[+[+[+[[-]>+<]]]]]]]]]]]>+\n\n [ [-]\n\n *\n * partially increment the loop variable\n *\n\n <[-]+>>>>+>>>>>>>>[>>>>>>>>>>]<<<<<<<<<<\n\n *\n * examine the remainder for nonzero digits\n *\n\n [<<<<<<[<<<<[<<<<<<<<<<]>>>>+<<<<<<<<<<]<<<<]\n >>>>>>>>>>>>>>>>>>>>[>>>>>>>>>>]<<<<<<<<<<[<<<<<<<<<<]\n >>>>-\n\n [ [+]\n\n *\n * decrement the loop variable and replace the number with the quotient\n *\n\n >>>>>>>>-<<[>[-]>>[-<<+>>]>>>>>>>]<<<<<<<<<<\n\n *\n * display the loop variable\n *\n\n [+>>[>>>>>>>>+>>]<<-<<<<<<<<<<]-\n [>>++++++++++++++++++++++++++++++++++++++++++++++++.\n ------------------------------------------------<<<<<<<<<<<<]\n ++++++++++++++++++++++++++++++++.[-]>>>>\n\n ]\n\n *\n * normalize the loop variable\n *\n\n >>>>>>\n [>>[->>>>>+<<<<<[->>>>>+<<<<<\n [->>>>>+<<<<<[->>>>>+<<<<<\n [->>>>>+<<<<<[->>>>>+<<<<<\n [->>>>>+<<<<<[->>>>>+<<<<<\n [->>>>>+<<<<<[->>>>>--------->>>>>+<<<<<<<<<<\n [->>>>>+<<<<<]]]]]]]]]]]>>>>>>>>]\n <<<<<<<<<<[>>>>>>>[-<<<<<+>>>>>]<<<<<<<<<<<<<<<<<]\n >>>>>>>>>\n\n ]<\n\n]>>\n\n*\n* display the number and end\n*\n\n[>>>>>>>>>>]<<<<<<<<<<[+>[>>>>>>>>>+>]<-<<<<<<<<<<]-\n[>++++++++++++++++++++++++++++++++++++++++++++++++.<<<<<<<<<<<]\n++++++++++.\n" }, { "path": "src/test/resources/samples/langs/Brainfuck/fib100.bf", "content": "# Calculate and output all fibonacci numbers under 100\n\n+++++++++++\n>+>>>>++++++++++++++++++++++++++++++++++++++++++++\n>++++++++++++++++++++++++++++++++<<<<<<[>[>>>>>>+>\n+<<<<<<<-]>>>>>>>[<<<<<<<+>>>>>>>-]<[>++++++++++[-\n<-[>>+>+<<<-]>>>[<<<+>>>-]+<[>[-]<[-]]>[<<[>>>+<<<\n-]>>[-]]<<]>>>[>>+>+<<<-]>>>[<<<+>>>-]+<[>[-]<[-]]\n>[<<+>>[-]]<<<<<<<]>>>>>[+++++++++++++++++++++++++\n+++++++++++++++++++++++.[-]]++++++++++<[->-<]>++++\n++++++++++++++++++++++++++++++++++++++++++++.[-]<<\n<<<<<<<<<<[>>>+>+<<<<-]>>>>[<<<<+>>>>-]<-[>>.>.<<<\n[-]]<<[>>+>+<<<-]>>>[<<<+>>>-]<<[<+>-]>[<+>-]<<<-]" }, { "path": "src/test/resources/samples/langs/Brainfuck/hello.bf", "content": "// More complex version of hello world\n\n>++++++++[<+++++++++>-]<.>>+>+>++>[-]+<[>[->+<<++++>]<<]>.+++++++..+++.>\n>+++++++.<<<[[-]<[-]>]<+++++++++++++++.>>.+++.------.--------.>>+.>++++." }, { "path": "src/test/resources/samples/langs/Brainfuck/helloworld.bf", "content": "// Hello World\n\n++++++++[>++++[>++>+++>+++>+<<<<-]>+>+>->>+[<]<-]>>.>---.+++++++..+++.>>.<-.<.+++.------.--------.>>+.>++." }, { "path": "src/test/resources/samples/langs/Brainfuck/rot13.bf", "content": "# ROT13 cipher\n\n-,+[ Read first character and start outer character reading loop\n -[ Skip forward if character is 0\n >>++++[>++++++++<-] Set up divisor (32) for division loop\n (MEMORY LAYOUT: dividend copy remainder divisor quotient zero zero)\n <+<-[ Set up dividend (x minus 1) and enter division loop\n >+>+>-[>>>] Increase copy and remainder / reduce divisor / Normal case: skip forward\n <[[>+<-]>>+>] Special case: move remainder back to divisor and increase quotient\n <<<<<- Decrement dividend\n ] End division loop\n ]>>>[-]+ End skip loop; zero former divisor and reuse space for a flag\n >--[-[<->+++[-]]]<[ Zero that flag unless quotient was 2 or 3; zero quotient; check flag\n ++++++++++++<[ If flag then set up divisor (13) for second division loop\n (MEMORY LAYOUT: zero copy dividend divisor remainder quotient zero zero)\n >-[>+>>] Reduce divisor; Normal case: increase remainder\n >[+[<+>-]>+>>] Special case: increase remainder / move it back to divisor / increase quotient\n <<<<<- Decrease dividend\n ] End division loop\n >>[<+>-] Add remainder back to divisor to get a useful 13\n >[ Skip forward if quotient was 0\n -[ Decrement quotient and skip forward if quotient was 1\n -<<[-]>> Zero quotient and divisor if quotient was 2\n ]<<[<<->>-]>> Zero divisor and subtract 13 from copy if quotient was 1\n ]<<[<<+>>-] Zero divisor and add 13 to copy if quotient was 0\n ] End outer skip loop (jump to here if ((character minus 1)/32) was not 2 or 3)\n <[-] Clear remainder from first division if second division was skipped\n <.[-] Output ROT13ed character from copy and clear it\n <-,+ Read next character\n] End character reading loop" }, { "path": "src/test/resources/samples/langs/Brightscript/SimpleGrid.brs", "content": "' *********************************************************\n' ** Simple Grid Screen Demonstration App\n' ** Jun 2010\n' ** Copyright (c) 2010 Roku Inc. All Rights Reserved.\n' *********************************************************\n\n'************************************************************\n'** Application startup\n'************************************************************\nSub Main()\n\n 'initialize theme attributes like titles, logos and overhang color\n initTheme()\n \n gridstyle = \"Flat-Movie\"\n\n 'set to go, time to get started\n while gridstyle <> \"\"\n print \"starting grid style= \";gridstyle\n screen=preShowGridScreen(gridstyle)\n gridstyle = showGridScreen(screen, gridstyle)\n end while\n\nEnd Sub\n\n\n'*************************************************************\n'** Set the configurable theme attributes for the application\n'** \n'** Configure the custom overhang and Logo attributes\n'** These attributes affect the branding of the application\n'** and are artwork, colors and offsets specific to the app\n'*************************************************************\n\nSub initTheme()\n app = CreateObject(\"roAppManager\")\n app.SetTheme(CreateDefaultTheme())\nEnd Sub\n\n'******************************************************\n'** @return The default application theme.\n'** Screens can make slight adjustments to the default\n'** theme by getting it from here and then overriding\n'** individual theme attributes.\n'******************************************************\nFunction CreateDefaultTheme() as Object\n theme = CreateObject(\"roAssociativeArray\")\n\n theme.ThemeType = \"generic-dark\"\n\n ' All these are greyscales\n theme.GridScreenBackgroundColor = \"#363636\"\n theme.GridScreenMessageColor = \"#808080\"\n theme.GridScreenRetrievingColor = \"#CCCCCC\"\n theme.GridScreenListNameColor = \"#FFFFFF\"\n\n ' Color values work here\n theme.GridScreenDescriptionTitleColor = \"#001090\"\n theme.GridScreenDescriptionDateColor = \"#FF005B\"\n theme.GridScreenDescriptionRuntimeColor = \"#5B005B\"\n theme.GridScreenDescriptionSynopsisColor = \"#606000\"\n \n 'used in the Grid Screen\n theme.CounterTextLeft = \"#FF0000\"\n theme.CounterSeparator = \"#00FF00\"\n theme.CounterTextRight = \"#0000FF\"\n \n theme.GridScreenLogoHD = \"pkg:/images/Overhang_Test_HD.png\"\n\n theme.GridScreenLogoOffsetHD_X = \"0\"\n theme.GridScreenLogoOffsetHD_Y = \"0\"\n theme.GridScreenOverhangHeightHD = \"99\"\n\n theme.GridScreenLogoSD = \"pkg:/images/Overhang_Test_SD43.png\"\n theme.GridScreenOverhangHeightSD = \"66\"\n theme.GridScreenLogoOffsetSD_X = \"0\"\n theme.GridScreenLogoOffsetSD_Y = \"0\"\n \n ' to use your own focus ring artwork \n 'theme.GridScreenFocusBorderSD = \"pkg:/images/GridCenter_Border_Movies_SD43.png\"\n 'theme.GridScreenBorderOffsetSD = \"(-26,-25)\"\n 'theme.GridScreenFocusBorderHD = \"pkg:/images/GridCenter_Border_Movies_HD.png\"\n 'theme.GridScreenBorderOffsetHD = \"(-28,-20)\"\n \n ' to use your own description background artwork\n 'theme.GridScreenDescriptionImageSD = \"pkg:/images/Grid_Description_Background_SD43.png\"\n 'theme.GridScreenDescriptionOffsetSD = \"(125,170)\"\n 'theme.GridScreenDescriptionImageHD = \"pkg:/images/Grid_Description_Background_HD.png\"\n 'theme.GridScreenDescriptionOffsetHD = \"(190,255)\"\n \n\n return theme\nEnd Function\n\n'******************************************************\n'** Perform any startup/initialization stuff prior to \n'** initially showing the screen. \n'******************************************************\nFunction preShowGridScreen(style as string) As Object\n\n m.port=CreateObject(\"roMessagePort\")\n screen = CreateObject(\"roGridScreen\")\n screen.SetMessagePort(m.port)\n' screen.SetDisplayMode(\"best-fit\")\n screen.SetDisplayMode(\"scale-to-fill\")\n\n screen.SetGridStyle(style)\n return screen\n\nEnd Function\n\n\n'******************************************************\n'** Display the gird screen and wait for events from \n'** the screen. The screen will show retreiving while\n'** we fetch and parse the feeds for the show posters\n'******************************************************\nFunction showGridScreen(screen As Object, gridstyle as string) As string\n\n print \"enter showGridScreen\"\n\n categoryList = getCategoryList()\n categoryList[0] = \"GridStyle: \" + gridstyle\n screen.setupLists(categoryList.count())\n screen.SetListNames(categoryList)\n StyleButtons = getGridControlButtons()\n screen.SetContentList(0, StyleButtons)\n for i = 1 to categoryList.count()-1\n screen.SetContentList(i, getShowsForCategoryItem(categoryList[i]))\n end for\n screen.Show()\n\n while true\n print \"Waiting for message\"\n msg = wait(0, m.port)\n 'msg = wait(0, screen.GetMessagePort()) ' getmessageport does not work on gridscreen\n print \"Got Message:\";type(msg)\n if type(msg) = \"roGridScreenEvent\" then\n print \"msg= \"; msg.GetMessage() \" , index= \"; msg.GetIndex(); \" data= \"; msg.getData()\n if msg.isListItemFocused() then\n print\"list item focused | current show = \"; msg.GetIndex()\n else if msg.isListItemSelected() then\n row = msg.GetIndex()\n selection = msg.getData()\n print \"list item selected row= \"; row; \" selection= \"; selection\n\n ' Did we get a selection from the gridstyle selection row?\n if (row = 0)\n ' yes, return so we can come back with new style\n return StyleButtons[selection].Title\n endif\n\n 'm.curShow = displayShowDetailScreen(showList[msg.GetIndex()])\n else if msg.isScreenClosed() then\n return \"\"\n end if\n end If\n end while\n\n\nEnd Function\n\n'**********************************************************\n'** When a poster on the home screen is selected, we call\n'** this function passing an roAssociativeArray with the \n'** ContentMetaData for the selected show. This data should \n'** be sufficient for the springboard to display\n'**********************************************************\nFunction displayShowDetailScreen(category as Object, showIndex as Integer) As Integer\n\n 'add code to create springboard, for now we do nothing\n return 1\n\nEnd Function\n\n\n'**************************************************************\n'** Return the list of categories to display in the filter\n'** banner. The result is an roArray containing the names of \n'** all of the categories. All just static data for the example.\n'***************************************************************\nFunction getCategoryList() As Object\n\n categoryList = [ \"GridStyle\", \"Reality\", \"History\", \"News\", \"Comedy\", \"Drama\"]\n return categoryList\n\nEnd Function\n\n\n'********************************************************************\n'** Given the category from the filter banner, return an array \n'** of ContentMetaData objects (roAssociativeArray's) representing \n'** the shows for the category. For this example, we just cheat and\n'** create and return a static array with just the minimal items\n'** set, but ideally, you'd go to a feed service, fetch and parse\n'** this data dynamically, so content for each category is dynamic\n'********************************************************************\nFunction getShowsForCategoryItem(category As Object) As Object\n\n print \"getting shows for category \"; category\n\n showList = [\n {\n Title: category + \": Header\",\n releaseDate: \"1976\",\n length: 3600-600,\n Description:\"This row is category \" + category,\n hdBranded: true,\n HDPosterUrl:\"http://upload.wikimedia.org/wikipedia/commons/4/43/Gold_star_on_blue.gif\",\n SDPosterUrl:\"http://upload.wikimedia.org/wikipedia/commons/4/43/Gold_star_on_blue.gif\",\n Description:\"Short Synopsis #1\",\n Synopsis:\"Length\",\n StarRating:10,\n }\n {\n Title: category + \": Beverly Hillbillies\",\n releaseDate: \"1969\",\n rating: \"PG\",\n Description:\"Come and listen to a story about a man named Jed: Poor mountaineer, barely kept his family fed. Then one day he was shootin at some food, and up through the ground came a bubblin crude. Oil that is, black gold, Texas tea.\",\n numEpisodes:42,\n contentType:\"season\",\n HDPosterUrl:\"http://upload.wikimedia.org/wikipedia/en/4/4e/The_Beverly_Hillbillies.jpg\",\n SDPosterUrl:\"http://upload.wikimedia.org/wikipedia/en/4/4e/The_Beverly_Hillbillies.jpg\",\n StarRating:80,\n UserStarRating:40\n }\n {\n Title: category + \": Babylon 5\",\n releaseDate: \"1996\",\n rating: \"PG\",\n Description:\"The show centers on the Babylon 5 space station: a focal point for politics, diplomacy, and conflict during the years 2257-2262.\",\n numEpisodes:102,\n contentType:\"season\",\n HDPosterUrl:\"http://upload.wikimedia.org/wikipedia/en/9/9d/Smb5-s4.jpg\",\n SDPosterUrl:\"http://upload.wikimedia.org/wikipedia/en/9/9d/Smb5-s4.jpg\",\n StarRating:80,\n UserStarRating:40\n }\n {\n Title: category + \": John F. Kennedy\",\n releaseDate: \"1961\",\n rating: \"PG\",\n Description:\"My fellow citizens of the world: ask not what America will do for you, but what together we can do for the freedom of man.\",\n HDPosterUrl:\"http://upload.wikimedia.org/wikipedia/en/5/52/Jfk_happy_birthday_1.jpg\",\n SDPosterUrl:\"http://upload.wikimedia.org/wikipedia/en/5/52/Jfk_happy_birthday_1.jpg\",\n StarRating:100\n }\n {\n Title: category + \": Man on the Moon\",\n releaseDate: \"1969\",\n rating: \"PG\",\n Description:\"That's one small step for a man, one giant leap for mankind.\",\n HDPosterUrl:\"http://upload.wikimedia.org/wikipedia/commons/1/1e/Apollo_11_first_step.jpg\",\n SDPosterUrl:\"http://upload.wikimedia.org/wikipedia/commons/1/1e/Apollo_11_first_step.jpg\",\n StarRating:100\n }\n {\n Title: category + \": I have a Dream\",\n releaseDate: \"1963\",\n rating: \"PG\",\n Description:\"I have a dream that my four little children will one day live in a nation where they will not be judged by the color of their skin, but by the content of their character.\",\n HDPosterUrl:\"http://upload.wikimedia.org/wikipedia/commons/8/81/Martin_Luther_King_-_March_on_Washington.jpg\",\n SDPosterUrl:\"http://upload.wikimedia.org/wikipedia/commons/8/81/Martin_Luther_King_-_March_on_Washington.jpg\",\n StarRating:100\n }\n ]\n\n return showList\nEnd Function\n \nfunction getGridControlButtons() as object\n buttons = [\n { Title: \"Flat-Movie\"\n ReleaseDate: \"HD:5x2 SD:5x2\"\n Description: \"Flat-Movie (Netflix) style\"\n HDPosterUrl:\"http://upload.wikimedia.org/wikipedia/commons/4/43/Gold_star_on_blue.gif\"\n SDPosterUrl:\"http://upload.wikimedia.org/wikipedia/commons/4/43/Gold_star_on_blue.gif\"\n }\n { Title: \"Flat-Landscape\"\n ReleaseDate: \"HD:5x3 SD:4x3\"\n Description: \"Channel Store\"\n HDPosterUrl:\"http://upload.wikimedia.org/wikipedia/commons/thumb/9/96/Dunkery_Hill.jpg/800px-Dunkery_Hill.jpg\",\n SDPosterUrl:\"http://upload.wikimedia.org/wikipedia/commons/thumb/9/96/Dunkery_Hill.jpg/800px-Dunkery_Hill.jpg\",\n }\n { Title: \"Flat-Portrait\"\n ReleaseDate: \"HD:5x2 SD:5x2\"\n Description: \"3x4 style posters\"\n HDPosterUrl:\"http://upload.wikimedia.org/wikipedia/commons/9/9f/Kane_George_Gurnett.jpg\",\n SDPosterUrl:\"http://upload.wikimedia.org/wikipedia/commons/9/9f/Kane_George_Gurnett.jpg\",\n }\n { Title: \"Flat-Square\"\n ReleaseDate: \"HD:7x3 SD:6x3\"\n Description: \"1x1 style posters\"\n HDPosterUrl:\"http://upload.wikimedia.org/wikipedia/commons/thumb/d/de/SQUARE_SHAPE.svg/536px-SQUARE_SHAPE.svg.png\",\n SDPosterUrl:\"http://upload.wikimedia.org/wikipedia/commons/thumb/d/de/SQUARE_SHAPE.svg/536px-SQUARE_SHAPE.svg.png\",\n }\n { Title: \"Flat-16x9\"\n ReleaseDate: \"HD:5x3 SD:4x3\"\n Description: \"HD style posters\"\n HDPosterUrl:\"http://upload.wikimedia.org/wikipedia/commons/thumb/2/22/%C3%89cran_TV_plat.svg/200px-%C3%89cran_TV_plat.svg.png\",\n SDPosterUrl:\"http://upload.wikimedia.org/wikipedia/commons/thumb/2/22/%C3%89cran_TV_plat.svg/200px-%C3%89cran_TV_plat.svg.png\",\n }\n ]\n return buttons\nEnd Function\n" }, { "path": "src/test/resources/samples/langs/C/2D.C", "content": "#include \"2D.h\"\r\n#include \r\n\r\nvoid set_vgabasemem(void)\r\n{\r\n ULONG vgabase;\r\n SELECTOR tmp;\r\n asm mov [tmp], ds\r\n dpmi_get_sel_base(&vgabase, tmp);\r\n vgabasemem = (char *)(-vgabase + 0xa0000);\r\n}\r\n\r\nvoid drw_chdis(int mode) // change the display!\r\n{\r\n regs.b.ah = 0x00; // seet theh display moode\r\n regs.b.al = mode; // change it to the mode like innit\r\n regs.h.flags = 0x72;// Set the dingoes kidneys out of FLAGS eh?\r\n regs.h.ss = 0; // Like, totally set the stack segment\r\n regs.h.sp = 0; // Set tha stack pointaaaaahhhhh!!!\r\n dpmi_simulate_real_interrupt(0x10, ®s);\r\n}\r\n\r\nvoid drw_pix(int x, int y, enum COLORS col)\r\n{\r\n *VGAPIX(x, y) = col;\r\n}\r\n\r\nvoid drw_line(int x0, int y0, int x1, int y1, enum COLORS col)\r\n{\r\n // Going for the optimized version of bresenham's line algo. \r\n int stp = (abs(y0 - y1) > abs(x0 - x1));\r\n int tmp, dx, dy, err, yi, i, j; // yi = y excrement\r\n if (stp) {\r\n // swappity swap\r\n tmp = y0;\r\n y0 = x0;\r\n x0 = tmp;\r\n \r\n tmp = y1;\r\n y1 = x1;\r\n x1 = tmp;\r\n }\r\n // AAAAND NOW WE MUST DO ZEES AGAIN :(\r\n // I'm sure there was a func somewhere that does this? :P\r\n if (x0 > x1) {\r\n tmp = x0;\r\n x0 = x1;\r\n x1 = tmp;\r\n \r\n tmp = y0;\r\n y0 = y1;\r\n y1 = tmp;\r\n }\r\n dx = (x1 - x0);\r\n dy = (abs(y1 - y0));\r\n err = (dx / 2);\r\n\r\n if (y0 < y1)\r\n yi = 1;\r\n else\r\n yi = -1;\r\n j = y0;\r\n for (i = x0; i < x1; i++)\r\n {\r\n if (stp)\r\n *VGAPIX(j, i) = col;\r\n else\r\n *VGAPIX(i, j) = col;\r\n\r\n err -= dy;\r\n if (err < 0) {\r\n j += yi;\r\n err += dx;\r\n }\r\n }\r\n}\r\n\r\nvoid drw_rectl(int x, int y, int w, int h, enum COLORS col)\r\n{\r\n drw_line(x, y, x+w, y, col);\r\n drw_line(x+w, y, x+w, y+h, col);\r\n\r\n drw_line(x, y, x, y+h, col);\r\n drw_line(x, y+h, x+w+1, y+h, col);\r\n}\r\n\r\nvoid drw_rectf(int x, int y, int w, int h, enum COLORS col)\r\n{\r\n int i, j;\r\n for (j = y; j < x+h; j++) {\r\n for (i = x; i < y+w; i++) {\r\n *VGAPIX(i, j) = col;\r\n }\r\n }\r\n}\r\n\r\nvoid drw_circl(int x, int y, int rad, enum COLORS col)\r\n{\r\n int mang, i; // max angle, haha\r\n int px, py;\r\n mang = 360; // Yeah yeah I'll switch to rad later\r\n for (i = 0; i <= mang; i++)\r\n { \r\n px = cos(i)*rad + x; // + px; // causes some really cools effects! :D\r\n py = sin(i)*rad + y; // + py;\r\n *VGAPIX(px, py) = col;\r\n }\r\n}\r\n\r\nvoid drw_tex(int x, int y, int w, int h, enum COLORS tex[])\r\n{ // i*w+j\r\n int i, j;\r\n for (i = 0; i < w; i++)\r\n {\r\n for (j = 0; j < h; j++)\r\n {\r\n *VGAPIX(x+i, y+j) = tex[j*w+i];\r\n }\r\n }\r\n}\r\n\r\nvoid 2D_init(void)\r\n{\r\n set_vgabasemem();\r\n drw_chdis(0x13);\r\n}\r\n\r\nvoid 2D_exit(void)\r\n{\r\n drw_chdis(3);\r\n}\r\n/*\r\nint main()\r\n{\r\n set_vgabasemem();\r\n drw_chdis(0x13);\r\n\r\n while(!kbhit()) {\r\n if ((getch()) == 0x1b) // escape\r\n break;\r\n }\r\n drw_chdis(3);\r\n return 0;\r\n}\r\n*/\r\n" }, { "path": "src/test/resources/samples/langs/C/2D.H", "content": "#ifndef __2DGFX\r\n#define __2DGFX\r\n// Includes\r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n// Defines\r\n#define VGAPIX(x,y) (vgabasemem + (x) + (y) * 320)\r\n\r\n// Variables\r\nchar * vgabasemem;\r\nDPMI_REGS regs;\r\n\r\n// Drawing functions:\r\n//void setvgabasemem(void);\r\nvoid drw_chdis(int mode); // draw_func_change_display\r\nvoid drw_pix(int x, int y, enum COLORS col);\r\nvoid drw_line(int x0, int y0, int x1, int y1, enum COLORS col);\r\nvoid drw_rectl(int x, int y, int w, int h, enum COLORS col);\r\nvoid drw_rectf(int x, int y, int w, int h, enum COLORS col);\r\nvoid drw_cirl(int x, int y, int rad, enum COLORS col);\r\nvoid drw_tex(int x, int y, int w, int h, enum COLORS tex[]);\r\nvoid 2D_init(void);\r\nvoid 2D_exit(void);\r\n\r\n\r\n#endif\r\n" }, { "path": "src/test/resources/samples/langs/C/Arduino.cats", "content": "/** The MIT License (MIT)\n\nCopyright (c) 2014 Hongwei Xi\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// Source: https://github.com/githwxi/ATS-Postiats-contrib/blob/master/contrib/arduino/CATS/Arduino.cats\n\n\n/*\n** The prelude for Ardunio\n*/\n\n/* ****** ****** */\n\n#ifndef ARDUINO_CATS_ARDUINO\n#define ARDUINO_CATS_ARDUINO\n\n/* ****** ****** */\n\n#include \n\n/* ****** ****** */\n\n#define delay_int(ms) delay(ms)\n#define delay_ulint(ms) delay(ms)\n\n/* ****** ****** */\n//\n#define random_int_1(x) random(x)\n#define random_int_2(x, y) random(x, y)\n#define random_lint_1(x) random(x)\n#define random_lint_2(x, y) random(x, y)\n//\n#define randomSeed_int(x) randomSeed(x)\n#define randomSeed_uint(x) randomSeed(x)\n//\n/* ****** ****** */\n\n#endif // #ifndef(ARDUINO_CATS_ARDUINO)\n\n/* ****** ****** */\n\n/* end of [Arduino.cats] */\n" }, { "path": "src/test/resources/samples/langs/C/ArrowLeft.h", "content": "/*\n * This file is part of GTK++ (libGTK++)\n * Copyright © 2012 Rachel Mant (dx-mon@users.sourceforge.net)\n *\n * GTK++ is free software: you can redistribute it and/or modify\n * it under the terms of the GNU Lesser 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 * GTK++ 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 Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public License\n * along with this program. If not, see .\n */\n\n/* GdkPixbuf RGBA C-Source image dump */\n\n#ifdef __SUNPRO_C\n#pragma align 4 (ArrowLeft)\n#endif\n#ifdef __GNUC__\nstatic const uint8_t ArrowLeft[] __attribute__ ((__aligned__ (4))) = \n#else\nstatic const uint8_t ArrowLeft[] = \n#endif\n{ \"\"\n /* Pixbuf magic (0x47646b50) */\n \"GdkP\"\n /* length: header (24) + pixel_data (1600) */\n \"\\0\\0\\6X\"\n /* pixdata_type (0x1010002) */\n \"\\1\\1\\0\\2\"\n /* rowstride (80) */\n \"\\0\\0\\0P\"\n /* width (20) */\n \"\\0\\0\\0\\24\"\n /* height (20) */\n \"\\0\\0\\0\\24\"\n /* pixel_data: */\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\377\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\377\\0\\0\\0\\377\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\377\\0\\0\\0\\377\\0\\0\\0\\377\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\377\\0\\0\\0\\377\\0\\0\\0\\377\"\n \"\\0\\0\\0\\377\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\377\\0\\0\\0\\377\\0\\0\\0\\377\\0\\0\\0\\377\\0\\0\\0\\377\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\377\\0\\0\\0\\377\\0\\0\\0\\377\\0\\0\\0\\377\\0\\0\\0\\377\"\n \"\\0\\0\\0\\377\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\377\\0\\0\\0\\377\\0\\0\\0\\377\\0\\0\\0\\377\\0\\0\\0\\377\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\377\\0\\0\\0\\377\\0\\0\\0\\377\\0\"\n \"\\0\\0\\377\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\377\\0\\0\\0\\377\\0\\0\\0\\377\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\377\\0\\0\\0\\377\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\377\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\"\n \"\\0\\0\"};\n\n\n" }, { "path": "src/test/resources/samples/langs/C/GLKMatrix4.h", "content": "//\n// GLKMatrix4.h\n// GLKit\n//\n// Copyright (c) 2011, Apple Inc. All rights reserved.\n//\n\n#ifndef __GLK_MATRIX_4_H\n#define __GLK_MATRIX_4_H\n\n#include \n#include \n#include \n\n#if defined(__ARM_NEON__)\n#include \n#endif\n\n#include \n#include \n#include \n#include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n#pragma mark -\n#pragma mark Prototypes\n#pragma mark -\n\nextern const GLKMatrix4 GLKMatrix4Identity;\n\n/*\n m30, m31, and m32 correspond to the translation values tx, ty, tz, respectively.\n */\nstatic __inline__ GLKMatrix4 GLKMatrix4Make(float m00, float m01, float m02, float m03,\n float m10, float m11, float m12, float m13,\n float m20, float m21, float m22, float m23,\n float m30, float m31, float m32, float m33);\n\n/*\n m03, m13, and m23 correspond to the translation values tx, ty, tz, respectively.\n */\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeAndTranspose(float m00, float m01, float m02, float m03,\n float m10, float m11, float m12, float m13,\n float m20, float m21, float m22, float m23,\n float m30, float m31, float m32, float m33);\n\n/*\n m[12], m[13], and m[14] correspond to the translation values tx, ty, and tz, respectively.\n */\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeWithArray(float values[16]);\n\n/*\n m[3], m[7], and m[11] correspond to the translation values tx, ty, and tz, respectively.\n */\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeWithArrayAndTranspose(float values[16]);\n\n/*\n row0, row1, and row2's last component should correspond to the translation values tx, ty, and tz, respectively.\n */\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeWithRows(GLKVector4 row0,\n GLKVector4 row1,\n GLKVector4 row2,\n GLKVector4 row3);\n\n/*\n column3's first three components should correspond to the translation values tx, ty, and tz.\n */\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeWithColumns(GLKVector4 column0,\n GLKVector4 column1,\n GLKVector4 column2,\n GLKVector4 column3);\n\n/*\n The quaternion will be normalized before conversion.\n */\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeWithQuaternion(GLKQuaternion quaternion);\n\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeTranslation(float tx, float ty, float tz);\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeScale(float sx, float sy, float sz);\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeRotation(float radians, float x, float y, float z);\n\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeXRotation(float radians);\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeYRotation(float radians);\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeZRotation(float radians);\n\n/*\n Equivalent to gluPerspective.\n */\nstatic __inline__ GLKMatrix4 GLKMatrix4MakePerspective(float fovyRadians, float aspect, float nearZ, float farZ);\n\n/*\n Equivalent to glFrustum.\n */\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeFrustum(float left, float right,\n float bottom, float top,\n float nearZ, float farZ);\n\n/*\n Equivalent to glOrtho.\n */\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeOrtho(float left, float right,\n float bottom, float top,\n float nearZ, float farZ);\n\n/*\n Equivalent to gluLookAt.\n */\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeLookAt(float eyeX, float eyeY, float eyeZ,\n float centerX, float centerY, float centerZ,\n float upX, float upY, float upZ);\n\n/*\n Returns the upper left 3x3 portion of the 4x4 matrix.\n */\nstatic __inline__ GLKMatrix3 GLKMatrix4GetMatrix3(GLKMatrix4 matrix);\n/*\n Returns the upper left 2x2 portion of the 4x4 matrix.\n */\nstatic __inline__ GLKMatrix2 GLKMatrix4GetMatrix2(GLKMatrix4 matrix);\n\n/*\n GLKMatrix4GetRow returns vectors for rows 0, 1, and 2 whose last component will be the translation value tx, ty, and tz, respectively.\n Valid row values range from 0 to 3, inclusive.\n */\nstatic __inline__ GLKVector4 GLKMatrix4GetRow(GLKMatrix4 matrix, int row);\n/*\n GLKMatrix4GetColumn returns a vector for column 3 whose first three components will be the translation values tx, ty, and tz.\n Valid column values range from 0 to 3, inclusive.\n */\nstatic __inline__ GLKVector4 GLKMatrix4GetColumn(GLKMatrix4 matrix, int column);\n\n/*\n GLKMatrix4SetRow expects that the vector for row 0, 1, and 2 will have a translation value as its last component.\n Valid row values range from 0 to 3, inclusive.\n */\nstatic __inline__ GLKMatrix4 GLKMatrix4SetRow(GLKMatrix4 matrix, int row, GLKVector4 vector);\n/*\n GLKMatrix4SetColumn expects that the vector for column 3 will contain the translation values tx, ty, and tz as its first three components, respectively.\n Valid column values range from 0 to 3, inclusive.\n */\nstatic __inline__ GLKMatrix4 GLKMatrix4SetColumn(GLKMatrix4 matrix, int column, GLKVector4 vector);\n\nstatic __inline__ GLKMatrix4 GLKMatrix4Transpose(GLKMatrix4 matrix);\n\nGLKMatrix4 GLKMatrix4Invert(GLKMatrix4 matrix, bool *isInvertible);\nGLKMatrix4 GLKMatrix4InvertAndTranspose(GLKMatrix4 matrix, bool *isInvertible);\n\nstatic __inline__ GLKMatrix4 GLKMatrix4Multiply(GLKMatrix4 matrixLeft, GLKMatrix4 matrixRight);\n\nstatic __inline__ GLKMatrix4 GLKMatrix4Add(GLKMatrix4 matrixLeft, GLKMatrix4 matrixRight);\nstatic __inline__ GLKMatrix4 GLKMatrix4Subtract(GLKMatrix4 matrixLeft, GLKMatrix4 matrixRight);\n\nstatic __inline__ GLKMatrix4 GLKMatrix4Translate(GLKMatrix4 matrix, float tx, float ty, float tz);\nstatic __inline__ GLKMatrix4 GLKMatrix4TranslateWithVector3(GLKMatrix4 matrix, GLKVector3 translationVector);\n/*\n The last component of the GLKVector4, translationVector, is ignored.\n */\nstatic __inline__ GLKMatrix4 GLKMatrix4TranslateWithVector4(GLKMatrix4 matrix, GLKVector4 translationVector);\n\nstatic __inline__ GLKMatrix4 GLKMatrix4Scale(GLKMatrix4 matrix, float sx, float sy, float sz);\nstatic __inline__ GLKMatrix4 GLKMatrix4ScaleWithVector3(GLKMatrix4 matrix, GLKVector3 scaleVector);\n/*\n The last component of the GLKVector4, scaleVector, is ignored.\n */\nstatic __inline__ GLKMatrix4 GLKMatrix4ScaleWithVector4(GLKMatrix4 matrix, GLKVector4 scaleVector);\n\nstatic __inline__ GLKMatrix4 GLKMatrix4Rotate(GLKMatrix4 matrix, float radians, float x, float y, float z);\nstatic __inline__ GLKMatrix4 GLKMatrix4RotateWithVector3(GLKMatrix4 matrix, float radians, GLKVector3 axisVector);\n/*\n The last component of the GLKVector4, axisVector, is ignored.\n */\nstatic __inline__ GLKMatrix4 GLKMatrix4RotateWithVector4(GLKMatrix4 matrix, float radians, GLKVector4 axisVector);\n\nstatic __inline__ GLKMatrix4 GLKMatrix4RotateX(GLKMatrix4 matrix, float radians);\nstatic __inline__ GLKMatrix4 GLKMatrix4RotateY(GLKMatrix4 matrix, float radians);\nstatic __inline__ GLKMatrix4 GLKMatrix4RotateZ(GLKMatrix4 matrix, float radians);\n\n/*\n Assumes 0 in the w component.\n */\nstatic __inline__ GLKVector3 GLKMatrix4MultiplyVector3(GLKMatrix4 matrixLeft, GLKVector3 vectorRight);\n/*\n Assumes 1 in the w component.\n */\nstatic __inline__ GLKVector3 GLKMatrix4MultiplyVector3WithTranslation(GLKMatrix4 matrixLeft, GLKVector3 vectorRight);\n/*\n Assumes 1 in the w component and divides the resulting vector by w before returning.\n */\nstatic __inline__ GLKVector3 GLKMatrix4MultiplyAndProjectVector3(GLKMatrix4 matrixLeft, GLKVector3 vectorRight);\n\n/*\n Assumes 0 in the w component.\n */\nstatic __inline__ void GLKMatrix4MultiplyVector3Array(GLKMatrix4 matrix, GLKVector3 *vectors, size_t vectorCount);\n/*\n Assumes 1 in the w component.\n */\nstatic __inline__ void GLKMatrix4MultiplyVector3ArrayWithTranslation(GLKMatrix4 matrix, GLKVector3 *vectors, size_t vectorCount);\n/*\n Assumes 1 in the w component and divides the resulting vector by w before returning.\n */\nstatic __inline__ void GLKMatrix4MultiplyAndProjectVector3Array(GLKMatrix4 matrix, GLKVector3 *vectors, size_t vectorCount);\n\nstatic __inline__ GLKVector4 GLKMatrix4MultiplyVector4(GLKMatrix4 matrixLeft, GLKVector4 vectorRight);\n\nstatic __inline__ void GLKMatrix4MultiplyVector4Array(GLKMatrix4 matrix, GLKVector4 *vectors, size_t vectorCount);\n\n#pragma mark -\n#pragma mark Implementations\n#pragma mark -\n\nstatic __inline__ GLKMatrix4 GLKMatrix4Make(float m00, float m01, float m02, float m03,\n float m10, float m11, float m12, float m13,\n float m20, float m21, float m22, float m23,\n float m30, float m31, float m32, float m33)\n{\n GLKMatrix4 m = { m00, m01, m02, m03,\n m10, m11, m12, m13,\n m20, m21, m22, m23,\n m30, m31, m32, m33 };\n return m;\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeAndTranspose(float m00, float m01, float m02, float m03,\n float m10, float m11, float m12, float m13,\n float m20, float m21, float m22, float m23,\n float m30, float m31, float m32, float m33)\n{\n GLKMatrix4 m = { m00, m10, m20, m30,\n m01, m11, m21, m31,\n m02, m12, m22, m32,\n m03, m13, m23, m33 };\n return m;\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeWithArray(float values[16])\n{\n GLKMatrix4 m = { values[0], values[1], values[2], values[3],\n values[4], values[5], values[6], values[7],\n values[8], values[9], values[10], values[11],\n values[12], values[13], values[14], values[15] };\n return m;\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeWithArrayAndTranspose(float values[16])\n{\n#if defined(__ARM_NEON__)\n float32x4x4_t m = vld4q_f32(values);\n return *(GLKMatrix4 *)&m;\n#else\n GLKMatrix4 m = { values[0], values[4], values[8], values[12],\n values[1], values[5], values[9], values[13],\n values[2], values[6], values[10], values[14],\n values[3], values[7], values[11], values[15] };\n return m;\n#endif\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeWithRows(GLKVector4 row0,\n GLKVector4 row1,\n GLKVector4 row2,\n GLKVector4 row3)\n{\n GLKMatrix4 m = { row0.v[0], row1.v[0], row2.v[0], row3.v[0],\n row0.v[1], row1.v[1], row2.v[1], row3.v[1],\n row0.v[2], row1.v[2], row2.v[2], row3.v[2],\n row0.v[3], row1.v[3], row2.v[3], row3.v[3] };\n return m;\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeWithColumns(GLKVector4 column0,\n GLKVector4 column1,\n GLKVector4 column2,\n GLKVector4 column3)\n{\n#if defined(__ARM_NEON__)\n float32x4x4_t m;\n m.val[0] = vld1q_f32(column0.v);\n m.val[1] = vld1q_f32(column1.v);\n m.val[2] = vld1q_f32(column2.v);\n m.val[3] = vld1q_f32(column3.v);\n return *(GLKMatrix4 *)&m;\n#else\n GLKMatrix4 m = { column0.v[0], column0.v[1], column0.v[2], column0.v[3],\n column1.v[0], column1.v[1], column1.v[2], column1.v[3],\n column2.v[0], column2.v[1], column2.v[2], column2.v[3],\n column3.v[0], column3.v[1], column3.v[2], column3.v[3] };\n return m;\n#endif\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeWithQuaternion(GLKQuaternion quaternion)\n{\n quaternion = GLKQuaternionNormalize(quaternion);\n\n float x = quaternion.q[0];\n float y = quaternion.q[1];\n float z = quaternion.q[2];\n float w = quaternion.q[3];\n\n float _2x = x + x;\n float _2y = y + y;\n float _2z = z + z;\n float _2w = w + w;\n\n GLKMatrix4 m = { 1.0f - _2y * y - _2z * z,\n _2x * y + _2w * z,\n _2x * z - _2w * y,\n 0.0f,\n _2x * y - _2w * z,\n 1.0f - _2x * x - _2z * z,\n _2y * z + _2w * x,\n 0.0f,\n _2x * z + _2w * y,\n _2y * z - _2w * x,\n 1.0f - _2x * x - _2y * y,\n 0.0f,\n 0.0f,\n 0.0f,\n 0.0f,\n 1.0f };\n\n return m;\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeTranslation(float tx, float ty, float tz)\n{\n GLKMatrix4 m = GLKMatrix4Identity;\n m.m[12] = tx;\n m.m[13] = ty;\n m.m[14] = tz;\n return m;\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeScale(float sx, float sy, float sz)\n{\n GLKMatrix4 m = GLKMatrix4Identity;\n m.m[0] = sx;\n m.m[5] = sy;\n m.m[10] = sz;\n return m;\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeRotation(float radians, float x, float y, float z)\n{\n GLKVector3 v = GLKVector3Normalize(GLKVector3Make(x, y, z));\n float cos = cosf(radians);\n float cosp = 1.0f - cos;\n float sin = sinf(radians);\n\n GLKMatrix4 m = { cos + cosp * v.v[0] * v.v[0],\n cosp * v.v[0] * v.v[1] + v.v[2] * sin,\n cosp * v.v[0] * v.v[2] - v.v[1] * sin,\n 0.0f,\n cosp * v.v[0] * v.v[1] - v.v[2] * sin,\n cos + cosp * v.v[1] * v.v[1],\n cosp * v.v[1] * v.v[2] + v.v[0] * sin,\n 0.0f,\n cosp * v.v[0] * v.v[2] + v.v[1] * sin,\n cosp * v.v[1] * v.v[2] - v.v[0] * sin,\n cos + cosp * v.v[2] * v.v[2],\n 0.0f,\n 0.0f,\n 0.0f,\n 0.0f,\n 1.0f };\n\n return m;\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeXRotation(float radians)\n{\n float cos = cosf(radians);\n float sin = sinf(radians);\n\n GLKMatrix4 m = { 1.0f, 0.0f, 0.0f, 0.0f,\n 0.0f, cos, sin, 0.0f,\n 0.0f, -sin, cos, 0.0f,\n 0.0f, 0.0f, 0.0f, 1.0f };\n\n return m;\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeYRotation(float radians)\n{\n float cos = cosf(radians);\n float sin = sinf(radians);\n\n GLKMatrix4 m = { cos, 0.0f, -sin, 0.0f,\n 0.0f, 1.0f, 0.0f, 0.0f,\n sin, 0.0f, cos, 0.0f,\n 0.0f, 0.0f, 0.0f, 1.0f };\n\n return m;\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeZRotation(float radians)\n{\n float cos = cosf(radians);\n float sin = sinf(radians);\n\n GLKMatrix4 m = { cos, sin, 0.0f, 0.0f,\n -sin, cos, 0.0f, 0.0f,\n 0.0f, 0.0f, 1.0f, 0.0f,\n 0.0f, 0.0f, 0.0f, 1.0f };\n\n return m;\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4MakePerspective(float fovyRadians, float aspect, float nearZ, float farZ)\n{\n float cotan = 1.0f / tanf(fovyRadians / 2.0f);\n\n GLKMatrix4 m = { cotan / aspect, 0.0f, 0.0f, 0.0f,\n 0.0f, cotan, 0.0f, 0.0f,\n 0.0f, 0.0f, (farZ + nearZ) / (nearZ - farZ), -1.0f,\n 0.0f, 0.0f, (2.0f * farZ * nearZ) / (nearZ - farZ), 0.0f };\n\n return m;\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeFrustum(float left, float right,\n float bottom, float top,\n float nearZ, float farZ)\n{\n float ral = right + left;\n float rsl = right - left;\n float tsb = top - bottom;\n float tab = top + bottom;\n float fan = farZ + nearZ;\n float fsn = farZ - nearZ;\n\n GLKMatrix4 m = { 2.0f * nearZ / rsl, 0.0f, 0.0f, 0.0f,\n 0.0f, 2.0f * nearZ / tsb, 0.0f, 0.0f,\n ral / rsl, tab / tsb, -fan / fsn, -1.0f,\n 0.0f, 0.0f, (-2.0f * farZ * nearZ) / fsn, 0.0f };\n\n return m;\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeOrtho(float left, float right,\n float bottom, float top,\n float nearZ, float farZ)\n{\n float ral = right + left;\n float rsl = right - left;\n float tab = top + bottom;\n float tsb = top - bottom;\n float fan = farZ + nearZ;\n float fsn = farZ - nearZ;\n\n GLKMatrix4 m = { 2.0f / rsl, 0.0f, 0.0f, 0.0f,\n 0.0f, 2.0f / tsb, 0.0f, 0.0f,\n 0.0f, 0.0f, -2.0f / fsn, 0.0f,\n -ral / rsl, -tab / tsb, -fan / fsn, 1.0f };\n\n return m;\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4MakeLookAt(float eyeX, float eyeY, float eyeZ,\n float centerX, float centerY, float centerZ,\n float upX, float upY, float upZ)\n{\n GLKVector3 ev = { eyeX, eyeY, eyeZ };\n GLKVector3 cv = { centerX, centerY, centerZ };\n GLKVector3 uv = { upX, upY, upZ };\n GLKVector3 n = GLKVector3Normalize(GLKVector3Add(ev, GLKVector3Negate(cv)));\n GLKVector3 u = GLKVector3Normalize(GLKVector3CrossProduct(uv, n));\n GLKVector3 v = GLKVector3CrossProduct(n, u);\n\n GLKMatrix4 m = { u.v[0], v.v[0], n.v[0], 0.0f,\n u.v[1], v.v[1], n.v[1], 0.0f,\n u.v[2], v.v[2], n.v[2], 0.0f,\n GLKVector3DotProduct(GLKVector3Negate(u), ev),\n GLKVector3DotProduct(GLKVector3Negate(v), ev),\n GLKVector3DotProduct(GLKVector3Negate(n), ev),\n 1.0f };\n\n return m;\n}\n\nstatic __inline__ GLKMatrix3 GLKMatrix4GetMatrix3(GLKMatrix4 matrix)\n{\n GLKMatrix3 m = { matrix.m[0], matrix.m[1], matrix.m[2],\n matrix.m[4], matrix.m[5], matrix.m[6],\n matrix.m[8], matrix.m[9], matrix.m[10] };\n return m;\n}\n\nstatic __inline__ GLKMatrix2 GLKMatrix4GetMatrix2(GLKMatrix4 matrix)\n{\n GLKMatrix2 m = { matrix.m[0], matrix.m[1],\n matrix.m[4], matrix.m[5] };\n return m;\n}\n\nstatic __inline__ GLKVector4 GLKMatrix4GetRow(GLKMatrix4 matrix, int row)\n{\n GLKVector4 v = { matrix.m[row], matrix.m[4 + row], matrix.m[8 + row], matrix.m[12 + row] };\n return v;\n}\n\nstatic __inline__ GLKVector4 GLKMatrix4GetColumn(GLKMatrix4 matrix, int column)\n{\n#if defined(__ARM_NEON__)\n float32x4_t v = vld1q_f32(&(matrix.m[column * 4]));\n return *(GLKVector4 *)&v;\n#else\n GLKVector4 v = { matrix.m[column * 4 + 0], matrix.m[column * 4 + 1], matrix.m[column * 4 + 2], matrix.m[column * 4 + 3] };\n return v;\n#endif\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4SetRow(GLKMatrix4 matrix, int row, GLKVector4 vector)\n{\n matrix.m[row] = vector.v[0];\n matrix.m[row + 4] = vector.v[1];\n matrix.m[row + 8] = vector.v[2];\n matrix.m[row + 12] = vector.v[3];\n\n return matrix;\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4SetColumn(GLKMatrix4 matrix, int column, GLKVector4 vector)\n{\n#if defined(__ARM_NEON__)\n float *dst = &(matrix.m[column * 4]);\n vst1q_f32(dst, vld1q_f32(vector.v));\n return matrix;\n#else\n matrix.m[column * 4 + 0] = vector.v[0];\n matrix.m[column * 4 + 1] = vector.v[1];\n matrix.m[column * 4 + 2] = vector.v[2];\n matrix.m[column * 4 + 3] = vector.v[3];\n\n return matrix;\n#endif\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4Transpose(GLKMatrix4 matrix)\n{\n#if defined(__ARM_NEON__)\n float32x4x4_t m = vld4q_f32(matrix.m);\n return *(GLKMatrix4 *)&m;\n#else\n GLKMatrix4 m = { matrix.m[0], matrix.m[4], matrix.m[8], matrix.m[12],\n matrix.m[1], matrix.m[5], matrix.m[9], matrix.m[13],\n matrix.m[2], matrix.m[6], matrix.m[10], matrix.m[14],\n matrix.m[3], matrix.m[7], matrix.m[11], matrix.m[15] };\n return m;\n#endif\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4Multiply(GLKMatrix4 matrixLeft, GLKMatrix4 matrixRight)\n{\n#if defined(__ARM_NEON__)\n float32x4x4_t iMatrixLeft = *(float32x4x4_t *)&matrixLeft;\n float32x4x4_t iMatrixRight = *(float32x4x4_t *)&matrixRight;\n float32x4x4_t m;\n\n m.val[0] = vmulq_n_f32(iMatrixLeft.val[0], vgetq_lane_f32(iMatrixRight.val[0], 0));\n m.val[1] = vmulq_n_f32(iMatrixLeft.val[0], vgetq_lane_f32(iMatrixRight.val[1], 0));\n m.val[2] = vmulq_n_f32(iMatrixLeft.val[0], vgetq_lane_f32(iMatrixRight.val[2], 0));\n m.val[3] = vmulq_n_f32(iMatrixLeft.val[0], vgetq_lane_f32(iMatrixRight.val[3], 0));\n\n m.val[0] = vmlaq_n_f32(m.val[0], iMatrixLeft.val[1], vgetq_lane_f32(iMatrixRight.val[0], 1));\n m.val[1] = vmlaq_n_f32(m.val[1], iMatrixLeft.val[1], vgetq_lane_f32(iMatrixRight.val[1], 1));\n m.val[2] = vmlaq_n_f32(m.val[2], iMatrixLeft.val[1], vgetq_lane_f32(iMatrixRight.val[2], 1));\n m.val[3] = vmlaq_n_f32(m.val[3], iMatrixLeft.val[1], vgetq_lane_f32(iMatrixRight.val[3], 1));\n\n m.val[0] = vmlaq_n_f32(m.val[0], iMatrixLeft.val[2], vgetq_lane_f32(iMatrixRight.val[0], 2));\n m.val[1] = vmlaq_n_f32(m.val[1], iMatrixLeft.val[2], vgetq_lane_f32(iMatrixRight.val[1], 2));\n m.val[2] = vmlaq_n_f32(m.val[2], iMatrixLeft.val[2], vgetq_lane_f32(iMatrixRight.val[2], 2));\n m.val[3] = vmlaq_n_f32(m.val[3], iMatrixLeft.val[2], vgetq_lane_f32(iMatrixRight.val[3], 2));\n\n m.val[0] = vmlaq_n_f32(m.val[0], iMatrixLeft.val[3], vgetq_lane_f32(iMatrixRight.val[0], 3));\n m.val[1] = vmlaq_n_f32(m.val[1], iMatrixLeft.val[3], vgetq_lane_f32(iMatrixRight.val[1], 3));\n m.val[2] = vmlaq_n_f32(m.val[2], iMatrixLeft.val[3], vgetq_lane_f32(iMatrixRight.val[2], 3));\n m.val[3] = vmlaq_n_f32(m.val[3], iMatrixLeft.val[3], vgetq_lane_f32(iMatrixRight.val[3], 3));\n\n return *(GLKMatrix4 *)&m;\n#else\n GLKMatrix4 m;\n\n m.m[0] = matrixLeft.m[0] * matrixRight.m[0] + matrixLeft.m[4] * matrixRight.m[1] + matrixLeft.m[8] * matrixRight.m[2] + matrixLeft.m[12] * matrixRight.m[3];\n\tm.m[4] = matrixLeft.m[0] * matrixRight.m[4] + matrixLeft.m[4] * matrixRight.m[5] + matrixLeft.m[8] * matrixRight.m[6] + matrixLeft.m[12] * matrixRight.m[7];\n\tm.m[8] = matrixLeft.m[0] * matrixRight.m[8] + matrixLeft.m[4] * matrixRight.m[9] + matrixLeft.m[8] * matrixRight.m[10] + matrixLeft.m[12] * matrixRight.m[11];\n\tm.m[12] = matrixLeft.m[0] * matrixRight.m[12] + matrixLeft.m[4] * matrixRight.m[13] + matrixLeft.m[8] * matrixRight.m[14] + matrixLeft.m[12] * matrixRight.m[15];\n\n\tm.m[1] = matrixLeft.m[1] * matrixRight.m[0] + matrixLeft.m[5] * matrixRight.m[1] + matrixLeft.m[9] * matrixRight.m[2] + matrixLeft.m[13] * matrixRight.m[3];\n\tm.m[5] = matrixLeft.m[1] * matrixRight.m[4] + matrixLeft.m[5] * matrixRight.m[5] + matrixLeft.m[9] * matrixRight.m[6] + matrixLeft.m[13] * matrixRight.m[7];\n\tm.m[9] = matrixLeft.m[1] * matrixRight.m[8] + matrixLeft.m[5] * matrixRight.m[9] + matrixLeft.m[9] * matrixRight.m[10] + matrixLeft.m[13] * matrixRight.m[11];\n\tm.m[13] = matrixLeft.m[1] * matrixRight.m[12] + matrixLeft.m[5] * matrixRight.m[13] + matrixLeft.m[9] * matrixRight.m[14] + matrixLeft.m[13] * matrixRight.m[15];\n\n\tm.m[2] = matrixLeft.m[2] * matrixRight.m[0] + matrixLeft.m[6] * matrixRight.m[1] + matrixLeft.m[10] * matrixRight.m[2] + matrixLeft.m[14] * matrixRight.m[3];\n\tm.m[6] = matrixLeft.m[2] * matrixRight.m[4] + matrixLeft.m[6] * matrixRight.m[5] + matrixLeft.m[10] * matrixRight.m[6] + matrixLeft.m[14] * matrixRight.m[7];\n\tm.m[10] = matrixLeft.m[2] * matrixRight.m[8] + matrixLeft.m[6] * matrixRight.m[9] + matrixLeft.m[10] * matrixRight.m[10] + matrixLeft.m[14] * matrixRight.m[11];\n\tm.m[14] = matrixLeft.m[2] * matrixRight.m[12] + matrixLeft.m[6] * matrixRight.m[13] + matrixLeft.m[10] * matrixRight.m[14] + matrixLeft.m[14] * matrixRight.m[15];\n\n\tm.m[3] = matrixLeft.m[3] * matrixRight.m[0] + matrixLeft.m[7] * matrixRight.m[1] + matrixLeft.m[11] * matrixRight.m[2] + matrixLeft.m[15] * matrixRight.m[3];\n\tm.m[7] = matrixLeft.m[3] * matrixRight.m[4] + matrixLeft.m[7] * matrixRight.m[5] + matrixLeft.m[11] * matrixRight.m[6] + matrixLeft.m[15] * matrixRight.m[7];\n\tm.m[11] = matrixLeft.m[3] * matrixRight.m[8] + matrixLeft.m[7] * matrixRight.m[9] + matrixLeft.m[11] * matrixRight.m[10] + matrixLeft.m[15] * matrixRight.m[11];\n\tm.m[15] = matrixLeft.m[3] * matrixRight.m[12] + matrixLeft.m[7] * matrixRight.m[13] + matrixLeft.m[11] * matrixRight.m[14] + matrixLeft.m[15] * matrixRight.m[15];\n\n return m;\n#endif\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4Add(GLKMatrix4 matrixLeft, GLKMatrix4 matrixRight)\n{\n#if defined(__ARM_NEON__)\n float32x4x4_t iMatrixLeft = *(float32x4x4_t *)&matrixLeft;\n float32x4x4_t iMatrixRight = *(float32x4x4_t *)&matrixRight;\n float32x4x4_t m;\n\n m.val[0] = vaddq_f32(iMatrixLeft.val[0], iMatrixRight.val[0]);\n m.val[1] = vaddq_f32(iMatrixLeft.val[1], iMatrixRight.val[1]);\n m.val[2] = vaddq_f32(iMatrixLeft.val[2], iMatrixRight.val[2]);\n m.val[3] = vaddq_f32(iMatrixLeft.val[3], iMatrixRight.val[3]);\n\n return *(GLKMatrix4 *)&m;\n#else\n GLKMatrix4 m;\n\n m.m[0] = matrixLeft.m[0] + matrixRight.m[0];\n m.m[1] = matrixLeft.m[1] + matrixRight.m[1];\n m.m[2] = matrixLeft.m[2] + matrixRight.m[2];\n m.m[3] = matrixLeft.m[3] + matrixRight.m[3];\n\n m.m[4] = matrixLeft.m[4] + matrixRight.m[4];\n m.m[5] = matrixLeft.m[5] + matrixRight.m[5];\n m.m[6] = matrixLeft.m[6] + matrixRight.m[6];\n m.m[7] = matrixLeft.m[7] + matrixRight.m[7];\n\n m.m[8] = matrixLeft.m[8] + matrixRight.m[8];\n m.m[9] = matrixLeft.m[9] + matrixRight.m[9];\n m.m[10] = matrixLeft.m[10] + matrixRight.m[10];\n m.m[11] = matrixLeft.m[11] + matrixRight.m[11];\n\n m.m[12] = matrixLeft.m[12] + matrixRight.m[12];\n m.m[13] = matrixLeft.m[13] + matrixRight.m[13];\n m.m[14] = matrixLeft.m[14] + matrixRight.m[14];\n m.m[15] = matrixLeft.m[15] + matrixRight.m[15];\n\n return m;\n#endif\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4Subtract(GLKMatrix4 matrixLeft, GLKMatrix4 matrixRight)\n{\n#if defined(__ARM_NEON__)\n float32x4x4_t iMatrixLeft = *(float32x4x4_t *)&matrixLeft;\n float32x4x4_t iMatrixRight = *(float32x4x4_t *)&matrixRight;\n float32x4x4_t m;\n\n m.val[0] = vsubq_f32(iMatrixLeft.val[0], iMatrixRight.val[0]);\n m.val[1] = vsubq_f32(iMatrixLeft.val[1], iMatrixRight.val[1]);\n m.val[2] = vsubq_f32(iMatrixLeft.val[2], iMatrixRight.val[2]);\n m.val[3] = vsubq_f32(iMatrixLeft.val[3], iMatrixRight.val[3]);\n\n return *(GLKMatrix4 *)&m;\n#else\n GLKMatrix4 m;\n\n m.m[0] = matrixLeft.m[0] - matrixRight.m[0];\n m.m[1] = matrixLeft.m[1] - matrixRight.m[1];\n m.m[2] = matrixLeft.m[2] - matrixRight.m[2];\n m.m[3] = matrixLeft.m[3] - matrixRight.m[3];\n\n m.m[4] = matrixLeft.m[4] - matrixRight.m[4];\n m.m[5] = matrixLeft.m[5] - matrixRight.m[5];\n m.m[6] = matrixLeft.m[6] - matrixRight.m[6];\n m.m[7] = matrixLeft.m[7] - matrixRight.m[7];\n\n m.m[8] = matrixLeft.m[8] - matrixRight.m[8];\n m.m[9] = matrixLeft.m[9] - matrixRight.m[9];\n m.m[10] = matrixLeft.m[10] - matrixRight.m[10];\n m.m[11] = matrixLeft.m[11] - matrixRight.m[11];\n\n m.m[12] = matrixLeft.m[12] - matrixRight.m[12];\n m.m[13] = matrixLeft.m[13] - matrixRight.m[13];\n m.m[14] = matrixLeft.m[14] - matrixRight.m[14];\n m.m[15] = matrixLeft.m[15] - matrixRight.m[15];\n\n return m;\n#endif\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4Translate(GLKMatrix4 matrix, float tx, float ty, float tz)\n{\n GLKMatrix4 m = { matrix.m[0], matrix.m[1], matrix.m[2], matrix.m[3],\n matrix.m[4], matrix.m[5], matrix.m[6], matrix.m[7],\n matrix.m[8], matrix.m[9], matrix.m[10], matrix.m[11],\n matrix.m[0] * tx + matrix.m[4] * ty + matrix.m[8] * tz + matrix.m[12],\n matrix.m[1] * tx + matrix.m[5] * ty + matrix.m[9] * tz + matrix.m[13],\n matrix.m[2] * tx + matrix.m[6] * ty + matrix.m[10] * tz + matrix.m[14],\n matrix.m[15] };\n return m;\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4TranslateWithVector3(GLKMatrix4 matrix, GLKVector3 translationVector)\n{\n GLKMatrix4 m = { matrix.m[0], matrix.m[1], matrix.m[2], matrix.m[3],\n matrix.m[4], matrix.m[5], matrix.m[6], matrix.m[7],\n matrix.m[8], matrix.m[9], matrix.m[10], matrix.m[11],\n matrix.m[0] * translationVector.v[0] + matrix.m[4] * translationVector.v[1] + matrix.m[8] * translationVector.v[2] + matrix.m[12],\n matrix.m[1] * translationVector.v[0] + matrix.m[5] * translationVector.v[1] + matrix.m[9] * translationVector.v[2] + matrix.m[13],\n matrix.m[2] * translationVector.v[0] + matrix.m[6] * translationVector.v[1] + matrix.m[10] * translationVector.v[2] + matrix.m[14],\n matrix.m[15] };\n return m;\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4TranslateWithVector4(GLKMatrix4 matrix, GLKVector4 translationVector)\n{\n GLKMatrix4 m = { matrix.m[0], matrix.m[1], matrix.m[2], matrix.m[3],\n matrix.m[4], matrix.m[5], matrix.m[6], matrix.m[7],\n matrix.m[8], matrix.m[9], matrix.m[10], matrix.m[11],\n matrix.m[0] * translationVector.v[0] + matrix.m[4] * translationVector.v[1] + matrix.m[8] * translationVector.v[2] + matrix.m[12],\n matrix.m[1] * translationVector.v[0] + matrix.m[5] * translationVector.v[1] + matrix.m[9] * translationVector.v[2] + matrix.m[13],\n matrix.m[2] * translationVector.v[0] + matrix.m[6] * translationVector.v[1] + matrix.m[10] * translationVector.v[2] + matrix.m[14],\n matrix.m[15] };\n return m;\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4Scale(GLKMatrix4 matrix, float sx, float sy, float sz)\n{\n#if defined(__ARM_NEON__)\n float32x4x4_t iMatrix = *(float32x4x4_t *)&matrix;\n float32x4x4_t m;\n\n m.val[0] = vmulq_n_f32(iMatrix.val[0], (float32_t)sx);\n m.val[1] = vmulq_n_f32(iMatrix.val[1], (float32_t)sy);\n m.val[2] = vmulq_n_f32(iMatrix.val[2], (float32_t)sz);\n m.val[3] = iMatrix.val[3];\n\n return *(GLKMatrix4 *)&m;\n#else\n GLKMatrix4 m = { matrix.m[0] * sx, matrix.m[1] * sx, matrix.m[2] * sx, matrix.m[3] * sx,\n matrix.m[4] * sy, matrix.m[5] * sy, matrix.m[6] * sy, matrix.m[7] * sy,\n matrix.m[8] * sz, matrix.m[9] * sz, matrix.m[10] * sz, matrix.m[11] * sz,\n matrix.m[12], matrix.m[13], matrix.m[14], matrix.m[15] };\n return m;\n#endif\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4ScaleWithVector3(GLKMatrix4 matrix, GLKVector3 scaleVector)\n{\n#if defined(__ARM_NEON__)\n float32x4x4_t iMatrix = *(float32x4x4_t *)&matrix;\n float32x4x4_t m;\n\n m.val[0] = vmulq_n_f32(iMatrix.val[0], (float32_t)scaleVector.v[0]);\n m.val[1] = vmulq_n_f32(iMatrix.val[1], (float32_t)scaleVector.v[1]);\n m.val[2] = vmulq_n_f32(iMatrix.val[2], (float32_t)scaleVector.v[2]);\n m.val[3] = iMatrix.val[3];\n\n return *(GLKMatrix4 *)&m;\n#else\n GLKMatrix4 m = { matrix.m[0] * scaleVector.v[0], matrix.m[1] * scaleVector.v[0], matrix.m[2] * scaleVector.v[0], matrix.m[3] * scaleVector.v[0],\n matrix.m[4] * scaleVector.v[1], matrix.m[5] * scaleVector.v[1], matrix.m[6] * scaleVector.v[1], matrix.m[7] * scaleVector.v[1],\n matrix.m[8] * scaleVector.v[2], matrix.m[9] * scaleVector.v[2], matrix.m[10] * scaleVector.v[2], matrix.m[11] * scaleVector.v[2],\n matrix.m[12], matrix.m[13], matrix.m[14], matrix.m[15] };\n return m;\n#endif\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4ScaleWithVector4(GLKMatrix4 matrix, GLKVector4 scaleVector)\n{\n#if defined(__ARM_NEON__)\n float32x4x4_t iMatrix = *(float32x4x4_t *)&matrix;\n float32x4x4_t m;\n\n m.val[0] = vmulq_n_f32(iMatrix.val[0], (float32_t)scaleVector.v[0]);\n m.val[1] = vmulq_n_f32(iMatrix.val[1], (float32_t)scaleVector.v[1]);\n m.val[2] = vmulq_n_f32(iMatrix.val[2], (float32_t)scaleVector.v[2]);\n m.val[3] = iMatrix.val[3];\n\n return *(GLKMatrix4 *)&m;\n#else\n GLKMatrix4 m = { matrix.m[0] * scaleVector.v[0], matrix.m[1] * scaleVector.v[0], matrix.m[2] * scaleVector.v[0], matrix.m[3] * scaleVector.v[0],\n matrix.m[4] * scaleVector.v[1], matrix.m[5] * scaleVector.v[1], matrix.m[6] * scaleVector.v[1], matrix.m[7] * scaleVector.v[1],\n matrix.m[8] * scaleVector.v[2], matrix.m[9] * scaleVector.v[2], matrix.m[10] * scaleVector.v[2], matrix.m[11] * scaleVector.v[2],\n matrix.m[12], matrix.m[13], matrix.m[14], matrix.m[15] };\n return m;\n#endif\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4Rotate(GLKMatrix4 matrix, float radians, float x, float y, float z)\n{\n GLKMatrix4 rm = GLKMatrix4MakeRotation(radians, x, y, z);\n return GLKMatrix4Multiply(matrix, rm);\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4RotateWithVector3(GLKMatrix4 matrix, float radians, GLKVector3 axisVector)\n{\n GLKMatrix4 rm = GLKMatrix4MakeRotation(radians, axisVector.v[0], axisVector.v[1], axisVector.v[2]);\n return GLKMatrix4Multiply(matrix, rm);\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4RotateWithVector4(GLKMatrix4 matrix, float radians, GLKVector4 axisVector)\n{\n GLKMatrix4 rm = GLKMatrix4MakeRotation(radians, axisVector.v[0], axisVector.v[1], axisVector.v[2]);\n return GLKMatrix4Multiply(matrix, rm);\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4RotateX(GLKMatrix4 matrix, float radians)\n{\n GLKMatrix4 rm = GLKMatrix4MakeXRotation(radians);\n return GLKMatrix4Multiply(matrix, rm);\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4RotateY(GLKMatrix4 matrix, float radians)\n{\n GLKMatrix4 rm = GLKMatrix4MakeYRotation(radians);\n return GLKMatrix4Multiply(matrix, rm);\n}\n\nstatic __inline__ GLKMatrix4 GLKMatrix4RotateZ(GLKMatrix4 matrix, float radians)\n{\n GLKMatrix4 rm = GLKMatrix4MakeZRotation(radians);\n return GLKMatrix4Multiply(matrix, rm);\n}\n\nstatic __inline__ GLKVector3 GLKMatrix4MultiplyVector3(GLKMatrix4 matrixLeft, GLKVector3 vectorRight)\n{\n GLKVector4 v4 = GLKMatrix4MultiplyVector4(matrixLeft, GLKVector4Make(vectorRight.v[0], vectorRight.v[1], vectorRight.v[2], 0.0f));\n return GLKVector3Make(v4.v[0], v4.v[1], v4.v[2]);\n}\n\nstatic __inline__ GLKVector3 GLKMatrix4MultiplyVector3WithTranslation(GLKMatrix4 matrixLeft, GLKVector3 vectorRight)\n{\n GLKVector4 v4 = GLKMatrix4MultiplyVector4(matrixLeft, GLKVector4Make(vectorRight.v[0], vectorRight.v[1], vectorRight.v[2], 1.0f));\n return GLKVector3Make(v4.v[0], v4.v[1], v4.v[2]);\n}\n\nstatic __inline__ GLKVector3 GLKMatrix4MultiplyAndProjectVector3(GLKMatrix4 matrixLeft, GLKVector3 vectorRight)\n{\n GLKVector4 v4 = GLKMatrix4MultiplyVector4(matrixLeft, GLKVector4Make(vectorRight.v[0], vectorRight.v[1], vectorRight.v[2], 1.0f));\n return GLKVector3MultiplyScalar(GLKVector3Make(v4.v[0], v4.v[1], v4.v[2]), 1.0f / v4.v[3]);\n}\n\nstatic __inline__ void GLKMatrix4MultiplyVector3Array(GLKMatrix4 matrix, GLKVector3 *vectors, size_t vectorCount)\n{\n size_t i;\n for (i=0; i < vectorCount; i++)\n vectors[i] = GLKMatrix4MultiplyVector3(matrix, vectors[i]);\n}\n\nstatic __inline__ void GLKMatrix4MultiplyVector3ArrayWithTranslation(GLKMatrix4 matrix, GLKVector3 *vectors, size_t vectorCount)\n{\n size_t i;\n for (i=0; i < vectorCount; i++)\n vectors[i] = GLKMatrix4MultiplyVector3WithTranslation(matrix, vectors[i]);\n}\n\nstatic __inline__ void GLKMatrix4MultiplyAndProjectVector3Array(GLKMatrix4 matrix, GLKVector3 *vectors, size_t vectorCount)\n{\n size_t i;\n for (i=0; i < vectorCount; i++)\n vectors[i] = GLKMatrix4MultiplyAndProjectVector3(matrix, vectors[i]);\n}\n\nstatic __inline__ GLKVector4 GLKMatrix4MultiplyVector4(GLKMatrix4 matrixLeft, GLKVector4 vectorRight)\n{\n#if defined(__ARM_NEON__)\n float32x4x4_t iMatrix = *(float32x4x4_t *)&matrixLeft;\n float32x4_t v;\n\n iMatrix.val[0] = vmulq_n_f32(iMatrix.val[0], (float32_t)vectorRight.v[0]);\n iMatrix.val[1] = vmulq_n_f32(iMatrix.val[1], (float32_t)vectorRight.v[1]);\n iMatrix.val[2] = vmulq_n_f32(iMatrix.val[2], (float32_t)vectorRight.v[2]);\n iMatrix.val[3] = vmulq_n_f32(iMatrix.val[3], (float32_t)vectorRight.v[3]);\n\n iMatrix.val[0] = vaddq_f32(iMatrix.val[0], iMatrix.val[1]);\n iMatrix.val[2] = vaddq_f32(iMatrix.val[2], iMatrix.val[3]);\n\n v = vaddq_f32(iMatrix.val[0], iMatrix.val[2]);\n\n return *(GLKVector4 *)&v;\n#else\n GLKVector4 v = { matrixLeft.m[0] * vectorRight.v[0] + matrixLeft.m[4] * vectorRight.v[1] + matrixLeft.m[8] * vectorRight.v[2] + matrixLeft.m[12] * vectorRight.v[3],\n matrixLeft.m[1] * vectorRight.v[0] + matrixLeft.m[5] * vectorRight.v[1] + matrixLeft.m[9] * vectorRight.v[2] + matrixLeft.m[13] * vectorRight.v[3],\n matrixLeft.m[2] * vectorRight.v[0] + matrixLeft.m[6] * vectorRight.v[1] + matrixLeft.m[10] * vectorRight.v[2] + matrixLeft.m[14] * vectorRight.v[3],\n matrixLeft.m[3] * vectorRight.v[0] + matrixLeft.m[7] * vectorRight.v[1] + matrixLeft.m[11] * vectorRight.v[2] + matrixLeft.m[15] * vectorRight.v[3] };\n return v;\n#endif\n}\n\nstatic __inline__ void GLKMatrix4MultiplyVector4Array(GLKMatrix4 matrix, GLKVector4 *vectors, size_t vectorCount)\n{\n size_t i;\n for (i=0; i < vectorCount; i++)\n vectors[i] = GLKMatrix4MultiplyVector4(matrix, vectors[i]);\n}\n\n#ifdef __cplusplus\n}\n#endif\n\n#endif /* __GLK_MATRIX_4_H */\n" }, { "path": "src/test/resources/samples/langs/C/NWMan.h", "content": "#ifndef _NME_WMAN_H\n#define _NME_WMAN_H\n\n// Internal window manager API\n\n#include \"NCompat.h\"\n\nSTART_HEAD\n\n#include \"NPos.h\"\n#include \"NUtil.h\"\n#include \"NTypes.h\"\n\nNTS(NWMan_event);\n\nNSTRUCT(NWMan, {\n // Init stuff\n bool (*init)();\n bool (*destroy)();\n\n // Window stuff\n bool (*create_window)();\n bool (*destroy_window)();\n\n void (*swap_buffers)();\n\n // Event stuff\n bool (*next_event)(NWMan_event* event);\n\n // Time stuff\n uint (*get_millis)();\n void (*sleep)(uint millis);\n\n // Info\n int rshift_key;\n int lshift_key;\n int left_key;\n int right_key;\n});\n\nNENUM(NWMan_event_type, {\n N_WMAN_MOUSE_MOVE = 0,\n N_WMAN_MOUSE_BUTTON = 1,\n N_WMAN_MOUSE_WHEEL = 2,\n\n N_WMAN_KEYBOARD = 10,\n\n N_WMAN_QUIT = 20,\n N_WMAN_RESIZE = 21,\n N_WMAN_FOCUS = 22\n});\n\n#define N_WMAN_MOUSE_LEFT 0\n#define N_WMAN_MOUSE_RIGHT 1\n#define N_WMAN_MOUSE_MIDDLE 2\n\nNSTRUCT(NWMan_event, {\n NWMan_event_type type;\n\n union {\n // Mouse\n\n NPos2i mouse_pos;\n\n struct {\n short id;\n bool state;\n } mouse_button;\n\n signed char mouse_wheel; // 1 if up, -1 if down\n\n // Keyboard\n\n struct {\n int key;\n bool state;\n } keyboard;\n\n // Window\n\n bool window_quit; // Will always be true if WM_QUIT\n\n NPos2i window_size;\n\n bool window_focus;\n };\n});\n\nNWMan_event NWMan_event_new(NWMan_event_type type);\n\n\nbool NWMan_init();\nbool NWMan_destroy();\n\nextern NWMan N_WMan;\n\nEND_HEAD\n\n#endif\n" }, { "path": "src/test/resources/samples/langs/C/Nightmare.h", "content": "#ifndef _NMEX_NIGHTMARE_H\n#define _NMEX_NIGHTMARE_H\n\n//#define NMEX\n\n#include \"../src/NCompat.h\"\n\nSTART_HEAD\n\n#include \"../src/NTypes.h\"\n#include \"../src/NUtil.h\"\n#include \"../src/NPorting.h\"\n#include \"../src/NGlobals.h\"\n#include \"../src/NLog.h\"\n#include \"../src/NWMan.h\"\n#include \"../src/NRsc.h\"\n#include \"../src/NShader.h\"\n#include \"../src/NSquare.h\"\n#include \"../src/NImage.h\"\n#include \"../src/NSprite.h\"\n#include \"../src/NSpritesheet.h\"\n#include \"../src/NEntity.h\"\n#include \"../src/Game.h\"\n\nEND_HEAD\n\n#endif\n" }, { "path": "src/test/resources/samples/langs/C/array.c", "content": "#include \n\nunsigned __bump_up(unsigned n) {\n unsigned base = 1;\n --n;\n while (base < sizeof n * 8) {\n n |= n >> base;\n base *= 2;\n }\n ++n;\n n += (n == 0);\n return n;\n}\n\nvoid *__array_alloc(size_t size, unsigned length) {\n unsigned allocated = __bump_up(length);\n struct __array_header *head = malloc(sizeof *head + allocated * size);\n assert(head);\n head->length = length;\n head->allocated = allocated;\n return (void *) (head + 1);\n}\n\nvoid __array_resize(void **array, size_t size, int difference) {\n if (difference == 0) {\n return;\n }\n struct __array_header *head = __header(*array);\n head->length += difference;\n if (head->length >= head->allocated) {\n head->allocated = __bump_up(head->length);\n head = realloc(head, sizeof *head + head->allocated * size);\n assert(head);\n *array = head + 1;\n }\n}\n\nint __array_search(void *array, void *elem, size_t size) {\n for (unsigned i = 0; i < alength(array) * size; i += size) {\n if (memcmp((char *)array + i, elem, size) == 0) {\n return 1;\n }\n }\n return 0;\n}\n" }, { "path": "src/test/resources/samples/langs/C/array.h", "content": "#ifndef ARRAY_H\n#define ARRAY_H value\n\n#include \n#include \n#include \n\n#define array(type, name, initial_length) \\\n type *name = __array_alloc(sizeof(type), initial_length)\n\n#define aforeach(it, array) \\\n for (unsigned it = 0; \\\n it < alength(array); \\\n ++it)\n\n#define __header(array) \\\n ((struct __array_header *) array - 1)\n\n#define alength(array) \\\n (__header(array)->length)\n\n#define afree(array) \\\n free(__header(array))\n\n#define apush(array, elem) \\\n __array_resize((void **) &array, sizeof *array, 1); \\\n array[alength(array)-1] = elem\n\n#define apop(array) \\\n aremove(array, (alength(array) - 1))\n\n#define aremove(array, index) \\\n assert(alength(array) > index); \\\n memmove(array + index, array + index + 1, sizeof *array * (alength(array) - index - 1)); \\\n __array_resize((void **) &array, sizeof *array, -1)\n\n#define ainsert(array, index, elem) \\\n __array_resize((void **) &array, sizeof *array, index >= alength(array) ? index - alength(array) + 1 : 1); \\\n memmove(array + index + 1, array + index, sizeof *array * (alength(array) - index - 1)); \\\n array[index] = elem\n\n#define acontains(array, elem) \\\n __array_search(array, &elem, sizeof elem)\n\n#define __arrayallocated(array) \\\n (__header(array)->allocated)\n\nstruct __array_header {\n unsigned length;\n unsigned allocated;\n};\n\nunsigned __bump_up(unsigned n);\nvoid *__array_alloc(size_t size, unsigned length);\nvoid __array_resize(void **array, size_t size, int difference);\nint __array_search(void *array, void *elem, size_t size);\n\n#endif /* ifndef ARRAY_H */\n" }, { "path": "src/test/resources/samples/langs/C/asm.h", "content": "/* CarbonOS System/Kernel\n * Copyright 2015-2017 David Aylaian\n * Licensed under Apache 2.0: https://github.com/DavidAylaian/CarbonOS/blob/master/LICENSE.md\n */\n\n#ifndef ASM_H\n#define ASM_H\n\n#include \n\n// macros for enabling and disabling interrupts\n#define enable()\tasm(\"sti\");\n#define disable()\tasm(\"cli\");\n\n// inb instruction\nuint8_t inb (uint16_t port) {\n\tuint8_t val;\n\tasm volatile (\"inb %0, %1\" : \"=a\"(val): \"Nd\"(port));\n\treturn val;\n}\n\n// outb instruction\nvoid outb (uint16_t port, uint8_t val) {\n\tasm volatile (\"outb %1, %0\" : : \"a\"(val), \"Nd\"(port));\n}\n\n#endif\n" }, { "path": "src/test/resources/samples/langs/C/bitmap.h", "content": "#pragma once\n\n/* Copyright © 2010 Christoph Sünderhauf\n *\n * This file is part of Xelix.\n *\n * Xelix 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 * Xelix 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 Xelix. If not, see .\n */\n\n#include \"generic.h\"\n\ntypedef struct {\n\tuint32_t numbits;\n\t/* an array large enough for numbits to fit in. Might \n\t * (if numbits%8!=0) have some spare bits at the end\n\t */\n\tuint32_t* bits;\n} bitmap_t;\n\n\n// creates a new bitmap.\n// CONTENT IS RANDOM! - use bitmap_clearall() to clear the bitmap.\nbitmap_t bitmap_init(uint32_t numbits);\n\n// returns 1 or 0\nuint8_t bitmap_get(bitmap_t bitmap, uint32_t bitnum);\n// sets a bit (to 1)\nvoid bitmap_set(bitmap_t bitmap, uint32_t bitnum);\n// clears a bit (to 0)\nvoid bitmap_clear(bitmap_t bitmap, uint32_t bitnum);\n\n// clears every bit to 0\nvoid bitmap_clearAll(bitmap_t bitmap);\n\n// finds the first bit set to 0 returns 0 if no cleared bit found (0 is also returned if the first bit is cleared)\nuint32_t bitmap_findFirstClear(bitmap_t bitmap);\n" }, { "path": "src/test/resources/samples/langs/C/blob.c", "content": "#include \"cache.h\"\n#include \"blob.h\"\n\nconst char *blob_type = \"blob\";\n\nstruct blob *lookup_blob(const unsigned char *sha1)\n{\n\tstruct object *obj = lookup_object(sha1);\n\tif (!obj)\n\t\treturn create_object(sha1, OBJ_BLOB, alloc_blob_node());\n\tif (!obj->type)\n\t\tobj->type = OBJ_BLOB;\n\tif (obj->type != OBJ_BLOB) {\n\t\terror(\"Object %s is a %s, not a blob\",\n\t\t sha1_to_hex(sha1), typename(obj->type));\n\t\treturn NULL;\n\t}\n\treturn (struct blob *) obj;\n}\n\nint parse_blob_buffer(struct blob *item, void *buffer, unsigned long size)\n{\n\titem->object.parsed = 1;\n\treturn 0;\n}\n" }, { "path": "src/test/resources/samples/langs/C/blob.h", "content": "#ifndef BLOB_H\n#define BLOB_H\n\n#include \"object.h\"\n\nextern const char *blob_type;\n\nstruct blob {\n\tstruct object object;\n};\n\nstruct blob *lookup_blob(const unsigned char *sha1);\n\nint parse_blob_buffer(struct blob *item, void *buffer, unsigned long size);\n\n/**\n * Blobs do not contain references to other objects and do not have\n * structured data that needs parsing. However, code may use the\n * \"parsed\" bit in the struct object for a blob to determine whether\n * its content has been found to actually be available, so\n * parse_blob_buffer() is used (by object.c) to flag that the object\n * has been read successfully from the database.\n **/\n\n#endif /* BLOB_H */\n" }, { "path": "src/test/resources/samples/langs/C/bootstrap.h", "content": "#ifndef BOOTSTRAP_H\n#define BOOTSTRAP_H\n\n#include \n#include \"cxrs.h\"\n\n/* If we're not using GNU C, elide __attribute__ */\n#ifndef __GNUC__\n# define __attribute__(x) /*NOTHING*/\n#endif\n\ntypedef struct object object;\n\nobject *true;\nobject *false;\nobject *eof;\nobject *empty_list;\nobject *global_enviroment;\n\nenum obj_type {\n scm_bool,\n scm_empty_list,\n scm_eof,\n scm_char,\n scm_int,\n scm_pair,\n scm_symbol,\n scm_prim_fun,\n scm_lambda,\n scm_str,\n scm_file\n};\n\ntypedef object *(*prim_proc)(object *args);\n\nobject *read(FILE *in);\nobject *eval(object *code, object *env);\nvoid print(FILE *out, object *obj, int display);\n\nint check_type(enum obj_type type, object *obj, int err_on_false);\n\nstatic inline int is_true(object *obj)\n{\n return obj != false;\n}\n\nobject *make_int(int value);\nint obj2int(object *i);\n\nobject *make_bool(int value);\nint obj2bool(object *b);\n\nobject *make_char(char c);\nchar obj2char(object *ch);\n\nobject *make_str(char *str);\nchar *obj2str(object *str);\n\nobject *cons(object *car, object *cdr);\nobject *car(object *pair);\nobject *cdr(object *pair);\nvoid set_car(object *pair, object *new);\nvoid set_cdr(object *pair, object *new);\n\nobject *make_symbol(char *name);\nchar *sym2str(object *sym);\nobject *get_symbol(char *name) __attribute__((pure));\n\nobject *make_prim_fun(prim_proc fun);\nprim_proc obj2prim_proc(object *proc);\n\nobject *make_lambda(object *args, object *code, object *env);\nobject *lambda_code(object *lambda);\nobject *lambda_args(object *lambda);\n\nobject *make_port(FILE *handle, int direction);\nint port_direction(object *port);\nFILE *port_handle(object *port);\nvoid set_port_handle_to_null(object *port);\n\n/*both of these should never be called*/\nobject *apply_proc(object *);\nobject *eval_proc(object *);\n\n\nobject *maybe_add_begin(object *code);\n\nvoid init_enviroment(object *env);\n\n\nvoid eval_err(char *msg, object *code) __attribute__((noreturn));\n\nvoid define_var(object *var, object *val, object *env);\nvoid set_var(object *var, object *val, object *env);\nobject *get_var(object *var, object *env);\n\nobject *cond2nested_if(object *cond);\nobject *let2lambda(object *let);\nobject *and2nested_if(object *and);\nobject *or2nested_if(object *or);\n\n#endif /*include guard*/\n" }, { "path": "src/test/resources/samples/langs/C/color.h", "content": "#pragma once\n\n/* Copyright © 2011 Fritz Grimpen\n *\n * This file is part of Xelix.\n *\n * Xelix 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 * Xelix 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 Xelix. If not, see .\n */\n\n#include \n\ntypedef struct {\n\tuint32_t background;\n\tuint32_t foreground;\n} console_color_t;\n\n#define CONSOLE_COLOR_BLACK 0x0\n#define CONSOLE_COLOR_BLUE 0x1\n#define CONSOLE_COLOR_GREEN 0x2\n#define CONSOLE_COLOR_CYAN 0x3\n#define CONSOLE_COLOR_RED 0x4\n#define CONSOLE_COLOR_MAGENTA 0x5\n#define CONSOLE_COLOR_BROWN 0x6\n#define CONSOLE_COLOR_LGREY 0x7\n#define CONSOLE_COLOR_DGREY 0x8\n#define CONSOLE_COLOR_LBLUE 0x9\n#define CONSOLE_COLOR_LGREEN 0xa\n#define CONSOLE_COLOR_LCYAN 0xb\n#define CONSOLE_COLOR_LRED 0xc\n#define CONSOLE_COLOR_LMAGENTA 0xd\n#define CONSOLE_COLOR_YELLOW 0xe\n#define CONSOLE_COLOR_WHITE 0xf\n\n" }, { "path": "src/test/resources/samples/langs/C/commit.c", "content": "#include \"cache.h\"\n#include \"tag.h\"\n#include \"commit.h\"\n#include \"pkt-line.h\"\n#include \"utf8.h\"\n#include \"diff.h\"\n#include \"revision.h\"\n#include \"notes.h\"\n#include \"gpg-interface.h\"\n#include \"mergesort.h\"\n\nint save_commit_buffer = 1;\n\nconst char *commit_type = \"commit\";\n\nstatic struct commit *check_commit(struct object *obj,\n\t\t\t\t const unsigned char *sha1,\n\t\t\t\t int quiet)\n{\n\tif (obj->type != OBJ_COMMIT) {\n\t\tif (!quiet)\n\t\t\terror(\"Object %s is a %s, not a commit\",\n\t\t\t sha1_to_hex(sha1), typename(obj->type));\n\t\treturn NULL;\n\t}\n\treturn (struct commit *) obj;\n}\n\nstruct commit *lookup_commit_reference_gently(const unsigned char *sha1,\n\t\t\t\t\t int quiet)\n{\n\tstruct object *obj = deref_tag(parse_object(sha1), NULL, 0);\n\n\tif (!obj)\n\t\treturn NULL;\n\treturn check_commit(obj, sha1, quiet);\n}\n\nstruct commit *lookup_commit_reference(const unsigned char *sha1)\n{\n\treturn lookup_commit_reference_gently(sha1, 0);\n}\n\nstruct commit *lookup_commit_or_die(const unsigned char *sha1, const char *ref_name)\n{\n\tstruct commit *c = lookup_commit_reference(sha1);\n\tif (!c)\n\t\tdie(_(\"could not parse %s\"), ref_name);\n\tif (hashcmp(sha1, c->object.sha1)) {\n\t\twarning(_(\"%s %s is not a commit!\"),\n\t\t\tref_name, sha1_to_hex(sha1));\n\t}\n\treturn c;\n}\n\nstruct commit *lookup_commit(const unsigned char *sha1)\n{\n\tstruct object *obj = lookup_object(sha1);\n\tif (!obj)\n\t\treturn create_object(sha1, OBJ_COMMIT, alloc_commit_node());\n\tif (!obj->type)\n\t\tobj->type = OBJ_COMMIT;\n\treturn check_commit(obj, sha1, 0);\n}\n\nstruct commit *lookup_commit_reference_by_name(const char *name)\n{\n\tunsigned char sha1[20];\n\tstruct commit *commit;\n\n\tif (get_sha1(name, sha1))\n\t\treturn NULL;\n\tcommit = lookup_commit_reference(sha1);\n\tif (!commit || parse_commit(commit))\n\t\treturn NULL;\n\treturn commit;\n}\n\nstatic unsigned long parse_commit_date(const char *buf, const char *tail)\n{\n\tconst char *dateptr;\n\n\tif (buf + 6 >= tail)\n\t\treturn 0;\n\tif (memcmp(buf, \"author\", 6))\n\t\treturn 0;\n\twhile (buf < tail && *buf++ != '\\n')\n\t\t/* nada */;\n\tif (buf + 9 >= tail)\n\t\treturn 0;\n\tif (memcmp(buf, \"committer\", 9))\n\t\treturn 0;\n\twhile (buf < tail && *buf++ != '>')\n\t\t/* nada */;\n\tif (buf >= tail)\n\t\treturn 0;\n\tdateptr = buf;\n\twhile (buf < tail && *buf++ != '\\n')\n\t\t/* nada */;\n\tif (buf >= tail)\n\t\treturn 0;\n\t/* dateptr < buf && buf[-1] == '\\n', so strtoul will stop at buf-1 */\n\treturn strtoul(dateptr, NULL, 10);\n}\n\nstatic struct commit_graft **commit_graft;\nstatic int commit_graft_alloc, commit_graft_nr;\n\nstatic int commit_graft_pos(const unsigned char *sha1)\n{\n\tint lo, hi;\n\tlo = 0;\n\thi = commit_graft_nr;\n\twhile (lo < hi) {\n\t\tint mi = (lo + hi) / 2;\n\t\tstruct commit_graft *graft = commit_graft[mi];\n\t\tint cmp = hashcmp(sha1, graft->sha1);\n\t\tif (!cmp)\n\t\t\treturn mi;\n\t\tif (cmp < 0)\n\t\t\thi = mi;\n\t\telse\n\t\t\tlo = mi + 1;\n\t}\n\treturn -lo - 1;\n}\n\nint register_commit_graft(struct commit_graft *graft, int ignore_dups)\n{\n\tint pos = commit_graft_pos(graft->sha1);\n\n\tif (0 <= pos) {\n\t\tif (ignore_dups)\n\t\t\tfree(graft);\n\t\telse {\n\t\t\tfree(commit_graft[pos]);\n\t\t\tcommit_graft[pos] = graft;\n\t\t}\n\t\treturn 1;\n\t}\n\tpos = -pos - 1;\n\tif (commit_graft_alloc <= ++commit_graft_nr) {\n\t\tcommit_graft_alloc = alloc_nr(commit_graft_alloc);\n\t\tcommit_graft = xrealloc(commit_graft,\n\t\t\t\t\tsizeof(*commit_graft) *\n\t\t\t\t\tcommit_graft_alloc);\n\t}\n\tif (pos < commit_graft_nr)\n\t\tmemmove(commit_graft + pos + 1,\n\t\t\tcommit_graft + pos,\n\t\t\t(commit_graft_nr - pos - 1) *\n\t\t\tsizeof(*commit_graft));\n\tcommit_graft[pos] = graft;\n\treturn 0;\n}\n\nstruct commit_graft *read_graft_line(char *buf, int len)\n{\n\t/* The format is just \"Commit Parent1 Parent2 ...\\n\" */\n\tint i;\n\tstruct commit_graft *graft = NULL;\n\n\twhile (len && isspace(buf[len-1]))\n\t\tbuf[--len] = '\\0';\n\tif (buf[0] == '#' || buf[0] == '\\0')\n\t\treturn NULL;\n\tif ((len + 1) % 41)\n\t\tgoto bad_graft_data;\n\ti = (len + 1) / 41 - 1;\n\tgraft = xmalloc(sizeof(*graft) + 20 * i);\n\tgraft->nr_parent = i;\n\tif (get_sha1_hex(buf, graft->sha1))\n\t\tgoto bad_graft_data;\n\tfor (i = 40; i < len; i += 41) {\n\t\tif (buf[i] != ' ')\n\t\t\tgoto bad_graft_data;\n\t\tif (get_sha1_hex(buf + i + 1, graft->parent[i/41]))\n\t\t\tgoto bad_graft_data;\n\t}\n\treturn graft;\n\nbad_graft_data:\n\terror(\"bad graft data: %s\", buf);\n\tfree(graft);\n\treturn NULL;\n}\n\nstatic int read_graft_file(const char *graft_file)\n{\n\tFILE *fp = fopen(graft_file, \"r\");\n\tchar buf[1024];\n\tif (!fp)\n\t\treturn -1;\n\twhile (fgets(buf, sizeof(buf), fp)) {\n\t\t/* The format is just \"Commit Parent1 Parent2 ...\\n\" */\n\t\tint len = strlen(buf);\n\t\tstruct commit_graft *graft = read_graft_line(buf, len);\n\t\tif (!graft)\n\t\t\tcontinue;\n\t\tif (register_commit_graft(graft, 1))\n\t\t\terror(\"duplicate graft data: %s\", buf);\n\t}\n\tfclose(fp);\n\treturn 0;\n}\n\nstatic void prepare_commit_graft(void)\n{\n\tstatic int commit_graft_prepared;\n\tchar *graft_file;\n\n\tif (commit_graft_prepared)\n\t\treturn;\n\tgraft_file = get_graft_file();\n\tread_graft_file(graft_file);\n\t/* make sure shallows are read */\n\tis_repository_shallow();\n\tcommit_graft_prepared = 1;\n}\n\nstruct commit_graft *lookup_commit_graft(const unsigned char *sha1)\n{\n\tint pos;\n\tprepare_commit_graft();\n\tpos = commit_graft_pos(sha1);\n\tif (pos < 0)\n\t\treturn NULL;\n\treturn commit_graft[pos];\n}\n\nint for_each_commit_graft(each_commit_graft_fn fn, void *cb_data)\n{\n\tint i, ret;\n\tfor (i = ret = 0; i < commit_graft_nr && !ret; i++)\n\t\tret = fn(commit_graft[i], cb_data);\n\treturn ret;\n}\n\nint unregister_shallow(const unsigned char *sha1)\n{\n\tint pos = commit_graft_pos(sha1);\n\tif (pos < 0)\n\t\treturn -1;\n\tif (pos + 1 < commit_graft_nr)\n\t\tmemmove(commit_graft + pos, commit_graft + pos + 1,\n\t\t\t\tsizeof(struct commit_graft *)\n\t\t\t\t* (commit_graft_nr - pos - 1));\n\tcommit_graft_nr--;\n\treturn 0;\n}\n\nint parse_commit_buffer(struct commit *item, const void *buffer, unsigned long size)\n{\n\tconst char *tail = buffer;\n\tconst char *bufptr = buffer;\n\tunsigned char parent[20];\n\tstruct commit_list **pptr;\n\tstruct commit_graft *graft;\n\n\tif (item->object.parsed)\n\t\treturn 0;\n\titem->object.parsed = 1;\n\ttail += size;\n\tif (tail <= bufptr + 46 || memcmp(bufptr, \"tree \", 5) || bufptr[45] != '\\n')\n\t\treturn error(\"bogus commit object %s\", sha1_to_hex(item->object.sha1));\n\tif (get_sha1_hex(bufptr + 5, parent) < 0)\n\t\treturn error(\"bad tree pointer in commit %s\",\n\t\t\t sha1_to_hex(item->object.sha1));\n\titem->tree = lookup_tree(parent);\n\tbufptr += 46; /* \"tree \" + \"hex sha1\" + \"\\n\" */\n\tpptr = &item->parents;\n\n\tgraft = lookup_commit_graft(item->object.sha1);\n\twhile (bufptr + 48 < tail && !memcmp(bufptr, \"parent \", 7)) {\n\t\tstruct commit *new_parent;\n\n\t\tif (tail <= bufptr + 48 ||\n\t\t get_sha1_hex(bufptr + 7, parent) ||\n\t\t bufptr[47] != '\\n')\n\t\t\treturn error(\"bad parents in commit %s\", sha1_to_hex(item->object.sha1));\n\t\tbufptr += 48;\n\t\t/*\n\t\t * The clone is shallow if nr_parent < 0, and we must\n\t\t * not traverse its real parents even when we unhide them.\n\t\t */\n\t\tif (graft && (graft->nr_parent < 0 || grafts_replace_parents))\n\t\t\tcontinue;\n\t\tnew_parent = lookup_commit(parent);\n\t\tif (new_parent)\n\t\t\tpptr = &commit_list_insert(new_parent, pptr)->next;\n\t}\n\tif (graft) {\n\t\tint i;\n\t\tstruct commit *new_parent;\n\t\tfor (i = 0; i < graft->nr_parent; i++) {\n\t\t\tnew_parent = lookup_commit(graft->parent[i]);\n\t\t\tif (!new_parent)\n\t\t\t\tcontinue;\n\t\t\tpptr = &commit_list_insert(new_parent, pptr)->next;\n\t\t}\n\t}\n\titem->date = parse_commit_date(bufptr, tail);\n\n\treturn 0;\n}\n\nint parse_commit(struct commit *item)\n{\n\tenum object_type type;\n\tvoid *buffer;\n\tunsigned long size;\n\tint ret;\n\n\tif (!item)\n\t\treturn -1;\n\tif (item->object.parsed)\n\t\treturn 0;\n\tbuffer = read_sha1_file(item->object.sha1, &type, &size);\n\tif (!buffer)\n\t\treturn error(\"Could not read %s\",\n\t\t\t sha1_to_hex(item->object.sha1));\n\tif (type != OBJ_COMMIT) {\n\t\tfree(buffer);\n\t\treturn error(\"Object %s not a commit\",\n\t\t\t sha1_to_hex(item->object.sha1));\n\t}\n\tret = parse_commit_buffer(item, buffer, size);\n\tif (save_commit_buffer && !ret) {\n\t\titem->buffer = buffer;\n\t\treturn 0;\n\t}\n\tfree(buffer);\n\treturn ret;\n}\n\nint find_commit_subject(const char *commit_buffer, const char **subject)\n{\n\tconst char *eol;\n\tconst char *p = commit_buffer;\n\n\twhile (*p && (*p != '\\n' || p[1] != '\\n'))\n\t\tp++;\n\tif (*p) {\n\t\tp += 2;\n\t\tfor (eol = p; *eol && *eol != '\\n'; eol++)\n\t\t\t; /* do nothing */\n\t} else\n\t\teol = p;\n\n\t*subject = p;\n\n\treturn eol - p;\n}\n\nstruct commit_list *commit_list_insert(struct commit *item, struct commit_list **list_p)\n{\n\tstruct commit_list *new_list = xmalloc(sizeof(struct commit_list));\n\tnew_list->item = item;\n\tnew_list->next = *list_p;\n\t*list_p = new_list;\n\treturn new_list;\n}\n\nunsigned commit_list_count(const struct commit_list *l)\n{\n\tunsigned c = 0;\n\tfor (; l; l = l->next )\n\t\tc++;\n\treturn c;\n}\n\nvoid free_commit_list(struct commit_list *list)\n{\n\twhile (list) {\n\t\tstruct commit_list *temp = list;\n\t\tlist = temp->next;\n\t\tfree(temp);\n\t}\n}\n\nstruct commit_list * commit_list_insert_by_date(struct commit *item, struct commit_list **list)\n{\n\tstruct commit_list **pp = list;\n\tstruct commit_list *p;\n\twhile ((p = *pp) != NULL) {\n\t\tif (p->item->date < item->date) {\n\t\t\tbreak;\n\t\t}\n\t\tpp = &p->next;\n\t}\n\treturn commit_list_insert(item, pp);\n}\n\nstatic int commit_list_compare_by_date(const void *a, const void *b)\n{\n\tunsigned long a_date = ((const struct commit_list *)a)->item->date;\n\tunsigned long b_date = ((const struct commit_list *)b)->item->date;\n\tif (a_date < b_date)\n\t\treturn 1;\n\tif (a_date > b_date)\n\t\treturn -1;\n\treturn 0;\n}\n\nstatic void *commit_list_get_next(const void *a)\n{\n\treturn ((const struct commit_list *)a)->next;\n}\n\nstatic void commit_list_set_next(void *a, void *next)\n{\n\t((struct commit_list *)a)->next = next;\n}\n\nvoid commit_list_sort_by_date(struct commit_list **list)\n{\n\t*list = llist_mergesort(*list, commit_list_get_next, commit_list_set_next,\n\t\t\t\tcommit_list_compare_by_date);\n}\n\nstruct commit *pop_most_recent_commit(struct commit_list **list,\n\t\t\t\t unsigned int mark)\n{\n\tstruct commit *ret = (*list)->item;\n\tstruct commit_list *parents = ret->parents;\n\tstruct commit_list *old = *list;\n\n\t*list = (*list)->next;\n\tfree(old);\n\n\twhile (parents) {\n\t\tstruct commit *commit = parents->item;\n\t\tif (!parse_commit(commit) && !(commit->object.flags & mark)) {\n\t\t\tcommit->object.flags |= mark;\n\t\t\tcommit_list_insert_by_date(commit, list);\n\t\t}\n\t\tparents = parents->next;\n\t}\n\treturn ret;\n}\n\nstatic void clear_commit_marks_1(struct commit_list **plist,\n\t\t\t\t struct commit *commit, unsigned int mark)\n{\n\twhile (commit) {\n\t\tstruct commit_list *parents;\n\n\t\tif (!(mark & commit->object.flags))\n\t\t\treturn;\n\n\t\tcommit->object.flags &= ~mark;\n\n\t\tparents = commit->parents;\n\t\tif (!parents)\n\t\t\treturn;\n\n\t\twhile ((parents = parents->next))\n\t\t\tcommit_list_insert(parents->item, plist);\n\n\t\tcommit = commit->parents->item;\n\t}\n}\n\nvoid clear_commit_marks(struct commit *commit, unsigned int mark)\n{\n\tstruct commit_list *list = NULL;\n\tcommit_list_insert(commit, &list);\n\twhile (list)\n\t\tclear_commit_marks_1(&list, pop_commit(&list), mark);\n}\n\nvoid clear_commit_marks_for_object_array(struct object_array *a, unsigned mark)\n{\n\tstruct object *object;\n\tstruct commit *commit;\n\tunsigned int i;\n\n\tfor (i = 0; i < a->nr; i++) {\n\t\tobject = a->objects[i].item;\n\t\tcommit = lookup_commit_reference_gently(object->sha1, 1);\n\t\tif (commit)\n\t\t\tclear_commit_marks(commit, mark);\n\t}\n}\n\nstruct commit *pop_commit(struct commit_list **stack)\n{\n\tstruct commit_list *top = *stack;\n\tstruct commit *item = top ? top->item : NULL;\n\n\tif (top) {\n\t\t*stack = top->next;\n\t\tfree(top);\n\t}\n\treturn item;\n}\n\n/*\n * Performs an in-place topological sort on the list supplied.\n */\nvoid sort_in_topological_order(struct commit_list ** list, int lifo)\n{\n\tstruct commit_list *next, *orig = *list;\n\tstruct commit_list *work, **insert;\n\tstruct commit_list **pptr;\n\n\tif (!orig)\n\t\treturn;\n\t*list = NULL;\n\n\t/* Mark them and clear the indegree */\n\tfor (next = orig; next; next = next->next) {\n\t\tstruct commit *commit = next->item;\n\t\tcommit->indegree = 1;\n\t}\n\n\t/* update the indegree */\n\tfor (next = orig; next; next = next->next) {\n\t\tstruct commit_list * parents = next->item->parents;\n\t\twhile (parents) {\n\t\t\tstruct commit *parent = parents->item;\n\n\t\t\tif (parent->indegree)\n\t\t\t\tparent->indegree++;\n\t\t\tparents = parents->next;\n\t\t}\n\t}\n\n\t/*\n\t * find the tips\n\t *\n\t * tips are nodes not reachable from any other node in the list\n\t *\n\t * the tips serve as a starting set for the work queue.\n\t */\n\twork = NULL;\n\tinsert = &work;\n\tfor (next = orig; next; next = next->next) {\n\t\tstruct commit *commit = next->item;\n\n\t\tif (commit->indegree == 1)\n\t\t\tinsert = &commit_list_insert(commit, insert)->next;\n\t}\n\n\t/* process the list in topological order */\n\tif (!lifo)\n\t\tcommit_list_sort_by_date(&work);\n\n\tpptr = list;\n\t*list = NULL;\n\twhile (work) {\n\t\tstruct commit *commit;\n\t\tstruct commit_list *parents, *work_item;\n\n\t\twork_item = work;\n\t\twork = work_item->next;\n\t\twork_item->next = NULL;\n\n\t\tcommit = work_item->item;\n\t\tfor (parents = commit->parents; parents ; parents = parents->next) {\n\t\t\tstruct commit *parent = parents->item;\n\n\t\t\tif (!parent->indegree)\n\t\t\t\tcontinue;\n\n\t\t\t/*\n\t\t\t * parents are only enqueued for emission\n\t\t\t * when all their children have been emitted thereby\n\t\t\t * guaranteeing topological order.\n\t\t\t */\n\t\t\tif (--parent->indegree == 1) {\n\t\t\t\tif (!lifo)\n\t\t\t\t\tcommit_list_insert_by_date(parent, &work);\n\t\t\t\telse\n\t\t\t\t\tcommit_list_insert(parent, &work);\n\t\t\t}\n\t\t}\n\t\t/*\n\t\t * work_item is a commit all of whose children\n\t\t * have already been emitted. we can emit it now.\n\t\t */\n\t\tcommit->indegree = 0;\n\t\t*pptr = work_item;\n\t\tpptr = &work_item->next;\n\t}\n}\n\n/* merge-base stuff */\n\n/* bits #0..15 in revision.h */\n#define PARENT1\t\t(1u<<16)\n#define PARENT2\t\t(1u<<17)\n#define STALE\t\t(1u<<18)\n#define RESULT\t\t(1u<<19)\n\nstatic const unsigned all_flags = (PARENT1 | PARENT2 | STALE | RESULT);\n\nstatic struct commit *interesting(struct commit_list *list)\n{\n\twhile (list) {\n\t\tstruct commit *commit = list->item;\n\t\tlist = list->next;\n\t\tif (commit->object.flags & STALE)\n\t\t\tcontinue;\n\t\treturn commit;\n\t}\n\treturn NULL;\n}\n\nstatic struct commit_list *merge_bases_many(struct commit *one, int n, struct commit **twos)\n{\n\tstruct commit_list *list = NULL;\n\tstruct commit_list *result = NULL;\n\tint i;\n\n\tfor (i = 0; i < n; i++) {\n\t\tif (one == twos[i])\n\t\t\t/*\n\t\t\t * We do not mark this even with RESULT so we do not\n\t\t\t * have to clean it up.\n\t\t\t */\n\t\t\treturn commit_list_insert(one, &result);\n\t}\n\n\tif (parse_commit(one))\n\t\treturn NULL;\n\tfor (i = 0; i < n; i++) {\n\t\tif (parse_commit(twos[i]))\n\t\t\treturn NULL;\n\t}\n\n\tone->object.flags |= PARENT1;\n\tcommit_list_insert_by_date(one, &list);\n\tfor (i = 0; i < n; i++) {\n\t\ttwos[i]->object.flags |= PARENT2;\n\t\tcommit_list_insert_by_date(twos[i], &list);\n\t}\n\n\twhile (interesting(list)) {\n\t\tstruct commit *commit;\n\t\tstruct commit_list *parents;\n\t\tstruct commit_list *next;\n\t\tint flags;\n\n\t\tcommit = list->item;\n\t\tnext = list->next;\n\t\tfree(list);\n\t\tlist = next;\n\n\t\tflags = commit->object.flags & (PARENT1 | PARENT2 | STALE);\n\t\tif (flags == (PARENT1 | PARENT2)) {\n\t\t\tif (!(commit->object.flags & RESULT)) {\n\t\t\t\tcommit->object.flags |= RESULT;\n\t\t\t\tcommit_list_insert_by_date(commit, &result);\n\t\t\t}\n\t\t\t/* Mark parents of a found merge stale */\n\t\t\tflags |= STALE;\n\t\t}\n\t\tparents = commit->parents;\n\t\twhile (parents) {\n\t\t\tstruct commit *p = parents->item;\n\t\t\tparents = parents->next;\n\t\t\tif ((p->object.flags & flags) == flags)\n\t\t\t\tcontinue;\n\t\t\tif (parse_commit(p))\n\t\t\t\treturn NULL;\n\t\t\tp->object.flags |= flags;\n\t\t\tcommit_list_insert_by_date(p, &list);\n\t\t}\n\t}\n\n\t/* Clean up the result to remove stale ones */\n\tfree_commit_list(list);\n\tlist = result; result = NULL;\n\twhile (list) {\n\t\tstruct commit_list *next = list->next;\n\t\tif (!(list->item->object.flags & STALE))\n\t\t\tcommit_list_insert_by_date(list->item, &result);\n\t\tfree(list);\n\t\tlist = next;\n\t}\n\treturn result;\n}\n\nstruct commit_list *get_octopus_merge_bases(struct commit_list *in)\n{\n\tstruct commit_list *i, *j, *k, *ret = NULL;\n\tstruct commit_list **pptr = &ret;\n\n\tfor (i = in; i; i = i->next) {\n\t\tif (!ret)\n\t\t\tpptr = &commit_list_insert(i->item, pptr)->next;\n\t\telse {\n\t\t\tstruct commit_list *new = NULL, *end = NULL;\n\n\t\t\tfor (j = ret; j; j = j->next) {\n\t\t\t\tstruct commit_list *bases;\n\t\t\t\tbases = get_merge_bases(i->item, j->item, 1);\n\t\t\t\tif (!new)\n\t\t\t\t\tnew = bases;\n\t\t\t\telse\n\t\t\t\t\tend->next = bases;\n\t\t\t\tfor (k = bases; k; k = k->next)\n\t\t\t\t\tend = k;\n\t\t\t}\n\t\t\tret = new;\n\t\t}\n\t}\n\treturn ret;\n}\n\nstruct commit_list *get_merge_bases_many(struct commit *one,\n\t\t\t\t\t int n,\n\t\t\t\t\t struct commit **twos,\n\t\t\t\t\t int cleanup)\n{\n\tstruct commit_list *list;\n\tstruct commit **rslt;\n\tstruct commit_list *result;\n\tint cnt, i, j;\n\n\tresult = merge_bases_many(one, n, twos);\n\tfor (i = 0; i < n; i++) {\n\t\tif (one == twos[i])\n\t\t\treturn result;\n\t}\n\tif (!result || !result->next) {\n\t\tif (cleanup) {\n\t\t\tclear_commit_marks(one, all_flags);\n\t\t\tfor (i = 0; i < n; i++)\n\t\t\t\tclear_commit_marks(twos[i], all_flags);\n\t\t}\n\t\treturn result;\n\t}\n\n\t/* There are more than one */\n\tcnt = 0;\n\tlist = result;\n\twhile (list) {\n\t\tlist = list->next;\n\t\tcnt++;\n\t}\n\trslt = xcalloc(cnt, sizeof(*rslt));\n\tfor (list = result, i = 0; list; list = list->next)\n\t\trslt[i++] = list->item;\n\tfree_commit_list(result);\n\n\tclear_commit_marks(one, all_flags);\n\tfor (i = 0; i < n; i++)\n\t\tclear_commit_marks(twos[i], all_flags);\n\tfor (i = 0; i < cnt - 1; i++) {\n\t\tfor (j = i+1; j < cnt; j++) {\n\t\t\tif (!rslt[i] || !rslt[j])\n\t\t\t\tcontinue;\n\t\t\tresult = merge_bases_many(rslt[i], 1, &rslt[j]);\n\t\t\tclear_commit_marks(rslt[i], all_flags);\n\t\t\tclear_commit_marks(rslt[j], all_flags);\n\t\t\tfor (list = result; list; list = list->next) {\n\t\t\t\tif (rslt[i] == list->item)\n\t\t\t\t\trslt[i] = NULL;\n\t\t\t\tif (rslt[j] == list->item)\n\t\t\t\t\trslt[j] = NULL;\n\t\t\t}\n\t\t}\n\t}\n\n\t/* Surviving ones in rslt[] are the independent results */\n\tresult = NULL;\n\tfor (i = 0; i < cnt; i++) {\n\t\tif (rslt[i])\n\t\t\tcommit_list_insert_by_date(rslt[i], &result);\n\t}\n\tfree(rslt);\n\treturn result;\n}\n\nstruct commit_list *get_merge_bases(struct commit *one, struct commit *two,\n\t\t\t\t int cleanup)\n{\n\treturn get_merge_bases_many(one, 1, &two, cleanup);\n}\n\nint is_descendant_of(struct commit *commit, struct commit_list *with_commit)\n{\n\tif (!with_commit)\n\t\treturn 1;\n\twhile (with_commit) {\n\t\tstruct commit *other;\n\n\t\tother = with_commit->item;\n\t\twith_commit = with_commit->next;\n\t\tif (in_merge_bases(other, &commit, 1))\n\t\t\treturn 1;\n\t}\n\treturn 0;\n}\n\nint in_merge_bases(struct commit *commit, struct commit **reference, int num)\n{\n\tstruct commit_list *bases, *b;\n\tint ret = 0;\n\n\tif (num == 1)\n\t\tbases = get_merge_bases(commit, *reference, 1);\n\telse\n\t\tdie(\"not yet\");\n\tfor (b = bases; b; b = b->next) {\n\t\tif (!hashcmp(commit->object.sha1, b->item->object.sha1)) {\n\t\t\tret = 1;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tfree_commit_list(bases);\n\treturn ret;\n}\n\nstruct commit_list *reduce_heads(struct commit_list *heads)\n{\n\tstruct commit_list *p;\n\tstruct commit_list *result = NULL, **tail = &result;\n\tstruct commit **other;\n\tsize_t num_head, num_other;\n\n\tif (!heads)\n\t\treturn NULL;\n\n\t/* Avoid unnecessary reallocations */\n\tfor (p = heads, num_head = 0; p; p = p->next)\n\t\tnum_head++;\n\tother = xcalloc(sizeof(*other), num_head);\n\n\t/* For each commit, see if it can be reached by others */\n\tfor (p = heads; p; p = p->next) {\n\t\tstruct commit_list *q, *base;\n\n\t\t/* Do we already have this in the result? */\n\t\tfor (q = result; q; q = q->next)\n\t\t\tif (p->item == q->item)\n\t\t\t\tbreak;\n\t\tif (q)\n\t\t\tcontinue;\n\n\t\tnum_other = 0;\n\t\tfor (q = heads; q; q = q->next) {\n\t\t\tif (p->item == q->item)\n\t\t\t\tcontinue;\n\t\t\tother[num_other++] = q->item;\n\t\t}\n\t\tif (num_other)\n\t\t\tbase = get_merge_bases_many(p->item, num_other, other, 1);\n\t\telse\n\t\t\tbase = NULL;\n\t\t/*\n\t\t * If p->item does not have anything common with other\n\t\t * commits, there won't be any merge base. If it is\n\t\t * reachable from some of the others, p->item will be\n\t\t * the merge base. If its history is connected with\n\t\t * others, but p->item is not reachable by others, we\n\t\t * will get something other than p->item back.\n\t\t */\n\t\tif (!base || (base->item != p->item))\n\t\t\ttail = &(commit_list_insert(p->item, tail)->next);\n\t\tfree_commit_list(base);\n\t}\n\tfree(other);\n\treturn result;\n}\n\nstatic const char gpg_sig_header[] = \"gpgsig\";\nstatic const int gpg_sig_header_len = sizeof(gpg_sig_header) - 1;\n\nstatic int do_sign_commit(struct strbuf *buf, const char *keyid)\n{\n\tstruct strbuf sig = STRBUF_INIT;\n\tint inspos, copypos;\n\n\t/* find the end of the header */\n\tinspos = strstr(buf->buf, \"\\n\\n\") - buf->buf + 1;\n\n\tif (!keyid || !*keyid)\n\t\tkeyid = get_signing_key();\n\tif (sign_buffer(buf, &sig, keyid)) {\n\t\tstrbuf_release(&sig);\n\t\treturn -1;\n\t}\n\n\tfor (copypos = 0; sig.buf[copypos]; ) {\n\t\tconst char *bol = sig.buf + copypos;\n\t\tconst char *eol = strchrnul(bol, '\\n');\n\t\tint len = (eol - bol) + !!*eol;\n\n\t\tif (!copypos) {\n\t\t\tstrbuf_insert(buf, inspos, gpg_sig_header, gpg_sig_header_len);\n\t\t\tinspos += gpg_sig_header_len;\n\t\t}\n\t\tstrbuf_insert(buf, inspos++, \" \", 1);\n\t\tstrbuf_insert(buf, inspos, bol, len);\n\t\tinspos += len;\n\t\tcopypos += len;\n\t}\n\tstrbuf_release(&sig);\n\treturn 0;\n}\n\nint parse_signed_commit(const unsigned char *sha1,\n\t\t\tstruct strbuf *payload, struct strbuf *signature)\n{\n\tunsigned long size;\n\tenum object_type type;\n\tchar *buffer = read_sha1_file(sha1, &type, &size);\n\tint in_signature, saw_signature = -1;\n\tchar *line, *tail;\n\n\tif (!buffer || type != OBJ_COMMIT)\n\t\tgoto cleanup;\n\n\tline = buffer;\n\ttail = buffer + size;\n\tin_signature = 0;\n\tsaw_signature = 0;\n\twhile (line < tail) {\n\t\tconst char *sig = NULL;\n\t\tchar *next = memchr(line, '\\n', tail - line);\n\n\t\tnext = next ? next + 1 : tail;\n\t\tif (in_signature && line[0] == ' ')\n\t\t\tsig = line + 1;\n\t\telse if (!prefixcmp(line, gpg_sig_header) &&\n\t\t\t line[gpg_sig_header_len] == ' ')\n\t\t\tsig = line + gpg_sig_header_len + 1;\n\t\tif (sig) {\n\t\t\tstrbuf_add(signature, sig, next - sig);\n\t\t\tsaw_signature = 1;\n\t\t\tin_signature = 1;\n\t\t} else {\n\t\t\tif (*line == '\\n')\n\t\t\t\t/* dump the whole remainder of the buffer */\n\t\t\t\tnext = tail;\n\t\t\tstrbuf_add(payload, line, next - line);\n\t\t\tin_signature = 0;\n\t\t}\n\t\tline = next;\n\t}\n cleanup:\n\tfree(buffer);\n\treturn saw_signature;\n}\n\nstatic void handle_signed_tag(struct commit *parent, struct commit_extra_header ***tail)\n{\n\tstruct merge_remote_desc *desc;\n\tstruct commit_extra_header *mergetag;\n\tchar *buf;\n\tunsigned long size, len;\n\tenum object_type type;\n\n\tdesc = merge_remote_util(parent);\n\tif (!desc || !desc->obj)\n\t\treturn;\n\tbuf = read_sha1_file(desc->obj->sha1, &type, &size);\n\tif (!buf || type != OBJ_TAG)\n\t\tgoto free_return;\n\tlen = parse_signature(buf, size);\n\tif (size == len)\n\t\tgoto free_return;\n\t/*\n\t * We could verify this signature and either omit the tag when\n\t * it does not validate, but the integrator may not have the\n\t * public key of the signer of the tag he is merging, while a\n\t * later auditor may have it while auditing, so let's not run\n\t * verify-signed-buffer here for now...\n\t *\n\t * if (verify_signed_buffer(buf, len, buf + len, size - len, ...))\n\t *\twarn(\"warning: signed tag unverified.\");\n\t */\n\tmergetag = xcalloc(1, sizeof(*mergetag));\n\tmergetag->key = xstrdup(\"mergetag\");\n\tmergetag->value = buf;\n\tmergetag->len = size;\n\n\t**tail = mergetag;\n\t*tail = &mergetag->next;\n\treturn;\n\nfree_return:\n\tfree(buf);\n}\n\nvoid append_merge_tag_headers(struct commit_list *parents,\n\t\t\t struct commit_extra_header ***tail)\n{\n\twhile (parents) {\n\t\tstruct commit *parent = parents->item;\n\t\thandle_signed_tag(parent, tail);\n\t\tparents = parents->next;\n\t}\n}\n\nstatic void add_extra_header(struct strbuf *buffer,\n\t\t\t struct commit_extra_header *extra)\n{\n\tstrbuf_addstr(buffer, extra->key);\n\tif (extra->len)\n\t\tstrbuf_add_lines(buffer, \" \", extra->value, extra->len);\n\telse\n\t\tstrbuf_addch(buffer, '\\n');\n}\n\nstruct commit_extra_header *read_commit_extra_headers(struct commit *commit,\n\t\t\t\t\t\t const char **exclude)\n{\n\tstruct commit_extra_header *extra = NULL;\n\tunsigned long size;\n\tenum object_type type;\n\tchar *buffer = read_sha1_file(commit->object.sha1, &type, &size);\n\tif (buffer && type == OBJ_COMMIT)\n\t\textra = read_commit_extra_header_lines(buffer, size, exclude);\n\tfree(buffer);\n\treturn extra;\n}\n\nstatic inline int standard_header_field(const char *field, size_t len)\n{\n\treturn ((len == 4 && !memcmp(field, \"tree \", 5)) ||\n\t\t(len == 6 && !memcmp(field, \"parent \", 7)) ||\n\t\t(len == 6 && !memcmp(field, \"author \", 7)) ||\n\t\t(len == 9 && !memcmp(field, \"committer \", 10)) ||\n\t\t(len == 8 && !memcmp(field, \"encoding \", 9)));\n}\n\nstatic int excluded_header_field(const char *field, size_t len, const char **exclude)\n{\n\tif (!exclude)\n\t\treturn 0;\n\n\twhile (*exclude) {\n\t\tsize_t xlen = strlen(*exclude);\n\t\tif (len == xlen &&\n\t\t !memcmp(field, *exclude, xlen) && field[xlen] == ' ')\n\t\t\treturn 1;\n\t\texclude++;\n\t}\n\treturn 0;\n}\n\nstruct commit_extra_header *read_commit_extra_header_lines(const char *buffer, size_t size,\n\t\t\t\t\t\t\t const char **exclude)\n{\n\tstruct commit_extra_header *extra = NULL, **tail = &extra, *it = NULL;\n\tconst char *line, *next, *eof, *eob;\n\tstruct strbuf buf = STRBUF_INIT;\n\n\tfor (line = buffer, eob = line + size;\n\t line < eob && *line != '\\n';\n\t line = next) {\n\t\tnext = memchr(line, '\\n', eob - line);\n\t\tnext = next ? next + 1 : eob;\n\t\tif (*line == ' ') {\n\t\t\t/* continuation */\n\t\t\tif (it)\n\t\t\t\tstrbuf_add(&buf, line + 1, next - (line + 1));\n\t\t\tcontinue;\n\t\t}\n\t\tif (it)\n\t\t\tit->value = strbuf_detach(&buf, &it->len);\n\t\tstrbuf_reset(&buf);\n\t\tit = NULL;\n\n\t\teof = strchr(line, ' ');\n\t\tif (next <= eof)\n\t\t\teof = next;\n\n\t\tif (standard_header_field(line, eof - line) ||\n\t\t excluded_header_field(line, eof - line, exclude))\n\t\t\tcontinue;\n\n\t\tit = xcalloc(1, sizeof(*it));\n\t\tit->key = xmemdupz(line, eof-line);\n\t\t*tail = it;\n\t\ttail = &it->next;\n\t\tif (eof + 1 < next)\n\t\t\tstrbuf_add(&buf, eof + 1, next - (eof + 1));\n\t}\n\tif (it)\n\t\tit->value = strbuf_detach(&buf, &it->len);\n\treturn extra;\n}\n\nvoid free_commit_extra_headers(struct commit_extra_header *extra)\n{\n\twhile (extra) {\n\t\tstruct commit_extra_header *next = extra->next;\n\t\tfree(extra->key);\n\t\tfree(extra->value);\n\t\tfree(extra);\n\t\textra = next;\n\t}\n}\n\nint commit_tree(const struct strbuf *msg, unsigned char *tree,\n\t\tstruct commit_list *parents, unsigned char *ret,\n\t\tconst char *author, const char *sign_commit)\n{\n\tstruct commit_extra_header *extra = NULL, **tail = &extra;\n\tint result;\n\n\tappend_merge_tag_headers(parents, &tail);\n\tresult = commit_tree_extended(msg, tree, parents, ret,\n\t\t\t\t author, sign_commit, extra);\n\tfree_commit_extra_headers(extra);\n\treturn result;\n}\n\nstatic const char commit_utf8_warn[] =\n\"Warning: commit message does not conform to UTF-8.\\n\"\n\"You may want to amend it after fixing the message, or set the config\\n\"\n\"variable i18n.commitencoding to the encoding your project uses.\\n\";\n\nint commit_tree_extended(const struct strbuf *msg, unsigned char *tree,\n\t\t\t struct commit_list *parents, unsigned char *ret,\n\t\t\t const char *author, const char *sign_commit,\n\t\t\t struct commit_extra_header *extra)\n{\n\tint result;\n\tint encoding_is_utf8;\n\tstruct strbuf buffer;\n\n\tassert_sha1_type(tree, OBJ_TREE);\n\n\tif (memchr(msg->buf, '\\0', msg->len))\n\t\treturn error(\"a NUL byte in commit log message not allowed.\");\n\n\t/* Not having i18n.commitencoding is the same as having utf-8 */\n\tencoding_is_utf8 = is_encoding_utf8(git_commit_encoding);\n\n\tstrbuf_init(&buffer, 8192); /* should avoid reallocs for the headers */\n\tstrbuf_addf(&buffer, \"tree %s\\n\", sha1_to_hex(tree));\n\n\t/*\n\t * NOTE! This ordering means that the same exact tree merged with a\n\t * different order of parents will be a _different_ changeset even\n\t * if everything else stays the same.\n\t */\n\twhile (parents) {\n\t\tstruct commit_list *next = parents->next;\n\t\tstruct commit *parent = parents->item;\n\n\t\tstrbuf_addf(&buffer, \"parent %s\\n\",\n\t\t\t sha1_to_hex(parent->object.sha1));\n\t\tfree(parents);\n\t\tparents = next;\n\t}\n\n\t/* Person/date information */\n\tif (!author)\n\t\tauthor = git_author_info(IDENT_STRICT);\n\tstrbuf_addf(&buffer, \"author %s\\n\", author);\n\tstrbuf_addf(&buffer, \"committer %s\\n\", git_committer_info(IDENT_STRICT));\n\tif (!encoding_is_utf8)\n\t\tstrbuf_addf(&buffer, \"encoding %s\\n\", git_commit_encoding);\n\n\twhile (extra) {\n\t\tadd_extra_header(&buffer, extra);\n\t\textra = extra->next;\n\t}\n\tstrbuf_addch(&buffer, '\\n');\n\n\t/* And add the comment */\n\tstrbuf_addbuf(&buffer, msg);\n\n\t/* And check the encoding */\n\tif (encoding_is_utf8 && !is_utf8(buffer.buf))\n\t\tfprintf(stderr, commit_utf8_warn);\n\n\tif (sign_commit && do_sign_commit(&buffer, sign_commit))\n\t\treturn -1;\n\n\tresult = write_sha1_file(buffer.buf, buffer.len, commit_type, ret);\n\tstrbuf_release(&buffer);\n\treturn result;\n}\n\nstruct commit *get_merge_parent(const char *name)\n{\n\tstruct object *obj;\n\tstruct commit *commit;\n\tunsigned char sha1[20];\n\tif (get_sha1(name, sha1))\n\t\treturn NULL;\n\tobj = parse_object(sha1);\n\tcommit = (struct commit *)peel_to_type(name, 0, obj, OBJ_COMMIT);\n\tif (commit && !commit->util) {\n\t\tstruct merge_remote_desc *desc;\n\t\tdesc = xmalloc(sizeof(*desc));\n\t\tdesc->obj = obj;\n\t\tdesc->name = strdup(name);\n\t\tcommit->util = desc;\n\t}\n\treturn commit;\n}\n\n/*\n * Append a commit to the end of the commit_list.\n *\n * next starts by pointing to the variable that holds the head of an\n * empty commit_list, and is updated to point to the \"next\" field of\n * the last item on the list as new commits are appended.\n *\n * Usage example:\n *\n * struct commit_list *list;\n * struct commit_list **next = &list;\n *\n * next = commit_list_append(c1, next);\n * next = commit_list_append(c2, next);\n * assert(commit_list_count(list) == 2);\n * return list;\n */\nstruct commit_list **commit_list_append(struct commit *commit,\n\t\t\t\t\tstruct commit_list **next)\n{\n\tstruct commit_list *new = xmalloc(sizeof(struct commit_list));\n\tnew->item = commit;\n\t*next = new;\n\tnew->next = NULL;\n\treturn &new->next;\n}\n" }, { "path": "src/test/resources/samples/langs/C/commit.h", "content": "#ifndef COMMIT_H\n#define COMMIT_H\n\n#include \"object.h\"\n#include \"tree.h\"\n#include \"strbuf.h\"\n#include \"decorate.h\"\n\nstruct commit_list {\n\tstruct commit *item;\n\tstruct commit_list *next;\n};\n\nstruct commit {\n\tstruct object object;\n\tvoid *util;\n\tunsigned int indegree;\n\tunsigned long date;\n\tstruct commit_list *parents;\n\tstruct tree *tree;\n\tchar *buffer;\n};\n\nextern int save_commit_buffer;\nextern const char *commit_type;\n\n/* While we can decorate any object with a name, it's only used for commits.. */\nextern struct decoration name_decoration;\nstruct name_decoration {\n\tstruct name_decoration *next;\n\tint type;\n\tchar name[1];\n};\n\nstruct commit *lookup_commit(const unsigned char *sha1);\nstruct commit *lookup_commit_reference(const unsigned char *sha1);\nstruct commit *lookup_commit_reference_gently(const unsigned char *sha1,\n\t\t\t\t\t int quiet);\nstruct commit *lookup_commit_reference_by_name(const char *name);\n\n/*\n * Look up object named by \"sha1\", dereference tag as necessary,\n * get a commit and return it. If \"sha1\" does not dereference to\n * a commit, use ref_name to report an error and die.\n */\nstruct commit *lookup_commit_or_die(const unsigned char *sha1, const char *ref_name);\n\nint parse_commit_buffer(struct commit *item, const void *buffer, unsigned long size);\nint parse_commit(struct commit *item);\n\n/* Find beginning and length of commit subject. */\nint find_commit_subject(const char *commit_buffer, const char **subject);\n\nstruct commit_list *commit_list_insert(struct commit *item,\n\t\t\t\t\tstruct commit_list **list);\nstruct commit_list **commit_list_append(struct commit *commit,\n\t\t\t\t\tstruct commit_list **next);\nunsigned commit_list_count(const struct commit_list *l);\nstruct commit_list *commit_list_insert_by_date(struct commit *item,\n\t\t\t\t struct commit_list **list);\nvoid commit_list_sort_by_date(struct commit_list **list);\n\nvoid free_commit_list(struct commit_list *list);\n\n/* Commit formats */\nenum cmit_fmt {\n\tCMIT_FMT_RAW,\n\tCMIT_FMT_MEDIUM,\n\tCMIT_FMT_DEFAULT = CMIT_FMT_MEDIUM,\n\tCMIT_FMT_SHORT,\n\tCMIT_FMT_FULL,\n\tCMIT_FMT_FULLER,\n\tCMIT_FMT_ONELINE,\n\tCMIT_FMT_EMAIL,\n\tCMIT_FMT_USERFORMAT,\n\n\tCMIT_FMT_UNSPECIFIED\n};\n\nstruct pretty_print_context {\n\tenum cmit_fmt fmt;\n\tint abbrev;\n\tconst char *subject;\n\tconst char *after_subject;\n\tint preserve_subject;\n\tenum date_mode date_mode;\n\tunsigned date_mode_explicit:1;\n\tint need_8bit_cte;\n\tint show_notes;\n\tstruct reflog_walk_info *reflog_info;\n\tconst char *output_encoding;\n};\n\nstruct userformat_want {\n\tunsigned notes:1;\n};\n\nextern int has_non_ascii(const char *text);\nstruct rev_info; /* in revision.h, it circularly uses enum cmit_fmt */\nextern char *logmsg_reencode(const struct commit *commit,\n\t\t\t const char *output_encoding);\nextern char *reencode_commit_message(const struct commit *commit,\n\t\t\t\t const char **encoding_p);\nextern void get_commit_format(const char *arg, struct rev_info *);\nextern const char *format_subject(struct strbuf *sb, const char *msg,\n\t\t\t\t const char *line_separator);\nextern void userformat_find_requirements(const char *fmt, struct userformat_want *w);\nextern void format_commit_message(const struct commit *commit,\n\t\t\t\t const char *format, struct strbuf *sb,\n\t\t\t\t const struct pretty_print_context *context);\nextern void pretty_print_commit(const struct pretty_print_context *pp,\n\t\t\t\tconst struct commit *commit,\n\t\t\t\tstruct strbuf *sb);\nextern void pp_commit_easy(enum cmit_fmt fmt, const struct commit *commit,\n\t\t\t struct strbuf *sb);\nvoid pp_user_info(const struct pretty_print_context *pp,\n\t\t const char *what, struct strbuf *sb,\n\t\t const char *line, const char *encoding);\nvoid pp_title_line(const struct pretty_print_context *pp,\n\t\t const char **msg_p,\n\t\t struct strbuf *sb,\n\t\t const char *encoding,\n\t\t int need_8bit_cte);\nvoid pp_remainder(const struct pretty_print_context *pp,\n\t\t const char **msg_p,\n\t\t struct strbuf *sb,\n\t\t int indent);\n\n\n/** Removes the first commit from a list sorted by date, and adds all\n * of its parents.\n **/\nstruct commit *pop_most_recent_commit(struct commit_list **list,\n\t\t\t\t unsigned int mark);\n\nstruct commit *pop_commit(struct commit_list **stack);\n\nvoid clear_commit_marks(struct commit *commit, unsigned int mark);\nvoid clear_commit_marks_for_object_array(struct object_array *a, unsigned mark);\n\n/*\n * Performs an in-place topological sort of list supplied.\n *\n * invariant of resulting list is:\n * a reachable from b => ord(b) < ord(a)\n * in addition, when lifo == 0, commits on parallel tracks are\n * sorted in the dates order.\n */\nvoid sort_in_topological_order(struct commit_list ** list, int lifo);\n\nstruct commit_graft {\n\tunsigned char sha1[20];\n\tint nr_parent; /* < 0 if shallow commit */\n\tunsigned char parent[FLEX_ARRAY][20]; /* more */\n};\ntypedef int (*each_commit_graft_fn)(const struct commit_graft *, void *);\n\nstruct commit_graft *read_graft_line(char *buf, int len);\nint register_commit_graft(struct commit_graft *, int);\nstruct commit_graft *lookup_commit_graft(const unsigned char *sha1);\n\nextern struct commit_list *get_merge_bases(struct commit *rev1, struct commit *rev2, int cleanup);\nextern struct commit_list *get_merge_bases_many(struct commit *one, int n, struct commit **twos, int cleanup);\nextern struct commit_list *get_octopus_merge_bases(struct commit_list *in);\n\nextern int register_shallow(const unsigned char *sha1);\nextern int unregister_shallow(const unsigned char *sha1);\nextern int for_each_commit_graft(each_commit_graft_fn, void *);\nextern int is_repository_shallow(void);\nextern struct commit_list *get_shallow_commits(struct object_array *heads,\n\t\tint depth, int shallow_flag, int not_shallow_flag);\n\nint is_descendant_of(struct commit *, struct commit_list *);\nint in_merge_bases(struct commit *, struct commit **, int);\n\nextern int interactive_add(int argc, const char **argv, const char *prefix, int patch);\nextern int run_add_interactive(const char *revision, const char *patch_mode,\n\t\t\t const char **pathspec);\n\nstatic inline int single_parent(struct commit *commit)\n{\n\treturn commit->parents && !commit->parents->next;\n}\n\nstruct commit_list *reduce_heads(struct commit_list *heads);\n\nstruct commit_extra_header {\n\tstruct commit_extra_header *next;\n\tchar *key;\n\tchar *value;\n\tsize_t len;\n};\n\nextern void append_merge_tag_headers(struct commit_list *parents,\n\t\t\t\t struct commit_extra_header ***tail);\n\nextern int commit_tree(const struct strbuf *msg, unsigned char *tree,\n\t\t struct commit_list *parents, unsigned char *ret,\n\t\t const char *author, const char *sign_commit);\n\nextern int commit_tree_extended(const struct strbuf *msg, unsigned char *tree,\n\t\t\t\tstruct commit_list *parents, unsigned char *ret,\n\t\t\t\tconst char *author, const char *sign_commit,\n\t\t\t\tstruct commit_extra_header *);\n\nextern struct commit_extra_header *read_commit_extra_headers(struct commit *, const char **);\nextern struct commit_extra_header *read_commit_extra_header_lines(const char *buf, size_t len, const char **);\n\nextern void free_commit_extra_headers(struct commit_extra_header *extra);\n\nstruct merge_remote_desc {\n\tstruct object *obj; /* the named object, could be a tag */\n\tconst char *name;\n};\n#define merge_remote_util(commit) ((struct merge_remote_desc *)((commit)->util))\n\n/*\n * Given \"name\" from the command line to merge, find the commit object\n * and return it, while storing merge_remote_desc in its ->util field,\n * to allow callers to tell if we are told to merge a tag.\n */\nstruct commit *get_merge_parent(const char *name);\n\nextern int parse_signed_commit(const unsigned char *sha1,\n\t\t\t struct strbuf *message, struct strbuf *signature);\n#endif /* COMMIT_H */\n" }, { "path": "src/test/resources/samples/langs/C/cpuid.h", "content": "#ifndef CPUID_H\n#define CPUID_H\n\n#include \"misc.h\"\n\nstatic inline void do_cpuid(dword_t *eax, dword_t *ebx, dword_t *ecx, dword_t *edx) {\n dword_t leaf = *eax;\n switch (leaf) {\n case 0:\n *eax = 0x01; // we support barely anything\n *ebx = 0x756e6547; // Genu\n *edx = 0x49656e69; // ineI\n *ecx = 0x6c65746e; // ntel\n break;\n default: // if leaf is too high, use highest supported leaf\n case 1:\n *eax = 0x0; // say nothing about cpu model number\n *ebx = 0x0; // processor number 0, flushes 0 bytes on clflush\n *ecx = 0b00000000000000000000000000000000; // we support none of the features in ecx\n *edx = 0b00000000000000000000000000000000; // we also support none of the features in edx\n break;\n }\n}\n\n#endif\n" }, { "path": "src/test/resources/samples/langs/C/custom_extensions.c", "content": "/* Copyright (c) 2014, Google Inc.\n *\n * Permission to use, copy, modify, and/or distribute this software for any\n * purpose with or without fee is hereby granted, provided that the above\n * copyright notice and this permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY\n * SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION\n * OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN\n * CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. */\n\n#include \n\n#include \n#include \n\n#include \n#include \n#include \n#include \n\n#include \"internal.h\"\n\n\nvoid SSL_CUSTOM_EXTENSION_free(SSL_CUSTOM_EXTENSION *custom_extension) {\n OPENSSL_free(custom_extension);\n}\n\nstatic const SSL_CUSTOM_EXTENSION *custom_ext_find(\n STACK_OF(SSL_CUSTOM_EXTENSION) *stack,\n unsigned *out_index, uint16_t value) {\n size_t i;\n for (i = 0; i < sk_SSL_CUSTOM_EXTENSION_num(stack); i++) {\n const SSL_CUSTOM_EXTENSION *ext = sk_SSL_CUSTOM_EXTENSION_value(stack, i);\n if (ext->value == value) {\n if (out_index != NULL) {\n *out_index = i;\n }\n return ext;\n }\n }\n\n return NULL;\n}\n\n/* default_add_callback is used as the |add_callback| when the user doesn't\n * provide one. For servers, it does nothing while, for clients, it causes an\n * empty extension to be included. */\nstatic int default_add_callback(SSL *ssl, unsigned extension_value,\n const uint8_t **out, size_t *out_len,\n int *out_alert_value, void *add_arg) {\n if (ssl->server) {\n return 0;\n }\n *out_len = 0;\n return 1;\n}\n\nstatic int custom_ext_add_hello(SSL *ssl, CBB *extensions) {\n STACK_OF(SSL_CUSTOM_EXTENSION) *stack = ssl->ctx->client_custom_extensions;\n if (ssl->server) {\n stack = ssl->ctx->server_custom_extensions;\n }\n\n if (stack == NULL) {\n return 1;\n }\n\n size_t i;\n for (i = 0; i < sk_SSL_CUSTOM_EXTENSION_num(stack); i++) {\n const SSL_CUSTOM_EXTENSION *ext = sk_SSL_CUSTOM_EXTENSION_value(stack, i);\n\n if (ssl->server &&\n !(ssl->s3->tmp.custom_extensions.received & (1u << i))) {\n /* Servers cannot echo extensions that the client didn't send. */\n continue;\n }\n\n const uint8_t *contents;\n size_t contents_len;\n int alert = SSL_AD_DECODE_ERROR;\n CBB contents_cbb;\n\n switch (ext->add_callback(ssl, ext->value, &contents, &contents_len, &alert,\n ext->add_arg)) {\n case 1:\n if (!CBB_add_u16(extensions, ext->value) ||\n !CBB_add_u16_length_prefixed(extensions, &contents_cbb) ||\n !CBB_add_bytes(&contents_cbb, contents, contents_len) ||\n !CBB_flush(extensions)) {\n OPENSSL_PUT_ERROR(SSL, ERR_R_INTERNAL_ERROR);\n ERR_add_error_dataf(\"extension: %u\", (unsigned) ext->value);\n if (ext->free_callback && 0 < contents_len) {\n ext->free_callback(ssl, ext->value, contents, ext->add_arg);\n }\n return 0;\n }\n\n if (ext->free_callback && 0 < contents_len) {\n ext->free_callback(ssl, ext->value, contents, ext->add_arg);\n }\n\n if (!ssl->server) {\n assert((ssl->s3->tmp.custom_extensions.sent & (1u << i)) == 0);\n ssl->s3->tmp.custom_extensions.sent |= (1u << i);\n }\n break;\n\n case 0:\n break;\n\n default:\n ssl3_send_alert(ssl, SSL3_AL_FATAL, alert);\n OPENSSL_PUT_ERROR(SSL, SSL_R_CUSTOM_EXTENSION_ERROR);\n ERR_add_error_dataf(\"extension: %u\", (unsigned) ext->value);\n return 0;\n }\n }\n\n return 1;\n}\n\nint custom_ext_add_clienthello(SSL *ssl, CBB *extensions) {\n return custom_ext_add_hello(ssl, extensions);\n}\n\nint custom_ext_parse_serverhello(SSL *ssl, int *out_alert, uint16_t value,\n const CBS *extension) {\n unsigned index;\n const SSL_CUSTOM_EXTENSION *ext =\n custom_ext_find(ssl->ctx->client_custom_extensions, &index, value);\n\n if (/* Unknown extensions are not allowed in a ServerHello. */\n ext == NULL ||\n /* Also, if we didn't send the extension, that's also unacceptable. */\n !(ssl->s3->tmp.custom_extensions.sent & (1u << index))) {\n OPENSSL_PUT_ERROR(SSL, SSL_R_UNEXPECTED_EXTENSION);\n ERR_add_error_dataf(\"extension: %u\", (unsigned)value);\n *out_alert = SSL_AD_DECODE_ERROR;\n return 0;\n }\n\n if (ext->parse_callback != NULL &&\n !ext->parse_callback(ssl, value, CBS_data(extension), CBS_len(extension),\n out_alert, ext->parse_arg)) {\n OPENSSL_PUT_ERROR(SSL, SSL_R_CUSTOM_EXTENSION_ERROR);\n ERR_add_error_dataf(\"extension: %u\", (unsigned)ext->value);\n return 0;\n }\n\n return 1;\n}\n\nint custom_ext_parse_clienthello(SSL *ssl, int *out_alert, uint16_t value,\n const CBS *extension) {\n unsigned index;\n const SSL_CUSTOM_EXTENSION *ext =\n custom_ext_find(ssl->ctx->server_custom_extensions, &index, value);\n\n if (ext == NULL) {\n return 1;\n }\n\n assert((ssl->s3->tmp.custom_extensions.received & (1u << index)) == 0);\n ssl->s3->tmp.custom_extensions.received |= (1u << index);\n\n if (ext->parse_callback &&\n !ext->parse_callback(ssl, value, CBS_data(extension), CBS_len(extension),\n out_alert, ext->parse_arg)) {\n OPENSSL_PUT_ERROR(SSL, SSL_R_CUSTOM_EXTENSION_ERROR);\n ERR_add_error_dataf(\"extension: %u\", (unsigned)ext->value);\n return 0;\n }\n\n return 1;\n}\n\nint custom_ext_add_serverhello(SSL *ssl, CBB *extensions) {\n return custom_ext_add_hello(ssl, extensions);\n}\n\n/* MAX_NUM_CUSTOM_EXTENSIONS is the maximum number of custom extensions that\n * can be set on an |SSL_CTX|. It's determined by the size of the bitset used\n * to track when an extension has been sent. */\n#define MAX_NUM_CUSTOM_EXTENSIONS \\\n (sizeof(((struct ssl3_state_st *)NULL)->tmp.custom_extensions.sent) * 8)\n\nstatic int custom_ext_append(STACK_OF(SSL_CUSTOM_EXTENSION) **stack,\n unsigned extension_value,\n SSL_custom_ext_add_cb add_cb,\n SSL_custom_ext_free_cb free_cb, void *add_arg,\n SSL_custom_ext_parse_cb parse_cb,\n void *parse_arg) {\n if (add_cb == NULL ||\n 0xffff < extension_value ||\n SSL_extension_supported(extension_value) ||\n /* Specifying a free callback without an add callback is nonsensical\n * and an error. */\n (*stack != NULL &&\n (MAX_NUM_CUSTOM_EXTENSIONS <= sk_SSL_CUSTOM_EXTENSION_num(*stack) ||\n custom_ext_find(*stack, NULL, extension_value) != NULL))) {\n return 0;\n }\n\n SSL_CUSTOM_EXTENSION *ext = OPENSSL_malloc(sizeof(SSL_CUSTOM_EXTENSION));\n if (ext == NULL) {\n return 0;\n }\n ext->add_callback = add_cb;\n ext->add_arg = add_arg;\n ext->free_callback = free_cb;\n ext->parse_callback = parse_cb;\n ext->parse_arg = parse_arg;\n ext->value = extension_value;\n\n if (*stack == NULL) {\n *stack = sk_SSL_CUSTOM_EXTENSION_new_null();\n if (*stack == NULL) {\n SSL_CUSTOM_EXTENSION_free(ext);\n return 0;\n }\n }\n\n if (!sk_SSL_CUSTOM_EXTENSION_push(*stack, ext)) {\n SSL_CUSTOM_EXTENSION_free(ext);\n if (sk_SSL_CUSTOM_EXTENSION_num(*stack) == 0) {\n sk_SSL_CUSTOM_EXTENSION_free(*stack);\n *stack = NULL;\n }\n return 0;\n }\n\n return 1;\n}\n\nint SSL_CTX_add_client_custom_ext(SSL_CTX *ctx, unsigned extension_value,\n SSL_custom_ext_add_cb add_cb,\n SSL_custom_ext_free_cb free_cb, void *add_arg,\n SSL_custom_ext_parse_cb parse_cb,\n void *parse_arg) {\n return custom_ext_append(&ctx->client_custom_extensions, extension_value,\n add_cb ? add_cb : default_add_callback, free_cb,\n add_arg, parse_cb, parse_arg);\n}\n\nint SSL_CTX_add_server_custom_ext(SSL_CTX *ctx, unsigned extension_value,\n SSL_custom_ext_add_cb add_cb,\n SSL_custom_ext_free_cb free_cb, void *add_arg,\n SSL_custom_ext_parse_cb parse_cb,\n void *parse_arg) {\n return custom_ext_append(&ctx->server_custom_extensions, extension_value,\n add_cb ? add_cb : default_add_callback, free_cb,\n add_arg, parse_cb, parse_arg);\n}" }, { "path": "src/test/resources/samples/langs/C/driver.h", "content": "#pragma once\n\n/* Copyright © 2011 Fritz Grimpen\n *\n * This file is part of Xelix.\n *\n * Xelix 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 * Xelix 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 Xelix. If not, see .\n */\n\n#include \n#include \n\n#define CONSOLE_DRV_CAP_CLEAR 0x01\n#define CONSOLE_DRV_CAP_SCROLL 0x02\n#define CONSOLE_DRV_CAP_SET_CURSOR 0x04\n\n// Input modifier keys\ntypedef struct {\n\tbool shift_left:1;\n\tbool shift_right:1;\n\tbool control_left:1;\n\tbool control_right:1;\n\tbool alt:1;\n\tbool super:1;\n} console_modifiers_t;\n\ntypedef struct {\n\tchar character;\n\tconsole_modifiers_t* modifiers;\n} console_read_t;\n\ntypedef struct {\n\tint (*write)(console_info_t*, char);\n\tconsole_read_t* (*read)(console_info_t*);\n\n\tint capabilities;\n\n\tint (*_clear)(console_info_t*);\n\tint (*scroll)(console_info_t*, int32_t);\n\tvoid (*setCursor)(console_info_t*, uint32_t, uint32_t);\n} console_driver_t;\n" }, { "path": "src/test/resources/samples/langs/C/elf.h", "content": "#pragma once\n\n/* Copyright © 2011 Lukas Martini\n *\n * This file is part of Xelix.\n *\n * Xelix 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 * Xelix 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.\tSee 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 Xelix. If not, see .\n */\n\n#include \n#include \n\n#define ELF_TYPE_NONE 0\n#define ELF_TYPE_REL 1\n#define ELF_TYPE_EXEC 2\n#define ELF_TYPE_DYN 3\n#define ELF_TYPE_CORE 4\n\n#define ELF_ARCH_NONE 0\n#define ELF_ARCH_386 3\n\n#define ELF_VERSION_CURRENT 1\n\ntypedef struct {\n\tunsigned char magic[4];\n\t/* Note: There _is_ other stuff in here, but we don't need it */\n\tunsigned char pad[12]; \n} __attribute__((packed)) elf_ident_t;\n\ntypedef struct {\n\tuint32_t type;\n\tuint32_t offset;\n\tvoid*\t\tvirtaddr;\n\tvoid*\t\tphysaddr;\n\tuint32_t filesize;\n\tuint32_t memsize;\n\tuint32_t flags;\n\tuint32_t alignment;\n} __attribute__((packed)) elf_program_t;\n\ntypedef struct {\n\telf_ident_t ident;\n\tuint16_t\ttype;\t\t/* Object file type */\n\tuint16_t\tmachine;\t/* Architecture */\n\tuint32_t\tversion;\t/* Object file version */\n\tvoid*\t\tentry;\t\t/* Entry point virtual address */\n\tuint32_t\tphoff;\t\t/* Program header table file offset */\n\tuint32_t\tshoff;\t\t/* Section header table file offset */\n\tuint32_t\tflags;\t\t/* Processor-specific flags */\n\tuint16_t\tehsize;\t\t/* ELF header size in bytes */\n\tuint16_t\tphentsize;\t/* Program header table entry size */\n\tuint16_t\tphnum;\t\t/* Program header table entry count */\n\tuint16_t\tshentsize;\t/* Section header table entry size */\n\tuint16_t\tshnum;\t\t/* Section header table entry count */\n\tuint16_t\tshstrndx;\t/* Section header string table index */\n} __attribute__((packed)) elf_t;\n\ntask_t* elf_load(elf_t* bin, char* name, char** environ, char** argv, int argc);\ntask_t* elf_load_file(char* path, char** environ, char** argv, int argc);\n" }, { "path": "src/test/resources/samples/langs/C/exception.zep.c", "content": "\n#ifdef HAVE_CONFIG_H\n#include \"../../ext_config.h\"\n#endif\n\n#include \n#include \"../../php_ext.h\"\n#include \"../../ext.h\"\n\n#include \n#include \n#include \n\n#include \"kernel/main.h\"\n\n\n/**\n * Test\\Router\\Exception\n *\n * Exceptions generated by the router\n */\nZEPHIR_INIT_CLASS(Test_Router_Exception) {\n\n ZEPHIR_REGISTER_CLASS_EX(Test\\\\Router, Exception, test, router_exception, zend_exception_get_default(TSRMLS_C), NULL, 0);\n\n return SUCCESS;\n\n}\n" }, { "path": "src/test/resources/samples/langs/C/exception.zep.h", "content": "\nextern zend_class_entry *test_router_exception_ce;\n\nZEPHIR_INIT_CLASS(Test_Router_Exception);\n" }, { "path": "src/test/resources/samples/langs/C/filter.h", "content": "#pragma once\n\n/* Copyright © 2011 Fritz Grimpen\n *\n * This file is part of Xelix.\n *\n * Xelix 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 * Xelix 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 Xelix. If not, see .\n */\n\n#include \n#include \n#include \n\nstruct console_filter {\n\t// General callback for all actions etc.\n\t// Preferred prototype:\n\t// char (char c, console_info_t *info, console_driver_t *input, console_driver_t *output);\n\tchar (*callback)(char, console_info_t*, console_driver_t*, console_driver_t*);\n\n\t// Specific callbacks for read and write\n\t// Preferred prototype:\n\t// char (char c, console_info_t *info, console_driver_t *input);\n\tchar (*read_callback)(char, console_info_t*, console_driver_t*);\n\n\t// Preferred prototype:\n\t// char (char c, console_info_t *info, console_driver_t *output);\n\tchar (*write_callback)(char, console_info_t*, console_driver_t*);\n\n\t// The next filter in the filter chain\n\tstruct console_filter* next;\n};\n\ntypedef struct console_filter console_filter_t;\n\n" }, { "path": "src/test/resources/samples/langs/C/fudge_node.c", "content": "/* Copyright (c) 2010 Jens Nyberg\n\nPermission is hereby granted, free of charge, to any person\nobtaining a copy of this software and associated documentation\nfiles (the \"Software\"), to deal in the Software without\nrestriction, including without limitation the rights to use,\ncopy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the\nSoftware is furnished to do so, subject to the following\nconditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\nOF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\nNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\nHOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\nWHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\nFROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\nOTHER DEALINGS IN THE SOFTWARE. */\n\n#include \n#include \n#include \n#include \"pipe.h\"\n\nstatic struct system_node root;\nstatic struct system_node clone;\n\nstatic unsigned int read(struct pipe_end *endself, struct pipe_end *endtarget, struct service_state *state, unsigned int count, void *buffer)\n{\n\n count = buffer_rcfifo(&endself->buffer, count, buffer);\n\n if (!count && endtarget->node.refcount)\n {\n\n list_add(&endself->readlinks, &state->link);\n task_setstatus(state->link.data, TASK_STATUS_BLOCKED);\n\n }\n\n system_wakeup(&endtarget->writelinks);\n\n return count;\n\n}\n\nstatic unsigned int write(struct pipe_end *endself, struct pipe_end *endtarget, struct service_state *state, unsigned int count, void *buffer)\n{\n\n count = buffer_wcfifo(&endtarget->buffer, count, buffer);\n\n if (!count)\n {\n\n list_add(&endself->writelinks, &state->link);\n task_setstatus(state->link.data, TASK_STATUS_BLOCKED);\n\n }\n\n system_wakeup(&endtarget->readlinks);\n\n return count;\n\n}\n\nstatic unsigned int end0_read(struct system_node *self, struct service_state *state, unsigned int count, void *buffer)\n{\n\n struct pipe *pipe = (struct pipe *)self->parent;\n\n return read(&pipe->end0, &pipe->end1, state, count, buffer);\n\n}\n\nstatic unsigned int end0_write(struct system_node *self, struct service_state *state, unsigned int count, void *buffer)\n{\n\n struct pipe *pipe = (struct pipe *)self->parent;\n\n return write(&pipe->end0, &pipe->end1, state, count, buffer);\n\n}\n\nstatic unsigned int end1_read(struct system_node *self, struct service_state *state, unsigned int count, void *buffer)\n{\n\n struct pipe *pipe = (struct pipe *)self->parent;\n\n return read(&pipe->end1, &pipe->end0, state, count, buffer);\n\n}\n\nstatic unsigned int end1_write(struct system_node *self, struct service_state *state, unsigned int count, void *buffer)\n{\n\n struct pipe *pipe = (struct pipe *)self->parent;\n\n return write(&pipe->end1, &pipe->end0, state, count, buffer);\n\n}\n\nstatic unsigned int clone_child(struct system_node *self, unsigned int count, char *path)\n{\n\n struct list_item *current;\n\n for (current = root.children.head; current; current = current->next)\n {\n\n struct system_node *node = current->data;\n struct pipe *pipe = current->data;\n\n if (node == self)\n continue;\n\n if (pipe->end0.node.refcount || pipe->end1.node.refcount)\n continue;\n\n return node->child(node, count, path);\n\n }\n\n return 0;\n\n}\n\nvoid pipe_init(struct pipe *pipe)\n{\n\n buffer_init(&pipe->end0.buffer, 4096, pipe->end0.data);\n buffer_init(&pipe->end1.buffer, 4096, pipe->end1.data);\n system_initnode(&pipe->end0.node, SYSTEM_NODETYPE_NORMAL, \"0\");\n system_initnode(&pipe->end1.node, SYSTEM_NODETYPE_NORMAL, \"1\");\n\n pipe->end0.node.read = end0_read;\n pipe->end0.node.write = end0_write;\n pipe->end1.node.read = end1_read;\n pipe->end1.node.write = end1_write;\n\n system_initnode(&pipe->root, SYSTEM_NODETYPE_GROUP | SYSTEM_NODETYPE_MULTI, \"pipe\");\n system_addchild(&pipe->root, &pipe->end0.node);\n system_addchild(&pipe->root, &pipe->end1.node);\n\n}\n\nvoid pipe_register(struct pipe *pipe)\n{\n\n system_addchild(&root, &pipe->root);\n\n}\n\nvoid pipe_unregister(struct pipe *pipe)\n{\n\n system_removechild(&root, &pipe->root);\n\n}\n\nvoid module_init(void)\n{\n\n system_initnode(&root, SYSTEM_NODETYPE_GROUP, \"pipe\");\n system_initnode(&clone, SYSTEM_NODETYPE_GROUP, \"clone\");\n\n clone.child = clone_child;\n\n system_addchild(&root, &clone);\n\n}\n\nvoid module_register(void)\n{\n\n system_registernode(&root);\n\n}\n\nvoid module_unregister(void)\n{\n\n system_unregisternode(&root);\n\n}\n" }, { "path": "src/test/resources/samples/langs/C/git.c", "content": "#include \"builtin.h\"\n#include \"cache.h\"\n#include \"exec_cmd.h\"\n#include \"help.h\"\n#include \"quote.h\"\n#include \"run-command.h\"\n\nconst char git_usage_string[] =\n\t\"git [--version] [--exec-path[=]] [--html-path] [--man-path] [--info-path]\\n\"\n\t\" [-p|--paginate|--no-pager] [--no-replace-objects] [--bare]\\n\"\n\t\" [--git-dir=] [--work-tree=] [--namespace=]\\n\"\n\t\" [-c name=value] [--help]\\n\"\n\t\" []\";\n\nconst char git_more_info_string[] =\n\tN_(\"See 'git help ' for more information on a specific command.\");\n\nstatic struct startup_info git_startup_info;\nstatic int use_pager = -1;\nstruct pager_config {\n\tconst char *cmd;\n\tint want;\n\tchar *value;\n};\n\nstatic int pager_command_config(const char *var, const char *value, void *data)\n{\n\tstruct pager_config *c = data;\n\tif (!prefixcmp(var, \"pager.\") && !strcmp(var + 6, c->cmd)) {\n\t\tint b = git_config_maybe_bool(var, value);\n\t\tif (b >= 0)\n\t\t\tc->want = b;\n\t\telse {\n\t\t\tc->want = 1;\n\t\t\tc->value = xstrdup(value);\n\t\t}\n\t}\n\treturn 0;\n}\n\n/* returns 0 for \"no pager\", 1 for \"use pager\", and -1 for \"not specified\" */\nint check_pager_config(const char *cmd)\n{\n\tstruct pager_config c;\n\tc.cmd = cmd;\n\tc.want = -1;\n\tc.value = NULL;\n\tgit_config(pager_command_config, &c);\n\tif (c.value)\n\t\tpager_program = c.value;\n\treturn c.want;\n}\n\nstatic void commit_pager_choice(void) {\n\tswitch (use_pager) {\n\tcase 0:\n\t\tsetenv(\"GIT_PAGER\", \"cat\", 1);\n\t\tbreak;\n\tcase 1:\n\t\tsetup_pager();\n\t\tbreak;\n\tdefault:\n\t\tbreak;\n\t}\n}\n\nstatic int handle_options(const char ***argv, int *argc, int *envchanged)\n{\n\tconst char **orig_argv = *argv;\n\n\twhile (*argc > 0) {\n\t\tconst char *cmd = (*argv)[0];\n\t\tif (cmd[0] != '-')\n\t\t\tbreak;\n\n\t\t/*\n\t\t * For legacy reasons, the \"version\" and \"help\"\n\t\t * commands can be written with \"--\" prepended\n\t\t * to make them look like flags.\n\t\t */\n\t\tif (!strcmp(cmd, \"--help\") || !strcmp(cmd, \"--version\"))\n\t\t\tbreak;\n\n\t\t/*\n\t\t * Check remaining flags.\n\t\t */\n\t\tif (!prefixcmp(cmd, \"--exec-path\")) {\n\t\t\tcmd += 11;\n\t\t\tif (*cmd == '=')\n\t\t\t\tgit_set_argv_exec_path(cmd + 1);\n\t\t\telse {\n\t\t\t\tputs(git_exec_path());\n\t\t\t\texit(0);\n\t\t\t}\n\t\t} else if (!strcmp(cmd, \"--html-path\")) {\n\t\t\tputs(system_path(GIT_HTML_PATH));\n\t\t\texit(0);\n\t\t} else if (!strcmp(cmd, \"--man-path\")) {\n\t\t\tputs(system_path(GIT_MAN_PATH));\n\t\t\texit(0);\n\t\t} else if (!strcmp(cmd, \"--info-path\")) {\n\t\t\tputs(system_path(GIT_INFO_PATH));\n\t\t\texit(0);\n\t\t} else if (!strcmp(cmd, \"-p\") || !strcmp(cmd, \"--paginate\")) {\n\t\t\tuse_pager = 1;\n\t\t} else if (!strcmp(cmd, \"--no-pager\")) {\n\t\t\tuse_pager = 0;\n\t\t\tif (envchanged)\n\t\t\t\t*envchanged = 1;\n\t\t} else if (!strcmp(cmd, \"--no-replace-objects\")) {\n\t\t\tread_replace_refs = 0;\n\t\t\tsetenv(NO_REPLACE_OBJECTS_ENVIRONMENT, \"1\", 1);\n\t\t\tif (envchanged)\n\t\t\t\t*envchanged = 1;\n\t\t} else if (!strcmp(cmd, \"--git-dir\")) {\n\t\t\tif (*argc < 2) {\n\t\t\t\tfprintf(stderr, \"No directory given for --git-dir.\\n\" );\n\t\t\t\tusage(git_usage_string);\n\t\t\t}\n\t\t\tsetenv(GIT_DIR_ENVIRONMENT, (*argv)[1], 1);\n\t\t\tif (envchanged)\n\t\t\t\t*envchanged = 1;\n\t\t\t(*argv)++;\n\t\t\t(*argc)--;\n\t\t} else if (!prefixcmp(cmd, \"--git-dir=\")) {\n\t\t\tsetenv(GIT_DIR_ENVIRONMENT, cmd + 10, 1);\n\t\t\tif (envchanged)\n\t\t\t\t*envchanged = 1;\n\t\t} else if (!strcmp(cmd, \"--namespace\")) {\n\t\t\tif (*argc < 2) {\n\t\t\t\tfprintf(stderr, \"No namespace given for --namespace.\\n\" );\n\t\t\t\tusage(git_usage_string);\n\t\t\t}\n\t\t\tsetenv(GIT_NAMESPACE_ENVIRONMENT, (*argv)[1], 1);\n\t\t\tif (envchanged)\n\t\t\t\t*envchanged = 1;\n\t\t\t(*argv)++;\n\t\t\t(*argc)--;\n\t\t} else if (!prefixcmp(cmd, \"--namespace=\")) {\n\t\t\tsetenv(GIT_NAMESPACE_ENVIRONMENT, cmd + 12, 1);\n\t\t\tif (envchanged)\n\t\t\t\t*envchanged = 1;\n\t\t} else if (!strcmp(cmd, \"--work-tree\")) {\n\t\t\tif (*argc < 2) {\n\t\t\t\tfprintf(stderr, \"No directory given for --work-tree.\\n\" );\n\t\t\t\tusage(git_usage_string);\n\t\t\t}\n\t\t\tsetenv(GIT_WORK_TREE_ENVIRONMENT, (*argv)[1], 1);\n\t\t\tif (envchanged)\n\t\t\t\t*envchanged = 1;\n\t\t\t(*argv)++;\n\t\t\t(*argc)--;\n\t\t} else if (!prefixcmp(cmd, \"--work-tree=\")) {\n\t\t\tsetenv(GIT_WORK_TREE_ENVIRONMENT, cmd + 12, 1);\n\t\t\tif (envchanged)\n\t\t\t\t*envchanged = 1;\n\t\t} else if (!strcmp(cmd, \"--bare\")) {\n\t\t\tstatic char git_dir[PATH_MAX+1];\n\t\t\tis_bare_repository_cfg = 1;\n\t\t\tsetenv(GIT_DIR_ENVIRONMENT, getcwd(git_dir, sizeof(git_dir)), 0);\n\t\t\tif (envchanged)\n\t\t\t\t*envchanged = 1;\n\t\t} else if (!strcmp(cmd, \"-c\")) {\n\t\t\tif (*argc < 2) {\n\t\t\t\tfprintf(stderr, \"-c expects a configuration string\\n\" );\n\t\t\t\tusage(git_usage_string);\n\t\t\t}\n\t\t\tgit_config_push_parameter((*argv)[1]);\n\t\t\t(*argv)++;\n\t\t\t(*argc)--;\n\t\t} else {\n\t\t\tfprintf(stderr, \"Unknown option: %s\\n\", cmd);\n\t\t\tusage(git_usage_string);\n\t\t}\n\n\t\t(*argv)++;\n\t\t(*argc)--;\n\t}\n\treturn (*argv) - orig_argv;\n}\n\nstatic int handle_alias(int *argcp, const char ***argv)\n{\n\tint envchanged = 0, ret = 0, saved_errno = errno;\n\tconst char *subdir;\n\tint count, option_count;\n\tconst char **new_argv;\n\tconst char *alias_command;\n\tchar *alias_string;\n\tint unused_nongit;\n\n\tsubdir = setup_git_directory_gently(&unused_nongit);\n\n\talias_command = (*argv)[0];\n\talias_string = alias_lookup(alias_command);\n\tif (alias_string) {\n\t\tif (alias_string[0] == '!') {\n\t\t\tconst char **alias_argv;\n\t\t\tint argc = *argcp, i;\n\n\t\t\tcommit_pager_choice();\n\n\t\t\t/* build alias_argv */\n\t\t\talias_argv = xmalloc(sizeof(*alias_argv) * (argc + 1));\n\t\t\talias_argv[0] = alias_string + 1;\n\t\t\tfor (i = 1; i < argc; ++i)\n\t\t\t\talias_argv[i] = (*argv)[i];\n\t\t\talias_argv[argc] = NULL;\n\n\t\t\tret = run_command_v_opt(alias_argv, RUN_USING_SHELL);\n\t\t\tif (ret >= 0) /* normal exit */\n\t\t\t\texit(ret);\n\n\t\t\tdie_errno(\"While expanding alias '%s': '%s'\",\n\t\t\t alias_command, alias_string + 1);\n\t\t}\n\t\tcount = split_cmdline(alias_string, &new_argv);\n\t\tif (count < 0)\n\t\t\tdie(\"Bad alias.%s string: %s\", alias_command,\n\t\t\t split_cmdline_strerror(count));\n\t\toption_count = handle_options(&new_argv, &count, &envchanged);\n\t\tif (envchanged)\n\t\t\tdie(\"alias '%s' changes environment variables\\n\"\n\t\t\t\t \"You can use '!git' in the alias to do this.\",\n\t\t\t\t alias_command);\n\t\tmemmove(new_argv - option_count, new_argv,\n\t\t\t\tcount * sizeof(char *));\n\t\tnew_argv -= option_count;\n\n\t\tif (count < 1)\n\t\t\tdie(\"empty alias for %s\", alias_command);\n\n\t\tif (!strcmp(alias_command, new_argv[0]))\n\t\t\tdie(\"recursive alias: %s\", alias_command);\n\n\t\ttrace_argv_printf(new_argv,\n\t\t\t\t \"trace: alias expansion: %s =>\",\n\t\t\t\t alias_command);\n\n\t\tnew_argv = xrealloc(new_argv, sizeof(char *) *\n\t\t\t\t (count + *argcp));\n\t\t/* insert after command name */\n\t\tmemcpy(new_argv + count, *argv + 1, sizeof(char *) * *argcp);\n\n\t\t*argv = new_argv;\n\t\t*argcp += count - 1;\n\n\t\tret = 1;\n\t}\n\n\tif (subdir && chdir(subdir))\n\t\tdie_errno(\"Cannot change to '%s'\", subdir);\n\n\terrno = saved_errno;\n\n\treturn ret;\n}\n\nconst char git_version_string[] = GIT_VERSION;\n\n#define RUN_SETUP\t\t(1<<0)\n#define RUN_SETUP_GENTLY\t(1<<1)\n#define USE_PAGER\t\t(1<<2)\n/*\n * require working tree to be present -- anything uses this needs\n * RUN_SETUP for reading from the configuration file.\n */\n#define NEED_WORK_TREE\t\t(1<<3)\n\nstruct cmd_struct {\n\tconst char *cmd;\n\tint (*fn)(int, const char **, const char *);\n\tint option;\n};\n\nstatic int run_builtin(struct cmd_struct *p, int argc, const char **argv)\n{\n\tint status, help;\n\tstruct stat st;\n\tconst char *prefix;\n\n\tprefix = NULL;\n\thelp = argc == 2 && !strcmp(argv[1], \"-h\");\n\tif (!help) {\n\t\tif (p->option & RUN_SETUP)\n\t\t\tprefix = setup_git_directory();\n\t\tif (p->option & RUN_SETUP_GENTLY) {\n\t\t\tint nongit_ok;\n\t\t\tprefix = setup_git_directory_gently(&nongit_ok);\n\t\t}\n\n\t\tif (use_pager == -1 && p->option & (RUN_SETUP | RUN_SETUP_GENTLY))\n\t\t\tuse_pager = check_pager_config(p->cmd);\n\t\tif (use_pager == -1 && p->option & USE_PAGER)\n\t\t\tuse_pager = 1;\n\n\t\tif ((p->option & (RUN_SETUP | RUN_SETUP_GENTLY)) &&\n\t\t startup_info->have_repository) /* get_git_dir() may set up repo, avoid that */\n\t\t\ttrace_repo_setup(prefix);\n\t}\n\tcommit_pager_choice();\n\n\tif (!help && p->option & NEED_WORK_TREE)\n\t\tsetup_work_tree();\n\n\ttrace_argv_printf(argv, \"trace: built-in: git\");\n\n\tstatus = p->fn(argc, argv, prefix);\n\tif (status)\n\t\treturn status;\n\n\t/* Somebody closed stdout? */\n\tif (fstat(fileno(stdout), &st))\n\t\treturn 0;\n\t/* Ignore write errors for pipes and sockets.. */\n\tif (S_ISFIFO(st.st_mode) || S_ISSOCK(st.st_mode))\n\t\treturn 0;\n\n\t/* Check for ENOSPC and EIO errors.. */\n\tif (fflush(stdout))\n\t\tdie_errno(\"write failure on standard output\");\n\tif (ferror(stdout))\n\t\tdie(\"unknown write failure on standard output\");\n\tif (fclose(stdout))\n\t\tdie_errno(\"close failed on standard output\");\n\treturn 0;\n}\n\nstatic void handle_internal_command(int argc, const char **argv)\n{\n\tconst char *cmd = argv[0];\n\tstatic struct cmd_struct commands[] = {\n\t\t{ \"add\", cmd_add, RUN_SETUP | NEED_WORK_TREE },\n\t\t{ \"annotate\", cmd_annotate, RUN_SETUP },\n\t\t{ \"apply\", cmd_apply, RUN_SETUP_GENTLY },\n\t\t{ \"archive\", cmd_archive },\n\t\t{ \"bisect--helper\", cmd_bisect__helper, RUN_SETUP },\n\t\t{ \"blame\", cmd_blame, RUN_SETUP },\n\t\t{ \"branch\", cmd_branch, RUN_SETUP },\n\t\t{ \"bundle\", cmd_bundle, RUN_SETUP_GENTLY },\n\t\t{ \"cat-file\", cmd_cat_file, RUN_SETUP },\n\t\t{ \"check-attr\", cmd_check_attr, RUN_SETUP },\n\t\t{ \"check-ref-format\", cmd_check_ref_format },\n\t\t{ \"checkout\", cmd_checkout, RUN_SETUP | NEED_WORK_TREE },\n\t\t{ \"checkout-index\", cmd_checkout_index,\n\t\t\tRUN_SETUP | NEED_WORK_TREE},\n\t\t{ \"cherry\", cmd_cherry, RUN_SETUP },\n\t\t{ \"cherry-pick\", cmd_cherry_pick, RUN_SETUP | NEED_WORK_TREE },\n\t\t{ \"clean\", cmd_clean, RUN_SETUP | NEED_WORK_TREE },\n\t\t{ \"clone\", cmd_clone },\n\t\t{ \"column\", cmd_column, RUN_SETUP_GENTLY },\n\t\t{ \"commit\", cmd_commit, RUN_SETUP | NEED_WORK_TREE },\n\t\t{ \"commit-tree\", cmd_commit_tree, RUN_SETUP },\n\t\t{ \"config\", cmd_config, RUN_SETUP_GENTLY },\n\t\t{ \"count-objects\", cmd_count_objects, RUN_SETUP },\n\t\t{ \"describe\", cmd_describe, RUN_SETUP },\n\t\t{ \"diff\", cmd_diff },\n\t\t{ \"diff-files\", cmd_diff_files, RUN_SETUP | NEED_WORK_TREE },\n\t\t{ \"diff-index\", cmd_diff_index, RUN_SETUP },\n\t\t{ \"diff-tree\", cmd_diff_tree, RUN_SETUP },\n\t\t{ \"fast-export\", cmd_fast_export, RUN_SETUP },\n\t\t{ \"fetch\", cmd_fetch, RUN_SETUP },\n\t\t{ \"fetch-pack\", cmd_fetch_pack, RUN_SETUP },\n\t\t{ \"fmt-merge-msg\", cmd_fmt_merge_msg, RUN_SETUP },\n\t\t{ \"for-each-ref\", cmd_for_each_ref, RUN_SETUP },\n\t\t{ \"format-patch\", cmd_format_patch, RUN_SETUP },\n\t\t{ \"fsck\", cmd_fsck, RUN_SETUP },\n\t\t{ \"fsck-objects\", cmd_fsck, RUN_SETUP },\n\t\t{ \"gc\", cmd_gc, RUN_SETUP },\n\t\t{ \"get-tar-commit-id\", cmd_get_tar_commit_id },\n\t\t{ \"grep\", cmd_grep, RUN_SETUP_GENTLY },\n\t\t{ \"hash-object\", cmd_hash_object },\n\t\t{ \"help\", cmd_help },\n\t\t{ \"index-pack\", cmd_index_pack, RUN_SETUP_GENTLY },\n\t\t{ \"init\", cmd_init_db },\n\t\t{ \"init-db\", cmd_init_db },\n\t\t{ \"log\", cmd_log, RUN_SETUP },\n\t\t{ \"ls-files\", cmd_ls_files, RUN_SETUP },\n\t\t{ \"ls-remote\", cmd_ls_remote, RUN_SETUP_GENTLY },\n\t\t{ \"ls-tree\", cmd_ls_tree, RUN_SETUP },\n\t\t{ \"mailinfo\", cmd_mailinfo },\n\t\t{ \"mailsplit\", cmd_mailsplit },\n\t\t{ \"merge\", cmd_merge, RUN_SETUP | NEED_WORK_TREE },\n\t\t{ \"merge-base\", cmd_merge_base, RUN_SETUP },\n\t\t{ \"merge-file\", cmd_merge_file, RUN_SETUP_GENTLY },\n\t\t{ \"merge-index\", cmd_merge_index, RUN_SETUP },\n\t\t{ \"merge-ours\", cmd_merge_ours, RUN_SETUP },\n\t\t{ \"merge-recursive\", cmd_merge_recursive, RUN_SETUP | NEED_WORK_TREE },\n\t\t{ \"merge-recursive-ours\", cmd_merge_recursive, RUN_SETUP | NEED_WORK_TREE },\n\t\t{ \"merge-recursive-theirs\", cmd_merge_recursive, RUN_SETUP | NEED_WORK_TREE },\n\t\t{ \"merge-subtree\", cmd_merge_recursive, RUN_SETUP | NEED_WORK_TREE },\n\t\t{ \"merge-tree\", cmd_merge_tree, RUN_SETUP },\n\t\t{ \"mktag\", cmd_mktag, RUN_SETUP },\n\t\t{ \"mktree\", cmd_mktree, RUN_SETUP },\n\t\t{ \"mv\", cmd_mv, RUN_SETUP | NEED_WORK_TREE },\n\t\t{ \"name-rev\", cmd_name_rev, RUN_SETUP },\n\t\t{ \"notes\", cmd_notes, RUN_SETUP },\n\t\t{ \"pack-objects\", cmd_pack_objects, RUN_SETUP },\n\t\t{ \"pack-redundant\", cmd_pack_redundant, RUN_SETUP },\n\t\t{ \"pack-refs\", cmd_pack_refs, RUN_SETUP },\n\t\t{ \"patch-id\", cmd_patch_id },\n\t\t{ \"peek-remote\", cmd_ls_remote, RUN_SETUP_GENTLY },\n\t\t{ \"pickaxe\", cmd_blame, RUN_SETUP },\n\t\t{ \"prune\", cmd_prune, RUN_SETUP },\n\t\t{ \"prune-packed\", cmd_prune_packed, RUN_SETUP },\n\t\t{ \"push\", cmd_push, RUN_SETUP },\n\t\t{ \"read-tree\", cmd_read_tree, RUN_SETUP },\n\t\t{ \"receive-pack\", cmd_receive_pack },\n\t\t{ \"reflog\", cmd_reflog, RUN_SETUP },\n\t\t{ \"remote\", cmd_remote, RUN_SETUP },\n\t\t{ \"remote-ext\", cmd_remote_ext },\n\t\t{ \"remote-fd\", cmd_remote_fd },\n\t\t{ \"replace\", cmd_replace, RUN_SETUP },\n\t\t{ \"repo-config\", cmd_repo_config, RUN_SETUP_GENTLY },\n\t\t{ \"rerere\", cmd_rerere, RUN_SETUP },\n\t\t{ \"reset\", cmd_reset, RUN_SETUP },\n\t\t{ \"rev-list\", cmd_rev_list, RUN_SETUP },\n\t\t{ \"rev-parse\", cmd_rev_parse },\n\t\t{ \"revert\", cmd_revert, RUN_SETUP | NEED_WORK_TREE },\n\t\t{ \"rm\", cmd_rm, RUN_SETUP },\n\t\t{ \"send-pack\", cmd_send_pack, RUN_SETUP },\n\t\t{ \"shortlog\", cmd_shortlog, RUN_SETUP_GENTLY | USE_PAGER },\n\t\t{ \"show\", cmd_show, RUN_SETUP },\n\t\t{ \"show-branch\", cmd_show_branch, RUN_SETUP },\n\t\t{ \"show-ref\", cmd_show_ref, RUN_SETUP },\n\t\t{ \"stage\", cmd_add, RUN_SETUP | NEED_WORK_TREE },\n\t\t{ \"status\", cmd_status, RUN_SETUP | NEED_WORK_TREE },\n\t\t{ \"stripspace\", cmd_stripspace },\n\t\t{ \"symbolic-ref\", cmd_symbolic_ref, RUN_SETUP },\n\t\t{ \"tag\", cmd_tag, RUN_SETUP },\n\t\t{ \"tar-tree\", cmd_tar_tree },\n\t\t{ \"unpack-file\", cmd_unpack_file, RUN_SETUP },\n\t\t{ \"unpack-objects\", cmd_unpack_objects, RUN_SETUP },\n\t\t{ \"update-index\", cmd_update_index, RUN_SETUP },\n\t\t{ \"update-ref\", cmd_update_ref, RUN_SETUP },\n\t\t{ \"update-server-info\", cmd_update_server_info, RUN_SETUP },\n\t\t{ \"upload-archive\", cmd_upload_archive },\n\t\t{ \"upload-archive--writer\", cmd_upload_archive_writer },\n\t\t{ \"var\", cmd_var, RUN_SETUP_GENTLY },\n\t\t{ \"verify-pack\", cmd_verify_pack },\n\t\t{ \"verify-tag\", cmd_verify_tag, RUN_SETUP },\n\t\t{ \"version\", cmd_version },\n\t\t{ \"whatchanged\", cmd_whatchanged, RUN_SETUP },\n\t\t{ \"write-tree\", cmd_write_tree, RUN_SETUP },\n\t};\n\tint i;\n\tstatic const char ext[] = STRIP_EXTENSION;\n\n\tif (sizeof(ext) > 1) {\n\t\ti = strlen(argv[0]) - strlen(ext);\n\t\tif (i > 0 && !strcmp(argv[0] + i, ext)) {\n\t\t\tchar *argv0 = xstrdup(argv[0]);\n\t\t\targv[0] = cmd = argv0;\n\t\t\targv0[i] = '\\0';\n\t\t}\n\t}\n\n\t/* Turn \"git cmd --help\" into \"git help cmd\" */\n\tif (argc > 1 && !strcmp(argv[1], \"--help\")) {\n\t\targv[1] = argv[0];\n\t\targv[0] = cmd = \"help\";\n\t}\n\n\tfor (i = 0; i < ARRAY_SIZE(commands); i++) {\n\t\tstruct cmd_struct *p = commands+i;\n\t\tif (strcmp(p->cmd, cmd))\n\t\t\tcontinue;\n\t\texit(run_builtin(p, argc, argv));\n\t}\n}\n\nstatic void execv_dashed_external(const char **argv)\n{\n\tstruct strbuf cmd = STRBUF_INIT;\n\tconst char *tmp;\n\tint status;\n\n\tif (use_pager == -1)\n\t\tuse_pager = check_pager_config(argv[0]);\n\tcommit_pager_choice();\n\n\tstrbuf_addf(&cmd, \"git-%s\", argv[0]);\n\n\t/*\n\t * argv[0] must be the git command, but the argv array\n\t * belongs to the caller, and may be reused in\n\t * subsequent loop iterations. Save argv[0] and\n\t * restore it on error.\n\t */\n\ttmp = argv[0];\n\targv[0] = cmd.buf;\n\n\ttrace_argv_printf(argv, \"trace: exec:\");\n\n\t/*\n\t * if we fail because the command is not found, it is\n\t * OK to return. Otherwise, we just pass along the status code.\n\t */\n\tstatus = run_command_v_opt(argv, RUN_SILENT_EXEC_FAILURE | RUN_CLEAN_ON_EXIT);\n\tif (status >= 0 || errno != ENOENT)\n\t\texit(status);\n\n\targv[0] = tmp;\n\n\tstrbuf_release(&cmd);\n}\n\nstatic int run_argv(int *argcp, const char ***argv)\n{\n\tint done_alias = 0;\n\n\twhile (1) {\n\t\t/* See if it's an internal command */\n\t\thandle_internal_command(*argcp, *argv);\n\n\t\t/* .. then try the external ones */\n\t\texecv_dashed_external(*argv);\n\n\t\t/* It could be an alias -- this works around the insanity\n\t\t * of overriding \"git log\" with \"git show\" by having\n\t\t * alias.log = show\n\t\t */\n\t\tif (done_alias || !handle_alias(argcp, argv))\n\t\t\tbreak;\n\t\tdone_alias = 1;\n\t}\n\n\treturn done_alias;\n}\n\n\nint main(int argc, const char **argv)\n{\n\tconst char *cmd;\n\n\tstartup_info = &git_startup_info;\n\n\tcmd = git_extract_argv0_path(argv[0]);\n\tif (!cmd)\n\t\tcmd = \"git-help\";\n\n\tgit_setup_gettext();\n\n\t/*\n\t * \"git-xxxx\" is the same as \"git xxxx\", but we obviously:\n\t *\n\t * - cannot take flags in between the \"git\" and the \"xxxx\".\n\t * - cannot execute it externally (since it would just do\n\t * the same thing over again)\n\t *\n\t * So we just directly call the internal command handler, and\n\t * die if that one cannot handle it.\n\t */\n\tif (!prefixcmp(cmd, \"git-\")) {\n\t\tcmd += 4;\n\t\targv[0] = cmd;\n\t\thandle_internal_command(argc, argv);\n\t\tdie(\"cannot handle %s internally\", cmd);\n\t}\n\n\t/* Look for flags.. */\n\targv++;\n\targc--;\n\thandle_options(&argv, &argc, NULL);\n\tif (argc > 0) {\n\t\tif (!prefixcmp(argv[0], \"--\"))\n\t\t\targv[0] += 2;\n\t} else {\n\t\t/* The user didn't specify a command; give them help */\n\t\tcommit_pager_choice();\n\t\tprintf(\"usage: %s\\n\\n\", git_usage_string);\n\t\tlist_common_cmds_help();\n\t\tprintf(\"\\n%s\\n\", git_more_info_string);\n\t\texit(1);\n\t}\n\tcmd = argv[0];\n\n\t/*\n\t * We use PATH to find git commands, but we prepend some higher\n\t * precedence paths: the \"--exec-path\" option, the GIT_EXEC_PATH\n\t * environment, and the $(gitexecdir) from the Makefile at build\n\t * time.\n\t */\n\tsetup_path();\n\n\twhile (1) {\n\t\tstatic int done_help = 0;\n\t\tstatic int was_alias = 0;\n\t\twas_alias = run_argv(&argc, &argv);\n\t\tif (errno != ENOENT)\n\t\t\tbreak;\n\t\tif (was_alias) {\n\t\t\tfprintf(stderr, \"Expansion of alias '%s' failed; \"\n\t\t\t\t\"'%s' is not a git command\\n\",\n\t\t\t\tcmd, argv[0]);\n\t\t\texit(1);\n\t\t}\n\t\tif (!done_help) {\n\t\t\tcmd = argv[0] = help_unknown_cmd(cmd);\n\t\t\tdone_help = 1;\n\t\t} else\n\t\t\tbreak;\n\t}\n\n\tfprintf(stderr, \"Failed to run command '%s': %s\\n\",\n\t\tcmd, strerror(errno));\n\n\treturn 1;\n}\n" }, { "path": "src/test/resources/samples/langs/C/hello.c", "content": "#include \n\nint main()\n{\n printf(\"Hello World\\n\");\n return 0;\n}\n" }, { "path": "src/test/resources/samples/langs/C/hello.h", "content": "#ifndef HELLO_H\n#define HELLO_H\n\nvoid hello();\n\n#endif\n" }, { "path": "src/test/resources/samples/langs/C/http_parser.c", "content": "/* Based on src/http/ngx_http_parse.c from NGINX copyright Igor Sysoev\n *\n * Additional changes are licensed under the same terms as NGINX and\n * copyright Joyent, Inc. and other Node contributors. All rights reserved.\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 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n#include \"http_parser.h\"\n#include \n#include \n#include \n#include \n#include \n#include \n\n#ifndef ULLONG_MAX\n# define ULLONG_MAX ((uint64_t) -1) /* 2^64-1 */\n#endif\n\n#ifndef MIN\n# define MIN(a,b) ((a) < (b) ? (a) : (b))\n#endif\n\n\n#if HTTP_PARSER_DEBUG\n#define SET_ERRNO(e) \\\ndo { \\\n parser->http_errno = (e); \\\n parser->error_lineno = __LINE__; \\\n} while (0)\n#else\n#define SET_ERRNO(e) \\\ndo { \\\n parser->http_errno = (e); \\\n} while(0)\n#endif\n\n\n/* Run the notify callback FOR, returning ER if it fails */\n#define CALLBACK_NOTIFY_(FOR, ER) \\\ndo { \\\n assert(HTTP_PARSER_ERRNO(parser) == HPE_OK); \\\n \\\n if (settings->on_##FOR) { \\\n if (0 != settings->on_##FOR(parser)) { \\\n SET_ERRNO(HPE_CB_##FOR); \\\n } \\\n \\\n /* We either errored above or got paused; get out */ \\\n if (HTTP_PARSER_ERRNO(parser) != HPE_OK) { \\\n return (ER); \\\n } \\\n } \\\n} while (0)\n\n/* Run the notify callback FOR and consume the current byte */\n#define CALLBACK_NOTIFY(FOR) CALLBACK_NOTIFY_(FOR, p - data + 1)\n\n/* Run the notify callback FOR and don't consume the current byte */\n#define CALLBACK_NOTIFY_NOADVANCE(FOR) CALLBACK_NOTIFY_(FOR, p - data)\n\n/* Run data callback FOR with LEN bytes, returning ER if it fails */\n#define CALLBACK_DATA_(FOR, LEN, ER) \\\ndo { \\\n assert(HTTP_PARSER_ERRNO(parser) == HPE_OK); \\\n \\\n if (FOR##_mark) { \\\n if (settings->on_##FOR) { \\\n if (0 != settings->on_##FOR(parser, FOR##_mark, (LEN))) { \\\n SET_ERRNO(HPE_CB_##FOR); \\\n } \\\n \\\n /* We either errored above or got paused; get out */ \\\n if (HTTP_PARSER_ERRNO(parser) != HPE_OK) { \\\n return (ER); \\\n } \\\n } \\\n FOR##_mark = NULL; \\\n } \\\n} while (0)\n \n/* Run the data callback FOR and consume the current byte */\n#define CALLBACK_DATA(FOR) \\\n CALLBACK_DATA_(FOR, p - FOR##_mark, p - data + 1)\n\n/* Run the data callback FOR and don't consume the current byte */\n#define CALLBACK_DATA_NOADVANCE(FOR) \\\n CALLBACK_DATA_(FOR, p - FOR##_mark, p - data)\n\n/* Set the mark FOR; non-destructive if mark is already set */\n#define MARK(FOR) \\\ndo { \\\n if (!FOR##_mark) { \\\n FOR##_mark = p; \\\n } \\\n} while (0)\n\n\n#define PROXY_CONNECTION \"proxy-connection\"\n#define CONNECTION \"connection\"\n#define CONTENT_LENGTH \"content-length\"\n#define TRANSFER_ENCODING \"transfer-encoding\"\n#define UPGRADE \"upgrade\"\n#define CHUNKED \"chunked\"\n#define KEEP_ALIVE \"keep-alive\"\n#define CLOSE \"close\"\n\n\nstatic const char *method_strings[] =\n {\n#define XX(num, name, string) #string,\n HTTP_METHOD_MAP(XX)\n#undef XX\n };\n\n\n/* Tokens as defined by rfc 2616. Also lowercases them.\n * token = 1*\n * separators = \"(\" | \")\" | \"<\" | \">\" | \"@\"\n * | \",\" | \";\" | \":\" | \"\\\" | <\">\n * | \"/\" | \"[\" | \"]\" | \"?\" | \"=\"\n * | \"{\" | \"}\" | SP | HT\n */\nstatic const char tokens[256] = {\n/* 0 nul 1 soh 2 stx 3 etx 4 eot 5 enq 6 ack 7 bel */\n 0, 0, 0, 0, 0, 0, 0, 0,\n/* 8 bs 9 ht 10 nl 11 vt 12 np 13 cr 14 so 15 si */\n 0, 0, 0, 0, 0, 0, 0, 0,\n/* 16 dle 17 dc1 18 dc2 19 dc3 20 dc4 21 nak 22 syn 23 etb */\n 0, 0, 0, 0, 0, 0, 0, 0,\n/* 24 can 25 em 26 sub 27 esc 28 fs 29 gs 30 rs 31 us */\n 0, 0, 0, 0, 0, 0, 0, 0,\n/* 32 sp 33 ! 34 \" 35 # 36 $ 37 % 38 & 39 ' */\n 0, '!', 0, '#', '$', '%', '&', '\\'',\n/* 40 ( 41 ) 42 * 43 + 44 , 45 - 46 . 47 / */\n 0, 0, '*', '+', 0, '-', '.', 0,\n/* 48 0 49 1 50 2 51 3 52 4 53 5 54 6 55 7 */\n '0', '1', '2', '3', '4', '5', '6', '7',\n/* 56 8 57 9 58 : 59 ; 60 < 61 = 62 > 63 ? */\n '8', '9', 0, 0, 0, 0, 0, 0,\n/* 64 @ 65 A 66 B 67 C 68 D 69 E 70 F 71 G */\n 0, 'a', 'b', 'c', 'd', 'e', 'f', 'g',\n/* 72 H 73 I 74 J 75 K 76 L 77 M 78 N 79 O */\n 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o',\n/* 80 P 81 Q 82 R 83 S 84 T 85 U 86 V 87 W */\n 'p', 'q', 'r', 's', 't', 'u', 'v', 'w',\n/* 88 X 89 Y 90 Z 91 [ 92 \\ 93 ] 94 ^ 95 _ */\n 'x', 'y', 'z', 0, 0, 0, '^', '_',\n/* 96 ` 97 a 98 b 99 c 100 d 101 e 102 f 103 g */\n '`', 'a', 'b', 'c', 'd', 'e', 'f', 'g',\n/* 104 h 105 i 106 j 107 k 108 l 109 m 110 n 111 o */\n 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o',\n/* 112 p 113 q 114 r 115 s 116 t 117 u 118 v 119 w */\n 'p', 'q', 'r', 's', 't', 'u', 'v', 'w',\n/* 120 x 121 y 122 z 123 { 124 | 125 } 126 ~ 127 del */\n 'x', 'y', 'z', 0, '|', 0, '~', 0 };\n\n\nstatic const int8_t unhex[256] =\n {-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1\n ,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1\n ,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1\n , 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,-1,-1,-1,-1,-1,-1\n ,-1,10,11,12,13,14,15,-1,-1,-1,-1,-1,-1,-1,-1,-1\n ,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1\n ,-1,10,11,12,13,14,15,-1,-1,-1,-1,-1,-1,-1,-1,-1\n ,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1\n };\n\n\n#if HTTP_PARSER_STRICT\n# define T 0\n#else\n# define T 1\n#endif\n\n\nstatic const uint8_t normal_url_char[256] = {\n/* 0 nul 1 soh 2 stx 3 etx 4 eot 5 enq 6 ack 7 bel */\n 0, 0, 0, 0, 0, 0, 0, 0,\n/* 8 bs 9 ht 10 nl 11 vt 12 np 13 cr 14 so 15 si */\n 0, T, 0, 0, T, 0, 0, 0,\n/* 16 dle 17 dc1 18 dc2 19 dc3 20 dc4 21 nak 22 syn 23 etb */\n 0, 0, 0, 0, 0, 0, 0, 0,\n/* 24 can 25 em 26 sub 27 esc 28 fs 29 gs 30 rs 31 us */\n 0, 0, 0, 0, 0, 0, 0, 0,\n/* 32 sp 33 ! 34 \" 35 # 36 $ 37 % 38 & 39 ' */\n 0, 1, 1, 0, 1, 1, 1, 1,\n/* 40 ( 41 ) 42 * 43 + 44 , 45 - 46 . 47 / */\n 1, 1, 1, 1, 1, 1, 1, 1,\n/* 48 0 49 1 50 2 51 3 52 4 53 5 54 6 55 7 */\n 1, 1, 1, 1, 1, 1, 1, 1,\n/* 56 8 57 9 58 : 59 ; 60 < 61 = 62 > 63 ? */\n 1, 1, 1, 1, 1, 1, 1, 0,\n/* 64 @ 65 A 66 B 67 C 68 D 69 E 70 F 71 G */\n 1, 1, 1, 1, 1, 1, 1, 1,\n/* 72 H 73 I 74 J 75 K 76 L 77 M 78 N 79 O */\n 1, 1, 1, 1, 1, 1, 1, 1,\n/* 80 P 81 Q 82 R 83 S 84 T 85 U 86 V 87 W */\n 1, 1, 1, 1, 1, 1, 1, 1,\n/* 88 X 89 Y 90 Z 91 [ 92 \\ 93 ] 94 ^ 95 _ */\n 1, 1, 1, 1, 1, 1, 1, 1,\n/* 96 ` 97 a 98 b 99 c 100 d 101 e 102 f 103 g */\n 1, 1, 1, 1, 1, 1, 1, 1,\n/* 104 h 105 i 106 j 107 k 108 l 109 m 110 n 111 o */\n 1, 1, 1, 1, 1, 1, 1, 1,\n/* 112 p 113 q 114 r 115 s 116 t 117 u 118 v 119 w */\n 1, 1, 1, 1, 1, 1, 1, 1,\n/* 120 x 121 y 122 z 123 { 124 | 125 } 126 ~ 127 del */\n 1, 1, 1, 1, 1, 1, 1, 0, };\n\n#undef T\n\nenum state\n { s_dead = 1 /* important that this is > 0 */\n\n , s_start_req_or_res\n , s_res_or_resp_H\n , s_start_res\n , s_res_H\n , s_res_HT\n , s_res_HTT\n , s_res_HTTP\n , s_res_first_http_major\n , s_res_http_major\n , s_res_first_http_minor\n , s_res_http_minor\n , s_res_first_status_code\n , s_res_status_code\n , s_res_status\n , s_res_line_almost_done\n\n , s_start_req\n\n , s_req_method\n , s_req_spaces_before_url\n , s_req_schema\n , s_req_schema_slash\n , s_req_schema_slash_slash\n , s_req_host_start\n , s_req_host_v6_start\n , s_req_host_v6\n , s_req_host_v6_end\n , s_req_host\n , s_req_port_start\n , s_req_port\n , s_req_path\n , s_req_query_string_start\n , s_req_query_string\n , s_req_fragment_start\n , s_req_fragment\n , s_req_http_start\n , s_req_http_H\n , s_req_http_HT\n , s_req_http_HTT\n , s_req_http_HTTP\n , s_req_first_http_major\n , s_req_http_major\n , s_req_first_http_minor\n , s_req_http_minor\n , s_req_line_almost_done\n\n , s_header_field_start\n , s_header_field\n , s_header_value_start\n , s_header_value\n , s_header_value_lws\n\n , s_header_almost_done\n\n , s_chunk_size_start\n , s_chunk_size\n , s_chunk_parameters\n , s_chunk_size_almost_done\n\n , s_headers_almost_done\n , s_headers_done\n\n /* Important: 's_headers_done' must be the last 'header' state. All\n * states beyond this must be 'body' states. It is used for overflow\n * checking. See the PARSING_HEADER() macro.\n */\n\n , s_chunk_data\n , s_chunk_data_almost_done\n , s_chunk_data_done\n\n , s_body_identity\n , s_body_identity_eof\n\n , s_message_done\n };\n\n\n#define PARSING_HEADER(state) (state <= s_headers_done)\n\n\nenum header_states\n { h_general = 0\n , h_C\n , h_CO\n , h_CON\n\n , h_matching_connection\n , h_matching_proxy_connection\n , h_matching_content_length\n , h_matching_transfer_encoding\n , h_matching_upgrade\n\n , h_connection\n , h_content_length\n , h_transfer_encoding\n , h_upgrade\n\n , h_matching_transfer_encoding_chunked\n , h_matching_connection_keep_alive\n , h_matching_connection_close\n\n , h_transfer_encoding_chunked\n , h_connection_keep_alive\n , h_connection_close\n };\n\n\n/* Macros for character classes; depends on strict-mode */\n#define CR '\\r'\n#define LF '\\n'\n#define LOWER(c) (unsigned char)(c | 0x20)\n#define IS_ALPHA(c) (LOWER(c) >= 'a' && LOWER(c) <= 'z')\n#define IS_NUM(c) ((c) >= '0' && (c) <= '9')\n#define IS_ALPHANUM(c) (IS_ALPHA(c) || IS_NUM(c))\n#define IS_HEX(c) (IS_NUM(c) || (LOWER(c) >= 'a' && LOWER(c) <= 'f'))\n\n#if HTTP_PARSER_STRICT\n#define TOKEN(c) (tokens[(unsigned char)c])\n#define IS_URL_CHAR(c) (normal_url_char[(unsigned char) (c)])\n#define IS_HOST_CHAR(c) (IS_ALPHANUM(c) || (c) == '.' || (c) == '-')\n#else\n#define TOKEN(c) ((c == ' ') ? ' ' : tokens[(unsigned char)c])\n#define IS_URL_CHAR(c) \\\n (normal_url_char[(unsigned char) (c)] || ((c) & 0x80))\n#define IS_HOST_CHAR(c) \\\n (IS_ALPHANUM(c) || (c) == '.' || (c) == '-' || (c) == '_')\n#endif\n\n\n#define start_state (parser->type == HTTP_REQUEST ? s_start_req : s_start_res)\n\n\n#if HTTP_PARSER_STRICT\n# define STRICT_CHECK(cond) \\\ndo { \\\n if (cond) { \\\n SET_ERRNO(HPE_STRICT); \\\n goto error; \\\n } \\\n} while (0)\n# define NEW_MESSAGE() (http_should_keep_alive(parser) ? start_state : s_dead)\n#else\n# define STRICT_CHECK(cond)\n# define NEW_MESSAGE() start_state\n#endif\n\n\n/* Map errno values to strings for human-readable output */\n#define HTTP_STRERROR_GEN(n, s) { \"HPE_\" #n, s },\nstatic struct {\n const char *name;\n const char *description;\n} http_strerror_tab[] = {\n HTTP_ERRNO_MAP(HTTP_STRERROR_GEN)\n};\n#undef HTTP_STRERROR_GEN\n\nint http_message_needs_eof(http_parser *parser);\n\n/* Our URL parser.\n *\n * This is designed to be shared by http_parser_execute() for URL validation,\n * hence it has a state transition + byte-for-byte interface. In addition, it\n * is meant to be embedded in http_parser_parse_url(), which does the dirty\n * work of turning state transitions URL components for its API.\n *\n * This function should only be invoked with non-space characters. It is\n * assumed that the caller cares about (and can detect) the transition between\n * URL and non-URL states by looking for these.\n */\nstatic enum state\nparse_url_char(enum state s, const char ch)\n{\n if (ch == ' ' || ch == '\\r' || ch == '\\n') {\n return s_dead;\n }\n\n#if HTTP_PARSER_STRICT\n if (ch == '\\t' || ch == '\\f') {\n return s_dead;\n }\n#endif\n\n switch (s) {\n case s_req_spaces_before_url:\n /* Proxied requests are followed by scheme of an absolute URI (alpha).\n * All methods except CONNECT are followed by '/' or '*'.\n */\n\n if (ch == '/' || ch == '*') {\n return s_req_path;\n }\n\n if (IS_ALPHA(ch)) {\n return s_req_schema;\n }\n\n break;\n\n case s_req_schema:\n if (IS_ALPHA(ch)) {\n return s;\n }\n\n if (ch == ':') {\n return s_req_schema_slash;\n }\n\n break;\n\n case s_req_schema_slash:\n if (ch == '/') {\n return s_req_schema_slash_slash;\n }\n\n break;\n\n case s_req_schema_slash_slash:\n if (ch == '/') {\n return s_req_host_start;\n }\n\n break;\n\n case s_req_host_start:\n if (ch == '[') {\n return s_req_host_v6_start;\n }\n\n if (IS_HOST_CHAR(ch)) {\n return s_req_host;\n }\n\n break;\n\n case s_req_host:\n if (IS_HOST_CHAR(ch)) {\n return s_req_host;\n }\n\n /* FALLTHROUGH */\n case s_req_host_v6_end:\n switch (ch) {\n case ':':\n return s_req_port_start;\n\n case '/':\n return s_req_path;\n\n case '?':\n return s_req_query_string_start;\n }\n\n break;\n\n case s_req_host_v6:\n if (ch == ']') {\n return s_req_host_v6_end;\n }\n\n /* FALLTHROUGH */\n case s_req_host_v6_start:\n if (IS_HEX(ch) || ch == ':') {\n return s_req_host_v6;\n }\n break;\n\n case s_req_port:\n switch (ch) {\n case '/':\n return s_req_path;\n\n case '?':\n return s_req_query_string_start;\n }\n\n /* FALLTHROUGH */\n case s_req_port_start:\n if (IS_NUM(ch)) {\n return s_req_port;\n }\n\n break;\n\n case s_req_path:\n if (IS_URL_CHAR(ch)) {\n return s;\n }\n\n switch (ch) {\n case '?':\n return s_req_query_string_start;\n\n case '#':\n return s_req_fragment_start;\n }\n\n break;\n\n case s_req_query_string_start:\n case s_req_query_string:\n if (IS_URL_CHAR(ch)) {\n return s_req_query_string;\n }\n\n switch (ch) {\n case '?':\n /* allow extra '?' in query string */\n return s_req_query_string;\n\n case '#':\n return s_req_fragment_start;\n }\n\n break;\n\n case s_req_fragment_start:\n if (IS_URL_CHAR(ch)) {\n return s_req_fragment;\n }\n\n switch (ch) {\n case '?':\n return s_req_fragment;\n\n case '#':\n return s;\n }\n\n break;\n\n case s_req_fragment:\n if (IS_URL_CHAR(ch)) {\n return s;\n }\n\n switch (ch) {\n case '?':\n case '#':\n return s;\n }\n\n break;\n\n default:\n break;\n }\n\n /* We should never fall out of the switch above unless there's an error */\n return s_dead;\n}\n\nsize_t http_parser_execute (http_parser *parser,\n const http_parser_settings *settings,\n const char *data,\n size_t len)\n{\n char c, ch;\n int8_t unhex_val;\n const char *p = data;\n const char *header_field_mark = 0;\n const char *header_value_mark = 0;\n const char *url_mark = 0;\n const char *body_mark = 0;\n\n /* We're in an error state. Don't bother doing anything. */\n if (HTTP_PARSER_ERRNO(parser) != HPE_OK) {\n return 0;\n }\n\n if (len == 0) {\n switch (parser->state) {\n case s_body_identity_eof:\n /* Use of CALLBACK_NOTIFY() here would erroneously return 1 byte read if\n * we got paused.\n */\n CALLBACK_NOTIFY_NOADVANCE(message_complete);\n return 0;\n\n case s_dead:\n case s_start_req_or_res:\n case s_start_res:\n case s_start_req:\n return 0;\n\n default:\n SET_ERRNO(HPE_INVALID_EOF_STATE);\n return 1;\n }\n }\n\n\n if (parser->state == s_header_field)\n header_field_mark = data;\n if (parser->state == s_header_value)\n header_value_mark = data;\n switch (parser->state) {\n case s_req_path:\n case s_req_schema:\n case s_req_schema_slash:\n case s_req_schema_slash_slash:\n case s_req_host_start:\n case s_req_host_v6_start:\n case s_req_host_v6:\n case s_req_host_v6_end:\n case s_req_host:\n case s_req_port_start:\n case s_req_port:\n case s_req_query_string_start:\n case s_req_query_string:\n case s_req_fragment_start:\n case s_req_fragment:\n url_mark = data;\n break;\n }\n\n for (p=data; p != data + len; p++) {\n ch = *p;\n\n if (PARSING_HEADER(parser->state)) {\n ++parser->nread;\n /* Buffer overflow attack */\n if (parser->nread > HTTP_MAX_HEADER_SIZE) {\n SET_ERRNO(HPE_HEADER_OVERFLOW);\n goto error;\n }\n }\n\n reexecute_byte:\n switch (parser->state) {\n\n case s_dead:\n /* this state is used after a 'Connection: close' message\n * the parser will error out if it reads another message\n */\n if (ch == CR || ch == LF)\n break;\n\n SET_ERRNO(HPE_CLOSED_CONNECTION);\n goto error;\n\n case s_start_req_or_res:\n {\n if (ch == CR || ch == LF)\n break;\n parser->flags = 0;\n parser->content_length = ULLONG_MAX;\n\n if (ch == 'H') {\n parser->state = s_res_or_resp_H;\n\n CALLBACK_NOTIFY(message_begin);\n } else {\n parser->type = HTTP_REQUEST;\n parser->state = s_start_req;\n goto reexecute_byte;\n }\n\n break;\n }\n\n case s_res_or_resp_H:\n if (ch == 'T') {\n parser->type = HTTP_RESPONSE;\n parser->state = s_res_HT;\n } else {\n if (ch != 'E') {\n SET_ERRNO(HPE_INVALID_CONSTANT);\n goto error;\n }\n\n parser->type = HTTP_REQUEST;\n parser->method = HTTP_HEAD;\n parser->index = 2;\n parser->state = s_req_method;\n }\n break;\n\n case s_start_res:\n {\n parser->flags = 0;\n parser->content_length = ULLONG_MAX;\n\n switch (ch) {\n case 'H':\n parser->state = s_res_H;\n break;\n\n case CR:\n case LF:\n break;\n\n default:\n SET_ERRNO(HPE_INVALID_CONSTANT);\n goto error;\n }\n\n CALLBACK_NOTIFY(message_begin);\n break;\n }\n\n case s_res_H:\n STRICT_CHECK(ch != 'T');\n parser->state = s_res_HT;\n break;\n\n case s_res_HT:\n STRICT_CHECK(ch != 'T');\n parser->state = s_res_HTT;\n break;\n\n case s_res_HTT:\n STRICT_CHECK(ch != 'P');\n parser->state = s_res_HTTP;\n break;\n\n case s_res_HTTP:\n STRICT_CHECK(ch != '/');\n parser->state = s_res_first_http_major;\n break;\n\n case s_res_first_http_major:\n if (ch < '0' || ch > '9') {\n SET_ERRNO(HPE_INVALID_VERSION);\n goto error;\n }\n\n parser->http_major = ch - '0';\n parser->state = s_res_http_major;\n break;\n\n /* major HTTP version or dot */\n case s_res_http_major:\n {\n if (ch == '.') {\n parser->state = s_res_first_http_minor;\n break;\n }\n\n if (!IS_NUM(ch)) {\n SET_ERRNO(HPE_INVALID_VERSION);\n goto error;\n }\n\n parser->http_major *= 10;\n parser->http_major += ch - '0';\n\n if (parser->http_major > 999) {\n SET_ERRNO(HPE_INVALID_VERSION);\n goto error;\n }\n\n break;\n }\n\n /* first digit of minor HTTP version */\n case s_res_first_http_minor:\n if (!IS_NUM(ch)) {\n SET_ERRNO(HPE_INVALID_VERSION);\n goto error;\n }\n\n parser->http_minor = ch - '0';\n parser->state = s_res_http_minor;\n break;\n\n /* minor HTTP version or end of request line */\n case s_res_http_minor:\n {\n if (ch == ' ') {\n parser->state = s_res_first_status_code;\n break;\n }\n\n if (!IS_NUM(ch)) {\n SET_ERRNO(HPE_INVALID_VERSION);\n goto error;\n }\n\n parser->http_minor *= 10;\n parser->http_minor += ch - '0';\n\n if (parser->http_minor > 999) {\n SET_ERRNO(HPE_INVALID_VERSION);\n goto error;\n }\n\n break;\n }\n\n case s_res_first_status_code:\n {\n if (!IS_NUM(ch)) {\n if (ch == ' ') {\n break;\n }\n\n SET_ERRNO(HPE_INVALID_STATUS);\n goto error;\n }\n parser->status_code = ch - '0';\n parser->state = s_res_status_code;\n break;\n }\n\n case s_res_status_code:\n {\n if (!IS_NUM(ch)) {\n switch (ch) {\n case ' ':\n parser->state = s_res_status;\n break;\n case CR:\n parser->state = s_res_line_almost_done;\n break;\n case LF:\n parser->state = s_header_field_start;\n break;\n default:\n SET_ERRNO(HPE_INVALID_STATUS);\n goto error;\n }\n break;\n }\n\n parser->status_code *= 10;\n parser->status_code += ch - '0';\n\n if (parser->status_code > 999) {\n SET_ERRNO(HPE_INVALID_STATUS);\n goto error;\n }\n\n break;\n }\n\n case s_res_status:\n /* the human readable status. e.g. \"NOT FOUND\"\n * we are not humans so just ignore this */\n if (ch == CR) {\n parser->state = s_res_line_almost_done;\n break;\n }\n\n if (ch == LF) {\n parser->state = s_header_field_start;\n break;\n }\n break;\n\n case s_res_line_almost_done:\n STRICT_CHECK(ch != LF);\n parser->state = s_header_field_start;\n break;\n\n case s_start_req:\n {\n if (ch == CR || ch == LF)\n break;\n parser->flags = 0;\n parser->content_length = ULLONG_MAX;\n\n if (!IS_ALPHA(ch)) {\n SET_ERRNO(HPE_INVALID_METHOD);\n goto error;\n }\n\n parser->method = (enum http_method) 0;\n parser->index = 1;\n switch (ch) {\n case 'C': parser->method = HTTP_CONNECT; /* or COPY, CHECKOUT */ break;\n case 'D': parser->method = HTTP_DELETE; break;\n case 'G': parser->method = HTTP_GET; break;\n case 'H': parser->method = HTTP_HEAD; break;\n case 'L': parser->method = HTTP_LOCK; break;\n case 'M': parser->method = HTTP_MKCOL; /* or MOVE, MKACTIVITY, MERGE, M-SEARCH */ break;\n case 'N': parser->method = HTTP_NOTIFY; break;\n case 'O': parser->method = HTTP_OPTIONS; break;\n case 'P': parser->method = HTTP_POST;\n /* or PROPFIND|PROPPATCH|PUT|PATCH|PURGE */\n break;\n case 'R': parser->method = HTTP_REPORT; break;\n case 'S': parser->method = HTTP_SUBSCRIBE; /* or SEARCH */ break;\n case 'T': parser->method = HTTP_TRACE; break;\n case 'U': parser->method = HTTP_UNLOCK; /* or UNSUBSCRIBE */ break;\n default:\n SET_ERRNO(HPE_INVALID_METHOD);\n goto error;\n }\n parser->state = s_req_method;\n\n CALLBACK_NOTIFY(message_begin);\n\n break;\n }\n\n case s_req_method:\n {\n const char *matcher;\n if (ch == '\\0') {\n SET_ERRNO(HPE_INVALID_METHOD);\n goto error;\n }\n\n matcher = method_strings[parser->method];\n if (ch == ' ' && matcher[parser->index] == '\\0') {\n parser->state = s_req_spaces_before_url;\n } else if (ch == matcher[parser->index]) {\n ; /* nada */\n } else if (parser->method == HTTP_CONNECT) {\n if (parser->index == 1 && ch == 'H') {\n parser->method = HTTP_CHECKOUT;\n } else if (parser->index == 2 && ch == 'P') {\n parser->method = HTTP_COPY;\n } else {\n goto error;\n }\n } else if (parser->method == HTTP_MKCOL) {\n if (parser->index == 1 && ch == 'O') {\n parser->method = HTTP_MOVE;\n } else if (parser->index == 1 && ch == 'E') {\n parser->method = HTTP_MERGE;\n } else if (parser->index == 1 && ch == '-') {\n parser->method = HTTP_MSEARCH;\n } else if (parser->index == 2 && ch == 'A') {\n parser->method = HTTP_MKACTIVITY;\n } else {\n goto error;\n }\n } else if (parser->method == HTTP_SUBSCRIBE) {\n if (parser->index == 1 && ch == 'E') {\n parser->method = HTTP_SEARCH;\n } else {\n goto error;\n }\n } else if (parser->index == 1 && parser->method == HTTP_POST) {\n if (ch == 'R') {\n parser->method = HTTP_PROPFIND; /* or HTTP_PROPPATCH */\n } else if (ch == 'U') {\n parser->method = HTTP_PUT; /* or HTTP_PURGE */\n } else if (ch == 'A') {\n parser->method = HTTP_PATCH;\n } else {\n goto error;\n }\n } else if (parser->index == 2) {\n if (parser->method == HTTP_PUT) {\n if (ch == 'R') parser->method = HTTP_PURGE;\n } else if (parser->method == HTTP_UNLOCK) {\n if (ch == 'S') parser->method = HTTP_UNSUBSCRIBE;\n }\n } else if (parser->index == 4 && parser->method == HTTP_PROPFIND && ch == 'P') {\n parser->method = HTTP_PROPPATCH;\n } else {\n SET_ERRNO(HPE_INVALID_METHOD);\n goto error;\n }\n\n ++parser->index;\n break;\n }\n\n case s_req_spaces_before_url:\n {\n if (ch == ' ') break;\n\n MARK(url);\n if (parser->method == HTTP_CONNECT) {\n parser->state = s_req_host_start;\n }\n\n parser->state = parse_url_char((enum state)parser->state, ch);\n if (parser->state == s_dead) {\n SET_ERRNO(HPE_INVALID_URL);\n goto error;\n }\n\n break;\n }\n\n case s_req_schema:\n case s_req_schema_slash:\n case s_req_schema_slash_slash:\n case s_req_host_start:\n case s_req_host_v6_start:\n case s_req_host_v6:\n case s_req_port_start:\n {\n switch (ch) {\n /* No whitespace allowed here */\n case ' ':\n case CR:\n case LF:\n SET_ERRNO(HPE_INVALID_URL);\n goto error;\n default:\n parser->state = parse_url_char((enum state)parser->state, ch);\n if (parser->state == s_dead) {\n SET_ERRNO(HPE_INVALID_URL);\n goto error;\n }\n }\n\n break;\n }\n\n case s_req_host:\n case s_req_host_v6_end:\n case s_req_port:\n case s_req_path:\n case s_req_query_string_start:\n case s_req_query_string:\n case s_req_fragment_start:\n case s_req_fragment:\n {\n switch (ch) {\n case ' ':\n parser->state = s_req_http_start;\n CALLBACK_DATA(url);\n break;\n case CR:\n case LF:\n parser->http_major = 0;\n parser->http_minor = 9;\n parser->state = (ch == CR) ?\n s_req_line_almost_done :\n s_header_field_start;\n CALLBACK_DATA(url);\n break;\n default:\n parser->state = parse_url_char((enum state)parser->state, ch);\n if (parser->state == s_dead) {\n SET_ERRNO(HPE_INVALID_URL);\n goto error;\n }\n }\n break;\n }\n\n case s_req_http_start:\n switch (ch) {\n case 'H':\n parser->state = s_req_http_H;\n break;\n case ' ':\n break;\n default:\n SET_ERRNO(HPE_INVALID_CONSTANT);\n goto error;\n }\n break;\n\n case s_req_http_H:\n STRICT_CHECK(ch != 'T');\n parser->state = s_req_http_HT;\n break;\n\n case s_req_http_HT:\n STRICT_CHECK(ch != 'T');\n parser->state = s_req_http_HTT;\n break;\n\n case s_req_http_HTT:\n STRICT_CHECK(ch != 'P');\n parser->state = s_req_http_HTTP;\n break;\n\n case s_req_http_HTTP:\n STRICT_CHECK(ch != '/');\n parser->state = s_req_first_http_major;\n break;\n\n /* first digit of major HTTP version */\n case s_req_first_http_major:\n if (ch < '1' || ch > '9') {\n SET_ERRNO(HPE_INVALID_VERSION);\n goto error;\n }\n\n parser->http_major = ch - '0';\n parser->state = s_req_http_major;\n break;\n\n /* major HTTP version or dot */\n case s_req_http_major:\n {\n if (ch == '.') {\n parser->state = s_req_first_http_minor;\n break;\n }\n\n if (!IS_NUM(ch)) {\n SET_ERRNO(HPE_INVALID_VERSION);\n goto error;\n }\n\n parser->http_major *= 10;\n parser->http_major += ch - '0';\n\n if (parser->http_major > 999) {\n SET_ERRNO(HPE_INVALID_VERSION);\n goto error;\n }\n\n break;\n }\n\n /* first digit of minor HTTP version */\n case s_req_first_http_minor:\n if (!IS_NUM(ch)) {\n SET_ERRNO(HPE_INVALID_VERSION);\n goto error;\n }\n\n parser->http_minor = ch - '0';\n parser->state = s_req_http_minor;\n break;\n\n /* minor HTTP version or end of request line */\n case s_req_http_minor:\n {\n if (ch == CR) {\n parser->state = s_req_line_almost_done;\n break;\n }\n\n if (ch == LF) {\n parser->state = s_header_field_start;\n break;\n }\n\n /* XXX allow spaces after digit? */\n\n if (!IS_NUM(ch)) {\n SET_ERRNO(HPE_INVALID_VERSION);\n goto error;\n }\n\n parser->http_minor *= 10;\n parser->http_minor += ch - '0';\n\n if (parser->http_minor > 999) {\n SET_ERRNO(HPE_INVALID_VERSION);\n goto error;\n }\n\n break;\n }\n\n /* end of request line */\n case s_req_line_almost_done:\n {\n if (ch != LF) {\n SET_ERRNO(HPE_LF_EXPECTED);\n goto error;\n }\n\n parser->state = s_header_field_start;\n break;\n }\n\n case s_header_field_start:\n {\n if (ch == CR) {\n parser->state = s_headers_almost_done;\n break;\n }\n\n if (ch == LF) {\n /* they might be just sending \\n instead of \\r\\n so this would be\n * the second \\n to denote the end of headers*/\n parser->state = s_headers_almost_done;\n goto reexecute_byte;\n }\n\n c = TOKEN(ch);\n\n if (!c) {\n SET_ERRNO(HPE_INVALID_HEADER_TOKEN);\n goto error;\n }\n\n MARK(header_field);\n\n parser->index = 0;\n parser->state = s_header_field;\n\n switch (c) {\n case 'c':\n parser->header_state = h_C;\n break;\n\n case 'p':\n parser->header_state = h_matching_proxy_connection;\n break;\n\n case 't':\n parser->header_state = h_matching_transfer_encoding;\n break;\n\n case 'u':\n parser->header_state = h_matching_upgrade;\n break;\n\n default:\n parser->header_state = h_general;\n break;\n }\n break;\n }\n\n case s_header_field:\n {\n c = TOKEN(ch);\n\n if (c) {\n switch (parser->header_state) {\n case h_general:\n break;\n\n case h_C:\n parser->index++;\n parser->header_state = (c == 'o' ? h_CO : h_general);\n break;\n\n case h_CO:\n parser->index++;\n parser->header_state = (c == 'n' ? h_CON : h_general);\n break;\n\n case h_CON:\n parser->index++;\n switch (c) {\n case 'n':\n parser->header_state = h_matching_connection;\n break;\n case 't':\n parser->header_state = h_matching_content_length;\n break;\n default:\n parser->header_state = h_general;\n break;\n }\n break;\n\n /* connection */\n\n case h_matching_connection:\n parser->index++;\n if (parser->index > sizeof(CONNECTION)-1\n || c != CONNECTION[parser->index]) {\n parser->header_state = h_general;\n } else if (parser->index == sizeof(CONNECTION)-2) {\n parser->header_state = h_connection;\n }\n break;\n\n /* proxy-connection */\n\n case h_matching_proxy_connection:\n parser->index++;\n if (parser->index > sizeof(PROXY_CONNECTION)-1\n || c != PROXY_CONNECTION[parser->index]) {\n parser->header_state = h_general;\n } else if (parser->index == sizeof(PROXY_CONNECTION)-2) {\n parser->header_state = h_connection;\n }\n break;\n\n /* content-length */\n\n case h_matching_content_length:\n parser->index++;\n if (parser->index > sizeof(CONTENT_LENGTH)-1\n || c != CONTENT_LENGTH[parser->index]) {\n parser->header_state = h_general;\n } else if (parser->index == sizeof(CONTENT_LENGTH)-2) {\n parser->header_state = h_content_length;\n }\n break;\n\n /* transfer-encoding */\n\n case h_matching_transfer_encoding:\n parser->index++;\n if (parser->index > sizeof(TRANSFER_ENCODING)-1\n || c != TRANSFER_ENCODING[parser->index]) {\n parser->header_state = h_general;\n } else if (parser->index == sizeof(TRANSFER_ENCODING)-2) {\n parser->header_state = h_transfer_encoding;\n }\n break;\n\n /* upgrade */\n\n case h_matching_upgrade:\n parser->index++;\n if (parser->index > sizeof(UPGRADE)-1\n || c != UPGRADE[parser->index]) {\n parser->header_state = h_general;\n } else if (parser->index == sizeof(UPGRADE)-2) {\n parser->header_state = h_upgrade;\n }\n break;\n\n case h_connection:\n case h_content_length:\n case h_transfer_encoding:\n case h_upgrade:\n if (ch != ' ') parser->header_state = h_general;\n break;\n\n default:\n assert(0 && \"Unknown header_state\");\n break;\n }\n break;\n }\n\n if (ch == ':') {\n parser->state = s_header_value_start;\n CALLBACK_DATA(header_field);\n break;\n }\n\n if (ch == CR) {\n parser->state = s_header_almost_done;\n CALLBACK_DATA(header_field);\n break;\n }\n\n if (ch == LF) {\n parser->state = s_header_field_start;\n CALLBACK_DATA(header_field);\n break;\n }\n\n SET_ERRNO(HPE_INVALID_HEADER_TOKEN);\n goto error;\n }\n\n case s_header_value_start:\n {\n if (ch == ' ' || ch == '\\t') break;\n\n MARK(header_value);\n\n parser->state = s_header_value;\n parser->index = 0;\n\n if (ch == CR) {\n parser->header_state = h_general;\n parser->state = s_header_almost_done;\n CALLBACK_DATA(header_value);\n break;\n }\n\n if (ch == LF) {\n parser->state = s_header_field_start;\n CALLBACK_DATA(header_value);\n break;\n }\n\n c = LOWER(ch);\n\n switch (parser->header_state) {\n case h_upgrade:\n parser->flags |= F_UPGRADE;\n parser->header_state = h_general;\n break;\n\n case h_transfer_encoding:\n /* looking for 'Transfer-Encoding: chunked' */\n if ('c' == c) {\n parser->header_state = h_matching_transfer_encoding_chunked;\n } else {\n parser->header_state = h_general;\n }\n break;\n\n case h_content_length:\n if (!IS_NUM(ch)) {\n SET_ERRNO(HPE_INVALID_CONTENT_LENGTH);\n goto error;\n }\n\n parser->content_length = ch - '0';\n break;\n\n case h_connection:\n /* looking for 'Connection: keep-alive' */\n if (c == 'k') {\n parser->header_state = h_matching_connection_keep_alive;\n /* looking for 'Connection: close' */\n } else if (c == 'c') {\n parser->header_state = h_matching_connection_close;\n } else {\n parser->header_state = h_general;\n }\n break;\n\n default:\n parser->header_state = h_general;\n break;\n }\n break;\n }\n\n case s_header_value:\n {\n\n if (ch == CR) {\n parser->state = s_header_almost_done;\n CALLBACK_DATA(header_value);\n break;\n }\n\n if (ch == LF) {\n parser->state = s_header_almost_done;\n CALLBACK_DATA_NOADVANCE(header_value);\n goto reexecute_byte;\n }\n\n c = LOWER(ch);\n\n switch (parser->header_state) {\n case h_general:\n break;\n\n case h_connection:\n case h_transfer_encoding:\n assert(0 && \"Shouldn't get here.\");\n break;\n\n case h_content_length:\n {\n uint64_t t;\n\n if (ch == ' ') break;\n\n if (!IS_NUM(ch)) {\n SET_ERRNO(HPE_INVALID_CONTENT_LENGTH);\n goto error;\n }\n\n t = parser->content_length;\n t *= 10;\n t += ch - '0';\n\n /* Overflow? */\n if (t < parser->content_length || t == ULLONG_MAX) {\n SET_ERRNO(HPE_INVALID_CONTENT_LENGTH);\n goto error;\n }\n\n parser->content_length = t;\n break;\n }\n\n /* Transfer-Encoding: chunked */\n case h_matching_transfer_encoding_chunked:\n parser->index++;\n if (parser->index > sizeof(CHUNKED)-1\n || c != CHUNKED[parser->index]) {\n parser->header_state = h_general;\n } else if (parser->index == sizeof(CHUNKED)-2) {\n parser->header_state = h_transfer_encoding_chunked;\n }\n break;\n\n /* looking for 'Connection: keep-alive' */\n case h_matching_connection_keep_alive:\n parser->index++;\n if (parser->index > sizeof(KEEP_ALIVE)-1\n || c != KEEP_ALIVE[parser->index]) {\n parser->header_state = h_general;\n } else if (parser->index == sizeof(KEEP_ALIVE)-2) {\n parser->header_state = h_connection_keep_alive;\n }\n break;\n\n /* looking for 'Connection: close' */\n case h_matching_connection_close:\n parser->index++;\n if (parser->index > sizeof(CLOSE)-1 || c != CLOSE[parser->index]) {\n parser->header_state = h_general;\n } else if (parser->index == sizeof(CLOSE)-2) {\n parser->header_state = h_connection_close;\n }\n break;\n\n case h_transfer_encoding_chunked:\n case h_connection_keep_alive:\n case h_connection_close:\n if (ch != ' ') parser->header_state = h_general;\n break;\n\n default:\n parser->state = s_header_value;\n parser->header_state = h_general;\n break;\n }\n break;\n }\n\n case s_header_almost_done:\n {\n STRICT_CHECK(ch != LF);\n\n parser->state = s_header_value_lws;\n\n switch (parser->header_state) {\n case h_connection_keep_alive:\n parser->flags |= F_CONNECTION_KEEP_ALIVE;\n break;\n case h_connection_close:\n parser->flags |= F_CONNECTION_CLOSE;\n break;\n case h_transfer_encoding_chunked:\n parser->flags |= F_CHUNKED;\n break;\n default:\n break;\n }\n\n break;\n }\n\n case s_header_value_lws:\n {\n if (ch == ' ' || ch == '\\t')\n parser->state = s_header_value_start;\n else\n {\n parser->state = s_header_field_start;\n goto reexecute_byte;\n }\n break;\n }\n\n case s_headers_almost_done:\n {\n STRICT_CHECK(ch != LF);\n\n if (parser->flags & F_TRAILING) {\n /* End of a chunked request */\n parser->state = NEW_MESSAGE();\n CALLBACK_NOTIFY(message_complete);\n break;\n }\n\n parser->state = s_headers_done;\n\n /* Set this here so that on_headers_complete() callbacks can see it */\n parser->upgrade =\n (parser->flags & F_UPGRADE || parser->method == HTTP_CONNECT);\n\n /* Here we call the headers_complete callback. This is somewhat\n * different than other callbacks because if the user returns 1, we\n * will interpret that as saying that this message has no body. This\n * is needed for the annoying case of recieving a response to a HEAD\n * request.\n *\n * We'd like to use CALLBACK_NOTIFY_NOADVANCE() here but we cannot, so\n * we have to simulate it by handling a change in errno below.\n */\n if (settings->on_headers_complete) {\n switch (settings->on_headers_complete(parser)) {\n case 0:\n break;\n\n case 1:\n parser->flags |= F_SKIPBODY;\n break;\n\n default:\n SET_ERRNO(HPE_CB_headers_complete);\n return p - data; /* Error */\n }\n }\n\n if (HTTP_PARSER_ERRNO(parser) != HPE_OK) {\n return p - data;\n }\n\n goto reexecute_byte;\n }\n\n case s_headers_done:\n {\n STRICT_CHECK(ch != LF);\n\n parser->nread = 0;\n\n /* Exit, the rest of the connect is in a different protocol. */\n if (parser->upgrade) {\n parser->state = NEW_MESSAGE();\n CALLBACK_NOTIFY(message_complete);\n return (p - data) + 1;\n }\n\n if (parser->flags & F_SKIPBODY) {\n parser->state = NEW_MESSAGE();\n CALLBACK_NOTIFY(message_complete);\n } else if (parser->flags & F_CHUNKED) {\n /* chunked encoding - ignore Content-Length header */\n parser->state = s_chunk_size_start;\n } else {\n if (parser->content_length == 0) {\n /* Content-Length header given but zero: Content-Length: 0\\r\\n */\n parser->state = NEW_MESSAGE();\n CALLBACK_NOTIFY(message_complete);\n } else if (parser->content_length != ULLONG_MAX) {\n /* Content-Length header given and non-zero */\n parser->state = s_body_identity;\n } else {\n if (parser->type == HTTP_REQUEST ||\n !http_message_needs_eof(parser)) {\n /* Assume content-length 0 - read the next */\n parser->state = NEW_MESSAGE();\n CALLBACK_NOTIFY(message_complete);\n } else {\n /* Read body until EOF */\n parser->state = s_body_identity_eof;\n }\n }\n }\n\n break;\n }\n\n case s_body_identity:\n {\n uint64_t to_read = MIN(parser->content_length,\n (uint64_t) ((data + len) - p));\n\n assert(parser->content_length != 0\n && parser->content_length != ULLONG_MAX);\n\n /* The difference between advancing content_length and p is because\n * the latter will automaticaly advance on the next loop iteration.\n * Further, if content_length ends up at 0, we want to see the last\n * byte again for our message complete callback.\n */\n MARK(body);\n parser->content_length -= to_read;\n p += to_read - 1;\n\n if (parser->content_length == 0) {\n parser->state = s_message_done;\n\n /* Mimic CALLBACK_DATA_NOADVANCE() but with one extra byte.\n *\n * The alternative to doing this is to wait for the next byte to\n * trigger the data callback, just as in every other case. The\n * problem with this is that this makes it difficult for the test\n * harness to distinguish between complete-on-EOF and\n * complete-on-length. It's not clear that this distinction is\n * important for applications, but let's keep it for now.\n */\n CALLBACK_DATA_(body, p - body_mark + 1, p - data);\n goto reexecute_byte;\n }\n\n break;\n }\n\n /* read until EOF */\n case s_body_identity_eof:\n MARK(body);\n p = data + len - 1;\n\n break;\n\n case s_message_done:\n parser->state = NEW_MESSAGE();\n CALLBACK_NOTIFY(message_complete);\n break;\n\n case s_chunk_size_start:\n {\n assert(parser->nread == 1);\n assert(parser->flags & F_CHUNKED);\n\n unhex_val = unhex[(unsigned char)ch];\n if (unhex_val == -1) {\n SET_ERRNO(HPE_INVALID_CHUNK_SIZE);\n goto error;\n }\n\n parser->content_length = unhex_val;\n parser->state = s_chunk_size;\n break;\n }\n\n case s_chunk_size:\n {\n uint64_t t;\n\n assert(parser->flags & F_CHUNKED);\n\n if (ch == CR) {\n parser->state = s_chunk_size_almost_done;\n break;\n }\n\n unhex_val = unhex[(unsigned char)ch];\n\n if (unhex_val == -1) {\n if (ch == ';' || ch == ' ') {\n parser->state = s_chunk_parameters;\n break;\n }\n\n SET_ERRNO(HPE_INVALID_CHUNK_SIZE);\n goto error;\n }\n\n t = parser->content_length;\n t *= 16;\n t += unhex_val;\n\n /* Overflow? */\n if (t < parser->content_length || t == ULLONG_MAX) {\n SET_ERRNO(HPE_INVALID_CONTENT_LENGTH);\n goto error;\n }\n\n parser->content_length = t;\n break;\n }\n\n case s_chunk_parameters:\n {\n assert(parser->flags & F_CHUNKED);\n /* just ignore this shit. TODO check for overflow */\n if (ch == CR) {\n parser->state = s_chunk_size_almost_done;\n break;\n }\n break;\n }\n\n case s_chunk_size_almost_done:\n {\n assert(parser->flags & F_CHUNKED);\n STRICT_CHECK(ch != LF);\n\n parser->nread = 0;\n\n if (parser->content_length == 0) {\n parser->flags |= F_TRAILING;\n parser->state = s_header_field_start;\n } else {\n parser->state = s_chunk_data;\n }\n break;\n }\n\n case s_chunk_data:\n {\n uint64_t to_read = MIN(parser->content_length,\n (uint64_t) ((data + len) - p));\n\n assert(parser->flags & F_CHUNKED);\n assert(parser->content_length != 0\n && parser->content_length != ULLONG_MAX);\n\n /* See the explanation in s_body_identity for why the content\n * length and data pointers are managed this way.\n */\n MARK(body);\n parser->content_length -= to_read;\n p += to_read - 1;\n\n if (parser->content_length == 0) {\n parser->state = s_chunk_data_almost_done;\n }\n\n break;\n }\n\n case s_chunk_data_almost_done:\n assert(parser->flags & F_CHUNKED);\n assert(parser->content_length == 0);\n STRICT_CHECK(ch != CR);\n parser->state = s_chunk_data_done;\n CALLBACK_DATA(body);\n break;\n\n case s_chunk_data_done:\n assert(parser->flags & F_CHUNKED);\n STRICT_CHECK(ch != LF);\n parser->nread = 0;\n parser->state = s_chunk_size_start;\n break;\n\n default:\n assert(0 && \"unhandled state\");\n SET_ERRNO(HPE_INVALID_INTERNAL_STATE);\n goto error;\n }\n }\n\n /* Run callbacks for any marks that we have leftover after we ran our of\n * bytes. There should be at most one of these set, so it's OK to invoke\n * them in series (unset marks will not result in callbacks).\n *\n * We use the NOADVANCE() variety of callbacks here because 'p' has already\n * overflowed 'data' and this allows us to correct for the off-by-one that\n * we'd otherwise have (since CALLBACK_DATA() is meant to be run with a 'p'\n * value that's in-bounds).\n */\n\n assert(((header_field_mark ? 1 : 0) +\n (header_value_mark ? 1 : 0) +\n (url_mark ? 1 : 0) +\n (body_mark ? 1 : 0)) <= 1);\n\n CALLBACK_DATA_NOADVANCE(header_field);\n CALLBACK_DATA_NOADVANCE(header_value);\n CALLBACK_DATA_NOADVANCE(url);\n CALLBACK_DATA_NOADVANCE(body);\n\n return len;\n\nerror:\n if (HTTP_PARSER_ERRNO(parser) == HPE_OK) {\n SET_ERRNO(HPE_UNKNOWN);\n }\n\n return (p - data);\n}\n\n\n/* Does the parser need to see an EOF to find the end of the message? */\nint\nhttp_message_needs_eof (http_parser *parser)\n{\n if (parser->type == HTTP_REQUEST) {\n return 0;\n }\n\n /* See RFC 2616 section 4.4 */\n if (parser->status_code / 100 == 1 || /* 1xx e.g. Continue */\n parser->status_code == 204 || /* No Content */\n parser->status_code == 304 || /* Not Modified */\n parser->flags & F_SKIPBODY) { /* response to a HEAD request */\n return 0;\n }\n\n if ((parser->flags & F_CHUNKED) || parser->content_length != ULLONG_MAX) {\n return 0;\n }\n\n return 1;\n}\n\n\nint\nhttp_should_keep_alive (http_parser *parser)\n{\n if (parser->http_major > 0 && parser->http_minor > 0) {\n /* HTTP/1.1 */\n if (parser->flags & F_CONNECTION_CLOSE) {\n return 0;\n }\n } else {\n /* HTTP/1.0 or earlier */\n if (!(parser->flags & F_CONNECTION_KEEP_ALIVE)) {\n return 0;\n }\n }\n\n return !http_message_needs_eof(parser);\n}\n\n\nconst char * http_method_str (enum http_method m)\n{\n return method_strings[m];\n}\n\n\nvoid\nhttp_parser_init (http_parser *parser, enum http_parser_type t)\n{\n void *data = parser->data; /* preserve application data */\n memset(parser, 0, sizeof(*parser));\n parser->data = data;\n parser->type = t;\n parser->state = (t == HTTP_REQUEST ? s_start_req : (t == HTTP_RESPONSE ? s_start_res : s_start_req_or_res));\n parser->http_errno = HPE_OK;\n}\n\nconst char *\nhttp_errno_name(enum http_errno err) {\n assert(err < (sizeof(http_strerror_tab)/sizeof(http_strerror_tab[0])));\n return http_strerror_tab[err].name;\n}\n\nconst char *\nhttp_errno_description(enum http_errno err) {\n assert(err < (sizeof(http_strerror_tab)/sizeof(http_strerror_tab[0])));\n return http_strerror_tab[err].description;\n}\n\nint\nhttp_parser_parse_url(const char *buf, size_t buflen, int is_connect,\n struct http_parser_url *u)\n{\n enum state s;\n const char *p;\n enum http_parser_url_fields uf, old_uf;\n\n u->port = u->field_set = 0;\n s = is_connect ? s_req_host_start : s_req_spaces_before_url;\n uf = old_uf = UF_MAX;\n\n for (p = buf; p < buf + buflen; p++) {\n s = parse_url_char(s, *p);\n\n /* Figure out the next field that we're operating on */\n switch (s) {\n case s_dead:\n return 1;\n\n /* Skip delimeters */\n case s_req_schema_slash:\n case s_req_schema_slash_slash:\n case s_req_host_start:\n case s_req_host_v6_start:\n case s_req_host_v6_end:\n case s_req_port_start:\n case s_req_query_string_start:\n case s_req_fragment_start:\n continue;\n\n case s_req_schema:\n uf = UF_SCHEMA;\n break;\n\n case s_req_host:\n case s_req_host_v6:\n uf = UF_HOST;\n break;\n\n case s_req_port:\n uf = UF_PORT;\n break;\n\n case s_req_path:\n uf = UF_PATH;\n break;\n\n case s_req_query_string:\n uf = UF_QUERY;\n break;\n\n case s_req_fragment:\n uf = UF_FRAGMENT;\n break;\n\n default:\n assert(!\"Unexpected state\");\n return 1;\n }\n\n /* Nothing's changed; soldier on */\n if (uf == old_uf) {\n u->field_data[uf].len++;\n continue;\n }\n\n u->field_data[uf].off = p - buf;\n u->field_data[uf].len = 1;\n\n u->field_set |= (1 << uf);\n old_uf = uf;\n }\n\n /* CONNECT requests can only contain \"hostname:port\" */\n if (is_connect && u->field_set != ((1 << UF_HOST)|(1 << UF_PORT))) {\n return 1;\n }\n\n /* Make sure we don't end somewhere unexpected */\n switch (s) {\n case s_req_host_v6_start:\n case s_req_host_v6:\n case s_req_host_v6_end:\n case s_req_host:\n case s_req_port_start:\n return 1;\n default:\n break;\n }\n\n if (u->field_set & (1 << UF_PORT)) {\n /* Don't bother with endp; we've already validated the string */\n unsigned long v = strtoul(buf + u->field_data[UF_PORT].off, NULL, 10);\n\n /* Ports have a max value of 2^16 */\n if (v > 0xffff) {\n return 1;\n }\n\n u->port = (uint16_t) v;\n }\n\n return 0;\n}\n\nvoid\nhttp_parser_pause(http_parser *parser, int paused) {\n /* Users should only be pausing/unpausing a parser that is not in an error\n * state. In non-debug builds, there's not much that we can do about this\n * other than ignore it.\n */\n if (HTTP_PARSER_ERRNO(parser) == HPE_OK ||\n HTTP_PARSER_ERRNO(parser) == HPE_PAUSED) {\n SET_ERRNO((paused) ? HPE_PAUSED : HPE_OK);\n } else {\n assert(0 && \"Attempting to pause parser in error state\");\n }\n}\n" }, { "path": "src/test/resources/samples/langs/C/http_parser.h", "content": "/* Copyright Joyent, Inc. and other Node contributors. All rights reserved.\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 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n#ifndef http_parser_h\n#define http_parser_h\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n#define HTTP_PARSER_VERSION_MAJOR 1\n#define HTTP_PARSER_VERSION_MINOR 0\n\n#include \n#if defined(_WIN32) && !defined(__MINGW32__) && (!defined(_MSC_VER) || _MSC_VER<1600)\ntypedef __int8 int8_t;\ntypedef unsigned __int8 uint8_t;\ntypedef __int16 int16_t;\ntypedef unsigned __int16 uint16_t;\ntypedef __int32 int32_t;\ntypedef unsigned __int32 uint32_t;\ntypedef __int64 int64_t;\ntypedef unsigned __int64 uint64_t;\n\ntypedef unsigned int size_t;\ntypedef int ssize_t;\n#else\n#include \n#endif\n\n/* Compile with -DHTTP_PARSER_STRICT=0 to make less checks, but run\n * faster\n */\n#ifndef HTTP_PARSER_STRICT\n# define HTTP_PARSER_STRICT 1\n#endif\n\n/* Compile with -DHTTP_PARSER_DEBUG=1 to add extra debugging information to\n * the error reporting facility.\n */\n#ifndef HTTP_PARSER_DEBUG\n# define HTTP_PARSER_DEBUG 0\n#endif\n\n\n/* Maximium header size allowed */\n#define HTTP_MAX_HEADER_SIZE (80*1024)\n\n\ntypedef struct http_parser http_parser;\ntypedef struct http_parser_settings http_parser_settings;\n\n\n/* Callbacks should return non-zero to indicate an error. The parser will\n * then halt execution.\n *\n * The one exception is on_headers_complete. In a HTTP_RESPONSE parser\n * returning '1' from on_headers_complete will tell the parser that it\n * should not expect a body. This is used when receiving a response to a\n * HEAD request which may contain 'Content-Length' or 'Transfer-Encoding:\n * chunked' headers that indicate the presence of a body.\n *\n * http_data_cb does not return data chunks. It will be call arbitrarally\n * many times for each string. E.G. you might get 10 callbacks for \"on_path\"\n * each providing just a few characters more data.\n */\ntypedef int (*http_data_cb) (http_parser*, const char *at, size_t length);\ntypedef int (*http_cb) (http_parser*);\n\n\n/* Request Methods */\n#define HTTP_METHOD_MAP(XX) \\\n XX(0, DELETE, DELETE) \\\n XX(1, GET, GET) \\\n XX(2, HEAD, HEAD) \\\n XX(3, POST, POST) \\\n XX(4, PUT, PUT) \\\n /* pathological */ \\\n XX(5, CONNECT, CONNECT) \\\n XX(6, OPTIONS, OPTIONS) \\\n XX(7, TRACE, TRACE) \\\n /* webdav */ \\\n XX(8, COPY, COPY) \\\n XX(9, LOCK, LOCK) \\\n XX(10, MKCOL, MKCOL) \\\n XX(11, MOVE, MOVE) \\\n XX(12, PROPFIND, PROPFIND) \\\n XX(13, PROPPATCH, PROPPATCH) \\\n XX(14, SEARCH, SEARCH) \\\n XX(15, UNLOCK, UNLOCK) \\\n /* subversion */ \\\n XX(16, REPORT, REPORT) \\\n XX(17, MKACTIVITY, MKACTIVITY) \\\n XX(18, CHECKOUT, CHECKOUT) \\\n XX(19, MERGE, MERGE) \\\n /* upnp */ \\\n XX(20, MSEARCH, M-SEARCH) \\\n XX(21, NOTIFY, NOTIFY) \\\n XX(22, SUBSCRIBE, SUBSCRIBE) \\\n XX(23, UNSUBSCRIBE, UNSUBSCRIBE) \\\n /* RFC-5789 */ \\\n XX(24, PATCH, PATCH) \\\n XX(25, PURGE, PURGE) \\\n\nenum http_method\n {\n#define XX(num, name, string) HTTP_##name = num,\n HTTP_METHOD_MAP(XX)\n#undef XX\n };\n\n\nenum http_parser_type { HTTP_REQUEST, HTTP_RESPONSE, HTTP_BOTH };\n\n\n/* Flag values for http_parser.flags field */\nenum flags\n { F_CHUNKED = 1 << 0\n , F_CONNECTION_KEEP_ALIVE = 1 << 1\n , F_CONNECTION_CLOSE = 1 << 2\n , F_TRAILING = 1 << 3\n , F_UPGRADE = 1 << 4\n , F_SKIPBODY = 1 << 5\n };\n\n\n/* Map for errno-related constants\n * \n * The provided argument should be a macro that takes 2 arguments.\n */\n#define HTTP_ERRNO_MAP(XX) \\\n /* No error */ \\\n XX(OK, \"success\") \\\n \\\n /* Callback-related errors */ \\\n XX(CB_message_begin, \"the on_message_begin callback failed\") \\\n XX(CB_url, \"the on_url callback failed\") \\\n XX(CB_header_field, \"the on_header_field callback failed\") \\\n XX(CB_header_value, \"the on_header_value callback failed\") \\\n XX(CB_headers_complete, \"the on_headers_complete callback failed\") \\\n XX(CB_body, \"the on_body callback failed\") \\\n XX(CB_message_complete, \"the on_message_complete callback failed\") \\\n \\\n /* Parsing-related errors */ \\\n XX(INVALID_EOF_STATE, \"stream ended at an unexpected time\") \\\n XX(HEADER_OVERFLOW, \\\n \"too many header bytes seen; overflow detected\") \\\n XX(CLOSED_CONNECTION, \\\n \"data received after completed connection: close message\") \\\n XX(INVALID_VERSION, \"invalid HTTP version\") \\\n XX(INVALID_STATUS, \"invalid HTTP status code\") \\\n XX(INVALID_METHOD, \"invalid HTTP method\") \\\n XX(INVALID_URL, \"invalid URL\") \\\n XX(INVALID_HOST, \"invalid host\") \\\n XX(INVALID_PORT, \"invalid port\") \\\n XX(INVALID_PATH, \"invalid path\") \\\n XX(INVALID_QUERY_STRING, \"invalid query string\") \\\n XX(INVALID_FRAGMENT, \"invalid fragment\") \\\n XX(LF_EXPECTED, \"LF character expected\") \\\n XX(INVALID_HEADER_TOKEN, \"invalid character in header\") \\\n XX(INVALID_CONTENT_LENGTH, \\\n \"invalid character in content-length header\") \\\n XX(INVALID_CHUNK_SIZE, \\\n \"invalid character in chunk size header\") \\\n XX(INVALID_CONSTANT, \"invalid constant string\") \\\n XX(INVALID_INTERNAL_STATE, \"encountered unexpected internal state\")\\\n XX(STRICT, \"strict mode assertion failed\") \\\n XX(PAUSED, \"parser is paused\") \\\n XX(UNKNOWN, \"an unknown error occurred\")\n\n\n/* Define HPE_* values for each errno value above */\n#define HTTP_ERRNO_GEN(n, s) HPE_##n,\nenum http_errno {\n HTTP_ERRNO_MAP(HTTP_ERRNO_GEN)\n};\n#undef HTTP_ERRNO_GEN\n\n\n/* Get an http_errno value from an http_parser */\n#define HTTP_PARSER_ERRNO(p) ((enum http_errno) (p)->http_errno)\n\n/* Get the line number that generated the current error */\n#if HTTP_PARSER_DEBUG\n#define HTTP_PARSER_ERRNO_LINE(p) ((p)->error_lineno)\n#else\n#define HTTP_PARSER_ERRNO_LINE(p) 0\n#endif\n\n\nstruct http_parser {\n /** PRIVATE **/\n unsigned char type : 2; /* enum http_parser_type */\n unsigned char flags : 6; /* F_* values from 'flags' enum; semi-public */\n unsigned char state; /* enum state from http_parser.c */\n unsigned char header_state; /* enum header_state from http_parser.c */\n unsigned char index; /* index into current matcher */\n\n uint32_t nread; /* # bytes read in various scenarios */\n uint64_t content_length; /* # bytes in body (0 if no Content-Length header) */\n\n /** READ-ONLY **/\n unsigned short http_major;\n unsigned short http_minor;\n unsigned short status_code; /* responses only */\n unsigned char method; /* requests only */\n unsigned char http_errno : 7;\n\n /* 1 = Upgrade header was present and the parser has exited because of that.\n * 0 = No upgrade header present.\n * Should be checked when http_parser_execute() returns in addition to\n * error checking.\n */\n unsigned char upgrade : 1;\n\n#if HTTP_PARSER_DEBUG\n uint32_t error_lineno;\n#endif\n\n /** PUBLIC **/\n void *data; /* A pointer to get hook to the \"connection\" or \"socket\" object */\n};\n\n\nstruct http_parser_settings {\n http_cb on_message_begin;\n http_data_cb on_url;\n http_data_cb on_header_field;\n http_data_cb on_header_value;\n http_cb on_headers_complete;\n http_data_cb on_body;\n http_cb on_message_complete;\n};\n\n\nenum http_parser_url_fields\n { UF_SCHEMA = 0\n , UF_HOST = 1\n , UF_PORT = 2\n , UF_PATH = 3\n , UF_QUERY = 4\n , UF_FRAGMENT = 5\n , UF_MAX = 6\n };\n\n\n/* Result structure for http_parser_parse_url().\n *\n * Callers should index into field_data[] with UF_* values iff field_set\n * has the relevant (1 << UF_*) bit set. As a courtesy to clients (and\n * because we probably have padding left over), we convert any port to\n * a uint16_t.\n */\nstruct http_parser_url {\n uint16_t field_set; /* Bitmask of (1 << UF_*) values */\n uint16_t port; /* Converted UF_PORT string */\n\n struct {\n uint16_t off; /* Offset into buffer in which field starts */\n uint16_t len; /* Length of run in buffer */\n } field_data[UF_MAX];\n};\n\n\nvoid http_parser_init(http_parser *parser, enum http_parser_type type);\n\n\nsize_t http_parser_execute(http_parser *parser,\n const http_parser_settings *settings,\n const char *data,\n size_t len);\n\n\n/* If http_should_keep_alive() in the on_headers_complete or\n * on_message_complete callback returns true, then this will be should be\n * the last message on the connection.\n * If you are the server, respond with the \"Connection: close\" header.\n * If you are the client, close the connection.\n */\nint http_should_keep_alive(http_parser *parser);\n\n/* Returns a string version of the HTTP method. */\nconst char *http_method_str(enum http_method m);\n\n/* Return a string name of the given error */\nconst char *http_errno_name(enum http_errno err);\n\n/* Return a string description of the given error */\nconst char *http_errno_description(enum http_errno err);\n\n/* Parse a URL; return nonzero on failure */\nint http_parser_parse_url(const char *buf, size_t buflen,\n int is_connect,\n struct http_parser_url *u);\n\n/* Pause or un-pause the parser; a nonzero value pauses */\nvoid http_parser_pause(http_parser *parser, int paused);\n\n#ifdef __cplusplus\n}\n#endif\n#endif\n" }, { "path": "src/test/resources/samples/langs/C/info.h", "content": "#pragma once\n\n/* Copyright © 2011 Fritz Grimpen\n *\n * This file is part of Xelix.\n *\n * Xelix 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 * Xelix 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 Xelix. If not, see .\n */\n\n#include \n#include \n\ntypedef struct {\n\tuint32_t cursor_x;\n\tuint32_t cursor_y;\n\n\tuint32_t rows;\n\tuint32_t columns;\n\n\tuint32_t tabstop;\n\n\tconsole_color_t default_color;\n\tconsole_color_t current_color;\n\n\tuint8_t nonblocking;\n\tuint8_t reverse_video;\n\tuint8_t bold;\n\tuint8_t blink;\n\tuint8_t underline;\n\tuint8_t newline_mode;\n\tuint8_t auto_echo;\n\tuint8_t handle_backspace;\n} console_info_t;\n" }, { "path": "src/test/resources/samples/langs/C/interface.h", "content": "#pragma once\n\n/* Copyright © 2011 Fritz Grimpen\n *\n * This file is part of Xelix.\n *\n * Xelix 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 * Xelix 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 Xelix. If not, see .\n */\n\n#include \n#include \n#include \n#include \n\ntypedef struct {\n\tconsole_info_t info;\n\n\tconsole_filter_t* input_filter;\n\tconsole_filter_t* output_filter;\n\n\tconsole_driver_t* input_driver;\n\tconsole_driver_t* output_driver;\n} console_t;\n\nconsole_t* default_console;\n\n// Generate raw console, connected to the Display, Keyboard and the\n// ECMA-48-Filter\nvoid console_init();\n\nsize_t console_write(console_t* console, const char* buffer, int32_t length);\n#define console_write2(console, buffer) console_write(console, buffer, strlen(buffer))\nsize_t console_read(console_t* console, char* buffer, size_t length);\nsize_t console_scroll(console_t* console, int32_t pages);\n\nvoid console_clear(console_t* console);\n" }, { "path": "src/test/resources/samples/langs/C/ip4.h", "content": "#pragma once\n\n/* Copyright © 2011 Lukas Martini\n *\n * This file is part of Xelix.\n *\n * Xelix 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 * Xelix 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 Xelix. If not, see .\n */\n\n#include \n#include \n\n#define IP4_TOS_ICMP 0\n\ntypedef uint32_t ip4_addr_t;\n\ntypedef struct {\n\tunsigned int hl:4; /* both fields are 4 bits */\n\tunsigned int version:4;\n\tuint8_t\ttos;\n\tuint16_t len;\n\tuint16_t id;\n\tuint16_t off;\n\tuint8_t ttl;\n\tuint8_t p;\n\tuint16_t checksum;\n\tip4_addr_t src;\n\tip4_addr_t dst;\n} ip4_header_t;\n\ntypedef struct {\n\tuint8_t type;\n\tuint8_t code;\n\tuint16_t checksum;\n\tuint16_t id;\n\tuint16_t sequence;\n} ip4_icmp_header_t;\n\nvoid ip4_receive(net_device_t* origin, net_l2proto_t proto, size_t size, void* raw);\n" }, { "path": "src/test/resources/samples/langs/C/jni_layer.h", "content": "/* DO NOT EDIT THIS FILE - it is machine generated */\n#include \n/* Header for class jni_JniLayer */\n\n#ifndef _Included_jni_JniLayer\n#define _Included_jni_JniLayer\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n/*\n * Class: jni_JniLayer\n * Method: jni_layer_initialize\n * Signature: ([II)J\n */\nJNIEXPORT jlong JNICALL Java_jni_JniLayer_jni_1layer_1initialize\n (JNIEnv *, jobject, jintArray, jint, jint);\n\n/*\n * Class: jni_JniLayer\n * Method: jni_layer_mainloop\n * Signature: (J)V\n */\nJNIEXPORT void JNICALL Java_jni_JniLayer_jni_1layer_1mainloop\n (JNIEnv *, jobject, jlong);\n\n/*\n * Class: jni_JniLayer\n * Method: jni_layer_set_button\n * Signature: (JII)V\n */\nJNIEXPORT void JNICALL Java_jni_JniLayer_jni_1layer_1set_1button\n (JNIEnv *, jobject, jlong, jint, jint);\n\n/*\n * Class: jni_JniLayer\n * Method: jni_layer_set_analog\n * Signature: (JIIF)V\n */\nJNIEXPORT void JNICALL Java_jni_JniLayer_jni_1layer_1set_1analog\n (JNIEnv *, jobject, jlong, jint, jint, jfloat);\n\n/*\n * Class: jni_JniLayer\n * Method: jni_layer_report_analog_chg\n * Signature: (JI)V\n */\nJNIEXPORT void JNICALL Java_jni_JniLayer_jni_1layer_1report_1analog_1chg\n (JNIEnv *, jobject, jlong, jint);\n\n/*\n * Class: jni_JniLayer\n * Method: jni_layer_kill\n * Signature: (J)V\n */\nJNIEXPORT void JNICALL Java_jni_JniLayer_jni_1layer_1kill\n (JNIEnv *, jobject, jlong);\n\n#ifdef __cplusplus\n}\n#endif\n#endif\n" }, { "path": "src/test/resources/samples/langs/C/main.c", "content": "// Copyright 2014 the V8 project authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\n#include \"src/runtime/runtime-utils.h\"\n\n#include \"src/arguments.h\"\n#include \"src/compiler.h\"\n#include \"src/deoptimizer.h\"\n#include \"src/frames-inl.h\"\n#include \"src/full-codegen/full-codegen.h\"\n#include \"src/isolate-inl.h\"\n#include \"src/messages.h\"\n#include \"src/v8threads.h\"\n#include \"src/vm-state-inl.h\"\n\nnamespace v8 {\nnamespace internal {\n\nRUNTIME_FUNCTION(Runtime_CompileLazy) {\n\tHandleScope scope(isolate);\n\tDCHECK_EQ(1, args.length());\n\tCONVERT_ARG_HANDLE_CHECKED(JSFunction, function, 0);\n\n#ifdef DEBUG\n\tif (FLAG_trace_lazy && !function->shared()->is_compiled()) {\n\t\tPrintF(\"[unoptimized: \");\n\t\tfunction->PrintName();\n\t\tPrintF(\"]\\n\");\n\t}\n#endif\n\n\tStackLimitCheck check(isolate);\n\tif (check.JsHasOverflowed(1 * KB)) return isolate->StackOverflow();\n\tif (!Compiler::Compile(function, Compiler::KEEP_EXCEPTION)) {\n\t\treturn isolate->heap()->exception();\n\t}\n\tDCHECK(function->is_compiled());\n\treturn function->code();\n}\n\nRUNTIME_FUNCTION(Runtime_CompileBaseline) {\n\tHandleScope scope(isolate);\n\tDCHECK_EQ(1, args.length());\n\tCONVERT_ARG_HANDLE_CHECKED(JSFunction, function, 0);\n\tStackLimitCheck check(isolate);\n\tif (check.JsHasOverflowed(1 * KB)) return isolate->StackOverflow();\n\tif (!Compiler::CompileBaseline(function)) {\n\t\treturn isolate->heap()->exception();\n\t}\n\tDCHECK(function->is_compiled());\n\treturn function->code();\n}\n\nRUNTIME_FUNCTION(Runtime_CompileOptimized_Concurrent) {\n\tHandleScope scope(isolate);\n\tDCHECK_EQ(1, args.length());\n\tCONVERT_ARG_HANDLE_CHECKED(JSFunction, function, 0);\n\tStackLimitCheck check(isolate);\n\tif (check.JsHasOverflowed(1 * KB)) return isolate->StackOverflow();\n\tif (!Compiler::CompileOptimized(function, Compiler::CONCURRENT)) {\n\t\treturn isolate->heap()->exception();\n\t}\n\tDCHECK(function->is_compiled());\n\treturn function->code();\n}\n\n\nRUNTIME_FUNCTION(Runtime_CompileOptimized_NotConcurrent) {\n\tHandleScope scope(isolate);\n\tDCHECK_EQ(1, args.length());\n\tCONVERT_ARG_HANDLE_CHECKED(JSFunction, function, 0);\n\tStackLimitCheck check(isolate);\n\tif (check.JsHasOverflowed(1 * KB)) return isolate->StackOverflow();\n\tif (!Compiler::CompileOptimized(function, Compiler::NOT_CONCURRENT)) {\n\t\treturn isolate->heap()->exception();\n\t}\n\tDCHECK(function->is_compiled());\n\treturn function->code();\n}\n\n\nRUNTIME_FUNCTION(Runtime_NotifyStubFailure) {\n\tHandleScope scope(isolate);\n\tDCHECK(args.length() == 0);\n\tDeoptimizer* deoptimizer = Deoptimizer::Grab(isolate);\n\tDCHECK(AllowHeapAllocation::IsAllowed());\n\tdelete deoptimizer;\n\treturn isolate->heap()->undefined_value();\n}\n\n\nclass ActivationsFinder : public ThreadVisitor {\npublic:\n\tCode* code_;\n\tbool has_code_activations_;\n\n\texplicit ActivationsFinder(Code* code)\n\t\t: code_(code), has_code_activations_(false) {}\n\n\tvoid VisitThread(Isolate* isolate, ThreadLocalTop* top) {\n\t\tJavaScriptFrameIterator it(isolate, top);\n\t\tVisitFrames(&it);\n\t}\n\n\tvoid VisitFrames(JavaScriptFrameIterator* it) {\n\t\tfor (; !it->done(); it->Advance()) {\n\t\t\tJavaScriptFrame* frame = it->frame();\n\t\t\tif (code_->contains(frame->pc())) has_code_activations_ = true;\n\t\t}\n\t}\n};\n\n\nRUNTIME_FUNCTION(Runtime_NotifyDeoptimized) {\n\tHandleScope scope(isolate);\n\tDCHECK(args.length() == 1);\n\tCONVERT_SMI_ARG_CHECKED(type_arg, 0);\n\tDeoptimizer::BailoutType type =\n\t\tstatic_cast(type_arg);\n\tDeoptimizer* deoptimizer = Deoptimizer::Grab(isolate);\n\tDCHECK(AllowHeapAllocation::IsAllowed());\n\tTimerEventScope timer(isolate);\n\tTRACE_EVENT0(\"v8\", \"V8.DeoptimizeCode\");\n\n\tHandle function = deoptimizer->function();\n\tHandle optimized_code = deoptimizer->compiled_code();\n\n\tDCHECK(optimized_code->kind() == Code::OPTIMIZED_FUNCTION);\n\tDCHECK(type == deoptimizer->bailout_type());\n\n\t// Make sure to materialize objects before causing any allocation.\n\tJavaScriptFrameIterator it(isolate);\n\tdeoptimizer->MaterializeHeapObjects(&it);\n\tdelete deoptimizer;\n\n\t// Ensure the context register is updated for materialized objects.\n\tJavaScriptFrameIterator top_it(isolate);\n\tJavaScriptFrame* top_frame = top_it.frame();\n\tisolate->set_context(Context::cast(top_frame->context()));\n\n\tif (type == Deoptimizer::LAZY) {\n\t\treturn isolate->heap()->undefined_value();\n\t}\n\n\t// Search for other activations of the same optimized code.\n\t// At this point {it} is at the topmost frame of all the frames materialized\n\t// by the deoptimizer. Note that this frame does not necessarily represent\n\t// an activation of {function} because of potential inlined tail-calls.\n\tActivationsFinder activations_finder(*optimized_code);\n\tactivations_finder.VisitFrames(&it);\n\tisolate->thread_manager()->IterateArchivedThreads(&activations_finder);\n\n\tif (!activations_finder.has_code_activations_) {\n\t\tif (function->code() == *optimized_code) {\n\t\t\tif (FLAG_trace_deopt) {\n\t\t\t\tPrintF(\"[removing optimized code for: \");\n\t\t\t\tfunction->PrintName();\n\t\t\t\tPrintF(\"]\\n\");\n\t\t\t}\n\t\t\tfunction->ReplaceCode(function->shared()->code());\n\t\t}\n\t\t// Evict optimized code for this function from the cache so that it\n\t\t// doesn't get used for new closures.\n\t\tfunction->shared()->EvictFromOptimizedCodeMap(*optimized_code, \"notify deoptimized\");\n\t} else {\n\t\t// TODO(titzer): we should probably do DeoptimizeCodeList(code)\n\t\t// unconditionally if the code is not already marked for deoptimization.\n\t\t// If there is an index by shared function info, all the better.\n\t\tDeoptimizer::DeoptimizeFunction(*function);\n\t}\n\n\treturn isolate->heap()->undefined_value();\n}\n\n\nstatic bool IsSuitableForOnStackReplacement(\n\tIsolate* isolate,\n\tHandle function\n) {\n\t// Keep track of whether we've succeeded in optimizing.\n\tif (function->shared()->optimization_disabled()) return false;\n\t// If we are trying to do OSR when there are already optimized\n\t// activations of the function, it means (a) the function is directly or\n\t// indirectly recursive and (b) an optimized invocation has been\n\t// deoptimized so that we are currently in an unoptimized activation.\n\t// Check for optimized activations of this function.\n\tfor (JavaScriptFrameIterator it(isolate); !it.done(); it.Advance()) {\n\t\tJavaScriptFrame* frame = it.frame();\n\t\tif (frame->is_optimized() && frame->function() == *function) return false;\n\t}\n\n\treturn true;\n}\n\n\nRUNTIME_FUNCTION(Runtime_CompileForOnStackReplacement) {\n\tHandleScope scope(isolate);\n\tDCHECK(args.length() == 1);\n\tCONVERT_ARG_HANDLE_CHECKED(JSFunction, function, 0);\n\tHandle caller_code(function->shared()->code());\n\n\t// We're not prepared to handle a function with arguments object.\n\tDCHECK(!function->shared()->uses_arguments());\n\n\tRUNTIME_ASSERT(FLAG_use_osr);\n\n\t// Passing the PC in the javascript frame from the caller directly is\n\t// not GC safe, so we walk the stack to get it.\n\tJavaScriptFrameIterator it(isolate);\n\tJavaScriptFrame* frame = it.frame();\n\tif (!caller_code->contains(frame->pc())) {\n\t\t// Code on the stack may not be the code object referenced by the shared\n\t\t// function info.\tIt may have been replaced to include deoptimization data.\n\t\tcaller_code = Handle(frame->LookupCode());\n\t}\n\n\tuint32_t pc_offset =\n\t\tstatic_cast(frame->pc() - caller_code->instruction_start());\n\n#ifdef DEBUG\n\tDCHECK_EQ(frame->function(), *function);\n\tDCHECK_EQ(frame->LookupCode(), *caller_code);\n\tDCHECK(caller_code->contains(frame->pc()));\n#endif\t// DEBUG\n\n\tBailoutId ast_id = caller_code->TranslatePcOffsetToAstId(pc_offset);\n\tDCHECK(!ast_id.IsNone());\n\n\tMaybeHandle maybe_result;\n\tif (IsSuitableForOnStackReplacement(isolate, function)) {\n\t\tif (FLAG_trace_osr) {\n\t\t\tPrintF(\"[OSR - Compiling: \");\n\t\t\tfunction->PrintName();\n\t\t\tPrintF(\" at -*- scheme -*- %d]\\n\", ast_id.ToInt());\n\t\t}\n\t\tmaybe_result = Compiler::GetOptimizedCodeForOSR(function, ast_id, frame);\n\t}\n\n\t// Revert the patched back edge table, regardless of whether OSR succeeds.\n\tBackEdgeTable::Revert(isolate, *caller_code);\n\n\t// Check whether we ended up with usable optimized code.\n\tHandle result;\n\tif (maybe_result.ToHandle(&result)\n\t&& result->kind() == Code::OPTIMIZED_FUNCTION) {\n\t\tDeoptimizationInputData* data =\n\t\t\tDeoptimizationInputData::cast(result->deoptimization_data());\n\t\t\n\t\tif (data->OsrPcOffset()->value() >= 0) {\n\t\t\tDCHECK(BailoutId(data->OsrAstId()->value()) == ast_id);\n\t\t\tif (FLAG_trace_osr) {\n\t\t\t\tPrintF(\"[OSR - Entry at AST id %d, offset %d in optimized code]\\n\",\n\t\t\t\t\tast_id.ToInt(), data->OsrPcOffset()->value());\n\t\t\t}\n\t\t\t// TODO(titzer): this is a massive hack to make the deopt counts\n\t\t\t// match. Fix heuristics for reenabling optimizations!\n\t\t\tfunction->shared()->increment_deopt_count();\n\n\t\t\tif (result->is_turbofanned()) {\n\t\t\t\t// TurboFanned OSR code cannot be installed into the function.\n\t\t\t\t// But the function is obviously hot, so optimize it next time.\n\t\t\t\tfunction->ReplaceCode(\n\t\t\t\t\tisolate->builtins()->builtin(Builtins::kCompileOptimized));\n\t\t\t} else {\n\t\t\t\t// Crankshafted OSR code can be installed into the function.\n\t\t\t\tfunction->ReplaceCode(*result);\n\t\t\t}\n\t\t\treturn *result;\n\t\t}\n\t}\n\n\t// Failed.\n\tif (FLAG_trace_osr) {\n\t\tPrintF(\"[OSR - Failed: \");\n\t\tfunction->PrintName();\n\t\tPrintF(\" at AST id %d]\\n\", ast_id.ToInt());\n\t}\n\n\tif (!function->IsOptimized()) {\n\t\tfunction->ReplaceCode(function->shared()->code());\n\t}\n\treturn NULL;\n}\n\n\nRUNTIME_FUNCTION(Runtime_TryInstallOptimizedCode) {\n\tHandleScope scope(isolate);\n\tDCHECK(args.length() == 1);\n\tCONVERT_ARG_HANDLE_CHECKED(JSFunction, function, 0);\n\n\t// First check if this is a real stack overflow.\n\tStackLimitCheck check(isolate);\n\tif (check.JsHasOverflowed()) {\n\t\tSealHandleScope shs(isolate);\n\t\treturn isolate->StackOverflow();\n\t}\n\n\tisolate->optimizing_compile_dispatcher()->InstallOptimizedFunctions();\n\treturn (function->IsOptimized())\n\t\t? function->code()\n\t\t: function->shared()->code();\n}\n\n\nbool CodeGenerationFromStringsAllowed(\n\tIsolate* isolate,\n\tHandle context\n){\n\tDCHECK(context->allow_code_gen_from_strings()->IsFalse());\n\t// Check with callback if set.\n\tAllowCodeGenerationFromStringsCallback callback =\n\t\t\tisolate->allow_code_gen_callback();\n\tif (callback == NULL) {\n\t\t// No callback set and code generation disallowed.\n\t\treturn false;\n\t} else {\n\t\t// Callback set. Let it decide if code generation is allowed.\n\t\tVMState state(isolate);\n\t\treturn callback(v8::Utils::ToLocal(context));\n\t}\n}\n\nstatic Object* CompileGlobalEval(\n\tIsolate* isolate,\n\tHandle source,\n\tHandle outer_info,\n\tLanguageMode language_mode,\n\tint eval_scope_position,\n\tint eval_position\n){\n\tHandle context = Handle(isolate->context());\n\tHandle native_context = Handle(context->native_context());\n\n\t// Check if native context allows code generation from\n\t// strings. Throw an exception if it doesn't.\n\tif (native_context->allow_code_gen_from_strings()->IsFalse() &&\n\t!CodeGenerationFromStringsAllowed(isolate, native_context)) {\n\t\tHandle error_message =\n\t\t\t\tnative_context->ErrorMessageForCodeGenerationFromStrings();\n\t\tHandle error;\n\t\tMaybeHandle maybe_error = isolate->factory()->NewEvalError(\n\t\t\t\tMessageTemplate::kCodeGenFromStrings, error_message);\n\t\tif (maybe_error.ToHandle(&error)) isolate->Throw(*error);\n\t\treturn isolate->heap()->exception();\n\t}\n\n\t// Deal with a normal eval call with a string argument. Compile it\n\t// and return the compiled function bound in the local context.\n\tstatic const ParseRestriction restriction = NO_PARSE_RESTRICTION;\n\tHandle compiled;\n\tASSIGN_RETURN_ON_EXCEPTION_VALUE(\n\t\tisolate, compiled,\n\t\tCompiler::GetFunctionFromEval(\n\t\t\tsource, outer_info, context, language_mode,\n\t\t\trestriction, eval_scope_position, eval_position\n\t\t),\n\t\tisolate->heap()->exception()\n\t);\n\treturn *compiled;\n}\n\n\nRUNTIME_FUNCTION(Runtime_ResolvePossiblyDirectEval) {\n\tHandleScope scope(isolate);\n\tDCHECK(args.length() == 6);\n\n\tHandle callee = args.at(0);\n\n\t// If \"eval\" didn't refer to the original GlobalEval, it's not a\n\t// direct call to eval.\n\t// (And even if it is, but the first argument isn't a string, just let\n\t// execution default to an indirect call to eval, which will also return\n\t// the first argument without doing anything).\n\tif (*callee != isolate->native_context()->global_eval_fun() || !args[1]->IsString()) {\n\t\treturn *callee;\n\t}\n\n\tDCHECK(args[3]->IsSmi());\n\tDCHECK(is_valid_language_mode(args.smi_at(3)));\n\tLanguageMode language_mode = static_cast(args.smi_at(3));\n\tDCHECK(args[4]->IsSmi());\n\tHandle outer_info(args.at(2)->shared(), isolate);\n\treturn CompileGlobalEval(\n\t\tisolate,\n\t\targs.at(1),\n\t\touter_info,\n\t\tlanguage_mode,\n\t\targs.smi_at(4),\n\t\targs.smi_at(5)\n\t);\n}\n}\t// namespace internal\n}\t// namespace v8\n\n/* vim: set shiftwidth=4 softtabstop=0 cindent cinoptions={1s: */\n\n" }, { "path": "src/test/resources/samples/langs/C/markdown.c", "content": "/* markdown.c - generic markdown parser */\n\n/*\n * Copyright (c) 2009, Natacha Porté\n * Copyright (c) 2011, Vicent Marti\n *\n * Permission to use, copy, modify, and distribute this software for any\n * purpose with or without fee is hereby granted, provided that the above\n * copyright notice and this permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n */\n\n#include \"markdown.h\"\n#include \"stack.h\"\n\n#include \n#include \n#include \n#include \n\n#if defined(_WIN32)\n#define strncasecmp\t_strnicmp\n#endif\n\n#define REF_TABLE_SIZE 8\n\n#define BUFFER_BLOCK 0\n#define BUFFER_SPAN 1\n\n#define MKD_LI_END 8\t/* internal list flag */\n\n#define gperf_case_strncmp(s1, s2, n) strncasecmp(s1, s2, n)\n#define GPERF_DOWNCASE 1\n#define GPERF_CASE_STRNCMP 1\n#include \"html_blocks.h\"\n\n/***************\n * LOCAL TYPES *\n ***************/\n\n/* link_ref: reference to a link */\nstruct link_ref {\n\tunsigned int id;\n\n\tstruct buf *link;\n\tstruct buf *title;\n\n\tstruct link_ref *next;\n};\n\n/* char_trigger: function pointer to render active chars */\n/* returns the number of chars taken care of */\n/* data is the pointer of the beginning of the span */\n/* offset is the number of valid chars before data */\nstruct sd_markdown;\ntypedef size_t\n(*char_trigger)(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);\n\nstatic size_t char_emphasis(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);\nstatic size_t char_linebreak(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);\nstatic size_t char_codespan(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);\nstatic size_t char_escape(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);\nstatic size_t char_entity(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);\nstatic size_t char_langle_tag(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);\nstatic size_t char_autolink_url(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);\nstatic size_t char_autolink_email(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);\nstatic size_t char_autolink_www(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);\nstatic size_t char_link(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);\nstatic size_t char_superscript(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size);\n\nenum markdown_char_t {\n\tMD_CHAR_NONE = 0,\n\tMD_CHAR_EMPHASIS,\n\tMD_CHAR_CODESPAN,\n\tMD_CHAR_LINEBREAK,\n\tMD_CHAR_LINK,\n\tMD_CHAR_LANGLE,\n\tMD_CHAR_ESCAPE,\n\tMD_CHAR_ENTITITY,\n\tMD_CHAR_AUTOLINK_URL,\n\tMD_CHAR_AUTOLINK_EMAIL,\n\tMD_CHAR_AUTOLINK_WWW,\n\tMD_CHAR_SUPERSCRIPT,\n};\n\nstatic char_trigger markdown_char_ptrs[] = {\n\tNULL,\n\t&char_emphasis,\n\t&char_codespan,\n\t&char_linebreak,\n\t&char_link,\n\t&char_langle_tag,\n\t&char_escape,\n\t&char_entity,\n\t&char_autolink_url,\n\t&char_autolink_email,\n\t&char_autolink_www,\n\t&char_superscript,\n};\n\n/* render • structure containing one particular render */\nstruct sd_markdown {\n\tstruct sd_callbacks\tcb;\n\tvoid *opaque;\n\n\tstruct link_ref *refs[REF_TABLE_SIZE];\n\tuint8_t active_char[256];\n\tstruct stack work_bufs[2];\n\tunsigned int ext_flags;\n\tsize_t max_nesting;\n\tint in_link_body;\n};\n\n/***************************\n * HELPER FUNCTIONS *\n ***************************/\n\nstatic inline struct buf *\nrndr_newbuf(struct sd_markdown *rndr, int type)\n{\n\tstatic const size_t buf_size[2] = {256, 64};\n\tstruct buf *work = NULL;\n\tstruct stack *pool = &rndr->work_bufs[type];\n\n\tif (pool->size < pool->asize &&\n\t\tpool->item[pool->size] != NULL) {\n\t\twork = pool->item[pool->size++];\n\t\twork->size = 0;\n\t} else {\n\t\twork = bufnew(buf_size[type]);\n\t\tstack_push(pool, work);\n\t}\n\n\treturn work;\n}\n\nstatic inline void\nrndr_popbuf(struct sd_markdown *rndr, int type)\n{\n\trndr->work_bufs[type].size--;\n}\n\nstatic void\nunscape_text(struct buf *ob, struct buf *src)\n{\n\tsize_t i = 0, org;\n\twhile (i < src->size) {\n\t\torg = i;\n\t\twhile (i < src->size && src->data[i] != '\\\\')\n\t\t\ti++;\n\n\t\tif (i > org)\n\t\t\tbufput(ob, src->data + org, i - org);\n\n\t\tif (i + 1 >= src->size)\n\t\t\tbreak;\n\n\t\tbufputc(ob, src->data[i + 1]);\n\t\ti += 2;\n\t}\n}\n\nstatic unsigned int\nhash_link_ref(const uint8_t *link_ref, size_t length)\n{\n\tsize_t i;\n\tunsigned int hash = 0;\n\n\tfor (i = 0; i < length; ++i)\n\t\thash = tolower(link_ref[i]) + (hash << 6) + (hash << 16) - hash;\n\n\treturn hash;\n}\n\nstatic struct link_ref *\nadd_link_ref(\n\tstruct link_ref **references,\n\tconst uint8_t *name, size_t name_size)\n{\n\tstruct link_ref *ref = calloc(1, sizeof(struct link_ref));\n\n\tif (!ref)\n\t\treturn NULL;\n\n\tref->id = hash_link_ref(name, name_size);\n\tref->next = references[ref->id % REF_TABLE_SIZE];\n\n\treferences[ref->id % REF_TABLE_SIZE] = ref;\n\treturn ref;\n}\n\nstatic struct link_ref *\nfind_link_ref(struct link_ref **references, uint8_t *name, size_t length)\n{\n\tunsigned int hash = hash_link_ref(name, length);\n\tstruct link_ref *ref = NULL;\n\n\tref = references[hash % REF_TABLE_SIZE];\n\n\twhile (ref != NULL) {\n\t\tif (ref->id == hash)\n\t\t\treturn ref;\n\n\t\tref = ref->next;\n\t}\n\n\treturn NULL;\n}\n\nstatic void\nfree_link_refs(struct link_ref **references)\n{\n\tsize_t i;\n\n\tfor (i = 0; i < REF_TABLE_SIZE; ++i) {\n\t\tstruct link_ref *r = references[i];\n\t\tstruct link_ref *next;\n\n\t\twhile (r) {\n\t\t\tnext = r->next;\n\t\t\tbufrelease(r->link);\n\t\t\tbufrelease(r->title);\n\t\t\tfree(r);\n\t\t\tr = next;\n\t\t}\n\t}\n}\n\n/*\n * Check whether a char is a Markdown space.\n\n * Right now we only consider spaces the actual\n * space and a newline: tabs and carriage returns\n * are filtered out during the preprocessing phase.\n *\n * If we wanted to actually be UTF-8 compliant, we\n * should instead extract an Unicode codepoint from\n * this character and check for space properties.\n */\nstatic inline int\n_isspace(int c)\n{\n\treturn c == ' ' || c == '\\n';\n}\n\n/****************************\n * INLINE PARSING FUNCTIONS *\n ****************************/\n\n/* is_mail_autolink • looks for the address part of a mail autolink and '>' */\n/* this is less strict than the original markdown e-mail address matching */\nstatic size_t\nis_mail_autolink(uint8_t *data, size_t size)\n{\n\tsize_t i = 0, nb = 0;\n\n\t/* address is assumed to be: [-@._a-zA-Z0-9]+ with exactly one '@' */\n\tfor (i = 0; i < size; ++i) {\n\t\tif (isalnum(data[i]))\n\t\t\tcontinue;\n\n\t\tswitch (data[i]) {\n\t\t\tcase '@':\n\t\t\t\tnb++;\n\n\t\t\tcase '-':\n\t\t\tcase '.':\n\t\t\tcase '_':\n\t\t\t\tbreak;\n\n\t\t\tcase '>':\n\t\t\t\treturn (nb == 1) ? i + 1 : 0;\n\n\t\t\tdefault:\n\t\t\t\treturn 0;\n\t\t}\n\t}\n\n\treturn 0;\n}\n\n/* tag_length • returns the length of the given tag, or 0 is it's not valid */\nstatic size_t\ntag_length(uint8_t *data, size_t size, enum mkd_autolink *autolink)\n{\n\tsize_t i, j;\n\n\t/* a valid tag can't be shorter than 3 chars */\n\tif (size < 3) return 0;\n\n\t/* begins with a '<' optionally followed by '/', followed by letter or number */\n\tif (data[0] != '<') return 0;\n\ti = (data[1] == '/') ? 2 : 1;\n\n\tif (!isalnum(data[i]))\n\t\treturn 0;\n\n\t/* scheme test */\n\t*autolink = MKDA_NOT_AUTOLINK;\n\n\t/* try to find the beginning of an URI */\n\twhile (i < size && (isalnum(data[i]) || data[i] == '.' || data[i] == '+' || data[i] == '-'))\n\t\ti++;\n\n\tif (i > 1 && data[i] == '@') {\n\t\tif ((j = is_mail_autolink(data + i, size - i)) != 0) {\n\t\t\t*autolink = MKDA_EMAIL;\n\t\t\treturn i + j;\n\t\t}\n\t}\n\n\tif (i > 2 && data[i] == ':') {\n\t\t*autolink = MKDA_NORMAL;\n\t\ti++;\n\t}\n\n\t/* completing autolink test: no whitespace or ' or \" */\n\tif (i >= size)\n\t\t*autolink = MKDA_NOT_AUTOLINK;\n\n\telse if (*autolink) {\n\t\tj = i;\n\n\t\twhile (i < size) {\n\t\t\tif (data[i] == '\\\\') i += 2;\n\t\t\telse if (data[i] == '>' || data[i] == '\\'' ||\n\t\t\t\t\tdata[i] == '\"' || data[i] == ' ' || data[i] == '\\n')\n\t\t\t\t\tbreak;\n\t\t\telse i++;\n\t\t}\n\n\t\tif (i >= size) return 0;\n\t\tif (i > j && data[i] == '>') return i + 1;\n\t\t/* one of the forbidden chars has been found */\n\t\t*autolink = MKDA_NOT_AUTOLINK;\n\t}\n\n\t/* looking for sometinhg looking like a tag end */\n\twhile (i < size && data[i] != '>') i++;\n\tif (i >= size) return 0;\n\treturn i + 1;\n}\n\n/* parse_inline • parses inline markdown elements */\nstatic void\nparse_inline(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size)\n{\n\tsize_t i = 0, end = 0;\n\tuint8_t action = 0;\n\tstruct buf work = { 0, 0, 0, 0 };\n\n\tif (rndr->work_bufs[BUFFER_SPAN].size +\n\t\trndr->work_bufs[BUFFER_BLOCK].size > rndr->max_nesting)\n\t\treturn;\n\n\twhile (i < size) {\n\t\t/* copying inactive chars into the output */\n\t\twhile (end < size && (action = rndr->active_char[data[end]]) == 0) {\n\t\t\tend++;\n\t\t}\n\n\t\tif (rndr->cb.normal_text) {\n\t\t\twork.data = data + i;\n\t\t\twork.size = end - i;\n\t\t\trndr->cb.normal_text(ob, &work, rndr->opaque);\n\t\t}\n\t\telse\n\t\t\tbufput(ob, data + i, end - i);\n\n\t\tif (end >= size) break;\n\t\ti = end;\n\n\t\tend = markdown_char_ptrs[(int)action](ob, rndr, data + i, i, size - i);\n\t\tif (!end) /* no action from the callback */\n\t\t\tend = i + 1;\n\t\telse {\n\t\t\ti += end;\n\t\t\tend = i;\n\t\t}\n\t}\n}\n\n/* find_emph_char • looks for the next emph uint8_t, skipping other constructs */\nstatic size_t\nfind_emph_char(uint8_t *data, size_t size, uint8_t c)\n{\n\tsize_t i = 1;\n\n\twhile (i < size) {\n\t\twhile (i < size && data[i] != c && data[i] != '`' && data[i] != '[')\n\t\t\ti++;\n\n\t\tif (i == size)\n\t\t\treturn 0;\n\n\t\tif (data[i] == c)\n\t\t\treturn i;\n\n\t\t/* not counting escaped chars */\n\t\tif (i && data[i - 1] == '\\\\') {\n\t\t\ti++; continue;\n\t\t}\n\n\t\tif (data[i] == '`') {\n\t\t\tsize_t span_nb = 0, bt;\n\t\t\tsize_t tmp_i = 0;\n\n\t\t\t/* counting the number of opening backticks */\n\t\t\twhile (i < size && data[i] == '`') {\n\t\t\t\ti++; span_nb++;\n\t\t\t}\n\n\t\t\tif (i >= size) return 0;\n\n\t\t\t/* finding the matching closing sequence */\n\t\t\tbt = 0;\n\t\t\twhile (i < size && bt < span_nb) {\n\t\t\t\tif (!tmp_i && data[i] == c) tmp_i = i;\n\t\t\t\tif (data[i] == '`') bt++;\n\t\t\t\telse bt = 0;\n\t\t\t\ti++;\n\t\t\t}\n\n\t\t\tif (i >= size) return tmp_i;\n\t\t}\n\t\t/* skipping a link */\n\t\telse if (data[i] == '[') {\n\t\t\tsize_t tmp_i = 0;\n\t\t\tuint8_t cc;\n\n\t\t\ti++;\n\t\t\twhile (i < size && data[i] != ']') {\n\t\t\t\tif (!tmp_i && data[i] == c) tmp_i = i;\n\t\t\t\ti++;\n\t\t\t}\n\n\t\t\ti++;\n\t\t\twhile (i < size && (data[i] == ' ' || data[i] == '\\n'))\n\t\t\t\ti++;\n\n\t\t\tif (i >= size)\n\t\t\t\treturn tmp_i;\n\n\t\t\tswitch (data[i]) {\n\t\t\tcase '[':\n\t\t\t\tcc = ']'; break;\n\n\t\t\tcase '(':\n\t\t\t\tcc = ')'; break;\n\n\t\t\tdefault:\n\t\t\t\tif (tmp_i)\n\t\t\t\t\treturn tmp_i;\n\t\t\t\telse\n\t\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\ti++;\n\t\t\twhile (i < size && data[i] != cc) {\n\t\t\t\tif (!tmp_i && data[i] == c) tmp_i = i;\n\t\t\t\ti++;\n\t\t\t}\n\n\t\t\tif (i >= size)\n\t\t\t\treturn tmp_i;\n\n\t\t\ti++;\n\t\t}\n\t}\n\n\treturn 0;\n}\n\n/* parse_emph1 • parsing single emphase */\n/* closed by a symbol not preceded by whitespace and not followed by symbol */\nstatic size_t\nparse_emph1(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size, uint8_t c)\n{\n\tsize_t i = 0, len;\n\tstruct buf *work = 0;\n\tint r;\n\n\tif (!rndr->cb.emphasis) return 0;\n\n\t/* skipping one symbol if coming from emph3 */\n\tif (size > 1 && data[0] == c && data[1] == c) i = 1;\n\n\twhile (i < size) {\n\t\tlen = find_emph_char(data + i, size - i, c);\n\t\tif (!len) return 0;\n\t\ti += len;\n\t\tif (i >= size) return 0;\n\n\t\tif (data[i] == c && !_isspace(data[i - 1])) {\n\n\t\t\tif (rndr->ext_flags & MKDEXT_NO_INTRA_EMPHASIS) {\n\t\t\t\tif (!(i + 1 == size || _isspace(data[i + 1]) || ispunct(data[i + 1])))\n\t\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\twork = rndr_newbuf(rndr, BUFFER_SPAN);\n\t\t\tparse_inline(work, rndr, data, i);\n\t\t\tr = rndr->cb.emphasis(ob, work, rndr->opaque);\n\t\t\trndr_popbuf(rndr, BUFFER_SPAN);\n\t\t\treturn r ? i + 1 : 0;\n\t\t}\n\t}\n\n\treturn 0;\n}\n\n/* parse_emph2 • parsing single emphase */\nstatic size_t\nparse_emph2(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size, uint8_t c)\n{\n\tint (*render_method)(struct buf *ob, const struct buf *text, void *opaque);\n\tsize_t i = 0, len;\n\tstruct buf *work = 0;\n\tint r;\n\n\trender_method = (c == '~') ? rndr->cb.strikethrough : rndr->cb.double_emphasis;\n\n\tif (!render_method)\n\t\treturn 0;\n\n\twhile (i < size) {\n\t\tlen = find_emph_char(data + i, size - i, c);\n\t\tif (!len) return 0;\n\t\ti += len;\n\n\t\tif (i + 1 < size && data[i] == c && data[i + 1] == c && i && !_isspace(data[i - 1])) {\n\t\t\twork = rndr_newbuf(rndr, BUFFER_SPAN);\n\t\t\tparse_inline(work, rndr, data, i);\n\t\t\tr = render_method(ob, work, rndr->opaque);\n\t\t\trndr_popbuf(rndr, BUFFER_SPAN);\n\t\t\treturn r ? i + 2 : 0;\n\t\t}\n\t\ti++;\n\t}\n\treturn 0;\n}\n\n/* parse_emph3 • parsing single emphase */\n/* finds the first closing tag, and delegates to the other emph */\nstatic size_t\nparse_emph3(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size, uint8_t c)\n{\n\tsize_t i = 0, len;\n\tint r;\n\n\twhile (i < size) {\n\t\tlen = find_emph_char(data + i, size - i, c);\n\t\tif (!len) return 0;\n\t\ti += len;\n\n\t\t/* skip whitespace preceded symbols */\n\t\tif (data[i] != c || _isspace(data[i - 1]))\n\t\t\tcontinue;\n\n\t\tif (i + 2 < size && data[i + 1] == c && data[i + 2] == c && rndr->cb.triple_emphasis) {\n\t\t\t/* triple symbol found */\n\t\t\tstruct buf *work = rndr_newbuf(rndr, BUFFER_SPAN);\n\n\t\t\tparse_inline(work, rndr, data, i);\n\t\t\tr = rndr->cb.triple_emphasis(ob, work, rndr->opaque);\n\t\t\trndr_popbuf(rndr, BUFFER_SPAN);\n\t\t\treturn r ? i + 3 : 0;\n\n\t\t} else if (i + 1 < size && data[i + 1] == c) {\n\t\t\t/* double symbol found, handing over to emph1 */\n\t\t\tlen = parse_emph1(ob, rndr, data - 2, size + 2, c);\n\t\t\tif (!len) return 0;\n\t\t\telse return len - 2;\n\n\t\t} else {\n\t\t\t/* single symbol found, handing over to emph2 */\n\t\t\tlen = parse_emph2(ob, rndr, data - 1, size + 1, c);\n\t\t\tif (!len) return 0;\n\t\t\telse return len - 1;\n\t\t}\n\t}\n\treturn 0;\n}\n\n/* char_emphasis • single and double emphasis parsing */\nstatic size_t\nchar_emphasis(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)\n{\n\tuint8_t c = data[0];\n\tsize_t ret;\n\n\tif (size > 2 && data[1] != c) {\n\t\t/* whitespace cannot follow an opening emphasis;\n\t\t * strikethrough only takes two characters '~~' */\n\t\tif (c == '~' || _isspace(data[1]) || (ret = parse_emph1(ob, rndr, data + 1, size - 1, c)) == 0)\n\t\t\treturn 0;\n\n\t\treturn ret + 1;\n\t}\n\n\tif (size > 3 && data[1] == c && data[2] != c) {\n\t\tif (_isspace(data[2]) || (ret = parse_emph2(ob, rndr, data + 2, size - 2, c)) == 0)\n\t\t\treturn 0;\n\n\t\treturn ret + 2;\n\t}\n\n\tif (size > 4 && data[1] == c && data[2] == c && data[3] != c) {\n\t\tif (c == '~' || _isspace(data[3]) || (ret = parse_emph3(ob, rndr, data + 3, size - 3, c)) == 0)\n\t\t\treturn 0;\n\n\t\treturn ret + 3;\n\t}\n\n\treturn 0;\n}\n\n\n/* char_linebreak • '\\n' preceded by two spaces (assuming linebreak != 0) */\nstatic size_t\nchar_linebreak(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)\n{\n\tif (offset < 2 || data[-1] != ' ' || data[-2] != ' ')\n\t\treturn 0;\n\n\t/* removing the last space from ob and rendering */\n\twhile (ob->size && ob->data[ob->size - 1] == ' ')\n\t\tob->size--;\n\n\treturn rndr->cb.linebreak(ob, rndr->opaque) ? 1 : 0;\n}\n\n\n/* char_codespan • '`' parsing a code span (assuming codespan != 0) */\nstatic size_t\nchar_codespan(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)\n{\n\tsize_t end, nb = 0, i, f_begin, f_end;\n\n\t/* counting the number of backticks in the delimiter */\n\twhile (nb < size && data[nb] == '`')\n\t\tnb++;\n\n\t/* finding the next delimiter */\n\ti = 0;\n\tfor (end = nb; end < size && i < nb; end++) {\n\t\tif (data[end] == '`') i++;\n\t\telse i = 0;\n\t}\n\n\tif (i < nb && end >= size)\n\t\treturn 0; /* no matching delimiter */\n\n\t/* trimming outside whitespaces */\n\tf_begin = nb;\n\twhile (f_begin < end && data[f_begin] == ' ')\n\t\tf_begin++;\n\n\tf_end = end - nb;\n\twhile (f_end > nb && data[f_end-1] == ' ')\n\t\tf_end--;\n\n\t/* real code span */\n\tif (f_begin < f_end) {\n\t\tstruct buf work = { data + f_begin, f_end - f_begin, 0, 0 };\n\t\tif (!rndr->cb.codespan(ob, &work, rndr->opaque))\n\t\t\tend = 0;\n\t} else {\n\t\tif (!rndr->cb.codespan(ob, 0, rndr->opaque))\n\t\t\tend = 0;\n\t}\n\n\treturn end;\n}\n\n\n/* char_escape • '\\\\' backslash escape */\nstatic size_t\nchar_escape(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)\n{\n\tstatic const char *escape_chars = \"\\\\`*_{}[]()#+-.!:|&<>^~\";\n\tstruct buf work = { 0, 0, 0, 0 };\n\n\tif (size > 1) {\n\t\tif (strchr(escape_chars, data[1]) == NULL)\n\t\t\treturn 0;\n\n\t\tif (rndr->cb.normal_text) {\n\t\t\twork.data = data + 1;\n\t\t\twork.size = 1;\n\t\t\trndr->cb.normal_text(ob, &work, rndr->opaque);\n\t\t}\n\t\telse bufputc(ob, data[1]);\n\t} else if (size == 1) {\n\t\tbufputc(ob, data[0]);\n\t}\n\n\treturn 2;\n}\n\n/* char_entity • '&' escaped when it doesn't belong to an entity */\n/* valid entities are assumed to be anything matching &#?[A-Za-z0-9]+; */\nstatic size_t\nchar_entity(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)\n{\n\tsize_t end = 1;\n\tstruct buf work = { 0, 0, 0, 0 };\n\n\tif (end < size && data[end] == '#')\n\t\tend++;\n\n\twhile (end < size && isalnum(data[end]))\n\t\tend++;\n\n\tif (end < size && data[end] == ';')\n\t\tend++; /* real entity */\n\telse\n\t\treturn 0; /* lone '&' */\n\n\tif (rndr->cb.entity) {\n\t\twork.data = data;\n\t\twork.size = end;\n\t\trndr->cb.entity(ob, &work, rndr->opaque);\n\t}\n\telse bufput(ob, data, end);\n\n\treturn end;\n}\n\n/* char_langle_tag • '<' when tags or autolinks are allowed */\nstatic size_t\nchar_langle_tag(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)\n{\n\tenum mkd_autolink altype = MKDA_NOT_AUTOLINK;\n\tsize_t end = tag_length(data, size, &altype);\n\tstruct buf work = { data, end, 0, 0 };\n\tint ret = 0;\n\n\tif (end > 2) {\n\t\tif (rndr->cb.autolink && altype != MKDA_NOT_AUTOLINK) {\n\t\t\tstruct buf *u_link = rndr_newbuf(rndr, BUFFER_SPAN);\n\t\t\twork.data = data + 1;\n\t\t\twork.size = end - 2;\n\t\t\tunscape_text(u_link, &work);\n\t\t\tret = rndr->cb.autolink(ob, u_link, altype, rndr->opaque);\n\t\t\trndr_popbuf(rndr, BUFFER_SPAN);\n\t\t}\n\t\telse if (rndr->cb.raw_html_tag)\n\t\t\tret = rndr->cb.raw_html_tag(ob, &work, rndr->opaque);\n\t}\n\n\tif (!ret) return 0;\n\telse return end;\n}\n\nstatic size_t\nchar_autolink_www(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)\n{\n\tstruct buf *link, *link_url, *link_text;\n\tsize_t link_len, rewind;\n\n\tif (!rndr->cb.link || rndr->in_link_body)\n\t\treturn 0;\n\n\tlink = rndr_newbuf(rndr, BUFFER_SPAN);\n\n\tif ((link_len = sd_autolink__www(&rewind, link, data, offset, size)) > 0) {\n\t\tlink_url = rndr_newbuf(rndr, BUFFER_SPAN);\n\t\tBUFPUTSL(link_url, \"http://\");\n\t\tbufput(link_url, link->data, link->size);\n\n\t\tob->size -= rewind;\n\t\tif (rndr->cb.normal_text) {\n\t\t\tlink_text = rndr_newbuf(rndr, BUFFER_SPAN);\n\t\t\trndr->cb.normal_text(link_text, link, rndr->opaque);\n\t\t\trndr->cb.link(ob, link_url, NULL, link_text, rndr->opaque);\n\t\t\trndr_popbuf(rndr, BUFFER_SPAN);\n\t\t} else {\n\t\t\trndr->cb.link(ob, link_url, NULL, link, rndr->opaque);\n\t\t}\n\t\trndr_popbuf(rndr, BUFFER_SPAN);\n\t}\n\n\trndr_popbuf(rndr, BUFFER_SPAN);\n\treturn link_len;\n}\n\nstatic size_t\nchar_autolink_email(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)\n{\n\tstruct buf *link;\n\tsize_t link_len, rewind;\n\n\tif (!rndr->cb.autolink || rndr->in_link_body)\n\t\treturn 0;\n\n\tlink = rndr_newbuf(rndr, BUFFER_SPAN);\n\n\tif ((link_len = sd_autolink__email(&rewind, link, data, offset, size)) > 0) {\n\t\tob->size -= rewind;\n\t\trndr->cb.autolink(ob, link, MKDA_EMAIL, rndr->opaque);\n\t}\n\n\trndr_popbuf(rndr, BUFFER_SPAN);\n\treturn link_len;\n}\n\nstatic size_t\nchar_autolink_url(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)\n{\n\tstruct buf *link;\n\tsize_t link_len, rewind;\n\n\tif (!rndr->cb.autolink || rndr->in_link_body)\n\t\treturn 0;\n\n\tlink = rndr_newbuf(rndr, BUFFER_SPAN);\n\n\tif ((link_len = sd_autolink__url(&rewind, link, data, offset, size)) > 0) {\n\t\tob->size -= rewind;\n\t\trndr->cb.autolink(ob, link, MKDA_NORMAL, rndr->opaque);\n\t}\n\n\trndr_popbuf(rndr, BUFFER_SPAN);\n\treturn link_len;\n}\n\n/* char_link • '[': parsing a link or an image */\nstatic size_t\nchar_link(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)\n{\n\tint is_img = (offset && data[-1] == '!'), level;\n\tsize_t i = 1, txt_e, link_b = 0, link_e = 0, title_b = 0, title_e = 0;\n\tstruct buf *content = 0;\n\tstruct buf *link = 0;\n\tstruct buf *title = 0;\n\tstruct buf *u_link = 0;\n\tsize_t org_work_size = rndr->work_bufs[BUFFER_SPAN].size;\n\tint text_has_nl = 0, ret = 0;\n\tint in_title = 0, qtype = 0;\n\n\t/* checking whether the correct renderer exists */\n\tif ((is_img && !rndr->cb.image) || (!is_img && !rndr->cb.link))\n\t\tgoto cleanup;\n\n\t/* looking for the matching closing bracket */\n\tfor (level = 1; i < size; i++) {\n\t\tif (data[i] == '\\n')\n\t\t\ttext_has_nl = 1;\n\n\t\telse if (data[i - 1] == '\\\\')\n\t\t\tcontinue;\n\n\t\telse if (data[i] == '[')\n\t\t\tlevel++;\n\n\t\telse if (data[i] == ']') {\n\t\t\tlevel--;\n\t\t\tif (level <= 0)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (i >= size)\n\t\tgoto cleanup;\n\n\ttxt_e = i;\n\ti++;\n\n\t/* skip any amount of whitespace or newline */\n\t/* (this is much more laxist than original markdown syntax) */\n\twhile (i < size && _isspace(data[i]))\n\t\ti++;\n\n\t/* inline style link */\n\tif (i < size && data[i] == '(') {\n\t\t/* skipping initial whitespace */\n\t\ti++;\n\n\t\twhile (i < size && _isspace(data[i]))\n\t\t\ti++;\n\n\t\tlink_b = i;\n\n\t\t/* looking for link end: ' \" ) */\n\t\twhile (i < size) {\n\t\t\tif (data[i] == '\\\\') i += 2;\n\t\t\telse if (data[i] == ')') break;\n\t\t\telse if (i >= 1 && _isspace(data[i-1]) && (data[i] == '\\'' || data[i] == '\"')) break;\n\t\t\telse i++;\n\t\t}\n\n\t\tif (i >= size) goto cleanup;\n\t\tlink_e = i;\n\n\t\t/* looking for title end if present */\n\t\tif (data[i] == '\\'' || data[i] == '\"') {\n\t\t\tqtype = data[i];\n\t\t\tin_title = 1;\n\t\t\ti++;\n\t\t\ttitle_b = i;\n\n\t\t\twhile (i < size) {\n\t\t\t\tif (data[i] == '\\\\') i += 2;\n\t\t\t\telse if (data[i] == qtype) {in_title = 0; i++;}\n\t\t\t\telse if ((data[i] == ')') && !in_title) break;\n\t\t\t\telse i++;\n\t\t\t}\n\n\t\t\tif (i >= size) goto cleanup;\n\n\t\t\t/* skipping whitespaces after title */\n\t\t\ttitle_e = i - 1;\n\t\t\twhile (title_e > title_b && _isspace(data[title_e]))\n\t\t\t\ttitle_e--;\n\n\t\t\t/* checking for closing quote presence */\n\t\t\tif (data[title_e] != '\\'' && data[title_e] != '\"') {\n\t\t\t\ttitle_b = title_e = 0;\n\t\t\t\tlink_e = i;\n\t\t\t}\n\t\t}\n\n\t\t/* remove whitespace at the end of the link */\n\t\twhile (link_e > link_b && _isspace(data[link_e - 1]))\n\t\t\tlink_e--;\n\n\t\t/* remove optional angle brackets around the link */\n\t\tif (data[link_b] == '<') link_b++;\n\t\tif (data[link_e - 1] == '>') link_e--;\n\n\t\t/* building escaped link and title */\n\t\tif (link_e > link_b) {\n\t\t\tlink = rndr_newbuf(rndr, BUFFER_SPAN);\n\t\t\tbufput(link, data + link_b, link_e - link_b);\n\t\t}\n\n\t\tif (title_e > title_b) {\n\t\t\ttitle = rndr_newbuf(rndr, BUFFER_SPAN);\n\t\t\tbufput(title, data + title_b, title_e - title_b);\n\t\t}\n\n\t\ti++;\n\t}\n\n\t/* reference style link */\n\telse if (i < size && data[i] == '[') {\n\t\tstruct buf id = { 0, 0, 0, 0 };\n\t\tstruct link_ref *lr;\n\n\t\t/* looking for the id */\n\t\ti++;\n\t\tlink_b = i;\n\t\twhile (i < size && data[i] != ']') i++;\n\t\tif (i >= size) goto cleanup;\n\t\tlink_e = i;\n\n\t\t/* finding the link_ref */\n\t\tif (link_b == link_e) {\n\t\t\tif (text_has_nl) {\n\t\t\t\tstruct buf *b = rndr_newbuf(rndr, BUFFER_SPAN);\n\t\t\t\tsize_t j;\n\n\t\t\t\tfor (j = 1; j < txt_e; j++) {\n\t\t\t\t\tif (data[j] != '\\n')\n\t\t\t\t\t\tbufputc(b, data[j]);\n\t\t\t\t\telse if (data[j - 1] != ' ')\n\t\t\t\t\t\tbufputc(b, ' ');\n\t\t\t\t}\n\n\t\t\t\tid.data = b->data;\n\t\t\t\tid.size = b->size;\n\t\t\t} else {\n\t\t\t\tid.data = data + 1;\n\t\t\t\tid.size = txt_e - 1;\n\t\t\t}\n\t\t} else {\n\t\t\tid.data = data + link_b;\n\t\t\tid.size = link_e - link_b;\n\t\t}\n\n\t\tlr = find_link_ref(rndr->refs, id.data, id.size);\n\t\tif (!lr)\n\t\t\tgoto cleanup;\n\n\t\t/* keeping link and title from link_ref */\n\t\tlink = lr->link;\n\t\ttitle = lr->title;\n\t\ti++;\n\t}\n\n\t/* shortcut reference style link */\n\telse {\n\t\tstruct buf id = { 0, 0, 0, 0 };\n\t\tstruct link_ref *lr;\n\n\t\t/* crafting the id */\n\t\tif (text_has_nl) {\n\t\t\tstruct buf *b = rndr_newbuf(rndr, BUFFER_SPAN);\n\t\t\tsize_t j;\n\n\t\t\tfor (j = 1; j < txt_e; j++) {\n\t\t\t\tif (data[j] != '\\n')\n\t\t\t\t\tbufputc(b, data[j]);\n\t\t\t\telse if (data[j - 1] != ' ')\n\t\t\t\t\tbufputc(b, ' ');\n\t\t\t}\n\n\t\t\tid.data = b->data;\n\t\t\tid.size = b->size;\n\t\t} else {\n\t\t\tid.data = data + 1;\n\t\t\tid.size = txt_e - 1;\n\t\t}\n\n\t\t/* finding the link_ref */\n\t\tlr = find_link_ref(rndr->refs, id.data, id.size);\n\t\tif (!lr)\n\t\t\tgoto cleanup;\n\n\t\t/* keeping link and title from link_ref */\n\t\tlink = lr->link;\n\t\ttitle = lr->title;\n\n\t\t/* rewinding the whitespace */\n\t\ti = txt_e + 1;\n\t}\n\n\t/* building content: img alt is escaped, link content is parsed */\n\tif (txt_e > 1) {\n\t\tcontent = rndr_newbuf(rndr, BUFFER_SPAN);\n\t\tif (is_img) {\n\t\t\tbufput(content, data + 1, txt_e - 1);\n\t\t} else {\n\t\t\t/* disable autolinking when parsing inline the\n\t\t\t * content of a link */\n\t\t\trndr->in_link_body = 1;\n\t\t\tparse_inline(content, rndr, data + 1, txt_e - 1);\n\t\t\trndr->in_link_body = 0;\n\t\t}\n\t}\n\n\tif (link) {\n\t\tu_link = rndr_newbuf(rndr, BUFFER_SPAN);\n\t\tunscape_text(u_link, link);\n\t}\n\n\t/* calling the relevant rendering function */\n\tif (is_img) {\n\t\tif (ob->size && ob->data[ob->size - 1] == '!')\n\t\t\tob->size -= 1;\n\n\t\tret = rndr->cb.image(ob, u_link, title, content, rndr->opaque);\n\t} else {\n\t\tret = rndr->cb.link(ob, u_link, title, content, rndr->opaque);\n\t}\n\n\t/* cleanup */\ncleanup:\n\trndr->work_bufs[BUFFER_SPAN].size = (int)org_work_size;\n\treturn ret ? i : 0;\n}\n\nstatic size_t\nchar_superscript(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t offset, size_t size)\n{\n\tsize_t sup_start, sup_len;\n\tstruct buf *sup;\n\n\tif (!rndr->cb.superscript)\n\t\treturn 0;\n\n\tif (size < 2)\n\t\treturn 0;\n\n\tif (data[1] == '(') {\n\t\tsup_start = sup_len = 2;\n\n\t\twhile (sup_len < size && data[sup_len] != ')' && data[sup_len - 1] != '\\\\')\n\t\t\tsup_len++;\n\n\t\tif (sup_len == size)\n\t\t\treturn 0;\n\t} else {\n\t\tsup_start = sup_len = 1;\n\n\t\twhile (sup_len < size && !_isspace(data[sup_len]))\n\t\t\tsup_len++;\n\t}\n\n\tif (sup_len - sup_start == 0)\n\t\treturn (sup_start == 2) ? 3 : 0;\n\n\tsup = rndr_newbuf(rndr, BUFFER_SPAN);\n\tparse_inline(sup, rndr, data + sup_start, sup_len - sup_start);\n\trndr->cb.superscript(ob, sup, rndr->opaque);\n\trndr_popbuf(rndr, BUFFER_SPAN);\n\n\treturn (sup_start == 2) ? sup_len + 1 : sup_len;\n}\n\n/*********************************\n * BLOCK-LEVEL PARSING FUNCTIONS *\n *********************************/\n\n/* is_empty • returns the line length when it is empty, 0 otherwise */\nstatic size_t\nis_empty(uint8_t *data, size_t size)\n{\n\tsize_t i;\n\n\tfor (i = 0; i < size && data[i] != '\\n'; i++)\n\t\tif (data[i] != ' ')\n\t\t\treturn 0;\n\n\treturn i + 1;\n}\n\n/* is_hrule • returns whether a line is a horizontal rule */\nstatic int\nis_hrule(uint8_t *data, size_t size)\n{\n\tsize_t i = 0, n = 0;\n\tuint8_t c;\n\n\t/* skipping initial spaces */\n\tif (size < 3) return 0;\n\tif (data[0] == ' ') { i++;\n\tif (data[1] == ' ') { i++;\n\tif (data[2] == ' ') { i++; } } }\n\n\t/* looking at the hrule uint8_t */\n\tif (i + 2 >= size\n\t|| (data[i] != '*' && data[i] != '-' && data[i] != '_'))\n\t\treturn 0;\n\tc = data[i];\n\n\t/* the whole line must be the char or whitespace */\n\twhile (i < size && data[i] != '\\n') {\n\t\tif (data[i] == c) n++;\n\t\telse if (data[i] != ' ')\n\t\t\treturn 0;\n\n\t\ti++;\n\t}\n\n\treturn n >= 3;\n}\n\n/* check if a line begins with a code fence; return the\n * width of the code fence */\nstatic size_t\nprefix_codefence(uint8_t *data, size_t size)\n{\n\tsize_t i = 0, n = 0;\n\tuint8_t c;\n\n\t/* skipping initial spaces */\n\tif (size < 3) return 0;\n\tif (data[0] == ' ') { i++;\n\tif (data[1] == ' ') { i++;\n\tif (data[2] == ' ') { i++; } } }\n\n\t/* looking at the hrule uint8_t */\n\tif (i + 2 >= size || !(data[i] == '~' || data[i] == '`'))\n\t\treturn 0;\n\n\tc = data[i];\n\n\t/* the whole line must be the uint8_t or whitespace */\n\twhile (i < size && data[i] == c) {\n\t\tn++; i++;\n\t}\n\n\tif (n < 3)\n\t\treturn 0;\n\n\treturn i;\n}\n\n/* check if a line is a code fence; return its size if it is */\nstatic size_t\nis_codefence(uint8_t *data, size_t size, struct buf *syntax)\n{\n\tsize_t i = 0, syn_len = 0;\n\tuint8_t *syn_start;\n\n\ti = prefix_codefence(data, size);\n\tif (i == 0)\n\t\treturn 0;\n\n\twhile (i < size && data[i] == ' ')\n\t\ti++;\n\n\tsyn_start = data + i;\n\n\tif (i < size && data[i] == '{') {\n\t\ti++; syn_start++;\n\n\t\twhile (i < size && data[i] != '}' && data[i] != '\\n') {\n\t\t\tsyn_len++; i++;\n\t\t}\n\n\t\tif (i == size || data[i] != '}')\n\t\t\treturn 0;\n\n\t\t/* strip all whitespace at the beginning and the end\n\t\t * of the {} block */\n\t\twhile (syn_len > 0 && _isspace(syn_start[0])) {\n\t\t\tsyn_start++; syn_len--;\n\t\t}\n\n\t\twhile (syn_len > 0 && _isspace(syn_start[syn_len - 1]))\n\t\t\tsyn_len--;\n\n\t\ti++;\n\t} else {\n\t\twhile (i < size && !_isspace(data[i])) {\n\t\t\tsyn_len++; i++;\n\t\t}\n\t}\n\n\tif (syntax) {\n\t\tsyntax->data = syn_start;\n\t\tsyntax->size = syn_len;\n\t}\n\n\twhile (i < size && data[i] != '\\n') {\n\t\tif (!_isspace(data[i]))\n\t\t\treturn 0;\n\n\t\ti++;\n\t}\n\n\treturn i + 1;\n}\n\n/* is_atxheader • returns whether the line is a hash-prefixed header */\nstatic int\nis_atxheader(struct sd_markdown *rndr, uint8_t *data, size_t size)\n{\n\tif (data[0] != '#')\n\t\treturn 0;\n\n\tif (rndr->ext_flags & MKDEXT_SPACE_HEADERS) {\n\t\tsize_t level = 0;\n\n\t\twhile (level < size && level < 6 && data[level] == '#')\n\t\t\tlevel++;\n\n\t\tif (level < size && data[level] != ' ')\n\t\t\treturn 0;\n\t}\n\n\treturn 1;\n}\n\n/* is_headerline • returns whether the line is a setext-style hdr underline */\nstatic int\nis_headerline(uint8_t *data, size_t size)\n{\n\tsize_t i = 0;\n\n\t/* test of level 1 header */\n\tif (data[i] == '=') {\n\t\tfor (i = 1; i < size && data[i] == '='; i++);\n\t\twhile (i < size && data[i] == ' ') i++;\n\t\treturn (i >= size || data[i] == '\\n') ? 1 : 0; }\n\n\t/* test of level 2 header */\n\tif (data[i] == '-') {\n\t\tfor (i = 1; i < size && data[i] == '-'; i++);\n\t\twhile (i < size && data[i] == ' ') i++;\n\t\treturn (i >= size || data[i] == '\\n') ? 2 : 0; }\n\n\treturn 0;\n}\n\nstatic int\nis_next_headerline(uint8_t *data, size_t size)\n{\n\tsize_t i = 0;\n\n\twhile (i < size && data[i] != '\\n')\n\t\ti++;\n\n\tif (++i >= size)\n\t\treturn 0;\n\n\treturn is_headerline(data + i, size - i);\n}\n\n/* prefix_quote • returns blockquote prefix length */\nstatic size_t\nprefix_quote(uint8_t *data, size_t size)\n{\n\tsize_t i = 0;\n\tif (i < size && data[i] == ' ') i++;\n\tif (i < size && data[i] == ' ') i++;\n\tif (i < size && data[i] == ' ') i++;\n\n\tif (i < size && data[i] == '>') {\n\t\tif (i + 1 < size && data[i + 1] == ' ')\n\t\t\treturn i + 2;\n\n\t\treturn i + 1;\n\t}\n\n\treturn 0;\n}\n\n/* prefix_code • returns prefix length for block code*/\nstatic size_t\nprefix_code(uint8_t *data, size_t size)\n{\n\tif (size > 3 && data[0] == ' ' && data[1] == ' '\n\t\t&& data[2] == ' ' && data[3] == ' ') return 4;\n\n\treturn 0;\n}\n\n/* prefix_oli • returns ordered list item prefix */\nstatic size_t\nprefix_oli(uint8_t *data, size_t size)\n{\n\tsize_t i = 0;\n\n\tif (i < size && data[i] == ' ') i++;\n\tif (i < size && data[i] == ' ') i++;\n\tif (i < size && data[i] == ' ') i++;\n\n\tif (i >= size || data[i] < '0' || data[i] > '9')\n\t\treturn 0;\n\n\twhile (i < size && data[i] >= '0' && data[i] <= '9')\n\t\ti++;\n\n\tif (i + 1 >= size || data[i] != '.' || data[i + 1] != ' ')\n\t\treturn 0;\n\n\tif (is_next_headerline(data + i, size - i))\n\t\treturn 0;\n\n\treturn i + 2;\n}\n\n/* prefix_uli • returns ordered list item prefix */\nstatic size_t\nprefix_uli(uint8_t *data, size_t size)\n{\n\tsize_t i = 0;\n\n\tif (i < size && data[i] == ' ') i++;\n\tif (i < size && data[i] == ' ') i++;\n\tif (i < size && data[i] == ' ') i++;\n\n\tif (i + 1 >= size ||\n\t\t(data[i] != '*' && data[i] != '+' && data[i] != '-') ||\n\t\tdata[i + 1] != ' ')\n\t\treturn 0;\n\n\tif (is_next_headerline(data + i, size - i))\n\t\treturn 0;\n\n\treturn i + 2;\n}\n\n\n/* parse_block • parsing of one block, returning next uint8_t to parse */\nstatic void parse_block(struct buf *ob, struct sd_markdown *rndr,\n\t\t\tuint8_t *data, size_t size);\n\n\n/* parse_blockquote • handles parsing of a blockquote fragment */\nstatic size_t\nparse_blockquote(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size)\n{\n\tsize_t beg, end = 0, pre, work_size = 0;\n\tuint8_t *work_data = 0;\n\tstruct buf *out = 0;\n\n\tout = rndr_newbuf(rndr, BUFFER_BLOCK);\n\tbeg = 0;\n\twhile (beg < size) {\n\t\tfor (end = beg + 1; end < size && data[end - 1] != '\\n'; end++);\n\n\t\tpre = prefix_quote(data + beg, end - beg);\n\n\t\tif (pre)\n\t\t\tbeg += pre; /* skipping prefix */\n\n\t\t/* empty line followed by non-quote line */\n\t\telse if (is_empty(data + beg, end - beg) &&\n\t\t\t\t(end >= size || (prefix_quote(data + end, size - end) == 0 &&\n\t\t\t\t!is_empty(data + end, size - end))))\n\t\t\tbreak;\n\n\t\tif (beg < end) { /* copy into the in-place working buffer */\n\t\t\t/* bufput(work, data + beg, end - beg); */\n\t\t\tif (!work_data)\n\t\t\t\twork_data = data + beg;\n\t\t\telse if (data + beg != work_data + work_size)\n\t\t\t\tmemmove(work_data + work_size, data + beg, end - beg);\n\t\t\twork_size += end - beg;\n\t\t}\n\t\tbeg = end;\n\t}\n\n\tparse_block(out, rndr, work_data, work_size);\n\tif (rndr->cb.blockquote)\n\t\trndr->cb.blockquote(ob, out, rndr->opaque);\n\trndr_popbuf(rndr, BUFFER_BLOCK);\n\treturn end;\n}\n\nstatic size_t\nparse_htmlblock(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size, int do_render);\n\n/* parse_blockquote • handles parsing of a regular paragraph */\nstatic size_t\nparse_paragraph(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size)\n{\n\tsize_t i = 0, end = 0;\n\tint level = 0;\n\tstruct buf work = { data, 0, 0, 0 };\n\n\twhile (i < size) {\n\t\tfor (end = i + 1; end < size && data[end - 1] != '\\n'; end++) /* empty */;\n\n\t\tif (is_empty(data + i, size - i))\n\t\t\tbreak;\n\n\t\tif ((level = is_headerline(data + i, size - i)) != 0)\n\t\t\tbreak;\n\n\t\tif (is_atxheader(rndr, data + i, size - i) ||\n\t\t\tis_hrule(data + i, size - i) ||\n\t\t\tprefix_quote(data + i, size - i)) {\n\t\t\tend = i;\n\t\t\tbreak;\n\t\t}\n\n\t\t/*\n\t\t * Early termination of a paragraph with the same logic\n\t\t * as Markdown 1.0.0. If this logic is applied, the\n\t\t * Markdown 1.0.3 test suite won't pass cleanly\n\t\t *\n\t\t * :: If the first character in a new line is not a letter,\n\t\t * let's check to see if there's some kind of block starting\n\t\t * here\n\t\t */\n\t\tif ((rndr->ext_flags & MKDEXT_LAX_SPACING) && !isalnum(data[i])) {\n\t\t\tif (prefix_oli(data + i, size - i) ||\n\t\t\t\tprefix_uli(data + i, size - i)) {\n\t\t\t\tend = i;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t/* see if an html block starts here */\n\t\t\tif (data[i] == '<' && rndr->cb.blockhtml &&\n\t\t\t\tparse_htmlblock(ob, rndr, data + i, size - i, 0)) {\n\t\t\t\tend = i;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t/* see if a code fence starts here */\n\t\t\tif ((rndr->ext_flags & MKDEXT_FENCED_CODE) != 0 &&\n\t\t\t\tis_codefence(data + i, size - i, NULL) != 0) {\n\t\t\t\tend = i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\ti = end;\n\t}\n\n\twork.size = i;\n\twhile (work.size && data[work.size - 1] == '\\n')\n\t\twork.size--;\n\n\tif (!level) {\n\t\tstruct buf *tmp = rndr_newbuf(rndr, BUFFER_BLOCK);\n\t\tparse_inline(tmp, rndr, work.data, work.size);\n\t\tif (rndr->cb.paragraph)\n\t\t\trndr->cb.paragraph(ob, tmp, rndr->opaque);\n\t\trndr_popbuf(rndr, BUFFER_BLOCK);\n\t} else {\n\t\tstruct buf *header_work;\n\n\t\tif (work.size) {\n\t\t\tsize_t beg;\n\t\t\ti = work.size;\n\t\t\twork.size -= 1;\n\n\t\t\twhile (work.size && data[work.size] != '\\n')\n\t\t\t\twork.size -= 1;\n\n\t\t\tbeg = work.size + 1;\n\t\t\twhile (work.size && data[work.size - 1] == '\\n')\n\t\t\t\twork.size -= 1;\n\n\t\t\tif (work.size > 0) {\n\t\t\t\tstruct buf *tmp = rndr_newbuf(rndr, BUFFER_BLOCK);\n\t\t\t\tparse_inline(tmp, rndr, work.data, work.size);\n\n\t\t\t\tif (rndr->cb.paragraph)\n\t\t\t\t\trndr->cb.paragraph(ob, tmp, rndr->opaque);\n\n\t\t\t\trndr_popbuf(rndr, BUFFER_BLOCK);\n\t\t\t\twork.data += beg;\n\t\t\t\twork.size = i - beg;\n\t\t\t}\n\t\t\telse work.size = i;\n\t\t}\n\n\t\theader_work = rndr_newbuf(rndr, BUFFER_SPAN);\n\t\tparse_inline(header_work, rndr, work.data, work.size);\n\n\t\tif (rndr->cb.header)\n\t\t\trndr->cb.header(ob, header_work, (int)level, rndr->opaque);\n\n\t\trndr_popbuf(rndr, BUFFER_SPAN);\n\t}\n\n\treturn end;\n}\n\n/* parse_fencedcode • handles parsing of a block-level code fragment */\nstatic size_t\nparse_fencedcode(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size)\n{\n\tsize_t beg, end;\n\tstruct buf *work = 0;\n\tstruct buf lang = { 0, 0, 0, 0 };\n\n\tbeg = is_codefence(data, size, &lang);\n\tif (beg == 0) return 0;\n\n\twork = rndr_newbuf(rndr, BUFFER_BLOCK);\n\n\twhile (beg < size) {\n\t\tsize_t fence_end;\n\t\tstruct buf fence_trail = { 0, 0, 0, 0 };\n\n\t\tfence_end = is_codefence(data + beg, size - beg, &fence_trail);\n\t\tif (fence_end != 0 && fence_trail.size == 0) {\n\t\t\tbeg += fence_end;\n\t\t\tbreak;\n\t\t}\n\n\t\tfor (end = beg + 1; end < size && data[end - 1] != '\\n'; end++);\n\n\t\tif (beg < end) {\n\t\t\t/* verbatim copy to the working buffer,\n\t\t\t\tescaping entities */\n\t\t\tif (is_empty(data + beg, end - beg))\n\t\t\t\tbufputc(work, '\\n');\n\t\t\telse bufput(work, data + beg, end - beg);\n\t\t}\n\t\tbeg = end;\n\t}\n\n\tif (work->size && work->data[work->size - 1] != '\\n')\n\t\tbufputc(work, '\\n');\n\n\tif (rndr->cb.blockcode)\n\t\trndr->cb.blockcode(ob, work, lang.size ? &lang : NULL, rndr->opaque);\n\n\trndr_popbuf(rndr, BUFFER_BLOCK);\n\treturn beg;\n}\n\nstatic size_t\nparse_blockcode(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size)\n{\n\tsize_t beg, end, pre;\n\tstruct buf *work = 0;\n\n\twork = rndr_newbuf(rndr, BUFFER_BLOCK);\n\n\tbeg = 0;\n\twhile (beg < size) {\n\t\tfor (end = beg + 1; end < size && data[end - 1] != '\\n'; end++) {};\n\t\tpre = prefix_code(data + beg, end - beg);\n\n\t\tif (pre)\n\t\t\tbeg += pre; /* skipping prefix */\n\t\telse if (!is_empty(data + beg, end - beg))\n\t\t\t/* non-empty non-prefixed line breaks the pre */\n\t\t\tbreak;\n\n\t\tif (beg < end) {\n\t\t\t/* verbatim copy to the working buffer,\n\t\t\t\tescaping entities */\n\t\t\tif (is_empty(data + beg, end - beg))\n\t\t\t\tbufputc(work, '\\n');\n\t\t\telse bufput(work, data + beg, end - beg);\n\t\t}\n\t\tbeg = end;\n\t}\n\n\twhile (work->size && work->data[work->size - 1] == '\\n')\n\t\twork->size -= 1;\n\n\tbufputc(work, '\\n');\n\n\tif (rndr->cb.blockcode)\n\t\trndr->cb.blockcode(ob, work, NULL, rndr->opaque);\n\n\trndr_popbuf(rndr, BUFFER_BLOCK);\n\treturn beg;\n}\n\n/* parse_listitem • parsing of a single list item */\n/*\tassuming initial prefix is already removed */\nstatic size_t\nparse_listitem(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size, int *flags)\n{\n\tstruct buf *work = 0, *inter = 0;\n\tsize_t beg = 0, end, pre, sublist = 0, orgpre = 0, i;\n\tint in_empty = 0, has_inside_empty = 0, in_fence = 0;\n\n\t/* keeping track of the first indentation prefix */\n\twhile (orgpre < 3 && orgpre < size && data[orgpre] == ' ')\n\t\torgpre++;\n\n\tbeg = prefix_uli(data, size);\n\tif (!beg)\n\t\tbeg = prefix_oli(data, size);\n\n\tif (!beg)\n\t\treturn 0;\n\n\t/* skipping to the beginning of the following line */\n\tend = beg;\n\twhile (end < size && data[end - 1] != '\\n')\n\t\tend++;\n\n\t/* getting working buffers */\n\twork = rndr_newbuf(rndr, BUFFER_SPAN);\n\tinter = rndr_newbuf(rndr, BUFFER_SPAN);\n\n\t/* putting the first line into the working buffer */\n\tbufput(work, data + beg, end - beg);\n\tbeg = end;\n\n\t/* process the following lines */\n\twhile (beg < size) {\n\t\tsize_t has_next_uli = 0, has_next_oli = 0;\n\n\t\tend++;\n\n\t\twhile (end < size && data[end - 1] != '\\n')\n\t\t\tend++;\n\n\t\t/* process an empty line */\n\t\tif (is_empty(data + beg, end - beg)) {\n\t\t\tin_empty = 1;\n\t\t\tbeg = end;\n\t\t\tcontinue;\n\t\t}\n\n\t\t/* calculating the indentation */\n\t\ti = 0;\n\t\twhile (i < 4 && beg + i < end && data[beg + i] == ' ')\n\t\t\ti++;\n\n\t\tpre = i;\n\n\t\tif (rndr->ext_flags & MKDEXT_FENCED_CODE) {\n\t\t\tif (is_codefence(data + beg + i, end - beg - i, NULL) != 0)\n\t\t\t\tin_fence = !in_fence;\n\t\t}\n\n\t\t/* Only check for new list items if we are **not** inside\n\t\t * a fenced code block */\n\t\tif (!in_fence) {\n\t\t\thas_next_uli = prefix_uli(data + beg + i, end - beg - i);\n\t\t\thas_next_oli = prefix_oli(data + beg + i, end - beg - i);\n\t\t}\n\n\t\t/* checking for ul/ol switch */\n\t\tif (in_empty && (\n\t\t\t((*flags & MKD_LIST_ORDERED) && has_next_uli) ||\n\t\t\t(!(*flags & MKD_LIST_ORDERED) && has_next_oli))){\n\t\t\t*flags |= MKD_LI_END;\n\t\t\tbreak; /* the following item must have same list type */\n\t\t}\n\n\t\t/* checking for a new item */\n\t\tif ((has_next_uli && !is_hrule(data + beg + i, end - beg - i)) || has_next_oli) {\n\t\t\tif (in_empty)\n\t\t\t\thas_inside_empty = 1;\n\n\t\t\tif (pre == orgpre) /* the following item must have */\n\t\t\t\tbreak; /* the same indentation */\n\n\t\t\tif (!sublist)\n\t\t\t\tsublist = work->size;\n\t\t}\n\t\t/* joining only indented stuff after empty lines;\n\t\t * note that now we only require 1 space of indentation\n\t\t * to continue a list */\n\t\telse if (in_empty && pre == 0) {\n\t\t\t*flags |= MKD_LI_END;\n\t\t\tbreak;\n\t\t}\n\t\telse if (in_empty) {\n\t\t\tbufputc(work, '\\n');\n\t\t\thas_inside_empty = 1;\n\t\t}\n\n\t\tin_empty = 0;\n\n\t\t/* adding the line without prefix into the working buffer */\n\t\tbufput(work, data + beg + i, end - beg - i);\n\t\tbeg = end;\n\t}\n\n\t/* render of li contents */\n\tif (has_inside_empty)\n\t\t*flags |= MKD_LI_BLOCK;\n\n\tif (*flags & MKD_LI_BLOCK) {\n\t\t/* intermediate render of block li */\n\t\tif (sublist && sublist < work->size) {\n\t\t\tparse_block(inter, rndr, work->data, sublist);\n\t\t\tparse_block(inter, rndr, work->data + sublist, work->size - sublist);\n\t\t}\n\t\telse\n\t\t\tparse_block(inter, rndr, work->data, work->size);\n\t} else {\n\t\t/* intermediate render of inline li */\n\t\tif (sublist && sublist < work->size) {\n\t\t\tparse_inline(inter, rndr, work->data, sublist);\n\t\t\tparse_block(inter, rndr, work->data + sublist, work->size - sublist);\n\t\t}\n\t\telse\n\t\t\tparse_inline(inter, rndr, work->data, work->size);\n\t}\n\n\t/* render of li itself */\n\tif (rndr->cb.listitem)\n\t\trndr->cb.listitem(ob, inter, *flags, rndr->opaque);\n\n\trndr_popbuf(rndr, BUFFER_SPAN);\n\trndr_popbuf(rndr, BUFFER_SPAN);\n\treturn beg;\n}\n\n\n/* parse_list • parsing ordered or unordered list block */\nstatic size_t\nparse_list(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size, int flags)\n{\n\tstruct buf *work = 0;\n\tsize_t i = 0, j;\n\n\twork = rndr_newbuf(rndr, BUFFER_BLOCK);\n\n\twhile (i < size) {\n\t\tj = parse_listitem(work, rndr, data + i, size - i, &flags);\n\t\ti += j;\n\n\t\tif (!j || (flags & MKD_LI_END))\n\t\t\tbreak;\n\t}\n\n\tif (rndr->cb.list)\n\t\trndr->cb.list(ob, work, flags, rndr->opaque);\n\trndr_popbuf(rndr, BUFFER_BLOCK);\n\treturn i;\n}\n\n/* parse_atxheader • parsing of atx-style headers */\nstatic size_t\nparse_atxheader(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size)\n{\n\tsize_t level = 0;\n\tsize_t i, end, skip;\n\n\twhile (level < size && level < 6 && data[level] == '#')\n\t\tlevel++;\n\n\tfor (i = level; i < size && data[i] == ' '; i++);\n\n\tfor (end = i; end < size && data[end] != '\\n'; end++);\n\tskip = end;\n\n\twhile (end && data[end - 1] == '#')\n\t\tend--;\n\n\twhile (end && data[end - 1] == ' ')\n\t\tend--;\n\n\tif (end > i) {\n\t\tstruct buf *work = rndr_newbuf(rndr, BUFFER_SPAN);\n\n\t\tparse_inline(work, rndr, data + i, end - i);\n\n\t\tif (rndr->cb.header)\n\t\t\trndr->cb.header(ob, work, (int)level, rndr->opaque);\n\n\t\trndr_popbuf(rndr, BUFFER_SPAN);\n\t}\n\n\treturn skip;\n}\n\n\n/* htmlblock_end • checking end of HTML block : [ \\t]*\\n[ \\t*]\\n */\n/*\treturns the length on match, 0 otherwise */\nstatic size_t\nhtmlblock_end_tag(\n\tconst char *tag,\n\tsize_t tag_len,\n\tstruct sd_markdown *rndr,\n\tuint8_t *data,\n\tsize_t size)\n{\n\tsize_t i, w;\n\n\t/* checking if tag is a match */\n\tif (tag_len + 3 >= size ||\n\t\tstrncasecmp((char *)data + 2, tag, tag_len) != 0 ||\n\t\tdata[tag_len + 2] != '>')\n\t\treturn 0;\n\n\t/* checking white lines */\n\ti = tag_len + 3;\n\tw = 0;\n\tif (i < size && (w = is_empty(data + i, size - i)) == 0)\n\t\treturn 0; /* non-blank after tag */\n\ti += w;\n\tw = 0;\n\n\tif (i < size)\n\t\tw = is_empty(data + i, size - i);\n\n\treturn i + w;\n}\n\nstatic size_t\nhtmlblock_end(const char *curtag,\n\tstruct sd_markdown *rndr,\n\tuint8_t *data,\n\tsize_t size,\n\tint start_of_line)\n{\n\tsize_t tag_size = strlen(curtag);\n\tsize_t i = 1, end_tag;\n\tint block_lines = 0;\n\n\twhile (i < size) {\n\t\ti++;\n\t\twhile (i < size && !(data[i - 1] == '<' && data[i] == '/')) {\n\t\t\tif (data[i] == '\\n')\n\t\t\t\tblock_lines++;\n\n\t\t\ti++;\n\t\t}\n\n\t\t/* If we are only looking for unindented tags, skip the tag\n\t\t * if it doesn't follow a newline.\n\t\t *\n\t\t * The only exception to this is if the tag is still on the\n\t\t * initial line; in that case it still counts as a closing\n\t\t * tag\n\t\t */\n\t\tif (start_of_line && block_lines > 0 && data[i - 2] != '\\n')\n\t\t\tcontinue;\n\n\t\tif (i + 2 + tag_size >= size)\n\t\t\tbreak;\n\n\t\tend_tag = htmlblock_end_tag(curtag, tag_size, rndr, data + i - 1, size - i + 1);\n\t\tif (end_tag)\n\t\t\treturn i + end_tag - 1;\n\t}\n\n\treturn 0;\n}\n\n\n/* parse_htmlblock • parsing of inline HTML block */\nstatic size_t\nparse_htmlblock(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size, int do_render)\n{\n\tsize_t i, j = 0, tag_end;\n\tconst char *curtag = NULL;\n\tstruct buf work = { data, 0, 0, 0 };\n\n\t/* identification of the opening tag */\n\tif (size < 2 || data[0] != '<')\n\t\treturn 0;\n\n\ti = 1;\n\twhile (i < size && data[i] != '>' && data[i] != ' ')\n\t\ti++;\n\n\tif (i < size)\n\t\tcurtag = find_block_tag((char *)data + 1, (int)i - 1);\n\n\t/* handling of special cases */\n\tif (!curtag) {\n\n\t\t/* HTML comment, laxist form */\n\t\tif (size > 5 && data[1] == '!' && data[2] == '-' && data[3] == '-') {\n\t\t\ti = 5;\n\n\t\t\twhile (i < size && !(data[i - 2] == '-' && data[i - 1] == '-' && data[i] == '>'))\n\t\t\t\ti++;\n\n\t\t\ti++;\n\n\t\t\tif (i < size)\n\t\t\t\tj = is_empty(data + i, size - i);\n\n\t\t\tif (j) {\n\t\t\t\twork.size = i + j;\n\t\t\t\tif (do_render && rndr->cb.blockhtml)\n\t\t\t\t\trndr->cb.blockhtml(ob, &work, rndr->opaque);\n\t\t\t\treturn work.size;\n\t\t\t}\n\t\t}\n\n\t\t/* HR, which is the only self-closing block tag considered */\n\t\tif (size > 4 && (data[1] == 'h' || data[1] == 'H') && (data[2] == 'r' || data[2] == 'R')) {\n\t\t\ti = 3;\n\t\t\twhile (i < size && data[i] != '>')\n\t\t\t\ti++;\n\n\t\t\tif (i + 1 < size) {\n\t\t\t\ti++;\n\t\t\t\tj = is_empty(data + i, size - i);\n\t\t\t\tif (j) {\n\t\t\t\t\twork.size = i + j;\n\t\t\t\t\tif (do_render && rndr->cb.blockhtml)\n\t\t\t\t\t\trndr->cb.blockhtml(ob, &work, rndr->opaque);\n\t\t\t\t\treturn work.size;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t/* no special case recognised */\n\t\treturn 0;\n\t}\n\n\t/* looking for an unindented matching closing tag */\n\t/*\tfollowed by a blank line */\n\ttag_end = htmlblock_end(curtag, rndr, data, size, 1);\n\n\t/* if not found, trying a second pass looking for indented match */\n\t/* but not if tag is \"ins\" or \"del\" (following original Markdown.pl) */\n\tif (!tag_end && strcmp(curtag, \"ins\") != 0 && strcmp(curtag, \"del\") != 0) {\n\t\ttag_end = htmlblock_end(curtag, rndr, data, size, 0);\n\t}\n\n\tif (!tag_end)\n\t\treturn 0;\n\n\t/* the end of the block has been found */\n\twork.size = tag_end;\n\tif (do_render && rndr->cb.blockhtml)\n\t\trndr->cb.blockhtml(ob, &work, rndr->opaque);\n\n\treturn tag_end;\n}\n\nstatic void\nparse_table_row(\n\tstruct buf *ob,\n\tstruct sd_markdown *rndr,\n\tuint8_t *data,\n\tsize_t size,\n\tsize_t columns,\n\tint *col_data,\n\tint header_flag)\n{\n\tsize_t i = 0, col;\n\tstruct buf *row_work = 0;\n\n\tif (!rndr->cb.table_cell || !rndr->cb.table_row)\n\t\treturn;\n\n\trow_work = rndr_newbuf(rndr, BUFFER_SPAN);\n\n\tif (i < size && data[i] == '|')\n\t\ti++;\n\n\tfor (col = 0; col < columns && i < size; ++col) {\n\t\tsize_t cell_start, cell_end;\n\t\tstruct buf *cell_work;\n\n\t\tcell_work = rndr_newbuf(rndr, BUFFER_SPAN);\n\n\t\twhile (i < size && _isspace(data[i]))\n\t\t\ti++;\n\n\t\tcell_start = i;\n\n\t\twhile (i < size && data[i] != '|')\n\t\t\ti++;\n\n\t\tcell_end = i - 1;\n\n\t\twhile (cell_end > cell_start && _isspace(data[cell_end]))\n\t\t\tcell_end--;\n\n\t\tparse_inline(cell_work, rndr, data + cell_start, 1 + cell_end - cell_start);\n\t\trndr->cb.table_cell(row_work, cell_work, col_data[col] | header_flag, rndr->opaque);\n\n\t\trndr_popbuf(rndr, BUFFER_SPAN);\n\t\ti++;\n\t}\n\n\tfor (; col < columns; ++col) {\n\t\tstruct buf empty_cell = { 0, 0, 0, 0 };\n\t\trndr->cb.table_cell(row_work, &empty_cell, col_data[col] | header_flag, rndr->opaque);\n\t}\n\n\trndr->cb.table_row(ob, row_work, rndr->opaque);\n\n\trndr_popbuf(rndr, BUFFER_SPAN);\n}\n\nstatic size_t\nparse_table_header(\n\tstruct buf *ob,\n\tstruct sd_markdown *rndr,\n\tuint8_t *data,\n\tsize_t size,\n\tsize_t *columns,\n\tint **column_data)\n{\n\tint pipes;\n\tsize_t i = 0, col, header_end, under_end;\n\n\tpipes = 0;\n\twhile (i < size && data[i] != '\\n')\n\t\tif (data[i++] == '|')\n\t\t\tpipes++;\n\n\tif (i == size || pipes == 0)\n\t\treturn 0;\n\n\theader_end = i;\n\n\twhile (header_end > 0 && _isspace(data[header_end - 1]))\n\t\theader_end--;\n\n\tif (data[0] == '|')\n\t\tpipes--;\n\n\tif (header_end && data[header_end - 1] == '|')\n\t\tpipes--;\n\n\t*columns = pipes + 1;\n\t*column_data = calloc(*columns, sizeof(int));\n\n\t/* Parse the header underline */\n\ti++;\n\tif (i < size && data[i] == '|')\n\t\ti++;\n\n\tunder_end = i;\n\twhile (under_end < size && data[under_end] != '\\n')\n\t\tunder_end++;\n\n\tfor (col = 0; col < *columns && i < under_end; ++col) {\n\t\tsize_t dashes = 0;\n\n\t\twhile (i < under_end && data[i] == ' ')\n\t\t\ti++;\n\n\t\tif (data[i] == ':') {\n\t\t\ti++; (*column_data)[col] |= MKD_TABLE_ALIGN_L;\n\t\t\tdashes++;\n\t\t}\n\n\t\twhile (i < under_end && data[i] == '-') {\n\t\t\ti++; dashes++;\n\t\t}\n\n\t\tif (i < under_end && data[i] == ':') {\n\t\t\ti++; (*column_data)[col] |= MKD_TABLE_ALIGN_R;\n\t\t\tdashes++;\n\t\t}\n\n\t\twhile (i < under_end && data[i] == ' ')\n\t\t\ti++;\n\n\t\tif (i < under_end && data[i] != '|')\n\t\t\tbreak;\n\n\t\tif (dashes < 3)\n\t\t\tbreak;\n\n\t\ti++;\n\t}\n\n\tif (col < *columns)\n\t\treturn 0;\n\n\tparse_table_row(\n\t\tob, rndr, data,\n\t\theader_end,\n\t\t*columns,\n\t\t*column_data,\n\t\tMKD_TABLE_HEADER\n\t);\n\n\treturn under_end + 1;\n}\n\nstatic size_t\nparse_table(\n\tstruct buf *ob,\n\tstruct sd_markdown *rndr,\n\tuint8_t *data,\n\tsize_t size)\n{\n\tsize_t i;\n\n\tstruct buf *header_work = 0;\n\tstruct buf *body_work = 0;\n\n\tsize_t columns;\n\tint *col_data = NULL;\n\n\theader_work = rndr_newbuf(rndr, BUFFER_SPAN);\n\tbody_work = rndr_newbuf(rndr, BUFFER_BLOCK);\n\n\ti = parse_table_header(header_work, rndr, data, size, &columns, &col_data);\n\tif (i > 0) {\n\n\t\twhile (i < size) {\n\t\t\tsize_t row_start;\n\t\t\tint pipes = 0;\n\n\t\t\trow_start = i;\n\n\t\t\twhile (i < size && data[i] != '\\n')\n\t\t\t\tif (data[i++] == '|')\n\t\t\t\t\tpipes++;\n\n\t\t\tif (pipes == 0 || i == size) {\n\t\t\t\ti = row_start;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tparse_table_row(\n\t\t\t\tbody_work,\n\t\t\t\trndr,\n\t\t\t\tdata + row_start,\n\t\t\t\ti - row_start,\n\t\t\t\tcolumns,\n\t\t\t\tcol_data, 0\n\t\t\t);\n\n\t\t\ti++;\n\t\t}\n\n\t\tif (rndr->cb.table)\n\t\t\trndr->cb.table(ob, header_work, body_work, rndr->opaque);\n\t}\n\n\tfree(col_data);\n\trndr_popbuf(rndr, BUFFER_SPAN);\n\trndr_popbuf(rndr, BUFFER_BLOCK);\n\treturn i;\n}\n\n/* parse_block • parsing of one block, returning next uint8_t to parse */\nstatic void\nparse_block(struct buf *ob, struct sd_markdown *rndr, uint8_t *data, size_t size)\n{\n\tsize_t beg, end, i;\n\tuint8_t *txt_data;\n\tbeg = 0;\n\n\tif (rndr->work_bufs[BUFFER_SPAN].size +\n\t\trndr->work_bufs[BUFFER_BLOCK].size > rndr->max_nesting)\n\t\treturn;\n\n\twhile (beg < size) {\n\t\ttxt_data = data + beg;\n\t\tend = size - beg;\n\n\t\tif (is_atxheader(rndr, txt_data, end))\n\t\t\tbeg += parse_atxheader(ob, rndr, txt_data, end);\n\n\t\telse if (data[beg] == '<' && rndr->cb.blockhtml &&\n\t\t\t\t(i = parse_htmlblock(ob, rndr, txt_data, end, 1)) != 0)\n\t\t\tbeg += i;\n\n\t\telse if ((i = is_empty(txt_data, end)) != 0)\n\t\t\tbeg += i;\n\n\t\telse if (is_hrule(txt_data, end)) {\n\t\t\tif (rndr->cb.hrule)\n\t\t\t\trndr->cb.hrule(ob, rndr->opaque);\n\n\t\t\twhile (beg < size && data[beg] != '\\n')\n\t\t\t\tbeg++;\n\n\t\t\tbeg++;\n\t\t}\n\n\t\telse if ((rndr->ext_flags & MKDEXT_FENCED_CODE) != 0 &&\n\t\t\t(i = parse_fencedcode(ob, rndr, txt_data, end)) != 0)\n\t\t\tbeg += i;\n\n\t\telse if ((rndr->ext_flags & MKDEXT_TABLES) != 0 &&\n\t\t\t(i = parse_table(ob, rndr, txt_data, end)) != 0)\n\t\t\tbeg += i;\n\n\t\telse if (prefix_quote(txt_data, end))\n\t\t\tbeg += parse_blockquote(ob, rndr, txt_data, end);\n\n\t\telse if (prefix_code(txt_data, end))\n\t\t\tbeg += parse_blockcode(ob, rndr, txt_data, end);\n\n\t\telse if (prefix_uli(txt_data, end))\n\t\t\tbeg += parse_list(ob, rndr, txt_data, end, 0);\n\n\t\telse if (prefix_oli(txt_data, end))\n\t\t\tbeg += parse_list(ob, rndr, txt_data, end, MKD_LIST_ORDERED);\n\n\t\telse\n\t\t\tbeg += parse_paragraph(ob, rndr, txt_data, end);\n\t}\n}\n\n\n\n/*********************\n * REFERENCE PARSING *\n *********************/\n\n/* is_ref • returns whether a line is a reference or not */\nstatic int\nis_ref(const uint8_t *data, size_t beg, size_t end, size_t *last, struct link_ref **refs)\n{\n/*\tint n; */\n\tsize_t i = 0;\n\tsize_t id_offset, id_end;\n\tsize_t link_offset, link_end;\n\tsize_t title_offset, title_end;\n\tsize_t line_end;\n\n\t/* up to 3 optional leading spaces */\n\tif (beg + 3 >= end) return 0;\n\tif (data[beg] == ' ') { i = 1;\n\tif (data[beg + 1] == ' ') { i = 2;\n\tif (data[beg + 2] == ' ') { i = 3;\n\tif (data[beg + 3] == ' ') return 0; } } }\n\ti += beg;\n\n\t/* id part: anything but a newline between brackets */\n\tif (data[i] != '[') return 0;\n\ti++;\n\tid_offset = i;\n\twhile (i < end && data[i] != '\\n' && data[i] != '\\r' && data[i] != ']')\n\t\ti++;\n\tif (i >= end || data[i] != ']') return 0;\n\tid_end = i;\n\n\t/* spacer: colon (space | tab)* newline? (space | tab)* */\n\ti++;\n\tif (i >= end || data[i] != ':') return 0;\n\ti++;\n\twhile (i < end && data[i] == ' ') i++;\n\tif (i < end && (data[i] == '\\n' || data[i] == '\\r')) {\n\t\ti++;\n\t\tif (i < end && data[i] == '\\r' && data[i - 1] == '\\n') i++; }\n\twhile (i < end && data[i] == ' ') i++;\n\tif (i >= end) return 0;\n\n\t/* link: whitespace-free sequence, optionally between angle brackets */\n\tif (data[i] == '<')\n\t\ti++;\n\n\tlink_offset = i;\n\n\twhile (i < end && data[i] != ' ' && data[i] != '\\n' && data[i] != '\\r')\n\t\ti++;\n\n\tif (data[i - 1] == '>') link_end = i - 1;\n\telse link_end = i;\n\n\t/* optional spacer: (space | tab)* (newline | '\\'' | '\"' | '(' ) */\n\twhile (i < end && data[i] == ' ') i++;\n\tif (i < end && data[i] != '\\n' && data[i] != '\\r'\n\t\t\t&& data[i] != '\\'' && data[i] != '\"' && data[i] != '(')\n\t\treturn 0;\n\tline_end = 0;\n\t/* computing end-of-line */\n\tif (i >= end || data[i] == '\\r' || data[i] == '\\n') line_end = i;\n\tif (i + 1 < end && data[i] == '\\n' && data[i + 1] == '\\r')\n\t\tline_end = i + 1;\n\n\t/* optional (space|tab)* spacer after a newline */\n\tif (line_end) {\n\t\ti = line_end + 1;\n\t\twhile (i < end && data[i] == ' ') i++; }\n\n\t/* optional title: any non-newline sequence enclosed in '\"()\n\t\t\t\t\talone on its line */\n\ttitle_offset = title_end = 0;\n\tif (i + 1 < end\n\t&& (data[i] == '\\'' || data[i] == '\"' || data[i] == '(')) {\n\t\ti++;\n\t\ttitle_offset = i;\n\t\t/* looking for EOL */\n\t\twhile (i < end && data[i] != '\\n' && data[i] != '\\r') i++;\n\t\tif (i + 1 < end && data[i] == '\\n' && data[i + 1] == '\\r')\n\t\t\ttitle_end = i + 1;\n\t\telse\ttitle_end = i;\n\t\t/* stepping back */\n\t\ti -= 1;\n\t\twhile (i > title_offset && data[i] == ' ')\n\t\t\ti -= 1;\n\t\tif (i > title_offset\n\t\t&& (data[i] == '\\'' || data[i] == '\"' || data[i] == ')')) {\n\t\t\tline_end = title_end;\n\t\t\ttitle_end = i; } }\n\n\tif (!line_end || link_end == link_offset)\n\t\treturn 0; /* garbage after the link empty link */\n\n\t/* a valid ref has been found, filling-in return structures */\n\tif (last)\n\t\t*last = line_end;\n\n\tif (refs) {\n\t\tstruct link_ref *ref;\n\n\t\tref = add_link_ref(refs, data + id_offset, id_end - id_offset);\n\t\tif (!ref)\n\t\t\treturn 0;\n\n\t\tref->link = bufnew(link_end - link_offset);\n\t\tbufput(ref->link, data + link_offset, link_end - link_offset);\n\n\t\tif (title_end > title_offset) {\n\t\t\tref->title = bufnew(title_end - title_offset);\n\t\t\tbufput(ref->title, data + title_offset, title_end - title_offset);\n\t\t}\n\t}\n\n\treturn 1;\n}\n\nstatic void expand_tabs(struct buf *ob, const uint8_t *line, size_t size)\n{\n\tsize_t i = 0, tab = 0;\n\n\twhile (i < size) {\n\t\tsize_t org = i;\n\n\t\twhile (i < size && line[i] != '\\t') {\n\t\t\ti++; tab++;\n\t\t}\n\n\t\tif (i > org)\n\t\t\tbufput(ob, line + org, i - org);\n\n\t\tif (i >= size)\n\t\t\tbreak;\n\n\t\tdo {\n\t\t\tbufputc(ob, ' '); tab++;\n\t\t} while (tab % 4);\n\n\t\ti++;\n\t}\n}\n\n/**********************\n * EXPORTED FUNCTIONS *\n **********************/\n\nstruct sd_markdown *\nsd_markdown_new(\n\tunsigned int extensions,\n\tsize_t max_nesting,\n\tconst struct sd_callbacks *callbacks,\n\tvoid *opaque)\n{\n\tstruct sd_markdown *md = NULL;\n\n\tassert(max_nesting > 0 && callbacks);\n\n\tmd = malloc(sizeof(struct sd_markdown));\n\tif (!md)\n\t\treturn NULL;\n\n\tmemcpy(&md->cb, callbacks, sizeof(struct sd_callbacks));\n\n\tstack_init(&md->work_bufs[BUFFER_BLOCK], 4);\n\tstack_init(&md->work_bufs[BUFFER_SPAN], 8);\n\n\tmemset(md->active_char, 0x0, 256);\n\n\tif (md->cb.emphasis || md->cb.double_emphasis || md->cb.triple_emphasis) {\n\t\tmd->active_char['*'] = MD_CHAR_EMPHASIS;\n\t\tmd->active_char['_'] = MD_CHAR_EMPHASIS;\n\t\tif (extensions & MKDEXT_STRIKETHROUGH)\n\t\t\tmd->active_char['~'] = MD_CHAR_EMPHASIS;\n\t}\n\n\tif (md->cb.codespan)\n\t\tmd->active_char['`'] = MD_CHAR_CODESPAN;\n\n\tif (md->cb.linebreak)\n\t\tmd->active_char['\\n'] = MD_CHAR_LINEBREAK;\n\n\tif (md->cb.image || md->cb.link)\n\t\tmd->active_char['['] = MD_CHAR_LINK;\n\n\tmd->active_char['<'] = MD_CHAR_LANGLE;\n\tmd->active_char['\\\\'] = MD_CHAR_ESCAPE;\n\tmd->active_char['&'] = MD_CHAR_ENTITITY;\n\n\tif (extensions & MKDEXT_AUTOLINK) {\n\t\tmd->active_char[':'] = MD_CHAR_AUTOLINK_URL;\n\t\tmd->active_char['@'] = MD_CHAR_AUTOLINK_EMAIL;\n\t\tmd->active_char['w'] = MD_CHAR_AUTOLINK_WWW;\n\t}\n\n\tif (extensions & MKDEXT_SUPERSCRIPT)\n\t\tmd->active_char['^'] = MD_CHAR_SUPERSCRIPT;\n\n\t/* Extension data */\n\tmd->ext_flags = extensions;\n\tmd->opaque = opaque;\n\tmd->max_nesting = max_nesting;\n\tmd->in_link_body = 0;\n\n\treturn md;\n}\n\nvoid\nsd_markdown_render(struct buf *ob, const uint8_t *document, size_t doc_size, struct sd_markdown *md)\n{\n#define MARKDOWN_GROW(x) ((x) + ((x) >> 1))\n\tstatic const char UTF8_BOM[] = {0xEF, 0xBB, 0xBF};\n\n\tstruct buf *text;\n\tsize_t beg, end;\n\n\ttext = bufnew(64);\n\tif (!text)\n\t\treturn;\n\n\t/* Preallocate enough space for our buffer to avoid expanding while copying */\n\tbufgrow(text, doc_size);\n\n\t/* reset the references table */\n\tmemset(&md->refs, 0x0, REF_TABLE_SIZE * sizeof(void *));\n\n\t/* first pass: looking for references, copying everything else */\n\tbeg = 0;\n\n\t/* Skip a possible UTF-8 BOM, even though the Unicode standard\n\t * discourages having these in UTF-8 documents */\n\tif (doc_size >= 3 && memcmp(document, UTF8_BOM, 3) == 0)\n\t\tbeg += 3;\n\n\twhile (beg < doc_size) /* iterating over lines */\n\t\tif (is_ref(document, beg, doc_size, &end, md->refs))\n\t\t\tbeg = end;\n\t\telse { /* skipping to the next line */\n\t\t\tend = beg;\n\t\t\twhile (end < doc_size && document[end] != '\\n' && document[end] != '\\r')\n\t\t\t\tend++;\n\n\t\t\t/* adding the line body if present */\n\t\t\tif (end > beg)\n\t\t\t\texpand_tabs(text, document + beg, end - beg);\n\n\t\t\twhile (end < doc_size && (document[end] == '\\n' || document[end] == '\\r')) {\n\t\t\t\t/* add one \\n per newline */\n\t\t\t\tif (document[end] == '\\n' || (end + 1 < doc_size && document[end + 1] != '\\n'))\n\t\t\t\t\tbufputc(text, '\\n');\n\t\t\t\tend++;\n\t\t\t}\n\n\t\t\tbeg = end;\n\t\t}\n\n\t/* pre-grow the output buffer to minimize allocations */\n\tbufgrow(ob, MARKDOWN_GROW(text->size));\n\n\t/* second pass: actual rendering */\n\tif (md->cb.doc_header)\n\t\tmd->cb.doc_header(ob, md->opaque);\n\n\tif (text->size) {\n\t\t/* adding a final newline if not already present */\n\t\tif (text->data[text->size - 1] != '\\n' && text->data[text->size - 1] != '\\r')\n\t\t\tbufputc(text, '\\n');\n\n\t\tparse_block(ob, md, text->data, text->size);\n\t}\n\n\tif (md->cb.doc_footer)\n\t\tmd->cb.doc_footer(ob, md->opaque);\n\n\t/* clean-up */\n\tbufrelease(text);\n\tfree_link_refs(md->refs);\n\n\tassert(md->work_bufs[BUFFER_SPAN].size == 0);\n\tassert(md->work_bufs[BUFFER_BLOCK].size == 0);\n}\n\nvoid\nsd_markdown_free(struct sd_markdown *md)\n{\n\tsize_t i;\n\n\tfor (i = 0; i < (size_t)md->work_bufs[BUFFER_SPAN].asize; ++i)\n\t\tbufrelease(md->work_bufs[BUFFER_SPAN].item[i]);\n\n\tfor (i = 0; i < (size_t)md->work_bufs[BUFFER_BLOCK].asize; ++i)\n\t\tbufrelease(md->work_bufs[BUFFER_BLOCK].item[i]);\n\n\tstack_free(&md->work_bufs[BUFFER_SPAN]);\n\tstack_free(&md->work_bufs[BUFFER_BLOCK]);\n\n\tfree(md);\n}\n\nvoid\nsd_version(int *ver_major, int *ver_minor, int *ver_revision)\n{\n\t*ver_major = SUNDOWN_VER_MAJOR;\n\t*ver_minor = SUNDOWN_VER_MINOR;\n\t*ver_revision = SUNDOWN_VER_REVISION;\n}\n\n/* vim: set filetype=c: */\n" }, { "path": "src/test/resources/samples/langs/C/multiboot.h", "content": "#pragma once\n\n/* Copyright © 2010, 2011 Lukas Martini\n *\n * This file is part of Xelix.\n *\n * Xelix 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 * Xelix 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 Xelix. If not, see .\n */\n\n#include \n\n#define MULTIBOOT_KERNELMAGIC 0x2BADB002\n\n#define MULTIBOOT_FLAG_MEM\t 0x001\n#define MULTIBOOT_FLAG_DEVICE 0x002\n#define MULTIBOOT_FLAG_CMDLINE 0x004\n#define MULTIBOOT_FLAG_MODS\t0x008\n#define MULTIBOOT_FLAG_AOUT\t0x010\n#define MULTIBOOT_FLAG_ELF\t 0x020\n#define MULTIBOOT_FLAG_MMAP\t0x040\n#define MULTIBOOT_FLAG_CONFIG 0x080\n#define MULTIBOOT_FLAG_LOADER 0x100\n#define MULTIBOOT_FLAG_APM\t 0x200\n#define MULTIBOOT_FLAG_VBE\t 0x400\n\n// The symbol table for a.out.\ntypedef struct\n{\n\tuint32_t\t tabSize;\n\tuint32_t \tstrSize;\n\tuint32_t \taddr;\n\tuint32_t \treserved;\n} __attribute__((packed)) multiboot_aoutSymbolTable_t;\n \n// The section header table for ELF.\ntypedef struct\n{\n\tuint32_t\t num;\n\tuint32_t\t size;\n\tuint32_t \taddr;\n\tuint32_t\t shndx;\n} __attribute__((packed)) multiboot_elfSectionHeaderTable_t;\n\ntypedef struct\n{\n\tuint32_t\tsize;\n\tuint64_t\taddr;\n\tuint64_t\tlength;\n\tuint32_t\ttype;\n} __attribute__((packed)) multiboot_memoryMap_t;\n\ntypedef struct\n{\n\tuint32_t\tstart;\n\tuint32_t\tend;\n\tchar*\t\tcmdLine;\n\tuint32_t\treserved;\n} __attribute__((packed)) multiboot_module_t;\n\ntypedef struct\n{\n\tuint32_t\tflags;\n\tuint32_t\tmemLower;\n\tuint32_t\tmemUpper;\n\tuint32_t\tbootDevice;\n\tchar*\tcmdLine;\n\tuint32_t\tmodsCount;\n\tmultiboot_module_t*\tmodsAddr;\n\n\tunion\n\t{\n\t\tmultiboot_aoutSymbolTable_t aoutSym;\n\t\tmultiboot_elfSectionHeaderTable_t elfSec;\n\t} u;\n\t\n\tuint32_t\tmmapLength;\n\tuint32_t\tmmapAddr;\n\t\n\tuint32_t drivesLength;\n\tuint32_t drivesAddr;\n\t\n\t// ROM configuration table\n\tuint32_t configTable;\n\t\n\tchar* bootLoaderName;\n\tuint32_t apmTable;\n\t\n\t// Video\n\tuint32_t vbeControlInfo;\n\tuint32_t vbeModeInfo;\n\tuint16_t vbeMode;\n\tuint16_t vbeInterfaceSeg;\n\tuint16_t vbeInterfaceOff;\n\tuint16_t vbeInterfaceLen;\n} __attribute__((packed)) multiboot_info_t;\n\nmultiboot_info_t* multiboot_info;\n\nvoid arch_multiboot_printInfo();\n" }, { "path": "src/test/resources/samples/langs/C/ntru_encrypt.h", "content": "/*\n * Copyright (C) 2014 FH Bielefeld\n *\n * This file is part of a FH Bielefeld project.\n *\n * This library is free software; you can redistribute it and/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library 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 GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,\n * MA 02110-1301 USA\n */\n\n/**\n * @file ntru_encrypt.h\n * Header for the internal API of ntru_encrypt.c.\n * @brief header for encrypt.c\n */\n\n#ifndef PQC_ENCRYPT_H\n#define PQC_ENCRYPT_H\n\n\n#include \"ntru_params.h\"\n#include \"ntru_poly.h\"\n#include \"ntru_string.h\"\n\n#include \n#include \n\n\n/**\n * encrypt the msg, using the math:\n * e = (h ∗ r) + m (mod q)\n *\n * e = the encrypted poly\n *\n * h = the public key\n *\n * r = the random poly\n *\n * m = the message poly\n *\n * q = large mod\n *\n * @param msg_tern the message to encrypt, in ternary format\n * @param pub_key the public key\n * @param rnd the random poly (should have relatively small\n * coefficients, but not restricted to {-1, 0, 1})\n * @param out the output poly which is in the range {0, q-1}\n * (not ternary!) [out]\n * @param params ntru_params the ntru context\n */\nvoid\nntru_encrypt_poly(\n\t\tconst fmpz_poly_t msg_tern,\n\t\tconst fmpz_poly_t pub_key,\n\t\tconst fmpz_poly_t rnd,\n\t\tfmpz_poly_t out,\n\t\tconst ntru_params *params);\n\n/**\n * Encrypt a message in the form of a null-terminated char array and\n * return a string.\n *\n * @param msg the message\n * @param pub_key the public key\n * @param rnd the random poly (should have relatively small\n * coefficients, but not restricted to {-1, 0, 1})\n * @param params ntru_params the ntru context\n * @return the newly allocated encrypted string\n */\nstring *\nntru_encrypt_string(\n\t\tconst string *msg,\n\t\tconst fmpz_poly_t pub_key,\n\t\tconst fmpz_poly_t rnd,\n\t\tconst ntru_params *params);\n\n\n#endif /* PQC_ENCRYPT_H */\n" }, { "path": "src/test/resources/samples/langs/C/portio.h", "content": "#pragma once\n\n/* Copyright © 2011 Lukas Martini\n *\n * This file is part of Xelix.\n *\n * Xelix 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 * Xelix 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 Xelix. If not, see .\n */\n\n#include \n#include \n\n// Legacy\n#define outb(args...) portio_out8(args)\n#define outw(args...) portio_out16(args)\n#define outl(args...) portio_out32(args)\n#define outq(args...) portio_out64(args)\n\n#define inb(args...) portio_in8(args)\n#define inw(args...) portio_in16(args)\n#define inl(args...) portio_in32(args)\n#define inq(args...) portio_in64(args)\n\nvoid portio_out8(uint16_t port, uint8_t value);\nvoid portio_out16(uint16_t port, uint16_t value);\nvoid portio_out32(uint16_t port, uint32_t value);\nvoid portio_out64(uint16_t port, uint64_t value);\n\nuint8_t portio_in8(uint16_t port);\nuint16_t portio_in16(uint16_t port);\nuint32_t portio_in32(uint16_t port);\nuint64_t portio_in64(uint16_t port);\n" }, { "path": "src/test/resources/samples/langs/C/pqiv.h", "content": "/**\n * pqiv\n *\n * Copyright (c) 2013-2014, Phillip Berndt\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 * 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 * You should have received a copy of the GNU General Public License\n * along with this program. If not, see .\n *\n */\n\n// This file contains the definition of files, image types and\n// the plugin infrastructure. It should be included in file type\n// handlers.\n\n#ifndef _PQIV_H_INCLUDED\n#define _PQIV_H_INCLUDED\n\n#include \n#include \n#include \n#include \"lib/bostree.h\"\n\n#ifndef PQIV_VERSION\n#define PQIV_VERSION \"2.3\"\n#endif\n\n#define FILE_FLAGS_ANIMATION (guint)(1)\n#define FILE_FLAGS_MEMORY_IMAGE (guint)(1<<1)\n\n// The structure for images {{{\ntypedef struct file_type_handler_struct_t file_type_handler_t;\ntypedef struct {\n\t// File type\n\tconst file_type_handler_t *file_type;\n\n\t// Special flags\n\t// FILE_FLAGS_ANIMATION -> Animation functions are invoked\n\t// Set by file type handlers\n\t// FILE_FLAGS_MEMORY_IMAGE -> File lives in memory\n\tguint file_flags;\n\n\t// The file name to display and to sort by\n\tgchar *display_name;\n\n\t// The URI or file name of the file\n\tgchar *file_name;\n\n\t// If the file is a memory image, the actual image data\n\tGBytes *file_data;\n\n\t// The file monitor structure is used for inotify-watching of\n\t// the files\n\tGFileMonitor *file_monitor;\n\n\t// This flag stores whether this image is currently loaded\n\t// and valid. i.e. if it is set, you can assume that\n\t// private_data contains a representation of the image;\n\t// if not, you can NOT assume that it does not.\n\tgboolean is_loaded;\n\n\t// Cached image size\n\tguint width;\n\tguint height;\n\n\t// File-type specific data, allocated and freed by the file type handlers\n\tvoid *private;\n} file_t;\n// }}}\n// Definition of the built-in file types {{{\n\n// If you want to implement your own file type, you'll have to implement the\n// following functions and a non-static initialization function named\n// file_type_NAME_initializer that fills a file_type_handler_t with pointers to\n// the functions. Store the file in backends/NAME.c and adjust the Makefile to\n// add the required libraries if your backend is listed in the $(BACKENDS)\n// variable.\n\ntypedef enum { PARAMETER, RECURSION, INOTIFY, BROWSE_ORIGINAL_PARAMETER, FILTER_OUTPUT } load_images_state_t;\n// Allocation function: Allocate the ->private structure within a file and add the\n// image(s) to the list of available images via load_images_handle_parameter_add_file()\n// If an image is not to be loaded for any reason, the file structure should be\n// deallocated using file_free()\n// Returns a pointer to the first added image\n// Optional, you can also set the pointer to this function to NULL.\ntypedef BOSNode *(*file_type_alloc_fn_t)(load_images_state_t state, file_t *file);\n\n// Deallocation, if a file is removed from the images list. Free the ->private structure.\n// Only called if ->private is non-NULL.\ntypedef void (*file_type_free_fn_t)(file_t *file);\n\n// Actually load a file into memory\ntypedef void (*file_type_load_fn_t)(file_t *file, GInputStream *data, GError **error_pointer);\n\n// Unload a file\ntypedef void (*file_type_unload_fn_t)(file_t *file);\n\n// Animation support: Initialize memory for animations, return ms until first frame\n// Optional, you can also set the pointer to this function to NULL.\ntypedef double (*file_type_animation_initialize_fn_t)(file_t *file);\n\n// Animation support: Advance to the next frame, return ms until next frame\n// Optional, you can also set the pointer to this function to NULL.\ntypedef double (*file_type_animation_next_frame_fn_t)(file_t *file);\n\n// Draw the current view to a cairo context\ntypedef void (*file_type_draw_fn_t)(file_t *file, cairo_t *cr);\n\nstruct file_type_handler_struct_t {\n\t// All files will be filtered with this filter. If it lets it pass,\n\t// a handler is assigned to a file. If none do, the file is\n\t// discarded if it was found during directory traversal or\n\t// loaded using the first image backend if it was an explicit\n\t// parameter.\n\tGtkFileFilter *file_types_handled;\n\n\t// Pointers to the functions defined above\n\tfile_type_alloc_fn_t alloc_fn;\n\tfile_type_free_fn_t free_fn;\n\tfile_type_load_fn_t load_fn;\n\tfile_type_unload_fn_t unload_fn;\n\tfile_type_animation_initialize_fn_t animation_initialize_fn;\n\tfile_type_animation_next_frame_fn_t animation_next_frame_fn;\n\tfile_type_draw_fn_t draw_fn;\n};\n\n// Initialization function: Tell pqiv about a backend\ntypedef void (*file_type_initializer_fn_t)(file_type_handler_t *info);\n\n// pqiv symbols available to plugins {{{\n\n// Global cancellable that should be used for every i/o operation\nextern GCancellable *image_loader_cancellable;\n\n// Current scale level. For backends that don't support cairo natively.\nextern gdouble current_scale_level;\n\n// Load a file from disc/memory/network\nGInputStream *image_loader_stream_file(file_t *file, GError **error_pointer);\n\n// Add a file to the list of loaded files\n// Should be called at least once in a file_type_alloc_fn_t, with the state being\n// forwarded unaltered.\nBOSNode *load_images_handle_parameter_add_file(load_images_state_t state, file_t *file);\n\n// Load all data from an input stream into memory, conveinience function\nGBytes *g_input_stream_read_completely(GInputStream *input_stream, GCancellable *cancellable, GError **error_pointer);\n\n// Free a file\nvoid file_free(file_t *file);\n\n// }}}\n\n// File type handlers, used in the initializer and file type guessing\nextern file_type_handler_t file_type_handlers[];\n\n/* }}} */\n\n#endif\n" }, { "path": "src/test/resources/samples/langs/C/process.c", "content": "/* Copyright Joyent, Inc. and other Node contributors. All rights reserved.\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 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\n#include \"uv.h\"\n#include \"internal.h\"\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#ifdef __APPLE__\n# include \n#endif\n\n#if defined(__APPLE__) && !TARGET_OS_IPHONE\n# include \n# define environ (*_NSGetEnviron())\n#else\nextern char **environ;\n#endif\n\n\nstatic void uv__chld(EV_P_ ev_child* watcher, int revents) {\n int status = watcher->rstatus;\n int exit_status = 0;\n int term_signal = 0;\n uv_process_t *process = watcher->data;\n\n assert(&process->child_watcher == watcher);\n assert(revents & EV_CHILD);\n\n ev_child_stop(EV_A_ &process->child_watcher);\n\n if (WIFEXITED(status)) {\n exit_status = WEXITSTATUS(status);\n }\n\n if (WIFSIGNALED(status)) {\n term_signal = WTERMSIG(status);\n }\n\n if (process->exit_cb) {\n process->exit_cb(process, exit_status, term_signal);\n }\n}\n\n\nint uv__make_socketpair(int fds[2], int flags) {\n#ifdef SOCK_NONBLOCK\n int fl;\n\n fl = SOCK_CLOEXEC;\n\n if (flags & UV__F_NONBLOCK)\n fl |= SOCK_NONBLOCK;\n\n if (socketpair(AF_UNIX, SOCK_STREAM|fl, 0, fds) == 0)\n return 0;\n\n if (errno != EINVAL)\n return -1;\n\n /* errno == EINVAL so maybe the kernel headers lied about\n * the availability of SOCK_NONBLOCK. This can happen if people\n * build libuv against newer kernel headers than the kernel\n * they actually run the software on.\n */\n#endif\n\n if (socketpair(AF_UNIX, SOCK_STREAM, 0, fds))\n return -1;\n\n uv__cloexec(fds[0], 1);\n uv__cloexec(fds[1], 1);\n\n if (flags & UV__F_NONBLOCK) {\n uv__nonblock(fds[0], 1);\n uv__nonblock(fds[1], 1);\n }\n\n return 0;\n}\n\n\nint uv__make_pipe(int fds[2], int flags) {\n#if __linux__\n int fl;\n\n fl = UV__O_CLOEXEC;\n\n if (flags & UV__F_NONBLOCK)\n fl |= UV__O_NONBLOCK;\n\n if (uv__pipe2(fds, fl) == 0)\n return 0;\n\n if (errno != ENOSYS)\n return -1;\n#endif\n\n if (pipe(fds))\n return -1;\n\n uv__cloexec(fds[0], 1);\n uv__cloexec(fds[1], 1);\n\n if (flags & UV__F_NONBLOCK) {\n uv__nonblock(fds[0], 1);\n uv__nonblock(fds[1], 1);\n }\n\n return 0;\n}\n\n\n/*\n * Used for initializing stdio streams like options.stdin_stream. Returns\n * zero on success.\n */\nstatic int uv__process_init_stdio(uv_stdio_container_t* container, int fds[2],\n int writable) {\n int fd = -1;\n switch (container->flags & (UV_IGNORE | UV_CREATE_PIPE | UV_INHERIT_FD |\n UV_INHERIT_STREAM)) {\n case UV_IGNORE:\n return 0;\n case UV_CREATE_PIPE:\n assert(container->data.stream != NULL);\n\n if (container->data.stream->type != UV_NAMED_PIPE) {\n errno = EINVAL;\n return -1;\n }\n\n return uv__make_socketpair(fds, 0);\n case UV_INHERIT_FD:\n case UV_INHERIT_STREAM:\n if (container->flags & UV_INHERIT_FD) {\n fd = container->data.fd;\n } else {\n fd = container->data.stream->fd;\n }\n\n if (fd == -1) {\n errno = EINVAL;\n return -1;\n }\n\n fds[writable ? 1 : 0] = fd;\n\n return 0;\n default:\n assert(0 && \"Unexpected flags\");\n return -1;\n }\n}\n\n\nstatic int uv__process_stdio_flags(uv_stdio_container_t* container,\n int writable) {\n if (container->data.stream->type == UV_NAMED_PIPE &&\n ((uv_pipe_t*)container->data.stream)->ipc) {\n return UV_STREAM_READABLE | UV_STREAM_WRITABLE;\n } else if (writable) {\n return UV_STREAM_WRITABLE;\n } else {\n return UV_STREAM_READABLE;\n }\n}\n\n\nstatic int uv__process_open_stream(uv_stdio_container_t* container, int fds[2],\n int writable) {\n int fd = fds[writable ? 1 : 0];\n int child_fd = fds[writable ? 0 : 1];\n int flags;\n\n /* No need to create stream */\n if (!(container->flags & UV_CREATE_PIPE) || fd < 0) {\n return 0;\n }\n\n assert(child_fd >= 0);\n close(child_fd);\n\n uv__nonblock(fd, 1);\n flags = uv__process_stdio_flags(container, writable);\n\n return uv__stream_open((uv_stream_t*)container->data.stream, fd, flags);\n}\n\n\nstatic void uv__process_close_stream(uv_stdio_container_t* container) {\n if (!(container->flags & UV_CREATE_PIPE)) return;\n\n uv__stream_close((uv_stream_t*)container->data.stream);\n}\n\n\nstatic void uv__process_child_init(uv_process_options_t options,\n int stdio_count,\n int* pipes) {\n int i;\n\n if (options.flags & UV_PROCESS_DETACHED) {\n setsid();\n }\n\n /* Dup fds */\n for (i = 0; i < stdio_count; i++) {\n /*\n * stdin has swapped ends of pipe\n * (it's the only one readable stream)\n */\n int close_fd = i == 0 ? pipes[i * 2 + 1] : pipes[i * 2];\n int use_fd = i == 0 ? pipes[i * 2] : pipes[i * 2 + 1];\n\n if (use_fd >= 0) {\n close(close_fd);\n } else if (i < 3) {\n /* `/dev/null` stdin, stdout, stderr even if they've flag UV_IGNORE */\n use_fd = open(\"/dev/null\", i == 0 ? O_RDONLY : O_RDWR);\n\n if (use_fd < 0) {\n perror(\"failed to open stdio\");\n _exit(127);\n }\n } else {\n continue;\n }\n\n if (i != use_fd) {\n dup2(use_fd, i);\n close(use_fd);\n }\n }\n\n if (options.cwd && chdir(options.cwd)) {\n perror(\"chdir()\");\n _exit(127);\n }\n\n if ((options.flags & UV_PROCESS_SETGID) && setgid(options.gid)) {\n perror(\"setgid()\");\n _exit(127);\n }\n\n if ((options.flags & UV_PROCESS_SETUID) && setuid(options.uid)) {\n perror(\"setuid()\");\n _exit(127);\n }\n\n environ = options.env;\n\n execvp(options.file, options.args);\n perror(\"execvp()\");\n _exit(127);\n}\n\n\n#ifndef SPAWN_WAIT_EXEC\n# define SPAWN_WAIT_EXEC 1\n#endif\n\nint uv_spawn(uv_loop_t* loop, uv_process_t* process,\n uv_process_options_t options) {\n /*\n * Save environ in the case that we get it clobbered\n * by the child process.\n */\n char** save_our_env = environ;\n\n int stdio_count = options.stdio_count < 3 ? 3 : options.stdio_count;\n int* pipes = malloc(2 * stdio_count * sizeof(int));\n\n#if SPAWN_WAIT_EXEC\n int signal_pipe[2] = { -1, -1 };\n struct pollfd pfd;\n#endif\n int status;\n pid_t pid;\n int i;\n\n if (pipes == NULL) {\n errno = ENOMEM;\n goto error;\n }\n\n assert(options.file != NULL);\n assert(!(options.flags & ~(UV_PROCESS_WINDOWS_VERBATIM_ARGUMENTS |\n UV_PROCESS_DETACHED |\n UV_PROCESS_SETGID |\n UV_PROCESS_SETUID)));\n\n\n uv__handle_init(loop, (uv_handle_t*)process, UV_PROCESS);\n loop->counters.process_init++;\n uv__handle_start(process);\n\n process->exit_cb = options.exit_cb;\n\n /* Init pipe pairs */\n for (i = 0; i < stdio_count; i++) {\n pipes[i * 2] = -1;\n pipes[i * 2 + 1] = -1;\n }\n\n /* Create socketpairs/pipes, or use raw fd */\n for (i = 0; i < options.stdio_count; i++) {\n if (uv__process_init_stdio(&options.stdio[i], pipes + i * 2, i != 0)) {\n goto error;\n }\n }\n\n /* This pipe is used by the parent to wait until\n * the child has called `execve()`. We need this\n * to avoid the following race condition:\n *\n * if ((pid = fork()) > 0) {\n * kill(pid, SIGTERM);\n * }\n * else if (pid == 0) {\n * execve(\"/bin/cat\", argp, envp);\n * }\n *\n * The parent sends a signal immediately after forking.\n * Since the child may not have called `execve()` yet,\n * there is no telling what process receives the signal,\n * our fork or /bin/cat.\n *\n * To avoid ambiguity, we create a pipe with both ends\n * marked close-on-exec. Then, after the call to `fork()`,\n * the parent polls the read end until it sees POLLHUP.\n */\n#if SPAWN_WAIT_EXEC\n if (uv__make_pipe(signal_pipe, UV__F_NONBLOCK))\n goto error;\n#endif\n\n pid = fork();\n\n if (pid == -1) {\n#if SPAWN_WAIT_EXEC\n close(signal_pipe[0]);\n close(signal_pipe[1]);\n#endif\n environ = save_our_env;\n goto error;\n }\n\n if (pid == 0) {\n /* Child */\n uv__process_child_init(options, stdio_count, pipes);\n\n /* Execution never reaches here. */\n }\n\n /* Parent. */\n\n /* Restore environment. */\n environ = save_our_env;\n\n#if SPAWN_WAIT_EXEC\n /* POLLHUP signals child has exited or execve()'d. */\n close(signal_pipe[1]);\n do {\n pfd.fd = signal_pipe[0];\n pfd.events = POLLIN|POLLHUP;\n pfd.revents = 0;\n errno = 0, status = poll(&pfd, 1, -1);\n }\n while (status == -1 && (errno == EINTR || errno == ENOMEM));\n\n assert((status == 1) && \"poll() on pipe read end failed\");\n close(signal_pipe[0]);\n#endif\n\n process->pid = pid;\n\n ev_child_init(&process->child_watcher, uv__chld, pid, 0);\n ev_child_start(process->loop->ev, &process->child_watcher);\n process->child_watcher.data = process;\n\n for (i = 0; i < options.stdio_count; i++) {\n if (uv__process_open_stream(&options.stdio[i], pipes + i * 2, i == 0)) {\n int j;\n /* Close all opened streams */\n for (j = 0; j < i; j++) {\n uv__process_close_stream(&options.stdio[j]);\n }\n\n goto error;\n }\n }\n\n free(pipes);\n\n return 0;\n\nerror:\n uv__set_sys_error(process->loop, errno);\n\n for (i = 0; i < stdio_count; i++) {\n close(pipes[i * 2]);\n close(pipes[i * 2 + 1]);\n }\n\n free(pipes);\n\n return -1;\n}\n\n\nint uv_process_kill(uv_process_t* process, int signum) {\n int r = kill(process->pid, signum);\n\n if (r) {\n uv__set_sys_error(process->loop, errno);\n return -1;\n } else {\n return 0;\n }\n}\n\n\nuv_err_t uv_kill(int pid, int signum) {\n int r = kill(pid, signum);\n\n if (r) {\n return uv__new_sys_error(errno);\n } else {\n return uv_ok_;\n }\n}\n\n\nvoid uv__process_close(uv_process_t* handle) {\n ev_child_stop(handle->loop->ev, &handle->child_watcher);\n uv__handle_stop(handle);\n}\n" }, { "path": "src/test/resources/samples/langs/C/rdiscount.c", "content": "#include \n#include \"ruby.h\"\n#include \"mkdio.h\"\n\nstatic VALUE rb_cRDiscount;\n\nstatic VALUE\nrb_rdiscount_to_html(int argc, VALUE *argv, VALUE self)\n{\n /* grab char pointer to markdown input text */\n char *res;\n int szres;\n VALUE encoding;\n VALUE text = rb_funcall(self, rb_intern(\"text\"), 0);\n VALUE buf = rb_str_buf_new(1024);\n Check_Type(text, T_STRING);\n\n int flags = rb_rdiscount__get_flags(self);\n\n MMIOT *doc = mkd_string(RSTRING_PTR(text), RSTRING_LEN(text), flags);\n\n if ( mkd_compile(doc, flags) ) {\n szres = mkd_document(doc, &res);\n\n if ( szres != EOF ) {\n rb_str_cat(buf, res, szres);\n rb_str_cat(buf, \"\\n\", 1);\n }\n }\n mkd_cleanup(doc);\n\n\n /* force the input encoding */\n if ( rb_respond_to(text, rb_intern(\"encoding\")) ) {\n encoding = rb_funcall(text, rb_intern(\"encoding\"), 0);\n rb_funcall(buf, rb_intern(\"force_encoding\"), 1, encoding);\n }\n\n return buf;\n}\n\nstatic VALUE\nrb_rdiscount_toc_content(int argc, VALUE *argv, VALUE self)\n{\n char *res;\n int szres;\n\n int flags = rb_rdiscount__get_flags(self);\n\n /* grab char pointer to markdown input text */\n VALUE text = rb_funcall(self, rb_intern(\"text\"), 0);\n Check_Type(text, T_STRING);\n\n /* allocate a ruby string buffer and wrap it in a stream */\n VALUE buf = rb_str_buf_new(4096);\n\n MMIOT *doc = mkd_string(RSTRING_PTR(text), RSTRING_LEN(text), flags);\n\n if ( mkd_compile(doc, flags) ) {\n szres = mkd_toc(doc, &res);\n\n if ( szres != EOF ) {\n rb_str_cat(buf, res, szres);\n rb_str_cat(buf, \"\\n\", 1);\n }\n }\n mkd_cleanup(doc);\n\n return buf;\n}\n\nint rb_rdiscount__get_flags(VALUE ruby_obj)\n{\n /* compile flags */\n int flags = MKD_TABSTOP | MKD_NOHEADER;\n\n /* smart */\n if ( rb_funcall(ruby_obj, rb_intern(\"smart\"), 0) != Qtrue )\n flags = flags | MKD_NOPANTS;\n\n /* filter_html */\n if ( rb_funcall(ruby_obj, rb_intern(\"filter_html\"), 0) == Qtrue )\n flags = flags | MKD_NOHTML;\n\n /* generate_toc */\n if ( rb_funcall(ruby_obj, rb_intern(\"generate_toc\"), 0) == Qtrue)\n flags = flags | MKD_TOC;\n\n /* no_image */\n if ( rb_funcall(ruby_obj, rb_intern(\"no_image\"), 0) == Qtrue)\n flags = flags | MKD_NOIMAGE;\n\n /* no_links */\n if ( rb_funcall(ruby_obj, rb_intern(\"no_links\"), 0) == Qtrue)\n flags = flags | MKD_NOLINKS;\n\n /* no_tables */\n if ( rb_funcall(ruby_obj, rb_intern(\"no_tables\"), 0) == Qtrue)\n flags = flags | MKD_NOTABLES;\n\n /* strict */\n if ( rb_funcall(ruby_obj, rb_intern(\"strict\"), 0) == Qtrue)\n flags = flags | MKD_STRICT;\n\n /* autolink */\n if ( rb_funcall(ruby_obj, rb_intern(\"autolink\"), 0) == Qtrue)\n flags = flags | MKD_AUTOLINK;\n\n /* safelink */\n if ( rb_funcall(ruby_obj, rb_intern(\"safelink\"), 0) == Qtrue)\n flags = flags | MKD_SAFELINK;\n\n /* no_pseudo_protocols */\n if ( rb_funcall(ruby_obj, rb_intern(\"no_pseudo_protocols\"), 0) == Qtrue)\n flags = flags | MKD_NO_EXT;\n\n\n return flags;\n}\n\n\nvoid Init_rdiscount()\n{\n rb_cRDiscount = rb_define_class(\"RDiscount\", rb_cObject);\n rb_define_method(rb_cRDiscount, \"to_html\", rb_rdiscount_to_html, -1);\n rb_define_method(rb_cRDiscount, \"toc_content\", rb_rdiscount_toc_content, -1);\n}\n\n/* vim: set ts=4 sw=4: */\n" }, { "path": "src/test/resources/samples/langs/C/readline.cats", "content": "/*\n** API in ATS for GNU-readline\n*/\n\n/* ****** ****** */\n\n/*\n** Permission to use, copy, modify, and distribute this software for any\n** purpose with or without fee is hereby granted, provided that the above\n** copyright notice and this permission notice appear in all copies.\n** \n** THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n** WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n** MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n** ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n** WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n** ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n** OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n*/\n\n/* ****** ****** */\n\n#ifndef READLINE_READLINE_CATS\n#define READLINE_READLINE_CATS\n\n/* ****** ****** */\n\n#include \n\n/* ****** ****** */\n//\n#define \\\natscntrb_readline_rl_library_version() ((char*)rl_library_version)\n//\n#define atscntrb_readline_rl_readline_version() (rl_readline_version)\n//\n/* ****** ****** */\n\n#define atscntrb_readline_readline readline\n\n/* ****** ****** */\n\n#endif // ifndef READLINE_READLINE_CATS\n\n/* ****** ****** */\n\n/* end of [readline.cats] */\n" }, { "path": "src/test/resources/samples/langs/C/redis.c", "content": "/*\n * Copyright (c) 2009-2010, Salvatore Sanfilippo \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 met:\n *\n * * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n * * 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 * * Neither the name of Redis nor the names of its contributors may be used\n * to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n */\n\n#include \"redis.h\"\n#include \"slowlog.h\"\n#include \"bio.h\"\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n/* Our shared \"common\" objects */\n\nstruct sharedObjectsStruct shared;\n\n/* Global vars that are actually used as constants. The following double\n * values are used for double on-disk serialization, and are initialized\n * at runtime to avoid strange compiler optimizations. */\n\ndouble R_Zero, R_PosInf, R_NegInf, R_Nan;\n\n/*================================= Globals ================================= */\n\n/* Global vars */\nstruct redisServer server; /* server global state */\nstruct redisCommand *commandTable;\n\n/* Our command table.\n *\n * Every entry is composed of the following fields:\n *\n * name: a string representing the command name.\n * function: pointer to the C function implementing the command.\n * arity: number of arguments, it is possible to use -N to say >= N\n * sflags: command flags as string. See below for a table of flags.\n * flags: flags as bitmask. Computed by Redis using the 'sflags' field.\n * get_keys_proc: an optional function to get key arguments from a command.\n * This is only used when the following three fields are not\n * enough to specify what arguments are keys.\n * first_key_index: first argument that is a key\n * last_key_index: last argument that is a key\n * key_step: step to get all the keys from first to last argument. For instance\n * in MSET the step is two since arguments are key,val,key,val,...\n * microseconds: microseconds of total execution time for this command.\n * calls: total number of calls of this command.\n *\n * The flags, microseconds and calls fields are computed by Redis and should\n * always be set to zero.\n *\n * Command flags are expressed using strings where every character represents\n * a flag. Later the populateCommandTable() function will take care of\n * populating the real 'flags' field using this characters.\n *\n * This is the meaning of the flags:\n *\n * w: write command (may modify the key space).\n * r: read command (will never modify the key space).\n * m: may increase memory usage once called. Don't allow if out of memory.\n * a: admin command, like SAVE or SHUTDOWN.\n * p: Pub/Sub related command.\n * f: force replication of this command, regarless of server.dirty.\n * s: command not allowed in scripts.\n * R: random command. Command is not deterministic, that is, the same command\n * with the same arguments, with the same key space, may have different\n * results. For instance SPOP and RANDOMKEY are two random commands.\n * S: Sort command output array if called from script, so that the output\n * is deterministic.\n */\nstruct redisCommand redisCommandTable[] = {\n {\"get\",getCommand,2,\"r\",0,NULL,1,1,1,0,0},\n {\"set\",setCommand,3,\"wm\",0,noPreloadGetKeys,1,1,1,0,0},\n {\"setnx\",setnxCommand,3,\"wm\",0,noPreloadGetKeys,1,1,1,0,0},\n {\"setex\",setexCommand,4,\"wm\",0,noPreloadGetKeys,1,1,1,0,0},\n {\"psetex\",psetexCommand,4,\"wm\",0,noPreloadGetKeys,1,1,1,0,0},\n {\"append\",appendCommand,3,\"wm\",0,NULL,1,1,1,0,0},\n {\"strlen\",strlenCommand,2,\"r\",0,NULL,1,1,1,0,0},\n {\"del\",delCommand,-2,\"w\",0,noPreloadGetKeys,1,-1,1,0,0},\n {\"exists\",existsCommand,2,\"r\",0,NULL,1,1,1,0,0},\n {\"setbit\",setbitCommand,4,\"wm\",0,NULL,1,1,1,0,0},\n {\"getbit\",getbitCommand,3,\"r\",0,NULL,1,1,1,0,0},\n {\"setrange\",setrangeCommand,4,\"wm\",0,NULL,1,1,1,0,0},\n {\"getrange\",getrangeCommand,4,\"r\",0,NULL,1,1,1,0,0},\n {\"substr\",getrangeCommand,4,\"r\",0,NULL,1,1,1,0,0},\n {\"incr\",incrCommand,2,\"wm\",0,NULL,1,1,1,0,0},\n {\"decr\",decrCommand,2,\"wm\",0,NULL,1,1,1,0,0},\n {\"mget\",mgetCommand,-2,\"r\",0,NULL,1,-1,1,0,0},\n {\"rpush\",rpushCommand,-3,\"wm\",0,NULL,1,1,1,0,0},\n {\"lpush\",lpushCommand,-3,\"wm\",0,NULL,1,1,1,0,0},\n {\"rpushx\",rpushxCommand,3,\"wm\",0,NULL,1,1,1,0,0},\n {\"lpushx\",lpushxCommand,3,\"wm\",0,NULL,1,1,1,0,0},\n {\"linsert\",linsertCommand,5,\"wm\",0,NULL,1,1,1,0,0},\n {\"rpop\",rpopCommand,2,\"w\",0,NULL,1,1,1,0,0},\n {\"lpop\",lpopCommand,2,\"w\",0,NULL,1,1,1,0,0},\n {\"brpop\",brpopCommand,-3,\"ws\",0,NULL,1,1,1,0,0},\n {\"brpoplpush\",brpoplpushCommand,4,\"wms\",0,NULL,1,2,1,0,0},\n {\"blpop\",blpopCommand,-3,\"ws\",0,NULL,1,-2,1,0,0},\n {\"llen\",llenCommand,2,\"r\",0,NULL,1,1,1,0,0},\n {\"lindex\",lindexCommand,3,\"r\",0,NULL,1,1,1,0,0},\n {\"lset\",lsetCommand,4,\"wm\",0,NULL,1,1,1,0,0},\n {\"lrange\",lrangeCommand,4,\"r\",0,NULL,1,1,1,0,0},\n {\"ltrim\",ltrimCommand,4,\"w\",0,NULL,1,1,1,0,0},\n {\"lrem\",lremCommand,4,\"w\",0,NULL,1,1,1,0,0},\n {\"rpoplpush\",rpoplpushCommand,3,\"wm\",0,NULL,1,2,1,0,0},\n {\"sadd\",saddCommand,-3,\"wm\",0,NULL,1,1,1,0,0},\n {\"srem\",sremCommand,-3,\"w\",0,NULL,1,1,1,0,0},\n {\"smove\",smoveCommand,4,\"w\",0,NULL,1,2,1,0,0},\n {\"sismember\",sismemberCommand,3,\"r\",0,NULL,1,1,1,0,0},\n {\"scard\",scardCommand,2,\"r\",0,NULL,1,1,1,0,0},\n {\"spop\",spopCommand,2,\"wRs\",0,NULL,1,1,1,0,0},\n {\"srandmember\",srandmemberCommand,2,\"rR\",0,NULL,1,1,1,0,0},\n {\"sinter\",sinterCommand,-2,\"rS\",0,NULL,1,-1,1,0,0},\n {\"sinterstore\",sinterstoreCommand,-3,\"wm\",0,NULL,1,-1,1,0,0},\n {\"sunion\",sunionCommand,-2,\"rS\",0,NULL,1,-1,1,0,0},\n {\"sunionstore\",sunionstoreCommand,-3,\"wm\",0,NULL,1,-1,1,0,0},\n {\"sdiff\",sdiffCommand,-2,\"rS\",0,NULL,1,-1,1,0,0},\n {\"sdiffstore\",sdiffstoreCommand,-3,\"wm\",0,NULL,1,-1,1,0,0},\n {\"smembers\",sinterCommand,2,\"rS\",0,NULL,1,1,1,0,0},\n {\"zadd\",zaddCommand,-4,\"wm\",0,NULL,1,1,1,0,0},\n {\"zincrby\",zincrbyCommand,4,\"wm\",0,NULL,1,1,1,0,0},\n {\"zrem\",zremCommand,-3,\"w\",0,NULL,1,1,1,0,0},\n {\"zremrangebyscore\",zremrangebyscoreCommand,4,\"w\",0,NULL,1,1,1,0,0},\n {\"zremrangebyrank\",zremrangebyrankCommand,4,\"w\",0,NULL,1,1,1,0,0},\n {\"zunionstore\",zunionstoreCommand,-4,\"wm\",0,zunionInterGetKeys,0,0,0,0,0},\n {\"zinterstore\",zinterstoreCommand,-4,\"wm\",0,zunionInterGetKeys,0,0,0,0,0},\n {\"zrange\",zrangeCommand,-4,\"r\",0,NULL,1,1,1,0,0},\n {\"zrangebyscore\",zrangebyscoreCommand,-4,\"r\",0,NULL,1,1,1,0,0},\n {\"zrevrangebyscore\",zrevrangebyscoreCommand,-4,\"r\",0,NULL,1,1,1,0,0},\n {\"zcount\",zcountCommand,4,\"r\",0,NULL,1,1,1,0,0},\n {\"zrevrange\",zrevrangeCommand,-4,\"r\",0,NULL,1,1,1,0,0},\n {\"zcard\",zcardCommand,2,\"r\",0,NULL,1,1,1,0,0},\n {\"zscore\",zscoreCommand,3,\"r\",0,NULL,1,1,1,0,0},\n {\"zrank\",zrankCommand,3,\"r\",0,NULL,1,1,1,0,0},\n {\"zrevrank\",zrevrankCommand,3,\"r\",0,NULL,1,1,1,0,0},\n {\"hset\",hsetCommand,4,\"wm\",0,NULL,1,1,1,0,0},\n {\"hsetnx\",hsetnxCommand,4,\"wm\",0,NULL,1,1,1,0,0},\n {\"hget\",hgetCommand,3,\"r\",0,NULL,1,1,1,0,0},\n {\"hmset\",hmsetCommand,-4,\"wm\",0,NULL,1,1,1,0,0},\n {\"hmget\",hmgetCommand,-3,\"r\",0,NULL,1,1,1,0,0},\n {\"hincrby\",hincrbyCommand,4,\"wm\",0,NULL,1,1,1,0,0},\n {\"hincrbyfloat\",hincrbyfloatCommand,4,\"wm\",0,NULL,1,1,1,0,0},\n {\"hdel\",hdelCommand,-3,\"w\",0,NULL,1,1,1,0,0},\n {\"hlen\",hlenCommand,2,\"r\",0,NULL,1,1,1,0,0},\n {\"hkeys\",hkeysCommand,2,\"rS\",0,NULL,1,1,1,0,0},\n {\"hvals\",hvalsCommand,2,\"rS\",0,NULL,1,1,1,0,0},\n {\"hgetall\",hgetallCommand,2,\"r\",0,NULL,1,1,1,0,0},\n {\"hexists\",hexistsCommand,3,\"r\",0,NULL,1,1,1,0,0},\n {\"incrby\",incrbyCommand,3,\"wm\",0,NULL,1,1,1,0,0},\n {\"decrby\",decrbyCommand,3,\"wm\",0,NULL,1,1,1,0,0},\n {\"incrbyfloat\",incrbyfloatCommand,3,\"wm\",0,NULL,1,1,1,0,0},\n {\"getset\",getsetCommand,3,\"wm\",0,NULL,1,1,1,0,0},\n {\"mset\",msetCommand,-3,\"wm\",0,NULL,1,-1,2,0,0},\n {\"msetnx\",msetnxCommand,-3,\"wm\",0,NULL,1,-1,2,0,0},\n {\"randomkey\",randomkeyCommand,1,\"rR\",0,NULL,0,0,0,0,0},\n {\"select\",selectCommand,2,\"r\",0,NULL,0,0,0,0,0},\n {\"move\",moveCommand,3,\"w\",0,NULL,1,1,1,0,0},\n {\"rename\",renameCommand,3,\"w\",0,renameGetKeys,1,2,1,0,0},\n {\"renamenx\",renamenxCommand,3,\"w\",0,renameGetKeys,1,2,1,0,0},\n {\"expire\",expireCommand,3,\"w\",0,NULL,1,1,1,0,0},\n {\"expireat\",expireatCommand,3,\"w\",0,NULL,1,1,1,0,0},\n {\"pexpire\",pexpireCommand,3,\"w\",0,NULL,1,1,1,0,0},\n {\"pexpireat\",pexpireatCommand,3,\"w\",0,NULL,1,1,1,0,0},\n {\"keys\",keysCommand,2,\"rS\",0,NULL,0,0,0,0,0},\n {\"dbsize\",dbsizeCommand,1,\"r\",0,NULL,0,0,0,0,0},\n {\"auth\",authCommand,2,\"rs\",0,NULL,0,0,0,0,0},\n {\"ping\",pingCommand,1,\"r\",0,NULL,0,0,0,0,0},\n {\"echo\",echoCommand,2,\"r\",0,NULL,0,0,0,0,0},\n {\"save\",saveCommand,1,\"ars\",0,NULL,0,0,0,0,0},\n {\"bgsave\",bgsaveCommand,1,\"ar\",0,NULL,0,0,0,0,0},\n {\"bgrewriteaof\",bgrewriteaofCommand,1,\"ar\",0,NULL,0,0,0,0,0},\n {\"shutdown\",shutdownCommand,-1,\"ar\",0,NULL,0,0,0,0,0},\n {\"lastsave\",lastsaveCommand,1,\"r\",0,NULL,0,0,0,0,0},\n {\"type\",typeCommand,2,\"r\",0,NULL,1,1,1,0,0},\n {\"multi\",multiCommand,1,\"rs\",0,NULL,0,0,0,0,0},\n {\"exec\",execCommand,1,\"s\",0,NULL,0,0,0,0,0},\n {\"discard\",discardCommand,1,\"rs\",0,NULL,0,0,0,0,0},\n {\"sync\",syncCommand,1,\"ars\",0,NULL,0,0,0,0,0},\n {\"flushdb\",flushdbCommand,1,\"w\",0,NULL,0,0,0,0,0},\n {\"flushall\",flushallCommand,1,\"w\",0,NULL,0,0,0,0,0},\n {\"sort\",sortCommand,-2,\"wmS\",0,NULL,1,1,1,0,0},\n {\"info\",infoCommand,-1,\"r\",0,NULL,0,0,0,0,0},\n {\"monitor\",monitorCommand,1,\"ars\",0,NULL,0,0,0,0,0},\n {\"ttl\",ttlCommand,2,\"r\",0,NULL,1,1,1,0,0},\n {\"pttl\",pttlCommand,2,\"r\",0,NULL,1,1,1,0,0},\n {\"persist\",persistCommand,2,\"w\",0,NULL,1,1,1,0,0},\n {\"slaveof\",slaveofCommand,3,\"as\",0,NULL,0,0,0,0,0},\n {\"debug\",debugCommand,-2,\"as\",0,NULL,0,0,0,0,0},\n {\"config\",configCommand,-2,\"ar\",0,NULL,0,0,0,0,0},\n {\"subscribe\",subscribeCommand,-2,\"rps\",0,NULL,0,0,0,0,0},\n {\"unsubscribe\",unsubscribeCommand,-1,\"rps\",0,NULL,0,0,0,0,0},\n {\"psubscribe\",psubscribeCommand,-2,\"rps\",0,NULL,0,0,0,0,0},\n {\"punsubscribe\",punsubscribeCommand,-1,\"rps\",0,NULL,0,0,0,0,0},\n {\"publish\",publishCommand,3,\"pf\",0,NULL,0,0,0,0,0},\n {\"watch\",watchCommand,-2,\"rs\",0,noPreloadGetKeys,1,-1,1,0,0},\n {\"unwatch\",unwatchCommand,1,\"rs\",0,NULL,0,0,0,0,0},\n {\"cluster\",clusterCommand,-2,\"ar\",0,NULL,0,0,0,0,0},\n {\"restore\",restoreCommand,4,\"awm\",0,NULL,1,1,1,0,0},\n {\"migrate\",migrateCommand,6,\"aw\",0,NULL,0,0,0,0,0},\n {\"asking\",askingCommand,1,\"r\",0,NULL,0,0,0,0,0},\n {\"dump\",dumpCommand,2,\"ar\",0,NULL,1,1,1,0,0},\n {\"object\",objectCommand,-2,\"r\",0,NULL,2,2,2,0,0},\n {\"client\",clientCommand,-2,\"ar\",0,NULL,0,0,0,0,0},\n {\"eval\",evalCommand,-3,\"s\",0,zunionInterGetKeys,0,0,0,0,0},\n {\"evalsha\",evalShaCommand,-3,\"s\",0,zunionInterGetKeys,0,0,0,0,0},\n {\"slowlog\",slowlogCommand,-2,\"r\",0,NULL,0,0,0,0,0},\n {\"script\",scriptCommand,-2,\"ras\",0,NULL,0,0,0,0,0},\n {\"time\",timeCommand,1,\"rR\",0,NULL,0,0,0,0,0},\n {\"bitop\",bitopCommand,-4,\"wm\",0,NULL,2,-1,1,0,0},\n {\"bitcount\",bitcountCommand,-2,\"r\",0,NULL,1,1,1,0,0}\n};\n\n/*============================ Utility functions ============================ */\n\n/* Low level logging. To use only for very big messages, otherwise\n * redisLog() is to prefer. */\nvoid redisLogRaw(int level, const char *msg) {\n const int syslogLevelMap[] = { LOG_DEBUG, LOG_INFO, LOG_NOTICE, LOG_WARNING };\n const char *c = \".-*#\";\n FILE *fp;\n char buf[64];\n int rawmode = (level & REDIS_LOG_RAW);\n\n level &= 0xff; /* clear flags */\n if (level < server.verbosity) return;\n\n fp = (server.logfile == NULL) ? stdout : fopen(server.logfile,\"a\");\n if (!fp) return;\n\n if (rawmode) {\n fprintf(fp,\"%s\",msg);\n } else {\n int off;\n struct timeval tv;\n\n gettimeofday(&tv,NULL);\n off = strftime(buf,sizeof(buf),\"%d %b %H:%M:%S.\",localtime(&tv.tv_sec));\n snprintf(buf+off,sizeof(buf)-off,\"%03d\",(int)tv.tv_usec/1000);\n fprintf(fp,\"[%d] %s %c %s\\n\",(int)getpid(),buf,c[level],msg);\n }\n fflush(fp);\n\n if (server.logfile) fclose(fp);\n\n if (server.syslog_enabled) syslog(syslogLevelMap[level], \"%s\", msg);\n}\n\n/* Like redisLogRaw() but with printf-alike support. This is the funciton that\n * is used across the code. The raw version is only used in order to dump\n * the INFO output on crash. */\nvoid redisLog(int level, const char *fmt, ...) {\n va_list ap;\n char msg[REDIS_MAX_LOGMSG_LEN];\n\n if ((level&0xff) < server.verbosity) return;\n\n va_start(ap, fmt);\n vsnprintf(msg, sizeof(msg), fmt, ap);\n va_end(ap);\n\n redisLogRaw(level,msg);\n}\n\n/* Log a fixed message without printf-alike capabilities, in a way that is\n * safe to call from a signal handler.\n *\n * We actually use this only for signals that are not fatal from the point\n * of view of Redis. Signals that are going to kill the server anyway and\n * where we need printf-alike features are served by redisLog(). */\nvoid redisLogFromHandler(int level, const char *msg) {\n int fd;\n char buf[64];\n\n if ((level&0xff) < server.verbosity ||\n (server.logfile == NULL && server.daemonize)) return;\n fd = server.logfile ?\n open(server.logfile, O_APPEND|O_CREAT|O_WRONLY, 0644) :\n STDOUT_FILENO;\n if (fd == -1) return;\n ll2string(buf,sizeof(buf),getpid());\n if (write(fd,\"[\",1) == -1) goto err;\n if (write(fd,buf,strlen(buf)) == -1) goto err;\n if (write(fd,\" | signal handler] (\",20) == -1) goto err;\n ll2string(buf,sizeof(buf),time(NULL));\n if (write(fd,buf,strlen(buf)) == -1) goto err;\n if (write(fd,\") \",2) == -1) goto err;\n if (write(fd,msg,strlen(msg)) == -1) goto err;\n if (write(fd,\"\\n\",1) == -1) goto err;\nerr:\n if (server.logfile) close(fd);\n}\n\n/* Redis generally does not try to recover from out of memory conditions\n * when allocating objects or strings, it is not clear if it will be possible\n * to report this condition to the client since the networking layer itself\n * is based on heap allocation for send buffers, so we simply abort.\n * At least the code will be simpler to read... */\nvoid oom(const char *msg) {\n redisLog(REDIS_WARNING, \"%s: Out of memory\\n\",msg);\n sleep(1);\n abort();\n}\n\n/* Return the UNIX time in microseconds */\nlong long ustime(void) {\n struct timeval tv;\n long long ust;\n\n gettimeofday(&tv, NULL);\n ust = ((long long)tv.tv_sec)*1000000;\n ust += tv.tv_usec;\n return ust;\n}\n\n/* Return the UNIX time in milliseconds */\nlong long mstime(void) {\n return ustime()/1000;\n}\n\n/* After an RDB dump or AOF rewrite we exit from children using _exit() instead of\n * exit(), because the latter may interact with the same file objects used by\n * the parent process. However if we are testing the coverage normal exit() is\n * used in order to obtain the right coverage information. */\nvoid exitFromChild(int retcode) {\n#ifdef COVERAGE_TEST\n exit(retcode);\n#else\n _exit(retcode);\n#endif\n}\n\n/*====================== Hash table type implementation ==================== */\n\n/* This is an hash table type that uses the SDS dynamic strings libary as\n * keys and radis objects as values (objects can hold SDS strings,\n * lists, sets). */\n\nvoid dictVanillaFree(void *privdata, void *val)\n{\n DICT_NOTUSED(privdata);\n zfree(val);\n}\n\nvoid dictListDestructor(void *privdata, void *val)\n{\n DICT_NOTUSED(privdata);\n listRelease((list*)val);\n}\n\nint dictSdsKeyCompare(void *privdata, const void *key1,\n const void *key2)\n{\n int l1,l2;\n DICT_NOTUSED(privdata);\n\n l1 = sdslen((sds)key1);\n l2 = sdslen((sds)key2);\n if (l1 != l2) return 0;\n return memcmp(key1, key2, l1) == 0;\n}\n\n/* A case insensitive version used for the command lookup table. */\nint dictSdsKeyCaseCompare(void *privdata, const void *key1,\n const void *key2)\n{\n DICT_NOTUSED(privdata);\n\n return strcasecmp(key1, key2) == 0;\n}\n\nvoid dictRedisObjectDestructor(void *privdata, void *val)\n{\n DICT_NOTUSED(privdata);\n\n if (val == NULL) return; /* Values of swapped out keys as set to NULL */\n decrRefCount(val);\n}\n\nvoid dictSdsDestructor(void *privdata, void *val)\n{\n DICT_NOTUSED(privdata);\n\n sdsfree(val);\n}\n\nint dictObjKeyCompare(void *privdata, const void *key1,\n const void *key2)\n{\n const robj *o1 = key1, *o2 = key2;\n return dictSdsKeyCompare(privdata,o1->ptr,o2->ptr);\n}\n\nunsigned int dictObjHash(const void *key) {\n const robj *o = key;\n return dictGenHashFunction(o->ptr, sdslen((sds)o->ptr));\n}\n\nunsigned int dictSdsHash(const void *key) {\n return dictGenHashFunction((unsigned char*)key, sdslen((char*)key));\n}\n\nunsigned int dictSdsCaseHash(const void *key) {\n return dictGenCaseHashFunction((unsigned char*)key, sdslen((char*)key));\n}\n\nint dictEncObjKeyCompare(void *privdata, const void *key1,\n const void *key2)\n{\n robj *o1 = (robj*) key1, *o2 = (robj*) key2;\n int cmp;\n\n if (o1->encoding == REDIS_ENCODING_INT &&\n o2->encoding == REDIS_ENCODING_INT)\n return o1->ptr == o2->ptr;\n\n o1 = getDecodedObject(o1);\n o2 = getDecodedObject(o2);\n cmp = dictSdsKeyCompare(privdata,o1->ptr,o2->ptr);\n decrRefCount(o1);\n decrRefCount(o2);\n return cmp;\n}\n\nunsigned int dictEncObjHash(const void *key) {\n robj *o = (robj*) key;\n\n if (o->encoding == REDIS_ENCODING_RAW) {\n return dictGenHashFunction(o->ptr, sdslen((sds)o->ptr));\n } else {\n if (o->encoding == REDIS_ENCODING_INT) {\n char buf[32];\n int len;\n\n len = ll2string(buf,32,(long)o->ptr);\n return dictGenHashFunction((unsigned char*)buf, len);\n } else {\n unsigned int hash;\n\n o = getDecodedObject(o);\n hash = dictGenHashFunction(o->ptr, sdslen((sds)o->ptr));\n decrRefCount(o);\n return hash;\n }\n }\n}\n\n/* Sets type hash table */\ndictType setDictType = {\n dictEncObjHash, /* hash function */\n NULL, /* key dup */\n NULL, /* val dup */\n dictEncObjKeyCompare, /* key compare */\n dictRedisObjectDestructor, /* key destructor */\n NULL /* val destructor */\n};\n\n/* Sorted sets hash (note: a skiplist is used in addition to the hash table) */\ndictType zsetDictType = {\n dictEncObjHash, /* hash function */\n NULL, /* key dup */\n NULL, /* val dup */\n dictEncObjKeyCompare, /* key compare */\n dictRedisObjectDestructor, /* key destructor */\n NULL /* val destructor */\n};\n\n/* Db->dict, keys are sds strings, vals are Redis objects. */\ndictType dbDictType = {\n dictSdsHash, /* hash function */\n NULL, /* key dup */\n NULL, /* val dup */\n dictSdsKeyCompare, /* key compare */\n dictSdsDestructor, /* key destructor */\n dictRedisObjectDestructor /* val destructor */\n};\n\n/* Db->expires */\ndictType keyptrDictType = {\n dictSdsHash, /* hash function */\n NULL, /* key dup */\n NULL, /* val dup */\n dictSdsKeyCompare, /* key compare */\n NULL, /* key destructor */\n NULL /* val destructor */\n};\n\n/* Command table. sds string -> command struct pointer. */\ndictType commandTableDictType = {\n dictSdsCaseHash, /* hash function */\n NULL, /* key dup */\n NULL, /* val dup */\n dictSdsKeyCaseCompare, /* key compare */\n dictSdsDestructor, /* key destructor */\n NULL /* val destructor */\n};\n\n/* Hash type hash table (note that small hashes are represented with zimpaps) */\ndictType hashDictType = {\n dictEncObjHash, /* hash function */\n NULL, /* key dup */\n NULL, /* val dup */\n dictEncObjKeyCompare, /* key compare */\n dictRedisObjectDestructor, /* key destructor */\n dictRedisObjectDestructor /* val destructor */\n};\n\n/* Keylist hash table type has unencoded redis objects as keys and\n * lists as values. It's used for blocking operations (BLPOP) and to\n * map swapped keys to a list of clients waiting for this keys to be loaded. */\ndictType keylistDictType = {\n dictObjHash, /* hash function */\n NULL, /* key dup */\n NULL, /* val dup */\n dictObjKeyCompare, /* key compare */\n dictRedisObjectDestructor, /* key destructor */\n dictListDestructor /* val destructor */\n};\n\n/* Cluster nodes hash table, mapping nodes addresses 1.2.3.4:6379 to\n * clusterNode structures. */\ndictType clusterNodesDictType = {\n dictSdsHash, /* hash function */\n NULL, /* key dup */\n NULL, /* val dup */\n dictSdsKeyCompare, /* key compare */\n dictSdsDestructor, /* key destructor */\n NULL /* val destructor */\n};\n\nint htNeedsResize(dict *dict) {\n long long size, used;\n\n size = dictSlots(dict);\n used = dictSize(dict);\n return (size && used && size > DICT_HT_INITIAL_SIZE &&\n (used*100/size < REDIS_HT_MINFILL));\n}\n\n/* If the percentage of used slots in the HT reaches REDIS_HT_MINFILL\n * we resize the hash table to save memory */\nvoid tryResizeHashTables(void) {\n int j;\n\n for (j = 0; j < server.dbnum; j++) {\n if (htNeedsResize(server.db[j].dict))\n dictResize(server.db[j].dict);\n if (htNeedsResize(server.db[j].expires))\n dictResize(server.db[j].expires);\n }\n}\n\n/* Our hash table implementation performs rehashing incrementally while\n * we write/read from the hash table. Still if the server is idle, the hash\n * table will use two tables for a long time. So we try to use 1 millisecond\n * of CPU time at every serverCron() loop in order to rehash some key. */\nvoid incrementallyRehash(void) {\n int j;\n\n for (j = 0; j < server.dbnum; j++) {\n /* Keys dictionary */\n if (dictIsRehashing(server.db[j].dict)) {\n dictRehashMilliseconds(server.db[j].dict,1);\n break; /* already used our millisecond for this loop... */\n }\n /* Expires */\n if (dictIsRehashing(server.db[j].expires)) {\n dictRehashMilliseconds(server.db[j].expires,1);\n break; /* already used our millisecond for this loop... */\n }\n }\n}\n\n/* This function is called once a background process of some kind terminates,\n * as we want to avoid resizing the hash tables when there is a child in order\n * to play well with copy-on-write (otherwise when a resize happens lots of\n * memory pages are copied). The goal of this function is to update the ability\n * for dict.c to resize the hash tables accordingly to the fact we have o not\n * running childs. */\nvoid updateDictResizePolicy(void) {\n if (server.rdb_child_pid == -1 && server.aof_child_pid == -1)\n dictEnableResize();\n else\n dictDisableResize();\n}\n\n/* ======================= Cron: called every 100 ms ======================== */\n\n/* Try to expire a few timed out keys. The algorithm used is adaptive and\n * will use few CPU cycles if there are few expiring keys, otherwise\n * it will get more aggressive to avoid that too much memory is used by\n * keys that can be removed from the keyspace. */\nvoid activeExpireCycle(void) {\n int j, iteration = 0;\n long long start = ustime(), timelimit;\n\n /* We can use at max REDIS_EXPIRELOOKUPS_TIME_PERC percentage of CPU time\n * per iteration. Since this function gets called with a frequency of\n * REDIS_HZ times per second, the following is the max amount of\n * microseconds we can spend in this function. */\n timelimit = 1000000*REDIS_EXPIRELOOKUPS_TIME_PERC/REDIS_HZ/100;\n if (timelimit <= 0) timelimit = 1;\n\n for (j = 0; j < server.dbnum; j++) {\n int expired;\n redisDb *db = server.db+j;\n\n /* Continue to expire if at the end of the cycle more than 25%\n * of the keys were expired. */\n do {\n unsigned long num = dictSize(db->expires);\n unsigned long slots = dictSlots(db->expires);\n long long now = mstime();\n\n /* When there are less than 1% filled slots getting random\n * keys is expensive, so stop here waiting for better times...\n * The dictionary will be resized asap. */\n if (num && slots > DICT_HT_INITIAL_SIZE &&\n (num*100/slots < 1)) break;\n\n /* The main collection cycle. Sample random keys among keys\n * with an expire set, checking for expired ones. */\n expired = 0;\n if (num > REDIS_EXPIRELOOKUPS_PER_CRON)\n num = REDIS_EXPIRELOOKUPS_PER_CRON;\n while (num--) {\n dictEntry *de;\n long long t;\n\n if ((de = dictGetRandomKey(db->expires)) == NULL) break;\n t = dictGetSignedIntegerVal(de);\n if (now > t) {\n sds key = dictGetKey(de);\n robj *keyobj = createStringObject(key,sdslen(key));\n\n propagateExpire(db,keyobj);\n dbDelete(db,keyobj);\n decrRefCount(keyobj);\n expired++;\n server.stat_expiredkeys++;\n }\n }\n /* We can't block forever here even if there are many keys to\n * expire. So after a given amount of milliseconds return to the\n * caller waiting for the other active expire cycle. */\n iteration++;\n if ((iteration & 0xf) == 0 && /* check once every 16 cycles. */\n (ustime()-start) > timelimit) return;\n } while (expired > REDIS_EXPIRELOOKUPS_PER_CRON/4);\n }\n}\n\nvoid updateLRUClock(void) {\n server.lruclock = (server.unixtime/REDIS_LRU_CLOCK_RESOLUTION) &\n REDIS_LRU_CLOCK_MAX;\n}\n\n\n/* Add a sample to the operations per second array of samples. */\nvoid trackOperationsPerSecond(void) {\n long long t = mstime() - server.ops_sec_last_sample_time;\n long long ops = server.stat_numcommands - server.ops_sec_last_sample_ops;\n long long ops_sec;\n\n ops_sec = t > 0 ? (ops*1000/t) : 0;\n\n server.ops_sec_samples[server.ops_sec_idx] = ops_sec;\n server.ops_sec_idx = (server.ops_sec_idx+1) % REDIS_OPS_SEC_SAMPLES;\n server.ops_sec_last_sample_time = mstime();\n server.ops_sec_last_sample_ops = server.stat_numcommands;\n}\n\n/* Return the mean of all the samples. */\nlong long getOperationsPerSecond(void) {\n int j;\n long long sum = 0;\n\n for (j = 0; j < REDIS_OPS_SEC_SAMPLES; j++)\n sum += server.ops_sec_samples[j];\n return sum / REDIS_OPS_SEC_SAMPLES;\n}\n\n/* Check for timeouts. Returns non-zero if the client was terminated */\nint clientsCronHandleTimeout(redisClient *c) {\n time_t now = server.unixtime;\n\n if (server.maxidletime &&\n !(c->flags & REDIS_SLAVE) && /* no timeout for slaves */\n !(c->flags & REDIS_MASTER) && /* no timeout for masters */\n !(c->flags & REDIS_BLOCKED) && /* no timeout for BLPOP */\n dictSize(c->pubsub_channels) == 0 && /* no timeout for pubsub */\n listLength(c->pubsub_patterns) == 0 &&\n (now - c->lastinteraction > server.maxidletime))\n {\n redisLog(REDIS_VERBOSE,\"Closing idle client\");\n freeClient(c);\n return 1;\n } else if (c->flags & REDIS_BLOCKED) {\n if (c->bpop.timeout != 0 && c->bpop.timeout < now) {\n addReply(c,shared.nullmultibulk);\n unblockClientWaitingData(c);\n }\n }\n return 0;\n}\n\n/* The client query buffer is an sds.c string that can end with a lot of\n * free space not used, this function reclaims space if needed.\n *\n * The funciton always returns 0 as it never terminates the client. */\nint clientsCronResizeQueryBuffer(redisClient *c) {\n size_t querybuf_size = sdsAllocSize(c->querybuf);\n time_t idletime = server.unixtime - c->lastinteraction;\n\n /* There are two conditions to resize the query buffer:\n * 1) Query buffer is > BIG_ARG and too big for latest peak.\n * 2) Client is inactive and the buffer is bigger than 1k. */\n if (((querybuf_size > REDIS_MBULK_BIG_ARG) &&\n (querybuf_size/(c->querybuf_peak+1)) > 2) ||\n (querybuf_size > 1024 && idletime > 2))\n {\n /* Only resize the query buffer if it is actually wasting space. */\n if (sdsavail(c->querybuf) > 1024) {\n c->querybuf = sdsRemoveFreeSpace(c->querybuf);\n }\n }\n /* Reset the peak again to capture the peak memory usage in the next\n * cycle. */\n c->querybuf_peak = 0;\n return 0;\n}\n\nvoid clientsCron(void) {\n /* Make sure to process at least 1/(REDIS_HZ*10) of clients per call.\n * Since this function is called REDIS_HZ times per second we are sure that\n * in the worst case we process all the clients in 10 seconds.\n * In normal conditions (a reasonable number of clients) we process\n * all the clients in a shorter time. */\n int numclients = listLength(server.clients);\n int iterations = numclients/(REDIS_HZ*10);\n\n if (iterations < 50)\n iterations = (numclients < 50) ? numclients : 50;\n while(listLength(server.clients) && iterations--) {\n redisClient *c;\n listNode *head;\n\n /* Rotate the list, take the current head, process.\n * This way if the client must be removed from the list it's the\n * first element and we don't incur into O(N) computation. */\n listRotate(server.clients);\n head = listFirst(server.clients);\n c = listNodeValue(head);\n /* The following functions do different service checks on the client.\n * The protocol is that they return non-zero if the client was\n * terminated. */\n if (clientsCronHandleTimeout(c)) continue;\n if (clientsCronResizeQueryBuffer(c)) continue;\n }\n}\n\n/* This is our timer interrupt, called REDIS_HZ times per second.\n * Here is where we do a number of things that need to be done asynchronously.\n * For instance:\n *\n * - Active expired keys collection (it is also performed in a lazy way on\n * lookup).\n * - Software watchdong.\n * - Update some statistic.\n * - Incremental rehashing of the DBs hash tables.\n * - Triggering BGSAVE / AOF rewrite, and handling of terminated children.\n * - Clients timeout of differnet kinds.\n * - Replication reconnection.\n * - Many more...\n *\n * Everything directly called here will be called REDIS_HZ times per second,\n * so in order to throttle execution of things we want to do less frequently\n * a macro is used: run_with_period(milliseconds) { .... }\n */\n\n/* Using the following macro you can run code inside serverCron() with the\n * specified period, specified in milliseconds.\n * The actual resolution depends on REDIS_HZ. */\n#define run_with_period(_ms_) if (!(loops % ((_ms_)/(1000/REDIS_HZ))))\n\nint serverCron(struct aeEventLoop *eventLoop, long long id, void *clientData) {\n int j, loops = server.cronloops;\n REDIS_NOTUSED(eventLoop);\n REDIS_NOTUSED(id);\n REDIS_NOTUSED(clientData);\n\n /* Software watchdog: deliver the SIGALRM that will reach the signal\n * handler if we don't return here fast enough. */\n if (server.watchdog_period) watchdogScheduleSignal(server.watchdog_period);\n\n /* We take a cached value of the unix time in the global state because\n * with virtual memory and aging there is to store the current time\n * in objects at every object access, and accuracy is not needed.\n * To access a global var is faster than calling time(NULL) */\n server.unixtime = time(NULL);\n\n run_with_period(100) trackOperationsPerSecond();\n\n /* We have just 22 bits per object for LRU information.\n * So we use an (eventually wrapping) LRU clock with 10 seconds resolution.\n * 2^22 bits with 10 seconds resoluton is more or less 1.5 years.\n *\n * Note that even if this will wrap after 1.5 years it's not a problem,\n * everything will still work but just some object will appear younger\n * to Redis. But for this to happen a given object should never be touched\n * for 1.5 years.\n *\n * Note that you can change the resolution altering the\n * REDIS_LRU_CLOCK_RESOLUTION define.\n */\n updateLRUClock();\n\n /* Record the max memory used since the server was started. */\n if (zmalloc_used_memory() > server.stat_peak_memory)\n server.stat_peak_memory = zmalloc_used_memory();\n\n /* We received a SIGTERM, shutting down here in a safe way, as it is\n * not ok doing so inside the signal handler. */\n if (server.shutdown_asap) {\n if (prepareForShutdown(0) == REDIS_OK) exit(0);\n redisLog(REDIS_WARNING,\"SIGTERM received but errors trying to shut down the server, check the logs for more information\");\n }\n\n /* Show some info about non-empty databases */\n run_with_period(5000) {\n for (j = 0; j < server.dbnum; j++) {\n long long size, used, vkeys;\n\n size = dictSlots(server.db[j].dict);\n used = dictSize(server.db[j].dict);\n vkeys = dictSize(server.db[j].expires);\n if (used || vkeys) {\n redisLog(REDIS_VERBOSE,\"DB %d: %lld keys (%lld volatile) in %lld slots HT.\",j,used,vkeys,size);\n /* dictPrintStats(server.dict); */\n }\n }\n }\n\n /* We don't want to resize the hash tables while a bacground saving\n * is in progress: the saving child is created using fork() that is\n * implemented with a copy-on-write semantic in most modern systems, so\n * if we resize the HT while there is the saving child at work actually\n * a lot of memory movements in the parent will cause a lot of pages\n * copied. */\n if (server.rdb_child_pid == -1 && server.aof_child_pid == -1) {\n tryResizeHashTables();\n if (server.activerehashing) incrementallyRehash();\n }\n\n /* Show information about connected clients */\n run_with_period(5000) {\n redisLog(REDIS_VERBOSE,\"%d clients connected (%d slaves), %zu bytes in use\",\n listLength(server.clients)-listLength(server.slaves),\n listLength(server.slaves),\n zmalloc_used_memory());\n }\n\n /* We need to do a few operations on clients asynchronously. */\n clientsCron();\n\n /* Start a scheduled AOF rewrite if this was requested by the user while\n * a BGSAVE was in progress. */\n if (server.rdb_child_pid == -1 && server.aof_child_pid == -1 &&\n server.aof_rewrite_scheduled)\n {\n rewriteAppendOnlyFileBackground();\n }\n\n /* Check if a background saving or AOF rewrite in progress terminated. */\n if (server.rdb_child_pid != -1 || server.aof_child_pid != -1) {\n int statloc;\n pid_t pid;\n\n if ((pid = wait3(&statloc,WNOHANG,NULL)) != 0) {\n int exitcode = WEXITSTATUS(statloc);\n int bysignal = 0;\n \n if (WIFSIGNALED(statloc)) bysignal = WTERMSIG(statloc);\n\n if (pid == server.rdb_child_pid) {\n backgroundSaveDoneHandler(exitcode,bysignal);\n } else {\n backgroundRewriteDoneHandler(exitcode,bysignal);\n }\n updateDictResizePolicy();\n }\n } else {\n /* If there is not a background saving/rewrite in progress check if\n * we have to save/rewrite now */\n for (j = 0; j < server.saveparamslen; j++) {\n struct saveparam *sp = server.saveparams+j;\n\n if (server.dirty >= sp->changes &&\n server.unixtime-server.lastsave > sp->seconds) {\n redisLog(REDIS_NOTICE,\"%d changes in %d seconds. Saving...\",\n sp->changes, sp->seconds);\n rdbSaveBackground(server.rdb_filename);\n break;\n }\n }\n\n /* Trigger an AOF rewrite if needed */\n if (server.rdb_child_pid == -1 &&\n server.aof_child_pid == -1 &&\n server.aof_rewrite_perc &&\n server.aof_current_size > server.aof_rewrite_min_size)\n {\n long long base = server.aof_rewrite_base_size ?\n server.aof_rewrite_base_size : 1;\n long long growth = (server.aof_current_size*100/base) - 100;\n if (growth >= server.aof_rewrite_perc) {\n redisLog(REDIS_NOTICE,\"Starting automatic rewriting of AOF on %lld%% growth\",growth);\n rewriteAppendOnlyFileBackground();\n }\n }\n }\n\n\n /* If we postponed an AOF buffer flush, let's try to do it every time the\n * cron function is called. */\n if (server.aof_flush_postponed_start) flushAppendOnlyFile(0);\n\n /* Expire a few keys per cycle, only if this is a master.\n * On slaves we wait for DEL operations synthesized by the master\n * in order to guarantee a strict consistency. */\n if (server.masterhost == NULL) activeExpireCycle();\n\n /* Close clients that need to be closed asynchronous */\n freeClientsInAsyncFreeQueue();\n\n /* Replication cron function -- used to reconnect to master and\n * to detect transfer failures. */\n run_with_period(1000) replicationCron();\n\n /* Run other sub-systems specific cron jobs */\n run_with_period(1000) {\n if (server.cluster_enabled) clusterCron();\n }\n\n server.cronloops++;\n return 1000/REDIS_HZ;\n}\n\n/* This function gets called every time Redis is entering the\n * main loop of the event driven library, that is, before to sleep\n * for ready file descriptors. */\nvoid beforeSleep(struct aeEventLoop *eventLoop) {\n REDIS_NOTUSED(eventLoop);\n listNode *ln;\n redisClient *c;\n\n /* Try to process pending commands for clients that were just unblocked. */\n while (listLength(server.unblocked_clients)) {\n ln = listFirst(server.unblocked_clients);\n redisAssert(ln != NULL);\n c = ln->value;\n listDelNode(server.unblocked_clients,ln);\n c->flags &= ~REDIS_UNBLOCKED;\n\n /* Process remaining data in the input buffer. */\n if (c->querybuf && sdslen(c->querybuf) > 0) {\n server.current_client = c;\n processInputBuffer(c);\n server.current_client = NULL;\n }\n }\n\n /* Write the AOF buffer on disk */\n flushAppendOnlyFile(0);\n}\n\n/* =========================== Server initialization ======================== */\n\nvoid createSharedObjects(void) {\n int j;\n\n shared.crlf = createObject(REDIS_STRING,sdsnew(\"\\r\\n\"));\n shared.ok = createObject(REDIS_STRING,sdsnew(\"+OK\\r\\n\"));\n shared.err = createObject(REDIS_STRING,sdsnew(\"-ERR\\r\\n\"));\n shared.emptybulk = createObject(REDIS_STRING,sdsnew(\"$0\\r\\n\\r\\n\"));\n shared.czero = createObject(REDIS_STRING,sdsnew(\":0\\r\\n\"));\n shared.cone = createObject(REDIS_STRING,sdsnew(\":1\\r\\n\"));\n shared.cnegone = createObject(REDIS_STRING,sdsnew(\":-1\\r\\n\"));\n shared.nullbulk = createObject(REDIS_STRING,sdsnew(\"$-1\\r\\n\"));\n shared.nullmultibulk = createObject(REDIS_STRING,sdsnew(\"*-1\\r\\n\"));\n shared.emptymultibulk = createObject(REDIS_STRING,sdsnew(\"*0\\r\\n\"));\n shared.pong = createObject(REDIS_STRING,sdsnew(\"+PONG\\r\\n\"));\n shared.queued = createObject(REDIS_STRING,sdsnew(\"+QUEUED\\r\\n\"));\n shared.wrongtypeerr = createObject(REDIS_STRING,sdsnew(\n \"-ERR Operation against a key holding the wrong kind of value\\r\\n\"));\n shared.nokeyerr = createObject(REDIS_STRING,sdsnew(\n \"-ERR no such key\\r\\n\"));\n shared.syntaxerr = createObject(REDIS_STRING,sdsnew(\n \"-ERR syntax error\\r\\n\"));\n shared.sameobjecterr = createObject(REDIS_STRING,sdsnew(\n \"-ERR source and destination objects are the same\\r\\n\"));\n shared.outofrangeerr = createObject(REDIS_STRING,sdsnew(\n \"-ERR index out of range\\r\\n\"));\n shared.noscripterr = createObject(REDIS_STRING,sdsnew(\n \"-NOSCRIPT No matching script. Please use EVAL.\\r\\n\"));\n shared.loadingerr = createObject(REDIS_STRING,sdsnew(\n \"-LOADING Redis is loading the dataset in memory\\r\\n\"));\n shared.slowscripterr = createObject(REDIS_STRING,sdsnew(\n \"-BUSY Redis is busy running a script. You can only call SCRIPT KILL or SHUTDOWN NOSAVE.\\r\\n\"));\n shared.masterdownerr = createObject(REDIS_STRING,sdsnew(\n \"-MASTERDOWN Link with MASTER is down and slave-serve-stale-data is set to 'no'.\\r\\n\"));\n shared.bgsaveerr = createObject(REDIS_STRING,sdsnew(\n \"-MISCONF Redis is configured to save RDB snapshots, but is currently not able to persist on disk. Commands that may modify the data set are disabled. Please check Redis logs for details about the error.\\r\\n\"));\n shared.roslaveerr = createObject(REDIS_STRING,sdsnew(\n \"-READONLY You can't write against a read only slave.\\r\\n\"));\n shared.oomerr = createObject(REDIS_STRING,sdsnew(\n \"-OOM command not allowed when used memory > 'maxmemory'.\\r\\n\"));\n shared.space = createObject(REDIS_STRING,sdsnew(\" \"));\n shared.colon = createObject(REDIS_STRING,sdsnew(\":\"));\n shared.plus = createObject(REDIS_STRING,sdsnew(\"+\"));\n\n for (j = 0; j < REDIS_SHARED_SELECT_CMDS; j++) {\n shared.select[j] = createObject(REDIS_STRING,\n sdscatprintf(sdsempty(),\"select %d\\r\\n\", j));\n }\n shared.messagebulk = createStringObject(\"$7\\r\\nmessage\\r\\n\",13);\n shared.pmessagebulk = createStringObject(\"$8\\r\\npmessage\\r\\n\",14);\n shared.subscribebulk = createStringObject(\"$9\\r\\nsubscribe\\r\\n\",15);\n shared.unsubscribebulk = createStringObject(\"$11\\r\\nunsubscribe\\r\\n\",18);\n shared.psubscribebulk = createStringObject(\"$10\\r\\npsubscribe\\r\\n\",17);\n shared.punsubscribebulk = createStringObject(\"$12\\r\\npunsubscribe\\r\\n\",19);\n shared.del = createStringObject(\"DEL\",3);\n shared.rpop = createStringObject(\"RPOP\",4);\n shared.lpop = createStringObject(\"LPOP\",4);\n for (j = 0; j < REDIS_SHARED_INTEGERS; j++) {\n shared.integers[j] = createObject(REDIS_STRING,(void*)(long)j);\n shared.integers[j]->encoding = REDIS_ENCODING_INT;\n }\n for (j = 0; j < REDIS_SHARED_BULKHDR_LEN; j++) {\n shared.mbulkhdr[j] = createObject(REDIS_STRING,\n sdscatprintf(sdsempty(),\"*%d\\r\\n\",j));\n shared.bulkhdr[j] = createObject(REDIS_STRING,\n sdscatprintf(sdsempty(),\"$%d\\r\\n\",j));\n }\n}\n\nvoid initServerConfig() {\n getRandomHexChars(server.runid,REDIS_RUN_ID_SIZE);\n server.runid[REDIS_RUN_ID_SIZE] = '\\0';\n server.arch_bits = (sizeof(long) == 8) ? 64 : 32;\n server.port = REDIS_SERVERPORT;\n server.bindaddr = NULL;\n server.unixsocket = NULL;\n server.unixsocketperm = 0;\n server.ipfd = -1;\n server.sofd = -1;\n server.dbnum = REDIS_DEFAULT_DBNUM;\n server.verbosity = REDIS_NOTICE;\n server.maxidletime = REDIS_MAXIDLETIME;\n server.client_max_querybuf_len = REDIS_MAX_QUERYBUF_LEN;\n server.saveparams = NULL;\n server.loading = 0;\n server.logfile = NULL; /* NULL = log on standard output */\n server.syslog_enabled = 0;\n server.syslog_ident = zstrdup(\"redis\");\n server.syslog_facility = LOG_LOCAL0;\n server.daemonize = 0;\n server.aof_state = REDIS_AOF_OFF;\n server.aof_fsync = AOF_FSYNC_EVERYSEC;\n server.aof_no_fsync_on_rewrite = 0;\n server.aof_rewrite_perc = REDIS_AOF_REWRITE_PERC;\n server.aof_rewrite_min_size = REDIS_AOF_REWRITE_MIN_SIZE;\n server.aof_rewrite_base_size = 0;\n server.aof_rewrite_scheduled = 0;\n server.aof_last_fsync = time(NULL);\n server.aof_rewrite_time_last = -1;\n server.aof_rewrite_time_start = -1;\n server.aof_delayed_fsync = 0;\n server.aof_fd = -1;\n server.aof_selected_db = -1; /* Make sure the first time will not match */\n server.aof_flush_postponed_start = 0;\n server.pidfile = zstrdup(\"/var/run/redis.pid\");\n server.rdb_filename = zstrdup(\"dump.rdb\");\n server.aof_filename = zstrdup(\"appendonly.aof\");\n server.requirepass = NULL;\n server.rdb_compression = 1;\n server.rdb_checksum = 1;\n server.activerehashing = 1;\n server.maxclients = REDIS_MAX_CLIENTS;\n server.bpop_blocked_clients = 0;\n server.maxmemory = 0;\n server.maxmemory_policy = REDIS_MAXMEMORY_VOLATILE_LRU;\n server.maxmemory_samples = 3;\n server.hash_max_ziplist_entries = REDIS_HASH_MAX_ZIPLIST_ENTRIES;\n server.hash_max_ziplist_value = REDIS_HASH_MAX_ZIPLIST_VALUE;\n server.list_max_ziplist_entries = REDIS_LIST_MAX_ZIPLIST_ENTRIES;\n server.list_max_ziplist_value = REDIS_LIST_MAX_ZIPLIST_VALUE;\n server.set_max_intset_entries = REDIS_SET_MAX_INTSET_ENTRIES;\n server.zset_max_ziplist_entries = REDIS_ZSET_MAX_ZIPLIST_ENTRIES;\n server.zset_max_ziplist_value = REDIS_ZSET_MAX_ZIPLIST_VALUE;\n server.shutdown_asap = 0;\n server.repl_ping_slave_period = REDIS_REPL_PING_SLAVE_PERIOD;\n server.repl_timeout = REDIS_REPL_TIMEOUT;\n server.cluster_enabled = 0;\n server.cluster.configfile = zstrdup(\"nodes.conf\");\n server.lua_caller = NULL;\n server.lua_time_limit = REDIS_LUA_TIME_LIMIT;\n server.lua_client = NULL;\n server.lua_timedout = 0;\n\n updateLRUClock();\n resetServerSaveParams();\n\n appendServerSaveParams(60*60,1); /* save after 1 hour and 1 change */\n appendServerSaveParams(300,100); /* save after 5 minutes and 100 changes */\n appendServerSaveParams(60,10000); /* save after 1 minute and 10000 changes */\n /* Replication related */\n server.masterauth = NULL;\n server.masterhost = NULL;\n server.masterport = 6379;\n server.master = NULL;\n server.repl_state = REDIS_REPL_NONE;\n server.repl_syncio_timeout = REDIS_REPL_SYNCIO_TIMEOUT;\n server.repl_serve_stale_data = 1;\n server.repl_slave_ro = 1;\n server.repl_down_since = time(NULL);\n\n /* Client output buffer limits */\n server.client_obuf_limits[REDIS_CLIENT_LIMIT_CLASS_NORMAL].hard_limit_bytes = 0;\n server.client_obuf_limits[REDIS_CLIENT_LIMIT_CLASS_NORMAL].soft_limit_bytes = 0;\n server.client_obuf_limits[REDIS_CLIENT_LIMIT_CLASS_NORMAL].soft_limit_seconds = 0;\n server.client_obuf_limits[REDIS_CLIENT_LIMIT_CLASS_SLAVE].hard_limit_bytes = 1024*1024*256;\n server.client_obuf_limits[REDIS_CLIENT_LIMIT_CLASS_SLAVE].soft_limit_bytes = 1024*1024*64;\n server.client_obuf_limits[REDIS_CLIENT_LIMIT_CLASS_SLAVE].soft_limit_seconds = 60;\n server.client_obuf_limits[REDIS_CLIENT_LIMIT_CLASS_PUBSUB].hard_limit_bytes = 1024*1024*32;\n server.client_obuf_limits[REDIS_CLIENT_LIMIT_CLASS_PUBSUB].soft_limit_bytes = 1024*1024*8;\n server.client_obuf_limits[REDIS_CLIENT_LIMIT_CLASS_PUBSUB].soft_limit_seconds = 60;\n\n /* Double constants initialization */\n R_Zero = 0.0;\n R_PosInf = 1.0/R_Zero;\n R_NegInf = -1.0/R_Zero;\n R_Nan = R_Zero/R_Zero;\n\n /* Command table -- we intiialize it here as it is part of the\n * initial configuration, since command names may be changed via\n * redis.conf using the rename-command directive. */\n server.commands = dictCreate(&commandTableDictType,NULL);\n populateCommandTable();\n server.delCommand = lookupCommandByCString(\"del\");\n server.multiCommand = lookupCommandByCString(\"multi\");\n server.lpushCommand = lookupCommandByCString(\"lpush\");\n \n /* Slow log */\n server.slowlog_log_slower_than = REDIS_SLOWLOG_LOG_SLOWER_THAN;\n server.slowlog_max_len = REDIS_SLOWLOG_MAX_LEN;\n\n /* Debugging */\n server.assert_failed = \"\";\n server.assert_file = \"\";\n server.assert_line = 0;\n server.bug_report_start = 0;\n server.watchdog_period = 0;\n}\n\n/* This function will try to raise the max number of open files accordingly to\n * the configured max number of clients. It will also account for 32 additional\n * file descriptors as we need a few more for persistence, listening\n * sockets, log files and so forth.\n *\n * If it will not be possible to set the limit accordingly to the configured\n * max number of clients, the function will do the reverse setting\n * server.maxclients to the value that we can actually handle. */\nvoid adjustOpenFilesLimit(void) {\n rlim_t maxfiles = server.maxclients+32;\n struct rlimit limit;\n\n if (getrlimit(RLIMIT_NOFILE,&limit) == -1) {\n redisLog(REDIS_WARNING,\"Unable to obtain the current NOFILE limit (%s), assuming 1024 and setting the max clients configuration accordingly.\",\n strerror(errno));\n server.maxclients = 1024-32;\n } else {\n rlim_t oldlimit = limit.rlim_cur;\n\n /* Set the max number of files if the current limit is not enough\n * for our needs. */\n if (oldlimit < maxfiles) {\n rlim_t f;\n \n f = maxfiles;\n while(f > oldlimit) {\n limit.rlim_cur = f;\n limit.rlim_max = f;\n if (setrlimit(RLIMIT_NOFILE,&limit) != -1) break;\n f -= 128;\n }\n if (f < oldlimit) f = oldlimit;\n if (f != maxfiles) {\n server.maxclients = f-32;\n redisLog(REDIS_WARNING,\"Unable to set the max number of files limit to %d (%s), setting the max clients configuration to %d.\",\n (int) maxfiles, strerror(errno), (int) server.maxclients);\n } else {\n redisLog(REDIS_NOTICE,\"Max number of open files set to %d\",\n (int) maxfiles);\n }\n }\n }\n}\n\nvoid initServer() {\n int j;\n\n signal(SIGHUP, SIG_IGN);\n signal(SIGPIPE, SIG_IGN);\n setupSignalHandlers();\n\n if (server.syslog_enabled) {\n openlog(server.syslog_ident, LOG_PID | LOG_NDELAY | LOG_NOWAIT,\n server.syslog_facility);\n }\n\n server.current_client = NULL;\n server.clients = listCreate();\n server.clients_to_close = listCreate();\n server.slaves = listCreate();\n server.monitors = listCreate();\n server.unblocked_clients = listCreate();\n\n createSharedObjects();\n adjustOpenFilesLimit();\n server.el = aeCreateEventLoop(server.maxclients+1024);\n server.db = zmalloc(sizeof(redisDb)*server.dbnum);\n\n if (server.port != 0) {\n server.ipfd = anetTcpServer(server.neterr,server.port,server.bindaddr);\n if (server.ipfd == ANET_ERR) {\n redisLog(REDIS_WARNING, \"Opening port %d: %s\",\n server.port, server.neterr);\n exit(1);\n }\n }\n if (server.unixsocket != NULL) {\n unlink(server.unixsocket); /* don't care if this fails */\n server.sofd = anetUnixServer(server.neterr,server.unixsocket,server.unixsocketperm);\n if (server.sofd == ANET_ERR) {\n redisLog(REDIS_WARNING, \"Opening socket: %s\", server.neterr);\n exit(1);\n }\n }\n if (server.ipfd < 0 && server.sofd < 0) {\n redisLog(REDIS_WARNING, \"Configured to not listen anywhere, exiting.\");\n exit(1);\n }\n for (j = 0; j < server.dbnum; j++) {\n server.db[j].dict = dictCreate(&dbDictType,NULL);\n server.db[j].expires = dictCreate(&keyptrDictType,NULL);\n server.db[j].blocking_keys = dictCreate(&keylistDictType,NULL);\n server.db[j].watched_keys = dictCreate(&keylistDictType,NULL);\n server.db[j].id = j;\n }\n server.pubsub_channels = dictCreate(&keylistDictType,NULL);\n server.pubsub_patterns = listCreate();\n listSetFreeMethod(server.pubsub_patterns,freePubsubPattern);\n listSetMatchMethod(server.pubsub_patterns,listMatchPubsubPattern);\n server.cronloops = 0;\n server.rdb_child_pid = -1;\n server.aof_child_pid = -1;\n aofRewriteBufferReset();\n server.aof_buf = sdsempty();\n server.lastsave = time(NULL);\n server.rdb_save_time_last = -1;\n server.rdb_save_time_start = -1;\n server.dirty = 0;\n server.stat_numcommands = 0;\n server.stat_numconnections = 0;\n server.stat_expiredkeys = 0;\n server.stat_evictedkeys = 0;\n server.stat_starttime = time(NULL);\n server.stat_keyspace_misses = 0;\n server.stat_keyspace_hits = 0;\n server.stat_peak_memory = 0;\n server.stat_fork_time = 0;\n server.stat_rejected_conn = 0;\n memset(server.ops_sec_samples,0,sizeof(server.ops_sec_samples));\n server.ops_sec_idx = 0;\n server.ops_sec_last_sample_time = mstime();\n server.ops_sec_last_sample_ops = 0;\n server.unixtime = time(NULL);\n server.lastbgsave_status = REDIS_OK;\n server.stop_writes_on_bgsave_err = 1;\n aeCreateTimeEvent(server.el, 1, serverCron, NULL, NULL);\n if (server.ipfd > 0 && aeCreateFileEvent(server.el,server.ipfd,AE_READABLE,\n acceptTcpHandler,NULL) == AE_ERR) oom(\"creating file event\");\n if (server.sofd > 0 && aeCreateFileEvent(server.el,server.sofd,AE_READABLE,\n acceptUnixHandler,NULL) == AE_ERR) oom(\"creating file event\");\n\n if (server.aof_state == REDIS_AOF_ON) {\n server.aof_fd = open(server.aof_filename,\n O_WRONLY|O_APPEND|O_CREAT,0644);\n if (server.aof_fd == -1) {\n redisLog(REDIS_WARNING, \"Can't open the append-only file: %s\",\n strerror(errno));\n exit(1);\n }\n }\n\n /* 32 bit instances are limited to 4GB of address space, so if there is\n * no explicit limit in the user provided configuration we set a limit\n * at 3.5GB using maxmemory with 'noeviction' policy'. This saves\n * useless crashes of the Redis instance. */\n if (server.arch_bits == 32 && server.maxmemory == 0) {\n redisLog(REDIS_WARNING,\"Warning: 32 bit instance detected but no memory limit set. Setting 3.5 GB maxmemory limit with 'noeviction' policy now.\");\n server.maxmemory = 3584LL*(1024*1024); /* 3584 MB = 3.5 GB */\n server.maxmemory_policy = REDIS_MAXMEMORY_NO_EVICTION;\n }\n\n if (server.cluster_enabled) clusterInit();\n scriptingInit();\n slowlogInit();\n bioInit();\n}\n\n/* Populates the Redis Command Table starting from the hard coded list\n * we have on top of redis.c file. */\nvoid populateCommandTable(void) {\n int j;\n int numcommands = sizeof(redisCommandTable)/sizeof(struct redisCommand);\n\n for (j = 0; j < numcommands; j++) {\n struct redisCommand *c = redisCommandTable+j;\n char *f = c->sflags;\n int retval;\n\n while(*f != '\\0') {\n switch(*f) {\n case 'w': c->flags |= REDIS_CMD_WRITE; break;\n case 'r': c->flags |= REDIS_CMD_READONLY; break;\n case 'm': c->flags |= REDIS_CMD_DENYOOM; break;\n case 'a': c->flags |= REDIS_CMD_ADMIN; break;\n case 'p': c->flags |= REDIS_CMD_PUBSUB; break;\n case 'f': c->flags |= REDIS_CMD_FORCE_REPLICATION; break;\n case 's': c->flags |= REDIS_CMD_NOSCRIPT; break;\n case 'R': c->flags |= REDIS_CMD_RANDOM; break;\n case 'S': c->flags |= REDIS_CMD_SORT_FOR_SCRIPT; break;\n default: redisPanic(\"Unsupported command flag\"); break;\n }\n f++;\n }\n\n retval = dictAdd(server.commands, sdsnew(c->name), c);\n assert(retval == DICT_OK);\n }\n}\n\nvoid resetCommandTableStats(void) {\n int numcommands = sizeof(redisCommandTable)/sizeof(struct redisCommand);\n int j;\n\n for (j = 0; j < numcommands; j++) {\n struct redisCommand *c = redisCommandTable+j;\n\n c->microseconds = 0;\n c->calls = 0;\n }\n}\n\n/* ========================== Redis OP Array API ============================ */\n\nvoid redisOpArrayInit(redisOpArray *oa) {\n oa->ops = NULL;\n oa->numops = 0;\n}\n\nint redisOpArrayAppend(redisOpArray *oa, struct redisCommand *cmd, int dbid,\n robj **argv, int argc, int target)\n{\n redisOp *op;\n\n oa->ops = zrealloc(oa->ops,sizeof(redisOp)*(oa->numops+1));\n op = oa->ops+oa->numops;\n op->cmd = cmd;\n op->dbid = dbid;\n op->argv = argv;\n op->argc = argc;\n op->target = target;\n oa->numops++;\n return oa->numops;\n}\n\nvoid redisOpArrayFree(redisOpArray *oa) {\n while(oa->numops) {\n int j;\n redisOp *op;\n\n oa->numops--;\n op = oa->ops+oa->numops;\n for (j = 0; j < op->argc; j++)\n decrRefCount(op->argv[j]);\n zfree(op->argv);\n }\n zfree(oa->ops);\n}\n\n/* ====================== Commands lookup and execution ===================== */\n\nstruct redisCommand *lookupCommand(sds name) {\n return dictFetchValue(server.commands, name);\n}\n\nstruct redisCommand *lookupCommandByCString(char *s) {\n struct redisCommand *cmd;\n sds name = sdsnew(s);\n\n cmd = dictFetchValue(server.commands, name);\n sdsfree(name);\n return cmd;\n}\n\n/* Propagate the specified command (in the context of the specified database id)\n * to AOF, Slaves and Monitors.\n *\n * flags are an xor between:\n * + REDIS_PROPAGATE_NONE (no propagation of command at all)\n * + REDIS_PROPAGATE_AOF (propagate into the AOF file if is enabled)\n * + REDIS_PROPAGATE_REPL (propagate into the replication link)\n */\nvoid propagate(struct redisCommand *cmd, int dbid, robj **argv, int argc,\n int flags)\n{\n if (server.aof_state != REDIS_AOF_OFF && flags & REDIS_PROPAGATE_AOF)\n feedAppendOnlyFile(cmd,dbid,argv,argc);\n if (flags & REDIS_PROPAGATE_REPL && listLength(server.slaves))\n replicationFeedSlaves(server.slaves,dbid,argv,argc);\n}\n\n/* Used inside commands to schedule the propagation of additional commands\n * after the current command is propagated to AOF / Replication. */\nvoid alsoPropagate(struct redisCommand *cmd, int dbid, robj **argv, int argc,\n int target)\n{\n redisOpArrayAppend(&server.also_propagate,cmd,dbid,argv,argc,target);\n}\n\n/* Call() is the core of Redis execution of a command */\nvoid call(redisClient *c, int flags) {\n long long dirty, start = ustime(), duration;\n\n /* Sent the command to clients in MONITOR mode, only if the commands are\n * not geneated from reading an AOF. */\n if (listLength(server.monitors) && !server.loading)\n replicationFeedMonitors(c,server.monitors,c->db->id,c->argv,c->argc);\n\n /* Call the command. */\n redisOpArrayInit(&server.also_propagate);\n dirty = server.dirty;\n c->cmd->proc(c);\n dirty = server.dirty-dirty;\n duration = ustime()-start;\n\n /* When EVAL is called loading the AOF we don't want commands called\n * from Lua to go into the slowlog or to populate statistics. */\n if (server.loading && c->flags & REDIS_LUA_CLIENT)\n flags &= ~(REDIS_CALL_SLOWLOG | REDIS_CALL_STATS);\n\n /* Log the command into the Slow log if needed, and populate the\n * per-command statistics that we show in INFO commandstats. */\n if (flags & REDIS_CALL_SLOWLOG)\n slowlogPushEntryIfNeeded(c->argv,c->argc,duration);\n if (flags & REDIS_CALL_STATS) {\n c->cmd->microseconds += duration;\n c->cmd->calls++;\n }\n\n /* Propagate the command into the AOF and replication link */\n if (flags & REDIS_CALL_PROPAGATE) {\n int flags = REDIS_PROPAGATE_NONE;\n\n if (c->cmd->flags & REDIS_CMD_FORCE_REPLICATION)\n flags |= REDIS_PROPAGATE_REPL;\n if (dirty)\n flags |= (REDIS_PROPAGATE_REPL | REDIS_PROPAGATE_AOF);\n if (flags != REDIS_PROPAGATE_NONE)\n propagate(c->cmd,c->db->id,c->argv,c->argc,flags);\n }\n /* Commands such as LPUSH or BRPOPLPUSH may propagate an additional\n * PUSH command. */\n if (server.also_propagate.numops) {\n int j;\n redisOp *rop;\n\n for (j = 0; j < server.also_propagate.numops; j++) {\n rop = &server.also_propagate.ops[j];\n propagate(rop->cmd, rop->dbid, rop->argv, rop->argc, rop->target);\n }\n redisOpArrayFree(&server.also_propagate);\n }\n server.stat_numcommands++;\n}\n\n/* If this function gets called we already read a whole\n * command, argments are in the client argv/argc fields.\n * processCommand() execute the command or prepare the\n * server for a bulk read from the client.\n *\n * If 1 is returned the client is still alive and valid and\n * and other operations can be performed by the caller. Otherwise\n * if 0 is returned the client was destroied (i.e. after QUIT). */\nint processCommand(redisClient *c) {\n /* The QUIT command is handled separately. Normal command procs will\n * go through checking for replication and QUIT will cause trouble\n * when FORCE_REPLICATION is enabled and would be implemented in\n * a regular command proc. */\n if (!strcasecmp(c->argv[0]->ptr,\"quit\")) {\n addReply(c,shared.ok);\n c->flags |= REDIS_CLOSE_AFTER_REPLY;\n return REDIS_ERR;\n }\n\n /* Now lookup the command and check ASAP about trivial error conditions\n * such as wrong arity, bad command name and so forth. */\n c->cmd = c->lastcmd = lookupCommand(c->argv[0]->ptr);\n if (!c->cmd) {\n addReplyErrorFormat(c,\"unknown command '%s'\",\n (char*)c->argv[0]->ptr);\n return REDIS_OK;\n } else if ((c->cmd->arity > 0 && c->cmd->arity != c->argc) ||\n (c->argc < -c->cmd->arity)) {\n addReplyErrorFormat(c,\"wrong number of arguments for '%s' command\",\n c->cmd->name);\n return REDIS_OK;\n }\n\n /* Check if the user is authenticated */\n if (server.requirepass && !c->authenticated && c->cmd->proc != authCommand)\n {\n addReplyError(c,\"operation not permitted\");\n return REDIS_OK;\n }\n\n /* If cluster is enabled, redirect here */\n if (server.cluster_enabled &&\n !(c->cmd->getkeys_proc == NULL && c->cmd->firstkey == 0)) {\n int hashslot;\n\n if (server.cluster.state != REDIS_CLUSTER_OK) {\n addReplyError(c,\"The cluster is down. Check with CLUSTER INFO for more information\");\n return REDIS_OK;\n } else {\n int ask;\n clusterNode *n = getNodeByQuery(c,c->cmd,c->argv,c->argc,&hashslot,&ask);\n if (n == NULL) {\n addReplyError(c,\"Multi keys request invalid in cluster\");\n return REDIS_OK;\n } else if (n != server.cluster.myself) {\n addReplySds(c,sdscatprintf(sdsempty(),\n \"-%s %d %s:%d\\r\\n\", ask ? \"ASK\" : \"MOVED\",\n hashslot,n->ip,n->port));\n return REDIS_OK;\n }\n }\n }\n\n /* Handle the maxmemory directive.\n *\n * First we try to free some memory if possible (if there are volatile\n * keys in the dataset). If there are not the only thing we can do\n * is returning an error. */\n if (server.maxmemory) {\n int retval = freeMemoryIfNeeded();\n if ((c->cmd->flags & REDIS_CMD_DENYOOM) && retval == REDIS_ERR) {\n addReply(c, shared.oomerr);\n return REDIS_OK;\n }\n }\n\n /* Don't accept write commands if there are problems persisting on disk. */\n if (server.stop_writes_on_bgsave_err &&\n server.saveparamslen > 0\n && server.lastbgsave_status == REDIS_ERR &&\n c->cmd->flags & REDIS_CMD_WRITE)\n {\n addReply(c, shared.bgsaveerr);\n return REDIS_OK;\n }\n\n /* Don't accept wirte commands if this is a read only slave. But\n * accept write commands if this is our master. */\n if (server.masterhost && server.repl_slave_ro &&\n !(c->flags & REDIS_MASTER) &&\n c->cmd->flags & REDIS_CMD_WRITE)\n {\n addReply(c, shared.roslaveerr);\n return REDIS_OK;\n }\n\n /* Only allow SUBSCRIBE and UNSUBSCRIBE in the context of Pub/Sub */\n if ((dictSize(c->pubsub_channels) > 0 || listLength(c->pubsub_patterns) > 0)\n &&\n c->cmd->proc != subscribeCommand &&\n c->cmd->proc != unsubscribeCommand &&\n c->cmd->proc != psubscribeCommand &&\n c->cmd->proc != punsubscribeCommand) {\n addReplyError(c,\"only (P)SUBSCRIBE / (P)UNSUBSCRIBE / QUIT allowed in this context\");\n return REDIS_OK;\n }\n\n /* Only allow INFO and SLAVEOF when slave-serve-stale-data is no and\n * we are a slave with a broken link with master. */\n if (server.masterhost && server.repl_state != REDIS_REPL_CONNECTED &&\n server.repl_serve_stale_data == 0 &&\n c->cmd->proc != infoCommand && c->cmd->proc != slaveofCommand)\n {\n addReply(c, shared.masterdownerr);\n return REDIS_OK;\n }\n\n /* Loading DB? Return an error if the command is not INFO */\n if (server.loading && c->cmd->proc != infoCommand) {\n addReply(c, shared.loadingerr);\n return REDIS_OK;\n }\n\n /* Lua script too slow? Only allow SHUTDOWN NOSAVE and SCRIPT KILL. */\n if (server.lua_timedout &&\n !(c->cmd->proc == shutdownCommand &&\n c->argc == 2 &&\n tolower(((char*)c->argv[1]->ptr)[0]) == 'n') &&\n !(c->cmd->proc == scriptCommand &&\n c->argc == 2 &&\n tolower(((char*)c->argv[1]->ptr)[0]) == 'k'))\n {\n addReply(c, shared.slowscripterr);\n return REDIS_OK;\n }\n\n /* Exec the command */\n if (c->flags & REDIS_MULTI &&\n c->cmd->proc != execCommand && c->cmd->proc != discardCommand &&\n c->cmd->proc != multiCommand && c->cmd->proc != watchCommand)\n {\n queueMultiCommand(c);\n addReply(c,shared.queued);\n } else {\n call(c,REDIS_CALL_FULL);\n }\n return REDIS_OK;\n}\n\n/*================================== Shutdown =============================== */\n\nint prepareForShutdown(int flags) {\n int save = flags & REDIS_SHUTDOWN_SAVE;\n int nosave = flags & REDIS_SHUTDOWN_NOSAVE;\n\n redisLog(REDIS_WARNING,\"User requested shutdown...\");\n /* Kill the saving child if there is a background saving in progress.\n We want to avoid race conditions, for instance our saving child may\n overwrite the synchronous saving did by SHUTDOWN. */\n if (server.rdb_child_pid != -1) {\n redisLog(REDIS_WARNING,\"There is a child saving an .rdb. Killing it!\");\n kill(server.rdb_child_pid,SIGKILL);\n rdbRemoveTempFile(server.rdb_child_pid);\n }\n if (server.aof_state != REDIS_AOF_OFF) {\n /* Kill the AOF saving child as the AOF we already have may be longer\n * but contains the full dataset anyway. */\n if (server.aof_child_pid != -1) {\n redisLog(REDIS_WARNING,\n \"There is a child rewriting the AOF. Killing it!\");\n kill(server.aof_child_pid,SIGKILL);\n }\n /* Append only file: fsync() the AOF and exit */\n redisLog(REDIS_NOTICE,\"Calling fsync() on the AOF file.\");\n aof_fsync(server.aof_fd);\n }\n if ((server.saveparamslen > 0 && !nosave) || save) {\n redisLog(REDIS_NOTICE,\"Saving the final RDB snapshot before exiting.\");\n /* Snapshotting. Perform a SYNC SAVE and exit */\n if (rdbSave(server.rdb_filename) != REDIS_OK) {\n /* Ooops.. error saving! The best we can do is to continue\n * operating. Note that if there was a background saving process,\n * in the next cron() Redis will be notified that the background\n * saving aborted, handling special stuff like slaves pending for\n * synchronization... */\n redisLog(REDIS_WARNING,\"Error trying to save the DB, can't exit.\");\n return REDIS_ERR;\n }\n }\n if (server.daemonize) {\n redisLog(REDIS_NOTICE,\"Removing the pid file.\");\n unlink(server.pidfile);\n }\n /* Close the listening sockets. Apparently this allows faster restarts. */\n if (server.ipfd != -1) close(server.ipfd);\n if (server.sofd != -1) close(server.sofd);\n if (server.unixsocket) {\n redisLog(REDIS_NOTICE,\"Removing the unix socket file.\");\n unlink(server.unixsocket); /* don't care if this fails */\n }\n\n redisLog(REDIS_WARNING,\"Redis is now ready to exit, bye bye...\");\n return REDIS_OK;\n}\n\n/*================================== Commands =============================== */\n\nvoid authCommand(redisClient *c) {\n if (!server.requirepass) {\n addReplyError(c,\"Client sent AUTH, but no password is set\");\n } else if (!strcmp(c->argv[1]->ptr, server.requirepass)) {\n c->authenticated = 1;\n addReply(c,shared.ok);\n } else {\n c->authenticated = 0;\n addReplyError(c,\"invalid password\");\n }\n}\n\nvoid pingCommand(redisClient *c) {\n addReply(c,shared.pong);\n}\n\nvoid echoCommand(redisClient *c) {\n addReplyBulk(c,c->argv[1]);\n}\n\nvoid timeCommand(redisClient *c) {\n struct timeval tv;\n\n /* gettimeofday() can only fail if &tv is a bad addresss so we\n * don't check for errors. */\n gettimeofday(&tv,NULL);\n addReplyMultiBulkLen(c,2);\n addReplyBulkLongLong(c,tv.tv_sec);\n addReplyBulkLongLong(c,tv.tv_usec);\n}\n\n/* Convert an amount of bytes into a human readable string in the form\n * of 100B, 2G, 100M, 4K, and so forth. */\nvoid bytesToHuman(char *s, unsigned long long n) {\n double d;\n\n if (n < 1024) {\n /* Bytes */\n sprintf(s,\"%lluB\",n);\n return;\n } else if (n < (1024*1024)) {\n d = (double)n/(1024);\n sprintf(s,\"%.2fK\",d);\n } else if (n < (1024LL*1024*1024)) {\n d = (double)n/(1024*1024);\n sprintf(s,\"%.2fM\",d);\n } else if (n < (1024LL*1024*1024*1024)) {\n d = (double)n/(1024LL*1024*1024);\n sprintf(s,\"%.2fG\",d);\n }\n}\n\n/* Create the string returned by the INFO command. This is decoupled\n * by the INFO command itself as we need to report the same information\n * on memory corruption problems. */\nsds genRedisInfoString(char *section) {\n sds info = sdsempty();\n time_t uptime = server.unixtime-server.stat_starttime;\n int j, numcommands;\n struct rusage self_ru, c_ru;\n unsigned long lol, bib;\n int allsections = 0, defsections = 0;\n int sections = 0;\n \n if (section) {\n allsections = strcasecmp(section,\"all\") == 0;\n defsections = strcasecmp(section,\"default\") == 0;\n }\n\n getrusage(RUSAGE_SELF, &self_ru);\n getrusage(RUSAGE_CHILDREN, &c_ru);\n getClientsMaxBuffers(&lol,&bib);\n\n /* Server */\n if (allsections || defsections || !strcasecmp(section,\"server\")) {\n struct utsname name;\n\n if (sections++) info = sdscat(info,\"\\r\\n\");\n uname(&name);\n info = sdscatprintf(info,\n \"# Server\\r\\n\"\n \"redis_version:%s\\r\\n\"\n \"redis_git_sha1:%s\\r\\n\"\n \"redis_git_dirty:%d\\r\\n\"\n \"os:%s %s %s\\r\\n\"\n \"arch_bits:%d\\r\\n\"\n \"multiplexing_api:%s\\r\\n\"\n \"gcc_version:%d.%d.%d\\r\\n\"\n \"process_id:%ld\\r\\n\"\n \"run_id:%s\\r\\n\"\n \"tcp_port:%d\\r\\n\"\n \"uptime_in_seconds:%ld\\r\\n\"\n \"uptime_in_days:%ld\\r\\n\"\n \"lru_clock:%ld\\r\\n\",\n REDIS_VERSION,\n redisGitSHA1(),\n strtol(redisGitDirty(),NULL,10) > 0,\n name.sysname, name.release, name.machine,\n server.arch_bits,\n aeGetApiName(),\n#ifdef __GNUC__\n __GNUC__,__GNUC_MINOR__,__GNUC_PATCHLEVEL__,\n#else\n 0,0,0,\n#endif\n (long) getpid(),\n server.runid,\n server.port,\n uptime,\n uptime/(3600*24),\n (unsigned long) server.lruclock);\n }\n\n /* Clients */\n if (allsections || defsections || !strcasecmp(section,\"clients\")) {\n if (sections++) info = sdscat(info,\"\\r\\n\");\n info = sdscatprintf(info,\n \"# Clients\\r\\n\"\n \"connected_clients:%lu\\r\\n\"\n \"client_longest_output_list:%lu\\r\\n\"\n \"client_biggest_input_buf:%lu\\r\\n\"\n \"blocked_clients:%d\\r\\n\",\n listLength(server.clients)-listLength(server.slaves),\n lol, bib,\n server.bpop_blocked_clients);\n }\n\n /* Memory */\n if (allsections || defsections || !strcasecmp(section,\"memory\")) {\n char hmem[64];\n char peak_hmem[64];\n\n bytesToHuman(hmem,zmalloc_used_memory());\n bytesToHuman(peak_hmem,server.stat_peak_memory);\n if (sections++) info = sdscat(info,\"\\r\\n\");\n info = sdscatprintf(info,\n \"# Memory\\r\\n\"\n \"used_memory:%zu\\r\\n\"\n \"used_memory_human:%s\\r\\n\"\n \"used_memory_rss:%zu\\r\\n\"\n \"used_memory_peak:%zu\\r\\n\"\n \"used_memory_peak_human:%s\\r\\n\"\n \"used_memory_lua:%lld\\r\\n\"\n \"mem_fragmentation_ratio:%.2f\\r\\n\"\n \"mem_allocator:%s\\r\\n\",\n zmalloc_used_memory(),\n hmem,\n zmalloc_get_rss(),\n server.stat_peak_memory,\n peak_hmem,\n ((long long)lua_gc(server.lua,LUA_GCCOUNT,0))*1024LL,\n zmalloc_get_fragmentation_ratio(),\n ZMALLOC_LIB\n );\n }\n\n /* Persistence */\n if (allsections || defsections || !strcasecmp(section,\"persistence\")) {\n if (sections++) info = sdscat(info,\"\\r\\n\");\n info = sdscatprintf(info,\n \"# Persistence\\r\\n\"\n \"loading:%d\\r\\n\"\n \"rdb_changes_since_last_save:%lld\\r\\n\"\n \"rdb_bgsave_in_progress:%d\\r\\n\"\n \"rdb_last_save_time:%ld\\r\\n\"\n \"rdb_last_bgsave_status:%s\\r\\n\"\n \"rdb_last_bgsave_time_sec:%ld\\r\\n\"\n \"rdb_current_bgsave_time_sec:%ld\\r\\n\"\n \"aof_enabled:%d\\r\\n\"\n \"aof_rewrite_in_progress:%d\\r\\n\"\n \"aof_rewrite_scheduled:%d\\r\\n\"\n \"aof_last_rewrite_time_sec:%ld\\r\\n\"\n \"aof_current_rewrite_time_sec:%ld\\r\\n\",\n server.loading,\n server.dirty,\n server.rdb_child_pid != -1,\n server.lastsave,\n server.lastbgsave_status == REDIS_OK ? \"ok\" : \"err\",\n server.rdb_save_time_last,\n (server.rdb_child_pid == -1) ?\n -1 : time(NULL)-server.rdb_save_time_start,\n server.aof_state != REDIS_AOF_OFF,\n server.aof_child_pid != -1,\n server.aof_rewrite_scheduled,\n server.aof_rewrite_time_last,\n (server.aof_child_pid == -1) ?\n -1 : time(NULL)-server.aof_rewrite_time_start);\n\n if (server.aof_state != REDIS_AOF_OFF) {\n info = sdscatprintf(info,\n \"aof_current_size:%lld\\r\\n\"\n \"aof_base_size:%lld\\r\\n\"\n \"aof_pending_rewrite:%d\\r\\n\"\n \"aof_buffer_length:%zu\\r\\n\"\n \"aof_rewrite_buffer_length:%zu\\r\\n\"\n \"aof_pending_bio_fsync:%llu\\r\\n\"\n \"aof_delayed_fsync:%lu\\r\\n\",\n (long long) server.aof_current_size,\n (long long) server.aof_rewrite_base_size,\n server.aof_rewrite_scheduled,\n sdslen(server.aof_buf),\n aofRewriteBufferSize(),\n bioPendingJobsOfType(REDIS_BIO_AOF_FSYNC),\n server.aof_delayed_fsync);\n }\n\n if (server.loading) {\n double perc;\n time_t eta, elapsed;\n off_t remaining_bytes = server.loading_total_bytes-\n server.loading_loaded_bytes;\n\n perc = ((double)server.loading_loaded_bytes /\n server.loading_total_bytes) * 100;\n\n elapsed = server.unixtime-server.loading_start_time;\n if (elapsed == 0) {\n eta = 1; /* A fake 1 second figure if we don't have\n enough info */\n } else {\n eta = (elapsed*remaining_bytes)/server.loading_loaded_bytes;\n }\n\n info = sdscatprintf(info,\n \"loading_start_time:%ld\\r\\n\"\n \"loading_total_bytes:%llu\\r\\n\"\n \"loading_loaded_bytes:%llu\\r\\n\"\n \"loading_loaded_perc:%.2f\\r\\n\"\n \"loading_eta_seconds:%ld\\r\\n\"\n ,(unsigned long) server.loading_start_time,\n (unsigned long long) server.loading_total_bytes,\n (unsigned long long) server.loading_loaded_bytes,\n perc,\n eta\n );\n }\n }\n\n /* Stats */\n if (allsections || defsections || !strcasecmp(section,\"stats\")) {\n if (sections++) info = sdscat(info,\"\\r\\n\");\n info = sdscatprintf(info,\n \"# Stats\\r\\n\"\n \"total_connections_received:%lld\\r\\n\"\n \"total_commands_processed:%lld\\r\\n\"\n \"instantaneous_ops_per_sec:%lld\\r\\n\"\n \"rejected_connections:%lld\\r\\n\"\n \"expired_keys:%lld\\r\\n\"\n \"evicted_keys:%lld\\r\\n\"\n \"keyspace_hits:%lld\\r\\n\"\n \"keyspace_misses:%lld\\r\\n\"\n \"pubsub_channels:%ld\\r\\n\"\n \"pubsub_patterns:%lu\\r\\n\"\n \"latest_fork_usec:%lld\\r\\n\",\n server.stat_numconnections,\n server.stat_numcommands,\n getOperationsPerSecond(),\n server.stat_rejected_conn,\n server.stat_expiredkeys,\n server.stat_evictedkeys,\n server.stat_keyspace_hits,\n server.stat_keyspace_misses,\n dictSize(server.pubsub_channels),\n listLength(server.pubsub_patterns),\n server.stat_fork_time);\n }\n\n /* Replication */\n if (allsections || defsections || !strcasecmp(section,\"replication\")) {\n if (sections++) info = sdscat(info,\"\\r\\n\");\n info = sdscatprintf(info,\n \"# Replication\\r\\n\"\n \"role:%s\\r\\n\",\n server.masterhost == NULL ? \"master\" : \"slave\");\n if (server.masterhost) {\n info = sdscatprintf(info,\n \"master_host:%s\\r\\n\"\n \"master_port:%d\\r\\n\"\n \"master_link_status:%s\\r\\n\"\n \"master_last_io_seconds_ago:%d\\r\\n\"\n \"master_sync_in_progress:%d\\r\\n\"\n ,server.masterhost,\n server.masterport,\n (server.repl_state == REDIS_REPL_CONNECTED) ?\n \"up\" : \"down\",\n server.master ?\n ((int)(server.unixtime-server.master->lastinteraction)) : -1,\n server.repl_state == REDIS_REPL_TRANSFER\n );\n\n if (server.repl_state == REDIS_REPL_TRANSFER) {\n info = sdscatprintf(info,\n \"master_sync_left_bytes:%ld\\r\\n\"\n \"master_sync_last_io_seconds_ago:%d\\r\\n\"\n ,(long)server.repl_transfer_left,\n (int)(server.unixtime-server.repl_transfer_lastio)\n );\n }\n\n if (server.repl_state != REDIS_REPL_CONNECTED) {\n info = sdscatprintf(info,\n \"master_link_down_since_seconds:%ld\\r\\n\",\n (long)server.unixtime-server.repl_down_since);\n }\n }\n info = sdscatprintf(info,\n \"connected_slaves:%lu\\r\\n\",\n listLength(server.slaves));\n if (listLength(server.slaves)) {\n int slaveid = 0;\n listNode *ln;\n listIter li;\n\n listRewind(server.slaves,&li);\n while((ln = listNext(&li))) {\n redisClient *slave = listNodeValue(ln);\n char *state = NULL;\n char ip[32];\n int port;\n\n if (anetPeerToString(slave->fd,ip,&port) == -1) continue;\n switch(slave->replstate) {\n case REDIS_REPL_WAIT_BGSAVE_START:\n case REDIS_REPL_WAIT_BGSAVE_END:\n state = \"wait_bgsave\";\n break;\n case REDIS_REPL_SEND_BULK:\n state = \"send_bulk\";\n break;\n case REDIS_REPL_ONLINE:\n state = \"online\";\n break;\n }\n if (state == NULL) continue;\n info = sdscatprintf(info,\"slave%d:%s,%d,%s\\r\\n\",\n slaveid,ip,port,state);\n slaveid++;\n }\n }\n }\n\n /* CPU */\n if (allsections || defsections || !strcasecmp(section,\"cpu\")) {\n if (sections++) info = sdscat(info,\"\\r\\n\");\n info = sdscatprintf(info,\n \"# CPU\\r\\n\"\n \"used_cpu_sys:%.2f\\r\\n\"\n \"used_cpu_user:%.2f\\r\\n\"\n \"used_cpu_sys_children:%.2f\\r\\n\"\n \"used_cpu_user_children:%.2f\\r\\n\",\n (float)self_ru.ru_stime.tv_sec+(float)self_ru.ru_stime.tv_usec/1000000,\n (float)self_ru.ru_utime.tv_sec+(float)self_ru.ru_utime.tv_usec/1000000,\n (float)c_ru.ru_stime.tv_sec+(float)c_ru.ru_stime.tv_usec/1000000,\n (float)c_ru.ru_utime.tv_sec+(float)c_ru.ru_utime.tv_usec/1000000);\n }\n\n /* cmdtime */\n if (allsections || !strcasecmp(section,\"commandstats\")) {\n if (sections++) info = sdscat(info,\"\\r\\n\");\n info = sdscatprintf(info, \"# Commandstats\\r\\n\");\n numcommands = sizeof(redisCommandTable)/sizeof(struct redisCommand);\n for (j = 0; j < numcommands; j++) {\n struct redisCommand *c = redisCommandTable+j;\n\n if (!c->calls) continue;\n info = sdscatprintf(info,\n \"cmdstat_%s:calls=%lld,usec=%lld,usec_per_call=%.2f\\r\\n\",\n c->name, c->calls, c->microseconds,\n (c->calls == 0) ? 0 : ((float)c->microseconds/c->calls));\n }\n }\n\n /* Cluster */\n if (allsections || defsections || !strcasecmp(section,\"cluster\")) {\n if (sections++) info = sdscat(info,\"\\r\\n\");\n info = sdscatprintf(info,\n \"# Cluster\\r\\n\"\n \"cluster_enabled:%d\\r\\n\",\n server.cluster_enabled);\n }\n\n /* Key space */\n if (allsections || defsections || !strcasecmp(section,\"keyspace\")) {\n if (sections++) info = sdscat(info,\"\\r\\n\");\n info = sdscatprintf(info, \"# Keyspace\\r\\n\");\n for (j = 0; j < server.dbnum; j++) {\n long long keys, vkeys;\n\n keys = dictSize(server.db[j].dict);\n vkeys = dictSize(server.db[j].expires);\n if (keys || vkeys) {\n info = sdscatprintf(info, \"db%d:keys=%lld,expires=%lld\\r\\n\",\n j, keys, vkeys);\n }\n }\n }\n return info;\n}\n\nvoid infoCommand(redisClient *c) {\n char *section = c->argc == 2 ? c->argv[1]->ptr : \"default\";\n\n if (c->argc > 2) {\n addReply(c,shared.syntaxerr);\n return;\n }\n sds info = genRedisInfoString(section);\n addReplySds(c,sdscatprintf(sdsempty(),\"$%lu\\r\\n\",\n (unsigned long)sdslen(info)));\n addReplySds(c,info);\n addReply(c,shared.crlf);\n}\n\nvoid monitorCommand(redisClient *c) {\n /* ignore MONITOR if aleady slave or in monitor mode */\n if (c->flags & REDIS_SLAVE) return;\n\n c->flags |= (REDIS_SLAVE|REDIS_MONITOR);\n c->slaveseldb = 0;\n listAddNodeTail(server.monitors,c);\n addReply(c,shared.ok);\n}\n\n/* ============================ Maxmemory directive ======================== */\n\n/* This function gets called when 'maxmemory' is set on the config file to limit\n * the max memory used by the server, before processing a command.\n *\n * The goal of the function is to free enough memory to keep Redis under the\n * configured memory limit.\n *\n * The function starts calculating how many bytes should be freed to keep\n * Redis under the limit, and enters a loop selecting the best keys to\n * evict accordingly to the configured policy.\n *\n * If all the bytes needed to return back under the limit were freed the\n * function returns REDIS_OK, otherwise REDIS_ERR is returned, and the caller\n * should block the execution of commands that will result in more memory\n * used by the server.\n */\nint freeMemoryIfNeeded(void) {\n size_t mem_used, mem_tofree, mem_freed;\n int slaves = listLength(server.slaves);\n\n /* Remove the size of slaves output buffers and AOF buffer from the\n * count of used memory. */\n mem_used = zmalloc_used_memory();\n if (slaves) {\n listIter li;\n listNode *ln;\n\n listRewind(server.slaves,&li);\n while((ln = listNext(&li))) {\n redisClient *slave = listNodeValue(ln);\n unsigned long obuf_bytes = getClientOutputBufferMemoryUsage(slave);\n if (obuf_bytes > mem_used)\n mem_used = 0;\n else\n mem_used -= obuf_bytes;\n }\n }\n if (server.aof_state != REDIS_AOF_OFF) {\n mem_used -= sdslen(server.aof_buf);\n mem_used -= aofRewriteBufferSize();\n }\n\n /* Check if we are over the memory limit. */\n if (mem_used <= server.maxmemory) return REDIS_OK;\n\n if (server.maxmemory_policy == REDIS_MAXMEMORY_NO_EVICTION)\n return REDIS_ERR; /* We need to free memory, but policy forbids. */\n\n /* Compute how much memory we need to free. */\n mem_tofree = mem_used - server.maxmemory;\n mem_freed = 0;\n while (mem_freed < mem_tofree) {\n int j, k, keys_freed = 0;\n\n for (j = 0; j < server.dbnum; j++) {\n long bestval = 0; /* just to prevent warning */\n sds bestkey = NULL;\n struct dictEntry *de;\n redisDb *db = server.db+j;\n dict *dict;\n\n if (server.maxmemory_policy == REDIS_MAXMEMORY_ALLKEYS_LRU ||\n server.maxmemory_policy == REDIS_MAXMEMORY_ALLKEYS_RANDOM)\n {\n dict = server.db[j].dict;\n } else {\n dict = server.db[j].expires;\n }\n if (dictSize(dict) == 0) continue;\n\n /* volatile-random and allkeys-random policy */\n if (server.maxmemory_policy == REDIS_MAXMEMORY_ALLKEYS_RANDOM ||\n server.maxmemory_policy == REDIS_MAXMEMORY_VOLATILE_RANDOM)\n {\n de = dictGetRandomKey(dict);\n bestkey = dictGetKey(de);\n }\n\n /* volatile-lru and allkeys-lru policy */\n else if (server.maxmemory_policy == REDIS_MAXMEMORY_ALLKEYS_LRU ||\n server.maxmemory_policy == REDIS_MAXMEMORY_VOLATILE_LRU)\n {\n for (k = 0; k < server.maxmemory_samples; k++) {\n sds thiskey;\n long thisval;\n robj *o;\n\n de = dictGetRandomKey(dict);\n thiskey = dictGetKey(de);\n /* When policy is volatile-lru we need an additonal lookup\n * to locate the real key, as dict is set to db->expires. */\n if (server.maxmemory_policy == REDIS_MAXMEMORY_VOLATILE_LRU)\n de = dictFind(db->dict, thiskey);\n o = dictGetVal(de);\n thisval = estimateObjectIdleTime(o);\n\n /* Higher idle time is better candidate for deletion */\n if (bestkey == NULL || thisval > bestval) {\n bestkey = thiskey;\n bestval = thisval;\n }\n }\n }\n\n /* volatile-ttl */\n else if (server.maxmemory_policy == REDIS_MAXMEMORY_VOLATILE_TTL) {\n for (k = 0; k < server.maxmemory_samples; k++) {\n sds thiskey;\n long thisval;\n\n de = dictGetRandomKey(dict);\n thiskey = dictGetKey(de);\n thisval = (long) dictGetVal(de);\n\n /* Expire sooner (minor expire unix timestamp) is better\n * candidate for deletion */\n if (bestkey == NULL || thisval < bestval) {\n bestkey = thiskey;\n bestval = thisval;\n }\n }\n }\n\n /* Finally remove the selected key. */\n if (bestkey) {\n long long delta;\n\n robj *keyobj = createStringObject(bestkey,sdslen(bestkey));\n propagateExpire(db,keyobj);\n /* We compute the amount of memory freed by dbDelete() alone.\n * It is possible that actually the memory needed to propagate\n * the DEL in AOF and replication link is greater than the one\n * we are freeing removing the key, but we can't account for\n * that otherwise we would never exit the loop.\n *\n * AOF and Output buffer memory will be freed eventually so\n * we only care about memory used by the key space. */\n delta = (long long) zmalloc_used_memory();\n dbDelete(db,keyobj);\n delta -= (long long) zmalloc_used_memory();\n mem_freed += delta;\n server.stat_evictedkeys++;\n decrRefCount(keyobj);\n keys_freed++;\n\n /* When the memory to free starts to be big enough, we may\n * start spending so much time here that is impossible to\n * deliver data to the slaves fast enough, so we force the\n * transmission here inside the loop. */\n if (slaves) flushSlavesOutputBuffers();\n }\n }\n if (!keys_freed) return REDIS_ERR; /* nothing to free... */\n }\n return REDIS_OK;\n}\n\n/* =================================== Main! ================================ */\n\n#ifdef __linux__\nint linuxOvercommitMemoryValue(void) {\n FILE *fp = fopen(\"/proc/sys/vm/overcommit_memory\",\"r\");\n char buf[64];\n\n if (!fp) return -1;\n if (fgets(buf,64,fp) == NULL) {\n fclose(fp);\n return -1;\n }\n fclose(fp);\n\n return atoi(buf);\n}\n\nvoid linuxOvercommitMemoryWarning(void) {\n if (linuxOvercommitMemoryValue() == 0) {\n redisLog(REDIS_WARNING,\"WARNING overcommit_memory is set to 0! Background save may fail under low memory condition. To fix this issue add 'vm.overcommit_memory = 1' to /etc/sysctl.conf and then reboot or run the command 'sysctl vm.overcommit_memory=1' for this to take effect.\");\n }\n}\n#endif /* __linux__ */\n\nvoid createPidFile(void) {\n /* Try to write the pid file in a best-effort way. */\n FILE *fp = fopen(server.pidfile,\"w\");\n if (fp) {\n fprintf(fp,\"%d\\n\",(int)getpid());\n fclose(fp);\n }\n}\n\nvoid daemonize(void) {\n int fd;\n\n if (fork() != 0) exit(0); /* parent exits */\n setsid(); /* create a new session */\n\n /* Every output goes to /dev/null. If Redis is daemonized but\n * the 'logfile' is set to 'stdout' in the configuration file\n * it will not log at all. */\n if ((fd = open(\"/dev/null\", O_RDWR, 0)) != -1) {\n dup2(fd, STDIN_FILENO);\n dup2(fd, STDOUT_FILENO);\n dup2(fd, STDERR_FILENO);\n if (fd > STDERR_FILENO) close(fd);\n }\n}\n\nvoid version() {\n printf(\"Redis server v=%s sha=%s:%d malloc=%s bits=%d\\n\",\n REDIS_VERSION,\n redisGitSHA1(),\n atoi(redisGitDirty()) > 0,\n ZMALLOC_LIB,\n sizeof(long) == 4 ? 32 : 64);\n exit(0);\n}\n\nvoid usage() {\n fprintf(stderr,\"Usage: ./redis-server [/path/to/redis.conf] [options]\\n\");\n fprintf(stderr,\" ./redis-server - (read config from stdin)\\n\");\n fprintf(stderr,\" ./redis-server -v or --version\\n\");\n fprintf(stderr,\" ./redis-server -h or --help\\n\");\n fprintf(stderr,\" ./redis-server --test-memory \\n\\n\");\n fprintf(stderr,\"Examples:\\n\");\n fprintf(stderr,\" ./redis-server (run the server with default conf)\\n\");\n fprintf(stderr,\" ./redis-server /etc/redis/6379.conf\\n\");\n fprintf(stderr,\" ./redis-server --port 7777\\n\");\n fprintf(stderr,\" ./redis-server --port 7777 --slaveof 127.0.0.1 8888\\n\");\n fprintf(stderr,\" ./redis-server /etc/myredis.conf --loglevel verbose\\n\");\n exit(1);\n}\n\nvoid redisAsciiArt(void) {\n#include \"asciilogo.h\"\n char *buf = zmalloc(1024*16);\n\n snprintf(buf,1024*16,ascii_logo,\n REDIS_VERSION,\n redisGitSHA1(),\n strtol(redisGitDirty(),NULL,10) > 0,\n (sizeof(long) == 8) ? \"64\" : \"32\",\n server.cluster_enabled ? \"cluster\" : \"stand alone\",\n server.port,\n (long) getpid()\n );\n redisLogRaw(REDIS_NOTICE|REDIS_LOG_RAW,buf);\n zfree(buf);\n}\n\nstatic void sigtermHandler(int sig) {\n REDIS_NOTUSED(sig);\n\n redisLogFromHandler(REDIS_WARNING,\"Received SIGTERM, scheduling shutdown...\");\n server.shutdown_asap = 1;\n}\n\nvoid setupSignalHandlers(void) {\n struct sigaction act;\n\n /* When the SA_SIGINFO flag is set in sa_flags then sa_sigaction is used.\n * Otherwise, sa_handler is used. */\n sigemptyset(&act.sa_mask);\n act.sa_flags = 0;\n act.sa_handler = sigtermHandler;\n sigaction(SIGTERM, &act, NULL);\n\n#ifdef HAVE_BACKTRACE\n sigemptyset(&act.sa_mask);\n act.sa_flags = SA_NODEFER | SA_RESETHAND | SA_SIGINFO;\n act.sa_sigaction = sigsegvHandler;\n sigaction(SIGSEGV, &act, NULL);\n sigaction(SIGBUS, &act, NULL);\n sigaction(SIGFPE, &act, NULL);\n sigaction(SIGILL, &act, NULL);\n#endif\n return;\n}\n\nvoid memtest(size_t megabytes, int passes);\n\nint main(int argc, char **argv) {\n long long start;\n struct timeval tv;\n\n /* We need to initialize our libraries, and the server configuration. */\n zmalloc_enable_thread_safeness();\n srand(time(NULL)^getpid());\n gettimeofday(&tv,NULL);\n dictSetHashFunctionSeed(tv.tv_sec^tv.tv_usec^getpid());\n initServerConfig();\n\n if (argc >= 2) {\n int j = 1; /* First option to parse in argv[] */\n sds options = sdsempty();\n char *configfile = NULL;\n\n /* Handle special options --help and --version */\n if (strcmp(argv[1], \"-v\") == 0 ||\n strcmp(argv[1], \"--version\") == 0) version();\n if (strcmp(argv[1], \"--help\") == 0 ||\n strcmp(argv[1], \"-h\") == 0) usage();\n if (strcmp(argv[1], \"--test-memory\") == 0) {\n if (argc == 3) {\n memtest(atoi(argv[2]),50);\n exit(0);\n } else {\n fprintf(stderr,\"Please specify the amount of memory to test in megabytes.\\n\");\n fprintf(stderr,\"Example: ./redis-server --test-memory 4096\\n\\n\");\n exit(1);\n }\n }\n\n /* First argument is the config file name? */\n if (argv[j][0] != '-' || argv[j][1] != '-')\n configfile = argv[j++];\n /* All the other options are parsed and conceptually appended to the\n * configuration file. For instance --port 6380 will generate the\n * string \"port 6380\\n\" to be parsed after the actual file name\n * is parsed, if any. */\n while(j != argc) {\n if (argv[j][0] == '-' && argv[j][1] == '-') {\n /* Option name */\n if (sdslen(options)) options = sdscat(options,\"\\n\");\n options = sdscat(options,argv[j]+2);\n options = sdscat(options,\" \");\n } else {\n /* Option argument */\n options = sdscatrepr(options,argv[j],strlen(argv[j]));\n options = sdscat(options,\" \");\n }\n j++;\n }\n resetServerSaveParams();\n loadServerConfig(configfile,options);\n sdsfree(options);\n } else {\n redisLog(REDIS_WARNING,\"Warning: no config file specified, using the default config. In order to specify a config file use 'redis-server /path/to/redis.conf'\");\n }\n if (server.daemonize) daemonize();\n initServer();\n if (server.daemonize) createPidFile();\n redisAsciiArt();\n redisLog(REDIS_WARNING,\"Server started, Redis version \" REDIS_VERSION);\n#ifdef __linux__\n linuxOvercommitMemoryWarning();\n#endif\n start = ustime();\n if (server.aof_state == REDIS_AOF_ON) {\n if (loadAppendOnlyFile(server.aof_filename) == REDIS_OK)\n redisLog(REDIS_NOTICE,\"DB loaded from append only file: %.3f seconds\",(float)(ustime()-start)/1000000);\n } else {\n if (rdbLoad(server.rdb_filename) == REDIS_OK) {\n redisLog(REDIS_NOTICE,\"DB loaded from disk: %.3f seconds\",\n (float)(ustime()-start)/1000000);\n } else if (errno != ENOENT) {\n redisLog(REDIS_WARNING,\"Fatal error loading the DB. Exiting.\");\n exit(1);\n }\n }\n if (server.ipfd > 0)\n redisLog(REDIS_NOTICE,\"The server is now ready to accept connections on port %d\", server.port);\n if (server.sofd > 0)\n redisLog(REDIS_NOTICE,\"The server is now ready to accept connections at %s\", server.unixsocket);\n aeSetBeforeSleepProc(server.el,beforeSleep);\n aeMain(server.el);\n aeDeleteEventLoop(server.el);\n return 0;\n}\n\n/* The End */\n" }, { "path": "src/test/resources/samples/langs/C/rf_io.c", "content": "/**\n** Copyright (c) 2011-2012, Karapetsas Eleftherios\n** All rights reserved.\n**\n** Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:\n** 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n** 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in\n** the documentation and/or other materials provided with the distribution.\n** 3. Neither the name of the Original Author of Refu nor the names of its contributors may be used to endorse or promote products derived from\n**\n** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES,\n** INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n** DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n** SERVICES;LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n** WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (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#include \n\n#include \n#include \n#include \"io_private.h\"\n#include \n#include // for rfUTF8_IsContinuationbyte\n#include // for malloc\n#include // for memcpy e.t.c.\n\n\n// Reads a UTF-8 file descriptor until end of line or EOF is found and returns a UTF-8 byte buffer\nint32_t rfFReadLine_UTF8(FILE* f,char** utf8,uint32_t* byteLength,uint32_t* bufferSize,char* eof)\n{\n int32_t bytesN;\n uint32_t bIndex=0;\n#ifdef RF_NEWLINE_CRLF\n char newLineFound = false;\n#endif\n // allocate the utf8 buffer\n *bufferSize = RF_OPTION_FGETS_READBYTESN+4;\n RF_MALLOC(*utf8,*bufferSize)\n *byteLength = 0;\n // read the start\n bytesN = rfFgets_UTF8(*utf8,RF_OPTION_FGETS_READBYTESN,f,eof);\n (*byteLength)+=bytesN;\n\n if(bytesN < 0)//error check\n {\n LOG_ERROR(\"Failed to read a UTF-8 file\",bytesN);\n free(*utf8);\n return bytesN;\n }\n // if the last character was a newline we are done\n if(*((*utf8)+bytesN-1) == (char)RF_LF)\n {\n#ifdef RF_NEWLINE_CRLF\n if(*((*utf8)+bytesN-2) == (char)RF_CR)\n {\n *((*utf8)+bytesN-2) = RF_LF;\n *((*utf8)+bytesN-1) = '\\0';\n (*byteLength)-=1;\n }\n#endif\n return bytesN;\n }\n\n if(bytesN >= RF_OPTION_FGETS_READBYTESN && (*eof)==false)// if the size does not fit in the buffer and if we did not reach the end of file\n {\n // keep reading until we have read all until newline or EOF\n while(bytesN >= RF_OPTION_FGETS_READBYTESN && (*eof)==false)\n {\n if(*byteLength+RF_OPTION_FGETS_READBYTESN+4 >= *bufferSize)\n {\n *bufferSize=(*byteLength+RF_OPTION_FGETS_READBYTESN+4)*2;\n RF_REALLOC(*utf8,char,*bufferSize);\n }\n bIndex += bytesN;\n bytesN = rfFgets_UTF8((*utf8)+bIndex,RF_OPTION_FGETS_READBYTESN,f,eof);\n (*byteLength)+=bytesN;\n if(bytesN < 0)// error check\n {\n LOG_ERROR(\"StringX Initialization from file failed in file reading\",bytesN);\n free(*utf8);\n return bytesN;\n }\n // if the last character was a newline break\n if(*((*utf8)+bIndex+bytesN-1) == (char)RF_LF)\n {\n#ifdef RF_NEWLINE_CRLF\n newLineFound = true;\n#endif\n break;\n }\n }// end of reading loop\n#ifdef RF_NEWLINE_CRLF\n if(newLineFound==true)\n if(*((*utf8)+bIndex+bytesN-2) == (char)RF_CR)\n {\n *((*utf8)+bIndex+bytesN-2) = RF_LF;\n *((*utf8)+bIndex+bytesN-1) = '\\0';\n (*byteLength)-=1;\n }\n\n#endif\n return bIndex;\n }// end of size not fitting the initial buffer case\n else\n {\n#ifdef RF_NEWLINE_CRLF\n // if the last character was a newline\n if(*((*utf8)+bytesN-1) == (char)RF_LF)\n {\n if(*((*utf8)+bytesN-2) == (char)RF_CR)\n {\n *((*utf8)+bytesN-2) = RF_LF;\n *((*utf8)+bytesN-1) = '\\0';\n (*byteLength)-=1;\n }\n }\n#endif\n // case of size fully fitting the buffer\n return bytesN;\n }\n}\n// Reads a Little Endian UTF-16 file descriptor until end of line or EOF is found and returns a UTF-8 byte buffer\nint32_t rfFReadLine_UTF16LE(FILE* f,char** utf8,uint32_t* byteLength,char* eof)\n{\n char buff[RF_OPTION_FGETS_READBYTESN+5];\n int32_t bytesN;\n uint32_t *codepoints,charsN,bIndex=0,buffSize=RF_OPTION_FGETS_READBYTESN+5,accum;\n char* tempBuff = 0,buffAllocated=false;\n\n bytesN = rfFgets_UTF16LE(buff,RF_OPTION_FGETS_READBYTESN,f,eof);\n accum = (uint32_t)bytesN;\n tempBuff = &buff[0];// point the tempBuff to the initial buffer for now\n if(bytesN < 0)// error check\n {\n LOG_ERROR(\"Failed to read from a Little Endian UTF-16 file\",bytesN);\n return bytesN;\n }\n else if(bytesN >= RF_OPTION_FGETS_READBYTESN && (*eof)==false)// if the size does not fit in the buffer and if we did not reach the EOF\n {\n // allocate the temporary buffer and move the previous buffer's content inside it\n buffSize=buffSize*2+5;\n RF_MALLOC(tempBuff,buffSize);\n memcpy(tempBuff,buff,bytesN);\n bIndex=bytesN;\n buffAllocated = true;\n // keep reading until we have read all until newline or EOF\n do\n {\n bytesN = rfFgets_UTF16LE(tempBuff+bIndex,RF_OPTION_FGETS_READBYTESN,f,eof);\n accum += bytesN;\n if(bytesN < 0)// error check\n {\n LOG_ERROR(\"Failed to read from a Little Endian UTF-16 file\",bytesN);\n free(tempBuff);\n return bytesN;\n }\n // realloc to have more space in the buffer for reading if needed\n if(accum+RF_OPTION_FGETS_READBYTESN+5 >= buffSize)\n {\n buffSize=(accum+RF_OPTION_FGETS_READBYTESN+5)*2;\n RF_REALLOC(tempBuff,char,buffSize);\n }\n bIndex += bytesN;\n // if the last character was newline break off the loop\n if( *(uint16_t*)(tempBuff+bIndex-2)== (uint16_t)RF_LF)\n break;\n }while(bytesN >= RF_OPTION_FGETS_READBYTESN && (*eof)==false);//end of reading loop\n }// end of size not fitting the initial buffer case\n if(bytesN >0)//determine the amount of bytes read\n bIndex+=bytesN;\n // allocate the codepoints\n RF_MALLOC(codepoints,(bIndex+5)*2)\n // decode it into codepoints\n if(rfUTF16_Decode(tempBuff,&charsN,codepoints)==false)\n {\n free(codepoints);\n if(buffAllocated==true)\n free(tempBuff);\n LOG_ERROR(\"Failed to Decode UTF-16 from a File Descriptor\",RE_UTF16_INVALID_SEQUENCE);\n return RE_UTF16_INVALID_SEQUENCE;\n }\n // now encode these codepoints into UTF8\n if(((*utf8)=rfUTF8_Encode(codepoints,charsN,byteLength)) == 0)\n {\n free(codepoints);\n if(buffAllocated==true)\n free(tempBuff);\n LOG_ERROR(\"Failed to encode the File Descriptor's UTF-16 bytestream to UTF-8\",RE_UTF8_ENCODING);\n return RE_UTF8_ENCODING;// error\n }\n // success\n free(codepoints);\n if(buffAllocated==true)\n free(tempBuff);\n#ifdef RF_NEWLINE_CRLF\n // if the last character was a newline\n if(*((*utf8)+(*byteLength)-1) == (char)RF_LF)\n {\n if(*((*utf8)+(*byteLength)-2) == (char)RF_CR)\n {\n *((*utf8)+(*byteLength)-2) = RF_LF;\n *((*utf8)+(*byteLength)-1) = '\\0';\n (*byteLength)-=1;\n }\n }\n#endif\n\n\n return bIndex;\n}\n// Reads a Big Endian UTF-16 file descriptor until end of line or EOF is found and returns a UTF-8 byte buffer\nint32_t rfFReadLine_UTF16BE(FILE* f,char** utf8,uint32_t* byteLength,char* eof)\n{\n char buff[RF_OPTION_FGETS_READBYTESN+5];\n int32_t bytesN;\n uint32_t *codepoints,charsN,bIndex=0,buffSize=RF_OPTION_FGETS_READBYTESN+5,accum;\n char* tempBuff = 0,buffAllocated=false;\n\n bytesN = rfFgets_UTF16BE(buff,RF_OPTION_FGETS_READBYTESN,f,eof);\n accum = (uint32_t)bytesN;\n tempBuff = &buff[0];// point the tempBuff to the initial buffer for now\n if(bytesN < 0)// error check\n {\n LOG_ERROR(\"Failed to read from a Big Endian UTF-16 file\",bytesN);\n return bytesN;\n }\n else if(bytesN >= RF_OPTION_FGETS_READBYTESN && (*eof)==false)// if the size does not fit in the buffer and if we did not reach the EOF\n {\n // allocate the temporary buffer and move the previous buffer's content inside it\n buffSize=buffSize*2+5;\n RF_MALLOC(tempBuff,buffSize);\n memcpy(tempBuff,buff,bytesN);\n bIndex=bytesN;\n buffAllocated = true;\n // keep reading until we have read all until newline or EOF\n do\n {\n bytesN = rfFgets_UTF16BE(tempBuff+bIndex,RF_OPTION_FGETS_READBYTESN,f,eof);\n accum+=bytesN;\n if(bytesN < 0)// error check\n {\n LOG_ERROR(\"Failed to read from a Big Endian UTF-16 file\",bytesN);\n free(tempBuff);\n return bytesN;\n }\n // realloc to have more space in the buffer for reading if needed\n if(accum+RF_OPTION_FGETS_READBYTESN+5 >= buffSize)\n {\n buffSize=(accum+RF_OPTION_FGETS_READBYTESN+5)*2;\n RF_REALLOC(tempBuff,char,buffSize);\n }\n bIndex += bytesN;\n // if the last character was newline break off the loop\n if( (*(uint16_t*)(tempBuff+bIndex-2))== (uint16_t)RF_LF)\n break;\n }while(bytesN >= RF_OPTION_FGETS_READBYTESN && (*eof)==false);// end of reading loop\n }// end of size not fitting the initial buffer case\n if(bytesN >0)// determine the amount of bytes read\n bIndex+=bytesN;\n // allocate the codepoints\n RF_MALLOC(codepoints,(bIndex+5)*2)\n // decode it into codepoints\n if(rfUTF16_Decode(tempBuff,&charsN,codepoints)==false)\n {\n free(codepoints);\n if(buffAllocated==true)\n free(tempBuff);\n LOG_ERROR(\"Failed to Decode UTF-16 from a File Descriptor\",RE_UTF16_INVALID_SEQUENCE);\n return RE_UTF16_INVALID_SEQUENCE;\n }\n // now encode these codepoints into UTF8\n if(((*utf8)=rfUTF8_Encode(codepoints,charsN,byteLength)) == 0)\n {\n free(codepoints);\n if(buffAllocated==true)\n free(tempBuff);\n LOG_ERROR(\"Failed to encode the File Descriptor's UTF-16 bytestream to UTF-8\",RE_UTF8_ENCODING);\n return RE_UTF8_ENCODING;//error\n }\n // success\n free(codepoints);\n if(buffAllocated==true)\n free(tempBuff);\n#ifdef RF_NEWLINE_CRLF\n // if the last character was a newline\n if(*((*utf8)+(*byteLength)-1) == (char)RF_LF)\n {\n if(*((*utf8)+(*byteLength)-2) == (char)RF_CR)\n {\n *((*utf8)+(*byteLength)-2) = RF_LF;\n *((*utf8)+(*byteLength)-1) = '\\0';\n (*byteLength)-=1;\n }\n }\n#endif\n return bIndex;\n}\n// Reads a Big Endian UTF-32 file descriptor until end of line or EOF is found and returns a UTF-8 byte buffer\nint32_t rfFReadLine_UTF32BE(FILE* f,char** utf8,uint32_t* byteLength,char* eof)\n{\n char buff[RF_OPTION_FGETS_READBYTESN+7];\n int32_t bytesN;\n uint32_t *codepoints,bIndex=0,buffSize=RF_OPTION_FGETS_READBYTESN+7,accum;\n char* tempBuff = 0,buffAllocated=false;\n bytesN = rfFgets_UTF32BE(buff,RF_OPTION_FGETS_READBYTESN,f,eof);\n accum = (uint32_t)bytesN;\n tempBuff = &buff[0];// point the tempBuff to the initial buffer for now\n if(bytesN < 0)// error check\n {\n LOG_ERROR(\"Failed to read from a Big Endian UTF-32 file\",bytesN);\n return bytesN;\n }\n else if(bytesN >= RF_OPTION_FGETS_READBYTESN && (*eof)==false)// if the size does not fit in the buffer and if we did not reach the EOF\n {\n // allocate the temporary buffer and move the previous buffer's content inside it\n buffSize=buffSize*2+7;\n RF_MALLOC(tempBuff,buffSize);\n memcpy(tempBuff,buff,bytesN);\n bIndex=bytesN;\n buffAllocated = true;\n // keep reading until we have read all until newline or EOF\n do\n {\n bytesN = rfFgets_UTF32BE(tempBuff+bIndex,RF_OPTION_FGETS_READBYTESN,f,eof);\n accum+=bytesN;\n if(bytesN < 0)// error check\n {\n LOG_ERROR(\"Failed to read from a Big Endian UTF-16 file\",bytesN);\n free(tempBuff);\n return bytesN;\n }\n // realloc to have more space in the buffer for reading if needed\n if(accum+RF_OPTION_FGETS_READBYTESN+7 >= buffSize)\n {\n buffSize=(accum+RF_OPTION_FGETS_READBYTESN+7)*2;\n RF_REALLOC(tempBuff,char,buffSize);\n }\n bIndex += bytesN;\n // if the last character was newline break off the loop\n if( (*(uint32_t*)(tempBuff+bIndex-4))== (uint32_t)RF_LF)\n break;\n }while(bytesN >= RF_OPTION_FGETS_READBYTESN && (*eof)==false);// end of reading loop\n }// end of size not fitting the initial buffer case\n if(bytesN >0)//determine the amount of bytes read\n bIndex+=bytesN;\n // utf-32 is actually codepoints\n codepoints = (uint32_t*)tempBuff;\n // now encode these codepoints into UTF8\n if(((*utf8)=rfUTF8_Encode(codepoints,bIndex/4,byteLength)) == 0)\n {\n if(buffAllocated==true)\n free(tempBuff);\n LOG_ERROR(\"Failed to encode the File Descriptor's UTF-32 bytestream to UTF-8\",RE_UTF8_ENCODING);\n return RE_UTF8_ENCODING;// error\n }\n // success\n if(buffAllocated==true)\n free(tempBuff);\n#ifdef RF_NEWLINE_CRLF\n // if the last character was a newline\n if(*((*utf8)+(*byteLength)-1) == (char)RF_LF)\n {\n if(*((*utf8)+(*byteLength)-2) == (char)RF_CR)\n {\n *((*utf8)+(*byteLength)-2) = RF_LF;\n *((*utf8)+(*byteLength)-1) = '\\0';\n (*byteLength)-=1;\n }\n }\n#endif\n return bIndex;\n}\n// Reads a Little Endian UTF-32 file descriptor until end of line or EOF is found and returns a UTF-8 byte buffer\nint32_t rfFReadLine_UTF32LE(FILE* f,char** utf8,uint32_t* byteLength,char* eof)\n{\n char buff[RF_OPTION_FGETS_READBYTESN+7];\n int32_t bytesN;\n uint32_t *codepoints,bIndex=0,buffSize=RF_OPTION_FGETS_READBYTESN+7,accum;\n char* tempBuff = 0,buffAllocated=false;\n bytesN = rfFgets_UTF32LE(buff,RF_OPTION_FGETS_READBYTESN,f,eof);\n accum = (uint32_t) bytesN;\n tempBuff = &buff[0];// point the tempBuff to the initial buffer for now\n if(bytesN < 0)// error check\n {\n LOG_ERROR(\"Failed to read from a Little Endian UTF-32 file\",bytesN);\n return bytesN;\n }\n else if(bytesN >= RF_OPTION_FGETS_READBYTESN && (*eof)==false)// if the size does not fit in the buffer and if we did not reach the EOF\n {\n // allocate the temporary buffer and move the previous buffer's content inside it\n buffSize=buffSize*2+7;\n RF_MALLOC(tempBuff,buffSize);\n memcpy(tempBuff,buff,bytesN);\n bIndex=bytesN;\n buffAllocated = true;\n // keep reading until we have read all until newline or EOF\n do\n {\n bytesN = rfFgets_UTF32LE(tempBuff+bIndex,RF_OPTION_FGETS_READBYTESN,f,eof);\n accum +=bytesN;\n if(bytesN < 0)// error check\n {\n LOG_ERROR(\"Failed to read from a Little Endian UTF-16 file\",bytesN);\n free(tempBuff);\n return bytesN;\n }\n // realloc to have more space in the buffer for reading if needed\n if(accum+RF_OPTION_FGETS_READBYTESN+7 >= buffSize)\n {\n buffSize=(accum+RF_OPTION_FGETS_READBYTESN+7)*2;\n RF_REALLOC(tempBuff,char,buffSize);\n }\n bIndex += bytesN;\n // if the last character was newline break off the loop\n if( (*(uint32_t*)(tempBuff+bIndex-4))== (uint32_t)RF_LF)\n break;\n }while(bytesN >= RF_OPTION_FGETS_READBYTESN && (*eof)==false);// end of reading loop\n }// end of size not fitting the initial buffer case\n if(bytesN >0)// determine the amount of bytes read\n bIndex+=bytesN;\n // utf-32 is actually codepoints\n codepoints = (uint32_t*)tempBuff;\n // now encode these codepoints into UTF8\n if(((*utf8)=rfUTF8_Encode(codepoints,bIndex/4,byteLength)) == 0)\n {\n if(buffAllocated==true)\n free(tempBuff);\n LOG_ERROR(\"Failed to encode the File Descriptor's UTF-32 bytestream to UTF-8\",RE_UTF8_ENCODING);\n return RE_UTF8_ENCODING;// error\n }\n // success\n if(buffAllocated==true)\n free(tempBuff);\n#ifdef RF_NEWLINE_CRLF\n // if the last character was a newline\n if(*((*utf8)+(*byteLength)-1) == (char)RF_LF)\n {\n if(*((*utf8)+(*byteLength)-2) == (char)RF_CR)\n {\n *((*utf8)+(*byteLength)-2) = RF_LF;\n *((*utf8)+(*byteLength)-1) = '\\0';\n (*byteLength)-=1;\n }\n }\n#endif\n return bIndex;\n}\n\n// This is a function that's similar to c library fgets but it also returns the number of bytes read and works for UTF-32 encoded files\nint32_t rfFgets_UTF32BE(char* buff,uint32_t num,FILE* f,char* eofReached)\n{\n uint32_t size,c;\n int32_t error;\n // initialization\n *eofReached = false;\n size = 0;\n // if end of file or end of line is not found, keep reading\n do{\n if((error=rfFgetc_UTF32BE(f,(uint32_t*)(buff+size))) != RF_SUCCESS)\n {\n if(error == RE_FILE_EOF)\n {\n break;// EOF found\n *eofReached = true;\n }\n LOG_ERROR(\"Reading error while reading from a Big Endian UTF-32 file\",error);\n return error;\n }\n size+= 4;\n // if we have read the number of characters requested by the function\n if(size >= num)\n {\n break;\n }\n // get the last character read\n c = *(uint32_t*)(buff+size-4);\n }while(c != (uint32_t)EOF && !RF_HEXEQ_UI(c,RF_LF));\n // null terminate the buffer for UTF32\n buff[size] = buff[size+1] = buff[size+2] = buff[size+3] = '\\0';\n // finally check yet again for end of file right after the new line\n if((error=rfFgetc_UTF32BE(f,&c))!=RF_SUCCESS)\n {\n if(error == RE_FILE_EOF)\n {// EOF\n *eofReached = true;\n }\n else\n {\n LOG_ERROR(\"Reading error while reading from a Big Endian UTF-32 file\",error);\n return error;\n }\n }\n else// undo the peek ahead of the file pointer\n fseek(f,-4,SEEK_CUR);\n return size;\n}\n// This is a function that's similar to c library fgets but it also returns the number of bytes read and works for UTF-32 encoded files\nint32_t rfFgets_UTF32LE(char* buff,uint32_t num,FILE* f,char* eofReached)\n{\n uint32_t size,c;\n int32_t error;\n // initialization\n *eofReached = false;\n size = 0;\n // if end of file or end of line is not found, keep reading\n do{\n if((error=rfFgetc_UTF32LE(f,(uint32_t*)(buff+size))) != RF_SUCCESS)\n {\n if(error == RE_FILE_EOF)\n {\n break;// EOF found\n *eofReached = true;\n }\n LOG_ERROR(\"Reading error while reading from a Little Endian UTF-32 file\",error);\n return error;\n }\n size+= 4;\n // if we have read the number of characters requested by the function\n if(size >= num)\n {\n break;\n }\n // get the last character read\n c = *(uint32_t*)(buff+size-4);\n }while(c !=(uint32_t) EOF && !RF_HEXEQ_UI(c,RF_LF));\n // null terminate the buffer for UTF32\n buff[size] = buff[size+1] = buff[size+2] = buff[size+3] = '\\0';\n // finally check yet again for end of file right after the new line\n if((error=rfFgetc_UTF32LE(f,&c))!=RF_SUCCESS)\n {\n if(error == RE_FILE_EOF)\n {// EOF\n *eofReached = true;\n }\n else\n {\n LOG_ERROR(\"Reading error while reading from a Little Endian UTF-32 file\",error);\n return error;\n }\n }\n else// undo the peek ahead of the file pointer\n fseek(f,-4,SEEK_CUR);\n return size;\n}\n// Gets a number of bytes from a BIG endian UTF-16 file descriptor\nint32_t rfFgets_UTF16BE(char* buff,uint32_t num,FILE* f,char* eofReached)\n{\n uint32_t size,c;\n int32_t bytesN;\n // initialization\n *eofReached = false;\n size = 0;\n // if end of file or end of line is not found, keep reading\n do{\n bytesN = rfFgetc_UTF16BE(f,(uint32_t*)(buff+size),false);\n // error check\n if(bytesN < 0)\n {\n if(bytesN == RE_FILE_EOF)\n {\n break;// EOF found\n *eofReached = true;\n }\n else\n return bytesN;\n }\n size+= bytesN;\n // if we have read the number of characters requested by the function\n if(size >= num)\n {\n break;\n }\n // get the last character read\n c = *(uint32_t*)(buff+size-bytesN);\n }while(c !=(uint32_t) EOF && !RF_HEXEQ_UI(c,RF_LF));\n // null terminate the buffer for UTF16\n buff[size] = buff[size+1] = '\\0';\n // finally check yet again for end of file right after the new line\n bytesN = rfFgetc_UTF16BE(f,&c,false);\n if(bytesN < 0)\n {\n if(bytesN == RE_FILE_EOF)\n {// EOF\n *eofReached = true;\n }\n else// error\n return bytesN;\n }\n else// undo the peek ahead of the file pointer\n fseek(f,-bytesN,SEEK_CUR);\n return size;\n}\n// Gets a number of bytes from a Little endian UTF-16 file descriptor\nint32_t rfFgets_UTF16LE(char* buff,uint32_t num,FILE* f,char* eofReached)\n{\n uint32_t size,c;\n int32_t bytesN;\n // initialization\n *eofReached = false;\n size = 0;\n // if end of file or end of line is not found, keep reading\n do{\n bytesN = rfFgetc_UTF16LE(f,(uint32_t*)(buff+size),false);\n // error check\n if(bytesN < 0)\n {\n if(bytesN == RE_FILE_EOF)\n {\n break;// EOF found\n *eofReached = true;\n }\n else\n return bytesN;\n }\n size+= bytesN;\n // if we have read the number of characters requested by the function\n if(size >= num)\n {\n break;\n }\n // get the last character read\n c = *(uint32_t*)(buff+size-bytesN);\n }while(c !=(uint32_t) EOF && !RF_HEXEQ_UI(c,RF_LF));\n // null terminate the buffer for UTF16\n buff[size] = buff[size+1] = '\\0';\n // finally check yet again for end of file right after the new line\n bytesN = rfFgetc_UTF16LE(f,&c,false);\n if(bytesN < 0)\n {\n if(bytesN == RE_FILE_EOF)\n {// EOF\n *eofReached = true;\n }\n else// error\n return bytesN;\n }\n else// undo the peek ahead of the file pointer\n fseek(f,-bytesN,SEEK_CUR);\n\n return size;\n}\n\n// Gets a number of bytes from a UTF-8 file descriptor\nint32_t rfFgets_UTF8(char* buff,uint32_t num,FILE* f,char* eofReached)\n{\n uint32_t size,c;\n int32_t bytesN;\n // initialization\n *eofReached = false;\n size = 0;\n // if end of file or end of line is not found, keep reading\n do{\n bytesN = rfFgetc_UTF8(f,(uint32_t*)(buff+size),false);\n // error check\n if(bytesN < 0)\n {\n if(bytesN == RE_FILE_EOF)\n {\n break;// EOF found\n *eofReached = true;\n }\n else\n return bytesN;\n }\n size+= bytesN;\n // if we have read the number of characters requested by the function\n if(size >= num)\n {\n break;\n }\n // get the last character\n c = *(uint32_t*)(buff+size-bytesN);\n }while(c !=(uint32_t) EOF && !RF_HEXEQ_UI(c,RF_LF));\n // null terminate the buffer for UTF8\n buff[size] = '\\0';\n // finally check yet again for end of file right after the new line\n if( RF_HEXEQ_C(fgetc(f),EOF))\n {// check for error\n if(ferror(f) != 0)\n {\n LOG_ERROR(\"During reading a UTF-8 file there was a read error\",RE_FILE_READ);\n return RE_FILE_READ;\n }\n // if not it's end of file, so note it and take the pointer back by 1\n *eofReached = true;\n }// undo the peek ahead of the file pointer\n else\n fseek(f,-1,SEEK_CUR);\n return size;\n}\n// Gets a unicode character from a UTF-8 file descriptor\nint32_t rfFgetc_UTF8(FILE* f,uint32_t *ret,char cp)\n{\n char c,c2,c3,c4;\n if( (c = fgetc(f)) == EOF)\n {\n i_READ_CHECK(f,\"While reading a UTF-8 character from the stream\")\n else\n return RE_FILE_EOF;\n }\n // if the lead bit of the byte is 0 then range is : U+0000 to U+0007F (1 byte)\n if( ((c & 0x80)>>7) == 0 )\n {\n /// success\n if(cp == true)\n *ret = c;\n else\n {\n *ret = 0;\n char* cc = (char*) ret;\n cc[0] = c;\n }\n return 1;\n }\n else// we need more bytes\n {\n // if the leading bits are in the form of 0b110xxxxx then range is: U+0080 to U+07FF (2 bytes)\n if( RF_HEXEQ_C( ( (~(c ^ 0xC0))>>5), 0x7) )\n {\n // also remember bytes 0xC0 and 0xC1 are invalid and could possibly be found in a starting byte of this type so check for them here\n if( RF_HEXEQ_C(c,0xC0) || RF_HEXEQ_C(c,0xC1))\n {\n LOG_ERROR(\"While decoding a UTF-8 file byte stream, an invalid byte was encountered\",RE_UTF8_INVALID_SEQUENCE_INVALID_BYTE);\n return RE_UTF8_INVALID_SEQUENCE_INVALID_BYTE;\n }\n // so now read the next byte\n if( (c2 = fgetc(f)) == EOF)\n {\n i_READ_CHECK(f,\"While reading a UTF-8 character from a file stream\")\n else\n {\n LOG_ERROR(\"While decoding a UTF-8 file byte stream, EOF was encountered abruplty in-between bytes\",RE_UTF8_INVALID_SEQUENCE_END);\n return RE_FILE_EOF;\n }\n }\n // if this second byte is NOT a continuation byte\n if( !rfUTF8_IsContinuationByte(c2))\n {\n LOG_ERROR(\"While decoding a UTF-8 file byte stream, and expecting a continuation byte, one was not found\",RE_UTF8_INVALID_SEQUENCE_CONBYTE);\n return RE_UTF8_INVALID_SEQUENCE_CONBYTE;\n }\n /// success\n if(cp == true)// return decoded codepoint\n {\n *ret = 0;\n // from the second byte take the first 6 bits\n *ret = (c2 & 0x3F) ;\n // from the first byte take the first 5 bits and put them in the start\n *ret |= ((c & 0x1F) << 6);\n }\n else\n {\n *ret = 0;\n char* cc = (char*)ret;\n cc[0] = c; cc[1] = c2;\n }\n return 2;\n\n }// end of the 2 bytes case\n // if the leading bits are in the form of 0b1110xxxx then range is U+0800 to U+FFFF (3 bytes)\n else if( RF_HEXEQ_C( ( (~(c ^ 0xE0))>>4),0xF))\n {\n // so now read the next 2 bytes\n if( (c2 = fgetc(f)) == EOF)\n {\n i_READ_CHECK(f,\"While reading a UTF-8 character from a file stream\")\n else\n {\n LOG_ERROR(\"While decoding a UTF-8 file byte stream, EOF was encountered abruplty in-between bytes\",RE_UTF8_INVALID_SEQUENCE_END);\n return RE_FILE_EOF;\n }\n }\n if( (c3 = fgetc(f)) == EOF)\n {\n i_READ_CHECK(f,\"While reading a UTF-8 character from a file stream\")\n else\n {\n LOG_ERROR(\"While decoding a UTF-8 file byte stream, EOF was encountered abruplty in-between bytes\",RE_UTF8_INVALID_SEQUENCE_END);\n return RE_FILE_EOF;\n }\n }\n // if the subsequent bytes are NOT continuation bytes\n if( !rfUTF8_IsContinuationByte(c2) || !rfUTF8_IsContinuationByte(c3))\n {\n LOG_ERROR(\"While decoding a UTF-8 file byte stream, and expecting a continuation byte, one was not found\",RE_UTF8_INVALID_SEQUENCE_CONBYTE);\n return RE_UTF8_INVALID_SEQUENCE_CONBYTE;\n }\n /// success\n if(cp == true)// if we need to decode the codepoint\n {\n *ret = 0;\n // from the third byte take the first 6 bits\n *ret = (c3 & 0x3F) ;\n // from the second byte take the first 6 bits and put them to the left of the previous 6 bits\n *ret |= ((c2 & 0x3F) << 6);\n // from the first byte take the first 4 bits and put them to the left of the previous 6 bits\n *ret |= ((c & 0xF) << 12);\n }\n else\n {\n *ret = 0;\n char* cc = (char*)ret;\n cc[0] = c; cc[1] = c2; cc[2] = c3;\n }\n return 3;\n }// end of 3 bytes case\n // if the leading bits are in the form of 0b11110xxx then range is U+010000 to U+10FFFF (4 bytes)\n else if(RF_HEXEQ_C( ( (~(c ^ 0xF0))>>3), 0x1F))\n {\n // in this type of starting byte a number of invalid bytes can be encountered. We have to check for them.\n if(RF_HEXGE_C(c,0xBF)) //invalid byte value are from 0xBF to 0xFF\n {\n LOG_ERROR(\"While decoding a UTF-8 file byte stream, an invalid byte was encountered\",RE_UTF8_INVALID_SEQUENCE_INVALID_BYTE);\n return RE_UTF8_INVALID_SEQUENCE_INVALID_BYTE;\n }\n // so now read the next 3 bytes\n if( (c2 = fgetc(f)) == EOF)\n {\n i_READ_CHECK(f,\"While reading a UTF-8 character from a file stream\")\n else\n {\n LOG_ERROR(\"While decoding a UTF-8 file byte stream, EOF was encountered abruplty in-between bytes\",RE_UTF8_INVALID_SEQUENCE_END);\n return RE_FILE_EOF;\n }\n }\n if( (c3 = fgetc(f)) == EOF)\n {\n i_READ_CHECK(f,\"While reading a UTF-8 character from a file stream\")\n else\n {\n LOG_ERROR(\"While decoding a UTF-8 file byte stream, EOF was encountered abruplty in-between bytes\",RE_UTF8_INVALID_SEQUENCE_END);\n return RE_FILE_EOF;\n }\n }\n if( (c4 = fgetc(f)) == EOF)\n {\n i_READ_CHECK(f,\"While reading a UTF-8 character from a file stream\")\n else\n {\n LOG_ERROR(\"While decoding a UTF-8 file byte stream, EOF was encountered abruplty in-between bytes\",RE_UTF8_INVALID_SEQUENCE_END);\n return RE_FILE_EOF;\n }\n }\n // if the subsequent bytes are NOT continuation bytes\n if( !rfUTF8_IsContinuationByte(c2) || !rfUTF8_IsContinuationByte(c3) || !rfUTF8_IsContinuationByte(c4))\n {\n LOG_ERROR(\"While decoding a UTF-8 file byte stream, and expecting a continuation byte, one was not found\",RE_UTF8_INVALID_SEQUENCE_CONBYTE);\n return RE_UTF8_INVALID_SEQUENCE_CONBYTE;\n }\n /// success\n if(cp == true) //if we need to decode the codepoint\n {\n *ret = 0;\n // from the fourth byte take the first 6 bits\n *ret = (c4 & 0x3F) ;\n // from the third byte take the first 6 bits and put them to the left of the previous 6 bits\n *ret |= ((c3 & 0x3F) << 6);\n // from the second byte take the first 6 bits and put them to the left of the previous 6 bits\n *ret |= ((c2 & 0x3F) << 12);\n // from the first byte take the first 3 bits and put them to the left of the previous 6 bits\n *ret |= ((c & 0x7) << 18);\n }\n else\n {\n *ret = 0;\n char* cc = (char*)ret;\n cc[0] = c; cc[1] = c2; cc[2] = c3; cc[3]=c4;\n }\n return 4;\n }// end of 4 bytes case\n }// end of needing more than 1 byte\n\n // if we get here means the 1st byte belonged to none of the 4 cases\n LOG_ERROR(\"While decoding a UTF-8 file byte stream, the first byte of a character was invalid UTF-8\",RE_UTF8_INVALID_SEQUENCE_INVALID_BYTE);\n return RE_UTF8_INVALID_SEQUENCE_INVALID_BYTE;\n}\n\n// Gets a unicode character from a Big Endian UTF-16 file descriptor\nint32_t rfFgetc_UTF16BE(FILE* f,uint32_t *c,char cp)\n{\n char swapE=false;\n uint16_t v1,v2;\n // check if we need to be swapping\n if(rfUTILS_Endianess() == RF_LITTLE_ENDIAN)\n swapE = true;\n // read the first 2 bytes\n if(fread(&v1,2,1,f) != 1)\n {\n i_READ_CHECK(f,\"While reading a UTF-16 from a Big Endian File stream\")\n else\n return RE_FILE_EOF;\n }\n if(swapE)// swap endianess if needed\n rfUTILS_SwapEndianUS(&v1);\n /* If the value is in the surrogate area */\n if(RF_HEXGE_US(v1,0xD800) && RF_HEXLE_US(v1,0xDFFF))\n {\n if(RF_HEXL_US(v1,0xD800) || RF_HEXG_US(v1,0xDBFF))\n {\n LOG_ERROR(\"While reading a Big endian UTF-16 file stream the first byte encountered held an illegal value\",RE_UTF16_INVALID_SEQUENCE);\n return RE_UTF16_INVALID_SEQUENCE;\n }\n // then we also need to read its surrogate pair\n if(fread(&v2,2,1,f) != 1)\n {\n i_READ_CHECK(f,\"While reading a UTF-16 from a Big Endian File stream\")\n else\n {\n LOG_ERROR(\"While decoding a UTF-16 Big Endian file byte stream, EOF was encountered abruplty when expecting a surrogate pair\",RE_UTF16_NO_SURRPAIR);\n return RE_FILE_EOF;\n }\n }\n if(swapE)// swap endianess if needed\n rfUTILS_SwapEndianUS(&v2);\n if(RF_HEXL_US(v2,0xDC00) || RF_HEXG_US(v2,0xDFFF))\n {\n LOG_ERROR(\"While reading a Big endian UTF-16 file stream the surrogate pair encountered held an illegal value\",RE_UTF16_INVALID_SEQUENCE);\n return RE_UTF16_INVALID_SEQUENCE;\n }\n if(cp == true)// if the user wants the decoded codepoint\n {\n *c = 0;\n *c = v2&0x3ff;\n *c |= (10<\n#include \n\n#ifdef __cplusplus\nextern \"C\"\n{// opening bracket for calling from C++\n#endif\n\n// New line feed\n#define RF_LF 0xA\n// Carriage Return\n#define RF_CR 0xD\n\n#ifdef REFU_WIN32_VERSION\n #define i_PLUSB_WIN32 \"b\"\n#else\n #define i_PLUSB_WIN32 \"\"\n#endif\n\n// This is the type that represents the file offset\n#ifdef _MSC_VER\ntypedef __int64 foff_rft;\n#else\n#include \ntypedef off64_t foff_rft;\n#endif\n///Fseek and Ftelll definitions\n#ifdef _MSC_VER\n #define rfFseek(i_FILE_,i_OFFSET_,i_WHENCE_) _fseeki64(i_FILE_,i_OFFSET_,i_WHENCE_)\n #define rfFtell(i_FILE_) _ftelli64(i_FILE_)\n#else\n #define rfFseek(i_FILE_,i_OFFSET_,i_WHENCE_) fseeko64(i_FILE_,i_OFFSET_,i_WHENCE_)\n #define rfFtell(i_FILE_) ftello64(i_FILE_)\n#endif\n\n/**\n** @defgroup RF_IOGRP I/O\n** @addtogroup RF_IOGRP\n** @{\n**/\n\n// @brief Reads a UTF-8 file descriptor until end of line or EOF is found and returns a UTF-8 byte buffer\n//\n// The file descriptor at @c f must have been opened in binary and not text mode. That means that if under\n// Windows make sure to call fopen with \"wb\", \"rb\" e.t.c. instead of the simple \"w\", \"r\" e.t.c. since the initial\n// default value under Windows is text mode. Alternatively you can set the initial value using _get_fmode() and\n// _set_fmode(). For more information take a look at the msdn pages here:\n// http://msdn.microsoft.com/en-us/library/ktss1a9b.aspx\n//\n// When the compile flag @c RF_NEWLINE_CRLF is defined (the default case at Windows) then this function\n// shall not be adding any CR character that is found in the file behind a newline character since this is\n// the Windows line ending scheme. Beware though that the returned read bytes value shall still count the CR character inside.\n//\n// @param[in] f The file descriptor to read\n// @param[out] utf8 Give here a refence to an unitialized char* that will be allocated inside the function\n// and contain the utf8 byte buffer. Needs to be freed by the caller explicitly later\n// @param[out] byteLength Give an @c uint32_t here to receive the length of the @c utf8 buffer in bytes\n// @param[out] bufferSize Give an @c uint32_t here to receive the capacity of the @c utf8 buffer in bytes\n// @param[out] eof Pass a pointer to a char to receive a true or false value in case the end of file\n// with reading this line\n// @return Returns either a positive number for success that represents the number of bytes read from @c f and and error in case something goes wrong.\n// The possible errors to return are the same as rfFgets_UTF8()\ni_DECLIMEX_ int32_t rfFReadLine_UTF8(FILE* f,char** utf8,uint32_t* byteLength,uint32_t* bufferSize,char* eof);\n// @brief Reads a Big Endian UTF-16 file descriptor until end of line or EOF is found and returns a UTF-8 byte buffer\n//\n// The file descriptor at @c f must have been opened in binary and not text mode. That means that if under\n// Windows make sure to call fopen with \"wb\", \"rb\" e.t.c. instead of the simple \"w\", \"r\" e.t.c. since the initial\n// default value under Windows is text mode. Alternatively you can set the initial value using _get_fmode() and\n// _set_fmode(). For more information take a look at the msdn pages here:\n// http://msdn.microsoft.com/en-us/library/ktss1a9b.aspx\n//\n// When the compile flag @c RF_NEWLINE_CRLF is defined (the default case at Windows) then this function\n// shall not be adding any CR character that is found in the file behind a newline character since this is\n// the Windows line ending scheme. Beware though that the returned read bytes value shall still count the CR character inside.\n//\n// @param[in] f The file descriptor to read\n// @param[out] utf8 Give here a refence to an unitialized char* that will be allocated inside the function\n// and contain the utf8 byte buffer. Needs to be freed by the caller explicitly later\n// @param[out] byteLength Give an @c uint32_t here to receive the length of the @c utf8 buffer in bytes\n// @param[out] eof Pass a pointer to a char to receive a true or false value in case the end of file\n// with reading this line\n// @return Returns either a positive number for success that represents the number of bytes read from @c f and and error in case something goes wrong.\n// + Any error that can be returned by @ref rfFgets_UTF16BE()\n// + @c RE_UTF16_INVALID_SEQUENCE: Failed to decode the UTF-16 byte stream of the file descriptor\n// + @c RE_UTF8_ENCODING: Failed to encode the UTF-16 of the file descriptor into UTF-8\ni_DECLIMEX_ int32_t rfFReadLine_UTF16BE(FILE* f,char** utf8,uint32_t* byteLength,char* eof);\n// @brief Reads a Little Endian UTF-16 file descriptor until end of line or EOF is found and returns a UTF-8 byte buffer\n//\n// The file descriptor at @c f must have been opened in binary and not text mode. That means that if under\n// Windows make sure to call fopen with \"wb\", \"rb\" e.t.c. instead of the simple \"w\", \"r\" e.t.c. since the initial\n// default value under Windows is text mode. Alternatively you can set the initial value using _get_fmode() and\n// _set_fmode(). For more information take a look at the msdn pages here:\n// http://msdn.microsoft.com/en-us/library/ktss1a9b.aspx\n//\n// When the compile flag @c RF_NEWLINE_CRLF is defined (the default case at Windows) then this function\n// shall not be adding any CR character that is found in the file behind a newline character since this is\n// the Windows line ending scheme. Beware though that the returned read bytes value shall still count the CR character inside.\n//\n// @param[in] f The file descriptor to read\n// @param[out] utf8 Give here a refence to an unitialized char* that will be allocated inside the function\n// and contain the utf8 byte buffer. Needs to be freed by the caller explicitly later\n// @param[out] byteLength Give an @c uint32_t here to receive the length of the @c utf8 buffer in bytes\n// @param[out] eof Pass a pointer to a char to receive a true or false value in case the end of file\n// with reading this line\n// @return Returns either a positive number for success that represents the number of bytes read from @c f and and error in case something goes wrong.\n// + Any error that can be returned by @ref rfFgets_UTF16LE()\n// + @c RE_UTF16_INVALID_SEQUENCE: Failed to decode the UTF-16 byte stream of the file descriptor\n// + @c RE_UTF8_ENCODING: Failed to encode the UTF-16 of the file descriptor into UTF-8\ni_DECLIMEX_ int32_t rfFReadLine_UTF16LE(FILE* f,char** utf8,uint32_t* byteLength,char* eof);\n\n// @brief Reads a Big Endian UTF-32 file descriptor until end of line or EOF is found and returns a UTF-8 byte buffer\n//\n// The file descriptor at @c f must have been opened in binary and not text mode. That means that if under\n// Windows make sure to call fopen with \"wb\", \"rb\" e.t.c. instead of the simple \"w\", \"r\" e.t.c. since the initial\n// default value under Windows is text mode. Alternatively you can set the initial value using _get_fmode() and\n// _set_fmode(). For more information take a look at the msdn pages here:\n// http://msdn.microsoft.com/en-us/library/ktss1a9b.aspx\n//\n// When the compile flag @c RF_NEWLINE_CRLF is defined (the default case at Windows) then this function\n// shall not be adding any CR character that is found in the file behind a newline character since this is\n// the Windows line ending scheme. Beware though that the returned read bytes value shall still count the CR character inside.\n//\n// @param[in] f The file descriptor to read\n// @param[out] utf8 Give here a refence to an unitialized char* that will be allocated inside the function\n// and contain the utf8 byte buffer. Needs to be freed by the caller explicitly later\n// @param[out] byteLength Give an @c uint32_t here to receive the length of the @c utf8 buffer in bytes\n// @param[out] eof Pass a pointer to a char to receive a true or false value in case the end of file\n// with reading this line\n// @return Returns either a positive number for success that represents the number of bytes read from @c f and and error in case something goes wrong.\n// + Any error that can be returned by @ref rfFgets_UTF32BE()\n// + @c RE_UTF8_ENCODING: Failed to encode the UTF-16 of the file descriptor into UTF-8\ni_DECLIMEX_ int32_t rfFReadLine_UTF32BE(FILE* f,char** utf8,uint32_t* byteLength,char* eof);\n// @brief Reads a Little Endian UTF-32 file descriptor until end of line or EOF is found and returns a UTF-8 byte buffer\n//\n// The file descriptor at @c f must have been opened in binary and not text mode. That means that if under\n// Windows make sure to call fopen with \"wb\", \"rb\" e.t.c. instead of the simple \"w\", \"r\" e.t.c. since the initial\n// default value under Windows is text mode. Alternatively you can set the initial value using _get_fmode() and\n// _set_fmode(). For more information take a look at the msdn pages here:\n// http://msdn.microsoft.com/en-us/library/ktss1a9b.aspx\n//\n// When the compile flag @c RF_NEWLINE_CRLF is defined (the default case at Windows) then this function\n// shall not be adding any CR character that is found in the file behind a newline character since this is\n// the Windows line ending scheme. Beware though that the returned read bytes value shall still count the CR character inside.\n//\n// @param[in] f The file descriptor to read\n// @param[out] utf8 Give here a refence to an unitialized char* that will be allocated inside the function\n// and contain the utf8 byte buffer. Needs to be freed by the caller explicitly later\n// @param[out] byteLength Give an @c uint32_t here to receive the length of the @c utf8 buffer in bytes\n// @param[out] eof Pass a pointer to a char to receive a true or false value in case the end of file\n// with reading this line\n// @return Returns either a positive number for success that represents the number of bytes read from @c f and and error in case something goes wrong.\n// + Any error that can be returned by @ref rfFgets_UTF32LE()\n// + @c RE_UTF8_ENCODING: Failed to encode the UTF-16 of the file descriptor into UTF-8\ni_DECLIMEX_ int32_t rfFReadLine_UTF32LE(FILE* f,char** utf8,uint32_t* byteLength,char* eof);\n\n// @brief Gets a number of bytes from a BIG endian UTF-32 file descriptor\n//\n// This is a function that's similar to c library fgets but it also returns the number of bytes read. Reads in from the file until @c num bytes\n// have been read or new line or EOF character has been encountered.\n//\n// The function will read until @c num characters are read and if @c num\n// would take us to the middle of a UTF32 character then the next character shall also be read\n// and the function will return the number of bytes read.\n// Since the function null terminates the buffer the given @c buff needs to be of at least\n// @c num+7 size to cater for the worst case.\n//\n// The final bytestream stored inside @c buff is in the endianess of the system.\n//\n// If right after the last character read comes the EOF, the function\n// shall detect so and assign @c true to @c eof.\n//\n// In Windows where file endings are in the form of 2 bytes CR-LF (Carriage return - NewLine) this function\n// shall just ignore the carriage returns and not return it inside the return buffer at @c buff.\n//\n// The file descriptor at @c f must have been opened in binary and not text mode. That means that if under\n// Windows make sure to call fopen with \"wb\", \"rb\" e.t.c. instead of the simple \"w\", \"r\" e.t.c. since the initial\n// default value under Windows is text mode. Alternatively you can set the initial value using _get_fmode() and\n// _set_fmode(). For more information take a look at the msdn pages here:\n// http://msdn.microsoft.com/en-us/library/ktss1a9b.aspx\n//\n// @param[in] buff A buffer to be filled with the contents of the file. Should be of size at least @c num+7\n// @param[in] num The maximum number of bytes to read from within the file NOT including the null terminating character(which in itelf is 4 bytes). Should be a multiple of 4\n// @param[in] f A valid FILE descriptor from which to read the bytes\n// @param[out] eof Pass a reference to a char to receive a true/false value for whether EOF has been reached.\n// @return Returns the actual number of bytes read or an error if there was a problem.\n// The possible errors are:\n// + @c RE_FILE_READ: If during reading the file there was an unknown read error\n// + @c RE_FILE_READ_BLOCK: If the read operation failed due to the file descriptor being occupied by another thread\n// + @c RE_FILE_MODE: If during reading the file the file descriptor's mode was not correctly set for reading\n// + @c RE_FILE_POS_OVERFLOW: If during reading, the current file position can't be represented by the system\n// + @c RE_INTERRUPT: If during reading, there was a system interrupt\n// + @c RE_FILE_IO: If there was a physical I/O error\n// + @c RE_FILE_NOSPACE: If reading failed due to insufficient storage space\ni_DECLIMEX_ int32_t rfFgets_UTF32BE(char* buff,uint32_t num,FILE* f,char* eof);\n// @brief Gets a number of bytes from a Little endian UTF-32 file descriptor\n//\n// This is a function that's similar to c library fgets but it also returns the number of bytes read. Reads in from the file until @c num bytes\n// have been read or new line or EOF character has been encountered.\n//\n// The function will read until @c num characters are read and if @c num\n// would take us to the middle of a UTF32 character then the next character shall also be read\n// and the function will return the number of bytes read.\n// Since the function null terminates the buffer the given @c buff needs to be of at least\n// @c num+7 size to cater for the worst case.\n//\n// The final bytestream stored inside @c buff is in the endianess of the system.\n//\n// If right after the last character read comes the EOF, the function\n// shall detect so and assign @c true to @c eof.\n//\n// In Windows where file endings are in the form of 2 bytes CR-LF (Carriage return - NewLine) this function\n// shall just ignore the carriage returns and not return it inside the return buffer at @c buff.\n//\n// The file descriptor at @c f must have been opened in binary and not text mode. That means that if under\n// Windows make sure to call fopen with \"wb\", \"rb\" e.t.c. instead of the simple \"w\", \"r\" e.t.c. since the initial\n// default value under Windows is text mode. Alternatively you can set the initial value using _get_fmode() and\n// _set_fmode(). For more information take a look at the msdn pages here:\n// http://msdn.microsoft.com/en-us/library/ktss1a9b.aspx\n//\n// @param[in] buff A buffer to be filled with the contents of the file. Should be of size at least @c num+7\n// @param[in] num The maximum number of bytes to read from within the file NOT including the null terminating character(which in itelf is 4 bytes). Should be a multiple of 4\n// @param[in] f A valid FILE descriptor from which to read the bytes\n// @param[out] eof Pass a reference to a char to receive a true/false value for whether EOF has been reached.\n// @return Returns the actual number of bytes read or an error if there was a problem.\n// The possible errors are:\n// + @c RE_FILE_READ: If during reading the file there was an unknown read error\n// + @c RE_FILE_READ_BLOCK: If the read operation failed due to the file descriptor being occupied by another thread\n// + @c RE_FILE_MODE: If during reading the file the file descriptor's mode was not correctly set for reading\n// + @c RE_FILE_POS_OVERFLOW: If during reading, the current file position can't be represented by the system\n// + @c RE_INTERRUPT: If during reading, there was a system interrupt\n// + @c RE_FILE_IO: If there was a physical I/O error\n// + @c RE_FILE_NOSPACE: If reading failed due to insufficient storage space\ni_DECLIMEX_ int32_t rfFgets_UTF32LE(char* buff,uint32_t num,FILE* f,char* eof);\n\n// @brief Gets a number of bytes from a BIG endian UTF-16 file descriptor\n//\n// This is a function that's similar to c library fgets but it also returns the number of bytes read. Reads in from the file until @c num bytes\n// have been read or new line or EOF character has been encountered.\n//\n// The function will read until @c num characters are read and if @c num\n// would take us to the middle of a UTF16 character then the next character shall also be read\n// and the function will return the number of bytes read.\n// Since the function null terminates the buffer the given @c buff needs to be of at least\n// @c num+5 size to cater for the worst case.\n//\n// The final bytestream stored inside @c buff is in the endianess of the system.\n//\n// If right after the last character read comes the EOF, the function\n// shall detect so and assign @c true to @c eof.\n//\n// In Windows where file endings are in the form of 2 bytes CR-LF (Carriage return - NewLine) this function\n// shall just ignore the carriage returns and not return it inside the return buffer at @c buff.\n//\n// The file descriptor at @c f must have been opened in binary and not text mode. That means that if under\n// Windows make sure to call fopen with \"wb\", \"rb\" e.t.c. instead of the simple \"w\", \"r\" e.t.c. since the initial\n// default value under Windows is text mode. Alternatively you can set the initial value using _get_fmode() and\n// _set_fmode(). For more information take a look at the msdn pages here:\n// http://msdn.microsoft.com/en-us/library/ktss1a9b.aspx\n//\n// @param[in] buff A buffer to be filled with the contents of the file. Should be of size at least @c num+5\n// @param[in] num The maximum number of bytes to read from within the file NOT including the null terminating character(which in itelf is 2 bytes). Should be a multiple of 2\n// @param[in] f A valid FILE descriptor from which to read the bytes\n// @param[out] eof Pass a reference to a char to receive a true/false value for whether EOF has been reached.\n// @return Returns the actual number of bytes read or an error if there was a problem.\n// The possible errors are:\n// + @c RE_FILE_READ: If during reading the file there was an unknown read error\n// + @c RE_FILE_READ_BLOCK: If the read operation failed due to the file descriptor being occupied by another thread\n// + @c RE_FILE_MODE: If during reading the file the file descriptor's mode was not correctly set for reading\n// + @c RE_FILE_POS_OVERFLOW: If during reading, the current file position can't be represented by the system\n// + @c RE_INTERRUPT: If during reading, there was a system interrupt\n// + @c RE_FILE_IO: If there was a physical I/O error\n// + @c RE_FILE_NOSPACE: If reading failed due to insufficient storage space\ni_DECLIMEX_ int32_t rfFgets_UTF16BE(char* buff,uint32_t num,FILE* f,char* eof);\n// @brief Gets a number of bytes from a Little endian UTF-16 file descriptor\n//\n// This is a function that's similar to c library fgets but it also returns the number of bytes read. Reads in from the file until @c num bytes\n// have been read or new line or EOF character has been encountered.\n//\n// The function will read until @c num characters are read and if @c num\n// would take us to the middle of a UTF16 character then the next character shall also be read\n// and the function will return the number of bytes read.\n// Since the function null terminates the buffer the given @c buff needs to be of at least\n// @c num+5 size to cater for the worst case.\n//\n// The final bytestream stored inside @c buff is in the endianess of the system.\n//\n// If right after the last character read comes the EOF, the function\n// shall detect so and assign @c true to @c eof.\n//\n// In Windows where file endings are in the form of 2 bytes CR-LF (Carriage return - NewLine) this function\n// shall just ignore the carriage returns and not return it inside the return buffer at @c buff.\n//\n// The file descriptor at @c f must have been opened in binary and not text mode. That means that if under\n// Windows make sure to call fopen with \"wb\", \"rb\" e.t.c. instead of the simple \"w\", \"r\" e.t.c. since the initial\n// default value under Windows is text mode. Alternatively you can set the initial value using _get_fmode() and\n// _set_fmode(). For more information take a look at the msdn pages here:\n// http://msdn.microsoft.com/en-us/library/ktss1a9b.aspx\n//\n// @param[in] buff A buffer to be filled with the contents of the file. Should be of size at least @c num+2\n// @param[in] num The maximum number of bytes to read from within the file NOT including the null terminating character(which in itelf is 2 bytes). Should be a multiple of 2\n// @param[in] f A valid FILE descriptor from which to read the bytes\n// @param[out] eof Pass a reference to a char to receive a true/false value for whether EOF has been reached.\n// @return Returns the actual number of bytes read or an error if there was a problem.\n// The possible errors are:\n// + @c RE_FILE_READ: If during reading the file there was an unknown read error\n// + @c RE_FILE_READ_BLOCK: If the read operation failed due to the file descriptor being occupied by another thread\n// + @c RE_FILE_MODE: If during reading the file the file descriptor's mode was not correctly set for reading\n// + @c RE_FILE_POS_OVERFLOW: If during reading, the current file position can't be represented by the system\n// + @c RE_INTERRUPT: If during reading, there was a system interrupt\n// + @c RE_FILE_IO: If there was a physical I/O error\n// + @c RE_FILE_NOSPACE: If reading failed due to insufficient storage space\ni_DECLIMEX_ int32_t rfFgets_UTF16LE(char* buff,uint32_t num,FILE* f,char* eof);\n// @brief Gets a number of bytes from a UTF-8 file descriptor\n//\n// This is a function that's similar to c library fgets but it also returns the number of bytes read. Reads in from the file until @c num characters\n// have been read or new line or EOF character has been encountered.\n//\n// The function automatically adds a null termination character at the end of\n// @c buff but this character is not included in the returned actual number of bytes.\n//\n// The function will read until @c num characters are read and if @c num\n// would take us to the middle of a UTF8 character then the next character shall also be read\n// and the function will return the number of bytes read.\n// Since the function null terminates the buffer the given @c buff needs to be of at least\n// @c num+4 size to cater for the worst case.\n//\n// If right after the last character read comes the EOF, the function\n// shall detect so and assign @c true to @c eof.\n//\n// In Windows where file endings are in the form of 2 bytes CR-LF (Carriage return - NewLine) this function\n// shall just ignore the carriage returns and not return it inside the return buffer at @c buff.\n//\n// The file descriptor at @c f must have been opened in binary and not text mode. That means that if under\n// Windows make sure to call fopen with \"wb\", \"rb\" e.t.c. instead of the simple \"w\", \"r\" e.t.c. since the initial\n// default value under Windows is text mode. Alternatively you can set the initial value using _get_fmode() and\n// _set_fmode(). For more information take a look at the msdn pages here:\n// http://msdn.microsoft.com/en-us/library/ktss1a9b.aspx\n//\n// @param[in] buff A buffer to be filled with the contents of the file. Should of size at least @c num+4\n// @param[in] num The maximum number of bytes to read from within the file NOT including the null terminating character(which in itelf is 1 byte)\n// @param[in] f A valid FILE descriptor from which to read the bytes\n// @param[out] eof Pass a reference to a char to receive a true/false value for whether EOF has been reached.\n// @return Returns the actual number of bytes read or an error if there was a problem.\n// The possible errors are:\n// + @c RE_UTF8_INVALID_SEQUENCE_INVALID_BYTE: If an invalid UTF-8 byte has been found\n// + @c RE_UTF8_INVALID_SEQUENCE_CONBYTE: If during parsing the file we were expecting a continuation\n// byte and did not find it\n// + @c RE_UTF8_INVALID_SEQUENCE_END: If the null character is encountered in between bytes that should\n// have been continuation bytes\n// + @c RE_FILE_READ: If during reading the file there was an unknown read error\n// + @c RE_FILE_READ_BLOCK: If the read operation failed due to the file descriptor being occupied by another thread\n// + @c RE_FILE_MODE: If during reading the file the file descriptor's mode was not correctly set for reading\n// + @c RE_FILE_POS_OVERFLOW: If during reading, the current file position can't be represented by the system\n// + @c RE_INTERRUPT: If during reading, there was a system interrupt\n// + @c RE_FILE_IO: If there was a physical I/O error\n// + @c RE_FILE_NOSPACE: If reading failed due to insufficient storage space\ni_DECLIMEX_ int32_t rfFgets_UTF8(char* buff,uint32_t num,FILE* f,char* eof);\n\n// @brief Gets a unicode character from a UTF-8 file descriptor\n//\n// This function attempts to assume a more modern fgetc() role for UTF-8 encoded files.\n// Reads bytes from the File descriptor @c f until a full UTF-8 unicode character has been read\n//\n// After this function the file pointer will have moved either by @c 1, @c 2, @c 3 or @c 4\n// bytes if the return value is positive. You can see how much by checking the return value.\n//\n// You shall need to provide an integer at @c c to contain either the decoded Unicode\n// codepoint or the UTF-8 endoced byte depending on the value of the @c cp argument.\n//\n// @param f A valid FILE descriptor from which to read the bytes\n// @param c Pass an int that will receive either the unicode code point value or\n// the UTF8 bytes depending on the value of the @c cp flag\n// @param cp A boolean flag. If @c true then the int passed at @c c will contain the unicode code point\n// of the read character, so the UTF-8 will be decoded.\n// If @c false the int passed at @c c will contain the value of the read bytes in UTF-8 without any decoding\n// @return Returns the number of bytes read (either @c 1, @c 2, @c 3 or @c 4) or an error if the function\n// fails for some reason. Possible error values are:\n// + @c RE_FILE_EOF: The end of file has been found while reading. If the end of file is encountered\n// in the middle of a UTF-8 encoded character where we would be expecting something different\n// and @c RE_UTF8_INVALID_SEQUENCE_END error is also logged\n// + @c RE_UTF8_INVALID_SEQUENCE_INVALID_BYTE: If an invalid UTF-8 byte has been found\n// + @c RE_UTF8_INVALID_SEQUENCE_CONBYTE: If during parsing the file we were expecting a continuation\n// byte and did not find it\n// + @c RE_UTF8_INVALID_SEQUENCE_END: If the null character is encountered in between bytes that should\n// have been continuation bytes\n// + @c RE_FILE_READ: If during reading the file there was an unknown read error\n// + @c RE_FILE_READ_BLOCK: If the read operation failed due to the file descriptor being occupied by another thread\n// + @c RE_FILE_MODE: If during reading the file the file descriptor's mode was not correctly set for reading\n// + @c RE_FILE_POS_OVERFLOW: If during reading, the current file position can't be represented by the system\n// + @c RE_INTERRUPT: If during reading, there was a system interrupt\n// + @c RE_FILE_IO: If there was a physical I/O error\n// + @c RE_FILE_NOSPACE: If reading failed due to insufficient storage space\ni_DECLIMEX_ int32_t rfFgetc_UTF8(FILE* f,uint32_t *c,char cp);\n// @brief Gets a unicode character from a UTF-16 Big Endian file descriptor\n//\n// This function attempts to assume a more modern fgetc() role for UTF-16 encoded files.\n// Reads bytes from the File descriptor @c f until a full UTF-16 unicode character has been read\n//\n// After this function the file pointer will have moved either by @c 2 or @c 4\n// bytes if the return value is positive. You can see how much by checking the return value.\n//\n// You shall need to provide an integer at @c c to contain either the decoded Unicode\n// codepoint or the Bigendian encoded UTF-16 bytes depending on the value of @c the cp argument.\n//\n// @param f A valid FILE descriptor from which to read the bytes\n// @param c Pass an int that will receive either the unicode code point value or\n// the UTF16 bytes depending on the value of the @c cp flag\n// @param cp A boolean flag. If @c true then the int passed at @c c will contain the unicode code point\n// of the read character, so the UTF-16 will be decoded.\n// If @c false the int passed at @c c will contain the value of the read bytes in UTF-16 without any decoding\n// @return Returns the number of bytes read (either @c 2 or @c 4) or an error if the function\n// fails for some reason. Possible error values are:\n// + @c RE_UTF16_INVALID_SEQUENCE: Either the read word or its surrogate pair if 4 bytes were read held illegal values\n// + @c RE_UTF16_NO_SURRPAIR: According to the first read word a surrogate pair was expected but none was found\n// + @c RE_FILE_EOF: The end of file has been found while reading. If the end of file is encountered\n// while we expect a UTF-16 surrogate pair an appropriate error is logged\n// + @c RE_FILE_READ: If during reading the file there was an unknown read error\n// + @c RE_FILE_READ_BLOCK: If the read operation failed due to the file descriptor being occupied by another thread\n// + @c RE_FILE_MODE: If during reading the file the file descriptor's mode was not correctly set for reading\n// + @c RE_FILE_POS_OVERFLOW: If during reading, the current file position can't be represented by the system\n// + @c RE_INTERRUPT: If during reading, there was a system interrupt\n// + @c RE_FILE_IO: If there was a physical I/O error\n// + @c RE_FILE_NOSPACE: If reading failed due to insufficient storage space\ni_DECLIMEX_ int32_t rfFgetc_UTF16BE(FILE* f,uint32_t *c,char cp);\n// @brief Gets a unicode character from a UTF-16 Little Endian file descriptor\n//\n// This function attempts to assume a more modern fgetc() role for UTF-16 encoded files.\n// Reads bytes from the File descriptor @c f until a full UTF-16 unicode character has been read\n//\n// After this function the file pointer will have moved either by @c 2 or @c 4\n// bytes if the return value is positive. You can see how much by checking the return value.\n//\n// You shall need to provide an integer at @c c to contain either the decoded Unicode\n// codepoint or the Bigendian encoded UTF-16 bytes depending on the value of @c the cp argument.\n//\n// @param f A valid FILE descriptor from which to read the bytes\n// @param c Pass an int that will receive either the unicode code point value or\n// the UTF16 bytes depending on the value of the @c cp flag\n// @param cp A boolean flag. If @c true then the int passed at @c c will contain the unicode code point\n// of the read character, so the UTF-16 will be decoded.\n// If @c false the int passed at @c c will contain the value of the read bytes in UTF-16 without any decoding\n// @return Returns the number of bytes read (either @c 2 or @c 4) or an error if the function\n// fails for some reason. Possible error values are:\n// + @c RE_UTF16_INVALID_SEQUENCE: Either the read word or its surrogate pair if 4 bytes were read held illegal values\n// + @c RE_UTF16_NO_SURRPAIR: According to the first read word a surrogate pair was expected but none was found\n// + @c RE_FILE_EOF: The end of file has been found while reading. If the end of file is encountered\n// while we expect a UTF-16 surrogate pair an appropriate error is logged\n// + @c RE_FILE_READ: If during reading the file there was an unknown read error\n// + @c RE_FILE_READ_BLOCK: If the read operation failed due to the file descriptor being occupied by another thread\n// + @c RE_FILE_MODE: If during reading the file the file descriptor's mode was not correctly set for reading\n// + @c RE_FILE_POS_OVERFLOW: If during reading, the current file position can't be represented by the system\n// + @c RE_INTERRUPT: If during reading, there was a system interrupt\n// + @c RE_FILE_IO: If there was a physical I/O error\n// + @c RE_FILE_NOSPACE: If reading failed due to insufficient storage space\ni_DECLIMEX_ int32_t rfFgetc_UTF16LE(FILE* f,uint32_t *c,char cp);\n// @brief Gets a unicode character from a UTF-32 Little Endian file descriptor\n//\n// This function attempts to assume a more modern fgetc() role for UTF-32 encoded files.\n// Reads bytes from the File descriptor @c f until a full UTF-32 unicode character has been read\n//\n// After this function the file pointer will have moved by @c 4\n// bytes if the return value is positive.\n//\n// You shall need to provide an integer at @c to contain the UTF-32 codepoint.\n//\n// @param f A valid FILE descriptor from which to read the bytes\n// @param c Pass an int that will receive either the unicode code point value or\n// the UTF16 bytes depending on the value of the @c cp flag\n// If @c false the int passed at @c c will contain the value of the read bytes in UTF-16 without any decoding\n// @return Returns either @c RF_SUCCESS for succesfull readin or one of the following errors:\n// + @c RE_FILE_EOF: The end of file has been found while reading.\n// + @c RE_FILE_READ: If during reading the file there was an unknown read error\n// + @c RE_FILE_READ_BLOCK: If the read operation failed due to the file descriptor being occupied by another thread\n// + @c RE_FILE_MODE: If during reading the file the file descriptor's mode was not correctly set for reading\n// + @c RE_FILE_POS_OVERFLOW: If during reading, the current file position can't be represented by the system\n// + @c RE_INTERRUPT: If during reading, there was a system interrupt\n// + @c RE_FILE_IO: If there was a physical I/O error\n// + @c RE_FILE_NOSPACE: If reading failed due to insufficient storage space\ni_DECLIMEX_ int32_t rfFgetc_UTF32LE(FILE* f,uint32_t *c);\n// @brief Gets a unicode character from a UTF-32 Big Endian file descriptor\n//\n// This function attempts to assume a more modern fgetc() role for UTF-32 encoded files.\n// Reads bytes from the File descriptor @c f until a full UTF-32 unicode character has been read\n//\n// After this function the file pointer will have moved by @c 4\n// bytes if the return value is positive.\n//\n// You shall need to provide an integer at @c to contain the UTF-32 codepoint.\n//\n// @param f A valid FILE descriptor from which to read the bytes\n// @param c Pass an int that will receive either the unicode code point value or\n// the UTF16 bytes depending on the value of the @c cp flag\n// If @c false the int passed at @c c will contain the value of the read bytes in UTF-16 without any decoding\n// @return Returns either @c RF_SUCCESS for succesfull readin or one of the following errors:\n// + @c RE_FILE_EOF: The end of file has been found while reading.\n// + @c RE_FILE_READ: If during reading the file there was an unknown read error\n// + @c RE_FILE_READ_BLOCK: If the read operation failed due to the file descriptor being occupied by another thread\n// + @c RE_FILE_MODE: If during reading the file the file descriptor's mode was not correctly set for reading\n// + @c RE_FILE_POS_OVERFLOW: If during reading, the current file position can't be represented by the system\n// + @c RE_INTERRUPT: If during reading, there was a system interrupt\n// + @c RE_FILE_IO: If there was a physical I/O error\n// + @c RE_FILE_NOSPACE: If reading failed due to insufficient storage space\ni_DECLIMEX_ int32_t rfFgetc_UTF32BE(FILE* f,uint32_t *c);\n\n// @brief Moves a unicode character backwards in a big endian UTF-32 file stream\n//\n// @param f The file stream\n// @param c Returns the character we moved back to as a unicode codepoint\n// @return Returns either @c RF_SUCCESS for success or one of the following errors:\n// + @c RE_FILE_POS_OVERFLOW: If during trying to read the current file's position it can't be represented by the system\n// + @c RE_FILE_BAD: If The file descriptor is corrupt/illegal\n// + @c RE_FILE_NOTFILE: If the file descriptor is not a file but something else. e.g. socket.\n// + @c RE_FILE_GETFILEPOS: If the file's position could not be retrieved for some unknown reason\n// + @c RE_FILE_WRITE_BLOCK: While attempting to move the file pointer, it was occupied by another thread, and the no block flag was set\n// + @c RE_INTERRUPT: Operating on the file failed due to a system interrupt\n// + @c RE_FILE_IO: There was a physical I/O error\n// + @c RE_FILE_NOSPACE: There was no space on the device holding the file\n// + @c RE_FILE_NOTFILE: The device we attempted to manipulate is non-existent\n// + @c RE_FILE_READ: If during reading the file there was an error\n// + @c RE_FILE_READ_BLOCK: If during reading the file the read operation failed due to the file being occupied by another thread\n// + @c RE_FILE_MODE: If during reading the file the underlying file descriptor's mode was not correctly set for reading\ni_DECLIMEX_ int32_t rfFback_UTF32BE(FILE* f,uint32_t *c);\n// @brief Moves a unicode character backwards in a little endian UTF-32 file stream\n//\n// The file descriptor at @c f must have been opened in binary and not text mode. That means that if under\n// Windows make sure to call fopen with \"wb\", \"rb\" e.t.c. instead of the simple \"w\", \"r\" e.t.c. since the initial\n// default value under Windows is text mode. Alternatively you can set the initial value using _get_fmode() and\n// _set_fmode(). For more information take a look at the msdn pages here:\n// http://msdn.microsoft.com/en-us/library/ktss1a9b.aspx\n//\n// @param f The file stream\n// @param c Returns the character we moved back to as a unicode codepoint\n// @return Returns either @c RF_SUCCESS for success or one of the following errors:\n// + @c RE_FILE_POS_OVERFLOW: If during trying to read the current file's position it can't be represented by the system\n// + @c RE_FILE_BAD: If The file descriptor is corrupt/illegal\n// + @c RE_FILE_NOTFILE: If the file descriptor is not a file but something else. e.g. socket.\n// + @c RE_FILE_GETFILEPOS: If the file's position could not be retrieved for some unknown reason\n// + @c RE_FILE_WRITE_BLOCK: While attempting to move the file pointer, it was occupied by another thread, and the no block flag was set\n// + @c RE_INTERRUPT: Operating on the file failed due to a system interrupt\n// + @c RE_FILE_IO: There was a physical I/O error\n// + @c RE_FILE_NOSPACE: There was no space on the device holding the file\n// + @c RE_FILE_NOTFILE: The device we attempted to manipulate is non-existent\n// + @c RE_FILE_READ: If during reading the file there was an error\n// + @c RE_FILE_READ_BLOCK: If during reading the file the read operation failed due to the file being occupied by another thread\n// + @c RE_FILE_MODE: If during reading the file the underlying file descriptor's mode was not correctly set for reading\ni_DECLIMEX_ int32_t rfFback_UTF32LE(FILE* f,uint32_t *c);\n// @brief Moves a unicode character backwards in a big endian UTF-16 file stream\n//\n// The file descriptor at @c f must have been opened in binary and not text mode. That means that if under\n// Windows make sure to call fopen with \"wb\", \"rb\" e.t.c. instead of the simple \"w\", \"r\" e.t.c. since the initial\n// default value under Windows is text mode. Alternatively you can set the initial value using _get_fmode() and\n// _set_fmode(). For more information take a look at the msdn pages here:\n// http://msdn.microsoft.com/en-us/library/ktss1a9b.aspx\n//\n// @param f The file stream\n// @param c Returns the character we moved back to as a unicode codepoint\n// @return Returns either the number of bytes moved backwards (either @c 4 or @c 2) for success or one of the following errors:\n// + @c RE_UTF16_INVALID_SEQUENCE: Either the read word or its surrogate pair if 4 bytes were read held illegal values\n// + @c RE_FILE_POS_OVERFLOW: If during trying to read the current file's position it can't be represented by the system\n// + @c RE_FILE_BAD: If The file descriptor is corrupt/illegal\n// + @c RE_FILE_NOTFILE: If the file descriptor is not a file but something else. e.g. socket.\n// + @c RE_FILE_GETFILEPOS: If the file's position could not be retrieved for some unknown reason\n// + @c RE_FILE_WRITE_BLOCK: While attempting to move the file pointer, it was occupied by another thread, and the no block flag was set\n// + @c RE_INTERRUPT: Operating on the file failed due to a system interrupt\n// + @c RE_FILE_IO: There was a physical I/O error\n// + @c RE_FILE_NOSPACE: There was no space on the device holding the file\n// + @c RE_FILE_NOTFILE: The device we attempted to manipulate is non-existent\n// + @c RE_FILE_READ: If during reading the file there was an error\n// + @c RE_FILE_READ_BLOCK: If during reading the file the read operation failed due to the file being occupied by another thread\n// + @c RE_FILE_MODE: If during reading the file the underlying file descriptor's mode was not correctly set for reading\ni_DECLIMEX_ int32_t rfFback_UTF16BE(FILE* f,uint32_t *c);\n// @brief Moves a unicode character backwards in a little endian UTF-16 file stream\n//\n// The file descriptor at @c f must have been opened in binary and not text mode. That means that if under\n// Windows make sure to call fopen with \"wb\", \"rb\" e.t.c. instead of the simple \"w\", \"r\" e.t.c. since the initial\n// default value under Windows is text mode. Alternatively you can set the initial value using _get_fmode() and\n// _set_fmode(). For more information take a look at the msdn pages here:\n// http://msdn.microsoft.com/en-us/library/ktss1a9b.aspx\n//\n// @param f The file stream\n// @param c Returns the character we moved back to as a unicode codepoint\n// @return Returns either the number of bytes moved backwards (either @c 4 or @c 2) for success or one of the following errors:\n// + @c RE_UTF16_INVALID_SEQUENCE: Either the read word or its surrogate pair if 4 bytes were read held illegal values\n// + @c RE_FILE_POS_OVERFLOW: If during trying to read the current file's position it can't be represented by the system\n// + @c RE_FILE_BAD: If The file descriptor is corrupt/illegal\n// + @c RE_FILE_NOTFILE: If the file descriptor is not a file but something else. e.g. socket.\n// + @c RE_FILE_GETFILEPOS: If the file's position could not be retrieved for some unknown reason\n// + @c RE_FILE_WRITE_BLOCK: While attempting to move the file pointer, it was occupied by another thread, and the no block flag was set\n// + @c RE_INTERRUPT: Operating on the file failed due to a system interrupt\n// + @c RE_FILE_IO: There was a physical I/O error\n// + @c RE_FILE_NOSPACE: There was no space on the device holding the file\n// + @c RE_FILE_NOTFILE: The device we attempted to manipulate is non-existent\n// + @c RE_FILE_READ: If during reading the file there was an error\n// + @c RE_FILE_READ_BLOCK: If during reading the file the read operation failed due to the file being occupied by another thread\n// + @c RE_FILE_MODE: If during reading the file the underlying file descriptor's mode was not correctly set for reading\ni_DECLIMEX_ int32_t rfFback_UTF16LE(FILE* f,uint32_t *c);\n// @brief Moves a unicode character backwards in a UTF-8 file stream\n//\n// The file descriptor at @c f must have been opened in binary and not text mode. That means that if under\n// Windows make sure to call fopen with \"wb\", \"rb\" e.t.c. instead of the simple \"w\", \"r\" e.t.c. since the initial\n// default value under Windows is text mode. Alternatively you can set the initial value using _get_fmode() and\n// _set_fmode(). For more information take a look at the msdn pages here:\n// http://msdn.microsoft.com/en-us/library/ktss1a9b.aspx\n//\n// @param f The file stream\n// @param c Returns the character we moved back to as a unicode codepoint\n// @return Returns either the number of bytes moved backwards for success (either @c 4, @c 3, @c 2 or @c 1) or one of the following errors:\n// + @c RE_UTF8_INVALID_SEQUENCE: If during moving bacwards in the file unexpected UTF-8 bytes were found\n// + @c RE_FILE_POS_OVERFLOW: If during trying to read the current file's position it can't be represented by the system\n// + @c RE_FILE_BAD: If The file descriptor is corrupt/illegal\n// + @c RE_FILE_NOTFILE: If the file descriptor is not a file but something else. e.g. socket.\n// + @c RE_FILE_GETFILEPOS: If the file's position could not be retrieved for some unknown reason\n// + @c RE_FILE_WRITE_BLOCK: While attempting to move the file pointer, it was occupied by another thread, and the no block flag was set\n// + @c RE_INTERRUPT: Operating on the file failed due to a system interrupt\n// + @c RE_FILE_IO: There was a physical I/O error\n// + @c RE_FILE_NOSPACE: There was no space on the device holding the file\n// + @c RE_FILE_NOTFILE: The device we attempted to manipulate is non-existent\n// + @c RE_FILE_READ: If during reading the file there was an error\n// + @c RE_FILE_READ_BLOCK: If during reading the file the read operation failed due to the file being occupied by another thread\n// + @c RE_FILE_MODE: If during reading the file the underlying file descriptor's mode was not correctly set for reading\ni_DECLIMEX_ int32_t rfFback_UTF8(FILE* f,uint32_t *c);\n\n// @brief Opens another process as a pipe\n//\n// This function is a cross-platform popen wrapper. In linux it uses popen and in Windows it uses\n// _popen.\n// @lmsFunction\n// @param command The string with the command to execute. Is basically the name of the program/process you want to spawn\n// with its full path and its parameters. @inhtype{String,StringX} @tmpSTR\n// @param mode The mode you want the pipe to work in. There are two possible values:\n// + @c \"r\" The calling process can read the spawned command's standard output via the returned stream.\n// + @c \"w\" The calling process can write to the spawned command's standard input via the returned stream.\n//\n// Anything else will result in an error\n// @return For success popen will return a FILE descriptor that can be used to either read or write from the pipe.\n// If there was an error @c 0 is returned and an error is logged.\n#ifdef RF_IAMHERE_FOR_DOXYGEN\ni_DECLIMEX_ FILE* rfPopen(void* command,const char* mode);\n#else\ni_DECLIMEX_ FILE* i_rfPopen(void* command,const char* mode);\n#define rfPopen(i_CMD_,i_MODE_) i_rfLMS_WRAP2(FILE*,i_rfPopen,i_CMD_,i_MODE_)\n#endif\n\n// @brief Closes a pipe\n//\n// This function is a cross-platform wrapper for pclose. It closes a file descriptor opened with @ref rfPopen() and\n// returns the exit code of the process that was running\n// @param stream The file descriptor of the pipe returned by @ref rfPopen() that we want to close\n// @return Returns the exit code of the process or -1 if there was an error\ni_DECLIMEX_ int rfPclose(FILE* stream);\n\n// @} End of I/O group\n\n#ifdef __cplusplus\n}///closing bracket for calling from C++\n#endif\n\n\n#endif//include guards end\n" }, { "path": "src/test/resources/samples/langs/C/rfc_string.c", "content": "/**\n** Copyright (c) 2011-2012, Karapetsas Eleftherios\n** All rights reserved.\n**\n** Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:\n** 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n** 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in\n** the documentation and/or other materials provided with the distribution.\n** 3. Neither the name of the Original Author of Refu nor the names of its contributors may be used to endorse or promote products derived from\n**\n** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES,\n** INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n** DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n** SERVICES;LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n** WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (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#include \n\n#include \n// include bitwise operations\n#include \n// include the private functions and macros\n#include \"string_private.h\"\n// include io_private only for the write check\n#include \"../IO/io_private.h\"\n// include the extended strin\n#include \n// for HUGE_VAL definition\n#include \n\n#include // for the local stack memory\n\n/*********************************************************************** Start of the RF_String functions *****************************************************************************************/\n\n/*-------------------------------------------------------------------------Methods to create an RF_String-------------------------------------------------------------------------------*/\n\n// Allocates and returns a string with the given characters a refu string with the given characters. Given characters have to be in UTF-8. A check for valide sequence of bytes is performed.\n#ifndef RF_OPTION_DEFAULT_ARGUMENTS\nRF_String* rfString_Create(const char* s,...)\n#else\nRF_String* i_rfString_Create(const char* s,...)\n#endif\n{\n READ_VSNPRINTF_ARGS(s,s,0)\n\n // check for validity of the given sequence and get the character length\n uint32_t byteLength;\n if( rfUTF8_VerifySequence(buff,&byteLength) == RF_FAILURE)\n {\n LOG_ERROR(\"Error at String Allocation due to invalid UTF-8 byte sequence\",RE_STRING_INIT_FAILURE);\n if(buffAllocated == true)\n free(buff);\n return 0;\n }\n\n RF_String* ret;\n RF_MALLOC(ret,sizeof(RF_String));\n // get length\n ret->byteLength = byteLength;\n\n // now that we know the length we can allocate the buffer and copy the bytes\n RF_MALLOC(ret->bytes,ret->byteLength+1);\n memcpy(ret->bytes,buff,ret->byteLength+1);\n if(buffAllocated==true)\n free(buff);\n return ret;\n}\n#ifdef RF_OPTION_DEFAULT_ARGUMENTS\nRF_String* i_NVrfString_Create(const char* s)\n{\n // check for validity of the given sequence and get the character length\n uint32_t byteLength;\n if( rfUTF8_VerifySequence(s,&byteLength) == RF_FAILURE)\n {\n LOG_ERROR(\"Error at String Allocation due to invalid UTF-8 byte sequence\",RE_STRING_INIT_FAILURE);\n return 0;\n }\n\n RF_String* ret;\n RF_MALLOC(ret,sizeof(RF_String));\n // get length\n ret->byteLength = byteLength;\n\n // now that we know the length we can allocate the buffer and copy the bytes\n RF_MALLOC(ret->bytes,ret->byteLength+1);\n memcpy(ret->bytes,s,ret->byteLength+1);\n\n return ret;\n}\n#endif\n\n\n// Allocates and returns a string with the given characters a refu string with the given characters. Given characters have to be in UTF-8. A check for valid sequence of bytes is performed.\nRF_String* i_rfString_CreateLocal1(const char* s,...)\n{\n#if RF_OPTION_SOURCE_ENCODING != RF_UTF8\n uint32_t characterLength,*codepoints,i=0,j;\n#endif\n // remember the stack pointer before this macro evaluation\n rfLMS_MacroEvalPtr(RF_LMS);\n // read the var args\n READ_VSNPRINTF_ARGS(s,s,0)\n// /===Start of Non-UTF-8 code===// /\n#if (RF_OPTION_SOURCE_ENCODING == RF_UTF16_LE) || (RF_OPTION_SOURCE_ENCODING == RF_UTF16_BE)\n // find the bytelength of the UTF-16 buffer\n while(buff[i] != '\\0' && buff[i+1]!= '\\0')\n i++;\n i+=2;\n // allocate the codepoint buffer\n RF_MALLOC(codepoints,i/2)\n#elif (RF_OPTION_SOURCE_ENCODING == RF_UTF32_LE) || (RF_OPTION_SOURCE_ENCODING == RF_UTF32_BE)\n // find the bytelength of the UTF-32 buffer\n while(buff[i] != '\\0' && buff[i+1]!= '\\0' && buff[i+2]!= '\\0' && buff[i+3]!= '\\0')\n i++;\n i+=4;\n // allocate the codepoint buffer\n RF_MALLOC(codepoints,i)\n#endif\n#if (RF_OPTION_SOURCE_ENCODING == RF_UTF16_LE)// decode the UTF16\n if(rfUTILS_Endianess() == RF_LITTLE_ENDIAN)\n if(rfUTF16_Decode(buff,&characterLength,codepoints) == false)\n goto cleanup;\n else\n if(rfUTF16_Decode_swap(buff,&characterLength,codepoints)==false)\n goto cleanup;\n\n#elif RF_OPTION_SOURCE_ENCODING == RF_UTF16_BE// decode the UTF16\n if(rfUTILS_Endianess() == RF_LITTLE_ENDIAN)\n if(rfUTF16_Decode_swap(buff,&characterLength,codepoints) == false)\n goto cleanup;\n else\n if(rfUTF16_Decode(buff,&characterLength,codepoints)==false)\n goto cleanup;\n#elif RF_OPTION_SOURCE_ENCODING == RF_UTF32_LE// copy the UTF32 into the codepoint\n memcpy(codepoints,buff,i);\n if(rfUTILS_Endianess != RF_LITTLE_ENDIAN)\n {\n for(j=0;jbyteLength = byteLength;\n\n // now that we know the length we can allocate the buffer and copy the bytes\n ret->bytes = rfLMS_Push(RF_LMS,ret->byteLength+1);\n if(ret->bytes == 0)\n {\n LOG_ERROR(\"Memory allocation from the Local Memory Stack failed. Insufficient local memory stack space. Consider compiling the library with bigger stack space. Quitting proccess...\",\n RE_LOCALMEMSTACK_INSUFFICIENT);\n exit(RE_LOCALMEMSTACK_INSUFFICIENT);\n }\n memcpy(ret->bytes,buff,ret->byteLength+1);\n // finally free stuff if needed\n if(buffAllocated == true)\n free(buff);\n return ret;\n\n// /cleanup code for non-UTF-8 cases\n#if (RF_OPTION_SOURCE_ENCODING == RF_UTF16_LE) || (RF_OPTION_SOURCE_ENCODING == RF_UTF16_BE)\ncleanup:\n#if RF_OPTION_SOURCE_ENCODING == RF_UTF16_LE\n LOG_ERROR(\"Temporary RF_String creation from a UTF-16 Little Endian buffer failed due to UTF-16 decoding failure\",RE_UTF16_INVALID_SEQUENCE);\n#elif RF_OPTION_SOURCE_ENCODING == RF_UTF16_BE\n LOG_ERROR(\"Temporary RF_String creation from a UTF-16 Big Endian buffer failed due to UTF-16 decoding failure\",RE_UTF16_INVALID_SEQUENCE);\n#endif\n free(codepoints);\n if(buffAllocated == true)\n free(buff);\n return 0;\n#endif\n}\nRF_String* i_NVrfString_CreateLocal(const char* s)\n{\n#if RF_OPTION_SOURCE_ENCODING != RF_UTF8\n uint32_t characterLength,*codepoints,i=0,j;\n char* buff;\n#endif\n // remember the stack pointer before this macro evaluation\n rfLMS_MacroEvalPtr(RF_LMS);\n// /===Start of Non-UTF-8 code===// /\n#if (RF_OPTION_SOURCE_ENCODING == RF_UTF16_LE) || (RF_OPTION_SOURCE_ENCODING == RF_UTF16_BE)\n // find the bytelength of the UTF-16 buffer\n while(s[i] != '\\0' &&s[i+1]!= '\\0')\n i++;\n i+=2;\n // allocate the codepoint buffer\n RF_MALLOC(codepoints,i/2)\n#elif (RF_OPTION_SOURCE_ENCODING == RF_UTF32_LE) || (RF_OPTION_SOURCE_ENCODING == RF_UTF32_BE)\n // find the bytelength of the UTF-32 buffer\n while(s[i] != '\\0' && s[i+1]!= '\\0' && s[i+2]!= '\\0' && s[i+3]!= '\\0')\n i++;\n i+=4;\n // allocate the codepoint buffer\n RF_MALLOC(codepoints,i)\n#endif\n#if (RF_OPTION_SOURCE_ENCODING == RF_UTF16_LE)// decode the UTF16\n if(rfUTILS_Endianess() == RF_LITTLE_ENDIAN)\n if(rfUTF16_Decode(s,&characterLength,codepoints) == false)\n goto cleanup;\n else\n if(rfUTF16_Decode_swap(s,&characterLength,codepoints)==false)\n goto cleanup;\n\n#elif RF_OPTION_SOURCE_ENCODING == RF_UTF16_BE// decode the UTF16\n if(rfUTILS_Endianess() == RF_LITTLE_ENDIAN)\n if(rfUTF16_Decode_swap(s,&characterLength,codepoints) == false)\n goto cleanup;\n else\n if(rfUTF16_Decode(s,&characterLength,codepoints)==false)\n goto cleanup;\n#elif RF_OPTION_SOURCE_ENCODING == RF_UTF32_LE// copy the UTF32 into the codepoint\n memcpy(codepoints,s,i);\n if(rfUTILS_Endianess != RF_LITTLE_ENDIAN)\n {\n for(j=0;jbyteLength = byteLength;\n\n ret->bytes = rfLMS_Push(RF_LMS,ret->byteLength+1);\n if(ret->bytes == 0)\n {\n LOG_ERROR(\"Memory allocation from the Local Memory Stack failed during string allocation. Insufficient local memory stack space. Consider compiling the library with bigger stack space. Quitting proccess...\",\n RE_LOCALMEMSTACK_INSUFFICIENT);\n exit(RE_LOCALMEMSTACK_INSUFFICIENT);\n }\n#if RF_OPTION_SOURCE_ENCODING == RF_UTF8\n memcpy(ret->bytes,s,ret->byteLength+1);\n#else\n memcpy(ret->bytes,buff,ret->byteLength+1);\n#endif\n return ret;\n\n// /cleanup code for non-UTF-8 cases\n#if (RF_OPTION_SOURCE_ENCODING == RF_UTF16_LE) || (RF_OPTION_SOURCE_ENCODING == RF_UTF16_BE)\ncleanup:\n#if RF_OPTION_SOURCE_ENCODING == RF_UTF16_LE\n LOG_ERROR(\"Temporary RF_String creation from a UTF-16 Little Endian buffer failed due to UTF-16 decoding failure\",RE_UTF16_INVALID_SEQUENCE);\n#elif RF_OPTION_SOURCE_ENCODING == RF_UTF16_BE\n LOG_ERROR(\"Temporary RF_String creation from a UTF-16 Big Endian buffer failed due to UTF-16 decoding failure\",RE_UTF16_INVALID_SEQUENCE);\n#endif\n free(codepoints);\n return 0;\n#endif\n}\n\n\n\n// Initializes a string with the given characters. Given characters have to be in UTF-8. A check for valide sequence of bytes is performed.Can't be used with RF_StringX\n#ifndef RF_OPTION_DEFAULT_ARGUMENTS\nchar rfString_Init(RF_String* str,const char* s,...)\n#else\nchar i_rfString_Init(RF_String* str,const char* s,...)\n#endif\n{\n READ_VSNPRINTF_ARGS(s,s,false)\n // check for validity of the given sequence and get the character length\n uint32_t byteLength;\n if( rfUTF8_VerifySequence(buff,&byteLength) == RF_FAILURE)\n {\n LOG_ERROR(\"Error at String Initialization due to invalid UTF-8 byte sequence\",RE_STRING_INIT_FAILURE);\n if(buffAllocated==true)\n free(buff);\n return false;\n }\n\n // get length\n str->byteLength = byteLength;\n\n // now that we know the length we can allocate the buffer and copy the bytes\n RF_MALLOC(str->bytes,str->byteLength+1);\n memcpy(str->bytes,buff,str->byteLength+1);\n if(buffAllocated == true)\n free(buff);\n return true;\n}\n#ifdef RF_OPTION_DEFAULT_ARGUMENTS\nchar i_NVrfString_Init(RF_String* str,const char* s)\n{\n // check for validity of the given sequence and get the character length\n uint32_t byteLength;\n if( rfUTF8_VerifySequence(s,&byteLength) == RF_FAILURE)\n {\n LOG_ERROR(\"Error at String Initialization due to invalid UTF-8 byte sequence\",RE_STRING_INIT_FAILURE);\n return false;\n }\n\n // get length\n str->byteLength = byteLength;\n\n // now that we know the length we can allocate the buffer and copy the bytes\n RF_MALLOC(str->bytes,str->byteLength+1);\n memcpy(str->bytes,s,str->byteLength+1);\n\n return true;\n}\n#endif\n\n// Allocates a String by turning a unicode code point in a String (encoded in UTF-8).\nRF_String* rfString_Create_cp(uint32_t codepoint)\n{\n RF_String* ret;\n RF_MALLOC(ret,sizeof(RF_String));\n if(rfString_Init_cp(ret,codepoint) == true)\n {\n return ret;\n }\n // failure\n free(ret);\n return 0;\n}\n\n// Initializes a string by turning a unicode code point in a String (encoded in UTF-8).\nchar rfString_Init_cp(RF_String* str, uint32_t codepoint)\n{\n // alloc enough for a character\n RF_MALLOC(str->bytes,5)\n\n // if we only need a byte to encode it\n if(RF_HEXLE_UI(codepoint,0x007f))\n {\n str->bytes[0] = codepoint;\n str->bytes[1] = '\\0';\n str->byteLength = 1;\n }\n // if we need 2 bytes to encode it\n else if( RF_HEXGE_UI(codepoint,0x0080) && RF_HEXLE_UI(codepoint,0x07ff))\n {\n // get the first bits of the first byte and encode them to the first byte\n str->bytes[1] = (codepoint & 0x3F)|(0x02<<6);\n // get the 5 following bits and encode them in the second byte\n str->bytes[0] = ((codepoint & 0x7C0) >> 6) | (0x6<<5);\n str->bytes[2] = '\\0';\n str->byteLength = 2;\n }\n // if we need 3 bytes to encode it\n else if( RF_HEXGE_UI(codepoint,0x0800) && RF_HEXLE_UI(codepoint,0x0ffff))\n {\n // get the first bits of the first byte and encode them to the first byte\n str->bytes[2] = (codepoint & 0x3F)|(0x02<<6);\n // get the 6 following bits and encode them in the second byte\n str->bytes[1] = ((codepoint & 0xFC0) >> 6) | (0x02<<6);\n // get the 4 following bits and encode them in the third byte\n str->bytes[0] = (((codepoint & 0xF000))>>12) | (0xE<<4);\n str->bytes[3] = '\\0';\n str->byteLength = 3;\n }\n // if we need 4 bytes to encode it\n else if( RF_HEXGE_UI(codepoint,0x10000) && RF_HEXLE_UI(codepoint,0x10ffff))\n {\n // get the first bits of the first byte and encode them to the first byte\n str->bytes[3] = (codepoint & 0x3F)|(0x02<<6);\n // get the 6 following bits and encode them in the second byte\n str->bytes[2] = ((codepoint & 0xFC0) >> 6) | (0x02<<6);\n // get the 6 following bits and encode them in the third byte\n str->bytes[1] = (((codepoint & 0x3F000))>>12) | (0x02<<6);\n // get the 3 following bits and encode them in the fourth byte\n str->bytes[0] = (((codepoint & 0x1C0000))>>18) | (0x1E<<3);\n str->bytes[4] = '\\0';\n str->byteLength = 4;\n }\n else\n {\n LOG_ERROR(\"Attempted to encode an invalid unicode code point into a string\",RE_UTF8_INVALID_CODE_POINT);\n free(str->bytes);\n return false;\n }\n\n return true;\n}\n\n\n// Allocates and returns a string with the given integer\nRF_String* rfString_Create_i(int32_t i)\n{\n // the size of the int32_t buffer\n int32_t numLen;\n // put the int32_t into a buffer and turn it in a char*\n char buff[12];// max uint32_t is 4,294,967,295 in most environment so 12 chars will certainly fit it\n sprintf(buff,\"%d\",i);\n numLen = strlen(buff);\n\n // initialize the string and return it\n RF_String* ret;\n RF_MALLOC(ret,sizeof(RF_String));\n ret->byteLength = numLen;\n RF_MALLOC(ret->bytes,numLen+1);\n strcpy(ret->bytes,buff);\n return ret;\n}\n// Initializes a string with the given integer.\nchar rfString_Init_i(RF_String* str, int32_t i)\n{\n // the size of the int32_t buffer\n int32_t numLen;\n // put the int32_t into a buffer and turn it in a char*\n char buff[12];// max uint32_t is 4,294,967,295 in most environment so 12 chars will certainly fit it\n sprintf(buff,\"%d\",i);\n numLen = strlen(buff);\n\n\n str->byteLength = numLen;\n RF_MALLOC(str->bytes,numLen+1);\n strcpy(str->bytes,buff);\n\n return true;\n}\n\n// Allocates and returns a string with the given float\nRF_String* rfString_Create_f(float f)\n{\n // allocate a buffer for the float in characters\n char* buff;\n RF_MALLOC(buff,128);\n sprintf(buff,\"%f\",f);\n uint32_t len = strlen(buff);\n\n // initialize and return the string\n RF_String* ret;\n RF_MALLOC(ret,sizeof(RF_String));\n ret->byteLength = len;\n RF_MALLOC(ret->bytes,len+1);\n strcpy(ret->bytes,buff);\n\n free(buff);\n\n return ret;\n}\n// Initializes a string with the given float\nchar rfString_Init_f(RF_String* str,float f)\n{\n // allocate a buffer for the float in characters\n char* buff;\n RF_MALLOC(buff,128);\n sprintf(buff,\"%f\",f);\n uint32_t len = strlen(buff);\n\n\n str->byteLength = len;\n RF_MALLOC(str->bytes,len+1);\n strcpy(str->bytes,buff);\n free(buff);\n\n // success\n return true;\n}\n\n// Allocates and returns a string with the given UTF-16 byte sequence. Given characters have to be in UTF-16. A check for valid sequence of bytes is performed.Can't be used with RF_StringX\nRF_String* rfString_Create_UTF16(const char* s,char endianess)\n{\n RF_String* ret;\n RF_MALLOC(ret,sizeof(RF_String));\n if(rfString_Init_UTF16(ret,s,endianess)==false)\n {\n free(ret);\n return 0;\n }\n return ret;\n}\n// Initializes a string with the given UTF-16 byte sequence. Given characters have to be in UTF-16. A check for valid sequence of bytes is performed.Can't be used with RF_StringX\nchar rfString_Init_UTF16(RF_String* str,const char* s,char endianess)\n{\n // decode the utf-16 and get the code points\n uint32_t* codepoints;\n uint32_t byteLength,characterLength,utf8ByteLength;\n char* utf8;\n byteLength = 0;\n while(s[byteLength]!= 0 || s[byteLength+1]!=0)\n {\n byteLength++;\n }\n byteLength+=3;// for the last utf-16 null termination character\n RF_MALLOC(codepoints,byteLength*2) // allocate the codepoints\n // parse the given byte stream depending on the endianess parameter\n switch(endianess)\n {\n case RF_LITTLE_ENDIAN:\n case RF_BIG_ENDIAN:\n if(rfUTILS_Endianess() == endianess)// same endianess as the local\n {\n if(rfUTF16_Decode(s,&characterLength,codepoints) == false)\n {\n free(codepoints);\n LOG_ERROR(\"String initialization failed due to invalide UTF-16 sequence\",RE_STRING_INIT_FAILURE);\n return false;\n }\n }\n else// different\n {\n if(rfUTF16_Decode_swap(s,&characterLength,codepoints) == false)\n {\n free(codepoints);\n LOG_ERROR(\"String initialization failed due to invalide UTF-16 sequence\",RE_STRING_INIT_FAILURE);\n return false;\n }\n }\n break;\n default:\n LOG_ERROR(\"Illegal endianess value provided\",RE_INPUT);\n free(codepoints);\n return false;\n break;\n }// switch ends\n // now encode these codepoints into UTF8\n if( (utf8 = rfUTF8_Encode(codepoints,characterLength,&utf8ByteLength))==0)\n {\n free(codepoints);\n return false;\n }\n // success\n free(codepoints);\n str->bytes = utf8;\n str->byteLength = utf8ByteLength;\n return true;\n\n}\n\n// Allocates and returns a string with the given UTF-32 byte sequence. Given characters have to be in UTF-32.\nRF_String* rfString_Create_UTF32(const char* s)\n{\n RF_String* ret;\n RF_MALLOC(ret,sizeof(RF_String));\n if(rfString_Init_UTF32(ret,s)==false)\n {\n free(ret);\n return 0;\n }\n return ret;\n}\n// Initializes a string with the given UTF-32 byte sequence. Given characters have to be in UTF-32.\nchar rfString_Init_UTF32(RF_String* str,const char* s)\n{\n char swapE = false;\n uint32_t off = 0;\n int32_t i = 0;\n\n // get the buffer and if swapping is needed do it for all character\n uint32_t* codeBuffer = (uint32_t*)(s+off);\n\n // first of all check for existence of BOM in the beginning of the sequence\n if(RF_HEXEQ_UI(codeBuffer[0],0xFEFF))// big endian\n {\n if(rfUTILS_Endianess()==RF_LITTLE_ENDIAN)\n swapE = true;\n }\n if(RF_HEXEQ_UI(codeBuffer[0],0xFFFE0000))// little\n {\n if(rfUTILS_Endianess()==RF_BIG_ENDIAN)\n swapE = true;\n }\n else// according to the standard no BOM means big endian\n {\n if(rfUTILS_Endianess() == RF_LITTLE_ENDIAN)\n swapE = true;\n }\n\n // if we need to have endianess swapped do it\n if(swapE==true)\n {\n while(codeBuffer[i] != 0)\n {\n rfUTILS_SwapEndianUI(codeBuffer+i);\n i++;\n }\n }\n // find the length of the utf32 buffer in characters\n uint32_t length;\n rfUTF32_Length(codeBuffer,length);\n\n // turn the codepoints into a utf-8 encoded buffer\n char* utf8;uint32_t utf8ByteLength;\n if((utf8=rfUTF8_Encode(codeBuffer,length,&utf8ByteLength)) == 0)\n {\n return false;// error\n }\n // if the encoding happened correctly\n if(codeBuffer != 0)\n {\n str->bytes = (char*)codeBuffer;\n str->byteLength = utf8ByteLength;\n return true;\n }\n // else return failure\n return false;\n}\n\n// Assigns the value of the source string to the destination.Both strings should already be initialized and hold a value. It is an error to give null parameters.\nvoid i_rfString_Assign(RF_String* dest,void* sourceP)\n{\n RF_String* source = (RF_String*)sourceP;\n // only if the new string value won't fit in the buffer reallocate the buffer (let's avoid unecessary reallocs)\n if(source->byteLength > dest->byteLength)\n {\n RF_REALLOC(dest->bytes,char,source->byteLength+1);\n }\n // now copy the value\n memcpy(dest->bytes,source->bytes,source->byteLength+1);\n // and fix the lengths\n dest->byteLength = source->byteLength;\n}\n\n// Assigns the value of a unicode character to the string\nchar rfString_Assign_char(RF_String* str,uint32_t codepoint)\n{\n // realloc if needed\n if(str->byteLength <5)\n {\n RF_REALLOC(str->bytes,char,5);\n }\n // if we only need a byte to encode it\n if(RF_HEXLE_UI(codepoint,0x007f))\n {\n str->bytes[0] = codepoint;\n str->bytes[1] = '\\0';\n str->byteLength = 1;\n }\n // if we need 2 bytes to encode it\n else if( RF_HEXGE_UI(codepoint,0x0080) && RF_HEXLE_UI(codepoint,0x07ff))\n {\n // get the first bits of the first byte and encode them to the first byte\n str->bytes[1] = (codepoint & 0x3F)|(0x02<<6);\n // get the 5 following bits and encode them in the second byte\n str->bytes[0] = ((codepoint & 0x7C0) >> 6) | (0x6<<5);\n str->bytes[2] = '\\0';\n str->byteLength = 2;\n }\n // if we need 3 bytes to encode it\n else if( RF_HEXGE_UI(codepoint,0x0800) && RF_HEXLE_UI(codepoint,0x0ffff))\n {\n // get the first bits of the first byte and encode them to the first byte\n str->bytes[2] = (codepoint & 0x3F)|(0x02<<6);\n // get the 6 following bits and encode them in the second byte\n str->bytes[1] = ((codepoint & 0xFC0) >> 6) | (0x02<<6);\n // get the 4 following bits and encode them in the third byte\n str->bytes[0] = (((codepoint & 0xF000))>>12) | (0xE<<4);\n str->bytes[3] = '\\0';\n str->byteLength = 3;\n }\n // if we need 4 bytes to encode it\n else if( RF_HEXGE_UI(codepoint,0x10000) && RF_HEXLE_UI(codepoint,0x10ffff))\n {\n // get the first bits of the first byte and encode them to the first byte\n str->bytes[3] = (codepoint & 0x3F)|(0x02<<6);\n // get the 6 following bits and encode them in the second byte\n str->bytes[2] = ((codepoint & 0xFC0) >> 6) | (0x02<<6);\n // get the 6 following bits and encode them in the third byte\n str->bytes[1] = (((codepoint & 0x3F000))>>12) | (0x02<<6);\n // get the 3 following bits and encode them in the fourth byte\n str->bytes[0] = (((codepoint & 0x1C0000))>>18) | (0x1E<<3);\n str->bytes[4] = '\\0';\n str->byteLength = 4;\n }\n else\n {\n LOG_ERROR(\"Attempted to encode an invalid unicode code point into a string\",RE_UTF8_INVALID_CODE_POINT);\n return false;\n }\n\n return true;\n}\n\n// Allocates and returns a string with the given characters. NO VALID-UTF8 check is performed\n#ifndef RF_OPTION_DEFAULT_ARGUMENTS\nRF_String* rfString_Create_nc(const char* s,...)\n#else\nRF_String* i_rfString_Create_nc(const char* s,...)\n#endif\n{\n RF_String* ret;\n RF_MALLOC(ret,sizeof(RF_String));\n // get the formatted string\n READ_VSNPRINTF_ARGS(s,s,0);\n // get the lengt of the byte buffer\n ret->byteLength = bytesWritten;\n\n // now that we know the length we can allocate the buffer and copy the bytes\n RF_MALLOC(ret->bytes,ret->byteLength+1);\n memcpy(ret->bytes,buff,ret->byteLength+1);\n if(buffAllocated)\n free(buff);\n return ret;\n}\n#ifdef RF_OPTION_DEFAULT_ARGUMENTS\nRF_String* i_NVrfString_Create_nc(const char* s)\n{\n RF_String* ret;\n RF_MALLOC(ret,sizeof(RF_String));\n // get length\n ret->byteLength = strlen(s);\n\n // now that we know the length we can allocate the buffer and copy the bytes\n RF_MALLOC(ret->bytes,ret->byteLength+1);\n memcpy(ret->bytes,s,ret->byteLength+1);\n return ret;\n}\n#endif\n\n// Initializes a string with the given characters. NO VALID-UTF8 check is performed\n#ifndef RF_OPTION_DEFAULT_ARGUMENTS\nchar rfString_Init_nc(struct RF_String* str,const char* s,...)\n#else\nchar i_rfString_Init_nc(struct RF_String* str,const char* s,...)\n#endif\n{\n // get the formatted string\n READ_VSNPRINTF_ARGS(s,s,false)\n // get its length\n str->byteLength = bytesWritten;\n\n // now that we know the length we can allocate the buffer and copy the bytes\n RF_MALLOC(str->bytes,str->byteLength+1);\n memcpy(str->bytes,buff,str->byteLength+1);\n if(buffAllocated == true)\n free(buff);\n return true;\n}\n#ifdef RF_OPTION_DEFAULT_ARGUMENTS\nchar i_NVrfString_Init_nc(struct RF_String* str,const char* s)\n{\n // get its length\n str->byteLength = strlen(s);\n\n // now that we know the length we can allocate the buffer and copy the bytes\n RF_MALLOC(str->bytes,str->byteLength+1);\n memcpy(str->bytes,s,str->byteLength+1);\n return true;\n}\n#endif\n\n/*-------------------------------------------------------------------------Methods to get rid of an RF_String-------------------------------------------------------------------------------*/\n\n// Deletes a string object and also frees its pointer.It is an error to give a NULL(0x0) string for deleting. Will most probably lead to a segmentation fault\nvoid rfString_Destroy(RF_String* s)\n{\n free(s->bytes);\n free(s);\n}\n// Deletes a string object only, not its memory.It is an error to give a NULL(0x0) string for deleting. Will most probably lead to a segmentation fault\nvoid rfString_Deinit(RF_String* s)\n{\n free(s->bytes);\n}\n/*------------------------------------------------------------------------ RF_String unicode conversio functions-------------------------------------------------------------------------------*/\n\n// Returns the strings contents as a UTF-16 buffer\nuint16_t* rfString_ToUTF16(RF_String* s,uint32_t* length)\n{\n uint32_t* codepoints,charsN;\n // get the unicode codepoints, no check here since RF_String is always guaranteed to have valid UTF=8 and as such valid codepoints\n codepoints = rfUTF8_Decode(s->bytes,s->byteLength,&charsN);\n // encode them in UTF-16, no check here since it comes from an RF_String which is always guaranteed to have valid UTF-8 and as such valid codepoints\n return rfUTF16_Encode(codepoints,charsN,length);\n}\n\n// Returns the strings contents as a UTF-32 buffer\nuint32_t* rfString_ToUTF32(RF_String* s,uint32_t* length)\n{\n // get the unicode codepoints, no check here since RF_String is always guaranteed to have valid UTF=8 and as such valid codepoints\n return rfUTF8_Decode(s->bytes,s->byteLength,length);\n}\n\n/*------------------------------------------------------------------------ RF_String retrieval functions-------------------------------------------------------------------------------*/\n// Finds the length of the string in characters\nuint32_t rfString_Length(void* str)\n{\n RF_String* s = (RF_String*)str;\n uint32_t length,i;\n RF_STRING_ITERATE_START(s,length,i)\n RF_STRING_ITERATE_END(length,i);\n return length;\n}\n\n// Retrieves the unicode code point of the parameter character.\nuint32_t rfString_GetChar(void* str,uint32_t c)\n{\n RF_String* thisstr = (RF_String*)str;\n uint32_t length,i;\n uint32_t codePoint = RF_STRING_INDEX_OUT_OF_BOUNDS;\n RF_STRING_ITERATE_START(thisstr,length,i)\n // if we found the character,inspect the 4 different cases\n if(length == c)\n {\n // take the codepoint from the byte position and break from the loop\n codePoint = rfString_BytePosToCodePoint(thisstr,i);\n break;\n }\n RF_STRING_ITERATE_END(length,i)\n\n // and return the code point. Notice that if the character was not found this will return RF_STRING_INDEX_OUT_OF_BOUNDS\n return codePoint;\n}\n\n// Retrieves the unicode code point of the parameter bytepos of the string. If the byte position is not the start of a character 0 is returned. This is an internal function, there is no need to use it. Can be used with StringX\nuint32_t rfString_BytePosToCodePoint(void* str,uint32_t i)\n{\n uint32_t codePoint=0;\n RF_String* thisstr = (RF_String*)str;\n // /Here I am not checking if byte position 'i' is withing bounds and especially if it is a start of a character\n // / This is assumed to have been checked or to be known beforehand by the programmer. That's one of the reasons\n // / why this is an internal function and should not be used unless you know what you are doing\n // if the lead bit of the byte is 0 then range is : U+0000 to U+0007F (1 byte)\n if( ((thisstr->bytes[i] & 0x80)>>7) == 0 )\n {\n // and the code point is this whole byte only\n codePoint = thisstr->bytes[i];\n }\n // if the leading bits are in the form of 0b110xxxxx then range is: U+0080 to U+07FF (2 bytes)\n else if ( RF_HEXEQ_C( ( (~(thisstr->bytes[i] ^ 0xC0))>>5),0x7) )\n {\n codePoint =0;\n // from the second byte take the first 6 bits\n codePoint = (thisstr->bytes[i+1] & 0x3F) ;\n // from the first byte take the first 5 bits and put them in the start\n codePoint |= ((thisstr->bytes[i] & 0x1F) << 6);\n }\n // if the leading bits are in the form of 0b1110xxxx then range is U+0800 to U+FFFF (3 bytes)\n else if( RF_HEXEQ_C( ( (~(thisstr->bytes[i] ^ 0xE0))>>4),0xF) )\n {\n codePoint = 0;\n // from the third byte take the first 6 bits\n codePoint = (thisstr->bytes[i+2] & 0x3F) ;\n // from the second byte take the first 6 bits and put them to the left of the previous 6 bits\n codePoint |= ((thisstr->bytes[i+1] & 0x3F) << 6);\n // from the first byte take the first 4 bits and put them to the left of the previous 6 bits\n codePoint |= ((thisstr->bytes[i] & 0xF) << 12);\n }\n // if the leading bits are in the form of 0b11110xxx then range is U+010000 to U+10FFFF (4 bytes)\n else if( RF_HEXEQ_C( ( (~(thisstr->bytes[i] ^ 0xF0))>>3), 0x1F))\n {\n codePoint = 0;\n // from the fourth byte take the first 6 bits\n codePoint = (thisstr->bytes[i+3] & 0x3F) ;\n // from the third byte take the first 6 bits and put them to the left of the previous 6 bits\n codePoint |= ((thisstr->bytes[i+2] & 0x3F) << 6);\n // from the second byte take the first 6 bits and put them to the left of the previous 6 bits\n codePoint |= ((thisstr->bytes[i+1] & 0x3F) << 12);\n // from the first byte take the first 3 bits and put them to the left of the previous 6 bits\n codePoint |= ((thisstr->bytes[i] & 0x7) << 18);\n }\n\n return codePoint;\n}\n\n\n// Retrieves character position of a byte position\nuint32_t rfString_BytePosToCharPos(void* thisstrP,uint32_t bytepos,char before)\n{\n // /here there is no check if this is actually a byte pos inside the string's\n // /byte buffer. The programmer should have made sure it is before hand. This is why it is\n // / an internal function and should only be used if you know what you are doing\n RF_String* thisstr = (RF_String*)thisstrP;\n uint32_t charPos = 0;\n uint32_t byteI = 0;\n // iterate the string's bytes until you get to the required byte\n // if it is not a continuation byte, return the position\n if(rfUTF8_IsContinuationByte(thisstr->bytes[bytepos])==false)\n {\n RF_STRING_ITERATE_START(thisstr,charPos,byteI)\n if(byteI == bytepos)\n return charPos;\n RF_STRING_ITERATE_END(charPos,byteI)\n }\n // else iterate the string's bytes until you get anything bigger than the required byte\n RF_STRING_ITERATE_START(thisstr,charPos,byteI)\n if(byteI > bytepos)\n break;\n RF_STRING_ITERATE_END(charPos,byteI)\n // if we need the previous one return it\n if(before == true)\n return charPos-1;\n // else return this\n return charPos;\n}\n\n// Compares two Strings and returns true if they are equal and false otherwise\nchar i_rfString_Equal(void* s1P,void* s2P)\n{\n RF_String* s1 = (RF_String*)s1P;\n RF_String* s2 = (RF_String*)s2P;\n if( strcmp(s1->bytes,s2->bytes)==0)\n {\n return true;\n }\n return false;\n}\n\n// Finds the existence of String sstr inside this string, either matching case or not\nint32_t i_rfString_Find(const void* str,const void* sstrP,const char* optionsP)\n{\n // / @note TO SELF: If I make any changes to this function do not forget to change the private version that returns byte position too\n // / located at string_private.c and called rfString_FindByte and rfString_FindByte_s\n RF_String* thisstr = (RF_String*)str;\n RF_String* sstr = (RF_String*)sstrP;\n char options = *optionsP;\n\n char* found = 0;\n // if we want to match the case of the string then it's a simple search of matching characters\n if( (RF_BITFLAG_ON( options,RF_CASE_IGNORE)) == false)\n {\n // if it is not found\n if( (found = strstr(thisstr->bytes,sstr->bytes)) == 0)\n {\n return RF_FAILURE;\n }\n // get the byte position\n uint32_t bytepos = found-thisstr->bytes;\n // if we need the exact string as it is given\n if(RF_BITFLAG_ON( options,RF_MATCH_WORD))\n {\n // check before the found string\n if(bytepos != 0)\n {\n // if is is not a character\n switch(thisstr->bytes[bytepos-1])\n {\n case ' ':case '\\t':case '\\n':\n break;\n default:\n return RF_FAILURE;\n break;\n }\n }\n // check after the found string\n if(bytepos+sstr->byteLength != thisstr->byteLength)\n {\n // if is is not a character\n switch(thisstr->bytes[bytepos+sstr->byteLength])\n {\n case ' ':case '\\t':case '\\n':\n break;\n default:\n return RF_FAILURE;\n break;\n }\n }\n }// end of the exact string option\n // success\n return rfString_BytePosToCharPos(thisstr,bytepos,false);\n }\n\n // else ignore case matching\n uint32_t i,j;\n // if(cstr[0] >= 0x41 && cstr[0] <= 0x5a)\n for(i=0;ibyteLength; i ++)\n {\n // if i matches the start of the substring\n for(j = 0; j < sstr->byteLength; j++)\n {\n // if the jth char is a big letter\n if(sstr->bytes[j] >= 0x41 && sstr->bytes[j] <= 0x5a)\n {\n // no match\n if(sstr->bytes[j] != thisstr->bytes[i+j] && sstr->bytes[j]+32 != thisstr->bytes[i+j])\n break;\n // there is a match in the jth character so let's perform additional checks if needed\n if(RF_BITFLAG_ON( options,RF_MATCH_WORD))\n {\n // if it's the first substring character and if the string we search is not in it's beginning, check for EXACT string before\n if(j == 0 && i != 0)\n {\n switch(thisstr->bytes[i-1])\n {\n case ' ':case '\\t':case '\\n':\n break;\n default:\n return RF_FAILURE;\n break;\n }\n }\n }// exact string check if ends\n }\n // small letter\n else if(sstr->bytes[j] >= 0x61 && sstr->bytes[j] <= 0x7a)\n {\n // no match\n if(sstr->bytes[j] != thisstr->bytes[i+j] && sstr->bytes[j]-32 != thisstr->bytes[i+j])\n break;\n // there is a match in the jth character so let's perform additional checks if needed\n if(RF_BITFLAG_ON(options,RF_MATCH_WORD))\n {\n // if it's the first substring character and if the string we search is not in it's beginning, check for EXACT string before\n if(j == 0 && i != 0)\n {\n switch(thisstr->bytes[i-1])\n {\n case ' ':case '\\t':case '\\n':\n break;\n default:\n return RF_FAILURE;\n break;\n }\n }\n }// exact string check if ends\n }\n // not a letter and no match\n else if(sstr->bytes[j] != thisstr->bytes[i+j])\n break;// break off the substring search loop\n\n // if we get here and it's the last char of the substring we either found it or need to perform one last check for exact string\n if(j == sstr->byteLength-1)\n {\n // only if the end of the string is not right after the substring\n if( RF_BITFLAG_ON(options,RF_MATCH_WORD) && i+sstr->byteLength < thisstr->byteLength)\n {\n switch(thisstr->bytes[i+sstr->byteLength])\n {\n case ' ':case '\\t':case '\\n':\n break;\n default:\n return RF_FAILURE;\n break;\n }\n }// end of the exact string check\n // succes\n return rfString_BytePosToCharPos(thisstr,i,false);\n }// end of it's the last char of the substring check\n }// substring iteration ends\n }// this string iteration ends\n return RF_FAILURE;\n}\n\n// Returns the integer value of the string if and only if it contains only numbers. If it contains anything else the function fails.\nchar rfString_ToInt(void* str,int32_t* v)\n{\n RF_String* thisstr = (RF_String*)str;\n char* end;\n // get the integer\n *v = strtol ( thisstr->bytes, &end,10);\n\n// /This is the non-strict case. Takes the number out of the string no matter what else it has inside\n/* // if we did get something\n if(strlen(end) < this->length())\n return true;\n*/\n// /This is the strict case, and the one we will go with. The non-strict case might be moved to its own function, if ever in the future\n if(end[0] == '\\0')\n return true;\n\n // else false\n return false;\n}\n\n// Returns the float value of a String\nint rfString_ToDouble(void* thisstrP,double* f)\n{\n RF_String* str = (RF_String*)thisstrP;\n *f = strtod(str->bytes,NULL);\n // check the result\n if(*f == 0.0)\n {\n // if it's zero and the string equals to zero then we are okay\n if(rfString_Equal(str,RFS_(\"0\")) || rfString_Equal(str,RFS_(\"0.0\")))\n return RF_SUCCESS;\n // underflow error\n if(errno == ERANGE)\n return RE_STRING_TOFLOAT_UNDERFLOW;\n // in any other case it's a conversion error\n return RE_STRING_TOFLOAT;\n }\n // if the result is a HUGE_VAL and errno is set,the number is not representable by a double\n if(*f == HUGE_VAL && errno == ERANGE)\n return RE_STRING_TOFLOAT_RANGE;\n\n // any other case success\n return RF_SUCCESS;\n}\n\n// Returns a cstring version of the string.\nconst char* rfString_ToCstr(const void* str)\n{\n RF_String* thisstr = (RF_String*)str;\n return thisstr->bytes;\n}\n\n// Creates and returns an allocated copy of the given string\nRF_String* rfString_Copy_OUT(void* srcP)\n{\n RF_String* src = (RF_String*)srcP;\n // create the new string\n RF_String* ret;\n RF_MALLOC(ret,sizeof(RF_String));\n // get the length\n ret->byteLength = src->byteLength;\n // copy the bytes\n RF_MALLOC(ret->bytes,ret->byteLength+1);\n memcpy(ret->bytes,src->bytes,ret->byteLength+1);\n return ret;\n\n}\n// Copies all the contents of a string to another\nvoid rfString_Copy_IN(RF_String* dst,void* srcP)\n{\n RF_String* src = (RF_String*)srcP;\n // get the length\n dst->byteLength = src->byteLength;\n // copy the bytes\n RF_MALLOC(dst->bytes,src->byteLength+1);\n memcpy(dst->bytes,src->bytes,dst->byteLength+1);\n return;\n\n}\n// Copies a certain number of characters from a string\nvoid rfString_Copy_chars(RF_String* dst,void* srcP,uint32_t charsN)\n{\n uint32_t i = 0,bytePos;\n RF_String* src = (RF_String*)srcP;\n\n // find the byte position until which we need to copy\n RF_STRING_ITERATE_START(src,i,bytePos)\n if(i == charsN)\n break;\n RF_STRING_ITERATE_END(i,bytePos)\n dst->byteLength = bytePos;\n RF_MALLOC(dst->bytes,dst->byteLength+1);\n memcpy(dst->bytes,src->bytes,dst->byteLength+1);\n dst->bytes[dst->byteLength] = '\\0';// null terminate it\n}\n\n\n// Applies a limited version of sscanf after the specified substring\nchar i_rfString_ScanfAfter(void* str,void* afterstrP,const char* format,void* var)\n{\n RF_String* thisstr = (RF_String*)str;\n RF_String* afterstr = (RF_String*)afterstrP;\n // return false if the substring is not found\n char* found,*s;\n if( (found = strstr(thisstr->bytes,afterstr->bytes)) ==0 )\n {\n return false;\n }\n // get a pointer to the start of the position where sscanf will be used\n s = thisstr->bytes + (found-thisstr->bytes+afterstr->byteLength);\n\n // use sscanf\n if(sscanf(s,format,var) <=0)\n {\n return false;\n }\n return true;\n}\n\n// Counts how many times a substring s occurs inside the string\nint32_t i_rfString_Count(void* str,void* sstr2,const char* optionsP)\n{\n RF_String* thisstr = (RF_String*)str;\n RF_String* sstr = (RF_String*)sstr2;\n char options = *optionsP;\n int32_t index = 0;\n int32_t move;\n int32_t n = 0;\n\n // as long as the substring is found in the string\n while ((move = rfString_FindBytePos(thisstr,sstr,options)) != RF_FAILURE)\n {\n move+= sstr->byteLength;\n // proceed searching inside the string and also increase the counter\n n++;\n thisstr->bytes+=move;\n index +=move;\n thisstr->byteLength -=move;\n }\n\n // return string to its original state and return the number of occurences, also returns 0 if not found\n thisstr->bytes-=index;\n thisstr->byteLength += index;\n // success\n return n;\n}\n\n// Tokenizes the given string. Separates it into @c tokensN depending on how many substrings can be created from the @c sep separatior and stores them\n// into the Array of RF_String* that should be passed to the function\ni_DECLIMEX_ char rfString_Tokenize(void* str,char* sep,uint32_t* tokensN,RF_String** tokens)\n{\n RF_String* thisstr = (RF_String*)str;\n uint32_t i;\n // first find the occurences of the separator, and then the number of tokens\n *tokensN = rfString_Count(thisstr,RFS_(sep),0)+1;\n // error checking\n if(*tokensN == 0)\n return false;\n\n // allocate the tokens\n RF_MALLOC(*tokens,sizeof(RF_String) *(*tokensN));\n // find the length of the separator\n uint32_t sepLen = strlen(sep);\n char* s,*e;\n s = thisstr->bytes;\n for(i = 0; i < (*tokensN)-1; i ++)\n {\n // find each substring\n e = strstr(s,sep);\n (*tokens)[i].byteLength = e-s;\n RF_MALLOC((*tokens)[i].bytes,(*tokens)[i].byteLength+1);\n // put in the data\n strncpy((*tokens)[i].bytes,s,(*tokens)[i].byteLength);\n // null terminate\n (*tokens)[i].bytes[(*tokens)[i].byteLength] = '\\0';\n\n // prepare for next sub-string\n s = e+sepLen;\n\n }\n // /make sure that if it's the last substring we change strategy\n (*tokens)[i].byteLength = strlen(s);\n RF_MALLOC((*tokens)[i].bytes,(*tokens)[i].byteLength+1);\n // put in the data\n strncpy((*tokens)[i].bytes,s,(*tokens)[i].byteLength);\n // null terminate\n (*tokens)[i].bytes[(*tokens)[i].byteLength] = '\\0';\n\n // success\n return true;\n}\n// Initializes the given string as the first substring existing between the left and right parameter substrings.\nchar i_rfString_Between(void* thisstrP,void* lstrP,void* rstrP,RF_String* result,const char* optionsP)\n{\n int32_t start,end;\n RF_String* thisstr = (RF_String*)thisstrP;\n RF_String* lstr = (RF_String*)lstrP;\n RF_String* rstr = (RF_String*)rstrP;\n char options = *optionsP;\n RF_String temp;\n // find the left substring\n if( (start = rfString_FindBytePos(thisstr,lstr,options))== RF_FAILURE)\n {\n return false;\n }\n // get what is after it\n rfString_After(thisstr,lstr,&temp,options);\n // find the right substring in the remaining part\n if( (end = rfString_FindBytePos(&temp,rstr,options))== RF_FAILURE)\n {\n return false;\n }\n // free temp string\n rfString_Deinit(&temp);\n // initialize the string to return\n result->byteLength = end;\n RF_MALLOC(result->bytes,result->byteLength+1);\n memcpy(result->bytes,thisstr->bytes+start+lstr->byteLength,result->byteLength+1);\n result->bytes[end]= '\\0';\n // success\n return true;\n}\n\n// Initializes the given string as the substring from the start until any of the given Strings are found.\n#ifndef RF_OPTION_DEFAULT_ARGUMENTS\nchar rfString_Beforev(void* thisstrP,RF_String* result,const char* optionsP,const unsigned char* parNP, ...)\n#else\nchar i_rfString_Beforev(void* thisstrP,RF_String* result,const char* optionsP,const unsigned char* parNP, ...)\n#endif\n{\n RF_String* thisstr = (RF_String*)thisstrP;\n RF_String* s;\n char options = *optionsP;\n unsigned char parN = *parNP;\n int32_t i,minPos,thisPos;\n // will keep the argument list\n va_list argList;\n // get the parameter characters\n va_start(argList,parNP);\n\n minPos = 9999999;\n for(i = 0; i < parN; i++)\n {\n s = (RF_String*) va_arg(argList,RF_String*);\n if( (thisPos= rfString_FindBytePos(thisstr,s,options))!= RF_FAILURE)\n {\n if(thisPos < minPos)\n minPos = thisPos;\n }\n }\n va_end(argList);\n\n // if it is not found\n if(minPos == 9999999)\n {\n return false;\n }\n // if it is found initialize the substring\n result->byteLength = minPos;\n RF_MALLOC(result->bytes,minPos+1);\n memcpy(result->bytes,thisstr->bytes,minPos);\n result->bytes[minPos] = '\\0';\n // success\n return true;\n}\n\n// Initializes the given string as the substring from the start until the given string is found\nchar i_rfString_Before(void* thisstrP,void* sstrP,RF_String* result,const char* optionsP)\n{\n RF_String* thisstr = (RF_String*)thisstrP;\n RF_String* sstr = (RF_String*) sstrP;\n char options = *optionsP;\n int32_t ret;\n // find the substring\n if( (ret = rfString_FindBytePos(thisstr,sstr,options)) == RF_FAILURE)\n {\n return false;\n }\n // if it is found get the result initialize the substring\n result->byteLength = ret;\n RF_MALLOC(result->bytes,result->byteLength+1);\n memcpy(result->bytes,thisstr->bytes,result->byteLength);\n result->bytes[result->byteLength] = '\\0';\n // success\n return true;\n}\n\n\n// Initializes the given String with the substring located after (and not including) the after substring inside the parameter string. If the substring is not located the function returns false.\nchar i_rfString_After(void* thisstrP,void* afterP,RF_String* out,const char* optionsP)\n{\n RF_String* thisstr = (RF_String*)thisstrP;\n RF_String* after = (RF_String*)afterP;\n char options = *optionsP;\n int32_t bytePos;\n // check for substring existence\n if( (bytePos = rfString_FindBytePos(thisstr,after,options)) == RF_FAILURE)\n {\n return false;\n }\n // done so let's get it. Notice the use of the non-checking initialization\n rfString_Init_nc(out,thisstr->bytes+bytePos+after->byteLength);\n // success\n return true;\n}\n\n\n// Initialize a string after the first of the given substrings found\n#ifndef RF_OPTION_DEFAULT_ARGUMENTS\nchar rfString_Afterv(void* thisstrP,RF_String* result,const char* optionsP,const unsigned char* parNP,...)\n#else\nchar i_rfString_Afterv(void* thisstrP,RF_String* result,const char* optionsP,const unsigned char* parNP,...)\n#endif\n{\n RF_String* thisstr = (RF_String*)thisstrP;\n RF_String* s;\n char options = *optionsP;\n unsigned char parN = *parNP;\n int32_t i,minPos,thisPos;\n uint32_t minPosLength;\n // will keep the argument list\n va_list argList;\n // get the parameter characters\n va_start(argList,parNP);\n\n minPos = 9999999;\n for(i = 0; i < parN; i++)\n {\n s = (RF_String*) va_arg(argList,RF_String*);\n if( (thisPos= rfString_FindBytePos(thisstr,s,options))!= RF_FAILURE)\n {\n if(thisPos < minPos)\n {\n minPos = thisPos;\n minPosLength = s->byteLength;\n }\n }\n }\n va_end(argList);\n // if it is not found\n if(minPos == 9999999)\n {\n return false;\n }\n // if it is found initialize the substring\n minPos += minPosLength;// go after the found substring\n result->byteLength = thisstr->byteLength-minPos;\n RF_MALLOC(result->bytes,result->byteLength);\n memcpy(result->bytes,thisstr->bytes+minPos,result->byteLength);\n result->bytes[result->byteLength] = '\\0';\n // success\n return true;\n}\n\n/*------------------------------------------------------------------------ RF_String manipulation functions-------------------------------------------------------------------------------*/\n\n\n// Appends the parameter String to this one\nvoid i_rfString_Append(RF_String* thisstr,void* otherP)\n{\n RF_String* other = (RF_String*)otherP;\n // /@note Here if a null addition is given lots of actions are done but the result is safe and the same string as the one entered.\n // /A check here would result in an additional check for every appending so I decided against it\n // calculate the new length\n thisstr->byteLength +=other->byteLength;\n // reallocate this string to fit the new addition\n RF_REALLOC(thisstr->bytes,char,thisstr->byteLength+1);\n // add the string to this one\n strncat(thisstr->bytes,other->bytes,other->byteLength);\n}\n\n// Appends an integer to the string\nvoid rfString_Append_i(RF_String* thisstr,const int32_t i)\n{\n // create a new buffer for the string big enough to fit any number plus the original string\n char* buff;\n RF_MALLOC(buff,thisstr->byteLength+15);// max uint32_t is 4,294,967,295 in most environment so 12 chars will certainly fit it\n // put the int32_t inside the string\n sprintf(buff,\"%s%i\",thisstr->bytes,i);\n // free the previous c string\n free(thisstr->bytes);\n // point the string pointer to the new string\n thisstr->bytes = buff;\n thisstr->byteLength = strlen(thisstr->bytes);\n}\n// Appends a float to the string. Can't be used with RF_StringX\nvoid rfString_Append_f(RF_String* thisstr,const float f)\n{\n // a temporary buffer to hold the float and the string\n char* buff;\n RF_MALLOC(buff,thisstr->byteLength+64);\n // put the float inside the string\n sprintf(buff,\"%s%f\",thisstr->bytes,f);\n // free the previous c string\n free(thisstr->bytes);\n // point the string pointer to the new string\n thisstr->bytes = buff;\n thisstr->byteLength = strlen(thisstr->bytes);\n}\n\n// Prepends the parameter String to this string\nvoid i_rfString_Prepend(RF_String* thisstr,void* otherP)\n{\n RF_String* other = (RF_String*)otherP;\n uint32_t size;\n int32_t i;// is not unsigned since it goes to -1 in the loop\n // keeep the original byte size of the string\n size = thisstr->byteLength;\n // calculate the new lengths\n thisstr->byteLength += other->byteLength;\n // reallocate this string to fit the new addition\n RF_REALLOC(thisstr->bytes,char,thisstr->byteLength+1);\n // move the pre-existing string to the end of the buffer, by dislocating each byte by cstrlen\n for(i =size; i >=0 ; i--)\n thisstr->bytes[i+other->byteLength] = thisstr->bytes[i];\n // and now add the new string to the start\n memcpy(thisstr->bytes,other->bytes,other->byteLength);\n}\n\n// Removes all of the specifed string occurences from this String matching case or not, DOES NOT reallocate buffer size.\nchar i_rfString_Remove(void* thisstrP,void* rstrP,uint32_t* numberP,const char* optionsP)\n{\n RF_String* thisstr = (RF_String*)thisstrP;\n RF_String* rstr = (RF_String*)rstrP;\n char options = *optionsP;\n uint32_t number = *numberP;\n uint32_t i,count,occurences=0;\n int32_t bytePos;\n char found = false;\n // as long as we keep finding rstr in the string keep removing it\n do\n { // if the substring is not found\n if( (bytePos = rfString_FindBytePos(thisstr,rstr,options)) == RF_FAILURE)\n {\n // if we have not even found it once , we fail\n if(found == false)\n {\n return false;\n }\n else // else we are done\n break;\n }\n\n // substring found\n found = true;\n // move all of the string a position back\n count = 0;\n for(i = bytePos; i <=thisstr->byteLength; i ++)\n {\n thisstr->bytes[i] = thisstr->bytes[i+rstr->byteLength];\n count++;\n }\n // now change the byte length\n thisstr->byteLength -= rstr->byteLength;\n // count the number of occurences and if we reached the required amount, stop\n occurences++;\n if(occurences == number)\n break;\n }while(bytePos != RF_FAILURE);\n // succcess\n return true;\n}\n\n// Removes all of the characters of the string except those specified\nvoid i_rfString_KeepOnly(void* thisstrP,void* keepstrP)\n{\n uint32_t keepLength,i,j,charValue,temp;\n uint32_t *keepChars;\n RF_String* thisstr = (RF_String*)thisstrP;\n RF_String* keepstr = (RF_String*)keepstrP;\n char exists,charBLength;\n // first let's get all of the characters of the keep string in an array\n i=0;\n keepLength = rfString_Length(keepstr);\n RF_MALLOC(keepChars,4*keepLength);\n rfString_Iterate_Start(keepstr,i,charValue)\n keepChars[i] = charValue;\n rfString_Iterate_End(i)\n // now iterate every character of this string\n i=0;\n rfString_Iterate_Start(thisstr,i,charValue)\n // for every character check if it exists in the keep str\n exists = false;\n for(j=0;jbytes+byteIndex_,thisstr->bytes+byteIndex_+charBLength,thisstr->byteLength-byteIndex_+charBLength);\n thisstr->byteLength-=charBLength;\n continue;// by contiuing here we make sure that the current string position won't be moved to assure that we also check the newly move characters\n }\n rfString_Iterate_End(i)\n // before returning free the keep string's character array\n free(keepChars);\n}\n\n// Removes the first n characters from the start of the string\nchar rfString_PruneStart(void* thisstrP,uint32_t n)\n{\n RF_String* thisstr = (RF_String*)thisstrP;\n // iterate the characters of the string\n uint32_t i;\n uint32_t length = 0;\n unsigned nBytePos = 0;\n char found = false;\n RF_STRING_ITERATE_START(thisstr,length,i);\n // if we reach the number of characters passed as a parameter, note it\n if(length == n)\n {\n // remember that now i is the byte position we need\n nBytePos = i;\n found = true;\n break;\n }\n RF_STRING_ITERATE_END(length,i)\n\n // if the string does not have n chars to remove it becomes an empty string and we return failure\n if(found == false)\n {\n thisstr->bytes[0] = '\\0';\n thisstr->byteLength = 0;\n return false;\n }\n\n // move the string back to cover the empty places.reallocation here would be an overkill, everything will be freed together when the string gets freed\n for(i =0; i < thisstr->byteLength-nBytePos+1;i++ )\n thisstr->bytes[i] = thisstr->bytes[i+nBytePos];\n\n // get the new bytelength\n thisstr->byteLength -= nBytePos;\n\n return true;\n}\n\n// Removes the last n characters from the end of the string\nchar rfString_PruneEnd(void* thisstrP,uint32_t n)\n{\n RF_String* thisstr = (RF_String*)thisstrP;\n // start the iteration of the characters from the end of the string\n int32_t nBytePos = -1;\n uint32_t length,i;\n RF_STRING_ITERATEB_START(thisstr,length,i)\n // if we found the requested number of characters from the end of the string\n if(length == n)\n {\n // remember that now i is the byte position we need\n nBytePos = i;\n break;\n }\n RF_STRING_ITERATEB_END(length,i)\n\n // if the string does not have n chars to remove it becomes an empty string and we return failure\n if(nBytePos == -1)\n {\n thisstr->bytes[0] = '\\0';\n return false;\n }\n\n // just set the end of string character characters back, reallocation here would be an overkill, everything will be freed together when the string gets freed\n thisstr->bytes[nBytePos] = '\\0';\n // and also set the new byte length\n thisstr->byteLength -= (thisstr->byteLength - nBytePos);\n // success\n return true;\n}\n\n// Removes n characters from the position p of the string counting backwards. If there is no space to do so, nothing is done and returns false.\nchar rfString_PruneMiddleB(void* thisstrP,uint32_t p,uint32_t n)\n{\n RF_String* thisstr = (RF_String*)thisstrP;\n // if we ask to remove more characters from the position that it would be possible do nothign and return false\n if(n>p+1)\n return false;\n\n // iterate the characters of the string\n uint32_t j,i,length;\n int32_t pBytePos,nBytePos;\n pBytePos = nBytePos = -1;\n RF_STRING_ITERATE_START(thisstr,length,i)\n // if we reach the number of characters passed as a parameter, note it\n if(length == p+1)\n {\n // we search for p+1 because we want to include all of the p character\n pBytePos = i;\n // also break since we don't care after position p\n break;\n }\n if(length == p-n+1)// +1 is to make sure that indexing works from 0\n nBytePos = i;\n\n RF_STRING_ITERATE_END(length,i)\n\n // if the position was not found in the string do nothing\n if(pBytePos == -1 || nBytePos == -1)\n return false;\n\n // move the bytes in the buffer to remove the requested characters\n for(i=nBytePos,j=0;j<= thisstr->byteLength-pBytePos+1; i ++,j++) // here +2 is for (+1 for pbytePos to go to the start of pth character) (+1 for the byteLength to include the null termination character)\n {\n thisstr->bytes[i] = thisstr->bytes[pBytePos+j];\n }\n\n // find the new byte length\n thisstr->byteLength -= (nBytePos - pBytePos);\n\n return true;\n}\n\n// Removes n characters from the position p of the string counting forwards. If there is no space, nothing is done and returns false.\nchar rfString_PruneMiddleF(void* thisstrP,uint32_t p,uint32_t n)\n{\n RF_String* thisstr = (RF_String*)thisstrP;\n // iterate the characters of the string\n uint32_t j,i,length;\n int32_t pBytePos,nBytePos;\n pBytePos = nBytePos = -1;\n RF_STRING_ITERATE_START(thisstr,length,i)\n // if we reach the number of characters passed as a parameter, note it\n if(length == p)\n pBytePos = i;\n\n if(length == p+n)\n {\n nBytePos = i;\n break;// since we got all the data we needed\n }\n\n RF_STRING_ITERATE_END(length,i)\n\n // if the position was not found in the string do nothing\n if(pBytePos == -1 )\n return false;\n\n // if we did not find the byte position of p+n then we remove everything from pBytePos until the end of the string\n if(nBytePos == -1)\n {\n thisstr->bytes[pBytePos] = '\\0';\n thisstr->byteLength -= (thisstr->byteLength-pBytePos);\n return true;\n }\n\n // move the bytes in the buffer to remove the requested characters\n for(i=pBytePos,j=0;j<= thisstr->byteLength-nBytePos+1; i ++,j++) // here +2 is for (+1 for pbytePos to go to the start of pth character) (+1 for the byteLength to include the null termination character)\n {\n thisstr->bytes[i] = thisstr->bytes[nBytePos+j];\n }\n\n // find the new byte length\n thisstr->byteLength -= (nBytePos - pBytePos);\n return true;\n}\n\n// Replaces all of the specified sstr substring from the String with rstr and reallocates size, unless the new size is smaller\nchar i_rfString_Replace(RF_String* thisstr,void* sstrP,void* rstrP,const uint32_t* numP,const char* optionsP)\n{\n RF_String* sstr = (RF_String*)sstrP;\n RF_String* rstr = (RF_String*)rstrP;\n char options = *optionsP;\n uint32_t num = *numP;\n RF_StringX temp;// just a temporary string for finding the occurences\n // will keep the number of found instances of the substring\n uint32_t foundN = 0;\n // will keep the number of given instances to find\n uint32_t number = num;\n uint32_t diff,i,j;\n // if the substring string is not even found return false\n if(rfString_FindBytePos(thisstr,sstr,options) == RF_FAILURE)\n {\n return false;\n }\n // create a buffer that will keep the byte positions\n uint32_t bSize = 50;\n int32_t * bytePositions;\n RF_MALLOC(bytePositions,bSize*sizeof(int32_t));\n // if the given num is 0 just make sure we replace all\n if(number == 0)\n number = 999999;// max number of occurences\n\n // find how many occurences exist\n rfStringX_FromString_IN(&temp,thisstr);\n while( (bytePositions[foundN] = rfString_FindBytePos(&temp,sstr,options)) != RF_FAILURE)\n {\n int32_t move = bytePositions[foundN] + sstr->byteLength;\n bytePositions[foundN] = bytePositions[foundN]+temp.bIndex;\n temp.bIndex += move;\n temp.bytes += move;\n temp.byteLength -= move;\n foundN++;\n // if buffer is in danger of overflow realloc it\n if(foundN > bSize)\n {\n bSize *=2;\n RF_REALLOC(bytePositions,int32_t,bSize);\n }\n // if we found the required number of occurences break;\n if(foundN >= number)\n break;\n }\n rfStringX_Deinit(&temp);\n // make sure that the number of occurence to replace do not exceed the actual number of occurences\n if(number > foundN)\n number = foundN;\n // act depending on the size difference of rstr and sstr\n if(rstr->byteLength > sstr->byteLength) // replace string is bigger than the removed one\n {\n int32_t orSize,nSize;\n\n diff = rstr->byteLength - sstr->byteLength;\n // will keep the original size in bytes\n orSize = thisstr->byteLength +1;\n // reallocate the string to fit the new bigger size\n nSize= orSize + number*diff;\n RF_REALLOC(thisstr->bytes,char,nSize)\n // now replace all the substrings one by one\n for(i = 0; i < number; i ++)\n {\n // move all of the contents of the string to fit the replacement\n for(j =orSize+diff-1; j > bytePositions[i]+sstr->byteLength; j -- )\n thisstr->bytes[j] = thisstr->bytes[j-diff];\n // copy in the replacement\n strncpy(thisstr->bytes+bytePositions[i],rstr->bytes,rstr->byteLength);\n // also increase the original size (since now we moved the whole string by one replacement)\n orSize += diff;\n // also increase all the subsequent found byte positions since there is a change of string size\n for(j = i+1; j < number; j ++)\n bytePositions[j] = bytePositions[j]+diff;\n\n }\n // finally let's keep the new byte length\n thisstr->byteLength = nSize-1;\n }\n else if( rstr->byteLength < sstr->byteLength) // replace string is smaller than the removed one\n {\n // get the differenc in byte length of removed substring and replace string\n diff = sstr->byteLength-rstr->byteLength;\n\n // now replace all the substrings one by one\n for(i =0; i < number; i ++)\n {\n // copy in the replacement\n strncpy(thisstr->bytes+bytePositions[i],rstr->bytes,rstr->byteLength);\n // move all of the contents of the string to fit the replacement\n for(j =bytePositions[i]+rstr->byteLength; j < thisstr->byteLength; j ++ )\n thisstr->bytes[j] = thisstr->bytes[j+diff];\n // also decrease all the subsequent found byte positions since there is a change of string size\n for(j = i+1; j < number; j ++)\n bytePositions[j] = bytePositions[j]-diff;\n }\n // finally let's keep the new byte length\n thisstr->byteLength -= diff*number;\n // just note that reallocating downwards is not necessary\n }\n else // replace and remove strings are equal\n {\n for(i = 0; i < number; i ++)\n strncpy(thisstr->bytes+bytePositions[i],rstr->bytes,rstr->byteLength);\n }\n free(bytePositions);\n // success\n return true;\n}\n\n// Removes all characters of a substring only from the start of the String\nchar i_rfString_StripStart(void* thisstrP,void* subP)\n{\n RF_String* thisstr = (RF_String*) thisstrP;\n RF_String*sub = (RF_String*) subP;\n char ret = false,noMatch;\n uint32_t charValue,i = 0,*subValues,j,subLength,bytePos;\n\n // firstly get all of the characters of the substring in an array\n subLength = rfString_Length(sub);\n RF_MALLOC(subValues,4*subLength)\n rfString_Iterate_Start(sub,i,charValue)\n subValues[i] = charValue;\n rfString_Iterate_End(i)\n\n // iterate thisstring from the beginning\n i = 0;\n RF_STRING_ITERATE_START(thisstr,i,bytePos)\n noMatch = true;\n // for every substring character\n for(j = 0;j < subLength; j++)\n {\n // if we got a match\n if(rfString_BytePosToCodePoint(thisstr,bytePos) == subValues[j])\n {\n ret = true;\n noMatch = false;\n break;\n }\n }\n // if we get out of iterating the substring without having found a match, we get out of the iteration in general\n if(noMatch)\n break;\n RF_STRING_ITERATE_END(i,bytePos)\n\n // if we had any match\n if(ret == true)\n {\n // remove the characters\n for(i =0; i < thisstr->byteLength-bytePos+1;i++ )\n thisstr->bytes[i] = thisstr->bytes[i+bytePos];\n // also change bytelength\n thisstr->byteLength -= bytePos;\n }\n // free stuff and return\n free(subValues);\n return ret;\n}\n\n// Removes all characters of a substring starting from the end of the String\nchar i_rfString_StripEnd(void* thisstrP,void* subP)\n{\n RF_String* thisstr = (RF_String*) thisstrP;\n RF_String*sub = (RF_String*) subP;\n char ret = false,noMatch;\n uint32_t charValue,i = 0,*subValues,j,subLength,bytePos,lastBytePos,testity;\n\n // firstly get all of the characters of the substring in an array\n subLength = rfString_Length(sub);\n RF_MALLOC(subValues,4*subLength)\n rfString_Iterate_Start(sub,i,charValue)\n subValues[i] = charValue;\n rfString_Iterate_End(i)\n\n // iterate thisstring from the end\n i = 0;\n RF_STRING_ITERATEB_START(thisstr,i,bytePos)\n noMatch = true;\n // for every substring character\n for(j = 0;j < subLength; j++)\n {\n // if we got a match\n if((testity=rfString_BytePosToCodePoint(thisstr,bytePos)) == subValues[j])\n {\n ret = true;\n noMatch = false;\n lastBytePos = bytePos;\n break;\n }\n }\n // if we get out of iterating the substring without having found a match, we get out of the iteration in general\n if(noMatch)\n break;\n RF_STRING_ITERATEB_END(i,bytePos)\n\n // if we had any match\n if(ret == true)\n {\n // just set the end of string there\n thisstr->bytes[lastBytePos] = '\\0';\n // and also set the new byte length\n thisstr->byteLength -= (thisstr->byteLength - lastBytePos);\n }\n\n // free stuff and return\n free(subValues);\n return ret;\n}\n\n// Removes all characters of a substring from both ends of the given String\nchar i_rfString_Strip(void* thisstrP,void* subP)\n{\n char res1 = rfString_StripStart(thisstrP,subP);\n char res2 = rfString_StripEnd(thisstrP,subP);\n return res1|res2;\n}\n\n\n/*------------------------------------------------------------------------ RF_String File I/O functions-------------------------------------------------------------------------------*/\n\n// Allocates and returns a string from file parsing. The file's encoding must be UTF-8.If for some reason (like EOF reached) no string can be read then null is returned\nRF_String* rfString_Create_fUTF8(FILE* f, char* eof)\n{\n RF_String* ret;\n RF_MALLOC(ret,sizeof(RF_String));\n if(rfString_Init_fUTF8(ret,f,eof) < 0)\n {\n free(ret);\n return 0;\n }\n return ret;\n}\n// Initializes a string from file parsing. The file's encoding must be UTF-8.If for some reason (like EOF reached) no string can be read then null is returned\nint32_t rfString_Init_fUTF8(RF_String* str,FILE* f,char* eof)\n{\n int32_t bytesN;\n uint32_t bufferSize;// unused\n if((bytesN=rfFReadLine_UTF8(f,&str->bytes,&str->byteLength,&bufferSize,eof)) < 0)\n {\n LOG_ERROR(\"Failed to initialize String from a UTF-8 file\",bytesN);\n return bytesN;\n }\n // success\n return bytesN;\n}\n// Assigns to a String from UTF-8 file parsing\nint32_t rfString_Assign_fUTF8(RF_String* str,FILE*f,char* eof)\n{\n int32_t bytesN;\n uint32_t utf8ByteLength,utf8BufferSize;// bufferSize unused in this function\n char* utf8 = 0;\n if((bytesN=rfFReadLine_UTF8(f,&utf8,&utf8ByteLength,&utf8BufferSize,eof)) < 0)\n {\n LOG_ERROR(\"Failed to assign the contents of a UTF-8 file to a String\",bytesN);\n return bytesN;\n }\n // success\n // assign it to the string\n if(str->byteLength <= utf8ByteLength)\n {\n RF_REALLOC(str->bytes,char,utf8ByteLength+1);\n }\n memcpy(str->bytes,utf8,utf8ByteLength+1);\n str->byteLength = utf8ByteLength;\n // free the file's utf8 buffer\n free(utf8);\n return bytesN;\n}\n// Appends to a String from UTF-8 file parsing\nint32_t rfString_Append_fUTF8(RF_String* str,FILE*f,char* eof)\n{\n int32_t bytesN;\n uint32_t utf8ByteLength,utf8BufferSize;// bufferSize unused in this function\n char* utf8 = 0;\n if((bytesN=rfFReadLine_UTF8(f,&utf8,&utf8ByteLength,&utf8BufferSize,eof)) < 0)\n {\n LOG_ERROR(\"Failed to assign the contents of a UTF-8 file to a String\",bytesN);\n return bytesN;\n }\n // append the utf8 to the given string\n rfString_Append(str,RFS_(utf8));\n // free the file's utf8 buffer\n free(utf8);\n return bytesN;\n}\n\n// Allocates and returns a string from file parsing. The file's encoding must be UTF-16.If for some reason (like EOF reached) no string can be read then null is returned. A check for a valid sequence of bytes is performed.\nRF_String* rfString_Create_fUTF16(FILE* f,char endianess,char* eof)\n{\n RF_String* ret;\n RF_MALLOC(ret,sizeof(RF_String));\n if(rfString_Init_fUTF16(ret,f,endianess,eof) < 0)\n return 0;\n return ret;\n}\n// Initializes a string from file parsing. The file's encoding must be UTF-16.If for some reason (like EOF reached) no string can be read then null is returned. A check for a valid sequence of bytes is performed.\nint32_t rfString_Init_fUTF16(RF_String* str,FILE* f, char endianess,char* eof)\n{\n int32_t bytesN;\n // depending on the file's endianess\n if(endianess == RF_LITTLE_ENDIAN)\n {\n if((bytesN=rfFReadLine_UTF16LE(f,&str->bytes,&str->byteLength,eof)) < 0)\n {\n LOG_ERROR(\"Failure to initialize a String from reading a UTF-16 file\",bytesN);\n return bytesN;\n }\n }// end of little endian\n else// big endian\n {\n if((bytesN=rfFReadLine_UTF16BE(f,&str->bytes,&str->byteLength,eof)) < 0)\n {\n LOG_ERROR(\"Failure to initialize a String from reading a UTF-16 file\",bytesN);\n return bytesN;\n }\n }// end of big endian case\n // success\n return bytesN;\n}\n\n// Assigns to an already initialized String from File parsing\nint32_t rfString_Assign_fUTF16(RF_String* str,FILE* f, char endianess,char* eof)\n{\n\n uint32_t utf8ByteLength;\n int32_t bytesN;\n char* utf8 = 0;\n // depending on the file's endianess\n if(endianess == RF_LITTLE_ENDIAN)\n {\n if((bytesN=rfFReadLine_UTF16LE(f,&utf8,&utf8ByteLength,eof)) < 0)\n {\n LOG_ERROR(\"Failure to assign the contents of a Little Endian UTF-16 file to a String\",bytesN);\n return bytesN;\n }\n }// end of little endian\n else// big endian\n {\n if((bytesN=rfFReadLine_UTF16BE(f,&utf8,&utf8ByteLength,eof)) < 0)\n {\n LOG_ERROR(\"Failure to assign the contents of a Big Endian UTF-16 file to a String\",bytesN);\n return bytesN;\n }\n }// end of big endian case\n // success\n // assign it to the string\n if(str->byteLength <= utf8ByteLength)\n {\n RF_REALLOC(str->bytes,char,utf8ByteLength+1);\n }\n memcpy(str->bytes,utf8,utf8ByteLength+1);\n str->byteLength = utf8ByteLength;\n // free the file's utf8 buffer\n free(utf8);\n return bytesN;\n}\n\n// Appends to an already initialized String from File parsing\nint32_t rfString_Append_fUTF16(RF_String* str,FILE* f, char endianess,char* eof)\n{\n char*utf8;\n uint32_t utf8ByteLength;\n int32_t bytesN;\n // depending on the file's endianess\n if(endianess == RF_LITTLE_ENDIAN)\n {\n if((bytesN=rfFReadLine_UTF16LE(f,&utf8,&utf8ByteLength,eof)) < 0)\n {\n LOG_ERROR(\"Failure to append the contents of a Little Endian UTF-16 file to a String\",bytesN);\n return bytesN;\n }\n }// end of little endian\n else// big endian\n {\n if((bytesN=rfFReadLine_UTF16BE(f,&utf8,&utf8ByteLength,eof)) < 0)\n {\n LOG_ERROR(\"Failure to append the contents of a Big Endian UTF-16 file to a String\",bytesN);\n return bytesN;\n }\n }// end of big endian case\n // success\n rfString_Append(str,RFS_(utf8));\n free(utf8);\n return bytesN;\n}\n\n// Allocates and returns a string from file parsing. The file's encoding must be UTF-32.If for some reason (like EOF reached) no string can be read then null is returned. A check for a valid sequence of bytes is performed.\nRF_String* rfString_Create_fUTF32(FILE* f,char endianess,char* eof)\n{\n RF_String* ret;\n RF_MALLOC(ret,sizeof(RF_String));\n if(rfString_Init_fUTF32(ret,f,endianess,eof) < 0)\n {\n free(ret);\n return 0;\n }\n return ret;\n}\n// Initializes a string from file parsing. The file's encoding must be UTF-32.If for some reason (like EOF reached) no string can be read then null is returned. A check for a valid sequence of bytes is performed.\nint32_t rfString_Init_fUTF32(RF_String* str,FILE* f,char endianess,char* eof)\n{\n int32_t bytesN;\n // depending on the file's endianess\n if(endianess == RF_LITTLE_ENDIAN)\n {\n if((bytesN=rfFReadLine_UTF32LE(f,&str->bytes,&str->byteLength,eof)) <0)\n {\n LOG_ERROR(\"Failure to initialize a String from reading a Little Endian UTF-32 file\",bytesN);\n return bytesN;\n }\n }// end of little endian\n else// big endian\n {\n if((bytesN=rfFReadLine_UTF16BE(f,&str->bytes,&str->byteLength,eof)) < 0)\n {\n LOG_ERROR(\"Failure to initialize a String from reading a Big Endian UTF-32 file\",bytesN);\n return bytesN;\n }\n }// end of big endian case\n // success\n return bytesN;\n}\n// Assigns the contents of a UTF-32 file to a string\nint32_t rfString_Assign_fUTF32(RF_String* str,FILE* f,char endianess, char* eof)\n{\n int32_t bytesN;\n char*utf8;\n uint32_t utf8ByteLength;\n // depending on the file's endianess\n if(endianess == RF_LITTLE_ENDIAN)\n {\n if((bytesN=rfFReadLine_UTF32LE(f,&utf8,&utf8ByteLength,eof)) < 0)\n {\n LOG_ERROR(\"Failure to assign to a String from reading a Little Endian UTF-32 file\",bytesN);\n return bytesN;\n }\n }// end of little endian\n else// big endian\n {\n if((bytesN=rfFReadLine_UTF16BE(f,&utf8,&utf8ByteLength,eof)) < 0)\n {\n LOG_ERROR(\"Failure to assign to a String from reading a Big Endian UTF-32 file\",bytesN);\n return bytesN;\n }\n }// end of big endian case\n // success\n // assign it to the string\n if(str->byteLength <= utf8ByteLength)\n {\n RF_REALLOC(str->bytes,char,utf8ByteLength+1);\n }\n memcpy(str->bytes,utf8,utf8ByteLength+1);\n str->byteLength = utf8ByteLength;\n // free the file's utf8 buffer\n free(utf8);\n return bytesN;\n}\n// Appends the contents of a UTF-32 file to a string\nint32_t rfString_Append_fUTF32(RF_String* str,FILE* f,char endianess, char* eof)\n{\n int32_t bytesN;\n char*utf8;\n uint32_t utf8ByteLength;\n // depending on the file's endianess\n if(endianess == RF_LITTLE_ENDIAN)\n {\n if((bytesN=rfFReadLine_UTF32LE(f,&utf8,&utf8ByteLength,eof)) < 0)\n {\n LOG_ERROR(\"Failure to append to a String from reading a Little Endian UTF-32 file\",bytesN);\n return bytesN;\n }\n }// end of little endian\n else// big endian\n {\n if((bytesN=rfFReadLine_UTF16BE(f,&utf8,&utf8ByteLength,eof)) < 0)\n {\n LOG_ERROR(\"Failure to append to a String from reading a Big Endian UTF-32 file\",bytesN);\n return bytesN;\n }\n }// end of big endian case\n // success\n // append it\n rfString_Append(str,RFS_(utf8));\n // free the file'sutf8 buffer\n free(utf8);\n return bytesN;\n}\n\n// Writes a string to a file in UTF-8 encoding.\nint32_t i_rfString_Fwrite(void* sP,FILE* f,char* encodingP)\n{\n uint32_t *utf32,length,i;\n uint16_t* utf16;\n RF_String* s = (RF_String*)sP;\n char encoding = *encodingP;\n // depending on the encoding\n switch(encoding)\n {\n case RF_UTF8:\n if(fwrite(s->bytes,1,s->byteLength,f) != s->byteLength)\n break;// and go to error logging\n return RF_SUCCESS;\n break;\n case RF_UTF16_LE:\n utf16 = rfString_ToUTF16(s,&length);\n if(rfUTILS_Endianess() != RF_LITTLE_ENDIAN)\n {\n for(i=0;i\n\n#ifdef RF_MODULE_STRINGS// check if the strings are included as a module\n\n#include \n#include \n\n#include // for the argument count\n#include // for the local memory function wrapping functionality\n#include // for unicode\n\n\n#ifdef __cplusplus\nextern \"C\"\n{// opening bracket for calling from C++\n#endif\n\n// An option for some string functions. Means that the case should not be exactly matched in the string replacing,finding e.t.c.\n#define RF_CASE_IGNORE 0x1\n// An options for some string functions. Means that the exact string should be found/replaced e.t.c.\n#define RF_MATCH_WORD 0x2\n\n\n// Denotes that a requested character/byte index in an RF_String is out of bounds\n#define RF_STRING_INDEX_OUT_OF_BOUNDS ((uint32_t)0xFF0FFFF)\n\n/* These are here so that the iteration macros can work*/\n\n// Checks if a given byte is a continuation byte\n#define rfUTF8_IsContinuationByte2(b__) ( b__ >= 0x80 && b__<= 0xBF )\n\n#pragma pack(push,1)\n/**\n** @internal\n** @author Lefteris\n** @date 09/12/2010\n** @endinternal\n** @brief A unicode String with UTF-8 internal representation\n**\n** The Refu String is a Unicode String that has two versions. One is this and for the other check @ref RF_StringX to see what operations can be performed on extended Strings.\n** Functions to convert to and from all UTF encoding exists but the internal representation is always at UTF-8. Once a\n** a String has been created it is always assumed that the stream of bytes inside it is valid UTF-8 since every function\n** performs a UTF-8 check unless otherwise specified.\n**\n** All the functions which have @isinherited{StringX} on their description can be used with extended strings safely, since no specific\n** version of the function exists, or needs to exist to manipulate Extended Strings. To make the documentation even clearer the functions that should not\n** be used with the extended string are marked with @notinherited{StringX}\n** @internal\n** @cppcode\n** //default constructor\n** String(){this->i_StringCHandle = rfString_Create(\"\");}\n** @endcpp\n** @endinternal\n*/\ntypedef struct RF_String\n{\n // The string's data\n char* bytes;\n // The string's length in bytes (not including the null termination). The string keeps its length in bytes\n // to avoid multiple calls to strlen()\n uint32_t byteLength;\n}RF_String;\n#pragma pack(pop)\n\n\n// @memberof RF_String\n// @brief Create a termporary String from a String literal\n//\n// A macro to be used only inside a function call that accepts an @ref RF_String to create a Temporary RF_String*\n// that will be used by the function. This macro accepts from 1 to N arguments.\n//\n// The first argument shall either be a String literal or a printf styled string literal\n// given in the source file's encoding(default is UTF-8). For other encodings look at the compile time\n// option @c RF_OPTION_SOURCE_ENCODING that can be provided during building the library, but it is\n// @b strongly recommended to use UTF-8 encoded source files.\n//\n// Optionally the first argument can be followed by a sequence of additional arguments,\n// each containing one value to be inserted instead of each %-tag specified in the string literal\n// parameter, if any. There should be\n// the same number of these arguments as the number of %-tags that expect a value.\n// Basically the usage is the same as @ref rfString_Create\n//\n// @param s The formatted string that will constitute the RF_String. Must be in the same encoding as that of the source file.\n// Default is UTF-8.\n// @param ... \\rfoptional{nothing} Depending on the string literal, the function may expect a sequence of additional arguments,\n// each containing one value to be inserted instead of each %-tag specified in the @c slit parameter, if any. There should be\n// the same number of these arguments as the number of %-tags that expect a value.\n// @return Returns true in case of correct initialization and false , due to invalid byte sequence for the given encoding\n// @isinherited{StringX}\n#ifdef RF_IAMHERE_FOR_DOXYGEN\nRF_String* RFS_(const char* s,...);\n#else\n#define RFS_(...) i_rfString_CreateLocal(__VA_ARGS__)\n#endif\n\n\n\n/*-------------------------------------------------------------------------Methods to create an RF_String-------------------------------------------------------------------------------*/\n// @name Creating an RF_String\n// @{\n\n\n// @memberof RF_String\n// @opassign\n// @brief Allocates and returns a string with the given characters\n//\n// Given characters have to be in UTF-8. A check for valid sequence of bytes is performed. @notinherited{StringX}\n// @param s The sequence of bytes for the characters in UTF-8 (the default). Can also follow a printf-like format which will be formatted with\n// the variables that follow it. A check to see if it is a valid UTF-8 sequence is performed\n// @param ... \\rfoptional{nothing} Depending on the string literal, the function may expect a sequence of additional arguments,\n// each containing one value to be inserted instead of each %-tag specified in the @c slit parameter, if any. There should be\n// the same number of these arguments as the number of %-tags that expect a value.\n// @return Returns the initialized RF_string or null in case of failure to initialize, due to invalid utf-8 sequence\n#ifndef RF_OPTION_DEFAULT_ARGUMENTS\ni_DECLIMEX_ RF_String* rfString_Create(const char* s,...);\n#else\ni_DECLIMEX_ RF_String* i_rfString_Create(const char* s,...);\ni_DECLIMEX_ RF_String* i_NVrfString_Create(const char* s);\n#define rfString_Create(...) RP_SELECT_FUNC_IF_NARGIS(i_SELECT_RF_STRING_CREATE,1,__VA_ARGS__)\n#define i_SELECT_RF_STRING_CREATE1(...) i_NVrfString_Create(__VA_ARGS__)\n#define i_SELECT_RF_STRING_CREATE0(...) i_rfString_Create(__VA_ARGS__)\n#endif\n\n///Internal function that creates a temporary RF_String*\ni_DECLIMEX_ RF_String* i_rfString_CreateLocal1(const char* s,...);\ni_DECLIMEX_ RF_String* i_NVrfString_CreateLocal(const char* s);\n#define i_rfString_CreateLocal(...) RP_SELECT_FUNC_IF_NARGIS(i_SELECT_RF_STRING_CREATELOCAL,1,__VA_ARGS__)\n#define i_SELECT_RF_STRING_CREATELOCAL1(...) i_NVrfString_CreateLocal(__VA_ARGS__)\n#define i_SELECT_RF_STRING_CREATELOCAL0(...) i_rfString_CreateLocal1(__VA_ARGS__)\n\n\n// @memberof RF_String\n// @brief Initializes a string with the given characters.\n//\n// @notinherited{StringX}\n// Given characters have to be in UTF-8. A check for valide sequence of bytes is performed.\n// @param str The string to initialize\n// @param s The sequence of bytes for the characters in UTF-8 (the default).Can also follow a printf-like format which will be formatted with\n// the variables that follow it. A check to see if it is a valid UTF-8 sequence is performed\n// @param ... \\rfoptional{nothing} Depending on the string literal, the function may expect a sequence of additional arguments,\n// each containing one value to be inserted instead of each %-tag specified in the @c slit parameter, if any. There should be\n// the same number of these arguments as the number of %-tags that expect a value.\n// @return Returns true in case of correct initialization and false , due to invalid utf-8 sequence\n#ifndef RF_OPTION_DEFAULT_ARGUMENTS\ni_DECLIMEX_ char rfString_Init(RF_String* str,const char* s,...);\n#else\ni_DECLIMEX_ char i_rfString_Init(RF_String* str,const char* s,...);\ni_DECLIMEX_ char i_NVrfString_Init(RF_String* str,const char* s);\n#define rfString_Init(...) RP_SELECT_FUNC_IF_NARGIS(i_SELECT_RF_STRING_INIT,2,__VA_ARGS__)\n#define i_SELECT_RF_STRING_INIT1(...) i_NVrfString_Init(__VA_ARGS__)\n#define i_SELECT_RF_STRING_INIT0(...) i_rfString_Init(__VA_ARGS__)\n#endif\n\n// @memberof RF_String\n// @cppnotctor\n// @brief Allocates a String by turning a unicode code point in a String (encoded in UTF-8).\n//\n// @notinherited{StringX}\n// @param code The unicode code point to encode\n// @return A String with the code point encoded in it or a null pointer in case of an illegal code point value\ni_DECLIMEX_ RF_String* rfString_Create_cp(uint32_t code);\n// @memberof RF_String\n// @brief Initializes a string by turning a unicode code point in a String (encoded in UTF-8).\n//\n// @notinherited{StringX}\n// @param str The string to initialize\n// @param code The unicode code point to encode\n// @return Returns true in case of correct initialization and false , due to illegal code point value\ni_DECLIMEX_ char rfString_Init_cp(RF_String* str,uint32_t code);\n\n\n#ifndef RF_OPTION_DEFAULT_ARGUMENTS\n// @memberof RF_String\n// @cppnotctor\n// @brief Allocates and returns a string with the given characters with no checking.\n//\n// @notinherited{StringX}\n// @warning NO VALID-UTF8 check is performed.\n// @param s The sequence of bytes for the characters in UTF-8 (the default).Can also follow a printf-like format which will be formatted with\n// the variables that follow it. No check for valid bytestream is performed\n// @param ... \\rfoptional{nothing} Depending on the string literal, the function may expect a sequence of additional arguments,\n// each containing one value to be inserted instead of each %-tag specified in the @c slit parameter, if any. There should be\n// the same number of these arguments as the number of %-tags that expect a value.\n// @return Returns the initialized RF_string or null in case of failure to initialize\ni_DECLIMEX_ RF_String* rfString_Create_nc(const char* s,...);\n#else\ni_DECLIMEX_ RF_String* i_rfString_Create_nc(const char* s,...);\ni_DECLIMEX_ RF_String* i_NVrfString_Create_nc(const char* s);\n#define rfString_Create_nc(...) RP_SELECT_FUNC_IF_NARGIS(i_SELECT_RF_STRING_CREATE_NC,1,__VA_ARGS__)\n#define i_SELECT_RF_STRING_CREATE_NC1(...) i_NVrfString_Create_nc(__VA_ARGS__)\n#define i_SELECT_RF_STRING_CREATE_NC0(...) i_rfString_Create_nc(__VA_ARGS__)\n#endif\n\n#ifndef RF_OPTION_DEFAULT_ARGUMENTS\n// @memberof RF_String\n// @brief Initializes a string with the given characters with no checking\n//\n// @notinherited{StringX}\n// @warning NO VALID-UTF8 check is performed.\n// @param str The string to initialize\n// @param s The sequence of bytes for the characters in UTF-8 (the default).Can also follow a printf-like format which will be formatted with\n// the variables that follow it. No check for valid bytestream is performed\n// @param ... \\rfoptional{nothing} Depending on the string literal, the function may expect a sequence of additional arguments,\n// each containing one value to be inserted instead of each %-tag specified in the @c slit parameter, if any. There should be\n// the same number of these arguments as the number of %-tags that expect a value.\n// @return Returns true in case of correct initialization and false otherwise\ni_DECLIMEX_ char rfString_Init_nc(RF_String* str,const char* s,...);\n#else\ni_DECLIMEX_ char i_rfString_Init_nc(RF_String* str,const char* s,...);\ni_DECLIMEX_ char i_NVrfString_Init_nc(RF_String* str,const char* s);\n#define rfString_Init_nc(...) RP_SELECT_FUNC_IF_NARGIS(i_SELECT_RF_STRING_INIT_NC,2,__VA_ARGS__)\n#define i_SELECT_RF_STRING_INIT_NC1(...) i_NVrfString_Init_nc(__VA_ARGS__)\n#define i_SELECT_RF_STRING_INIT_NC0(...) i_rfString_Init_nc(__VA_ARGS__)\n#endif\n\n// @memberof RF_String\n// @opassign\n// @brief Allocates and returns a string with the given integer.\n//\n// @notinherited{StringX}\n// @param i The integer to turn into a string\n// @return Returns the initialized RF_string\ni_DECLIMEX_ RF_String* rfString_Create_i(int32_t i);\n// @memberof RF_String\n// @brief Initializes a string with the given integer.\n//\n// @notinherited{StringX}\n// @param str The string to initialize\n// @param i The integer to turn into a string\n// @return Returns true in case of correct initialization and false otherwise\ni_DECLIMEX_ char rfString_Init_i(RF_String* str,int32_t i);\n// @memberof RF_String\n// @opassign\n// @brief Allocates and returns a string with the given float.\n//\n// @notinherited{StringX}\n// @param f The float to turn into a string\n// @return Returns the initialized RF_string\ni_DECLIMEX_ RF_String* rfString_Create_f(float f);\n// @memberof RF_String\n// @brief Initializes a string with the given float.\n//\n// @notinherited{StringX}\n// @param str The string to initialize\n// @param f The float to turn into a string\n// @return Returns true in case of correct initialization and false otherwise\ni_DECLIMEX_ char rfString_Init_f(RF_String* str,float f);\n\n// @memberof RF_String\n// @brief Allocates and returns a string with the given UTF-16 byte sequence.\n//\n// @notinherited{StringX}\n// Given characters have to be in UTF-16\n// @param s The sequence of bytes for the characters in UTF-16.\n// @param endianess A flag that determined in what endianess the sequence of UTF-16 bytes is in. Possible values here is\n// @c RF_LITTLE_ENDIAN and @c RF_BIG_ENDIAN.\n// @return Returns the initialized RF_string or null in case of failure to initialize, due to invalid utf-16 sequence or illegal endianess value\ni_DECLIMEX_ RF_String* rfString_Create_UTF16(const char* s,char endianess);\n// @memberof RF_String\n// @brief Initializes a string with the given UTF-16 byte sequence.\n//\n// @notinherited{StringX}\n// Given characters have to be in UTF-16\n// @param str The string to initialize\n// @param s The sequence of bytes for the characters in UTF-16.\n// @param endianess A flag that determined in what endianess the sequence of UTF-16 bytes is in. Possible values here is\n// @c RF_LITTLE_ENDIAN and @c RF_BIG_ENDIAN.\n// @return Returns true for succesfull initialization and false otherwise due to invalid utf-16 sequence or illegal endianess value\ni_DECLIMEX_ char rfString_Init_UTF16(RF_String* str,const char* s,char endianess);\n\n// @memberof RF_String\n// @cppnotctor\n// @brief Allocates and returns a string with the given UTF-32 byte sequence.\n//\n// @notinherited{StringX}\n// Given characters have to be in UTF-32\n// @param s The sequence of bytes for the characters in UTF-32. Needs to be null terminated.\n// @return Returns the initialized RF_string or null in case of failure to initialize\ni_DECLIMEX_ RF_String* rfString_Create_UTF32(const char* s);\n// @memberof RF_String\n// @brief Initializes a string with the given UTF-32 byte sequence.\n//\n// @notinherited{StringX}\n// Given characters have to be in UTF-32\n// @param str The string to initialize\n// @param s The sequence of bytes for the characters in UTF-32. Needs to be null terminated.\n// @return Returns true for successful initialization and false otherwise\ni_DECLIMEX_ char rfString_Init_UTF32(RF_String* str,const char* s);\n//@}\n\n/*-------------------------------------------------------------------------Methods to copy/assign an RF_String-------------------------------------------------------------------------------*/\n// @name Copying - Assigning a String\n// @{\n\n// @memberof RF_String\n// @brief Assigns the value of the source string to the destination.\n//\n// @notinherited{StringX}\n// @lmsFunction\n// Both strings should already be initialized and hold a value. It is an error to give null parameters.\n// @param dest The destination string, which should get assigned\n// @param source The source string, whose values to copy. @inhtype{String,StringX} @tmpSTR\n#if defined(RF_IAMHERE_FOR_DOXYGEN)\nvoid rfString_Assign(RF_String* dest,void* source);\n#else\ni_DECLIMEX_ void i_rfString_Assign(RF_String* dest,void* source);\n#define rfString_Assign(i_DESTINATION_,i_SOURCE_) i_rfLMS_WRAP2(void,i_rfString_Assign,i_DESTINATION_,i_SOURCE_)\n#endif\n\n// @memberof RF_String\n// @brief Assigns the value of a unicode character to the string\n//\n// @notinherited{StringX}\n// @param thisstr The string to assign to\n// @param character The unicode character codepoint to assign to the String\n// @return Returns @c true for succesfull assignment and @c false if the given @c character was not a valid unicode codepoint\ni_DECLIMEX_ char rfString_Assign_char(RF_String* thisstr,uint32_t character);\n\n// @}\n/*-------------------------------------------------------------------------Methods to get rid of an RF_String-------------------------------------------------------------------------------*/\n// @name Getting rid of an RF_String\n// @{\n\n// @memberof RF_String\n// @cppignore\n// @brief Deletes a string object and also frees its pointer.\n//\n// @notinherited{StringX}\n// It is an error to give a NULL(0x0) string for deleting. Will most probably lead to a segmentation fault\n// Use it for strings made with _Create\n// @param s The string for deletion\ni_DECLIMEX_ void rfString_Destroy(RF_String* s);\n// @memberof RF_String\n// @cppignore\n// @brief Deletes a string object only, not its memory.\n//\n// @notinherited{StringX}\n// It is an error to give a NULL(0x0) string for deleting. Will most probably lead to a segmentation fault\n// Use it for strings made with _Init\n// @param s The string for deletion\ni_DECLIMEX_ void rfString_Deinit(RF_String* s);\n\n\n// @}\n/*------------------------------------------------------------------------ RF_String unicode conversion-------------------------------------------------------------------------------*/\n// @name Unicode Conversion Functions\n// @{\n\n// @memberof RF_String\n// @brief Returns the strings contents as a UTF-8 buffer\n//\n// @isinherited{StringX}\n// This is just a macro wrapper of @ref rfString_ToStr() and exists here\n// just so that users can guess function names for all unicode encodings.\n//\n// Note that just like in @ref rfString_ToStr() this is just a pointer to\n// the String's internal UTF8 buffer and as such should be read only. If there\n// is a need to do anything other than that copy the buffer.\n// @param s The string in question\n// @return Returns a pointer to the String's internal UTF-8 uffer\n#if defined(RF_IAMHERE_FOR_DOXYGEN)\ni_DECLIMEX_ const char* rfString_ToUTF8(RF_String* s);\n#else\n#define rfString_ToUTF8(i_STRING_) rfString_ToCstr(i_STRING_)\n#endif\n\n// @memberof RF_String\n// @brief Returns the strings contents as a UTF-16 buffer\n//\n// @isinherited{StringX}\n// This function allocates a UTF-16 buffer in which the string's\n// UTF-8 contents are encoded as UTF-16. The endianess of the buffer\n// is that of the system. The returned buffer needs to be freed by the user\n// later.\n// @param[in] s The string in question\n// @param[out] length Give a reference to a uint32_t in this argument to receive the length of\n// the returned UTF-16 buffer in 16-bit words\n// @return Returns an allocated UTF-16 buffer. Needs to be freed by the user later.\ni_DECLIMEX_ uint16_t* rfString_ToUTF16(RF_String* s,uint32_t* length);\n\n// @memberof RF_String\n// @brief Returns the strings contents as a UTF-32 buffer\n//\n// @isinherited{StringX}\n// This function allocates a UTF-32 buffer in which the string's\n// UTF-8 contents are encoded as UTF-32. The endianess of the buffer\n// is that of the system. The returned buffer needs to be freed by the user\n// later.\n// @param[in] s The string in question\n// @param[out] length Give a reference to a uint32_t in this argument to receive the length\n// of the returned UTF-32 buffer in codepoints. (32-bit) words\n// @return Returns an allocated UTF-16 buffer. Needs to be freed by the user later.\ni_DECLIMEX_ uint32_t* rfString_ToUTF32(RF_String* s,uint32_t*length);\n\n// @}\n/*------------------------------------------------------------------------ RF_String retrieval functions-------------------------------------------------------------------------------*/\n// @name String Retrieval\n// @{\n\n\n\n //-- String iteration --/ /\n\n// Two macros to accomplish iteration of an RF_String from any given character going forwards. This macro should be used with its end pair.\n// We take advantage of the fact that an RF_String is always guaranteed to contain a valid UTF-8 sequence and thus no checks are performed.\n/**\n** @memberof RF_String\n** @cppignore\n** @brief Starts an RF_String forward iteration scope.\n**\n** @isinherited{StringX}\n** Use this macro to iterate every character inside an RF_String or RF_StringX\\n\n** Must be used with its pair macro #rfString_Iterate_End.\\n\n** As an example consider this code that iterates every character of a string from the start to finish\n** @code\n** uint32_t i = 0;\n** uint32_t charValue;\n** RF_String foo;rfString_Init(&foo,\"I am a String\");\n** rfString_Iterate_Start(&foo,i,charValue)\n** //for every character in the string,let's print it\n** printf(\"Character at index %d is %c\\n\",i,charValue);\n** rfString_Iterate_End(i)\n** @endcode\n** @param[in] string_ The string to iterate. Must be a pointer to string\n** @param[in,out] startCharacterPos_ Here give an uint32_t which will be the character position from which to start the iteration. In each iteration this will hold the character index. If the given position is out of bounds then the iteration does not happen\n** @param[in,out] characterUnicodeValue_ Here pass an uint32_t which in each iteration will hold the unicode code point of the character at position startCharacterPos_\n**/\n#define rfString_Iterate_Start(string_,startCharacterPos_,characterUnicodeValue_) {\\\n /* b index sec is the byte index and j the character index*/\\\n uint32_t byteIndex_ = 0;uint32_t j_=0;\\\n /*iterate until we find the character position requested and its equivalent byte position*/\\\n while(j_!=startCharacterPos_)\\\n {\\\n if( rfUTF8_IsContinuationByte( (string_)->bytes[byteIndex_]) ==false)\\\n {\\\n j_++;\\\n }\\\n byteIndex_++;\\\n }\\\n /*now start the requested iteration*/\\\n while( (string_)->bytes[byteIndex_]!='\\0')\\\n {\\\n /*if it's a character*/\\\n if( rfUTF8_IsContinuationByte( (string_)->bytes[byteIndex_]) ==false)\\\n {/*Give the character value to the user*/\\\n characterUnicodeValue_ = rfString_BytePosToCodePoint( (string_),byteIndex_);\n\n// @memberof RF_String\n// @cppignore\n// @brief Ends an RF_String/RF_StringX forward iteration scope.\n//\n// @isinherited{StringX}\n// Look at #rfString_Iterate_Start for an example usage\n// @param[in,out] startCharacterPos_ Here give the uint32_t given to #rfString_Iterate_Start\n#define rfString_Iterate_End(startCharacterPos_) startCharacterPos_++;}byteIndex_++;}}\n\n//Two macros to accomplish iteration of an RF_String from any given character going backwards. This macro should be used with its end pair.\n// We take advantage of the fact that an RF_String is always guaranteed to contain a valid UTF-8 sequence and thus no checks are performed.\n\n/**\n** @memberof RF_String\n** @cppignore\n** @brief Starts an RF_String backward iteration scope.\n**\n** @isinherited{StringX}\n** Use this macro to iterate every character inside an RF_String or RF_StringX going backwards\\n\n** Must be used with its pair macro #rfString_IterateB_End.\\n\n**\n** As an example consider this code that iterates every character of a string from the start to finish\n** @code\n** uint32_t charValue;\n** RF_String foo;rfString_Init(&foo,\"I am a String\");\n** uint32_t i = rfString_Length(&foo);\n** rfString_IterateB_Start(&foo,i,charValue)\n** //for every character in the string,let's print it\n** printf(\"Character at index %d is %c\\n\",i,charValue);\n** rfString_IterateB_End(i)\n** @endcode\n** @param[in] string_ The string to iterate. Must be a pointer to string\n** @param[in,out] characterPos_ Here give an uint32_t which will be the character position from which to start the iteration. In each iteration this will hold the character index. If the given position is out of bounds then the iteration does not happen\n** @param[in,out] characterUnicodeValue_ Here pass an uint32_t which in each iteration will hold the unicode code point of the character at position characterPos_\n**/\n#define rfString_IterateB_Start(string_,characterPos_,characterUnicodeValue_) {\\\n /* b index is the byte index and j the character index*/\\\n uint32_t b_index_ = 0;uint32_t j_=0;\\\n /* c index sec is another signed copy of the character index (and is int64_t so that it can cater for any situation). Reason is cause going backwards we gotta have -1 too */\\\n int64_t c_index_ = characterPos_;\\\n /*iterate until we find the character position requested and its equivalent byte position*/\\\n while(j_!=characterPos_)\\\n {\\\n if( rfUTF8_IsContinuationByte( (string_)->bytes[b_index_]) ==false)\\\n {\\\n j_++;\\\n }\\\n b_index_++;\\\n }\\\n /*now start the requested iteration - notice that the end condition is to reach the first character position*/\\\n while(c_index_!=-1)\\\n {\\\n /*if it's a character*/\\\n if( rfUTF8_IsContinuationByte( (string_)->bytes[b_index_]) ==false)\\\n {/*Give the character value to the user*/\\\n characterUnicodeValue_ = rfString_BytePosToCodePoint( (string_),b_index_);\n\n// @memberof RF_String\n// @cppignore\n// @brief Ends an RF_String/RF_StringX backward iteration scope.\n//\n// @isinherited{StringX}\n// Look at #rfString_IterateB_Start for an example usage\n// @param[in,out] characterPos_ Here give the uint32_t given to #rfString_IterateB_Start\n#define rfString_IterateB_End(characterPos_) c_index_-- ;characterPos_--;}b_index_--;}}\n\n// @memberof RF_String\n// @brief Finds the length of the string in characters.\n//\n// @isinherited{StringX}\n// @param s The string whose number of characters to find. @inhtype{String,StringX}\n// @return Returns the length of the sting in characters, not including the null termintion character\ni_DECLIMEX_ uint32_t rfString_Length(void * s);\n\n// @memberof RF_String\n// @brief Retrieves the unicode code point of the parameter character.\n//\n// @isinherited{StringX}\n// If the character position is out of bounds RF_STRING_INDEX_OUT_OF_BOUNDS is returned.\n// @param thisstr The string whose character code point we need. @inhtype{String,StringX}\n// @param c The character index whose unicode code point to return. Must be a positive (including zero) integer.\n// @return Returns the code point as an uint32_t or the value RF_STRING_INDEX_OUT_OF_BOUNDS if the requested character index is out of bounds\ni_DECLIMEX_ uint32_t rfString_GetChar(void* thisstr,uint32_t c);\n\n// @internal\n// @memberof RF_String\n// @cppignore\n// @brief Retrieves the unicode code point of the parameter bytepos of the string.\n//\n// @isinherited{StringX}\n// This is an internal function, there is no need to use it. The reason it is exposed here is that it is utilized in the iteration macros.\n// @warning DO NOT use this function unless you know what you are doing\n// @param thisstr The string whose byte position code point we need. @inhtype{String,StringX}\n// @param bytepos The byte position of the string from where to get the code point.\n// @warning If this is out of bounds then nothing can detect it and at best it will cause a SEG FAULT.\n// Moreover no check to see if this is not a continutation byte is made. All the checks must have been made before calling the function.\n// @return Returns the code point of the byte position as an uint32_t\n// @endinternal\ni_DECLIMEX_ uint32_t rfString_BytePosToCodePoint(void* thisstr,uint32_t bytepos);\n\n// @internal\n// @memberof RF_String\n// @cppignore\n// @brief Retrieves character position of a byte position\n//\n// @isinherited{StringX}\n// This is an internal function, there is no need to use it. It attempts to retrieve character position from a byte position. If the byte\n// position is a continutation byte and does not constitute the start of a character then depending on the option the function will find\n// either the next character or the previous character position from this byte position\n//\n// @warning DO NOT use this function unless you know what you are doing\n// @param thisstr The string whose byte position code point we need. @inhtype{String,StringX}\n// @param bytepos The byte position of the string from where to get the character position\n// @param before A boolean flag denoting the behaviour in case this byte position is a continutation byte. If @c before is true then\n// the function will retrieve the first character position before the byte. If it is false, it will retrieve the first character position\n// after the continuation byte.\n// @endinternal\ni_DECLIMEX_ uint32_t rfString_BytePosToCharPos(void* thisstr,uint32_t bytepos,char before);\n\n// @memberof RF_String\n// @opcmpeq\n// @brief Compares two Strings and returns true if they are equal and false otherwise\n//\n// @isinherited{StringX}\n// A macro comparing two String and returning true if they are equal and false otherwise. Use it to compare ONLY Strings here not string literals (c strings)\n// If you need to compare a String with a string literal (c string) use #rfString_Equal_s\n// @lmsFunction\n// @param s1 The first string to compare @inhtype{String,StringX} @tmpSTR\n// @param s2 The second string to compare @inhtype{String,StringX} @tmpSTR\n// @return True in case the strings are equal and false otherwise\n#if defined(RF_IAMHERE_FOR_DOXYGEN)\ni_DECLIMEX_ char rfString_Equal(void* s1,void* s2);\n#else\ni_DECLIMEX_ char i_rfString_Equal(void* s1,void* s2);\n#define rfString_Equal(i_STRING1_,i_STRING2_) i_rfLMSX_WRAP2(char,i_rfString_Equal,i_STRING1_,i_STRING2_)\n#endif\n\n\n// @memberof RF_String\n// @brief Finds if a substring exists inside another string.\n//\n// @isinherited{StringX}\n// Finds the existence of String sstr inside this string with the given options. You have the\n// option to either match case or perform a case-insensitive search. In addition you can search\n// for the exact string and not it just being a part of another string.\n// @lmsFunction\n// @param thisstr This string we want to search in @inhtype{String,StringX}\n// @param sstr The substring string we want to search for @inhtype{String,StringX} @tmpSTR\n// @param options \\rfoptional{0}. Bitflag options denoting some options for the search.Can have values:\n// + @c RF_CASE_IGNORE: If you want the found substring to ignore the case and returns success for any occurence of the string in any case.\n// Default search option is to @b match the case. For now this works only for characters of the english language.\n// + @c RF_MATCH_WORD: If you want the found substring to be exact. For example an exact search for @e \"HELLO\" in the string\n// @e \"HELLOWORLD\" would return a failure. Default search is to return any found substring.\n// @return Returns the character position of the found substring or RF_FAILURE for not found\n#if defined(RF_IAMHERE_FOR_DOXYGEN)\ni_DECLIMEX_ int32_t rfString_Find(const void* thisstr,const void* sstr,const char options);\n#else\ni_DECLIMEX_ int32_t i_rfString_Find(const void* thisstr,const void* sstr,const char* options);\n #ifndef RF_OPTION_DEFAULT_ARGUMENTS\n #define rfString_Find(i_THISSTR_,i_SEARCHSTR_,i_OPTIONS_) i_rfLMS_WRAP3(int32_t,i_rfString_Find,i_THISSTR_,i_SEARCHSTR_,i_RFI8_(i_OPTIONS_))\n #else\n #define rfString_Find(...) RF_SELECT_FUNC_IF_NARGGT(i_NPSELECT_RF_STRING_FIND,3,__VA_ARGS__)\n #define i_NPSELECT_RF_STRING_FIND1(...) RF_COMPILE_ERROR(\"message \\\"Ileggal Arguments Number: Function rfString_Find() accepts from 2 to 3 arguments\\\"\")\n #define i_NPSELECT_RF_STRING_FIND0(...) RF_SELECT_FUNC(i_SELECT_RF_STRING_FIND,__VA_ARGS__)\n #define i_SELECT_RF_STRING_FIND2(i_THISSTR_,i_SEARCHSTR_) i_rfLMS_WRAP3(int32_t,i_rfString_Find,i_THISSTR_,i_SEARCHSTR_,i_RFI8_(0))\n #define i_SELECT_RF_STRING_FIND3(i_THISSTR_,i_SEARCHSTR_,i_OPTIONS_) i_rfLMS_WRAP3(int32_t,i_rfString_Find,i_THISSTR_,i_SEARCHSTR_,i_RFI8_(i_OPTIONS_))\n #define i_SELECT_RF_STRING_FIND1(...) RF_COMPILE_ERROR(\"message \\\"Illegal Arguments Number: Function rfString_Find() accepts from 2 to 3 arguments\\\"\")\n #define i_SELECT_RF_STRING_FIND0(...) RF_COMPILE_ERROR(\"message \\\"Illegal Arguments Number: Function rfString_Find() accepts from 2 to 3 arguments\\\"\")\n #endif\n#endif\n\n\n// @memberof RF_String\n// @brief Returns the integer value of a String\n//\n// @isinherited{StringX}\n// The parameter string must contains only numbers. If it contains anything else the function fails.\n// @param thisstr The string whose integer value to return. @inhtype{String,StringX}\n// @param[out] v A refence to an integer that will return the float value\n// @return Returns true in case of succesfull conversion or false if no integer was represented by the string\ni_DECLIMEX_ char rfString_ToInt(void* thisstr,int32_t* v);\n\n// @memberof RF_String\n// @brief Returns the double value of a String\n//\n// @isinherited{StringX}\n// The parameter string must contain only a number. If it contains anything else the function fails.\n// @param thisstr The string whose floating point value to return. @inhtype{String,StringX}\n// @param[out] f A refence to a double that will return the floating point number value\n// @return Returns RF_SUCCESS in case of succesfull conversion or error if there was failure. Possible errors are:\n// + @c RE_STRING_TOFLOAT: There was a conversion error. The string probably does not represent a float\n// + @c RE_STRING_TOFLOAT_RANGE: The represented floating point number is of a range bigger than what can be\n// represented by the system\n// + @c RE_STRING_TOFLOAT_UNDERFLOW: Representing the string's floating point number in a double would cause underflow\ni_DECLIMEX_ int rfString_ToDouble(void* thisstr,double* f);\n\n// @memberof RF_String\n// @brief Returns a cstring version of the string\n//\n// @isinherited{StringX}\n// Remember that this is just a pointer to the string data. It can't be modified. memcpy it if you need a copy of it.\n// @param str The string whose cstring to return. @inhtype{String,StringX}\n// @return Returns a c string version of the string\ni_DECLIMEX_ const char* rfString_ToCstr(const void* str);\n\n\n// @memberof RF_String\n// @cppignore\n// @brief Creates and returns an allocated copy of the given string\n//\n// @isinherited{StringX}\n// @note The Returned Substring needs to be freed by the user. BEWARE when assigning to a string using this function since if any previous string exists there IS NOT getting freed. You have to free it explicitly\n// @param src The string to copy from. @inhtype{String,StringX}\n// @return Returns a string copied from the previous one or null if the original string was null\ni_DECLIMEX_ RF_String* rfString_Copy_OUT(void* src);\n// @memberof RF_String\n// @cppignore\n// @brief Copies all the contents of a string to another\n//\n// @isinherited{StringX}\n// @param dst The string to copy in.\n// @param src The string to copy from. @inhtype{String,StringX}\n// If the value is bigger than the maximum number of characters then still all characters are copied.\ni_DECLIMEX_ void rfString_Copy_IN(RF_String* dst,void* src);\n// @memberof RF_String\n// @brief Copies a certain number of characters from a string\n//\n// @isinherited{StringX}\n// Copies @c n characters from @c src String into the destination @c dst string.\n// @param dst The string to copy in\n// @param src The string to copy from. @inhtype{String,StringX}\n// @param n The number of characters to copy from the @c src string\n// If the value is bigger than the maximum number of characters then still all characters are copied.\ni_DECLIMEX_ void rfString_Copy_chars(RF_String* dst,void* src,uint32_t n);\n\n\n// @memberof RF_String\n// @brief Applies a limited version of sscanf after the specified substring\n//\n// @isinherited{StringX}\n// @lmsFunction\n// @param thisstr The current string. @inhtype{String,StringX}\n// @param afterstr The substring after which to apply sscanf. @inhtype{String,StringX} @tmpSTR\n// @param format The tokens parameter which give the format of scanf\n// @param var A void* to pass in any variable we need to get a value\n// @return Returns true if a value was read and false otherwise, substring not being found in the string or sscanf unable to read into the variable\n#if defined(RF_IAMHERE_FOR_DOXYGEN)\n i_DECLIMEX_ char rfString_ScanfAfter(void* thisstr,void* afterstr,const char* format,void* var);\n#else\n i_DECLIMEX_ char i_rfString_ScanfAfter(void* thisstr,void* afterstr,const char* format,void* var);\n #define rfString_ScanfAfter(i_THISSTR_,i_AFTERSTR_,i_FORMAT_,i_VAR_) i_rfLMSX_WRAP4(char,i_rfString_ScanfAfter,i_THISSTR_,i_AFTERSTR_,i_FORMAT_,i_VAR_)\n#endif\n\n// @memberof RF_String\n// @brief Counts how many times a substring occurs inside the string.\n//\n// @isinherited{StringX}\n// @lmsFunction\n// @param thisstr The string inside which to count. @inhtype{String,StringX}\n// @param sstr The substring for which to search. @inhtype{String,StringX} @tmpSTR\n// @param options \\rfoptional{0}. Bitflag options denoting some options for the search. Give 0 for the defaults.Can have values:\n// + @c RF_CASE_IGNORE: If you want the found substring to ignore the case and returns success for any occurence of the string in any case.\n// Default search option is to @b match the case. For now this works only for characters of the english language.\n// + @c RF_MATCH_WORD: If you want the found substring to be exact. For example an exact search for @e \"HELLO\" in the string\n// @e \"HELLOWORLD\" would return a failure. Default search is to return any found substring.\n// @return Returns the number of times cstr exists inside the string (0 is returned in case it's not found at all\n#if defined(RF_IAMHERE_FOR_DOXYGEN)\ni_DECLIMEX_ int32_t rfString_Count(void* thisstr,void* sstr,const char options);\n#else\ni_DECLIMEX_ int32_t i_rfString_Count(void* thisstr,void* sstr,const char* options);\n #ifdef RF_OPTION_DEFAULT_ARGUMENTS\n #define rfString_Count(...) RF_SELECT_FUNC_IF_NARGGT(i_NPSELECT_RF_STRING_COUNT,3,__VA_ARGS__)\n #define i_NPSELECT_RF_STRING_COUNT1(...) RF_COMPILE_ERROR(\"message \\\"Ileggal Arguments Number: Function rfString_Count() accepts from 2 to 3 arguments\\\"\")\n #define i_NPSELECT_RF_STRING_COUNT0(...) RF_SELECT_FUNC(i_SELECT_RF_STRING_COUNT,__VA_ARGS__)\n #define i_SELECT_RF_STRING_COUNT2(i_THISSTR_,i_SEARCHSTR_) i_rfLMSX_WRAP3(int32_t,i_rfString_Count,i_THISSTR_,i_SEARCHSTR_,i_RFI8_(0))\n #define i_SELECT_RF_STRING_COUNT3(i_THISSTR_,i_SEARCHSTR_,i_OPTIONS_) i_rfLMS_WRAP3(int32_t,i_rfString_Count,i_THISSTR_,i_SEARCHSTR_,i_RFI8_(i_OPTIONS_))\n #define i_SELECT_RF_STRING_COUNT1(...) RF_COMPILE_ERROR(\"message \\\"Ileggal Arguments Number: Function rfString_Count() accepts from 2 to 3 arguments\\\"\")\n #define i_SELECT_RF_STRING_COUNT0(...) RF_COMPILE_ERROR(\"message \\\"Ileggal Arguments Number: Function rfString_Count() accepts from 2 to 3 arguments\\\"\")\n #else\n #define rfString_Count(i_THISSTR_,i_SEARCHSTR_,i_OPTIONS_) i_rfLMSX_WRAP3(int32_t,i_rfString_Count,i_THISSTR_,i_SEARCHSTR_,i_RFI8_(i_OPTIONS_))\n #endif\n#endif\n\n\n// @memberof RF_String\n// @brief Tokenizes the given string\n//\n// @isinherited{StringX}\n// Separates it into @c tokensN depending on how many substrings can be created from the @c sep separatior and stores them\n// into the Array of RF_String* that should be passed to the function. The array gets initialized inside the function and\n// has to be freed explicitly later by thg user. Also each String inside the array has to be Deinitialized too.\n// Here is an example usage:\n// @snippet Strings/tokenize.cpp Tokenize_C\n// @cppsnippet Tokenize_CPP\n// @param[in] thisstr The string to tokenize. @inhtype{String,StringX}\n// @param[in] sep A string literal that will be used as a separator to tokenize the given string\n// @param[out] tokensN The number of tokens that got created\n// @param[out] tokens Pass a pointer to an array of RF_Strings. @keepptr\n// @return Returns true in success and false in case the the separating character has not been found\n// @internal @cppcode\n// char String::Tokenize(char* sep,uint32_t* tokensN, String*** tokens)\n// {\n// RF_String* t;\n// uint32_t i;\n// if(rfString_Tokenize(this->i_StringCHandle,sep,tokensN,&t)==false)\n// return false;\n//\n// *tokens = (String**) malloc(sizeof(String*)* (*tokensN));\n// for(i=0;i<(*tokensN);i++)\n// {\n// (*tokens)[i] = new String((RF_String*)&t[i]);\n// }\n// return true;\n// }\n// @endcpp @endinternal\ni_DECLIMEX_ char rfString_Tokenize(void* thisstr,char* sep,uint32_t* tokensN,RF_String** tokens);\n\n\n// @memberof RF_String\n// @brief Initializes the first substring, between two given strings\n//\n// @isinherited{StringX}\n// Initializes the given string as the first substring existing between the left and right parameter substrings\n// @lmsFunction\n// @note The Returned Substring needs to be deinitialized by the user.\n// @param thisstr This current string. @inhtype{String,StringX}\n// @param[in] lstr The left substring that will define the new substring. @inhtype{String,StringX} @tmpSTR\n// @param[in] rstr The right substring that will define the new substring. @inhtype{String,StringX} @tmpSTR\n// @param[out] result The resulting substring.\n// @param options \\rfoptional{0} Bitflag options denoting the method with which to search for the substring literals inside the string. Give 0 for the defaults.\n// Can have values:\n// + @c RF_CASE_IGNORE: If you want to search for any occurence of the substring disregarding CAPS or not.\n// Default search option is to @b match the case. For now this works only for characters of the english language.\n// + @c RF_MATCH_WORD: If you to find only exact matches of the substring. For example an exact search for @e \"HELLO\" in the string\n// @e \"HELLOWORLD\" would find nothing. Default is with this flag off.\n// @return Returns true if the substring is found and initialized and false otherwise\n#if defined(RF_IAMHERE_FOR_DOXYGEN)\ni_DECLIMEX_ char rfString_Between(void* thisstr,void* lstr,void* rstr,RF_String* result,const char options);\n#else\ni_DECLIMEX_ char i_rfString_Between(void* thisstr,void* lstr,void* rstr,RF_String* result,const char* options);\n #ifdef RF_OPTION_DEFAULT_ARGUMENTS\n #define rfString_Between(...) RF_SELECT_FUNC_IF_NARGGT(i_NPSELECT_RF_STRING_BETWEEN,5,__VA_ARGS__)\n #define i_NPSELECT_RF_STRING_BETWEEN1(...) RF_COMPILE_ERROR(\"message \\\"Ileggal Arguments Number: Function rfString_Between() accepts from 4 to 5 arguments\\\"\")\n #define i_NPSELECT_RF_STRING_BETWEEN0(...) RF_SELECT_FUNC(i_SELECT_RF_STRING_BETWEEN,__VA_ARGS__)\n #define i_SELECT_RF_STRING_BETWEEN4(i_THISSTR_,i_LEFTSTR_,i_RIGHTSTR_,i_RESULT_) \\\n i_rfLMSX_WRAP5(char,i_rfString_Between,i_THISSTR_,i_LEFTSTR_,i_RIGHTSTR_,i_RESULT_,i_RFI8_(0))\n #define i_SELECT_RF_STRING_BETWEEN5(i_THISSTR_,i_LEFTSTR_,i_RIGHTSTR_,i_RESULT_,i_OPTIONS_) \\\n i_rfLMSX_WRAP5(char,i_rfString_Between,i_THISSTR_,i_LEFTSTR_,i_RIGHTSTR_,i_RESULT_,i_RFI8_(i_OPTIONS_))\n #define i_SELECT_RF_STRING_BETWEEN3(...) RF_COMPILE_ERROR(\"message \\\"Illegal Arguments Number: Function rfString_Between() accepts from 4 to 5 arguments\\\"\")\n #define i_SELECT_RF_STRING_BETWEEN2(...) RF_COMPILE_ERROR(\"message \\\"Illegal Arguments Number: Function rfString_Between() accepts from 4 to 5 arguments\\\"\")\n #define i_SELECT_RF_STRING_BETWEEN1(...) RF_COMPILE_ERROR(\"message \\\"Illegal Arguments Number: Function rfString_Between() accepts from 4 to 5 arguments\\\"\")\n #define i_SELECT_RF_STRING_BETWEEN0(...) RF_COMPILE_ERROR(\"message \\\"Illegal Arguments Number: Function rfString_Between() accepts from 4 to 5 arguments\\\"\")\n #else\n #define rfString_Between(i_THISSTR_,i_LEFTSTR_,i_RIGHTSTR_,i_RESULT_,i_OPTIONS_) \\\n i_rfLMSX_WRAP5(char,i_rfString_Between,i_THISSTR_,i_LEFTSTR_,i_RIGHTSTR_,i_RESULT_,i_RFI8_(i_OPTIONS_))\n #endif\n#endif\n\n\n// @memberof RF_String\n// @brief Initializes the given string as the substring from the start until any of the given Strings are found\n//\n// @isinherited{StringX}\n// The parameters that have to be given as variable argument must be of type RF_String* or RF_StringX* or even\n// string initialized with the temporary string macro\n// @rfNoDefArgsWarn1\n// @warning if the library has been compiled with @c DEFAULT_ARGUMENTS off then arguments @c options and @c parN are actually pointers\n// to @c char and @c unsigned char respectively\n// @lmsFunction\n// @param thisstr The string to operate in. @inhtype{String,StringX}\n// @param result The resulting substring.\n// @param options Bitflag options denoting the method with which to search for the substring literals inside the string. Give 0 for the defaults.\n// Can have values:\n// + @c RF_CASE_IGNORE: If you want to search for any occurence of the substring disregarding CAPS or not.\n// Default search option is to @b match the case. For now this works only for characters of the english language.\n// + @c RF_MATCH_WORD: If you to find only exact matches of the substring. For example an exact search for @e \"HELLO\" in the string\n// @e \"HELLOWORLD\" would find nothing. Default is with this flag off.\n// @param parN The number of strings to search for\n// @param ... The strings to search for. @inhtype{String,StringX} @tmpSTR\n// @extraVarArgLim\n// @return Returns true if the substring was initialized and false if none of the parameters were found or an invalid UTF-8 sequence was given. In the latter case an error is also logged.\n#ifdef RF_IAMHERE_FOR_DOXYGEN\ni_DECLIMEX_ char rfString_Beforev(void* thisstr,RF_String* result,const char options,const unsigned char parN, ...);\n#endif\n#ifdef RF_OPTION_DEFAULT_ARGUMENTS\n i_DECLIMEX_ char i_rfString_Beforev(void* thisstr,RF_String* result,const char* options,const unsigned char* parN, ...);\n #define rfString_Beforev(...) RF_SELECT_FUNC_IF_NARGGT(i_NPSELECT_RF_STRING_BEFOREV,4,__VA_ARGS__)\n #define i_NPSELECT_RF_STRING_BEFOREV1(...) RF_SELECT_FUNC_IF_NARGGT2(i_LIMSELECT_RF_STRING_BEFOREV,18,__VA_ARGS__)\n #define i_NPSELECT_RF_STRING_BEFOREV0(...) RF_COMPILE_ERROR(\"message \\\"Illegal Arguments Number: Function rfString_Beforev() needs to receive more than 4 arguments\\\"\")\n #define i_LIMSELECT_RF_STRING_BEFOREV1(...) RF_COMPILE_ERROR(\"message \\\"Extra Arguments Limit Reached: Function rfString_Beforev() received more extra arguments than the limit permits\\\"\")\n #define i_LIMSELECT_RF_STRING_BEFOREV0(...) RF_SELECT_FUNC(i_SELECT_RF_STRING_BEFOREV,__VA_ARGS__)\n #define i_SELECT_RF_STRING_BEFOREV5(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) \\\n i_rfLMSX_WRAP5(char,i_rfString_Beforev,i_ARG1_,i_ARG2_,i_RFI8_(i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_BEFOREV6(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP6(char,i_rfString_Beforev,i_ARG1_,i_ARG2_,i_RFI8_(i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_BEFOREV7(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP7(char,i_rfString_Beforev,i_ARG1_,i_ARG2_,i_RFI8_(i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_BEFOREV8(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP8(char,i_rfString_Beforev,i_ARG1_,i_ARG2_,i_RFI8_(i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_BEFOREV9(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP9(char,i_rfString_Beforev,i_ARG1_,i_ARG2_,i_RFI8_(i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_BEFOREV10(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP10(char,i_rfString_Beforev,i_ARG1_,i_ARG2_,i_RFI8_(i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_BEFOREV11(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP11(char,i_rfString_Beforev,i_ARG1_,i_ARG2_,i_RFI8_(i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_BEFOREV12(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP12(char,i_rfString_Beforev,i_ARG1_,i_ARG2_,i_RFI8_(i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_BEFOREV13(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP13(char,i_rfString_Beforev,i_ARG1_,i_ARG2_,i_RFI8_(i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_BEFOREV14(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP14(char,i_rfString_Beforev,i_ARG1_,i_ARG2_,i_RFI8_(i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_BEFOREV15(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP15(char,i_rfString_Beforev,i_ARG1_,i_ARG2_,i_RFI8_(i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_BEFOREV16(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP16(char,i_rfString_Beforev,i_ARG1_,i_ARG2_,i_RFI8_(i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_BEFOREV17(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP17(char,i_rfString_Beforev,i_ARG1_,i_ARG2_,i_RFI8_(i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_BEFOREV18(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP18(char,i_rfString_Beforev,i_ARG1_,i_ARG2_,i_RFI8_(i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n#else\n i_DECLIMEX_ char rfString_Beforev(void* thisstr,RF_String* result,const char* options,const unsigned char* parN, ...);\n#endif\n\n// @memberof RF_String\n// @brief Initializes the given string as the substring from the start until the given string is found\n//\n// @isinherited{StringX}\n// @lmsFunction\n// @param thisstr The string to operate in. @inhtype{String,StringX}\n// @param sstr The substring that we want to find inside the string @inhtype{String,StringX} @tmpSTR\n// @param result The resulting substring.\n// @param options \\rfoptional{0} Bitflag options denoting the method with which to search for the substring literals inside the string. Give 0 for the defaults.\n// Can have values:\n// + @c RF_CASE_IGNORE: If you want to search for any occurence of the substring disregarding CAPS or not.\n// Default search option is to @b match the case. For now this works only for characters of the english language.\n// + @c RF_MATCH_WORD: If you to find only exact matches of the substring. For example an exact search for @e \"HELLO\" in the string\n// @e \"HELLOWORLD\" would find nothing. Default is with this flag off.\n// @return Returns true if the substring was initialized and false if none of the parameters were found or an invalid UTF-8 sequence was given. In the latter case an error is also logged.\n#if defined(RF_IAMHERE_FOR_DOXYGEN)\ni_DECLIMEX_ char rfString_Before(void* thisstr,void* sstr,RF_String* result,const char options);\n#else\ni_DECLIMEX_ char i_rfString_Before(void* thisstr,void* sstr,RF_String* result,const char* options);\n #ifdef RF_OPTION_DEFAULT_ARGUMENTS\n #define rfString_Before(...) RF_SELECT_FUNC_IF_NARGGT(i_NPSELECT_RF_STRING_BEFORE,4,__VA_ARGS__)\n #define i_NPSELECT_RF_STRING_BEFORE1(...) RF_COMPILE_ERROR(\"message \\\"Ileggal Arguments Number: Function rfString_Before() accepts from 3 to 4 arguments\\\"\")\n #define i_NPSELECT_RF_STRING_BEFORE0(...) RF_SELECT_FUNC(i_SELECT_RF_STRING_BEFORE,__VA_ARGS__)\n #define i_SELECT_RF_STRING_BEFORE3(i_THISSTR_,i_SEARCHSTR_,i_RESULT_) i_rfLMSX_WRAP4(char,i_rfString_Before,i_THISSTR_,i_SEARCHSTR_,i_RESULT_,i_RFI8_(0))\n #define i_SELECT_RF_STRING_BEFORE4(i_THISSTR_,i_SEARCHSTR_,i_RESULT_,i_OPTIONS_) i_rfLMSX_WRAP4(char,i_rfString_Before,i_THISSTR_,i_SEARCHSTR_,i_RESULT_,i_RFI8_(i_OPTIONS_))\n #define i_SELECT_RF_STRING_BEFORE2(...) RF_COMPILE_ERROR(\"message \\\"Ileggal Arguments Number: Function rfString_Before() accepts from 3 to 4 arguments\\\"\")\n #define i_SELECT_RF_STRING_BEFORE1(...) RF_COMPILE_ERROR(\"message \\\"Ileggal Arguments Number: Function rfString_Before() accepts from 3 to 4 arguments\\\"\")\n #define i_SELECT_RF_STRING_BEFORE0(...) RF_COMPILE_ERROR(\"message \\\"Ileggal Arguments Number: Function rfString_Before() accepts from 3 to 4 arguments\\\"\")\n #else\n #define rfString_Before(i_THISSTR_,i_SEARCHSTR_,i_RESULT_,i_OPTIONS_) i_rfLMSX_WRAP4(char,i_rfString_Before,i_THISSTR_,i_SEARCHSTR_,i_RESULT_,i_RFI8_(i_OPTIONS_))\n #endif\n#endif\n\n// @memberof RF_String\n// @brief Initialize a string after a given substring\n//\n// @isinherited{StringX}\n// Initializes the given String with the substring located after (and not including) the after substring inside the parameter string. If the substring is not located the function returns false.\n// @note The given String needs to be deinitialized by the user\n// @lmsFunction\n// @param[in] thisstr The parameter string from which the substring will be formed. @inhtype{String,StringX}\n// @param[in] after The substring to search for inside the parameter string. @inhtype{String,StringX} @tmpSTR\n// @param[out] out Pass a reference to a String inside which the substring of the original string after the @c after substring will be placed\n// @param options \\rfoptional{0} Bitflag options denoting the method with which to search for the substring literals inside the string. Give 0 for the defaults.\n// Can have values:\n// + @c RF_CASE_IGNORE: If you want to search for any occurence of the substring disregarding CAPS or not.\n// Default search option is to @b match the case. For now this works only for characters of the english language.\n// + @c RF_MATCH_WORD: If you to find only exact matches of the substring. For example an exact search for @e \"HELLO\" in the string\n// @e \"HELLOWORLD\" would find nothing. Default is with this flag off.\n// @return Returns true for success and false if the substring is not found in the parameter string.\n#if defined(RF_IAMHERE_FOR_DOXYGEN)\ni_DECLIMEX_ char rfString_After(void* thisstr,void* after,RF_String* out,const char options);\n#else\ni_DECLIMEX_ char i_rfString_After(void* thisstr,void* after,RF_String* out,const char* options);\n #ifdef RF_OPTION_DEFAULT_ARGUMENTS\n #define rfString_After(...) RF_SELECT_FUNC_IF_NARGGT(i_NPSELECT_RF_STRING_AFTER,4,__VA_ARGS__)\n #define i_NPSELECT_RF_STRING_AFTER1(...) RF_COMPILE_ERROR(\"message \\\"Ileggal Arguments Number: Function rfString_After() accepts from 3 to 4 arguments\\\"\")\n #define i_NPSELECT_RF_STRING_AFTER0(...) RF_SELECT_FUNC(i_SELECT_RF_STRING_AFTER,__VA_ARGS__)\n #define i_SELECT_RF_STRING_AFTER3(i_THISSTR_,i_AFTERSTR_,i_OUTSTR_) i_rfLMSX_WRAP4(char,i_rfString_After,i_THISSTR_,i_AFTERSTR_,i_OUTSTR_,i_RFI8_(0))\n #define i_SELECT_RF_STRING_AFTER4(i_THISSTR_,i_AFTERSTR_,i_OUTSTR_,i_OPTIONS_) i_rfLMSX_WRAP4(char,i_rfString_After,i_THISSTR_,i_AFTERSTR_,i_OUTSTR_,i_RFI8_(i_OPTIONS_))\n #define i_SELECT_RF_STRING_AFTER2(...) RF_COMPILE_ERROR(\"message \\\"Ileggal Arguments Number: Function rfString_After() accepts from 3 to 4 arguments\\\"\")\n #define i_SELECT_RF_STRING_AFTER1(...) RF_COMPILE_ERROR(\"message \\\"Ileggal Arguments Number: Function rfString_After() accepts from 3 to 4 arguments\\\"\")\n #define i_SELECT_RF_STRING_AFTER0(...) RF_COMPILE_ERROR(\"message \\\"Ileggal Arguments Number: Function rfString_After() accepts from 3 to 4 arguments\\\"\")\n #else\n #define rfString_After(i_THISSTR_,i_AFTERSTR_,i_OUTSTR_,i_OPTIONS_) i_rfLMSX_WRAP4(char,i_rfString_After,i_THISSTR_,i_AFTERSTR_,i_OUTSTR_,i_RFI8_(i_OPTIONS_))\n #endif\n#endif\n\n// @memberof RF_String\n// @brief Initialize a string after the first of the given substrings found\n//\n// @isinherited{StringX}\n// Initializes the given String with the substring located after (and not including) the after substring inside the parameter string. If the substring is not located the function returns false.\n// The parameters that have to be given as variable argument must be of type RF_String* or RF_StringX* or even\n// string initializes with the temporary string macro\n// @rfNoDefArgsWarn1\n// @warning if the library has been compiled with @c DEFAULT_ARGUMENTS off then arguments @c options and @c parN are actually pointers\n// to @c char and @c unsigned char respectively\n// @lmsFunction\n// @param[in] thisstr The parameter string from which the substring will be formed. @inhtype{String,StringX}\n// @param[out] out Pass a reference to a String inside which the substring of the original string\n// after the found substring will be placed.\n// @param options \\rfoptional{0} Bitflag options denoting the method with which to search for the substring literals inside the string. Give 0 for the defaults.\n// Can have values:\n// + @c RF_CASE_IGNORE: If you want to search for any occurence of the substring disregarding CAPS or not.\n// Default search option is to @b match the case. For now this works only for characters of the english language.\n// + @c RF_MATCH_WORD: If you to find only exact matches of the substring. For example an exact search for @e \"HELLO\" in the string\n// @e \"HELLOWORLD\" would find nothing. Default is with this flag off.\n// @param parN The number of substrings to search for.\n// @param ... The substrings to search for. @inhtype{String,StringX} @tmpSTR\n// @extraVarArgLim\n// @return Returns true for success and false if the substring is not found in the parameter string.\n#ifdef RF_IAMHERE_FOR_DOXYGEN\ni_DECLIMEX_ char rfString_Afterv(void* thisstr,RF_String* out,const char options,const unsigned char parN,...);\n#endif\n#ifdef RF_OPTION_DEFAULT_ARGUMENTS\ni_DECLIMEX_ char i_rfString_Afterv(void* thisstr,RF_String* out,const char* options,const unsigned char* parN,...);\n #define rfString_Afterv(...) RF_SELECT_FUNC_IF_NARGGT(i_NPSELECT_RF_STRING_AFTERV,4,__VA_ARGS__)\n #define i_NPSELECT_RF_STRING_AFTERV1(...) RF_SELECT_FUNC_IF_NARGGT2(i_LIMSELECT_RF_STRING_AFTERV,18,__VA_ARGS__)\n #define i_NPSELECT_RF_STRING_AFTERV0(...) RF_COMPILE_ERROR(\"message \\\"Ileggal Arguments Number: Function rfString_Afterv() needs to receive more than 4 arguments\\\"\")\n #define i_LIMSELECT_RF_STRING_AFTERV1(...) RF_COMPILE_ERROR(\"message \\\"Extra Arguments Limit Reached: Function rfString_Afterv() received more extra arguments than the limit permits\\\"\")\n #define i_LIMSELECT_RF_STRING_AFTERV0(...) RF_SELECT_FUNC(i_SELECT_RF_STRING_AFTERV,__VA_ARGS__)\n #define i_SELECT_RF_STRING_AFTERV5(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP5(char,i_rfString_Afterv,i_ARG1_,i_ARG2_,i_RFI8_((i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_AFTERV6(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP6(char,i_rfString_Afterv,i_ARG1_,i_ARG2_,i_RFI8_((i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_AFTERV7(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP7(char,i_rfString_Afterv,i_ARG1_,i_ARG2_,i_RFI8_((i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_AFTERV8(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP8(char,i_rfString_Afterv,i_ARG1_,i_ARG2_,i_RFI8_((i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_AFTERV9(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP9(char,i_rfString_Afterv,i_ARG1_,i_ARG2_,i_RFI8_((i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_AFTERV10(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP10(char,i_rfString_Afterv,i_ARG1_,i_ARG2_,i_RFI8_((i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_AFTERV11(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP11(char,i_rfString_Afterv,i_ARG1_,i_ARG2_,i_RFI8_((i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_AFTERV12(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP12(char,i_rfString_Afterv,i_ARG1_,i_ARG2_,i_RFI8_((i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_AFTERV13(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP13(char,i_rfString_Afterv,i_ARG1_,i_ARG2_,i_RFI8_((i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_AFTERV14(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP14(char,i_rfString_Afterv,i_ARG1_,i_ARG2_,i_RFI8_((i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_AFTERV15(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP15(char,i_rfString_Afterv,i_ARG1_,i_ARG2_,i_RFI8_((i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_AFTERV16(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP16(char,i_rfString_Afterv,i_ARG1_,i_ARG2_,i_RFI8_((i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_AFTERV17(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP17(char,i_rfString_Afterv,i_ARG1_,i_ARG2_,i_RFI8_((i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n #define i_SELECT_RF_STRING_AFTERV18(i_ARG1_,i_ARG2_,i_ARG3_,i_ARG4_,...) i_rfLMSX_WRAP18(char,i_rfString_Afterv,i_ARG1_,i_ARG2_,i_RFI8_((i_ARG3_),i_RFUI8_(i_ARG4_),__VA_ARGS__)\n#else\n char rfString_Afterv(void* thisstr,RF_String* out,const char* options,const unsigned char* parN,...);\n#endif\n\n\n\n// @}\n/*------------------------------------------------------------------------ RF_String manipulation functions-------------------------------------------------------------------------------*/\n// @name String Manipulation\n// @{\n\n// @memberof RF_String\n// @opadd\n// @brief Appends a string to this one\n//\n// @notinherited{StringX}\n// @lmsFunction\n// @param thisstr The string to append to\n// @param other The string to add to this string. @inhtype{String,StringX} @tmpSTR\n#if defined(RF_IAMHERE_FOR_DOXYGEN)\ni_DECLIMEX_ void rfString_Append(RF_String* thisstr,void* other);\n#else\ni_DECLIMEX_ void i_rfString_Append(RF_String* thisstr,void* other);\n#define rfString_Append(i_THISSTR_,i_OTHERSTR_) i_rfLMS_WRAP2(void,i_rfString_Append,i_THISSTR_,i_OTHERSTR_)\n#endif\n\n// @memberof RF_String\n// @opadd\n// @brief Appends an integer to the string\n//\n// @notinherited{StringX}\n// @param thisstr The string to append to\n// @param i The integer to add\ni_DECLIMEX_ void rfString_Append_i(RF_String* thisstr,const int32_t i);\n\n// @memberof RF_String\n// @opadd\n// @brief Appends a float to the string\n//\n// @notinherited{StringX}\n// @param thisstr The string to append to\n// @param f The float to add\ni_DECLIMEX_ void rfString_Append_f(RF_String* thisstr,const float f);\n\n// @memberof RF_String\n// @brief Prepends the parameter String to this string\n//\n// @notinherited{StringX}\n// @lmsFunction\n// @param thisstr The string to prepend to\n// @param other The string to prepend to this string. @inhtype{String,StringX} @tmpSTR\n#if defined(RF_IAMHERE_FOR_DOXYGEN)\ni_DECLIMEX_ void rfString_Prepend(RF_String* thisstr,void* other);\n#else\ni_DECLIMEX_ void i_rfString_Prepend(RF_String* thisstr,void* other);\n#define rfString_Prepend(i_THISSTR_,i_OTHERSTR_) i_rfLMS_WRAP2(void,i_rfString_Prepend,i_THISSTR_,i_OTHERSTR_)\n#endif\n\n// @memberof RF_String\n// @brief Removes occurences of a substring\n//\n// @isinherited{StringX}\n// Removes a @c number of occurences of a substring from this string, that agree with the given parameters.\n// Does not reallocate buffer size\n// @lmsFunction\n// @param thisstr This string we want to remove from. @inhtype{String,StringX}\n// @param rstr The string whose occurences we need to locate and remove from the current string. @inhtype{String,StringX} @tmpSTR\n// @param number \\rfoptional{0}. The number of occurences to remove. Give @e 0 for all the occurences.\n// If the given number is bigger than the actual number of occurences, still all occurences get replaced.\n// @param options \\rfoptional{0}. Bitflag options denoting some options for the search. Give 0 for the defaults.\n// Can have values:\n// + @c RF_CASE_IGNORE: If you want the found substring to ignore the case and returns success for any occurence of the string in any case.\n// Default search option is to @b match the case. For now this works only for characters of the english language.\n// + @c RF_MATCH_WORD: If you want the found substring to be exact. For example an exact search for @e \"HELLO\" in the string\n// @e \"HELLOWORLD\" would return a failure. Default search is to return any found substring.\n// @return Returns true in case of success, and false if the substring was not even found inside the string\n#if defined(RF_IAMHERE_FOR_DOXYGEN)\ni_DECLIMEX_ char rfString_Remove(void* thisstr,void* rstr,uint32_t number,const char options);\n#else\n i_DECLIMEX_ char i_rfString_Remove(void* thisstr,void* rstr,uint32_t* number,const char* options);\n #ifdef RF_OPTION_DEFAULT_ARGUMENTS\n #define rfString_Remove(...) RF_SELECT_FUNC_IF_NARGGT(i_NPSELECT_RF_STRING_REMOVE,4,__VA_ARGS__)\n #define i_NPSELECT_RF_STRING_REMOVE1(...) RF_COMPILE_ERROR(\"message \\\"Illegal Arguments Number: Function rfString_Remove() accepts from 2 to 4 arguments\\\"\")\n #define i_NPSELECT_RF_STRING_REMOVE0(...) RF_SELECT_FUNC(i_SELECT_RF_STRING_REMOVE,__VA_ARGS__)\n #define i_SELECT_RF_STRING_REMOVE2(i_THISSTR_,i_REPSTR_) i_rfLMSX_WRAP4(char,i_rfString_Remove,i_THISSTR_,i_REPSTR_,i_RFUI32_(0),i_RFI8_(0))\n #define i_SELECT_RF_STRING_REMOVE3(i_THISSTR_,i_REPSTR_,i_NUMBER_) i_rfLMSX_WRAP4(char,i_rfString_Remove,i_THISSTR_,i_REPSTR_,i_RFUI32_(i_NUMBER_),i_RFI8_(0))\n #define i_SELECT_RF_STRING_REMOVE4(i_THISSTR_,i_REPSTR_,i_NUMBER_,i_OPTIONS_) \\\n i_rfLMSX_WRAP4(char,i_rfString_Remove,i_THISSTR_,i_REPSTR_,i_RFUI32_(i_NUMBER_),i_RFI8_(i_OPTIONS_))\n #define i_SELECT_RF_STRING_REMOVE1(...) RF_COMPILE_ERROR(\"message \\\"Illegal Arguments Number: Function rfString_Remove() accepts from 2 to 4 arguments\\\"\")\n #define i_SELECT_RF_STRING_REMOVE0(...) RF_COMPILE_ERROR(\"message \\\"Illegal Arguments Number: Function rfString_Remove() accepts from 2 to 4 arguments\\\"\")\n #else\n #define rfString_Remove(i_THISSTR_,i_REPSTR_,i_NUMBER_,i_OPTIONS_) i_rfLMSX_WRAP4(char,i_rfString_Remove,i_THISSTR_,i_REPSTR_,i_RFUI32_(i_NUMBER_),i_RFI8_(i_OPTIONS_))\n #endif\n#endif\n\n// @memberof RF_String\n// @brief Removes all of the characters of the string except those specified\n//\n// This string is scanned for the existence of each characters inside the given\n// @c keepstr. Any character found there is kept in the original string. All other\n// characters are removed.\n// @isinherited{StringX}\n// @lmsFunction\n// @param thisstr The string to remove from @inhtype{String,StringX}\n// @param keepstr A string all of whose characters will be kept in @c thisstr @inhtype{String,StringX} @tmpSTR\n#ifdef RF_IAMHERE_FOR_DOXYGEN\ni_DECLIMEX_ void rfString_KeepOnly(void* thisstr,void* keepstr);\n#else\ni_DECLIMEX_ void i_rfString_KeepOnly(void* thisstr,void* keepstr);\n#define rfString_KeepOnly(i_THISSTR_,I_KEEPSTR_) i_rfLMS_WRAP2(void,i_rfString_KeepOnly,i_THISSTR_,I_KEEPSTR_)\n#endif\n\n// @memberof RF_String\n// @brief Removes the first n characters from the start of the string.\n//\n// @isinherited{StringX}\n// @param thisstr The string to prune from. @inhtype{String,StringX}\n// @param n The number of characters to remove. Must be a positive integer.\n// @return True if n characters got removed and false if there are not enough characters to remove. (in which case the string becomes empty)\ni_DECLIMEX_ char rfString_PruneStart(void* thisstr,uint32_t n);\n\n// @memberof RF_String\n// @brief Removes the last n characters from the end of the string\n//\n// @isinherited{StringX}\n// @param thisstr The string to prune from. @inhtype{String,StringX}\n// @param n The number of characters to remove. Must be a positive integer.\n// @return True if n characters got removed and false if there are not enough characters to remove. (in which case the string becomes empty)\ni_DECLIMEX_ char rfString_PruneEnd(void* thisstr,uint32_t n);\n\n// @memberof RF_String\n// @brief Removes characters from one point of the string to another going backwards\n//\n// @isinherited{StringX}\n// Removes n characters from the position p (including the character at p) of the string counting backwards. If there is no space to do so, nothing is done and returns false.\n// @param thisstr The string to prune from. @inhtype{String,StringX}\n// @param p The position to remove the characters from. Must be a positive integer. Indexing starts from zero.\n// @param n The number of characters to remove from the position and back.Must be a positive integer.\n// @return Returns true in case of succesfull removal and false in any other case.\ni_DECLIMEX_ char rfString_PruneMiddleB(void* thisstr,uint32_t p,uint32_t n);\n// @memberof RF_String\n// @brief Removes characters from one point of the string to another going forward\n//\n// @isinherited{StringX}\n// Removes n characters from the position p (including the character at p) of the string counting forwards. If there is no space, nothing is done and returns false.\n// @param thisstr The string to prune from. @inhtype{String,StringX}\n// @param p The position to remove the characters from. Must be a positive integer. Indexing starts from zero.\n// @param n The number of characters to remove from the position and on. Must be a positive integer.\n// @return Returns true in case of succesfull removal and false in any other case.\ni_DECLIMEX_ char rfString_PruneMiddleF(void* thisstr,uint32_t p,uint32_t n);\n\n\n// @memberof RF_String\n// @brief Replace all occurences of a String\n//\n// @notinherited{StringX}\n// Replaces all of the specified sstr substring from the String with rstr and reallocates size, unless the new size is smaller\n// @lmsFunction\n// @param thisstr The string in which to do the replacing\n// @param sstr The string to locate and replace from the current string. @inhtype{String,StringX} @tmpSTR\n// @param rstr The string with which to replace it. @inhtype{String,StringX} @tmpSTR\n// @param number \\rfoptional{0}. The number of occurences to replace. Give @e 0 for all the occurences.\n// If the given number is bigger than the actual number of occurences, still all occurences get replaced.\n// @param options \\rfoptional{0}. Bitflag options denoting some options for the string to replace. Give 0 for the defaults. Can have values:\n// + @c RF_CASE_IGNORE: If you want to replace any occurence of the substring disregarding CAPS or not.\n// Default search option is to @b match the case. For now this works only for characters of the english language.\n// + @c RF_MATCH_WORD: If you to replace only exact matches of the substring. For example an exact replace for @e \"HELLO\" in the string\n// @e \"HELLOWORLD\" would replace nothing. Default is with this flag off.\n// @return Returns true in case of success, and false if the substring was not even found inside the string\n#if defined(RF_IAMHERE_FOR_DOXYGEN)\ni_DECLIMEX_ char rfString_Replace(RF_String* thisstr,void* sstr,void* rstr,const uint32_t number,const char options);\n#else\ni_DECLIMEX_ char i_rfString_Replace(RF_String* thisstr,void* sstr,void* rstr,const uint32_t* number,const char* options);\n #ifdef RF_OPTION_DEFAULT_ARGUMENTS\n #define rfString_Replace(...) RF_SELECT_FUNC_IF_NARGGT(i_NPSELECT_RF_STRING_REPLACE,5,__VA_ARGS__)\n #define i_NPSELECT_RF_STRING_REPLACE1(...) RF_COMPILE_ERROR(\"message \\\"Illegal Arguments Number: Function rfString_Replace() accepts from 3 to 5 arguments\\\"\")\n #define i_NPSELECT_RF_STRING_REPLACE0(...) RF_SELECT_FUNC(i_SELECT_RF_STRING_REPLACE,__VA_ARGS__)\n #define i_SELECT_RF_STRING_REPLACE3(i_THISSTR_,i_SEARCHSTR_,i_REPSTR_) i_rfLMSX_WRAP5(char,i_rfString_Replace,i_THISSTR_,i_SEARCHSTR_,i_REPSTR_,i_RFUI32_(0),i_RFI8_(0))\n #define i_SELECT_RF_STRING_REPLACE4(i_THISSTR_,i_SEARCHSTR_,i_REPSTR_,i_NUMBER_) \\\n i_rfLMSX_WRAP5(char,i_rfString_Replace,i_THISSTR_,i_SEARCHSTR_,i_REPSTR_,i_RFUI32_(i_NUMBER_),i_RFI8_(0))\n #define i_SELECT_RF_STRING_REPLACE5(i_THISSTR_,i_SEARCHSTR_,i_REPSTR_,i_NUMBER_,i_OPTIONS_) \\\n i_rfLMSX_WRAP5(char,i_rfString_Replace,i_THISSTR_,i_SEARCHSTR_,i_REPSTR_,i_RFUI32_(i_NUMBER_),i_RFI8_(i_OPTIONS_))\n #define i_SELECT_RF_STRING_REPLACE2(...) RF_COMPILE_ERROR(\"message \\\"Illegal Arguments Number: Function rfString_Replace() accepts from 3 to 5 arguments\\\"\")\n #define i_SELECT_RF_STRING_REPLACE1(...) RF_COMPILE_ERROR(\"message \\\"Illegal Arguments Number: Function rfString_Replace() accepts from 3 to 5 arguments\\\"\")\n #define i_SELECT_RF_STRING_REPLACE0(...) RF_COMPILE_ERROR(\"message \\\"Illegal Arguments Number: Function rfString_Replace() accepts from 3 to 5 arguments\\\"\")\n #else\n #define rfString_Replace(i_THISSTR_,i_SEARCHSTR_,i_REPSTR_,i_NUMBER_,i_OPTIONS_) \\\n i_rfLMSX_WRAP5(char,i_rfString_Replace,i_THISSTR_,i_SEARCHSTR_,i_REPSTR_,i_RFUI32_(i_NUMBER_),i_RFI8_(i_OPTIONS_))\n #endif\n#endif\n\n// @memberof RF_String\n// @brief Removes all characters of a substring only from the start of the String\n//\n// @isinherited{StringX}\n// Searches for and removes each individual character inside the @c sub substring from the\n// given String @c thisstr starting from the beginning of the String and until it finds any other character\n// @lmsFunction\n// @param thisstr The string to search in. @inhtype{String,StringX}\n// @param sub The substring to search for. @inhtype{String,StringX} @tmpSTR\n// @return Returns true for success and false if none of @c sub characters were found inside the given String\n#if defined(RF_IAMHERE_FOR_DOXYGEN)\n i_DECLIMEX_ char rfString_StripStart(void* thisstr,void* sub);\n#else\n i_DECLIMEX_ char i_rfString_StripStart(void* thisstr,void* sub);\n #define rfString_StripStart(i_THISSTR_,i_SUBSTR_) i_rfLMSX_WRAP2(char,i_rfString_StripStart,i_THISSTR_,i_SUBSTR_)\n#endif\n// @memberof RF_String\n// @brief Removes all characters of a substring starting from the end of the String\n//\n// @isinherited{StringX}\n// Searches for and removes each individual character inside the @c sub substring from the\n// given String @c thisstr starting from the end of the String and until it finds any other character\n// @lmsFunction\n// @param thisstr The string to search in. @inhtype{String,StringX}\n// @param sub The substring to search for. @inhtype{String,StringX} @tmpSTR\n// @return Returns true for success and false if none of @c sub characters were found inside the given String\n#if defined(RF_IAMHERE_FOR_DOXYGEN)\n i_DECLIMEX_ char rfString_StripEnd(void* thisstr,void* sub);\n#else\n i_DECLIMEX_ char i_rfString_StripEnd(void* thisstr,void* sub);\n #define rfString_StripEnd(i_THISSTR_,i_SUBSTR_) i_rfLMSX_WRAP2(char,i_rfString_StripEnd,i_THISSTR_,i_SUBSTR_)\n#endif\n\n// @memberof RF_String\n// @brief Removes all characters of a substring from both ends of the given String\n//\n// @isinherited{StringX}\n// Searches for and removes each individual character inside the @c sub substring from the\n// given String @c thisstr starting from both the beginning and the end of the String and until it finds any other character\n// @lmsFunction\n// @param thisstr The string to search in. @inhtype{String,StringX}\n// @param sub The substring to search for. @inhtype{String,StringX} @tmpSTR\n// @return Returns true for success and false if none of @c sub characters were found inside the given String\n#if defined(RF_IAMHERE_FOR_DOXYGEN)\n i_DECLIMEX_ char rfString_Strip(void* thisstr,void* sub);\n#else\n i_DECLIMEX_ char i_rfString_Strip(void* thisstr,void* sub);\n #define rfString_Strip(i_THISSTR_,i_SUBSTR_) i_rfLMSX_WRAP2(char,i_rfString_Strip,i_THISSTR_,i_SUBSTR_)\n#endif\n// @}\n/*------------------------------------------------------------------------ RF_String File Descriptor I/O functions-------------------------------------------------------------------------------*/\n// @name String File Descriptor I/O functions\n// @{\n\n// @memberof RF_String\n// @brief Allocates and returns a string from UTF-8 file parsing\n//\n// @notinherited{StringX}\n// Read the file stream @c f until either a newline character or the EOF is reached and saves it as an RF_String\n// The file's encoding must be UTF-8.If for some reason (like EOF reached) no string can be read then null is returned\n// Given file character stream must be encoded in UTF-8. A check for valide sequence of bytes is performed.\n// @param f A valid and open file pointer in read mode from which to read the string. The file's encoding must be UTF-8.A check for valide sequence of bytes is performed.\n// @param[out] eof Pass a pointer to a char to receive a true or false value in case the end of file was reached with this initialization\n// @return The initialized string or null pointer in case of failure to read the file, or unexpected data (non-UTF8 encoded string)\ni_DECLIMEX_ RF_String* rfString_Create_fUTF8(FILE* f, char* eof);\n// @memberof RF_String\n// @brief Initializes a string from UTF-8 file parsing\n//\n// @notinherited{StringX}\n// Read the file stream @c f until either a newline character or the EOF is reached and saves it as an RF_String\n// The file's encoding must be UTF-8.If for some reason (like EOF reached) no string can be read then null is returned\n// Given file character stream must be encoded in UTF-8. A check for valide sequence of bytes is performed.\n// @param str The extended string to initialize\n// @param f A valid and open file pointer in read mode from which to read the string. The file's encoding must be UTF-8.A check for valide sequence of bytes is performed.\n// @param[out] eof Pass a pointer to a char to receive a true or false value in case the end of file was reached with this initialization\n// @return Returns either a positive number for succesfull initialization that represents the bytes read from the file.\n// If there was a problem an error is returned. Possible errors are any of those that @ref rfFReadLine_UTF8() can produce.\ni_DECLIMEX_ int32_t rfString_Init_fUTF8(RF_String* str,FILE* f, char* eof);\n\n// @memberof RF_String\n// @brief Assigns to a string from UTF-8 file parsing\n//\n// @notinherited{StringX}\n// Read the file stream @c f until either a newline character or the EOF is reached and assigns it to an RF_StringX\n// The file's encoding must be UTF-8.If for some reason (like EOF reached) no string can be read then null is returned\n// Given file character stream must be encoded in UTF-8. A check for valide sequence of bytes is performed.\n// @param str The extended string to assign to\n// @param f A valid and open file pointer in read mode from which to read the string. The file's encoding must be UTF-8.A check for valide sequence of bytes is performed.\n// @param[out] eof Pass a pointer to a char to receive a true or false value in case the end of file was reached with this assignment\n// @return Returns either a positive number for succesfull assignment that represents the bytes read from the file.\n// If there was a problem an error is returned. Possible errors are any of those that @ref rfFReadLine_UTF8() can produce.\ni_DECLIMEX_ int32_t rfString_Assign_fUTF8(RF_String* str,FILE* f, char* eof);\n// @memberof RF_String\n// @brief Appends to a string from UTF-8 file parsing\n//\n// @notinherited{StringX}\n// Read the file stream @c f until either a newline character or the EOF is reached and appends it to an RF_StringX\n// The file's encoding must be UTF-8.If for some reason (like EOF reached) no string can be read then null is returned\n// Given file character stream must be encoded in UTF-8. A check for valid sequence of bytes is performed.\n// @param str The extended string to append to\n// @param f A valid and open file pointer in read mode from which to read the string. The file's encoding must be UTF-8.A check for valide sequence of bytes is performed.\n// @param[out] eof Pass a pointer to a char to receive a true or false value in case the end of file was reached with this appending\n// @return Returns either a positive number for succesfull appending that represents the bytes read from the file.\n// If there was a problem an error is returned. Possible errors are any of those that @ref rfFReadLine_UTF8() can produce.\ni_DECLIMEX_ int32_t rfString_Append_fUTF8(RF_String* str,FILE* f, char* eof);\n\n// @memberof RF_String\n// @cppnotctor\n// @brief Allocates and returns a string from UTF-16 file parsing\n//\n// @notinherited{StringX}\n// Read the file stream @c f until either a newline character or the EOF is reached and saves it as an RF_StringX\n// The file's encoding must be UTF-16.If for some reason (like EOF reached) no string can be read then null is returned. A check for a valid sequence of bytes is performed.\n// @param f A valid and open file pointer in read mode from which to read the string. The file's encoding must be UTF-16.\n// @param endianess A flag that determines in what endianess the UTF-16 file is encoded in. Possible values here are\n// @c RF_LITTLE_ENDIAN and @c RF_BIG_ENDIAN.\n// @param[out] eof Pass a pointer to a char to receive a true or false value in case the end of file was reached with this initialization\n// @return The initialized string or null pointer in case of failure to read the file\ni_DECLIMEX_ RF_String* rfString_Create_fUTF16(FILE* f, char endianess,char* eof);\n// @memberof RF_String\n// @brief Initializes a string from UTF-16 file parsing\n//\n// @notinherited{StringX}\n// Read the file stream @c f until either a newline character or the EOF is reached and saves it as an RF_StringX\n// The file's encoding must be UTF-16.If for some reason (like EOF reached) no string can be read then null is returned. A check for a valid sequence of bytes is performed.\n// @param str The extended string to initialize\n// @param f A valid and open file pointer in read mode from which to read the string. The file's encoding must be UTF-16.\n// @param endianess A flag that determines in what endianess the UTF-16 file is encoded in. Possible values here are\n// @c RF_LITTLE_ENDIAN and @c RF_BIG_ENDIAN.\n// @param[out] eof Pass a pointer to a char to receive a true or false value in case the end of file was reached with this initialization\n// @return Returns either a positive number for succesfull initialization that represents the bytes read from the file.\n// If there was a problem an error is returned. Possible errors are any of those that @ref rfFReadLine_UTF16LE() can produce.\ni_DECLIMEX_ int32_t rfString_Init_fUTF16(RF_String* str,FILE* f, char endianess,char* eof);\n\n// @memberof RF_String\n// @brief Appends the contents of a UTF-16 file a String\n//\n// @notinherited{StringX}\n// Read the file stream @c f until either a newline character or the EOF is reached and appends it to an RF_StringX\n// The file's encoding must be UTF-16.If for some reason (like EOF reached) no string can be read then null is returned. A check for a valid sequence of bytes is performed.\n// @param str The extended string to append to\n// @param f A valid and open file pointer in read mode from which to read the string. The file's encoding must be UTF-16.\n// @param endianess A flag that determines in what endianess the UTF-16 file is encoded in. Possible values here are\n// @c RF_LITTLE_ENDIAN and @c RF_BIG_ENDIAN.\n// @param[out] eof Pass a pointer to a char to receive a true or false value in case the end of file was reached with this appending\n// @return Returns either a positive number for succesfull appending that represents the bytes read from the file.\n// If there was a problem an error is returned. Possible errors are any of those that @ref rfFReadLine_UTF16LE() can produce.\ni_DECLIMEX_ int32_t rfString_Append_fUTF16(RF_String* str,FILE* f, char endianess,char* eof);\n// @memberof RF_String\n// @brief Assigns the contents of a UTF-16 file to an already initialized string\n//\n// @notinherited{StringX}\n// Read the file stream @c f until either a newline character or the EOF is reached and assigns it to an RF_StringX\n// The file's encoding must be UTF-16.If for some reason (like EOF reached) no string can be read then null is returned. A check for a valid sequence of bytes is performed.\n// @param str The extended string to assign to\n// @param f A valid and open file pointer in read mode from which to read the string. The file's encoding must be UTF-16.\n// @param endianess A flag that determines in what endianess the UTF-16 file is encoded in. Possible values here are\n// @c RF_LITTLE_ENDIAN and @c RF_BIG_ENDIAN.\n// @param[out] eof Pass a pointer to a char to receive a true or false value in case the end of file was reached with this assignment\n// @return Returns either a positive number for succesfull assignment that represents the bytes read from the file.\n// If there was a problem an error is returned. Possible errors are any of those that @ref rfFReadLine_UTF16LE() can produce.\ni_DECLIMEX_ int32_t rfString_Assign_fUTF16(RF_String* str,FILE* f, char endianess,char* eof);\n\n// @memberof RF_String\n// @cppnotctor\n// @brief Allocates and returns a string from UTF-32 file parsing\n//\n// @notinherited{StringX}\n// Read the file stream @c f until either a newline character or the EOF is reached and saves it as an RF_StringX\n// The file's encoding must be UTF-32.If for some reason (like EOF reached) no string can be read then null is returned. A check for a valid sequence of bytes is performed.\n// @param f A valid and open file pointer in read mode from which to read the string. The file's encoding must be UTF-32.\n// @param endianess A flag that determines in what endianess the UTF-32 file is encoded in. Possible values here are\n// @c RF_LITTLE_ENDIAN and @c RF_BIG_ENDIAN.\n// @param[out] eof Pass a pointer to a char to receive a true or false value in case the end of file was reached with this initialization\n// @return The initialized string or null pointer in case of failure to read the file\ni_DECLIMEX_ RF_String* rfString_Create_fUTF32(FILE* f,char endianess, char* eof);\n// @memberof RF_String\n// @brief Initializes a string from UTF-32 file parsing\n//\n// @notinherited{StringX}\n// Read the file stream @c f until either a newline character or the EOF is reached and saves it as an RF_StringX\n// The file's encoding must be UTF-32.If for some reason (like EOF reached) no string can be read then null is returned. A check for a valid sequence of bytes is performed.\n// @param str The extended string to initialize\n// @param f A valid and open file pointer in read mode from which to read the string. The file's encoding must be UTF-32.\n// @param endianess A flag that determines in what endianess the UTF-32 file is encoded in. Possible values here are\n// @c RF_LITTLE_ENDIAN and @c RF_BIG_ENDIAN.\n// @param[out] eof Pass a pointer to a char to receive a true or false value in case the end of file was reached with this initialization\n// @return Returns either a positive number for succesfull initialization that represents the bytes read from the file.\n// If there was a problem an error is returned. Possible errors are any of those that @ref rfFReadLine_UTF32LE() can produce.\ni_DECLIMEX_ int32_t rfString_Init_fUTF32(RF_String* str,FILE* f,char endianess, char* eof);\n// @memberof RF_String\n// @brief Assigns the contents of a UTF-32 file to a string\n//\n// @notinherited{StringX}\n// Read the file stream @c f until either a newline character or the EOF is reached and assigns it as the contents of the given RF_StringX\n// The file's encoding must be UTF-32.If for some reason (like EOF reached) no string can be read then null is returned. A check for a valid sequence of bytes is performed.\n// @param str The extended string to assign to\n// @param f A valid and open file pointer in read mode from which to read the string. The file's encoding must be UTF-32.\n// @param endianess A flag that determines in what endianess the UTF-32 file is encoded in. Possible values here are\n// @c RF_LITTLE_ENDIAN and @c RF_BIG_ENDIAN.\n// @param[out] eof Pass a pointer to a char to receive a true or false value in case the end of file was reached with this assignment\n// @return Returns either a positive number for succesfull assignment that represents the bytes read from the file.\n// If there was a problem an error is returned. Possible errors are any of those that @ref rfFReadLine_UTF32LE() can produce.\ni_DECLIMEX_ int32_t rfString_Assign_fUTF32(RF_String* str,FILE* f,char endianess, char* eof);\n// @memberof RF_String\n// @brief Appends the contents of a UTF-32 file to a string\n//\n// @notinherited{StringX}\n// Read the file stream @c f until either a newline character or the EOF is reached and appends to the given RF_StringX\n// The file's encoding must be UTF-32.If for some reason (like EOF reached) no string can be read then null is returned. A check for a valid sequence of bytes is performed.\n// @param str The extended string to append to\n// @param f A valid and open file pointer in read mode from which to read the string. The file's encoding must be UTF-32.\n// @param endianess A flag that determines in what endianess the UTF-32 file is encoded in. Possible values here are\n// @c RF_LITTLE_ENDIAN and @c RF_BIG_ENDIAN.\n// @param[out] eof Pass a pointer to a char to receive a true or false value in case the end of file was reached with this appending\n// @return Returns either a positive number for succesfull appending that represents the bytes read from the file.\n// If there was a problem an error is returned. Possible errors are any of those that @ref rfFReadLine_UTF32LE() can produce.\ni_DECLIMEX_ int32_t rfString_Append_fUTF32(RF_String* str,FILE* f,char endianess, char* eof);\n\n// @memberof RF_String\n// @brief Writes a string to a file depending on the given encoding\n//\n// @isinherited{StringX}\n// This function shall output the string @c s into the file descriptor @c f in the given @c encoding .\n// @lmsFunction\n// @param s The string to write to the file @inhtype{String,StringX} @tmpSTR\n// @param f A valid and open file pointer into which to write the string.\n// @param encoding \\rfoptional{@c RF_UTF8} The encoding of the file. Default is @c RF_UTF8. Can be one of:\n// + @c RF_UTF8: For Unicode UTF-8 encoding\n// + @c RF_UTF16_BE: For Unicode UTF-16 encoding in Big Endian endianess\n// + @c RF_UTF16_LE: For Unicode UTF-16 encoding in Little Endian endianess\n// + @c RF_UTF32_BE: For Unicode UTF-32 encoding in Big Endian endianess\n// + @c RF_UTF32_LE: For Unicode UTF-32 encoding in Little Endian endianess\n// @return Returns @c RF_SUCCESS for succesfull writting and error otherwise. Possible errors are:\n// + @c RE_FILE_WRITE: There was an unknown write error\n// + @c RE_FILE_WRITE_BLOCK: The write failed because the file was occupied by another thread and the no block flag was set\n// + @c RE_FILE_BAD: The file descriptor @c f was corrupt\n// + @c RE_FILE_TOOBIG: The file's size exceeds the system limiti\n// + @c RE_INTERRUPT: Writting failed due to a system interrupt\n// + @c RE_FILE_IO: Writting failed because of a physical I/O error\n// + @c RE_FILE_NOSPACE: Writting failed because the device containing the file had no free space\n// + @c RE_FILE_NOT_FILE: Writting failed because the given file descriptor @c f is either non existen or not a file\n#if defined(RF_IAMHERE_FOR_DOXYGEN)\n i_DECLIMEX_ int32_t rfString_Fwrite(void* s,FILE* f,char encoding);\n#else\n i_DECLIMEX_ int32_t i_rfString_Fwrite(void* s,FILE* f,char* encoding);\n #ifdef RF_OPTION_DEFAULT_ARGUMENTS\n #define rfString_Fwrite(...) RF_SELECT_FUNC_IF_NARGGT(i_NPSELECT_RF_STRING_FWRITE,3,__VA_ARGS__)\n #define i_NPSELECT_RF_STRING_FWRITE1(...) RF_COMPILE_ERROR(\"message \\\"Illegal Arguments Number: Function rfString_Fwrite() accepts from 2 to 3 arguments\\\"\")\n #define i_NPSELECT_RF_STRING_FWRITE0(...) RF_SELECT_FUNC(i_SELECT_RF_STRING_FWRITE,__VA_ARGS__)\n #define i_SELECT_RF_STRING_FWRITE3(i_STR_,i_FILE_,i_ENCODING_) i_rfLMSX_WRAP3(int32_t,i_rfString_Fwrite,i_STR_,i_FILE_,i_RFI8_(i_ENCODING_))\n #define i_SELECT_RF_STRING_FWRITE2(i_STR_,i_FILE_) i_rfLMSX_WRAP3(int32_t,i_rfString_Fwrite,i_STR_,i_FILE_,i_RFI8_(RF_UTF8))\n #define i_SELECT_RF_STRING_FWRITE1(i_STR_,i_FILE_) RF_COMPILE_ERROR(\"message \\\"Illegal Arguments Number: Function rfString_Fwrite() accepts from 2 to 3 arguments\\\"\")\n #define i_SELECT_RF_STRING_FWRITE0(i_STR_,i_FILE_) RF_COMPILE_ERROR(\"message \\\"Illegal Arguments Number: Function rfString_Fwrite() accepts from 2 to 3 arguments\\\"\")\n #else\n #define rfString_Fwrite_fUTF8(i_STR_,i_FILE_,i_ENCODING_) i_rfLMSX_WRAP3(int32_t,i_rfString_Fwrite,i_STR_,i_FILE_,i_RFI8_(i_ENCODING_))\n #endif\n#endif\n\n\n// @}\n// closing the String File I/o functions\n\n#ifdef __cplusplus\n}// closing bracket for calling from C++\n#endif\n\n#else // end of the strings module include\n #error Attempted to include Refu String manipulation with the String module flag off. Rebuild the library with that option added if you need to include them\n#endif\n\n#endif// include guards end\n\n" }, { "path": "src/test/resources/samples/langs/C/scheduler.h", "content": "#pragma once\n\n/* Copyright © 2011 Lukas Martini\n *\n * This file is part of Xelix.\n *\n * Xelix 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 * Xelix 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 Xelix. If not, see .\n */\n\n#include \n#include \n#include \n\n#define SCHEDULER_MAXNAME 256\n#define SCHEDULER_TASK_PATH_MAX 256\n\n// Single linked list\ntypedef struct task {\n\tuint32_t pid;\n\tchar name[SCHEDULER_MAXNAME];\n\tstruct task *parent;\n\tcpu_state_t* state;\n\tstruct task* next;\n\tstruct task* previous;\n\n\tvoid* stack;\n\tvoid* entry;\n\tstruct vmem_context *memory_context;\n\n\t// Current task state\n\tenum {\n\t\tTASK_STATE_KILLED,\n\t\tTASK_STATE_TERMINATED,\n\t\tTASK_STATE_BLOCKING,\n\t\tTASK_STATE_STOPPED,\n\t\tTASK_STATE_RUNNING\n\t} task_state;\n\n\tchar** environ;\n\tchar** argv;\n\tint argc;\n\n\t// TODO Is this actually the same as PATH_MAX in our toolchain?\n\tchar cwd[SCHEDULER_TASK_PATH_MAX + 1];\n} task_t;\n\nint scheduler_state;\n\ntask_t* scheduler_new(void* entry, task_t* parent, char name[SCHEDULER_MAXNAME],\n\tchar** environ, char** argv, int argc, struct vmem_context* memory_context, bool map_structs);\nvoid scheduler_add(task_t *task);\nvoid scheduler_terminate_current();\ntask_t* scheduler_get_current();\ntask_t* scheduler_select(cpu_state_t* lastRegs);\nvoid scheduler_init();\nvoid scheduler_yield();\nvoid scheduler_remove(task_t *t);\ntask_t* scheduler_fork(task_t* to_fork, cpu_state_t* state);" }, { "path": "src/test/resources/samples/langs/C/script", "content": "#!/usr/bin/tcc -run -lm\n//\n// ZyklonB scripting plugin, using a custom stack-based language\n//\n// Copyright 2014 Přemysl Janouch. All rights reserved.\n// See the file LICENSE for licensing information.\n//\n// Just compile this file as usual (sans #!) if you don't feel like using TCC.\n// It is a very basic and portable C99 application. It's not supposed to be\n// very sophisticated, for it'd get extremely big.\n//\n// The main influences of the language were Factor and Joy, stripped of all\n// even barely complex stuff. In its current state, it's only really useful as\n// a calculator but it's got great potential for extending.\n//\n// If you don't like something, just change it; this is just an experiment.\n//\n// NOTE: it is relatively easy to abuse. Be careful.\n//\n\n#define _XOPEN_SOURCE 500\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#define ADDRESS_SPACE_LIMIT (100 * 1024 * 1024)\n#include \n\n#if defined __GNUC__\n#define ATTRIBUTE_PRINTF(x, y) __attribute__ ((format (printf, x, y)))\n#else // ! __GNUC__\n#define ATTRIBUTE_PRINTF(x, y)\n#endif // ! __GNUC__\n\n#define N_ELEMENTS(a) (sizeof (a) / sizeof ((a)[0]))\n\n// --- Utilities ---------------------------------------------------------------\n\nstatic char *strdup_printf (const char *format, ...) ATTRIBUTE_PRINTF (1, 2);\n\nstatic char *\nstrdup_vprintf (const char *format, va_list ap)\n{\n\tva_list aq;\n\tva_copy (aq, ap);\n\tint size = vsnprintf (NULL, 0, format, aq);\n\tva_end (aq);\n\tif (size < 0)\n\t\treturn NULL;\n\n\tchar buf[size + 1];\n\tsize = vsnprintf (buf, sizeof buf, format, ap);\n\tif (size < 0)\n\t\treturn NULL;\n\n\treturn strdup (buf);\n}\n\nstatic char *\nstrdup_printf (const char *format, ...)\n{\n\tva_list ap;\n\tva_start (ap, format);\n\tchar *result = strdup_vprintf (format, ap);\n\tva_end (ap);\n\treturn result;\n}\n\n// --- Generic buffer ----------------------------------------------------------\n\nstruct buffer\n{\n\tchar *s; ///< Buffer data\n\tsize_t alloc; ///< Number of bytes allocated\n\tsize_t len; ///< Number of bytes used\n\tbool memory_failure; ///< Memory allocation failed\n};\n\n#define BUFFER_INITIALIZER { NULL, 0, 0, false }\n\nstatic bool\nbuffer_append (struct buffer *self, const void *s, size_t n)\n{\n\tif (self->memory_failure)\n\t\treturn false;\n\n\tif (!self->s)\n\t\tself->s = malloc (self->alloc = 8);\n\twhile (self->len + n > self->alloc)\n\t\tself->s = realloc (self->s, self->alloc <<= 1);\n\n\tif (!self->s)\n\t{\n\t\tself->memory_failure = true;\n\t\treturn false;\n\t}\n\n\tmemcpy (self->s + self->len, s, n);\n\tself->len += n;\n\treturn true;\n}\n\ninline static bool\nbuffer_append_c (struct buffer *self, char c)\n{\n\treturn buffer_append (self, &c, 1);\n}\n\n// --- Data types --------------------------------------------------------------\n\nenum item_type\n{\n\tITEM_STRING,\n\tITEM_WORD,\n\tITEM_INTEGER,\n\tITEM_FLOAT,\n\tITEM_LIST\n};\n\nstruct item\n{\n#define ITEM_HEADER \\\n\tenum item_type type; /**< The type of this object */ \\\n\tstruct item *next; /**< Next item on the list/stack */\n\n\tITEM_HEADER\n};\n\nstruct item_string\n{\n\tITEM_HEADER\n\tsize_t len; ///< Length of the string (sans '\\0')\n\tchar value[]; ///< The null-terminated string value\n};\n\n#define get_string(item) \\\n\t(assert ((item)->type == ITEM_STRING), \\\n\t ((struct item_string *)(item))->value)\n\n/// It looks like a string but it doesn't quack like a string\n#define item_word item_string\n\n#define get_word(item) \\\n\t(assert ((item)->type == ITEM_WORD), \\\n\t ((struct item_word *)(item))->value)\n\nstruct item_integer\n{\n\tITEM_HEADER\n\tlong long value; ///< The integer value\n};\n\n#define get_integer(item) \\\n\t(assert ((item)->type == ITEM_INTEGER), \\\n\t ((struct item_integer *)(item))->value)\n\nstruct item_float\n{\n\tITEM_HEADER\n\tlong double value; ///< The floating point value\n};\n\n#define get_float(item) \\\n\t(assert ((item)->type == ITEM_FLOAT), \\\n\t ((struct item_float *)(item))->value)\n\nstruct item_list\n{\n\tITEM_HEADER\n\tstruct item *head; ///< The head of the list\n};\n\n#define get_list(item) \\\n\t(assert ((item)->type == ITEM_LIST), \\\n\t ((struct item_list *)(item))->head)\n\n#define set_list(item, head_) \\\n\t(assert ((item)->type == ITEM_LIST), \\\n\t item_free_list (((struct item_list *)(item))->head), \\\n\t ((struct item_list *)(item))->head = (head_))\n\nconst char *\nitem_type_to_str (enum item_type type)\n{\n\tswitch (type)\n\t{\n\tcase ITEM_STRING: return \"string\";\n\tcase ITEM_WORD: return \"word\";\n\tcase ITEM_INTEGER: return \"integer\";\n\tcase ITEM_FLOAT: return \"float\";\n\tcase ITEM_LIST: return \"list\";\n\t}\n\tabort ();\n}\n\n// --- Item management ---------------------------------------------------------\n\nstatic void item_free_list (struct item *);\nstatic struct item *new_clone_list (const struct item *);\n\nstatic void\nitem_free (struct item *item)\n{\n\tif (item->type == ITEM_LIST)\n\t\titem_free_list (get_list (item));\n\tfree (item);\n}\n\nstatic void\nitem_free_list (struct item *item)\n{\n\twhile (item)\n\t{\n\t\tstruct item *link = item;\n\t\titem = item->next;\n\t\titem_free (link);\n\t}\n}\n\nstatic struct item *\nnew_clone (const struct item *item)\n{\n\tsize_t size;\n\tswitch (item->type)\n\t{\n\tcase ITEM_STRING:\n\tcase ITEM_WORD:\n\t{\n\t\tconst struct item_string *x = (const struct item_string *) item;\n\t\tsize = sizeof *x + x->len + 1;\n\t\tbreak;\n\t}\n\tcase ITEM_INTEGER: size = sizeof (struct item_integer); break;\n\tcase ITEM_FLOAT: size = sizeof (struct item_float); break;\n\tcase ITEM_LIST: size = sizeof (struct item_list); break;\n\t}\n\n\tstruct item *clone = malloc (size);\n\tif (!clone)\n\t\treturn NULL;\n\n\tmemcpy (clone, item, size);\n\tif (item->type == ITEM_LIST)\n\t{\n\t\tstruct item_list *x = (struct item_list *) clone;\n\t\tif (x->head && !(x->head = new_clone_list (x->head)))\n\t\t{\n\t\t\tfree (clone);\n\t\t\treturn NULL;\n\t\t}\n\t}\n\tclone->next = NULL;\n\treturn clone;\n}\n\nstatic struct item *\nnew_clone_list (const struct item *item)\n{\n\tstruct item *head = NULL, *clone;\n\tfor (struct item **out = &head; item; item = item->next)\n\t{\n\t\tif (!(clone = *out = new_clone (item)))\n\t\t{\n\t\t\titem_free_list (head);\n\t\t\treturn NULL;\n\t\t}\n\t\tclone->next = NULL;\n\t\tout = &clone->next;\n\t}\n\treturn head;\n}\n\nstatic struct item *\nnew_string (const char *s, ssize_t len)\n{\n\tif (len < 0)\n\t\tlen = strlen (s);\n\n\tstruct item_string *item = calloc (1, sizeof *item + len + 1);\n\tif (!item)\n\t\treturn NULL;\n\n\titem->type = ITEM_STRING;\n\titem->len = len;\n\tmemcpy (item->value, s, len);\n\titem->value[len] = '\\0';\n\treturn (struct item *) item;\n}\n\nstatic struct item *\nnew_word (const char *s, ssize_t len)\n{\n\tstruct item *item = new_string (s, len);\n\tif (!item)\n\t\treturn NULL;\n\n\titem->type = ITEM_WORD;\n\treturn item;\n}\n\nstatic struct item *\nnew_integer (long long value)\n{\n\tstruct item_integer *item = calloc (1, sizeof *item);\n\tif (!item)\n\t\treturn NULL;\n\n\titem->type = ITEM_INTEGER;\n\titem->value = value;\n\treturn (struct item *) item;\n}\n\nstatic struct item *\nnew_float (long double value)\n{\n\tstruct item_float *item = calloc (1, sizeof *item);\n\tif (!item)\n\t\treturn NULL;\n\n\titem->type = ITEM_FLOAT;\n\titem->value = value;\n\treturn (struct item *) item;\n}\n\nstatic struct item *\nnew_list (struct item *head)\n{\n\tstruct item_list *item = calloc (1, sizeof *item);\n\tif (!item)\n\t\treturn NULL;\n\n\titem->type = ITEM_LIST;\n\titem->head = head;\n\treturn (struct item *) item;\n}\n\n// --- Parsing -----------------------------------------------------------------\n\n#define PARSE_ERROR_TABLE(XX) \\\n\tXX( OK, NULL ) \\\n\tXX( EOF, \"unexpected end of input\" ) \\\n\tXX( INVALID_HEXA_ESCAPE, \"invalid hexadecimal escape sequence\" ) \\\n\tXX( INVALID_ESCAPE, \"unrecognized escape sequence\" ) \\\n\tXX( MEMORY, \"memory allocation failure\" ) \\\n\tXX( FLOAT_RANGE, \"floating point value out of range\" ) \\\n\tXX( INTEGER_RANGE, \"integer out of range\" ) \\\n\tXX( INVALID_INPUT, \"invalid input\" ) \\\n\tXX( UNEXPECTED_INPUT, \"unexpected input\" )\n\nenum tokenizer_error\n{\n#define XX(x, y) PARSE_ERROR_ ## x,\n\tPARSE_ERROR_TABLE (XX)\n#undef XX\n\tPARSE_ERROR_COUNT\n};\n\nstruct tokenizer\n{\n\tconst char *cursor;\n\tenum tokenizer_error error;\n};\n\nstatic bool\ndecode_hexa_escape (struct tokenizer *self, struct buffer *buf)\n{\n\tint i;\n\tchar c, code = 0;\n\n\tfor (i = 0; i < 2; i++)\n\t{\n\t\tc = tolower (*self->cursor);\n\t\tif (c >= '0' && c <= '9')\n\t\t\tcode = (code << 4) | (c - '0');\n\t\telse if (c >= 'a' && c <= 'f')\n\t\t\tcode = (code << 4) | (c - 'a' + 10);\n\t\telse\n\t\t\tbreak;\n\n\t\tself->cursor++;\n\t}\n\n\tif (!i)\n\t\treturn false;\n\n\tbuffer_append_c (buf, code);\n\treturn true;\n}\n\nstatic bool\ndecode_octal_escape (struct tokenizer *self, struct buffer *buf)\n{\n\tint i;\n\tchar c, code = 0;\n\n\tfor (i = 0; i < 3; i++)\n\t{\n\t\tc = *self->cursor;\n\t\tif (c < '0' || c > '7')\n\t\t\tbreak;\n\n\t\tcode = (code << 3) | (c - '0');\n\t\tself->cursor++;\n\t}\n\n\tif (!i)\n\t\treturn false;\n\n\tbuffer_append_c (buf, code);\n\treturn true;\n}\n\nstatic bool\ndecode_escape_sequence (struct tokenizer *self, struct buffer *buf)\n{\n\t// Support some basic escape sequences from the C language\n\tchar c;\n\tswitch ((c = *self->cursor))\n\t{\n\tcase '\\0':\n\t\tself->error = PARSE_ERROR_EOF;\n\t\treturn false;\n\tcase 'x':\n\tcase 'X':\n\t\tself->cursor++;\n\t\tif (decode_hexa_escape (self, buf))\n\t\t\treturn true;\n\n\t\tself->error = PARSE_ERROR_INVALID_HEXA_ESCAPE;\n\t\treturn false;\n\tdefault:\n\t\tif (decode_octal_escape (self, buf))\n\t\t\treturn true;\n\n\t\tself->cursor++;\n\t\tconst char *from = \"abfnrtv\\\"\\\\\", *to = \"\\a\\b\\f\\n\\r\\t\\v\\\"\\\\\", *x;\n\t\tif ((x = strchr (from, c)))\n\t\t{\n\t\t\tbuffer_append_c (buf, to[x - from]);\n\t\t\treturn true;\n\t\t}\n\n\t\tself->error = PARSE_ERROR_INVALID_ESCAPE;\n\t\treturn false;\n\t}\n}\n\nstatic struct item *\nparse_string (struct tokenizer *self)\n{\n\tstruct buffer buf = BUFFER_INITIALIZER;\n\tstruct item *item = NULL;\n\tchar c;\n\n\twhile (true)\n\tswitch ((c = *self->cursor++))\n\t{\n\tcase '\\0':\n\t\tself->cursor--;\n\t\tself->error = PARSE_ERROR_EOF;\n\t\tgoto end;\n\tcase '\"':\n\t\tif (buf.memory_failure\n\t\t || !(item = new_string (buf.s, buf.len)))\n\t\t\tself->error = PARSE_ERROR_MEMORY;\n\t\tgoto end;\n\tcase '\\\\':\n\t\tif (decode_escape_sequence (self, &buf))\n\t\t\tbreak;\n\t\tgoto end;\n\tdefault:\n\t\tbuffer_append_c (&buf, c);\n\t}\n\nend:\n\tfree (buf.s);\n\treturn item;\n}\n\nstatic struct item *\ntry_parse_number (struct tokenizer *self)\n{\n\t// These two standard library functions can digest a lot of various inputs,\n\t// including NaN and +/- infinity. That may get a bit confusing.\n\tchar *float_end;\n\terrno = 0;\n\tlong double float_value = strtold (self->cursor, &float_end);\n\tint float_errno = errno;\n\n\tchar *int_end;\n\terrno = 0;\n\tlong long int_value = strtoll (self->cursor, &int_end, 10);\n\tint int_errno = errno;\n\n\t// If they both fail, then this is most probably not a number.\n\tif (float_end == int_end && float_end == self->cursor)\n\t\treturn NULL;\n\n\t// Only use the floating point result if it parses more characters:\n\tstruct item *item;\n\tif (float_end > int_end)\n\t{\n\t\tif (float_errno == ERANGE)\n\t\t{\n\t\t\tself->error = PARSE_ERROR_FLOAT_RANGE;\n\t\t\treturn NULL;\n\t\t}\n\t\tself->cursor = float_end;\n\t\tif (!(item = new_float (float_value)))\n\t\t\tself->error = PARSE_ERROR_MEMORY;\n\t\treturn item;\n\t}\n\telse\n\t{\n\t\tif (int_errno == ERANGE)\n\t\t{\n\t\t\tself->error = PARSE_ERROR_INTEGER_RANGE;\n\t\t\treturn NULL;\n\t\t}\n\t\tself->cursor = int_end;\n\t\tif (!(item = new_integer (int_value)))\n\t\t\tself->error = PARSE_ERROR_MEMORY;\n\t\treturn item;\n\t}\n}\n\nstatic struct item *\nparse_word (struct tokenizer *self)\n{\n\tstruct buffer buf = BUFFER_INITIALIZER;\n\tstruct item *item = NULL;\n\tchar c;\n\n\t// Here we accept almost anything that doesn't break the grammar\n\twhile (!strchr (\" []\\\"\", (c = *self->cursor++)) && (unsigned char) c > ' ')\n\t\tbuffer_append_c (&buf, c);\n\tself->cursor--;\n\n\tif (buf.memory_failure)\n\t\tself->error = PARSE_ERROR_MEMORY;\n\telse if (!buf.len)\n\t\tself->error = PARSE_ERROR_INVALID_INPUT;\n\telse if (!(item = new_word (buf.s, buf.len)))\n\t\tself->error = PARSE_ERROR_MEMORY;\n\n\tfree (buf.s);\n\treturn item;\n}\n\nstatic struct item *parse_item_list (struct tokenizer *);\n\nstatic struct item *\nparse_list (struct tokenizer *self)\n{\n\tstruct item *list = parse_item_list (self);\n\tif (self->error)\n\t{\n\t\tassert (list == NULL);\n\t\treturn NULL;\n\t}\n\tif (!*self->cursor)\n\t{\n\t\tself->error = PARSE_ERROR_EOF;\n\t\titem_free_list (list);\n\t\treturn NULL;\n\t}\n\tassert (*self->cursor == ']');\n\tself->cursor++;\n\treturn new_list (list);\n}\n\nstatic struct item *\nparse_item (struct tokenizer *self)\n{\n\tchar c;\n\tswitch ((c = *self->cursor++))\n\t{\n\tcase '[': return parse_list (self);\n\tcase '\"': return parse_string (self);\n\tdefault:;\n\t}\n\n\tself->cursor--;\n\tstruct item *item = try_parse_number (self);\n\tif (!item && !self->error)\n\t\titem = parse_word (self);\n\treturn item;\n}\n\nstatic struct item *\nparse_item_list (struct tokenizer *self)\n{\n\tstruct item *head = NULL;\n\tstruct item **tail = &head;\n\n\tchar c;\n\tbool expected = true;\n\twhile ((c = *self->cursor) && c != ']')\n\t{\n\t\tif (isspace (c))\n\t\t{\n\t\t\tself->cursor++;\n\t\t\texpected = true;\n\t\t\tcontinue;\n\t\t}\n\t\telse if (!expected)\n\t\t{\n\t\t\tself->error = PARSE_ERROR_UNEXPECTED_INPUT;\n\t\t\tgoto fail;\n\t\t}\n\n\t\tif (!(*tail = parse_item (self)))\n\t\t\tgoto fail;\n\t\ttail = &(*tail)->next;\n\t\texpected = false;\n\t}\n\treturn head;\n\nfail:\n\titem_free_list (head);\n\treturn NULL;\n}\n\nstatic struct item *\nparse (const char *s, const char **error)\n{\n\tstruct tokenizer self = { .cursor = s, .error = PARSE_ERROR_OK };\n\tstruct item *list = parse_item_list (&self);\n\tif (!self.error && *self.cursor != '\\0')\n\t{\n\t\tself.error = PARSE_ERROR_UNEXPECTED_INPUT;\n\t\titem_free_list (list);\n\t\tlist = NULL;\n\t}\n\n#define XX(x, y) y,\n\tstatic const char *strings[PARSE_ERROR_COUNT] =\n\t\t{ PARSE_ERROR_TABLE (XX) };\n#undef XX\n\n\tstatic char error_buf[128];\n\tif (self.error && error)\n\t{\n\t\tsnprintf (error_buf, sizeof error_buf, \"at character %d: %s\",\n\t\t\t(int) (self.cursor - s) + 1, strings[self.error]);\n\t\t*error = error_buf;\n\t}\n\treturn list;\n}\n\n// --- Runtime -----------------------------------------------------------------\n\n// TODO: try to think of a _simple_ way to do preemptive multitasking\n\nstruct context\n{\n\tstruct item *stack; ///< The current top of the stack\n\tsize_t stack_size; ///< Number of items on the stack\n\n\tsize_t reduction_count; ///< # of function calls so far\n\tsize_t reduction_limit; ///< The hard limit on function calls\n\n\tchar *error; ///< Error information\n\tbool error_is_fatal; ///< Whether the error can be catched\n\tbool memory_failure; ///< Memory allocation failure\n\n\tvoid *user_data; ///< User data\n};\n\n/// Internal handler for a function\ntypedef bool (*handler_fn) (struct context *);\n\nstruct fn\n{\n\tstruct fn *next; ///< The next link in the chain\n\n\thandler_fn handler; ///< Internal C handler, or NULL\n\tstruct item *script; ///< Alternatively runtime code\n\tchar name[]; ///< The name of the function\n};\n\nstruct fn *g_functions; ///< Maps words to functions\n\nstatic void\ncontext_init (struct context *ctx)\n{\n\tctx->stack = NULL;\n\tctx->stack_size = 0;\n\n\tctx->reduction_count = 0;\n\tctx->reduction_limit = 2000;\n\n\tctx->error = NULL;\n\tctx->error_is_fatal = false;\n\tctx->memory_failure = false;\n\n\tctx->user_data = NULL;\n}\n\nstatic void\ncontext_free (struct context *ctx)\n{\n\titem_free_list (ctx->stack);\n\tctx->stack = NULL;\n\n\tfree (ctx->error);\n\tctx->error = NULL;\n}\n\nstatic bool\nset_error (struct context *ctx, const char *format, ...)\n{\n\tfree (ctx->error);\n\n\tva_list ap;\n\tva_start (ap, format);\n\tctx->error = strdup_vprintf (format, ap);\n\tva_end (ap);\n\n\tif (!ctx->error)\n\t\tctx->memory_failure = true;\n\treturn false;\n}\n\nstatic bool\npush (struct context *ctx, struct item *item)\n{\n\t// The `item' is typically a result from new_(), thus when it is null,\n\t// that function must have failed. This is a shortcut for convenience.\n\tif (!item)\n\t{\n\t\tctx->memory_failure = true;\n\t\treturn false;\n\t}\n\n\tassert (item->next == NULL);\n\titem->next = ctx->stack;\n\tctx->stack = item;\n\tctx->stack_size++;\n\treturn true;\n}\n\nstatic bool\nbump_reductions (struct context *ctx)\n{\n\tif (++ctx->reduction_count >= ctx->reduction_limit)\n\t{\n\t\tctx->error_is_fatal = true;\n\t\treturn set_error (ctx, \"reduction limit reached\");\n\t}\n\treturn true;\n}\n\nstatic bool execute (struct context *, struct item *);\n\nstatic bool\ncall_function (struct context *ctx, const char *name)\n{\n\tstruct fn *iter;\n\tfor (iter = g_functions; iter; iter = iter->next)\n\t\tif (!strcmp (name, iter->name))\n\t\t\tgoto found;\n\treturn set_error (ctx, \"unknown function: %s\", name);\n\nfound:\n\tif (!bump_reductions (ctx))\n\t\treturn false;\n\n\tif (iter->handler\n\t\t? iter->handler (ctx)\n\t\t: execute (ctx, iter->script))\n\t\treturn true;\n\n\t// In this case, `error' is NULL\n\tif (ctx->memory_failure)\n\t\treturn false;\n\n\t// This creates some form of a stack trace\n\tchar *tmp = ctx->error;\n\tctx->error = NULL;\n\tset_error (ctx, \"%s -> %s\", name, tmp);\n\tfree (tmp);\n\treturn false;\n}\n\nstatic void\nfree_function (struct fn *fn)\n{\n\titem_free_list (fn->script);\n\tfree (fn);\n}\n\nstatic void\nunregister_function (const char *name)\n{\n\tfor (struct fn **iter = &g_functions; *iter; iter = &(*iter)->next)\n\t\tif (!strcmp ((*iter)->name, name))\n\t\t{\n\t\t\tstruct fn *tmp = *iter;\n\t\t\t*iter = tmp->next;\n\t\t\tfree_function (tmp);\n\t\t\tbreak;\n\t\t}\n}\n\nstatic struct fn *\nprepend_new_fn (const char *name)\n{\n\tstruct fn *fn = calloc (1, sizeof *fn + strlen (name) + 1);\n\tif (!fn)\n\t\treturn NULL;\n\n\tstrcpy (fn->name, name);\n\tfn->next = g_functions;\n\treturn g_functions = fn;\n}\n\nstatic bool\nregister_handler (const char *name, handler_fn handler)\n{\n\tunregister_function (name);\n\tstruct fn *fn = prepend_new_fn (name);\n\tif (!fn)\n\t\treturn false;\n\tfn->handler = handler;\n\treturn true;\n}\n\nstatic bool\nregister_script (const char *name, struct item *script)\n{\n\tunregister_function (name);\n\tstruct fn *fn = prepend_new_fn (name);\n\tif (!fn)\n\t\treturn false;\n\tfn->script = script;\n\treturn true;\n}\n\nstatic bool\nexecute (struct context *ctx, struct item *script)\n{\n\tfor (; script; script = script->next)\n\t{\n\t\tif (script->type != ITEM_WORD)\n\t\t{\n\t\t\tif (!bump_reductions (ctx)\n\t\t\t || !push (ctx, new_clone (script)))\n\t\t\t\treturn false;\n\t\t}\n\t\telse if (!call_function (ctx, get_word (script)))\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n\n// --- Runtime library ---------------------------------------------------------\n\n#define defn(name) static bool name (struct context *ctx)\n\n#define check_stack(n) \\\n\tif (ctx->stack_size < n) { \\\n\t\tset_error (ctx, \"stack underflow\"); \\\n\t\treturn 0; \\\n\t}\n\ninline static bool\ncheck_stack_safe (struct context *ctx, size_t n)\n{\n\tcheck_stack (n);\n\treturn true;\n}\n\nstatic bool\ncheck_type (struct context *ctx, const void *item_, enum item_type type)\n{\n\tconst struct item *item = item_;\n\tif (item->type == type)\n\t\treturn true;\n\n\treturn set_error (ctx, \"invalid type: expected `%s', got `%s'\",\n\t\titem_type_to_str (type), item_type_to_str (item->type));\n}\n\nstatic struct item *\npop (struct context *ctx)\n{\n\tcheck_stack (1);\n\tstruct item *top = ctx->stack;\n\tctx->stack = top->next;\n\ttop->next = NULL;\n\tctx->stack_size--;\n\treturn top;\n}\n\n// - - Types - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\n\n#define defn_is_type(name, item_type) \\\n\tdefn (fn_is_##name) { \\\n\t\tcheck_stack (1); \\\n\t\tstruct item *top = pop (ctx); \\\n\t\tpush (ctx, new_integer (top->type == (item_type))); \\\n\t\titem_free (top); \\\n\t\treturn true; \\\n\t}\n\ndefn_is_type (string, ITEM_STRING)\ndefn_is_type (word, ITEM_WORD)\ndefn_is_type (integer, ITEM_INTEGER)\ndefn_is_type (float, ITEM_FLOAT)\ndefn_is_type (list, ITEM_LIST)\n\ndefn (fn_to_string)\n{\n\tcheck_stack (1);\n\tstruct item *item = pop (ctx);\n\tchar *value;\n\n\tswitch (item->type)\n\t{\n\tcase ITEM_WORD:\n\t\titem->type = ITEM_STRING;\n\tcase ITEM_STRING:\n\t\treturn push (ctx, item);\n\n\tcase ITEM_FLOAT:\n\t\tvalue = strdup_printf (\"%Lf\", get_float (item));\n\t\tbreak;\n\tcase ITEM_INTEGER:\n\t\tvalue = strdup_printf (\"%lld\", get_integer (item));\n\t\tbreak;\n\n\tdefault:\n\t\tset_error (ctx, \"cannot convert `%s' to `%s'\",\n\t\t\titem_type_to_str (item->type), item_type_to_str (ITEM_STRING));\n\t\titem_free (item);\n\t\treturn false;\n\t}\n\n\titem_free (item);\n\tif (!value)\n\t{\n\t\tctx->memory_failure = true;\n\t\treturn false;\n\t}\n\n\titem = new_string (value, -1);\n\tfree (value);\n\treturn push (ctx, item);\n}\n\ndefn (fn_to_integer)\n{\n\tcheck_stack (1);\n\tstruct item *item = pop (ctx);\n\tlong long value;\n\n\tswitch (item->type)\n\t{\n\tcase ITEM_INTEGER:\n\t\treturn push (ctx, item);\n\tcase ITEM_FLOAT:\n\t\tvalue = get_float (item);\n\t\tbreak;\n\n\tcase ITEM_STRING:\n\t{\n\t\tchar *end;\n\t\tconst char *s = get_string (item);\n\t\tvalue = strtoll (s, &end, 10);\n\t\tif (end != s && *s == '\\0')\n\t\t\tbreak;\n\n\t\titem_free (item);\n\t\treturn set_error (ctx, \"integer conversion error\");\n\t}\n\n\tdefault:\n\t\tset_error (ctx, \"cannot convert `%s' to `%s'\",\n\t\t\titem_type_to_str (item->type), item_type_to_str (ITEM_INTEGER));\n\t\titem_free (item);\n\t\treturn false;\n\t}\n\n\titem_free (item);\n\treturn push (ctx, new_integer (value));\n}\n\ndefn (fn_to_float)\n{\n\tcheck_stack (1);\n\tstruct item *item = pop (ctx);\n\tlong double value;\n\n\tswitch (item->type)\n\t{\n\tcase ITEM_FLOAT:\n\t\treturn push (ctx, item);\n\tcase ITEM_INTEGER:\n\t\tvalue = get_integer (item);\n\t\tbreak;\n\n\tcase ITEM_STRING:\n\t{\n\t\tchar *end;\n\t\tconst char *s = get_string (item);\n\t\tvalue = strtold (s, &end);\n\t\tif (end != s && *s == '\\0')\n\t\t\tbreak;\n\n\t\titem_free (item);\n\t\treturn set_error (ctx, \"float conversion error\");\n\t}\n\n\tdefault:\n\t\tset_error (ctx, \"cannot convert `%s' to `%s'\",\n\t\t\titem_type_to_str (item->type), item_type_to_str (ITEM_FLOAT));\n\t\titem_free (item);\n\t\treturn false;\n\t}\n\n\titem_free (item);\n\treturn push (ctx, new_float (value));\n}\n\n// - - Miscellaneous - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\n\ndefn (fn_length)\n{\n\tcheck_stack (1);\n\tstruct item *item = pop (ctx);\n\tbool success = true;\n\tswitch (item->type)\n\t{\n\tcase ITEM_STRING:\n\t\tsuccess = push (ctx, new_integer (((struct item_string *) item)->len));\n\t\tbreak;\n\tcase ITEM_LIST:\n\t{\n\t\tlong long length = 0;\n\t\tstruct item *iter;\n\t\tfor (iter = get_list (item); iter; iter = iter->next)\n\t\t\tlength++;\n\t\tsuccess = push (ctx, new_integer (length));\n\t\tbreak;\n\t}\n\tdefault:\n\t\tsuccess = set_error (ctx, \"invalid type\");\n\t}\n\titem_free (item);\n\treturn success;\n}\n\n// - - Stack operations - - - - - - - - - - - - - - - - - - - - - - - - - - - -\n\ndefn (fn_dup)\n{\n\tcheck_stack (1);\n\treturn push (ctx, new_clone (ctx->stack));\n}\n\ndefn (fn_drop)\n{\n\tcheck_stack (1);\n\titem_free (pop (ctx));\n\treturn true;\n}\n\ndefn (fn_swap)\n{\n\tcheck_stack (2);\n\tstruct item *second = pop (ctx), *first = pop (ctx);\n\treturn push (ctx, second) && push (ctx, first);\n}\n\ndefn (fn_call)\n{\n\tcheck_stack (1);\n\tstruct item *script = pop (ctx);\n\tbool success = check_type (ctx, script, ITEM_LIST)\n\t\t&& execute (ctx, get_list (script));\n\titem_free (script);\n\treturn success;\n}\n\ndefn (fn_dip)\n{\n\tcheck_stack (2);\n\tstruct item *script = pop (ctx);\n\tstruct item *item = pop (ctx);\n\tbool success = check_type (ctx, script, ITEM_LIST)\n\t\t&& execute (ctx, get_list (script));\n\titem_free (script);\n\tif (!success)\n\t{\n\t\titem_free (item);\n\t\treturn false;\n\t}\n\treturn push (ctx, item);\n}\n\ndefn (fn_unit)\n{\n\tcheck_stack (1);\n\tstruct item *item = pop (ctx);\n\treturn push (ctx, new_list (item));\n}\n\ndefn (fn_cons)\n{\n\tcheck_stack (2);\n\tstruct item *list = pop (ctx);\n\tstruct item *item = pop (ctx);\n\tif (!check_type (ctx, list, ITEM_LIST))\n\t{\n\t\titem_free (list);\n\t\titem_free (item);\n\t\treturn false;\n\t}\n\titem->next = get_list (list);\n\t((struct item_list *) list)->head = item;\n\treturn push (ctx, list);\n}\n\ndefn (fn_cat)\n{\n\tcheck_stack (2);\n\tstruct item *scnd = pop (ctx);\n\tstruct item *frst = pop (ctx);\n\tif (!check_type (ctx, frst, ITEM_LIST)\n\t || !check_type (ctx, scnd, ITEM_LIST))\n\t{\n\t\titem_free (frst);\n\t\titem_free (scnd);\n\t\treturn false;\n\t}\n\n\t// XXX: we shouldn't have to do this in O(n)\n\tstruct item **tail = &((struct item_list *) frst)->head;\n\twhile (*tail)\n\t\ttail = &(*tail)->next;\n\t*tail = get_list (scnd);\n\n\t((struct item_list *) scnd)->head = NULL;\n\titem_free (scnd);\n\treturn push (ctx, frst);\n}\n\ndefn (fn_uncons)\n{\n\tcheck_stack (1);\n\tstruct item *list = pop (ctx);\n\tif (!check_type (ctx, list, ITEM_LIST))\n\t\tgoto fail;\n\tstruct item *first = get_list (list);\n\tif (!first)\n\t{\n\t\tset_error (ctx, \"list is empty\");\n\t\tgoto fail;\n\t}\n\t((struct item_list *) list)->head = first->next;\n\tfirst->next = NULL;\n\treturn push (ctx, first) && push (ctx, list);\nfail:\n\titem_free (list);\n\treturn false;\n}\n\n// - - Logical - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\n\nstatic bool\nto_boolean (struct context *ctx, struct item *item, bool *ok)\n{\n\tswitch (item->type)\n\t{\n\tcase ITEM_STRING:\n\t\treturn *get_string (item) != '\\0';\n\tcase ITEM_INTEGER:\n\t\treturn get_integer (item) != 0;\n\tcase ITEM_FLOAT:\n\t\treturn get_float (item) != 0.;\n\tdefault:\n\t\treturn (*ok = set_error (ctx, \"cannot convert `%s' to boolean\",\n\t\t\titem_type_to_str (item->type)));\n\t}\n}\n\ndefn (fn_not)\n{\n\tcheck_stack (1);\n\tstruct item *item = pop (ctx);\n\tbool ok = true;\n\tbool result = !to_boolean (ctx, item, &ok);\n\titem_free (item);\n\treturn ok && push (ctx, new_integer (result));\n}\n\ndefn (fn_and)\n{\n\tcheck_stack (2);\n\tstruct item *op1 = pop (ctx);\n\tstruct item *op2 = pop (ctx);\n\tbool ok = true;\n\tbool result = to_boolean (ctx, op1, &ok) && to_boolean (ctx, op2, &ok);\n\titem_free (op1);\n\titem_free (op2);\n\treturn ok && push (ctx, new_integer (result));\n}\n\ndefn (fn_or)\n{\n\tcheck_stack (2);\n\tstruct item *op1 = pop (ctx);\n\tstruct item *op2 = pop (ctx);\n\tbool ok = true;\n\tbool result = to_boolean (ctx, op1, &ok)\n\t\t|| !ok || to_boolean (ctx, op2, &ok);\n\titem_free (op1);\n\titem_free (op2);\n\treturn ok && push (ctx, new_integer (result));\n}\n\n// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\n\ndefn (fn_if)\n{\n\tcheck_stack (3);\n\tstruct item *else_ = pop (ctx);\n\tstruct item *then_ = pop (ctx);\n\tstruct item *cond_ = pop (ctx);\n\n\tbool ok = true;\n\tbool condition = to_boolean (ctx, cond_, &ok);\n\titem_free (cond_);\n\n\tbool success = false;\n\tif (ok\n\t && check_type (ctx, then_, ITEM_LIST)\n\t && check_type (ctx, else_, ITEM_LIST))\n\t\tsuccess = execute (ctx, condition\n\t\t\t? get_list (then_)\n\t\t\t: get_list (else_));\n\n\titem_free (then_);\n\titem_free (else_);\n\treturn success;\n}\n\ndefn (fn_try)\n{\n\tcheck_stack (2);\n\tstruct item *catch = pop (ctx);\n\tstruct item *try = pop (ctx);\n\tbool success = false;\n\tif (!check_type (ctx, try, ITEM_LIST)\n\t || !check_type (ctx, catch, ITEM_LIST))\n\t\tgoto fail;\n\n\tif (!execute (ctx, get_list (try)))\n\t{\n\t\tif (ctx->memory_failure || ctx->error_is_fatal)\n\t\t\tgoto fail;\n\n\t\tsuccess = push (ctx, new_string (ctx->error, -1));\n\t\tfree (ctx->error);\n\t\tctx->error = NULL;\n\n\t\tif (success)\n\t\t\tsuccess = execute (ctx, get_list (catch));\n\t}\n\nfail:\n\titem_free (try);\n\titem_free (catch);\n\treturn success;\n}\n\ndefn (fn_map)\n{\n\tcheck_stack (2);\n\tstruct item *fn = pop (ctx);\n\tstruct item *list = pop (ctx);\n\tif (!check_type (ctx, fn, ITEM_LIST)\n\t || !check_type (ctx, list, ITEM_LIST))\n\t{\n\t\titem_free (fn);\n\t\titem_free (list);\n\t\treturn false;\n\t}\n\n\tbool success = false;\n\tstruct item *result = NULL, **tail = &result;\n\tfor (struct item *iter = get_list (list); iter; iter = iter->next)\n\t{\n\t\tif (!push (ctx, new_clone (iter))\n\t\t || !execute (ctx, get_list (fn))\n\t\t || !check_stack_safe (ctx, 1))\n\t\t\tgoto fail;\n\n\t\tstruct item *item = pop (ctx);\n\t\t*tail = item;\n\t\ttail = &item->next;\n\t}\n\tsuccess = true;\n\nfail:\n\tset_list (list, result);\n\titem_free (fn);\n\tif (!success)\n\t{\n\t\titem_free (list);\n\t\treturn false;\n\t}\n\treturn push (ctx, list);\n}\n\ndefn (fn_filter)\n{\n\tcheck_stack (2);\n\tstruct item *fn = pop (ctx);\n\tstruct item *list = pop (ctx);\n\tif (!check_type (ctx, fn, ITEM_LIST)\n\t || !check_type (ctx, list, ITEM_LIST))\n\t{\n\t\titem_free (fn);\n\t\titem_free (list);\n\t\treturn false;\n\t}\n\n\tbool success = false;\n\tbool ok = true;\n\tstruct item *result = NULL, **tail = &result;\n\tfor (struct item *iter = get_list (list); iter; iter = iter->next)\n\t{\n\t\tif (!push (ctx, new_clone (iter))\n\t\t || !execute (ctx, get_list (fn))\n\t\t || !check_stack_safe (ctx, 1))\n\t\t\tgoto fail;\n\n\t\tstruct item *item = pop (ctx);\n\t\tbool survived = to_boolean (ctx, item, &ok);\n\t\titem_free (item);\n\t\tif (!ok)\n\t\t\tgoto fail;\n\t\tif (!survived)\n\t\t\tcontinue;\n\n\t\tif (!(item = new_clone (iter)))\n\t\t\tgoto fail;\n\t\t*tail = item;\n\t\ttail = &item->next;\n\t}\n\tsuccess = true;\n\nfail:\n\tset_list (list, result);\n\titem_free (fn);\n\tif (!success)\n\t{\n\t\titem_free (list);\n\t\treturn false;\n\t}\n\treturn push (ctx, list);\n}\n\ndefn (fn_fold)\n{\n\tcheck_stack (3);\n\tstruct item *op = pop (ctx);\n\tstruct item *null = pop (ctx);\n\tstruct item *list = pop (ctx);\n\tbool success = false;\n\tif (!check_type (ctx, op, ITEM_LIST)\n\t || !check_type (ctx, list, ITEM_LIST))\n\t{\n\t\titem_free (null);\n\t\tgoto fail;\n\t}\n\n\tpush (ctx, null);\n\tfor (struct item *iter = get_list (list); iter; iter = iter->next)\n\t\tif (!push (ctx, new_clone (iter))\n\t\t || !execute (ctx, get_list (op)))\n\t\t\tgoto fail;\n\tsuccess = true;\n\nfail:\n\titem_free (op);\n\titem_free (list);\n\treturn success;\n}\n\ndefn (fn_each)\n{\n\tcheck_stack (2);\n\tstruct item *op = pop (ctx);\n\tstruct item *list = pop (ctx);\n\tbool success = false;\n\tif (!check_type (ctx, op, ITEM_LIST)\n\t || !check_type (ctx, list, ITEM_LIST))\n\t\tgoto fail;\n\n\tfor (struct item *iter = get_list (list); iter; iter = iter->next)\n\t\tif (!push (ctx, new_clone (iter))\n\t\t || !execute (ctx, get_list (op)))\n\t\t\tgoto fail;\n\tsuccess = true;\n\nfail:\n\titem_free (op);\n\titem_free (list);\n\treturn success;\n}\n\n// - - Arithmetic - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\n\n// XXX: why not a `struct item_string *` argument?\nstatic bool\npush_repeated_string (struct context *ctx, struct item *op1, struct item *op2)\n{\n\tstruct item_string *string = (struct item_string *) op1;\n\tstruct item_integer *repeat = (struct item_integer *) op2;\n\tassert (string->type == ITEM_STRING);\n\tassert (repeat->type == ITEM_INTEGER);\n\n\tif (repeat->value < 0)\n\t\treturn set_error (ctx, \"cannot multiply a string by a negative value\");\n\n\tchar *buf = NULL;\n\tsize_t len = string->len * repeat->value;\n\tif (len < string->len && repeat->value != 0)\n\t\tgoto allocation_fail;\n\n\tbuf = malloc (len);\n\tif (!buf)\n\t\tgoto allocation_fail;\n\n\tfor (size_t i = 0; i < len; i += string->len)\n\t\tmemcpy (buf + i, string->value, string->len);\n\tstruct item *item = new_string (buf, len);\n\tfree (buf);\n\treturn push (ctx, item);\n\nallocation_fail:\n\tctx->memory_failure = true;\n\treturn false;\n}\n\ndefn (fn_times)\n{\n\tcheck_stack (2);\n\tstruct item *op2 = pop (ctx);\n\tstruct item *op1 = pop (ctx);\n\n\tbool ok;\n\tif (op1->type == ITEM_INTEGER && op2->type == ITEM_INTEGER)\n\t\tok = push (ctx, new_integer (get_integer (op1) * get_integer (op2)));\n\telse if (op1->type == ITEM_INTEGER && op2->type == ITEM_FLOAT)\n\t\tok = push (ctx, new_float (get_integer (op1) * get_float (op2)));\n\telse if (op1->type == ITEM_FLOAT && op2->type == ITEM_FLOAT)\n\t\tok = push (ctx, new_float (get_float (op1) * get_float (op2)));\n\telse if (op1->type == ITEM_FLOAT && op2->type == ITEM_INTEGER)\n\t\tok = push (ctx, new_float (get_float (op1) * get_integer (op2)));\n\telse if (op1->type == ITEM_INTEGER && op2->type == ITEM_STRING)\n\t\tok = push_repeated_string (ctx, op2, op1);\n\telse if (op1->type == ITEM_STRING && op2->type == ITEM_INTEGER)\n\t\tok = push_repeated_string (ctx, op1, op2);\n\telse\n\t\tok = set_error (ctx, \"cannot multiply `%s' and `%s'\",\n\t\t\titem_type_to_str (op1->type), item_type_to_str (op2->type));\n\n\titem_free (op1);\n\titem_free (op2);\n\treturn ok;\n}\n\ndefn (fn_pow)\n{\n\tcheck_stack (2);\n\tstruct item *op2 = pop (ctx);\n\tstruct item *op1 = pop (ctx);\n\n\tbool ok;\n\tif (op1->type == ITEM_INTEGER && op2->type == ITEM_INTEGER)\n\t\t// TODO: implement this properly, outputting an integer\n\t\tok = push (ctx, new_float (powl (get_integer (op1), get_integer (op2))));\n\telse if (op1->type == ITEM_INTEGER && op2->type == ITEM_FLOAT)\n\t\tok = push (ctx, new_float (powl (get_integer (op1), get_float (op2))));\n\telse if (op1->type == ITEM_FLOAT && op2->type == ITEM_FLOAT)\n\t\tok = push (ctx, new_float (powl (get_float (op1), get_float (op2))));\n\telse if (op1->type == ITEM_FLOAT && op2->type == ITEM_INTEGER)\n\t\tok = push (ctx, new_float (powl (get_float (op1), get_integer (op2))));\n\telse\n\t\tok = set_error (ctx, \"cannot exponentiate `%s' and `%s'\",\n\t\t\titem_type_to_str (op1->type), item_type_to_str (op2->type));\n\n\titem_free (op1);\n\titem_free (op2);\n\treturn ok;\n}\n\ndefn (fn_div)\n{\n\tcheck_stack (2);\n\tstruct item *op2 = pop (ctx);\n\tstruct item *op1 = pop (ctx);\n\n\tbool ok;\n\tif (op1->type == ITEM_INTEGER && op2->type == ITEM_INTEGER)\n\t{\n\t\tif (get_integer (op2) == 0)\n\t\t\tok = set_error (ctx, \"division by zero\");\n\t\telse\n\t\t\tok = push (ctx, new_integer (get_integer (op1) / get_integer (op2)));\n\t}\n\telse if (op1->type == ITEM_INTEGER && op2->type == ITEM_FLOAT)\n\t\tok = push (ctx, new_float (get_integer (op1) / get_float (op2)));\n\telse if (op1->type == ITEM_FLOAT && op2->type == ITEM_FLOAT)\n\t\tok = push (ctx, new_float (get_float (op1) / get_float (op2)));\n\telse if (op1->type == ITEM_FLOAT && op2->type == ITEM_INTEGER)\n\t\tok = push (ctx, new_float (get_float (op1) / get_integer (op2)));\n\telse\n\t\tok = set_error (ctx, \"cannot divide `%s' and `%s'\",\n\t\t\titem_type_to_str (op1->type), item_type_to_str (op2->type));\n\n\titem_free (op1);\n\titem_free (op2);\n\treturn ok;\n}\n\ndefn (fn_mod)\n{\n\tcheck_stack (2);\n\tstruct item *op2 = pop (ctx);\n\tstruct item *op1 = pop (ctx);\n\n\tbool ok;\n\tif (op1->type == ITEM_INTEGER && op2->type == ITEM_INTEGER)\n\t{\n\t\tif (get_integer (op2) == 0)\n\t\t\tok = set_error (ctx, \"division by zero\");\n\t\telse\n\t\t\tok = push (ctx, new_integer (get_integer (op1) % get_integer (op2)));\n\t}\n\telse if (op1->type == ITEM_INTEGER && op2->type == ITEM_FLOAT)\n\t\tok = push (ctx, new_float (fmodl (get_integer (op1), get_float (op2))));\n\telse if (op1->type == ITEM_FLOAT && op2->type == ITEM_FLOAT)\n\t\tok = push (ctx, new_float (fmodl (get_float (op1), get_float (op2))));\n\telse if (op1->type == ITEM_FLOAT && op2->type == ITEM_INTEGER)\n\t\tok = push (ctx, new_float (fmodl (get_float (op1), get_integer (op2))));\n\telse\n\t\tok = set_error (ctx, \"cannot divide `%s' and `%s'\",\n\t\t\titem_type_to_str (op1->type), item_type_to_str (op2->type));\n\n\titem_free (op1);\n\titem_free (op2);\n\treturn ok;\n}\n\nstatic bool\npush_concatenated_string (struct context *ctx,\n\tstruct item *op1, struct item *op2)\n{\n\tstruct item_string *s1 = (struct item_string *) op1;\n\tstruct item_string *s2 = (struct item_string *) op2;\n\tassert (s1->type == ITEM_STRING);\n\tassert (s2->type == ITEM_STRING);\n\n\tchar *buf = NULL;\n\tsize_t len = s1->len + s2->len;\n\tif (len < s1->len || len < s2->len)\n\t\tgoto allocation_fail;\n\n\tbuf = malloc (len);\n\tif (!buf)\n\t\tgoto allocation_fail;\n\n\tmemcpy (buf, s1->value, s1->len);\n\tmemcpy (buf + s1->len, s2->value, s2->len);\n\tstruct item *item = new_string (buf, len);\n\tfree (buf);\n\treturn push (ctx, item);\n\nallocation_fail:\n\tctx->memory_failure = true;\n\treturn false;\n\n}\n\ndefn (fn_plus)\n{\n\tcheck_stack (2);\n\tstruct item *op2 = pop (ctx);\n\tstruct item *op1 = pop (ctx);\n\n\tbool ok;\n\tif (op1->type == ITEM_INTEGER && op2->type == ITEM_INTEGER)\n\t\tok = push (ctx, new_integer (get_integer (op1) + get_integer (op2)));\n\telse if (op1->type == ITEM_INTEGER && op2->type == ITEM_FLOAT)\n\t\tok = push (ctx, new_float (get_integer (op1) + get_float (op2)));\n\telse if (op1->type == ITEM_FLOAT && op2->type == ITEM_FLOAT)\n\t\tok = push (ctx, new_float (get_float (op1) + get_float (op2)));\n\telse if (op1->type == ITEM_FLOAT && op2->type == ITEM_INTEGER)\n\t\tok = push (ctx, new_float (get_float (op1) + get_integer (op2)));\n\telse if (op1->type == ITEM_STRING && op2->type == ITEM_STRING)\n\t\tok = push_concatenated_string (ctx, op1, op2);\n\telse\n\t\tok = set_error (ctx, \"cannot add `%s' and `%s'\",\n\t\t\titem_type_to_str (op1->type), item_type_to_str (op2->type));\n\n\titem_free (op1);\n\titem_free (op2);\n\treturn ok;\n}\n\ndefn (fn_minus)\n{\n\tcheck_stack (2);\n\tstruct item *op2 = pop (ctx);\n\tstruct item *op1 = pop (ctx);\n\n\tbool ok;\n\tif (op1->type == ITEM_INTEGER && op2->type == ITEM_INTEGER)\n\t\tok = push (ctx, new_integer (get_integer (op1) - get_integer (op2)));\n\telse if (op1->type == ITEM_INTEGER && op2->type == ITEM_FLOAT)\n\t\tok = push (ctx, new_float (get_integer (op1) - get_float (op2)));\n\telse if (op1->type == ITEM_FLOAT && op2->type == ITEM_FLOAT)\n\t\tok = push (ctx, new_float (get_float (op1) - get_float (op2)));\n\telse if (op1->type == ITEM_FLOAT && op2->type == ITEM_INTEGER)\n\t\tok = push (ctx, new_float (get_float (op1) - get_integer (op2)));\n\telse\n\t\tok = set_error (ctx, \"cannot subtract `%s' and `%s'\",\n\t\t\titem_type_to_str (op1->type), item_type_to_str (op2->type));\n\n\titem_free (op1);\n\titem_free (op2);\n\treturn ok;\n}\n\n// - - Comparison - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\n\nstatic int\ncompare_strings (struct item_string *s1, struct item_string *s2)\n{\n\t// XXX: not entirely correct wrt. null bytes\n\tsize_t len = (s1->len < s2->len ? s1->len : s2->len) + 1;\n\treturn memcmp (s1->value, s2->value, len);\n}\n\nstatic bool compare_lists (struct item *, struct item *);\n\nstatic bool\ncompare_list_items (struct item *op1, struct item *op2)\n{\n\tif (op1->type != op2->type)\n\t\treturn false;\n\n\tswitch (op1->type)\n\t{\n\tcase ITEM_STRING:\n\tcase ITEM_WORD:\n\t\treturn !compare_strings ((struct item_string *) op1,\n\t\t\t(struct item_string *) op2);\n\tcase ITEM_FLOAT:\n\t\treturn get_float (op1) == get_float (op2);\n\tcase ITEM_INTEGER:\n\t\treturn get_integer (op1) == get_integer (op2);\n\tcase ITEM_LIST:\n\t\treturn compare_lists (get_list (op1), get_list (op2));\n\t}\n\tabort ();\n}\n\nstatic bool\ncompare_lists (struct item *op1, struct item *op2)\n{\n\twhile (op1 && op2)\n\t{\n\t\tif (!compare_list_items (op1, op2))\n\t\t\treturn false;\n\n\t\top1 = op1->next;\n\t\top2 = op2->next;\n\t}\n\treturn !op1 && !op2;\n}\n\ndefn (fn_eq)\n{\n\tcheck_stack (2);\n\tstruct item *op2 = pop (ctx);\n\tstruct item *op1 = pop (ctx);\n\n\tbool ok;\n\tif (op1->type == ITEM_INTEGER && op2->type == ITEM_INTEGER)\n\t\tok = push (ctx, new_integer (get_integer (op1) == get_integer (op2)));\n\telse if (op1->type == ITEM_INTEGER && op2->type == ITEM_FLOAT)\n\t\tok = push (ctx, new_integer (get_integer (op1) == get_float (op2)));\n\telse if (op1->type == ITEM_FLOAT && op2->type == ITEM_FLOAT)\n\t\tok = push (ctx, new_integer (get_float (op1) == get_float (op2)));\n\telse if (op1->type == ITEM_FLOAT && op2->type == ITEM_INTEGER)\n\t\tok = push (ctx, new_integer (get_float (op1) == get_integer (op2)));\n\telse if (op1->type == ITEM_LIST && op2->type == ITEM_LIST)\n\t\tok = push (ctx, new_integer (compare_lists\n\t\t\t(get_list (op1), get_list (op2))));\n\telse if (op1->type == ITEM_STRING && op2->type == ITEM_STRING)\n\t\tok = push (ctx, new_integer (compare_strings\n\t\t\t((struct item_string *)(op1), (struct item_string *)(op2)) == 0));\n\telse\n\t\tok = set_error (ctx, \"cannot compare `%s' and `%s'\",\n\t\t\titem_type_to_str (op1->type), item_type_to_str (op2->type));\n\n\titem_free (op1);\n\titem_free (op2);\n\treturn ok;\n}\n\ndefn (fn_lt)\n{\n\tcheck_stack (2);\n\tstruct item *op2 = pop (ctx);\n\tstruct item *op1 = pop (ctx);\n\n\tbool ok;\n\tif (op1->type == ITEM_INTEGER && op2->type == ITEM_INTEGER)\n\t\tok = push (ctx, new_integer (get_integer (op1) < get_integer (op2)));\n\telse if (op1->type == ITEM_INTEGER && op2->type == ITEM_FLOAT)\n\t\tok = push (ctx, new_integer (get_integer (op1) < get_float (op2)));\n\telse if (op1->type == ITEM_FLOAT && op2->type == ITEM_FLOAT)\n\t\tok = push (ctx, new_integer (get_float (op1) < get_float (op2)));\n\telse if (op1->type == ITEM_FLOAT && op2->type == ITEM_INTEGER)\n\t\tok = push (ctx, new_integer (get_float (op1) < get_integer (op2)));\n\telse if (op1->type == ITEM_STRING && op2->type == ITEM_STRING)\n\t\tok = push (ctx, new_integer (compare_strings\n\t\t\t((struct item_string *)(op1), (struct item_string *)(op2)) < 0));\n\telse\n\t\tok = set_error (ctx, \"cannot compare `%s' and `%s'\",\n\t\t\titem_type_to_str (op1->type), item_type_to_str (op2->type));\n\n\titem_free (op1);\n\titem_free (op2);\n\treturn ok;\n}\n\n// - - Utilities - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\n\ndefn (fn_rand)\n{\n\treturn push (ctx, new_float ((long double) rand ()\n\t\t/ ((long double) RAND_MAX + 1)));\n}\n\ndefn (fn_time)\n{\n\treturn push (ctx, new_integer (time (NULL)));\n}\n\n// XXX: this is a bit too constrained; combines strftime() with gmtime()\ndefn (fn_strftime)\n{\n\tcheck_stack (2);\n\tstruct item *format = pop (ctx);\n\tstruct item *time_ = pop (ctx);\n\tbool success = false;\n\tif (!check_type (ctx, time_, ITEM_INTEGER)\n\t || !check_type (ctx, format, ITEM_STRING))\n\t\tgoto fail;\n\n\tif (get_integer (time_) < 0)\n\t{\n\t\tset_error (ctx, \"invalid time value\");\n\t\tgoto fail;\n\t}\n\n\tchar buf[128];\n\ttime_t time__ = get_integer (time_);\n\tstruct tm tm;\n\tgmtime_r (&time__, &tm);\n\tbuf[strftime (buf, sizeof buf, get_string (format), &tm)] = '\\0';\n\tsuccess = push (ctx, new_string (buf, -1));\n\nfail:\n\titem_free (time_);\n\titem_free (format);\n\treturn success;\n}\n\n// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\n\nstatic void item_list_to_str (const struct item *, struct buffer *);\n\nstatic void\nstring_to_str (const struct item_string *string, struct buffer *buf)\n{\n\tbuffer_append_c (buf, '\"');\n\tfor (size_t i = 0; i < string->len; i++)\n\t{\n\t\tchar c = string->value[i];\n\t\tif (c == '\\n') buffer_append (buf, \"\\\\n\", 2);\n\t\telse if (c == '\\r') buffer_append (buf, \"\\\\r\", 2);\n\t\telse if (c == '\\t') buffer_append (buf, \"\\\\t\", 2);\n\t\telse if (!isprint (c))\n\t\t{\n\t\t\tchar tmp[8];\n\t\t\tsnprintf (tmp, sizeof tmp, \"\\\\x%02x\", (unsigned char) c);\n\t\t\tbuffer_append (buf, tmp, strlen (tmp));\n\t\t}\n\t\telse if (c == '\\\\') buffer_append (buf, \"\\\\\\\\\", 2);\n\t\telse if (c == '\"') buffer_append (buf, \"\\\\\\\"\", 2);\n\t\telse buffer_append_c (buf, c);\n\t}\n\tbuffer_append_c (buf, '\"');\n}\n\nstatic void\nitem_to_str (const struct item *item, struct buffer *buf)\n{\n\tswitch (item->type)\n\t{\n\t\tchar *x;\n\tcase ITEM_STRING:\n\t\tstring_to_str ((struct item_string *) item, buf);\n\t\tbreak;\n\tcase ITEM_WORD:\n\t{\n\t\tstruct item_word *word = (struct item_word *) item;\n\t\tbuffer_append (buf, word->value, word->len);\n\t\tbreak;\n\t}\n\tcase ITEM_INTEGER:\n\t\tif (!(x = strdup_printf (\"%lld\", get_integer (item))))\n\t\t\tgoto alloc_failure;\n\t\tbuffer_append (buf, x, strlen (x));\n\t\tfree (x);\n\t\tbreak;\n\tcase ITEM_FLOAT:\n\t\tif (!(x = strdup_printf (\"%Lf\", get_float (item))))\n\t\t\tgoto alloc_failure;\n\t\tbuffer_append (buf, x, strlen (x));\n\t\tfree (x);\n\t\tbreak;\n\tcase ITEM_LIST:\n\t\tbuffer_append_c (buf, '[');\n\t\titem_list_to_str (get_list (item), buf);\n\t\tbuffer_append_c (buf, ']');\n\t\tbreak;\n\t}\n\treturn;\n\nalloc_failure:\n\t// This is a bit hackish but it simplifies stuff\n\tbuf->memory_failure = true;\n\tfree (buf->s);\n\tbuf->s = NULL;\n}\n\nstatic void\nitem_list_to_str (const struct item *script, struct buffer *buf)\n{\n\tif (!script)\n\t\treturn;\n\n\titem_to_str (script, buf);\n\twhile ((script = script->next))\n\t{\n\t\tbuffer_append_c (buf, ' ');\n\t\titem_to_str (script, buf);\n\t}\n}\n\n// --- IRC protocol ------------------------------------------------------------\n\nstruct message\n{\n\tchar *prefix; ///< Message prefix\n\tchar *command; ///< IRC command\n\tchar *params[16]; ///< Command parameters (0-terminated)\n\tsize_t n_params; ///< Number of parameters present\n};\n\ninline static char *\ncut_word (char **s)\n{\n\tchar *start = *s, *end = *s + strcspn (*s, \" \");\n\t*s = end + strspn (end, \" \");\n\t*end = '\\0';\n\treturn start;\n}\n\nstatic bool\nparse_message (char *s, struct message *msg)\n{\n\tmemset (msg, 0, sizeof *msg);\n\n\t// Ignore IRC 3.2 message tags, if present\n\tif (*s == '@')\n\t{\n\t\ts += strcspn (s, \" \");\n\t\ts += strspn (s, \" \");\n\t}\n\n\t// Prefix\n\tif (*s == ':')\n\t\tmsg->prefix = cut_word (&s) + 1;\n\n\t// Command\n\tif (!*(msg->command = cut_word (&s)))\n\t\treturn false;\n\n\t// Parameters\n\twhile (*s)\n\t{\n\t\tsize_t n = msg->n_params++;\n\t\tif (msg->n_params >= N_ELEMENTS (msg->params))\n\t\t\treturn false;\n\t\tif (*s == ':')\n\t\t{\n\t\t\tmsg->params[n] = ++s;\n\t\t\tbreak;\n\t\t}\n\t\tmsg->params[n] = cut_word (&s);\n\t}\n\treturn true;\n}\n\nstatic struct message *\nread_message (void)\n{\n\tstatic bool discard = false;\n\tstatic char buf[1025];\n\tstatic struct message msg;\n\n\tbool discard_this;\n\tdo\n\t{\n\t\tif (!fgets (buf, sizeof buf, stdin))\n\t\t\treturn NULL;\n\t\tsize_t len = strlen (buf);\n\n\t\t// Just to be on the safe side, if the line overflows our buffer,\n\t\t// ignore everything up until the next line.\n\t\tdiscard_this = discard;\n\t\tif (len >= 2 && !strcmp (buf + len - 2, \"\\r\\n\"))\n\t\t{\n\t\t\tbuf[len -= 2] = '\\0';\n\t\t\tdiscard = false;\n\t\t}\n\t\telse\n\t\t\tdiscard = true;\n\t}\n\t// Invalid messages are silently ignored\n\twhile (discard_this || !parse_message (buf, &msg));\n\treturn &msg;\n}\n\n// --- Interfacing with the bot ------------------------------------------------\n\n#define BOT_PRINT \"ZYKLONB print :script: \"\n\nstatic const char *\nget_config (const char *key)\n{\n\tprintf (\"ZYKLONB get_config :%s\\r\\n\", key);\n\tstruct message *msg = read_message ();\n\tif (!msg || msg->n_params <= 0)\n\t\texit (EXIT_FAILURE);\n\treturn msg->params[0];\n}\n\n// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\n\n// TODO: implement more functions; try to avoid writing them in C\n\nstatic bool\ninit_runtime_library_scripts (void)\n{\n\tbool ok = true;\n\n\t// It's much cheaper (and more fun) to define functions in terms of other\n\t// ones. The \"unit tests\" serve a secondary purpose of showing the usage.\n\tstruct script\n\t{\n\t\tconst char *name; ///< Name of the function\n\t\tconst char *definition; ///< The defining script\n\t\tconst char *unit_test; ///< Trivial unit test, must return 1\n\t}\n\tscripts[] =\n\t{\n\t\t{ \"nip\", \"swap drop\", \"1 2 nip 2 =\" },\n\t\t{ \"over\", \"[dup] dip swap\", \"1 2 over nip nip 1 =\" },\n\t\t{ \"swons\", \"swap cons\", \"[2] 1 swons [1 2] =\" },\n\t\t{ \"first\", \"uncons drop\", \"[1 2 3] first 1 =\" },\n\t\t{ \"rest\", \"uncons swap drop\", \"[1 2 3] rest [2 3] =\" },\n\t\t{ \"reverse\", \"[] swap [swap cons] each\", \"[1 2] reverse [2 1] =\" },\n\t\t{ \"curry\", \"cons\", \"1 2 [+] curry call 3 =\" },\n\n\t\t{ \"xor\", \"not swap not + 1 =\", \"1 1 xor 0 =\" },\n\t\t{ \"min\", \"over over < [drop] [nip] if\", \"1 2 min 1 =\" },\n\t\t{ \"max\", \"over over > [drop] [nip] if\", \"1 2 max 2 =\" },\n\n\t\t{ \"all?\", \"[and] cat 1 swap fold\", \"[3 4 5] [> 3] all? 0 =\" },\n\t\t{ \"any?\", \"[or] cat 0 swap fold\", \"[3 4 5] [> 3] any? 1 =\" },\n\n\t\t{ \">\", \"swap <\", \"1 2 > 0 =\" },\n\t\t{ \"!=\", \"= not\", \"1 2 != 1 =\" },\n\t\t{ \"<=\", \"> not\", \"1 2 <= 1 =\" },\n\t\t{ \">=\", \"< not\", \"1 2 >= 0 =\" },\n\n\t\t// XXX: this is a bit crazy and does not work with an empty list\n\t\t{ \"join\", \"[uncons] dip swap [[dup] dip swap [+ +] dip] each drop\",\n\t\t \"[1 2 3] [>string] map \\\" -> \\\" join \\\"1 -> 2 -> 3\\\" =\" },\n\t};\n\n\tfor (size_t i = 0; i < N_ELEMENTS (scripts); i++)\n\t{\n\t\tconst char *error = NULL;\n\t\tstruct item *script = parse (scripts[i].definition, &error);\n\t\tif (error)\n\t\t{\n\t\t\tprintf (BOT_PRINT \"error parsing internal script `%s': %s\\r\\n\",\n\t\t\t\tscripts[i].definition, error);\n\t\t\tok = false;\n\t\t}\n\t\telse\n\t\t\tok &= register_script (scripts[i].name, script);\n\t}\n\n\tstruct context ctx;\n\tfor (size_t i = 0; i < N_ELEMENTS (scripts); i++)\n\t{\n\t\tconst char *error = NULL;\n\t\tstruct item *script = parse (scripts[i].unit_test, &error);\n\t\tif (error)\n\t\t{\n\t\t\tprintf (BOT_PRINT \"error parsing unit test for `%s': %s\\r\\n\",\n\t\t\t\tscripts[i].name, error);\n\t\t\tok = false;\n\t\t\tcontinue;\n\t\t}\n\t\tcontext_init (&ctx);\n\t\texecute (&ctx, script);\n\t\titem_free_list (script);\n\n\t\tconst char *failure = NULL;\n\t\tif (ctx.memory_failure)\n\t\t\tfailure = \"memory allocation failure\";\n\t\telse if (ctx.error)\n\t\t\tfailure = ctx.error;\n\t\telse if (ctx.stack_size != 1)\n\t\t\tfailure = \"too many results on the stack\";\n\t\telse if (ctx.stack->type != ITEM_INTEGER)\n\t\t\tfailure = \"result is not an integer\";\n\t\telse if (get_integer (ctx.stack) != 1)\n\t\t\tfailure = \"wrong test result\";\n\t\tif (failure)\n\t\t{\n\t\t\tprintf (BOT_PRINT \"error executing unit test for `%s': %s\\r\\n\",\n\t\t\t\tscripts[i].name, failure);\n\t\t\tok = false;\n\t\t}\n\t\tcontext_free (&ctx);\n\t}\n\treturn ok;\n}\n\nstatic bool\ninit_runtime_library (void)\n{\n\tbool ok = true;\n\n\t// Type detection\n\tok &= register_handler (\"string?\", fn_is_string);\n\tok &= register_handler (\"word?\", fn_is_word);\n\tok &= register_handler (\"integer?\", fn_is_integer);\n\tok &= register_handler (\"float?\", fn_is_float);\n\tok &= register_handler (\"list?\", fn_is_list);\n\n\t// Type conversion\n\tok &= register_handler (\">string\", fn_to_string);\n\tok &= register_handler (\">integer\", fn_to_integer);\n\tok &= register_handler (\">float\", fn_to_float);\n\n\t// Miscellaneous\n\tok &= register_handler (\"length\", fn_length);\n\n\t// Basic stack manipulation\n\tok &= register_handler (\"dup\", fn_dup);\n\tok &= register_handler (\"drop\", fn_drop);\n\tok &= register_handler (\"swap\", fn_swap);\n\n\t// Calling stuff\n\tok &= register_handler (\"call\", fn_call);\n\tok &= register_handler (\"dip\", fn_dip);\n\n\t// Control flow\n\tok &= register_handler (\"if\", fn_if);\n\tok &= register_handler (\"try\", fn_try);\n\n\t// List processing\n\tok &= register_handler (\"map\", fn_map);\n\tok &= register_handler (\"filter\", fn_filter);\n\tok &= register_handler (\"fold\", fn_fold);\n\tok &= register_handler (\"each\", fn_each);\n\n\t// List manipulation\n\tok &= register_handler (\"unit\", fn_unit);\n\tok &= register_handler (\"cons\", fn_cons);\n\tok &= register_handler (\"cat\", fn_cat);\n\tok &= register_handler (\"uncons\", fn_uncons);\n\n\t// Arithmetic operations\n\tok &= register_handler (\"+\", fn_plus);\n\tok &= register_handler (\"-\", fn_minus);\n\tok &= register_handler (\"*\", fn_times);\n\tok &= register_handler (\"^\", fn_pow);\n\tok &= register_handler (\"/\", fn_div);\n\tok &= register_handler (\"%\", fn_mod);\n\n\t// Comparison\n\tok &= register_handler (\"=\", fn_eq);\n\tok &= register_handler (\"<\", fn_lt);\n\n\t// Logical operations\n\tok &= register_handler (\"not\", fn_not);\n\tok &= register_handler (\"and\", fn_and);\n\tok &= register_handler (\"or\", fn_or);\n\n\t// Utilities\n\tok &= register_handler (\"rand\", fn_rand);\n\tok &= register_handler (\"time\", fn_time);\n\tok &= register_handler (\"strftime\", fn_strftime);\n\n\tok &= init_runtime_library_scripts ();\n\treturn ok;\n}\n\nstatic void\nfree_runtime_library (void)\n{\n\tstruct fn *next, *iter;\n\tfor (iter = g_functions; iter; iter = next)\n\t{\n\t\tnext = iter->next;\n\t\tfree_function (iter);\n\t}\n}\n\n// --- Function database -------------------------------------------------------\n\n// TODO: a global variable storing the various procedures (db)\n// XXX: defining procedures would ideally need some kind of an ACL\n\nstatic void\nread_db (void)\n{\n\t// TODO\n}\n\nstatic void\nwrite_db (void)\n{\n\t// TODO\n}\n\n// --- Main --------------------------------------------------------------------\n\nstatic char *g_prefix;\n\nstruct user_info\n{\n\tchar *ctx; ///< Context: channel or user\n\tchar *ctx_quote; ///< Reply quotation\n};\n\ndefn (fn_dot)\n{\n\tcheck_stack (1);\n\tstruct item *item = pop (ctx);\n\tstruct user_info *info = ctx->user_data;\n\n\tstruct buffer buf = BUFFER_INITIALIZER;\n\titem_to_str (item, &buf);\n\titem_free (item);\n\tbuffer_append_c (&buf, '\\0');\n\tif (buf.memory_failure)\n\t{\n\t\tctx->memory_failure = true;\n\t\treturn false;\n\t}\n\n\tif (buf.len > 255)\n\t\tbuf.s[255] = '\\0';\n\n\tprintf (\"PRIVMSG %s :%s%s\\r\\n\", info->ctx, info->ctx_quote, buf.s);\n\tfree (buf.s);\n\treturn true;\n}\n\nstatic void\nprocess_message (struct message *msg)\n{\n\tif (!msg->prefix\n\t || strcasecmp (msg->command, \"PRIVMSG\")\n\t || msg->n_params < 2)\n\t\treturn;\n\tchar *line = msg->params[1];\n\n\t// Filter out only our commands\n\tsize_t prefix_len = strlen (g_prefix);\n\tif (strncmp (line, g_prefix, prefix_len))\n\t\treturn;\n\tline += prefix_len;\n\n\tchar *command = cut_word (&line);\n\tif (strcasecmp (command, \"script\"))\n\t\treturn;\n\n\t// Retrieve information on how to respond back\n\tchar *msg_ctx = msg->prefix, *x;\n\tif ((x = strchr (msg_ctx, '!')))\n\t\t*x = '\\0';\n\n\tchar *msg_ctx_quote;\n\tif (strchr (\"#+&!\", *msg->params[0]))\n\t{\n\t\tmsg_ctx_quote = strdup_printf (\"%s: \", msg_ctx);\n\t\tmsg_ctx = msg->params[0];\n\t}\n\telse\n\t\tmsg_ctx_quote = strdup (\"\");\n\n\tif (!msg_ctx_quote)\n\t{\n\t\tprintf (BOT_PRINT \"%s\\r\\n\", \"memory allocation failure\");\n\t\treturn;\n\t}\n\n\tstruct user_info info;\n\tinfo.ctx = msg_ctx;\n\tinfo.ctx_quote = msg_ctx_quote;\n\n\t// Finally parse and execute the macro\n\tconst char *error = NULL;\n\tstruct item *script = parse (line, &error);\n\tif (error)\n\t{\n\t\tprintf (\"PRIVMSG %s :%s%s: %s\\r\\n\",\n\t\t\tmsg_ctx, msg_ctx_quote, \"parse error\", error);\n\t\tgoto end;\n\t}\n\n\tstruct context ctx;\n\tcontext_init (&ctx);\n\tctx.user_data = &info;\n\texecute (&ctx, script);\n\titem_free_list (script);\n\n\tconst char *failure = NULL;\n\tif (ctx.memory_failure)\n\t\tfailure = \"memory allocation failure\";\n\telse if (ctx.error)\n\t\tfailure = ctx.error;\n\tif (failure)\n\t\tprintf (\"PRIVMSG %s :%s%s: %s\\r\\n\",\n\t\t\tmsg_ctx, msg_ctx_quote, \"runtime error\", failure);\n\tcontext_free (&ctx);\nend:\n\tfree (msg_ctx_quote);\n}\n\nint\nmain (int argc, char *argv[])\n{\n\tfreopen (NULL, \"rb\", stdin); setvbuf (stdin, NULL, _IOLBF, BUFSIZ);\n\tfreopen (NULL, \"wb\", stdout); setvbuf (stdout, NULL, _IOLBF, BUFSIZ);\n\n\tstruct rlimit limit =\n\t{\n\t\t.rlim_cur = ADDRESS_SPACE_LIMIT,\n\t\t.rlim_max = ADDRESS_SPACE_LIMIT\n\t};\n\n\t// Lower the memory limits to something sensible to prevent abuse\n\t(void) setrlimit (RLIMIT_AS, &limit);\n\n\tread_db ();\n\tif (!init_runtime_library ()\n\t || !register_handler (\".\", fn_dot))\n\t\tprintf (BOT_PRINT \"%s\\r\\n\", \"runtime library initialization failed\");\n\n\tg_prefix = strdup (get_config (\"prefix\"));\n\tprintf (\"ZYKLONB register\\r\\n\");\n\tstruct message *msg;\n\twhile ((msg = read_message ()))\n\t\tprocess_message (msg);\n\n\tfree_runtime_library ();\n\tfree (g_prefix);\n\treturn 0;\n}\n\n" }, { "path": "src/test/resources/samples/langs/C/sgd_fast.c", "content": "/* Generated by Cython 0.17.4 on Mon Jan 7 18:29:40 2013 */\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 < 0x02040000\n #error Cython requires Python 2.4+.\n#else\n#include /* For offsetof */\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#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_CPYTHON 0\n#else\n#define CYTHON_COMPILING_IN_PYPY 0\n#define CYTHON_COMPILING_IN_CPYTHON 1\n#endif\n#if PY_VERSION_HEX < 0x02050000\n typedef int Py_ssize_t;\n #define PY_SSIZE_T_MAX INT_MAX\n #define PY_SSIZE_T_MIN INT_MIN\n #define PY_FORMAT_SIZE_T \"\"\n #define CYTHON_FORMAT_SSIZE_T \"\"\n #define PyInt_FromSsize_t(z) PyInt_FromLong(z)\n #define PyInt_AsSsize_t(o) __Pyx_PyInt_AsInt(o)\n #define PyNumber_Index(o) ((PyNumber_Check(o) && !PyFloat_Check(o)) ? PyNumber_Int(o) : \\\n (PyErr_Format(PyExc_TypeError, \\\n \"expected index value, got %.200s\", Py_TYPE(o)->tp_name), \\\n (PyObject*)0))\n #define __Pyx_PyIndex_Check(o) (PyNumber_Check(o) && !PyFloat_Check(o) && \\\n !PyComplex_Check(o))\n #define PyIndex_Check __Pyx_PyIndex_Check\n #define PyErr_WarnEx(category, message, stacklevel) PyErr_Warn(category, message)\n #define __PYX_BUILD_PY_SSIZE_T \"i\"\n#else\n #define __PYX_BUILD_PY_SSIZE_T \"n\"\n #define CYTHON_FORMAT_SSIZE_T \"z\"\n #define __Pyx_PyIndex_Check PyIndex_Check\n#endif\n#if PY_VERSION_HEX < 0x02060000\n #define Py_REFCNT(ob) (((PyObject*)(ob))->ob_refcnt)\n #define Py_TYPE(ob) (((PyObject*)(ob))->ob_type)\n #define Py_SIZE(ob) (((PyVarObject*)(ob))->ob_size)\n #define PyVarObject_HEAD_INIT(type, size) \\\n PyObject_HEAD_INIT(type) size,\n #define PyType_Modified(t)\n typedef struct {\n void *buf;\n PyObject *obj;\n Py_ssize_t len;\n Py_ssize_t itemsize;\n int readonly;\n int ndim;\n char *format;\n Py_ssize_t *shape;\n Py_ssize_t *strides;\n Py_ssize_t *suboffsets;\n void *internal;\n } Py_buffer;\n #define PyBUF_SIMPLE 0\n #define PyBUF_WRITABLE 0x0001\n #define PyBUF_FORMAT 0x0004\n #define PyBUF_ND 0x0008\n #define PyBUF_STRIDES (0x0010 | PyBUF_ND)\n #define PyBUF_C_CONTIGUOUS (0x0020 | PyBUF_STRIDES)\n #define PyBUF_F_CONTIGUOUS (0x0040 | PyBUF_STRIDES)\n #define PyBUF_ANY_CONTIGUOUS (0x0080 | PyBUF_STRIDES)\n #define PyBUF_INDIRECT (0x0100 | PyBUF_STRIDES)\n #define PyBUF_RECORDS (PyBUF_STRIDES | PyBUF_FORMAT | PyBUF_WRITABLE)\n #define PyBUF_FULL (PyBUF_INDIRECT | PyBUF_FORMAT | PyBUF_WRITABLE)\n typedef int (*getbufferproc)(PyObject *, Py_buffer *, int);\n typedef void (*releasebufferproc)(PyObject *, Py_buffer *);\n#endif\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, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos)\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#endif\n#if PY_MAJOR_VERSION < 3 && PY_MINOR_VERSION < 6\n #define PyUnicode_FromString(s) PyUnicode_Decode(s, strlen(s), \"UTF-8\", \"strict\")\n#endif\n#if PY_MAJOR_VERSION >= 3\n #define Py_TPFLAGS_CHECKTYPES 0\n #define Py_TPFLAGS_HAVE_INDEX 0\n#endif\n#if (PY_VERSION_HEX < 0x02060000) || (PY_MAJOR_VERSION >= 3)\n #define Py_TPFLAGS_HAVE_NEWBUFFER 0\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_READ(k, d, i) PyUnicode_READ(k, d, i)\n#else\n #define CYTHON_PEP393_ENABLED 0\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_READ(k, d, i) ((k=k), (Py_UCS4)(((Py_UNICODE*)d)[i]))\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_VERSION_HEX < 0x02060000\n #define PyBytesObject PyStringObject\n #define PyBytes_Type PyString_Type\n #define PyBytes_Check PyString_Check\n #define PyBytes_CheckExact PyString_CheckExact\n #define PyBytes_FromString PyString_FromString\n #define PyBytes_FromStringAndSize PyString_FromStringAndSize\n #define PyBytes_FromFormat PyString_FromFormat\n #define PyBytes_DecodeEscape PyString_DecodeEscape\n #define PyBytes_AsString PyString_AsString\n #define PyBytes_AsStringAndSize PyString_AsStringAndSize\n #define PyBytes_Size PyString_Size\n #define PyBytes_AS_STRING PyString_AS_STRING\n #define PyBytes_GET_SIZE PyString_GET_SIZE\n #define PyBytes_Repr PyString_Repr\n #define PyBytes_Concat PyString_Concat\n #define PyBytes_ConcatAndDel PyString_ConcatAndDel\n#endif\n#if PY_VERSION_HEX < 0x02060000\n #define PySet_Check(obj) PyObject_TypeCheck(obj, &PySet_Type)\n #define PyFrozenSet_Check(obj) PyObject_TypeCheck(obj, &PyFrozenSet_Type)\n#endif\n#ifndef PySet_CheckExact\n #define PySet_CheckExact(obj) (Py_TYPE(obj) == &PySet_Type)\n#endif\n#define __Pyx_TypeCheck(obj, type) PyObject_TypeCheck(obj, (PyTypeObject *)type)\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#endif\n#if PY_MAJOR_VERSION >= 3\n #define PyBoolObject PyLongObject\n#endif\n#if PY_VERSION_HEX < 0x03020000\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) || (PY_VERSION_HEX >= 0x03010300)\n #define __Pyx_PySequence_GetSlice(obj, a, b) PySequence_GetSlice(obj, a, b)\n #define __Pyx_PySequence_SetSlice(obj, a, b, value) PySequence_SetSlice(obj, a, b, value)\n #define __Pyx_PySequence_DelSlice(obj, a, b) PySequence_DelSlice(obj, a, b)\n#else\n #define __Pyx_PySequence_GetSlice(obj, a, b) (unlikely(!(obj)) ? \\\n (PyErr_SetString(PyExc_SystemError, \"null argument to internal routine\"), (PyObject*)0) : \\\n (likely((obj)->ob_type->tp_as_mapping) ? (PySequence_GetSlice(obj, a, b)) : \\\n (PyErr_Format(PyExc_TypeError, \"'%.200s' object is unsliceable\", (obj)->ob_type->tp_name), (PyObject*)0)))\n #define __Pyx_PySequence_SetSlice(obj, a, b, value) (unlikely(!(obj)) ? \\\n (PyErr_SetString(PyExc_SystemError, \"null argument to internal routine\"), -1) : \\\n (likely((obj)->ob_type->tp_as_mapping) ? (PySequence_SetSlice(obj, a, b, value)) : \\\n (PyErr_Format(PyExc_TypeError, \"'%.200s' object doesn't support slice assignment\", (obj)->ob_type->tp_name), -1)))\n #define __Pyx_PySequence_DelSlice(obj, a, b) (unlikely(!(obj)) ? \\\n (PyErr_SetString(PyExc_SystemError, \"null argument to internal routine\"), -1) : \\\n (likely((obj)->ob_type->tp_as_mapping) ? (PySequence_DelSlice(obj, a, b)) : \\\n (PyErr_Format(PyExc_TypeError, \"'%.200s' object doesn't support slice deletion\", (obj)->ob_type->tp_name), -1)))\n#endif\n#if PY_MAJOR_VERSION >= 3\n #define PyMethod_New(func, self, klass) ((self) ? PyMethod_New(func, self) : PyInstanceMethod_New(func))\n#endif\n#if PY_VERSION_HEX < 0x02050000\n #define __Pyx_GetAttrString(o,n) PyObject_GetAttrString((o),((char *)(n)))\n #define __Pyx_SetAttrString(o,n,a) PyObject_SetAttrString((o),((char *)(n)),(a))\n #define __Pyx_DelAttrString(o,n) PyObject_DelAttrString((o),((char *)(n)))\n#else\n #define __Pyx_GetAttrString(o,n) PyObject_GetAttrString((o),(n))\n #define __Pyx_SetAttrString(o,n,a) PyObject_SetAttrString((o),(n),(a))\n #define __Pyx_DelAttrString(o,n) PyObject_DelAttrString((o),(n))\n#endif\n#if PY_VERSION_HEX < 0x02050000\n #define __Pyx_NAMESTR(n) ((char *)(n))\n #define __Pyx_DOCSTR(n) ((char *)(n))\n#else\n #define __Pyx_NAMESTR(n) (n)\n #define __Pyx_DOCSTR(n) (n)\n#endif\n\n\n#if PY_MAJOR_VERSION >= 3\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\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#if defined(WIN32) || defined(MS_WINDOWS)\n#define _USE_MATH_DEFINES\n#endif\n#include \n#define __PYX_HAVE__sklearn__linear_model__sgd_fast\n#define __PYX_HAVE_API__sklearn__linear_model__sgd_fast\n#include \"math.h\"\n#include \"stdio.h\"\n#include \"stdlib.h\"\n#include \"numpy/arrayobject.h\"\n#include \"numpy/ufuncobject.h\"\n#ifdef _OPENMP\n#include \n#endif /* _OPENMP */\n\n#ifdef PYREX_WITHOUT_ASSERTIONS\n#define CYTHON_WITHOUT_ASSERTIONS\n#endif\n\n\n/* inline attribute */\n#ifndef CYTHON_INLINE\n #if defined(__GNUC__)\n #define CYTHON_INLINE __inline__\n #elif defined(_MSC_VER)\n #define CYTHON_INLINE __inline\n #elif defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L\n #define CYTHON_INLINE inline\n #else\n #define CYTHON_INLINE\n #endif\n#endif\n\n/* unused attribute */\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\ntypedef struct {PyObject **p; char *s; const long n; const char* encoding; const char is_unicode; const char is_str; const char intern; } __Pyx_StringTabEntry; /*proto*/\n\n\n/* Type Conversion Predeclarations */\n\n#define __Pyx_PyBytes_FromUString(s) PyBytes_FromString((char*)s)\n#define __Pyx_PyBytes_AsUString(s) ((unsigned char*) PyBytes_AsString(s))\n\n#define __Pyx_Owned_Py_None(b) (Py_INCREF(Py_None), Py_None)\n#define __Pyx_PyBool_FromLong(b) ((b) ? (Py_INCREF(Py_True), Py_True) : (Py_INCREF(Py_False), Py_False))\nstatic CYTHON_INLINE int __Pyx_PyObject_IsTrue(PyObject*);\nstatic CYTHON_INLINE PyObject* __Pyx_PyNumber_Int(PyObject* x);\n\nstatic CYTHON_INLINE Py_ssize_t __Pyx_PyIndex_AsSsize_t(PyObject*);\nstatic CYTHON_INLINE PyObject * __Pyx_PyInt_FromSize_t(size_t);\nstatic CYTHON_INLINE size_t __Pyx_PyInt_AsSize_t(PyObject*);\n\n#if CYTHON_COMPILING_IN_CPYTHON\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\n#ifdef __GNUC__\n /* Test for GCC > 2.95 */\n #if __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__ > 2 ... */\n #define likely(x) (x)\n #define unlikely(x) (x)\n #endif /* __GNUC__ > 2 ... */\n#else /* __GNUC__ */\n #define likely(x) (x)\n #define unlikely(x) (x)\n#endif /* __GNUC__ */\n \nstatic PyObject *__pyx_m;\nstatic PyObject *__pyx_b;\nstatic PyObject *__pyx_empty_tuple;\nstatic PyObject *__pyx_empty_bytes;\nstatic int __pyx_lineno;\nstatic int __pyx_clineno = 0;\nstatic const char * __pyx_cfilenm= __FILE__;\nstatic const char *__pyx_filename;\n\n#if !defined(CYTHON_CCOMPLEX)\n #if defined(__cplusplus)\n #define CYTHON_CCOMPLEX 1\n #elif defined(_Complex_I)\n #define CYTHON_CCOMPLEX 1\n #else\n #define CYTHON_CCOMPLEX 0\n #endif\n#endif\n#if CYTHON_CCOMPLEX\n #ifdef __cplusplus\n #include \n #else\n #include \n #endif\n#endif\n#if CYTHON_CCOMPLEX && !defined(__cplusplus) && defined(__sun__) && defined(__GNUC__)\n #undef _Complex_I\n #define _Complex_I 1.0fj\n#endif\n\n\nstatic const char *__pyx_f[] = {\n \"sgd_fast.pyx\",\n \"numpy.pxd\",\n \"type.pxd\",\n \"weight_vector.pxd\",\n \"seq_dataset.pxd\",\n};\n#define IS_UNSIGNED(type) (((type) -1) > 0)\nstruct __Pyx_StructField_;\n#define __PYX_BUF_FLAGS_PACKED_STRUCT (1 << 0)\ntypedef struct {\n const char* name; /* for error messages only */\n struct __Pyx_StructField_* fields;\n size_t size; /* sizeof(type) */\n size_t arraysize[8]; /* length of array in each dimension */\n int ndim;\n char typegroup; /* _R_eal, _C_omplex, Signed _I_nt, _U_nsigned int, _S_truct, _P_ointer, _O_bject, c_H_ar */\n char is_unsigned;\n int flags;\n} __Pyx_TypeInfo;\ntypedef struct __Pyx_StructField_ {\n __Pyx_TypeInfo* type;\n const char* name;\n size_t offset;\n} __Pyx_StructField;\ntypedef struct {\n __Pyx_StructField* field;\n size_t parent_offset;\n} __Pyx_BufFmt_StackElem;\ntypedef struct {\n __Pyx_StructField root;\n __Pyx_BufFmt_StackElem* head;\n size_t fmt_offset;\n size_t new_count, enc_count;\n size_t struct_alignment;\n int is_complex;\n char enc_type;\n char new_packmode;\n char enc_packmode;\n char is_valid_array;\n} __Pyx_BufFmt_Context;\n\n\n/* \"numpy.pxd\":723\n * # in Cython to enable them only on the right systems.\n * \n * ctypedef npy_int8 int8_t # <<<<<<<<<<<<<<\n * ctypedef npy_int16 int16_t\n * ctypedef npy_int32 int32_t\n */\ntypedef npy_int8 __pyx_t_5numpy_int8_t;\n\n/* \"numpy.pxd\":724\n * \n * ctypedef npy_int8 int8_t\n * ctypedef npy_int16 int16_t # <<<<<<<<<<<<<<\n * ctypedef npy_int32 int32_t\n * ctypedef npy_int64 int64_t\n */\ntypedef npy_int16 __pyx_t_5numpy_int16_t;\n\n/* \"numpy.pxd\":725\n * ctypedef npy_int8 int8_t\n * ctypedef npy_int16 int16_t\n * ctypedef npy_int32 int32_t # <<<<<<<<<<<<<<\n * ctypedef npy_int64 int64_t\n * #ctypedef npy_int96 int96_t\n */\ntypedef npy_int32 __pyx_t_5numpy_int32_t;\n\n/* \"numpy.pxd\":726\n * ctypedef npy_int16 int16_t\n * ctypedef npy_int32 int32_t\n * ctypedef npy_int64 int64_t # <<<<<<<<<<<<<<\n * #ctypedef npy_int96 int96_t\n * #ctypedef npy_int128 int128_t\n */\ntypedef npy_int64 __pyx_t_5numpy_int64_t;\n\n/* \"numpy.pxd\":730\n * #ctypedef npy_int128 int128_t\n * \n * ctypedef npy_uint8 uint8_t # <<<<<<<<<<<<<<\n * ctypedef npy_uint16 uint16_t\n * ctypedef npy_uint32 uint32_t\n */\ntypedef npy_uint8 __pyx_t_5numpy_uint8_t;\n\n/* \"numpy.pxd\":731\n * \n * ctypedef npy_uint8 uint8_t\n * ctypedef npy_uint16 uint16_t # <<<<<<<<<<<<<<\n * ctypedef npy_uint32 uint32_t\n * ctypedef npy_uint64 uint64_t\n */\ntypedef npy_uint16 __pyx_t_5numpy_uint16_t;\n\n/* \"numpy.pxd\":732\n * ctypedef npy_uint8 uint8_t\n * ctypedef npy_uint16 uint16_t\n * ctypedef npy_uint32 uint32_t # <<<<<<<<<<<<<<\n * ctypedef npy_uint64 uint64_t\n * #ctypedef npy_uint96 uint96_t\n */\ntypedef npy_uint32 __pyx_t_5numpy_uint32_t;\n\n/* \"numpy.pxd\":733\n * ctypedef npy_uint16 uint16_t\n * ctypedef npy_uint32 uint32_t\n * ctypedef npy_uint64 uint64_t # <<<<<<<<<<<<<<\n * #ctypedef npy_uint96 uint96_t\n * #ctypedef npy_uint128 uint128_t\n */\ntypedef npy_uint64 __pyx_t_5numpy_uint64_t;\n\n/* \"numpy.pxd\":737\n * #ctypedef npy_uint128 uint128_t\n * \n * ctypedef npy_float32 float32_t # <<<<<<<<<<<<<<\n * ctypedef npy_float64 float64_t\n * #ctypedef npy_float80 float80_t\n */\ntypedef npy_float32 __pyx_t_5numpy_float32_t;\n\n/* \"numpy.pxd\":738\n * \n * ctypedef npy_float32 float32_t\n * ctypedef npy_float64 float64_t # <<<<<<<<<<<<<<\n * #ctypedef npy_float80 float80_t\n * #ctypedef npy_float128 float128_t\n */\ntypedef npy_float64 __pyx_t_5numpy_float64_t;\n\n/* \"numpy.pxd\":747\n * # The int types are mapped a bit surprising --\n * # numpy.int corresponds to 'l' and numpy.long to 'q'\n * ctypedef npy_long int_t # <<<<<<<<<<<<<<\n * ctypedef npy_longlong long_t\n * ctypedef npy_longlong longlong_t\n */\ntypedef npy_long __pyx_t_5numpy_int_t;\n\n/* \"numpy.pxd\":748\n * # numpy.int corresponds to 'l' and numpy.long to 'q'\n * ctypedef npy_long int_t\n * ctypedef npy_longlong long_t # <<<<<<<<<<<<<<\n * ctypedef npy_longlong longlong_t\n * \n */\ntypedef npy_longlong __pyx_t_5numpy_long_t;\n\n/* \"numpy.pxd\":749\n * ctypedef npy_long int_t\n * ctypedef npy_longlong long_t\n * ctypedef npy_longlong longlong_t # <<<<<<<<<<<<<<\n * \n * ctypedef npy_ulong uint_t\n */\ntypedef npy_longlong __pyx_t_5numpy_longlong_t;\n\n/* \"numpy.pxd\":751\n * ctypedef npy_longlong longlong_t\n * \n * ctypedef npy_ulong uint_t # <<<<<<<<<<<<<<\n * ctypedef npy_ulonglong ulong_t\n * ctypedef npy_ulonglong ulonglong_t\n */\ntypedef npy_ulong __pyx_t_5numpy_uint_t;\n\n/* \"numpy.pxd\":752\n * \n * ctypedef npy_ulong uint_t\n * ctypedef npy_ulonglong ulong_t # <<<<<<<<<<<<<<\n * ctypedef npy_ulonglong ulonglong_t\n * \n */\ntypedef npy_ulonglong __pyx_t_5numpy_ulong_t;\n\n/* \"numpy.pxd\":753\n * ctypedef npy_ulong uint_t\n * ctypedef npy_ulonglong ulong_t\n * ctypedef npy_ulonglong ulonglong_t # <<<<<<<<<<<<<<\n * \n * ctypedef npy_intp intp_t\n */\ntypedef npy_ulonglong __pyx_t_5numpy_ulonglong_t;\n\n/* \"numpy.pxd\":755\n * ctypedef npy_ulonglong ulonglong_t\n * \n * ctypedef npy_intp intp_t # <<<<<<<<<<<<<<\n * ctypedef npy_uintp uintp_t\n * \n */\ntypedef npy_intp __pyx_t_5numpy_intp_t;\n\n/* \"numpy.pxd\":756\n * \n * ctypedef npy_intp intp_t\n * ctypedef npy_uintp uintp_t # <<<<<<<<<<<<<<\n * \n * ctypedef npy_double float_t\n */\ntypedef npy_uintp __pyx_t_5numpy_uintp_t;\n\n/* \"numpy.pxd\":758\n * ctypedef npy_uintp uintp_t\n * \n * ctypedef npy_double float_t # <<<<<<<<<<<<<<\n * ctypedef npy_double double_t\n * ctypedef npy_longdouble longdouble_t\n */\ntypedef npy_double __pyx_t_5numpy_float_t;\n\n/* \"numpy.pxd\":759\n * \n * ctypedef npy_double float_t\n * ctypedef npy_double double_t # <<<<<<<<<<<<<<\n * ctypedef npy_longdouble longdouble_t\n * \n */\ntypedef npy_double __pyx_t_5numpy_double_t;\n\n/* \"numpy.pxd\":760\n * ctypedef npy_double float_t\n * ctypedef npy_double double_t\n * ctypedef npy_longdouble longdouble_t # <<<<<<<<<<<<<<\n * \n * ctypedef npy_cfloat cfloat_t\n */\ntypedef npy_longdouble __pyx_t_5numpy_longdouble_t;\n\n/* \"sklearn/utils/weight_vector.pxd\":10\n * \n * \n * ctypedef np.float64_t DOUBLE # <<<<<<<<<<<<<<\n * ctypedef np.int32_t INTEGER\n * \n */\ntypedef __pyx_t_5numpy_float64_t __pyx_t_7sklearn_5utils_13weight_vector_DOUBLE;\n\n/* \"sklearn/utils/weight_vector.pxd\":11\n * \n * ctypedef np.float64_t DOUBLE\n * ctypedef np.int32_t INTEGER # <<<<<<<<<<<<<<\n * \n * \n */\ntypedef __pyx_t_5numpy_int32_t __pyx_t_7sklearn_5utils_13weight_vector_INTEGER;\n\n/* \"sklearn/utils/seq_dataset.pxd\":5\n * cimport numpy as np\n * \n * ctypedef np.float64_t DOUBLE # <<<<<<<<<<<<<<\n * ctypedef np.int32_t INTEGER\n * \n */\ntypedef __pyx_t_5numpy_float64_t __pyx_t_7sklearn_5utils_11seq_dataset_DOUBLE;\n\n/* \"sklearn/utils/seq_dataset.pxd\":6\n * \n * ctypedef np.float64_t DOUBLE\n * ctypedef np.int32_t INTEGER # <<<<<<<<<<<<<<\n * \n * \n */\ntypedef __pyx_t_5numpy_int32_t __pyx_t_7sklearn_5utils_11seq_dataset_INTEGER;\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":25\n * \n * \n * ctypedef np.float64_t DOUBLE # <<<<<<<<<<<<<<\n * ctypedef np.int32_t INTEGER\n * \n */\ntypedef __pyx_t_5numpy_float64_t __pyx_t_7sklearn_12linear_model_8sgd_fast_DOUBLE;\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":26\n * \n * ctypedef np.float64_t DOUBLE\n * ctypedef np.int32_t INTEGER # <<<<<<<<<<<<<<\n * \n * \n */\ntypedef __pyx_t_5numpy_int32_t __pyx_t_7sklearn_12linear_model_8sgd_fast_INTEGER;\n#if CYTHON_CCOMPLEX\n #ifdef __cplusplus\n typedef ::std::complex< float > __pyx_t_float_complex;\n #else\n typedef float _Complex __pyx_t_float_complex;\n #endif\n#else\n typedef struct { float real, imag; } __pyx_t_float_complex;\n#endif\n\n#if CYTHON_CCOMPLEX\n #ifdef __cplusplus\n typedef ::std::complex< double > __pyx_t_double_complex;\n #else\n typedef double _Complex __pyx_t_double_complex;\n #endif\n#else\n typedef struct { double real, imag; } __pyx_t_double_complex;\n#endif\n\n\n/*--- Type declarations ---*/\nstruct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction;\nstruct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Regression;\nstruct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Huber;\nstruct __pyx_obj_7sklearn_5utils_11seq_dataset_SequentialDataset;\nstruct __pyx_obj_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive;\nstruct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Classification;\nstruct __pyx_obj_7sklearn_5utils_11seq_dataset_CSRDataset;\nstruct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Log;\nstruct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Hinge;\nstruct __pyx_obj_7sklearn_5utils_11seq_dataset_ArrayDataset;\nstruct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredHinge;\nstruct __pyx_obj_7sklearn_12linear_model_8sgd_fast_ModifiedHuber;\nstruct __pyx_obj_7sklearn_5utils_13weight_vector_WeightVector;\nstruct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredLoss;\nstruct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive;\n\n/* \"numpy.pxd\":762\n * ctypedef npy_longdouble longdouble_t\n * \n * ctypedef npy_cfloat cfloat_t # <<<<<<<<<<<<<<\n * ctypedef npy_cdouble cdouble_t\n * ctypedef npy_clongdouble clongdouble_t\n */\ntypedef npy_cfloat __pyx_t_5numpy_cfloat_t;\n\n/* \"numpy.pxd\":763\n * \n * ctypedef npy_cfloat cfloat_t\n * ctypedef npy_cdouble cdouble_t # <<<<<<<<<<<<<<\n * ctypedef npy_clongdouble clongdouble_t\n * \n */\ntypedef npy_cdouble __pyx_t_5numpy_cdouble_t;\n\n/* \"numpy.pxd\":764\n * ctypedef npy_cfloat cfloat_t\n * ctypedef npy_cdouble cdouble_t\n * ctypedef npy_clongdouble clongdouble_t # <<<<<<<<<<<<<<\n * \n * ctypedef npy_cdouble complex_t\n */\ntypedef npy_clongdouble __pyx_t_5numpy_clongdouble_t;\n\n/* \"numpy.pxd\":766\n * ctypedef npy_clongdouble clongdouble_t\n * \n * ctypedef npy_cdouble complex_t # <<<<<<<<<<<<<<\n * \n * cdef inline object PyArray_MultiIterNew1(a):\n */\ntypedef npy_cdouble __pyx_t_5numpy_complex_t;\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":46\n * # ----------------------------------------\n * \n * cdef class LossFunction: # <<<<<<<<<<<<<<\n * \"\"\"Base class for convex loss functions\"\"\"\n * \n */\nstruct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction {\n PyObject_HEAD\n struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_LossFunction *__pyx_vtab;\n};\n\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":84\n * \n * \n * cdef class Regression(LossFunction): # <<<<<<<<<<<<<<\n * \"\"\"Base class for loss functions for regression\"\"\"\n * \n */\nstruct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Regression {\n struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction __pyx_base;\n};\n\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":235\n * \n * \n * cdef class Huber(Regression): # <<<<<<<<<<<<<<\n * \"\"\"Huber regression loss\n * \n */\nstruct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Huber {\n struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Regression __pyx_base;\n double c;\n};\n\n\n/* \"sklearn/utils/seq_dataset.pxd\":9\n * \n * \n * cdef class SequentialDataset: # <<<<<<<<<<<<<<\n * cdef Py_ssize_t n_samples\n * \n */\nstruct __pyx_obj_7sklearn_5utils_11seq_dataset_SequentialDataset {\n PyObject_HEAD\n struct __pyx_vtabstruct_7sklearn_5utils_11seq_dataset_SequentialDataset *__pyx_vtab;\n Py_ssize_t n_samples;\n};\n\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":271\n * \n * \n * cdef class EpsilonInsensitive(Regression): # <<<<<<<<<<<<<<\n * \"\"\"Epsilon-Insensitive loss (used by SVR).\n * \n */\nstruct __pyx_obj_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive {\n struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Regression __pyx_base;\n double epsilon;\n};\n\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":94\n * \n * \n * cdef class Classification(LossFunction): # <<<<<<<<<<<<<<\n * \"\"\"Base class for loss functions for classification\"\"\"\n * \n */\nstruct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Classification {\n struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction __pyx_base;\n};\n\n\n/* \"sklearn/utils/seq_dataset.pxd\":34\n * \n * \n * cdef class CSRDataset(SequentialDataset): # <<<<<<<<<<<<<<\n * cdef int current_index\n * cdef int stride\n */\nstruct __pyx_obj_7sklearn_5utils_11seq_dataset_CSRDataset {\n struct __pyx_obj_7sklearn_5utils_11seq_dataset_SequentialDataset __pyx_base;\n int current_index;\n int stride;\n __pyx_t_7sklearn_5utils_11seq_dataset_DOUBLE *X_data_ptr;\n __pyx_t_7sklearn_5utils_11seq_dataset_INTEGER *X_indptr_ptr;\n __pyx_t_7sklearn_5utils_11seq_dataset_INTEGER *X_indices_ptr;\n __pyx_t_7sklearn_5utils_11seq_dataset_DOUBLE *Y_data_ptr;\n PyArrayObject *feature_indices;\n __pyx_t_7sklearn_5utils_11seq_dataset_INTEGER *feature_indices_ptr;\n PyArrayObject *index;\n __pyx_t_7sklearn_5utils_11seq_dataset_INTEGER *index_data_ptr;\n __pyx_t_7sklearn_5utils_11seq_dataset_DOUBLE *sample_weight_data;\n};\n\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":198\n * \n * \n * cdef class Log(Classification): # <<<<<<<<<<<<<<\n * \"\"\"Logistic regression loss for binary classification with y in {-1, 1}\"\"\"\n * \n */\nstruct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Log {\n struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Classification __pyx_base;\n};\n\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":134\n * \n * \n * cdef class Hinge(Classification): # <<<<<<<<<<<<<<\n * \"\"\"Hinge loss for binary classification tasks with y in {-1,1}\n * \n */\nstruct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Hinge {\n struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Classification __pyx_base;\n double threshold;\n};\n\n\n/* \"sklearn/utils/seq_dataset.pxd\":17\n * \n * \n * cdef class ArrayDataset(SequentialDataset): # <<<<<<<<<<<<<<\n * cdef Py_ssize_t n_features\n * cdef int current_index\n */\nstruct __pyx_obj_7sklearn_5utils_11seq_dataset_ArrayDataset {\n struct __pyx_obj_7sklearn_5utils_11seq_dataset_SequentialDataset __pyx_base;\n Py_ssize_t n_features;\n int current_index;\n int stride;\n __pyx_t_7sklearn_5utils_11seq_dataset_DOUBLE *X_data_ptr;\n __pyx_t_7sklearn_5utils_11seq_dataset_DOUBLE *Y_data_ptr;\n PyArrayObject *feature_indices;\n __pyx_t_7sklearn_5utils_11seq_dataset_INTEGER *feature_indices_ptr;\n PyArrayObject *index;\n __pyx_t_7sklearn_5utils_11seq_dataset_INTEGER *index_data_ptr;\n __pyx_t_7sklearn_5utils_11seq_dataset_DOUBLE *sample_weight_data;\n};\n\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":166\n * \n * \n * cdef class SquaredHinge(LossFunction): # <<<<<<<<<<<<<<\n * \"\"\"Squared Hinge loss for binary classification tasks with y in {-1,1}\n * \n */\nstruct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredHinge {\n struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction __pyx_base;\n double threshold;\n};\n\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":104\n * \n * \n * cdef class ModifiedHuber(Classification): # <<<<<<<<<<<<<<\n * \"\"\"Modified Huber loss for binary classification with y in {-1, 1}\n * \n */\nstruct __pyx_obj_7sklearn_12linear_model_8sgd_fast_ModifiedHuber {\n struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Classification __pyx_base;\n};\n\n\n/* \"sklearn/utils/weight_vector.pxd\":14\n * \n * \n * cdef class WeightVector(object): # <<<<<<<<<<<<<<\n * cdef np.ndarray w\n * cdef DOUBLE *w_data_ptr\n */\nstruct __pyx_obj_7sklearn_5utils_13weight_vector_WeightVector {\n PyObject_HEAD\n struct __pyx_vtabstruct_7sklearn_5utils_13weight_vector_WeightVector *__pyx_vtab;\n PyArrayObject *w;\n __pyx_t_7sklearn_5utils_13weight_vector_DOUBLE *w_data_ptr;\n double wscale;\n Py_ssize_t n_features;\n double sq_norm;\n};\n\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":223\n * \n * \n * cdef class SquaredLoss(Regression): # <<<<<<<<<<<<<<\n * \"\"\"Squared loss traditional used in linear regression.\"\"\"\n * cpdef double loss(self, double p, double y):\n */\nstruct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredLoss {\n struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Regression __pyx_base;\n};\n\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":298\n * \n * \n * cdef class SquaredEpsilonInsensitive(Regression): # <<<<<<<<<<<<<<\n * \"\"\"Epsilon-Insensitive loss.\n * \n */\nstruct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive {\n struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Regression __pyx_base;\n double epsilon;\n};\n\n\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":46\n * # ----------------------------------------\n * \n * cdef class LossFunction: # <<<<<<<<<<<<<<\n * \"\"\"Base class for convex loss functions\"\"\"\n * \n */\n\nstruct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_LossFunction {\n double (*loss)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch);\n double (*dloss)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch);\n};\nstatic struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_LossFunction *__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_LossFunction;\n\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":84\n * \n * \n * cdef class Regression(LossFunction): # <<<<<<<<<<<<<<\n * \"\"\"Base class for loss functions for regression\"\"\"\n * \n */\n\nstruct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Regression {\n struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_LossFunction __pyx_base;\n};\nstatic struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Regression *__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Regression;\n\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":223\n * \n * \n * cdef class SquaredLoss(Regression): # <<<<<<<<<<<<<<\n * \"\"\"Squared loss traditional used in linear regression.\"\"\"\n * cpdef double loss(self, double p, double y):\n */\n\nstruct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_SquaredLoss {\n struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Regression __pyx_base;\n};\nstatic struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_SquaredLoss *__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_SquaredLoss;\n\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":94\n * \n * \n * cdef class Classification(LossFunction): # <<<<<<<<<<<<<<\n * \"\"\"Base class for loss functions for classification\"\"\"\n * \n */\n\nstruct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Classification {\n struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_LossFunction __pyx_base;\n};\nstatic struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Classification *__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Classification;\n\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":104\n * \n * \n * cdef class ModifiedHuber(Classification): # <<<<<<<<<<<<<<\n * \"\"\"Modified Huber loss for binary classification with y in {-1, 1}\n * \n */\n\nstruct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_ModifiedHuber {\n struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Classification __pyx_base;\n};\nstatic struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_ModifiedHuber *__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_ModifiedHuber;\n\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":198\n * \n * \n * cdef class Log(Classification): # <<<<<<<<<<<<<<\n * \"\"\"Logistic regression loss for binary classification with y in {-1, 1}\"\"\"\n * \n */\n\nstruct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Log {\n struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Classification __pyx_base;\n};\nstatic struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Log *__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Log;\n\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":298\n * \n * \n * cdef class SquaredEpsilonInsensitive(Regression): # <<<<<<<<<<<<<<\n * \"\"\"Epsilon-Insensitive loss.\n * \n */\n\nstruct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive {\n struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Regression __pyx_base;\n};\nstatic struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive *__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive;\n\n\n/* \"sklearn/utils/seq_dataset.pxd\":9\n * \n * \n * cdef class SequentialDataset: # <<<<<<<<<<<<<<\n * cdef Py_ssize_t n_samples\n * \n */\n\nstruct __pyx_vtabstruct_7sklearn_5utils_11seq_dataset_SequentialDataset {\n void (*next)(struct __pyx_obj_7sklearn_5utils_11seq_dataset_SequentialDataset *, __pyx_t_7sklearn_5utils_11seq_dataset_DOUBLE **, __pyx_t_7sklearn_5utils_11seq_dataset_INTEGER **, int *, __pyx_t_7sklearn_5utils_11seq_dataset_DOUBLE *, __pyx_t_7sklearn_5utils_11seq_dataset_DOUBLE *);\n void (*shuffle)(struct __pyx_obj_7sklearn_5utils_11seq_dataset_SequentialDataset *, PyObject *);\n};\nstatic struct __pyx_vtabstruct_7sklearn_5utils_11seq_dataset_SequentialDataset *__pyx_vtabptr_7sklearn_5utils_11seq_dataset_SequentialDataset;\n\n\n/* \"sklearn/utils/seq_dataset.pxd\":17\n * \n * \n * cdef class ArrayDataset(SequentialDataset): # <<<<<<<<<<<<<<\n * cdef Py_ssize_t n_features\n * cdef int current_index\n */\n\nstruct __pyx_vtabstruct_7sklearn_5utils_11seq_dataset_ArrayDataset {\n struct __pyx_vtabstruct_7sklearn_5utils_11seq_dataset_SequentialDataset __pyx_base;\n};\nstatic struct __pyx_vtabstruct_7sklearn_5utils_11seq_dataset_ArrayDataset *__pyx_vtabptr_7sklearn_5utils_11seq_dataset_ArrayDataset;\n\n\n/* \"sklearn/utils/seq_dataset.pxd\":34\n * \n * \n * cdef class CSRDataset(SequentialDataset): # <<<<<<<<<<<<<<\n * cdef int current_index\n * cdef int stride\n */\n\nstruct __pyx_vtabstruct_7sklearn_5utils_11seq_dataset_CSRDataset {\n struct __pyx_vtabstruct_7sklearn_5utils_11seq_dataset_SequentialDataset __pyx_base;\n};\nstatic struct __pyx_vtabstruct_7sklearn_5utils_11seq_dataset_CSRDataset *__pyx_vtabptr_7sklearn_5utils_11seq_dataset_CSRDataset;\n\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":271\n * \n * \n * cdef class EpsilonInsensitive(Regression): # <<<<<<<<<<<<<<\n * \"\"\"Epsilon-Insensitive loss (used by SVR).\n * \n */\n\nstruct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive {\n struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Regression __pyx_base;\n};\nstatic struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive *__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive;\n\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":166\n * \n * \n * cdef class SquaredHinge(LossFunction): # <<<<<<<<<<<<<<\n * \"\"\"Squared Hinge loss for binary classification tasks with y in {-1,1}\n * \n */\n\nstruct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_SquaredHinge {\n struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_LossFunction __pyx_base;\n};\nstatic struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_SquaredHinge *__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_SquaredHinge;\n\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":235\n * \n * \n * cdef class Huber(Regression): # <<<<<<<<<<<<<<\n * \"\"\"Huber regression loss\n * \n */\n\nstruct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Huber {\n struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Regression __pyx_base;\n};\nstatic struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Huber *__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Huber;\n\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":134\n * \n * \n * cdef class Hinge(Classification): # <<<<<<<<<<<<<<\n * \"\"\"Hinge loss for binary classification tasks with y in {-1,1}\n * \n */\n\nstruct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Hinge {\n struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Classification __pyx_base;\n};\nstatic struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Hinge *__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Hinge;\n\n\n/* \"sklearn/utils/weight_vector.pxd\":14\n * \n * \n * cdef class WeightVector(object): # <<<<<<<<<<<<<<\n * cdef np.ndarray w\n * cdef DOUBLE *w_data_ptr\n */\n\nstruct __pyx_vtabstruct_7sklearn_5utils_13weight_vector_WeightVector {\n void (*add)(struct __pyx_obj_7sklearn_5utils_13weight_vector_WeightVector *, __pyx_t_7sklearn_5utils_13weight_vector_DOUBLE *, __pyx_t_7sklearn_5utils_13weight_vector_INTEGER *, int, double);\n double (*dot)(struct __pyx_obj_7sklearn_5utils_13weight_vector_WeightVector *, __pyx_t_7sklearn_5utils_13weight_vector_DOUBLE *, __pyx_t_7sklearn_5utils_13weight_vector_INTEGER *, int);\n void (*scale)(struct __pyx_obj_7sklearn_5utils_13weight_vector_WeightVector *, double);\n void (*reset_wscale)(struct __pyx_obj_7sklearn_5utils_13weight_vector_WeightVector *);\n double (*norm)(struct __pyx_obj_7sklearn_5utils_13weight_vector_WeightVector *);\n};\nstatic struct __pyx_vtabstruct_7sklearn_5utils_13weight_vector_WeightVector *__pyx_vtabptr_7sklearn_5utils_13weight_vector_WeightVector;\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); /*proto*/\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 /* CYTHON_REFNANNY */\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\nstatic PyObject *__Pyx_GetName(PyObject *dict, PyObject *name); /*proto*/\n\nstatic CYTHON_INLINE void __Pyx_ErrRestore(PyObject *type, PyObject *value, PyObject *tb); /*proto*/\nstatic CYTHON_INLINE void __Pyx_ErrFetch(PyObject **type, PyObject **value, PyObject **tb); /*proto*/\n\nstatic void __Pyx_Raise(PyObject *type, PyObject *value, PyObject *tb, PyObject *cause); /*proto*/\n\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); /*proto*/\n\nstatic void __Pyx_RaiseDoubleKeywordsError(const char* func_name, PyObject* kw_name); /*proto*/\n\nstatic int __Pyx_ParseOptionalKeywords(PyObject *kwds, PyObject **argnames[], \\\n PyObject *kwds2, PyObject *values[], Py_ssize_t num_pos_args, \\\n const char* function_name); /*proto*/\n\nstatic int __Pyx_ArgTypeTest(PyObject *obj, PyTypeObject *type, int none_allowed,\n const char *name, int exact); /*proto*/\n\nstatic CYTHON_INLINE int __Pyx_GetBufferAndValidate(Py_buffer* buf, PyObject* obj,\n __Pyx_TypeInfo* dtype, int flags, int nd, int cast, __Pyx_BufFmt_StackElem* stack);\nstatic CYTHON_INLINE void __Pyx_SafeReleaseBuffer(Py_buffer* info);\n\nstatic CYTHON_INLINE int __Pyx_TypeTest(PyObject *obj, PyTypeObject *type); /*proto*/\n\nstatic void __Pyx_RaiseBufferFallbackError(void); /*proto*/\n\nstatic CYTHON_INLINE PyObject *__Pyx_GetItemInt_Generic(PyObject *o, PyObject* j) {\n PyObject *r;\n if (!j) return NULL;\n r = PyObject_GetItem(o, j);\n Py_DECREF(j);\n return r;\n}\n#define __Pyx_GetItemInt_List(o, i, size, to_py_func) (((size) <= sizeof(Py_ssize_t)) ? \\\n __Pyx_GetItemInt_List_Fast(o, i) : \\\n __Pyx_GetItemInt_Generic(o, to_py_func(i)))\nstatic CYTHON_INLINE PyObject *__Pyx_GetItemInt_List_Fast(PyObject *o, Py_ssize_t i) {\n#if CYTHON_COMPILING_IN_CPYTHON\n if (likely((0 <= i) & (i < PyList_GET_SIZE(o)))) {\n PyObject *r = PyList_GET_ITEM(o, i);\n Py_INCREF(r);\n return r;\n }\n else if ((-PyList_GET_SIZE(o) <= i) & (i < 0)) {\n PyObject *r = PyList_GET_ITEM(o, PyList_GET_SIZE(o) + i);\n Py_INCREF(r);\n return r;\n }\n return __Pyx_GetItemInt_Generic(o, PyInt_FromSsize_t(i));\n#else\n return PySequence_GetItem(o, i);\n#endif\n}\n#define __Pyx_GetItemInt_Tuple(o, i, size, to_py_func) (((size) <= sizeof(Py_ssize_t)) ? \\\n __Pyx_GetItemInt_Tuple_Fast(o, i) : \\\n __Pyx_GetItemInt_Generic(o, to_py_func(i)))\nstatic CYTHON_INLINE PyObject *__Pyx_GetItemInt_Tuple_Fast(PyObject *o, Py_ssize_t i) {\n#if CYTHON_COMPILING_IN_CPYTHON\n if (likely((0 <= i) & (i < PyTuple_GET_SIZE(o)))) {\n PyObject *r = PyTuple_GET_ITEM(o, i);\n Py_INCREF(r);\n return r;\n }\n else if ((-PyTuple_GET_SIZE(o) <= i) & (i < 0)) {\n PyObject *r = PyTuple_GET_ITEM(o, PyTuple_GET_SIZE(o) + i);\n Py_INCREF(r);\n return r;\n }\n return __Pyx_GetItemInt_Generic(o, PyInt_FromSsize_t(i));\n#else\n return PySequence_GetItem(o, i);\n#endif\n}\n#define __Pyx_GetItemInt(o, i, size, to_py_func) (((size) <= sizeof(Py_ssize_t)) ? \\\n __Pyx_GetItemInt_Fast(o, i) : \\\n __Pyx_GetItemInt_Generic(o, to_py_func(i)))\nstatic CYTHON_INLINE PyObject *__Pyx_GetItemInt_Fast(PyObject *o, Py_ssize_t i) {\n#if CYTHON_COMPILING_IN_CPYTHON\n if (PyList_CheckExact(o)) {\n Py_ssize_t n = (likely(i >= 0)) ? i : i + PyList_GET_SIZE(o);\n if (likely((n >= 0) & (n < PyList_GET_SIZE(o)))) {\n PyObject *r = PyList_GET_ITEM(o, n);\n Py_INCREF(r);\n return r;\n }\n }\n else if (PyTuple_CheckExact(o)) {\n Py_ssize_t n = (likely(i >= 0)) ? i : i + PyTuple_GET_SIZE(o);\n if (likely((n >= 0) & (n < PyTuple_GET_SIZE(o)))) {\n PyObject *r = PyTuple_GET_ITEM(o, n);\n Py_INCREF(r);\n return r;\n }\n } else { /* inlined PySequence_GetItem() */\n PySequenceMethods *m = Py_TYPE(o)->tp_as_sequence;\n if (likely(m && m->sq_item)) {\n if (unlikely(i < 0) && likely(m->sq_length)) {\n Py_ssize_t l = m->sq_length(o);\n if (unlikely(l < 0)) return NULL;\n i += l;\n }\n return m->sq_item(o, i);\n }\n }\n#else\n if (PySequence_Check(o)) {\n return PySequence_GetItem(o, i);\n }\n#endif\n return __Pyx_GetItemInt_Generic(o, PyInt_FromSsize_t(i));\n}\n\nstatic CYTHON_INLINE void __Pyx_RaiseTooManyValuesError(Py_ssize_t expected);\n\nstatic CYTHON_INLINE void __Pyx_RaiseNeedMoreValuesError(Py_ssize_t index);\n\nstatic CYTHON_INLINE void __Pyx_RaiseNoneNotIterableError(void);\n\nstatic CYTHON_INLINE int __Pyx_IterFinish(void); /*proto*/\n\nstatic int __Pyx_IternextUnpackEndCheck(PyObject *retval, Py_ssize_t expected); /*proto*/\n\ntypedef struct {\n Py_ssize_t shape, strides, suboffsets;\n} __Pyx_Buf_DimInfo;\ntypedef struct {\n size_t refcount;\n Py_buffer pybuffer;\n} __Pyx_Buffer;\ntypedef struct {\n __Pyx_Buffer *rcbuffer;\n char *data;\n __Pyx_Buf_DimInfo diminfo[8];\n} __Pyx_LocalBuf_ND;\n\n#if PY_MAJOR_VERSION < 3\n static int __Pyx_GetBuffer(PyObject *obj, Py_buffer *view, int flags);\n static void __Pyx_ReleaseBuffer(Py_buffer *view);\n#else\n #define __Pyx_GetBuffer PyObject_GetBuffer\n #define __Pyx_ReleaseBuffer PyBuffer_Release\n#endif\n\n\nstatic Py_ssize_t __Pyx_zeros[] = {0, 0, 0, 0, 0, 0, 0, 0};\nstatic Py_ssize_t __Pyx_minusones[] = {-1, -1, -1, -1, -1, -1, -1, -1};\n\nstatic PyObject *__Pyx_Import(PyObject *name, PyObject *from_list, long level); /*proto*/\n\nstatic CYTHON_INLINE void __Pyx_RaiseImportError(PyObject *name);\n\nstatic int __Pyx_Print(PyObject*, PyObject *, int); /*proto*/\n#if CYTHON_COMPILING_IN_PYPY || PY_MAJOR_VERSION >= 3\nstatic PyObject* __pyx_print = 0;\nstatic PyObject* __pyx_print_kwargs = 0;\n#endif\n\nstatic int __Pyx_PrintOne(PyObject* stream, PyObject *o); /*proto*/\n\n#if CYTHON_CCOMPLEX\n #ifdef __cplusplus\n #define __Pyx_CREAL(z) ((z).real())\n #define __Pyx_CIMAG(z) ((z).imag())\n #else\n #define __Pyx_CREAL(z) (__real__(z))\n #define __Pyx_CIMAG(z) (__imag__(z))\n #endif\n#else\n #define __Pyx_CREAL(z) ((z).real)\n #define __Pyx_CIMAG(z) ((z).imag)\n#endif\n#if defined(_WIN32) && defined(__cplusplus) && CYTHON_CCOMPLEX\n #define __Pyx_SET_CREAL(z,x) ((z).real(x))\n #define __Pyx_SET_CIMAG(z,y) ((z).imag(y))\n#else\n #define __Pyx_SET_CREAL(z,x) __Pyx_CREAL(z) = (x)\n #define __Pyx_SET_CIMAG(z,y) __Pyx_CIMAG(z) = (y)\n#endif\n\nstatic CYTHON_INLINE __pyx_t_float_complex __pyx_t_float_complex_from_parts(float, float);\n\n#if CYTHON_CCOMPLEX\n #define __Pyx_c_eqf(a, b) ((a)==(b))\n #define __Pyx_c_sumf(a, b) ((a)+(b))\n #define __Pyx_c_difff(a, b) ((a)-(b))\n #define __Pyx_c_prodf(a, b) ((a)*(b))\n #define __Pyx_c_quotf(a, b) ((a)/(b))\n #define __Pyx_c_negf(a) (-(a))\n #ifdef __cplusplus\n #define __Pyx_c_is_zerof(z) ((z)==(float)0)\n #define __Pyx_c_conjf(z) (::std::conj(z))\n #if 1\n #define __Pyx_c_absf(z) (::std::abs(z))\n #define __Pyx_c_powf(a, b) (::std::pow(a, b))\n #endif\n #else\n #define __Pyx_c_is_zerof(z) ((z)==0)\n #define __Pyx_c_conjf(z) (conjf(z))\n #if 1\n #define __Pyx_c_absf(z) (cabsf(z))\n #define __Pyx_c_powf(a, b) (cpowf(a, b))\n #endif\n #endif\n#else\n static CYTHON_INLINE int __Pyx_c_eqf(__pyx_t_float_complex, __pyx_t_float_complex);\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_sumf(__pyx_t_float_complex, __pyx_t_float_complex);\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_difff(__pyx_t_float_complex, __pyx_t_float_complex);\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_prodf(__pyx_t_float_complex, __pyx_t_float_complex);\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_quotf(__pyx_t_float_complex, __pyx_t_float_complex);\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_negf(__pyx_t_float_complex);\n static CYTHON_INLINE int __Pyx_c_is_zerof(__pyx_t_float_complex);\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_conjf(__pyx_t_float_complex);\n #if 1\n static CYTHON_INLINE float __Pyx_c_absf(__pyx_t_float_complex);\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_powf(__pyx_t_float_complex, __pyx_t_float_complex);\n #endif\n#endif\n\nstatic CYTHON_INLINE __pyx_t_double_complex __pyx_t_double_complex_from_parts(double, double);\n\n#if CYTHON_CCOMPLEX\n #define __Pyx_c_eq(a, b) ((a)==(b))\n #define __Pyx_c_sum(a, b) ((a)+(b))\n #define __Pyx_c_diff(a, b) ((a)-(b))\n #define __Pyx_c_prod(a, b) ((a)*(b))\n #define __Pyx_c_quot(a, b) ((a)/(b))\n #define __Pyx_c_neg(a) (-(a))\n #ifdef __cplusplus\n #define __Pyx_c_is_zero(z) ((z)==(double)0)\n #define __Pyx_c_conj(z) (::std::conj(z))\n #if 1\n #define __Pyx_c_abs(z) (::std::abs(z))\n #define __Pyx_c_pow(a, b) (::std::pow(a, b))\n #endif\n #else\n #define __Pyx_c_is_zero(z) ((z)==0)\n #define __Pyx_c_conj(z) (conj(z))\n #if 1\n #define __Pyx_c_abs(z) (cabs(z))\n #define __Pyx_c_pow(a, b) (cpow(a, b))\n #endif\n #endif\n#else\n static CYTHON_INLINE int __Pyx_c_eq(__pyx_t_double_complex, __pyx_t_double_complex);\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_sum(__pyx_t_double_complex, __pyx_t_double_complex);\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_diff(__pyx_t_double_complex, __pyx_t_double_complex);\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_prod(__pyx_t_double_complex, __pyx_t_double_complex);\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_quot(__pyx_t_double_complex, __pyx_t_double_complex);\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_neg(__pyx_t_double_complex);\n static CYTHON_INLINE int __Pyx_c_is_zero(__pyx_t_double_complex);\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_conj(__pyx_t_double_complex);\n #if 1\n static CYTHON_INLINE double __Pyx_c_abs(__pyx_t_double_complex);\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_pow(__pyx_t_double_complex, __pyx_t_double_complex);\n #endif\n#endif\n\nstatic CYTHON_INLINE unsigned char __Pyx_PyInt_AsUnsignedChar(PyObject *);\n\nstatic CYTHON_INLINE unsigned short __Pyx_PyInt_AsUnsignedShort(PyObject *);\n\nstatic CYTHON_INLINE unsigned int __Pyx_PyInt_AsUnsignedInt(PyObject *);\n\nstatic CYTHON_INLINE char __Pyx_PyInt_AsChar(PyObject *);\n\nstatic CYTHON_INLINE short __Pyx_PyInt_AsShort(PyObject *);\n\nstatic CYTHON_INLINE int __Pyx_PyInt_AsInt(PyObject *);\n\nstatic CYTHON_INLINE signed char __Pyx_PyInt_AsSignedChar(PyObject *);\n\nstatic CYTHON_INLINE signed short __Pyx_PyInt_AsSignedShort(PyObject *);\n\nstatic CYTHON_INLINE signed int __Pyx_PyInt_AsSignedInt(PyObject *);\n\nstatic CYTHON_INLINE int __Pyx_PyInt_AsLongDouble(PyObject *);\n\nstatic CYTHON_INLINE unsigned long __Pyx_PyInt_AsUnsignedLong(PyObject *);\n\nstatic CYTHON_INLINE unsigned PY_LONG_LONG __Pyx_PyInt_AsUnsignedLongLong(PyObject *);\n\nstatic CYTHON_INLINE long __Pyx_PyInt_AsLong(PyObject *);\n\nstatic CYTHON_INLINE PY_LONG_LONG __Pyx_PyInt_AsLongLong(PyObject *);\n\nstatic CYTHON_INLINE signed long __Pyx_PyInt_AsSignedLong(PyObject *);\n\nstatic CYTHON_INLINE signed PY_LONG_LONG __Pyx_PyInt_AsSignedLongLong(PyObject *);\n\nstatic void __Pyx_WriteUnraisable(const char *name, int clineno,\n int lineno, const char *filename); /*proto*/\n\nstatic int __Pyx_check_binary_version(void);\n\nstatic int __Pyx_SetVtable(PyObject *dict, void *vtable); /*proto*/\n\n#if !defined(__Pyx_PyIdentifier_FromString)\n#if PY_MAJOR_VERSION < 3\n #define __Pyx_PyIdentifier_FromString(s) PyString_FromString(s)\n#else\n #define __Pyx_PyIdentifier_FromString(s) PyUnicode_FromString(s)\n#endif\n#endif\n\nstatic PyObject *__Pyx_ImportModule(const char *name); /*proto*/\n\nstatic PyTypeObject *__Pyx_ImportType(const char *module_name, const char *class_name, size_t size, int strict); /*proto*/\n\nstatic void* __Pyx_GetVtable(PyObject *dict); /*proto*/\n\ntypedef struct {\n int code_line;\n PyCodeObject* code_object;\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\nstatic void __Pyx_AddTraceback(const char *funcname, int c_line,\n int py_line, const char *filename); /*proto*/\n\nstatic int __Pyx_InitStrings(__Pyx_StringTabEntry *t); /*proto*/\n\n\n/* Module declarations from 'libc.math' */\n\n/* Module declarations from 'cpython.buffer' */\n\n/* Module declarations from 'cpython.ref' */\n\n/* Module declarations from 'libc.stdio' */\n\n/* Module declarations from 'cpython.object' */\n\n/* Module declarations from '__builtin__' */\n\n/* Module declarations from 'cpython.type' */\nstatic PyTypeObject *__pyx_ptype_7cpython_4type_type = 0;\n\n/* Module declarations from 'libc.stdlib' */\n\n/* Module declarations from 'numpy' */\n\n/* Module declarations from 'numpy' */\nstatic PyTypeObject *__pyx_ptype_5numpy_dtype = 0;\nstatic PyTypeObject *__pyx_ptype_5numpy_flatiter = 0;\nstatic PyTypeObject *__pyx_ptype_5numpy_broadcast = 0;\nstatic PyTypeObject *__pyx_ptype_5numpy_ndarray = 0;\nstatic PyTypeObject *__pyx_ptype_5numpy_ufunc = 0;\nstatic CYTHON_INLINE char *__pyx_f_5numpy__util_dtypestring(PyArray_Descr *, char *, char *, int *); /*proto*/\n\n/* Module declarations from 'cython' */\n\n/* Module declarations from 'sklearn.utils.weight_vector' */\nstatic PyTypeObject *__pyx_ptype_7sklearn_5utils_13weight_vector_WeightVector = 0;\n\n/* Module declarations from 'sklearn.utils.seq_dataset' */\nstatic PyTypeObject *__pyx_ptype_7sklearn_5utils_11seq_dataset_SequentialDataset = 0;\nstatic PyTypeObject *__pyx_ptype_7sklearn_5utils_11seq_dataset_ArrayDataset = 0;\nstatic PyTypeObject *__pyx_ptype_7sklearn_5utils_11seq_dataset_CSRDataset = 0;\n\n/* Module declarations from 'sklearn.linear_model.sgd_fast' */\nstatic PyTypeObject *__pyx_ptype_7sklearn_12linear_model_8sgd_fast_LossFunction = 0;\nstatic PyTypeObject *__pyx_ptype_7sklearn_12linear_model_8sgd_fast_Regression = 0;\nstatic PyTypeObject *__pyx_ptype_7sklearn_12linear_model_8sgd_fast_Classification = 0;\nstatic PyTypeObject *__pyx_ptype_7sklearn_12linear_model_8sgd_fast_ModifiedHuber = 0;\nstatic PyTypeObject *__pyx_ptype_7sklearn_12linear_model_8sgd_fast_Hinge = 0;\nstatic PyTypeObject *__pyx_ptype_7sklearn_12linear_model_8sgd_fast_SquaredHinge = 0;\nstatic PyTypeObject *__pyx_ptype_7sklearn_12linear_model_8sgd_fast_Log = 0;\nstatic PyTypeObject *__pyx_ptype_7sklearn_12linear_model_8sgd_fast_SquaredLoss = 0;\nstatic PyTypeObject *__pyx_ptype_7sklearn_12linear_model_8sgd_fast_Huber = 0;\nstatic PyTypeObject *__pyx_ptype_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive = 0;\nstatic PyTypeObject *__pyx_ptype_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive = 0;\nstatic CYTHON_INLINE double __pyx_f_7sklearn_12linear_model_8sgd_fast_max(double, double); /*proto*/\nstatic CYTHON_INLINE double __pyx_f_7sklearn_12linear_model_8sgd_fast_min(double, double); /*proto*/\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_sqnorm(__pyx_t_7sklearn_12linear_model_8sgd_fast_DOUBLE *, __pyx_t_7sklearn_12linear_model_8sgd_fast_INTEGER *, int); /*proto*/\nstatic void __pyx_f_7sklearn_12linear_model_8sgd_fast_l1penalty(struct __pyx_obj_7sklearn_5utils_13weight_vector_WeightVector *, __pyx_t_7sklearn_12linear_model_8sgd_fast_DOUBLE *, __pyx_t_7sklearn_12linear_model_8sgd_fast_INTEGER *, int, double); /*proto*/\nstatic __Pyx_TypeInfo __Pyx_TypeInfo_nn___pyx_t_7sklearn_12linear_model_8sgd_fast_DOUBLE = { \"DOUBLE\", NULL, sizeof(__pyx_t_7sklearn_12linear_model_8sgd_fast_DOUBLE), { 0 }, 0, 'R', 0, 0 };\n#define __Pyx_MODULE_NAME \"sklearn.linear_model.sgd_fast\"\nint __pyx_module_is_main_sklearn__linear_model__sgd_fast = 0;\n\n/* Implementation of 'sklearn.linear_model.sgd_fast' */\nstatic PyObject *__pyx_builtin_NotImplementedError;\nstatic PyObject *__pyx_builtin_range;\nstatic PyObject *__pyx_builtin_ValueError;\nstatic PyObject *__pyx_builtin_RuntimeError;\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_12LossFunction_loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *__pyx_v_self, double __pyx_v_p, double __pyx_v_y); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_12LossFunction_2dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *__pyx_v_self, double __pyx_v_p, double __pyx_v_y); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_10Regression_loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Regression *__pyx_v_self, double __pyx_v_p, double __pyx_v_y); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_10Regression_2dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Regression *__pyx_v_self, double __pyx_v_p, double __pyx_v_y); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_14Classification_loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Classification *__pyx_v_self, double __pyx_v_p, double __pyx_v_y); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_14Classification_2dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Classification *__pyx_v_self, double __pyx_v_p, double __pyx_v_y); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_ModifiedHuber *__pyx_v_self, double __pyx_v_p, double __pyx_v_y); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_2dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_ModifiedHuber *__pyx_v_self, double __pyx_v_p, double __pyx_v_y); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_4__reduce__(CYTHON_UNUSED struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_ModifiedHuber *__pyx_v_self); /* proto */\nstatic int __pyx_pf_7sklearn_12linear_model_8sgd_fast_5Hinge___init__(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Hinge *__pyx_v_self, double __pyx_v_threshold); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_5Hinge_2loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Hinge *__pyx_v_self, double __pyx_v_p, double __pyx_v_y); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_5Hinge_4dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Hinge *__pyx_v_self, double __pyx_v_p, double __pyx_v_y); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_5Hinge_6__reduce__(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Hinge *__pyx_v_self); /* proto */\nstatic int __pyx_pf_7sklearn_12linear_model_8sgd_fast_12SquaredHinge___init__(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredHinge *__pyx_v_self, double __pyx_v_threshold); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_2loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredHinge *__pyx_v_self, double __pyx_v_p, double __pyx_v_y); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_4dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredHinge *__pyx_v_self, double __pyx_v_p, double __pyx_v_y); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_6__reduce__(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredHinge *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_3Log_loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Log *__pyx_v_self, double __pyx_v_p, double __pyx_v_y); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_3Log_2dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Log *__pyx_v_self, double __pyx_v_p, double __pyx_v_y); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_3Log_4__reduce__(CYTHON_UNUSED struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Log *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredLoss *__pyx_v_self, double __pyx_v_p, double __pyx_v_y); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_2dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredLoss *__pyx_v_self, double __pyx_v_p, double __pyx_v_y); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_4__reduce__(CYTHON_UNUSED struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredLoss *__pyx_v_self); /* proto */\nstatic int __pyx_pf_7sklearn_12linear_model_8sgd_fast_5Huber___init__(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Huber *__pyx_v_self, double __pyx_v_c); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_5Huber_2loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Huber *__pyx_v_self, double __pyx_v_p, double __pyx_v_y); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_5Huber_4dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Huber *__pyx_v_self, double __pyx_v_p, double __pyx_v_y); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_5Huber_6__reduce__(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Huber *__pyx_v_self); /* proto */\nstatic int __pyx_pf_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive___init__(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive *__pyx_v_self, double __pyx_v_epsilon); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_2loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive *__pyx_v_self, double __pyx_v_p, double __pyx_v_y); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_4dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive *__pyx_v_self, double __pyx_v_p, double __pyx_v_y); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_6__reduce__(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive *__pyx_v_self); /* proto */\nstatic int __pyx_pf_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive___init__(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive *__pyx_v_self, double __pyx_v_epsilon); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_2loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive *__pyx_v_self, double __pyx_v_p, double __pyx_v_y); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_4dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive *__pyx_v_self, double __pyx_v_p, double __pyx_v_y); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_6__reduce__(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive *__pyx_v_self); /* proto */\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_plain_sgd(CYTHON_UNUSED PyObject *__pyx_self, PyArrayObject *__pyx_v_weights, double __pyx_v_intercept, struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *__pyx_v_loss, int __pyx_v_penalty_type, double __pyx_v_alpha, double __pyx_v_C, double __pyx_v_rho, struct __pyx_obj_7sklearn_5utils_11seq_dataset_SequentialDataset *__pyx_v_dataset, int __pyx_v_n_iter, int __pyx_v_fit_intercept, int __pyx_v_verbose, int __pyx_v_shuffle, PyObject *__pyx_v_seed, double __pyx_v_weight_pos, double __pyx_v_weight_neg, int __pyx_v_learning_rate, double __pyx_v_eta0, double __pyx_v_power_t, double __pyx_v_t, double __pyx_v_intercept_decay); /* proto */\nstatic int __pyx_pf_5numpy_7ndarray___getbuffer__(PyArrayObject *__pyx_v_self, Py_buffer *__pyx_v_info, int __pyx_v_flags); /* proto */\nstatic void __pyx_pf_5numpy_7ndarray_2__releasebuffer__(PyArrayObject *__pyx_v_self, Py_buffer *__pyx_v_info); /* proto */\nstatic char __pyx_k_1[] = \"-- Epoch %d\";\nstatic char __pyx_k_2[] = \"Norm: %.2f, NNZs: %d, Bias: %.6f, T: %d, Avg. loss: %.6f\";\nstatic char __pyx_k_3[] = \"Total training time: %.2f seconds.\";\nstatic char __pyx_k_4[] = \"floating-point under-/overflow occured.\";\nstatic char __pyx_k_6[] = \"ndarray is not C contiguous\";\nstatic char __pyx_k_8[] = \"ndarray is not Fortran contiguous\";\nstatic char __pyx_k_10[] = \"Non-native byte order not supported\";\nstatic char __pyx_k_12[] = \"unknown dtype code in numpy.pxd (%d)\";\nstatic char __pyx_k_13[] = \"Format string allocated too short, see comment in numpy.pxd\";\nstatic char __pyx_k_16[] = \"Format string allocated too short.\";\nstatic char __pyx_k_20[] = \"/scratch/apps/src/scikit-learn/sklearn/linear_model/sgd_fast.pyx\";\nstatic char __pyx_k_21[] = \"sklearn.linear_model.sgd_fast\";\nstatic char __pyx_k__B[] = \"B\";\nstatic char __pyx_k__C[] = \"C\";\nstatic char __pyx_k__H[] = \"H\";\nstatic char __pyx_k__I[] = \"I\";\nstatic char __pyx_k__L[] = \"L\";\nstatic char __pyx_k__O[] = \"O\";\nstatic char __pyx_k__Q[] = \"Q\";\nstatic char __pyx_k__b[] = \"b\";\nstatic char __pyx_k__c[] = \"c\";\nstatic char __pyx_k__d[] = \"d\";\nstatic char __pyx_k__f[] = \"f\";\nstatic char __pyx_k__g[] = \"g\";\nstatic char __pyx_k__h[] = \"h\";\nstatic char __pyx_k__i[] = \"i\";\nstatic char __pyx_k__l[] = \"l\";\nstatic char __pyx_k__p[] = \"p\";\nstatic char __pyx_k__q[] = \"q\";\nstatic char __pyx_k__t[] = \"t\";\nstatic char __pyx_k__u[] = \"u\";\nstatic char __pyx_k__w[] = \"w\";\nstatic char __pyx_k__y[] = \"y\";\nstatic char __pyx_k__Zd[] = \"Zd\";\nstatic char __pyx_k__Zf[] = \"Zf\";\nstatic char __pyx_k__Zg[] = \"Zg\";\nstatic char __pyx_k__np[] = \"np\";\nstatic char __pyx_k__any[] = \"any\";\nstatic char __pyx_k__eta[] = \"eta\";\nstatic char __pyx_k__rho[] = \"rho\";\nstatic char __pyx_k__sys[] = \"sys\";\nstatic char __pyx_k__eta0[] = \"eta0\";\nstatic char __pyx_k__loss[] = \"loss\";\nstatic char __pyx_k__seed[] = \"seed\";\nstatic char __pyx_k__time[] = \"time\";\nstatic char __pyx_k__xnnz[] = \"xnnz\";\nstatic char __pyx_k__alpha[] = \"alpha\";\nstatic char __pyx_k__count[] = \"count\";\nstatic char __pyx_k__dloss[] = \"dloss\";\nstatic char __pyx_k__dtype[] = \"dtype\";\nstatic char __pyx_k__epoch[] = \"epoch\";\nstatic char __pyx_k__isinf[] = \"isinf\";\nstatic char __pyx_k__isnan[] = \"isnan\";\nstatic char __pyx_k__numpy[] = \"numpy\";\nstatic char __pyx_k__order[] = \"order\";\nstatic char __pyx_k__range[] = \"range\";\nstatic char __pyx_k__shape[] = \"shape\";\nstatic char __pyx_k__zeros[] = \"zeros\";\nstatic char __pyx_k__n_iter[] = \"n_iter\";\nstatic char __pyx_k__update[] = \"update\";\nstatic char __pyx_k__dataset[] = \"dataset\";\nstatic char __pyx_k__epsilon[] = \"epsilon\";\nstatic char __pyx_k__float64[] = \"float64\";\nstatic char __pyx_k__nonzero[] = \"nonzero\";\nstatic char __pyx_k__power_t[] = \"power_t\";\nstatic char __pyx_k__shuffle[] = \"shuffle\";\nstatic char __pyx_k__sumloss[] = \"sumloss\";\nstatic char __pyx_k__t_start[] = \"t_start\";\nstatic char __pyx_k__verbose[] = \"verbose\";\nstatic char __pyx_k__weights[] = \"weights\";\nstatic char __pyx_k____main__[] = \"__main__\";\nstatic char __pyx_k____test__[] = \"__test__\";\nstatic char __pyx_k__is_hinge[] = \"is_hinge\";\nstatic char __pyx_k__intercept[] = \"intercept\";\nstatic char __pyx_k__n_samples[] = \"n_samples\";\nstatic char __pyx_k__plain_sgd[] = \"plain_sgd\";\nstatic char __pyx_k__threshold[] = \"threshold\";\nstatic char __pyx_k__x_ind_ptr[] = \"x_ind_ptr\";\nstatic char __pyx_k__ValueError[] = \"ValueError\";\nstatic char __pyx_k__n_features[] = \"n_features\";\nstatic char __pyx_k__q_data_ptr[] = \"q_data_ptr\";\nstatic char __pyx_k__weight_neg[] = \"weight_neg\";\nstatic char __pyx_k__weight_pos[] = \"weight_pos\";\nstatic char __pyx_k__x_data_ptr[] = \"x_data_ptr\";\nstatic char __pyx_k__RuntimeError[] = \"RuntimeError\";\nstatic char __pyx_k__class_weight[] = \"class_weight\";\nstatic char __pyx_k__penalty_type[] = \"penalty_type\";\nstatic char __pyx_k__fit_intercept[] = \"fit_intercept\";\nstatic char __pyx_k__learning_rate[] = \"learning_rate\";\nstatic char __pyx_k__sample_weight[] = \"sample_weight\";\nstatic char __pyx_k__intercept_decay[] = \"intercept_decay\";\nstatic char __pyx_k__NotImplementedError[] = \"NotImplementedError\";\nstatic PyObject *__pyx_kp_s_1;\nstatic PyObject *__pyx_kp_u_10;\nstatic PyObject *__pyx_kp_u_12;\nstatic PyObject *__pyx_kp_u_13;\nstatic PyObject *__pyx_kp_u_16;\nstatic PyObject *__pyx_kp_s_2;\nstatic PyObject *__pyx_kp_s_20;\nstatic PyObject *__pyx_n_s_21;\nstatic PyObject *__pyx_kp_s_3;\nstatic PyObject *__pyx_kp_s_4;\nstatic PyObject *__pyx_kp_u_6;\nstatic PyObject *__pyx_kp_u_8;\nstatic PyObject *__pyx_n_s__C;\nstatic PyObject *__pyx_n_s__NotImplementedError;\nstatic PyObject *__pyx_n_s__RuntimeError;\nstatic PyObject *__pyx_n_s__ValueError;\nstatic PyObject *__pyx_n_s____main__;\nstatic PyObject *__pyx_n_s____test__;\nstatic PyObject *__pyx_n_s__alpha;\nstatic PyObject *__pyx_n_s__any;\nstatic PyObject *__pyx_n_s__c;\nstatic PyObject *__pyx_n_s__class_weight;\nstatic PyObject *__pyx_n_s__count;\nstatic PyObject *__pyx_n_s__dataset;\nstatic PyObject *__pyx_n_s__dloss;\nstatic PyObject *__pyx_n_s__dtype;\nstatic PyObject *__pyx_n_s__epoch;\nstatic PyObject *__pyx_n_s__epsilon;\nstatic PyObject *__pyx_n_s__eta;\nstatic PyObject *__pyx_n_s__eta0;\nstatic PyObject *__pyx_n_s__fit_intercept;\nstatic PyObject *__pyx_n_s__float64;\nstatic PyObject *__pyx_n_s__i;\nstatic PyObject *__pyx_n_s__intercept;\nstatic PyObject *__pyx_n_s__intercept_decay;\nstatic PyObject *__pyx_n_s__is_hinge;\nstatic PyObject *__pyx_n_s__isinf;\nstatic PyObject *__pyx_n_s__isnan;\nstatic PyObject *__pyx_n_s__learning_rate;\nstatic PyObject *__pyx_n_s__loss;\nstatic PyObject *__pyx_n_s__n_features;\nstatic PyObject *__pyx_n_s__n_iter;\nstatic PyObject *__pyx_n_s__n_samples;\nstatic PyObject *__pyx_n_s__nonzero;\nstatic PyObject *__pyx_n_s__np;\nstatic PyObject *__pyx_n_s__numpy;\nstatic PyObject *__pyx_n_s__order;\nstatic PyObject *__pyx_n_s__p;\nstatic PyObject *__pyx_n_s__penalty_type;\nstatic PyObject *__pyx_n_s__plain_sgd;\nstatic PyObject *__pyx_n_s__power_t;\nstatic PyObject *__pyx_n_s__q;\nstatic PyObject *__pyx_n_s__q_data_ptr;\nstatic PyObject *__pyx_n_s__range;\nstatic PyObject *__pyx_n_s__rho;\nstatic PyObject *__pyx_n_s__sample_weight;\nstatic PyObject *__pyx_n_s__seed;\nstatic PyObject *__pyx_n_s__shape;\nstatic PyObject *__pyx_n_s__shuffle;\nstatic PyObject *__pyx_n_s__sumloss;\nstatic PyObject *__pyx_n_s__sys;\nstatic PyObject *__pyx_n_s__t;\nstatic PyObject *__pyx_n_s__t_start;\nstatic PyObject *__pyx_n_s__threshold;\nstatic PyObject *__pyx_n_s__time;\nstatic PyObject *__pyx_n_s__u;\nstatic PyObject *__pyx_n_s__update;\nstatic PyObject *__pyx_n_s__verbose;\nstatic PyObject *__pyx_n_s__w;\nstatic PyObject *__pyx_n_s__weight_neg;\nstatic PyObject *__pyx_n_s__weight_pos;\nstatic PyObject *__pyx_n_s__weights;\nstatic PyObject *__pyx_n_s__x_data_ptr;\nstatic PyObject *__pyx_n_s__x_ind_ptr;\nstatic PyObject *__pyx_n_s__xnnz;\nstatic PyObject *__pyx_n_s__y;\nstatic PyObject *__pyx_n_s__zeros;\nstatic PyObject *__pyx_int_15;\nstatic PyObject *__pyx_k_tuple_5;\nstatic PyObject *__pyx_k_tuple_7;\nstatic PyObject *__pyx_k_tuple_9;\nstatic PyObject *__pyx_k_tuple_11;\nstatic PyObject *__pyx_k_tuple_14;\nstatic PyObject *__pyx_k_tuple_15;\nstatic PyObject *__pyx_k_tuple_17;\nstatic PyObject *__pyx_k_tuple_18;\nstatic PyObject *__pyx_k_codeobj_19;\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":49\n * \"\"\"Base class for convex loss functions\"\"\"\n * \n * cpdef double loss(self, double p, double y): # <<<<<<<<<<<<<<\n * \"\"\"Evaluate the loss function.\n * \n */\n\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_12LossFunction_1loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_12LossFunction_loss(CYTHON_UNUSED struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *__pyx_v_self, CYTHON_UNUSED double __pyx_v_p, CYTHON_UNUSED double __pyx_v_y, int __pyx_skip_dispatch) {\n double __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 double __pyx_t_5;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"loss\", 0);\n /* Check if called by wrapper */\n if (unlikely(__pyx_skip_dispatch)) ;\n /* Check if overriden in Python */\n else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n __pyx_t_1 = PyObject_GetAttr(((PyObject *)__pyx_v_self), __pyx_n_s__loss); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __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_7sklearn_12linear_model_8sgd_fast_12LossFunction_1loss)) {\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_p); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyFloat_FromDouble(__pyx_v_y); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_2 = 0;\n __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_Call(__pyx_t_1, ((PyObject *)__pyx_t_4), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(((PyObject *)__pyx_t_4)); __pyx_t_4 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 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 /* \"sklearn/linear_model/sgd_fast.pyx\":64\n * The loss evaluated at `p` and `y`.\n * \"\"\"\n * raise NotImplementedError() # <<<<<<<<<<<<<<\n * \n * cpdef double dloss(self, double p, double y):\n */\n __pyx_t_1 = PyObject_Call(__pyx_builtin_NotImplementedError, ((PyObject *)__pyx_empty_tuple), NULL); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 64; __pyx_clineno = __LINE__; goto __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_filename = __pyx_f[0]; __pyx_lineno = 64; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n\n __pyx_r = 0;\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(\"sklearn.linear_model.sgd_fast.LossFunction.loss\", __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_7sklearn_12linear_model_8sgd_fast_12LossFunction_1loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_7sklearn_12linear_model_8sgd_fast_12LossFunction_loss[] = \"Evaluate the loss function.\\n\\n Parameters\\n ----------\\n p : double\\n The prediction, p = w^T x\\n y : double\\n The true value (aka target)\\n\\n Returns\\n -------\\n double\\n The loss evaluated at `p` and `y`.\\n \";\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_12LossFunction_1loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_p;\n double __pyx_v_y;\n PyObject *__pyx_r = 0;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"loss (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__p,&__pyx_n_s__y,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 case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\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__p)) != 0)) kw_args--;\n else goto __pyx_L5_argtuple_error;\n case 1:\n if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__y)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"loss\", 1, 2, 2, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n }\n if (unlikely(kw_args > 0)) {\n if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"loss\") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __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_p = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_p == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_y = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_y == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n goto __pyx_L4_argument_unpacking_done;\n __pyx_L5_argtuple_error:;\n __Pyx_RaiseArgtupleInvalid(\"loss\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.LossFunction.loss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return NULL;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_12LossFunction_loss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self), __pyx_v_p, __pyx_v_y);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":49\n * \"\"\"Base class for convex loss functions\"\"\"\n * \n * cpdef double loss(self, double p, double y): # <<<<<<<<<<<<<<\n * \"\"\"Evaluate the loss function.\n * \n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_12LossFunction_loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *__pyx_v_self, double __pyx_v_p, double __pyx_v_y) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"loss\", 0);\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self->__pyx_vtab)->loss(__pyx_v_self, __pyx_v_p, __pyx_v_y, 1)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __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 __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(\"sklearn.linear_model.sgd_fast.LossFunction.loss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":66\n * raise NotImplementedError()\n * \n * cpdef double dloss(self, double p, double y): # <<<<<<<<<<<<<<\n * \"\"\"Evaluate the derivative of the loss function with respect to\n * the prediction `p`.\n */\n\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_12LossFunction_3dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_12LossFunction_dloss(CYTHON_UNUSED struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *__pyx_v_self, CYTHON_UNUSED double __pyx_v_p, CYTHON_UNUSED double __pyx_v_y, int __pyx_skip_dispatch) {\n double __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 double __pyx_t_5;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"dloss\", 0);\n /* Check if called by wrapper */\n if (unlikely(__pyx_skip_dispatch)) ;\n /* Check if overriden in Python */\n else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n __pyx_t_1 = PyObject_GetAttr(((PyObject *)__pyx_v_self), __pyx_n_s__dloss); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 66; __pyx_clineno = __LINE__; goto __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_7sklearn_12linear_model_8sgd_fast_12LossFunction_3dloss)) {\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_p); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 66; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyFloat_FromDouble(__pyx_v_y); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 66; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 66; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_2 = 0;\n __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_Call(__pyx_t_1, ((PyObject *)__pyx_t_4), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 66; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(((PyObject *)__pyx_t_4)); __pyx_t_4 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 66; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 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 /* \"sklearn/linear_model/sgd_fast.pyx\":81\n * The derivative of the loss function w.r.t. `p`.\n * \"\"\"\n * raise NotImplementedError() # <<<<<<<<<<<<<<\n * \n * \n */\n __pyx_t_1 = PyObject_Call(__pyx_builtin_NotImplementedError, ((PyObject *)__pyx_empty_tuple), NULL); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 81; __pyx_clineno = __LINE__; goto __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_filename = __pyx_f[0]; __pyx_lineno = 81; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n\n __pyx_r = 0;\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(\"sklearn.linear_model.sgd_fast.LossFunction.dloss\", __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_7sklearn_12linear_model_8sgd_fast_12LossFunction_3dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_7sklearn_12linear_model_8sgd_fast_12LossFunction_2dloss[] = \"Evaluate the derivative of the loss function with respect to\\n the prediction `p`.\\n\\n Parameters\\n ----------\\n p : double\\n The prediction, p = w^T x\\n y : double\\n The true value (aka target)\\n Returns\\n -------\\n double\\n The derivative of the loss function w.r.t. `p`.\\n \";\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_12LossFunction_3dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_p;\n double __pyx_v_y;\n PyObject *__pyx_r = 0;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"dloss (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__p,&__pyx_n_s__y,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 case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\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__p)) != 0)) kw_args--;\n else goto __pyx_L5_argtuple_error;\n case 1:\n if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__y)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"dloss\", 1, 2, 2, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 66; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n }\n if (unlikely(kw_args > 0)) {\n if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"dloss\") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 66; __pyx_clineno = __LINE__; goto __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_p = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_p == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 66; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_y = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_y == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 66; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n goto __pyx_L4_argument_unpacking_done;\n __pyx_L5_argtuple_error:;\n __Pyx_RaiseArgtupleInvalid(\"dloss\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 66; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.LossFunction.dloss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return NULL;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_12LossFunction_2dloss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self), __pyx_v_p, __pyx_v_y);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":66\n * raise NotImplementedError()\n * \n * cpdef double dloss(self, double p, double y): # <<<<<<<<<<<<<<\n * \"\"\"Evaluate the derivative of the loss function with respect to\n * the prediction `p`.\n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_12LossFunction_2dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *__pyx_v_self, double __pyx_v_p, double __pyx_v_y) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"dloss\", 0);\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self->__pyx_vtab)->dloss(__pyx_v_self, __pyx_v_p, __pyx_v_y, 1)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 66; __pyx_clineno = __LINE__; goto __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 __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(\"sklearn.linear_model.sgd_fast.LossFunction.dloss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":87\n * \"\"\"Base class for loss functions for regression\"\"\"\n * \n * cpdef double loss(self, double p, double y): # <<<<<<<<<<<<<<\n * raise NotImplementedError()\n * \n */\n\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_10Regression_1loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_10Regression_loss(CYTHON_UNUSED struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Regression *__pyx_v_self, CYTHON_UNUSED double __pyx_v_p, CYTHON_UNUSED double __pyx_v_y, int __pyx_skip_dispatch) {\n double __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 double __pyx_t_5;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"loss\", 0);\n /* Check if called by wrapper */\n if (unlikely(__pyx_skip_dispatch)) ;\n /* Check if overriden in Python */\n else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n __pyx_t_1 = PyObject_GetAttr(((PyObject *)__pyx_v_self), __pyx_n_s__loss); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 87; __pyx_clineno = __LINE__; goto __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_7sklearn_12linear_model_8sgd_fast_10Regression_1loss)) {\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_p); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 87; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyFloat_FromDouble(__pyx_v_y); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 87; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 87; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_2 = 0;\n __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_Call(__pyx_t_1, ((PyObject *)__pyx_t_4), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 87; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(((PyObject *)__pyx_t_4)); __pyx_t_4 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 87; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 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 /* \"sklearn/linear_model/sgd_fast.pyx\":88\n * \n * cpdef double loss(self, double p, double y):\n * raise NotImplementedError() # <<<<<<<<<<<<<<\n * \n * cpdef double dloss(self, double p, double y):\n */\n __pyx_t_1 = PyObject_Call(__pyx_builtin_NotImplementedError, ((PyObject *)__pyx_empty_tuple), NULL); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 88; __pyx_clineno = __LINE__; goto __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_filename = __pyx_f[0]; __pyx_lineno = 88; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n\n __pyx_r = 0;\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(\"sklearn.linear_model.sgd_fast.Regression.loss\", __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_7sklearn_12linear_model_8sgd_fast_10Regression_1loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_10Regression_1loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_p;\n double __pyx_v_y;\n PyObject *__pyx_r = 0;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"loss (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__p,&__pyx_n_s__y,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 case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\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__p)) != 0)) kw_args--;\n else goto __pyx_L5_argtuple_error;\n case 1:\n if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__y)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"loss\", 1, 2, 2, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 87; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n }\n if (unlikely(kw_args > 0)) {\n if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"loss\") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 87; __pyx_clineno = __LINE__; goto __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_p = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_p == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 87; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_y = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_y == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 87; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n goto __pyx_L4_argument_unpacking_done;\n __pyx_L5_argtuple_error:;\n __Pyx_RaiseArgtupleInvalid(\"loss\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 87; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.Regression.loss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return NULL;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_10Regression_loss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Regression *)__pyx_v_self), __pyx_v_p, __pyx_v_y);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":87\n * \"\"\"Base class for loss functions for regression\"\"\"\n * \n * cpdef double loss(self, double p, double y): # <<<<<<<<<<<<<<\n * raise NotImplementedError()\n * \n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_10Regression_loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Regression *__pyx_v_self, double __pyx_v_p, double __pyx_v_y) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"loss\", 0);\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Regression *)__pyx_v_self->__pyx_base.__pyx_vtab)->__pyx_base.loss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self), __pyx_v_p, __pyx_v_y, 1)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 87; __pyx_clineno = __LINE__; goto __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 __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(\"sklearn.linear_model.sgd_fast.Regression.loss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":90\n * raise NotImplementedError()\n * \n * cpdef double dloss(self, double p, double y): # <<<<<<<<<<<<<<\n * raise NotImplementedError()\n * \n */\n\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_10Regression_3dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_10Regression_dloss(CYTHON_UNUSED struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Regression *__pyx_v_self, CYTHON_UNUSED double __pyx_v_p, CYTHON_UNUSED double __pyx_v_y, int __pyx_skip_dispatch) {\n double __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 double __pyx_t_5;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"dloss\", 0);\n /* Check if called by wrapper */\n if (unlikely(__pyx_skip_dispatch)) ;\n /* Check if overriden in Python */\n else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n __pyx_t_1 = PyObject_GetAttr(((PyObject *)__pyx_v_self), __pyx_n_s__dloss); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 90; __pyx_clineno = __LINE__; goto __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_7sklearn_12linear_model_8sgd_fast_10Regression_3dloss)) {\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_p); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 90; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyFloat_FromDouble(__pyx_v_y); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 90; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 90; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_2 = 0;\n __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_Call(__pyx_t_1, ((PyObject *)__pyx_t_4), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 90; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(((PyObject *)__pyx_t_4)); __pyx_t_4 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 90; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 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 /* \"sklearn/linear_model/sgd_fast.pyx\":91\n * \n * cpdef double dloss(self, double p, double y):\n * raise NotImplementedError() # <<<<<<<<<<<<<<\n * \n * \n */\n __pyx_t_1 = PyObject_Call(__pyx_builtin_NotImplementedError, ((PyObject *)__pyx_empty_tuple), NULL); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 91; __pyx_clineno = __LINE__; goto __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_filename = __pyx_f[0]; __pyx_lineno = 91; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n\n __pyx_r = 0;\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(\"sklearn.linear_model.sgd_fast.Regression.dloss\", __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_7sklearn_12linear_model_8sgd_fast_10Regression_3dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_10Regression_3dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_p;\n double __pyx_v_y;\n PyObject *__pyx_r = 0;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"dloss (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__p,&__pyx_n_s__y,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 case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\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__p)) != 0)) kw_args--;\n else goto __pyx_L5_argtuple_error;\n case 1:\n if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__y)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"dloss\", 1, 2, 2, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 90; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n }\n if (unlikely(kw_args > 0)) {\n if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"dloss\") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 90; __pyx_clineno = __LINE__; goto __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_p = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_p == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 90; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_y = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_y == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 90; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n goto __pyx_L4_argument_unpacking_done;\n __pyx_L5_argtuple_error:;\n __Pyx_RaiseArgtupleInvalid(\"dloss\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 90; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.Regression.dloss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return NULL;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_10Regression_2dloss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Regression *)__pyx_v_self), __pyx_v_p, __pyx_v_y);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":90\n * raise NotImplementedError()\n * \n * cpdef double dloss(self, double p, double y): # <<<<<<<<<<<<<<\n * raise NotImplementedError()\n * \n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_10Regression_2dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Regression *__pyx_v_self, double __pyx_v_p, double __pyx_v_y) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"dloss\", 0);\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Regression *)__pyx_v_self->__pyx_base.__pyx_vtab)->__pyx_base.dloss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self), __pyx_v_p, __pyx_v_y, 1)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 90; __pyx_clineno = __LINE__; goto __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 __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(\"sklearn.linear_model.sgd_fast.Regression.dloss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":97\n * \"\"\"Base class for loss functions for classification\"\"\"\n * \n * cpdef double loss(self, double p, double y): # <<<<<<<<<<<<<<\n * raise NotImplementedError()\n * \n */\n\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_14Classification_1loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_14Classification_loss(CYTHON_UNUSED struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Classification *__pyx_v_self, CYTHON_UNUSED double __pyx_v_p, CYTHON_UNUSED double __pyx_v_y, int __pyx_skip_dispatch) {\n double __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 double __pyx_t_5;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"loss\", 0);\n /* Check if called by wrapper */\n if (unlikely(__pyx_skip_dispatch)) ;\n /* Check if overriden in Python */\n else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n __pyx_t_1 = PyObject_GetAttr(((PyObject *)__pyx_v_self), __pyx_n_s__loss); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 97; __pyx_clineno = __LINE__; goto __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_7sklearn_12linear_model_8sgd_fast_14Classification_1loss)) {\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_p); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 97; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyFloat_FromDouble(__pyx_v_y); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 97; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 97; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_2 = 0;\n __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_Call(__pyx_t_1, ((PyObject *)__pyx_t_4), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 97; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(((PyObject *)__pyx_t_4)); __pyx_t_4 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 97; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 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 /* \"sklearn/linear_model/sgd_fast.pyx\":98\n * \n * cpdef double loss(self, double p, double y):\n * raise NotImplementedError() # <<<<<<<<<<<<<<\n * \n * cpdef double dloss(self, double p, double y):\n */\n __pyx_t_1 = PyObject_Call(__pyx_builtin_NotImplementedError, ((PyObject *)__pyx_empty_tuple), NULL); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 98; __pyx_clineno = __LINE__; goto __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_filename = __pyx_f[0]; __pyx_lineno = 98; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n\n __pyx_r = 0;\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(\"sklearn.linear_model.sgd_fast.Classification.loss\", __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_7sklearn_12linear_model_8sgd_fast_14Classification_1loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_14Classification_1loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_p;\n double __pyx_v_y;\n PyObject *__pyx_r = 0;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"loss (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__p,&__pyx_n_s__y,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 case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\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__p)) != 0)) kw_args--;\n else goto __pyx_L5_argtuple_error;\n case 1:\n if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__y)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"loss\", 1, 2, 2, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 97; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n }\n if (unlikely(kw_args > 0)) {\n if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"loss\") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 97; __pyx_clineno = __LINE__; goto __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_p = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_p == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 97; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_y = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_y == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 97; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n goto __pyx_L4_argument_unpacking_done;\n __pyx_L5_argtuple_error:;\n __Pyx_RaiseArgtupleInvalid(\"loss\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 97; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.Classification.loss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return NULL;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_14Classification_loss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Classification *)__pyx_v_self), __pyx_v_p, __pyx_v_y);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":97\n * \"\"\"Base class for loss functions for classification\"\"\"\n * \n * cpdef double loss(self, double p, double y): # <<<<<<<<<<<<<<\n * raise NotImplementedError()\n * \n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_14Classification_loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Classification *__pyx_v_self, double __pyx_v_p, double __pyx_v_y) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"loss\", 0);\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Classification *)__pyx_v_self->__pyx_base.__pyx_vtab)->__pyx_base.loss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self), __pyx_v_p, __pyx_v_y, 1)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 97; __pyx_clineno = __LINE__; goto __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 __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(\"sklearn.linear_model.sgd_fast.Classification.loss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":100\n * raise NotImplementedError()\n * \n * cpdef double dloss(self, double p, double y): # <<<<<<<<<<<<<<\n * raise NotImplementedError()\n * \n */\n\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_14Classification_3dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_14Classification_dloss(CYTHON_UNUSED struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Classification *__pyx_v_self, CYTHON_UNUSED double __pyx_v_p, CYTHON_UNUSED double __pyx_v_y, int __pyx_skip_dispatch) {\n double __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 double __pyx_t_5;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"dloss\", 0);\n /* Check if called by wrapper */\n if (unlikely(__pyx_skip_dispatch)) ;\n /* Check if overriden in Python */\n else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n __pyx_t_1 = PyObject_GetAttr(((PyObject *)__pyx_v_self), __pyx_n_s__dloss); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 100; __pyx_clineno = __LINE__; goto __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_7sklearn_12linear_model_8sgd_fast_14Classification_3dloss)) {\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_p); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 100; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyFloat_FromDouble(__pyx_v_y); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 100; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 100; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_2 = 0;\n __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_Call(__pyx_t_1, ((PyObject *)__pyx_t_4), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 100; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(((PyObject *)__pyx_t_4)); __pyx_t_4 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 100; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 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 /* \"sklearn/linear_model/sgd_fast.pyx\":101\n * \n * cpdef double dloss(self, double p, double y):\n * raise NotImplementedError() # <<<<<<<<<<<<<<\n * \n * \n */\n __pyx_t_1 = PyObject_Call(__pyx_builtin_NotImplementedError, ((PyObject *)__pyx_empty_tuple), NULL); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 101; __pyx_clineno = __LINE__; goto __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_filename = __pyx_f[0]; __pyx_lineno = 101; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n\n __pyx_r = 0;\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(\"sklearn.linear_model.sgd_fast.Classification.dloss\", __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_7sklearn_12linear_model_8sgd_fast_14Classification_3dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_14Classification_3dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_p;\n double __pyx_v_y;\n PyObject *__pyx_r = 0;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"dloss (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__p,&__pyx_n_s__y,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 case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\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__p)) != 0)) kw_args--;\n else goto __pyx_L5_argtuple_error;\n case 1:\n if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__y)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"dloss\", 1, 2, 2, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 100; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n }\n if (unlikely(kw_args > 0)) {\n if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"dloss\") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 100; __pyx_clineno = __LINE__; goto __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_p = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_p == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 100; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_y = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_y == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 100; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n goto __pyx_L4_argument_unpacking_done;\n __pyx_L5_argtuple_error:;\n __Pyx_RaiseArgtupleInvalid(\"dloss\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 100; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.Classification.dloss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return NULL;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_14Classification_2dloss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Classification *)__pyx_v_self), __pyx_v_p, __pyx_v_y);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":100\n * raise NotImplementedError()\n * \n * cpdef double dloss(self, double p, double y): # <<<<<<<<<<<<<<\n * raise NotImplementedError()\n * \n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_14Classification_2dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Classification *__pyx_v_self, double __pyx_v_p, double __pyx_v_y) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"dloss\", 0);\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Classification *)__pyx_v_self->__pyx_base.__pyx_vtab)->__pyx_base.dloss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self), __pyx_v_p, __pyx_v_y, 1)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 100; __pyx_clineno = __LINE__; goto __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 __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(\"sklearn.linear_model.sgd_fast.Classification.dloss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":112\n * Stochastic Gradient Descent', ICML'04.\n * \"\"\"\n * cpdef double loss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double z = p * y\n * if z >= 1.0:\n */\n\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_1loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_loss(CYTHON_UNUSED struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_ModifiedHuber *__pyx_v_self, double __pyx_v_p, double __pyx_v_y, int __pyx_skip_dispatch) {\n double __pyx_v_z;\n double __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 double __pyx_t_5;\n int __pyx_t_6;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"loss\", 0);\n /* Check if called by wrapper */\n if (unlikely(__pyx_skip_dispatch)) ;\n /* Check if overriden in Python */\n else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n __pyx_t_1 = PyObject_GetAttr(((PyObject *)__pyx_v_self), __pyx_n_s__loss); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __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_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_1loss)) {\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_p); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyFloat_FromDouble(__pyx_v_y); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_2 = 0;\n __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_Call(__pyx_t_1, ((PyObject *)__pyx_t_4), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(((PyObject *)__pyx_t_4)); __pyx_t_4 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 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 /* \"sklearn/linear_model/sgd_fast.pyx\":113\n * \"\"\"\n * cpdef double loss(self, double p, double y):\n * cdef double z = p * y # <<<<<<<<<<<<<<\n * if z >= 1.0:\n * return 0.0\n */\n __pyx_v_z = (__pyx_v_p * __pyx_v_y);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":114\n * cpdef double loss(self, double p, double y):\n * cdef double z = p * y\n * if z >= 1.0: # <<<<<<<<<<<<<<\n * return 0.0\n * elif z >= -1.0:\n */\n __pyx_t_6 = (__pyx_v_z >= 1.0);\n if (__pyx_t_6) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":115\n * cdef double z = p * y\n * if z >= 1.0:\n * return 0.0 # <<<<<<<<<<<<<<\n * elif z >= -1.0:\n * return (1.0 - z) * (1.0 - z)\n */\n __pyx_r = 0.0;\n goto __pyx_L0;\n goto __pyx_L3;\n }\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":116\n * if z >= 1.0:\n * return 0.0\n * elif z >= -1.0: # <<<<<<<<<<<<<<\n * return (1.0 - z) * (1.0 - z)\n * else:\n */\n __pyx_t_6 = (__pyx_v_z >= -1.0);\n if (__pyx_t_6) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":117\n * return 0.0\n * elif z >= -1.0:\n * return (1.0 - z) * (1.0 - z) # <<<<<<<<<<<<<<\n * else:\n * return -4.0 * z\n */\n __pyx_r = ((1.0 - __pyx_v_z) * (1.0 - __pyx_v_z));\n goto __pyx_L0;\n goto __pyx_L3;\n }\n /*else*/ {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":119\n * return (1.0 - z) * (1.0 - z)\n * else:\n * return -4.0 * z # <<<<<<<<<<<<<<\n * \n * cpdef double dloss(self, double p, double y):\n */\n __pyx_r = (-4.0 * __pyx_v_z);\n goto __pyx_L0;\n }\n __pyx_L3:;\n\n __pyx_r = 0;\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(\"sklearn.linear_model.sgd_fast.ModifiedHuber.loss\", __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_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_1loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_1loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_p;\n double __pyx_v_y;\n PyObject *__pyx_r = 0;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"loss (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__p,&__pyx_n_s__y,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 case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\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__p)) != 0)) kw_args--;\n else goto __pyx_L5_argtuple_error;\n case 1:\n if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__y)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"loss\", 1, 2, 2, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n }\n if (unlikely(kw_args > 0)) {\n if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"loss\") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __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_p = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_p == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_y = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_y == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n goto __pyx_L4_argument_unpacking_done;\n __pyx_L5_argtuple_error:;\n __Pyx_RaiseArgtupleInvalid(\"loss\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.ModifiedHuber.loss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return NULL;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_loss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_ModifiedHuber *)__pyx_v_self), __pyx_v_p, __pyx_v_y);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":112\n * Stochastic Gradient Descent', ICML'04.\n * \"\"\"\n * cpdef double loss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double z = p * y\n * if z >= 1.0:\n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_ModifiedHuber *__pyx_v_self, double __pyx_v_p, double __pyx_v_y) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"loss\", 0);\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_ModifiedHuber *)__pyx_v_self->__pyx_base.__pyx_base.__pyx_vtab)->__pyx_base.__pyx_base.loss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self), __pyx_v_p, __pyx_v_y, 1)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __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 __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(\"sklearn.linear_model.sgd_fast.ModifiedHuber.loss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":121\n * return -4.0 * z\n * \n * cpdef double dloss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double z = p * y\n * if z >= 1.0:\n */\n\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_3dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_dloss(CYTHON_UNUSED struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_ModifiedHuber *__pyx_v_self, double __pyx_v_p, double __pyx_v_y, int __pyx_skip_dispatch) {\n double __pyx_v_z;\n double __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 double __pyx_t_5;\n int __pyx_t_6;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"dloss\", 0);\n /* Check if called by wrapper */\n if (unlikely(__pyx_skip_dispatch)) ;\n /* Check if overriden in Python */\n else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n __pyx_t_1 = PyObject_GetAttr(((PyObject *)__pyx_v_self), __pyx_n_s__dloss); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 121; __pyx_clineno = __LINE__; goto __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_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_3dloss)) {\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_p); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 121; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyFloat_FromDouble(__pyx_v_y); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 121; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 121; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_2 = 0;\n __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_Call(__pyx_t_1, ((PyObject *)__pyx_t_4), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 121; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(((PyObject *)__pyx_t_4)); __pyx_t_4 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 121; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 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 /* \"sklearn/linear_model/sgd_fast.pyx\":122\n * \n * cpdef double dloss(self, double p, double y):\n * cdef double z = p * y # <<<<<<<<<<<<<<\n * if z >= 1.0:\n * return 0.0\n */\n __pyx_v_z = (__pyx_v_p * __pyx_v_y);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":123\n * cpdef double dloss(self, double p, double y):\n * cdef double z = p * y\n * if z >= 1.0: # <<<<<<<<<<<<<<\n * return 0.0\n * elif z >= -1.0:\n */\n __pyx_t_6 = (__pyx_v_z >= 1.0);\n if (__pyx_t_6) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":124\n * cdef double z = p * y\n * if z >= 1.0:\n * return 0.0 # <<<<<<<<<<<<<<\n * elif z >= -1.0:\n * return 2.0 * (1.0 - z) * -y\n */\n __pyx_r = 0.0;\n goto __pyx_L0;\n goto __pyx_L3;\n }\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":125\n * if z >= 1.0:\n * return 0.0\n * elif z >= -1.0: # <<<<<<<<<<<<<<\n * return 2.0 * (1.0 - z) * -y\n * else:\n */\n __pyx_t_6 = (__pyx_v_z >= -1.0);\n if (__pyx_t_6) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":126\n * return 0.0\n * elif z >= -1.0:\n * return 2.0 * (1.0 - z) * -y # <<<<<<<<<<<<<<\n * else:\n * return -4.0 * y\n */\n __pyx_r = ((2.0 * (1.0 - __pyx_v_z)) * (-__pyx_v_y));\n goto __pyx_L0;\n goto __pyx_L3;\n }\n /*else*/ {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":128\n * return 2.0 * (1.0 - z) * -y\n * else:\n * return -4.0 * y # <<<<<<<<<<<<<<\n * \n * def __reduce__(self):\n */\n __pyx_r = (-4.0 * __pyx_v_y);\n goto __pyx_L0;\n }\n __pyx_L3:;\n\n __pyx_r = 0;\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(\"sklearn.linear_model.sgd_fast.ModifiedHuber.dloss\", __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_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_3dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_3dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_p;\n double __pyx_v_y;\n PyObject *__pyx_r = 0;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"dloss (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__p,&__pyx_n_s__y,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 case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\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__p)) != 0)) kw_args--;\n else goto __pyx_L5_argtuple_error;\n case 1:\n if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__y)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"dloss\", 1, 2, 2, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 121; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n }\n if (unlikely(kw_args > 0)) {\n if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"dloss\") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 121; __pyx_clineno = __LINE__; goto __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_p = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_p == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 121; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_y = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_y == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 121; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n goto __pyx_L4_argument_unpacking_done;\n __pyx_L5_argtuple_error:;\n __Pyx_RaiseArgtupleInvalid(\"dloss\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 121; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.ModifiedHuber.dloss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return NULL;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_2dloss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_ModifiedHuber *)__pyx_v_self), __pyx_v_p, __pyx_v_y);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":121\n * return -4.0 * z\n * \n * cpdef double dloss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double z = p * y\n * if z >= 1.0:\n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_2dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_ModifiedHuber *__pyx_v_self, double __pyx_v_p, double __pyx_v_y) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"dloss\", 0);\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_ModifiedHuber *)__pyx_v_self->__pyx_base.__pyx_base.__pyx_vtab)->__pyx_base.__pyx_base.dloss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self), __pyx_v_p, __pyx_v_y, 1)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 121; __pyx_clineno = __LINE__; goto __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 __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(\"sklearn.linear_model.sgd_fast.ModifiedHuber.dloss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_5__reduce__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_5__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_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_4__reduce__(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_ModifiedHuber *)__pyx_v_self));\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":130\n * return -4.0 * y\n * \n * def __reduce__(self): # <<<<<<<<<<<<<<\n * return ModifiedHuber, ()\n * \n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_4__reduce__(CYTHON_UNUSED struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_ModifiedHuber *__pyx_v_self) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"__reduce__\", 0);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":131\n * \n * def __reduce__(self):\n * return ModifiedHuber, () # <<<<<<<<<<<<<<\n * \n * \n */\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyTuple_New(2); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 131; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n __Pyx_INCREF(((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_ModifiedHuber)));\n PyTuple_SET_ITEM(__pyx_t_1, 0, ((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_ModifiedHuber)));\n __Pyx_GIVEREF(((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_ModifiedHuber)));\n __Pyx_INCREF(((PyObject *)__pyx_empty_tuple));\n PyTuple_SET_ITEM(__pyx_t_1, 1, ((PyObject *)__pyx_empty_tuple));\n __Pyx_GIVEREF(((PyObject *)__pyx_empty_tuple));\n __pyx_r = ((PyObject *)__pyx_t_1);\n __pyx_t_1 = 0;\n goto __pyx_L0;\n\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(\"sklearn.linear_model.sgd_fast.ModifiedHuber.__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/* Python wrapper */\nstatic int __pyx_pw_7sklearn_12linear_model_8sgd_fast_5Hinge_1__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_7sklearn_12linear_model_8sgd_fast_5Hinge_1__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_threshold;\n int __pyx_r;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__threshold,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 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__threshold);\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_filename = __pyx_f[0]; __pyx_lineno = 147; __pyx_clineno = __LINE__; goto __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 case 0: break;\n default: goto __pyx_L5_argtuple_error;\n }\n }\n if (values[0]) {\n __pyx_v_threshold = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_threshold == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 147; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n } else {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":147\n * cdef double threshold\n * \n * def __init__(self, double threshold=1.0): # <<<<<<<<<<<<<<\n * self.threshold = threshold\n * \n */\n __pyx_v_threshold = ((double)1.0);\n }\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_filename = __pyx_f[0]; __pyx_lineno = 147; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.Hinge.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return -1;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_5Hinge___init__(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Hinge *)__pyx_v_self), __pyx_v_threshold);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\nstatic int __pyx_pf_7sklearn_12linear_model_8sgd_fast_5Hinge___init__(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Hinge *__pyx_v_self, double __pyx_v_threshold) {\n int __pyx_r;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":148\n * \n * def __init__(self, double threshold=1.0):\n * self.threshold = threshold # <<<<<<<<<<<<<<\n * \n * cpdef double loss(self, double p, double y):\n */\n __pyx_v_self->threshold = __pyx_v_threshold;\n\n __pyx_r = 0;\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":150\n * self.threshold = threshold\n * \n * cpdef double loss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double z = p * y\n * if z <= self.threshold:\n */\n\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_5Hinge_3loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_5Hinge_loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Hinge *__pyx_v_self, double __pyx_v_p, double __pyx_v_y, int __pyx_skip_dispatch) {\n double __pyx_v_z;\n double __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 double __pyx_t_5;\n int __pyx_t_6;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"loss\", 0);\n /* Check if called by wrapper */\n if (unlikely(__pyx_skip_dispatch)) ;\n /* Check if overriden in Python */\n else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n __pyx_t_1 = PyObject_GetAttr(((PyObject *)__pyx_v_self), __pyx_n_s__loss); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 150; __pyx_clineno = __LINE__; goto __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_7sklearn_12linear_model_8sgd_fast_5Hinge_3loss)) {\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_p); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 150; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyFloat_FromDouble(__pyx_v_y); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 150; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 150; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_2 = 0;\n __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_Call(__pyx_t_1, ((PyObject *)__pyx_t_4), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 150; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(((PyObject *)__pyx_t_4)); __pyx_t_4 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 150; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 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 /* \"sklearn/linear_model/sgd_fast.pyx\":151\n * \n * cpdef double loss(self, double p, double y):\n * cdef double z = p * y # <<<<<<<<<<<<<<\n * if z <= self.threshold:\n * return (self.threshold - z)\n */\n __pyx_v_z = (__pyx_v_p * __pyx_v_y);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":152\n * cpdef double loss(self, double p, double y):\n * cdef double z = p * y\n * if z <= self.threshold: # <<<<<<<<<<<<<<\n * return (self.threshold - z)\n * return 0.0\n */\n __pyx_t_6 = (__pyx_v_z <= __pyx_v_self->threshold);\n if (__pyx_t_6) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":153\n * cdef double z = p * y\n * if z <= self.threshold:\n * return (self.threshold - z) # <<<<<<<<<<<<<<\n * return 0.0\n * \n */\n __pyx_r = (__pyx_v_self->threshold - __pyx_v_z);\n goto __pyx_L0;\n goto __pyx_L3;\n }\n __pyx_L3:;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":154\n * if z <= self.threshold:\n * return (self.threshold - z)\n * return 0.0 # <<<<<<<<<<<<<<\n * \n * cpdef double dloss(self, double p, double y):\n */\n __pyx_r = 0.0;\n goto __pyx_L0;\n\n __pyx_r = 0;\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(\"sklearn.linear_model.sgd_fast.Hinge.loss\", __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_7sklearn_12linear_model_8sgd_fast_5Hinge_3loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_5Hinge_3loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_p;\n double __pyx_v_y;\n PyObject *__pyx_r = 0;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"loss (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__p,&__pyx_n_s__y,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 case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\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__p)) != 0)) kw_args--;\n else goto __pyx_L5_argtuple_error;\n case 1:\n if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__y)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"loss\", 1, 2, 2, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 150; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n }\n if (unlikely(kw_args > 0)) {\n if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"loss\") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 150; __pyx_clineno = __LINE__; goto __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_p = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_p == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 150; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_y = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_y == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 150; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n goto __pyx_L4_argument_unpacking_done;\n __pyx_L5_argtuple_error:;\n __Pyx_RaiseArgtupleInvalid(\"loss\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 150; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.Hinge.loss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return NULL;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_5Hinge_2loss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Hinge *)__pyx_v_self), __pyx_v_p, __pyx_v_y);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":150\n * self.threshold = threshold\n * \n * cpdef double loss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double z = p * y\n * if z <= self.threshold:\n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_5Hinge_2loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Hinge *__pyx_v_self, double __pyx_v_p, double __pyx_v_y) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"loss\", 0);\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Hinge *)__pyx_v_self->__pyx_base.__pyx_base.__pyx_vtab)->__pyx_base.__pyx_base.loss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self), __pyx_v_p, __pyx_v_y, 1)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 150; __pyx_clineno = __LINE__; goto __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 __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(\"sklearn.linear_model.sgd_fast.Hinge.loss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":156\n * return 0.0\n * \n * cpdef double dloss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double z = p * y\n * if z <= self.threshold:\n */\n\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_5Hinge_5dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_5Hinge_dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Hinge *__pyx_v_self, double __pyx_v_p, double __pyx_v_y, int __pyx_skip_dispatch) {\n double __pyx_v_z;\n double __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 double __pyx_t_5;\n int __pyx_t_6;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"dloss\", 0);\n /* Check if called by wrapper */\n if (unlikely(__pyx_skip_dispatch)) ;\n /* Check if overriden in Python */\n else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n __pyx_t_1 = PyObject_GetAttr(((PyObject *)__pyx_v_self), __pyx_n_s__dloss); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 156; __pyx_clineno = __LINE__; goto __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_7sklearn_12linear_model_8sgd_fast_5Hinge_5dloss)) {\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_p); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 156; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyFloat_FromDouble(__pyx_v_y); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 156; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 156; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_2 = 0;\n __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_Call(__pyx_t_1, ((PyObject *)__pyx_t_4), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 156; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(((PyObject *)__pyx_t_4)); __pyx_t_4 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 156; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 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 /* \"sklearn/linear_model/sgd_fast.pyx\":157\n * \n * cpdef double dloss(self, double p, double y):\n * cdef double z = p * y # <<<<<<<<<<<<<<\n * if z <= self.threshold:\n * return -y\n */\n __pyx_v_z = (__pyx_v_p * __pyx_v_y);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":158\n * cpdef double dloss(self, double p, double y):\n * cdef double z = p * y\n * if z <= self.threshold: # <<<<<<<<<<<<<<\n * return -y\n * return 0.0\n */\n __pyx_t_6 = (__pyx_v_z <= __pyx_v_self->threshold);\n if (__pyx_t_6) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":159\n * cdef double z = p * y\n * if z <= self.threshold:\n * return -y # <<<<<<<<<<<<<<\n * return 0.0\n * \n */\n __pyx_r = (-__pyx_v_y);\n goto __pyx_L0;\n goto __pyx_L3;\n }\n __pyx_L3:;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":160\n * if z <= self.threshold:\n * return -y\n * return 0.0 # <<<<<<<<<<<<<<\n * \n * def __reduce__(self):\n */\n __pyx_r = 0.0;\n goto __pyx_L0;\n\n __pyx_r = 0;\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(\"sklearn.linear_model.sgd_fast.Hinge.dloss\", __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_7sklearn_12linear_model_8sgd_fast_5Hinge_5dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_5Hinge_5dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_p;\n double __pyx_v_y;\n PyObject *__pyx_r = 0;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"dloss (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__p,&__pyx_n_s__y,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 case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\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__p)) != 0)) kw_args--;\n else goto __pyx_L5_argtuple_error;\n case 1:\n if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__y)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"dloss\", 1, 2, 2, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 156; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n }\n if (unlikely(kw_args > 0)) {\n if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"dloss\") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 156; __pyx_clineno = __LINE__; goto __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_p = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_p == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 156; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_y = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_y == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 156; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n goto __pyx_L4_argument_unpacking_done;\n __pyx_L5_argtuple_error:;\n __Pyx_RaiseArgtupleInvalid(\"dloss\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 156; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.Hinge.dloss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return NULL;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_5Hinge_4dloss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Hinge *)__pyx_v_self), __pyx_v_p, __pyx_v_y);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":156\n * return 0.0\n * \n * cpdef double dloss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double z = p * y\n * if z <= self.threshold:\n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_5Hinge_4dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Hinge *__pyx_v_self, double __pyx_v_p, double __pyx_v_y) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"dloss\", 0);\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Hinge *)__pyx_v_self->__pyx_base.__pyx_base.__pyx_vtab)->__pyx_base.__pyx_base.dloss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self), __pyx_v_p, __pyx_v_y, 1)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 156; __pyx_clineno = __LINE__; goto __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 __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(\"sklearn.linear_model.sgd_fast.Hinge.dloss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_5Hinge_7__reduce__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_5Hinge_7__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_7sklearn_12linear_model_8sgd_fast_5Hinge_6__reduce__(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Hinge *)__pyx_v_self));\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":162\n * return 0.0\n * \n * def __reduce__(self): # <<<<<<<<<<<<<<\n * return Hinge, (self.threshold,)\n * \n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_5Hinge_6__reduce__(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Hinge *__pyx_v_self) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n PyObject *__pyx_t_2 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"__reduce__\", 0);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":163\n * \n * def __reduce__(self):\n * return Hinge, (self.threshold,) # <<<<<<<<<<<<<<\n * \n * \n */\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(__pyx_v_self->threshold); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 163; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n __pyx_t_2 = PyTuple_New(1); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 163; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_2, 0, __pyx_t_1);\n __Pyx_GIVEREF(__pyx_t_1);\n __pyx_t_1 = 0;\n __pyx_t_1 = PyTuple_New(2); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 163; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n __Pyx_INCREF(((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_Hinge)));\n PyTuple_SET_ITEM(__pyx_t_1, 0, ((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_Hinge)));\n __Pyx_GIVEREF(((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_Hinge)));\n PyTuple_SET_ITEM(__pyx_t_1, 1, ((PyObject *)__pyx_t_2));\n __Pyx_GIVEREF(((PyObject *)__pyx_t_2));\n __pyx_t_2 = 0;\n __pyx_r = ((PyObject *)__pyx_t_1);\n __pyx_t_1 = 0;\n goto __pyx_L0;\n\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_XDECREF(__pyx_t_2);\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.Hinge.__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/* Python wrapper */\nstatic int __pyx_pw_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_1__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_1__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_threshold;\n int __pyx_r;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__threshold,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 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__threshold);\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_filename = __pyx_f[0]; __pyx_lineno = 179; __pyx_clineno = __LINE__; goto __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 case 0: break;\n default: goto __pyx_L5_argtuple_error;\n }\n }\n if (values[0]) {\n __pyx_v_threshold = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_threshold == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 179; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n } else {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":179\n * cdef double threshold\n * \n * def __init__(self, double threshold=1.0): # <<<<<<<<<<<<<<\n * self.threshold = threshold\n * \n */\n __pyx_v_threshold = ((double)1.0);\n }\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_filename = __pyx_f[0]; __pyx_lineno = 179; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.SquaredHinge.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return -1;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_12SquaredHinge___init__(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredHinge *)__pyx_v_self), __pyx_v_threshold);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\nstatic int __pyx_pf_7sklearn_12linear_model_8sgd_fast_12SquaredHinge___init__(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredHinge *__pyx_v_self, double __pyx_v_threshold) {\n int __pyx_r;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":180\n * \n * def __init__(self, double threshold=1.0):\n * self.threshold = threshold # <<<<<<<<<<<<<<\n * \n * cpdef double loss(self, double p, double y):\n */\n __pyx_v_self->threshold = __pyx_v_threshold;\n\n __pyx_r = 0;\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":182\n * self.threshold = threshold\n * \n * cpdef double loss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double z = self.threshold - p * y\n * if z > 0:\n */\n\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_3loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredHinge *__pyx_v_self, double __pyx_v_p, double __pyx_v_y, int __pyx_skip_dispatch) {\n double __pyx_v_z;\n double __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 double __pyx_t_5;\n int __pyx_t_6;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"loss\", 0);\n /* Check if called by wrapper */\n if (unlikely(__pyx_skip_dispatch)) ;\n /* Check if overriden in Python */\n else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n __pyx_t_1 = PyObject_GetAttr(((PyObject *)__pyx_v_self), __pyx_n_s__loss); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 182; __pyx_clineno = __LINE__; goto __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_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_3loss)) {\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_p); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 182; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyFloat_FromDouble(__pyx_v_y); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 182; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 182; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_2 = 0;\n __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_Call(__pyx_t_1, ((PyObject *)__pyx_t_4), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 182; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(((PyObject *)__pyx_t_4)); __pyx_t_4 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 182; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 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 /* \"sklearn/linear_model/sgd_fast.pyx\":183\n * \n * cpdef double loss(self, double p, double y):\n * cdef double z = self.threshold - p * y # <<<<<<<<<<<<<<\n * if z > 0:\n * return z * z\n */\n __pyx_v_z = (__pyx_v_self->threshold - (__pyx_v_p * __pyx_v_y));\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":184\n * cpdef double loss(self, double p, double y):\n * cdef double z = self.threshold - p * y\n * if z > 0: # <<<<<<<<<<<<<<\n * return z * z\n * return 0.0\n */\n __pyx_t_6 = (__pyx_v_z > 0.0);\n if (__pyx_t_6) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":185\n * cdef double z = self.threshold - p * y\n * if z > 0:\n * return z * z # <<<<<<<<<<<<<<\n * return 0.0\n * \n */\n __pyx_r = (__pyx_v_z * __pyx_v_z);\n goto __pyx_L0;\n goto __pyx_L3;\n }\n __pyx_L3:;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":186\n * if z > 0:\n * return z * z\n * return 0.0 # <<<<<<<<<<<<<<\n * \n * cpdef double dloss(self, double p, double y):\n */\n __pyx_r = 0.0;\n goto __pyx_L0;\n\n __pyx_r = 0;\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(\"sklearn.linear_model.sgd_fast.SquaredHinge.loss\", __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_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_3loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_3loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_p;\n double __pyx_v_y;\n PyObject *__pyx_r = 0;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"loss (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__p,&__pyx_n_s__y,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 case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\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__p)) != 0)) kw_args--;\n else goto __pyx_L5_argtuple_error;\n case 1:\n if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__y)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"loss\", 1, 2, 2, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 182; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n }\n if (unlikely(kw_args > 0)) {\n if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"loss\") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 182; __pyx_clineno = __LINE__; goto __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_p = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_p == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 182; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_y = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_y == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 182; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n goto __pyx_L4_argument_unpacking_done;\n __pyx_L5_argtuple_error:;\n __Pyx_RaiseArgtupleInvalid(\"loss\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 182; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.SquaredHinge.loss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return NULL;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_2loss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredHinge *)__pyx_v_self), __pyx_v_p, __pyx_v_y);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":182\n * self.threshold = threshold\n * \n * cpdef double loss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double z = self.threshold - p * y\n * if z > 0:\n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_2loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredHinge *__pyx_v_self, double __pyx_v_p, double __pyx_v_y) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"loss\", 0);\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_SquaredHinge *)__pyx_v_self->__pyx_base.__pyx_vtab)->__pyx_base.loss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self), __pyx_v_p, __pyx_v_y, 1)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 182; __pyx_clineno = __LINE__; goto __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 __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(\"sklearn.linear_model.sgd_fast.SquaredHinge.loss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":188\n * return 0.0\n * \n * cpdef double dloss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double z = self.threshold - p * y\n * if z > 0:\n */\n\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_5dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredHinge *__pyx_v_self, double __pyx_v_p, double __pyx_v_y, int __pyx_skip_dispatch) {\n double __pyx_v_z;\n double __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 double __pyx_t_5;\n int __pyx_t_6;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"dloss\", 0);\n /* Check if called by wrapper */\n if (unlikely(__pyx_skip_dispatch)) ;\n /* Check if overriden in Python */\n else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n __pyx_t_1 = PyObject_GetAttr(((PyObject *)__pyx_v_self), __pyx_n_s__dloss); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 188; __pyx_clineno = __LINE__; goto __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_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_5dloss)) {\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_p); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 188; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyFloat_FromDouble(__pyx_v_y); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 188; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 188; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_2 = 0;\n __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_Call(__pyx_t_1, ((PyObject *)__pyx_t_4), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 188; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(((PyObject *)__pyx_t_4)); __pyx_t_4 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 188; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 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 /* \"sklearn/linear_model/sgd_fast.pyx\":189\n * \n * cpdef double dloss(self, double p, double y):\n * cdef double z = self.threshold - p * y # <<<<<<<<<<<<<<\n * if z > 0:\n * return -2 * y * z\n */\n __pyx_v_z = (__pyx_v_self->threshold - (__pyx_v_p * __pyx_v_y));\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":190\n * cpdef double dloss(self, double p, double y):\n * cdef double z = self.threshold - p * y\n * if z > 0: # <<<<<<<<<<<<<<\n * return -2 * y * z\n * return 0.0\n */\n __pyx_t_6 = (__pyx_v_z > 0.0);\n if (__pyx_t_6) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":191\n * cdef double z = self.threshold - p * y\n * if z > 0:\n * return -2 * y * z # <<<<<<<<<<<<<<\n * return 0.0\n * \n */\n __pyx_r = ((-2.0 * __pyx_v_y) * __pyx_v_z);\n goto __pyx_L0;\n goto __pyx_L3;\n }\n __pyx_L3:;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":192\n * if z > 0:\n * return -2 * y * z\n * return 0.0 # <<<<<<<<<<<<<<\n * \n * def __reduce__(self):\n */\n __pyx_r = 0.0;\n goto __pyx_L0;\n\n __pyx_r = 0;\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(\"sklearn.linear_model.sgd_fast.SquaredHinge.dloss\", __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_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_5dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_5dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_p;\n double __pyx_v_y;\n PyObject *__pyx_r = 0;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"dloss (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__p,&__pyx_n_s__y,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 case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\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__p)) != 0)) kw_args--;\n else goto __pyx_L5_argtuple_error;\n case 1:\n if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__y)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"dloss\", 1, 2, 2, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 188; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n }\n if (unlikely(kw_args > 0)) {\n if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"dloss\") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 188; __pyx_clineno = __LINE__; goto __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_p = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_p == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 188; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_y = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_y == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 188; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n goto __pyx_L4_argument_unpacking_done;\n __pyx_L5_argtuple_error:;\n __Pyx_RaiseArgtupleInvalid(\"dloss\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 188; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.SquaredHinge.dloss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return NULL;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_4dloss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredHinge *)__pyx_v_self), __pyx_v_p, __pyx_v_y);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":188\n * return 0.0\n * \n * cpdef double dloss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double z = self.threshold - p * y\n * if z > 0:\n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_4dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredHinge *__pyx_v_self, double __pyx_v_p, double __pyx_v_y) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"dloss\", 0);\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_SquaredHinge *)__pyx_v_self->__pyx_base.__pyx_vtab)->__pyx_base.dloss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self), __pyx_v_p, __pyx_v_y, 1)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 188; __pyx_clineno = __LINE__; goto __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 __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(\"sklearn.linear_model.sgd_fast.SquaredHinge.dloss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_7__reduce__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_7__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_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_6__reduce__(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredHinge *)__pyx_v_self));\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":194\n * return 0.0\n * \n * def __reduce__(self): # <<<<<<<<<<<<<<\n * return SquaredHinge, (self.threshold,)\n * \n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_6__reduce__(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredHinge *__pyx_v_self) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n PyObject *__pyx_t_2 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"__reduce__\", 0);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":195\n * \n * def __reduce__(self):\n * return SquaredHinge, (self.threshold,) # <<<<<<<<<<<<<<\n * \n * \n */\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(__pyx_v_self->threshold); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 195; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n __pyx_t_2 = PyTuple_New(1); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 195; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_2, 0, __pyx_t_1);\n __Pyx_GIVEREF(__pyx_t_1);\n __pyx_t_1 = 0;\n __pyx_t_1 = PyTuple_New(2); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 195; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n __Pyx_INCREF(((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_SquaredHinge)));\n PyTuple_SET_ITEM(__pyx_t_1, 0, ((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_SquaredHinge)));\n __Pyx_GIVEREF(((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_SquaredHinge)));\n PyTuple_SET_ITEM(__pyx_t_1, 1, ((PyObject *)__pyx_t_2));\n __Pyx_GIVEREF(((PyObject *)__pyx_t_2));\n __pyx_t_2 = 0;\n __pyx_r = ((PyObject *)__pyx_t_1);\n __pyx_t_1 = 0;\n goto __pyx_L0;\n\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_XDECREF(__pyx_t_2);\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.SquaredHinge.__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/* \"sklearn/linear_model/sgd_fast.pyx\":201\n * \"\"\"Logistic regression loss for binary classification with y in {-1, 1}\"\"\"\n * \n * cpdef double loss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double z = p * y\n * # approximately equal and saves the computation of the log\n */\n\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_3Log_1loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_3Log_loss(CYTHON_UNUSED struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Log *__pyx_v_self, double __pyx_v_p, double __pyx_v_y, int __pyx_skip_dispatch) {\n double __pyx_v_z;\n double __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 double __pyx_t_5;\n int __pyx_t_6;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"loss\", 0);\n /* Check if called by wrapper */\n if (unlikely(__pyx_skip_dispatch)) ;\n /* Check if overriden in Python */\n else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n __pyx_t_1 = PyObject_GetAttr(((PyObject *)__pyx_v_self), __pyx_n_s__loss); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 201; __pyx_clineno = __LINE__; goto __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_7sklearn_12linear_model_8sgd_fast_3Log_1loss)) {\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_p); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 201; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyFloat_FromDouble(__pyx_v_y); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 201; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 201; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_2 = 0;\n __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_Call(__pyx_t_1, ((PyObject *)__pyx_t_4), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 201; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(((PyObject *)__pyx_t_4)); __pyx_t_4 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 201; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 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 /* \"sklearn/linear_model/sgd_fast.pyx\":202\n * \n * cpdef double loss(self, double p, double y):\n * cdef double z = p * y # <<<<<<<<<<<<<<\n * # approximately equal and saves the computation of the log\n * if z > 18:\n */\n __pyx_v_z = (__pyx_v_p * __pyx_v_y);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":204\n * cdef double z = p * y\n * # approximately equal and saves the computation of the log\n * if z > 18: # <<<<<<<<<<<<<<\n * return exp(-z)\n * if z < -18:\n */\n __pyx_t_6 = (__pyx_v_z > 18.0);\n if (__pyx_t_6) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":205\n * # approximately equal and saves the computation of the log\n * if z > 18:\n * return exp(-z) # <<<<<<<<<<<<<<\n * if z < -18:\n * return -z\n */\n __pyx_r = exp((-__pyx_v_z));\n goto __pyx_L0;\n goto __pyx_L3;\n }\n __pyx_L3:;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":206\n * if z > 18:\n * return exp(-z)\n * if z < -18: # <<<<<<<<<<<<<<\n * return -z\n * return log(1.0 + exp(-z))\n */\n __pyx_t_6 = (__pyx_v_z < -18.0);\n if (__pyx_t_6) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":207\n * return exp(-z)\n * if z < -18:\n * return -z # <<<<<<<<<<<<<<\n * return log(1.0 + exp(-z))\n * \n */\n __pyx_r = (-__pyx_v_z);\n goto __pyx_L0;\n goto __pyx_L4;\n }\n __pyx_L4:;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":208\n * if z < -18:\n * return -z\n * return log(1.0 + exp(-z)) # <<<<<<<<<<<<<<\n * \n * cpdef double dloss(self, double p, double y):\n */\n __pyx_r = log((1.0 + exp((-__pyx_v_z))));\n goto __pyx_L0;\n\n __pyx_r = 0;\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(\"sklearn.linear_model.sgd_fast.Log.loss\", __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_7sklearn_12linear_model_8sgd_fast_3Log_1loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_3Log_1loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_p;\n double __pyx_v_y;\n PyObject *__pyx_r = 0;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"loss (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__p,&__pyx_n_s__y,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 case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\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__p)) != 0)) kw_args--;\n else goto __pyx_L5_argtuple_error;\n case 1:\n if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__y)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"loss\", 1, 2, 2, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 201; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n }\n if (unlikely(kw_args > 0)) {\n if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"loss\") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 201; __pyx_clineno = __LINE__; goto __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_p = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_p == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 201; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_y = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_y == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 201; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n goto __pyx_L4_argument_unpacking_done;\n __pyx_L5_argtuple_error:;\n __Pyx_RaiseArgtupleInvalid(\"loss\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 201; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.Log.loss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return NULL;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_3Log_loss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Log *)__pyx_v_self), __pyx_v_p, __pyx_v_y);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":201\n * \"\"\"Logistic regression loss for binary classification with y in {-1, 1}\"\"\"\n * \n * cpdef double loss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double z = p * y\n * # approximately equal and saves the computation of the log\n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_3Log_loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Log *__pyx_v_self, double __pyx_v_p, double __pyx_v_y) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"loss\", 0);\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Log *)__pyx_v_self->__pyx_base.__pyx_base.__pyx_vtab)->__pyx_base.__pyx_base.loss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self), __pyx_v_p, __pyx_v_y, 1)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 201; __pyx_clineno = __LINE__; goto __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 __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(\"sklearn.linear_model.sgd_fast.Log.loss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":210\n * return log(1.0 + exp(-z))\n * \n * cpdef double dloss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double z = p * y\n * # approximately equal and saves the computation of the log\n */\n\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_3Log_3dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_3Log_dloss(CYTHON_UNUSED struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Log *__pyx_v_self, double __pyx_v_p, double __pyx_v_y, int __pyx_skip_dispatch) {\n double __pyx_v_z;\n double __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 double __pyx_t_5;\n int __pyx_t_6;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"dloss\", 0);\n /* Check if called by wrapper */\n if (unlikely(__pyx_skip_dispatch)) ;\n /* Check if overriden in Python */\n else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n __pyx_t_1 = PyObject_GetAttr(((PyObject *)__pyx_v_self), __pyx_n_s__dloss); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __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_7sklearn_12linear_model_8sgd_fast_3Log_3dloss)) {\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_p); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyFloat_FromDouble(__pyx_v_y); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_2 = 0;\n __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_Call(__pyx_t_1, ((PyObject *)__pyx_t_4), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(((PyObject *)__pyx_t_4)); __pyx_t_4 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 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 /* \"sklearn/linear_model/sgd_fast.pyx\":211\n * \n * cpdef double dloss(self, double p, double y):\n * cdef double z = p * y # <<<<<<<<<<<<<<\n * # approximately equal and saves the computation of the log\n * if z > 18.0:\n */\n __pyx_v_z = (__pyx_v_p * __pyx_v_y);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":213\n * cdef double z = p * y\n * # approximately equal and saves the computation of the log\n * if z > 18.0: # <<<<<<<<<<<<<<\n * return exp(-z) * -y\n * if z < -18.0:\n */\n __pyx_t_6 = (__pyx_v_z > 18.0);\n if (__pyx_t_6) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":214\n * # approximately equal and saves the computation of the log\n * if z > 18.0:\n * return exp(-z) * -y # <<<<<<<<<<<<<<\n * if z < -18.0:\n * return -y\n */\n __pyx_r = (exp((-__pyx_v_z)) * (-__pyx_v_y));\n goto __pyx_L0;\n goto __pyx_L3;\n }\n __pyx_L3:;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":215\n * if z > 18.0:\n * return exp(-z) * -y\n * if z < -18.0: # <<<<<<<<<<<<<<\n * return -y\n * return -y / (exp(z) + 1.0)\n */\n __pyx_t_6 = (__pyx_v_z < -18.0);\n if (__pyx_t_6) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":216\n * return exp(-z) * -y\n * if z < -18.0:\n * return -y # <<<<<<<<<<<<<<\n * return -y / (exp(z) + 1.0)\n * \n */\n __pyx_r = (-__pyx_v_y);\n goto __pyx_L0;\n goto __pyx_L4;\n }\n __pyx_L4:;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":217\n * if z < -18.0:\n * return -y\n * return -y / (exp(z) + 1.0) # <<<<<<<<<<<<<<\n * \n * def __reduce__(self):\n */\n __pyx_r = ((-__pyx_v_y) / (exp(__pyx_v_z) + 1.0));\n goto __pyx_L0;\n\n __pyx_r = 0;\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(\"sklearn.linear_model.sgd_fast.Log.dloss\", __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_7sklearn_12linear_model_8sgd_fast_3Log_3dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_3Log_3dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_p;\n double __pyx_v_y;\n PyObject *__pyx_r = 0;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"dloss (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__p,&__pyx_n_s__y,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 case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\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__p)) != 0)) kw_args--;\n else goto __pyx_L5_argtuple_error;\n case 1:\n if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__y)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"dloss\", 1, 2, 2, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n }\n if (unlikely(kw_args > 0)) {\n if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"dloss\") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __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_p = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_p == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_y = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_y == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n goto __pyx_L4_argument_unpacking_done;\n __pyx_L5_argtuple_error:;\n __Pyx_RaiseArgtupleInvalid(\"dloss\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.Log.dloss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return NULL;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_3Log_2dloss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Log *)__pyx_v_self), __pyx_v_p, __pyx_v_y);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":210\n * return log(1.0 + exp(-z))\n * \n * cpdef double dloss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double z = p * y\n * # approximately equal and saves the computation of the log\n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_3Log_2dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Log *__pyx_v_self, double __pyx_v_p, double __pyx_v_y) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"dloss\", 0);\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Log *)__pyx_v_self->__pyx_base.__pyx_base.__pyx_vtab)->__pyx_base.__pyx_base.dloss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self), __pyx_v_p, __pyx_v_y, 1)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __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 __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(\"sklearn.linear_model.sgd_fast.Log.dloss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_3Log_5__reduce__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_3Log_5__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_7sklearn_12linear_model_8sgd_fast_3Log_4__reduce__(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Log *)__pyx_v_self));\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":219\n * return -y / (exp(z) + 1.0)\n * \n * def __reduce__(self): # <<<<<<<<<<<<<<\n * return Log, ()\n * \n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_3Log_4__reduce__(CYTHON_UNUSED struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Log *__pyx_v_self) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"__reduce__\", 0);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":220\n * \n * def __reduce__(self):\n * return Log, () # <<<<<<<<<<<<<<\n * \n * \n */\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyTuple_New(2); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 220; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n __Pyx_INCREF(((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_Log)));\n PyTuple_SET_ITEM(__pyx_t_1, 0, ((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_Log)));\n __Pyx_GIVEREF(((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_Log)));\n __Pyx_INCREF(((PyObject *)__pyx_empty_tuple));\n PyTuple_SET_ITEM(__pyx_t_1, 1, ((PyObject *)__pyx_empty_tuple));\n __Pyx_GIVEREF(((PyObject *)__pyx_empty_tuple));\n __pyx_r = ((PyObject *)__pyx_t_1);\n __pyx_t_1 = 0;\n goto __pyx_L0;\n\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(\"sklearn.linear_model.sgd_fast.Log.__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/* \"sklearn/linear_model/sgd_fast.pyx\":225\n * cdef class SquaredLoss(Regression):\n * \"\"\"Squared loss traditional used in linear regression.\"\"\"\n * cpdef double loss(self, double p, double y): # <<<<<<<<<<<<<<\n * return 0.5 * (p - y) * (p - y)\n * \n */\n\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_1loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_loss(CYTHON_UNUSED struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredLoss *__pyx_v_self, double __pyx_v_p, double __pyx_v_y, int __pyx_skip_dispatch) {\n double __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 double __pyx_t_5;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"loss\", 0);\n /* Check if called by wrapper */\n if (unlikely(__pyx_skip_dispatch)) ;\n /* Check if overriden in Python */\n else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n __pyx_t_1 = PyObject_GetAttr(((PyObject *)__pyx_v_self), __pyx_n_s__loss); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 225; __pyx_clineno = __LINE__; goto __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_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_1loss)) {\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_p); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 225; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyFloat_FromDouble(__pyx_v_y); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 225; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 225; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_2 = 0;\n __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_Call(__pyx_t_1, ((PyObject *)__pyx_t_4), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 225; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(((PyObject *)__pyx_t_4)); __pyx_t_4 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 225; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 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 /* \"sklearn/linear_model/sgd_fast.pyx\":226\n * \"\"\"Squared loss traditional used in linear regression.\"\"\"\n * cpdef double loss(self, double p, double y):\n * return 0.5 * (p - y) * (p - y) # <<<<<<<<<<<<<<\n * \n * cpdef double dloss(self, double p, double y):\n */\n __pyx_r = ((0.5 * (__pyx_v_p - __pyx_v_y)) * (__pyx_v_p - __pyx_v_y));\n goto __pyx_L0;\n\n __pyx_r = 0;\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(\"sklearn.linear_model.sgd_fast.SquaredLoss.loss\", __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_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_1loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_1loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_p;\n double __pyx_v_y;\n PyObject *__pyx_r = 0;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"loss (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__p,&__pyx_n_s__y,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 case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\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__p)) != 0)) kw_args--;\n else goto __pyx_L5_argtuple_error;\n case 1:\n if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__y)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"loss\", 1, 2, 2, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 225; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n }\n if (unlikely(kw_args > 0)) {\n if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"loss\") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 225; __pyx_clineno = __LINE__; goto __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_p = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_p == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 225; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_y = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_y == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 225; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n goto __pyx_L4_argument_unpacking_done;\n __pyx_L5_argtuple_error:;\n __Pyx_RaiseArgtupleInvalid(\"loss\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 225; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.SquaredLoss.loss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return NULL;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_loss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredLoss *)__pyx_v_self), __pyx_v_p, __pyx_v_y);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":225\n * cdef class SquaredLoss(Regression):\n * \"\"\"Squared loss traditional used in linear regression.\"\"\"\n * cpdef double loss(self, double p, double y): # <<<<<<<<<<<<<<\n * return 0.5 * (p - y) * (p - y)\n * \n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredLoss *__pyx_v_self, double __pyx_v_p, double __pyx_v_y) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"loss\", 0);\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_SquaredLoss *)__pyx_v_self->__pyx_base.__pyx_base.__pyx_vtab)->__pyx_base.__pyx_base.loss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self), __pyx_v_p, __pyx_v_y, 1)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 225; __pyx_clineno = __LINE__; goto __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 __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(\"sklearn.linear_model.sgd_fast.SquaredLoss.loss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":228\n * return 0.5 * (p - y) * (p - y)\n * \n * cpdef double dloss(self, double p, double y): # <<<<<<<<<<<<<<\n * return p - y\n * \n */\n\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_3dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_dloss(CYTHON_UNUSED struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredLoss *__pyx_v_self, double __pyx_v_p, double __pyx_v_y, int __pyx_skip_dispatch) {\n double __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 double __pyx_t_5;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"dloss\", 0);\n /* Check if called by wrapper */\n if (unlikely(__pyx_skip_dispatch)) ;\n /* Check if overriden in Python */\n else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n __pyx_t_1 = PyObject_GetAttr(((PyObject *)__pyx_v_self), __pyx_n_s__dloss); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 228; __pyx_clineno = __LINE__; goto __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_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_3dloss)) {\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_p); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 228; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyFloat_FromDouble(__pyx_v_y); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 228; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 228; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_2 = 0;\n __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_Call(__pyx_t_1, ((PyObject *)__pyx_t_4), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 228; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(((PyObject *)__pyx_t_4)); __pyx_t_4 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 228; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 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 /* \"sklearn/linear_model/sgd_fast.pyx\":229\n * \n * cpdef double dloss(self, double p, double y):\n * return p - y # <<<<<<<<<<<<<<\n * \n * def __reduce__(self):\n */\n __pyx_r = (__pyx_v_p - __pyx_v_y);\n goto __pyx_L0;\n\n __pyx_r = 0;\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(\"sklearn.linear_model.sgd_fast.SquaredLoss.dloss\", __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_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_3dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_3dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_p;\n double __pyx_v_y;\n PyObject *__pyx_r = 0;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"dloss (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__p,&__pyx_n_s__y,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 case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\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__p)) != 0)) kw_args--;\n else goto __pyx_L5_argtuple_error;\n case 1:\n if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__y)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"dloss\", 1, 2, 2, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 228; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n }\n if (unlikely(kw_args > 0)) {\n if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"dloss\") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 228; __pyx_clineno = __LINE__; goto __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_p = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_p == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 228; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_y = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_y == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 228; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n goto __pyx_L4_argument_unpacking_done;\n __pyx_L5_argtuple_error:;\n __Pyx_RaiseArgtupleInvalid(\"dloss\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 228; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.SquaredLoss.dloss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return NULL;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_2dloss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredLoss *)__pyx_v_self), __pyx_v_p, __pyx_v_y);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":228\n * return 0.5 * (p - y) * (p - y)\n * \n * cpdef double dloss(self, double p, double y): # <<<<<<<<<<<<<<\n * return p - y\n * \n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_2dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredLoss *__pyx_v_self, double __pyx_v_p, double __pyx_v_y) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"dloss\", 0);\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_SquaredLoss *)__pyx_v_self->__pyx_base.__pyx_base.__pyx_vtab)->__pyx_base.__pyx_base.dloss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self), __pyx_v_p, __pyx_v_y, 1)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 228; __pyx_clineno = __LINE__; goto __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 __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(\"sklearn.linear_model.sgd_fast.SquaredLoss.dloss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_5__reduce__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_5__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_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_4__reduce__(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredLoss *)__pyx_v_self));\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":231\n * return p - y\n * \n * def __reduce__(self): # <<<<<<<<<<<<<<\n * return SquaredLoss, ()\n * \n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_4__reduce__(CYTHON_UNUSED struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredLoss *__pyx_v_self) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"__reduce__\", 0);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":232\n * \n * def __reduce__(self):\n * return SquaredLoss, () # <<<<<<<<<<<<<<\n * \n * \n */\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyTuple_New(2); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 232; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n __Pyx_INCREF(((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_SquaredLoss)));\n PyTuple_SET_ITEM(__pyx_t_1, 0, ((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_SquaredLoss)));\n __Pyx_GIVEREF(((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_SquaredLoss)));\n __Pyx_INCREF(((PyObject *)__pyx_empty_tuple));\n PyTuple_SET_ITEM(__pyx_t_1, 1, ((PyObject *)__pyx_empty_tuple));\n __Pyx_GIVEREF(((PyObject *)__pyx_empty_tuple));\n __pyx_r = ((PyObject *)__pyx_t_1);\n __pyx_t_1 = 0;\n goto __pyx_L0;\n\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(\"sklearn.linear_model.sgd_fast.SquaredLoss.__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/* Python wrapper */\nstatic int __pyx_pw_7sklearn_12linear_model_8sgd_fast_5Huber_1__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_7sklearn_12linear_model_8sgd_fast_5Huber_1__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_c;\n int __pyx_r;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__c,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 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__c)) != 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_filename = __pyx_f[0]; __pyx_lineno = 246; __pyx_clineno = __LINE__; goto __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_c = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_c == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 246; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\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_filename = __pyx_f[0]; __pyx_lineno = 246; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.Huber.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return -1;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_5Huber___init__(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Huber *)__pyx_v_self), __pyx_v_c);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":246\n * cdef double c\n * \n * def __init__(self, double c): # <<<<<<<<<<<<<<\n * self.c = c\n * \n */\n\nstatic int __pyx_pf_7sklearn_12linear_model_8sgd_fast_5Huber___init__(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Huber *__pyx_v_self, double __pyx_v_c) {\n int __pyx_r;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":247\n * \n * def __init__(self, double c):\n * self.c = c # <<<<<<<<<<<<<<\n * \n * cpdef double loss(self, double p, double y):\n */\n __pyx_v_self->c = __pyx_v_c;\n\n __pyx_r = 0;\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":249\n * self.c = c\n * \n * cpdef double loss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double r = p - y\n * cdef double abs_r = abs(r)\n */\n\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_5Huber_3loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_5Huber_loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Huber *__pyx_v_self, double __pyx_v_p, double __pyx_v_y, int __pyx_skip_dispatch) {\n double __pyx_v_r;\n double __pyx_v_abs_r;\n double __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 double __pyx_t_5;\n int __pyx_t_6;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"loss\", 0);\n /* Check if called by wrapper */\n if (unlikely(__pyx_skip_dispatch)) ;\n /* Check if overriden in Python */\n else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n __pyx_t_1 = PyObject_GetAttr(((PyObject *)__pyx_v_self), __pyx_n_s__loss); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 249; __pyx_clineno = __LINE__; goto __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_7sklearn_12linear_model_8sgd_fast_5Huber_3loss)) {\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_p); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 249; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyFloat_FromDouble(__pyx_v_y); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 249; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 249; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_2 = 0;\n __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_Call(__pyx_t_1, ((PyObject *)__pyx_t_4), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 249; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(((PyObject *)__pyx_t_4)); __pyx_t_4 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 249; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 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 /* \"sklearn/linear_model/sgd_fast.pyx\":250\n * \n * cpdef double loss(self, double p, double y):\n * cdef double r = p - y # <<<<<<<<<<<<<<\n * cdef double abs_r = abs(r)\n * if abs_r <= self.c:\n */\n __pyx_v_r = (__pyx_v_p - __pyx_v_y);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":251\n * cpdef double loss(self, double p, double y):\n * cdef double r = p - y\n * cdef double abs_r = abs(r) # <<<<<<<<<<<<<<\n * if abs_r <= self.c:\n * return 0.5 * r * r\n */\n __pyx_v_abs_r = fabs(__pyx_v_r);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":252\n * cdef double r = p - y\n * cdef double abs_r = abs(r)\n * if abs_r <= self.c: # <<<<<<<<<<<<<<\n * return 0.5 * r * r\n * else:\n */\n __pyx_t_6 = (__pyx_v_abs_r <= __pyx_v_self->c);\n if (__pyx_t_6) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":253\n * cdef double abs_r = abs(r)\n * if abs_r <= self.c:\n * return 0.5 * r * r # <<<<<<<<<<<<<<\n * else:\n * return self.c * abs_r - (0.5 * self.c * self.c)\n */\n __pyx_r = ((0.5 * __pyx_v_r) * __pyx_v_r);\n goto __pyx_L0;\n goto __pyx_L3;\n }\n /*else*/ {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":255\n * return 0.5 * r * r\n * else:\n * return self.c * abs_r - (0.5 * self.c * self.c) # <<<<<<<<<<<<<<\n * \n * cpdef double dloss(self, double p, double y):\n */\n __pyx_r = ((__pyx_v_self->c * __pyx_v_abs_r) - ((0.5 * __pyx_v_self->c) * __pyx_v_self->c));\n goto __pyx_L0;\n }\n __pyx_L3:;\n\n __pyx_r = 0;\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(\"sklearn.linear_model.sgd_fast.Huber.loss\", __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_7sklearn_12linear_model_8sgd_fast_5Huber_3loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_5Huber_3loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_p;\n double __pyx_v_y;\n PyObject *__pyx_r = 0;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"loss (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__p,&__pyx_n_s__y,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 case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\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__p)) != 0)) kw_args--;\n else goto __pyx_L5_argtuple_error;\n case 1:\n if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__y)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"loss\", 1, 2, 2, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 249; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n }\n if (unlikely(kw_args > 0)) {\n if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"loss\") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 249; __pyx_clineno = __LINE__; goto __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_p = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_p == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 249; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_y = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_y == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 249; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n goto __pyx_L4_argument_unpacking_done;\n __pyx_L5_argtuple_error:;\n __Pyx_RaiseArgtupleInvalid(\"loss\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 249; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.Huber.loss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return NULL;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_5Huber_2loss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Huber *)__pyx_v_self), __pyx_v_p, __pyx_v_y);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":249\n * self.c = c\n * \n * cpdef double loss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double r = p - y\n * cdef double abs_r = abs(r)\n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_5Huber_2loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Huber *__pyx_v_self, double __pyx_v_p, double __pyx_v_y) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"loss\", 0);\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Huber *)__pyx_v_self->__pyx_base.__pyx_base.__pyx_vtab)->__pyx_base.__pyx_base.loss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self), __pyx_v_p, __pyx_v_y, 1)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 249; __pyx_clineno = __LINE__; goto __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 __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(\"sklearn.linear_model.sgd_fast.Huber.loss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":257\n * return self.c * abs_r - (0.5 * self.c * self.c)\n * \n * cpdef double dloss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double r = p - y\n * cdef double abs_r = abs(r)\n */\n\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_5Huber_5dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_5Huber_dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Huber *__pyx_v_self, double __pyx_v_p, double __pyx_v_y, int __pyx_skip_dispatch) {\n double __pyx_v_r;\n double __pyx_v_abs_r;\n double __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 double __pyx_t_5;\n int __pyx_t_6;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"dloss\", 0);\n /* Check if called by wrapper */\n if (unlikely(__pyx_skip_dispatch)) ;\n /* Check if overriden in Python */\n else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n __pyx_t_1 = PyObject_GetAttr(((PyObject *)__pyx_v_self), __pyx_n_s__dloss); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __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_7sklearn_12linear_model_8sgd_fast_5Huber_5dloss)) {\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_p); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyFloat_FromDouble(__pyx_v_y); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_2 = 0;\n __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_Call(__pyx_t_1, ((PyObject *)__pyx_t_4), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(((PyObject *)__pyx_t_4)); __pyx_t_4 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 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 /* \"sklearn/linear_model/sgd_fast.pyx\":258\n * \n * cpdef double dloss(self, double p, double y):\n * cdef double r = p - y # <<<<<<<<<<<<<<\n * cdef double abs_r = abs(r)\n * if abs_r <= self.c:\n */\n __pyx_v_r = (__pyx_v_p - __pyx_v_y);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":259\n * cpdef double dloss(self, double p, double y):\n * cdef double r = p - y\n * cdef double abs_r = abs(r) # <<<<<<<<<<<<<<\n * if abs_r <= self.c:\n * return r\n */\n __pyx_v_abs_r = fabs(__pyx_v_r);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":260\n * cdef double r = p - y\n * cdef double abs_r = abs(r)\n * if abs_r <= self.c: # <<<<<<<<<<<<<<\n * return r\n * elif r > 0.0:\n */\n __pyx_t_6 = (__pyx_v_abs_r <= __pyx_v_self->c);\n if (__pyx_t_6) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":261\n * cdef double abs_r = abs(r)\n * if abs_r <= self.c:\n * return r # <<<<<<<<<<<<<<\n * elif r > 0.0:\n * return self.c\n */\n __pyx_r = __pyx_v_r;\n goto __pyx_L0;\n goto __pyx_L3;\n }\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":262\n * if abs_r <= self.c:\n * return r\n * elif r > 0.0: # <<<<<<<<<<<<<<\n * return self.c\n * else:\n */\n __pyx_t_6 = (__pyx_v_r > 0.0);\n if (__pyx_t_6) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":263\n * return r\n * elif r > 0.0:\n * return self.c # <<<<<<<<<<<<<<\n * else:\n * return -self.c\n */\n __pyx_r = __pyx_v_self->c;\n goto __pyx_L0;\n goto __pyx_L3;\n }\n /*else*/ {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":265\n * return self.c\n * else:\n * return -self.c # <<<<<<<<<<<<<<\n * \n * def __reduce__(self):\n */\n __pyx_r = (-__pyx_v_self->c);\n goto __pyx_L0;\n }\n __pyx_L3:;\n\n __pyx_r = 0;\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(\"sklearn.linear_model.sgd_fast.Huber.dloss\", __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_7sklearn_12linear_model_8sgd_fast_5Huber_5dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_5Huber_5dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_p;\n double __pyx_v_y;\n PyObject *__pyx_r = 0;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"dloss (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__p,&__pyx_n_s__y,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 case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\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__p)) != 0)) kw_args--;\n else goto __pyx_L5_argtuple_error;\n case 1:\n if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__y)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"dloss\", 1, 2, 2, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n }\n if (unlikely(kw_args > 0)) {\n if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"dloss\") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __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_p = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_p == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_y = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_y == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n goto __pyx_L4_argument_unpacking_done;\n __pyx_L5_argtuple_error:;\n __Pyx_RaiseArgtupleInvalid(\"dloss\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.Huber.dloss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return NULL;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_5Huber_4dloss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Huber *)__pyx_v_self), __pyx_v_p, __pyx_v_y);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":257\n * return self.c * abs_r - (0.5 * self.c * self.c)\n * \n * cpdef double dloss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double r = p - y\n * cdef double abs_r = abs(r)\n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_5Huber_4dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Huber *__pyx_v_self, double __pyx_v_p, double __pyx_v_y) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"dloss\", 0);\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Huber *)__pyx_v_self->__pyx_base.__pyx_base.__pyx_vtab)->__pyx_base.__pyx_base.dloss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self), __pyx_v_p, __pyx_v_y, 1)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __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 __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(\"sklearn.linear_model.sgd_fast.Huber.dloss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_5Huber_7__reduce__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_5Huber_7__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_7sklearn_12linear_model_8sgd_fast_5Huber_6__reduce__(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Huber *)__pyx_v_self));\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":267\n * return -self.c\n * \n * def __reduce__(self): # <<<<<<<<<<<<<<\n * return Huber, (self.c,)\n * \n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_5Huber_6__reduce__(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Huber *__pyx_v_self) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n PyObject *__pyx_t_2 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"__reduce__\", 0);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":268\n * \n * def __reduce__(self):\n * return Huber, (self.c,) # <<<<<<<<<<<<<<\n * \n * \n */\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(__pyx_v_self->c); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 268; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n __pyx_t_2 = PyTuple_New(1); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 268; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_2, 0, __pyx_t_1);\n __Pyx_GIVEREF(__pyx_t_1);\n __pyx_t_1 = 0;\n __pyx_t_1 = PyTuple_New(2); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 268; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n __Pyx_INCREF(((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_Huber)));\n PyTuple_SET_ITEM(__pyx_t_1, 0, ((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_Huber)));\n __Pyx_GIVEREF(((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_Huber)));\n PyTuple_SET_ITEM(__pyx_t_1, 1, ((PyObject *)__pyx_t_2));\n __Pyx_GIVEREF(((PyObject *)__pyx_t_2));\n __pyx_t_2 = 0;\n __pyx_r = ((PyObject *)__pyx_t_1);\n __pyx_t_1 = 0;\n goto __pyx_L0;\n\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_XDECREF(__pyx_t_2);\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.Huber.__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/* Python wrapper */\nstatic int __pyx_pw_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_1__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_1__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_epsilon;\n int __pyx_r;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__epsilon,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 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__epsilon)) != 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_filename = __pyx_f[0]; __pyx_lineno = 279; __pyx_clineno = __LINE__; goto __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_epsilon = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_epsilon == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 279; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\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_filename = __pyx_f[0]; __pyx_lineno = 279; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.EpsilonInsensitive.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return -1;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive___init__(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive *)__pyx_v_self), __pyx_v_epsilon);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":279\n * cdef double epsilon\n * \n * def __init__(self, double epsilon): # <<<<<<<<<<<<<<\n * self.epsilon = epsilon\n * \n */\n\nstatic int __pyx_pf_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive___init__(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive *__pyx_v_self, double __pyx_v_epsilon) {\n int __pyx_r;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":280\n * \n * def __init__(self, double epsilon):\n * self.epsilon = epsilon # <<<<<<<<<<<<<<\n * \n * cpdef double loss(self, double p, double y):\n */\n __pyx_v_self->epsilon = __pyx_v_epsilon;\n\n __pyx_r = 0;\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":282\n * self.epsilon = epsilon\n * \n * cpdef double loss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double ret = abs(y - p) - self.epsilon\n * return ret if ret > 0 else 0\n */\n\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_3loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive *__pyx_v_self, double __pyx_v_p, double __pyx_v_y, int __pyx_skip_dispatch) {\n double __pyx_v_ret;\n double __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 double __pyx_t_5;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"loss\", 0);\n /* Check if called by wrapper */\n if (unlikely(__pyx_skip_dispatch)) ;\n /* Check if overriden in Python */\n else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n __pyx_t_1 = PyObject_GetAttr(((PyObject *)__pyx_v_self), __pyx_n_s__loss); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 282; __pyx_clineno = __LINE__; goto __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_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_3loss)) {\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_p); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 282; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyFloat_FromDouble(__pyx_v_y); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 282; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 282; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_2 = 0;\n __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_Call(__pyx_t_1, ((PyObject *)__pyx_t_4), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 282; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(((PyObject *)__pyx_t_4)); __pyx_t_4 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 282; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 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 /* \"sklearn/linear_model/sgd_fast.pyx\":283\n * \n * cpdef double loss(self, double p, double y):\n * cdef double ret = abs(y - p) - self.epsilon # <<<<<<<<<<<<<<\n * return ret if ret > 0 else 0\n * \n */\n __pyx_v_ret = (fabs((__pyx_v_y - __pyx_v_p)) - __pyx_v_self->epsilon);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":284\n * cpdef double loss(self, double p, double y):\n * cdef double ret = abs(y - p) - self.epsilon\n * return ret if ret > 0 else 0 # <<<<<<<<<<<<<<\n * \n * cpdef double dloss(self, double p, double y):\n */\n if ((__pyx_v_ret > 0.0)) {\n __pyx_t_5 = __pyx_v_ret;\n } else {\n __pyx_t_5 = 0;\n }\n __pyx_r = __pyx_t_5;\n goto __pyx_L0;\n\n __pyx_r = 0;\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(\"sklearn.linear_model.sgd_fast.EpsilonInsensitive.loss\", __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_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_3loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_3loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_p;\n double __pyx_v_y;\n PyObject *__pyx_r = 0;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"loss (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__p,&__pyx_n_s__y,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 case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\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__p)) != 0)) kw_args--;\n else goto __pyx_L5_argtuple_error;\n case 1:\n if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__y)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"loss\", 1, 2, 2, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 282; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n }\n if (unlikely(kw_args > 0)) {\n if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"loss\") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 282; __pyx_clineno = __LINE__; goto __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_p = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_p == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 282; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_y = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_y == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 282; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n goto __pyx_L4_argument_unpacking_done;\n __pyx_L5_argtuple_error:;\n __Pyx_RaiseArgtupleInvalid(\"loss\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 282; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.EpsilonInsensitive.loss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return NULL;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_2loss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive *)__pyx_v_self), __pyx_v_p, __pyx_v_y);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":282\n * self.epsilon = epsilon\n * \n * cpdef double loss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double ret = abs(y - p) - self.epsilon\n * return ret if ret > 0 else 0\n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_2loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive *__pyx_v_self, double __pyx_v_p, double __pyx_v_y) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"loss\", 0);\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive *)__pyx_v_self->__pyx_base.__pyx_base.__pyx_vtab)->__pyx_base.__pyx_base.loss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self), __pyx_v_p, __pyx_v_y, 1)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 282; __pyx_clineno = __LINE__; goto __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 __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(\"sklearn.linear_model.sgd_fast.EpsilonInsensitive.loss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":286\n * return ret if ret > 0 else 0\n * \n * cpdef double dloss(self, double p, double y): # <<<<<<<<<<<<<<\n * if y - p > self.epsilon:\n * return -1\n */\n\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_5dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive *__pyx_v_self, double __pyx_v_p, double __pyx_v_y, int __pyx_skip_dispatch) {\n double __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 double __pyx_t_5;\n int __pyx_t_6;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"dloss\", 0);\n /* Check if called by wrapper */\n if (unlikely(__pyx_skip_dispatch)) ;\n /* Check if overriden in Python */\n else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n __pyx_t_1 = PyObject_GetAttr(((PyObject *)__pyx_v_self), __pyx_n_s__dloss); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 286; __pyx_clineno = __LINE__; goto __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_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_5dloss)) {\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_p); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 286; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyFloat_FromDouble(__pyx_v_y); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 286; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 286; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_2 = 0;\n __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_Call(__pyx_t_1, ((PyObject *)__pyx_t_4), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 286; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(((PyObject *)__pyx_t_4)); __pyx_t_4 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 286; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 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 /* \"sklearn/linear_model/sgd_fast.pyx\":287\n * \n * cpdef double dloss(self, double p, double y):\n * if y - p > self.epsilon: # <<<<<<<<<<<<<<\n * return -1\n * elif p - y > self.epsilon:\n */\n __pyx_t_6 = ((__pyx_v_y - __pyx_v_p) > __pyx_v_self->epsilon);\n if (__pyx_t_6) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":288\n * cpdef double dloss(self, double p, double y):\n * if y - p > self.epsilon:\n * return -1 # <<<<<<<<<<<<<<\n * elif p - y > self.epsilon:\n * return 1\n */\n __pyx_r = -1.0;\n goto __pyx_L0;\n goto __pyx_L3;\n }\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":289\n * if y - p > self.epsilon:\n * return -1\n * elif p - y > self.epsilon: # <<<<<<<<<<<<<<\n * return 1\n * else:\n */\n __pyx_t_6 = ((__pyx_v_p - __pyx_v_y) > __pyx_v_self->epsilon);\n if (__pyx_t_6) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":290\n * return -1\n * elif p - y > self.epsilon:\n * return 1 # <<<<<<<<<<<<<<\n * else:\n * return 0\n */\n __pyx_r = 1.0;\n goto __pyx_L0;\n goto __pyx_L3;\n }\n /*else*/ {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":292\n * return 1\n * else:\n * return 0 # <<<<<<<<<<<<<<\n * \n * def __reduce__(self):\n */\n __pyx_r = 0.0;\n goto __pyx_L0;\n }\n __pyx_L3:;\n\n __pyx_r = 0;\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(\"sklearn.linear_model.sgd_fast.EpsilonInsensitive.dloss\", __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_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_5dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_5dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_p;\n double __pyx_v_y;\n PyObject *__pyx_r = 0;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"dloss (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__p,&__pyx_n_s__y,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 case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\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__p)) != 0)) kw_args--;\n else goto __pyx_L5_argtuple_error;\n case 1:\n if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__y)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"dloss\", 1, 2, 2, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 286; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n }\n if (unlikely(kw_args > 0)) {\n if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"dloss\") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 286; __pyx_clineno = __LINE__; goto __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_p = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_p == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 286; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_y = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_y == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 286; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n goto __pyx_L4_argument_unpacking_done;\n __pyx_L5_argtuple_error:;\n __Pyx_RaiseArgtupleInvalid(\"dloss\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 286; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.EpsilonInsensitive.dloss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return NULL;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_4dloss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive *)__pyx_v_self), __pyx_v_p, __pyx_v_y);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":286\n * return ret if ret > 0 else 0\n * \n * cpdef double dloss(self, double p, double y): # <<<<<<<<<<<<<<\n * if y - p > self.epsilon:\n * return -1\n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_4dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive *__pyx_v_self, double __pyx_v_p, double __pyx_v_y) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"dloss\", 0);\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive *)__pyx_v_self->__pyx_base.__pyx_base.__pyx_vtab)->__pyx_base.__pyx_base.dloss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self), __pyx_v_p, __pyx_v_y, 1)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 286; __pyx_clineno = __LINE__; goto __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 __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(\"sklearn.linear_model.sgd_fast.EpsilonInsensitive.dloss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_7__reduce__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_7__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_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_6__reduce__(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive *)__pyx_v_self));\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":294\n * return 0\n * \n * def __reduce__(self): # <<<<<<<<<<<<<<\n * return EpsilonInsensitive, (self.epsilon,)\n * \n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_6__reduce__(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive *__pyx_v_self) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n PyObject *__pyx_t_2 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"__reduce__\", 0);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":295\n * \n * def __reduce__(self):\n * return EpsilonInsensitive, (self.epsilon,) # <<<<<<<<<<<<<<\n * \n * \n */\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(__pyx_v_self->epsilon); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 295; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n __pyx_t_2 = PyTuple_New(1); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 295; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_2, 0, __pyx_t_1);\n __Pyx_GIVEREF(__pyx_t_1);\n __pyx_t_1 = 0;\n __pyx_t_1 = PyTuple_New(2); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 295; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n __Pyx_INCREF(((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive)));\n PyTuple_SET_ITEM(__pyx_t_1, 0, ((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive)));\n __Pyx_GIVEREF(((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive)));\n PyTuple_SET_ITEM(__pyx_t_1, 1, ((PyObject *)__pyx_t_2));\n __Pyx_GIVEREF(((PyObject *)__pyx_t_2));\n __pyx_t_2 = 0;\n __pyx_r = ((PyObject *)__pyx_t_1);\n __pyx_t_1 = 0;\n goto __pyx_L0;\n\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_XDECREF(__pyx_t_2);\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.EpsilonInsensitive.__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/* Python wrapper */\nstatic int __pyx_pw_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_1__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic int __pyx_pw_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_1__init__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_epsilon;\n int __pyx_r;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"__init__ (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__epsilon,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 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__epsilon)) != 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_filename = __pyx_f[0]; __pyx_lineno = 306; __pyx_clineno = __LINE__; goto __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_epsilon = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_epsilon == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 306; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\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_filename = __pyx_f[0]; __pyx_lineno = 306; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.SquaredEpsilonInsensitive.__init__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return -1;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive___init__(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive *)__pyx_v_self), __pyx_v_epsilon);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":306\n * cdef double epsilon\n * \n * def __init__(self, double epsilon): # <<<<<<<<<<<<<<\n * self.epsilon = epsilon\n * \n */\n\nstatic int __pyx_pf_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive___init__(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive *__pyx_v_self, double __pyx_v_epsilon) {\n int __pyx_r;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"__init__\", 0);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":307\n * \n * def __init__(self, double epsilon):\n * self.epsilon = epsilon # <<<<<<<<<<<<<<\n * \n * cpdef double loss(self, double p, double y):\n */\n __pyx_v_self->epsilon = __pyx_v_epsilon;\n\n __pyx_r = 0;\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":309\n * self.epsilon = epsilon\n * \n * cpdef double loss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double ret = abs(y - p) - self.epsilon\n * return ret * ret if ret > 0 else 0\n */\n\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_3loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive *__pyx_v_self, double __pyx_v_p, double __pyx_v_y, int __pyx_skip_dispatch) {\n double __pyx_v_ret;\n double __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 double __pyx_t_5;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"loss\", 0);\n /* Check if called by wrapper */\n if (unlikely(__pyx_skip_dispatch)) ;\n /* Check if overriden in Python */\n else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n __pyx_t_1 = PyObject_GetAttr(((PyObject *)__pyx_v_self), __pyx_n_s__loss); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 309; __pyx_clineno = __LINE__; goto __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_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_3loss)) {\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_p); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 309; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyFloat_FromDouble(__pyx_v_y); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 309; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 309; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_2 = 0;\n __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_Call(__pyx_t_1, ((PyObject *)__pyx_t_4), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 309; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(((PyObject *)__pyx_t_4)); __pyx_t_4 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 309; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 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 /* \"sklearn/linear_model/sgd_fast.pyx\":310\n * \n * cpdef double loss(self, double p, double y):\n * cdef double ret = abs(y - p) - self.epsilon # <<<<<<<<<<<<<<\n * return ret * ret if ret > 0 else 0\n * \n */\n __pyx_v_ret = (fabs((__pyx_v_y - __pyx_v_p)) - __pyx_v_self->epsilon);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":311\n * cpdef double loss(self, double p, double y):\n * cdef double ret = abs(y - p) - self.epsilon\n * return ret * ret if ret > 0 else 0 # <<<<<<<<<<<<<<\n * \n * cpdef double dloss(self, double p, double y):\n */\n if ((__pyx_v_ret > 0.0)) {\n __pyx_t_5 = (__pyx_v_ret * __pyx_v_ret);\n } else {\n __pyx_t_5 = 0;\n }\n __pyx_r = __pyx_t_5;\n goto __pyx_L0;\n\n __pyx_r = 0;\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(\"sklearn.linear_model.sgd_fast.SquaredEpsilonInsensitive.loss\", __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_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_3loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_3loss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_p;\n double __pyx_v_y;\n PyObject *__pyx_r = 0;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"loss (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__p,&__pyx_n_s__y,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 case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\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__p)) != 0)) kw_args--;\n else goto __pyx_L5_argtuple_error;\n case 1:\n if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__y)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"loss\", 1, 2, 2, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 309; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n }\n if (unlikely(kw_args > 0)) {\n if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"loss\") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 309; __pyx_clineno = __LINE__; goto __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_p = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_p == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 309; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_y = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_y == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 309; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n goto __pyx_L4_argument_unpacking_done;\n __pyx_L5_argtuple_error:;\n __Pyx_RaiseArgtupleInvalid(\"loss\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 309; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.SquaredEpsilonInsensitive.loss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return NULL;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_2loss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive *)__pyx_v_self), __pyx_v_p, __pyx_v_y);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":309\n * self.epsilon = epsilon\n * \n * cpdef double loss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double ret = abs(y - p) - self.epsilon\n * return ret * ret if ret > 0 else 0\n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_2loss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive *__pyx_v_self, double __pyx_v_p, double __pyx_v_y) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"loss\", 0);\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive *)__pyx_v_self->__pyx_base.__pyx_base.__pyx_vtab)->__pyx_base.__pyx_base.loss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self), __pyx_v_p, __pyx_v_y, 1)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 309; __pyx_clineno = __LINE__; goto __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 __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(\"sklearn.linear_model.sgd_fast.SquaredEpsilonInsensitive.loss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":313\n * return ret * ret if ret > 0 else 0\n * \n * cpdef double dloss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double z\n * z = y - p\n */\n\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_5dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive *__pyx_v_self, double __pyx_v_p, double __pyx_v_y, int __pyx_skip_dispatch) {\n double __pyx_v_z;\n double __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 double __pyx_t_5;\n int __pyx_t_6;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"dloss\", 0);\n /* Check if called by wrapper */\n if (unlikely(__pyx_skip_dispatch)) ;\n /* Check if overriden in Python */\n else if (unlikely(Py_TYPE(((PyObject *)__pyx_v_self))->tp_dictoffset != 0)) {\n __pyx_t_1 = PyObject_GetAttr(((PyObject *)__pyx_v_self), __pyx_n_s__dloss); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 313; __pyx_clineno = __LINE__; goto __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_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_5dloss)) {\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_p); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 313; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyFloat_FromDouble(__pyx_v_y); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 313; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_4 = PyTuple_New(2); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 313; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_4, 1, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_2 = 0;\n __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_Call(__pyx_t_1, ((PyObject *)__pyx_t_4), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 313; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(((PyObject *)__pyx_t_4)); __pyx_t_4 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 313; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 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 /* \"sklearn/linear_model/sgd_fast.pyx\":315\n * cpdef double dloss(self, double p, double y):\n * cdef double z\n * z = y - p # <<<<<<<<<<<<<<\n * if z > self.epsilon:\n * return -2 * (z - self.epsilon)\n */\n __pyx_v_z = (__pyx_v_y - __pyx_v_p);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":316\n * cdef double z\n * z = y - p\n * if z > self.epsilon: # <<<<<<<<<<<<<<\n * return -2 * (z - self.epsilon)\n * elif z < self.epsilon:\n */\n __pyx_t_6 = (__pyx_v_z > __pyx_v_self->epsilon);\n if (__pyx_t_6) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":317\n * z = y - p\n * if z > self.epsilon:\n * return -2 * (z - self.epsilon) # <<<<<<<<<<<<<<\n * elif z < self.epsilon:\n * return 2 * (-z - self.epsilon)\n */\n __pyx_r = (-2.0 * (__pyx_v_z - __pyx_v_self->epsilon));\n goto __pyx_L0;\n goto __pyx_L3;\n }\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":318\n * if z > self.epsilon:\n * return -2 * (z - self.epsilon)\n * elif z < self.epsilon: # <<<<<<<<<<<<<<\n * return 2 * (-z - self.epsilon)\n * else:\n */\n __pyx_t_6 = (__pyx_v_z < __pyx_v_self->epsilon);\n if (__pyx_t_6) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":319\n * return -2 * (z - self.epsilon)\n * elif z < self.epsilon:\n * return 2 * (-z - self.epsilon) # <<<<<<<<<<<<<<\n * else:\n * return 0\n */\n __pyx_r = (2.0 * ((-__pyx_v_z) - __pyx_v_self->epsilon));\n goto __pyx_L0;\n goto __pyx_L3;\n }\n /*else*/ {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":321\n * return 2 * (-z - self.epsilon)\n * else:\n * return 0 # <<<<<<<<<<<<<<\n * \n * def __reduce__(self):\n */\n __pyx_r = 0.0;\n goto __pyx_L0;\n }\n __pyx_L3:;\n\n __pyx_r = 0;\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(\"sklearn.linear_model.sgd_fast.SquaredEpsilonInsensitive.dloss\", __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_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_5dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_5dloss(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n double __pyx_v_p;\n double __pyx_v_y;\n PyObject *__pyx_r = 0;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"dloss (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__p,&__pyx_n_s__y,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 case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\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__p)) != 0)) kw_args--;\n else goto __pyx_L5_argtuple_error;\n case 1:\n if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__y)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"dloss\", 1, 2, 2, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 313; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n }\n if (unlikely(kw_args > 0)) {\n if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"dloss\") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 313; __pyx_clineno = __LINE__; goto __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_p = __pyx_PyFloat_AsDouble(values[0]); if (unlikely((__pyx_v_p == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 313; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_y = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_y == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 313; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n goto __pyx_L4_argument_unpacking_done;\n __pyx_L5_argtuple_error:;\n __Pyx_RaiseArgtupleInvalid(\"dloss\", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 313; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.SquaredEpsilonInsensitive.dloss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __Pyx_RefNannyFinishContext();\n return NULL;\n __pyx_L4_argument_unpacking_done:;\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_4dloss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive *)__pyx_v_self), __pyx_v_p, __pyx_v_y);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":313\n * return ret * ret if ret > 0 else 0\n * \n * cpdef double dloss(self, double p, double y): # <<<<<<<<<<<<<<\n * cdef double z\n * z = y - p\n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_4dloss(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive *__pyx_v_self, double __pyx_v_p, double __pyx_v_y) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"dloss\", 0);\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive *)__pyx_v_self->__pyx_base.__pyx_base.__pyx_vtab)->__pyx_base.__pyx_base.dloss(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_self), __pyx_v_p, __pyx_v_y, 1)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 313; __pyx_clineno = __LINE__; goto __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 __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(\"sklearn.linear_model.sgd_fast.SquaredEpsilonInsensitive.dloss\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* Python wrapper */\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_7__reduce__(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_7__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_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_6__reduce__(((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive *)__pyx_v_self));\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":323\n * return 0\n * \n * def __reduce__(self): # <<<<<<<<<<<<<<\n * return SquaredEpsilonInsensitive, (self.epsilon,)\n * \n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_6__reduce__(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive *__pyx_v_self) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n PyObject *__pyx_t_2 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"__reduce__\", 0);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":324\n * \n * def __reduce__(self):\n * return SquaredEpsilonInsensitive, (self.epsilon,) # <<<<<<<<<<<<<<\n * \n * \n */\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyFloat_FromDouble(__pyx_v_self->epsilon); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 324; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n __pyx_t_2 = PyTuple_New(1); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 324; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_2, 0, __pyx_t_1);\n __Pyx_GIVEREF(__pyx_t_1);\n __pyx_t_1 = 0;\n __pyx_t_1 = PyTuple_New(2); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 324; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n __Pyx_INCREF(((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive)));\n PyTuple_SET_ITEM(__pyx_t_1, 0, ((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive)));\n __Pyx_GIVEREF(((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive)));\n PyTuple_SET_ITEM(__pyx_t_1, 1, ((PyObject *)__pyx_t_2));\n __Pyx_GIVEREF(((PyObject *)__pyx_t_2));\n __pyx_t_2 = 0;\n __pyx_r = ((PyObject *)__pyx_t_1);\n __pyx_t_1 = 0;\n goto __pyx_L0;\n\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_XDECREF(__pyx_t_2);\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.SquaredEpsilonInsensitive.__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/* Python wrapper */\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_1plain_sgd(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/\nstatic char __pyx_doc_7sklearn_12linear_model_8sgd_fast_plain_sgd[] = \"Plain SGD for generic loss functions and penalties.\\n\\n Parameters\\n ----------\\n weights : ndarray[double, ndim=1]\\n The allocated coef_ vector.\\n intercept : double\\n The initial intercept.\\n loss : LossFunction\\n A concrete ``LossFunction`` object.\\n penalty_type : int\\n The penalty 2 for L2, 1 for L1, and 3 for Elastic-Net.\\n alpha : float\\n The regularization parameter.\\n rho : float\\n The elastic net hyperparameter.\\n dataset : SequentialDataset\\n A concrete ``SequentialDataset`` object.\\n n_iter : int\\n The number of iterations (epochs).\\n fit_intercept : int\\n Whether or not to fit the intercept (1 or 0).\\n verbose : int\\n Print verbose output; 0 for quite.\\n shuffle : int\\n Whether to shuffle the training data before each epoch.\\n weight_pos : float\\n The weight of the positive class.\\n weight_neg : float\\n The weight of the negative class.\\n seed : int or RandomState object\\n The seed of the pseudo random number generator to use when\\n shuffling the data\\n learning_rate : int\\n The learning rate:\\n (1) constant, eta = eta0\\n (2) optimal, eta = 1.0/(t+t0)\\n (3) inverse scaling, eta = eta0 / pow(t, power_t)\\n (4) Passive Agressive-I, eta = min(alpha, loss/norm(x))\\n (5) Passive Agressive-II, eta = 1.0 / (norm(x) + 0.5*alpha)\\n eta0 : double\\n The initial learning rate.\\n power_t : double\\n The exponent for inverse scaling learning rate.\\n t : double\\n Initial state of the learning rate. This value is equal to the\\n iteration count except when the learning rate is set to `optimal`.\\n Default: 1.0.\\n\\n Returns\\n -------\\n weights : array, shape=[n_features]\\n The fitted weight vector.\\n intercept : float\\n The fitted intercept term.\\n\\n \";\nstatic PyMethodDef __pyx_mdef_7sklearn_12linear_model_8sgd_fast_1plain_sgd = {__Pyx_NAMESTR(\"plain_sgd\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_1plain_sgd, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(__pyx_doc_7sklearn_12linear_model_8sgd_fast_plain_sgd)};\nstatic PyObject *__pyx_pw_7sklearn_12linear_model_8sgd_fast_1plain_sgd(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {\n PyArrayObject *__pyx_v_weights = 0;\n double __pyx_v_intercept;\n struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *__pyx_v_loss = 0;\n int __pyx_v_penalty_type;\n double __pyx_v_alpha;\n double __pyx_v_C;\n double __pyx_v_rho;\n struct __pyx_obj_7sklearn_5utils_11seq_dataset_SequentialDataset *__pyx_v_dataset = 0;\n int __pyx_v_n_iter;\n int __pyx_v_fit_intercept;\n int __pyx_v_verbose;\n int __pyx_v_shuffle;\n PyObject *__pyx_v_seed = 0;\n double __pyx_v_weight_pos;\n double __pyx_v_weight_neg;\n int __pyx_v_learning_rate;\n double __pyx_v_eta0;\n double __pyx_v_power_t;\n double __pyx_v_t;\n double __pyx_v_intercept_decay;\n PyObject *__pyx_r = 0;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"plain_sgd (wrapper)\", 0);\n {\n static PyObject **__pyx_pyargnames[] = {&__pyx_n_s__weights,&__pyx_n_s__intercept,&__pyx_n_s__loss,&__pyx_n_s__penalty_type,&__pyx_n_s__alpha,&__pyx_n_s__C,&__pyx_n_s__rho,&__pyx_n_s__dataset,&__pyx_n_s__n_iter,&__pyx_n_s__fit_intercept,&__pyx_n_s__verbose,&__pyx_n_s__shuffle,&__pyx_n_s__seed,&__pyx_n_s__weight_pos,&__pyx_n_s__weight_neg,&__pyx_n_s__learning_rate,&__pyx_n_s__eta0,&__pyx_n_s__power_t,&__pyx_n_s__t,&__pyx_n_s__intercept_decay,0};\n PyObject* values[20] = {0,0,0,0,0,0,0,0,0,0,0,0,0,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 20: values[19] = PyTuple_GET_ITEM(__pyx_args, 19);\n case 19: values[18] = PyTuple_GET_ITEM(__pyx_args, 18);\n case 18: values[17] = PyTuple_GET_ITEM(__pyx_args, 17);\n case 17: values[16] = PyTuple_GET_ITEM(__pyx_args, 16);\n case 16: values[15] = PyTuple_GET_ITEM(__pyx_args, 15);\n case 15: values[14] = PyTuple_GET_ITEM(__pyx_args, 14);\n case 14: values[13] = PyTuple_GET_ITEM(__pyx_args, 13);\n case 13: values[12] = PyTuple_GET_ITEM(__pyx_args, 12);\n case 12: values[11] = PyTuple_GET_ITEM(__pyx_args, 11);\n case 11: values[10] = PyTuple_GET_ITEM(__pyx_args, 10);\n case 10: values[9] = PyTuple_GET_ITEM(__pyx_args, 9);\n case 9: values[8] = PyTuple_GET_ITEM(__pyx_args, 8);\n case 8: values[7] = PyTuple_GET_ITEM(__pyx_args, 7);\n case 7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n case 6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n case 5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);\n case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);\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__weights)) != 0)) kw_args--;\n else goto __pyx_L5_argtuple_error;\n case 1:\n if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__intercept)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"plain_sgd\", 0, 18, 20, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n case 2:\n if (likely((values[2] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__loss)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"plain_sgd\", 0, 18, 20, 2); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n case 3:\n if (likely((values[3] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__penalty_type)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"plain_sgd\", 0, 18, 20, 3); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n case 4:\n if (likely((values[4] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__alpha)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"plain_sgd\", 0, 18, 20, 4); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n case 5:\n if (likely((values[5] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__C)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"plain_sgd\", 0, 18, 20, 5); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n case 6:\n if (likely((values[6] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__rho)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"plain_sgd\", 0, 18, 20, 6); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n case 7:\n if (likely((values[7] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__dataset)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"plain_sgd\", 0, 18, 20, 7); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n case 8:\n if (likely((values[8] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__n_iter)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"plain_sgd\", 0, 18, 20, 8); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n case 9:\n if (likely((values[9] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__fit_intercept)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"plain_sgd\", 0, 18, 20, 9); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n case 10:\n if (likely((values[10] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__verbose)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"plain_sgd\", 0, 18, 20, 10); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n case 11:\n if (likely((values[11] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__shuffle)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"plain_sgd\", 0, 18, 20, 11); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n case 12:\n if (likely((values[12] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__seed)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"plain_sgd\", 0, 18, 20, 12); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n case 13:\n if (likely((values[13] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__weight_pos)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"plain_sgd\", 0, 18, 20, 13); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n case 14:\n if (likely((values[14] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__weight_neg)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"plain_sgd\", 0, 18, 20, 14); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n case 15:\n if (likely((values[15] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__learning_rate)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"plain_sgd\", 0, 18, 20, 15); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n case 16:\n if (likely((values[16] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__eta0)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"plain_sgd\", 0, 18, 20, 16); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n case 17:\n if (likely((values[17] = PyDict_GetItem(__pyx_kwds, __pyx_n_s__power_t)) != 0)) kw_args--;\n else {\n __Pyx_RaiseArgtupleInvalid(\"plain_sgd\", 0, 18, 20, 17); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n case 18:\n if (kw_args > 0) {\n PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s__t);\n if (value) { values[18] = value; kw_args--; }\n }\n case 19:\n if (kw_args > 0) {\n PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s__intercept_decay);\n if (value) { values[19] = value; kw_args--; }\n }\n }\n if (unlikely(kw_args > 0)) {\n if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, \"plain_sgd\") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n }\n } else {\n switch (PyTuple_GET_SIZE(__pyx_args)) {\n case 20: values[19] = PyTuple_GET_ITEM(__pyx_args, 19);\n case 19: values[18] = PyTuple_GET_ITEM(__pyx_args, 18);\n case 18: values[17] = PyTuple_GET_ITEM(__pyx_args, 17);\n values[16] = PyTuple_GET_ITEM(__pyx_args, 16);\n values[15] = PyTuple_GET_ITEM(__pyx_args, 15);\n values[14] = PyTuple_GET_ITEM(__pyx_args, 14);\n values[13] = PyTuple_GET_ITEM(__pyx_args, 13);\n values[12] = PyTuple_GET_ITEM(__pyx_args, 12);\n values[11] = PyTuple_GET_ITEM(__pyx_args, 11);\n values[10] = PyTuple_GET_ITEM(__pyx_args, 10);\n values[9] = PyTuple_GET_ITEM(__pyx_args, 9);\n values[8] = PyTuple_GET_ITEM(__pyx_args, 8);\n values[7] = PyTuple_GET_ITEM(__pyx_args, 7);\n values[6] = PyTuple_GET_ITEM(__pyx_args, 6);\n values[5] = PyTuple_GET_ITEM(__pyx_args, 5);\n values[4] = PyTuple_GET_ITEM(__pyx_args, 4);\n values[3] = PyTuple_GET_ITEM(__pyx_args, 3);\n values[2] = PyTuple_GET_ITEM(__pyx_args, 2);\n 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_weights = ((PyArrayObject *)values[0]);\n __pyx_v_intercept = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_intercept == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 328; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_loss = ((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)values[2]);\n __pyx_v_penalty_type = __Pyx_PyInt_AsInt(values[3]); if (unlikely((__pyx_v_penalty_type == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 330; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_alpha = __pyx_PyFloat_AsDouble(values[4]); if (unlikely((__pyx_v_alpha == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 331; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_C = __pyx_PyFloat_AsDouble(values[5]); if (unlikely((__pyx_v_C == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 331; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_rho = __pyx_PyFloat_AsDouble(values[6]); if (unlikely((__pyx_v_rho == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 332; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_dataset = ((struct __pyx_obj_7sklearn_5utils_11seq_dataset_SequentialDataset *)values[7]);\n __pyx_v_n_iter = __Pyx_PyInt_AsInt(values[8]); if (unlikely((__pyx_v_n_iter == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 334; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_fit_intercept = __Pyx_PyInt_AsInt(values[9]); if (unlikely((__pyx_v_fit_intercept == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 334; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_verbose = __Pyx_PyInt_AsInt(values[10]); if (unlikely((__pyx_v_verbose == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 335; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_shuffle = __Pyx_PyInt_AsInt(values[11]); if (unlikely((__pyx_v_shuffle == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 335; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_seed = values[12];\n __pyx_v_weight_pos = __pyx_PyFloat_AsDouble(values[13]); if (unlikely((__pyx_v_weight_pos == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 336; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_weight_neg = __pyx_PyFloat_AsDouble(values[14]); if (unlikely((__pyx_v_weight_neg == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 336; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_learning_rate = __Pyx_PyInt_AsInt(values[15]); if (unlikely((__pyx_v_learning_rate == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 337; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_eta0 = __pyx_PyFloat_AsDouble(values[16]); if (unlikely((__pyx_v_eta0 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 337; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_v_power_t = __pyx_PyFloat_AsDouble(values[17]); if (unlikely((__pyx_v_power_t == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 338; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n if (values[18]) {\n __pyx_v_t = __pyx_PyFloat_AsDouble(values[18]); if (unlikely((__pyx_v_t == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 339; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n } else {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":339\n * int learning_rate, double eta0,\n * double power_t,\n * double t=1.0, # <<<<<<<<<<<<<<\n * double intercept_decay=1.0):\n * \"\"\"Plain SGD for generic loss functions and penalties.\n */\n __pyx_v_t = ((double)1.0);\n }\n if (values[19]) {\n __pyx_v_intercept_decay = __pyx_PyFloat_AsDouble(values[19]); if (unlikely((__pyx_v_intercept_decay == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 340; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n } else {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":340\n * double power_t,\n * double t=1.0,\n * double intercept_decay=1.0): # <<<<<<<<<<<<<<\n * \"\"\"Plain SGD for generic loss functions and penalties.\n * \n */\n __pyx_v_intercept_decay = ((double)1.0);\n }\n }\n goto __pyx_L4_argument_unpacking_done;\n __pyx_L5_argtuple_error:;\n __Pyx_RaiseArgtupleInvalid(\"plain_sgd\", 0, 18, 20, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L3_error;}\n __pyx_L3_error:;\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.plain_sgd\", __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_weights), __pyx_ptype_5numpy_ndarray, 1, \"weights\", 0))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_loss), __pyx_ptype_7sklearn_12linear_model_8sgd_fast_LossFunction, 1, \"loss\", 0))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 329; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_dataset), __pyx_ptype_7sklearn_5utils_11seq_dataset_SequentialDataset, 1, \"dataset\", 0))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 333; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_r = __pyx_pf_7sklearn_12linear_model_8sgd_fast_plain_sgd(__pyx_self, __pyx_v_weights, __pyx_v_intercept, __pyx_v_loss, __pyx_v_penalty_type, __pyx_v_alpha, __pyx_v_C, __pyx_v_rho, __pyx_v_dataset, __pyx_v_n_iter, __pyx_v_fit_intercept, __pyx_v_verbose, __pyx_v_shuffle, __pyx_v_seed, __pyx_v_weight_pos, __pyx_v_weight_neg, __pyx_v_learning_rate, __pyx_v_eta0, __pyx_v_power_t, __pyx_v_t, __pyx_v_intercept_decay);\n goto __pyx_L0;\n __pyx_L1_error:;\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":327\n * \n * \n * def plain_sgd(np.ndarray[DOUBLE, ndim=1, mode='c'] weights, # <<<<<<<<<<<<<<\n * double intercept,\n * LossFunction loss,\n */\n\nstatic PyObject *__pyx_pf_7sklearn_12linear_model_8sgd_fast_plain_sgd(CYTHON_UNUSED PyObject *__pyx_self, PyArrayObject *__pyx_v_weights, double __pyx_v_intercept, struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *__pyx_v_loss, int __pyx_v_penalty_type, double __pyx_v_alpha, double __pyx_v_C, double __pyx_v_rho, struct __pyx_obj_7sklearn_5utils_11seq_dataset_SequentialDataset *__pyx_v_dataset, int __pyx_v_n_iter, int __pyx_v_fit_intercept, int __pyx_v_verbose, int __pyx_v_shuffle, PyObject *__pyx_v_seed, double __pyx_v_weight_pos, double __pyx_v_weight_neg, int __pyx_v_learning_rate, double __pyx_v_eta0, double __pyx_v_power_t, double __pyx_v_t, double __pyx_v_intercept_decay) {\n Py_ssize_t __pyx_v_n_samples;\n Py_ssize_t __pyx_v_n_features;\n struct __pyx_obj_7sklearn_5utils_13weight_vector_WeightVector *__pyx_v_w = 0;\n __pyx_t_7sklearn_12linear_model_8sgd_fast_DOUBLE *__pyx_v_x_data_ptr;\n __pyx_t_7sklearn_12linear_model_8sgd_fast_INTEGER *__pyx_v_x_ind_ptr;\n int __pyx_v_xnnz;\n double __pyx_v_eta;\n double __pyx_v_p;\n double __pyx_v_update;\n double __pyx_v_sumloss;\n __pyx_t_7sklearn_12linear_model_8sgd_fast_DOUBLE __pyx_v_y;\n __pyx_t_7sklearn_12linear_model_8sgd_fast_DOUBLE __pyx_v_sample_weight;\n double __pyx_v_class_weight;\n unsigned int __pyx_v_count;\n unsigned int __pyx_v_epoch;\n CYTHON_UNUSED unsigned int __pyx_v_i;\n int __pyx_v_is_hinge;\n PyArrayObject *__pyx_v_q = 0;\n __pyx_t_7sklearn_12linear_model_8sgd_fast_DOUBLE *__pyx_v_q_data_ptr;\n double __pyx_v_u;\n PyObject *__pyx_v_t_start = NULL;\n __Pyx_LocalBuf_ND __pyx_pybuffernd_q;\n __Pyx_Buffer __pyx_pybuffer_q;\n __Pyx_LocalBuf_ND __pyx_pybuffernd_weights;\n __Pyx_Buffer __pyx_pybuffer_weights;\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n Py_ssize_t __pyx_t_1;\n PyObject *__pyx_t_2 = NULL;\n PyObject *__pyx_t_3 = NULL;\n int __pyx_t_4;\n PyArrayObject *__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 PyObject *__pyx_t_10 = NULL;\n PyObject *__pyx_t_11 = NULL;\n PyObject *__pyx_t_12 = NULL;\n unsigned int __pyx_t_13;\n unsigned int __pyx_t_14;\n PyObject *__pyx_t_15 = NULL;\n int __pyx_t_16;\n int __pyx_t_17;\n int __pyx_t_18;\n int __pyx_t_19;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"plain_sgd\", 0);\n __pyx_pybuffer_q.pybuffer.buf = NULL;\n __pyx_pybuffer_q.refcount = 0;\n __pyx_pybuffernd_q.data = NULL;\n __pyx_pybuffernd_q.rcbuffer = &__pyx_pybuffer_q;\n __pyx_pybuffer_weights.pybuffer.buf = NULL;\n __pyx_pybuffer_weights.refcount = 0;\n __pyx_pybuffernd_weights.data = NULL;\n __pyx_pybuffernd_weights.rcbuffer = &__pyx_pybuffer_weights;\n {\n __Pyx_BufFmt_StackElem __pyx_stack[1];\n if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_weights.rcbuffer->pybuffer, (PyObject*)__pyx_v_weights, &__Pyx_TypeInfo_nn___pyx_t_7sklearn_12linear_model_8sgd_fast_DOUBLE, PyBUF_FORMAT| PyBUF_C_CONTIGUOUS, 1, 0, __pyx_stack) == -1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n }\n __pyx_pybuffernd_weights.diminfo[0].strides = __pyx_pybuffernd_weights.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_weights.diminfo[0].shape = __pyx_pybuffernd_weights.rcbuffer->pybuffer.shape[0];\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":400\n * \n * # get the data information into easy vars\n * cdef Py_ssize_t n_samples = dataset.n_samples # <<<<<<<<<<<<<<\n * cdef Py_ssize_t n_features = weights.shape[0]\n * \n */\n __pyx_t_1 = __pyx_v_dataset->n_samples;\n __pyx_v_n_samples = __pyx_t_1;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":401\n * # get the data information into easy vars\n * cdef Py_ssize_t n_samples = dataset.n_samples\n * cdef Py_ssize_t n_features = weights.shape[0] # <<<<<<<<<<<<<<\n * \n * cdef WeightVector w = WeightVector(weights)\n */\n __pyx_v_n_features = (__pyx_v_weights->dimensions[0]);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":403\n * cdef Py_ssize_t n_features = weights.shape[0]\n * \n * cdef WeightVector w = WeightVector(weights) # <<<<<<<<<<<<<<\n * \n * cdef DOUBLE * x_data_ptr = NULL\n */\n __pyx_t_2 = PyTuple_New(1); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 403; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __Pyx_INCREF(((PyObject *)__pyx_v_weights));\n PyTuple_SET_ITEM(__pyx_t_2, 0, ((PyObject *)__pyx_v_weights));\n __Pyx_GIVEREF(((PyObject *)__pyx_v_weights));\n __pyx_t_3 = PyObject_Call(((PyObject *)((PyObject*)__pyx_ptype_7sklearn_5utils_13weight_vector_WeightVector)), ((PyObject *)__pyx_t_2), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 403; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(((PyObject *)__pyx_t_2)); __pyx_t_2 = 0;\n __pyx_v_w = ((struct __pyx_obj_7sklearn_5utils_13weight_vector_WeightVector *)__pyx_t_3);\n __pyx_t_3 = 0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":405\n * cdef WeightVector w = WeightVector(weights)\n * \n * cdef DOUBLE * x_data_ptr = NULL # <<<<<<<<<<<<<<\n * cdef INTEGER * x_ind_ptr = NULL\n * \n */\n __pyx_v_x_data_ptr = NULL;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":406\n * \n * cdef DOUBLE * x_data_ptr = NULL\n * cdef INTEGER * x_ind_ptr = NULL # <<<<<<<<<<<<<<\n * \n * # helper variable\n */\n __pyx_v_x_ind_ptr = NULL;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":410\n * # helper variable\n * cdef int xnnz\n * cdef double eta = 0.0 # <<<<<<<<<<<<<<\n * cdef double p = 0.0\n * cdef double update = 0.0\n */\n __pyx_v_eta = 0.0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":411\n * cdef int xnnz\n * cdef double eta = 0.0\n * cdef double p = 0.0 # <<<<<<<<<<<<<<\n * cdef double update = 0.0\n * cdef double sumloss = 0.0\n */\n __pyx_v_p = 0.0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":412\n * cdef double eta = 0.0\n * cdef double p = 0.0\n * cdef double update = 0.0 # <<<<<<<<<<<<<<\n * cdef double sumloss = 0.0\n * cdef DOUBLE y = 0.0\n */\n __pyx_v_update = 0.0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":413\n * cdef double p = 0.0\n * cdef double update = 0.0\n * cdef double sumloss = 0.0 # <<<<<<<<<<<<<<\n * cdef DOUBLE y = 0.0\n * cdef DOUBLE sample_weight\n */\n __pyx_v_sumloss = 0.0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":414\n * cdef double update = 0.0\n * cdef double sumloss = 0.0\n * cdef DOUBLE y = 0.0 # <<<<<<<<<<<<<<\n * cdef DOUBLE sample_weight\n * cdef double class_weight = 1.0\n */\n __pyx_v_y = 0.0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":416\n * cdef DOUBLE y = 0.0\n * cdef DOUBLE sample_weight\n * cdef double class_weight = 1.0 # <<<<<<<<<<<<<<\n * cdef unsigned int count = 0\n * cdef unsigned int epoch = 0\n */\n __pyx_v_class_weight = 1.0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":417\n * cdef DOUBLE sample_weight\n * cdef double class_weight = 1.0\n * cdef unsigned int count = 0 # <<<<<<<<<<<<<<\n * cdef unsigned int epoch = 0\n * cdef unsigned int i = 0\n */\n __pyx_v_count = 0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":418\n * cdef double class_weight = 1.0\n * cdef unsigned int count = 0\n * cdef unsigned int epoch = 0 # <<<<<<<<<<<<<<\n * cdef unsigned int i = 0\n * cdef int is_hinge = isinstance(loss, Hinge)\n */\n __pyx_v_epoch = 0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":419\n * cdef unsigned int count = 0\n * cdef unsigned int epoch = 0\n * cdef unsigned int i = 0 # <<<<<<<<<<<<<<\n * cdef int is_hinge = isinstance(loss, Hinge)\n * \n */\n __pyx_v_i = 0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":420\n * cdef unsigned int epoch = 0\n * cdef unsigned int i = 0\n * cdef int is_hinge = isinstance(loss, Hinge) # <<<<<<<<<<<<<<\n * \n * # q vector is only used for L1 regularization\n */\n __pyx_t_3 = ((PyObject *)((PyObject*)__pyx_ptype_7sklearn_12linear_model_8sgd_fast_Hinge));\n __Pyx_INCREF(__pyx_t_3);\n __pyx_t_4 = __Pyx_TypeCheck(((PyObject *)__pyx_v_loss), __pyx_t_3); \n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_v_is_hinge = __pyx_t_4;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":423\n * \n * # q vector is only used for L1 regularization\n * cdef np.ndarray[DOUBLE, ndim = 1, mode = \"c\"] q = None # <<<<<<<<<<<<<<\n * cdef DOUBLE * q_data_ptr = NULL\n * if penalty_type == L1 or penalty_type == ELASTICNET:\n */\n __pyx_t_5 = ((PyArrayObject *)Py_None);\n {\n __Pyx_BufFmt_StackElem __pyx_stack[1];\n if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_q.rcbuffer->pybuffer, (PyObject*)__pyx_t_5, &__Pyx_TypeInfo_nn___pyx_t_7sklearn_12linear_model_8sgd_fast_DOUBLE, PyBUF_FORMAT| PyBUF_C_CONTIGUOUS, 1, 0, __pyx_stack) == -1)) {\n __pyx_v_q = ((PyArrayObject *)Py_None); __Pyx_INCREF(Py_None); __pyx_pybuffernd_q.rcbuffer->pybuffer.buf = NULL;\n {__pyx_filename = __pyx_f[0]; __pyx_lineno = 423; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n } else {__pyx_pybuffernd_q.diminfo[0].strides = __pyx_pybuffernd_q.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_q.diminfo[0].shape = __pyx_pybuffernd_q.rcbuffer->pybuffer.shape[0];\n }\n }\n __pyx_t_5 = 0;\n __Pyx_INCREF(Py_None);\n __pyx_v_q = ((PyArrayObject *)Py_None);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":424\n * # q vector is only used for L1 regularization\n * cdef np.ndarray[DOUBLE, ndim = 1, mode = \"c\"] q = None\n * cdef DOUBLE * q_data_ptr = NULL # <<<<<<<<<<<<<<\n * if penalty_type == L1 or penalty_type == ELASTICNET:\n * q = np.zeros((n_features,), dtype=np.float64, order=\"c\")\n */\n __pyx_v_q_data_ptr = NULL;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":425\n * cdef np.ndarray[DOUBLE, ndim = 1, mode = \"c\"] q = None\n * cdef DOUBLE * q_data_ptr = NULL\n * if penalty_type == L1 or penalty_type == ELASTICNET: # <<<<<<<<<<<<<<\n * q = np.zeros((n_features,), dtype=np.float64, order=\"c\")\n * q_data_ptr = q.data\n */\n switch (__pyx_v_penalty_type) {\n case 1:\n case 3:\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":426\n * cdef DOUBLE * q_data_ptr = NULL\n * if penalty_type == L1 or penalty_type == ELASTICNET:\n * q = np.zeros((n_features,), dtype=np.float64, order=\"c\") # <<<<<<<<<<<<<<\n * q_data_ptr = q.data\n * cdef double u = 0.0\n */\n __pyx_t_3 = __Pyx_GetName(__pyx_m, __pyx_n_s__np); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 426; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_2 = PyObject_GetAttr(__pyx_t_3, __pyx_n_s__zeros); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 426; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_3 = PyInt_FromSsize_t(__pyx_v_n_features); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 426; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_6 = PyTuple_New(1); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 426; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_6);\n PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_3 = 0;\n __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 426; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n PyTuple_SET_ITEM(__pyx_t_3, 0, ((PyObject *)__pyx_t_6));\n __Pyx_GIVEREF(((PyObject *)__pyx_t_6));\n __pyx_t_6 = 0;\n __pyx_t_6 = PyDict_New(); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 426; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(((PyObject *)__pyx_t_6));\n __pyx_t_7 = __Pyx_GetName(__pyx_m, __pyx_n_s__np); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 426; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_7);\n __pyx_t_8 = PyObject_GetAttr(__pyx_t_7, __pyx_n_s__float64); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 426; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_8);\n __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n if (PyDict_SetItem(__pyx_t_6, ((PyObject *)__pyx_n_s__dtype), __pyx_t_8) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 426; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n if (PyDict_SetItem(__pyx_t_6, ((PyObject *)__pyx_n_s__order), ((PyObject *)__pyx_n_s__c)) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 426; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_t_8 = PyObject_Call(__pyx_t_2, ((PyObject *)__pyx_t_3), ((PyObject *)__pyx_t_6)); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 426; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_8);\n __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n __Pyx_DECREF(((PyObject *)__pyx_t_3)); __pyx_t_3 = 0;\n __Pyx_DECREF(((PyObject *)__pyx_t_6)); __pyx_t_6 = 0;\n if (!(likely(((__pyx_t_8) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_8, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 426; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_t_5 = ((PyArrayObject *)__pyx_t_8);\n {\n __Pyx_BufFmt_StackElem __pyx_stack[1];\n __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_q.rcbuffer->pybuffer);\n __pyx_t_9 = __Pyx_GetBufferAndValidate(&__pyx_pybuffernd_q.rcbuffer->pybuffer, (PyObject*)__pyx_t_5, &__Pyx_TypeInfo_nn___pyx_t_7sklearn_12linear_model_8sgd_fast_DOUBLE, PyBUF_FORMAT| PyBUF_C_CONTIGUOUS, 1, 0, __pyx_stack);\n if (unlikely(__pyx_t_9 < 0)) {\n PyErr_Fetch(&__pyx_t_10, &__pyx_t_11, &__pyx_t_12);\n if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_q.rcbuffer->pybuffer, (PyObject*)__pyx_v_q, &__Pyx_TypeInfo_nn___pyx_t_7sklearn_12linear_model_8sgd_fast_DOUBLE, PyBUF_FORMAT| PyBUF_C_CONTIGUOUS, 1, 0, __pyx_stack) == -1)) {\n Py_XDECREF(__pyx_t_10); Py_XDECREF(__pyx_t_11); Py_XDECREF(__pyx_t_12);\n __Pyx_RaiseBufferFallbackError();\n } else {\n PyErr_Restore(__pyx_t_10, __pyx_t_11, __pyx_t_12);\n }\n }\n __pyx_pybuffernd_q.diminfo[0].strides = __pyx_pybuffernd_q.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_q.diminfo[0].shape = __pyx_pybuffernd_q.rcbuffer->pybuffer.shape[0];\n if (unlikely(__pyx_t_9 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 426; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n }\n __pyx_t_5 = 0;\n __Pyx_DECREF(((PyObject *)__pyx_v_q));\n __pyx_v_q = ((PyArrayObject *)__pyx_t_8);\n __pyx_t_8 = 0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":427\n * if penalty_type == L1 or penalty_type == ELASTICNET:\n * q = np.zeros((n_features,), dtype=np.float64, order=\"c\")\n * q_data_ptr = q.data # <<<<<<<<<<<<<<\n * cdef double u = 0.0\n * \n */\n __pyx_v_q_data_ptr = ((__pyx_t_7sklearn_12linear_model_8sgd_fast_DOUBLE *)__pyx_v_q->data);\n break;\n }\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":428\n * q = np.zeros((n_features,), dtype=np.float64, order=\"c\")\n * q_data_ptr = q.data\n * cdef double u = 0.0 # <<<<<<<<<<<<<<\n * \n * if penalty_type == L2:\n */\n __pyx_v_u = 0.0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":432\n * if penalty_type == L2:\n * rho = 1.0\n * elif penalty_type == L1: # <<<<<<<<<<<<<<\n * rho = 0.0\n * \n */\n switch (__pyx_v_penalty_type) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":430\n * cdef double u = 0.0\n * \n * if penalty_type == L2: # <<<<<<<<<<<<<<\n * rho = 1.0\n * elif penalty_type == L1:\n */\n case 2:\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":431\n * \n * if penalty_type == L2:\n * rho = 1.0 # <<<<<<<<<<<<<<\n * elif penalty_type == L1:\n * rho = 0.0\n */\n __pyx_v_rho = 1.0;\n break;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":432\n * if penalty_type == L2:\n * rho = 1.0\n * elif penalty_type == L1: # <<<<<<<<<<<<<<\n * rho = 0.0\n * \n */\n case 1:\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":433\n * rho = 1.0\n * elif penalty_type == L1:\n * rho = 0.0 # <<<<<<<<<<<<<<\n * \n * eta = eta0\n */\n __pyx_v_rho = 0.0;\n break;\n }\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":435\n * rho = 0.0\n * \n * eta = eta0 # <<<<<<<<<<<<<<\n * \n * t_start = time()\n */\n __pyx_v_eta = __pyx_v_eta0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":437\n * eta = eta0\n * \n * t_start = time() # <<<<<<<<<<<<<<\n * for epoch in range(n_iter):\n * if verbose > 0:\n */\n __pyx_t_8 = __Pyx_GetName(__pyx_m, __pyx_n_s__time); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 437; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_8);\n __pyx_t_6 = PyObject_Call(__pyx_t_8, ((PyObject *)__pyx_empty_tuple), NULL); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 437; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_6);\n __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n __pyx_v_t_start = __pyx_t_6;\n __pyx_t_6 = 0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":438\n * \n * t_start = time()\n * for epoch in range(n_iter): # <<<<<<<<<<<<<<\n * if verbose > 0:\n * print(\"-- Epoch %d\" % (epoch + 1))\n */\n __pyx_t_9 = __pyx_v_n_iter;\n for (__pyx_t_13 = 0; __pyx_t_13 < __pyx_t_9; __pyx_t_13+=1) {\n __pyx_v_epoch = __pyx_t_13;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":439\n * t_start = time()\n * for epoch in range(n_iter):\n * if verbose > 0: # <<<<<<<<<<<<<<\n * print(\"-- Epoch %d\" % (epoch + 1))\n * if shuffle:\n */\n __pyx_t_4 = (__pyx_v_verbose > 0);\n if (__pyx_t_4) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":440\n * for epoch in range(n_iter):\n * if verbose > 0:\n * print(\"-- Epoch %d\" % (epoch + 1)) # <<<<<<<<<<<<<<\n * if shuffle:\n * dataset.shuffle(seed)\n */\n __pyx_t_6 = PyInt_FromLong((__pyx_v_epoch + 1)); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 440; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_6);\n __pyx_t_8 = PyNumber_Remainder(((PyObject *)__pyx_kp_s_1), __pyx_t_6); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 440; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(((PyObject *)__pyx_t_8));\n __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n if (__Pyx_PrintOne(0, ((PyObject *)__pyx_t_8)) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 440; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(((PyObject *)__pyx_t_8)); __pyx_t_8 = 0;\n goto __pyx_L5;\n }\n __pyx_L5:;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":441\n * if verbose > 0:\n * print(\"-- Epoch %d\" % (epoch + 1))\n * if shuffle: # <<<<<<<<<<<<<<\n * dataset.shuffle(seed)\n * for i in range(n_samples):\n */\n if (__pyx_v_shuffle) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":442\n * print(\"-- Epoch %d\" % (epoch + 1))\n * if shuffle:\n * dataset.shuffle(seed) # <<<<<<<<<<<<<<\n * for i in range(n_samples):\n * dataset.next( & x_data_ptr, & x_ind_ptr, & xnnz, & y,\n */\n ((struct __pyx_vtabstruct_7sklearn_5utils_11seq_dataset_SequentialDataset *)__pyx_v_dataset->__pyx_vtab)->shuffle(__pyx_v_dataset, __pyx_v_seed);\n goto __pyx_L6;\n }\n __pyx_L6:;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":443\n * if shuffle:\n * dataset.shuffle(seed)\n * for i in range(n_samples): # <<<<<<<<<<<<<<\n * dataset.next( & x_data_ptr, & x_ind_ptr, & xnnz, & y,\n * & sample_weight)\n */\n __pyx_t_1 = __pyx_v_n_samples;\n for (__pyx_t_14 = 0; __pyx_t_14 < __pyx_t_1; __pyx_t_14+=1) {\n __pyx_v_i = __pyx_t_14;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":445\n * for i in range(n_samples):\n * dataset.next( & x_data_ptr, & x_ind_ptr, & xnnz, & y,\n * & sample_weight) # <<<<<<<<<<<<<<\n * \n * p = w.dot(x_data_ptr, x_ind_ptr, xnnz) + intercept\n */\n ((struct __pyx_vtabstruct_7sklearn_5utils_11seq_dataset_SequentialDataset *)__pyx_v_dataset->__pyx_vtab)->next(__pyx_v_dataset, (&__pyx_v_x_data_ptr), (&__pyx_v_x_ind_ptr), (&__pyx_v_xnnz), (&__pyx_v_y), (&__pyx_v_sample_weight));\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":447\n * & sample_weight)\n * \n * p = w.dot(x_data_ptr, x_ind_ptr, xnnz) + intercept # <<<<<<<<<<<<<<\n * \n * if learning_rate == OPTIMAL:\n */\n __pyx_v_p = (((struct __pyx_vtabstruct_7sklearn_5utils_13weight_vector_WeightVector *)__pyx_v_w->__pyx_vtab)->dot(__pyx_v_w, __pyx_v_x_data_ptr, __pyx_v_x_ind_ptr, __pyx_v_xnnz) + __pyx_v_intercept);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":451\n * if learning_rate == OPTIMAL:\n * eta = 1.0 / (alpha * t)\n * elif learning_rate == INVSCALING: # <<<<<<<<<<<<<<\n * eta = eta0 / pow(t, power_t)\n * \n */\n switch (__pyx_v_learning_rate) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":449\n * p = w.dot(x_data_ptr, x_ind_ptr, xnnz) + intercept\n * \n * if learning_rate == OPTIMAL: # <<<<<<<<<<<<<<\n * eta = 1.0 / (alpha * t)\n * elif learning_rate == INVSCALING:\n */\n case 2:\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":450\n * \n * if learning_rate == OPTIMAL:\n * eta = 1.0 / (alpha * t) # <<<<<<<<<<<<<<\n * elif learning_rate == INVSCALING:\n * eta = eta0 / pow(t, power_t)\n */\n __pyx_v_eta = (1.0 / (__pyx_v_alpha * __pyx_v_t));\n break;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":451\n * if learning_rate == OPTIMAL:\n * eta = 1.0 / (alpha * t)\n * elif learning_rate == INVSCALING: # <<<<<<<<<<<<<<\n * eta = eta0 / pow(t, power_t)\n * \n */\n case 3:\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":452\n * eta = 1.0 / (alpha * t)\n * elif learning_rate == INVSCALING:\n * eta = eta0 / pow(t, power_t) # <<<<<<<<<<<<<<\n * \n * if verbose > 0:\n */\n __pyx_v_eta = (__pyx_v_eta0 / pow(__pyx_v_t, __pyx_v_power_t));\n break;\n }\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":454\n * eta = eta0 / pow(t, power_t)\n * \n * if verbose > 0: # <<<<<<<<<<<<<<\n * sumloss += loss.loss(p, y)\n * \n */\n __pyx_t_4 = (__pyx_v_verbose > 0);\n if (__pyx_t_4) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":455\n * \n * if verbose > 0:\n * sumloss += loss.loss(p, y) # <<<<<<<<<<<<<<\n * \n * if y > 0.0:\n */\n __pyx_v_sumloss = (__pyx_v_sumloss + ((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_loss->__pyx_vtab)->loss(__pyx_v_loss, __pyx_v_p, __pyx_v_y, 0));\n goto __pyx_L9;\n }\n __pyx_L9:;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":457\n * sumloss += loss.loss(p, y)\n * \n * if y > 0.0: # <<<<<<<<<<<<<<\n * class_weight = weight_pos\n * else:\n */\n __pyx_t_4 = (__pyx_v_y > 0.0);\n if (__pyx_t_4) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":458\n * \n * if y > 0.0:\n * class_weight = weight_pos # <<<<<<<<<<<<<<\n * else:\n * class_weight = weight_neg\n */\n __pyx_v_class_weight = __pyx_v_weight_pos;\n goto __pyx_L10;\n }\n /*else*/ {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":460\n * class_weight = weight_pos\n * else:\n * class_weight = weight_neg # <<<<<<<<<<<<<<\n * \n * if learning_rate == PA1:\n */\n __pyx_v_class_weight = __pyx_v_weight_neg;\n }\n __pyx_L10:;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":467\n * continue\n * update = min(C, loss.loss(p, y) / update)\n * elif learning_rate == PA2: # <<<<<<<<<<<<<<\n * update = sqnorm(x_data_ptr, x_ind_ptr, xnnz)\n * update = loss.loss(p, y) / (update + 0.5 / C)\n */\n switch (__pyx_v_learning_rate) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":462\n * class_weight = weight_neg\n * \n * if learning_rate == PA1: # <<<<<<<<<<<<<<\n * update = sqnorm(x_data_ptr, x_ind_ptr, xnnz)\n * if update == 0:\n */\n case 4:\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":463\n * \n * if learning_rate == PA1:\n * update = sqnorm(x_data_ptr, x_ind_ptr, xnnz) # <<<<<<<<<<<<<<\n * if update == 0:\n * continue\n */\n __pyx_v_update = __pyx_f_7sklearn_12linear_model_8sgd_fast_sqnorm(__pyx_v_x_data_ptr, __pyx_v_x_ind_ptr, __pyx_v_xnnz);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":464\n * if learning_rate == PA1:\n * update = sqnorm(x_data_ptr, x_ind_ptr, xnnz)\n * if update == 0: # <<<<<<<<<<<<<<\n * continue\n * update = min(C, loss.loss(p, y) / update)\n */\n __pyx_t_4 = (__pyx_v_update == 0.0);\n if (__pyx_t_4) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":465\n * update = sqnorm(x_data_ptr, x_ind_ptr, xnnz)\n * if update == 0:\n * continue # <<<<<<<<<<<<<<\n * update = min(C, loss.loss(p, y) / update)\n * elif learning_rate == PA2:\n */\n goto __pyx_L7_continue;\n goto __pyx_L11;\n }\n __pyx_L11:;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":466\n * if update == 0:\n * continue\n * update = min(C, loss.loss(p, y) / update) # <<<<<<<<<<<<<<\n * elif learning_rate == PA2:\n * update = sqnorm(x_data_ptr, x_ind_ptr, xnnz)\n */\n __pyx_v_update = __pyx_f_7sklearn_12linear_model_8sgd_fast_min(__pyx_v_C, (((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_loss->__pyx_vtab)->loss(__pyx_v_loss, __pyx_v_p, __pyx_v_y, 0) / __pyx_v_update));\n break;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":467\n * continue\n * update = min(C, loss.loss(p, y) / update)\n * elif learning_rate == PA2: # <<<<<<<<<<<<<<\n * update = sqnorm(x_data_ptr, x_ind_ptr, xnnz)\n * update = loss.loss(p, y) / (update + 0.5 / C)\n */\n case 5:\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":468\n * update = min(C, loss.loss(p, y) / update)\n * elif learning_rate == PA2:\n * update = sqnorm(x_data_ptr, x_ind_ptr, xnnz) # <<<<<<<<<<<<<<\n * update = loss.loss(p, y) / (update + 0.5 / C)\n * else:\n */\n __pyx_v_update = __pyx_f_7sklearn_12linear_model_8sgd_fast_sqnorm(__pyx_v_x_data_ptr, __pyx_v_x_ind_ptr, __pyx_v_xnnz);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":469\n * elif learning_rate == PA2:\n * update = sqnorm(x_data_ptr, x_ind_ptr, xnnz)\n * update = loss.loss(p, y) / (update + 0.5 / C) # <<<<<<<<<<<<<<\n * else:\n * update = -eta * loss.dloss(p, y)\n */\n __pyx_v_update = (((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_loss->__pyx_vtab)->loss(__pyx_v_loss, __pyx_v_p, __pyx_v_y, 0) / (__pyx_v_update + (0.5 / __pyx_v_C)));\n break;\n default:\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":471\n * update = loss.loss(p, y) / (update + 0.5 / C)\n * else:\n * update = -eta * loss.dloss(p, y) # <<<<<<<<<<<<<<\n * \n * if learning_rate >= PA1:\n */\n __pyx_v_update = ((-__pyx_v_eta) * ((struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_LossFunction *)__pyx_v_loss->__pyx_vtab)->dloss(__pyx_v_loss, __pyx_v_p, __pyx_v_y, 0));\n break;\n }\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":473\n * update = -eta * loss.dloss(p, y)\n * \n * if learning_rate >= PA1: # <<<<<<<<<<<<<<\n * if is_hinge:\n * # classification\n */\n __pyx_t_4 = (__pyx_v_learning_rate >= 4);\n if (__pyx_t_4) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":474\n * \n * if learning_rate >= PA1:\n * if is_hinge: # <<<<<<<<<<<<<<\n * # classification\n * update *= y\n */\n if (__pyx_v_is_hinge) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":476\n * if is_hinge:\n * # classification\n * update *= y # <<<<<<<<<<<<<<\n * elif y - p < 0:\n * # regression\n */\n __pyx_v_update = (__pyx_v_update * __pyx_v_y);\n goto __pyx_L13;\n }\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":477\n * # classification\n * update *= y\n * elif y - p < 0: # <<<<<<<<<<<<<<\n * # regression\n * update *= -1\n */\n __pyx_t_4 = ((__pyx_v_y - __pyx_v_p) < 0.0);\n if (__pyx_t_4) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":479\n * elif y - p < 0:\n * # regression\n * update *= -1 # <<<<<<<<<<<<<<\n * \n * update *= class_weight * sample_weight\n */\n __pyx_v_update = (__pyx_v_update * -1.0);\n goto __pyx_L13;\n }\n __pyx_L13:;\n goto __pyx_L12;\n }\n __pyx_L12:;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":481\n * update *= -1\n * \n * update *= class_weight * sample_weight # <<<<<<<<<<<<<<\n * \n * if update != 0.0:\n */\n __pyx_v_update = (__pyx_v_update * (__pyx_v_class_weight * __pyx_v_sample_weight));\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":483\n * update *= class_weight * sample_weight\n * \n * if update != 0.0: # <<<<<<<<<<<<<<\n * w.add(x_data_ptr, x_ind_ptr, xnnz, update)\n * if fit_intercept == 1:\n */\n __pyx_t_4 = (__pyx_v_update != 0.0);\n if (__pyx_t_4) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":484\n * \n * if update != 0.0:\n * w.add(x_data_ptr, x_ind_ptr, xnnz, update) # <<<<<<<<<<<<<<\n * if fit_intercept == 1:\n * intercept += update * intercept_decay\n */\n ((struct __pyx_vtabstruct_7sklearn_5utils_13weight_vector_WeightVector *)__pyx_v_w->__pyx_vtab)->add(__pyx_v_w, __pyx_v_x_data_ptr, __pyx_v_x_ind_ptr, __pyx_v_xnnz, __pyx_v_update);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":485\n * if update != 0.0:\n * w.add(x_data_ptr, x_ind_ptr, xnnz, update)\n * if fit_intercept == 1: # <<<<<<<<<<<<<<\n * intercept += update * intercept_decay\n * if penalty_type >= L2:\n */\n __pyx_t_4 = (__pyx_v_fit_intercept == 1);\n if (__pyx_t_4) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":486\n * w.add(x_data_ptr, x_ind_ptr, xnnz, update)\n * if fit_intercept == 1:\n * intercept += update * intercept_decay # <<<<<<<<<<<<<<\n * if penalty_type >= L2:\n * w.scale(1.0 - (rho * eta * alpha))\n */\n __pyx_v_intercept = (__pyx_v_intercept + (__pyx_v_update * __pyx_v_intercept_decay));\n goto __pyx_L15;\n }\n __pyx_L15:;\n goto __pyx_L14;\n }\n __pyx_L14:;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":487\n * if fit_intercept == 1:\n * intercept += update * intercept_decay\n * if penalty_type >= L2: # <<<<<<<<<<<<<<\n * w.scale(1.0 - (rho * eta * alpha))\n * \n */\n __pyx_t_4 = (__pyx_v_penalty_type >= 2);\n if (__pyx_t_4) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":488\n * intercept += update * intercept_decay\n * if penalty_type >= L2:\n * w.scale(1.0 - (rho * eta * alpha)) # <<<<<<<<<<<<<<\n * \n * if penalty_type == L1 or penalty_type == ELASTICNET:\n */\n ((struct __pyx_vtabstruct_7sklearn_5utils_13weight_vector_WeightVector *)__pyx_v_w->__pyx_vtab)->scale(__pyx_v_w, (1.0 - ((__pyx_v_rho * __pyx_v_eta) * __pyx_v_alpha)));\n goto __pyx_L16;\n }\n __pyx_L16:;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":490\n * w.scale(1.0 - (rho * eta * alpha))\n * \n * if penalty_type == L1 or penalty_type == ELASTICNET: # <<<<<<<<<<<<<<\n * u += ((1.0 - rho) * eta * alpha)\n * l1penalty(w, q_data_ptr, x_ind_ptr, xnnz, u)\n */\n switch (__pyx_v_penalty_type) {\n case 1:\n case 3:\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":491\n * \n * if penalty_type == L1 or penalty_type == ELASTICNET:\n * u += ((1.0 - rho) * eta * alpha) # <<<<<<<<<<<<<<\n * l1penalty(w, q_data_ptr, x_ind_ptr, xnnz, u)\n * t += 1\n */\n __pyx_v_u = (__pyx_v_u + (((1.0 - __pyx_v_rho) * __pyx_v_eta) * __pyx_v_alpha));\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":492\n * if penalty_type == L1 or penalty_type == ELASTICNET:\n * u += ((1.0 - rho) * eta * alpha)\n * l1penalty(w, q_data_ptr, x_ind_ptr, xnnz, u) # <<<<<<<<<<<<<<\n * t += 1\n * count += 1\n */\n __pyx_f_7sklearn_12linear_model_8sgd_fast_l1penalty(__pyx_v_w, __pyx_v_q_data_ptr, __pyx_v_x_ind_ptr, __pyx_v_xnnz, __pyx_v_u);\n break;\n }\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":493\n * u += ((1.0 - rho) * eta * alpha)\n * l1penalty(w, q_data_ptr, x_ind_ptr, xnnz, u)\n * t += 1 # <<<<<<<<<<<<<<\n * count += 1\n * \n */\n __pyx_v_t = (__pyx_v_t + 1.0);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":494\n * l1penalty(w, q_data_ptr, x_ind_ptr, xnnz, u)\n * t += 1\n * count += 1 # <<<<<<<<<<<<<<\n * \n * # report epoch information\n */\n __pyx_v_count = (__pyx_v_count + 1);\n __pyx_L7_continue:;\n }\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":497\n * \n * # report epoch information\n * if verbose > 0: # <<<<<<<<<<<<<<\n * print(\"Norm: %.2f, NNZs: %d, \"\n * \"Bias: %.6f, T: %d, Avg. loss: %.6f\" % (w.norm(),\n */\n __pyx_t_4 = (__pyx_v_verbose > 0);\n if (__pyx_t_4) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":499\n * if verbose > 0:\n * print(\"Norm: %.2f, NNZs: %d, \"\n * \"Bias: %.6f, T: %d, Avg. loss: %.6f\" % (w.norm(), # <<<<<<<<<<<<<<\n * weights.nonzero()[0].shape[0],\n * intercept, count,\n */\n __pyx_t_8 = PyFloat_FromDouble(((struct __pyx_vtabstruct_7sklearn_5utils_13weight_vector_WeightVector *)__pyx_v_w->__pyx_vtab)->norm(__pyx_v_w)); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 499; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_8);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":500\n * print(\"Norm: %.2f, NNZs: %d, \"\n * \"Bias: %.6f, T: %d, Avg. loss: %.6f\" % (w.norm(),\n * weights.nonzero()[0].shape[0], # <<<<<<<<<<<<<<\n * intercept, count,\n * sumloss / count))\n */\n __pyx_t_6 = PyObject_GetAttr(((PyObject *)__pyx_v_weights), __pyx_n_s__nonzero); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 500; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_6);\n __pyx_t_3 = PyObject_Call(__pyx_t_6, ((PyObject *)__pyx_empty_tuple), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 500; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n __pyx_t_6 = __Pyx_GetItemInt(__pyx_t_3, 0, sizeof(long), PyInt_FromLong); if (!__pyx_t_6) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 500; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_6);\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_GetAttr(__pyx_t_6, __pyx_n_s__shape); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 500; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;\n __pyx_t_6 = __Pyx_GetItemInt(__pyx_t_3, 0, sizeof(long), PyInt_FromLong); if (!__pyx_t_6) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 500; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_6);\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":501\n * \"Bias: %.6f, T: %d, Avg. loss: %.6f\" % (w.norm(),\n * weights.nonzero()[0].shape[0],\n * intercept, count, # <<<<<<<<<<<<<<\n * sumloss / count))\n * print(\"Total training time: %.2f seconds.\" % (time() - t_start))\n */\n __pyx_t_3 = PyFloat_FromDouble(__pyx_v_intercept); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 501; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_2 = PyLong_FromUnsignedLong(__pyx_v_count); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 501; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":502\n * weights.nonzero()[0].shape[0],\n * intercept, count,\n * sumloss / count)) # <<<<<<<<<<<<<<\n * print(\"Total training time: %.2f seconds.\" % (time() - t_start))\n * \n */\n __pyx_t_7 = PyFloat_FromDouble((__pyx_v_sumloss / __pyx_v_count)); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 502; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_7);\n __pyx_t_15 = PyTuple_New(5); if (unlikely(!__pyx_t_15)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 499; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_15);\n PyTuple_SET_ITEM(__pyx_t_15, 0, __pyx_t_8);\n __Pyx_GIVEREF(__pyx_t_8);\n PyTuple_SET_ITEM(__pyx_t_15, 1, __pyx_t_6);\n __Pyx_GIVEREF(__pyx_t_6);\n PyTuple_SET_ITEM(__pyx_t_15, 2, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n PyTuple_SET_ITEM(__pyx_t_15, 3, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n PyTuple_SET_ITEM(__pyx_t_15, 4, __pyx_t_7);\n __Pyx_GIVEREF(__pyx_t_7);\n __pyx_t_8 = 0;\n __pyx_t_6 = 0;\n __pyx_t_3 = 0;\n __pyx_t_2 = 0;\n __pyx_t_7 = 0;\n __pyx_t_7 = PyNumber_Remainder(((PyObject *)__pyx_kp_s_2), ((PyObject *)__pyx_t_15)); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 499; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(((PyObject *)__pyx_t_7));\n __Pyx_DECREF(((PyObject *)__pyx_t_15)); __pyx_t_15 = 0;\n if (__Pyx_PrintOne(0, ((PyObject *)__pyx_t_7)) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 498; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(((PyObject *)__pyx_t_7)); __pyx_t_7 = 0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":503\n * intercept, count,\n * sumloss / count))\n * print(\"Total training time: %.2f seconds.\" % (time() - t_start)) # <<<<<<<<<<<<<<\n * \n * # floating-point under-/overflow check.\n */\n __pyx_t_7 = __Pyx_GetName(__pyx_m, __pyx_n_s__time); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 503; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_7);\n __pyx_t_15 = PyObject_Call(__pyx_t_7, ((PyObject *)__pyx_empty_tuple), NULL); if (unlikely(!__pyx_t_15)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 503; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_15);\n __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n __pyx_t_7 = PyNumber_Subtract(__pyx_t_15, __pyx_v_t_start); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 503; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_7);\n __Pyx_DECREF(__pyx_t_15); __pyx_t_15 = 0;\n __pyx_t_15 = PyNumber_Remainder(((PyObject *)__pyx_kp_s_3), __pyx_t_7); if (unlikely(!__pyx_t_15)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 503; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(((PyObject *)__pyx_t_15));\n __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n if (__Pyx_PrintOne(0, ((PyObject *)__pyx_t_15)) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 503; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(((PyObject *)__pyx_t_15)); __pyx_t_15 = 0;\n goto __pyx_L17;\n }\n __pyx_L17:;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":506\n * \n * # floating-point under-/overflow check.\n * if np.any(np.isinf(weights)) or np.any(np.isnan(weights)) \\ # <<<<<<<<<<<<<<\n * or np.isnan(intercept) or np.isinf(intercept):\n * raise ValueError(\"floating-point under-/overflow occured.\")\n */\n __pyx_t_15 = __Pyx_GetName(__pyx_m, __pyx_n_s__np); if (unlikely(!__pyx_t_15)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 506; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_15);\n __pyx_t_7 = PyObject_GetAttr(__pyx_t_15, __pyx_n_s__any); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 506; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_7);\n __Pyx_DECREF(__pyx_t_15); __pyx_t_15 = 0;\n __pyx_t_15 = __Pyx_GetName(__pyx_m, __pyx_n_s__np); if (unlikely(!__pyx_t_15)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 506; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_15);\n __pyx_t_2 = PyObject_GetAttr(__pyx_t_15, __pyx_n_s__isinf); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 506; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __Pyx_DECREF(__pyx_t_15); __pyx_t_15 = 0;\n __pyx_t_15 = PyTuple_New(1); if (unlikely(!__pyx_t_15)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 506; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_15);\n __Pyx_INCREF(((PyObject *)__pyx_v_weights));\n PyTuple_SET_ITEM(__pyx_t_15, 0, ((PyObject *)__pyx_v_weights));\n __Pyx_GIVEREF(((PyObject *)__pyx_v_weights));\n __pyx_t_3 = PyObject_Call(__pyx_t_2, ((PyObject *)__pyx_t_15), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 506; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n __Pyx_DECREF(((PyObject *)__pyx_t_15)); __pyx_t_15 = 0;\n __pyx_t_15 = PyTuple_New(1); if (unlikely(!__pyx_t_15)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 506; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_15);\n PyTuple_SET_ITEM(__pyx_t_15, 0, __pyx_t_3);\n __Pyx_GIVEREF(__pyx_t_3);\n __pyx_t_3 = 0;\n __pyx_t_3 = PyObject_Call(__pyx_t_7, ((PyObject *)__pyx_t_15), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 506; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n __Pyx_DECREF(((PyObject *)__pyx_t_15)); __pyx_t_15 = 0;\n __pyx_t_4 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_4 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 506; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n if (!__pyx_t_4) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":507\n * # floating-point under-/overflow check.\n * if np.any(np.isinf(weights)) or np.any(np.isnan(weights)) \\\n * or np.isnan(intercept) or np.isinf(intercept): # <<<<<<<<<<<<<<\n * raise ValueError(\"floating-point under-/overflow occured.\")\n * \n */\n __pyx_t_3 = __Pyx_GetName(__pyx_m, __pyx_n_s__np); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 506; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_15 = PyObject_GetAttr(__pyx_t_3, __pyx_n_s__any); if (unlikely(!__pyx_t_15)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 506; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_15);\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":506\n * \n * # floating-point under-/overflow check.\n * if np.any(np.isinf(weights)) or np.any(np.isnan(weights)) \\ # <<<<<<<<<<<<<<\n * or np.isnan(intercept) or np.isinf(intercept):\n * raise ValueError(\"floating-point under-/overflow occured.\")\n */\n __pyx_t_3 = __Pyx_GetName(__pyx_m, __pyx_n_s__np); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 506; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_7 = PyObject_GetAttr(__pyx_t_3, __pyx_n_s__isnan); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 506; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_7);\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 506; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_INCREF(((PyObject *)__pyx_v_weights));\n PyTuple_SET_ITEM(__pyx_t_3, 0, ((PyObject *)__pyx_v_weights));\n __Pyx_GIVEREF(((PyObject *)__pyx_v_weights));\n __pyx_t_2 = PyObject_Call(__pyx_t_7, ((PyObject *)__pyx_t_3), NULL); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 506; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;\n __Pyx_DECREF(((PyObject *)__pyx_t_3)); __pyx_t_3 = 0;\n __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 506; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n PyTuple_SET_ITEM(__pyx_t_3, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n __pyx_t_2 = 0;\n __pyx_t_2 = PyObject_Call(__pyx_t_15, ((PyObject *)__pyx_t_3), NULL); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 506; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __Pyx_DECREF(__pyx_t_15); __pyx_t_15 = 0;\n __Pyx_DECREF(((PyObject *)__pyx_t_3)); __pyx_t_3 = 0;\n __pyx_t_16 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely(__pyx_t_16 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 506; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n if (!__pyx_t_16) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":507\n * # floating-point under-/overflow check.\n * if np.any(np.isinf(weights)) or np.any(np.isnan(weights)) \\\n * or np.isnan(intercept) or np.isinf(intercept): # <<<<<<<<<<<<<<\n * raise ValueError(\"floating-point under-/overflow occured.\")\n * \n */\n __pyx_t_2 = __Pyx_GetName(__pyx_m, __pyx_n_s__np); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 507; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyObject_GetAttr(__pyx_t_2, __pyx_n_s__isnan); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 507; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_intercept); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 507; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_15 = PyTuple_New(1); if (unlikely(!__pyx_t_15)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 507; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_15);\n PyTuple_SET_ITEM(__pyx_t_15, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n __pyx_t_2 = 0;\n __pyx_t_2 = PyObject_Call(__pyx_t_3, ((PyObject *)__pyx_t_15), NULL); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 507; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __Pyx_DECREF(((PyObject *)__pyx_t_15)); __pyx_t_15 = 0;\n __pyx_t_17 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely(__pyx_t_17 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 507; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n if (!__pyx_t_17) {\n __pyx_t_2 = __Pyx_GetName(__pyx_m, __pyx_n_s__np); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 507; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_15 = PyObject_GetAttr(__pyx_t_2, __pyx_n_s__isinf); if (unlikely(!__pyx_t_15)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 507; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_15);\n __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_intercept); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 507; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 507; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n PyTuple_SET_ITEM(__pyx_t_3, 0, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n __pyx_t_2 = 0;\n __pyx_t_2 = PyObject_Call(__pyx_t_15, ((PyObject *)__pyx_t_3), NULL); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 507; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __Pyx_DECREF(__pyx_t_15); __pyx_t_15 = 0;\n __Pyx_DECREF(((PyObject *)__pyx_t_3)); __pyx_t_3 = 0;\n __pyx_t_18 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely(__pyx_t_18 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 507; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n __pyx_t_19 = __pyx_t_18;\n } else {\n __pyx_t_19 = __pyx_t_17;\n }\n __pyx_t_17 = __pyx_t_19;\n } else {\n __pyx_t_17 = __pyx_t_16;\n }\n __pyx_t_16 = __pyx_t_17;\n } else {\n __pyx_t_16 = __pyx_t_4;\n }\n if (__pyx_t_16) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":508\n * if np.any(np.isinf(weights)) or np.any(np.isnan(weights)) \\\n * or np.isnan(intercept) or np.isinf(intercept):\n * raise ValueError(\"floating-point under-/overflow occured.\") # <<<<<<<<<<<<<<\n * \n * w.reset_wscale()\n */\n __pyx_t_2 = PyObject_Call(__pyx_builtin_ValueError, ((PyObject *)__pyx_k_tuple_5), NULL); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 508; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __Pyx_Raise(__pyx_t_2, 0, 0, 0);\n __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n {__pyx_filename = __pyx_f[0]; __pyx_lineno = 508; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n goto __pyx_L18;\n }\n __pyx_L18:;\n }\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":510\n * raise ValueError(\"floating-point under-/overflow occured.\")\n * \n * w.reset_wscale() # <<<<<<<<<<<<<<\n * \n * return weights, intercept\n */\n ((struct __pyx_vtabstruct_7sklearn_5utils_13weight_vector_WeightVector *)__pyx_v_w->__pyx_vtab)->reset_wscale(__pyx_v_w);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":512\n * w.reset_wscale()\n * \n * return weights, intercept # <<<<<<<<<<<<<<\n * \n * \n */\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_2 = PyFloat_FromDouble(__pyx_v_intercept); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 512; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyTuple_New(2); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 512; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_INCREF(((PyObject *)__pyx_v_weights));\n PyTuple_SET_ITEM(__pyx_t_3, 0, ((PyObject *)__pyx_v_weights));\n __Pyx_GIVEREF(((PyObject *)__pyx_v_weights));\n PyTuple_SET_ITEM(__pyx_t_3, 1, __pyx_t_2);\n __Pyx_GIVEREF(__pyx_t_2);\n __pyx_t_2 = 0;\n __pyx_r = ((PyObject *)__pyx_t_3);\n __pyx_t_3 = 0;\n goto __pyx_L0;\n\n __pyx_r = Py_None; __Pyx_INCREF(Py_None);\n goto __pyx_L0;\n __pyx_L1_error:;\n __Pyx_XDECREF(__pyx_t_2);\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_15);\n { PyObject *__pyx_type, *__pyx_value, *__pyx_tb;\n __Pyx_ErrFetch(&__pyx_type, &__pyx_value, &__pyx_tb);\n __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_q.rcbuffer->pybuffer);\n __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_weights.rcbuffer->pybuffer);\n __Pyx_ErrRestore(__pyx_type, __pyx_value, __pyx_tb);}\n __Pyx_AddTraceback(\"sklearn.linear_model.sgd_fast.plain_sgd\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n goto __pyx_L2;\n __pyx_L0:;\n __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_q.rcbuffer->pybuffer);\n __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_weights.rcbuffer->pybuffer);\n __pyx_L2:;\n __Pyx_XDECREF((PyObject *)__pyx_v_w);\n __Pyx_XDECREF((PyObject *)__pyx_v_q);\n __Pyx_XDECREF(__pyx_v_t_start);\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":515\n * \n * \n * cdef inline double max(double a, double b): # <<<<<<<<<<<<<<\n * return a if a >= b else b\n * \n */\n\nstatic CYTHON_INLINE double __pyx_f_7sklearn_12linear_model_8sgd_fast_max(double __pyx_v_a, double __pyx_v_b) {\n double __pyx_r;\n __Pyx_RefNannyDeclarations\n double __pyx_t_1;\n __Pyx_RefNannySetupContext(\"max\", 0);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":516\n * \n * cdef inline double max(double a, double b):\n * return a if a >= b else b # <<<<<<<<<<<<<<\n * \n * \n */\n if ((__pyx_v_a >= __pyx_v_b)) {\n __pyx_t_1 = __pyx_v_a;\n } else {\n __pyx_t_1 = __pyx_v_b;\n }\n __pyx_r = __pyx_t_1;\n goto __pyx_L0;\n\n __pyx_r = 0;\n __pyx_L0:;\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":519\n * \n * \n * cdef inline double min(double a, double b): # <<<<<<<<<<<<<<\n * return a if a <= b else b\n * \n */\n\nstatic CYTHON_INLINE double __pyx_f_7sklearn_12linear_model_8sgd_fast_min(double __pyx_v_a, double __pyx_v_b) {\n double __pyx_r;\n __Pyx_RefNannyDeclarations\n double __pyx_t_1;\n __Pyx_RefNannySetupContext(\"min\", 0);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":520\n * \n * cdef inline double min(double a, double b):\n * return a if a <= b else b # <<<<<<<<<<<<<<\n * \n * cdef double sqnorm(DOUBLE * x_data_ptr, INTEGER * x_ind_ptr, int xnnz):\n */\n if ((__pyx_v_a <= __pyx_v_b)) {\n __pyx_t_1 = __pyx_v_a;\n } else {\n __pyx_t_1 = __pyx_v_b;\n }\n __pyx_r = __pyx_t_1;\n goto __pyx_L0;\n\n __pyx_r = 0;\n __pyx_L0:;\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":522\n * return a if a <= b else b\n * \n * cdef double sqnorm(DOUBLE * x_data_ptr, INTEGER * x_ind_ptr, int xnnz): # <<<<<<<<<<<<<<\n * cdef double x_norm = 0.0\n * cdef int j\n */\n\nstatic double __pyx_f_7sklearn_12linear_model_8sgd_fast_sqnorm(__pyx_t_7sklearn_12linear_model_8sgd_fast_DOUBLE *__pyx_v_x_data_ptr, CYTHON_UNUSED __pyx_t_7sklearn_12linear_model_8sgd_fast_INTEGER *__pyx_v_x_ind_ptr, int __pyx_v_xnnz) {\n double __pyx_v_x_norm;\n int __pyx_v_j;\n double __pyx_v_z;\n double __pyx_r;\n __Pyx_RefNannyDeclarations\n int __pyx_t_1;\n int __pyx_t_2;\n __Pyx_RefNannySetupContext(\"sqnorm\", 0);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":523\n * \n * cdef double sqnorm(DOUBLE * x_data_ptr, INTEGER * x_ind_ptr, int xnnz):\n * cdef double x_norm = 0.0 # <<<<<<<<<<<<<<\n * cdef int j\n * cdef double z\n */\n __pyx_v_x_norm = 0.0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":526\n * cdef int j\n * cdef double z\n * for j in range(xnnz): # <<<<<<<<<<<<<<\n * z = x_data_ptr[j]\n * x_norm += z * z\n */\n __pyx_t_1 = __pyx_v_xnnz;\n for (__pyx_t_2 = 0; __pyx_t_2 < __pyx_t_1; __pyx_t_2+=1) {\n __pyx_v_j = __pyx_t_2;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":527\n * cdef double z\n * for j in range(xnnz):\n * z = x_data_ptr[j] # <<<<<<<<<<<<<<\n * x_norm += z * z\n * return x_norm\n */\n __pyx_v_z = (__pyx_v_x_data_ptr[__pyx_v_j]);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":528\n * for j in range(xnnz):\n * z = x_data_ptr[j]\n * x_norm += z * z # <<<<<<<<<<<<<<\n * return x_norm\n * \n */\n __pyx_v_x_norm = (__pyx_v_x_norm + (__pyx_v_z * __pyx_v_z));\n }\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":529\n * z = x_data_ptr[j]\n * x_norm += z * z\n * return x_norm # <<<<<<<<<<<<<<\n * \n * cdef void l1penalty(WeightVector w, DOUBLE * q_data_ptr,\n */\n __pyx_r = __pyx_v_x_norm;\n goto __pyx_L0;\n\n __pyx_r = 0;\n __pyx_L0:;\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"sklearn/linear_model/sgd_fast.pyx\":531\n * return x_norm\n * \n * cdef void l1penalty(WeightVector w, DOUBLE * q_data_ptr, # <<<<<<<<<<<<<<\n * INTEGER * x_ind_ptr, int xnnz, double u):\n * \"\"\"Apply the L1 penalty to each updated feature\n */\n\nstatic void __pyx_f_7sklearn_12linear_model_8sgd_fast_l1penalty(struct __pyx_obj_7sklearn_5utils_13weight_vector_WeightVector *__pyx_v_w, __pyx_t_7sklearn_12linear_model_8sgd_fast_DOUBLE *__pyx_v_q_data_ptr, __pyx_t_7sklearn_12linear_model_8sgd_fast_INTEGER *__pyx_v_x_ind_ptr, int __pyx_v_xnnz, double __pyx_v_u) {\n double __pyx_v_z;\n int __pyx_v_j;\n int __pyx_v_idx;\n double __pyx_v_wscale;\n double *__pyx_v_w_data_ptr;\n __Pyx_RefNannyDeclarations\n double __pyx_t_1;\n __pyx_t_7sklearn_5utils_13weight_vector_DOUBLE *__pyx_t_2;\n int __pyx_t_3;\n int __pyx_t_4;\n int __pyx_t_5;\n int __pyx_t_6;\n __Pyx_RefNannySetupContext(\"l1penalty\", 0);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":538\n * [Tsuruoka, Y., Tsujii, J., and Ananiadou, S., 2009].\n * \"\"\"\n * cdef double z = 0.0 # <<<<<<<<<<<<<<\n * cdef int j = 0\n * cdef int idx = 0\n */\n __pyx_v_z = 0.0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":539\n * \"\"\"\n * cdef double z = 0.0\n * cdef int j = 0 # <<<<<<<<<<<<<<\n * cdef int idx = 0\n * cdef double wscale = w.wscale\n */\n __pyx_v_j = 0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":540\n * cdef double z = 0.0\n * cdef int j = 0\n * cdef int idx = 0 # <<<<<<<<<<<<<<\n * cdef double wscale = w.wscale\n * cdef double * w_data_ptr = w.w_data_ptr\n */\n __pyx_v_idx = 0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":541\n * cdef int j = 0\n * cdef int idx = 0\n * cdef double wscale = w.wscale # <<<<<<<<<<<<<<\n * cdef double * w_data_ptr = w.w_data_ptr\n * for j in range(xnnz):\n */\n __pyx_t_1 = __pyx_v_w->wscale;\n __pyx_v_wscale = __pyx_t_1;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":542\n * cdef int idx = 0\n * cdef double wscale = w.wscale\n * cdef double * w_data_ptr = w.w_data_ptr # <<<<<<<<<<<<<<\n * for j in range(xnnz):\n * idx = x_ind_ptr[j]\n */\n __pyx_t_2 = __pyx_v_w->w_data_ptr;\n __pyx_v_w_data_ptr = __pyx_t_2;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":543\n * cdef double wscale = w.wscale\n * cdef double * w_data_ptr = w.w_data_ptr\n * for j in range(xnnz): # <<<<<<<<<<<<<<\n * idx = x_ind_ptr[j]\n * z = w_data_ptr[idx]\n */\n __pyx_t_3 = __pyx_v_xnnz;\n for (__pyx_t_4 = 0; __pyx_t_4 < __pyx_t_3; __pyx_t_4+=1) {\n __pyx_v_j = __pyx_t_4;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":544\n * cdef double * w_data_ptr = w.w_data_ptr\n * for j in range(xnnz):\n * idx = x_ind_ptr[j] # <<<<<<<<<<<<<<\n * z = w_data_ptr[idx]\n * if (wscale * w_data_ptr[idx]) > 0.0:\n */\n __pyx_v_idx = (__pyx_v_x_ind_ptr[__pyx_v_j]);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":545\n * for j in range(xnnz):\n * idx = x_ind_ptr[j]\n * z = w_data_ptr[idx] # <<<<<<<<<<<<<<\n * if (wscale * w_data_ptr[idx]) > 0.0:\n * w_data_ptr[idx] = max(\n */\n __pyx_v_z = (__pyx_v_w_data_ptr[__pyx_v_idx]);\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":546\n * idx = x_ind_ptr[j]\n * z = w_data_ptr[idx]\n * if (wscale * w_data_ptr[idx]) > 0.0: # <<<<<<<<<<<<<<\n * w_data_ptr[idx] = max(\n * 0.0, w_data_ptr[idx] - ((u + q_data_ptr[idx]) / wscale))\n */\n __pyx_t_5 = ((__pyx_v_wscale * (__pyx_v_w_data_ptr[__pyx_v_idx])) > 0.0);\n if (__pyx_t_5) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":547\n * z = w_data_ptr[idx]\n * if (wscale * w_data_ptr[idx]) > 0.0:\n * w_data_ptr[idx] = max( # <<<<<<<<<<<<<<\n * 0.0, w_data_ptr[idx] - ((u + q_data_ptr[idx]) / wscale))\n * \n */\n (__pyx_v_w_data_ptr[__pyx_v_idx]) = __pyx_f_7sklearn_12linear_model_8sgd_fast_max(0.0, ((__pyx_v_w_data_ptr[__pyx_v_idx]) - ((__pyx_v_u + (__pyx_v_q_data_ptr[__pyx_v_idx])) / __pyx_v_wscale)));\n goto __pyx_L5;\n }\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":550\n * 0.0, w_data_ptr[idx] - ((u + q_data_ptr[idx]) / wscale))\n * \n * elif (wscale * w_data_ptr[idx]) < 0.0: # <<<<<<<<<<<<<<\n * w_data_ptr[idx] = min(\n * 0.0, w_data_ptr[idx] + ((u - q_data_ptr[idx]) / wscale))\n */\n __pyx_t_5 = ((__pyx_v_wscale * (__pyx_v_w_data_ptr[__pyx_v_idx])) < 0.0);\n if (__pyx_t_5) {\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":551\n * \n * elif (wscale * w_data_ptr[idx]) < 0.0:\n * w_data_ptr[idx] = min( # <<<<<<<<<<<<<<\n * 0.0, w_data_ptr[idx] + ((u - q_data_ptr[idx]) / wscale))\n * \n */\n (__pyx_v_w_data_ptr[__pyx_v_idx]) = __pyx_f_7sklearn_12linear_model_8sgd_fast_min(0.0, ((__pyx_v_w_data_ptr[__pyx_v_idx]) + ((__pyx_v_u - (__pyx_v_q_data_ptr[__pyx_v_idx])) / __pyx_v_wscale)));\n goto __pyx_L5;\n }\n __pyx_L5:;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":554\n * 0.0, w_data_ptr[idx] + ((u - q_data_ptr[idx]) / wscale))\n * \n * q_data_ptr[idx] += (wscale * (w_data_ptr[idx] - z)) # <<<<<<<<<<<<<<\n */\n __pyx_t_6 = __pyx_v_idx;\n (__pyx_v_q_data_ptr[__pyx_t_6]) = ((__pyx_v_q_data_ptr[__pyx_t_6]) + (__pyx_v_wscale * ((__pyx_v_w_data_ptr[__pyx_v_idx]) - __pyx_v_z)));\n }\n\n __Pyx_RefNannyFinishContext();\n}\n\n/* Python wrapper */\nstatic CYTHON_UNUSED int __pyx_pw_5numpy_7ndarray_1__getbuffer__(PyObject *__pyx_v_self, Py_buffer *__pyx_v_info, int __pyx_v_flags); /*proto*/\nstatic CYTHON_UNUSED int __pyx_pw_5numpy_7ndarray_1__getbuffer__(PyObject *__pyx_v_self, Py_buffer *__pyx_v_info, int __pyx_v_flags) {\n int __pyx_r;\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"__getbuffer__ (wrapper)\", 0);\n __pyx_r = __pyx_pf_5numpy_7ndarray___getbuffer__(((PyArrayObject *)__pyx_v_self), ((Py_buffer *)__pyx_v_info), ((int)__pyx_v_flags));\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"numpy.pxd\":194\n * # experimental exception made for __getbuffer__ and __releasebuffer__\n * # -- the details of this may change.\n * def __getbuffer__(ndarray self, Py_buffer* info, int flags): # <<<<<<<<<<<<<<\n * # This implementation of getbuffer is geared towards Cython\n * # requirements, and does not yet fullfill the PEP.\n */\n\nstatic int __pyx_pf_5numpy_7ndarray___getbuffer__(PyArrayObject *__pyx_v_self, Py_buffer *__pyx_v_info, int __pyx_v_flags) {\n int __pyx_v_copy_shape;\n int __pyx_v_i;\n int __pyx_v_ndim;\n int __pyx_v_endian_detector;\n int __pyx_v_little_endian;\n int __pyx_v_t;\n char *__pyx_v_f;\n PyArray_Descr *__pyx_v_descr = 0;\n int __pyx_v_offset;\n int __pyx_v_hasfields;\n int __pyx_r;\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 int __pyx_t_5;\n int __pyx_t_6;\n int __pyx_t_7;\n PyObject *__pyx_t_8 = NULL;\n char *__pyx_t_9;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"__getbuffer__\", 0);\n if (__pyx_v_info != NULL) {\n __pyx_v_info->obj = Py_None; __Pyx_INCREF(Py_None);\n __Pyx_GIVEREF(__pyx_v_info->obj);\n }\n\n /* \"numpy.pxd\":200\n * # of flags\n * \n * if info == NULL: return # <<<<<<<<<<<<<<\n * \n * cdef int copy_shape, i, ndim\n */\n __pyx_t_1 = (__pyx_v_info == NULL);\n if (__pyx_t_1) {\n __pyx_r = 0;\n goto __pyx_L0;\n goto __pyx_L3;\n }\n __pyx_L3:;\n\n /* \"numpy.pxd\":203\n * \n * cdef int copy_shape, i, ndim\n * cdef int endian_detector = 1 # <<<<<<<<<<<<<<\n * cdef bint little_endian = ((&endian_detector)[0] != 0)\n * \n */\n __pyx_v_endian_detector = 1;\n\n /* \"numpy.pxd\":204\n * cdef int copy_shape, i, ndim\n * cdef int endian_detector = 1\n * cdef bint little_endian = ((&endian_detector)[0] != 0) # <<<<<<<<<<<<<<\n * \n * ndim = PyArray_NDIM(self)\n */\n __pyx_v_little_endian = ((((char *)(&__pyx_v_endian_detector))[0]) != 0);\n\n /* \"numpy.pxd\":206\n * cdef bint little_endian = ((&endian_detector)[0] != 0)\n * \n * ndim = PyArray_NDIM(self) # <<<<<<<<<<<<<<\n * \n * if sizeof(npy_intp) != sizeof(Py_ssize_t):\n */\n __pyx_v_ndim = PyArray_NDIM(__pyx_v_self);\n\n /* \"numpy.pxd\":208\n * ndim = PyArray_NDIM(self)\n * \n * if sizeof(npy_intp) != sizeof(Py_ssize_t): # <<<<<<<<<<<<<<\n * copy_shape = 1\n * else:\n */\n __pyx_t_1 = ((sizeof(npy_intp)) != (sizeof(Py_ssize_t)));\n if (__pyx_t_1) {\n\n /* \"numpy.pxd\":209\n * \n * if sizeof(npy_intp) != sizeof(Py_ssize_t):\n * copy_shape = 1 # <<<<<<<<<<<<<<\n * else:\n * copy_shape = 0\n */\n __pyx_v_copy_shape = 1;\n goto __pyx_L4;\n }\n /*else*/ {\n\n /* \"numpy.pxd\":211\n * copy_shape = 1\n * else:\n * copy_shape = 0 # <<<<<<<<<<<<<<\n * \n * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS)\n */\n __pyx_v_copy_shape = 0;\n }\n __pyx_L4:;\n\n /* \"numpy.pxd\":213\n * copy_shape = 0\n * \n * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS) # <<<<<<<<<<<<<<\n * and not PyArray_CHKFLAGS(self, NPY_C_CONTIGUOUS)):\n * raise ValueError(u\"ndarray is not C contiguous\")\n */\n __pyx_t_1 = ((__pyx_v_flags & PyBUF_C_CONTIGUOUS) == PyBUF_C_CONTIGUOUS);\n if (__pyx_t_1) {\n\n /* \"numpy.pxd\":214\n * \n * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS)\n * and not PyArray_CHKFLAGS(self, NPY_C_CONTIGUOUS)): # <<<<<<<<<<<<<<\n * raise ValueError(u\"ndarray is not C contiguous\")\n * \n */\n __pyx_t_2 = (!PyArray_CHKFLAGS(__pyx_v_self, NPY_C_CONTIGUOUS));\n __pyx_t_3 = __pyx_t_2;\n } else {\n __pyx_t_3 = __pyx_t_1;\n }\n if (__pyx_t_3) {\n\n /* \"numpy.pxd\":215\n * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS)\n * and not PyArray_CHKFLAGS(self, NPY_C_CONTIGUOUS)):\n * raise ValueError(u\"ndarray is not C contiguous\") # <<<<<<<<<<<<<<\n * \n * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS)\n */\n __pyx_t_4 = PyObject_Call(__pyx_builtin_ValueError, ((PyObject *)__pyx_k_tuple_7), NULL); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 215; __pyx_clineno = __LINE__; goto __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_filename = __pyx_f[1]; __pyx_lineno = 215; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n goto __pyx_L5;\n }\n __pyx_L5:;\n\n /* \"numpy.pxd\":217\n * raise ValueError(u\"ndarray is not C contiguous\")\n * \n * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS) # <<<<<<<<<<<<<<\n * and not PyArray_CHKFLAGS(self, NPY_F_CONTIGUOUS)):\n * raise ValueError(u\"ndarray is not Fortran contiguous\")\n */\n __pyx_t_3 = ((__pyx_v_flags & PyBUF_F_CONTIGUOUS) == PyBUF_F_CONTIGUOUS);\n if (__pyx_t_3) {\n\n /* \"numpy.pxd\":218\n * \n * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS)\n * and not PyArray_CHKFLAGS(self, NPY_F_CONTIGUOUS)): # <<<<<<<<<<<<<<\n * raise ValueError(u\"ndarray is not Fortran contiguous\")\n * \n */\n __pyx_t_1 = (!PyArray_CHKFLAGS(__pyx_v_self, NPY_F_CONTIGUOUS));\n __pyx_t_2 = __pyx_t_1;\n } else {\n __pyx_t_2 = __pyx_t_3;\n }\n if (__pyx_t_2) {\n\n /* \"numpy.pxd\":219\n * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS)\n * and not PyArray_CHKFLAGS(self, NPY_F_CONTIGUOUS)):\n * raise ValueError(u\"ndarray is not Fortran contiguous\") # <<<<<<<<<<<<<<\n * \n * info.buf = PyArray_DATA(self)\n */\n __pyx_t_4 = PyObject_Call(__pyx_builtin_ValueError, ((PyObject *)__pyx_k_tuple_9), NULL); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 219; __pyx_clineno = __LINE__; goto __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_filename = __pyx_f[1]; __pyx_lineno = 219; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n goto __pyx_L6;\n }\n __pyx_L6:;\n\n /* \"numpy.pxd\":221\n * raise ValueError(u\"ndarray is not Fortran contiguous\")\n * \n * info.buf = PyArray_DATA(self) # <<<<<<<<<<<<<<\n * info.ndim = ndim\n * if copy_shape:\n */\n __pyx_v_info->buf = PyArray_DATA(__pyx_v_self);\n\n /* \"numpy.pxd\":222\n * \n * info.buf = PyArray_DATA(self)\n * info.ndim = ndim # <<<<<<<<<<<<<<\n * if copy_shape:\n * # Allocate new buffer for strides and shape info.\n */\n __pyx_v_info->ndim = __pyx_v_ndim;\n\n /* \"numpy.pxd\":223\n * info.buf = PyArray_DATA(self)\n * info.ndim = ndim\n * if copy_shape: # <<<<<<<<<<<<<<\n * # Allocate new buffer for strides and shape info.\n * # This is allocated as one block, strides first.\n */\n if (__pyx_v_copy_shape) {\n\n /* \"numpy.pxd\":226\n * # Allocate new buffer for strides and shape info.\n * # This is allocated as one block, strides first.\n * info.strides = stdlib.malloc(sizeof(Py_ssize_t) * ndim * 2) # <<<<<<<<<<<<<<\n * info.shape = info.strides + ndim\n * for i in range(ndim):\n */\n __pyx_v_info->strides = ((Py_ssize_t *)malloc((((sizeof(Py_ssize_t)) * ((size_t)__pyx_v_ndim)) * 2)));\n\n /* \"numpy.pxd\":227\n * # This is allocated as one block, strides first.\n * info.strides = stdlib.malloc(sizeof(Py_ssize_t) * ndim * 2)\n * info.shape = info.strides + ndim # <<<<<<<<<<<<<<\n * for i in range(ndim):\n * info.strides[i] = PyArray_STRIDES(self)[i]\n */\n __pyx_v_info->shape = (__pyx_v_info->strides + __pyx_v_ndim);\n\n /* \"numpy.pxd\":228\n * info.strides = stdlib.malloc(sizeof(Py_ssize_t) * ndim * 2)\n * info.shape = info.strides + ndim\n * for i in range(ndim): # <<<<<<<<<<<<<<\n * info.strides[i] = PyArray_STRIDES(self)[i]\n * info.shape[i] = PyArray_DIMS(self)[i]\n */\n __pyx_t_5 = __pyx_v_ndim;\n for (__pyx_t_6 = 0; __pyx_t_6 < __pyx_t_5; __pyx_t_6+=1) {\n __pyx_v_i = __pyx_t_6;\n\n /* \"numpy.pxd\":229\n * info.shape = info.strides + ndim\n * for i in range(ndim):\n * info.strides[i] = PyArray_STRIDES(self)[i] # <<<<<<<<<<<<<<\n * info.shape[i] = PyArray_DIMS(self)[i]\n * else:\n */\n (__pyx_v_info->strides[__pyx_v_i]) = (PyArray_STRIDES(__pyx_v_self)[__pyx_v_i]);\n\n /* \"numpy.pxd\":230\n * for i in range(ndim):\n * info.strides[i] = PyArray_STRIDES(self)[i]\n * info.shape[i] = PyArray_DIMS(self)[i] # <<<<<<<<<<<<<<\n * else:\n * info.strides = PyArray_STRIDES(self)\n */\n (__pyx_v_info->shape[__pyx_v_i]) = (PyArray_DIMS(__pyx_v_self)[__pyx_v_i]);\n }\n goto __pyx_L7;\n }\n /*else*/ {\n\n /* \"numpy.pxd\":232\n * info.shape[i] = PyArray_DIMS(self)[i]\n * else:\n * info.strides = PyArray_STRIDES(self) # <<<<<<<<<<<<<<\n * info.shape = PyArray_DIMS(self)\n * info.suboffsets = NULL\n */\n __pyx_v_info->strides = ((Py_ssize_t *)PyArray_STRIDES(__pyx_v_self));\n\n /* \"numpy.pxd\":233\n * else:\n * info.strides = PyArray_STRIDES(self)\n * info.shape = PyArray_DIMS(self) # <<<<<<<<<<<<<<\n * info.suboffsets = NULL\n * info.itemsize = PyArray_ITEMSIZE(self)\n */\n __pyx_v_info->shape = ((Py_ssize_t *)PyArray_DIMS(__pyx_v_self));\n }\n __pyx_L7:;\n\n /* \"numpy.pxd\":234\n * info.strides = PyArray_STRIDES(self)\n * info.shape = PyArray_DIMS(self)\n * info.suboffsets = NULL # <<<<<<<<<<<<<<\n * info.itemsize = PyArray_ITEMSIZE(self)\n * info.readonly = not PyArray_ISWRITEABLE(self)\n */\n __pyx_v_info->suboffsets = NULL;\n\n /* \"numpy.pxd\":235\n * info.shape = PyArray_DIMS(self)\n * info.suboffsets = NULL\n * info.itemsize = PyArray_ITEMSIZE(self) # <<<<<<<<<<<<<<\n * info.readonly = not PyArray_ISWRITEABLE(self)\n * \n */\n __pyx_v_info->itemsize = PyArray_ITEMSIZE(__pyx_v_self);\n\n /* \"numpy.pxd\":236\n * info.suboffsets = NULL\n * info.itemsize = PyArray_ITEMSIZE(self)\n * info.readonly = not PyArray_ISWRITEABLE(self) # <<<<<<<<<<<<<<\n * \n * cdef int t\n */\n __pyx_v_info->readonly = (!PyArray_ISWRITEABLE(__pyx_v_self));\n\n /* \"numpy.pxd\":239\n * \n * cdef int t\n * cdef char* f = NULL # <<<<<<<<<<<<<<\n * cdef dtype descr = self.descr\n * cdef list stack\n */\n __pyx_v_f = NULL;\n\n /* \"numpy.pxd\":240\n * cdef int t\n * cdef char* f = NULL\n * cdef dtype descr = self.descr # <<<<<<<<<<<<<<\n * cdef list stack\n * cdef int offset\n */\n __pyx_t_4 = ((PyObject *)__pyx_v_self->descr);\n __Pyx_INCREF(__pyx_t_4);\n __pyx_v_descr = ((PyArray_Descr *)__pyx_t_4);\n __pyx_t_4 = 0;\n\n /* \"numpy.pxd\":244\n * cdef int offset\n * \n * cdef bint hasfields = PyDataType_HASFIELDS(descr) # <<<<<<<<<<<<<<\n * \n * if not hasfields and not copy_shape:\n */\n __pyx_v_hasfields = PyDataType_HASFIELDS(__pyx_v_descr);\n\n /* \"numpy.pxd\":246\n * cdef bint hasfields = PyDataType_HASFIELDS(descr)\n * \n * if not hasfields and not copy_shape: # <<<<<<<<<<<<<<\n * # do not call releasebuffer\n * info.obj = None\n */\n __pyx_t_2 = (!__pyx_v_hasfields);\n if (__pyx_t_2) {\n __pyx_t_3 = (!__pyx_v_copy_shape);\n __pyx_t_1 = __pyx_t_3;\n } else {\n __pyx_t_1 = __pyx_t_2;\n }\n if (__pyx_t_1) {\n\n /* \"numpy.pxd\":248\n * if not hasfields and not copy_shape:\n * # do not call releasebuffer\n * info.obj = None # <<<<<<<<<<<<<<\n * else:\n * # need to call releasebuffer\n */\n __Pyx_INCREF(Py_None);\n __Pyx_GIVEREF(Py_None);\n __Pyx_GOTREF(__pyx_v_info->obj);\n __Pyx_DECREF(__pyx_v_info->obj);\n __pyx_v_info->obj = Py_None;\n goto __pyx_L10;\n }\n /*else*/ {\n\n /* \"numpy.pxd\":251\n * else:\n * # need to call releasebuffer\n * info.obj = self # <<<<<<<<<<<<<<\n * \n * if not hasfields:\n */\n __Pyx_INCREF(((PyObject *)__pyx_v_self));\n __Pyx_GIVEREF(((PyObject *)__pyx_v_self));\n __Pyx_GOTREF(__pyx_v_info->obj);\n __Pyx_DECREF(__pyx_v_info->obj);\n __pyx_v_info->obj = ((PyObject *)__pyx_v_self);\n }\n __pyx_L10:;\n\n /* \"numpy.pxd\":253\n * info.obj = self\n * \n * if not hasfields: # <<<<<<<<<<<<<<\n * t = descr.type_num\n * if ((descr.byteorder == c'>' and little_endian) or\n */\n __pyx_t_1 = (!__pyx_v_hasfields);\n if (__pyx_t_1) {\n\n /* \"numpy.pxd\":254\n * \n * if not hasfields:\n * t = descr.type_num # <<<<<<<<<<<<<<\n * if ((descr.byteorder == c'>' and little_endian) or\n * (descr.byteorder == c'<' and not little_endian)):\n */\n __pyx_t_5 = __pyx_v_descr->type_num;\n __pyx_v_t = __pyx_t_5;\n\n /* \"numpy.pxd\":255\n * if not hasfields:\n * t = descr.type_num\n * if ((descr.byteorder == c'>' and little_endian) or # <<<<<<<<<<<<<<\n * (descr.byteorder == c'<' and not little_endian)):\n * raise ValueError(u\"Non-native byte order not supported\")\n */\n __pyx_t_1 = (__pyx_v_descr->byteorder == '>');\n if (__pyx_t_1) {\n __pyx_t_2 = __pyx_v_little_endian;\n } else {\n __pyx_t_2 = __pyx_t_1;\n }\n if (!__pyx_t_2) {\n\n /* \"numpy.pxd\":256\n * t = descr.type_num\n * if ((descr.byteorder == c'>' and little_endian) or\n * (descr.byteorder == c'<' and not little_endian)): # <<<<<<<<<<<<<<\n * raise ValueError(u\"Non-native byte order not supported\")\n * if t == NPY_BYTE: f = \"b\"\n */\n __pyx_t_1 = (__pyx_v_descr->byteorder == '<');\n if (__pyx_t_1) {\n __pyx_t_3 = (!__pyx_v_little_endian);\n __pyx_t_7 = __pyx_t_3;\n } else {\n __pyx_t_7 = __pyx_t_1;\n }\n __pyx_t_1 = __pyx_t_7;\n } else {\n __pyx_t_1 = __pyx_t_2;\n }\n if (__pyx_t_1) {\n\n /* \"numpy.pxd\":257\n * if ((descr.byteorder == c'>' and little_endian) or\n * (descr.byteorder == c'<' and not little_endian)):\n * raise ValueError(u\"Non-native byte order not supported\") # <<<<<<<<<<<<<<\n * if t == NPY_BYTE: f = \"b\"\n * elif t == NPY_UBYTE: f = \"B\"\n */\n __pyx_t_4 = PyObject_Call(__pyx_builtin_ValueError, ((PyObject *)__pyx_k_tuple_11), NULL); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __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_filename = __pyx_f[1]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n goto __pyx_L12;\n }\n __pyx_L12:;\n\n /* \"numpy.pxd\":258\n * (descr.byteorder == c'<' and not little_endian)):\n * raise ValueError(u\"Non-native byte order not supported\")\n * if t == NPY_BYTE: f = \"b\" # <<<<<<<<<<<<<<\n * elif t == NPY_UBYTE: f = \"B\"\n * elif t == NPY_SHORT: f = \"h\"\n */\n __pyx_t_1 = (__pyx_v_t == NPY_BYTE);\n if (__pyx_t_1) {\n __pyx_v_f = __pyx_k__b;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":259\n * raise ValueError(u\"Non-native byte order not supported\")\n * if t == NPY_BYTE: f = \"b\"\n * elif t == NPY_UBYTE: f = \"B\" # <<<<<<<<<<<<<<\n * elif t == NPY_SHORT: f = \"h\"\n * elif t == NPY_USHORT: f = \"H\"\n */\n __pyx_t_1 = (__pyx_v_t == NPY_UBYTE);\n if (__pyx_t_1) {\n __pyx_v_f = __pyx_k__B;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":260\n * if t == NPY_BYTE: f = \"b\"\n * elif t == NPY_UBYTE: f = \"B\"\n * elif t == NPY_SHORT: f = \"h\" # <<<<<<<<<<<<<<\n * elif t == NPY_USHORT: f = \"H\"\n * elif t == NPY_INT: f = \"i\"\n */\n __pyx_t_1 = (__pyx_v_t == NPY_SHORT);\n if (__pyx_t_1) {\n __pyx_v_f = __pyx_k__h;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":261\n * elif t == NPY_UBYTE: f = \"B\"\n * elif t == NPY_SHORT: f = \"h\"\n * elif t == NPY_USHORT: f = \"H\" # <<<<<<<<<<<<<<\n * elif t == NPY_INT: f = \"i\"\n * elif t == NPY_UINT: f = \"I\"\n */\n __pyx_t_1 = (__pyx_v_t == NPY_USHORT);\n if (__pyx_t_1) {\n __pyx_v_f = __pyx_k__H;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":262\n * elif t == NPY_SHORT: f = \"h\"\n * elif t == NPY_USHORT: f = \"H\"\n * elif t == NPY_INT: f = \"i\" # <<<<<<<<<<<<<<\n * elif t == NPY_UINT: f = \"I\"\n * elif t == NPY_LONG: f = \"l\"\n */\n __pyx_t_1 = (__pyx_v_t == NPY_INT);\n if (__pyx_t_1) {\n __pyx_v_f = __pyx_k__i;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":263\n * elif t == NPY_USHORT: f = \"H\"\n * elif t == NPY_INT: f = \"i\"\n * elif t == NPY_UINT: f = \"I\" # <<<<<<<<<<<<<<\n * elif t == NPY_LONG: f = \"l\"\n * elif t == NPY_ULONG: f = \"L\"\n */\n __pyx_t_1 = (__pyx_v_t == NPY_UINT);\n if (__pyx_t_1) {\n __pyx_v_f = __pyx_k__I;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":264\n * elif t == NPY_INT: f = \"i\"\n * elif t == NPY_UINT: f = \"I\"\n * elif t == NPY_LONG: f = \"l\" # <<<<<<<<<<<<<<\n * elif t == NPY_ULONG: f = \"L\"\n * elif t == NPY_LONGLONG: f = \"q\"\n */\n __pyx_t_1 = (__pyx_v_t == NPY_LONG);\n if (__pyx_t_1) {\n __pyx_v_f = __pyx_k__l;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":265\n * elif t == NPY_UINT: f = \"I\"\n * elif t == NPY_LONG: f = \"l\"\n * elif t == NPY_ULONG: f = \"L\" # <<<<<<<<<<<<<<\n * elif t == NPY_LONGLONG: f = \"q\"\n * elif t == NPY_ULONGLONG: f = \"Q\"\n */\n __pyx_t_1 = (__pyx_v_t == NPY_ULONG);\n if (__pyx_t_1) {\n __pyx_v_f = __pyx_k__L;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":266\n * elif t == NPY_LONG: f = \"l\"\n * elif t == NPY_ULONG: f = \"L\"\n * elif t == NPY_LONGLONG: f = \"q\" # <<<<<<<<<<<<<<\n * elif t == NPY_ULONGLONG: f = \"Q\"\n * elif t == NPY_FLOAT: f = \"f\"\n */\n __pyx_t_1 = (__pyx_v_t == NPY_LONGLONG);\n if (__pyx_t_1) {\n __pyx_v_f = __pyx_k__q;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":267\n * elif t == NPY_ULONG: f = \"L\"\n * elif t == NPY_LONGLONG: f = \"q\"\n * elif t == NPY_ULONGLONG: f = \"Q\" # <<<<<<<<<<<<<<\n * elif t == NPY_FLOAT: f = \"f\"\n * elif t == NPY_DOUBLE: f = \"d\"\n */\n __pyx_t_1 = (__pyx_v_t == NPY_ULONGLONG);\n if (__pyx_t_1) {\n __pyx_v_f = __pyx_k__Q;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":268\n * elif t == NPY_LONGLONG: f = \"q\"\n * elif t == NPY_ULONGLONG: f = \"Q\"\n * elif t == NPY_FLOAT: f = \"f\" # <<<<<<<<<<<<<<\n * elif t == NPY_DOUBLE: f = \"d\"\n * elif t == NPY_LONGDOUBLE: f = \"g\"\n */\n __pyx_t_1 = (__pyx_v_t == NPY_FLOAT);\n if (__pyx_t_1) {\n __pyx_v_f = __pyx_k__f;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":269\n * elif t == NPY_ULONGLONG: f = \"Q\"\n * elif t == NPY_FLOAT: f = \"f\"\n * elif t == NPY_DOUBLE: f = \"d\" # <<<<<<<<<<<<<<\n * elif t == NPY_LONGDOUBLE: f = \"g\"\n * elif t == NPY_CFLOAT: f = \"Zf\"\n */\n __pyx_t_1 = (__pyx_v_t == NPY_DOUBLE);\n if (__pyx_t_1) {\n __pyx_v_f = __pyx_k__d;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":270\n * elif t == NPY_FLOAT: f = \"f\"\n * elif t == NPY_DOUBLE: f = \"d\"\n * elif t == NPY_LONGDOUBLE: f = \"g\" # <<<<<<<<<<<<<<\n * elif t == NPY_CFLOAT: f = \"Zf\"\n * elif t == NPY_CDOUBLE: f = \"Zd\"\n */\n __pyx_t_1 = (__pyx_v_t == NPY_LONGDOUBLE);\n if (__pyx_t_1) {\n __pyx_v_f = __pyx_k__g;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":271\n * elif t == NPY_DOUBLE: f = \"d\"\n * elif t == NPY_LONGDOUBLE: f = \"g\"\n * elif t == NPY_CFLOAT: f = \"Zf\" # <<<<<<<<<<<<<<\n * elif t == NPY_CDOUBLE: f = \"Zd\"\n * elif t == NPY_CLONGDOUBLE: f = \"Zg\"\n */\n __pyx_t_1 = (__pyx_v_t == NPY_CFLOAT);\n if (__pyx_t_1) {\n __pyx_v_f = __pyx_k__Zf;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":272\n * elif t == NPY_LONGDOUBLE: f = \"g\"\n * elif t == NPY_CFLOAT: f = \"Zf\"\n * elif t == NPY_CDOUBLE: f = \"Zd\" # <<<<<<<<<<<<<<\n * elif t == NPY_CLONGDOUBLE: f = \"Zg\"\n * elif t == NPY_OBJECT: f = \"O\"\n */\n __pyx_t_1 = (__pyx_v_t == NPY_CDOUBLE);\n if (__pyx_t_1) {\n __pyx_v_f = __pyx_k__Zd;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":273\n * elif t == NPY_CFLOAT: f = \"Zf\"\n * elif t == NPY_CDOUBLE: f = \"Zd\"\n * elif t == NPY_CLONGDOUBLE: f = \"Zg\" # <<<<<<<<<<<<<<\n * elif t == NPY_OBJECT: f = \"O\"\n * else:\n */\n __pyx_t_1 = (__pyx_v_t == NPY_CLONGDOUBLE);\n if (__pyx_t_1) {\n __pyx_v_f = __pyx_k__Zg;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":274\n * elif t == NPY_CDOUBLE: f = \"Zd\"\n * elif t == NPY_CLONGDOUBLE: f = \"Zg\"\n * elif t == NPY_OBJECT: f = \"O\" # <<<<<<<<<<<<<<\n * else:\n * raise ValueError(u\"unknown dtype code in numpy.pxd (%d)\" % t)\n */\n __pyx_t_1 = (__pyx_v_t == NPY_OBJECT);\n if (__pyx_t_1) {\n __pyx_v_f = __pyx_k__O;\n goto __pyx_L13;\n }\n /*else*/ {\n\n /* \"numpy.pxd\":276\n * elif t == NPY_OBJECT: f = \"O\"\n * else:\n * raise ValueError(u\"unknown dtype code in numpy.pxd (%d)\" % t) # <<<<<<<<<<<<<<\n * info.format = f\n * return\n */\n __pyx_t_4 = PyInt_FromLong(__pyx_v_t); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 276; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n __pyx_t_8 = PyNumber_Remainder(((PyObject *)__pyx_kp_u_12), __pyx_t_4); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 276; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(((PyObject *)__pyx_t_8));\n __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n __pyx_t_4 = PyTuple_New(1); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 276; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n PyTuple_SET_ITEM(__pyx_t_4, 0, ((PyObject *)__pyx_t_8));\n __Pyx_GIVEREF(((PyObject *)__pyx_t_8));\n __pyx_t_8 = 0;\n __pyx_t_8 = PyObject_Call(__pyx_builtin_ValueError, ((PyObject *)__pyx_t_4), NULL); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 276; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_8);\n __Pyx_DECREF(((PyObject *)__pyx_t_4)); __pyx_t_4 = 0;\n __Pyx_Raise(__pyx_t_8, 0, 0, 0);\n __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n {__pyx_filename = __pyx_f[1]; __pyx_lineno = 276; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n }\n __pyx_L13:;\n\n /* \"numpy.pxd\":277\n * else:\n * raise ValueError(u\"unknown dtype code in numpy.pxd (%d)\" % t)\n * info.format = f # <<<<<<<<<<<<<<\n * return\n * else:\n */\n __pyx_v_info->format = __pyx_v_f;\n\n /* \"numpy.pxd\":278\n * raise ValueError(u\"unknown dtype code in numpy.pxd (%d)\" % t)\n * info.format = f\n * return # <<<<<<<<<<<<<<\n * else:\n * info.format = stdlib.malloc(_buffer_format_string_len)\n */\n __pyx_r = 0;\n goto __pyx_L0;\n goto __pyx_L11;\n }\n /*else*/ {\n\n /* \"numpy.pxd\":280\n * return\n * else:\n * info.format = stdlib.malloc(_buffer_format_string_len) # <<<<<<<<<<<<<<\n * info.format[0] = c'^' # Native data types, manual alignment\n * offset = 0\n */\n __pyx_v_info->format = ((char *)malloc(255));\n\n /* \"numpy.pxd\":281\n * else:\n * info.format = stdlib.malloc(_buffer_format_string_len)\n * info.format[0] = c'^' # Native data types, manual alignment # <<<<<<<<<<<<<<\n * offset = 0\n * f = _util_dtypestring(descr, info.format + 1,\n */\n (__pyx_v_info->format[0]) = '^';\n\n /* \"numpy.pxd\":282\n * info.format = stdlib.malloc(_buffer_format_string_len)\n * info.format[0] = c'^' # Native data types, manual alignment\n * offset = 0 # <<<<<<<<<<<<<<\n * f = _util_dtypestring(descr, info.format + 1,\n * info.format + _buffer_format_string_len,\n */\n __pyx_v_offset = 0;\n\n /* \"numpy.pxd\":285\n * f = _util_dtypestring(descr, info.format + 1,\n * info.format + _buffer_format_string_len,\n * &offset) # <<<<<<<<<<<<<<\n * f[0] = c'\\0' # Terminate format string\n * \n */\n __pyx_t_9 = __pyx_f_5numpy__util_dtypestring(__pyx_v_descr, (__pyx_v_info->format + 1), (__pyx_v_info->format + 255), (&__pyx_v_offset)); if (unlikely(__pyx_t_9 == NULL)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 283; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_v_f = __pyx_t_9;\n\n /* \"numpy.pxd\":286\n * info.format + _buffer_format_string_len,\n * &offset)\n * f[0] = c'\\0' # Terminate format string # <<<<<<<<<<<<<<\n * \n * def __releasebuffer__(ndarray self, Py_buffer* info):\n */\n (__pyx_v_f[0]) = '\\x00';\n }\n __pyx_L11:;\n\n __pyx_r = 0;\n goto __pyx_L0;\n __pyx_L1_error:;\n __Pyx_XDECREF(__pyx_t_4);\n __Pyx_XDECREF(__pyx_t_8);\n __Pyx_AddTraceback(\"numpy.ndarray.__getbuffer__\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = -1;\n if (__pyx_v_info != NULL && __pyx_v_info->obj != NULL) {\n __Pyx_GOTREF(__pyx_v_info->obj);\n __Pyx_DECREF(__pyx_v_info->obj); __pyx_v_info->obj = NULL;\n }\n goto __pyx_L2;\n __pyx_L0:;\n if (__pyx_v_info != NULL && __pyx_v_info->obj == Py_None) {\n __Pyx_GOTREF(Py_None);\n __Pyx_DECREF(Py_None); __pyx_v_info->obj = NULL;\n }\n __pyx_L2:;\n __Pyx_XDECREF((PyObject *)__pyx_v_descr);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* Python wrapper */\nstatic CYTHON_UNUSED void __pyx_pw_5numpy_7ndarray_3__releasebuffer__(PyObject *__pyx_v_self, Py_buffer *__pyx_v_info); /*proto*/\nstatic CYTHON_UNUSED void __pyx_pw_5numpy_7ndarray_3__releasebuffer__(PyObject *__pyx_v_self, Py_buffer *__pyx_v_info) {\n __Pyx_RefNannyDeclarations\n __Pyx_RefNannySetupContext(\"__releasebuffer__ (wrapper)\", 0);\n __pyx_pf_5numpy_7ndarray_2__releasebuffer__(((PyArrayObject *)__pyx_v_self), ((Py_buffer *)__pyx_v_info));\n __Pyx_RefNannyFinishContext();\n}\n\n/* \"numpy.pxd\":288\n * f[0] = c'\\0' # Terminate format string\n * \n * def __releasebuffer__(ndarray self, Py_buffer* info): # <<<<<<<<<<<<<<\n * if PyArray_HASFIELDS(self):\n * stdlib.free(info.format)\n */\n\nstatic void __pyx_pf_5numpy_7ndarray_2__releasebuffer__(PyArrayObject *__pyx_v_self, Py_buffer *__pyx_v_info) {\n __Pyx_RefNannyDeclarations\n int __pyx_t_1;\n __Pyx_RefNannySetupContext(\"__releasebuffer__\", 0);\n\n /* \"numpy.pxd\":289\n * \n * def __releasebuffer__(ndarray self, Py_buffer* info):\n * if PyArray_HASFIELDS(self): # <<<<<<<<<<<<<<\n * stdlib.free(info.format)\n * if sizeof(npy_intp) != sizeof(Py_ssize_t):\n */\n __pyx_t_1 = PyArray_HASFIELDS(__pyx_v_self);\n if (__pyx_t_1) {\n\n /* \"numpy.pxd\":290\n * def __releasebuffer__(ndarray self, Py_buffer* info):\n * if PyArray_HASFIELDS(self):\n * stdlib.free(info.format) # <<<<<<<<<<<<<<\n * if sizeof(npy_intp) != sizeof(Py_ssize_t):\n * stdlib.free(info.strides)\n */\n free(__pyx_v_info->format);\n goto __pyx_L3;\n }\n __pyx_L3:;\n\n /* \"numpy.pxd\":291\n * if PyArray_HASFIELDS(self):\n * stdlib.free(info.format)\n * if sizeof(npy_intp) != sizeof(Py_ssize_t): # <<<<<<<<<<<<<<\n * stdlib.free(info.strides)\n * # info.shape was stored after info.strides in the same block\n */\n __pyx_t_1 = ((sizeof(npy_intp)) != (sizeof(Py_ssize_t)));\n if (__pyx_t_1) {\n\n /* \"numpy.pxd\":292\n * stdlib.free(info.format)\n * if sizeof(npy_intp) != sizeof(Py_ssize_t):\n * stdlib.free(info.strides) # <<<<<<<<<<<<<<\n * # info.shape was stored after info.strides in the same block\n * \n */\n free(__pyx_v_info->strides);\n goto __pyx_L4;\n }\n __pyx_L4:;\n\n __Pyx_RefNannyFinishContext();\n}\n\n/* \"numpy.pxd\":768\n * ctypedef npy_cdouble complex_t\n * \n * cdef inline object PyArray_MultiIterNew1(a): # <<<<<<<<<<<<<<\n * return PyArray_MultiIterNew(1, a)\n * \n */\n\nstatic CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew1(PyObject *__pyx_v_a) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"PyArray_MultiIterNew1\", 0);\n\n /* \"numpy.pxd\":769\n * \n * cdef inline object PyArray_MultiIterNew1(a):\n * return PyArray_MultiIterNew(1, a) # <<<<<<<<<<<<<<\n * \n * cdef inline object PyArray_MultiIterNew2(a, b):\n */\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyArray_MultiIterNew(1, ((void *)__pyx_v_a)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 769; __pyx_clineno = __LINE__; goto __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 __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(\"numpy.PyArray_MultiIterNew1\", __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/* \"numpy.pxd\":771\n * return PyArray_MultiIterNew(1, a)\n * \n * cdef inline object PyArray_MultiIterNew2(a, b): # <<<<<<<<<<<<<<\n * return PyArray_MultiIterNew(2, a, b)\n * \n */\n\nstatic CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew2(PyObject *__pyx_v_a, PyObject *__pyx_v_b) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"PyArray_MultiIterNew2\", 0);\n\n /* \"numpy.pxd\":772\n * \n * cdef inline object PyArray_MultiIterNew2(a, b):\n * return PyArray_MultiIterNew(2, a, b) # <<<<<<<<<<<<<<\n * \n * cdef inline object PyArray_MultiIterNew3(a, b, c):\n */\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyArray_MultiIterNew(2, ((void *)__pyx_v_a), ((void *)__pyx_v_b)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 772; __pyx_clineno = __LINE__; goto __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 __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(\"numpy.PyArray_MultiIterNew2\", __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/* \"numpy.pxd\":774\n * return PyArray_MultiIterNew(2, a, b)\n * \n * cdef inline object PyArray_MultiIterNew3(a, b, c): # <<<<<<<<<<<<<<\n * return PyArray_MultiIterNew(3, a, b, c)\n * \n */\n\nstatic CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew3(PyObject *__pyx_v_a, PyObject *__pyx_v_b, PyObject *__pyx_v_c) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"PyArray_MultiIterNew3\", 0);\n\n /* \"numpy.pxd\":775\n * \n * cdef inline object PyArray_MultiIterNew3(a, b, c):\n * return PyArray_MultiIterNew(3, a, b, c) # <<<<<<<<<<<<<<\n * \n * cdef inline object PyArray_MultiIterNew4(a, b, c, d):\n */\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyArray_MultiIterNew(3, ((void *)__pyx_v_a), ((void *)__pyx_v_b), ((void *)__pyx_v_c)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 775; __pyx_clineno = __LINE__; goto __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 __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(\"numpy.PyArray_MultiIterNew3\", __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/* \"numpy.pxd\":777\n * return PyArray_MultiIterNew(3, a, b, c)\n * \n * cdef inline object PyArray_MultiIterNew4(a, b, c, d): # <<<<<<<<<<<<<<\n * return PyArray_MultiIterNew(4, a, b, c, d)\n * \n */\n\nstatic CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew4(PyObject *__pyx_v_a, PyObject *__pyx_v_b, PyObject *__pyx_v_c, PyObject *__pyx_v_d) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"PyArray_MultiIterNew4\", 0);\n\n /* \"numpy.pxd\":778\n * \n * cdef inline object PyArray_MultiIterNew4(a, b, c, d):\n * return PyArray_MultiIterNew(4, a, b, c, d) # <<<<<<<<<<<<<<\n * \n * cdef inline object PyArray_MultiIterNew5(a, b, c, d, e):\n */\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyArray_MultiIterNew(4, ((void *)__pyx_v_a), ((void *)__pyx_v_b), ((void *)__pyx_v_c), ((void *)__pyx_v_d)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 778; __pyx_clineno = __LINE__; goto __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 __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(\"numpy.PyArray_MultiIterNew4\", __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/* \"numpy.pxd\":780\n * return PyArray_MultiIterNew(4, a, b, c, d)\n * \n * cdef inline object PyArray_MultiIterNew5(a, b, c, d, e): # <<<<<<<<<<<<<<\n * return PyArray_MultiIterNew(5, a, b, c, d, e)\n * \n */\n\nstatic CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew5(PyObject *__pyx_v_a, PyObject *__pyx_v_b, PyObject *__pyx_v_c, PyObject *__pyx_v_d, PyObject *__pyx_v_e) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"PyArray_MultiIterNew5\", 0);\n\n /* \"numpy.pxd\":781\n * \n * cdef inline object PyArray_MultiIterNew5(a, b, c, d, e):\n * return PyArray_MultiIterNew(5, a, b, c, d, e) # <<<<<<<<<<<<<<\n * \n * cdef inline char* _util_dtypestring(dtype descr, char* f, char* end, int* offset) except NULL:\n */\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyArray_MultiIterNew(5, ((void *)__pyx_v_a), ((void *)__pyx_v_b), ((void *)__pyx_v_c), ((void *)__pyx_v_d), ((void *)__pyx_v_e)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 781; __pyx_clineno = __LINE__; goto __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 __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(\"numpy.PyArray_MultiIterNew5\", __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/* \"numpy.pxd\":783\n * return PyArray_MultiIterNew(5, a, b, c, d, e)\n * \n * cdef inline char* _util_dtypestring(dtype descr, char* f, char* end, int* offset) except NULL: # <<<<<<<<<<<<<<\n * # Recursive utility function used in __getbuffer__ to get format\n * # string. The new location in the format string is returned.\n */\n\nstatic CYTHON_INLINE char *__pyx_f_5numpy__util_dtypestring(PyArray_Descr *__pyx_v_descr, char *__pyx_v_f, char *__pyx_v_end, int *__pyx_v_offset) {\n PyArray_Descr *__pyx_v_child = 0;\n int __pyx_v_endian_detector;\n int __pyx_v_little_endian;\n PyObject *__pyx_v_fields = 0;\n PyObject *__pyx_v_childname = NULL;\n PyObject *__pyx_v_new_offset = NULL;\n PyObject *__pyx_v_t = NULL;\n char *__pyx_r;\n __Pyx_RefNannyDeclarations\n PyObject *__pyx_t_1 = NULL;\n Py_ssize_t __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)(PyObject *);\n int __pyx_t_7;\n int __pyx_t_8;\n int __pyx_t_9;\n int __pyx_t_10;\n long __pyx_t_11;\n char *__pyx_t_12;\n int __pyx_lineno = 0;\n const char *__pyx_filename = NULL;\n int __pyx_clineno = 0;\n __Pyx_RefNannySetupContext(\"_util_dtypestring\", 0);\n\n /* \"numpy.pxd\":790\n * cdef int delta_offset\n * cdef tuple i\n * cdef int endian_detector = 1 # <<<<<<<<<<<<<<\n * cdef bint little_endian = ((&endian_detector)[0] != 0)\n * cdef tuple fields\n */\n __pyx_v_endian_detector = 1;\n\n /* \"numpy.pxd\":791\n * cdef tuple i\n * cdef int endian_detector = 1\n * cdef bint little_endian = ((&endian_detector)[0] != 0) # <<<<<<<<<<<<<<\n * cdef tuple fields\n * \n */\n __pyx_v_little_endian = ((((char *)(&__pyx_v_endian_detector))[0]) != 0);\n\n /* \"numpy.pxd\":794\n * cdef tuple fields\n * \n * for childname in descr.names: # <<<<<<<<<<<<<<\n * fields = descr.fields[childname]\n * child, new_offset = fields\n */\n if (unlikely(((PyObject *)__pyx_v_descr->names) == Py_None)) {\n PyErr_SetString(PyExc_TypeError, \"'NoneType' object is not iterable\");\n {__pyx_filename = __pyx_f[1]; __pyx_lineno = 794; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n }\n __pyx_t_1 = ((PyObject *)__pyx_v_descr->names); __Pyx_INCREF(__pyx_t_1); __pyx_t_2 = 0;\n for (;;) {\n if (__pyx_t_2 >= PyTuple_GET_SIZE(__pyx_t_1)) break;\n #if CYTHON_COMPILING_IN_CPYTHON\n __pyx_t_3 = PyTuple_GET_ITEM(__pyx_t_1, __pyx_t_2); __Pyx_INCREF(__pyx_t_3); __pyx_t_2++; if (unlikely(0 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 794; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n #else\n __pyx_t_3 = PySequence_ITEM(__pyx_t_1, __pyx_t_2); __pyx_t_2++; if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 794; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n #endif\n __Pyx_XDECREF(__pyx_v_childname);\n __pyx_v_childname = __pyx_t_3;\n __pyx_t_3 = 0;\n\n /* \"numpy.pxd\":795\n * \n * for childname in descr.names:\n * fields = descr.fields[childname] # <<<<<<<<<<<<<<\n * child, new_offset = fields\n * \n */\n __pyx_t_3 = PyObject_GetItem(__pyx_v_descr->fields, __pyx_v_childname); if (!__pyx_t_3) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 795; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n if (!(likely(PyTuple_CheckExact(__pyx_t_3))||((__pyx_t_3) == Py_None)||(PyErr_Format(PyExc_TypeError, \"Expected tuple, got %.200s\", Py_TYPE(__pyx_t_3)->tp_name), 0))) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 795; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_XDECREF(((PyObject *)__pyx_v_fields));\n __pyx_v_fields = ((PyObject*)__pyx_t_3);\n __pyx_t_3 = 0;\n\n /* \"numpy.pxd\":796\n * for childname in descr.names:\n * fields = descr.fields[childname]\n * child, new_offset = fields # <<<<<<<<<<<<<<\n * \n * if (end - f) - (new_offset - offset[0]) < 15:\n */\n if (likely(PyTuple_CheckExact(((PyObject *)__pyx_v_fields)))) {\n PyObject* sequence = ((PyObject *)__pyx_v_fields);\n #if CYTHON_COMPILING_IN_CPYTHON\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_filename = __pyx_f[1]; __pyx_lineno = 796; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n }\n #if CYTHON_COMPILING_IN_CPYTHON\n __pyx_t_3 = PyTuple_GET_ITEM(sequence, 0); \n __pyx_t_4 = PyTuple_GET_ITEM(sequence, 1); \n __Pyx_INCREF(__pyx_t_3);\n __Pyx_INCREF(__pyx_t_4);\n #else\n __pyx_t_3 = PySequence_ITEM(sequence, 0); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 796; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_t_4 = PySequence_ITEM(sequence, 1); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 796; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n #endif\n } else if (1) {\n __Pyx_RaiseNoneNotIterableError(); {__pyx_filename = __pyx_f[1]; __pyx_lineno = 796; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n } else\n {\n Py_ssize_t index = -1;\n __pyx_t_5 = PyObject_GetIter(((PyObject *)__pyx_v_fields)); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 796; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __pyx_t_6 = Py_TYPE(__pyx_t_5)->tp_iternext;\n index = 0; __pyx_t_3 = __pyx_t_6(__pyx_t_5); if (unlikely(!__pyx_t_3)) goto __pyx_L5_unpacking_failed;\n __Pyx_GOTREF(__pyx_t_3);\n index = 1; __pyx_t_4 = __pyx_t_6(__pyx_t_5); if (unlikely(!__pyx_t_4)) goto __pyx_L5_unpacking_failed;\n __Pyx_GOTREF(__pyx_t_4);\n if (__Pyx_IternextUnpackEndCheck(__pyx_t_6(__pyx_t_5), 2) < 0) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 796; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_t_6 = NULL;\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n goto __pyx_L6_unpacking_done;\n __pyx_L5_unpacking_failed:;\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n __pyx_t_6 = NULL;\n if (__Pyx_IterFinish() == 0) __Pyx_RaiseNeedMoreValuesError(index);\n {__pyx_filename = __pyx_f[1]; __pyx_lineno = 796; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_L6_unpacking_done:;\n }\n if (!(likely(((__pyx_t_3) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_3, __pyx_ptype_5numpy_dtype))))) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 796; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_XDECREF(((PyObject *)__pyx_v_child));\n __pyx_v_child = ((PyArray_Descr *)__pyx_t_3);\n __pyx_t_3 = 0;\n __Pyx_XDECREF(__pyx_v_new_offset);\n __pyx_v_new_offset = __pyx_t_4;\n __pyx_t_4 = 0;\n\n /* \"numpy.pxd\":798\n * child, new_offset = fields\n * \n * if (end - f) - (new_offset - offset[0]) < 15: # <<<<<<<<<<<<<<\n * raise RuntimeError(u\"Format string allocated too short, see comment in numpy.pxd\")\n * \n */\n __pyx_t_4 = PyInt_FromLong((__pyx_v_end - __pyx_v_f)); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 798; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n __pyx_t_3 = PyInt_FromLong((__pyx_v_offset[0])); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 798; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_5 = PyNumber_Subtract(__pyx_v_new_offset, __pyx_t_3); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 798; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_3 = PyNumber_Subtract(__pyx_t_4, __pyx_t_5); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 798; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n __pyx_t_5 = PyObject_RichCompare(__pyx_t_3, __pyx_int_15, Py_LT); __Pyx_XGOTREF(__pyx_t_5); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 798; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_7 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_7 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 798; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n if (__pyx_t_7) {\n\n /* \"numpy.pxd\":799\n * \n * if (end - f) - (new_offset - offset[0]) < 15:\n * raise RuntimeError(u\"Format string allocated too short, see comment in numpy.pxd\") # <<<<<<<<<<<<<<\n * \n * if ((child.byteorder == c'>' and little_endian) or\n */\n __pyx_t_5 = PyObject_Call(__pyx_builtin_RuntimeError, ((PyObject *)__pyx_k_tuple_14), NULL); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 799; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __Pyx_Raise(__pyx_t_5, 0, 0, 0);\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n {__pyx_filename = __pyx_f[1]; __pyx_lineno = 799; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n goto __pyx_L7;\n }\n __pyx_L7:;\n\n /* \"numpy.pxd\":801\n * raise RuntimeError(u\"Format string allocated too short, see comment in numpy.pxd\")\n * \n * if ((child.byteorder == c'>' and little_endian) or # <<<<<<<<<<<<<<\n * (child.byteorder == c'<' and not little_endian)):\n * raise ValueError(u\"Non-native byte order not supported\")\n */\n __pyx_t_7 = (__pyx_v_child->byteorder == '>');\n if (__pyx_t_7) {\n __pyx_t_8 = __pyx_v_little_endian;\n } else {\n __pyx_t_8 = __pyx_t_7;\n }\n if (!__pyx_t_8) {\n\n /* \"numpy.pxd\":802\n * \n * if ((child.byteorder == c'>' and little_endian) or\n * (child.byteorder == c'<' and not little_endian)): # <<<<<<<<<<<<<<\n * raise ValueError(u\"Non-native byte order not supported\")\n * # One could encode it in the format string and have Cython\n */\n __pyx_t_7 = (__pyx_v_child->byteorder == '<');\n if (__pyx_t_7) {\n __pyx_t_9 = (!__pyx_v_little_endian);\n __pyx_t_10 = __pyx_t_9;\n } else {\n __pyx_t_10 = __pyx_t_7;\n }\n __pyx_t_7 = __pyx_t_10;\n } else {\n __pyx_t_7 = __pyx_t_8;\n }\n if (__pyx_t_7) {\n\n /* \"numpy.pxd\":803\n * if ((child.byteorder == c'>' and little_endian) or\n * (child.byteorder == c'<' and not little_endian)):\n * raise ValueError(u\"Non-native byte order not supported\") # <<<<<<<<<<<<<<\n * # One could encode it in the format string and have Cython\n * # complain instead, BUT: < and > in format strings also imply\n */\n __pyx_t_5 = PyObject_Call(__pyx_builtin_ValueError, ((PyObject *)__pyx_k_tuple_15), NULL); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 803; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __Pyx_Raise(__pyx_t_5, 0, 0, 0);\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n {__pyx_filename = __pyx_f[1]; __pyx_lineno = 803; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n goto __pyx_L8;\n }\n __pyx_L8:;\n\n /* \"numpy.pxd\":813\n * \n * # Output padding bytes\n * while offset[0] < new_offset: # <<<<<<<<<<<<<<\n * f[0] = 120 # \"x\"; pad byte\n * f += 1\n */\n while (1) {\n __pyx_t_5 = PyInt_FromLong((__pyx_v_offset[0])); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 813; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __pyx_t_3 = PyObject_RichCompare(__pyx_t_5, __pyx_v_new_offset, Py_LT); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 813; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n __pyx_t_7 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_7 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 813; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n if (!__pyx_t_7) break;\n\n /* \"numpy.pxd\":814\n * # Output padding bytes\n * while offset[0] < new_offset:\n * f[0] = 120 # \"x\"; pad byte # <<<<<<<<<<<<<<\n * f += 1\n * offset[0] += 1\n */\n (__pyx_v_f[0]) = 120;\n\n /* \"numpy.pxd\":815\n * while offset[0] < new_offset:\n * f[0] = 120 # \"x\"; pad byte\n * f += 1 # <<<<<<<<<<<<<<\n * offset[0] += 1\n * \n */\n __pyx_v_f = (__pyx_v_f + 1);\n\n /* \"numpy.pxd\":816\n * f[0] = 120 # \"x\"; pad byte\n * f += 1\n * offset[0] += 1 # <<<<<<<<<<<<<<\n * \n * offset[0] += child.itemsize\n */\n __pyx_t_11 = 0;\n (__pyx_v_offset[__pyx_t_11]) = ((__pyx_v_offset[__pyx_t_11]) + 1);\n }\n\n /* \"numpy.pxd\":818\n * offset[0] += 1\n * \n * offset[0] += child.itemsize # <<<<<<<<<<<<<<\n * \n * if not PyDataType_HASFIELDS(child):\n */\n __pyx_t_11 = 0;\n (__pyx_v_offset[__pyx_t_11]) = ((__pyx_v_offset[__pyx_t_11]) + __pyx_v_child->elsize);\n\n /* \"numpy.pxd\":820\n * offset[0] += child.itemsize\n * \n * if not PyDataType_HASFIELDS(child): # <<<<<<<<<<<<<<\n * t = child.type_num\n * if end - f < 5:\n */\n __pyx_t_7 = (!PyDataType_HASFIELDS(__pyx_v_child));\n if (__pyx_t_7) {\n\n /* \"numpy.pxd\":821\n * \n * if not PyDataType_HASFIELDS(child):\n * t = child.type_num # <<<<<<<<<<<<<<\n * if end - f < 5:\n * raise RuntimeError(u\"Format string allocated too short.\")\n */\n __pyx_t_3 = PyInt_FromLong(__pyx_v_child->type_num); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 821; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_XDECREF(__pyx_v_t);\n __pyx_v_t = __pyx_t_3;\n __pyx_t_3 = 0;\n\n /* \"numpy.pxd\":822\n * if not PyDataType_HASFIELDS(child):\n * t = child.type_num\n * if end - f < 5: # <<<<<<<<<<<<<<\n * raise RuntimeError(u\"Format string allocated too short.\")\n * \n */\n __pyx_t_7 = ((__pyx_v_end - __pyx_v_f) < 5);\n if (__pyx_t_7) {\n\n /* \"numpy.pxd\":823\n * t = child.type_num\n * if end - f < 5:\n * raise RuntimeError(u\"Format string allocated too short.\") # <<<<<<<<<<<<<<\n * \n * # Until ticket #99 is fixed, use integers to avoid warnings\n */\n __pyx_t_3 = PyObject_Call(__pyx_builtin_RuntimeError, ((PyObject *)__pyx_k_tuple_17), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 823; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_Raise(__pyx_t_3, 0, 0, 0);\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n {__pyx_filename = __pyx_f[1]; __pyx_lineno = 823; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n goto __pyx_L12;\n }\n __pyx_L12:;\n\n /* \"numpy.pxd\":826\n * \n * # Until ticket #99 is fixed, use integers to avoid warnings\n * if t == NPY_BYTE: f[0] = 98 #\"b\" # <<<<<<<<<<<<<<\n * elif t == NPY_UBYTE: f[0] = 66 #\"B\"\n * elif t == NPY_SHORT: f[0] = 104 #\"h\"\n */\n __pyx_t_3 = PyInt_FromLong(NPY_BYTE); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 826; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_5 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_5); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 826; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_7 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_7 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 826; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n if (__pyx_t_7) {\n (__pyx_v_f[0]) = 98;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":827\n * # Until ticket #99 is fixed, use integers to avoid warnings\n * if t == NPY_BYTE: f[0] = 98 #\"b\"\n * elif t == NPY_UBYTE: f[0] = 66 #\"B\" # <<<<<<<<<<<<<<\n * elif t == NPY_SHORT: f[0] = 104 #\"h\"\n * elif t == NPY_USHORT: f[0] = 72 #\"H\"\n */\n __pyx_t_5 = PyInt_FromLong(NPY_UBYTE); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 827; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_5, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 827; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n __pyx_t_7 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_7 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 827; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n if (__pyx_t_7) {\n (__pyx_v_f[0]) = 66;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":828\n * if t == NPY_BYTE: f[0] = 98 #\"b\"\n * elif t == NPY_UBYTE: f[0] = 66 #\"B\"\n * elif t == NPY_SHORT: f[0] = 104 #\"h\" # <<<<<<<<<<<<<<\n * elif t == NPY_USHORT: f[0] = 72 #\"H\"\n * elif t == NPY_INT: f[0] = 105 #\"i\"\n */\n __pyx_t_3 = PyInt_FromLong(NPY_SHORT); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 828; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_5 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_5); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 828; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_7 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_7 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 828; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n if (__pyx_t_7) {\n (__pyx_v_f[0]) = 104;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":829\n * elif t == NPY_UBYTE: f[0] = 66 #\"B\"\n * elif t == NPY_SHORT: f[0] = 104 #\"h\"\n * elif t == NPY_USHORT: f[0] = 72 #\"H\" # <<<<<<<<<<<<<<\n * elif t == NPY_INT: f[0] = 105 #\"i\"\n * elif t == NPY_UINT: f[0] = 73 #\"I\"\n */\n __pyx_t_5 = PyInt_FromLong(NPY_USHORT); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 829; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_5, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 829; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n __pyx_t_7 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_7 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 829; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n if (__pyx_t_7) {\n (__pyx_v_f[0]) = 72;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":830\n * elif t == NPY_SHORT: f[0] = 104 #\"h\"\n * elif t == NPY_USHORT: f[0] = 72 #\"H\"\n * elif t == NPY_INT: f[0] = 105 #\"i\" # <<<<<<<<<<<<<<\n * elif t == NPY_UINT: f[0] = 73 #\"I\"\n * elif t == NPY_LONG: f[0] = 108 #\"l\"\n */\n __pyx_t_3 = PyInt_FromLong(NPY_INT); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 830; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_5 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_5); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 830; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_7 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_7 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 830; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n if (__pyx_t_7) {\n (__pyx_v_f[0]) = 105;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":831\n * elif t == NPY_USHORT: f[0] = 72 #\"H\"\n * elif t == NPY_INT: f[0] = 105 #\"i\"\n * elif t == NPY_UINT: f[0] = 73 #\"I\" # <<<<<<<<<<<<<<\n * elif t == NPY_LONG: f[0] = 108 #\"l\"\n * elif t == NPY_ULONG: f[0] = 76 #\"L\"\n */\n __pyx_t_5 = PyInt_FromLong(NPY_UINT); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 831; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_5, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 831; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n __pyx_t_7 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_7 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 831; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n if (__pyx_t_7) {\n (__pyx_v_f[0]) = 73;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":832\n * elif t == NPY_INT: f[0] = 105 #\"i\"\n * elif t == NPY_UINT: f[0] = 73 #\"I\"\n * elif t == NPY_LONG: f[0] = 108 #\"l\" # <<<<<<<<<<<<<<\n * elif t == NPY_ULONG: f[0] = 76 #\"L\"\n * elif t == NPY_LONGLONG: f[0] = 113 #\"q\"\n */\n __pyx_t_3 = PyInt_FromLong(NPY_LONG); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 832; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_5 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_5); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 832; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_7 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_7 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 832; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n if (__pyx_t_7) {\n (__pyx_v_f[0]) = 108;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":833\n * elif t == NPY_UINT: f[0] = 73 #\"I\"\n * elif t == NPY_LONG: f[0] = 108 #\"l\"\n * elif t == NPY_ULONG: f[0] = 76 #\"L\" # <<<<<<<<<<<<<<\n * elif t == NPY_LONGLONG: f[0] = 113 #\"q\"\n * elif t == NPY_ULONGLONG: f[0] = 81 #\"Q\"\n */\n __pyx_t_5 = PyInt_FromLong(NPY_ULONG); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 833; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_5, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 833; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n __pyx_t_7 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_7 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 833; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n if (__pyx_t_7) {\n (__pyx_v_f[0]) = 76;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":834\n * elif t == NPY_LONG: f[0] = 108 #\"l\"\n * elif t == NPY_ULONG: f[0] = 76 #\"L\"\n * elif t == NPY_LONGLONG: f[0] = 113 #\"q\" # <<<<<<<<<<<<<<\n * elif t == NPY_ULONGLONG: f[0] = 81 #\"Q\"\n * elif t == NPY_FLOAT: f[0] = 102 #\"f\"\n */\n __pyx_t_3 = PyInt_FromLong(NPY_LONGLONG); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 834; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_5 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_5); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 834; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_7 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_7 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 834; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n if (__pyx_t_7) {\n (__pyx_v_f[0]) = 113;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":835\n * elif t == NPY_ULONG: f[0] = 76 #\"L\"\n * elif t == NPY_LONGLONG: f[0] = 113 #\"q\"\n * elif t == NPY_ULONGLONG: f[0] = 81 #\"Q\" # <<<<<<<<<<<<<<\n * elif t == NPY_FLOAT: f[0] = 102 #\"f\"\n * elif t == NPY_DOUBLE: f[0] = 100 #\"d\"\n */\n __pyx_t_5 = PyInt_FromLong(NPY_ULONGLONG); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 835; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_5, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 835; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n __pyx_t_7 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_7 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 835; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n if (__pyx_t_7) {\n (__pyx_v_f[0]) = 81;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":836\n * elif t == NPY_LONGLONG: f[0] = 113 #\"q\"\n * elif t == NPY_ULONGLONG: f[0] = 81 #\"Q\"\n * elif t == NPY_FLOAT: f[0] = 102 #\"f\" # <<<<<<<<<<<<<<\n * elif t == NPY_DOUBLE: f[0] = 100 #\"d\"\n * elif t == NPY_LONGDOUBLE: f[0] = 103 #\"g\"\n */\n __pyx_t_3 = PyInt_FromLong(NPY_FLOAT); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 836; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_5 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_5); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 836; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_7 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_7 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 836; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n if (__pyx_t_7) {\n (__pyx_v_f[0]) = 102;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":837\n * elif t == NPY_ULONGLONG: f[0] = 81 #\"Q\"\n * elif t == NPY_FLOAT: f[0] = 102 #\"f\"\n * elif t == NPY_DOUBLE: f[0] = 100 #\"d\" # <<<<<<<<<<<<<<\n * elif t == NPY_LONGDOUBLE: f[0] = 103 #\"g\"\n * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf\n */\n __pyx_t_5 = PyInt_FromLong(NPY_DOUBLE); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 837; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_5, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 837; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n __pyx_t_7 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_7 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 837; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n if (__pyx_t_7) {\n (__pyx_v_f[0]) = 100;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":838\n * elif t == NPY_FLOAT: f[0] = 102 #\"f\"\n * elif t == NPY_DOUBLE: f[0] = 100 #\"d\"\n * elif t == NPY_LONGDOUBLE: f[0] = 103 #\"g\" # <<<<<<<<<<<<<<\n * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf\n * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd\n */\n __pyx_t_3 = PyInt_FromLong(NPY_LONGDOUBLE); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 838; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_5 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_5); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 838; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_7 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_7 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 838; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n if (__pyx_t_7) {\n (__pyx_v_f[0]) = 103;\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":839\n * elif t == NPY_DOUBLE: f[0] = 100 #\"d\"\n * elif t == NPY_LONGDOUBLE: f[0] = 103 #\"g\"\n * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf # <<<<<<<<<<<<<<\n * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd\n * elif t == NPY_CLONGDOUBLE: f[0] = 90; f[1] = 103; f += 1 # Zg\n */\n __pyx_t_5 = PyInt_FromLong(NPY_CFLOAT); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 839; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_5, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 839; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n __pyx_t_7 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_7 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 839; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n if (__pyx_t_7) {\n (__pyx_v_f[0]) = 90;\n (__pyx_v_f[1]) = 102;\n __pyx_v_f = (__pyx_v_f + 1);\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":840\n * elif t == NPY_LONGDOUBLE: f[0] = 103 #\"g\"\n * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf\n * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd # <<<<<<<<<<<<<<\n * elif t == NPY_CLONGDOUBLE: f[0] = 90; f[1] = 103; f += 1 # Zg\n * elif t == NPY_OBJECT: f[0] = 79 #\"O\"\n */\n __pyx_t_3 = PyInt_FromLong(NPY_CDOUBLE); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 840; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_5 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_5); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 840; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_7 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_7 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 840; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n if (__pyx_t_7) {\n (__pyx_v_f[0]) = 90;\n (__pyx_v_f[1]) = 100;\n __pyx_v_f = (__pyx_v_f + 1);\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":841\n * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf\n * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd\n * elif t == NPY_CLONGDOUBLE: f[0] = 90; f[1] = 103; f += 1 # Zg # <<<<<<<<<<<<<<\n * elif t == NPY_OBJECT: f[0] = 79 #\"O\"\n * else:\n */\n __pyx_t_5 = PyInt_FromLong(NPY_CLONGDOUBLE); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 841; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_5, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 841; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n __pyx_t_7 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_7 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 841; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n if (__pyx_t_7) {\n (__pyx_v_f[0]) = 90;\n (__pyx_v_f[1]) = 103;\n __pyx_v_f = (__pyx_v_f + 1);\n goto __pyx_L13;\n }\n\n /* \"numpy.pxd\":842\n * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd\n * elif t == NPY_CLONGDOUBLE: f[0] = 90; f[1] = 103; f += 1 # Zg\n * elif t == NPY_OBJECT: f[0] = 79 #\"O\" # <<<<<<<<<<<<<<\n * else:\n * raise ValueError(u\"unknown dtype code in numpy.pxd (%d)\" % t)\n */\n __pyx_t_3 = PyInt_FromLong(NPY_OBJECT); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 842; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_5 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_5); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 842; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_7 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_7 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 842; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n if (__pyx_t_7) {\n (__pyx_v_f[0]) = 79;\n goto __pyx_L13;\n }\n /*else*/ {\n\n /* \"numpy.pxd\":844\n * elif t == NPY_OBJECT: f[0] = 79 #\"O\"\n * else:\n * raise ValueError(u\"unknown dtype code in numpy.pxd (%d)\" % t) # <<<<<<<<<<<<<<\n * f += 1\n * else:\n */\n __pyx_t_5 = PyNumber_Remainder(((PyObject *)__pyx_kp_u_12), __pyx_v_t); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 844; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(((PyObject *)__pyx_t_5));\n __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 844; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n PyTuple_SET_ITEM(__pyx_t_3, 0, ((PyObject *)__pyx_t_5));\n __Pyx_GIVEREF(((PyObject *)__pyx_t_5));\n __pyx_t_5 = 0;\n __pyx_t_5 = PyObject_Call(__pyx_builtin_ValueError, ((PyObject *)__pyx_t_3), NULL); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 844; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __Pyx_DECREF(((PyObject *)__pyx_t_3)); __pyx_t_3 = 0;\n __Pyx_Raise(__pyx_t_5, 0, 0, 0);\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n {__pyx_filename = __pyx_f[1]; __pyx_lineno = 844; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n }\n __pyx_L13:;\n\n /* \"numpy.pxd\":845\n * else:\n * raise ValueError(u\"unknown dtype code in numpy.pxd (%d)\" % t)\n * f += 1 # <<<<<<<<<<<<<<\n * else:\n * # Cython ignores struct boundary information (\"T{...}\"),\n */\n __pyx_v_f = (__pyx_v_f + 1);\n goto __pyx_L11;\n }\n /*else*/ {\n\n /* \"numpy.pxd\":849\n * # Cython ignores struct boundary information (\"T{...}\"),\n * # so don't output it\n * f = _util_dtypestring(child, f, end, offset) # <<<<<<<<<<<<<<\n * return f\n * \n */\n __pyx_t_12 = __pyx_f_5numpy__util_dtypestring(__pyx_v_child, __pyx_v_f, __pyx_v_end, __pyx_v_offset); if (unlikely(__pyx_t_12 == NULL)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 849; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_v_f = __pyx_t_12;\n }\n __pyx_L11:;\n }\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n /* \"numpy.pxd\":850\n * # so don't output it\n * f = _util_dtypestring(child, f, end, offset)\n * return f # <<<<<<<<<<<<<<\n * \n * \n */\n __pyx_r = __pyx_v_f;\n goto __pyx_L0;\n\n __pyx_r = 0;\n goto __pyx_L0;\n __pyx_L1_error:;\n __Pyx_XDECREF(__pyx_t_1);\n __Pyx_XDECREF(__pyx_t_3);\n __Pyx_XDECREF(__pyx_t_4);\n __Pyx_XDECREF(__pyx_t_5);\n __Pyx_AddTraceback(\"numpy._util_dtypestring\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_XDECREF((PyObject *)__pyx_v_child);\n __Pyx_XDECREF(__pyx_v_fields);\n __Pyx_XDECREF(__pyx_v_childname);\n __Pyx_XDECREF(__pyx_v_new_offset);\n __Pyx_XDECREF(__pyx_v_t);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"numpy.pxd\":965\n * \n * \n * cdef inline void set_array_base(ndarray arr, object base): # <<<<<<<<<<<<<<\n * cdef PyObject* baseptr\n * if base is None:\n */\n\nstatic CYTHON_INLINE void __pyx_f_5numpy_set_array_base(PyArrayObject *__pyx_v_arr, PyObject *__pyx_v_base) {\n PyObject *__pyx_v_baseptr;\n __Pyx_RefNannyDeclarations\n int __pyx_t_1;\n __Pyx_RefNannySetupContext(\"set_array_base\", 0);\n\n /* \"numpy.pxd\":967\n * cdef inline void set_array_base(ndarray arr, object base):\n * cdef PyObject* baseptr\n * if base is None: # <<<<<<<<<<<<<<\n * baseptr = NULL\n * else:\n */\n __pyx_t_1 = (__pyx_v_base == Py_None);\n if (__pyx_t_1) {\n\n /* \"numpy.pxd\":968\n * cdef PyObject* baseptr\n * if base is None:\n * baseptr = NULL # <<<<<<<<<<<<<<\n * else:\n * Py_INCREF(base) # important to do this before decref below!\n */\n __pyx_v_baseptr = NULL;\n goto __pyx_L3;\n }\n /*else*/ {\n\n /* \"numpy.pxd\":970\n * baseptr = NULL\n * else:\n * Py_INCREF(base) # important to do this before decref below! # <<<<<<<<<<<<<<\n * baseptr = base\n * Py_XDECREF(arr.base)\n */\n Py_INCREF(__pyx_v_base);\n\n /* \"numpy.pxd\":971\n * else:\n * Py_INCREF(base) # important to do this before decref below!\n * baseptr = base # <<<<<<<<<<<<<<\n * Py_XDECREF(arr.base)\n * arr.base = baseptr\n */\n __pyx_v_baseptr = ((PyObject *)__pyx_v_base);\n }\n __pyx_L3:;\n\n /* \"numpy.pxd\":972\n * Py_INCREF(base) # important to do this before decref below!\n * baseptr = base\n * Py_XDECREF(arr.base) # <<<<<<<<<<<<<<\n * arr.base = baseptr\n * \n */\n Py_XDECREF(__pyx_v_arr->base);\n\n /* \"numpy.pxd\":973\n * baseptr = base\n * Py_XDECREF(arr.base)\n * arr.base = baseptr # <<<<<<<<<<<<<<\n * \n * cdef inline object get_array_base(ndarray arr):\n */\n __pyx_v_arr->base = __pyx_v_baseptr;\n\n __Pyx_RefNannyFinishContext();\n}\n\n/* \"numpy.pxd\":975\n * arr.base = baseptr\n * \n * cdef inline object get_array_base(ndarray arr): # <<<<<<<<<<<<<<\n * if arr.base is NULL:\n * return None\n */\n\nstatic CYTHON_INLINE PyObject *__pyx_f_5numpy_get_array_base(PyArrayObject *__pyx_v_arr) {\n PyObject *__pyx_r = NULL;\n __Pyx_RefNannyDeclarations\n int __pyx_t_1;\n __Pyx_RefNannySetupContext(\"get_array_base\", 0);\n\n /* \"numpy.pxd\":976\n * \n * cdef inline object get_array_base(ndarray arr):\n * if arr.base is NULL: # <<<<<<<<<<<<<<\n * return None\n * else:\n */\n __pyx_t_1 = (__pyx_v_arr->base == NULL);\n if (__pyx_t_1) {\n\n /* \"numpy.pxd\":977\n * cdef inline object get_array_base(ndarray arr):\n * if arr.base is NULL:\n * return None # <<<<<<<<<<<<<<\n * else:\n * return arr.base\n */\n __Pyx_XDECREF(__pyx_r);\n __Pyx_INCREF(Py_None);\n __pyx_r = Py_None;\n goto __pyx_L0;\n goto __pyx_L3;\n }\n /*else*/ {\n\n /* \"numpy.pxd\":979\n * return None\n * else:\n * return arr.base # <<<<<<<<<<<<<<\n */\n __Pyx_XDECREF(__pyx_r);\n __Pyx_INCREF(((PyObject *)__pyx_v_arr->base));\n __pyx_r = ((PyObject *)__pyx_v_arr->base);\n goto __pyx_L0;\n }\n __pyx_L3:;\n\n __pyx_r = Py_None; __Pyx_INCREF(Py_None);\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\nstatic struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_LossFunction __pyx_vtable_7sklearn_12linear_model_8sgd_fast_LossFunction;\n\nstatic PyObject *__pyx_tp_new_7sklearn_12linear_model_8sgd_fast_LossFunction(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {\n struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *p;\n PyObject *o = (*t->tp_alloc)(t, 0);\n if (!o) return 0;\n p = ((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *)o);\n p->__pyx_vtab = __pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_LossFunction;\n return o;\n}\n\nstatic void __pyx_tp_dealloc_7sklearn_12linear_model_8sgd_fast_LossFunction(PyObject *o) {\n (*Py_TYPE(o)->tp_free)(o);\n}\n\nstatic PyMethodDef __pyx_methods_7sklearn_12linear_model_8sgd_fast_LossFunction[] = {\n {__Pyx_NAMESTR(\"loss\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_12LossFunction_1loss, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(__pyx_doc_7sklearn_12linear_model_8sgd_fast_12LossFunction_loss)},\n {__Pyx_NAMESTR(\"dloss\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_12LossFunction_3dloss, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(__pyx_doc_7sklearn_12linear_model_8sgd_fast_12LossFunction_2dloss)},\n {0, 0, 0, 0}\n};\n\nstatic PyNumberMethods __pyx_tp_as_number_LossFunction = {\n 0, /*nb_add*/\n 0, /*nb_subtract*/\n 0, /*nb_multiply*/\n #if PY_MAJOR_VERSION < 3\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\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 0, /*nb_float*/\n #if PY_MAJOR_VERSION < 3\n 0, /*nb_oct*/\n #endif\n #if PY_MAJOR_VERSION < 3\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\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 #if PY_VERSION_HEX >= 0x02050000\n 0, /*nb_index*/\n #endif\n};\n\nstatic PySequenceMethods __pyx_tp_as_sequence_LossFunction = {\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 0, /*sq_contains*/\n 0, /*sq_inplace_concat*/\n 0, /*sq_inplace_repeat*/\n};\n\nstatic PyMappingMethods __pyx_tp_as_mapping_LossFunction = {\n 0, /*mp_length*/\n 0, /*mp_subscript*/\n 0, /*mp_ass_subscript*/\n};\n\nstatic PyBufferProcs __pyx_tp_as_buffer_LossFunction = {\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getreadbuffer*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getwritebuffer*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getsegcount*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getcharbuffer*/\n #endif\n #if PY_VERSION_HEX >= 0x02060000\n 0, /*bf_getbuffer*/\n #endif\n #if PY_VERSION_HEX >= 0x02060000\n 0, /*bf_releasebuffer*/\n #endif\n};\n\nstatic PyTypeObject __pyx_type_7sklearn_12linear_model_8sgd_fast_LossFunction = {\n PyVarObject_HEAD_INIT(0, 0)\n __Pyx_NAMESTR(\"sklearn.linear_model.sgd_fast.LossFunction\"), /*tp_name*/\n sizeof(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction), /*tp_basicsize*/\n 0, /*tp_itemsize*/\n __pyx_tp_dealloc_7sklearn_12linear_model_8sgd_fast_LossFunction, /*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 #else\n 0, /*reserved*/\n #endif\n 0, /*tp_repr*/\n &__pyx_tp_as_number_LossFunction, /*tp_as_number*/\n &__pyx_tp_as_sequence_LossFunction, /*tp_as_sequence*/\n &__pyx_tp_as_mapping_LossFunction, /*tp_as_mapping*/\n 0, /*tp_hash*/\n 0, /*tp_call*/\n 0, /*tp_str*/\n 0, /*tp_getattro*/\n 0, /*tp_setattro*/\n &__pyx_tp_as_buffer_LossFunction, /*tp_as_buffer*/\n Py_TPFLAGS_DEFAULT|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n __Pyx_DOCSTR(\"Base class for convex loss functions\"), /*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_7sklearn_12linear_model_8sgd_fast_LossFunction, /*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_7sklearn_12linear_model_8sgd_fast_LossFunction, /*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 #if PY_VERSION_HEX >= 0x02060000\n 0, /*tp_version_tag*/\n #endif\n};\nstatic struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Regression __pyx_vtable_7sklearn_12linear_model_8sgd_fast_Regression;\n\nstatic PyObject *__pyx_tp_new_7sklearn_12linear_model_8sgd_fast_Regression(PyTypeObject *t, PyObject *a, PyObject *k) {\n struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Regression *p;\n PyObject *o = __pyx_tp_new_7sklearn_12linear_model_8sgd_fast_LossFunction(t, a, k);\n if (!o) return 0;\n p = ((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Regression *)o);\n p->__pyx_base.__pyx_vtab = (struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_LossFunction*)__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Regression;\n return o;\n}\n\nstatic PyMethodDef __pyx_methods_7sklearn_12linear_model_8sgd_fast_Regression[] = {\n {__Pyx_NAMESTR(\"loss\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_10Regression_1loss, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(0)},\n {__Pyx_NAMESTR(\"dloss\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_10Regression_3dloss, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(0)},\n {0, 0, 0, 0}\n};\n\nstatic PyNumberMethods __pyx_tp_as_number_Regression = {\n 0, /*nb_add*/\n 0, /*nb_subtract*/\n 0, /*nb_multiply*/\n #if PY_MAJOR_VERSION < 3\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\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 0, /*nb_float*/\n #if PY_MAJOR_VERSION < 3\n 0, /*nb_oct*/\n #endif\n #if PY_MAJOR_VERSION < 3\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\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 #if PY_VERSION_HEX >= 0x02050000\n 0, /*nb_index*/\n #endif\n};\n\nstatic PySequenceMethods __pyx_tp_as_sequence_Regression = {\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 0, /*sq_contains*/\n 0, /*sq_inplace_concat*/\n 0, /*sq_inplace_repeat*/\n};\n\nstatic PyMappingMethods __pyx_tp_as_mapping_Regression = {\n 0, /*mp_length*/\n 0, /*mp_subscript*/\n 0, /*mp_ass_subscript*/\n};\n\nstatic PyBufferProcs __pyx_tp_as_buffer_Regression = {\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getreadbuffer*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getwritebuffer*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getsegcount*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getcharbuffer*/\n #endif\n #if PY_VERSION_HEX >= 0x02060000\n 0, /*bf_getbuffer*/\n #endif\n #if PY_VERSION_HEX >= 0x02060000\n 0, /*bf_releasebuffer*/\n #endif\n};\n\nstatic PyTypeObject __pyx_type_7sklearn_12linear_model_8sgd_fast_Regression = {\n PyVarObject_HEAD_INIT(0, 0)\n __Pyx_NAMESTR(\"sklearn.linear_model.sgd_fast.Regression\"), /*tp_name*/\n sizeof(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Regression), /*tp_basicsize*/\n 0, /*tp_itemsize*/\n __pyx_tp_dealloc_7sklearn_12linear_model_8sgd_fast_LossFunction, /*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 #else\n 0, /*reserved*/\n #endif\n 0, /*tp_repr*/\n &__pyx_tp_as_number_Regression, /*tp_as_number*/\n &__pyx_tp_as_sequence_Regression, /*tp_as_sequence*/\n &__pyx_tp_as_mapping_Regression, /*tp_as_mapping*/\n 0, /*tp_hash*/\n 0, /*tp_call*/\n 0, /*tp_str*/\n 0, /*tp_getattro*/\n 0, /*tp_setattro*/\n &__pyx_tp_as_buffer_Regression, /*tp_as_buffer*/\n Py_TPFLAGS_DEFAULT|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n __Pyx_DOCSTR(\"Base class for loss functions for regression\"), /*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_7sklearn_12linear_model_8sgd_fast_Regression, /*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_7sklearn_12linear_model_8sgd_fast_Regression, /*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 #if PY_VERSION_HEX >= 0x02060000\n 0, /*tp_version_tag*/\n #endif\n};\nstatic struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Classification __pyx_vtable_7sklearn_12linear_model_8sgd_fast_Classification;\n\nstatic PyObject *__pyx_tp_new_7sklearn_12linear_model_8sgd_fast_Classification(PyTypeObject *t, PyObject *a, PyObject *k) {\n struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Classification *p;\n PyObject *o = __pyx_tp_new_7sklearn_12linear_model_8sgd_fast_LossFunction(t, a, k);\n if (!o) return 0;\n p = ((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Classification *)o);\n p->__pyx_base.__pyx_vtab = (struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_LossFunction*)__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Classification;\n return o;\n}\n\nstatic PyMethodDef __pyx_methods_7sklearn_12linear_model_8sgd_fast_Classification[] = {\n {__Pyx_NAMESTR(\"loss\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_14Classification_1loss, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(0)},\n {__Pyx_NAMESTR(\"dloss\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_14Classification_3dloss, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(0)},\n {0, 0, 0, 0}\n};\n\nstatic PyNumberMethods __pyx_tp_as_number_Classification = {\n 0, /*nb_add*/\n 0, /*nb_subtract*/\n 0, /*nb_multiply*/\n #if PY_MAJOR_VERSION < 3\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\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 0, /*nb_float*/\n #if PY_MAJOR_VERSION < 3\n 0, /*nb_oct*/\n #endif\n #if PY_MAJOR_VERSION < 3\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\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 #if PY_VERSION_HEX >= 0x02050000\n 0, /*nb_index*/\n #endif\n};\n\nstatic PySequenceMethods __pyx_tp_as_sequence_Classification = {\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 0, /*sq_contains*/\n 0, /*sq_inplace_concat*/\n 0, /*sq_inplace_repeat*/\n};\n\nstatic PyMappingMethods __pyx_tp_as_mapping_Classification = {\n 0, /*mp_length*/\n 0, /*mp_subscript*/\n 0, /*mp_ass_subscript*/\n};\n\nstatic PyBufferProcs __pyx_tp_as_buffer_Classification = {\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getreadbuffer*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getwritebuffer*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getsegcount*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getcharbuffer*/\n #endif\n #if PY_VERSION_HEX >= 0x02060000\n 0, /*bf_getbuffer*/\n #endif\n #if PY_VERSION_HEX >= 0x02060000\n 0, /*bf_releasebuffer*/\n #endif\n};\n\nstatic PyTypeObject __pyx_type_7sklearn_12linear_model_8sgd_fast_Classification = {\n PyVarObject_HEAD_INIT(0, 0)\n __Pyx_NAMESTR(\"sklearn.linear_model.sgd_fast.Classification\"), /*tp_name*/\n sizeof(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Classification), /*tp_basicsize*/\n 0, /*tp_itemsize*/\n __pyx_tp_dealloc_7sklearn_12linear_model_8sgd_fast_LossFunction, /*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 #else\n 0, /*reserved*/\n #endif\n 0, /*tp_repr*/\n &__pyx_tp_as_number_Classification, /*tp_as_number*/\n &__pyx_tp_as_sequence_Classification, /*tp_as_sequence*/\n &__pyx_tp_as_mapping_Classification, /*tp_as_mapping*/\n 0, /*tp_hash*/\n 0, /*tp_call*/\n 0, /*tp_str*/\n 0, /*tp_getattro*/\n 0, /*tp_setattro*/\n &__pyx_tp_as_buffer_Classification, /*tp_as_buffer*/\n Py_TPFLAGS_DEFAULT|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n __Pyx_DOCSTR(\"Base class for loss functions for classification\"), /*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_7sklearn_12linear_model_8sgd_fast_Classification, /*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_7sklearn_12linear_model_8sgd_fast_Classification, /*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 #if PY_VERSION_HEX >= 0x02060000\n 0, /*tp_version_tag*/\n #endif\n};\nstatic struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_ModifiedHuber __pyx_vtable_7sklearn_12linear_model_8sgd_fast_ModifiedHuber;\n\nstatic PyObject *__pyx_tp_new_7sklearn_12linear_model_8sgd_fast_ModifiedHuber(PyTypeObject *t, PyObject *a, PyObject *k) {\n struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_ModifiedHuber *p;\n PyObject *o = __pyx_tp_new_7sklearn_12linear_model_8sgd_fast_LossFunction(t, a, k);\n if (!o) return 0;\n p = ((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_ModifiedHuber *)o);\n p->__pyx_base.__pyx_base.__pyx_vtab = (struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_LossFunction*)__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_ModifiedHuber;\n return o;\n}\n\nstatic PyMethodDef __pyx_methods_7sklearn_12linear_model_8sgd_fast_ModifiedHuber[] = {\n {__Pyx_NAMESTR(\"loss\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_1loss, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(0)},\n {__Pyx_NAMESTR(\"dloss\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_3dloss, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(0)},\n {__Pyx_NAMESTR(\"__reduce__\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_5__reduce__, METH_NOARGS, __Pyx_DOCSTR(0)},\n {0, 0, 0, 0}\n};\n\nstatic PyNumberMethods __pyx_tp_as_number_ModifiedHuber = {\n 0, /*nb_add*/\n 0, /*nb_subtract*/\n 0, /*nb_multiply*/\n #if PY_MAJOR_VERSION < 3\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\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 0, /*nb_float*/\n #if PY_MAJOR_VERSION < 3\n 0, /*nb_oct*/\n #endif\n #if PY_MAJOR_VERSION < 3\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\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 #if PY_VERSION_HEX >= 0x02050000\n 0, /*nb_index*/\n #endif\n};\n\nstatic PySequenceMethods __pyx_tp_as_sequence_ModifiedHuber = {\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 0, /*sq_contains*/\n 0, /*sq_inplace_concat*/\n 0, /*sq_inplace_repeat*/\n};\n\nstatic PyMappingMethods __pyx_tp_as_mapping_ModifiedHuber = {\n 0, /*mp_length*/\n 0, /*mp_subscript*/\n 0, /*mp_ass_subscript*/\n};\n\nstatic PyBufferProcs __pyx_tp_as_buffer_ModifiedHuber = {\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getreadbuffer*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getwritebuffer*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getsegcount*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getcharbuffer*/\n #endif\n #if PY_VERSION_HEX >= 0x02060000\n 0, /*bf_getbuffer*/\n #endif\n #if PY_VERSION_HEX >= 0x02060000\n 0, /*bf_releasebuffer*/\n #endif\n};\n\nstatic PyTypeObject __pyx_type_7sklearn_12linear_model_8sgd_fast_ModifiedHuber = {\n PyVarObject_HEAD_INIT(0, 0)\n __Pyx_NAMESTR(\"sklearn.linear_model.sgd_fast.ModifiedHuber\"), /*tp_name*/\n sizeof(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_ModifiedHuber), /*tp_basicsize*/\n 0, /*tp_itemsize*/\n __pyx_tp_dealloc_7sklearn_12linear_model_8sgd_fast_LossFunction, /*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 #else\n 0, /*reserved*/\n #endif\n 0, /*tp_repr*/\n &__pyx_tp_as_number_ModifiedHuber, /*tp_as_number*/\n &__pyx_tp_as_sequence_ModifiedHuber, /*tp_as_sequence*/\n &__pyx_tp_as_mapping_ModifiedHuber, /*tp_as_mapping*/\n 0, /*tp_hash*/\n 0, /*tp_call*/\n 0, /*tp_str*/\n 0, /*tp_getattro*/\n 0, /*tp_setattro*/\n &__pyx_tp_as_buffer_ModifiedHuber, /*tp_as_buffer*/\n Py_TPFLAGS_DEFAULT|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n __Pyx_DOCSTR(\"Modified Huber loss for binary classification with y in {-1, 1}\\n\\n This is equivalent to quadratically smoothed SVM with gamma = 2.\\n\\n See T. Zhang 'Solving Large Scale Linear Prediction Problems Using\\n Stochastic Gradient Descent', ICML'04.\\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_7sklearn_12linear_model_8sgd_fast_ModifiedHuber, /*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_7sklearn_12linear_model_8sgd_fast_ModifiedHuber, /*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 #if PY_VERSION_HEX >= 0x02060000\n 0, /*tp_version_tag*/\n #endif\n};\nstatic struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Hinge __pyx_vtable_7sklearn_12linear_model_8sgd_fast_Hinge;\n\nstatic PyObject *__pyx_tp_new_7sklearn_12linear_model_8sgd_fast_Hinge(PyTypeObject *t, PyObject *a, PyObject *k) {\n struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Hinge *p;\n PyObject *o = __pyx_tp_new_7sklearn_12linear_model_8sgd_fast_LossFunction(t, a, k);\n if (!o) return 0;\n p = ((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Hinge *)o);\n p->__pyx_base.__pyx_base.__pyx_vtab = (struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_LossFunction*)__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Hinge;\n return o;\n}\n\nstatic PyMethodDef __pyx_methods_7sklearn_12linear_model_8sgd_fast_Hinge[] = {\n {__Pyx_NAMESTR(\"loss\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_5Hinge_3loss, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(0)},\n {__Pyx_NAMESTR(\"dloss\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_5Hinge_5dloss, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(0)},\n {__Pyx_NAMESTR(\"__reduce__\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_5Hinge_7__reduce__, METH_NOARGS, __Pyx_DOCSTR(0)},\n {0, 0, 0, 0}\n};\n\nstatic PyNumberMethods __pyx_tp_as_number_Hinge = {\n 0, /*nb_add*/\n 0, /*nb_subtract*/\n 0, /*nb_multiply*/\n #if PY_MAJOR_VERSION < 3\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\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 0, /*nb_float*/\n #if PY_MAJOR_VERSION < 3\n 0, /*nb_oct*/\n #endif\n #if PY_MAJOR_VERSION < 3\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\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 #if PY_VERSION_HEX >= 0x02050000\n 0, /*nb_index*/\n #endif\n};\n\nstatic PySequenceMethods __pyx_tp_as_sequence_Hinge = {\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 0, /*sq_contains*/\n 0, /*sq_inplace_concat*/\n 0, /*sq_inplace_repeat*/\n};\n\nstatic PyMappingMethods __pyx_tp_as_mapping_Hinge = {\n 0, /*mp_length*/\n 0, /*mp_subscript*/\n 0, /*mp_ass_subscript*/\n};\n\nstatic PyBufferProcs __pyx_tp_as_buffer_Hinge = {\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getreadbuffer*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getwritebuffer*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getsegcount*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getcharbuffer*/\n #endif\n #if PY_VERSION_HEX >= 0x02060000\n 0, /*bf_getbuffer*/\n #endif\n #if PY_VERSION_HEX >= 0x02060000\n 0, /*bf_releasebuffer*/\n #endif\n};\n\nstatic PyTypeObject __pyx_type_7sklearn_12linear_model_8sgd_fast_Hinge = {\n PyVarObject_HEAD_INIT(0, 0)\n __Pyx_NAMESTR(\"sklearn.linear_model.sgd_fast.Hinge\"), /*tp_name*/\n sizeof(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Hinge), /*tp_basicsize*/\n 0, /*tp_itemsize*/\n __pyx_tp_dealloc_7sklearn_12linear_model_8sgd_fast_LossFunction, /*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 #else\n 0, /*reserved*/\n #endif\n 0, /*tp_repr*/\n &__pyx_tp_as_number_Hinge, /*tp_as_number*/\n &__pyx_tp_as_sequence_Hinge, /*tp_as_sequence*/\n &__pyx_tp_as_mapping_Hinge, /*tp_as_mapping*/\n 0, /*tp_hash*/\n 0, /*tp_call*/\n 0, /*tp_str*/\n 0, /*tp_getattro*/\n 0, /*tp_setattro*/\n &__pyx_tp_as_buffer_Hinge, /*tp_as_buffer*/\n Py_TPFLAGS_DEFAULT|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n __Pyx_DOCSTR(\"Hinge loss for binary classification tasks with y in {-1,1}\\n\\n Parameters\\n ----------\\n\\n threshold : float > 0.0\\n Margin threshold. When threshold=1.0, one gets the loss used by SVM.\\n When threshold=0.0, one gets the loss used by the Perceptron.\\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_7sklearn_12linear_model_8sgd_fast_Hinge, /*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_7sklearn_12linear_model_8sgd_fast_5Hinge_1__init__, /*tp_init*/\n 0, /*tp_alloc*/\n __pyx_tp_new_7sklearn_12linear_model_8sgd_fast_Hinge, /*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 #if PY_VERSION_HEX >= 0x02060000\n 0, /*tp_version_tag*/\n #endif\n};\nstatic struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_SquaredHinge __pyx_vtable_7sklearn_12linear_model_8sgd_fast_SquaredHinge;\n\nstatic PyObject *__pyx_tp_new_7sklearn_12linear_model_8sgd_fast_SquaredHinge(PyTypeObject *t, PyObject *a, PyObject *k) {\n struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredHinge *p;\n PyObject *o = __pyx_tp_new_7sklearn_12linear_model_8sgd_fast_LossFunction(t, a, k);\n if (!o) return 0;\n p = ((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredHinge *)o);\n p->__pyx_base.__pyx_vtab = (struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_LossFunction*)__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_SquaredHinge;\n return o;\n}\n\nstatic PyMethodDef __pyx_methods_7sklearn_12linear_model_8sgd_fast_SquaredHinge[] = {\n {__Pyx_NAMESTR(\"loss\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_3loss, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(0)},\n {__Pyx_NAMESTR(\"dloss\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_5dloss, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(0)},\n {__Pyx_NAMESTR(\"__reduce__\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_7__reduce__, METH_NOARGS, __Pyx_DOCSTR(0)},\n {0, 0, 0, 0}\n};\n\nstatic PyNumberMethods __pyx_tp_as_number_SquaredHinge = {\n 0, /*nb_add*/\n 0, /*nb_subtract*/\n 0, /*nb_multiply*/\n #if PY_MAJOR_VERSION < 3\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\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 0, /*nb_float*/\n #if PY_MAJOR_VERSION < 3\n 0, /*nb_oct*/\n #endif\n #if PY_MAJOR_VERSION < 3\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\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 #if PY_VERSION_HEX >= 0x02050000\n 0, /*nb_index*/\n #endif\n};\n\nstatic PySequenceMethods __pyx_tp_as_sequence_SquaredHinge = {\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 0, /*sq_contains*/\n 0, /*sq_inplace_concat*/\n 0, /*sq_inplace_repeat*/\n};\n\nstatic PyMappingMethods __pyx_tp_as_mapping_SquaredHinge = {\n 0, /*mp_length*/\n 0, /*mp_subscript*/\n 0, /*mp_ass_subscript*/\n};\n\nstatic PyBufferProcs __pyx_tp_as_buffer_SquaredHinge = {\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getreadbuffer*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getwritebuffer*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getsegcount*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getcharbuffer*/\n #endif\n #if PY_VERSION_HEX >= 0x02060000\n 0, /*bf_getbuffer*/\n #endif\n #if PY_VERSION_HEX >= 0x02060000\n 0, /*bf_releasebuffer*/\n #endif\n};\n\nstatic PyTypeObject __pyx_type_7sklearn_12linear_model_8sgd_fast_SquaredHinge = {\n PyVarObject_HEAD_INIT(0, 0)\n __Pyx_NAMESTR(\"sklearn.linear_model.sgd_fast.SquaredHinge\"), /*tp_name*/\n sizeof(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredHinge), /*tp_basicsize*/\n 0, /*tp_itemsize*/\n __pyx_tp_dealloc_7sklearn_12linear_model_8sgd_fast_LossFunction, /*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 #else\n 0, /*reserved*/\n #endif\n 0, /*tp_repr*/\n &__pyx_tp_as_number_SquaredHinge, /*tp_as_number*/\n &__pyx_tp_as_sequence_SquaredHinge, /*tp_as_sequence*/\n &__pyx_tp_as_mapping_SquaredHinge, /*tp_as_mapping*/\n 0, /*tp_hash*/\n 0, /*tp_call*/\n 0, /*tp_str*/\n 0, /*tp_getattro*/\n 0, /*tp_setattro*/\n &__pyx_tp_as_buffer_SquaredHinge, /*tp_as_buffer*/\n Py_TPFLAGS_DEFAULT|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n __Pyx_DOCSTR(\"Squared Hinge loss for binary classification tasks with y in {-1,1}\\n\\n Parameters\\n ----------\\n\\n threshold : float > 0.0\\n Margin threshold. When threshold=1.0, one gets the loss used by\\n (quadratically penalized) SVM.\\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_7sklearn_12linear_model_8sgd_fast_SquaredHinge, /*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_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_1__init__, /*tp_init*/\n 0, /*tp_alloc*/\n __pyx_tp_new_7sklearn_12linear_model_8sgd_fast_SquaredHinge, /*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 #if PY_VERSION_HEX >= 0x02060000\n 0, /*tp_version_tag*/\n #endif\n};\nstatic struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Log __pyx_vtable_7sklearn_12linear_model_8sgd_fast_Log;\n\nstatic PyObject *__pyx_tp_new_7sklearn_12linear_model_8sgd_fast_Log(PyTypeObject *t, PyObject *a, PyObject *k) {\n struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Log *p;\n PyObject *o = __pyx_tp_new_7sklearn_12linear_model_8sgd_fast_LossFunction(t, a, k);\n if (!o) return 0;\n p = ((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Log *)o);\n p->__pyx_base.__pyx_base.__pyx_vtab = (struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_LossFunction*)__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Log;\n return o;\n}\n\nstatic PyMethodDef __pyx_methods_7sklearn_12linear_model_8sgd_fast_Log[] = {\n {__Pyx_NAMESTR(\"loss\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_3Log_1loss, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(0)},\n {__Pyx_NAMESTR(\"dloss\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_3Log_3dloss, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(0)},\n {__Pyx_NAMESTR(\"__reduce__\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_3Log_5__reduce__, METH_NOARGS, __Pyx_DOCSTR(0)},\n {0, 0, 0, 0}\n};\n\nstatic PyNumberMethods __pyx_tp_as_number_Log = {\n 0, /*nb_add*/\n 0, /*nb_subtract*/\n 0, /*nb_multiply*/\n #if PY_MAJOR_VERSION < 3\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\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 0, /*nb_float*/\n #if PY_MAJOR_VERSION < 3\n 0, /*nb_oct*/\n #endif\n #if PY_MAJOR_VERSION < 3\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\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 #if PY_VERSION_HEX >= 0x02050000\n 0, /*nb_index*/\n #endif\n};\n\nstatic PySequenceMethods __pyx_tp_as_sequence_Log = {\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 0, /*sq_contains*/\n 0, /*sq_inplace_concat*/\n 0, /*sq_inplace_repeat*/\n};\n\nstatic PyMappingMethods __pyx_tp_as_mapping_Log = {\n 0, /*mp_length*/\n 0, /*mp_subscript*/\n 0, /*mp_ass_subscript*/\n};\n\nstatic PyBufferProcs __pyx_tp_as_buffer_Log = {\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getreadbuffer*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getwritebuffer*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getsegcount*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getcharbuffer*/\n #endif\n #if PY_VERSION_HEX >= 0x02060000\n 0, /*bf_getbuffer*/\n #endif\n #if PY_VERSION_HEX >= 0x02060000\n 0, /*bf_releasebuffer*/\n #endif\n};\n\nstatic PyTypeObject __pyx_type_7sklearn_12linear_model_8sgd_fast_Log = {\n PyVarObject_HEAD_INIT(0, 0)\n __Pyx_NAMESTR(\"sklearn.linear_model.sgd_fast.Log\"), /*tp_name*/\n sizeof(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Log), /*tp_basicsize*/\n 0, /*tp_itemsize*/\n __pyx_tp_dealloc_7sklearn_12linear_model_8sgd_fast_LossFunction, /*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 #else\n 0, /*reserved*/\n #endif\n 0, /*tp_repr*/\n &__pyx_tp_as_number_Log, /*tp_as_number*/\n &__pyx_tp_as_sequence_Log, /*tp_as_sequence*/\n &__pyx_tp_as_mapping_Log, /*tp_as_mapping*/\n 0, /*tp_hash*/\n 0, /*tp_call*/\n 0, /*tp_str*/\n 0, /*tp_getattro*/\n 0, /*tp_setattro*/\n &__pyx_tp_as_buffer_Log, /*tp_as_buffer*/\n Py_TPFLAGS_DEFAULT|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n __Pyx_DOCSTR(\"Logistic regression loss for binary classification with y in {-1, 1}\"), /*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_7sklearn_12linear_model_8sgd_fast_Log, /*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_7sklearn_12linear_model_8sgd_fast_Log, /*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 #if PY_VERSION_HEX >= 0x02060000\n 0, /*tp_version_tag*/\n #endif\n};\nstatic struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_SquaredLoss __pyx_vtable_7sklearn_12linear_model_8sgd_fast_SquaredLoss;\n\nstatic PyObject *__pyx_tp_new_7sklearn_12linear_model_8sgd_fast_SquaredLoss(PyTypeObject *t, PyObject *a, PyObject *k) {\n struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredLoss *p;\n PyObject *o = __pyx_tp_new_7sklearn_12linear_model_8sgd_fast_LossFunction(t, a, k);\n if (!o) return 0;\n p = ((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredLoss *)o);\n p->__pyx_base.__pyx_base.__pyx_vtab = (struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_LossFunction*)__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_SquaredLoss;\n return o;\n}\n\nstatic PyMethodDef __pyx_methods_7sklearn_12linear_model_8sgd_fast_SquaredLoss[] = {\n {__Pyx_NAMESTR(\"loss\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_1loss, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(0)},\n {__Pyx_NAMESTR(\"dloss\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_3dloss, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(0)},\n {__Pyx_NAMESTR(\"__reduce__\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_5__reduce__, METH_NOARGS, __Pyx_DOCSTR(0)},\n {0, 0, 0, 0}\n};\n\nstatic PyNumberMethods __pyx_tp_as_number_SquaredLoss = {\n 0, /*nb_add*/\n 0, /*nb_subtract*/\n 0, /*nb_multiply*/\n #if PY_MAJOR_VERSION < 3\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\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 0, /*nb_float*/\n #if PY_MAJOR_VERSION < 3\n 0, /*nb_oct*/\n #endif\n #if PY_MAJOR_VERSION < 3\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\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 #if PY_VERSION_HEX >= 0x02050000\n 0, /*nb_index*/\n #endif\n};\n\nstatic PySequenceMethods __pyx_tp_as_sequence_SquaredLoss = {\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 0, /*sq_contains*/\n 0, /*sq_inplace_concat*/\n 0, /*sq_inplace_repeat*/\n};\n\nstatic PyMappingMethods __pyx_tp_as_mapping_SquaredLoss = {\n 0, /*mp_length*/\n 0, /*mp_subscript*/\n 0, /*mp_ass_subscript*/\n};\n\nstatic PyBufferProcs __pyx_tp_as_buffer_SquaredLoss = {\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getreadbuffer*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getwritebuffer*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getsegcount*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getcharbuffer*/\n #endif\n #if PY_VERSION_HEX >= 0x02060000\n 0, /*bf_getbuffer*/\n #endif\n #if PY_VERSION_HEX >= 0x02060000\n 0, /*bf_releasebuffer*/\n #endif\n};\n\nstatic PyTypeObject __pyx_type_7sklearn_12linear_model_8sgd_fast_SquaredLoss = {\n PyVarObject_HEAD_INIT(0, 0)\n __Pyx_NAMESTR(\"sklearn.linear_model.sgd_fast.SquaredLoss\"), /*tp_name*/\n sizeof(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredLoss), /*tp_basicsize*/\n 0, /*tp_itemsize*/\n __pyx_tp_dealloc_7sklearn_12linear_model_8sgd_fast_LossFunction, /*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 #else\n 0, /*reserved*/\n #endif\n 0, /*tp_repr*/\n &__pyx_tp_as_number_SquaredLoss, /*tp_as_number*/\n &__pyx_tp_as_sequence_SquaredLoss, /*tp_as_sequence*/\n &__pyx_tp_as_mapping_SquaredLoss, /*tp_as_mapping*/\n 0, /*tp_hash*/\n 0, /*tp_call*/\n 0, /*tp_str*/\n 0, /*tp_getattro*/\n 0, /*tp_setattro*/\n &__pyx_tp_as_buffer_SquaredLoss, /*tp_as_buffer*/\n Py_TPFLAGS_DEFAULT|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n __Pyx_DOCSTR(\"Squared loss traditional used in linear regression.\"), /*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_7sklearn_12linear_model_8sgd_fast_SquaredLoss, /*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_7sklearn_12linear_model_8sgd_fast_SquaredLoss, /*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 #if PY_VERSION_HEX >= 0x02060000\n 0, /*tp_version_tag*/\n #endif\n};\nstatic struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_Huber __pyx_vtable_7sklearn_12linear_model_8sgd_fast_Huber;\n\nstatic PyObject *__pyx_tp_new_7sklearn_12linear_model_8sgd_fast_Huber(PyTypeObject *t, PyObject *a, PyObject *k) {\n struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Huber *p;\n PyObject *o = __pyx_tp_new_7sklearn_12linear_model_8sgd_fast_LossFunction(t, a, k);\n if (!o) return 0;\n p = ((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Huber *)o);\n p->__pyx_base.__pyx_base.__pyx_vtab = (struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_LossFunction*)__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Huber;\n return o;\n}\n\nstatic PyMethodDef __pyx_methods_7sklearn_12linear_model_8sgd_fast_Huber[] = {\n {__Pyx_NAMESTR(\"loss\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_5Huber_3loss, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(0)},\n {__Pyx_NAMESTR(\"dloss\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_5Huber_5dloss, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(0)},\n {__Pyx_NAMESTR(\"__reduce__\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_5Huber_7__reduce__, METH_NOARGS, __Pyx_DOCSTR(0)},\n {0, 0, 0, 0}\n};\n\nstatic PyNumberMethods __pyx_tp_as_number_Huber = {\n 0, /*nb_add*/\n 0, /*nb_subtract*/\n 0, /*nb_multiply*/\n #if PY_MAJOR_VERSION < 3\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\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 0, /*nb_float*/\n #if PY_MAJOR_VERSION < 3\n 0, /*nb_oct*/\n #endif\n #if PY_MAJOR_VERSION < 3\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\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 #if PY_VERSION_HEX >= 0x02050000\n 0, /*nb_index*/\n #endif\n};\n\nstatic PySequenceMethods __pyx_tp_as_sequence_Huber = {\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 0, /*sq_contains*/\n 0, /*sq_inplace_concat*/\n 0, /*sq_inplace_repeat*/\n};\n\nstatic PyMappingMethods __pyx_tp_as_mapping_Huber = {\n 0, /*mp_length*/\n 0, /*mp_subscript*/\n 0, /*mp_ass_subscript*/\n};\n\nstatic PyBufferProcs __pyx_tp_as_buffer_Huber = {\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getreadbuffer*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getwritebuffer*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getsegcount*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getcharbuffer*/\n #endif\n #if PY_VERSION_HEX >= 0x02060000\n 0, /*bf_getbuffer*/\n #endif\n #if PY_VERSION_HEX >= 0x02060000\n 0, /*bf_releasebuffer*/\n #endif\n};\n\nstatic PyTypeObject __pyx_type_7sklearn_12linear_model_8sgd_fast_Huber = {\n PyVarObject_HEAD_INIT(0, 0)\n __Pyx_NAMESTR(\"sklearn.linear_model.sgd_fast.Huber\"), /*tp_name*/\n sizeof(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_Huber), /*tp_basicsize*/\n 0, /*tp_itemsize*/\n __pyx_tp_dealloc_7sklearn_12linear_model_8sgd_fast_LossFunction, /*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 #else\n 0, /*reserved*/\n #endif\n 0, /*tp_repr*/\n &__pyx_tp_as_number_Huber, /*tp_as_number*/\n &__pyx_tp_as_sequence_Huber, /*tp_as_sequence*/\n &__pyx_tp_as_mapping_Huber, /*tp_as_mapping*/\n 0, /*tp_hash*/\n 0, /*tp_call*/\n 0, /*tp_str*/\n 0, /*tp_getattro*/\n 0, /*tp_setattro*/\n &__pyx_tp_as_buffer_Huber, /*tp_as_buffer*/\n Py_TPFLAGS_DEFAULT|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n __Pyx_DOCSTR(\"Huber regression loss\\n\\n Variant of the SquaredLoss that is robust to outliers (quadratic near zero,\\n linear in for large errors).\\n\\n http://en.wikipedia.org/wiki/Huber_Loss_Function\\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_7sklearn_12linear_model_8sgd_fast_Huber, /*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_7sklearn_12linear_model_8sgd_fast_5Huber_1__init__, /*tp_init*/\n 0, /*tp_alloc*/\n __pyx_tp_new_7sklearn_12linear_model_8sgd_fast_Huber, /*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 #if PY_VERSION_HEX >= 0x02060000\n 0, /*tp_version_tag*/\n #endif\n};\nstatic struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive __pyx_vtable_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive;\n\nstatic PyObject *__pyx_tp_new_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive(PyTypeObject *t, PyObject *a, PyObject *k) {\n struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive *p;\n PyObject *o = __pyx_tp_new_7sklearn_12linear_model_8sgd_fast_LossFunction(t, a, k);\n if (!o) return 0;\n p = ((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive *)o);\n p->__pyx_base.__pyx_base.__pyx_vtab = (struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_LossFunction*)__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive;\n return o;\n}\n\nstatic PyMethodDef __pyx_methods_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive[] = {\n {__Pyx_NAMESTR(\"loss\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_3loss, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(0)},\n {__Pyx_NAMESTR(\"dloss\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_5dloss, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(0)},\n {__Pyx_NAMESTR(\"__reduce__\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_7__reduce__, METH_NOARGS, __Pyx_DOCSTR(0)},\n {0, 0, 0, 0}\n};\n\nstatic PyNumberMethods __pyx_tp_as_number_EpsilonInsensitive = {\n 0, /*nb_add*/\n 0, /*nb_subtract*/\n 0, /*nb_multiply*/\n #if PY_MAJOR_VERSION < 3\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\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 0, /*nb_float*/\n #if PY_MAJOR_VERSION < 3\n 0, /*nb_oct*/\n #endif\n #if PY_MAJOR_VERSION < 3\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\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 #if PY_VERSION_HEX >= 0x02050000\n 0, /*nb_index*/\n #endif\n};\n\nstatic PySequenceMethods __pyx_tp_as_sequence_EpsilonInsensitive = {\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 0, /*sq_contains*/\n 0, /*sq_inplace_concat*/\n 0, /*sq_inplace_repeat*/\n};\n\nstatic PyMappingMethods __pyx_tp_as_mapping_EpsilonInsensitive = {\n 0, /*mp_length*/\n 0, /*mp_subscript*/\n 0, /*mp_ass_subscript*/\n};\n\nstatic PyBufferProcs __pyx_tp_as_buffer_EpsilonInsensitive = {\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getreadbuffer*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getwritebuffer*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getsegcount*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getcharbuffer*/\n #endif\n #if PY_VERSION_HEX >= 0x02060000\n 0, /*bf_getbuffer*/\n #endif\n #if PY_VERSION_HEX >= 0x02060000\n 0, /*bf_releasebuffer*/\n #endif\n};\n\nstatic PyTypeObject __pyx_type_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive = {\n PyVarObject_HEAD_INIT(0, 0)\n __Pyx_NAMESTR(\"sklearn.linear_model.sgd_fast.EpsilonInsensitive\"), /*tp_name*/\n sizeof(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive), /*tp_basicsize*/\n 0, /*tp_itemsize*/\n __pyx_tp_dealloc_7sklearn_12linear_model_8sgd_fast_LossFunction, /*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 #else\n 0, /*reserved*/\n #endif\n 0, /*tp_repr*/\n &__pyx_tp_as_number_EpsilonInsensitive, /*tp_as_number*/\n &__pyx_tp_as_sequence_EpsilonInsensitive, /*tp_as_sequence*/\n &__pyx_tp_as_mapping_EpsilonInsensitive, /*tp_as_mapping*/\n 0, /*tp_hash*/\n 0, /*tp_call*/\n 0, /*tp_str*/\n 0, /*tp_getattro*/\n 0, /*tp_setattro*/\n &__pyx_tp_as_buffer_EpsilonInsensitive, /*tp_as_buffer*/\n Py_TPFLAGS_DEFAULT|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n __Pyx_DOCSTR(\"Epsilon-Insensitive loss (used by SVR).\\n\\n loss = max(0, |y - p| - epsilon)\\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_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive, /*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_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_1__init__, /*tp_init*/\n 0, /*tp_alloc*/\n __pyx_tp_new_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive, /*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 #if PY_VERSION_HEX >= 0x02060000\n 0, /*tp_version_tag*/\n #endif\n};\nstatic struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive __pyx_vtable_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive;\n\nstatic PyObject *__pyx_tp_new_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive(PyTypeObject *t, PyObject *a, PyObject *k) {\n struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive *p;\n PyObject *o = __pyx_tp_new_7sklearn_12linear_model_8sgd_fast_LossFunction(t, a, k);\n if (!o) return 0;\n p = ((struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive *)o);\n p->__pyx_base.__pyx_base.__pyx_vtab = (struct __pyx_vtabstruct_7sklearn_12linear_model_8sgd_fast_LossFunction*)__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive;\n return o;\n}\n\nstatic PyMethodDef __pyx_methods_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive[] = {\n {__Pyx_NAMESTR(\"loss\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_3loss, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(0)},\n {__Pyx_NAMESTR(\"dloss\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_5dloss, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(0)},\n {__Pyx_NAMESTR(\"__reduce__\"), (PyCFunction)__pyx_pw_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_7__reduce__, METH_NOARGS, __Pyx_DOCSTR(0)},\n {0, 0, 0, 0}\n};\n\nstatic PyNumberMethods __pyx_tp_as_number_SquaredEpsilonInsensitive = {\n 0, /*nb_add*/\n 0, /*nb_subtract*/\n 0, /*nb_multiply*/\n #if PY_MAJOR_VERSION < 3\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\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 0, /*nb_float*/\n #if PY_MAJOR_VERSION < 3\n 0, /*nb_oct*/\n #endif\n #if PY_MAJOR_VERSION < 3\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\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 #if PY_VERSION_HEX >= 0x02050000\n 0, /*nb_index*/\n #endif\n};\n\nstatic PySequenceMethods __pyx_tp_as_sequence_SquaredEpsilonInsensitive = {\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 0, /*sq_contains*/\n 0, /*sq_inplace_concat*/\n 0, /*sq_inplace_repeat*/\n};\n\nstatic PyMappingMethods __pyx_tp_as_mapping_SquaredEpsilonInsensitive = {\n 0, /*mp_length*/\n 0, /*mp_subscript*/\n 0, /*mp_ass_subscript*/\n};\n\nstatic PyBufferProcs __pyx_tp_as_buffer_SquaredEpsilonInsensitive = {\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getreadbuffer*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getwritebuffer*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getsegcount*/\n #endif\n #if PY_MAJOR_VERSION < 3\n 0, /*bf_getcharbuffer*/\n #endif\n #if PY_VERSION_HEX >= 0x02060000\n 0, /*bf_getbuffer*/\n #endif\n #if PY_VERSION_HEX >= 0x02060000\n 0, /*bf_releasebuffer*/\n #endif\n};\n\nstatic PyTypeObject __pyx_type_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive = {\n PyVarObject_HEAD_INIT(0, 0)\n __Pyx_NAMESTR(\"sklearn.linear_model.sgd_fast.SquaredEpsilonInsensitive\"), /*tp_name*/\n sizeof(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive), /*tp_basicsize*/\n 0, /*tp_itemsize*/\n __pyx_tp_dealloc_7sklearn_12linear_model_8sgd_fast_LossFunction, /*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 #else\n 0, /*reserved*/\n #endif\n 0, /*tp_repr*/\n &__pyx_tp_as_number_SquaredEpsilonInsensitive, /*tp_as_number*/\n &__pyx_tp_as_sequence_SquaredEpsilonInsensitive, /*tp_as_sequence*/\n &__pyx_tp_as_mapping_SquaredEpsilonInsensitive, /*tp_as_mapping*/\n 0, /*tp_hash*/\n 0, /*tp_call*/\n 0, /*tp_str*/\n 0, /*tp_getattro*/\n 0, /*tp_setattro*/\n &__pyx_tp_as_buffer_SquaredEpsilonInsensitive, /*tp_as_buffer*/\n Py_TPFLAGS_DEFAULT|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/\n __Pyx_DOCSTR(\"Epsilon-Insensitive loss.\\n\\n loss = max(0, |y - p| - epsilon)^2\\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_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive, /*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_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_1__init__, /*tp_init*/\n 0, /*tp_alloc*/\n __pyx_tp_new_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive, /*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 #if PY_VERSION_HEX >= 0x02060000\n 0, /*tp_version_tag*/\n #endif\n};\n\nstatic PyMethodDef __pyx_methods[] = {\n {0, 0, 0, 0}\n};\n\n#if PY_MAJOR_VERSION >= 3\nstatic struct PyModuleDef __pyx_moduledef = {\n PyModuleDef_HEAD_INIT,\n __Pyx_NAMESTR(\"sgd_fast\"),\n 0, /* m_doc */\n -1, /* m_size */\n __pyx_methods /* m_methods */,\n NULL, /* m_reload */\n NULL, /* m_traverse */\n NULL, /* m_clear */\n NULL /* m_free */\n};\n#endif\n\nstatic __Pyx_StringTabEntry __pyx_string_tab[] = {\n {&__pyx_kp_s_1, __pyx_k_1, sizeof(__pyx_k_1), 0, 0, 1, 0},\n {&__pyx_kp_u_10, __pyx_k_10, sizeof(__pyx_k_10), 0, 1, 0, 0},\n {&__pyx_kp_u_12, __pyx_k_12, sizeof(__pyx_k_12), 0, 1, 0, 0},\n {&__pyx_kp_u_13, __pyx_k_13, sizeof(__pyx_k_13), 0, 1, 0, 0},\n {&__pyx_kp_u_16, __pyx_k_16, sizeof(__pyx_k_16), 0, 1, 0, 0},\n {&__pyx_kp_s_2, __pyx_k_2, sizeof(__pyx_k_2), 0, 0, 1, 0},\n {&__pyx_kp_s_20, __pyx_k_20, sizeof(__pyx_k_20), 0, 0, 1, 0},\n {&__pyx_n_s_21, __pyx_k_21, sizeof(__pyx_k_21), 0, 0, 1, 1},\n {&__pyx_kp_s_3, __pyx_k_3, sizeof(__pyx_k_3), 0, 0, 1, 0},\n {&__pyx_kp_s_4, __pyx_k_4, sizeof(__pyx_k_4), 0, 0, 1, 0},\n {&__pyx_kp_u_6, __pyx_k_6, sizeof(__pyx_k_6), 0, 1, 0, 0},\n {&__pyx_kp_u_8, __pyx_k_8, sizeof(__pyx_k_8), 0, 1, 0, 0},\n {&__pyx_n_s__C, __pyx_k__C, sizeof(__pyx_k__C), 0, 0, 1, 1},\n {&__pyx_n_s__NotImplementedError, __pyx_k__NotImplementedError, sizeof(__pyx_k__NotImplementedError), 0, 0, 1, 1},\n {&__pyx_n_s__RuntimeError, __pyx_k__RuntimeError, sizeof(__pyx_k__RuntimeError), 0, 0, 1, 1},\n {&__pyx_n_s__ValueError, __pyx_k__ValueError, sizeof(__pyx_k__ValueError), 0, 0, 1, 1},\n {&__pyx_n_s____main__, __pyx_k____main__, sizeof(__pyx_k____main__), 0, 0, 1, 1},\n {&__pyx_n_s____test__, __pyx_k____test__, sizeof(__pyx_k____test__), 0, 0, 1, 1},\n {&__pyx_n_s__alpha, __pyx_k__alpha, sizeof(__pyx_k__alpha), 0, 0, 1, 1},\n {&__pyx_n_s__any, __pyx_k__any, sizeof(__pyx_k__any), 0, 0, 1, 1},\n {&__pyx_n_s__c, __pyx_k__c, sizeof(__pyx_k__c), 0, 0, 1, 1},\n {&__pyx_n_s__class_weight, __pyx_k__class_weight, sizeof(__pyx_k__class_weight), 0, 0, 1, 1},\n {&__pyx_n_s__count, __pyx_k__count, sizeof(__pyx_k__count), 0, 0, 1, 1},\n {&__pyx_n_s__dataset, __pyx_k__dataset, sizeof(__pyx_k__dataset), 0, 0, 1, 1},\n {&__pyx_n_s__dloss, __pyx_k__dloss, sizeof(__pyx_k__dloss), 0, 0, 1, 1},\n {&__pyx_n_s__dtype, __pyx_k__dtype, sizeof(__pyx_k__dtype), 0, 0, 1, 1},\n {&__pyx_n_s__epoch, __pyx_k__epoch, sizeof(__pyx_k__epoch), 0, 0, 1, 1},\n {&__pyx_n_s__epsilon, __pyx_k__epsilon, sizeof(__pyx_k__epsilon), 0, 0, 1, 1},\n {&__pyx_n_s__eta, __pyx_k__eta, sizeof(__pyx_k__eta), 0, 0, 1, 1},\n {&__pyx_n_s__eta0, __pyx_k__eta0, sizeof(__pyx_k__eta0), 0, 0, 1, 1},\n {&__pyx_n_s__fit_intercept, __pyx_k__fit_intercept, sizeof(__pyx_k__fit_intercept), 0, 0, 1, 1},\n {&__pyx_n_s__float64, __pyx_k__float64, sizeof(__pyx_k__float64), 0, 0, 1, 1},\n {&__pyx_n_s__i, __pyx_k__i, sizeof(__pyx_k__i), 0, 0, 1, 1},\n {&__pyx_n_s__intercept, __pyx_k__intercept, sizeof(__pyx_k__intercept), 0, 0, 1, 1},\n {&__pyx_n_s__intercept_decay, __pyx_k__intercept_decay, sizeof(__pyx_k__intercept_decay), 0, 0, 1, 1},\n {&__pyx_n_s__is_hinge, __pyx_k__is_hinge, sizeof(__pyx_k__is_hinge), 0, 0, 1, 1},\n {&__pyx_n_s__isinf, __pyx_k__isinf, sizeof(__pyx_k__isinf), 0, 0, 1, 1},\n {&__pyx_n_s__isnan, __pyx_k__isnan, sizeof(__pyx_k__isnan), 0, 0, 1, 1},\n {&__pyx_n_s__learning_rate, __pyx_k__learning_rate, sizeof(__pyx_k__learning_rate), 0, 0, 1, 1},\n {&__pyx_n_s__loss, __pyx_k__loss, sizeof(__pyx_k__loss), 0, 0, 1, 1},\n {&__pyx_n_s__n_features, __pyx_k__n_features, sizeof(__pyx_k__n_features), 0, 0, 1, 1},\n {&__pyx_n_s__n_iter, __pyx_k__n_iter, sizeof(__pyx_k__n_iter), 0, 0, 1, 1},\n {&__pyx_n_s__n_samples, __pyx_k__n_samples, sizeof(__pyx_k__n_samples), 0, 0, 1, 1},\n {&__pyx_n_s__nonzero, __pyx_k__nonzero, sizeof(__pyx_k__nonzero), 0, 0, 1, 1},\n {&__pyx_n_s__np, __pyx_k__np, sizeof(__pyx_k__np), 0, 0, 1, 1},\n {&__pyx_n_s__numpy, __pyx_k__numpy, sizeof(__pyx_k__numpy), 0, 0, 1, 1},\n {&__pyx_n_s__order, __pyx_k__order, sizeof(__pyx_k__order), 0, 0, 1, 1},\n {&__pyx_n_s__p, __pyx_k__p, sizeof(__pyx_k__p), 0, 0, 1, 1},\n {&__pyx_n_s__penalty_type, __pyx_k__penalty_type, sizeof(__pyx_k__penalty_type), 0, 0, 1, 1},\n {&__pyx_n_s__plain_sgd, __pyx_k__plain_sgd, sizeof(__pyx_k__plain_sgd), 0, 0, 1, 1},\n {&__pyx_n_s__power_t, __pyx_k__power_t, sizeof(__pyx_k__power_t), 0, 0, 1, 1},\n {&__pyx_n_s__q, __pyx_k__q, sizeof(__pyx_k__q), 0, 0, 1, 1},\n {&__pyx_n_s__q_data_ptr, __pyx_k__q_data_ptr, sizeof(__pyx_k__q_data_ptr), 0, 0, 1, 1},\n {&__pyx_n_s__range, __pyx_k__range, sizeof(__pyx_k__range), 0, 0, 1, 1},\n {&__pyx_n_s__rho, __pyx_k__rho, sizeof(__pyx_k__rho), 0, 0, 1, 1},\n {&__pyx_n_s__sample_weight, __pyx_k__sample_weight, sizeof(__pyx_k__sample_weight), 0, 0, 1, 1},\n {&__pyx_n_s__seed, __pyx_k__seed, sizeof(__pyx_k__seed), 0, 0, 1, 1},\n {&__pyx_n_s__shape, __pyx_k__shape, sizeof(__pyx_k__shape), 0, 0, 1, 1},\n {&__pyx_n_s__shuffle, __pyx_k__shuffle, sizeof(__pyx_k__shuffle), 0, 0, 1, 1},\n {&__pyx_n_s__sumloss, __pyx_k__sumloss, sizeof(__pyx_k__sumloss), 0, 0, 1, 1},\n {&__pyx_n_s__sys, __pyx_k__sys, sizeof(__pyx_k__sys), 0, 0, 1, 1},\n {&__pyx_n_s__t, __pyx_k__t, sizeof(__pyx_k__t), 0, 0, 1, 1},\n {&__pyx_n_s__t_start, __pyx_k__t_start, sizeof(__pyx_k__t_start), 0, 0, 1, 1},\n {&__pyx_n_s__threshold, __pyx_k__threshold, sizeof(__pyx_k__threshold), 0, 0, 1, 1},\n {&__pyx_n_s__time, __pyx_k__time, sizeof(__pyx_k__time), 0, 0, 1, 1},\n {&__pyx_n_s__u, __pyx_k__u, sizeof(__pyx_k__u), 0, 0, 1, 1},\n {&__pyx_n_s__update, __pyx_k__update, sizeof(__pyx_k__update), 0, 0, 1, 1},\n {&__pyx_n_s__verbose, __pyx_k__verbose, sizeof(__pyx_k__verbose), 0, 0, 1, 1},\n {&__pyx_n_s__w, __pyx_k__w, sizeof(__pyx_k__w), 0, 0, 1, 1},\n {&__pyx_n_s__weight_neg, __pyx_k__weight_neg, sizeof(__pyx_k__weight_neg), 0, 0, 1, 1},\n {&__pyx_n_s__weight_pos, __pyx_k__weight_pos, sizeof(__pyx_k__weight_pos), 0, 0, 1, 1},\n {&__pyx_n_s__weights, __pyx_k__weights, sizeof(__pyx_k__weights), 0, 0, 1, 1},\n {&__pyx_n_s__x_data_ptr, __pyx_k__x_data_ptr, sizeof(__pyx_k__x_data_ptr), 0, 0, 1, 1},\n {&__pyx_n_s__x_ind_ptr, __pyx_k__x_ind_ptr, sizeof(__pyx_k__x_ind_ptr), 0, 0, 1, 1},\n {&__pyx_n_s__xnnz, __pyx_k__xnnz, sizeof(__pyx_k__xnnz), 0, 0, 1, 1},\n {&__pyx_n_s__y, __pyx_k__y, sizeof(__pyx_k__y), 0, 0, 1, 1},\n {&__pyx_n_s__zeros, __pyx_k__zeros, sizeof(__pyx_k__zeros), 0, 0, 1, 1},\n {0, 0, 0, 0, 0, 0, 0}\n};\nstatic int __Pyx_InitCachedBuiltins(void) {\n __pyx_builtin_NotImplementedError = __Pyx_GetName(__pyx_b, __pyx_n_s__NotImplementedError); if (!__pyx_builtin_NotImplementedError) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 64; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_builtin_range = __Pyx_GetName(__pyx_b, __pyx_n_s__range); if (!__pyx_builtin_range) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 438; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_builtin_ValueError = __Pyx_GetName(__pyx_b, __pyx_n_s__ValueError); if (!__pyx_builtin_ValueError) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 508; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_builtin_RuntimeError = __Pyx_GetName(__pyx_b, __pyx_n_s__RuntimeError); if (!__pyx_builtin_RuntimeError) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 799; __pyx_clineno = __LINE__; goto __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 /* \"sklearn/linear_model/sgd_fast.pyx\":508\n * if np.any(np.isinf(weights)) or np.any(np.isnan(weights)) \\\n * or np.isnan(intercept) or np.isinf(intercept):\n * raise ValueError(\"floating-point under-/overflow occured.\") # <<<<<<<<<<<<<<\n * \n * w.reset_wscale()\n */\n __pyx_k_tuple_5 = PyTuple_New(1); if (unlikely(!__pyx_k_tuple_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 508; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_k_tuple_5);\n __Pyx_INCREF(((PyObject *)__pyx_kp_s_4));\n PyTuple_SET_ITEM(__pyx_k_tuple_5, 0, ((PyObject *)__pyx_kp_s_4));\n __Pyx_GIVEREF(((PyObject *)__pyx_kp_s_4));\n __Pyx_GIVEREF(((PyObject *)__pyx_k_tuple_5));\n\n /* \"numpy.pxd\":215\n * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS)\n * and not PyArray_CHKFLAGS(self, NPY_C_CONTIGUOUS)):\n * raise ValueError(u\"ndarray is not C contiguous\") # <<<<<<<<<<<<<<\n * \n * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS)\n */\n __pyx_k_tuple_7 = PyTuple_New(1); if (unlikely(!__pyx_k_tuple_7)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 215; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_k_tuple_7);\n __Pyx_INCREF(((PyObject *)__pyx_kp_u_6));\n PyTuple_SET_ITEM(__pyx_k_tuple_7, 0, ((PyObject *)__pyx_kp_u_6));\n __Pyx_GIVEREF(((PyObject *)__pyx_kp_u_6));\n __Pyx_GIVEREF(((PyObject *)__pyx_k_tuple_7));\n\n /* \"numpy.pxd\":219\n * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS)\n * and not PyArray_CHKFLAGS(self, NPY_F_CONTIGUOUS)):\n * raise ValueError(u\"ndarray is not Fortran contiguous\") # <<<<<<<<<<<<<<\n * \n * info.buf = PyArray_DATA(self)\n */\n __pyx_k_tuple_9 = PyTuple_New(1); if (unlikely(!__pyx_k_tuple_9)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 219; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_k_tuple_9);\n __Pyx_INCREF(((PyObject *)__pyx_kp_u_8));\n PyTuple_SET_ITEM(__pyx_k_tuple_9, 0, ((PyObject *)__pyx_kp_u_8));\n __Pyx_GIVEREF(((PyObject *)__pyx_kp_u_8));\n __Pyx_GIVEREF(((PyObject *)__pyx_k_tuple_9));\n\n /* \"numpy.pxd\":257\n * if ((descr.byteorder == c'>' and little_endian) or\n * (descr.byteorder == c'<' and not little_endian)):\n * raise ValueError(u\"Non-native byte order not supported\") # <<<<<<<<<<<<<<\n * if t == NPY_BYTE: f = \"b\"\n * elif t == NPY_UBYTE: f = \"B\"\n */\n __pyx_k_tuple_11 = PyTuple_New(1); if (unlikely(!__pyx_k_tuple_11)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_k_tuple_11);\n __Pyx_INCREF(((PyObject *)__pyx_kp_u_10));\n PyTuple_SET_ITEM(__pyx_k_tuple_11, 0, ((PyObject *)__pyx_kp_u_10));\n __Pyx_GIVEREF(((PyObject *)__pyx_kp_u_10));\n __Pyx_GIVEREF(((PyObject *)__pyx_k_tuple_11));\n\n /* \"numpy.pxd\":799\n * \n * if (end - f) - (new_offset - offset[0]) < 15:\n * raise RuntimeError(u\"Format string allocated too short, see comment in numpy.pxd\") # <<<<<<<<<<<<<<\n * \n * if ((child.byteorder == c'>' and little_endian) or\n */\n __pyx_k_tuple_14 = PyTuple_New(1); if (unlikely(!__pyx_k_tuple_14)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 799; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_k_tuple_14);\n __Pyx_INCREF(((PyObject *)__pyx_kp_u_13));\n PyTuple_SET_ITEM(__pyx_k_tuple_14, 0, ((PyObject *)__pyx_kp_u_13));\n __Pyx_GIVEREF(((PyObject *)__pyx_kp_u_13));\n __Pyx_GIVEREF(((PyObject *)__pyx_k_tuple_14));\n\n /* \"numpy.pxd\":803\n * if ((child.byteorder == c'>' and little_endian) or\n * (child.byteorder == c'<' and not little_endian)):\n * raise ValueError(u\"Non-native byte order not supported\") # <<<<<<<<<<<<<<\n * # One could encode it in the format string and have Cython\n * # complain instead, BUT: < and > in format strings also imply\n */\n __pyx_k_tuple_15 = PyTuple_New(1); if (unlikely(!__pyx_k_tuple_15)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 803; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_k_tuple_15);\n __Pyx_INCREF(((PyObject *)__pyx_kp_u_10));\n PyTuple_SET_ITEM(__pyx_k_tuple_15, 0, ((PyObject *)__pyx_kp_u_10));\n __Pyx_GIVEREF(((PyObject *)__pyx_kp_u_10));\n __Pyx_GIVEREF(((PyObject *)__pyx_k_tuple_15));\n\n /* \"numpy.pxd\":823\n * t = child.type_num\n * if end - f < 5:\n * raise RuntimeError(u\"Format string allocated too short.\") # <<<<<<<<<<<<<<\n * \n * # Until ticket #99 is fixed, use integers to avoid warnings\n */\n __pyx_k_tuple_17 = PyTuple_New(1); if (unlikely(!__pyx_k_tuple_17)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 823; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_k_tuple_17);\n __Pyx_INCREF(((PyObject *)__pyx_kp_u_16));\n PyTuple_SET_ITEM(__pyx_k_tuple_17, 0, ((PyObject *)__pyx_kp_u_16));\n __Pyx_GIVEREF(((PyObject *)__pyx_kp_u_16));\n __Pyx_GIVEREF(((PyObject *)__pyx_k_tuple_17));\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":327\n * \n * \n * def plain_sgd(np.ndarray[DOUBLE, ndim=1, mode='c'] weights, # <<<<<<<<<<<<<<\n * double intercept,\n * LossFunction loss,\n */\n __pyx_k_tuple_18 = PyTuple_New(41); if (unlikely(!__pyx_k_tuple_18)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_k_tuple_18);\n __Pyx_INCREF(((PyObject *)__pyx_n_s__weights));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 0, ((PyObject *)__pyx_n_s__weights));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__weights));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__intercept));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 1, ((PyObject *)__pyx_n_s__intercept));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__intercept));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__loss));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 2, ((PyObject *)__pyx_n_s__loss));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__loss));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__penalty_type));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 3, ((PyObject *)__pyx_n_s__penalty_type));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__penalty_type));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__alpha));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 4, ((PyObject *)__pyx_n_s__alpha));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__alpha));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__C));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 5, ((PyObject *)__pyx_n_s__C));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__C));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__rho));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 6, ((PyObject *)__pyx_n_s__rho));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__rho));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__dataset));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 7, ((PyObject *)__pyx_n_s__dataset));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__dataset));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__n_iter));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 8, ((PyObject *)__pyx_n_s__n_iter));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__n_iter));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__fit_intercept));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 9, ((PyObject *)__pyx_n_s__fit_intercept));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__fit_intercept));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__verbose));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 10, ((PyObject *)__pyx_n_s__verbose));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__verbose));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__shuffle));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 11, ((PyObject *)__pyx_n_s__shuffle));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__shuffle));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__seed));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 12, ((PyObject *)__pyx_n_s__seed));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__seed));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__weight_pos));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 13, ((PyObject *)__pyx_n_s__weight_pos));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__weight_pos));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__weight_neg));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 14, ((PyObject *)__pyx_n_s__weight_neg));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__weight_neg));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__learning_rate));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 15, ((PyObject *)__pyx_n_s__learning_rate));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__learning_rate));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__eta0));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 16, ((PyObject *)__pyx_n_s__eta0));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__eta0));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__power_t));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 17, ((PyObject *)__pyx_n_s__power_t));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__power_t));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__t));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 18, ((PyObject *)__pyx_n_s__t));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__t));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__intercept_decay));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 19, ((PyObject *)__pyx_n_s__intercept_decay));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__intercept_decay));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__n_samples));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 20, ((PyObject *)__pyx_n_s__n_samples));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__n_samples));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__n_features));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 21, ((PyObject *)__pyx_n_s__n_features));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__n_features));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__w));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 22, ((PyObject *)__pyx_n_s__w));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__w));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__x_data_ptr));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 23, ((PyObject *)__pyx_n_s__x_data_ptr));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__x_data_ptr));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__x_ind_ptr));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 24, ((PyObject *)__pyx_n_s__x_ind_ptr));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__x_ind_ptr));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__xnnz));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 25, ((PyObject *)__pyx_n_s__xnnz));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__xnnz));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__eta));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 26, ((PyObject *)__pyx_n_s__eta));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__eta));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__p));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 27, ((PyObject *)__pyx_n_s__p));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__p));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__update));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 28, ((PyObject *)__pyx_n_s__update));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__update));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__sumloss));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 29, ((PyObject *)__pyx_n_s__sumloss));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__sumloss));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__y));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 30, ((PyObject *)__pyx_n_s__y));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__y));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__sample_weight));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 31, ((PyObject *)__pyx_n_s__sample_weight));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__sample_weight));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__class_weight));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 32, ((PyObject *)__pyx_n_s__class_weight));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__class_weight));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__count));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 33, ((PyObject *)__pyx_n_s__count));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__count));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__epoch));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 34, ((PyObject *)__pyx_n_s__epoch));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__epoch));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__i));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 35, ((PyObject *)__pyx_n_s__i));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__i));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__is_hinge));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 36, ((PyObject *)__pyx_n_s__is_hinge));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__is_hinge));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__q));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 37, ((PyObject *)__pyx_n_s__q));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__q));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__q_data_ptr));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 38, ((PyObject *)__pyx_n_s__q_data_ptr));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__q_data_ptr));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__u));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 39, ((PyObject *)__pyx_n_s__u));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__u));\n __Pyx_INCREF(((PyObject *)__pyx_n_s__t_start));\n PyTuple_SET_ITEM(__pyx_k_tuple_18, 40, ((PyObject *)__pyx_n_s__t_start));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__t_start));\n __Pyx_GIVEREF(((PyObject *)__pyx_k_tuple_18));\n __pyx_k_codeobj_19 = (PyObject*)__Pyx_PyCode_New(20, 0, 41, 0, 0, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_k_tuple_18, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_20, __pyx_n_s__plain_sgd, 327, __pyx_empty_bytes); if (unlikely(!__pyx_k_codeobj_19)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __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_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;};\n __pyx_int_15 = PyInt_FromLong(15); if (unlikely(!__pyx_int_15)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;};\n return 0;\n __pyx_L1_error:;\n return -1;\n}\n\n#if PY_MAJOR_VERSION < 3\nPyMODINIT_FUNC initsgd_fast(void); /*proto*/\nPyMODINIT_FUNC initsgd_fast(void)\n#else\nPyMODINIT_FUNC PyInit_sgd_fast(void); /*proto*/\nPyMODINIT_FUNC PyInit_sgd_fast(void)\n#endif\n{\n PyObject *__pyx_t_1 = NULL;\n PyObject *__pyx_t_2 = NULL;\n __Pyx_RefNannyDeclarations\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_sgd_fast(void)\", 0);\n if ( __Pyx_check_binary_version() < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_empty_tuple = PyTuple_New(0); if (unlikely(!__pyx_empty_tuple)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_empty_bytes = PyBytes_FromStringAndSize(\"\", 0); if (unlikely(!__pyx_empty_bytes)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n #ifdef __Pyx_CyFunction_USED\n if (__Pyx_CyFunction_init() < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n #endif\n #ifdef __Pyx_FusedFunction_USED\n if (__pyx_FusedFunction_init() < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n #endif\n #ifdef __Pyx_Generator_USED\n if (__pyx_Generator_init() < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __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 PY_MAJOR_VERSION < 3\n __pyx_m = Py_InitModule4(__Pyx_NAMESTR(\"sgd_fast\"), __pyx_methods, 0, 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_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n #if PY_MAJOR_VERSION >= 3\n {\n PyObject *modules = PyImport_GetModuleDict(); if (unlikely(!modules)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (!PyDict_GetItemString(modules, \"sklearn.linear_model.sgd_fast\")) {\n if (unlikely(PyDict_SetItemString(modules, \"sklearn.linear_model.sgd_fast\", __pyx_m) < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n }\n }\n #endif\n __pyx_b = PyImport_AddModule(__Pyx_NAMESTR(__Pyx_BUILTIN_MODULE_NAME)); if (unlikely(!__pyx_b)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n #if CYTHON_COMPILING_IN_PYPY\n Py_INCREF(__pyx_b);\n #endif\n if (__Pyx_SetAttrString(__pyx_m, \"__builtins__\", __pyx_b) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;};\n /*--- Initialize various global constants etc. ---*/\n if (unlikely(__Pyx_InitGlobals() < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__pyx_module_is_main_sklearn__linear_model__sgd_fast) {\n if (__Pyx_SetAttrString(__pyx_m, \"__name__\", __pyx_n_s____main__) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;};\n }\n /*--- Builtin init code ---*/\n if (unlikely(__Pyx_InitCachedBuiltins() < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n /*--- Constants init code ---*/\n if (unlikely(__Pyx_InitCachedConstants() < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n /*--- Global init code ---*/\n /*--- Variable export code ---*/\n /*--- Function export code ---*/\n /*--- Type init code ---*/\n __pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_LossFunction = &__pyx_vtable_7sklearn_12linear_model_8sgd_fast_LossFunction;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_LossFunction.loss = (double (*)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch))__pyx_f_7sklearn_12linear_model_8sgd_fast_12LossFunction_loss;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_LossFunction.dloss = (double (*)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch))__pyx_f_7sklearn_12linear_model_8sgd_fast_12LossFunction_dloss;\n if (PyType_Ready(&__pyx_type_7sklearn_12linear_model_8sgd_fast_LossFunction) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 46; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__Pyx_SetVtable(__pyx_type_7sklearn_12linear_model_8sgd_fast_LossFunction.tp_dict, __pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_LossFunction) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 46; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__Pyx_SetAttrString(__pyx_m, \"LossFunction\", (PyObject *)&__pyx_type_7sklearn_12linear_model_8sgd_fast_LossFunction) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 46; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_7sklearn_12linear_model_8sgd_fast_LossFunction = &__pyx_type_7sklearn_12linear_model_8sgd_fast_LossFunction;\n __pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Regression = &__pyx_vtable_7sklearn_12linear_model_8sgd_fast_Regression;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_Regression.__pyx_base = *__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_LossFunction;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_Regression.__pyx_base.loss = (double (*)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch))__pyx_f_7sklearn_12linear_model_8sgd_fast_10Regression_loss;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_Regression.__pyx_base.dloss = (double (*)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch))__pyx_f_7sklearn_12linear_model_8sgd_fast_10Regression_dloss;\n __pyx_type_7sklearn_12linear_model_8sgd_fast_Regression.tp_base = __pyx_ptype_7sklearn_12linear_model_8sgd_fast_LossFunction;\n if (PyType_Ready(&__pyx_type_7sklearn_12linear_model_8sgd_fast_Regression) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 84; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__Pyx_SetVtable(__pyx_type_7sklearn_12linear_model_8sgd_fast_Regression.tp_dict, __pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Regression) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 84; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__Pyx_SetAttrString(__pyx_m, \"Regression\", (PyObject *)&__pyx_type_7sklearn_12linear_model_8sgd_fast_Regression) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 84; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_7sklearn_12linear_model_8sgd_fast_Regression = &__pyx_type_7sklearn_12linear_model_8sgd_fast_Regression;\n __pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Classification = &__pyx_vtable_7sklearn_12linear_model_8sgd_fast_Classification;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_Classification.__pyx_base = *__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_LossFunction;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_Classification.__pyx_base.loss = (double (*)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch))__pyx_f_7sklearn_12linear_model_8sgd_fast_14Classification_loss;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_Classification.__pyx_base.dloss = (double (*)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch))__pyx_f_7sklearn_12linear_model_8sgd_fast_14Classification_dloss;\n __pyx_type_7sklearn_12linear_model_8sgd_fast_Classification.tp_base = __pyx_ptype_7sklearn_12linear_model_8sgd_fast_LossFunction;\n if (PyType_Ready(&__pyx_type_7sklearn_12linear_model_8sgd_fast_Classification) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 94; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__Pyx_SetVtable(__pyx_type_7sklearn_12linear_model_8sgd_fast_Classification.tp_dict, __pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Classification) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 94; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__Pyx_SetAttrString(__pyx_m, \"Classification\", (PyObject *)&__pyx_type_7sklearn_12linear_model_8sgd_fast_Classification) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 94; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_7sklearn_12linear_model_8sgd_fast_Classification = &__pyx_type_7sklearn_12linear_model_8sgd_fast_Classification;\n __pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_ModifiedHuber = &__pyx_vtable_7sklearn_12linear_model_8sgd_fast_ModifiedHuber;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_ModifiedHuber.__pyx_base = *__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Classification;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_ModifiedHuber.__pyx_base.__pyx_base.loss = (double (*)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch))__pyx_f_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_loss;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_ModifiedHuber.__pyx_base.__pyx_base.dloss = (double (*)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch))__pyx_f_7sklearn_12linear_model_8sgd_fast_13ModifiedHuber_dloss;\n __pyx_type_7sklearn_12linear_model_8sgd_fast_ModifiedHuber.tp_base = __pyx_ptype_7sklearn_12linear_model_8sgd_fast_Classification;\n if (PyType_Ready(&__pyx_type_7sklearn_12linear_model_8sgd_fast_ModifiedHuber) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 104; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__Pyx_SetVtable(__pyx_type_7sklearn_12linear_model_8sgd_fast_ModifiedHuber.tp_dict, __pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_ModifiedHuber) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 104; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__Pyx_SetAttrString(__pyx_m, \"ModifiedHuber\", (PyObject *)&__pyx_type_7sklearn_12linear_model_8sgd_fast_ModifiedHuber) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 104; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_7sklearn_12linear_model_8sgd_fast_ModifiedHuber = &__pyx_type_7sklearn_12linear_model_8sgd_fast_ModifiedHuber;\n __pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Hinge = &__pyx_vtable_7sklearn_12linear_model_8sgd_fast_Hinge;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_Hinge.__pyx_base = *__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Classification;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_Hinge.__pyx_base.__pyx_base.loss = (double (*)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch))__pyx_f_7sklearn_12linear_model_8sgd_fast_5Hinge_loss;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_Hinge.__pyx_base.__pyx_base.dloss = (double (*)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch))__pyx_f_7sklearn_12linear_model_8sgd_fast_5Hinge_dloss;\n __pyx_type_7sklearn_12linear_model_8sgd_fast_Hinge.tp_base = __pyx_ptype_7sklearn_12linear_model_8sgd_fast_Classification;\n if (PyType_Ready(&__pyx_type_7sklearn_12linear_model_8sgd_fast_Hinge) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 134; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__Pyx_SetVtable(__pyx_type_7sklearn_12linear_model_8sgd_fast_Hinge.tp_dict, __pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Hinge) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 134; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__Pyx_SetAttrString(__pyx_m, \"Hinge\", (PyObject *)&__pyx_type_7sklearn_12linear_model_8sgd_fast_Hinge) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 134; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_7sklearn_12linear_model_8sgd_fast_Hinge = &__pyx_type_7sklearn_12linear_model_8sgd_fast_Hinge;\n __pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_SquaredHinge = &__pyx_vtable_7sklearn_12linear_model_8sgd_fast_SquaredHinge;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_SquaredHinge.__pyx_base = *__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_LossFunction;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_SquaredHinge.__pyx_base.loss = (double (*)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch))__pyx_f_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_loss;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_SquaredHinge.__pyx_base.dloss = (double (*)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch))__pyx_f_7sklearn_12linear_model_8sgd_fast_12SquaredHinge_dloss;\n __pyx_type_7sklearn_12linear_model_8sgd_fast_SquaredHinge.tp_base = __pyx_ptype_7sklearn_12linear_model_8sgd_fast_LossFunction;\n if (PyType_Ready(&__pyx_type_7sklearn_12linear_model_8sgd_fast_SquaredHinge) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 166; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__Pyx_SetVtable(__pyx_type_7sklearn_12linear_model_8sgd_fast_SquaredHinge.tp_dict, __pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_SquaredHinge) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 166; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__Pyx_SetAttrString(__pyx_m, \"SquaredHinge\", (PyObject *)&__pyx_type_7sklearn_12linear_model_8sgd_fast_SquaredHinge) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 166; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_7sklearn_12linear_model_8sgd_fast_SquaredHinge = &__pyx_type_7sklearn_12linear_model_8sgd_fast_SquaredHinge;\n __pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Log = &__pyx_vtable_7sklearn_12linear_model_8sgd_fast_Log;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_Log.__pyx_base = *__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Classification;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_Log.__pyx_base.__pyx_base.loss = (double (*)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch))__pyx_f_7sklearn_12linear_model_8sgd_fast_3Log_loss;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_Log.__pyx_base.__pyx_base.dloss = (double (*)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch))__pyx_f_7sklearn_12linear_model_8sgd_fast_3Log_dloss;\n __pyx_type_7sklearn_12linear_model_8sgd_fast_Log.tp_base = __pyx_ptype_7sklearn_12linear_model_8sgd_fast_Classification;\n if (PyType_Ready(&__pyx_type_7sklearn_12linear_model_8sgd_fast_Log) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 198; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__Pyx_SetVtable(__pyx_type_7sklearn_12linear_model_8sgd_fast_Log.tp_dict, __pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Log) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 198; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__Pyx_SetAttrString(__pyx_m, \"Log\", (PyObject *)&__pyx_type_7sklearn_12linear_model_8sgd_fast_Log) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 198; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_7sklearn_12linear_model_8sgd_fast_Log = &__pyx_type_7sklearn_12linear_model_8sgd_fast_Log;\n __pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_SquaredLoss = &__pyx_vtable_7sklearn_12linear_model_8sgd_fast_SquaredLoss;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_SquaredLoss.__pyx_base = *__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Regression;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_SquaredLoss.__pyx_base.__pyx_base.loss = (double (*)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch))__pyx_f_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_loss;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_SquaredLoss.__pyx_base.__pyx_base.dloss = (double (*)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch))__pyx_f_7sklearn_12linear_model_8sgd_fast_11SquaredLoss_dloss;\n __pyx_type_7sklearn_12linear_model_8sgd_fast_SquaredLoss.tp_base = __pyx_ptype_7sklearn_12linear_model_8sgd_fast_Regression;\n if (PyType_Ready(&__pyx_type_7sklearn_12linear_model_8sgd_fast_SquaredLoss) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 223; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__Pyx_SetVtable(__pyx_type_7sklearn_12linear_model_8sgd_fast_SquaredLoss.tp_dict, __pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_SquaredLoss) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 223; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__Pyx_SetAttrString(__pyx_m, \"SquaredLoss\", (PyObject *)&__pyx_type_7sklearn_12linear_model_8sgd_fast_SquaredLoss) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 223; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_7sklearn_12linear_model_8sgd_fast_SquaredLoss = &__pyx_type_7sklearn_12linear_model_8sgd_fast_SquaredLoss;\n __pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Huber = &__pyx_vtable_7sklearn_12linear_model_8sgd_fast_Huber;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_Huber.__pyx_base = *__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Regression;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_Huber.__pyx_base.__pyx_base.loss = (double (*)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch))__pyx_f_7sklearn_12linear_model_8sgd_fast_5Huber_loss;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_Huber.__pyx_base.__pyx_base.dloss = (double (*)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch))__pyx_f_7sklearn_12linear_model_8sgd_fast_5Huber_dloss;\n __pyx_type_7sklearn_12linear_model_8sgd_fast_Huber.tp_base = __pyx_ptype_7sklearn_12linear_model_8sgd_fast_Regression;\n if (PyType_Ready(&__pyx_type_7sklearn_12linear_model_8sgd_fast_Huber) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 235; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__Pyx_SetVtable(__pyx_type_7sklearn_12linear_model_8sgd_fast_Huber.tp_dict, __pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Huber) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 235; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__Pyx_SetAttrString(__pyx_m, \"Huber\", (PyObject *)&__pyx_type_7sklearn_12linear_model_8sgd_fast_Huber) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 235; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_7sklearn_12linear_model_8sgd_fast_Huber = &__pyx_type_7sklearn_12linear_model_8sgd_fast_Huber;\n __pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive = &__pyx_vtable_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive.__pyx_base = *__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Regression;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive.__pyx_base.__pyx_base.loss = (double (*)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch))__pyx_f_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_loss;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive.__pyx_base.__pyx_base.dloss = (double (*)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch))__pyx_f_7sklearn_12linear_model_8sgd_fast_18EpsilonInsensitive_dloss;\n __pyx_type_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive.tp_base = __pyx_ptype_7sklearn_12linear_model_8sgd_fast_Regression;\n if (PyType_Ready(&__pyx_type_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 271; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__Pyx_SetVtable(__pyx_type_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive.tp_dict, __pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 271; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__Pyx_SetAttrString(__pyx_m, \"EpsilonInsensitive\", (PyObject *)&__pyx_type_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 271; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive = &__pyx_type_7sklearn_12linear_model_8sgd_fast_EpsilonInsensitive;\n __pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive = &__pyx_vtable_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive.__pyx_base = *__pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_Regression;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive.__pyx_base.__pyx_base.loss = (double (*)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch))__pyx_f_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_loss;\n __pyx_vtable_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive.__pyx_base.__pyx_base.dloss = (double (*)(struct __pyx_obj_7sklearn_12linear_model_8sgd_fast_LossFunction *, double, double, int __pyx_skip_dispatch))__pyx_f_7sklearn_12linear_model_8sgd_fast_25SquaredEpsilonInsensitive_dloss;\n __pyx_type_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive.tp_base = __pyx_ptype_7sklearn_12linear_model_8sgd_fast_Regression;\n if (PyType_Ready(&__pyx_type_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 298; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__Pyx_SetVtable(__pyx_type_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive.tp_dict, __pyx_vtabptr_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 298; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__Pyx_SetAttrString(__pyx_m, \"SquaredEpsilonInsensitive\", (PyObject *)&__pyx_type_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 298; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive = &__pyx_type_7sklearn_12linear_model_8sgd_fast_SquaredEpsilonInsensitive;\n /*--- Type import code ---*/\n __pyx_ptype_7cpython_4type_type = __Pyx_ImportType(__Pyx_BUILTIN_MODULE_NAME, \"type\", \n #if CYTHON_COMPILING_IN_PYPY\n sizeof(PyTypeObject),\n #else\n sizeof(PyHeapTypeObject),\n #endif\n 0); if (unlikely(!__pyx_ptype_7cpython_4type_type)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 9; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_5numpy_dtype = __Pyx_ImportType(\"numpy\", \"dtype\", sizeof(PyArray_Descr), 0); if (unlikely(!__pyx_ptype_5numpy_dtype)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 155; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_5numpy_flatiter = __Pyx_ImportType(\"numpy\", \"flatiter\", sizeof(PyArrayIterObject), 0); if (unlikely(!__pyx_ptype_5numpy_flatiter)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 165; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_5numpy_broadcast = __Pyx_ImportType(\"numpy\", \"broadcast\", sizeof(PyArrayMultiIterObject), 0); if (unlikely(!__pyx_ptype_5numpy_broadcast)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 169; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_5numpy_ndarray = __Pyx_ImportType(\"numpy\", \"ndarray\", sizeof(PyArrayObject), 0); if (unlikely(!__pyx_ptype_5numpy_ndarray)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 178; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_5numpy_ufunc = __Pyx_ImportType(\"numpy\", \"ufunc\", sizeof(PyUFuncObject), 0); if (unlikely(!__pyx_ptype_5numpy_ufunc)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 861; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_7sklearn_5utils_13weight_vector_WeightVector = __Pyx_ImportType(\"sklearn.utils.weight_vector\", \"WeightVector\", sizeof(struct __pyx_obj_7sklearn_5utils_13weight_vector_WeightVector), 1); if (unlikely(!__pyx_ptype_7sklearn_5utils_13weight_vector_WeightVector)) {__pyx_filename = __pyx_f[3]; __pyx_lineno = 14; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_vtabptr_7sklearn_5utils_13weight_vector_WeightVector = (struct __pyx_vtabstruct_7sklearn_5utils_13weight_vector_WeightVector*)__Pyx_GetVtable(__pyx_ptype_7sklearn_5utils_13weight_vector_WeightVector->tp_dict); if (unlikely(!__pyx_vtabptr_7sklearn_5utils_13weight_vector_WeightVector)) {__pyx_filename = __pyx_f[3]; __pyx_lineno = 14; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_7sklearn_5utils_11seq_dataset_SequentialDataset = __Pyx_ImportType(\"sklearn.utils.seq_dataset\", \"SequentialDataset\", sizeof(struct __pyx_obj_7sklearn_5utils_11seq_dataset_SequentialDataset), 1); if (unlikely(!__pyx_ptype_7sklearn_5utils_11seq_dataset_SequentialDataset)) {__pyx_filename = __pyx_f[4]; __pyx_lineno = 9; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_vtabptr_7sklearn_5utils_11seq_dataset_SequentialDataset = (struct __pyx_vtabstruct_7sklearn_5utils_11seq_dataset_SequentialDataset*)__Pyx_GetVtable(__pyx_ptype_7sklearn_5utils_11seq_dataset_SequentialDataset->tp_dict); if (unlikely(!__pyx_vtabptr_7sklearn_5utils_11seq_dataset_SequentialDataset)) {__pyx_filename = __pyx_f[4]; __pyx_lineno = 9; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_7sklearn_5utils_11seq_dataset_ArrayDataset = __Pyx_ImportType(\"sklearn.utils.seq_dataset\", \"ArrayDataset\", sizeof(struct __pyx_obj_7sklearn_5utils_11seq_dataset_ArrayDataset), 1); if (unlikely(!__pyx_ptype_7sklearn_5utils_11seq_dataset_ArrayDataset)) {__pyx_filename = __pyx_f[4]; __pyx_lineno = 17; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_vtabptr_7sklearn_5utils_11seq_dataset_ArrayDataset = (struct __pyx_vtabstruct_7sklearn_5utils_11seq_dataset_ArrayDataset*)__Pyx_GetVtable(__pyx_ptype_7sklearn_5utils_11seq_dataset_ArrayDataset->tp_dict); if (unlikely(!__pyx_vtabptr_7sklearn_5utils_11seq_dataset_ArrayDataset)) {__pyx_filename = __pyx_f[4]; __pyx_lineno = 17; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_7sklearn_5utils_11seq_dataset_CSRDataset = __Pyx_ImportType(\"sklearn.utils.seq_dataset\", \"CSRDataset\", sizeof(struct __pyx_obj_7sklearn_5utils_11seq_dataset_CSRDataset), 1); if (unlikely(!__pyx_ptype_7sklearn_5utils_11seq_dataset_CSRDataset)) {__pyx_filename = __pyx_f[4]; __pyx_lineno = 34; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_vtabptr_7sklearn_5utils_11seq_dataset_CSRDataset = (struct __pyx_vtabstruct_7sklearn_5utils_11seq_dataset_CSRDataset*)__Pyx_GetVtable(__pyx_ptype_7sklearn_5utils_11seq_dataset_CSRDataset->tp_dict); if (unlikely(!__pyx_vtabptr_7sklearn_5utils_11seq_dataset_CSRDataset)) {__pyx_filename = __pyx_f[4]; __pyx_lineno = 34; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n /*--- Variable import code ---*/\n /*--- Function import code ---*/\n /*--- Execution code ---*/\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":11\n * \n * \n * import numpy as np # <<<<<<<<<<<<<<\n * import sys\n * from time import time\n */\n __pyx_t_1 = __Pyx_Import(((PyObject *)__pyx_n_s__numpy), 0, -1); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 11; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n if (PyObject_SetAttr(__pyx_m, __pyx_n_s__np, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 11; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":12\n * \n * import numpy as np\n * import sys # <<<<<<<<<<<<<<\n * from time import time\n * \n */\n __pyx_t_1 = __Pyx_Import(((PyObject *)__pyx_n_s__sys), 0, -1); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 12; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n if (PyObject_SetAttr(__pyx_m, __pyx_n_s__sys, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 12; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":13\n * import numpy as np\n * import sys\n * from time import time # <<<<<<<<<<<<<<\n * \n * from libc.math cimport exp, log, sqrt, pow, fabs\n */\n __pyx_t_1 = PyList_New(1); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 13; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n __Pyx_INCREF(((PyObject *)__pyx_n_s__time));\n PyList_SET_ITEM(__pyx_t_1, 0, ((PyObject *)__pyx_n_s__time));\n __Pyx_GIVEREF(((PyObject *)__pyx_n_s__time));\n __pyx_t_2 = __Pyx_Import(((PyObject *)__pyx_n_s__time), ((PyObject *)__pyx_t_1), -1); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 13; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __Pyx_DECREF(((PyObject *)__pyx_t_1)); __pyx_t_1 = 0;\n __pyx_t_1 = PyObject_GetAttr(__pyx_t_2, __pyx_n_s__time);\n if (__pyx_t_1 == NULL) {\n if (PyErr_ExceptionMatches(PyExc_AttributeError)) __Pyx_RaiseImportError(__pyx_n_s__time);\n if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 13; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n }\n __Pyx_GOTREF(__pyx_t_1);\n if (PyObject_SetAttr(__pyx_m, __pyx_n_s__time, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 13; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":22\n * from sklearn.utils.seq_dataset cimport SequentialDataset\n * \n * np.import_array() # <<<<<<<<<<<<<<\n * \n * \n */\n import_array();\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":327\n * \n * \n * def plain_sgd(np.ndarray[DOUBLE, ndim=1, mode='c'] weights, # <<<<<<<<<<<<<<\n * double intercept,\n * LossFunction loss,\n */\n __pyx_t_2 = PyCFunction_NewEx(&__pyx_mdef_7sklearn_12linear_model_8sgd_fast_1plain_sgd, NULL, __pyx_n_s_21); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n if (PyObject_SetAttr(__pyx_m, __pyx_n_s__plain_sgd, __pyx_t_2) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 327; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n\n /* \"sklearn/linear_model/sgd_fast.pyx\":1\n * # encoding: utf-8 # <<<<<<<<<<<<<<\n * # cython: cdivision=True\n * # cython: boundscheck=False\n */\n __pyx_t_2 = PyDict_New(); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(((PyObject *)__pyx_t_2));\n if (PyObject_SetAttr(__pyx_m, __pyx_n_s____test__, ((PyObject *)__pyx_t_2)) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(((PyObject *)__pyx_t_2)); __pyx_t_2 = 0;\n\n /* \"numpy.pxd\":975\n * arr.base = baseptr\n * \n * cdef inline object get_array_base(ndarray arr): # <<<<<<<<<<<<<<\n * if arr.base is NULL:\n * return None\n */\n goto __pyx_L0;\n __pyx_L1_error:;\n __Pyx_XDECREF(__pyx_t_1);\n __Pyx_XDECREF(__pyx_t_2);\n if (__pyx_m) {\n __Pyx_AddTraceback(\"init sklearn.linear_model.sgd_fast\", __pyx_clineno, __pyx_lineno, __pyx_filename);\n Py_DECREF(__pyx_m); __pyx_m = 0;\n } else if (!PyErr_Occurred()) {\n PyErr_SetString(PyExc_ImportError, \"init sklearn.linear_model.sgd_fast\");\n }\n __pyx_L0:;\n __Pyx_RefNannyFinishContext();\n #if PY_MAJOR_VERSION < 3\n return;\n #else\n return __pyx_m;\n #endif\n}\n\n/* Runtime support code */\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 /* CYTHON_REFNANNY */\n\nstatic PyObject *__Pyx_GetName(PyObject *dict, PyObject *name) {\n PyObject *result;\n result = PyObject_GetAttr(dict, name);\n if (!result) {\n if (dict != __pyx_b) {\n PyErr_Clear();\n result = PyObject_GetAttr(__pyx_b, name);\n }\n if (!result) {\n PyErr_SetObject(PyExc_NameError, name);\n }\n }\n return result;\n}\n\nstatic CYTHON_INLINE void __Pyx_ErrRestore(PyObject *type, PyObject *value, PyObject *tb) {\n#if CYTHON_COMPILING_IN_CPYTHON\n PyObject *tmp_type, *tmp_value, *tmp_tb;\n PyThreadState *tstate = PyThreadState_GET();\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#else\n PyErr_Restore(type, value, tb);\n#endif\n}\nstatic CYTHON_INLINE void __Pyx_ErrFetch(PyObject **type, PyObject **value, PyObject **tb) {\n#if CYTHON_COMPILING_IN_CPYTHON\n PyThreadState *tstate = PyThreadState_GET();\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#else\n PyErr_Fetch(type, value, tb);\n#endif\n}\n\n#if PY_MAJOR_VERSION < 3\nstatic void __Pyx_Raise(PyObject *type, PyObject *value, PyObject *tb,\n CYTHON_UNUSED PyObject *cause) {\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 PY_VERSION_HEX < 0x02050000\n if (PyClass_Check(type)) {\n #else\n if (PyType_Check(type)) {\n #endif\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 #if PY_VERSION_HEX < 0x02050000\n if (PyInstance_Check(type)) {\n type = (PyObject*) ((PyInstanceObject*)type)->in_class;\n Py_INCREF(type);\n }\n else {\n type = 0;\n PyErr_SetString(PyExc_TypeError,\n \"raise: exception must be an old-style class or instance\");\n goto raise_error;\n }\n #else\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 #endif\n }\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 /* Python 3+ */\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 *args;\n if (!value)\n args = PyTuple_New(0);\n else if (PyTuple_Check(value)) {\n Py_INCREF(value);\n args = value;\n }\n else\n args = PyTuple_Pack(1, value);\n if (!args)\n goto bad;\n owned_instance = PyEval_CallObject(type, args);\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 } else {\n PyErr_SetString(PyExc_TypeError,\n \"raise: exception class must be a subclass of BaseException\");\n goto bad;\n }\n if (cause && cause != Py_None) {\n PyObject *fixed_cause;\n if (PyExceptionClass_Check(cause)) {\n fixed_cause = PyObject_CallObject(cause, NULL);\n if (fixed_cause == NULL)\n goto bad;\n }\n else if (PyExceptionInstance_Check(cause)) {\n fixed_cause = cause;\n Py_INCREF(fixed_cause);\n }\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 PyThreadState *tstate = PyThreadState_GET();\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 }\nbad:\n Py_XDECREF(owned_instance);\n return;\n}\n#endif\n\nstatic 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 \"%s() takes %s %\" CYTHON_FORMAT_SSIZE_T \"d positional argument%s (%\" CYTHON_FORMAT_SSIZE_T \"d given)\",\n func_name, more_or_less, num_expected,\n (num_expected == 1) ? \"\" : \"s\", num_found);\n}\n\nstatic 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\nstatic 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 \"%s() keywords must be strings\", function_name);\n goto bad;\ninvalid_keyword:\n PyErr_Format(PyExc_TypeError,\n #if PY_MAJOR_VERSION < 3\n \"%s() got an unexpected keyword argument '%s'\",\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\nstatic int __Pyx_ArgTypeTest(PyObject *obj, PyTypeObject *type, int none_allowed,\n const char *name, int exact)\n{\n if (!type) {\n PyErr_Format(PyExc_SystemError, \"Missing type object\");\n return 0;\n }\n if (none_allowed && obj == Py_None) return 1;\n else if (exact) {\n if (Py_TYPE(obj) == type) return 1;\n }\n else {\n if (PyObject_TypeCheck(obj, type)) return 1;\n }\n PyErr_Format(PyExc_TypeError,\n \"Argument '%s' has incorrect type (expected %s, got %s)\",\n name, type->tp_name, Py_TYPE(obj)->tp_name);\n return 0;\n}\n\nstatic CYTHON_INLINE int __Pyx_IsLittleEndian(void) {\n unsigned int n = 1;\n return *(unsigned char*)(&n) != 0;\n}\nstatic void __Pyx_BufFmt_Init(__Pyx_BufFmt_Context* ctx,\n __Pyx_BufFmt_StackElem* stack,\n __Pyx_TypeInfo* type) {\n stack[0].field = &ctx->root;\n stack[0].parent_offset = 0;\n ctx->root.type = type;\n ctx->root.name = \"buffer dtype\";\n ctx->root.offset = 0;\n ctx->head = stack;\n ctx->head->field = &ctx->root;\n ctx->fmt_offset = 0;\n ctx->head->parent_offset = 0;\n ctx->new_packmode = '@';\n ctx->enc_packmode = '@';\n ctx->new_count = 1;\n ctx->enc_count = 0;\n ctx->enc_type = 0;\n ctx->is_complex = 0;\n ctx->is_valid_array = 0;\n ctx->struct_alignment = 0;\n while (type->typegroup == 'S') {\n ++ctx->head;\n ctx->head->field = type->fields;\n ctx->head->parent_offset = 0;\n type = type->fields->type;\n }\n}\nstatic int __Pyx_BufFmt_ParseNumber(const char** ts) {\n int count;\n const char* t = *ts;\n if (*t < '0' || *t > '9') {\n return -1;\n } else {\n count = *t++ - '0';\n while (*t >= '0' && *t < '9') {\n count *= 10;\n count += *t++ - '0';\n }\n }\n *ts = t;\n return count;\n}\nstatic int __Pyx_BufFmt_ExpectNumber(const char **ts) {\n int number = __Pyx_BufFmt_ParseNumber(ts);\n if (number == -1) /* First char was not a digit */\n PyErr_Format(PyExc_ValueError,\\\n \"Does not understand character buffer dtype format string ('%c')\", **ts);\n return number;\n}\nstatic void __Pyx_BufFmt_RaiseUnexpectedChar(char ch) {\n PyErr_Format(PyExc_ValueError,\n \"Unexpected format string character: '%c'\", ch);\n}\nstatic const char* __Pyx_BufFmt_DescribeTypeChar(char ch, int is_complex) {\n switch (ch) {\n case 'c': return \"'char'\";\n case 'b': return \"'signed char'\";\n case 'B': return \"'unsigned char'\";\n case 'h': return \"'short'\";\n case 'H': return \"'unsigned short'\";\n case 'i': return \"'int'\";\n case 'I': return \"'unsigned int'\";\n case 'l': return \"'long'\";\n case 'L': return \"'unsigned long'\";\n case 'q': return \"'long long'\";\n case 'Q': return \"'unsigned long long'\";\n case 'f': return (is_complex ? \"'complex float'\" : \"'float'\");\n case 'd': return (is_complex ? \"'complex double'\" : \"'double'\");\n case 'g': return (is_complex ? \"'complex long double'\" : \"'long double'\");\n case 'T': return \"a struct\";\n case 'O': return \"Python object\";\n case 'P': return \"a pointer\";\n case 's': case 'p': return \"a string\";\n case 0: return \"end\";\n default: return \"unparseable format string\";\n }\n}\nstatic size_t __Pyx_BufFmt_TypeCharToStandardSize(char ch, int is_complex) {\n switch (ch) {\n case '?': case 'c': case 'b': case 'B': case 's': case 'p': return 1;\n case 'h': case 'H': return 2;\n case 'i': case 'I': case 'l': case 'L': return 4;\n case 'q': case 'Q': return 8;\n case 'f': return (is_complex ? 8 : 4);\n case 'd': return (is_complex ? 16 : 8);\n case 'g': {\n PyErr_SetString(PyExc_ValueError, \"Python does not define a standard format string size for long double ('g')..\");\n return 0;\n }\n case 'O': case 'P': return sizeof(void*);\n default:\n __Pyx_BufFmt_RaiseUnexpectedChar(ch);\n return 0;\n }\n}\nstatic size_t __Pyx_BufFmt_TypeCharToNativeSize(char ch, int is_complex) {\n switch (ch) {\n case 'c': case 'b': case 'B': case 's': case 'p': return 1;\n case 'h': case 'H': return sizeof(short);\n case 'i': case 'I': return sizeof(int);\n case 'l': case 'L': return sizeof(long);\n #ifdef HAVE_LONG_LONG\n case 'q': case 'Q': return sizeof(PY_LONG_LONG);\n #endif\n case 'f': return sizeof(float) * (is_complex ? 2 : 1);\n case 'd': return sizeof(double) * (is_complex ? 2 : 1);\n case 'g': return sizeof(long double) * (is_complex ? 2 : 1);\n case 'O': case 'P': return sizeof(void*);\n default: {\n __Pyx_BufFmt_RaiseUnexpectedChar(ch);\n return 0;\n }\n }\n}\ntypedef struct { char c; short x; } __Pyx_st_short;\ntypedef struct { char c; int x; } __Pyx_st_int;\ntypedef struct { char c; long x; } __Pyx_st_long;\ntypedef struct { char c; float x; } __Pyx_st_float;\ntypedef struct { char c; double x; } __Pyx_st_double;\ntypedef struct { char c; long double x; } __Pyx_st_longdouble;\ntypedef struct { char c; void *x; } __Pyx_st_void_p;\n#ifdef HAVE_LONG_LONG\ntypedef struct { char c; PY_LONG_LONG x; } __Pyx_st_longlong;\n#endif\nstatic size_t __Pyx_BufFmt_TypeCharToAlignment(char ch, CYTHON_UNUSED int is_complex) {\n switch (ch) {\n case '?': case 'c': case 'b': case 'B': case 's': case 'p': return 1;\n case 'h': case 'H': return sizeof(__Pyx_st_short) - sizeof(short);\n case 'i': case 'I': return sizeof(__Pyx_st_int) - sizeof(int);\n case 'l': case 'L': return sizeof(__Pyx_st_long) - sizeof(long);\n#ifdef HAVE_LONG_LONG\n case 'q': case 'Q': return sizeof(__Pyx_st_longlong) - sizeof(PY_LONG_LONG);\n#endif\n case 'f': return sizeof(__Pyx_st_float) - sizeof(float);\n case 'd': return sizeof(__Pyx_st_double) - sizeof(double);\n case 'g': return sizeof(__Pyx_st_longdouble) - sizeof(long double);\n case 'P': case 'O': return sizeof(__Pyx_st_void_p) - sizeof(void*);\n default:\n __Pyx_BufFmt_RaiseUnexpectedChar(ch);\n return 0;\n }\n}\n/* These are for computing the padding at the end of the struct to align\n on the first member of the struct. This will probably the same as above,\n but we don't have any guarantees.\n */\ntypedef struct { short x; char c; } __Pyx_pad_short;\ntypedef struct { int x; char c; } __Pyx_pad_int;\ntypedef struct { long x; char c; } __Pyx_pad_long;\ntypedef struct { float x; char c; } __Pyx_pad_float;\ntypedef struct { double x; char c; } __Pyx_pad_double;\ntypedef struct { long double x; char c; } __Pyx_pad_longdouble;\ntypedef struct { void *x; char c; } __Pyx_pad_void_p;\n#ifdef HAVE_LONG_LONG\ntypedef struct { PY_LONG_LONG x; char c; } __Pyx_pad_longlong;\n#endif\nstatic size_t __Pyx_BufFmt_TypeCharToPadding(char ch, CYTHON_UNUSED int is_complex) {\n switch (ch) {\n case '?': case 'c': case 'b': case 'B': case 's': case 'p': return 1;\n case 'h': case 'H': return sizeof(__Pyx_pad_short) - sizeof(short);\n case 'i': case 'I': return sizeof(__Pyx_pad_int) - sizeof(int);\n case 'l': case 'L': return sizeof(__Pyx_pad_long) - sizeof(long);\n#ifdef HAVE_LONG_LONG\n case 'q': case 'Q': return sizeof(__Pyx_pad_longlong) - sizeof(PY_LONG_LONG);\n#endif\n case 'f': return sizeof(__Pyx_pad_float) - sizeof(float);\n case 'd': return sizeof(__Pyx_pad_double) - sizeof(double);\n case 'g': return sizeof(__Pyx_pad_longdouble) - sizeof(long double);\n case 'P': case 'O': return sizeof(__Pyx_pad_void_p) - sizeof(void*);\n default:\n __Pyx_BufFmt_RaiseUnexpectedChar(ch);\n return 0;\n }\n}\nstatic char __Pyx_BufFmt_TypeCharToGroup(char ch, int is_complex) {\n switch (ch) {\n case 'c':\n return 'H';\n case 'b': case 'h': case 'i':\n case 'l': case 'q': case 's': case 'p':\n return 'I';\n case 'B': case 'H': case 'I': case 'L': case 'Q':\n return 'U';\n case 'f': case 'd': case 'g':\n return (is_complex ? 'C' : 'R');\n case 'O':\n return 'O';\n case 'P':\n return 'P';\n default: {\n __Pyx_BufFmt_RaiseUnexpectedChar(ch);\n return 0;\n }\n }\n}\nstatic void __Pyx_BufFmt_RaiseExpected(__Pyx_BufFmt_Context* ctx) {\n if (ctx->head == NULL || ctx->head->field == &ctx->root) {\n const char* expected;\n const char* quote;\n if (ctx->head == NULL) {\n expected = \"end\";\n quote = \"\";\n } else {\n expected = ctx->head->field->type->name;\n quote = \"'\";\n }\n PyErr_Format(PyExc_ValueError,\n \"Buffer dtype mismatch, expected %s%s%s but got %s\",\n quote, expected, quote,\n __Pyx_BufFmt_DescribeTypeChar(ctx->enc_type, ctx->is_complex));\n } else {\n __Pyx_StructField* field = ctx->head->field;\n __Pyx_StructField* parent = (ctx->head - 1)->field;\n PyErr_Format(PyExc_ValueError,\n \"Buffer dtype mismatch, expected '%s' but got %s in '%s.%s'\",\n field->type->name, __Pyx_BufFmt_DescribeTypeChar(ctx->enc_type, ctx->is_complex),\n parent->type->name, field->name);\n }\n}\nstatic int __Pyx_BufFmt_ProcessTypeChunk(__Pyx_BufFmt_Context* ctx) {\n char group;\n size_t size, offset, arraysize = 1;\n if (ctx->enc_type == 0) return 0;\n if (ctx->head->field->type->arraysize[0]) {\n int i, ndim = 0;\n if (ctx->enc_type == 's' || ctx->enc_type == 'p') {\n ctx->is_valid_array = ctx->head->field->type->ndim == 1;\n ndim = 1;\n if (ctx->enc_count != ctx->head->field->type->arraysize[0]) {\n PyErr_Format(PyExc_ValueError,\n \"Expected a dimension of size %zu, got %zu\",\n ctx->head->field->type->arraysize[0], ctx->enc_count);\n return -1;\n }\n }\n if (!ctx->is_valid_array) {\n PyErr_Format(PyExc_ValueError, \"Expected %d dimensions, got %d\",\n ctx->head->field->type->ndim, ndim);\n return -1;\n }\n for (i = 0; i < ctx->head->field->type->ndim; i++) {\n arraysize *= ctx->head->field->type->arraysize[i];\n }\n ctx->is_valid_array = 0;\n ctx->enc_count = 1;\n }\n group = __Pyx_BufFmt_TypeCharToGroup(ctx->enc_type, ctx->is_complex);\n do {\n __Pyx_StructField* field = ctx->head->field;\n __Pyx_TypeInfo* type = field->type;\n if (ctx->enc_packmode == '@' || ctx->enc_packmode == '^') {\n size = __Pyx_BufFmt_TypeCharToNativeSize(ctx->enc_type, ctx->is_complex);\n } else {\n size = __Pyx_BufFmt_TypeCharToStandardSize(ctx->enc_type, ctx->is_complex);\n }\n if (ctx->enc_packmode == '@') {\n size_t align_at = __Pyx_BufFmt_TypeCharToAlignment(ctx->enc_type, ctx->is_complex);\n size_t align_mod_offset;\n if (align_at == 0) return -1;\n align_mod_offset = ctx->fmt_offset % align_at;\n if (align_mod_offset > 0) ctx->fmt_offset += align_at - align_mod_offset;\n if (ctx->struct_alignment == 0)\n ctx->struct_alignment = __Pyx_BufFmt_TypeCharToPadding(ctx->enc_type,\n ctx->is_complex);\n }\n if (type->size != size || type->typegroup != group) {\n if (type->typegroup == 'C' && type->fields != NULL) {\n size_t parent_offset = ctx->head->parent_offset + field->offset;\n ++ctx->head;\n ctx->head->field = type->fields;\n ctx->head->parent_offset = parent_offset;\n continue;\n }\n if ((type->typegroup == 'H' || group == 'H') && type->size == size) {\n } else {\n __Pyx_BufFmt_RaiseExpected(ctx);\n return -1;\n }\n }\n offset = ctx->head->parent_offset + field->offset;\n if (ctx->fmt_offset != offset) {\n PyErr_Format(PyExc_ValueError,\n \"Buffer dtype mismatch; next field is at offset %\" CYTHON_FORMAT_SSIZE_T \"d but %\" CYTHON_FORMAT_SSIZE_T \"d expected\",\n (Py_ssize_t)ctx->fmt_offset, (Py_ssize_t)offset);\n return -1;\n }\n ctx->fmt_offset += size;\n if (arraysize)\n ctx->fmt_offset += (arraysize - 1) * size;\n --ctx->enc_count; /* Consume from buffer string */\n while (1) {\n if (field == &ctx->root) {\n ctx->head = NULL;\n if (ctx->enc_count != 0) {\n __Pyx_BufFmt_RaiseExpected(ctx);\n return -1;\n }\n break; /* breaks both loops as ctx->enc_count == 0 */\n }\n ctx->head->field = ++field;\n if (field->type == NULL) {\n --ctx->head;\n field = ctx->head->field;\n continue;\n } else if (field->type->typegroup == 'S') {\n size_t parent_offset = ctx->head->parent_offset + field->offset;\n if (field->type->fields->type == NULL) continue; /* empty struct */\n field = field->type->fields;\n ++ctx->head;\n ctx->head->field = field;\n ctx->head->parent_offset = parent_offset;\n break;\n } else {\n break;\n }\n }\n } while (ctx->enc_count);\n ctx->enc_type = 0;\n ctx->is_complex = 0;\n return 0;\n}\nstatic CYTHON_INLINE PyObject *\n__pyx_buffmt_parse_array(__Pyx_BufFmt_Context* ctx, const char** tsp)\n{\n const char *ts = *tsp;\n int i = 0, number;\n int ndim = ctx->head->field->type->ndim;\n;\n ++ts;\n if (ctx->new_count != 1) {\n PyErr_SetString(PyExc_ValueError,\n \"Cannot handle repeated arrays in format string\");\n return NULL;\n }\n if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL;\n while (*ts && *ts != ')') {\n if (isspace(*ts))\n continue;\n number = __Pyx_BufFmt_ExpectNumber(&ts);\n if (number == -1) return NULL;\n if (i < ndim && (size_t) number != ctx->head->field->type->arraysize[i])\n return PyErr_Format(PyExc_ValueError,\n \"Expected a dimension of size %zu, got %d\",\n ctx->head->field->type->arraysize[i], number);\n if (*ts != ',' && *ts != ')')\n return PyErr_Format(PyExc_ValueError,\n \"Expected a comma in format string, got '%c'\", *ts);\n if (*ts == ',') ts++;\n i++;\n }\n if (i != ndim)\n return PyErr_Format(PyExc_ValueError, \"Expected %d dimension(s), got %d\",\n ctx->head->field->type->ndim, i);\n if (!*ts) {\n PyErr_SetString(PyExc_ValueError,\n \"Unexpected end of format string, expected ')'\");\n return NULL;\n }\n ctx->is_valid_array = 1;\n ctx->new_count = 1;\n *tsp = ++ts;\n return Py_None;\n}\nstatic const char* __Pyx_BufFmt_CheckString(__Pyx_BufFmt_Context* ctx, const char* ts) {\n int got_Z = 0;\n while (1) {\n switch(*ts) {\n case 0:\n if (ctx->enc_type != 0 && ctx->head == NULL) {\n __Pyx_BufFmt_RaiseExpected(ctx);\n return NULL;\n }\n if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL;\n if (ctx->head != NULL) {\n __Pyx_BufFmt_RaiseExpected(ctx);\n return NULL;\n }\n return ts;\n case ' ':\n case 10:\n case 13:\n ++ts;\n break;\n case '<':\n if (!__Pyx_IsLittleEndian()) {\n PyErr_SetString(PyExc_ValueError, \"Little-endian buffer not supported on big-endian compiler\");\n return NULL;\n }\n ctx->new_packmode = '=';\n ++ts;\n break;\n case '>':\n case '!':\n if (__Pyx_IsLittleEndian()) {\n PyErr_SetString(PyExc_ValueError, \"Big-endian buffer not supported on little-endian compiler\");\n return NULL;\n }\n ctx->new_packmode = '=';\n ++ts;\n break;\n case '=':\n case '@':\n case '^':\n ctx->new_packmode = *ts++;\n break;\n case 'T': /* substruct */\n {\n const char* ts_after_sub;\n size_t i, struct_count = ctx->new_count;\n size_t struct_alignment = ctx->struct_alignment;\n ctx->new_count = 1;\n ++ts;\n if (*ts != '{') {\n PyErr_SetString(PyExc_ValueError, \"Buffer acquisition: Expected '{' after 'T'\");\n return NULL;\n }\n if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL;\n ctx->enc_type = 0; /* Erase processed last struct element */\n ctx->enc_count = 0;\n ctx->struct_alignment = 0;\n ++ts;\n ts_after_sub = ts;\n for (i = 0; i != struct_count; ++i) {\n ts_after_sub = __Pyx_BufFmt_CheckString(ctx, ts);\n if (!ts_after_sub) return NULL;\n }\n ts = ts_after_sub;\n if (struct_alignment) ctx->struct_alignment = struct_alignment;\n }\n break;\n case '}': /* end of substruct; either repeat or move on */\n {\n size_t alignment = ctx->struct_alignment;\n ++ts;\n if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL;\n ctx->enc_type = 0; /* Erase processed last struct element */\n if (alignment && ctx->fmt_offset % alignment) {\n ctx->fmt_offset += alignment - (ctx->fmt_offset % alignment);\n }\n }\n return ts;\n case 'x':\n if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL;\n ctx->fmt_offset += ctx->new_count;\n ctx->new_count = 1;\n ctx->enc_count = 0;\n ctx->enc_type = 0;\n ctx->enc_packmode = ctx->new_packmode;\n ++ts;\n break;\n case 'Z':\n got_Z = 1;\n ++ts;\n if (*ts != 'f' && *ts != 'd' && *ts != 'g') {\n __Pyx_BufFmt_RaiseUnexpectedChar('Z');\n return NULL;\n } /* fall through */\n case 'c': case 'b': case 'B': case 'h': case 'H': case 'i': case 'I':\n case 'l': case 'L': case 'q': case 'Q':\n case 'f': case 'd': case 'g':\n case 'O': case 's': case 'p':\n if (ctx->enc_type == *ts && got_Z == ctx->is_complex &&\n ctx->enc_packmode == ctx->new_packmode) {\n ctx->enc_count += ctx->new_count;\n } else {\n if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL;\n ctx->enc_count = ctx->new_count;\n ctx->enc_packmode = ctx->new_packmode;\n ctx->enc_type = *ts;\n ctx->is_complex = got_Z;\n }\n ++ts;\n ctx->new_count = 1;\n got_Z = 0;\n break;\n case ':':\n ++ts;\n while(*ts != ':') ++ts;\n ++ts;\n break;\n case '(':\n if (!__pyx_buffmt_parse_array(ctx, &ts)) return NULL;\n break;\n default:\n {\n int number = __Pyx_BufFmt_ExpectNumber(&ts);\n if (number == -1) return NULL;\n ctx->new_count = (size_t)number;\n }\n }\n }\n}\nstatic CYTHON_INLINE void __Pyx_ZeroBuffer(Py_buffer* buf) {\n buf->buf = NULL;\n buf->obj = NULL;\n buf->strides = __Pyx_zeros;\n buf->shape = __Pyx_zeros;\n buf->suboffsets = __Pyx_minusones;\n}\nstatic CYTHON_INLINE int __Pyx_GetBufferAndValidate(\n Py_buffer* buf, PyObject* obj, __Pyx_TypeInfo* dtype, int flags,\n int nd, int cast, __Pyx_BufFmt_StackElem* stack)\n{\n if (obj == Py_None || obj == NULL) {\n __Pyx_ZeroBuffer(buf);\n return 0;\n }\n buf->buf = NULL;\n if (__Pyx_GetBuffer(obj, buf, flags) == -1) goto fail;\n if (buf->ndim != nd) {\n PyErr_Format(PyExc_ValueError,\n \"Buffer has wrong number of dimensions (expected %d, got %d)\",\n nd, buf->ndim);\n goto fail;\n }\n if (!cast) {\n __Pyx_BufFmt_Context ctx;\n __Pyx_BufFmt_Init(&ctx, stack, dtype);\n if (!__Pyx_BufFmt_CheckString(&ctx, buf->format)) goto fail;\n }\n if ((unsigned)buf->itemsize != dtype->size) {\n PyErr_Format(PyExc_ValueError,\n \"Item size of buffer (%\" CYTHON_FORMAT_SSIZE_T \"d byte%s) does not match size of '%s' (%\" CYTHON_FORMAT_SSIZE_T \"d byte%s)\",\n buf->itemsize, (buf->itemsize > 1) ? \"s\" : \"\",\n dtype->name, (Py_ssize_t)dtype->size, (dtype->size > 1) ? \"s\" : \"\");\n goto fail;\n }\n if (buf->suboffsets == NULL) buf->suboffsets = __Pyx_minusones;\n return 0;\nfail:;\n __Pyx_ZeroBuffer(buf);\n return -1;\n}\nstatic CYTHON_INLINE void __Pyx_SafeReleaseBuffer(Py_buffer* info) {\n if (info->buf == NULL) return;\n if (info->suboffsets == __Pyx_minusones) info->suboffsets = NULL;\n __Pyx_ReleaseBuffer(info);\n}\n\nstatic CYTHON_INLINE int __Pyx_TypeTest(PyObject *obj, PyTypeObject *type) {\n if (unlikely(!type)) {\n PyErr_Format(PyExc_SystemError, \"Missing type object\");\n return 0;\n }\n if (likely(PyObject_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\nstatic void __Pyx_RaiseBufferFallbackError(void) {\n PyErr_Format(PyExc_ValueError,\n \"Buffer acquisition failed on assignment; and then reacquiring the old buffer failed too!\");\n}\n\nstatic 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\nstatic CYTHON_INLINE void __Pyx_RaiseNeedMoreValuesError(Py_ssize_t index) {\n PyErr_Format(PyExc_ValueError,\n \"need more than %\" CYTHON_FORMAT_SSIZE_T \"d value%s to unpack\",\n index, (index == 1) ? \"\" : \"s\");\n}\n\nstatic CYTHON_INLINE void __Pyx_RaiseNoneNotIterableError(void) {\n PyErr_SetString(PyExc_TypeError, \"'NoneType' object is not iterable\");\n}\n\nstatic CYTHON_INLINE int __Pyx_IterFinish(void) {\n#if CYTHON_COMPILING_IN_CPYTHON\n PyThreadState *tstate = PyThreadState_GET();\n PyObject* exc_type = tstate->curexc_type;\n if (unlikely(exc_type)) {\n if (likely(exc_type == PyExc_StopIteration) || 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\nstatic 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#if PY_MAJOR_VERSION < 3\nstatic int __Pyx_GetBuffer(PyObject *obj, Py_buffer *view, int flags) {\n CYTHON_UNUSED PyObject *getbuffer_cobj;\n #if PY_VERSION_HEX >= 0x02060000\n if (PyObject_CheckBuffer(obj)) return PyObject_GetBuffer(obj, view, flags);\n #endif\n if (PyObject_TypeCheck(obj, __pyx_ptype_5numpy_ndarray)) return __pyx_pw_5numpy_7ndarray_1__getbuffer__(obj, view, flags);\n #if PY_VERSION_HEX < 0x02060000\n if (obj->ob_type->tp_dict &&\n (getbuffer_cobj = PyMapping_GetItemString(obj->ob_type->tp_dict,\n \"__pyx_getbuffer\"))) {\n getbufferproc func;\n #if PY_VERSION_HEX >= 0x02070000 && !(PY_MAJOR_VERSION == 3 && PY_MINOR_VERSION == 0)\n func = (getbufferproc) PyCapsule_GetPointer(getbuffer_cobj, \"getbuffer(obj, view, flags)\");\n #else\n func = (getbufferproc) PyCObject_AsVoidPtr(getbuffer_cobj);\n #endif\n Py_DECREF(getbuffer_cobj);\n if (!func)\n goto fail;\n return func(obj, view, flags);\n } else {\n PyErr_Clear();\n }\n #endif\n PyErr_Format(PyExc_TypeError, \"'%100s' does not have the buffer interface\", Py_TYPE(obj)->tp_name);\n#if PY_VERSION_HEX < 0x02060000\nfail:\n#endif\n return -1;\n}\nstatic void __Pyx_ReleaseBuffer(Py_buffer *view) {\n PyObject *obj = view->obj;\n CYTHON_UNUSED PyObject *releasebuffer_cobj;\n if (!obj) return;\n #if PY_VERSION_HEX >= 0x02060000\n if (PyObject_CheckBuffer(obj)) {\n PyBuffer_Release(view);\n return;\n }\n #endif\n if (PyObject_TypeCheck(obj, __pyx_ptype_5numpy_ndarray)) { __pyx_pw_5numpy_7ndarray_3__releasebuffer__(obj, view); return; }\n #if PY_VERSION_HEX < 0x02060000\n if (obj->ob_type->tp_dict &&\n (releasebuffer_cobj = PyMapping_GetItemString(obj->ob_type->tp_dict,\n \"__pyx_releasebuffer\"))) {\n releasebufferproc func;\n #if PY_VERSION_HEX >= 0x02070000 && !(PY_MAJOR_VERSION == 3 && PY_MINOR_VERSION == 0)\n func = (releasebufferproc) PyCapsule_GetPointer(releasebuffer_cobj, \"releasebuffer(obj, view)\");\n #else\n func = (releasebufferproc) PyCObject_AsVoidPtr(releasebuffer_cobj);\n #endif\n Py_DECREF(releasebuffer_cobj);\n if (!func)\n goto fail;\n func(obj, view);\n return;\n } else {\n PyErr_Clear();\n }\n #endif\n goto nofail;\n#if PY_VERSION_HEX < 0x02060000\nfail:\n#endif\n PyErr_WriteUnraisable(obj);\nnofail:\n Py_DECREF(obj);\n view->obj = NULL;\n}\n#endif /* PY_MAJOR_VERSION < 3 */\n\n\n static PyObject *__Pyx_Import(PyObject *name, PyObject *from_list, long level) {\n PyObject *py_import = 0;\n PyObject *empty_list = 0;\n PyObject *module = 0;\n PyObject *global_dict = 0;\n PyObject *empty_dict = 0;\n PyObject *list;\n py_import = __Pyx_GetAttrString(__pyx_b, \"__import__\");\n if (!py_import)\n goto bad;\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 #if PY_VERSION_HEX >= 0x02050000\n {\n #if PY_MAJOR_VERSION >= 3\n if (level == -1) {\n if (strchr(__Pyx_MODULE_NAME, '.')) {\n /* try package relative import first */\n PyObject *py_level = PyInt_FromLong(1);\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 if (!module) {\n if (!PyErr_ExceptionMatches(PyExc_ImportError))\n goto bad;\n PyErr_Clear();\n }\n }\n level = 0; /* try absolute import on failure */\n }\n #endif\n if (!module) {\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 }\n }\n #else\n if (level>0) {\n PyErr_SetString(PyExc_RuntimeError, \"Relative import is not supported for Python <=2.4.\");\n goto bad;\n }\n module = PyObject_CallFunctionObjArgs(py_import,\n name, global_dict, empty_dict, list, NULL);\n #endif\nbad:\n Py_XDECREF(empty_list);\n Py_XDECREF(py_import);\n Py_XDECREF(empty_dict);\n return module;\n}\n\nstatic CYTHON_INLINE void __Pyx_RaiseImportError(PyObject *name) {\n#if PY_MAJOR_VERSION < 3\n PyErr_Format(PyExc_ImportError, \"cannot import name %.230s\",\n PyString_AsString(name));\n#else\n PyErr_Format(PyExc_ImportError, \"cannot import name %S\", name);\n#endif\n}\n\n#if !CYTHON_COMPILING_IN_PYPY && PY_MAJOR_VERSION < 3\nstatic PyObject *__Pyx_GetStdout(void) {\n PyObject *f = PySys_GetObject((char *)\"stdout\");\n if (!f) {\n PyErr_SetString(PyExc_RuntimeError, \"lost sys.stdout\");\n }\n return f;\n}\nstatic int __Pyx_Print(PyObject* f, PyObject *arg_tuple, int newline) {\n int i;\n if (!f) {\n if (!(f = __Pyx_GetStdout()))\n return -1;\n }\n Py_INCREF(f);\n for (i=0; i < PyTuple_GET_SIZE(arg_tuple); i++) {\n PyObject* v;\n if (PyFile_SoftSpace(f, 1)) {\n if (PyFile_WriteString(\" \", f) < 0)\n goto error;\n }\n v = PyTuple_GET_ITEM(arg_tuple, i);\n if (PyFile_WriteObject(v, f, Py_PRINT_RAW) < 0)\n goto error;\n if (PyString_Check(v)) {\n char *s = PyString_AsString(v);\n Py_ssize_t len = PyString_Size(v);\n if (len > 0 &&\n isspace(Py_CHARMASK(s[len-1])) &&\n s[len-1] != ' ')\n PyFile_SoftSpace(f, 0);\n }\n }\n if (newline) {\n if (PyFile_WriteString(\"\\n\", f) < 0)\n goto error;\n PyFile_SoftSpace(f, 0);\n }\n Py_DECREF(f);\n return 0;\nerror:\n Py_DECREF(f);\n return -1;\n}\n#else /* Python 3 has a print function */\nstatic int __Pyx_Print(PyObject* stream, PyObject *arg_tuple, int newline) {\n PyObject* kwargs = 0;\n PyObject* result = 0;\n PyObject* end_string;\n if (unlikely(!__pyx_print)) {\n __pyx_print = __Pyx_GetAttrString(__pyx_b, \"print\");\n if (!__pyx_print)\n return -1;\n }\n if (stream) {\n kwargs = PyDict_New();\n if (unlikely(!kwargs))\n return -1;\n if (unlikely(PyDict_SetItemString(kwargs, \"file\", stream) < 0))\n goto bad;\n if (!newline) {\n end_string = PyUnicode_FromStringAndSize(\" \", 1);\n if (unlikely(!end_string))\n goto bad;\n if (PyDict_SetItemString(kwargs, \"end\", end_string) < 0) {\n Py_DECREF(end_string);\n goto bad;\n }\n Py_DECREF(end_string);\n }\n } else if (!newline) {\n if (unlikely(!__pyx_print_kwargs)) {\n __pyx_print_kwargs = PyDict_New();\n if (unlikely(!__pyx_print_kwargs))\n return -1;\n end_string = PyUnicode_FromStringAndSize(\" \", 1);\n if (unlikely(!end_string))\n return -1;\n if (PyDict_SetItemString(__pyx_print_kwargs, \"end\", end_string) < 0) {\n Py_DECREF(end_string);\n return -1;\n }\n Py_DECREF(end_string);\n }\n kwargs = __pyx_print_kwargs;\n }\n result = PyObject_Call(__pyx_print, arg_tuple, kwargs);\n if (unlikely(kwargs) && (kwargs != __pyx_print_kwargs))\n Py_DECREF(kwargs);\n if (!result)\n return -1;\n Py_DECREF(result);\n return 0;\nbad:\n if (kwargs != __pyx_print_kwargs)\n Py_XDECREF(kwargs);\n return -1;\n}\n#endif\n\n#if !CYTHON_COMPILING_IN_PYPY && PY_MAJOR_VERSION < 3\nstatic int __Pyx_PrintOne(PyObject* f, PyObject *o) {\n if (!f) {\n if (!(f = __Pyx_GetStdout()))\n return -1;\n }\n Py_INCREF(f);\n if (PyFile_SoftSpace(f, 0)) {\n if (PyFile_WriteString(\" \", f) < 0)\n goto error;\n }\n if (PyFile_WriteObject(o, f, Py_PRINT_RAW) < 0)\n goto error;\n if (PyFile_WriteString(\"\\n\", f) < 0)\n goto error;\n Py_DECREF(f);\n return 0;\nerror:\n Py_DECREF(f);\n return -1;\n /* the line below is just to avoid C compiler\n * warnings about unused functions */\n return __Pyx_Print(f, NULL, 0);\n}\n#else /* Python 3 has a print function */\nstatic int __Pyx_PrintOne(PyObject* stream, PyObject *o) {\n int res;\n PyObject* arg_tuple = PyTuple_Pack(1, o);\n if (unlikely(!arg_tuple))\n return -1;\n res = __Pyx_Print(stream, arg_tuple, 1);\n Py_DECREF(arg_tuple);\n return res;\n}\n#endif\n\n#if CYTHON_CCOMPLEX\n #ifdef __cplusplus\n static CYTHON_INLINE __pyx_t_float_complex __pyx_t_float_complex_from_parts(float x, float y) {\n return ::std::complex< float >(x, y);\n }\n #else\n static CYTHON_INLINE __pyx_t_float_complex __pyx_t_float_complex_from_parts(float x, float y) {\n return x + y*(__pyx_t_float_complex)_Complex_I;\n }\n #endif\n#else\n static CYTHON_INLINE __pyx_t_float_complex __pyx_t_float_complex_from_parts(float x, float y) {\n __pyx_t_float_complex z;\n z.real = x;\n z.imag = y;\n return z;\n }\n#endif\n\n#if CYTHON_CCOMPLEX\n#else\n static CYTHON_INLINE int __Pyx_c_eqf(__pyx_t_float_complex a, __pyx_t_float_complex b) {\n return (a.real == b.real) && (a.imag == b.imag);\n }\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_sumf(__pyx_t_float_complex a, __pyx_t_float_complex b) {\n __pyx_t_float_complex z;\n z.real = a.real + b.real;\n z.imag = a.imag + b.imag;\n return z;\n }\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_difff(__pyx_t_float_complex a, __pyx_t_float_complex b) {\n __pyx_t_float_complex z;\n z.real = a.real - b.real;\n z.imag = a.imag - b.imag;\n return z;\n }\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_prodf(__pyx_t_float_complex a, __pyx_t_float_complex b) {\n __pyx_t_float_complex z;\n z.real = a.real * b.real - a.imag * b.imag;\n z.imag = a.real * b.imag + a.imag * b.real;\n return z;\n }\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_quotf(__pyx_t_float_complex a, __pyx_t_float_complex b) {\n __pyx_t_float_complex z;\n float denom = b.real * b.real + b.imag * b.imag;\n z.real = (a.real * b.real + a.imag * b.imag) / denom;\n z.imag = (a.imag * b.real - a.real * b.imag) / denom;\n return z;\n }\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_negf(__pyx_t_float_complex a) {\n __pyx_t_float_complex z;\n z.real = -a.real;\n z.imag = -a.imag;\n return z;\n }\n static CYTHON_INLINE int __Pyx_c_is_zerof(__pyx_t_float_complex a) {\n return (a.real == 0) && (a.imag == 0);\n }\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_conjf(__pyx_t_float_complex a) {\n __pyx_t_float_complex z;\n z.real = a.real;\n z.imag = -a.imag;\n return z;\n }\n #if 1\n static CYTHON_INLINE float __Pyx_c_absf(__pyx_t_float_complex z) {\n #if !defined(HAVE_HYPOT) || defined(_MSC_VER)\n return sqrtf(z.real*z.real + z.imag*z.imag);\n #else\n return hypotf(z.real, z.imag);\n #endif\n }\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_powf(__pyx_t_float_complex a, __pyx_t_float_complex b) {\n __pyx_t_float_complex z;\n float r, lnr, theta, z_r, z_theta;\n if (b.imag == 0 && b.real == (int)b.real) {\n if (b.real < 0) {\n float denom = a.real * a.real + a.imag * a.imag;\n a.real = a.real / denom;\n a.imag = -a.imag / denom;\n b.real = -b.real;\n }\n switch ((int)b.real) {\n case 0:\n z.real = 1;\n z.imag = 0;\n return z;\n case 1:\n return a;\n case 2:\n z = __Pyx_c_prodf(a, a);\n return __Pyx_c_prodf(a, a);\n case 3:\n z = __Pyx_c_prodf(a, a);\n return __Pyx_c_prodf(z, a);\n case 4:\n z = __Pyx_c_prodf(a, a);\n return __Pyx_c_prodf(z, z);\n }\n }\n if (a.imag == 0) {\n if (a.real == 0) {\n return a;\n }\n r = a.real;\n theta = 0;\n } else {\n r = __Pyx_c_absf(a);\n theta = atan2f(a.imag, a.real);\n }\n lnr = logf(r);\n z_r = expf(lnr * b.real - theta * b.imag);\n z_theta = theta * b.real + lnr * b.imag;\n z.real = z_r * cosf(z_theta);\n z.imag = z_r * sinf(z_theta);\n return z;\n }\n #endif\n#endif\n\n#if CYTHON_CCOMPLEX\n #ifdef __cplusplus\n static CYTHON_INLINE __pyx_t_double_complex __pyx_t_double_complex_from_parts(double x, double y) {\n return ::std::complex< double >(x, y);\n }\n #else\n static CYTHON_INLINE __pyx_t_double_complex __pyx_t_double_complex_from_parts(double x, double y) {\n return x + y*(__pyx_t_double_complex)_Complex_I;\n }\n #endif\n#else\n static CYTHON_INLINE __pyx_t_double_complex __pyx_t_double_complex_from_parts(double x, double y) {\n __pyx_t_double_complex z;\n z.real = x;\n z.imag = y;\n return z;\n }\n#endif\n\n#if CYTHON_CCOMPLEX\n#else\n static CYTHON_INLINE int __Pyx_c_eq(__pyx_t_double_complex a, __pyx_t_double_complex b) {\n return (a.real == b.real) && (a.imag == b.imag);\n }\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_sum(__pyx_t_double_complex a, __pyx_t_double_complex b) {\n __pyx_t_double_complex z;\n z.real = a.real + b.real;\n z.imag = a.imag + b.imag;\n return z;\n }\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_diff(__pyx_t_double_complex a, __pyx_t_double_complex b) {\n __pyx_t_double_complex z;\n z.real = a.real - b.real;\n z.imag = a.imag - b.imag;\n return z;\n }\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_prod(__pyx_t_double_complex a, __pyx_t_double_complex b) {\n __pyx_t_double_complex z;\n z.real = a.real * b.real - a.imag * b.imag;\n z.imag = a.real * b.imag + a.imag * b.real;\n return z;\n }\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_quot(__pyx_t_double_complex a, __pyx_t_double_complex b) {\n __pyx_t_double_complex z;\n double denom = b.real * b.real + b.imag * b.imag;\n z.real = (a.real * b.real + a.imag * b.imag) / denom;\n z.imag = (a.imag * b.real - a.real * b.imag) / denom;\n return z;\n }\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_neg(__pyx_t_double_complex a) {\n __pyx_t_double_complex z;\n z.real = -a.real;\n z.imag = -a.imag;\n return z;\n }\n static CYTHON_INLINE int __Pyx_c_is_zero(__pyx_t_double_complex a) {\n return (a.real == 0) && (a.imag == 0);\n }\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_conj(__pyx_t_double_complex a) {\n __pyx_t_double_complex z;\n z.real = a.real;\n z.imag = -a.imag;\n return z;\n }\n #if 1\n static CYTHON_INLINE double __Pyx_c_abs(__pyx_t_double_complex z) {\n #if !defined(HAVE_HYPOT) || defined(_MSC_VER)\n return sqrt(z.real*z.real + z.imag*z.imag);\n #else\n return hypot(z.real, z.imag);\n #endif\n }\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_pow(__pyx_t_double_complex a, __pyx_t_double_complex b) {\n __pyx_t_double_complex z;\n double r, lnr, theta, z_r, z_theta;\n if (b.imag == 0 && b.real == (int)b.real) {\n if (b.real < 0) {\n double denom = a.real * a.real + a.imag * a.imag;\n a.real = a.real / denom;\n a.imag = -a.imag / denom;\n b.real = -b.real;\n }\n switch ((int)b.real) {\n case 0:\n z.real = 1;\n z.imag = 0;\n return z;\n case 1:\n return a;\n case 2:\n z = __Pyx_c_prod(a, a);\n return __Pyx_c_prod(a, a);\n case 3:\n z = __Pyx_c_prod(a, a);\n return __Pyx_c_prod(z, a);\n case 4:\n z = __Pyx_c_prod(a, a);\n return __Pyx_c_prod(z, z);\n }\n }\n if (a.imag == 0) {\n if (a.real == 0) {\n return a;\n }\n r = a.real;\n theta = 0;\n } else {\n r = __Pyx_c_abs(a);\n theta = atan2(a.imag, a.real);\n }\n lnr = log(r);\n z_r = exp(lnr * b.real - theta * b.imag);\n z_theta = theta * b.real + lnr * b.imag;\n z.real = z_r * cos(z_theta);\n z.imag = z_r * sin(z_theta);\n return z;\n }\n #endif\n#endif\n\nstatic CYTHON_INLINE unsigned char __Pyx_PyInt_AsUnsignedChar(PyObject* x) {\n const unsigned char neg_one = (unsigned char)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n if (sizeof(unsigned char) < sizeof(long)) {\n long val = __Pyx_PyInt_AsLong(x);\n if (unlikely(val != (long)(unsigned char)val)) {\n if (!unlikely(val == -1 && PyErr_Occurred())) {\n PyErr_SetString(PyExc_OverflowError,\n (is_unsigned && unlikely(val < 0)) ?\n \"can't convert negative value to unsigned char\" :\n \"value too large to convert to unsigned char\");\n }\n return (unsigned char)-1;\n }\n return (unsigned char)val;\n }\n return (unsigned char)__Pyx_PyInt_AsUnsignedLong(x);\n}\n\nstatic CYTHON_INLINE unsigned short __Pyx_PyInt_AsUnsignedShort(PyObject* x) {\n const unsigned short neg_one = (unsigned short)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n if (sizeof(unsigned short) < sizeof(long)) {\n long val = __Pyx_PyInt_AsLong(x);\n if (unlikely(val != (long)(unsigned short)val)) {\n if (!unlikely(val == -1 && PyErr_Occurred())) {\n PyErr_SetString(PyExc_OverflowError,\n (is_unsigned && unlikely(val < 0)) ?\n \"can't convert negative value to unsigned short\" :\n \"value too large to convert to unsigned short\");\n }\n return (unsigned short)-1;\n }\n return (unsigned short)val;\n }\n return (unsigned short)__Pyx_PyInt_AsUnsignedLong(x);\n}\n\nstatic CYTHON_INLINE unsigned int __Pyx_PyInt_AsUnsignedInt(PyObject* x) {\n const unsigned int neg_one = (unsigned int)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n if (sizeof(unsigned int) < sizeof(long)) {\n long val = __Pyx_PyInt_AsLong(x);\n if (unlikely(val != (long)(unsigned int)val)) {\n if (!unlikely(val == -1 && PyErr_Occurred())) {\n PyErr_SetString(PyExc_OverflowError,\n (is_unsigned && unlikely(val < 0)) ?\n \"can't convert negative value to unsigned int\" :\n \"value too large to convert to unsigned int\");\n }\n return (unsigned int)-1;\n }\n return (unsigned int)val;\n }\n return (unsigned int)__Pyx_PyInt_AsUnsignedLong(x);\n}\n\nstatic CYTHON_INLINE char __Pyx_PyInt_AsChar(PyObject* x) {\n const char neg_one = (char)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n if (sizeof(char) < sizeof(long)) {\n long val = __Pyx_PyInt_AsLong(x);\n if (unlikely(val != (long)(char)val)) {\n if (!unlikely(val == -1 && PyErr_Occurred())) {\n PyErr_SetString(PyExc_OverflowError,\n (is_unsigned && unlikely(val < 0)) ?\n \"can't convert negative value to char\" :\n \"value too large to convert to char\");\n }\n return (char)-1;\n }\n return (char)val;\n }\n return (char)__Pyx_PyInt_AsLong(x);\n}\n\nstatic CYTHON_INLINE short __Pyx_PyInt_AsShort(PyObject* x) {\n const short neg_one = (short)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n if (sizeof(short) < sizeof(long)) {\n long val = __Pyx_PyInt_AsLong(x);\n if (unlikely(val != (long)(short)val)) {\n if (!unlikely(val == -1 && PyErr_Occurred())) {\n PyErr_SetString(PyExc_OverflowError,\n (is_unsigned && unlikely(val < 0)) ?\n \"can't convert negative value to short\" :\n \"value too large to convert to short\");\n }\n return (short)-1;\n }\n return (short)val;\n }\n return (short)__Pyx_PyInt_AsLong(x);\n}\n\nstatic CYTHON_INLINE int __Pyx_PyInt_AsInt(PyObject* x) {\n const int neg_one = (int)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n if (sizeof(int) < sizeof(long)) {\n long val = __Pyx_PyInt_AsLong(x);\n if (unlikely(val != (long)(int)val)) {\n if (!unlikely(val == -1 && PyErr_Occurred())) {\n PyErr_SetString(PyExc_OverflowError,\n (is_unsigned && unlikely(val < 0)) ?\n \"can't convert negative value to int\" :\n \"value too large to convert to int\");\n }\n return (int)-1;\n }\n return (int)val;\n }\n return (int)__Pyx_PyInt_AsLong(x);\n}\n\nstatic CYTHON_INLINE signed char __Pyx_PyInt_AsSignedChar(PyObject* x) {\n const signed char neg_one = (signed char)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n if (sizeof(signed char) < sizeof(long)) {\n long val = __Pyx_PyInt_AsLong(x);\n if (unlikely(val != (long)(signed char)val)) {\n if (!unlikely(val == -1 && PyErr_Occurred())) {\n PyErr_SetString(PyExc_OverflowError,\n (is_unsigned && unlikely(val < 0)) ?\n \"can't convert negative value to signed char\" :\n \"value too large to convert to signed char\");\n }\n return (signed char)-1;\n }\n return (signed char)val;\n }\n return (signed char)__Pyx_PyInt_AsSignedLong(x);\n}\n\nstatic CYTHON_INLINE signed short __Pyx_PyInt_AsSignedShort(PyObject* x) {\n const signed short neg_one = (signed short)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n if (sizeof(signed short) < sizeof(long)) {\n long val = __Pyx_PyInt_AsLong(x);\n if (unlikely(val != (long)(signed short)val)) {\n if (!unlikely(val == -1 && PyErr_Occurred())) {\n PyErr_SetString(PyExc_OverflowError,\n (is_unsigned && unlikely(val < 0)) ?\n \"can't convert negative value to signed short\" :\n \"value too large to convert to signed short\");\n }\n return (signed short)-1;\n }\n return (signed short)val;\n }\n return (signed short)__Pyx_PyInt_AsSignedLong(x);\n}\n\nstatic CYTHON_INLINE signed int __Pyx_PyInt_AsSignedInt(PyObject* x) {\n const signed int neg_one = (signed int)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n if (sizeof(signed int) < sizeof(long)) {\n long val = __Pyx_PyInt_AsLong(x);\n if (unlikely(val != (long)(signed int)val)) {\n if (!unlikely(val == -1 && PyErr_Occurred())) {\n PyErr_SetString(PyExc_OverflowError,\n (is_unsigned && unlikely(val < 0)) ?\n \"can't convert negative value to signed int\" :\n \"value too large to convert to signed int\");\n }\n return (signed int)-1;\n }\n return (signed int)val;\n }\n return (signed int)__Pyx_PyInt_AsSignedLong(x);\n}\n\nstatic CYTHON_INLINE int __Pyx_PyInt_AsLongDouble(PyObject* x) {\n const int neg_one = (int)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n if (sizeof(int) < sizeof(long)) {\n long val = __Pyx_PyInt_AsLong(x);\n if (unlikely(val != (long)(int)val)) {\n if (!unlikely(val == -1 && PyErr_Occurred())) {\n PyErr_SetString(PyExc_OverflowError,\n (is_unsigned && unlikely(val < 0)) ?\n \"can't convert negative value to int\" :\n \"value too large to convert to int\");\n }\n return (int)-1;\n }\n return (int)val;\n }\n return (int)__Pyx_PyInt_AsLong(x);\n}\n\nstatic CYTHON_INLINE unsigned long __Pyx_PyInt_AsUnsignedLong(PyObject* x) {\n const unsigned long neg_one = (unsigned long)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n#if PY_VERSION_HEX < 0x03000000\n if (likely(PyInt_Check(x))) {\n long val = PyInt_AS_LONG(x);\n if (is_unsigned && unlikely(val < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to unsigned long\");\n return (unsigned long)-1;\n }\n return (unsigned long)val;\n } else\n#endif\n if (likely(PyLong_Check(x))) {\n if (is_unsigned) {\n if (unlikely(Py_SIZE(x) < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to unsigned long\");\n return (unsigned long)-1;\n }\n return (unsigned long)PyLong_AsUnsignedLong(x);\n } else {\n return (unsigned long)PyLong_AsLong(x);\n }\n } else {\n unsigned long val;\n PyObject *tmp = __Pyx_PyNumber_Int(x);\n if (!tmp) return (unsigned long)-1;\n val = __Pyx_PyInt_AsUnsignedLong(tmp);\n Py_DECREF(tmp);\n return val;\n }\n}\n\nstatic CYTHON_INLINE unsigned PY_LONG_LONG __Pyx_PyInt_AsUnsignedLongLong(PyObject* x) {\n const unsigned PY_LONG_LONG neg_one = (unsigned PY_LONG_LONG)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n#if PY_VERSION_HEX < 0x03000000\n if (likely(PyInt_Check(x))) {\n long val = PyInt_AS_LONG(x);\n if (is_unsigned && unlikely(val < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to unsigned PY_LONG_LONG\");\n return (unsigned PY_LONG_LONG)-1;\n }\n return (unsigned PY_LONG_LONG)val;\n } else\n#endif\n if (likely(PyLong_Check(x))) {\n if (is_unsigned) {\n if (unlikely(Py_SIZE(x) < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to unsigned PY_LONG_LONG\");\n return (unsigned PY_LONG_LONG)-1;\n }\n return (unsigned PY_LONG_LONG)PyLong_AsUnsignedLongLong(x);\n } else {\n return (unsigned PY_LONG_LONG)PyLong_AsLongLong(x);\n }\n } else {\n unsigned PY_LONG_LONG val;\n PyObject *tmp = __Pyx_PyNumber_Int(x);\n if (!tmp) return (unsigned PY_LONG_LONG)-1;\n val = __Pyx_PyInt_AsUnsignedLongLong(tmp);\n Py_DECREF(tmp);\n return val;\n }\n}\n\nstatic CYTHON_INLINE long __Pyx_PyInt_AsLong(PyObject* x) {\n const long neg_one = (long)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n#if PY_VERSION_HEX < 0x03000000\n if (likely(PyInt_Check(x))) {\n long val = PyInt_AS_LONG(x);\n if (is_unsigned && unlikely(val < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to long\");\n return (long)-1;\n }\n return (long)val;\n } else\n#endif\n if (likely(PyLong_Check(x))) {\n if (is_unsigned) {\n if (unlikely(Py_SIZE(x) < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to long\");\n return (long)-1;\n }\n return (long)PyLong_AsUnsignedLong(x);\n } else {\n return (long)PyLong_AsLong(x);\n }\n } else {\n long val;\n PyObject *tmp = __Pyx_PyNumber_Int(x);\n if (!tmp) return (long)-1;\n val = __Pyx_PyInt_AsLong(tmp);\n Py_DECREF(tmp);\n return val;\n }\n}\n\nstatic CYTHON_INLINE PY_LONG_LONG __Pyx_PyInt_AsLongLong(PyObject* x) {\n const PY_LONG_LONG neg_one = (PY_LONG_LONG)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n#if PY_VERSION_HEX < 0x03000000\n if (likely(PyInt_Check(x))) {\n long val = PyInt_AS_LONG(x);\n if (is_unsigned && unlikely(val < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to PY_LONG_LONG\");\n return (PY_LONG_LONG)-1;\n }\n return (PY_LONG_LONG)val;\n } else\n#endif\n if (likely(PyLong_Check(x))) {\n if (is_unsigned) {\n if (unlikely(Py_SIZE(x) < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to PY_LONG_LONG\");\n return (PY_LONG_LONG)-1;\n }\n return (PY_LONG_LONG)PyLong_AsUnsignedLongLong(x);\n } else {\n return (PY_LONG_LONG)PyLong_AsLongLong(x);\n }\n } else {\n PY_LONG_LONG val;\n PyObject *tmp = __Pyx_PyNumber_Int(x);\n if (!tmp) return (PY_LONG_LONG)-1;\n val = __Pyx_PyInt_AsLongLong(tmp);\n Py_DECREF(tmp);\n return val;\n }\n}\n\nstatic CYTHON_INLINE signed long __Pyx_PyInt_AsSignedLong(PyObject* x) {\n const signed long neg_one = (signed long)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n#if PY_VERSION_HEX < 0x03000000\n if (likely(PyInt_Check(x))) {\n long val = PyInt_AS_LONG(x);\n if (is_unsigned && unlikely(val < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to signed long\");\n return (signed long)-1;\n }\n return (signed long)val;\n } else\n#endif\n if (likely(PyLong_Check(x))) {\n if (is_unsigned) {\n if (unlikely(Py_SIZE(x) < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to signed long\");\n return (signed long)-1;\n }\n return (signed long)PyLong_AsUnsignedLong(x);\n } else {\n return (signed long)PyLong_AsLong(x);\n }\n } else {\n signed long val;\n PyObject *tmp = __Pyx_PyNumber_Int(x);\n if (!tmp) return (signed long)-1;\n val = __Pyx_PyInt_AsSignedLong(tmp);\n Py_DECREF(tmp);\n return val;\n }\n}\n\nstatic CYTHON_INLINE signed PY_LONG_LONG __Pyx_PyInt_AsSignedLongLong(PyObject* x) {\n const signed PY_LONG_LONG neg_one = (signed PY_LONG_LONG)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n#if PY_VERSION_HEX < 0x03000000\n if (likely(PyInt_Check(x))) {\n long val = PyInt_AS_LONG(x);\n if (is_unsigned && unlikely(val < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to signed PY_LONG_LONG\");\n return (signed PY_LONG_LONG)-1;\n }\n return (signed PY_LONG_LONG)val;\n } else\n#endif\n if (likely(PyLong_Check(x))) {\n if (is_unsigned) {\n if (unlikely(Py_SIZE(x) < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to signed PY_LONG_LONG\");\n return (signed PY_LONG_LONG)-1;\n }\n return (signed PY_LONG_LONG)PyLong_AsUnsignedLongLong(x);\n } else {\n return (signed PY_LONG_LONG)PyLong_AsLongLong(x);\n }\n } else {\n signed PY_LONG_LONG val;\n PyObject *tmp = __Pyx_PyNumber_Int(x);\n if (!tmp) return (signed PY_LONG_LONG)-1;\n val = __Pyx_PyInt_AsSignedLongLong(tmp);\n Py_DECREF(tmp);\n return val;\n }\n}\n\nstatic void __Pyx_WriteUnraisable(const char *name, CYTHON_UNUSED int clineno,\n CYTHON_UNUSED int lineno, CYTHON_UNUSED const char *filename) {\n PyObject *old_exc, *old_val, *old_tb;\n PyObject *ctx;\n __Pyx_ErrFetch(&old_exc, &old_val, &old_tb);\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}\n\nstatic 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 #if PY_VERSION_HEX < 0x02050000\n return PyErr_Warn(NULL, message);\n #else\n return PyErr_WarnEx(NULL, message, 1);\n #endif\n }\n return 0;\n}\n\nstatic int __Pyx_SetVtable(PyObject *dict, void *vtable) {\n#if PY_VERSION_HEX >= 0x02070000 && !(PY_MAJOR_VERSION==3&&PY_MINOR_VERSION==0)\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_SetItemString(dict, \"__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#ifndef __PYX_HAVE_RT_ImportModule\n#define __PYX_HAVE_RT_ImportModule\nstatic PyObject *__Pyx_ImportModule(const char *name) {\n PyObject *py_name = 0;\n PyObject *py_module = 0;\n py_name = __Pyx_PyIdentifier_FromString(name);\n if (!py_name)\n goto bad;\n py_module = PyImport_Import(py_name);\n Py_DECREF(py_name);\n return py_module;\nbad:\n Py_XDECREF(py_name);\n return 0;\n}\n#endif\n\n#ifndef __PYX_HAVE_RT_ImportType\n#define __PYX_HAVE_RT_ImportType\nstatic PyTypeObject *__Pyx_ImportType(const char *module_name, const char *class_name,\n size_t size, int strict)\n{\n PyObject *py_module = 0;\n PyObject *result = 0;\n PyObject *py_name = 0;\n char warning[200];\n py_module = __Pyx_ImportModule(module_name);\n if (!py_module)\n goto bad;\n py_name = __Pyx_PyIdentifier_FromString(class_name);\n if (!py_name)\n goto bad;\n result = PyObject_GetAttr(py_module, py_name);\n Py_DECREF(py_name);\n py_name = 0;\n Py_DECREF(py_module);\n py_module = 0;\n if (!result)\n goto bad;\n if (!PyType_Check(result)) {\n PyErr_Format(PyExc_TypeError,\n \"%s.%s is not a type object\",\n module_name, class_name);\n goto bad;\n }\n if (!strict && (size_t)((PyTypeObject *)result)->tp_basicsize > size) {\n PyOS_snprintf(warning, sizeof(warning),\n \"%s.%s size changed, may indicate binary incompatibility\",\n module_name, class_name);\n #if PY_VERSION_HEX < 0x02050000\n if (PyErr_Warn(NULL, warning) < 0) goto bad;\n #else\n if (PyErr_WarnEx(NULL, warning, 0) < 0) goto bad;\n #endif\n }\n else if ((size_t)((PyTypeObject *)result)->tp_basicsize != size) {\n PyErr_Format(PyExc_ValueError,\n \"%s.%s has the wrong size, try recompiling\",\n module_name, class_name);\n goto bad;\n }\n return (PyTypeObject *)result;\nbad:\n Py_XDECREF(py_module);\n Py_XDECREF(result);\n return NULL;\n}\n#endif\n\nstatic void* __Pyx_GetVtable(PyObject *dict) {\n void* ptr;\n PyObject *ob = PyMapping_GetItemString(dict, (char *)\"__pyx_vtable__\");\n if (!ob)\n goto bad;\n#if PY_VERSION_HEX >= 0x02070000 && !(PY_MAJOR_VERSION==3&&PY_MINOR_VERSION==0)\n ptr = PyCapsule_GetPointer(ob, 0);\n#else\n ptr = PyCObject_AsVoidPtr(ob);\n#endif\n if (!ptr && !PyErr_Occurred())\n PyErr_SetString(PyExc_RuntimeError, \"invalid vtable found for imported type\");\n Py_DECREF(ob);\n return ptr;\nbad:\n Py_XDECREF(ob);\n return NULL;\n}\n\nstatic 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) / 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, 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#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, /*int argcount,*/\n 0, /*int kwonlyargcount,*/\n 0, /*int nlocals,*/\n 0, /*int stacksize,*/\n 0, /*int flags,*/\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, /*int firstlineno,*/\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 PyObject *py_globals = 0;\n PyFrameObject *py_frame = 0;\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_globals = PyModule_GetDict(__pyx_m);\n if (!py_globals) goto bad;\n py_frame = PyFrame_New(\n PyThreadState_GET(), /*PyThreadState *tstate,*/\n py_code, /*PyCodeObject *code,*/\n py_globals, /*PyObject *globals,*/\n 0 /*PyObject *locals*/\n );\n if (!py_frame) goto bad;\n py_frame->f_lineno = py_line;\n PyTraceBack_Here(py_frame);\nbad:\n Py_XDECREF(py_code);\n Py_XDECREF(py_frame);\n}\n\nstatic 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 /* Python 3+ has unicode identifiers */\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 ++t;\n }\n return 0;\n}\n\n\n/* Type Conversion Functions */\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}\n\nstatic CYTHON_INLINE PyObject* __Pyx_PyNumber_Int(PyObject* x) {\n PyNumberMethods *m;\n const char *name = NULL;\n PyObject *res = NULL;\n#if PY_VERSION_HEX < 0x03000000\n if (PyInt_Check(x) || PyLong_Check(x))\n#else\n if (PyLong_Check(x))\n#endif\n return Py_INCREF(x), x;\n m = Py_TYPE(x)->tp_as_number;\n#if PY_VERSION_HEX < 0x03000000\n if (m && m->nb_int) {\n name = \"int\";\n res = PyNumber_Int(x);\n }\n else if (m && m->nb_long) {\n name = \"long\";\n res = PyNumber_Long(x);\n }\n#else\n if (m && m->nb_int) {\n name = \"int\";\n res = PyNumber_Long(x);\n }\n#endif\n if (res) {\n#if PY_VERSION_HEX < 0x03000000\n if (!PyInt_Check(res) && !PyLong_Check(res)) {\n#else\n if (!PyLong_Check(res)) {\n#endif\n PyErr_Format(PyExc_TypeError,\n \"__%s__ returned non-%s (type %.200s)\",\n name, name, Py_TYPE(res)->tp_name);\n Py_DECREF(res);\n return NULL;\n }\n }\n else if (!PyErr_Occurred()) {\n PyErr_SetString(PyExc_TypeError,\n \"an integer is required\");\n }\n return res;\n}\n\nstatic CYTHON_INLINE Py_ssize_t __Pyx_PyIndex_AsSsize_t(PyObject* b) {\n Py_ssize_t ival;\n PyObject* x = PyNumber_Index(b);\n if (!x) return -1;\n ival = PyInt_AsSsize_t(x);\n Py_DECREF(x);\n return ival;\n}\n\nstatic CYTHON_INLINE PyObject * __Pyx_PyInt_FromSize_t(size_t ival) {\n#if PY_VERSION_HEX < 0x02050000\n if (ival <= LONG_MAX)\n return PyInt_FromLong((long)ival);\n else {\n unsigned char *bytes = (unsigned char *) &ival;\n int one = 1; int little = (int)*(unsigned char*)&one;\n return _PyLong_FromByteArray(bytes, sizeof(size_t), little, 0);\n }\n#else\n return PyInt_FromSize_t(ival);\n#endif\n}\n\nstatic CYTHON_INLINE size_t __Pyx_PyInt_AsSize_t(PyObject* x) {\n unsigned PY_LONG_LONG val = __Pyx_PyInt_AsUnsignedLongLong(x);\n if (unlikely(val == (unsigned PY_LONG_LONG)-1 && PyErr_Occurred())) {\n return (size_t)-1;\n } else if (unlikely(val != (unsigned PY_LONG_LONG)(size_t)val)) {\n PyErr_SetString(PyExc_OverflowError,\n \"value too large to convert to size_t\");\n return (size_t)-1;\n }\n return (size_t)val;\n}\n\n\n#endif /* Py_PYTHON_H */\n" }, { "path": "src/test/resources/samples/langs/C/syscalldefs.h", "content": "static const syscalldef syscalldefs[] = {\n [SYSCALL_OR_NUM(0, SYS_restart_syscall)] = MAKE_UINT16(0, 1),\n [SYSCALL_OR_NUM(1, SYS_exit)] = MAKE_UINT16(1, 17),\n [SYSCALL_OR_NUM(2, SYS_fork)] = MAKE_UINT16(0, 22),\n};\n" }, { "path": "src/test/resources/samples/langs/C/syscalls.h", "content": "#pragma once\n\n/* Copyright © 2011 Fritz Grimpen\n *\n * This file is part of Xelix.\n *\n * Xelix 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 * Xelix 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 Xelix. If not, see .\n */\n\n#include \n#include \n\n#include \"syscalls/write.h\"\n#include \"syscalls/exit.h\"\n#include \"syscalls/getpid.h\"\n#include \"syscalls/getppid.h\"\n#include \"syscalls/read.h\"\n#include \"syscalls/brk.h\"\n#include \"syscalls/mmap.h\"\n#include \"syscalls/munmap.h\"\n#include \"syscalls/test.h\"\n#include \"syscalls/hostname.h\"\n#include \"syscalls/uname.h\"\n#include \"syscalls/open.h\"\n#include \"syscalls/execve.h\"\n#include \"syscalls/seek.h\"\n#include \"syscalls/opendir.h\"\n#include \"syscalls/readdir.h\"\n#include \"syscalls/kill.h\"\n#include \"syscalls/getexecdata.h\"\n#include \"syscalls/cwd.h\"\n#include \"syscalls/fork.h\"\n\nsyscall_t syscall_table[] = {\n\tNULL,\n\tsys_exit,\t\t\t// 1\n\tsys_read,\t\t\t// 2\n\tsys_write,\t\t\t// 3\n\tsys_getpid,\t\t\t// 4\n\tsys_brk,\t\t\t// 5\n\tsys_getppid,\t\t// 6\n\tsys_mmap,\t\t\t// 7\n\tsys_munmap,\t\t\t// 8\n\tsys_test,\t\t\t// 9\n\tsys_get_hostname,\t// 10\n\tsys_set_hostname,\t// 11\n\tsys_uname,\t\t\t// 12\n\tsys_open,\t\t\t// 13\n\tsys_execve,\t\t\t// 14\n\tsys_seek,\t\t\t// 15\n\tsys_opendir,\t\t// 16\n\tsys_readdir,\t\t// 17\n\tsys_kill,\t\t\t// 18\n\tsys_getexecdata,\t// 19\n\tsys_chdir,\t\t\t// 20\n\tsys_getcwd,\t\t\t// 21\n\tsys_fork,\t\t\t// 22\n};\n\nchar* syscall_name_table[] = {\n\tNULL,\n\t\"exit\",\t\t\t// 1\n\t\"read\",\t\t\t// 2\n\t\"write\",\t\t// 3\n\t\"getpid\",\t\t// 4\n\t\"brk\",\t\t\t// 5\n\t\"getppid\",\t\t// 6\n\t\"mmap\",\t\t\t// 7\n\t\"munmap\",\t\t// 8\n\t\"test\",\t\t\t// 9\n\t\"get_hostname\",\t// 10\n\t\"set_hostname\",\t// 11\n\t\"uname\",\t\t// 12\n\t\"open\",\t\t\t// 13\n\t\"execve\",\t\t// 14\n\t\"seek\",\t\t\t// 15\n\t\"opendir\",\t\t// 16\n\t\"readdir\",\t\t// 17\n\t\"kill\",\t\t\t// 18\n\t\"getexecdata\",\t// 19\n\t\"chdir\",\t\t// 20\n\t\"getcwd\",\t\t// 21\n\t\"fork\",\t\t\t// 22\n};\n" }, { "path": "src/test/resources/samples/langs/C/vfs.h", "content": "#pragma once\n\n/* Copyright © 2010, 2011 Lukas Martini\n *\n * This file is part of Xelix.\n *\n * Xelix 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 * Xelix 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 Xelix. If not, see .\n */\n\n#include \n\n#define VFS_SEEK_SET 0\n#define VFS_SEEK_CUR 1\n#define VFS_SEEK_END 2\n\ntypedef struct {\n uint64_t num;\n char path[512];\n char mount_path[512];\n uint32_t offset;\n uint32_t mountpoint;\n} vfs_file_t;\n\ntypedef struct {\n uint64_t num;\n char path[512];\n char mount_path[512];\n uint32_t mountpoint;\n} vfs_dir_t;\n\ntypedef void* (*vfs_read_callback_t)(char* path, uint32_t offset, uint32_t size);\ntypedef char* (*vfs_read_dir_callback_t)(char* path, uint32_t offset);\n\n\n// Used to always store the last read/write attempt (used for kernel panic debugging)\nchar vfs_last_read_attempt[512];\n\nvfs_file_t* vfs_get_from_id(uint32_t id);\nvfs_dir_t* vfs_get_dir_from_id(uint32_t id);\nvoid* vfs_read(vfs_file_t* fp, uint32_t size);\nchar* vfs_dir_read(vfs_dir_t* dir, uint32_t offset);\nvoid vfs_seek(vfs_file_t* fp, uint32_t offset, int origin);\nvfs_file_t* vfs_open(char* path);\nvfs_dir_t* vfs_dir_open(char* path);\nint vfs_mount(char* path, vfs_read_callback_t read_callback, vfs_read_dir_callback_t read_dir_callback);\n" }, { "path": "src/test/resources/samples/langs/C/vmem.h", "content": "#pragma once\n\n/* Copyright © 2011 Fritz Grimpen\n * Copyright © 2013 Lukas Martini\n *\n * This file is part of Xelix.\n *\n * Xelix 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 * Xelix 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 Xelix. If not, see .\n */\n\n#include \n\nstruct vmem_context;\n\nstruct vmem_page\n{\n\tenum\n\t{\n\t\tVMEM_SECTION_STACK, /* Initial stack */\n\t\tVMEM_SECTION_CODE, /* Contains program code and is read-only */\n\t\tVMEM_SECTION_DATA, /* Contains static data */\n\t\tVMEM_SECTION_HEAP, /* Allocated by brk(2) at runtime */\n\t\tVMEM_SECTION_MMAP, /* Allocated by mmap(2) at runtime */\n\t\tVMEM_SECTION_KERNEL, /* Contains kernel-internal data */\n\t\tVMEM_SECTION_UNMAPPED /* Unmapped */\n\t} section;\n\n\tbool readonly:1;\n\tbool cow:1; /* Copy-on-Write mechanism */\n\tbool allocated:1;\n\n\tvoid *cow_src_addr;\n\tvoid *virt_addr;\n\tvoid *phys_addr;\n};\n\ntypedef void (*vmem_iterator_t)(struct vmem_context *, struct vmem_page *, uint32_t);\n\n/* Initialize vmem_kernelContext for paging_init() */\nvoid vmem_init();\nstruct vmem_context *vmem_kernelContext;\nstruct vmem_context *vmem_currentContext;\nstruct vmem_context *vmem_processContext;\nvoid *vmem_faultAddress;\n\n/* Some callbacks for magic functions */\nvoid (*vmem_applyPage)(struct vmem_context *, struct vmem_page *);\n\n/* Generate new page context */\nstruct vmem_context *vmem_new();\nstruct vmem_page *vmem_new_page();\n\nint vmem_add_page(struct vmem_context *ctx, struct vmem_page *pg);\n\nstruct vmem_page *vmem_get_page_phys(struct vmem_context *ctx, void *phys_addr);\nstruct vmem_page *vmem_get_page_virt(struct vmem_context *ctx, void *virt_addr);\nstruct vmem_page *vmem_get_page(struct vmem_context *ctx, uint32_t offset);\n\n/* Remove pages in a specific context by physical or virtual address */\nstruct vmem_page *vmem_rm_page_phys(struct vmem_context *ctx, void *phys_addr);\nstruct vmem_page *vmem_rm_page_virt(struct vmem_context *ctx, void *virt_addr);\n\n/* Iterator */\nint vmem_iterate(struct vmem_context *ctx, vmem_iterator_t callback);\n\nuint32_t vmem_count_pages(struct vmem_context *ctx);\nvoid vmem_dump_page(struct vmem_page *pg);\nvoid vmem_dump(struct vmem_context *ctx);\nvoid vmem_handle_fault(uint32_t code, void *addr, void *instruction);\n\n/* Get/Set cached paging context */\nvoid vmem_set_cache(struct vmem_context *ctx, void *cache);\nvoid *vmem_get_cache(struct vmem_context *ctx);\n\n#ifdef __i386__\n\t#define PAGE_SIZE 4096\n\t#define VMEM_ALIGN(x) (typeof(x))(((intptr_t)(x) & 0xFFFFF000) + 0x1000)\n\t#define VMEM_ALIGN_DOWN(x) (typeof(x))( \\\n\t\t((intptr_t)(x) - ((intptr_t)(x) % PAGE_SIZE)))\n#else\n\t#define PAGE_SIZE 0\n\t#define VMEM_ALIGN(x) (x)\n#endif\n" }, { "path": "src/test/resources/samples/langs/C/wglew.h", "content": "/*\r\n** The OpenGL Extension Wrangler Library\r\n** Copyright (C) 2002-2008, Milan Ikits \r\n** Copyright (C) 2002-2008, Marcelo E. Magallon \r\n** Copyright (C) 2002, Lev Povalahev\r\n** All rights reserved.\r\n** \r\n** Redistribution and use in source and binary forms, with or without \r\n** modification, are permitted provided that the following conditions are met:\r\n** \r\n** * Redistributions of source code must retain the above copyright notice, \r\n** this list of conditions and the following disclaimer.\r\n** * Redistributions in binary form must reproduce the above copyright notice, \r\n** this list of conditions and the following disclaimer in the documentation \r\n** and/or other materials provided with the distribution.\r\n** * The name of the author may be used to endorse or promote products \r\n** derived from this software without specific prior written permission.\r\n**\r\n** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" \r\n** AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE \r\n** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r\n** ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE \r\n** LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR \r\n** CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF \r\n** SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\r\n** INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\r\n** CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\r\n** ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\r\n** THE POSSIBILITY OF SUCH DAMAGE.\r\n*/\r\n\r\n/*\r\n** Copyright (c) 2007 The Khronos Group Inc.\r\n** \r\n** Permission is hereby granted, free of charge, to any person obtaining a\r\n** copy of this software and/or associated documentation files (the\r\n** \"Materials\"), to deal in the Materials without restriction, including\r\n** without limitation the rights to use, copy, modify, merge, publish,\r\n** distribute, sublicense, and/or sell copies of the Materials, and to\r\n** permit persons to whom the Materials are furnished to do so, subject to\r\n** the following conditions:\r\n** \r\n** The above copyright notice and this permission notice shall be included\r\n** in all copies or substantial portions of the Materials.\r\n** \r\n** THE MATERIALS ARE PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\r\n** EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\r\n** MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\r\n** IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\r\n** CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\r\n** TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\r\n** MATERIALS OR THE USE OR OTHER DEALINGS IN THE MATERIALS.\r\n*/\r\n\r\n#ifndef __wglew_h__\r\n#define __wglew_h__\r\n#define __WGLEW_H__\r\n\r\n#ifdef __wglext_h_\r\n#error wglext.h included before wglew.h\r\n#endif\r\n\r\n#define __wglext_h_\r\n\r\n#if !defined(WINAPI)\r\n# ifndef WIN32_LEAN_AND_MEAN\r\n# define WIN32_LEAN_AND_MEAN 1\r\n# endif\r\n#include \r\n# undef WIN32_LEAN_AND_MEAN\r\n#endif\r\n\r\n/*\r\n * GLEW_STATIC needs to be set when using the static version.\r\n * GLEW_BUILD is set when building the DLL version.\r\n */\r\n#ifdef GLEW_STATIC\r\n# define GLEWAPI extern\r\n#else\r\n# ifdef GLEW_BUILD\r\n# define GLEWAPI extern __declspec(dllexport)\r\n# else\r\n# define GLEWAPI extern __declspec(dllimport)\r\n# endif\r\n#endif\r\n\r\n#ifdef __cplusplus\r\nextern \"C\" {\r\n#endif\r\n\r\n/* -------------------------- WGL_3DFX_multisample ------------------------- */\r\n\r\n#ifndef WGL_3DFX_multisample\r\n#define WGL_3DFX_multisample 1\r\n\r\n#define WGL_SAMPLE_BUFFERS_3DFX 0x2060\r\n#define WGL_SAMPLES_3DFX 0x2061\r\n\r\n#define WGLEW_3DFX_multisample WGLEW_GET_VAR(__WGLEW_3DFX_multisample)\r\n\r\n#endif /* WGL_3DFX_multisample */\r\n\r\n/* ------------------------- WGL_3DL_stereo_control ------------------------ */\r\n\r\n#ifndef WGL_3DL_stereo_control\r\n#define WGL_3DL_stereo_control 1\r\n\r\n#define WGL_STEREO_EMITTER_ENABLE_3DL 0x2055\r\n#define WGL_STEREO_EMITTER_DISABLE_3DL 0x2056\r\n#define WGL_STEREO_POLARITY_NORMAL_3DL 0x2057\r\n#define WGL_STEREO_POLARITY_INVERT_3DL 0x2058\r\n\r\ntypedef BOOL (WINAPI * PFNWGLSETSTEREOEMITTERSTATE3DLPROC) (HDC hDC, UINT uState);\r\n\r\n#define wglSetStereoEmitterState3DL WGLEW_GET_FUN(__wglewSetStereoEmitterState3DL)\r\n\r\n#define WGLEW_3DL_stereo_control WGLEW_GET_VAR(__WGLEW_3DL_stereo_control)\r\n\r\n#endif /* WGL_3DL_stereo_control */\r\n\r\n/* ------------------------ WGL_AMD_gpu_association ------------------------ */\r\n\r\n#ifndef WGL_AMD_gpu_association\r\n#define WGL_AMD_gpu_association 1\r\n\r\n#define WGL_GPU_VENDOR_AMD 0x1F00\r\n#define WGL_GPU_RENDERER_STRING_AMD 0x1F01\r\n#define WGL_GPU_OPENGL_VERSION_STRING_AMD 0x1F02\r\n#define WGL_GPU_FASTEST_TARGET_GPUS_AMD 0x21A2\r\n#define WGL_GPU_RAM_AMD 0x21A3\r\n#define WGL_GPU_CLOCK_AMD 0x21A4\r\n#define WGL_GPU_NUM_PIPES_AMD 0x21A5\r\n#define WGL_GPU_NUM_SIMD_AMD 0x21A6\r\n#define WGL_GPU_NUM_RB_AMD 0x21A7\r\n#define WGL_GPU_NUM_SPI_AMD 0x21A8\r\n\r\ntypedef VOID (WINAPI * PFNWGLBLITCONTEXTFRAMEBUFFERAMDPROC) (HGLRC dstCtx, GLint srcX0, GLint srcY0, GLint srcX1, GLint srcY1, GLint dstX0, GLint dstY0, GLint dstX1, GLint dstY1, GLbitfield mask, GLenum filter);\r\ntypedef HGLRC (WINAPI * PFNWGLCREATEASSOCIATEDCONTEXTAMDPROC) (UINT id);\r\ntypedef HGLRC (WINAPI * PFNWGLCREATEASSOCIATEDCONTEXTATTRIBSAMDPROC) (UINT id, HGLRC hShareContext, const int* attribList);\r\ntypedef BOOL (WINAPI * PFNWGLDELETEASSOCIATEDCONTEXTAMDPROC) (HGLRC hglrc);\r\ntypedef UINT (WINAPI * PFNWGLGETCONTEXTGPUIDAMDPROC) (HGLRC hglrc);\r\ntypedef HGLRC (WINAPI * PFNWGLGETCURRENTASSOCIATEDCONTEXTAMDPROC) (void);\r\ntypedef UINT (WINAPI * PFNWGLGETGPUIDSAMDPROC) (UINT maxCount, UINT* ids);\r\ntypedef INT (WINAPI * PFNWGLGETGPUINFOAMDPROC) (UINT id, INT property, GLenum dataType, UINT size, void* data);\r\ntypedef BOOL (WINAPI * PFNWGLMAKEASSOCIATEDCONTEXTCURRENTAMDPROC) (HGLRC hglrc);\r\n\r\n#define wglBlitContextFramebufferAMD WGLEW_GET_FUN(__wglewBlitContextFramebufferAMD)\r\n#define wglCreateAssociatedContextAMD WGLEW_GET_FUN(__wglewCreateAssociatedContextAMD)\r\n#define wglCreateAssociatedContextAttribsAMD WGLEW_GET_FUN(__wglewCreateAssociatedContextAttribsAMD)\r\n#define wglDeleteAssociatedContextAMD WGLEW_GET_FUN(__wglewDeleteAssociatedContextAMD)\r\n#define wglGetContextGPUIDAMD WGLEW_GET_FUN(__wglewGetContextGPUIDAMD)\r\n#define wglGetCurrentAssociatedContextAMD WGLEW_GET_FUN(__wglewGetCurrentAssociatedContextAMD)\r\n#define wglGetGPUIDsAMD WGLEW_GET_FUN(__wglewGetGPUIDsAMD)\r\n#define wglGetGPUInfoAMD WGLEW_GET_FUN(__wglewGetGPUInfoAMD)\r\n#define wglMakeAssociatedContextCurrentAMD WGLEW_GET_FUN(__wglewMakeAssociatedContextCurrentAMD)\r\n\r\n#define WGLEW_AMD_gpu_association WGLEW_GET_VAR(__WGLEW_AMD_gpu_association)\r\n\r\n#endif /* WGL_AMD_gpu_association */\r\n\r\n/* ------------------------- WGL_ARB_buffer_region ------------------------- */\r\n\r\n#ifndef WGL_ARB_buffer_region\r\n#define WGL_ARB_buffer_region 1\r\n\r\n#define WGL_FRONT_COLOR_BUFFER_BIT_ARB 0x00000001\r\n#define WGL_BACK_COLOR_BUFFER_BIT_ARB 0x00000002\r\n#define WGL_DEPTH_BUFFER_BIT_ARB 0x00000004\r\n#define WGL_STENCIL_BUFFER_BIT_ARB 0x00000008\r\n\r\ntypedef HANDLE (WINAPI * PFNWGLCREATEBUFFERREGIONARBPROC) (HDC hDC, int iLayerPlane, UINT uType);\r\ntypedef VOID (WINAPI * PFNWGLDELETEBUFFERREGIONARBPROC) (HANDLE hRegion);\r\ntypedef BOOL (WINAPI * PFNWGLRESTOREBUFFERREGIONARBPROC) (HANDLE hRegion, int x, int y, int width, int height, int xSrc, int ySrc);\r\ntypedef BOOL (WINAPI * PFNWGLSAVEBUFFERREGIONARBPROC) (HANDLE hRegion, int x, int y, int width, int height);\r\n\r\n#define wglCreateBufferRegionARB WGLEW_GET_FUN(__wglewCreateBufferRegionARB)\r\n#define wglDeleteBufferRegionARB WGLEW_GET_FUN(__wglewDeleteBufferRegionARB)\r\n#define wglRestoreBufferRegionARB WGLEW_GET_FUN(__wglewRestoreBufferRegionARB)\r\n#define wglSaveBufferRegionARB WGLEW_GET_FUN(__wglewSaveBufferRegionARB)\r\n\r\n#define WGLEW_ARB_buffer_region WGLEW_GET_VAR(__WGLEW_ARB_buffer_region)\r\n\r\n#endif /* WGL_ARB_buffer_region */\r\n\r\n/* ------------------------- WGL_ARB_create_context ------------------------ */\r\n\r\n#ifndef WGL_ARB_create_context\r\n#define WGL_ARB_create_context 1\r\n\r\n#define WGL_CONTEXT_DEBUG_BIT_ARB 0x0001\r\n#define WGL_CONTEXT_FORWARD_COMPATIBLE_BIT_ARB 0x0002\r\n#define WGL_CONTEXT_MAJOR_VERSION_ARB 0x2091\r\n#define WGL_CONTEXT_MINOR_VERSION_ARB 0x2092\r\n#define WGL_CONTEXT_LAYER_PLANE_ARB 0x2093\r\n#define WGL_CONTEXT_FLAGS_ARB 0x2094\r\n#define ERROR_INVALID_VERSION_ARB 0x2095\r\n#define ERROR_INVALID_PROFILE_ARB 0x2096\r\n\r\ntypedef HGLRC (WINAPI * PFNWGLCREATECONTEXTATTRIBSARBPROC) (HDC hDC, HGLRC hShareContext, const int* attribList);\r\n\r\n#define wglCreateContextAttribsARB WGLEW_GET_FUN(__wglewCreateContextAttribsARB)\r\n\r\n#define WGLEW_ARB_create_context WGLEW_GET_VAR(__WGLEW_ARB_create_context)\r\n\r\n#endif /* WGL_ARB_create_context */\r\n\r\n/* --------------------- WGL_ARB_create_context_profile -------------------- */\r\n\r\n#ifndef WGL_ARB_create_context_profile\r\n#define WGL_ARB_create_context_profile 1\r\n\r\n#define WGL_CONTEXT_CORE_PROFILE_BIT_ARB 0x00000001\r\n#define WGL_CONTEXT_COMPATIBILITY_PROFILE_BIT_ARB 0x00000002\r\n#define WGL_CONTEXT_PROFILE_MASK_ARB 0x9126\r\n\r\n#define WGLEW_ARB_create_context_profile WGLEW_GET_VAR(__WGLEW_ARB_create_context_profile)\r\n\r\n#endif /* WGL_ARB_create_context_profile */\r\n\r\n/* ------------------- WGL_ARB_create_context_robustness ------------------- */\r\n\r\n#ifndef WGL_ARB_create_context_robustness\r\n#define WGL_ARB_create_context_robustness 1\r\n\r\n#define WGL_CONTEXT_ROBUST_ACCESS_BIT_ARB 0x00000004\r\n#define WGL_LOSE_CONTEXT_ON_RESET_ARB 0x8252\r\n#define WGL_CONTEXT_RESET_NOTIFICATION_STRATEGY_ARB 0x8256\r\n#define WGL_NO_RESET_NOTIFICATION_ARB 0x8261\r\n\r\n#define WGLEW_ARB_create_context_robustness WGLEW_GET_VAR(__WGLEW_ARB_create_context_robustness)\r\n\r\n#endif /* WGL_ARB_create_context_robustness */\r\n\r\n/* ----------------------- WGL_ARB_extensions_string ----------------------- */\r\n\r\n#ifndef WGL_ARB_extensions_string\r\n#define WGL_ARB_extensions_string 1\r\n\r\ntypedef const char* (WINAPI * PFNWGLGETEXTENSIONSSTRINGARBPROC) (HDC hdc);\r\n\r\n#define wglGetExtensionsStringARB WGLEW_GET_FUN(__wglewGetExtensionsStringARB)\r\n\r\n#define WGLEW_ARB_extensions_string WGLEW_GET_VAR(__WGLEW_ARB_extensions_string)\r\n\r\n#endif /* WGL_ARB_extensions_string */\r\n\r\n/* ------------------------ WGL_ARB_framebuffer_sRGB ----------------------- */\r\n\r\n#ifndef WGL_ARB_framebuffer_sRGB\r\n#define WGL_ARB_framebuffer_sRGB 1\r\n\r\n#define WGL_FRAMEBUFFER_SRGB_CAPABLE_ARB 0x20A9\r\n\r\n#define WGLEW_ARB_framebuffer_sRGB WGLEW_GET_VAR(__WGLEW_ARB_framebuffer_sRGB)\r\n\r\n#endif /* WGL_ARB_framebuffer_sRGB */\r\n\r\n/* ----------------------- WGL_ARB_make_current_read ----------------------- */\r\n\r\n#ifndef WGL_ARB_make_current_read\r\n#define WGL_ARB_make_current_read 1\r\n\r\n#define ERROR_INVALID_PIXEL_TYPE_ARB 0x2043\r\n#define ERROR_INCOMPATIBLE_DEVICE_CONTEXTS_ARB 0x2054\r\n\r\ntypedef HDC (WINAPI * PFNWGLGETCURRENTREADDCARBPROC) (VOID);\r\ntypedef BOOL (WINAPI * PFNWGLMAKECONTEXTCURRENTARBPROC) (HDC hDrawDC, HDC hReadDC, HGLRC hglrc);\r\n\r\n#define wglGetCurrentReadDCARB WGLEW_GET_FUN(__wglewGetCurrentReadDCARB)\r\n#define wglMakeContextCurrentARB WGLEW_GET_FUN(__wglewMakeContextCurrentARB)\r\n\r\n#define WGLEW_ARB_make_current_read WGLEW_GET_VAR(__WGLEW_ARB_make_current_read)\r\n\r\n#endif /* WGL_ARB_make_current_read */\r\n\r\n/* -------------------------- WGL_ARB_multisample -------------------------- */\r\n\r\n#ifndef WGL_ARB_multisample\r\n#define WGL_ARB_multisample 1\r\n\r\n#define WGL_SAMPLE_BUFFERS_ARB 0x2041\r\n#define WGL_SAMPLES_ARB 0x2042\r\n\r\n#define WGLEW_ARB_multisample WGLEW_GET_VAR(__WGLEW_ARB_multisample)\r\n\r\n#endif /* WGL_ARB_multisample */\r\n\r\n/* ---------------------------- WGL_ARB_pbuffer ---------------------------- */\r\n\r\n#ifndef WGL_ARB_pbuffer\r\n#define WGL_ARB_pbuffer 1\r\n\r\n#define WGL_DRAW_TO_PBUFFER_ARB 0x202D\r\n#define WGL_MAX_PBUFFER_PIXELS_ARB 0x202E\r\n#define WGL_MAX_PBUFFER_WIDTH_ARB 0x202F\r\n#define WGL_MAX_PBUFFER_HEIGHT_ARB 0x2030\r\n#define WGL_PBUFFER_LARGEST_ARB 0x2033\r\n#define WGL_PBUFFER_WIDTH_ARB 0x2034\r\n#define WGL_PBUFFER_HEIGHT_ARB 0x2035\r\n#define WGL_PBUFFER_LOST_ARB 0x2036\r\n\r\nDECLARE_HANDLE(HPBUFFERARB);\r\n\r\ntypedef HPBUFFERARB (WINAPI * PFNWGLCREATEPBUFFERARBPROC) (HDC hDC, int iPixelFormat, int iWidth, int iHeight, const int* piAttribList);\r\ntypedef BOOL (WINAPI * PFNWGLDESTROYPBUFFERARBPROC) (HPBUFFERARB hPbuffer);\r\ntypedef HDC (WINAPI * PFNWGLGETPBUFFERDCARBPROC) (HPBUFFERARB hPbuffer);\r\ntypedef BOOL (WINAPI * PFNWGLQUERYPBUFFERARBPROC) (HPBUFFERARB hPbuffer, int iAttribute, int* piValue);\r\ntypedef int (WINAPI * PFNWGLRELEASEPBUFFERDCARBPROC) (HPBUFFERARB hPbuffer, HDC hDC);\r\n\r\n#define wglCreatePbufferARB WGLEW_GET_FUN(__wglewCreatePbufferARB)\r\n#define wglDestroyPbufferARB WGLEW_GET_FUN(__wglewDestroyPbufferARB)\r\n#define wglGetPbufferDCARB WGLEW_GET_FUN(__wglewGetPbufferDCARB)\r\n#define wglQueryPbufferARB WGLEW_GET_FUN(__wglewQueryPbufferARB)\r\n#define wglReleasePbufferDCARB WGLEW_GET_FUN(__wglewReleasePbufferDCARB)\r\n\r\n#define WGLEW_ARB_pbuffer WGLEW_GET_VAR(__WGLEW_ARB_pbuffer)\r\n\r\n#endif /* WGL_ARB_pbuffer */\r\n\r\n/* -------------------------- WGL_ARB_pixel_format ------------------------- */\r\n\r\n#ifndef WGL_ARB_pixel_format\r\n#define WGL_ARB_pixel_format 1\r\n\r\n#define WGL_NUMBER_PIXEL_FORMATS_ARB 0x2000\r\n#define WGL_DRAW_TO_WINDOW_ARB 0x2001\r\n#define WGL_DRAW_TO_BITMAP_ARB 0x2002\r\n#define WGL_ACCELERATION_ARB 0x2003\r\n#define WGL_NEED_PALETTE_ARB 0x2004\r\n#define WGL_NEED_SYSTEM_PALETTE_ARB 0x2005\r\n#define WGL_SWAP_LAYER_BUFFERS_ARB 0x2006\r\n#define WGL_SWAP_METHOD_ARB 0x2007\r\n#define WGL_NUMBER_OVERLAYS_ARB 0x2008\r\n#define WGL_NUMBER_UNDERLAYS_ARB 0x2009\r\n#define WGL_TRANSPARENT_ARB 0x200A\r\n#define WGL_SHARE_DEPTH_ARB 0x200C\r\n#define WGL_SHARE_STENCIL_ARB 0x200D\r\n#define WGL_SHARE_ACCUM_ARB 0x200E\r\n#define WGL_SUPPORT_GDI_ARB 0x200F\r\n#define WGL_SUPPORT_OPENGL_ARB 0x2010\r\n#define WGL_DOUBLE_BUFFER_ARB 0x2011\r\n#define WGL_STEREO_ARB 0x2012\r\n#define WGL_PIXEL_TYPE_ARB 0x2013\r\n#define WGL_COLOR_BITS_ARB 0x2014\r\n#define WGL_RED_BITS_ARB 0x2015\r\n#define WGL_RED_SHIFT_ARB 0x2016\r\n#define WGL_GREEN_BITS_ARB 0x2017\r\n#define WGL_GREEN_SHIFT_ARB 0x2018\r\n#define WGL_BLUE_BITS_ARB 0x2019\r\n#define WGL_BLUE_SHIFT_ARB 0x201A\r\n#define WGL_ALPHA_BITS_ARB 0x201B\r\n#define WGL_ALPHA_SHIFT_ARB 0x201C\r\n#define WGL_ACCUM_BITS_ARB 0x201D\r\n#define WGL_ACCUM_RED_BITS_ARB 0x201E\r\n#define WGL_ACCUM_GREEN_BITS_ARB 0x201F\r\n#define WGL_ACCUM_BLUE_BITS_ARB 0x2020\r\n#define WGL_ACCUM_ALPHA_BITS_ARB 0x2021\r\n#define WGL_DEPTH_BITS_ARB 0x2022\r\n#define WGL_STENCIL_BITS_ARB 0x2023\r\n#define WGL_AUX_BUFFERS_ARB 0x2024\r\n#define WGL_NO_ACCELERATION_ARB 0x2025\r\n#define WGL_GENERIC_ACCELERATION_ARB 0x2026\r\n#define WGL_FULL_ACCELERATION_ARB 0x2027\r\n#define WGL_SWAP_EXCHANGE_ARB 0x2028\r\n#define WGL_SWAP_COPY_ARB 0x2029\r\n#define WGL_SWAP_UNDEFINED_ARB 0x202A\r\n#define WGL_TYPE_RGBA_ARB 0x202B\r\n#define WGL_TYPE_COLORINDEX_ARB 0x202C\r\n#define WGL_TRANSPARENT_RED_VALUE_ARB 0x2037\r\n#define WGL_TRANSPARENT_GREEN_VALUE_ARB 0x2038\r\n#define WGL_TRANSPARENT_BLUE_VALUE_ARB 0x2039\r\n#define WGL_TRANSPARENT_ALPHA_VALUE_ARB 0x203A\r\n#define WGL_TRANSPARENT_INDEX_VALUE_ARB 0x203B\r\n\r\ntypedef BOOL (WINAPI * PFNWGLCHOOSEPIXELFORMATARBPROC) (HDC hdc, const int* piAttribIList, const FLOAT *pfAttribFList, UINT nMaxFormats, int *piFormats, UINT *nNumFormats);\r\ntypedef BOOL (WINAPI * PFNWGLGETPIXELFORMATATTRIBFVARBPROC) (HDC hdc, int iPixelFormat, int iLayerPlane, UINT nAttributes, const int* piAttributes, FLOAT *pfValues);\r\ntypedef BOOL (WINAPI * PFNWGLGETPIXELFORMATATTRIBIVARBPROC) (HDC hdc, int iPixelFormat, int iLayerPlane, UINT nAttributes, const int* piAttributes, int *piValues);\r\n\r\n#define wglChoosePixelFormatARB WGLEW_GET_FUN(__wglewChoosePixelFormatARB)\r\n#define wglGetPixelFormatAttribfvARB WGLEW_GET_FUN(__wglewGetPixelFormatAttribfvARB)\r\n#define wglGetPixelFormatAttribivARB WGLEW_GET_FUN(__wglewGetPixelFormatAttribivARB)\r\n\r\n#define WGLEW_ARB_pixel_format WGLEW_GET_VAR(__WGLEW_ARB_pixel_format)\r\n\r\n#endif /* WGL_ARB_pixel_format */\r\n\r\n/* ----------------------- WGL_ARB_pixel_format_float ---------------------- */\r\n\r\n#ifndef WGL_ARB_pixel_format_float\r\n#define WGL_ARB_pixel_format_float 1\r\n\r\n#define WGL_TYPE_RGBA_FLOAT_ARB 0x21A0\r\n\r\n#define WGLEW_ARB_pixel_format_float WGLEW_GET_VAR(__WGLEW_ARB_pixel_format_float)\r\n\r\n#endif /* WGL_ARB_pixel_format_float */\r\n\r\n/* ------------------------- WGL_ARB_render_texture ------------------------ */\r\n\r\n#ifndef WGL_ARB_render_texture\r\n#define WGL_ARB_render_texture 1\r\n\r\n#define WGL_BIND_TO_TEXTURE_RGB_ARB 0x2070\r\n#define WGL_BIND_TO_TEXTURE_RGBA_ARB 0x2071\r\n#define WGL_TEXTURE_FORMAT_ARB 0x2072\r\n#define WGL_TEXTURE_TARGET_ARB 0x2073\r\n#define WGL_MIPMAP_TEXTURE_ARB 0x2074\r\n#define WGL_TEXTURE_RGB_ARB 0x2075\r\n#define WGL_TEXTURE_RGBA_ARB 0x2076\r\n#define WGL_NO_TEXTURE_ARB 0x2077\r\n#define WGL_TEXTURE_CUBE_MAP_ARB 0x2078\r\n#define WGL_TEXTURE_1D_ARB 0x2079\r\n#define WGL_TEXTURE_2D_ARB 0x207A\r\n#define WGL_MIPMAP_LEVEL_ARB 0x207B\r\n#define WGL_CUBE_MAP_FACE_ARB 0x207C\r\n#define WGL_TEXTURE_CUBE_MAP_POSITIVE_X_ARB 0x207D\r\n#define WGL_TEXTURE_CUBE_MAP_NEGATIVE_X_ARB 0x207E\r\n#define WGL_TEXTURE_CUBE_MAP_POSITIVE_Y_ARB 0x207F\r\n#define WGL_TEXTURE_CUBE_MAP_NEGATIVE_Y_ARB 0x2080\r\n#define WGL_TEXTURE_CUBE_MAP_POSITIVE_Z_ARB 0x2081\r\n#define WGL_TEXTURE_CUBE_MAP_NEGATIVE_Z_ARB 0x2082\r\n#define WGL_FRONT_LEFT_ARB 0x2083\r\n#define WGL_FRONT_RIGHT_ARB 0x2084\r\n#define WGL_BACK_LEFT_ARB 0x2085\r\n#define WGL_BACK_RIGHT_ARB 0x2086\r\n#define WGL_AUX0_ARB 0x2087\r\n#define WGL_AUX1_ARB 0x2088\r\n#define WGL_AUX2_ARB 0x2089\r\n#define WGL_AUX3_ARB 0x208A\r\n#define WGL_AUX4_ARB 0x208B\r\n#define WGL_AUX5_ARB 0x208C\r\n#define WGL_AUX6_ARB 0x208D\r\n#define WGL_AUX7_ARB 0x208E\r\n#define WGL_AUX8_ARB 0x208F\r\n#define WGL_AUX9_ARB 0x2090\r\n\r\ntypedef BOOL (WINAPI * PFNWGLBINDTEXIMAGEARBPROC) (HPBUFFERARB hPbuffer, int iBuffer);\r\ntypedef BOOL (WINAPI * PFNWGLRELEASETEXIMAGEARBPROC) (HPBUFFERARB hPbuffer, int iBuffer);\r\ntypedef BOOL (WINAPI * PFNWGLSETPBUFFERATTRIBARBPROC) (HPBUFFERARB hPbuffer, const int* piAttribList);\r\n\r\n#define wglBindTexImageARB WGLEW_GET_FUN(__wglewBindTexImageARB)\r\n#define wglReleaseTexImageARB WGLEW_GET_FUN(__wglewReleaseTexImageARB)\r\n#define wglSetPbufferAttribARB WGLEW_GET_FUN(__wglewSetPbufferAttribARB)\r\n\r\n#define WGLEW_ARB_render_texture WGLEW_GET_VAR(__WGLEW_ARB_render_texture)\r\n\r\n#endif /* WGL_ARB_render_texture */\r\n\r\n/* ----------------------- WGL_ATI_pixel_format_float ---------------------- */\r\n\r\n#ifndef WGL_ATI_pixel_format_float\r\n#define WGL_ATI_pixel_format_float 1\r\n\r\n#define WGL_TYPE_RGBA_FLOAT_ATI 0x21A0\r\n#define GL_RGBA_FLOAT_MODE_ATI 0x8820\r\n#define GL_COLOR_CLEAR_UNCLAMPED_VALUE_ATI 0x8835\r\n\r\n#define WGLEW_ATI_pixel_format_float WGLEW_GET_VAR(__WGLEW_ATI_pixel_format_float)\r\n\r\n#endif /* WGL_ATI_pixel_format_float */\r\n\r\n/* -------------------- WGL_ATI_render_texture_rectangle ------------------- */\r\n\r\n#ifndef WGL_ATI_render_texture_rectangle\r\n#define WGL_ATI_render_texture_rectangle 1\r\n\r\n#define WGL_TEXTURE_RECTANGLE_ATI 0x21A5\r\n\r\n#define WGLEW_ATI_render_texture_rectangle WGLEW_GET_VAR(__WGLEW_ATI_render_texture_rectangle)\r\n\r\n#endif /* WGL_ATI_render_texture_rectangle */\r\n\r\n/* ------------------- WGL_EXT_create_context_es2_profile ------------------ */\r\n\r\n#ifndef WGL_EXT_create_context_es2_profile\r\n#define WGL_EXT_create_context_es2_profile 1\r\n\r\n#define WGL_CONTEXT_ES2_PROFILE_BIT_EXT 0x00000004\r\n\r\n#define WGLEW_EXT_create_context_es2_profile WGLEW_GET_VAR(__WGLEW_EXT_create_context_es2_profile)\r\n\r\n#endif /* WGL_EXT_create_context_es2_profile */\r\n\r\n/* -------------------------- WGL_EXT_depth_float -------------------------- */\r\n\r\n#ifndef WGL_EXT_depth_float\r\n#define WGL_EXT_depth_float 1\r\n\r\n#define WGL_DEPTH_FLOAT_EXT 0x2040\r\n\r\n#define WGLEW_EXT_depth_float WGLEW_GET_VAR(__WGLEW_EXT_depth_float)\r\n\r\n#endif /* WGL_EXT_depth_float */\r\n\r\n/* ---------------------- WGL_EXT_display_color_table ---------------------- */\r\n\r\n#ifndef WGL_EXT_display_color_table\r\n#define WGL_EXT_display_color_table 1\r\n\r\ntypedef GLboolean (WINAPI * PFNWGLBINDDISPLAYCOLORTABLEEXTPROC) (GLushort id);\r\ntypedef GLboolean (WINAPI * PFNWGLCREATEDISPLAYCOLORTABLEEXTPROC) (GLushort id);\r\ntypedef void (WINAPI * PFNWGLDESTROYDISPLAYCOLORTABLEEXTPROC) (GLushort id);\r\ntypedef GLboolean (WINAPI * PFNWGLLOADDISPLAYCOLORTABLEEXTPROC) (GLushort* table, GLuint length);\r\n\r\n#define wglBindDisplayColorTableEXT WGLEW_GET_FUN(__wglewBindDisplayColorTableEXT)\r\n#define wglCreateDisplayColorTableEXT WGLEW_GET_FUN(__wglewCreateDisplayColorTableEXT)\r\n#define wglDestroyDisplayColorTableEXT WGLEW_GET_FUN(__wglewDestroyDisplayColorTableEXT)\r\n#define wglLoadDisplayColorTableEXT WGLEW_GET_FUN(__wglewLoadDisplayColorTableEXT)\r\n\r\n#define WGLEW_EXT_display_color_table WGLEW_GET_VAR(__WGLEW_EXT_display_color_table)\r\n\r\n#endif /* WGL_EXT_display_color_table */\r\n\r\n/* ----------------------- WGL_EXT_extensions_string ----------------------- */\r\n\r\n#ifndef WGL_EXT_extensions_string\r\n#define WGL_EXT_extensions_string 1\r\n\r\ntypedef const char* (WINAPI * PFNWGLGETEXTENSIONSSTRINGEXTPROC) (void);\r\n\r\n#define wglGetExtensionsStringEXT WGLEW_GET_FUN(__wglewGetExtensionsStringEXT)\r\n\r\n#define WGLEW_EXT_extensions_string WGLEW_GET_VAR(__WGLEW_EXT_extensions_string)\r\n\r\n#endif /* WGL_EXT_extensions_string */\r\n\r\n/* ------------------------ WGL_EXT_framebuffer_sRGB ----------------------- */\r\n\r\n#ifndef WGL_EXT_framebuffer_sRGB\r\n#define WGL_EXT_framebuffer_sRGB 1\r\n\r\n#define WGL_FRAMEBUFFER_SRGB_CAPABLE_EXT 0x20A9\r\n\r\n#define WGLEW_EXT_framebuffer_sRGB WGLEW_GET_VAR(__WGLEW_EXT_framebuffer_sRGB)\r\n\r\n#endif /* WGL_EXT_framebuffer_sRGB */\r\n\r\n/* ----------------------- WGL_EXT_make_current_read ----------------------- */\r\n\r\n#ifndef WGL_EXT_make_current_read\r\n#define WGL_EXT_make_current_read 1\r\n\r\n#define ERROR_INVALID_PIXEL_TYPE_EXT 0x2043\r\n\r\ntypedef HDC (WINAPI * PFNWGLGETCURRENTREADDCEXTPROC) (VOID);\r\ntypedef BOOL (WINAPI * PFNWGLMAKECONTEXTCURRENTEXTPROC) (HDC hDrawDC, HDC hReadDC, HGLRC hglrc);\r\n\r\n#define wglGetCurrentReadDCEXT WGLEW_GET_FUN(__wglewGetCurrentReadDCEXT)\r\n#define wglMakeContextCurrentEXT WGLEW_GET_FUN(__wglewMakeContextCurrentEXT)\r\n\r\n#define WGLEW_EXT_make_current_read WGLEW_GET_VAR(__WGLEW_EXT_make_current_read)\r\n\r\n#endif /* WGL_EXT_make_current_read */\r\n\r\n/* -------------------------- WGL_EXT_multisample -------------------------- */\r\n\r\n#ifndef WGL_EXT_multisample\r\n#define WGL_EXT_multisample 1\r\n\r\n#define WGL_SAMPLE_BUFFERS_EXT 0x2041\r\n#define WGL_SAMPLES_EXT 0x2042\r\n\r\n#define WGLEW_EXT_multisample WGLEW_GET_VAR(__WGLEW_EXT_multisample)\r\n\r\n#endif /* WGL_EXT_multisample */\r\n\r\n/* ---------------------------- WGL_EXT_pbuffer ---------------------------- */\r\n\r\n#ifndef WGL_EXT_pbuffer\r\n#define WGL_EXT_pbuffer 1\r\n\r\n#define WGL_DRAW_TO_PBUFFER_EXT 0x202D\r\n#define WGL_MAX_PBUFFER_PIXELS_EXT 0x202E\r\n#define WGL_MAX_PBUFFER_WIDTH_EXT 0x202F\r\n#define WGL_MAX_PBUFFER_HEIGHT_EXT 0x2030\r\n#define WGL_OPTIMAL_PBUFFER_WIDTH_EXT 0x2031\r\n#define WGL_OPTIMAL_PBUFFER_HEIGHT_EXT 0x2032\r\n#define WGL_PBUFFER_LARGEST_EXT 0x2033\r\n#define WGL_PBUFFER_WIDTH_EXT 0x2034\r\n#define WGL_PBUFFER_HEIGHT_EXT 0x2035\r\n\r\nDECLARE_HANDLE(HPBUFFEREXT);\r\n\r\ntypedef HPBUFFEREXT (WINAPI * PFNWGLCREATEPBUFFEREXTPROC) (HDC hDC, int iPixelFormat, int iWidth, int iHeight, const int* piAttribList);\r\ntypedef BOOL (WINAPI * PFNWGLDESTROYPBUFFEREXTPROC) (HPBUFFEREXT hPbuffer);\r\ntypedef HDC (WINAPI * PFNWGLGETPBUFFERDCEXTPROC) (HPBUFFEREXT hPbuffer);\r\ntypedef BOOL (WINAPI * PFNWGLQUERYPBUFFEREXTPROC) (HPBUFFEREXT hPbuffer, int iAttribute, int* piValue);\r\ntypedef int (WINAPI * PFNWGLRELEASEPBUFFERDCEXTPROC) (HPBUFFEREXT hPbuffer, HDC hDC);\r\n\r\n#define wglCreatePbufferEXT WGLEW_GET_FUN(__wglewCreatePbufferEXT)\r\n#define wglDestroyPbufferEXT WGLEW_GET_FUN(__wglewDestroyPbufferEXT)\r\n#define wglGetPbufferDCEXT WGLEW_GET_FUN(__wglewGetPbufferDCEXT)\r\n#define wglQueryPbufferEXT WGLEW_GET_FUN(__wglewQueryPbufferEXT)\r\n#define wglReleasePbufferDCEXT WGLEW_GET_FUN(__wglewReleasePbufferDCEXT)\r\n\r\n#define WGLEW_EXT_pbuffer WGLEW_GET_VAR(__WGLEW_EXT_pbuffer)\r\n\r\n#endif /* WGL_EXT_pbuffer */\r\n\r\n/* -------------------------- WGL_EXT_pixel_format ------------------------- */\r\n\r\n#ifndef WGL_EXT_pixel_format\r\n#define WGL_EXT_pixel_format 1\r\n\r\n#define WGL_NUMBER_PIXEL_FORMATS_EXT 0x2000\r\n#define WGL_DRAW_TO_WINDOW_EXT 0x2001\r\n#define WGL_DRAW_TO_BITMAP_EXT 0x2002\r\n#define WGL_ACCELERATION_EXT 0x2003\r\n#define WGL_NEED_PALETTE_EXT 0x2004\r\n#define WGL_NEED_SYSTEM_PALETTE_EXT 0x2005\r\n#define WGL_SWAP_LAYER_BUFFERS_EXT 0x2006\r\n#define WGL_SWAP_METHOD_EXT 0x2007\r\n#define WGL_NUMBER_OVERLAYS_EXT 0x2008\r\n#define WGL_NUMBER_UNDERLAYS_EXT 0x2009\r\n#define WGL_TRANSPARENT_EXT 0x200A\r\n#define WGL_TRANSPARENT_VALUE_EXT 0x200B\r\n#define WGL_SHARE_DEPTH_EXT 0x200C\r\n#define WGL_SHARE_STENCIL_EXT 0x200D\r\n#define WGL_SHARE_ACCUM_EXT 0x200E\r\n#define WGL_SUPPORT_GDI_EXT 0x200F\r\n#define WGL_SUPPORT_OPENGL_EXT 0x2010\r\n#define WGL_DOUBLE_BUFFER_EXT 0x2011\r\n#define WGL_STEREO_EXT 0x2012\r\n#define WGL_PIXEL_TYPE_EXT 0x2013\r\n#define WGL_COLOR_BITS_EXT 0x2014\r\n#define WGL_RED_BITS_EXT 0x2015\r\n#define WGL_RED_SHIFT_EXT 0x2016\r\n#define WGL_GREEN_BITS_EXT 0x2017\r\n#define WGL_GREEN_SHIFT_EXT 0x2018\r\n#define WGL_BLUE_BITS_EXT 0x2019\r\n#define WGL_BLUE_SHIFT_EXT 0x201A\r\n#define WGL_ALPHA_BITS_EXT 0x201B\r\n#define WGL_ALPHA_SHIFT_EXT 0x201C\r\n#define WGL_ACCUM_BITS_EXT 0x201D\r\n#define WGL_ACCUM_RED_BITS_EXT 0x201E\r\n#define WGL_ACCUM_GREEN_BITS_EXT 0x201F\r\n#define WGL_ACCUM_BLUE_BITS_EXT 0x2020\r\n#define WGL_ACCUM_ALPHA_BITS_EXT 0x2021\r\n#define WGL_DEPTH_BITS_EXT 0x2022\r\n#define WGL_STENCIL_BITS_EXT 0x2023\r\n#define WGL_AUX_BUFFERS_EXT 0x2024\r\n#define WGL_NO_ACCELERATION_EXT 0x2025\r\n#define WGL_GENERIC_ACCELERATION_EXT 0x2026\r\n#define WGL_FULL_ACCELERATION_EXT 0x2027\r\n#define WGL_SWAP_EXCHANGE_EXT 0x2028\r\n#define WGL_SWAP_COPY_EXT 0x2029\r\n#define WGL_SWAP_UNDEFINED_EXT 0x202A\r\n#define WGL_TYPE_RGBA_EXT 0x202B\r\n#define WGL_TYPE_COLORINDEX_EXT 0x202C\r\n\r\ntypedef BOOL (WINAPI * PFNWGLCHOOSEPIXELFORMATEXTPROC) (HDC hdc, const int* piAttribIList, const FLOAT *pfAttribFList, UINT nMaxFormats, int *piFormats, UINT *nNumFormats);\r\ntypedef BOOL (WINAPI * PFNWGLGETPIXELFORMATATTRIBFVEXTPROC) (HDC hdc, int iPixelFormat, int iLayerPlane, UINT nAttributes, int* piAttributes, FLOAT *pfValues);\r\ntypedef BOOL (WINAPI * PFNWGLGETPIXELFORMATATTRIBIVEXTPROC) (HDC hdc, int iPixelFormat, int iLayerPlane, UINT nAttributes, int* piAttributes, int *piValues);\r\n\r\n#define wglChoosePixelFormatEXT WGLEW_GET_FUN(__wglewChoosePixelFormatEXT)\r\n#define wglGetPixelFormatAttribfvEXT WGLEW_GET_FUN(__wglewGetPixelFormatAttribfvEXT)\r\n#define wglGetPixelFormatAttribivEXT WGLEW_GET_FUN(__wglewGetPixelFormatAttribivEXT)\r\n\r\n#define WGLEW_EXT_pixel_format WGLEW_GET_VAR(__WGLEW_EXT_pixel_format)\r\n\r\n#endif /* WGL_EXT_pixel_format */\r\n\r\n/* ------------------- WGL_EXT_pixel_format_packed_float ------------------- */\r\n\r\n#ifndef WGL_EXT_pixel_format_packed_float\r\n#define WGL_EXT_pixel_format_packed_float 1\r\n\r\n#define WGL_TYPE_RGBA_UNSIGNED_FLOAT_EXT 0x20A8\r\n\r\n#define WGLEW_EXT_pixel_format_packed_float WGLEW_GET_VAR(__WGLEW_EXT_pixel_format_packed_float)\r\n\r\n#endif /* WGL_EXT_pixel_format_packed_float */\r\n\r\n/* -------------------------- WGL_EXT_swap_control ------------------------- */\r\n\r\n#ifndef WGL_EXT_swap_control\r\n#define WGL_EXT_swap_control 1\r\n\r\ntypedef int (WINAPI * PFNWGLGETSWAPINTERVALEXTPROC) (void);\r\ntypedef BOOL (WINAPI * PFNWGLSWAPINTERVALEXTPROC) (int interval);\r\n\r\n#define wglGetSwapIntervalEXT WGLEW_GET_FUN(__wglewGetSwapIntervalEXT)\r\n#define wglSwapIntervalEXT WGLEW_GET_FUN(__wglewSwapIntervalEXT)\r\n\r\n#define WGLEW_EXT_swap_control WGLEW_GET_VAR(__WGLEW_EXT_swap_control)\r\n\r\n#endif /* WGL_EXT_swap_control */\r\n\r\n/* --------------------- WGL_I3D_digital_video_control --------------------- */\r\n\r\n#ifndef WGL_I3D_digital_video_control\r\n#define WGL_I3D_digital_video_control 1\r\n\r\n#define WGL_DIGITAL_VIDEO_CURSOR_ALPHA_FRAMEBUFFER_I3D 0x2050\r\n#define WGL_DIGITAL_VIDEO_CURSOR_ALPHA_VALUE_I3D 0x2051\r\n#define WGL_DIGITAL_VIDEO_CURSOR_INCLUDED_I3D 0x2052\r\n#define WGL_DIGITAL_VIDEO_GAMMA_CORRECTED_I3D 0x2053\r\n\r\ntypedef BOOL (WINAPI * PFNWGLGETDIGITALVIDEOPARAMETERSI3DPROC) (HDC hDC, int iAttribute, int* piValue);\r\ntypedef BOOL (WINAPI * PFNWGLSETDIGITALVIDEOPARAMETERSI3DPROC) (HDC hDC, int iAttribute, const int* piValue);\r\n\r\n#define wglGetDigitalVideoParametersI3D WGLEW_GET_FUN(__wglewGetDigitalVideoParametersI3D)\r\n#define wglSetDigitalVideoParametersI3D WGLEW_GET_FUN(__wglewSetDigitalVideoParametersI3D)\r\n\r\n#define WGLEW_I3D_digital_video_control WGLEW_GET_VAR(__WGLEW_I3D_digital_video_control)\r\n\r\n#endif /* WGL_I3D_digital_video_control */\r\n\r\n/* ----------------------------- WGL_I3D_gamma ----------------------------- */\r\n\r\n#ifndef WGL_I3D_gamma\r\n#define WGL_I3D_gamma 1\r\n\r\n#define WGL_GAMMA_TABLE_SIZE_I3D 0x204E\r\n#define WGL_GAMMA_EXCLUDE_DESKTOP_I3D 0x204F\r\n\r\ntypedef BOOL (WINAPI * PFNWGLGETGAMMATABLEI3DPROC) (HDC hDC, int iEntries, USHORT* puRed, USHORT *puGreen, USHORT *puBlue);\r\ntypedef BOOL (WINAPI * PFNWGLGETGAMMATABLEPARAMETERSI3DPROC) (HDC hDC, int iAttribute, int* piValue);\r\ntypedef BOOL (WINAPI * PFNWGLSETGAMMATABLEI3DPROC) (HDC hDC, int iEntries, const USHORT* puRed, const USHORT *puGreen, const USHORT *puBlue);\r\ntypedef BOOL (WINAPI * PFNWGLSETGAMMATABLEPARAMETERSI3DPROC) (HDC hDC, int iAttribute, const int* piValue);\r\n\r\n#define wglGetGammaTableI3D WGLEW_GET_FUN(__wglewGetGammaTableI3D)\r\n#define wglGetGammaTableParametersI3D WGLEW_GET_FUN(__wglewGetGammaTableParametersI3D)\r\n#define wglSetGammaTableI3D WGLEW_GET_FUN(__wglewSetGammaTableI3D)\r\n#define wglSetGammaTableParametersI3D WGLEW_GET_FUN(__wglewSetGammaTableParametersI3D)\r\n\r\n#define WGLEW_I3D_gamma WGLEW_GET_VAR(__WGLEW_I3D_gamma)\r\n\r\n#endif /* WGL_I3D_gamma */\r\n\r\n/* ---------------------------- WGL_I3D_genlock ---------------------------- */\r\n\r\n#ifndef WGL_I3D_genlock\r\n#define WGL_I3D_genlock 1\r\n\r\n#define WGL_GENLOCK_SOURCE_MULTIVIEW_I3D 0x2044\r\n#define WGL_GENLOCK_SOURCE_EXTERNAL_SYNC_I3D 0x2045\r\n#define WGL_GENLOCK_SOURCE_EXTERNAL_FIELD_I3D 0x2046\r\n#define WGL_GENLOCK_SOURCE_EXTERNAL_TTL_I3D 0x2047\r\n#define WGL_GENLOCK_SOURCE_DIGITAL_SYNC_I3D 0x2048\r\n#define WGL_GENLOCK_SOURCE_DIGITAL_FIELD_I3D 0x2049\r\n#define WGL_GENLOCK_SOURCE_EDGE_FALLING_I3D 0x204A\r\n#define WGL_GENLOCK_SOURCE_EDGE_RISING_I3D 0x204B\r\n#define WGL_GENLOCK_SOURCE_EDGE_BOTH_I3D 0x204C\r\n\r\ntypedef BOOL (WINAPI * PFNWGLDISABLEGENLOCKI3DPROC) (HDC hDC);\r\ntypedef BOOL (WINAPI * PFNWGLENABLEGENLOCKI3DPROC) (HDC hDC);\r\ntypedef BOOL (WINAPI * PFNWGLGENLOCKSAMPLERATEI3DPROC) (HDC hDC, UINT uRate);\r\ntypedef BOOL (WINAPI * PFNWGLGENLOCKSOURCEDELAYI3DPROC) (HDC hDC, UINT uDelay);\r\ntypedef BOOL (WINAPI * PFNWGLGENLOCKSOURCEEDGEI3DPROC) (HDC hDC, UINT uEdge);\r\ntypedef BOOL (WINAPI * PFNWGLGENLOCKSOURCEI3DPROC) (HDC hDC, UINT uSource);\r\ntypedef BOOL (WINAPI * PFNWGLGETGENLOCKSAMPLERATEI3DPROC) (HDC hDC, UINT* uRate);\r\ntypedef BOOL (WINAPI * PFNWGLGETGENLOCKSOURCEDELAYI3DPROC) (HDC hDC, UINT* uDelay);\r\ntypedef BOOL (WINAPI * PFNWGLGETGENLOCKSOURCEEDGEI3DPROC) (HDC hDC, UINT* uEdge);\r\ntypedef BOOL (WINAPI * PFNWGLGETGENLOCKSOURCEI3DPROC) (HDC hDC, UINT* uSource);\r\ntypedef BOOL (WINAPI * PFNWGLISENABLEDGENLOCKI3DPROC) (HDC hDC, BOOL* pFlag);\r\ntypedef BOOL (WINAPI * PFNWGLQUERYGENLOCKMAXSOURCEDELAYI3DPROC) (HDC hDC, UINT* uMaxLineDelay, UINT *uMaxPixelDelay);\r\n\r\n#define wglDisableGenlockI3D WGLEW_GET_FUN(__wglewDisableGenlockI3D)\r\n#define wglEnableGenlockI3D WGLEW_GET_FUN(__wglewEnableGenlockI3D)\r\n#define wglGenlockSampleRateI3D WGLEW_GET_FUN(__wglewGenlockSampleRateI3D)\r\n#define wglGenlockSourceDelayI3D WGLEW_GET_FUN(__wglewGenlockSourceDelayI3D)\r\n#define wglGenlockSourceEdgeI3D WGLEW_GET_FUN(__wglewGenlockSourceEdgeI3D)\r\n#define wglGenlockSourceI3D WGLEW_GET_FUN(__wglewGenlockSourceI3D)\r\n#define wglGetGenlockSampleRateI3D WGLEW_GET_FUN(__wglewGetGenlockSampleRateI3D)\r\n#define wglGetGenlockSourceDelayI3D WGLEW_GET_FUN(__wglewGetGenlockSourceDelayI3D)\r\n#define wglGetGenlockSourceEdgeI3D WGLEW_GET_FUN(__wglewGetGenlockSourceEdgeI3D)\r\n#define wglGetGenlockSourceI3D WGLEW_GET_FUN(__wglewGetGenlockSourceI3D)\r\n#define wglIsEnabledGenlockI3D WGLEW_GET_FUN(__wglewIsEnabledGenlockI3D)\r\n#define wglQueryGenlockMaxSourceDelayI3D WGLEW_GET_FUN(__wglewQueryGenlockMaxSourceDelayI3D)\r\n\r\n#define WGLEW_I3D_genlock WGLEW_GET_VAR(__WGLEW_I3D_genlock)\r\n\r\n#endif /* WGL_I3D_genlock */\r\n\r\n/* -------------------------- WGL_I3D_image_buffer ------------------------- */\r\n\r\n#ifndef WGL_I3D_image_buffer\r\n#define WGL_I3D_image_buffer 1\r\n\r\n#define WGL_IMAGE_BUFFER_MIN_ACCESS_I3D 0x00000001\r\n#define WGL_IMAGE_BUFFER_LOCK_I3D 0x00000002\r\n\r\ntypedef BOOL (WINAPI * PFNWGLASSOCIATEIMAGEBUFFEREVENTSI3DPROC) (HDC hdc, HANDLE* pEvent, LPVOID *pAddress, DWORD *pSize, UINT count);\r\ntypedef LPVOID (WINAPI * PFNWGLCREATEIMAGEBUFFERI3DPROC) (HDC hDC, DWORD dwSize, UINT uFlags);\r\ntypedef BOOL (WINAPI * PFNWGLDESTROYIMAGEBUFFERI3DPROC) (HDC hDC, LPVOID pAddress);\r\ntypedef BOOL (WINAPI * PFNWGLRELEASEIMAGEBUFFEREVENTSI3DPROC) (HDC hdc, LPVOID* pAddress, UINT count);\r\n\r\n#define wglAssociateImageBufferEventsI3D WGLEW_GET_FUN(__wglewAssociateImageBufferEventsI3D)\r\n#define wglCreateImageBufferI3D WGLEW_GET_FUN(__wglewCreateImageBufferI3D)\r\n#define wglDestroyImageBufferI3D WGLEW_GET_FUN(__wglewDestroyImageBufferI3D)\r\n#define wglReleaseImageBufferEventsI3D WGLEW_GET_FUN(__wglewReleaseImageBufferEventsI3D)\r\n\r\n#define WGLEW_I3D_image_buffer WGLEW_GET_VAR(__WGLEW_I3D_image_buffer)\r\n\r\n#endif /* WGL_I3D_image_buffer */\r\n\r\n/* ------------------------ WGL_I3D_swap_frame_lock ------------------------ */\r\n\r\n#ifndef WGL_I3D_swap_frame_lock\r\n#define WGL_I3D_swap_frame_lock 1\r\n\r\ntypedef BOOL (WINAPI * PFNWGLDISABLEFRAMELOCKI3DPROC) (VOID);\r\ntypedef BOOL (WINAPI * PFNWGLENABLEFRAMELOCKI3DPROC) (VOID);\r\ntypedef BOOL (WINAPI * PFNWGLISENABLEDFRAMELOCKI3DPROC) (BOOL* pFlag);\r\ntypedef BOOL (WINAPI * PFNWGLQUERYFRAMELOCKMASTERI3DPROC) (BOOL* pFlag);\r\n\r\n#define wglDisableFrameLockI3D WGLEW_GET_FUN(__wglewDisableFrameLockI3D)\r\n#define wglEnableFrameLockI3D WGLEW_GET_FUN(__wglewEnableFrameLockI3D)\r\n#define wglIsEnabledFrameLockI3D WGLEW_GET_FUN(__wglewIsEnabledFrameLockI3D)\r\n#define wglQueryFrameLockMasterI3D WGLEW_GET_FUN(__wglewQueryFrameLockMasterI3D)\r\n\r\n#define WGLEW_I3D_swap_frame_lock WGLEW_GET_VAR(__WGLEW_I3D_swap_frame_lock)\r\n\r\n#endif /* WGL_I3D_swap_frame_lock */\r\n\r\n/* ------------------------ WGL_I3D_swap_frame_usage ----------------------- */\r\n\r\n#ifndef WGL_I3D_swap_frame_usage\r\n#define WGL_I3D_swap_frame_usage 1\r\n\r\ntypedef BOOL (WINAPI * PFNWGLBEGINFRAMETRACKINGI3DPROC) (void);\r\ntypedef BOOL (WINAPI * PFNWGLENDFRAMETRACKINGI3DPROC) (void);\r\ntypedef BOOL (WINAPI * PFNWGLGETFRAMEUSAGEI3DPROC) (float* pUsage);\r\ntypedef BOOL (WINAPI * PFNWGLQUERYFRAMETRACKINGI3DPROC) (DWORD* pFrameCount, DWORD *pMissedFrames, float *pLastMissedUsage);\r\n\r\n#define wglBeginFrameTrackingI3D WGLEW_GET_FUN(__wglewBeginFrameTrackingI3D)\r\n#define wglEndFrameTrackingI3D WGLEW_GET_FUN(__wglewEndFrameTrackingI3D)\r\n#define wglGetFrameUsageI3D WGLEW_GET_FUN(__wglewGetFrameUsageI3D)\r\n#define wglQueryFrameTrackingI3D WGLEW_GET_FUN(__wglewQueryFrameTrackingI3D)\r\n\r\n#define WGLEW_I3D_swap_frame_usage WGLEW_GET_VAR(__WGLEW_I3D_swap_frame_usage)\r\n\r\n#endif /* WGL_I3D_swap_frame_usage */\r\n\r\n/* --------------------------- WGL_NV_DX_interop --------------------------- */\r\n\r\n#ifndef WGL_NV_DX_interop\r\n#define WGL_NV_DX_interop 1\r\n\r\n#define WGL_ACCESS_READ_ONLY_NV 0x0000\r\n#define WGL_ACCESS_READ_WRITE_NV 0x0001\r\n#define WGL_ACCESS_WRITE_DISCARD_NV 0x0002\r\n\r\ntypedef BOOL (WINAPI * PFNWGLDXCLOSEDEVICENVPROC) (HANDLE hDevice);\r\ntypedef BOOL (WINAPI * PFNWGLDXLOCKOBJECTSNVPROC) (HANDLE hDevice, GLint count, HANDLE* hObjects);\r\ntypedef BOOL (WINAPI * PFNWGLDXOBJECTACCESSNVPROC) (HANDLE hObject, GLenum access);\r\ntypedef HANDLE (WINAPI * PFNWGLDXOPENDEVICENVPROC) (void* dxDevice);\r\ntypedef HANDLE (WINAPI * PFNWGLDXREGISTEROBJECTNVPROC) (HANDLE hDevice, void* dxObject, GLuint name, GLenum type, GLenum access);\r\ntypedef BOOL (WINAPI * PFNWGLDXSETRESOURCESHAREHANDLENVPROC) (void* dxObject, HANDLE shareHandle);\r\ntypedef BOOL (WINAPI * PFNWGLDXUNLOCKOBJECTSNVPROC) (HANDLE hDevice, GLint count, HANDLE* hObjects);\r\ntypedef BOOL (WINAPI * PFNWGLDXUNREGISTEROBJECTNVPROC) (HANDLE hDevice, HANDLE hObject);\r\n\r\n#define wglDXCloseDeviceNV WGLEW_GET_FUN(__wglewDXCloseDeviceNV)\r\n#define wglDXLockObjectsNV WGLEW_GET_FUN(__wglewDXLockObjectsNV)\r\n#define wglDXObjectAccessNV WGLEW_GET_FUN(__wglewDXObjectAccessNV)\r\n#define wglDXOpenDeviceNV WGLEW_GET_FUN(__wglewDXOpenDeviceNV)\r\n#define wglDXRegisterObjectNV WGLEW_GET_FUN(__wglewDXRegisterObjectNV)\r\n#define wglDXSetResourceShareHandleNV WGLEW_GET_FUN(__wglewDXSetResourceShareHandleNV)\r\n#define wglDXUnlockObjectsNV WGLEW_GET_FUN(__wglewDXUnlockObjectsNV)\r\n#define wglDXUnregisterObjectNV WGLEW_GET_FUN(__wglewDXUnregisterObjectNV)\r\n\r\n#define WGLEW_NV_DX_interop WGLEW_GET_VAR(__WGLEW_NV_DX_interop)\r\n\r\n#endif /* WGL_NV_DX_interop */\r\n\r\n/* --------------------------- WGL_NV_copy_image --------------------------- */\r\n\r\n#ifndef WGL_NV_copy_image\r\n#define WGL_NV_copy_image 1\r\n\r\ntypedef BOOL (WINAPI * PFNWGLCOPYIMAGESUBDATANVPROC) (HGLRC hSrcRC, GLuint srcName, GLenum srcTarget, GLint srcLevel, GLint srcX, GLint srcY, GLint srcZ, HGLRC hDstRC, GLuint dstName, GLenum dstTarget, GLint dstLevel, GLint dstX, GLint dstY, GLint dstZ, GLsizei width, GLsizei height, GLsizei depth);\r\n\r\n#define wglCopyImageSubDataNV WGLEW_GET_FUN(__wglewCopyImageSubDataNV)\r\n\r\n#define WGLEW_NV_copy_image WGLEW_GET_VAR(__WGLEW_NV_copy_image)\r\n\r\n#endif /* WGL_NV_copy_image */\r\n\r\n/* -------------------------- WGL_NV_float_buffer -------------------------- */\r\n\r\n#ifndef WGL_NV_float_buffer\r\n#define WGL_NV_float_buffer 1\r\n\r\n#define WGL_FLOAT_COMPONENTS_NV 0x20B0\r\n#define WGL_BIND_TO_TEXTURE_RECTANGLE_FLOAT_R_NV 0x20B1\r\n#define WGL_BIND_TO_TEXTURE_RECTANGLE_FLOAT_RG_NV 0x20B2\r\n#define WGL_BIND_TO_TEXTURE_RECTANGLE_FLOAT_RGB_NV 0x20B3\r\n#define WGL_BIND_TO_TEXTURE_RECTANGLE_FLOAT_RGBA_NV 0x20B4\r\n#define WGL_TEXTURE_FLOAT_R_NV 0x20B5\r\n#define WGL_TEXTURE_FLOAT_RG_NV 0x20B6\r\n#define WGL_TEXTURE_FLOAT_RGB_NV 0x20B7\r\n#define WGL_TEXTURE_FLOAT_RGBA_NV 0x20B8\r\n\r\n#define WGLEW_NV_float_buffer WGLEW_GET_VAR(__WGLEW_NV_float_buffer)\r\n\r\n#endif /* WGL_NV_float_buffer */\r\n\r\n/* -------------------------- WGL_NV_gpu_affinity -------------------------- */\r\n\r\n#ifndef WGL_NV_gpu_affinity\r\n#define WGL_NV_gpu_affinity 1\r\n\r\n#define WGL_ERROR_INCOMPATIBLE_AFFINITY_MASKS_NV 0x20D0\r\n#define WGL_ERROR_MISSING_AFFINITY_MASK_NV 0x20D1\r\n\r\nDECLARE_HANDLE(HGPUNV);\r\ntypedef struct _GPU_DEVICE {\r\n DWORD cb; \r\n CHAR DeviceName[32]; \r\n CHAR DeviceString[128]; \r\n DWORD Flags; \r\n RECT rcVirtualScreen; \r\n} GPU_DEVICE, *PGPU_DEVICE;\r\n\r\ntypedef HDC (WINAPI * PFNWGLCREATEAFFINITYDCNVPROC) (const HGPUNV *phGpuList);\r\ntypedef BOOL (WINAPI * PFNWGLDELETEDCNVPROC) (HDC hdc);\r\ntypedef BOOL (WINAPI * PFNWGLENUMGPUDEVICESNVPROC) (HGPUNV hGpu, UINT iDeviceIndex, PGPU_DEVICE lpGpuDevice);\r\ntypedef BOOL (WINAPI * PFNWGLENUMGPUSFROMAFFINITYDCNVPROC) (HDC hAffinityDC, UINT iGpuIndex, HGPUNV *hGpu);\r\ntypedef BOOL (WINAPI * PFNWGLENUMGPUSNVPROC) (UINT iGpuIndex, HGPUNV *phGpu);\r\n\r\n#define wglCreateAffinityDCNV WGLEW_GET_FUN(__wglewCreateAffinityDCNV)\r\n#define wglDeleteDCNV WGLEW_GET_FUN(__wglewDeleteDCNV)\r\n#define wglEnumGpuDevicesNV WGLEW_GET_FUN(__wglewEnumGpuDevicesNV)\r\n#define wglEnumGpusFromAffinityDCNV WGLEW_GET_FUN(__wglewEnumGpusFromAffinityDCNV)\r\n#define wglEnumGpusNV WGLEW_GET_FUN(__wglewEnumGpusNV)\r\n\r\n#define WGLEW_NV_gpu_affinity WGLEW_GET_VAR(__WGLEW_NV_gpu_affinity)\r\n\r\n#endif /* WGL_NV_gpu_affinity */\r\n\r\n/* ---------------------- WGL_NV_multisample_coverage ---------------------- */\r\n\r\n#ifndef WGL_NV_multisample_coverage\r\n#define WGL_NV_multisample_coverage 1\r\n\r\n#define WGL_COVERAGE_SAMPLES_NV 0x2042\r\n#define WGL_COLOR_SAMPLES_NV 0x20B9\r\n\r\n#define WGLEW_NV_multisample_coverage WGLEW_GET_VAR(__WGLEW_NV_multisample_coverage)\r\n\r\n#endif /* WGL_NV_multisample_coverage */\r\n\r\n/* -------------------------- WGL_NV_present_video ------------------------- */\r\n\r\n#ifndef WGL_NV_present_video\r\n#define WGL_NV_present_video 1\r\n\r\n#define WGL_NUM_VIDEO_SLOTS_NV 0x20F0\r\n\r\nDECLARE_HANDLE(HVIDEOOUTPUTDEVICENV);\r\n\r\ntypedef BOOL (WINAPI * PFNWGLBINDVIDEODEVICENVPROC) (HDC hDc, unsigned int uVideoSlot, HVIDEOOUTPUTDEVICENV hVideoDevice, const int* piAttribList);\r\ntypedef int (WINAPI * PFNWGLENUMERATEVIDEODEVICESNVPROC) (HDC hDc, HVIDEOOUTPUTDEVICENV* phDeviceList);\r\ntypedef BOOL (WINAPI * PFNWGLQUERYCURRENTCONTEXTNVPROC) (int iAttribute, int* piValue);\r\n\r\n#define wglBindVideoDeviceNV WGLEW_GET_FUN(__wglewBindVideoDeviceNV)\r\n#define wglEnumerateVideoDevicesNV WGLEW_GET_FUN(__wglewEnumerateVideoDevicesNV)\r\n#define wglQueryCurrentContextNV WGLEW_GET_FUN(__wglewQueryCurrentContextNV)\r\n\r\n#define WGLEW_NV_present_video WGLEW_GET_VAR(__WGLEW_NV_present_video)\r\n\r\n#endif /* WGL_NV_present_video */\r\n\r\n/* ---------------------- WGL_NV_render_depth_texture ---------------------- */\r\n\r\n#ifndef WGL_NV_render_depth_texture\r\n#define WGL_NV_render_depth_texture 1\r\n\r\n#define WGL_NO_TEXTURE_ARB 0x2077\r\n#define WGL_BIND_TO_TEXTURE_DEPTH_NV 0x20A3\r\n#define WGL_BIND_TO_TEXTURE_RECTANGLE_DEPTH_NV 0x20A4\r\n#define WGL_DEPTH_TEXTURE_FORMAT_NV 0x20A5\r\n#define WGL_TEXTURE_DEPTH_COMPONENT_NV 0x20A6\r\n#define WGL_DEPTH_COMPONENT_NV 0x20A7\r\n\r\n#define WGLEW_NV_render_depth_texture WGLEW_GET_VAR(__WGLEW_NV_render_depth_texture)\r\n\r\n#endif /* WGL_NV_render_depth_texture */\r\n\r\n/* -------------------- WGL_NV_render_texture_rectangle -------------------- */\r\n\r\n#ifndef WGL_NV_render_texture_rectangle\r\n#define WGL_NV_render_texture_rectangle 1\r\n\r\n#define WGL_BIND_TO_TEXTURE_RECTANGLE_RGB_NV 0x20A0\r\n#define WGL_BIND_TO_TEXTURE_RECTANGLE_RGBA_NV 0x20A1\r\n#define WGL_TEXTURE_RECTANGLE_NV 0x20A2\r\n\r\n#define WGLEW_NV_render_texture_rectangle WGLEW_GET_VAR(__WGLEW_NV_render_texture_rectangle)\r\n\r\n#endif /* WGL_NV_render_texture_rectangle */\r\n\r\n/* --------------------------- WGL_NV_swap_group --------------------------- */\r\n\r\n#ifndef WGL_NV_swap_group\r\n#define WGL_NV_swap_group 1\r\n\r\ntypedef BOOL (WINAPI * PFNWGLBINDSWAPBARRIERNVPROC) (GLuint group, GLuint barrier);\r\ntypedef BOOL (WINAPI * PFNWGLJOINSWAPGROUPNVPROC) (HDC hDC, GLuint group);\r\ntypedef BOOL (WINAPI * PFNWGLQUERYFRAMECOUNTNVPROC) (HDC hDC, GLuint* count);\r\ntypedef BOOL (WINAPI * PFNWGLQUERYMAXSWAPGROUPSNVPROC) (HDC hDC, GLuint* maxGroups, GLuint *maxBarriers);\r\ntypedef BOOL (WINAPI * PFNWGLQUERYSWAPGROUPNVPROC) (HDC hDC, GLuint* group, GLuint *barrier);\r\ntypedef BOOL (WINAPI * PFNWGLRESETFRAMECOUNTNVPROC) (HDC hDC);\r\n\r\n#define wglBindSwapBarrierNV WGLEW_GET_FUN(__wglewBindSwapBarrierNV)\r\n#define wglJoinSwapGroupNV WGLEW_GET_FUN(__wglewJoinSwapGroupNV)\r\n#define wglQueryFrameCountNV WGLEW_GET_FUN(__wglewQueryFrameCountNV)\r\n#define wglQueryMaxSwapGroupsNV WGLEW_GET_FUN(__wglewQueryMaxSwapGroupsNV)\r\n#define wglQuerySwapGroupNV WGLEW_GET_FUN(__wglewQuerySwapGroupNV)\r\n#define wglResetFrameCountNV WGLEW_GET_FUN(__wglewResetFrameCountNV)\r\n\r\n#define WGLEW_NV_swap_group WGLEW_GET_VAR(__WGLEW_NV_swap_group)\r\n\r\n#endif /* WGL_NV_swap_group */\r\n\r\n/* ----------------------- WGL_NV_vertex_array_range ----------------------- */\r\n\r\n#ifndef WGL_NV_vertex_array_range\r\n#define WGL_NV_vertex_array_range 1\r\n\r\ntypedef void * (WINAPI * PFNWGLALLOCATEMEMORYNVPROC) (GLsizei size, GLfloat readFrequency, GLfloat writeFrequency, GLfloat priority);\r\ntypedef void (WINAPI * PFNWGLFREEMEMORYNVPROC) (void *pointer);\r\n\r\n#define wglAllocateMemoryNV WGLEW_GET_FUN(__wglewAllocateMemoryNV)\r\n#define wglFreeMemoryNV WGLEW_GET_FUN(__wglewFreeMemoryNV)\r\n\r\n#define WGLEW_NV_vertex_array_range WGLEW_GET_VAR(__WGLEW_NV_vertex_array_range)\r\n\r\n#endif /* WGL_NV_vertex_array_range */\r\n\r\n/* -------------------------- WGL_NV_video_capture ------------------------- */\r\n\r\n#ifndef WGL_NV_video_capture\r\n#define WGL_NV_video_capture 1\r\n\r\n#define WGL_UNIQUE_ID_NV 0x20CE\r\n#define WGL_NUM_VIDEO_CAPTURE_SLOTS_NV 0x20CF\r\n\r\nDECLARE_HANDLE(HVIDEOINPUTDEVICENV);\r\n\r\ntypedef BOOL (WINAPI * PFNWGLBINDVIDEOCAPTUREDEVICENVPROC) (UINT uVideoSlot, HVIDEOINPUTDEVICENV hDevice);\r\ntypedef UINT (WINAPI * PFNWGLENUMERATEVIDEOCAPTUREDEVICESNVPROC) (HDC hDc, HVIDEOINPUTDEVICENV* phDeviceList);\r\ntypedef BOOL (WINAPI * PFNWGLLOCKVIDEOCAPTUREDEVICENVPROC) (HDC hDc, HVIDEOINPUTDEVICENV hDevice);\r\ntypedef BOOL (WINAPI * PFNWGLQUERYVIDEOCAPTUREDEVICENVPROC) (HDC hDc, HVIDEOINPUTDEVICENV hDevice, int iAttribute, int* piValue);\r\ntypedef BOOL (WINAPI * PFNWGLRELEASEVIDEOCAPTUREDEVICENVPROC) (HDC hDc, HVIDEOINPUTDEVICENV hDevice);\r\n\r\n#define wglBindVideoCaptureDeviceNV WGLEW_GET_FUN(__wglewBindVideoCaptureDeviceNV)\r\n#define wglEnumerateVideoCaptureDevicesNV WGLEW_GET_FUN(__wglewEnumerateVideoCaptureDevicesNV)\r\n#define wglLockVideoCaptureDeviceNV WGLEW_GET_FUN(__wglewLockVideoCaptureDeviceNV)\r\n#define wglQueryVideoCaptureDeviceNV WGLEW_GET_FUN(__wglewQueryVideoCaptureDeviceNV)\r\n#define wglReleaseVideoCaptureDeviceNV WGLEW_GET_FUN(__wglewReleaseVideoCaptureDeviceNV)\r\n\r\n#define WGLEW_NV_video_capture WGLEW_GET_VAR(__WGLEW_NV_video_capture)\r\n\r\n#endif /* WGL_NV_video_capture */\r\n\r\n/* -------------------------- WGL_NV_video_output -------------------------- */\r\n\r\n#ifndef WGL_NV_video_output\r\n#define WGL_NV_video_output 1\r\n\r\n#define WGL_BIND_TO_VIDEO_RGB_NV 0x20C0\r\n#define WGL_BIND_TO_VIDEO_RGBA_NV 0x20C1\r\n#define WGL_BIND_TO_VIDEO_RGB_AND_DEPTH_NV 0x20C2\r\n#define WGL_VIDEO_OUT_COLOR_NV 0x20C3\r\n#define WGL_VIDEO_OUT_ALPHA_NV 0x20C4\r\n#define WGL_VIDEO_OUT_DEPTH_NV 0x20C5\r\n#define WGL_VIDEO_OUT_COLOR_AND_ALPHA_NV 0x20C6\r\n#define WGL_VIDEO_OUT_COLOR_AND_DEPTH_NV 0x20C7\r\n#define WGL_VIDEO_OUT_FRAME 0x20C8\r\n#define WGL_VIDEO_OUT_FIELD_1 0x20C9\r\n#define WGL_VIDEO_OUT_FIELD_2 0x20CA\r\n#define WGL_VIDEO_OUT_STACKED_FIELDS_1_2 0x20CB\r\n#define WGL_VIDEO_OUT_STACKED_FIELDS_2_1 0x20CC\r\n\r\nDECLARE_HANDLE(HPVIDEODEV);\r\n\r\ntypedef BOOL (WINAPI * PFNWGLBINDVIDEOIMAGENVPROC) (HPVIDEODEV hVideoDevice, HPBUFFERARB hPbuffer, int iVideoBuffer);\r\ntypedef BOOL (WINAPI * PFNWGLGETVIDEODEVICENVPROC) (HDC hDC, int numDevices, HPVIDEODEV* hVideoDevice);\r\ntypedef BOOL (WINAPI * PFNWGLGETVIDEOINFONVPROC) (HPVIDEODEV hpVideoDevice, unsigned long* pulCounterOutputPbuffer, unsigned long *pulCounterOutputVideo);\r\ntypedef BOOL (WINAPI * PFNWGLRELEASEVIDEODEVICENVPROC) (HPVIDEODEV hVideoDevice);\r\ntypedef BOOL (WINAPI * PFNWGLRELEASEVIDEOIMAGENVPROC) (HPBUFFERARB hPbuffer, int iVideoBuffer);\r\ntypedef BOOL (WINAPI * PFNWGLSENDPBUFFERTOVIDEONVPROC) (HPBUFFERARB hPbuffer, int iBufferType, unsigned long* pulCounterPbuffer, BOOL bBlock);\r\n\r\n#define wglBindVideoImageNV WGLEW_GET_FUN(__wglewBindVideoImageNV)\r\n#define wglGetVideoDeviceNV WGLEW_GET_FUN(__wglewGetVideoDeviceNV)\r\n#define wglGetVideoInfoNV WGLEW_GET_FUN(__wglewGetVideoInfoNV)\r\n#define wglReleaseVideoDeviceNV WGLEW_GET_FUN(__wglewReleaseVideoDeviceNV)\r\n#define wglReleaseVideoImageNV WGLEW_GET_FUN(__wglewReleaseVideoImageNV)\r\n#define wglSendPbufferToVideoNV WGLEW_GET_FUN(__wglewSendPbufferToVideoNV)\r\n\r\n#define WGLEW_NV_video_output WGLEW_GET_VAR(__WGLEW_NV_video_output)\r\n\r\n#endif /* WGL_NV_video_output */\r\n\r\n/* -------------------------- WGL_OML_sync_control ------------------------- */\r\n\r\n#ifndef WGL_OML_sync_control\r\n#define WGL_OML_sync_control 1\r\n\r\ntypedef BOOL (WINAPI * PFNWGLGETMSCRATEOMLPROC) (HDC hdc, INT32* numerator, INT32 *denominator);\r\ntypedef BOOL (WINAPI * PFNWGLGETSYNCVALUESOMLPROC) (HDC hdc, INT64* ust, INT64 *msc, INT64 *sbc);\r\ntypedef INT64 (WINAPI * PFNWGLSWAPBUFFERSMSCOMLPROC) (HDC hdc, INT64 target_msc, INT64 divisor, INT64 remainder);\r\ntypedef INT64 (WINAPI * PFNWGLSWAPLAYERBUFFERSMSCOMLPROC) (HDC hdc, INT fuPlanes, INT64 target_msc, INT64 divisor, INT64 remainder);\r\ntypedef BOOL (WINAPI * PFNWGLWAITFORMSCOMLPROC) (HDC hdc, INT64 target_msc, INT64 divisor, INT64 remainder, INT64* ust, INT64 *msc, INT64 *sbc);\r\ntypedef BOOL (WINAPI * PFNWGLWAITFORSBCOMLPROC) (HDC hdc, INT64 target_sbc, INT64* ust, INT64 *msc, INT64 *sbc);\r\n\r\n#define wglGetMscRateOML WGLEW_GET_FUN(__wglewGetMscRateOML)\r\n#define wglGetSyncValuesOML WGLEW_GET_FUN(__wglewGetSyncValuesOML)\r\n#define wglSwapBuffersMscOML WGLEW_GET_FUN(__wglewSwapBuffersMscOML)\r\n#define wglSwapLayerBuffersMscOML WGLEW_GET_FUN(__wglewSwapLayerBuffersMscOML)\r\n#define wglWaitForMscOML WGLEW_GET_FUN(__wglewWaitForMscOML)\r\n#define wglWaitForSbcOML WGLEW_GET_FUN(__wglewWaitForSbcOML)\r\n\r\n#define WGLEW_OML_sync_control WGLEW_GET_VAR(__WGLEW_OML_sync_control)\r\n\r\n#endif /* WGL_OML_sync_control */\r\n\r\n/* ------------------------------------------------------------------------- */\r\n\r\n#ifdef GLEW_MX\r\n#define WGLEW_EXPORT\r\n#else\r\n#define WGLEW_EXPORT GLEWAPI\r\n#endif /* GLEW_MX */\r\n\r\n#ifdef GLEW_MX\r\nstruct WGLEWContextStruct\r\n{\r\n#endif /* GLEW_MX */\r\n\r\nWGLEW_EXPORT PFNWGLSETSTEREOEMITTERSTATE3DLPROC __wglewSetStereoEmitterState3DL;\r\n\r\nWGLEW_EXPORT PFNWGLBLITCONTEXTFRAMEBUFFERAMDPROC __wglewBlitContextFramebufferAMD;\r\nWGLEW_EXPORT PFNWGLCREATEASSOCIATEDCONTEXTAMDPROC __wglewCreateAssociatedContextAMD;\r\nWGLEW_EXPORT PFNWGLCREATEASSOCIATEDCONTEXTATTRIBSAMDPROC __wglewCreateAssociatedContextAttribsAMD;\r\nWGLEW_EXPORT PFNWGLDELETEASSOCIATEDCONTEXTAMDPROC __wglewDeleteAssociatedContextAMD;\r\nWGLEW_EXPORT PFNWGLGETCONTEXTGPUIDAMDPROC __wglewGetContextGPUIDAMD;\r\nWGLEW_EXPORT PFNWGLGETCURRENTASSOCIATEDCONTEXTAMDPROC __wglewGetCurrentAssociatedContextAMD;\r\nWGLEW_EXPORT PFNWGLGETGPUIDSAMDPROC __wglewGetGPUIDsAMD;\r\nWGLEW_EXPORT PFNWGLGETGPUINFOAMDPROC __wglewGetGPUInfoAMD;\r\nWGLEW_EXPORT PFNWGLMAKEASSOCIATEDCONTEXTCURRENTAMDPROC __wglewMakeAssociatedContextCurrentAMD;\r\n\r\nWGLEW_EXPORT PFNWGLCREATEBUFFERREGIONARBPROC __wglewCreateBufferRegionARB;\r\nWGLEW_EXPORT PFNWGLDELETEBUFFERREGIONARBPROC __wglewDeleteBufferRegionARB;\r\nWGLEW_EXPORT PFNWGLRESTOREBUFFERREGIONARBPROC __wglewRestoreBufferRegionARB;\r\nWGLEW_EXPORT PFNWGLSAVEBUFFERREGIONARBPROC __wglewSaveBufferRegionARB;\r\n\r\nWGLEW_EXPORT PFNWGLCREATECONTEXTATTRIBSARBPROC __wglewCreateContextAttribsARB;\r\n\r\nWGLEW_EXPORT PFNWGLGETEXTENSIONSSTRINGARBPROC __wglewGetExtensionsStringARB;\r\n\r\nWGLEW_EXPORT PFNWGLGETCURRENTREADDCARBPROC __wglewGetCurrentReadDCARB;\r\nWGLEW_EXPORT PFNWGLMAKECONTEXTCURRENTARBPROC __wglewMakeContextCurrentARB;\r\n\r\nWGLEW_EXPORT PFNWGLCREATEPBUFFERARBPROC __wglewCreatePbufferARB;\r\nWGLEW_EXPORT PFNWGLDESTROYPBUFFERARBPROC __wglewDestroyPbufferARB;\r\nWGLEW_EXPORT PFNWGLGETPBUFFERDCARBPROC __wglewGetPbufferDCARB;\r\nWGLEW_EXPORT PFNWGLQUERYPBUFFERARBPROC __wglewQueryPbufferARB;\r\nWGLEW_EXPORT PFNWGLRELEASEPBUFFERDCARBPROC __wglewReleasePbufferDCARB;\r\n\r\nWGLEW_EXPORT PFNWGLCHOOSEPIXELFORMATARBPROC __wglewChoosePixelFormatARB;\r\nWGLEW_EXPORT PFNWGLGETPIXELFORMATATTRIBFVARBPROC __wglewGetPixelFormatAttribfvARB;\r\nWGLEW_EXPORT PFNWGLGETPIXELFORMATATTRIBIVARBPROC __wglewGetPixelFormatAttribivARB;\r\n\r\nWGLEW_EXPORT PFNWGLBINDTEXIMAGEARBPROC __wglewBindTexImageARB;\r\nWGLEW_EXPORT PFNWGLRELEASETEXIMAGEARBPROC __wglewReleaseTexImageARB;\r\nWGLEW_EXPORT PFNWGLSETPBUFFERATTRIBARBPROC __wglewSetPbufferAttribARB;\r\n\r\nWGLEW_EXPORT PFNWGLBINDDISPLAYCOLORTABLEEXTPROC __wglewBindDisplayColorTableEXT;\r\nWGLEW_EXPORT PFNWGLCREATEDISPLAYCOLORTABLEEXTPROC __wglewCreateDisplayColorTableEXT;\r\nWGLEW_EXPORT PFNWGLDESTROYDISPLAYCOLORTABLEEXTPROC __wglewDestroyDisplayColorTableEXT;\r\nWGLEW_EXPORT PFNWGLLOADDISPLAYCOLORTABLEEXTPROC __wglewLoadDisplayColorTableEXT;\r\n\r\nWGLEW_EXPORT PFNWGLGETEXTENSIONSSTRINGEXTPROC __wglewGetExtensionsStringEXT;\r\n\r\nWGLEW_EXPORT PFNWGLGETCURRENTREADDCEXTPROC __wglewGetCurrentReadDCEXT;\r\nWGLEW_EXPORT PFNWGLMAKECONTEXTCURRENTEXTPROC __wglewMakeContextCurrentEXT;\r\n\r\nWGLEW_EXPORT PFNWGLCREATEPBUFFEREXTPROC __wglewCreatePbufferEXT;\r\nWGLEW_EXPORT PFNWGLDESTROYPBUFFEREXTPROC __wglewDestroyPbufferEXT;\r\nWGLEW_EXPORT PFNWGLGETPBUFFERDCEXTPROC __wglewGetPbufferDCEXT;\r\nWGLEW_EXPORT PFNWGLQUERYPBUFFEREXTPROC __wglewQueryPbufferEXT;\r\nWGLEW_EXPORT PFNWGLRELEASEPBUFFERDCEXTPROC __wglewReleasePbufferDCEXT;\r\n\r\nWGLEW_EXPORT PFNWGLCHOOSEPIXELFORMATEXTPROC __wglewChoosePixelFormatEXT;\r\nWGLEW_EXPORT PFNWGLGETPIXELFORMATATTRIBFVEXTPROC __wglewGetPixelFormatAttribfvEXT;\r\nWGLEW_EXPORT PFNWGLGETPIXELFORMATATTRIBIVEXTPROC __wglewGetPixelFormatAttribivEXT;\r\n\r\nWGLEW_EXPORT PFNWGLGETSWAPINTERVALEXTPROC __wglewGetSwapIntervalEXT;\r\nWGLEW_EXPORT PFNWGLSWAPINTERVALEXTPROC __wglewSwapIntervalEXT;\r\n\r\nWGLEW_EXPORT PFNWGLGETDIGITALVIDEOPARAMETERSI3DPROC __wglewGetDigitalVideoParametersI3D;\r\nWGLEW_EXPORT PFNWGLSETDIGITALVIDEOPARAMETERSI3DPROC __wglewSetDigitalVideoParametersI3D;\r\n\r\nWGLEW_EXPORT PFNWGLGETGAMMATABLEI3DPROC __wglewGetGammaTableI3D;\r\nWGLEW_EXPORT PFNWGLGETGAMMATABLEPARAMETERSI3DPROC __wglewGetGammaTableParametersI3D;\r\nWGLEW_EXPORT PFNWGLSETGAMMATABLEI3DPROC __wglewSetGammaTableI3D;\r\nWGLEW_EXPORT PFNWGLSETGAMMATABLEPARAMETERSI3DPROC __wglewSetGammaTableParametersI3D;\r\n\r\nWGLEW_EXPORT PFNWGLDISABLEGENLOCKI3DPROC __wglewDisableGenlockI3D;\r\nWGLEW_EXPORT PFNWGLENABLEGENLOCKI3DPROC __wglewEnableGenlockI3D;\r\nWGLEW_EXPORT PFNWGLGENLOCKSAMPLERATEI3DPROC __wglewGenlockSampleRateI3D;\r\nWGLEW_EXPORT PFNWGLGENLOCKSOURCEDELAYI3DPROC __wglewGenlockSourceDelayI3D;\r\nWGLEW_EXPORT PFNWGLGENLOCKSOURCEEDGEI3DPROC __wglewGenlockSourceEdgeI3D;\r\nWGLEW_EXPORT PFNWGLGENLOCKSOURCEI3DPROC __wglewGenlockSourceI3D;\r\nWGLEW_EXPORT PFNWGLGETGENLOCKSAMPLERATEI3DPROC __wglewGetGenlockSampleRateI3D;\r\nWGLEW_EXPORT PFNWGLGETGENLOCKSOURCEDELAYI3DPROC __wglewGetGenlockSourceDelayI3D;\r\nWGLEW_EXPORT PFNWGLGETGENLOCKSOURCEEDGEI3DPROC __wglewGetGenlockSourceEdgeI3D;\r\nWGLEW_EXPORT PFNWGLGETGENLOCKSOURCEI3DPROC __wglewGetGenlockSourceI3D;\r\nWGLEW_EXPORT PFNWGLISENABLEDGENLOCKI3DPROC __wglewIsEnabledGenlockI3D;\r\nWGLEW_EXPORT PFNWGLQUERYGENLOCKMAXSOURCEDELAYI3DPROC __wglewQueryGenlockMaxSourceDelayI3D;\r\n\r\nWGLEW_EXPORT PFNWGLASSOCIATEIMAGEBUFFEREVENTSI3DPROC __wglewAssociateImageBufferEventsI3D;\r\nWGLEW_EXPORT PFNWGLCREATEIMAGEBUFFERI3DPROC __wglewCreateImageBufferI3D;\r\nWGLEW_EXPORT PFNWGLDESTROYIMAGEBUFFERI3DPROC __wglewDestroyImageBufferI3D;\r\nWGLEW_EXPORT PFNWGLRELEASEIMAGEBUFFEREVENTSI3DPROC __wglewReleaseImageBufferEventsI3D;\r\n\r\nWGLEW_EXPORT PFNWGLDISABLEFRAMELOCKI3DPROC __wglewDisableFrameLockI3D;\r\nWGLEW_EXPORT PFNWGLENABLEFRAMELOCKI3DPROC __wglewEnableFrameLockI3D;\r\nWGLEW_EXPORT PFNWGLISENABLEDFRAMELOCKI3DPROC __wglewIsEnabledFrameLockI3D;\r\nWGLEW_EXPORT PFNWGLQUERYFRAMELOCKMASTERI3DPROC __wglewQueryFrameLockMasterI3D;\r\n\r\nWGLEW_EXPORT PFNWGLBEGINFRAMETRACKINGI3DPROC __wglewBeginFrameTrackingI3D;\r\nWGLEW_EXPORT PFNWGLENDFRAMETRACKINGI3DPROC __wglewEndFrameTrackingI3D;\r\nWGLEW_EXPORT PFNWGLGETFRAMEUSAGEI3DPROC __wglewGetFrameUsageI3D;\r\nWGLEW_EXPORT PFNWGLQUERYFRAMETRACKINGI3DPROC __wglewQueryFrameTrackingI3D;\r\n\r\nWGLEW_EXPORT PFNWGLDXCLOSEDEVICENVPROC __wglewDXCloseDeviceNV;\r\nWGLEW_EXPORT PFNWGLDXLOCKOBJECTSNVPROC __wglewDXLockObjectsNV;\r\nWGLEW_EXPORT PFNWGLDXOBJECTACCESSNVPROC __wglewDXObjectAccessNV;\r\nWGLEW_EXPORT PFNWGLDXOPENDEVICENVPROC __wglewDXOpenDeviceNV;\r\nWGLEW_EXPORT PFNWGLDXREGISTEROBJECTNVPROC __wglewDXRegisterObjectNV;\r\nWGLEW_EXPORT PFNWGLDXSETRESOURCESHAREHANDLENVPROC __wglewDXSetResourceShareHandleNV;\r\nWGLEW_EXPORT PFNWGLDXUNLOCKOBJECTSNVPROC __wglewDXUnlockObjectsNV;\r\nWGLEW_EXPORT PFNWGLDXUNREGISTEROBJECTNVPROC __wglewDXUnregisterObjectNV;\r\n\r\nWGLEW_EXPORT PFNWGLCOPYIMAGESUBDATANVPROC __wglewCopyImageSubDataNV;\r\n\r\nWGLEW_EXPORT PFNWGLCREATEAFFINITYDCNVPROC __wglewCreateAffinityDCNV;\r\nWGLEW_EXPORT PFNWGLDELETEDCNVPROC __wglewDeleteDCNV;\r\nWGLEW_EXPORT PFNWGLENUMGPUDEVICESNVPROC __wglewEnumGpuDevicesNV;\r\nWGLEW_EXPORT PFNWGLENUMGPUSFROMAFFINITYDCNVPROC __wglewEnumGpusFromAffinityDCNV;\r\nWGLEW_EXPORT PFNWGLENUMGPUSNVPROC __wglewEnumGpusNV;\r\n\r\nWGLEW_EXPORT PFNWGLBINDVIDEODEVICENVPROC __wglewBindVideoDeviceNV;\r\nWGLEW_EXPORT PFNWGLENUMERATEVIDEODEVICESNVPROC __wglewEnumerateVideoDevicesNV;\r\nWGLEW_EXPORT PFNWGLQUERYCURRENTCONTEXTNVPROC __wglewQueryCurrentContextNV;\r\n\r\nWGLEW_EXPORT PFNWGLBINDSWAPBARRIERNVPROC __wglewBindSwapBarrierNV;\r\nWGLEW_EXPORT PFNWGLJOINSWAPGROUPNVPROC __wglewJoinSwapGroupNV;\r\nWGLEW_EXPORT PFNWGLQUERYFRAMECOUNTNVPROC __wglewQueryFrameCountNV;\r\nWGLEW_EXPORT PFNWGLQUERYMAXSWAPGROUPSNVPROC __wglewQueryMaxSwapGroupsNV;\r\nWGLEW_EXPORT PFNWGLQUERYSWAPGROUPNVPROC __wglewQuerySwapGroupNV;\r\nWGLEW_EXPORT PFNWGLRESETFRAMECOUNTNVPROC __wglewResetFrameCountNV;\r\n\r\nWGLEW_EXPORT PFNWGLALLOCATEMEMORYNVPROC __wglewAllocateMemoryNV;\r\nWGLEW_EXPORT PFNWGLFREEMEMORYNVPROC __wglewFreeMemoryNV;\r\n\r\nWGLEW_EXPORT PFNWGLBINDVIDEOCAPTUREDEVICENVPROC __wglewBindVideoCaptureDeviceNV;\r\nWGLEW_EXPORT PFNWGLENUMERATEVIDEOCAPTUREDEVICESNVPROC __wglewEnumerateVideoCaptureDevicesNV;\r\nWGLEW_EXPORT PFNWGLLOCKVIDEOCAPTUREDEVICENVPROC __wglewLockVideoCaptureDeviceNV;\r\nWGLEW_EXPORT PFNWGLQUERYVIDEOCAPTUREDEVICENVPROC __wglewQueryVideoCaptureDeviceNV;\r\nWGLEW_EXPORT PFNWGLRELEASEVIDEOCAPTUREDEVICENVPROC __wglewReleaseVideoCaptureDeviceNV;\r\n\r\nWGLEW_EXPORT PFNWGLBINDVIDEOIMAGENVPROC __wglewBindVideoImageNV;\r\nWGLEW_EXPORT PFNWGLGETVIDEODEVICENVPROC __wglewGetVideoDeviceNV;\r\nWGLEW_EXPORT PFNWGLGETVIDEOINFONVPROC __wglewGetVideoInfoNV;\r\nWGLEW_EXPORT PFNWGLRELEASEVIDEODEVICENVPROC __wglewReleaseVideoDeviceNV;\r\nWGLEW_EXPORT PFNWGLRELEASEVIDEOIMAGENVPROC __wglewReleaseVideoImageNV;\r\nWGLEW_EXPORT PFNWGLSENDPBUFFERTOVIDEONVPROC __wglewSendPbufferToVideoNV;\r\n\r\nWGLEW_EXPORT PFNWGLGETMSCRATEOMLPROC __wglewGetMscRateOML;\r\nWGLEW_EXPORT PFNWGLGETSYNCVALUESOMLPROC __wglewGetSyncValuesOML;\r\nWGLEW_EXPORT PFNWGLSWAPBUFFERSMSCOMLPROC __wglewSwapBuffersMscOML;\r\nWGLEW_EXPORT PFNWGLSWAPLAYERBUFFERSMSCOMLPROC __wglewSwapLayerBuffersMscOML;\r\nWGLEW_EXPORT PFNWGLWAITFORMSCOMLPROC __wglewWaitForMscOML;\r\nWGLEW_EXPORT PFNWGLWAITFORSBCOMLPROC __wglewWaitForSbcOML;\r\nWGLEW_EXPORT GLboolean __WGLEW_3DFX_multisample;\r\nWGLEW_EXPORT GLboolean __WGLEW_3DL_stereo_control;\r\nWGLEW_EXPORT GLboolean __WGLEW_AMD_gpu_association;\r\nWGLEW_EXPORT GLboolean __WGLEW_ARB_buffer_region;\r\nWGLEW_EXPORT GLboolean __WGLEW_ARB_create_context;\r\nWGLEW_EXPORT GLboolean __WGLEW_ARB_create_context_profile;\r\nWGLEW_EXPORT GLboolean __WGLEW_ARB_create_context_robustness;\r\nWGLEW_EXPORT GLboolean __WGLEW_ARB_extensions_string;\r\nWGLEW_EXPORT GLboolean __WGLEW_ARB_framebuffer_sRGB;\r\nWGLEW_EXPORT GLboolean __WGLEW_ARB_make_current_read;\r\nWGLEW_EXPORT GLboolean __WGLEW_ARB_multisample;\r\nWGLEW_EXPORT GLboolean __WGLEW_ARB_pbuffer;\r\nWGLEW_EXPORT GLboolean __WGLEW_ARB_pixel_format;\r\nWGLEW_EXPORT GLboolean __WGLEW_ARB_pixel_format_float;\r\nWGLEW_EXPORT GLboolean __WGLEW_ARB_render_texture;\r\nWGLEW_EXPORT GLboolean __WGLEW_ATI_pixel_format_float;\r\nWGLEW_EXPORT GLboolean __WGLEW_ATI_render_texture_rectangle;\r\nWGLEW_EXPORT GLboolean __WGLEW_EXT_create_context_es2_profile;\r\nWGLEW_EXPORT GLboolean __WGLEW_EXT_depth_float;\r\nWGLEW_EXPORT GLboolean __WGLEW_EXT_display_color_table;\r\nWGLEW_EXPORT GLboolean __WGLEW_EXT_extensions_string;\r\nWGLEW_EXPORT GLboolean __WGLEW_EXT_framebuffer_sRGB;\r\nWGLEW_EXPORT GLboolean __WGLEW_EXT_make_current_read;\r\nWGLEW_EXPORT GLboolean __WGLEW_EXT_multisample;\r\nWGLEW_EXPORT GLboolean __WGLEW_EXT_pbuffer;\r\nWGLEW_EXPORT GLboolean __WGLEW_EXT_pixel_format;\r\nWGLEW_EXPORT GLboolean __WGLEW_EXT_pixel_format_packed_float;\r\nWGLEW_EXPORT GLboolean __WGLEW_EXT_swap_control;\r\nWGLEW_EXPORT GLboolean __WGLEW_I3D_digital_video_control;\r\nWGLEW_EXPORT GLboolean __WGLEW_I3D_gamma;\r\nWGLEW_EXPORT GLboolean __WGLEW_I3D_genlock;\r\nWGLEW_EXPORT GLboolean __WGLEW_I3D_image_buffer;\r\nWGLEW_EXPORT GLboolean __WGLEW_I3D_swap_frame_lock;\r\nWGLEW_EXPORT GLboolean __WGLEW_I3D_swap_frame_usage;\r\nWGLEW_EXPORT GLboolean __WGLEW_NV_DX_interop;\r\nWGLEW_EXPORT GLboolean __WGLEW_NV_copy_image;\r\nWGLEW_EXPORT GLboolean __WGLEW_NV_float_buffer;\r\nWGLEW_EXPORT GLboolean __WGLEW_NV_gpu_affinity;\r\nWGLEW_EXPORT GLboolean __WGLEW_NV_multisample_coverage;\r\nWGLEW_EXPORT GLboolean __WGLEW_NV_present_video;\r\nWGLEW_EXPORT GLboolean __WGLEW_NV_render_depth_texture;\r\nWGLEW_EXPORT GLboolean __WGLEW_NV_render_texture_rectangle;\r\nWGLEW_EXPORT GLboolean __WGLEW_NV_swap_group;\r\nWGLEW_EXPORT GLboolean __WGLEW_NV_vertex_array_range;\r\nWGLEW_EXPORT GLboolean __WGLEW_NV_video_capture;\r\nWGLEW_EXPORT GLboolean __WGLEW_NV_video_output;\r\nWGLEW_EXPORT GLboolean __WGLEW_OML_sync_control;\r\n\r\n#ifdef GLEW_MX\r\n}; /* WGLEWContextStruct */\r\n#endif /* GLEW_MX */\r\n\r\n/* ------------------------------------------------------------------------- */\r\n\r\n#ifdef GLEW_MX\r\n\r\ntypedef struct WGLEWContextStruct WGLEWContext;\r\nGLEWAPI GLenum wglewContextInit (WGLEWContext* ctx);\r\nGLEWAPI GLboolean wglewContextIsSupported (const WGLEWContext* ctx, const char* name);\r\n\r\n#define wglewInit() wglewContextInit(wglewGetContext())\r\n#define wglewIsSupported(x) wglewContextIsSupported(wglewGetContext(), x)\r\n\r\n#define WGLEW_GET_VAR(x) (*(const GLboolean*)&(wglewGetContext()->x))\r\n#define WGLEW_GET_FUN(x) wglewGetContext()->x\r\n\r\n#else /* GLEW_MX */\r\n\r\n#define WGLEW_GET_VAR(x) (*(const GLboolean*)&x)\r\n#define WGLEW_GET_FUN(x) x\r\n\r\nGLEWAPI GLboolean wglewIsSupported (const char* name);\r\n\r\n#endif /* GLEW_MX */\r\n\r\nGLEWAPI GLboolean wglewGetExtension (const char* name);\r\n\r\n#ifdef __cplusplus\r\n}\r\n#endif\r\n\r\n#undef GLEWAPI\r\n\r\n#endif /* __wglew_h__ */\r\n" }, { "path": "src/test/resources/samples/langs/C/yajl.c", "content": "/*\n * Copyright 2010, Lloyd Hilaiel.\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 * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * \n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and/or other materials provided with the\n * distribution.\n * \n * 3. Neither the name of Lloyd Hilaiel nor the names of its\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 AUTHOR ``AS IS'' AND ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,\n * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING\n * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n */ \n\n#include \"api/yajl_parse.h\"\n#include \"yajl_lex.h\"\n#include \"yajl_parser.h\"\n#include \"yajl_alloc.h\"\n\n#include \n#include \n#include \n\nconst char *\nyajl_status_to_string(yajl_status stat)\n{\n const char * statStr = \"unknown\";\n switch (stat) {\n case yajl_status_ok:\n statStr = \"ok, no error\";\n break;\n case yajl_status_client_canceled:\n statStr = \"client canceled parse\";\n break;\n case yajl_status_insufficient_data:\n statStr = \"eof was met before the parse could complete\";\n break;\n case yajl_status_error:\n statStr = \"parse error\";\n break;\n }\n return statStr;\n}\n\nyajl_handle\nyajl_alloc(const yajl_callbacks * callbacks,\n const yajl_parser_config * config,\n const yajl_alloc_funcs * afs,\n void * ctx)\n{\n unsigned int allowComments = 0;\n unsigned int validateUTF8 = 0;\n yajl_handle hand = NULL;\n yajl_alloc_funcs afsBuffer;\n \n /* first order of business is to set up memory allocation routines */\n if (afs != NULL) {\n if (afs->malloc == NULL || afs->realloc == NULL || afs->free == NULL)\n {\n return NULL;\n }\n } else {\n yajl_set_default_alloc_funcs(&afsBuffer);\n afs = &afsBuffer;\n }\n\n hand = (yajl_handle) YA_MALLOC(afs, sizeof(struct yajl_handle_t));\n\n /* copy in pointers to allocation routines */\n memcpy((void *) &(hand->alloc), (void *) afs, sizeof(yajl_alloc_funcs));\n\n if (config != NULL) {\n allowComments = config->allowComments;\n validateUTF8 = config->checkUTF8;\n }\n\n hand->callbacks = callbacks;\n hand->ctx = ctx;\n hand->lexer = yajl_lex_alloc(&(hand->alloc), allowComments, validateUTF8);\n hand->bytesConsumed = 0;\n hand->decodeBuf = yajl_buf_alloc(&(hand->alloc));\n yajl_bs_init(hand->stateStack, &(hand->alloc));\n\n yajl_bs_push(hand->stateStack, yajl_state_start); \n\n return hand;\n}\n\nvoid\nyajl_reset_parser(yajl_handle hand) {\n hand->lexer = yajl_lex_realloc(hand->lexer);\n}\n\nvoid\nyajl_free(yajl_handle handle)\n{\n yajl_bs_free(handle->stateStack);\n yajl_buf_free(handle->decodeBuf);\n yajl_lex_free(handle->lexer);\n YA_FREE(&(handle->alloc), handle);\n}\n\nyajl_status\nyajl_parse(yajl_handle hand, const unsigned char * jsonText,\n unsigned int jsonTextLen)\n{\n yajl_status status;\n status = yajl_do_parse(hand, jsonText, jsonTextLen);\n return status;\n}\n\nyajl_status\nyajl_parse_complete(yajl_handle hand)\n{\n /* The particular case we want to handle is a trailing number.\n * Further input consisting of digits could cause our interpretation\n * of the number to change (buffered \"1\" but \"2\" comes in).\n * A very simple approach to this is to inject whitespace to terminate\n * any number in the lex buffer.\n */\n return yajl_parse(hand, (const unsigned char *)\" \", 1);\n}\n\nunsigned char *\nyajl_get_error(yajl_handle hand, int verbose,\n const unsigned char * jsonText, unsigned int jsonTextLen)\n{\n return yajl_render_error_string(hand, jsonText, jsonTextLen, verbose);\n}\n\nunsigned int\nyajl_get_bytes_consumed(yajl_handle hand)\n{\n if (!hand) return 0;\n else return hand->bytesConsumed;\n}\n\n\nvoid\nyajl_free_error(yajl_handle hand, unsigned char * str)\n{\n /* use memory allocation functions if set */\n YA_FREE(&(hand->alloc), str);\n}\n\n/* XXX: add utility routines to parse from file */\n" }, { "path": "src/test/resources/samples/langs/C#/AssemblyInfo.cs", "content": "using System.Reflection;\nusing System.Runtime.CompilerServices;\n\n// Information about this assembly is defined by the following attributes. \n// Change them to the values specific to your project.\n\n[assembly: AssemblyTitle(\"Simple\")]\n[assembly: AssemblyDescription(\"\")]\n[assembly: AssemblyConfiguration(\"\")]\n[assembly: AssemblyCompany(\"\")]\n[assembly: AssemblyProduct(\"\")]\n[assembly: AssemblyCopyright(\"\")]\n[assembly: AssemblyTrademark(\"\")]\n[assembly: AssemblyCulture(\"\")]\n\n// The assembly version has the format \"{Major}.{Minor}.{Build}.{Revision}\".\n// The form \"{Major}.{Minor}.*\" will automatically update the build and revision,\n// and \"{Major}.{Minor}.{Build}.*\" will update just the revision.\n\n[assembly: AssemblyVersion(\"1.0.*\")]\n\n// The following attributes are used to specify the signing key for the assembly, \n// if desired. See the Mono documentation for more information about signing.\n\n//[assembly: AssemblyDelaySign(false)]\n//[assembly: AssemblyKeyFile(\"\")]\n" }, { "path": "src/test/resources/samples/langs/C#/BsonPropertyValue.cs", "content": "using System;\r\n\r\nnamespace MongoDB.Serialization.Descriptors\r\n{\r\n internal class BsonPropertyValue\r\n {\r\n public bool IsDictionary { get; private set; }\r\n\r\n public Type Type { get; private set; }\r\n\r\n public object Value { get; private set; }\r\n\r\n public BsonPropertyValue(Type type, object value, bool isDictionary)\r\n {\r\n Type = type;\r\n Value = value;\r\n IsDictionary = isDictionary;\r\n }\r\n }\r\n}" }, { "path": "src/test/resources/samples/langs/C#/Index.cshtml", "content": "@{\n ViewBag.Title = \"Home Page\";\n}\n@section featured {\n
\n
\n
\n

@ViewBag.Title.

\n

@ViewBag.Message

\n
\n

\n To learn more about ASP.NET MVC visit\n http://asp.net/mvc.\n The page features videos, tutorials, and samples to help you get the most from ASP.NET MVC.\n If you have any questions about ASP.NET MVC visit\n our forums.\n

\n
\n
\n}\n

We suggest the following:

\n
    \n
  1. \n
    Getting Started
    \n ASP.NET MVC gives you a powerful, patterns-based way to build dynamic websites that\n enables a clean separation of concerns and that gives you full control over markup\n for enjoyable, agile development. ASP.NET MVC includes many features that enable\n fast, TDD-friendly development for creating sophisticated applications that use\n the latest web standards.\n Learn more…\n
    2. \n\n
  2. \n
    Add NuGet packages and jump-start your coding
    \n NuGet makes it easy to install and update free libraries and tools.\n Learn more…\n
    3. \n\n
  3. \n
    Find Web Hosting
    \n You can easily find a web hosting company that offers the right mix of features\n and price for your applications.\n Learn more…\n
    4. \n
\n" }, { "path": "src/test/resources/samples/langs/C#/MongoExpressionVisitor.cs", "content": "using System.Collections.Generic;\r\nusing System.Collections.ObjectModel;\r\nusing System.Linq;\r\nusing System.Linq.Expressions;\r\n\r\nnamespace MongoDB.Linq.Expressions\r\n{\r\n internal class MongoExpressionVisitor : ExpressionVisitor\r\n {\r\n protected override Expression Visit(Expression exp)\r\n {\r\n if (exp == null)\r\n return null;\r\n switch ((MongoExpressionType)exp.NodeType)\r\n {\r\n case MongoExpressionType.Collection:\r\n return VisitCollection((CollectionExpression)exp);\r\n case MongoExpressionType.Field:\r\n return VisitField((FieldExpression)exp);\r\n case MongoExpressionType.Projection:\r\n return VisitProjection((ProjectionExpression)exp);\r\n case MongoExpressionType.Select:\r\n return VisitSelect((SelectExpression)exp);\r\n case MongoExpressionType.Aggregate:\r\n return VisitAggregate((AggregateExpression)exp);\r\n case MongoExpressionType.AggregateSubquery:\r\n return VisitAggregateSubquery((AggregateSubqueryExpression)exp);\r\n case MongoExpressionType.Scalar:\r\n return VisitScalar((ScalarExpression)exp);\r\n default:\r\n return base.Visit(exp);\r\n }\r\n }\r\n\r\n protected virtual Expression VisitAggregate(AggregateExpression aggregate)\r\n {\r\n var exp = Visit(aggregate.Argument);\r\n if (exp != aggregate.Argument)\r\n return new AggregateExpression(aggregate.Type, aggregate.AggregateType, exp, aggregate.Distinct);\r\n\r\n return aggregate;\r\n }\r\n\r\n protected virtual Expression VisitAggregateSubquery(AggregateSubqueryExpression aggregateSubquery)\r\n {\r\n Expression e = Visit(aggregateSubquery.AggregateAsSubquery);\r\n ScalarExpression subquery = (ScalarExpression)e;\r\n if (subquery != aggregateSubquery.AggregateAsSubquery)\r\n return new AggregateSubqueryExpression(aggregateSubquery.GroupByAlias, aggregateSubquery.AggregateInGroupSelect, subquery);\r\n return aggregateSubquery;\r\n }\r\n\r\n protected virtual Expression VisitCollection(CollectionExpression collection)\r\n {\r\n return collection;\r\n }\r\n\r\n protected virtual Expression VisitField(FieldExpression field)\r\n {\r\n var e = Visit(field.Expression);\r\n if (field.Expression != e)\r\n field = new FieldExpression(e, field.Alias, field.Name);\r\n\r\n return field;\r\n }\r\n\r\n protected virtual Expression VisitProjection(ProjectionExpression projection)\r\n {\r\n var source = (SelectExpression)Visit(projection.Source);\r\n var projector = Visit(projection.Projector);\r\n if (source != projection.Source || projector != projection.Projector)\r\n return new ProjectionExpression(source, projector, projection.Aggregator);\r\n return projection;\r\n }\r\n\r\n protected ReadOnlyCollection VisitOrderBy(ReadOnlyCollection orderBys)\r\n {\r\n if (orderBys != null) \r\n {\r\n List alternate = null;\r\n for (int i = 0, n = orderBys.Count; i < n; i++) \r\n {\r\n OrderExpression expr = orderBys[i];\r\n Expression e = this.Visit(expr.Expression);\r\n if (alternate == null && e != expr.Expression) \r\n alternate = orderBys.Take(i).ToList();\r\n if (alternate != null) \r\n alternate.Add(new OrderExpression(expr.OrderType, e));\r\n }\r\n if (alternate != null) \r\n return alternate.AsReadOnly();\r\n }\r\n return orderBys;\r\n }\r\n\r\n protected virtual Expression VisitScalar(ScalarExpression scalar)\r\n {\r\n SelectExpression select = (SelectExpression)Visit(scalar.Select);\r\n if (select != scalar.Select)\r\n return new ScalarExpression(scalar.Type, select);\r\n return scalar;\r\n }\r\n\r\n protected virtual Expression VisitSelect(SelectExpression select)\r\n {\r\n var from = VisitSource(select.From);\r\n var where = Visit(select.Where);\r\n var groupBy = Visit(select.GroupBy);\r\n var orderBy = VisitOrderBy(select.OrderBy);\r\n var skip = Visit(select.Skip);\r\n var take = Visit(select.Take);\r\n var fields = VisitFieldDeclarationList(select.Fields);\r\n if (from != select.From || where != select.Where || orderBy != select.OrderBy || groupBy != select.GroupBy || skip != select.Skip || take != select.Take || fields != select.Fields)\r\n return new SelectExpression(select.Alias, fields, from, where, orderBy, groupBy, select.IsDistinct, skip, take);\r\n return select;\r\n }\r\n\r\n protected virtual Expression VisitSource(Expression source)\r\n {\r\n return Visit(source);\r\n }\r\n\r\n protected virtual Expression VisitSubquery(SubqueryExpression subquery)\r\n {\r\n switch ((MongoExpressionType)subquery.NodeType)\r\n {\r\n case MongoExpressionType.Scalar:\r\n return VisitScalar((ScalarExpression)subquery);\r\n }\r\n return subquery;\r\n }\r\n\r\n protected virtual ReadOnlyCollection VisitFieldDeclarationList(ReadOnlyCollection fields)\r\n {\r\n if (fields == null)\r\n return fields;\r\n\r\n List alternate = null;\r\n for (int i = 0, n = fields.Count; i < n; i++)\r\n {\r\n var f = fields[i];\r\n var e = Visit(f.Expression);\r\n if (f.Expression != e && alternate == null)\r\n alternate = fields.Take(i).ToList();\r\n if (alternate != null)\r\n alternate.Add(new FieldDeclaration(f.Name, e));\r\n }\r\n if (alternate != null)\r\n return alternate.AsReadOnly();\r\n return fields;\r\n }\r\n }\r\n}" }, { "path": "src/test/resources/samples/langs/C#/Program.cs", "content": "using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\n\nnamespace LittleSampleApp\n{\n /// \n /// Just what it says on the tin. A little sample application for Linguist to try out.\n /// \n /// \n class Program\n {\n static void Main(string[] args)\n {\n Console.WriteLine(\"Hello, I am a little sample application to test GitHub's Linguist module.\");\n Console.WriteLine(\"I also include a Razor MVC file just to prove it handles cshtml files now.\");\n }\n }\n}\n" }, { "path": "src/test/resources/samples/langs/C#/build.cake", "content": "///////////////////////////////////////////////////////////////////////////////\n// ARGUMENTS\n///////////////////////////////////////////////////////////////////////////////\n\nvar target = Argument(\"target\", \"Default\");\nvar configuration = Argument(\"configuration\", \"Release\");\n\n///////////////////////////////////////////////////////////////////////////////\n// GLOBAL VARIABLES\n///////////////////////////////////////////////////////////////////////////////\n\nvar solutions = GetFiles(\"./**/*.sln\");\nvar solutionPaths = solutions.Select(solution => solution.GetDirectory());\n\n///////////////////////////////////////////////////////////////////////////////\n// SETUP / TEARDOWN\n///////////////////////////////////////////////////////////////////////////////\n\nSetup(() =>\n{\n // Executed BEFORE the first task.\n Information(\"Running tasks...\");\n});\n\nTeardown(() =>\n{\n // Executed AFTER the last task.\n Information(\"Finished running tasks.\");\n});\n\n///////////////////////////////////////////////////////////////////////////////\n// TASK DEFINITIONS\n///////////////////////////////////////////////////////////////////////////////\n\nTask(\"Clean\")\n .Does(() =>\n{\n // Clean solution directories.\n foreach(var path in solutionPaths)\n {\n Information(\"Cleaning {0}\", path);\n CleanDirectories(path + \"/**/bin/\" + configuration);\n CleanDirectories(path + \"/**/obj/\" + configuration);\n }\n});\n\nTask(\"Restore\")\n .Does(() =>\n{\n // Restore all NuGet packages.\n foreach(var solution in solutions)\n {\n Information(\"Restoring {0}...\", solution);\n NuGetRestore(solution);\n }\n});\n\nTask(\"Build\")\n .IsDependentOn(\"Clean\")\n .IsDependentOn(\"Restore\")\n .Does(() =>\n{\n // Build all solutions.\n foreach(var solution in solutions)\n {\n Information(\"Building {0}\", solution);\n MSBuild(solution, settings => \n settings.SetPlatformTarget(PlatformTarget.MSIL)\n .WithProperty(\"TreatWarningsAsErrors\",\"true\")\n .WithTarget(\"Build\")\n .SetConfiguration(configuration));\n }\n});\n\n///////////////////////////////////////////////////////////////////////////////\n// TARGETS\n///////////////////////////////////////////////////////////////////////////////\n\nTask(\"Default\")\n .IsDependentOn(\"Build\");\n\n///////////////////////////////////////////////////////////////////////////////\n// EXECUTION\n///////////////////////////////////////////////////////////////////////////////\n\nRunTarget(target);" }, { "path": "src/test/resources/samples/langs/C++/16F88.h", "content": "/*\n * This file is part of PIC\n * Copyright © 2012 Rachel Mant (dx-mon@users.sourceforge.net)\n *\n * PIC is free software: you can redistribute it and/or modify\n * it under the terms of the GNU Lesser 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 * PIC 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 Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public License\n * along with this program. If not, see .\n */\n\nenum PIC16F88Instruction\n{\n\tADDWF,\n\tANDWF,\n\tCLRF,\n\tCLRW,\n\tCOMF,\n\tDECF,\n\tDECFSZ,\n\tINCF,\n\tINCFSZ,\n\tIORWF,\n\tMOVF,\n\tMOVWF,\n\tNOP,\n\tRLF,\n\tRRF,\n\tSUBWF,\n\tSWAPF,\n\tXORWF,\n\tBCF,\n\tBSF,\n\tBTFSC,\n\tBTFSS,\n\tADDLW,\n\tANDLW,\n\tCALL,\n\tCLRWDT,\n\tGOTO,\n\tIORLW,\n\tMOVLW,\n\tRETFIE,\n\tRETLW,\n\tRETURN,\n\tSLEEP,\n\tSUBLW,\n\tXORLW\n};\n\nclass PIC16F88\n{\npublic:\n\tPIC16F88(ROM *ProgramMemory);\n\tvoid Step();\n\nprivate:\n\tuint8_t q;\n\tbool nextIsNop, trapped;\n\tMemory *memory;\n\tROM *program;\n\tStack *CallStack;\n\tRegister *PC;\n\tRegister<> *WREG, *PCL, *STATUS, *PCLATCH;\n\tPIC16F88Instruction inst;\n\tuint16_t instrWord;\n\nprivate:\n\tvoid DecodeInstruction();\n\tvoid ProcessInstruction();\n\n\tuint8_t GetBank();\n\tuint8_t GetMemoryContents(uint8_t partialAddress);\n\tvoid SetMemoryContents(uint8_t partialAddress, uint8_t newVal);\n\tvoid CheckZero(uint8_t value);\n\tvoid StoreValue(uint8_t value, bool updateZero);\n\tuint8_t SetCarry(bool val);\n\tuint16_t GetPCHFinalBits();\n};\n" }, { "path": "src/test/resources/samples/langs/C++/ClasspathVMSystemProperties.inc", "content": "//===- ClasspathVMSystem/Properties.cpp -----------------------------------===//\n//===--------------------- GNU classpath gnu/classpath/VMSystemProperties -===//\n//\n// The VMKit project\n//\n// This file is distributed under the University of Illinois Open Source\n// License. See LICENSE.TXT for details.\n//\n//===----------------------------------------------------------------------===//\n\n#include \n\n#include \"types.h\"\n\n#include \"Classpath.h\"\n#include \"JavaArray.h\"\n#include \"JavaClass.h\"\n#include \"JavaObject.h\"\n#include \"JavaThread.h\"\n#include \"JavaUpcalls.h\"\n#include \"Jnjvm.h\"\n\n#include \"SetProperties.inc\"\n\nusing namespace j3;\n\nextern \"C\" {\n\n\nJNIEXPORT void JNICALL Java_gnu_classpath_VMSystemProperties_preInit(\n#ifdef NATIVE_JNI\nJNIEnv *env,\njclass clazz,\n#endif\nJavaObject* prop) {\n \n llvm_gcroot(prop, 0);\n\n BEGIN_NATIVE_EXCEPTION(0)\n\n setProperties(prop);\n\n END_NATIVE_EXCEPTION\n}\n\nextern \"C\" void Java_gnu_classpath_VMSystemProperties_postInit__Ljava_util_Properties_2(JavaObject* prop) {\n\n llvm_gcroot(prop, 0);\n\n BEGIN_NATIVE_EXCEPTION(0)\n\n setCommandLineProperties(prop);\n\n END_NATIVE_EXCEPTION\n}\n\n}\n" }, { "path": "src/test/resources/samples/langs/C++/CsvStreamer.h", "content": "#pragma once\n#include \n#include \n#include \n#include \"util.h\"\n\nusing namespace std;\n\n\n#define DEFAULT_DELIMITER\t','\n\n\nclass CsvStreamer\n{\n\tprivate:\n\t\tofstream file;\t\t\t\t// File output stream\n\t\tvector row_buffer;\t// Buffer which stores a row's data before being flushed/written\n\t\tint fields;\t\t\t\t\t// Number of fields (columns)\n\t\tlong rows;\t\t\t\t\t// Number of rows (records) including header row\n\t\tchar delimiter;\t\t\t\t// Delimiter character; comma by default\n\t\tstring sanitize(string);\t// Returns a string ready for output into the file\n\t\t\n\tpublic:\n\t\tCsvStreamer();\t\t\t\t// Empty CSV streamer... be sure to open the file before writing!\n\t\tCsvStreamer(string, char);\t// Same as open(string, char)...\n\t\tCsvStreamer(string);\t\t// Opens an output CSV file given a file path/name\n\t\t~CsvStreamer();\t\t\t\t// Ensures the output file is closed and saved\n\t\tvoid open(string);\t\t\t// Opens an output CSV file given a file path/name (default delimiter)\n\t\tvoid open(string, char);\t// Opens an output CSV file given a file path/name and a delimiting character (default comma)\n\t\tvoid add_field(string);\t\t// If still on first line, adds a new field to the header row\n\t\tvoid save_fields();\t\t\t// Call this to save the header row; all new writes should be through append()\n\t\tvoid append(string);\t\t// Appends the current row with this data for the next field; quoted only if needed (leading/trailing spaces are trimmed)\n\t\tvoid append(string, bool);\t// Like append(string) but can specify whether to trim spaces at either end of the data (false to keep spaces)\n\t\tvoid append(float);\t\t\t// Appends the current row with this number\n\t\tvoid append(double);\t\t// Appends the current row with this number\n\t\tvoid append(long);\t\t\t// Appends the current row with this number\n\t\tvoid append(int);\t\t\t// Appends the current row with this number\n\t\tvoid writeln();\t\t\t\t// Flushes what was in the row buffer into the file (writes the row)\n\t\tvoid close();\t\t\t\t// Saves and closes the file\n\t\tint field_count();\t\t\t// Gets the number of fields (columns)\n\t\tlong row_count();\t\t\t// Gets the number of records (rows) -- NOT including the header row\n};\n" }, { "path": "src/test/resources/samples/langs/C++/Entity.h", "content": "/** \n* @file Entity.h\n* @page EntityPage Entity\n* @brief represent an entity in the game\n* @author vinz243\n* @version 0.1.0\n* This file represents an Entity in the game system\n* This parent type is a static entity which is shown and loaded into the Physics engine but never updated\n*/\n\n#ifndef ENTITY_H\n#define ENTITY_H\n\n#include \"base.h\"\n/// @namespace Whitedrop\nnamespace Whitedrop {\n\t/** @class Entity\n\t* This parent type is a static entity which is shown and loaded into the Physics engine but never updated\n\t*/\n\tclass Entity {\n\tpublic:\n\t\t/**\n\t\t * @brief Create static entity\n\t\t * @details creates a static entity instance according to the mesh and the id, the position\n\t\t * This needs to be attached to a World after!\n\t\t * The material name is not the file name but the material name!\n\t\t * @ref WorldPage\n\t\t * @param mesh the name of the mesh for the object, file must be in media/meshes\n\t\t * @param id an unique identifier for the object, shortest as possible\n\t\t * @param dimensions an Ogre::Vector3 which contains the dimensions in meter\n\t\t * @param position the Vector3 which contains it position \n\t\t * @param material the material name\n\t\t */\n\t\tEntity(std::string mesh, std::string id, Ogre::Vector3 dimensions, Ogre::Vector3 position, std::string material);\n\t\t/**\n\t\t * @brief The copy constructor\n\t\t * @details A copy constr\n\t\t * \n\t\t * @param ref the Entity to be copied from\n\t\t */\n\t\tEntity(const Entity &ref);\n\n\t\t/**\n\t\t * @brief The assignement operator\n\t\t * @details \n\t\t * \n\t\t * @param ent the entity to be copied\n\t\t */\n\t\tEntity& operator=(const Entity ent);\n\n\t\t/**\n\t\t * @brief destrctor\n\t\t * @details\n\t\t */\n\t\tvirtual ~Entity(void);\n\n\t\t/**\n\t\t * @brief a constance type of the entity\n\t\t * @details depends of the class. \n\t\t * May contain STATIC, DYNAMIC or ETHERAL\n\t\t */\n\t\tconst std::string type = \"STATIC\";\n\n\t\t/**\n\t\t * @brief Attach the entity to specified sceneManager\n\t\t * @details This creates the OgreEntity using sceneMgr,\n\t\t * set material, create a Node with name as `_n`,\n\t\t * scale it to match dimensions and translate the node to pos\n\t\t * @param sceneMgr the scene manager to use\n\t\t */\n\t\tvirtual void setup(Ogre::SceneManager* sceneMgr);\n\n\t\t/**\n\t\t * @brief the update method\n\t\t * @details this method should be called on each world update.\n\t\t * Even though the method is necessary declared, the main impl of \n\t\t * a static entity should be empty since it is not updated by physics\n\t\t * However, a Dynamic entity should implement this function in order to:\n\t\t * 1) Get from the physics engine the actor position in the physic world\n\t\t * 2) Update the OgreEntity position and rotation from the previous actor\n\t\t * @return whether it was successful or not, if falsey engine should stop\n\t\t */\n\t\tvirtual bool update(void);\n\n\tprotected:\n\t\tstd::string \t\t\tmMesh = \"cube.mesh\";\n\t\tstd::string \t\t\tmId;\n\t\tstd::string \t\t\tmMaterial;\n\t\tOgre::Vector3 \t\t\tmDimensions;\n\t\tOgre::Vector3 \t\t\tmPosition;\n\t\tOgre::Entity* \t\t\tmEntity;\n\t\tOgre::SceneNode* \t\tmNode;\n\n\t};\n}\n\n\n#endif" }, { "path": "src/test/resources/samples/langs/C++/Field.h", "content": "/*****************************************************************************\n* Dwarf Mine - The 13-11 Benchmark\n*\n* Copyright (c) 2013 Bünger, Thomas; Kieschnick, Christian; Kusber,\n* Michael; Lohse, Henning; Wuttke, Nikolai; Xylander, Oliver; Yao, Gary;\n* Zimmermann, Florian\n*\n* Permission is hereby granted, free of charge, to any person obtaining\n* a copy of this software and associated documentation files (the\n* \"Software\"), to deal in the Software without restriction, including\n* without limitation the rights to use, copy, modify, merge, publish,\n* distribute, sublicense, and/or sell copies of the Software, and to\n* permit persons to whom the Software is furnished to do so, subject to\n* the following conditions:\n*\n* The above copyright notice and this permission notice shall be\n* included in all copies or substantial portions of the Software.\n*\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n*****************************************************************************/\n\n#pragma once\n\nenum Field { Free, Black, White, Illegal };\n\ntypedef Field Player;\n" }, { "path": "src/test/resources/samples/langs/C++/Math.inl", "content": "/*\r\n===========================================================================\r\nThe Open Game Libraries.\r\nCopyright (C) 2007-2010 Lusito Software\r\n\r\nAuthor: Santo Pfingsten (TTK-Bandit)\r\nPurpose: Math namespace\r\n-----------------------------------------\r\n\r\nThis software is provided 'as-is', without any express or implied\r\nwarranty. In no event will the authors be held liable for any damages\r\narising from the use of this software.\r\n\r\nPermission is granted to anyone to use this software for any purpose,\r\nincluding commercial applications, and to alter it and redistribute it\r\nfreely, subject to the following restrictions:\r\n\r\n1. The origin of this software must not be misrepresented; you must not\r\n claim that you wrote the original software. If you use this software\r\n in a product, an acknowledgment in the product documentation would be\r\n appreciated but is not required.\r\n\r\n2. Altered source versions must be plainly marked as such, and must not be\r\n misrepresented as being the original software.\r\n\r\n3. This notice may not be removed or altered from any source distribution.\r\n===========================================================================\r\n*/\r\n\r\n#ifndef __OG_MATH_INL__\r\n#define __OG_MATH_INL__\r\n\r\nnamespace og {\r\n\r\n/*\r\n==============================================================================\r\n\r\n Math\r\n\r\n==============================================================================\r\n*/\r\n\r\n/*\r\n================\r\nMath::Abs\r\n================\r\n*/\r\nOG_INLINE int Math::Abs( int i ) {\r\n#if 1\r\n\tif ( i & 0x80000000 )\r\n\t\treturn 0x80000000 - (i & MASK_SIGNED);\r\n\treturn i;\r\n#else\r\n int y = x >> 31;\r\n return ( ( x ^ y ) - y );\r\n#endif\r\n}\r\n\r\n/*\r\n================\r\nMath::Fabs\r\n================\r\n*/\r\nOG_INLINE float Math::Fabs( float f ) {\r\n#if 1\r\n\tuInt *pf = reinterpret_cast(&f);\r\n\t*(pf) &= MASK_SIGNED;\r\n\treturn f;\r\n#else\r\n\treturn fabsf( f );\r\n#endif\r\n}\r\n\r\n/*\r\n================\r\nMath::Round\r\n================\r\n*/\r\nOG_INLINE float Math::Round( float f ) {\r\n\treturn floorf( f + 0.5f );\r\n}\r\n\r\n/*\r\n================\r\nMath::Floor\r\n================\r\n*/\r\nOG_INLINE float Math::Floor( float f ) {\r\n\treturn floorf( f );\r\n}\r\n\r\n/*\r\n================\r\nMath::Ceil\r\n================\r\n*/\r\nOG_INLINE float Math::Ceil( float f ) {\r\n\treturn ceilf( f );\r\n}\r\n\r\n/*\r\n================\r\nMath::Ftoi\r\n\r\nok since this is SSE, why should the other ftoi be the faster one ?\r\nand: we might need to add a check for SSE extensions..\r\nbecause sse isn't *really* faster (I actually read that GCC does not handle\r\nSSE extensions perfectly. I'll find the link and send it to you when you're online)\r\n================\r\n*/\r\nOG_INLINE int Math::Ftoi( float f ) {\r\n\t//! @todo\tneeds testing\r\n\t// note: sse function cvttss2si\r\n#if OG_ASM_MSVC\r\n\tint i;\r\n#if defined(OG_FTOI_USE_SSE)\r\n\tif( SysInfo::cpu.general.SSE ) {\r\n\t\t__asm cvttss2si\teax, f\r\n\t\t__asm mov\t\ti, eax\r\n\t\treturn i;\r\n\t} else\r\n#endif\r\n\t{\r\n\t\t__asm fld\t\tf\r\n\t\t__asm fistp\t\ti\r\n\t\t//__asm mov eax, i // do we need this ? O_o\r\n\t}\r\n\treturn i;\r\n#elif OG_ASM_GNU\r\n\tint i;\r\n#if defined(OG_FTOI_USE_SSE)\r\n\tif( SysInfo::cpu.general.SSE ) {\r\n\t\t__asm__ __volatile__( \"cvttss2si %1 \\n\\t\"\r\n\t\t\t: \"=m\" (i)\r\n\t\t\t: \"m\" (f)\r\n\t\t);\r\n\t} else\r\n#endif\r\n\t{\r\n\t\t__asm__ __volatile__( \"flds %1 \\n\\t\"\r\n\t\t\t\t\t\t\t \"fistpl %0 \\n\\t\"\r\n\t\t\t: \"=m\" (i)\r\n\t\t\t: \"m\" (f)\r\n\t\t);\r\n\t}\r\n\treturn i;\r\n#else\r\n\t// we use c++ cast instead of c cast (not sure why id did that)\r\n\treturn static_cast(f);\r\n#endif\r\n}\r\n\r\n/*\r\n================\r\nMath::FtoiFast\r\n================\r\n*/\r\nOG_INLINE int Math::FtoiFast( float f ) {\r\n#if OG_ASM_MSVC\r\n\tint i;\r\n\t__asm fld\t\tf\r\n\t__asm fistp\t\ti\r\n\t//__asm mov eax, i // do we need this ? O_o\r\n\treturn i;\r\n#elif OG_ASM_GNU\r\n\tint i;\r\n\t__asm__ __volatile__( \"flds %1 \\n\\t\"\r\n\t\t\t\t\t\t \"fistpl %0 \\n\\t\"\r\n\t\t: \"=m\" (i)\r\n\t\t: \"m\" (f)\r\n\t);\r\n\treturn i;\r\n#else\r\n\t// we use c++ cast instead of c cast (not sure why id did that)\r\n\treturn static_cast(f);\r\n#endif\r\n}\r\n\r\n/*\r\n================\r\nMath::Ftol\r\n================\r\n*/\r\nOG_INLINE long Math::Ftol( float f ) {\r\n#if OG_ASM_MSVC\r\n\tlong i;\r\n\t__asm fld\t\tf\r\n\t__asm fistp\t\ti\r\n\t//__asm mov eax, i // do we need this ? O_o\r\n\treturn i;\r\n#elif OG_ASM_GNU\r\n\tlong i;\r\n\t__asm__ __volatile__( \"flds %1 \\n\\t\"\r\n\t\t\t\t\t\t \"fistpl %0 \\n\\t\"\r\n\t\t: \"=m\" (i)\r\n\t\t: \"m\" (f)\r\n\t);\r\n\treturn i;\r\n#else\r\n\t// we use c++ cast instead of c cast (not sure why id did that)\r\n\treturn static_cast(f);\r\n#endif\r\n}\r\n\r\n/*\r\n================\r\nMath::Sign\r\n================\r\n*/\r\nOG_INLINE float Math::Sign( float f )\t{\r\n\tif ( f > 0.0f )\r\n\t\treturn 1.0f;\r\n\tif ( f < 0.0f )\r\n\t\treturn -1.0f;\r\n\treturn 0.0f;\r\n}\r\n\r\n/*\r\n================\r\nMath::Fmod\r\n================\r\n*/\r\nOG_INLINE float Math::Fmod( float numerator, float denominator ) {\r\n\treturn fmodf( numerator, denominator );\r\n}\r\n\r\n/*\r\n================\r\nMath::Modf\r\n================\r\n*/\r\nOG_INLINE float Math::Modf( float f, float& i ) {\r\n\treturn modff( f, &i );\r\n}\r\nOG_INLINE float Math::Modf( float f ) {\r\n\tfloat i;\r\n\treturn modff( f, &i );\r\n}\r\n\r\n/*\r\n================\r\nMath::Sqrt\r\n================\r\n*/\r\nOG_INLINE float Math::Sqrt( float f ) {\r\n\treturn sqrtf( f );\r\n}\r\n\r\n/*\r\n================\r\nMath::InvSqrt\r\n\r\nCannot be 0.0f\r\n================\r\n*/\r\nOG_INLINE float Math::InvSqrt( float f ) {\r\n\tOG_ASSERT( f != 0.0f );\r\n\treturn 1.0f / sqrtf( f );\r\n}\r\n\r\n/*\r\n================\r\nMath::RSqrt\r\n\r\nCan be 0.0f\r\n================\r\n*/\r\nOG_INLINE float Math::RSqrt( float f ) {\r\n\tfloat g = 0.5f * f;\r\n\tint i = *reinterpret_cast(&f);\r\n\r\n\t// do a guess\r\n\ti = 0x5f375a86 - ( i>>1 );\r\n\tf = *reinterpret_cast(&i);\r\n\r\n\t// Newtons calculation\r\n\tf = f * ( 1.5f - g * f * f );\r\n\treturn f;\r\n}\r\n\r\n/*\r\n================\r\nMath::Log/Log2/Log10\r\n\r\nLog of 0 is bad.\r\nI've also heard you're not really\r\nsupposed to do log of negatives, yet\r\nthey work fine.\r\n================\r\n*/\r\nOG_INLINE float Math::Log( float f ) {\r\n\tOG_ASSERT( f != 0.0f );\r\n\treturn logf( f );\r\n}\r\nOG_INLINE float Math::Log2( float f ) {\r\n\tOG_ASSERT( f != 0.0f );\r\n\treturn INV_LN_2 * logf( f );\r\n}\r\nOG_INLINE float Math::Log10( float f ) {\r\n\tOG_ASSERT( f != 0.0f );\r\n\treturn INV_LN_10 * logf( f );\r\n}\r\n\r\n/*\r\n================\r\nMath::Pow\r\n================\r\n*/\r\nOG_INLINE float Math::Pow( float base, float exp ) {\r\n\treturn powf( base, exp );\r\n}\r\n\r\n/*\r\n================\r\nMath::Exp\r\n================\r\n*/\r\nOG_INLINE float Math::Exp( float f ) {\r\n\treturn expf( f );\r\n}\r\n\r\n/*\r\n================\r\nMath::IsPowerOfTwo\r\n================\r\n*/\r\nOG_INLINE bool Math::IsPowerOfTwo( int x ) {\r\n\t// This is the faster of the two known methods\r\n\t// with the x > 0 check moved to the beginning\r\n\treturn x > 0 && ( x & ( x - 1 ) ) == 0;\r\n}\r\n\r\n/*\r\n================\r\nMath::HigherPowerOfTwo\r\n================\r\n*/\r\nOG_INLINE int Math::HigherPowerOfTwo( int x ) {\r\n\tx--;\r\n\tx |= x >> 1;\r\n\tx |= x >> 2;\r\n\tx |= x >> 4;\r\n\tx |= x >> 8;\r\n\tx |= x >> 16;\r\n\treturn x + 1;\r\n}\r\n\r\n/*\r\n================\r\nMath::LowerPowerOfTwo\r\n================\r\n*/\r\nOG_INLINE int Math::LowerPowerOfTwo( int x ) {\r\n\treturn HigherPowerOfTwo( x ) >> 1;\r\n}\r\n\r\n/*\r\n================\r\nMath::FloorPowerOfTwo\r\n================\r\n*/\r\nOG_INLINE int Math::FloorPowerOfTwo( int x ) {\r\n\treturn IsPowerOfTwo( x ) ? x : LowerPowerOfTwo( x );\r\n}\r\n\r\n/*\r\n================\r\nMath::CeilPowerOfTwo\r\n================\r\n*/\r\nOG_INLINE int Math::CeilPowerOfTwo( int x ) {\r\n\treturn IsPowerOfTwo( x ) ? x : HigherPowerOfTwo( x );\r\n}\r\n\r\n/*\r\n================\r\nMath::ClosestPowerOfTwo\r\n================\r\n*/\r\nOG_INLINE int Math::ClosestPowerOfTwo( int x ) {\r\n\tif ( IsPowerOfTwo( x ) )\r\n\t\treturn x;\r\n\tint high = HigherPowerOfTwo( x );\r\n\tint low = high >> 1;\r\n\treturn ((high-x) < (x-low)) ? high : low;\r\n}\r\n\r\n/*\r\n================\r\nMath::Digits\r\n================\r\n*/\r\nOG_INLINE int Math::Digits( int x ) {\r\n\tint digits = 1;\r\n\tint step = 10;\r\n\twhile (step <= x) {\r\n\t\tdigits++;\r\n\t\tstep *= 10;\r\n\t}\r\n\treturn digits;\r\n}\r\n\r\n/*\r\n================\r\nMath::Sin/ASin\r\n================\r\n*/\r\nOG_INLINE float Math::Sin( float f ) {\r\n\treturn sinf( f );\r\n}\r\nOG_INLINE float Math::ASin( float f ) {\r\n\tif ( f <= -1.0f )\r\n\t\treturn -HALF_PI;\r\n\tif ( f >= 1.0f )\r\n\t\treturn HALF_PI;\r\n\treturn asinf( f );\r\n}\r\n\r\n/*\r\n================\r\nMath::Cos/ACos\r\n================\r\n*/\r\nOG_INLINE float Math::Cos( float f ) {\r\n\treturn cosf( f );\r\n}\r\nOG_INLINE float Math::ACos( float f ) {\r\n\tif ( f <= -1.0f )\r\n\t\treturn PI;\r\n\tif ( f >= 1.0f )\r\n\t\treturn 0.0f;\r\n\treturn acosf( f );\r\n}\r\n\r\n/*\r\n================\r\nMath::Tan/ATan\r\n================\r\n*/\r\nOG_INLINE float Math::Tan( float f ) {\r\n\treturn tanf( f );\r\n}\r\nOG_INLINE float Math::ATan( float f ) {\r\n\treturn atanf( f );\r\n}\r\nOG_INLINE float Math::ATan( float f1, float f2 ) {\r\n\treturn atan2f( f1, f2 );\r\n}\r\n\r\n/*\r\n================\r\nMath::SinCos\r\n================\r\n*/\r\nOG_INLINE void Math::SinCos( float f, float &s, float &c ) {\r\n#if OG_ASM_MSVC\r\n\t// sometimes assembler is just waaayy faster\r\n\t_asm {\r\n\t\tfld\t\tf\r\n\t\tfsincos\r\n\t\tmov\t\tecx, c\r\n\t\tmov\t\tedx, s\r\n\t\tfstp\tdword ptr [ecx]\r\n\t\tfstp\tdword ptr [edx]\r\n\t}\r\n#elif OG_ASM_GNU\r\n\tasm (\"fsincos\" : \"=t\" (c), \"=u\" (s) : \"0\" (f));\r\n#else\r\n\ts = Sin(f);\r\n\tc = Sqrt( 1.0f - s * s ); // faster than calling Cos(f)\r\n#endif\r\n}\r\n\r\n/*\r\n================\r\nMath::Deg2Rad\r\n================\r\n*/\r\nOG_INLINE float Math::Deg2Rad( float f ) {\r\n\treturn f * DEG_TO_RAD;\r\n}\r\n\r\n/*\r\n================\r\nMath::Rad2Deg\r\n================\r\n*/\r\nOG_INLINE float Math::Rad2Deg( float f ) {\r\n\treturn f * RAD_TO_DEG;\r\n}\r\n\r\n/*\r\n================\r\nMath::Square\r\n================\r\n*/\r\nOG_INLINE float Math::Square( float v ) {\r\n\treturn v * v;\r\n}\r\n\r\n/*\r\n================\r\nMath::Cube\r\n================\r\n*/\r\nOG_INLINE float Math::Cube( float v ) {\r\n\treturn v * v * v;\r\n}\r\n\r\n/*\r\n================\r\nMath::Sec2Ms\r\n================\r\n*/\r\nOG_INLINE int Math::Sec2Ms( int sec ) {\r\n\treturn sec * 1000;\r\n}\r\n\r\n/*\r\n================\r\nMath::Ms2Sec\r\n================\r\n*/\r\nOG_INLINE int Math::Ms2Sec( int ms ) {\r\n\treturn FtoiFast( ms * 0.001f );\r\n}\r\n\r\n}\r\n\r\n#endif\r\n" }, { "path": "src/test/resources/samples/langs/C++/Memory16F88.h", "content": "/*\n * This file is part of PIC\n * Copyright © 2012 Rachel Mant (dx-mon@users.sourceforge.net)\n *\n * PIC is free software: you can redistribute it and/or modify\n * it under the terms of the GNU Lesser 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 * PIC 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 Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public License\n * along with this program. If not, see .\n */\n\n#include \"Memory.h\"\n\nclass Memory16F88 : public Memory\n{\nprivate:\n\tuint8_t memory[512];\n\tstd::map memoryMap;\n\npublic:\n\tMemory16F88();\n\tuint8_t Dereference(uint8_t bank, uint8_t partialAddress);\n\tuint8_t *Reference(uint8_t bank, uint8_t partialAddress);\n\tuint8_t *operator [](uint32_t ref);\n};\n" }, { "path": "src/test/resources/samples/langs/C++/PackageInfoParser.cpp", "content": "/*\n * Copyright 2011, Oliver Tappe \n * Copyright 2016, Andrew Lindesay \n * Distributed under the terms of the MIT License.\n *\n * Source - https://github.com/haiku/haiku/blob/73e180c9b965aaeb034055453e153bc3adf47917/src/kits/package/PackageInfoParser.cpp\n */\n\n\n#include \"PackageInfoParser.h\"\n\n#include \n#include \n#include \n\n#include \n#include \n\n#include \n\nnamespace BPackageKit {\n\n\nBPackageInfo::ParseErrorListener::~ParseErrorListener()\n{\n}\n\n\nBPackageInfo::Parser::Parser(ParseErrorListener* listener)\n\t:\n\tfListener(listener),\n\tfPos(NULL)\n{\n}\n\n\nstatus_t\nBPackageInfo::Parser::Parse(const BString& packageInfoString,\n\tBPackageInfo* packageInfo)\n{\n\tif (packageInfo == NULL)\n\t\treturn B_BAD_VALUE;\n\n\tfPos = packageInfoString.String();\n\n\ttry {\n\t\t_Parse(packageInfo);\n\t} catch (const ParseError& error) {\n\t\tif (fListener != NULL) {\n\t\t\t// map error position to line and column\n\t\t\tint line = 1;\n\t\t\tint inLineOffset;\n\t\t\tint32 offset = error.pos - packageInfoString.String();\n\t\t\tint32 newlinePos = packageInfoString.FindLast('\\n', offset - 1);\n\t\t\tif (newlinePos < 0)\n\t\t\t\tinLineOffset = offset;\n\t\t\telse {\n\t\t\t\tinLineOffset = offset - newlinePos - 1;\n\t\t\t\tdo {\n\t\t\t\t\tline++;\n\t\t\t\t\tnewlinePos = packageInfoString.FindLast('\\n',\n\t\t\t\t\t\tnewlinePos - 1);\n\t\t\t\t} while (newlinePos >= 0);\n\t\t\t}\n\n\t\t\tint column = 0;\n\t\t\tfor (int i = 0; i < inLineOffset; i++) {\n\t\t\t\tcolumn++;\n\t\t\t\tif (error.pos[i - inLineOffset] == '\\t')\n\t\t\t\t\tcolumn = (column + 3) / 4 * 4;\n\t\t\t}\n\n\t\t\tfListener->OnError(error.message, line, column + 1);\n\t\t}\n\t\treturn B_BAD_DATA;\n\t} catch (const std::bad_alloc& e) {\n\t\tif (fListener != NULL)\n\t\t\tfListener->OnError(\"out of memory\", 0, 0);\n\t\treturn B_NO_MEMORY;\n\t}\n\n\treturn B_OK;\n}\n\n\nstatus_t\nBPackageInfo::Parser::ParseVersion(const BString& versionString,\n\tbool revisionIsOptional, BPackageVersion& _version)\n{\n\tfPos = versionString.String();\n\n\ttry {\n\t\tToken token(TOKEN_STRING, fPos, versionString.Length());\n\t\t_ParseVersionValue(token, &_version, revisionIsOptional);\n\t} catch (const ParseError& error) {\n\t\tif (fListener != NULL) {\n\t\t\tint32 offset = error.pos - versionString.String();\n\t\t\tfListener->OnError(error.message, 1, offset);\n\t\t}\n\t\treturn B_BAD_DATA;\n\t} catch (const std::bad_alloc& e) {\n\t\tif (fListener != NULL)\n\t\t\tfListener->OnError(\"out of memory\", 0, 0);\n\t\treturn B_NO_MEMORY;\n\t}\n\n\treturn B_OK;\n}\n\n\nstatus_t\nBPackageInfo::Parser::ParseResolvableExpression(const BString& expressionString,\n\tBPackageResolvableExpression& _expression)\n{\n\tfPos = expressionString.String();\n\n\ttry {\n\t\tToken token(TOKEN_STRING, fPos, expressionString.Length());\n\t\t_ParseResolvableExpression(_NextToken(), _expression, NULL);\n\t} catch (const ParseError& error) {\n\t\tif (fListener != NULL) {\n\t\t\tint32 offset = error.pos - expressionString.String();\n\t\t\tfListener->OnError(error.message, 1, offset);\n\t\t}\n\t\treturn B_BAD_DATA;\n\t} catch (const std::bad_alloc& e) {\n\t\tif (fListener != NULL)\n\t\t\tfListener->OnError(\"out of memory\", 0, 0);\n\t\treturn B_NO_MEMORY;\n\t}\n\n\treturn B_OK;\n}\n\n\nBPackageInfo::Parser::Token\nBPackageInfo::Parser::_NextToken()\n{\n\t// Eat any whitespace, comments, or escaped new lines. Also eat ';' -- they\n\t// have the same function as newlines. We remember the last encountered ';'\n\t// or '\\n' and return it as a token afterwards.\n\tconst char* itemSeparatorPos = NULL;\n\tbool inComment = false;\n\twhile ((inComment && *fPos != '\\0') || isspace(*fPos) || *fPos == ';'\n\t\t|| *fPos == '#' || *fPos == '\\\\') {\n\t\tif (*fPos == '#') {\n\t\t\tinComment = true;\n\t\t} else if (!inComment && *fPos == '\\\\') {\n\t\t\tif (fPos[1] != '\\n')\n\t\t\t\tbreak;\n\t\t\t// ignore escaped line breaks\n\t\t\tfPos++;\n\t\t} else if (*fPos == '\\n') {\n\t\t\titemSeparatorPos = fPos;\n\t\t\tinComment = false;\n\t\t} else if (!inComment && *fPos == ';')\n\t\t\titemSeparatorPos = fPos;\n\t\tfPos++;\n\t}\n\n\tif (itemSeparatorPos != NULL) {\n\t\treturn Token(TOKEN_ITEM_SEPARATOR, itemSeparatorPos);\n\t}\n\n\tconst char* tokenPos = fPos;\n\tswitch (*fPos) {\n\t\tcase '\\0':\n\t\t\treturn Token(TOKEN_EOF, fPos);\n\n\t\tcase '{':\n\t\t\tfPos++;\n\t\t\treturn Token(TOKEN_OPEN_BRACE, tokenPos);\n\n\t\tcase '}':\n\t\t\tfPos++;\n\t\t\treturn Token(TOKEN_CLOSE_BRACE, tokenPos);\n\n\t\tcase '<':\n\t\t\tfPos++;\n\t\t\tif (*fPos == '=') {\n\t\t\t\tfPos++;\n\t\t\t\treturn Token(TOKEN_OPERATOR_LESS_EQUAL, tokenPos, 2);\n\t\t\t}\n\t\t\treturn Token(TOKEN_OPERATOR_LESS, tokenPos, 1);\n\n\t\tcase '=':\n\t\t\tfPos++;\n\t\t\tif (*fPos == '=') {\n\t\t\t\tfPos++;\n\t\t\t\treturn Token(TOKEN_OPERATOR_EQUAL, tokenPos, 2);\n\t\t\t}\n\t\t\treturn Token(TOKEN_OPERATOR_ASSIGN, tokenPos, 1);\n\n\t\tcase '!':\n\t\t\tif (fPos[1] == '=') {\n\t\t\t\tfPos += 2;\n\t\t\t\treturn Token(TOKEN_OPERATOR_NOT_EQUAL, tokenPos, 2);\n\t\t\t}\n\t\t\tbreak;\n\n\t\tcase '>':\n\t\t\tfPos++;\n\t\t\tif (*fPos == '=') {\n\t\t\t\tfPos++;\n\t\t\t\treturn Token(TOKEN_OPERATOR_GREATER_EQUAL, tokenPos, 2);\n\t\t\t}\n\t\t\treturn Token(TOKEN_OPERATOR_GREATER, tokenPos, 1);\n\n\t\tdefault:\n\t\t{\n\t\t\tstd::string string;\n\t\t\tchar quoteChar = '\\0';\n\n\t\t\tfor (; *fPos != '\\0'; fPos++) {\n\t\t\t\tchar c = *fPos;\n\t\t\t\tif (quoteChar != '\\0') {\n\t\t\t\t\t// within a quoted string segment\n\t\t\t\t\tif (c == quoteChar) {\n\t\t\t\t\t\tquoteChar = '\\0';\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (c == '\\\\') {\n\t\t\t\t\t\t// next char is escaped\n\t\t\t\t\t\tc = *++fPos;\n\t\t\t\t\t\tif (c == '\\0') {\n\t\t\t\t\t\t\tthrow ParseError(\"unterminated quoted-string\",\n\t\t\t\t\t\t\t\ttokenPos);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (c == 'n')\n\t\t\t\t\t\t\tc = '\\n';\n\t\t\t\t\t\telse if (c == 't')\n\t\t\t\t\t\t\tc = '\\t';\n\t\t\t\t\t}\n\n\t\t\t\t\tstring += c;\n\t\t\t\t} else {\n\t\t\t\t\t// unquoted string segment\n\t\t\t\t\tswitch (c) {\n\t\t\t\t\t\tcase '\"':\n\t\t\t\t\t\tcase '\\'':\n\t\t\t\t\t\t\t// quoted string start\n\t\t\t\t\t\t\tquoteChar = c;\n\t\t\t\t\t\t\tcontinue;\n\n\t\t\t\t\t\tcase '{':\n\t\t\t\t\t\tcase '}':\n\t\t\t\t\t\tcase '<':\n\t\t\t\t\t\tcase '=':\n\t\t\t\t\t\tcase '!':\n\t\t\t\t\t\tcase '>':\n\t\t\t\t\t\t\t// a separator character -- this ends the string\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase '\\\\':\n\t\t\t\t\t\t\t// next char is escaped\n\t\t\t\t\t\t\tc = *++fPos;\n\t\t\t\t\t\t\tif (c == '\\0') {\n\t\t\t\t\t\t\t\tthrow ParseError(\"'\\\\' at end of string\",\n\t\t\t\t\t\t\t\t\ttokenPos);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tstring += c;\n\t\t\t\t\t\t\tcontinue;\n\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\tif (isspace(c))\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tstring += c;\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn Token(TOKEN_STRING, tokenPos, fPos - tokenPos,\n\t\t\t\tstring.c_str());\n\t\t}\n\t}\n\n\tBString error = BString(\"unknown token '\") << *fPos << \"' encountered\";\n\tthrow ParseError(error.String(), fPos);\n}\n\n\nvoid\nBPackageInfo::Parser::_RewindTo(const Token& token)\n{\n\tfPos = token.pos;\n}\n\n\nvoid\nBPackageInfo::Parser::_ParseStringValue(BString* value, const char** _tokenPos)\n{\n\tToken string = _NextToken();\n\tif (string.type != TOKEN_STRING)\n\t\tthrow ParseError(\"expected string\", string.pos);\n\n\t*value = string.text;\n\tif (_tokenPos != NULL)\n\t\t*_tokenPos = string.pos;\n}\n\n\nvoid\nBPackageInfo::Parser::_ParseArchitectureValue(BPackageArchitecture* value)\n{\n\tToken arch = _NextToken();\n\tif (arch.type == TOKEN_STRING) {\n\t\tfor (int i = 0; i < B_PACKAGE_ARCHITECTURE_ENUM_COUNT; ++i) {\n\t\t\tif (arch.text.ICompare(BPackageInfo::kArchitectureNames[i]) == 0) {\n\t\t\t\t*value = (BPackageArchitecture)i;\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n\n\tBString error(\"architecture must be one of: [\");\n\tfor (int i = 0; i < B_PACKAGE_ARCHITECTURE_ENUM_COUNT; ++i) {\n\t\tif (i > 0)\n\t\t\terror << \",\";\n\t\terror << BPackageInfo::kArchitectureNames[i];\n\t}\n\terror << \"]\";\n\tthrow ParseError(error, arch.pos);\n}\n\n\nvoid\nBPackageInfo::Parser::_ParseVersionValue(BPackageVersion* value,\n\tbool revisionIsOptional)\n{\n\tToken word = _NextToken();\n\t_ParseVersionValue(word, value, revisionIsOptional);\n}\n\n\n/*static*/ void\nBPackageInfo::Parser::_ParseVersionValue(Token& word, BPackageVersion* value,\n\tbool revisionIsOptional)\n{\n\tif (word.type != TOKEN_STRING)\n\t\tthrow ParseError(\"expected string (a version)\", word.pos);\n\n\t// get the revision number\n\tuint32 revision = 0;\n\tint32 dashPos = word.text.FindLast('-');\n\tif (dashPos >= 0) {\n\t\tchar* end;\n\t\tlong long number = strtoll(word.text.String() + dashPos + 1, &end,\n\t\t\t0);\n\t\tif (*end != '\\0' || number < 0 || number > UINT_MAX) {\n\t\t\tthrow ParseError(\"revision must be a number > 0 and < UINT_MAX\",\n\t\t\t\tword.pos + dashPos + 1);\n\t\t}\n\n\t\trevision = (uint32)number;\n\t\tword.text.Truncate(dashPos);\n\t}\n\n\tif (revision == 0 && !revisionIsOptional) {\n\t\tthrow ParseError(\"expected revision number (- suffix)\",\n\t\t\tword.pos + word.text.Length());\n\t}\n\n\t// get the pre-release string\n\tBString preRelease;\n\tint32 tildePos = word.text.FindLast('~');\n\tif (tildePos >= 0) {\n\t\tword.text.CopyInto(preRelease, tildePos + 1,\n\t\t\tword.text.Length() - tildePos - 1);\n\t\tword.text.Truncate(tildePos);\n\n\t\tif (preRelease.IsEmpty()) {\n\t\t\tthrow ParseError(\"invalid empty pre-release string\",\n\t\t\t\tword.pos + tildePos + 1);\n\t\t}\n\n\t\tint32 errorPos;\n\t\tif (!_IsAlphaNumUnderscore(preRelease, \".\", &errorPos)) {\n\t\t\tthrow ParseError(\"invalid character in pre-release string\",\n\t\t\t\tword.pos + tildePos + 1 + errorPos);\n\t\t}\n\t}\n\n\t// get major, minor, and micro strings\n\tBString major;\n\tBString minor;\n\tBString micro;\n\tint32 firstDotPos = word.text.FindFirst('.');\n\tif (firstDotPos < 0)\n\t\tmajor = word.text;\n\telse {\n\t\tword.text.CopyInto(major, 0, firstDotPos);\n\t\tint32 secondDotPos = word.text.FindFirst('.', firstDotPos + 1);\n\t\tif (secondDotPos == firstDotPos + 1)\n\t\t\tthrow ParseError(\"expected minor version\", word.pos + secondDotPos);\n\n\t\tif (secondDotPos < 0) {\n\t\t\tword.text.CopyInto(minor, firstDotPos + 1, word.text.Length());\n\t\t} else {\n\t\t\tword.text.CopyInto(minor, firstDotPos + 1,\n\t\t\t\tsecondDotPos - (firstDotPos + 1));\n\t\t\tword.text.CopyInto(micro, secondDotPos + 1, word.text.Length());\n\n\t\t\tint32 errorPos;\n\t\t\tif (!_IsAlphaNumUnderscore(micro, \".\", &errorPos)) {\n\t\t\t\tthrow ParseError(\"invalid character in micro version string\",\n\t\t\t\t\tword.pos + secondDotPos + 1 + errorPos);\n\t\t\t}\n\t\t}\n\n\t\tint32 errorPos;\n\t\tif (!_IsAlphaNumUnderscore(minor, \"\", &errorPos)) {\n\t\t\tthrow ParseError(\"invalid character in minor version string\",\n\t\t\t\tword.pos + firstDotPos + 1 + errorPos);\n\t\t}\n\t}\n\n\tint32 errorPos;\n\tif (!_IsAlphaNumUnderscore(major, \"\", &errorPos)) {\n\t\tthrow ParseError(\"invalid character in major version string\",\n\t\t\tword.pos + errorPos);\n\t}\n\n\tvalue->SetTo(major, minor, micro, preRelease, revision);\n}\n\n\nvoid\nBPackageInfo::Parser::_ParseResolvableExpression(const Token& token,\n\tBPackageResolvableExpression& _value, BString* _basePackage)\n{\n\tif (token.type != TOKEN_STRING) {\n\t\tthrow ParseError(\"expected word (a resolvable name)\",\n\t\t\ttoken.pos);\n\t}\n\n\tint32 errorPos;\n\tif (!_IsValidResolvableName(token.text, &errorPos)) {\n\t\tthrow ParseError(\"invalid character in resolvable name\",\n\t\t\ttoken.pos + errorPos);\n\t}\n\n\tBPackageVersion version;\n\tToken op = _NextToken();\n\tBPackageResolvableOperator resolvableOperator;\n\tif (op.type == TOKEN_OPERATOR_LESS\n\t\t|| op.type == TOKEN_OPERATOR_LESS_EQUAL\n\t\t|| op.type == TOKEN_OPERATOR_EQUAL\n\t\t|| op.type == TOKEN_OPERATOR_NOT_EQUAL\n\t\t|| op.type == TOKEN_OPERATOR_GREATER_EQUAL\n\t\t|| op.type == TOKEN_OPERATOR_GREATER) {\n\t\t_ParseVersionValue(&version, true);\n\n\t\tif (_basePackage != NULL) {\n\t\t\tToken base = _NextToken();\n\t\t\tif (base.type == TOKEN_STRING && base.text == \"base\") {\n\t\t\t\tif (!_basePackage->IsEmpty()) {\n\t\t\t\t\tthrow ParseError(\"multiple packages marked as base package\",\n\t\t\t\t\t\ttoken.pos);\n\t\t\t\t}\n\n\t\t\t\t*_basePackage = token.text;\n\t\t\t} else\n\t\t\t\t_RewindTo(base);\n\t\t}\n\n\t\tresolvableOperator = (BPackageResolvableOperator)\n\t\t\t(op.type - TOKEN_OPERATOR_LESS);\n\t} else if (op.type == TOKEN_ITEM_SEPARATOR\n\t\t|| op.type == TOKEN_CLOSE_BRACE || op.type == TOKEN_EOF) {\n\t\t_RewindTo(op);\n\t\tresolvableOperator = B_PACKAGE_RESOLVABLE_OP_ENUM_COUNT;\n\t} else {\n\t\tthrow ParseError(\n\t\t\t\"expected '<', '<=', '==', '!=', '>=', '>', comma or '}'\",\n\t\t\top.pos);\n\t}\n\n\t_value.SetTo(token.text, resolvableOperator, version);\n}\n\n\nvoid\nBPackageInfo::Parser::_ParseList(ListElementParser& elementParser,\n\tbool allowSingleNonListElement)\n{\n\tToken openBracket = _NextToken();\n\tif (openBracket.type != TOKEN_OPEN_BRACE) {\n\t\tif (!allowSingleNonListElement)\n\t\t\tthrow ParseError(\"expected start of list ('{')\", openBracket.pos);\n\n\t\telementParser(openBracket);\n\t\treturn;\n\t}\n\n\twhile (true) {\n\t\tToken token = _NextToken();\n\t\tif (token.type == TOKEN_CLOSE_BRACE)\n\t\t\treturn;\n\n\t\tif (token.type == TOKEN_ITEM_SEPARATOR)\n\t\t\tcontinue;\n\n\t\telementParser(token);\n\t}\n}\n\n\nvoid\nBPackageInfo::Parser::_ParseStringList(BStringList* value,\n\tbool requireResolvableName, bool convertToLowerCase,\n\tStringValidator* stringValidator)\n{\n\tstruct StringParser : public ListElementParser {\n\t\tBStringList* value;\n\t\tbool requireResolvableName;\n\t\tbool convertToLowerCase;\n\t\tStringValidator* stringValidator;\n\n\t\tStringParser(BStringList* value, bool requireResolvableName,\n\t\t\tbool convertToLowerCase, StringValidator* stringValidator)\n\t\t\t:\n\t\t\tvalue(value),\n\t\t\trequireResolvableName(requireResolvableName),\n\t\t\tconvertToLowerCase(convertToLowerCase),\n\t\t\tstringValidator(stringValidator)\n\t\t{\n\t\t}\n\n\t\tvirtual void operator()(const Token& token)\n\t\t{\n\t\t\tif (token.type != TOKEN_STRING)\n\t\t\t\tthrow ParseError(\"expected string\", token.pos);\n\n\t\t\tif (requireResolvableName) {\n\t\t\t\tint32 errorPos;\n\t\t\t\tif (!_IsValidResolvableName(token.text, &errorPos)) {\n\t\t\t\t\tthrow ParseError(\"invalid character in resolvable name\",\n\t\t\t\t\t\ttoken.pos + errorPos);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tBString element(token.text);\n\t\t\tif (convertToLowerCase)\n\t\t\t\telement.ToLower();\n\n\t\t\tif (stringValidator != NULL)\n\t\t\t\tstringValidator->Validate(element, token.pos);\n\n\t\t\tvalue->Add(element);\n\t\t}\n\t} stringParser(value, requireResolvableName, convertToLowerCase,\n\t\tstringValidator);\n\n\t_ParseList(stringParser, true);\n}\n\n\nuint32\nBPackageInfo::Parser::_ParseFlags()\n{\n\tstruct FlagParser : public ListElementParser {\n\t\tuint32 flags;\n\n\t\tFlagParser()\n\t\t\t:\n\t\t\tflags(0)\n\t\t{\n\t\t}\n\n\t\tvirtual void operator()(const Token& token)\n\t\t{\n\t\t\tif (token.type != TOKEN_STRING)\n\t\t\t\tthrow ParseError(\"expected word (a flag)\", token.pos);\n\n\t\t\tif (token.text.ICompare(\"approve_license\") == 0)\n\t\t\t\tflags |= B_PACKAGE_FLAG_APPROVE_LICENSE;\n\t\t\telse if (token.text.ICompare(\"system_package\") == 0)\n\t\t\t\tflags |= B_PACKAGE_FLAG_SYSTEM_PACKAGE;\n\t\t\telse {\n\t\t\t\tthrow ParseError(\n\t\t\t\t\t\"expected 'approve_license' or 'system_package'\",\n\t\t\t\t\ttoken.pos);\n\t\t\t}\n\t\t}\n\t} flagParser;\n\n\t_ParseList(flagParser, true);\n\n\treturn flagParser.flags;\n}\n\n\nvoid\nBPackageInfo::Parser::_ParseResolvableList(\n\tBObjectList* value)\n{\n\tstruct ResolvableParser : public ListElementParser {\n\t\tParser& parser;\n\t\tBObjectList* value;\n\n\t\tResolvableParser(Parser& parser_,\n\t\t\tBObjectList* value_)\n\t\t\t:\n\t\t\tparser(parser_),\n\t\t\tvalue(value_)\n\t\t{\n\t\t}\n\n\t\tvirtual void operator()(const Token& token)\n\t\t{\n\t\t\tif (token.type != TOKEN_STRING) {\n\t\t\t\tthrow ParseError(\"expected word (a resolvable name)\",\n\t\t\t\t\ttoken.pos);\n\t\t\t}\n\n\t\t\tint32 errorPos;\n\t\t\tif (!_IsValidResolvableName(token.text, &errorPos)) {\n\t\t\t\tthrow ParseError(\"invalid character in resolvable name\",\n\t\t\t\t\ttoken.pos + errorPos);\n\t\t\t}\n\n\t\t\t// parse version\n\t\t\tBPackageVersion version;\n\t\t\tToken op = parser._NextToken();\n\t\t\tif (op.type == TOKEN_OPERATOR_ASSIGN) {\n\t\t\t\tparser._ParseVersionValue(&version, true);\n\t\t\t} else if (op.type == TOKEN_ITEM_SEPARATOR\n\t\t\t\t|| op.type == TOKEN_CLOSE_BRACE) {\n\t\t\t\tparser._RewindTo(op);\n\t\t\t} else\n\t\t\t\tthrow ParseError(\"expected '=', comma or '}'\", op.pos);\n\n\t\t\t// parse compatible version\n\t\t\tBPackageVersion compatibleVersion;\n\t\t\tToken compatible = parser._NextToken();\n\t\t\tif (compatible.type == TOKEN_STRING\n\t\t\t\t&& (compatible.text == \"compat\"\n\t\t\t\t\t|| compatible.text == \"compatible\")) {\n\t\t\t\top = parser._NextToken();\n\t\t\t\tif (op.type == TOKEN_OPERATOR_GREATER_EQUAL) {\n\t\t\t\t\tparser._ParseVersionValue(&compatibleVersion, true);\n\t\t\t\t} else\n\t\t\t\t\tparser._RewindTo(compatible);\n\t\t\t} else\n\t\t\t\tparser._RewindTo(compatible);\n\n\t\t\tvalue->AddItem(new BPackageResolvable(token.text, version,\n\t\t\t\tcompatibleVersion));\n\t\t}\n\t} resolvableParser(*this, value);\n\n\t_ParseList(resolvableParser, false);\n}\n\n\nvoid\nBPackageInfo::Parser::_ParseResolvableExprList(\n\tBObjectList* value, BString* _basePackage)\n{\n\tstruct ResolvableExpressionParser : public ListElementParser {\n\t\tParser& parser;\n\t\tBObjectList* value;\n\t\tBString* basePackage;\n\n\t\tResolvableExpressionParser(Parser& parser,\n\t\t\tBObjectList* value,\n\t\t\tBString* basePackage)\n\t\t\t:\n\t\t\tparser(parser),\n\t\t\tvalue(value),\n\t\t\tbasePackage(basePackage)\n\t\t{\n\t\t}\n\n\t\tvirtual void operator()(const Token& token)\n\t\t{\n\t\t\tBPackageResolvableExpression expression;\n\t\t\tparser._ParseResolvableExpression(token, expression, basePackage);\n\t\t\tvalue->AddItem(new BPackageResolvableExpression(expression));\n\t\t}\n\t} resolvableExpressionParser(*this, value, _basePackage);\n\n\t_ParseList(resolvableExpressionParser, false);\n}\n\n\nvoid\nBPackageInfo::Parser::_ParseGlobalWritableFileInfos(\n\tGlobalWritableFileInfoList* infos)\n{\n\tstruct GlobalWritableFileInfoParser : public ListElementParser {\n\t\tParser& parser;\n\t\tGlobalWritableFileInfoList* infos;\n\n\t\tGlobalWritableFileInfoParser(Parser& parser,\n\t\t\tGlobalWritableFileInfoList* infos)\n\t\t\t:\n\t\t\tparser(parser),\n\t\t\tinfos(infos)\n\t\t{\n\t\t}\n\n\t\tvirtual void operator()(const Token& token)\n\t\t{\n\t\t\tif (token.type != TOKEN_STRING) {\n\t\t\t\tthrow ParseError(\"expected string (a file path)\",\n\t\t\t\t\ttoken.pos);\n\t\t\t}\n\n\t\t\tBWritableFileUpdateType updateType\n\t\t\t\t= B_WRITABLE_FILE_UPDATE_TYPE_ENUM_COUNT;\n\t\t\tbool isDirectory = false;\n\n\t\t\tToken nextToken = parser._NextToken();\n\t\t\tif (nextToken.type == TOKEN_STRING\n\t\t\t\t&& nextToken.text == \"directory\") {\n\t\t\t\tisDirectory = true;\n\t\t\t\tnextToken = parser._NextToken();\n\t\t\t}\n\n\t\t\tif (nextToken.type == TOKEN_STRING) {\n\t\t\t\tconst char* const* end = kWritableFileUpdateTypes\n\t\t\t\t\t+ B_WRITABLE_FILE_UPDATE_TYPE_ENUM_COUNT;\n\t\t\t\tconst char* const* found = std::find(kWritableFileUpdateTypes,\n\t\t\t\t\tend, nextToken.text);\n\t\t\t\tif (found == end) {\n\t\t\t\t\tthrow ParseError(BString(\"expected an update type\"),\n\t\t\t\t\t\tnextToken.pos);\n\t\t\t\t}\n\t\t\t\tupdateType = (BWritableFileUpdateType)(\n\t\t\t\t\tfound - kWritableFileUpdateTypes);\n\t\t\t} else if (nextToken.type == TOKEN_ITEM_SEPARATOR\n\t\t\t\t|| nextToken.type == TOKEN_CLOSE_BRACE) {\n\t\t\t\tparser._RewindTo(nextToken);\n\t\t\t} else {\n\t\t\t\tthrow ParseError(\n\t\t\t\t\t\"expected 'included', semicolon, new line or '}'\",\n\t\t\t\t\tnextToken.pos);\n\t\t\t}\n\n\t\t\tif (!infos->AddItem(new BGlobalWritableFileInfo(token.text,\n\t\t\t\t\tupdateType, isDirectory))) {\n\t\t\t\tthrow std::bad_alloc();\n\t\t\t}\n\t\t}\n\t} resolvableExpressionParser(*this, infos);\n\n\t_ParseList(resolvableExpressionParser, false);\n}\n\n\nvoid\nBPackageInfo::Parser::_ParseUserSettingsFileInfos(\n\tUserSettingsFileInfoList* infos)\n{\n\tstruct UserSettingsFileInfoParser : public ListElementParser {\n\t\tParser& parser;\n\t\tUserSettingsFileInfoList* infos;\n\n\t\tUserSettingsFileInfoParser(Parser& parser,\n\t\t\tUserSettingsFileInfoList* infos)\n\t\t\t:\n\t\t\tparser(parser),\n\t\t\tinfos(infos)\n\t\t{\n\t\t}\n\n\t\tvirtual void operator()(const Token& token)\n\t\t{\n\t\t\tif (token.type != TOKEN_STRING) {\n\t\t\t\tthrow ParseError(\"expected string (a settings file path)\",\n\t\t\t\t\ttoken.pos);\n\t\t\t}\n\n\t\t\tBString templatePath;\n\t\t\tbool isDirectory = false;\n\n\t\t\tToken nextToken = parser._NextToken();\n\t\t\tif (nextToken.type == TOKEN_STRING\n\t\t\t\t&& nextToken.text == \"directory\") {\n\t\t\t\tisDirectory = true;\n\t\t\t} else if (nextToken.type == TOKEN_STRING\n\t\t\t\t&& nextToken.text == \"template\") {\n\t\t\t\tnextToken = parser._NextToken();\n\t\t\t\tif (nextToken.type != TOKEN_STRING) {\n\t\t\t\t\tthrow ParseError(\n\t\t\t\t\t\t\"expected string (a settings template file path)\",\n\t\t\t\t\t\tnextToken.pos);\n\t\t\t\t}\n\t\t\t\ttemplatePath = nextToken.text;\n\t\t\t} else if (nextToken.type == TOKEN_ITEM_SEPARATOR\n\t\t\t\t|| nextToken.type == TOKEN_CLOSE_BRACE) {\n\t\t\t\tparser._RewindTo(nextToken);\n\t\t\t} else {\n\t\t\t\tthrow ParseError(\n\t\t\t\t\t\"expected 'template', semicolon, new line or '}'\",\n\t\t\t\t\tnextToken.pos);\n\t\t\t}\n\n\t\t\tif (isDirectory\n\t\t\t\t? !infos->AddItem(new BUserSettingsFileInfo(token.text, true))\n\t\t\t\t: !infos->AddItem(new BUserSettingsFileInfo(token.text,\n\t\t\t\t\t\ttemplatePath))) {\n\t\t\t\tthrow std::bad_alloc();\n\t\t\t}\n\t\t}\n\t} resolvableExpressionParser(*this, infos);\n\n\t_ParseList(resolvableExpressionParser, false);\n}\n\n\nvoid\nBPackageInfo::Parser::_ParseUsers(UserList* users)\n{\n\tstruct UserParser : public ListElementParser {\n\t\tParser& parser;\n\t\tUserList* users;\n\n\t\tUserParser(Parser& parser, UserList* users)\n\t\t\t:\n\t\t\tparser(parser),\n\t\t\tusers(users)\n\t\t{\n\t\t}\n\n\t\tvirtual void operator()(const Token& token)\n\t\t{\n\t\t\tif (token.type != TOKEN_STRING\n\t\t\t\t|| !BUser::IsValidUserName(token.text)) {\n\t\t\t\tthrow ParseError(\"expected a user name\", token.pos);\n\t\t\t}\n\n\t\t\tBString realName;\n\t\t\tBString home;\n\t\t\tBString shell;\n\t\t\tBStringList groups;\n\n\t\t\tfor (;;) {\n\t\t\t\tToken nextToken = parser._NextToken();\n\t\t\t\tif (nextToken.type != TOKEN_STRING) {\n\t\t\t\t\tparser._RewindTo(nextToken);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif (nextToken.text == \"real-name\") {\n\t\t\t\t\tnextToken = parser._NextToken();\n\t\t\t\t\tif (nextToken.type != TOKEN_STRING) {\n\t\t\t\t\t\tthrow ParseError(\"expected string (a user real name)\",\n\t\t\t\t\t\t\tnextToken.pos);\n\t\t\t\t\t}\n\t\t\t\t\trealName = nextToken.text;\n\t\t\t\t} else if (nextToken.text == \"home\") {\n\t\t\t\t\tnextToken = parser._NextToken();\n\t\t\t\t\tif (nextToken.type != TOKEN_STRING) {\n\t\t\t\t\t\tthrow ParseError(\"expected string (a home path)\",\n\t\t\t\t\t\t\tnextToken.pos);\n\t\t\t\t\t}\n\t\t\t\t\thome = nextToken.text;\n\t\t\t\t} else if (nextToken.text == \"shell\") {\n\t\t\t\t\tnextToken = parser._NextToken();\n\t\t\t\t\tif (nextToken.type != TOKEN_STRING) {\n\t\t\t\t\t\tthrow ParseError(\"expected string (a shell path)\",\n\t\t\t\t\t\t\tnextToken.pos);\n\t\t\t\t\t}\n\t\t\t\t\tshell = nextToken.text;\n\t\t\t\t} else if (nextToken.text == \"groups\") {\n\t\t\t\t\tfor (;;) {\n\t\t\t\t\t\tnextToken = parser._NextToken();\n\t\t\t\t\t\tif (nextToken.type == TOKEN_STRING\n\t\t\t\t\t\t\t&& BUser::IsValidUserName(nextToken.text)) {\n\t\t\t\t\t\t\tif (!groups.Add(nextToken.text))\n\t\t\t\t\t\t\t\tthrow std::bad_alloc();\n\t\t\t\t\t\t} else if (nextToken.type == TOKEN_ITEM_SEPARATOR\n\t\t\t\t\t\t\t|| nextToken.type == TOKEN_CLOSE_BRACE) {\n\t\t\t\t\t\t\tparser._RewindTo(nextToken);\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tthrow ParseError(\"expected a group name\",\n\t\t\t\t\t\t\t\tnextToken.pos);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t} else {\n\t\t\t\t\tthrow ParseError(\n\t\t\t\t\t\t\"expected 'real-name', 'home', 'shell', or 'groups'\",\n\t\t\t\t\t\tnextToken.pos);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tBString templatePath;\n\n\t\t\tToken nextToken = parser._NextToken();\n\t\t\tif (nextToken.type == TOKEN_STRING\n\t\t\t\t&& nextToken.text == \"template\") {\n\t\t\t\tnextToken = parser._NextToken();\n\t\t\t\tif (nextToken.type != TOKEN_STRING) {\n\t\t\t\t\tthrow ParseError(\n\t\t\t\t\t\t\"expected string (a settings template file path)\",\n\t\t\t\t\t\tnextToken.pos);\n\t\t\t\t}\n\t\t\t\ttemplatePath = nextToken.text;\n\t\t\t} else if (nextToken.type == TOKEN_ITEM_SEPARATOR\n\t\t\t\t|| nextToken.type == TOKEN_CLOSE_BRACE) {\n\t\t\t\tparser._RewindTo(nextToken);\n\t\t\t} else {\n\t\t\t\tthrow ParseError(\n\t\t\t\t\t\"expected 'template', semicolon, new line or '}'\",\n\t\t\t\t\tnextToken.pos);\n\t\t\t}\n\n\t\t\tif (!users->AddItem(new BUser(token.text, realName, home, shell,\n\t\t\t\t\tgroups))) {\n\t\t\t\tthrow std::bad_alloc();\n\t\t\t}\n\t\t}\n\t} resolvableExpressionParser(*this, users);\n\n\t_ParseList(resolvableExpressionParser, false);\n}\n\n\nvoid\nBPackageInfo::Parser::_Parse(BPackageInfo* packageInfo)\n{\n\tbool seen[B_PACKAGE_INFO_ENUM_COUNT];\n\tfor (int i = 0; i < B_PACKAGE_INFO_ENUM_COUNT; ++i)\n\t\tseen[i] = false;\n\n\tconst char* const* names = BPackageInfo::kElementNames;\n\n\twhile (Token t = _NextToken()) {\n\t\tif (t.type == TOKEN_ITEM_SEPARATOR)\n\t\t\tcontinue;\n\n\t\tif (t.type != TOKEN_STRING)\n\t\t\tthrow ParseError(\"expected string (a variable name)\", t.pos);\n\n\t\tBPackageInfoAttributeID attribute = B_PACKAGE_INFO_ENUM_COUNT;\n\t\tfor (int i = 0; i < B_PACKAGE_INFO_ENUM_COUNT; i++) {\n\t\t\tif (names[i] != NULL && t.text.ICompare(names[i]) == 0) {\n\t\t\t\tattribute = (BPackageInfoAttributeID)i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif (attribute == B_PACKAGE_INFO_ENUM_COUNT) {\n\t\t\tBString error = BString(\"unknown attribute \\\"\") << t.text << '\"';\n\t\t\tthrow ParseError(error, t.pos);\n\t\t}\n\n\t\tif (seen[attribute]) {\n\t\t\tBString error = BString(names[attribute]) << \" already seen!\";\n\t\t\tthrow ParseError(error, t.pos);\n\t\t}\n\n\t\tswitch (attribute) {\n\t\t\tcase B_PACKAGE_INFO_NAME:\n\t\t\t{\n\t\t\t\tBString name;\n\t\t\t\tconst char* namePos;\n\t\t\t\t_ParseStringValue(&name, &namePos);\n\n\t\t\t\tint32 errorPos;\n\t\t\t\tif (!_IsValidResolvableName(name, &errorPos)) {\n\t\t\t\t\tthrow ParseError(\"invalid character in package name\",\n\t\t\t\t\t\tnamePos + errorPos);\n\t\t\t\t}\n\n\t\t\t\tpackageInfo->SetName(name);\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase B_PACKAGE_INFO_SUMMARY:\n\t\t\t{\n\t\t\t\tBString summary;\n\t\t\t\t_ParseStringValue(&summary);\n\t\t\t\tif (summary.FindFirst('\\n') >= 0)\n\t\t\t\t\tthrow ParseError(\"the summary contains linebreaks\", t.pos);\n\t\t\t\tpackageInfo->SetSummary(summary);\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tcase B_PACKAGE_INFO_DESCRIPTION:\n\t\t\t\t_ParseStringValue(&packageInfo->fDescription);\n\t\t\t\tbreak;\n\n\t\t\tcase B_PACKAGE_INFO_VENDOR:\n\t\t\t\t_ParseStringValue(&packageInfo->fVendor);\n\t\t\t\tbreak;\n\n\t\t\tcase B_PACKAGE_INFO_PACKAGER:\n\t\t\t\t_ParseStringValue(&packageInfo->fPackager);\n\t\t\t\tbreak;\n\n\t\t\tcase B_PACKAGE_INFO_BASE_PACKAGE:\n\t\t\t\t_ParseStringValue(&packageInfo->fBasePackage);\n\t\t\t\tbreak;\n\n\t\t\tcase B_PACKAGE_INFO_ARCHITECTURE:\n\t\t\t\t_ParseArchitectureValue(&packageInfo->fArchitecture);\n\t\t\t\tbreak;\n\n\t\t\tcase B_PACKAGE_INFO_VERSION:\n\t\t\t\t_ParseVersionValue(&packageInfo->fVersion, false);\n\t\t\t\tbreak;\n\n\t\t\tcase B_PACKAGE_INFO_COPYRIGHTS:\n\t\t\t\t_ParseStringList(&packageInfo->fCopyrightList);\n\t\t\t\tbreak;\n\n\t\t\tcase B_PACKAGE_INFO_LICENSES:\n\t\t\t\t_ParseStringList(&packageInfo->fLicenseList);\n\t\t\t\tbreak;\n\n\t\t\tcase B_PACKAGE_INFO_URLS:\n\t\t\t{\n\t\t\t\tUrlStringValidator stringValidator;\n\t\t\t\t_ParseStringList(&packageInfo->fURLList,\n\t\t\t\t\tfalse, false, &stringValidator);\n\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase B_PACKAGE_INFO_SOURCE_URLS:\n\t\t\t{\n\t\t\t\tUrlStringValidator stringValidator;\n\t\t\t\t_ParseStringList(&packageInfo->fSourceURLList,\n\t\t\t\t\tfalse, false, &stringValidator);\n\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase B_PACKAGE_INFO_GLOBAL_WRITABLE_FILES:\n\t\t\t\t_ParseGlobalWritableFileInfos(\n\t\t\t\t\t&packageInfo->fGlobalWritableFileInfos);\n\t\t\t\tbreak;\n\n\t\t\tcase B_PACKAGE_INFO_USER_SETTINGS_FILES:\n\t\t\t\t_ParseUserSettingsFileInfos(\n\t\t\t\t\t&packageInfo->fUserSettingsFileInfos);\n\t\t\t\tbreak;\n\n\t\t\tcase B_PACKAGE_INFO_USERS:\n\t\t\t\t_ParseUsers(&packageInfo->fUsers);\n\t\t\t\tbreak;\n\n\t\t\tcase B_PACKAGE_INFO_GROUPS:\n\t\t\t\t_ParseStringList(&packageInfo->fGroups);\n\t\t\t\tbreak;\n\n\t\t\tcase B_PACKAGE_INFO_POST_INSTALL_SCRIPTS:\n\t\t\t\t_ParseStringList(&packageInfo->fPostInstallScripts);\n\t\t\t\tbreak;\n\n\t\t\tcase B_PACKAGE_INFO_PROVIDES:\n\t\t\t\t_ParseResolvableList(&packageInfo->fProvidesList);\n\t\t\t\tbreak;\n\n\t\t\tcase B_PACKAGE_INFO_REQUIRES:\n\t\t\t\tpackageInfo->fBasePackage.Truncate(0);\n\t\t\t\t_ParseResolvableExprList(&packageInfo->fRequiresList,\n\t\t\t\t\t&packageInfo->fBasePackage);\n\t\t\t\tbreak;\n\n\t\t\tcase B_PACKAGE_INFO_SUPPLEMENTS:\n\t\t\t\t_ParseResolvableExprList(&packageInfo->fSupplementsList);\n\t\t\t\tbreak;\n\n\t\t\tcase B_PACKAGE_INFO_CONFLICTS:\n\t\t\t\t_ParseResolvableExprList(&packageInfo->fConflictsList);\n\t\t\t\tbreak;\n\n\t\t\tcase B_PACKAGE_INFO_FRESHENS:\n\t\t\t\t_ParseResolvableExprList(&packageInfo->fFreshensList);\n\t\t\t\tbreak;\n\n\t\t\tcase B_PACKAGE_INFO_REPLACES:\n\t\t\t\t_ParseStringList(&packageInfo->fReplacesList, true);\n\t\t\t\tbreak;\n\n\t\t\tcase B_PACKAGE_INFO_FLAGS:\n\t\t\t\tpackageInfo->SetFlags(_ParseFlags());\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\t// can never get here\n\t\t\t\tbreak;\n\t\t}\n\n\t\tseen[attribute] = true;\n\t}\n\n\t// everything up to and including 'provides' is mandatory\n\tfor (int i = 0; i <= B_PACKAGE_INFO_PROVIDES; ++i) {\n\t\tif (!seen[i]) {\n\t\t\tBString error = BString(names[i]) << \" is not being set anywhere!\";\n\t\t\tthrow ParseError(error, fPos);\n\t\t}\n\t}\n}\n\n\n/*static*/ inline bool\nBPackageInfo::Parser::_IsAlphaNumUnderscore(const BString& string,\n\tconst char* additionalChars, int32* _errorPos)\n{\n\treturn _IsAlphaNumUnderscore(string.String(),\n\t\tstring.String() + string.Length(), additionalChars, _errorPos);\n}\n\n\n/*static*/ inline bool\nBPackageInfo::Parser::_IsAlphaNumUnderscore(const char* string,\n\tconst char* additionalChars, int32* _errorPos)\n{\n\treturn _IsAlphaNumUnderscore(string, string + strlen(string),\n\t\tadditionalChars, _errorPos);\n}\n\n\n/*static*/ bool\nBPackageInfo::Parser::_IsAlphaNumUnderscore(const char* start, const char* end,\n\tconst char* additionalChars, int32* _errorPos)\n{\n\tfor (const char* c = start; c < end; c++) {\n\t\tif (!isalnum(*c) && *c != '_' && strchr(additionalChars, *c) == NULL) {\n\t\t\tif (_errorPos != NULL)\n\t\t\t\t*_errorPos = c - start;\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\n\n/*static*/ bool\nBPackageInfo::Parser::_IsValidResolvableName(const char* string,\n\tint32* _errorPos)\n{\n\tfor (const char* c = string; *c != '\\0'; c++) {\n\t\tswitch (*c) {\n\t\t\tcase '-':\n\t\t\tcase '/':\n\t\t\tcase '<':\n\t\t\tcase '>':\n\t\t\tcase '=':\n\t\t\tcase '!':\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tif (!isspace(*c))\n\t\t\t\t\tcontinue;\n\t\t\t\tbreak;\n\t\t}\n\n\t\tif (_errorPos != NULL)\n\t\t\t*_errorPos = c - string;\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nvoid\nBPackageInfo::Parser::UrlStringValidator::Validate(const BString& urlString,\n\tconst char* pos)\n{\n\tBUrl url(urlString);\n\n\tif (!url.IsValid())\n\t\tthrow ParseError(\"invalid url\", pos);\n}\n\n\n} // namespace BPackageKit\n" }, { "path": "src/test/resources/samples/langs/C++/ThreadedQueue.h", "content": "/*\n * This file is part of IRCBot\n * Copyright © 2014 Rachel Mant (dx-mon@users.sourceforge.net)\n *\n * IRCBot 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 * IRCBot 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 .\n */\n\n#ifndef __THREADED_QUEUE_H__\n#define __THREADED_QUEUE_H__\n\n#include \n#include \n\ntemplate\nclass ThreadedQueue : public std::queue\n{\nprivate:\n\tpthread_mutex_t queueMutex;\n\tpthread_cond_t queueCond;\n\npublic:\n\tThreadedQueue()\n\t{\n\t\tpthread_mutexattr_t mutexAttrs;\n\t\tpthread_condattr_t condAttrs;\n\n\t\tpthread_mutexattr_init(&mutexAttrs);\n\t\tpthread_mutexattr_settype(&mutexAttrs, PTHREAD_MUTEX_ERRORCHECK);\n\t\tpthread_mutex_init(&queueMutex, &mutexAttrs);\n\t\tpthread_mutexattr_destroy(&mutexAttrs);\n\n\t\tpthread_condattr_init(&condAttrs);\n\t\tpthread_condattr_setpshared(&condAttrs, PTHREAD_PROCESS_PRIVATE);\n\t\tpthread_cond_init(&queueCond, &condAttrs);\n\t\tpthread_condattr_destroy(&condAttrs);\n\t}\n\n\t~ThreadedQueue()\n\t{\n\t\tpthread_cond_destroy(&queueCond);\n\t\tpthread_mutex_destroy(&queueMutex);\n\t}\n\n\tvoid waitItems()\n\t{\n\t\tpthread_mutex_lock(&queueMutex);\n\t\tpthread_cond_wait(&queueCond, &queueMutex);\n\t\tpthread_mutex_unlock(&queueMutex);\n\t}\n\n\tvoid signalItems()\n\t{\n\t\tpthread_mutex_lock(&queueMutex);\n\t\tpthread_cond_broadcast(&queueCond);\n\t\tpthread_mutex_unlock(&queueMutex);\n\t}\n\n\tvoid push(T item)\n\t{\n\t\tstd::queue::push(item);\n\t\tsignalItems();\n\t}\n};\n\n#endif /*__THREADED_QUEUE_H__*/\n" }, { "path": "src/test/resources/samples/langs/C++/Types.h", "content": "/*****************************************************************************\n* Dwarf Mine - The 13-11 Benchmark\n*\n* Copyright (c) 2013 Bünger, Thomas; Kieschnick, Christian; Kusber,\n* Michael; Lohse, Henning; Wuttke, Nikolai; Xylander, Oliver; Yao, Gary;\n* Zimmermann, Florian\n*\n* Permission is hereby granted, free of charge, to any person obtaining\n* a copy of this software and associated documentation files (the\n* \"Software\"), to deal in the Software without restriction, including\n* without limitation the rights to use, copy, modify, merge, publish,\n* distribute, sublicense, and/or sell copies of the Software, and to\n* permit persons to whom the Software is furnished to do so, subject to\n* the following conditions:\n*\n* The above copyright notice and this permission notice shall be\n* included in all copies or substantial portions of the Software.\n*\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n*****************************************************************************/\n\n#pragma once\n\n#include \n\ntypedef uint32_t smallPrime_t;\n" }, { "path": "src/test/resources/samples/langs/C++/bar.h", "content": "class Bar\n{\n protected:\n\n char *name;\n\n public:\n\n void hello();\n}\n" }, { "path": "src/test/resources/samples/langs/C++/bar.hh", "content": "class Bar\n{\n protected:\n\n char *name;\n\n public:\n\n void hello();\n}\n" }, { "path": "src/test/resources/samples/langs/C++/bar.hpp", "content": "class Bar\n{\n protected:\n\n char *name;\n\n public:\n\n void hello();\n}\n" }, { "path": "src/test/resources/samples/langs/C++/bug1163046.--skeleton.re", "content": "#include \n\n#define YYCTYPE unsigned char\n#define YYCURSOR cursor\n#define YYLIMIT cursor\n#define YYMARKER marker\n#define YYFILL(n)\n\nbool scan(const char *text)\n{\n\tYYCTYPE *start = (YYCTYPE *)text;\n\tYYCTYPE *cursor = (YYCTYPE *)text;\n\tYYCTYPE *marker = (YYCTYPE *)text;\nnext:\n\tYYCTYPE *token = cursor;\n/*!re2c\n'(This file must be converted with BinHex 4.0)'\n\t{\n\t\tif (token == start || *(token - 1) == '\\n')\n\t\treturn true; else goto next;\n\t}\n[\\001-\\377]\n\t{ goto next; }\n[\\000]\n\t{ return false; }\n*/\n\treturn false;\n}\n\n#define do_scan(str, expect) \\\n\tres = scan(str) == expect ? 0 : 1; \\\n\tstd::cerr << str << \"\\t-\\t\" << (res ? \"fail\" : \"ok\") << std::endl; \\\n\tresult += res\n\n/*!max:re2c */\n\nint main(int,void**)\n{\n\tint res, result = 0;\n\tdo_scan(\"(This file must be converted with BinHex 4.0)\", 1);\n\tdo_scan(\"x(This file must be converted with BinHex 4.0)\", 0);\n\tdo_scan(\"(This file must be converted with BinHex 4.0)x\", 1);\n\tdo_scan(\"x(This file must be converted with BinHex 4.0)x\", 0);\n\t\n\treturn result;\n}\n" }, { "path": "src/test/resources/samples/langs/C++/cnokw.re", "content": "#include \n#include \n#include \n\n#define\tADDEQ\t257\n#define\tANDAND\t258\n#define\tANDEQ\t259\n#define\tARRAY\t260\n#define\tASM\t261\n#define\tAUTO\t262\n#define\tBREAK\t263\n#define\tCASE\t264\n#define\tCHAR\t265\n#define\tCONST\t266\n#define\tCONTINUE\t267\n#define\tDECR\t268\n#define\tDEFAULT\t269\n#define\tDEREF\t270\n#define\tDIVEQ\t271\n#define\tDO\t272\n#define\tDOUBLE\t273\n#define\tELLIPSIS\t274\n#define\tELSE\t275\n#define\tENUM\t276\n#define\tEQL\t277\n#define\tEXTERN\t278\n#define\tFCON\t279\n#define\tFLOAT\t280\n#define\tFOR\t281\n#define\tFUNCTION\t282\n#define\tGEQ\t283\n#define\tGOTO\t284\n#define\tICON\t285\n#define\tID\t286\n#define\tIF\t287\n#define\tINCR\t288\n#define\tINT\t289\n#define\tLEQ\t290\n#define\tLONG\t291\n#define\tLSHIFT\t292\n#define\tLSHIFTEQ\t293\n#define\tMODEQ\t294\n#define\tMULEQ\t295\n#define\tNEQ\t296\n#define\tOREQ\t297\n#define\tOROR\t298\n#define\tPOINTER\t299\n#define\tREGISTER\t300\n#define\tRETURN\t301\n#define\tRSHIFT\t302\n#define\tRSHIFTEQ\t303\n#define\tSCON\t304\n#define\tSHORT\t305\n#define\tSIGNED\t306\n#define\tSIZEOF\t307\n#define\tSTATIC\t308\n#define\tSTRUCT\t309\n#define\tSUBEQ\t310\n#define\tSWITCH\t311\n#define\tTYPEDEF\t312\n#define\tUNION\t313\n#define\tUNSIGNED\t314\n#define\tVOID\t315\n#define\tVOLATILE\t316\n#define\tWHILE\t317\n#define\tXOREQ\t318\n#define\tEOI\t319\n\ntypedef unsigned int uint;\ntypedef unsigned char uchar;\n\n#define\tBSIZE\t8192\n\n#define\tYYCTYPE\t\tuchar\n#define\tYYCURSOR\tcursor\n#define\tYYLIMIT\t\ts->lim\n#define\tYYMARKER\ts->ptr\n#define\tYYFILL(n)\t{cursor = fill(s, cursor);}\n\n#define\tRET(i)\t{s->cur = cursor; return i;}\n\ntypedef struct Scanner {\n int\t\t\tfd;\n uchar\t\t*bot, *tok, *ptr, *cur, *pos, *lim, *top, *eof;\n uint\t\tline;\n} Scanner;\n\nuchar *fill(Scanner *s, uchar *cursor){\n if(!s->eof){\n\tuint cnt = s->tok - s->bot;\n\tif(cnt){\n\t memcpy(s->bot, s->tok, s->lim - s->tok);\n\t s->tok = s->bot;\n\t s->ptr -= cnt;\n\t cursor -= cnt;\n\t s->pos -= cnt;\n\t s->lim -= cnt;\n\t}\n\tif((s->top - s->lim) < BSIZE){\n\t uchar *buf = (uchar*) malloc(((s->lim - s->bot) + BSIZE)*sizeof(uchar));\n\t memcpy(buf, s->tok, s->lim - s->tok);\n\t s->tok = buf;\n\t s->ptr = &buf[s->ptr - s->bot];\n\t cursor = &buf[cursor - s->bot];\n\t s->pos = &buf[s->pos - s->bot];\n\t s->lim = &buf[s->lim - s->bot];\n\t s->top = &s->lim[BSIZE];\n\t free(s->bot);\n\t s->bot = buf;\n\t}\n\tif((cnt = read(s->fd, (char*) s->lim, BSIZE)) != BSIZE){\n\t s->eof = &s->lim[cnt]; *(s->eof)++ = '\\n';\n\t}\n\ts->lim += cnt;\n }\n return cursor;\n}\n\nint scan(Scanner *s){\n\tuchar *cursor = s->cur;\nstd:\n\ts->tok = cursor;\n/*!re2c\nany\t= [\\000-\\377];\nO\t= [0-7];\nD\t= [0-9];\nL\t= [a-zA-Z_];\nH\t= [a-fA-F0-9];\nE\t= [Ee] [+-]? D+;\nFS\t= [fFlL];\nIS\t= [uUlL]*;\nESC\t= [\\\\] ([abfnrtv?'\"\\\\] | \"x\" H+ | O+);\n*/\n\n/*!re2c\n\t\"/*\"\t\t\t{ goto comment; }\n\t\n\tL (L|D)*\t\t{ RET(ID); }\n\t\n\t(\"0\" [xX] H+ IS?) | (\"0\" D+ IS?) | (D+ IS?) |\n\t(['] (ESC|any\\[\\n\\\\'])* ['])\n\t\t\t\t{ RET(ICON); }\n\t\n\t(D+ E FS?) | (D* \".\" D+ E? FS?) | (D+ \".\" D* E? FS?)\n\t\t\t\t{ RET(FCON); }\n\t\n\t([\"] (ESC|any\\[\\n\\\\\"])* [\"])\n\t\t\t\t{ RET(SCON); }\n\t\n\t\"...\" { RET(ELLIPSIS); }\n\t\">>=\"\t\t\t{ RET(RSHIFTEQ); }\n\t\"<<=\"\t\t\t{ RET(LSHIFTEQ); }\n\t\"+=\"\t\t\t{ RET(ADDEQ); }\n\t\"-=\"\t\t\t{ RET(SUBEQ); }\n\t\"*=\"\t\t\t{ RET(MULEQ); }\n\t\"/=\"\t\t\t{ RET(DIVEQ); }\n\t\"%=\"\t\t\t{ RET(MODEQ); }\n\t\"&=\"\t\t\t{ RET(ANDEQ); }\n\t\"^=\"\t\t\t{ RET(XOREQ); }\n\t\"|=\"\t\t\t{ RET(OREQ); }\n\t\">>\"\t\t\t{ RET(RSHIFT); }\n\t\"<<\"\t\t\t{ RET(LSHIFT); }\n\t\"++\"\t\t\t{ RET(INCR); }\n\t\"--\"\t\t\t{ RET(DECR); }\n\t\"->\"\t\t\t{ RET(DEREF); }\n\t\"&&\"\t\t\t{ RET(ANDAND); }\n\t\"||\"\t\t\t{ RET(OROR); }\n\t\"<=\"\t\t\t{ RET(LEQ); }\n\t\">=\"\t\t\t{ RET(GEQ); }\n\t\"==\"\t\t\t{ RET(EQL); }\n\t\"!=\"\t\t\t{ RET(NEQ); }\n\t\";\"\t\t\t{ RET(';'); }\n\t\"{\"\t\t\t{ RET('{'); }\n\t\"}\"\t\t\t{ RET('}'); }\n\t\",\"\t\t\t{ RET(','); }\n\t\":\"\t\t\t{ RET(':'); }\n\t\"=\"\t\t\t{ RET('='); }\n\t\"(\"\t\t\t{ RET('('); }\n\t\")\"\t\t\t{ RET(')'); }\n\t\"[\"\t\t\t{ RET('['); }\n\t\"]\"\t\t\t{ RET(']'); }\n\t\".\"\t\t\t{ RET('.'); }\n\t\"&\"\t\t\t{ RET('&'); }\n\t\"!\"\t\t\t{ RET('!'); }\n\t\"~\"\t\t\t{ RET('~'); }\n\t\"-\"\t\t\t{ RET('-'); }\n\t\"+\"\t\t\t{ RET('+'); }\n\t\"*\"\t\t\t{ RET('*'); }\n\t\"/\"\t\t\t{ RET('/'); }\n\t\"%\"\t\t\t{ RET('%'); }\n\t\"<\"\t\t\t{ RET('<'); }\n\t\">\"\t\t\t{ RET('>'); }\n\t\"^\"\t\t\t{ RET('^'); }\n\t\"|\"\t\t\t{ RET('|'); }\n\t\"?\"\t\t\t{ RET('?'); }\n\n\n\t[ \\t\\v\\f]+\t\t{ goto std; }\n\n\t\"\\n\"\n\t {\n\t\tif(cursor == s->eof) RET(EOI);\n\t\ts->pos = cursor; s->line++;\n\t\tgoto std;\n\t }\n\n\tany\n\t {\n\t\tprintf(\"unexpected character: %c\\n\", *s->tok);\n\t\tgoto std;\n\t }\n*/\n\ncomment:\n/*!re2c\n\t\"*/\"\t\t\t{ goto std; }\n\t\"\\n\"\n\t {\n\t\tif(cursor == s->eof) RET(EOI);\n\t\ts->tok = s->pos = cursor; s->line++;\n\t\tgoto comment;\n\t }\n any\t\t\t{ goto comment; }\n*/\n}\n\nmain(){\n Scanner in;\n int t;\n memset((char*) &in, 0, sizeof(in));\n in.fd = 0;\n while((t = scan(&in)) != EOI){\n/*\n\tprintf(\"%d\\t%.*s\\n\", t, in.cur - in.tok, in.tok);\n\tprintf(\"%d\\n\", t);\n*/\n }\n close(in.fd);\n}\n" }, { "path": "src/test/resources/samples/langs/C++/crypter.cpp", "content": "// Copyright (c) 2009-2012 The Bitcoin Developers\n// Distributed under the MIT/X11 software license, see the accompanying\n// file COPYING or http://www.opensource.org/licenses/mit-license.php.\n\n// Source - https://github.com/Bradfrogger/Marvelous/blob/master/src/crypter.cpp\n\n#include \n#include \n#include \n#include \n#ifdef WIN32\n#include \n#endif\n\n#include \"crypter.h\"\n\nbool CCrypter::SetKeyFromPassphrase(const SecureString& strKeyData, const std::vector& chSalt, const unsigned int nRounds, const unsigned int nDerivationMethod)\n{\n if (nRounds < 1 || chSalt.size() != WALLET_CRYPTO_SALT_SIZE)\n return false;\n\n int i = 0;\n if (nDerivationMethod == 0)\n i = EVP_BytesToKey(EVP_aes_256_cbc(), EVP_sha512(), &chSalt[0],\n (unsigned char *)&strKeyData[0], strKeyData.size(), nRounds, chKey, chIV);\n\n if (i != (int)WALLET_CRYPTO_KEY_SIZE)\n {\n OPENSSL_cleanse(chKey, sizeof(chKey));\n OPENSSL_cleanse(chIV, sizeof(chIV));\n return false;\n }\n\n fKeySet = true;\n return true;\n}\n\nbool CCrypter::SetKey(const CKeyingMaterial& chNewKey, const std::vector& chNewIV)\n{\n if (chNewKey.size() != WALLET_CRYPTO_KEY_SIZE || chNewIV.size() != WALLET_CRYPTO_KEY_SIZE)\n return false;\n\n memcpy(&chKey[0], &chNewKey[0], sizeof chKey);\n memcpy(&chIV[0], &chNewIV[0], sizeof chIV);\n\n fKeySet = true;\n return true;\n}\n\nbool CCrypter::Encrypt(const CKeyingMaterial& vchPlaintext, std::vector &vchCiphertext)\n{\n if (!fKeySet)\n return false;\n\n // max ciphertext len for a n bytes of plaintext is\n // n + AES_BLOCK_SIZE - 1 bytes\n int nLen = vchPlaintext.size();\n int nCLen = nLen + AES_BLOCK_SIZE, nFLen = 0;\n vchCiphertext = std::vector (nCLen);\n\n EVP_CIPHER_CTX ctx;\n\n bool fOk = true;\n\n EVP_CIPHER_CTX_init(&ctx);\n if (fOk) fOk = EVP_EncryptInit_ex(&ctx, EVP_aes_256_cbc(), NULL, chKey, chIV);\n if (fOk) fOk = EVP_EncryptUpdate(&ctx, &vchCiphertext[0], &nCLen, &vchPlaintext[0], nLen);\n if (fOk) fOk = EVP_EncryptFinal_ex(&ctx, (&vchCiphertext[0])+nCLen, &nFLen);\n EVP_CIPHER_CTX_cleanup(&ctx);\n\n if (!fOk) return false;\n\n vchCiphertext.resize(nCLen + nFLen);\n return true;\n}\n\nbool CCrypter::Decrypt(const std::vector& vchCiphertext, CKeyingMaterial& vchPlaintext)\n{\n if (!fKeySet)\n return false;\n\n // plaintext will always be equal to or lesser than length of ciphertext\n int nLen = vchCiphertext.size();\n int nPLen = nLen, nFLen = 0;\n\n vchPlaintext = CKeyingMaterial(nPLen);\n\n EVP_CIPHER_CTX ctx;\n\n bool fOk = true;\n\n EVP_CIPHER_CTX_init(&ctx);\n if (fOk) fOk = EVP_DecryptInit_ex(&ctx, EVP_aes_256_cbc(), NULL, chKey, chIV);\n if (fOk) fOk = EVP_DecryptUpdate(&ctx, &vchPlaintext[0], &nPLen, &vchCiphertext[0], nLen);\n if (fOk) fOk = EVP_DecryptFinal_ex(&ctx, (&vchPlaintext[0])+nPLen, &nFLen);\n EVP_CIPHER_CTX_cleanup(&ctx);\n\n if (!fOk) return false;\n\n vchPlaintext.resize(nPLen + nFLen);\n return true;\n}\n\n\nbool EncryptSecret(const CKeyingMaterial& vMasterKey, const CKeyingMaterial &vchPlaintext, const uint256& nIV, std::vector &vchCiphertext)\n{\n CCrypter cKeyCrypter;\n std::vector chIV(WALLET_CRYPTO_KEY_SIZE);\n memcpy(&chIV[0], &nIV, WALLET_CRYPTO_KEY_SIZE);\n if(!cKeyCrypter.SetKey(vMasterKey, chIV))\n return false;\n return cKeyCrypter.Encrypt(*((const CKeyingMaterial*)&vchPlaintext), vchCiphertext);\n}\n\nbool DecryptSecret(const CKeyingMaterial& vMasterKey, const std::vector& vchCiphertext, const uint256& nIV, CKeyingMaterial& vchPlaintext)\n{\n CCrypter cKeyCrypter;\n std::vector chIV(WALLET_CRYPTO_KEY_SIZE);\n memcpy(&chIV[0], &nIV, WALLET_CRYPTO_KEY_SIZE);\n if(!cKeyCrypter.SetKey(vMasterKey, chIV))\n return false;\n return cKeyCrypter.Decrypt(vchCiphertext, *((CKeyingMaterial*)&vchPlaintext));\n}\n" }, { "path": "src/test/resources/samples/langs/C++/cvsignore.re", "content": "\n#define YYFILL(n) if (cursor >= limit) break;\n#define YYCTYPE char\n#define YYCURSOR cursor\n#define YYLIMIT limit\n#define YYMARKER marker\n\n/*!re2c\nany = (.|\"\\n\");\nvalue\t= (\":\" (.\\\"$\")+)?;\ncvsdat\t= \"Date\";\ncvsid\t= \"Id\";\ncvslog\t= \"Log\";\ncvsrev\t= \"Revision\";\ncvssrc\t= \"Source\";\n*/\n\n#define APPEND(text) \\\n\tappend(output, outsize, text, sizeof(text) - sizeof(YYCTYPE))\n\ninline void append(YYCTYPE *output, size_t & outsize, const YYCTYPE * text, size_t len)\n{\n\tmemcpy(output + outsize, text, len);\n\toutsize += (len / sizeof(YYCTYPE));\n}\n\nvoid scan(YYCTYPE *pText, size_t *pSize, int *pbChanged)\n{\n\t// rule\n\t// scan lines\n\t// find $ in lines\n\t// compact $: .. $ to $$\n \n\tYYCTYPE *output;\n\tconst YYCTYPE *cursor, *limit, *marker;\n\n\tcursor = marker = output = *pText;\n\n\tsize_t insize = *pSize;\n\tsize_t outsize = 0;\n\n\tlimit = cursor + insize;\n\n\twhile(1) {\nloop:\n/*!re2c\n\n\"$\" cvsdat value \"$\"\t{ APPEND(L\"$\" L\"Date$\"); goto loop; }\n\"$\" cvsid value \"$\"\t{ APPEND(L\"$\" L\"Id$\"); goto loop; }\n\"$\" cvslog value \"$\"\t{ APPEND(L\"$\" L\"Log$\"); goto loop; }\n\"$\" cvsrev value \"$\"\t{ APPEND(L\"$\" L\"Revision$\"); goto loop; }\n\"$\" cvssrc value \"$\"\t{ APPEND(L\"$\" L\"Source$\"); goto loop; }\nany\t\t\t\t\t\t{ output[outsize++] = cursor[-1]; if (cursor >= limit) break; goto loop; }\n\n*/\n\t}\n\toutput[outsize] = '\\0';\n\n\t// set the new size\n\t*pSize = outsize;\n\t\n\t*pbChanged = (insize == outsize) ? 0 : 1;\n}\n" }, { "path": "src/test/resources/samples/langs/C++/env.cpp", "content": "/*\n This file is part of the PhantomJS project from Ofi Labs.\n\n Copyright (C) 2012 execjosh, http://execjosh.blogspot.com\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * 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 * Neither the name of the nor the\n names of its contributors may be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n ARE DISCLAIMED. IN NO EVENT SHALL BE LIABLE FOR ANY\n DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF\n THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*/\n\n#include \"env.h\"\n\n#include \n#include \n#include \n\nstatic Env *env_instance = (Env *)NULL;\n\nEnv *Env::instance()\n{\n if ((Env *)NULL == env_instance)\n env_instance = new Env();\n\n return env_instance;\n}\n\nEnv::Env()\n : QObject(QCoreApplication::instance())\n{\n}\n\n// public:\n\nvoid Env::parse(const char **envp)\n{\n const char **env = (const char **)NULL;\n QString envvar, name, value;\n int indexOfEquals;\n // Loop for each of the = pairs and split them into a map\n for (env = envp; *env != (const char *)NULL; env++) {\n envvar = QString(*env);\n indexOfEquals = envvar.indexOf('=');\n if (0 >= indexOfEquals) {\n // Should never happen because names cannot contain \"=\" and cannot\n // be empty. If it does happen, then just ignore this record.\n // See: http://pubs.opengroup.org/onlinepubs/009695399/basedefs/xbd_chap08.html\n continue;\n }\n // Extract name and value (if it exists) from envvar\n // NOTE:\n // QString::mid() will gracefully return an empty QString when the\n // specified position index is >= the length() of the string\n name = envvar.left(indexOfEquals);\n value = envvar.mid(indexOfEquals + 1);\n m_map.insert(name, value);\n }\n}\n\nQVariantMap Env::asVariantMap() const\n{\n return m_map;\n}\n" }, { "path": "src/test/resources/samples/langs/C++/env.h", "content": "/*\n This file is part of the PhantomJS project from Ofi Labs.\n\n Copyright (C) 2012 execjosh, http://execjosh.blogspot.com\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * 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 * Neither the name of the nor the\n names of its contributors may be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n ARE DISCLAIMED. IN NO EVENT SHALL BE LIABLE FOR ANY\n DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF\n THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*/\n\n#ifndef ENV_H\n#define ENV_H\n\n#include \n#include \n\nclass Env : public QObject\n{\n Q_OBJECT\n\npublic:\n static Env *instance();\n\n void parse(const char ** envp);\n QVariantMap asVariantMap() const;\n\nprivate:\n Env();\n\n QVariantMap m_map;\n};\n\n#endif // ENV_H\n" }, { "path": "src/test/resources/samples/langs/C++/epoll_reactor.ipp", "content": "//\n// detail/impl/epoll_reactor.ipp\n// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n//\n// Copyright (c) 2003-2013 Christopher M. Kohlhoff (chris at kohlhoff dot com)\n//\n// Distributed under the Boost Software License, Version 1.0. (See accompanying\n// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n//\n\n#ifndef BOOST_ASIO_DETAIL_IMPL_EPOLL_REACTOR_IPP\n#define BOOST_ASIO_DETAIL_IMPL_EPOLL_REACTOR_IPP\n\n#if defined(_MSC_VER) && (_MSC_VER >= 1200)\n# pragma once\n#endif // defined(_MSC_VER) && (_MSC_VER >= 1200)\n\n#include \n\n#if defined(BOOST_ASIO_HAS_EPOLL)\n\n#include \n#include \n#include \n#include \n#include \n\n#if defined(BOOST_ASIO_HAS_TIMERFD)\n# include \n#endif // defined(BOOST_ASIO_HAS_TIMERFD)\n\n#include \n\nnamespace boost {\nnamespace asio {\nnamespace detail {\n\nepoll_reactor::epoll_reactor(boost::asio::io_service& io_service)\n : boost::asio::detail::service_base(io_service),\n io_service_(use_service(io_service)),\n mutex_(),\n interrupter_(),\n epoll_fd_(do_epoll_create()),\n timer_fd_(do_timerfd_create()),\n shutdown_(false)\n{\n // Add the interrupter's descriptor to epoll.\n epoll_event ev = { 0, { 0 } };\n ev.events = EPOLLIN | EPOLLERR | EPOLLET;\n ev.data.ptr = &interrupter_;\n epoll_ctl(epoll_fd_, EPOLL_CTL_ADD, interrupter_.read_descriptor(), &ev);\n interrupter_.interrupt();\n\n // Add the timer descriptor to epoll.\n if (timer_fd_ != -1)\n {\n ev.events = EPOLLIN | EPOLLERR;\n ev.data.ptr = &timer_fd_;\n epoll_ctl(epoll_fd_, EPOLL_CTL_ADD, timer_fd_, &ev);\n }\n}\n\nepoll_reactor::~epoll_reactor()\n{\n if (epoll_fd_ != -1)\n close(epoll_fd_);\n if (timer_fd_ != -1)\n close(timer_fd_);\n}\n\nvoid epoll_reactor::shutdown_service()\n{\n mutex::scoped_lock lock(mutex_);\n shutdown_ = true;\n lock.unlock();\n\n op_queue ops;\n\n while (descriptor_state* state = registered_descriptors_.first())\n {\n for (int i = 0; i < max_ops; ++i)\n ops.push(state->op_queue_[i]);\n state->shutdown_ = true;\n registered_descriptors_.free(state);\n }\n\n timer_queues_.get_all_timers(ops);\n\n io_service_.abandon_operations(ops);\n}\n\nvoid epoll_reactor::fork_service(boost::asio::io_service::fork_event fork_ev)\n{\n if (fork_ev == boost::asio::io_service::fork_child)\n {\n if (epoll_fd_ != -1)\n ::close(epoll_fd_);\n epoll_fd_ = -1;\n epoll_fd_ = do_epoll_create();\n\n if (timer_fd_ != -1)\n ::close(timer_fd_);\n timer_fd_ = -1;\n timer_fd_ = do_timerfd_create();\n\n interrupter_.recreate();\n\n // Add the interrupter's descriptor to epoll.\n epoll_event ev = { 0, { 0 } };\n ev.events = EPOLLIN | EPOLLERR | EPOLLET;\n ev.data.ptr = &interrupter_;\n epoll_ctl(epoll_fd_, EPOLL_CTL_ADD, interrupter_.read_descriptor(), &ev);\n interrupter_.interrupt();\n\n // Add the timer descriptor to epoll.\n if (timer_fd_ != -1)\n {\n ev.events = EPOLLIN | EPOLLERR;\n ev.data.ptr = &timer_fd_;\n epoll_ctl(epoll_fd_, EPOLL_CTL_ADD, timer_fd_, &ev);\n }\n\n update_timeout();\n\n // Re-register all descriptors with epoll.\n mutex::scoped_lock descriptors_lock(registered_descriptors_mutex_);\n for (descriptor_state* state = registered_descriptors_.first();\n state != 0; state = state->next_)\n {\n ev.events = state->registered_events_;\n ev.data.ptr = state;\n int result = epoll_ctl(epoll_fd_, EPOLL_CTL_ADD, state->descriptor_, &ev);\n if (result != 0)\n {\n boost::system::error_code ec(errno,\n boost::asio::error::get_system_category());\n boost::asio::detail::throw_error(ec, \"epoll re-registration\");\n }\n }\n }\n}\n\nvoid epoll_reactor::init_task()\n{\n io_service_.init_task();\n}\n\nint epoll_reactor::register_descriptor(socket_type descriptor,\n epoll_reactor::per_descriptor_data& descriptor_data)\n{\n descriptor_data = allocate_descriptor_state();\n\n {\n mutex::scoped_lock descriptor_lock(descriptor_data->mutex_);\n\n descriptor_data->reactor_ = this;\n descriptor_data->descriptor_ = descriptor;\n descriptor_data->shutdown_ = false;\n }\n\n epoll_event ev = { 0, { 0 } };\n ev.events = EPOLLIN | EPOLLERR | EPOLLHUP | EPOLLPRI | EPOLLET;\n descriptor_data->registered_events_ = ev.events;\n ev.data.ptr = descriptor_data;\n int result = epoll_ctl(epoll_fd_, EPOLL_CTL_ADD, descriptor, &ev);\n if (result != 0)\n return errno;\n\n return 0;\n}\n\nint epoll_reactor::register_internal_descriptor(\n int op_type, socket_type descriptor,\n epoll_reactor::per_descriptor_data& descriptor_data, reactor_op* op)\n{\n descriptor_data = allocate_descriptor_state();\n\n {\n mutex::scoped_lock descriptor_lock(descriptor_data->mutex_);\n\n descriptor_data->reactor_ = this;\n descriptor_data->descriptor_ = descriptor;\n descriptor_data->shutdown_ = false;\n descriptor_data->op_queue_[op_type].push(op);\n }\n\n epoll_event ev = { 0, { 0 } };\n ev.events = EPOLLIN | EPOLLERR | EPOLLHUP | EPOLLPRI | EPOLLET;\n descriptor_data->registered_events_ = ev.events;\n ev.data.ptr = descriptor_data;\n int result = epoll_ctl(epoll_fd_, EPOLL_CTL_ADD, descriptor, &ev);\n if (result != 0)\n return errno;\n\n return 0;\n}\n\nvoid epoll_reactor::move_descriptor(socket_type,\n epoll_reactor::per_descriptor_data& target_descriptor_data,\n epoll_reactor::per_descriptor_data& source_descriptor_data)\n{\n target_descriptor_data = source_descriptor_data;\n source_descriptor_data = 0;\n}\n\nvoid epoll_reactor::start_op(int op_type, socket_type descriptor,\n epoll_reactor::per_descriptor_data& descriptor_data, reactor_op* op,\n bool is_continuation, bool allow_speculative)\n{\n if (!descriptor_data)\n {\n op->ec_ = boost::asio::error::bad_descriptor;\n post_immediate_completion(op, is_continuation);\n return;\n }\n\n mutex::scoped_lock descriptor_lock(descriptor_data->mutex_);\n\n if (descriptor_data->shutdown_)\n {\n post_immediate_completion(op, is_continuation);\n return;\n }\n\n if (descriptor_data->op_queue_[op_type].empty())\n {\n if (allow_speculative\n && (op_type != read_op\n || descriptor_data->op_queue_[except_op].empty()))\n {\n if (op->perform())\n {\n descriptor_lock.unlock();\n io_service_.post_immediate_completion(op, is_continuation);\n return;\n }\n\n if (op_type == write_op)\n {\n if ((descriptor_data->registered_events_ & EPOLLOUT) == 0)\n {\n epoll_event ev = { 0, { 0 } };\n ev.events = descriptor_data->registered_events_ | EPOLLOUT;\n ev.data.ptr = descriptor_data;\n if (epoll_ctl(epoll_fd_, EPOLL_CTL_MOD, descriptor, &ev) == 0)\n {\n descriptor_data->registered_events_ |= ev.events;\n }\n else\n {\n op->ec_ = boost::system::error_code(errno,\n boost::asio::error::get_system_category());\n io_service_.post_immediate_completion(op, is_continuation);\n return;\n }\n }\n }\n }\n else\n {\n if (op_type == write_op)\n {\n descriptor_data->registered_events_ |= EPOLLOUT;\n }\n\n epoll_event ev = { 0, { 0 } };\n ev.events = descriptor_data->registered_events_;\n ev.data.ptr = descriptor_data;\n epoll_ctl(epoll_fd_, EPOLL_CTL_MOD, descriptor, &ev);\n }\n }\n\n descriptor_data->op_queue_[op_type].push(op);\n io_service_.work_started();\n}\n\nvoid epoll_reactor::cancel_ops(socket_type,\n epoll_reactor::per_descriptor_data& descriptor_data)\n{\n if (!descriptor_data)\n return;\n\n mutex::scoped_lock descriptor_lock(descriptor_data->mutex_);\n\n op_queue ops;\n for (int i = 0; i < max_ops; ++i)\n {\n while (reactor_op* op = descriptor_data->op_queue_[i].front())\n {\n op->ec_ = boost::asio::error::operation_aborted;\n descriptor_data->op_queue_[i].pop();\n ops.push(op);\n }\n }\n\n descriptor_lock.unlock();\n\n io_service_.post_deferred_completions(ops);\n}\n\nvoid epoll_reactor::deregister_descriptor(socket_type descriptor,\n epoll_reactor::per_descriptor_data& descriptor_data, bool closing)\n{\n if (!descriptor_data)\n return;\n\n mutex::scoped_lock descriptor_lock(descriptor_data->mutex_);\n\n if (!descriptor_data->shutdown_)\n {\n if (closing)\n {\n // The descriptor will be automatically removed from the epoll set when\n // it is closed.\n }\n else\n {\n epoll_event ev = { 0, { 0 } };\n epoll_ctl(epoll_fd_, EPOLL_CTL_DEL, descriptor, &ev);\n }\n\n op_queue ops;\n for (int i = 0; i < max_ops; ++i)\n {\n while (reactor_op* op = descriptor_data->op_queue_[i].front())\n {\n op->ec_ = boost::asio::error::operation_aborted;\n descriptor_data->op_queue_[i].pop();\n ops.push(op);\n }\n }\n\n descriptor_data->descriptor_ = -1;\n descriptor_data->shutdown_ = true;\n\n descriptor_lock.unlock();\n\n free_descriptor_state(descriptor_data);\n descriptor_data = 0;\n\n io_service_.post_deferred_completions(ops);\n }\n}\n\nvoid epoll_reactor::deregister_internal_descriptor(socket_type descriptor,\n epoll_reactor::per_descriptor_data& descriptor_data)\n{\n if (!descriptor_data)\n return;\n\n mutex::scoped_lock descriptor_lock(descriptor_data->mutex_);\n\n if (!descriptor_data->shutdown_)\n {\n epoll_event ev = { 0, { 0 } };\n epoll_ctl(epoll_fd_, EPOLL_CTL_DEL, descriptor, &ev);\n\n op_queue ops;\n for (int i = 0; i < max_ops; ++i)\n ops.push(descriptor_data->op_queue_[i]);\n\n descriptor_data->descriptor_ = -1;\n descriptor_data->shutdown_ = true;\n\n descriptor_lock.unlock();\n\n free_descriptor_state(descriptor_data);\n descriptor_data = 0;\n }\n}\n\nvoid epoll_reactor::run(bool block, op_queue& ops)\n{\n // This code relies on the fact that the task_io_service queues the reactor\n // task behind all descriptor operations generated by this function. This\n // means, that by the time we reach this point, any previously returned\n // descriptor operations have already been dequeued. Therefore it is now safe\n // for us to reuse and return them for the task_io_service to queue again.\n\n // Calculate a timeout only if timerfd is not used.\n int timeout;\n if (timer_fd_ != -1)\n timeout = block ? -1 : 0;\n else\n {\n mutex::scoped_lock lock(mutex_);\n timeout = block ? get_timeout() : 0;\n }\n\n // Block on the epoll descriptor.\n epoll_event events[128];\n int num_events = epoll_wait(epoll_fd_, events, 128, timeout);\n\n#if defined(BOOST_ASIO_HAS_TIMERFD)\n bool check_timers = (timer_fd_ == -1);\n#else // defined(BOOST_ASIO_HAS_TIMERFD)\n bool check_timers = true;\n#endif // defined(BOOST_ASIO_HAS_TIMERFD)\n\n // Dispatch the waiting events.\n for (int i = 0; i < num_events; ++i)\n {\n void* ptr = events[i].data.ptr;\n if (ptr == &interrupter_)\n {\n // No need to reset the interrupter since we're leaving the descriptor\n // in a ready-to-read state and relying on edge-triggered notifications\n // to make it so that we only get woken up when the descriptor's epoll\n // registration is updated.\n\n#if defined(BOOST_ASIO_HAS_TIMERFD)\n if (timer_fd_ == -1)\n check_timers = true;\n#else // defined(BOOST_ASIO_HAS_TIMERFD)\n check_timers = true;\n#endif // defined(BOOST_ASIO_HAS_TIMERFD)\n }\n#if defined(BOOST_ASIO_HAS_TIMERFD)\n else if (ptr == &timer_fd_)\n {\n check_timers = true;\n }\n#endif // defined(BOOST_ASIO_HAS_TIMERFD)\n else\n {\n // The descriptor operation doesn't count as work in and of itself, so we\n // don't call work_started() here. This still allows the io_service to\n // stop if the only remaining operations are descriptor operations.\n descriptor_state* descriptor_data = static_cast(ptr);\n descriptor_data->set_ready_events(events[i].events);\n ops.push(descriptor_data);\n }\n }\n\n if (check_timers)\n {\n mutex::scoped_lock common_lock(mutex_);\n timer_queues_.get_ready_timers(ops);\n\n#if defined(BOOST_ASIO_HAS_TIMERFD)\n if (timer_fd_ != -1)\n {\n itimerspec new_timeout;\n itimerspec old_timeout;\n int flags = get_timeout(new_timeout);\n timerfd_settime(timer_fd_, flags, &new_timeout, &old_timeout);\n }\n#endif // defined(BOOST_ASIO_HAS_TIMERFD)\n }\n}\n\nvoid epoll_reactor::interrupt()\n{\n epoll_event ev = { 0, { 0 } };\n ev.events = EPOLLIN | EPOLLERR | EPOLLET;\n ev.data.ptr = &interrupter_;\n epoll_ctl(epoll_fd_, EPOLL_CTL_MOD, interrupter_.read_descriptor(), &ev);\n}\n\nint epoll_reactor::do_epoll_create()\n{\n#if defined(EPOLL_CLOEXEC)\n int fd = epoll_create1(EPOLL_CLOEXEC);\n#else // defined(EPOLL_CLOEXEC)\n int fd = -1;\n errno = EINVAL;\n#endif // defined(EPOLL_CLOEXEC)\n\n if (fd == -1 && (errno == EINVAL || errno == ENOSYS))\n {\n fd = epoll_create(epoll_size);\n if (fd != -1)\n ::fcntl(fd, F_SETFD, FD_CLOEXEC);\n }\n\n if (fd == -1)\n {\n boost::system::error_code ec(errno,\n boost::asio::error::get_system_category());\n boost::asio::detail::throw_error(ec, \"epoll\");\n }\n\n return fd;\n}\n\nint epoll_reactor::do_timerfd_create()\n{\n#if defined(BOOST_ASIO_HAS_TIMERFD)\n# if defined(TFD_CLOEXEC)\n int fd = timerfd_create(CLOCK_MONOTONIC, TFD_CLOEXEC);\n# else // defined(TFD_CLOEXEC)\n int fd = -1;\n errno = EINVAL;\n# endif // defined(TFD_CLOEXEC)\n\n if (fd == -1 && errno == EINVAL)\n {\n fd = timerfd_create(CLOCK_MONOTONIC, 0);\n if (fd != -1)\n ::fcntl(fd, F_SETFD, FD_CLOEXEC);\n }\n\n return fd;\n#else // defined(BOOST_ASIO_HAS_TIMERFD)\n return -1;\n#endif // defined(BOOST_ASIO_HAS_TIMERFD)\n}\n\nepoll_reactor::descriptor_state* epoll_reactor::allocate_descriptor_state()\n{\n mutex::scoped_lock descriptors_lock(registered_descriptors_mutex_);\n return registered_descriptors_.alloc();\n}\n\nvoid epoll_reactor::free_descriptor_state(epoll_reactor::descriptor_state* s)\n{\n mutex::scoped_lock descriptors_lock(registered_descriptors_mutex_);\n registered_descriptors_.free(s);\n}\n\nvoid epoll_reactor::do_add_timer_queue(timer_queue_base& queue)\n{\n mutex::scoped_lock lock(mutex_);\n timer_queues_.insert(&queue);\n}\n\nvoid epoll_reactor::do_remove_timer_queue(timer_queue_base& queue)\n{\n mutex::scoped_lock lock(mutex_);\n timer_queues_.erase(&queue);\n}\n\nvoid epoll_reactor::update_timeout()\n{\n#if defined(BOOST_ASIO_HAS_TIMERFD)\n if (timer_fd_ != -1)\n {\n itimerspec new_timeout;\n itimerspec old_timeout;\n int flags = get_timeout(new_timeout);\n timerfd_settime(timer_fd_, flags, &new_timeout, &old_timeout);\n return;\n }\n#endif // defined(BOOST_ASIO_HAS_TIMERFD)\n interrupt();\n}\n\nint epoll_reactor::get_timeout()\n{\n // By default we will wait no longer than 5 minutes. This will ensure that\n // any changes to the system clock are detected after no longer than this.\n return timer_queues_.wait_duration_msec(5 * 60 * 1000);\n}\n\n#if defined(BOOST_ASIO_HAS_TIMERFD)\nint epoll_reactor::get_timeout(itimerspec& ts)\n{\n ts.it_interval.tv_sec = 0;\n ts.it_interval.tv_nsec = 0;\n\n long usec = timer_queues_.wait_duration_usec(5 * 60 * 1000 * 1000);\n ts.it_value.tv_sec = usec / 1000000;\n ts.it_value.tv_nsec = usec ? (usec % 1000000) * 1000 : 1;\n\n return usec ? 0 : TFD_TIMER_ABSTIME;\n}\n#endif // defined(BOOST_ASIO_HAS_TIMERFD)\n\nstruct epoll_reactor::perform_io_cleanup_on_block_exit\n{\n explicit perform_io_cleanup_on_block_exit(epoll_reactor* r)\n : reactor_(r), first_op_(0)\n {\n }\n\n ~perform_io_cleanup_on_block_exit()\n {\n if (first_op_)\n {\n // Post the remaining completed operations for invocation.\n if (!ops_.empty())\n reactor_->io_service_.post_deferred_completions(ops_);\n\n // A user-initiated operation has completed, but there's no need to\n // explicitly call work_finished() here. Instead, we'll take advantage of\n // the fact that the task_io_service will call work_finished() once we\n // return.\n }\n else\n {\n // No user-initiated operations have completed, so we need to compensate\n // for the work_finished() call that the task_io_service will make once\n // this operation returns.\n reactor_->io_service_.work_started();\n }\n }\n\n epoll_reactor* reactor_;\n op_queue ops_;\n operation* first_op_;\n};\n\nepoll_reactor::descriptor_state::descriptor_state()\n : operation(&epoll_reactor::descriptor_state::do_complete)\n{\n}\n\noperation* epoll_reactor::descriptor_state::perform_io(uint32_t events)\n{\n mutex_.lock();\n perform_io_cleanup_on_block_exit io_cleanup(reactor_);\n mutex::scoped_lock descriptor_lock(mutex_, mutex::scoped_lock::adopt_lock);\n\n // Exception operations must be processed first to ensure that any\n // out-of-band data is read before normal data.\n static const int flag[max_ops] = { EPOLLIN, EPOLLOUT, EPOLLPRI };\n for (int j = max_ops - 1; j >= 0; --j)\n {\n if (events & (flag[j] | EPOLLERR | EPOLLHUP))\n {\n while (reactor_op* op = op_queue_[j].front())\n {\n if (op->perform())\n {\n op_queue_[j].pop();\n io_cleanup.ops_.push(op);\n }\n else\n break;\n }\n }\n }\n\n // The first operation will be returned for completion now. The others will\n // be posted for later by the io_cleanup object's destructor.\n io_cleanup.first_op_ = io_cleanup.ops_.front();\n io_cleanup.ops_.pop();\n return io_cleanup.first_op_;\n}\n\nvoid epoll_reactor::descriptor_state::do_complete(\n io_service_impl* owner, operation* base,\n const boost::system::error_code& ec, std::size_t bytes_transferred)\n{\n if (owner)\n {\n descriptor_state* descriptor_data = static_cast(base);\n uint32_t events = static_cast(bytes_transferred);\n if (operation* op = descriptor_data->perform_io(events))\n {\n op->complete(*owner, ec, 0);\n }\n }\n}\n\n} // namespace detail\n} // namespace asio\n} // namespace boost\n\n#include \n\n#endif // defined(BOOST_ASIO_HAS_EPOLL)\n\n#endif // BOOST_ASIO_DETAIL_IMPL_EPOLL_REACTOR_IPP\n" }, { "path": "src/test/resources/samples/langs/C++/gdsdbreader.h", "content": "#ifndef GDSDBREADER_H\r\n#define GDSDBREADER_H\r\n\r\n// This file contains core structures, classes and types for the entire gds app\r\n// WARNING: DO NOT MODIFY UNTIL IT'S STRICTLY NECESSARY\r\n\r\n#include \r\n#include \"diagramwidget/qgldiagramwidget.h\"\r\n\r\n#define GDS_DIR \"gdsdata\"\r\n\r\nenum level {LEVEL_ONE, LEVEL_TWO, LEVEL_THREE};\r\n\r\n// The internal structure of the db to store information about each node (each level)\r\n// this will be serialized before being written to file\r\nclass dbDataStructure\r\n{\r\npublic:\r\n QString label;\r\n quint32 depth;\r\n quint32 userIndex;\r\n QByteArray data; // This is COMPRESSED data, optimize ram and disk space, is decompressed\r\n // just when needed (to display the comments)\r\n\r\n // The following ID is used to create second-third level files\r\n quint64 uniqueID;\r\n // All the next items linked to this one\r\n QVector nextItems;\r\n // Corresponding indices vector (used to store data)\r\n QVector nextItemsIndices;\r\n // The father element (or NULL if it's root)\r\n dbDataStructure* father;\r\n // Corresponding indices vector (used to store data)\r\n quint32 fatherIndex;\r\n bool noFatherRoot; // Used to tell if this node is the root (so hasn't a father)\r\n\r\n // These fields will be useful for levels 2 and 3\r\n QString fileName; // Relative filename for the associated code file\r\n QByteArray firstLineData; // Compressed first line data, this will be used with the line number to retrieve info\r\n QVector linesNumbers; // First and next lines (next are relative to the first) numbers\r\n\r\n // -- Generic system data not to be stored on disk\r\n void *glPointer; // GL pointer\r\n\r\n // These operator overrides prevent the glPointer and other non-disk-necessary data serialization\r\n friend QDataStream& operator<<(QDataStream& stream, const dbDataStructure& myclass)\r\n // Notice: this function has to be \"friend\" because it cannot be a member function, member functions\r\n // have an additional parameter \"this\" which isn't in the argument list of an operator overload. A friend\r\n // function has full access to private data of the class without having the \"this\" argument\r\n {\r\n // Don't write glPointer and every pointer-dependent structure\r\n return stream << myclass.label << myclass.depth << myclass.userIndex << qCompress(myclass.data)\r\n << myclass.uniqueID << myclass.nextItemsIndices << myclass.fatherIndex << myclass.noFatherRoot\r\n << myclass.fileName << qCompress(myclass.firstLineData) << myclass.linesNumbers;\r\n }\r\n friend QDataStream& operator>>(QDataStream& stream, dbDataStructure& myclass)\r\n {\r\n //Don't read it, either\r\n stream >> myclass.label >> myclass.depth >> myclass.userIndex >> myclass.data\r\n >> myclass.uniqueID >> myclass.nextItemsIndices >> myclass.fatherIndex >> myclass.noFatherRoot\r\n >> myclass.fileName >> myclass.firstLineData >> myclass.linesNumbers;\r\n myclass.data = qUncompress(myclass.data);\r\n myclass.firstLineData = qUncompress(myclass.firstLineData);\r\n return stream;\r\n }\r\n\r\n};\r\n\r\n#endif // GDSDBREADER_H\r\n" }, { "path": "src/test/resources/samples/langs/C++/graphics.cpp", "content": "// License - https://github.com/TurtleP/Flask/blob/master/LICENSE\n\n#include \n\nint currentR = 0xFF;\nint currentG = 0xFF;\nint currentB = 0xFF;\nint currentA = 0xFF;\n\nint currentScreen = GFX_BOTTOM;\n\nfloat transX = 0;\nfloat transY = 0;\nbool isPushed = false;\n\nu32 getCurrentColor() \n{\n\treturn RGBA8(currentR, currentG, currentB, currentA);\n}\n\nvoid setColor(int r, int g, int b)\n{\n\tcurrentR = r;\n\tcurrentG = g;\n\tcurrentB = b;\n\tcurrentA = currentA;\n}\n\nvoid setColor(int r, int g, int b, int a)\n{\n\tcurrentR = r;\n\tcurrentG = g;\n\tcurrentB = b;\n\tcurrentA = a;\n}\n\nvoid setScreen(int screen)\n{\n\tcurrentScreen = screen;\n}\n\nint getCurrentScreen()\n{\n\treturn currentScreen;\n}\n\nvoid screenShot() //for showing stuff being done\n{\n\tFILE * topScreen = fopen(\"sdmc:/framebuffer_top.rgb\", \"w+\");\n\n\tfwrite(gfxGetFramebuffer(GFX_TOP, GFX_LEFT, NULL, NULL), 288000, 1, topScreen);\n\n\tfclose(topScreen);\n\n\tFILE * bottomScreen = fopen(\"sdmc:/framebuffer_bottom.rgb\", \"w+\");;\n\n\tfwrite(gfxGetFramebuffer(GFX_BOTTOM, GFX_LEFT, NULL, NULL), 230400, 1, bottomScreen);\n\n\tfclose(bottomScreen);\n}\n\nvoid translateCoords(float * x, float * y) {\n\tif (isPushed) \n\t{\n\t\t*x += transX;\n\t\t*y += transY;\n\t}\n}\n\nvoid translate(float dx, float dy)\n{\n\tif (sf2d_get_current_screen() == getCurrentScreen()) \n\t{\n\t\ttransX = transX + dx;\n\t\ttransY = transY + dy;\n\t}\n}\n\nvoid push()\n{\n\tif (sf2d_get_current_screen() == getCurrentScreen()) \n\t{\n\t\tisPushed = true;\n\t}\n}\n\nvoid pop()\n{\n\tif (sf2d_get_current_screen() == getCurrentScreen()) \n\t{\n\t\ttransX = 0;\n\t\ttransY = 0;\n\t\tisPushed = false;\n\t}\n}\n\nvoid setScissor(u32 x, u32 y, u32 width, u32 height)\n{\n\tif (sf2d_get_current_screen() == getCurrentScreen()) \n\t{\n\t\tGPU_SCISSORMODE mode = GPU_SCISSOR_NORMAL;\n\n\t\tif (!x && !y && !width && !height) {\n\t\t\tmode = GPU_SCISSOR_DISABLE;\n\t\t}\n\n\t\tsf2d_set_scissor_test(mode, x, y, width, height);\n\t}\n}" }, { "path": "src/test/resources/samples/langs/C++/grpc.pb.cc", "content": "// Generated by the gRPC protobuf plugin.\n// If you make any local change, they will be lost.\n" }, { "path": "src/test/resources/samples/langs/C++/hello.cpp", "content": "#include \n\nusing namespace std;\n\nint main()\n{\n cout << \"Hello World\" << endl;\n}\n" }, { "path": "src/test/resources/samples/langs/C++/hello.grpc.pb.h", "content": "// Generated by the gRPC C++ plugin.\n// If you make any local change, they will be lost.\n// source: hello.proto\n#ifndef GRPC_hello_2eproto__INCLUDED\n#define GRPC_hello_2eproto__INCLUDED\n\n#include \"hello.pb.h\"\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nnamespace grpc {\nclass CompletionQueue;\nclass Channel;\nclass RpcService;\nclass ServerCompletionQueue;\nclass ServerContext;\n} // namespace grpc\n\nclass HelloService final {\n public:\n class StubInterface {\n public:\n virtual ~StubInterface() {}\n virtual ::grpc::Status SayHello(::grpc::ClientContext* context, const ::HelloRequest& request, ::HelloResponse* response) = 0;\n std::unique_ptr< ::grpc::ClientAsyncResponseReaderInterface< ::HelloResponse>> AsyncSayHello(::grpc::ClientContext* context, const ::HelloRequest& request, ::grpc::CompletionQueue* cq) {\n return std::unique_ptr< ::grpc::ClientAsyncResponseReaderInterface< ::HelloResponse>>(AsyncSayHelloRaw(context, request, cq));\n }\n private:\n virtual ::grpc::ClientAsyncResponseReaderInterface< ::HelloResponse>* AsyncSayHelloRaw(::grpc::ClientContext* context, const ::HelloRequest& request, ::grpc::CompletionQueue* cq) = 0;\n };\n class Stub final : public StubInterface {\n public:\n Stub(const std::shared_ptr< ::grpc::ChannelInterface>& channel);\n ::grpc::Status SayHello(::grpc::ClientContext* context, const ::HelloRequest& request, ::HelloResponse* response) override;\n std::unique_ptr< ::grpc::ClientAsyncResponseReader< ::HelloResponse>> AsyncSayHello(::grpc::ClientContext* context, const ::HelloRequest& request, ::grpc::CompletionQueue* cq) {\n return std::unique_ptr< ::grpc::ClientAsyncResponseReader< ::HelloResponse>>(AsyncSayHelloRaw(context, request, cq));\n }\n\n private:\n std::shared_ptr< ::grpc::ChannelInterface> channel_;\n ::grpc::ClientAsyncResponseReader< ::HelloResponse>* AsyncSayHelloRaw(::grpc::ClientContext* context, const ::HelloRequest& request, ::grpc::CompletionQueue* cq) override;\n const ::grpc::RpcMethod rpcmethod_SayHello_;\n };\n static std::unique_ptr NewStub(const std::shared_ptr< ::grpc::ChannelInterface>& channel, const ::grpc::StubOptions& options = ::grpc::StubOptions());\n\n class Service : public ::grpc::Service {\n public:\n Service();\n virtual ~Service();\n virtual ::grpc::Status SayHello(::grpc::ServerContext* context, const ::HelloRequest* request, ::HelloResponse* response);\n };\n template \n class WithAsyncMethod_SayHello : public BaseClass {\n private:\n void BaseClassMustBeDerivedFromService(const Service *service) {}\n public:\n WithAsyncMethod_SayHello() {\n ::grpc::Service::MarkMethodAsync(0);\n }\n ~WithAsyncMethod_SayHello() override {\n BaseClassMustBeDerivedFromService(this);\n }\n // disable synchronous version of this method\n ::grpc::Status SayHello(::grpc::ServerContext* context, const ::HelloRequest* request, ::HelloResponse* response) final override {\n abort();\n return ::grpc::Status(::grpc::StatusCode::UNIMPLEMENTED, \"\");\n }\n void RequestSayHello(::grpc::ServerContext* context, ::HelloRequest* request, ::grpc::ServerAsyncResponseWriter< ::HelloResponse>* response, ::grpc::CompletionQueue* new_call_cq, ::grpc::ServerCompletionQueue* notification_cq, void *tag) {\n ::grpc::Service::RequestAsyncUnary(0, context, request, response, new_call_cq, notification_cq, tag);\n }\n };\n typedef WithAsyncMethod_SayHello AsyncService;\n template \n class WithGenericMethod_SayHello : public BaseClass {\n private:\n void BaseClassMustBeDerivedFromService(const Service *service) {}\n public:\n WithGenericMethod_SayHello() {\n ::grpc::Service::MarkMethodGeneric(0);\n }\n ~WithGenericMethod_SayHello() override {\n BaseClassMustBeDerivedFromService(this);\n }\n // disable synchronous version of this method\n ::grpc::Status SayHello(::grpc::ServerContext* context, const ::HelloRequest* request, ::HelloResponse* response) final override {\n abort();\n return ::grpc::Status(::grpc::StatusCode::UNIMPLEMENTED, \"\");\n }\n };\n template \n class WithStreamedUnaryMethod_SayHello : public BaseClass {\n private:\n void BaseClassMustBeDerivedFromService(const Service *service) {}\n public:\n WithStreamedUnaryMethod_SayHello() {\n ::grpc::Service::MarkMethodStreamed(0,\n new ::grpc::StreamedUnaryHandler< ::HelloRequest, ::HelloResponse>(std::bind(&WithStreamedUnaryMethod_SayHello::StreamedSayHello, this, std::placeholders::_1, std::placeholders::_2)));\n }\n ~WithStreamedUnaryMethod_SayHello() override {\n BaseClassMustBeDerivedFromService(this);\n }\n // disable regular version of this method\n ::grpc::Status SayHello(::grpc::ServerContext* context, const ::HelloRequest* request, ::HelloResponse* response) final override {\n abort();\n return ::grpc::Status(::grpc::StatusCode::UNIMPLEMENTED, \"\");\n }\n // replace default version of method with streamed unary\n virtual ::grpc::Status StreamedSayHello(::grpc::ServerContext* context, ::grpc::ServerUnaryStreamer< ::HelloRequest,::HelloResponse>* server_unary_streamer) = 0;\n };\n typedef WithStreamedUnaryMethod_SayHello StreamedUnaryService;\n typedef Service SplitStreamedService;\n typedef WithStreamedUnaryMethod_SayHello StreamedService;\n};\n\n\n#endif // GRPC_hello_2eproto__INCLUDED\n\n" }, { "path": "src/test/resources/samples/langs/C++/hello.ino", "content": "void setup() {\n Serial.begin(9600);\n}\n\nvoid loop() {\n Serial.print(\"Hello\");\n}\n" }, { "path": "src/test/resources/samples/langs/C++/initClasses.inc", "content": "// start\n// define cpp macros: SET_SYMBOL, CREATE_CLASS, SET_CLASS, DEFINE_BASE_CLASSES, DEFINE_CLASS_NAMES, EXPOSE_TO_CANDO \n// define cpp macro: ALL_STAGES to get the effect of defining all of the macros above\n// define cpp macro: EXPOSE_PYTHON to expose python\n// Associating namespace(llvmo) with package(LlvmoPkg)\n // class DebugLoc_O : public core::T_O\n // class InsertPoint_O : public core::T_O\n // class LLVMContext_O : public core::ExternalObject_O\n // class Pass_O : public core::ExternalObject_O\n // class FunctionPass_O : public Pass_O\n // class ModulePass_O : public Pass_O\n // class ImmutablePass_O : public ModulePass_O\n // class PassManagerBase_O : public core::ExternalObject_O\n // class Value_O : public core::ExternalObject_O\n // class User_O : public Value_O\n // class LLVMContext_O : public core::ExternalObject_O\n // class Pass_O : public core::ExternalObject_O\n // class FunctionPass_O : public Pass_O\n // class ModulePass_O : public Pass_O\n // class ImmutablePass_O : public ModulePass_O\n // class PassManagerBase_O : public core::ExternalObject_O\n // class Value_O : public core::ExternalObject_O\n // class User_O : public Value_O\n // class Attribute_O : public core::T_O\n // class DataLayout_O : public ImmutablePass_O\n // class Constant_O : public User_O\n // class ConstantArray_O : public Constant_O\n // class ConstantDataSequential_O : public Constant_O\n // class ConstantDataArray_O : public ConstantDataSequential_O\n // class ConstantExpr_O : public Constant_O\n // class GlobalValue_O : public Constant_O\n // class GlobalVariable_O : public GlobalValue_O\n // class ExecutionEngine_O : public core::ExternalObject_O\n // class Module_O : public core::ExternalObject_O\n // class FunctionPassManager_O : public PassManagerBase_O\n // class EngineBuilder_O : public core::ExternalObject_O\n // class APFloat_O : public core::ExternalObject_O\n // class APInt_O : public core::ExternalObject_O\n // class IRBuilderBase_O : public core::ExternalObject_O\n // class IRBuilder_O : public IRBuilderBase_O\n // class Instruction_O : public User_O\n // class StoreInst_O : public Instruction_O\n // class FenceInst_O : public Instruction_O\n // class AtomicCmpXchgInst_O : public Instruction_O\n // class AtomicRMWInst_O : public Instruction_O\n // class PHINode_O : public Instruction_O\n // class CallInst_O : public Instruction_O\n // class LandingPadInst_O : public Instruction_O\n // class UnaryInstruction_O : public Instruction_O\n // class AllocaInst_O : public UnaryInstruction_O\n // class VAArgInst_O : public UnaryInstruction_O\n // class LoadInst_O : public UnaryInstruction_O\n // class TerminatorInst_O : public Instruction_O\n // class BranchInst_O : public TerminatorInst_O\n // class SwitchInst_O : public TerminatorInst_O\n // class IndirectBrInst_O : public TerminatorInst_O\n // class InvokeInst_O : public TerminatorInst_O\n // class ResumeInst_O : public TerminatorInst_O\n // class UnreachableInst_O : public TerminatorInst_O\n // class ReturnInst_O : public TerminatorInst_O\n // class ConstantFP_O : public Constant_O\n // class ConstantInt_O : public Constant_O\n // class UndefValue_O : public Constant_O\n // class ConstantPointerNull_O : public Constant_O\n // class MDNode_O : public Value_O\n // class MDString_O : public Value_O\n // class Function_O : public GlobalValue_O\n // class BasicBlock_O : public Value_O\n // class Argument_O : public Value_O\n // class Type_O : public core::ExternalObject_O\n // class FunctionType_O : public Type_O\n // class IntegerType_O : public Type_O\n // class CompositeType_O : public Type_O\n // class StructType_O : public CompositeType_O\n // class SequentialType_O : public CompositeType_O\n // class PointerType_O : public SequentialType_O\n // class ArrayType_O : public SequentialType_O\n // class VectorType_O : public SequentialType_O\n // class LLVMContext_O : public core::ExternalObject_O\n // class Module_O : public core::ExternalObject_O\n // class Builder_O : public core::ExternalObject_O\n // class APFloat_O : public core::ExternalObject_O\n // class Value_O : public core::ExternalObject_O\n // class User_O : public Value_O\n // class Constant_O : public User_O\n // class ConstantFP_O : public Constant_O\n// Associating namespace(llvmo) with package(LlvmoPkg)\n#ifdef HEADER_INCLUDES\n#include \"llvmoExpose.h\"\n#include \"llvmoExpose.scrape_inc.h\"\n#include \"debugLoc.h\"\n#include \"insertPoint.h\"\n#include \"llvmoExpose.generated.h\"\n#endif // HEADER_INCLUDES\n#undef HEADER_INCLUDES\n#if defined(SET_SYMBOL) || defined(ALL_STAGES)\n// requires LOOKUP_SYMBOL(pkg,symbolName) be defined\nllvmo::APFloat_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::APFloat_O::static_packageName(),llvmo::APFloat_O::static_className()));\nllvmo::APInt_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::APInt_O::static_packageName(),llvmo::APInt_O::static_className()));\nllvmo::Attribute_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::Attribute_O::static_packageName(),llvmo::Attribute_O::static_className()));\nllvmo::Builder_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::Builder_O::static_packageName(),llvmo::Builder_O::static_className()));\nllvmo::DebugLoc_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::DebugLoc_O::static_packageName(),llvmo::DebugLoc_O::static_className()));\nllvmo::EngineBuilder_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::EngineBuilder_O::static_packageName(),llvmo::EngineBuilder_O::static_className()));\nllvmo::ExecutionEngine_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::ExecutionEngine_O::static_packageName(),llvmo::ExecutionEngine_O::static_className()));\nllvmo::IRBuilderBase_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::IRBuilderBase_O::static_packageName(),llvmo::IRBuilderBase_O::static_className()));\nllvmo::InsertPoint_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::InsertPoint_O::static_packageName(),llvmo::InsertPoint_O::static_className()));\nllvmo::LLVMContext_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::LLVMContext_O::static_packageName(),llvmo::LLVMContext_O::static_className()));\nllvmo::Module_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::Module_O::static_packageName(),llvmo::Module_O::static_className()));\nllvmo::PassManagerBase_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::PassManagerBase_O::static_packageName(),llvmo::PassManagerBase_O::static_className()));\nllvmo::Pass_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::Pass_O::static_packageName(),llvmo::Pass_O::static_className()));\nllvmo::Type_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::Type_O::static_packageName(),llvmo::Type_O::static_className()));\nllvmo::Value_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::Value_O::static_packageName(),llvmo::Value_O::static_className()));\nllvmo::Argument_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::Argument_O::static_packageName(),llvmo::Argument_O::static_className()));\nllvmo::BasicBlock_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::BasicBlock_O::static_packageName(),llvmo::BasicBlock_O::static_className()));\nllvmo::CompositeType_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::CompositeType_O::static_packageName(),llvmo::CompositeType_O::static_className()));\nllvmo::FunctionPassManager_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::FunctionPassManager_O::static_packageName(),llvmo::FunctionPassManager_O::static_className()));\nllvmo::FunctionPass_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::FunctionPass_O::static_packageName(),llvmo::FunctionPass_O::static_className()));\nllvmo::FunctionType_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::FunctionType_O::static_packageName(),llvmo::FunctionType_O::static_className()));\nllvmo::IRBuilder_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::IRBuilder_O::static_packageName(),llvmo::IRBuilder_O::static_className()));\nllvmo::IntegerType_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::IntegerType_O::static_packageName(),llvmo::IntegerType_O::static_className()));\nllvmo::MDNode_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::MDNode_O::static_packageName(),llvmo::MDNode_O::static_className()));\nllvmo::MDString_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::MDString_O::static_packageName(),llvmo::MDString_O::static_className()));\nllvmo::ModulePass_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::ModulePass_O::static_packageName(),llvmo::ModulePass_O::static_className()));\nllvmo::User_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::User_O::static_packageName(),llvmo::User_O::static_className()));\nllvmo::Constant_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::Constant_O::static_packageName(),llvmo::Constant_O::static_className()));\nllvmo::ImmutablePass_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::ImmutablePass_O::static_packageName(),llvmo::ImmutablePass_O::static_className()));\nllvmo::Instruction_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::Instruction_O::static_packageName(),llvmo::Instruction_O::static_className()));\nllvmo::SequentialType_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::SequentialType_O::static_packageName(),llvmo::SequentialType_O::static_className()));\nllvmo::StructType_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::StructType_O::static_packageName(),llvmo::StructType_O::static_className()));\nllvmo::ArrayType_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::ArrayType_O::static_packageName(),llvmo::ArrayType_O::static_className()));\nllvmo::AtomicCmpXchgInst_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::AtomicCmpXchgInst_O::static_packageName(),llvmo::AtomicCmpXchgInst_O::static_className()));\nllvmo::AtomicRMWInst_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::AtomicRMWInst_O::static_packageName(),llvmo::AtomicRMWInst_O::static_className()));\nllvmo::CallInst_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::CallInst_O::static_packageName(),llvmo::CallInst_O::static_className()));\nllvmo::ConstantArray_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::ConstantArray_O::static_packageName(),llvmo::ConstantArray_O::static_className()));\nllvmo::ConstantDataSequential_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::ConstantDataSequential_O::static_packageName(),llvmo::ConstantDataSequential_O::static_className()));\nllvmo::ConstantExpr_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::ConstantExpr_O::static_packageName(),llvmo::ConstantExpr_O::static_className()));\nllvmo::ConstantFP_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::ConstantFP_O::static_packageName(),llvmo::ConstantFP_O::static_className()));\nllvmo::ConstantInt_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::ConstantInt_O::static_packageName(),llvmo::ConstantInt_O::static_className()));\nllvmo::ConstantPointerNull_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::ConstantPointerNull_O::static_packageName(),llvmo::ConstantPointerNull_O::static_className()));\nllvmo::DataLayout_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::DataLayout_O::static_packageName(),llvmo::DataLayout_O::static_className()));\nllvmo::FenceInst_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::FenceInst_O::static_packageName(),llvmo::FenceInst_O::static_className()));\nllvmo::GlobalValue_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::GlobalValue_O::static_packageName(),llvmo::GlobalValue_O::static_className()));\nllvmo::LandingPadInst_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::LandingPadInst_O::static_packageName(),llvmo::LandingPadInst_O::static_className()));\nllvmo::PHINode_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::PHINode_O::static_packageName(),llvmo::PHINode_O::static_className()));\nllvmo::PointerType_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::PointerType_O::static_packageName(),llvmo::PointerType_O::static_className()));\nllvmo::StoreInst_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::StoreInst_O::static_packageName(),llvmo::StoreInst_O::static_className()));\nllvmo::TerminatorInst_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::TerminatorInst_O::static_packageName(),llvmo::TerminatorInst_O::static_className()));\nllvmo::UnaryInstruction_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::UnaryInstruction_O::static_packageName(),llvmo::UnaryInstruction_O::static_className()));\nllvmo::UndefValue_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::UndefValue_O::static_packageName(),llvmo::UndefValue_O::static_className()));\nllvmo::VectorType_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::VectorType_O::static_packageName(),llvmo::VectorType_O::static_className()));\nllvmo::AllocaInst_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::AllocaInst_O::static_packageName(),llvmo::AllocaInst_O::static_className()));\nllvmo::BranchInst_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::BranchInst_O::static_packageName(),llvmo::BranchInst_O::static_className()));\nllvmo::ConstantDataArray_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::ConstantDataArray_O::static_packageName(),llvmo::ConstantDataArray_O::static_className()));\nllvmo::Function_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::Function_O::static_packageName(),llvmo::Function_O::static_className()));\nllvmo::GlobalVariable_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::GlobalVariable_O::static_packageName(),llvmo::GlobalVariable_O::static_className()));\nllvmo::IndirectBrInst_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::IndirectBrInst_O::static_packageName(),llvmo::IndirectBrInst_O::static_className()));\nllvmo::InvokeInst_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::InvokeInst_O::static_packageName(),llvmo::InvokeInst_O::static_className()));\nllvmo::LoadInst_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::LoadInst_O::static_packageName(),llvmo::LoadInst_O::static_className()));\nllvmo::ResumeInst_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::ResumeInst_O::static_packageName(),llvmo::ResumeInst_O::static_className()));\nllvmo::ReturnInst_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::ReturnInst_O::static_packageName(),llvmo::ReturnInst_O::static_className()));\nllvmo::SwitchInst_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::SwitchInst_O::static_packageName(),llvmo::SwitchInst_O::static_className()));\nllvmo::UnreachableInst_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::UnreachableInst_O::static_packageName(),llvmo::UnreachableInst_O::static_className()));\nllvmo::VAArgInst_O::___set_static_ClassSymbol(LOOKUP_SYMBOL(llvmo::VAArgInst_O::static_packageName(),llvmo::VAArgInst_O::static_className()));\n#endif // SET_SYMBOL\n#undef SET_SYMBOL\n#if defined(CREATE_CLASS) || defined(ALL_STAGES)\n// Depends on undefinedMetaClass\n core::MetaClass_sp undefinedMetaClass; undefinedMetaClass.reset();\n\n LOG(BF(\"Creating class[classllvmo__APFloat_Oval]\"));\n core::BuiltInClass_sp classllvmo__APFloat_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__APFloat_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__APFloat_Oval,_lisp,llvmo::APFloat_O::static_classSymbol());\n llvmo::APFloat_O::___staticMetaClass = classllvmo__APFloat_Oval;\n _lisp->setf_findClass(llvmo::APFloat_O::static_classSymbol(),classllvmo__APFloat_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::APFloat_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::APFloat_O::static_className() % (void*)(llvmo::APFloat_O::static_newNil_callback()) );\n classllvmo__APFloat_Oval->setInstance_newNil_callback(llvmo::APFloat_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::APFloat_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::APFloat_O::static_className() );\n llvmo::APFloat_O::_nil = nil_for_class;\n classllvmo__APFloat_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__APFloat_Oval->setSupportsSlots(llvmo::APFloat_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__APInt_Oval]\"));\n core::BuiltInClass_sp classllvmo__APInt_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__APInt_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__APInt_Oval,_lisp,llvmo::APInt_O::static_classSymbol());\n llvmo::APInt_O::___staticMetaClass = classllvmo__APInt_Oval;\n _lisp->setf_findClass(llvmo::APInt_O::static_classSymbol(),classllvmo__APInt_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::APInt_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::APInt_O::static_className() % (void*)(llvmo::APInt_O::static_newNil_callback()) );\n classllvmo__APInt_Oval->setInstance_newNil_callback(llvmo::APInt_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::APInt_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::APInt_O::static_className() );\n llvmo::APInt_O::_nil = nil_for_class;\n classllvmo__APInt_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__APInt_Oval->setSupportsSlots(llvmo::APInt_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__Attribute_Oval]\"));\n core::BuiltInClass_sp classllvmo__Attribute_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__Attribute_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__Attribute_Oval,_lisp,llvmo::Attribute_O::static_classSymbol());\n llvmo::Attribute_O::___staticMetaClass = classllvmo__Attribute_Oval;\n _lisp->setf_findClass(llvmo::Attribute_O::static_classSymbol(),classllvmo__Attribute_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::Attribute_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::Attribute_O::static_className() % (void*)(llvmo::Attribute_O::static_newNil_callback()) );\n classllvmo__Attribute_Oval->setInstance_newNil_callback(llvmo::Attribute_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::Attribute_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::Attribute_O::static_className() );\n llvmo::Attribute_O::_nil = nil_for_class;\n classllvmo__Attribute_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__Attribute_Oval->setSupportsSlots(llvmo::Attribute_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__Builder_Oval]\"));\n core::BuiltInClass_sp classllvmo__Builder_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__Builder_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__Builder_Oval,_lisp,llvmo::Builder_O::static_classSymbol());\n llvmo::Builder_O::___staticMetaClass = classllvmo__Builder_Oval;\n _lisp->setf_findClass(llvmo::Builder_O::static_classSymbol(),classllvmo__Builder_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::Builder_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::Builder_O::static_className() % (void*)(llvmo::Builder_O::static_newNil_callback()) );\n classllvmo__Builder_Oval->setInstance_newNil_callback(llvmo::Builder_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::Builder_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::Builder_O::static_className() );\n llvmo::Builder_O::_nil = nil_for_class;\n classllvmo__Builder_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__Builder_Oval->setSupportsSlots(llvmo::Builder_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__DebugLoc_Oval]\"));\n core::BuiltInClass_sp classllvmo__DebugLoc_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__DebugLoc_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__DebugLoc_Oval,_lisp,llvmo::DebugLoc_O::static_classSymbol());\n llvmo::DebugLoc_O::___staticMetaClass = classllvmo__DebugLoc_Oval;\n _lisp->setf_findClass(llvmo::DebugLoc_O::static_classSymbol(),classllvmo__DebugLoc_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::DebugLoc_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::DebugLoc_O::static_className() % (void*)(llvmo::DebugLoc_O::static_newNil_callback()) );\n classllvmo__DebugLoc_Oval->setInstance_newNil_callback(llvmo::DebugLoc_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::DebugLoc_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::DebugLoc_O::static_className() );\n llvmo::DebugLoc_O::_nil = nil_for_class;\n classllvmo__DebugLoc_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__DebugLoc_Oval->setSupportsSlots(llvmo::DebugLoc_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__EngineBuilder_Oval]\"));\n core::BuiltInClass_sp classllvmo__EngineBuilder_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__EngineBuilder_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__EngineBuilder_Oval,_lisp,llvmo::EngineBuilder_O::static_classSymbol());\n llvmo::EngineBuilder_O::___staticMetaClass = classllvmo__EngineBuilder_Oval;\n _lisp->setf_findClass(llvmo::EngineBuilder_O::static_classSymbol(),classllvmo__EngineBuilder_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::EngineBuilder_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::EngineBuilder_O::static_className() % (void*)(llvmo::EngineBuilder_O::static_newNil_callback()) );\n classllvmo__EngineBuilder_Oval->setInstance_newNil_callback(llvmo::EngineBuilder_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::EngineBuilder_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::EngineBuilder_O::static_className() );\n llvmo::EngineBuilder_O::_nil = nil_for_class;\n classllvmo__EngineBuilder_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__EngineBuilder_Oval->setSupportsSlots(llvmo::EngineBuilder_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__ExecutionEngine_Oval]\"));\n core::BuiltInClass_sp classllvmo__ExecutionEngine_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__ExecutionEngine_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__ExecutionEngine_Oval,_lisp,llvmo::ExecutionEngine_O::static_classSymbol());\n llvmo::ExecutionEngine_O::___staticMetaClass = classllvmo__ExecutionEngine_Oval;\n _lisp->setf_findClass(llvmo::ExecutionEngine_O::static_classSymbol(),classllvmo__ExecutionEngine_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::ExecutionEngine_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::ExecutionEngine_O::static_className() % (void*)(llvmo::ExecutionEngine_O::static_newNil_callback()) );\n classllvmo__ExecutionEngine_Oval->setInstance_newNil_callback(llvmo::ExecutionEngine_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::ExecutionEngine_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::ExecutionEngine_O::static_className() );\n llvmo::ExecutionEngine_O::_nil = nil_for_class;\n classllvmo__ExecutionEngine_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__ExecutionEngine_Oval->setSupportsSlots(llvmo::ExecutionEngine_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__IRBuilderBase_Oval]\"));\n core::BuiltInClass_sp classllvmo__IRBuilderBase_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__IRBuilderBase_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__IRBuilderBase_Oval,_lisp,llvmo::IRBuilderBase_O::static_classSymbol());\n llvmo::IRBuilderBase_O::___staticMetaClass = classllvmo__IRBuilderBase_Oval;\n _lisp->setf_findClass(llvmo::IRBuilderBase_O::static_classSymbol(),classllvmo__IRBuilderBase_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::IRBuilderBase_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::IRBuilderBase_O::static_className() % (void*)(llvmo::IRBuilderBase_O::static_newNil_callback()) );\n classllvmo__IRBuilderBase_Oval->setInstance_newNil_callback(llvmo::IRBuilderBase_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::IRBuilderBase_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::IRBuilderBase_O::static_className() );\n llvmo::IRBuilderBase_O::_nil = nil_for_class;\n classllvmo__IRBuilderBase_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__IRBuilderBase_Oval->setSupportsSlots(llvmo::IRBuilderBase_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__InsertPoint_Oval]\"));\n core::BuiltInClass_sp classllvmo__InsertPoint_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__InsertPoint_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__InsertPoint_Oval,_lisp,llvmo::InsertPoint_O::static_classSymbol());\n llvmo::InsertPoint_O::___staticMetaClass = classllvmo__InsertPoint_Oval;\n _lisp->setf_findClass(llvmo::InsertPoint_O::static_classSymbol(),classllvmo__InsertPoint_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::InsertPoint_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::InsertPoint_O::static_className() % (void*)(llvmo::InsertPoint_O::static_newNil_callback()) );\n classllvmo__InsertPoint_Oval->setInstance_newNil_callback(llvmo::InsertPoint_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::InsertPoint_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::InsertPoint_O::static_className() );\n llvmo::InsertPoint_O::_nil = nil_for_class;\n classllvmo__InsertPoint_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__InsertPoint_Oval->setSupportsSlots(llvmo::InsertPoint_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__LLVMContext_Oval]\"));\n core::BuiltInClass_sp classllvmo__LLVMContext_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__LLVMContext_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__LLVMContext_Oval,_lisp,llvmo::LLVMContext_O::static_classSymbol());\n llvmo::LLVMContext_O::___staticMetaClass = classllvmo__LLVMContext_Oval;\n _lisp->setf_findClass(llvmo::LLVMContext_O::static_classSymbol(),classllvmo__LLVMContext_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::LLVMContext_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::LLVMContext_O::static_className() % (void*)(llvmo::LLVMContext_O::static_newNil_callback()) );\n classllvmo__LLVMContext_Oval->setInstance_newNil_callback(llvmo::LLVMContext_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::LLVMContext_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::LLVMContext_O::static_className() );\n llvmo::LLVMContext_O::_nil = nil_for_class;\n classllvmo__LLVMContext_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__LLVMContext_Oval->setSupportsSlots(llvmo::LLVMContext_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__Module_Oval]\"));\n core::BuiltInClass_sp classllvmo__Module_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__Module_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__Module_Oval,_lisp,llvmo::Module_O::static_classSymbol());\n llvmo::Module_O::___staticMetaClass = classllvmo__Module_Oval;\n _lisp->setf_findClass(llvmo::Module_O::static_classSymbol(),classllvmo__Module_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::Module_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::Module_O::static_className() % (void*)(llvmo::Module_O::static_newNil_callback()) );\n classllvmo__Module_Oval->setInstance_newNil_callback(llvmo::Module_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::Module_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::Module_O::static_className() );\n llvmo::Module_O::_nil = nil_for_class;\n classllvmo__Module_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__Module_Oval->setSupportsSlots(llvmo::Module_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__PassManagerBase_Oval]\"));\n core::BuiltInClass_sp classllvmo__PassManagerBase_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__PassManagerBase_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__PassManagerBase_Oval,_lisp,llvmo::PassManagerBase_O::static_classSymbol());\n llvmo::PassManagerBase_O::___staticMetaClass = classllvmo__PassManagerBase_Oval;\n _lisp->setf_findClass(llvmo::PassManagerBase_O::static_classSymbol(),classllvmo__PassManagerBase_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::PassManagerBase_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::PassManagerBase_O::static_className() % (void*)(llvmo::PassManagerBase_O::static_newNil_callback()) );\n classllvmo__PassManagerBase_Oval->setInstance_newNil_callback(llvmo::PassManagerBase_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::PassManagerBase_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::PassManagerBase_O::static_className() );\n llvmo::PassManagerBase_O::_nil = nil_for_class;\n classllvmo__PassManagerBase_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__PassManagerBase_Oval->setSupportsSlots(llvmo::PassManagerBase_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__Pass_Oval]\"));\n core::BuiltInClass_sp classllvmo__Pass_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__Pass_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__Pass_Oval,_lisp,llvmo::Pass_O::static_classSymbol());\n llvmo::Pass_O::___staticMetaClass = classllvmo__Pass_Oval;\n _lisp->setf_findClass(llvmo::Pass_O::static_classSymbol(),classllvmo__Pass_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::Pass_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::Pass_O::static_className() % (void*)(llvmo::Pass_O::static_newNil_callback()) );\n classllvmo__Pass_Oval->setInstance_newNil_callback(llvmo::Pass_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::Pass_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::Pass_O::static_className() );\n llvmo::Pass_O::_nil = nil_for_class;\n classllvmo__Pass_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__Pass_Oval->setSupportsSlots(llvmo::Pass_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__Type_Oval]\"));\n core::BuiltInClass_sp classllvmo__Type_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__Type_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__Type_Oval,_lisp,llvmo::Type_O::static_classSymbol());\n llvmo::Type_O::___staticMetaClass = classllvmo__Type_Oval;\n _lisp->setf_findClass(llvmo::Type_O::static_classSymbol(),classllvmo__Type_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::Type_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::Type_O::static_className() % (void*)(llvmo::Type_O::static_newNil_callback()) );\n classllvmo__Type_Oval->setInstance_newNil_callback(llvmo::Type_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::Type_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::Type_O::static_className() );\n llvmo::Type_O::_nil = nil_for_class;\n classllvmo__Type_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__Type_Oval->setSupportsSlots(llvmo::Type_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__Value_Oval]\"));\n core::BuiltInClass_sp classllvmo__Value_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__Value_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__Value_Oval,_lisp,llvmo::Value_O::static_classSymbol());\n llvmo::Value_O::___staticMetaClass = classllvmo__Value_Oval;\n _lisp->setf_findClass(llvmo::Value_O::static_classSymbol(),classllvmo__Value_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::Value_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::Value_O::static_className() % (void*)(llvmo::Value_O::static_newNil_callback()) );\n classllvmo__Value_Oval->setInstance_newNil_callback(llvmo::Value_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::Value_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::Value_O::static_className() );\n llvmo::Value_O::_nil = nil_for_class;\n classllvmo__Value_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__Value_Oval->setSupportsSlots(llvmo::Value_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__Argument_Oval]\"));\n core::BuiltInClass_sp classllvmo__Argument_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__Argument_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__Argument_Oval,_lisp,llvmo::Argument_O::static_classSymbol());\n llvmo::Argument_O::___staticMetaClass = classllvmo__Argument_Oval;\n _lisp->setf_findClass(llvmo::Argument_O::static_classSymbol(),classllvmo__Argument_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::Argument_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::Argument_O::static_className() % (void*)(llvmo::Argument_O::static_newNil_callback()) );\n classllvmo__Argument_Oval->setInstance_newNil_callback(llvmo::Argument_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::Argument_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::Argument_O::static_className() );\n llvmo::Argument_O::_nil = nil_for_class;\n classllvmo__Argument_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__Argument_Oval->setSupportsSlots(llvmo::Argument_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__BasicBlock_Oval]\"));\n core::BuiltInClass_sp classllvmo__BasicBlock_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__BasicBlock_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__BasicBlock_Oval,_lisp,llvmo::BasicBlock_O::static_classSymbol());\n llvmo::BasicBlock_O::___staticMetaClass = classllvmo__BasicBlock_Oval;\n _lisp->setf_findClass(llvmo::BasicBlock_O::static_classSymbol(),classllvmo__BasicBlock_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::BasicBlock_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::BasicBlock_O::static_className() % (void*)(llvmo::BasicBlock_O::static_newNil_callback()) );\n classllvmo__BasicBlock_Oval->setInstance_newNil_callback(llvmo::BasicBlock_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::BasicBlock_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::BasicBlock_O::static_className() );\n llvmo::BasicBlock_O::_nil = nil_for_class;\n classllvmo__BasicBlock_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__BasicBlock_Oval->setSupportsSlots(llvmo::BasicBlock_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__CompositeType_Oval]\"));\n core::BuiltInClass_sp classllvmo__CompositeType_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__CompositeType_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__CompositeType_Oval,_lisp,llvmo::CompositeType_O::static_classSymbol());\n llvmo::CompositeType_O::___staticMetaClass = classllvmo__CompositeType_Oval;\n _lisp->setf_findClass(llvmo::CompositeType_O::static_classSymbol(),classllvmo__CompositeType_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::CompositeType_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::CompositeType_O::static_className() % (void*)(llvmo::CompositeType_O::static_newNil_callback()) );\n classllvmo__CompositeType_Oval->setInstance_newNil_callback(llvmo::CompositeType_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::CompositeType_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::CompositeType_O::static_className() );\n llvmo::CompositeType_O::_nil = nil_for_class;\n classllvmo__CompositeType_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__CompositeType_Oval->setSupportsSlots(llvmo::CompositeType_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__FunctionPassManager_Oval]\"));\n core::BuiltInClass_sp classllvmo__FunctionPassManager_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__FunctionPassManager_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__FunctionPassManager_Oval,_lisp,llvmo::FunctionPassManager_O::static_classSymbol());\n llvmo::FunctionPassManager_O::___staticMetaClass = classllvmo__FunctionPassManager_Oval;\n _lisp->setf_findClass(llvmo::FunctionPassManager_O::static_classSymbol(),classllvmo__FunctionPassManager_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::FunctionPassManager_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::FunctionPassManager_O::static_className() % (void*)(llvmo::FunctionPassManager_O::static_newNil_callback()) );\n classllvmo__FunctionPassManager_Oval->setInstance_newNil_callback(llvmo::FunctionPassManager_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::FunctionPassManager_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::FunctionPassManager_O::static_className() );\n llvmo::FunctionPassManager_O::_nil = nil_for_class;\n classllvmo__FunctionPassManager_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__FunctionPassManager_Oval->setSupportsSlots(llvmo::FunctionPassManager_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__FunctionPass_Oval]\"));\n core::BuiltInClass_sp classllvmo__FunctionPass_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__FunctionPass_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__FunctionPass_Oval,_lisp,llvmo::FunctionPass_O::static_classSymbol());\n llvmo::FunctionPass_O::___staticMetaClass = classllvmo__FunctionPass_Oval;\n _lisp->setf_findClass(llvmo::FunctionPass_O::static_classSymbol(),classllvmo__FunctionPass_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::FunctionPass_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::FunctionPass_O::static_className() % (void*)(llvmo::FunctionPass_O::static_newNil_callback()) );\n classllvmo__FunctionPass_Oval->setInstance_newNil_callback(llvmo::FunctionPass_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::FunctionPass_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::FunctionPass_O::static_className() );\n llvmo::FunctionPass_O::_nil = nil_for_class;\n classllvmo__FunctionPass_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__FunctionPass_Oval->setSupportsSlots(llvmo::FunctionPass_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__FunctionType_Oval]\"));\n core::BuiltInClass_sp classllvmo__FunctionType_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__FunctionType_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__FunctionType_Oval,_lisp,llvmo::FunctionType_O::static_classSymbol());\n llvmo::FunctionType_O::___staticMetaClass = classllvmo__FunctionType_Oval;\n _lisp->setf_findClass(llvmo::FunctionType_O::static_classSymbol(),classllvmo__FunctionType_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::FunctionType_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::FunctionType_O::static_className() % (void*)(llvmo::FunctionType_O::static_newNil_callback()) );\n classllvmo__FunctionType_Oval->setInstance_newNil_callback(llvmo::FunctionType_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::FunctionType_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::FunctionType_O::static_className() );\n llvmo::FunctionType_O::_nil = nil_for_class;\n classllvmo__FunctionType_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__FunctionType_Oval->setSupportsSlots(llvmo::FunctionType_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__IRBuilder_Oval]\"));\n core::BuiltInClass_sp classllvmo__IRBuilder_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__IRBuilder_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__IRBuilder_Oval,_lisp,llvmo::IRBuilder_O::static_classSymbol());\n llvmo::IRBuilder_O::___staticMetaClass = classllvmo__IRBuilder_Oval;\n _lisp->setf_findClass(llvmo::IRBuilder_O::static_classSymbol(),classllvmo__IRBuilder_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::IRBuilder_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::IRBuilder_O::static_className() % (void*)(llvmo::IRBuilder_O::static_newNil_callback()) );\n classllvmo__IRBuilder_Oval->setInstance_newNil_callback(llvmo::IRBuilder_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::IRBuilder_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::IRBuilder_O::static_className() );\n llvmo::IRBuilder_O::_nil = nil_for_class;\n classllvmo__IRBuilder_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__IRBuilder_Oval->setSupportsSlots(llvmo::IRBuilder_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__IntegerType_Oval]\"));\n core::BuiltInClass_sp classllvmo__IntegerType_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__IntegerType_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__IntegerType_Oval,_lisp,llvmo::IntegerType_O::static_classSymbol());\n llvmo::IntegerType_O::___staticMetaClass = classllvmo__IntegerType_Oval;\n _lisp->setf_findClass(llvmo::IntegerType_O::static_classSymbol(),classllvmo__IntegerType_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::IntegerType_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::IntegerType_O::static_className() % (void*)(llvmo::IntegerType_O::static_newNil_callback()) );\n classllvmo__IntegerType_Oval->setInstance_newNil_callback(llvmo::IntegerType_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::IntegerType_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::IntegerType_O::static_className() );\n llvmo::IntegerType_O::_nil = nil_for_class;\n classllvmo__IntegerType_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__IntegerType_Oval->setSupportsSlots(llvmo::IntegerType_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__MDNode_Oval]\"));\n core::BuiltInClass_sp classllvmo__MDNode_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__MDNode_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__MDNode_Oval,_lisp,llvmo::MDNode_O::static_classSymbol());\n llvmo::MDNode_O::___staticMetaClass = classllvmo__MDNode_Oval;\n _lisp->setf_findClass(llvmo::MDNode_O::static_classSymbol(),classllvmo__MDNode_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::MDNode_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::MDNode_O::static_className() % (void*)(llvmo::MDNode_O::static_newNil_callback()) );\n classllvmo__MDNode_Oval->setInstance_newNil_callback(llvmo::MDNode_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::MDNode_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::MDNode_O::static_className() );\n llvmo::MDNode_O::_nil = nil_for_class;\n classllvmo__MDNode_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__MDNode_Oval->setSupportsSlots(llvmo::MDNode_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__MDString_Oval]\"));\n core::BuiltInClass_sp classllvmo__MDString_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__MDString_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__MDString_Oval,_lisp,llvmo::MDString_O::static_classSymbol());\n llvmo::MDString_O::___staticMetaClass = classllvmo__MDString_Oval;\n _lisp->setf_findClass(llvmo::MDString_O::static_classSymbol(),classllvmo__MDString_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::MDString_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::MDString_O::static_className() % (void*)(llvmo::MDString_O::static_newNil_callback()) );\n classllvmo__MDString_Oval->setInstance_newNil_callback(llvmo::MDString_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::MDString_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::MDString_O::static_className() );\n llvmo::MDString_O::_nil = nil_for_class;\n classllvmo__MDString_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__MDString_Oval->setSupportsSlots(llvmo::MDString_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__ModulePass_Oval]\"));\n core::BuiltInClass_sp classllvmo__ModulePass_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__ModulePass_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__ModulePass_Oval,_lisp,llvmo::ModulePass_O::static_classSymbol());\n llvmo::ModulePass_O::___staticMetaClass = classllvmo__ModulePass_Oval;\n _lisp->setf_findClass(llvmo::ModulePass_O::static_classSymbol(),classllvmo__ModulePass_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::ModulePass_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::ModulePass_O::static_className() % (void*)(llvmo::ModulePass_O::static_newNil_callback()) );\n classllvmo__ModulePass_Oval->setInstance_newNil_callback(llvmo::ModulePass_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::ModulePass_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::ModulePass_O::static_className() );\n llvmo::ModulePass_O::_nil = nil_for_class;\n classllvmo__ModulePass_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__ModulePass_Oval->setSupportsSlots(llvmo::ModulePass_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__User_Oval]\"));\n core::BuiltInClass_sp classllvmo__User_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__User_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__User_Oval,_lisp,llvmo::User_O::static_classSymbol());\n llvmo::User_O::___staticMetaClass = classllvmo__User_Oval;\n _lisp->setf_findClass(llvmo::User_O::static_classSymbol(),classllvmo__User_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::User_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::User_O::static_className() % (void*)(llvmo::User_O::static_newNil_callback()) );\n classllvmo__User_Oval->setInstance_newNil_callback(llvmo::User_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::User_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::User_O::static_className() );\n llvmo::User_O::_nil = nil_for_class;\n classllvmo__User_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__User_Oval->setSupportsSlots(llvmo::User_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__Constant_Oval]\"));\n core::BuiltInClass_sp classllvmo__Constant_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__Constant_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__Constant_Oval,_lisp,llvmo::Constant_O::static_classSymbol());\n llvmo::Constant_O::___staticMetaClass = classllvmo__Constant_Oval;\n _lisp->setf_findClass(llvmo::Constant_O::static_classSymbol(),classllvmo__Constant_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::Constant_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::Constant_O::static_className() % (void*)(llvmo::Constant_O::static_newNil_callback()) );\n classllvmo__Constant_Oval->setInstance_newNil_callback(llvmo::Constant_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::Constant_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::Constant_O::static_className() );\n llvmo::Constant_O::_nil = nil_for_class;\n classllvmo__Constant_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__Constant_Oval->setSupportsSlots(llvmo::Constant_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__ImmutablePass_Oval]\"));\n core::BuiltInClass_sp classllvmo__ImmutablePass_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__ImmutablePass_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__ImmutablePass_Oval,_lisp,llvmo::ImmutablePass_O::static_classSymbol());\n llvmo::ImmutablePass_O::___staticMetaClass = classllvmo__ImmutablePass_Oval;\n _lisp->setf_findClass(llvmo::ImmutablePass_O::static_classSymbol(),classllvmo__ImmutablePass_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::ImmutablePass_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::ImmutablePass_O::static_className() % (void*)(llvmo::ImmutablePass_O::static_newNil_callback()) );\n classllvmo__ImmutablePass_Oval->setInstance_newNil_callback(llvmo::ImmutablePass_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::ImmutablePass_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::ImmutablePass_O::static_className() );\n llvmo::ImmutablePass_O::_nil = nil_for_class;\n classllvmo__ImmutablePass_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__ImmutablePass_Oval->setSupportsSlots(llvmo::ImmutablePass_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__Instruction_Oval]\"));\n core::BuiltInClass_sp classllvmo__Instruction_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__Instruction_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__Instruction_Oval,_lisp,llvmo::Instruction_O::static_classSymbol());\n llvmo::Instruction_O::___staticMetaClass = classllvmo__Instruction_Oval;\n _lisp->setf_findClass(llvmo::Instruction_O::static_classSymbol(),classllvmo__Instruction_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::Instruction_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::Instruction_O::static_className() % (void*)(llvmo::Instruction_O::static_newNil_callback()) );\n classllvmo__Instruction_Oval->setInstance_newNil_callback(llvmo::Instruction_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::Instruction_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::Instruction_O::static_className() );\n llvmo::Instruction_O::_nil = nil_for_class;\n classllvmo__Instruction_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__Instruction_Oval->setSupportsSlots(llvmo::Instruction_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__SequentialType_Oval]\"));\n core::BuiltInClass_sp classllvmo__SequentialType_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__SequentialType_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__SequentialType_Oval,_lisp,llvmo::SequentialType_O::static_classSymbol());\n llvmo::SequentialType_O::___staticMetaClass = classllvmo__SequentialType_Oval;\n _lisp->setf_findClass(llvmo::SequentialType_O::static_classSymbol(),classllvmo__SequentialType_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::SequentialType_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::SequentialType_O::static_className() % (void*)(llvmo::SequentialType_O::static_newNil_callback()) );\n classllvmo__SequentialType_Oval->setInstance_newNil_callback(llvmo::SequentialType_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::SequentialType_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::SequentialType_O::static_className() );\n llvmo::SequentialType_O::_nil = nil_for_class;\n classllvmo__SequentialType_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__SequentialType_Oval->setSupportsSlots(llvmo::SequentialType_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__StructType_Oval]\"));\n core::BuiltInClass_sp classllvmo__StructType_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__StructType_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__StructType_Oval,_lisp,llvmo::StructType_O::static_classSymbol());\n llvmo::StructType_O::___staticMetaClass = classllvmo__StructType_Oval;\n _lisp->setf_findClass(llvmo::StructType_O::static_classSymbol(),classllvmo__StructType_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::StructType_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::StructType_O::static_className() % (void*)(llvmo::StructType_O::static_newNil_callback()) );\n classllvmo__StructType_Oval->setInstance_newNil_callback(llvmo::StructType_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::StructType_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::StructType_O::static_className() );\n llvmo::StructType_O::_nil = nil_for_class;\n classllvmo__StructType_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__StructType_Oval->setSupportsSlots(llvmo::StructType_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__ArrayType_Oval]\"));\n core::BuiltInClass_sp classllvmo__ArrayType_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__ArrayType_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__ArrayType_Oval,_lisp,llvmo::ArrayType_O::static_classSymbol());\n llvmo::ArrayType_O::___staticMetaClass = classllvmo__ArrayType_Oval;\n _lisp->setf_findClass(llvmo::ArrayType_O::static_classSymbol(),classllvmo__ArrayType_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::ArrayType_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::ArrayType_O::static_className() % (void*)(llvmo::ArrayType_O::static_newNil_callback()) );\n classllvmo__ArrayType_Oval->setInstance_newNil_callback(llvmo::ArrayType_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::ArrayType_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::ArrayType_O::static_className() );\n llvmo::ArrayType_O::_nil = nil_for_class;\n classllvmo__ArrayType_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__ArrayType_Oval->setSupportsSlots(llvmo::ArrayType_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__AtomicCmpXchgInst_Oval]\"));\n core::BuiltInClass_sp classllvmo__AtomicCmpXchgInst_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__AtomicCmpXchgInst_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__AtomicCmpXchgInst_Oval,_lisp,llvmo::AtomicCmpXchgInst_O::static_classSymbol());\n llvmo::AtomicCmpXchgInst_O::___staticMetaClass = classllvmo__AtomicCmpXchgInst_Oval;\n _lisp->setf_findClass(llvmo::AtomicCmpXchgInst_O::static_classSymbol(),classllvmo__AtomicCmpXchgInst_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::AtomicCmpXchgInst_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::AtomicCmpXchgInst_O::static_className() % (void*)(llvmo::AtomicCmpXchgInst_O::static_newNil_callback()) );\n classllvmo__AtomicCmpXchgInst_Oval->setInstance_newNil_callback(llvmo::AtomicCmpXchgInst_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::AtomicCmpXchgInst_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::AtomicCmpXchgInst_O::static_className() );\n llvmo::AtomicCmpXchgInst_O::_nil = nil_for_class;\n classllvmo__AtomicCmpXchgInst_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__AtomicCmpXchgInst_Oval->setSupportsSlots(llvmo::AtomicCmpXchgInst_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__AtomicRMWInst_Oval]\"));\n core::BuiltInClass_sp classllvmo__AtomicRMWInst_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__AtomicRMWInst_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__AtomicRMWInst_Oval,_lisp,llvmo::AtomicRMWInst_O::static_classSymbol());\n llvmo::AtomicRMWInst_O::___staticMetaClass = classllvmo__AtomicRMWInst_Oval;\n _lisp->setf_findClass(llvmo::AtomicRMWInst_O::static_classSymbol(),classllvmo__AtomicRMWInst_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::AtomicRMWInst_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::AtomicRMWInst_O::static_className() % (void*)(llvmo::AtomicRMWInst_O::static_newNil_callback()) );\n classllvmo__AtomicRMWInst_Oval->setInstance_newNil_callback(llvmo::AtomicRMWInst_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::AtomicRMWInst_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::AtomicRMWInst_O::static_className() );\n llvmo::AtomicRMWInst_O::_nil = nil_for_class;\n classllvmo__AtomicRMWInst_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__AtomicRMWInst_Oval->setSupportsSlots(llvmo::AtomicRMWInst_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__CallInst_Oval]\"));\n core::BuiltInClass_sp classllvmo__CallInst_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__CallInst_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__CallInst_Oval,_lisp,llvmo::CallInst_O::static_classSymbol());\n llvmo::CallInst_O::___staticMetaClass = classllvmo__CallInst_Oval;\n _lisp->setf_findClass(llvmo::CallInst_O::static_classSymbol(),classllvmo__CallInst_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::CallInst_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::CallInst_O::static_className() % (void*)(llvmo::CallInst_O::static_newNil_callback()) );\n classllvmo__CallInst_Oval->setInstance_newNil_callback(llvmo::CallInst_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::CallInst_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::CallInst_O::static_className() );\n llvmo::CallInst_O::_nil = nil_for_class;\n classllvmo__CallInst_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__CallInst_Oval->setSupportsSlots(llvmo::CallInst_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__ConstantArray_Oval]\"));\n core::BuiltInClass_sp classllvmo__ConstantArray_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__ConstantArray_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__ConstantArray_Oval,_lisp,llvmo::ConstantArray_O::static_classSymbol());\n llvmo::ConstantArray_O::___staticMetaClass = classllvmo__ConstantArray_Oval;\n _lisp->setf_findClass(llvmo::ConstantArray_O::static_classSymbol(),classllvmo__ConstantArray_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::ConstantArray_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::ConstantArray_O::static_className() % (void*)(llvmo::ConstantArray_O::static_newNil_callback()) );\n classllvmo__ConstantArray_Oval->setInstance_newNil_callback(llvmo::ConstantArray_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::ConstantArray_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::ConstantArray_O::static_className() );\n llvmo::ConstantArray_O::_nil = nil_for_class;\n classllvmo__ConstantArray_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__ConstantArray_Oval->setSupportsSlots(llvmo::ConstantArray_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__ConstantDataSequential_Oval]\"));\n core::BuiltInClass_sp classllvmo__ConstantDataSequential_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__ConstantDataSequential_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__ConstantDataSequential_Oval,_lisp,llvmo::ConstantDataSequential_O::static_classSymbol());\n llvmo::ConstantDataSequential_O::___staticMetaClass = classllvmo__ConstantDataSequential_Oval;\n _lisp->setf_findClass(llvmo::ConstantDataSequential_O::static_classSymbol(),classllvmo__ConstantDataSequential_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::ConstantDataSequential_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::ConstantDataSequential_O::static_className() % (void*)(llvmo::ConstantDataSequential_O::static_newNil_callback()) );\n classllvmo__ConstantDataSequential_Oval->setInstance_newNil_callback(llvmo::ConstantDataSequential_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::ConstantDataSequential_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::ConstantDataSequential_O::static_className() );\n llvmo::ConstantDataSequential_O::_nil = nil_for_class;\n classllvmo__ConstantDataSequential_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__ConstantDataSequential_Oval->setSupportsSlots(llvmo::ConstantDataSequential_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__ConstantExpr_Oval]\"));\n core::BuiltInClass_sp classllvmo__ConstantExpr_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__ConstantExpr_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__ConstantExpr_Oval,_lisp,llvmo::ConstantExpr_O::static_classSymbol());\n llvmo::ConstantExpr_O::___staticMetaClass = classllvmo__ConstantExpr_Oval;\n _lisp->setf_findClass(llvmo::ConstantExpr_O::static_classSymbol(),classllvmo__ConstantExpr_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::ConstantExpr_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::ConstantExpr_O::static_className() % (void*)(llvmo::ConstantExpr_O::static_newNil_callback()) );\n classllvmo__ConstantExpr_Oval->setInstance_newNil_callback(llvmo::ConstantExpr_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::ConstantExpr_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::ConstantExpr_O::static_className() );\n llvmo::ConstantExpr_O::_nil = nil_for_class;\n classllvmo__ConstantExpr_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__ConstantExpr_Oval->setSupportsSlots(llvmo::ConstantExpr_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__ConstantFP_Oval]\"));\n core::BuiltInClass_sp classllvmo__ConstantFP_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__ConstantFP_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__ConstantFP_Oval,_lisp,llvmo::ConstantFP_O::static_classSymbol());\n llvmo::ConstantFP_O::___staticMetaClass = classllvmo__ConstantFP_Oval;\n _lisp->setf_findClass(llvmo::ConstantFP_O::static_classSymbol(),classllvmo__ConstantFP_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::ConstantFP_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::ConstantFP_O::static_className() % (void*)(llvmo::ConstantFP_O::static_newNil_callback()) );\n classllvmo__ConstantFP_Oval->setInstance_newNil_callback(llvmo::ConstantFP_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::ConstantFP_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::ConstantFP_O::static_className() );\n llvmo::ConstantFP_O::_nil = nil_for_class;\n classllvmo__ConstantFP_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__ConstantFP_Oval->setSupportsSlots(llvmo::ConstantFP_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__ConstantInt_Oval]\"));\n core::BuiltInClass_sp classllvmo__ConstantInt_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__ConstantInt_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__ConstantInt_Oval,_lisp,llvmo::ConstantInt_O::static_classSymbol());\n llvmo::ConstantInt_O::___staticMetaClass = classllvmo__ConstantInt_Oval;\n _lisp->setf_findClass(llvmo::ConstantInt_O::static_classSymbol(),classllvmo__ConstantInt_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::ConstantInt_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::ConstantInt_O::static_className() % (void*)(llvmo::ConstantInt_O::static_newNil_callback()) );\n classllvmo__ConstantInt_Oval->setInstance_newNil_callback(llvmo::ConstantInt_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::ConstantInt_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::ConstantInt_O::static_className() );\n llvmo::ConstantInt_O::_nil = nil_for_class;\n classllvmo__ConstantInt_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__ConstantInt_Oval->setSupportsSlots(llvmo::ConstantInt_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__ConstantPointerNull_Oval]\"));\n core::BuiltInClass_sp classllvmo__ConstantPointerNull_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__ConstantPointerNull_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__ConstantPointerNull_Oval,_lisp,llvmo::ConstantPointerNull_O::static_classSymbol());\n llvmo::ConstantPointerNull_O::___staticMetaClass = classllvmo__ConstantPointerNull_Oval;\n _lisp->setf_findClass(llvmo::ConstantPointerNull_O::static_classSymbol(),classllvmo__ConstantPointerNull_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::ConstantPointerNull_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::ConstantPointerNull_O::static_className() % (void*)(llvmo::ConstantPointerNull_O::static_newNil_callback()) );\n classllvmo__ConstantPointerNull_Oval->setInstance_newNil_callback(llvmo::ConstantPointerNull_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::ConstantPointerNull_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::ConstantPointerNull_O::static_className() );\n llvmo::ConstantPointerNull_O::_nil = nil_for_class;\n classllvmo__ConstantPointerNull_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__ConstantPointerNull_Oval->setSupportsSlots(llvmo::ConstantPointerNull_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__DataLayout_Oval]\"));\n core::BuiltInClass_sp classllvmo__DataLayout_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__DataLayout_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__DataLayout_Oval,_lisp,llvmo::DataLayout_O::static_classSymbol());\n llvmo::DataLayout_O::___staticMetaClass = classllvmo__DataLayout_Oval;\n _lisp->setf_findClass(llvmo::DataLayout_O::static_classSymbol(),classllvmo__DataLayout_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::DataLayout_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::DataLayout_O::static_className() % (void*)(llvmo::DataLayout_O::static_newNil_callback()) );\n classllvmo__DataLayout_Oval->setInstance_newNil_callback(llvmo::DataLayout_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::DataLayout_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::DataLayout_O::static_className() );\n llvmo::DataLayout_O::_nil = nil_for_class;\n classllvmo__DataLayout_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__DataLayout_Oval->setSupportsSlots(llvmo::DataLayout_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__FenceInst_Oval]\"));\n core::BuiltInClass_sp classllvmo__FenceInst_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__FenceInst_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__FenceInst_Oval,_lisp,llvmo::FenceInst_O::static_classSymbol());\n llvmo::FenceInst_O::___staticMetaClass = classllvmo__FenceInst_Oval;\n _lisp->setf_findClass(llvmo::FenceInst_O::static_classSymbol(),classllvmo__FenceInst_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::FenceInst_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::FenceInst_O::static_className() % (void*)(llvmo::FenceInst_O::static_newNil_callback()) );\n classllvmo__FenceInst_Oval->setInstance_newNil_callback(llvmo::FenceInst_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::FenceInst_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::FenceInst_O::static_className() );\n llvmo::FenceInst_O::_nil = nil_for_class;\n classllvmo__FenceInst_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__FenceInst_Oval->setSupportsSlots(llvmo::FenceInst_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__GlobalValue_Oval]\"));\n core::BuiltInClass_sp classllvmo__GlobalValue_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__GlobalValue_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__GlobalValue_Oval,_lisp,llvmo::GlobalValue_O::static_classSymbol());\n llvmo::GlobalValue_O::___staticMetaClass = classllvmo__GlobalValue_Oval;\n _lisp->setf_findClass(llvmo::GlobalValue_O::static_classSymbol(),classllvmo__GlobalValue_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::GlobalValue_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::GlobalValue_O::static_className() % (void*)(llvmo::GlobalValue_O::static_newNil_callback()) );\n classllvmo__GlobalValue_Oval->setInstance_newNil_callback(llvmo::GlobalValue_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::GlobalValue_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::GlobalValue_O::static_className() );\n llvmo::GlobalValue_O::_nil = nil_for_class;\n classllvmo__GlobalValue_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__GlobalValue_Oval->setSupportsSlots(llvmo::GlobalValue_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__LandingPadInst_Oval]\"));\n core::BuiltInClass_sp classllvmo__LandingPadInst_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__LandingPadInst_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__LandingPadInst_Oval,_lisp,llvmo::LandingPadInst_O::static_classSymbol());\n llvmo::LandingPadInst_O::___staticMetaClass = classllvmo__LandingPadInst_Oval;\n _lisp->setf_findClass(llvmo::LandingPadInst_O::static_classSymbol(),classllvmo__LandingPadInst_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::LandingPadInst_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::LandingPadInst_O::static_className() % (void*)(llvmo::LandingPadInst_O::static_newNil_callback()) );\n classllvmo__LandingPadInst_Oval->setInstance_newNil_callback(llvmo::LandingPadInst_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::LandingPadInst_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::LandingPadInst_O::static_className() );\n llvmo::LandingPadInst_O::_nil = nil_for_class;\n classllvmo__LandingPadInst_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__LandingPadInst_Oval->setSupportsSlots(llvmo::LandingPadInst_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__PHINode_Oval]\"));\n core::BuiltInClass_sp classllvmo__PHINode_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__PHINode_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__PHINode_Oval,_lisp,llvmo::PHINode_O::static_classSymbol());\n llvmo::PHINode_O::___staticMetaClass = classllvmo__PHINode_Oval;\n _lisp->setf_findClass(llvmo::PHINode_O::static_classSymbol(),classllvmo__PHINode_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::PHINode_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::PHINode_O::static_className() % (void*)(llvmo::PHINode_O::static_newNil_callback()) );\n classllvmo__PHINode_Oval->setInstance_newNil_callback(llvmo::PHINode_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::PHINode_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::PHINode_O::static_className() );\n llvmo::PHINode_O::_nil = nil_for_class;\n classllvmo__PHINode_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__PHINode_Oval->setSupportsSlots(llvmo::PHINode_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__PointerType_Oval]\"));\n core::BuiltInClass_sp classllvmo__PointerType_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__PointerType_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__PointerType_Oval,_lisp,llvmo::PointerType_O::static_classSymbol());\n llvmo::PointerType_O::___staticMetaClass = classllvmo__PointerType_Oval;\n _lisp->setf_findClass(llvmo::PointerType_O::static_classSymbol(),classllvmo__PointerType_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::PointerType_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::PointerType_O::static_className() % (void*)(llvmo::PointerType_O::static_newNil_callback()) );\n classllvmo__PointerType_Oval->setInstance_newNil_callback(llvmo::PointerType_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::PointerType_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::PointerType_O::static_className() );\n llvmo::PointerType_O::_nil = nil_for_class;\n classllvmo__PointerType_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__PointerType_Oval->setSupportsSlots(llvmo::PointerType_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__StoreInst_Oval]\"));\n core::BuiltInClass_sp classllvmo__StoreInst_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__StoreInst_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__StoreInst_Oval,_lisp,llvmo::StoreInst_O::static_classSymbol());\n llvmo::StoreInst_O::___staticMetaClass = classllvmo__StoreInst_Oval;\n _lisp->setf_findClass(llvmo::StoreInst_O::static_classSymbol(),classllvmo__StoreInst_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::StoreInst_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::StoreInst_O::static_className() % (void*)(llvmo::StoreInst_O::static_newNil_callback()) );\n classllvmo__StoreInst_Oval->setInstance_newNil_callback(llvmo::StoreInst_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::StoreInst_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::StoreInst_O::static_className() );\n llvmo::StoreInst_O::_nil = nil_for_class;\n classllvmo__StoreInst_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__StoreInst_Oval->setSupportsSlots(llvmo::StoreInst_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__TerminatorInst_Oval]\"));\n core::BuiltInClass_sp classllvmo__TerminatorInst_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__TerminatorInst_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__TerminatorInst_Oval,_lisp,llvmo::TerminatorInst_O::static_classSymbol());\n llvmo::TerminatorInst_O::___staticMetaClass = classllvmo__TerminatorInst_Oval;\n _lisp->setf_findClass(llvmo::TerminatorInst_O::static_classSymbol(),classllvmo__TerminatorInst_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::TerminatorInst_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::TerminatorInst_O::static_className() % (void*)(llvmo::TerminatorInst_O::static_newNil_callback()) );\n classllvmo__TerminatorInst_Oval->setInstance_newNil_callback(llvmo::TerminatorInst_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::TerminatorInst_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::TerminatorInst_O::static_className() );\n llvmo::TerminatorInst_O::_nil = nil_for_class;\n classllvmo__TerminatorInst_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__TerminatorInst_Oval->setSupportsSlots(llvmo::TerminatorInst_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__UnaryInstruction_Oval]\"));\n core::BuiltInClass_sp classllvmo__UnaryInstruction_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__UnaryInstruction_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__UnaryInstruction_Oval,_lisp,llvmo::UnaryInstruction_O::static_classSymbol());\n llvmo::UnaryInstruction_O::___staticMetaClass = classllvmo__UnaryInstruction_Oval;\n _lisp->setf_findClass(llvmo::UnaryInstruction_O::static_classSymbol(),classllvmo__UnaryInstruction_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::UnaryInstruction_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::UnaryInstruction_O::static_className() % (void*)(llvmo::UnaryInstruction_O::static_newNil_callback()) );\n classllvmo__UnaryInstruction_Oval->setInstance_newNil_callback(llvmo::UnaryInstruction_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::UnaryInstruction_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::UnaryInstruction_O::static_className() );\n llvmo::UnaryInstruction_O::_nil = nil_for_class;\n classllvmo__UnaryInstruction_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__UnaryInstruction_Oval->setSupportsSlots(llvmo::UnaryInstruction_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__UndefValue_Oval]\"));\n core::BuiltInClass_sp classllvmo__UndefValue_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__UndefValue_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__UndefValue_Oval,_lisp,llvmo::UndefValue_O::static_classSymbol());\n llvmo::UndefValue_O::___staticMetaClass = classllvmo__UndefValue_Oval;\n _lisp->setf_findClass(llvmo::UndefValue_O::static_classSymbol(),classllvmo__UndefValue_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::UndefValue_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::UndefValue_O::static_className() % (void*)(llvmo::UndefValue_O::static_newNil_callback()) );\n classllvmo__UndefValue_Oval->setInstance_newNil_callback(llvmo::UndefValue_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::UndefValue_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::UndefValue_O::static_className() );\n llvmo::UndefValue_O::_nil = nil_for_class;\n classllvmo__UndefValue_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__UndefValue_Oval->setSupportsSlots(llvmo::UndefValue_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__VectorType_Oval]\"));\n core::BuiltInClass_sp classllvmo__VectorType_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__VectorType_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__VectorType_Oval,_lisp,llvmo::VectorType_O::static_classSymbol());\n llvmo::VectorType_O::___staticMetaClass = classllvmo__VectorType_Oval;\n _lisp->setf_findClass(llvmo::VectorType_O::static_classSymbol(),classllvmo__VectorType_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::VectorType_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::VectorType_O::static_className() % (void*)(llvmo::VectorType_O::static_newNil_callback()) );\n classllvmo__VectorType_Oval->setInstance_newNil_callback(llvmo::VectorType_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::VectorType_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::VectorType_O::static_className() );\n llvmo::VectorType_O::_nil = nil_for_class;\n classllvmo__VectorType_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__VectorType_Oval->setSupportsSlots(llvmo::VectorType_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__AllocaInst_Oval]\"));\n core::BuiltInClass_sp classllvmo__AllocaInst_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__AllocaInst_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__AllocaInst_Oval,_lisp,llvmo::AllocaInst_O::static_classSymbol());\n llvmo::AllocaInst_O::___staticMetaClass = classllvmo__AllocaInst_Oval;\n _lisp->setf_findClass(llvmo::AllocaInst_O::static_classSymbol(),classllvmo__AllocaInst_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::AllocaInst_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::AllocaInst_O::static_className() % (void*)(llvmo::AllocaInst_O::static_newNil_callback()) );\n classllvmo__AllocaInst_Oval->setInstance_newNil_callback(llvmo::AllocaInst_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::AllocaInst_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::AllocaInst_O::static_className() );\n llvmo::AllocaInst_O::_nil = nil_for_class;\n classllvmo__AllocaInst_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__AllocaInst_Oval->setSupportsSlots(llvmo::AllocaInst_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__BranchInst_Oval]\"));\n core::BuiltInClass_sp classllvmo__BranchInst_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__BranchInst_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__BranchInst_Oval,_lisp,llvmo::BranchInst_O::static_classSymbol());\n llvmo::BranchInst_O::___staticMetaClass = classllvmo__BranchInst_Oval;\n _lisp->setf_findClass(llvmo::BranchInst_O::static_classSymbol(),classllvmo__BranchInst_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::BranchInst_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::BranchInst_O::static_className() % (void*)(llvmo::BranchInst_O::static_newNil_callback()) );\n classllvmo__BranchInst_Oval->setInstance_newNil_callback(llvmo::BranchInst_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::BranchInst_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::BranchInst_O::static_className() );\n llvmo::BranchInst_O::_nil = nil_for_class;\n classllvmo__BranchInst_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__BranchInst_Oval->setSupportsSlots(llvmo::BranchInst_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__ConstantDataArray_Oval]\"));\n core::BuiltInClass_sp classllvmo__ConstantDataArray_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__ConstantDataArray_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__ConstantDataArray_Oval,_lisp,llvmo::ConstantDataArray_O::static_classSymbol());\n llvmo::ConstantDataArray_O::___staticMetaClass = classllvmo__ConstantDataArray_Oval;\n _lisp->setf_findClass(llvmo::ConstantDataArray_O::static_classSymbol(),classllvmo__ConstantDataArray_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::ConstantDataArray_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::ConstantDataArray_O::static_className() % (void*)(llvmo::ConstantDataArray_O::static_newNil_callback()) );\n classllvmo__ConstantDataArray_Oval->setInstance_newNil_callback(llvmo::ConstantDataArray_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::ConstantDataArray_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::ConstantDataArray_O::static_className() );\n llvmo::ConstantDataArray_O::_nil = nil_for_class;\n classllvmo__ConstantDataArray_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__ConstantDataArray_Oval->setSupportsSlots(llvmo::ConstantDataArray_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__Function_Oval]\"));\n core::BuiltInClass_sp classllvmo__Function_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__Function_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__Function_Oval,_lisp,llvmo::Function_O::static_classSymbol());\n llvmo::Function_O::___staticMetaClass = classllvmo__Function_Oval;\n _lisp->setf_findClass(llvmo::Function_O::static_classSymbol(),classllvmo__Function_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::Function_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::Function_O::static_className() % (void*)(llvmo::Function_O::static_newNil_callback()) );\n classllvmo__Function_Oval->setInstance_newNil_callback(llvmo::Function_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::Function_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::Function_O::static_className() );\n llvmo::Function_O::_nil = nil_for_class;\n classllvmo__Function_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__Function_Oval->setSupportsSlots(llvmo::Function_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__GlobalVariable_Oval]\"));\n core::BuiltInClass_sp classllvmo__GlobalVariable_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__GlobalVariable_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__GlobalVariable_Oval,_lisp,llvmo::GlobalVariable_O::static_classSymbol());\n llvmo::GlobalVariable_O::___staticMetaClass = classllvmo__GlobalVariable_Oval;\n _lisp->setf_findClass(llvmo::GlobalVariable_O::static_classSymbol(),classllvmo__GlobalVariable_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::GlobalVariable_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::GlobalVariable_O::static_className() % (void*)(llvmo::GlobalVariable_O::static_newNil_callback()) );\n classllvmo__GlobalVariable_Oval->setInstance_newNil_callback(llvmo::GlobalVariable_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::GlobalVariable_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::GlobalVariable_O::static_className() );\n llvmo::GlobalVariable_O::_nil = nil_for_class;\n classllvmo__GlobalVariable_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__GlobalVariable_Oval->setSupportsSlots(llvmo::GlobalVariable_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__IndirectBrInst_Oval]\"));\n core::BuiltInClass_sp classllvmo__IndirectBrInst_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__IndirectBrInst_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__IndirectBrInst_Oval,_lisp,llvmo::IndirectBrInst_O::static_classSymbol());\n llvmo::IndirectBrInst_O::___staticMetaClass = classllvmo__IndirectBrInst_Oval;\n _lisp->setf_findClass(llvmo::IndirectBrInst_O::static_classSymbol(),classllvmo__IndirectBrInst_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::IndirectBrInst_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::IndirectBrInst_O::static_className() % (void*)(llvmo::IndirectBrInst_O::static_newNil_callback()) );\n classllvmo__IndirectBrInst_Oval->setInstance_newNil_callback(llvmo::IndirectBrInst_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::IndirectBrInst_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::IndirectBrInst_O::static_className() );\n llvmo::IndirectBrInst_O::_nil = nil_for_class;\n classllvmo__IndirectBrInst_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__IndirectBrInst_Oval->setSupportsSlots(llvmo::IndirectBrInst_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__InvokeInst_Oval]\"));\n core::BuiltInClass_sp classllvmo__InvokeInst_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__InvokeInst_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__InvokeInst_Oval,_lisp,llvmo::InvokeInst_O::static_classSymbol());\n llvmo::InvokeInst_O::___staticMetaClass = classllvmo__InvokeInst_Oval;\n _lisp->setf_findClass(llvmo::InvokeInst_O::static_classSymbol(),classllvmo__InvokeInst_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::InvokeInst_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::InvokeInst_O::static_className() % (void*)(llvmo::InvokeInst_O::static_newNil_callback()) );\n classllvmo__InvokeInst_Oval->setInstance_newNil_callback(llvmo::InvokeInst_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::InvokeInst_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::InvokeInst_O::static_className() );\n llvmo::InvokeInst_O::_nil = nil_for_class;\n classllvmo__InvokeInst_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__InvokeInst_Oval->setSupportsSlots(llvmo::InvokeInst_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__LoadInst_Oval]\"));\n core::BuiltInClass_sp classllvmo__LoadInst_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__LoadInst_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__LoadInst_Oval,_lisp,llvmo::LoadInst_O::static_classSymbol());\n llvmo::LoadInst_O::___staticMetaClass = classllvmo__LoadInst_Oval;\n _lisp->setf_findClass(llvmo::LoadInst_O::static_classSymbol(),classllvmo__LoadInst_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::LoadInst_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::LoadInst_O::static_className() % (void*)(llvmo::LoadInst_O::static_newNil_callback()) );\n classllvmo__LoadInst_Oval->setInstance_newNil_callback(llvmo::LoadInst_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::LoadInst_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::LoadInst_O::static_className() );\n llvmo::LoadInst_O::_nil = nil_for_class;\n classllvmo__LoadInst_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__LoadInst_Oval->setSupportsSlots(llvmo::LoadInst_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__ResumeInst_Oval]\"));\n core::BuiltInClass_sp classllvmo__ResumeInst_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__ResumeInst_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__ResumeInst_Oval,_lisp,llvmo::ResumeInst_O::static_classSymbol());\n llvmo::ResumeInst_O::___staticMetaClass = classllvmo__ResumeInst_Oval;\n _lisp->setf_findClass(llvmo::ResumeInst_O::static_classSymbol(),classllvmo__ResumeInst_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::ResumeInst_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::ResumeInst_O::static_className() % (void*)(llvmo::ResumeInst_O::static_newNil_callback()) );\n classllvmo__ResumeInst_Oval->setInstance_newNil_callback(llvmo::ResumeInst_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::ResumeInst_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::ResumeInst_O::static_className() );\n llvmo::ResumeInst_O::_nil = nil_for_class;\n classllvmo__ResumeInst_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__ResumeInst_Oval->setSupportsSlots(llvmo::ResumeInst_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__ReturnInst_Oval]\"));\n core::BuiltInClass_sp classllvmo__ReturnInst_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__ReturnInst_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__ReturnInst_Oval,_lisp,llvmo::ReturnInst_O::static_classSymbol());\n llvmo::ReturnInst_O::___staticMetaClass = classllvmo__ReturnInst_Oval;\n _lisp->setf_findClass(llvmo::ReturnInst_O::static_classSymbol(),classllvmo__ReturnInst_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::ReturnInst_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::ReturnInst_O::static_className() % (void*)(llvmo::ReturnInst_O::static_newNil_callback()) );\n classllvmo__ReturnInst_Oval->setInstance_newNil_callback(llvmo::ReturnInst_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::ReturnInst_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::ReturnInst_O::static_className() );\n llvmo::ReturnInst_O::_nil = nil_for_class;\n classllvmo__ReturnInst_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__ReturnInst_Oval->setSupportsSlots(llvmo::ReturnInst_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__SwitchInst_Oval]\"));\n core::BuiltInClass_sp classllvmo__SwitchInst_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__SwitchInst_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__SwitchInst_Oval,_lisp,llvmo::SwitchInst_O::static_classSymbol());\n llvmo::SwitchInst_O::___staticMetaClass = classllvmo__SwitchInst_Oval;\n _lisp->setf_findClass(llvmo::SwitchInst_O::static_classSymbol(),classllvmo__SwitchInst_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::SwitchInst_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::SwitchInst_O::static_className() % (void*)(llvmo::SwitchInst_O::static_newNil_callback()) );\n classllvmo__SwitchInst_Oval->setInstance_newNil_callback(llvmo::SwitchInst_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::SwitchInst_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::SwitchInst_O::static_className() );\n llvmo::SwitchInst_O::_nil = nil_for_class;\n classllvmo__SwitchInst_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__SwitchInst_Oval->setSupportsSlots(llvmo::SwitchInst_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__UnreachableInst_Oval]\"));\n core::BuiltInClass_sp classllvmo__UnreachableInst_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__UnreachableInst_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__UnreachableInst_Oval,_lisp,llvmo::UnreachableInst_O::static_classSymbol());\n llvmo::UnreachableInst_O::___staticMetaClass = classllvmo__UnreachableInst_Oval;\n _lisp->setf_findClass(llvmo::UnreachableInst_O::static_classSymbol(),classllvmo__UnreachableInst_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::UnreachableInst_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::UnreachableInst_O::static_className() % (void*)(llvmo::UnreachableInst_O::static_newNil_callback()) );\n classllvmo__UnreachableInst_Oval->setInstance_newNil_callback(llvmo::UnreachableInst_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::UnreachableInst_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::UnreachableInst_O::static_className() );\n llvmo::UnreachableInst_O::_nil = nil_for_class;\n classllvmo__UnreachableInst_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__UnreachableInst_Oval->setSupportsSlots(llvmo::UnreachableInst_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n\n LOG(BF(\"Creating class[classllvmo__VAArgInst_Oval]\"));\n core::BuiltInClass_sp classllvmo__VAArgInst_Oval = core::BuiltInClass_O::create(undefinedMetaClass);\n classllvmo__VAArgInst_Oval->__setup_stage1_with_sharedPtr_lisp_sid(classllvmo__VAArgInst_Oval,_lisp,llvmo::VAArgInst_O::static_classSymbol());\n llvmo::VAArgInst_O::___staticMetaClass = classllvmo__VAArgInst_Oval;\n _lisp->setf_findClass(llvmo::VAArgInst_O::static_classSymbol(),classllvmo__VAArgInst_Oval);\n {\n AllocatorCallback cb = &new_Nil;\n llvmo::VAArgInst_O::___set_static_newNil_callback(cb);\n }\n LOG(BF(\"Set _newNil_callback for class(%s) to %X\")% llvmo::VAArgInst_O::static_className() % (void*)(llvmo::VAArgInst_O::static_newNil_callback()) );\n classllvmo__VAArgInst_Oval->setInstance_newNil_callback(llvmo::VAArgInst_O::static_newNil_callback());\n {\n boost::shared_ptr nil_for_class(new llvmo::VAArgInst_O(undefinedMetaClass));\n nil_for_class->__setWeakThis(nil_for_class);\n LOG(BF(\"Created nil for class[%s]\") % llvmo::VAArgInst_O::static_className() );\n llvmo::VAArgInst_O::_nil = nil_for_class;\n classllvmo__VAArgInst_Oval->setInstanceNil(nil_for_class);\n }\n classllvmo__VAArgInst_Oval->setSupportsSlots(llvmo::VAArgInst_O::static_supportsSlots());\n /* ----- the class and its nil are now defined but the _class of these objects is undefined - set in next stage ----- */\n#endif // CREATE_CLASS\n#undef CREATE_CLASS\n#ifdef DUMP_INFO_CLASS // {\n// Depends on nothing\n\n LOG(BF(\"--- dump_info --- className: llvmo::APFloat_O @ %X\") % classllvmo__APFloat_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::APFloat_O::static_className() % llvmo::APFloat_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::APInt_O @ %X\") % classllvmo__APInt_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::APInt_O::static_className() % llvmo::APInt_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::Attribute_O @ %X\") % classllvmo__Attribute_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::Attribute_O::static_className() % llvmo::Attribute_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::Builder_O @ %X\") % classllvmo__Builder_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::Builder_O::static_className() % llvmo::Builder_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::DebugLoc_O @ %X\") % classllvmo__DebugLoc_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::DebugLoc_O::static_className() % llvmo::DebugLoc_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::EngineBuilder_O @ %X\") % classllvmo__EngineBuilder_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::EngineBuilder_O::static_className() % llvmo::EngineBuilder_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::ExecutionEngine_O @ %X\") % classllvmo__ExecutionEngine_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::ExecutionEngine_O::static_className() % llvmo::ExecutionEngine_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::IRBuilderBase_O @ %X\") % classllvmo__IRBuilderBase_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::IRBuilderBase_O::static_className() % llvmo::IRBuilderBase_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::InsertPoint_O @ %X\") % classllvmo__InsertPoint_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::InsertPoint_O::static_className() % llvmo::InsertPoint_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::LLVMContext_O @ %X\") % classllvmo__LLVMContext_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::LLVMContext_O::static_className() % llvmo::LLVMContext_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::Module_O @ %X\") % classllvmo__Module_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::Module_O::static_className() % llvmo::Module_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::PassManagerBase_O @ %X\") % classllvmo__PassManagerBase_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::PassManagerBase_O::static_className() % llvmo::PassManagerBase_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::Pass_O @ %X\") % classllvmo__Pass_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::Pass_O::static_className() % llvmo::Pass_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::Type_O @ %X\") % classllvmo__Type_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::Type_O::static_className() % llvmo::Type_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::Value_O @ %X\") % classllvmo__Value_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::Value_O::static_className() % llvmo::Value_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::Argument_O @ %X\") % classllvmo__Argument_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::Argument_O::static_className() % llvmo::Argument_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::BasicBlock_O @ %X\") % classllvmo__BasicBlock_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::BasicBlock_O::static_className() % llvmo::BasicBlock_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::CompositeType_O @ %X\") % classllvmo__CompositeType_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::CompositeType_O::static_className() % llvmo::CompositeType_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::FunctionPassManager_O @ %X\") % classllvmo__FunctionPassManager_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::FunctionPassManager_O::static_className() % llvmo::FunctionPassManager_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::FunctionPass_O @ %X\") % classllvmo__FunctionPass_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::FunctionPass_O::static_className() % llvmo::FunctionPass_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::FunctionType_O @ %X\") % classllvmo__FunctionType_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::FunctionType_O::static_className() % llvmo::FunctionType_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::IRBuilder_O @ %X\") % classllvmo__IRBuilder_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::IRBuilder_O::static_className() % llvmo::IRBuilder_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::IntegerType_O @ %X\") % classllvmo__IntegerType_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::IntegerType_O::static_className() % llvmo::IntegerType_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::MDNode_O @ %X\") % classllvmo__MDNode_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::MDNode_O::static_className() % llvmo::MDNode_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::MDString_O @ %X\") % classllvmo__MDString_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::MDString_O::static_className() % llvmo::MDString_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::ModulePass_O @ %X\") % classllvmo__ModulePass_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::ModulePass_O::static_className() % llvmo::ModulePass_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::User_O @ %X\") % classllvmo__User_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::User_O::static_className() % llvmo::User_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::Constant_O @ %X\") % classllvmo__Constant_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::Constant_O::static_className() % llvmo::Constant_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::ImmutablePass_O @ %X\") % classllvmo__ImmutablePass_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::ImmutablePass_O::static_className() % llvmo::ImmutablePass_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::Instruction_O @ %X\") % classllvmo__Instruction_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::Instruction_O::static_className() % llvmo::Instruction_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::SequentialType_O @ %X\") % classllvmo__SequentialType_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::SequentialType_O::static_className() % llvmo::SequentialType_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::StructType_O @ %X\") % classllvmo__StructType_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::StructType_O::static_className() % llvmo::StructType_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::ArrayType_O @ %X\") % classllvmo__ArrayType_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::ArrayType_O::static_className() % llvmo::ArrayType_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::AtomicCmpXchgInst_O @ %X\") % classllvmo__AtomicCmpXchgInst_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::AtomicCmpXchgInst_O::static_className() % llvmo::AtomicCmpXchgInst_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::AtomicRMWInst_O @ %X\") % classllvmo__AtomicRMWInst_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::AtomicRMWInst_O::static_className() % llvmo::AtomicRMWInst_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::CallInst_O @ %X\") % classllvmo__CallInst_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::CallInst_O::static_className() % llvmo::CallInst_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::ConstantArray_O @ %X\") % classllvmo__ConstantArray_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::ConstantArray_O::static_className() % llvmo::ConstantArray_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::ConstantDataSequential_O @ %X\") % classllvmo__ConstantDataSequential_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::ConstantDataSequential_O::static_className() % llvmo::ConstantDataSequential_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::ConstantExpr_O @ %X\") % classllvmo__ConstantExpr_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::ConstantExpr_O::static_className() % llvmo::ConstantExpr_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::ConstantFP_O @ %X\") % classllvmo__ConstantFP_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::ConstantFP_O::static_className() % llvmo::ConstantFP_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::ConstantInt_O @ %X\") % classllvmo__ConstantInt_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::ConstantInt_O::static_className() % llvmo::ConstantInt_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::ConstantPointerNull_O @ %X\") % classllvmo__ConstantPointerNull_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::ConstantPointerNull_O::static_className() % llvmo::ConstantPointerNull_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::DataLayout_O @ %X\") % classllvmo__DataLayout_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::DataLayout_O::static_className() % llvmo::DataLayout_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::FenceInst_O @ %X\") % classllvmo__FenceInst_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::FenceInst_O::static_className() % llvmo::FenceInst_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::GlobalValue_O @ %X\") % classllvmo__GlobalValue_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::GlobalValue_O::static_className() % llvmo::GlobalValue_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::LandingPadInst_O @ %X\") % classllvmo__LandingPadInst_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::LandingPadInst_O::static_className() % llvmo::LandingPadInst_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::PHINode_O @ %X\") % classllvmo__PHINode_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::PHINode_O::static_className() % llvmo::PHINode_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::PointerType_O @ %X\") % classllvmo__PointerType_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::PointerType_O::static_className() % llvmo::PointerType_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::StoreInst_O @ %X\") % classllvmo__StoreInst_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::StoreInst_O::static_className() % llvmo::StoreInst_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::TerminatorInst_O @ %X\") % classllvmo__TerminatorInst_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::TerminatorInst_O::static_className() % llvmo::TerminatorInst_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::UnaryInstruction_O @ %X\") % classllvmo__UnaryInstruction_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::UnaryInstruction_O::static_className() % llvmo::UnaryInstruction_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::UndefValue_O @ %X\") % classllvmo__UndefValue_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::UndefValue_O::static_className() % llvmo::UndefValue_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::VectorType_O @ %X\") % classllvmo__VectorType_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::VectorType_O::static_className() % llvmo::VectorType_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::AllocaInst_O @ %X\") % classllvmo__AllocaInst_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::AllocaInst_O::static_className() % llvmo::AllocaInst_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::BranchInst_O @ %X\") % classllvmo__BranchInst_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::BranchInst_O::static_className() % llvmo::BranchInst_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::ConstantDataArray_O @ %X\") % classllvmo__ConstantDataArray_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::ConstantDataArray_O::static_className() % llvmo::ConstantDataArray_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::Function_O @ %X\") % classllvmo__Function_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::Function_O::static_className() % llvmo::Function_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::GlobalVariable_O @ %X\") % classllvmo__GlobalVariable_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::GlobalVariable_O::static_className() % llvmo::GlobalVariable_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::IndirectBrInst_O @ %X\") % classllvmo__IndirectBrInst_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::IndirectBrInst_O::static_className() % llvmo::IndirectBrInst_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::InvokeInst_O @ %X\") % classllvmo__InvokeInst_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::InvokeInst_O::static_className() % llvmo::InvokeInst_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::LoadInst_O @ %X\") % classllvmo__LoadInst_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::LoadInst_O::static_className() % llvmo::LoadInst_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::ResumeInst_O @ %X\") % classllvmo__ResumeInst_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::ResumeInst_O::static_className() % llvmo::ResumeInst_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::ReturnInst_O @ %X\") % classllvmo__ReturnInst_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::ReturnInst_O::static_className() % llvmo::ReturnInst_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::SwitchInst_O @ %X\") % classllvmo__SwitchInst_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::SwitchInst_O::static_className() % llvmo::SwitchInst_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::UnreachableInst_O @ %X\") % classllvmo__UnreachableInst_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::UnreachableInst_O::static_className() % llvmo::UnreachableInst_O::static_classSymbol() );\n\n LOG(BF(\"--- dump_info --- className: llvmo::VAArgInst_O @ %X\") % classllvmo__VAArgInst_Oval.get());\n LOG(BF(\"%s::static_classSymbol() = %d\") % llvmo::VAArgInst_O::static_className() % llvmo::VAArgInst_O::static_classSymbol() );\n#endif // } DUMP_INFO_CLASS\n#undef DUMP_INFO_CLASS\n#if defined(DEFINE_BASE_CLASSES) || defined(ALL_STAGES) // {\n// Depends on nothing\nclassllvmo__APFloat_Oval->addInstanceBaseClass(core::ExternalObject_O::static_classSymbol());\nclassllvmo__APInt_Oval->addInstanceBaseClass(core::ExternalObject_O::static_classSymbol());\nclassllvmo__Attribute_Oval->addInstanceBaseClass(core::T_O::static_classSymbol());\nclassllvmo__Builder_Oval->addInstanceBaseClass(core::ExternalObject_O::static_classSymbol());\nclassllvmo__DebugLoc_Oval->addInstanceBaseClass(core::T_O::static_classSymbol());\nclassllvmo__EngineBuilder_Oval->addInstanceBaseClass(core::ExternalObject_O::static_classSymbol());\nclassllvmo__ExecutionEngine_Oval->addInstanceBaseClass(core::ExternalObject_O::static_classSymbol());\nclassllvmo__IRBuilderBase_Oval->addInstanceBaseClass(core::ExternalObject_O::static_classSymbol());\nclassllvmo__InsertPoint_Oval->addInstanceBaseClass(core::T_O::static_classSymbol());\nclassllvmo__LLVMContext_Oval->addInstanceBaseClass(core::ExternalObject_O::static_classSymbol());\nclassllvmo__Module_Oval->addInstanceBaseClass(core::ExternalObject_O::static_classSymbol());\nclassllvmo__PassManagerBase_Oval->addInstanceBaseClass(core::ExternalObject_O::static_classSymbol());\nclassllvmo__Pass_Oval->addInstanceBaseClass(core::ExternalObject_O::static_classSymbol());\nclassllvmo__Type_Oval->addInstanceBaseClass(core::ExternalObject_O::static_classSymbol());\nclassllvmo__Value_Oval->addInstanceBaseClass(core::ExternalObject_O::static_classSymbol());\nclassllvmo__Argument_Oval->addInstanceBaseClass(llvmo::Value_O::static_classSymbol());\nclassllvmo__BasicBlock_Oval->addInstanceBaseClass(llvmo::Value_O::static_classSymbol());\nclassllvmo__CompositeType_Oval->addInstanceBaseClass(llvmo::Type_O::static_classSymbol());\nclassllvmo__FunctionPassManager_Oval->addInstanceBaseClass(llvmo::PassManagerBase_O::static_classSymbol());\nclassllvmo__FunctionPass_Oval->addInstanceBaseClass(llvmo::Pass_O::static_classSymbol());\nclassllvmo__FunctionType_Oval->addInstanceBaseClass(llvmo::Type_O::static_classSymbol());\nclassllvmo__IRBuilder_Oval->addInstanceBaseClass(llvmo::IRBuilderBase_O::static_classSymbol());\nclassllvmo__IntegerType_Oval->addInstanceBaseClass(llvmo::Type_O::static_classSymbol());\nclassllvmo__MDNode_Oval->addInstanceBaseClass(llvmo::Value_O::static_classSymbol());\nclassllvmo__MDString_Oval->addInstanceBaseClass(llvmo::Value_O::static_classSymbol());\nclassllvmo__ModulePass_Oval->addInstanceBaseClass(llvmo::Pass_O::static_classSymbol());\nclassllvmo__User_Oval->addInstanceBaseClass(llvmo::Value_O::static_classSymbol());\nclassllvmo__Constant_Oval->addInstanceBaseClass(llvmo::User_O::static_classSymbol());\nclassllvmo__ImmutablePass_Oval->addInstanceBaseClass(llvmo::ModulePass_O::static_classSymbol());\nclassllvmo__Instruction_Oval->addInstanceBaseClass(llvmo::User_O::static_classSymbol());\nclassllvmo__SequentialType_Oval->addInstanceBaseClass(llvmo::CompositeType_O::static_classSymbol());\nclassllvmo__StructType_Oval->addInstanceBaseClass(llvmo::CompositeType_O::static_classSymbol());\nclassllvmo__ArrayType_Oval->addInstanceBaseClass(llvmo::SequentialType_O::static_classSymbol());\nclassllvmo__AtomicCmpXchgInst_Oval->addInstanceBaseClass(llvmo::Instruction_O::static_classSymbol());\nclassllvmo__AtomicRMWInst_Oval->addInstanceBaseClass(llvmo::Instruction_O::static_classSymbol());\nclassllvmo__CallInst_Oval->addInstanceBaseClass(llvmo::Instruction_O::static_classSymbol());\nclassllvmo__ConstantArray_Oval->addInstanceBaseClass(llvmo::Constant_O::static_classSymbol());\nclassllvmo__ConstantDataSequential_Oval->addInstanceBaseClass(llvmo::Constant_O::static_classSymbol());\nclassllvmo__ConstantExpr_Oval->addInstanceBaseClass(llvmo::Constant_O::static_classSymbol());\nclassllvmo__ConstantFP_Oval->addInstanceBaseClass(llvmo::Constant_O::static_classSymbol());\nclassllvmo__ConstantInt_Oval->addInstanceBaseClass(llvmo::Constant_O::static_classSymbol());\nclassllvmo__ConstantPointerNull_Oval->addInstanceBaseClass(llvmo::Constant_O::static_classSymbol());\nclassllvmo__DataLayout_Oval->addInstanceBaseClass(llvmo::ImmutablePass_O::static_classSymbol());\nclassllvmo__FenceInst_Oval->addInstanceBaseClass(llvmo::Instruction_O::static_classSymbol());\nclassllvmo__GlobalValue_Oval->addInstanceBaseClass(llvmo::Constant_O::static_classSymbol());\nclassllvmo__LandingPadInst_Oval->addInstanceBaseClass(llvmo::Instruction_O::static_classSymbol());\nclassllvmo__PHINode_Oval->addInstanceBaseClass(llvmo::Instruction_O::static_classSymbol());\nclassllvmo__PointerType_Oval->addInstanceBaseClass(llvmo::SequentialType_O::static_classSymbol());\nclassllvmo__StoreInst_Oval->addInstanceBaseClass(llvmo::Instruction_O::static_classSymbol());\nclassllvmo__TerminatorInst_Oval->addInstanceBaseClass(llvmo::Instruction_O::static_classSymbol());\nclassllvmo__UnaryInstruction_Oval->addInstanceBaseClass(llvmo::Instruction_O::static_classSymbol());\nclassllvmo__UndefValue_Oval->addInstanceBaseClass(llvmo::Constant_O::static_classSymbol());\nclassllvmo__VectorType_Oval->addInstanceBaseClass(llvmo::SequentialType_O::static_classSymbol());\nclassllvmo__AllocaInst_Oval->addInstanceBaseClass(llvmo::UnaryInstruction_O::static_classSymbol());\nclassllvmo__BranchInst_Oval->addInstanceBaseClass(llvmo::TerminatorInst_O::static_classSymbol());\nclassllvmo__ConstantDataArray_Oval->addInstanceBaseClass(llvmo::ConstantDataSequential_O::static_classSymbol());\nclassllvmo__Function_Oval->addInstanceBaseClass(llvmo::GlobalValue_O::static_classSymbol());\nclassllvmo__GlobalVariable_Oval->addInstanceBaseClass(llvmo::GlobalValue_O::static_classSymbol());\nclassllvmo__IndirectBrInst_Oval->addInstanceBaseClass(llvmo::TerminatorInst_O::static_classSymbol());\nclassllvmo__InvokeInst_Oval->addInstanceBaseClass(llvmo::TerminatorInst_O::static_classSymbol());\nclassllvmo__LoadInst_Oval->addInstanceBaseClass(llvmo::UnaryInstruction_O::static_classSymbol());\nclassllvmo__ResumeInst_Oval->addInstanceBaseClass(llvmo::TerminatorInst_O::static_classSymbol());\nclassllvmo__ReturnInst_Oval->addInstanceBaseClass(llvmo::TerminatorInst_O::static_classSymbol());\nclassllvmo__SwitchInst_Oval->addInstanceBaseClass(llvmo::TerminatorInst_O::static_classSymbol());\nclassllvmo__UnreachableInst_Oval->addInstanceBaseClass(llvmo::TerminatorInst_O::static_classSymbol());\nclassllvmo__VAArgInst_Oval->addInstanceBaseClass(llvmo::UnaryInstruction_O::static_classSymbol());\n#endif // } DEFINE_BASE_CLASSES\n#undef DEFINE_BASE_CLASSES\n#if defined(DEFINE_CLASS_NAMES) || defined(ALL_STAGES) // {\n core::Package_sp _curPkg = _lisp->findPackage(CurrentPkg);\n// Depends on nothing\n\n classllvmo__APFloat_Oval->__setup_stage3_name(llvmo::APFloat_O::static_classSymbol());\n\n classllvmo__APInt_Oval->__setup_stage3_name(llvmo::APInt_O::static_classSymbol());\n\n classllvmo__Attribute_Oval->__setup_stage3_name(llvmo::Attribute_O::static_classSymbol());\n\n classllvmo__Builder_Oval->__setup_stage3_name(llvmo::Builder_O::static_classSymbol());\n\n classllvmo__DebugLoc_Oval->__setup_stage3_name(llvmo::DebugLoc_O::static_classSymbol());\n\n classllvmo__EngineBuilder_Oval->__setup_stage3_name(llvmo::EngineBuilder_O::static_classSymbol());\n\n classllvmo__ExecutionEngine_Oval->__setup_stage3_name(llvmo::ExecutionEngine_O::static_classSymbol());\n\n classllvmo__IRBuilderBase_Oval->__setup_stage3_name(llvmo::IRBuilderBase_O::static_classSymbol());\n\n classllvmo__InsertPoint_Oval->__setup_stage3_name(llvmo::InsertPoint_O::static_classSymbol());\n\n classllvmo__LLVMContext_Oval->__setup_stage3_name(llvmo::LLVMContext_O::static_classSymbol());\n\n classllvmo__Module_Oval->__setup_stage3_name(llvmo::Module_O::static_classSymbol());\n\n classllvmo__PassManagerBase_Oval->__setup_stage3_name(llvmo::PassManagerBase_O::static_classSymbol());\n\n classllvmo__Pass_Oval->__setup_stage3_name(llvmo::Pass_O::static_classSymbol());\n\n classllvmo__Type_Oval->__setup_stage3_name(llvmo::Type_O::static_classSymbol());\n\n classllvmo__Value_Oval->__setup_stage3_name(llvmo::Value_O::static_classSymbol());\n\n classllvmo__Argument_Oval->__setup_stage3_name(llvmo::Argument_O::static_classSymbol());\n\n classllvmo__BasicBlock_Oval->__setup_stage3_name(llvmo::BasicBlock_O::static_classSymbol());\n\n classllvmo__CompositeType_Oval->__setup_stage3_name(llvmo::CompositeType_O::static_classSymbol());\n\n classllvmo__FunctionPassManager_Oval->__setup_stage3_name(llvmo::FunctionPassManager_O::static_classSymbol());\n\n classllvmo__FunctionPass_Oval->__setup_stage3_name(llvmo::FunctionPass_O::static_classSymbol());\n\n classllvmo__FunctionType_Oval->__setup_stage3_name(llvmo::FunctionType_O::static_classSymbol());\n\n classllvmo__IRBuilder_Oval->__setup_stage3_name(llvmo::IRBuilder_O::static_classSymbol());\n\n classllvmo__IntegerType_Oval->__setup_stage3_name(llvmo::IntegerType_O::static_classSymbol());\n\n classllvmo__MDNode_Oval->__setup_stage3_name(llvmo::MDNode_O::static_classSymbol());\n\n classllvmo__MDString_Oval->__setup_stage3_name(llvmo::MDString_O::static_classSymbol());\n\n classllvmo__ModulePass_Oval->__setup_stage3_name(llvmo::ModulePass_O::static_classSymbol());\n\n classllvmo__User_Oval->__setup_stage3_name(llvmo::User_O::static_classSymbol());\n\n classllvmo__Constant_Oval->__setup_stage3_name(llvmo::Constant_O::static_classSymbol());\n\n classllvmo__ImmutablePass_Oval->__setup_stage3_name(llvmo::ImmutablePass_O::static_classSymbol());\n\n classllvmo__Instruction_Oval->__setup_stage3_name(llvmo::Instruction_O::static_classSymbol());\n\n classllvmo__SequentialType_Oval->__setup_stage3_name(llvmo::SequentialType_O::static_classSymbol());\n\n classllvmo__StructType_Oval->__setup_stage3_name(llvmo::StructType_O::static_classSymbol());\n\n classllvmo__ArrayType_Oval->__setup_stage3_name(llvmo::ArrayType_O::static_classSymbol());\n\n classllvmo__AtomicCmpXchgInst_Oval->__setup_stage3_name(llvmo::AtomicCmpXchgInst_O::static_classSymbol());\n\n classllvmo__AtomicRMWInst_Oval->__setup_stage3_name(llvmo::AtomicRMWInst_O::static_classSymbol());\n\n classllvmo__CallInst_Oval->__setup_stage3_name(llvmo::CallInst_O::static_classSymbol());\n\n classllvmo__ConstantArray_Oval->__setup_stage3_name(llvmo::ConstantArray_O::static_classSymbol());\n\n classllvmo__ConstantDataSequential_Oval->__setup_stage3_name(llvmo::ConstantDataSequential_O::static_classSymbol());\n\n classllvmo__ConstantExpr_Oval->__setup_stage3_name(llvmo::ConstantExpr_O::static_classSymbol());\n\n classllvmo__ConstantFP_Oval->__setup_stage3_name(llvmo::ConstantFP_O::static_classSymbol());\n\n classllvmo__ConstantInt_Oval->__setup_stage3_name(llvmo::ConstantInt_O::static_classSymbol());\n\n classllvmo__ConstantPointerNull_Oval->__setup_stage3_name(llvmo::ConstantPointerNull_O::static_classSymbol());\n\n classllvmo__DataLayout_Oval->__setup_stage3_name(llvmo::DataLayout_O::static_classSymbol());\n\n classllvmo__FenceInst_Oval->__setup_stage3_name(llvmo::FenceInst_O::static_classSymbol());\n\n classllvmo__GlobalValue_Oval->__setup_stage3_name(llvmo::GlobalValue_O::static_classSymbol());\n\n classllvmo__LandingPadInst_Oval->__setup_stage3_name(llvmo::LandingPadInst_O::static_classSymbol());\n\n classllvmo__PHINode_Oval->__setup_stage3_name(llvmo::PHINode_O::static_classSymbol());\n\n classllvmo__PointerType_Oval->__setup_stage3_name(llvmo::PointerType_O::static_classSymbol());\n\n classllvmo__StoreInst_Oval->__setup_stage3_name(llvmo::StoreInst_O::static_classSymbol());\n\n classllvmo__TerminatorInst_Oval->__setup_stage3_name(llvmo::TerminatorInst_O::static_classSymbol());\n\n classllvmo__UnaryInstruction_Oval->__setup_stage3_name(llvmo::UnaryInstruction_O::static_classSymbol());\n\n classllvmo__UndefValue_Oval->__setup_stage3_name(llvmo::UndefValue_O::static_classSymbol());\n\n classllvmo__VectorType_Oval->__setup_stage3_name(llvmo::VectorType_O::static_classSymbol());\n\n classllvmo__AllocaInst_Oval->__setup_stage3_name(llvmo::AllocaInst_O::static_classSymbol());\n\n classllvmo__BranchInst_Oval->__setup_stage3_name(llvmo::BranchInst_O::static_classSymbol());\n\n classllvmo__ConstantDataArray_Oval->__setup_stage3_name(llvmo::ConstantDataArray_O::static_classSymbol());\n\n classllvmo__Function_Oval->__setup_stage3_name(llvmo::Function_O::static_classSymbol());\n\n classllvmo__GlobalVariable_Oval->__setup_stage3_name(llvmo::GlobalVariable_O::static_classSymbol());\n\n classllvmo__IndirectBrInst_Oval->__setup_stage3_name(llvmo::IndirectBrInst_O::static_classSymbol());\n\n classllvmo__InvokeInst_Oval->__setup_stage3_name(llvmo::InvokeInst_O::static_classSymbol());\n\n classllvmo__LoadInst_Oval->__setup_stage3_name(llvmo::LoadInst_O::static_classSymbol());\n\n classllvmo__ResumeInst_Oval->__setup_stage3_name(llvmo::ResumeInst_O::static_classSymbol());\n\n classllvmo__ReturnInst_Oval->__setup_stage3_name(llvmo::ReturnInst_O::static_classSymbol());\n\n classllvmo__SwitchInst_Oval->__setup_stage3_name(llvmo::SwitchInst_O::static_classSymbol());\n\n classllvmo__UnreachableInst_Oval->__setup_stage3_name(llvmo::UnreachableInst_O::static_classSymbol());\n\n classllvmo__VAArgInst_Oval->__setup_stage3_name(llvmo::VAArgInst_O::static_classSymbol());\n#endif // } DEFINE_CLASS_NAMES\n#undef DEFINE_CLASS_NAMES\n#if defined(EXPOSE_TO_CANDO) || defined(ALL_STAGES)\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__APFloat_O(core::Lisp_sp); // base(s): set(['core::ExternalObject_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__APFloat_O\");\n Register_llvmo__APFloat_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__APInt_O(core::Lisp_sp); // base(s): set(['core::ExternalObject_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__APInt_O\");\n Register_llvmo__APInt_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__Attribute_O(core::Lisp_sp); // base(s): set(['core::T_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__Attribute_O\");\n Register_llvmo__Attribute_O(_lisp); // base(s): set(['core::T_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__Builder_O(core::Lisp_sp); // base(s): set(['core::ExternalObject_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__Builder_O\");\n Register_llvmo__Builder_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__DebugLoc_O(core::Lisp_sp); // base(s): set(['core::T_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__DebugLoc_O\");\n Register_llvmo__DebugLoc_O(_lisp); // base(s): set(['core::T_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__EngineBuilder_O(core::Lisp_sp); // base(s): set(['core::ExternalObject_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__EngineBuilder_O\");\n Register_llvmo__EngineBuilder_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__ExecutionEngine_O(core::Lisp_sp); // base(s): set(['core::ExternalObject_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__ExecutionEngine_O\");\n Register_llvmo__ExecutionEngine_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__IRBuilderBase_O(core::Lisp_sp); // base(s): set(['core::ExternalObject_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__IRBuilderBase_O\");\n Register_llvmo__IRBuilderBase_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__InsertPoint_O(core::Lisp_sp); // base(s): set(['core::T_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__InsertPoint_O\");\n Register_llvmo__InsertPoint_O(_lisp); // base(s): set(['core::T_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__LLVMContext_O(core::Lisp_sp); // base(s): set(['core::ExternalObject_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__LLVMContext_O\");\n Register_llvmo__LLVMContext_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__Module_O(core::Lisp_sp); // base(s): set(['core::ExternalObject_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__Module_O\");\n Register_llvmo__Module_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__PassManagerBase_O(core::Lisp_sp); // base(s): set(['core::ExternalObject_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__PassManagerBase_O\");\n Register_llvmo__PassManagerBase_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__Pass_O(core::Lisp_sp); // base(s): set(['core::ExternalObject_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__Pass_O\");\n Register_llvmo__Pass_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__Type_O(core::Lisp_sp); // base(s): set(['core::ExternalObject_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__Type_O\");\n Register_llvmo__Type_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__Value_O(core::Lisp_sp); // base(s): set(['core::ExternalObject_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__Value_O\");\n Register_llvmo__Value_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__Argument_O(core::Lisp_sp); // base(s): set(['llvmo::Value_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__Argument_O\");\n Register_llvmo__Argument_O(_lisp); // base(s): set(['llvmo::Value_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__BasicBlock_O(core::Lisp_sp); // base(s): set(['llvmo::Value_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__BasicBlock_O\");\n Register_llvmo__BasicBlock_O(_lisp); // base(s): set(['llvmo::Value_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__CompositeType_O(core::Lisp_sp); // base(s): set(['llvmo::Type_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__CompositeType_O\");\n Register_llvmo__CompositeType_O(_lisp); // base(s): set(['llvmo::Type_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__FunctionPassManager_O(core::Lisp_sp); // base(s): set(['llvmo::PassManagerBase_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__FunctionPassManager_O\");\n Register_llvmo__FunctionPassManager_O(_lisp); // base(s): set(['llvmo::PassManagerBase_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__FunctionPass_O(core::Lisp_sp); // base(s): set(['llvmo::Pass_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__FunctionPass_O\");\n Register_llvmo__FunctionPass_O(_lisp); // base(s): set(['llvmo::Pass_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__FunctionType_O(core::Lisp_sp); // base(s): set(['llvmo::Type_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__FunctionType_O\");\n Register_llvmo__FunctionType_O(_lisp); // base(s): set(['llvmo::Type_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__IRBuilder_O(core::Lisp_sp); // base(s): set(['llvmo::IRBuilderBase_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__IRBuilder_O\");\n Register_llvmo__IRBuilder_O(_lisp); // base(s): set(['llvmo::IRBuilderBase_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__IntegerType_O(core::Lisp_sp); // base(s): set(['llvmo::Type_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__IntegerType_O\");\n Register_llvmo__IntegerType_O(_lisp); // base(s): set(['llvmo::Type_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__MDNode_O(core::Lisp_sp); // base(s): set(['llvmo::Value_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__MDNode_O\");\n Register_llvmo__MDNode_O(_lisp); // base(s): set(['llvmo::Value_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__MDString_O(core::Lisp_sp); // base(s): set(['llvmo::Value_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__MDString_O\");\n Register_llvmo__MDString_O(_lisp); // base(s): set(['llvmo::Value_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__ModulePass_O(core::Lisp_sp); // base(s): set(['llvmo::Pass_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__ModulePass_O\");\n Register_llvmo__ModulePass_O(_lisp); // base(s): set(['llvmo::Pass_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__User_O(core::Lisp_sp); // base(s): set(['llvmo::Value_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__User_O\");\n Register_llvmo__User_O(_lisp); // base(s): set(['llvmo::Value_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__Constant_O(core::Lisp_sp); // base(s): set(['llvmo::User_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__Constant_O\");\n Register_llvmo__Constant_O(_lisp); // base(s): set(['llvmo::User_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__ImmutablePass_O(core::Lisp_sp); // base(s): set(['llvmo::ModulePass_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__ImmutablePass_O\");\n Register_llvmo__ImmutablePass_O(_lisp); // base(s): set(['llvmo::ModulePass_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__Instruction_O(core::Lisp_sp); // base(s): set(['llvmo::User_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__Instruction_O\");\n Register_llvmo__Instruction_O(_lisp); // base(s): set(['llvmo::User_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__SequentialType_O(core::Lisp_sp); // base(s): set(['llvmo::CompositeType_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__SequentialType_O\");\n Register_llvmo__SequentialType_O(_lisp); // base(s): set(['llvmo::CompositeType_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__StructType_O(core::Lisp_sp); // base(s): set(['llvmo::CompositeType_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__StructType_O\");\n Register_llvmo__StructType_O(_lisp); // base(s): set(['llvmo::CompositeType_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__ArrayType_O(core::Lisp_sp); // base(s): set(['llvmo::SequentialType_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__ArrayType_O\");\n Register_llvmo__ArrayType_O(_lisp); // base(s): set(['llvmo::SequentialType_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__AtomicCmpXchgInst_O(core::Lisp_sp); // base(s): set(['llvmo::Instruction_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__AtomicCmpXchgInst_O\");\n Register_llvmo__AtomicCmpXchgInst_O(_lisp); // base(s): set(['llvmo::Instruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__AtomicRMWInst_O(core::Lisp_sp); // base(s): set(['llvmo::Instruction_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__AtomicRMWInst_O\");\n Register_llvmo__AtomicRMWInst_O(_lisp); // base(s): set(['llvmo::Instruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__CallInst_O(core::Lisp_sp); // base(s): set(['llvmo::Instruction_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__CallInst_O\");\n Register_llvmo__CallInst_O(_lisp); // base(s): set(['llvmo::Instruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__ConstantArray_O(core::Lisp_sp); // base(s): set(['llvmo::Constant_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__ConstantArray_O\");\n Register_llvmo__ConstantArray_O(_lisp); // base(s): set(['llvmo::Constant_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__ConstantDataSequential_O(core::Lisp_sp); // base(s): set(['llvmo::Constant_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__ConstantDataSequential_O\");\n Register_llvmo__ConstantDataSequential_O(_lisp); // base(s): set(['llvmo::Constant_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__ConstantExpr_O(core::Lisp_sp); // base(s): set(['llvmo::Constant_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__ConstantExpr_O\");\n Register_llvmo__ConstantExpr_O(_lisp); // base(s): set(['llvmo::Constant_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__ConstantFP_O(core::Lisp_sp); // base(s): set(['llvmo::Constant_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__ConstantFP_O\");\n Register_llvmo__ConstantFP_O(_lisp); // base(s): set(['llvmo::Constant_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__ConstantInt_O(core::Lisp_sp); // base(s): set(['llvmo::Constant_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__ConstantInt_O\");\n Register_llvmo__ConstantInt_O(_lisp); // base(s): set(['llvmo::Constant_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__ConstantPointerNull_O(core::Lisp_sp); // base(s): set(['llvmo::Constant_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__ConstantPointerNull_O\");\n Register_llvmo__ConstantPointerNull_O(_lisp); // base(s): set(['llvmo::Constant_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__DataLayout_O(core::Lisp_sp); // base(s): set(['llvmo::ImmutablePass_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__DataLayout_O\");\n Register_llvmo__DataLayout_O(_lisp); // base(s): set(['llvmo::ImmutablePass_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__FenceInst_O(core::Lisp_sp); // base(s): set(['llvmo::Instruction_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__FenceInst_O\");\n Register_llvmo__FenceInst_O(_lisp); // base(s): set(['llvmo::Instruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__GlobalValue_O(core::Lisp_sp); // base(s): set(['llvmo::Constant_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__GlobalValue_O\");\n Register_llvmo__GlobalValue_O(_lisp); // base(s): set(['llvmo::Constant_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__LandingPadInst_O(core::Lisp_sp); // base(s): set(['llvmo::Instruction_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__LandingPadInst_O\");\n Register_llvmo__LandingPadInst_O(_lisp); // base(s): set(['llvmo::Instruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__PHINode_O(core::Lisp_sp); // base(s): set(['llvmo::Instruction_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__PHINode_O\");\n Register_llvmo__PHINode_O(_lisp); // base(s): set(['llvmo::Instruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__PointerType_O(core::Lisp_sp); // base(s): set(['llvmo::SequentialType_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__PointerType_O\");\n Register_llvmo__PointerType_O(_lisp); // base(s): set(['llvmo::SequentialType_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__StoreInst_O(core::Lisp_sp); // base(s): set(['llvmo::Instruction_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__StoreInst_O\");\n Register_llvmo__StoreInst_O(_lisp); // base(s): set(['llvmo::Instruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__TerminatorInst_O(core::Lisp_sp); // base(s): set(['llvmo::Instruction_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__TerminatorInst_O\");\n Register_llvmo__TerminatorInst_O(_lisp); // base(s): set(['llvmo::Instruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__UnaryInstruction_O(core::Lisp_sp); // base(s): set(['llvmo::Instruction_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__UnaryInstruction_O\");\n Register_llvmo__UnaryInstruction_O(_lisp); // base(s): set(['llvmo::Instruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__UndefValue_O(core::Lisp_sp); // base(s): set(['llvmo::Constant_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__UndefValue_O\");\n Register_llvmo__UndefValue_O(_lisp); // base(s): set(['llvmo::Constant_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__VectorType_O(core::Lisp_sp); // base(s): set(['llvmo::SequentialType_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__VectorType_O\");\n Register_llvmo__VectorType_O(_lisp); // base(s): set(['llvmo::SequentialType_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__AllocaInst_O(core::Lisp_sp); // base(s): set(['llvmo::UnaryInstruction_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__AllocaInst_O\");\n Register_llvmo__AllocaInst_O(_lisp); // base(s): set(['llvmo::UnaryInstruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__BranchInst_O(core::Lisp_sp); // base(s): set(['llvmo::TerminatorInst_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__BranchInst_O\");\n Register_llvmo__BranchInst_O(_lisp); // base(s): set(['llvmo::TerminatorInst_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__ConstantDataArray_O(core::Lisp_sp); // base(s): set(['llvmo::ConstantDataSequential_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__ConstantDataArray_O\");\n Register_llvmo__ConstantDataArray_O(_lisp); // base(s): set(['llvmo::ConstantDataSequential_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__Function_O(core::Lisp_sp); // base(s): set(['llvmo::GlobalValue_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__Function_O\");\n Register_llvmo__Function_O(_lisp); // base(s): set(['llvmo::GlobalValue_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__GlobalVariable_O(core::Lisp_sp); // base(s): set(['llvmo::GlobalValue_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__GlobalVariable_O\");\n Register_llvmo__GlobalVariable_O(_lisp); // base(s): set(['llvmo::GlobalValue_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__IndirectBrInst_O(core::Lisp_sp); // base(s): set(['llvmo::TerminatorInst_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__IndirectBrInst_O\");\n Register_llvmo__IndirectBrInst_O(_lisp); // base(s): set(['llvmo::TerminatorInst_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__InvokeInst_O(core::Lisp_sp); // base(s): set(['llvmo::TerminatorInst_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__InvokeInst_O\");\n Register_llvmo__InvokeInst_O(_lisp); // base(s): set(['llvmo::TerminatorInst_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__LoadInst_O(core::Lisp_sp); // base(s): set(['llvmo::UnaryInstruction_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__LoadInst_O\");\n Register_llvmo__LoadInst_O(_lisp); // base(s): set(['llvmo::UnaryInstruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__ResumeInst_O(core::Lisp_sp); // base(s): set(['llvmo::TerminatorInst_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__ResumeInst_O\");\n Register_llvmo__ResumeInst_O(_lisp); // base(s): set(['llvmo::TerminatorInst_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__ReturnInst_O(core::Lisp_sp); // base(s): set(['llvmo::TerminatorInst_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__ReturnInst_O\");\n Register_llvmo__ReturnInst_O(_lisp); // base(s): set(['llvmo::TerminatorInst_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__SwitchInst_O(core::Lisp_sp); // base(s): set(['llvmo::TerminatorInst_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__SwitchInst_O\");\n Register_llvmo__SwitchInst_O(_lisp); // base(s): set(['llvmo::TerminatorInst_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__UnreachableInst_O(core::Lisp_sp); // base(s): set(['llvmo::TerminatorInst_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__UnreachableInst_O\");\n Register_llvmo__UnreachableInst_O(_lisp); // base(s): set(['llvmo::TerminatorInst_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Register_llvmo__VAArgInst_O(core::Lisp_sp); // base(s): set(['llvmo::UnaryInstruction_O'])\n{_BLOCK_TRACE(\"initializing Register_llvmo__VAArgInst_O\");\n Register_llvmo__VAArgInst_O(_lisp); // base(s): set(['llvmo::UnaryInstruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#endif // EXPOSE_TO_CANDO\n#undef EXPOSE_TO_CANDO\n#ifdef EXPOSE_TO_PYTHON\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__APFloat_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__APFloat_O\");\n\tCall_exposePython_llvmo__APFloat_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__APInt_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__APInt_O\");\n\tCall_exposePython_llvmo__APInt_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__Attribute_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__Attribute_O\");\n\tCall_exposePython_llvmo__Attribute_O(_lisp); // base(s): set(['core::T_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__Builder_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__Builder_O\");\n\tCall_exposePython_llvmo__Builder_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__DebugLoc_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__DebugLoc_O\");\n\tCall_exposePython_llvmo__DebugLoc_O(_lisp); // base(s): set(['core::T_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__EngineBuilder_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__EngineBuilder_O\");\n\tCall_exposePython_llvmo__EngineBuilder_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__ExecutionEngine_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__ExecutionEngine_O\");\n\tCall_exposePython_llvmo__ExecutionEngine_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__IRBuilderBase_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__IRBuilderBase_O\");\n\tCall_exposePython_llvmo__IRBuilderBase_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__InsertPoint_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__InsertPoint_O\");\n\tCall_exposePython_llvmo__InsertPoint_O(_lisp); // base(s): set(['core::T_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__LLVMContext_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__LLVMContext_O\");\n\tCall_exposePython_llvmo__LLVMContext_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__Module_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__Module_O\");\n\tCall_exposePython_llvmo__Module_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__PassManagerBase_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__PassManagerBase_O\");\n\tCall_exposePython_llvmo__PassManagerBase_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__Pass_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__Pass_O\");\n\tCall_exposePython_llvmo__Pass_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__Type_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__Type_O\");\n\tCall_exposePython_llvmo__Type_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__Value_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__Value_O\");\n\tCall_exposePython_llvmo__Value_O(_lisp); // base(s): set(['core::ExternalObject_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__Argument_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__Argument_O\");\n\tCall_exposePython_llvmo__Argument_O(_lisp); // base(s): set(['llvmo::Value_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__BasicBlock_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__BasicBlock_O\");\n\tCall_exposePython_llvmo__BasicBlock_O(_lisp); // base(s): set(['llvmo::Value_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__CompositeType_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__CompositeType_O\");\n\tCall_exposePython_llvmo__CompositeType_O(_lisp); // base(s): set(['llvmo::Type_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__FunctionPassManager_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__FunctionPassManager_O\");\n\tCall_exposePython_llvmo__FunctionPassManager_O(_lisp); // base(s): set(['llvmo::PassManagerBase_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__FunctionPass_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__FunctionPass_O\");\n\tCall_exposePython_llvmo__FunctionPass_O(_lisp); // base(s): set(['llvmo::Pass_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__FunctionType_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__FunctionType_O\");\n\tCall_exposePython_llvmo__FunctionType_O(_lisp); // base(s): set(['llvmo::Type_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__IRBuilder_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__IRBuilder_O\");\n\tCall_exposePython_llvmo__IRBuilder_O(_lisp); // base(s): set(['llvmo::IRBuilderBase_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__IntegerType_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__IntegerType_O\");\n\tCall_exposePython_llvmo__IntegerType_O(_lisp); // base(s): set(['llvmo::Type_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__MDNode_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__MDNode_O\");\n\tCall_exposePython_llvmo__MDNode_O(_lisp); // base(s): set(['llvmo::Value_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__MDString_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__MDString_O\");\n\tCall_exposePython_llvmo__MDString_O(_lisp); // base(s): set(['llvmo::Value_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__ModulePass_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__ModulePass_O\");\n\tCall_exposePython_llvmo__ModulePass_O(_lisp); // base(s): set(['llvmo::Pass_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__User_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__User_O\");\n\tCall_exposePython_llvmo__User_O(_lisp); // base(s): set(['llvmo::Value_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__Constant_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__Constant_O\");\n\tCall_exposePython_llvmo__Constant_O(_lisp); // base(s): set(['llvmo::User_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__ImmutablePass_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__ImmutablePass_O\");\n\tCall_exposePython_llvmo__ImmutablePass_O(_lisp); // base(s): set(['llvmo::ModulePass_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__Instruction_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__Instruction_O\");\n\tCall_exposePython_llvmo__Instruction_O(_lisp); // base(s): set(['llvmo::User_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__SequentialType_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__SequentialType_O\");\n\tCall_exposePython_llvmo__SequentialType_O(_lisp); // base(s): set(['llvmo::CompositeType_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__StructType_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__StructType_O\");\n\tCall_exposePython_llvmo__StructType_O(_lisp); // base(s): set(['llvmo::CompositeType_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__ArrayType_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__ArrayType_O\");\n\tCall_exposePython_llvmo__ArrayType_O(_lisp); // base(s): set(['llvmo::SequentialType_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__AtomicCmpXchgInst_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__AtomicCmpXchgInst_O\");\n\tCall_exposePython_llvmo__AtomicCmpXchgInst_O(_lisp); // base(s): set(['llvmo::Instruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__AtomicRMWInst_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__AtomicRMWInst_O\");\n\tCall_exposePython_llvmo__AtomicRMWInst_O(_lisp); // base(s): set(['llvmo::Instruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__CallInst_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__CallInst_O\");\n\tCall_exposePython_llvmo__CallInst_O(_lisp); // base(s): set(['llvmo::Instruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__ConstantArray_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__ConstantArray_O\");\n\tCall_exposePython_llvmo__ConstantArray_O(_lisp); // base(s): set(['llvmo::Constant_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__ConstantDataSequential_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__ConstantDataSequential_O\");\n\tCall_exposePython_llvmo__ConstantDataSequential_O(_lisp); // base(s): set(['llvmo::Constant_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__ConstantExpr_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__ConstantExpr_O\");\n\tCall_exposePython_llvmo__ConstantExpr_O(_lisp); // base(s): set(['llvmo::Constant_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__ConstantFP_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__ConstantFP_O\");\n\tCall_exposePython_llvmo__ConstantFP_O(_lisp); // base(s): set(['llvmo::Constant_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__ConstantInt_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__ConstantInt_O\");\n\tCall_exposePython_llvmo__ConstantInt_O(_lisp); // base(s): set(['llvmo::Constant_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__ConstantPointerNull_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__ConstantPointerNull_O\");\n\tCall_exposePython_llvmo__ConstantPointerNull_O(_lisp); // base(s): set(['llvmo::Constant_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__DataLayout_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__DataLayout_O\");\n\tCall_exposePython_llvmo__DataLayout_O(_lisp); // base(s): set(['llvmo::ImmutablePass_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__FenceInst_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__FenceInst_O\");\n\tCall_exposePython_llvmo__FenceInst_O(_lisp); // base(s): set(['llvmo::Instruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__GlobalValue_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__GlobalValue_O\");\n\tCall_exposePython_llvmo__GlobalValue_O(_lisp); // base(s): set(['llvmo::Constant_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__LandingPadInst_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__LandingPadInst_O\");\n\tCall_exposePython_llvmo__LandingPadInst_O(_lisp); // base(s): set(['llvmo::Instruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__PHINode_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__PHINode_O\");\n\tCall_exposePython_llvmo__PHINode_O(_lisp); // base(s): set(['llvmo::Instruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__PointerType_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__PointerType_O\");\n\tCall_exposePython_llvmo__PointerType_O(_lisp); // base(s): set(['llvmo::SequentialType_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__StoreInst_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__StoreInst_O\");\n\tCall_exposePython_llvmo__StoreInst_O(_lisp); // base(s): set(['llvmo::Instruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__TerminatorInst_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__TerminatorInst_O\");\n\tCall_exposePython_llvmo__TerminatorInst_O(_lisp); // base(s): set(['llvmo::Instruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__UnaryInstruction_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__UnaryInstruction_O\");\n\tCall_exposePython_llvmo__UnaryInstruction_O(_lisp); // base(s): set(['llvmo::Instruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__UndefValue_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__UndefValue_O\");\n\tCall_exposePython_llvmo__UndefValue_O(_lisp); // base(s): set(['llvmo::Constant_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__VectorType_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__VectorType_O\");\n\tCall_exposePython_llvmo__VectorType_O(_lisp); // base(s): set(['llvmo::SequentialType_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__AllocaInst_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__AllocaInst_O\");\n\tCall_exposePython_llvmo__AllocaInst_O(_lisp); // base(s): set(['llvmo::UnaryInstruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__BranchInst_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__BranchInst_O\");\n\tCall_exposePython_llvmo__BranchInst_O(_lisp); // base(s): set(['llvmo::TerminatorInst_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__ConstantDataArray_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__ConstantDataArray_O\");\n\tCall_exposePython_llvmo__ConstantDataArray_O(_lisp); // base(s): set(['llvmo::ConstantDataSequential_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__Function_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__Function_O\");\n\tCall_exposePython_llvmo__Function_O(_lisp); // base(s): set(['llvmo::GlobalValue_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__GlobalVariable_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__GlobalVariable_O\");\n\tCall_exposePython_llvmo__GlobalVariable_O(_lisp); // base(s): set(['llvmo::GlobalValue_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__IndirectBrInst_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__IndirectBrInst_O\");\n\tCall_exposePython_llvmo__IndirectBrInst_O(_lisp); // base(s): set(['llvmo::TerminatorInst_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__InvokeInst_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__InvokeInst_O\");\n\tCall_exposePython_llvmo__InvokeInst_O(_lisp); // base(s): set(['llvmo::TerminatorInst_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__LoadInst_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__LoadInst_O\");\n\tCall_exposePython_llvmo__LoadInst_O(_lisp); // base(s): set(['llvmo::UnaryInstruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__ResumeInst_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__ResumeInst_O\");\n\tCall_exposePython_llvmo__ResumeInst_O(_lisp); // base(s): set(['llvmo::TerminatorInst_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__ReturnInst_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__ReturnInst_O\");\n\tCall_exposePython_llvmo__ReturnInst_O(_lisp); // base(s): set(['llvmo::TerminatorInst_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__SwitchInst_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__SwitchInst_O\");\n\tCall_exposePython_llvmo__SwitchInst_O(_lisp); // base(s): set(['llvmo::TerminatorInst_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__UnreachableInst_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__UnreachableInst_O\");\n\tCall_exposePython_llvmo__UnreachableInst_O(_lisp); // base(s): set(['llvmo::TerminatorInst_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#ifdef Use_LlvmoPkg\nextern void Call_exposePython_llvmo__VAArgInst_O(::core::Lisp_sp lisp);\n{_DBG(\"exposing to python: llvmo__VAArgInst_O\");\n\tCall_exposePython_llvmo__VAArgInst_O(_lisp); // base(s): set(['llvmo::UnaryInstruction_O'])\n}\n#endif // ifdef Use_LlvmoPkg\n#endif // EXPOSE_TO_PYTHON\n#undef EXPOSE_TO_PYTHON\n#undef ALL_STAGES\n" }, { "path": "src/test/resources/samples/langs/C++/instances.inc", "content": "#include \"QPBO.h\"\n\n#ifdef _MSC_VER\n#pragma warning(disable: 4661)\n#endif\n\n// Instantiations\n\ntemplate class QPBO;\ntemplate class QPBO;\ntemplate class QPBO;\n\ntemplate <> \n\tinline void QPBO::get_type_information(char*& type_name, char*& type_format)\n{\n\ttype_name = \"int\";\n\ttype_format = \"d\";\n}\n\ntemplate <> \n\tinline void QPBO::get_type_information(char*& type_name, char*& type_format)\n{\n\ttype_name = \"float\";\n\ttype_format = \"f\";\n}\n\ntemplate <> \n\tinline void QPBO::get_type_information(char*& type_name, char*& type_format)\n{\n\ttype_name = \"double\";\n\ttype_format = \"Lf\";\n}\n\n\n" }, { "path": "src/test/resources/samples/langs/C++/json_reader.cpp", "content": "// Copyright 2007-2010 Baptiste Lepilleur\n// Distributed under MIT license, or public domain if desired and\n// recognized in your jurisdiction.\n// See file LICENSE for detail or copy at http://jsoncpp.sourceforge.net/LICENSE\n\n/*\nPermission is hereby granted, free of charge, to any person obtaining\na copy of this software and associated documentation files (the\n\"Software\"), to deal in the Software without restriction, including\nwithout limitation the rights to use, copy, modify, merge, publish,\ndistribute, sublicense, and/or sell copies of the Software, and to\npermit persons to whom the Software is furnished to do so, subject to\nthe following conditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\nNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE\nLIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\nOF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\nWITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n*/\n\n// Source - https://github.com/Ij888/ApacheCordovaRecipes/blob/6e8a2c1d9de7302f74bc3dbac54a021f0499bbb3/jqmsandbox/plugins/cordova-plugin-globalization/src/blackberry10/native/public/json_reader.cpp\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#if _MSC_VER >= 1400 // VC++ 8.0\n#pragma warning( disable : 4996 ) // disable warning about strdup being deprecated.\n#endif\n\nnamespace Json {\n\n// QNX is strict about declaring C symbols in the std namespace.\n#ifdef __QNXNTO__\nusing std::memcpy;\nusing std::sprintf;\nusing std::sscanf;\n#endif\n\n// Implementation of class Features\n// ////////////////////////////////\n\nFeatures::Features()\n : allowComments_( true )\n , strictRoot_( false )\n{\n}\n\n\nFeatures \nFeatures::all()\n{\n return Features();\n}\n\n\nFeatures \nFeatures::strictMode()\n{\n Features features;\n features.allowComments_ = false;\n features.strictRoot_ = true;\n return features;\n}\n\n// Implementation of class Reader\n// ////////////////////////////////\n\n\nstatic inline bool \nin( Reader::Char c, Reader::Char c1, Reader::Char c2, Reader::Char c3, Reader::Char c4 )\n{\n return c == c1 || c == c2 || c == c3 || c == c4;\n}\n\nstatic inline bool \nin( Reader::Char c, Reader::Char c1, Reader::Char c2, Reader::Char c3, Reader::Char c4, Reader::Char c5 )\n{\n return c == c1 || c == c2 || c == c3 || c == c4 || c == c5;\n}\n\n\nstatic bool \ncontainsNewLine( Reader::Location begin, \n Reader::Location end )\n{\n for ( ;begin < end; ++begin )\n if ( *begin == '\\n' || *begin == '\\r' )\n return true;\n return false;\n}\n\nstatic std::string codePointToUTF8(unsigned int cp)\n{\n std::string result;\n \n // based on description from http://en.wikipedia.org/wiki/UTF-8\n\n if (cp <= 0x7f) \n {\n result.resize(1);\n result[0] = static_cast(cp);\n } \n else if (cp <= 0x7FF) \n {\n result.resize(2);\n result[1] = static_cast(0x80 | (0x3f & cp));\n result[0] = static_cast(0xC0 | (0x1f & (cp >> 6)));\n } \n else if (cp <= 0xFFFF) \n {\n result.resize(3);\n result[2] = static_cast(0x80 | (0x3f & cp));\n result[1] = 0x80 | static_cast((0x3f & (cp >> 6)));\n result[0] = 0xE0 | static_cast((0xf & (cp >> 12)));\n }\n else if (cp <= 0x10FFFF) \n {\n result.resize(4);\n result[3] = static_cast(0x80 | (0x3f & cp));\n result[2] = static_cast(0x80 | (0x3f & (cp >> 6)));\n result[1] = static_cast(0x80 | (0x3f & (cp >> 12)));\n result[0] = static_cast(0xF0 | (0x7 & (cp >> 18)));\n }\n\n return result;\n}\n\n\n// Class Reader\n// //////////////////////////////////////////////////////////////////\n\nReader::Reader()\n : features_( Features::all() )\n{\n}\n\n\nReader::Reader( const Features &features )\n : features_( features )\n{\n}\n\n\nbool\nReader::parse( const std::string &document, \n Value &root,\n bool collectComments )\n{\n document_ = document;\n const char *begin = document_.c_str();\n const char *end = begin + document_.length();\n return parse( begin, end, root, collectComments );\n}\n\n\nbool\nReader::parse( std::istream& sin,\n Value &root,\n bool collectComments )\n{\n //std::istream_iterator begin(sin);\n //std::istream_iterator end;\n // Those would allow streamed input from a file, if parse() were a\n // template function.\n\n // Since std::string is reference-counted, this at least does not\n // create an extra copy.\n std::string doc;\n std::getline(sin, doc, (char)EOF);\n return parse( doc, root, collectComments );\n}\n\nbool \nReader::parse( const char *beginDoc, const char *endDoc, \n Value &root,\n bool collectComments )\n{\n if ( !features_.allowComments_ )\n {\n collectComments = false;\n }\n\n begin_ = beginDoc;\n end_ = endDoc;\n collectComments_ = collectComments;\n current_ = begin_;\n lastValueEnd_ = 0;\n lastValue_ = 0;\n commentsBefore_ = \"\";\n errors_.clear();\n while ( !nodes_.empty() )\n nodes_.pop();\n nodes_.push( &root );\n \n bool successful = readValue();\n Token token;\n skipCommentTokens( token );\n if ( collectComments_ && !commentsBefore_.empty() )\n root.setComment( commentsBefore_, commentAfter );\n if ( features_.strictRoot_ )\n {\n if ( !root.isArray() && !root.isObject() )\n {\n // Set error location to start of doc, ideally should be first token found in doc\n token.type_ = tokenError;\n token.start_ = beginDoc;\n token.end_ = endDoc;\n addError( \"A valid JSON document must be either an array or an object value.\",\n token );\n return false;\n }\n }\n return successful;\n}\n\n\nbool\nReader::readValue()\n{\n Token token;\n skipCommentTokens( token );\n bool successful = true;\n\n if ( collectComments_ && !commentsBefore_.empty() )\n {\n currentValue().setComment( commentsBefore_, commentBefore );\n commentsBefore_ = \"\";\n }\n\n\n switch ( token.type_ )\n {\n case tokenObjectBegin:\n successful = readObject( token );\n break;\n case tokenArrayBegin:\n successful = readArray( token );\n break;\n case tokenNumber:\n successful = decodeNumber( token );\n break;\n case tokenString:\n successful = decodeString( token );\n break;\n case tokenTrue:\n currentValue() = true;\n break;\n case tokenFalse:\n currentValue() = false;\n break;\n case tokenNull:\n currentValue() = Value();\n break;\n default:\n return addError( \"Syntax error: value, object or array expected.\", token );\n }\n\n if ( collectComments_ )\n {\n lastValueEnd_ = current_;\n lastValue_ = ¤tValue();\n }\n\n return successful;\n}\n\n\nvoid \nReader::skipCommentTokens( Token &token )\n{\n if ( features_.allowComments_ )\n {\n do\n {\n readToken( token );\n }\n while ( token.type_ == tokenComment );\n }\n else\n {\n readToken( token );\n }\n}\n\n\nbool \nReader::expectToken( TokenType type, Token &token, const char *message )\n{\n readToken( token );\n if ( token.type_ != type )\n return addError( message, token );\n return true;\n}\n\n\nbool \nReader::readToken( Token &token )\n{\n skipSpaces();\n token.start_ = current_;\n Char c = getNextChar();\n bool ok = true;\n switch ( c )\n {\n case '{':\n token.type_ = tokenObjectBegin;\n break;\n case '}':\n token.type_ = tokenObjectEnd;\n break;\n case '[':\n token.type_ = tokenArrayBegin;\n break;\n case ']':\n token.type_ = tokenArrayEnd;\n break;\n case '\"':\n token.type_ = tokenString;\n ok = readString();\n break;\n case '/':\n token.type_ = tokenComment;\n ok = readComment();\n break;\n case '0':\n case '1':\n case '2':\n case '3':\n case '4':\n case '5':\n case '6':\n case '7':\n case '8':\n case '9':\n case '-':\n token.type_ = tokenNumber;\n readNumber();\n break;\n case 't':\n token.type_ = tokenTrue;\n ok = match( \"rue\", 3 );\n break;\n case 'f':\n token.type_ = tokenFalse;\n ok = match( \"alse\", 4 );\n break;\n case 'n':\n token.type_ = tokenNull;\n ok = match( \"ull\", 3 );\n break;\n case ',':\n token.type_ = tokenArraySeparator;\n break;\n case ':':\n token.type_ = tokenMemberSeparator;\n break;\n case 0:\n token.type_ = tokenEndOfStream;\n break;\n default:\n ok = false;\n break;\n }\n if ( !ok )\n token.type_ = tokenError;\n token.end_ = current_;\n return true;\n}\n\n\nvoid \nReader::skipSpaces()\n{\n while ( current_ != end_ )\n {\n Char c = *current_;\n if ( c == ' ' || c == '\\t' || c == '\\r' || c == '\\n' )\n ++current_;\n else\n break;\n }\n}\n\n\nbool \nReader::match( Location pattern, \n int patternLength )\n{\n if ( end_ - current_ < patternLength )\n return false;\n int index = patternLength;\n while ( index-- )\n if ( current_[index] != pattern[index] )\n return false;\n current_ += patternLength;\n return true;\n}\n\n\nbool\nReader::readComment()\n{\n Location commentBegin = current_ - 1;\n Char c = getNextChar();\n bool successful = false;\n if ( c == '*' )\n successful = readCStyleComment();\n else if ( c == '/' )\n successful = readCppStyleComment();\n if ( !successful )\n return false;\n\n if ( collectComments_ )\n {\n CommentPlacement placement = commentBefore;\n if ( lastValueEnd_ && !containsNewLine( lastValueEnd_, commentBegin ) )\n {\n if ( c != '*' || !containsNewLine( commentBegin, current_ ) )\n placement = commentAfterOnSameLine;\n }\n\n addComment( commentBegin, current_, placement );\n }\n return true;\n}\n\n\nvoid \nReader::addComment( Location begin, \n Location end, \n CommentPlacement placement )\n{\n assert( collectComments_ );\n if ( placement == commentAfterOnSameLine )\n {\n assert( lastValue_ != 0 );\n lastValue_->setComment( std::string( begin, end ), placement );\n }\n else\n {\n if ( !commentsBefore_.empty() )\n commentsBefore_ += \"\\n\";\n commentsBefore_ += std::string( begin, end );\n }\n}\n\n\nbool \nReader::readCStyleComment()\n{\n while ( current_ != end_ )\n {\n Char c = getNextChar();\n if ( c == '*' && *current_ == '/' )\n break;\n }\n return getNextChar() == '/';\n}\n\n\nbool \nReader::readCppStyleComment()\n{\n while ( current_ != end_ )\n {\n Char c = getNextChar();\n if ( c == '\\r' || c == '\\n' )\n break;\n }\n return true;\n}\n\n\nvoid \nReader::readNumber()\n{\n while ( current_ != end_ )\n {\n if ( !(*current_ >= '0' && *current_ <= '9') &&\n !in( *current_, '.', 'e', 'E', '+', '-' ) )\n break;\n ++current_;\n }\n}\n\nbool\nReader::readString()\n{\n Char c = 0;\n while ( current_ != end_ )\n {\n c = getNextChar();\n if ( c == '\\\\' )\n getNextChar();\n else if ( c == '\"' )\n break;\n }\n return c == '\"';\n}\n\n\nbool \nReader::readObject( Token &tokenStart )\n{\n Token tokenName;\n std::string name;\n currentValue() = Value( objectValue );\n while ( readToken( tokenName ) )\n {\n bool initialTokenOk = true;\n while ( tokenName.type_ == tokenComment && initialTokenOk )\n initialTokenOk = readToken( tokenName );\n if ( !initialTokenOk )\n break;\n if ( tokenName.type_ == tokenObjectEnd && name.empty() ) // empty object\n return true;\n if ( tokenName.type_ != tokenString )\n break;\n \n name = \"\";\n if ( !decodeString( tokenName, name ) )\n return recoverFromError( tokenObjectEnd );\n\n Token colon;\n if ( !readToken( colon ) || colon.type_ != tokenMemberSeparator )\n {\n return addErrorAndRecover( \"Missing ':' after object member name\", \n colon, \n tokenObjectEnd );\n }\n Value &value = currentValue()[ name ];\n nodes_.push( &value );\n bool ok = readValue();\n nodes_.pop();\n if ( !ok ) // error already set\n return recoverFromError( tokenObjectEnd );\n\n Token comma;\n if ( !readToken( comma )\n || ( comma.type_ != tokenObjectEnd && \n comma.type_ != tokenArraySeparator &&\n\t\t comma.type_ != tokenComment ) )\n {\n return addErrorAndRecover( \"Missing ',' or '}' in object declaration\", \n comma, \n tokenObjectEnd );\n }\n bool finalizeTokenOk = true;\n while ( comma.type_ == tokenComment &&\n finalizeTokenOk )\n finalizeTokenOk = readToken( comma );\n if ( comma.type_ == tokenObjectEnd )\n return true;\n }\n return addErrorAndRecover( \"Missing '}' or object member name\", \n tokenName, \n tokenObjectEnd );\n}\n\n\nbool \nReader::readArray( Token &tokenStart )\n{\n currentValue() = Value( arrayValue );\n skipSpaces();\n if ( *current_ == ']' ) // empty array\n {\n Token endArray;\n readToken( endArray );\n return true;\n }\n int index = 0;\n while ( true )\n {\n Value &value = currentValue()[ index++ ];\n nodes_.push( &value );\n bool ok = readValue();\n nodes_.pop();\n if ( !ok ) // error already set\n return recoverFromError( tokenArrayEnd );\n\n Token token;\n // Accept Comment after last item in the array.\n ok = readToken( token );\n while ( token.type_ == tokenComment && ok )\n {\n ok = readToken( token );\n }\n bool badTokenType = ( token.type_ == tokenArraySeparator && \n token.type_ == tokenArrayEnd );\n if ( !ok || badTokenType )\n {\n return addErrorAndRecover( \"Missing ',' or ']' in array declaration\", \n token, \n tokenArrayEnd );\n }\n if ( token.type_ == tokenArrayEnd )\n break;\n }\n return true;\n}\n\n\nbool \nReader::decodeNumber( Token &token )\n{\n bool isDouble = false;\n for ( Location inspect = token.start_; inspect != token.end_; ++inspect )\n {\n isDouble = isDouble \n || in( *inspect, '.', 'e', 'E', '+' ) \n || ( *inspect == '-' && inspect != token.start_ );\n }\n if ( isDouble )\n return decodeDouble( token );\n Location current = token.start_;\n bool isNegative = *current == '-';\n if ( isNegative )\n ++current;\n Value::UInt threshold = (isNegative ? Value::UInt(-Value::minInt) \n : Value::maxUInt) / 10;\n Value::UInt value = 0;\n while ( current < token.end_ )\n {\n Char c = *current++;\n if ( c < '0' || c > '9' )\n return addError( \"'\" + std::string( token.start_, token.end_ ) + \"' is not a number.\", token );\n if ( value >= threshold )\n return decodeDouble( token );\n value = value * 10 + Value::UInt(c - '0');\n }\n if ( isNegative )\n currentValue() = -Value::Int( value );\n else if ( value <= Value::UInt(Value::maxInt) )\n currentValue() = Value::Int( value );\n else\n currentValue() = value;\n return true;\n}\n\n\nbool \nReader::decodeDouble( Token &token )\n{\n double value = 0;\n const int bufferSize = 32;\n int count;\n int length = int(token.end_ - token.start_);\n if ( length <= bufferSize )\n {\n Char buffer[bufferSize];\n memcpy( buffer, token.start_, length );\n buffer[length] = 0;\n count = sscanf( buffer, \"%lf\", &value );\n }\n else\n {\n std::string buffer( token.start_, token.end_ );\n count = sscanf( buffer.c_str(), \"%lf\", &value );\n }\n\n if ( count != 1 )\n return addError( \"'\" + std::string( token.start_, token.end_ ) + \"' is not a number.\", token );\n currentValue() = value;\n return true;\n}\n\n\nbool \nReader::decodeString( Token &token )\n{\n std::string decoded;\n if ( !decodeString( token, decoded ) )\n return false;\n currentValue() = decoded;\n return true;\n}\n\n\nbool \nReader::decodeString( Token &token, std::string &decoded )\n{\n decoded.reserve( token.end_ - token.start_ - 2 );\n Location current = token.start_ + 1; // skip '\"'\n Location end = token.end_ - 1; // do not include '\"'\n while ( current != end )\n {\n Char c = *current++;\n if ( c == '\"' )\n break;\n else if ( c == '\\\\' )\n {\n if ( current == end )\n return addError( \"Empty escape sequence in string\", token, current );\n Char escape = *current++;\n switch ( escape )\n {\n case '\"': decoded += '\"'; break;\n case '/': decoded += '/'; break;\n case '\\\\': decoded += '\\\\'; break;\n case 'b': decoded += '\\b'; break;\n case 'f': decoded += '\\f'; break;\n case 'n': decoded += '\\n'; break;\n case 'r': decoded += '\\r'; break;\n case 't': decoded += '\\t'; break;\n case 'u':\n {\n unsigned int unicode;\n if ( !decodeUnicodeCodePoint( token, current, end, unicode ) )\n return false;\n decoded += codePointToUTF8(unicode);\n }\n break;\n default:\n return addError( \"Bad escape sequence in string\", token, current );\n }\n }\n else\n {\n decoded += c;\n }\n }\n return true;\n}\n\nbool\nReader::decodeUnicodeCodePoint( Token &token, \n Location ¤t, \n Location end, \n unsigned int &unicode )\n{\n\n if ( !decodeUnicodeEscapeSequence( token, current, end, unicode ) )\n return false;\n if (unicode >= 0xD800 && unicode <= 0xDBFF)\n {\n // surrogate pairs\n if (end - current < 6)\n return addError( \"additional six characters expected to parse unicode surrogate pair.\", token, current );\n unsigned int surrogatePair;\n if (*(current++) == '\\\\' && *(current++)== 'u')\n {\n if (decodeUnicodeEscapeSequence( token, current, end, surrogatePair ))\n {\n unicode = 0x10000 + ((unicode & 0x3FF) << 10) + (surrogatePair & 0x3FF);\n } \n else\n return false;\n } \n else\n return addError( \"expecting another \\\\u token to begin the second half of a unicode surrogate pair\", token, current );\n }\n return true;\n}\n\nbool \nReader::decodeUnicodeEscapeSequence( Token &token, \n Location ¤t, \n Location end, \n unsigned int &unicode )\n{\n if ( end - current < 4 )\n return addError( \"Bad unicode escape sequence in string: four digits expected.\", token, current );\n unicode = 0;\n for ( int index =0; index < 4; ++index )\n {\n Char c = *current++;\n unicode *= 16;\n if ( c >= '0' && c <= '9' )\n unicode += c - '0';\n else if ( c >= 'a' && c <= 'f' )\n unicode += c - 'a' + 10;\n else if ( c >= 'A' && c <= 'F' )\n unicode += c - 'A' + 10;\n else\n return addError( \"Bad unicode escape sequence in string: hexadecimal digit expected.\", token, current );\n }\n return true;\n}\n\n\nbool \nReader::addError( const std::string &message, \n Token &token,\n Location extra )\n{\n ErrorInfo info;\n info.token_ = token;\n info.message_ = message;\n info.extra_ = extra;\n errors_.push_back( info );\n return false;\n}\n\n\nbool \nReader::recoverFromError( TokenType skipUntilToken )\n{\n int errorCount = int(errors_.size());\n Token skip;\n while ( true )\n {\n if ( !readToken(skip) )\n errors_.resize( errorCount ); // discard errors caused by recovery\n if ( skip.type_ == skipUntilToken || skip.type_ == tokenEndOfStream )\n break;\n }\n errors_.resize( errorCount );\n return false;\n}\n\n\nbool \nReader::addErrorAndRecover( const std::string &message, \n Token &token,\n TokenType skipUntilToken )\n{\n addError( message, token );\n return recoverFromError( skipUntilToken );\n}\n\n\nValue &\nReader::currentValue()\n{\n return *(nodes_.top());\n}\n\n\nReader::Char \nReader::getNextChar()\n{\n if ( current_ == end_ )\n return 0;\n return *current_++;\n}\n\n\nvoid \nReader::getLocationLineAndColumn( Location location,\n int &line,\n int &column ) const\n{\n Location current = begin_;\n Location lastLineStart = current;\n line = 0;\n while ( current < location && current != end_ )\n {\n Char c = *current++;\n if ( c == '\\r' )\n {\n if ( *current == '\\n' )\n ++current;\n lastLineStart = current;\n ++line;\n }\n else if ( c == '\\n' )\n {\n lastLineStart = current;\n ++line;\n }\n }\n // column & line start at 1\n column = int(location - lastLineStart) + 1;\n ++line;\n}\n\n\nstd::string\nReader::getLocationLineAndColumn( Location location ) const\n{\n int line, column;\n getLocationLineAndColumn( location, line, column );\n char buffer[18+16+16+1];\n sprintf( buffer, \"Line %d, Column %d\", line, column );\n return buffer;\n}\n\n\nstd::string \nReader::getFormatedErrorMessages() const\n{\n std::string formattedMessage;\n for ( Errors::const_iterator itError = errors_.begin();\n itError != errors_.end();\n ++itError )\n {\n const ErrorInfo &error = *itError;\n formattedMessage += \"* \" + getLocationLineAndColumn( error.token_.start_ ) + \"\\n\";\n formattedMessage += \" \" + error.message_ + \"\\n\";\n if ( error.extra_ )\n formattedMessage += \"See \" + getLocationLineAndColumn( error.extra_ ) + \" for detail.\\n\";\n }\n return formattedMessage;\n}\n\n\nstd::istream& operator>>( std::istream &sin, Value &root )\n{\n Json::Reader reader;\n bool ok = reader.parse(sin, root, true);\n //JSON_ASSERT( ok );\n if (!ok) throw std::runtime_error(reader.getFormatedErrorMessages());\n return sin;\n}\n\n\n} // namespace Json\n" }, { "path": "src/test/resources/samples/langs/C++/json_writer.cpp", "content": "// Copyright 2007-2010 Baptiste Lepilleur\n// Distributed under MIT license, or public domain if desired and\n// recognized in your jurisdiction.\n// See file LICENSE for detail or copy at http://jsoncpp.sourceforge.net/LICENSE\n\n/*\nPermission is hereby granted, free of charge, to any person obtaining\na copy of this software and associated documentation files (the\n\"Software\"), to deal in the Software without restriction, including\nwithout limitation the rights to use, copy, modify, merge, publish,\ndistribute, sublicense, and/or sell copies of the Software, and to\npermit persons to whom the Software is furnished to do so, subject to\nthe following conditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\nNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE\nLIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\nOF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\nWITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n*/\n\n// Source - https://github.com/Ij888/ApacheCordovaRecipes/blob/6e8a2c1d9de7302f74bc3dbac54a021f0499bbb3/jqmsandbox/plugins/cordova-plugin-globalization/src/blackberry10/native/public/json_writer.cpp\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#if _MSC_VER >= 1400 // VC++ 8.0\n#pragma warning( disable : 4996 ) // disable warning about strdup being deprecated.\n#endif\n\nnamespace Json {\n\nstatic bool isControlCharacter(char ch)\n{\n return ch > 0 && ch <= 0x1F;\n}\n\nstatic bool containsControlCharacter( const char* str )\n{\n while ( *str ) \n {\n if ( isControlCharacter( *(str++) ) )\n return true;\n }\n return false;\n}\nstatic void uintToString( unsigned int value, \n char *¤t )\n{\n *--current = 0;\n do\n {\n *--current = (value % 10) + '0';\n value /= 10;\n }\n while ( value != 0 );\n}\n\nstd::string valueToString( Int value )\n{\n char buffer[32];\n char *current = buffer + sizeof(buffer);\n bool isNegative = value < 0;\n if ( isNegative )\n value = -value;\n uintToString( UInt(value), current );\n if ( isNegative )\n *--current = '-';\n assert( current >= buffer );\n return current;\n}\n\n\nstd::string valueToString( UInt value )\n{\n char buffer[32];\n char *current = buffer + sizeof(buffer);\n uintToString( value, current );\n assert( current >= buffer );\n return current;\n}\n\nstd::string valueToString( double value )\n{\n char buffer[32];\n#if defined(_MSC_VER) && defined(__STDC_SECURE_LIB__) // Use secure version with visual studio 2005 to avoid warning. \n sprintf_s(buffer, sizeof(buffer), \"%#.16g\", value); \n#else\t\n sprintf(buffer, \"%#.16g\", value); \n#endif\n char* ch = buffer + strlen(buffer) - 1;\n if (*ch != '0') return buffer; // nothing to truncate, so save time\n while(ch > buffer && *ch == '0'){\n --ch;\n }\n char* last_nonzero = ch;\n while(ch >= buffer){\n switch(*ch){\n case '0':\n case '1':\n case '2':\n case '3':\n case '4':\n case '5':\n case '6':\n case '7':\n case '8':\n case '9':\n --ch;\n continue;\n case '.':\n // Truncate zeroes to save bytes in output, but keep one.\n *(last_nonzero+2) = '\\0';\n return buffer;\n default:\n return buffer;\n }\n }\n return buffer;\n}\n\n\nstd::string valueToString( bool value )\n{\n return value ? \"true\" : \"false\";\n}\n\nstd::string valueToQuotedString( const char *value )\n{\n // Not sure how to handle unicode...\n if (strpbrk(value, \"\\\"\\\\\\b\\f\\n\\r\\t\") == NULL && !containsControlCharacter( value ))\n return std::string(\"\\\"\") + value + \"\\\"\";\n // We have to walk value and escape any special characters.\n // Appending to std::string is not efficient, but this should be rare.\n // (Note: forward slashes are *not* rare, but I am not escaping them.)\n unsigned maxsize = strlen(value)*2 + 3; // allescaped+quotes+NULL\n std::string result;\n result.reserve(maxsize); // to avoid lots of mallocs\n result += \"\\\"\";\n for (const char* c=value; *c != 0; ++c)\n {\n switch(*c)\n {\n case '\\\"':\n result += \"\\\\\\\"\";\n break;\n case '\\\\':\n result += \"\\\\\\\\\";\n break;\n case '\\b':\n result += \"\\\\b\";\n break;\n case '\\f':\n result += \"\\\\f\";\n break;\n case '\\n':\n result += \"\\\\n\";\n break;\n case '\\r':\n result += \"\\\\r\";\n break;\n case '\\t':\n result += \"\\\\t\";\n break;\n //case '/':\n // Even though \\/ is considered a legal escape in JSON, a bare\n // slash is also legal, so I see no reason to escape it.\n // (I hope I am not misunderstanding something.\n // blep notes: actually escaping \\/ may be useful in javascript to avoid (*c);\n result += oss.str();\n }\n else\n {\n result += *c;\n }\n break;\n }\n }\n result += \"\\\"\";\n return result;\n}\n\n// Class Writer\n// //////////////////////////////////////////////////////////////////\nWriter::~Writer()\n{\n}\n\n\n// Class FastWriter\n// //////////////////////////////////////////////////////////////////\n\nFastWriter::FastWriter()\n : yamlCompatiblityEnabled_( false )\n{\n}\n\n\nvoid \nFastWriter::enableYAMLCompatibility()\n{\n yamlCompatiblityEnabled_ = true;\n}\n\n\nstd::string \nFastWriter::write( const Value &root )\n{\n document_ = \"\";\n writeValue( root );\n document_ += \"\\n\";\n return document_;\n}\n\n\nvoid \nFastWriter::writeValue( const Value &value )\n{\n switch ( value.type() )\n {\n case nullValue:\n document_ += \"null\";\n break;\n case intValue:\n document_ += valueToString( value.asInt() );\n break;\n case uintValue:\n document_ += valueToString( value.asUInt() );\n break;\n case realValue:\n document_ += valueToString( value.asDouble() );\n break;\n case stringValue:\n document_ += valueToQuotedString( value.asCString() );\n break;\n case booleanValue:\n document_ += valueToString( value.asBool() );\n break;\n case arrayValue:\n {\n document_ += \"[\";\n int size = value.size();\n for ( int index =0; index < size; ++index )\n {\n if ( index > 0 )\n document_ += \",\";\n writeValue( value[index] );\n }\n document_ += \"]\";\n }\n break;\n case objectValue:\n {\n Value::Members members( value.getMemberNames() );\n document_ += \"{\";\n for ( Value::Members::iterator it = members.begin(); \n it != members.end(); \n ++it )\n {\n const std::string &name = *it;\n if ( it != members.begin() )\n document_ += \",\";\n document_ += valueToQuotedString( name.c_str() );\n document_ += yamlCompatiblityEnabled_ ? \": \" \n : \":\";\n writeValue( value[name] );\n }\n document_ += \"}\";\n }\n break;\n }\n}\n\n\n// Class StyledWriter\n// //////////////////////////////////////////////////////////////////\n\nStyledWriter::StyledWriter()\n : rightMargin_( 74 )\n , indentSize_( 3 )\n{\n}\n\n\nstd::string \nStyledWriter::write( const Value &root )\n{\n document_ = \"\";\n addChildValues_ = false;\n indentString_ = \"\";\n writeCommentBeforeValue( root );\n writeValue( root );\n writeCommentAfterValueOnSameLine( root );\n document_ += \"\\n\";\n return document_;\n}\n\n\nvoid \nStyledWriter::writeValue( const Value &value )\n{\n switch ( value.type() )\n {\n case nullValue:\n pushValue( \"null\" );\n break;\n case intValue:\n pushValue( valueToString( value.asInt() ) );\n break;\n case uintValue:\n pushValue( valueToString( value.asUInt() ) );\n break;\n case realValue:\n pushValue( valueToString( value.asDouble() ) );\n break;\n case stringValue:\n pushValue( valueToQuotedString( value.asCString() ) );\n break;\n case booleanValue:\n pushValue( valueToString( value.asBool() ) );\n break;\n case arrayValue:\n writeArrayValue( value);\n break;\n case objectValue:\n {\n Value::Members members( value.getMemberNames() );\n if ( members.empty() )\n pushValue( \"{}\" );\n else\n {\n writeWithIndent( \"{\" );\n indent();\n Value::Members::iterator it = members.begin();\n while ( true )\n {\n const std::string &name = *it;\n const Value &childValue = value[name];\n writeCommentBeforeValue( childValue );\n writeWithIndent( valueToQuotedString( name.c_str() ) );\n document_ += \" : \";\n writeValue( childValue );\n if ( ++it == members.end() )\n {\n writeCommentAfterValueOnSameLine( childValue );\n break;\n }\n document_ += \",\";\n writeCommentAfterValueOnSameLine( childValue );\n }\n unindent();\n writeWithIndent( \"}\" );\n }\n }\n break;\n }\n}\n\n\nvoid \nStyledWriter::writeArrayValue( const Value &value )\n{\n unsigned size = value.size();\n if ( size == 0 )\n pushValue( \"[]\" );\n else\n {\n bool isArrayMultiLine = isMultineArray( value );\n if ( isArrayMultiLine )\n {\n writeWithIndent( \"[\" );\n indent();\n bool hasChildValue = !childValues_.empty();\n unsigned index =0;\n while ( true )\n {\n const Value &childValue = value[index];\n writeCommentBeforeValue( childValue );\n if ( hasChildValue )\n writeWithIndent( childValues_[index] );\n else\n {\n writeIndent();\n writeValue( childValue );\n }\n if ( ++index == size )\n {\n writeCommentAfterValueOnSameLine( childValue );\n break;\n }\n document_ += \",\";\n writeCommentAfterValueOnSameLine( childValue );\n }\n unindent();\n writeWithIndent( \"]\" );\n }\n else // output on a single line\n {\n assert( childValues_.size() == size );\n document_ += \"[ \";\n for ( unsigned index =0; index < size; ++index )\n {\n if ( index > 0 )\n document_ += \", \";\n document_ += childValues_[index];\n }\n document_ += \" ]\";\n }\n }\n}\n\n\nbool \nStyledWriter::isMultineArray( const Value &value )\n{\n int size = value.size();\n bool isMultiLine = size*3 >= rightMargin_ ;\n childValues_.clear();\n for ( int index =0; index < size && !isMultiLine; ++index )\n {\n const Value &childValue = value[index];\n isMultiLine = isMultiLine ||\n ( (childValue.isArray() || childValue.isObject()) && \n childValue.size() > 0 );\n }\n if ( !isMultiLine ) // check if line length > max line length\n {\n childValues_.reserve( size );\n addChildValues_ = true;\n int lineLength = 4 + (size-1)*2; // '[ ' + ', '*n + ' ]'\n for ( int index =0; index < size && !isMultiLine; ++index )\n {\n writeValue( value[index] );\n lineLength += int( childValues_[index].length() );\n isMultiLine = isMultiLine && hasCommentForValue( value[index] );\n }\n addChildValues_ = false;\n isMultiLine = isMultiLine || lineLength >= rightMargin_;\n }\n return isMultiLine;\n}\n\n\nvoid \nStyledWriter::pushValue( const std::string &value )\n{\n if ( addChildValues_ )\n childValues_.push_back( value );\n else\n document_ += value;\n}\n\n\nvoid \nStyledWriter::writeIndent()\n{\n if ( !document_.empty() )\n {\n char last = document_[document_.length()-1];\n if ( last == ' ' ) // already indented\n return;\n if ( last != '\\n' ) // Comments may add new-line\n document_ += '\\n';\n }\n document_ += indentString_;\n}\n\n\nvoid \nStyledWriter::writeWithIndent( const std::string &value )\n{\n writeIndent();\n document_ += value;\n}\n\n\nvoid \nStyledWriter::indent()\n{\n indentString_ += std::string( indentSize_, ' ' );\n}\n\n\nvoid \nStyledWriter::unindent()\n{\n assert( int(indentString_.size()) >= indentSize_ );\n indentString_.resize( indentString_.size() - indentSize_ );\n}\n\n\nvoid \nStyledWriter::writeCommentBeforeValue( const Value &root )\n{\n if ( !root.hasComment( commentBefore ) )\n return;\n document_ += normalizeEOL( root.getComment( commentBefore ) );\n document_ += \"\\n\";\n}\n\n\nvoid \nStyledWriter::writeCommentAfterValueOnSameLine( const Value &root )\n{\n if ( root.hasComment( commentAfterOnSameLine ) )\n document_ += \" \" + normalizeEOL( root.getComment( commentAfterOnSameLine ) );\n\n if ( root.hasComment( commentAfter ) )\n {\n document_ += \"\\n\";\n document_ += normalizeEOL( root.getComment( commentAfter ) );\n document_ += \"\\n\";\n }\n}\n\n\nbool \nStyledWriter::hasCommentForValue( const Value &value )\n{\n return value.hasComment( commentBefore )\n || value.hasComment( commentAfterOnSameLine )\n || value.hasComment( commentAfter );\n}\n\n\nstd::string \nStyledWriter::normalizeEOL( const std::string &text )\n{\n std::string normalized;\n normalized.reserve( text.length() );\n const char *begin = text.c_str();\n const char *end = begin + text.length();\n const char *current = begin;\n while ( current != end )\n {\n char c = *current++;\n if ( c == '\\r' ) // mac or dos EOL\n {\n if ( *current == '\\n' ) // convert dos EOL\n ++current;\n normalized += '\\n';\n }\n else // handle unix EOL & other char\n normalized += c;\n }\n return normalized;\n}\n\n\n// Class StyledStreamWriter\n// //////////////////////////////////////////////////////////////////\n\nStyledStreamWriter::StyledStreamWriter( std::string indentation )\n : document_(NULL)\n , rightMargin_( 74 )\n , indentation_( indentation )\n{\n}\n\n\nvoid\nStyledStreamWriter::write( std::ostream &out, const Value &root )\n{\n document_ = &out;\n addChildValues_ = false;\n indentString_ = \"\";\n writeCommentBeforeValue( root );\n writeValue( root );\n writeCommentAfterValueOnSameLine( root );\n *document_ << \"\\n\";\n document_ = NULL; // Forget the stream, for safety.\n}\n\n\nvoid \nStyledStreamWriter::writeValue( const Value &value )\n{\n switch ( value.type() )\n {\n case nullValue:\n pushValue( \"null\" );\n break;\n case intValue:\n pushValue( valueToString( value.asInt() ) );\n break;\n case uintValue:\n pushValue( valueToString( value.asUInt() ) );\n break;\n case realValue:\n pushValue( valueToString( value.asDouble() ) );\n break;\n case stringValue:\n pushValue( valueToQuotedString( value.asCString() ) );\n break;\n case booleanValue:\n pushValue( valueToString( value.asBool() ) );\n break;\n case arrayValue:\n writeArrayValue( value);\n break;\n case objectValue:\n {\n Value::Members members( value.getMemberNames() );\n if ( members.empty() )\n pushValue( \"{}\" );\n else\n {\n writeWithIndent( \"{\" );\n indent();\n Value::Members::iterator it = members.begin();\n while ( true )\n {\n const std::string &name = *it;\n const Value &childValue = value[name];\n writeCommentBeforeValue( childValue );\n writeWithIndent( valueToQuotedString( name.c_str() ) );\n *document_ << \" : \";\n writeValue( childValue );\n if ( ++it == members.end() )\n {\n writeCommentAfterValueOnSameLine( childValue );\n break;\n }\n *document_ << \",\";\n writeCommentAfterValueOnSameLine( childValue );\n }\n unindent();\n writeWithIndent( \"}\" );\n }\n }\n break;\n }\n}\n\n\nvoid \nStyledStreamWriter::writeArrayValue( const Value &value )\n{\n unsigned size = value.size();\n if ( size == 0 )\n pushValue( \"[]\" );\n else\n {\n bool isArrayMultiLine = isMultineArray( value );\n if ( isArrayMultiLine )\n {\n writeWithIndent( \"[\" );\n indent();\n bool hasChildValue = !childValues_.empty();\n unsigned index =0;\n while ( true )\n {\n const Value &childValue = value[index];\n writeCommentBeforeValue( childValue );\n if ( hasChildValue )\n writeWithIndent( childValues_[index] );\n else\n {\n\t writeIndent();\n writeValue( childValue );\n }\n if ( ++index == size )\n {\n writeCommentAfterValueOnSameLine( childValue );\n break;\n }\n *document_ << \",\";\n writeCommentAfterValueOnSameLine( childValue );\n }\n unindent();\n writeWithIndent( \"]\" );\n }\n else // output on a single line\n {\n assert( childValues_.size() == size );\n *document_ << \"[ \";\n for ( unsigned index =0; index < size; ++index )\n {\n if ( index > 0 )\n *document_ << \", \";\n *document_ << childValues_[index];\n }\n *document_ << \" ]\";\n }\n }\n}\n\n\nbool \nStyledStreamWriter::isMultineArray( const Value &value )\n{\n int size = value.size();\n bool isMultiLine = size*3 >= rightMargin_ ;\n childValues_.clear();\n for ( int index =0; index < size && !isMultiLine; ++index )\n {\n const Value &childValue = value[index];\n isMultiLine = isMultiLine ||\n ( (childValue.isArray() || childValue.isObject()) && \n childValue.size() > 0 );\n }\n if ( !isMultiLine ) // check if line length > max line length\n {\n childValues_.reserve( size );\n addChildValues_ = true;\n int lineLength = 4 + (size-1)*2; // '[ ' + ', '*n + ' ]'\n for ( int index =0; index < size && !isMultiLine; ++index )\n {\n writeValue( value[index] );\n lineLength += int( childValues_[index].length() );\n isMultiLine = isMultiLine && hasCommentForValue( value[index] );\n }\n addChildValues_ = false;\n isMultiLine = isMultiLine || lineLength >= rightMargin_;\n }\n return isMultiLine;\n}\n\n\nvoid \nStyledStreamWriter::pushValue( const std::string &value )\n{\n if ( addChildValues_ )\n childValues_.push_back( value );\n else\n *document_ << value;\n}\n\n\nvoid \nStyledStreamWriter::writeIndent()\n{\n /*\n Some comments in this method would have been nice. ;-)\n\n if ( !document_.empty() )\n {\n char last = document_[document_.length()-1];\n if ( last == ' ' ) // already indented\n return;\n if ( last != '\\n' ) // Comments may add new-line\n *document_ << '\\n';\n }\n */\n *document_ << '\\n' << indentString_;\n}\n\n\nvoid \nStyledStreamWriter::writeWithIndent( const std::string &value )\n{\n writeIndent();\n *document_ << value;\n}\n\n\nvoid \nStyledStreamWriter::indent()\n{\n indentString_ += indentation_;\n}\n\n\nvoid \nStyledStreamWriter::unindent()\n{\n assert( indentString_.size() >= indentation_.size() );\n indentString_.resize( indentString_.size() - indentation_.size() );\n}\n\n\nvoid \nStyledStreamWriter::writeCommentBeforeValue( const Value &root )\n{\n if ( !root.hasComment( commentBefore ) )\n return;\n *document_ << normalizeEOL( root.getComment( commentBefore ) );\n *document_ << \"\\n\";\n}\n\n\nvoid \nStyledStreamWriter::writeCommentAfterValueOnSameLine( const Value &root )\n{\n if ( root.hasComment( commentAfterOnSameLine ) )\n *document_ << \" \" + normalizeEOL( root.getComment( commentAfterOnSameLine ) );\n\n if ( root.hasComment( commentAfter ) )\n {\n *document_ << \"\\n\";\n *document_ << normalizeEOL( root.getComment( commentAfter ) );\n *document_ << \"\\n\";\n }\n}\n\n\nbool \nStyledStreamWriter::hasCommentForValue( const Value &value )\n{\n return value.hasComment( commentBefore )\n || value.hasComment( commentAfterOnSameLine )\n || value.hasComment( commentAfter );\n}\n\n\nstd::string \nStyledStreamWriter::normalizeEOL( const std::string &text )\n{\n std::string normalized;\n normalized.reserve( text.length() );\n const char *begin = text.c_str();\n const char *end = begin + text.length();\n const char *current = begin;\n while ( current != end )\n {\n char c = *current++;\n if ( c == '\\r' ) // mac or dos EOL\n {\n if ( *current == '\\n' ) // convert dos EOL\n ++current;\n normalized += '\\n';\n }\n else // handle unix EOL & other char\n normalized += c;\n }\n return normalized;\n}\n\n\nstd::ostream& operator<<( std::ostream &sout, const Value &root )\n{\n Json::StyledStreamWriter writer;\n writer.write(sout, root);\n return sout;\n}\n\n\n} // namespace Json\n" }, { "path": "src/test/resources/samples/langs/C++/key.cpp", "content": "// Copyright (c) 2009-2012 The Bitcoin developers\n// Distributed under the MIT/X11 software license, see the accompanying\n// file COPYING or http://www.opensource.org/licenses/mit-license.php.\n\n#include \n\n#include \n#include \n\n#include \"key.h\"\n\n// Generate a private key from just the secret parameter\nint EC_KEY_regenerate_key(EC_KEY *eckey, BIGNUM *priv_key)\n{\n int ok = 0;\n BN_CTX *ctx = NULL;\n EC_POINT *pub_key = NULL;\n\n if (!eckey) return 0;\n\n const EC_GROUP *group = EC_KEY_get0_group(eckey);\n\n if ((ctx = BN_CTX_new()) == NULL)\n goto err;\n\n pub_key = EC_POINT_new(group);\n\n if (pub_key == NULL)\n goto err;\n\n if (!EC_POINT_mul(group, pub_key, priv_key, NULL, NULL, ctx))\n goto err;\n\n EC_KEY_set_private_key(eckey,priv_key);\n EC_KEY_set_public_key(eckey,pub_key);\n\n ok = 1;\n\nerr:\n\n if (pub_key)\n EC_POINT_free(pub_key);\n if (ctx != NULL)\n BN_CTX_free(ctx);\n\n return(ok);\n}\n\n// Perform ECDSA key recovery (see SEC1 4.1.6) for curves over (mod p)-fields\n// recid selects which key is recovered\n// if check is nonzero, additional checks are performed\nint ECDSA_SIG_recover_key_GFp(EC_KEY *eckey, ECDSA_SIG *ecsig, const unsigned char *msg, int msglen, int recid, int check)\n{\n if (!eckey) return 0;\n\n int ret = 0;\n BN_CTX *ctx = NULL;\n\n BIGNUM *x = NULL;\n BIGNUM *e = NULL;\n BIGNUM *order = NULL;\n BIGNUM *sor = NULL;\n BIGNUM *eor = NULL;\n BIGNUM *field = NULL;\n EC_POINT *R = NULL;\n EC_POINT *O = NULL;\n EC_POINT *Q = NULL;\n BIGNUM *rr = NULL;\n BIGNUM *zero = NULL;\n int n = 0;\n int i = recid / 2;\n\n const EC_GROUP *group = EC_KEY_get0_group(eckey);\n if ((ctx = BN_CTX_new()) == NULL) { ret = -1; goto err; }\n BN_CTX_start(ctx);\n order = BN_CTX_get(ctx);\n if (!EC_GROUP_get_order(group, order, ctx)) { ret = -2; goto err; }\n x = BN_CTX_get(ctx);\n if (!BN_copy(x, order)) { ret=-1; goto err; }\n if (!BN_mul_word(x, i)) { ret=-1; goto err; }\n if (!BN_add(x, x, ecsig->r)) { ret=-1; goto err; }\n field = BN_CTX_get(ctx);\n if (!EC_GROUP_get_curve_GFp(group, field, NULL, NULL, ctx)) { ret=-2; goto err; }\n if (BN_cmp(x, field) >= 0) { ret=0; goto err; }\n if ((R = EC_POINT_new(group)) == NULL) { ret = -2; goto err; }\n if (!EC_POINT_set_compressed_coordinates_GFp(group, R, x, recid % 2, ctx)) { ret=0; goto err; }\n if (check)\n {\n if ((O = EC_POINT_new(group)) == NULL) { ret = -2; goto err; }\n if (!EC_POINT_mul(group, O, NULL, R, order, ctx)) { ret=-2; goto err; }\n if (!EC_POINT_is_at_infinity(group, O)) { ret = 0; goto err; }\n }\n if ((Q = EC_POINT_new(group)) == NULL) { ret = -2; goto err; }\n n = EC_GROUP_get_degree(group);\n e = BN_CTX_get(ctx);\n if (!BN_bin2bn(msg, msglen, e)) { ret=-1; goto err; }\n if (8*msglen > n) BN_rshift(e, e, 8-(n & 7));\n zero = BN_CTX_get(ctx);\n if (!BN_zero(zero)) { ret=-1; goto err; }\n if (!BN_mod_sub(e, zero, e, order, ctx)) { ret=-1; goto err; }\n rr = BN_CTX_get(ctx);\n if (!BN_mod_inverse(rr, ecsig->r, order, ctx)) { ret=-1; goto err; }\n sor = BN_CTX_get(ctx);\n if (!BN_mod_mul(sor, ecsig->s, rr, order, ctx)) { ret=-1; goto err; }\n eor = BN_CTX_get(ctx);\n if (!BN_mod_mul(eor, e, rr, order, ctx)) { ret=-1; goto err; }\n if (!EC_POINT_mul(group, Q, eor, R, sor, ctx)) { ret=-2; goto err; }\n if (!EC_KEY_set_public_key(eckey, Q)) { ret=-2; goto err; }\n\n ret = 1;\n\nerr:\n if (ctx) {\n BN_CTX_end(ctx);\n BN_CTX_free(ctx);\n }\n if (R != NULL) EC_POINT_free(R);\n if (O != NULL) EC_POINT_free(O);\n if (Q != NULL) EC_POINT_free(Q);\n return ret;\n}\n\nvoid CKey::SetCompressedPubKey()\n{\n EC_KEY_set_conv_form(pkey, POINT_CONVERSION_COMPRESSED);\n fCompressedPubKey = true;\n}\n\nvoid CKey::Reset()\n{\n fCompressedPubKey = false;\n pkey = EC_KEY_new_by_curve_name(NID_secp256k1);\n if (pkey == NULL)\n throw key_error(\"CKey::CKey() : EC_KEY_new_by_curve_name failed\");\n fSet = false;\n}\n\nCKey::CKey()\n{\n Reset();\n}\n\nCKey::CKey(const CKey& b)\n{\n pkey = EC_KEY_dup(b.pkey);\n if (pkey == NULL)\n throw key_error(\"CKey::CKey(const CKey&) : EC_KEY_dup failed\");\n fSet = b.fSet;\n}\n\nCKey& CKey::operator=(const CKey& b)\n{\n if (!EC_KEY_copy(pkey, b.pkey))\n throw key_error(\"CKey::operator=(const CKey&) : EC_KEY_copy failed\");\n fSet = b.fSet;\n return (*this);\n}\n\nCKey::~CKey()\n{\n EC_KEY_free(pkey);\n}\n\nbool CKey::IsNull() const\n{\n return !fSet;\n}\n\nbool CKey::IsCompressed() const\n{\n return fCompressedPubKey;\n}\n\nvoid CKey::MakeNewKey(bool fCompressed)\n{\n if (!EC_KEY_generate_key(pkey))\n throw key_error(\"CKey::MakeNewKey() : EC_KEY_generate_key failed\");\n if (fCompressed)\n SetCompressedPubKey();\n fSet = true;\n}\n\nbool CKey::SetPrivKey(const CPrivKey& vchPrivKey)\n{\n const unsigned char* pbegin = &vchPrivKey[0];\n if (!d2i_ECPrivateKey(&pkey, &pbegin, vchPrivKey.size()))\n return false;\n fSet = true;\n return true;\n}\n\nbool CKey::SetSecret(const CSecret& vchSecret, bool fCompressed)\n{\n EC_KEY_free(pkey);\n pkey = EC_KEY_new_by_curve_name(NID_secp256k1);\n if (pkey == NULL)\n throw key_error(\"CKey::SetSecret() : EC_KEY_new_by_curve_name failed\");\n if (vchSecret.size() != 32)\n throw key_error(\"CKey::SetSecret() : secret must be 32 bytes\");\n BIGNUM *bn = BN_bin2bn(&vchSecret[0],32,BN_new());\n if (bn == NULL)\n throw key_error(\"CKey::SetSecret() : BN_bin2bn failed\");\n if (!EC_KEY_regenerate_key(pkey,bn))\n {\n BN_clear_free(bn);\n throw key_error(\"CKey::SetSecret() : EC_KEY_regenerate_key failed\");\n }\n BN_clear_free(bn);\n fSet = true;\n if (fCompressed || fCompressedPubKey)\n SetCompressedPubKey();\n return true;\n}\n\nCSecret CKey::GetSecret(bool &fCompressed) const\n{\n CSecret vchRet;\n vchRet.resize(32);\n const BIGNUM *bn = EC_KEY_get0_private_key(pkey);\n int nBytes = BN_num_bytes(bn);\n if (bn == NULL)\n throw key_error(\"CKey::GetSecret() : EC_KEY_get0_private_key failed\");\n int n=BN_bn2bin(bn,&vchRet[32 - nBytes]);\n if (n != nBytes)\n throw key_error(\"CKey::GetSecret(): BN_bn2bin failed\");\n fCompressed = fCompressedPubKey;\n return vchRet;\n}\n\nCPrivKey CKey::GetPrivKey() const\n{\n int nSize = i2d_ECPrivateKey(pkey, NULL);\n if (!nSize)\n throw key_error(\"CKey::GetPrivKey() : i2d_ECPrivateKey failed\");\n CPrivKey vchPrivKey(nSize, 0);\n unsigned char* pbegin = &vchPrivKey[0];\n if (i2d_ECPrivateKey(pkey, &pbegin) != nSize)\n throw key_error(\"CKey::GetPrivKey() : i2d_ECPrivateKey returned unexpected size\");\n return vchPrivKey;\n}\n\nbool CKey::SetPubKey(const CPubKey& vchPubKey)\n{\n const unsigned char* pbegin = &vchPubKey.vchPubKey[0];\n if (!o2i_ECPublicKey(&pkey, &pbegin, vchPubKey.vchPubKey.size()))\n return false;\n fSet = true;\n if (vchPubKey.vchPubKey.size() == 33)\n SetCompressedPubKey();\n return true;\n}\n\nCPubKey CKey::GetPubKey() const\n{\n int nSize = i2o_ECPublicKey(pkey, NULL);\n if (!nSize)\n throw key_error(\"CKey::GetPubKey() : i2o_ECPublicKey failed\");\n std::vector vchPubKey(nSize, 0);\n unsigned char* pbegin = &vchPubKey[0];\n if (i2o_ECPublicKey(pkey, &pbegin) != nSize)\n throw key_error(\"CKey::GetPubKey() : i2o_ECPublicKey returned unexpected size\");\n return CPubKey(vchPubKey);\n}\n\nbool CKey::Sign(uint256 hash, std::vector& vchSig)\n{\n unsigned int nSize = ECDSA_size(pkey);\n vchSig.resize(nSize); // Make sure it is big enough\n if (!ECDSA_sign(0, (unsigned char*)&hash, sizeof(hash), &vchSig[0], &nSize, pkey))\n {\n vchSig.clear();\n return false;\n }\n vchSig.resize(nSize); // Shrink to fit actual size\n return true;\n}\n\n// create a compact signature (65 bytes), which allows reconstructing the used public key\n// The format is one header byte, followed by two times 32 bytes for the serialized r and s values.\n// The header byte: 0x1B = first key with even y, 0x1C = first key with odd y,\n// 0x1D = second key with even y, 0x1E = second key with odd y\nbool CKey::SignCompact(uint256 hash, std::vector& vchSig)\n{\n bool fOk = false;\n ECDSA_SIG *sig = ECDSA_do_sign((unsigned char*)&hash, sizeof(hash), pkey);\n if (sig==NULL)\n return false;\n vchSig.clear();\n vchSig.resize(65,0);\n int nBitsR = BN_num_bits(sig->r);\n int nBitsS = BN_num_bits(sig->s);\n if (nBitsR <= 256 && nBitsS <= 256)\n {\n int nRecId = -1;\n for (int i=0; i<4; i++)\n {\n CKey keyRec;\n keyRec.fSet = true;\n if (fCompressedPubKey)\n keyRec.SetCompressedPubKey();\n if (ECDSA_SIG_recover_key_GFp(keyRec.pkey, sig, (unsigned char*)&hash, sizeof(hash), i, 1) == 1)\n if (keyRec.GetPubKey() == this->GetPubKey())\n {\n nRecId = i;\n break;\n }\n }\n\n if (nRecId == -1)\n throw key_error(\"CKey::SignCompact() : unable to construct recoverable key\");\n\n vchSig[0] = nRecId+27+(fCompressedPubKey ? 4 : 0);\n BN_bn2bin(sig->r,&vchSig[33-(nBitsR+7)/8]);\n BN_bn2bin(sig->s,&vchSig[65-(nBitsS+7)/8]);\n fOk = true;\n }\n ECDSA_SIG_free(sig);\n return fOk;\n}\n\n// reconstruct public key from a compact signature\n// This is only slightly more CPU intensive than just verifying it.\n// If this function succeeds, the recovered public key is guaranteed to be valid\n// (the signature is a valid signature of the given data for that key)\nbool CKey::SetCompactSignature(uint256 hash, const std::vector& vchSig)\n{\n if (vchSig.size() != 65)\n return false;\n int nV = vchSig[0];\n if (nV<27 || nV>=35)\n return false;\n ECDSA_SIG *sig = ECDSA_SIG_new();\n BN_bin2bn(&vchSig[1],32,sig->r);\n BN_bin2bn(&vchSig[33],32,sig->s);\n\n EC_KEY_free(pkey);\n pkey = EC_KEY_new_by_curve_name(NID_secp256k1);\n if (nV >= 31)\n {\n SetCompressedPubKey();\n nV -= 4;\n }\n if (ECDSA_SIG_recover_key_GFp(pkey, sig, (unsigned char*)&hash, sizeof(hash), nV - 27, 0) == 1)\n {\n fSet = true;\n ECDSA_SIG_free(sig);\n return true;\n }\n return false;\n}\n\nbool CKey::Verify(uint256 hash, const std::vector& vchSig)\n{\n // -1 = error, 0 = bad sig, 1 = good\n if (ECDSA_verify(0, (unsigned char*)&hash, sizeof(hash), &vchSig[0], vchSig.size(), pkey) != 1)\n return false;\n\n return true;\n}\n\nbool CKey::VerifyCompact(uint256 hash, const std::vector& vchSig)\n{\n CKey key;\n if (!key.SetCompactSignature(hash, vchSig))\n return false;\n if (GetPubKey() != key.GetPubKey())\n return false;\n\n return true;\n}\n\nbool CKey::IsValid()\n{\n if (!fSet)\n return false;\n\n bool fCompr;\n CSecret secret = GetSecret(fCompr);\n CKey key2;\n key2.SetSecret(secret, fCompr);\n return GetPubKey() == key2.GetPubKey();\n}\n" }, { "path": "src/test/resources/samples/langs/C++/key.h", "content": "// Copyright (c) 2009-2010 Satoshi Nakamoto\n// Copyright (c) 2009-2012 The Bitcoin developers\n// Distributed under the MIT/X11 software license, see the accompanying\n// file COPYING or http://www.opensource.org/licenses/mit-license.php.\n#ifndef BITCOIN_KEY_H\n#define BITCOIN_KEY_H\n\n#include \n#include \n\n#include \"allocators.h\"\n#include \"serialize.h\"\n#include \"uint256.h\"\n#include \"util.h\"\n\n#include // for EC_KEY definition\n\n// secp160k1\n// const unsigned int PRIVATE_KEY_SIZE = 192;\n// const unsigned int PUBLIC_KEY_SIZE = 41;\n// const unsigned int SIGNATURE_SIZE = 48;\n//\n// secp192k1\n// const unsigned int PRIVATE_KEY_SIZE = 222;\n// const unsigned int PUBLIC_KEY_SIZE = 49;\n// const unsigned int SIGNATURE_SIZE = 57;\n//\n// secp224k1\n// const unsigned int PRIVATE_KEY_SIZE = 250;\n// const unsigned int PUBLIC_KEY_SIZE = 57;\n// const unsigned int SIGNATURE_SIZE = 66;\n//\n// secp256k1:\n// const unsigned int PRIVATE_KEY_SIZE = 279;\n// const unsigned int PUBLIC_KEY_SIZE = 65;\n// const unsigned int SIGNATURE_SIZE = 72;\n//\n// see www.keylength.com\n// script supports up to 75 for single byte push\n\nclass key_error : public std::runtime_error\n{\npublic:\n explicit key_error(const std::string& str) : std::runtime_error(str) {}\n};\n\n/** A reference to a CKey: the Hash160 of its serialized public key */\nclass CKeyID : public uint160\n{\npublic:\n CKeyID() : uint160(0) { }\n CKeyID(const uint160 &in) : uint160(in) { }\n};\n\n/** A reference to a CScript: the Hash160 of its serialization (see script.h) */\nclass CScriptID : public uint160\n{\npublic:\n CScriptID() : uint160(0) { }\n CScriptID(const uint160 &in) : uint160(in) { }\n};\n\n/** An encapsulated public key. */\nclass CPubKey {\nprivate:\n std::vector vchPubKey;\n friend class CKey;\n\npublic:\n CPubKey() { }\n CPubKey(const std::vector &vchPubKeyIn) : vchPubKey(vchPubKeyIn) { }\n friend bool operator==(const CPubKey &a, const CPubKey &b) { return a.vchPubKey == b.vchPubKey; }\n friend bool operator!=(const CPubKey &a, const CPubKey &b) { return a.vchPubKey != b.vchPubKey; }\n friend bool operator<(const CPubKey &a, const CPubKey &b) { return a.vchPubKey < b.vchPubKey; }\n\n IMPLEMENT_SERIALIZE(\n READWRITE(vchPubKey);\n )\n\n CKeyID GetID() const {\n return CKeyID(Hash160(vchPubKey));\n }\n\n uint256 GetHash() const {\n return Hash(vchPubKey.begin(), vchPubKey.end());\n }\n\n bool IsValid() const {\n return vchPubKey.size() == 33 || vchPubKey.size() == 65;\n }\n\n bool IsCompressed() const {\n return vchPubKey.size() == 33;\n }\n\n std::vector Raw() const {\n return vchPubKey;\n }\n};\n\n\n// secure_allocator is defined in serialize.h\n// CPrivKey is a serialized private key, with all parameters included (279 bytes)\ntypedef std::vector > CPrivKey;\n// CSecret is a serialization of just the secret parameter (32 bytes)\ntypedef std::vector > CSecret;\n\n/** An encapsulated OpenSSL Elliptic Curve key (public and/or private) */\nclass CKey\n{\nprotected:\n EC_KEY* pkey;\n bool fSet;\n bool fCompressedPubKey;\n\n void SetCompressedPubKey();\n\npublic:\n\n void Reset();\n\n CKey();\n CKey(const CKey& b);\n\n CKey& operator=(const CKey& b);\n\n ~CKey();\n\n bool IsNull() const;\n bool IsCompressed() const;\n\n void MakeNewKey(bool fCompressed);\n bool SetPrivKey(const CPrivKey& vchPrivKey);\n bool SetSecret(const CSecret& vchSecret, bool fCompressed = false);\n CSecret GetSecret(bool &fCompressed) const;\n CPrivKey GetPrivKey() const;\n bool SetPubKey(const CPubKey& vchPubKey);\n CPubKey GetPubKey() const;\n\n bool Sign(uint256 hash, std::vector& vchSig);\n\n // create a compact signature (65 bytes), which allows reconstructing the used public key\n // The format is one header byte, followed by two times 32 bytes for the serialized r and s values.\n // The header byte: 0x1B = first key with even y, 0x1C = first key with odd y,\n // 0x1D = second key with even y, 0x1E = second key with odd y\n bool SignCompact(uint256 hash, std::vector& vchSig);\n\n // reconstruct public key from a compact signature\n // This is only slightly more CPU intensive than just verifying it.\n // If this function succeeds, the recovered public key is guaranteed to be valid\n // (the signature is a valid signature of the given data for that key)\n bool SetCompactSignature(uint256 hash, const std::vector& vchSig);\n\n bool Verify(uint256 hash, const std::vector& vchSig);\n\n // Verify a compact signature\n bool VerifyCompact(uint256 hash, const std::vector& vchSig);\n\n bool IsValid();\n};\n\n#endif\n" }, { "path": "src/test/resources/samples/langs/C++/libcanister.h", "content": "#ifndef LIBCANIH\n#define LIBCANIH\n#include \n#include \n#include \n#include \n\n#define int64 unsigned long long\n//#define DEBUG\n\n#ifdef DEBUG\n#define dout cout\n#else\n#define dout if (0) cerr\n#endif\n\nusing namespace std;\n\nnamespace libcanister\n{\n\n //the canmem object is a generic memory container used commonly\n //throughout the canister framework to hold memory of uncertain\n //length which may or may not contain null bytes. \n class canmem\n {\n public:\n char* data; //the raw memory block\n int size; //the absolute length of the block\n canmem(); //creates an unallocated canmem\n canmem(int allocsize); //creates an allocated, blank canmem of size\n canmem(char* strdata); //automates the creation of zero-limited canmems\n ~canmem(); //cleans up the canmem\n void zeromem(); //overwrites this canmem\n void fragmem(); //overwrites this canmem with fragment notation\n void countlen(); //counts length of zero-limited strings and stores it in size\n void trim(); //removes any nulls from the end of the string\n static canmem null(); //returns a singleton null canmem\n \n };\n \n //contains information about the canister\n class caninfo\n {\n public:\n canmem path; //physical path\n canmem internalname; //a name for the canister\n int numfiles; //the number of files in the canister\n };\n \n //necessary for the use of this class as a type in canfile\n class canister;\n \n //this object holds the definition of a 'file' within the\n //canister 'filesystem.'\n class canfile\n {\n public:\n libcanister::canister* parent; //the canister that holds this file\n canmem path; //internal path ('filename')\n canmem data; //the file's decompressed contents\n int isfrag; //0 = probably not fragment, 1 = definitely a fragment (ignore)\n int cfid; //'canfile id' -- a unique ID for this file\n int64 dsize; //ondisk size (compressed form size)\n int cachestate; //0 = not in memory, 1 = in memory, 2 = in memory and needs flush\n //-1 = error, check the data for the message\n void cache(); //pull the file from disk and cache it in memory\n void cachedump(); //deletes the contents of this file from the memory cache after assuring the on disk copy is up to date\n void cachedumpfinal(fstream& infile); //same as cachedump, but more efficient during closing procedures\n void flush(); //updates the on disk copy, but retains the memory cache\n };\n\n //the primary class\n //this defines and controls a single canister\n class canister\n {\n //table of contents\n //absolutely worthless to the control code in the canister\n //but quite useful to programs using the API, as they may\n //desire to enumerate the files in a canister for a user's\n //use or for their own.\n //contains a newline-delimited list of files in the container.\n canfile TOC;\n public:\n caninfo info; //the general info about this canister\n\n //the raw canfiles -- recommended that programs do not modify\n //these files directly, but not enforced.\n canfile* files;\n bool readonly; //if true then no write routines will do anything\n \n //maximum number of files to have in memory at any given\n //time, change this to whatever suits your application.\n int cachemax;\n int cachecnt; //number of files in the cache (should not be modified)\n\n //both initialize the canister from a physical location\n canister (canmem fspath);\n canister (char* fspath);\n\n //destroys the canister (after flushing the modded buffers, of course)\n ~canister();\n \n //open the fspath\n //does it exist?\n // | --- yes --- opening it (return 1)\n // | --- yes --- file is corrupted, halting (return -1)\n // | --- no --- making a new one (return 0)\n int open();\n \n //close the canister, flush all buffers, clean up\n int close();\n \n //deletes the file at path inside this canister\n int delFile(canmem path);\n \n //pulls the contents of the file from disk or memory and returns it as a file\n canfile getFile(canmem path);\n \n //creates a file if it does not exist, otherwise overwrites\n //returns whether operation succeeded\n bool writeFile(canmem path, canmem data);\n bool writeFile(canfile file);\n \n //get the 'table of contents', a file containing a newline delimited\n //list of the file paths in the container which have contents\n canfile getTOC();\n \n //brings the cache back within the cachemax limit\n //important: sCFID is the safe CFID\n //(the CFID of the file we want to avoid uncaching)\n //really just used internally, but it can't do any harm.\n void cacheclean(int sCFID, bool dFlush = false);\n };\n\n}\n\n#endif" }, { "path": "src/test/resources/samples/langs/C++/main.cpp", "content": "/*\n This file is part of the PhantomJS project from Ofi Labs.\n\n Copyright (C) 2011 Ariya Hidayat \n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * 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 * Neither the name of the nor the\n names of its contributors may be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n ARE DISCLAIMED. IN NO EVENT SHALL BE LIABLE FOR ANY\n DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF\n THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*/\n\n#include \"consts.h\"\n#include \"utils.h\"\n#include \"env.h\"\n#include \"phantom.h\"\n\n#ifdef Q_OS_LINUX\n#include \"client/linux/handler/exception_handler.h\"\n#endif\n\n#include \n\n#if QT_VERSION != QT_VERSION_CHECK(4, 8, 0)\n#error Something is wrong with the setup. Please report to the mailing list!\n#endif\n\nint main(int argc, char** argv, const char** envp)\n{\n#ifdef Q_OS_LINUX\n google_breakpad::ExceptionHandler eh(\"/tmp\", NULL, Utils::exceptionHandler, NULL, true);\n#endif\n\n // Registering an alternative Message Handler\n qInstallMsgHandler(Utils::messageHandler);\n\n QApplication app(argc, argv);\n\n#ifdef STATIC_BUILD\n Q_INIT_RESOURCE(WebKit);\n Q_INIT_RESOURCE(InspectorBackendStub);\n#endif\n\n app.setWindowIcon(QIcon(\":/phantomjs-icon.png\"));\n app.setApplicationName(\"PhantomJS\");\n app.setOrganizationName(\"Ofi Labs\");\n app.setOrganizationDomain(\"www.ofilabs.com\");\n app.setApplicationVersion(PHANTOMJS_VERSION_STRING);\n\n Env::instance()->parse(envp);\n\n Phantom phantom;\n if (phantom.execute()) {\n app.exec();\n }\n return phantom.returnValue();\n}\n" }, { "path": "src/test/resources/samples/langs/C++/metrics.h", "content": "// Copyright 2011 Google Inc. All Rights Reserved.\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#ifndef NINJA_METRICS_H_\n#define NINJA_METRICS_H_\n\n#include \n#include \nusing namespace std;\n\n#include \"util.h\" // For int64_t.\n\n/// The Metrics module is used for the debug mode that dumps timing stats of\n/// various actions. To use, see METRIC_RECORD below.\n\n/// A single metrics we're tracking, like \"depfile load time\".\nstruct Metric {\n string name;\n /// Number of times we've hit the code path.\n int count;\n /// Total time (in micros) we've spent on the code path.\n int64_t sum;\n};\n\n\n/// A scoped object for recording a metric across the body of a function.\n/// Used by the METRIC_RECORD macro.\nstruct ScopedMetric {\n explicit ScopedMetric(Metric* metric);\n ~ScopedMetric();\n\nprivate:\n Metric* metric_;\n /// Timestamp when the measurement started.\n /// Value is platform-dependent.\n int64_t start_;\n};\n\n/// The singleton that stores metrics and prints the report.\nstruct Metrics {\n Metric* NewMetric(const string& name);\n\n /// Print a summary report to stdout.\n void Report();\n\nprivate:\n vector metrics_;\n};\n\n/// Get the current time as relative to some epoch.\n/// Epoch varies between platforms; only useful for measuring elapsed time.\nint64_t GetTimeMillis();\n\n/// A simple stopwatch which returns the time\n/// in seconds since Restart() was called.\nstruct Stopwatch {\n public:\n Stopwatch() : started_(0) {}\n\n /// Seconds since Restart() call.\n double Elapsed() const {\n return 1e-6 * static_cast(Now() - started_);\n }\n\n void Restart() { started_ = Now(); }\n\n private:\n uint64_t started_;\n uint64_t Now() const;\n};\n\n/// The primary interface to metrics. Use METRIC_RECORD(\"foobar\") at the top\n/// of a function to get timing stats recorded for each call of the function.\n#define METRIC_RECORD(name) \\\n static Metric* metrics_h_metric = \\\n g_metrics ? g_metrics->NewMetric(name) : NULL; \\\n ScopedMetric metrics_h_scoped(metrics_h_metric);\n\nextern Metrics* g_metrics;\n\n#endif // NINJA_METRICS_H_\n" }, { "path": "src/test/resources/samples/langs/C++/octave_changer.ino", "content": "const int buttons[4] = {2,3,4,5};\nconst int octaves[2] = {6,7};\n\nvoid setup() { \n // initialize the digital pin as an output.\n // Pin 13 has an LED connected on most Arduino boards:\n\n pinMode(13,OUTPUT);\n\n for(int i =0;i=0){\n Serial.print(output);\n Serial.println(\";\");\n digitalWrite(13,HIGH);\n }else{\n digitalWrite(13,LOW);\n }\n \n}\n" }, { "path": "src/test/resources/samples/langs/C++/program.cp", "content": "/**\nThe MIT License (MIT)\n\nCopyright (c) 2016 Sahil Dua ( sahildua2305 | http://sahildua.com )\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#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \nusing namespace std;\ntypedef long long ll;\n#define DEBUG\n#define mod 1000000007\n#define pb push_back\n\nint r2, c2, n, m;\n\nbool dfs(vector graph, int r, int c){\n //cout<0){\n if(dfs(graph, r-1, c))\n return true;\n }\n if(c>0){\n if(dfs(graph, r, c-1))\n return true;\n }\n if(r<(n-1)){\n if(dfs(graph, r+1, c))\n return true;\n }\n if(c<(m-1)){\n if(dfs(graph, r, c+1))\n return true;\n }\n return false;\n}\n\nstruct point{\n int r,c;\n point(int rr, int cc){\n r = rr;\n c = cc;\n }\n};\n\nstack st;\n\n// if(r>0){\n// if(dfs(graph, r-1, c))\n// return true;\n// }\n// if(c>0){\n// if(dfs(graph, r, c-1))\n// return true;\n// }\n// if(r<(n-1)){\n// if(dfs(graph, r+1, c))\n// return true;\n// }\n// if(c<(m-1)){\n// if(dfs(graph, r, c+1))\n// return true;\n// }\n\nbool search(vector graph, int rr, int cc){\n point t;\n t.r=rr;\n t.c=cc;\n st.push(t);\n\n while(!st.empty()){\n point u = st.top();\n st.pop();\n int r = u.r, c = u.c;\n cout<0){\n t.r=r-1;\n t.c=c;\n st.push(t);\n }\n if(c>0){\n t.r=r;\n t.c=c-1;\n st.push(t);\n }\n if(r<(n-1)){\n t.r=r+1;\n t.c=c;\n st.push(t);\n }\n if(c<(m-1)){\n t.r=r;\n t.c=c+1;\n st.push(t);\n }\n }\n return false;\n}\n\nint main(){\n ios::sync_with_stdio(false);\n #ifdef DEBUG\n freopen(\"input.txt\", \"r\", stdin);\n #endif // DEBUG\n\n cin>>n>>m;\n string temp;\n vector graph;\n for(int i=0;i>temp;\n graph.pb(temp);\n }\n int r1,c1;\n cin>>r1>>c1;\n cin>>r2>>c2;\n r2--;\n c2--;\n r1--;\n c1--;\n graph[r1][c1] = '.';\n if(search(graph, r1, c1))\n cout<<\"YES\\n\";\n else\n cout<<\"NO\\n\";\n\n return 0;\n}\n" }, { "path": "src/test/resources/samples/langs/C++/protocol-buffer.pb.cc", "content": "// Generated by the protocol buffer compiler. DO NOT EDIT!\n// source: protocol-buffer.proto\n\n#define INTERNAL_SUPPRESS_PROTOBUF_FIELD_DEPRECATION\n#include \"protocol-buffer.pb.h\"\n\n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n// @@protoc_insertion_point(includes)\n\nnamespace persons {\n\nnamespace {\n\nconst ::google::protobuf::Descriptor* Person_descriptor_ = NULL;\nconst ::google::protobuf::internal::GeneratedMessageReflection*\n Person_reflection_ = NULL;\n\n} // namespace\n\n\nvoid protobuf_AssignDesc_protocol_2dbuffer_2eproto() {\n protobuf_AddDesc_protocol_2dbuffer_2eproto();\n const ::google::protobuf::FileDescriptor* file =\n ::google::protobuf::DescriptorPool::generated_pool()->FindFileByName(\n \"protocol-buffer.proto\");\n GOOGLE_CHECK(file != NULL);\n Person_descriptor_ = file->message_type(0);\n static const int Person_offsets_[1] = {\n GOOGLE_PROTOBUF_GENERATED_MESSAGE_FIELD_OFFSET(Person, name_),\n };\n Person_reflection_ =\n new ::google::protobuf::internal::GeneratedMessageReflection(\n Person_descriptor_,\n Person::default_instance_,\n Person_offsets_,\n GOOGLE_PROTOBUF_GENERATED_MESSAGE_FIELD_OFFSET(Person, _has_bits_[0]),\n GOOGLE_PROTOBUF_GENERATED_MESSAGE_FIELD_OFFSET(Person, _unknown_fields_),\n -1,\n ::google::protobuf::DescriptorPool::generated_pool(),\n ::google::protobuf::MessageFactory::generated_factory(),\n sizeof(Person));\n}\n\nnamespace {\n\nGOOGLE_PROTOBUF_DECLARE_ONCE(protobuf_AssignDescriptors_once_);\ninline void protobuf_AssignDescriptorsOnce() {\n ::google::protobuf::GoogleOnceInit(&protobuf_AssignDescriptors_once_,\n &protobuf_AssignDesc_protocol_2dbuffer_2eproto);\n}\n\nvoid protobuf_RegisterTypes(const ::std::string&) {\n protobuf_AssignDescriptorsOnce();\n ::google::protobuf::MessageFactory::InternalRegisterGeneratedMessage(\n Person_descriptor_, &Person::default_instance());\n}\n\n} // namespace\n\nvoid protobuf_ShutdownFile_protocol_2dbuffer_2eproto() {\n delete Person::default_instance_;\n delete Person_reflection_;\n}\n\nvoid protobuf_AddDesc_protocol_2dbuffer_2eproto() {\n static bool already_here = false;\n if (already_here) return;\n already_here = true;\n GOOGLE_PROTOBUF_VERIFY_VERSION;\n\n ::google::protobuf::DescriptorPool::InternalAddGeneratedFile(\n \"\\n\\025protocol-buffer.proto\\022\\007persons\\\"\\026\\n\\006Pers\"\n \"on\\022\\014\\n\\004name\\030\\001 \\002(\\t\", 56);\n ::google::protobuf::MessageFactory::InternalRegisterGeneratedFile(\n \"protocol-buffer.proto\", &protobuf_RegisterTypes);\n Person::default_instance_ = new Person();\n Person::default_instance_->InitAsDefaultInstance();\n ::google::protobuf::internal::OnShutdown(&protobuf_ShutdownFile_protocol_2dbuffer_2eproto);\n}\n\n// Force AddDescriptors() to be called at static initialization time.\nstruct StaticDescriptorInitializer_protocol_2dbuffer_2eproto {\n StaticDescriptorInitializer_protocol_2dbuffer_2eproto() {\n protobuf_AddDesc_protocol_2dbuffer_2eproto();\n }\n} static_descriptor_initializer_protocol_2dbuffer_2eproto_;\n\n// ===================================================================\n\n#ifndef _MSC_VER\nconst int Person::kNameFieldNumber;\n#endif // !_MSC_VER\n\nPerson::Person()\n : ::google::protobuf::Message() {\n SharedCtor();\n}\n\nvoid Person::InitAsDefaultInstance() {\n}\n\nPerson::Person(const Person& from)\n : ::google::protobuf::Message() {\n SharedCtor();\n MergeFrom(from);\n}\n\nvoid Person::SharedCtor() {\n _cached_size_ = 0;\n name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);\n ::memset(_has_bits_, 0, sizeof(_has_bits_));\n}\n\nPerson::~Person() {\n SharedDtor();\n}\n\nvoid Person::SharedDtor() {\n if (name_ != &::google::protobuf::internal::kEmptyString) {\n delete name_;\n }\n if (this != default_instance_) {\n }\n}\n\nvoid Person::SetCachedSize(int size) const {\n GOOGLE_SAFE_CONCURRENT_WRITES_BEGIN();\n _cached_size_ = size;\n GOOGLE_SAFE_CONCURRENT_WRITES_END();\n}\nconst ::google::protobuf::Descriptor* Person::descriptor() {\n protobuf_AssignDescriptorsOnce();\n return Person_descriptor_;\n}\n\nconst Person& Person::default_instance() {\n if (default_instance_ == NULL) protobuf_AddDesc_protocol_2dbuffer_2eproto();\n return *default_instance_;\n}\n\nPerson* Person::default_instance_ = NULL;\n\nPerson* Person::New() const {\n return new Person;\n}\n\nvoid Person::Clear() {\n if (_has_bits_[0 / 32] & (0xffu << (0 % 32))) {\n if (has_name()) {\n if (name_ != &::google::protobuf::internal::kEmptyString) {\n name_->clear();\n }\n }\n }\n ::memset(_has_bits_, 0, sizeof(_has_bits_));\n mutable_unknown_fields()->Clear();\n}\n\nbool Person::MergePartialFromCodedStream(\n ::google::protobuf::io::CodedInputStream* input) {\n#define DO_(EXPRESSION) if (!(EXPRESSION)) return false\n ::google::protobuf::uint32 tag;\n while ((tag = input->ReadTag()) != 0) {\n switch (::google::protobuf::internal::WireFormatLite::GetTagFieldNumber(tag)) {\n // required string name = 1;\n case 1: {\n if (::google::protobuf::internal::WireFormatLite::GetTagWireType(tag) ==\n ::google::protobuf::internal::WireFormatLite::WIRETYPE_LENGTH_DELIMITED) {\n DO_(::google::protobuf::internal::WireFormatLite::ReadString(\n input, this->mutable_name()));\n ::google::protobuf::internal::WireFormat::VerifyUTF8String(\n this->name().data(), this->name().length(),\n ::google::protobuf::internal::WireFormat::PARSE);\n } else {\n goto handle_uninterpreted;\n }\n if (input->ExpectAtEnd()) return true;\n break;\n }\n\n default: {\n handle_uninterpreted:\n if (::google::protobuf::internal::WireFormatLite::GetTagWireType(tag) ==\n ::google::protobuf::internal::WireFormatLite::WIRETYPE_END_GROUP) {\n return true;\n }\n DO_(::google::protobuf::internal::WireFormat::SkipField(\n input, tag, mutable_unknown_fields()));\n break;\n }\n }\n }\n return true;\n#undef DO_\n}\n\nvoid Person::SerializeWithCachedSizes(\n ::google::protobuf::io::CodedOutputStream* output) const {\n // required string name = 1;\n if (has_name()) {\n ::google::protobuf::internal::WireFormat::VerifyUTF8String(\n this->name().data(), this->name().length(),\n ::google::protobuf::internal::WireFormat::SERIALIZE);\n ::google::protobuf::internal::WireFormatLite::WriteString(\n 1, this->name(), output);\n }\n\n if (!unknown_fields().empty()) {\n ::google::protobuf::internal::WireFormat::SerializeUnknownFields(\n unknown_fields(), output);\n }\n}\n\n::google::protobuf::uint8* Person::SerializeWithCachedSizesToArray(\n ::google::protobuf::uint8* target) const {\n // required string name = 1;\n if (has_name()) {\n ::google::protobuf::internal::WireFormat::VerifyUTF8String(\n this->name().data(), this->name().length(),\n ::google::protobuf::internal::WireFormat::SERIALIZE);\n target =\n ::google::protobuf::internal::WireFormatLite::WriteStringToArray(\n 1, this->name(), target);\n }\n\n if (!unknown_fields().empty()) {\n target = ::google::protobuf::internal::WireFormat::SerializeUnknownFieldsToArray(\n unknown_fields(), target);\n }\n return target;\n}\n\nint Person::ByteSize() const {\n int total_size = 0;\n\n if (_has_bits_[0 / 32] & (0xffu << (0 % 32))) {\n // required string name = 1;\n if (has_name()) {\n total_size += 1 +\n ::google::protobuf::internal::WireFormatLite::StringSize(\n this->name());\n }\n\n }\n if (!unknown_fields().empty()) {\n total_size +=\n ::google::protobuf::internal::WireFormat::ComputeUnknownFieldsSize(\n unknown_fields());\n }\n GOOGLE_SAFE_CONCURRENT_WRITES_BEGIN();\n _cached_size_ = total_size;\n GOOGLE_SAFE_CONCURRENT_WRITES_END();\n return total_size;\n}\n\nvoid Person::MergeFrom(const ::google::protobuf::Message& from) {\n GOOGLE_CHECK_NE(&from, this);\n const Person* source =\n ::google::protobuf::internal::dynamic_cast_if_available(\n &from);\n if (source == NULL) {\n ::google::protobuf::internal::ReflectionOps::Merge(from, this);\n } else {\n MergeFrom(*source);\n }\n}\n\nvoid Person::MergeFrom(const Person& from) {\n GOOGLE_CHECK_NE(&from, this);\n if (from._has_bits_[0 / 32] & (0xffu << (0 % 32))) {\n if (from.has_name()) {\n set_name(from.name());\n }\n }\n mutable_unknown_fields()->MergeFrom(from.unknown_fields());\n}\n\nvoid Person::CopyFrom(const ::google::protobuf::Message& from) {\n if (&from == this) return;\n Clear();\n MergeFrom(from);\n}\n\nvoid Person::CopyFrom(const Person& from) {\n if (&from == this) return;\n Clear();\n MergeFrom(from);\n}\n\nbool Person::IsInitialized() const {\n if ((_has_bits_[0] & 0x00000001) != 0x00000001) return false;\n\n return true;\n}\n\nvoid Person::Swap(Person* other) {\n if (other != this) {\n std::swap(name_, other->name_);\n std::swap(_has_bits_[0], other->_has_bits_[0]);\n _unknown_fields_.Swap(&other->_unknown_fields_);\n std::swap(_cached_size_, other->_cached_size_);\n }\n}\n\n::google::protobuf::Metadata Person::GetMetadata() const {\n protobuf_AssignDescriptorsOnce();\n ::google::protobuf::Metadata metadata;\n metadata.descriptor = Person_descriptor_;\n metadata.reflection = Person_reflection_;\n return metadata;\n}\n\n\n// @@protoc_insertion_point(namespace_scope)\n\n} // namespace persons\n\n// @@protoc_insertion_point(global_scope)\n" }, { "path": "src/test/resources/samples/langs/C++/protocol-buffer.pb.h", "content": "// Generated by the protocol buffer compiler. DO NOT EDIT!\n// source: protocol-buffer.proto\n\n#ifndef PROTOBUF_protocol_2dbuffer_2eproto__INCLUDED\n#define PROTOBUF_protocol_2dbuffer_2eproto__INCLUDED\n\n#include \n\n#include \n\n#if GOOGLE_PROTOBUF_VERSION < 2005000\n#error This file was generated by a newer version of protoc which is\n#error incompatible with your Protocol Buffer headers. Please update\n#error your headers.\n#endif\n#if 2005000 < GOOGLE_PROTOBUF_MIN_PROTOC_VERSION\n#error This file was generated by an older version of protoc which is\n#error incompatible with your Protocol Buffer headers. Please\n#error regenerate this file with a newer version of protoc.\n#endif\n\n#include \n#include \n#include \n#include \n#include \n// @@protoc_insertion_point(includes)\n\nnamespace persons {\n\n// Internal implementation detail -- do not call these.\nvoid protobuf_AddDesc_protocol_2dbuffer_2eproto();\nvoid protobuf_AssignDesc_protocol_2dbuffer_2eproto();\nvoid protobuf_ShutdownFile_protocol_2dbuffer_2eproto();\n\nclass Person;\n\n// ===================================================================\n\nclass Person : public ::google::protobuf::Message {\n public:\n Person();\n virtual ~Person();\n\n Person(const Person& from);\n\n inline Person& operator=(const Person& from) {\n CopyFrom(from);\n return *this;\n }\n\n inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {\n return _unknown_fields_;\n }\n\n inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {\n return &_unknown_fields_;\n }\n\n static const ::google::protobuf::Descriptor* descriptor();\n static const Person& default_instance();\n\n void Swap(Person* other);\n\n // implements Message ----------------------------------------------\n\n Person* New() const;\n void CopyFrom(const ::google::protobuf::Message& from);\n void MergeFrom(const ::google::protobuf::Message& from);\n void CopyFrom(const Person& from);\n void MergeFrom(const Person& from);\n void Clear();\n bool IsInitialized() const;\n\n int ByteSize() const;\n bool MergePartialFromCodedStream(\n ::google::protobuf::io::CodedInputStream* input);\n void SerializeWithCachedSizes(\n ::google::protobuf::io::CodedOutputStream* output) const;\n ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;\n int GetCachedSize() const { return _cached_size_; }\n private:\n void SharedCtor();\n void SharedDtor();\n void SetCachedSize(int size) const;\n public:\n\n ::google::protobuf::Metadata GetMetadata() const;\n\n // nested types ----------------------------------------------------\n\n // accessors -------------------------------------------------------\n\n // required string name = 1;\n inline bool has_name() const;\n inline void clear_name();\n static const int kNameFieldNumber = 1;\n inline const ::std::string& name() const;\n inline void set_name(const ::std::string& value);\n inline void set_name(const char* value);\n inline void set_name(const char* value, size_t size);\n inline ::std::string* mutable_name();\n inline ::std::string* release_name();\n inline void set_allocated_name(::std::string* name);\n\n // @@protoc_insertion_point(class_scope:persons.Person)\n private:\n inline void set_has_name();\n inline void clear_has_name();\n\n ::google::protobuf::UnknownFieldSet _unknown_fields_;\n\n ::std::string* name_;\n\n mutable int _cached_size_;\n ::google::protobuf::uint32 _has_bits_[(1 + 31) / 32];\n\n friend void protobuf_AddDesc_protocol_2dbuffer_2eproto();\n friend void protobuf_AssignDesc_protocol_2dbuffer_2eproto();\n friend void protobuf_ShutdownFile_protocol_2dbuffer_2eproto();\n\n void InitAsDefaultInstance();\n static Person* default_instance_;\n};\n// ===================================================================\n\n\n// ===================================================================\n\n// Person\n\n// required string name = 1;\ninline bool Person::has_name() const {\n return (_has_bits_[0] & 0x00000001u) != 0;\n}\ninline void Person::set_has_name() {\n _has_bits_[0] |= 0x00000001u;\n}\ninline void Person::clear_has_name() {\n _has_bits_[0] &= ~0x00000001u;\n}\ninline void Person::clear_name() {\n if (name_ != &::google::protobuf::internal::kEmptyString) {\n name_->clear();\n }\n clear_has_name();\n}\ninline const ::std::string& Person::name() const {\n return *name_;\n}\ninline void Person::set_name(const ::std::string& value) {\n set_has_name();\n if (name_ == &::google::protobuf::internal::kEmptyString) {\n name_ = new ::std::string;\n }\n name_->assign(value);\n}\ninline void Person::set_name(const char* value) {\n set_has_name();\n if (name_ == &::google::protobuf::internal::kEmptyString) {\n name_ = new ::std::string;\n }\n name_->assign(value);\n}\ninline void Person::set_name(const char* value, size_t size) {\n set_has_name();\n if (name_ == &::google::protobuf::internal::kEmptyString) {\n name_ = new ::std::string;\n }\n name_->assign(reinterpret_cast(value), size);\n}\ninline ::std::string* Person::mutable_name() {\n set_has_name();\n if (name_ == &::google::protobuf::internal::kEmptyString) {\n name_ = new ::std::string;\n }\n return name_;\n}\ninline ::std::string* Person::release_name() {\n clear_has_name();\n if (name_ == &::google::protobuf::internal::kEmptyString) {\n return NULL;\n } else {\n ::std::string* temp = name_;\n name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);\n return temp;\n }\n}\ninline void Person::set_allocated_name(::std::string* name) {\n if (name_ != &::google::protobuf::internal::kEmptyString) {\n delete name_;\n }\n if (name) {\n set_has_name();\n name_ = name;\n } else {\n clear_has_name();\n name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);\n }\n}\n\n\n// @@protoc_insertion_point(namespace_scope)\n\n} // namespace persons\n\n#ifndef SWIG\nnamespace google {\nnamespace protobuf {\n\n\n} // namespace google\n} // namespace protobuf\n#endif // SWIG\n\n// @@protoc_insertion_point(global_scope)\n\n#endif // PROTOBUF_protocol_2dbuffer_2eproto__INCLUDED\n" }, { "path": "src/test/resources/samples/langs/C++/render_adapter.cpp", "content": "#include \r\n\r\nnamespace Gui\r\n{\r\n\r\n}\r\n" }, { "path": "src/test/resources/samples/langs/C++/rpc.h", "content": "// Copyright (C) 2013 Simon Que\n//\n// This file is part of DuinoCube.\n//\n// DuinoCube is free software: you can redistribute it and/or modify\n// it under the terms of the GNU Lesser 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// DuinoCube 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 Lesser General Public License for more details.\n//\n// You should have received a copy of the GNU Lesser General Public License\n// along with DuinoCube. If not, see .\n\n// DuinoCube remote procedure call functions.\n\n#include \n\n// Initializes RPC system.\nvoid rpc_init();\n\n// Runs the RPC server loop forever.\nvoid rpc_server_loop();\n" }, { "path": "src/test/resources/samples/langs/C++/scanner.cc", "content": "// Copyright 2011 the V8 project authors. All rights reserved.\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// * 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// * Neither the name of Google Inc. nor the names of its\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// Features shared by parsing and pre-parsing scanners.\n\n#include \"scanner.h\"\n\n#include \"../include/v8stdint.h\"\n#include \"char-predicates-inl.h\"\n\nnamespace v8 {\nnamespace internal {\n\n// ----------------------------------------------------------------------------\n// Scanner\n\nScanner::Scanner(UnicodeCache* unicode_cache)\n : unicode_cache_(unicode_cache),\n octal_pos_(Location::invalid()),\n harmony_scoping_(false),\n harmony_modules_(false) { }\n\n\nvoid Scanner::Initialize(Utf16CharacterStream* source) {\n source_ = source;\n // Need to capture identifiers in order to recognize \"get\" and \"set\"\n // in object literals.\n Init();\n // Skip initial whitespace allowing HTML comment ends just like\n // after a newline and scan first token.\n has_line_terminator_before_next_ = true;\n SkipWhiteSpace();\n Scan();\n}\n\n\nuc32 Scanner::ScanHexNumber(int expected_length) {\n ASSERT(expected_length <= 4); // prevent overflow\n\n uc32 digits[4] = { 0, 0, 0, 0 };\n uc32 x = 0;\n for (int i = 0; i < expected_length; i++) {\n digits[i] = c0_;\n int d = HexValue(c0_);\n if (d < 0) {\n // According to ECMA-262, 3rd, 7.8.4, page 18, these hex escapes\n // should be illegal, but other JS VMs just return the\n // non-escaped version of the original character.\n\n // Push back digits that we have advanced past.\n for (int j = i-1; j >= 0; j--) {\n PushBack(digits[j]);\n }\n return -1;\n }\n x = x * 16 + d;\n Advance();\n }\n\n return x;\n}\n\n\n// Ensure that tokens can be stored in a byte.\nSTATIC_ASSERT(Token::NUM_TOKENS <= 0x100);\n\n// Table of one-character tokens, by character (0x00..0x7f only).\nstatic const byte one_char_tokens[] = {\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::LPAREN, // 0x28\n Token::RPAREN, // 0x29\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::COMMA, // 0x2c\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::COLON, // 0x3a\n Token::SEMICOLON, // 0x3b\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::CONDITIONAL, // 0x3f\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::LBRACK, // 0x5b\n Token::ILLEGAL,\n Token::RBRACK, // 0x5d\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::ILLEGAL,\n Token::LBRACE, // 0x7b\n Token::ILLEGAL,\n Token::RBRACE, // 0x7d\n Token::BIT_NOT, // 0x7e\n Token::ILLEGAL\n};\n\n\nToken::Value Scanner::Next() {\n current_ = next_;\n has_line_terminator_before_next_ = false;\n has_multiline_comment_before_next_ = false;\n if (static_cast(c0_) <= 0x7f) {\n Token::Value token = static_cast(one_char_tokens[c0_]);\n if (token != Token::ILLEGAL) {\n int pos = source_pos();\n next_.token = token;\n next_.location.beg_pos = pos;\n next_.location.end_pos = pos + 1;\n Advance();\n return current_.token;\n }\n }\n Scan();\n return current_.token;\n}\n\n\nstatic inline bool IsByteOrderMark(uc32 c) {\n // The Unicode value U+FFFE is guaranteed never to be assigned as a\n // Unicode character; this implies that in a Unicode context the\n // 0xFF, 0xFE byte pattern can only be interpreted as the U+FEFF\n // character expressed in little-endian byte order (since it could\n // not be a U+FFFE character expressed in big-endian byte\n // order). Nevertheless, we check for it to be compatible with\n // Spidermonkey.\n return c == 0xFEFF || c == 0xFFFE;\n}\n\n\nbool Scanner::SkipWhiteSpace() {\n int start_position = source_pos();\n\n while (true) {\n // We treat byte-order marks (BOMs) as whitespace for better\n // compatibility with Spidermonkey and other JavaScript engines.\n while (unicode_cache_->IsWhiteSpace(c0_) || IsByteOrderMark(c0_)) {\n // IsWhiteSpace() includes line terminators!\n if (unicode_cache_->IsLineTerminator(c0_)) {\n // Ignore line terminators, but remember them. This is necessary\n // for automatic semicolon insertion.\n has_line_terminator_before_next_ = true;\n }\n Advance();\n }\n\n // If there is an HTML comment end '-->' at the beginning of a\n // line (with only whitespace in front of it), we treat the rest\n // of the line as a comment. This is in line with the way\n // SpiderMonkey handles it.\n if (c0_ == '-' && has_line_terminator_before_next_) {\n Advance();\n if (c0_ == '-') {\n Advance();\n if (c0_ == '>') {\n // Treat the rest of the line as a comment.\n SkipSingleLineComment();\n // Continue skipping white space after the comment.\n continue;\n }\n PushBack('-'); // undo Advance()\n }\n PushBack('-'); // undo Advance()\n }\n // Return whether or not we skipped any characters.\n return source_pos() != start_position;\n }\n}\n\n\nToken::Value Scanner::SkipSingleLineComment() {\n Advance();\n\n // The line terminator at the end of the line is not considered\n // to be part of the single-line comment; it is recognized\n // separately by the lexical grammar and becomes part of the\n // stream of input elements for the syntactic grammar (see\n // ECMA-262, section 7.4).\n while (c0_ >= 0 && !unicode_cache_->IsLineTerminator(c0_)) {\n Advance();\n }\n\n return Token::WHITESPACE;\n}\n\n\nToken::Value Scanner::SkipMultiLineComment() {\n ASSERT(c0_ == '*');\n Advance();\n\n while (c0_ >= 0) {\n uc32 ch = c0_;\n Advance();\n if (unicode_cache_->IsLineTerminator(ch)) {\n // Following ECMA-262, section 7.4, a comment containing\n // a newline will make the comment count as a line-terminator.\n has_multiline_comment_before_next_ = true;\n }\n // If we have reached the end of the multi-line comment, we\n // consume the '/' and insert a whitespace. This way all\n // multi-line comments are treated as whitespace.\n if (ch == '*' && c0_ == '/') {\n c0_ = ' ';\n return Token::WHITESPACE;\n }\n }\n\n // Unterminated multi-line comment.\n return Token::ILLEGAL;\n}\n\n\nToken::Value Scanner::ScanHtmlComment() {\n // Check for -=\n Advance();\n if (c0_ == '-') {\n Advance();\n if (c0_ == '>' && has_line_terminator_before_next_) {\n // For compatibility with SpiderMonkey, we skip lines that\n // start with an HTML comment end '-->'.\n token = SkipSingleLineComment();\n } else {\n token = Token::DEC;\n }\n } else if (c0_ == '=') {\n token = Select(Token::ASSIGN_SUB);\n } else {\n token = Token::SUB;\n }\n break;\n\n case '*':\n // * *=\n token = Select('=', Token::ASSIGN_MUL, Token::MUL);\n break;\n\n case '%':\n // % %=\n token = Select('=', Token::ASSIGN_MOD, Token::MOD);\n break;\n\n case '/':\n // / // /* /=\n Advance();\n if (c0_ == '/') {\n token = SkipSingleLineComment();\n } else if (c0_ == '*') {\n token = SkipMultiLineComment();\n } else if (c0_ == '=') {\n token = Select(Token::ASSIGN_DIV);\n } else {\n token = Token::DIV;\n }\n break;\n\n case '&':\n // & && &=\n Advance();\n if (c0_ == '&') {\n token = Select(Token::AND);\n } else if (c0_ == '=') {\n token = Select(Token::ASSIGN_BIT_AND);\n } else {\n token = Token::BIT_AND;\n }\n break;\n\n case '|':\n // | || |=\n Advance();\n if (c0_ == '|') {\n token = Select(Token::OR);\n } else if (c0_ == '=') {\n token = Select(Token::ASSIGN_BIT_OR);\n } else {\n token = Token::BIT_OR;\n }\n break;\n\n case '^':\n // ^ ^=\n token = Select('=', Token::ASSIGN_BIT_XOR, Token::BIT_XOR);\n break;\n\n case '.':\n // . Number\n Advance();\n if (IsDecimalDigit(c0_)) {\n token = ScanNumber(true);\n } else {\n token = Token::PERIOD;\n }\n break;\n\n case ':':\n token = Select(Token::COLON);\n break;\n\n case ';':\n token = Select(Token::SEMICOLON);\n break;\n\n case ',':\n token = Select(Token::COMMA);\n break;\n\n case '(':\n token = Select(Token::LPAREN);\n break;\n\n case ')':\n token = Select(Token::RPAREN);\n break;\n\n case '[':\n token = Select(Token::LBRACK);\n break;\n\n case ']':\n token = Select(Token::RBRACK);\n break;\n\n case '{':\n token = Select(Token::LBRACE);\n break;\n\n case '}':\n token = Select(Token::RBRACE);\n break;\n\n case '?':\n token = Select(Token::CONDITIONAL);\n break;\n\n case '~':\n token = Select(Token::BIT_NOT);\n break;\n\n default:\n if (unicode_cache_->IsIdentifierStart(c0_)) {\n token = ScanIdentifierOrKeyword();\n } else if (IsDecimalDigit(c0_)) {\n token = ScanNumber(false);\n } else if (SkipWhiteSpace()) {\n token = Token::WHITESPACE;\n } else if (c0_ < 0) {\n token = Token::EOS;\n } else {\n token = Select(Token::ILLEGAL);\n }\n break;\n }\n\n // Continue scanning for tokens as long as we're just skipping\n // whitespace.\n } while (token == Token::WHITESPACE);\n\n next_.location.end_pos = source_pos();\n next_.token = token;\n}\n\n\nvoid Scanner::SeekForward(int pos) {\n // After this call, we will have the token at the given position as\n // the \"next\" token. The \"current\" token will be invalid.\n if (pos == next_.location.beg_pos) return;\n int current_pos = source_pos();\n ASSERT_EQ(next_.location.end_pos, current_pos);\n // Positions inside the lookahead token aren't supported.\n ASSERT(pos >= current_pos);\n if (pos != current_pos) {\n source_->SeekForward(pos - source_->pos());\n Advance();\n // This function is only called to seek to the location\n // of the end of a function (at the \"}\" token). It doesn't matter\n // whether there was a line terminator in the part we skip.\n has_line_terminator_before_next_ = false;\n has_multiline_comment_before_next_ = false;\n }\n Scan();\n}\n\n\nbool Scanner::ScanEscape() {\n uc32 c = c0_;\n Advance();\n\n // Skip escaped newlines.\n if (unicode_cache_->IsLineTerminator(c)) {\n // Allow CR+LF newlines in multiline string literals.\n if (IsCarriageReturn(c) && IsLineFeed(c0_)) Advance();\n // Allow LF+CR newlines in multiline string literals.\n if (IsLineFeed(c) && IsCarriageReturn(c0_)) Advance();\n return true;\n }\n\n switch (c) {\n case '\\'': // fall through\n case '\"' : // fall through\n case '\\\\': break;\n case 'b' : c = '\\b'; break;\n case 'f' : c = '\\f'; break;\n case 'n' : c = '\\n'; break;\n case 'r' : c = '\\r'; break;\n case 't' : c = '\\t'; break;\n case 'u' : {\n c = ScanHexNumber(4);\n if (c < 0) return false;\n break;\n }\n case 'v' : c = '\\v'; break;\n case 'x' : {\n c = ScanHexNumber(2);\n if (c < 0) return false;\n break;\n }\n case '0' : // fall through\n case '1' : // fall through\n case '2' : // fall through\n case '3' : // fall through\n case '4' : // fall through\n case '5' : // fall through\n case '6' : // fall through\n case '7' : c = ScanOctalEscape(c, 2); break;\n }\n\n // According to ECMA-262, section 7.8.4, characters not covered by the\n // above cases should be illegal, but they are commonly handled as\n // non-escaped characters by JS VMs.\n AddLiteralChar(c);\n return true;\n}\n\n\n// Octal escapes of the forms '\\0xx' and '\\xxx' are not a part of\n// ECMA-262. Other JS VMs support them.\nuc32 Scanner::ScanOctalEscape(uc32 c, int length) {\n uc32 x = c - '0';\n int i = 0;\n for (; i < length; i++) {\n int d = c0_ - '0';\n if (d < 0 || d > 7) break;\n int nx = x * 8 + d;\n if (nx >= 256) break;\n x = nx;\n Advance();\n }\n // Anything except '\\0' is an octal escape sequence, illegal in strict mode.\n // Remember the position of octal escape sequences so that an error\n // can be reported later (in strict mode).\n // We don't report the error immediately, because the octal escape can\n // occur before the \"use strict\" directive.\n if (c != '0' || i > 0) {\n octal_pos_ = Location(source_pos() - i - 1, source_pos() - 1);\n }\n return x;\n}\n\n\nToken::Value Scanner::ScanString() {\n uc32 quote = c0_;\n Advance(); // consume quote\n\n LiteralScope literal(this);\n while (c0_ != quote && c0_ >= 0\n && !unicode_cache_->IsLineTerminator(c0_)) {\n uc32 c = c0_;\n Advance();\n if (c == '\\\\') {\n if (c0_ < 0 || !ScanEscape()) return Token::ILLEGAL;\n } else {\n AddLiteralChar(c);\n }\n }\n if (c0_ != quote) return Token::ILLEGAL;\n literal.Complete();\n\n Advance(); // consume quote\n return Token::STRING;\n}\n\n\nvoid Scanner::ScanDecimalDigits() {\n while (IsDecimalDigit(c0_))\n AddLiteralCharAdvance();\n}\n\n\nToken::Value Scanner::ScanNumber(bool seen_period) {\n ASSERT(IsDecimalDigit(c0_)); // the first digit of the number or the fraction\n\n enum { DECIMAL, HEX, OCTAL } kind = DECIMAL;\n\n LiteralScope literal(this);\n if (seen_period) {\n // we have already seen a decimal point of the float\n AddLiteralChar('.');\n ScanDecimalDigits(); // we know we have at least one digit\n\n } else {\n // if the first character is '0' we must check for octals and hex\n if (c0_ == '0') {\n int start_pos = source_pos(); // For reporting octal positions.\n AddLiteralCharAdvance();\n\n // either 0, 0exxx, 0Exxx, 0.xxx, an octal number, or a hex number\n if (c0_ == 'x' || c0_ == 'X') {\n // hex number\n kind = HEX;\n AddLiteralCharAdvance();\n if (!IsHexDigit(c0_)) {\n // we must have at least one hex digit after 'x'/'X'\n return Token::ILLEGAL;\n }\n while (IsHexDigit(c0_)) {\n AddLiteralCharAdvance();\n }\n } else if ('0' <= c0_ && c0_ <= '7') {\n // (possible) octal number\n kind = OCTAL;\n while (true) {\n if (c0_ == '8' || c0_ == '9') {\n kind = DECIMAL;\n break;\n }\n if (c0_ < '0' || '7' < c0_) {\n // Octal literal finished.\n octal_pos_ = Location(start_pos, source_pos());\n break;\n }\n AddLiteralCharAdvance();\n }\n }\n }\n\n // Parse decimal digits and allow trailing fractional part.\n if (kind == DECIMAL) {\n ScanDecimalDigits(); // optional\n if (c0_ == '.') {\n AddLiteralCharAdvance();\n ScanDecimalDigits(); // optional\n }\n }\n }\n\n // scan exponent, if any\n if (c0_ == 'e' || c0_ == 'E') {\n ASSERT(kind != HEX); // 'e'/'E' must be scanned as part of the hex number\n if (kind == OCTAL) return Token::ILLEGAL; // no exponent for octals allowed\n // scan exponent\n AddLiteralCharAdvance();\n if (c0_ == '+' || c0_ == '-')\n AddLiteralCharAdvance();\n if (!IsDecimalDigit(c0_)) {\n // we must have at least one decimal digit after 'e'/'E'\n return Token::ILLEGAL;\n }\n ScanDecimalDigits();\n }\n\n // The source character immediately following a numeric literal must\n // not be an identifier start or a decimal digit; see ECMA-262\n // section 7.8.3, page 17 (note that we read only one decimal digit\n // if the value is 0).\n if (IsDecimalDigit(c0_) || unicode_cache_->IsIdentifierStart(c0_))\n return Token::ILLEGAL;\n\n literal.Complete();\n\n return Token::NUMBER;\n}\n\n\nuc32 Scanner::ScanIdentifierUnicodeEscape() {\n Advance();\n if (c0_ != 'u') return -1;\n Advance();\n uc32 result = ScanHexNumber(4);\n if (result < 0) PushBack('u');\n return result;\n}\n\n\n// ----------------------------------------------------------------------------\n// Keyword Matcher\n\n#define KEYWORDS(KEYWORD_GROUP, KEYWORD) \\\n KEYWORD_GROUP('b') \\\n KEYWORD(\"break\", Token::BREAK) \\\n KEYWORD_GROUP('c') \\\n KEYWORD(\"case\", Token::CASE) \\\n KEYWORD(\"catch\", Token::CATCH) \\\n KEYWORD(\"class\", Token::FUTURE_RESERVED_WORD) \\\n KEYWORD(\"const\", Token::CONST) \\\n KEYWORD(\"continue\", Token::CONTINUE) \\\n KEYWORD_GROUP('d') \\\n KEYWORD(\"debugger\", Token::DEBUGGER) \\\n KEYWORD(\"default\", Token::DEFAULT) \\\n KEYWORD(\"delete\", Token::DELETE) \\\n KEYWORD(\"do\", Token::DO) \\\n KEYWORD_GROUP('e') \\\n KEYWORD(\"else\", Token::ELSE) \\\n KEYWORD(\"enum\", Token::FUTURE_RESERVED_WORD) \\\n KEYWORD(\"export\", harmony_modules \\\n ? Token::EXPORT : Token::FUTURE_RESERVED_WORD) \\\n KEYWORD(\"extends\", Token::FUTURE_RESERVED_WORD) \\\n KEYWORD_GROUP('f') \\\n KEYWORD(\"false\", Token::FALSE_LITERAL) \\\n KEYWORD(\"finally\", Token::FINALLY) \\\n KEYWORD(\"for\", Token::FOR) \\\n KEYWORD(\"function\", Token::FUNCTION) \\\n KEYWORD_GROUP('i') \\\n KEYWORD(\"if\", Token::IF) \\\n KEYWORD(\"implements\", Token::FUTURE_STRICT_RESERVED_WORD) \\\n KEYWORD(\"import\", harmony_modules \\\n ? Token::IMPORT : Token::FUTURE_RESERVED_WORD) \\\n KEYWORD(\"in\", Token::IN) \\\n KEYWORD(\"instanceof\", Token::INSTANCEOF) \\\n KEYWORD(\"interface\", Token::FUTURE_STRICT_RESERVED_WORD) \\\n KEYWORD_GROUP('l') \\\n KEYWORD(\"let\", harmony_scoping \\\n ? Token::LET : Token::FUTURE_STRICT_RESERVED_WORD) \\\n KEYWORD_GROUP('n') \\\n KEYWORD(\"new\", Token::NEW) \\\n KEYWORD(\"null\", Token::NULL_LITERAL) \\\n KEYWORD_GROUP('p') \\\n KEYWORD(\"package\", Token::FUTURE_STRICT_RESERVED_WORD) \\\n KEYWORD(\"private\", Token::FUTURE_STRICT_RESERVED_WORD) \\\n KEYWORD(\"protected\", Token::FUTURE_STRICT_RESERVED_WORD) \\\n KEYWORD(\"public\", Token::FUTURE_STRICT_RESERVED_WORD) \\\n KEYWORD_GROUP('r') \\\n KEYWORD(\"return\", Token::RETURN) \\\n KEYWORD_GROUP('s') \\\n KEYWORD(\"static\", Token::FUTURE_STRICT_RESERVED_WORD) \\\n KEYWORD(\"super\", Token::FUTURE_RESERVED_WORD) \\\n KEYWORD(\"switch\", Token::SWITCH) \\\n KEYWORD_GROUP('t') \\\n KEYWORD(\"this\", Token::THIS) \\\n KEYWORD(\"throw\", Token::THROW) \\\n KEYWORD(\"true\", Token::TRUE_LITERAL) \\\n KEYWORD(\"try\", Token::TRY) \\\n KEYWORD(\"typeof\", Token::TYPEOF) \\\n KEYWORD_GROUP('v') \\\n KEYWORD(\"var\", Token::VAR) \\\n KEYWORD(\"void\", Token::VOID) \\\n KEYWORD_GROUP('w') \\\n KEYWORD(\"while\", Token::WHILE) \\\n KEYWORD(\"with\", Token::WITH) \\\n KEYWORD_GROUP('y') \\\n KEYWORD(\"yield\", Token::FUTURE_STRICT_RESERVED_WORD)\n\n\nstatic Token::Value KeywordOrIdentifierToken(const char* input,\n int input_length,\n bool harmony_scoping,\n bool harmony_modules) {\n ASSERT(input_length >= 1);\n const int kMinLength = 2;\n const int kMaxLength = 10;\n if (input_length < kMinLength || input_length > kMaxLength) {\n return Token::IDENTIFIER;\n }\n switch (input[0]) {\n default:\n#define KEYWORD_GROUP_CASE(ch) \\\n break; \\\n case ch:\n#define KEYWORD(keyword, token) \\\n { \\\n /* 'keyword' is a char array, so sizeof(keyword) is */ \\\n /* strlen(keyword) plus 1 for the NUL char. */ \\\n const int keyword_length = sizeof(keyword) - 1; \\\n STATIC_ASSERT(keyword_length >= kMinLength); \\\n STATIC_ASSERT(keyword_length <= kMaxLength); \\\n if (input_length == keyword_length && \\\n input[1] == keyword[1] && \\\n (keyword_length <= 2 || input[2] == keyword[2]) && \\\n (keyword_length <= 3 || input[3] == keyword[3]) && \\\n (keyword_length <= 4 || input[4] == keyword[4]) && \\\n (keyword_length <= 5 || input[5] == keyword[5]) && \\\n (keyword_length <= 6 || input[6] == keyword[6]) && \\\n (keyword_length <= 7 || input[7] == keyword[7]) && \\\n (keyword_length <= 8 || input[8] == keyword[8]) && \\\n (keyword_length <= 9 || input[9] == keyword[9])) { \\\n return token; \\\n } \\\n }\n KEYWORDS(KEYWORD_GROUP_CASE, KEYWORD)\n }\n return Token::IDENTIFIER;\n}\n\n\nToken::Value Scanner::ScanIdentifierOrKeyword() {\n ASSERT(unicode_cache_->IsIdentifierStart(c0_));\n LiteralScope literal(this);\n // Scan identifier start character.\n if (c0_ == '\\\\') {\n uc32 c = ScanIdentifierUnicodeEscape();\n // Only allow legal identifier start characters.\n if (c < 0 ||\n c == '\\\\' || // No recursive escapes.\n !unicode_cache_->IsIdentifierStart(c)) {\n return Token::ILLEGAL;\n }\n AddLiteralChar(c);\n return ScanIdentifierSuffix(&literal);\n }\n\n uc32 first_char = c0_;\n Advance();\n AddLiteralChar(first_char);\n\n // Scan the rest of the identifier characters.\n while (unicode_cache_->IsIdentifierPart(c0_)) {\n if (c0_ != '\\\\') {\n uc32 next_char = c0_;\n Advance();\n AddLiteralChar(next_char);\n continue;\n }\n // Fallthrough if no longer able to complete keyword.\n return ScanIdentifierSuffix(&literal);\n }\n\n literal.Complete();\n\n if (next_.literal_chars->is_ascii()) {\n Vector chars = next_.literal_chars->ascii_literal();\n return KeywordOrIdentifierToken(chars.start(),\n chars.length(),\n harmony_scoping_,\n harmony_modules_);\n }\n\n return Token::IDENTIFIER;\n}\n\n\nToken::Value Scanner::ScanIdentifierSuffix(LiteralScope* literal) {\n // Scan the rest of the identifier characters.\n while (unicode_cache_->IsIdentifierPart(c0_)) {\n if (c0_ == '\\\\') {\n uc32 c = ScanIdentifierUnicodeEscape();\n // Only allow legal identifier part characters.\n if (c < 0 ||\n c == '\\\\' ||\n !unicode_cache_->IsIdentifierPart(c)) {\n return Token::ILLEGAL;\n }\n AddLiteralChar(c);\n } else {\n AddLiteralChar(c0_);\n Advance();\n }\n }\n literal->Complete();\n\n return Token::IDENTIFIER;\n}\n\n\nbool Scanner::ScanRegExpPattern(bool seen_equal) {\n // Scan: ('/' | '/=') RegularExpressionBody '/' RegularExpressionFlags\n bool in_character_class = false;\n\n // Previous token is either '/' or '/=', in the second case, the\n // pattern starts at =.\n next_.location.beg_pos = source_pos() - (seen_equal ? 2 : 1);\n next_.location.end_pos = source_pos() - (seen_equal ? 1 : 0);\n\n // Scan regular expression body: According to ECMA-262, 3rd, 7.8.5,\n // the scanner should pass uninterpreted bodies to the RegExp\n // constructor.\n LiteralScope literal(this);\n if (seen_equal) {\n AddLiteralChar('=');\n }\n\n while (c0_ != '/' || in_character_class) {\n if (unicode_cache_->IsLineTerminator(c0_) || c0_ < 0) return false;\n if (c0_ == '\\\\') { // Escape sequence.\n AddLiteralCharAdvance();\n if (unicode_cache_->IsLineTerminator(c0_) || c0_ < 0) return false;\n AddLiteralCharAdvance();\n // If the escape allows more characters, i.e., \\x??, \\u????, or \\c?,\n // only \"safe\" characters are allowed (letters, digits, underscore),\n // otherwise the escape isn't valid and the invalid character has\n // its normal meaning. I.e., we can just continue scanning without\n // worrying whether the following characters are part of the escape\n // or not, since any '/', '\\\\' or '[' is guaranteed to not be part\n // of the escape sequence.\n\n // TODO(896): At some point, parse RegExps more throughly to capture\n // octal esacpes in strict mode.\n } else { // Unescaped character.\n if (c0_ == '[') in_character_class = true;\n if (c0_ == ']') in_character_class = false;\n AddLiteralCharAdvance();\n }\n }\n Advance(); // consume '/'\n\n literal.Complete();\n\n return true;\n}\n\n\nbool Scanner::ScanLiteralUnicodeEscape() {\n ASSERT(c0_ == '\\\\');\n uc32 chars_read[6] = {'\\\\', 'u', 0, 0, 0, 0};\n Advance();\n int i = 1;\n if (c0_ == 'u') {\n i++;\n while (i < 6) {\n Advance();\n if (!IsHexDigit(c0_)) break;\n chars_read[i] = c0_;\n i++;\n }\n }\n if (i < 6) {\n // Incomplete escape. Undo all advances and return false.\n while (i > 0) {\n i--;\n PushBack(chars_read[i]);\n }\n return false;\n }\n // Complete escape. Add all chars to current literal buffer.\n for (int i = 0; i < 6; i++) {\n AddLiteralChar(chars_read[i]);\n }\n return true;\n}\n\n\nbool Scanner::ScanRegExpFlags() {\n // Scan regular expression flags.\n LiteralScope literal(this);\n while (unicode_cache_->IsIdentifierPart(c0_)) {\n if (c0_ != '\\\\') {\n AddLiteralCharAdvance();\n } else {\n if (!ScanLiteralUnicodeEscape()) {\n break;\n }\n }\n }\n literal.Complete();\n\n next_.location.end_pos = source_pos() - 1;\n return true;\n}\n\n} } // namespace v8::internal\n" }, { "path": "src/test/resources/samples/langs/C++/scanner.h", "content": "// Copyright 2011 the V8 project authors. All rights reserved.\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// * 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// * Neither the name of Google Inc. nor the names of its\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// Features shared by parsing and pre-parsing scanners.\n\n#ifndef V8_SCANNER_H_\n#define V8_SCANNER_H_\n\n#include \"allocation.h\"\n#include \"char-predicates.h\"\n#include \"checks.h\"\n#include \"globals.h\"\n#include \"token.h\"\n#include \"unicode-inl.h\"\n#include \"utils.h\"\n\nnamespace v8 {\nnamespace internal {\n\n\n// General collection of (multi-)bit-flags that can be passed to scanners and\n// parsers to signify their (initial) mode of operation.\nenum ParsingFlags {\n kNoParsingFlags = 0,\n // Embed LanguageMode values in parsing flags, i.e., equivalent to:\n // CLASSIC_MODE = 0,\n // STRICT_MODE,\n // EXTENDED_MODE,\n kLanguageModeMask = 0x03,\n kAllowLazy = 0x04,\n kAllowNativesSyntax = 0x08,\n kAllowModules = 0x10\n};\n\nSTATIC_ASSERT((kLanguageModeMask & CLASSIC_MODE) == CLASSIC_MODE);\nSTATIC_ASSERT((kLanguageModeMask & STRICT_MODE) == STRICT_MODE);\nSTATIC_ASSERT((kLanguageModeMask & EXTENDED_MODE) == EXTENDED_MODE);\n\n\n// Returns the value (0 .. 15) of a hexadecimal character c.\n// If c is not a legal hexadecimal character, returns a value < 0.\ninline int HexValue(uc32 c) {\n c -= '0';\n if (static_cast(c) <= 9) return c;\n c = (c | 0x20) - ('a' - '0'); // detect 0x11..0x16 and 0x31..0x36.\n if (static_cast(c) <= 5) return c + 10;\n return -1;\n}\n\n\n// ---------------------------------------------------------------------\n// Buffered stream of UTF-16 code units, using an internal UTF-16 buffer.\n// A code unit is a 16 bit value representing either a 16 bit code point\n// or one part of a surrogate pair that make a single 21 bit code point.\n\nclass Utf16CharacterStream {\n public:\n Utf16CharacterStream() : pos_(0) { }\n virtual ~Utf16CharacterStream() { }\n\n // Returns and advances past the next UTF-16 code unit in the input\n // stream. If there are no more code units, it returns a negative\n // value.\n inline uc32 Advance() {\n if (buffer_cursor_ < buffer_end_ || ReadBlock()) {\n pos_++;\n return static_cast(*(buffer_cursor_++));\n }\n // Note: currently the following increment is necessary to avoid a\n // parser problem! The scanner treats the final kEndOfInput as\n // a code unit with a position, and does math relative to that\n // position.\n pos_++;\n\n return kEndOfInput;\n }\n\n // Return the current position in the code unit stream.\n // Starts at zero.\n inline unsigned pos() const { return pos_; }\n\n // Skips forward past the next code_unit_count UTF-16 code units\n // in the input, or until the end of input if that comes sooner.\n // Returns the number of code units actually skipped. If less\n // than code_unit_count,\n inline unsigned SeekForward(unsigned code_unit_count) {\n unsigned buffered_chars =\n static_cast(buffer_end_ - buffer_cursor_);\n if (code_unit_count <= buffered_chars) {\n buffer_cursor_ += code_unit_count;\n pos_ += code_unit_count;\n return code_unit_count;\n }\n return SlowSeekForward(code_unit_count);\n }\n\n // Pushes back the most recently read UTF-16 code unit (or negative\n // value if at end of input), i.e., the value returned by the most recent\n // call to Advance.\n // Must not be used right after calling SeekForward.\n virtual void PushBack(int32_t code_unit) = 0;\n\n protected:\n static const uc32 kEndOfInput = -1;\n\n // Ensures that the buffer_cursor_ points to the code_unit at\n // position pos_ of the input, if possible. If the position\n // is at or after the end of the input, return false. If there\n // are more code_units available, return true.\n virtual bool ReadBlock() = 0;\n virtual unsigned SlowSeekForward(unsigned code_unit_count) = 0;\n\n const uc16* buffer_cursor_;\n const uc16* buffer_end_;\n unsigned pos_;\n};\n\n\nclass UnicodeCache {\n// ---------------------------------------------------------------------\n// Caching predicates used by scanners.\n public:\n UnicodeCache() {}\n typedef unibrow::Utf8InputBuffer<1024> Utf8Decoder;\n\n StaticResource* utf8_decoder() {\n return &utf8_decoder_;\n }\n\n bool IsIdentifierStart(unibrow::uchar c) { return kIsIdentifierStart.get(c); }\n bool IsIdentifierPart(unibrow::uchar c) { return kIsIdentifierPart.get(c); }\n bool IsLineTerminator(unibrow::uchar c) { return kIsLineTerminator.get(c); }\n bool IsWhiteSpace(unibrow::uchar c) { return kIsWhiteSpace.get(c); }\n\n private:\n unibrow::Predicate kIsIdentifierStart;\n unibrow::Predicate kIsIdentifierPart;\n unibrow::Predicate kIsLineTerminator;\n unibrow::Predicate kIsWhiteSpace;\n StaticResource utf8_decoder_;\n\n DISALLOW_COPY_AND_ASSIGN(UnicodeCache);\n};\n\n\n// ----------------------------------------------------------------------------\n// LiteralBuffer - Collector of chars of literals.\n\nclass LiteralBuffer {\n public:\n LiteralBuffer() : is_ascii_(true), position_(0), backing_store_() { }\n\n ~LiteralBuffer() {\n if (backing_store_.length() > 0) {\n backing_store_.Dispose();\n }\n }\n\n INLINE(void AddChar(uint32_t code_unit)) {\n if (position_ >= backing_store_.length()) ExpandBuffer();\n if (is_ascii_) {\n if (code_unit < kMaxAsciiCharCodeU) {\n backing_store_[position_] = static_cast(code_unit);\n position_ += kASCIISize;\n return;\n }\n ConvertToUtf16();\n }\n ASSERT(code_unit < 0x10000u);\n *reinterpret_cast(&backing_store_[position_]) = code_unit;\n position_ += kUC16Size;\n }\n\n bool is_ascii() { return is_ascii_; }\n\n Vector utf16_literal() {\n ASSERT(!is_ascii_);\n ASSERT((position_ & 0x1) == 0);\n return Vector(\n reinterpret_cast(backing_store_.start()),\n position_ >> 1);\n }\n\n Vector ascii_literal() {\n ASSERT(is_ascii_);\n return Vector(\n reinterpret_cast(backing_store_.start()),\n position_);\n }\n\n int length() {\n return is_ascii_ ? position_ : (position_ >> 1);\n }\n\n void Reset() {\n position_ = 0;\n is_ascii_ = true;\n }\n\n private:\n static const int kInitialCapacity = 16;\n static const int kGrowthFactory = 4;\n static const int kMinConversionSlack = 256;\n static const int kMaxGrowth = 1 * MB;\n inline int NewCapacity(int min_capacity) {\n int capacity = Max(min_capacity, backing_store_.length());\n int new_capacity = Min(capacity * kGrowthFactory, capacity + kMaxGrowth);\n return new_capacity;\n }\n\n void ExpandBuffer() {\n Vector new_store = Vector::New(NewCapacity(kInitialCapacity));\n memcpy(new_store.start(), backing_store_.start(), position_);\n backing_store_.Dispose();\n backing_store_ = new_store;\n }\n\n void ConvertToUtf16() {\n ASSERT(is_ascii_);\n Vector new_store;\n int new_content_size = position_ * kUC16Size;\n if (new_content_size >= backing_store_.length()) {\n // Ensure room for all currently read code units as UC16 as well\n // as the code unit about to be stored.\n new_store = Vector::New(NewCapacity(new_content_size));\n } else {\n new_store = backing_store_;\n }\n char* src = reinterpret_cast(backing_store_.start());\n uc16* dst = reinterpret_cast(new_store.start());\n for (int i = position_ - 1; i >= 0; i--) {\n dst[i] = src[i];\n }\n if (new_store.start() != backing_store_.start()) {\n backing_store_.Dispose();\n backing_store_ = new_store;\n }\n position_ = new_content_size;\n is_ascii_ = false;\n }\n\n bool is_ascii_;\n int position_;\n Vector backing_store_;\n\n DISALLOW_COPY_AND_ASSIGN(LiteralBuffer);\n};\n\n\n// ----------------------------------------------------------------------------\n// JavaScript Scanner.\n\nclass Scanner {\n public:\n // Scoped helper for literal recording. Automatically drops the literal\n // if aborting the scanning before it's complete.\n class LiteralScope {\n public:\n explicit LiteralScope(Scanner* self)\n : scanner_(self), complete_(false) {\n scanner_->StartLiteral();\n }\n ~LiteralScope() {\n if (!complete_) scanner_->DropLiteral();\n }\n void Complete() {\n scanner_->TerminateLiteral();\n complete_ = true;\n }\n\n private:\n Scanner* scanner_;\n bool complete_;\n };\n\n // Representation of an interval of source positions.\n struct Location {\n Location(int b, int e) : beg_pos(b), end_pos(e) { }\n Location() : beg_pos(0), end_pos(0) { }\n\n bool IsValid() const {\n return beg_pos >= 0 && end_pos >= beg_pos;\n }\n\n static Location invalid() { return Location(-1, -1); }\n\n int beg_pos;\n int end_pos;\n };\n\n // -1 is outside of the range of any real source code.\n static const int kNoOctalLocation = -1;\n\n typedef unibrow::Utf8InputBuffer<1024> Utf8Decoder;\n\n explicit Scanner(UnicodeCache* scanner_contants);\n\n void Initialize(Utf16CharacterStream* source);\n\n // Returns the next token and advances input.\n Token::Value Next();\n // Returns the current token again.\n Token::Value current_token() { return current_.token; }\n // Returns the location information for the current token\n // (the token last returned by Next()).\n Location location() const { return current_.location; }\n // Returns the literal string, if any, for the current token (the\n // token last returned by Next()). The string is 0-terminated.\n // Literal strings are collected for identifiers, strings, and\n // numbers.\n // These functions only give the correct result if the literal\n // was scanned between calls to StartLiteral() and TerminateLiteral().\n Vector literal_ascii_string() {\n ASSERT_NOT_NULL(current_.literal_chars);\n return current_.literal_chars->ascii_literal();\n }\n Vector literal_utf16_string() {\n ASSERT_NOT_NULL(current_.literal_chars);\n return current_.literal_chars->utf16_literal();\n }\n bool is_literal_ascii() {\n ASSERT_NOT_NULL(current_.literal_chars);\n return current_.literal_chars->is_ascii();\n }\n int literal_length() const {\n ASSERT_NOT_NULL(current_.literal_chars);\n return current_.literal_chars->length();\n }\n\n bool literal_contains_escapes() const {\n Location location = current_.location;\n int source_length = (location.end_pos - location.beg_pos);\n if (current_.token == Token::STRING) {\n // Subtract delimiters.\n source_length -= 2;\n }\n return current_.literal_chars->length() != source_length;\n }\n\n // Similar functions for the upcoming token.\n\n // One token look-ahead (past the token returned by Next()).\n Token::Value peek() const { return next_.token; }\n\n Location peek_location() const { return next_.location; }\n\n // Returns the literal string for the next token (the token that\n // would be returned if Next() were called).\n Vector next_literal_ascii_string() {\n ASSERT_NOT_NULL(next_.literal_chars);\n return next_.literal_chars->ascii_literal();\n }\n Vector next_literal_utf16_string() {\n ASSERT_NOT_NULL(next_.literal_chars);\n return next_.literal_chars->utf16_literal();\n }\n bool is_next_literal_ascii() {\n ASSERT_NOT_NULL(next_.literal_chars);\n return next_.literal_chars->is_ascii();\n }\n int next_literal_length() const {\n ASSERT_NOT_NULL(next_.literal_chars);\n return next_.literal_chars->length();\n }\n\n UnicodeCache* unicode_cache() { return unicode_cache_; }\n\n static const int kCharacterLookaheadBufferSize = 1;\n\n // Scans octal escape sequence. Also accepts \"\\0\" decimal escape sequence.\n uc32 ScanOctalEscape(uc32 c, int length);\n\n // Returns the location of the last seen octal literal.\n Location octal_position() const { return octal_pos_; }\n void clear_octal_position() { octal_pos_ = Location::invalid(); }\n\n // Seek forward to the given position. This operation does not\n // work in general, for instance when there are pushed back\n // characters, but works for seeking forward until simple delimiter\n // tokens, which is what it is used for.\n void SeekForward(int pos);\n\n bool HarmonyScoping() const {\n return harmony_scoping_;\n }\n void SetHarmonyScoping(bool scoping) {\n harmony_scoping_ = scoping;\n }\n bool HarmonyModules() const {\n return harmony_modules_;\n }\n void SetHarmonyModules(bool modules) {\n harmony_modules_ = modules;\n }\n\n\n // Returns true if there was a line terminator before the peek'ed token,\n // possibly inside a multi-line comment.\n bool HasAnyLineTerminatorBeforeNext() const {\n return has_line_terminator_before_next_ ||\n has_multiline_comment_before_next_;\n }\n\n // Scans the input as a regular expression pattern, previous\n // character(s) must be /(=). Returns true if a pattern is scanned.\n bool ScanRegExpPattern(bool seen_equal);\n // Returns true if regexp flags are scanned (always since flags can\n // be empty).\n bool ScanRegExpFlags();\n\n // Tells whether the buffer contains an identifier (no escapes).\n // Used for checking if a property name is an identifier.\n static bool IsIdentifier(unibrow::CharacterStream* buffer);\n\n private:\n // The current and look-ahead token.\n struct TokenDesc {\n Token::Value token;\n Location location;\n LiteralBuffer* literal_chars;\n };\n\n // Call this after setting source_ to the input.\n void Init() {\n // Set c0_ (one character ahead)\n STATIC_ASSERT(kCharacterLookaheadBufferSize == 1);\n Advance();\n // Initialize current_ to not refer to a literal.\n current_.literal_chars = NULL;\n }\n\n // Literal buffer support\n inline void StartLiteral() {\n LiteralBuffer* free_buffer = (current_.literal_chars == &literal_buffer1_) ?\n &literal_buffer2_ : &literal_buffer1_;\n free_buffer->Reset();\n next_.literal_chars = free_buffer;\n }\n\n INLINE(void AddLiteralChar(uc32 c)) {\n ASSERT_NOT_NULL(next_.literal_chars);\n next_.literal_chars->AddChar(c);\n }\n\n // Complete scanning of a literal.\n inline void TerminateLiteral() {\n // Does nothing in the current implementation.\n }\n\n // Stops scanning of a literal and drop the collected characters,\n // e.g., due to an encountered error.\n inline void DropLiteral() {\n next_.literal_chars = NULL;\n }\n\n inline void AddLiteralCharAdvance() {\n AddLiteralChar(c0_);\n Advance();\n }\n\n // Low-level scanning support.\n void Advance() { c0_ = source_->Advance(); }\n void PushBack(uc32 ch) {\n source_->PushBack(c0_);\n c0_ = ch;\n }\n\n inline Token::Value Select(Token::Value tok) {\n Advance();\n return tok;\n }\n\n inline Token::Value Select(uc32 next, Token::Value then, Token::Value else_) {\n Advance();\n if (c0_ == next) {\n Advance();\n return then;\n } else {\n return else_;\n }\n }\n\n uc32 ScanHexNumber(int expected_length);\n\n // Scans a single JavaScript token.\n void Scan();\n\n bool SkipWhiteSpace();\n Token::Value SkipSingleLineComment();\n Token::Value SkipMultiLineComment();\n // Scans a possible HTML comment -- begins with 'pos() - kCharacterLookaheadBufferSize;\n }\n\n UnicodeCache* unicode_cache_;\n\n // Buffers collecting literal strings, numbers, etc.\n LiteralBuffer literal_buffer1_;\n LiteralBuffer literal_buffer2_;\n\n TokenDesc current_; // desc for current token (as returned by Next())\n TokenDesc next_; // desc for next token (one token look-ahead)\n\n // Input stream. Must be initialized to an Utf16CharacterStream.\n Utf16CharacterStream* source_;\n\n\n // Start position of the octal literal last scanned.\n Location octal_pos_;\n\n // One Unicode character look-ahead; c0_ < 0 at the end of the input.\n uc32 c0_;\n\n // Whether there is a line terminator whitespace character after\n // the current token, and before the next. Does not count newlines\n // inside multiline comments.\n bool has_line_terminator_before_next_;\n // Whether there is a multi-line comment that contains a\n // line-terminator after the current token, and before the next.\n bool has_multiline_comment_before_next_;\n // Whether we scan 'let' as a keyword for harmony block-scoped let bindings.\n bool harmony_scoping_;\n // Whether we scan 'module', 'import', 'export' as keywords.\n bool harmony_modules_;\n};\n\n} } // namespace v8::internal\n\n#endif // V8_SCANNER_H_\n" }, { "path": "src/test/resources/samples/langs/C++/simple.re", "content": "#define\tNULL\t\t((char*) 0)\nchar *scan(char *p){\nchar *q;\n#define\tYYCTYPE\t\tchar\n#define\tYYCURSOR\tp\n#define\tYYLIMIT\t\tp\n#define\tYYMARKER\tq\n#define\tYYFILL(n)\n/*!re2c\n\t[0-9]+\t\t{return YYCURSOR;}\n\t[\\000-\\377]\t{return NULL;}\n*/\n}\n" }, { "path": "src/test/resources/samples/langs/C++/srs_app_ingest.cpp", "content": "/*\nThe MIT License (MIT)\n\nCopyright (c) 2013-2015 SRS(ossrs)\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\n// Source - https://github.com/REN-I/srs/blob/3aae7854702a37955bce706fcd8122b02ac07f53/trunk/src/app/srs_app_ingest.cpp\n\n#include \n\n#ifdef SRS_AUTO_INGEST\n\n#include \nusing namespace std;\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n// when error, ingester sleep for a while and retry.\n// ingest never sleep a long time, for we must start the stream ASAP.\n#define SRS_AUTO_INGESTER_SLEEP_US (int64_t)(3*1000*1000LL)\n\nSrsIngesterFFMPEG::SrsIngesterFFMPEG()\n{\n ffmpeg = NULL;\n}\n\nSrsIngesterFFMPEG::~SrsIngesterFFMPEG()\n{\n srs_freep(ffmpeg);\n}\n\nint SrsIngesterFFMPEG::initialize(SrsFFMPEG* ff, string v, string i)\n{\n int ret = ERROR_SUCCESS;\n \n ffmpeg = ff;\n vhost = v;\n id = i;\n starttime = srs_get_system_time_ms();\n \n return ret;\n}\n\nstring SrsIngesterFFMPEG::uri()\n{\n return vhost + \"/\" + id;\n}\n\nint SrsIngesterFFMPEG::alive()\n{\n return (int)(srs_get_system_time_ms() - starttime);\n}\n\nbool SrsIngesterFFMPEG::equals(string v)\n{\n return vhost == v;\n}\n\nbool SrsIngesterFFMPEG::equals(string v, string i)\n{\n return vhost == v && id == i;\n}\n\nint SrsIngesterFFMPEG::start()\n{\n return ffmpeg->start();\n}\n\nvoid SrsIngesterFFMPEG::stop()\n{\n ffmpeg->stop();\n}\n\nint SrsIngesterFFMPEG::cycle()\n{\n return ffmpeg->cycle();\n}\n\nvoid SrsIngesterFFMPEG::fast_stop()\n{\n ffmpeg->fast_stop();\n}\n\nSrsIngester::SrsIngester()\n{\n _srs_config->subscribe(this);\n \n pthread = new SrsReusableThread(\"ingest\", this, SRS_AUTO_INGESTER_SLEEP_US);\n pprint = SrsPithyPrint::create_ingester();\n}\n\nSrsIngester::~SrsIngester()\n{\n _srs_config->unsubscribe(this);\n \n srs_freep(pthread);\n clear_engines();\n}\n\nint SrsIngester::start()\n{\n int ret = ERROR_SUCCESS;\n \n if ((ret = parse()) != ERROR_SUCCESS) {\n clear_engines();\n ret = ERROR_SUCCESS;\n return ret;\n }\n \n // even no ingesters, we must also start it,\n // for the reload may add more ingesters.\n \n // start thread to run all encoding engines.\n if ((ret = pthread->start()) != ERROR_SUCCESS) {\n srs_error(\"st_thread_create failed. ret=%d\", ret);\n return ret;\n }\n srs_trace(\"ingest thread cid=%d, current_cid=%d\", pthread->cid(), _srs_context->get_id());\n \n return ret;\n}\n\nint SrsIngester::parse_ingesters(SrsConfDirective* vhost)\n{\n int ret = ERROR_SUCCESS;\n \n std::vector ingesters = _srs_config->get_ingesters(vhost->arg0());\n \n // create engine\n for (int i = 0; i < (int)ingesters.size(); i++) {\n SrsConfDirective* ingest = ingesters[i];\n if ((ret = parse_engines(vhost, ingest)) != ERROR_SUCCESS) {\n return ret;\n }\n }\n \n return ret;\n}\n\nint SrsIngester::parse_engines(SrsConfDirective* vhost, SrsConfDirective* ingest)\n{\n int ret = ERROR_SUCCESS;\n\n if (!_srs_config->get_ingest_enabled(ingest)) {\n return ret;\n }\n \n std::string ffmpeg_bin = _srs_config->get_ingest_ffmpeg(ingest);\n if (ffmpeg_bin.empty()) {\n ret = ERROR_ENCODER_PARSE;\n srs_trace(\"empty ffmpeg ret=%d\", ret);\n return ret;\n }\n \n // get all engines.\n std::vector engines = _srs_config->get_transcode_engines(ingest);\n \n // create ingesters without engines.\n if (engines.empty()) {\n SrsFFMPEG* ffmpeg = new SrsFFMPEG(ffmpeg_bin);\n if ((ret = initialize_ffmpeg(ffmpeg, vhost, ingest, NULL)) != ERROR_SUCCESS) {\n srs_freep(ffmpeg);\n if (ret != ERROR_ENCODER_LOOP) {\n srs_error(\"invalid ingest engine. ret=%d\", ret);\n }\n return ret;\n }\n\n SrsIngesterFFMPEG* ingester = new SrsIngesterFFMPEG();\n if ((ret = ingester->initialize(ffmpeg, vhost->arg0(), ingest->arg0())) != ERROR_SUCCESS) {\n srs_freep(ingester);\n return ret;\n }\n \n ingesters.push_back(ingester);\n return ret;\n }\n\n // create ingesters with engine\n for (int i = 0; i < (int)engines.size(); i++) {\n SrsConfDirective* engine = engines[i];\n SrsFFMPEG* ffmpeg = new SrsFFMPEG(ffmpeg_bin);\n if ((ret = initialize_ffmpeg(ffmpeg, vhost, ingest, engine)) != ERROR_SUCCESS) {\n srs_freep(ffmpeg);\n if (ret != ERROR_ENCODER_LOOP) {\n srs_error(\"invalid ingest engine: %s %s, ret=%d\", \n ingest->arg0().c_str(), engine->arg0().c_str(), ret);\n }\n return ret;\n }\n \n SrsIngesterFFMPEG* ingester = new SrsIngesterFFMPEG();\n if ((ret = ingester->initialize(ffmpeg, vhost->arg0(), ingest->arg0())) != ERROR_SUCCESS) {\n srs_freep(ingester);\n return ret;\n }\n\n ingesters.push_back(ingester);\n }\n \n return ret;\n}\n\nvoid SrsIngester::dispose()\n{\n // first, use fast stop to notice all FFMPEG to quit gracefully.\n std::vector::iterator it;\n for (it = ingesters.begin(); it != ingesters.end(); ++it) {\n SrsIngesterFFMPEG* ingester = *it;\n ingester->fast_stop();\n }\n \n if (!ingesters.empty()) {\n srs_trace(\"fast stop all ingesters ok.\");\n }\n \n // then, use stop to wait FFMPEG quit one by one and send SIGKILL if needed.\n stop();\n}\n\nvoid SrsIngester::stop()\n{\n pthread->stop();\n clear_engines();\n}\n\nint SrsIngester::cycle()\n{\n int ret = ERROR_SUCCESS;\n \n std::vector::iterator it;\n for (it = ingesters.begin(); it != ingesters.end(); ++it) {\n SrsIngesterFFMPEG* ingester = *it;\n \n // start all ffmpegs.\n if ((ret = ingester->start()) != ERROR_SUCCESS) {\n srs_error(\"ingest ffmpeg start failed. ret=%d\", ret);\n return ret;\n }\n\n // check ffmpeg status.\n if ((ret = ingester->cycle()) != ERROR_SUCCESS) {\n srs_error(\"ingest ffmpeg cycle failed. ret=%d\", ret);\n return ret;\n }\n }\n\n // pithy print\n show_ingest_log_message();\n \n return ret;\n}\n\nvoid SrsIngester::on_thread_stop()\n{\n}\n\nvoid SrsIngester::clear_engines()\n{\n std::vector::iterator it;\n \n for (it = ingesters.begin(); it != ingesters.end(); ++it) {\n SrsIngesterFFMPEG* ingester = *it;\n srs_freep(ingester);\n }\n\n ingesters.clear();\n}\n\nint SrsIngester::parse()\n{\n int ret = ERROR_SUCCESS;\n \n // parse ingesters\n std::vector vhosts;\n _srs_config->get_vhosts(vhosts);\n \n for (int i = 0; i < (int)vhosts.size(); i++) {\n SrsConfDirective* vhost = vhosts[i];\n if ((ret = parse_ingesters(vhost)) != ERROR_SUCCESS) {\n return ret;\n }\n }\n \n return ret;\n}\n\nint SrsIngester::initialize_ffmpeg(SrsFFMPEG* ffmpeg, SrsConfDirective* vhost, SrsConfDirective* ingest, SrsConfDirective* engine)\n{\n int ret = ERROR_SUCCESS;\n \n std::string port;\n if (true) {\n std::vector ip_ports = _srs_config->get_listens();\n srs_assert(ip_ports.size() > 0);\n \n std::string ep = ip_ports[0];\n std::string ip;\n srs_parse_endpoint(ep, ip, port);\n }\n \n std::string output = _srs_config->get_engine_output(engine);\n // output stream, to other/self server\n // ie. rtmp://localhost:1935/live/livestream_sd\n output = srs_string_replace(output, \"[vhost]\", vhost->arg0());\n output = srs_string_replace(output, \"[port]\", port);\n if (output.empty()) {\n ret = ERROR_ENCODER_NO_OUTPUT;\n srs_trace(\"empty output url, ingest=%s. ret=%d\", ingest->arg0().c_str(), ret);\n return ret;\n }\n \n // find the app and stream in rtmp url\n std::string url = output;\n std::string app, stream;\n size_t pos = std::string::npos;\n if ((pos = url.rfind(\"/\")) != std::string::npos) {\n stream = url.substr(pos + 1);\n url = url.substr(0, pos);\n }\n if ((pos = url.rfind(\"/\")) != std::string::npos) {\n app = url.substr(pos + 1);\n url = url.substr(0, pos);\n }\n if ((pos = app.rfind(\"?\")) != std::string::npos) {\n app = app.substr(0, pos);\n }\n \n std::string log_file = SRS_CONSTS_NULL_FILE; // disabled\n // write ffmpeg info to log file.\n if (_srs_config->get_ffmpeg_log_enabled()) {\n log_file = _srs_config->get_ffmpeg_log_dir();\n log_file += \"/\";\n log_file += \"ffmpeg-ingest\";\n log_file += \"-\";\n log_file += vhost->arg0();\n log_file += \"-\";\n log_file += app;\n log_file += \"-\";\n log_file += stream;\n log_file += \".log\";\n }\n \n // input\n std::string input_type = _srs_config->get_ingest_input_type(ingest);\n if (input_type.empty()) {\n ret = ERROR_ENCODER_NO_INPUT;\n srs_trace(\"empty intput type, ingest=%s. ret=%d\", ingest->arg0().c_str(), ret);\n return ret;\n }\n\n if (srs_config_ingest_is_file(input_type)) {\n std::string input_url = _srs_config->get_ingest_input_url(ingest);\n if (input_url.empty()) {\n ret = ERROR_ENCODER_NO_INPUT;\n srs_trace(\"empty intput url, ingest=%s. ret=%d\", ingest->arg0().c_str(), ret);\n return ret;\n }\n \n // for file, set re.\n ffmpeg->set_iparams(\"-re\");\n \n if ((ret = ffmpeg->initialize(input_url, output, log_file)) != ERROR_SUCCESS) {\n return ret;\n }\n } else if (srs_config_ingest_is_stream(input_type)) {\n std::string input_url = _srs_config->get_ingest_input_url(ingest);\n if (input_url.empty()) {\n ret = ERROR_ENCODER_NO_INPUT;\n srs_trace(\"empty intput url, ingest=%s. ret=%d\", ingest->arg0().c_str(), ret);\n return ret;\n }\n \n // for stream, no re.\n ffmpeg->set_iparams(\"\");\n \n if ((ret = ffmpeg->initialize(input_url, output, log_file)) != ERROR_SUCCESS) {\n return ret;\n }\n } else {\n ret = ERROR_ENCODER_INPUT_TYPE;\n srs_error(\"invalid ingest=%s type=%s, ret=%d\", \n ingest->arg0().c_str(), input_type.c_str(), ret);\n }\n \n // set output format to flv for RTMP\n ffmpeg->set_oformat(\"flv\");\n \n std::string vcodec = _srs_config->get_engine_vcodec(engine);\n std::string acodec = _srs_config->get_engine_acodec(engine);\n // whatever the engine config, use copy as default.\n bool engine_disabled = !engine || !_srs_config->get_engine_enabled(engine);\n if (engine_disabled || vcodec.empty() || acodec.empty()) {\n if ((ret = ffmpeg->initialize_copy()) != ERROR_SUCCESS) {\n return ret;\n }\n } else {\n if ((ret = ffmpeg->initialize_transcode(engine)) != ERROR_SUCCESS) {\n return ret;\n }\n }\n \n srs_trace(\"parse success, ingest=%s, vhost=%s\", \n ingest->arg0().c_str(), vhost->arg0().c_str());\n \n return ret;\n}\n\nvoid SrsIngester::show_ingest_log_message()\n{\n pprint->elapse();\n\n if ((int)ingesters.size() <= 0) {\n return;\n }\n \n // random choose one ingester to report.\n int index = rand() % (int)ingesters.size();\n SrsIngesterFFMPEG* ingester = ingesters.at(index);\n \n // reportable\n if (pprint->can_print()) {\n srs_trace(\"-> \"SRS_CONSTS_LOG_INGESTER\" time=%\"PRId64\", ingesters=%d, #%d(alive=%ds, %s)\",\n pprint->age(), (int)ingesters.size(), index, ingester->alive() / 1000, ingester->uri().c_str());\n }\n}\n\nint SrsIngester::on_reload_vhost_added(string vhost)\n{\n int ret = ERROR_SUCCESS;\n \n SrsConfDirective* _vhost = _srs_config->get_vhost(vhost);\n if ((ret = parse_ingesters(_vhost)) != ERROR_SUCCESS) {\n return ret;\n }\n \n srs_trace(\"reload add vhost ingesters, vhost=%s\", vhost.c_str());\n\n return ret;\n}\n\nint SrsIngester::on_reload_vhost_removed(string vhost)\n{\n int ret = ERROR_SUCCESS;\n \n std::vector::iterator it;\n \n for (it = ingesters.begin(); it != ingesters.end();) {\n SrsIngesterFFMPEG* ingester = *it;\n \n if (!ingester->equals(vhost)) {\n ++it;\n continue;\n }\n \n // stop the ffmpeg and free it.\n ingester->stop();\n \n srs_trace(\"reload stop ingester, vhost=%s, id=%s\", vhost.c_str(), ingester->uri().c_str());\n \n srs_freep(ingester);\n \n // remove the item from ingesters.\n it = ingesters.erase(it);\n }\n\n return ret;\n}\n\nint SrsIngester::on_reload_ingest_removed(string vhost, string ingest_id)\n{\n int ret = ERROR_SUCCESS;\n \n std::vector::iterator it;\n \n for (it = ingesters.begin(); it != ingesters.end();) {\n SrsIngesterFFMPEG* ingester = *it;\n \n if (!ingester->equals(vhost, ingest_id)) {\n ++it;\n continue;\n }\n \n // stop the ffmpeg and free it.\n ingester->stop();\n \n srs_trace(\"reload stop ingester, vhost=%s, id=%s\", vhost.c_str(), ingester->uri().c_str());\n \n srs_freep(ingester);\n \n // remove the item from ingesters.\n it = ingesters.erase(it);\n }\n \n return ret;\n}\n\nint SrsIngester::on_reload_ingest_added(string vhost, string ingest_id)\n{\n int ret = ERROR_SUCCESS;\n \n SrsConfDirective* _vhost = _srs_config->get_vhost(vhost);\n SrsConfDirective* _ingester = _srs_config->get_ingest_by_id(vhost, ingest_id);\n \n if ((ret = parse_engines(_vhost, _ingester)) != ERROR_SUCCESS) {\n return ret;\n }\n \n srs_trace(\"reload add ingester, \"\n \"vhost=%s, id=%s\", vhost.c_str(), ingest_id.c_str());\n \n return ret;\n}\n\nint SrsIngester::on_reload_ingest_updated(string vhost, string ingest_id)\n{\n int ret = ERROR_SUCCESS;\n\n if ((ret = on_reload_ingest_removed(vhost, ingest_id)) != ERROR_SUCCESS) {\n return ret;\n }\n\n if ((ret = on_reload_ingest_added(vhost, ingest_id)) != ERROR_SUCCESS) {\n return ret;\n }\n \n srs_trace(\"reload updated ingester, \"\n \"vhost=%s, id=%s\", vhost.c_str(), ingest_id.c_str());\n \n return ret;\n}\n\n#endif\n\n" }, { "path": "src/test/resources/samples/langs/C++/utils.h", "content": "/*\n This file is part of the PhantomJS project from Ofi Labs.\n\n Copyright (C) 2011 Ariya Hidayat \n Copyright (C) 2011 Ivan De Marino \n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * 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 * Neither the name of the nor the\n names of its contributors may be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n ARE DISCLAIMED. IN NO EVENT SHALL BE LIABLE FOR ANY\n DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF\n THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*/\n\n#ifndef UTILS_H\n#define UTILS_H\n\n#include \n#include \n#include \n\n#include \"csconverter.h\"\n#include \"encoding.h\"\n\nclass QTemporaryFile;\n/**\n * Aggregate common utility functions.\n * Functions are static methods.\n * It's important to notice that, at the moment, this class can't be instantiated by design.\n */\nclass Utils\n{\npublic:\n static void showUsage();\n static void messageHandler(QtMsgType type, const char *msg);\n static bool exceptionHandler(const char* dump_path, const char* minidump_id, void* context, bool succeeded);\n static QVariant coffee2js(const QString &script);\n static bool injectJsInFrame(const QString &jsFilePath, const QString &libraryPath, QWebFrame *targetFrame, const bool startingScript = false);\n static bool injectJsInFrame(const QString &jsFilePath, const Encoding &jsFileEnc, const QString &libraryPath, QWebFrame *targetFrame, const bool startingScript = false);\n static QString readResourceFileUtf8(const QString &resourceFilePath);\n\n static bool loadJSForDebug(const QString &jsFilePath, const Encoding &jsFileEnc, const QString &libraryPath, QWebFrame *targetFrame, const bool autorun = false);\n static bool loadJSForDebug(const QString &jsFilePath, const QString &libraryPath, QWebFrame *targetFrame, const bool autorun = false);\n static void cleanupFromDebug();\n\nprivate:\n static QString findScript(const QString &jsFilePath, const QString& libraryPath);\n static QString jsFromScriptFile(const QString& scriptPath, const Encoding& enc);\n Utils(); //< This class shouldn't be instantiated\n\n static QTemporaryFile* m_tempHarness; //< We want to make sure to clean up after ourselves\n static QTemporaryFile* m_tempWrapper;\n};\n\n#endif // UTILS_H\n" }, { "path": "src/test/resources/samples/langs/C++/v8.cc", "content": "// Copyright 2012 the V8 project authors. All rights reserved.\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// * 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// * Neither the name of Google Inc. nor the names of its\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#include \"v8.h\"\n\n#include \"assembler.h\"\n#include \"isolate.h\"\n#include \"elements.h\"\n#include \"bootstrapper.h\"\n#include \"debug.h\"\n#include \"deoptimizer.h\"\n#include \"frames.h\"\n#include \"heap-profiler.h\"\n#include \"hydrogen.h\"\n#include \"lithium-allocator.h\"\n#include \"log.h\"\n#include \"once.h\"\n#include \"platform.h\"\n#include \"runtime-profiler.h\"\n#include \"serialize.h\"\n#include \"store-buffer.h\"\n\nnamespace v8 {\nnamespace internal {\n\nV8_DECLARE_ONCE(init_once);\n\nbool V8::is_running_ = false;\nbool V8::has_been_set_up_ = false;\nbool V8::has_been_disposed_ = false;\nbool V8::has_fatal_error_ = false;\nbool V8::use_crankshaft_ = true;\nList* V8::call_completed_callbacks_ = NULL;\n\nstatic LazyMutex entropy_mutex = LAZY_MUTEX_INITIALIZER;\n\nstatic EntropySource entropy_source;\n\n\nbool V8::Initialize(Deserializer* des) {\n FlagList::EnforceFlagImplications();\n\n InitializeOncePerProcess();\n\n // The current thread may not yet had entered an isolate to run.\n // Note the Isolate::Current() may be non-null because for various\n // initialization purposes an initializing thread may be assigned an isolate\n // but not actually enter it.\n if (i::Isolate::CurrentPerIsolateThreadData() == NULL) {\n i::Isolate::EnterDefaultIsolate();\n }\n\n ASSERT(i::Isolate::CurrentPerIsolateThreadData() != NULL);\n ASSERT(i::Isolate::CurrentPerIsolateThreadData()->thread_id().Equals(\n i::ThreadId::Current()));\n ASSERT(i::Isolate::CurrentPerIsolateThreadData()->isolate() ==\n i::Isolate::Current());\n\n if (IsDead()) return false;\n\n Isolate* isolate = Isolate::Current();\n if (isolate->IsInitialized()) return true;\n\n is_running_ = true;\n has_been_set_up_ = true;\n has_fatal_error_ = false;\n has_been_disposed_ = false;\n\n return isolate->Init(des);\n}\n\n\nvoid V8::SetFatalError() {\n is_running_ = false;\n has_fatal_error_ = true;\n}\n\n\nvoid V8::TearDown() {\n Isolate* isolate = Isolate::Current();\n ASSERT(isolate->IsDefaultIsolate());\n\n if (!has_been_set_up_ || has_been_disposed_) return;\n\n ElementsAccessor::TearDown();\n LOperand::TearDownCaches();\n RegisteredExtension::UnregisterAll();\n\n isolate->TearDown();\n delete isolate;\n\n is_running_ = false;\n has_been_disposed_ = true;\n\n delete call_completed_callbacks_;\n call_completed_callbacks_ = NULL;\n\n OS::TearDown();\n}\n\n\nstatic void seed_random(uint32_t* state) {\n for (int i = 0; i < 2; ++i) {\n if (FLAG_random_seed != 0) {\n state[i] = FLAG_random_seed;\n } else if (entropy_source != NULL) {\n uint32_t val;\n ScopedLock lock(entropy_mutex.Pointer());\n entropy_source(reinterpret_cast(&val), sizeof(uint32_t));\n state[i] = val;\n } else {\n state[i] = random();\n }\n }\n}\n\n\n// Random number generator using George Marsaglia's MWC algorithm.\nstatic uint32_t random_base(uint32_t* state) {\n // Initialize seed using the system random().\n // No non-zero seed will ever become zero again.\n if (state[0] == 0) seed_random(state);\n\n // Mix the bits. Never replaces state[i] with 0 if it is nonzero.\n state[0] = 18273 * (state[0] & 0xFFFF) + (state[0] >> 16);\n state[1] = 36969 * (state[1] & 0xFFFF) + (state[1] >> 16);\n\n return (state[0] << 14) + (state[1] & 0x3FFFF);\n}\n\n\nvoid V8::SetEntropySource(EntropySource source) {\n entropy_source = source;\n}\n\n\nvoid V8::SetReturnAddressLocationResolver(\n ReturnAddressLocationResolver resolver) {\n StackFrame::SetReturnAddressLocationResolver(resolver);\n}\n\n\n// Used by JavaScript APIs\nuint32_t V8::Random(Context* context) {\n ASSERT(context->IsGlobalContext());\n ByteArray* seed = context->random_seed();\n return random_base(reinterpret_cast(seed->GetDataStartAddress()));\n}\n\n\n// Used internally by the JIT and memory allocator for security\n// purposes. So, we keep a different state to prevent informations\n// leaks that could be used in an exploit.\nuint32_t V8::RandomPrivate(Isolate* isolate) {\n ASSERT(isolate == Isolate::Current());\n return random_base(isolate->private_random_seed());\n}\n\n\nbool V8::IdleNotification(int hint) {\n // Returning true tells the caller that there is no need to call\n // IdleNotification again.\n if (!FLAG_use_idle_notification) return true;\n\n // Tell the heap that it may want to adjust.\n return HEAP->IdleNotification(hint);\n}\n\n\nvoid V8::AddCallCompletedCallback(CallCompletedCallback callback) {\n if (call_completed_callbacks_ == NULL) { // Lazy init.\n call_completed_callbacks_ = new List();\n }\n for (int i = 0; i < call_completed_callbacks_->length(); i++) {\n if (callback == call_completed_callbacks_->at(i)) return;\n }\n call_completed_callbacks_->Add(callback);\n}\n\n\nvoid V8::RemoveCallCompletedCallback(CallCompletedCallback callback) {\n if (call_completed_callbacks_ == NULL) return;\n for (int i = 0; i < call_completed_callbacks_->length(); i++) {\n if (callback == call_completed_callbacks_->at(i)) {\n call_completed_callbacks_->Remove(i);\n }\n }\n}\n\n\nvoid V8::FireCallCompletedCallback(Isolate* isolate) {\n if (call_completed_callbacks_ == NULL) return;\n HandleScopeImplementer* handle_scope_implementer =\n isolate->handle_scope_implementer();\n if (!handle_scope_implementer->CallDepthIsZero()) return;\n // Fire callbacks. Increase call depth to prevent recursive callbacks.\n handle_scope_implementer->IncrementCallDepth();\n for (int i = 0; i < call_completed_callbacks_->length(); i++) {\n call_completed_callbacks_->at(i)();\n }\n handle_scope_implementer->DecrementCallDepth();\n}\n\n\n// Use a union type to avoid type-aliasing optimizations in GCC.\ntypedef union {\n double double_value;\n uint64_t uint64_t_value;\n} double_int_union;\n\n\nObject* V8::FillHeapNumberWithRandom(Object* heap_number,\n Context* context) {\n double_int_union r;\n uint64_t random_bits = Random(context);\n // Convert 32 random bits to 0.(32 random bits) in a double\n // by computing:\n // ( 1.(20 0s)(32 random bits) x 2^20 ) - (1.0 x 2^20)).\n static const double binary_million = 1048576.0;\n r.double_value = binary_million;\n r.uint64_t_value |= random_bits;\n r.double_value -= binary_million;\n\n HeapNumber::cast(heap_number)->set_value(r.double_value);\n return heap_number;\n}\n\nvoid V8::InitializeOncePerProcessImpl() {\n OS::SetUp();\n\n use_crankshaft_ = FLAG_crankshaft;\n\n if (Serializer::enabled()) {\n use_crankshaft_ = false;\n }\n\n CPU::SetUp();\n if (!CPU::SupportsCrankshaft()) {\n use_crankshaft_ = false;\n }\n\n OS::PostSetUp();\n\n RuntimeProfiler::GlobalSetUp();\n\n ElementsAccessor::InitializeOncePerProcess();\n\n if (FLAG_stress_compaction) {\n FLAG_force_marking_deque_overflows = true;\n FLAG_gc_global = true;\n FLAG_max_new_space_size = (1 << (kPageSizeBits - 10)) * 2;\n }\n\n LOperand::SetUpCaches();\n SetUpJSCallerSavedCodeData();\n SamplerRegistry::SetUp();\n ExternalReference::SetUp();\n}\n\nvoid V8::InitializeOncePerProcess() {\n CallOnce(&init_once, &InitializeOncePerProcessImpl);\n}\n\n} } // namespace v8::internal\n" }, { "path": "src/test/resources/samples/langs/C++/v8.h", "content": "// Copyright 2011 the V8 project authors. All rights reserved.\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// * 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// * Neither the name of Google Inc. nor the names of its\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// Top include for all V8 .cc files.\n//\n\n#ifndef V8_V8_H_\n#define V8_V8_H_\n\n#if defined(GOOGLE3)\n// Google3 special flag handling.\n#if defined(DEBUG) && defined(NDEBUG)\n// V8 only uses DEBUG and whenever it is set we are building a debug\n// version of V8. We do not use NDEBUG and simply undef it here for\n// consistency.\n#undef NDEBUG\n#endif\n#endif // defined(GOOGLE3)\n\n// V8 only uses DEBUG, but included external files\n// may use NDEBUG - make sure they are consistent.\n#if defined(DEBUG) && defined(NDEBUG)\n#error both DEBUG and NDEBUG are set\n#endif\n\n// Basic includes\n#include \"../include/v8.h\"\n#include \"v8globals.h\"\n#include \"v8checks.h\"\n#include \"allocation.h\"\n#include \"v8utils.h\"\n#include \"flags.h\"\n\n// Objects & heap\n#include \"objects-inl.h\"\n#include \"spaces-inl.h\"\n#include \"heap-inl.h\"\n#include \"incremental-marking-inl.h\"\n#include \"mark-compact-inl.h\"\n#include \"log-inl.h\"\n#include \"cpu-profiler-inl.h\"\n#include \"handles-inl.h\"\n#include \"zone-inl.h\"\n\nnamespace v8 {\nnamespace internal {\n\nclass Deserializer;\n\nclass V8 : public AllStatic {\n public:\n // Global actions.\n\n // If Initialize is called with des == NULL, the initial state is\n // created from scratch. If a non-null Deserializer is given, the\n // initial state is created by reading the deserialized data into an\n // empty heap.\n static bool Initialize(Deserializer* des);\n static void TearDown();\n static bool IsRunning() { return is_running_; }\n static bool UseCrankshaft() { return use_crankshaft_; }\n // To be dead you have to have lived\n // TODO(isolates): move IsDead to Isolate.\n static bool IsDead() { return has_fatal_error_ || has_been_disposed_; }\n static void SetFatalError();\n\n // Report process out of memory. Implementation found in api.cc.\n static void FatalProcessOutOfMemory(const char* location,\n bool take_snapshot = false);\n\n // Allows an entropy source to be provided for use in random number\n // generation.\n static void SetEntropySource(EntropySource source);\n // Support for return-address rewriting profilers.\n static void SetReturnAddressLocationResolver(\n ReturnAddressLocationResolver resolver);\n // Random number generation support. Not cryptographically safe.\n static uint32_t Random(Context* context);\n // We use random numbers internally in memory allocation and in the\n // compilers for security. In order to prevent information leaks we\n // use a separate random state for internal random number\n // generation.\n static uint32_t RandomPrivate(Isolate* isolate);\n static Object* FillHeapNumberWithRandom(Object* heap_number,\n Context* context);\n\n // Idle notification directly from the API.\n static bool IdleNotification(int hint);\n\n static void AddCallCompletedCallback(CallCompletedCallback callback);\n static void RemoveCallCompletedCallback(CallCompletedCallback callback);\n static void FireCallCompletedCallback(Isolate* isolate);\n\n private:\n static void InitializeOncePerProcessImpl();\n static void InitializeOncePerProcess();\n\n // True if engine is currently running\n static bool is_running_;\n // True if V8 has ever been run\n static bool has_been_set_up_;\n // True if error has been signaled for current engine\n // (reset to false if engine is restarted)\n static bool has_fatal_error_;\n // True if engine has been shut down\n // (reset if engine is restarted)\n static bool has_been_disposed_;\n // True if we are using the crankshaft optimizing compiler.\n static bool use_crankshaft_;\n // List of callbacks when a Call completes.\n static List* call_completed_callbacks_;\n};\n\n\n// JavaScript defines two kinds of 'nil'.\nenum NilValue { kNullValue, kUndefinedValue };\n\n\n// JavaScript defines two kinds of equality.\nenum EqualityKind { kStrictEquality, kNonStrictEquality };\n\n\n} } // namespace v8::internal\n\nnamespace i = v8::internal;\n\n#endif // V8_V8_H_\n" }, { "path": "src/test/resources/samples/langs/C++/wrapper_inner.cpp", "content": "/* Generated by Cython 0.14.1 on Mon Jun 27 13:03:43 2011 */\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#else\n\n#include /* For offsetof */\n#ifndef offsetof\n#define offsetof(type, member) ( (size_t) & ((type*)0) -> member )\n#endif\n\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\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\n#ifndef PY_LONG_LONG\n #define PY_LONG_LONG LONG_LONG\n#endif\n\n#if PY_VERSION_HEX < 0x02040000\n #define METH_COEXIST 0\n #define PyDict_CheckExact(op) (Py_TYPE(op) == &PyDict_Type)\n #define PyDict_Contains(d,o) PySequence_Contains(d,o)\n#endif\n\n#if PY_VERSION_HEX < 0x02050000\n typedef int Py_ssize_t;\n #define PY_SSIZE_T_MAX INT_MAX\n #define PY_SSIZE_T_MIN INT_MIN\n #define PY_FORMAT_SIZE_T \"\"\n #define PyInt_FromSsize_t(z) PyInt_FromLong(z)\n #define PyInt_AsSsize_t(o) PyInt_AsLong(o)\n #define PyNumber_Index(o) PyNumber_Int(o)\n #define PyIndex_Check(o) PyNumber_Check(o)\n #define PyErr_WarnEx(category, message, stacklevel) PyErr_Warn(category, message)\n#endif\n\n#if PY_VERSION_HEX < 0x02060000\n #define Py_REFCNT(ob) (((PyObject*)(ob))->ob_refcnt)\n #define Py_TYPE(ob) (((PyObject*)(ob))->ob_type)\n #define Py_SIZE(ob) (((PyVarObject*)(ob))->ob_size)\n #define PyVarObject_HEAD_INIT(type, size) \\\n PyObject_HEAD_INIT(type) size,\n #define PyType_Modified(t)\n\n typedef struct {\n void *buf;\n PyObject *obj;\n Py_ssize_t len;\n Py_ssize_t itemsize;\n int readonly;\n int ndim;\n char *format;\n Py_ssize_t *shape;\n Py_ssize_t *strides;\n Py_ssize_t *suboffsets;\n void *internal;\n } Py_buffer;\n\n #define PyBUF_SIMPLE 0\n #define PyBUF_WRITABLE 0x0001\n #define PyBUF_FORMAT 0x0004\n #define PyBUF_ND 0x0008\n #define PyBUF_STRIDES (0x0010 | PyBUF_ND)\n #define PyBUF_C_CONTIGUOUS (0x0020 | PyBUF_STRIDES)\n #define PyBUF_F_CONTIGUOUS (0x0040 | PyBUF_STRIDES)\n #define PyBUF_ANY_CONTIGUOUS (0x0080 | PyBUF_STRIDES)\n #define PyBUF_INDIRECT (0x0100 | PyBUF_STRIDES)\n\n#endif\n\n#if PY_MAJOR_VERSION < 3\n #define __Pyx_BUILTIN_MODULE_NAME \"__builtin__\"\n#else\n #define __Pyx_BUILTIN_MODULE_NAME \"builtins\"\n#endif\n\n#if PY_MAJOR_VERSION >= 3\n #define Py_TPFLAGS_CHECKTYPES 0\n #define Py_TPFLAGS_HAVE_INDEX 0\n#endif\n\n#if (PY_VERSION_HEX < 0x02060000) || (PY_MAJOR_VERSION >= 3)\n #define Py_TPFLAGS_HAVE_NEWBUFFER 0\n#endif\n\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\n#if PY_VERSION_HEX < 0x02060000\n #define PyBytesObject PyStringObject\n #define PyBytes_Type PyString_Type\n #define PyBytes_Check PyString_Check\n #define PyBytes_CheckExact PyString_CheckExact\n #define PyBytes_FromString PyString_FromString\n #define PyBytes_FromStringAndSize PyString_FromStringAndSize\n #define PyBytes_FromFormat PyString_FromFormat\n #define PyBytes_DecodeEscape PyString_DecodeEscape\n #define PyBytes_AsString PyString_AsString\n #define PyBytes_AsStringAndSize PyString_AsStringAndSize\n #define PyBytes_Size PyString_Size\n #define PyBytes_AS_STRING PyString_AS_STRING\n #define PyBytes_GET_SIZE PyString_GET_SIZE\n #define PyBytes_Repr PyString_Repr\n #define PyBytes_Concat PyString_Concat\n #define PyBytes_ConcatAndDel PyString_ConcatAndDel\n#endif\n\n#if PY_VERSION_HEX < 0x02060000\n #define PySet_Check(obj) PyObject_TypeCheck(obj, &PySet_Type)\n #define PyFrozenSet_Check(obj) PyObject_TypeCheck(obj, &PyFrozenSet_Type)\n#endif\n#ifndef PySet_CheckExact\n #define PySet_CheckExact(obj) (Py_TYPE(obj) == &PySet_Type)\n#endif\n\n#define __Pyx_TypeCheck(obj, type) PyObject_TypeCheck(obj, (PyTypeObject *)type)\n\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#endif\n\n#if PY_MAJOR_VERSION >= 3\n #define PyBoolObject PyLongObject\n#endif\n\n\n#if PY_MAJOR_VERSION >= 3\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\n#if (PY_MAJOR_VERSION < 3) || (PY_VERSION_HEX >= 0x03010300)\n #define __Pyx_PySequence_GetSlice(obj, a, b) PySequence_GetSlice(obj, a, b)\n #define __Pyx_PySequence_SetSlice(obj, a, b, value) PySequence_SetSlice(obj, a, b, value)\n #define __Pyx_PySequence_DelSlice(obj, a, b) PySequence_DelSlice(obj, a, b)\n#else\n #define __Pyx_PySequence_GetSlice(obj, a, b) (unlikely(!(obj)) ? \\\n (PyErr_SetString(PyExc_SystemError, \"null argument to internal routine\"), (PyObject*)0) : \\\n (likely((obj)->ob_type->tp_as_mapping) ? (PySequence_GetSlice(obj, a, b)) : \\\n (PyErr_Format(PyExc_TypeError, \"'%.200s' object is unsliceable\", (obj)->ob_type->tp_name), (PyObject*)0)))\n #define __Pyx_PySequence_SetSlice(obj, a, b, value) (unlikely(!(obj)) ? \\\n (PyErr_SetString(PyExc_SystemError, \"null argument to internal routine\"), -1) : \\\n (likely((obj)->ob_type->tp_as_mapping) ? (PySequence_SetSlice(obj, a, b, value)) : \\\n (PyErr_Format(PyExc_TypeError, \"'%.200s' object doesn't support slice assignment\", (obj)->ob_type->tp_name), -1)))\n #define __Pyx_PySequence_DelSlice(obj, a, b) (unlikely(!(obj)) ? \\\n (PyErr_SetString(PyExc_SystemError, \"null argument to internal routine\"), -1) : \\\n (likely((obj)->ob_type->tp_as_mapping) ? (PySequence_DelSlice(obj, a, b)) : \\\n (PyErr_Format(PyExc_TypeError, \"'%.200s' object doesn't support slice deletion\", (obj)->ob_type->tp_name), -1)))\n#endif\n\n#if PY_MAJOR_VERSION >= 3\n #define PyMethod_New(func, self, klass) ((self) ? PyMethod_New(func, self) : PyInstanceMethod_New(func))\n#endif\n\n#if PY_VERSION_HEX < 0x02050000\n #define __Pyx_GetAttrString(o,n) PyObject_GetAttrString((o),((char *)(n)))\n #define __Pyx_SetAttrString(o,n,a) PyObject_SetAttrString((o),((char *)(n)),(a))\n #define __Pyx_DelAttrString(o,n) PyObject_DelAttrString((o),((char *)(n)))\n#else\n #define __Pyx_GetAttrString(o,n) PyObject_GetAttrString((o),(n))\n #define __Pyx_SetAttrString(o,n,a) PyObject_SetAttrString((o),(n),(a))\n #define __Pyx_DelAttrString(o,n) PyObject_DelAttrString((o),(n))\n#endif\n\n#if PY_VERSION_HEX < 0x02050000\n #define __Pyx_NAMESTR(n) ((char *)(n))\n #define __Pyx_DOCSTR(n) ((char *)(n))\n#else\n #define __Pyx_NAMESTR(n) (n)\n #define __Pyx_DOCSTR(n) (n)\n#endif\n\n#ifdef __cplusplus\n#define __PYX_EXTERN_C extern \"C\"\n#else\n#define __PYX_EXTERN_C extern\n#endif\n\n#if defined(WIN32) || defined(MS_WINDOWS)\n#define _USE_MATH_DEFINES\n#endif\n#include \n#define __PYX_HAVE_API__wrapper_inner\n#include \"stdio.h\"\n#include \"stdlib.h\"\n#include \"numpy/arrayobject.h\"\n#include \"numpy/ufuncobject.h\"\n#include \n\n#ifdef PYREX_WITHOUT_ASSERTIONS\n#define CYTHON_WITHOUT_ASSERTIONS\n#endif\n\n\n/* inline attribute */\n#ifndef CYTHON_INLINE\n #if defined(__GNUC__)\n #define CYTHON_INLINE __inline__\n #elif defined(_MSC_VER)\n #define CYTHON_INLINE __inline\n #elif defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L\n #define CYTHON_INLINE inline\n #else\n #define CYTHON_INLINE\n #endif\n#endif\n\n/* unused attribute */\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)\n# define CYTHON_UNUSED __attribute__ ((__unused__))\n# else\n# define CYTHON_UNUSED\n# endif\n#endif\n\ntypedef struct {PyObject **p; char *s; const long n; const char* encoding; const char is_unicode; const char is_str; const char intern; } __Pyx_StringTabEntry; /*proto*/\n\n\n/* Type Conversion Predeclarations */\n\n#define __Pyx_PyBytes_FromUString(s) PyBytes_FromString((char*)s)\n#define __Pyx_PyBytes_AsUString(s) ((unsigned char*) PyBytes_AsString(s))\n\n#define __Pyx_PyBool_FromLong(b) ((b) ? (Py_INCREF(Py_True), Py_True) : (Py_INCREF(Py_False), Py_False))\nstatic CYTHON_INLINE int __Pyx_PyObject_IsTrue(PyObject*);\nstatic CYTHON_INLINE PyObject* __Pyx_PyNumber_Int(PyObject* x);\n\nstatic CYTHON_INLINE Py_ssize_t __Pyx_PyIndex_AsSsize_t(PyObject*);\nstatic CYTHON_INLINE PyObject * __Pyx_PyInt_FromSize_t(size_t);\nstatic CYTHON_INLINE size_t __Pyx_PyInt_AsSize_t(PyObject*);\n\n#define __pyx_PyFloat_AsDouble(x) (PyFloat_CheckExact(x) ? PyFloat_AS_DOUBLE(x) : PyFloat_AsDouble(x))\n\n\n#ifdef __GNUC__\n/* Test for GCC > 2.95 */\n#if __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__ > 2 ... */\n#define likely(x) (x)\n#define unlikely(x) (x)\n#endif /* __GNUC__ > 2 ... */\n#else /* __GNUC__ */\n#define likely(x) (x)\n#define unlikely(x) (x)\n#endif /* __GNUC__ */\n \nstatic PyObject *__pyx_m;\nstatic PyObject *__pyx_b;\nstatic PyObject *__pyx_empty_tuple;\nstatic PyObject *__pyx_empty_bytes;\nstatic int __pyx_lineno;\nstatic int __pyx_clineno = 0;\nstatic const char * __pyx_cfilenm= __FILE__;\nstatic const char *__pyx_filename;\n\n\n#if !defined(CYTHON_CCOMPLEX)\n #if defined(__cplusplus)\n #define CYTHON_CCOMPLEX 1\n #elif defined(_Complex_I)\n #define CYTHON_CCOMPLEX 1\n #else\n #define CYTHON_CCOMPLEX 0\n #endif\n#endif\n\n#if CYTHON_CCOMPLEX\n #ifdef __cplusplus\n #include \n #else\n #include \n #endif\n#endif\n\n#if CYTHON_CCOMPLEX && !defined(__cplusplus) && defined(__sun__) && defined(__GNUC__)\n #undef _Complex_I\n #define _Complex_I 1.0fj\n#endif\n\nstatic const char *__pyx_f[] = {\n \"wrapper_inner.pyx\",\n \"numpy.pxd\",\n};\n\ntypedef npy_int8 __pyx_t_5numpy_int8_t;\n\ntypedef npy_int16 __pyx_t_5numpy_int16_t;\n\ntypedef npy_int32 __pyx_t_5numpy_int32_t;\n\ntypedef npy_int64 __pyx_t_5numpy_int64_t;\n\ntypedef npy_uint8 __pyx_t_5numpy_uint8_t;\n\ntypedef npy_uint16 __pyx_t_5numpy_uint16_t;\n\ntypedef npy_uint32 __pyx_t_5numpy_uint32_t;\n\ntypedef npy_uint64 __pyx_t_5numpy_uint64_t;\n\ntypedef npy_float32 __pyx_t_5numpy_float32_t;\n\ntypedef npy_float64 __pyx_t_5numpy_float64_t;\n\ntypedef npy_long __pyx_t_5numpy_int_t;\n\ntypedef npy_longlong __pyx_t_5numpy_long_t;\n\ntypedef npy_intp __pyx_t_5numpy_intp_t;\n\ntypedef npy_uintp __pyx_t_5numpy_uintp_t;\n\ntypedef npy_ulong __pyx_t_5numpy_uint_t;\n\ntypedef npy_ulonglong __pyx_t_5numpy_ulong_t;\n\ntypedef npy_double __pyx_t_5numpy_float_t;\n\ntypedef npy_double __pyx_t_5numpy_double_t;\n\ntypedef npy_longdouble __pyx_t_5numpy_longdouble_t;\n\n#if CYTHON_CCOMPLEX\n #ifdef __cplusplus\n typedef ::std::complex< float > __pyx_t_float_complex;\n #else\n typedef float _Complex __pyx_t_float_complex;\n #endif\n#else\n typedef struct { float real, imag; } __pyx_t_float_complex;\n#endif\n\n#if CYTHON_CCOMPLEX\n #ifdef __cplusplus\n typedef ::std::complex< double > __pyx_t_double_complex;\n #else\n typedef double _Complex __pyx_t_double_complex;\n #endif\n#else\n typedef struct { double real, imag; } __pyx_t_double_complex;\n#endif\n\n/* Type declarations */\n\ntypedef npy_cfloat __pyx_t_5numpy_cfloat_t;\n\ntypedef npy_cdouble __pyx_t_5numpy_cdouble_t;\n\ntypedef npy_clongdouble __pyx_t_5numpy_clongdouble_t;\n\ntypedef npy_cdouble __pyx_t_5numpy_complex_t;\n\n#ifndef CYTHON_REFNANNY\n #define CYTHON_REFNANNY 0\n#endif\n\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 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);\n end:\n Py_XDECREF(p);\n Py_XDECREF(m);\n return (__Pyx_RefNannyAPIStruct *)r;\n }\n #define __Pyx_RefNannySetupContext(name) void *__pyx_refnanny = __Pyx_RefNanny->SetupContext((name), __LINE__, __FILE__)\n #define __Pyx_RefNannyFinishContext() __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_XDECREF(r) do { if((r) != NULL) {__Pyx_DECREF(r);} } while(0)\n#else\n #define __Pyx_RefNannySetupContext(name)\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_XDECREF(r) Py_XDECREF(r)\n#endif /* CYTHON_REFNANNY */\n#define __Pyx_XGIVEREF(r) do { if((r) != NULL) {__Pyx_GIVEREF(r);} } while(0)\n#define __Pyx_XGOTREF(r) do { if((r) != NULL) {__Pyx_GOTREF(r);} } while(0)\n\nstatic CYTHON_INLINE int __Pyx_TypeTest(PyObject *obj, PyTypeObject *type); /*proto*/\n\nstatic PyObject *__Pyx_GetName(PyObject *dict, PyObject *name); /*proto*/\n\nstatic CYTHON_INLINE void __Pyx_ErrRestore(PyObject *type, PyObject *value, PyObject *tb); /*proto*/\nstatic CYTHON_INLINE void __Pyx_ErrFetch(PyObject **type, PyObject **value, PyObject **tb); /*proto*/\n\nstatic void __Pyx_Raise(PyObject *type, PyObject *value, PyObject *tb); /*proto*/\n\nstatic CYTHON_INLINE void __Pyx_RaiseNoneNotIterableError(void);\n\nstatic CYTHON_INLINE void __Pyx_RaiseNeedMoreValuesError(Py_ssize_t index);\n\nstatic CYTHON_INLINE void __Pyx_RaiseTooManyValuesError(Py_ssize_t expected);\n\nstatic void __Pyx_UnpackTupleError(PyObject *, Py_ssize_t index); /*proto*/\n\nstatic PyObject *__Pyx_Import(PyObject *name, PyObject *from_list); /*proto*/\n\nstatic int __Pyx_Print(PyObject*, PyObject *, int); /*proto*/\n#if PY_MAJOR_VERSION >= 3\nstatic PyObject* __pyx_print = 0;\nstatic PyObject* __pyx_print_kwargs = 0;\n#endif\n\nstatic int __Pyx_PrintOne(PyObject* stream, PyObject *o); /*proto*/\n\nstatic CYTHON_INLINE PyObject *__Pyx_PyInt_to_py_Py_intptr_t(Py_intptr_t);\n\n#if CYTHON_CCOMPLEX\n #ifdef __cplusplus\n #define __Pyx_CREAL(z) ((z).real())\n #define __Pyx_CIMAG(z) ((z).imag())\n #else\n #define __Pyx_CREAL(z) (__real__(z))\n #define __Pyx_CIMAG(z) (__imag__(z))\n #endif\n#else\n #define __Pyx_CREAL(z) ((z).real)\n #define __Pyx_CIMAG(z) ((z).imag)\n#endif\n\n#if defined(_WIN32) && defined(__cplusplus) && CYTHON_CCOMPLEX\n #define __Pyx_SET_CREAL(z,x) ((z).real(x))\n #define __Pyx_SET_CIMAG(z,y) ((z).imag(y))\n#else\n #define __Pyx_SET_CREAL(z,x) __Pyx_CREAL(z) = (x)\n #define __Pyx_SET_CIMAG(z,y) __Pyx_CIMAG(z) = (y)\n#endif\n\nstatic CYTHON_INLINE __pyx_t_float_complex __pyx_t_float_complex_from_parts(float, float);\n\n#if CYTHON_CCOMPLEX\n #define __Pyx_c_eqf(a, b) ((a)==(b))\n #define __Pyx_c_sumf(a, b) ((a)+(b))\n #define __Pyx_c_difff(a, b) ((a)-(b))\n #define __Pyx_c_prodf(a, b) ((a)*(b))\n #define __Pyx_c_quotf(a, b) ((a)/(b))\n #define __Pyx_c_negf(a) (-(a))\n #ifdef __cplusplus\n #define __Pyx_c_is_zerof(z) ((z)==(float)0)\n #define __Pyx_c_conjf(z) (::std::conj(z))\n #if 1\n #define __Pyx_c_absf(z) (::std::abs(z))\n #define __Pyx_c_powf(a, b) (::std::pow(a, b))\n #endif\n #else\n #define __Pyx_c_is_zerof(z) ((z)==0)\n #define __Pyx_c_conjf(z) (conjf(z))\n #if 1\n #define __Pyx_c_absf(z) (cabsf(z))\n #define __Pyx_c_powf(a, b) (cpowf(a, b))\n #endif\n #endif\n#else\n static CYTHON_INLINE int __Pyx_c_eqf(__pyx_t_float_complex, __pyx_t_float_complex);\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_sumf(__pyx_t_float_complex, __pyx_t_float_complex);\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_difff(__pyx_t_float_complex, __pyx_t_float_complex);\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_prodf(__pyx_t_float_complex, __pyx_t_float_complex);\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_quotf(__pyx_t_float_complex, __pyx_t_float_complex);\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_negf(__pyx_t_float_complex);\n static CYTHON_INLINE int __Pyx_c_is_zerof(__pyx_t_float_complex);\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_conjf(__pyx_t_float_complex);\n #if 1\n static CYTHON_INLINE float __Pyx_c_absf(__pyx_t_float_complex);\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_powf(__pyx_t_float_complex, __pyx_t_float_complex);\n #endif\n#endif\n\nstatic CYTHON_INLINE __pyx_t_double_complex __pyx_t_double_complex_from_parts(double, double);\n\n#if CYTHON_CCOMPLEX\n #define __Pyx_c_eq(a, b) ((a)==(b))\n #define __Pyx_c_sum(a, b) ((a)+(b))\n #define __Pyx_c_diff(a, b) ((a)-(b))\n #define __Pyx_c_prod(a, b) ((a)*(b))\n #define __Pyx_c_quot(a, b) ((a)/(b))\n #define __Pyx_c_neg(a) (-(a))\n #ifdef __cplusplus\n #define __Pyx_c_is_zero(z) ((z)==(double)0)\n #define __Pyx_c_conj(z) (::std::conj(z))\n #if 1\n #define __Pyx_c_abs(z) (::std::abs(z))\n #define __Pyx_c_pow(a, b) (::std::pow(a, b))\n #endif\n #else\n #define __Pyx_c_is_zero(z) ((z)==0)\n #define __Pyx_c_conj(z) (conj(z))\n #if 1\n #define __Pyx_c_abs(z) (cabs(z))\n #define __Pyx_c_pow(a, b) (cpow(a, b))\n #endif\n #endif\n#else\n static CYTHON_INLINE int __Pyx_c_eq(__pyx_t_double_complex, __pyx_t_double_complex);\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_sum(__pyx_t_double_complex, __pyx_t_double_complex);\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_diff(__pyx_t_double_complex, __pyx_t_double_complex);\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_prod(__pyx_t_double_complex, __pyx_t_double_complex);\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_quot(__pyx_t_double_complex, __pyx_t_double_complex);\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_neg(__pyx_t_double_complex);\n static CYTHON_INLINE int __Pyx_c_is_zero(__pyx_t_double_complex);\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_conj(__pyx_t_double_complex);\n #if 1\n static CYTHON_INLINE double __Pyx_c_abs(__pyx_t_double_complex);\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_pow(__pyx_t_double_complex, __pyx_t_double_complex);\n #endif\n#endif\n\nstatic CYTHON_INLINE unsigned char __Pyx_PyInt_AsUnsignedChar(PyObject *);\n\nstatic CYTHON_INLINE unsigned short __Pyx_PyInt_AsUnsignedShort(PyObject *);\n\nstatic CYTHON_INLINE unsigned int __Pyx_PyInt_AsUnsignedInt(PyObject *);\n\nstatic CYTHON_INLINE char __Pyx_PyInt_AsChar(PyObject *);\n\nstatic CYTHON_INLINE short __Pyx_PyInt_AsShort(PyObject *);\n\nstatic CYTHON_INLINE int __Pyx_PyInt_AsInt(PyObject *);\n\nstatic CYTHON_INLINE signed char __Pyx_PyInt_AsSignedChar(PyObject *);\n\nstatic CYTHON_INLINE signed short __Pyx_PyInt_AsSignedShort(PyObject *);\n\nstatic CYTHON_INLINE signed int __Pyx_PyInt_AsSignedInt(PyObject *);\n\nstatic CYTHON_INLINE int __Pyx_PyInt_AsLongDouble(PyObject *);\n\nstatic CYTHON_INLINE unsigned long __Pyx_PyInt_AsUnsignedLong(PyObject *);\n\nstatic CYTHON_INLINE unsigned PY_LONG_LONG __Pyx_PyInt_AsUnsignedLongLong(PyObject *);\n\nstatic CYTHON_INLINE long __Pyx_PyInt_AsLong(PyObject *);\n\nstatic CYTHON_INLINE PY_LONG_LONG __Pyx_PyInt_AsLongLong(PyObject *);\n\nstatic CYTHON_INLINE signed long __Pyx_PyInt_AsSignedLong(PyObject *);\n\nstatic CYTHON_INLINE signed PY_LONG_LONG __Pyx_PyInt_AsSignedLongLong(PyObject *);\n\nstatic void __Pyx_WriteUnraisable(const char *name); /*proto*/\n\nstatic int __Pyx_ExportFunction(const char *name, void (*f)(void), const char *sig); /*proto*/\n\nstatic PyTypeObject *__Pyx_ImportType(const char *module_name, const char *class_name, long size, int strict); /*proto*/\n\nstatic PyObject *__Pyx_ImportModule(const char *name); /*proto*/\n\nstatic void __Pyx_AddTraceback(const char *funcname); /*proto*/\n\nstatic int __Pyx_InitStrings(__Pyx_StringTabEntry *t); /*proto*/\n/* Module declarations from cpython.buffer */\n\n/* Module declarations from cpython.ref */\n\n/* Module declarations from libc.stdio */\n\n/* Module declarations from cpython.object */\n\n/* Module declarations from libc.stdlib */\n\n/* Module declarations from numpy */\n\n/* Module declarations from numpy */\n\nstatic PyTypeObject *__pyx_ptype_5numpy_dtype = 0;\nstatic PyTypeObject *__pyx_ptype_5numpy_flatiter = 0;\nstatic PyTypeObject *__pyx_ptype_5numpy_broadcast = 0;\nstatic PyTypeObject *__pyx_ptype_5numpy_ndarray = 0;\nstatic PyTypeObject *__pyx_ptype_5numpy_ufunc = 0;\nstatic CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew1(PyObject *); /*proto*/\nstatic CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew2(PyObject *, PyObject *); /*proto*/\nstatic CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew3(PyObject *, PyObject *, PyObject *); /*proto*/\nstatic CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew4(PyObject *, PyObject *, PyObject *, PyObject *); /*proto*/\nstatic CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew5(PyObject *, PyObject *, PyObject *, PyObject *, PyObject *); /*proto*/\nstatic CYTHON_INLINE char *__pyx_f_5numpy__util_dtypestring(PyArray_Descr *, char *, char *, int *); /*proto*/\nstatic CYTHON_INLINE void __pyx_f_5numpy_set_array_base(PyArrayObject *, PyObject *); /*proto*/\nstatic CYTHON_INLINE PyObject *__pyx_f_5numpy_get_array_base(PyArrayObject *); /*proto*/\n/* Module declarations from libcpp.vector */\n\n/* Module declarations from wrapper_inner */\n\nstatic void inner_work_1d(int, double *, double *); /*proto*/\nstatic void inner_work_2d(int, int, double *, double *); /*proto*/\n#define __Pyx_MODULE_NAME \"wrapper_inner\"\nstatic int __pyx_module_is_main_wrapper_inner = 0;\n\n/* Implementation of wrapper_inner */\nstatic PyObject *__pyx_builtin_ValueError;\nstatic PyObject *__pyx_builtin_range;\nstatic PyObject *__pyx_builtin_RuntimeError;\nstatic char __pyx_k_1[] = \"\\nHello from Cython inner_work_1d!\";\nstatic char __pyx_k_2[] = \"\\nHello from Cython inner_work_2d!\";\nstatic char __pyx_k_3[] = \"\\nHello from a pure Python function inside the Cython module.\";\nstatic char __pyx_k_5[] = \"ndarray is not C contiguous\";\nstatic char __pyx_k_7[] = \"ndarray is not Fortran contiguous\";\nstatic char __pyx_k_9[] = \"Non-native byte order not supported\";\nstatic char __pyx_k_11[] = \"unknown dtype code in numpy.pxd (%d)\";\nstatic char __pyx_k_12[] = \"Format string allocated too short, see comment in numpy.pxd\";\nstatic char __pyx_k_15[] = \"Format string allocated too short.\";\nstatic char __pyx_k__B[] = \"B\";\nstatic char __pyx_k__H[] = \"H\";\nstatic char __pyx_k__I[] = \"I\";\nstatic char __pyx_k__L[] = \"L\";\nstatic char __pyx_k__O[] = \"O\";\nstatic char __pyx_k__Q[] = \"Q\";\nstatic char __pyx_k__b[] = \"b\";\nstatic char __pyx_k__d[] = \"d\";\nstatic char __pyx_k__f[] = \"f\";\nstatic char __pyx_k__g[] = \"g\";\nstatic char __pyx_k__h[] = \"h\";\nstatic char __pyx_k__i[] = \"i\";\nstatic char __pyx_k__l[] = \"l\";\nstatic char __pyx_k__q[] = \"q\";\nstatic char __pyx_k__Zd[] = \"Zd\";\nstatic char __pyx_k__Zf[] = \"Zf\";\nstatic char __pyx_k__Zg[] = \"Zg\";\nstatic char __pyx_k__np[] = \"np\";\nstatic char __pyx_k__buf[] = \"buf\";\nstatic char __pyx_k__obj[] = \"obj\";\nstatic char __pyx_k__base[] = \"base\";\nstatic char __pyx_k__ndim[] = \"ndim\";\nstatic char __pyx_k__ones[] = \"ones\";\nstatic char __pyx_k__descr[] = \"descr\";\nstatic char __pyx_k__names[] = \"names\";\nstatic char __pyx_k__numpy[] = \"numpy\";\nstatic char __pyx_k__range[] = \"range\";\nstatic char __pyx_k__shape[] = \"shape\";\nstatic char __pyx_k__fields[] = \"fields\";\nstatic char __pyx_k__format[] = \"format\";\nstatic char __pyx_k__strides[] = \"strides\";\nstatic char __pyx_k____main__[] = \"__main__\";\nstatic char __pyx_k____test__[] = \"__test__\";\nstatic char __pyx_k__itemsize[] = \"itemsize\";\nstatic char __pyx_k__readonly[] = \"readonly\";\nstatic char __pyx_k__type_num[] = \"type_num\";\nstatic char __pyx_k__byteorder[] = \"byteorder\";\nstatic char __pyx_k__ValueError[] = \"ValueError\";\nstatic char __pyx_k__suboffsets[] = \"suboffsets\";\nstatic char __pyx_k__work_module[] = \"work_module\";\nstatic char __pyx_k__RuntimeError[] = \"RuntimeError\";\nstatic char __pyx_k__pure_py_test[] = \"pure_py_test\";\nstatic char __pyx_k__wrapper_inner[] = \"wrapper_inner\";\nstatic char __pyx_k__do_awesome_work[] = \"do_awesome_work\";\nstatic PyObject *__pyx_kp_s_1;\nstatic PyObject *__pyx_kp_u_11;\nstatic PyObject *__pyx_kp_u_12;\nstatic PyObject *__pyx_kp_u_15;\nstatic PyObject *__pyx_kp_s_2;\nstatic PyObject *__pyx_kp_s_3;\nstatic PyObject *__pyx_kp_u_5;\nstatic PyObject *__pyx_kp_u_7;\nstatic PyObject *__pyx_kp_u_9;\nstatic PyObject *__pyx_n_s__RuntimeError;\nstatic PyObject *__pyx_n_s__ValueError;\nstatic PyObject *__pyx_n_s____main__;\nstatic PyObject *__pyx_n_s____test__;\nstatic PyObject *__pyx_n_s__base;\nstatic PyObject *__pyx_n_s__buf;\nstatic PyObject *__pyx_n_s__byteorder;\nstatic PyObject *__pyx_n_s__descr;\nstatic PyObject *__pyx_n_s__do_awesome_work;\nstatic PyObject *__pyx_n_s__fields;\nstatic PyObject *__pyx_n_s__format;\nstatic PyObject *__pyx_n_s__itemsize;\nstatic PyObject *__pyx_n_s__names;\nstatic PyObject *__pyx_n_s__ndim;\nstatic PyObject *__pyx_n_s__np;\nstatic PyObject *__pyx_n_s__numpy;\nstatic PyObject *__pyx_n_s__obj;\nstatic PyObject *__pyx_n_s__ones;\nstatic PyObject *__pyx_n_s__pure_py_test;\nstatic PyObject *__pyx_n_s__range;\nstatic PyObject *__pyx_n_s__readonly;\nstatic PyObject *__pyx_n_s__shape;\nstatic PyObject *__pyx_n_s__strides;\nstatic PyObject *__pyx_n_s__suboffsets;\nstatic PyObject *__pyx_n_s__type_num;\nstatic PyObject *__pyx_n_s__work_module;\nstatic PyObject *__pyx_n_s__wrapper_inner;\nstatic PyObject *__pyx_int_5;\nstatic PyObject *__pyx_int_15;\nstatic PyObject *__pyx_k_tuple_4;\nstatic PyObject *__pyx_k_tuple_6;\nstatic PyObject *__pyx_k_tuple_8;\nstatic PyObject *__pyx_k_tuple_10;\nstatic PyObject *__pyx_k_tuple_13;\nstatic PyObject *__pyx_k_tuple_14;\nstatic PyObject *__pyx_k_tuple_16;\n\n/* \"wrapper_inner.pyx\":18\n * # Here is the Cython portion of the wrapper.\n * # Important: this function must be declared with \"api\" keyword!\n * cdef api void inner_work_1d(int num_x, double* data_ptr, double* answer_ptr): # <<<<<<<<<<<<<<\n * \n * print('\\nHello from Cython inner_work_1d!')\n */\n\nstatic void inner_work_1d(int __pyx_v_num_x, double *__pyx_v_data_ptr, double *__pyx_v_answer_ptr) {\n int __pyx_v_nd;\n npy_intp *__pyx_v_dims;\n int __pyx_v_typenum;\n PyArrayObject *__pyx_v_data_np = 0;\n double __pyx_v_sum;\n npy_intp __pyx_t_1[1];\n PyObject *__pyx_t_2 = NULL;\n PyObject *__pyx_t_3 = NULL;\n PyObject *__pyx_t_4 = NULL;\n double __pyx_t_5;\n __Pyx_RefNannySetupContext(\"inner_work_1d\");\n\n /* \"wrapper_inner.pyx\":20\n * cdef api void inner_work_1d(int num_x, double* data_ptr, double* answer_ptr):\n * \n * print('\\nHello from Cython inner_work_1d!') # <<<<<<<<<<<<<<\n * \n * # Convert input data into form useable by Python, with lots of help from Numpy.\n */\n if (__Pyx_PrintOne(0, ((PyObject *)__pyx_kp_s_1)) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 20; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n\n /* \"wrapper_inner.pyx\":25\n * \n * # http://www.mail-archive.com/cython-dev@codespeak.net/msg05823.html\n * cdef int nd = 1 # <<<<<<<<<<<<<<\n * cdef np.npy_intp* dims = [num_x] # analogous to: double a[4] = {0.5, 0.3, 0.1, 0.1}\n * cdef int typenum = np.NPY_DOUBLE\n */\n __pyx_v_nd = 1;\n\n /* \"wrapper_inner.pyx\":26\n * # http://www.mail-archive.com/cython-dev@codespeak.net/msg05823.html\n * cdef int nd = 1\n * cdef np.npy_intp* dims = [num_x] # analogous to: double a[4] = {0.5, 0.3, 0.1, 0.1} # <<<<<<<<<<<<<<\n * cdef int typenum = np.NPY_DOUBLE\n * \n */\n __pyx_t_1[0] = ((npy_intp)__pyx_v_num_x);\n __pyx_v_dims = __pyx_t_1;\n\n /* \"wrapper_inner.pyx\":27\n * cdef int nd = 1\n * cdef np.npy_intp* dims = [num_x] # analogous to: double a[4] = {0.5, 0.3, 0.1, 0.1}\n * cdef int typenum = np.NPY_DOUBLE # <<<<<<<<<<<<<<\n * \n * cdef np.ndarray data_np = PyArray_SimpleNewFromData(nd, dims, typenum, data_ptr)\n */\n __pyx_v_typenum = NPY_DOUBLE;\n\n /* \"wrapper_inner.pyx\":29\n * cdef int typenum = np.NPY_DOUBLE\n * \n * cdef np.ndarray data_np = PyArray_SimpleNewFromData(nd, dims, typenum, data_ptr) # <<<<<<<<<<<<<<\n * \n * # Do the work.\n */\n __pyx_t_2 = PyArray_SimpleNewFromData(__pyx_v_nd, __pyx_v_dims, __pyx_v_typenum, ((void *)__pyx_v_data_ptr)); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 29; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 29; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_v_data_np = ((PyArrayObject *)__pyx_t_2);\n __pyx_t_2 = 0;\n\n /* \"wrapper_inner.pyx\":32\n * \n * # Do the work.\n * cdef double sum = work_module.do_awesome_work(data_np) # <<<<<<<<<<<<<<\n * \n * # # Convert work results into a form useable by the calling C++ application.\n */\n __pyx_t_2 = __Pyx_GetName(__pyx_m, __pyx_n_s__work_module); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 32; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyObject_GetAttr(__pyx_t_2, __pyx_n_s__do_awesome_work); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 32; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n __pyx_t_2 = PyTuple_New(1); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 32; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(((PyObject *)__pyx_t_2));\n __Pyx_INCREF(((PyObject *)__pyx_v_data_np));\n PyTuple_SET_ITEM(__pyx_t_2, 0, ((PyObject *)__pyx_v_data_np));\n __Pyx_GIVEREF(((PyObject *)__pyx_v_data_np));\n __pyx_t_4 = PyObject_Call(__pyx_t_3, ((PyObject *)__pyx_t_2), NULL); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 32; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __Pyx_DECREF(((PyObject *)__pyx_t_2)); __pyx_t_2 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_4); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 32; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n __pyx_v_sum = __pyx_t_5;\n\n /* \"wrapper_inner.pyx\":35\n * \n * # # Convert work results into a form useable by the calling C++ application.\n * answer_ptr[0] = sum # <<<<<<<<<<<<<<\n * \n * # Done.\n */\n (__pyx_v_answer_ptr[0]) = __pyx_v_sum;\n\n goto __pyx_L0;\n __pyx_L1_error:;\n __Pyx_XDECREF(__pyx_t_2);\n __Pyx_XDECREF(__pyx_t_3);\n __Pyx_XDECREF(__pyx_t_4);\n __Pyx_WriteUnraisable(\"wrapper_inner.inner_work_1d\");\n __pyx_L0:;\n __Pyx_XDECREF((PyObject *)__pyx_v_data_np);\n __Pyx_RefNannyFinishContext();\n}\n\n/* \"wrapper_inner.pyx\":40\n * \n * \n * cdef api void inner_work_2d(int num_x, int num_y, double* data_ptr, double* answer_ptr): # <<<<<<<<<<<<<<\n * \n * print('\\nHello from Cython inner_work_2d!')\n */\n\nstatic void inner_work_2d(int __pyx_v_num_x, int __pyx_v_num_y, double *__pyx_v_data_ptr, double *__pyx_v_answer_ptr) {\n int __pyx_v_nd;\n npy_intp *__pyx_v_dims;\n int __pyx_v_typenum;\n PyArrayObject *__pyx_v_data_np = 0;\n double __pyx_v_sum;\n npy_intp __pyx_t_1[2];\n PyObject *__pyx_t_2 = NULL;\n PyObject *__pyx_t_3 = NULL;\n PyObject *__pyx_t_4 = NULL;\n double __pyx_t_5;\n __Pyx_RefNannySetupContext(\"inner_work_2d\");\n\n /* \"wrapper_inner.pyx\":42\n * cdef api void inner_work_2d(int num_x, int num_y, double* data_ptr, double* answer_ptr):\n * \n * print('\\nHello from Cython inner_work_2d!') # <<<<<<<<<<<<<<\n * \n * # Convert input data into form useable by Python, with lots of help from Numpy.\n */\n if (__Pyx_PrintOne(0, ((PyObject *)__pyx_kp_s_2)) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 42; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n\n /* \"wrapper_inner.pyx\":45\n * \n * # Convert input data into form useable by Python, with lots of help from Numpy.\n * cdef int nd = 2 # <<<<<<<<<<<<<<\n * cdef np.npy_intp* dims = [num_x, num_y]\n * cdef int typenum = np.NPY_DOUBLE\n */\n __pyx_v_nd = 2;\n\n /* \"wrapper_inner.pyx\":46\n * # Convert input data into form useable by Python, with lots of help from Numpy.\n * cdef int nd = 2\n * cdef np.npy_intp* dims = [num_x, num_y] # <<<<<<<<<<<<<<\n * cdef int typenum = np.NPY_DOUBLE\n * \n */\n __pyx_t_1[0] = ((npy_intp)__pyx_v_num_x);\n __pyx_t_1[1] = ((npy_intp)__pyx_v_num_y);\n __pyx_v_dims = __pyx_t_1;\n\n /* \"wrapper_inner.pyx\":47\n * cdef int nd = 2\n * cdef np.npy_intp* dims = [num_x, num_y]\n * cdef int typenum = np.NPY_DOUBLE # <<<<<<<<<<<<<<\n * \n * cdef np.ndarray data_np = PyArray_SimpleNewFromData(nd, dims, typenum, data_ptr)\n */\n __pyx_v_typenum = NPY_DOUBLE;\n\n /* \"wrapper_inner.pyx\":49\n * cdef int typenum = np.NPY_DOUBLE\n * \n * cdef np.ndarray data_np = PyArray_SimpleNewFromData(nd, dims, typenum, data_ptr) # <<<<<<<<<<<<<<\n * \n * # Do the work.\n */\n __pyx_t_2 = PyArray_SimpleNewFromData(__pyx_v_nd, __pyx_v_dims, __pyx_v_typenum, ((void *)__pyx_v_data_ptr)); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_v_data_np = ((PyArrayObject *)__pyx_t_2);\n __pyx_t_2 = 0;\n\n /* \"wrapper_inner.pyx\":52\n * \n * # Do the work.\n * cdef double sum = work_module.do_awesome_work(data_np) # <<<<<<<<<<<<<<\n * \n * # # Convert work results into a form useable by the calling C++ application.\n */\n __pyx_t_2 = __Pyx_GetName(__pyx_m, __pyx_n_s__work_module); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 52; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __pyx_t_3 = PyObject_GetAttr(__pyx_t_2, __pyx_n_s__do_awesome_work); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 52; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n __pyx_t_2 = PyTuple_New(1); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 52; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(((PyObject *)__pyx_t_2));\n __Pyx_INCREF(((PyObject *)__pyx_v_data_np));\n PyTuple_SET_ITEM(__pyx_t_2, 0, ((PyObject *)__pyx_v_data_np));\n __Pyx_GIVEREF(((PyObject *)__pyx_v_data_np));\n __pyx_t_4 = PyObject_Call(__pyx_t_3, ((PyObject *)__pyx_t_2), NULL); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 52; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __Pyx_DECREF(((PyObject *)__pyx_t_2)); __pyx_t_2 = 0;\n __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_4); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 52; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n __pyx_v_sum = __pyx_t_5;\n\n /* \"wrapper_inner.pyx\":55\n * \n * # # Convert work results into a form useable by the calling C++ application.\n * answer_ptr[0] = sum # <<<<<<<<<<<<<<\n * \n * \n */\n (__pyx_v_answer_ptr[0]) = __pyx_v_sum;\n\n goto __pyx_L0;\n __pyx_L1_error:;\n __Pyx_XDECREF(__pyx_t_2);\n __Pyx_XDECREF(__pyx_t_3);\n __Pyx_XDECREF(__pyx_t_4);\n __Pyx_WriteUnraisable(\"wrapper_inner.inner_work_2d\");\n __pyx_L0:;\n __Pyx_XDECREF((PyObject *)__pyx_v_data_np);\n __Pyx_RefNannyFinishContext();\n}\n\n/* \"wrapper_inner.pyx\":64\n * \n * \n * def pure_py_test(): # <<<<<<<<<<<<<<\n * \n * print('\\nHello from a pure Python function inside the Cython module.')\n */\n\nstatic PyObject *__pyx_pf_13wrapper_inner_pure_py_test(PyObject *__pyx_self, CYTHON_UNUSED PyObject *unused); /*proto*/\nstatic PyMethodDef __pyx_mdef_13wrapper_inner_pure_py_test = {__Pyx_NAMESTR(\"pure_py_test\"), (PyCFunction)__pyx_pf_13wrapper_inner_pure_py_test, METH_NOARGS, __Pyx_DOCSTR(0)};\nstatic PyObject *__pyx_pf_13wrapper_inner_pure_py_test(PyObject *__pyx_self, CYTHON_UNUSED PyObject *unused) {\n PyObject *__pyx_v_data;\n PyObject *__pyx_r = NULL;\n PyObject *__pyx_t_1 = NULL;\n PyObject *__pyx_t_2 = NULL;\n PyObject *__pyx_t_3 = NULL;\n __Pyx_RefNannySetupContext(\"pure_py_test\");\n __pyx_self = __pyx_self;\n __pyx_v_data = Py_None; __Pyx_INCREF(Py_None);\n\n /* \"wrapper_inner.pyx\":66\n * def pure_py_test():\n * \n * print('\\nHello from a pure Python function inside the Cython module.') # <<<<<<<<<<<<<<\n * \n * data = np.ones(5)\n */\n if (__Pyx_PrintOne(0, ((PyObject *)__pyx_kp_s_3)) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 66; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n\n /* \"wrapper_inner.pyx\":68\n * print('\\nHello from a pure Python function inside the Cython module.')\n * \n * data = np.ones(5) # <<<<<<<<<<<<<<\n * work_module.do_awesome_work(data)\n */\n __pyx_t_1 = __Pyx_GetName(__pyx_m, __pyx_n_s__np); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 68; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n __pyx_t_2 = PyObject_GetAttr(__pyx_t_1, __pyx_n_s__ones); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 68; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n __pyx_t_1 = PyObject_Call(__pyx_t_2, ((PyObject *)__pyx_k_tuple_4), NULL); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 68; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n __Pyx_DECREF(__pyx_v_data);\n __pyx_v_data = __pyx_t_1;\n __pyx_t_1 = 0;\n\n /* \"wrapper_inner.pyx\":69\n * \n * data = np.ones(5)\n * work_module.do_awesome_work(data) # <<<<<<<<<<<<<<\n */\n __pyx_t_1 = __Pyx_GetName(__pyx_m, __pyx_n_s__work_module); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 69; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n __pyx_t_2 = PyObject_GetAttr(__pyx_t_1, __pyx_n_s__do_awesome_work); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 69; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_2);\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n __pyx_t_1 = PyTuple_New(1); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 69; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(((PyObject *)__pyx_t_1));\n __Pyx_INCREF(__pyx_v_data);\n PyTuple_SET_ITEM(__pyx_t_1, 0, __pyx_v_data);\n __Pyx_GIVEREF(__pyx_v_data);\n __pyx_t_3 = PyObject_Call(__pyx_t_2, ((PyObject *)__pyx_t_1), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 69; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n __Pyx_DECREF(((PyObject *)__pyx_t_1)); __pyx_t_1 = 0;\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n\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_XDECREF(__pyx_t_2);\n __Pyx_XDECREF(__pyx_t_3);\n __Pyx_AddTraceback(\"wrapper_inner.pure_py_test\");\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_DECREF(__pyx_v_data);\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"numpy.pxd\":188\n * # experimental exception made for __getbuffer__ and __releasebuffer__\n * # -- the details of this may change.\n * def __getbuffer__(ndarray self, Py_buffer* info, int flags): # <<<<<<<<<<<<<<\n * # This implementation of getbuffer is geared towards Cython\n * # requirements, and does not yet fullfill the PEP.\n */\n\nstatic CYTHON_UNUSED int __pyx_pf_5numpy_7ndarray___getbuffer__(PyObject *__pyx_v_self, Py_buffer *__pyx_v_info, int __pyx_v_flags); /*proto*/\nstatic CYTHON_UNUSED int __pyx_pf_5numpy_7ndarray___getbuffer__(PyObject *__pyx_v_self, Py_buffer *__pyx_v_info, int __pyx_v_flags) {\n int __pyx_v_copy_shape;\n int __pyx_v_i;\n int __pyx_v_ndim;\n int __pyx_v_endian_detector;\n int __pyx_v_little_endian;\n int __pyx_v_t;\n char *__pyx_v_f;\n PyArray_Descr *__pyx_v_descr = 0;\n int __pyx_v_offset;\n int __pyx_v_hasfields;\n int __pyx_r;\n PyObject *__pyx_t_1 = NULL;\n int __pyx_t_2;\n int __pyx_t_3;\n int __pyx_t_4;\n int __pyx_t_5;\n int __pyx_t_6;\n int __pyx_t_7;\n PyObject *__pyx_t_8 = NULL;\n char *__pyx_t_9;\n __Pyx_RefNannySetupContext(\"__getbuffer__\");\n if (__pyx_v_info == NULL) return 0;\n __pyx_v_info->obj = Py_None; __Pyx_INCREF(Py_None);\n __Pyx_GIVEREF(__pyx_v_info->obj);\n\n /* \"numpy.pxd\":194\n * # of flags\n * cdef int copy_shape, i, ndim\n * cdef int endian_detector = 1 # <<<<<<<<<<<<<<\n * cdef bint little_endian = ((&endian_detector)[0] != 0)\n * \n */\n __pyx_v_endian_detector = 1;\n\n /* \"numpy.pxd\":195\n * cdef int copy_shape, i, ndim\n * cdef int endian_detector = 1\n * cdef bint little_endian = ((&endian_detector)[0] != 0) # <<<<<<<<<<<<<<\n * \n * ndim = PyArray_NDIM(self)\n */\n __pyx_v_little_endian = ((((char *)(&__pyx_v_endian_detector))[0]) != 0);\n\n /* \"numpy.pxd\":197\n * cdef bint little_endian = ((&endian_detector)[0] != 0)\n * \n * ndim = PyArray_NDIM(self) # <<<<<<<<<<<<<<\n * \n * if sizeof(npy_intp) != sizeof(Py_ssize_t):\n */\n __pyx_t_1 = __pyx_v_self;\n __Pyx_INCREF(__pyx_t_1);\n __pyx_v_ndim = PyArray_NDIM(((PyArrayObject *)__pyx_t_1));\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n /* \"numpy.pxd\":199\n * ndim = PyArray_NDIM(self)\n * \n * if sizeof(npy_intp) != sizeof(Py_ssize_t): # <<<<<<<<<<<<<<\n * copy_shape = 1\n * else:\n */\n __pyx_t_2 = ((sizeof(npy_intp)) != (sizeof(Py_ssize_t)));\n if (__pyx_t_2) {\n\n /* \"numpy.pxd\":200\n * \n * if sizeof(npy_intp) != sizeof(Py_ssize_t):\n * copy_shape = 1 # <<<<<<<<<<<<<<\n * else:\n * copy_shape = 0\n */\n __pyx_v_copy_shape = 1;\n goto __pyx_L5;\n }\n /*else*/ {\n\n /* \"numpy.pxd\":202\n * copy_shape = 1\n * else:\n * copy_shape = 0 # <<<<<<<<<<<<<<\n * \n * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS)\n */\n __pyx_v_copy_shape = 0;\n }\n __pyx_L5:;\n\n /* \"numpy.pxd\":204\n * copy_shape = 0\n * \n * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS) # <<<<<<<<<<<<<<\n * and not PyArray_CHKFLAGS(self, NPY_C_CONTIGUOUS)):\n * raise ValueError(u\"ndarray is not C contiguous\")\n */\n __pyx_t_2 = ((__pyx_v_flags & PyBUF_C_CONTIGUOUS) == PyBUF_C_CONTIGUOUS);\n if (__pyx_t_2) {\n\n /* \"numpy.pxd\":205\n * \n * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS)\n * and not PyArray_CHKFLAGS(self, NPY_C_CONTIGUOUS)): # <<<<<<<<<<<<<<\n * raise ValueError(u\"ndarray is not C contiguous\")\n * \n */\n __pyx_t_1 = __pyx_v_self;\n __Pyx_INCREF(__pyx_t_1);\n __pyx_t_3 = (!PyArray_CHKFLAGS(((PyArrayObject *)__pyx_t_1), NPY_C_CONTIGUOUS));\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n __pyx_t_4 = __pyx_t_3;\n } else {\n __pyx_t_4 = __pyx_t_2;\n }\n if (__pyx_t_4) {\n\n /* \"numpy.pxd\":206\n * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS)\n * and not PyArray_CHKFLAGS(self, NPY_C_CONTIGUOUS)):\n * raise ValueError(u\"ndarray is not C contiguous\") # <<<<<<<<<<<<<<\n * \n * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS)\n */\n __pyx_t_1 = PyObject_Call(__pyx_builtin_ValueError, ((PyObject *)__pyx_k_tuple_6), NULL); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 206; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n __Pyx_Raise(__pyx_t_1, 0, 0);\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n {__pyx_filename = __pyx_f[1]; __pyx_lineno = 206; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n goto __pyx_L6;\n }\n __pyx_L6:;\n\n /* \"numpy.pxd\":208\n * raise ValueError(u\"ndarray is not C contiguous\")\n * \n * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS) # <<<<<<<<<<<<<<\n * and not PyArray_CHKFLAGS(self, NPY_F_CONTIGUOUS)):\n * raise ValueError(u\"ndarray is not Fortran contiguous\")\n */\n __pyx_t_4 = ((__pyx_v_flags & PyBUF_F_CONTIGUOUS) == PyBUF_F_CONTIGUOUS);\n if (__pyx_t_4) {\n\n /* \"numpy.pxd\":209\n * \n * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS)\n * and not PyArray_CHKFLAGS(self, NPY_F_CONTIGUOUS)): # <<<<<<<<<<<<<<\n * raise ValueError(u\"ndarray is not Fortran contiguous\")\n * \n */\n __pyx_t_1 = __pyx_v_self;\n __Pyx_INCREF(__pyx_t_1);\n __pyx_t_2 = (!PyArray_CHKFLAGS(((PyArrayObject *)__pyx_t_1), NPY_F_CONTIGUOUS));\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n __pyx_t_3 = __pyx_t_2;\n } else {\n __pyx_t_3 = __pyx_t_4;\n }\n if (__pyx_t_3) {\n\n /* \"numpy.pxd\":210\n * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS)\n * and not PyArray_CHKFLAGS(self, NPY_F_CONTIGUOUS)):\n * raise ValueError(u\"ndarray is not Fortran contiguous\") # <<<<<<<<<<<<<<\n * \n * info.buf = PyArray_DATA(self)\n */\n __pyx_t_1 = PyObject_Call(__pyx_builtin_ValueError, ((PyObject *)__pyx_k_tuple_8), NULL); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n __Pyx_Raise(__pyx_t_1, 0, 0);\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n {__pyx_filename = __pyx_f[1]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n goto __pyx_L7;\n }\n __pyx_L7:;\n\n /* \"numpy.pxd\":212\n * raise ValueError(u\"ndarray is not Fortran contiguous\")\n * \n * info.buf = PyArray_DATA(self) # <<<<<<<<<<<<<<\n * info.ndim = ndim\n * if copy_shape:\n */\n __pyx_t_1 = __pyx_v_self;\n __Pyx_INCREF(__pyx_t_1);\n __pyx_v_info->buf = PyArray_DATA(((PyArrayObject *)__pyx_t_1));\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n /* \"numpy.pxd\":213\n * \n * info.buf = PyArray_DATA(self)\n * info.ndim = ndim # <<<<<<<<<<<<<<\n * if copy_shape:\n * # Allocate new buffer for strides and shape info. This is allocated\n */\n __pyx_v_info->ndim = __pyx_v_ndim;\n\n /* \"numpy.pxd\":214\n * info.buf = PyArray_DATA(self)\n * info.ndim = ndim\n * if copy_shape: # <<<<<<<<<<<<<<\n * # Allocate new buffer for strides and shape info. This is allocated\n * # as one block, strides first.\n */\n if (__pyx_v_copy_shape) {\n\n /* \"numpy.pxd\":217\n * # Allocate new buffer for strides and shape info. This is allocated\n * # as one block, strides first.\n * info.strides = stdlib.malloc(sizeof(Py_ssize_t) * ndim * 2) # <<<<<<<<<<<<<<\n * info.shape = info.strides + ndim\n * for i in range(ndim):\n */\n __pyx_v_info->strides = ((Py_ssize_t *)malloc((((sizeof(Py_ssize_t)) * __pyx_v_ndim) * 2)));\n\n /* \"numpy.pxd\":218\n * # as one block, strides first.\n * info.strides = stdlib.malloc(sizeof(Py_ssize_t) * ndim * 2)\n * info.shape = info.strides + ndim # <<<<<<<<<<<<<<\n * for i in range(ndim):\n * info.strides[i] = PyArray_STRIDES(self)[i]\n */\n __pyx_v_info->shape = (__pyx_v_info->strides + __pyx_v_ndim);\n\n /* \"numpy.pxd\":219\n * info.strides = stdlib.malloc(sizeof(Py_ssize_t) * ndim * 2)\n * info.shape = info.strides + ndim\n * for i in range(ndim): # <<<<<<<<<<<<<<\n * info.strides[i] = PyArray_STRIDES(self)[i]\n * info.shape[i] = PyArray_DIMS(self)[i]\n */\n __pyx_t_5 = __pyx_v_ndim;\n for (__pyx_t_6 = 0; __pyx_t_6 < __pyx_t_5; __pyx_t_6+=1) {\n __pyx_v_i = __pyx_t_6;\n\n /* \"numpy.pxd\":220\n * info.shape = info.strides + ndim\n * for i in range(ndim):\n * info.strides[i] = PyArray_STRIDES(self)[i] # <<<<<<<<<<<<<<\n * info.shape[i] = PyArray_DIMS(self)[i]\n * else:\n */\n __pyx_t_1 = __pyx_v_self;\n __Pyx_INCREF(__pyx_t_1);\n (__pyx_v_info->strides[__pyx_v_i]) = (PyArray_STRIDES(((PyArrayObject *)__pyx_t_1))[__pyx_v_i]);\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n /* \"numpy.pxd\":221\n * for i in range(ndim):\n * info.strides[i] = PyArray_STRIDES(self)[i]\n * info.shape[i] = PyArray_DIMS(self)[i] # <<<<<<<<<<<<<<\n * else:\n * info.strides = PyArray_STRIDES(self)\n */\n __pyx_t_1 = __pyx_v_self;\n __Pyx_INCREF(__pyx_t_1);\n (__pyx_v_info->shape[__pyx_v_i]) = (PyArray_DIMS(((PyArrayObject *)__pyx_t_1))[__pyx_v_i]);\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n }\n goto __pyx_L8;\n }\n /*else*/ {\n\n /* \"numpy.pxd\":223\n * info.shape[i] = PyArray_DIMS(self)[i]\n * else:\n * info.strides = PyArray_STRIDES(self) # <<<<<<<<<<<<<<\n * info.shape = PyArray_DIMS(self)\n * info.suboffsets = NULL\n */\n __pyx_t_1 = __pyx_v_self;\n __Pyx_INCREF(__pyx_t_1);\n __pyx_v_info->strides = ((Py_ssize_t *)PyArray_STRIDES(((PyArrayObject *)__pyx_t_1)));\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n /* \"numpy.pxd\":224\n * else:\n * info.strides = PyArray_STRIDES(self)\n * info.shape = PyArray_DIMS(self) # <<<<<<<<<<<<<<\n * info.suboffsets = NULL\n * info.itemsize = PyArray_ITEMSIZE(self)\n */\n __pyx_t_1 = __pyx_v_self;\n __Pyx_INCREF(__pyx_t_1);\n __pyx_v_info->shape = ((Py_ssize_t *)PyArray_DIMS(((PyArrayObject *)__pyx_t_1)));\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n }\n __pyx_L8:;\n\n /* \"numpy.pxd\":225\n * info.strides = PyArray_STRIDES(self)\n * info.shape = PyArray_DIMS(self)\n * info.suboffsets = NULL # <<<<<<<<<<<<<<\n * info.itemsize = PyArray_ITEMSIZE(self)\n * info.readonly = not PyArray_ISWRITEABLE(self)\n */\n __pyx_v_info->suboffsets = NULL;\n\n /* \"numpy.pxd\":226\n * info.shape = PyArray_DIMS(self)\n * info.suboffsets = NULL\n * info.itemsize = PyArray_ITEMSIZE(self) # <<<<<<<<<<<<<<\n * info.readonly = not PyArray_ISWRITEABLE(self)\n * \n */\n __pyx_t_1 = __pyx_v_self;\n __Pyx_INCREF(__pyx_t_1);\n __pyx_v_info->itemsize = PyArray_ITEMSIZE(((PyArrayObject *)__pyx_t_1));\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n /* \"numpy.pxd\":227\n * info.suboffsets = NULL\n * info.itemsize = PyArray_ITEMSIZE(self)\n * info.readonly = not PyArray_ISWRITEABLE(self) # <<<<<<<<<<<<<<\n * \n * cdef int t\n */\n __pyx_t_1 = __pyx_v_self;\n __Pyx_INCREF(__pyx_t_1);\n __pyx_v_info->readonly = (!PyArray_ISWRITEABLE(((PyArrayObject *)__pyx_t_1)));\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n /* \"numpy.pxd\":230\n * \n * cdef int t\n * cdef char* f = NULL # <<<<<<<<<<<<<<\n * cdef dtype descr = self.descr\n * cdef list stack\n */\n __pyx_v_f = NULL;\n\n /* \"numpy.pxd\":231\n * cdef int t\n * cdef char* f = NULL\n * cdef dtype descr = self.descr # <<<<<<<<<<<<<<\n * cdef list stack\n * cdef int offset\n */\n __Pyx_INCREF(((PyObject *)((PyArrayObject *)__pyx_v_self)->descr));\n __pyx_v_descr = ((PyArrayObject *)__pyx_v_self)->descr;\n\n /* \"numpy.pxd\":235\n * cdef int offset\n * \n * cdef bint hasfields = PyDataType_HASFIELDS(descr) # <<<<<<<<<<<<<<\n * \n * if not hasfields and not copy_shape:\n */\n __pyx_v_hasfields = PyDataType_HASFIELDS(__pyx_v_descr);\n\n /* \"numpy.pxd\":237\n * cdef bint hasfields = PyDataType_HASFIELDS(descr)\n * \n * if not hasfields and not copy_shape: # <<<<<<<<<<<<<<\n * # do not call releasebuffer\n * info.obj = None\n */\n __pyx_t_3 = (!__pyx_v_hasfields);\n if (__pyx_t_3) {\n __pyx_t_4 = (!__pyx_v_copy_shape);\n __pyx_t_2 = __pyx_t_4;\n } else {\n __pyx_t_2 = __pyx_t_3;\n }\n if (__pyx_t_2) {\n\n /* \"numpy.pxd\":239\n * if not hasfields and not copy_shape:\n * # do not call releasebuffer\n * info.obj = None # <<<<<<<<<<<<<<\n * else:\n * # need to call releasebuffer\n */\n __Pyx_INCREF(Py_None);\n __Pyx_GIVEREF(Py_None);\n __Pyx_GOTREF(__pyx_v_info->obj);\n __Pyx_DECREF(__pyx_v_info->obj);\n __pyx_v_info->obj = Py_None;\n goto __pyx_L11;\n }\n /*else*/ {\n\n /* \"numpy.pxd\":242\n * else:\n * # need to call releasebuffer\n * info.obj = self # <<<<<<<<<<<<<<\n * \n * if not hasfields:\n */\n __Pyx_INCREF(__pyx_v_self);\n __Pyx_GIVEREF(__pyx_v_self);\n __Pyx_GOTREF(__pyx_v_info->obj);\n __Pyx_DECREF(__pyx_v_info->obj);\n __pyx_v_info->obj = __pyx_v_self;\n }\n __pyx_L11:;\n\n /* \"numpy.pxd\":244\n * info.obj = self\n * \n * if not hasfields: # <<<<<<<<<<<<<<\n * t = descr.type_num\n * if ((descr.byteorder == '>' and little_endian) or\n */\n __pyx_t_2 = (!__pyx_v_hasfields);\n if (__pyx_t_2) {\n\n /* \"numpy.pxd\":245\n * \n * if not hasfields:\n * t = descr.type_num # <<<<<<<<<<<<<<\n * if ((descr.byteorder == '>' and little_endian) or\n * (descr.byteorder == '<' and not little_endian)):\n */\n __pyx_v_t = __pyx_v_descr->type_num;\n\n /* \"numpy.pxd\":246\n * if not hasfields:\n * t = descr.type_num\n * if ((descr.byteorder == '>' and little_endian) or # <<<<<<<<<<<<<<\n * (descr.byteorder == '<' and not little_endian)):\n * raise ValueError(u\"Non-native byte order not supported\")\n */\n __pyx_t_2 = (__pyx_v_descr->byteorder == '>');\n if (__pyx_t_2) {\n __pyx_t_3 = __pyx_v_little_endian;\n } else {\n __pyx_t_3 = __pyx_t_2;\n }\n if (!__pyx_t_3) {\n\n /* \"numpy.pxd\":247\n * t = descr.type_num\n * if ((descr.byteorder == '>' and little_endian) or\n * (descr.byteorder == '<' and not little_endian)): # <<<<<<<<<<<<<<\n * raise ValueError(u\"Non-native byte order not supported\")\n * if t == NPY_BYTE: f = \"b\"\n */\n __pyx_t_2 = (__pyx_v_descr->byteorder == '<');\n if (__pyx_t_2) {\n __pyx_t_4 = (!__pyx_v_little_endian);\n __pyx_t_7 = __pyx_t_4;\n } else {\n __pyx_t_7 = __pyx_t_2;\n }\n __pyx_t_2 = __pyx_t_7;\n } else {\n __pyx_t_2 = __pyx_t_3;\n }\n if (__pyx_t_2) {\n\n /* \"numpy.pxd\":248\n * if ((descr.byteorder == '>' and little_endian) or\n * (descr.byteorder == '<' and not little_endian)):\n * raise ValueError(u\"Non-native byte order not supported\") # <<<<<<<<<<<<<<\n * if t == NPY_BYTE: f = \"b\"\n * elif t == NPY_UBYTE: f = \"B\"\n */\n __pyx_t_1 = PyObject_Call(__pyx_builtin_ValueError, ((PyObject *)__pyx_k_tuple_10), NULL); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 248; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n __Pyx_Raise(__pyx_t_1, 0, 0);\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n {__pyx_filename = __pyx_f[1]; __pyx_lineno = 248; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n goto __pyx_L13;\n }\n __pyx_L13:;\n\n /* \"numpy.pxd\":249\n * (descr.byteorder == '<' and not little_endian)):\n * raise ValueError(u\"Non-native byte order not supported\")\n * if t == NPY_BYTE: f = \"b\" # <<<<<<<<<<<<<<\n * elif t == NPY_UBYTE: f = \"B\"\n * elif t == NPY_SHORT: f = \"h\"\n */\n __pyx_t_2 = (__pyx_v_t == NPY_BYTE);\n if (__pyx_t_2) {\n __pyx_v_f = __pyx_k__b;\n goto __pyx_L14;\n }\n\n /* \"numpy.pxd\":250\n * raise ValueError(u\"Non-native byte order not supported\")\n * if t == NPY_BYTE: f = \"b\"\n * elif t == NPY_UBYTE: f = \"B\" # <<<<<<<<<<<<<<\n * elif t == NPY_SHORT: f = \"h\"\n * elif t == NPY_USHORT: f = \"H\"\n */\n __pyx_t_2 = (__pyx_v_t == NPY_UBYTE);\n if (__pyx_t_2) {\n __pyx_v_f = __pyx_k__B;\n goto __pyx_L14;\n }\n\n /* \"numpy.pxd\":251\n * if t == NPY_BYTE: f = \"b\"\n * elif t == NPY_UBYTE: f = \"B\"\n * elif t == NPY_SHORT: f = \"h\" # <<<<<<<<<<<<<<\n * elif t == NPY_USHORT: f = \"H\"\n * elif t == NPY_INT: f = \"i\"\n */\n __pyx_t_2 = (__pyx_v_t == NPY_SHORT);\n if (__pyx_t_2) {\n __pyx_v_f = __pyx_k__h;\n goto __pyx_L14;\n }\n\n /* \"numpy.pxd\":252\n * elif t == NPY_UBYTE: f = \"B\"\n * elif t == NPY_SHORT: f = \"h\"\n * elif t == NPY_USHORT: f = \"H\" # <<<<<<<<<<<<<<\n * elif t == NPY_INT: f = \"i\"\n * elif t == NPY_UINT: f = \"I\"\n */\n __pyx_t_2 = (__pyx_v_t == NPY_USHORT);\n if (__pyx_t_2) {\n __pyx_v_f = __pyx_k__H;\n goto __pyx_L14;\n }\n\n /* \"numpy.pxd\":253\n * elif t == NPY_SHORT: f = \"h\"\n * elif t == NPY_USHORT: f = \"H\"\n * elif t == NPY_INT: f = \"i\" # <<<<<<<<<<<<<<\n * elif t == NPY_UINT: f = \"I\"\n * elif t == NPY_LONG: f = \"l\"\n */\n __pyx_t_2 = (__pyx_v_t == NPY_INT);\n if (__pyx_t_2) {\n __pyx_v_f = __pyx_k__i;\n goto __pyx_L14;\n }\n\n /* \"numpy.pxd\":254\n * elif t == NPY_USHORT: f = \"H\"\n * elif t == NPY_INT: f = \"i\"\n * elif t == NPY_UINT: f = \"I\" # <<<<<<<<<<<<<<\n * elif t == NPY_LONG: f = \"l\"\n * elif t == NPY_ULONG: f = \"L\"\n */\n __pyx_t_2 = (__pyx_v_t == NPY_UINT);\n if (__pyx_t_2) {\n __pyx_v_f = __pyx_k__I;\n goto __pyx_L14;\n }\n\n /* \"numpy.pxd\":255\n * elif t == NPY_INT: f = \"i\"\n * elif t == NPY_UINT: f = \"I\"\n * elif t == NPY_LONG: f = \"l\" # <<<<<<<<<<<<<<\n * elif t == NPY_ULONG: f = \"L\"\n * elif t == NPY_LONGLONG: f = \"q\"\n */\n __pyx_t_2 = (__pyx_v_t == NPY_LONG);\n if (__pyx_t_2) {\n __pyx_v_f = __pyx_k__l;\n goto __pyx_L14;\n }\n\n /* \"numpy.pxd\":256\n * elif t == NPY_UINT: f = \"I\"\n * elif t == NPY_LONG: f = \"l\"\n * elif t == NPY_ULONG: f = \"L\" # <<<<<<<<<<<<<<\n * elif t == NPY_LONGLONG: f = \"q\"\n * elif t == NPY_ULONGLONG: f = \"Q\"\n */\n __pyx_t_2 = (__pyx_v_t == NPY_ULONG);\n if (__pyx_t_2) {\n __pyx_v_f = __pyx_k__L;\n goto __pyx_L14;\n }\n\n /* \"numpy.pxd\":257\n * elif t == NPY_LONG: f = \"l\"\n * elif t == NPY_ULONG: f = \"L\"\n * elif t == NPY_LONGLONG: f = \"q\" # <<<<<<<<<<<<<<\n * elif t == NPY_ULONGLONG: f = \"Q\"\n * elif t == NPY_FLOAT: f = \"f\"\n */\n __pyx_t_2 = (__pyx_v_t == NPY_LONGLONG);\n if (__pyx_t_2) {\n __pyx_v_f = __pyx_k__q;\n goto __pyx_L14;\n }\n\n /* \"numpy.pxd\":258\n * elif t == NPY_ULONG: f = \"L\"\n * elif t == NPY_LONGLONG: f = \"q\"\n * elif t == NPY_ULONGLONG: f = \"Q\" # <<<<<<<<<<<<<<\n * elif t == NPY_FLOAT: f = \"f\"\n * elif t == NPY_DOUBLE: f = \"d\"\n */\n __pyx_t_2 = (__pyx_v_t == NPY_ULONGLONG);\n if (__pyx_t_2) {\n __pyx_v_f = __pyx_k__Q;\n goto __pyx_L14;\n }\n\n /* \"numpy.pxd\":259\n * elif t == NPY_LONGLONG: f = \"q\"\n * elif t == NPY_ULONGLONG: f = \"Q\"\n * elif t == NPY_FLOAT: f = \"f\" # <<<<<<<<<<<<<<\n * elif t == NPY_DOUBLE: f = \"d\"\n * elif t == NPY_LONGDOUBLE: f = \"g\"\n */\n __pyx_t_2 = (__pyx_v_t == NPY_FLOAT);\n if (__pyx_t_2) {\n __pyx_v_f = __pyx_k__f;\n goto __pyx_L14;\n }\n\n /* \"numpy.pxd\":260\n * elif t == NPY_ULONGLONG: f = \"Q\"\n * elif t == NPY_FLOAT: f = \"f\"\n * elif t == NPY_DOUBLE: f = \"d\" # <<<<<<<<<<<<<<\n * elif t == NPY_LONGDOUBLE: f = \"g\"\n * elif t == NPY_CFLOAT: f = \"Zf\"\n */\n __pyx_t_2 = (__pyx_v_t == NPY_DOUBLE);\n if (__pyx_t_2) {\n __pyx_v_f = __pyx_k__d;\n goto __pyx_L14;\n }\n\n /* \"numpy.pxd\":261\n * elif t == NPY_FLOAT: f = \"f\"\n * elif t == NPY_DOUBLE: f = \"d\"\n * elif t == NPY_LONGDOUBLE: f = \"g\" # <<<<<<<<<<<<<<\n * elif t == NPY_CFLOAT: f = \"Zf\"\n * elif t == NPY_CDOUBLE: f = \"Zd\"\n */\n __pyx_t_2 = (__pyx_v_t == NPY_LONGDOUBLE);\n if (__pyx_t_2) {\n __pyx_v_f = __pyx_k__g;\n goto __pyx_L14;\n }\n\n /* \"numpy.pxd\":262\n * elif t == NPY_DOUBLE: f = \"d\"\n * elif t == NPY_LONGDOUBLE: f = \"g\"\n * elif t == NPY_CFLOAT: f = \"Zf\" # <<<<<<<<<<<<<<\n * elif t == NPY_CDOUBLE: f = \"Zd\"\n * elif t == NPY_CLONGDOUBLE: f = \"Zg\"\n */\n __pyx_t_2 = (__pyx_v_t == NPY_CFLOAT);\n if (__pyx_t_2) {\n __pyx_v_f = __pyx_k__Zf;\n goto __pyx_L14;\n }\n\n /* \"numpy.pxd\":263\n * elif t == NPY_LONGDOUBLE: f = \"g\"\n * elif t == NPY_CFLOAT: f = \"Zf\"\n * elif t == NPY_CDOUBLE: f = \"Zd\" # <<<<<<<<<<<<<<\n * elif t == NPY_CLONGDOUBLE: f = \"Zg\"\n * elif t == NPY_OBJECT: f = \"O\"\n */\n __pyx_t_2 = (__pyx_v_t == NPY_CDOUBLE);\n if (__pyx_t_2) {\n __pyx_v_f = __pyx_k__Zd;\n goto __pyx_L14;\n }\n\n /* \"numpy.pxd\":264\n * elif t == NPY_CFLOAT: f = \"Zf\"\n * elif t == NPY_CDOUBLE: f = \"Zd\"\n * elif t == NPY_CLONGDOUBLE: f = \"Zg\" # <<<<<<<<<<<<<<\n * elif t == NPY_OBJECT: f = \"O\"\n * else:\n */\n __pyx_t_2 = (__pyx_v_t == NPY_CLONGDOUBLE);\n if (__pyx_t_2) {\n __pyx_v_f = __pyx_k__Zg;\n goto __pyx_L14;\n }\n\n /* \"numpy.pxd\":265\n * elif t == NPY_CDOUBLE: f = \"Zd\"\n * elif t == NPY_CLONGDOUBLE: f = \"Zg\"\n * elif t == NPY_OBJECT: f = \"O\" # <<<<<<<<<<<<<<\n * else:\n * raise ValueError(u\"unknown dtype code in numpy.pxd (%d)\" % t)\n */\n __pyx_t_2 = (__pyx_v_t == NPY_OBJECT);\n if (__pyx_t_2) {\n __pyx_v_f = __pyx_k__O;\n goto __pyx_L14;\n }\n /*else*/ {\n\n /* \"numpy.pxd\":267\n * elif t == NPY_OBJECT: f = \"O\"\n * else:\n * raise ValueError(u\"unknown dtype code in numpy.pxd (%d)\" % t) # <<<<<<<<<<<<<<\n * info.format = f\n * return\n */\n __pyx_t_1 = PyInt_FromLong(__pyx_v_t); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 267; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n __pyx_t_8 = PyNumber_Remainder(((PyObject *)__pyx_kp_u_11), __pyx_t_1); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 267; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(((PyObject *)__pyx_t_8));\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n __pyx_t_1 = PyTuple_New(1); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 267; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(((PyObject *)__pyx_t_1));\n PyTuple_SET_ITEM(__pyx_t_1, 0, ((PyObject *)__pyx_t_8));\n __Pyx_GIVEREF(((PyObject *)__pyx_t_8));\n __pyx_t_8 = 0;\n __pyx_t_8 = PyObject_Call(__pyx_builtin_ValueError, ((PyObject *)__pyx_t_1), NULL); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 267; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_8);\n __Pyx_DECREF(((PyObject *)__pyx_t_1)); __pyx_t_1 = 0;\n __Pyx_Raise(__pyx_t_8, 0, 0);\n __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;\n {__pyx_filename = __pyx_f[1]; __pyx_lineno = 267; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n }\n __pyx_L14:;\n\n /* \"numpy.pxd\":268\n * else:\n * raise ValueError(u\"unknown dtype code in numpy.pxd (%d)\" % t)\n * info.format = f # <<<<<<<<<<<<<<\n * return\n * else:\n */\n __pyx_v_info->format = __pyx_v_f;\n\n /* \"numpy.pxd\":269\n * raise ValueError(u\"unknown dtype code in numpy.pxd (%d)\" % t)\n * info.format = f\n * return # <<<<<<<<<<<<<<\n * else:\n * info.format = stdlib.malloc(_buffer_format_string_len)\n */\n __pyx_r = 0;\n goto __pyx_L0;\n goto __pyx_L12;\n }\n /*else*/ {\n\n /* \"numpy.pxd\":271\n * return\n * else:\n * info.format = stdlib.malloc(_buffer_format_string_len) # <<<<<<<<<<<<<<\n * info.format[0] = '^' # Native data types, manual alignment\n * offset = 0\n */\n __pyx_v_info->format = ((char *)malloc(255));\n\n /* \"numpy.pxd\":272\n * else:\n * info.format = stdlib.malloc(_buffer_format_string_len)\n * info.format[0] = '^' # Native data types, manual alignment # <<<<<<<<<<<<<<\n * offset = 0\n * f = _util_dtypestring(descr, info.format + 1,\n */\n (__pyx_v_info->format[0]) = '^';\n\n /* \"numpy.pxd\":273\n * info.format = stdlib.malloc(_buffer_format_string_len)\n * info.format[0] = '^' # Native data types, manual alignment\n * offset = 0 # <<<<<<<<<<<<<<\n * f = _util_dtypestring(descr, info.format + 1,\n * info.format + _buffer_format_string_len,\n */\n __pyx_v_offset = 0;\n\n /* \"numpy.pxd\":276\n * f = _util_dtypestring(descr, info.format + 1,\n * info.format + _buffer_format_string_len,\n * &offset) # <<<<<<<<<<<<<<\n * f[0] = 0 # Terminate format string\n * \n */\n __pyx_t_9 = __pyx_f_5numpy__util_dtypestring(__pyx_v_descr, (__pyx_v_info->format + 1), (__pyx_v_info->format + 255), (&__pyx_v_offset)); if (unlikely(__pyx_t_9 == NULL)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 274; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_v_f = __pyx_t_9;\n\n /* \"numpy.pxd\":277\n * info.format + _buffer_format_string_len,\n * &offset)\n * f[0] = 0 # Terminate format string # <<<<<<<<<<<<<<\n * \n * def __releasebuffer__(ndarray self, Py_buffer* info):\n */\n (__pyx_v_f[0]) = 0;\n }\n __pyx_L12:;\n\n __pyx_r = 0;\n goto __pyx_L0;\n __pyx_L1_error:;\n __Pyx_XDECREF(__pyx_t_1);\n __Pyx_XDECREF(__pyx_t_8);\n __Pyx_AddTraceback(\"numpy.ndarray.__getbuffer__\");\n __pyx_r = -1;\n __Pyx_GOTREF(__pyx_v_info->obj);\n __Pyx_DECREF(__pyx_v_info->obj); __pyx_v_info->obj = NULL;\n goto __pyx_L2;\n __pyx_L0:;\n if (__pyx_v_info->obj == Py_None) {\n __Pyx_GOTREF(Py_None);\n __Pyx_DECREF(Py_None); __pyx_v_info->obj = NULL;\n }\n __pyx_L2:;\n __Pyx_XDECREF((PyObject *)__pyx_v_descr);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"numpy.pxd\":279\n * f[0] = 0 # Terminate format string\n * \n * def __releasebuffer__(ndarray self, Py_buffer* info): # <<<<<<<<<<<<<<\n * if PyArray_HASFIELDS(self):\n * stdlib.free(info.format)\n */\n\nstatic CYTHON_UNUSED void __pyx_pf_5numpy_7ndarray_1__releasebuffer__(PyObject *__pyx_v_self, Py_buffer *__pyx_v_info); /*proto*/\nstatic CYTHON_UNUSED void __pyx_pf_5numpy_7ndarray_1__releasebuffer__(PyObject *__pyx_v_self, Py_buffer *__pyx_v_info) {\n PyObject *__pyx_t_1 = NULL;\n int __pyx_t_2;\n __Pyx_RefNannySetupContext(\"__releasebuffer__\");\n\n /* \"numpy.pxd\":280\n * \n * def __releasebuffer__(ndarray self, Py_buffer* info):\n * if PyArray_HASFIELDS(self): # <<<<<<<<<<<<<<\n * stdlib.free(info.format)\n * if sizeof(npy_intp) != sizeof(Py_ssize_t):\n */\n __pyx_t_1 = __pyx_v_self;\n __Pyx_INCREF(__pyx_t_1);\n __pyx_t_2 = PyArray_HASFIELDS(((PyArrayObject *)__pyx_t_1));\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n if (__pyx_t_2) {\n\n /* \"numpy.pxd\":281\n * def __releasebuffer__(ndarray self, Py_buffer* info):\n * if PyArray_HASFIELDS(self):\n * stdlib.free(info.format) # <<<<<<<<<<<<<<\n * if sizeof(npy_intp) != sizeof(Py_ssize_t):\n * stdlib.free(info.strides)\n */\n free(__pyx_v_info->format);\n goto __pyx_L5;\n }\n __pyx_L5:;\n\n /* \"numpy.pxd\":282\n * if PyArray_HASFIELDS(self):\n * stdlib.free(info.format)\n * if sizeof(npy_intp) != sizeof(Py_ssize_t): # <<<<<<<<<<<<<<\n * stdlib.free(info.strides)\n * # info.shape was stored after info.strides in the same block\n */\n __pyx_t_2 = ((sizeof(npy_intp)) != (sizeof(Py_ssize_t)));\n if (__pyx_t_2) {\n\n /* \"numpy.pxd\":283\n * stdlib.free(info.format)\n * if sizeof(npy_intp) != sizeof(Py_ssize_t):\n * stdlib.free(info.strides) # <<<<<<<<<<<<<<\n * # info.shape was stored after info.strides in the same block\n * \n */\n free(__pyx_v_info->strides);\n goto __pyx_L6;\n }\n __pyx_L6:;\n\n __Pyx_RefNannyFinishContext();\n}\n\n/* \"numpy.pxd\":756\n * ctypedef npy_cdouble complex_t\n * \n * cdef inline object PyArray_MultiIterNew1(a): # <<<<<<<<<<<<<<\n * return PyArray_MultiIterNew(1, a)\n * \n */\n\nstatic CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew1(PyObject *__pyx_v_a) {\n PyObject *__pyx_r = NULL;\n PyObject *__pyx_t_1 = NULL;\n __Pyx_RefNannySetupContext(\"PyArray_MultiIterNew1\");\n\n /* \"numpy.pxd\":757\n * \n * cdef inline object PyArray_MultiIterNew1(a):\n * return PyArray_MultiIterNew(1, a) # <<<<<<<<<<<<<<\n * \n * cdef inline object PyArray_MultiIterNew2(a, b):\n */\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyArray_MultiIterNew(1, ((void *)__pyx_v_a)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 757; __pyx_clineno = __LINE__; goto __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 __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(\"numpy.PyArray_MultiIterNew1\");\n __pyx_r = 0;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"numpy.pxd\":759\n * return PyArray_MultiIterNew(1, a)\n * \n * cdef inline object PyArray_MultiIterNew2(a, b): # <<<<<<<<<<<<<<\n * return PyArray_MultiIterNew(2, a, b)\n * \n */\n\nstatic CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew2(PyObject *__pyx_v_a, PyObject *__pyx_v_b) {\n PyObject *__pyx_r = NULL;\n PyObject *__pyx_t_1 = NULL;\n __Pyx_RefNannySetupContext(\"PyArray_MultiIterNew2\");\n\n /* \"numpy.pxd\":760\n * \n * cdef inline object PyArray_MultiIterNew2(a, b):\n * return PyArray_MultiIterNew(2, a, b) # <<<<<<<<<<<<<<\n * \n * cdef inline object PyArray_MultiIterNew3(a, b, c):\n */\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyArray_MultiIterNew(2, ((void *)__pyx_v_a), ((void *)__pyx_v_b)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 760; __pyx_clineno = __LINE__; goto __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 __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(\"numpy.PyArray_MultiIterNew2\");\n __pyx_r = 0;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"numpy.pxd\":762\n * return PyArray_MultiIterNew(2, a, b)\n * \n * cdef inline object PyArray_MultiIterNew3(a, b, c): # <<<<<<<<<<<<<<\n * return PyArray_MultiIterNew(3, a, b, c)\n * \n */\n\nstatic CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew3(PyObject *__pyx_v_a, PyObject *__pyx_v_b, PyObject *__pyx_v_c) {\n PyObject *__pyx_r = NULL;\n PyObject *__pyx_t_1 = NULL;\n __Pyx_RefNannySetupContext(\"PyArray_MultiIterNew3\");\n\n /* \"numpy.pxd\":763\n * \n * cdef inline object PyArray_MultiIterNew3(a, b, c):\n * return PyArray_MultiIterNew(3, a, b, c) # <<<<<<<<<<<<<<\n * \n * cdef inline object PyArray_MultiIterNew4(a, b, c, d):\n */\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyArray_MultiIterNew(3, ((void *)__pyx_v_a), ((void *)__pyx_v_b), ((void *)__pyx_v_c)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 763; __pyx_clineno = __LINE__; goto __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 __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(\"numpy.PyArray_MultiIterNew3\");\n __pyx_r = 0;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"numpy.pxd\":765\n * return PyArray_MultiIterNew(3, a, b, c)\n * \n * cdef inline object PyArray_MultiIterNew4(a, b, c, d): # <<<<<<<<<<<<<<\n * return PyArray_MultiIterNew(4, a, b, c, d)\n * \n */\n\nstatic CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew4(PyObject *__pyx_v_a, PyObject *__pyx_v_b, PyObject *__pyx_v_c, PyObject *__pyx_v_d) {\n PyObject *__pyx_r = NULL;\n PyObject *__pyx_t_1 = NULL;\n __Pyx_RefNannySetupContext(\"PyArray_MultiIterNew4\");\n\n /* \"numpy.pxd\":766\n * \n * cdef inline object PyArray_MultiIterNew4(a, b, c, d):\n * return PyArray_MultiIterNew(4, a, b, c, d) # <<<<<<<<<<<<<<\n * \n * cdef inline object PyArray_MultiIterNew5(a, b, c, d, e):\n */\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyArray_MultiIterNew(4, ((void *)__pyx_v_a), ((void *)__pyx_v_b), ((void *)__pyx_v_c), ((void *)__pyx_v_d)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 766; __pyx_clineno = __LINE__; goto __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 __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(\"numpy.PyArray_MultiIterNew4\");\n __pyx_r = 0;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"numpy.pxd\":768\n * return PyArray_MultiIterNew(4, a, b, c, d)\n * \n * cdef inline object PyArray_MultiIterNew5(a, b, c, d, e): # <<<<<<<<<<<<<<\n * return PyArray_MultiIterNew(5, a, b, c, d, e)\n * \n */\n\nstatic CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew5(PyObject *__pyx_v_a, PyObject *__pyx_v_b, PyObject *__pyx_v_c, PyObject *__pyx_v_d, PyObject *__pyx_v_e) {\n PyObject *__pyx_r = NULL;\n PyObject *__pyx_t_1 = NULL;\n __Pyx_RefNannySetupContext(\"PyArray_MultiIterNew5\");\n\n /* \"numpy.pxd\":769\n * \n * cdef inline object PyArray_MultiIterNew5(a, b, c, d, e):\n * return PyArray_MultiIterNew(5, a, b, c, d, e) # <<<<<<<<<<<<<<\n * \n * cdef inline char* _util_dtypestring(dtype descr, char* f, char* end, int* offset) except NULL:\n */\n __Pyx_XDECREF(__pyx_r);\n __pyx_t_1 = PyArray_MultiIterNew(5, ((void *)__pyx_v_a), ((void *)__pyx_v_b), ((void *)__pyx_v_c), ((void *)__pyx_v_d), ((void *)__pyx_v_e)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 769; __pyx_clineno = __LINE__; goto __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 __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(\"numpy.PyArray_MultiIterNew5\");\n __pyx_r = 0;\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"numpy.pxd\":771\n * return PyArray_MultiIterNew(5, a, b, c, d, e)\n * \n * cdef inline char* _util_dtypestring(dtype descr, char* f, char* end, int* offset) except NULL: # <<<<<<<<<<<<<<\n * # Recursive utility function used in __getbuffer__ to get format\n * # string. The new location in the format string is returned.\n */\n\nstatic CYTHON_INLINE char *__pyx_f_5numpy__util_dtypestring(PyArray_Descr *__pyx_v_descr, char *__pyx_v_f, char *__pyx_v_end, int *__pyx_v_offset) {\n PyArray_Descr *__pyx_v_child;\n int __pyx_v_endian_detector;\n int __pyx_v_little_endian;\n PyObject *__pyx_v_fields;\n PyObject *__pyx_v_childname;\n PyObject *__pyx_v_new_offset;\n PyObject *__pyx_v_t;\n char *__pyx_r;\n Py_ssize_t __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 int __pyx_t_6;\n int __pyx_t_7;\n int __pyx_t_8;\n int __pyx_t_9;\n long __pyx_t_10;\n char *__pyx_t_11;\n __Pyx_RefNannySetupContext(\"_util_dtypestring\");\n __pyx_v_child = ((PyArray_Descr *)Py_None); __Pyx_INCREF(Py_None);\n __pyx_v_fields = ((PyObject*)Py_None); __Pyx_INCREF(Py_None);\n __pyx_v_childname = Py_None; __Pyx_INCREF(Py_None);\n __pyx_v_new_offset = Py_None; __Pyx_INCREF(Py_None);\n __pyx_v_t = Py_None; __Pyx_INCREF(Py_None);\n\n /* \"numpy.pxd\":778\n * cdef int delta_offset\n * cdef tuple i\n * cdef int endian_detector = 1 # <<<<<<<<<<<<<<\n * cdef bint little_endian = ((&endian_detector)[0] != 0)\n * cdef tuple fields\n */\n __pyx_v_endian_detector = 1;\n\n /* \"numpy.pxd\":779\n * cdef tuple i\n * cdef int endian_detector = 1\n * cdef bint little_endian = ((&endian_detector)[0] != 0) # <<<<<<<<<<<<<<\n * cdef tuple fields\n * \n */\n __pyx_v_little_endian = ((((char *)(&__pyx_v_endian_detector))[0]) != 0);\n\n /* \"numpy.pxd\":782\n * cdef tuple fields\n * \n * for childname in descr.names: # <<<<<<<<<<<<<<\n * fields = descr.fields[childname]\n * child, new_offset = fields\n */\n if (unlikely(__pyx_v_descr->names == Py_None)) {\n PyErr_SetString(PyExc_TypeError, \"'NoneType' object is not iterable\"); {__pyx_filename = __pyx_f[1]; __pyx_lineno = 782; __pyx_clineno = __LINE__; goto __pyx_L1_error;} \n }\n __pyx_t_1 = 0; __pyx_t_2 = ((PyObject *)__pyx_v_descr->names); __Pyx_INCREF(__pyx_t_2);\n for (;;) {\n if (__pyx_t_1 >= PyTuple_GET_SIZE(__pyx_t_2)) break;\n __pyx_t_3 = PyTuple_GET_ITEM(__pyx_t_2, __pyx_t_1); __Pyx_INCREF(__pyx_t_3); __pyx_t_1++;\n __Pyx_DECREF(__pyx_v_childname);\n __pyx_v_childname = __pyx_t_3;\n __pyx_t_3 = 0;\n\n /* \"numpy.pxd\":783\n * \n * for childname in descr.names:\n * fields = descr.fields[childname] # <<<<<<<<<<<<<<\n * child, new_offset = fields\n * \n */\n __pyx_t_3 = PyObject_GetItem(__pyx_v_descr->fields, __pyx_v_childname); if (!__pyx_t_3) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 783; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n if (!(likely(PyTuple_CheckExact(__pyx_t_3))||((__pyx_t_3) == Py_None)||(PyErr_Format(PyExc_TypeError, \"Expected tuple, got %.200s\", Py_TYPE(__pyx_t_3)->tp_name), 0))) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 783; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(((PyObject *)__pyx_v_fields));\n __pyx_v_fields = ((PyObject*)__pyx_t_3);\n __pyx_t_3 = 0;\n\n /* \"numpy.pxd\":784\n * for childname in descr.names:\n * fields = descr.fields[childname]\n * child, new_offset = fields # <<<<<<<<<<<<<<\n * \n * if (end - f) - (new_offset - offset[0]) < 15:\n */\n if (likely(((PyObject *)__pyx_v_fields) != Py_None) && likely(PyTuple_GET_SIZE(((PyObject *)__pyx_v_fields)) == 2)) {\n PyObject* tuple = ((PyObject *)__pyx_v_fields);\n __pyx_t_3 = PyTuple_GET_ITEM(tuple, 0); __Pyx_INCREF(__pyx_t_3);\n if (!(likely(((__pyx_t_3) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_3, __pyx_ptype_5numpy_dtype))))) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 784; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_t_4 = PyTuple_GET_ITEM(tuple, 1); __Pyx_INCREF(__pyx_t_4);\n __Pyx_DECREF(((PyObject *)__pyx_v_child));\n __pyx_v_child = ((PyArray_Descr *)__pyx_t_3);\n __pyx_t_3 = 0;\n __Pyx_DECREF(__pyx_v_new_offset);\n __pyx_v_new_offset = __pyx_t_4;\n __pyx_t_4 = 0;\n } else {\n __Pyx_UnpackTupleError(((PyObject *)__pyx_v_fields), 2);\n {__pyx_filename = __pyx_f[1]; __pyx_lineno = 784; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n }\n\n /* \"numpy.pxd\":786\n * child, new_offset = fields\n * \n * if (end - f) - (new_offset - offset[0]) < 15: # <<<<<<<<<<<<<<\n * raise RuntimeError(u\"Format string allocated too short, see comment in numpy.pxd\")\n * \n */\n __pyx_t_4 = PyInt_FromLong((__pyx_v_end - __pyx_v_f)); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 786; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_4);\n __pyx_t_3 = PyInt_FromLong((__pyx_v_offset[0])); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 786; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_5 = PyNumber_Subtract(__pyx_v_new_offset, __pyx_t_3); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 786; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_3 = PyNumber_Subtract(__pyx_t_4, __pyx_t_5); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 786; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n __pyx_t_5 = PyObject_RichCompare(__pyx_t_3, __pyx_int_15, Py_LT); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 786; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 786; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n if (__pyx_t_6) {\n\n /* \"numpy.pxd\":787\n * \n * if (end - f) - (new_offset - offset[0]) < 15:\n * raise RuntimeError(u\"Format string allocated too short, see comment in numpy.pxd\") # <<<<<<<<<<<<<<\n * \n * if ((child.byteorder == '>' and little_endian) or\n */\n __pyx_t_5 = PyObject_Call(__pyx_builtin_RuntimeError, ((PyObject *)__pyx_k_tuple_13), NULL); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 787; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __Pyx_Raise(__pyx_t_5, 0, 0);\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n {__pyx_filename = __pyx_f[1]; __pyx_lineno = 787; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n goto __pyx_L5;\n }\n __pyx_L5:;\n\n /* \"numpy.pxd\":789\n * raise RuntimeError(u\"Format string allocated too short, see comment in numpy.pxd\")\n * \n * if ((child.byteorder == '>' and little_endian) or # <<<<<<<<<<<<<<\n * (child.byteorder == '<' and not little_endian)):\n * raise ValueError(u\"Non-native byte order not supported\")\n */\n __pyx_t_6 = (__pyx_v_child->byteorder == '>');\n if (__pyx_t_6) {\n __pyx_t_7 = __pyx_v_little_endian;\n } else {\n __pyx_t_7 = __pyx_t_6;\n }\n if (!__pyx_t_7) {\n\n /* \"numpy.pxd\":790\n * \n * if ((child.byteorder == '>' and little_endian) or\n * (child.byteorder == '<' and not little_endian)): # <<<<<<<<<<<<<<\n * raise ValueError(u\"Non-native byte order not supported\")\n * # One could encode it in the format string and have Cython\n */\n __pyx_t_6 = (__pyx_v_child->byteorder == '<');\n if (__pyx_t_6) {\n __pyx_t_8 = (!__pyx_v_little_endian);\n __pyx_t_9 = __pyx_t_8;\n } else {\n __pyx_t_9 = __pyx_t_6;\n }\n __pyx_t_6 = __pyx_t_9;\n } else {\n __pyx_t_6 = __pyx_t_7;\n }\n if (__pyx_t_6) {\n\n /* \"numpy.pxd\":791\n * if ((child.byteorder == '>' and little_endian) or\n * (child.byteorder == '<' and not little_endian)):\n * raise ValueError(u\"Non-native byte order not supported\") # <<<<<<<<<<<<<<\n * # One could encode it in the format string and have Cython\n * # complain instead, BUT: < and > in format strings also imply\n */\n __pyx_t_5 = PyObject_Call(__pyx_builtin_ValueError, ((PyObject *)__pyx_k_tuple_14), NULL); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 791; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __Pyx_Raise(__pyx_t_5, 0, 0);\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n {__pyx_filename = __pyx_f[1]; __pyx_lineno = 791; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n goto __pyx_L6;\n }\n __pyx_L6:;\n\n /* \"numpy.pxd\":801\n * \n * # Output padding bytes\n * while offset[0] < new_offset: # <<<<<<<<<<<<<<\n * f[0] = 120 # \"x\"; pad byte\n * f += 1\n */\n while (1) {\n __pyx_t_5 = PyInt_FromLong((__pyx_v_offset[0])); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 801; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __pyx_t_3 = PyObject_RichCompare(__pyx_t_5, __pyx_v_new_offset, Py_LT); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 801; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 801; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n if (!__pyx_t_6) break;\n\n /* \"numpy.pxd\":802\n * # Output padding bytes\n * while offset[0] < new_offset:\n * f[0] = 120 # \"x\"; pad byte # <<<<<<<<<<<<<<\n * f += 1\n * offset[0] += 1\n */\n (__pyx_v_f[0]) = 120;\n\n /* \"numpy.pxd\":803\n * while offset[0] < new_offset:\n * f[0] = 120 # \"x\"; pad byte\n * f += 1 # <<<<<<<<<<<<<<\n * offset[0] += 1\n * \n */\n __pyx_v_f = (__pyx_v_f + 1);\n\n /* \"numpy.pxd\":804\n * f[0] = 120 # \"x\"; pad byte\n * f += 1\n * offset[0] += 1 # <<<<<<<<<<<<<<\n * \n * offset[0] += child.itemsize\n */\n __pyx_t_10 = 0;\n (__pyx_v_offset[__pyx_t_10]) = ((__pyx_v_offset[__pyx_t_10]) + 1);\n }\n\n /* \"numpy.pxd\":806\n * offset[0] += 1\n * \n * offset[0] += child.itemsize # <<<<<<<<<<<<<<\n * \n * if not PyDataType_HASFIELDS(child):\n */\n __pyx_t_10 = 0;\n (__pyx_v_offset[__pyx_t_10]) = ((__pyx_v_offset[__pyx_t_10]) + __pyx_v_child->elsize);\n\n /* \"numpy.pxd\":808\n * offset[0] += child.itemsize\n * \n * if not PyDataType_HASFIELDS(child): # <<<<<<<<<<<<<<\n * t = child.type_num\n * if end - f < 5:\n */\n __pyx_t_6 = (!PyDataType_HASFIELDS(__pyx_v_child));\n if (__pyx_t_6) {\n\n /* \"numpy.pxd\":809\n * \n * if not PyDataType_HASFIELDS(child):\n * t = child.type_num # <<<<<<<<<<<<<<\n * if end - f < 5:\n * raise RuntimeError(u\"Format string allocated too short.\")\n */\n __pyx_t_3 = PyInt_FromLong(__pyx_v_child->type_num); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 809; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(__pyx_v_t);\n __pyx_v_t = __pyx_t_3;\n __pyx_t_3 = 0;\n\n /* \"numpy.pxd\":810\n * if not PyDataType_HASFIELDS(child):\n * t = child.type_num\n * if end - f < 5: # <<<<<<<<<<<<<<\n * raise RuntimeError(u\"Format string allocated too short.\")\n * \n */\n __pyx_t_6 = ((__pyx_v_end - __pyx_v_f) < 5);\n if (__pyx_t_6) {\n\n /* \"numpy.pxd\":811\n * t = child.type_num\n * if end - f < 5:\n * raise RuntimeError(u\"Format string allocated too short.\") # <<<<<<<<<<<<<<\n * \n * # Until ticket #99 is fixed, use integers to avoid warnings\n */\n __pyx_t_3 = PyObject_Call(__pyx_builtin_RuntimeError, ((PyObject *)__pyx_k_tuple_16), NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 811; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_Raise(__pyx_t_3, 0, 0);\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n {__pyx_filename = __pyx_f[1]; __pyx_lineno = 811; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n goto __pyx_L10;\n }\n __pyx_L10:;\n\n /* \"numpy.pxd\":814\n * \n * # Until ticket #99 is fixed, use integers to avoid warnings\n * if t == NPY_BYTE: f[0] = 98 #\"b\" # <<<<<<<<<<<<<<\n * elif t == NPY_UBYTE: f[0] = 66 #\"B\"\n * elif t == NPY_SHORT: f[0] = 104 #\"h\"\n */\n __pyx_t_3 = PyInt_FromLong(NPY_BYTE); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 814; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_5 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 814; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 814; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n if (__pyx_t_6) {\n (__pyx_v_f[0]) = 98;\n goto __pyx_L11;\n }\n\n /* \"numpy.pxd\":815\n * # Until ticket #99 is fixed, use integers to avoid warnings\n * if t == NPY_BYTE: f[0] = 98 #\"b\"\n * elif t == NPY_UBYTE: f[0] = 66 #\"B\" # <<<<<<<<<<<<<<\n * elif t == NPY_SHORT: f[0] = 104 #\"h\"\n * elif t == NPY_USHORT: f[0] = 72 #\"H\"\n */\n __pyx_t_5 = PyInt_FromLong(NPY_UBYTE); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 815; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_5, Py_EQ); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 815; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 815; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n if (__pyx_t_6) {\n (__pyx_v_f[0]) = 66;\n goto __pyx_L11;\n }\n\n /* \"numpy.pxd\":816\n * if t == NPY_BYTE: f[0] = 98 #\"b\"\n * elif t == NPY_UBYTE: f[0] = 66 #\"B\"\n * elif t == NPY_SHORT: f[0] = 104 #\"h\" # <<<<<<<<<<<<<<\n * elif t == NPY_USHORT: f[0] = 72 #\"H\"\n * elif t == NPY_INT: f[0] = 105 #\"i\"\n */\n __pyx_t_3 = PyInt_FromLong(NPY_SHORT); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 816; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_5 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 816; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 816; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n if (__pyx_t_6) {\n (__pyx_v_f[0]) = 104;\n goto __pyx_L11;\n }\n\n /* \"numpy.pxd\":817\n * elif t == NPY_UBYTE: f[0] = 66 #\"B\"\n * elif t == NPY_SHORT: f[0] = 104 #\"h\"\n * elif t == NPY_USHORT: f[0] = 72 #\"H\" # <<<<<<<<<<<<<<\n * elif t == NPY_INT: f[0] = 105 #\"i\"\n * elif t == NPY_UINT: f[0] = 73 #\"I\"\n */\n __pyx_t_5 = PyInt_FromLong(NPY_USHORT); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 817; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_5, Py_EQ); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 817; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 817; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n if (__pyx_t_6) {\n (__pyx_v_f[0]) = 72;\n goto __pyx_L11;\n }\n\n /* \"numpy.pxd\":818\n * elif t == NPY_SHORT: f[0] = 104 #\"h\"\n * elif t == NPY_USHORT: f[0] = 72 #\"H\"\n * elif t == NPY_INT: f[0] = 105 #\"i\" # <<<<<<<<<<<<<<\n * elif t == NPY_UINT: f[0] = 73 #\"I\"\n * elif t == NPY_LONG: f[0] = 108 #\"l\"\n */\n __pyx_t_3 = PyInt_FromLong(NPY_INT); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 818; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_5 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 818; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 818; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n if (__pyx_t_6) {\n (__pyx_v_f[0]) = 105;\n goto __pyx_L11;\n }\n\n /* \"numpy.pxd\":819\n * elif t == NPY_USHORT: f[0] = 72 #\"H\"\n * elif t == NPY_INT: f[0] = 105 #\"i\"\n * elif t == NPY_UINT: f[0] = 73 #\"I\" # <<<<<<<<<<<<<<\n * elif t == NPY_LONG: f[0] = 108 #\"l\"\n * elif t == NPY_ULONG: f[0] = 76 #\"L\"\n */\n __pyx_t_5 = PyInt_FromLong(NPY_UINT); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 819; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_5, Py_EQ); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 819; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 819; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n if (__pyx_t_6) {\n (__pyx_v_f[0]) = 73;\n goto __pyx_L11;\n }\n\n /* \"numpy.pxd\":820\n * elif t == NPY_INT: f[0] = 105 #\"i\"\n * elif t == NPY_UINT: f[0] = 73 #\"I\"\n * elif t == NPY_LONG: f[0] = 108 #\"l\" # <<<<<<<<<<<<<<\n * elif t == NPY_ULONG: f[0] = 76 #\"L\"\n * elif t == NPY_LONGLONG: f[0] = 113 #\"q\"\n */\n __pyx_t_3 = PyInt_FromLong(NPY_LONG); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 820; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_5 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 820; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 820; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n if (__pyx_t_6) {\n (__pyx_v_f[0]) = 108;\n goto __pyx_L11;\n }\n\n /* \"numpy.pxd\":821\n * elif t == NPY_UINT: f[0] = 73 #\"I\"\n * elif t == NPY_LONG: f[0] = 108 #\"l\"\n * elif t == NPY_ULONG: f[0] = 76 #\"L\" # <<<<<<<<<<<<<<\n * elif t == NPY_LONGLONG: f[0] = 113 #\"q\"\n * elif t == NPY_ULONGLONG: f[0] = 81 #\"Q\"\n */\n __pyx_t_5 = PyInt_FromLong(NPY_ULONG); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 821; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_5, Py_EQ); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 821; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 821; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n if (__pyx_t_6) {\n (__pyx_v_f[0]) = 76;\n goto __pyx_L11;\n }\n\n /* \"numpy.pxd\":822\n * elif t == NPY_LONG: f[0] = 108 #\"l\"\n * elif t == NPY_ULONG: f[0] = 76 #\"L\"\n * elif t == NPY_LONGLONG: f[0] = 113 #\"q\" # <<<<<<<<<<<<<<\n * elif t == NPY_ULONGLONG: f[0] = 81 #\"Q\"\n * elif t == NPY_FLOAT: f[0] = 102 #\"f\"\n */\n __pyx_t_3 = PyInt_FromLong(NPY_LONGLONG); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 822; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_5 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 822; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 822; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n if (__pyx_t_6) {\n (__pyx_v_f[0]) = 113;\n goto __pyx_L11;\n }\n\n /* \"numpy.pxd\":823\n * elif t == NPY_ULONG: f[0] = 76 #\"L\"\n * elif t == NPY_LONGLONG: f[0] = 113 #\"q\"\n * elif t == NPY_ULONGLONG: f[0] = 81 #\"Q\" # <<<<<<<<<<<<<<\n * elif t == NPY_FLOAT: f[0] = 102 #\"f\"\n * elif t == NPY_DOUBLE: f[0] = 100 #\"d\"\n */\n __pyx_t_5 = PyInt_FromLong(NPY_ULONGLONG); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 823; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_5, Py_EQ); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 823; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 823; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n if (__pyx_t_6) {\n (__pyx_v_f[0]) = 81;\n goto __pyx_L11;\n }\n\n /* \"numpy.pxd\":824\n * elif t == NPY_LONGLONG: f[0] = 113 #\"q\"\n * elif t == NPY_ULONGLONG: f[0] = 81 #\"Q\"\n * elif t == NPY_FLOAT: f[0] = 102 #\"f\" # <<<<<<<<<<<<<<\n * elif t == NPY_DOUBLE: f[0] = 100 #\"d\"\n * elif t == NPY_LONGDOUBLE: f[0] = 103 #\"g\"\n */\n __pyx_t_3 = PyInt_FromLong(NPY_FLOAT); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 824; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_5 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 824; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 824; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n if (__pyx_t_6) {\n (__pyx_v_f[0]) = 102;\n goto __pyx_L11;\n }\n\n /* \"numpy.pxd\":825\n * elif t == NPY_ULONGLONG: f[0] = 81 #\"Q\"\n * elif t == NPY_FLOAT: f[0] = 102 #\"f\"\n * elif t == NPY_DOUBLE: f[0] = 100 #\"d\" # <<<<<<<<<<<<<<\n * elif t == NPY_LONGDOUBLE: f[0] = 103 #\"g\"\n * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf\n */\n __pyx_t_5 = PyInt_FromLong(NPY_DOUBLE); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 825; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_5, Py_EQ); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 825; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 825; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n if (__pyx_t_6) {\n (__pyx_v_f[0]) = 100;\n goto __pyx_L11;\n }\n\n /* \"numpy.pxd\":826\n * elif t == NPY_FLOAT: f[0] = 102 #\"f\"\n * elif t == NPY_DOUBLE: f[0] = 100 #\"d\"\n * elif t == NPY_LONGDOUBLE: f[0] = 103 #\"g\" # <<<<<<<<<<<<<<\n * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf\n * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd\n */\n __pyx_t_3 = PyInt_FromLong(NPY_LONGDOUBLE); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 826; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_5 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 826; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 826; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n if (__pyx_t_6) {\n (__pyx_v_f[0]) = 103;\n goto __pyx_L11;\n }\n\n /* \"numpy.pxd\":827\n * elif t == NPY_DOUBLE: f[0] = 100 #\"d\"\n * elif t == NPY_LONGDOUBLE: f[0] = 103 #\"g\"\n * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf # <<<<<<<<<<<<<<\n * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd\n * elif t == NPY_CLONGDOUBLE: f[0] = 90; f[1] = 103; f += 1 # Zg\n */\n __pyx_t_5 = PyInt_FromLong(NPY_CFLOAT); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 827; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_5, Py_EQ); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 827; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 827; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n if (__pyx_t_6) {\n (__pyx_v_f[0]) = 90;\n (__pyx_v_f[1]) = 102;\n __pyx_v_f = (__pyx_v_f + 1);\n goto __pyx_L11;\n }\n\n /* \"numpy.pxd\":828\n * elif t == NPY_LONGDOUBLE: f[0] = 103 #\"g\"\n * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf\n * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd # <<<<<<<<<<<<<<\n * elif t == NPY_CLONGDOUBLE: f[0] = 90; f[1] = 103; f += 1 # Zg\n * elif t == NPY_OBJECT: f[0] = 79 #\"O\"\n */\n __pyx_t_3 = PyInt_FromLong(NPY_CDOUBLE); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 828; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_5 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 828; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 828; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n if (__pyx_t_6) {\n (__pyx_v_f[0]) = 90;\n (__pyx_v_f[1]) = 100;\n __pyx_v_f = (__pyx_v_f + 1);\n goto __pyx_L11;\n }\n\n /* \"numpy.pxd\":829\n * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf\n * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd\n * elif t == NPY_CLONGDOUBLE: f[0] = 90; f[1] = 103; f += 1 # Zg # <<<<<<<<<<<<<<\n * elif t == NPY_OBJECT: f[0] = 79 #\"O\"\n * else:\n */\n __pyx_t_5 = PyInt_FromLong(NPY_CLONGDOUBLE); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 829; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_5, Py_EQ); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 829; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 829; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n if (__pyx_t_6) {\n (__pyx_v_f[0]) = 90;\n (__pyx_v_f[1]) = 103;\n __pyx_v_f = (__pyx_v_f + 1);\n goto __pyx_L11;\n }\n\n /* \"numpy.pxd\":830\n * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd\n * elif t == NPY_CLONGDOUBLE: f[0] = 90; f[1] = 103; f += 1 # Zg\n * elif t == NPY_OBJECT: f[0] = 79 #\"O\" # <<<<<<<<<<<<<<\n * else:\n * raise ValueError(u\"unknown dtype code in numpy.pxd (%d)\" % t)\n */\n __pyx_t_3 = PyInt_FromLong(NPY_OBJECT); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 830; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_3);\n __pyx_t_5 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 830; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;\n __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 830; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n if (__pyx_t_6) {\n (__pyx_v_f[0]) = 79;\n goto __pyx_L11;\n }\n /*else*/ {\n\n /* \"numpy.pxd\":832\n * elif t == NPY_OBJECT: f[0] = 79 #\"O\"\n * else:\n * raise ValueError(u\"unknown dtype code in numpy.pxd (%d)\" % t) # <<<<<<<<<<<<<<\n * f += 1\n * else:\n */\n __pyx_t_5 = PyNumber_Remainder(((PyObject *)__pyx_kp_u_11), __pyx_v_t); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 832; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(((PyObject *)__pyx_t_5));\n __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 832; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(((PyObject *)__pyx_t_3));\n PyTuple_SET_ITEM(__pyx_t_3, 0, ((PyObject *)__pyx_t_5));\n __Pyx_GIVEREF(((PyObject *)__pyx_t_5));\n __pyx_t_5 = 0;\n __pyx_t_5 = PyObject_Call(__pyx_builtin_ValueError, ((PyObject *)__pyx_t_3), NULL); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 832; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_5);\n __Pyx_DECREF(((PyObject *)__pyx_t_3)); __pyx_t_3 = 0;\n __Pyx_Raise(__pyx_t_5, 0, 0);\n __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;\n {__pyx_filename = __pyx_f[1]; __pyx_lineno = 832; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n }\n __pyx_L11:;\n\n /* \"numpy.pxd\":833\n * else:\n * raise ValueError(u\"unknown dtype code in numpy.pxd (%d)\" % t)\n * f += 1 # <<<<<<<<<<<<<<\n * else:\n * # Cython ignores struct boundary information (\"T{...}\"),\n */\n __pyx_v_f = (__pyx_v_f + 1);\n goto __pyx_L9;\n }\n /*else*/ {\n\n /* \"numpy.pxd\":837\n * # Cython ignores struct boundary information (\"T{...}\"),\n * # so don't output it\n * f = _util_dtypestring(child, f, end, offset) # <<<<<<<<<<<<<<\n * return f\n * \n */\n __pyx_t_11 = __pyx_f_5numpy__util_dtypestring(__pyx_v_child, __pyx_v_f, __pyx_v_end, __pyx_v_offset); if (unlikely(__pyx_t_11 == NULL)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 837; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_v_f = __pyx_t_11;\n }\n __pyx_L9:;\n }\n __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n\n /* \"numpy.pxd\":838\n * # so don't output it\n * f = _util_dtypestring(child, f, end, offset)\n * return f # <<<<<<<<<<<<<<\n * \n * \n */\n __pyx_r = __pyx_v_f;\n goto __pyx_L0;\n\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_XDECREF(__pyx_t_4);\n __Pyx_XDECREF(__pyx_t_5);\n __Pyx_AddTraceback(\"numpy._util_dtypestring\");\n __pyx_r = NULL;\n __pyx_L0:;\n __Pyx_DECREF((PyObject *)__pyx_v_child);\n __Pyx_DECREF(__pyx_v_fields);\n __Pyx_DECREF(__pyx_v_childname);\n __Pyx_DECREF(__pyx_v_new_offset);\n __Pyx_DECREF(__pyx_v_t);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\n/* \"numpy.pxd\":953\n * \n * \n * cdef inline void set_array_base(ndarray arr, object base): # <<<<<<<<<<<<<<\n * cdef PyObject* baseptr\n * if base is None:\n */\n\nstatic CYTHON_INLINE void __pyx_f_5numpy_set_array_base(PyArrayObject *__pyx_v_arr, PyObject *__pyx_v_base) {\n PyObject *__pyx_v_baseptr;\n int __pyx_t_1;\n PyObject *__pyx_t_2 = NULL;\n __Pyx_RefNannySetupContext(\"set_array_base\");\n\n /* \"numpy.pxd\":955\n * cdef inline void set_array_base(ndarray arr, object base):\n * cdef PyObject* baseptr\n * if base is None: # <<<<<<<<<<<<<<\n * baseptr = NULL\n * else:\n */\n __pyx_t_1 = (__pyx_v_base == Py_None);\n if (__pyx_t_1) {\n\n /* \"numpy.pxd\":956\n * cdef PyObject* baseptr\n * if base is None:\n * baseptr = NULL # <<<<<<<<<<<<<<\n * else:\n * Py_INCREF(base) # important to do this before decref below!\n */\n __pyx_v_baseptr = NULL;\n goto __pyx_L3;\n }\n /*else*/ {\n\n /* \"numpy.pxd\":958\n * baseptr = NULL\n * else:\n * Py_INCREF(base) # important to do this before decref below! # <<<<<<<<<<<<<<\n * baseptr = base\n * Py_XDECREF(arr.base)\n */\n __pyx_t_2 = __pyx_v_base;\n __Pyx_INCREF(__pyx_t_2);\n Py_INCREF(__pyx_t_2);\n __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;\n\n /* \"numpy.pxd\":959\n * else:\n * Py_INCREF(base) # important to do this before decref below!\n * baseptr = base # <<<<<<<<<<<<<<\n * Py_XDECREF(arr.base)\n * arr.base = baseptr\n */\n __pyx_v_baseptr = ((PyObject *)__pyx_v_base);\n }\n __pyx_L3:;\n\n /* \"numpy.pxd\":960\n * Py_INCREF(base) # important to do this before decref below!\n * baseptr = base\n * Py_XDECREF(arr.base) # <<<<<<<<<<<<<<\n * arr.base = baseptr\n * \n */\n Py_XDECREF(__pyx_v_arr->base);\n\n /* \"numpy.pxd\":961\n * baseptr = base\n * Py_XDECREF(arr.base)\n * arr.base = baseptr # <<<<<<<<<<<<<<\n * \n * cdef inline object get_array_base(ndarray arr):\n */\n __pyx_v_arr->base = __pyx_v_baseptr;\n\n __Pyx_RefNannyFinishContext();\n}\n\n/* \"numpy.pxd\":963\n * arr.base = baseptr\n * \n * cdef inline object get_array_base(ndarray arr): # <<<<<<<<<<<<<<\n * if arr.base is NULL:\n * return None\n */\n\nstatic CYTHON_INLINE PyObject *__pyx_f_5numpy_get_array_base(PyArrayObject *__pyx_v_arr) {\n PyObject *__pyx_r = NULL;\n int __pyx_t_1;\n __Pyx_RefNannySetupContext(\"get_array_base\");\n\n /* \"numpy.pxd\":964\n * \n * cdef inline object get_array_base(ndarray arr):\n * if arr.base is NULL: # <<<<<<<<<<<<<<\n * return None\n * else:\n */\n __pyx_t_1 = (__pyx_v_arr->base == NULL);\n if (__pyx_t_1) {\n\n /* \"numpy.pxd\":965\n * cdef inline object get_array_base(ndarray arr):\n * if arr.base is NULL:\n * return None # <<<<<<<<<<<<<<\n * else:\n * return arr.base\n */\n __Pyx_XDECREF(__pyx_r);\n __Pyx_INCREF(Py_None);\n __pyx_r = Py_None;\n goto __pyx_L0;\n goto __pyx_L3;\n }\n /*else*/ {\n\n /* \"numpy.pxd\":967\n * return None\n * else:\n * return arr.base # <<<<<<<<<<<<<<\n */\n __Pyx_XDECREF(__pyx_r);\n __Pyx_INCREF(((PyObject *)__pyx_v_arr->base));\n __pyx_r = ((PyObject *)__pyx_v_arr->base);\n goto __pyx_L0;\n }\n __pyx_L3:;\n\n __pyx_r = Py_None; __Pyx_INCREF(Py_None);\n __pyx_L0:;\n __Pyx_XGIVEREF(__pyx_r);\n __Pyx_RefNannyFinishContext();\n return __pyx_r;\n}\n\nstatic PyMethodDef __pyx_methods[] = {\n {0, 0, 0, 0}\n};\n\n#if PY_MAJOR_VERSION >= 3\nstatic struct PyModuleDef __pyx_moduledef = {\n PyModuleDef_HEAD_INIT,\n __Pyx_NAMESTR(\"wrapper_inner\"),\n 0, /* m_doc */\n -1, /* m_size */\n __pyx_methods /* m_methods */,\n NULL, /* m_reload */\n NULL, /* m_traverse */\n NULL, /* m_clear */\n NULL /* m_free */\n};\n#endif\n\nstatic __Pyx_StringTabEntry __pyx_string_tab[] = {\n {&__pyx_kp_s_1, __pyx_k_1, sizeof(__pyx_k_1), 0, 0, 1, 0},\n {&__pyx_kp_u_11, __pyx_k_11, sizeof(__pyx_k_11), 0, 1, 0, 0},\n {&__pyx_kp_u_12, __pyx_k_12, sizeof(__pyx_k_12), 0, 1, 0, 0},\n {&__pyx_kp_u_15, __pyx_k_15, sizeof(__pyx_k_15), 0, 1, 0, 0},\n {&__pyx_kp_s_2, __pyx_k_2, sizeof(__pyx_k_2), 0, 0, 1, 0},\n {&__pyx_kp_s_3, __pyx_k_3, sizeof(__pyx_k_3), 0, 0, 1, 0},\n {&__pyx_kp_u_5, __pyx_k_5, sizeof(__pyx_k_5), 0, 1, 0, 0},\n {&__pyx_kp_u_7, __pyx_k_7, sizeof(__pyx_k_7), 0, 1, 0, 0},\n {&__pyx_kp_u_9, __pyx_k_9, sizeof(__pyx_k_9), 0, 1, 0, 0},\n {&__pyx_n_s__RuntimeError, __pyx_k__RuntimeError, sizeof(__pyx_k__RuntimeError), 0, 0, 1, 1},\n {&__pyx_n_s__ValueError, __pyx_k__ValueError, sizeof(__pyx_k__ValueError), 0, 0, 1, 1},\n {&__pyx_n_s____main__, __pyx_k____main__, sizeof(__pyx_k____main__), 0, 0, 1, 1},\n {&__pyx_n_s____test__, __pyx_k____test__, sizeof(__pyx_k____test__), 0, 0, 1, 1},\n {&__pyx_n_s__base, __pyx_k__base, sizeof(__pyx_k__base), 0, 0, 1, 1},\n {&__pyx_n_s__buf, __pyx_k__buf, sizeof(__pyx_k__buf), 0, 0, 1, 1},\n {&__pyx_n_s__byteorder, __pyx_k__byteorder, sizeof(__pyx_k__byteorder), 0, 0, 1, 1},\n {&__pyx_n_s__descr, __pyx_k__descr, sizeof(__pyx_k__descr), 0, 0, 1, 1},\n {&__pyx_n_s__do_awesome_work, __pyx_k__do_awesome_work, sizeof(__pyx_k__do_awesome_work), 0, 0, 1, 1},\n {&__pyx_n_s__fields, __pyx_k__fields, sizeof(__pyx_k__fields), 0, 0, 1, 1},\n {&__pyx_n_s__format, __pyx_k__format, sizeof(__pyx_k__format), 0, 0, 1, 1},\n {&__pyx_n_s__itemsize, __pyx_k__itemsize, sizeof(__pyx_k__itemsize), 0, 0, 1, 1},\n {&__pyx_n_s__names, __pyx_k__names, sizeof(__pyx_k__names), 0, 0, 1, 1},\n {&__pyx_n_s__ndim, __pyx_k__ndim, sizeof(__pyx_k__ndim), 0, 0, 1, 1},\n {&__pyx_n_s__np, __pyx_k__np, sizeof(__pyx_k__np), 0, 0, 1, 1},\n {&__pyx_n_s__numpy, __pyx_k__numpy, sizeof(__pyx_k__numpy), 0, 0, 1, 1},\n {&__pyx_n_s__obj, __pyx_k__obj, sizeof(__pyx_k__obj), 0, 0, 1, 1},\n {&__pyx_n_s__ones, __pyx_k__ones, sizeof(__pyx_k__ones), 0, 0, 1, 1},\n {&__pyx_n_s__pure_py_test, __pyx_k__pure_py_test, sizeof(__pyx_k__pure_py_test), 0, 0, 1, 1},\n {&__pyx_n_s__range, __pyx_k__range, sizeof(__pyx_k__range), 0, 0, 1, 1},\n {&__pyx_n_s__readonly, __pyx_k__readonly, sizeof(__pyx_k__readonly), 0, 0, 1, 1},\n {&__pyx_n_s__shape, __pyx_k__shape, sizeof(__pyx_k__shape), 0, 0, 1, 1},\n {&__pyx_n_s__strides, __pyx_k__strides, sizeof(__pyx_k__strides), 0, 0, 1, 1},\n {&__pyx_n_s__suboffsets, __pyx_k__suboffsets, sizeof(__pyx_k__suboffsets), 0, 0, 1, 1},\n {&__pyx_n_s__type_num, __pyx_k__type_num, sizeof(__pyx_k__type_num), 0, 0, 1, 1},\n {&__pyx_n_s__work_module, __pyx_k__work_module, sizeof(__pyx_k__work_module), 0, 0, 1, 1},\n {&__pyx_n_s__wrapper_inner, __pyx_k__wrapper_inner, sizeof(__pyx_k__wrapper_inner), 0, 0, 1, 1},\n {0, 0, 0, 0, 0, 0, 0}\n};\nstatic int __Pyx_InitCachedBuiltins(void) {\n __pyx_builtin_ValueError = __Pyx_GetName(__pyx_b, __pyx_n_s__ValueError); if (!__pyx_builtin_ValueError) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 206; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_builtin_range = __Pyx_GetName(__pyx_b, __pyx_n_s__range); if (!__pyx_builtin_range) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 219; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_builtin_RuntimeError = __Pyx_GetName(__pyx_b, __pyx_n_s__RuntimeError); if (!__pyx_builtin_RuntimeError) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 787; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n return 0;\n __pyx_L1_error:;\n return -1;\n}\n\nstatic int __Pyx_InitCachedConstants(void) {\n __Pyx_RefNannySetupContext(\"__Pyx_InitCachedConstants\");\n\n /* \"wrapper_inner.pyx\":68\n * print('\\nHello from a pure Python function inside the Cython module.')\n * \n * data = np.ones(5) # <<<<<<<<<<<<<<\n * work_module.do_awesome_work(data)\n */\n __pyx_k_tuple_4 = PyTuple_New(1); if (unlikely(!__pyx_k_tuple_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 68; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(((PyObject *)__pyx_k_tuple_4));\n __Pyx_INCREF(__pyx_int_5);\n PyTuple_SET_ITEM(__pyx_k_tuple_4, 0, __pyx_int_5);\n __Pyx_GIVEREF(__pyx_int_5);\n __Pyx_GIVEREF(((PyObject *)__pyx_k_tuple_4));\n\n /* \"numpy.pxd\":206\n * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS)\n * and not PyArray_CHKFLAGS(self, NPY_C_CONTIGUOUS)):\n * raise ValueError(u\"ndarray is not C contiguous\") # <<<<<<<<<<<<<<\n * \n * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS)\n */\n __pyx_k_tuple_6 = PyTuple_New(1); if (unlikely(!__pyx_k_tuple_6)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 206; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(((PyObject *)__pyx_k_tuple_6));\n __Pyx_INCREF(((PyObject *)__pyx_kp_u_5));\n PyTuple_SET_ITEM(__pyx_k_tuple_6, 0, ((PyObject *)__pyx_kp_u_5));\n __Pyx_GIVEREF(((PyObject *)__pyx_kp_u_5));\n __Pyx_GIVEREF(((PyObject *)__pyx_k_tuple_6));\n\n /* \"numpy.pxd\":210\n * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS)\n * and not PyArray_CHKFLAGS(self, NPY_F_CONTIGUOUS)):\n * raise ValueError(u\"ndarray is not Fortran contiguous\") # <<<<<<<<<<<<<<\n * \n * info.buf = PyArray_DATA(self)\n */\n __pyx_k_tuple_8 = PyTuple_New(1); if (unlikely(!__pyx_k_tuple_8)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(((PyObject *)__pyx_k_tuple_8));\n __Pyx_INCREF(((PyObject *)__pyx_kp_u_7));\n PyTuple_SET_ITEM(__pyx_k_tuple_8, 0, ((PyObject *)__pyx_kp_u_7));\n __Pyx_GIVEREF(((PyObject *)__pyx_kp_u_7));\n __Pyx_GIVEREF(((PyObject *)__pyx_k_tuple_8));\n\n /* \"numpy.pxd\":248\n * if ((descr.byteorder == '>' and little_endian) or\n * (descr.byteorder == '<' and not little_endian)):\n * raise ValueError(u\"Non-native byte order not supported\") # <<<<<<<<<<<<<<\n * if t == NPY_BYTE: f = \"b\"\n * elif t == NPY_UBYTE: f = \"B\"\n */\n __pyx_k_tuple_10 = PyTuple_New(1); if (unlikely(!__pyx_k_tuple_10)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 248; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(((PyObject *)__pyx_k_tuple_10));\n __Pyx_INCREF(((PyObject *)__pyx_kp_u_9));\n PyTuple_SET_ITEM(__pyx_k_tuple_10, 0, ((PyObject *)__pyx_kp_u_9));\n __Pyx_GIVEREF(((PyObject *)__pyx_kp_u_9));\n __Pyx_GIVEREF(((PyObject *)__pyx_k_tuple_10));\n\n /* \"numpy.pxd\":787\n * \n * if (end - f) - (new_offset - offset[0]) < 15:\n * raise RuntimeError(u\"Format string allocated too short, see comment in numpy.pxd\") # <<<<<<<<<<<<<<\n * \n * if ((child.byteorder == '>' and little_endian) or\n */\n __pyx_k_tuple_13 = PyTuple_New(1); if (unlikely(!__pyx_k_tuple_13)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 787; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(((PyObject *)__pyx_k_tuple_13));\n __Pyx_INCREF(((PyObject *)__pyx_kp_u_12));\n PyTuple_SET_ITEM(__pyx_k_tuple_13, 0, ((PyObject *)__pyx_kp_u_12));\n __Pyx_GIVEREF(((PyObject *)__pyx_kp_u_12));\n __Pyx_GIVEREF(((PyObject *)__pyx_k_tuple_13));\n\n /* \"numpy.pxd\":791\n * if ((child.byteorder == '>' and little_endian) or\n * (child.byteorder == '<' and not little_endian)):\n * raise ValueError(u\"Non-native byte order not supported\") # <<<<<<<<<<<<<<\n * # One could encode it in the format string and have Cython\n * # complain instead, BUT: < and > in format strings also imply\n */\n __pyx_k_tuple_14 = PyTuple_New(1); if (unlikely(!__pyx_k_tuple_14)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 791; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(((PyObject *)__pyx_k_tuple_14));\n __Pyx_INCREF(((PyObject *)__pyx_kp_u_9));\n PyTuple_SET_ITEM(__pyx_k_tuple_14, 0, ((PyObject *)__pyx_kp_u_9));\n __Pyx_GIVEREF(((PyObject *)__pyx_kp_u_9));\n __Pyx_GIVEREF(((PyObject *)__pyx_k_tuple_14));\n\n /* \"numpy.pxd\":811\n * t = child.type_num\n * if end - f < 5:\n * raise RuntimeError(u\"Format string allocated too short.\") # <<<<<<<<<<<<<<\n * \n * # Until ticket #99 is fixed, use integers to avoid warnings\n */\n __pyx_k_tuple_16 = PyTuple_New(1); if (unlikely(!__pyx_k_tuple_16)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 811; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(((PyObject *)__pyx_k_tuple_16));\n __Pyx_INCREF(((PyObject *)__pyx_kp_u_15));\n PyTuple_SET_ITEM(__pyx_k_tuple_16, 0, ((PyObject *)__pyx_kp_u_15));\n __Pyx_GIVEREF(((PyObject *)__pyx_kp_u_15));\n __Pyx_GIVEREF(((PyObject *)__pyx_k_tuple_16));\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_filename = __pyx_f[0]; __pyx_lineno = 2; __pyx_clineno = __LINE__; goto __pyx_L1_error;};\n __pyx_int_5 = PyInt_FromLong(5); if (unlikely(!__pyx_int_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 2; __pyx_clineno = __LINE__; goto __pyx_L1_error;};\n __pyx_int_15 = PyInt_FromLong(15); if (unlikely(!__pyx_int_15)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 2; __pyx_clineno = __LINE__; goto __pyx_L1_error;};\n return 0;\n __pyx_L1_error:;\n return -1;\n}\n\n#if PY_MAJOR_VERSION < 3\nPyMODINIT_FUNC initwrapper_inner(void); /*proto*/\nPyMODINIT_FUNC initwrapper_inner(void)\n#else\nPyMODINIT_FUNC PyInit_wrapper_inner(void); /*proto*/\nPyMODINIT_FUNC PyInit_wrapper_inner(void)\n#endif\n{\n PyObject *__pyx_t_1 = NULL;\n #if CYTHON_REFNANNY\n void* __pyx_refnanny = NULL;\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 __pyx_refnanny = __Pyx_RefNanny->SetupContext(\"PyMODINIT_FUNC PyInit_wrapper_inner(void)\", __LINE__, __FILE__);\n #endif\n __pyx_empty_tuple = PyTuple_New(0); if (unlikely(!__pyx_empty_tuple)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 2; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_empty_bytes = PyBytes_FromStringAndSize(\"\", 0); if (unlikely(!__pyx_empty_bytes)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 2; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n #ifdef __pyx_binding_PyCFunctionType_USED\n if (__pyx_binding_PyCFunctionType_init() < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 2; __pyx_clineno = __LINE__; goto __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 PY_MAJOR_VERSION < 3\n __pyx_m = Py_InitModule4(__Pyx_NAMESTR(\"wrapper_inner\"), __pyx_methods, 0, 0, PYTHON_API_VERSION);\n #else\n __pyx_m = PyModule_Create(&__pyx_moduledef);\n #endif\n if (!__pyx_m) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 2; __pyx_clineno = __LINE__; goto __pyx_L1_error;};\n #if PY_MAJOR_VERSION < 3\n Py_INCREF(__pyx_m);\n #endif\n __pyx_b = PyImport_AddModule(__Pyx_NAMESTR(__Pyx_BUILTIN_MODULE_NAME));\n if (!__pyx_b) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 2; __pyx_clineno = __LINE__; goto __pyx_L1_error;};\n if (__Pyx_SetAttrString(__pyx_m, \"__builtins__\", __pyx_b) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 2; __pyx_clineno = __LINE__; goto __pyx_L1_error;};\n /*--- Initialize various global constants etc. ---*/\n if (unlikely(__Pyx_InitGlobals() < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 2; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__pyx_module_is_main_wrapper_inner) {\n if (__Pyx_SetAttrString(__pyx_m, \"__name__\", __pyx_n_s____main__) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 2; __pyx_clineno = __LINE__; goto __pyx_L1_error;};\n }\n /*--- Builtin init code ---*/\n if (unlikely(__Pyx_InitCachedBuiltins() < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 2; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n /*--- Constants init code ---*/\n if (unlikely(__Pyx_InitCachedConstants() < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 2; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n /*--- Global init code ---*/\n /*--- Function export code ---*/\n if (__Pyx_ExportFunction(\"inner_work_1d\", (void (*)(void))inner_work_1d, \"void (int, double *, double *)\") < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 2; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n if (__Pyx_ExportFunction(\"inner_work_2d\", (void (*)(void))inner_work_2d, \"void (int, int, double *, double *)\") < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 2; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n /*--- Type init code ---*/\n /*--- Type import code ---*/\n __pyx_ptype_5numpy_dtype = __Pyx_ImportType(\"numpy\", \"dtype\", sizeof(PyArray_Descr), 0); if (unlikely(!__pyx_ptype_5numpy_dtype)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 149; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_5numpy_flatiter = __Pyx_ImportType(\"numpy\", \"flatiter\", sizeof(PyArrayIterObject), 0); if (unlikely(!__pyx_ptype_5numpy_flatiter)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 159; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_5numpy_broadcast = __Pyx_ImportType(\"numpy\", \"broadcast\", sizeof(PyArrayMultiIterObject), 0); if (unlikely(!__pyx_ptype_5numpy_broadcast)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 163; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_5numpy_ndarray = __Pyx_ImportType(\"numpy\", \"ndarray\", sizeof(PyArrayObject), 0); if (unlikely(!__pyx_ptype_5numpy_ndarray)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 172; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __pyx_ptype_5numpy_ufunc = __Pyx_ImportType(\"numpy\", \"ufunc\", sizeof(PyUFuncObject), 0); if (unlikely(!__pyx_ptype_5numpy_ufunc)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 849; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n /*--- Function import code ---*/\n /*--- Execution code ---*/\n\n /* \"wrapper_inner.pyx\":2\n * \n * import numpy as np # <<<<<<<<<<<<<<\n * cimport numpy as np\n * \n */\n __pyx_t_1 = __Pyx_Import(((PyObject *)__pyx_n_s__numpy), 0); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 2; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n if (PyObject_SetAttr(__pyx_m, __pyx_n_s__np, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 2; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n /* \"wrapper_inner.pyx\":5\n * cimport numpy as np\n * \n * np.import_array() # <<<<<<<<<<<<<<\n * \n * from libcpp.vector cimport vector\n */\n import_array();\n\n /* \"wrapper_inner.pyx\":9\n * from libcpp.vector cimport vector\n * \n * import work_module # <<<<<<<<<<<<<<\n * \n * # Declare any Numpy C-API functions that I want to use.\n */\n __pyx_t_1 = __Pyx_Import(((PyObject *)__pyx_n_s__work_module), 0); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 9; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n if (PyObject_SetAttr(__pyx_m, __pyx_n_s__work_module, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 9; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n /* \"wrapper_inner.pyx\":64\n * \n * \n * def pure_py_test(): # <<<<<<<<<<<<<<\n * \n * print('\\nHello from a pure Python function inside the Cython module.')\n */\n __pyx_t_1 = PyCFunction_NewEx(&__pyx_mdef_13wrapper_inner_pure_py_test, NULL, __pyx_n_s__wrapper_inner); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 64; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(__pyx_t_1);\n if (PyObject_SetAttr(__pyx_m, __pyx_n_s__pure_py_test, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 64; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;\n\n /* \"wrapper_inner.pyx\":2\n * \n * import numpy as np # <<<<<<<<<<<<<<\n * cimport numpy as np\n * \n */\n __pyx_t_1 = PyDict_New(); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 2; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_GOTREF(((PyObject *)__pyx_t_1));\n if (PyObject_SetAttr(__pyx_m, __pyx_n_s____test__, ((PyObject *)__pyx_t_1)) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 2; __pyx_clineno = __LINE__; goto __pyx_L1_error;}\n __Pyx_DECREF(((PyObject *)__pyx_t_1)); __pyx_t_1 = 0;\n\n /* \"libc\\stdio.pxd\":1\n * # 7.19 Input/output # <<<<<<<<<<<<<<\n * \n * cdef extern from *:\n */\n goto __pyx_L0;\n __pyx_L1_error:;\n __Pyx_XDECREF(__pyx_t_1);\n if (__pyx_m) {\n __Pyx_AddTraceback(\"init wrapper_inner\");\n Py_DECREF(__pyx_m); __pyx_m = 0;\n } else if (!PyErr_Occurred()) {\n PyErr_SetString(PyExc_ImportError, \"init wrapper_inner\");\n }\n __pyx_L0:;\n __Pyx_RefNannyFinishContext();\n #if PY_MAJOR_VERSION < 3\n return;\n #else\n return __pyx_m;\n #endif\n}\n\n/* Runtime support code */\n\nstatic CYTHON_INLINE int __Pyx_TypeTest(PyObject *obj, PyTypeObject *type) {\n if (unlikely(!type)) {\n PyErr_Format(PyExc_SystemError, \"Missing type object\");\n return 0;\n }\n if (likely(PyObject_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\nstatic PyObject *__Pyx_GetName(PyObject *dict, PyObject *name) {\n PyObject *result;\n result = PyObject_GetAttr(dict, name);\n if (!result)\n PyErr_SetObject(PyExc_NameError, name);\n return result;\n}\n\nstatic CYTHON_INLINE void __Pyx_ErrRestore(PyObject *type, PyObject *value, PyObject *tb) {\n PyObject *tmp_type, *tmp_value, *tmp_tb;\n PyThreadState *tstate = PyThreadState_GET();\n\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}\n\nstatic CYTHON_INLINE void __Pyx_ErrFetch(PyObject **type, PyObject **value, PyObject **tb) {\n PyThreadState *tstate = PyThreadState_GET();\n *type = tstate->curexc_type;\n *value = tstate->curexc_value;\n *tb = tstate->curexc_traceback;\n\n tstate->curexc_type = 0;\n tstate->curexc_value = 0;\n tstate->curexc_traceback = 0;\n}\n\n\n#if PY_MAJOR_VERSION < 3\nstatic void __Pyx_Raise(PyObject *type, PyObject *value, PyObject *tb) {\n Py_XINCREF(type);\n Py_XINCREF(value);\n Py_XINCREF(tb);\n /* First, check the traceback argument, replacing None with NULL. */\n if (tb == Py_None) {\n Py_DECREF(tb);\n tb = 0;\n }\n else if (tb != NULL && !PyTraceBack_Check(tb)) {\n PyErr_SetString(PyExc_TypeError,\n \"raise: arg 3 must be a traceback or None\");\n goto raise_error;\n }\n /* Next, replace a missing value with None */\n if (value == NULL) {\n value = Py_None;\n Py_INCREF(value);\n }\n #if PY_VERSION_HEX < 0x02050000\n if (!PyClass_Check(type))\n #else\n if (!PyType_Check(type))\n #endif\n {\n /* Raising an instance. The value should be a dummy. */\n if (value != Py_None) {\n PyErr_SetString(PyExc_TypeError,\n \"instance exception may not have a separate value\");\n goto raise_error;\n }\n /* Normalize to raise , */\n Py_DECREF(value);\n value = type;\n #if PY_VERSION_HEX < 0x02050000\n if (PyInstance_Check(type)) {\n type = (PyObject*) ((PyInstanceObject*)type)->in_class;\n Py_INCREF(type);\n }\n else {\n type = 0;\n PyErr_SetString(PyExc_TypeError,\n \"raise: exception must be an old-style class or instance\");\n goto raise_error;\n }\n #else\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 #endif\n }\n\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\n#else /* Python 3+ */\n\nstatic void __Pyx_Raise(PyObject *type, PyObject *value, PyObject *tb) {\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\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 PyErr_SetString(PyExc_TypeError,\n \"raise: exception class must be a subclass of BaseException\");\n goto bad;\n }\n\n PyErr_SetObject(type, value);\n\n if (tb) {\n PyThreadState *tstate = PyThreadState_GET();\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 }\n\nbad:\n return;\n}\n#endif\n\nstatic CYTHON_INLINE void __Pyx_RaiseNoneNotIterableError(void) {\n PyErr_SetString(PyExc_TypeError, \"'NoneType' object is not iterable\");\n}\n\nstatic CYTHON_INLINE void __Pyx_RaiseNeedMoreValuesError(Py_ssize_t index) {\n PyErr_Format(PyExc_ValueError,\n #if PY_VERSION_HEX < 0x02050000\n \"need more than %d value%s to unpack\", (int)index,\n #else\n \"need more than %zd value%s to unpack\", index,\n #endif\n (index == 1) ? \"\" : \"s\");\n}\n\nstatic CYTHON_INLINE void __Pyx_RaiseTooManyValuesError(Py_ssize_t expected) {\n PyErr_Format(PyExc_ValueError,\n #if PY_VERSION_HEX < 0x02050000\n \"too many values to unpack (expected %d)\", (int)expected);\n #else\n \"too many values to unpack (expected %zd)\", expected);\n #endif\n}\n\nstatic void __Pyx_UnpackTupleError(PyObject *t, Py_ssize_t index) {\n if (t == Py_None) {\n __Pyx_RaiseNoneNotIterableError();\n } else if (PyTuple_GET_SIZE(t) < index) {\n __Pyx_RaiseNeedMoreValuesError(PyTuple_GET_SIZE(t));\n } else {\n __Pyx_RaiseTooManyValuesError(index);\n }\n}\n\nstatic PyObject *__Pyx_Import(PyObject *name, PyObject *from_list) {\n PyObject *py_import = 0;\n PyObject *empty_list = 0;\n PyObject *module = 0;\n PyObject *global_dict = 0;\n PyObject *empty_dict = 0;\n PyObject *list;\n py_import = __Pyx_GetAttrString(__pyx_b, \"__import__\");\n if (!py_import)\n goto bad;\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 module = PyObject_CallFunctionObjArgs(py_import,\n name, global_dict, empty_dict, list, NULL);\nbad:\n Py_XDECREF(empty_list);\n Py_XDECREF(py_import);\n Py_XDECREF(empty_dict);\n return module;\n}\n\n#if PY_MAJOR_VERSION < 3\nstatic PyObject *__Pyx_GetStdout(void) {\n PyObject *f = PySys_GetObject((char *)\"stdout\");\n if (!f) {\n PyErr_SetString(PyExc_RuntimeError, \"lost sys.stdout\");\n }\n return f;\n}\n\nstatic int __Pyx_Print(PyObject* f, PyObject *arg_tuple, int newline) {\n PyObject* v;\n int i;\n\n if (!f) {\n if (!(f = __Pyx_GetStdout()))\n return -1;\n }\n for (i=0; i < PyTuple_GET_SIZE(arg_tuple); i++) {\n if (PyFile_SoftSpace(f, 1)) {\n if (PyFile_WriteString(\" \", f) < 0)\n return -1;\n }\n v = PyTuple_GET_ITEM(arg_tuple, i);\n if (PyFile_WriteObject(v, f, Py_PRINT_RAW) < 0)\n return -1;\n if (PyString_Check(v)) {\n char *s = PyString_AsString(v);\n Py_ssize_t len = PyString_Size(v);\n if (len > 0 &&\n isspace(Py_CHARMASK(s[len-1])) &&\n s[len-1] != ' ')\n PyFile_SoftSpace(f, 0);\n }\n }\n if (newline) {\n if (PyFile_WriteString(\"\\n\", f) < 0)\n return -1;\n PyFile_SoftSpace(f, 0);\n }\n return 0;\n}\n\n#else /* Python 3 has a print function */\n\nstatic int __Pyx_Print(PyObject* stream, PyObject *arg_tuple, int newline) {\n PyObject* kwargs = 0;\n PyObject* result = 0;\n PyObject* end_string;\n if (unlikely(!__pyx_print)) {\n __pyx_print = __Pyx_GetAttrString(__pyx_b, \"print\");\n if (!__pyx_print)\n return -1;\n }\n if (stream) {\n kwargs = PyDict_New();\n if (unlikely(!kwargs))\n return -1;\n if (unlikely(PyDict_SetItemString(kwargs, \"file\", stream) < 0))\n goto bad;\n if (!newline) {\n end_string = PyUnicode_FromStringAndSize(\" \", 1);\n if (unlikely(!end_string))\n goto bad;\n if (PyDict_SetItemString(kwargs, \"end\", end_string) < 0) {\n Py_DECREF(end_string);\n goto bad;\n }\n Py_DECREF(end_string);\n }\n } else if (!newline) {\n if (unlikely(!__pyx_print_kwargs)) {\n __pyx_print_kwargs = PyDict_New();\n if (unlikely(!__pyx_print_kwargs))\n return -1;\n end_string = PyUnicode_FromStringAndSize(\" \", 1);\n if (unlikely(!end_string))\n return -1;\n if (PyDict_SetItemString(__pyx_print_kwargs, \"end\", end_string) < 0) {\n Py_DECREF(end_string);\n return -1;\n }\n Py_DECREF(end_string);\n }\n kwargs = __pyx_print_kwargs;\n }\n result = PyObject_Call(__pyx_print, arg_tuple, kwargs);\n if (unlikely(kwargs) && (kwargs != __pyx_print_kwargs))\n Py_DECREF(kwargs);\n if (!result)\n return -1;\n Py_DECREF(result);\n return 0;\nbad:\n if (kwargs != __pyx_print_kwargs)\n Py_XDECREF(kwargs);\n return -1;\n}\n\n#endif\n\n#if PY_MAJOR_VERSION < 3\n\nstatic int __Pyx_PrintOne(PyObject* f, PyObject *o) {\n if (!f) {\n if (!(f = __Pyx_GetStdout()))\n return -1;\n }\n if (PyFile_SoftSpace(f, 0)) {\n if (PyFile_WriteString(\" \", f) < 0)\n return -1;\n }\n if (PyFile_WriteObject(o, f, Py_PRINT_RAW) < 0)\n return -1;\n if (PyFile_WriteString(\"\\n\", f) < 0)\n return -1;\n return 0;\n /* the line below is just to avoid compiler\n * compiler warnings about unused functions */\n return __Pyx_Print(f, NULL, 0);\n}\n\n#else /* Python 3 has a print function */\n\nstatic int __Pyx_PrintOne(PyObject* stream, PyObject *o) {\n int res;\n PyObject* arg_tuple = PyTuple_New(1);\n if (unlikely(!arg_tuple))\n return -1;\n Py_INCREF(o);\n PyTuple_SET_ITEM(arg_tuple, 0, o);\n res = __Pyx_Print(stream, arg_tuple, 1);\n Py_DECREF(arg_tuple);\n return res;\n}\n\n#endif\n\nstatic CYTHON_INLINE PyObject *__Pyx_PyInt_to_py_Py_intptr_t(Py_intptr_t val) {\n const Py_intptr_t neg_one = (Py_intptr_t)-1, const_zero = (Py_intptr_t)0;\n const int is_unsigned = const_zero < neg_one;\n if ((sizeof(Py_intptr_t) == sizeof(char)) ||\n (sizeof(Py_intptr_t) == sizeof(short))) {\n return PyInt_FromLong((long)val);\n } else if ((sizeof(Py_intptr_t) == sizeof(int)) ||\n (sizeof(Py_intptr_t) == sizeof(long))) {\n if (is_unsigned)\n return PyLong_FromUnsignedLong((unsigned long)val);\n else\n return PyInt_FromLong((long)val);\n } else if (sizeof(Py_intptr_t) == sizeof(PY_LONG_LONG)) {\n if (is_unsigned)\n return PyLong_FromUnsignedLongLong((unsigned PY_LONG_LONG)val);\n else\n return PyLong_FromLongLong((PY_LONG_LONG)val);\n } else {\n int one = 1; int little = (int)*(unsigned char *)&one;\n unsigned char *bytes = (unsigned char *)&val;\n return _PyLong_FromByteArray(bytes, sizeof(Py_intptr_t), \n little, !is_unsigned);\n }\n}\n\n#if CYTHON_CCOMPLEX\n #ifdef __cplusplus\n static CYTHON_INLINE __pyx_t_float_complex __pyx_t_float_complex_from_parts(float x, float y) {\n return ::std::complex< float >(x, y);\n }\n #else\n static CYTHON_INLINE __pyx_t_float_complex __pyx_t_float_complex_from_parts(float x, float y) {\n return x + y*(__pyx_t_float_complex)_Complex_I;\n }\n #endif\n#else\n static CYTHON_INLINE __pyx_t_float_complex __pyx_t_float_complex_from_parts(float x, float y) {\n __pyx_t_float_complex z;\n z.real = x;\n z.imag = y;\n return z;\n }\n#endif\n\n#if CYTHON_CCOMPLEX\n#else\n static CYTHON_INLINE int __Pyx_c_eqf(__pyx_t_float_complex a, __pyx_t_float_complex b) {\n return (a.real == b.real) && (a.imag == b.imag);\n }\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_sumf(__pyx_t_float_complex a, __pyx_t_float_complex b) {\n __pyx_t_float_complex z;\n z.real = a.real + b.real;\n z.imag = a.imag + b.imag;\n return z;\n }\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_difff(__pyx_t_float_complex a, __pyx_t_float_complex b) {\n __pyx_t_float_complex z;\n z.real = a.real - b.real;\n z.imag = a.imag - b.imag;\n return z;\n }\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_prodf(__pyx_t_float_complex a, __pyx_t_float_complex b) {\n __pyx_t_float_complex z;\n z.real = a.real * b.real - a.imag * b.imag;\n z.imag = a.real * b.imag + a.imag * b.real;\n return z;\n }\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_quotf(__pyx_t_float_complex a, __pyx_t_float_complex b) {\n __pyx_t_float_complex z;\n float denom = b.real * b.real + b.imag * b.imag;\n z.real = (a.real * b.real + a.imag * b.imag) / denom;\n z.imag = (a.imag * b.real - a.real * b.imag) / denom;\n return z;\n }\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_negf(__pyx_t_float_complex a) {\n __pyx_t_float_complex z;\n z.real = -a.real;\n z.imag = -a.imag;\n return z;\n }\n static CYTHON_INLINE int __Pyx_c_is_zerof(__pyx_t_float_complex a) {\n return (a.real == 0) && (a.imag == 0);\n }\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_conjf(__pyx_t_float_complex a) {\n __pyx_t_float_complex z;\n z.real = a.real;\n z.imag = -a.imag;\n return z;\n }\n #if 1\n static CYTHON_INLINE float __Pyx_c_absf(__pyx_t_float_complex z) {\n #if !defined(HAVE_HYPOT) || defined(_MSC_VER)\n return sqrtf(z.real*z.real + z.imag*z.imag);\n #else\n return hypotf(z.real, z.imag);\n #endif\n }\n static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_powf(__pyx_t_float_complex a, __pyx_t_float_complex b) {\n __pyx_t_float_complex z;\n float r, lnr, theta, z_r, z_theta;\n if (b.imag == 0 && b.real == (int)b.real) {\n if (b.real < 0) {\n float denom = a.real * a.real + a.imag * a.imag;\n a.real = a.real / denom;\n a.imag = -a.imag / denom;\n b.real = -b.real;\n }\n switch ((int)b.real) {\n case 0:\n z.real = 1;\n z.imag = 0;\n return z;\n case 1:\n return a;\n case 2:\n z = __Pyx_c_prodf(a, a);\n return __Pyx_c_prodf(a, a);\n case 3:\n z = __Pyx_c_prodf(a, a);\n return __Pyx_c_prodf(z, a);\n case 4:\n z = __Pyx_c_prodf(a, a);\n return __Pyx_c_prodf(z, z);\n }\n }\n if (a.imag == 0) {\n if (a.real == 0) {\n return a;\n }\n r = a.real;\n theta = 0;\n } else {\n r = __Pyx_c_absf(a);\n theta = atan2f(a.imag, a.real);\n }\n lnr = logf(r);\n z_r = expf(lnr * b.real - theta * b.imag);\n z_theta = theta * b.real + lnr * b.imag;\n z.real = z_r * cosf(z_theta);\n z.imag = z_r * sinf(z_theta);\n return z;\n }\n #endif\n#endif\n\n#if CYTHON_CCOMPLEX\n #ifdef __cplusplus\n static CYTHON_INLINE __pyx_t_double_complex __pyx_t_double_complex_from_parts(double x, double y) {\n return ::std::complex< double >(x, y);\n }\n #else\n static CYTHON_INLINE __pyx_t_double_complex __pyx_t_double_complex_from_parts(double x, double y) {\n return x + y*(__pyx_t_double_complex)_Complex_I;\n }\n #endif\n#else\n static CYTHON_INLINE __pyx_t_double_complex __pyx_t_double_complex_from_parts(double x, double y) {\n __pyx_t_double_complex z;\n z.real = x;\n z.imag = y;\n return z;\n }\n#endif\n\n#if CYTHON_CCOMPLEX\n#else\n static CYTHON_INLINE int __Pyx_c_eq(__pyx_t_double_complex a, __pyx_t_double_complex b) {\n return (a.real == b.real) && (a.imag == b.imag);\n }\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_sum(__pyx_t_double_complex a, __pyx_t_double_complex b) {\n __pyx_t_double_complex z;\n z.real = a.real + b.real;\n z.imag = a.imag + b.imag;\n return z;\n }\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_diff(__pyx_t_double_complex a, __pyx_t_double_complex b) {\n __pyx_t_double_complex z;\n z.real = a.real - b.real;\n z.imag = a.imag - b.imag;\n return z;\n }\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_prod(__pyx_t_double_complex a, __pyx_t_double_complex b) {\n __pyx_t_double_complex z;\n z.real = a.real * b.real - a.imag * b.imag;\n z.imag = a.real * b.imag + a.imag * b.real;\n return z;\n }\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_quot(__pyx_t_double_complex a, __pyx_t_double_complex b) {\n __pyx_t_double_complex z;\n double denom = b.real * b.real + b.imag * b.imag;\n z.real = (a.real * b.real + a.imag * b.imag) / denom;\n z.imag = (a.imag * b.real - a.real * b.imag) / denom;\n return z;\n }\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_neg(__pyx_t_double_complex a) {\n __pyx_t_double_complex z;\n z.real = -a.real;\n z.imag = -a.imag;\n return z;\n }\n static CYTHON_INLINE int __Pyx_c_is_zero(__pyx_t_double_complex a) {\n return (a.real == 0) && (a.imag == 0);\n }\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_conj(__pyx_t_double_complex a) {\n __pyx_t_double_complex z;\n z.real = a.real;\n z.imag = -a.imag;\n return z;\n }\n #if 1\n static CYTHON_INLINE double __Pyx_c_abs(__pyx_t_double_complex z) {\n #if !defined(HAVE_HYPOT) || defined(_MSC_VER)\n return sqrt(z.real*z.real + z.imag*z.imag);\n #else\n return hypot(z.real, z.imag);\n #endif\n }\n static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_pow(__pyx_t_double_complex a, __pyx_t_double_complex b) {\n __pyx_t_double_complex z;\n double r, lnr, theta, z_r, z_theta;\n if (b.imag == 0 && b.real == (int)b.real) {\n if (b.real < 0) {\n double denom = a.real * a.real + a.imag * a.imag;\n a.real = a.real / denom;\n a.imag = -a.imag / denom;\n b.real = -b.real;\n }\n switch ((int)b.real) {\n case 0:\n z.real = 1;\n z.imag = 0;\n return z;\n case 1:\n return a;\n case 2:\n z = __Pyx_c_prod(a, a);\n return __Pyx_c_prod(a, a);\n case 3:\n z = __Pyx_c_prod(a, a);\n return __Pyx_c_prod(z, a);\n case 4:\n z = __Pyx_c_prod(a, a);\n return __Pyx_c_prod(z, z);\n }\n }\n if (a.imag == 0) {\n if (a.real == 0) {\n return a;\n }\n r = a.real;\n theta = 0;\n } else {\n r = __Pyx_c_abs(a);\n theta = atan2(a.imag, a.real);\n }\n lnr = log(r);\n z_r = exp(lnr * b.real - theta * b.imag);\n z_theta = theta * b.real + lnr * b.imag;\n z.real = z_r * cos(z_theta);\n z.imag = z_r * sin(z_theta);\n return z;\n }\n #endif\n#endif\n\nstatic CYTHON_INLINE unsigned char __Pyx_PyInt_AsUnsignedChar(PyObject* x) {\n const unsigned char neg_one = (unsigned char)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n if (sizeof(unsigned char) < sizeof(long)) {\n long val = __Pyx_PyInt_AsLong(x);\n if (unlikely(val != (long)(unsigned char)val)) {\n if (!unlikely(val == -1 && PyErr_Occurred())) {\n PyErr_SetString(PyExc_OverflowError,\n (is_unsigned && unlikely(val < 0)) ?\n \"can't convert negative value to unsigned char\" :\n \"value too large to convert to unsigned char\");\n }\n return (unsigned char)-1;\n }\n return (unsigned char)val;\n }\n return (unsigned char)__Pyx_PyInt_AsUnsignedLong(x);\n}\n\nstatic CYTHON_INLINE unsigned short __Pyx_PyInt_AsUnsignedShort(PyObject* x) {\n const unsigned short neg_one = (unsigned short)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n if (sizeof(unsigned short) < sizeof(long)) {\n long val = __Pyx_PyInt_AsLong(x);\n if (unlikely(val != (long)(unsigned short)val)) {\n if (!unlikely(val == -1 && PyErr_Occurred())) {\n PyErr_SetString(PyExc_OverflowError,\n (is_unsigned && unlikely(val < 0)) ?\n \"can't convert negative value to unsigned short\" :\n \"value too large to convert to unsigned short\");\n }\n return (unsigned short)-1;\n }\n return (unsigned short)val;\n }\n return (unsigned short)__Pyx_PyInt_AsUnsignedLong(x);\n}\n\nstatic CYTHON_INLINE unsigned int __Pyx_PyInt_AsUnsignedInt(PyObject* x) {\n const unsigned int neg_one = (unsigned int)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n if (sizeof(unsigned int) < sizeof(long)) {\n long val = __Pyx_PyInt_AsLong(x);\n if (unlikely(val != (long)(unsigned int)val)) {\n if (!unlikely(val == -1 && PyErr_Occurred())) {\n PyErr_SetString(PyExc_OverflowError,\n (is_unsigned && unlikely(val < 0)) ?\n \"can't convert negative value to unsigned int\" :\n \"value too large to convert to unsigned int\");\n }\n return (unsigned int)-1;\n }\n return (unsigned int)val;\n }\n return (unsigned int)__Pyx_PyInt_AsUnsignedLong(x);\n}\n\nstatic CYTHON_INLINE char __Pyx_PyInt_AsChar(PyObject* x) {\n const char neg_one = (char)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n if (sizeof(char) < sizeof(long)) {\n long val = __Pyx_PyInt_AsLong(x);\n if (unlikely(val != (long)(char)val)) {\n if (!unlikely(val == -1 && PyErr_Occurred())) {\n PyErr_SetString(PyExc_OverflowError,\n (is_unsigned && unlikely(val < 0)) ?\n \"can't convert negative value to char\" :\n \"value too large to convert to char\");\n }\n return (char)-1;\n }\n return (char)val;\n }\n return (char)__Pyx_PyInt_AsLong(x);\n}\n\nstatic CYTHON_INLINE short __Pyx_PyInt_AsShort(PyObject* x) {\n const short neg_one = (short)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n if (sizeof(short) < sizeof(long)) {\n long val = __Pyx_PyInt_AsLong(x);\n if (unlikely(val != (long)(short)val)) {\n if (!unlikely(val == -1 && PyErr_Occurred())) {\n PyErr_SetString(PyExc_OverflowError,\n (is_unsigned && unlikely(val < 0)) ?\n \"can't convert negative value to short\" :\n \"value too large to convert to short\");\n }\n return (short)-1;\n }\n return (short)val;\n }\n return (short)__Pyx_PyInt_AsLong(x);\n}\n\nstatic CYTHON_INLINE int __Pyx_PyInt_AsInt(PyObject* x) {\n const int neg_one = (int)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n if (sizeof(int) < sizeof(long)) {\n long val = __Pyx_PyInt_AsLong(x);\n if (unlikely(val != (long)(int)val)) {\n if (!unlikely(val == -1 && PyErr_Occurred())) {\n PyErr_SetString(PyExc_OverflowError,\n (is_unsigned && unlikely(val < 0)) ?\n \"can't convert negative value to int\" :\n \"value too large to convert to int\");\n }\n return (int)-1;\n }\n return (int)val;\n }\n return (int)__Pyx_PyInt_AsLong(x);\n}\n\nstatic CYTHON_INLINE signed char __Pyx_PyInt_AsSignedChar(PyObject* x) {\n const signed char neg_one = (signed char)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n if (sizeof(signed char) < sizeof(long)) {\n long val = __Pyx_PyInt_AsLong(x);\n if (unlikely(val != (long)(signed char)val)) {\n if (!unlikely(val == -1 && PyErr_Occurred())) {\n PyErr_SetString(PyExc_OverflowError,\n (is_unsigned && unlikely(val < 0)) ?\n \"can't convert negative value to signed char\" :\n \"value too large to convert to signed char\");\n }\n return (signed char)-1;\n }\n return (signed char)val;\n }\n return (signed char)__Pyx_PyInt_AsSignedLong(x);\n}\n\nstatic CYTHON_INLINE signed short __Pyx_PyInt_AsSignedShort(PyObject* x) {\n const signed short neg_one = (signed short)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n if (sizeof(signed short) < sizeof(long)) {\n long val = __Pyx_PyInt_AsLong(x);\n if (unlikely(val != (long)(signed short)val)) {\n if (!unlikely(val == -1 && PyErr_Occurred())) {\n PyErr_SetString(PyExc_OverflowError,\n (is_unsigned && unlikely(val < 0)) ?\n \"can't convert negative value to signed short\" :\n \"value too large to convert to signed short\");\n }\n return (signed short)-1;\n }\n return (signed short)val;\n }\n return (signed short)__Pyx_PyInt_AsSignedLong(x);\n}\n\nstatic CYTHON_INLINE signed int __Pyx_PyInt_AsSignedInt(PyObject* x) {\n const signed int neg_one = (signed int)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n if (sizeof(signed int) < sizeof(long)) {\n long val = __Pyx_PyInt_AsLong(x);\n if (unlikely(val != (long)(signed int)val)) {\n if (!unlikely(val == -1 && PyErr_Occurred())) {\n PyErr_SetString(PyExc_OverflowError,\n (is_unsigned && unlikely(val < 0)) ?\n \"can't convert negative value to signed int\" :\n \"value too large to convert to signed int\");\n }\n return (signed int)-1;\n }\n return (signed int)val;\n }\n return (signed int)__Pyx_PyInt_AsSignedLong(x);\n}\n\nstatic CYTHON_INLINE int __Pyx_PyInt_AsLongDouble(PyObject* x) {\n const int neg_one = (int)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n if (sizeof(int) < sizeof(long)) {\n long val = __Pyx_PyInt_AsLong(x);\n if (unlikely(val != (long)(int)val)) {\n if (!unlikely(val == -1 && PyErr_Occurred())) {\n PyErr_SetString(PyExc_OverflowError,\n (is_unsigned && unlikely(val < 0)) ?\n \"can't convert negative value to int\" :\n \"value too large to convert to int\");\n }\n return (int)-1;\n }\n return (int)val;\n }\n return (int)__Pyx_PyInt_AsLong(x);\n}\n\nstatic CYTHON_INLINE unsigned long __Pyx_PyInt_AsUnsignedLong(PyObject* x) {\n const unsigned long neg_one = (unsigned long)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n#if PY_VERSION_HEX < 0x03000000\n if (likely(PyInt_Check(x))) {\n long val = PyInt_AS_LONG(x);\n if (is_unsigned && unlikely(val < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to unsigned long\");\n return (unsigned long)-1;\n }\n return (unsigned long)val;\n } else\n#endif\n if (likely(PyLong_Check(x))) {\n if (is_unsigned) {\n if (unlikely(Py_SIZE(x) < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to unsigned long\");\n return (unsigned long)-1;\n }\n return PyLong_AsUnsignedLong(x);\n } else {\n return PyLong_AsLong(x);\n }\n } else {\n unsigned long val;\n PyObject *tmp = __Pyx_PyNumber_Int(x);\n if (!tmp) return (unsigned long)-1;\n val = __Pyx_PyInt_AsUnsignedLong(tmp);\n Py_DECREF(tmp);\n return val;\n }\n}\n\nstatic CYTHON_INLINE unsigned PY_LONG_LONG __Pyx_PyInt_AsUnsignedLongLong(PyObject* x) {\n const unsigned PY_LONG_LONG neg_one = (unsigned PY_LONG_LONG)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n#if PY_VERSION_HEX < 0x03000000\n if (likely(PyInt_Check(x))) {\n long val = PyInt_AS_LONG(x);\n if (is_unsigned && unlikely(val < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to unsigned PY_LONG_LONG\");\n return (unsigned PY_LONG_LONG)-1;\n }\n return (unsigned PY_LONG_LONG)val;\n } else\n#endif\n if (likely(PyLong_Check(x))) {\n if (is_unsigned) {\n if (unlikely(Py_SIZE(x) < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to unsigned PY_LONG_LONG\");\n return (unsigned PY_LONG_LONG)-1;\n }\n return PyLong_AsUnsignedLongLong(x);\n } else {\n return PyLong_AsLongLong(x);\n }\n } else {\n unsigned PY_LONG_LONG val;\n PyObject *tmp = __Pyx_PyNumber_Int(x);\n if (!tmp) return (unsigned PY_LONG_LONG)-1;\n val = __Pyx_PyInt_AsUnsignedLongLong(tmp);\n Py_DECREF(tmp);\n return val;\n }\n}\n\nstatic CYTHON_INLINE long __Pyx_PyInt_AsLong(PyObject* x) {\n const long neg_one = (long)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n#if PY_VERSION_HEX < 0x03000000\n if (likely(PyInt_Check(x))) {\n long val = PyInt_AS_LONG(x);\n if (is_unsigned && unlikely(val < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to long\");\n return (long)-1;\n }\n return (long)val;\n } else\n#endif\n if (likely(PyLong_Check(x))) {\n if (is_unsigned) {\n if (unlikely(Py_SIZE(x) < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to long\");\n return (long)-1;\n }\n return PyLong_AsUnsignedLong(x);\n } else {\n return PyLong_AsLong(x);\n }\n } else {\n long val;\n PyObject *tmp = __Pyx_PyNumber_Int(x);\n if (!tmp) return (long)-1;\n val = __Pyx_PyInt_AsLong(tmp);\n Py_DECREF(tmp);\n return val;\n }\n}\n\nstatic CYTHON_INLINE PY_LONG_LONG __Pyx_PyInt_AsLongLong(PyObject* x) {\n const PY_LONG_LONG neg_one = (PY_LONG_LONG)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n#if PY_VERSION_HEX < 0x03000000\n if (likely(PyInt_Check(x))) {\n long val = PyInt_AS_LONG(x);\n if (is_unsigned && unlikely(val < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to PY_LONG_LONG\");\n return (PY_LONG_LONG)-1;\n }\n return (PY_LONG_LONG)val;\n } else\n#endif\n if (likely(PyLong_Check(x))) {\n if (is_unsigned) {\n if (unlikely(Py_SIZE(x) < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to PY_LONG_LONG\");\n return (PY_LONG_LONG)-1;\n }\n return PyLong_AsUnsignedLongLong(x);\n } else {\n return PyLong_AsLongLong(x);\n }\n } else {\n PY_LONG_LONG val;\n PyObject *tmp = __Pyx_PyNumber_Int(x);\n if (!tmp) return (PY_LONG_LONG)-1;\n val = __Pyx_PyInt_AsLongLong(tmp);\n Py_DECREF(tmp);\n return val;\n }\n}\n\nstatic CYTHON_INLINE signed long __Pyx_PyInt_AsSignedLong(PyObject* x) {\n const signed long neg_one = (signed long)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n#if PY_VERSION_HEX < 0x03000000\n if (likely(PyInt_Check(x))) {\n long val = PyInt_AS_LONG(x);\n if (is_unsigned && unlikely(val < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to signed long\");\n return (signed long)-1;\n }\n return (signed long)val;\n } else\n#endif\n if (likely(PyLong_Check(x))) {\n if (is_unsigned) {\n if (unlikely(Py_SIZE(x) < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to signed long\");\n return (signed long)-1;\n }\n return PyLong_AsUnsignedLong(x);\n } else {\n return PyLong_AsLong(x);\n }\n } else {\n signed long val;\n PyObject *tmp = __Pyx_PyNumber_Int(x);\n if (!tmp) return (signed long)-1;\n val = __Pyx_PyInt_AsSignedLong(tmp);\n Py_DECREF(tmp);\n return val;\n }\n}\n\nstatic CYTHON_INLINE signed PY_LONG_LONG __Pyx_PyInt_AsSignedLongLong(PyObject* x) {\n const signed PY_LONG_LONG neg_one = (signed PY_LONG_LONG)-1, const_zero = 0;\n const int is_unsigned = neg_one > const_zero;\n#if PY_VERSION_HEX < 0x03000000\n if (likely(PyInt_Check(x))) {\n long val = PyInt_AS_LONG(x);\n if (is_unsigned && unlikely(val < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to signed PY_LONG_LONG\");\n return (signed PY_LONG_LONG)-1;\n }\n return (signed PY_LONG_LONG)val;\n } else\n#endif\n if (likely(PyLong_Check(x))) {\n if (is_unsigned) {\n if (unlikely(Py_SIZE(x) < 0)) {\n PyErr_SetString(PyExc_OverflowError,\n \"can't convert negative value to signed PY_LONG_LONG\");\n return (signed PY_LONG_LONG)-1;\n }\n return PyLong_AsUnsignedLongLong(x);\n } else {\n return PyLong_AsLongLong(x);\n }\n } else {\n signed PY_LONG_LONG val;\n PyObject *tmp = __Pyx_PyNumber_Int(x);\n if (!tmp) return (signed PY_LONG_LONG)-1;\n val = __Pyx_PyInt_AsSignedLongLong(tmp);\n Py_DECREF(tmp);\n return val;\n }\n}\n\nstatic void __Pyx_WriteUnraisable(const char *name) {\n PyObject *old_exc, *old_val, *old_tb;\n PyObject *ctx;\n __Pyx_ErrFetch(&old_exc, &old_val, &old_tb);\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}\n\nstatic 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\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 && !(PY_MAJOR_VERSION==3&&PY_MINOR_VERSION==0)\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#ifndef __PYX_HAVE_RT_ImportType\n#define __PYX_HAVE_RT_ImportType\nstatic PyTypeObject *__Pyx_ImportType(const char *module_name, const char *class_name,\n long size, int strict)\n{\n PyObject *py_module = 0;\n PyObject *result = 0;\n PyObject *py_name = 0;\n char warning[200];\n\n py_module = __Pyx_ImportModule(module_name);\n if (!py_module)\n goto bad;\n #if PY_MAJOR_VERSION < 3\n py_name = PyString_FromString(class_name);\n #else\n py_name = PyUnicode_FromString(class_name);\n #endif\n if (!py_name)\n goto bad;\n result = PyObject_GetAttr(py_module, py_name);\n Py_DECREF(py_name);\n py_name = 0;\n Py_DECREF(py_module);\n py_module = 0;\n if (!result)\n goto bad;\n if (!PyType_Check(result)) {\n PyErr_Format(PyExc_TypeError,\n \"%s.%s is not a type object\",\n module_name, class_name);\n goto bad;\n }\n if (!strict && ((PyTypeObject *)result)->tp_basicsize > size) {\n PyOS_snprintf(warning, sizeof(warning),\n \"%s.%s size changed, may indicate binary incompatibility\",\n module_name, class_name);\n #if PY_VERSION_HEX < 0x02050000\n PyErr_Warn(NULL, warning);\n #else\n PyErr_WarnEx(NULL, warning, 0);\n #endif\n }\n else if (((PyTypeObject *)result)->tp_basicsize != size) {\n PyErr_Format(PyExc_ValueError,\n \"%s.%s has the wrong size, try recompiling\",\n module_name, class_name);\n goto bad;\n }\n return (PyTypeObject *)result;\nbad:\n Py_XDECREF(py_module);\n Py_XDECREF(result);\n return 0;\n}\n#endif\n\n#ifndef __PYX_HAVE_RT_ImportModule\n#define __PYX_HAVE_RT_ImportModule\nstatic PyObject *__Pyx_ImportModule(const char *name) {\n PyObject *py_name = 0;\n PyObject *py_module = 0;\n\n #if PY_MAJOR_VERSION < 3\n py_name = PyString_FromString(name);\n #else\n py_name = PyUnicode_FromString(name);\n #endif\n if (!py_name)\n goto bad;\n py_module = PyImport_Import(py_name);\n Py_DECREF(py_name);\n return py_module;\nbad:\n Py_XDECREF(py_name);\n return 0;\n}\n#endif\n\n#include \"compile.h\"\n#include \"frameobject.h\"\n#include \"traceback.h\"\n\nstatic void __Pyx_AddTraceback(const char *funcname) {\n PyObject *py_srcfile = 0;\n PyObject *py_funcname = 0;\n PyObject *py_globals = 0;\n PyCodeObject *py_code = 0;\n PyFrameObject *py_frame = 0;\n\n #if PY_MAJOR_VERSION < 3\n py_srcfile = PyString_FromString(__pyx_filename);\n #else\n py_srcfile = PyUnicode_FromString(__pyx_filename);\n #endif\n if (!py_srcfile) goto bad;\n if (__pyx_clineno) {\n #if PY_MAJOR_VERSION < 3\n py_funcname = PyString_FromFormat( \"%s (%s:%d)\", funcname, __pyx_cfilenm, __pyx_clineno);\n #else\n py_funcname = PyUnicode_FromFormat( \"%s (%s:%d)\", funcname, __pyx_cfilenm, __pyx_clineno);\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_globals = PyModule_GetDict(__pyx_m);\n if (!py_globals) goto bad;\n py_code = PyCode_New(\n 0, /*int argcount,*/\n #if PY_MAJOR_VERSION >= 3\n 0, /*int kwonlyargcount,*/\n #endif\n 0, /*int nlocals,*/\n 0, /*int stacksize,*/\n 0, /*int flags,*/\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 __pyx_lineno, /*int firstlineno,*/\n __pyx_empty_bytes /*PyObject *lnotab*/\n );\n if (!py_code) goto bad;\n py_frame = PyFrame_New(\n PyThreadState_GET(), /*PyThreadState *tstate,*/\n py_code, /*PyCodeObject *code,*/\n py_globals, /*PyObject *globals,*/\n 0 /*PyObject *locals*/\n );\n if (!py_frame) goto bad;\n py_frame->f_lineno = __pyx_lineno;\n PyTraceBack_Here(py_frame);\nbad:\n Py_XDECREF(py_srcfile);\n Py_XDECREF(py_funcname);\n Py_XDECREF(py_code);\n Py_XDECREF(py_frame);\n}\n\nstatic 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 /* Python 3+ has unicode identifiers */\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 ++t;\n }\n return 0;\n}\n\n/* Type Conversion Functions */\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}\n\nstatic CYTHON_INLINE PyObject* __Pyx_PyNumber_Int(PyObject* x) {\n PyNumberMethods *m;\n const char *name = NULL;\n PyObject *res = NULL;\n#if PY_VERSION_HEX < 0x03000000\n if (PyInt_Check(x) || PyLong_Check(x))\n#else\n if (PyLong_Check(x))\n#endif\n return Py_INCREF(x), x;\n m = Py_TYPE(x)->tp_as_number;\n#if PY_VERSION_HEX < 0x03000000\n if (m && m->nb_int) {\n name = \"int\";\n res = PyNumber_Int(x);\n }\n else if (m && m->nb_long) {\n name = \"long\";\n res = PyNumber_Long(x);\n }\n#else\n if (m && m->nb_int) {\n name = \"int\";\n res = PyNumber_Long(x);\n }\n#endif\n if (res) {\n#if PY_VERSION_HEX < 0x03000000\n if (!PyInt_Check(res) && !PyLong_Check(res)) {\n#else\n if (!PyLong_Check(res)) {\n#endif\n PyErr_Format(PyExc_TypeError,\n \"__%s__ returned non-%s (type %.200s)\",\n name, name, Py_TYPE(res)->tp_name);\n Py_DECREF(res);\n return NULL;\n }\n }\n else if (!PyErr_Occurred()) {\n PyErr_SetString(PyExc_TypeError,\n \"an integer is required\");\n }\n return res;\n}\n\nstatic CYTHON_INLINE Py_ssize_t __Pyx_PyIndex_AsSsize_t(PyObject* b) {\n Py_ssize_t ival;\n PyObject* x = PyNumber_Index(b);\n if (!x) return -1;\n ival = PyInt_AsSsize_t(x);\n Py_DECREF(x);\n return ival;\n}\n\nstatic CYTHON_INLINE PyObject * __Pyx_PyInt_FromSize_t(size_t ival) {\n#if PY_VERSION_HEX < 0x02050000\n if (ival <= LONG_MAX)\n return PyInt_FromLong((long)ival);\n else {\n unsigned char *bytes = (unsigned char *) &ival;\n int one = 1; int little = (int)*(unsigned char*)&one;\n return _PyLong_FromByteArray(bytes, sizeof(size_t), little, 0);\n }\n#else\n return PyInt_FromSize_t(ival);\n#endif\n}\n\nstatic CYTHON_INLINE size_t __Pyx_PyInt_AsSize_t(PyObject* x) {\n unsigned PY_LONG_LONG val = __Pyx_PyInt_AsUnsignedLongLong(x);\n if (unlikely(val == (unsigned PY_LONG_LONG)-1 && PyErr_Occurred())) {\n return (size_t)-1;\n } else if (unlikely(val != (unsigned PY_LONG_LONG)(size_t)val)) {\n PyErr_SetString(PyExc_OverflowError,\n \"value too large to convert to size_t\");\n return (size_t)-1;\n }\n return (size_t)val;\n}\n\n\n#endif /* Py_PYTHON_H */\n" }, { "path": "src/test/resources/samples/langs/CLIPS/demo.clp", "content": ";;;***************************\n;;;* DEFFACTS KNOWLEDGE BASE *\n;;;***************************\n\n(deffacts MAIN::knowledge-base\n (welcome (message WelcomeMessage))\n (goal (variable type.animal))\n (legalanswers (values yes no))\n (displayanswers (values \"Yes\" \"No\"))\n (rule (if backbone is yes) \n (then superphylum is backbone))\n (rule (if backbone is no) \n (then superphylum is jellyback))\n (question (variable backbone)\n (query backbone.query))\n (rule (if superphylum is backbone and\n warm.blooded is yes) \n (then phylum is warm))\n (rule (if superphylum is backbone and\n warm.blooded is no) \n (then phylum is cold))\n (question (variable warm.blooded)\n (query warm.blooded.query))\n (rule (if superphylum is jellyback and\n live.prime.in.soil is yes) \n (then phylum is soil))\n (rule (if superphylum is jellyback and\n live.prime.in.soil is no) \n (then phylum is elsewhere))\n (question (variable live.prime.in.soil)\n (query live.prime.in.soil.query))\n (rule (if phylum is warm and\n has.breasts is yes) \n (then class is breasts))\n (rule (if phylum is warm and\n has.breasts is no) \n (then type.animal is bird))\n (question (variable has.breasts)\n (query has.breasts.query))\n (rule (if phylum is cold and\n always.in.water is yes) \n (then class is water))\n (rule (if phylum is cold and\n always.in.water is no) \n (then class is dry))\n (question (variable always.in.water)\n (query always.in.water.query))\n (rule (if phylum is soil and\n flat.bodied is yes) \n (then type.animal is flatworm))\n (rule (if phylum is soil and\n flat.bodied is no) \n (then type.animal is worm.leech))\n (question (variable flat.bodied)\n (query flat.bodied.query))\n (rule (if phylum is elsewhere and\n body.in.segments is yes) \n (then class is segments))\n (rule (if phylum is elsewhere and\n body.in.segments is no) \n (then class is unified))\n (question (variable body.in.segments)\n (query body.in.segments.query))\n (rule (if class is breasts and\n can.eat.meat is yes) \n (then order is meat))\n (rule (if class is breasts and\n can.eat.meat is no) \n (then order is vegy))\n (question (variable can.eat.meat)\n (query can.eat.meat.query))\n (rule (if class is water and\n boney is yes) \n (then type.animal is fish))\n (rule (if class is water and\n boney is no) \n (then type.animal is shark.ray))\n (question (variable boney)\n (query boney.query))\n (rule (if class is dry and\n scaly is yes) \n (then order is scales))\n (rule (if class is dry and\n scaly is no) \n (then order is soft))\n (question (variable scaly)\n (query scaly.query))\n (rule (if class is segments and\n shell is yes) \n (then order is shell))\n (rule (if class is segments and\n shell is no) \n (then type.animal is centipede.millipede.insect))\n (question (variable shell)\n (query shell.query))\n (rule (if class is unified and\n digest.cells is yes) \n (then order is cells))\n (rule (if class is unified and\n digest.cells is no) \n (then order is stomach))\n (question (variable digest.cells)\n (query digest.cells.query))\n (rule (if order is meat and\n fly is yes) \n (then type.animal is bat))\n (rule (if order is meat and\n fly is no) \n (then family is nowings))\n (question (variable fly)\n (query fly.query))\n (rule (if order is vegy and\n hooves is yes) \n (then family is hooves))\n (rule (if order is vegy and\n hooves is no) \n (then family is feet))\n (question (variable hooves)\n (query hooves.query))\n (rule (if order is scales and\n rounded.shell is yes) \n (then type.animal is turtle))\n (rule (if order is scales and\n rounded.shell is no) \n (then family is noshell))\n (question (variable rounded.shell)\n (query rounded.shell.query))\n (rule (if order is soft and\n jump is yes) \n (then type.animal is frog))\n (rule (if order is soft and\n jump is no) \n (then type.animal is salamander))\n (question (variable jump)\n (query jump.query))\n (rule (if order is shell and\n tail is yes) \n (then type.animal is lobster))\n (rule (if order is shell and\n tail is no) \n (then type.animal is crab))\n (question (variable tail)\n (query tail.query))\n (rule (if order is cells and\n stationary is yes) \n (then family is stationary))\n (rule (if order is cells and\n stationary is no) \n (then type.animal is jellyfish))\n (question (variable stationary)\n (query stationary.query))\n (rule (if order is stomach and\n multicelled is yes) \n (then family is multicelled))\n (rule (if order is stomach and\n multicelled is no) \n (then type.animal is protozoa))\n (question (variable multicelled)\n (query multicelled.query))\n (rule (if family is nowings and\n opposing.thumb is yes) \n (then genus is thumb))\n (rule (if family is nowings and\n opposing.thumb is no) \n (then genus is nothumb))\n (question (variable opposing.thumb)\n (query opposing.thumb.query))\n (rule (if family is hooves and\n two.toes is yes) \n (then genus is twotoes))\n (rule (if family is hooves and\n two.toes is no) \n (then genus is onetoe))\n (question (variable two.toes)\n (query two.toes.query))\n (rule (if family is feet and\n live.in.water is yes) \n (then genus is water))\n (rule (if family is feet and\n live.in.water is no) \n (then genus is dry))\n (question (variable live.in.water)\n (query live.in.water.query))\n (rule (if family is noshell and\n limbs is yes) \n (then type.animal is crocodile.alligator))\n (rule (if family is noshell and\n limbs is no) \n (then type.animal is snake))\n (question (variable limbs)\n (query limbs.query))\n (rule (if family is stationary and\n spikes is yes) \n (then type.animal is sea.anemone))\n (rule (if family is stationary and\n spikes is no) \n (then type.animal is coral.sponge))\n (question (variable spikes)\n (query spikes.query))\n (rule (if family is multicelled and\n spiral.shell is yes) \n (then type.animal is snail))\n (rule (if family is multicelled and\n spiral.shell is no) \n (then genus is noshell))\n (question (variable spiral.shell)\n (query spiral.shell.query))\n (rule (if genus is thumb and\n prehensile.tail is yes) \n (then type.animal is monkey))\n (rule (if genus is thumb and\n prehensile.tail is no) \n (then species is notail))\n (question (variable prehensile.tail)\n (query prehensile.tail.query))\n (rule (if genus is nothumb and\n over.400 is yes) \n (then species is 400))\n (rule (if genus is nothumb and\n over.400 is no) \n (then species is under400))\n (question (variable over.400)\n (query over.400.query))\n (rule (if genus is twotoes and\n horns is yes) \n (then species is horns))\n (rule (if genus is twotoes and\n horns is no) \n (then species is nohorns))\n (question (variable horns)\n (query horns.query))\n (rule (if genus is onetoe and\n plating is yes) \n (then type.animal is rhinoceros))\n (rule (if genus is onetoe and\n plating is no) \n (then type.animal is horse.zebra))\n (question (variable plating)\n (query plating.query))\n (rule (if genus is water and\n hunted is yes) \n (then type.animal is whale))\n (rule (if genus is water and\n hunted is no) \n (then type.animal is dolphin.porpoise))\n (question (variable hunted)\n (query hunted.query))\n (rule (if genus is dry and\n front.teeth is yes) \n (then species is teeth))\n (rule (if genus is dry and\n front.teeth is no) \n (then species is noteeth))\n (question (variable front.teeth)\n (query front.teeth.query))\n (rule (if genus is noshell and\n bivalve is yes) \n (then type.animal is clam.oyster))\n (rule (if genus is noshell and\n bivalve is no) \n (then type.animal is squid.octopus))\n (question (variable bivalve)\n (query bivalve.query))\n (rule (if species is notail and\n nearly.hairless is yes) \n (then type.animal is man))\n (rule (if species is notail and\n nearly.hairless is no) \n (then subspecies is hair))\n (question (variable nearly.hairless)\n (query nearly.hairless.query))\n (rule (if species is 400 and\n land.based is yes) \n (then type.animal is bear.tiger.lion))\n (rule (if species is 400 and\n land.based is no) \n (then type.animal is walrus))\n (question (variable land.based)\n (query land.based.query))\n (rule (if species is under400 and\n thintail is yes) \n (then type.animal is cat))\n (rule (if species is under400 and\n thintail is no) \n (then type.animal is coyote.wolf.fox.dog))\n (question (variable thintail)\n (query thintail.query))\n (rule (if species is nohorns and\n lives.in.desert is yes) \n (then type.animal is camel))\n (rule (if species is nohorns and\n lives.in.desert is no and\n semi.aquatic is no) \n (then type.animal is giraffe))\n (rule (if species is nohorns and\n lives.in.desert is no and\n semi.aquatic is yes) \n (then type.animal is hippopotamus))\n (question (variable lives.in.desert)\n (query lives.in.desert.query))\n (question (variable semi.aquatic)\n (query semi.aquatic.query))\n (rule (if species is teeth and\n large.ears is yes) \n (then type.animal is rabbit))\n (rule (if species is teeth and\n large.ears is no)\n (then type.animal is rat.mouse.squirrel.beaver.porcupine))\n (question (variable large.ears)\n (query large.ears.query))\n (rule (if species is noteeth and\n pouch is yes) \n (then type.animal is kangaroo.koala.bear))\n (rule (if species is noteeth and\n pouch is no) \n (then type.animal is mole.shrew.elephant))\n (question (variable pouch)\n (query pouch.query))\n (rule (if subspecies is hair and\n long.powerful.arms is yes) \n (then type.animal is orangutan.gorilla.chimpanzee))\n (rule (if subspecies is hair and\n long.powerful.arms is no) \n (then type.animal is baboon))\n (question (variable long.powerful.arms)\n (query long.powerful.arms.query))\n (rule (if species is horns and\n fleece is yes) \n (then type.animal is sheep.goat))\n (rule (if species is horns and\n fleece is no) \n (then subsubspecies is nofleece))\n (question (variable fleece)\n (query fleece.query))\n (rule (if subsubspecies is nofleece and\n domesticated is yes) \n (then type.animal is cow))\n (rule (if subsubspecies is nofleece and\n domesticated is no) \n (then type.animal is deer.moose.antelope))\n (question (variable domesticated)\n (query domesticated.query))\n (answer (prefix \"I think your animal is a \") (variable type.animal) (postfix \".\")))\n" }, { "path": "src/test/resources/samples/langs/CLIPS/sudoku.clp", "content": ";;; http://www.angusj.com/sudoku/hints\n;;; http://www.scanraid.com/BasicStrategies.htm\n;;; http://www.sudokuoftheday.com/pages/techniques-overview\n;;; http://www.sudokuonline.us/sudoku_solving_techniques\n;;; http://www.sadmansoftware.com/sudoku/techniques.htm\n;;; http://www.krazydad.com/blog/2005/09/29/an-index-of-sudoku-strategies/\n\n;;; #######################\n;;; DEFTEMPLATES & DEFFACTS\n;;; #######################\n\n(deftemplate possible\n (slot row)\n (slot column)\n (slot value)\n (slot group)\n (slot id))\n \n(deftemplate impossible\n (slot id)\n (slot value)\n (slot priority)\n (slot reason))\n \n(deftemplate technique-employed\n (slot reason)\n (slot priority))\n\n(deftemplate technique\n (slot name)\n (slot priority))\n \n(deffacts startup\n (phase grid-values))\n\n(deftemplate size-value\n (slot size)\n (slot value))\n \n(deffacts values\n (size-value (size 1) (value 1))\n (size-value (size 2) (value 2))\n (size-value (size 2) (value 3))\n (size-value (size 2) (value 4))\n (size-value (size 3) (value 5))\n (size-value (size 3) (value 6))\n (size-value (size 3) (value 7))\n (size-value (size 3) (value 8))\n (size-value (size 3) (value 9))\n (size-value (size 4) (value 10))\n (size-value (size 4) (value 11))\n (size-value (size 4) (value 12))\n (size-value (size 4) (value 13))\n (size-value (size 4) (value 14))\n (size-value (size 4) (value 15))\n (size-value (size 4) (value 16))\n (size-value (size 5) (value 17))\n (size-value (size 5) (value 18))\n (size-value (size 5) (value 19))\n (size-value (size 5) (value 20))\n (size-value (size 5) (value 21))\n (size-value (size 5) (value 22))\n (size-value (size 5) (value 23))\n (size-value (size 5) (value 24))\n (size-value (size 5) (value 25)))\n \n;;; ###########\n;;; SETUP RULES\n;;; ###########\n\n;;; ***********\n;;; stress-test\n;;; ***********\n\n(defrule stress-test\n \n (declare (salience 10))\n \n (phase match)\n \n (stress-test)\n \n (priority ?last)\n \n (not (priority ?p&:(> ?p ?last)))\n \n (technique (priority ?next&:(> ?next ?last)))\n \n (not (technique (priority ?p&:(> ?p ?last)&:(< ?p ?next))))\n \n =>\n \n (assert (priority ?next)))\n \n;;; *****************\n;;; enable-techniques\n;;; *****************\n\n(defrule enable-techniques\n\n (declare (salience 10))\n \n (phase match)\n \n (size ?)\n \n (not (possible (value any)))\n \n =>\n \n (assert (priority 1)))\n\n;;; **********\n;;; expand-any\n;;; **********\n\n(defrule expand-any\n\n (declare (salience 10))\n\n (phase expand-any)\n \n ?f <- (possible (row ?r) (column ?c) (value any) (group ?g) (id ?id))\n \n (not (possible (value any) (id ?id2&:(< ?id2 ?id))))\n \n (size ?s)\n \n (size-value (size ?as&:(<= ?as ?s)) (value ?v))\n \n (not (possible (row ?r) (column ?c) (value ?v)))\n \n (not (and (size-value (value ?v2&:(< ?v2 ?v)))\n \n (not (possible (row ?r) (column ?c) (value ?v2)))))\n \n =>\n \n (assert (possible (row ?r) (column ?c) (value ?v) (group ?g) (id ?id))))\n \n;;; *****************\n;;; position-expanded\n;;; *****************\n\n(defrule position-expanded\n\n (declare (salience 10))\n\n (phase expand-any)\n \n ?f <- (possible (row ?r) (column ?c) (value any) (group ?g) (id ?id))\n \n (size ?s)\n \n (not (and (size-value (size ?as&:(<= ?as ?s)) (value ?v))\n \n (not (possible (row ?r) (column ?c) (value ?v)))))\n\n =>\n \n (retract ?f))\n \n;;; ###########\n;;; PHASE RULES\n;;; ###########\n\n;;; ***************\n;;; expand-any-done\n;;; ***************\n\n(defrule expand-any-done\n\n (declare (salience 10))\n\n ?f <- (phase expand-any)\n\n (not (possible (value any)))\n \n =>\n \n (retract ?f)\n \n (assert (phase initial-output))\n (assert (print-position 1 1)))\n \n;;; ***********\n;;; begin-match\n;;; ***********\n\n(defrule begin-match\n\n (declare (salience -20))\n \n ?f <- (phase initial-output)\n \n =>\n \n (retract ?f)\n \n (assert (phase match)))\n\n;;; *****************\n;;; begin-elimination\n;;; *****************\n\n(defrule begin-elimination\n\n (declare (salience -20))\n \n ?f <- (phase match)\n \n (not (not (impossible)))\n \n =>\n \n (retract ?f)\n \n (assert (phase elimination)))\n\n;;; *************\n;;; next-priority\n;;; *************\n\n(defrule next-priority\n\n (declare (salience -20))\n \n (phase match)\n \n (not (impossible))\n \n (priority ?last)\n \n (not (priority ?p&:(> ?p ?last)))\n \n (technique (priority ?next&:(> ?next ?last)))\n \n (not (technique (priority ?p&:(> ?p ?last)&:(< ?p ?next))))\n \n =>\n \n (assert (priority ?next)))\n\n;;; ************\n;;; begin-output\n;;; ************\n\n(defrule begin-output\n\n (declare (salience -20))\n \n ?f <- (phase match)\n \n (not (impossible))\n \n (priority ?last)\n \n (not (priority ?p&:(> ?p ?last)))\n\n (not (technique (priority ?next&:(> ?next ?last))))\n \n =>\n \n (retract ?f)\n \n (assert (phase final-output))\n (assert (print-position 1 1)))\n\n \n\n \n \n \n \n \n \n \n \n \n \n \n" }, { "path": "src/test/resources/samples/langs/CMake/filenames/CMakeLists.txt", "content": "cmake_minimum_required(VERSION 2.8)\n\nproject(Foo)\n\nset(CMAKE_SKIP_RPATH TRUE)\nset(CMAKE_INSTALL_PREFIX \"/usr/local\")\n\nadd_subdirectory(bar)\n\nadd_executable(foo foo.c)\ntarget_link_libraries(foo pthread)\ninstall(TARGETS foo DESTINATION bin)\n" }, { "path": "src/test/resources/samples/langs/CMake/sample1.cmake", "content": "cmake_minimum_required(VERSION 2.6)\n\nenable_testing()\n\nset(CMAKE_BUILD_TYPE debug)\n\ninclude_directories(\"/usr/local/include\")\n\nfind_library(ssl_LIBRARY NAMES ssl PATHS \"/usr/local/lib\")\n\nadd_custom_command(OUTPUT \"ver.c\" \"ver.h\" COMMAND ./ver.sh)\n\nadd_executable(foo foo.c bar.c baz.c ver.c)\n\ntarget_link_libraries(foo ${ssl_LIBRARY})\n" }, { "path": "src/test/resources/samples/langs/CMake/sample2.cmake", "content": "cmake_minimum_required(VERSION 2.8 FATAL_ERROR)\n \nproject(PCLVisualizer)\ntarget_link_libraries (PCLVisualizer ${PCL_LIBRARIES})\n\n#it seems it's needed only on OS X 10.9\nfind_package(GLEW REQUIRED)\nset(CMAKE_CXX_FLAGS \"${CMAKE_CXX_FLAGS} -I/usr/include -v\")\n\nfind_package(PCL 1.7 REQUIRED)\n \ninclude_directories(${PCL_INCLUDE_DIRS})\nlink_directories(${PCL_LIBRARY_DIRS})\nadd_definitions(${PCL_DEFINITIONS})\n \nset(PCL_BUILD_TYPE Release)\n \nfile(GLOB PCL_openni_viewer_SRC\n \"src/*.h\"\n \"src/*.cpp\"\n)\nadd_executable(PCLVisualizer ${PCL_openni_viewer_SRC})\n\n#add this line to solve probem in mac os x 10.9\ntarget_link_libraries(PCLVisualizer ${PCL_COMMON_LIBRARIES} ${PCL_IO_LIBRARIES} ${PCL_VISUALIZATION_LIBRARIES} ${PCL_FEATURES_LIBRARIES}) " }, { "path": "src/test/resources/samples/langs/CMake/sample3.cmake", "content": "# Specifications for building user and development documentation.\n#\n# ====================================================================\n# Copyright (c) 2009 Ian Blumel. All rights reserved.\n# \n# This software is licensed as described in the file LICENSE, which\n# you should have received as part of this distribution. \n# ====================================================================\n\nCMAKE_MINIMUM_REQUIRED(VERSION 2.6)\n\nFIND_FILE( SPHINX sphinx-build.exe) \n\n# If we are windows call to the make.bat file, otherwise rely on the Makefile\n# to handle the processing.\nIF(WIN32)\n SET(SPHINX_MAKE make.bat)\nELSE(WIN32)\n SET(SPHINX_MAKE make)\nENDIF(WIN32)\n\nADD_CUSTOM_TARGET(\n doc_usr\n COMMAND ${SPHINX_MAKE} html\n WORKING_DIRECTORY ${CMAKE_CURRENT_SOURCE_DIR}/usr\n)\n\nADD_CUSTOM_TARGET(\n doc_dev\n COMMAND ${SPHINX_MAKE} html\n WORKING_DIRECTORY ${CMAKE_CURRENT_SOURCE_DIR}/dev\n)\n\n" }, { "path": "src/test/resources/samples/langs/CMake/sample4.cmake", "content": "cmake_minimum_required (VERSION 2.6)\n\nset (CMAKE_RUNTIME_OUTPUT_DIRECTORY \"bin\")\n\nlist(APPEND CMAKE_MODULE_PATH ${CMAKE_SOURCE_DIR}/cmake/vala)\nfind_package(Vala REQUIRED)\ninclude(ValaPrecompile)\ninclude(ValaVersion)\nensure_vala_version(\"0.11.0\" MINIMUM)\n\nproject (template C)\n\nfind_package(PkgConfig)\n\npkg_check_modules(GOBJECT REQUIRED gobject-2.0)\nadd_definitions(${GOBJECT_CFLAGS} ${GOBJECT_CFLAGS_OTHER})\nlink_libraries(${GOBJECT_LIBRARIES})\nlink_directories(${GOBJECT_LIBRARY_DIRS})\n\n\nvala_precompile(VALA_C\n src/template.vala\nPACKAGES\nOPTIONS\n --thread\nCUSTOM_VAPIS\nGENERATE_VAPI\nGENERATE_HEADER\nDIRECTORY\n\tgen\n)\n\nadd_executable(\"template\" ${VALA_C})\n" }, { "path": "src/test/resources/samples/langs/CMake/sample5.cmake", "content": "# - Check if the STDCALL function exists.\n# This works for non-cdecl functions (kernel32 functions, for example)\n# CHECK_STDCALL_FUNCTION_EXISTS(FUNCTION FUNCTION_DUMMY_ARGS VARIABLE)\n# - macro which checks if the stdcall function exists\n# FUNCTION_DECLARATION - the definition of the function ( e.g.: Sleep(500) )\n# VARIABLE - variable to store the result\n#\n# The following variables may be set before calling this macro to\n# modify the way the check is run:\n#\n# CMAKE_REQUIRED_FLAGS = string of compile command line flags\n# CMAKE_REQUIRED_DEFINITIONS = list of macros to define (-DFOO=bar)\n# CMAKE_REQUIRED_INCLUDES = list of include directories\n# CMAKE_REQUIRED_LIBRARIES = list of libraries to link\n# CMAKE_EXTRA_INCLUDE_FILES = list of extra includes to check in\n\nMACRO(CHECK_STDCALL_FUNCTION_EXISTS FUNCTION_DECLARATION VARIABLE)\n IF(\"${VARIABLE}\" MATCHES \"^${VARIABLE}$\")\n #get includes \n SET(CHECK_STDCALL_FUNCTION_PREMAIN)\n FOREACH(def ${CMAKE_EXTRA_INCLUDE_FILES})\n SET(CHECK_STDCALL_FUNCTION_PREMAIN \"${CHECK_STDCALL_FUNCTION_PREMAIN}#include \\\"${def}\\\"\\n\")\n ENDFOREACH(def)\n \n #add some default includes\n IF ( HAVE_WINDOWS_H )\n SET(CHECK_STDCALL_FUNCTION_PREMAIN \"${CHECK_STDCALL_FUNCTION_PREMAIN}#include \\\"windows.h\\\"\\n\")\n ENDIF ( HAVE_WINDOWS_H )\n IF ( HAVE_UNISTD_H )\n SET(CHECK_STDCALL_FUNCTION_PREMAIN \"${CHECK_STDCALL_FUNCTION_PREMAIN}#include \\\"unistd.h\\\"\\n\")\n ENDIF ( HAVE_UNISTD_H )\n IF ( HAVE_DIRECT_H )\n SET(CHECK_STDCALL_FUNCTION_PREMAIN \"${CHECK_STDCALL_FUNCTION_PREMAIN}#include \\\"direct.h\\\"\\n\")\n ENDIF ( HAVE_DIRECT_H )\n IF ( HAVE_IO_H )\n SET(CHECK_STDCALL_FUNCTION_PREMAIN \"${CHECK_STDCALL_FUNCTION_PREMAIN}#include \\\"io.h\\\"\\n\")\n ENDIF ( HAVE_IO_H )\n IF ( HAVE_SYS_TIMEB_H )\n SET(CHECK_STDCALL_FUNCTION_PREMAIN \"${CHECK_STDCALL_FUNCTION_PREMAIN}#include \\\"sys/timeb.h\\\"\\n\")\n ENDIF ( HAVE_SYS_TIMEB_H )\n \n STRING(REGEX REPLACE \"(\\\\(.*\\\\))\" \"\" CHECK_STDCALL_FUNCTION_EXISTS_FUNCTION ${FUNCTION_DECLARATION} )\n \n SET(MACRO_CHECK_STDCALL_FUNCTION_DEFINITIONS \"${CMAKE_REQUIRED_FLAGS}\")\n MESSAGE(STATUS \"Looking for ${CHECK_STDCALL_FUNCTION_EXISTS_FUNCTION}\")\n \n IF(CMAKE_REQUIRED_LIBRARIES)\n SET(CHECK_STDCALL_FUNCTION_EXISTS_ADD_LIBRARIES\n \"-DLINK_LIBRARIES:STRING=${CMAKE_REQUIRED_LIBRARIES}\")\n ELSE(CMAKE_REQUIRED_LIBRARIES)\n SET(CHECK_STDCALL_FUNCTION_EXISTS_ADD_LIBRARIES)\n ENDIF(CMAKE_REQUIRED_LIBRARIES)\n \n IF(CMAKE_REQUIRED_INCLUDES)\n SET(CHECK_STDCALL_FUNCTION_EXISTS_ADD_INCLUDES\n \"-DINCLUDE_DIRECTORIES:STRING=${CMAKE_REQUIRED_INCLUDES}\")\n ELSE(CMAKE_REQUIRED_INCLUDES)\n SET(CHECK_STDCALL_FUNCTION_EXISTS_ADD_INCLUDES)\n ENDIF(CMAKE_REQUIRED_INCLUDES)\n \n SET(CHECK_STDCALL_FUNCTION_DECLARATION ${FUNCTION_DECLARATION})\n CONFIGURE_FILE(\"${clucene-shared_SOURCE_DIR}/cmake/CheckStdCallFunctionExists.cpp.in\"\n \"${CMAKE_BINARY_DIR}${CMAKE_FILES_DIRECTORY}/CMakeTmp/CheckStdCallFunctionExists.cpp\" IMMEDIATE @ONLY)\n FILE(READ \"${CMAKE_BINARY_DIR}${CMAKE_FILES_DIRECTORY}/CMakeTmp/CheckStdCallFunctionExists.cpp\"\n CHECK_STDCALL_FUNCTION_CONTENT)\n\n TRY_COMPILE(${VARIABLE}\n ${CMAKE_BINARY_DIR}\n \"${CMAKE_BINARY_DIR}${CMAKE_FILES_DIRECTORY}/CMakeTmp/CheckStdCallFunctionExists.cpp\"\n COMPILE_DEFINITIONS ${CMAKE_REQUIRED_DEFINITIONS}\n CMAKE_FLAGS -DCOMPILE_DEFINITIONS:STRING=${MACRO_CHECK_STDCALL_FUNCTION_DEFINITIONS}\n \"${CHECK_STDCALL_FUNCTION_EXISTS_ADD_LIBRARIES}\"\n \"${CHECK_STDCALL_FUNCTION_EXISTS_ADD_INCLUDES}\"\n OUTPUT_VARIABLE OUTPUT)\n IF(${VARIABLE})\n SET(${VARIABLE} 1 CACHE INTERNAL \"Have function ${FUNCTION_DECLARATION}\")\n MESSAGE(STATUS \"Looking for ${FUNCTION_DECLARATION} - found\")\n FILE(APPEND ${CMAKE_BINARY_DIR}${CMAKE_FILES_DIRECTORY}/CMakeOutput.log \n \"Determining if the stdcall function ${FUNCTION_DECLARATION} exists passed with the following output:\\n\"\n \"${OUTPUT}\\nCheckStdCallFunctionExists.cpp:\\n${CHECK_STDCALL_FUNCTION_CONTENT}\\n\\n\")\n ELSE(${VARIABLE})\n MESSAGE(STATUS \"Looking for ${FUNCTION_DECLARATION} - not found\")\n SET(${VARIABLE} \"\" CACHE INTERNAL \"Have function ${FUNCTION_DECLARATION}\")\n FILE(APPEND ${CMAKE_BINARY_DIR}${CMAKE_FILES_DIRECTORY}/CMakeError.log \n \"Determining if the stdcall function ${FUNCTION_DECLARATION} exists failed with the following output:\\n\"\n \"${OUTPUT}\\nCheckStdCallFunctionExists.cpp:\\n${CHECK_STDCALL_FUNCTION_CONTENT}\\n\\n\")\n ENDIF(${VARIABLE})\n ENDIF(\"${VARIABLE}\" MATCHES \"^${VARIABLE}$\")\nENDMACRO(CHECK_STDCALL_FUNCTION_EXISTS)\n" }, { "path": "src/test/resources/samples/langs/CMake/uninstall.cmake.in", "content": "IF (NOT EXISTS \"@PROJECT_BINARY_DIR@/install_manifest.txt\")\n MESSAGE (FATAL_ERROR \"Cannot find install manifest: \\\"@PROJECT_BINARY_DIR@/install_manifest.txt\\\"\")\nENDIF (NOT EXISTS \"@PROJECT_BINARY_DIR@/install_manifest.txt\")\n\nFILE (READ \"@PROJECT_BINARY_DIR@/install_manifest.txt\" files)\nSTRING (REGEX REPLACE \"\\n\" \";\" files \"${files}\")\nFOREACH (file ${files})\n MESSAGE (STATUS \"Uninstalling \\\"$ENV{DESTDIR}${file}\\\"\")\n IF (EXISTS \"$ENV{DESTDIR}${file}\")\n EXEC_PROGRAM (\n \"@CMAKE_COMMAND@\" ARGS \"-E remove \\\"$ENV{DESTDIR}${file}\\\"\"\n OUTPUT_VARIABLE rm_out\n RETURN_VALUE rm_retval\n )\n IF (NOT \"${rm_retval}\" STREQUAL 0)\n MESSAGE (FATAL_ERROR \"Problem when removing \\\"$ENV{DESTDIR}${file}\\\"\")\n ENDIF (NOT \"${rm_retval}\" STREQUAL 0)\n ELSE (EXISTS \"$ENV{DESTDIR}${file}\")\n MESSAGE (STATUS \"File \\\"$ENV{DESTDIR}${file}\\\" does not exist.\")\n ENDIF (EXISTS \"$ENV{DESTDIR}${file}\")\nENDFOREACH (file)\n\n" }, { "path": "src/test/resources/samples/langs/COBOL/hello_world.cbl", "content": " program-id. hello.\n procedure division.\n display \"Hello, World!\".\n stop run.\n\n" }, { "path": "src/test/resources/samples/langs/COBOL/hello_world.ccp", "content": " IDENTIFICATION DIVISION.\n PROGRAM-ID. hello.\n PROCEDURE DIVISION.\n DISPLAY \"Hello World, yet again.\".\n STOP RUN.\n\n" }, { "path": "src/test/resources/samples/langs/COBOL/hello_world.cob", "content": " IDENTIFICATION DIVISION.\n PROGRAM-ID. hello.\n PROCEDURE DIVISION.\n DISPLAY \"Hello World!\".\n STOP RUN.\n\n" }, { "path": "src/test/resources/samples/langs/COBOL/simple.cpy", "content": "01 COBOL-TEST-RECORD.\n 05 COBOL-TEST-USAGES.\n 10 COBOL-4-COMP PIC S9(4) COMP.\n 10 COBOL-8-COMP PIC S9(8) COMP.\n 10 COBOL-9-COMP PIC S9(9) COMP.\n 10 COBOL-4-COMP2 PIC S9(4) COMP-2.\n 10 COBOL-7-COMP2 PIC 9(7) COMP-2.\n" }, { "path": "src/test/resources/samples/langs/CSON/base.cson", "content": "'atom-text-editor':\n # Platform Bindings\n 'home': 'editor:move-to-first-character-of-line'\n 'end': 'editor:move-to-end-of-screen-line'\n 'shift-home': 'editor:select-to-first-character-of-line'\n 'shift-end': 'editor:select-to-end-of-line'\n\n'atom-text-editor:not([mini])':\n # Atom Specific\n 'ctrl-C': 'editor:copy-path'\n\n # Sublime Parity\n 'tab': 'editor:indent'\n 'enter': 'editor:newline'\n 'shift-tab': 'editor:outdent-selected-rows'\n 'ctrl-K': 'editor:delete-line'\n\n'.select-list atom-text-editor[mini]':\n 'enter': 'core:confirm'\n\n'.tool-panel.panel-left, .tool-panel.panel-right':\n 'escape': 'tool-panel:unfocus'\n\n'atom-text-editor !important, atom-text-editor[mini] !important':\n 'escape': 'editor:consolidate-selections'\n\n# allow standard input fields to work correctly\n'body .native-key-bindings':\n 'tab': 'core:focus-next'\n 'shift-tab': 'core:focus-previous'\n 'enter': 'native!'\n 'backspace': 'native!'\n 'shift-backspace': 'native!'\n 'delete': 'native!'\n 'up': 'native!'\n 'down': 'native!'\n 'shift-up': 'native!'\n 'shift-down': 'native!'\n 'alt-up': 'native!'\n 'alt-down': 'native!'\n 'alt-shift-up': 'native!'\n 'alt-shift-down': 'native!'\n 'cmd-up': 'native!'\n 'cmd-down': 'native!'\n 'cmd-shift-up': 'native!'\n 'cmd-shift-down': 'native!'\n 'ctrl-up': 'native!'\n 'ctrl-down': 'native!'\n 'ctrl-shift-up': 'native!'\n 'ctrl-shift-down': 'native!'\n 'left': 'native!'\n 'right': 'native!'\n 'shift-left': 'native!'\n 'shift-right': 'native!'\n 'alt-left': 'native!'\n 'alt-right': 'native!'\n 'alt-shift-left': 'native!'\n 'alt-shift-right': 'native!'\n 'cmd-left': 'native!'\n 'cmd-right': 'native!'\n 'cmd-shift-left': 'native!'\n 'cmd-shift-right': 'native!'\n 'ctrl-left': 'native!'\n 'ctrl-right': 'native!'\n 'ctrl-shift-left': 'native!'\n 'ctrl-shift-right': 'native!'\n 'ctrl-b': 'native!'\n 'ctrl-f': 'native!'\n 'ctrl-F': 'native!'\n 'ctrl-B': 'native!'\n 'ctrl-h': 'native!'\n 'ctrl-d': 'native!'\n" }, { "path": "src/test/resources/samples/langs/CSON/config.cson", "content": "directoryIcons:\n\n\tAtom:\n\t\ticon: \"atom\"\n\t\tmatch: /^\\.atom$/\n\t\tcolour: \"dark-green\"\n\n\tBower:\n\t\ticon: \"bower\"\n\t\tmatch: /^bower[-_]components$/\n\t\tcolour: \"bower\"\n\n\tDropbox:\n\t\ticon: \"dropbox\"\n\t\tmatch: /^(?:Dropbox|\\.dropbox\\.cache)$/\n\t\tcolour: \"medium-blue\"\n\n\tGit:\n\t\ticon: \"git\"\n\t\tmatch: /^\\.git$/\n\n\tGitHub:\n\t\ticon: \"github\"\n\t\tmatch: /^\\.github$/\n\n\tMeteor:\n\t\ticon: \"meteor\"\n\t\tmatch: /^\\.meteor$/\n\n\tNodeJS:\n\t\ticon: \"node\"\n\t\tmatch: /^node_modules$/\n\t\tcolour: \"medium-green\"\n\n\tPackage:\n\t\ticon: \"package\"\n\t\tmatch: /^\\.bundle$/i\n\n\tTextMate:\n\t\ticon: \"textmate\"\n\t\tmatch: \".tmBundle\"\n\n\nfileIcons:\n\n\tABAP:\n\t\ticon: \"abap\"\n\t\tscope: \"abp\"\n\t\tmatch: \".abap\"\n\t\tcolour: \"medium-orange\"\n\n\tActionScript: # Or Flash-related\n\t\ticon: \"as\"\n\t\tmatch: [\n\t\t\t[\".swf\", \"medium-blue\"]\n\t\t\t[\".as\", \"medium-red\", scope: /\\.(?:flex-config|actionscript(?:\\.\\d+)?)$/i, alias: /ActionScript\\s?3|as3/i]\n\t\t\t[\".jsfl\", \"auto-yellow\"]\n\t\t\t[\".swc\", \"dark-red\"]\n\t\t]\n" }, { "path": "src/test/resources/samples/langs/CSON/ff-sfd.cson", "content": "name: \"Spline Font Database\"\nscopeName: \"text.sfd\"\nfileTypes: [\"sfd\"]\nfirstLineMatch: \"^SplineFontDB: [\\\\d.]+\"\npatterns: [include: \"#main\"]\n\nrepository:\n\tmain:\n\t\tpatterns: [\n\t\t\t{include: \"#punctuation\"}\n\t\t\t{include: \"#private\"}\n\t\t\t{include: \"#image\"}\n\t\t\t{include: \"#pickleData\"}\n\t\t\t{include: \"#sections\"}\n\t\t\t{include: \"#copyright\"}\n\t\t\t{include: \"#property\"}\n\t\t\t{include: \"#control\"}\n\t\t\t{include: \"#address\"}\n\t\t\t{include: \"#encoding\"}\n\t\t\t{include: \"source.fontforge#shared\"}\n\t\t\t{include: \"#colour\"}\n\t\t]\n\t\n\tpunctuation:\n\t\tpatterns: [\n\t\t\t{match: \"<|>\", name: \"punctuation.definition.brackets.angle.sfd\"}\n\t\t\t{match: \"[{}]\", name: \"punctuation.definition.brackets.curly.sfd\"}\n\t\t]\n\n\tprivate:\n\t\tname: \"meta.section.private.sfd\"\n\t\tbegin: \"^BeginPrivate(?=:)\"\n\t\tend: \"^EndPrivate\\\\b\"\n\t\tbeginCaptures: 0: name: \"keyword.control.begin.private.sfd\"\n\t\tendCaptures: 0: name: \"keyword.control.end.private.sfd\"\n\t\tpatterns: [\n\t\t\t{match: \"^\\\\S+\", name: \"entity.name.private.property.sfd\"}\n\t\t\t{include: \"$self\"}\n\t\t]\n\t\n\timage:\n\t\tname: \"meta.image.sfd\"\n\t\tbegin: \"^(Image)(?=:)(.+)$\"\n\t\tend: \"^(EndImage)\\\\b\"\n\t\tcontentName: \"string.unquoted.raw.data.sfd\"\n\t\tbeginCaptures:\n\t\t\t1: name: \"keyword.control.begin.image.sfd\"\n\t\t\t2: patterns: [include: \"$self\"]\n\t\tendCaptures:\n\t\t\t1: name: \"keyword.control.end.image.sfd\"\n\n\tpickleData:\n\t\tname: \"meta.pickle-data.sfd\"\n\t\tbegin: \"^(PickledData)(:)\\\\s*(\\\")\"\n\t\tend: '\"'\n\t\tbeginCaptures:\n\t\t\t1: name: \"entity.name.property.sfd\"\n\t\t\t2: name: \"punctuation.separator.dictionary.key-value.sfd\"\n\t\t\t3: name: \"punctuation.definition.string.begin.sfd\"\n\t\tendCaptures:\n\t\t\t0: name: \"punctuation.definition.string.end.sfd\"\n\t\tpatterns: [match: \"\\\\\\\\.\", name: \"constant.character.escape.sfd\"]\n\n\tsections:\n\t\tname: \"meta.section.${2:/downcase}.sfd\"\n\t\tbegin: \"^(Start|Begin)([A-Z]\\\\w+)(?=:)\"\n\t\tend: \"^(End\\\\2)\\\\b\"\n\t\tbeginCaptures: 0: name: \"keyword.control.begin.${2:/downcase}.sfd\"\n\t\tendCaptures: 0: name: \"keyword.control.end.${2:/downcase}.sfd\"\n\t\tpatterns: [include: \"$self\"]\n\n\tcontrol:\n\t\tname: \"keyword.control.${1:/downcase}.sfd\"\n\t\tmatch: \"\\\\b(Fore|Back|SplineSet|^End\\\\w+)\\\\b\"\n\n\tcolour:\n\t\tname: \"constant.other.hex.colour.sfd\"\n\t\tmatch: \"(#)[A-Fa-f0-9]{3,}|(?<=\\\\s)[A-Fa-f0-9]{6,8}\"\n\t\tcaptures:\n\t\t\t1: name: \"punctuation.definition.colour.sfd\"\n\n\tencoding:\n\t\tname: \"constant.language.encoding.sfd\"\n\t\tmatch: \"(?i)\\\\b(ISO[-\\\\w]+)(?<=\\\\d)(?=\\\\s|$)\"\n\n\t# Don't highlight numbers in freeform strings (years/version strings)\n\tcopyright:\n\t\tname: \"meta.${1:/downcase}-string.sfd\"\n\t\tbegin: \"^(Copyright|U?Comments?|\\\\w+Name)(:)\"\n\t\tend: \"$\"\n\t\tbeginCaptures:\n\t\t\t1: name: \"entity.name.property.sfd\"\n\t\t\t2: name: \"punctuation.separator.dictionary.key-value.sfd\"\n\t\tpatterns: [include: \"source.fontforge#stringEscapes\"]\n\t\n\t# No idea what this is, but it looks distracting without a fix\n\t# Assuming it's referring to a memory register or something.\n\taddress:\n\t\tmatch: \"\\\\d+[xX][A-Fa-f0-9]+\"\n\t\tname: \"constant.numeric.hexadecimal.sfd\"\n\t\n\tproperty:\n\t\tmatch: \"^([^:]+)(:)\"\n\t\tname: \"meta.dictionary.key-value.sfd\"\n\t\tcaptures:\n\t\t\t1: name: \"entity.name.property.sfd\"\n\t\t\t2: name: \"punctuation.separator.dictionary.key-value.sfd\"\n\t\n" }, { "path": "src/test/resources/samples/langs/CSON/wercker-status.cson", "content": "'menu': [\n {\n 'label': 'Packages'\n 'submenu': [\n 'label': 'Wercker Status'\n 'submenu': [\n { 'label': 'Check now!', 'command': 'wercker-status:checknow' }\n ]\n ]\n }\n]\n" }, { "path": "src/test/resources/samples/langs/CSS/bootstrap.css", "content": "/*!\n * Bootstrap v2.3.1\n *\n * Copyright 2012 Twitter, Inc\n * Licensed under the Apache License v2.0\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Designed and built with all the love in the world @twitter by @mdo and @fat.\n */\n.clearfix {\n *zoom: 1;\n}\n.clearfix:before,\n.clearfix:after {\n display: table;\n content: \"\";\n line-height: 0;\n}\n.clearfix:after {\n clear: both;\n}\n.hide-text {\n font: 0/0 a;\n color: transparent;\n text-shadow: none;\n background-color: transparent;\n border: 0;\n}\n.input-block-level {\n display: block;\n width: 100%;\n min-height: 30px;\n -webkit-box-sizing: border-box;\n -moz-box-sizing: border-box;\n box-sizing: border-box;\n}\narticle,\naside,\ndetails,\nfigcaption,\nfigure,\nfooter,\nheader,\nhgroup,\nnav,\nsection {\n display: block;\n}\naudio,\ncanvas,\nvideo {\n display: inline-block;\n *display: inline;\n *zoom: 1;\n}\naudio:not([controls]) {\n display: none;\n}\nhtml {\n font-size: 100%;\n -webkit-text-size-adjust: 100%;\n -ms-text-size-adjust: 100%;\n}\na:focus {\n outline: thin dotted #333;\n outline: 5px auto -webkit-focus-ring-color;\n outline-offset: -2px;\n}\na:hover,\na:active {\n outline: 0;\n}\nsub,\nsup {\n position: relative;\n font-size: 75%;\n line-height: 0;\n vertical-align: baseline;\n}\nsup {\n top: -0.5em;\n}\nsub {\n bottom: -0.25em;\n}\nimg {\n /* Responsive images (ensure images don't scale beyond their parents) */\n\n max-width: 100%;\n /* Part 1: Set a maxium relative to the parent */\n\n width: auto\\9;\n /* IE7-8 need help adjusting responsive images */\n\n height: auto;\n /* Part 2: Scale the height according to the width, otherwise you get stretching */\n\n vertical-align: middle;\n border: 0;\n -ms-interpolation-mode: bicubic;\n}\n#map_canvas img,\n.google-maps img {\n max-width: none;\n}\nbutton,\ninput,\nselect,\ntextarea {\n margin: 0;\n font-size: 100%;\n vertical-align: middle;\n}\nbutton,\ninput {\n *overflow: visible;\n line-height: normal;\n}\nbutton::-moz-focus-inner,\ninput::-moz-focus-inner {\n padding: 0;\n border: 0;\n}\nbutton,\nhtml input[type=\"button\"],\ninput[type=\"reset\"],\ninput[type=\"submit\"] {\n -webkit-appearance: button;\n cursor: pointer;\n}\nlabel,\nselect,\nbutton,\ninput[type=\"button\"],\ninput[type=\"reset\"],\ninput[type=\"submit\"],\ninput[type=\"radio\"],\ninput[type=\"checkbox\"] {\n cursor: pointer;\n}\ninput[type=\"search\"] {\n -webkit-box-sizing: content-box;\n -moz-box-sizing: content-box;\n box-sizing: content-box;\n -webkit-appearance: textfield;\n}\ninput[type=\"search\"]::-webkit-search-decoration,\ninput[type=\"search\"]::-webkit-search-cancel-button {\n -webkit-appearance: none;\n}\ntextarea {\n overflow: auto;\n vertical-align: top;\n}\n@media print {\n * {\n text-shadow: none !important;\n color: #000 !important;\n background: transparent !important;\n box-shadow: none !important;\n }\n a,\n a:visited {\n text-decoration: underline;\n }\n a[href]:after {\n content: \" (\" attr(href) \")\";\n }\n abbr[title]:after {\n content: \" (\" attr(title) \")\";\n }\n .ir a:after,\n a[href^=\"javascript:\"]:after,\n a[href^=\"#\"]:after {\n content: \"\";\n }\n pre,\n blockquote {\n border: 1px solid #999;\n page-break-inside: avoid;\n }\n thead {\n display: table-header-group;\n }\n tr,\n img {\n page-break-inside: avoid;\n }\n img {\n max-width: 100% !important;\n }\n @page {\n margin: 0.5cm;\n }\n p,\n h2,\n h3 {\n orphans: 3;\n widows: 3;\n }\n h2,\n h3 {\n page-break-after: avoid;\n }\n}\nbody {\n margin: 0;\n font-family: \"Helvetica Neue\", Helvetica, Arial, sans-serif;\n font-size: 14px;\n line-height: 20px;\n color: #333333;\n background-color: #ffffff;\n}\na {\n color: #0088cc;\n text-decoration: none;\n}\na:hover,\na:focus {\n color: #005580;\n text-decoration: underline;\n}\n.img-rounded {\n -webkit-border-radius: 6px;\n -moz-border-radius: 6px;\n border-radius: 6px;\n}\n.img-polaroid {\n padding: 4px;\n background-color: #fff;\n border: 1px solid #ccc;\n border: 1px solid rgba(0, 0, 0, 0.2);\n -webkit-box-shadow: 0 1px 3px rgba(0, 0, 0, 0.1);\n -moz-box-shadow: 0 1px 3px rgba(0, 0, 0, 0.1);\n box-shadow: 0 1px 3px rgba(0, 0, 0, 0.1);\n}\n.img-circle {\n -webkit-border-radius: 500px;\n -moz-border-radius: 500px;\n border-radius: 500px;\n}\n.row {\n margin-left: -20px;\n *zoom: 1;\n}\n.row:before,\n.row:after {\n display: table;\n content: \"\";\n line-height: 0;\n}\n.row:after {\n clear: both;\n}\n[class*=\"span\"] {\n float: left;\n min-height: 1px;\n margin-left: 20px;\n}\n.container,\n.navbar-static-top .container,\n.navbar-fixed-top .container,\n.navbar-fixed-bottom .container {\n width: 940px;\n}\n.span12 {\n width: 940px;\n}\n.span11 {\n width: 860px;\n}\n.span10 {\n width: 780px;\n}\n.span9 {\n width: 700px;\n}\n.span8 {\n width: 620px;\n}\n.span7 {\n width: 540px;\n}\n.span6 {\n width: 460px;\n}\n.span5 {\n width: 380px;\n}\n.span4 {\n width: 300px;\n}\n.span3 {\n width: 220px;\n}\n.span2 {\n width: 140px;\n}\n.span1 {\n width: 60px;\n}\n.offset12 {\n margin-left: 980px;\n}\n.offset11 {\n margin-left: 900px;\n}\n.offset10 {\n margin-left: 820px;\n}\n.offset9 {\n margin-left: 740px;\n}\n.offset8 {\n margin-left: 660px;\n}\n.offset7 {\n margin-left: 580px;\n}\n.offset6 {\n margin-left: 500px;\n}\n.offset5 {\n margin-left: 420px;\n}\n.offset4 {\n margin-left: 340px;\n}\n.offset3 {\n margin-left: 260px;\n}\n.offset2 {\n margin-left: 180px;\n}\n.offset1 {\n margin-left: 100px;\n}\n.row-fluid {\n width: 100%;\n *zoom: 1;\n}\n.row-fluid:before,\n.row-fluid:after {\n display: table;\n content: \"\";\n line-height: 0;\n}\n.row-fluid:after {\n clear: both;\n}\n.row-fluid [class*=\"span\"] {\n display: block;\n width: 100%;\n min-height: 30px;\n -webkit-box-sizing: border-box;\n -moz-box-sizing: border-box;\n box-sizing: border-box;\n float: left;\n margin-left: 2.127659574468085%;\n *margin-left: 2.074468085106383%;\n}\n.row-fluid [class*=\"span\"]:first-child {\n margin-left: 0;\n}\n.row-fluid .controls-row [class*=\"span\"] + [class*=\"span\"] {\n margin-left: 2.127659574468085%;\n}\n.row-fluid .span12 {\n width: 100%;\n *width: 99.94680851063829%;\n}\n.row-fluid .span11 {\n width: 91.48936170212765%;\n *width: 91.43617021276594%;\n}\n.row-fluid .span10 {\n width: 82.97872340425532%;\n *width: 82.92553191489361%;\n}\n.row-fluid .span9 {\n width: 74.46808510638297%;\n *width: 74.41489361702126%;\n}\n.row-fluid .span8 {\n width: 65.95744680851064%;\n *width: 65.90425531914893%;\n}\n.row-fluid .span7 {\n width: 57.44680851063829%;\n *width: 57.39361702127659%;\n}\n.row-fluid .span6 {\n width: 48.93617021276595%;\n *width: 48.88297872340425%;\n}\n.row-fluid .span5 {\n width: 40.42553191489362%;\n *width: 40.37234042553192%;\n}\n.row-fluid .span4 {\n width: 31.914893617021278%;\n *width: 31.861702127659576%;\n}\n.row-fluid .span3 {\n width: 23.404255319148934%;\n *width: 23.351063829787233%;\n}\n.row-fluid .span2 {\n width: 14.893617021276595%;\n *width: 14.840425531914894%;\n}\n.row-fluid .span1 {\n width: 6.382978723404255%;\n *width: 6.329787234042553%;\n}\n.row-fluid .offset12 {\n margin-left: 104.25531914893617%;\n *margin-left: 104.14893617021275%;\n}\n.row-fluid .offset12:first-child {\n margin-left: 102.12765957446808%;\n *margin-left: 102.02127659574467%;\n}\n.row-fluid .offset11 {\n margin-left: 95.74468085106382%;\n *margin-left: 95.6382978723404%;\n}\n.row-fluid .offset11:first-child {\n margin-left: 93.61702127659574%;\n *margin-left: 93.51063829787232%;\n}\n.row-fluid .offset10 {\n margin-left: 87.23404255319149%;\n *margin-left: 87.12765957446807%;\n}\n.row-fluid .offset10:first-child {\n margin-left: 85.1063829787234%;\n *margin-left: 84.99999999999999%;\n}\n.row-fluid .offset9 {\n margin-left: 78.72340425531914%;\n *margin-left: 78.61702127659572%;\n}\n.row-fluid .offset9:first-child {\n margin-left: 76.59574468085106%;\n *margin-left: 76.48936170212764%;\n}\n.row-fluid .offset8 {\n margin-left: 70.2127659574468%;\n *margin-left: 70.10638297872339%;\n}\n.row-fluid .offset8:first-child {\n margin-left: 68.08510638297872%;\n *margin-left: 67.9787234042553%;\n}\n.row-fluid .offset7 {\n margin-left: 61.70212765957446%;\n *margin-left: 61.59574468085106%;\n}\n.row-fluid .offset7:first-child {\n margin-left: 59.574468085106375%;\n *margin-left: 59.46808510638297%;\n}\n.row-fluid .offset6 {\n margin-left: 53.191489361702125%;\n *margin-left: 53.085106382978715%;\n}\n.row-fluid .offset6:first-child {\n margin-left: 51.063829787234035%;\n *margin-left: 50.95744680851063%;\n}\n.row-fluid .offset5 {\n margin-left: 44.68085106382979%;\n *margin-left: 44.57446808510638%;\n}\n.row-fluid .offset5:first-child {\n margin-left: 42.5531914893617%;\n *margin-left: 42.4468085106383%;\n}\n.row-fluid .offset4 {\n margin-left: 36.170212765957444%;\n *margin-left: 36.06382978723405%;\n}\n.row-fluid .offset4:first-child {\n margin-left: 34.04255319148936%;\n *margin-left: 33.93617021276596%;\n}\n.row-fluid .offset3 {\n margin-left: 27.659574468085104%;\n *margin-left: 27.5531914893617%;\n}\n.row-fluid .offset3:first-child {\n margin-left: 25.53191489361702%;\n *margin-left: 25.425531914893618%;\n}\n.row-fluid .offset2 {\n margin-left: 19.148936170212764%;\n *margin-left: 19.04255319148936%;\n}\n.row-fluid .offset2:first-child {\n margin-left: 17.02127659574468%;\n *margin-left: 16.914893617021278%;\n}\n.row-fluid .offset1 {\n margin-left: 10.638297872340425%;\n *margin-left: 10.53191489361702%;\n}\n.row-fluid .offset1:first-child {\n margin-left: 8.51063829787234%;\n *margin-left: 8.404255319148938%;\n}\n[class*=\"span\"].hide,\n.row-fluid [class*=\"span\"].hide {\n display: none;\n}\n[class*=\"span\"].pull-right,\n.row-fluid [class*=\"span\"].pull-right {\n float: right;\n}\n.container {\n margin-right: auto;\n margin-left: auto;\n *zoom: 1;\n}\n.container:before,\n.container:after {\n display: table;\n content: \"\";\n line-height: 0;\n}\n.container:after {\n clear: both;\n}\n.container-fluid {\n padding-right: 20px;\n padding-left: 20px;\n *zoom: 1;\n}\n.container-fluid:before,\n.container-fluid:after {\n display: table;\n content: \"\";\n line-height: 0;\n}\n.container-fluid:after {\n clear: both;\n}\np {\n margin: 0 0 10px;\n}\n.lead {\n margin-bottom: 20px;\n font-size: 21px;\n font-weight: 200;\n line-height: 30px;\n}\nsmall {\n font-size: 85%;\n}\nstrong {\n font-weight: bold;\n}\nem {\n font-style: italic;\n}\ncite {\n font-style: normal;\n}\n.muted {\n color: #999999;\n}\na.muted:hover,\na.muted:focus {\n color: #808080;\n}\n.text-warning {\n color: #c09853;\n}\na.text-warning:hover,\na.text-warning:focus {\n color: #a47e3c;\n}\n.text-error {\n color: #b94a48;\n}\na.text-error:hover,\na.text-error:focus {\n color: #953b39;\n}\n.text-info {\n color: #3a87ad;\n}\na.text-info:hover,\na.text-info:focus {\n color: #2d6987;\n}\n.text-success {\n color: #468847;\n}\na.text-success:hover,\na.text-success:focus {\n color: #356635;\n}\n.text-left {\n text-align: left;\n}\n.text-right {\n text-align: right;\n}\n.text-center {\n text-align: center;\n}\nh1,\nh2,\nh3,\nh4,\nh5,\nh6 {\n margin: 10px 0;\n font-family: inherit;\n font-weight: bold;\n line-height: 20px;\n color: inherit;\n text-rendering: optimizelegibility;\n}\nh1 small,\nh2 small,\nh3 small,\nh4 small,\nh5 small,\nh6 small {\n font-weight: normal;\n line-height: 1;\n color: #999999;\n}\nh1,\nh2,\nh3 {\n line-height: 40px;\n}\nh1 {\n font-size: 38.5px;\n}\nh2 {\n font-size: 31.5px;\n}\nh3 {\n font-size: 24.5px;\n}\nh4 {\n font-size: 17.5px;\n}\nh5 {\n font-size: 14px;\n}\nh6 {\n font-size: 11.9px;\n}\nh1 small {\n font-size: 24.5px;\n}\nh2 small {\n font-size: 17.5px;\n}\nh3 small {\n font-size: 14px;\n}\nh4 small {\n font-size: 14px;\n}\n.page-header {\n padding-bottom: 9px;\n margin: 20px 0 30px;\n border-bottom: 1px solid #eeeeee;\n}\nul,\nol {\n padding: 0;\n margin: 0 0 10px 25px;\n}\nul ul,\nul ol,\nol ol,\nol ul {\n margin-bottom: 0;\n}\nli {\n line-height: 20px;\n}\nul.unstyled,\nol.unstyled {\n margin-left: 0;\n list-style: none;\n}\nul.inline,\nol.inline {\n margin-left: 0;\n list-style: none;\n}\nul.inline > li,\nol.inline > li {\n display: inline-block;\n *display: inline;\n /* IE7 inline-block hack */\n\n *zoom: 1;\n padding-left: 5px;\n padding-right: 5px;\n}\ndl {\n margin-bottom: 20px;\n}\ndt,\ndd {\n line-height: 20px;\n}\ndt {\n font-weight: bold;\n}\ndd {\n margin-left: 10px;\n}\n.dl-horizontal {\n *zoom: 1;\n}\n.dl-horizontal:before,\n.dl-horizontal:after {\n display: table;\n content: \"\";\n line-height: 0;\n}\n.dl-horizontal:after {\n clear: both;\n}\n.dl-horizontal dt {\n float: left;\n width: 160px;\n clear: left;\n text-align: right;\n overflow: hidden;\n text-overflow: ellipsis;\n white-space: nowrap;\n}\n.dl-horizontal dd {\n margin-left: 180px;\n}\nhr {\n margin: 20px 0;\n border: 0;\n border-top: 1px solid #eeeeee;\n border-bottom: 1px solid #ffffff;\n}\nabbr[title],\nabbr[data-original-title] {\n cursor: help;\n border-bottom: 1px dotted #999999;\n}\nabbr.initialism {\n font-size: 90%;\n text-transform: uppercase;\n}\nblockquote {\n padding: 0 0 0 15px;\n margin: 0 0 20px;\n border-left: 5px solid #eeeeee;\n}\nblockquote p {\n margin-bottom: 0;\n font-size: 17.5px;\n font-weight: 300;\n line-height: 1.25;\n}\nblockquote small {\n display: block;\n line-height: 20px;\n color: #999999;\n}\nblockquote small:before {\n content: '\\2014 \\00A0';\n}\nblockquote.pull-right {\n float: right;\n padding-right: 15px;\n padding-left: 0;\n border-right: 5px solid #eeeeee;\n border-left: 0;\n}\nblockquote.pull-right p,\nblockquote.pull-right small {\n text-align: right;\n}\nblockquote.pull-right small:before {\n content: '';\n}\nblockquote.pull-right small:after {\n content: '\\00A0 \\2014';\n}\nq:before,\nq:after,\nblockquote:before,\nblockquote:after {\n content: \"\";\n}\naddress {\n display: block;\n margin-bottom: 20px;\n font-style: normal;\n line-height: 20px;\n}\ncode,\npre {\n padding: 0 3px 2px;\n font-family: Monaco, Menlo, Consolas, \"Courier New\", monospace;\n font-size: 12px;\n color: #333333;\n -webkit-border-radius: 3px;\n -moz-border-radius: 3px;\n border-radius: 3px;\n}\ncode {\n padding: 2px 4px;\n color: #d14;\n background-color: #f7f7f9;\n border: 1px solid #e1e1e8;\n white-space: nowrap;\n}\npre {\n display: block;\n padding: 9.5px;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 20px;\n word-break: break-all;\n word-wrap: break-word;\n white-space: pre;\n white-space: pre-wrap;\n background-color: #f5f5f5;\n border: 1px solid #ccc;\n border: 1px solid rgba(0, 0, 0, 0.15);\n -webkit-border-radius: 4px;\n -moz-border-radius: 4px;\n border-radius: 4px;\n}\npre.prettyprint {\n margin-bottom: 20px;\n}\npre code {\n padding: 0;\n color: inherit;\n white-space: pre;\n white-space: pre-wrap;\n background-color: transparent;\n border: 0;\n}\n.pre-scrollable {\n max-height: 340px;\n overflow-y: scroll;\n}\n.label,\n.badge {\n display: inline-block;\n padding: 2px 4px;\n font-size: 11.844px;\n font-weight: bold;\n line-height: 14px;\n color: #ffffff;\n vertical-align: baseline;\n white-space: nowrap;\n text-shadow: 0 -1px 0 rgba(0, 0, 0, 0.25);\n background-color: #999999;\n}\n.label {\n -webkit-border-radius: 3px;\n -moz-border-radius: 3px;\n border-radius: 3px;\n}\n.badge {\n padding-left: 9px;\n padding-right: 9px;\n -webkit-border-radius: 9px;\n -moz-border-radius: 9px;\n border-radius: 9px;\n}\n.label:empty,\n.badge:empty {\n display: none;\n}\na.label:hover,\na.label:focus,\na.badge:hover,\na.badge:focus {\n color: #ffffff;\n text-decoration: none;\n cursor: pointer;\n}\n.label-important,\n.badge-important {\n background-color: #b94a48;\n}\n.label-important[href],\n.badge-important[href] {\n background-color: #953b39;\n}\n.label-warning,\n.badge-warning {\n background-color: #f89406;\n}\n.label-warning[href],\n.badge-warning[href] {\n background-color: #c67605;\n}\n.label-success,\n.badge-success {\n background-color: #468847;\n}\n.label-success[href],\n.badge-success[href] {\n background-color: #356635;\n}\n.label-info,\n.badge-info {\n background-color: #3a87ad;\n}\n.label-info[href],\n.badge-info[href] {\n background-color: #2d6987;\n}\n.label-inverse,\n.badge-inverse {\n background-color: #333333;\n}\n.label-inverse[href],\n.badge-inverse[href] {\n background-color: #1a1a1a;\n}\n.btn .label,\n.btn .badge {\n position: relative;\n top: -1px;\n}\n.btn-mini .label,\n.btn-mini .badge {\n top: 0;\n}\ntable {\n max-width: 100%;\n background-color: transparent;\n border-collapse: collapse;\n border-spacing: 0;\n}\n.table {\n width: 100%;\n margin-bottom: 20px;\n}\n.table th,\n.table td {\n padding: 8px;\n line-height: 20px;\n text-align: left;\n vertical-align: top;\n border-top: 1px solid #dddddd;\n}\n.table th {\n font-weight: bold;\n}\n.table thead th {\n vertical-align: bottom;\n}\n.table caption + thead tr:first-child th,\n.table caption + thead tr:first-child td,\n.table colgroup + thead tr:first-child th,\n.table colgroup + thead tr:first-child td,\n.table thead:first-child tr:first-child th,\n.table thead:first-child tr:first-child td {\n border-top: 0;\n}\n.table tbody + tbody {\n border-top: 2px solid #dddddd;\n}\n.table .table {\n background-color: #ffffff;\n}\n.table-condensed th,\n.table-condensed td {\n padding: 4px 5px;\n}\n.table-bordered {\n border: 1px solid #dddddd;\n border-collapse: separate;\n *border-collapse: collapse;\n border-left: 0;\n -webkit-border-radius: 4px;\n -moz-border-radius: 4px;\n border-radius: 4px;\n}\n.table-bordered th,\n.table-bordered td {\n border-left: 1px solid #dddddd;\n}\n.table-bordered caption + thead tr:first-child th,\n.table-bordered caption + tbody tr:first-child th,\n.table-bordered caption + tbody tr:first-child td,\n.table-bordered colgroup + thead tr:first-child th,\n.table-bordered colgroup + tbody tr:first-child th,\n.table-bordered colgroup + tbody tr:first-child td,\n.table-bordered thead:first-child tr:first-child th,\n.table-bordered tbody:first-child tr:first-child th,\n.table-bordered tbody:first-child tr:first-child td {\n border-top: 0;\n}\n.table-bordered thead:first-child tr:first-child > th:first-child,\n.table-bordered tbody:first-child tr:first-child > td:first-child,\n.table-bordered tbody:first-child tr:first-child > th:first-child {\n -webkit-border-top-left-radius: 4px;\n -moz-border-radius-topleft: 4px;\n border-top-left-radius: 4px;\n}\n.table-bordered thead:first-child tr:first-child > th:last-child,\n.table-bordered tbody:first-child tr:first-child > td:last-child,\n.table-bordered tbody:first-child tr:first-child > th:last-child {\n -webkit-border-top-right-radius: 4px;\n -moz-border-radius-topright: 4px;\n border-top-right-radius: 4px;\n}\n.table-bordered thead:last-child tr:last-child > th:first-child,\n.table-bordered tbody:last-child tr:last-child > td:first-child,\n.table-bordered tbody:last-child tr:last-child > th:first-child,\n.table-bordered tfoot:last-child tr:last-child > td:first-child,\n.table-bordered tfoot:last-child tr:last-child > th:first-child {\n -webkit-border-bottom-left-radius: 4px;\n -moz-border-radius-bottomleft: 4px;\n border-bottom-left-radius: 4px;\n}\n.table-bordered thead:last-child tr:last-child > th:last-child,\n.table-bordered tbody:last-child tr:last-child > td:last-child,\n.table-bordered tbody:last-child tr:last-child > th:last-child,\n.table-bordered tfoot:last-child tr:last-child > td:last-child,\n.table-bordered tfoot:last-child tr:last-child > th:last-child {\n -webkit-border-bottom-right-radius: 4px;\n -moz-border-radius-bottomright: 4px;\n border-bottom-right-radius: 4px;\n}\n.table-bordered tfoot + tbody:last-child tr:last-child td:first-child {\n -webkit-border-bottom-left-radius: 0;\n -moz-border-radius-bottomleft: 0;\n border-bottom-left-radius: 0;\n}\n.table-bordered tfoot + tbody:last-child tr:last-child td:last-child {\n -webkit-border-bottom-right-radius: 0;\n -moz-border-radius-bottomright: 0;\n border-bottom-right-radius: 0;\n}\n.table-bordered caption + thead tr:first-child th:first-child,\n.table-bordered caption + tbody tr:first-child td:first-child,\n.table-bordered colgroup + thead tr:first-child th:first-child,\n.table-bordered colgroup + tbody tr:first-child td:first-child {\n -webkit-border-top-left-radius: 4px;\n -moz-border-radius-topleft: 4px;\n border-top-left-radius: 4px;\n}\n.table-bordered caption + thead tr:first-child th:last-child,\n.table-bordered caption + tbody tr:first-child td:last-child,\n.table-bordered colgroup + thead tr:first-child th:last-child,\n.table-bordered colgroup + tbody tr:first-child td:last-child {\n -webkit-border-top-right-radius: 4px;\n -moz-border-radius-topright: 4px;\n border-top-right-radius: 4px;\n}\n.table-striped tbody > tr:nth-child(odd) > td,\n.table-striped tbody > tr:nth-child(odd) > th {\n background-color: #f9f9f9;\n}\n.table-hover tbody tr:hover > td,\n.table-hover tbody tr:hover > th {\n background-color: #f5f5f5;\n}\ntable td[class*=\"span\"],\ntable th[class*=\"span\"],\n.row-fluid table td[class*=\"span\"],\n.row-fluid table th[class*=\"span\"] {\n display: table-cell;\n float: none;\n margin-left: 0;\n}\n.table td.span1,\n.table th.span1 {\n float: none;\n width: 44px;\n margin-left: 0;\n}\n.table td.span2,\n.table th.span2 {\n float: none;\n width: 124px;\n margin-left: 0;\n}\n.table td.span3,\n.table th.span3 {\n float: none;\n width: 204px;\n margin-left: 0;\n}\n.table td.span4,\n.table th.span4 {\n float: none;\n width: 284px;\n margin-left: 0;\n}\n.table td.span5,\n.table th.span5 {\n float: none;\n width: 364px;\n margin-left: 0;\n}\n.table td.span6,\n.table th.span6 {\n float: none;\n width: 444px;\n margin-left: 0;\n}\n.table td.span7,\n.table th.span7 {\n float: none;\n width: 524px;\n margin-left: 0;\n}\n.table td.span8,\n.table th.span8 {\n float: none;\n width: 604px;\n margin-left: 0;\n}\n.table td.span9,\n.table th.span9 {\n float: none;\n width: 684px;\n margin-left: 0;\n}\n.table td.span10,\n.table th.span10 {\n float: none;\n width: 764px;\n margin-left: 0;\n}\n.table td.span11,\n.table th.span11 {\n float: none;\n width: 844px;\n margin-left: 0;\n}\n.table td.span12,\n.table th.span12 {\n float: none;\n width: 924px;\n margin-left: 0;\n}\n.table tbody tr.success > td {\n background-color: #dff0d8;\n}\n.table tbody tr.error > td {\n background-color: #f2dede;\n}\n.table tbody tr.warning > td {\n background-color: #fcf8e3;\n}\n.table tbody tr.info > td {\n background-color: #d9edf7;\n}\n.table-hover tbody tr.success:hover > td {\n background-color: #d0e9c6;\n}\n.table-hover tbody tr.error:hover > td {\n background-color: #ebcccc;\n}\n.table-hover tbody tr.warning:hover > td {\n background-color: #faf2cc;\n}\n.table-hover tbody tr.info:hover > td {\n background-color: #c4e3f3;\n}\nform {\n margin: 0 0 20px;\n}\nfieldset {\n padding: 0;\n margin: 0;\n border: 0;\n}\nlegend {\n display: block;\n width: 100%;\n padding: 0;\n margin-bottom: 20px;\n font-size: 21px;\n line-height: 40px;\n color: #333333;\n border: 0;\n border-bottom: 1px solid #e5e5e5;\n}\nlegend small {\n font-size: 15px;\n color: #999999;\n}\nlabel,\ninput,\nbutton,\nselect,\ntextarea {\n font-size: 14px;\n font-weight: normal;\n line-height: 20px;\n}\ninput,\nbutton,\nselect,\ntextarea {\n font-family: \"Helvetica Neue\", Helvetica, Arial, sans-serif;\n}\nlabel {\n display: block;\n margin-bottom: 5px;\n}\nselect,\ntextarea,\ninput[type=\"text\"],\ninput[type=\"password\"],\ninput[type=\"datetime\"],\ninput[type=\"datetime-local\"],\ninput[type=\"date\"],\ninput[type=\"month\"],\ninput[type=\"time\"],\ninput[type=\"week\"],\ninput[type=\"number\"],\ninput[type=\"email\"],\ninput[type=\"url\"],\ninput[type=\"search\"],\ninput[type=\"tel\"],\ninput[type=\"color\"],\n.uneditable-input {\n display: inline-block;\n height: 20px;\n padding: 4px 6px;\n margin-bottom: 10px;\n font-size: 14px;\n line-height: 20px;\n color: #555555;\n -webkit-border-radius: 4px;\n -moz-border-radius: 4px;\n border-radius: 4px;\n vertical-align: middle;\n}\ninput,\ntextarea,\n.uneditable-input {\n width: 206px;\n}\ntextarea {\n height: auto;\n}\ntextarea,\ninput[type=\"text\"],\ninput[type=\"password\"],\ninput[type=\"datetime\"],\ninput[type=\"datetime-local\"],\ninput[type=\"date\"],\ninput[type=\"month\"],\ninput[type=\"time\"],\ninput[type=\"week\"],\ninput[type=\"number\"],\ninput[type=\"email\"],\ninput[type=\"url\"],\ninput[type=\"search\"],\ninput[type=\"tel\"],\ninput[type=\"color\"],\n.uneditable-input {\n background-color: #ffffff;\n border: 1px solid #cccccc;\n -webkit-box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075);\n -moz-box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075);\n box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075);\n -webkit-transition: border linear .2s, box-shadow linear .2s;\n -moz-transition: border linear .2s, box-shadow linear .2s;\n -o-transition: border linear .2s, box-shadow linear .2s;\n transition: border linear .2s, box-shadow linear .2s;\n}\ntextarea:focus,\ninput[type=\"text\"]:focus,\ninput[type=\"password\"]:focus,\ninput[type=\"datetime\"]:focus,\ninput[type=\"datetime-local\"]:focus,\ninput[type=\"date\"]:focus,\ninput[type=\"month\"]:focus,\ninput[type=\"time\"]:focus,\ninput[type=\"week\"]:focus,\ninput[type=\"number\"]:focus,\ninput[type=\"email\"]:focus,\ninput[type=\"url\"]:focus,\ninput[type=\"search\"]:focus,\ninput[type=\"tel\"]:focus,\ninput[type=\"color\"]:focus,\n.uneditable-input:focus {\n border-color: rgba(82, 168, 236, 0.8);\n outline: 0;\n outline: thin dotted \\9;\n /* IE6-9 */\n\n -webkit-box-shadow: inset 0 1px 1px rgba(0,0,0,.075), 0 0 8px rgba(82,168,236,.6);\n -moz-box-shadow: inset 0 1px 1px rgba(0,0,0,.075), 0 0 8px rgba(82,168,236,.6);\n box-shadow: inset 0 1px 1px rgba(0,0,0,.075), 0 0 8px rgba(82,168,236,.6);\n}\ninput[type=\"radio\"],\ninput[type=\"checkbox\"] {\n margin: 4px 0 0;\n *margin-top: 0;\n /* IE7 */\n\n margin-top: 1px \\9;\n /* IE8-9 */\n\n line-height: normal;\n}\ninput[type=\"file\"],\ninput[type=\"image\"],\ninput[type=\"submit\"],\ninput[type=\"reset\"],\ninput[type=\"button\"],\ninput[type=\"radio\"],\ninput[type=\"checkbox\"] {\n width: auto;\n}\nselect,\ninput[type=\"file\"] {\n height: 30px;\n /* In IE7, the height of the select element cannot be changed by height, only font-size */\n\n *margin-top: 4px;\n /* For IE7, add top margin to align select with labels */\n\n line-height: 30px;\n}\nselect {\n width: 220px;\n border: 1px solid #cccccc;\n background-color: #ffffff;\n}\nselect[multiple],\nselect[size] {\n height: auto;\n}\nselect:focus,\ninput[type=\"file\"]:focus,\ninput[type=\"radio\"]:focus,\ninput[type=\"checkbox\"]:focus {\n outline: thin dotted #333;\n outline: 5px auto -webkit-focus-ring-color;\n outline-offset: -2px;\n}\n.uneditable-input,\n.uneditable-textarea {\n color: #999999;\n background-color: #fcfcfc;\n border-color: #cccccc;\n -webkit-box-shadow: inset 0 1px 2px rgba(0, 0, 0, 0.025);\n -moz-box-shadow: inset 0 1px 2px rgba(0, 0, 0, 0.025);\n box-shadow: inset 0 1px 2px rgba(0, 0, 0, 0.025);\n cursor: not-allowed;\n}\n.uneditable-input {\n overflow: hidden;\n white-space: nowrap;\n}\n.uneditable-textarea {\n width: auto;\n height: auto;\n}\ninput:-moz-placeholder,\ntextarea:-moz-placeholder {\n color: #999999;\n}\ninput:-ms-input-placeholder,\ntextarea:-ms-input-placeholder {\n color: #999999;\n}\ninput::-webkit-input-placeholder,\ntextarea::-webkit-input-placeholder {\n color: #999999;\n}\n.radio,\n.checkbox {\n min-height: 20px;\n padding-left: 20px;\n}\n.radio input[type=\"radio\"],\n.checkbox input[type=\"checkbox\"] {\n float: left;\n margin-left: -20px;\n}\n.controls > .radio:first-child,\n.controls > .checkbox:first-child {\n padding-top: 5px;\n}\n.radio.inline,\n.checkbox.inline {\n display: inline-block;\n padding-top: 5px;\n margin-bottom: 0;\n vertical-align: middle;\n}\n.radio.inline + .radio.inline,\n.checkbox.inline + .checkbox.inline {\n margin-left: 10px;\n}\n.input-mini {\n width: 60px;\n}\n.input-small {\n width: 90px;\n}\n.input-medium {\n width: 150px;\n}\n.input-large {\n width: 210px;\n}\n.input-xlarge {\n width: 270px;\n}\n.input-xxlarge {\n width: 530px;\n}\ninput[class*=\"span\"],\nselect[class*=\"span\"],\ntextarea[class*=\"span\"],\n.uneditable-input[class*=\"span\"],\n.row-fluid input[class*=\"span\"],\n.row-fluid select[class*=\"span\"],\n.row-fluid textarea[class*=\"span\"],\n.row-fluid .uneditable-input[class*=\"span\"] {\n float: none;\n margin-left: 0;\n}\n.input-append input[class*=\"span\"],\n.input-append .uneditable-input[class*=\"span\"],\n.input-prepend input[class*=\"span\"],\n.input-prepend .uneditable-input[class*=\"span\"],\n.row-fluid input[class*=\"span\"],\n.row-fluid select[class*=\"span\"],\n.row-fluid textarea[class*=\"span\"],\n.row-fluid .uneditable-input[class*=\"span\"],\n.row-fluid .input-prepend [class*=\"span\"],\n.row-fluid .input-append [class*=\"span\"] {\n display: inline-block;\n}\ninput,\ntextarea,\n.uneditable-input {\n margin-left: 0;\n}\n.controls-row [class*=\"span\"] + [class*=\"span\"] {\n margin-left: 20px;\n}\ninput.span12,\ntextarea.span12,\n.uneditable-input.span12 {\n width: 926px;\n}\ninput.span11,\ntextarea.span11,\n.uneditable-input.span11 {\n width: 846px;\n}\ninput.span10,\ntextarea.span10,\n.uneditable-input.span10 {\n width: 766px;\n}\ninput.span9,\ntextarea.span9,\n.uneditable-input.span9 {\n width: 686px;\n}\ninput.span8,\ntextarea.span8,\n.uneditable-input.span8 {\n width: 606px;\n}\ninput.span7,\ntextarea.span7,\n.uneditable-input.span7 {\n width: 526px;\n}\ninput.span6,\ntextarea.span6,\n.uneditable-input.span6 {\n width: 446px;\n}\ninput.span5,\ntextarea.span5,\n.uneditable-input.span5 {\n width: 366px;\n}\ninput.span4,\ntextarea.span4,\n.uneditable-input.span4 {\n width: 286px;\n}\ninput.span3,\ntextarea.span3,\n.uneditable-input.span3 {\n width: 206px;\n}\ninput.span2,\ntextarea.span2,\n.uneditable-input.span2 {\n width: 126px;\n}\ninput.span1,\ntextarea.span1,\n.uneditable-input.span1 {\n width: 46px;\n}\n.controls-row {\n *zoom: 1;\n}\n.controls-row:before,\n.controls-row:after {\n display: table;\n content: \"\";\n line-height: 0;\n}\n.controls-row:after {\n clear: both;\n}\n.controls-row [class*=\"span\"],\n.row-fluid .controls-row [class*=\"span\"] {\n float: left;\n}\n.controls-row .checkbox[class*=\"span\"],\n.controls-row .radio[class*=\"span\"] {\n padding-top: 5px;\n}\ninput[disabled],\nselect[disabled],\ntextarea[disabled],\ninput[readonly],\nselect[readonly],\ntextarea[readonly] {\n cursor: not-allowed;\n background-color: #eeeeee;\n}\ninput[type=\"radio\"][disabled],\ninput[type=\"checkbox\"][disabled],\ninput[type=\"radio\"][readonly],\ninput[type=\"checkbox\"][readonly] {\n background-color: transparent;\n}\n.control-group.warning .control-label,\n.control-group.warning .help-block,\n.control-group.warning .help-inline {\n color: #c09853;\n}\n.control-group.warning .checkbox,\n.control-group.warning .radio,\n.control-group.warning input,\n.control-group.warning select,\n.control-group.warning textarea {\n color: #c09853;\n}\n.control-group.warning input,\n.control-group.warning select,\n.control-group.warning textarea {\n border-color: #c09853;\n -webkit-box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075);\n -moz-box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075);\n box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075);\n}\n.control-group.warning input:focus,\n.control-group.warning select:focus,\n.control-group.warning textarea:focus {\n border-color: #a47e3c;\n -webkit-box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075), 0 0 6px #dbc59e;\n -moz-box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075), 0 0 6px #dbc59e;\n box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075), 0 0 6px #dbc59e;\n}\n.control-group.warning .input-prepend .add-on,\n.control-group.warning .input-append .add-on {\n color: #c09853;\n background-color: #fcf8e3;\n border-color: #c09853;\n}\n.control-group.error .control-label,\n.control-group.error .help-block,\n.control-group.error .help-inline {\n color: #b94a48;\n}\n.control-group.error .checkbox,\n.control-group.error .radio,\n.control-group.error input,\n.control-group.error select,\n.control-group.error textarea {\n color: #b94a48;\n}\n.control-group.error input,\n.control-group.error select,\n.control-group.error textarea {\n border-color: #b94a48;\n -webkit-box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075);\n -moz-box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075);\n box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075);\n}\n.control-group.error input:focus,\n.control-group.error select:focus,\n.control-group.error textarea:focus {\n border-color: #953b39;\n -webkit-box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075), 0 0 6px #d59392;\n -moz-box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075), 0 0 6px #d59392;\n box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075), 0 0 6px #d59392;\n}\n.control-group.error .input-prepend .add-on,\n.control-group.error .input-append .add-on {\n color: #b94a48;\n background-color: #f2dede;\n border-color: #b94a48;\n}\n.control-group.success .control-label,\n.control-group.success .help-block,\n.control-group.success .help-inline {\n color: #468847;\n}\n.control-group.success .checkbox,\n.control-group.success .radio,\n.control-group.success input,\n.control-group.success select,\n.control-group.success textarea {\n color: #468847;\n}\n.control-group.success input,\n.control-group.success select,\n.control-group.success textarea {\n border-color: #468847;\n -webkit-box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075);\n -moz-box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075);\n box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075);\n}\n.control-group.success input:focus,\n.control-group.success select:focus,\n.control-group.success textarea:focus {\n border-color: #356635;\n -webkit-box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075), 0 0 6px #7aba7b;\n -moz-box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075), 0 0 6px #7aba7b;\n box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075), 0 0 6px #7aba7b;\n}\n.control-group.success .input-prepend .add-on,\n.control-group.success .input-append .add-on {\n color: #468847;\n background-color: #dff0d8;\n border-color: #468847;\n}\n.control-group.info .control-label,\n.control-group.info .help-block,\n.control-group.info .help-inline {\n color: #3a87ad;\n}\n.control-group.info .checkbox,\n.control-group.info .radio,\n.control-group.info input,\n.control-group.info select,\n.control-group.info textarea {\n color: #3a87ad;\n}\n.control-group.info input,\n.control-group.info select,\n.control-group.info textarea {\n border-color: #3a87ad;\n -webkit-box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075);\n -moz-box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075);\n box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075);\n}\n.control-group.info input:focus,\n.control-group.info select:focus,\n.control-group.info textarea:focus {\n border-color: #2d6987;\n -webkit-box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075), 0 0 6px #7ab5d3;\n -moz-box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075), 0 0 6px #7ab5d3;\n box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.075), 0 0 6px #7ab5d3;\n}\n.control-group.info .input-prepend .add-on,\n.control-group.info .input-append .add-on {\n color: #3a87ad;\n background-color: #d9edf7;\n border-color: #3a87ad;\n}\ninput:focus:invalid,\ntextarea:focus:invalid,\nselect:focus:invalid {\n color: #b94a48;\n border-color: #ee5f5b;\n}\ninput:focus:invalid:focus,\ntextarea:focus:invalid:focus,\nselect:focus:invalid:focus {\n border-color: #e9322d;\n -webkit-box-shadow: 0 0 6px #f8b9b7;\n -moz-box-shadow: 0 0 6px #f8b9b7;\n box-shadow: 0 0 6px #f8b9b7;\n}\n.form-actions {\n padding: 19px 20px 20px;\n margin-top: 20px;\n margin-bottom: 20px;\n background-color: #f5f5f5;\n border-top: 1px solid #e5e5e5;\n *zoom: 1;\n}\n.form-actions:before,\n.form-actions:after {\n display: table;\n content: \"\";\n line-height: 0;\n}\n.form-actions:after {\n clear: both;\n}\n.help-block,\n.help-inline {\n color: #595959;\n}\n.help-block {\n display: block;\n margin-bottom: 10px;\n}\n.help-inline {\n display: inline-block;\n *display: inline;\n /* IE7 inline-block hack */\n\n *zoom: 1;\n vertical-align: middle;\n padding-left: 5px;\n}\n.input-append,\n.input-prepend {\n display: inline-block;\n margin-bottom: 10px;\n vertical-align: middle;\n font-size: 0;\n white-space: nowrap;\n}\n.input-append input,\n.input-prepend input,\n.input-append select,\n.input-prepend select,\n.input-append .uneditable-input,\n.input-prepend .uneditable-input,\n.input-append .dropdown-menu,\n.input-prepend .dropdown-menu,\n.input-append .popover,\n.input-prepend .popover {\n font-size: 14px;\n}\n.input-append input,\n.input-prepend input,\n.input-append select,\n.input-prepend select,\n.input-append .uneditable-input,\n.input-prepend .uneditable-input {\n position: relative;\n margin-bottom: 0;\n *margin-left: 0;\n vertical-align: top;\n -webkit-border-radius: 0 4px 4px 0;\n -moz-border-radius: 0 4px 4px 0;\n border-radius: 0 4px 4px 0;\n}\n.input-append input:focus,\n.input-prepend input:focus,\n.input-append select:focus,\n.input-prepend select:focus,\n.input-append .uneditable-input:focus,\n.input-prepend .uneditable-input:focus {\n z-index: 2;\n}\n.input-append .add-on,\n.input-prepend .add-on {\n display: inline-block;\n width: auto;\n height: 20px;\n min-width: 16px;\n padding: 4px 5px;\n font-size: 14px;\n font-weight: normal;\n line-height: 20px;\n text-align: center;\n text-shadow: 0 1px 0 #ffffff;\n background-color: #eeeeee;\n border: 1px solid #ccc;\n}\n.input-append .add-on,\n.input-prepend .add-on,\n.input-append .btn,\n.input-prepend .btn,\n.input-append .btn-group > .dropdown-toggle,\n.input-prepend .btn-group > .dropdown-toggle {\n vertical-align: top;\n -webkit-border-radius: 0;\n -moz-border-radius: 0;\n border-radius: 0;\n}\n.input-append .active,\n.input-prepend .active {\n background-color: #a9dba9;\n border-color: #46a546;\n}\n.input-prepend .add-on,\n.input-prepend .btn {\n margin-right: -1px;\n}\n.input-prepend .add-on:first-child,\n.input-prepend .btn:first-child {\n -webkit-border-radius: 4px 0 0 4px;\n -moz-border-radius: 4px 0 0 4px;\n border-radius: 4px 0 0 4px;\n}\n.input-append input,\n.input-append select,\n.input-append .uneditable-input {\n -webkit-border-radius: 4px 0 0 4px;\n -moz-border-radius: 4px 0 0 4px;\n border-radius: 4px 0 0 4px;\n}\n.input-append input + .btn-group .btn:last-child,\n.input-append select + .btn-group .btn:last-child,\n.input-append .uneditable-input + .btn-group .btn:last-child {\n -webkit-border-radius: 0 4px 4px 0;\n -moz-border-radius: 0 4px 4px 0;\n border-radius: 0 4px 4px 0;\n}\n.input-append .add-on,\n.input-append .btn,\n.input-append .btn-group {\n margin-left: -1px;\n}\n.input-append .add-on:last-child,\n.input-append .btn:last-child,\n.input-append .btn-group:last-child > .dropdown-toggle {\n -webkit-border-radius: 0 4px 4px 0;\n -moz-border-radius: 0 4px 4px 0;\n border-radius: 0 4px 4px 0;\n}\n.input-prepend.input-append input,\n.input-prepend.input-append select,\n.input-prepend.input-append .uneditable-input {\n -webkit-border-radius: 0;\n -moz-border-radius: 0;\n border-radius: 0;\n}\n.input-prepend.input-append input + .btn-group .btn,\n.input-prepend.input-append select + .btn-group .btn,\n.input-prepend.input-append .uneditable-input + .btn-group .btn {\n -webkit-border-radius: 0 4px 4px 0;\n -moz-border-radius: 0 4px 4px 0;\n border-radius: 0 4px 4px 0;\n}\n.input-prepend.input-append .add-on:first-child,\n.input-prepend.input-append .btn:first-child {\n margin-right: -1px;\n -webkit-border-radius: 4px 0 0 4px;\n -moz-border-radius: 4px 0 0 4px;\n border-radius: 4px 0 0 4px;\n}\n.input-prepend.input-append .add-on:last-child,\n.input-prepend.input-append .btn:last-child {\n margin-left: -1px;\n -webkit-border-radius: 0 4px 4px 0;\n -moz-border-radius: 0 4px 4px 0;\n border-radius: 0 4px 4px 0;\n}\n.input-prepend.input-append .btn-group:first-child {\n margin-left: 0;\n}\ninput.search-query {\n padding-right: 14px;\n padding-right: 4px \\9;\n padding-left: 14px;\n padding-left: 4px \\9;\n /* IE7-8 doesn't have border-radius, so don't indent the padding */\n\n margin-bottom: 0;\n -webkit-border-radius: 15px;\n -moz-border-radius: 15px;\n border-radius: 15px;\n}\n/* Allow for input prepend/append in search forms */\n.form-search .input-append .search-query,\n.form-search .input-prepend .search-query {\n -webkit-border-radius: 0;\n -moz-border-radius: 0;\n border-radius: 0;\n}\n.form-search .input-append .search-query {\n -webkit-border-radius: 14px 0 0 14px;\n -moz-border-radius: 14px 0 0 14px;\n border-radius: 14px 0 0 14px;\n}\n.form-search .input-append .btn {\n -webkit-border-radius: 0 14px 14px 0;\n -moz-border-radius: 0 14px 14px 0;\n border-radius: 0 14px 14px 0;\n}\n.form-search .input-prepend .search-query {\n -webkit-border-radius: 0 14px 14px 0;\n -moz-border-radius: 0 14px 14px 0;\n border-radius: 0 14px 14px 0;\n}\n.form-search .input-prepend .btn {\n -webkit-border-radius: 14px 0 0 14px;\n -moz-border-radius: 14px 0 0 14px;\n border-radius: 14px 0 0 14px;\n}\n.form-search input,\n.form-inline input,\n.form-horizontal input,\n.form-search textarea,\n.form-inline textarea,\n.form-horizontal textarea,\n.form-search select,\n.form-inline select,\n.form-horizontal select,\n.form-search .help-inline,\n.form-inline .help-inline,\n.form-horizontal .help-inline,\n.form-search .uneditable-input,\n.form-inline .uneditable-input,\n.form-horizontal .uneditable-input,\n.form-search .input-prepend,\n.form-inline .input-prepend,\n.form-horizontal .input-prepend,\n.form-search .input-append,\n.form-inline .input-append,\n.form-horizontal .input-append {\n display: inline-block;\n *display: inline;\n /* IE7 inline-block hack */\n\n *zoom: 1;\n margin-bottom: 0;\n vertical-align: middle;\n}\n.form-search .hide,\n.form-inline .hide,\n.form-horizontal .hide {\n display: none;\n}\n.form-search label,\n.form-inline label,\n.form-search .btn-group,\n.form-inline .btn-group {\n display: inline-block;\n}\n.form-search .input-append,\n.form-inline .input-append,\n.form-search .input-prepend,\n.form-inline .input-prepend {\n margin-bottom: 0;\n}\n.form-search .radio,\n.form-search .checkbox,\n.form-inline .radio,\n.form-inline .checkbox {\n padding-left: 0;\n margin-bottom: 0;\n vertical-align: middle;\n}\n.form-search .radio input[type=\"radio\"],\n.form-search .checkbox input[type=\"checkbox\"],\n.form-inline .radio input[type=\"radio\"],\n.form-inline .checkbox input[type=\"checkbox\"] {\n float: left;\n margin-right: 3px;\n margin-left: 0;\n}\n.control-group {\n margin-bottom: 10px;\n}\nlegend + .control-group {\n margin-top: 20px;\n -webkit-margin-top-collapse: separate;\n}\n.form-horizontal .control-group {\n margin-bottom: 20px;\n *zoom: 1;\n}\n.form-horizontal .control-group:before,\n.form-horizontal .control-group:after {\n display: table;\n content: \"\";\n line-height: 0;\n}\n.form-horizontal .control-group:after {\n clear: both;\n}\n.form-horizontal .control-label {\n float: left;\n width: 160px;\n padding-top: 5px;\n text-align: right;\n}\n.form-horizontal .controls {\n *display: inline-block;\n *padding-left: 20px;\n margin-left: 180px;\n *margin-left: 0;\n}\n.form-horizontal .controls:first-child {\n *padding-left: 180px;\n}\n.form-horizontal .help-block {\n margin-bottom: 0;\n}\n.form-horizontal input + .help-block,\n.form-horizontal select + .help-block,\n.form-horizontal textarea + .help-block,\n.form-horizontal .uneditable-input + .help-block,\n.form-horizontal .input-prepend + .help-block,\n.form-horizontal .input-append + .help-block {\n margin-top: 10px;\n}\n.form-horizontal .form-actions {\n padding-left: 180px;\n}\n.btn {\n display: inline-block;\n *display: inline;\n /* IE7 inline-block hack */\n\n *zoom: 1;\n padding: 4px 12px;\n margin-bottom: 0;\n font-size: 14px;\n line-height: 20px;\n text-align: center;\n vertical-align: middle;\n cursor: pointer;\n color: #333333;\n text-shadow: 0 1px 1px rgba(255, 255, 255, 0.75);\n background-color: #f5f5f5;\n background-image: -moz-linear-gradient(top, #ffffff, #e6e6e6);\n background-image: -webkit-gradient(linear, 0 0, 0 100%, from(#ffffff), to(#e6e6e6));\n background-image: -webkit-linear-gradient(top, #ffffff, #e6e6e6);\n background-image: -o-linear-gradient(top, #ffffff, #e6e6e6);\n background-image: linear-gradient(to bottom, #ffffff, #e6e6e6);\n background-repeat: repeat-x;\n filter: progid:DXImageTransform.Microsoft.gradient(startColorstr='#ffffffff', endColorstr='#ffe6e6e6', GradientType=0);\n border-color: #e6e6e6 #e6e6e6 #bfbfbf;\n border-color: rgba(0, 0, 0, 0.1) rgba(0, 0, 0, 0.1) rgba(0, 0, 0, 0.25);\n *background-color: #e6e6e6;\n /* Darken IE7 buttons by default so they stand out more given they won't have borders */\n\n filter: progid:DXImageTransform.Microsoft.gradient(enabled = false);\n border: 1px solid #cccccc;\n *border: 0;\n border-bottom-color: #b3b3b3;\n -webkit-border-radius: 4px;\n -moz-border-radius: 4px;\n border-radius: 4px;\n *margin-left: .3em;\n -webkit-box-shadow: inset 0 1px 0 rgba(255,255,255,.2), 0 1px 2px rgba(0,0,0,.05);\n -moz-box-shadow: inset 0 1px 0 rgba(255,255,255,.2), 0 1px 2px rgba(0,0,0,.05);\n box-shadow: inset 0 1px 0 rgba(255,255,255,.2), 0 1px 2px rgba(0,0,0,.05);\n}\n.btn:hover,\n.btn:focus,\n.btn:active,\n.btn.active,\n.btn.disabled,\n.btn[disabled] {\n color: #333333;\n background-color: #e6e6e6;\n *background-color: #d9d9d9;\n}\n.btn:active,\n.btn.active {\n background-color: #cccccc \\9;\n}\n.btn:first-child {\n *margin-left: 0;\n}\n.btn:hover,\n.btn:focus {\n color: #333333;\n text-decoration: none;\n background-position: 0 -15px;\n -webkit-transition: background-position 0.1s linear;\n -moz-transition: background-position 0.1s linear;\n -o-transition: background-position 0.1s linear;\n transition: background-position 0.1s linear;\n}\n.btn:focus {\n outline: thin dotted #333;\n outline: 5px auto -webkit-focus-ring-color;\n outline-offset: -2px;\n}\n.btn.active,\n.btn:active {\n background-image: none;\n outline: 0;\n -webkit-box-shadow: inset 0 2px 4px rgba(0,0,0,.15), 0 1px 2px rgba(0,0,0,.05);\n -moz-box-shadow: inset 0 2px 4px rgba(0,0,0,.15), 0 1px 2px rgba(0,0,0,.05);\n box-shadow: inset 0 2px 4px rgba(0,0,0,.15), 0 1px 2px rgba(0,0,0,.05);\n}\n.btn.disabled,\n.btn[disabled] {\n cursor: default;\n background-image: none;\n opacity: 0.65;\n filter: alpha(opacity=65);\n -webkit-box-shadow: none;\n -moz-box-shadow: none;\n box-shadow: none;\n}\n.btn-large {\n padding: 11px 19px;\n font-size: 17.5px;\n -webkit-border-radius: 6px;\n -moz-border-radius: 6px;\n border-radius: 6px;\n}\n.btn-large [class^=\"icon-\"],\n.btn-large [class*=\" icon-\"] {\n margin-top: 4px;\n}\n.btn-small {\n padding: 2px 10px;\n font-size: 11.9px;\n -webkit-border-radius: 3px;\n -moz-border-radius: 3px;\n border-radius: 3px;\n}\n.btn-small [class^=\"icon-\"],\n.btn-small [class*=\" icon-\"] {\n margin-top: 0;\n}\n.btn-mini [class^=\"icon-\"],\n.btn-mini [class*=\" icon-\"] {\n margin-top: -1px;\n}\n.btn-mini {\n padding: 0 6px;\n font-size: 10.5px;\n -webkit-border-radius: 3px;\n -moz-border-radius: 3px;\n border-radius: 3px;\n}\n.btn-block {\n display: block;\n width: 100%;\n padding-left: 0;\n padding-right: 0;\n -webkit-box-sizing: border-box;\n -moz-box-sizing: border-box;\n box-sizing: border-box;\n}\n.btn-block + .btn-block {\n margin-top: 5px;\n}\ninput[type=\"submit\"].btn-block,\ninput[type=\"reset\"].btn-block,\ninput[type=\"button\"].btn-block {\n width: 100%;\n}\n.btn-primary.active,\n.btn-warning.active,\n.btn-danger.active,\n.btn-success.active,\n.btn-info.active,\n.btn-inverse.active {\n color: rgba(255, 255, 255, 0.75);\n}\n.btn-primary {\n color: #ffffff;\n text-shadow: 0 -1px 0 rgba(0, 0, 0, 0.25);\n background-color: #006dcc;\n background-image: -moz-linear-gradient(top, #0088cc, #0044cc);\n background-image: -webkit-gradient(linear, 0 0, 0 100%, from(#0088cc), to(#0044cc));\n background-image: -webkit-linear-gradient(top, #0088cc, #0044cc);\n background-image: -o-linear-gradient(top, #0088cc, #0044cc);\n background-image: linear-gradient(to bottom, #0088cc, #0044cc);\n background-repeat: repeat-x;\n filter: progid:DXImageTransform.Microsoft.gradient(startColorstr='#ff0088cc', endColorstr='#ff0044cc', GradientType=0);\n border-color: #0044cc #0044cc #002a80;\n border-color: rgba(0, 0, 0, 0.1) rgba(0, 0, 0, 0.1) rgba(0, 0, 0, 0.25);\n *background-color: #0044cc;\n /* Darken IE7 buttons by default so they stand out more given they won't have borders */\n\n filter: progid:DXImageTransform.Microsoft.gradient(enabled = false);\n}\n.btn-primary:hover,\n.btn-primary:focus,\n.btn-primary:active,\n.btn-primary.active,\n.btn-primary.disabled,\n.btn-primary[disabled] {\n color: #ffffff;\n background-color: #0044cc;\n *background-color: #003bb3;\n}\n.btn-primary:active,\n.btn-primary.active {\n background-color: #003399 \\9;\n}\n.btn-warning {\n color: #ffffff;\n text-shadow: 0 -1px 0 rgba(0, 0, 0, 0.25);\n background-color: #faa732;\n background-image: -moz-linear-gradient(top, #fbb450, #f89406);\n background-image: -webkit-gradient(linear, 0 0, 0 100%, from(#fbb450), to(#f89406));\n background-image: -webkit-linear-gradient(top, #fbb450, #f89406);\n background-image: -o-linear-gradient(top, #fbb450, #f89406);\n background-image: linear-gradient(to bottom, #fbb450, #f89406);\n background-repeat: repeat-x;\n filter: progid:DXImageTransform.Microsoft.gradient(startColorstr='#fffbb450', endColorstr='#fff89406', GradientType=0);\n border-color: #f89406 #f89406 #ad6704;\n border-color: rgba(0, 0, 0, 0.1) rgba(0, 0, 0, 0.1) rgba(0, 0, 0, 0.25);\n *background-color: #f89406;\n /* Darken IE7 buttons by default so they stand out more given they won't have borders */\n\n filter: progid:DXImageTransform.Microsoft.gradient(enabled = false);\n}\n.btn-warning:hover,\n.btn-warning:focus,\n.btn-warning:active,\n.btn-warning.active,\n.btn-warning.disabled,\n.btn-warning[disabled] {\n color: #ffffff;\n background-color: #f89406;\n *background-color: #df8505;\n}\n.btn-warning:active,\n.btn-warning.active {\n background-color: #c67605 \\9;\n}\n.btn-danger {\n color: #ffffff;\n text-shadow: 0 -1px 0 rgba(0, 0, 0, 0.25);\n background-color: #da4f49;\n background-image: -moz-linear-gradient(top, #ee5f5b, #bd362f);\n background-image: -webkit-gradient(linear, 0 0, 0 100%, from(#ee5f5b), to(#bd362f));\n background-image: -webkit-linear-gradient(top, #ee5f5b, #bd362f);\n background-image: -o-linear-gradient(top, #ee5f5b, #bd362f);\n background-image: linear-gradient(to bottom, #ee5f5b, #bd362f);\n background-repeat: repeat-x;\n filter: progid:DXImageTransform.Microsoft.gradient(startColorstr='#ffee5f5b', endColorstr='#ffbd362f', GradientType=0);\n border-color: #bd362f #bd362f #802420;\n border-color: rgba(0, 0, 0, 0.1) rgba(0, 0, 0, 0.1) rgba(0, 0, 0, 0.25);\n *background-color: #bd362f;\n /* Darken IE7 buttons by default so they stand out more given they won't have borders */\n\n filter: progid:DXImageTransform.Microsoft.gradient(enabled = false);\n}\n.btn-danger:hover,\n.btn-danger:focus,\n.btn-danger:active,\n.btn-danger.active,\n.btn-danger.disabled,\n.btn-danger[disabled] {\n color: #ffffff;\n background-color: #bd362f;\n *background-color: #a9302a;\n}\n.btn-danger:active,\n.btn-danger.active {\n background-color: #942a25 \\9;\n}\n.btn-success {\n color: #ffffff;\n text-shadow: 0 -1px 0 rgba(0, 0, 0, 0.25);\n background-color: #5bb75b;\n background-image: -moz-linear-gradient(top, #62c462, #51a351);\n background-image: -webkit-gradient(linear, 0 0, 0 100%, from(#62c462), to(#51a351));\n background-image: -webkit-linear-gradient(top, #62c462, #51a351);\n background-image: -o-linear-gradient(top, #62c462, #51a351);\n background-image: linear-gradient(to bottom, #62c462, #51a351);\n background-repeat: repeat-x;\n filter: progid:DXImageTransform.Microsoft.gradient(startColorstr='#ff62c462', endColorstr='#ff51a351', GradientType=0);\n border-color: #51a351 #51a351 #387038;\n border-color: rgba(0, 0, 0, 0.1) rgba(0, 0, 0, 0.1) rgba(0, 0, 0, 0.25);\n *background-color: #51a351;\n /* Darken IE7 buttons by default so they stand out more given they won't have borders */\n\n filter: progid:DXImageTransform.Microsoft.gradient(enabled = false);\n}\n.btn-success:hover,\n.btn-success:focus,\n.btn-success:active,\n.btn-success.active,\n.btn-success.disabled,\n.btn-success[disabled] {\n color: #ffffff;\n background-color: #51a351;\n *background-color: #499249;\n}\n.btn-success:active,\n.btn-success.active {\n background-color: #408140 \\9;\n}\n.btn-info {\n color: #ffffff;\n text-shadow: 0 -1px 0 rgba(0, 0, 0, 0.25);\n background-color: #49afcd;\n background-image: -moz-linear-gradient(top, #5bc0de, #2f96b4);\n background-image: -webkit-gradient(linear, 0 0, 0 100%, from(#5bc0de), to(#2f96b4));\n background-image: -webkit-linear-gradient(top, #5bc0de, #2f96b4);\n background-image: -o-linear-gradient(top, #5bc0de, #2f96b4);\n background-image: linear-gradient(to bottom, #5bc0de, #2f96b4);\n background-repeat: repeat-x;\n filter: progid:DXImageTransform.Microsoft.gradient(startColorstr='#ff5bc0de', endColorstr='#ff2f96b4', GradientType=0);\n border-color: #2f96b4 #2f96b4 #1f6377;\n border-color: rgba(0, 0, 0, 0.1) rgba(0, 0, 0, 0.1) rgba(0, 0, 0, 0.25);\n *background-color: #2f96b4;\n /* Darken IE7 buttons by default so they stand out more given they won't have borders */\n\n filter: progid:DXImageTransform.Microsoft.gradient(enabled = false);\n}\n.btn-info:hover,\n.btn-info:focus,\n.btn-info:active,\n.btn-info.active,\n.btn-info.disabled,\n.btn-info[disabled] {\n color: #ffffff;\n background-color: #2f96b4;\n *background-color: #2a85a0;\n}\n.btn-info:active,\n.btn-info.active {\n background-color: #24748c \\9;\n}\n.btn-inverse {\n color: #ffffff;\n text-shadow: 0 -1px 0 rgba(0, 0, 0, 0.25);\n background-color: #363636;\n background-image: -moz-linear-gradient(top, #444444, #222222);\n background-image: -webkit-gradient(linear, 0 0, 0 100%, from(#444444), to(#222222));\n background-image: -webkit-linear-gradient(top, #444444, #222222);\n background-image: -o-linear-gradient(top, #444444, #222222);\n background-image: linear-gradient(to bottom, #444444, #222222);\n background-repeat: repeat-x;\n filter: progid:DXImageTransform.Microsoft.gradient(startColorstr='#ff444444', endColorstr='#ff222222', GradientType=0);\n border-color: #222222 #222222 #000000;\n border-color: rgba(0, 0, 0, 0.1) rgba(0, 0, 0, 0.1) rgba(0, 0, 0, 0.25);\n *background-color: #222222;\n /* Darken IE7 buttons by default so they stand out more given they won't have borders */\n\n filter: progid:DXImageTransform.Microsoft.gradient(enabled = false);\n}\n.btn-inverse:hover,\n.btn-inverse:focus,\n.btn-inverse:active,\n.btn-inverse.active,\n.btn-inverse.disabled,\n.btn-inverse[disabled] {\n color: #ffffff;\n background-color: #222222;\n *background-color: #151515;\n}\n.btn-inverse:active,\n.btn-inverse.active {\n background-color: #080808 \\9;\n}\nbutton.btn,\ninput[type=\"submit\"].btn {\n *padding-top: 3px;\n *padding-bottom: 3px;\n}\nbutton.btn::-moz-focus-inner,\ninput[type=\"submit\"].btn::-moz-focus-inner {\n padding: 0;\n border: 0;\n}\nbutton.btn.btn-large,\ninput[type=\"submit\"].btn.btn-large {\n *padding-top: 7px;\n *padding-bottom: 7px;\n}\nbutton.btn.btn-small,\ninput[type=\"submit\"].btn.btn-small {\n *padding-top: 3px;\n *padding-bottom: 3px;\n}\nbutton.btn.btn-mini,\ninput[type=\"submit\"].btn.btn-mini {\n *padding-top: 1px;\n *padding-bottom: 1px;\n}\n.btn-link,\n.btn-link:active,\n.btn-link[disabled] {\n background-color: transparent;\n background-image: none;\n -webkit-box-shadow: none;\n -moz-box-shadow: none;\n box-shadow: none;\n}\n.btn-link {\n border-color: transparent;\n cursor: pointer;\n color: #0088cc;\n -webkit-border-radius: 0;\n -moz-border-radius: 0;\n border-radius: 0;\n}\n.btn-link:hover,\n.btn-link:focus {\n color: #005580;\n text-decoration: underline;\n background-color: transparent;\n}\n.btn-link[disabled]:hover,\n.btn-link[disabled]:focus {\n color: #333333;\n text-decoration: none;\n}\n[class^=\"icon-\"],\n[class*=\" icon-\"] {\n display: inline-block;\n width: 14px;\n height: 14px;\n *margin-right: .3em;\n line-height: 14px;\n vertical-align: text-top;\n background-image: url(\"../img/glyphicons-halflings.png\");\n background-position: 14px 14px;\n background-repeat: no-repeat;\n margin-top: 1px;\n}\n/* White icons with optional class, or on hover/focus/active states of certain elements */\n.icon-white,\n.nav-pills > .active > a > [class^=\"icon-\"],\n.nav-pills > .active > a > [class*=\" icon-\"],\n.nav-list > .active > a > [class^=\"icon-\"],\n.nav-list > .active > a > [class*=\" icon-\"],\n.navbar-inverse .nav > .active > a > [class^=\"icon-\"],\n.navbar-inverse .nav > .active > a > [class*=\" icon-\"],\n.dropdown-menu > li > a:hover > [class^=\"icon-\"],\n.dropdown-menu > li > a:focus > [class^=\"icon-\"],\n.dropdown-menu > li > a:hover > [class*=\" icon-\"],\n.dropdown-menu > li > a:focus > [class*=\" icon-\"],\n.dropdown-menu > .active > a > [class^=\"icon-\"],\n.dropdown-menu > .active > a > [class*=\" icon-\"],\n.dropdown-submenu:hover > a > [class^=\"icon-\"],\n.dropdown-submenu:focus > a > [class^=\"icon-\"],\n.dropdown-submenu:hover > a > [class*=\" icon-\"],\n.dropdown-submenu:focus > a > [class*=\" icon-\"] {\n background-image: url(\"../img/glyphicons-halflings-white.png\");\n}\n.icon-glass {\n background-position: 0 0;\n}\n.icon-music {\n background-position: -24px 0;\n}\n.icon-search {\n background-position: -48px 0;\n}\n.icon-envelope {\n background-position: -72px 0;\n}\n.icon-heart {\n background-position: -96px 0;\n}\n.icon-star {\n background-position: -120px 0;\n}\n.icon-star-empty {\n background-position: -144px 0;\n}\n.icon-user {\n background-position: -168px 0;\n}\n.icon-film {\n background-position: -192px 0;\n}\n.icon-th-large {\n background-position: -216px 0;\n}\n.icon-th {\n background-position: -240px 0;\n}\n.icon-th-list {\n background-position: -264px 0;\n}\n.icon-ok {\n background-position: -288px 0;\n}\n.icon-remove {\n background-position: -312px 0;\n}\n.icon-zoom-in {\n background-position: -336px 0;\n}\n.icon-zoom-out {\n background-position: -360px 0;\n}\n.icon-off {\n background-position: -384px 0;\n}\n.icon-signal {\n background-position: -408px 0;\n}\n.icon-cog {\n background-position: -432px 0;\n}\n.icon-trash {\n background-position: -456px 0;\n}\n.icon-home {\n background-position: 0 -24px;\n}\n.icon-file {\n background-position: -24px -24px;\n}\n.icon-time {\n background-position: -48px -24px;\n}\n.icon-road {\n background-position: -72px -24px;\n}\n.icon-download-alt {\n background-position: -96px -24px;\n}\n.icon-download {\n background-position: -120px -24px;\n}\n.icon-upload {\n background-position: -144px -24px;\n}\n.icon-inbox {\n background-position: -168px -24px;\n}\n.icon-play-circle {\n background-position: -192px -24px;\n}\n.icon-repeat {\n background-position: -216px -24px;\n}\n.icon-refresh {\n background-position: -240px -24px;\n}\n.icon-list-alt {\n background-position: -264px -24px;\n}\n.icon-lock {\n background-position: -287px -24px;\n}\n.icon-flag {\n background-position: -312px -24px;\n}\n.icon-headphones {\n background-position: -336px -24px;\n}\n.icon-volume-off {\n background-position: -360px -24px;\n}\n.icon-volume-down {\n background-position: -384px -24px;\n}\n.icon-volume-up {\n background-position: -408px -24px;\n}\n.icon-qrcode {\n background-position: -432px -24px;\n}\n.icon-barcode {\n background-position: -456px -24px;\n}\n.icon-tag {\n background-position: 0 -48px;\n}\n.icon-tags {\n background-position: -25px -48px;\n}\n.icon-book {\n background-position: -48px -48px;\n}\n.icon-bookmark {\n background-position: -72px -48px;\n}\n.icon-print {\n background-position: -96px -48px;\n}\n.icon-camera {\n background-position: -120px -48px;\n}\n.icon-font {\n background-position: -144px -48px;\n}\n.icon-bold {\n background-position: -167px -48px;\n}\n.icon-italic {\n background-position: -192px -48px;\n}\n.icon-text-height {\n background-position: -216px -48px;\n}\n.icon-text-width {\n background-position: -240px -48px;\n}\n.icon-align-left {\n background-position: -264px -48px;\n}\n.icon-align-center {\n background-position: -288px -48px;\n}\n.icon-align-right {\n background-position: -312px -48px;\n}\n.icon-align-justify {\n background-position: -336px -48px;\n}\n.icon-list {\n background-position: -360px -48px;\n}\n.icon-indent-left {\n background-position: -384px -48px;\n}\n.icon-indent-right {\n background-position: -408px -48px;\n}\n.icon-facetime-video {\n background-position: -432px -48px;\n}\n.icon-picture {\n background-position: -456px -48px;\n}\n.icon-pencil {\n background-position: 0 -72px;\n}\n.icon-map-marker {\n background-position: -24px -72px;\n}\n.icon-adjust {\n background-position: -48px -72px;\n}\n.icon-tint {\n background-position: -72px -72px;\n}\n.icon-edit {\n background-position: -96px -72px;\n}\n.icon-share {\n background-position: -120px -72px;\n}\n.icon-check {\n background-position: -144px -72px;\n}\n.icon-move {\n background-position: -168px -72px;\n}\n.icon-step-backward {\n background-position: -192px -72px;\n}\n.icon-fast-backward {\n background-position: -216px -72px;\n}\n.icon-backward {\n background-position: -240px -72px;\n}\n.icon-play {\n background-position: -264px -72px;\n}\n.icon-pause {\n background-position: -288px -72px;\n}\n.icon-stop {\n background-position: -312px -72px;\n}\n.icon-forward {\n background-position: -336px -72px;\n}\n.icon-fast-forward {\n background-position: -360px -72px;\n}\n.icon-step-forward {\n background-position: -384px -72px;\n}\n.icon-eject {\n background-position: -408px -72px;\n}\n.icon-chevron-left {\n background-position: -432px -72px;\n}\n.icon-chevron-right {\n background-position: -456px -72px;\n}\n.icon-plus-sign {\n background-position: 0 -96px;\n}\n.icon-minus-sign {\n background-position: -24px -96px;\n}\n.icon-remove-sign {\n background-position: -48px -96px;\n}\n.icon-ok-sign {\n background-position: -72px -96px;\n}\n.icon-question-sign {\n background-position: -96px -96px;\n}\n.icon-info-sign {\n background-position: -120px -96px;\n}\n.icon-screenshot {\n background-position: -144px -96px;\n}\n.icon-remove-circle {\n background-position: -168px -96px;\n}\n.icon-ok-circle {\n background-position: -192px -96px;\n}\n.icon-ban-circle {\n background-position: -216px -96px;\n}\n.icon-arrow-left {\n background-position: -240px -96px;\n}\n.icon-arrow-right {\n background-position: -264px -96px;\n}\n.icon-arrow-up {\n background-position: -289px -96px;\n}\n.icon-arrow-down {\n background-position: -312px -96px;\n}\n.icon-share-alt {\n background-position: -336px -96px;\n}\n.icon-resize-full {\n background-position: -360px -96px;\n}\n.icon-resize-small {\n background-position: -384px -96px;\n}\n.icon-plus {\n background-position: -408px -96px;\n}\n.icon-minus {\n background-position: -433px -96px;\n}\n.icon-asterisk {\n background-position: -456px -96px;\n}\n.icon-exclamation-sign {\n background-position: 0 -120px;\n}\n.icon-gift {\n background-position: -24px -120px;\n}\n.icon-leaf {\n background-position: -48px -120px;\n}\n.icon-fire {\n background-position: -72px -120px;\n}\n.icon-eye-open {\n background-position: -96px -120px;\n}\n.icon-eye-close {\n background-position: -120px -120px;\n}\n.icon-warning-sign {\n background-position: -144px -120px;\n}\n.icon-plane {\n background-position: -168px -120px;\n}\n.icon-calendar {\n background-position: -192px -120px;\n}\n.icon-random {\n background-position: -216px -120px;\n width: 16px;\n}\n.icon-comment {\n background-position: -240px -120px;\n}\n.icon-magnet {\n background-position: -264px -120px;\n}\n.icon-chevron-up {\n background-position: -288px -120px;\n}\n.icon-chevron-down {\n background-position: -313px -119px;\n}\n.icon-retweet {\n background-position: -336px -120px;\n}\n.icon-shopping-cart {\n background-position: -360px -120px;\n}\n.icon-folder-close {\n background-position: -384px -120px;\n width: 16px;\n}\n.icon-folder-open {\n background-position: -408px -120px;\n width: 16px;\n}\n.icon-resize-vertical {\n background-position: -432px -119px;\n}\n.icon-resize-horizontal {\n background-position: -456px -118px;\n}\n.icon-hdd {\n background-position: 0 -144px;\n}\n.icon-bullhorn {\n background-position: -24px -144px;\n}\n.icon-bell {\n background-position: -48px -144px;\n}\n.icon-certificate {\n background-position: -72px -144px;\n}\n.icon-thumbs-up {\n background-position: -96px -144px;\n}\n.icon-thumbs-down {\n background-position: -120px -144px;\n}\n.icon-hand-right {\n background-position: -144px -144px;\n}\n.icon-hand-left {\n background-position: -168px -144px;\n}\n.icon-hand-up {\n background-position: -192px -144px;\n}\n.icon-hand-down {\n background-position: -216px -144px;\n}\n.icon-circle-arrow-right {\n background-position: -240px -144px;\n}\n.icon-circle-arrow-left {\n background-position: -264px -144px;\n}\n.icon-circle-arrow-up {\n background-position: -288px -144px;\n}\n.icon-circle-arrow-down {\n background-position: -312px -144px;\n}\n.icon-globe {\n background-position: -336px -144px;\n}\n.icon-wrench {\n background-position: -360px -144px;\n}\n.icon-tasks {\n background-position: -384px -144px;\n}\n.icon-filter {\n background-position: -408px -144px;\n}\n.icon-briefcase {\n background-position: -432px -144px;\n}\n.icon-fullscreen {\n background-position: -456px -144px;\n}\n.btn-group {\n position: relative;\n display: inline-block;\n *display: inline;\n /* IE7 inline-block hack */\n\n *zoom: 1;\n font-size: 0;\n vertical-align: middle;\n white-space: nowrap;\n *margin-left: .3em;\n}\n.btn-group:first-child {\n *margin-left: 0;\n}\n.btn-group + .btn-group {\n margin-left: 5px;\n}\n.btn-toolbar {\n font-size: 0;\n margin-top: 10px;\n margin-bottom: 10px;\n}\n.btn-toolbar > .btn + .btn,\n.btn-toolbar > .btn-group + .btn,\n.btn-toolbar > .btn + .btn-group {\n margin-left: 5px;\n}\n.btn-group > .btn {\n position: relative;\n -webkit-border-radius: 0;\n -moz-border-radius: 0;\n border-radius: 0;\n}\n.btn-group > .btn + .btn {\n margin-left: -1px;\n}\n.btn-group > .btn,\n.btn-group > .dropdown-menu,\n.btn-group > .popover {\n font-size: 14px;\n}\n.btn-group > .btn-mini {\n font-size: 10.5px;\n}\n.btn-group > .btn-small {\n font-size: 11.9px;\n}\n.btn-group > .btn-large {\n font-size: 17.5px;\n}\n.btn-group > .btn:first-child {\n margin-left: 0;\n -webkit-border-top-left-radius: 4px;\n -moz-border-radius-topleft: 4px;\n border-top-left-radius: 4px;\n -webkit-border-bottom-left-radius: 4px;\n -moz-border-radius-bottomleft: 4px;\n border-bottom-left-radius: 4px;\n}\n.btn-group > .btn:last-child,\n.btn-group > .dropdown-toggle {\n -webkit-border-top-right-radius: 4px;\n -moz-border-radius-topright: 4px;\n border-top-right-radius: 4px;\n -webkit-border-bottom-right-radius: 4px;\n -moz-border-radius-bottomright: 4px;\n border-bottom-right-radius: 4px;\n}\n.btn-group > .btn.large:first-child {\n margin-left: 0;\n -webkit-border-top-left-radius: 6px;\n -moz-border-radius-topleft: 6px;\n border-top-left-radius: 6px;\n -webkit-border-bottom-left-radius: 6px;\n -moz-border-radius-bottomleft: 6px;\n border-bottom-left-radius: 6px;\n}\n.btn-group > .btn.large:last-child,\n.btn-group > .large.dropdown-toggle {\n -webkit-border-top-right-radius: 6px;\n -moz-border-radius-topright: 6px;\n border-top-right-radius: 6px;\n -webkit-border-bottom-right-radius: 6px;\n -moz-border-radius-bottomright: 6px;\n border-bottom-right-radius: 6px;\n}\n.btn-group > .btn:hover,\n.btn-group > .btn:focus,\n.btn-group > .btn:active,\n.btn-group > .btn.active {\n z-index: 2;\n}\n.btn-group .dropdown-toggle:active,\n.btn-group.open .dropdown-toggle {\n outline: 0;\n}\n.btn-group > .btn + .dropdown-toggle {\n padding-left: 8px;\n padding-right: 8px;\n -webkit-box-shadow: inset 1px 0 0 rgba(255,255,255,.125), inset 0 1px 0 rgba(255,255,255,.2), 0 1px 2px rgba(0,0,0,.05);\n -moz-box-shadow: inset 1px 0 0 rgba(255,255,255,.125), inset 0 1px 0 rgba(255,255,255,.2), 0 1px 2px rgba(0,0,0,.05);\n box-shadow: inset 1px 0 0 rgba(255,255,255,.125), inset 0 1px 0 rgba(255,255,255,.2), 0 1px 2px rgba(0,0,0,.05);\n *padding-top: 5px;\n *padding-bottom: 5px;\n}\n.btn-group > .btn-mini + .dropdown-toggle {\n padding-left: 5px;\n padding-right: 5px;\n *padding-top: 2px;\n *padding-bottom: 2px;\n}\n.btn-group > .btn-small + .dropdown-toggle {\n *padding-top: 5px;\n *padding-bottom: 4px;\n}\n.btn-group > .btn-large + .dropdown-toggle {\n padding-left: 12px;\n padding-right: 12px;\n *padding-top: 7px;\n *padding-bottom: 7px;\n}\n.btn-group.open .dropdown-toggle {\n background-image: none;\n -webkit-box-shadow: inset 0 2px 4px rgba(0,0,0,.15), 0 1px 2px rgba(0,0,0,.05);\n -moz-box-shadow: inset 0 2px 4px rgba(0,0,0,.15), 0 1px 2px rgba(0,0,0,.05);\n box-shadow: inset 0 2px 4px rgba(0,0,0,.15), 0 1px 2px rgba(0,0,0,.05);\n}\n.btn-group.open .btn.dropdown-toggle {\n background-color: #e6e6e6;\n}\n.btn-group.open .btn-primary.dropdown-toggle {\n background-color: #0044cc;\n}\n.btn-group.open .btn-warning.dropdown-toggle {\n background-color: #f89406;\n}\n.btn-group.open .btn-danger.dropdown-toggle {\n background-color: #bd362f;\n}\n.btn-group.open .btn-success.dropdown-toggle {\n background-color: #51a351;\n}\n.btn-group.open .btn-info.dropdown-toggle {\n background-color: #2f96b4;\n}\n.btn-group.open .btn-inverse.dropdown-toggle {\n background-color: #222222;\n}\n.btn .caret {\n margin-top: 8px;\n margin-left: 0;\n}\n.btn-large .caret {\n margin-top: 6px;\n}\n.btn-large .caret {\n border-left-width: 5px;\n border-right-width: 5px;\n border-top-width: 5px;\n}\n.btn-mini .caret,\n.btn-small .caret {\n margin-top: 8px;\n}\n.dropup .btn-large .caret {\n border-bottom-width: 5px;\n}\n.btn-primary .caret,\n.btn-warning .caret,\n.btn-danger .caret,\n.btn-info .caret,\n.btn-success .caret,\n.btn-inverse .caret {\n border-top-color: #ffffff;\n border-bottom-color: #ffffff;\n}\n.btn-group-vertical {\n display: inline-block;\n *display: inline;\n /* IE7 inline-block hack */\n\n *zoom: 1;\n}\n.btn-group-vertical > .btn {\n display: block;\n float: none;\n max-width: 100%;\n -webkit-border-radius: 0;\n -moz-border-radius: 0;\n border-radius: 0;\n}\n.btn-group-vertical > .btn + .btn {\n margin-left: 0;\n margin-top: -1px;\n}\n.btn-group-vertical > .btn:first-child {\n -webkit-border-radius: 4px 4px 0 0;\n -moz-border-radius: 4px 4px 0 0;\n border-radius: 4px 4px 0 0;\n}\n.btn-group-vertical > .btn:last-child {\n -webkit-border-radius: 0 0 4px 4px;\n -moz-border-radius: 0 0 4px 4px;\n border-radius: 0 0 4px 4px;\n}\n.btn-group-vertical > .btn-large:first-child {\n -webkit-border-radius: 6px 6px 0 0;\n -moz-border-radius: 6px 6px 0 0;\n border-radius: 6px 6px 0 0;\n}\n.btn-group-vertical > .btn-large:last-child {\n -webkit-border-radius: 0 0 6px 6px;\n -moz-border-radius: 0 0 6px 6px;\n border-radius: 0 0 6px 6px;\n}\n.nav {\n margin-left: 0;\n margin-bottom: 20px;\n list-style: none;\n}\n.nav > li > a {\n display: block;\n}\n.nav > li > a:hover,\n.nav > li > a:focus {\n text-decoration: none;\n background-color: #eeeeee;\n}\n.nav > li > a > img {\n max-width: none;\n}\n.nav > .pull-right {\n float: right;\n}\n.nav-header {\n display: block;\n padding: 3px 15px;\n font-size: 11px;\n font-weight: bold;\n line-height: 20px;\n color: #999999;\n text-shadow: 0 1px 0 rgba(255, 255, 255, 0.5);\n text-transform: uppercase;\n}\n.nav li + .nav-header {\n margin-top: 9px;\n}\n.nav-list {\n padding-left: 15px;\n padding-right: 15px;\n margin-bottom: 0;\n}\n.nav-list > li > a,\n.nav-list .nav-header {\n margin-left: -15px;\n margin-right: -15px;\n text-shadow: 0 1px 0 rgba(255, 255, 255, 0.5);\n}\n.nav-list > li > a {\n padding: 3px 15px;\n}\n.nav-list > .active > a,\n.nav-list > .active > a:hover,\n.nav-list > .active > a:focus {\n color: #ffffff;\n text-shadow: 0 -1px 0 rgba(0, 0, 0, 0.2);\n background-color: #0088cc;\n}\n.nav-list [class^=\"icon-\"],\n.nav-list [class*=\" icon-\"] {\n margin-right: 2px;\n}\n.nav-list .divider {\n *width: 100%;\n height: 1px;\n margin: 9px 1px;\n *margin: -5px 0 5px;\n overflow: hidden;\n background-color: #e5e5e5;\n border-bottom: 1px solid #ffffff;\n}\n.nav-tabs,\n.nav-pills {\n *zoom: 1;\n}\n.nav-tabs:before,\n.nav-pills:before,\n.nav-tabs:after,\n.nav-pills:after {\n display: table;\n content: \"\";\n line-height: 0;\n}\n.nav-tabs:after,\n.nav-pills:after {\n clear: both;\n}\n.nav-tabs > li,\n.nav-pills > li {\n float: left;\n}\n.nav-tabs > li > a,\n.nav-pills > li > a {\n padding-right: 12px;\n padding-left: 12px;\n margin-right: 2px;\n line-height: 14px;\n}\n.nav-tabs {\n border-bottom: 1px solid #ddd;\n}\n.nav-tabs > li {\n margin-bottom: -1px;\n}\n.nav-tabs > li > a {\n padding-top: 8px;\n padding-bottom: 8px;\n line-height: 20px;\n border: 1px solid transparent;\n -webkit-border-radius: 4px 4px 0 0;\n -moz-border-radius: 4px 4px 0 0;\n border-radius: 4px 4px 0 0;\n}\n.nav-tabs > li > a:hover,\n.nav-tabs > li > a:focus {\n border-color: #eeeeee #eeeeee #dddddd;\n}\n.nav-tabs > .active > a,\n.nav-tabs > .active > a:hover,\n.nav-tabs > .active > a:focus {\n color: #555555;\n background-color: #ffffff;\n border: 1px solid #ddd;\n border-bottom-color: transparent;\n cursor: default;\n}\n.nav-pills > li > a {\n padding-top: 8px;\n padding-bottom: 8px;\n margin-top: 2px;\n margin-bottom: 2px;\n -webkit-border-radius: 5px;\n -moz-border-radius: 5px;\n border-radius: 5px;\n}\n.nav-pills > .active > a,\n.nav-pills > .active > a:hover,\n.nav-pills > .active > a:focus {\n color: #ffffff;\n background-color: #0088cc;\n}\n.nav-stacked > li {\n float: none;\n}\n.nav-stacked > li > a {\n margin-right: 0;\n}\n.nav-tabs.nav-stacked {\n border-bottom: 0;\n}\n.nav-tabs.nav-stacked > li > a {\n border: 1px solid #ddd;\n -webkit-border-radius: 0;\n -moz-border-radius: 0;\n border-radius: 0;\n}\n.nav-tabs.nav-stacked > li:first-child > a {\n -webkit-border-top-right-radius: 4px;\n -moz-border-radius-topright: 4px;\n border-top-right-radius: 4px;\n -webkit-border-top-left-radius: 4px;\n -moz-border-radius-topleft: 4px;\n border-top-left-radius: 4px;\n}\n.nav-tabs.nav-stacked > li:last-child > a {\n -webkit-border-bottom-right-radius: 4px;\n -moz-border-radius-bottomright: 4px;\n border-bottom-right-radius: 4px;\n -webkit-border-bottom-left-radius: 4px;\n -moz-border-radius-bottomleft: 4px;\n border-bottom-left-radius: 4px;\n}\n.nav-tabs.nav-stacked > li > a:hover,\n.nav-tabs.nav-stacked > li > a:focus {\n border-color: #ddd;\n z-index: 2;\n}\n.nav-pills.nav-stacked > li > a {\n margin-bottom: 3px;\n}\n.nav-pills.nav-stacked > li:last-child > a {\n margin-bottom: 1px;\n}\n.nav-tabs .dropdown-menu {\n -webkit-border-radius: 0 0 6px 6px;\n -moz-border-radius: 0 0 6px 6px;\n border-radius: 0 0 6px 6px;\n}\n.nav-pills .dropdown-menu {\n -webkit-border-radius: 6px;\n -moz-border-radius: 6px;\n border-radius: 6px;\n}\n.nav .dropdown-toggle .caret {\n border-top-color: #0088cc;\n border-bottom-color: #0088cc;\n margin-top: 6px;\n}\n.nav .dropdown-toggle:hover .caret,\n.nav .dropdown-toggle:focus .caret {\n border-top-color: #005580;\n border-bottom-color: #005580;\n}\n/* move down carets for tabs */\n.nav-tabs .dropdown-toggle .caret {\n margin-top: 8px;\n}\n.nav .active .dropdown-toggle .caret {\n border-top-color: #fff;\n border-bottom-color: #fff;\n}\n.nav-tabs .active .dropdown-toggle .caret {\n border-top-color: #555555;\n border-bottom-color: #555555;\n}\n.nav > .dropdown.active > a:hover,\n.nav > .dropdown.active > a:focus {\n cursor: pointer;\n}\n.nav-tabs .open .dropdown-toggle,\n.nav-pills .open .dropdown-toggle,\n.nav > li.dropdown.open.active > a:hover,\n.nav > li.dropdown.open.active > a:focus {\n color: #ffffff;\n background-color: #999999;\n border-color: #999999;\n}\n.nav li.dropdown.open .caret,\n.nav li.dropdown.open.active .caret,\n.nav li.dropdown.open a:hover .caret,\n.nav li.dropdown.open a:focus .caret {\n border-top-color: #ffffff;\n border-bottom-color: #ffffff;\n opacity: 1;\n filter: alpha(opacity=100);\n}\n.tabs-stacked .open > a:hover,\n.tabs-stacked .open > a:focus {\n border-color: #999999;\n}\n.tabbable {\n *zoom: 1;\n}\n.tabbable:before,\n.tabbable:after {\n display: table;\n content: \"\";\n line-height: 0;\n}\n.tabbable:after {\n clear: both;\n}\n.tab-content {\n overflow: auto;\n}\n.tabs-below > .nav-tabs,\n.tabs-right > .nav-tabs,\n.tabs-left > .nav-tabs {\n border-bottom: 0;\n}\n.tab-content > .tab-pane,\n.pill-content > .pill-pane {\n display: none;\n}\n.tab-content > .active,\n.pill-content > .active {\n display: block;\n}\n.tabs-below > .nav-tabs {\n border-top: 1px solid #ddd;\n}\n.tabs-below > .nav-tabs > li {\n margin-top: -1px;\n margin-bottom: 0;\n}\n.tabs-below > .nav-tabs > li > a {\n -webkit-border-radius: 0 0 4px 4px;\n -moz-border-radius: 0 0 4px 4px;\n border-radius: 0 0 4px 4px;\n}\n.tabs-below > .nav-tabs > li > a:hover,\n.tabs-below > .nav-tabs > li > a:focus {\n border-bottom-color: transparent;\n border-top-color: #ddd;\n}\n.tabs-below > .nav-tabs > .active > a,\n.tabs-below > .nav-tabs > .active > a:hover,\n.tabs-below > .nav-tabs > .active > a:focus {\n border-color: transparent #ddd #ddd #ddd;\n}\n.tabs-left > .nav-tabs > li,\n.tabs-right > .nav-tabs > li {\n float: none;\n}\n.tabs-left > .nav-tabs > li > a,\n.tabs-right > .nav-tabs > li > a {\n min-width: 74px;\n margin-right: 0;\n margin-bottom: 3px;\n}\n.tabs-left > .nav-tabs {\n float: left;\n margin-right: 19px;\n border-right: 1px solid #ddd;\n}\n.tabs-left > .nav-tabs > li > a {\n margin-right: -1px;\n -webkit-border-radius: 4px 0 0 4px;\n -moz-border-radius: 4px 0 0 4px;\n border-radius: 4px 0 0 4px;\n}\n.tabs-left > .nav-tabs > li > a:hover,\n.tabs-left > .nav-tabs > li > a:focus {\n border-color: #eeeeee #dddddd #eeeeee #eeeeee;\n}\n.tabs-left > .nav-tabs .active > a,\n.tabs-left > .nav-tabs .active > a:hover,\n.tabs-left > .nav-tabs .active > a:focus {\n border-color: #ddd transparent #ddd #ddd;\n *border-right-color: #ffffff;\n}\n.tabs-right > .nav-tabs {\n float: right;\n margin-left: 19px;\n border-left: 1px solid #ddd;\n}\n.tabs-right > .nav-tabs > li > a {\n margin-left: -1px;\n -webkit-border-radius: 0 4px 4px 0;\n -moz-border-radius: 0 4px 4px 0;\n border-radius: 0 4px 4px 0;\n}\n.tabs-right > .nav-tabs > li > a:hover,\n.tabs-right > .nav-tabs > li > a:focus {\n border-color: #eeeeee #eeeeee #eeeeee #dddddd;\n}\n.tabs-right > .nav-tabs .active > a,\n.tabs-right > .nav-tabs .active > a:hover,\n.tabs-right > .nav-tabs .active > a:focus {\n border-color: #ddd #ddd #ddd transparent;\n *border-left-color: #ffffff;\n}\n.nav > .disabled > a {\n color: #999999;\n}\n.nav > .disabled > a:hover,\n.nav > .disabled > a:focus {\n text-decoration: none;\n background-color: transparent;\n cursor: default;\n}\n.navbar {\n overflow: visible;\n margin-bottom: 20px;\n *position: relative;\n *z-index: 2;\n}\n.navbar-inner {\n min-height: 40px;\n padding-left: 20px;\n padding-right: 20px;\n background-color: #fafafa;\n background-image: -moz-linear-gradient(top, #ffffff, #f2f2f2);\n background-image: -webkit-gradient(linear, 0 0, 0 100%, from(#ffffff), to(#f2f2f2));\n background-image: -webkit-linear-gradient(top, #ffffff, #f2f2f2);\n background-image: -o-linear-gradient(top, #ffffff, #f2f2f2);\n background-image: linear-gradient(to bottom, #ffffff, #f2f2f2);\n background-repeat: repeat-x;\n filter: progid:DXImageTransform.Microsoft.gradient(startColorstr='#ffffffff', endColorstr='#fff2f2f2', GradientType=0);\n border: 1px solid #d4d4d4;\n -webkit-border-radius: 4px;\n -moz-border-radius: 4px;\n border-radius: 4px;\n -webkit-box-shadow: 0 1px 4px rgba(0, 0, 0, 0.065);\n -moz-box-shadow: 0 1px 4px rgba(0, 0, 0, 0.065);\n box-shadow: 0 1px 4px rgba(0, 0, 0, 0.065);\n *zoom: 1;\n}\n.navbar-inner:before,\n.navbar-inner:after {\n display: table;\n content: \"\";\n line-height: 0;\n}\n.navbar-inner:after {\n clear: both;\n}\n.navbar .container {\n width: auto;\n}\n.nav-collapse.collapse {\n height: auto;\n overflow: visible;\n}\n.navbar .brand {\n float: left;\n display: block;\n padding: 10px 20px 10px;\n margin-left: -20px;\n font-size: 20px;\n font-weight: 200;\n color: #777777;\n text-shadow: 0 1px 0 #ffffff;\n}\n.navbar .brand:hover,\n.navbar .brand:focus {\n text-decoration: none;\n}\n.navbar-text {\n margin-bottom: 0;\n line-height: 40px;\n color: #777777;\n}\n.navbar-link {\n color: #777777;\n}\n.navbar-link:hover,\n.navbar-link:focus {\n color: #333333;\n}\n.navbar .divider-vertical {\n height: 40px;\n margin: 0 9px;\n border-left: 1px solid #f2f2f2;\n border-right: 1px solid #ffffff;\n}\n.navbar .btn,\n.navbar .btn-group {\n margin-top: 5px;\n}\n.navbar .btn-group .btn,\n.navbar .input-prepend .btn,\n.navbar .input-append .btn,\n.navbar .input-prepend .btn-group,\n.navbar .input-append .btn-group {\n margin-top: 0;\n}\n.navbar-form {\n margin-bottom: 0;\n *zoom: 1;\n}\n.navbar-form:before,\n.navbar-form:after {\n display: table;\n content: \"\";\n line-height: 0;\n}\n.navbar-form:after {\n clear: both;\n}\n.navbar-form input,\n.navbar-form select,\n.navbar-form .radio,\n.navbar-form .checkbox {\n margin-top: 5px;\n}\n.navbar-form input,\n.navbar-form select,\n.navbar-form .btn {\n display: inline-block;\n margin-bottom: 0;\n}\n.navbar-form input[type=\"image\"],\n.navbar-form input[type=\"checkbox\"],\n.navbar-form input[type=\"radio\"] {\n margin-top: 3px;\n}\n.navbar-form .input-append,\n.navbar-form .input-prepend {\n margin-top: 5px;\n white-space: nowrap;\n}\n.navbar-form .input-append input,\n.navbar-form .input-prepend input {\n margin-top: 0;\n}\n.navbar-search {\n position: relative;\n float: left;\n margin-top: 5px;\n margin-bottom: 0;\n}\n.navbar-search .search-query {\n margin-bottom: 0;\n padding: 4px 14px;\n font-family: \"Helvetica Neue\", Helvetica, Arial, sans-serif;\n font-size: 13px;\n font-weight: normal;\n line-height: 1;\n -webkit-border-radius: 15px;\n -moz-border-radius: 15px;\n border-radius: 15px;\n}\n.navbar-static-top {\n position: static;\n margin-bottom: 0;\n}\n.navbar-static-top .navbar-inner {\n -webkit-border-radius: 0;\n -moz-border-radius: 0;\n border-radius: 0;\n}\n.navbar-fixed-top,\n.navbar-fixed-bottom {\n position: fixed;\n right: 0;\n left: 0;\n z-index: 1030;\n margin-bottom: 0;\n}\n.navbar-fixed-top .navbar-inner,\n.navbar-static-top .navbar-inner {\n border-width: 0 0 1px;\n}\n.navbar-fixed-bottom .navbar-inner {\n border-width: 1px 0 0;\n}\n.navbar-fixed-top .navbar-inner,\n.navbar-fixed-bottom .navbar-inner {\n padding-left: 0;\n padding-right: 0;\n -webkit-border-radius: 0;\n -moz-border-radius: 0;\n border-radius: 0;\n}\n.navbar-static-top .container,\n.navbar-fixed-top .container,\n.navbar-fixed-bottom .container {\n width: 940px;\n}\n.navbar-fixed-top {\n top: 0;\n}\n.navbar-fixed-top .navbar-inner,\n.navbar-static-top .navbar-inner {\n -webkit-box-shadow: 0 1px 10px rgba(0,0,0,.1);\n -moz-box-shadow: 0 1px 10px rgba(0,0,0,.1);\n box-shadow: 0 1px 10px rgba(0,0,0,.1);\n}\n.navbar-fixed-bottom {\n bottom: 0;\n}\n.navbar-fixed-bottom .navbar-inner {\n -webkit-box-shadow: 0 -1px 10px rgba(0,0,0,.1);\n -moz-box-shadow: 0 -1px 10px rgba(0,0,0,.1);\n box-shadow: 0 -1px 10px rgba(0,0,0,.1);\n}\n.navbar .nav {\n position: relative;\n left: 0;\n display: block;\n float: left;\n margin: 0 10px 0 0;\n}\n.navbar .nav.pull-right {\n float: right;\n margin-right: 0;\n}\n.navbar .nav > li {\n float: left;\n}\n.navbar .nav > li > a {\n float: none;\n padding: 10px 15px 10px;\n color: #777777;\n text-decoration: none;\n text-shadow: 0 1px 0 #ffffff;\n}\n.navbar .nav .dropdown-toggle .caret {\n margin-top: 8px;\n}\n.navbar .nav > li > a:focus,\n.navbar .nav > li > a:hover {\n background-color: transparent;\n color: #333333;\n text-decoration: none;\n}\n.navbar .nav > .active > a,\n.navbar .nav > .active > a:hover,\n.navbar .nav > .active > a:focus {\n color: #555555;\n text-decoration: none;\n background-color: #e5e5e5;\n -webkit-box-shadow: inset 0 3px 8px rgba(0, 0, 0, 0.125);\n -moz-box-shadow: inset 0 3px 8px rgba(0, 0, 0, 0.125);\n box-shadow: inset 0 3px 8px rgba(0, 0, 0, 0.125);\n}\n.navbar .btn-navbar {\n display: none;\n float: right;\n padding: 7px 10px;\n margin-left: 5px;\n margin-right: 5px;\n color: #ffffff;\n text-shadow: 0 -1px 0 rgba(0, 0, 0, 0.25);\n background-color: #ededed;\n background-image: -moz-linear-gradient(top, #f2f2f2, #e5e5e5);\n background-image: -webkit-gradient(linear, 0 0, 0 100%, from(#f2f2f2), to(#e5e5e5));\n background-image: -webkit-linear-gradient(top, #f2f2f2, #e5e5e5);\n background-image: -o-linear-gradient(top, #f2f2f2, #e5e5e5);\n background-image: linear-gradient(to bottom, #f2f2f2, #e5e5e5);\n background-repeat: repeat-x;\n filter: progid:DXImageTransform.Microsoft.gradient(startColorstr='#fff2f2f2', endColorstr='#ffe5e5e5', GradientType=0);\n border-color: #e5e5e5 #e5e5e5 #bfbfbf;\n border-color: rgba(0, 0, 0, 0.1) rgba(0, 0, 0, 0.1) rgba(0, 0, 0, 0.25);\n *background-color: #e5e5e5;\n /* Darken IE7 buttons by default so they stand out more given they won't have borders */\n\n filter: progid:DXImageTransform.Microsoft.gradient(enabled = false);\n -webkit-box-shadow: inset 0 1px 0 rgba(255,255,255,.1), 0 1px 0 rgba(255,255,255,.075);\n -moz-box-shadow: inset 0 1px 0 rgba(255,255,255,.1), 0 1px 0 rgba(255,255,255,.075);\n box-shadow: inset 0 1px 0 rgba(255,255,255,.1), 0 1px 0 rgba(255,255,255,.075);\n}\n.navbar .btn-navbar:hover,\n.navbar .btn-navbar:focus,\n.navbar .btn-navbar:active,\n.navbar .btn-navbar.active,\n.navbar .btn-navbar.disabled,\n.navbar .btn-navbar[disabled] {\n color: #ffffff;\n background-color: #e5e5e5;\n *background-color: #d9d9d9;\n}\n.navbar .btn-navbar:active,\n.navbar .btn-navbar.active {\n background-color: #cccccc \\9;\n}\n.navbar .btn-navbar .icon-bar {\n display: block;\n width: 18px;\n height: 2px;\n background-color: #f5f5f5;\n -webkit-border-radius: 1px;\n -moz-border-radius: 1px;\n border-radius: 1px;\n -webkit-box-shadow: 0 1px 0 rgba(0, 0, 0, 0.25);\n -moz-box-shadow: 0 1px 0 rgba(0, 0, 0, 0.25);\n box-shadow: 0 1px 0 rgba(0, 0, 0, 0.25);\n}\n.btn-navbar .icon-bar + .icon-bar {\n margin-top: 3px;\n}\n.navbar .nav > li > .dropdown-menu:before {\n content: '';\n display: inline-block;\n border-left: 7px solid transparent;\n border-right: 7px solid transparent;\n border-bottom: 7px solid #ccc;\n border-bottom-color: rgba(0, 0, 0, 0.2);\n position: absolute;\n top: -7px;\n left: 9px;\n}\n.navbar .nav > li > .dropdown-menu:after {\n content: '';\n display: inline-block;\n border-left: 6px solid transparent;\n border-right: 6px solid transparent;\n border-bottom: 6px solid #ffffff;\n position: absolute;\n top: -6px;\n left: 10px;\n}\n.navbar-fixed-bottom .nav > li > .dropdown-menu:before {\n border-top: 7px solid #ccc;\n border-top-color: rgba(0, 0, 0, 0.2);\n border-bottom: 0;\n bottom: -7px;\n top: auto;\n}\n.navbar-fixed-bottom .nav > li > .dropdown-menu:after {\n border-top: 6px solid #ffffff;\n border-bottom: 0;\n bottom: -6px;\n top: auto;\n}\n.navbar .nav li.dropdown > a:hover .caret,\n.navbar .nav li.dropdown > a:focus .caret {\n border-top-color: #333333;\n border-bottom-color: #333333;\n}\n.navbar .nav li.dropdown.open > .dropdown-toggle,\n.navbar .nav li.dropdown.active > .dropdown-toggle,\n.navbar .nav li.dropdown.open.active > .dropdown-toggle {\n background-color: #e5e5e5;\n color: #555555;\n}\n.navbar .nav li.dropdown > .dropdown-toggle .caret {\n border-top-color: #777777;\n border-bottom-color: #777777;\n}\n.navbar .nav li.dropdown.open > .dropdown-toggle .caret,\n.navbar .nav li.dropdown.active > .dropdown-toggle .caret,\n.navbar .nav li.dropdown.open.active > .dropdown-toggle .caret {\n border-top-color: #555555;\n border-bottom-color: #555555;\n}\n.navbar .pull-right > li > .dropdown-menu,\n.navbar .nav > li > .dropdown-menu.pull-right {\n left: auto;\n right: 0;\n}\n.navbar .pull-right > li > .dropdown-menu:before,\n.navbar .nav > li > .dropdown-menu.pull-right:before {\n left: auto;\n right: 12px;\n}\n.navbar .pull-right > li > .dropdown-menu:after,\n.navbar .nav > li > .dropdown-menu.pull-right:after {\n left: auto;\n right: 13px;\n}\n.navbar .pull-right > li > .dropdown-menu .dropdown-menu,\n.navbar .nav > li > .dropdown-menu.pull-right .dropdown-menu {\n left: auto;\n right: 100%;\n margin-left: 0;\n margin-right: -1px;\n -webkit-border-radius: 6px 0 6px 6px;\n -moz-border-radius: 6px 0 6px 6px;\n border-radius: 6px 0 6px 6px;\n}\n.navbar-inverse .navbar-inner {\n background-color: #1b1b1b;\n background-image: -moz-linear-gradient(top, #222222, #111111);\n background-image: -webkit-gradient(linear, 0 0, 0 100%, from(#222222), to(#111111));\n background-image: -webkit-linear-gradient(top, #222222, #111111);\n background-image: -o-linear-gradient(top, #222222, #111111);\n background-image: linear-gradient(to bottom, #222222, #111111);\n background-repeat: repeat-x;\n filter: progid:DXImageTransform.Microsoft.gradient(startColorstr='#ff222222', endColorstr='#ff111111', GradientType=0);\n border-color: #252525;\n}\n.navbar-inverse .brand,\n.navbar-inverse .nav > li > a {\n color: #999999;\n text-shadow: 0 -1px 0 rgba(0, 0, 0, 0.25);\n}\n.navbar-inverse .brand:hover,\n.navbar-inverse .nav > li > a:hover,\n.navbar-inverse .brand:focus,\n.navbar-inverse .nav > li > a:focus {\n color: #ffffff;\n}\n.navbar-inverse .brand {\n color: #999999;\n}\n.navbar-inverse .navbar-text {\n color: #999999;\n}\n.navbar-inverse .nav > li > a:focus,\n.navbar-inverse .nav > li > a:hover {\n background-color: transparent;\n color: #ffffff;\n}\n.navbar-inverse .nav .active > a,\n.navbar-inverse .nav .active > a:hover,\n.navbar-inverse .nav .active > a:focus {\n color: #ffffff;\n background-color: #111111;\n}\n.navbar-inverse .navbar-link {\n color: #999999;\n}\n.navbar-inverse .navbar-link:hover,\n.navbar-inverse .navbar-link:focus {\n color: #ffffff;\n}\n.navbar-inverse .divider-vertical {\n border-left-color: #111111;\n border-right-color: #222222;\n}\n.navbar-inverse .nav li.dropdown.open > .dropdown-toggle,\n.navbar-inverse .nav li.dropdown.active > .dropdown-toggle,\n.navbar-inverse .nav li.dropdown.open.active > .dropdown-toggle {\n background-color: #111111;\n color: #ffffff;\n}\n.navbar-inverse .nav li.dropdown > a:hover .caret,\n.navbar-inverse .nav li.dropdown > a:focus .caret {\n border-top-color: #ffffff;\n border-bottom-color: #ffffff;\n}\n.navbar-inverse .nav li.dropdown > .dropdown-toggle .caret {\n border-top-color: #999999;\n border-bottom-color: #999999;\n}\n.navbar-inverse .nav li.dropdown.open > .dropdown-toggle .caret,\n.navbar-inverse .nav li.dropdown.active > .dropdown-toggle .caret,\n.navbar-inverse .nav li.dropdown.open.active > .dropdown-toggle .caret {\n border-top-color: #ffffff;\n border-bottom-color: #ffffff;\n}\n.navbar-inverse .navbar-search .search-query {\n color: #ffffff;\n background-color: #515151;\n border-color: #111111;\n -webkit-box-shadow: inset 0 1px 2px rgba(0,0,0,.1), 0 1px 0 rgba(255,255,255,.15);\n -moz-box-shadow: inset 0 1px 2px rgba(0,0,0,.1), 0 1px 0 rgba(255,255,255,.15);\n box-shadow: inset 0 1px 2px rgba(0,0,0,.1), 0 1px 0 rgba(255,255,255,.15);\n -webkit-transition: none;\n -moz-transition: none;\n -o-transition: none;\n transition: none;\n}\n.navbar-inverse .navbar-search .search-query:-moz-placeholder {\n color: #cccccc;\n}\n.navbar-inverse .navbar-search .search-query:-ms-input-placeholder {\n color: #cccccc;\n}\n.navbar-inverse .navbar-search .search-query::-webkit-input-placeholder {\n color: #cccccc;\n}\n.navbar-inverse .navbar-search .search-query:focus,\n.navbar-inverse .navbar-search .search-query.focused {\n padding: 5px 15px;\n color: #333333;\n text-shadow: 0 1px 0 #ffffff;\n background-color: #ffffff;\n border: 0;\n -webkit-box-shadow: 0 0 3px rgba(0, 0, 0, 0.15);\n -moz-box-shadow: 0 0 3px rgba(0, 0, 0, 0.15);\n box-shadow: 0 0 3px rgba(0, 0, 0, 0.15);\n outline: 0;\n}\n.navbar-inverse .btn-navbar {\n color: #ffffff;\n text-shadow: 0 -1px 0 rgba(0, 0, 0, 0.25);\n background-color: #0e0e0e;\n background-image: -moz-linear-gradient(top, #151515, #040404);\n background-image: -webkit-gradient(linear, 0 0, 0 100%, from(#151515), to(#040404));\n background-image: -webkit-linear-gradient(top, #151515, #040404);\n background-image: -o-linear-gradient(top, #151515, #040404);\n background-image: linear-gradient(to bottom, #151515, #040404);\n background-repeat: repeat-x;\n filter: progid:DXImageTransform.Microsoft.gradient(startColorstr='#ff151515', endColorstr='#ff040404', GradientType=0);\n border-color: #040404 #040404 #000000;\n border-color: rgba(0, 0, 0, 0.1) rgba(0, 0, 0, 0.1) rgba(0, 0, 0, 0.25);\n *background-color: #040404;\n /* Darken IE7 buttons by default so they stand out more given they won't have borders */\n\n filter: progid:DXImageTransform.Microsoft.gradient(enabled = false);\n}\n.navbar-inverse .btn-navbar:hover,\n.navbar-inverse .btn-navbar:focus,\n.navbar-inverse .btn-navbar:active,\n.navbar-inverse .btn-navbar.active,\n.navbar-inverse .btn-navbar.disabled,\n.navbar-inverse .btn-navbar[disabled] {\n color: #ffffff;\n background-color: #040404;\n *background-color: #000000;\n}\n.navbar-inverse .btn-navbar:active,\n.navbar-inverse .btn-navbar.active {\n background-color: #000000 \\9;\n}\n.breadcrumb {\n padding: 8px 15px;\n margin: 0 0 20px;\n list-style: none;\n background-color: #f5f5f5;\n -webkit-border-radius: 4px;\n -moz-border-radius: 4px;\n border-radius: 4px;\n}\n.breadcrumb > li {\n display: inline-block;\n *display: inline;\n /* IE7 inline-block hack */\n\n *zoom: 1;\n text-shadow: 0 1px 0 #ffffff;\n}\n.breadcrumb > li > .divider {\n padding: 0 5px;\n color: #ccc;\n}\n.breadcrumb > .active {\n color: #999999;\n}\n.pagination {\n margin: 20px 0;\n}\n.pagination ul {\n display: inline-block;\n *display: inline;\n /* IE7 inline-block hack */\n\n *zoom: 1;\n margin-left: 0;\n margin-bottom: 0;\n -webkit-border-radius: 4px;\n -moz-border-radius: 4px;\n border-radius: 4px;\n -webkit-box-shadow: 0 1px 2px rgba(0, 0, 0, 0.05);\n -moz-box-shadow: 0 1px 2px rgba(0, 0, 0, 0.05);\n box-shadow: 0 1px 2px rgba(0, 0, 0, 0.05);\n}\n.pagination ul > li {\n display: inline;\n}\n.pagination ul > li > a,\n.pagination ul > li > span {\n float: left;\n padding: 4px 12px;\n line-height: 20px;\n text-decoration: none;\n background-color: #ffffff;\n border: 1px solid #dddddd;\n border-left-width: 0;\n}\n.pagination ul > li > a:hover,\n.pagination ul > li > a:focus,\n.pagination ul > .active > a,\n.pagination ul > .active > span {\n background-color: #f5f5f5;\n}\n.pagination ul > .active > a,\n.pagination ul > .active > span {\n color: #999999;\n cursor: default;\n}\n.pagination ul > .disabled > span,\n.pagination ul > .disabled > a,\n.pagination ul > .disabled > a:hover,\n.pagination ul > .disabled > a:focus {\n color: #999999;\n background-color: transparent;\n cursor: default;\n}\n.pagination ul > li:first-child > a,\n.pagination ul > li:first-child > span {\n border-left-width: 1px;\n -webkit-border-top-left-radius: 4px;\n -moz-border-radius-topleft: 4px;\n border-top-left-radius: 4px;\n -webkit-border-bottom-left-radius: 4px;\n -moz-border-radius-bottomleft: 4px;\n border-bottom-left-radius: 4px;\n}\n.pagination ul > li:last-child > a,\n.pagination ul > li:last-child > span {\n -webkit-border-top-right-radius: 4px;\n -moz-border-radius-topright: 4px;\n border-top-right-radius: 4px;\n -webkit-border-bottom-right-radius: 4px;\n -moz-border-radius-bottomright: 4px;\n border-bottom-right-radius: 4px;\n}\n.pagination-centered {\n text-align: center;\n}\n.pagination-right {\n text-align: right;\n}\n.pagination-large ul > li > a,\n.pagination-large ul > li > span {\n padding: 11px 19px;\n font-size: 17.5px;\n}\n.pagination-large ul > li:first-child > a,\n.pagination-large ul > li:first-child > span {\n -webkit-border-top-left-radius: 6px;\n -moz-border-radius-topleft: 6px;\n border-top-left-radius: 6px;\n -webkit-border-bottom-left-radius: 6px;\n -moz-border-radius-bottomleft: 6px;\n border-bottom-left-radius: 6px;\n}\n.pagination-large ul > li:last-child > a,\n.pagination-large ul > li:last-child > span {\n -webkit-border-top-right-radius: 6px;\n -moz-border-radius-topright: 6px;\n border-top-right-radius: 6px;\n -webkit-border-bottom-right-radius: 6px;\n -moz-border-radius-bottomright: 6px;\n border-bottom-right-radius: 6px;\n}\n.pagination-mini ul > li:first-child > a,\n.pagination-small ul > li:first-child > a,\n.pagination-mini ul > li:first-child > span,\n.pagination-small ul > li:first-child > span {\n -webkit-border-top-left-radius: 3px;\n -moz-border-radius-topleft: 3px;\n border-top-left-radius: 3px;\n -webkit-border-bottom-left-radius: 3px;\n -moz-border-radius-bottomleft: 3px;\n border-bottom-left-radius: 3px;\n}\n.pagination-mini ul > li:last-child > a,\n.pagination-small ul > li:last-child > a,\n.pagination-mini ul > li:last-child > span,\n.pagination-small ul > li:last-child > span {\n -webkit-border-top-right-radius: 3px;\n -moz-border-radius-topright: 3px;\n border-top-right-radius: 3px;\n -webkit-border-bottom-right-radius: 3px;\n -moz-border-radius-bottomright: 3px;\n border-bottom-right-radius: 3px;\n}\n.pagination-small ul > li > a,\n.pagination-small ul > li > span {\n padding: 2px 10px;\n font-size: 11.9px;\n}\n.pagination-mini ul > li > a,\n.pagination-mini ul > li > span {\n padding: 0 6px;\n font-size: 10.5px;\n}\n.pager {\n margin: 20px 0;\n list-style: none;\n text-align: center;\n *zoom: 1;\n}\n.pager:before,\n.pager:after {\n display: table;\n content: \"\";\n line-height: 0;\n}\n.pager:after {\n clear: both;\n}\n.pager li {\n display: inline;\n}\n.pager li > a,\n.pager li > span {\n display: inline-block;\n padding: 5px 14px;\n background-color: #fff;\n border: 1px solid #ddd;\n -webkit-border-radius: 15px;\n -moz-border-radius: 15px;\n border-radius: 15px;\n}\n.pager li > a:hover,\n.pager li > a:focus {\n text-decoration: none;\n background-color: #f5f5f5;\n}\n.pager .next > a,\n.pager .next > span {\n float: right;\n}\n.pager .previous > a,\n.pager .previous > span {\n float: left;\n}\n.pager .disabled > a,\n.pager .disabled > a:hover,\n.pager .disabled > a:focus,\n.pager .disabled > span {\n color: #999999;\n background-color: #fff;\n cursor: default;\n}\n.thumbnails {\n margin-left: -20px;\n list-style: none;\n *zoom: 1;\n}\n.thumbnails:before,\n.thumbnails:after {\n display: table;\n content: \"\";\n line-height: 0;\n}\n.thumbnails:after {\n clear: both;\n}\n.row-fluid .thumbnails {\n margin-left: 0;\n}\n.thumbnails > li {\n float: left;\n margin-bottom: 20px;\n margin-left: 20px;\n}\n.thumbnail {\n display: block;\n padding: 4px;\n line-height: 20px;\n border: 1px solid #ddd;\n -webkit-border-radius: 4px;\n -moz-border-radius: 4px;\n border-radius: 4px;\n -webkit-box-shadow: 0 1px 3px rgba(0, 0, 0, 0.055);\n -moz-box-shadow: 0 1px 3px rgba(0, 0, 0, 0.055);\n box-shadow: 0 1px 3px rgba(0, 0, 0, 0.055);\n -webkit-transition: all 0.2s ease-in-out;\n -moz-transition: all 0.2s ease-in-out;\n -o-transition: all 0.2s ease-in-out;\n transition: all 0.2s ease-in-out;\n}\na.thumbnail:hover,\na.thumbnail:focus {\n border-color: #0088cc;\n -webkit-box-shadow: 0 1px 4px rgba(0, 105, 214, 0.25);\n -moz-box-shadow: 0 1px 4px rgba(0, 105, 214, 0.25);\n box-shadow: 0 1px 4px rgba(0, 105, 214, 0.25);\n}\n.thumbnail > img {\n display: block;\n max-width: 100%;\n margin-left: auto;\n margin-right: auto;\n}\n.thumbnail .caption {\n padding: 9px;\n color: #555555;\n}\n.alert {\n padding: 8px 35px 8px 14px;\n margin-bottom: 20px;\n text-shadow: 0 1px 0 rgba(255, 255, 255, 0.5);\n background-color: #fcf8e3;\n border: 1px solid #fbeed5;\n -webkit-border-radius: 4px;\n -moz-border-radius: 4px;\n border-radius: 4px;\n}\n.alert,\n.alert h4 {\n color: #c09853;\n}\n.alert h4 {\n margin: 0;\n}\n.alert .close {\n position: relative;\n top: -2px;\n right: -21px;\n line-height: 20px;\n}\n.alert-success {\n background-color: #dff0d8;\n border-color: #d6e9c6;\n color: #468847;\n}\n.alert-success h4 {\n color: #468847;\n}\n.alert-danger,\n.alert-error {\n background-color: #f2dede;\n border-color: #eed3d7;\n color: #b94a48;\n}\n.alert-danger h4,\n.alert-error h4 {\n color: #b94a48;\n}\n.alert-info {\n background-color: #d9edf7;\n border-color: #bce8f1;\n color: #3a87ad;\n}\n.alert-info h4 {\n color: #3a87ad;\n}\n.alert-block {\n padding-top: 14px;\n padding-bottom: 14px;\n}\n.alert-block > p,\n.alert-block > ul {\n margin-bottom: 0;\n}\n.alert-block p + p {\n margin-top: 5px;\n}\n@-webkit-keyframes progress-bar-stripes {\n from {\n background-position: 40px 0;\n }\n to {\n background-position: 0 0;\n }\n}\n@-moz-keyframes progress-bar-stripes {\n from {\n background-position: 40px 0;\n }\n to {\n background-position: 0 0;\n }\n}\n@-ms-keyframes progress-bar-stripes {\n from {\n background-position: 40px 0;\n }\n to {\n background-position: 0 0;\n }\n}\n@-o-keyframes progress-bar-stripes {\n from {\n background-position: 0 0;\n }\n to {\n background-position: 40px 0;\n }\n}\n@keyframes progress-bar-stripes {\n from {\n background-position: 40px 0;\n }\n to {\n background-position: 0 0;\n }\n}\n.progress {\n overflow: hidden;\n height: 20px;\n margin-bottom: 20px;\n background-color: #f7f7f7;\n background-image: -moz-linear-gradient(top, #f5f5f5, #f9f9f9);\n background-image: -webkit-gradient(linear, 0 0, 0 100%, from(#f5f5f5), to(#f9f9f9));\n background-image: -webkit-linear-gradient(top, #f5f5f5, #f9f9f9);\n background-image: -o-linear-gradient(top, #f5f5f5, #f9f9f9);\n background-image: linear-gradient(to bottom, #f5f5f5, #f9f9f9);\n background-repeat: repeat-x;\n filter: progid:DXImageTransform.Microsoft.gradient(startColorstr='#fff5f5f5', endColorstr='#fff9f9f9', GradientType=0);\n -webkit-box-shadow: inset 0 1px 2px rgba(0, 0, 0, 0.1);\n -moz-box-shadow: inset 0 1px 2px rgba(0, 0, 0, 0.1);\n box-shadow: inset 0 1px 2px rgba(0, 0, 0, 0.1);\n -webkit-border-radius: 4px;\n -moz-border-radius: 4px;\n border-radius: 4px;\n}\n.progress .bar {\n width: 0%;\n height: 100%;\n color: #ffffff;\n float: left;\n font-size: 12px;\n text-align: center;\n text-shadow: 0 -1px 0 rgba(0, 0, 0, 0.25);\n background-color: #0e90d2;\n background-image: -moz-linear-gradient(top, #149bdf, #0480be);\n background-image: -webkit-gradient(linear, 0 0, 0 100%, from(#149bdf), to(#0480be));\n background-image: -webkit-linear-gradient(top, #149bdf, #0480be);\n background-image: -o-linear-gradient(top, #149bdf, #0480be);\n background-image: linear-gradient(to bottom, #149bdf, #0480be);\n background-repeat: repeat-x;\n filter: progid:DXImageTransform.Microsoft.gradient(startColorstr='#ff149bdf', endColorstr='#ff0480be', GradientType=0);\n -webkit-box-shadow: inset 0 -1px 0 rgba(0, 0, 0, 0.15);\n -moz-box-shadow: inset 0 -1px 0 rgba(0, 0, 0, 0.15);\n box-shadow: inset 0 -1px 0 rgba(0, 0, 0, 0.15);\n -webkit-box-sizing: border-box;\n -moz-box-sizing: border-box;\n box-sizing: border-box;\n -webkit-transition: width 0.6s ease;\n -moz-transition: width 0.6s ease;\n -o-transition: width 0.6s ease;\n transition: width 0.6s ease;\n}\n.progress .bar + .bar {\n -webkit-box-shadow: inset 1px 0 0 rgba(0,0,0,.15), inset 0 -1px 0 rgba(0,0,0,.15);\n -moz-box-shadow: inset 1px 0 0 rgba(0,0,0,.15), inset 0 -1px 0 rgba(0,0,0,.15);\n box-shadow: inset 1px 0 0 rgba(0,0,0,.15), inset 0 -1px 0 rgba(0,0,0,.15);\n}\n.progress-striped .bar {\n background-color: #149bdf;\n background-image: -webkit-gradient(linear, 0 100%, 100% 0, color-stop(0.25, rgba(255, 255, 255, 0.15)), color-stop(0.25, transparent), color-stop(0.5, transparent), color-stop(0.5, rgba(255, 255, 255, 0.15)), color-stop(0.75, rgba(255, 255, 255, 0.15)), color-stop(0.75, transparent), to(transparent));\n background-image: -webkit-linear-gradient(45deg, rgba(255, 255, 255, 0.15) 25%, transparent 25%, transparent 50%, rgba(255, 255, 255, 0.15) 50%, rgba(255, 255, 255, 0.15) 75%, transparent 75%, transparent);\n background-image: -moz-linear-gradient(45deg, rgba(255, 255, 255, 0.15) 25%, transparent 25%, transparent 50%, rgba(255, 255, 255, 0.15) 50%, rgba(255, 255, 255, 0.15) 75%, transparent 75%, transparent);\n background-image: -o-linear-gradient(45deg, rgba(255, 255, 255, 0.15) 25%, transparent 25%, transparent 50%, rgba(255, 255, 255, 0.15) 50%, rgba(255, 255, 255, 0.15) 75%, transparent 75%, transparent);\n background-image: linear-gradient(45deg, rgba(255, 255, 255, 0.15) 25%, transparent 25%, transparent 50%, rgba(255, 255, 255, 0.15) 50%, rgba(255, 255, 255, 0.15) 75%, transparent 75%, transparent);\n -webkit-background-size: 40px 40px;\n -moz-background-size: 40px 40px;\n -o-background-size: 40px 40px;\n background-size: 40px 40px;\n}\n.progress.active .bar {\n -webkit-animation: progress-bar-stripes 2s linear infinite;\n -moz-animation: progress-bar-stripes 2s linear infinite;\n -ms-animation: progress-bar-stripes 2s linear infinite;\n -o-animation: progress-bar-stripes 2s linear infinite;\n animation: progress-bar-stripes 2s linear infinite;\n}\n.progress-danger .bar,\n.progress .bar-danger {\n background-color: #dd514c;\n background-image: -moz-linear-gradient(top, #ee5f5b, #c43c35);\n background-image: -webkit-gradient(linear, 0 0, 0 100%, from(#ee5f5b), to(#c43c35));\n background-image: -webkit-linear-gradient(top, #ee5f5b, #c43c35);\n background-image: -o-linear-gradient(top, #ee5f5b, #c43c35);\n background-image: linear-gradient(to bottom, #ee5f5b, #c43c35);\n background-repeat: repeat-x;\n filter: progid:DXImageTransform.Microsoft.gradient(startColorstr='#ffee5f5b', endColorstr='#ffc43c35', GradientType=0);\n}\n.progress-danger.progress-striped .bar,\n.progress-striped .bar-danger {\n background-color: #ee5f5b;\n background-image: -webkit-gradient(linear, 0 100%, 100% 0, color-stop(0.25, rgba(255, 255, 255, 0.15)), color-stop(0.25, transparent), color-stop(0.5, transparent), color-stop(0.5, rgba(255, 255, 255, 0.15)), color-stop(0.75, rgba(255, 255, 255, 0.15)), color-stop(0.75, transparent), to(transparent));\n background-image: -webkit-linear-gradient(45deg, rgba(255, 255, 255, 0.15) 25%, transparent 25%, transparent 50%, rgba(255, 255, 255, 0.15) 50%, rgba(255, 255, 255, 0.15) 75%, transparent 75%, transparent);\n background-image: -moz-linear-gradient(45deg, rgba(255, 255, 255, 0.15) 25%, transparent 25%, transparent 50%, rgba(255, 255, 255, 0.15) 50%, rgba(255, 255, 255, 0.15) 75%, transparent 75%, transparent);\n background-image: -o-linear-gradient(45deg, rgba(255, 255, 255, 0.15) 25%, transparent 25%, transparent 50%, rgba(255, 255, 255, 0.15) 50%, rgba(255, 255, 255, 0.15) 75%, transparent 75%, transparent);\n background-image: linear-gradient(45deg, rgba(255, 255, 255, 0.15) 25%, transparent 25%, transparent 50%, rgba(255, 255, 255, 0.15) 50%, rgba(255, 255, 255, 0.15) 75%, transparent 75%, transparent);\n}\n.progress-success .bar,\n.progress .bar-success {\n background-color: #5eb95e;\n background-image: -moz-linear-gradient(top, #62c462, #57a957);\n background-image: -webkit-gradient(linear, 0 0, 0 100%, from(#62c462), to(#57a957));\n background-image: -webkit-linear-gradient(top, #62c462, #57a957);\n background-image: -o-linear-gradient(top, #62c462, #57a957);\n background-image: linear-gradient(to bottom, #62c462, #57a957);\n background-repeat: repeat-x;\n filter: progid:DXImageTransform.Microsoft.gradient(startColorstr='#ff62c462', endColorstr='#ff57a957', GradientType=0);\n}\n.progress-success.progress-striped .bar,\n.progress-striped .bar-success {\n background-color: #62c462;\n background-image: -webkit-gradient(linear, 0 100%, 100% 0, color-stop(0.25, rgba(255, 255, 255, 0.15)), color-stop(0.25, transparent), color-stop(0.5, transparent), color-stop(0.5, rgba(255, 255, 255, 0.15)), color-stop(0.75, rgba(255, 255, 255, 0.15)), color-stop(0.75, transparent), to(transparent));\n background-image: -webkit-linear-gradient(45deg, rgba(255, 255, 255, 0.15) 25%, transparent 25%, transparent 50%, rgba(255, 255, 255, 0.15) 50%, rgba(255, 255, 255, 0.15) 75%, transparent 75%, transparent);\n background-image: -moz-linear-gradient(45deg, rgba(255, 255, 255, 0.15) 25%, transparent 25%, transparent 50%, rgba(255, 255, 255, 0.15) 50%, rgba(255, 255, 255, 0.15) 75%, transparent 75%, transparent);\n background-image: -o-linear-gradient(45deg, rgba(255, 255, 255, 0.15) 25%, transparent 25%, transparent 50%, rgba(255, 255, 255, 0.15) 50%, rgba(255, 255, 255, 0.15) 75%, transparent 75%, transparent);\n background-image: linear-gradient(45deg, rgba(255, 255, 255, 0.15) 25%, transparent 25%, transparent 50%, rgba(255, 255, 255, 0.15) 50%, rgba(255, 255, 255, 0.15) 75%, transparent 75%, transparent);\n}\n.progress-info .bar,\n.progress .bar-info {\n background-color: #4bb1cf;\n background-image: -moz-linear-gradient(top, #5bc0de, #339bb9);\n background-image: -webkit-gradient(linear, 0 0, 0 100%, from(#5bc0de), to(#339bb9));\n background-image: -webkit-linear-gradient(top, #5bc0de, #339bb9);\n background-image: -o-linear-gradient(top, #5bc0de, #339bb9);\n background-image: linear-gradient(to bottom, #5bc0de, #339bb9);\n background-repeat: repeat-x;\n filter: progid:DXImageTransform.Microsoft.gradient(startColorstr='#ff5bc0de', endColorstr='#ff339bb9', GradientType=0);\n}\n.progress-info.progress-striped .bar,\n.progress-striped .bar-info {\n background-color: #5bc0de;\n background-image: -webkit-gradient(linear, 0 100%, 100% 0, color-stop(0.25, rgba(255, 255, 255, 0.15)), color-stop(0.25, transparent), color-stop(0.5, transparent), color-stop(0.5, rgba(255, 255, 255, 0.15)), color-stop(0.75, rgba(255, 255, 255, 0.15)), color-stop(0.75, transparent), to(transparent));\n background-image: -webkit-linear-gradient(45deg, rgba(255, 255, 255, 0.15) 25%, transparent 25%, transparent 50%, rgba(255, 255, 255, 0.15) 50%, rgba(255, 255, 255, 0.15) 75%, transparent 75%, transparent);\n background-image: -moz-linear-gradient(45deg, rgba(255, 255, 255, 0.15) 25%, transparent 25%, transparent 50%, rgba(255, 255, 255, 0.15) 50%, rgba(255, 255, 255, 0.15) 75%, transparent 75%, transparent);\n background-image: -o-linear-gradient(45deg, rgba(255, 255, 255, 0.15) 25%, transparent 25%, transparent 50%, rgba(255, 255, 255, 0.15) 50%, rgba(255, 255, 255, 0.15) 75%, transparent 75%, transparent);\n background-image: linear-gradient(45deg, rgba(255, 255, 255, 0.15) 25%, transparent 25%, transparent 50%, rgba(255, 255, 255, 0.15) 50%, rgba(255, 255, 255, 0.15) 75%, transparent 75%, transparent);\n}\n.progress-warning .bar,\n.progress .bar-warning {\n background-color: #faa732;\n background-image: -moz-linear-gradient(top, #fbb450, #f89406);\n background-image: -webkit-gradient(linear, 0 0, 0 100%, from(#fbb450), to(#f89406));\n background-image: -webkit-linear-gradient(top, #fbb450, #f89406);\n background-image: -o-linear-gradient(top, #fbb450, #f89406);\n background-image: linear-gradient(to bottom, #fbb450, #f89406);\n background-repeat: repeat-x;\n filter: progid:DXImageTransform.Microsoft.gradient(startColorstr='#fffbb450', endColorstr='#fff89406', GradientType=0);\n}\n.progress-warning.progress-striped .bar,\n.progress-striped .bar-warning {\n background-color: #fbb450;\n background-image: -webkit-gradient(linear, 0 100%, 100% 0, color-stop(0.25, rgba(255, 255, 255, 0.15)), color-stop(0.25, transparent), color-stop(0.5, transparent), color-stop(0.5, rgba(255, 255, 255, 0.15)), color-stop(0.75, rgba(255, 255, 255, 0.15)), color-stop(0.75, transparent), to(transparent));\n background-image: -webkit-linear-gradient(45deg, rgba(255, 255, 255, 0.15) 25%, transparent 25%, transparent 50%, rgba(255, 255, 255, 0.15) 50%, rgba(255, 255, 255, 0.15) 75%, transparent 75%, transparent);\n background-image: -moz-linear-gradient(45deg, rgba(255, 255, 255, 0.15) 25%, transparent 25%, transparent 50%, rgba(255, 255, 255, 0.15) 50%, rgba(255, 255, 255, 0.15) 75%, transparent 75%, transparent);\n background-image: -o-linear-gradient(45deg, rgba(255, 255, 255, 0.15) 25%, transparent 25%, transparent 50%, rgba(255, 255, 255, 0.15) 50%, rgba(255, 255, 255, 0.15) 75%, transparent 75%, transparent);\n background-image: linear-gradient(45deg, rgba(255, 255, 255, 0.15) 25%, transparent 25%, transparent 50%, rgba(255, 255, 255, 0.15) 50%, rgba(255, 255, 255, 0.15) 75%, transparent 75%, transparent);\n}\n.hero-unit {\n padding: 60px;\n margin-bottom: 30px;\n font-size: 18px;\n font-weight: 200;\n line-height: 30px;\n color: inherit;\n background-color: #eeeeee;\n -webkit-border-radius: 6px;\n -moz-border-radius: 6px;\n border-radius: 6px;\n}\n.hero-unit h1 {\n margin-bottom: 0;\n font-size: 60px;\n line-height: 1;\n color: inherit;\n letter-spacing: -1px;\n}\n.hero-unit li {\n line-height: 30px;\n}\n.media,\n.media-body {\n overflow: hidden;\n *overflow: visible;\n zoom: 1;\n}\n.media,\n.media .media {\n margin-top: 15px;\n}\n.media:first-child {\n margin-top: 0;\n}\n.media-object {\n display: block;\n}\n.media-heading {\n margin: 0 0 5px;\n}\n.media > .pull-left {\n margin-right: 10px;\n}\n.media > .pull-right {\n margin-left: 10px;\n}\n.media-list {\n margin-left: 0;\n list-style: none;\n}\n.tooltip {\n position: absolute;\n z-index: 1030;\n display: block;\n visibility: visible;\n font-size: 11px;\n line-height: 1.4;\n opacity: 0;\n filter: alpha(opacity=0);\n}\n.tooltip.in {\n opacity: 0.8;\n filter: alpha(opacity=80);\n}\n.tooltip.top {\n margin-top: -3px;\n padding: 5px 0;\n}\n.tooltip.right {\n margin-left: 3px;\n padding: 0 5px;\n}\n.tooltip.bottom {\n margin-top: 3px;\n padding: 5px 0;\n}\n.tooltip.left {\n margin-left: -3px;\n padding: 0 5px;\n}\n.tooltip-inner {\n max-width: 200px;\n padding: 8px;\n color: #ffffff;\n text-align: center;\n text-decoration: none;\n background-color: #000000;\n -webkit-border-radius: 4px;\n -moz-border-radius: 4px;\n border-radius: 4px;\n}\n.tooltip-arrow {\n position: absolute;\n width: 0;\n height: 0;\n border-color: transparent;\n border-style: solid;\n}\n.tooltip.top .tooltip-arrow {\n bottom: 0;\n left: 50%;\n margin-left: -5px;\n border-width: 5px 5px 0;\n border-top-color: #000000;\n}\n.tooltip.right .tooltip-arrow {\n top: 50%;\n left: 0;\n margin-top: -5px;\n border-width: 5px 5px 5px 0;\n border-right-color: #000000;\n}\n.tooltip.left .tooltip-arrow {\n top: 50%;\n right: 0;\n margin-top: -5px;\n border-width: 5px 0 5px 5px;\n border-left-color: #000000;\n}\n.tooltip.bottom .tooltip-arrow {\n top: 0;\n left: 50%;\n margin-left: -5px;\n border-width: 0 5px 5px;\n border-bottom-color: #000000;\n}\n.popover {\n position: absolute;\n top: 0;\n left: 0;\n z-index: 1010;\n display: none;\n max-width: 276px;\n padding: 1px;\n text-align: left;\n background-color: #ffffff;\n -webkit-background-clip: padding-box;\n -moz-background-clip: padding;\n background-clip: padding-box;\n border: 1px solid #ccc;\n border: 1px solid rgba(0, 0, 0, 0.2);\n -webkit-border-radius: 6px;\n -moz-border-radius: 6px;\n border-radius: 6px;\n -webkit-box-shadow: 0 5px 10px rgba(0, 0, 0, 0.2);\n -moz-box-shadow: 0 5px 10px rgba(0, 0, 0, 0.2);\n box-shadow: 0 5px 10px rgba(0, 0, 0, 0.2);\n white-space: normal;\n}\n.popover.top {\n margin-top: -10px;\n}\n.popover.right {\n margin-left: 10px;\n}\n.popover.bottom {\n margin-top: 10px;\n}\n.popover.left {\n margin-left: -10px;\n}\n.popover-title {\n margin: 0;\n padding: 8px 14px;\n font-size: 14px;\n font-weight: normal;\n line-height: 18px;\n background-color: #f7f7f7;\n border-bottom: 1px solid #ebebeb;\n -webkit-border-radius: 5px 5px 0 0;\n -moz-border-radius: 5px 5px 0 0;\n border-radius: 5px 5px 0 0;\n}\n.popover-title:empty {\n display: none;\n}\n.popover-content {\n padding: 9px 14px;\n}\n.popover .arrow,\n.popover .arrow:after {\n position: absolute;\n display: block;\n width: 0;\n height: 0;\n border-color: transparent;\n border-style: solid;\n}\n.popover .arrow {\n border-width: 11px;\n}\n.popover .arrow:after {\n border-width: 10px;\n content: \"\";\n}\n.popover.top .arrow {\n left: 50%;\n margin-left: -11px;\n border-bottom-width: 0;\n border-top-color: #999;\n border-top-color: rgba(0, 0, 0, 0.25);\n bottom: -11px;\n}\n.popover.top .arrow:after {\n bottom: 1px;\n margin-left: -10px;\n border-bottom-width: 0;\n border-top-color: #ffffff;\n}\n.popover.right .arrow {\n top: 50%;\n left: -11px;\n margin-top: -11px;\n border-left-width: 0;\n border-right-color: #999;\n border-right-color: rgba(0, 0, 0, 0.25);\n}\n.popover.right .arrow:after {\n left: 1px;\n bottom: -10px;\n border-left-width: 0;\n border-right-color: #ffffff;\n}\n.popover.bottom .arrow {\n left: 50%;\n margin-left: -11px;\n border-top-width: 0;\n border-bottom-color: #999;\n border-bottom-color: rgba(0, 0, 0, 0.25);\n top: -11px;\n}\n.popover.bottom .arrow:after {\n top: 1px;\n margin-left: -10px;\n border-top-width: 0;\n border-bottom-color: #ffffff;\n}\n.popover.left .arrow {\n top: 50%;\n right: -11px;\n margin-top: -11px;\n border-right-width: 0;\n border-left-color: #999;\n border-left-color: rgba(0, 0, 0, 0.25);\n}\n.popover.left .arrow:after {\n right: 1px;\n border-right-width: 0;\n border-left-color: #ffffff;\n bottom: -10px;\n}\n.modal-backdrop {\n position: fixed;\n top: 0;\n right: 0;\n bottom: 0;\n left: 0;\n z-index: 1040;\n background-color: #000000;\n}\n.modal-backdrop.fade {\n opacity: 0;\n}\n.modal-backdrop,\n.modal-backdrop.fade.in {\n opacity: 0.8;\n filter: alpha(opacity=80);\n}\n.modal {\n position: fixed;\n top: 10%;\n left: 50%;\n z-index: 1050;\n width: 560px;\n margin-left: -280px;\n background-color: #ffffff;\n border: 1px solid #999;\n border: 1px solid rgba(0, 0, 0, 0.3);\n *border: 1px solid #999;\n /* IE6-7 */\n\n -webkit-border-radius: 6px;\n -moz-border-radius: 6px;\n border-radius: 6px;\n -webkit-box-shadow: 0 3px 7px rgba(0, 0, 0, 0.3);\n -moz-box-shadow: 0 3px 7px rgba(0, 0, 0, 0.3);\n box-shadow: 0 3px 7px rgba(0, 0, 0, 0.3);\n -webkit-background-clip: padding-box;\n -moz-background-clip: padding-box;\n background-clip: padding-box;\n outline: none;\n}\n.modal.fade {\n -webkit-transition: opacity .3s linear, top .3s ease-out;\n -moz-transition: opacity .3s linear, top .3s ease-out;\n -o-transition: opacity .3s linear, top .3s ease-out;\n transition: opacity .3s linear, top .3s ease-out;\n top: -25%;\n}\n.modal.fade.in {\n top: 10%;\n}\n.modal-header {\n padding: 9px 15px;\n border-bottom: 1px solid #eee;\n}\n.modal-header .close {\n margin-top: 2px;\n}\n.modal-header h3 {\n margin: 0;\n line-height: 30px;\n}\n.modal-body {\n position: relative;\n overflow-y: auto;\n max-height: 400px;\n padding: 15px;\n}\n.modal-form {\n margin-bottom: 0;\n}\n.modal-footer {\n padding: 14px 15px 15px;\n margin-bottom: 0;\n text-align: right;\n background-color: #f5f5f5;\n border-top: 1px solid #ddd;\n -webkit-border-radius: 0 0 6px 6px;\n -moz-border-radius: 0 0 6px 6px;\n border-radius: 0 0 6px 6px;\n -webkit-box-shadow: inset 0 1px 0 #ffffff;\n -moz-box-shadow: inset 0 1px 0 #ffffff;\n box-shadow: inset 0 1px 0 #ffffff;\n *zoom: 1;\n}\n.modal-footer:before,\n.modal-footer:after {\n display: table;\n content: \"\";\n line-height: 0;\n}\n.modal-footer:after {\n clear: both;\n}\n.modal-footer .btn + .btn {\n margin-left: 5px;\n margin-bottom: 0;\n}\n.modal-footer .btn-group .btn + .btn {\n margin-left: -1px;\n}\n.modal-footer .btn-block + .btn-block {\n margin-left: 0;\n}\n.dropup,\n.dropdown {\n position: relative;\n}\n.dropdown-toggle {\n *margin-bottom: -3px;\n}\n.dropdown-toggle:active,\n.open .dropdown-toggle {\n outline: 0;\n}\n.caret {\n display: inline-block;\n width: 0;\n height: 0;\n vertical-align: top;\n border-top: 4px solid #000000;\n border-right: 4px solid transparent;\n border-left: 4px solid transparent;\n content: \"\";\n}\n.dropdown .caret {\n margin-top: 8px;\n margin-left: 2px;\n}\n.dropdown-menu {\n position: absolute;\n top: 100%;\n left: 0;\n z-index: 1000;\n display: none;\n float: left;\n min-width: 160px;\n padding: 5px 0;\n margin: 2px 0 0;\n list-style: none;\n background-color: #ffffff;\n border: 1px solid #ccc;\n border: 1px solid rgba(0, 0, 0, 0.2);\n *border-right-width: 2px;\n *border-bottom-width: 2px;\n -webkit-border-radius: 6px;\n -moz-border-radius: 6px;\n border-radius: 6px;\n -webkit-box-shadow: 0 5px 10px rgba(0, 0, 0, 0.2);\n -moz-box-shadow: 0 5px 10px rgba(0, 0, 0, 0.2);\n box-shadow: 0 5px 10px rgba(0, 0, 0, 0.2);\n -webkit-background-clip: padding-box;\n -moz-background-clip: padding;\n background-clip: padding-box;\n}\n.dropdown-menu.pull-right {\n right: 0;\n left: auto;\n}\n.dropdown-menu .divider {\n *width: 100%;\n height: 1px;\n margin: 9px 1px;\n *margin: -5px 0 5px;\n overflow: hidden;\n background-color: #e5e5e5;\n border-bottom: 1px solid #ffffff;\n}\n.dropdown-menu > li > a {\n display: block;\n padding: 3px 20px;\n clear: both;\n font-weight: normal;\n line-height: 20px;\n color: #333333;\n white-space: nowrap;\n}\n.dropdown-menu > li > a:hover,\n.dropdown-menu > li > a:focus,\n.dropdown-submenu:hover > a,\n.dropdown-submenu:focus > a {\n text-decoration: none;\n color: #ffffff;\n background-color: #0081c2;\n background-image: -moz-linear-gradient(top, #0088cc, #0077b3);\n background-image: -webkit-gradient(linear, 0 0, 0 100%, from(#0088cc), to(#0077b3));\n background-image: -webkit-linear-gradient(top, #0088cc, #0077b3);\n background-image: -o-linear-gradient(top, #0088cc, #0077b3);\n background-image: linear-gradient(to bottom, #0088cc, #0077b3);\n background-repeat: repeat-x;\n filter: progid:DXImageTransform.Microsoft.gradient(startColorstr='#ff0088cc', endColorstr='#ff0077b3', GradientType=0);\n}\n.dropdown-menu > .active > a,\n.dropdown-menu > .active > a:hover,\n.dropdown-menu > .active > a:focus {\n color: #ffffff;\n text-decoration: none;\n outline: 0;\n background-color: #0081c2;\n background-image: -moz-linear-gradient(top, #0088cc, #0077b3);\n background-image: -webkit-gradient(linear, 0 0, 0 100%, from(#0088cc), to(#0077b3));\n background-image: -webkit-linear-gradient(top, #0088cc, #0077b3);\n background-image: -o-linear-gradient(top, #0088cc, #0077b3);\n background-image: linear-gradient(to bottom, #0088cc, #0077b3);\n background-repeat: repeat-x;\n filter: progid:DXImageTransform.Microsoft.gradient(startColorstr='#ff0088cc', endColorstr='#ff0077b3', GradientType=0);\n}\n.dropdown-menu > .disabled > a,\n.dropdown-menu > .disabled > a:hover,\n.dropdown-menu > .disabled > a:focus {\n color: #999999;\n}\n.dropdown-menu > .disabled > a:hover,\n.dropdown-menu > .disabled > a:focus {\n text-decoration: none;\n background-color: transparent;\n background-image: none;\n filter: progid:DXImageTransform.Microsoft.gradient(enabled = false);\n cursor: default;\n}\n.open {\n *z-index: 1000;\n}\n.open > .dropdown-menu {\n display: block;\n}\n.pull-right > .dropdown-menu {\n right: 0;\n left: auto;\n}\n.dropup .caret,\n.navbar-fixed-bottom .dropdown .caret {\n border-top: 0;\n border-bottom: 4px solid #000000;\n content: \"\";\n}\n.dropup .dropdown-menu,\n.navbar-fixed-bottom .dropdown .dropdown-menu {\n top: auto;\n bottom: 100%;\n margin-bottom: 1px;\n}\n.dropdown-submenu {\n position: relative;\n}\n.dropdown-submenu > .dropdown-menu {\n top: 0;\n left: 100%;\n margin-top: -6px;\n margin-left: -1px;\n -webkit-border-radius: 0 6px 6px 6px;\n -moz-border-radius: 0 6px 6px 6px;\n border-radius: 0 6px 6px 6px;\n}\n.dropdown-submenu:hover > .dropdown-menu {\n display: block;\n}\n.dropup .dropdown-submenu > .dropdown-menu {\n top: auto;\n bottom: 0;\n margin-top: 0;\n margin-bottom: -2px;\n -webkit-border-radius: 5px 5px 5px 0;\n -moz-border-radius: 5px 5px 5px 0;\n border-radius: 5px 5px 5px 0;\n}\n.dropdown-submenu > a:after {\n display: block;\n content: \" \";\n float: right;\n width: 0;\n height: 0;\n border-color: transparent;\n border-style: solid;\n border-width: 5px 0 5px 5px;\n border-left-color: #cccccc;\n margin-top: 5px;\n margin-right: -10px;\n}\n.dropdown-submenu:hover > a:after {\n border-left-color: #ffffff;\n}\n.dropdown-submenu.pull-left {\n float: none;\n}\n.dropdown-submenu.pull-left > .dropdown-menu {\n left: -100%;\n margin-left: 10px;\n -webkit-border-radius: 6px 0 6px 6px;\n -moz-border-radius: 6px 0 6px 6px;\n border-radius: 6px 0 6px 6px;\n}\n.dropdown .dropdown-menu .nav-header {\n padding-left: 20px;\n padding-right: 20px;\n}\n.typeahead {\n z-index: 1051;\n margin-top: 2px;\n -webkit-border-radius: 4px;\n -moz-border-radius: 4px;\n border-radius: 4px;\n}\n.accordion {\n margin-bottom: 20px;\n}\n.accordion-group {\n margin-bottom: 2px;\n border: 1px solid #e5e5e5;\n -webkit-border-radius: 4px;\n -moz-border-radius: 4px;\n border-radius: 4px;\n}\n.accordion-heading {\n border-bottom: 0;\n}\n.accordion-heading .accordion-toggle {\n display: block;\n padding: 8px 15px;\n}\n.accordion-toggle {\n cursor: pointer;\n}\n.accordion-inner {\n padding: 9px 15px;\n border-top: 1px solid #e5e5e5;\n}\n.carousel {\n position: relative;\n margin-bottom: 20px;\n line-height: 1;\n}\n.carousel-inner {\n overflow: hidden;\n width: 100%;\n position: relative;\n}\n.carousel-inner > .item {\n display: none;\n position: relative;\n -webkit-transition: 0.6s ease-in-out left;\n -moz-transition: 0.6s ease-in-out left;\n -o-transition: 0.6s ease-in-out left;\n transition: 0.6s ease-in-out left;\n}\n.carousel-inner > .item > img,\n.carousel-inner > .item > a > img {\n display: block;\n line-height: 1;\n}\n.carousel-inner > .active,\n.carousel-inner > .next,\n.carousel-inner > .prev {\n display: block;\n}\n.carousel-inner > .active {\n left: 0;\n}\n.carousel-inner > .next,\n.carousel-inner > .prev {\n position: absolute;\n top: 0;\n width: 100%;\n}\n.carousel-inner > .next {\n left: 100%;\n}\n.carousel-inner > .prev {\n left: -100%;\n}\n.carousel-inner > .next.left,\n.carousel-inner > .prev.right {\n left: 0;\n}\n.carousel-inner > .active.left {\n left: -100%;\n}\n.carousel-inner > .active.right {\n left: 100%;\n}\n.carousel-control {\n position: absolute;\n top: 40%;\n left: 15px;\n width: 40px;\n height: 40px;\n margin-top: -20px;\n font-size: 60px;\n font-weight: 100;\n line-height: 30px;\n color: #ffffff;\n text-align: center;\n background: #222222;\n border: 3px solid #ffffff;\n -webkit-border-radius: 23px;\n -moz-border-radius: 23px;\n border-radius: 23px;\n opacity: 0.5;\n filter: alpha(opacity=50);\n}\n.carousel-control.right {\n left: auto;\n right: 15px;\n}\n.carousel-control:hover,\n.carousel-control:focus {\n color: #ffffff;\n text-decoration: none;\n opacity: 0.9;\n filter: alpha(opacity=90);\n}\n.carousel-indicators {\n position: absolute;\n top: 15px;\n right: 15px;\n z-index: 5;\n margin: 0;\n list-style: none;\n}\n.carousel-indicators li {\n display: block;\n float: left;\n width: 10px;\n height: 10px;\n margin-left: 5px;\n text-indent: -999px;\n background-color: #ccc;\n background-color: rgba(255, 255, 255, 0.25);\n border-radius: 5px;\n}\n.carousel-indicators .active {\n background-color: #fff;\n}\n.carousel-caption {\n position: absolute;\n left: 0;\n right: 0;\n bottom: 0;\n padding: 15px;\n background: #333333;\n background: rgba(0, 0, 0, 0.75);\n}\n.carousel-caption h4,\n.carousel-caption p {\n color: #ffffff;\n line-height: 20px;\n}\n.carousel-caption h4 {\n margin: 0 0 5px;\n}\n.carousel-caption p {\n margin-bottom: 0;\n}\n.well {\n min-height: 20px;\n padding: 19px;\n margin-bottom: 20px;\n background-color: #f5f5f5;\n border: 1px solid #e3e3e3;\n -webkit-border-radius: 4px;\n -moz-border-radius: 4px;\n border-radius: 4px;\n -webkit-box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.05);\n -moz-box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.05);\n box-shadow: inset 0 1px 1px rgba(0, 0, 0, 0.05);\n}\n.well blockquote {\n border-color: #ddd;\n border-color: rgba(0, 0, 0, 0.15);\n}\n.well-large {\n padding: 24px;\n -webkit-border-radius: 6px;\n -moz-border-radius: 6px;\n border-radius: 6px;\n}\n.well-small {\n padding: 9px;\n -webkit-border-radius: 3px;\n -moz-border-radius: 3px;\n border-radius: 3px;\n}\n.close {\n float: right;\n font-size: 20px;\n font-weight: bold;\n line-height: 20px;\n color: #000000;\n text-shadow: 0 1px 0 #ffffff;\n opacity: 0.2;\n filter: alpha(opacity=20);\n}\n.close:hover,\n.close:focus {\n color: #000000;\n text-decoration: none;\n cursor: pointer;\n opacity: 0.4;\n filter: alpha(opacity=40);\n}\nbutton.close {\n padding: 0;\n cursor: pointer;\n background: transparent;\n border: 0;\n -webkit-appearance: none;\n}\n.pull-right {\n float: right;\n}\n.pull-left {\n float: left;\n}\n.hide {\n display: none;\n}\n.show {\n display: block;\n}\n.invisible {\n visibility: hidden;\n}\n.affix {\n position: fixed;\n}\n.fade {\n opacity: 0;\n -webkit-transition: opacity 0.15s linear;\n -moz-transition: opacity 0.15s linear;\n -o-transition: opacity 0.15s linear;\n transition: opacity 0.15s linear;\n}\n.fade.in {\n opacity: 1;\n}\n.collapse {\n position: relative;\n height: 0;\n overflow: hidden;\n -webkit-transition: height 0.35s ease;\n -moz-transition: height 0.35s ease;\n -o-transition: height 0.35s ease;\n transition: height 0.35s ease;\n}\n.collapse.in {\n height: auto;\n}\n@-ms-viewport {\n width: device-width;\n}\n.hidden {\n display: none;\n visibility: hidden;\n}\n.visible-phone {\n display: none !important;\n}\n.visible-tablet {\n display: none !important;\n}\n.hidden-desktop {\n display: none !important;\n}\n.visible-desktop {\n display: inherit !important;\n}\n@media (min-width: 768px) and (max-width: 979px) {\n .hidden-desktop {\n display: inherit !important;\n }\n .visible-desktop {\n display: none !important ;\n }\n .visible-tablet {\n display: inherit !important;\n }\n .hidden-tablet {\n display: none !important;\n }\n}\n@media (max-width: 767px) {\n .hidden-desktop {\n display: inherit !important;\n }\n .visible-desktop {\n display: none !important;\n }\n .visible-phone {\n display: inherit !important;\n }\n .hidden-phone {\n display: none !important;\n }\n}\n.visible-print {\n display: none !important;\n}\n@media print {\n .visible-print {\n display: inherit !important;\n }\n .hidden-print {\n display: none !important;\n }\n}\n@media (max-width: 767px) {\n body {\n padding-left: 20px;\n padding-right: 20px;\n }\n .navbar-fixed-top,\n .navbar-fixed-bottom,\n .navbar-static-top {\n margin-left: -20px;\n margin-right: -20px;\n }\n .container-fluid {\n padding: 0;\n }\n .dl-horizontal dt {\n float: none;\n clear: none;\n width: auto;\n text-align: left;\n }\n .dl-horizontal dd {\n margin-left: 0;\n }\n .container {\n width: auto;\n }\n .row-fluid {\n width: 100%;\n }\n .row,\n .thumbnails {\n margin-left: 0;\n }\n .thumbnails > li {\n float: none;\n margin-left: 0;\n }\n [class*=\"span\"],\n .uneditable-input[class*=\"span\"],\n .row-fluid [class*=\"span\"] {\n float: none;\n display: block;\n width: 100%;\n margin-left: 0;\n -webkit-box-sizing: border-box;\n -moz-box-sizing: border-box;\n box-sizing: border-box;\n }\n .span12,\n .row-fluid .span12 {\n width: 100%;\n -webkit-box-sizing: border-box;\n -moz-box-sizing: border-box;\n box-sizing: border-box;\n }\n .row-fluid [class*=\"offset\"]:first-child {\n margin-left: 0;\n }\n .input-large,\n .input-xlarge,\n .input-xxlarge,\n input[class*=\"span\"],\n select[class*=\"span\"],\n textarea[class*=\"span\"],\n .uneditable-input {\n display: block;\n width: 100%;\n min-height: 30px;\n -webkit-box-sizing: border-box;\n -moz-box-sizing: border-box;\n box-sizing: border-box;\n }\n .input-prepend input,\n .input-append input,\n .input-prepend input[class*=\"span\"],\n .input-append input[class*=\"span\"] {\n display: inline-block;\n width: auto;\n }\n .controls-row [class*=\"span\"] + [class*=\"span\"] {\n margin-left: 0;\n }\n .modal {\n position: fixed;\n top: 20px;\n left: 20px;\n right: 20px;\n width: auto;\n margin: 0;\n }\n .modal.fade {\n top: -100px;\n }\n .modal.fade.in {\n top: 20px;\n }\n}\n@media (max-width: 480px) {\n .nav-collapse {\n -webkit-transform: translate3d(0, 0, 0);\n }\n .page-header h1 small {\n display: block;\n line-height: 20px;\n }\n input[type=\"checkbox\"],\n input[type=\"radio\"] {\n border: 1px solid #ccc;\n }\n .form-horizontal .control-label {\n float: none;\n width: auto;\n padding-top: 0;\n text-align: left;\n }\n .form-horizontal .controls {\n margin-left: 0;\n }\n .form-horizontal .control-list {\n padding-top: 0;\n }\n .form-horizontal .form-actions {\n padding-left: 10px;\n padding-right: 10px;\n }\n .media .pull-left,\n .media .pull-right {\n float: none;\n display: block;\n margin-bottom: 10px;\n }\n .media-object {\n margin-right: 0;\n margin-left: 0;\n }\n .modal {\n top: 10px;\n left: 10px;\n right: 10px;\n }\n .modal-header .close {\n padding: 10px;\n margin: -10px;\n }\n .carousel-caption {\n position: static;\n }\n}\n@media (min-width: 768px) and (max-width: 979px) {\n .row {\n margin-left: -20px;\n *zoom: 1;\n }\n .row:before,\n .row:after {\n display: table;\n content: \"\";\n line-height: 0;\n }\n .row:after {\n clear: both;\n }\n [class*=\"span\"] {\n float: left;\n min-height: 1px;\n margin-left: 20px;\n }\n .container,\n .navbar-static-top .container,\n .navbar-fixed-top .container,\n .navbar-fixed-bottom .container {\n width: 724px;\n }\n .span12 {\n width: 724px;\n }\n .span11 {\n width: 662px;\n }\n .span10 {\n width: 600px;\n }\n .span9 {\n width: 538px;\n }\n .span8 {\n width: 476px;\n }\n .span7 {\n width: 414px;\n }\n .span6 {\n width: 352px;\n }\n .span5 {\n width: 290px;\n }\n .span4 {\n width: 228px;\n }\n .span3 {\n width: 166px;\n }\n .span2 {\n width: 104px;\n }\n .span1 {\n width: 42px;\n }\n .offset12 {\n margin-left: 764px;\n }\n .offset11 {\n margin-left: 702px;\n }\n .offset10 {\n margin-left: 640px;\n }\n .offset9 {\n margin-left: 578px;\n }\n .offset8 {\n margin-left: 516px;\n }\n .offset7 {\n margin-left: 454px;\n }\n .offset6 {\n margin-left: 392px;\n }\n .offset5 {\n margin-left: 330px;\n }\n .offset4 {\n margin-left: 268px;\n }\n .offset3 {\n margin-left: 206px;\n }\n .offset2 {\n margin-left: 144px;\n }\n .offset1 {\n margin-left: 82px;\n }\n .row-fluid {\n width: 100%;\n *zoom: 1;\n }\n .row-fluid:before,\n .row-fluid:after {\n display: table;\n content: \"\";\n line-height: 0;\n }\n .row-fluid:after {\n clear: both;\n }\n .row-fluid [class*=\"span\"] {\n display: block;\n width: 100%;\n min-height: 30px;\n -webkit-box-sizing: border-box;\n -moz-box-sizing: border-box;\n box-sizing: border-box;\n float: left;\n margin-left: 2.7624309392265194%;\n *margin-left: 2.709239449864817%;\n }\n .row-fluid [class*=\"span\"]:first-child {\n margin-left: 0;\n }\n .row-fluid .controls-row [class*=\"span\"] + [class*=\"span\"] {\n margin-left: 2.7624309392265194%;\n }\n .row-fluid .span12 {\n width: 100%;\n *width: 99.94680851063829%;\n }\n .row-fluid .span11 {\n width: 91.43646408839778%;\n *width: 91.38327259903608%;\n }\n .row-fluid .span10 {\n width: 82.87292817679558%;\n *width: 82.81973668743387%;\n }\n .row-fluid .span9 {\n width: 74.30939226519337%;\n *width: 74.25620077583166%;\n }\n .row-fluid .span8 {\n width: 65.74585635359117%;\n *width: 65.69266486422946%;\n }\n .row-fluid .span7 {\n width: 57.18232044198895%;\n *width: 57.12912895262725%;\n }\n .row-fluid .span6 {\n width: 48.61878453038674%;\n *width: 48.56559304102504%;\n }\n .row-fluid .span5 {\n width: 40.05524861878453%;\n *width: 40.00205712942283%;\n }\n .row-fluid .span4 {\n width: 31.491712707182323%;\n *width: 31.43852121782062%;\n }\n .row-fluid .span3 {\n width: 22.92817679558011%;\n *width: 22.87498530621841%;\n }\n .row-fluid .span2 {\n width: 14.3646408839779%;\n *width: 14.311449394616199%;\n }\n .row-fluid .span1 {\n width: 5.801104972375691%;\n *width: 5.747913483013988%;\n }\n .row-fluid .offset12 {\n margin-left: 105.52486187845304%;\n *margin-left: 105.41847889972962%;\n }\n .row-fluid .offset12:first-child {\n margin-left: 102.76243093922652%;\n *margin-left: 102.6560479605031%;\n }\n .row-fluid .offset11 {\n margin-left: 96.96132596685082%;\n *margin-left: 96.8549429881274%;\n }\n .row-fluid .offset11:first-child {\n margin-left: 94.1988950276243%;\n *margin-left: 94.09251204890089%;\n }\n .row-fluid .offset10 {\n margin-left: 88.39779005524862%;\n *margin-left: 88.2914070765252%;\n }\n .row-fluid .offset10:first-child {\n margin-left: 85.6353591160221%;\n *margin-left: 85.52897613729868%;\n }\n .row-fluid .offset9 {\n margin-left: 79.8342541436464%;\n *margin-left: 79.72787116492299%;\n }\n .row-fluid .offset9:first-child {\n margin-left: 77.07182320441989%;\n *margin-left: 76.96544022569647%;\n }\n .row-fluid .offset8 {\n margin-left: 71.2707182320442%;\n *margin-left: 71.16433525332079%;\n }\n .row-fluid .offset8:first-child {\n margin-left: 68.50828729281768%;\n *margin-left: 68.40190431409427%;\n }\n .row-fluid .offset7 {\n margin-left: 62.70718232044199%;\n *margin-left: 62.600799341718584%;\n }\n .row-fluid .offset7:first-child {\n margin-left: 59.94475138121547%;\n *margin-left: 59.838368402492065%;\n }\n .row-fluid .offset6 {\n margin-left: 54.14364640883978%;\n *margin-left: 54.037263430116376%;\n }\n .row-fluid .offset6:first-child {\n margin-left: 51.38121546961326%;\n *margin-left: 51.27483249088986%;\n }\n .row-fluid .offset5 {\n margin-left: 45.58011049723757%;\n *margin-left: 45.47372751851417%;\n }\n .row-fluid .offset5:first-child {\n margin-left: 42.81767955801105%;\n *margin-left: 42.71129657928765%;\n }\n .row-fluid .offset4 {\n margin-left: 37.01657458563536%;\n *margin-left: 36.91019160691196%;\n }\n .row-fluid .offset4:first-child {\n margin-left: 34.25414364640884%;\n *margin-left: 34.14776066768544%;\n }\n .row-fluid .offset3 {\n margin-left: 28.45303867403315%;\n *margin-left: 28.346655695309746%;\n }\n .row-fluid .offset3:first-child {\n margin-left: 25.69060773480663%;\n *margin-left: 25.584224756083227%;\n }\n .row-fluid .offset2 {\n margin-left: 19.88950276243094%;\n *margin-left: 19.783119783707537%;\n }\n .row-fluid .offset2:first-child {\n margin-left: 17.12707182320442%;\n *margin-left: 17.02068884448102%;\n }\n .row-fluid .offset1 {\n margin-left: 11.32596685082873%;\n *margin-left: 11.219583872105325%;\n }\n .row-fluid .offset1:first-child {\n margin-left: 8.56353591160221%;\n *margin-left: 8.457152932878806%;\n }\n input,\n textarea,\n .uneditable-input {\n margin-left: 0;\n }\n .controls-row [class*=\"span\"] + [class*=\"span\"] {\n margin-left: 20px;\n }\n input.span12,\n textarea.span12,\n .uneditable-input.span12 {\n width: 710px;\n }\n input.span11,\n textarea.span11,\n .uneditable-input.span11 {\n width: 648px;\n }\n input.span10,\n textarea.span10,\n .uneditable-input.span10 {\n width: 586px;\n }\n input.span9,\n textarea.span9,\n .uneditable-input.span9 {\n width: 524px;\n }\n input.span8,\n textarea.span8,\n .uneditable-input.span8 {\n width: 462px;\n }\n input.span7,\n textarea.span7,\n .uneditable-input.span7 {\n width: 400px;\n }\n input.span6,\n textarea.span6,\n .uneditable-input.span6 {\n width: 338px;\n }\n input.span5,\n textarea.span5,\n .uneditable-input.span5 {\n width: 276px;\n }\n input.span4,\n textarea.span4,\n .uneditable-input.span4 {\n width: 214px;\n }\n input.span3,\n textarea.span3,\n .uneditable-input.span3 {\n width: 152px;\n }\n input.span2,\n textarea.span2,\n .uneditable-input.span2 {\n width: 90px;\n }\n input.span1,\n textarea.span1,\n .uneditable-input.span1 {\n width: 28px;\n }\n}\n@media (min-width: 1200px) {\n .row {\n margin-left: -30px;\n *zoom: 1;\n }\n .row:before,\n .row:after {\n display: table;\n content: \"\";\n line-height: 0;\n }\n .row:after {\n clear: both;\n }\n [class*=\"span\"] {\n float: left;\n min-height: 1px;\n margin-left: 30px;\n }\n .container,\n .navbar-static-top .container,\n .navbar-fixed-top .container,\n .navbar-fixed-bottom .container {\n width: 1170px;\n }\n .span12 {\n width: 1170px;\n }\n .span11 {\n width: 1070px;\n }\n .span10 {\n width: 970px;\n }\n .span9 {\n width: 870px;\n }\n .span8 {\n width: 770px;\n }\n .span7 {\n width: 670px;\n }\n .span6 {\n width: 570px;\n }\n .span5 {\n width: 470px;\n }\n .span4 {\n width: 370px;\n }\n .span3 {\n width: 270px;\n }\n .span2 {\n width: 170px;\n }\n .span1 {\n width: 70px;\n }\n .offset12 {\n margin-left: 1230px;\n }\n .offset11 {\n margin-left: 1130px;\n }\n .offset10 {\n margin-left: 1030px;\n }\n .offset9 {\n margin-left: 930px;\n }\n .offset8 {\n margin-left: 830px;\n }\n .offset7 {\n margin-left: 730px;\n }\n .offset6 {\n margin-left: 630px;\n }\n .offset5 {\n margin-left: 530px;\n }\n .offset4 {\n margin-left: 430px;\n }\n .offset3 {\n margin-left: 330px;\n }\n .offset2 {\n margin-left: 230px;\n }\n .offset1 {\n margin-left: 130px;\n }\n .row-fluid {\n width: 100%;\n *zoom: 1;\n }\n .row-fluid:before,\n .row-fluid:after {\n display: table;\n content: \"\";\n line-height: 0;\n }\n .row-fluid:after {\n clear: both;\n }\n .row-fluid [class*=\"span\"] {\n display: block;\n width: 100%;\n min-height: 30px;\n -webkit-box-sizing: border-box;\n -moz-box-sizing: border-box;\n box-sizing: border-box;\n float: left;\n margin-left: 2.564102564102564%;\n *margin-left: 2.5109110747408616%;\n }\n .row-fluid [class*=\"span\"]:first-child {\n margin-left: 0;\n }\n .row-fluid .controls-row [class*=\"span\"] + [class*=\"span\"] {\n margin-left: 2.564102564102564%;\n }\n .row-fluid .span12 {\n width: 100%;\n *width: 99.94680851063829%;\n }\n .row-fluid .span11 {\n width: 91.45299145299145%;\n *width: 91.39979996362975%;\n }\n .row-fluid .span10 {\n width: 82.90598290598291%;\n *width: 82.8527914166212%;\n }\n .row-fluid .span9 {\n width: 74.35897435897436%;\n *width: 74.30578286961266%;\n }\n .row-fluid .span8 {\n width: 65.81196581196582%;\n *width: 65.75877432260411%;\n }\n .row-fluid .span7 {\n width: 57.26495726495726%;\n *width: 57.21176577559556%;\n }\n .row-fluid .span6 {\n width: 48.717948717948715%;\n *width: 48.664757228587014%;\n }\n .row-fluid .span5 {\n width: 40.17094017094017%;\n *width: 40.11774868157847%;\n }\n .row-fluid .span4 {\n width: 31.623931623931625%;\n *width: 31.570740134569924%;\n }\n .row-fluid .span3 {\n width: 23.076923076923077%;\n *width: 23.023731587561375%;\n }\n .row-fluid .span2 {\n width: 14.52991452991453%;\n *width: 14.476723040552828%;\n }\n .row-fluid .span1 {\n width: 5.982905982905983%;\n *width: 5.929714493544281%;\n }\n .row-fluid .offset12 {\n margin-left: 105.12820512820512%;\n *margin-left: 105.02182214948171%;\n }\n .row-fluid .offset12:first-child {\n margin-left: 102.56410256410257%;\n *margin-left: 102.45771958537915%;\n }\n .row-fluid .offset11 {\n margin-left: 96.58119658119658%;\n *margin-left: 96.47481360247316%;\n }\n .row-fluid .offset11:first-child {\n margin-left: 94.01709401709402%;\n *margin-left: 93.91071103837061%;\n }\n .row-fluid .offset10 {\n margin-left: 88.03418803418803%;\n *margin-left: 87.92780505546462%;\n }\n .row-fluid .offset10:first-child {\n margin-left: 85.47008547008548%;\n *margin-left: 85.36370249136206%;\n }\n .row-fluid .offset9 {\n margin-left: 79.48717948717949%;\n *margin-left: 79.38079650845607%;\n }\n .row-fluid .offset9:first-child {\n margin-left: 76.92307692307693%;\n *margin-left: 76.81669394435352%;\n }\n .row-fluid .offset8 {\n margin-left: 70.94017094017094%;\n *margin-left: 70.83378796144753%;\n }\n .row-fluid .offset8:first-child {\n margin-left: 68.37606837606839%;\n *margin-left: 68.26968539734497%;\n }\n .row-fluid .offset7 {\n margin-left: 62.393162393162385%;\n *margin-left: 62.28677941443899%;\n }\n .row-fluid .offset7:first-child {\n margin-left: 59.82905982905982%;\n *margin-left: 59.72267685033642%;\n }\n .row-fluid .offset6 {\n margin-left: 53.84615384615384%;\n *margin-left: 53.739770867430444%;\n }\n .row-fluid .offset6:first-child {\n margin-left: 51.28205128205128%;\n *margin-left: 51.175668303327875%;\n }\n .row-fluid .offset5 {\n margin-left: 45.299145299145295%;\n *margin-left: 45.1927623204219%;\n }\n .row-fluid .offset5:first-child {\n margin-left: 42.73504273504273%;\n *margin-left: 42.62865975631933%;\n }\n .row-fluid .offset4 {\n margin-left: 36.75213675213675%;\n *margin-left: 36.645753773413354%;\n }\n .row-fluid .offset4:first-child {\n margin-left: 34.18803418803419%;\n *margin-left: 34.081651209310785%;\n }\n .row-fluid .offset3 {\n margin-left: 28.205128205128204%;\n *margin-left: 28.0987452264048%;\n }\n .row-fluid .offset3:first-child {\n margin-left: 25.641025641025642%;\n *margin-left: 25.53464266230224%;\n }\n .row-fluid .offset2 {\n margin-left: 19.65811965811966%;\n *margin-left: 19.551736679396257%;\n }\n .row-fluid .offset2:first-child {\n margin-left: 17.094017094017094%;\n *margin-left: 16.98763411529369%;\n }\n .row-fluid .offset1 {\n margin-left: 11.11111111111111%;\n *margin-left: 11.004728132387708%;\n }\n .row-fluid .offset1:first-child {\n margin-left: 8.547008547008547%;\n *margin-left: 8.440625568285142%;\n }\n input,\n textarea,\n .uneditable-input {\n margin-left: 0;\n }\n .controls-row [class*=\"span\"] + [class*=\"span\"] {\n margin-left: 30px;\n }\n input.span12,\n textarea.span12,\n .uneditable-input.span12 {\n width: 1156px;\n }\n input.span11,\n textarea.span11,\n .uneditable-input.span11 {\n width: 1056px;\n }\n input.span10,\n textarea.span10,\n .uneditable-input.span10 {\n width: 956px;\n }\n input.span9,\n textarea.span9,\n .uneditable-input.span9 {\n width: 856px;\n }\n input.span8,\n textarea.span8,\n .uneditable-input.span8 {\n width: 756px;\n }\n input.span7,\n textarea.span7,\n .uneditable-input.span7 {\n width: 656px;\n }\n input.span6,\n textarea.span6,\n .uneditable-input.span6 {\n width: 556px;\n }\n input.span5,\n textarea.span5,\n .uneditable-input.span5 {\n width: 456px;\n }\n input.span4,\n textarea.span4,\n .uneditable-input.span4 {\n width: 356px;\n }\n input.span3,\n textarea.span3,\n .uneditable-input.span3 {\n width: 256px;\n }\n input.span2,\n textarea.span2,\n .uneditable-input.span2 {\n width: 156px;\n }\n input.span1,\n textarea.span1,\n .uneditable-input.span1 {\n width: 56px;\n }\n .thumbnails {\n margin-left: -30px;\n }\n .thumbnails > li {\n margin-left: 30px;\n }\n .row-fluid .thumbnails {\n margin-left: 0;\n }\n}\n@media (max-width: 979px) {\n body {\n padding-top: 0;\n }\n .navbar-fixed-top,\n .navbar-fixed-bottom {\n position: static;\n }\n .navbar-fixed-top {\n margin-bottom: 20px;\n }\n .navbar-fixed-bottom {\n margin-top: 20px;\n }\n .navbar-fixed-top .navbar-inner,\n .navbar-fixed-bottom .navbar-inner {\n padding: 5px;\n }\n .navbar .container {\n width: auto;\n padding: 0;\n }\n .navbar .brand {\n padding-left: 10px;\n padding-right: 10px;\n margin: 0 0 0 -5px;\n }\n .nav-collapse {\n clear: both;\n }\n .nav-collapse .nav {\n float: none;\n margin: 0 0 10px;\n }\n .nav-collapse .nav > li {\n float: none;\n }\n .nav-collapse .nav > li > a {\n margin-bottom: 2px;\n }\n .nav-collapse .nav > .divider-vertical {\n display: none;\n }\n .nav-collapse .nav .nav-header {\n color: #777777;\n text-shadow: none;\n }\n .nav-collapse .nav > li > a,\n .nav-collapse .dropdown-menu a {\n padding: 9px 15px;\n font-weight: bold;\n color: #777777;\n -webkit-border-radius: 3px;\n -moz-border-radius: 3px;\n border-radius: 3px;\n }\n .nav-collapse .btn {\n padding: 4px 10px 4px;\n font-weight: normal;\n -webkit-border-radius: 4px;\n -moz-border-radius: 4px;\n border-radius: 4px;\n }\n .nav-collapse .dropdown-menu li + li a {\n margin-bottom: 2px;\n }\n .nav-collapse .nav > li > a:hover,\n .nav-collapse .nav > li > a:focus,\n .nav-collapse .dropdown-menu a:hover,\n .nav-collapse .dropdown-menu a:focus {\n background-color: #f2f2f2;\n }\n .navbar-inverse .nav-collapse .nav > li > a,\n .navbar-inverse .nav-collapse .dropdown-menu a {\n color: #999999;\n }\n .navbar-inverse .nav-collapse .nav > li > a:hover,\n .navbar-inverse .nav-collapse .nav > li > a:focus,\n .navbar-inverse .nav-collapse .dropdown-menu a:hover,\n .navbar-inverse .nav-collapse .dropdown-menu a:focus {\n background-color: #111111;\n }\n .nav-collapse.in .btn-group {\n margin-top: 5px;\n padding: 0;\n }\n .nav-collapse .dropdown-menu {\n position: static;\n top: auto;\n left: auto;\n float: none;\n display: none;\n max-width: none;\n margin: 0 15px;\n padding: 0;\n background-color: transparent;\n border: none;\n -webkit-border-radius: 0;\n -moz-border-radius: 0;\n border-radius: 0;\n -webkit-box-shadow: none;\n -moz-box-shadow: none;\n box-shadow: none;\n }\n .nav-collapse .open > .dropdown-menu {\n display: block;\n }\n .nav-collapse .dropdown-menu:before,\n .nav-collapse .dropdown-menu:after {\n display: none;\n }\n .nav-collapse .dropdown-menu .divider {\n display: none;\n }\n .nav-collapse .nav > li > .dropdown-menu:before,\n .nav-collapse .nav > li > .dropdown-menu:after {\n display: none;\n }\n .nav-collapse .navbar-form,\n .nav-collapse .navbar-search {\n float: none;\n padding: 10px 15px;\n margin: 10px 0;\n border-top: 1px solid #f2f2f2;\n border-bottom: 1px solid #f2f2f2;\n -webkit-box-shadow: inset 0 1px 0 rgba(255,255,255,.1), 0 1px 0 rgba(255,255,255,.1);\n -moz-box-shadow: inset 0 1px 0 rgba(255,255,255,.1), 0 1px 0 rgba(255,255,255,.1);\n box-shadow: inset 0 1px 0 rgba(255,255,255,.1), 0 1px 0 rgba(255,255,255,.1);\n }\n .navbar-inverse .nav-collapse .navbar-form,\n .navbar-inverse .nav-collapse .navbar-search {\n border-top-color: #111111;\n border-bottom-color: #111111;\n }\n .navbar .nav-collapse .nav.pull-right {\n float: none;\n margin-left: 0;\n }\n .nav-collapse,\n .nav-collapse.collapse {\n overflow: hidden;\n height: 0;\n }\n .navbar .btn-navbar {\n display: block;\n }\n .navbar-static .navbar-inner {\n padding-left: 10px;\n padding-right: 10px;\n }\n}\n@media (min-width: 980px) {\n .nav-collapse.collapse {\n height: auto !important;\n overflow: visible !important;\n }\n}\n" }, { "path": "src/test/resources/samples/langs/CSV/cars.csv", "content": "Year,Make,Model,Length\n1997,Ford,E350,2.34\n2000,Mercury,Cougar,2.38\n" }, { "path": "src/test/resources/samples/langs/CWeb/sat-life.w", "content": "\\datethis\n@*Intro. This program generates clauses for the transition relation\nfrom time $t$ to time $t+1$ in Conway's Game of Life, assuming that\nall of the potentially live cells at time $t$ belong to a pattern\nthat's specified in |stdin|. The pattern is defined by one or more\nlines representing rows of cells, where each line has `\\..' in a\ncell that's guaranteed to be dead at time~$t$, otherwise it has `\\.*'.\nThe time is specified separately as a command-line parameter.\n\nThe Boolean variable for cell $(x,y)$ at time $t$ is named by its\nso-called ``xty code,'' namely by the decimal value of~$x$, followed\nby a code letter for~$t$, followed by the decimal value of~$y$. For\nexample, if $x=10$ and $y=11$ and $t=0$, the variable that indicates\nliveness of the cell is \\.{10a11}; and the corresponding variable\nfor $t=1$ is \\.{10b11}.\n\nUp to 19 auxiliary variables are used together with each xty code,\nin order to construct clauses that define the successor state.\nThe names of these variables are obtained by appending one of\nthe following two-character combinations to the xty code:\n\\.{A2}, \\.{A3}, \\.{A4},\n\\.{B1}, \\.{B2}, \\.{B3}, \\.{B4},\n\\.{C1}, \\.{C2}, \\.{C3}, \\.{C4},\n\\.{D1}, \\.{D2},\n\\.{E1}, \\.{E2},\n\\.{F1}, \\.{F2},\n\\.{G1}, \\.{G2}.\nThese variables are derived from the Bailleux--Boufkhad method\nof encoding cardinality constraints:\nThe auxiliary variable \\.{A$k$} stands for the condition\n``at least $k$ of the eight neighbors are alive.'' Similarly,\n\\.{B$k$} stands for ``at least $k$ of the first four neighbors\nare alive,'' and \\.{C$k$} accounts for the other four neighbors.\nCodes \\.D, \\.E, \\.F, and~\\.G refer to pairs of neighbors.\nThus, for instance, \\.{10a11C2} means that at least two of the\nlast four neighbors of cell $(10,11)$ are alive.\n\nThose auxiliary variables receive values by means of up to 77 clauses per cell.\nFor example, if $u$ and~$v$ are the neighbors of cell~$z$ that correspond\nto a pairing of type~\\.D, there are six clauses\n$$\\bar u d_1,\\quad\n \\bar v d_1,\\quad\n \\bar u\\bar v d_2,\\quad\n u v\\bar d_1,\\quad\n u\\bar d_2,\\quad\n v\\bar d_2.$$\nThe sixteen clauses\n$$\\displaylines{\\hfill\n\\bar d_1b_1,\\quad\n\\bar e_1b_1,\\quad\n\\bar d_2b_2,\\quad\n\\bar d_1\\bar e_1b_2,\\quad\n\\bar e_2b_2,\\quad\n\\bar d_2\\bar e_1b_3,\\quad\n\\bar d_1\\bar e_2b_3,\\quad\n\\bar d_2\\bar e_2b_4,\n\\hfill\\cr\\hfill\nd_1e_1\\bar b_1,\\quad\nd_1e_2\\bar b_2,\\quad\nd_2e_1\\bar b_2,\\quad\nd_1\\bar b_3,\\quad\nd_2e_2\\bar b_3,\\quad\ne_1\\bar b_3,\\quad\nd_2\\bar b_4,\\quad\ne_2\\bar b_4\n\\hfill}$$\ndefine $b$ variables from $d$'s and $e$'s; and another sixteen\ndefine $c$'s from $f$'s and $g$'s in the same fashion.\nA similar set of 21 clauses will define the $a$'s from the $b$'s and $c$'s.\n\nOnce the $a$'s are defined, thus essentially counting the\nlive neighbors of cell $z$, the next\nstate~$z'$ is defined by five further clauses\n$$\\bar a_4\\bar z',\\quad\na_2\\bar z',\\quad\na_3z\\bar z',\\quad\n\\bar a_3a_4z',\\quad\n\\bar a_2a_4\\bar zz'.$$\nFor example, the last of these states that $z'$ will be true\n(i.e., that cell $z$ will be alive at time $t+1$) if\n$z$ is alive at time~$t$ and has $\\ge2$ live neighbors\nbut not $\\ge4$.\n\nNearby cells can share auxiliary variables, according to a tricky scheme that\nis worked out below. In consequence, the actual number of auxiliary variables\nand clauses per cell is reduced from 19 and $77+5$ to 13 and $57+5$,\nrespectively, except at the boundaries.\n\n@ So here's the overall outline of the program.\n\n@d maxx 50 /* maximum number of lines in the pattern supplied by |stdin| */\n@d maxy 50 /* maximum number of columns per line in |stdin| */\n\n@c\n#include \n#include \nchar p[maxx+2][maxy+2]; /* is cell $(x,y)$ potentially alive? */\nchar have_b[maxx+2][maxy+2]; /* did we already generate $b(x,y)$? */\nchar have_d[maxx+2][maxy+2]; /* did we already generate $d(x,y)$? */\nchar have_e[maxx+2][maxy+4]; /* did we already generate $e(x,y)$? */\nchar have_f[maxx+4][maxy+2]; /* did we already generate $f(x-2,y)$? */\nint tt; /* time as given on the command line */\nint xmax,ymax; /* the number of rows and columns in the input pattern */\nint xmin=maxx,ymin=maxy; /* limits in the other direction */\nchar timecode[]=\"abcdefghijklmnopqrstuvwxyz\"@|\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"@|\n \"!\\\"#$%&'()*+,-./:;<=>?@@[\\\\]^_`{|}~\"; /* codes for $0\\le t\\le83$ */\n@q$@>\nchar buf[maxy+2]; /* input buffer */\nunsigned int clause[4]; /* clauses are assembled here */\nint clauseptr; /* this many literals are in the current clause */\n@@;\nmain(int argc,char*argv[]) {\n register int j,k,x,y;\n @;\n @;\n for (x=xmin-1;x<=xmax+1;x++) for (y=ymin-1;y<=ymax+1;y++) {\n @;\n a(x,y);\n zprime(x,y);\n }\n}\n\n@ @=\nif (argc!=2 || sscanf(argv[1],\"%d\",&tt)!=1) {\n fprintf(stderr,\"Usage: %s t\\n\",argv[0]);\n exit(-1);\n}\nif (tt<0 || tt>82) {\n fprintf(stderr,\"The time should be between 0 and 82 (not %d)!\\n\",tt);\n exit(-2);\n}\n\n@ @=\nfor (x=1;;x++) {\n if (!fgets(buf,maxy+2,stdin)) break;\n if (x>maxx) {\n fprintf(stderr,\"Sorry, the pattern should have at most %d rows!\\n\",maxx);\n exit(-3);\n }\n for (y=1;buf[y-1]!='\\n';y++) {\n if (y>maxy) {\n fprintf(stderr,\"Sorry, the pattern should have at most %d columns!\\n\",\n maxy);\n exit(-4);\n }\n if (buf[y-1]=='*') {\n p[x][y]=1;\n if (y>ymax) ymax=y;\n if (yxmax) xmax=x;\n if (x=0 && (yy)>=0? p[xx][yy]: 0)\n\n@=\nif (pp(x-1,y-1)+pp(x-1,y)+pp(x-1,y+1)+\n pp(x,y-1)+p[x][y]+p[x][y+1]+\n pp(x+1,y-1)+p[x+1][y]+p[x+1][y+1]<3) continue;\n\n@ Clauses are assembled in the |clause| array (surprise), where we\nput encoded literals.\n\nThe code for a literal is an unsigned 32-bit quantity, where the leading\nbit is 1 if the literal should be complemented. The next three bits\nspecify the type of the literal (0 thru 7 for plain and \\.A--\\.G);\nthe next three bits specify an integer~$k$; and the next bit is zero.\nThat leaves room for two 12-bit fields, which specify $x$ and $y$.\n\nType 0 literals have $k=0$ for the ordinary xty code. However, the\nvalue $k=1$ indicates that the time code should be for $t+1$ instead of~$t$.\nAnd $k=2$ denotes a special ``tautology'' literal, which is always true.\nIf the tautology literal is complemented, we omit it from the clause;\notherwise we omit the entire clause.\nFinally, $k=7$ denotes an auxiliary literal, used to avoid\nclauses of length~4.\n\nHere's a subroutine that outputs the current clause and resets\nthe |clause| array.\n\n@d taut (2<<25)\n@d sign (1U<<31)\n\n@=\nvoid outclause(void) {\n register int c,k,x,y,p;\n for (p=0;p>31) printf(\" ~\");@+else printf(\" \");\n c=(clause[p]>>28)&0x7;\n k=(clause[p]>>25)&0x7;\n x=(clause[p]>>12)&0xfff;\n y=clause[p]&0xfff;\n if (c) printf(\"%d%c%d%c%d\",\n x,timecode[tt],y,c+'@@',k);\n else if (k==7) printf(\"%d%c%dx\",\n x,timecode[tt],y);\n else printf(\"%d%c%d\",\n x,timecode[tt+k],y);\n }\n printf(\"\\n\");\ndone: clauseptr=0;\n}\n\n@ And here's another, which puts a type-0 literal into |clause|.\n\n@=\nvoid applit(int x,int y,int bar,int k) {\n if (k==0 && (xxmax || yymax || p[x][y]==0))\n clause[clauseptr++]=(bar? 0: sign)+taut;\n else clause[clauseptr++]=(bar? sign:0)+(k<<25)+(x<<12)+y;\n}\n\n@ The |d| and |e| subroutines are called for only one-fourth\nof all cell addresses $(x,y)$. Indeed, one can show that\n$x$ is always odd, and that $y\\bmod4<2$.\n\nTherefore we remember if we've seen $(x,y)$ before.\n\nSlight trick: If |yy| is not in range, we avoid generating the\nclause $\\bar d_k$ twice.\n\n@d newlit(x,y,c,k) clause[clauseptr++]=((c)<<28)+((k)<<25)+((x)<<12)+(y)\n@d newcomplit(x,y,c,k) \n clause[clauseptr++]=sign+((c)<<28)+((k)<<25)+((x)<<12)+(y)\n\n@=\nvoid d(int x,int y) {\n register x1=x-1,x2=x,yy=y+1;\n if (have_d[x][y]!=tt+1) {\n applit(x1,yy,1,0),newlit(x,y,4,1),outclause();\n applit(x2,yy,1,0),newlit(x,y,4,1),outclause();\n applit(x1,yy,1,0),applit(x2,yy,1,0),newlit(x,y,4,2),outclause();\n applit(x1,yy,0,0),applit(x2,yy,0,0),newcomplit(x,y,4,1),outclause();\n applit(x1,yy,0,0),newcomplit(x,y,4,2),outclause();\n if (yy>=ymin && yy<=ymax)\n applit(x2,yy,0,0),newcomplit(x,y,4,2),outclause();\n have_d[x][y]=tt+1;\n }\n}\n@#\nvoid e(int x,int y) {\n register x1=x-1,x2=x,yy=y-1;\n if (have_e[x][y]!=tt+1) {\n applit(x1,yy,1,0),newlit(x,y,5,1),outclause();\n applit(x2,yy,1,0),newlit(x,y,5,1),outclause();\n applit(x1,yy,1,0),applit(x2,yy,1,0),newlit(x,y,5,2),outclause();\n applit(x1,yy,0,0),applit(x2,yy,0,0),newcomplit(x,y,5,1),outclause();\n applit(x1,yy,0,0),newcomplit(x,y,5,2),outclause();\n if (yy>=ymin && yy<=ymax)\n applit(x2,yy,0,0),newcomplit(x,y,5,2),outclause();\n have_e[x][y]=tt+1;\n }\n}\n \n@ The |f| subroutine can't be shared quite so often. But we\ndo save a factor of~2, because $x+y$ is always even.\n\n@=\nvoid f(int x,int y) {\n register xx=x-1,y1=y,y2=y+1;\n if (have_f[x][y]!=tt+1) {\n applit(xx,y1,1,0),newlit(x,y,6,1),outclause();\n applit(xx,y2,1,0),newlit(x,y,6,1),outclause();\n applit(xx,y1,1,0),applit(xx,y2,1,0),newlit(x,y,6,2),outclause();\n applit(xx,y1,0,0),applit(xx,y2,0,0),newcomplit(x,y,6,1),outclause();\n applit(xx,y1,0,0),newcomplit(x,y,6,2),outclause();\n if (xx>=xmin && xx<=xmax)\n applit(xx,y2,0,0),newcomplit(x,y,6,2),outclause();\n have_f[x][y]=tt+1;\n }\n}\n\n@ The |g| subroutine cleans up the dregs, by somewhat tediously\nlocating the two neighbors that weren't handled by |d|, |e|, or~|f|.\nNo sharing is possible here.\n\n@=\nvoid g(int x,int y) {\n register x1,x2,y1,y2;\n if (x&1) x1=x-1,y1=y,x2=x+1,y2=y^1;\n else x1=x+1,y1=y,x2=x-1,y2=y-1+((y&1)<<1);\n applit(x1,y1,1,0),newlit(x,y,7,1),outclause();\n applit(x2,y2,1,0),newlit(x,y,7,1),outclause();\n applit(x1,y1,1,0),applit(x2,y2,1,0),newlit(x,y,7,2),outclause();\n applit(x1,y1,0,0),applit(x2,y2,0,0),newcomplit(x,y,7,1),outclause();\n applit(x1,y1,0,0),newcomplit(x,y,7,2),outclause();\n applit(x2,y2,0,0),newcomplit(x,y,7,2),outclause();\n}\n\n@ Fortunately the |b| subroutine {\\it can\\/} be shared (since |x| is always\nodd), thus saving half of the sixteen clauses generated.\n\n@=\nvoid b(int x,int y) {\n register j,k,xx=x,y1=y-(y&2),y2=y+(y&2);\n if (have_b[x][y]!=tt+1) {\n d(xx,y1);\n e(xx,y2);\n for (j=0;j<3;j++) for (k=0;k<3;k++) if (j+k) {\n if (j) newcomplit(xx,y1,4,j); /* $\\bar d_j$ */\n if (k) newcomplit(xx,y2,5,k); /* $\\bar e_k$ */\n newlit(x,y,2,j+k); /* $b_{j+k}$ */\n outclause();\n if (j) newlit(xx,y1,4,3-j); /* $d_{3-j}$ */\n if (k) newlit(xx,y2,5,3-k); /* $e_{3-k}$ */\n newcomplit(x,y,2,5-j-k); /* $\\bar b_{5-j-k}$ */\n outclause(); \n }\n have_b[x][y]=tt+1;\n }\n}\n\n@ The (unshared) |c| subroutine handles the other four neighbors,\nby working with |f| and |g| instead of |d| and~|e|.\n\nIf |y=0|, the overlap rules set |y1=-1|, which can be problematic.\nI've decided to avoid this case by omitting |f| when it is\nguaranteed to be zero.\n\n@=\nvoid c(int x,int y) {\n register j,k,x1,y1;\n if (x&1) x1=x+2,y1=(y-1)|1;\n else x1=x,y1=y&-2;\n g(x,y);\n if (x1-1xmax || y1+1ymax)\n @@;\n else {\n f(x1,y1);\n for (j=0;j<3;j++) for (k=0;k<3;k++) if (j+k) {\n if (j) newcomplit(x1,y1,6,j); /* $\\bar f_j$ */\n if (k) newcomplit(x,y,7,k); /* $\\bar g_k$ */\n newlit(x,y,3,j+k); /* $c_{j+k}$ */\n outclause();\n if (j) newlit(x1,y1,6,3-j); /* $f_{3-j}$ */\n if (k) newlit(x,y,7,3-k); /* $g_{3-k}$ */\n newcomplit(x,y,3,5-j-k); /* $\\bar c_{5-j-k}$ */\n outclause();\n }\n }\n}\n\n@ @=\n{\n for (k=1;k<3;k++) {\n newcomplit(x,y,7,k),newlit(x,y,3,k),outclause(); /* $\\bar g_k\\lor c_k$ */\n newlit(x,y,7,k),newcomplit(x,y,3,k),outclause(); /* $g_k\\lor\\bar c_k$ */\n }\n newcomplit(x,y,3,3),outclause(); /* $\\bar c_3$ */\n newcomplit(x,y,3,4),outclause(); /* $\\bar c_4$ */\n}\n\n@ Totals over all eight neighbors are then deduced by the |a|\nsubroutine.\n\n@=\nvoid a(int x,int y) {\n register j,k,xx=x|1;\n b(xx,y);\n c(x,y);\n for (j=0;j<5;j++) for (k=0;k<5;k++) if (j+k>1 && j+k<5) {\n if (j) newcomplit(xx,y,2,j); /* $\\bar b_j$ */\n if (k) newcomplit(x,y,3,k); /* $\\bar c_k$ */\n newlit(x,y,1,j+k); /* $a_{j+k}$ */\n outclause();\n }\n for (j=0;j<5;j++) for (k=0;k<5;k++) if (j+k>2 && j+k<6 && j*k) {\n if (j) newlit(xx,y,2,j); /* $b_j$ */\n if (k) newlit(x,y,3,k); /* $c_k$ */\n newcomplit(x,y,1,j+k-1); /* $\\bar a_{j+k-1}$ */\n outclause();\n }\n}\n\n@ Finally, as mentioned at the beginning, $z'$ is determined\nfrom $z$, $a_2$, $a_3$, and $a_4$.\n\nI actually generate six clauses, not five, in order to stick to\n{\\mc 3SAT}.\n\n@=\nvoid zprime(int x,int y) {\n newcomplit(x,y,1,4),applit(x,y,1,1),outclause(); /* $\\bar a_4\\bar z'$ */\n newlit(x,y,1,2),applit(x,y,1,1),outclause(); /* $a_2\\bar z'$ */\n newlit(x,y,1,3),applit(x,y,0,0),applit(x,y,1,1),outclause();\n /* $a_3z\\bar z'$ */\n newcomplit(x,y,1,3),newlit(x,y,1,4),applit(x,y,0,1),outclause();\n /* $\\bar a_3a_4z'$ */\n applit(x,y,0,7),newcomplit(x,y,1,2),newlit(x,y,1,4),outclause();\n /* $x\\bar a_2a_4$ */\n applit(x,y,1,7),applit(x,y,1,0),applit(x,y,0,1),outclause();\n /* $\\bar x\\bar zz'$ */\n}\n\n@*Index.\n" }, { "path": "src/test/resources/samples/langs/CartoCSS/amenity-points.mss", "content": "@marina-text: #576ddf; // also swimming_pool\n@wetland-text: darken(#017fff, 10%); /* Also for marsh */\n@mud-text: darken(#aea397, 20%);\n@shop-icon: #ac39ac;\n@transportation-icon: #0092da;\n@transportation-text: #0066ff;\n@airtransport: #8461C4;\n\n@landcover-font-size: 10;\n@landcover-font-size-big: 12;\n@landcover-font-size-bigger: 15;\n@landcover-wrap-width-size: 25;\n@landcover-wrap-width-size-big: 35;\n@landcover-wrap-width-size-bigger: 45;\n@landcover-face-name: @oblique-fonts;\n\n@standard-wrap-width: 30;\n\n.points {\n [feature = 'tourism_alpine_hut'][zoom >= 13] {\n point-file: url('symbols/alpinehut.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_shelter'][zoom >= 16] {\n point-file: url('symbols/shelter2.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_atm'][zoom >= 17] {\n point-file: url('symbols/atm2.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_bank'][zoom >= 17] {\n point-file: url('symbols/bank2.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_bar'][zoom >= 17] {\n point-file: url('symbols/bar.p.20.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_bicycle_rental'][zoom >= 17] {\n point-file: url('symbols/rental_bicycle.p.20.png');\n point-placement: interior;\n }\n\n [feature = 'highway_bus_stop'] {\n [zoom >= 16] {\n marker-file: url('symbols/square.svg');\n marker-fill: @transportation-icon;\n marker-placement: interior;\n marker-width: 6;\n }\n [zoom >= 17] {\n marker-file: url('symbols/bus_stop.p.12.png');\n marker-width: 12;\n }\n }\n\n [feature = 'amenity_bus_station'][zoom >= 16] {\n point-file: url('symbols/bus_station.n.16.png');\n point-placement: interior;\n }\n\n [feature = 'highway_traffic_signals'][zoom >= 17] {\n marker-file: url('symbols/traffic_light.svg');\n marker-fill: #0a0a0a;\n marker-placement: interior;\n }\n\n [feature = 'amenity_cafe'][zoom >= 17] {\n point-file: url('symbols/cafe.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'tourism_camp_site'][zoom >= 16] {\n point-file: url('symbols/camping.n.16.png');\n point-placement: interior;\n }\n\n [feature = 'highway_ford'][zoom >= 16] {\n point-file: url('symbols/transport_ford.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'tourism_caravan_site'][zoom >= 16] {\n point-file: url('symbols/caravan_park.p.24.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_car_sharing'][zoom >= 16] {\n point-file: url('symbols/car_share.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'tourism_chalet'][zoom >= 17] {\n point-file: url('symbols/chalet.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_cinema'][zoom >= 16] {\n point-file: url('symbols/cinema.p.24.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_fire_station'][zoom >= 16] {\n point-file: url('symbols/firestation.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_fuel'][zoom >= 17] {\n point-file: url('symbols/fuel.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'tourism_guest_house'][zoom >= 17] {\n point-file: url('symbols/guest_house.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_hospital'][zoom >= 15] {\n point-file: url('symbols/hospital.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'tourism_hostel'][zoom >= 17] {\n point-file: url('symbols/hostel.p.20.png');\n point-placement: interior;\n }\n\n [feature = 'tourism_hotel'][zoom >= 17] {\n point-file: url('symbols/hotel2.p.20.png');\n point-placement: interior;\n }\n\n [feature = 'tourism_motel'][zoom >= 17] {\n point-file: url('symbols/motel.p.20.png');\n point-placement: interior;\n }\n\n [feature = 'tourism_information'][zoom >= 17] {\n point-file: url('symbols/information.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_embassy'][zoom >= 17] {\n point-file: url('symbols/embassy.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_library'][zoom >= 16] {\n point-file: url('symbols/library.p.20.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_courthouse'][zoom > 16] {\n point-file: url('symbols/amenity_court.p.20.png');\n point-placement: interior;\n }\n\n [feature = 'waterway_lock'],\n [feature = 'lock_yes'] {\n [zoom >= 15] {\n marker-fill: #969494;\n marker-width: 9;\n marker-line-width: 0;\n marker-placement: interior;\n }\n }\n\n [feature = 'man_made_mast'][zoom >= 17] {\n point-file: url('symbols/communications.p.20.png');\n point-placement: interior;\n }\n\n [feature = 'tourism_museum'][zoom >= 16] {\n point-file: url('symbols/museum.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_parking'][zoom >= 16] {\n marker-file: url('symbols/parking.svg');\n marker-placement: interior;\n marker-clip: false;\n marker-fill: @transportation-icon;\n [access != ''][access != 'public'][access != 'yes'] {\n marker-opacity: 0.33;\n }\n }\n\n [feature = 'amenity_pharmacy'][zoom >= 17] {\n point-file: url('symbols/pharmacy.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_place_of_worship'][zoom >= 16] {\n point-file: url('symbols/place_of_worship3.p.16.png');\n point-placement: interior;\n [religion = 'christian'] {\n point-file: url('symbols/christian3.p.14.png');\n [denomination = 'jehovahs_witness']{\n point-file: url('symbols/place_of_worship3.p.16.png');\n }\n }\n [religion = 'muslim'] {\n point-file: url('symbols/islamic3.p.16.png');\n }\n [religion = 'sikh'] {\n point-file: url('symbols/sikh3.p.16.png');\n }\n [religion = 'jewish'] {\n point-file: url('symbols/jewish3.p.16.png');\n }\n [religion = 'hindu'] {\n point-file: url('symbols/hindu.png');\n }\n [religion = 'buddhist'] {\n point-file: url('symbols/buddhist.png');\n }\n [religion = 'shinto'] {\n point-file: url('symbols/shinto.png');\n }\n [religion = 'taoist'] {\n point-file: url('symbols/taoist.png');\n }\n }\n\n [feature = 'amenity_police'][zoom >= 16] {\n point-file: url('symbols/police.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_post_box'][zoom >= 17] {\n point-file: url('symbols/post_box.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_post_office'][zoom >= 17] {\n point-file: url('symbols/post_office.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_pub'][zoom >= 17] {\n point-file: url('symbols/pub.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_biergarten'][zoom >= 17] {\n point-file: url('symbols/biergarten.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_recycling'][zoom >= 16] {\n point-file: url('symbols/recycling.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_restaurant'][zoom >= 17] {\n point-file: url('symbols/restaurant.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_fast_food'][zoom >= 17] {\n point-file: url('symbols/fast_food.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_telephone'][zoom >= 17] {\n point-file: url('symbols/telephone.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_emergency_phone'][zoom >= 17] {\n point-file: url('symbols/sosphone.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_theatre'][zoom >= 16] {\n point-file: url('symbols/theatre.p.20.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_toilets'][zoom >= 17] {\n point-file: url('symbols/toilets.p.20.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_drinking_water'][zoom >= 17] {\n point-file: url('symbols/food_drinkingtap.p.20.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_prison'][zoom >= 17] {\n point-file: url('symbols/amenity_prison.p.20.png');\n point-placement: interior;\n }\n\n [feature = 'tourism_viewpoint'][zoom >= 16] {\n point-file: url('symbols/view_point.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'man_made_water_tower'][zoom >= 17] {\n point-file: url('symbols/tower_water.p.20.png');\n point-placement: interior;\n }\n\n [feature = 'historic_memorial'][zoom >= 17] {\n point-file: url('symbols/tourist_memorial.p.20.png');\n point-placement: interior;\n }\n\n [feature = 'historic_archaeological_site'][zoom >= 16] {\n point-file: url('symbols/tourist_archaeological2.glow.24.png');\n point-placement: interior;\n }\n\n [feature = 'shop_other'][zoom >= 17] {\n marker-fill: @shop-icon;\n marker-width: 6;\n marker-line-width: 0;\n marker-placement: interior;\n marker-clip: false;\n }\n\n [feature = 'shop_supermarket'][zoom >= 16] {\n marker-file: url('symbols/shop_supermarket.svg');\n marker-placement: interior;\n marker-clip: false;\n marker-fill: @shop-icon;\n }\n\n [feature = 'shop_bakery'][zoom >= 17] {\n marker-file: url('symbols/shop_bakery.p.16.png');\n marker-placement: interior;\n marker-clip: false;\n }\n\n [feature = 'shop_butcher'][zoom >= 17] {\n marker-file: url('symbols/shop_butcher.png');\n marker-placement: interior;\n marker-clip: false;\n }\n\n [feature = 'shop_clothes'],\n [feature = 'shop_fashion'] {\n [zoom >= 17] {\n marker-file: url('symbols/shop_clothes.svg');\n marker-placement: interior;\n marker-clip: false;\n marker-fill: @shop-icon;\n }\n }\n\n [feature = 'shop_convenience'][zoom >= 17] {\n marker-file: url('symbols/shop_convenience.svg');\n marker-placement: interior;\n marker-clip: false;\n marker-fill: @shop-icon;\n }\n\n [feature = 'shop_department_store'][zoom >= 16] {\n point-file: url('symbols/department_store.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'shop_doityourself'][zoom >= 17] {\n marker-file: url('symbols/shop_diy.p.16.png');\n marker-placement: interior;\n marker-clip: false;\n }\n\n [feature = 'shop_florist'][zoom >= 17] {\n marker-file: url('symbols/florist.p.16.png');\n marker-placement: interior;\n marker-clip: false;\n }\n\n [feature = 'shop_hairdresser'][zoom >= 17] {\n marker-file: url('symbols/shop_hairdresser.p.16.png');\n marker-placement: interior;\n marker-clip: false;\n }\n\n [feature = 'shop_car'][zoom >= 17] {\n marker-file: url('symbols/shop_car.svg');\n marker-placement: interior;\n marker-clip: false;\n marker-fill: @shop-icon;\n }\n\n [feature = 'shop_car_repair'][zoom >= 17] {\n marker-file: url('symbols/shopping_car_repair.p.16.png');\n marker-placement: interior;\n marker-clip: false;\n }\n\n [feature = 'shop_bicycle'][zoom >= 17] {\n marker-file: url('symbols/shopping_bicycle.p.16.png');\n marker-placement: interior;\n marker-clip: false;\n }\n\n [feature = 'leisure_playground'][zoom >= 17] {\n point-file: url('symbols/playground.p.20.png');\n point-placement: interior;\n }\n\n [feature = 'tourism_picnic_site'][zoom >= 16] {\n point-file: url('symbols/picnic.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'leisure_picnic_table'][zoom >= 17] {\n point-file: url('symbols/picnic.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'leisure_slipway'][zoom >= 17] {\n point-file: url('symbols/transport_slipway.p.20.png');\n point-placement: interior;\n }\n\n [feature = 'aeroway_helipad'][zoom >= 16]::aeroway {\n marker-file: url('symbols/helipad.svg');\n marker-clip: false;\n marker-fill: @airtransport;\n }\n\n [feature = 'aeroway_aerodrome'][zoom >= 10][zoom < 14]::aeroway {\n marker-file: url('symbols/aerodrome.svg');\n marker-clip: false;\n marker-fill: @airtransport;\n }\n\n [feature = 'man_made_lighthouse'][zoom >= 15]::man_made {\n point-file: url('symbols/lighthouse.p.20.png');\n point-placement: interior;\n }\n\n [feature = 'natural_peak'][zoom >= 11]::natural {\n marker-file: url('symbols/peak.svg');\n marker-fill: #d08f55;\n marker-placement: interior;\n }\n\n [feature = 'natural_volcano'][zoom >= 11]::natural {\n marker-file: url('symbols/peak.svg');\n marker-fill: #d40000;\n marker-placement: interior;\n }\n\n [feature = 'natural_saddle'][zoom >= 15]::natural {\n marker-file: url('symbols/saddle.svg');\n marker-fill: #d08f55;\n marker-placement: interior;\n }\n\n [feature = 'natural_cave_entrance'][zoom >= 15]::natural {\n point-file: url('symbols/poi_cave.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'natural_spring'][zoom >= 14]::natural {\n marker-file: url('symbols/spring.svg');\n marker-placement: interior;\n }\n\n [feature = 'natural_tree'][zoom >= 16]::natural {\n marker-placement: interior;\n marker-ignore-placement: true;\n marker-line-width: 0;\n marker-width: 3;\n marker-fill: #239c45;\n [zoom >= 17] {\n marker-line-width: 1;\n marker-line-color: #8ef2ab;\n marker-width: 4;\n }\n }\n\n [feature = 'power_generator']['generator:source' = 'wind']::power,\n [feature = 'power_generator'][power_source = 'wind']::power {\n [zoom >= 15] {\n point-file: url('symbols/power_wind.png');\n point-placement: interior;\n }\n }\n\n [feature = 'man_made_windmill'][zoom >= 16]::man_made {\n point-file: url('symbols/windmill.png');\n point-placement: interior;\n }\n\n [feature = 'man_made_mast'][zoom >= 17]::man_made {\n point-file: url('symbols/communications.p.20.png');\n point-placement: interior;\n }\n}\n\n.amenity-low-priority {\n [railway = 'level_crossing'][zoom >= 14]::railway {\n point-file: url('symbols/level_crossing.svg');\n point-placement: interior;\n [zoom >= 16] {\n point-file: url('symbols/level_crossing2.svg');\n }\n }\n\n [highway = 'mini_roundabout'][zoom >= 16]::highway {\n marker-file: url('symbols/mini_roundabout.svg');\n marker-placement: interior;\n }\n\n [barrier = 'gate']::barrier {\n [zoom >= 16] {\n marker-file: url('symbols/gate.svg');\n marker-placement: interior;\n }\n }\n\n [barrier = 'lift_gate'][zoom >= 16]::barrier {\n marker-file: url('symbols/liftgate.svg');\n marker-fill: #3f3f3f;\n marker-placement: interior\n }\n\n [barrier = 'bollard'],\n [barrier = 'block'] {\n [zoom >= 16] {\n marker-width: 3;\n marker-line-width: 0;\n marker-fill: #7d7c7c;\n marker-placement: interior;\n\n [zoom >= 18] {\n marker-width: 4;\n }\n }\n }\n}\n\n.text-low-zoom[zoom < 10],\n.text[zoom >= 10] {\n [feature = 'place_island'][zoom >= 7][way_pixels > 3000],\n [feature = 'place_island'][zoom >= 16],\n [feature = 'place_islet'][zoom >= 14][way_pixels > 3000],\n [feature = 'place_islet'][zoom >= 17] {\n text-name: \"[name]\";\n text-fill: #000;\n text-size: 10;\n [way_pixels > 12000] { text-size: 12; }\n [way_pixels > 48000] { text-size: 15; }\n text-face-name: @oblique-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n }\n\n [feature = 'amenity_pub'],\n [feature = 'amenity_restaurant'],\n [feature = 'amenity_cafe'],\n [feature = 'amenity_fast_food'],\n [feature = 'amenity_biergarten'],\n [feature = 'amenity_bar'] {\n [zoom >= 17] {\n text-name: \"[name]\";\n text-fill: #734a08;\n text-size: 10;\n text-dy: 11;\n text-face-name: @bold-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n [feature = 'amenity_bar']{\n text-dy: 13;\n }\n }\n }\n\n [feature = 'amenity_library'],\n [feature = 'amenity_theatre'],\n [feature = 'amenity_courthouse'],\n [feature = 'amenity_cinema'] {\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: 10;\n text-fill: #734a08;\n text-dy: 13;\n text-face-name: @bold-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n [feature = 'amenity_cinema'] {\n text-dy: 15;\n }\n }\n }\n\n [feature = 'amenity_parking'][zoom >= 17] {\n text-name: \"[name]\";\n text-size: 9;\n text-fill: @transportation-text;\n text-dy: 9;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n [access != ''][access != 'public'][access != 'yes'] {\n text-fill: #66ccaf;\n }\n }\n\n [feature = 'amenity_police'][zoom >= 17] {\n text-name: \"[name]\";\n text-size: 10;\n text-fill: #734a08;\n text-dy: 11;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n }\n\n [feature = 'amenity_fire_station'][zoom >= 17] {\n text-name: \"[name]\";\n text-size: 10;\n text-fill: #734a08;\n text-dy: 11;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n }\n\n [feature = 'amenity_place_of_worship'][zoom >= 17] {\n text-name: \"[name]\";\n text-size: 10;\n text-fill: #000033;\n text-dy: 12;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n }\n\n [feature = 'natural_wood'][is_building = 'no'] {\n [zoom >= 8][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@wood, 40%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'natural_peak'],\n [feature = 'natural_volcano'] {\n [zoom >= 13] {\n text-name: \"[name]\";\n text-size: 10;\n text-fill: brown;\n text-dy: 7;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n ele/text-name: \"[ele]\";\n ele/text-size: 9;\n ele/text-fill: brown;\n ele/text-dy: 6;\n ele/text-face-name: @oblique-fonts;\n ele/text-halo-radius: 1;\n ele/text-placement: interior;\n [name != ''] {\n ele/text-dy: 19;\n }\n }\n }\n\n [feature = 'natural_saddle'] {\n [zoom >= 15] {\n text-name: \"[name]\";\n text-size: 10;\n text-fill: brown;\n text-dy: 7;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n ele/text-name: \"[ele]\";\n ele/text-size: 9;\n ele/text-fill: brown;\n ele/text-dy: 6;\n ele/text-face-name: @oblique-fonts;\n ele/text-halo-radius: 1;\n ele/text-placement: interior;\n [name != ''] {\n ele/text-dy: 19;\n }\n }\n }\n\n [feature = 'natural_cave_entrance'][zoom >= 15] {\n text-name: \"[name]\";\n text-size: 10;\n text-fill: brown;\n text-dy: 11;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n }\n\n [feature = 'historic_memorial'][zoom >= 17] {\n text-name: \"[name]\";\n text-size: 9;\n text-fill: brown;\n text-dy: 13;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n }\n\n [feature = 'historic_archaeological_site'][zoom >= 17] {\n text-name: \"[name]\";\n text-size: 9;\n text-fill: brown;\n text-dy: 15;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n }\n\n [feature = 'natural_water'],\n [feature = 'natural_lake'],\n [feature = 'landuse_reservoir'],\n [feature = 'landuse_basin'] {\n [way_area >= 40000000][zoom >= 10],\n [way_area >= 10000000][zoom >= 11],\n [way_area >= 2400000][zoom >= 12],\n [way_area >= 600000][zoom >= 13],\n [way_area >= 150000][zoom >= 14],\n [way_area >= 80000][zoom >= 15],\n [way_area >= 20000][zoom >= 16],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: 12;\n text-fill: @water-text;\n text-face-name: @oblique-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n }\n }\n\n [feature = 'natural_mud'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: @mud-text;\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'natural_wetland'][is_building = 'no'],\n [feature = 'natural_marsh'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: @wetland-text;\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'leisure_swimming_pool'][is_building = 'no'] {\n [zoom >= 14][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: @marina-text;\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'leisure_sports_centre'][is_building = 'no'],\n [feature = 'leisure_stadium'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@stadium, 30%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'leisure_track'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@track, 40%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'leisure_pitch'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@pitch, 40%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'leisure_playground'] {\n [way_area >= 150000][zoom >= 14],\n [way_area >= 80000][zoom >= 15],\n [way_area >= 20000][zoom >= 16],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: 11;\n text-dy: 13;\n text-fill: darken(@park, 60%);\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n }\n }\n\n [feature = 'leisure_park'][is_building = 'no'],\n [feature = 'leisure_recreation_ground'][is_building = 'no'],\n [feature = 'landuse_recreation_ground'][is_building = 'no'],\n [feature = 'landuse_conservation'][is_building = 'no'],\n [feature = 'landuse_village_green'][is_building = 'no'],\n [feature = 'leisure_common'][is_building = 'no'],\n [feature = 'leisure_garden'][is_building = 'no'],\n [feature = 'leisure_golf_course'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@park, 60%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'boundary_national_park'][is_building = 'no'],\n [feature = 'leisure_nature_reserve'][is_building = 'no'] {\n [zoom >= 8][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@park, 70%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'landuse_quarry'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@quarry, 60%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'landuse_vineyard'][is_building = 'no'],\n [feature = 'landuse_orchard'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@vineyard, 50%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1.5; /* extra halo needed to overpower the vineyard polygon pattern */\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'landuse_cemetery'][is_building = 'no'],\n [feature = 'amenity_grave_yard'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@cemetery, 50%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1.5; /* extra halo needed to overpower the cemetery polygon pattern */\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'landuse_residential'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@residential, 50%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'landuse_garages'][is_building = 'no'] {\n [zoom >= 13][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@garages, 50%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'landuse_field'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@field, 50%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'landuse_meadow'][is_building = 'no'],\n [feature = 'landuse_grass'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@grass, 50%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'landuse_allotments'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@allotments, 50%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'landuse_forest'][is_building = 'no'] {\n [zoom >= 8][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@forest, 30%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'landuse_farmyard'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@farmyard, 50%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n [feature = 'landuse_farm'][is_building = 'no'],\n [feature = 'landuse_farmland'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@farmland, 50%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'shop_mall'],\n [feature = 'landuse_retail'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@retail, 50%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'landuse_industrial'][is_building = 'no'],\n [feature = 'landuse_railway'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@industrial, 60%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'landuse_commercial'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@commercial, 60%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'landuse_brownfield'][is_building = 'no'],\n [feature = 'landuse_landfill'][is_building = 'no'],\n [feature = 'landuse_construction'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@construction, 50%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'natural_bay'][zoom >= 14] {\n text-name: \"[name]\";\n text-size: 10;\n text-fill: #6699cc;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n }\n\n [feature = 'natural_spring'][zoom >= 16] {\n text-name: \"[name]\";\n text-size: 10;\n text-fill: #6699cc;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n text-dy: 6;\n }\n\n [feature = 'tourism_alpine_hut'][zoom >= 15] {\n text-name: \"[name]\";\n text-size: 9;\n text-fill: #6699cc;\n text-dy: 11;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n [zoom >= 16] {\n ele/text-name: \"[ele]\";\n ele/text-size: 8;\n ele/text-fill: #6699cc;\n ele/text-dy: 23;\n ele/text-face-name: @oblique-fonts;\n ele/text-halo-radius: 1;\n ele/text-placement: interior;\n }\n }\n\n [feature = 'amenity_shelter'][zoom >= 17] {\n text-name: \"[name]\";\n text-size: 9;\n text-fill: #6699cc;\n text-dy: 11;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n ele/text-name: \"[ele]\";\n ele/text-size: 8;\n ele/text-fill: #6699cc;\n ele/text-dy: 23;\n ele/text-face-name: @oblique-fonts;\n ele/text-halo-radius: 1;\n ele/text-placement: interior;\n }\n\n [feature = 'amenity_bank'][zoom >= 17] {\n text-name: \"[name]\";\n text-size: 9;\n text-fill: black;\n text-dy: 12;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n text-face-name: @book-fonts;\n }\n\n [feature = 'tourism_hotel'],\n [feature = 'tourism_motel'],\n [feature = 'tourism_hostel'],\n [feature = 'tourism_chalet'] {\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: 10;\n text-fill: #0066ff;\n text-dy: 13;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n [feature = 'tourism_chalet'] {\n text-dy: 11;\n }\n }\n }\n\n [feature = 'amenity_embassy'][zoom >= 17] {\n text-name: \"[name]\";\n text-size: 9;\n text-fill: #0066ff;\n text-dy: 9;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n }\n\n [feature = 'tourism_guest_house'][zoom >= 17] {\n text-name: \"[name]\";\n text-size: 8;\n text-fill: #0066ff;\n text-dy: 10;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n }\n\n [feature = 'highway_bus_stop'],\n [feature = 'amenity_fuel'],\n [feature = 'amenity_bus_station'] {\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: 9;\n text-fill: @transportation-text;\n text-dy: 11;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n [feature = 'highway_bus_stop'] {\n text-dy: 9;\n }\n }\n }\n\n [feature = 'tourism_camp_site'][zoom >= 17] {\n text-name: \"[name]\";\n text-size: 10;\n text-fill: #0066ff;\n text-dy: 15;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n }\n\n [feature = 'tourism_caravan_site'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@campsite, 50%);\n text-dy: 15;\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'waterway_lock'][zoom >= 15] {\n text-name: \"[name]\";\n text-size: 9;\n text-dy: 10;\n text-fill: #0066ff;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n }\n\n [feature = 'leisure_marina'][zoom >= 15] {\n text-name: \"[name]\";\n text-size: 8;\n text-fill: @marina-text;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n [zoom >= 17] {\n text-size: 10;\n }\n }\n\n [feature = 'tourism_theme_park'][is_building = 'no'] {\n [zoom >= 13][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: @theme_park;\n text-face-name: @bold-fonts; /*rendered bold to improve visibility since theme parks tend to have crowded backgrounds*/\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'tourism_museum'][zoom >= 17] {\n text-name: \"[name]\";\n text-size: 10;\n text-dy: 11;\n text-fill: #734a08;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n }\n\n [feature = 'amenity_prison'][zoom >= 17] {\n text-name: \"[name]\";\n text-size: 10;\n text-fill: #734a08;\n text-dy: 16;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n }\n\n [feature = 'tourism_attraction'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: #660033;\n text-face-name: @book-fonts;\n text-halo-radius: 2;\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'amenity_university'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@school, 70%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'amenity_school'][is_building = 'no'],\n [feature = 'amenity_college'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@school, 70%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'amenity_kindergarten'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@school, 65%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'man_made_lighthouse'][zoom >= 15] {\n text-name: \"[name]\";\n text-size: 9;\n text-fill: #000033;\n text-dy: 16;\n text-face-name: @book-fonts;\n text-halo-radius: 2;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n }\n\n [feature = 'man_made_windmill'][zoom >= 17] {\n text-name: \"[name]\";\n text-size: 9;\n text-fill: #734a08;\n text-dy: 12;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n }\n\n [feature = 'amenity_hospital'][zoom >= 16] {\n text-name: \"[name]\";\n text-fill: #da0092;\n text-size: 8;\n text-dy: 10;\n text-face-name: @book-fonts;\n text-halo-radius: 2;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n }\n\n [feature = 'amenity_pharmacy'][zoom >= 17] {\n text-name: \"[name]\";\n text-size: 8;\n text-dy: 10;\n text-fill: #da0092;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n }\n\n [feature = 'shop_bakery'],\n [feature = 'shop_clothes'],\n [feature = 'shop_fashion'],\n [feature = 'shop_convenience'],\n [feature = 'shop_doityourself'],\n [feature = 'shop_hairdresser'],\n [feature = 'shop_butcher'],\n [feature = 'shop_car'],\n [feature = 'shop_car_repair'],\n [feature = 'shop_bicycle'],\n [feature = 'shop_florist'],\n [feature = 'shop_other']{\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: 10;\n text-dy: 12;\n text-fill: #939;\n text-face-name: @book-fonts;\n text-halo-radius: 1.5;\n text-halo-fill: rgba(255, 255, 255, 0.8);\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n }\n }\n\n [feature = 'shop_supermarket'],\n [feature = 'shop_department_store'] {\n [zoom >= 16] {\n text-name: \"[name]\";\n text-size: 10;\n text-dy: 12;\n text-fill: #939;\n text-face-name: @book-fonts;\n text-halo-radius: 1.5;\n text-halo-fill: rgba(255, 255, 255, 0.8);\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n }\n }\n\n [feature = 'military_danger_area'][is_building = 'no'] {\n [zoom >= 9][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@danger_area, 40%);\n text-face-name: @bold-fonts;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'landuse_military'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@military, 40%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'aeroway_gate'][zoom >= 17] {\n text-name: \"[ref]\";\n text-size: 10;\n text-fill: #aa66cc;\n text-face-name: @book-fonts;\n text-halo-radius: 1;\n text-wrap-width: @standard-wrap-width;\n text-placement: interior;\n }\n\n [feature = 'military_barracks'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@barracks, 40%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'tourism_zoo'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@zoo, 40%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'power_station'][is_building = 'no'][zoom >= 10],\n [feature = 'power_generator'][is_building = 'no'][zoom >= 10],\n [feature = 'power_sub_station'][is_building = 'no'][zoom >= 13],\n [feature = 'power_substation'][is_building = 'no'][zoom >= 13]{\n [way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@power, 40%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'natural_desert'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@desert, 40%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'natural_sand'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@sand, 50%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'natural_heath'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@heath, 40%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n\n [feature = 'natural_grassland'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@grassland, 60%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'natural_scrub'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@scrub, 60%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'aeroway_apron'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@apron, 60%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'natural_beach'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@beach, 60%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n text-placement: interior;\n }\n }\n\n [feature = 'highway_services'][is_building = 'no'],\n [feature = 'highway_rest_area'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@rest_area, 40%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n }\n }\n\n [feature = 'natural_glacier'][is_building = 'no'] {\n [zoom >= 10][way_pixels > 3000],\n [zoom >= 17] {\n text-name: \"[name]\";\n text-size: @landcover-font-size;\n [way_pixels > 12000] { text-size: @landcover-font-size-big; }\n [way_pixels > 48000] { text-size: @landcover-font-size-bigger; }\n text-fill: darken(@glacier, 40%);\n text-face-name: @landcover-face-name;\n text-halo-radius: 1;\n text-halo-fill: rgba(255,255,255,0.6);\n text-wrap-width: @landcover-wrap-width-size;\n [way_pixels > 12000] {text-wrap-width: @landcover-wrap-width-size-big; }\n [way_pixels > 48000] {text-wrap-width: @landcover-wrap-width-size-bigger; }\n }\n }\n\n [feature = 'aeroway_helipad'][zoom >= 16]::aeroway {\n text-name: \"[name]\";\n text-size: 8;\n text-fill: @airtransport;\n text-dy: -10;\n text-face-name: @bold-fonts;\n text-halo-radius: 1;\n text-placement: interior;\n text-wrap-width: 30;\n }\n\n [feature = 'aeroway_aerodrome'][zoom >= 10][zoom < 14]::aeroway {\n text-name: \"[name]\";\n text-size: 8;\n text-fill: darken(@airtransport, 15%);\n text-dy: -10;\n text-face-name: @oblique-fonts;\n text-halo-radius: 1;\n text-placement: interior;\n text-wrap-width: 30;\n }\n}\n" }, { "path": "src/test/resources/samples/langs/Ceylon/Foo.ceylon", "content": "\"Test function for Ceylon\"\nby (\"Enrique\")\nshared void test() {\n print(\"test\");\n}\n\n\"Test class for Ceylon\"\nshared class Test(name) satisfies Comparable {\n shared String name;\n shared actual String string = \"Test ``name``.\";\n\n shared actual Comparison compare(Test other) {\n return name<=>other.name;\n }\n}\n" }, { "path": "src/test/resources/samples/langs/Chapel/distributions.chpl", "content": "//\n// Distributions Primer\n//\n// This primer demonstrates uses of some of Chapel's standard\n// distributions. To use these distributions in a Chapel program,\n// the respective module must be used:\n//\nuse BlockDist, CyclicDist, BlockCycDist, ReplicatedDist;\nuse DimensionalDist2D, ReplicatedDim, BlockCycDim;\n\n//\n// For each distribution, we'll create a distributed domain and array\n// and then initialize it just to give a brief flavor of how the\n// distribution maps across locales. Running this example on 6\n// locales does a nice job of illustrating the distribution\n// characteristics.\n//\n// All of these distributions support options to map to a different\n// virtual locale grid than the one used by default (a\n// multidimensional factoring of the built-in Locales array), as well\n// as to control the amount of parallelism used in data parallel\n// loops. See the Standard Distributions chapter of the language spec\n// for more details.\n//\n\n//\n// Make the program size configurable from the command line.\n//\nconfig const n = 8;\n\n//\n// Declare a 2-dimensional domain Space that we will later use to\n// initialize the distributed domains.\n//\nconst Space = {1..n, 1..n};\n\n//\n// The Block distribution distributes a bounding box from\n// n-dimensional space across the target locale array viewed as an\n// n-dimensional virtual locale grid. The bounding box is blocked\n// into roughly equal portions across the locales. Note that domains\n// declared over a Block distribution can also store indices outside\n// of the bounding box; the bounding box is merely used to compute\n// the blocking of space.\n//\n// In this example, we declare a 2-dimensional Block-distributed\n// domain BlockSpace and a Block-distributed array BA declared over\n// the domain.\n//\nconst BlockSpace = Space dmapped Block(boundingBox=Space);\nvar BA: [BlockSpace] int;\n\n//\n// To illustrate how the index set is distributed across locales,\n// we'll use a forall loop to initialize each array element to the\n// locale ID that stores that index/element/iteration.\n//\nforall ba in BA do\n ba = here.id;\n\n//\n// The 'hasSingleLocalSubdomain' method on arrays will return true if the \n// index set for a locale can be represented by a single domain.\n//\nif !BA.hasSingleLocalSubdomain() then\n halt(\"For a Block distribution, the index set per locale should be \\\n represented by a single domain\");\n\n//\n// If the distribution's subdomains can be represented as single subdomain,\n// we can use the 'localSubdomain' method to get the index set for the \n// current locale.\n//\n// Below, we'll use the index set to confirm that the array elements have the \n// correct locale id.\n//\n\nfor L in Locales {\n on L {\n const indices = BA.localSubdomain();\n for i in indices {\n if BA[i] != L.id then\n halt(\"Error: incorrect locale id\");\n }\n }\n}\n\n\n//\n// Output the Block-distributed array to visually see how the elements\n// are partitioned across the locales.\n//\nwriteln(\"Block Array Index Map\");\nwriteln(BA);\nwriteln();\n\n//\n// Most of Chapel's standard distributions support an optional\n// targetLocales argument that permits you to pass in your own\n// array of locales to be targeted. In general, the targetLocales\n// argument should match the rank of the distribution. So for\n// example, to map a Block to a [numLocales x 1] view of the\n// locale set, one could do something like this:\n\n//\n// We start by creating our own array of the locale values. Here\n// we use the standard array reshape function for convenience,\n// but more generally, this array could be accessed/assigned like any\n// other.\n//\n\nvar MyLocaleView = {0..#numLocales, 1..1};\nvar MyLocales: [MyLocaleView] locale = reshape(Locales, MyLocaleView);\n\n//\n// Then we'll declare a distributed domain/array that targets\n// this view of the locales:\n// \n\nconst BlockSpace2 = Space dmapped Block(boundingBox=Space,\n targetLocales=MyLocales);\nvar BA2: [BlockSpace2] int;\n\n//\n// Then we'll do a similar computation as before to verify where\n// everything ended up:\n//\nforall ba in BA2 do\n ba = here.id;\n\nwriteln(\"Block Array Index Map\");\nwriteln(BA2);\nwriteln();\n\n//\n// We can use the 'targetLocales' method available on an array to get the\n// locales array used as targets.\n//\nfor (L, ML) in zip(BA2.targetLocales(), MyLocales) do\n if L != ML then\n halt(\"Error: BA2.targetLocales() should equal MyLocales\");\n\n\n\n//\n// Next, we'll perform a similar computation for the Cyclic distribution.\n// Cyclic distributions start at a designated n-dimensional index and\n// distribute the n-dimensional space across an n-dimensional array\n// of locales in a round-robin fashion (in each dimension). As with\n// the Block distribution, domains may be declared using the\n// distribution who have lower indices that the starting index; that\n// value should just be considered a parameterization of how the\n// distribution is defined.\n//\nconst CyclicSpace = Space dmapped Cyclic(startIdx=Space.low);\nvar CA: [CyclicSpace] int;\n\nforall ca in CA do\n ca = here.id;\n\nwriteln(\"Cyclic Array Index Map\");\nwriteln(CA);\nwriteln();\n\n//\n// The domain returned by 'localSubdomain' need not be a dense block, as is\n// the case for the Cyclic Distribution.\n//\non Locales[0] {\n const indices = CA.localSubdomain();\n for i in indices {\n if CA[i] != 0 then\n halt(\"Error: Cyclic array values on Locale 0 should be zero\");\n }\n}\n\n\n//\n// Next, we'll declare a Block-Cyclic distribution. These\n// distributions also deal out indices in a round-robin fashion,\n// but rather than dealing out singleton indices, they deal out blocks\n// of indices. Thus, the BlockCyclic distribution is parameterized\n// by a starting index (as with Cyclic) and a block size (per\n// dimension) specifying how large the chunks to be dealt out are.\n//\nconst BlkCycSpace = Space dmapped BlockCyclic(startIdx=Space.low, \n blocksize=(2, 3));\nvar BCA: [BlkCycSpace] int;\n\nforall bca in BCA do\n bca = here.id;\n\nwriteln(\"Block-Cyclic Array Index Map\");\nwriteln(BCA);\nwriteln();\n\n//\n// A locale's index set for a Block-Cyclic distribution cannot be represented\n// by a single subdomain.\n//\nif BCA.hasSingleLocalSubdomain() then\n halt(\"A Block-Cyclic index set cannot be represented by a single subdomain\");\n\n//\n// If the local index set cannot be represented by a single subdomain, \n// we can use the 'localSubdomains' iterator to yield a number of domains\n// that represent the whole index set.\n//\n// Let's write a function that will use 'localSubdomains' to verify the \n// correctness of the array values.\n//\n\nproc verifyID(Data: []) {\n for L in Locales {\n on L {\n for indices in Data.localSubdomains() {\n for i in indices {\n if Data[i] != L.id then\n halt(\"Error: incorrect locale id\");\n }\n }\n }\n }\n}\nverifyID(BCA);\n\n//\n// The 'localSubdomains' iterator is also available on distributions that\n// can represent a locale's index set with a single domain. This allows us to\n// write more general code that will work for all distributions.\n//\n// This means that we can call the 'verifyID' function on any array, like the\n// 'BA' array from earlier.\n//\nverifyID(BA);\n\n\n//\n// The ReplicatedDist distribution is different: each of the\n// original domain's indices - and the corresponding array elements -\n// is replicated onto each locale. (Note: consistency among these\n// array replicands is NOT maintained automatically.)\n//\n// This replication is observable in some cases but not others,\n// as shown below. Note: this behavior may change in the future.\n//\nconst ReplicatedSpace = Space dmapped ReplicatedDist();\nvar RA: [ReplicatedSpace] int;\n\n// The replication is observable - this visits each replicand.\nforall ra in RA do\n ra = here.id;\n\nwriteln(\"Replicated Array Index Map, \", RA.numElements, \" elements total\");\nwriteln(RA);\nwriteln();\n\n//\n// The replication is observable when the replicated array is\n// on the left-hand side. If the right-hand side is not replicated,\n// it is copied into each replicand.\n// We illustrate this using a non-distributed array.\n//\nvar A: [Space] int = [(i,j) in Space] i*100 + j;\nRA = A;\nwriteln(\"Replicated Array after being array-assigned into\");\nwriteln(RA);\nwriteln();\n\n//\n// Analogously, each replicand will be visited and\n// other participated expressions will be computed on each locale\n// (a) when the replicated array is assigned a scalar:\n// RA = 5;\n// (b) when it appears first in a zippered forall loop:\n// forall (ra, a) in zip(RA, A) do ...;\n// (c) when it appears in a for loop:\n// for ra in RA do ...;\n//\n// Zippering (RA,A) or (A,RA) in a 'for' loop will generate\n// an error due to their different number of elements.\n\n// Let RA store the Index Map again, for the examples below.\nforall ra in RA do\n ra = here.id;\n\n//\n// Only the local replicand is accessed - replication is NOT observable\n// and consistency is NOT maintained - when:\n// (a) the replicated array is indexed - an individual element is read...\n//\non Locales(0) do\n writeln(\"on \", here, \": \", RA(Space.low));\non Locales(LocaleSpace.high) do\n writeln(\"on \", here, \": \", RA(Space.low));\nwriteln();\n\n// ...or an individual element is written;\non Locales(LocaleSpace.high) do\n RA(Space.low) = 7777;\n\nwriteln(\"Replicated Array after being indexed into\");\nwriteln(RA);\nwriteln();\n\n//\n// (b) the replicated array is on the right-hand side of an assignment...\n//\non Locales(LocaleSpace.high) do\n A = RA + 4;\nwriteln(\"Non-Replicated Array after assignment from Replicated Array + 4\");\nwriteln(A);\nwriteln();\n\n//\n// (c) ...or, generally, the replicated array or domain participates\n// in a zippered forall loop, but not in the first position.\n// The loop could look like:\n//\n// forall (a, (i,j), ra) in (A, ReplicatedSpace, RA) do ...;\n//\n\n\n//\n// The DimensionalDist2D distribution lets us build a 2D distribution\n// as a composition of specifiers for individual dimensions.\n// Under such a \"dimensional\" distribution each dimension is handled\n// independently of the other.\n//\n// The dimension specifiers are similar to the corresponding multi-dimensional\n// distributions in constructor arguments and index-to-locale mapping rules.\n// However, instead of an array of locales, a specifier constructor\n// accepts just the number of locales that the indices in the corresponding\n// dimension will be distributed across.\n//\n// The DimensionalDist2D constructor requires:\n// * an [0..nl1-1, 0..nl2-1] array of locales, where\n// nl1 and nl2 are the number of locales in each dimension, and\n// * two dimension specifiers, created for nl1 and nl2 locale counts, resp.\n//\n// Presently, the following dimension specifiers are available\n// (shown here with their constructor arguments):\n//\n// * ReplicatedDim(numLocales)\n// * BlockDim(numLocales, boundingBoxLow, boundingBoxHigh)\n// * BlockCyclicDim(lowIdx, blockSize, numLocales)\n//\n\n//\n// The following example creates a dimensional distribution that\n// replicates over 2 locales (when available) in the first dimemsion\n// and distributes using block-cyclic distribution in the second dimension.\n// The example computes nl1 and nl2 and reshapes MyLocales correspondingly.\n//\n\nvar (nl1, nl2) = if numLocales == 1 then (1, 1) else (2, numLocales/2);\nMyLocaleView = {0..#nl1, 0..#nl2};\nMyLocales = reshape(Locales[0..#nl1*nl2], MyLocaleView);\n\nconst DimReplicatedBlockcyclicSpace = Space\n dmapped DimensionalDist2D(MyLocales,\n new ReplicatedDim(numLocales = nl1),\n new BlockCyclicDim(numLocales = nl2,\n lowIdx = 1, blockSize = 2));\n\nvar DRBA: [DimReplicatedBlockcyclicSpace] int;\n\n// The ReplicatedDim specifier always accesses the local replicand.\n// (This differs from how the ReplicatedDist distribution works.)\n//\n// This example visits each replicand. The behavior is the same\n// regardless of the second index into MyLocales below.\n\nfor locId1 in 0..#nl1 do on MyLocales[locId1, 0] {\n\n forall drba in DRBA do\n drba = here.id;\n\n writeln(\"Dimensional2D(Replicated,BlockCyclic) Array Index Map\",\n \" from \", here);\n\n // Technicality: 'writeln(DRBA)' would read DRBA always on Locale 0.\n // Since we want to see what DRBA contains on the current locale,\n // we use 'Helper' that is mapped using the default distribution.\n // 'Helper = DRBA' captures the view of DRBA on the current locale,\n // which we then print out.\n\n const Helper: [Space] int = DRBA;\n writeln(Helper);\n writeln();\n\n}\n" }, { "path": "src/test/resources/samples/langs/Chapel/hello.chpl", "content": "writeln(\"Hello, world!\"); // print 'Hello, world!' to the console\n" }, { "path": "src/test/resources/samples/langs/Chapel/lulesh.chpl", "content": "/*\n Derived from the DARPA/Livermore Unstructured Lagrangian Explicit\n Shock Hydrodynamics (LULESH)\n https://computation.llnl.gov/casc/ShockHydro/\n\n Original port to Chapel by Brandon Holt (8/2011). Further\n improvements for the sake of performance and/or generality made by\n Sung-Eun Choi (12/2011, 11/2012), Jeff Keasler (3/2012), and Brad\n Chamberlain (3-4,9-11/2012, 2/2013).\n\n\n Notes on the Initial Implementation\n -----------------------------------\n \n This implementation was designed to mirror the overall structure of\n the C++ Lulesh but use Chapel constructs where they can help make\n the code more readable, easier to maintain, or more\n 'elegant'. Function names are preserved for the most part, with some\n additional helper functions, and original comments from the C++ code\n are interspersed approximately where they belong to give an idea of\n how the two codes line up. One major difference for this Chapel\n version is the use of a number of module-level variables and\n constants.\n\n\n Status:\n\n This code remains a work-in-progress as we gain further experience\n with it. Proposed improvements are noted in the README in this\n directory and (in some cases) in TODO comments in the code.\n\n */\n\n\n\nuse Time, // to get timing routines for benchmarking\n BlockDist; // for block-distributed arrays\n\nuse luleshInit; // initialization code for data set\n\n/* The configuration parameters for lulesh. These can be set on the\n compiler command line using -s=. For example,\n\n chpl -suseBlockDist=true\n\n useBlockDist : says whether or not to block-distribute the arrays.\n The default is based on the value of CHPL_COMM, as\n an indication of whether this is a single- or multi-\n locale execution.\n\n use3DRepresentation : indicates whether the element node arrays\n should be stored using a 3D representation\n (limiting the execution to cube inputs) or\n the more general 1D representation (supporting\n arbitrary data sets).\n\n useSparseMaterials : indicates whether sparse domains/arrays should be\n used to represent the materials. Sparse domains\n are more realistic in that they permit an arbitrary\n subset of the problem space to store a material.\n Dense domains are sufficient for LULESH since there's\n an assumption that the material spans all cells.\n\n printWarnings : prints performance-oriented warnings to prevent\n surprises.\n*/\n \nconfig param useBlockDist = (CHPL_COMM != \"none\"),\n use3DRepresentation = false,\n useSparseMaterials = true,\n printWarnings = true;\n\n\n//\n// Sanity check to ensure that input files aren't used with the 3D\n// representation\n//\nif (use3DRepresentation && (luleshInit.filename != \"\")) then\n halt(\"The 3D representation does not support reading input from files\");\n\n\n/* Configuration constants: Override defaults on executable's command-line */\n\nconfig const initialEnergy = 3.948746e+7; // initial energy value\n\n\nconfig const showProgress = false, // print time and dt values on each step\n debug = false, // print various debug info\n doTiming = true, // time the main timestep loop\n printCoords = true; // print the final computed coordinates\n\n\n/* Compile-time constants */\n\nparam XI_M = 0x003,\n XI_M_SYMM = 0x001,\n XI_M_FREE = 0x002,\n\n XI_P = 0x00c,\n XI_P_SYMM = 0x004,\n XI_P_FREE = 0x008,\n\n ETA_M = 0x030,\n ETA_M_SYMM = 0x010,\n ETA_M_FREE = 0x020,\n\n ETA_P = 0x0c0,\n ETA_P_SYMM = 0x040,\n ETA_P_FREE = 0x080,\n\n ZETA_M = 0x300,\n ZETA_M_SYMM = 0x100,\n ZETA_M_FREE = 0x200,\n\n ZETA_P = 0xc00,\n ZETA_P_SYMM = 0x400,\n ZETA_P_FREE = 0x800;\n\n\n/* Set up the problem size */\n\nconst (numElems, numNodes) = initProblemSize();\n\n\n/* Declare abstract problem domains */\n\nconst ElemSpace = if use3DRepresentation\n then {0..#elemsPerEdge, 0..#elemsPerEdge, 0..#elemsPerEdge}\n else {0..#numElems},\n NodeSpace = if use3DRepresentation\n then {0..#nodesPerEdge, 0..#nodesPerEdge, 0..#nodesPerEdge}\n else {0..#numNodes};\n\n\n/* Declare the (potentially distributed) problem domains */\n\nconst Elems = if useBlockDist then ElemSpace dmapped Block(ElemSpace)\n else ElemSpace,\n Nodes = if useBlockDist then NodeSpace dmapped Block(NodeSpace)\n else NodeSpace;\n\n\n/* The coordinates */\n\nvar x, y, z: [Nodes] real;\n \n\n/* The number of nodes per element. In a rank-independent version,\n this could be written 2**rank */\n\nparam nodesPerElem = 8;\n\n \n// We could name this, but chose not to since it doesn't add that much clarity\n//\n// const elemNeighbors = 1..nodesPerElem;\n\n\n/* The element-to-node mapping */\n\nvar elemToNode: [Elems] nodesPerElem*index(Nodes);\n\n\n/* the Greek variables */\n\nvar lxim, lxip, letam, letap, lzetam, lzetap: [Elems] index(Elems);\n\n\n/* the X, Y, Z Symmetry values */\n\nvar XSym, YSym, ZSym: sparse subdomain(Nodes);\n\n\n\n/* Constants */\n\nconst u_cut = 1.0e-7, /* velocity tolerance */\n hgcoef = 3.0, /* hourglass control */\n qstop = 1.0e+12, /* excessive q indicator */\n monoq_max_slope = 1.0,\n monoq_limiter_mult = 2.0,\n e_cut = 1.0e-7, /* energy tolerance */\n p_cut = 1.0e-7, /* pressure tolerance */\n ss4o3 = 4.0/3.0,\n q_cut = 1.0e-7, /* q tolerance */\n v_cut = 1.0e-10, /* relative volume tolerance */\n qlc_monoq = 0.5, /* linear term coef for q */\n qqc_monoq = 2.0/3.0, /* quadratic term coef for q */\n qqc = 2.0, \n qqc2 = 64.0 * qqc**2,\n eosvmax = 1.0e+9,\n eosvmin = 1.0e-9,\n pmin = 0.0, /* pressure floor */\n emin = -1.0e+15, /* energy floor */\n dvovmax = 0.1, /* maximum allowable volume change */\n refdens = 1.0, /* reference density */\n\n deltatimemultlb = 1.1,\n deltatimemultub = 1.2,\n dtmax = 1.0e-2; /* maximum allowable time increment */\n\n \nconfig const stoptime = 1.0e-2, /* end time for simulation */\n maxcycles = max(int), /* max number of cycles to simulate */\n dtfixed = -1.0e-7; /* fixed time increment */\n\n\n/* The list of material elements */\n\nconst MatElems: MatElemsType = if useSparseMaterials then enumerateMatElems()\n else Elems;\n\n\nproc MatElemsType type {\n if useSparseMaterials {\n if (printWarnings && useBlockDist && numLocales > 1) then\n writeln(\"WARNING: The LULESH Material Elements (MatElems) are not yet\\n\",\n \" distributed, so result in excessive memory use on,\\n\",\n \" and communication with, locale 0\\n\");\n return sparse subdomain(Elems);\n } else\n return Elems.type;\n}\n\niter enumerateMatElems() {\n if (printWarnings && useBlockDist && numLocales > 1) then\n writeln(\"WARNING: generation of matrix elements is serial and\\n\",\n \" unlikely to scale\");\n for i in Elems do\n yield i;\n}\n\n\n/* Element fields */\n\nvar elemBC: [Elems] int,\n\n e: [Elems] real, // energy\n p: [Elems] real, // pressure\n\n q: [Elems] real, // q\n ql: [Elems] real, // linear term for q\n qq: [Elems] real, // quadratic term for q\n\n v: [Elems] real = 1.0, //relative volume\n vnew: [Elems] real,\n\n volo: [Elems] real, // reference volume\n delv: [Elems] real, // m_vnew - m_v\n vdov: [Elems] real, // volume derivative over volume\n\n arealg: [Elems] real, // elem characteristic length\n\n ss: [Elems] real, // \"sound speed\"\n\n elemMass: [Elems] real; // mass\n\n\n/* Nodal fields */\n\nvar xd, yd, zd: [Nodes] real, // velocities\n\n xdd, ydd, zdd: [Nodes] real, // acceleration\n\n fx, fy, fz: [Nodes] atomic real, // forces\n\n nodalMass: [Nodes] real; // mass\n\n\n/* Parameters */\n\nvar time = 0.0, // current time\n deltatime = 1.0e-7, // variable time increment\n dtcourant = 1.0e20, // courant constraint\n dthydro = 1.0e20, // volume change constraint\n\n cycle = 0; // iteration count for simulation\n\n\nproc main() {\n if debug then writeln(\"Lulesh -- Problem Size = \", numElems);\n\n initLulesh();\n\n var st: real;\n if doTiming then st = getCurrentTime();\n while (time < stoptime && cycle < maxcycles) {\n const iterTime = if showProgress then getCurrentTime() else 0.0;\n\n TimeIncrement();\n\n LagrangeLeapFrog();\n\n if debug {\n deprintatomic(\"[[ Forces ]]\", fx, fy, fz);\n deprint(\"[[ Positions ]]\", x, y, z);\n deprint(\"[[ p, e, q ]]\", p, e, q);\n }\n if showProgress then\n writef(\"time = %er, dt=%er, %s\", time, deltatime,\n if doTiming then \", elapsed = \" + (getCurrentTime()-iterTime) +\"\\n\"\n else \"\\n\");\n }\n if (cycle == maxcycles) {\n writeln(\"Stopped early due to reaching maxnumsteps\");\n }\n if doTiming {\n const et = getCurrentTime();\n writeln(\"Total Time: \", et-st);\n writeln(\"Time/Cycle: \", (et-st)/cycle);\n }\n writeln(\"Number of cycles: \", cycle);\n\n if printCoords {\n var outfile = open(\"coords.out\", iomode.cw);\n var writer = outfile.writer();\n var fmtstr = if debug then \"%1.9re %1.9er %1.9er\\n\" \n else \"%1.4er %1.4er %1.4er\\n\";\n for i in Nodes do\n writer.writef(fmtstr, x[i], y[i], z[i]);\n writer.close();\n outfile.close();\n }\n}\n\n\n/* Initialization functions */\n\nproc initLulesh() {\n // initialize the coordinates\n initCoordinates(x,y,z);\n\n // initialize the element to node mapping\n initElemToNodeMapping(elemToNode);\n\n // initialize the greek symbols\n initGreekVars(lxim, lxip, letam, letap, lzetam, lzetap);\n\n // initialize the symmetry plane locations\n initXSyms(XSym);\n initYSyms(YSym);\n initZSyms(ZSym);\n\n /* embed hexehedral elements in nodal point lattice */\n //calculated on the fly using: elemToNodes(i: index(Elems)): index(Nodes)\n\n // initialize the masses\n initMasses();\n\n // initialize the boundary conditions\n const octantCorner = initBoundaryConditions();\n\n // deposit the energy for Sedov Problem\n e[octantCorner] = initialEnergy;\n}\n\n\nproc initMasses() {\n // This is a temporary array used to accumulate masses in parallel\n // without losing updates by using 'atomic' variables\n var massAccum: [Nodes] atomic real;\n\n forall eli in Elems {\n var x_local, y_local, z_local: 8*real;\n localizeNeighborNodes(eli, x, x_local, y, y_local, z, z_local);\n\n const volume = CalcElemVolume(x_local, y_local, z_local);\n volo[eli] = volume;\n elemMass[eli] = volume;\n\n for neighbor in elemToNodes[eli] do\n massAccum[neighbor].add(volume);\n }\n\n // When we're done, copy the accumulated masses into nodalMass, at\n // which point the massAccum array can go away (and will at the\n // procedure's return\n\n forall i in Nodes do\n nodalMass[i] = massAccum[i].read() / 8.0;\n\n if debug {\n writeln(\"ElemMass:\");\n for mass in elemMass do writeln(mass);\n\n writeln(\"NodalMass:\");\n for mass in nodalMass do writeln(mass);\n }\n}\n\n\nproc initBoundaryConditions() {\n var surfaceNode: [Nodes] int;\n\n forall n in XSym do\n surfaceNode[n] = 1;\n forall n in YSym do\n surfaceNode[n] = 1;\n forall n in ZSym do\n surfaceNode[n] = 1;\n\n forall e in Elems do {\n var mask: int;\n for i in 1..nodesPerElem do\n mask += surfaceNode[elemToNode[e][i]] << (i-1);\n\n // TODO: make an inlined function for this little idiom? (and below)\n\n if ((mask & 0x0f) == 0x0f) then elemBC[e] |= ZETA_M_SYMM;\n if ((mask & 0xf0) == 0xf0) then elemBC[e] |= ZETA_P_SYMM;\n if ((mask & 0x33) == 0x33) then elemBC[e] |= ETA_M_SYMM;\n if ((mask & 0xcc) == 0xcc) then elemBC[e] |= ETA_P_SYMM;\n if ((mask & 0x99) == 0x99) then elemBC[e] |= XI_M_SYMM;\n if ((mask & 0x66) == 0x66) then elemBC[e] |= XI_P_SYMM;\n }\n\n\n //\n // We find the octant corner by looking for the element with\n // all three SYMM flags set, which will have the largest\n // integral value. Thus, we can use a maxloc to identify it.\n //\n const (check, loc) = maxloc reduce zip(elemBC, Elems);\n\n if debug then writeln(\"Found the octant corner at: \", loc);\n\n if (check != (XI_M_SYMM | ETA_M_SYMM | ZETA_M_SYMM)) then\n halt(\"maxloc got a value of \", check, \" at loc \", loc);\n\n // TODO: This is an example of an array that, in a distributed\n // memory code, would typically be completely local and only storing\n // the local nodes owned by the locale -- noting that some nodes\n // are logically owned by multiple locales and therefore would \n // redundantly be stored in both locales' surfaceNode arrays -- it's\n // essentially local scratchspace that does not need to be communicated\n // or kept coherent across locales.\n //\n\n surfaceNode = 0;\n\n /* the free surfaces */\n\n var freeSurface: sparse subdomain(Nodes);\n\n // initialize the free surface\n initFreeSurface(freeSurface);\n\n forall n in freeSurface do\n surfaceNode[n] = 1;\n\n forall e in Elems do {\n var mask: int;\n for i in 1..nodesPerElem do\n mask += surfaceNode[elemToNode[e][i]] << (i-1);\n\n if ((mask & 0x0f) == 0x0f) then elemBC[e] |= ZETA_M_FREE;\n if ((mask & 0xf0) == 0xf0) then elemBC[e] |= ZETA_P_FREE;\n if ((mask & 0x33) == 0x33) then elemBC[e] |= ETA_M_FREE;\n if ((mask & 0xcc) == 0xcc) then elemBC[e] |= ETA_P_FREE;\n if ((mask & 0x99) == 0x99) then elemBC[e] |= XI_M_FREE;\n if ((mask & 0x66) == 0x66) then elemBC[e] |= XI_P_FREE;\n }\n\n if debug {\n writeln(\"elemBC:\");\n for b in elemBC do writeln(b);\n }\n\n return loc;\n}\n\n\n/* Helper functions */\n\ninline proc localizeNeighborNodes(eli: index(Elems),\n x: [] real, ref x_local: 8*real,\n y: [] real, ref y_local: 8*real,\n z: [] real, ref z_local: 8*real) {\n\n for i in 1..nodesPerElem {\n const noi = elemToNode[eli][i];\n\n x_local[i] = x[noi];\n y_local[i] = y[noi];\n z_local[i] = z[noi];\n }\n}\n\ninline proc TripleProduct(x1, y1, z1, x2, y2, z2, x3, y3, z3) {\n return x1*(y2*z3 - z2*y3) + x2*(z1*y3 - y1*z3) + x3*(y1*z2 - z1*y2);\n}\n\n\nproc CalcElemVolume(x, y, z) {\n const dx61 = x[7] - x[2],\n dy61 = y[7] - y[2],\n dz61 = z[7] - z[2],\n\n dx70 = x[8] - x[1],\n dy70 = y[8] - y[1],\n dz70 = z[8] - z[1],\n\n dx63 = x[7] - x[4],\n dy63 = y[7] - y[4],\n dz63 = z[7] - z[4],\n\n dx20 = x[3] - x[1],\n dy20 = y[3] - y[1],\n dz20 = z[3] - z[1],\n\n dx50 = x[6] - x[1],\n dy50 = y[6] - y[1],\n dz50 = z[6] - z[1],\n\n dx64 = x[7] - x[5],\n dy64 = y[7] - y[5],\n dz64 = z[7] - z[5],\n\n dx31 = x[4] - x[2],\n dy31 = y[4] - y[2],\n dz31 = z[4] - z[2],\n\n dx72 = x[8] - x[3],\n dy72 = y[8] - y[3],\n dz72 = z[8] - z[3],\n\n dx43 = x[5] - x[4],\n dy43 = y[5] - y[4],\n dz43 = z[5] - z[4],\n\n dx57 = x[6] - x[8],\n dy57 = y[6] - y[8],\n dz57 = z[6] - z[8],\n\n dx14 = x[2] - x[5],\n dy14 = y[2] - y[5],\n dz14 = z[2] - z[5],\n\n dx25 = x[3] - x[6],\n dy25 = y[3] - y[6],\n dz25 = z[3] - z[6];\n\n const volume = TripleProduct(dx31 + dx72, dx63, dx20,\n dy31 + dy72, dy63, dy20,\n dz31 + dz72, dz63, dz20) +\n TripleProduct(dx43 + dx57, dx64, dx70,\n dy43 + dy57, dy64, dy70,\n dz43 + dz57, dz64, dz70) +\n TripleProduct(dx14 + dx25, dx61, dx50,\n dy14 + dy25, dy61, dy50,\n dz14 + dz25, dz61, dz50);\n\n return volume / 12.0;\n}\n\nproc InitStressTermsForElems(p, q, sigxx, sigyy, sigzz: [?D] real) {\n forall i in D {\n sigxx[i] = -p[i] - q[i];\n sigyy[i] = -p[i] - q[i];\n sigzz[i] = -p[i] - q[i];\n }\n}\n\n\nproc CalcElemShapeFunctionDerivatives(x: 8*real, y: 8*real, z: 8*real, \n ref b_x: 8*real,\n ref b_y: 8*real,\n ref b_z: 8*real, \n ref volume: real) {\n\n const fjxxi = .125 * ((x[7]-x[1]) + (x[6]-x[4]) - (x[8]-x[2]) - (x[5]-x[3])),\n fjxet = .125 * ((x[7]-x[1]) - (x[6]-x[4]) + (x[8]-x[2]) - (x[5]-x[3])),\n fjxze = .125 * ((x[7]-x[1]) + (x[6]-x[4]) + (x[8]-x[2]) + (x[5]-x[3])),\n\n fjyxi = .125 * ((y[7]-y[1]) + (y[6]-y[4]) - (y[8]-y[2]) - (y[5]-y[3])),\n fjyet = .125 * ((y[7]-y[1]) - (y[6]-y[4]) + (y[8]-y[2]) - (y[5]-y[3])),\n fjyze = .125 * ((y[7]-y[1]) + (y[6]-y[4]) + (y[8]-y[2]) + (y[5]-y[3])),\n\n fjzxi = .125 * ((z[7]-z[1]) + (z[6]-z[4]) - (z[8]-z[2]) - (z[5]-z[3])),\n fjzet = .125 * ((z[7]-z[1]) - (z[6]-z[4]) + (z[8]-z[2]) - (z[5]-z[3])),\n fjzze = .125 * ((z[7]-z[1]) + (z[6]-z[4]) + (z[8]-z[2]) + (z[5]-z[3]));\n\n /* compute cofactors */\n const cjxxi = (fjyet * fjzze) - (fjzet * fjyze),\n cjxet = - (fjyxi * fjzze) + (fjzxi * fjyze),\n cjxze = (fjyxi * fjzet) - (fjzxi * fjyet),\n\n cjyxi = - (fjxet * fjzze) + (fjzet * fjxze),\n cjyet = (fjxxi * fjzze) - (fjzxi * fjxze),\n cjyze = - (fjxxi * fjzet) + (fjzxi * fjxet),\n\n cjzxi = (fjxet * fjyze) - (fjyet * fjxze),\n cjzet = - (fjxxi * fjyze) + (fjyxi * fjxze),\n cjzze = (fjxxi * fjyet) - (fjyxi * fjxet);\n\n /* calculate partials :\n this need only be done for l = 0,1,2,3 since , by symmetry ,\n (6,7,4,5) = - (0,1,2,3) .\n */\n b_x[1] = - cjxxi - cjxet - cjxze;\n b_x[2] = cjxxi - cjxet - cjxze;\n b_x[3] = cjxxi + cjxet - cjxze;\n b_x[4] = - cjxxi + cjxet - cjxze;\n b_x[5] = -b_x[3];\n b_x[6] = -b_x[4];\n b_x[7] = -b_x[1];\n b_x[8] = -b_x[2];\n\n b_y[1] = - cjyxi - cjyet - cjyze;\n b_y[2] = cjyxi - cjyet - cjyze;\n b_y[3] = cjyxi + cjyet - cjyze;\n b_y[4] = - cjyxi + cjyet - cjyze;\n b_y[5] = -b_y[3];\n b_y[6] = -b_y[4];\n b_y[7] = -b_y[1];\n b_y[8] = -b_y[2];\n\n b_z[1] = - cjzxi - cjzet - cjzze;\n b_z[2] = cjzxi - cjzet - cjzze;\n b_z[3] = cjzxi + cjzet - cjzze;\n b_z[4] = - cjzxi + cjzet - cjzze;\n b_z[5] = -b_z[3];\n b_z[6] = -b_z[4];\n b_z[7] = -b_z[1];\n b_z[8] = -b_z[2];\n\n /* calculate jacobian determinant (volume) */\n volume = 8.0 * ( fjxet * cjxet + fjyet * cjyet + fjzet * cjzet);\n}\n\n\nproc CalcElemNodeNormals(ref pfx: 8*real, ref pfy: 8*real, ref pfz: 8*real, \n x: 8*real, y: 8*real, z: 8*real) {\n\n proc ElemFaceNormal(param n1, param n2, param n3, param n4) {\n const bisectX0 = 0.5 * (x[n4] + x[n3] - x[n2] - x[n1]),\n bisectY0 = 0.5 * (y[n4] + y[n3] - y[n2] - y[n1]),\n bisectZ0 = 0.5 * (z[n4] + z[n3] - z[n2] - z[n1]),\n bisectX1 = 0.5 * (x[n3] + x[n2] - x[n4] - x[n1]),\n bisectY1 = 0.5 * (y[n3] + y[n2] - y[n4] - y[n1]),\n bisectZ1 = 0.5 * (z[n3] + z[n2] - z[n4] - z[n1]),\n areaX = 0.25 * (bisectY0 * bisectZ1 - bisectZ0 * bisectY1),\n areaY = 0.25 * (bisectZ0 * bisectX1 - bisectX0 * bisectZ1),\n areaZ = 0.25 * (bisectX0 * bisectY1 - bisectY0 * bisectX1);\n\n var rx, ry, rz: 8*real; //results\n\n (rx[n1], rx[n2], rx[n3], rx[n4]) = (areaX, areaX, areaX, areaX);\n (ry[n1], ry[n2], ry[n3], ry[n4]) = (areaY, areaY, areaY, areaY);\n (rz[n1], rz[n2], rz[n3], rz[n4]) = (areaZ, areaZ, areaZ, areaZ);\n\n return (rx, ry, rz);\n }\n\n // calculate total normal from each face (faces are made up of\n // combinations of nodes)\n\n (pfx, pfy, pfz) = ElemFaceNormal(1,2,3,4) + ElemFaceNormal(1,5,6,2) +\n ElemFaceNormal(2,6,7,3) + ElemFaceNormal(3,7,8,4) +\n ElemFaceNormal(4,8,5,1) + ElemFaceNormal(5,8,7,6);\n}\n\n\nproc SumElemStressesToNodeForces(b_x: 8*real, b_y: 8*real, b_z: 8*real, \n stress_xx:real,\n stress_yy:real,\n stress_zz: real, \n ref fx: 8*real,\n ref fy: 8*real,\n ref fz: 8*real) {\n for i in 1..8 {\n fx[i] = -(stress_xx * b_x[i]);\n fy[i] = -(stress_yy * b_y[i]);\n fz[i] = -(stress_zz * b_z[i]);\n }\n}\n\nproc CalcElemVolumeDerivative(x: 8*real, y: 8*real, z: 8*real) {\n\n proc VoluDer(param n0, param n1, param n2, param n3, param n4, param n5) {\n const ox = (y[n1] + y[n2]) * (z[n0] + z[n1]) \n - (y[n0] + y[n1]) * (z[n1] + z[n2])\n + (y[n0] + y[n4]) * (z[n3] + z[n4]) \n - (y[n3] + y[n4]) * (z[n0] + z[n4])\n - (y[n2] + y[n5]) * (z[n3] + z[n5])\n + (y[n3] + y[n5]) * (z[n2] + z[n5]),\n oy = - (x[n1] + x[n2]) * (z[n0] + z[n1])\n + (x[n0] + x[n1]) * (z[n1] + z[n2])\n - (x[n0] + x[n4]) * (z[n3] + z[n4])\n + (x[n3] + x[n4]) * (z[n0] + z[n4])\n + (x[n2] + x[n5]) * (z[n3] + z[n5])\n - (x[n3] + x[n5]) * (z[n2] + z[n5]),\n oz = - (y[n1] + y[n2]) * (x[n0] + x[n1])\n + (y[n0] + y[n1]) * (x[n1] + x[n2])\n - (y[n0] + y[n4]) * (x[n3] + x[n4])\n + (y[n3] + y[n4]) * (x[n0] + x[n4])\n + (y[n2] + y[n5]) * (x[n3] + x[n5])\n - (y[n3] + y[n5]) * (x[n2] + x[n5]);\n\n return (ox/12.0, oy/12.0, oz/12.0);\n }\n\n var dvdx, dvdy, dvdz: 8*real;\n\n (dvdx[1], dvdy[1], dvdz[1]) = VoluDer(2,3,4,5,6,8);\n (dvdx[4], dvdy[4], dvdz[4]) = VoluDer(1,2,3,8,5,7);\n (dvdx[3], dvdy[3], dvdz[3]) = VoluDer(4,1,2,7,8,6);\n (dvdx[2], dvdy[2], dvdz[2]) = VoluDer(3,4,1,6,7,5);\n (dvdx[5], dvdy[5], dvdz[5]) = VoluDer(8,7,6,1,4,2);\n (dvdx[6], dvdy[6], dvdz[6]) = VoluDer(5,8,7,2,1,3);\n (dvdx[7], dvdy[7], dvdz[7]) = VoluDer(6,5,8,3,2,4);\n (dvdx[8], dvdy[8], dvdz[8]) = VoluDer(7,6,5,4,3,1);\n\n return (dvdx, dvdy, dvdz);\n}\n\ninline proc CalcElemFBHourglassForce(xd: 8*real, yd: 8*real, zd: 8*real,\n hourgam: 8*(4*real),\n coefficient: real,\n ref hgfx: 8*real,\n ref hgfy: 8*real,\n ref hgfz: 8*real) {\n var hx, hy, hz: 4*real;\n\n // reduction\n for i in 1..4 {\n for j in 1..8 {\n hx[i] += hourgam[j][i] * xd[j];\n hy[i] += hourgam[j][i] * yd[j];\n hz[i] += hourgam[j][i] * zd[j];\n }\n }\n\n for i in 1..8 {\n var shx, shy, shz: real;\n for j in 1..4 {\n shx += hourgam[i][j] * hx[j];\n shy += hourgam[i][j] * hy[j];\n shz += hourgam[i][j] * hz[j];\n }\n hgfx[i] = coefficient * shx;\n hgfy[i] = coefficient * shy;\n hgfz[i] = coefficient * shz;\n }\n}\n\n\nproc CalcElemCharacteristicLength(x, y, z, volume) {\n proc AreaFace(param p0, param p1, param p2, param p3) {\n const fx = (x[p2] - x[p0]) - (x[p3] - x[p1]),\n fy = (y[p2] - y[p0]) - (y[p3] - y[p1]),\n fz = (z[p2] - z[p0]) - (z[p3] - z[p1]),\n gx = (x[p2] - x[p0]) + (x[p3] - x[p1]),\n gy = (y[p2] - y[p0]) + (y[p3] - y[p1]),\n gz = (z[p2] - z[p0]) + (z[p3] - z[p1]),\n area = (fx * fx + fy * fy + fz * fz) *\n (gx * gx + gy * gy + gz * gz) -\n (fx * gx + fy * gy + fz * gz) *\n (fx * gx + fy * gy + fz * gz);\n\n return area ;\n }\n\n const charLength = max(AreaFace(1, 2, 3, 4),\n AreaFace(5, 6, 7, 8),\n AreaFace(1, 2, 6, 5),\n AreaFace(2, 3, 7, 6),\n AreaFace(3, 4, 8, 7),\n AreaFace(4, 1, 5, 8));\n\n return 4.0 * volume / sqrt(charLength);\n}\n\n\nproc CalcElemVelocityGradient(xvel, yvel, zvel, pfx, pfy, pfz,\n detJ, ref d: 6*real) {\n const inv_detJ = 1.0 / detJ;\n\n d[1] = inv_detJ * ( pfx[1] * (xvel[1]-xvel[7])\n + pfx[2] * (xvel[2]-xvel[8])\n + pfx[3] * (xvel[3]-xvel[5])\n + pfx[4] * (xvel[4]-xvel[6]) );\n d[2] = inv_detJ * ( pfy[1] * (yvel[1]-yvel[7])\n + pfy[2] * (yvel[2]-yvel[8])\n + pfy[3] * (yvel[3]-yvel[5])\n + pfy[4] * (yvel[4]-yvel[6]) );\n d[3] = inv_detJ * ( pfz[1] * (zvel[1]-zvel[7])\n + pfz[2] * (zvel[2]-zvel[8])\n + pfz[3] * (zvel[3]-zvel[5])\n + pfz[4] * (zvel[4]-zvel[6]) );\n\n const dyddx = inv_detJ * ( pfx[1] * (yvel[1]-yvel[7])\n + pfx[2] * (yvel[2]-yvel[8])\n + pfx[3] * (yvel[3]-yvel[5])\n + pfx[4] * (yvel[4]-yvel[6]) ),\n\n dxddy = inv_detJ * ( pfy[1] * (xvel[1]-xvel[7])\n + pfy[2] * (xvel[2]-xvel[8])\n + pfy[3] * (xvel[3]-xvel[5])\n + pfy[4] * (xvel[4]-xvel[6]) ),\n\n dzddx = inv_detJ * ( pfx[1] * (zvel[1]-zvel[7])\n + pfx[2] * (zvel[2]-zvel[8])\n + pfx[3] * (zvel[3]-zvel[5])\n + pfx[4] * (zvel[4]-zvel[6]) ),\n\n dxddz = inv_detJ * ( pfz[1] * (xvel[1]-xvel[7])\n + pfz[2] * (xvel[2]-xvel[8])\n + pfz[3] * (xvel[3]-xvel[5])\n + pfz[4] * (xvel[4]-xvel[6]) ),\n\n dzddy = inv_detJ * ( pfy[1] * (zvel[1]-zvel[7])\n + pfy[2] * (zvel[2]-zvel[8])\n + pfy[3] * (zvel[3]-zvel[5])\n + pfy[4] * (zvel[4]-zvel[6]) ),\n\n dyddz = inv_detJ * ( pfz[1] * (yvel[1]-yvel[7])\n + pfz[2] * (yvel[2]-yvel[8])\n + pfz[3] * (yvel[3]-yvel[5])\n + pfz[4] * (yvel[4]-yvel[6]) );\n\n d[6] = 0.5 * ( dxddy + dyddx );\n d[5] = 0.5 * ( dxddz + dzddx );\n d[4] = 0.5 * ( dzddy + dyddz );\n}\n\n\nproc CalcPressureForElems(p_new: [?D] real, bvc, pbvc, \n e_old, compression, vnewc,\n pmin: real, p_cut: real, eosvmax: real) {\n\n //\n // TODO: Uncomment local once sparse domain is distributed\n //\n forall i in D /* do local */ {\n const c1s = 2.0 / 3.0;\n bvc[i] = c1s * (compression[i] + 1.0);\n pbvc[i] = c1s;\n }\n\n forall i in D {\n p_new[i] = bvc[i] * e_old[i];\n\n if abs(p_new[i]) < p_cut then p_new[i] = 0.0;\n if vnewc[i] >= eosvmax then p_new[i] = 0.0; //impossible?\n if p_new[i] < pmin then p_new[i] = pmin;\n }\n}\n\n\nproc TimeIncrement() {\n var targetdt = stoptime - time;\n\n if dtfixed <= 0.0 && cycle != 0 { //don't do this the first cycle\n var olddt = deltatime,\n newdt = 1.0e20;\n\n if dtcourant < newdt then newdt = dtcourant / 2.0;\n if dthydro < newdt then newdt = 2.0/3.0 * dthydro;\n\n const ratio = newdt / olddt;\n if ratio >= 1.0 {\n if ratio < deltatimemultlb then newdt = olddt;\n else if ratio > deltatimemultub then newdt = olddt * deltatimemultub;\n }\n if newdt > dtmax then newdt = dtmax;\n\n deltatime = newdt;\n }\n\n /* TRY TO PREVENT VERY SMALL SCALING ON THE NEXT CYCLE */\n if targetdt > deltatime && targetdt < (4.0/3.0 * deltatime) {\n targetdt = 2.0/3.0 * deltatime;\n }\n if targetdt < deltatime then deltatime = targetdt;\n\n time += deltatime;\n cycle += 1;\n}\n\ninline proc LagrangeLeapFrog() {\n /* calculate nodal forces, accelerations, velocities, positions, with\n * applied boundary conditions and slide surface considerations */\n LagrangeNodal();\n\n /* calculate element quantities (i.e. velocity gradient & q), and update\n * material states */\n LagrangeElements();\n\n CalcTimeConstraintsForElems();\n}\n\n\ninline proc LagrangeNodal() {\n CalcForceForNodes();\n\n CalcAccelerationForNodes();\n\n ApplyAccelerationBoundaryConditionsForNodes();\n\n CalcVelocityForNodes(deltatime, u_cut);\n\n CalcPositionForNodes(deltatime);\n}\n\n\ninline proc LagrangeElements() {\n CalcLagrangeElements();\n\n /* Calculate Q. (Monotonic q option requires communication) */\n CalcQForElems();\n\n ApplyMaterialPropertiesForElems();\n\n UpdateVolumesForElems();\n}\n\n\ninline proc CalcTimeConstraintsForElems() {\n /* evaluate time constraint */\n CalcCourantConstraintForElems();\n\n /* check hydro constraint */\n CalcHydroConstraintForElems();\n}\n\n\ninline proc computeDTF(indx) {\n const myvdov = vdov[indx];\n\n if myvdov == 0.0 then\n return max(real);\n\n const myarealg = arealg[indx];\n var dtf = ss[indx]**2;\n if myvdov < 0.0 then\n dtf += qqc2 * myarealg**2 * myvdov**2;\n dtf = sqrt(dtf);\n dtf = myarealg / dtf;\n\n return dtf;\n}\n\n\nproc CalcCourantConstraintForElems() {\n const val = min reduce [indx in MatElems] computeDTF(indx);\n\n if (val != max(real)) then\n dtcourant = val;\n}\n\n\ninline proc calcDtHydroTmp(indx) {\n const myvdov = vdov[indx];\n if (myvdov == 0.0) then\n return max(real);\n else\n return dvovmax / (abs(myvdov)+1.0e-20);\n}\n\n\nproc CalcHydroConstraintForElems() {\n const val = min reduce [indx in MatElems] calcDtHydroTmp(indx);\n\n if (val != max(real)) then\n dthydro = val;\n}\n\n\n/* calculate nodal forces, accelerations, velocities, positions, with\n * applied boundary conditions and slide surface considerations */\n\nproc CalcForceForNodes() {\n //zero out all forces\n forall x in fx do x.write(0);\n forall y in fy do y.write(0);\n forall z in fz do z.write(0);\n\n /* Calcforce calls partial, force, hourq */\n CalcVolumeForceForElems();\n\n /* Calculate Nodal Forces at domain boundaries */\n // this was commented out in C++ code, so left out here\n}\n\nproc CalcVolumeForceForElems() {\n var sigxx, sigyy, sigzz, determ: [Elems] real;\n\n /* Sum contributions to total stress tensor */\n InitStressTermsForElems(p, q, sigxx, sigyy, sigzz);\n\n /* call elemlib stress integration loop to produce nodal forces from\n material stresses. */\n IntegrateStressForElems(sigxx, sigyy, sigzz, determ);\n\n /* check for negative element volume */\n forall e in Elems {\n if determ[e] <= 0.0 then\n halt(\"can't have negative volume (determ[\", e, \"]=\", determ[e], \")\");\n }\n\n CalcHourglassControlForElems(determ);\n}\n\n\nproc IntegrateStressForElems(sigxx, sigyy, sigzz, determ) {\n forall k in Elems {\n var b_x, b_y, b_z: 8*real;\n var x_local, y_local, z_local: 8*real;\n localizeNeighborNodes(k, x, x_local, y, y_local, z, z_local);\n\n var fx_local, fy_local, fz_local: 8*real;\n\n local {\n /* Volume calculation involves extra work for numerical consistency. */\n CalcElemShapeFunctionDerivatives(x_local, y_local, z_local, \n b_x, b_y, b_z, determ[k]);\n \n CalcElemNodeNormals(b_x, b_y, b_z, x_local, y_local, z_local);\n\n SumElemStressesToNodeForces(b_x, b_y, b_z, sigxx[k], sigyy[k], sigzz[k], \n fx_local, fy_local, fz_local);\n }\n\n for (noi, t) in elemToNodesTuple(k) {\n fx[noi].add(fx_local[t]);\n fy[noi].add(fy_local[t]);\n fz[noi].add(fz_local[t]);\n }\n }\n}\n\n\nproc CalcHourglassControlForElems(determ) {\n var dvdx, dvdy, dvdz, x8n, y8n, z8n: [Elems] 8*real;\n\n forall eli in Elems {\n /* Collect domain nodes to elem nodes */\n var x1, y1, z1: 8*real;\n localizeNeighborNodes(eli, x, x1, y, y1, z, z1);\n var pfx, pfy, pfz: 8*real;\n\n local {\n /* load into temporary storage for FB Hour Glass control */\n (dvdx[eli], dvdy[eli], dvdz[eli]) = CalcElemVolumeDerivative(x1, y1, z1);\n }\n\n x8n[eli] = x1;\n y8n[eli] = y1;\n z8n[eli] = z1;\n\n determ[eli] = volo[eli] * v[eli];\n }\n\n /* Do a check for negative volumes */\n forall e in Elems {\n if v[e] <= 0.0 then\n halt(\"can't have negative (or zero) volume. (in Hourglass, v[\", e, \"]=\", v[e], \")\");\n }\n\n if hgcoef > 0.0 {\n CalcFBHourglassForceForElems(determ, x8n, y8n, z8n, dvdx, dvdy, dvdz);\n }\n}\n\n\nconst gammaCoef: 4*(8*real) = // WAS: [1..4, 1..8] real = \n (( 1.0, 1.0, -1.0, -1.0, -1.0, -1.0, 1.0, 1.0),\n ( 1.0, -1.0, -1.0, 1.0, -1.0, 1.0, 1.0, -1.0),\n ( 1.0, -1.0, 1.0, -1.0, 1.0, -1.0, 1.0, -1.0),\n (-1.0, 1.0, -1.0, 1.0, 1.0, -1.0, 1.0, -1.0));\n\n/* Calculates the Flanagan-Belytschko anti-hourglass force. */\nproc CalcFBHourglassForceForElems(determ, x8n, y8n, z8n, dvdx, dvdy, dvdz) {\n\n /* compute the hourglass modes */\n forall eli in Elems {\n var hourgam: 8*(4*real);\n const volinv = 1.0 / determ[eli];\n var ss1, mass1, volume13: real;\n var hgfx, hgfy, hgfz: 8*real;\n var coefficient: real;\n\n var xd1, yd1, zd1: 8*real;\n localizeNeighborNodes(eli, xd, xd1, yd, yd1, zd, zd1);\n\n /* TODO: Can we enable this local block? */\n // local {\n for i in 1..4 {\n var hourmodx, hourmody, hourmodz: real;\n // reduction\n for j in 1..8 {\n hourmodx += x8n[eli][j] * gammaCoef[i][j];\n hourmody += y8n[eli][j] * gammaCoef[i][j];\n hourmodz += z8n[eli][j] * gammaCoef[i][j];\n }\n\n for j in 1..8 {\n hourgam[j][i] = gammaCoef[i][j] - volinv * \n (dvdx[eli][j] * hourmodx +\n dvdy[eli][j] * hourmody +\n dvdz[eli][j] * hourmodz);\n }\n }\n\n /* compute forces */\n /* store forces into h arrays (force arrays) */\n ss1 = ss[eli];\n mass1 = elemMass[eli];\n volume13 = cbrt(determ[eli]);\n\n coefficient = - hgcoef * 0.01 * ss1 * mass1 / volume13;\n\n CalcElemFBHourglassForce(xd1, yd1, zd1, hourgam, coefficient,\n hgfx, hgfy, hgfz);\n // } // end local\n\n for (noi,i) in elemToNodesTuple(eli) {\n fx[noi].add(hgfx[i]);\n fy[noi].add(hgfy[i]);\n fz[noi].add(hgfz[i]);\n }\n }\n}\n\n\nproc CalcAccelerationForNodes() {\n forall noi in Nodes do local {\n xdd[noi] = fx[noi].read() / nodalMass[noi];\n ydd[noi] = fy[noi].read() / nodalMass[noi];\n zdd[noi] = fz[noi].read() / nodalMass[noi];\n }\n}\n\n\nproc ApplyAccelerationBoundaryConditionsForNodes() {\n // TODO: Shouldn't we be able to write these as follows?\n //\n // xdd[XSym] = 0.0;\n // ydd[YSym] = 0.0;\n // zdd[ZSym] = 0.0;\n \n forall x in XSym do xdd[x] = 0.0;\n forall y in YSym do ydd[y] = 0.0;\n forall z in ZSym do zdd[z] = 0.0;\n}\n\n\nproc CalcVelocityForNodes(dt: real, u_cut: real) {\n forall i in Nodes do local {\n var xdtmp = xd[i] + xdd[i] * dt,\n ydtmp = yd[i] + ydd[i] * dt,\n zdtmp = zd[i] + zdd[i] * dt;\n if abs(xdtmp) < u_cut then xdtmp = 0.0;\n if abs(ydtmp) < u_cut then ydtmp = 0.0;\n if abs(zdtmp) < u_cut then zdtmp = 0.0;\n xd[i] = xdtmp;\n yd[i] = ydtmp;\n zd[i] = zdtmp;\n }\n}\n\n\nproc CalcPositionForNodes(dt: real) {\n forall ijk in Nodes {\n x[ijk] += xd[ijk] * dt;\n y[ijk] += yd[ijk] * dt;\n z[ijk] += zd[ijk] * dt;\n }\n}\n\n// sungeun: Temporary array reused throughout\nproc CalcLagrangeElements() {\n var dxx, dyy, dzz: [Elems] real;\n\n CalcKinematicsForElems(dxx, dyy, dzz, deltatime);\n\n // element loop to do some stuff not included in the elemlib function.\n forall k in Elems do local {\n vdov[k] = dxx[k] + dyy[k] + dzz[k];\n var vdovthird = vdov[k] / 3.0;\n dxx[k] -= vdovthird;\n dyy[k] -= vdovthird;\n dzz[k] -= vdovthird;\n }\n\n // See if any volumes are negative, and take appropriate action.\n forall e in Elems {\n if vnew[e] <= 0.0 then\n halt(\"can't have negative volume (vnew[\", e, \"]=\", vnew[e], \")\");\n }\n}\n\n\nproc CalcKinematicsForElems(dxx, dyy, dzz, const dt: real) {\n // loop over all elements\n forall k in Elems {\n var b_x, b_y, b_z: 8*real,\n d: 6*real,\n detJ: real;\n\n //get nodal coordinates from global arrays and copy into local arrays\n var x_local, y_local, z_local: 8*real;\n localizeNeighborNodes(k, x, x_local, y, y_local, z, z_local);\n\n //get nodal velocities from global arrays and copy into local arrays\n var xd_local, yd_local, zd_local: 8*real;\n localizeNeighborNodes(k, xd, xd_local, yd, yd_local, zd, zd_local);\n var dt2 = 0.5 * dt; //wish this was local, too...\n\n local {\n //volume calculations\n const volume = CalcElemVolume(x_local, y_local, z_local);\n const relativeVolume = volume / volo[k];\n vnew[k] = relativeVolume;\n delv[k] = relativeVolume - v[k];\n\n //set characteristic length\n arealg[k] = CalcElemCharacteristicLength(x_local, y_local, z_local,\n volume);\n\n for i in 1..8 {\n x_local[i] -= dt2 * xd_local[i];\n y_local[i] -= dt2 * yd_local[i];\n z_local[i] -= dt2 * zd_local[i];\n }\n\n CalcElemShapeFunctionDerivatives(x_local, y_local, z_local,\n b_x, b_y, b_z, detJ);\n\n CalcElemVelocityGradient(xd_local, yd_local, zd_local, b_x, b_y, b_z,\n detJ, d);\n\n }\n\n // put velocity gradient quantities into their global arrays.\n dxx[k] = d[1];\n dyy[k] = d[2];\n dzz[k] = d[3];\n }\n}\n\n\n// sungeun: Temporary array reused throughout\n/* velocity gradient */\nvar delv_xi, delv_eta, delv_zeta: [Elems] real;\n/* position gradient */\nvar delx_xi, delx_eta, delx_zeta: [Elems] real;\n\nproc CalcQForElems() {\n // MONOTONIC Q option\n\n /* Calculate velocity gradients */\n CalcMonotonicQGradientsForElems(delv_xi, delv_eta, delv_zeta, \n delx_xi, delx_eta, delx_zeta);\n\n /* Transfer veloctiy gradients in the first order elements */\n /* problem->commElements->Transfer(CommElements::monoQ) ; */\n CalcMonotonicQForElems(delv_xi, delv_eta, delv_zeta,\n delx_xi, delx_eta, delx_zeta);\n\n /* Don't allow excessive artificial viscosity */\n forall e in Elems {\n if q[e] > qstop then\n halt(\"Excessive artificial viscosity! (q[\", e, \"]=\", q[e], \")\");\n }\n}\n\n\n// sungeun: Temporary array reused throughout\nvar vnewc: [MatElems] real;\n\n/* Expose all of the variables needed for material evaluation */\nproc ApplyMaterialPropertiesForElems() {\n\n forall i in MatElems do vnewc[i] = vnew[i];\n\n if eosvmin != 0.0 then\n [c in vnewc] if c < eosvmin then c = eosvmin;\n\n if eosvmax != 0.0 then\n [c in vnewc] if c > eosvmax then c = eosvmax;\n\n\n // old comment: The following loop should compute min/max reductions;\n // currently, race-y\n\n forall matelm in MatElems {\n var vc = v[matelm];\n if eosvmin != 0.0 && vc < eosvmin then vc = eosvmin;\n if eosvmax != 0.0 && vc > eosvmax then vc = eosvmax;\n if vc <= 0.0 {\n writeln(\"Volume error (in ApplyMaterialProperiesForElems).\");\n exit(1);\n }\n }\n\n EvalEOSForElems(vnewc);\n}\n\n\nproc UpdateVolumesForElems() {\n forall i in Elems do local {\n var tmpV = vnew[i];\n if abs(tmpV-1.0) < v_cut then tmpV = 1.0;\n v[i] = tmpV;\n }\n}\n\n\nproc CalcMonotonicQGradientsForElems(delv_xi, delv_eta, delv_zeta, \n delx_xi, delx_eta, delx_zeta) {\n forall eli in Elems {\n const ptiny = 1.0e-36;\n var xl, yl, zl: 8*real;\n localizeNeighborNodes(eli, x, xl, y, yl, z, zl);\n var xvl, yvl, zvl: 8*real;\n localizeNeighborNodes(eli, xd, xvl, yd, yvl, zd, zvl);\n\n local {\n const vol = volo[eli] * vnew[eli],\n norm = 1.0 / (vol + ptiny);\n var ax, ay, az, dxv, dyv, dzv: real;\n\n const dxj = -0.25*((xl[1]+xl[2]+xl[6]+xl[5])-(xl[4]+xl[3]+xl[7]+xl[8])),\n dyj = -0.25*((yl[1]+yl[2]+yl[6]+yl[5])-(yl[4]+yl[3]+yl[7]+yl[8])),\n dzj = -0.25*((zl[1]+zl[2]+zl[6]+zl[5])-(zl[4]+zl[3]+zl[7]+zl[8])),\n \n dxi = 0.25*((xl[2]+xl[3]+xl[7]+xl[6])-(xl[1]+xl[4]+xl[8]+xl[5])),\n dyi = 0.25*((yl[2]+yl[3]+yl[7]+yl[6])-(yl[1]+yl[4]+yl[8]+yl[5])),\n dzi = 0.25*((zl[2]+zl[3]+zl[7]+zl[6])-(zl[1]+zl[4]+zl[8]+zl[5])),\n \n dxk = 0.25*((xl[5]+xl[6]+xl[7]+xl[8])-(xl[1]+xl[2]+xl[3]+xl[4])),\n dyk = 0.25*((yl[5]+yl[6]+yl[7]+yl[8])-(yl[1]+yl[2]+yl[3]+yl[4])),\n dzk = 0.25*((zl[5]+zl[6]+zl[7]+zl[8])-(zl[1]+zl[2]+zl[3]+zl[4]));\n\n /* find delvk and delxk ( i cross j ) */\n\n ax = dyi*dzj - dzi*dyj;\n ay = dzi*dxj - dxi*dzj;\n az = dxi*dyj - dyi*dxj;\n\n delx_zeta[eli] = vol / sqrt(ax*ax + ay*ay + az*az + ptiny);\n\n ax *= norm;\n ay *= norm;\n az *= norm;\n\n dxv = 0.25*((xvl[5]+xvl[6]+xvl[7]+xvl[8])-(xvl[1]+xvl[2]+xvl[3]+xvl[4]));\n dyv = 0.25*((yvl[5]+yvl[6]+yvl[7]+yvl[8])-(yvl[1]+yvl[2]+yvl[3]+yvl[4]));\n dzv = 0.25*((zvl[5]+zvl[6]+zvl[7]+zvl[8])-(zvl[1]+zvl[2]+zvl[3]+zvl[4]));\n\n delv_zeta[eli] = ax*dxv + ay*dyv + az*dzv;\n\n /* find delxi and delvi ( j cross k ) */\n\n ax = dyj*dzk - dzj*dyk;\n ay = dzj*dxk - dxj*dzk;\n az = dxj*dyk - dyj*dxk;\n\n delx_xi[eli] = vol / sqrt(ax*ax + ay*ay + az*az + ptiny) ;\n\n ax *= norm;\n ay *= norm;\n az *= norm;\n\n dxv = 0.25*((xvl[2]+xvl[3]+xvl[7]+xvl[6])-(xvl[1]+xvl[4]+xvl[8]+xvl[5]));\n dyv = 0.25*((yvl[2]+yvl[3]+yvl[7]+yvl[6])-(yvl[1]+yvl[4]+yvl[8]+yvl[5]));\n dzv = 0.25*((zvl[2]+zvl[3]+zvl[7]+zvl[6])-(zvl[1]+zvl[4]+zvl[8]+zvl[5]));\n\n delv_xi[eli] = ax*dxv + ay*dyv + az*dzv ;\n\n /* find delxj and delvj ( k cross i ) */\n\n ax = dyk*dzi - dzk*dyi;\n ay = dzk*dxi - dxk*dzi;\n az = dxk*dyi - dyk*dxi;\n\n delx_eta[eli] = vol / sqrt(ax*ax + ay*ay + az*az + ptiny) ;\n\n ax *= norm;\n ay *= norm;\n az *= norm;\n\n dxv= -0.25*((xvl[1]+xvl[2]+xvl[6]+xvl[5])-(xvl[4]+xvl[3]+xvl[7]+xvl[8]));\n dyv= -0.25*((yvl[1]+yvl[2]+yvl[6]+yvl[5])-(yvl[4]+yvl[3]+yvl[7]+yvl[8]));\n dzv= -0.25*((zvl[1]+zvl[2]+zvl[6]+zvl[5])-(zvl[4]+zvl[3]+zvl[7]+zvl[8]));\n\n delv_eta[eli] = ax*dxv + ay*dyv + az*dzv ;\n } /* local */\n } /* forall eli */\n}\n\n\nproc CalcMonotonicQForElems(delv_xi, delv_eta, delv_zeta, \n delx_xi, delx_eta, delx_zeta) {\n //got rid of call through to \"CalcMonotonicQRegionForElems\"\n\n forall i in MatElems {\n const ptiny = 1.0e-36;\n const bcMask = elemBC[i];\n var norm, delvm, delvp: real;\n\n /* phixi */\n norm = 1.0 / (delv_xi[i] + ptiny);\n\n select bcMask & XI_M {\n when 0 do delvm = delv_xi[lxim(i)];\n when XI_M_SYMM do delvm = delv_xi[i];\n when XI_M_FREE do delvm = 0.0;\n }\n select bcMask & XI_P {\n when 0 do delvp = delv_xi[lxip(i)];\n when XI_P_SYMM do delvp = delv_xi[i];\n when XI_P_FREE do delvp = 0.0;\n }\n\n delvm *= norm;\n delvp *= norm;\n\n var phixi = 0.5 * (delvm + delvp);\n\n delvm *= monoq_limiter_mult;\n delvp *= monoq_limiter_mult;\n\n if delvm < phixi then phixi = delvm;\n if delvp < phixi then phixi = delvp;\n if phixi < 0 then phixi = 0.0;\n if phixi > monoq_max_slope then phixi = monoq_max_slope;\n\n /* phieta */\n norm = 1.0 / (delv_eta[i] + ptiny);\n\n select bcMask & ETA_M {\n when 0 do delvm = delv_eta[letam[i]];\n when ETA_M_SYMM do delvm = delv_eta[i]; \n when ETA_M_FREE do delvm = 0.0; \n }\n select bcMask & ETA_P {\n when 0 do delvp = delv_eta[letap[i]];\n when ETA_P_SYMM do delvp = delv_eta[i]; \n when ETA_P_FREE do delvp = 0.0; \n }\n\n delvm = delvm * norm;\n delvp = delvp * norm;\n\n var phieta = 0.5 * (delvm + delvp);\n\n delvm *= monoq_limiter_mult;\n delvp *= monoq_limiter_mult;\n\n if delvm < phieta then phieta = delvm;\n if delvp < phieta then phieta = delvp;\n if phieta < 0.0 then phieta = 0.0;\n if phieta > monoq_max_slope then phieta = monoq_max_slope;\n\n /* phizeta */\n norm = 1.0 / (delv_zeta[i] + ptiny);\n\n select bcMask & ZETA_M {\n when 0 do delvm = delv_zeta[lzetam[i]];\n when ZETA_M_SYMM do delvm = delv_zeta[i]; \n when ZETA_M_FREE do delvm = 0.0; \n }\n select bcMask & ZETA_P {\n when 0 do delvp = delv_zeta[lzetap[i]];\n when ZETA_P_SYMM do delvp = delv_zeta[i]; \n when ZETA_P_FREE do delvp = 0.0; \n }\n\n delvm = delvm * norm;\n delvp = delvp * norm;\n\n var phizeta = 0.5 * (delvm + delvp);\n\n delvm *= monoq_limiter_mult;\n delvp *= monoq_limiter_mult;\n\n if delvm < phizeta then phizeta = delvm;\n if delvp < phizeta then phizeta = delvp;\n if phizeta < 0.0 then phizeta = 0.0;\n if phizeta > monoq_max_slope then phizeta = monoq_max_slope;\n\n /* Remove length scale */\n var qlin, qquad: real;\n if vdov[i] > 0.0 {\n qlin = 0.0;\n qquad = 0.0;\n } else {\n var delvxxi = delv_xi[i] * delx_xi[i],\n delvxeta = delv_eta[i] * delx_eta[i],\n delvxzeta = delv_zeta[i] * delx_zeta[i];\n\n if delvxxi > 0.0 then delvxxi = 0.0;\n if delvxeta > 0.0 then delvxeta = 0.0;\n if delvxzeta > 0.0 then delvxzeta = 0.0;\n\n const rho = elemMass[i] / (volo[i] * vnew[i]);\n\n qlin = -qlc_monoq * rho *\n ( delvxxi * (1.0 - phixi) +\n delvxeta * (1.0 - phieta) +\n delvxzeta * (1.0 - phizeta));\n\n qquad = qqc_monoq * rho *\n ( delvxxi**2 * (1.0 - phixi**2) +\n delvxeta**2 * (1.0 - phieta**2) +\n delvxzeta**2 * (1.0 - phizeta**2));\n }\n qq[i] = qquad;\n ql[i] = qlin;\n\n }\n}\n\n\nproc EvalEOSForElems(vnewc) {\n const rho0 = refdens;\n\n var e_old, delvc, p_old, q_old, compression, compHalfStep, \n qq_old, ql_old, work, p_new, e_new, q_new, bvc, pbvc: [Elems] real;\n\n /* compress data, minimal set */\n forall i in MatElems {\n e_old[i] = e[i];\n delvc[i] = delv[i];\n p_old[i] = p[i];\n q_old[i] = q[i];\n qq_old[i] = qq[i];\n ql_old[i] = ql[i];\n }\n\n //\n // TODO: Uncomment local once sparse domain is distributed\n //\n forall i in Elems /* do local */ {\n compression[i] = 1.0 / vnewc[i] - 1.0;\n const vchalf = vnewc[i] - delvc[i] * 0.5;\n compHalfStep[i] = 1.0 / vchalf - 1.0;\n }\n\n /* Check for v > eosvmax or v < eosvmin */\n // (note: I think this was already checked for in calling function!)\n if eosvmin != 0.0 {\n forall i in Elems {\n if vnewc[i] <= eosvmin then compHalfStep[i] = compression[i];\n }\n }\n if eosvmax != 0.0 {\n forall i in Elems {\n if vnewc[i] >= eosvmax {\n p_old[i] = 0.0;\n compression[i] = 0.0;\n compHalfStep[i] = 0.0;\n }\n }\n }\n\n CalcEnergyForElems(p_new, e_new, q_new, bvc, pbvc, \n p_old, e_old, q_old, compression, compHalfStep, \n vnewc, work, delvc, qq_old, ql_old);\n\n forall i in MatElems {\n p[i] = p_new[i];\n e[i] = e_new[i];\n q[i] = q_new[i];\n }\n\n CalcSoundSpeedForElems(vnewc, rho0, e_new, p_new, pbvc, bvc);\n}\n\n\nproc CalcEnergyForElems(p_new, e_new, q_new, bvc, pbvc,\n p_old, e_old, q_old, compression, compHalfStep, \n vnewc, work, delvc, qq_old, ql_old) {\n // TODO: might need to move these consts into foralls or global\n // Otherwise, they live on Locale0 and everyone else has to do \n // remote reads. OR: Check if they're remote value forwarded.\n const rho0 = refdens; \n const sixth = 1.0 / 6.0;\n\n var pHalfStep: [MatElems] real;\n\n forall i in Elems {\n e_new[i] = e_old[i] - 0.5 * delvc[i] * (p_old[i] + q_old[i]) \n + 0.5 * work[i];\n if e_new[i] < emin then e_new[i] = emin;\n }\n\n CalcPressureForElems(pHalfStep, bvc, pbvc, e_new, compHalfStep,\n vnewc, pmin, p_cut, eosvmax);\n\n forall i in Elems {\n const vhalf = 1.0 / (1.0 + compHalfStep[i]);\n\n if delvc[i] > 0.0 {\n q_new[i] = 0.0;\n } else {\n var ssc = (pbvc[i] * e_new[i] + vhalf**2 * bvc[i] * pHalfStep[i]) / rho0;\n if ssc <= 0.0 then ssc = 0.333333e-36;\n else ssc = sqrt(ssc);\n q_new[i] = ssc * ql_old[i] + qq_old[i];\n }\n\n e_new[i] += 0.5 * delvc[i]\n * (3.0*(p_old[i] + q_old[i]) - 4.0*(pHalfStep[i] + q_new[i]));\n }\n forall i in Elems {\n e_new[i] += 0.5 * work[i];\n if abs(e_new[i] < e_cut) then e_new[i] = 0.0;\n if e_new[i] < emin then e_new[i] = emin;\n }\n\n CalcPressureForElems(p_new, bvc, pbvc, e_new, compression, vnewc, pmin,\n p_cut, eosvmax);\n\n forall i in Elems {\n var q_tilde:real;\n\n if delvc[i] > 0.0 {\n q_tilde = 0.0;\n } else {\n var ssc = (pbvc[i] * e_new[i] + vnewc[i]**2 * bvc[i] * p_new[i] ) / rho0;\n if ssc <= 0.0 then ssc = 0.333333e-36;\n else ssc = sqrt(ssc);\n q_tilde = ssc * ql_old[i] + qq_old[i];\n }\n\n e_new[i] -= (7.0*(p_old[i] + q_old[i]) \n - 8.0*(pHalfStep[i] + q_new[i]) \n + (p_new[i] + q_tilde)) * delvc[i] * sixth;\n if abs(e_new[i]) < e_cut then e_new[i] = 0.0;\n if e_new[i] < emin then e_new[i] = emin;\n }\n\n CalcPressureForElems(p_new, bvc, pbvc, e_new, compression, vnewc, pmin,\n p_cut, eosvmax);\n\n\n //\n // TODO: Uncomment local once sparse domain is distributed\n //\n forall i in Elems /* do local */ {\n if delvc[i] <= 0.0 {\n var ssc = (pbvc[i] * e_new[i] + vnewc[i]**2 * bvc[i] * p_new[i] ) / rho0;\n if ssc <= 0.0 then ssc = 0.333333e-36;\n else ssc = sqrt(ssc);\n q_new[i] = ssc * ql_old[i] + qq_old[i];\n if abs(q_new[i]) < q_cut then q_new[i] = 0.0;\n }\n }\n}\n\n\nproc CalcSoundSpeedForElems(vnewc, rho0:real, enewc, pnewc, pbvc, bvc) {\n // TODO: Open question: If we had multiple materials, should (a) ss\n // be zeroed and accumulated into, and (b) updated atomically to\n // avoid losing updates? (Jeff will go back and think on this)\n //\n forall i in MatElems {\n var ssTmp = (pbvc[i] * enewc[i] + vnewc[i]**2 * bvc[i] * pnewc[i]) / rho0;\n if ssTmp <= 1.111111e-36 then ssTmp = 1.111111e-36;\n ss[i] = sqrt(ssTmp);\n }\n}\n\n\niter elemToNodes(elem) {\n for i in 1..nodesPerElem do\n yield elemToNode[elem][i];\n}\n \niter elemToNodesTuple(e) {\n for i in 1..nodesPerElem do\n yield (elemToNode[e][i], i);\n}\n\n\nproc deprint(title:string, x:[?D] real, y:[D] real, z:[D] real) {\n writeln(title);\n for i in D do\n writef(\"%3i: %3.4er %3.4er %3.4er\\n\", \n if use3DRepresentation then idx3DTo1D(i, D.dim(1).size) else i, \n x[i], y[i], z[i]);\n}\n\n\nproc deprintatomic(title:string, x:[?D] atomic real, y:[] atomic real, z:[] atomic real) {\n writeln(title);\n for i in D do\n writef(\"%3i: %3.4er %3.4er %3.4er\\n\", \n if use3DRepresentation then idx3DTo1D(i, D.dim(1).size) else i, \n x[i].peek(), y[i].peek(), z[i].peek());\n}\n" }, { "path": "src/test/resources/samples/langs/Chapel/nbody.chpl", "content": "/* The Computer Language Benchmarks Game\n http://benchmarksgame.alioth.debian.org/\n\n contributed by Albert Sidelnik\n modified by Brad Chamberlain\n*/\n\n\n//\n// The number of timesteps to simulate; may be set via the command-line\n//\nconfig const n = 10000;\n\n//\n// Constants representing pi, the solar mass, and the number of days per year\n//\nconst pi = 3.141592653589793,\n solarMass = 4 * pi**2,\n daysPerYear = 365.24;\n\n//\n// a record representing one of the bodies in the solar system\n//\nrecord body {\n var pos: 3*real;\n var v: 3*real;\n var mass: real; // does not change after it is set up\n}\n\n//\n// the array of bodies that we'll be simulating\n//\nvar bodies = [/* sun */\n new body(mass = solarMass),\n\n /* jupiter */\n new body(pos = ( 4.84143144246472090e+00,\n -1.16032004402742839e+00,\n -1.03622044471123109e-01),\n v = ( 1.66007664274403694e-03 * daysPerYear,\n 7.69901118419740425e-03 * daysPerYear,\n -6.90460016972063023e-05 * daysPerYear),\n mass = 9.54791938424326609e-04 * solarMass),\n \n /* saturn */\n new body(pos = ( 8.34336671824457987e+00,\n 4.12479856412430479e+00,\n -4.03523417114321381e-01),\n v = (-2.76742510726862411e-03 * daysPerYear,\n 4.99852801234917238e-03 * daysPerYear,\n 2.30417297573763929e-05 * daysPerYear),\n mass = 2.85885980666130812e-04 * solarMass),\n\n /* uranus */\n new body(pos = ( 1.28943695621391310e+01,\n -1.51111514016986312e+01,\n -2.23307578892655734e-01),\n v = ( 2.96460137564761618e-03 * daysPerYear,\n 2.37847173959480950e-03 * daysPerYear,\n -2.96589568540237556e-05 * daysPerYear),\n mass = 4.36624404335156298e-05 * solarMass),\n\n /* neptune */\n new body(pos = ( 1.53796971148509165e+01,\n -2.59193146099879641e+01,\n 1.79258772950371181e-01),\n v = ( 2.68067772490389322e-03 * daysPerYear,\n 1.62824170038242295e-03 * daysPerYear,\n -9.51592254519715870e-05 * daysPerYear),\n mass = 5.15138902046611451e-05 * solarMass)\n ];\n\n//\n// the number of bodies to be simulated\n//\nconst numbodies = bodies.numElements;\n\n//\n// The computation involves initializing the sun's velocity,\n// writing the initial energy, advancing the system through 'n'\n// timesteps, and writing the final energy.\n//\nproc main() {\n initSun();\n\n writef(\"%.9r\\n\", energy());\n for 1..n do\n advance(0.01);\n writef(\"%.9r\\n\", energy());\n}\n\n//\n// compute the sun's initial velocity\n//\nproc initSun() {\n const p = + reduce (for b in bodies do (b.v * b.mass));\n bodies[1].v = -p / solarMass;\n}\n\n//\n// advance the positions and velocities of all the bodies\n//\nproc advance(dt) {\n for i in 1..numbodies {\n for j in i+1..numbodies {\n updateVelocities(bodies[i], bodies[j]);\n \n inline proc updateVelocities(ref b1, ref b2) {\n const dpos = b1.pos - b2.pos,\n mag = dt / sqrt(sumOfSquares(dpos))**3;\n \n b1.v -= dpos * b2.mass * mag;\n b2.v += dpos * b1.mass * mag;\n }\n }\n }\n \n for b in bodies do\n b.pos += dt * b.v;\n}\n\n//\n// compute the energy of the bodies\n//\nproc energy() {\n var e = 0.0;\n \n for i in 1..numbodies {\n const b1 = bodies[i];\n \n e += 0.5 * b1.mass * sumOfSquares(b1.v);\n \n for j in i+1..numbodies {\n const b2 = bodies[j];\n \n e -= (b1.mass * b2.mass) / sqrt(sumOfSquares(b1.pos - b2.pos));\n }\n }\n \n return e;\n}\n\n//\n// a helper routine to compute the sum of squares of a 3-tuple's components\n//\ninline proc sumOfSquares(x)\n return x(1)**2 + x(2)**2 + x(3)**2;\n" }, { "path": "src/test/resources/samples/langs/Chapel/quicksort.chpl", "content": "//\n// An example of a parallel quick sort implementation that uses\n// \"cobegin\" to make each recursive call in parallel and \"serial\" to\n// limit the number of threads.\n//\n\nuse Random, Time; // for random number generation and the Timer class\n\nvar timer: Timer; // to time the sort\n\nconfig var n: int = 2**15; // the size of the array to be sorted\nconfig var thresh: int = 1; // the recursive depth to serialize\nconfig var verbose: int = 0; // print out this many elements in array\nconfig var timing: bool = true; // set timing to false to disable timer\n\nvar A: [1..n] real; // array of real numbers\n\n//\n// initialize array with random numbers\n//\nfillRandom(A);\n\n//\n// print out front of array if verbose flag is set\n//\nif verbose > 0 then\n writeln(\"A[1..\", verbose, \"] = \", A[1..verbose]);\n\n//\n// start timer, call parallel quick sort routine, stop timer\n//\nif timing then timer.start();\npqsort(A, thresh);\nif timing then timer.stop();\n\n//\n// report sort time\n//\nif timing then writeln(\"sorted in \", timer.elapsed(), \" seconds\");\n\n//\n// print out front of array if verbose flag is set\n// values should now be in sorted order\n//\nif verbose > 0 then\n writeln(\"A[1..\", verbose, \"] = \", A[1..verbose]);\n\n//\n// verify that array is sorted or halt\n//\nfor i in 2..n do\n if A(i) < A(i-1) then\n halt(\"A(\", i-1, \") == \", A(i-1), \" > A(\", i, \") == \", A(i));\n\nwriteln(\"verification success\");\n\n//\n// pqsort -- parallel quick sort\n//\n// arr: generic 1D array of values (real, int, ...)\n// thresh: number of recursive calls to make before serializing\n// low: lower bound of array to start sort at, defaults to whole array\n// high: upper bound of array to stop sort at, defaults to whole array\n//\nproc pqsort(arr: [],\n thresh: int,\n low: int = arr.domain.low,\n high: int = arr.domain.high) where arr.rank == 1 {\n\n //\n // base case: arr[low..high] is small enough to bubble sort\n //\n if high - low < 8 {\n bubbleSort(arr, low, high);\n return;\n }\n\n //\n // determine pivot and partition arr[low..high]\n //\n const pivotVal = findPivot();\n const pivotLoc = partition(pivotVal);\n\n //\n // make recursive calls to parallel quick sort each unsorted half of\n // the array; if thresh is 0 or less, start executing conquer tasks\n // serially\n //\n serial thresh <= 0 do cobegin {\n pqsort(arr, thresh-1, low, pivotLoc-1);\n pqsort(arr, thresh-1, pivotLoc+1, high);\n }\n\n //\n // findPivot -- helper routine to find pivot value using simple\n // median-of-3 method, returns pivot value\n //\n proc findPivot() {\n const mid = low + (high-low+1) / 2;\n\n if arr(mid) < arr(low) then arr(mid) <=> arr(low);\n if arr(high) < arr(low) then arr(high) <=> arr(low);\n if arr(high) < arr(mid) then arr(high) <=> arr(mid);\n\n const pivotVal = arr(mid);\n arr(mid) = arr(high-1);\n arr(high-1) = pivotVal;\n\n return pivotVal;\n }\n\n //\n // partition -- helper routine to partition array such that all\n // values less than pivot are to its left and all\n // values greater than pivot are to its right, returns\n // pivot location\n //\n proc partition(pivotVal) {\n var ilo = low, ihi = high-1;\n while (ilo < ihi) {\n do { ilo += 1; } while arr(ilo) < pivotVal;\n do { ihi -= 1; } while pivotVal < arr(ihi);\n if (ilo < ihi) {\n arr(ilo) <=> arr(ihi);\n }\n }\n arr(high-1) = arr(ilo);\n arr(ilo) = pivotVal;\n return ilo;\n }\n}\n\n//\n// bubbleSort -- bubble sort for base case of quick sort\n//\n// arr: generic 1D array of values (real, int, ...)\n// low: lower bound of array to start sort at\n// high: upper bound of array to stop sort at\n//\nproc bubbleSort(arr: [], low: int, high: int) where arr.rank == 1 {\n for i in low..high do\n for j in low..high-1 do\n if arr(j) > arr(j+1) then\n arr(j) <=> arr(j+1);\n}\n" }, { "path": "src/test/resources/samples/langs/Charity/example.ch", "content": "%\n% Some very badly written Charity\n%\n\ndata LA(A) -> D = ss: A -> D\n | ff: -> D.\n" }, { "path": "src/test/resources/samples/langs/Cirru/array.cirru", "content": "\nprint $ array\n int 1\n string 2\n\nprint $ array\n int 1\n array\n int 2\n string 3\n array\n string 4" }, { "path": "src/test/resources/samples/langs/Cirru/block.cirru", "content": "\nset f $ block (a b c)\n print a b c\n\ncall f (int 1) (int 2) (int 3)\n\nf (int 1) (int 2) (int 3)" }, { "path": "src/test/resources/samples/langs/Cirru/bool.cirru", "content": "\nprint $ bool true\nprint $ bool false\nprint $ bool yes\nprint $ bool no\nprint $ bool 1\nprint $ bool 0" }, { "path": "src/test/resources/samples/langs/Cirru/map.cirru", "content": "\nprint $ map\n a $ int 5\n b $ array (int 1) (int 2)\n c $ map\n int 1\n array (int 4)\n\nset m $ map\n a $ int 1\n\nset m b $ int 2\n\nprint m" }, { "path": "src/test/resources/samples/langs/Cirru/number.cirru", "content": "\nprint $ int 1\nprint $ float 1.2" }, { "path": "src/test/resources/samples/langs/Cirru/require.cirru", "content": "\nrequire ./stdio.cr\n" }, { "path": "src/test/resources/samples/langs/Cirru/scope.cirru", "content": "\nset a (int 2)\n\nprint (self)\n\nset c (child)\n\nunder c\n under parent\n print a\n\nprint $ get c a\n\nset c x (int 3)\nprint $ get c x\n\nset just-print $ code\n print a\n\nprint just-print\n\neval (self) just-print\neval just-print" }, { "path": "src/test/resources/samples/langs/Cirru/stdio.cirru", "content": "\nset a $ string 1\nprint a\n\nprint (string 1)\n\nprint nothing\n\nprint\n map\n a (int 4)\n b $ map\n a $ int 5\n b $ int 6\n c $ map\n int 7\n\nprint\n array\n int 1\n int 2\n array\n int 3\n int 4\n\nprint\n array\n int 1\n map\n a $ int 2\n b $ array\n int 3\n\nprint\n int 1\n int 2\n\nprint $ code\n set a 1\n print (get a)\n print $ array\n int a\n array\n int a\n\nset container (map)\nset container code $ code\n set a 1\n print (get a)\n print $ array\n int a\n array\n int a\n\nprint container" }, { "path": "src/test/resources/samples/langs/Cirru/string.cirru", "content": "\nprint $ string a\nprint $ string \"a b\"" }, { "path": "src/test/resources/samples/langs/Clarion/CStringClass.clw", "content": " Member()\r\n omit('***$***',_VER_C55)\r\n_ABCDllMode_ EQUATE(0)\r\n_ABCLinkMode_ EQUATE(1)\r\n ***$***\r\n Include('Equates.CLW'),ONCE\r\n Include('Keycodes.CLW'),ONCE\r\n Include('Errors.CLW'),ONCE\r\n Map\r\n End ! map\r\n Include('CStringClass.inc'),ONCE\r\nCStringClass.Construct PROCEDURE ! Declare Procedure\r\n CODE\r\n SELF.bufferSize = DEFAULT_CS_BUFFER_SIZE\r\n SELF.CS &= New(CSTRING(SELF.bufferSize))\r\nCStringClass.Destruct PROCEDURE ! Declare Procedure\r\n CODE\r\n Dispose(SELF.cs)\r\nCStringClass.Cat PROCEDURE (STRING pStr) !,*CSTRING,PROC ! Declare Procedure\r\nnewLen LONG,AUTO\r\noldCS &CSTRING\r\n CODE\r\n newLen = Len(pStr)\r\n IF (newLen+SELF.strLength+2) > SELF.newStrSize\r\n ! Only grow the internal string if the result of the cat will be larger than the string currently is.\r\n ! The reason for the \"+2\" is because this is used in the string slicing outside this IF. Without this matching +2 there is potential for an out of bounds slice which would be bad!\r\n\r\n ! Save a temporary copy of the old string so we can us it in the concatination after we have grown it!\r\n oldCS &= New(CSTRING(SELF.strLength+1))\r\n oldCS = SELF.CS\r\n Dispose(SELF.CS)\r\n\r\n SELF.newStrSize = newLen + SELF.strLength + 1 + SELF.bufferSize\r\n SELF.CS &= New(CSTRING(SELF.newStrSize))\r\n SELF.CS = oldCS\r\n Dispose(oldCS)\r\n END\r\n\r\n ! Append the new string directly to the end of the old one.\r\n SELF.CS[SELF.strLength+1 : SELF.strLength+newLen] = pStr\r\n ! And terminate the CSTRING manually\r\n SELF.CS[SELF.strLength+newLen+1] = '<0>'\r\n\r\n ! This is the same as doing \"SELF.strLength = Len(SELF.CS)\" but the Len() is _really_ slow on large strings. This is much faster!\r\n SELF.strLength += newLen\r\n\r\n ! This is what it used to be:\r\n ! SELF.Str(SELF.Str() & s)\r\n ! It is a nice and neat solution but performance, especially on large strings was terrible!\r\n\r\n RETURN SELF.Str()\r\nCStringClass.Str PROCEDURE (STRING pStr) !,*CSTRING, PROC ! Declare Procedure\r\n CODE\r\n IF Len(pStr) > SELF.newStrSize\r\n ! Only Dispose/New the internal string if the new one requires it.\r\n ! This might be slightly innefficient in terms of memory usage when the string gets smaller\r\n ! But it is _vasty_ better for performance when the string gets added to a lot.\r\n Dispose(SELF.CS)\r\n SELF.newStrSize = Len(pStr) + 1 + SELF.bufferSize\r\n SELF.CS &= New(CSTRING(SELF.newStrSize))\r\n END\r\n\r\n SELF.CS = pStr\r\n SELF.strLength = Len(SELF.CS)\r\n\r\n RETURN SELF.CS\r\nCStringClass.Len PROCEDURE !,LONG ! Declare Procedure\r\n CODE\r\n RETURN SELF.strLength\r\nCStringClass.Replace PROCEDURE (STRING pFind, STRING pReplace) !,*CSTRING,PROC ! Declare Procedure\r\n! FindString , ReplaceWith\r\nlocate LONG,AUTO\r\nlastLocate LONG\r\n CODE\r\n LOOP\r\n locate = InString(Upper(pFind), Upper(SELF.Str()), 1, lastLocate+1)\r\n IF ~locate\r\n BREAK\r\n END\r\n\r\n ! So we dont end up having recursive replacement.\r\n lastLocate = locate + Len(pReplace)-1\r\n\r\n SELF.Str(Sub(SELF.Str(), 1, locate-1) & |\r\n pReplace & |\r\n Sub(SELF.Str(), locate+Len(pFind), SELF.Len()) |\r\n )\r\n END\r\n\r\n RETURN SELF.Str()\r\nCStringClass.Str PROCEDURE () !,*CSTRING ! Declare Procedure 3\r\n CODE\r\n RETURN SELF.CS\r\n!------------------------------------------------------------------------------\r\nCStringClass.Contains PROCEDURE (STRING pFind, BYTE pCaseSensitive=TRUE) !,BYTE ! Declare Procedure\r\n! Returns a value (TRUE) indicating whether the specified String occurs within this string.\r\n! Second parameter defaults to a case sensitive search.\r\n CODE\r\n IF pCaseSensitive = TRUE\r\n IF InString(pFind, SELF.Str(), 1 , 1) > 0\r\n RETURN TRUE\r\n END\r\n ELSE\r\n IF InString(Lower(pFind), SELF.Lower(), 1 , 1) > 0\r\n RETURN TRUE\r\n END\r\n END\r\n\r\n RETURN FALSE\r\nCStringClass.Lower PROCEDURE () !,STRING ! Declare Procedure\r\n! Returns a \"Lowered\" version of the self.cs doesnt change the self.cs\r\n CODE\r\n RETURN Lower(SELF.CS)\r\nCStringClass.SubString PROCEDURE (LONG pPosition, LONG pLength) !,STRING,PROC ! Declare Procedure\r\n CODE\r\n RETURN Sub(SELF.Str(), pPosition, pLength)\r\nCStringClass.ToLower PROCEDURE () !,*CSTRING,PROC ! Declare Procedure\r\n! Converts this string to lowercase and returns the converted string\r\n\r\n CODE\r\n RETURN SELF.Str(SELF.Lower())\r\nCStringClass.ToUpper PROCEDURE () !,*CSTRING,PROC ! Declare Procedure\r\n! Converts this string to uppercase and returns the converted string\r\n\r\n CODE\r\n RETURN SELF.Str(SELF.Upper())\r\nCStringClass.Trim PROCEDURE () !,*CSTRING,PROC ! Declare Procedure\r\n CODE\r\n SELF.Str(Left(SELF.Str()))\r\n SELF.Str(Clip(SELF.Str()))\r\n RETURN SELF.Str()\r\nCStringClass.Upper PROCEDURE () !,STRING ! Declare Procedure\r\n CODE\r\n RETURN Upper(SELF.Str())\r\nCStringClass.IndexOf PROCEDURE (STRING pLookIn, BYTE pCaseSensitive=TRUE) !,LONG ! Declare Procedure\r\n! Returns the index of the first parameter (pLookIn) is found within the SELF.CS\r\n! zero if it is not found\r\n CODE\r\n IF pCaseSensitive = TRUE\r\n RETURN InString(SELF.Str(), pLookIn, 1 , 1)\r\n ELSE\r\n RETURN InString(SELF.Lower(), Lower(pLookIn), 1 , 1)\r\n END\r\nCStringClass.FoundIn PROCEDURE (STRING pLookIn, BYTE pCaseSensitive=TRUE) !,BYTE ! Declare Procedure\r\n! Returns TRUE if the first parameter (pLookIn) is found within the SELF.CS\r\n! FALSE if it is no\r\n CODE\r\n IF SELF.IndexOf(pLookIn, pCaseSensitive) > 0\r\n RETURN TRUE\r\n ELSE\r\n RETURN FALSE\r\n END\r\nCStringClass.SetBuffer PROCEDURE (LONG pNewBuffer) ! Declare Procedure\r\n CODE\r\n SELF.bufferSize = pNewBuffer\r\nCStringClass.EscapeXml PROCEDURE () !,STRING ! Declare Procedure\r\nCS CStringClass\r\n CODE\r\n IF Omitted(pStr)=FALSE\r\n CS.Str(pStr)\r\n ELSE\r\n ! Make a copy so we don't alter the original\r\n CS.Str(SELF.Str())\r\n END\r\n CS.Replace('&', '&')\r\n CS.Replace('<', '<')\r\n CS.Replace('>', '>')\r\n CS.Replace('\"', '"')\r\n CS.Replace('''', ''')\r\n\r\n RETURN CS.Str()\r\n\r\n" }, { "path": "src/test/resources/samples/langs/Clarion/ConsoleSupport.clw", "content": " Member()\r\n Include('ConsoleSupport.inc'),ONCE\r\n\t Map\r\n MODULE('32-bit Windows API')\r\n ! General functions\r\n GetLastError(),DWORD,PASCAL\r\n \r\n ! Console functions\r\n GetStdHandle(DWORD),HANDLE,PASCAL,PROC,RAW\r\n WriteConsole(Handle,Long,Dword,long,long),bool,Raw,Pascal,name('WriteConsoleA')\r\n ReadConsole(Handle,Long,Dword,long,long),bool,Raw,Pascal,name('ReadConsoleA')\r\n SetConsoleTitle(Long),Bool,Raw,Pascal,name('SetConsoleTitleA')\r\n GetConsoleTitle(Long,dword),Bool,Raw,Pascal,name('GetConsoleTitleA')\r\n SetConsoleMode(Handle,dWord),BOOL,RAW,PASCAL\r\n GetConsoleMode(Handle,Long),BOOL,RAW,PASCAL\r\n End\r\n End \r\n \r\nConsoleSupport.Construct PROCEDURE\r\n\r\n CODE\r\n\r\nConsoleSupport.Destruct PROCEDURE\r\n\r\n CODE\r\n\r\nConsoleSupport.Init\t\t\t\t PROCEDURE () !,BYTE,VIRTUAL \r\n CODE\r\n\r\n SELF.OutputHandle = GetStdHandle(STD_OUTPUT_HANDLE)\r\n If SELF.OutputHandle = INVALID_HANDLE_VALUE\r\n Halt(1,'Unable to get output handle (' & GetLastError() & ')')\r\n RETURN INVALID_HANDLE_VALUE\r\n End\r\n \r\n SELF.InputHandle = GetStdHandle(STD_INPUT_HANDLE)\r\n if SELF.InputHandle = INVALID_HANDLE_VALUE\r\n Halt(2,'Unable to get console input handle (' & GetLastError() & ')')\r\n RETURN INVALID_HANDLE_VALUE\r\n End\r\n \r\n If ~SetConsoleMode(SELF.InputHandle,ENABLE_PROCESSED_INPUT )\r\n Halt(3,'Unable to set console mode (' & GetLastError() & ')')\r\n RETURN INVALID_OTHER\r\n End\r\n\r\n RETURN FALSE\r\n\r\nConsoleSupport.WriteLine\t\t\t PROCEDURE (STRING pText) !,BYTE,PROC,VIRTUAL \r\n CODE\r\n SELF.TextBuffer = SELF.Prefix & pText & '<13,10>'\r\n If WriteConsole(SELF.OutputHandle, ADDRESS(SELF.TextBuffer), LEN(SELF.TextBuffer),ADDRESS(SELF.BytesWritten), NULL) = 0\r\n Halt(4,'WriteConsoleError (' & GetLastError() & ')')\r\n RETURN -1\r\n End\r\n RETURN FALSE\r\n\r\nConsolesupport.ReadKey \t\t\t PROCEDURE () !,STRING,PROC,VIRTUAL \r\n CODE\r\n SELF.WriteLine('Press any key to continue...')\r\n Clear(SELF.InBuffer)\r\n Loop\r\n IF ReadConsole(SELF.InputHandle,Address(SELF.InBuffer),100,Address(SELF.BytesRead),NULL) = 0 THEN\r\n Halt(5,'Error on read console (' & GetLastError() & ')')\r\n Break\r\n End\r\n Until SELF.BytesRead > 0\r\n RETURN SELF.InBuffer" }, { "path": "src/test/resources/samples/langs/Clarion/HelloWorld.clw", "content": " PROGRAM\r\n\r\n MAP\r\n END\r\n\r\n CODE\r\n\r\n MESSAGE('Hello World!')\r\n\r\n RETURN" }, { "path": "src/test/resources/samples/langs/Clarion/hello.clw", "content": " MEMBER()\r\n INCLUDE('HelloClass.inc'),ONCE\r\n MAP\r\n END\r\n\r\nHelloClass.Construct PROCEDURE\r\n CODE\r\nHelloClass.Destruct PROCEDURE() !,VIRTUAL\r\n CODE\r\nHelloClass.SayHello PROCEDURE\r\n CODE\r\n MESSAGE('Hello World!')\r\n" }, { "path": "src/test/resources/samples/langs/Clean/GenHylo.dcl", "content": "definition module GenHylo\n\nimport StdGeneric, GenMap\n\n:: Fix f = In (f .(Fix f))\nOut :: !u:(Fix v:a) -> v:(a w:(Fix v:a)), [u <= w]\n\nhylo :: ((.f .b) -> .b) (.a -> (.f .a)) -> (.a -> .b) | gMap{|*->*|} f\ncata :: (u:(f .a) -> .a) -> (Fix u:f) -> .a | gMap{|*->*|} f\nana :: (.a -> u:(f .a)) -> .a -> (Fix u:f) | gMap{|*->*|} f\n\n" }, { "path": "src/test/resources/samples/langs/Clean/GenMap.dcl", "content": "definition module GenMap\n\nimport StdGeneric\n\ngeneric gMap a b :: .a -> .b\nderive gMap c, UNIT, PAIR, EITHER, CONS, FIELD, OBJECT, {}, {!} \n\nderive gMap [], (,), (,,), (,,,), (,,,,), (,,,,,), (,,,,,,), (,,,,,,,)\n\n" }, { "path": "src/test/resources/samples/langs/Clean/GenMap.icl", "content": "implementation module GenMap\n\nimport StdClass, StdArray, StdInt, StdFunc\nimport StdGeneric, _Array\n\ngeneric gMap a b :: .a -> .b\ngMap{|c|} x \t\t\t\t\t= x\ngMap{|UNIT|} x \t\t\t\t\t= x\ngMap{|PAIR|} fx fy (PAIR x y) \t= PAIR (fx x) (fy y) \ngMap{|EITHER|} fl fr (LEFT x) \t= LEFT (fl x)\ngMap{|EITHER|} fl fr (RIGHT x) \t= RIGHT (fr x)\ngMap{|CONS|} f (CONS x) \t\t= CONS (f x)\ngMap{|FIELD|} f (FIELD x) \t\t= FIELD (f x)\ngMap{|OBJECT|} f (OBJECT x) \t= OBJECT (f x)\ngMap{|{}|} f xs \t\t\t\t= mapArray f xs\ngMap{|{!}|} f xs\t\t\t\t= mapArray f xs\n\nderive gMap [], (,), (,,), (,,,), (,,,,), (,,,,,), (,,,,,,), (,,,,,,,)\n\n" }, { "path": "src/test/resources/samples/langs/Clean/fsieve.icl", "content": "module fsieve\n\n/*\nThe Fast Sieve of Eratosthenes.\n\nA sequential and optimized version of the sieve of Eratosthenes.\nThe program calculates a list of the first NrOfPrime primes.\nThe result of the program is the NrOfPrimes'th prime.\n\nStrictness annotations have been added because the strictness analyser\nis not able to deduce all strictness information. Removal of these !'s\nwill make the program about 20% slower.\n\nOn a machine without a math coprocessor the execution of this\nprogram might take a (very) long time. Set NrOfPrimes to a smaller value.\n*/\n\nimport StdClass; // RWS\nimport StdInt, StdReal\n \nNrOfPrimes :== 3000 \n\t\n//\tThe sieve algorithm: generate an infinite list of all primes.\n\nPrimes::[Int]\nPrimes = pr where pr = [5 : Sieve 7 4 pr]\n\nSieve::Int !Int [Int] -> [Int]\nSieve g i prs\n\t| IsPrime prs g (toInt (sqrt (toReal g)))\t= [g : Sieve` g i prs]\n\t\t\t\t\t\t\t\t\t\t\t\t= Sieve (g + i) (6 - i) prs\n\nSieve`::Int Int [Int] -> [Int]\nSieve` g i prs = Sieve (g + i) (6 - i) prs\n\nIsPrime::[Int] !Int Int -> Bool\nIsPrime [f:r] pr bd | f>bd \t\t\t= True\n\t\t\t\t\t| pr rem f==0\t= False\n\t\t\t\t\t\t\t\t\t= IsPrime r pr bd\n\t\t\t\t\t\t\t\t \n//\tSelect is used to get the NrOfPrimes'th prime from the infinite list.\n\nSelect::[x] Int -> x\nSelect [f:r] 1 = f\nSelect [f:r] n = Select r (n - 1)\n\n\n/*\tThe Start rule: Select the NrOfPrimes'th prime from the list of primes\n\tgenerated by Primes.\n*/\n\nStart::Int\nStart = Select [2, 3 : Primes] NrOfPrimes\n\n" }, { "path": "src/test/resources/samples/langs/Clean/sem.icl", "content": "module monadicSemantics\n\nimport StdEnv, StdGeneric, GenMap, GenHylo\n\n/* For fun I implemented the recursive datastructre Exp and Stm as fixpoints\n This helps us define recursive functions on them (only a little bit though)\n However deriving gMap for Fix did not works out of the box\n I had to remove some uniqueness typing in GenMap and GenHylo */\n:: Op = Plus | Minus | Times | Rem | Equal | LessThan\n:: Var :== String\n\n:: ExpP a = Int Int | Var Var | Op Op a a\n:: Exp :== Fix ExpP\n\n:: StmP a = Assign Var Exp | If Exp a a | While Exp a | Seq a a | Cont\n:: Stm :== Fix StmP\n\nderive gMap ExpP, StmP, Fix\n\n// Environment. Semantics is basically Env -> Env\n:: Env :== Var -> Int\n:: Sem :== Env -> (Int, Env)\nempty = \\v . 0\n\n// return\nrtn :: Int -> Sem\nrtn i = \\e. (i, e)\n\n// the usual bind\n(>>=) infixl 1 :: Sem (Int->Sem) -> Sem\n(>>=) x y = \\e. (\\(i,e2).y i e2) (x e)\n(>>|) infixl 1 :: Sem Sem -> Sem\n(>>|) x y = x >>= \\_. y\n\n// read variable from environment\nread :: Var -> Sem\nread v = \\e. (e v, e)\n\n// assign value to give variable in environment\nwrite :: Var Int -> Sem\nwrite v i = \\e. (i, \\w. if (w==v) i (e w))\n\n// semantics\nclass sem a :: a -> Sem\n\noperator :: Op -> Int -> Int -> Int\noperator Plus = (+)\noperator Minus = (-)\noperator Times = (*)\noperator Rem = rem\noperator Equal = \\x y . if (x==y) 1 0\noperator LessThan = \\x y . if (x< y) 1 0\n\n// semantics of expressions\ninstance sem Exp where\n\tsem x = cata phi x where\n\t\tphi (Int n) = rtn n\n\t\tphi (Var v) = read v\n\t\tphi (Op op x y) = x >>= \\v1. y >>= return o (operator op v1)\n\n// semantics of statments\n// NOTE: while will always return 0, as it might not even be executed\ninstance sem Stm where\n\tsem x = cata phi x where\n\t\tphi (Assign v e) = sem e >>= write v\n\t\tphi (If e s1 s2) = sem e >>= \\b . if (b<>0) s1 s2\n\t\tphi stm=:(While e s) = sem e >>= \\b . if (b<>0) (s >>| phi stm) (phi Cont)\n\t\tphi (Seq s1 s2) = s1 >>| s2 // Here the cata *finally* pays off :D\n\t\tphi Cont = rtn 0\n\n// convenience functions\nint = In o Int\nvar = In o Var\nop o = In o2 (Op o)\nassign = In o2 Assign\nifte e = In o2 (If e)\nwhile = In o2 While\nseq = In o2 Seq\ncont = In Cont\n\n// test case, also testing the new operator <\npEuclides =\n\twhile (op LessThan (int 0) (var \"b\"))(\n\t\tseq (assign \"r\" (op Rem (var \"a\") (var \"b\")))\n\t\t(seq (assign \"a\" (var \"b\"))\n\t\t( (assign \"b\" (var \"r\")))\n\t\t)\n\t)\n\nStart = fst (program start) where\n\tprogram = sem pEuclides >>| read \"a\"\n\tstart \"a\" = 9\n\tstart \"b\" = 12\n\tstart _ = 0\n\n// Helper\n(o2) infixr 9\n(o2) f g x :== f o (g x)\n\n" }, { "path": "src/test/resources/samples/langs/Clean/stack.dcl", "content": "definition module stack\n\n:: Stack a\n\nnewStack :: (Stack a)\npush :: a (Stack a) -> Stack a\npushes :: [a] (Stack a) -> Stack a\npop :: (Stack a) -> Stack a\npopn :: Int (Stack a) -> Stack a\ntop :: (Stack a) -> a\ntopn :: Int (Stack a) -> [a]\nelements :: (Stack a) -> [a]\ncount :: (Stack a) -> Int\n\n" }, { "path": "src/test/resources/samples/langs/Clean/stack.icl", "content": "implementation module stack\nimport StdEnv\n\n:: Stack a :== [a]\n\nnewStack :: (Stack a)\nnewStack = []\n\npush :: a (Stack a) -> Stack a\npush x s = [x:s]\n\npushes :: [a] (Stack a) -> Stack a\npushes x s = x ++ s\n\npop :: (Stack a) -> Stack a\npop [] = abort \"Cannot use pop on an empty stack\"\npop [e:s] = s\n\npopn :: Int (Stack a) -> Stack a\npopn n s = drop n s\n\ntop :: (Stack a) -> a\ntop [] = abort \"Cannot use top on an empty stack\"\ntop [e:s] = e\n\ntopn :: Int (Stack a) -> [a]\ntopn n s = take n s\nelements :: (Stack a) -> [a]\nelements s = s\n\ncount :: (Stack a) -> Int\ncount s = length s\n\n" }, { "path": "src/test/resources/samples/langs/Clean/streams.dcl", "content": "definition module streams\n\nimport StdEnv\n\ninstance zero [Real]\ninstance one [Real]\ninstance + [Real] \ninstance - [Real]\ninstance * [Real]\ninstance / [Real]\n\nX :: [Real]\ninvert :: [Real] -> [Real]\npow :: [Real] Int -> [Real]\n(shuffle) infixl 7 :: [Real] [Real] -> [Real]\n\n" }, { "path": "src/test/resources/samples/langs/Clean/streams.icl", "content": "implementation module streams\n\nimport StdEnv\n\ninstance zero [Real]\nwhere\n zero = [] //Infinite row of zeroes represented as empty list to ease computation\n\ninstance one [Real]\nwhere\n one = [1.0:zero]\n\ninstance + [Real]\nwhere\n (+) [s:s`] [t:t`] = [s+t:s`+t`]\n (+) [s:s`] [] = [s:s`]\n (+) [] [t:t`] = [t:t`]\n (+) [] [] = []\n \ninstance - [Real]\nwhere\n (-) [s:s`] [t:t`] = [s-t:s`-t`]\n (-) [s:s`] [] = [s:s`]\n (-) [] [t:t`] = [-1.0] * [t:t`]\n (-) [] [] = []\n\ninstance * [Real]\nwhere\n (*) [s:s`] [t:t`] = [s*t:s`*[t:t`]+[s]*t`]\n (*) _ _ = []\n\ninstance / [Real]\nwhere\n (/) s t = s * (invert t)\n\nX :: [Real]\nX = [0.0:one]\n\ninvert :: [Real] -> [Real]\ninvert [s:s`] = [1.0/s:(invert [s:s`]) * s` * [-1.0/s]]\n\npow :: [Real] Int -> [Real]\npow s 0 = one\npow s n = s * pow s (n-1)\n\n(shuffle) infixl 7 :: [Real] [Real] -> [Real]\n(shuffle) [s:s`] [t:t`] = [s*t:s` shuffle [t:t`] + [s:s`] shuffle t`]\n(shuffle) _ _ = []\n\n" }, { "path": "src/test/resources/samples/langs/Click/sr2.click", "content": "rates :: AvailableRates\nelementclass sr2 {\n $sr2_ip, $sr2_nm, $wireless_mac, $gateway, $probes|\n\n\narp :: ARPTable();\nlt :: LinkTable(IP $sr2_ip);\n\n\ngw :: SR2GatewaySelector(ETHTYPE 0x062c,\n\t\t IP $sr2_ip,\n\t\t ETH $wireless_mac,\n\t\t LT lt,\n\t\t ARP arp,\n\t\t PERIOD 15,\n\t\t GW $gateway);\n\n\ngw -> SR2SetChecksum -> [0] output;\n\nset_gw :: SR2SetGateway(SEL gw);\n\n\nes :: SR2ETTStat(ETHTYPE 0x0641, \n\t ETH $wireless_mac, \n\t IP $sr2_ip, \n\t PERIOD 30000,\n\t TAU 300000,\n\t ARP arp,\n\t PROBES $probes,\n\t ETT metric,\n\t RT rates);\n\n\nmetric :: SR2ETTMetric(LT lt);\n\n\nforwarder :: SR2Forwarder(ETHTYPE 0x0643, \n\t\t\t IP $sr2_ip, \n\t\t\t ETH $wireless_mac, \n\t\t\t ARP arp, \n\t\t\t LT lt);\n\n\nquerier :: SR2Querier(ETH $wireless_mac, \n\t\t SR forwarder,\n\t\t LT lt, \n\t\t ROUTE_DAMPENING true,\n\t\t TIME_BEFORE_SWITCH 5,\n\t\t DEBUG true);\n\n\nquery_forwarder :: SR2MetricFlood(ETHTYPE 0x0644,\n\t\t\t IP $sr2_ip, \n\t\t\t ETH $wireless_mac, \n\t\t\t LT lt, \n\t\t\t ARP arp,\n\t\t\t DEBUG false);\n\nquery_responder :: SR2QueryResponder(ETHTYPE 0x0645,\n\t\t\t\t IP $sr2_ip, \n\t\t\t\t ETH $wireless_mac, \n\t\t\t\t LT lt, \n\t\t\t\t ARP arp,\n\t\t\t\t DEBUG true);\n\n\nquery_responder -> SR2SetChecksum -> [0] output;\nquery_forwarder -> SR2SetChecksum -> SR2Print(forwarding) -> [0] output;\nquery_forwarder [1] -> query_responder;\n\ndata_ck :: SR2SetChecksum() \n\ninput [1] \n-> host_cl :: IPClassifier(dst net $sr2_ip mask $sr2_nm,\n\t\t\t\t-)\n-> querier\n-> data_ck;\n\n\nhost_cl [1] -> [0] set_gw [0] -> querier;\n\nforwarder[0] \n -> dt ::DecIPTTL\n -> data_ck\n -> [2] output;\n\n\ndt[1] \n-> Print(ttl-error) \n-> ICMPError($sr2_ip, timeexceeded, 0) \n-> querier;\n\n\n// queries\nquerier [1] -> [1] query_forwarder;\nes -> SetTimestamp() -> [1] output;\n\n\nforwarder[1] //ip packets to me\n -> SR2StripHeader()\n -> CheckIPHeader()\n -> from_gw_cl :: IPClassifier(src net $sr2_ip mask $sr2_nm,\n\t\t\t\t-)\n -> [3] output;\n\nfrom_gw_cl [1] -> [1] set_gw [1] -> [3] output;\n\n input [0]\n -> ncl :: Classifier(\n\t\t\t12/0643 , //sr2_forwarder\n\t\t\t12/0644 , //sr2\n\t\t\t12/0645 , //replies\n\t\t\t12/0641 , //sr2_es\n\t\t\t12/062c , //sr2_gw\n\t\t\t);\n \n \n ncl[0] -> SR2CheckHeader() -> [0] forwarder;\n ncl[1] -> SR2CheckHeader() -> PrintSR(query) -> query_forwarder\n ncl[2] -> SR2CheckHeader() -> query_responder;\n ncl[3] -> es;\n ncl[4] -> SR2CheckHeader() -> gw;\n \n}\n\n\n\nIdle -> s :: sr2(2.0.0.1, 255.0.0.0, 00:00:00:00:00:01, false, \"12 60 12 1500\") -> Discard;\nIdle -> [1] s;\ns[1] -> Discard;\ns[2] -> Discard;\ns[3] -> Discard;\n" }, { "path": "src/test/resources/samples/langs/Click/thomer-nat.click", "content": "// This Click configuration implements a firewall and NAT, roughly based on the\n// mazu-nat.click example.\n//\n// This example assumes there is one interface that is IP-aliased. In this\n// example, eth0 and eth0:0 have IP addresses 66.68.65.90 and 192.168.1.1,\n// respectively. There is a local network, 192.168.1.0/24, and an upstream\n// gateway, 66.58.65.89. Traffic from the local network is NATed.\n//\n// Connections can be initiated from the NAT box itself, also.\n// \n// For bugs, suggestions, and, corrections, please email me.\n//\n// Author: Thomer M. Gil (click@thomer.com)\n\nAddressInfo(\n eth0-in 192.168.1.1 192.168.1.0/24 00:0d:87:9d:1c:e9,\n eth0-ex 66.58.65.90 00:0d:87:9d:1c:e9,\n gw-addr 66.58.65.89 00:20:6f:14:54:c2\n);\n\n\nelementclass SniffGatewayDevice {\n $device |\n from :: FromDevice($device)\n -> t1 :: Tee\n -> output;\n input -> q :: Queue(1024)\n -> t2 :: PullTee\n -> to :: ToDevice($device);\n t1[1] -> ToHostSniffers;\n t2[1] -> ToHostSniffers($device);\n ScheduleInfo(from .1, to 1);\n}\n\n\ndevice :: SniffGatewayDevice(eth0);\narpq_in :: ARPQuerier(eth0-in) -> device;\nip_to_extern :: GetIPAddress(16)\n -> CheckIPHeader\n -> EtherEncap(0x800, eth0-ex, gw-addr)\n -> device;\nip_to_host :: EtherEncap(0x800, gw-addr, eth0-ex)\n -> ToHost;\nip_to_intern :: GetIPAddress(16)\n -> CheckIPHeader\n -> arpq_in;\n\n \narp_class :: Classifier(\n 12/0806 20/0001, // [0] ARP requests\n 12/0806 20/0002, // [1] ARP replies to host\n 12/0800); // [2] IP packets\n\ndevice -> arp_class;\n\n// ARP crap\narp_class[0] -> ARPResponder(eth0-in, eth0-ex) -> device;\narp_class[1] -> arp_t :: Tee;\n arp_t[0] -> ToHost;\n arp_t[1] -> [1]arpq_in;\n\n\n// IP packets\narp_class[2] -> Strip(14)\n -> CheckIPHeader\n -> ipclass :: IPClassifier(dst host eth0-ex,\n dst host eth0-in,\n src net eth0-in);\n\n// Define pattern NAT\niprw :: IPRewriterPatterns(NAT eth0-ex 50000-65535 - -);\n\n// Rewriting rules for UDP/TCP packets\n// output[0] rewritten to go into the wild\n// output[1] rewritten to come back from the wild or no match\nrw :: IPRewriter(pattern NAT 0 1,\n pass 1);\n\n// Rewriting rules for ICMP packets\nirw :: ICMPPingRewriter(eth0-ex, -);\nirw[0] -> ip_to_extern;\nirw[1] -> icmp_me_or_intern :: IPClassifier(dst host eth0-ex, -);\n icmp_me_or_intern[0] -> ip_to_host;\n icmp_me_or_intern[1] -> ip_to_intern;\n\n// Rewriting rules for ICMP error packets\nierw :: ICMPRewriter(rw irw);\nierw[0] -> icmp_me_or_intern;\nierw[1] -> icmp_me_or_intern;\n\n\n// Packets directed at eth0-ex.\n// Send it through IPRewriter(pass). If there was a mapping, it will be\n// rewritten such that dst is eth0-in:net, otherwise dst will still be for\n// eth0-ex.\nipclass[0] -> [1]rw;\n\n// packets that were rewritten, heading into the wild world.\nrw[0] -> ip_to_extern;\n\n// packets that come back from the wild or are not part of an established\n// connection.\nrw[1] -> established_class :: IPClassifier(dst host eth0-ex,\n dst net eth0-in);\n\n // not established yet or returning packets for a connection that was\n // established from this host itself.\n established_class[0] ->\n firewall :: IPClassifier(dst tcp port ssh,\n dst tcp port smtp,\n dst tcp port domain,\n dst udp port domain,\n icmp type echo-reply,\n proto icmp,\n port > 4095,\n -);\n\n firewall[0] -> ip_to_host; // ssh\n firewall[1] -> ip_to_host; // smtp\n firewall[2] -> ip_to_host; // domain (t)\n firewall[3] -> ip_to_host; // domain (u)\n firewall[4] -> [0]irw; // icmp reply\n firewall[5] -> [0]ierw; // other icmp\n firewall[6] -> ip_to_host; // port > 4095, probably for connection\n // originating from host itself\n firewall[7] -> Discard; // don't allow incoming for port <= 4095\n\n // established connection\n established_class[1] -> ip_to_intern;\n\n// To eth0-in. Only accept from inside network.\nipclass[1] -> IPClassifier(src net eth0-in) -> ip_to_host;\n\n// Packets from eth0-in:net either stay on local network or go to the wild.\n// Those that go into the wild need to go through the appropriate rewriting\n// element. (Either UDP/TCP rewriter or ICMP rewriter.)\nipclass[2] -> inter_class :: IPClassifier(dst net eth0-in, -);\n inter_class[0] -> ip_to_intern;\n inter_class[1] -> ip_udp_class :: IPClassifier(tcp or udp,\n icmp type echo);\n ip_udp_class[0] -> [0]rw;\n ip_udp_class[1] -> [0]irw;\n" }, { "path": "src/test/resources/samples/langs/Clojure/build.boot", "content": ";; from: https://github.com/boot-clj/boot#configure-task-options\n\n(set-env!\n :source-paths #{\"src\"}\n :dependencies '[[me.raynes/conch \"0.8.0\"]])\n\n(task-options!\n pom {:project 'my-project\n :version \"0.1.0\"}\n jar {:manifest {\"Foo\" \"bar\"}})\n\n(deftask build\n \"Build my project.\"\n []\n (comp (pom) (jar) (install)))\n" }, { "path": "src/test/resources/samples/langs/Clojure/for.clj", "content": "(defn prime? [n]\n (not-any? zero? (map #(rem n %) (range 2 n))))\n\n(range 3 33 2)\n'(3 5 7 9 11 13 15 17 19 21 23 25 27 29 31)\n\n;; :when continues through the collection even if some have the\n;; condition evaluate to false, like filter\n(for [x (range 3 33 2) :when (prime? x)]\n x)\n'(3 5 7 11 13 17 19 23 29 31)\n\n;; :while stops at the first collection element that evaluates to\n;; false, like take-while\n(for [x (range 3 33 2) :while (prime? x)]\n x)\n'(3 5 7)\n" }, { "path": "src/test/resources/samples/langs/Clojure/hiccup.hic", "content": "[:html\n [:head\n [:meta {:charset \"utf-8\"}]\n [:link {:rel \"stylesheet\" :href \"css/bootstrap.min.css\"}]\n [:script {:src \"app.js\"}]]\n [:body\n [:div.nav\n [:p \"Hello world!\"]]]]\n" }, { "path": "src/test/resources/samples/langs/Clojure/index.cljs.hl", "content": ";; Copyright (c) Alan Dipert and Micha Niskin. All rights reserved.\n;; The use and distribution terms for this software are covered by the\n;; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n;; which can be found in the file epl-v10.html at the root of this distribution.\n;; By using this software in any fashion, you are agreeing to be bound by\n;; the terms of this license.\n;; You must not remove this notice, or any other, from this software.\n\n(page \"index.html\"\n (:refer-clojure :exclude [nth])\n (:require\n [tailrecursion.hoplon.reload :refer [reload-all]]\n [tailrecursion.hoplon.util :refer [nth name pluralize]]\n [tailrecursion.hoplon.storage-atom :refer [local-storage]]))\n\n;; utility functions ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(declare route state editing)\n\n(reload-all)\n\n(def mapvi (comp vec map-indexed))\n\n(defn dissocv [v i]\n (let [z (- (dec (count v)) i)]\n (cond (neg? z) v\n (zero? z) (pop v)\n (pos? z) (into (subvec v 0 i) (subvec v (inc i))))))\n\n(defn decorate [todo route editing i]\n (let [{done? :completed text :text} todo]\n (-> todo (assoc :editing (= editing i)\n :visible (and (not (empty? text))\n (or (= \"#/\" route)\n (and (= \"#/active\" route) (not done?))\n (and (= \"#/completed\" route) done?)))))))\n\n;; persisted state cell (AKA: stem cell) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(def state (-> (cell []) (local-storage ::store)))\n\n;; local state cells ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(defc loaded? false)\n(defc editing nil)\n(def route (route-cell \"#/\"))\n\n;; formula cells (computed state) ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(defc= completed (filter :completed state))\n(defc= active (remove :completed state))\n(defc= plural-item (pluralize \"item\" (count active)))\n(defc= todos (mapvi #(list %1 (decorate %2 route editing %1)) state))\n\n;; state transition functions ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(defn todo [t] {:completed false :text t})\n(defn destroy! [i] (swap! state dissocv i))\n(defn done! [i v] (swap! state assoc-in [i :completed] v))\n(defn clear-done! [& _] (swap! state #(vec (remove :completed %))))\n(defn new! [t] (when (not (empty? t)) (swap! state conj (todo t))))\n(defn all-done! [v] (swap! state #(mapv (fn [x] (assoc x :completed v)) %)))\n(defn editing! [i v] (reset! editing (if v i nil)))\n(defn text! [i v] (if (empty? v) (destroy! i) (swap! state assoc-in [i :text] v)))\n\n;; page ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(html :lang \"en\"\n (head\n (meta :charset \"utf-8\")\n (meta :http-equiv \"X-UA-Compatible\" :content \"IE=edge,chrome=1\")\n (link :rel \"stylesheet\" :href \"base.css\")\n (title \"Hoplon • TodoMVC\"))\n (body\n (noscript\n (div :id \"noscript\"\n (p \"JavaScript is required to view this page.\")))\n (div\n (section :id \"todoapp\"\n (header :id \"header\"\n (h1 \"todos\")\n (form :on-submit #(do (new! (val-id :new-todo))\n (do! (by-id :new-todo) :value \"\"))\n (input\n :id \"new-todo\"\n :type \"text\"\n :autofocus true\n :placeholder \"What needs to be done?\"\n :on-blur #(do! (by-id :new-todo) :value \"\"))))\n (section\n :id \"main\"\n :do-toggle (cell= (not (and (empty? active) (empty? completed))))\n (input\n :id \"toggle-all\"\n :type \"checkbox\"\n :do-attr (cell= {:checked (empty? active)}) \n :on-click #(all-done! (val-id :toggle-all)))\n (label :for \"toggle-all\"\n \"Mark all as complete\")\n (ul :id \"todo-list\"\n (loop-tpl\n :reverse true\n :bind-ids [done# edit#]\n :bindings [[i {edit? :editing done? :completed todo-text :text show? :visible}] todos] \n (li\n :do-class (cell= {:completed done? :editing edit?}) \n :do-toggle show?\n (div :class \"view\" :on-dblclick #(editing! @i true)\n (input\n :id done# \n :type \"checkbox\"\n :class \"toggle\"\n :do-attr (cell= {:checked done?}) \n :on-click #(done! @i (val-id done#)))\n (label (text \"~{todo-text}\"))\n (button\n :type \"submit\"\n :class \"destroy\"\n :on-click #(destroy! @i)))\n (form :on-submit #(editing! @i false)\n (input\n :id edit#\n :type \"text\"\n :class \"edit\"\n :do-value todo-text\n :do-focus edit?\n :on-blur #(when @edit? (editing! @i false))\n :on-change #(when @edit? (text! @i (val-id edit#)))))))))\n (footer \n :id \"footer\"\n :do-toggle (cell= (not (and (empty? active) (empty? completed))))\n (span :id \"todo-count\"\n (strong (text \"~(count active) \"))\n (span (text \"~{plural-item} left\")))\n (ul :id \"filters\"\n (li (a :href \"#/\" :do-class (cell= {:selected (= \"#/\" route)}) \"All\"))\n (li (a :href \"#/active\" :do-class (cell= {:selected (= \"#/active\" route)}) \"Active\"))\n (li (a :href \"#/completed\" :do-class (cell= {:selected (= \"#/completed\" route)}) \"Completed\")))\n (button\n :type \"submit\"\n :id \"clear-completed\"\n :on-click #(clear-done!)\n (text \"Clear completed (~(count completed))\"))))\n (footer :id \"info\" \n (p \"Double-click to edit a todo\")\n (p \"Part of \" (a :href \"http://github.com/tailrecursion/hoplon-demos/\" \"hoplon-demos\")))))) \n" }, { "path": "src/test/resources/samples/langs/Clojure/into-array.cljc", "content": "(defn into-array\n ([aseq]\n (into-array nil aseq))\n ([type aseq]\n (let [n (count aseq)\n a (make-array n)]\n (loop [aseq (seq aseq)\n i 0]\n (if (< i n)\n (do\n (aset a i (first aseq))\n (recur (next aseq) (inc i)))\n a)))))\n" }, { "path": "src/test/resources/samples/langs/Clojure/protocol.cljs", "content": "(defprotocol ISound (sound []))\n \n(deftype Cat []\n ISound\n (sound [_] \"Meow!\"))\n \n(deftype Dog []\n ISound\n (sound [_] \"Woof!\"))\n \n(extend-type default\n ISound\n (sound [_] \"... silence ...\"))\n \n(sound 1) ;; => \"... silence ...\"\n" }, { "path": "src/test/resources/samples/langs/Clojure/rand.cljscm", "content": "(defn rand\n \"Returns a random floating point number between 0 (inclusive) and\n n (default 1) (exclusive).\"\n ([] (scm* [n] (random-real)))\n ([n] (* (rand) n)))" }, { "path": "src/test/resources/samples/langs/Clojure/svg.cljx", "content": "^:clj (ns c2.svg\n (:use [c2.core :only [unify]]\n [c2.maths :only [Pi Tau radians-per-degree\n sin cos mean]]))\n\n^:cljs (ns c2.svg\n (:use [c2.core :only [unify]]\n [c2.maths :only [Pi Tau radians-per-degree\n sin cos mean]])\n (:require [c2.dom :as dom]))\n\n;;Stub for float fn, which does not exist on cljs runtime\n^:cljs (def float identity)\n\n(defn ->xy\n \"Convert coordinates (potentially map of `{:x :y}`) to 2-vector.\"\n [coordinates]\n (cond\n (and (vector? coordinates) (= 2 (count coordinates))) coordinates\n (map? coordinates) [(:x coordinates) (:y coordinates)]))\n" }, { "path": "src/test/resources/samples/langs/Clojure/unit-test.cl2", "content": "(deftest function-tests\n (is (= 3\n (count [1 2 3])))\n (is (= false\n (not true)))\n (is (= true\n (contains? {:foo 1 :bar 2} :foo)))\n\n (is (= {\"foo\" 1, \"baz\" 3}\n (select-keys {:foo 1 :bar 2 :baz 3} [:foo :baz])))\n\n (is (= [1 2 3]\n (vals {:foo 1 :bar 2 :baz 3})))\n\n (is (= [\"foo\" \"bar\" \"baz\"]\n (keys {:foo 1 :bar 2 :baz 3})))\n\n (is (= [2 4 6]\n (filter (fn [x] (=== (rem x 2) 0)) [1 2 3 4 5 6]))))\n\n" }, { "path": "src/test/resources/samples/langs/Closure Templates/example.soy", "content": "{namespace Exmaple}\n\n/**\n * Example\n */\n{template .foo}\n {@param count: string}\n {@param? name: int}\n\n {if isNonnull($name)}\n

{$name}

\n {/if}\n\n
\n {switch count}\n {case 0}\n {call Empty.view}\n {param count: $count /}\n {/call}\n {default}\n

Wow, so many!

\n {/switch}\n
\n{/template}\n" }, { "path": "src/test/resources/samples/langs/CoNLL-U/CF1.conllu", "content": "# text = PT no governo\n# source = CETENFolha n=1 cad=Opinião sec=opi sem=94a\n# sent_id = CF1-1\n# id = 1\n1\tPT\tPT\tPROPN\tPROP|M|S|@NPHR\tGender=Masc|Number=Sing\t0\troot\t_\t_\n2-3\tno\t_\t_\t_\t_\t_\t_\t_\t_\n2\tem\tem\tADP\t|PRP|@N<\t_\t4\tcase\t_\t_\n3\to\to\tDET\t<-sam>||ART|M|S|@>N\tDefinite=Def|Gender=Masc|Number=Sing|PronType=Art\t4\tdet\t_\t_\n4\tgoverno\tgoverno\tNOUN\t|N|M|S|@P<\tGender=Masc|Number=Sing\t1\tnmod\t_\t_\n\n# text = BRASÍLIA Pesquisa Datafolha publicada hoje revela um dado supreendente: recusando uma postura radical, a esmagadora maioria (77%) dos eleitores quer o PT participando do Governo Fernando Henrique Cardoso.\n# source = CETENFolha n=1 cad=Opinião sec=opi sem=94a &W\n# sent_id = CF1-3\n# id = 2\n1\tBRASÍLIA\tBrasília\tPROPN\tPROP|F|S|@ADVL>\tGender=Fem|Number=Sing\t6\tdep\t_\t_\n2\tPesquisa\tPesquisa\tPROPN\t_\tGender=Fem|Number=Sing\t6\tnsubj\t_\tChangedBy=Issue119|MWE=Pesquisa_Datafolha|MWEPOS=PROPN\n3\tDatafolha\tDatafolha\tPROPN\t_\tNumber=Sing\t2\tflat:name\t_\tChangedBy=Issue119\n4\tpublicada\tpublicar\tVERB\t|V|PCP|F|S|@ICL-N<\tGender=Fem|Number=Sing|VerbForm=Part\t2\tacl\t_\t_\n5\thoje\thoje\tADV\tADV|@|V|PR|3S|IND|@FS-STA\tMood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin\t0\troot\t_\t_\n7\tum\tum\tDET\t|ART|M|S|@>N\tDefinite=Ind|Gender=Masc|Number=Sing|PronType=Art\t8\tdet\t_\t_\n8\tdado\tdado\tNOUN\t|N|M|S|@|V|GER|@ICL-ADVL>\tVerbForm=Ger\t26\tadvcl\t_\t_\n12\tuma\tum\tDET\t|ART|F|S|@>N\tDefinite=Ind|Gender=Fem|Number=Sing|PronType=Art\t13\tdet\t_\t_\n13\tpostura\tpostura\tNOUN\t|N|F|S|@|ART|F|S|@>N\tDefinite=Def|Gender=Fem|Number=Sing|PronType=Art\t18\tdet\t_\t_\n17\tesmagadora\tesmagador\tADJ\tADJ|F|S|@>N\tGender=Fem|Number=Sing\t18\tamod\t_\t_\n18\tmaioria\tmaioria\tNOUN\t|N|F|S|@SUBJ>\tGender=Fem|Number=Sing\t26\tnsubj\t_\t_\n19\t(\t(\tPUNCT\tPU|@PU\t_\t21\tpunct\t_\tChangedBy=Issue165|SpaceAfter=No\n20\t77\t77\tNUM\t|NUM|M|P|@>N\tNumType=Card\t21\tnummod\t_\tChangedBy=Issue165|ChangedBy=Issue168|SpaceAfter=No\n21\t%\t%\tSYM\t|N|M|P|@N|PRP|@N<\t_\t25\tcase\t_\t_\n24\tos\to\tDET\t<-sam>||ART|M|P|@>N\tDefinite=Def|Gender=Masc|Number=Plur|PronType=Art\t25\tdet\t_\t_\n25\teleitores\teleitor\tNOUN\t|N|M|P|@P<\tGender=Masc|Number=Plur\t18\tnmod\t_\t_\n26\tquer\tquerer\tVERB\t|V|PR|3S|IND|@FS-N|ART|M|S|@>N\tDefinite=Def|Gender=Masc|Number=Sing|PronType=Art\t28\tdet\t_\t_\n28\tPT\tPT\tPROPN\tPROP|M|S|@|V|GER|@ICL-|PRP|@||ART|M|S|@>N\tDefinite=Def|Gender=Masc|Number=Sing|PronType=Art\t32\tdet\t_\t_\n32\tGoverno\tgoverno\tNOUN\t||N|M|S|@P<\tGender=Masc|Number=Sing\t29\tobl\t_\t_\n33\tFernando\tFernando\tPROPN\t_\tGender=Masc|Number=Sing\t32\tnmod\t_\tChangedBy=Issue119|MWE=Fernando_Henrique_Cardoso|MWEPOS=PROPN\n34\tHenrique\tHenrique\tPROPN\t_\tNumber=Sing\t33\tflat:name\t_\tChangedBy=Issue119\n35\tCardoso\tCardoso\tPROPN\t_\tNumber=Sing\t33\tflat:name\t_\tSpaceAfter=No\n36\t.\t.\tPUNCT\tPU|@PU\t_\t6\tpunct\t_\t_\n\n# text = Tem sentido -- aliás, muitíssimo sentido.\n# source = CETENFolha n=1 cad=Opinião sec=opi sem=94a &D\n# sent_id = CF1-4\n# id = 3\n1\tTem\tter\tVERB\t|V|PR|3S|IND|@FS-STA\tMood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin\t0\troot\t_\t_\n2\tsentido\tsentido\tNOUN\t|N|M|S|@|ADV|@||DET|M|S|@>N\tGender=Masc|Number=Sing|PronType=Ind\t7\tdet\t_\t_\n7\tsentido\tsentido\tNOUN\t|N|M|S|@N|ADV|@>A\t_\t2\tadvmod\t_\t_\n2\tmais\tmais\tADV\t|||ADV|@ADVL>\t_\t22\tadvmod\t_\t_\n3-4\tdo\t_\t_\t_\t_\t_\t_\t_\t_\n3\tde\tde\tADP\t|PRP|@COM\t_\t8\tcase\t_\t_\n4\to\to\tPRON\t|<-sam>|DET|M|S|@P<\tGender=Masc|Number=Sing|PronType=Dem\t3\tfixed\t_\t_\n5\tque\tque\tPRON\t|INDP|M|S|@N<\tGender=Masc|Number=Sing|PronType=Rel\t3\tfixed\t_\t_\n6-7\tnos\t_\t_\t_\t_\t_\t_\t_\t_\n6\tem\tem\tADP\t||PRP|@KOMP<\t_\t8\tcase\t_\t_\n7\tos\to\tDET\t<-sam>||ART|M|P|@>N\tDefinite=Def|Gender=Masc|Number=Plur|PronType=Art\t8\tdet\t_\t_\n8\ttempos\ttempo\tNOUN\t||N|M|P|@P<\tGender=Masc|Number=Plur\t2\tobl\t_\t_\n9-10\tna\t_\t_\t_\t_\t_\t_\t_\t_\n9\tem\tem\tADP\t|PRP|@N<\t_\t11\tcase\t_\t_\n10\ta\to\tDET\t<-sam>||ART|F|S|@>N\tDefinite=Def|Gender=Fem|Number=Sing|PronType=Art\t11\tdet\t_\t_\n11\tditadura\tditadura\tNOUN\t|N|F|S|@P<\tGender=Fem|Number=Sing\t8\tnmod\t_\tChangedBy=Issue165|SpaceAfter=No\n12\t,\t,\tPUNCT\tPU|@PU\t_\t2\tpunct\t_\t_\n13\ta\to\tDET\t|ART|F|S|@>N\tDefinite=Def|Gender=Fem|Number=Sing|PronType=Art\t14\tdet\t_\t_\n14\tsolidez\tsolidez\tNOUN\t|N|F|S|@SUBJ>\tGender=Fem|Number=Sing\t22\tnsubj\t_\t_\n15-16\tdo\t_\t_\t_\t_\t_\t_\t_\t_\n15\tde\tde\tADP\t|PRP|@N<\t_\t17\tcase\t_\t_\n16\to\to\tDET\t<-sam>||ART|M|S|@>N\tDefinite=Def|Gender=Masc|Number=Sing|PronType=Art\t17\tdet\t_\t_\n17\tPT\tPT\tPROPN\tPROP|M|S|@P<\tGender=Masc|Number=Sing\t14\tnmod\t_\t_\n18\testá\testar\tAUX\t|V|PR|3S|IND|@FS-STA\tMood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin\t22\tcop\t_\tChangedBy=Issue165|ChangedBy=Issue167|SpaceAfter=No\n19\t,\t,\tPUNCT\tPU|@PU\t_\t20\tpunct\t_\t_\n20\tagora\tagora\tADV\t|ADV|@|V|PCP|F|S|@ICL-|KC|@CO\t_\t2\tcc\t_\t_\n2\tLula\tLula\tPROPN\t|PROP|M|S|@SUBJ>\tGender=Masc|Number=Sing\t7\tnsubj\t_\t_\n3\tnem\tnem\tCCONJ\t||KC|@CO\t_\t5\tcc\t_\t_\n4\to\to\tDET\t|ART|M|S|@>N\tDefinite=Def|Gender=Masc|Number=Sing|PronType=Art\t5\tdet\t_\t_\n5\tpartido\tpartido\tNOUN\t||N|M|S|@SUBJ>\tGender=Masc|Number=Sing\t2\tconj\t_\t_\n6\tainda\tainda\tADV\tADV|@ADVL>\t_\t7\tadvmod\t_\t_\n7\tencontraram\tencontrar\tVERB\t|V|PS/MQP|3P|IND|@FS-STA\tMood=Ind|Number=Plur|Person=3|VerbForm=Fin\t0\troot\t_\t_\n8\tum\tum\tDET\t_\tDefinite=Ind|Gender=Masc|Number=Sing|PronType=Art\t9\tdet\t_\t_\n9\tdiscurso\tdiscurso\tNOUN\t|N|M|S|@-PASS\tCase=Acc|Gender=Masc|Number=Sing|Person=3|PronType=Prs\t12\texpl\t_\tChangedBy=Issue135\n12\tdiferenciar\tdiferenciar\tVERB\t_\tVerbForm=Inf\t9\tacl\t_\tChangedBy=Issue165|SpaceAfter=No\n13\t.\t.\tPUNCT\tPU|@PU\t_\t7\tpunct\t_\t_\n\n# text = Eles se dizem oposição, mas ainda não informaram o que vão combater.\n# source = CETENFolha n=1 cad=Opinião sec=opi sem=94a\n# sent_id = CF1-7\n# id = 6\n1\tEles\teles\tPRON\tPERS|M|3P|NOM|@SUBJ>\tCase=Nom|Gender=Masc|Number=Plur|Person=3|PronType=Prs\t3\tnsubj\t_\t_\n2\tse\tse\tPRON\tPERS|M|3P|ACC|@ACC>-PASS\tCase=Acc|Gender=Masc|Number=Plur|Person=3|PronType=Prs\t3\texpl\t_\tChangedBy=Issue135\n3\tdizem\tdizer\tVERB\t|||V|PR|3P|IND|@FS-STA\tMood=Ind|Number=Plur|Person=3|Tense=Pres|VerbForm=Fin\t0\troot\t_\t_\n4\toposição\toposição\tNOUN\t|N|F|S|@|KC|@CO\t_\t9\tcc\t_\t_\n7\tainda\tainda\tADV\tADV|@>A\t_\t8\tadvmod\t_\t_\n8\tnão\tnão\tADV\t_\tPolarity=Neg\t9\tadvmod\t_\t_\n9\tinformaram\tinformar\tVERB\t||V|PS/MQP|3P|IND|@FS-STA\tMood=Ind|Number=Plur|Person=3|VerbForm=Fin\t3\tconj\t_\t_\n10\to\to\tPRON\t_\tGender=Masc|Number=Sing|PronType=Dem\t11\tdet\t_\t_\n11\tque\tque\tPRON\t|INDP|M|S|@ACC>\tGender=Masc|Number=Sing|PronType=Int\t13\tobj\t_\t_\n12\tvão\tir\tAUX\t|V|PR|3P|IND|@FS-|V|INF|@ICL-AUX<\tVerbForm=Inf\t9\tccomp\t_\tChangedBy=Issue165|SpaceAfter=No\n14\t.\t.\tPUNCT\tPU|@PU\t_\t3\tpunct\t_\t_\n\n# text = Muitas das prioridades do novo governo coincidem com as prioridades do PT.\n# source = CETENFolha n=1 cad=Opinião sec=opi sem=94a\n# sent_id = CF1-8\n# id = 7\n1\tMuitas\tmuito\tPRON\t|DET|F|P|@SUBJ>\tGender=Fem|Number=Plur|PronType=Ind\t9\tnsubj\t_\t_\n2-3\tdas\t_\t_\t_\t_\t_\t_\t_\t_\n2\tde\tde\tADP\t|PRP|@N<\t_\t4\tcase\t_\t_\n3\tas\to\tDET\t<-sam>||ART|F|P|@>N\tDefinite=Def|Gender=Fem|Number=Plur|PronType=Art\t4\tdet\t_\t_\n4\tprioridades\tprioridade\tNOUN\t|N|F|P|@P<\tGender=Fem|Number=Plur\t1\tnmod\t_\t_\n5-6\tdo\t_\t_\t_\t_\t_\t_\t_\t_\n5\tde\tde\tADP\t|PRP|@N<\t_\t8\tcase\t_\t_\n6\to\to\tDET\t<-sam>||ART|M|S|@>N\tDefinite=Def|Gender=Masc|Number=Sing|PronType=Art\t8\tdet\t_\t_\n7\tnovo\tnovo\tADJ\tADJ|M|S|@>N\tGender=Masc|Number=Sing\t8\tamod\t_\t_\n8\tgoverno\tgoverno\tNOUN\t|N|M|S|@P<\tGender=Masc|Number=Sing\t4\tnmod\t_\t_\n9\tcoincidem\tcoincidir\tVERB\t|V|PR|3P|IND|@FS-STA\tMood=Ind|Number=Plur|Person=3|Tense=Pres|VerbForm=Fin\t0\troot\t_\t_\n10\tcom\tcom\tADP\tPRP|@|ART|F|P|@>N\tDefinite=Def|Gender=Fem|Number=Plur|PronType=Art\t12\tdet\t_\t_\n12\tprioridades\tprioridade\tNOUN\t|N|F|P|@P<\tGender=Fem|Number=Plur\t9\tobj\t_\t_\n13-14\tdo\t_\t_\t_\t_\t_\t_\t_\t_\n13\tde\tde\tADP\t|PRP|@N<\t_\t15\tcase\t_\t_\n14\to\to\tDET\t<-sam>||ART|M|S|@>N\tDefinite=Def|Gender=Masc|Number=Sing|PronType=Art\t15\tdet\t_\t_\n15\tPT\tPT\tPROPN\tPROP|M|S|@P<\tGender=Masc|Number=Sing\t12\tnmod\t_\tChangedBy=Issue165|SpaceAfter=No\n16\t.\t.\tPUNCT\tPU|@PU\t_\t9\tpunct\t_\t_\n\n" }, { "path": "src/test/resources/samples/langs/CoNLL-U/en-ud-test-abridged.conllu", "content": "# newdoc id = weblog-blogspot.com_zentelligence_20040423000200_ENG_20040423_000200\n# sent_id = weblog-blogspot.com_zentelligence_20040423000200_ENG_20040423_000200-0001\n# text = What if Google Morphed Into GoogleOS?\n1\tWhat\twhat\tPRON\tWP\tPronType=Int\t0\troot\t0:root\t_\n2\tif\tif\tSCONJ\tIN\t_\t4\tmark\t4:mark\t_\n3\tGoogle\tGoogle\tPROPN\tNNP\tNumber=Sing\t4\tnsubj\t4:nsubj\t_\n4\tMorphed\tmorph\tVERB\tVBD\tMood=Ind|Tense=Past|VerbForm=Fin\t1\tadvcl\t1:advcl\t_\n5\tInto\tinto\tADP\tIN\t_\t6\tcase\t6:case\t_\n6\tGoogleOS\tGoogleOS\tPROPN\tNNP\tNumber=Sing\t4\tobl\t4:obl\tSpaceAfter=No\n7\t?\t?\tPUNCT\t.\t_\t4\tpunct\t4:punct\t_\n\n# sent_id = weblog-blogspot.com_zentelligence_20040423000200_ENG_20040423_000200-0002\n# text = What if Google expanded on its search-engine (and now e-mail) wares into a full-fledged operating system?\n1\tWhat\twhat\tPRON\tWP\tPronType=Int\t0\troot\t0:root\t_\n2\tif\tif\tSCONJ\tIN\t_\t4\tmark\t4:mark\t_\n3\tGoogle\tGoogle\tPROPN\tNNP\tNumber=Sing\t4\tnsubj\t4:nsubj\t_\n4\texpanded\texpand\tVERB\tVBD\tMood=Ind|Tense=Past|VerbForm=Fin\t1\tadvcl\t1:advcl\t_\n5\ton\ton\tADP\tIN\t_\t15\tcase\t15:case\t_\n6\tits\tits\tPRON\tPRP$\tGender=Neut|Number=Sing|Person=3|Poss=Yes|PronType=Prs\t15\tnmod:poss\t15:nmod:poss\t_\n7\tsearch\tsearch\tNOUN\tNN\tNumber=Sing\t9\tcompound\t9:compound\tSpaceAfter=No\n8\t-\t-\tPUNCT\tHYPH\t_\t9\tpunct\t9:punct\tSpaceAfter=No\n9\tengine\tengine\tNOUN\tNN\tNumber=Sing\t15\tcompound\t15:compound\t_\n10\t(\t(\tPUNCT\t-LRB-\t_\t9\tpunct\t9:punct\tSpaceAfter=No\n11\tand\tand\tCCONJ\tCC\t_\t13\tcc\t13:cc\t_\n12\tnow\tnow\tADV\tRB\t_\t13\tadvmod\t13:advmod\t_\n13\te-mail\te-mail\tNOUN\tNN\tNumber=Sing\t9\tconj\t9:conj\tSpaceAfter=No\n14\t)\t)\tPUNCT\t-RRB-\t_\t15\tpunct\t15:punct\t_\n15\twares\twares\tNOUN\tNNS\tNumber=Plur\t4\tobl\t4:obl\t_\n16\tinto\tinto\tADP\tIN\t_\t22\tcase\t22:case\t_\n17\ta\ta\tDET\tDT\tDefinite=Ind|PronType=Art\t22\tdet\t22:det\t_\n18\tfull\tfull\tADV\tRB\t_\t20\tadvmod\t20:advmod\tSpaceAfter=No\n19\t-\t-\tPUNCT\tHYPH\t_\t20\tpunct\t20:punct\tSpaceAfter=No\n20\tfledged\tfledged\tADJ\tJJ\tDegree=Pos\t22\tamod\t22:amod\t_\n21\toperating\toperating\tNOUN\tNN\tNumber=Sing\t22\tcompound\t22:compound\t_\n22\tsystem\tsystem\tNOUN\tNN\tNumber=Sing\t4\tobl\t4:obl\tSpaceAfter=No\n23\t?\t?\tPUNCT\t.\t_\t4\tpunct\t4:punct\t_\n\n# sent_id = weblog-blogspot.com_zentelligence_20040423000200_ENG_20040423_000200-0003\n# text = [via Microsoft Watch from Mary Jo Foley ]\n1\t[\t[\tPUNCT\t-LRB-\t_\t4\tpunct\t4:punct\tSpaceAfter=No\n2\tvia\tvia\tADP\tIN\t_\t4\tcase\t4:case\t_\n3\tMicrosoft\tMicrosoft\tPROPN\tNNP\tNumber=Sing\t4\tcompound\t4:compound\t_\n4\tWatch\tWatch\tPROPN\tNNP\tNumber=Sing\t0\troot\t0:root\t_\n5\tfrom\tfrom\tADP\tIN\t_\t6\tcase\t6:case\t_\n6\tMary\tMary\tPROPN\tNNP\tNumber=Sing\t4\tnmod\t4:nmod\t_\n7\tJo\tJo\tPROPN\tNNP\tNumber=Sing\t6\tflat\t6:flat\t_\n8\tFoley\tFoley\tPROPN\tNNP\tNumber=Sing\t6\tflat\t6:flat\t_\n9\t]\t]\tPUNCT\t-RRB-\t_\t4\tpunct\t4:punct\t_\n\n# newdoc id = weblog-blogspot.com_marketview_20050511222700_ENG_20050511_222700\n# sent_id = weblog-blogspot.com_marketview_20050511222700_ENG_20050511_222700-0001\n# text = (And, by the way, is anybody else just a little nostalgic for the days when that was a good thing?)\n1\t(\t(\tPUNCT\t-LRB-\t_\t14\tpunct\t14:punct\tSpaceAfter=No\n2\tAnd\tand\tCCONJ\tCC\t_\t14\tcc\t14:cc\tSpaceAfter=No\n3\t,\t,\tPUNCT\t,\t_\t14\tpunct\t14:punct\t_\n4\tby\tby\tADP\tIN\t_\t6\tcase\t6:case\t_\n5\tthe\tthe\tDET\tDT\tDefinite=Def|PronType=Art\t6\tdet\t6:det\t_\n6\tway\tway\tNOUN\tNN\tNumber=Sing\t14\tobl\t14:obl\tSpaceAfter=No\n7\t,\t,\tPUNCT\t,\t_\t14\tpunct\t14:punct\t_\n8\tis\tbe\tAUX\tVBZ\tMood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin\t14\tcop\t14:cop\t_\n9\tanybody\tanybody\tPRON\tNN\tNumber=Sing\t14\tnsubj\t14:nsubj\t_\n10\telse\telse\tADJ\tJJ\tDegree=Pos\t9\tamod\t9:amod\t_\n11\tjust\tjust\tADV\tRB\t_\t13\tadvmod\t13:advmod\t_\n12\ta\ta\tDET\tDT\tDefinite=Ind|PronType=Art\t13\tdet\t13:det\t_\n13\tlittle\tlittle\tADJ\tJJ\tDegree=Pos\t14\tobl:npmod\t14:obl:npmod\t_\n14\tnostalgic\tnostalgic\tNOUN\tNN\tNumber=Sing\t0\troot\t0:root\t_\n15\tfor\tfor\tADP\tIN\t_\t17\tcase\t17:case\t_\n16\tthe\tthe\tDET\tDT\tDefinite=Def|PronType=Art\t17\tdet\t17:det\t_\n17\tdays\tday\tNOUN\tNNS\tNumber=Plur\t14\tnmod\t14:nmod\t_\n18\twhen\twhen\tADV\tWRB\tPronType=Rel\t23\tadvmod\t23:advmod\t_\n19\tthat\tthat\tPRON\tDT\tNumber=Sing|PronType=Dem\t23\tnsubj\t23:nsubj\t_\n20\twas\tbe\tAUX\tVBD\tMood=Ind|Number=Sing|Person=3|Tense=Past|VerbForm=Fin\t23\tcop\t23:cop\t_\n21\ta\ta\tDET\tDT\tDefinite=Ind|PronType=Art\t23\tdet\t23:det\t_\n22\tgood\tgood\tADJ\tJJ\tDegree=Pos\t23\tamod\t23:amod\t_\n23\tthing\tthing\tNOUN\tNN\tNumber=Sing\t17\tacl:relcl\t17:acl:relcl\tSpaceAfter=No\n24\t?\t?\tPUNCT\t.\t_\t14\tpunct\t14:punct\tSpaceAfter=No\n25\t)\t)\tPUNCT\t-RRB-\t_\t14\tpunct\t14:punct\t_\n\n# sent_id = weblog-blogspot.com_marketview_20050511222700_ENG_20050511_222700-0002\n# text = This BuzzMachine post argues that Google's rush toward ubiquity might backfire -- which we've all heard before, but it's particularly well-put in this post.\n1\tThis\tthis\tDET\tDT\tNumber=Sing|PronType=Dem\t3\tdet\t3:det\t_\n2\tBuzzMachine\tBuzzMachine\tPROPN\tNNP\tNumber=Sing\t3\tcompound\t3:compound\t_\n3\tpost\tpost\tNOUN\tNN\tNumber=Sing\t4\tnsubj\t4:nsubj\t_\n4\targues\targue\tVERB\tVBZ\tMood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin\t0\troot\t0:root\t_\n5\tthat\tthat\tSCONJ\tIN\t_\t12\tmark\t12:mark\t_\n6\tGoogle\tGoogle\tPROPN\tNNP\tNumber=Sing\t8\tnmod:poss\t8:nmod:poss\tSpaceAfter=No\n7\t's\t's\tPART\tPOS\t_\t6\tcase\t6:case\t_\n8\trush\trush\tNOUN\tNN\tNumber=Sing\t12\tnsubj\t12:nsubj\t_\n9\ttoward\ttoward\tADP\tIN\t_\t10\tcase\t10:case\t_\n10\tubiquity\tubiquity\tNOUN\tNN\tNumber=Sing\t8\tnmod\t8:nmod\t_\n11\tmight\tmight\tAUX\tMD\tVerbForm=Fin\t12\taux\t12:aux\t_\n12\tbackfire\tbackfire\tVERB\tVB\tVerbForm=Inf\t4\tccomp\t4:ccomp\t_\n13\t--\t--\tPUNCT\t,\t_\t12\tpunct\t12:punct\t_\n14\twhich\twhich\tPRON\tWDT\tPronType=Rel\t18\tobj\t18:obj\t_\n15\twe\twe\tPRON\tPRP\tCase=Nom|Number=Plur|Person=1|PronType=Prs\t18\tnsubj\t18:nsubj\tSpaceAfter=No\n16\t've\thave\tAUX\tVBP\tMood=Ind|Tense=Pres|VerbForm=Fin\t18\taux\t18:aux\t_\n17\tall\tall\tADV\tRB\t_\t18\tadvmod\t18:advmod\t_\n18\theard\thear\tVERB\tVBN\tTense=Past|VerbForm=Part\t12\tacl:relcl\t12:acl:relcl\t_\n19\tbefore\tbefore\tADV\tRB\t_\t18\tadvmod\t18:advmod\tSpaceAfter=No\n20\t,\t,\tPUNCT\t,\t_\t27\tpunct\t27:punct\t_\n21\tbut\tbut\tCCONJ\tCC\t_\t27\tcc\t27:cc\t_\n22\tit\tit\tPRON\tPRP\tCase=Nom|Gender=Neut|Number=Sing|Person=3|PronType=Prs\t27\tnsubj:pass\t27:nsubj:pass\tSpaceAfter=No\n23\t's\tbe\tVERB\tVBZ\tMood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin\t27\taux:pass\t27:aux:pass\t_\n24\tparticularly\tparticularly\tADV\tRB\t_\t27\tadvmod\t27:advmod\t_\n25\twell\twell\tADV\tRB\tDegree=Pos\t27\tadvmod\t27:advmod\tSpaceAfter=No\n26\t-\t-\tPUNCT\tHYPH\t_\t27\tpunct\t27:punct\tSpaceAfter=No\n27\tput\tput\tVERB\tVBN\tTense=Past|VerbForm=Part\t4\tconj\t4:conj\t_\n28\tin\tin\tADP\tIN\t_\t30\tcase\t30:case\t_\n29\tthis\tthis\tDET\tDT\tNumber=Sing|PronType=Dem\t30\tdet\t30:det\t_\n30\tpost\tpost\tNOUN\tNN\tNumber=Sing\t27\tobl\t27:obl\tSpaceAfter=No\n31\t.\t.\tPUNCT\t.\t_\t4\tpunct\t4:punct\t_\n\n# sent_id = weblog-blogspot.com_marketview_20050511222700_ENG_20050511_222700-0003\n# text = Google is a nice search engine.\n1\tGoogle\tGoogle\tPROPN\tNNP\tNumber=Sing\t6\tnsubj\t6:nsubj\t_\n2\tis\tbe\tAUX\tVBZ\tMood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin\t6\tcop\t6:cop\t_\n3\ta\ta\tDET\tDT\tDefinite=Ind|PronType=Art\t6\tdet\t6:det\t_\n4\tnice\tnice\tADJ\tJJ\tDegree=Pos\t6\tamod\t6:amod\t_\n5\tsearch\tsearch\tNOUN\tNN\tNumber=Sing\t6\tcompound\t6:compound\t_\n6\tengine\tengine\tNOUN\tNN\tNumber=Sing\t0\troot\t0:root\tSpaceAfter=No\n7\t.\t.\tPUNCT\t.\t_\t6\tpunct\t6:punct\t_\n\n" }, { "path": "src/test/resources/samples/langs/CoNLL-U/ug-ud-test-abridged.conllu", "content": "# sent_id = s1\n# text = ئاسماننى كۆپكۈك، دەريا، كۆل سۇلىرىنى سۈپسۈزۈك تۇرۇشقا، دەل - دەرەخلەرنى بۈك - باراقسان بولۇشقا، ھايۋانلارنى ئەركىن ئازادە ياشاشقا ئىگە قىلىش... بىزنىڭ ئورتاق ئارزۇيىمىز.\n1\tئاسماننى\t_\tNOUN\tN\t_\t30\tcsubj\t_\tTranslit=asmanni\n2\tكۆپكۈك\t_\tVERB\tV\t_\t1\torphan\t_\tSpaceAfter=No|Translit=köpkük\n3\t،\t_\tPUNCT\tY\t_\t2\tpunct\t_\tTranslit=,\n4\tدەريا\t_\tNOUN\tN\t_\t7\tnmod:poss\t_\tSpaceAfter=No|Translit=derya\n5\t،\t_\tPUNCT\tY\t_\t4\tpunct\t_\tTranslit=,\n6\tكۆل\t_\tNOUN\tN\t_\t4\tconj\t_\tTranslit=köl\n7\tسۇلىرىنى\t_\tNOUN\tN\t_\t9\tobj\t_\tTranslit=sulirini\n8\tسۈپسۈزۈك\t_\tADJ\tA\t_\t9\tadvmod\t_\tTranslit=süpsüzük\n9\tتۇرۇشقا\t_\tVERB\tV\t_\t1\tconj\t_\tSpaceAfter=No|Translit=turushqa\n10\t،\t_\tPUNCT\tY\t_\t1\tpunct\t_\tTranslit=,\n11\tدەل\t_\tADV\tD\t_\t13\tcompound:redup\t_\tTranslit=del\n12\t-\t_\tPUNCT\tY\t_\t11\tpunct\t_\tTranslit=-\n13\tدەرەخلەرنى\t_\tNOUN\tN\t_\t17\tobj\t_\tTranslit=derexlerni\n14\tبۈك\t_\tADJ\tA\t_\t16\tcompound\t_\tTranslit=bük\n15\t-\t_\tPUNCT\tY\t_\t14\tpunct\t_\tTranslit=-\n16\tباراقسان\t_\tADJ\tA\t_\t17\tadvmod\t_\tTranslit=baraqsan\n17\tبولۇشقا\t_\tVERB\tV\t_\t9\torphan\t_\tSpaceAfter=No|Translit=bolushqa\n18\t،\t_\tPUNCT\tY\t_\t17\tpunct\t_\tTranslit=,\n19\tھايۋانلارنى\t_\tNOUN\tN\t_\t24\tobj\t_\tTranslit=haywanlarni\n20\tئەركىن\t_\tADJ\tA\t_\t21\tcompound:redup\t_\tTranslit=erkin\n21\tئازادە\t_\tADJ\tA\t_\t22\tadvmod\t_\tTranslit=azade\n22\tياشاشقا\t_\tNOUN\tN\t_\t24\tadvcl\t_\tTranslit=yashashqa\n23\tئىگە\t_\tNOUN\tN\t_\t24\tcompound\t_\tTranslit=ige\n24\tقىلىش\t_\tVERB\tV\t_\t1\tconj\t_\tSpaceAfter=No|Translit=qilish\n25\t.\t_\tPUNCT\tY\t_\t1\tpunct\t_\tSpaceAfter=No|Translit=.\n26\t.\t_\tPUNCT\tY\t_\t1\tpunct\t_\tSpaceAfter=No|Translit=.\n27\t.\t_\tPUNCT\tY\t_\t1\tpunct\t_\tTranslit=.\n28\tبىزنىڭ\t_\tPRON\tP\t_\t30\tnmod:poss\t_\tTranslit=bizning\n29\tئورتاق\t_\tADJ\tA\t_\t30\tamod\t_\tTranslit=ortaq\n30\tئارزۇيىمىز\t_\tNOUN\tN\t_\t0\troot\t_\tSpaceAfter=No|Translit=arzuyimiz\n31\t.\t_\tPUNCT\tY\t_\t30\tpunct\t_\tTranslit=.\n\n# sent_id = s2\n# text = بۇ بۆلەكتىكى تېكىستلەرنى ئوقۇش ئارقىلىق، كىشىلەرنىڭ ھايۋانلار ۋە ئۆسۈملۈكلەرگە قانداق مۇئامىلە قىلغانلىقى، ئاقىۋىتىنىڭ قانداق بولغانلىقىنى كۆرۈپ باقايلى،\n1\tبۇ\t_\tPRON\tP\t_\t2\tdet\t_\tTranslit=bu\n2\tبۆلەكتىكى\t_\tNOUN\tN\t_\t3\tnmod\t_\tTranslit=bölektiki\n3\tتېكىستلەرنى\t_\tNOUN\tN\t_\t4\tobj\t_\tTranslit=tëkistlerni\n4\tئوقۇش\t_\tVERB\tV\t_\t18\tadvcl\t_\tTranslit=oqush\n5\tئارقىلىق\t_\tADP\tR\t_\t4\tcase\t_\tSpaceAfter=No|Translit=arqiliq\n6\t،\t_\tPUNCT\tY\t_\t5\tpunct\t_\tTranslit=,\n7\tكىشىلەرنىڭ\t_\tNOUN\tN\t_\t13\tnsubj\t_\tTranslit=kishilerning\n8\tھايۋانلار\t_\tNOUN\tN\t_\t13\tobl\t_\tTranslit=haywanlar\n9\tۋە\t_\tCCONJ\tC\t_\t10\tcc\t_\tTranslit=we\n10\tئۆسۈملۈكلەرگە\t_\tNOUN\tN\t_\t8\tconj\t_\tTranslit=ösümlüklerge\n11\tقانداق\t_\tPRON\tP\t_\t13\tadvmod\t_\tTranslit=qandaq\n12\tمۇئامىلە\t_\tNOUN\tN\t_\t13\tcompound\t_\tTranslit=muamile\n13\tقىلغانلىقى\t_\tVERB\tV\t_\t18\tconj\t_\tSpaceAfter=No|Translit=qilghanliqi\n14\t،\t_\tPUNCT\tY\t_\t13\tpunct\t_\tTranslit=,\n15\tئاقىۋىتىنىڭ\t_\tNOUN\tN\t_\t17\tnsubj\t_\tTranslit=aqiwitining\n16\tقانداق\t_\tPRON\tP\t_\t17\tadvmod\t_\tTranslit=qandaq\n17\tبولغانلىقىنى\t_\tVERB\tV\t_\t18\tobj\t_\tTranslit=bolghanliqini\n18\tكۆرۈپ\t_\tVERB\tV\t_\t0\troot\t_\tTranslit=körüp\n19\tباقايلى\t_\tVERB\tV\t_\t18\taux\t_\tSpaceAfter=No|Translit=baqayli\n20\t،\t_\tPUNCT\tY\t_\t19\tpunct\t_\tTranslit=,\n\n# sent_id = s3\n# text = يەنە ئەتراپىمىزدىكى مۇھىتنى ياخشى كۆزىتىپ، مۇھىتنى قوغداش ئۈچۈن نېمىلەرنى قىلالايدىغانلىقىمىز توغرۇلۇق ئويلىنىپ باقايلى.\n1\tيەنە\t_\tADV\tD\t_\t13\tcc\t_\tTranslit=yene\n2\tئەتراپىمىزدىكى\t_\tNOUN\tN\t_\t3\tamod\t_\tTranslit=etrapimizdiki\n3\tمۇھىتنى\t_\tNOUN\tN\t_\t5\tobj\t_\tTranslit=muhitni\n4\tياخشى\t_\tADJ\tA\t_\t5\tadvmod\t_\tTranslit=yaxshi\n5\tكۆزىتىپ\t_\tVERB\tV\t_\t13\tadvcl\t_\tSpaceAfter=No|Translit=közitip\n6\t،\t_\tPUNCT\tY\t_\t5\tpunct\t_\tTranslit=,\n7\tمۇھىتنى\t_\tNOUN\tN\t_\t8\tobj\t_\tTranslit=muhitni\n8\tقوغداش\t_\tVERB\tV\t_\t11\tadvcl\t_\tTranslit=qoghdash\n9\tئۈچۈن\t_\tCCONJ\tC\t_\t8\tcase\t_\tTranslit=üchün\n10\tنېمىلەرنى\t_\tPRON\tP\t_\t11\tobj\t_\tTranslit=nëmilerni\n11\tقىلالايدىغانلىقىمىز\t_\tVERB\tV\t_\t13\tobj\t_\tTranslit=qilalaydighanliqimiz\n12\tتوغرۇلۇق\t_\tADP\tR\t_\t11\tcase\t_\tTranslit=toghruluq\n13\tئويلىنىپ\t_\tVERB\tV\t_\t0\troot\t_\tTranslit=oylinip\n14\tباقايلى\t_\tVERB\tV\t_\t13\taux\t_\tSpaceAfter=No|Translit=baqayli\n15\t.\t_\tPUNCT\tY\t_\t14\tpunct\t_\tTranslit=.\n\n# sent_id = s4\n# text = بىر يىلى باھار كۈنلىرىنىڭ بىرىدە، شىۋېتسارىيىنىڭ بىر ۋوگزالىدا ھاۋا تەڭشىگۈچ ئورنىتىلغان چىرايلىق، ئازادە بىر پويىز قوزغىلىش ئالدىدا تۇراتتى.\n1\tبىر\t_\tNUM\tM\t_\t2\tnummod\t_\tTranslit=bir\n2\tيىلى\t_\tNOUN\tN\t_\t20\tnmod:tmod\t_\tTranslit=yili\n3\tباھار\t_\tNOUN\tN\t_\t4\tnmod:poss\t_\tTranslit=bahar\n4\tكۈنلىرىنىڭ\t_\tNOUN\tN\t_\t5\tnmod:part\t_\tTranslit=künlirining\n5\tبىرىدە\t_\tNUM\tM\t_\t20\tnmod:tmod\t_\tSpaceAfter=No|Translit=biride\n6\t،\t_\tPUNCT\tY\t_\t5\tpunct\t_\tTranslit=,\n7\tشىۋېتسارىيىنىڭ\t_\tNOUN\tN\t_\t9\tnmod:poss\t_\tTranslit=shiwëtsariyining\n8\tبىر\t_\tNUM\tM\t_\t9\tdet\t_\tTranslit=bir\n9\tۋوگزالىدا\t_\tNOUN\tN\t_\t20\tobl\t_\tTranslit=wogzalida\n10\tھاۋا\t_\tNOUN\tN\t_\t11\tcompound\t_\tTranslit=hawa\n11\tتەڭشىگۈچ\t_\tNOUN\tN\t_\t12\tnsubj\t_\tTranslit=tengshigüch\n12\tئورنىتىلغان\t_\tNOUN\tN\t_\t17\tamod\t_\tTranslit=ornitilghan\n13\tچىرايلىق\t_\tADJ\tA\t_\t17\tamod\t_\tSpaceAfter=No|Translit=chirayliq\n14\t،\t_\tPUNCT\tY\t_\t13\tpunct\t_\tTranslit=,\n15\tئازادە\t_\tADJ\tA\t_\t13\tconj\t_\tTranslit=azade\n16\tبىر\t_\tNUM\tM\t_\t17\tdet\t_\tTranslit=bir\n17\tپويىز\t_\tNOUN\tN\t_\t20\tnsubj\t_\tTranslit=poyiz\n18\tقوزغىلىش\t_\tVERB\tV\t_\t19\tnmod:poss\t_\tTranslit=qozghilish\n19\tئالدىدا\t_\tNOUN\tN\t_\t20\tobl\t_\tTranslit=aldida\n20\tتۇراتتى\t_\tVERB\tV\t_\t0\troot\t_\tSpaceAfter=No|Translit=turatti\n21\t.\t_\tPUNCT\tY\t_\t20\tpunct\t_\tTranslit=.\n\n# sent_id = s5\n# text = ۋوگزال سۇپىسى ئۇزاتقۇچىلار بىلەن تولۇپ كەتكەنىدى.\n1\tۋوگزال\t_\tNOUN\tN\t_\t2\tnmod:poss\t_\tTranslit=wogzal\n2\tسۇپىسى\t_\tNOUN\tN\t_\t5\tnsubj\t_\tTranslit=supisi\n3\tئۇزاتقۇچىلار\t_\tNOUN\tN\t_\t5\tobl\t_\tTranslit=uzatquchilar\n4\tبىلەن\t_\tADP\tR\t_\t3\tcase\t_\tTranslit=bilen\n5\tتولۇپ\t_\tVERB\tV\t_\t0\troot\t_\tTranslit=tolup\n6\tكەتكەنىدى\t_\tVERB\tV\t_\t5\taux\t_\tSpaceAfter=No|Translit=ketkenidi\n7\t.\t_\tPUNCT\tY\t_\t6\tpunct\t_\tTranslit=.\n\n# sent_id = s6\n# text = ئۇلارنىڭ ئۇزاتماقچى بولغىنى ئۆزگىچە مىھمان - قارلىغاچلار ئىدى.\n1\tئۇلارنىڭ\t_\tPRON\tP\t_\t2\tnsubj\t_\tTranslit=ularning\n2\tئۇزاتماقچى\t_\tNOUN\tN\t_\t5\tacl\t_\tTranslit=uzatmaqchi\n3\tبولغىنى\t_\tAUX\tV\t_\t2\tcop\t_\tTranslit=bolghini\n4\tئۆزگىچە\t_\tADJ\tA\t_\t5\tamod\t_\tTranslit=özgiche\n5\tمىھمان\t_\tNOUN\tN\t_\t7\tappos\t_\tTranslit=mihman\n6\t-\t_\tPUNCT\tY\t_\t5\tpunct\t_\tTranslit=-\n7\tقارلىغاچلار\t_\tNOUN\tN\t_\t0\troot\t_\tTranslit=qarlighachlar\n8\tئىدى\t_\tAUX\tV\t_\t7\tcop\t_\tSpaceAfter=No|Translit=idi\n9\t.\t_\tPUNCT\tY\t_\t8\tpunct\t_\tTranslit=.\n\n" }, { "path": "src/test/resources/samples/langs/CoffeeScript/browser.coffee", "content": "# Override exported methods for non-Node.js engines.\n\nCoffeeScript = require './coffee-script'\nCoffeeScript.require = require\n\n# Use standard JavaScript `eval` to eval code.\nCoffeeScript.eval = (code, options = {}) ->\n options.bare ?= on\n eval CoffeeScript.compile code, options\n\n# Running code does not provide access to this scope.\nCoffeeScript.run = (code, options = {}) ->\n options.bare = on\n Function(CoffeeScript.compile code, options)()\n\n# If we're not in a browser environment, we're finished with the public API.\nreturn unless window?\n\n# Load a remote script from the current domain via XHR.\nCoffeeScript.load = (url, callback) ->\n xhr = new (window.ActiveXObject or XMLHttpRequest)('Microsoft.XMLHTTP')\n xhr.open 'GET', url, true\n xhr.overrideMimeType 'text/plain' if 'overrideMimeType' of xhr\n xhr.onreadystatechange = ->\n if xhr.readyState is 4\n if xhr.status in [0, 200]\n CoffeeScript.run xhr.responseText\n else\n throw new Error \"Could not load #{url}\"\n callback() if callback\n xhr.send null\n\n# Activate CoffeeScript in the browser by having it compile and evaluate\n# all script tags with a content-type of `text/coffeescript`.\n# This happens on page load.\nrunScripts = ->\n scripts = document.getElementsByTagName 'script'\n coffees = (s for s in scripts when s.type is 'text/coffeescript')\n index = 0\n length = coffees.length\n do execute = ->\n script = coffees[index++]\n if script?.type is 'text/coffeescript'\n if script.src\n CoffeeScript.load script.src, execute\n else\n CoffeeScript.run script.innerHTML\n execute()\n null\n\n# Listen for window load, both in browsers and in IE.\nif window.addEventListener\n addEventListener 'DOMContentLoaded', runScripts, no\nelse\n attachEvent 'onload', runScripts\n" }, { "path": "src/test/resources/samples/langs/CoffeeScript/build.cake", "content": "fs = require 'fs'\n\n{print} = require 'sys'\n{spawn} = require 'child_process'\n\nbuild = (callback) ->\n\tcoffee = spawn 'coffee', ['-c', '-o', '.', '.']\n\tcoffee.stderr.on 'data', (data) ->\n\t\tprocess.stderr.write data.toString()\n\tcoffee.stdout.on 'data', (data) ->\n\t\tprint data.toString()\n\tcoffee.on 'exit', (code) ->\n\t\tcallback?() if code is 0\n\ntask 'build', 'Build from source', ->\n\tbuild() \n\t" }, { "path": "src/test/resources/samples/langs/CoffeeScript/classes.coffee", "content": "class Animal\n constructor: (@name) ->\n\n move: (meters) ->\n alert @name + \" moved \" + meters + \"m.\"\n\nclass Snake extends Animal\n move: ->\n alert \"Slithering...\"\n super 5\n\nclass Horse extends Animal\n move: ->\n alert \"Galloping...\"\n super 45\n\nsam = new Snake \"Sammy the Python\"\ntom = new Horse \"Tommy the Palomino\"\n\nsam.move()\ntom.move()\n" }, { "path": "src/test/resources/samples/langs/CoffeeScript/coffee-script.coffee", "content": "# CoffeeScript can be used both on the server, as a command-line compiler based\n# on Node.js/V8, or to run CoffeeScripts directly in the browser. This module\n# contains the main entry functions for tokenizing, parsing, and compiling\n# source CoffeeScript into JavaScript.\n#\n# If included on a webpage, it will automatically sniff out, compile, and\n# execute all scripts present in `text/coffeescript` tags.\n\nfs = require 'fs'\npath = require 'path'\n{Lexer,RESERVED} = require './lexer'\n{parser} = require './parser'\nvm = require 'vm'\n\n# TODO: Remove registerExtension when fully deprecated.\nif require.extensions\n require.extensions['.coffee'] = (module, filename) ->\n content = compile fs.readFileSync(filename, 'utf8'), {filename}\n module._compile content, filename\nelse if require.registerExtension\n require.registerExtension '.coffee', (content) -> compile content\n\n# The current CoffeeScript version number.\nexports.VERSION = '1.3.3'\n\n# Words that cannot be used as identifiers in CoffeeScript code\nexports.RESERVED = RESERVED\n\n# Expose helpers for testing.\nexports.helpers = require './helpers'\n\n# Compile a string of CoffeeScript code to JavaScript, using the Coffee/Jison\n# compiler.\nexports.compile = compile = (code, options = {}) ->\n {merge} = exports.helpers\n try\n js = (parser.parse lexer.tokenize code).compile options\n return js unless options.header\n catch err\n err.message = \"In #{options.filename}, #{err.message}\" if options.filename\n throw err\n header = \"Generated by CoffeeScript #{@VERSION}\"\n \"// #{header}\\n#{js}\"\n\n# Tokenize a string of CoffeeScript code, and return the array of tokens.\nexports.tokens = (code, options) ->\n lexer.tokenize code, options\n\n# Parse a string of CoffeeScript code or an array of lexed tokens, and\n# return the AST. You can then compile it by calling `.compile()` on the root,\n# or traverse it by using `.traverseChildren()` with a callback.\nexports.nodes = (source, options) ->\n if typeof source is 'string'\n parser.parse lexer.tokenize source, options\n else\n parser.parse source\n\n# Compile and execute a string of CoffeeScript (on the server), correctly\n# setting `__filename`, `__dirname`, and relative `require()`.\nexports.run = (code, options = {}) ->\n mainModule = require.main\n\n # Set the filename.\n mainModule.filename = process.argv[1] =\n if options.filename then fs.realpathSync(options.filename) else '.'\n\n # Clear the module cache.\n mainModule.moduleCache and= {}\n\n # Assign paths for node_modules loading\n mainModule.paths = require('module')._nodeModulePaths path.dirname fs.realpathSync options.filename\n\n # Compile.\n if path.extname(mainModule.filename) isnt '.coffee' or require.extensions\n mainModule._compile compile(code, options), mainModule.filename\n else\n mainModule._compile code, mainModule.filename\n\n# Compile and evaluate a string of CoffeeScript (in a Node.js-like environment).\n# The CoffeeScript REPL uses this to run the input.\nexports.eval = (code, options = {}) ->\n return unless code = code.trim()\n Script = vm.Script\n if Script\n if options.sandbox?\n if options.sandbox instanceof Script.createContext().constructor\n sandbox = options.sandbox\n else\n sandbox = Script.createContext()\n sandbox[k] = v for own k, v of options.sandbox\n sandbox.global = sandbox.root = sandbox.GLOBAL = sandbox\n else\n sandbox = global\n sandbox.__filename = options.filename || 'eval'\n sandbox.__dirname = path.dirname sandbox.__filename\n # define module/require only if they chose not to specify their own\n unless sandbox isnt global or sandbox.module or sandbox.require\n Module = require 'module'\n sandbox.module = _module = new Module(options.modulename || 'eval')\n sandbox.require = _require = (path) -> Module._load path, _module, true\n _module.filename = sandbox.__filename\n _require[r] = require[r] for r in Object.getOwnPropertyNames require when r isnt 'paths'\n # use the same hack node currently uses for their own REPL\n _require.paths = _module.paths = Module._nodeModulePaths process.cwd()\n _require.resolve = (request) -> Module._resolveFilename request, _module\n o = {}\n o[k] = v for own k, v of options\n o.bare = on # ensure return value\n js = compile code, o\n if sandbox is global\n vm.runInThisContext js\n else\n vm.runInContext js, sandbox\n\n# Instantiate a Lexer for our use here.\nlexer = new Lexer\n\n# The real Lexer produces a generic stream of tokens. This object provides a\n# thin wrapper around it, compatible with the Jison API. We can then pass it\n# directly as a \"Jison lexer\".\nparser.lexer =\n lex: ->\n [tag, @yytext, @yylineno] = @tokens[@pos++] or ['']\n tag\n setInput: (@tokens) ->\n @pos = 0\n upcomingInput: ->\n \"\"\n\nparser.yy = require './nodes'\n" }, { "path": "src/test/resources/samples/langs/CoffeeScript/example.cjsx", "content": "###* @cjsx React.DOM ###\ndefine 'myProject.ReactExampleComponent', [\n 'React'\n 'myProject.ExampleStore'\n 'myProject.ExampleActions'\n 'myProject.ReactExampleTable'\n], (React, ExampleStore, ExampleActions, ReactExampleTable ) ->\n\n ReactExampleComponent = React.createClass\n mixins: [ListenMixin]\n\n getInitialState: ->\n rows: ExampleStore.getRows()\n meta: ExampleStore.getMeta()\n\n componentWillMount: ->\n @listenTo ExampleStore\n\n componentDidMount: ->\n ExampleActions.getExampleData()\n\n onStoreChange: ->\n if this.isMounted()\n @setState\n rows: ExampleStore.getRows()\n meta: ExampleStore.getMeta()\n\n componentWillUnmount: ->\n @stopListening ExampleStore\n\n render: ->\n
\n
\n {@state.title} \n
\n \n
\n" }, { "path": "src/test/resources/samples/langs/CoffeeScript/hello.coffee", "content": "console.log \"Hello, World!\"\n" }, { "path": "src/test/resources/samples/langs/CoffeeScript/intro.coffee", "content": "# Assignment:\nnumber = 42\nopposite = true\n\n# Conditions:\nnumber = -42 if opposite\n\n# Functions:\nsquare = (x) -> x * x\n\n# Arrays:\nlist = [1, 2, 3, 4, 5]\n\n# Objects:\nmath =\n root: Math.sqrt\n square: square\n cube: (x) -> x * square x\n\n# Splats:\nrace = (winner, runners...) ->\n print winner, runners\n\n# Existence:\nalert \"I knew it!\" if elvis?\n\n# Array comprehensions:\ncubes = (math.cube num for num in list)\n" }, { "path": "src/test/resources/samples/langs/CoffeeScript/lexer.coffee", "content": "# The CoffeeScript Lexer. Uses a series of token-matching regexes to attempt\n# matches against the beginning of the source code. When a match is found,\n# a token is produced, we consume the match, and start again. Tokens are in the\n# form:\n#\n# [tag, value, lineNumber]\n#\n# Which is a format that can be fed directly into [Jison](http://github.com/zaach/jison).\n\n{Rewriter, INVERSES} = require './rewriter'\n\n# Import the helpers we need.\n{count, starts, compact, last} = require './helpers'\n\n# The Lexer Class\n# ---------------\n\n# The Lexer class reads a stream of CoffeeScript and divvies it up into tagged\n# tokens. Some potential ambiguity in the grammar has been avoided by\n# pushing some extra smarts into the Lexer.\nexports.Lexer = class Lexer\n\n # **tokenize** is the Lexer's main method. Scan by attempting to match tokens\n # one at a time, using a regular expression anchored at the start of the\n # remaining code, or a custom recursive token-matching method\n # (for interpolations). When the next token has been recorded, we move forward\n # within the code past the token, and begin again.\n #\n # Each tokenizing method is responsible for returning the number of characters\n # it has consumed.\n #\n # Before returning the token stream, run it through the [Rewriter](rewriter.html)\n # unless explicitly asked not to.\n tokenize: (code, opts = {}) ->\n code = \"\\n#{code}\" if WHITESPACE.test code\n code = code.replace(/\\r/g, '').replace TRAILING_SPACES, ''\n\n @code = code # The remainder of the source code.\n @line = opts.line or 0 # The current line.\n @indent = 0 # The current indentation level.\n @indebt = 0 # The over-indentation at the current level.\n @outdebt = 0 # The under-outdentation at the current level.\n @indents = [] # The stack of all current indentation levels.\n @ends = [] # The stack for pairing up tokens.\n @tokens = [] # Stream of parsed tokens in the form `['TYPE', value, line]`.\n\n # At every position, run through this list of attempted matches,\n # short-circuiting if any of them succeed. Their order determines precedence:\n # `@literalToken` is the fallback catch-all.\n i = 0\n while @chunk = code[i..]\n i += @identifierToken() or\n @commentToken() or\n @whitespaceToken() or\n @lineToken() or\n @heredocToken() or\n @stringToken() or\n @numberToken() or\n @regexToken() or\n @jsToken() or\n @literalToken()\n\n @closeIndentation()\n @error \"missing #{tag}\" if tag = @ends.pop()\n return @tokens if opts.rewrite is off\n (new Rewriter).rewrite @tokens\n\n # Tokenizers\n # ----------\n\n # Matches identifying literals: variables, keywords, method names, etc.\n # Check to ensure that JavaScript reserved words aren't being used as\n # identifiers. Because CoffeeScript reserves a handful of keywords that are\n # allowed in JavaScript, we're careful not to tag them as keywords when\n # referenced as property names here, so you can still do `jQuery.is()` even\n # though `is` means `===` otherwise.\n identifierToken: ->\n return 0 unless match = IDENTIFIER.exec @chunk\n [input, id, colon] = match\n\n if id is 'own' and @tag() is 'FOR'\n @token 'OWN', id\n return id.length\n forcedIdentifier = colon or\n (prev = last @tokens) and (prev[0] in ['.', '?.', '::'] or\n not prev.spaced and prev[0] is '@')\n tag = 'IDENTIFIER'\n\n if not forcedIdentifier and (id in JS_KEYWORDS or id in COFFEE_KEYWORDS)\n tag = id.toUpperCase()\n if tag is 'WHEN' and @tag() in LINE_BREAK\n tag = 'LEADING_WHEN'\n else if tag is 'FOR'\n @seenFor = yes\n else if tag is 'UNLESS'\n tag = 'IF'\n else if tag in UNARY\n tag = 'UNARY'\n else if tag in RELATION\n if tag isnt 'INSTANCEOF' and @seenFor\n tag = 'FOR' + tag\n @seenFor = no\n else\n tag = 'RELATION'\n if @value() is '!'\n @tokens.pop()\n id = '!' + id\n\n if id in JS_FORBIDDEN\n if forcedIdentifier\n tag = 'IDENTIFIER'\n id = new String id\n id.reserved = yes\n else if id in RESERVED\n @error \"reserved word \\\"#{id}\\\"\"\n\n unless forcedIdentifier\n id = COFFEE_ALIAS_MAP[id] if id in COFFEE_ALIASES\n tag = switch id\n when '!' then 'UNARY'\n when '==', '!=' then 'COMPARE'\n when '&&', '||' then 'LOGIC'\n when 'true', 'false' then 'BOOL'\n when 'break', 'continue' then 'STATEMENT'\n else tag\n\n @token tag, id\n @token ':', ':' if colon\n input.length\n\n # Matches numbers, including decimals, hex, and exponential notation.\n # Be careful not to interfere with ranges-in-progress.\n numberToken: ->\n return 0 unless match = NUMBER.exec @chunk\n number = match[0]\n if /^0[BOX]/.test number\n @error \"radix prefix '#{number}' must be lowercase\"\n else if /E/.test(number) and not /^0x/.test number\n @error \"exponential notation '#{number}' must be indicated with a lowercase 'e'\"\n else if /^0\\d*[89]/.test number\n @error \"decimal literal '#{number}' must not be prefixed with '0'\"\n else if /^0\\d+/.test number\n @error \"octal literal '#{number}' must be prefixed with '0o'\"\n lexedLength = number.length\n if octalLiteral = /^0o([0-7]+)/.exec number\n number = '0x' + (parseInt octalLiteral[1], 8).toString 16\n if binaryLiteral = /^0b([01]+)/.exec number\n number = '0x' + (parseInt binaryLiteral[1], 2).toString 16\n @token 'NUMBER', number\n lexedLength\n\n # Matches strings, including multi-line strings. Ensures that quotation marks\n # are balanced within the string's contents, and within nested interpolations.\n stringToken: ->\n switch @chunk.charAt 0\n when \"'\"\n return 0 unless match = SIMPLESTR.exec @chunk\n @token 'STRING', (string = match[0]).replace MULTILINER, '\\\\\\n'\n when '\"'\n return 0 unless string = @balancedString @chunk, '\"'\n if 0 < string.indexOf '#{', 1\n @interpolateString string[1...-1]\n else\n @token 'STRING', @escapeLines string\n else\n return 0\n if octalEsc = /^(?:\\\\.|[^\\\\])*\\\\(?:0[0-7]|[1-7])/.test string\n @error \"octal escape sequences #{string} are not allowed\"\n @line += count string, '\\n'\n string.length\n\n # Matches heredocs, adjusting indentation to the correct level, as heredocs\n # preserve whitespace, but ignore indentation to the left.\n heredocToken: ->\n return 0 unless match = HEREDOC.exec @chunk\n heredoc = match[0]\n quote = heredoc.charAt 0\n doc = @sanitizeHeredoc match[2], quote: quote, indent: null\n if quote is '\"' and 0 <= doc.indexOf '#{'\n @interpolateString doc, heredoc: yes\n else\n @token 'STRING', @makeString doc, quote, yes\n @line += count heredoc, '\\n'\n heredoc.length\n\n # Matches and consumes comments.\n commentToken: ->\n return 0 unless match = @chunk.match COMMENT\n [comment, here] = match\n if here\n @token 'HERECOMMENT', @sanitizeHeredoc here,\n herecomment: true, indent: Array(@indent + 1).join(' ')\n @line += count comment, '\\n'\n comment.length\n\n # Matches JavaScript interpolated directly into the source via backticks.\n jsToken: ->\n return 0 unless @chunk.charAt(0) is '`' and match = JSTOKEN.exec @chunk\n @token 'JS', (script = match[0])[1...-1]\n script.length\n\n # Matches regular expression literals. Lexing regular expressions is difficult\n # to distinguish from division, so we borrow some basic heuristics from\n # JavaScript and Ruby.\n regexToken: ->\n return 0 if @chunk.charAt(0) isnt '/'\n if match = HEREGEX.exec @chunk\n length = @heregexToken match\n @line += count match[0], '\\n'\n return length\n\n prev = last @tokens\n return 0 if prev and (prev[0] in (if prev.spaced then NOT_REGEX else NOT_SPACED_REGEX))\n return 0 unless match = REGEX.exec @chunk\n [match, regex, flags] = match\n if regex[..1] is '/*' then @error 'regular expressions cannot begin with `*`'\n if regex is '//' then regex = '/(?:)/'\n @token 'REGEX', \"#{regex}#{flags}\"\n match.length\n\n # Matches multiline extended regular expressions.\n heregexToken: (match) ->\n [heregex, body, flags] = match\n if 0 > body.indexOf '#{'\n re = body.replace(HEREGEX_OMIT, '').replace(/\\//g, '\\\\/')\n if re.match /^\\*/ then @error 'regular expressions cannot begin with `*`'\n @token 'REGEX', \"/#{ re or '(?:)' }/#{flags}\"\n return heregex.length\n @token 'IDENTIFIER', 'RegExp'\n @tokens.push ['CALL_START', '(']\n tokens = []\n for [tag, value] in @interpolateString(body, regex: yes)\n if tag is 'TOKENS'\n tokens.push value...\n else\n continue unless value = value.replace HEREGEX_OMIT, ''\n value = value.replace /\\\\/g, '\\\\\\\\'\n tokens.push ['STRING', @makeString(value, '\"', yes)]\n tokens.push ['+', '+']\n tokens.pop()\n @tokens.push ['STRING', '\"\"'], ['+', '+'] unless tokens[0]?[0] is 'STRING'\n @tokens.push tokens...\n @tokens.push [',', ','], ['STRING', '\"' + flags + '\"'] if flags\n @token ')', ')'\n heregex.length\n\n # Matches newlines, indents, and outdents, and determines which is which.\n # If we can detect that the current line is continued onto the the next line,\n # then the newline is suppressed:\n #\n # elements\n # .each( ... )\n # .map( ... )\n #\n # Keeps track of the level of indentation, because a single outdent token\n # can close multiple indents, so we need to know how far in we happen to be.\n lineToken: ->\n return 0 unless match = MULTI_DENT.exec @chunk\n indent = match[0]\n @line += count indent, '\\n'\n @seenFor = no\n size = indent.length - 1 - indent.lastIndexOf '\\n'\n noNewlines = @unfinished()\n if size - @indebt is @indent\n if noNewlines then @suppressNewlines() else @newlineToken()\n return indent.length\n if size > @indent\n if noNewlines\n @indebt = size - @indent\n @suppressNewlines()\n return indent.length\n diff = size - @indent + @outdebt\n @token 'INDENT', diff\n @indents.push diff\n @ends.push 'OUTDENT'\n @outdebt = @indebt = 0\n else\n @indebt = 0\n @outdentToken @indent - size, noNewlines\n @indent = size\n indent.length\n\n # Record an outdent token or multiple tokens, if we happen to be moving back\n # inwards past several recorded indents.\n outdentToken: (moveOut, noNewlines) ->\n while moveOut > 0\n len = @indents.length - 1\n if @indents[len] is undefined\n moveOut = 0\n else if @indents[len] is @outdebt\n moveOut -= @outdebt\n @outdebt = 0\n else if @indents[len] < @outdebt\n @outdebt -= @indents[len]\n moveOut -= @indents[len]\n else\n dent = @indents.pop() - @outdebt\n moveOut -= dent\n @outdebt = 0\n @pair 'OUTDENT'\n @token 'OUTDENT', dent\n @outdebt -= moveOut if dent\n @tokens.pop() while @value() is ';'\n @token 'TERMINATOR', '\\n' unless @tag() is 'TERMINATOR' or noNewlines\n this\n\n # Matches and consumes non-meaningful whitespace. Tag the previous token\n # as being \"spaced\", because there are some cases where it makes a difference.\n whitespaceToken: ->\n return 0 unless (match = WHITESPACE.exec @chunk) or\n (nline = @chunk.charAt(0) is '\\n')\n prev = last @tokens\n prev[if match then 'spaced' else 'newLine'] = true if prev\n if match then match[0].length else 0\n\n # Generate a newline token. Consecutive newlines get merged together.\n newlineToken: ->\n @tokens.pop() while @value() is ';'\n @token 'TERMINATOR', '\\n' unless @tag() is 'TERMINATOR'\n this\n\n # Use a `\\` at a line-ending to suppress the newline.\n # The slash is removed here once its job is done.\n suppressNewlines: ->\n @tokens.pop() if @value() is '\\\\'\n this\n\n # We treat all other single characters as a token. E.g.: `( ) , . !`\n # Multi-character operators are also literal tokens, so that Jison can assign\n # the proper order of operations. There are some symbols that we tag specially\n # here. `;` and newlines are both treated as a `TERMINATOR`, we distinguish\n # parentheses that indicate a method call from regular parentheses, and so on.\n literalToken: ->\n if match = OPERATOR.exec @chunk\n [value] = match\n @tagParameters() if CODE.test value\n else\n value = @chunk.charAt 0\n tag = value\n prev = last @tokens\n if value is '=' and prev\n if not prev[1].reserved and prev[1] in JS_FORBIDDEN\n @error \"reserved word \\\"#{@value()}\\\" can't be assigned\"\n if prev[1] in ['||', '&&']\n prev[0] = 'COMPOUND_ASSIGN'\n prev[1] += '='\n return value.length\n if value is ';'\n @seenFor = no\n tag = 'TERMINATOR'\n else if value in MATH then tag = 'MATH'\n else if value in COMPARE then tag = 'COMPARE'\n else if value in COMPOUND_ASSIGN then tag = 'COMPOUND_ASSIGN'\n else if value in UNARY then tag = 'UNARY'\n else if value in SHIFT then tag = 'SHIFT'\n else if value in LOGIC or value is '?' and prev?.spaced then tag = 'LOGIC'\n else if prev and not prev.spaced\n if value is '(' and prev[0] in CALLABLE\n prev[0] = 'FUNC_EXIST' if prev[0] is '?'\n tag = 'CALL_START'\n else if value is '[' and prev[0] in INDEXABLE\n tag = 'INDEX_START'\n switch prev[0]\n when '?' then prev[0] = 'INDEX_SOAK'\n switch value\n when '(', '{', '[' then @ends.push INVERSES[value]\n when ')', '}', ']' then @pair value\n @token tag, value\n value.length\n\n # Token Manipulators\n # ------------------\n\n # Sanitize a heredoc or herecomment by\n # erasing all external indentation on the left-hand side.\n sanitizeHeredoc: (doc, options) ->\n {indent, herecomment} = options\n if herecomment\n if HEREDOC_ILLEGAL.test doc\n @error \"block comment cannot contain \\\"*/\\\", starting\"\n return doc if doc.indexOf('\\n') <= 0\n else\n while match = HEREDOC_INDENT.exec doc\n attempt = match[1]\n indent = attempt if indent is null or 0 < attempt.length < indent.length\n doc = doc.replace /// \\n #{indent} ///g, '\\n' if indent\n doc = doc.replace /^\\n/, '' unless herecomment\n doc\n\n # A source of ambiguity in our grammar used to be parameter lists in function\n # definitions versus argument lists in function calls. Walk backwards, tagging\n # parameters specially in order to make things easier for the parser.\n tagParameters: ->\n return this if @tag() isnt ')'\n stack = []\n {tokens} = this\n i = tokens.length\n tokens[--i][0] = 'PARAM_END'\n while tok = tokens[--i]\n switch tok[0]\n when ')'\n stack.push tok\n when '(', 'CALL_START'\n if stack.length then stack.pop()\n else if tok[0] is '('\n tok[0] = 'PARAM_START'\n return this\n else return this\n this\n\n # Close up all remaining open blocks at the end of the file.\n closeIndentation: ->\n @outdentToken @indent\n\n # Matches a balanced group such as a single or double-quoted string. Pass in\n # a series of delimiters, all of which must be nested correctly within the\n # contents of the string. This method allows us to have strings within\n # interpolations within strings, ad infinitum.\n balancedString: (str, end) ->\n continueCount = 0\n stack = [end]\n for i in [1...str.length]\n if continueCount\n --continueCount\n continue\n switch letter = str.charAt i\n when '\\\\'\n ++continueCount\n continue\n when end\n stack.pop()\n unless stack.length\n return str[0..i]\n end = stack[stack.length - 1]\n continue\n if end is '}' and letter in ['\"', \"'\"]\n stack.push end = letter\n else if end is '}' and letter is '/' and match = (HEREGEX.exec(str[i..]) or REGEX.exec(str[i..]))\n continueCount += match[0].length - 1\n else if end is '}' and letter is '{'\n stack.push end = '}'\n else if end is '\"' and prev is '#' and letter is '{'\n stack.push end = '}'\n prev = letter\n @error \"missing #{ stack.pop() }, starting\"\n\n # Expand variables and expressions inside double-quoted strings using\n # Ruby-like notation for substitution of arbitrary expressions.\n #\n # \"Hello #{name.capitalize()}.\"\n #\n # If it encounters an interpolation, this method will recursively create a\n # new Lexer, tokenize the interpolated contents, and merge them into the\n # token stream.\n interpolateString: (str, options = {}) ->\n {heredoc, regex} = options\n tokens = []\n pi = 0\n i = -1\n while letter = str.charAt i += 1\n if letter is '\\\\'\n i += 1\n continue\n unless letter is '#' and str.charAt(i+1) is '{' and\n (expr = @balancedString str[i + 1..], '}')\n continue\n tokens.push ['NEOSTRING', str[pi...i]] if pi < i\n inner = expr[1...-1]\n if inner.length\n nested = new Lexer().tokenize inner, line: @line, rewrite: off\n nested.pop()\n nested.shift() if nested[0]?[0] is 'TERMINATOR'\n if len = nested.length\n if len > 1\n nested.unshift ['(', '(', @line]\n nested.push [')', ')', @line]\n tokens.push ['TOKENS', nested]\n i += expr.length\n pi = i + 1\n tokens.push ['NEOSTRING', str[pi..]] if i > pi < str.length\n return tokens if regex\n return @token 'STRING', '\"\"' unless tokens.length\n tokens.unshift ['', ''] unless tokens[0][0] is 'NEOSTRING'\n @token '(', '(' if interpolated = tokens.length > 1\n for [tag, value], i in tokens\n @token '+', '+' if i\n if tag is 'TOKENS'\n @tokens.push value...\n else\n @token 'STRING', @makeString value, '\"', heredoc\n @token ')', ')' if interpolated\n tokens\n\n # Pairs up a closing token, ensuring that all listed pairs of tokens are\n # correctly balanced throughout the course of the token stream.\n pair: (tag) ->\n unless tag is wanted = last @ends\n @error \"unmatched #{tag}\" unless 'OUTDENT' is wanted\n # Auto-close INDENT to support syntax like this:\n #\n # el.click((event) ->\n # el.hide())\n #\n @indent -= size = last @indents\n @outdentToken size, true\n return @pair tag\n @ends.pop()\n\n # Helpers\n # -------\n\n # Add a token to the results, taking note of the line number.\n token: (tag, value) ->\n @tokens.push [tag, value, @line]\n\n # Peek at a tag in the current token stream.\n tag: (index, tag) ->\n (tok = last @tokens, index) and if tag then tok[0] = tag else tok[0]\n\n # Peek at a value in the current token stream.\n value: (index, val) ->\n (tok = last @tokens, index) and if val then tok[1] = val else tok[1]\n\n # Are we in the midst of an unfinished expression?\n unfinished: ->\n LINE_CONTINUER.test(@chunk) or\n @tag() in ['\\\\', '.', '?.', 'UNARY', 'MATH', '+', '-', 'SHIFT', 'RELATION'\n 'COMPARE', 'LOGIC', 'THROW', 'EXTENDS']\n\n # Converts newlines for string literals.\n escapeLines: (str, heredoc) ->\n str.replace MULTILINER, if heredoc then '\\\\n' else ''\n\n # Constructs a string token by escaping quotes and newlines.\n makeString: (body, quote, heredoc) ->\n return quote + quote unless body\n body = body.replace /\\\\([\\s\\S])/g, (match, contents) ->\n if contents in ['\\n', quote] then contents else match\n body = body.replace /// #{quote} ///g, '\\\\$&'\n quote + @escapeLines(body, heredoc) + quote\n\n # Throws a syntax error on the current `@line`.\n error: (message) ->\n throw SyntaxError \"#{message} on line #{ @line + 1}\"\n\n# Constants\n# ---------\n\n# Keywords that CoffeeScript shares in common with JavaScript.\nJS_KEYWORDS = [\n 'true', 'false', 'null', 'this'\n 'new', 'delete', 'typeof', 'in', 'instanceof'\n 'return', 'throw', 'break', 'continue', 'debugger'\n 'if', 'else', 'switch', 'for', 'while', 'do', 'try', 'catch', 'finally'\n 'class', 'extends', 'super'\n]\n\n# CoffeeScript-only keywords.\nCOFFEE_KEYWORDS = ['undefined', 'then', 'unless', 'until', 'loop', 'of', 'by', 'when']\n\nCOFFEE_ALIAS_MAP =\n and : '&&'\n or : '||'\n is : '=='\n isnt : '!='\n not : '!'\n yes : 'true'\n no : 'false'\n on : 'true'\n off : 'false'\n\nCOFFEE_ALIASES = (key for key of COFFEE_ALIAS_MAP)\nCOFFEE_KEYWORDS = COFFEE_KEYWORDS.concat COFFEE_ALIASES\n\n# The list of keywords that are reserved by JavaScript, but not used, or are\n# used by CoffeeScript internally. We throw an error when these are encountered,\n# to avoid having a JavaScript error at runtime.\nRESERVED = [\n 'case', 'default', 'function', 'var', 'void', 'with'\n 'const', 'let', 'enum', 'export', 'import', 'native'\n '__hasProp', '__extends', '__slice', '__bind', '__indexOf'\n 'implements', 'interface', 'let', 'package',\n 'private', 'protected', 'public', 'static', 'yield'\n]\n\nSTRICT_PROSCRIBED = ['arguments', 'eval']\n\n# The superset of both JavaScript keywords and reserved words, none of which may\n# be used as identifiers or properties.\nJS_FORBIDDEN = JS_KEYWORDS.concat(RESERVED).concat(STRICT_PROSCRIBED)\n\nexports.RESERVED = RESERVED.concat(JS_KEYWORDS).concat(COFFEE_KEYWORDS).concat(STRICT_PROSCRIBED)\nexports.STRICT_PROSCRIBED = STRICT_PROSCRIBED\n\n# Token matching regexes.\nIDENTIFIER = /// ^\n ( [$A-Za-z_\\x7f-\\uffff][$\\w\\x7f-\\uffff]* )\n ( [^\\n\\S]* : (?!:) )? # Is this a property name?\n///\n\nNUMBER = ///\n ^ 0b[01]+ | # binary\n ^ 0o[0-7]+ | # octal\n ^ 0x[\\da-f]+ | # hex\n ^ \\d*\\.?\\d+ (?:e[+-]?\\d+)? # decimal\n///i\n\nHEREDOC = /// ^ (\"\"\"|''') ([\\s\\S]*?) (?:\\n[^\\n\\S]*)? \\1 ///\n\nOPERATOR = /// ^ (\n ?: [-=]> # function\n | [-+*/%<>&|^!?=]= # compound assign / compare\n | >>>=? # zero-fill right shift\n | ([-+:])\\1 # doubles\n | ([&|<>])\\2=? # logic / shift\n | \\?\\. # soak access\n | \\.{2,3} # range or splat\n) ///\n\nWHITESPACE = /^[^\\n\\S]+/\n\nCOMMENT = /^###([^#][\\s\\S]*?)(?:###[^\\n\\S]*|(?:###)?$)|^(?:\\s*#(?!##[^#]).*)+/\n\nCODE = /^[-=]>/\n\nMULTI_DENT = /^(?:\\n[^\\n\\S]*)+/\n\nSIMPLESTR = /^'[^\\\\']*(?:\\\\.[^\\\\']*)*'/\n\nJSTOKEN = /^`[^\\\\`]*(?:\\\\.[^\\\\`]*)*`/\n\n# Regex-matching-regexes.\nREGEX = /// ^\n (/ (?! [\\s=] ) # disallow leading whitespace or equals signs\n [^ [ / \\n \\\\ ]* # every other thing\n (?:\n (?: \\\\[\\s\\S] # anything escaped\n | \\[ # character class\n [^ \\] \\n \\\\ ]*\n (?: \\\\[\\s\\S] [^ \\] \\n \\\\ ]* )*\n ]\n ) [^ [ / \\n \\\\ ]*\n )*\n /) ([imgy]{0,4}) (?!\\w)\n///\n\nHEREGEX = /// ^ /{3} ([\\s\\S]+?) /{3} ([imgy]{0,4}) (?!\\w) ///\n\nHEREGEX_OMIT = /\\s+(?:#.*)?/g\n\n# Token cleaning regexes.\nMULTILINER = /\\n/g\n\nHEREDOC_INDENT = /\\n+([^\\n\\S]*)/g\n\nHEREDOC_ILLEGAL = /\\*\\//\n\nLINE_CONTINUER = /// ^ \\s* (?: , | \\??\\.(?![.\\d]) | :: ) ///\n\nTRAILING_SPACES = /\\s+$/\n\n# Compound assignment tokens.\nCOMPOUND_ASSIGN = [\n '-=', '+=', '/=', '*=', '%=', '||=', '&&=', '?=', '<<=', '>>=', '>>>=', '&=', '^=', '|='\n]\n\n# Unary tokens.\nUNARY = ['!', '~', 'NEW', 'TYPEOF', 'DELETE', 'DO']\n\n# Logical tokens.\nLOGIC = ['&&', '||', '&', '|', '^']\n\n# Bit-shifting tokens.\nSHIFT = ['<<', '>>', '>>>']\n\n# Comparison tokens.\nCOMPARE = ['==', '!=', '<', '>', '<=', '>=']\n\n# Mathematical tokens.\nMATH = ['*', '/', '%']\n\n# Relational tokens that are negatable with `not` prefix.\nRELATION = ['IN', 'OF', 'INSTANCEOF']\n\n# Boolean tokens.\nBOOL = ['TRUE', 'FALSE']\n\n# Tokens which a regular expression will never immediately follow, but which\n# a division operator might.\n#\n# See: http://www.mozilla.org/js/language/js20-2002-04/rationale/syntax.html#regular-expressions\n#\n# Our list is shorter, due to sans-parentheses method calls.\nNOT_REGEX = ['NUMBER', 'REGEX', 'BOOL', 'NULL', 'UNDEFINED', '++', '--', ']']\n\n# If the previous token is not spaced, there are more preceding tokens that\n# force a division parse:\nNOT_SPACED_REGEX = NOT_REGEX.concat ')', '}', 'THIS', 'IDENTIFIER', 'STRING'\n\n# Tokens which could legitimately be invoked or indexed. An opening\n# parentheses or bracket following these tokens will be recorded as the start\n# of a function invocation or indexing operation.\nCALLABLE = ['IDENTIFIER', 'STRING', 'REGEX', ')', ']', '}', '?', '::', '@', 'THIS', 'SUPER']\nINDEXABLE = CALLABLE.concat 'NUMBER', 'BOOL', 'NULL', 'UNDEFINED'\n\n# Tokens that, when immediately preceding a `WHEN`, indicate that the `WHEN`\n# occurs at the start of a line. We disambiguate these from trailing whens to\n# avoid an ambiguity in the grammar.\nLINE_BREAK = ['INDENT', 'OUTDENT', 'TERMINATOR']\n" }, { "path": "src/test/resources/samples/langs/CoffeeScript/rack_application.coffee", "content": "# The `RackApplication` class is responsible for managing a\n# [Nack](http://josh.github.com/nack/) pool for a given Rack\n# application. Incoming HTTP requests are dispatched to\n# `RackApplication` instances by an `HttpServer`, where they are\n# subsequently handled by a pool of Nack worker processes. By default,\n# Pow tells Nack to use a maximum of two worker processes per\n# application, but this can be overridden with the configuration's\n# `workers` option.\n#\n# Before creating the Nack pool, Pow executes the `.powrc` and\n# `.powenv` scripts if they're present in the application root,\n# captures their environment variables, and passes them along to the\n# Nack worker processes. This lets you modify your `RUBYOPT` to use\n# different Ruby options, for example.\n#\n# If [rvm](http://rvm.beginrescueend.com/) is installed and an\n# `.rvmrc` file is present in the application's root, Pow will load\n# both before creating the Nack pool. This makes it easy to run an\n# app with a specific version of Ruby.\n#\n# Nack workers remain running until they're killed, restarted (by\n# touching the `tmp/restart.txt` file in the application root), or\n# until the application has not served requests for the length of time\n# specified in the configuration's `timeout` option (15 minutes by\n# default).\n\nasync = require \"async\"\nfs = require \"fs\"\nnack = require \"nack\"\n\n{bufferLines, pause, sourceScriptEnv} = require \"./util\"\n{join, exists, basename, resolve} = require \"path\"\n\nmodule.exports = class RackApplication\n # Create a `RackApplication` for the given configuration and\n # root path. The application begins life in the uninitialized\n # state.\n constructor: (@configuration, @root, @firstHost) ->\n @logger = @configuration.getLogger join \"apps\", basename @root\n @readyCallbacks = []\n @quitCallbacks = []\n @statCallbacks = []\n\n # Queue `callback` to be invoked when the application becomes ready,\n # then start the initialization process. If the application's state\n # is ready, the callback is invoked immediately.\n ready: (callback) ->\n if @state is \"ready\"\n callback()\n else\n @readyCallbacks.push callback\n @initialize()\n\n # Tell the application to quit and queue `callback` to be invoked\n # when all workers have exited. If the application has already quit,\n # the callback is invoked immediately.\n quit: (callback) ->\n if @state\n @quitCallbacks.push callback if callback\n @terminate()\n else\n callback?()\n\n # Stat `tmp/restart.txt` in the application root and invoke the\n # given callback with a single argument indicating whether or not\n # the file has been touched since the last call to\n # `queryRestartFile`.\n queryRestartFile: (callback) ->\n fs.stat join(@root, \"tmp/restart.txt\"), (err, stats) =>\n if err\n @mtime = null\n callback false\n else\n lastMtime = @mtime\n @mtime = stats.mtime.getTime()\n callback lastMtime isnt @mtime\n\n # Check to see if `tmp/always_restart.txt` is present in the\n # application root, and set the pool's `runOnce` option\n # accordingly. Invoke `callback` when the existence check has\n # finished. (Multiple calls to this method are aggregated.)\n setPoolRunOnceFlag: (callback) ->\n unless @statCallbacks.length\n exists join(@root, \"tmp/always_restart.txt\"), (alwaysRestart) =>\n @pool.runOnce = alwaysRestart\n statCallback() for statCallback in @statCallbacks\n @statCallbacks = []\n\n @statCallbacks.push callback\n\n # Collect environment variables from `.powrc` and `.powenv`, in that\n # order, if present. The idea is that `.powrc` files can be checked\n # into a source code repository for global configuration, leaving\n # `.powenv` free for any necessary local overrides.\n loadScriptEnvironment: (env, callback) ->\n async.reduce [\".powrc\", \".envrc\", \".powenv\"], env, (env, filename, callback) =>\n exists script = join(@root, filename), (scriptExists) ->\n if scriptExists\n sourceScriptEnv script, env, callback\n else\n callback null, env\n , callback\n\n # If `.rvmrc` and `$HOME/.rvm/scripts/rvm` are present, load rvm,\n # source `.rvmrc`, and invoke `callback` with the resulting\n # environment variables. If `.rvmrc` is present but rvm is not\n # installed, invoke `callback` without sourcing `.rvmrc`.\n # Before loading rvm, Pow invokes a helper script that shows a\n # deprecation notice if it has not yet been displayed.\n loadRvmEnvironment: (env, callback) ->\n exists script = join(@root, \".rvmrc\"), (rvmrcExists) =>\n if rvmrcExists\n exists rvm = @configuration.rvmPath, (rvmExists) =>\n if rvmExists\n libexecPath = resolve \"#{__dirname}/../libexec\"\n before = \"\"\"\n '#{libexecPath}/pow_rvm_deprecation_notice' '#{[@firstHost]}'\n source '#{rvm}' > /dev/null\n \"\"\".trim()\n sourceScriptEnv script, env, {before}, callback\n else\n callback null, env\n else\n callback null, env\n\n # Stat `tmp/restart.txt` to cache its mtime, then load the\n # application's full environment from `.powrc`, `.powenv`, and\n # `.rvmrc`.\n loadEnvironment: (callback) ->\n @queryRestartFile =>\n @loadScriptEnvironment @configuration.env, (err, env) =>\n if err then callback err\n else @loadRvmEnvironment env, (err, env) =>\n if err then callback err\n else callback null, env\n\n # Begin the initialization process if the application is in the\n # uninitialized state. (If the application is terminating, queue a\n # call to `initialize` after all workers have exited.)\n initialize: ->\n if @state\n if @state is \"terminating\"\n @quit => @initialize()\n return\n\n @state = \"initializing\"\n\n # Load the application's environment. If an error is raised or\n # either of the environment scripts exits with a non-zero status,\n # reset the application's state and log the error.\n @loadEnvironment (err, env) =>\n if err\n @state = null\n @logger.error err.message\n @logger.error \"stdout: #{err.stdout}\"\n @logger.error \"stderr: #{err.stderr}\"\n\n # Set the application's state to ready. Then create the Nack\n # pool instance using the `workers` and `timeout` options from\n # the application's environment or the global configuration.\n else\n @state = \"ready\"\n\n @pool = nack.createPool join(@root, \"config.ru\"),\n env: env\n size: env?.POW_WORKERS ? @configuration.workers\n idle: (env?.POW_TIMEOUT ? @configuration.timeout) * 1000\n\n # Log the workers' stderr and stdout, and log each worker's\n # PID as it spawns and exits.\n bufferLines @pool.stdout, (line) => @logger.info line\n bufferLines @pool.stderr, (line) => @logger.warning line\n\n @pool.on \"worker:spawn\", (process) =>\n @logger.debug \"nack worker #{process.child.pid} spawned\"\n\n @pool.on \"worker:exit\", (process) =>\n @logger.debug \"nack worker exited\"\n\n # Invoke and remove all queued callbacks, passing along the\n # error, if any.\n readyCallback err for readyCallback in @readyCallbacks\n @readyCallbacks = []\n\n # Begin the termination process. (If the application is initializing,\n # wait until it is ready before shutting down.)\n terminate: ->\n if @state is \"initializing\"\n @ready => @terminate()\n\n else if @state is \"ready\"\n @state = \"terminating\"\n\n # Instruct all workers to exit. After the processes have\n # terminated, reset the application's state, then invoke and\n # remove all queued callbacks.\n @pool.quit =>\n @state = null\n @mtime = null\n @pool = null\n\n quitCallback() for quitCallback in @quitCallbacks\n @quitCallbacks = []\n\n # Handle an incoming HTTP request. Wait until the application is in\n # the ready state, restart the workers if necessary, then pass the\n # request along to the Nack pool. If the Nack worker raises an\n # exception handling the request, reset the application.\n handle: (req, res, next, callback) ->\n resume = pause req\n @ready (err) =>\n return next err if err\n @setPoolRunOnceFlag =>\n @restartIfNecessary =>\n req.proxyMetaVariables =\n SERVER_PORT: @configuration.dstPort.toString()\n try\n @pool.proxy req, res, (err) =>\n @quit() if err\n next err\n finally\n resume()\n callback?()\n\n # Terminate the application, re-initialize it, and invoke the given\n # callback when the application's state becomes ready.\n restart: (callback) ->\n @quit =>\n @ready callback\n\n # Restart the application if `tmp/restart.txt` has been touched\n # since the last call to this function.\n restartIfNecessary: (callback) ->\n @queryRestartFile (mtimeChanged) =>\n if mtimeChanged\n @restart callback\n else\n callback()\n\n # Append RVM autoload boilerplate to the application's `.powrc`\n # file. This is called by the RVM deprecation notice mini-app.\n writeRvmBoilerplate: ->\n powrc = join @root, \".powrc\"\n boilerplate = @constructor.rvmBoilerplate\n\n fs.readFile powrc, \"utf8\", (err, contents) ->\n contents ?= \"\"\n if contents.indexOf(boilerplate) is -1\n fs.writeFile powrc, \"#{boilerplate}\\n#{contents}\"\n\n @rvmBoilerplate: \"\"\"\n if [ -f \"$rvm_path/scripts/rvm\" ] && [ -f \".rvmrc\" ]; then\n source \"$rvm_path/scripts/rvm\"\n source \".rvmrc\"\n fi\n \"\"\"\n" }, { "path": "src/test/resources/samples/langs/CoffeeScript/xipd.coffee", "content": "dnsserver = require \"dnsserver\"\n\nexports.Server = class Server extends dnsserver.Server\n NS_T_A = 1\n NS_T_NS = 2\n NS_T_CNAME = 5\n NS_T_SOA = 6\n NS_C_IN = 1\n NS_RCODE_NXDOMAIN = 3\n\n constructor: (domain, @rootAddress) ->\n super\n @domain = domain.toLowerCase()\n @soa = createSOA @domain\n @on \"request\", @handleRequest\n\n handleRequest: (req, res) =>\n question = req.question\n subdomain = @extractSubdomain question.name\n\n if subdomain? and isARequest question\n res.addRR question.name, NS_T_A, NS_C_IN, 600, subdomain.getAddress()\n else if subdomain?.isEmpty() and isNSRequest question\n res.addRR question.name, NS_T_SOA, NS_C_IN, 600, @soa, true\n else\n res.header.rcode = NS_RCODE_NXDOMAIN\n\n res.send()\n\n extractSubdomain: (name) ->\n Subdomain.extract name, @domain, @rootAddress\n\n isARequest = (question) ->\n question.type is NS_T_A and question.class is NS_C_IN\n\n isNSRequest = (question) ->\n question.type is NS_T_NS and question.class is NS_C_IN\n\n createSOA = (domain) ->\n mname = \"ns-1.#{domain}\"\n rname = \"hostmaster.#{domain}\"\n serial = parseInt new Date().getTime() / 1000\n refresh = 28800\n retry = 7200\n expire = 604800\n minimum = 3600\n dnsserver.createSOA mname, rname, serial, refresh, retry, expire, minimum\n\nexports.createServer = (domain, address = \"127.0.0.1\") ->\n new Server domain, address\n\nexports.Subdomain = class Subdomain\n @extract: (name, domain, address) ->\n return unless name\n name = name.toLowerCase()\n offset = name.length - domain.length\n\n if domain is name.slice offset\n subdomain = if 0 >= offset then null else name.slice 0, offset - 1\n new constructor subdomain, address if constructor = @for subdomain\n\n @for: (subdomain = \"\") ->\n if IPAddressSubdomain.pattern.test subdomain\n IPAddressSubdomain\n else if EncodedSubdomain.pattern.test subdomain\n EncodedSubdomain\n else\n Subdomain\n\n constructor: (@subdomain, @address) ->\n @labels = subdomain?.split(\".\") ? []\n @length = @labels.length\n\n isEmpty: ->\n @length is 0\n\n getAddress: ->\n @address\n\nclass IPAddressSubdomain extends Subdomain\n @pattern = /// (^|\\.)\n ((25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\\.){3}\n (25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\n $ ///\n\n getAddress: ->\n @labels.slice(-4).join \".\"\n\nclass EncodedSubdomain extends Subdomain\n @pattern = /(^|\\.)[a-z0-9]{1,7}$/\n\n getAddress: ->\n decode @labels[@length - 1]\n\nexports.encode = encode = (ip) ->\n value = 0\n for byte, index in ip.split \".\"\n value += parseInt(byte, 10) << (index * 8)\n (value >>> 0).toString 36\n\nPATTERN = /^[a-z0-9]{1,7}$/\n\nexports.decode = decode = (string) ->\n return unless PATTERN.test string\n value = parseInt string, 36\n ip = []\n for i in [1..4]\n ip.push value & 0xFF\n value >>= 8\n ip.join \".\"\n" }, { "path": "src/test/resources/samples/langs/ColdFusion/example.cfm", "content": "\n --->\n\n--->\n\n\n\nDate Functions\n\n\n\n\n #RightNow#
\n #DateFormat(RightNow)#
\n #DateFormat(RightNow,\"mm/dd/yy\")#
\n #TimeFormat(RightNow)#
\n #TimeFormat(RightNow,\"hh:mm tt\")#
\n #IsDate(RightNow)#
\n #IsDate(\"January 31, 2007\")#
\n #IsDate(\"foo\")#
\n #DaysInMonth(RightNow)#\n\n\n\n\n\n #x#\n #y#\n #z#\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n ---> comment --->" }, { "path": "src/test/resources/samples/langs/ColdFusion CFC/exampleScript.cfc", "content": "/**\n********************************************************************************\nContentBox - A Modular Content Platform\nCopyright 2012 by Luis Majano and Ortus Solutions, Corp\nwww.gocontentbox.org | www.luismajano.com | www.ortussolutions.com\n********************************************************************************\nApache License, Version 2.0\n\nCopyright Since [2012] [Luis Majano and Ortus Solutions,Corp]\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\nhttp://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********************************************************************************\n* A generic content service for content objects\n*/\ncomponent extends=\"coldbox.system.orm.hibernate.VirtualEntityService\" singleton{\n\n\t// DI\n\tproperty name=\"settingService\"\t\t\tinject=\"id:settingService@cb\";\n\tproperty name=\"cacheBox\"\t\t\t\tinject=\"cachebox\";\n\tproperty name=\"log\"\t\t\t\t\t\tinject=\"logbox:logger:{this}\";\n\tproperty name=\"customFieldService\" \t \tinject=\"customFieldService@cb\";\n\tproperty name=\"categoryService\" \t \tinject=\"categoryService@cb\";\n\tproperty name=\"commentService\" \t \t\tinject=\"commentService@cb\";\n\tproperty name=\"contentVersionService\"\tinject=\"contentVersionService@cb\";\n\tproperty name=\"authorService\"\t\t\tinject=\"authorService@cb\";\n\tproperty name=\"populator\"\t\t\t\tinject=\"wirebox:populator\";\n\tproperty name=\"systemUtil\"\t\t\t\tinject=\"SystemUtil@cb\";\n\t\n\t/*\n\t* Constructor\n\t* @entityName.hint The content entity name to bind this service to.\n\t*/\n\tContentService function init(entityName=\"cbContent\"){\n\t\t// init it\n\t\tsuper.init(entityName=arguments.entityName, useQueryCaching=true);\n\n\t\t// Test scope coloring in pygments\n\t\tthis.colorTestVar = \"Just for testing pygments!\";\n\t\tcookie.colorTestVar = \"\";\n\t\tclient.colorTestVar = \"\"\n\t\tsession.colorTestVar = \"\";\n\t\tapplication.colorTestVar = \"\";\n\n\t\treturn this;\n\t}\n\n\t/**\n\t* Clear all content caches\n\t* @async.hint Run it asynchronously or not, defaults to false\n\t*/\n\tfunction clearAllCaches(boolean async=false){\n\t\tvar settings = settingService.getAllSettings(asStruct=true);\n\t\t// Get appropriate cache provider\n\t\tvar cache = cacheBox.getCache( settings.cb_content_cacheName );\n\t\tcache.clearByKeySnippet(keySnippet=\"cb-content\",async=arguments.async);\n\t\treturn this;\n\t}\n\n\t/**\n\t* Clear all page wrapper caches\n\t* @async.hint Run it asynchronously or not, defaults to false\n\t*/\n\tfunction clearAllPageWrapperCaches(boolean async=false){\n\t\tvar settings = settingService.getAllSettings(asStruct=true);\n\t\t// Get appropriate cache provider\n\t\tvar cache = cacheBox.getCache( settings.cb_content_cacheName );\n\t\tcache.clearByKeySnippet(keySnippet=\"cb-content-pagewrapper\",async=arguments.async);\n\t\treturn this;\n\t}\n\n\t/**\n\t* Clear all page wrapper caches\n\t* @slug.hint The slug partial to clean on\n\t* @async.hint Run it asynchronously or not, defaults to false\n\t*/\n\tfunction clearPageWrapperCaches(required any slug, boolean async=false){\n\t\tvar settings = settingService.getAllSettings(asStruct=true);\n\t\t// Get appropriate cache provider\n\t\tvar cache = cacheBox.getCache( settings.cb_content_cacheName );\n\t\tcache.clearByKeySnippet(keySnippet=\"cb-content-pagewrapper-#arguments.slug#\",async=arguments.async);\n\t\treturn this;\n\t}\n\n\t/**\n\t* Clear a page wrapper cache\n\t* @slug.hint The slug to clean\n\t* @async.hint Run it asynchronously or not, defaults to false\n\t*/\n\tfunction clearPageWrapper(required any slug, boolean async=false){\n\t\tvar settings = settingService.getAllSettings(asStruct=true);\n\t\t// Get appropriate cache provider\n\t\tvar cache = cacheBox.getCache( settings.cb_content_cacheName );\n\t\tcache.clear(\"cb-content-pagewrapper-#arguments.slug#/\");\n\t\treturn this;\n\t}\n\n\t/**\n\t* Searches published content with cool paramters, remember published content only\n\t* @searchTerm.hint The search term to search\n\t* @max.hint The maximum number of records to paginate\n\t* @offset.hint The offset in the pagination\n\t* @asQuery.hint Return as query or array of objects, defaults to array of objects\n\t* @sortOrder.hint The sorting of the search results, defaults to publishedDate DESC\n\t* @isPublished.hint Search for published, non-published or both content objects [true, false, 'all']\n\t* @searchActiveContent.hint Search only content titles or both title and active content. Defaults to both.\n\t*/\n\tfunction searchContent(\n\t\tany searchTerm=\"\", \n\t\tnumeric max=0, \n\t\tnumeric offset=0, \n\t\tboolean asQuery=false, \n\t\tany sortOrder=\"publishedDate DESC\", \n\t\tany isPublished=true, \n\t\tboolean searchActiveContent=true){\n\n\t\tvar results = {};\n\t\tvar c = newCriteria();\n\n\t\t// only published content\n\t\tif( isBoolean( arguments.isPublished ) ){\n\t\t\t// Published bit\n\t\t\tc.isEq( \"isPublished\", javaCast( \"Boolean\", arguments.isPublished ) );\n\t\t\t// Published eq true evaluate other params\n\t\t\tif( arguments.isPublished ){\n\t\t\t\tc.isLt(\"publishedDate\", now() )\n\t\t\t\t.$or( c.restrictions.isNull(\"expireDate\"), c.restrictions.isGT(\"expireDate\", now() ) )\n\t\t\t\t.isEq(\"passwordProtection\",\"\");\n\t\t\t}\n\t\t}\n\n\t\t// Search Criteria\n\t\tif( len( arguments.searchTerm ) ){\n\t\t\t// like disjunctions\n\t\t\tc.createAlias(\"activeContent\",\"ac\");\n\t\t\t// Do we search title and active content or just title?\n\t\t\tif( arguments.searchActiveContent ){\n\t\t\t\tc.$or( c.restrictions.like(\"title\",\"%#arguments.searchTerm#%\"),\n\t\t\t\t \t c.restrictions.like(\"ac.content\", \"%#arguments.searchTerm#%\") );\n\t\t\t}\n\t\t\telse{\n\t\t\t\tc.like( \"title\", \"%#arguments.searchTerm#%\" ); \n\t\t\t}\n\t\t}\n\n\t\t// run criteria query and projections count\n\t\tresults.count = c.count( \"contentID\" );\n\t\tresults.content = c.resultTransformer( c.DISTINCT_ROOT_ENTITY )\n\t\t\t\t\t\t\t.list(offset=arguments.offset, max=arguments.max, sortOrder=arguments.sortOrder, asQuery=arguments.asQuery);\n\t\n\t\treturn results;\n\t}\n\n/********************************************* PRIVATE *********************************************/\n\t\n\n\t/**\n\t* Update the content hits\n\t* @contentID.hint The content id to update\n\t*/\n\tprivate function syncUpdateHits(required contentID){\n\t\tvar q = new Query(sql=\"UPDATE cb_content SET hits = hits + 1 WHERE contentID = #arguments.contentID#\").execute();\n\t\treturn this;\n\t}\n\t\n\t\n\tprivate function closureTest(){\n\t\tmethodCall(\n\t\t\tparam1,\n\t\t\tfunction( arg1, required arg2 ){\n\t\t\t\tvar settings = settingService.getAllSettings(asStruct=true);\n\t\t\t\t// Get appropriate cache provider\n\t\t\t\tvar cache = cacheBox.getCache( settings.cb_content_cacheName );\n\t\t\t\tcache.clear(\"cb-content-pagewrapper-#arguments.slug#/\");\n\t\t\t\treturn this;\n\t\t\t},\n\t\t\tparam1\n\t\t);\n\t}\n\t\n\tprivate function StructliteralTest(){\n\t\treturn {\n\t\t\tfoo = bar,\n\t\t\tbrad = 'Wood',\n\t\t\tfunc = function( arg1, required arg2 ){\n\t\t\t\tvar settings = settingService.getAllSettings(asStruct=true);\n\t\t\t\t// Get appropriate cache provider\n\t\t\t\tvar cache = cacheBox.getCache( settings.cb_content_cacheName );\n\t\t\t\tcache.clear(\"cb-content-pagewrapper-#arguments.slug#/\");\n\t\t\t\treturn this;\n\t\t\t},\n\t\t\tarray = [\n\t\t\t\t1,\n\t\t\t\t2,\n\t\t\t\t3,\n\t\t\t\t4,\n\t\t\t\t5,\n\t\t\t\t'test',\n\t\t\t\t'testing',\n\t\t\t\t'testerton',\n\t\t\t\t{\n\t\t\t\t\tfoo = true,\n\t\t\t\t\tbrad = false,\n\t\t\t\t\twood = null\n\t\t\t\t}\n\t\t\t],\n\t\t\tlast = \"final\"\n\t\t};\n\t}\n\t\n\tprivate function arrayliteralTest(){\n\t\treturn [\n\t\t\t1,\n\t\t\t2,\n\t\t\t3,\n\t\t\t4,\n\t\t\t5,\n\t\t\t'test',\n\t\t\t'testing',\n\t\t\t'testerton',\n\t\t\t{\n\t\t\t\tfoo = true,\n\t\t\t\tbrad = false,\n\t\t\t\twood = null\n\t\t\t},\n\t\t\t'testy-von-testavich'\n\t\t];\n\t}\n\t\n}" }, { "path": "src/test/resources/samples/langs/ColdFusion CFC/exampleTag.cfc", "content": "\n\t\n\t\n\t\t\n\t\t\n\n\t\t\n\t\n\n\t\n\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\n\t\n\t\n" }, { "path": "src/test/resources/samples/langs/Common Lisp/array.l", "content": ";;; -*- Mode: Lisp; Package: LISP -*-\n;;;\n;;; This file is part of xyzzy.\n;;;\n\n(provide \"array\")\n\n(in-package \"lisp\")\n\n(export '(make-vector make-array vector array-dimensions array-in-bounds-p\n\t upgraded-array-element-type adjust-array))\n\n(defun upgraded-array-element-type (type)\n (cond ((or (eq type 't)\n\t (null type))\n\t 't)\n\t((member type '(character base-character standard-char\n\t\t\textended-character) :test #'eq)\n\t 'character)\n\t(t\n\t (setq type (car (si:canonicalize-type type)))\n\t (cond ((or (eq type 't)\n\t\t (null type))\n\t\t't)\n\t ((member type '(character base-character standard-char\n\t\t\t extended-character) :test #'eq)\n\t\t'character)\n\t (t 't)))))\n\n(defun check-array-initialize-option (ies-p ics-p displaced-to)\n (let ((x 0))\n (and ies-p (incf x))\n (and ics-p (incf x))\n (and displaced-to (incf x))\n (when (> x 1)\n (error \":initial-element, :initial-contents, :displaced-to\"))))\n\n(defun make-vector (length &key\n\t\t\t (element-type t)\n\t\t\t (initial-element nil ies-p)\n\t\t\t (initial-contents nil ics-p)\n\t\t\t fill-pointer\n\t\t\t adjustable\n\t\t\t displaced-to\n\t\t\t (displaced-index-offset 0))\n (setq element-type (upgraded-array-element-type element-type))\n (check-array-initialize-option ies-p ics-p displaced-to)\n (let ((vector (si:*make-vector length element-type initial-element adjustable\n\t\t\t\t fill-pointer displaced-to displaced-index-offset)))\n (when ics-p\n (si:*copy-into-seq vector initial-contents))\n vector))\n\n(defun make-array (dimensions &rest rest\n\t\t\t &key\n\t\t\t (element-type t)\n\t\t\t (initial-element nil ies-p)\n\t\t\t (initial-contents nil ics-p)\n\t\t\t fill-pointer\n\t\t\t adjustable\n\t\t\t displaced-to\n\t\t\t (displaced-index-offset 0))\n (cond ((integerp dimensions)\n\t (apply #'make-vector dimensions rest))\n\t((= (length dimensions) 1)\n\t (apply #'make-vector (car dimensions) rest))\n\t(t\n\t (setq element-type (upgraded-array-element-type element-type))\n\t (check-array-initialize-option ies-p ics-p displaced-to)\n\t (when fill-pointer\n\t (error \":fill-pointer\"))\n\t (let ((array (si:*make-array dimensions element-type\n\t\t\t\t initial-element adjustable\n\t\t\t\t displaced-to displaced-index-offset)))\n\t (when ics-p\n\t (let ((dims (make-list (array-rank array)\n\t\t\t\t :initial-element 0))\n\t\t (stack (list initial-contents))\n\t\t (rank (1- (array-rank array))))\n\t (dolist (x dims)\n\t\t (push (elt (car stack) 0) stack))\n\t (dotimes (i (array-total-size array))\n\t\t (setf (row-major-aref array i) (car stack))\n\t\t (do ((x dims (cdr x))\n\t\t (j rank (1- j)))\n\t\t ((null x))\n\t\t (pop stack)\n\t\t (incf (car x))\n\t\t (when (< (car x) (array-dimension array j))\n\t\t (do ((r (- rank j) (1- r)))\n\t\t\t ((< r 0))\n\t\t (push (elt (car stack) (nth r dims)) stack))\n\t\t (return))\n\t\t (setf (car x) 0)))))\n\t array))))\n\n(defun vector (&rest list)\n (make-vector (length list) :element-type t :initial-contents list))\n\n(defun array-dimensions (array)\n (do ((i (1- (array-rank array)) (1- i))\n (dims '()))\n ((minusp i) dims)\n (push (array-dimension array i) dims)))\n\n(defun array-in-bounds-p (array &rest subscripts)\n (let ((r (array-rank array)))\n (when (/= r (length subscripts))\n (error \"subscripts: ~S\" subscripts))\n (do ((i 0 (1+ i))\n\t (s subscripts (cdr s)))\n\t((= i r) t)\n (unless (<= 0 (car s) (1- (array-dimension array i)))\n\t(return nil)))))\n\n(defun adjust-array (old-array\n\t\t dimensions\n\t\t &rest rest\n\t\t &key\n\t\t (element-type nil ets-p)\n\t\t initial-element\n\t\t (initial-contents nil ics-p)\n\t\t (fill-pointer nil fps-p)\n\t\t displaced-to\n\t\t displaced-index-offset)\n (when (/= (length dimensions) (array-rank old-array))\n (error \"?\"))\n (unless ets-p\n (push (array-element-type old-array) rest)\n (push :element-type rest))\n (when (adjustable-array-p old-array)\n (push t rest)\n (push :adjustable rest))\n (cond (fps-p\n\t (unless (array-has-fill-pointer-p old-array)\n\t (error \"?\")))\n\t(t\n\t (when (array-has-fill-pointer-p old-array)\n\t (push (fill-pointer old-array) rest)\n\t (push :fill-pointer rest))))\n (when (eq old-array displaced-to)\n (error \"?\"))\n (let ((new-array (apply #'make-array dimensions rest)))\n (or ics-p displaced-to\n\t(copy-array-partially old-array new-array))\n (cond ((adjustable-array-p old-array)\n\t (si:*replace-array old-array new-array)\n\t old-array)\n\t (t\n\t new-array))))\n\n(defun copy-array-partially (src dst)\n (let* ((dims (mapcar #'min (array-dimensions src) (array-dimensions dst)))\n\t (r (array-rank src))\n\t (s (make-list r :initial-element 0)))\n (setq r (1- r))\n (dotimes (x (apply #'* dims))\n (setf (apply #'aref dst s) (apply #'aref src s))\n (do ((i r (1- i)))\n\t ((minusp i))\n\t(incf (nth i s))\n\t(when (< (nth i s) (nth i dims))\n\t (return))\n\t(setf (nth i s) 0)))))\n" }, { "path": "src/test/resources/samples/langs/Common Lisp/common.l", "content": ";;; common.l\n;;; commonLisp features for eus\n;;;\t\n;;;\tCopyright(c)1988, Toshihiro MATSUI, Electrotechnical Laboratory\n;;;\t1986-Aug\n;;;\t1987-Feb\n;;;\t1988-Jun\tdefclass, setf\n\n(in-package \"LISP\")\n\n(list \"@(#)$Id: common.l,v 1.1.1.1 2003/11/20 07:46:30 eus Exp $\")\n\n(export '(lisp-implementation-type lisp-implementation-version))\n\n(export '(macroexpand prog1 loop unless until\n\t pop push pushnew inc dec incf decf))\n\n(export '(defvar defparameter defconstant deflocal\n\tdotimes dolist\n\tdo-symbols do-external-symbols do-all-symbols\n\tpsetq do do* prog prog*\n\tcase classcase otherwise\n\tstring alias\n\tcaaar caadr cadar cdaar cdadr cddar cdddr\n\tfourth fifth sixth seventh eighth \n\tcadddr cddddr cadddr caaddr cdaddr caddddr\n\tflatten list-insert list-delete adjoin union intersection\n\tset-difference set-exclusive-or rotate-list last copy-tree\n\tcopy-list nreconc rassoc acons member assoc subsetp maplist mapcon))\n\n(export '(find find-if find-if-not position position-if position-if-not\n\tcount count-if count-if-not member-if member-if-not \n\tpairlis make-list make-sequence fill replace\n\ttranspose-list\n\tremove remove-if remove-if-not delete delete-if delete-if-not\n\tsubstitute substitute-if substitute-if-not \n\tnsubstitute nsubstitute-if nsubstitute-if-not\n\tunique remove-duplicates extream\n\tsend-super-lexpr send-lexpr send-super send-all resend\n\tsend-super* send*\n\tinstance instance* \n\tmake-instance defclassmethod delete-method\n\tmake-class defstruct defclass readtablep copy-readtable\n\tset-syntax-from-char\n\tcollect-if collect-instances\n))\n\n(export '(keywordp constantp functionp vector-class-p\n\tcompiled-function-p input-stream-p output-stream-p io-stream-p\n\tspecial-form-p macro-function))\n\n(export '(zerop plusp minusp oddp evenp /= logandc1 logandc2\n\tecase every some reduce merge-list merge expt signum\n\tdefsetf define-setf-method \n\tsetf multiple-value-bind multiple-value-setq pop push))\n(export '(get-internal-run-time list-length values\n\t first second third bye))\n\n(export '(rad2deg deg2rad ))\n\n;; version\n(defun lisp-implementation-type () \"EusLisp\")\n(defun lisp-implementation-version ()\n\t(format nil\n\t \"EusLisp ~A~A for ~A created on ~A(~A)\"\n\t\t(car lisp-implementation-version)\n\t\t(cdddr lisp-implementation-version)\n\t\t*OS-VERSION*\n\t\t(cadr lisp-implementation-version)\n (caddr lisp-implementation-version)\n ))\n(setq euserror nil)\n;;;\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; basic macros\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(eval-when (load eval)\n\n(defun macroexpand (form)\n (let ((r (macroexpand2 form)))\n (while (and (listp r) (macro-function (car r)))\n\t(setq r (macroexpand2 r)))\n r))\n\n;(defmacro defun (fname &rest fdef)\n; `(progn\n;\t(setq (',fname . function) (cons 'lambda ',fdef))\n; (remprop ',fname 'builtin-function-entry)\n;\t',fname))\n\n(defmacro prog1 (&rest args)\n (let ((first (gensym \"PROG1\")))\n `(let ((,first ,(car args)))\n\t (progn . ,(cdr args)) ,first)))\n\n(defmacro loop (&rest forms) \n (let ((tag (gensym \"LOOP\")))\n `(block nil (tagbody ,tag ,@forms (go ,tag)))))\n(defmacro unless (pred &rest form)\n `(when (not ,pred) . ,form))\n(defmacro until (condition &rest forms)\n `(while (not ,condition) ,@forms))\n(defmacro pop (s) `(prog1 (car ,s) (setf ,s (cdr ,s))))\n(defmacro push (item place) `(setf ,place (cons ,item ,place)))\n(defmacro pushnew (item place &key test test-not key)\n `(progn (if (not (member ,item ,place :test ,test :test-not ,test-not\n\t\t\t\t\t :key ,key))\n\t\t(setf ,place (cons ,item ,place)))\n\t nil))\n(defmacro inc (var &optional h)\n (if h (setq h (list '+ var h)) (setq h (list '1+ var)))\n (list 'setq var h))\n(defmacro dec (var &optional h)\n (if h (setq h (list '- var h)) (setq h (list '1- var)))\n (list 'setq var h))\n(defmacro incf (var &optional h)\n (if h (setq h (list '+ var h)) (setq h (list '1+ var)))\n (list 'setf var h))\n(defmacro decf (var &optional h)\n (if h (setq h (list '- var h)) (setq h (list '1- var)))\n (list 'setf var h))\n\n(defmacro defvar (var &optional (init nil) (doc nil))\n (unless (symbolp var) (error 20))\n `(when (eql (send ',var :vtype) 1) \n\t(send ',var :vtype 2)\n (if (not (boundp ',var))\n\t (send ',var :global ,init ,doc ))\n\t',var))\n\n(defmacro deflocal (var &optional (init nil) (doc nil))\n (unless (symbolp var) (error 20))\n `(progn\n\t(send ',var :special ,init ,doc)\n\t',var))\n\n(defmacro defparameter (var init &optional (doc nil))\n (unless (symbolp var) (error 20))\n `(send ',var :global ,init ,doc))\n\n(defmacro defconstant (sym val &optional doc)\n (unless (symbolp sym) (error 20))\n `(send ',sym :constant ,val ,doc) )\n \n\n(defmacro dotimes (vars &rest forms)\n (let ((endvar (gensym \"DOTIMES\")))\n `(let ((,(car vars) 0) (,endvar ,(cadr vars)))\n\t(declare (integer ,(car vars) ,endvar))\n\t(while (< ,(car vars) ,endvar)\n\t ,@forms\n\t (setq ,(car vars) (1+ ,(car vars))))\n\t,(caddr vars)))) \n\n(defmacro dolist (vars &rest forms)\n (let ((lists (gensym \"DOLIST\")) (decl (car forms)))\n (if (and (consp decl) (eq (car decl) 'declare))\n\t (setq forms (cdr forms))\n\t (setq decl nil))\n `(let ((,(car vars) nil) (,lists ,(cadr vars)))\n\t,decl\n\t(while ,lists\n\t (setq ,(car vars) (pop ,lists))\n\t ,@forms)\n\t,(caddr vars)))) \n\n(defmacro do-symbols (vars &rest forms)\n (let* ((symbols (gensym \"DOSYM\"))\n\t (v (car vars))\n\t (pkg (if (cadr vars) (cadr vars) '*package*))\n\t (pkgv (gensym))\n\t (i (gensym))\n\t (size (gensym))\n\t (svec (gensym))\n\t )\n `(let* ((,v nil)\n\t (,pkgv (find-package ,pkg))\n\t (,i 0)\n\t (,svec (,pkgv . intsymvector))\n\t (,size (length ,svec)))\n\t(while (< ,i ,size)\n\t (setq ,v (elt ,svec ,i))\n\t (inc ,i)\n\t (when (symbolp ,v) . ,forms))\n\t,(caddr vars))))\n\n(defmacro do-external-symbols (vars &rest forms)\n (let* ((symbols (gensym \"DOEXTSYM\"))\n\t (v (car vars))\n\t (pkg (if (cadr vars) (cadr vars) '*package*))\n\t (pkgv (gensym))\n\t (i (gensym))\n\t (size (gensym))\n\t (svec (gensym))\n\t )\n `(let* ((,v nil)\n\t (,pkgv (find-package ,pkg))\n\t (,i 0)\n\t (,svec (,pkgv . symvector))\n\t (,size (length ,svec)))\n\t(while (< ,i ,size)\n\t (setq ,v (elt ,svec ,i))\n\t (inc ,i)\n\t (when (symbolp ,v) . ,forms))\n\t,(caddr vars))))\n\n(defmacro do-all-symbols (var &rest forms)\n (let ((apackage (gensym \"DOALLSYM\")))\n `(dolist (,apackage (list-all-packages) ,(cadr var))\n\t (do-symbols (,(car var) ,apackage) . ,forms) )\n ))\n\n(defmacro psetq (&rest varvals)\n (let* (vars vals gvars)\n (while varvals\n\t(push (pop varvals) vars)\n\t(push (pop varvals) vals)\n\t(push (gensym \"PSETQ\") gvars))\n (setq vars (nreverse vars) vals (nreverse vals) gvars (nreverse gvars))\n `(let* ,(mapcar #'list gvars vals)\n\t(setq . ,(mapcan #'list vars gvars))\n\tnil)))\n\n(defmacro do (vars endtest &rest body)\n (let ((decl (car body)) (tag (gensym \"DO\")))\n (if (and (consp decl) (eq (car decl) 'declare))\n\t(setq body (cdr body))\n\t(setq decl nil))\n `(block nil\n (let\n ,(mapcar\n\t #'(lambda (v) (list (car v) (cadr v)))\n\t vars)\n ,decl\n (tagbody\n\t ,tag\n\t (if ,(car endtest) (return (progn . ,(cdr endtest))))\n\t ,@body\n\t (psetq . ,(mapcan #'(lambda (v) (if (cddr v) (list (car v) (caddr v))))\n\t\t vars))\n\t (go ,tag))) )))\n\n(defmacro do* (vars endtest &rest body)\n (let ((decl (car body)) (tag (gensym \"DO*\")))\n (if (and (consp decl) (eq (car decl) 'declare))\n\t(setq body (cdr body))\n\t(setq decl nil))\n `(block nil\n (let*\n ,(mapcar\n\t #'(lambda (v) (list (car v) (cadr v)))\n\t vars)\n ,decl\n (tagbody\n\t ,tag\n\t (if ,(car endtest) (return (progn . ,(cdr endtest))))\n\t ,@body\n\t (setq . ,(mapcan #'(lambda (v) (if (cddr v) (list (car v) (caddr v))))\n\t\t vars))\n\t(go ,tag))) )))\n\n\n(defmacro prog (vars &rest body)\n `(block nil\n (let ,vars \n\t (tagbody ,@body))))\n(defmacro prog* (vars &rest body)\n `(block nil\n (let* ,vars \n\t (tagbody ,@body))))\n\n)\n;;\n;;\tcase\n;;\n(eval-when (load eval)\n(defun casebody (body) (if (cdr body) (cons 'progn body) (car body)))\n\n(defun casehead (keyvar head)\n (if (atom head)\n\t(if (memq head '(t otherwise))\n\t t\n\t (list 'eq keyvar (list 'quote head)))\n (list 'memq keyvar (list 'quote head)) ))\n\n(defun case1 (keyvar clauses)\n (if (atom clauses)\n nil\n (list 'if\n\t (casehead keyvar (caar clauses))\n (casebody (cdar clauses))\n\t (case1 keyvar (cdr clauses)) nil)))\n\n(defmacro case (key &rest clauses)\n (let ((keyvar (gensym \"CASE\")) (result nil))\n (list 'let (list (list keyvar key)) (case1 keyvar clauses))\n ))\n\n(defun classcasehead (keyvar head)\n (if (memq head '(t otherwise))\n t\n (if (atom head)\n `(derivedp ,keyvar ,head)\n `(or . ,(mapcar #'(lambda (x) `(derivedp ,keyvar ,x)) head)))))\n\n(defun classcase1 (keyvar clauses)\n (if (atom clauses)\n nil\n (list 'if\n\t (classcasehead keyvar (caar clauses))\n (casebody (cdar clauses))\n\t (classcase1 keyvar (cdr clauses)) nil)))\n\n(defmacro classcase (key &rest clauses)\n (let ((kv (gensym \"CCASE\")))\n `(let ((,kv ,key)) ,(classcase1 kv clauses))))\n)\n\n;; string\n\n(defun string (x)\n (if (stringp x) x\n (if (symbolp x) (copy-seq (x . pname))\n\t (if (numberp x) (format nil \"~d\" x)\n\t (error x)))))\n\n;\n; more list functions\n;\n(eval-when (load eval)\n (defun alias (new old) (setslot new symbol 'function\n\t\t\t\t (symbol-function old)))\n (alias 'list-length 'length)\n (alias 'values 'list)\n )\n\n(eval-when (load eval)\n(defun caaar (x) (car (caar x)))\n(defun caadr (x) (car (cadr x)))\n(defun cadar (x) (car (cdar x)))\n(defun cdaar (x) (cdr (caar x)))\n(defun cdadr (x) (cdr (cadr x)))\n(defun cddar (x) (cdr (cdar x)))\n(defun cdddr (x) (cdr (cddr x)))\n(alias 'first 'car)\n(alias 'second 'cadr)\n(alias 'third 'caddr)\n(defun fourth (x) (cadr (cddr x)))\n(defun fifth (x) (caddr (cddr x)))\n(defun sixth (x) (caddr (cdddr x)))\n(defun seventh (x) (caddr (cddddr x)))\n(defun eighth (x) (cadddr (cddddr x)))\n#|\n(defun cadddr (x) (car (cdddr x)))\n|#\n(defun cddddr (x) (cddr (cddr x)))\n(defun cadddr (x) (cadr (cddr x)))\n(defun caaddr (x) (caar (cddr x)))\n(defun cdaddr (x) (cdar (cddr x)))\n(defun caddddr (x) (cadr (cdddr x)))\n(defun flatten (l &optional accumulator)\n (cond\n ((null l) accumulator)\n ((atom l) (cons l accumulator))\n (t (flatten (car l)\n\t (flatten (cdr l) accumulator)))) )\n\n(defun list-insert (item pos list)\n \"insert item as the pos'th element in list.\nif pos is bigger than the length of list, item is nconc'ed at the tail\"\n (cond ((null list) (list item))\n\t ((>= pos (length list)) (nconc list (list item)))\n\t ((= pos 0) (cons item list))\n\t (t (let ((tail (cons item (nthcdr pos list))))\n\t\t(rplacd (nthcdr (1- pos) list) tail)\n\t\tlist))))\n\n(defun list-delete (lst n)\t\"(lst n) delete nth element of lst\"\n (if (= n 0) \n\t(setq lst (cdr lst))\n\t(rplacd (nthcdr (1- n) lst) (nthcdr (1+ n) lst)) )\n lst)\n\n(defun adjoin (item list &key (test #'eq) (test-not) (key #'identity))\n (if (member item list :test test :test-not test-not :key key)\n list\n (cons item list)))\n\n(defun union (list1 list2 &key (test #'eq) (test-not) (key #'identity))\n (let (result)\n (dolist (item list1)\n (unless (member (funcall key item) result\n\t\t :test test :test-not test-not :key key)\n\t (setq result (cons item result))))\n (dolist (item list2)\n (unless (member (funcall key item) result \n\t\t :test test :test-not test-not :key key)\n\t (setq result (cons item result))))\n (reverse result)))\n\n(defun intersection (list1 list2 &key (test #'eq) (test-not) (key #'identity))\n (let (r)\n (dolist (item list1)\n\t(if (member (funcall key item) list2\n\t\t :test test :test-not test-not :key key)\n\t (setq r (cons item r))))\n r))\n\n(defun set-difference (list1 list2 &key (test #'eq) (test-not)\n\t\t\t\t\t(key #'identity))\n (let (result)\n (dolist (l1 list1)\n\t(unless (member (funcall key l1) list2\n\t\t\t:test test :test-not test-not :key key)\n\t (push l1 result)))\n (nreverse result)))\n\n(defun set-exclusive-or (list1 list2 &key (test #'eq) (test-not)\n\t\t\t\t\t (key #'identity))\n (let (result1 result2)\n (dolist (l1 list1)\n\t(setq l1 (funcall key l1))\n\t(unless (member l1 list2 :test test :test-not test-not :key key)\n\t (push l1 result1)))\n (dolist (l2 list2)\n\t(setq l2 (funcall key l2))\n\t(unless (member l2 list1 :test test :test-not test-not :key key)\n\t (push l2 result2)))\n (nconc result1 result2)))\n\n(defun rotate-list (l) (append (cdr l) (list (car l))))\n(defun last (x)\n (while (consp (cdr x)) (setq x (cdr x)))\n x)\n(defun copy-tree (x) (subst t t x))\n(defun copy-list (x) (nreverse (reverse x)))\n(defun nreconc (x y) (nconc (nreverse x) y))\n(defun rassoc (item alist)\n (dolist (a alist)\n (if (equal item (cdr a)) (return-from rassoc a))))\n(defun acons (key datum alist) (cons (cons key datum) alist))\n(defun member (item list &key key test test-not)\n (supermember item list key test test-not))\n(defun assoc (item alist &key key test test-not)\n (superassoc item alist key test test-not))\n(defun subsetp (sub super &key key test test-not)\n (every #'(lambda (s) (member s super :key key :test test :test-not test-not))\n\t sub))\n(defun maplist (func arg &rest more-args &aux result)\n (if more-args\n (let (arglist margs)\n\t (while arg\n\t (setq arglist nil)\n\t (push arg arglist)\n\t (setq arg (cdr arg))\n\t (setq margs more-args)\n\t (while margs\n\t\t(push (car margs) arglist)\n\t\t(setf (car margs) (cdar margs))\n\t\t(setq margs (cdr margs)) )\n\t (push (apply func (nreverse arglist)) result) ))\n (while arg\n\t (push (funcall func arg) result)\n\t (setq arg (cdr arg)))) \n (nreverse result))\n\n(defun mapcon (func arg &rest more-args &aux result)\n (if more-args\n (let (arglist margs)\n\t (while arg\n\t (setq arglist nil)\n\t (push arg arglist)\n\t (setq arg (cdr arg))\n\t (setq margs more-args)\n\t (while margs\n\t\t(push (car margs) arglist)\n\t\t(setf (car margs) (cdar margs))\n\t\t(setq margs (cdr margs)) )\n\t (setq result (nconc (apply func (nreverse arglist)) result) )) )\n (while arg\n\t (setq result (nconc (funcall func arg) result))\n\t (setq arg (cdr arg)))) \n (nreverse result))\n\n(defun find (item seq &key (start 0) (end (length seq))\n\t\t (test #'eq) (test-not nil) (key #'identity))\n (system::raw-find item seq test test-not key nil nil start end))\n(defun find-if (pred seq &key (start 0) (end (length seq)) (key #'identity))\n (system::raw-find nil seq nil nil key pred nil start end))\n(defun find-if-not (pred seq &key (start 0) (end (length seq)) (key #'identity))\n (system::raw-find nil seq nil nil key nil pred start end))\n\n(defun position (item seq &key (start 0) (end (length seq)) (count 1)\n\t\t (test #'eq) (test-not nil) (key #'identity))\n (system::raw-position item seq test test-not key nil nil start end count))\n(defun position-if (pred seq &key (start 0) (end (length seq)) (count 1) (key #'identity))\n (system::raw-position nil seq nil nil key pred nil start end count))\n(defun position-if-not (pred seq &key (start 0) (end (length seq)) (count 1) (key #'identity))\n (system::raw-position nil seq nil nil key nil pred start end count))\n\n(defun count (item seq &key (start 0) (end (length seq))\n\t\t (test #'eq) (test-not nil) (key #'identity))\n (system::raw-count item seq test test-not key nil nil start end))\n(defun count-if (pred seq &key (start 0) (end (length seq)) (key #'identity))\n (system::raw-count nil seq nil nil key pred nil start end))\n(defun count-if-not (pred seq &key (start 0) (end (length seq)) (key #'identity))\n (system::raw-count nil seq nil nil key nil pred start end))\n(defun member-if (test list &key (key #'identity))\n (while list\n (if (funcall test (funcall key (car list))) \n\t (return-from member-if list)\n\t (setq list (cdr list)))))\n(defun member-if-not (test list &key (key #'identity))\n (while list\n (if (not (funcall test (funcall key (car list))) )\n\t (return-from member-if-not list)\n\t (setq list (cdr list)))))\n(defun collect-if (func seq &aux r)\n (dolist (s seq)\n (if (funcall func s) (push s r)) )\n (nreverse r) )\n(defun collect-instances (klass list)\n (collect-if #'(lambda (i) (derivedp i klass)) (flatten list)))\n\n(defun pairlis (l1 l2 &optional alist)\n (if l1\n (cons (cons (car l1) (car l2)) (pairlis (cdr l1) (cdr l2) alist))\n alist))\n\n(defun transpose-list (dlist)\n (let (r)\n (dotimes (i (length (car dlist)))\n\t (push (mapcar #'(lambda (x) (nth i x)) dlist) r))\n (nreverse r)))\n\n(defun make-list (leng &key initial-element)\n (let (r)\n (unless (integerp leng) (error \"integer required for length of make-list\"))\n (dotimes (i leng r)\n\t(push initial-element r))))\n\n(defun make-sequence (type size &key initial-element)\n (if (or (memq type '(cons list)) (eq type cons))\n (make-list size :initial-element initial-element)\n (make-array size :element-type type :initial-element initial-element)))\n\n(defun fill (seq item &key (start 0) (end (length seq)))\n (system::raw-fill seq item start end))\n\n(defun replace (dest src &key (start1 0) (end1 (length dest))\n\t\t\t (start2 0) (end2 (length src)))\n (let ((result dest) (count (min (- end1 start1) (- end2 start2))))\n (cond ((listp dest)\n\t (setq dest (nthcdr start1 dest))\n\t (cond ((listp src)\n\t\t (setq src (nthcdr start2 src))\n\t\t (dotimes (c count)\n\t\t (setq (dest . car) (pop src))\n\t\t (pop dest)))\n\t\t(t\n\t\t (dotimes (c count)\n\t\t (setq (dest . car) (aref src start2))\n\t\t (inc start2) (pop dest)))))\n\t((listp src)\t; list --> vector\n\t (setq src (nthcdr start2 src))\n\t (dotimes (c count)\n\t (aset dest start1 (pop src))\n\t (inc start1)))\n\t(t (system::vector-replace dest src start1 end1 start2 end2)))\n result))\n\n(defun remove (item seq &key (start 0) (end (length seq))\n\t\t\t (test #'eq) (test-not nil)\n\t\t\t (count 1000000) (key #'identity))\n (system::universal-remove item seq test test-not key nil nil start end count))\n(defun remove-if (pred seq &key (start 0) (end (length seq))\n\t\t\t (count 1000000) (key #'identity))\n (system::universal-remove nil seq nil nil key pred nil start end count))\n(defun remove-if-not (pred seq &key (start 0) (end (length seq))\n\t\t\t (count 1000000) (key #'identity))\n (system::universal-remove nil seq nil nil key nil pred start end count))\n\n(defun delete (item seq &key (start 0) (end (length seq))\n\t\t\t (test #'eq) (test-not nil)\n\t\t\t (count 1000000) (key #'identity))\n (system::raw-delete item seq test test-not key nil nil start end count))\n(defun delete-if (pred seq &key (start 0) (end (length seq))\n\t\t\t (count 1000000) (key #'identity))\n (system::raw-delete nil seq nil nil key pred nil start end count))\n(defun delete-if-not (pred seq &key (start 0) (end (length seq))\n\t\t\t (count 1000000) (key #'identity))\n (system::raw-delete nil seq nil nil key nil pred start end count))\n\n(defun substitute (newitem olditem seq &key (start 0) (end (length seq))\n\t\t\t (test #'eq) (test-not nil)\n\t\t\t (count 1000000) (key #'identity))\n (system::raw-substitute newitem olditem seq test test-not key nil nil start end count))\n(defun substitute-if (newitem pred seq &key (start 0) (end (length seq))\n\t\t\t (count 1000000) (key #'identity))\n (system::raw-substitute newitem nil seq nil nil key pred nil start end count))\n(defun substitute-if-not (newitem pred seq &key (start 0) (end (length seq))\n\t\t\t (count 1000000) (key #'identity))\n (system::raw-substitute newitem nil seq nil nil key nil pred start end count))\n\n(defun nsubstitute (newitem olditem seq &key (start 0) (end (length seq))\n\t\t\t (test #'eq) (test-not nil)\n\t\t\t (count 1000000) (key #'identity))\n (system::raw-nsubstitute newitem olditem seq test test-not key nil nil start end count))\n(defun nsubstitute-if (newitem pred seq &key (start 0) (end (length seq))\n\t\t\t (count 1000000) (key #'identity))\n (system::raw-nsubstitute newitem nil seq nil nil key pred nil start end count))\n(defun nsubstitute-if-not (newitem pred seq &key (start 0) (end (length seq))\n\t\t\t (count 1000000) (key #'identity))\n (system::raw-nsubstitute newitem nil seq nil nil key nil pred start end count))\n\n(defun unique (l)\n (cond\n ((atom (cdr l)) l)\n ((memq (car l) (cdr l)) (unique (cdr l)))\n (t (cons (car l) (unique (cdr l))))))\n\n(defun remove-duplicates (seq &key (test #'eq) (test-not) (key #'identity)\n\t\t\t\t (start 0) (end 1000000))\n (system::raw-remove-duplicates seq test test-not key start end))\n\n(defun extream (seq test &optional (key #'identity))\n (if (null seq)\n nil\n (let* ((ext (elt seq 0)) (p (funcall key ext)) x)\n\t (if (consp seq)\n\t (dolist (v (cdr seq))\n\t\t (when (funcall test (funcall key v) p)\n\t\t (setq ext v\n\t\t\t p (funcall key ext))) ) \n\t (dotimes (i (length seq))\n\t\t (when (funcall test\n\t\t\t\t (funcall key (setq x (aref seq i)))\n\t\t\t\t p)\n\t\t (setq ext x\n\t\t\t p (funcall key ext)))) )\n ext)) )\n) ;eval-when\n\n\f\n;;;\n;;; equivalent pairs from WINSTON\n;;;\n\n#|\n(eval-when (load eval)\n(defun coalesce (pairs) (coalesce-aux pairs nil))\n(defun coalesce-aux (pairs classes)\n (cond ((null pairs) classes)\n\t(t (coalesce-aux (cdr pairs)\n\t\t\t (absorb (car pairs) classes)))))\n(defun stick-in (new classes)\n (cond ((member new (car classes)) classes)\n\t(t (cons (cons new (car classes))\n\t\t (cdr classes)))))\n(defun absorb (pair classes)\n (cond ((null classes) (list pair))\n\t((member (car pair) (car classes))\n\t (stick-in (cadr pair) classes))\n\t((member (cadr pair) (car classes))\n\t (stick-in (car pair) classes))\n\t(t (cons (car classes)\n\t\t (absorb pair (cdr classes))))))\n) ;eval-when ; end of more list functions\n|#\n\n\f\n;;;\n;;; LEO functions\n;;;\n(eval-when (load eval)\n(defmacro send-super-lexpr (selector &rest msgs)\n (declare (type metaclass class))\n `(apply #'send-message self (class . super) ,selector . ,msgs)\n )\n(defmacro send-super* (&rest msgs)\n (declare (type metaclass class))\n `(apply #'send-message self (class . super) . ,msgs)\n )\n(defmacro send-lexpr (target selector &rest msgs)\n `(apply #'send ,target ,selector . ,msgs)\n )\n(defmacro send* (&rest msgs)\n `(apply #'send . ,msgs)\n )\n(defmacro send-super (selector &rest msgs)\n (declare (type metaclass class))\n `(send-message self (class . super) ,selector ,@msgs))\n\n(defun send-all (receivers &rest mesg)\n (mapcar #'(lambda (r) (apply 'send r mesg)) receivers))\n\n(defun resend (obj mesg)\n (eval (cons 'send (cons obj mesg))))\n\n(defmacro instance (cls &rest message)\n (if message\n\t(let ((v (gensym \"INST\")))\n\t`(let ((,v (instantiate ,cls))) (send ,v ,@message) ,v))\n\t`(instantiate ,cls)))\n\n(defmacro instance* (cls &rest message)\n (if message\n\t(let ((v (gensym \"INST\")))\n\t`(let ((,v (instantiate ,cls))) (send* ,v ,@message) ,v))\n\t`(instantiate ,cls)))\n\n(defun make-instance (klass &rest args)\n (let ((inst (instantiate klass)))\n (while args\n\t (setslot inst klass (string (pop args)) (pop args)))\n inst))\n\n(defmacro defclassmethod (classname &rest methods)\n `(defmethod ,(metaclass-name (class (symbol-value classname)))\n\t\t. ,methods))\n(defun delete-method (classobj methodname)\n (setf (metaclass-methods classobj)\n\t (delete methodname (metaclass-methods classobj) :key #'car))\n (system::method-cache t))\n\n;;;\n;;;\tdefclass macro (T.Matsui 1988-Jun)\n;;;\n\n(defun make-class (name &key\n\t\t\t\t(super object)\t\n\t\t\t\t(include object)\n\t\t\t\t(printer nil)\n\t\t\t\t(constructor nil)\n\t\t\t\t(predicate nil)\n\t\t\t\t(copier nil)\n\t\t\t\t((:metaclass metaklass) nil)\n\t\t\t\t(element-type nil)\n\t\t\t\t(size -1)\n\t\t\t\t((:slots varlist) nil) \n\t\t\t\t(documentation nil))\n (if (symbolp super) (setq super (symbol-value super)))\n (let ((classobj (if (boundp name) (symbol-value name)))\n (variables) (types) (forwards)\n (etype) (index 0) (accessor) (p))\n (cond ((null (classp classobj))\n\t\t(cond \n\t\t (metaklass)\n\t\t ((classp metaklass))\n\t\t (super (setq metaklass (class super)))\n\t\t (t (setq metaklass (symbol-value 'metaclass))))\n\t\t(setq classobj (instantiate metaklass)))\n\t (t (setq metaklass (class classobj))))\n (setq variables (nreverse (coerce (super . vars) cons))\n\t types (nreverse (coerce (super . types) cons))\n\t forwards (nreverse (coerce (super . forwards) cons)))\n (dolist (v varlist)\n\t(cond ((consp v)\n\t\t(if (member (car v) variables)\n\t\t (error \"duplicated object variable name\"))\n\t\t(push (car v) variables)\n\t\t(setq p (position :type v))\n\t\t(push (if p (elt v (1+ p)) t) types)\n\t\t(setq p (position :forward v))\n\t\t(push (if p (elt v (1+ p)) nil) forwards))\n\t ((symbolp v)\n\t\t(if (member v variables)\n\t\t (error \"duplicated object variable name\"))\n\t\t(push v variables)\n\t\t(push t types)\n\t\t(push nil forwards))\n\t (t (error \"variable name expected for :slots\"))))\n (setq variables (coerce (nreverse variables) vector)\n\t types (coerce (nreverse types) vector)\n\t forwards (coerce (nreverse forwards) vector))\n (setq etype (cdr (assq element-type \n\t\t\t'((:BIT . 1) (:CHAR . 2) (:BYTE . 3)\n\t\t\t (:INTEGER . 4) (:FLOAT . 5) (:FOREIGN . 6)))))\n (if (null etype)\n (setq etype (if (subclassp metaklass vectorclass)\n\t\t\t (vectorclass-element-type super)\n\t\t\t 0)))\n (setq (classobj . name) name\n\t (classobj . vars) variables\n\t (classobj . types) types\n\t (classobj . forwards) forwards\n\t (classobj . super) super)\n (if (subclassp metaklass vectorclass)\n\t (setq (classobj . element-type) etype\n\t\t(classobj . size) size))\n (if (null (classobj . cix)) (enter-class classobj))\n;;;???\n;;; (proclaim (list 'special name))\n;; (set name classobj)\n;; (send name :global classobj)\n (putprop name documentation :class-documentation)\n;; define slot access functions and setf methods for all variables\n (setq variables (coerce variables cons))\n (dolist (v variables)\n\t(setq accessor (intern (concatenate string\n\t\t\t\t\t (string name) \"-\" (string v))))\n\t(setf (symbol-function accessor)\n\t `(macro (obj) (list 'slot obj ',name ,index)))\n\t(incf index))\n classobj ))\n\n\n(defmacro defstruct (name &rest slots)\n `(progn\n\t (send ',name :global\n\t\t(make-class ',name :slots ',slots))\n\t ',name))\n\n\n(defmacro defclass (name &key slots\n\t\t\t (super 'object)\n\t\t\t (size -1)\n\t\t\t ((:metaclass metaklass) nil)\n\t\t\t element-type\n\t\t\t documentation\n\t\t\t (doc documentation))\n\t`(progn\n\t (send ',name :global\n\t (make-class ',name\n\t\t :super ,super\n\t\t :slots ',slots\n\t\t :metaclass ,metaklass\n\t\t :element-type ,element-type\n\t\t :size ,size\n\t\t :documentation ,doc) )\n\t ',name))\n\n\n;;; \n;;; READTABLES\n;;;\n(eval-when (load eval)\n(defun readtablep (x) (derivedp x readtable))\n(defun copy-readtable (&optional (from *readtable*) (to nil))\n (when (null from) (setq from *default-readtable*))\n (when (null to)\n (setq to (instantiate readtable))\n (setf (readtable-syntax to) (instantiate string 256)\n\t (readtable-macro to) (instantiate vector 256)\n\t (readtable-dispatch-macro to) (instantiate vector 256)))\n (if (or (null (readtablep from)) (null (readtablep to))) \n (error \"readtable expected\"))\n (replace (readtable-syntax to) (readtable-syntax from))\n (replace (readtable-macro to) (readtable-macro from))\n (replace (readtable-dispatch-macro to) (readtable-dispatch-macro from))\n (setf (readtable-case to) (readtable-case from))\n to)\n\n(defun set-syntax-from-char\n\t (to-char from-char &optional (to-readtable *readtable*)\n\t\t\t\t (from-readtable *default-readtable*))\n (let (syn)\n (setq syn (aref (readtable-syntax from-readtable) from-char))\n (aset (readtable-syntax to-readtable) to-char syn)\n (if (or (eq syn 7) (eq syn 8))\n\t (aset (readtable-macro to-readtable) to-char\n\t\t(aref (readtable-macro from-readtable) from-char)))\n syn))\n)\n\n\f\n;;\n;;\tpredicates\n;;\n(eval-when (load eval)\n(defun keywordp (sym)\n (declare (type symbol sym))\n (and (symbolp sym) (eq (sym . homepkg) *keyword-package*)))\n\n(defun constantp (obj)\n (declare (type symbol obj))\n (if (symbolp obj)\n\t(if (or (keywordp obj) (eq (obj . vtype) 0)) t nil)\n\t(if (listp obj)\n\t (if (eq (car obj) 'quote) t nil)\n\t (if (atom obj) t nil))))\n\n(defun functionp (obj)\n (cond ((numberp obj) nil)\n\t((listp obj) \n\t (if (or (memq (car obj) '(lambda lambda-closure))) t nil))\n\t((derivedp obj compiled-code)\n\t (eq (compiled-code-type obj) 0))\n\t((and (symbolp obj) (fboundp obj))\n\t (functionp (symbol-function obj)))\n\t(t nil)))\n\n(defun vector-class-p (p) (derivedp p vectorclass))\n(defun compiled-function-p (x) (derivedp x compiled-code))\n(defun input-stream-p (obj)\n (declare (stream obj))\n (or (and (derivedp obj stream) (eq (obj . direction) :input))\n (derivedp obj io-stream)))\n(defun output-stream-p (obj)\n (declare (stream obj))\n (or (and (derivedp obj stream) (eq (obj . direction) :output))\n (derivedp obj io-stream)))\n(defun io-stream-p (obj) (derivedp obj io-stream))\n\n(defun special-form-p (s)\n (and (symbolp s)\n (fboundp s)\n (setq s (symbol-function s))\n (compiled-function-p s)\n (eq (s . type) 2)))\n\n(defun macro-function (s)\n (and (symbolp s)\n (fboundp s)\n (setq s (symbol-function s))\n (if (and (compiled-function-p s)\n\t (eq (s . type) 1))\n\t s\n\t (if (and (listp s) (eq (car s) 'macro)) s nil)\n )))\n\n(defun zerop (n) (= n 0))\n(defun plusp (n) (> n 0))\n(defun minusp (n) (< n 0))\n(defun oddp (n) (logbitp 0 n))\n(defun evenp (n) (not (logbitp 0 n)))\n(defun /= (n1 n2) (not (= n1 n2)))\n(defun logandc1 (x y) (logand (lognot x) y))\n(defun logandc2 (x y) (logand x (lognot y)))\n(defmacro ecase (&rest x) (cons 'case x))\n\n(defun every (pred arg &rest more-args)\n (cond ((and (null more-args) (listp arg))\n\t (while arg (unless (funcall pred (pop arg)) (return-from every nil))))\n\t(t\n\t (setq arg (cons arg more-args))\n\t (dotimes (i (length (car arg)))\n\t (unless (apply pred (mapcar #'(lambda (x) (elt x i)) arg))\n\t\t (return-from every nil)))))\n t)\n\n(defun some (pred arg &rest more-args &aux result)\n (setq arg (cons arg more-args))\n (dotimes (i (length (car arg)))\n (if (setq result (apply pred (mapcar #'(lambda (x) (elt x i)) arg)))\n\t (return-from some result)))\n nil)\n)\n\n(eval-when (load eval)\n(defun reduce (func seq &key (start 0) (end (length seq))\n\t\t\t from-end initial-value)\n (let ((length (- end start)))\n (when from-end (setq seq (reverse seq)))\n (cond\n\t ((and (= length 1) (null initial-value)) (elt seq start))\n\t ((= length 0)\n\t (if initial-value initial-value (funcall func)))\n\t (t\n\t (unless initial-value\n\t\t(setq initial-value\n\t\t (funcall func (elt seq start) (elt seq (inc start))))\n\t\t(dec length 2) (inc start))\n\t (dotimes (i length)\n\t (setq initial-value\n\t\t (funcall func initial-value (elt seq (+ start i)))))\n\t initial-value))))\n\n(defun merge-list (list1 list2 pred key &aux result p1 e1 e2 pp1 pp2)\n (while (and list2 (not (funcall pred (funcall key (car list1))\n\t\t\t\t (funcall key (car list2)))))\n (push (pop list2) result))\n (setq result (nreverse result))\n (setq p1 list1)\n (while (and list2 (cdr p1))\n (setq e2 (funcall key (car list2)))\n (while (and p1 (funcall pred (funcall key (cadr p1)) e2)) (pop p1))\n (when p1\n\t (setf pp1 (cdr p1)\n\t pp2 (cdr list2)\n\t (cdr p1) list2\n\t (cdr list2) pp1\n\t p1 list2\n\t list2 pp2)) )\n (nconc result list1 list2))\n\n(defun merge (result-class seq1 seq2 pred &key (key #'identity))\n (if (and (eq result-class cons) (listp seq1) (listp seq2))\n (merge-list seq1 seq2 pred key)\n (let* ((l1 (length seq1)) (l2 (length seq2)) (l (+ l1 l2))\n\t (result (make-sequence result-class l))\n\t (i1 0) (i2 0) (j 0) (e1) (e2) (e))\n (while (< j l)\n\t (cond ((>= i1 l1) (setq e (elt seq2 i2)) (inc i2))\n\t ((>= i2 l2) (setq e (elt seq1 i1)) (inc i1))\n\t (t (setq e1 (elt seq1 i1)\n\t\t e2 (elt seq2 i2))\n\t\t (if (funcall pred (funcall key e1) (funcall key e2))\n\t\t (progn (inc i1) (setq e e1))\n\t\t (progn (inc i2) (setq e e2)))))\n\t (setf (elt result j) e)\n\t (inc j))\n result)))\n)\n\t\t \n\n;;\n;; arithmetics aux\n;;\n\n(defun expt (a x)\n (cond ((and (integerp x) (>= x 0))\n\t (if (zerop x)\n\t 1\n\t (let ((b a) (y 1) (ix (1- x)))\n\t\t(declare (integer y ix))\n\t\t(while (> ix 0)\n\t\t (cond ((> ix y)\n\t\t\t (setq b (* b b)\n\t\t\t \t ix (- ix y)\n\t\t\t \t y (ash y 1)))\n\t\t\t (t (setq b (* b a) ix (1- ix)))))\n\t b)))\n\t (t (exp (* x (log a))))))\n(defun signum (x) (if (zerop x) x (/ x (abs x))))\n(defun rad2deg (rad) (/ (* 360.0 rad) 2pi))\n(defun deg2rad (deg) (/ (* 2pi deg) 360.0))\n)\n\f\n;;;; (C) Copyright Taiichi Yuasa and Masami Hagiya, 1984. All rights reserved.\n;;;;\n;;;; setf routines\n;;;;\tModified by T.Matsui to be run on euslisp\n;;;;\t1988-Jun-27\n\n;;; DEFSETF macro.\n(defmacro defsetf (access-fn &rest rest)\n (cond ((and (car rest) (or (symbolp (car rest)) (functionp (car rest))))\n `(progn (putprop ',access-fn ',(car rest) 'setf-update-fn)\n (remprop ',access-fn 'setf-lambda)\n (remprop ',access-fn 'setf-method)\n (putprop ',access-fn\n ,(when (not (endp (cdr rest)))\n (unless (stringp (cadr rest))\n (error \"A doc-string expected.\"))\n (unless (endp (cddr rest))\n (error \"Extra arguments.\"))\n (cadr rest))\n 'setf-documentation)\n ',access-fn))\n\t(t\n\t (unless (= (list-length (cadr rest)) 1)\n\t\t (error \"(store-variable) expected.\"))\n `(progn (putprop ',access-fn ',rest 'setf-lambda)\n (remprop ',access-fn 'setf-update-fn)\n (remprop ',access-fn 'setf-method)\n; (putprop ',access-fn\n; ,(find-documentation (cddr rest))\n; 'setf-documentation)\n ',access-fn))))\n\n\n;;; DEFINE-SETF-METHOD macro.\n(defmacro define-setf-method (access-fn &rest rest)\n `(progn (putprop ',access-fn #'(lambda ,@rest) 'setf-method)\n (remprop ',access-fn 'setf-lambda)\n (remprop ',access-fn 'setf-update-fn)\n; (putprop ',access-fn\n; ,(find-documentation (cdr rest))\n; 'setf-documentation)\n ',access-fn))\n\n;;; The expansion function for SETF.\n(defun setf-expand-1 (place newvalue)\n (let (g)\n (setq place (macroexpand place))\n (cond ((and (consp place) (eq (car place) 'the))\n (setf-expand-1 (caddr place) `(the ,(cadr place) ,newvalue)))\n ((symbolp place) `(setq ,place ,newvalue))\n ((and (symbolp (car place)) (setq g (get (car place) 'setf-update-fn)))\n `(,g ,@(cdr place) ,newvalue))\n ((and (symbolp (car place))\n (setq g (get (car place) 'structure-access))\n (get (car place) 'setf-lambda)\n (not (eq (car g) 'list))\n (not (eq (car g) 'vector)))\n `(system::structure-set ,(cadr place) ',(car g) ,(cdr g) ,newvalue))\n\t((macro-function (car place))\n\t (setf-expand-1 (macroexpand place) newvalue))\n\t((setq g (get (car place) 'setf-lambda))\n\t (apply (append '(lambda) (list (append (cadr g) (car g))) (cddr g))\n\t\t newvalue (cdr place)))\n;\t((get (car place) 'setf-method)\n;\t (apply (get (car form) 'setf-method) (cdr place)))\n\t(t (error \"SETF?\")))))\n\n(defun setf-expand (l)\n (cond ((endp l) nil)\n ((endp (cdr l)) (error \"~S is an illegal SETF form.\" l))\n (t\n (cons (setf-expand-1 (car l) (cadr l))\n (setf-expand (cddr l))))))\n\n\n;;; SETF macro.\n(defmacro setf (&rest rest)\n (cond ((endp rest) nil)\n ((endp (cdr rest)) (error \"~S is an illegal SETF form.\" rest))\n ((endp (cddr rest)) (setf-expand-1 (car rest) (cadr rest)))\n (t (cons 'progn (setf-expand rest)))))\n\n;(defmacro incf (form &optional (d 1))\n; `(setf ,form (+ ,form ,d)))\n;(defmacro decf (form &optional (d 1))\n; `(setf ,form (- ,form ,d)))\n\n;;;\n;;; MULTI-VALUE simulation macros\n;;;\n(defmacro multiple-value-bind (vlist init &rest forms)\n (let* ((inits (gensym \"MULT\")) (vilist) (count 0))\n (dolist (v vlist)\n\t (push (list v `(elt ,inits ,count)) vilist)\n (inc count))\n `(let* ((,inits ,init) . ,vilist) . ,forms)))\n\n(defmacro multiple-value-setq (vlist form)\n (let ((i 0) (tempvar (gensym \"MULT\")) setq-forms)\n (dolist (v vlist)\n\t(push (list\n\t\t(second\n\t\t (assoc i\n\t\t\t'((0 first) (1 second) (2 third)\n\t\t\t(3 fourth)(4 fifth) (5 sixth) (6 seventh))))\n\t\ttempvar)\n\t setq-forms)\n\t(push v setq-forms)\n\t(incf i))\n `(let ((,tempvar ,form))\n\t(setq . ,setq-forms))))\n\n(alias 'values 'list)\n\n#|\n(defun quick-sort (sequence start end predicate key &aux (j 0) (k 0) exch)\n (declare (fixnum start end j k))\n (when (<= end (the fixnum (1+ start)))\n (return-from quick-sort sequence))\n (setq j start)\n (setq k (1- end))\n (do ((d (aref sequence start)))\n ((> j k))\n (do ()\n\t((or (> j k)\n\t (funcall predicate\n\t\t (funcall key (aref sequence k))\n\t\t (funcall key d))))\n (decf k))\n (when (< k start)\n\t (quick-sort sequence (1+ start) end predicate key)\n\t (return-from quick-sort sequence))\n (do ()\n\t((or (> j k)\n\t (not (funcall predicate\n\t\t\t (funcall key (aref sequence j))\n\t\t\t (funcall key d)))))\n (incf j))\n (when (> j k) (return))\n (setf exch (aref sequence k)\n\t (aref sequence k) (aref sequence j)\n\t (aref sequence j) exch)\n (incf j)\n (decf k))\n (quick-sort sequence start j predicate key)\n (quick-sort sequence j end predicate key)\n sequence)\n\n(defun qsort (seq test &optional (key #'identity) &aux (vec nil) (s nil))\n (cond ((null seq) nil)\n\t((listp seq)\n\t (setq vec (coerce seq vector))\n\t (quick-sort vec 0 (length seq) test key)\n\t (setq s seq)\n\t (dotimes (i (length vec))\n\t (rplaca s (aref vec i))\n\t (setq s (cdr s)))\n\t seq)\n\t((vectorp seq)\n\t (quick-sort seq 0 (length seq) test key)\n\t seq) ))\n|#\n\n#|\n(eval-when (load eval)\n (defmacro pop (s) `(prog1 (car ,s) (setf ,s (cdr ,s))))\n (defmacro push (item place) `(setf ,place (cons ,item ,place)))\n )\n|#\n\n\n" }, { "path": "src/test/resources/samples/langs/Common Lisp/config.sexp", "content": "((exe_name hello)\n (link_order (world hello)))\n" }, { "path": "src/test/resources/samples/langs/Common Lisp/hello.lisp", "content": "(DEFUN HELLO ()\n (PRINT 'HELLO))\n" }, { "path": "src/test/resources/samples/langs/Common Lisp/macros-advanced.cl", "content": ";; @file macros-advanced.cl\n;;\n;; @breif Advanced macro practices - defining your own macros\n;;\n;; Macro definition skeleton:\n;; (defmacro name (parameter*)\n;; \"Optional documentation string\"\n;; body-form*)\n;;\n;; Note that backquote expression is most often used in the `body-form`\n;;\n\n; `primep` test a number for prime\n(defun primep (n)\n \"test a number for prime\"\n (if (< n 2) (return-from primep))\n (do ((i 2 (1+ i)) (p t (not (zerop (mod n i)))))\n ((> i (sqrt n)) p)\n (when (not p) (return))))\n; `next-prime` return the next prime bigger than the specified number\n(defun next-prime (n)\n \"return the next prime bigger than the speicified number\"\n (do ((i (1+ n) (1+ i)))\n ((primep i) i)))\n;\n; The recommended procedures to writting a new macro are as follows:\n; 1. Write a sample call to the macro and the code it should expand into\n(do-primes (p 0 19)\n (format t \"~d \" p))\n; Expected expanded codes\n(do ((p (next-prime (- 0 1)) (next-prime p)))\n ((> p 19))\n (format t \"~d \" p))\n; 2. Write code that generate the hardwritten expansion from the arguments in\n; the sample call\n(defmacro do-primes (var-and-range &rest body)\n (let ((var (first var-and-range))\n (start (second var-and-range))\n (end (third var-and-range)))\n `(do ((,var (next-prime (- ,start 1)) (next-prime ,var)))\n ((> ,var ,end))\n ,@body)))\n; 2-1. More concise implementations with the 'parameter list destructuring' and\n; '&body' synonym, it also emits more friendly messages on incorrent input.\n(defmacro do-primes ((var start end) &body body)\n `(do ((,var (next-prime (- ,start 1)) (next-prime ,var)))\n ((> ,var ,end))\n ,@body))\n; 2-2. Test the result of macro expansion with the `macroexpand-1` function\n(macroexpand-1 '(do-primes (p 0 19) (format t \"~d \" p)))\n; 3. Make sure the macro abstraction does not \"leak\"\n(defmacro do-primes ((var start end) &body body)\n (let ((end-value-name (gensym)))\n `(do ((,var (next-prime (- ,start 1)) (next-prime ,var))\n (,end-value-name ,end))\n ((> ,var ,end-value-name))\n ,@body)))\n; 3-1. Rules to observe to avoid common and possible leaks\n; a. include any subforms in the expansion in positions that will be evaluated\n; in the same order as the subforms appear in the macro call\n; b. make sure subforms are evaluated only once by creating a variable in the\n; expansion to hold the value of evaluating the argument form, and then\n; using that variable anywhere else the value is needed in the expansion\n; c. use `gensym` at macro expansion time to create variable names used in the\n; expansion\n;\n; Appendix I. Macro-writting macros, 'with-gensyms', to guranttee that rule c\n; gets observed.\n; Example usage of `with-gensyms`\n(defmacro do-primes-a ((var start end) &body body)\n \"do-primes implementation with macro-writting macro 'with-gensyms'\"\n (with-gensyms (end-value-name)\n `(do ((,var (next-prime (- ,start 1)) (next-prime ,var))\n (,end-value-name ,end))\n ((> ,var ,end-value-name))\n ,@body)))\n; Define the macro, note how comma is used to interpolate the value of the loop\n; expression\n(defmacro with-gensyms ((&rest names) &body body)\n `(let ,(loop for n in names collect `(,n (gensym)))\n ,@body)\n)" }, { "path": "src/test/resources/samples/langs/Common Lisp/motor-inferencia.cl", "content": "#|\r\nESCUELA POLITECNICA SUPERIOR - UNIVERSIDAD AUTONOMA DE MADRID\r\nINTELIGENCIA ARTIFICIAL\r\n\r\nMotor de inferencia\r\nBasado en parte en \"Paradigms of AI Programming: Case Studies\r\nin Common Lisp\", de Peter Norvig, 1992\r\n|#\r\n\r\n\r\n;;;;;;;;;;;;;;;;;;;;;\r\n;;;; Global variables\r\n;;;;;;;;;;;;;;;;;;;;;\r\n\r\n\r\n(defvar *hypothesis-list*)\r\n(defvar *rule-list*)\r\n(defvar *fact-list*)\r\n\r\n;;;;;;;;;;;;;;;;;;;;;\r\n;;;; Constants\r\n;;;;;;;;;;;;;;;;;;;;;\r\n\r\n(defconstant +fail+ nil \"Indicates unification failure\")\r\n\r\n(defconstant +no-bindings+ '((nil))\r\n \"Indicates unification success, with no variables.\")\r\n\r\n(defconstant *mundo-abierto* nil)\r\n\r\n\r\n\r\n;;;;;;;;;;;;;;;;;;;;;;;;;;;\r\n;;;; Functions for the user\r\n;;;;;;;;;;;;;;;;;;;;;;;;;;;\r\n\r\n\r\n;; Resets *fact-list* to NIL\r\n(defun erase-facts () (setq *fact-list* nil))\r\n\r\n(defun set-hypothesis-list (h) (setq *hypothesis-list* h))\r\n\r\n\r\n;; Returns a list of solutions, each one satisfying all the hypothesis contained\r\n;; in *hypothesis-list*\r\n(defun motor-inferencia ()\r\n (consulta *hypothesis-list*))\r\n\r\n\r\n\r\n;;;;;;;;;;;;;;;;;;;;;;;;\r\n;;;; Auxiliary functions\r\n;;;;;;;;;;;;;;;;;;;;;;;;\r\n\r\n#|____________________________________________________________________________\r\nFUNCTION: CONSULTA\r\n\r\nCOMMENTS:\r\nCONSULTA receives a list of hypothesis (variable ), and returns\r\na list of binding lists (each binding list being a solution).\r\n\r\nEXAMPLES:\r\nhypotheses is:\r\n((brothers ?x ?y) (neighbours juan ?x)).\r\n\r\nThat is, we are searching the brothers of the possible neighbors of Juan.\r\n\r\nThe function can return in this case:\r\n \r\n(((?x . sergio) (?y . javier)) ((?x . julian) (?y . mario)) ((?x . julian) (?y . pedro))).\r\nThat is, the neighbors of Juan (Sergio and Julian) have 3 brothers in total(Javier, Mario, Pedro)\r\n____________________________________________________________________________|#\r\n\r\n(defun consulta (hypotheses)\r\n (if (null hypotheses) (list +no-bindings+)\r\n (mapcan #'(lambda (b)\r\n (mapcar #'(lambda (x) (une-bindings-con-bindings b x))\r\n (consulta (subst-bindings b (rest hypotheses)))))\r\n (find-hypothesis-value (first hypotheses)))))\r\n\r\n\r\n\r\n#|____________________________________________________________________________\r\nFUNCTION: FIND-HYPOTHESIS-VALUE\r\n\r\nCOMMENTS:\r\nThis function manages the query a single query (only one hypothesis) given a binding list.\r\nIt tries (in the following order) to:\r\n- Answer the query from *fact-list*\r\n- Answer the query from the rules in *rule-list*\r\n- Ask the user\r\n\r\nThe function returns a list of solutions (list of binding lists).\r\n\r\nEXAMPLES:\r\nIf hypothesis is (brothers ?x ?y)\r\nand the function returns:\r\n(((?x . sergio) (?y . javier)) ((?x . julian) (?y . maria)) ((?x . alberto) (?y . pedro))).\r\n\r\nMeans that Sergio and Javier and brothers, Julian and Mario are brothers, and Alberto and Pedro are brothers.\r\n____________________________________________________________________________|#\r\n\r\n(defun find-hypothesis-value (hypothesis)\r\n (let (rules)\r\n (cond\r\n ((equality? hypothesis) \r\n (value-from-equality hypothesis))\r\n ((value-from-facts hypothesis))\r\n ((setq good-rules (find-rules hypothesis)) \r\n (value-from-rules hypothesis good-rules))\r\n (t (ask-user hypothesis)))))\r\n\r\n\r\n\r\n; une-bindings-con-bindings takes two binding lists and returns a binding list\r\n; Assumes that b1 and b2 are not +fail+\r\n(defun une-bindings-con-bindings (b1 b2)\r\n (cond\r\n ((equal b1 +no-bindings+) b2)\r\n ((equal b2 +no-bindings+) b1)\r\n (T (append b1 b2))))\r\n\r\n\r\n\r\n#|____________________________________________________________________________\r\nFUNCTION: VALUE-FROM-FACTS\r\n\r\nCOMMENTS:\r\nReturns all the solutions of obtained directly from *fact-list*\r\n\r\nEXAMPLES:\r\n> (setf *fact-list* '((man luis) (man pedro)(woman mart)(man daniel)(woman laura)))\r\n\r\n> (value-from-facts '(man ?x))\r\nreturns:\r\n\r\n(((?X . LUIS)) ((?X . PEDRO)) ((?X . DANIEL)))\r\n____________________________________________________________________________|#\r\n\r\n(defun value-from-facts (hypothesis)\r\n (mapcan #'(lambda(x) (let ((aux (unify hypothesis x)))\r\n (when aux (list aux)))) *fact-list*))\r\n\r\n\r\n\r\n\r\n#|____________________________________________________________________________\r\nFUNCTION: FIND-RULES\r\n\r\nCOMMENTS:\r\nReturns the rules in *rule-list* whose THENs unify with the term given in \r\nThe variables in the rules that satisfy this requirement are renamed.\r\n\r\nEXAMPLES:\r\n> (setq *rule-list*\r\n '((R1 (pertenece ?E (?E . ?_)))\r\n (R2 (pertenece ?E (?_ . ?Xs)) :- ((pertenece ?E ?Xs)))))\r\n\r\nThen:\r\n> (FIND-RULES (PERTENECE 1 (2 5)))\r\nreturns:\r\n((R2 (PERTENECE ?E.1 (?_ . ?XS.2)) :- ((PERTENECE ?E.1 ?XS.2))))\r\nThat is, only the THEN of rule R2 unify with \r\n\r\nHowever,\r\n> (FIND-RULES (PERTENECE 1 (1 6 7)))\r\n\r\nreturns:\r\n((R1 (PERTENECE ?E.6 (?E.6 . ?_)))\r\n (R2 (PERTENECE ?E.7 (?_ . ?XS.8)) :- ((PERTENECE ?E.7 ?XS.8))))\r\nSo the THEN of both rules unify with \r\n____________________________________________________________________________|#\r\n\r\n(defun find-rules (hypothesis)\r\n (mapcan #'(lambda(b) (let ((renamed-rule (rename-variables b)))\r\n (when (in-then? hypothesis renamed-rule)\r\n (list renamed-rule)))) *rule-list*))\r\n\r\n(defun in-then? (hypothesis rule)\r\n (unless (null (rule-then rule))\r\n (not (equal +fail+ (unify hypothesis (rule-then rule))))))\r\n\r\n\r\n\r\n#|____________________________________________________________________________\r\nFUNCTION: VALUE-FROM-RULES\r\n\r\nCOMMENTS:\r\nReturns all the solutions to found using all the rules given in\r\nthe list . Note that a single rule can have multiple solutions.\r\n____________________________________________________________________________|#\r\n(defun value-from-rules (hypothesis rules)\r\n (mapcan #'(lambda (r) (eval-rule hypothesis r)) rules))\r\n\r\n(defun limpia-vinculos (termino bindings)\r\n (unify termino (subst-bindings bindings termino)))\r\n\r\n\r\n#|____________________________________________________________________________\r\nFUNCTION: EVAL-RULE\r\n\r\nCOMMENTS:\r\nReturns all the solutions found using the rule given as input argument.\r\n\r\nEXAMPLES:\r\n> (setq *rule-list*\r\n '((R1 (pertenece ?E (?E . ?_)))\r\n (R2 (pertenece ?E (?_ . ?Xs)) :- ((pertenece ?E ?Xs)))))\r\nThen:\r\n> (EVAL-RULE \r\n (PERTENECE 1 (1 6 7)) \r\n (R1 (PERTENECE ?E.42 (?E.42 . ?_))))\r\nreturns:\r\n(((NIL)))\r\nThat is, the query (PERTENECE 1 (1 6 7)) can be proven from the given rule, and\r\nno binding in the variables in the query is necessary (in fact, the query has no variables).\r\nOn the other hand:\r\n> (EVAL-RULE \r\n (PERTENECE 1 (7)) \r\n (R2 (PERTENECE ?E.49 (?_ . ?XS.50)) :- ((PERTENECE ?E.49 ?XS.50))))\r\nreturns:\r\nNIL\r\nThat is, the query can not be proven from the rule R2.\r\n____________________________________________________________________________|#\r\n\r\n(defun eval-rule (hypothesis rule)\r\n (let ((bindings-then \r\n (unify (rule-then rule) hypothesis)))\r\n (unless (equal +fail+ bindings-then)\r\n (if (rule-ifs rule)\r\n (mapcar #'(lambda(b) (limpia-vinculos hypothesis (append bindings-then b)))\r\n (consulta (subst-bindings bindings-then (rule-ifs rule))))\r\n (list (limpia-vinculos hypothesis bindings-then))))))\r\n\r\n\r\n(defun ask-user (hypothesis)\r\n (let ((question hypothesis))\r\n (cond\r\n ((variables-in question) +fail+)\r\n ((not-in-fact-list? question) +fail+)\r\n (*mundo-abierto*\r\n (format t \"~%Es cierto el hecho ~S? (T/nil)\" question)\r\n (cond\r\n ((read) (add-fact question) +no-bindings+)\r\n (T (add-fact (list 'NOT question)) +fail+)))\r\n (T +fail+))))\r\n\r\n\r\n; value-from-equality:\r\n(defun value-from-equality (hypothesis)\r\n (let ((new-bindings (unify (second hypothesis) (third hypothesis))))\r\n (if (not (equal +fail+ new-bindings)) \r\n\t(list new-bindings))))\r\n\r\n\r\n\r\n#|____________________________________________________________________________\r\nFUNCTION: UNIFY\r\n\r\nCOMMENTS:\r\nFinds the most general unifier of two input expressions, taking into account the\r\nbindings specified in the input \r\nIn case the two expressions can unify, the function returns the total bindings necessary\r\nfor that unification. Otherwise, returns +fail+\r\n\r\nEXAMPLES:\r\n> (unify '1 '1)\r\n((NIL)) ;; which is the constant +no-bindings+\r\n> (unify 1 '2)\r\nnil ;; which is the constant +fail+\r\n> (unify '?x 1)\r\n((?x . 1))\r\n> (unify '(1 1) ?x)\r\n((? x 1 1))\r\n> (unify '?_ '?x)\r\n((NIL))\r\n> (unify '(p ?x 1 2) '(p ?y ?_ ?_))\r\n((?x . ?y))\r\n> (unify '(?a . ?_) '(1 2 3)) \r\n((?a . 1)) \r\n> (unify '(?_ ?_) '(1 2))\r\n((nil))\r\n> (unify '(?a . ?b) '(1 2 3)) \r\n((?b 2 3) (?a . 1)) \r\n> (unify '(?a . ?b) '(?v . ?d)) \r\n((?b . ?d) (?a . ?v)) \r\n> (unify '(?eval (+ 1 1)) '1) \r\nnil\r\n> (unify '(?eval (+ 1 1)) '2) \r\n(nil)) \r\n____________________________________________________________________________|#\r\n\r\n(defun unify (x y &optional (bindings +no-bindings+))\r\n \"See if x and y match with given bindings. If they do,\r\n return a binding list that would make them equal [p 303].\"\r\n (cond ((eq bindings +fail+) +fail+)\r\n ((eql x y) bindings)\r\n ((eval? x) (unify-eval x y bindings))\r\n ((eval? y) (unify-eval y x bindings))\r\n ((variable? x) (unify-var x y bindings))\r\n ((variable? y) (unify-var y x bindings))\r\n ((and (consp x) (consp y))\r\n (unify (rest x) (rest y) \r\n (unify (first x) (first y) bindings)))\r\n (t +fail+)))\r\n\r\n\r\n;; rename-variables: renombra ?X por ?X.1, ?Y por ?Y.2 etc. salvo ?_ que no se renombra\r\n(defun rename-variables (x)\r\n \"Replace all variables in x with new ones. Excepto ?_\"\r\n (sublis (mapcar #'(lambda (var) \r\n\t\t (if (anonymous-var? var)\r\n\t\t\t (make-binding var var)\r\n\t\t\t(make-binding var (new-variable var))))\r\n\t\t (variables-in x))\r\n\t x))\r\n\r\n\r\n\r\n;;;; Auxiliary Functions\r\n\r\n(defun unify-var (var x bindings)\r\n \"Unify var with x, using (and maybe extending) bindings [p 303].\"\r\n (cond ((or (anonymous-var? var)(anonymous-var? x)) bindings)\r\n\t((get-binding var bindings)\r\n\t (unify (lookup var bindings) x bindings))\r\n\t((and (variable? x) (get-binding x bindings))\r\n\t (unify var (lookup x bindings) bindings))\r\n\t((occurs-in? var x bindings)\r\n\t +fail+)\r\n\t(t (extend-bindings var x bindings))))\r\n\r\n(defun variable? (x)\r\n \"Is x a variable (a symbol starting with ?)?\"\r\n (and (symbolp x) (eql (char (symbol-name x) 0) #\\?)))\r\n\r\n(defun get-binding (var bindings)\r\n \"Find a (variable . value) pair in a binding list.\"\r\n (assoc var bindings))\r\n\r\n(defun binding-var (binding)\r\n \"Get the variable part of a single binding.\"\r\n (car binding))\r\n\r\n(defun binding-val (binding)\r\n \"Get the value part of a single binding.\"\r\n (cdr binding))\r\n\r\n(defun make-binding (var val) (cons var val))\r\n\r\n(defun lookup (var bindings)\r\n \"Get the value part (for var) from a binding list.\"\r\n (binding-val (get-binding var bindings)))\r\n\r\n(defun extend-bindings (var val bindings)\r\n \"Add a (var . value) pair to a binding list.\"\r\n (append \r\n (unless (eq bindings +no-bindings+) bindings)\r\n (list (make-binding var val))))\r\n\r\n(defun occurs-in? (var x bindings)\r\n \"Does var occur anywhere inside x?\"\r\n (cond ((eq var x) t)\r\n ((and (variable? x) (get-binding x bindings))\r\n (occurs-in? var (lookup x bindings) bindings))\r\n ((consp x) (or (occurs-in? var (first x) bindings)\r\n (occurs-in? var (rest x) bindings)))\r\n (t nil)))\r\n\r\n(defun subst-bindings (bindings x)\r\n \"Substitute the value of variables in bindings into x,\r\n taking recursively bound variables into account.\"\r\n (cond ((eq bindings +fail+) +fail+)\r\n ((eq bindings +no-bindings+) x)\r\n ((and (listp x) (eq '?eval (car x)))\r\n (subst-bindings-quote bindings x))\r\n ((and (variable? x) (get-binding x bindings))\r\n (subst-bindings bindings (lookup x bindings)))\r\n ((atom x) x)\r\n (t (cons (subst-bindings bindings (car x)) ;; s/reuse-cons/cons\r\n\t\t (subst-bindings bindings (cdr x))))))\r\n\r\n(defun unifier (x y)\r\n \"Return something that unifies with both x and y (or fail).\"\r\n (subst-bindings (unify x y) x))\r\n\r\n(defun variables-in (exp)\r\n \"Return a list of all the variables in EXP.\"\r\n (unique-find-anywhere-if #'variable? exp))\r\n\r\n(defun unique-find-anywhere-if (predicate tree &optional found-so-far)\r\n \"Return a list of leaves of tree satisfying predicate,\r\n with duplicates removed.\"\r\n (if (atom tree)\r\n (if (funcall predicate tree)\r\n (pushnew tree found-so-far)\r\n found-so-far)\r\n (unique-find-anywhere-if\r\n predicate\r\n (first tree)\r\n (unique-find-anywhere-if predicate (rest tree)\r\n found-so-far))))\r\n\r\n(defun find-anywhere-if (predicate tree)\r\n \"Does predicate apply to any atom in the tree?\" \r\n (if (atom tree)\r\n (funcall predicate tree)\r\n (or (find-anywhere-if predicate (first tree))\r\n (find-anywhere-if predicate (rest tree)))))\r\n\r\n(defun new-variable (var)\r\n \"Create a new variable. Assumes user never types variables of form ?X.9\"\r\n (gentemp (format nil \"~S.\" var)))\r\n; (gentemp \"?\") )\r\n;;;\r\n\r\n(defun anonymous-var? (x)\r\n (eq x '?_))\r\n\r\n(defun subst-bindings-quote (bindings x)\r\n \"Substitute the value of variables in bindings into x,\r\n taking recursively bound variables into account.\"\r\n (cond ((eq bindings +fail+) +fail+)\r\n ((eq bindings +no-bindings+) x)\r\n ((and (variable? x) (get-binding x bindings))\r\n (if (variable? (lookup x bindings))\r\n (subst-bindings-quote bindings (lookup x bindings))\r\n (subst-bindings-quote bindings (list 'quote (lookup x bindings)))\r\n )\r\n ) \r\n ((atom x) x)\r\n (t (cons (subst-bindings-quote bindings (car x)) ;; s/reuse-cons/cons\r\n\t\t (subst-bindings-quote bindings (cdr x))))))\r\n\r\n(defun eval? (x)\r\n (and (consp x) (eq (first x) '?eval)))\r\n\r\n(defun unify-eval (x y bindings)\r\n (let ((exp (subst-bindings-quote bindings (second x))))\r\n (if (variables-in exp)\r\n\t+fail+\r\n (unify (eval exp) y bindings))))\r\n\r\n\r\n\r\n(defun rule-ifs (rule) (fourth rule))\r\n(defun rule-then (rule) (second rule))\r\n\r\n\r\n(defun equality? (term)\r\n (and (consp term) (eql (first term) '?=)))\r\n\r\n\r\n(defun in-fact-list? (expresion)\r\n (some #'(lambda(x) (equal x expresion)) *fact-list*))\r\n \r\n(defun not-in-fact-list? (expresion)\r\n (if (eq (car expresion) 'NOT)\r\n (in-fact-list? (second expresion))\r\n (in-fact-list? (list 'NOT expresion))))\r\n\r\n\r\n;; add-fact:\r\n\r\n(defun add-fact (fact)\r\n (setq *fact-list* (cons fact *fact-list*)))\r\n\r\n\r\n(defun variable? (x)\r\n \"Is x a variable (a symbol starting with ?) except ?eval and ?=\"\r\n (and (not (equal x '?eval)) (not (equal x '?=)) \r\n (symbolp x) (eql (char (symbol-name x) 0) #\\?)))\r\n\r\n\r\n;; EOF" }, { "path": "src/test/resources/samples/langs/Common Lisp/rss.sexp", "content": "\n(:TURTLE\n\n (:@PREFIX \"rdf:\" \"\")\n (:@PREFIX \"owl:\" \"\")\n (:@PREFIX \"dc:\" \"\")\n (:@PREFIX \"xsd:\" \"\")\n (:@PREFIX \"rdfs:\" \"\")\n\n (:TRIPLES (:URIREF \"\")\n \n (:PREDICATE-OBJECT-LIST\n (:URIREF #1=\"\")\n (:OBJECTS\n (:QNAME \"rdfs:Class\")))\n \n (:PREDICATE-OBJECT-LIST\n (:QNAME \"rdfs:comment\")\n (:OBJECTS\n (:STRING \"An RSS information channel.\")))\n \n (:PREDICATE-OBJECT-LIST\n (:QNAME \"rdfs:isDefinedBy\")\n (:OBJECTS\n (:URIREF \"\")))\n \n (:PREDICATE-OBJECT-LIST\n (:QNAME \"rdfs:label\")\n (:OBJECTS\n (:STRING \"Channel\"))))\n \n (:TRIPLES (:URIREF \"\")\n \n (:PREDICATE-OBJECT-LIST\n (:URIREF #1#)\n (:OBJECTS\n (:QNAME \"rdf:Property\")))\n \n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:comment\")\n (:OBJECTS (:STRING \"A short text description of the subject.\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:isDefinedBy\")\n (:OBJECTS (:URIREF \"\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:label\") (:OBJECTS (:STRING \"Description\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:subPropertyOf\") (:OBJECTS (:QNAME \"dc:description\"))))\n (:TRIPLES (:URIREF \"\")\n (:PREDICATE-OBJECT-LIST (:URIREF #1#) (:OBJECTS (:QNAME \"rdfs:Class\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:comment\") (:OBJECTS (:STRING \"An RSS image.\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:isDefinedBy\")\n (:OBJECTS (:URIREF \"\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:label\") (:OBJECTS (:STRING \"Image\"))))\n (:TRIPLES (:URIREF \"\")\n (:PREDICATE-OBJECT-LIST (:URIREF #1#) (:OBJECTS (:QNAME \"rdfs:Class\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:comment\") (:OBJECTS (:STRING \"An RSS item.\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:isDefinedBy\")\n (:OBJECTS (:URIREF \"\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:label\") (:OBJECTS (:STRING \"Item\"))))\n (:TRIPLES (:URIREF \"\")\n (:PREDICATE-OBJECT-LIST (:URIREF #1#) (:OBJECTS (:QNAME \"rdf:Property\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:comment\")\n (:OBJECTS\n (:STRING \"Points to a list of rss:item elements that are members of the subject channel.\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:isDefinedBy\")\n (:OBJECTS (:URIREF \"\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:label\") (:OBJECTS (:STRING \"Items\"))))\n (:TRIPLES (:URIREF \"\")\n (:PREDICATE-OBJECT-LIST (:URIREF #1#) (:OBJECTS (:QNAME \"rdf:Property\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:comment\")\n (:OBJECTS (:STRING \"The URL to which an HTML rendering of the subject will link.\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:isDefinedBy\")\n (:OBJECTS (:URIREF \"\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:label\") (:OBJECTS (:STRING \"Link\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:subPropertyOf\") (:OBJECTS (:QNAME \"dc:identifier\"))))\n (:TRIPLES (:URIREF \"\")\n (:PREDICATE-OBJECT-LIST (:URIREF #1#) (:OBJECTS (:QNAME \"rdf:Property\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:comment\")\n (:OBJECTS (:STRING \"The text input field's (variable) name.\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:isDefinedBy\")\n (:OBJECTS (:URIREF \"\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:label\") (:OBJECTS (:STRING \"Name\"))))\n (:TRIPLES (:URIREF \"\")\n (:PREDICATE-OBJECT-LIST (:URIREF #1#) (:OBJECTS (:QNAME \"rdfs:Class\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:comment\") (:OBJECTS (:STRING \"An RSS text input.\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:isDefinedBy\")\n (:OBJECTS (:URIREF \"\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:label\") (:OBJECTS (:STRING \"Text Input\"))))\n (:TRIPLES (:URIREF \"\")\n (:PREDICATE-OBJECT-LIST (:URIREF #1#) (:OBJECTS (:QNAME \"rdf:Property\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:comment\")\n (:OBJECTS (:STRING \"A descriptive title for the channel.\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:isDefinedBy\")\n (:OBJECTS (:URIREF \"\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:label\") (:OBJECTS (:STRING \"Title\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:subPropertyOf\") (:OBJECTS (:QNAME \"dc:title\"))))\n (:TRIPLES (:URIREF \"\")\n (:PREDICATE-OBJECT-LIST (:URIREF #1#) (:OBJECTS (:QNAME \"rdf:Property\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:comment\")\n (:OBJECTS\n (:STRING\n \"The URL of the image to used in the 'src' attribute of the channel's image tag when rendered as HTML.\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:isDefinedBy\")\n (:OBJECTS (:URIREF \"\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:label\") (:OBJECTS (:STRING \"URL\")))\n (:PREDICATE-OBJECT-LIST (:QNAME \"rdfs:subPropertyOf\") (:OBJECTS (:QNAME \"dc:identifier\")))))\n" }, { "path": "src/test/resources/samples/langs/Common Lisp/sample.lisp", "content": ";;;; -*- lisp -*-\n\n(in-package :foo)\n\n;;; Header comment.\n(defvar *foo*)\n\n(eval-when (:execute :compile-toplevel :load-toplevel)\n (defun add (x &optional y &key z)\n (declare (ignore z))\n ;; Inline comment.\n (+ x (or y 1))))\n\n#|\nMulti-line comment.\n|#\n\n(defmacro foo (x &body b)\n (if x\n `(1+ ,x) ;After-line comment.\n 42))\n" }, { "path": "src/test/resources/samples/langs/Common Lisp/sample.lsp", "content": ";;;; -*- lisp -*-\n\n(in-package :foo)\n\n;;; Header comment.\n(defvar *foo*)\n\n(eval-when (:execute :compile-toplevel :load-toplevel)\n (defun add (x &optional y &key z)\n (declare (ignore z))\n ;; Inline comment.\n (+ x (or y 1))))\n\n#|\nMulti-line comment.\n|#\n\n(defmacro foo (x &body b)\n (if x\n `(1+ ,x) ;After-line comment.\n 42))\n" }, { "path": "src/test/resources/samples/langs/Common Workflow Language/trunk-peak-score.cwl", "content": "#!/usr/bin/env cwl-runner\n# Originally from\n# https://github.com/Duke-GCB/GGR-cwl/blob/54e897263a702ff1074c8ac814b4bf7205d140dd/utils/trunk-peak-score.cwl\n# Released under the MIT License:\n# https://github.com/Duke-GCB/GGR-cwl/blob/54e897263a702ff1074c8ac814b4bf7205d140dd/LICENSE\n# Converted to CWL v1.0 syntax using\n# https://github.com/common-workflow-language/cwl-upgrader\n# and polished by Michael R. Crusoe \n# All modifications also released under the MIT License\ncwlVersion: v1.0\nclass: CommandLineTool\ndoc: Trunk scores in ENCODE bed6+4 files\n\nhints:\n DockerRequirement:\n dockerPull: dukegcb/workflow-utils\n\ninputs:\n peaks:\n type: File\n sep:\n type: string\n default: \\t\n\noutputs:\n trunked_scores_peaks:\n type: stdout\n\nbaseCommand: awk\n\narguments:\n- -F $(inputs.sep)\n- BEGIN{OFS=FS}$5>1000{$5=1000}{print}\n- $(inputs.peaks.path)\n\nstdout: $(inputs.peaks.nameroot).trunked_scores$(inputs.peaks.nameext)\n" }, { "path": "src/test/resources/samples/langs/Component Pascal/Example.cp", "content": "MODULE ObxControls;\n(**\n project = \"BlackBox\"\n organization = \"www.oberon.ch\"\n contributors = \"Oberon microsystems\"\n version = \"System/Rsrc/About\"\n copyright = \"System/Rsrc/About\"\n license = \"Docu/BB-License\"\n changes = \"\"\n issues = \"\"\n\n**)\n\nIMPORT Dialog, Ports, Properties, Views;\n\nCONST beginner = 0; advanced = 1; expert = 2; guru = 3; (* user classes *)\n\nTYPE\n View = POINTER TO RECORD (Views.View)\n size: INTEGER (* border size in mm *)\n END;\n\nVAR\n data*: RECORD\n class*: INTEGER; (* current user class *)\n list*: Dialog.List; (* list of currently available sizes, derived from class *)\n width*: INTEGER (* width of next view to be opened. Derived from\n class, or entered through a text entry field *)\n END;\n\n predef: ARRAY 6 OF INTEGER; (* table of predefined sizes *)\n\n\nPROCEDURE SetList;\nBEGIN\n IF data.class = beginner THEN\n data.list.SetLen(1);\n data.list.SetItem(0, \"default\")\n ELSIF data.class = advanced THEN\n data.list.SetLen(4);\n data.list.SetItem(0, \"default\");\n data.list.SetItem(1, \"small\");\n data.list.SetItem(2, \"medium\");\n data.list.SetItem(3, \"large\");\n ELSE\n data.list.SetLen(6);\n data.list.SetItem(0, \"default\");\n data.list.SetItem(1, \"small\");\n data.list.SetItem(2, \"medium\");\n data.list.SetItem(3, \"large\");\n data.list.SetItem(4, \"tiny\");\n data.list.SetItem(5, \"huge\");\n END\nEND SetList;\n\n(* View *)\n\nPROCEDURE (v: View) CopyFromSimpleView (source: Views.View);\nBEGIN\n v.size := source(View).size\nEND CopyFromSimpleView;\n\nPROCEDURE (v: View) Restore (f: Views.Frame; l, t, r, b: INTEGER);\nBEGIN (* fill view with a red square of size v.size *)\n IF v.size = 0 THEN v.size := predef[0] END; (* lazy initialization of size *)\n f.DrawRect(0, 0, v.size, v.size, Ports.fill, Ports.red)\nEND Restore;\n\nPROCEDURE (v: View) HandlePropMsg (VAR msg: Views.PropMessage);\nBEGIN\n WITH msg: Properties.SizePref DO\n IF v.size = 0 THEN v.size := predef[0] END; (* lazy initialization of size *)\n msg.w := v.size; msg.h := v.size (* tell environment about desired width and height *)\n ELSE (* ignore other messages *)\n END\nEND HandlePropMsg;\n\n(* notifiers *)\n\nPROCEDURE ClassNotify* (op, from, to: INTEGER);\nBEGIN (* react to change in data.class *)\n IF op = Dialog.changed THEN\n IF (to = beginner) OR (to = advanced) & (data.list.index > 3) THEN\n (* if class is reduced, make sure that selection contains legal elements *)\n data.list.index := 0; data.width := predef[0]; (* modify interactor *)\n Dialog.Update(data) (* redraw controls where necessary *)\n END;\n SetList;\n Dialog.UpdateList(data.list) (* reconstruct list box contents *)\n END\nEND ClassNotify;\n\nPROCEDURE ListNotify* (op, from, to: INTEGER);\nBEGIN (* reacto to change in data.list (index to was selected) *)\n IF op = Dialog.changed THEN\n data.width := predef[to]; (* modify interactor *)\n Dialog.Update(data) (* redraw controls where necessary *)\n END\nEND ListNotify;\n\n(* guards *)\n\nPROCEDURE ListGuard* (VAR par: Dialog.Par);\nBEGIN (* disable list box for a beginner *)\n par.disabled := data.class = beginner\nEND ListGuard;\n\nPROCEDURE WidthGuard* (VAR par: Dialog.Par);\nBEGIN (* make text entry field read-only if user is not guru *)\n par.readOnly := data.class # guru\nEND WidthGuard;\n\n(* commands *)\n\nPROCEDURE Open*;\n VAR v: View;\nBEGIN\n NEW(v); (* create and initialize a new view *)\n v.size := data.width * Ports.mm; (* define view's size in function of class *)\n Views.OpenAux(v, \"Example\") (* open the view in a window *)\nEND Open;\n\nBEGIN (* initialization of global variables *)\n predef[0] := 40; predef[1] := 30; predef[2] := 50; (* predefined sizes *)\n predef[3] := 70; predef[4] := 20; predef[5] := 100;\n data.class := beginner; (* default values *)\n data.list.index := 0;\n data.width := predef[0];\n SetList\nEND ObxControls.\n" }, { "path": "src/test/resources/samples/langs/Component Pascal/Example2.cps", "content": "MODULE ObxFact;\n(**\n project = \"BlackBox\"\n organization = \"www.oberon.ch\"\n contributors = \"Oberon microsystems\"\n version = \"System/Rsrc/About\"\n copyright = \"System/Rsrc/About\"\n license = \"Docu/BB-License\"\n changes = \"\"\n issues = \"\"\n\n**)\n\nIMPORT\n Stores, Models, TextModels, TextControllers, Integers;\n\nPROCEDURE Read(r: TextModels.Reader; VAR x: Integers.Integer);\n VAR i, len, beg: INTEGER; ch: CHAR; buf: POINTER TO ARRAY OF CHAR;\nBEGIN\n r.ReadChar(ch);\n WHILE ~r.eot & (ch <= \" \") DO r.ReadChar(ch) END;\n ASSERT(~r.eot & (((ch >= \"0\") & (ch <= \"9\")) OR (ch = \"-\")));\n beg := r.Pos() - 1; len := 0;\n REPEAT INC(len); r.ReadChar(ch) UNTIL r.eot OR (ch < \"0\") OR (ch > \"9\");\n NEW(buf, len + 1);\n i := 0; r.SetPos(beg);\n REPEAT r.ReadChar(buf[i]); INC(i) UNTIL i = len;\n buf[i] := 0X;\n Integers.ConvertFromString(buf^, x)\nEND Read;\n\nPROCEDURE Write(w: TextModels.Writer; x: Integers.Integer);\n VAR i: INTEGER;\nBEGIN\n IF Integers.Sign(x) < 0 THEN w.WriteChar(\"-\") END;\n i := Integers.Digits10Of(x);\n IF i # 0 THEN\n REPEAT DEC(i); w.WriteChar(Integers.ThisDigit10(x, i)) UNTIL i = 0\n ELSE w.WriteChar(\"0\")\n END\nEND Write;\n\nPROCEDURE Compute*;\n VAR beg, end, i, n: INTEGER; ch: CHAR;\n s: Stores.Operation;\n r: TextModels.Reader; w: TextModels.Writer; attr: TextModels.Attributes;\n c: TextControllers.Controller;\n x: Integers.Integer;\nBEGIN\n c := TextControllers.Focus();\n IF (c # NIL) & c.HasSelection() THEN\n c.GetSelection(beg, end);\n r := c.text.NewReader(NIL); r.SetPos(beg); r.ReadChar(ch);\n WHILE ~r.eot & (beg < end) & (ch <= \" \") DO r.ReadChar(ch); INC(beg) END;\n IF ~r.eot & (beg < end) THEN\n r.ReadPrev; Read(r, x);\n end := r.Pos(); r.ReadPrev; attr :=r.attr;\n IF (Integers.Sign(x) > 0) & (Integers.Compare(x, Integers.Long(MAX(LONGINT))) <= 0) THEN\n n := SHORT(Integers.Short(x)); i := 2; x := Integers.Long(1);\n WHILE i <= n DO x := Integers.Product(x, Integers.Long(i)); INC(i) END;\n Models.BeginScript(c.text, \"computation\", s);\n c.text.Delete(beg, end);\n w := c.text.NewWriter(NIL); w.SetPos(beg); w.SetAttr(attr);\n Write(w, x);\n Models.EndScript(c.text, s)\n END\n END\n END\nEND Compute;\n\nEND ObxFact." }, { "path": "src/test/resources/samples/langs/Cool/list.cl", "content": "(* This simple example of a list class is adapted from an example in the\n Cool distribution. *)\n\nclass List {\n isNil() : Bool { true };\n head() : Int { { abort(); 0; } };\n tail() : List { { abort(); self; } };\n cons(i : Int) : List {\n (new Cons).init(i, self)\n };\n};\n\nclass Cons inherits List {\n car : Int;\t-- The element in this list cell\n cdr : List;\t-- The rest of the list\n isNil() : Bool { false };\n head() : Int { car };\n tail() : List { cdr };\n init(i : Int, rest : List) : List {\n {\n\t car <- i;\n\t cdr <- rest;\n\t self;\n }\n };\n};\n" }, { "path": "src/test/resources/samples/langs/Cool/sample.cl", "content": "(* Refer to Alex Aiken, \"The Cool Reference Manual\":\n http://theory.stanford.edu/~aiken/software/cool/cool-manual.pdf\n for language specification.\n*)\n\n-- Exhibit various language constructs\nclass Sample {\n testCondition(x: Int): Bool {\n if x = 0\n then false\n else\n if x < (1 + 2) * 3\n then true\n else false\n fi\n fi\n };\n\n testLoop(y: Int): Bool {\n while y > 0 loop\n {\n if not condition(y)\n then y <- y / 2\n else y <- y - 1;\n }\n pool\n };\n\n testAssign(z: Int): Bool {\n i : Int;\n i <- ~z;\n };\n\n testCase(var: Sample): SELF_TYPE {\n io : IO <- new IO;\n case var of\n a : A => io.out_string(\"Class type is A\\n\");\n b : B => io.out_string(\"Class type is B\\n\");\n s : Sample => io.out_string(\"Class type is Sample\\n\");\n o : Object => io.out_string(\"Class type is object\\n\");\n esac\n };\n\n testLet(i: Int): Int {\n let (a: Int in\n let(b: Int <- 3, c: Int <- 4 in\n {\n a <- 2;\n a * b * 2 / c;\n }\n )\n )\n };\n};\n\n-- Used to test subclasses\nclass A inherits Sample {};\nclass B inherits A {};\n\nclass C {\n main() : Int {\n (new Sample).testLet(1)\n };\n};\n\n-- \"Hello, world\" example\nclass Main inherits IO {\n main(): SELF_TYPE {\n out_string(\"Hello, World.\\n\")\n };\n};\n" }, { "path": "src/test/resources/samples/langs/Coq/Computation.v", "content": "(** The definition of computations, used to represent interactive programs. *)\nRequire Import Coq.NArith.NArith.\nRequire Import ListString.All.\n\nLocal Open Scope type.\n\n(** System calls. *)\nModule Command.\n Inductive t :=\n | AskCard\n | AskPIN\n | CheckPIN (pin : N)\n | AskAmount\n | CheckAmount (amount : N)\n | GiveCard\n | GiveAmount (amount : N)\n | ShowError (message : LString.t).\n\n (** The type of an answer for a command depends on the value of the command. *)\n Definition answer (command : t) : Type :=\n match command with\n | AskCard => bool (* If the given card seems valid. *)\n | AskPIN => option N (* A number or cancellation. *)\n | CheckPIN _ => bool (* If the PIN number is valid. *)\n | AskAmount => option N (* A number or cancellation. *)\n | CheckAmount _ => bool (* If the amount can be withdrawn. *)\n | GiveCard => bool (* If the card was given. *)\n | GiveAmount _ => bool (* If the money was given. *)\n | ShowError _ => unit (* Show an error message. *)\n end.\nEnd Command.\n\n(** Computations with I/Os. *)\nModule C.\n (** A computation can either does nothing, or do a system call and wait\n for the answer to run another computation. *)\n Inductive t : Type :=\n | Ret : t\n | Call : forall (command : Command.t), (Command.answer command -> t) -> t.\n Arguments Ret.\n Arguments Call _ _.\n\n (** Some optional notations. *)\n Module Notations.\n (** A nicer notation for `Ret`. *)\n Definition ret : t :=\n Ret.\n\n (** We define an explicit apply function so that Coq does not try to expand\n the notations everywhere. *)\n Definition apply {A B} (f : A -> B) (x : A) := f x.\n\n (** System call. *)\n Notation \"'call!' answer ':=' command 'in' X\" :=\n (Call command (fun answer => X))\n (at level 200, answer ident, command at level 100, X at level 200).\n\n (** System call with typed answer. *)\n Notation \"'call!' answer : A ':=' command 'in' X\" :=\n (Call command (fun (answer : A) => X))\n (at level 200, answer ident, command at level 100, A at level 200, X at level 200).\n\n (** System call ignoring the answer. *)\n Notation \"'do_call!' command 'in' X\" :=\n (Call command (fun _ => X))\n (at level 200, command at level 100, X at level 200).\n\n (** This notation is useful to compose computations which wait for a\n continuation. We do not have an explicit bind operator to simplify the\n language and the proofs. *)\n Notation \"'let!' x ':=' X 'in' Y\" :=\n (apply X (fun x => Y))\n (at level 200, x ident, X at level 100, Y at level 200).\n\n (** Let with a typed answer. *)\n Notation \"'let!' x : A ':=' X 'in' Y\" :=\n (apply X (fun (x : A) => Y))\n (at level 200, x ident, X at level 100, A at level 200, Y at level 200).\n\n (** Let ignoring the answer. *)\n Notation \"'do!' X 'in' Y\" :=\n (apply X (fun _ => Y))\n (at level 200, X at level 100, Y at level 200).\n End Notations.\nEnd C.\n" }, { "path": "src/test/resources/samples/langs/Coq/Imp.v", "content": "\nRequire Export SfLib.\n\nModule AExp.\n\nInductive aexp : Type :=\n\t| ANum : nat -> aexp\n\t| APlus : aexp -> aexp -> aexp\n\t| AMinus : aexp -> aexp -> aexp\n\t| AMult : aexp -> aexp -> aexp.\n\nInductive bexp : Type :=\n\t| BTrue : bexp\n\t| BFalse : bexp\n\t| BEq : aexp -> aexp -> bexp\n\t| BLe : aexp -> aexp -> bexp\n\t| BNot : bexp -> bexp\n\t| BAnd : bexp -> bexp -> bexp.\n\nFixpoint aeval (e: aexp) : nat :=\n\tmatch e with\n\t\t| ANum n => n\n\t\t| APlus a1 a2 => (aeval a1) + (aeval a2)\n\t\t| AMinus a1 a2 => (aeval a1) - (aeval a2)\n\t\t| AMult a1 a2 => (aeval a1) * (aeval a2)\n\tend.\n\nExample test_aeval1:\n\taeval (APlus (ANum 2) (ANum 2)) = 4.\nProof. reflexivity. Qed.\n\nFixpoint beval (e: bexp) : bool :=\n\tmatch e with\n\t\t| BTrue => true\n\t\t| BFalse => false\n\t\t| BEq a1 a2 => beq_nat (aeval a1) (aeval a2)\n\t\t| BLe a1 a2 => ble_nat (aeval a1) (aeval a2)\n\t\t| BNot b1 => negb (beval b1)\n\t\t| BAnd b1 b2 => andb (beval b1) (beval b2)\n\tend.\n\nFixpoint optimize_0plus (a:aexp) : aexp :=\n\tmatch a with\n\t\t| ANum n => ANum n\n\t\t| APlus (ANum 0) e2 => optimize_0plus e2\n\t\t| APlus e1 e2 => APlus (optimize_0plus e1) (optimize_0plus e2)\n\t\t| AMinus e1 e2 => AMinus (optimize_0plus e1) (optimize_0plus e2)\n\t\t| AMult e1 e2 => AMult (optimize_0plus e1) (optimize_0plus e2)\n\tend.\n\nExample test_optimize_0plus: \n optimize_0plus (APlus (ANum 2) \n\t\t\t(APlus (ANum 0) \n\t\t\t (APlus (ANum 0) (ANum 1)))) =\n\tAPlus (ANum 2) (ANum 1).\nProof. reflexivity. Qed.\n\nTheorem optimize_0plus_sound: forall e,\n\taeval (optimize_0plus e) = aeval e.\nProof.\nintros e. induction e.\n Case \"ANum\". reflexivity.\n Case \"APlus\". destruct e1.\n SCase \"e1 = ANum n\". destruct n.\n SSCase \"n = 0\". simpl. apply IHe2.\n SSCase \"n <> 0\". simpl. rewrite IHe2. reflexivity.\n SCase \"e1 = APlus e1_1 e1_2\".\n simpl. simpl in IHe1. rewrite IHe1. rewrite IHe2. reflexivity.\n SCase \"e1 = AMinus e1_1 e1_2\".\n simpl. simpl in IHe1. rewrite IHe1. rewrite IHe2. reflexivity.\n SCase \"e1 = AMult e1_1 e1_2\".\n simpl. simpl in IHe1. rewrite IHe1. rewrite IHe2. reflexivity.\n Case \"AMinus\".\n simpl. rewrite IHe1. rewrite IHe2. reflexivity.\n Case \"AMult\".\n simpl. rewrite IHe1. rewrite IHe2. reflexivity. Qed.\n\nTheorem optimize_0plus_sound': forall e,\n\taeval (optimize_0plus e) = aeval e.\nProof.\n\tintros e.\n\tinduction e;\n\t\ttry (simpl; rewrite IHe1; rewrite IHe2; reflexivity).\n\tCase \"ANum\". reflexivity.\n\tCase \"APlus\".\n\t\tdestruct e1;\n\t\ttry (simpl; simpl in IHe1; rewrite IHe1; rewrite IHe2; reflexivity).\n\t\tSCase \"e1 = ANum n\". destruct n;\n\t\t\tsimpl; rewrite IHe2; reflexivity. Qed.\n\nTheorem optimize_0plus_sound'': forall e,\n\taeval (optimize_0plus e) = aeval e.\nProof.\n\tintros e.\n\tinduction e;\n\t\ttry (simpl; rewrite IHe1; rewrite IHe2; reflexivity);\n\t\ttry reflexivity.\n\tCase \"APlus\".\n\t\tdestruct e1;\n\t\t\ttry (simpl; simpl in IHe1; rewrite IHe1; rewrite IHe2; reflexivity).\n\t\t\tSCase \"e1 = ANum n\". destruct n;\n\t\t\t\tsimpl; rewrite IHe2; reflexivity. Qed.\n\nTactic Notation \"simpl_and_try\" tactic(c) :=\n\tsimpl;\n\ttry c.\n\nTactic Notation \"aexp_cases\" tactic(first) ident(c) :=\n\tfirst;\n\t[ Case_aux c \"ANum\" | Case_aux c \"APlus\"\n\t\t| Case_aux c \"AMinus\" | Case_aux c \"AMult\" ].\n\nTheorem optimize_0plus_sound''': forall e,\n\taeval (optimize_0plus e) = aeval e.\nProof.\n\tintros e.\n\taexp_cases (induction e) Case;\n\t\ttry (simpl; rewrite IHe1; rewrite IHe2; reflexivity);\n\t\ttry reflexivity.\n\n\t\tCase \"APlus\".\n\t\t\taexp_cases (destruct e1) SCase;\n\t\t\t\ttry (simpl; simpl in IHe1; rewrite IHe1; rewrite IHe2; reflexivity).\n\t\t\tSCase \"ANum\". destruct n;\n\t\t\t\tsimpl; rewrite IHe2; reflexivity. Qed.\n\n\nFixpoint optimize_0plus_all (b:bexp) : bexp :=\n\tmatch b with\n\t\t| BTrue => BTrue\n\t\t| BFalse => BFalse\n\t\t| BEq a1 a2 => BEq (optimize_0plus a1) (optimize_0plus a2)\n\t\t| BLe a1 a2 => BLe (optimize_0plus a1) (optimize_0plus a2)\n\t\t| BNot b1 => BNot b1\n\t\t| BAnd b1 b2 => BAnd b1 b2\n\tend.\n\nTactic Notation \"bexp_cases\" tactic(first) ident(c) :=\n\tfirst;\n\t[ Case_aux c \"BTrue\" | Case_aux c \"BFalse\"\n\t\t\t | Case_aux c \"BEq\" | Case_aux c \"BLe\" | Case_aux c \"BNot\"\n\t\t\t\t| Case_aux c \"BAnd\" ].\n\nTheorem optimize_0plus_all_sound: forall (e:bexp),\n\tbeval (optimize_0plus_all e) = beval e.\nProof.\n\tintros e.\n\tbexp_cases (destruct e) Case;\n\ttry (simpl; rewrite optimize_0plus_sound; rewrite optimize_0plus_sound);\n\ttry reflexivity.\nQed.\n\nFixpoint optimize_and (b: bexp): bexp :=\n\tmatch b with\n\t\t| BTrue => BTrue\n\t\t| BFalse => BFalse\n\t\t| BEq a1 a2 => BEq a1 a2\n\t\t| BLe a1 a2 => BLe a1 a2\n\t\t| BNot a1 => BNot (optimize_and a1)\n\t\t| BAnd BFalse a2 => BFalse\n\t\t| BAnd a1 a2 => BAnd (optimize_and a1) (optimize_and a2)\n\tend.\n\nTheorem optimize_and_sound: forall (e:bexp),\n\tbeval (optimize_and e) = beval e.\nProof.\n\tintros e.\n\tbexp_cases (induction e) Case;\n\ttry (simpl; rewrite IHe);\n\ttry reflexivity.\n\tCase \"BAnd\". simpl.\n\t\tbexp_cases (destruct e1) SCase;\n\t\t\ttry reflexivity;\n\t\t\ttry (simpl; rewrite IHe2; reflexivity);\n\t\t\ttry (simpl; simpl in IHe1; rewrite IHe2; rewrite IHe1; reflexivity).\nQed.\n\nModule aevalR_first_try.\n\nInductive aevalR : aexp -> nat -> Prop :=\n\t| E_Anum : forall (n : nat),\n\t\t\t\t\t\t\taevalR (ANum n) n\n\t| E_APlus : forall (e1 e2 : aexp) (n1 n2 : nat),\n\t\t\t\t\t\t\t\taevalR e1 n1 -> aevalR e2 n2 -> aevalR (APlus e1 e2) (n1 + n2)\n\t| E_AMinus: forall (e1 e2 : aexp) (n1 n2 : nat),\n\t\t\t\t\t\t\t\taevalR e1 n1 -> aevalR e2 n2 -> aevalR (AMinus e1 e2) (n1 - n2)\n\t| E_AMult : forall (e1 e2 : aexp) (n1 n2 : nat),\n\t\t\t\t\t\t\t\taevalR e1 n1 -> aevalR e2 n2 -> aevalR (AMult e1 e2) (n1 * n2).\n\nNotation \"e '==>' n\" := (aevalR e n) (at level 40).\n\nEnd aevalR_first_try.\n\nReserved Notation \"e '==>' n\" (at level 40).\n\nInductive aevalR : aexp -> nat -> Prop :=\n\t| E_ANum : forall (n : nat), (ANum n) ==> n\n\t| E_APlus : forall (e1 e2 : aexp) (n1 n2 : nat),\n\t\t\t\t\t\t\t\t(e1 ==> n1) -> (e2 ==> n2) -> (APlus e1 e2) ==> (n1 + n2)\n\t| E_AMinus : forall (e1 e2 : aexp) (n1 n2 : nat),\n\t\t\t\t\t\t\t\t(e1 ==> n1) -> (e2 ==> n2) -> (AMinus e1 e2) ==> (n1 - n2)\n\t| E_AMult : forall (e1 e2 : aexp) (n1 n2 : nat),\n\t\t\t\t\t\t\t\t(e1 ==> n1) -> (e2 ==> n2) -> (AMult e1 e2) ==> (n1 * n2)\nwhere \"e '==>' n\" := (aevalR e n).\n\nInductive bevalR : bexp -> bool -> Prop :=\n\t| E_BTrue : bevalR (BTrue) true\n\t| E_BFalse : bevalR (BFalse) false\n\t| E_BEq : forall (e1 e2: aexp) (n1 n2 : nat),\n\t\t\t\t\t\taevalR e1 n1 -> aevalR e2 n2 -> bevalR (BEq e1 e2) (beq_nat n1 n2)\n\t| E_BLe : forall (e1 e2 : aexp) (n1 n2 : nat),\n\t\t\t\t\t\taevalR e1 n1 -> aevalR e2 n2 -> bevalR (BLe e1 e2) (ble_nat n1 n2)\n\t| E_BNot : forall (e1 : bexp) (b : bool),\n\t\t\t\t\t\t\tbevalR e1 b -> bevalR (BNot e1) (negb b)\n\t| E_BAnd : forall (e1 e2 : bexp) (b1 b2 : bool),\n\t\t\t\t\t\t\tbevalR e1 b1 -> bevalR e2 b2 -> bevalR (BAnd e1 e2) (andb b1 b2).\n\nTactic Notation \"aevalR_cases\" tactic(first) ident(c) :=\n\tfirst;\n\t[ Case_aux c \"E_Anum\" | Case_aux c \"E_APlus\"\n\t\t| Case_aux c \"E_AMinus\" | Case_aux c \"E_AMult\" ].\n\nTheorem aeval_iff_aevalR : forall a n,\n\t(a ==> n) <-> aeval a = n.\nProof.\n\tsplit.\n\tCase \"->\".\n\t\tintros H; induction H; subst; reflexivity;\n\tCase \"<-\".\n\t\tgeneralize dependent n.\n\t\tinduction a; simpl; intros; subst; constructor;\n\t\t\ttry apply IHa1; try apply IHa2; reflexivity.\nQed.\n\nTactic Notation \"bevalR_cases\" tactic(first) ident(c) :=\n\tfirst;\n\t[ Case_aux c \"E_BTrue\" | Case_aux c \"E_BFalse\"\n\t\t| Case_aux c \"E_BEq\" | Case_aux c \"E_BLe\" | Case_aux c \"E_BNot\"\n\t\t| Case_aux c \"E_BAnd\" ].\n\nTheorem beval_iff_bevalR : forall a b,\n\tbevalR a b <-> beval a = b.\nProof.\nsplit.\nintros H.\ninduction H.\nsimpl in |- *.\nreflexivity.\n\nsimpl in |- *.\nreflexivity.\n\nsimpl in |- *.\napply aeval_iff_aevalR in H.\napply aeval_iff_aevalR in H0.\nsubst.\nreflexivity.\n\nsimpl in |- *.\napply aeval_iff_aevalR in H0.\napply aeval_iff_aevalR in H.\nsubst.\nreflexivity.\n\nsimpl in |- *.\nrewrite IHbevalR in |- *.\nreflexivity.\n\nsimpl in |- *.\nrewrite IHbevalR1 in |- *.\nrewrite IHbevalR2 in |- *.\nreflexivity.\ngeneralize dependent b.\ninduction a.\nintros b H. subst. constructor.\nintros b H.\nsubst.\nconstructor.\n\nintros b H.\nrewrite <- H in |- *.\nconstructor.\nsimpl in H.\nremember (aeval a)as A in *.\nassert (aeval a = A).\nsubst.\nreflexivity.\n\napply aeval_iff_aevalR in H0.\napply H0.\n\nremember (aeval a0)as A in *.\nassert (aeval a0 = A).\nsubst.\nreflexivity.\n\napply aeval_iff_aevalR in H0.\napply H0.\n\nintros b.\nintros H.\nsimpl in H.\nrewrite <- H in |- *.\nsimpl in |- *.\nconstructor.\nremember (aeval a)as A in *.\nassert (aeval a = A).\nsubst.\nreflexivity.\n\napply aeval_iff_aevalR in H0.\napply H0.\n\nremember (aeval a0)as A in *.\nassert (aeval a0 = A).\nsubst.\nreflexivity.\n\napply aeval_iff_aevalR in H0.\napply H0.\n\nintros b.\nintros H.\nsimpl in |- *.\nsimpl in H.\nrewrite <- H in |- *.\nconstructor.\napply IHa.\nreflexivity.\n\nintros b.\nsimpl in |- *.\nintros H.\nrewrite <- H in |- *.\nconstructor.\napply IHa1.\nreflexivity.\n\napply IHa2.\nreflexivity.\nQed.\n\nEnd AExp.\n\nExample silly_presburger_formula : forall m n o p,\n\tm + n <= n + o /\\ o + 3 = p + 3 ->\n\tm <= p.\nProof.\n\tintros. omega.\nQed.\n\nModule Id.\n\nInductive id : Type :=\n\tId : nat -> id.\n\nDefinition beq_id id1 id2 :=\n\tmatch (id1, id2) with\n\t\t(Id n1, Id n2) => beq_nat n1 n2\n\tend.\n\nTheorem beq_id_refl : forall i,\n\t\ttrue = beq_id i i.\nProof.\n\tintros. destruct i.\n\tapply beq_nat_refl. Qed.\n\nTheorem beq_id_eq : forall i1 i2,\n\ttrue = beq_id i1 i2 -> i1 = i2.\nProof.\nintros i1 i2.\ndestruct i1.\ndestruct i2.\nunfold beq_id in |- *.\nintros H.\napply beq_nat_eq in H.\nsubst.\nreflexivity.\nQed.\n\nTheorem beq_id_false_not_eq : forall i1 i2,\n\tbeq_id i1 i2 = false -> i1 <> i2.\nProof.\nintros i1 i2.\ndestruct i1.\ndestruct i2.\nunfold beq_id in |- *.\nintros H.\nintros C.\nunfold beq_id in |- *.\nassert (false = beq_nat n n0).\nsubst.\nrewrite <- H in |- *.\nreflexivity.\n\napply beq_false_not_eq in H0.\napply H0.\nsubst.\ninversion C.\nreflexivity.\nQed.\n\nTheorem not_eq_beq_id_false : forall i1 i2,\n\ti1 <> i2 -> beq_id i1 i2 = false.\nProof.\n\tintros i1 i2.\n\tdestruct i1. destruct i2.\n\tunfold beq_id in |- *.\n\tintros H.\n\tapply not_eq_beq_false.\n\tintros C.\n\tapply H.\n\tsubst.\n\treflexivity.\nQed.\n\nTheorem beq_nat_sym : forall (n m:nat), forall (b: bool),\n\tbeq_nat n m = b -> beq_nat m n = b.\nProof.\n\tintros n.\n\tinduction n as [| n'].\n\tCase \"n = O\".\n\t\tintros m b eq1.\n\t\tinduction m.\n\t\tSCase \"m = 0\".\n\t\t\tapply eq1.\n\t\tSCase \"m = S m'\".\n\t\t\tapply eq1.\n\tCase \"n = S n'\".\n\t\tinduction m.\n\t\tSCase \"m = 0\".\n\t\t\tintros b eq1.\n\t\t\tapply eq1.\n\t\tSCase \"m = S m'\".\n\t\t\tintros b eq1.\n\t\t\tapply IHn'.\n\t\t\tapply eq1.\n\t\tQed.\n\nTheorem beq_id_sym : forall i1 i2,\n\tbeq_id i1 i2 = beq_id i2 i1.\nProof.\n\tintros i1 i2.\n\tdestruct i1. destruct i2.\n\tunfold beq_id.\n\tapply beq_nat_sym.\n\treflexivity.\nQed.\n\nEnd Id.\n\nDefinition state := id -> nat.\nDefinition empty_state : state := fun _ => 0.\nDefinition update (st : state) (V:id) (n:nat) : state :=\n\tfun V' => if beq_id V V' then n else st V'.\n\nTheorem update_eq : forall n V st,\n\t(update st V n) V = n.\nProof.\nintros n V st.\nunfold update.\nrewrite <- beq_id_refl.\nreflexivity.\nQed.\n\nTheorem update_neq : forall V2 V1 n st,\n\tbeq_id V2 V1 = false ->\n\t\t(update st V2 n) V1 = (st V1).\nProof.\nintros V2 V1 n st.\nintros H.\nunfold update.\nrewrite H.\nreflexivity.\nQed.\n\nTheorem update_example : forall (n:nat),\n\t(update empty_state (Id 2) n) (Id 3) = 0.\nProof.\nunfold update.\nintros n.\nsimpl.\nunfold empty_state.\nreflexivity.\nQed.\n\nTheorem update_shadow : forall x1 x2 k1 k2 (f:state),\n\t(update (update f k2 x1) k2 x2) k1 = (update f k2 x2) k1.\nProof.\nintros x1 x2 k1 k2 f.\nunfold update in |- *.\ndestruct (beq_id k2 k1);\n reflexivity.\nQed.\n\nTheorem update_same : forall x1 k1 k2 (f : state),\n\tf k1 = x1 ->\n\t\t(update f k1 x1) k2 = f k2.\nProof.\nunfold update in |- *.\nintros x1 k1 k2 f.\nremember (beq_id k1 k2)as A in *.\ndestruct A.\napply beq_id_eq in HeqA.\nsubst.\nintros H.\nsubst.\nreflexivity.\n\nintros H.\nreflexivity.\nQed.\n\n\nTheorem update_permute : forall x1 x2 k1 k2 k3 f,\n\tbeq_id k2 k1 = false ->\n\t\t(update (update f k2 x1) k1 x2) k3 = (update (update f k1 x2) k2 x1) k3.\nProof.\nintros x1 x2 k1 k2 k3 f.\nintros H.\nunfold update in |- *.\nremember (beq_id k1 k3)as A1 in *.\ndestruct A1.\napply beq_id_eq in HeqA1.\nrewrite HeqA1 in H.\ndestruct (beq_id k2 k3).\ninversion H.\n\nreflexivity.\n\nremember (beq_id k2 k3)as B in *.\ndestruct B;\ntry reflexivity.\nQed.\n\nInductive aexp : Type := \n\t| ANum : nat -> aexp\n\t| AId : id -> aexp (* <----- NEW *)\n\t| APlus : aexp -> aexp -> aexp\n\t| AMinus : aexp -> aexp -> aexp\n\t| AMult : aexp -> aexp -> aexp.\n\nTactic Notation \"aexp_cases\" tactic(first) ident(c) :=\n\tfirst;\n\t[ Case_aux c \"ANum\" | Case_aux c \"AId\" | Case_aux c \"APlus\"\n\t| Case_aux c \"AMinus\" | Case_aux c \"AMult\" ].\n\nDefinition X : id := Id 0.\nDefinition Y : id := Id 1.\nDefinition Z : id := Id 2.\n\nInductive bexp : Type :=\n\t| BTrue : bexp\n\t| BFalse : bexp\n\t| BEq : aexp -> aexp -> bexp\n\t| BLe : aexp -> aexp -> bexp\n\t| BNot : bexp -> bexp\n\t| BAnd : bexp -> bexp -> bexp.\n\nTactic Notation \"bexp_cases\" tactic(first) ident(c) :=\n\tfirst;\n\t[ Case_aux c \"BTrue\" | Case_aux c \"BFalse\" | Case_aux c \"BEq\"\n\t| Case_aux c \"BLe\" | Case_aux c \"BNot\" | Case_aux c \"BAnd\" ].\n\nFixpoint aeval (st : state) (e : aexp) : nat :=\n match e with\n | ANum n => n\n | AId i => st i (* <----- NEW *)\n | APlus a1 a2 => (aeval st a1) + (aeval st a2)\n | AMinus a1 a2 => (aeval st a1) - (aeval st a2)\n | AMult a1 a2 => (aeval st a1) * (aeval st a2)\n end.\n\nFixpoint beval (st : state) (e : bexp) : bool :=\n match e with \n | BTrue => true\n | BFalse => false\n | BEq a1 a2 => beq_nat (aeval st a1) (aeval st a2)\n | BLe a1 a2 => ble_nat (aeval st a1) (aeval st a2)\n | BNot b1 => negb (beval st b1)\n | BAnd b1 b2 => andb (beval st b1) (beval st b2)\n end.\n\nExample aexp1 : \n aeval (update empty_state X 5) \n (APlus (ANum 3) (AMult (AId X) (ANum 2))) \n = 13.\nProof. reflexivity. Qed.\n\nExample bexp1 :\n beval (update empty_state X 5) \n (BAnd BTrue (BNot (BLe (AId X) (ANum 4))))\n = true.\nProof. reflexivity. Qed.\n\nInductive com : Type :=\n\t| CSkip : com\n\t| CAss : id -> aexp -> com\n\t| CSeq : com -> com -> com\n\t| CIf : bexp -> com -> com -> com\n\t| CWhile : bexp -> com -> com.\n\nTactic Notation \"com_cases\" tactic(first) ident(c) :=\n\tfirst;\n\t[ Case_aux c \"SKIP\" | Case_aux c \"::=\" | Case_aux c \";\"\n\t| Case_aux c \"IFB\" | Case_aux c \"WHILE\" ].\n\nNotation \"'SKIP'\" := \n\tCSkip.\nNotation \"l '::=' a\" := \n\t(CAss l a) (at level 60).\nNotation \"c1 ; c2\" := \n\t(CSeq c1 c2) (at level 80, right associativity).\nNotation \"'WHILE' b 'DO' c 'END'\" := \n\t(CWhile b c) (at level 80, right associativity).\nNotation \"'IFB' e1 'THEN' e2 'ELSE' e3 'FI'\" := \n\t(CIf e1 e2 e3) (at level 80, right associativity).\n\nDefinition plus2 : com :=\n\tX ::= (APlus (AId X) (ANum 2)).\n\nDefinition XtimesYinZ : com :=\n\tZ ::= (AMult (AId X) (AId Y)).\n\nDefinition subtract_slowly_body : com :=\n\tZ ::= AMinus (AId Z) (ANum 1);\n\tX ::= AMinus (AId X) (ANum 1).\n\nDefinition subtract_slowly : com :=\n\tWHILE BNot (BEq (AId X) (ANum 0)) DO\n\t\tsubtract_slowly_body\n\tEND.\n\nDefinition subtract_3_from_5_slowly : com :=\n\tX ::= ANum 3 ;\n\tZ ::= ANum 5 ;\n\tsubtract_slowly.\n\nDefinition loop : com :=\n WHILE BTrue DO\n\t\tSKIP\n\tEND.\n\nDefinition fact_body : com :=\n Y ::= AMult (AId Y) (AId Z) ;\n\tZ ::= AMinus (AId Z) (ANum 1).\n\nDefinition fact_loop : com :=\n\tWHILE BNot (BEq (AId Z) (ANum 0)) DO\n\t\tfact_body\n\tEND.\n\nDefinition fact_com : com :=\n\tZ ::= AId X ;\n\tY ::= ANum 1 ;\n\tfact_loop.\n\nFixpoint ceval_step1 (st:state) (c:com) : state :=\n\tmatch c with\n\t\t| SKIP => st\n\t\t| l ::= a1 =>\n\t\t\t\tupdate st l (aeval st a1)\n\t\t| c1 ; c2 =>\n\t\t\tlet st' := ceval_step1 st c1 in\n\t\t\t\tceval_step1 st' c2\n\t\t| IFB b THEN c1 ELSE c2 FI =>\n\t\t\tif (beval st b) then ceval_step1 st c1 else ceval_step1 st c2\n\t\t| WHILE b1 DO c1 END =>\n\t\t\tst (* bogus *)\n\tend.\n\nFixpoint ceval_step2 (st: state) (c:com) (i:nat) : state :=\n\tmatch i with\n\t\t| O => empty_state\n\t\t| S i' =>\n\t\t\t\tmatch c with\n\t\t\t\t\t| SKIP => st\n\t\t\t\t\t| l ::= a1 =>\n\t\t\t\t\t\t\tupdate st l (aeval st a1)\n\t\t\t\t\t| c1 ; c2 => let st' := ceval_step2 st c1 i' in\n\t\t\t\t\t\t\t\t\t\t\tceval_step2 st' c2 i'\n\t\t\t\t\t| IFB b THEN c1 ELSE c2 FI =>\n\t\t\t\t\t\t\tif (beval st b) then ceval_step2 st c1 i' else ceval_step2 st c2 i'\n\t\t\t\t\t| WHILE b1 DO c1 END =>\n\t\t\t\t\t\t\tif (beval st b1)\n\t\t\t\t\t\t\tthen let st' := ceval_step2 st c1 i' in\n\t\t\t\t\t\t\t\t\tceval_step2 st' c i'\n\t\t\t\t\t\t\telse st\n\t\t\t\tend\n\tend.\n\nFixpoint ceval_step3 (st: state) (c:com) (i:nat) : option state :=\n\tmatch i with\n\t\t| O => None\n\t\t| S i' =>\n\t\t\t\tmatch c with\n\t\t\t\t\t| SKIP => Some st\n\t\t\t\t\t| l ::= a1 =>\n\t\t\t\t\t\t\tSome (update st l (aeval st a1))\n\t\t\t\t\t| c1 ; c2 => match (ceval_step3 st c1 i') with\n\t\t\t\t\t\t\t\t\t\t\t\t| Some st' => ceval_step3 st' c2 i'\n\t\t\t\t\t\t\t\t\t\t\t\t| None => None\n\t\t\t\t\t\t\t\t\t\t\tend\n\t\t\t\t\t| IFB b THEN c1 ELSE c2 FI =>\n\t\t\t\t\t\t\tif (beval st b) then ceval_step3 st c1 i' else ceval_step3 st c2 i'\n\t\t\t\t\t| WHILE b1 DO c1 END =>\n\t\t\t\t\t\t\tif (beval st b1)\n\t\t\t\t\t\t\tthen match (ceval_step3 st c1 i') with\n\t\t\t\t\t\t\t\t\t\t| Some st' => ceval_step3 st' c i'\n\t\t\t\t\t\t\t\t\t\t| None => None\n\t\t\t\t\t\t\t\t\tend\n\t\t\t\t\t\t\telse Some st\n\t\t\t\tend\n\tend.\n\nDefinition bind_option {X Y : Type} (xo : option X) (f : X -> option Y) : option Y :=\n\tmatch xo with\n\t\t| None => None\n\t\t| Some x => f x\n\tend.\n\nFixpoint ceval_step (st: state) (c:com) (i:nat) : option state :=\n\tmatch i with\n\t\t| O => None\n\t\t| S i' =>\n\t\t\t\tmatch c with\n\t\t\t\t\t| SKIP => Some st\n\t\t\t\t\t| l ::= a1 =>\n\t\t\t\t\t\t\tSome (update st l (aeval st a1))\n\t\t\t\t\t| c1 ; c2 => bind_option (ceval_step st c1 i')\n\t\t\t\t\t\t\t\t\t\t\t\t(fun st' => ceval_step st' c2 i')\n\t\t\t\t\t| IFB b THEN c1 ELSE c2 FI =>\n\t\t\t\t\t\t\tif (beval st b) then ceval_step st c1 i' else ceval_step st c2 i'\n\t\t\t\t\t| WHILE b1 DO c1 END =>\n\t\t\t\t\t\t\tif (beval st b1)\n\t\t\t\t\t\t\tthen bind_option (ceval_step st c1 i')\n\t\t\t\t\t\t\t\t\t (fun st' => ceval_step st' c i')\n\t\t\t\t\t\t\telse Some st\n\t\t\t\tend\n\tend.\n\nDefinition test_ceval (st:state) (c:com) :=\n\tmatch ceval_step st c 500 with\n\t\t| None => None\n\t\t| Some st => Some (st X, st Y, st Z)\n\tend.\n\nDefinition pup_to_n: com :=\n\t(Y ::= (ANum 0) ;\n\t WHILE (BLe (ANum 1) (AId X)) DO\n\t \tY ::= (APlus (AId X) (AId Y)) ;\n\t\t \tX ::= (AMinus (AId X) (ANum 1))\n\tEND) .\n\nExample pup_to_n_1 :\n\ttest_ceval (update empty_state X 5) pup_to_n\n\t\t= Some (0, 15, 0).\nProof. reflexivity. Qed.\n\nDefinition ceval_even : com :=\n\tWHILE (BLe (ANum 2) (AId X)) DO\n\t\tX ::= (AMinus (AId X) (ANum 2))\n\tEND ;\n\tZ ::= (AId X).\n\nExample ceval_even_test1 :\n\ttest_ceval (update empty_state X 20) ceval_even\n\t\t= Some (0, 0, 0).\nProof. reflexivity. Qed.\n\nExample ceval_even_test2 :\n\ttest_ceval (update empty_state X 21) ceval_even\n\t\t= Some (1, 0, 1).\nProof. reflexivity. Qed.\n\nExample ceval_even_test3 :\n\ttest_ceval (update empty_state X 2) ceval_even\n\t\t= Some (0, 0, 0).\nProof. reflexivity. Qed.\n\nExample ceval_even_test4 :\n\ttest_ceval (update empty_state X 1) ceval_even\n\t\t= Some (1, 0, 1).\nProof. reflexivity. Qed.\n\nExample ceval_even_test5 :\n\ttest_ceval (update empty_state X 0) ceval_even\n\t\t= Some (0, 0, 0).\nProof. reflexivity. Qed.\n\nReserved Notation \"cl '/' st '==>' st'\" (at level 40, st at level 39).\n\nInductive ceval : com -> state -> state -> Prop :=\n\t| E_Skip : forall st,\n\t\tSKIP / st ==> st\n\t| E_Ass : forall st al n l,\n\t\taeval st al = n ->\n\t\t\t(l ::= al) / st ==> (update st l n)\n\t| E_Seq : forall c1 c2 st st' st'',\n\t\tc1 / st ==> st' ->\n\t\t\tc2 / st' ==> st'' ->\n\t\t\t\t(c1 ; c2) / st ==> st''\n\t| E_IfTrue : forall st st' b1 c1 c2,\n\t\tbeval st b1 = true ->\n\t\t\tc1 / st ==> st' ->\n\t\t\t\t(IFB b1 THEN c1 ELSE c2 FI) / st ==> st'\n\t| E_IfFalse : forall st st' b1 c1 c2,\n\t\tbeval st b1 = false ->\n\t\t\tc2 / st ==> st' ->\n\t\t\t\t(IFB b1 THEN c1 ELSE c2 FI) / st ==> st'\n\t| E_WhileEnd : forall b1 st c1,\n\t\tbeval st b1 = false ->\n\t\t\t(WHILE b1 DO c1 END) / st ==> st\n\t| E_WhileLoop : forall st st' st'' b1 c1,\n\t\tbeval st b1 = true ->\n\t\t\tc1 / st ==> st' ->\n\t\t\t\t(WHILE b1 DO c1 END) / st' ==> st'' ->\n\t\t\t\t\t(WHILE b1 DO c1 END) / st ==> st''\n\t\n\twhere \"c1 '/' st '==>' st'\" := (ceval c1 st st').\n\nTactic Notation \"ceval_cases\" tactic(first) ident(c) :=\n\tfirst;\n\t[ Case_aux c \"E_Skip\" | Case_aux c \"E_Ass\" | Case_aux c \"E_Seq\"\n\t\t| Case_aux c \"E_IfTrue\" | Case_aux c \"E_IfFalse\"\n\t\t| Case_aux c \"E_WhileEnd\" | Case_aux c \"E_WhileLoop\" ].\n\nExample ceval_example1 :\n\t(X ::= ANum 2;\n\t IFB BLe (AId X) (ANum 1)\n\t \tTHEN Y ::= ANum 3\n\t\tELSE Z ::= ANum 4\n\tFI)\n\t/ empty_state ==> (update (update empty_state X 2) Z 4).\nProof.\n(* We must supply the intermediate state *)\n\tapply E_Seq with (update empty_state X 2).\n\tCase \"assignment command\".\n\tapply E_Ass. reflexivity.\n\tCase \"if command\".\n\tapply E_IfFalse.\n\treflexivity.\n\tapply E_Ass. reflexivity. Qed.\n\nExample ceval_example2:\n\t(X ::= ANum 0; Y ::= ANum 1; Z ::= ANum 2) / empty_state ==>\n\t\t(update (update (update empty_state X 0) Y 1) Z 2).\nProof.\napply E_Seq with (update empty_state X 0);\ntry (apply E_Ass; reflexivity).\n\t \napply E_Seq with (update (update empty_state X 0) Y 1);\ntry (apply E_Ass; reflexivity).\nQed.\n\nTheorem ceval_step__ceval : forall c st st',\n\t\t\t\t(exists i, ceval_step st c i = Some st') ->\n\t\t\t\t\tc / st ==> st'.\nProof.\nintros c st st' H.\ninversion H as (i, E).\nclear H.\ngeneralize dependent st'.\ngeneralize dependent st.\ngeneralize dependent c.\ninduction i as [| i'].\n intros c st st' H.\n inversion H.\n \n intros c st st' H.\n com_cases (destruct c) SCase; simpl in H; inversion H; subst; clear H.\n apply E_Skip.\n \n apply E_Ass.\n reflexivity.\n \n remember (ceval_step st c1 i')as r1 in *.\n destruct r1.\n apply E_Seq with s.\n apply IHi'.\n rewrite Heqr1 in |- *.\n reflexivity.\n \n apply IHi'.\n simpl in H1.\n assumption.\n \n inversion H1.\n \n remember (beval st b)as r in *.\n destruct r.\n apply E_IfTrue.\n rewrite Heqr in |- *.\n reflexivity.\n \n apply IHi'.\n assumption.\n \n apply E_IfFalse.\n rewrite Heqr in |- *.\n reflexivity.\n \n apply IHi'.\n assumption.\n \n remember (beval st b)as r in *.\n destruct r.\n remember (ceval_step st c i')as r1 in *.\n destruct r1.\n apply E_WhileLoop with s.\n rewrite Heqr in |- *.\n reflexivity.\n \n apply IHi'.\n rewrite Heqr1 in |- *.\n reflexivity.\n \n apply IHi'.\n simpl in H1.\n assumption.\n \n inversion H1.\n \n inversion H1.\n apply E_WhileEnd.\n rewrite Heqr in |- *.\n subst.\n reflexivity.\nQed.\n\nTheorem ceval_step_more: forall i1 i2 st st' c,\n\ti1 <= i2 -> ceval_step st c i1 = Some st' ->\n\t\tceval_step st c i2 = Some st'.\nProof.\ninduction i1 as [| i1']; intros i2 st st' c Hle Hceval.\ninversion Hceval.\n\ndestruct i2 as [| i2'].\ninversion Hle.\n\nassert (i1' <= i2') as Hle' by complete omega.\ncom_cases (destruct c) SCase.\nSCase \"SKIP\".\nsimpl in Hceval.\ninversion Hceval.\nreflexivity.\n\nSCase \"::=\".\nsimpl in Hceval.\ninversion Hceval.\nreflexivity.\n\nSCase \";\".\nsimpl in Hceval.\nsimpl in |- *.\nremember (ceval_step st c1 i1')as st1'o in *.\ndestruct st1'o.\nSSCase \"st1'o = Some\".\nsymmetry in Heqst1'o.\napply (IHi1' i2') in Heqst1'o; try assumption.\nrewrite Heqst1'o in |- *.\nsimpl in |- *.\nsimpl in Hceval.\napply (IHi1' i2') in Hceval; try assumption.\n\ninversion Hceval.\n\nSCase \"IFB\".\nsimpl in Hceval.\nsimpl in |- *.\nremember (beval st b)as bval in *.\ndestruct bval; apply (IHi1' i2') in Hceval; assumption.\n\nSCase \"WHILE\".\nsimpl in Hceval.\nsimpl in |- *.\ndestruct (beval st b); try assumption.\nremember (ceval_step st c i1')as st1'o in *.\ndestruct st1'o.\nSSCase \"st1'o = Some\".\nsymmetry in Heqst1'o.\napply (IHi1' i2') in Heqst1'o; try assumption.\nrewrite Heqst1'o in |- *.\nsimpl in |- *.\nsimpl in Hceval.\napply (IHi1' i2') in Hceval; try assumption.\n\nSSCase \"i1'o = None\".\nsimpl in Hceval.\ninversion Hceval.\nQed.\n\nTheorem ceval__ceval_step : forall c st st',\n\t\t\t\tc / st ==> st' ->\n\t\t\t\t\texists i, ceval_step st c i = Some st'.\nProof.\n\tintros c st st' Hce.\n\tceval_cases (induction Hce) Case.\n\texists 1%nat.\n\tsimpl in |- *.\n\treflexivity.\n\n\tsimpl in |- *.\n\texists 1%nat.\n\tsimpl in |- *.\n\trewrite H in |- *.\n\treflexivity.\n\tinversion IHHce1 as (x1).\n\tinversion IHHce2 as (x2).\n\texists (S (x1 + x2)).\n\tsimpl in |- *.\n\tassert (ceval_step st c1 (x1 + x2) = Some st').\n\tapply ceval_step_more with x1.\n\tomega.\n\n\tassumption.\n\n\trewrite H1 in |- *.\n\tsimpl in |- *.\n\tapply ceval_step_more with x2.\n\tomega.\n\n\tassumption.\n\n\tinversion IHHce.\n\texists (S x).\n\tsimpl in |- *.\n\tsimpl in |- *.\n\trewrite H in |- *.\n\tapply H0.\n\n\tinversion IHHce.\n\texists (S x).\n\tsimpl in |- *.\n\tsimpl in |- *.\n\trewrite H in |- *.\n\tassumption.\n\n\texists 1%nat.\n\tsimpl in |- *.\n\trewrite H in |- *.\n\treflexivity.\n\n\tinversion IHHce1.\n\tsimpl in |- *.\n\tinversion IHHce2.\n\texists (S (x + x0)).\n\tsimpl in |- *.\n\tsimpl in |- *.\n\trewrite H in |- *.\n\tassert (ceval_step st c1 (x + x0) = Some st').\n\tapply ceval_step_more with x.\n\tomega.\n\n\tassumption.\n\n\trewrite H2 in |- *.\n\tsimpl in |- *.\n\tapply ceval_step_more with x0.\n\tomega.\n\n\tassumption.\nQed.\n\nTheorem ceval_and_ceval_step_coincide: forall c st st',\n\t\t\t\tc / st ==> st' <-> exists i, ceval_step st c i = Some st'.\nProof.\n\tintros c st st'.\n\tsplit. apply ceval__ceval_step. apply ceval_step__ceval.\nQed.\n\nTheorem ceval_deterministic : forall c st st1 st2,\n\tc / st ==> st1 ->\n\t\tc / st ==> st2 ->\n\t\t\tst1 = st2.\nProof.\nintros c st st1 st2 He1 He2.\napply ceval__ceval_step in He1.\napply ceval__ceval_step in He2.\ninversion He1 as (i1, E1).\ninversion He2 as (i2, E2).\napply ceval_step_more with (i2 := i1 + i2) in E1.\napply ceval_step_more with (i2 := i1 + i2) in E2.\nrewrite E1 in E2.\ninversion E2.\nreflexivity.\n\nomega.\n\nomega.\nQed.\n\nTheorem plus2_spec : forall st n st',\n\tst X = n ->\n\t\tplus2 / st ==> st' ->\n\t\t\tst' X = n + 2.\nProof.\nintros st n st' HX Heval.\ninversion Heval.\nsubst.\napply update_eq.\nQed.\n\n\nTheorem XtimesYinZ_spec : forall st nx ny st',\n\t\tst X = nx ->\n\t\t\tst Y = ny ->\n\t\t\t\tXtimesYinZ / st ==> st' ->\n\t\t\t\t\tst' Z = nx * ny.\nProof.\nintros st nx ny st' H1 H2 Heval.\ninversion Heval.\nsubst. simpl.\napply update_eq.\nQed.\n\nTheorem loop_never_stops : forall st st',\n\t~(loop / st ==> st').\nProof.\n\tintros st st' contra. unfold loop in contra.\n\tremember (WHILE BTrue DO SKIP END) as loopdef.\n\tinduction contra.\n\tsimpl in Heqloopdef.\n\tinversion Heqloopdef.\n\n\tinversion Heqloopdef.\n\n\tinversion Heqloopdef.\n\n\tinversion Heqloopdef.\n\n\tinversion Heqloopdef.\n\n\tinversion Heqloopdef.\n\tsubst.\n\tsimpl in H.\n\tinversion H.\n\n\tinversion Heqloopdef.\n\tsubst.\n\tinversion contra1.\n\tsubst.\n\tapply IHcontra2.\n\treflexivity.\nQed.\n\nFixpoint no_whiles (c : com) : bool :=\n\tmatch c with\n\t\t| SKIP => true\n\t\t| _ ::= _ => true\n\t\t| c1 ; c2 => andb (no_whiles c1) (no_whiles c2)\n\t\t| IFB _ THEN ct ELSE cf FI => andb (no_whiles ct) (no_whiles cf)\n\t\t| WHILE _ DO _ END => false\n\tend.\n\nInductive no_Whiles : com -> Prop :=\n\t| noWhilesSKIP : no_Whiles (SKIP)\n\t| noWhilesAss : forall a1 a2, no_Whiles (a1 ::= a2)\n\t| noWhilesSeq : forall (a1 a2 : com), no_Whiles a1 -> no_Whiles a2 -> no_Whiles (a1 ; a2)\n\t| noWhilesIf : forall (b : bexp) (a1 a2 : com),\n\t\t\t\t\t\t\t\t\t\tno_Whiles a1 -> no_Whiles a2 ->\n\t\t\t\t\t\t\t\t\t\t\t\tno_Whiles (IFB b THEN a1 ELSE a2 FI).\n\nTheorem no_whiles_eqv:\n\tforall c, no_whiles c = true <-> no_Whiles c.\nProof.\nsplit.\ninduction c.\nintros H.\napply noWhilesSKIP.\n\nsimpl in |- *.\nintros H.\napply noWhilesAss.\n\nintros H.\napply noWhilesSeq.\napply IHc1.\nsimpl in H.\nsimpl in H.\nauto.\neauto .\napply andb_true_elim1 in H.\napply H.\n\napply IHc2.\nsimpl in H.\napply andb_true_elim2 in H.\nassumption.\n\nsimpl in |- *.\nintros H.\napply noWhilesIf.\napply andb_true_elim1 in H.\napply IHc1.\nassumption.\n\napply IHc2.\napply andb_true_elim2 in H.\nassumption.\n\nsimpl in |- *.\nintros contra.\ninversion contra.\n\nintros H.\ninduction H.\nsimpl in |- *.\nreflexivity.\n\nreflexivity.\n\nsimpl in |- *.\nassert (no_whiles a1 = true /\\ no_whiles a2 = true).\nsplit.\nassumption.\n\nassumption.\n\neauto .\nauto.\napply andb_true_intro.\napply H1.\n\nsimpl in |- *.\nassert (no_whiles a1 = true /\\ no_whiles a2 = true).\nsplit.\nassumption.\n\nassumption.\n\napply andb_true_intro.\nassumption.\nQed.\n\nTheorem no_whiles_terminate : forall (c : com) (st:state),\n\tno_whiles c = true ->\n\t\texists i, exists st', ceval_step st c i = Some st'.\nProof.\ninduction c.\nintros st.\nsimpl in |- *.\nintros H.\nexists 1%nat.\nexists st.\nreflexivity.\n\nsimpl in |- *.\nintros st.\nintros H.\nexists 1%nat.\nsimpl in |- *.\nexists (update st i (aeval st a)).\nreflexivity.\n\nintros st.\nintros H.\ninversion H.\nassert (no_whiles c1 = true).\napply andb_true_elim1 in H1.\nassumption.\n\nassert (no_whiles c2 = true).\napply andb_true_elim2 in H1.\nassumption.\n\napply IHc1 with st in H0.\ninversion H0.\ninversion H3.\napply IHc2 with x0 in H2.\ninversion H2.\ninversion H5.\nexists (S (x + x1)).\nexists x2.\nsimpl in |- *.\nremember (ceval_step st c1 (x + x1))as r in *.\ndestruct r.\nsymmetry in Heqr.\nassert (x <= x + x1).\nomega.\n\nsimpl in |- *.\napply ceval_step_more with x1.\nomega.\n\napply ceval_step_more with (i2 := x + x1) in H4.\nassert (Some x0 = Some s).\nauto.\neauto .\nrewrite <- Heqr in |- *.\nrewrite <- H4 in |- *.\nreflexivity.\n\ninversion H8.\nrewrite <- H10 in |- *.\nassumption.\n\nomega.\n\nsimpl in |- *.\nassert (x <= x + x1).\nomega.\n\napply ceval_step_more with (i2 := x + x1) in H4.\nrewrite H4 in Heqr.\ninversion Heqr.\n\nomega.\n\nintros st.\nsimpl in |- *.\nintros H1.\nsimpl in |- *.\nassert (no_whiles c1 = true).\napply andb_true_elim1 in H1.\nassumption.\n\nassert (no_whiles c2 = true).\napply andb_true_elim2 in H1.\nassumption.\n\napply IHc1 with st in H.\napply IHc2 with st in H0.\ninversion H.\ninversion H0.\nexists (S (x + x0)).\nsimpl in |- *.\ndestruct (beval st b).\ninversion H2.\nexists x1.\napply ceval_step_more with x.\nomega.\n\nassumption.\n\ninversion H3.\nexists x1.\napply ceval_step_more with x0.\nomega.\n\nassumption.\n\nintros st H.\ninversion H.\nQed.\n\nFixpoint beval_short_circuit (st : state) (e: bexp) : bool :=\n\tmatch e with\n\t\t| BTrue => true\n\t\t| BFalse => false\n\t\t| BEq a1 a2 => beq_nat (aeval st a1) (aeval st a2)\n\t\t| BLe a1 a2 => ble_nat (aeval st a1) (aeval st a2)\n\t\t| BNot b1 => negb (beval_short_circuit st b1)\n\t\t| BAnd b1 b2 => match (beval_short_circuit st b1) with\n\t\t\t\t\t\t\t\t\t\t\t| true => (beval st b2)\n\t\t\t\t\t\t\t\t\t\t\t| false => false\n\t\t\t\t\t\t\t\t\t end\n\tend.\n\nTheorem beval_short_circuit_eqv : forall (e : bexp) (st : state),\n\tbeval st e = beval_short_circuit st e.\nProof.\ninduction e.\nintros st.\nsimpl in |- *.\nreflexivity.\n\nreflexivity.\n\nsimpl in |- *.\nreflexivity.\n\nreflexivity.\n\nintros st.\nsimpl in |- *.\nrewrite IHe in |- *.\nreflexivity.\n\nsimpl in |- *.\nintros st.\nrewrite IHe1 in |- *.\nrewrite IHe2 in |- *.\ndestruct (beval_short_circuit st e1).\nsimpl in |- *.\nreflexivity.\n\nreflexivity.\nQed.\n\t\t\nInductive sinstr : Type :=\n\t| SPush : nat -> sinstr\n\t| SLoad : id -> sinstr\n\t| SPlus : sinstr\n\t| SMinus : sinstr\n\t| SMult : sinstr.\n\nFixpoint s_execute (st : state) (stack : list nat) (prog : list sinstr)\n\t\t: list nat :=\nmatch ( prog ) with\n| [] =>stack\n|a :: l\n => match (a) with\n | SPush n => s_execute st (cons n stack) l\n | SLoad i => s_execute st (cons (st i) stack) l\n | SPlus => match stack with\n |[]=>nil\n |a :: al'=> match al' with\n |[]=>nil\n |b :: bl'=>s_execute st (cons (a+b) bl') l\n end\n end\n | SMinus => match stack with \n |[]=>nil\n |a :: al'=> match al' with\n |[]=>nil\n |b :: bl'=>s_execute st (cons (b-a) bl') l\n end\n end\n | SMult => match stack with \n |[]=>nil\n |a :: al'=> match al' with\n |[]=>nil\n |b :: bl'=>s_execute st (cons (a*b) bl') l\n end\n end \n end\nend.\n\nExample s_execute1 :\n\ts_execute empty_state [] [SPush 5, SPush 3, SPush 1, SMinus] = [2, 5].\nProof. reflexivity. Qed.\n\nExample s_execute2:\n\ts_execute (update empty_state X 3) [3,4] [SPush 4, SLoad X, SMult, SPlus ]\n\t\t= [15, 4].\nProof. reflexivity. Qed.\n\nFixpoint s_compile (e : aexp) : list sinstr :=\n\tmatch e with\n\t\t| ANum v => [SPush v]\n\t\t| AId i => [SLoad i]\n\t\t| APlus a1 a2 => (s_compile a1) ++ (s_compile a2) ++ [SPlus]\n\t\t| AMinus a1 a2 => (s_compile a1) ++ (s_compile a2) ++ [SMinus]\n\t\t| AMult a1 a2 => (s_compile a1) ++ (s_compile a2) ++ [SMult]\n\tend.\n\nExample s_compile1 :\n\ts_compile (AMinus (AId X) (AMult (ANum 2) (AId Y))) =\n\t\t[SLoad X, SPush 2, SLoad Y, SMult, SMinus].\nProof. reflexivity. Qed.\n\nTheorem execute_theorem : forall (e : aexp) (st : state) (s1 : list nat) (other : list sinstr),\n\t\ts_execute st s1 (s_compile e ++ other) =\n\t\t\t\ts_execute st ((aeval st e) :: s1) other.\nProof.\ninduction e; try reflexivity.\nsimpl in |- *.\nintros st s1 other.\nassert\n((s_compile e1 ++ s_compile e2 ++ [SPlus]) ++ other =\n s_compile e1 ++ s_compile e2 ++ [SPlus] ++ other).\nrewrite -> app_ass.\nrewrite -> app_ass.\nreflexivity.\n\nrewrite H in |- *.\nassert\n(s_execute st s1 (s_compile e1 ++ s_compile e2 ++ SPlus :: other) =\n s_execute st (aeval st e1 :: s1) (s_compile e2 ++ SPlus :: other)).\napply IHe1.\n\nsimpl in |- *.\nrewrite H0 in |- *.\nassert\n(s_execute st (aeval st e1 :: s1) (s_compile e2 ++ SPlus :: other) =\n s_execute st (aeval st e2 :: aeval st e1 :: s1) (SPlus :: other)).\napply IHe2.\n\nrewrite H1 in |- *.\nsimpl in |- *.\nrewrite plus_comm in |- *.\nreflexivity.\n\nintros st s1 other.\nassert\n(s_execute st s1 (s_compile e1 ++ s_compile e2 ++ SMinus :: other) =\n s_execute st (aeval st e1 :: s1) (s_compile e2 ++ SMinus :: other)).\napply IHe1.\n\nsimpl in |- *.\nassert\n((s_compile e1 ++ s_compile e2 ++ [SMinus]) ++ other =\n s_compile e1 ++ s_compile e2 ++ [SMinus] ++ other).\nrewrite -> app_ass.\nrewrite -> app_ass.\nreflexivity.\n\nsimpl in |- *.\nrewrite H0 in |- *.\nsimpl in |- *.\nrewrite H in |- *.\nassert\n(s_execute st (aeval st e1 :: s1) (s_compile e2 ++ SMinus :: other) =\n s_execute st (aeval st e2 :: aeval st e1 :: s1) (SMinus :: other)).\napply IHe2.\n\nrewrite H1 in |- *.\nsimpl in |- *.\nreflexivity.\n\nintros st s1 other.\nsimpl in |- *.\nsimpl in |- *.\nassert\n((s_compile e1 ++ s_compile e2 ++ [SMult]) ++ other =\n s_compile e1 ++ s_compile e2 ++ [SMult] ++ other).\nrewrite -> app_ass.\nrewrite -> app_ass.\nreflexivity.\n\nrewrite H in |- *.\nsimpl in |- *.\nassert\n(s_execute st s1 (s_compile e1 ++ s_compile e2 ++ SMult :: other) =\n s_execute st (aeval st e1 :: s1) (s_compile e2 ++ SMult :: other)).\napply IHe1.\n\nrewrite H0 in |- *.\nassert\n(s_execute st (aeval st e1 :: s1) (s_compile e2 ++ SMult :: other) =\n s_execute st (aeval st e2 :: aeval st e1 :: s1) (SMult :: other)).\napply IHe2.\n\nrewrite H1 in |- *.\nsimpl in |- *.\nrewrite mult_comm in |- *.\nreflexivity.\nQed.\n\nTheorem s_compile_correct : forall (st : state) (e : aexp),\n\t\t\t\ts_execute st [] (s_compile e) = [ aeval st e].\nProof.\nintros st e.\nassert ([aeval st e] = s_execute st [aeval st e] []).\nsimpl in |- *.\nreflexivity.\n\nrewrite H in |- *.\nassert (s_compile e ++ [] = s_compile e).\nsimpl in |- *.\nrewrite -> app_nil_end.\nreflexivity.\n\nrewrite <- H0 in |- *.\napply execute_theorem.\nQed.\n\n" }, { "path": "src/test/resources/samples/langs/Coq/JsCorrectness.v", "content": "Set Implicit Arguments.\nRequire Import Shared.\nRequire Import LibFix LibList.\nRequire Import JsSyntax JsSyntaxAux JsCommon JsCommonAux JsPreliminary.\nRequire Import JsInterpreterMonads JsInterpreter JsPrettyInterm JsPrettyRules.\n\nLtac tryfalse_nothing :=\n try match goal with x: nothing |- _ => destruct x end;\n tryfalse.\n\n(**************************************************************)\n(** ** Implicit Types -- copied from JsPreliminary *)\n\nImplicit Type b : bool.\nImplicit Type n : number.\nImplicit Type k : int.\nImplicit Type s : string.\nImplicit Type i : literal.\nImplicit Type l : object_loc.\nImplicit Type w : prim.\nImplicit Type v : value.\nImplicit Type r : ref.\nImplicit Type ty : type.\n\nImplicit Type rt : restype.\nImplicit Type rv : resvalue.\nImplicit Type lab : label.\nImplicit Type labs : label_set.\nImplicit Type R : res.\nImplicit Type o : out.\nImplicit Type ct : codetype.\n\nImplicit Type x : prop_name.\nImplicit Type str : strictness_flag.\nImplicit Type m : mutability.\nImplicit Type Ad : attributes_data.\nImplicit Type Aa : attributes_accessor.\nImplicit Type A : attributes.\nImplicit Type Desc : descriptor.\nImplicit Type D : full_descriptor.\n\nImplicit Type L : env_loc.\nImplicit Type E : env_record.\nImplicit Type Ed : decl_env_record.\nImplicit Type X : lexical_env.\nImplicit Type O : object.\nImplicit Type S : state.\nImplicit Type C : execution_ctx.\nImplicit Type P : object_properties_type.\nImplicit Type W : result.\n\nImplicit Type e : expr.\nImplicit Type p : prog.\nImplicit Type t : stat.\n\nImplicit Type T : Type.\n\n\n(**************************************************************)\n(** Correctness Properties *)\n\nRecord runs_type_correct runs :=\n make_runs_type_correct {\n runs_type_correct_expr : forall S C e o,\n runs_type_expr runs S C e = o ->\n red_expr S C (expr_basic e) o;\n runs_type_correct_stat : forall S C t o,\n runs_type_stat runs S C t = o ->\n red_stat S C (stat_basic t) o;\n runs_type_correct_prog : forall S C p o,\n runs_type_prog runs S C p = o ->\n red_prog S C (prog_basic p) o;\n\n runs_type_correct_call : forall S C l v vs o,\n runs_type_call runs S C l v vs = o ->\n red_expr S C (spec_call l v vs) o;\n\n runs_type_correct_call_prealloc : forall S C l B args o,\n runs_type_call_prealloc runs S C B l args = result_some (specret_out o) ->\n red_expr S C (spec_call_prealloc B l args) o;\n\n runs_type_correct_construct : forall S C co l args o, \n runs_type_construct runs S C co l args = o ->\n red_expr S C (spec_construct_1 co l args) o;\n\n runs_type_correct_function_has_instance : forall S C (lo lv : object_loc) o,\n runs_type_function_has_instance runs S lo lv = o ->\n red_expr S C (spec_function_has_instance_2 lv lo) o;\n\n runs_type_correct_get_args_for_apply : forall S C array (index n : int) y,\n runs_type_get_args_for_apply runs S C array index n = result_some y ->\n red_spec S C (spec_function_proto_apply_get_args array index n) y;\n\n runs_type_correct_object_has_instance : forall S C B l v o,\n runs_type_object_has_instance runs S C B l v = result_some (specret_out o) ->\n red_expr S C (spec_object_has_instance_1 B l v) o;\n\n runs_type_correct_stat_while : forall S C rv ls e t o,\n runs_type_stat_while runs S C rv ls e t = o ->\n red_stat S C (stat_while_1 ls e t rv) o;\n runs_type_correct_stat_do_while : forall S C rv ls e t o,\n runs_type_stat_do_while runs S C rv ls e t = o ->\n red_stat S C (stat_do_while_1 ls t e rv) o;\n runs_type_correct_stat_for_loop : forall S C labs rv eo2 eo3 t o,\n runs_type_stat_for_loop runs S C labs rv eo2 eo3 t = o ->\n red_stat S C (stat_for_2 labs rv eo2 eo3 t) o;\n runs_type_correct_object_delete : forall S C l x str o,\n runs_type_object_delete runs S C l x str = o ->\n red_expr S C (spec_object_delete l x str) o;\n runs_type_correct_object_get_own_prop : forall S C l x sp,\n runs_type_object_get_own_prop runs S C l x = result_some sp ->\n red_spec S C (spec_object_get_own_prop l x) sp;\n runs_type_correct_object_get_prop : forall S C l x sp,\n runs_type_object_get_prop runs S C l x = result_some sp ->\n red_spec S C (spec_object_get_prop l x) sp;\n runs_type_correct_object_get : forall S C l x o,\n runs_type_object_get runs S C l x = o ->\n red_expr S C (spec_object_get l x) o;\n runs_type_correct_object_proto_is_prototype_of : forall S C lthis l o,\n runs_type_object_proto_is_prototype_of runs S lthis l = o ->\n red_expr S C (spec_call_object_proto_is_prototype_of_2_3 lthis l) o;\n runs_type_correct_object_put : forall S C l x v str o,\n runs_type_object_put runs S C l x v str = o ->\n red_expr S C (spec_object_put l x v str) o;\n runs_type_correct_equal : forall S C v1 v2 o,\n runs_type_equal runs S C v1 v2 = o ->\n red_expr S C (spec_equal v1 v2) o;\n runs_type_correct_to_integer : forall S C v o,\n runs_type_to_integer runs S C v = o ->\n red_expr S C (spec_to_integer v) o;\n runs_type_correct_to_string : forall S C v o,\n runs_type_to_string runs S C v = o ->\n red_expr S C (spec_to_string v) o;\n\n (* ARRAYS *)\n runs_type_correct_array_element_list : forall S C l oes o k,\n runs_type_array_element_list runs S C l oes k = o ->\n red_expr S C (expr_array_3 l oes k) o;\n\n runs_type_correct_object_define_own_prop_array_loop : \n forall S C l newLen oldLen newLenDesc newWritable throw o \n (def : state -> prop_name -> descriptor -> strictness_flag -> specres nothing) \n (def_correct : forall S str o x Desc,\n def S x Desc str = res_out o ->\n red_expr S C (spec_object_define_own_prop_1 builtin_define_own_prop_default l x Desc str) o),\n runs_type_object_define_own_prop_array_loop runs S C l newLen oldLen newLenDesc newWritable throw def = o -> \n red_expr S C (spec_object_define_own_prop_array_3l l newLen oldLen newLenDesc newWritable throw) o;\n\n runs_type_correct_array_join_elements : forall S C l k length sep s o, \n runs_type_array_join_elements runs S C l k length sep s = result_some (specret_out o) ->\n red_expr S C (spec_call_array_proto_join_elements l k length sep s) o\n }.\n\n\n(**************************************************************)\n(** Useful Tactics *)\n\nLtac absurd_neg :=\n let H := fresh in\n introv H; inverts H; tryfalse.\n\nHint Constructors abort.\n\n\n(**************************************************************)\n(** General Lemmas *)\n\nLemma arguments_from_spec_1 : forall args,\n exists v, arguments_from args (v::nil)\n /\\ get_arg 0 args = v.\nProof.\n Hint Constructors arguments_from.\n intros. destruct args as [|v vs].\n exists undef. splits*.\n exists v. splits*.\nQed.\n\n\nLemma res_overwrite_value_if_empty_empty : forall R,\n res_overwrite_value_if_empty resvalue_empty R = R.\nProof. introv. unfolds. cases_if~. destruct R; simpls; inverts~ e. Qed.\n\nLemma res_type_res_overwrite_value_if_empty : forall rv R,\n res_type R = res_type (res_overwrite_value_if_empty rv R).\nProof.\n introv. destruct R. unfold res_overwrite_value_if_empty. simpl.\n cases_if; reflexivity.\nQed.\n\nLemma res_label_res_overwrite_value_if_empty : forall rv R,\n res_label R = res_label (res_overwrite_value_if_empty rv R).\nProof.\n introv. destruct R. unfold res_overwrite_value_if_empty. simpl.\n cases_if; reflexivity.\nQed.\n\nLemma res_overwrite_value_if_empty_resvalue : forall rv1 rv2, exists rv3,\n res_normal rv3 = res_overwrite_value_if_empty rv1 rv2 /\\ (rv3 = rv1 \\/ rv3 = rv2).\nProof. introv. unfolds res_overwrite_value_if_empty. cases_if*. Qed.\n\n\nLemma get_arg_correct : forall args vs,\n arguments_from args vs ->\n forall num,\n num < length vs ->\n get_arg num args = LibList.nth num vs.\nProof.\n introv A. induction~ A.\n introv I. false I. lets (I'&_): (rm I). inverts~ I'.\n introv I. destruct* num. rewrite nth_succ. rewrite <- IHA.\n unfolds. repeat rewrite~ nth_def_nil.\n rewrite length_cons in I. nat_math.\n introv I. destruct* num. rewrite nth_succ. rewrite <- IHA.\n unfolds. rewrite~ nth_def_succ.\n rewrite length_cons in I. nat_math.\nQed.\n\nLemma get_arg_correct_0 : forall args,\n arguments_from args (get_arg 0 args :: nil).\nProof. introv. destruct args; do 2 constructors. Qed.\n\nLemma get_arg_correct_1 : forall args,\n arguments_from args (get_arg 0 args :: get_arg 1 args :: nil).\nProof. introv. destruct args as [|? [|? ?]]; do 3 constructors. Qed.\n\nLemma get_arg_correct_2 : forall args,\n arguments_from args (get_arg 0 args :: get_arg 1 args :: get_arg 2 args :: nil).\nProof. introv. destruct args as [|? [|? [|? ?]]]; do 4 constructors. Qed.\n\nLemma get_arg_first_and_rest_correct : forall args v lv,\n (v, lv) = get_arg_first_and_rest args <-> \n arguments_first_and_rest args (v, lv).\nProof.\n induction args; introv; splits; introv Hyp; \n unfolds get_arg_first_and_rest; unfolds get_arg; \n simpls; inverts~ Hyp.\nQed.\n\nLemma and_impl_left : forall P1 P2 P3 : Prop,\n (P1 -> P2) ->\n P1 /\\ P3 ->\n P2 /\\ P3.\nProof. auto*. Qed.\n\nLtac applys_and_base L :=\n applys~ and_impl_left; [applys~ L|]; try reflexivity.\n\nTactic Notation \"applys_and\" constr(E) :=\n applys_and_base (>> E).\n\nTactic Notation \"applys_and\" constr(E) constr(A1) :=\n applys_and_base (>> E A1).\n\nTactic Notation \"applys_and\" constr(E) constr(A1) constr(A2) :=\n applys_and_base (>> E A1 A2).\n\nTactic Notation \"applys_and\" constr(E) constr(A1) constr(A2) constr(A3) :=\n applys_and_base (>> E A1 A2 A3).\n\nLtac constructors_and :=\n let H := fresh in\n eapply and_impl_left; [ intro H; constructors; exact H |].\n\n\nLemma run_callable_correct : forall S v co,\n run_callable S v = Some co ->\n callable S v co.\nProof.\n introv E. destruct v; simpls~.\n inverts~ E.\n sets_eq <- B: (pick_option (object_binds S o)). destruct B; simpls; tryfalse.\n exists o0. splits~. forwards~: @pick_option_correct EQB. inverts~ E.\nQed.\n\n\n(**************************************************************)\n(** Monadic Constructors, Lemmas *)\n\n(* Shared defs *)\n\n(** [eqabort o1 o] assert that [o1] and [o] are equal\n and satisfy the [abort] predicate. *)\n\nDefinition eqabort o1 o :=\n o = o1 /\\ abort o.\n\nLtac prove_abort :=\n solve [ assumption | (constructor; absurd_neg) ].\n\n(** [isout W Pred] asserts that [W] is in fact\n an outcome that satisfies [Pred]. *)\n\nDefinition isout W (Pred:out->Prop) :=\n exists o1, W = res_out o1 /\\ Pred o1.\n\nHint Unfold isout.\nHint Unfold eqabort.\n\n(* Generic *)\n\nLemma if_empty_label_out : forall T K S R (o : T),\n if_empty_label S R K = result_some o ->\n res_label R = label_empty /\\ K tt = result_some o.\nProof. introv H. unfolds in H. cases_if; tryfalse. eexists; auto*. Qed.\n\nLemma if_some_out : forall (A B : Type) (oa : option A) K (b : B),\n if_some oa K = result_some b ->\n exists (a:A), oa = Some a /\\ K a = result_some b.\nProof. introv E. destruct* oa; tryfalse. Qed.\n\nLemma if_result_some_out : forall (A B : Type) (W : resultof A) K (b : B),\n if_result_some W K = result_some b ->\n exists (y : A), W = result_some y /\\ K y = result_some b.\nProof. introv H. destruct* W; tryfalse. Qed.\n\nLemma if_some_or_default_out : forall (A B : Type) (oa : option A) d K (b : B),\n if_some_or_default oa d K = b ->\n (oa = None /\\ d = b)\n \\/ (exists a, oa = Some a /\\ K a = b).\nProof. introv E. destruct* oa; tryfalse. Qed.\n\n\n(* Results *)\n\nDefinition if_ter_post (K : _ -> _ -> result) o o1 :=\n (o1 = out_div /\\ o = o1)\n \\/ (exists S R, o1 = out_ter S R /\\ K S R = o).\n\nLemma if_ter_out : forall W K o,\n if_ter W K = res_out o ->\n isout W (if_ter_post K o).\nProof.\n introv H. destruct W as [[|o1]| | | ]; simpls; tryfalse_nothing.\n exists o1. splits~. unfolds. destruct o1 as [|S R].\n inverts* H.\n jauto.\nQed.\n\nDefinition if_success_state_post rv0 (K : _ -> _ -> result) o o1 :=\n (o1 = out_div /\\ o = o1) \\/\n (exists S R, o1 = out_ter S R /\\ res_type R = restype_throw /\\ o = out_ter S R) \\/\n (exists S R, o1 = out_ter S R /\\ res_type R <> restype_throw /\\\n res_type R <> restype_normal /\\ o = out_ter S (res_overwrite_value_if_empty rv0 R)) \\/\n exists S rv, o1 = out_ter S (res_normal rv) /\\\n K S (ifb rv = resvalue_empty then rv0 else rv) = res_out o.\n\nLemma if_success_state_out : forall rv W K o,\n if_success_state rv W K = o ->\n isout W (if_success_state_post rv K o).\nProof.\n introv E. forwards~ (o1&WE&P): if_ter_out (rm E). subst W. eexists. splits*.\n inversion_clear P as [?|(S&R&?&H)]. branch~ 1.\n substs. destruct R as [rt rv' rl]. destruct~ rt; simpls;\n try solve [branch 3; repeat eexists; [discriminate | discriminate | inverts~ H]].\n forwards~ (?&?): if_empty_label_out (rm H). simpls. substs.\n branch 4. repeat eexists. auto*.\n inverts H. branch 2. repeat eexists.\nQed.\n\nDefinition if_success_post (K : _ -> _ -> result) o o1 :=\n eqabort o1 o \\/\n exists S rv, o1 = out_ter S (res_normal rv) /\\ K S rv = o.\n\nLemma if_success_out : forall W K o,\n if_success W K = res_out o ->\n isout W (if_success_post K o).\nProof.\n introv E. forwards~ (o1&WE&P): if_ter_out (rm E). subst W. eexists. splits*.\n inversion_clear P as [[? ?]|(S&R&?&H)]. substs. branch~ 1.\n substs. destruct R as [rt rv' rl]. destruct~ rt; simpls;\n try solve [inverts H; branch 1; splits~; prove_abort].\n forwards~ (?&?): if_empty_label_out (rm H). simpls. substs.\n branch 2. repeat eexists. auto*.\nQed.\n\n (* Documentation: same with unfolding:\n Lemma if_success_out : forall W K o,\n if_success W K = o ->\n exists o1, W = res_out o1 /\\\n ( (o = o1 /\\ abort o)\n \\/ (exists S rv, o1 = out_ter S rv /\\ K S rv = o)).\n *)\n\nDefinition if_void_post (K : _ -> result) o o1 :=\n eqabort o1 o \\/\n exists S, o1 = out_void S /\\ K S = o.\n\nLemma if_void_out : forall W K o,\n if_void W K = o ->\n isout W (if_void_post K o).\nProof.\n introv E. unfolds in E.\n forwards~ (o1&WE&P): if_success_out (rm E). exists o1. split~.\n unfolds. unfolds in P.\n inversion_clear P as [[? ?]|(S&R&?&?)]; subst; [ left* | right ].\n exists S. destruct R; tryfalse. auto.\nAdmitted. (*faster*)\n\n(* if_not_throw *)\n\nDefinition if_not_throw_post (K : _ -> _ -> result) o o1 :=\n eqabort o1 o \\/\n (exists S R, o1 = out_ter S R /\\\n ((res_type R <> restype_throw /\\ K S R = o) \\/\n (res_type R = restype_throw /\\ o = o1))).\n\nHint Extern 1 (_ <> _ :> restype) => congruence.\n\nLemma if_not_throw_out : forall W K o,\n if_not_throw W K = o -> \n isout W (if_not_throw_post K o).\nProof.\n introv E. unfolds in E.\n forwards~ (o1 & WE & P): if_ter_out (rm E).\n exists o1. split~.\n unfolds. unfolds in P.\n\n inversion_clear P as [[? ?] | (S & R & ? & ?)]. branch~ 1.\n splits~. substs~.\n right. exists S R; splits~.\n destruct (res_type R); try solve [left; splits~; discriminate].\n right; splits~. subst. inverts~ H0.\nQed.\n\nDefinition if_any_or_throw_post (K1 K2 : _ -> _ -> result) o o1 :=\n (o1 = out_div /\\ o = o1) \\/\n (exists S R, o1 = out_ter S R /\\\n ( (res_type R <> restype_throw /\\ K1 S R = o)\n \\/ (res_type R = restype_throw /\\ exists (v : value), res_value R = v\n /\\ res_label R = label_empty /\\ K2 S v = o))). (* Didn't worked when writing [exists (v : value), R = res_throw v]. *)\n\nLemma if_any_or_throw_out : forall W K1 K2 o,\n if_any_or_throw W K1 K2 = res_out o ->\n isout W (if_any_or_throw_post K1 K2 o).\nProof.\n introv E. unfolds in E.\n forwards~ (o1&WE&P): if_ter_out (rm E). exists o1. split~.\n unfolds. unfolds in P.\n inversion_clear P as [[? ?]|(S&R&?&?)]; subst; [ left* | right ].\n exists S R. split~. destruct (res_type R); tryfalse; simple*.\n right. destruct (res_value R); tryfalse; simple*. split*.\n forwards*: if_empty_label_out.\nAdmitted. (*faster*)\n\nDefinition if_success_or_return_post (K1 : state -> result) (K2 : state -> resvalue -> result) o o1 :=\n (o1 = out_div /\\ o = o1)\n \\/ exists S R, o1 = out_ter S R /\\\n ( (res_type R = restype_normal /\\ res_label R = label_empty /\\ K1 S = o)\n \\/ (res_type R = restype_return /\\ res_label R = label_empty /\\ K2 S (res_value R) = o)\n \\/ (res_type R <> restype_normal /\\ res_type R <> restype_return /\\ o1 = o)).\n\nLemma if_success_or_return_out : forall W (K1 : state -> result) (K2 : state -> resvalue -> result) o,\n if_success_or_return W K1 K2 = o ->\n isout W (if_success_or_return_post K1 K2 o).\nProof.\n introv E. unfolds in E.\n forwards~ (o1&WE&P): if_ter_out (rm E). exists o1. split~.\n unfolds. unfolds in P.\n inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].\n exists S R. split~. destruct (res_type R); tryfalse; simple*.\n branch 1. forwards*: if_empty_label_out.\n branch 3. inverts* E.\n branch 3. inverts* E.\n branch 2. forwards*: if_empty_label_out.\n branch 3. inverts* E.\nAdmitted. (*faster*)\n\n(* TODO: misssing\n if_normal_continue_or_break *)\n\nDefinition if_break_post (K : _ -> _ -> result) o o1 :=\n (o1 = out_div /\\ o = o1)\n \\/ (exists S R, o1 = out_ter S R /\\\n ( (res_type R <> restype_break /\\ o1 = o)\n \\/ (res_type R = restype_break /\\ K S R = o))).\n\nLemma if_break_out : forall W K o,\n if_break W K = o ->\n isout W (if_break_post K o).\nProof.\n introv E. unfolds in E.\n forwards~ (o1&WE&P): if_ter_out (rm E). exists o1. split~.\n unfolds. unfolds in P.\n inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].\n exists S R. split~. destruct (res_type R); try inverts E; simple*.\nAdmitted. (*faster*)\n\nDefinition if_value_post (K : _ -> _ -> result) o o1 :=\n eqabort o1 o \\/\n exists S v, o1 = out_ter S (res_val v) /\\ K S v = o.\n\nLemma if_value_out : forall W K o,\n if_value W K = res_out o ->\n isout W (if_value_post K o).\nProof.\n introv E. unfolds in E.\n forwards~ (o1&WE&P): if_success_out (rm E). exists o1. split~.\n unfolds. unfolds in P.\n inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].\n destruct R; tryfalse. exists___*.\nAdmitted. (*faster*)\n\nDefinition if_bool_post (K : _ -> _ -> result) o o1 :=\n eqabort o1 o \\/\n exists S z, o1 = out_ter S (res_val (prim_bool z)) /\\ K S z = o.\n\nLemma if_bool_out : forall W K o,\n if_bool W K = res_out o ->\n isout W (if_bool_post K o).\nProof.\n introv E. unfolds in E.\n forwards~ (o1&WE&P): if_value_out (rm E). exists o1. split~.\n unfolds. unfolds in P.\n inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].\n destruct R; tryfalse. destruct p; tryfalse. exists___*.\nAdmitted. (*faster*)\n\n\nDefinition if_object_post (K : _ -> _ -> result) o o1 :=\n eqabort o1 o \\/\n exists S l, o1 = out_ter S (res_val (value_object l)) /\\ K S l = o.\n\nLemma if_object_out : forall W K o,\n if_object W K = res_out o ->\n isout W (if_object_post K o).\nProof.\n introv E. unfolds in E.\n forwards~ (o1&WE&P): if_value_out (rm E). exists o1. split~.\n unfolds. unfolds in P.\n inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].\n destruct R; tryfalse. exists___*.\nAdmitted. (*faster*)\n\n\nDefinition if_string_post (K : _ -> _ -> result) o o1 :=\n eqabort o1 o \\/\n exists S s, o1 = out_ter S (res_val (prim_string s)) /\\ K S s = o.\n\nLemma if_string_out : forall W K o,\n if_string W K = res_out o ->\n isout W (if_string_post K o).\nProof.\n introv E. unfolds in E.\n forwards~ (o1&WE&P): if_value_out (rm E). exists o1. split~.\n unfolds. unfolds in P.\n inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].\n destruct R; tryfalse. destruct p; tryfalse. exists___*.\nAdmitted. (*faster*)\n\n\nDefinition if_number_post (K : _ -> _ -> result) o o1 :=\n eqabort o1 o \\/\n exists S n, o1 = out_ter S (res_val (prim_number n)) /\\ K S n = o.\n\nLemma if_number_out : forall W K o,\n if_number W K = res_out o ->\n isout W (if_number_post K o).\nProof.\n introv E. unfolds in E.\n forwards~ (o1 & WE & P): if_value_out (rm E). exists o1. split~.\n unfolds. unfolds in P.\n inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].\n destruct R; tryfalse. destruct p; tryfalse. exists___*.\nAdmitted. (*faster*)\n\nDefinition if_prim_post (K : _ -> _ -> result) o o1 :=\n eqabort o1 o \\/\n exists S w, o1 = out_ter S (res_val (value_prim w)) /\\ K S w = o.\n\nLemma if_prim_out : forall W K o,\n if_prim W K = res_out o ->\n isout W (if_prim_post K o).\nProof.\n introv E. unfolds in E.\n forwards~ (o1&WE&P): if_value_out (rm E). exists o1. split~.\n unfolds. unfolds in P.\n inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].\n destruct R; tryfalse. exists___*.\nAdmitted. (*faster*)\n\nLemma if_abort_out : forall T o K (t : T),\n if_abort o K = result_some t ->\n abort o /\\ K tt = result_some t.\nProof. introv H. destruct* o. simpls. cases_if*. Qed.\n\nDefinition if_spec_post (A B:Type) K (b:specret B) y :=\n (exists o, y = specret_out o /\\ b = specret_out o /\\ abort o)\n \\/ (exists (S:state) (a:A), y = specret_val S a /\\ K S a = result_some b).\n\nLemma if_spec_out : forall (A B : Type) (W : specres A) K (b : specret B),\n if_spec W K = result_some b ->\n exists y, W = result_some y /\\ if_spec_post K b y.\nProof.\n introv E. unfolds in E. unfolds in E.\n destruct W; tryfalse. exists s. split~.\n unfolds. destruct s; [ right | left ].\n exists___*.\n lets (?&H): if_abort_out E. inverts H. exists___*.\nAdmitted. (* faster *)\n\n\nDefinition if_ter_spec_post T K (y:specret T) o :=\n (y = specret_out o /\\ abort o)\n \\/ (exists S, exists (R : res), o = out_ter S R /\\ K S R = result_some y).\n\nLemma if_ter_spec : forall T W K (y : specret T),\n if_ter W K = result_some y ->\n isout W (if_ter_spec_post K y).\nProof.\n introv H. destruct W as [[|o1]| | | ]; simpls; tryfalse_nothing.\n exists o1. splits~. unfolds. destruct o1 as [|S R].\n inverts* H.\n jauto.\nQed.\n\nDefinition if_success_spec_post T K (y:specret T) o :=\n (y = specret_out o /\\ abort o)\n \\/ (exists S, exists (rv : resvalue), o = out_ter S rv /\\ K S rv = result_some y).\n\nLemma if_success_spec : forall T W K (y : specret T),\n if_success W K = result_some y ->\n exists (o : out), W = o /\\ if_success_spec_post K y o. (* LATER: Change to [isout] *)\nProof.\n introv E. forwards~ (o1&WE&P): if_ter_spec (rm E). subst W. eexists. splits*.\n inversion_clear P as [[? ?]|(S&R&?&H)]. substs. branch~ 1.\n substs. destruct R as [rt rv' rl]. destruct~ rt; simpls;\n try solve [inverts H; branch 1; splits~; prove_abort].\n forwards~ (?&?): if_empty_label_out (rm H). simpls. substs.\n branch 2. repeat eexists. auto*.\nQed.\n\nDefinition if_value_spec_post T K (y:specret T) o :=\n (y = specret_out o /\\ abort o)\n \\/ (exists S, exists (v : value), o = out_ter S v /\\ K S v = result_some y).\n\nLemma if_value_spec : forall T W K (y : specret T),\n if_value W K = result_some y ->\n exists (o : out), W = o /\\ if_value_spec_post K y o.\nProof.\n introv E. unfolds in E.\n forwards~ (o1&WE&P): if_success_spec (rm E). exists o1. split~.\n unfolds. unfolds in P.\n inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].\n destruct R; tryfalse. exists___*.\nAdmitted. (*faster*)\n\nDefinition if_prim_spec_post T K (y:specret T) o :=\n (y = specret_out o /\\ abort o)\n \\/ (exists S, exists (w : prim), o = out_ter S w /\\ K S w = result_some y).\n\nLemma if_prim_spec : forall T W K (y : specret T),\n if_prim W K = result_some y ->\n exists (o : out), W = o /\\ if_prim_spec_post K y o.\nProof.\n introv E. unfolds in E.\n forwards~ (o1&WE&P): if_value_spec (rm E). exists o1. split~.\n unfolds. unfolds in P.\n inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].\n destruct R; tryfalse. exists___*.\nAdmitted. (*faster*)\n\nDefinition if_bool_spec_post T K (y:specret T) o :=\n (y = specret_out o /\\ abort o)\n \\/ (exists S, exists (b : bool), o = out_ter S b /\\ K S b = result_some y).\n\nLemma if_bool_spec : forall T W K (y : specret T),\n if_bool W K = result_some y ->\n exists (o : out), W = o /\\ if_bool_spec_post K y o.\nProof.\n introv E. unfolds in E.\n forwards~ (o1&WE&P): if_value_spec (rm E). exists o1. split~.\n unfolds. unfolds in P.\n inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].\n destruct R; tryfalse. destruct p; tryfalse. exists___*.\nAdmitted. (*faster*)\n\nDefinition if_number_spec_post T K (y:specret T) o :=\n (y = specret_out o /\\ abort o)\n \\/ (exists S, exists (n : number), o = out_ter S n /\\ K S n = result_some y).\n\nLemma if_number_spec : forall T W K (y : specret T),\n if_number W K = result_some y ->\n exists (o : out), W = o /\\ if_number_spec_post K y o.\nProof.\n introv E. unfolds in E.\n forwards~ (o1&WE&P): if_value_spec (rm E). exists o1. split~.\n unfolds. unfolds in P.\n inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].\n destruct R; tryfalse. destruct p; tryfalse. exists___*.\nAdmitted. (*faster*)\n\nDefinition if_string_spec_post T K (y:specret T) o :=\n (y = specret_out o /\\ abort o)\n \\/ (exists S, exists (s : string), o = out_ter S s /\\ K S s = result_some y).\n\nLemma if_string_spec : forall T W K (y : specret T),\n if_string W K = result_some y ->\n exists (o : out), W = o /\\ if_string_spec_post K y o.\nProof.\n introv E. unfolds in E.\n forwards~ (o1&WE&P): if_value_spec (rm E). exists o1. split~.\n unfolds. unfolds in P.\n inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].\n destruct R; tryfalse. destruct p; tryfalse. exists___*.\nAdmitted. (*faster*)\n\nDefinition if_object_spec_post T K (y:specret T) o :=\n (y = specret_out o /\\ abort o)\n \\/ (exists S, exists (l : object_loc), o = out_ter S l /\\ K S l = result_some y).\n\nLemma if_object_spec : forall T W K (y : specret T),\n if_object W K = result_some y ->\n exists (o : out), W = o /\\ if_object_spec_post K y o.\nProof.\n introv E. unfolds in E.\n forwards~ (o1&WE&P): if_value_spec (rm E). exists o1. split~.\n unfolds. unfolds in P.\n inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].\n destruct R; tryfalse. exists___*.\nQed.\n\n\n(************************************************************)\n(* ** Correctness Tactics *)\n\n(** [prove_not_intercept] proves a goal of\n the form \"~ abort_intercepted_* _\" *)\n\nLtac prove_not_intercept :=\nlet H := fresh in intros H; try solve [ inversion H; false~ ].\n\nHint Extern 1 (~ abort_intercepted_expr _) => prove_not_intercept.\nHint Extern 1 (~ abort_intercepted_stat _) => prove_not_intercept.\nHint Extern 1 (~ abort_intercepted_prog _) => prove_not_intercept.\n\nLtac abort_tactic L :=\n try subst; apply L;\n [ simpl; congruence\n | try prove_abort\n | try prove_not_intercept ].\n\nTactic Notation \"abort_expr\" :=\n abort_tactic red_expr_abort.\nTactic Notation \"abort_stat\" :=\n abort_tactic red_stat_abort.\nTactic Notation \"abort_prog\" :=\n abort_tactic red_prog_abort.\nTactic Notation \"abort_spec\" :=\n abort_tactic red_spec_abort.\nTactic Notation \"abort\" :=\n match goal with\n | |- red_expr _ _ _ _ => abort_expr\n | |- red_stat _ _ _ _ => abort_stat\n | |- red_prog _ _ _ _ => abort_prog\n | |- red_spec _ _ _ _ => abort_spec\n end.\n\n(** [run_select_ifres] selects the appropriate \"out\" lemma *)\n\nLtac run_select_extra T := fail.\n\nLtac run_select_ifres H :=\n match type of H with ?T = _ => match T with\n | @if_ter nothing _ _ => constr:(if_ter_out)\n | @if_success nothing _ _ => constr:(if_success_out)\n | @if_value nothing _ _ => constr:(if_value_out)\n | @if_void nothing _ _ => constr:(if_void_out)\n | if_break _ _ => constr:(if_break_out)\n | @if_object nothing _ _ => constr:(if_object_out)\n | @if_bool nothing _ _ => constr:(if_bool_out)\n | @if_string nothing _ _ => constr:(if_string_out)\n | @if_number nothing _ _ => constr:(if_number_out)\n | @if_prim nothing _ _ => constr:(if_prim_out)\n | if_ter _ _ => constr:(if_ter_spec)\n | if_success _ _ => constr:(if_success_spec)\n | if_value _ _ => constr:(if_value_spec)\n | if_bool _ _ => constr:(if_bool_spec)\n | if_string _ _ => constr:(if_string_spec)\n | if_object _ _ => constr:(if_object_spec)\n | if_number _ _ => constr:(if_number_spec)\n | if_prim _ _ => constr:(if_prim_spec)\n | if_spec _ _ => constr:(if_spec_out)\n | if_void _ _ => constr:(if_void_out)\n | if_not_throw _ _ => constr:(if_not_throw_out)\n | if_any_or_throw _ _ _ => constr:(if_any_or_throw_out)\n | if_success_or_return _ _ _ => constr:(if_success_or_return_out)\n | if_success_state _ _ _ => constr:(if_success_state_out)\n | ?x => run_select_extra T\n end end.\n\n(* template:\nLtac run_select_extra T ::=\n match T with\n | if_any_or_throw _ _ _ => constr:(if_any_or_throw_out)\n end.\n*)\n\n(** [run_select_proj] is used to obtain automatically\n the right correctness lemma out of the correctness record *)\n\nLtac run_select_proj_extra_error HT := fail.\nLtac run_select_proj_extra_ref HT := fail.\nLtac run_select_proj_extra_conversions HT := fail.\nLtac run_select_proj_extra_construct HT := fail.\nLtac run_select_proj_extra_get_value HT := fail.\n\nLtac run_select_proj H :=\n match type of H with ?T = _ => let HT := get_head T in\n match HT with\n | runs_type_expr => constr:(runs_type_correct_expr)\n | runs_type_stat => constr:(runs_type_correct_stat)\n | runs_type_prog => constr:(runs_type_correct_prog)\n | runs_type_call => constr:(runs_type_correct_call)\n | runs_type_construct => constr:(runs_type_correct_construct)\n | runs_type_function_has_instance => constr:(runs_type_correct_function_has_instance)\n | runs_type_object_has_instance => constr:(runs_type_correct_object_has_instance)\n | runs_type_stat_while => constr:(runs_type_correct_stat_while)\n | runs_type_stat_do_while => constr:(runs_type_correct_stat_do_while)\n | runs_type_stat_for_loop => constr:(runs_type_correct_stat_for_loop)\n | runs_type_object_delete => constr:(runs_type_correct_object_delete)\n | runs_type_object_get_own_prop => constr:(runs_type_correct_object_get_own_prop)\n | runs_type_object_get_prop => constr:(runs_type_correct_object_get_prop)\n | runs_type_object_get => constr:(runs_type_correct_object_get)\n | runs_type_object_proto_is_prototype_of => constr:(runs_type_correct_object_proto_is_prototype_of)\n | runs_type_object_put => constr:(runs_type_correct_object_put)\n | runs_type_equal => constr:(runs_type_correct_equal)\n | runs_type_to_integer => constr:(runs_type_correct_to_integer)\n | runs_type_to_string => constr:(runs_type_correct_to_string)\n | runs_type_array_element_list => constr:(runs_type_correct_array_element_list)\n | runs_type_object_define_own_prop_array_loop => constr:(runs_type_correct_object_define_own_prop_array_loop)\n | ?x => run_select_proj_extra_error HT\n | ?x => run_select_proj_extra_ref HT\n | ?x => run_select_proj_extra_conversions HT\n | ?x => run_select_proj_extra_construct HT\n | ?x => run_select_proj_extra_get_value HT\n end end.\n\n(** [prove_runs_type_correct] discharges the trivial goal\n that consists in invoking the induction hypothesis*)\n\nLtac prove_runs_type_correct :=\n match goal with |- runs_type_correct _ => assumption end.\n\n(* [run_hyp H] exploits the induction hypothesis\n on [runs_type_correct] to the hypothesis [H] *)\n\nLtac run_hyp_core H R :=\n let H' := fresh in rename H into H';\n let Proj := run_select_proj H' in\n lets R: Proj (rm H');\n try prove_runs_type_correct.\n\n(** [select_ind_hyp] returns the induction hypothesis\n on [runs_type_correct] *)\n\nLtac select_ind_hyp tt :=\n match goal with IH: runs_type_correct _ |- _ => constr:(IH) end.\n\n(* old run_hyp H:\nLtac run_hyp_core H R :=\n let H' := fresh in rename H into H';\n let IH := select_ind_hyp tt in\n let Proj := run_select_proj H' in\n lets R: Proj IH (rm H').\n*)\n\nTactic Notation \"run_hyp\" hyp(H) \"as\" simple_intropattern(R) :=\n run_hyp_core H R.\n\nTactic Notation \"run_hyp\" hyp(H) :=\n let T := fresh in rename H into T;\n run_hyp T as H.\n\nTactic Notation \"run_hyp\" :=\n match goal with H: _ = result_some _ |- _ => run_hyp H end.\n\nTactic Notation \"run_hyp\" \"*\" hyp(H) :=\n run_hyp H; auto*.\n\nTactic Notation \"run_hyp\" \"*\" :=\n run_hyp; auto*.\n\n\n(* [run_pre] exploits the appropriate \"out\" lemma, whether it comes\n from the correctness record or it is an auxiliary lemma. *)\n\nLtac run_pre_ifres H o1 R1 K :=\n let L := run_select_ifres H in\n lets (o1&R1&K): L (rm H). (* deconstruction of the \"isout\" *)\n\nLtac run_pre_core H o1 R1 K :=\n run_pre_ifres H o1 R1 K;\n let O1 := fresh \"O1\" in\n try (rename R1 into O1; run_hyp O1 as R1).\n\nTactic Notation \"run_pre\" hyp(H) \"as\" ident(o1) ident(R1) ident(K) :=\n let T := fresh in rename H into T;\n run_pre_core T o1 R1 K.\n\nTactic Notation \"run_pre_ifres\" \"as\" ident(o1) ident(R1) :=\n unfold result_some_out in *; unfold res_to_res_void in * ; unfold result_out in *; unfold res_out in *;\n (* LATER: improve unfolds *)\n match goal with H: _ = result_some _ |- _ =>\n let T := fresh in rename H into T;\n run_pre_ifres T o1 R1 H end.\n\nTactic Notation \"run_pre\" \"as\" ident(o1) ident(R1) :=\n unfold result_some_out in *; unfold res_to_res_void in * ; unfold result_out in *; unfold res_out in *;\n (* LATER: improve unfolds *)\n match goal with H: _ = result_some _ |- _ =>\n let T := fresh in rename H into T;\n run_pre_core T o1 R1 H end.\n\nTactic Notation \"run_pre\" \"as\" ident(o1) :=\n let R1 := fresh \"R1\" o1 in\n run_pre as o1 R1.\n\nTactic Notation \"run_pre\" :=\n let o1 := fresh \"o1\" in let R1 := fresh \"R1\" in\n run_pre as o1 R1.\n\n(** [run_apply Red o1 R1] applys a reduction rule on a given\n [o1] or reduction reaching [o1]. *)\n\nTactic Notation \"run_apply\" constr(Red) constr(o1orR1) :=\n applys Red o1orR1.\n\nTactic Notation \"run_apply\" constr(Red) constr(o1) constr(R1) :=\n first [ applys Red (rm R1)\n | applys Red o1 ].\n\n(** [run_post] decomposes the conclusion of the \"out\"\n lemma *)\n\nLtac run_post_run_expr_get_value := fail.\n\nLtac run_post_extra := fail.\n\nLtac run_post_core :=\n let Er := fresh \"Er\" in\n let Ab := fresh \"Ab\" in\n let S := fresh \"S\" in\n let O1 := fresh \"O1\" in\n let go H X :=\n destruct H as [(Er&Ab)|(S&X&O1&H)];\n [ try abort | try subst_hyp O1 ] in\n match goal with\n | H: if_ter_post _ _ _ |- _ =>\n let R := fresh \"R\" in go H R\n | H: if_success_post _ _ _ |- _ =>\n let rv := fresh \"rv\" in go H rv\n | H: if_value_post _ _ _ |- _ =>\n let v := fresh \"v\" in go H v\n | H: if_void_post _ _ _ |- _ =>\n destruct H as [(Er&Ab)|(S&O1&H)];\n [ try abort | try subst_hyp O1 ]\n | H: if_not_throw_post _ _ _ |- _ =>\n let R := fresh \"R\" in\n let N := fresh \"N\" in let v := fresh \"v\" in\n let E := fresh \"E\" in let L := fresh \"L\" in\n destruct H as [(Er & Ab) | (S & R & O1 & [(N & H) | (N & H)])];\n [try abort | try subst_hyp O1 | try abort]\n | H: if_break_post _ _ _ |- _ =>\n let R := fresh \"R\" in let E := fresh \"E\" in\n let HT := fresh \"HT\" in\n destruct H as [(Er&E)|(S&R&O1&[(HT&E)|(HT&H)])];\n [ try abort | try subst_hyp O1 | try subst_hyp O1 ]\n | H: if_object_post _ _ _ |- _ =>\n let l := fresh \"l\" in go H l\n | H: if_bool_post _ _ _ |- _ =>\n let b := fresh \"b\" in go H b\n | H: if_string_post _ _ _ |- _ =>\n let s := fresh \"s\" in go H s\n | H: if_number_post _ _ _ |- _ =>\n let m := fresh \"m\" in go H m\n | H: if_prim_post _ _ _ |- _ =>\n let w := fresh \"w\" in go H w\n | H: if_ter_spec_post _ _ _ |- _ =>\n let R := fresh \"R\" in go H R\n | H: if_success_spec_post _ _ _ |- _ =>\n let rv := fresh \"rv\" in go H rv\n | H: if_value_spec_post _ _ _ |- _ =>\n let v := fresh \"v\" in go H v\n | H: if_bool_spec_post _ _ _ |- _ =>\n let b := fresh \"b\" in go H b\n | H: if_string_spec_post _ _ _ |- _ =>\n let s := fresh \"s\" in go H s\n | H: if_object_spec_post _ _ _ |- _ =>\n let l := fresh \"l\" in go H l\n | H: if_number_spec_post _ _ _ |- _ =>\n let m := fresh \"m\" in go H m\n | H: if_prim_spec_post _ _ _ |- _ =>\n let w := fresh \"w\" in go H w\n | H: if_spec_post _ _ _ |- _ =>\n let o := fresh \"o\" in let Er' := fresh \"Er\" in\n let S := fresh \"S\" in let a := fresh \"a\" in\n destruct H as [(o&Er&Er'&Ab)|(S&a&O1&H)];\n [ try abort | try subst_hyp O1 ]\n | H: if_any_or_throw_post _ _ _ _ |- _ =>\n let R := fresh \"R\" in\n let N := fresh \"N\" in let v := fresh \"v\" in\n let E := fresh \"E\" in let L := fresh \"L\" in\n destruct H as [(Er&Ab)|(S&R&O1&[(N&H)|(N&v&E&L&H)])];\n [ try subst_hyp Er; try subst_hyp Ab | try subst_hyp O1 | try subst_hyp O1 ]\n | H: if_success_or_return_post _ _ _ _ |- _ =>\n let S := fresh \"S\" in let R := fresh \"R\" in\n let o1 := fresh \"o1\" in let W1 := fresh \"W1\" in let O1 := fresh \"O1\" in\n let E1 := fresh \"E\" in let E2 := fresh \"E\" in\n destruct H as [(Er&Ab)|(S&R&O1&[(E1&E2&K)|[(E1&E2&K)|(E1&E2&K)]])];\n [ try subst_hyp Er; try subst_hyp Ab; try abort\n | try subst_hyp O1 | try subst_hyp O1 | try subst_hyp O1 ]\n | H: if_success_state_post _ _ _ _ |- _ =>\n (* LATER: improve the statement of the lemma *)\n let S := fresh \"S\" in let R := fresh \"R\" in\n let O1 := fresh \"O1\" in\n let E1 := fresh \"E\" in let E2 := fresh \"E\" in let rv := fresh \"rv\" in\n destruct H as [(Er&Ab)|[(S&R&O1&E1&H)|[(S&R&O1&E1&E2&H)|(S&rv&O1&H)]]];\n [ try subst_hyp Er; try subst_hyp Ab; try abort\n | try subst_hyp O1 | try subst_hyp O1 | try subst_hyp O1 ]\n | |- _ => run_post_run_expr_get_value\n | |- _ => run_post_extra\n end.\n\n(* template\nLtac run_post_extra ::=\n let Er := fresh \"Er\" in let Ab := fresh \"Ab\" in\n let O1 := fresh \"O1\" in let S := fresh \"S\" in\n match goal with\n | H: if_any_or_throw_post _ _ _ _ |- _ => ...\n end.\n\n*)\n\nTactic Notation \"run_post\" :=\n run_post_core.\n\n(** [run_inv] simplifies equalities in goals\n by performing inversions on equalities. *)\n\nLtac run_inv :=\n unfold result_some_out in *; unfold res_to_res_void in * ; unfold out_retn in *; unfold result_out in *;\n repeat\n match goal with\n | H: resvalue_value ?v = resvalue_value ?v |- _ => clear H\n | H: resvalue_value _ = resvalue_value _ |- _ => inverts H\n | H: res_spec _ _ = _ |- _ => unfold res_spec in H\n | H: _ = res_spec _ _ |- _ => unfold res_spec in H\n | H: res_out _ = _ |- _ => unfold res_out in H\n | H: _ = res_out _ |- _ => unfold res_out in H\n | H: res_ter _ _ = _ |- _ => unfold res_ter in H\n | H: _ = res_ter _ _ |- _ => unfold res_ter in H\n | H: result_some ?o = result_some ?o |- _ => clear H\n | H: result_some _ = result_some _ |- _ => inverts H\n | H: out_ter ?S ?R = out_ter ?S ?R |- _ => clear H\n | H: out_ter _ _ = out_ter _ _ |- _ => inverts H\n | H: res_intro ?t ?v ?l = res_intro ?t ?v ?l |- _ => clear H\n | H: res_intro _ _ _ = res_intro _ _ _ |- _ => inverts H\n | H: ret _ _ = _ |- _ => unfold ret in H\n | H: _ = ret _ _ |- _ => unfold ret in H\n | H: ret_void _ = _ |- _ => unfold ret_void in H\n | H: _ = ret_void _ |- _ => unfold ret_void in H\n | H: res_void _ = _ |- _ => unfold res_void in H\n | H: _ = res_void _ |- _ => unfold res_void in H\n | H: specret_val ?S ?R = specret_val ?S ?R |- _ => clear H\n | H: specret_val _ _ = specret_val _ _ |- _ => inverts H\n | H: specret_out ?o = specret_out ?o |- _ => clear H\n | H: specret_out _ = _ |- _ => inverts H\n | H: _ = specret_out _ |- _ => inverts H\n | H: out_from_retn ?sp = out_from_retn ?sp |- _ => clear H\n | H: out_from_retn _ = out_from_retn _ |- _ => inverts H\n end.\n\n(** [runs_inv] is the same as [run_inv] followed by subst. *)\n\nLtac runs_inv :=\n run_inv; subst.\n\n(** Auxiliary tactics to select/check the current \"out\" *)\n\nLtac run_get_current_out tt :=\n match goal with\n | |- red_expr _ _ _ ?o => o\n | |- red_stat _ _ _ ?o => o\n | |- red_prog _ _ _ ?o => o\n | |- red_spec _ _ _ ?o => o\n | |- red_javascript _ ?o => o\n end.\n\nLtac run_check_current_out o :=\n match goal with\n | |- red_expr _ _ _ o => idtac\n | |- red_stat _ _ _ o => idtac\n | |- red_prog _ _ _ o => idtac\n | |- red_spec _ _ _ o => idtac\n | |- red_javascript _ o => idtac\n end.\n\n(** [run_step Red] combines [run_pre], [run_apply Red] and calls\n [run_post] on the main reduction subgoal, followed\n with a cleanup using [run_inv] *)\n\nLtac run_step Red :=\n let o1 := fresh \"o1\" in let R1 := fresh \"R1\" in\n run_pre as o1 R1;\n match Red with ltac_wild => idtac | _ =>\n let o := run_get_current_out tt in\n run_apply Red o1 R1;\n try (run_check_current_out o; run_post; run_inv; try assumption)\n end.\n\n(** [run_step_using Red Lem] combines [run_pre],\n a forward to exploit the correctness lemma [Lem],\n [run_apply Red] and calls\n [run_post] on the main reduction subgoal, followed\n with a cleanup using [run_inv] *)\n\nLtac run_step_using Red Lem :=\n let o1 := fresh \"o1\" in let O1 := fresh \"O1\" in\n let R1 := fresh \"R1\" in\n run_pre_ifres as o1 O1;\n lets R1: Lem (rm O1);\n try prove_runs_type_correct;\n match Red with ltac_wild => idtac | _ =>\n let o := run_get_current_out tt in\n run_apply Red o1 R1;\n try (run_check_current_out o; run_post; run_inv; try assumption)\n end.\n\n(** [run_simpl] is intended for simplyfing simple monads\n that do not match over a result, then run\n [run_inv] to clean up the goal. *)\n\nLtac run_simpl_run_error H T K := fail.\n\nLtac run_simpl_base H K :=\n let E := fresh \"E\" in\n match type of H with ?T = _ => match T with\n | if_some _ _ =>\n let x := fresh \"x\" in\n lets (x&E&K): if_some_out (rm H)\n | if_some_or_default _ _ _ =>\n let x := fresh \"x\" in\n let E1 := fresh \"E\" in let E2 := fresh \"E\" in\n lets [(E1&E2)|(n&E&K)]: if_some_or_default_out (rm H)\n | if_empty_label _ _ _ =>\n lets (E&K): if_empty_label_out (rm H)\n | ?x => run_simpl_run_error H T K\n | ?x => run_hyp_core H K\n end end.\n\n\nLtac run_simpl_core H K :=\n run_simpl_base H K; run_inv.\n\nTactic Notation \"run_simpl\" ident(H) \"as\" ident(K) :=\n let T := fresh in rename H into T;\n run_simpl_core T K.\n\nTactic Notation \"run_simpl\" :=\n unfold result_some_out in *; unfold res_to_res_void in * ; unfold result_out in *; unfold res_out in *;\n (* LATER: handle unfold *)\n match goal with H: _ = result_some _ |- _ =>\n let H' := fresh in rename H into H';\n run_simpl_core H' H\n end.\n\n(** [run Red] is the same as [run_step Red].\n [run] without arguments is the same as [run_simpl].\n [runs] is same as [run] followed with [subst]. *)\n\nTactic Notation \"run\" constr(Red) :=\n run_step Red.\n\nTactic Notation \"run\" \"~\" constr(Red) :=\n run Red; auto~.\n\nTactic Notation \"run\" \"*\" constr(Red) :=\n run Red; auto*.\n\nTactic Notation \"run\" constr(Red) \"using\" constr(Lem) :=\n run_step_using Red Lem.\n\nTactic Notation \"run\" \"~\" constr(Red) \"using\" constr(Lem) :=\n run Red using Lem; auto~.\n\nTactic Notation \"run\" \"*\" constr(Red) \"using\" constr(Lem) :=\n run Red using Lem; auto*.\n\n\nTactic Notation \"runs\" constr(Red) :=\n run Red; subst.\n\nTactic Notation \"runs\" \"~\" constr(Red) :=\n run Red; subst; auto~.\n\nTactic Notation \"runs\" \"*\" constr(Red) :=\n run Red; subst; auto*.\n\nTactic Notation \"run\" :=\n run_simpl.\n\nTactic Notation \"run\" \"~\" :=\n run; auto~.\n\nTactic Notation \"run\" \"*\" :=\n run; auto*.\n\nTactic Notation \"runs\" :=\n run; subst.\n\nTactic Notation \"runs\" \"~\" :=\n runs; auto~.\n\nTactic Notation \"runs\" \"*\" :=\n runs; auto*.\n\n\n(* debugging of [run Red]:\n run_pre as o1 R1.\n or: run_pre H as o1 R1 K. (* where H is the hypothesis *)\n or: run_pre_core H o1 R1 K. (* where H is the hypothesis *)\n or: run_pre_lemma H o1 R1 K. (* where H is the hypothesis *)\n run_apply __my_red_lemma__ R1. (* where R1 is the red hypothesis *)\n run_post.\n run_inv.\n*)\n\n\n(************************************************************)\n(* ** Correctness Lemmas *)\n\nLemma type_of_prim_not_object : forall w,\n type_of w <> type_object.\nProof. destruct w; simpl; try congruence. Qed.\n\nHint Resolve type_of_prim_not_object.\n\nLemma is_lazy_op_correct : forall op,\n match is_lazy_op op with\n | None => regular_binary_op op\n | Some b => lazy_op op b\n end.\nProof.\n Hint Constructors lazy_op.\n unfold regular_binary_op.\n intros. destruct op; simple*.\nAdmitted. (* faster *)\n\nLemma run_object_method_correct : forall Z (Proj : _ -> Z) S l (z : Z),\n run_object_method Proj S l = Some z ->\n object_method Proj S l z.\nProof.\n introv B. unfolds. forwards (O&Bi&E): LibOption.map_on_inv B.\n forwards: @pick_option_correct Bi. exists* O.\nQed.\n\nLemma run_object_heap_set_extensible_correct : forall b S l S',\n run_object_heap_set_extensible b S l = Some S' ->\n object_heap_set_extensible b S l S'.\nProof.\n introv R. unfolds in R. forwards (O&H&E): LibOption.map_on_inv (rm R).\n forwards: @pick_option_correct (rm H). exists O. splits~.\nQed.\n\nLemma build_error_correct : forall S C vproto vmsg o,\n build_error S vproto vmsg = o ->\n red_expr S C (spec_build_error vproto vmsg) o.\nProof.\n introv R. unfolds in R.\n match goal with H: context [object_alloc ?s ?o] |- _ => sets_eq X: (object_alloc s o) end.\n destruct X as (l&S'). cases_if.\n applys~ red_spec_build_error EQX. run_inv.\n applys~ red_spec_build_error_1_no_msg.\nQed.\n\nLemma run_error_correct' : forall T S ne o C,\n run_error S ne = (res_out o : specres T) ->\n red_expr S C (spec_error ne) o /\\ abort o.\nProof.\n introv R. unfolds in R. run_pre as o1 R1. forwards R0: build_error_correct (rm R1).\n applys_and red_spec_error R0. run_post.\n run_inv. splits~. abort.\n run_inv. splits; [|prove_abort]. apply~ red_spec_error_1.\nQed.\n\nLemma run_error_correct : forall T S ne o C,\n run_error S ne = (res_out o : specres T) ->\n red_expr S C (spec_error ne) o.\nProof. intros. applys* run_error_correct'. Qed.\n\nLemma run_error_correct_2 : forall T S (ne : native_error) o C,\n run_error S ne = (res_out o : specres T) -> red_expr S C (spec_error ne) o.\nProof. intros. apply* run_error_correct. Qed.\n\nHint Resolve run_error_correct run_error_correct_2.\n\nLtac run_simpl_run_error H T K ::=\n match T with run_error _ _ =>\n let N := fresh \"N\" in\n let C := match goal with |- _ _ ?C _ _ => constr:(C) end in\n lets (K&N): run_error_correct C (rm H)\n end.\n\nLemma run_error_not_some_out_res : forall S v T,\n ~ (run_error S native_error_type = result_some (@specret_out T (out_ter S (res_val v)))).\nProof.\n set (C := execution_ctx_intro nil nil (value_prim (prim_bool true)) false). introv Hyp.\n apply run_error_correct' with (C := C) in Hyp. \n destruct Hyp as (Hred & Habort).\n inverts Hred. simpls. inverts H.\n inverts H3. simpls. inverts H.\n inverts H0. simpls. inverts H.\n inverts H9. simpls. inverts H.\n inverts Habort. unfolds abrupt_res.\n false~ H0. false~ H3.\nAdmitted. (*faster*)\n\nLemma out_error_or_void_correct : forall S C str (ne : native_error) o,\n out_error_or_void S str ne = o ->\n red_expr S C (spec_error_or_void str ne) o /\\\n (~ abort o -> o = out_void S).\nProof.\n introv E. unfolds in E. cases_if.\n applys_and red_spec_error_or_void_true.\n forwards~ (RC&Cr): run_error_correct' E. splits*.\n inverts E. splits~. apply~ red_spec_error_or_void_false.\nQed.\n\nLemma out_error_or_cst_correct' : forall S C str (ne : native_error) v o,\n out_error_or_cst S str ne v = o ->\n red_expr S C (spec_error_or_cst str ne v) o /\\\n (~ abort o -> o = out_ter S v).\nProof.\n introv E. unfolds in E. cases_if.\n applys_and red_spec_error_or_cst_true. forwards~ (RC&Cr): run_error_correct' E. splits*.\n inverts E. splits~. apply~ red_spec_error_or_cst_false.\nQed.\n\n(* LATER: clean up redundant proof for the direct case *)\nLemma out_error_or_cst_correct : forall S C str ne v o,\n out_error_or_cst S str ne v = o ->\n red_expr S C (spec_error_or_cst str ne v) o.\nProof.\n introv HR. unfolds in HR. case_if.\n applys* red_spec_error_or_cst_true.\n run_inv. applys* red_spec_error_or_cst_false.\nQed.\n\n\nLtac run_select_proj_extra_error HT ::=\n match HT with\n | run_error => constr:(run_error_correct)\n | run_object_method => constr:(run_object_method_correct)\n end.\n\n\n(**************************************************************)\n(** ** Object Get *)\n\nLemma object_has_prop_correct : forall runs S C l x o,\n runs_type_correct runs ->\n object_has_prop runs S C l x = o ->\n red_expr S C (spec_object_has_prop l x) o.\nProof.\n introv IH HR. unfolds in HR. run_simpl. run_hyp E as M.\n applys~ red_spec_object_has_prop M. destruct x0.\n run red_spec_object_has_prop_1_default using runs_type_correct_object_get_prop.\n apply~ red_spec_object_has_prop_2. rewrite decide_def. repeat cases_if~.\nQed.\n\nLemma run_object_get_prop_correct : forall runs S C l x y,\n runs_type_correct runs ->\n run_object_get_prop runs S C l x = result_some y ->\n red_spec S C (spec_object_get_prop l x) y.\nProof.\n introv IH HR. unfolds in HR.\n run. applys* red_spec_object_get_prop.\n applys* run_object_method_correct. clear E.\n destruct x0; tryfalse.\n run red_spec_object_get_prop_1_default. case_if.\n subst. run. applys red_spec_object_get_prop_2_undef.\n applys* run_object_method_correct.\n destruct x0; tryfalse.\n destruct p; tryfalse. run_inv. applys red_spec_object_get_prop_3_null.\n applys red_spec_object_get_prop_3_not_null. run_hyp*.\n run_inv. destruct a; tryfalse.\n applys* red_spec_object_get_prop_2_not_undef.\nAdmitted. (*faster*)\n\nLemma object_get_builtin_correct : forall runs S C B (vthis:value) l x o,\n runs_type_correct runs ->\n object_get_builtin runs S C B vthis l x = o ->\n red_expr S C (spec_object_get_1 B vthis l x) o.\nProof.\n introv IH HR. unfolds in HR.\n let_name as Mdefault.\n asserts Mdefault_correct: (forall S l o,\n Mdefault S l = res_out o ->\n red_expr S C (spec_object_get_1 builtin_get_default vthis l x) o).\n clear HR o. subst. introv HR.\n run red_spec_object_get_1_default. destruct a as [|[Ad|Aa]].\n run_inv. applys* red_spec_object_get_2_undef.\n run_inv. applys* red_spec_object_get_2_data.\n applys red_spec_object_get_2_accessor.\n destruct (attributes_accessor_get Aa); tryfalse.\n destruct p; tryfalse. run_inv.\n applys* red_spec_object_get_3_accessor_undef.\n applys* red_spec_object_get_3_accessor_object. run_hyp*.\n clear EQMdefault.\n let_name as Mfunction.\n asserts Mfunction_correct: (forall S o,\n Mfunction S = res_out o ->\n red_expr S C (spec_object_get_1 builtin_get_function vthis l x) o).\n clear HR o. subst. introv HR.\n run* red_spec_object_get_1_function. clear R1.\n case_if.\n applys* red_spec_function_get_1_error.\n run_inv. applys* red_spec_function_get_1_normal.\n clear EQMfunction. destruct B; tryfalse.\n applys~ Mdefault_correct.\n applys~ Mfunction_correct.\n (* argument object *)\n run. forwards* obpm: run_object_method_correct.\n run. substs. run~ red_spec_object_get_args_obj.\n destruct a. (* LTAC ARTHUR: This [a] wasn't properly named. *)\n apply* red_spec_object_get_args_obj_1_undef.\n run_hyp. apply~ red_spec_object_get_args_obj_1_attrs.\nAdmitted. (* faster *)\n\n\nLemma run_object_get_correct : forall runs S C l x o,\n runs_type_correct runs ->\n run_object_get runs S C l x = o ->\n red_expr S C (spec_object_get l x) o.\nProof.\n introv IH HR. unfolds in HR. run.\n applys* red_spec_object_get.\n applys* run_object_method_correct. clear E.\n applys* object_get_builtin_correct.\nQed.\n\n\nLemma object_can_put_correct : forall runs S C l x o,\n runs_type_correct runs ->\n object_can_put runs S C l x = o ->\n red_expr S C (spec_object_can_put l x) o.\nProof.\n introv IH HR. unfolds in HR. run. run_hyp E as CP.\n applys~ red_spec_object_can_put CP. destruct x0.\n run red_spec_object_can_put_1_default. destruct a.\n run. run_hyp E as P. applys~ red_spec_object_can_put_2_undef P.\n destruct x0 as [()|lproto]; tryfalse.\n run. run_hyp E as E. apply~ red_spec_object_can_put_4_null.\n run red_spec_object_can_put_4_not_null using run_object_get_prop_correct.\n destruct a as [|[Ad|Aa]].\n run. run_hyp E as E. apply~ red_spec_object_can_put_5_undef.\n run. run_hyp E as E. applys~ red_spec_object_can_put_5_data E. destruct x0.\n applys~ red_spec_object_can_put_6_extens_true.\n applys~ red_spec_object_can_put_6_extens_false.\n run_inv. apply~ red_spec_object_can_put_5_accessor. rewrite decide_def.\n repeat cases_if~.\n destruct a; run_inv.\n apply~ red_spec_object_can_put_2_data.\n apply~ red_spec_object_can_put_2_accessor. rewrite decide_def. repeat cases_if~.\nQed.\n\nLemma object_default_value_correct : forall runs S C l pref o,\n runs_type_correct runs ->\n object_default_value runs S C l pref = o ->\n red_expr S C (spec_object_default_value l pref) o.\nProof.\n introv IH HR. unfolds in HR.\n run. lets H: run_object_method_correct (rm E).\n applys* red_spec_object_default_value (rm H).\n destruct x.\n let_name as M.\n asserts M_correct: (forall S x (F:state->result) K (o:out),\n (M S x F = res_out o) ->\n (forall S' o', (F S' = o') -> red_expr S' C K o') ->\n red_expr S C (spec_object_default_value_sub_1 l x K) o).\n clears HR S o. introv HR HK. subst M.\n run red_spec_object_default_value_sub_1\n using run_object_get_correct.\n run. forwards R1: run_callable_correct (rm E).\n destruct x0.\n simpls. run. destruct v; tryfalse.\n run* red_spec_object_default_value_sub_2_callable.\n destruct v; run_inv.\n applys* red_spec_object_default_value_sub_3_prim.\n applys* red_spec_object_default_value_sub_3_object.\n applys* red_spec_object_default_value_sub_2_not_callable.\n clear EQM.\n let_name.\n applys* red_spec_object_default_value_1_default.\n applys* red_spec_object_default_value_2.\n subst. applys* M_correct.\n clears S o. intros S o HR. simpls.\n applys* red_spec_object_default_value_3.\n subst. applys* M_correct.\n clears S o. intros S o HR. simpls.\n applys* red_spec_object_default_value_4.\nAdmitted. (* faster *)\n\n(** Conversions *)\n\nLemma to_primitive_correct : forall runs S C v o prefo,\n runs_type_correct runs ->\n to_primitive runs S C v prefo = o ->\n red_expr S C (spec_to_primitive v prefo) o.\nProof.\n introv IH HR. unfolds in HR. destruct v.\n run_inv. applys* red_spec_to_primitive_pref_prim.\n applys* red_spec_to_primitive_pref_object.\n applys* object_default_value_correct.\n run_pre. rewrite R1. run_post; substs~.\nQed.\n\nLemma to_number_correct : forall runs S C v o,\n runs_type_correct runs ->\n to_number runs S C v = o ->\n red_expr S C (spec_to_number v) o.\nProof.\n introv IH HR. unfolds in HR. destruct v.\n run_inv. applys* red_spec_to_number_prim.\n run red_spec_to_number_object using to_primitive_correct.\n applys* red_spec_to_number_1.\nQed.\n\nLemma to_string_correct : forall runs S C v o,\n runs_type_correct runs ->\n to_string runs S C v = o ->\n red_expr S C (spec_to_string v) o.\nProof.\n introv IH HR. unfolds in HR. destruct v.\n run_inv. applys* red_spec_to_string_prim.\n run red_spec_to_string_object using to_primitive_correct.\n applys* red_spec_to_string_1.\nQed.\n\nLemma to_integer_correct : forall runs S C v o,\n runs_type_correct runs ->\n to_integer runs S C v = o ->\n red_expr S C (spec_to_integer v) o.\nProof.\n introv IH HR. unfolds in HR.\n run red_spec_to_integer using to_number_correct.\n applys* red_spec_to_integer_1.\nQed.\n\nLemma to_int32_correct : forall runs S C v (y:specret int),\n runs_type_correct runs ->\n to_int32 runs S C v = result_some y ->\n red_spec S C (spec_to_int32 v) y.\nProof.\n introv IH HR. unfolds in HR.\n run red_spec_to_int32 using to_number_correct.\n applys* red_spec_to_int32_1.\nQed.\n\nLemma to_uint32_correct : forall runs S C v (y:specret int),\n runs_type_correct runs ->\n to_uint32 runs S C v = result_some y ->\n red_spec S C (spec_to_uint32 v) y.\nProof.\n introv IH HR. unfolds in HR.\n run red_spec_to_uint32 using to_number_correct.\n applys* red_spec_to_uint32_1.\nQed.\n\nLtac run_select_proj_extra_conversions HT ::=\n match HT with\n | to_primitive => constr:(to_primitive_correct)\n | to_number => constr:(to_number_correct)\n | to_string => constr:(to_string_correct)\n | to_int32 => constr:(to_int32_correct)\n | to_uint32 => constr:(to_uint32_correct)\n end.\n\nLemma run_object_define_own_prop_array_loop_correct :\n forall runs S C l newLen oldLen newLenDesc newWritable throw o \n (def : state -> prop_name -> descriptor -> strictness_flag -> specres nothing) \n (def_correct : forall S str o x Desc,\n def S x Desc str = res_out o ->\n red_expr S C (spec_object_define_own_prop_1 builtin_define_own_prop_default l x Desc str) o),\n runs_type_correct runs ->\n run_object_define_own_prop_array_loop runs S C l newLen oldLen newLenDesc newWritable throw def = o -> \n red_expr S C (spec_object_define_own_prop_array_3l l newLen oldLen newLenDesc newWritable throw) o.\nProof.\n introv Hyp HR IH.\n unfolds run_object_define_own_prop_array_loop.\n cases_if*. let_name. \n applys~ red_spec_object_define_own_prop_array_3l_condition_true. \n rewrite <- EQoldLen'.\n run~ red_spec_object_define_own_prop_array_3l_ii.\n run~ red_spec_object_define_own_prop_array_3l_ii_1.\n destruct b; cases_if*; clear n.\n applys* red_spec_object_define_own_prop_array_3l_ii_2.\n eapply runs_type_correct_object_define_own_prop_array_loop; eassumption.\n\n applys* red_spec_object_define_own_prop_array_3l_ii_2_3. \n eapply red_spec_object_define_own_prop_array_3l_iii_1. reflexivity.\n destruct newWritable; try solve [false].\n let_name as newLenDesc''. rewrite <- EQnewLenDesc''. \n apply red_spec_object_define_own_prop_array_3l_iii_2_true.\n let_name. cases_if*. subst newLenDesc0.\n run~ red_spec_object_define_own_prop_array_3l_iii_3.\n applys* red_spec_object_define_own_prop_array_3l_iii_4. \n applys* red_spec_object_define_own_prop_reject.\n applys* out_error_or_cst_correct.\n let_name as newLenDesc''. rewrite <- EQnewLenDesc''. \n apply red_spec_object_define_own_prop_array_3l_iii_2_false.\n let_name. cases_if*. subst newLenDesc0.\n run~ red_spec_object_define_own_prop_array_3l_iii_3.\n applys* red_spec_object_define_own_prop_array_3l_iii_4. \n applys* red_spec_object_define_own_prop_reject.\n applys* out_error_or_cst_correct.\n \n applys~ red_spec_object_define_own_prop_array_3l_condition_false.\n destruct newWritable; cases_if*; clear n.\n inverts IH. applys* red_spec_object_define_own_prop_array_3n.\n\n applys* red_spec_object_define_own_prop_array_3m.\nQed.\n\nLemma object_define_own_prop_correct : forall runs S C l x Desc str o,\n runs_type_correct runs ->\n object_define_own_prop runs S C l x Desc str = o ->\n red_expr S C (spec_object_define_own_prop l x Desc str) o.\nProof.\n introv IH HR. unfolds in HR.\n let_name as rej. asserts Rej: (forall S str o,\n rej S str = o ->\n red_expr S C (spec_object_define_own_prop_reject str) o).\n clear HR S str o. introv HR. subst.\n applys* red_spec_object_define_own_prop_reject.\n applys* out_error_or_cst_correct.\n let_name as def. asserts Def: (forall S str o x Desc,\n def S x Desc str = res_out o ->\n red_expr S C (spec_object_define_own_prop_1 builtin_define_own_prop_default l x Desc str) o).\n clear HR S str o Desc x. introv HR. subst.\n run red_spec_object_define_own_prop_1_default.\n run. applys* red_spec_object_define_own_prop_2.\n applys* run_object_method_correct. clear E.\n destruct a.\n case_if.\n let_name. run. forwards B: @pick_option_correct (rm E).\n applys* red_spec_object_define_own_prop_3_undef_true A.\n case_if; case_if*.\n subst. applys* red_spec_object_define_own_prop_3_undef_false.\n let_name as wri. asserts Wri: (forall S A o,\n wri S A = res_out o ->\n red_expr S C (spec_object_define_own_prop_write l x A Desc str) o).\n clear HR o. introv HR. subst.\n run. forwards B: @pick_option_correct (rm E).\n applys* red_spec_object_define_own_prop_write.\n clear EQwri.\n case_if.\n run_inv. applys* red_spec_object_define_own_prop_3_includes.\n applys* red_spec_object_define_own_prop_3_not_include.\n case_if.\n run_inv. applys* red_spec_object_define_own_prop_4_reject.\n applys* red_spec_object_define_own_prop_4_not_reject. case_if.\n applys* red_spec_object_define_own_prop_5_generic. case_if.\n applys* red_spec_object_define_own_prop_5_a. case_if;\n [ | applys* red_spec_object_define_own_prop_6a_reject].\n let_name. run. forwards B: @pick_option_correct (rm E).\n applys* red_spec_object_define_own_prop_6a_accept A'.\n case_if as HC1.\n destruct a; inverts n2; tryfalse.\n applys* red_spec_object_define_own_prop_5_b. case_if.\n applys* red_spec_object_define_own_prop_6b_false_reject.\n applys* red_spec_object_define_own_prop_6b_false_accept.\n case_if. destruct a; tryfalse.\n applys* red_spec_object_define_own_prop_5_c. case_if.\n applys* red_spec_object_define_own_prop_6c_1.\n applys* red_spec_object_define_own_prop_6c_2.\n clear EQdef.\n run.\n applys* red_spec_object_define_own_prop.\n applys* run_object_method_correct.\n clear E. destruct x0. (* LTAC ARTHUR: This [x0] wasn't properly named. *)\n (* default *)\n applys* Def.\n\n (* Array object *)\n run red_spec_object_define_own_prop_array_1. \n destruct a; [inverts HR | ]. destruct a; [ | inverts HR].\n let_name. subst oldLen. \n eapply red_spec_object_define_own_prop_array_2. reflexivity.\n destruct (attributes_data_value a); [ | inverts HR].\n let_name. let_name. subst descValueOpt.\n eapply red_spec_object_define_own_prop_array_2_1. reflexivity.\n eapply red_spec_to_uint32. apply red_spec_to_number_prim. reflexivity.\n apply red_spec_to_uint32_1. rewrite <- EQoldLen. \n case_if. subst x.\n \n apply red_spec_object_define_own_prop_array_branch_3_4_3.\n assert (Hyp : {v | descriptor_value Desc = Some v} + {descriptor_value Desc = None}).\n {\n destruct (descriptor_value Desc); [left | right]; auto. exists~ v.\n } inverts Hyp as Hyp. \n\n (* Step 3b *) \n destruct Hyp as (v & EQv); rewrite EQv in *.\n run~ red_spec_object_define_own_prop_array_3_3c; rename a0 into newLen.\n run~ red_spec_object_define_own_prop_array_3c; rename m into newLenN.\n case_if*. applys~ red_spec_object_define_own_prop_array_3d.\n applys* run_error_correct. let_name.\n applys~ red_spec_object_define_own_prop_array_3e.\n clear dependent newLenN. case_if*.\n subst; applys* red_spec_object_define_own_prop_array_3f.\n case_if*. applys* red_spec_object_define_own_prop_array_3g.\n applys~ red_spec_object_define_own_prop_array_3g_to_h.\n rewrite <- EQnewLenDesc. let_name. let_name as newLenDesc'. \n cases_if*; lets HnW : n1; rewrite EQnewWritable in n1. \n apply red_spec_object_define_own_prop_array_3i.\n destruct (descriptor_writable newLenDesc); jauto.\n cases_if*. false~. clear n1 EQnewWritable. rewrite <- EQnewLenDesc'.\n replace false with newWritable by (destruct newWritable; auto; false).\n run* red_spec_object_define_own_prop_array_3j. destruct b; case_if*; clear n1.\n apply red_spec_object_define_own_prop_array_to_3l.\n applys* run_object_define_own_prop_array_loop_correct.\n \n inverts HR. apply red_spec_object_define_own_prop_array_3k.\n apply red_spec_object_define_own_prop_array_3h.\n destruct (descriptor_writable newLenDesc); jauto.\n cases_if*. clear n1 EQnewWritable. subst newLenDesc'. \n replace true with newWritable by (destruct newWritable; auto; false).\n run* red_spec_object_define_own_prop_array_3j. destruct b; case_if*; clear n1.\n apply red_spec_object_define_own_prop_array_to_3l.\n applys* run_object_define_own_prop_array_loop_correct.\n\n inverts HR. applys* red_spec_object_define_own_prop_array_3k.\n \n (* Step 3a *) \n rewrite Hyp in HR. applys~ red_spec_object_define_own_prop_array_3_3a.\n\n (* Branching between Step 4 and Step 5 *)\n applys~ red_spec_object_define_own_prop_array_branch_3_4_4.\n run red_spec_object_define_own_prop_array_branch_4_5.\n run red_spec_object_define_own_prop_array_branch_4_5_a.\n case_if. rename a0 into ilen, s into slen.\n applys~ red_spec_object_define_own_prop_array_branch_4_5_b_4.\n run red_spec_object_define_own_prop_array_4a.\n case_if; rename a0 into index.\n applys~ red_spec_object_define_own_prop_array_4b.\n run~ red_spec_object_define_own_prop_array_4c.\n destruct b; case_if*. case_if.\n eapply red_spec_object_define_own_prop_array_4c_e. auto. reflexivity. auto.\n run_inv. applys~ red_spec_object_define_own_prop_array_4f.\n applys~ red_spec_object_define_own_prop_array_4c_d.\n applys~ red_spec_object_define_own_prop_array_branch_4_5_b_5.\n applys~ red_spec_object_define_own_prop_array_5. \n\n (* arguments object *)\n run. forwards~ obpm: run_object_method_correct (rm E).\n run. subst. run~ red_spec_object_define_own_prop_args_obj.\n run~ red_spec_object_define_own_prop_args_obj_1. cases_if; substs.\n let_name. asserts Follow: (forall S o,\n follow S = result_some (specret_out o) ->\n red_expr S C spec_args_obj_define_own_prop_6 o).\n introv RES. rewrite EQfollow in RES. inverts RES.\n apply* red_spec_object_define_own_prop_args_obj_6.\n clear EQfollow. destruct a as [|A]. (* LTAC ARTHUR: this [a] has been defined by tactics. *)\n apply~ red_spec_object_define_own_prop_args_obj_2_true_undef.\n cases_if.\n run~ red_spec_object_define_own_prop_args_obj_2_true_acc.\n apply* red_spec_object_define_own_prop_args_obj_5.\n let_name as next. asserts Next: (forall S o,\n next S = result_some (specret_out o) ->\n red_expr S C (spec_args_obj_define_own_prop_4 l x Desc str x1) o).\n introv RES. rewrite EQnext in RES. cases_if.\n run~ red_spec_object_define_own_prop_args_obj_4_false.\n apply~ red_spec_object_define_own_prop_args_obj_5.\n apply~ red_spec_object_define_own_prop_args_obj_4_not_false.\n clear EQnext. sets_eq <- dvDesc: (descriptor_value Desc). destruct dvDesc.\n run~ red_spec_object_define_own_prop_args_obj_2_true_not_acc_some.\n apply~ red_spec_object_define_own_prop_args_obj_3.\n apply~ red_spec_object_define_own_prop_args_obj_2_true_not_acc_none.\n apply~ red_spec_object_define_own_prop_args_obj_2_false.\nAdmitted. (* faster *)\n\nLemma prim_new_object_correct : forall S C w o,\n prim_new_object S w = o ->\n red_expr S C (spec_prim_new_object w) o.\nProof.\n introv H. destruct w; tryfalse;\n unfolds in H; repeat let_simpl;\n match goal with H: context [object_alloc ?s ?o] |- _ => sets_eq X: (object_alloc s o) end;\n destruct X as (l&S').\n inversion H. applys* red_spec_prim_new_object_bool.\n inversion H. applys* red_spec_prim_new_object_number.\n run. applys* red_spec_prim_new_object_string.\n apply pick_option_correct in E. auto.\nQed.\n\n(* todo: move to the right place above here *)\nLemma to_object_correct : forall S C v o,\n to_object S v = o ->\n red_expr S C (spec_to_object v) o.\nProof.\n hint run_error_correct_2, prim_new_object_correct.\n introv HR. unfolds in HR. destruct v as [w|l].\n destruct w.\n applys* red_spec_to_object_undef_or_null.\n applys* red_spec_to_object_undef_or_null.\n applys* red_spec_to_object_prim. rew_logic*. splits; congruence.\n applys* red_spec_to_object_prim. rew_logic*. splits; congruence.\n applys* red_spec_to_object_prim. rew_logic*. splits; congruence.\n run_inv. applys* red_spec_to_object_object.\nQed.\n\nLemma run_object_prim_value_correct : forall S l o,\n run_object_prim_value S l = o ->\n exists (v : value), o = out_ter S v /\\\n object_prim_value S l v.\nProof.\n introv HR. unfolds in HR. do 2 runs. eexists. splits*.\n forwards~: run_object_method_correct E.\nQed.\n\nLemma prim_value_get_correct : forall runs S C v x o,\n runs_type_correct runs ->\n prim_value_get runs S C v x = o ->\n red_expr S C (spec_prim_value_get v x) o.\nProof.\n introv IH HR. unfolds in HR.\n run red_spec_prim_value_get using to_object_correct.\n applys* red_spec_prim_value_get_1.\n applys* object_get_builtin_correct.\nAdmitted. (*faster*)\n\nLemma object_put_complete_correct : forall runs S C B vthis l x v str o,\n runs_type_correct runs ->\n object_put_complete runs B S C vthis l x v str = o ->\n red_expr S C (spec_object_put_1 B vthis l x v str) o.\nProof.\n introv IH HR. unfolds in HR. destruct B.\n run red_spec_object_put_1_default using object_can_put_correct. cases_if.\n run red_spec_object_put_2_true. let_name.\n asserts follows_correct: (forall Aa o,\n a = full_descriptor_undef \\/ (a = attributes_accessor_of Aa) ->\n follow tt = res_out o ->\n red_expr S0 C (spec_object_put_3 vthis l x v str (specret_val S2 a)) o).\n clear HR. introv N E. substs.\n run red_spec_object_put_3_not_data using run_object_get_prop_correct. apply* N.\n clear N. tests Acc: (exists Aa', a0 = attributes_accessor_of Aa').\n lets (Aa'&?): (rm Acc). let_simpl. substs.\n sets_eq va': (attributes_accessor_set Aa'). destruct va' as [|la']; tryfalse.\n run* red_spec_object_put_4_accessor. rewrite <- EQva'. discriminate.\n apply~ red_spec_object_put_5_return.\n let_name. asserts E': (follow' tt = o0).\n destruct a0 as [|()]; try solve [false~ Acc]; exact E.\n asserts (?&H'): (exists (Ad : attributes_data),\n a0 = full_descriptor_undef \\/ a0 = Ad).\n destruct a0 as [|()]. exists* (arbitrary : attributes_data). exists* a0. false~ Acc.\n clear E. substs. destruct vthis.\n forwards (H&_): out_error_or_void_correct C (rm E').\n applys* red_spec_object_put_4_not_accessor_prim H.\n let_simpl. run* red_spec_object_put_4_not_accessor_object using\n object_define_own_prop_correct. apply~ red_spec_object_put_5_return.\n destruct a as [|[Ad|Aa]]. applys~ follows_correct (arbitrary : attributes_accessor).\n clear EQfollow follow follows_correct.\n destruct vthis as [wthis|lthis].\n apply~ red_spec_object_put_3_data_prim. apply~ out_error_or_void_correct.\n let_simpl. run* red_spec_object_put_3_data_object\n using object_define_own_prop_correct. apply~ red_spec_object_put_5_return.\n apply~ follows_correct.\n apply~ red_spec_object_put_2_false. apply~ out_error_or_void_correct.\nQed.\n\nLemma prim_value_put_correct : forall runs S C w x v str o,\n runs_type_correct runs ->\n prim_value_put runs S C w x v str = o ->\n red_expr S C (spec_prim_value_put w x v str) o.\nProof.\n introv IH HR. unfolds in HR.\n run red_spec_prim_value_put using to_object_correct.\n applys* red_spec_prim_value_put_1.\n applys* object_put_complete_correct.\nQed.\n\n\n\n(*************************************************************)\n\nLemma env_record_get_binding_value_correct : forall runs S C L rn rs o,\n runs_type_correct runs ->\n env_record_get_binding_value runs S C L rn rs = o ->\n red_expr S C (spec_env_record_get_binding_value L rn rs) o.\nProof.\n introv IH HR. unfolds in HR.\n run_simpl. forwards B: @pick_option_correct (rm E).\n applys~ red_spec_env_record_get_binding_value B. destruct x.\n run_simpl. rewrite <- Heap.binds_equiv_read_option in E. destruct x as [mu v].\n cases_if.\n applys~ red_spec_env_record_get_binding_value_1_decl_uninitialized E.\n apply~ out_error_or_cst_correct.\n applys~ red_spec_env_record_get_binding_value_1_decl_initialized E.\n run_inv. apply~ red_spec_returns.\n run red_spec_env_record_get_binding_value_1_object using object_has_prop_correct.\n cases_if; run_inv.\n apply~ red_spec_env_record_get_binding_value_obj_2_true.\n applys~ run_object_get_correct HR.\n apply~ red_spec_env_record_get_binding_value_obj_2_false.\n applys~ out_error_or_cst_correct HR.\nQed.\n\n\nLemma throw_result_run_error_correct : forall runs S C ne T (y:specret T),\n runs_type_correct runs ->\n throw_result (run_error S ne) = result_some y ->\n red_spec S C (spec_error_spec ne) y.\nProof.\n introv IH HR. unfolds throw_result.\n lets ([|y1]&E&K): if_result_some_out (rm HR); tryfalse_nothing. run_inv.\n lets (E2&Ab): run_error_correct' (rm E).\n applys* red_spec_error_spec.\n abort.\nQed.\n\n\nLemma ref_kind_env_record_inv : forall r,\n ref_kind_of r = ref_kind_env_record ->\n exists L, ref_base r = ref_base_type_env_loc L.\nProof.\n introv E. unfolds ref_kind_of.\n destruct (ref_base r).\n destruct v; tryfalse. destruct p; tryfalse.\n exists___*.\nQed.\n\nLemma ref_kind_base_object_inv : forall r,\n (ref_kind_of r = ref_kind_primitive_base \\/\n ref_kind_of r = ref_kind_object) ->\n exists v, ref_base r = ref_base_type_value v.\nProof.\n introv E. unfolds ref_kind_of.\n destruct E; destruct (ref_base r); tryfalse;\n destruct v; tryfalse; try solve [exists___*].\nQed.\n\n\nLemma ref_get_value_correct : forall runs S C rv y,\n runs_type_correct runs ->\n ref_get_value runs S C rv = result_some y ->\n red_spec S C (spec_get_value rv) y.\nProof.\n introv IH HR. unfolds in HR. destruct rv; tryfalse.\n run_inv. applys* red_spec_ref_get_value_value.\n let_name as M.\n asserts M_correct: (\n ( ref_kind_of r = ref_kind_primitive_base\n \\/ ref_kind_of r = ref_kind_object) ->\n M tt = result_some y ->\n red_spec S C (spec_get_value r) y).\n clear HR. introv EQ HR. subst M.\n asserts: (ref_is_property r). unfolds. destruct* EQ.\n lets (v&Ev): ref_kind_base_object_inv EQ. rewrite Ev in HR.\n unfolds ref_has_primitive_base. case_if.\n run* red_spec_ref_get_value_ref_b_has_primitive_base using prim_value_get_correct.\n applys* red_spec_ref_get_value_ref_b_1.\n destruct EQ; tryfalse. destruct v as [|l]; tryfalse.\n run* red_spec_ref_get_value_ref_b_has_not_primitive_base using run_object_get_correct.\n applys* red_spec_ref_get_value_ref_b_1.\n clear EQM.\n sets_eq k: (ref_kind_of r). destruct k; tryfalse.\n (* case undef *)\n applys* red_spec_ref_get_value_ref_a. unfolds*.\n applys* throw_result_run_error_correct.\n (* case prim *)\n applys* M_correct.\n (* case object *)\n applys* M_correct.\n (* case env_record *)\n lets (L&EQL): ref_kind_env_record_inv (sym_eq EQk).\n rewrite EQL in HR.\n run* red_spec_ref_get_value_ref_c using env_record_get_binding_value_correct.\n applys* red_spec_ref_get_value_ref_c_1.\nAdmitted. (*faster*)\n\n\nLemma object_put_correct : forall runs S C l x v str o,\n runs_type_correct runs ->\n object_put runs S C l x v str = o ->\n red_expr S C (spec_object_put l x v str) o.\nProof.\n introv IH HR. unfolds in HR.\n run. applys red_spec_object_put. apply* run_object_method_correct.\n applys* object_put_complete_correct.\nAdmitted. (*faster*)\n\nLemma env_record_set_mutable_binding_correct : forall runs S C L x v str o,\n runs_type_correct runs ->\n env_record_set_mutable_binding runs S C L x v str = o ->\n red_expr S C (spec_env_record_set_mutable_binding L x v str) o.\nProof.\n introv IH HR. unfolds in HR.\n run_simpl. forwards B: @pick_option_correct (rm E).\n applys~ red_spec_env_record_set_mutable_binding B. destruct x0.\n run_simpl. rewrite <- Heap.binds_equiv_read_option in E. destruct x0 as [mu ?].\n cases_if; run_inv.\n applys~ red_spec_env_record_set_mutable_binding_1_decl_mutable E.\n apply~ red_spec_returns.\n applys~ red_spec_env_record_set_mutable_binding_1_decl_non_mutable E.\n apply~ out_error_or_void_correct.\n apply~ red_spec_env_record_set_mutable_binding_1_object.\n applys~ object_put_correct HR.\nQed.\n\n\nLemma ref_is_property_from_not_unresolvable_value : forall r v,\n ~ ref_is_unresolvable r ->\n ref_base r = ref_base_type_value v ->\n ref_is_property r.\nProof.\n introv N E. unfolds ref_is_property, ref_is_unresolvable, ref_kind_of.\n destruct (ref_base r); tryfalse. destruct* v0. destruct* p.\nAdmitted. (* faster *)\n\n\nLemma ref_put_value_correct : forall runs S C rv v o,\n runs_type_correct runs ->\n ref_put_value runs S C rv v = o ->\n red_expr S C (spec_put_value rv v) o.\nProof.\n introv IH HR. unfolds in HR.\n destruct rv; tryfalse.\n applys* red_spec_ref_put_value_value.\n case_if.\n case_if.\n applys~ red_spec_ref_put_value_ref_a_1.\n applys* run_error_correct.\n applys~ red_spec_ref_put_value_ref_a_2.\n applys* object_put_correct.\n case_if.\n cases (ref_base r); tryfalse.\n case_if; destruct v0; tryfalse.\n applys* red_spec_ref_put_value_ref_b_has_primitive_base.\n applys* prim_value_put_correct.\n applys* red_spec_ref_put_value_ref_b_has_not_primitive_base.\n applys* object_put_correct.\n cases (ref_base r); tryfalse.\n applys* red_spec_ref_put_value_ref_c.\n applys* env_record_set_mutable_binding_correct.\nAdmitted. (* faster *)\n\n\nLemma run_expr_get_value_correct : forall runs S C e y,\n runs_type_correct runs ->\n run_expr_get_value runs S C e = result_some y ->\n red_spec S C (spec_expr_get_value e) y.\nProof.\n introv IH HR. unfolds in HR.\n run red_spec_expr_get_value.\n applys* red_spec_expr_get_value_1.\n applys* ref_get_value_correct.\nAdmitted. (* faster *)\n\n\nLtac run_select_proj_extra_ref HT ::=\n match HT with\n | object_put => constr:(object_put_correct)\n | ref_put_value => constr:(ref_put_value_correct)\n | run_expr_get_value => constr:(run_expr_get_value_correct)\n | object_define_own_prop => constr:(object_define_own_prop_correct)\n end.\n\nLemma env_record_create_mutable_binding_correct : forall runs S C L x deletable_opt o,\n runs_type_correct runs ->\n env_record_create_mutable_binding runs S C L x deletable_opt = o ->\n red_expr S C (spec_env_record_create_mutable_binding L x deletable_opt) o.\nProof.\n introv IH HR. unfolds in HR. let_simpl.\n run_simpl. forwards B: @pick_option_correct (rm E).\n applys~ red_spec_env_record_create_mutable_binding B.\n destruct x0.\n cases_if; run_inv. let_simpl. run_inv.\n apply~ red_spec_env_record_create_mutable_binding_1_decl_indom.\n run red_spec_env_record_create_mutable_binding_1_object\n using object_has_prop_correct. cases_if. let_simpl.\n run* red_spec_env_record_create_mutable_binding_obj_2.\n apply~ red_spec_env_record_create_mutable_binding_obj_3.\nQed.\n\nLemma env_record_create_set_mutable_binding_correct : forall runs S C L x deletable_opt v str o,\n runs_type_correct runs ->\n env_record_create_set_mutable_binding runs S C L x deletable_opt v str = o ->\n red_expr S C (spec_env_record_create_set_mutable_binding L x deletable_opt v str) o.\nProof.\n introv IH HR. unfolds in HR.\n run red_spec_env_record_create_set_mutable_binding\n using env_record_create_mutable_binding_correct.\n forwards: env_record_set_mutable_binding_correct IH (rm HR).\n apply~ red_spec_env_record_create_set_mutable_binding_1.\nQed.\n\nLemma env_record_create_immutable_binding_correct : forall S C L x o,\n env_record_create_immutable_binding S L x = o ->\n red_expr S C (spec_env_record_create_immutable_binding L x) o.\nProof.\n introv HR. unfolds in HR.\n run_simpl. forwards B: @pick_option_correct (rm E).\n destruct x0; tryfalse. cases_if. run_inv.\n applys~ red_spec_env_record_create_immutable_binding B.\nQed.\n\nLemma env_record_initialize_immutable_binding_correct : forall S C L x v o,\n env_record_initialize_immutable_binding S L x v = o ->\n red_expr S C (spec_env_record_initialize_immutable_binding L x v) o.\nProof.\n introv HR. unfolds in HR.\n run. forwards B: @pick_option_correct (rm E). destruct x0; tryfalse.\n run. forwards B': @pick_option_correct (rm E). cases_if. let_simpl. run_inv. substs.\n applys~ red_spec_env_record_initialize_immutable_binding B B'.\nQed.\n\n(************************************************************)\n(* Treatement of [spec_expr_get_value_conv] *)\n\nDefinition if_spec_ter_post_bool (K:state->bool->result) o (y:specret value) :=\n (y = specret_out o /\\ abort o)\n \\/ (exists S, exists (b:bool), y = specret_val S (value_prim b)\n /\\ K S b = o).\n\nLtac run_post_if_spec_ter_post_bool H := (* todo: integrate into run_post *)\n let Ab := fresh \"Ab\" in\n let Eq := fresh \"Eq\" in\n let S1 := fresh \"S\" in\n let b := fresh \"b\" in\n let O1 := fresh \"O1\" in\n destruct H as [(Er&Ab)|(S1&b&O1&H)];\n [ try abort | try subst_hyp O1 ].\n\nLemma if_spec_post_to_bool : forall (K:state->bool->result) S C e o y1,\n red_spec S C (spec_expr_get_value e) y1 ->\n if_spec_post\n (fun S v => 'let b := convert_value_to_boolean v in K S b) (specret_out o) y1 ->\n exists y2,\n red_spec S C (spec_expr_get_value_conv spec_to_boolean e) y2\n /\\ if_spec_ter_post_bool K o y2.\nProof.\n introv HR HP. run_post.\n exists y1. splits.\n subst. apply* red_spec_expr_get_value_conv. abort.\n subst. left. splits; run_inv; auto~.\n exists (specret_val S1 (value_prim (convert_value_to_boolean a))). splits.\n applys* red_spec_expr_get_value_conv.\n applys* red_spec_expr_get_value_conv_1.\n applys* red_spec_to_boolean.\n applys* red_spec_expr_get_value_conv_2.\n right. exists S1 __. split. reflexivity. auto.\nQed.\n\n(* LATER: avoid the copy-paste, and rename the tactic *)\n\nDefinition if_spec_ter_post_object (K:state->object_loc->result) o (y:specret value) :=\n (y = specret_out o /\\ abort o)\n \\/ (exists S, exists (l:object_loc), y = specret_val S (value_object l)\n /\\ K S l = o).\n\n\nLemma if_spec_post_to_object : forall (K:state->object_loc->result) S C e o y1,\n red_spec S C (spec_expr_get_value e) y1 ->\n if_spec_post\n (fun S v => if_object (to_object S v) K) (specret_out o) y1 ->\n exists y2,\n red_spec S C (spec_expr_get_value_conv spec_to_object e) y2\n /\\ if_spec_ter_post_object K o y2.\nProof.\n introv HR HP. run_post.\n exists y1. splits.\n subst. apply* red_spec_expr_get_value_conv. abort.\n subst. left. splits; run_inv; auto~.\n run_pre. lets*: to_object_correct C (rm R1). run_post.\n subst. exists (specret_out (T:=value) o1). split.\n applys* red_spec_expr_get_value_conv.\n applys* red_spec_expr_get_value_conv_1. abort.\n left. splits~.\n exists (specret_val S0 (value_object l)). split.\n applys* red_spec_expr_get_value_conv.\n applys* red_spec_expr_get_value_conv_1.\n applys* red_spec_expr_get_value_conv_2.\n right. exists___*.\nQed.\n\n\nDefinition lift2 T (C:T->value) y :=\n match y with\n | specret_val S' (x1,x2) => specret_val S' (C x1, C x2)\n | specret_out o => specret_out o\n end.\n\n\nLemma convert_twice_primitive_correct : forall runs S C v1 v2 y,\n runs_type_correct runs ->\n convert_twice_primitive runs S C v1 v2 = result_some y ->\n red_spec S C (spec_convert_twice (spec_to_primitive_auto v1) (spec_to_primitive_auto v2)) (lift2 value_prim y).\nProof.\n introv IH HR. unfolds in HR. unfolds in HR.\n run red_spec_convert_twice.\n run red_spec_convert_twice_1.\n unfolds lift2. applys red_spec_convert_twice_2.\nAdmitted. (*faster*)\n\n\nLemma convert_twice_number_correct : forall runs S C v1 v2 y,\n runs_type_correct runs ->\n convert_twice_number runs S C v1 v2 = result_some y ->\n red_spec S C (spec_convert_twice (spec_to_number v1) (spec_to_number v2)) (lift2 (fun n=>n:value) y).\nProof.\n introv IH HR. unfolds in HR. unfolds in HR.\n run red_spec_convert_twice.\n run red_spec_convert_twice_1.\n unfolds lift2. applys red_spec_convert_twice_2.\nAdmitted. (*faster*)\n\nLemma convert_twice_string_correct : forall runs S C v1 v2 y,\n runs_type_correct runs ->\n convert_twice_string runs S C v1 v2 = result_some y ->\n red_spec S C (spec_convert_twice (spec_to_string v1) (spec_to_string v2)) (lift2 (fun s=>s:value) y).\nProof.\n introv IH HR. unfolds in HR. unfolds in HR.\n run red_spec_convert_twice.\n run red_spec_convert_twice_1.\n unfolds lift2. applys red_spec_convert_twice_2.\nAdmitted. (*faster*)\n\nLemma get_puremath_op_correct : forall op F,\n get_puremath_op op = Some F ->\n puremath_op op F.\nProof.\n Hint Constructors puremath_op.\n introv HR. destruct op; simpls; inverts* HR.\nAdmitted. (*faster*)\n\nLemma get_inequality_op_correct : forall op b1 b2,\n get_inequality_op op = Some (b1,b2) ->\n inequality_op op b1 b2.\nProof.\n Hint Constructors inequality_op.\n introv HR. destruct op; simpls; inverts* HR.\nAdmitted. (*faster*)\n\nLemma get_shift_op_correct : forall op F b,\n get_shift_op op = Some (b,F) ->\n shift_op op b F.\nProof.\n Hint Constructors shift_op.\n introv HR. destruct op; simpls; inverts* HR.\nAdmitted. (*faster*)\n\nLemma get_bitwise_op_correct : forall op F,\n get_bitwise_op op = Some F ->\n bitwise_op op F.\nProof.\n Hint Constructors bitwise_op.\n introv HR. destruct op; simpls; inverts* HR.\nAdmitted. (*faster*)\n\n\n(**************************************************************)\n\nLemma run_object_get_own_prop_correct : forall runs S C l x y,\n runs_type_correct runs ->\n run_object_get_own_prop runs S C l x = result_some y ->\n red_spec S C (spec_object_get_own_prop l x) y.\nProof.\n introv IH HR. unfolds in HR. run.\n applys* red_spec_object_get_own_prop.\n applys* run_object_method_correct. clear E.\n let_name as M. asserts M_correct: (forall S y,\n M S = result_some y ->\n red_spec S C (spec_object_get_own_prop_1 builtin_get_own_prop_default l x) y).\n clears HR S. subst. introv HR. run.\n sets_eq <- Ao: (Heap.read_option x1 x).\n applys~ red_spec_object_get_own_prop_1_default. eexists. splits.\n applys run_object_method_correct E.\n rewrite~ EQAo.\n clear E. destruct Ao.\n applys* red_spec_object_get_own_prop_2_some_data.\n applys* red_spec_object_get_own_prop_2_none.\n clear EQM.\n destruct x0.\n (* default *)\n subst*.\n (* argument object *)\n run~ red_spec_object_get_own_prop_args_obj. destruct a as [|A]. (* LTAC ARTHUR: this [a] has been defined by tactics. *)\n inverts HR. applys~ red_spec_object_get_own_prop_args_obj_1_undef.\n run. forwards~ obpm: run_object_method_correct (rm E).\n run. subst. run~ red_spec_object_get_own_prop_args_obj_1_attrs.\n let_name. asserts Follow: (forall S A y,\n follow S A = result_some y ->\n red_spec S C (spec_args_obj_get_own_prop_4 A) y).\n introv RES. rewrite EQfollow in RES. inverts RES.\n apply~ red_spec_object_get_own_prop_args_obj_4.\n clear EQfollow. destruct a. (* LTAC ARTHUR: idem. *)\n apply* red_spec_object_get_own_prop_args_obj_2_undef.\n run~ red_spec_object_get_own_prop_args_obj_2_attrs using run_object_get_correct.\n destruct A as [Ad|]; tryfalse.\n apply~ red_spec_object_get_own_prop_args_obj_3.\n (* string *)\n run~ red_spec_object_get_own_prop_string. destruct a as [|A]. (* LTAC ARTHUR: this [a] has been defined by tactics. *)\n run red_spec_object_get_own_prop_string_1_undef using to_int32_correct.\n run red_spec_object_get_own_prop_string_2.\n cases_if.\n inverts HR. apply~ red_spec_object_get_own_prop_string_3_different.\n subst x. run_pre. forwards* (v&EQo&Opv): run_object_prim_value_correct. run_post.\n inverts Ab as Ab'; false. inverts H0. false Ab'. reflexivity.\n inverts EQo. applys~ red_spec_object_get_own_prop_string_3_same Opv.\n run~ red_spec_object_get_own_prop_string_4.\n let_name. apply~ red_spec_object_get_own_prop_string_5. cases_if.\n inverts HR. apply~ red_spec_object_get_own_prop_string_6_outofbounds. math.\n inverts HR. apply~ red_spec_object_get_own_prop_string_6_inbounds. math.\n inverts HR. apply~ red_spec_object_get_own_prop_string_1_attrs.\nAdmitted. (*faster*)\n\n\nLemma run_function_has_instance_correct : forall runs S C (lo lv : object_loc) o,\n runs_type_correct runs ->\n run_function_has_instance runs S lo lv = o ->\n red_expr S C (spec_function_has_instance_2 lv lo) o.\nProof.\n intros runs IH lo S C lv o HR. unfolds in HR. run_simpl.\n forwards~ M: run_object_method_correct (rm E).\n applys~ red_spec_function_has_instance_2 M.\n destruct x as [()|lproto]; tryfalse; run_inv.\n apply~ red_spec_function_has_instance_3_null.\n cases_if; run_inv.\n apply~ red_spec_function_has_instance_3_eq.\n apply~ red_spec_function_has_instance_3_neq.\n applys~ runs_type_correct_function_has_instance HR.\nQed.\n\n\nLemma run_object_has_instance_correct : forall runs S C B l v o,\n runs_type_correct runs ->\n run_object_has_instance runs S C B l v = result_some (specret_out o) ->\n red_expr S C (spec_object_has_instance_1 B l v) o.\nProof.\n introv IH HR. unfolds in HR. destruct B.\n destruct v.\n run_inv. applys* red_spec_object_has_instance_1_function_prim.\n run red_spec_object_has_instance_1_function_object\n using run_object_get_correct.\n destruct v.\n applys* red_spec_function_has_instance_1_prim.\n applys red_spec_function_has_instance_1_object.\n applys* runs_type_correct_function_has_instance.\n\n repeat run; apply run_object_method_correct in E;\n apply run_object_method_correct in E1; subst.\n apply red_spec_object_has_instance_after_bind.\n applys~ red_spec_function_has_instance_after_bind_1. eassumption. \n destruct x1. applys* red_spec_function_has_instance_after_bind_2_some.\n applys* runs_type_correct_object_has_instance.\n applys* red_spec_function_has_instance_after_bind_2_none.\nAdmitted. (* faster*)\n\n\nLemma run_binary_op_correct : forall runs S C (op : binary_op) v1 v2 o,\n runs_type_correct runs ->\n run_binary_op runs S C op v1 v2 = o ->\n red_expr S C (expr_binary_op_3 op v1 v2) o.\nProof.\n\n introv IH HR. unfolds in HR.\n (* Add *)\n case_if. subst.\n run red_expr_binary_op_add using convert_twice_primitive_correct.\n destruct a as [w1 w2]. case_if.\n run* red_expr_binary_op_add_1_string using convert_twice_string_correct.\n destruct a as [s1 s2]. run_inv.\n applys* red_expr_binary_op_add_string_1.\n run* red_expr_binary_op_add_1_number using convert_twice_number_correct.\n destruct a as [n1 n2]. run_inv.\n applys* red_expr_puremath_op_1.\n (* Puremath *)\n case_if. run.\n run red_expr_puremath_op using convert_twice_number_correct.\n applys* get_puremath_op_correct.\n destruct a as [n1 n2]. run_inv.\n applys* red_expr_puremath_op_1.\n (* Shiftop *)\n case_if. run. destruct x as [b F].\n lets M: red_expr_shift_op b. case_if; subst.\n run* M. applys* get_shift_op_correct.\n run red_expr_shift_op_1. applys* red_expr_shift_op_2.\n run* M. applys* get_shift_op_correct.\n run red_expr_shift_op_1. applys* red_expr_shift_op_2.\n (* bitwise *)\n case_if. run.\n run red_expr_bitwise_op. applys* get_bitwise_op_correct.\n run red_expr_bitwise_op_1. applys* red_expr_bitwise_op_2.\n (* inequality *)\n clear n H H0 H1.\n case_if. run. destruct x as [b1 b2].\n applys red_expr_inequality_op. applys* get_inequality_op_correct.\n run red_expr_inequality_op_1 using convert_twice_primitive_correct.\n destruct a as [w1 w2]. let_name. destruct p as [wa wb]. simpls.\n sets_eq wr: (inequality_test_primitive wa wb).\n run_inv. applys_eq* (>> red_expr_inequality_op_2 EQp EQwr) 1.\n fequals. case_if; case_if; case_if*; case_if*; case_if*; case_if*; case_if*; case_if*.\n (* instanceof *)\n case_if. subst.\n destruct v2.\n applys* red_expr_binary_op_instanceof_non_object.\n run. lets M: run_object_method_correct (rm E).\n destruct x.\n applys* red_expr_binary_op_instanceof_normal.\n simpls.\n applys* red_spec_object_has_instance.\n applys* run_object_has_instance_correct.\n applys* red_expr_binary_op_instanceof_non_instance.\n (* in *)\n case_if. subst. destruct v2.\n applys* red_expr_binary_op_in_non_object.\n run red_expr_binary_op_in_object.\n applys* red_expr_binary_op_in_1.\n applys* object_has_prop_correct.\n (* equal *)\n clear n n0 H. case_if. subst.\n applys* red_expr_binary_op_equal.\n applys* runs_type_correct_equal.\n (* disequal *)\n case_if. subst.\n run red_expr_binary_op_disequal.\n applys* red_expr_binary_op_disequal_1.\n (* strict equality *)\n case_if. subst.\n run_inv. applys* red_expr_binary_op_strict_equal.\n (* strict disequality *)\n case_if. subst.\n run_inv. applys* red_expr_binary_op_strict_disequal.\n (* coma *)\n case_if. subst.\n run_inv. applys* red_expr_binary_op_coma.\nAdmitted. (*faster*)\n\n(**************************************************************)\n(* Auxiliary results for [array_args_map_loop] *)\n\nLemma array_args_map_loop_no_abort : forall oes runs S o l C k,\n array_args_map_loop runs S C l oes k = o -> exists S', o = out_ter S' res_empty.\nProof.\n inductions oes; introv Hyp.\n\n + simpls. exists S. inverts~ Hyp. \n + simpls. run. eapply IHoes; eassumption.\nQed.\n\nLemma array_args_map_loop_correct : forall oes runs S S' l C k,\n array_args_map_loop runs S C l oes k = res_void S' ->\n red_expr S C (spec_call_array_new_3 l oes k) (out_ter S' l).\nProof.\n induction oes; introv Hyp.\n\n + simpls. inverts Hyp. apply red_spec_call_array_new_3_empty.\n + simpls. unfolds res_void. run. rename x into S''.\n apply pick_option_correct in E.\n applys~ red_spec_call_array_new_3_nonempty. exact E.\n jauto.\nQed.\n\n(**************************************************************)\n(* Auxiliary results for [spec_expr_get_value_conv] *)\n\nLemma run_construct_prealloc_correct : forall runs S C B args o,\n runs_type_correct runs ->\n run_construct_prealloc runs S C B args = o ->\n red_expr S C (spec_construct_prealloc B args) o.\nProof.\n introv IH HR. unfolds in HR.\n destruct B.\n (* prealloc_global *)\n discriminate.\n (* prealloc_global_eval *)\n discriminate.\n (* prealloc_global_parse_int *)\n discriminate.\n (* prealloc_global_parse_float *)\n discriminate.\n (* prealloc_global_is_finite *)\n discriminate.\n (* prealloc_global_is_nan *)\n discriminate.\n (* prealloc_global_decode_uri *)\n discriminate.\n (* prealloc_global_decode_uri_component *)\n discriminate.\n (* prealloc_global_encode_uri *)\n discriminate.\n (* prealloc_global_encode_uri_component *)\n discriminate.\n (* prealloc_object *)\n let_name. subst.\n applys* red_spec_call_object_new.\n applys* get_arg_correct_0.\n destruct (get_arg 0 args) as [p | l]; unfolds call_object_new; [destruct p | ]; simpls; repeat let_name; try destruct p as (l & S'); substs.\n inverts HR. applys* red_spec_call_object_new_1_null_or_undef.\n inverts HR. applys* red_spec_call_object_new_1_null_or_undef.\n applys* red_spec_call_object_new_1_prim.\n applys* to_object_correct.\n applys* red_spec_call_object_new_1_prim.\n applys* to_object_correct.\n applys* red_spec_call_object_new_1_prim.\n applys* to_object_correct.\n inverts HR. applys* red_spec_call_object_new_1_object. \n (* prealloc_object_get_proto_of *)\n discriminate.\n (* prealloc_object_get_own_prop_descriptor *)\n discriminate.\n (* prealloc_object_get_own_prop_name *)\n discriminate.\n (* prealloc_object_create *)\n discriminate.\n (* prealloc_object_define_prop *)\n discriminate.\n (* prealloc_object_define_props *)\n discriminate.\n (* prealloc_object_seal *)\n discriminate.\n (* prealloc_object_freeze *)\n discriminate.\n (* prealloc_object_prevent_extensions *)\n discriminate.\n (* prealloc_object_is_sealed *)\n discriminate.\n (* prealloc_object_is_frozen *)\n discriminate.\n (* prealloc_object_is_extensible *)\n discriminate.\n (* prealloc_object_keys *)\n discriminate.\n (* prealloc_object_keys_call *)\n discriminate.\n (* prealloc_object_proto *)\n discriminate.\n (* prealloc_object_proto_to_string *)\n discriminate.\n (* prealloc_object_proto_value_of *)\n discriminate.\n (* prealloc_object_proto_has_own_prop *)\n discriminate.\n (* prealloc_object_proto_is_prototype_of *)\n discriminate.\n (* prealloc_object_proto_prop_is_enumerable *)\n discriminate.\n (* prealloc_function *)\n discriminate. (* LATER *)\n (* prealloc_function_proto *)\n discriminate.\n (* prealloc_function_proto_to_string *)\n discriminate.\n (* prealloc_function_proto_apply *)\n discriminate.\n (* prealloc_function_proto_call *)\n discriminate.\n (* prealloc_function_proto_bind *)\n discriminate.\n (* prealloc_bool *)\n repeat let_name.\n applys* red_spec_construct_bool.\n apply get_arg_correct_0.\n applys* red_spec_to_boolean.\n destruct p as (l & S').\n inverts HR.\n applys* red_spec_construct_bool_1.\n substs~. \n (* prealloc_bool_proto *)\n discriminate.\n (* prealloc_bool_proto_to_string *)\n discriminate.\n (* prealloc_bool_proto_value_of *)\n discriminate.\n (* prealloc_number *)\n let_name. cases_if*.\n subst. repeat let_name. \n remember (object_alloc S O) as p.\n destruct p as (l & S1).\n inverts HR.\n applys* red_spec_construct_number_nil.\n applys* red_spec_construct_number_1. substs~.\n let_name. subst.\n run~ red_spec_construct_number_not_nil.\n applys~ get_arg_correct_0.\n repeat let_name.\n remember (object_alloc S0 O) as p.\n destruct p as (l & S1).\n inverts HR.\n applys* red_spec_construct_number_1.\n substs~.\n (* prealloc_number_proto *)\n discriminate.\n (* prealloc_number_proto_to_string *)\n discriminate.\n (* prealloc_number_proto_value_of *)\n discriminate.\n (* prealloc_number_proto_to_fixed *)\n discriminate.\n (* prealloc_number_proto_to_exponential *)\n discriminate.\n (* prealloc_number_proto_to_precision *)\n discriminate.\n\n (* prealloc_array *)\n repeat let_name. destruct p as (l & S'). repeat let_name.\n subst arg_len. destruct args. case_if*. \n\n applys~ red_spec_call_array_new_no_args. \n eapply red_spec_call_array_new_1; try eassumption. \n run. apply pick_option_correct in E.\n applys* red_spec_call_array_new_2.\n simpls. run. apply red_spec_call_array_new_3_empty.\n destruct args. case_if*. clear e.\n \n unfolds get_arg. unfolds nth_def. subst v. \n applys~ red_spec_call_array_new_single_arg.\n applys~ red_spec_call_array_new_single_allocate; try (subst; eassumption).\n\n destruct v0; [destruct p | ]; subst;\n try solve [run; rename x into S''; run; rename x into S'''; apply pick_option_correct in E; apply pick_option_correct in E0;\n apply (red_spec_call_array_new_single_not_prim_number S' S'') with (n := JsNumber.of_int 0); jauto;\n introv Heq; inverts Heq].\n \n run~ red_spec_call_array_new_single_prim_number. cases_if*.\n run; rename x into S''; apply pick_option_correct in E.\n applys~ red_spec_call_array_new_single_number_correct.\n applys~ red_spec_call_array_new_single_set_length.\n applys~ red_spec_call_array_new_single_number_incorrect.\n applys run_error_correct HR.\n \n cases_if*. eapply red_spec_call_array_new_multiple_args. reflexivity.\n eapply red_spec_call_array_new_1; try eassumption.\n run. apply pick_option_correct in E.\n applys* red_spec_call_array_new_2.\n remember (v1 :: args) as args'; clear dependent v1. \n run_pre. run_post; subst.\n apply array_args_map_loop_no_abort in R1.\n destruct R1 as (S'' & Heq_o'). subst. inverts Ab.\n false~ H0. inverts HR.\n eapply array_args_map_loop_correct. eassumption.\n\n (* prealloc_array_is_array *)\n discriminate.\n (* prealloc_array_proto *)\n discriminate.\n (* prealloc_array_proto_to_string *)\n discriminate.\n (* prealloc_array_proto_join *)\n discriminate.\n (* prealloc_array_proto_pop *)\n discriminate.\n (* prealloc_array_proto_push *)\n discriminate.\n (* prealloc_string *)\n repeat let_name.\n cases_if*. subst.\n symmetry in EQarg_len. apply length_zero_inv in EQarg_len. subst.\n apply red_spec_construct_string_empty. \n let_name.\n match goal with H: context [object_alloc ?s ?o] |- _ => sets_eq X: (object_alloc s o) end.\n destruct X as (l & S'). let_name. subst.\n run. rename x into S''. apply pick_option_correct in E.\n remember (object_with_primitive_value\n (object_with_get_own_property\n (object_new prealloc_string_proto \"String\")\n builtin_get_own_prop_string) \"\") as O.\n applys* red_spec_construct_string_2; substs~.\n applys* red_spec_construct_string_non_empty.\n subst. destruct args; jauto; discriminate.\n apply get_arg_correct_0. subst.\n run red_spec_construct_string_1 using to_string_correct.\n let_name.\n match goal with H: context [object_alloc ?s ?o] |- _ => sets_eq X: (object_alloc s o) end.\n destruct X as (l & S'). let_name. subst.\n run. rename x into S''. apply pick_option_correct in E.\n remember (object_with_primitive_value\n (object_with_get_own_property\n (object_new prealloc_string_proto \"String\")\n builtin_get_own_prop_string) \"\") as O.\n applys* red_spec_construct_string_2; substs~.\n (* prealloc_string_proto *)\n discriminate.\n (* prealloc_string_proto_to_string *)\n discriminate.\n (* prealloc_string_proto_value_of *)\n discriminate.\n (* prealloc_string_proto_char_at *)\n discriminate.\n (* prealloc_string_proto_char_code_at *)\n discriminate.\n (* prealloc_math *)\n discriminate.\n (* prealloc_mathop *)\n discriminate.\n (* prealloc_date *)\n discriminate.\n (* prealloc_regexp *)\n discriminate.\n (* prealloc_error *)\n let_name. apply~ red_spec_construct_error.\n apply~ get_arg_correct_0.\n substs. apply* build_error_correct. \n (* prealloc_error_proto *)\n discriminate.\n (* prealloc_native_error *) \n let_name. apply~ red_spec_construct_native_error.\n apply~ get_arg_correct_0.\n substs. apply* build_error_correct.\n (* prealloc_native_error_proto *)\n discriminate. (* TODO *)\n (* prealloc_error_proto_to_string *)\n discriminate.\n (* prealloc_throw_type_error *)\n discriminate.\n (* prealloc_json *)\n discriminate.\nAdmitted. (*faster*)\n\nLemma run_construct_default_correct : forall runs S C l args o,\n runs_type_correct runs ->\n run_construct_default runs S C l args = res_out o ->\n red_expr S C (spec_construct_default l args) o.\nProof.\n introv IH HR. unfolds in HR.\n run red_spec_construct_default using run_object_get_correct.\n let_simpl. let_simpl. let_name. destruct p as [l' S2].\n run* red_spec_construct_default_1. rewrite* EQp. case_if; case_if*.\n let_simpl. run_inv.\n applys* red_spec_function_construct_2. case_if; case_if*.\nAdmitted. (*faster*)\n\nLemma run_construct_correct : forall runs S C co l args o,\n runs_type_correct runs ->\n run_construct runs S C co l args = o ->\n red_expr S C (spec_construct_1 co l args) o.\nProof.\n introv IH HR. unfolds in HR.\n destruct co.\n applys* red_spec_construct_1_default. applys* run_construct_default_correct.\n\n repeat run. apply run_object_method_correct in E. \n apply run_object_method_correct in E1; subst.\n applys* red_spec_construct_1_after_bind.\n destruct x1. repeat run. let_name. \n apply run_object_method_correct in E0; subst. \n applys* red_spec_construct_1_after_bind_1_some.\n applys* runs_type_correct_construct.\n applys* red_spec_construct_1_after_bind_1_none.\n\n applys* red_spec_construct_1_prealloc. applys* run_construct_prealloc_correct.\nAdmitted. (* faster *)\n\n\nLemma creating_function_object_proto_correct : forall runs S C l o,\n runs_type_correct runs ->\n creating_function_object_proto runs S C l = o ->\n red_expr S C (spec_creating_function_object_proto l) o.\nProof.\n introv IH HR. unfolds in HR.\n run red_spec_creating_function_object_proto\n using run_construct_prealloc_correct.\n let_simpl. run red_spec_creating_function_object_proto_1.\n let_simpl. applys* red_spec_creating_function_object_proto_2. run_hyp*.\nAdmitted. (* faster *)\n\n\nLemma creating_function_object_correct : forall runs S C names bd X str o,\n runs_type_correct runs ->\n creating_function_object runs S C names bd X str = o ->\n red_expr S C (spec_creating_function_object names bd X str) o.\nProof.\n introv IH HR. unfolds in HR.\n let_simpl. let_simpl. let_simpl. let_simpl. let_name. destruct p as [l S1].\n let_simpl. run* red_spec_creating_function_object.\n run red_spec_creating_function_object_1\n using creating_function_object_proto_correct.\n case_if; destruct str; tryfalse.\n run_inv. applys* red_spec_creating_function_object_2_not_strict.\n let_simpl. let_simpl.\n run* red_spec_creating_function_object_2_strict. clear EQp.\n run* red_spec_creating_function_object_3.\n applys* red_spec_creating_function_object_4.\nAdmitted. (* faster*)\n\n\nLemma env_record_has_binding_correct : forall runs S C L x o,\n runs_type_correct runs ->\n env_record_has_binding runs S C L x = o ->\n red_expr S C (spec_env_record_has_binding L x) o.\nProof.\n introv IH HR. unfolds in HR. run_simpl.\n forwards B: @pick_option_correct (rm E).\n applys~ red_spec_env_record_has_binding B. destruct x0; run_inv.\n apply~ red_spec_env_record_has_binding_1_decl.\n rewrite decide_def; auto.\n apply~ red_spec_env_record_has_binding_1_object.\n apply* object_has_prop_correct.\nQed.\n\n\nLemma binding_inst_function_decls_correct : forall runs S C args L fds str bconfig o,\n runs_type_correct runs ->\n binding_inst_function_decls runs S C L fds str bconfig = o ->\n red_expr S C (spec_binding_inst_function_decls args L fds str bconfig) o.\nProof.\n introv IH HR. gen S o. induction fds; introv HR.\n simpls. run_inv. applys* red_spec_binding_inst_function_decls_nil.\n simpls. let_name. let_name. let_name. let_name.\n run (@red_spec_binding_inst_function_decls_cons str_fd)\n using creating_function_object_correct. subst*. subst*. clear R1.\n let_name as M. rename a into fd. rename l into fo.\n asserts M_correct: (forall S o,\n M S = o ->\n red_expr S C (spec_binding_inst_function_decls_5 args L fd fds str fo bconfig) o).\n clears HR S o. introv HR. subst M.\n subst fname. run red_spec_binding_inst_function_decls_5\n using env_record_set_mutable_binding_correct.\n applys* red_spec_binding_inst_function_decls_6.\n clear EQM.\n subst fname. run red_spec_binding_inst_function_decls_1\n using env_record_has_binding_correct.\n case_if; subst.\n case_if; try subst L.\n run red_spec_binding_inst_function_decls_2_true_global\n using run_object_get_prop_correct.\n destruct a; tryfalse. case_if.\n let_name. run* red_spec_binding_inst_function_decls_3_true.\n applys* red_spec_binding_inst_function_decls_4.\n applys red_spec_binding_inst_function_decls_3_false.\n destruct (attributes_configurable a); tryfalse; auto. (* LATER: cleanup *)\n case_if.\n applys* red_spec_binding_inst_function_decls_3a_type_error.\n applys* red_spec_binding_inst_function_decls_3a_no_error.\n applys* red_spec_binding_inst_function_decls_2_true.\n run red_spec_binding_inst_function_decls_2_false\n using env_record_create_mutable_binding_correct.\n applys* red_spec_binding_inst_function_decls_4.\nAdmitted. (* faster *)\n\n\nLemma binding_inst_var_decls_correct : forall runs S C L vds bconfig str o,\n runs_type_correct runs ->\n binding_inst_var_decls runs S C L vds bconfig str = o ->\n red_expr S C (spec_binding_inst_var_decls L vds bconfig str) o.\nProof.\n introv IH HR. gen S o. induction vds; introv HR.\n simpls. run_inv. applys* red_spec_binding_inst_var_decls_nil.\n simpls. let_simpl.\n run red_spec_binding_inst_var_decls_cons\n using env_record_has_binding_correct.\n case_if; subst.\n applys* red_spec_binding_inst_var_decls_1_true.\n run red_spec_binding_inst_var_decls_1_false\n using env_record_create_set_mutable_binding_correct.\n applys* red_spec_binding_inst_var_decls_2.\nAdmitted. (* faster *)\n\nLemma binding_inst_formal_params_correct : forall runs S C L args names str o,\n runs_type_correct runs ->\n binding_inst_formal_params runs S C L args names str = o ->\n red_expr S C (spec_binding_inst_formal_params args L names str) o.\nProof.\n introv IH HR. gen S args o. induction names; introv HR.\n simpls. run_inv. applys* red_spec_binding_inst_formal_params_empty.\n simpls.\n let_name. let_name.\n run (@red_spec_binding_inst_formal_params_non_empty v args')\n using env_record_has_binding_correct.\n subst v args'. destruct* args.\n let_name as M. asserts M_correct: (forall S o,\n M S = o ->\n red_expr S C (spec_binding_inst_formal_params_3 args' L a names str v) o).\n clears HR S o. introv HR. subst M.\n run red_spec_binding_inst_formal_params_3\n using env_record_set_mutable_binding_correct.\n applys* red_spec_binding_inst_formal_params_4.\n clear EQM.\n case_if; subst.\n applys* red_spec_binding_inst_formal_params_1_declared.\n run red_spec_binding_inst_formal_params_1_not_declared\n using env_record_create_mutable_binding_correct.\n applys* red_spec_binding_inst_formal_params_2.\nAdmitted. (* faster *)\n\n\nLemma make_arg_getter_correct : forall runs S C x X o,\n runs_type_correct runs ->\n make_arg_getter runs S C x X = o ->\n red_expr S C (spec_make_arg_getter x X) o.\nProof.\n introv IH HR. unfolds in HR.\n apply~ red_spec_make_arg_getter. applys~ creating_function_object_correct HR.\nQed.\n\nLemma make_arg_setter_correct : forall runs S C x X o,\n runs_type_correct runs ->\n make_arg_setter runs S C x X = o ->\n red_expr S C (spec_make_arg_setter x X) o.\nProof.\n introv IH HR. unfolds in HR.\n apply~ red_spec_make_arg_setter. applys~ creating_function_object_correct HR.\nQed.\n\nLemma arguments_object_map_loop_correct : forall runs S C l xs len args args' X str lmap xsmap o,\n runs_type_correct runs ->\n len = length args ->\n arguments_object_map_loop runs S C l xs len args X str lmap xsmap = o ->\n red_expr S C (spec_arguments_object_map_2 l xs (args ++ args') X str lmap xsmap (len - 1)) o.\nProof.\n introv IH EQlen HR. gen o args args' S xsmap. induction len; introv EQlen HR.\n simpls. apply~ red_spec_arguments_object_map_2_negative. math. cases_if.\n substs. inverts HR. apply~ red_spec_arguments_object_map_8_nil.\n run. let_name. inverts HR. forwards~ B: @pick_option_correct E.\n applys~ red_spec_arguments_object_map_8_cons B. substs*.\n unfolds in HR. fold arguments_object_map_loop in HR.\n let_name. destruct tdl as (rmlargs&largs).\n forwards EQargs: take_drop_last_spec EQtdl; [destruct args; tryfalse; discriminate|].\n forwards EQlargs: take_drop_last_length EQtdl; [destruct args; tryfalse; discriminate|].\n clear EQtdl. simpl in HR.\n let_name. let_name. asserts Loop: (forall S xsmap o,\n arguments_object_map_loop' S xsmap = o ->\n red_expr S C (spec_arguments_object_map_2 l xs (rmlargs ++ largs :: args') X str lmap xsmap (len - 1)) o).\n clear HR. introv RES. subst arguments_object_map_loop'. apply* IHlen. math.\n clear EQarguments_object_map_loop'.\n asserts_rewrite (Datatypes.S len - 1 = len). math.\n run~ red_spec_arguments_object_map_2_positive using object_define_own_prop_correct.\n clear HR. subst args. rew_app. applys~ ZNth_app_r ZNth_here. math.\n subst A. auto*.\n clear R1 EQA. cases_if.\n apply~ red_spec_arguments_object_map_3_next.\n apply~ nat_int_ge.\n rewrite EQargs. rew_app. apply~ Loop.\n let_name. asserts ZN: (ZNth len xs x).\n apply Nth_to_ZNth. forwards (x'&N): length_Nth_lt len xs. math.\n forwards EQx': Nth_to_nth_def \"\" N. subst x'. rewrite~ <- EQx in N.\n cases_if.\n applys~ red_spec_arguments_object_map_3_cont_next ZN.\n rewrite EQargs. rew_app. apply~ Loop.\n applys~ red_spec_arguments_object_map_3_cont_cont ZN.\n rew_logic in n0. destruct n0 as [? NI]. splits.\n destruct~ str; false.\n auto*.\n run red_spec_arguments_object_map_4 using make_arg_getter_correct.\n run red_spec_arguments_object_map_5 using make_arg_setter_correct.\n let_name. run~ red_spec_arguments_object_map_6.\n rewrite EQA' in R1. simpl in R1.\n simpl. auto*.\n apply~ red_spec_arguments_object_map_7.\n rewrite EQargs. rew_app. apply~ Loop.\nAdmitted. (* faster *)\n\nLemma arguments_object_map_correct : forall runs S C l xs args X str o,\n runs_type_correct runs ->\n arguments_object_map runs S C l xs args X str = o ->\n red_expr S C (spec_arguments_object_map l xs args X str) o.\nProof.\n introv IH HR. unfolds in HR.\n run red_spec_arguments_object_map using run_construct_prealloc_correct.\n apply~ red_spec_arguments_object_map_1.\n rewrite <- (app_nil_r args).\n apply* arguments_object_map_loop_correct; rew_app~.\nQed.\n\nLemma create_arguments_object_correct : forall runs S C lf xs args X str o,\n runs_type_correct runs ->\n create_arguments_object runs S C lf xs args X str = o ->\n red_expr S C (spec_create_arguments_object lf xs args X str) o.\nProof.\n introv IH HR. unfolds in HR. let_name. let_name. destruct p as [l S'].\n let_name. run* red_spec_create_arguments_object; try solve [ substs* ].\n clear EQA EQO EQp A. run red_spec_create_arguments_object_1\n using arguments_object_map_correct. cases_if.\n let_name. let_name.\n run* red_spec_create_arguments_object_2_strict; try solve [ substs* ].\n clear EQA. run red_spec_create_arguments_object_3.\n apply~ red_spec_create_arguments_object_4.\n let_name.\n run* red_spec_create_arguments_object_2_non_strict; try solve [ substs* ].\n clear EQA. apply~ red_spec_create_arguments_object_4.\nQed.\n\nLemma binding_inst_arg_obj_correct : forall runs S C lf p xs args L o,\n runs_type_correct runs ->\n binding_inst_arg_obj runs S C lf p xs args L = o ->\n red_expr S C (spec_binding_inst_arg_obj lf p xs args L) o.\nProof.\n introv IH HR. unfolds in HR. let_name.\n run~ red_spec_binding_inst_arg_obj using create_arguments_object_correct.\n cases_if.\n run red_spec_binding_inst_arg_obj_1_strict\n using env_record_create_immutable_binding_correct.\n apply~ red_spec_binding_inst_arg_obj_2.\n apply~ env_record_initialize_immutable_binding_correct.\n apply~ red_spec_binding_inst_arg_obj_1_not_strict.\n applys~ env_record_create_set_mutable_binding_correct HR.\nQed.\n\n\nLemma execution_ctx_binding_inst_correct : forall runs S C ct funco (p:prog) args o,\n runs_type_correct runs ->\n execution_ctx_binding_inst runs S C ct funco p args = o ->\n red_expr S C (spec_binding_inst ct funco p args) o.\nProof.\n introv IH HR. unfolds in HR.\n cases (execution_ctx_variable_env C); tryfalse. rename e into L.\n applys* red_spec_binding_inst. clears TEMP. let_simpl.\n let_name as M. asserts M_correct: (forall S xs o,\n M S xs = o ->\n red_expr S C (spec_binding_inst_3 ct funco p xs args L) o).\n clear HR S o. introv HR. subst M.\n let_name. let_name.\n run red_spec_binding_inst_3\n using binding_inst_function_decls_correct.\n subst bconfig. rewrite decide_def. auto.\n auto.\n applys red_spec_binding_inst_4.\n run red_spec_binding_inst_5 using env_record_has_binding_correct.\n let_name as N. asserts N_correct: (forall S o,\n N S = o ->\n red_expr S C (spec_binding_inst_8 p bconfig L) o).\n clear HR S o. introv HR. subst N.\n applys red_spec_binding_inst_8.\n applys* binding_inst_var_decls_correct.\n clear EQN.\n destruct ct.\n destruct funco.\n destruct b; tryfalse.\n applys* red_spec_binding_inst_6_no_arguments. rew_logic*.\n run red_spec_binding_inst_6_arguments\n using binding_inst_arg_obj_correct.\n applys* red_spec_binding_inst_7.\n destruct b; tryfalse.\n applys* red_spec_binding_inst_6_no_arguments. rew_logic*.\n applys* red_spec_binding_inst_6_no_arguments.\n rew_logic*. left. congruence.\n applys* red_spec_binding_inst_6_no_arguments.\n rew_logic*. left; congruence.\n destruct ct; destruct funco; tryfalse.\n run. lets H: run_object_method_correct (rm E).\n run. subst. run* red_spec_binding_inst_1_function\n using binding_inst_formal_params_correct.\n applys* red_spec_binding_inst_2.\n applys* red_spec_binding_inst_1_not_function. congruence.\n applys* red_spec_binding_inst_1_not_function. congruence.\nAdmitted. (* faster *)\n\n\nLemma entering_eval_code_correct : forall runs S C bdirect bd F K o,\n runs_type_correct runs ->\n entering_eval_code runs S C bdirect bd F = o ->\n (forall S' C' o', F S' C' = o' -> red_expr S' C' K o') ->\n red_expr S C (spec_entering_eval_code bdirect bd K) o.\nProof.\n introv IH HR HK. unfolds in HR.\n let_name. let_name.\n applys* red_spec_entering_eval_code str C'. case_if; case_if*.\n let_name. destruct p as [lex S'].\n let_name. let_name.\n run_pre. applys* red_spec_entering_eval_code_1 str lex S' C1 o1.\n rewrite EQp. case_if; case_if*.\n subst C1. case_if; case_if*.\n subst p. applys* execution_ctx_binding_inst_correct R1.\n run_post. clear R1.\n applys* red_spec_entering_eval_code_2.\nAdmitted. (* faster *)\n\n\nLemma run_eval_correct : forall runs S C (is_direct_call : bool) vs o,\n runs_type_correct runs ->\n run_eval runs S C is_direct_call vs = o ->\n red_expr S C (spec_call_global_eval is_direct_call vs) o.\nProof.\n introv IH HR. unfolds in HR.\n lets (v&H&E): arguments_from_spec_1 vs. rewrites (rm E) in *.\n applys* red_spec_call_global_eval (rm H).\n destruct v;\n [| run_inv; applys* red_spec_call_global_eval_1_not_string; simpl; congruence].\n destruct p; run_inv;\n try (applys* red_spec_call_global_eval_1_not_string; simpl; congruence).\n let_name. destruct (pick_option (parse s str)) eqn:P.\n forwards B: @pick_option_correct (rm P).\n applys* red_spec_call_global_eval_1_string_parse.\n applys* entering_eval_code_correct (rm HR).\n clear - IH. introv HR. run red_spec_call_global_eval_2.\n sets_eq RT: (res_type R). destruct RT; tryfalse.\n run. cases (res_value R); tryfalse; run_inv.\n applys* red_spec_call_global_eval_3_normal_empty.\n destruct R. simpls. subst.\n applys* red_spec_call_global_eval_3_normal_value.\n run_inv. applys* red_spec_call_global_eval_3_throw.\n applys red_spec_call_global_eval_1_string_not_parse.\n introv Pa. forwards (?&Par): @pick_option_defined (ex_intro _ p Pa).\n rewrite Par in P. false.\n applys run_error_correct HR.\nAdmitted. (*faster*)\n\nLemma run_list_expr_correct : forall runs S C es y,\n runs_type_correct runs ->\n run_list_expr runs S C nil es = result_some y ->\n red_spec S C (spec_list_expr es) y.\nProof.\n introv IH. cuts M: (forall es S C vs y,\n run_list_expr runs S C vs es = result_some y ->\n red_spec S C (spec_list_expr_1 (rev vs) es) y).\n intros HR. apply red_spec_list_expr. applys* M (@nil value).\n clears S C es y. intros es. induction es; introv HR.\n simpls. run_inv. applys* red_spec_list_expr_1_nil.\n simpls. run red_spec_list_expr_1_cons.\n applys red_spec_list_expr_2. forwards M: IHes HR.\n rew_list in M. auto.\nAdmitted. (*faster*)\n\n\nLemma run_call_default_correct : forall runs S C lf o,\n runs_type_correct runs ->\n run_call_default runs S C lf = o ->\n red_expr S C (spec_call_default_1 lf) o.\nProof.\n introv IH HR. unfolds in HR. let_simpl.\n run. applys* red_spec_call_default_1.\n applys* run_object_method_correct. clear E.\n destruct x.\n case_if.\n applys* red_spec_call_default_2_empty_body.\n run_inv. applys* red_spec_call_default_3_normal.\n run* red_spec_call_default_2_body.\n destruct R as [RT RV RL]; simpls. subst.\n applys red_spec_call_default_3_normal.\n destruct R as [RT RV RL]; simpls. subst.\n applys red_spec_call_default_3_return.\n subst. abort.\n applys* red_spec_call_default_2_empty_body.\n run_inv. applys* red_spec_call_default_3_normal.\nAdmitted. (* faster *)\n\n\nLemma env_record_implicit_this_value_correct : forall S C L v,\n env_record_implicit_this_value S L = Some v ->\n red_expr S C (spec_env_record_implicit_this_value L) (out_ter S v).\nProof.\n introv HR. unfolds in HR.\n run_simpl HR as H; tryfalse. inverts H. forwards B: @pick_option_correct (rm E).\n applys~ red_spec_env_record_implicit_this_value B. destruct n.\n applys~ red_spec_env_record_implicit_this_value_1_decl.\n applys~ red_spec_env_record_implicit_this_value_1_object.\nQed.\n\nLemma run_expr_call_correct : forall runs S C e1 e2s o,\n runs_type_correct runs ->\n run_expr_call runs S C e1 e2s = o ->\n red_expr S C (expr_call e1 e2s) o.\nProof.\n introv IH HR. unfolds in HR.\n let_name. run red_expr_call.\n run red_expr_call_1 using ref_get_value_correct.\n run red_expr_call_2 using run_list_expr_correct.\n destruct a.\n applys* red_expr_call_3.\n case_if.\n applys* red_expr_call_3_callable.\n rename o0 into l. rename a0 into vs.\n let_name as M. asserts M_correct: (forall S0 vthis o,\n M vthis = o ->\n red_expr S0 C (expr_call_5 l is_eval_direct vs (out_ter S3 vthis)) o).\n clear HR S o. introv HR. subst M.\n case_if.\n subst. applys red_expr_call_5_eval. applys* run_eval_correct.\n applys* red_expr_call_5_not_eval. apply* IH.\n clear EQM.\n subst. destruct rv; tryfalse.\n applys* red_expr_call_4_not_ref.\n cases (ref_base r).\n case_if. applys* red_expr_call_4_prop.\n run. applys* red_expr_call_4_env.\n applys* env_record_implicit_this_value_correct.\n (* other branch *)\n applys* red_expr_call_3.\nAdmitted. (*faster*)\n\nLtac run_select_proj_extra_construct HT ::=\n match HT with\n | run_construct_prealloc => constr:(run_construct_prealloc_correct)\n | run_construct => constr:(run_construct_correct)\n | run_call_default => constr:(run_call_default_correct)\n | creating_function_object_proto => constr:(creating_function_object_proto_correct)\n | creating_function_object => constr:(creating_function_object_correct)\n | run_list_expr => constr:(run_list_expr_correct)\n | execution_ctx_binding_inst => constr:(execution_ctx_binding_inst_correct)\n end.\n\n\n(**************************************************************)\n(** ** Property descriptors *)\n\nLemma from_prop_descriptor_correct : forall runs S0 S C D o,\n runs_type_correct runs ->\n from_prop_descriptor runs S C D = o ->\n red_expr S0 C (spec_from_descriptor (ret S D)) o.\nProof.\n introv IH HR. unfolds in HR. destruct D.\n run_inv. applys* red_spec_from_descriptor_undef.\n run* red_spec_from_descriptor_some.\n rename a into A.\n let_name as M. asserts M_correct: (forall S0 S b o,\n M S b = res_out o ->\n red_expr S0 C (spec_from_descriptor_4 l A (out_ter S b)) o).\n clear HR S o. introv HR. subst M.\n let_name. run* red_spec_from_descriptor_4. congruence.\n let_name. run* red_spec_from_descriptor_5. congruence.\n applys* red_spec_from_descriptor_6.\n clear EQM.\n destruct A.\n let_name. run* red_spec_from_descriptor_1_data. congruence.\n let_name. run red_spec_from_descriptor_2_data. congruence.\n applys* M_correct.\n let_name. run red_spec_from_descriptor_1_accessor. congruence.\n let_name. run red_spec_from_descriptor_3_accessor. congruence.\n applys* M_correct.\nAdmitted. (*faster*)\n\n\n(**************************************************************)\n(** ** Object Initialisation *)\n\nLemma create_new_function_in_correct : forall runs S C args bd o,\n runs_type_correct runs ->\n create_new_function_in runs S C args bd = o ->\n red_expr S C (spec_create_new_function_in C args bd) o.\nProof.\n introv IH HR. unfolds in HR. applys red_spec_create_new_function_in.\n applys* creating_function_object_correct.\nQed.\n\nLemma init_object_correct : forall runs S C l (pds : propdefs) o,\n runs_type_correct runs ->\n init_object runs S C l pds = o ->\n red_expr S C (expr_object_1 l pds) o.\nProof.\n introv IH. gen S. induction pds as [|(pn&pb) pds]; introv HR.\n simpls. run_inv. applys red_expr_object_1_nil.\n simpls. let_name. let_name.\n asserts follows_correct: (forall S Desc, follows S Desc = res_out o ->\n red_expr S C (expr_object_4 l x Desc pds) o).\n subst follows. clear HR. introv HR.\n run red_expr_object_4 using object_define_own_prop_correct.\n applys* red_expr_object_5.\n clear EQfollows.\n applys* red_expr_object_1_cons x.\n destruct pb.\n run red_expr_object_2_val.\n applys* red_expr_object_3_val.\n run red_expr_object_2_get using create_new_function_in_correct.\n applys* red_expr_object_3_get.\n run red_expr_object_2_set using create_new_function_in_correct.\n applys* red_expr_object_3_set.\nQed.\n\nLemma red_expr_array_3_object_loc_eq : forall ElementList S S' C l l' k,\n red_expr S C (expr_array_3 l ElementList k) (out_ter S' l') -> l = l'.\nProof.\n induction ElementList using (measure_induction length).\n destruct ElementList; introv Hyp.\n\n + inverts~ Hyp. inverts~ H0. \n\n + destruct o.\n - inverts Hyp. inverts H0. \n inverts H8. inverts H1. unfolds abrupt_res. false~ H4.\n inverts H10. inverts H1. unfolds abrupt_res. false~ H4.\n inverts H12. inverts H1. unfolds abrupt_res. false~ H4.\n inverts H13. inverts H1. unfolds abrupt_res. false~ H4.\n inverts H14. inverts H1. unfolds abrupt_res. false~ H4.\n specializes~ H H6. rew_length; nat_math.\n\n - inverts Hyp. inverts H0.\n specializes~ H H10. \n inverts H4.\n * rew_length; nat_math.\n * destruct H as (e & oes' & Heq). subst.\n rewrite H3. rew_length.\n destruct Elision. rewrite app_nil_l in H3.\n inverts H3. rew_length; nat_math.\nAdmitted. (*faster*)\n\nLemma run_array_element_list_correct : forall runs S C l oes o k,\n runs_type_correct runs ->\n run_array_element_list runs S C l oes k = o ->\n red_expr S C (expr_array_3 l oes k) o.\nProof.\n introv IH HR. gen runs S C l o. \n destruct oes; intros. \n\n + inverts HR. apply red_expr_array_3_nil.\n\n + destruct o.\n - unfolds run_array_element_list. \n let_name. subst. \n run~ red_expr_array_3_some_val; rename a into v.\n run~ red_expr_array_3_get_len using run_object_get_correct.\n run~ red_expr_array_3_convert_len.\n run~ red_expr_array_3_add_len.\n let_name. subst. run~ red_expr_array_3_def_own_prop.\n run red_expr_array_3_next. substs~. \n \n - simpls. let_name. \n eapply red_expr_array_3_none.\n * apply elision_head_decomposition. \n * jauto. * jauto. * jauto. \n * substs. applys* runs_type_correct_array_element_list. \nQed.\n\nLemma init_array_correct : forall runs S C l oes o,\n runs_type_correct runs ->\n init_array runs S C l oes = o ->\n red_expr S C (expr_array_1 l oes) o.\nProof.\n introv IH HR. unfolds in HR. let_name. let_name. \n apply red_expr_array_1 with (ElementList := ElementList) \n (Elision := list_repeat None ElisionLength) \n (ElisionLength := ElisionLength); \n try solve [try rewrite my_Z_of_nat_def; substs~]. \n \n run red_expr_array_2.\n eapply run_array_element_list_correct; eassumption.\n apply run_array_element_list_correct in R1; auto. \n apply red_expr_array_3_object_loc_eq in R1. subst l0.\n \n apply red_expr_array_add_length. \n run red_expr_array_add_length_0 using run_object_get_correct.\n run red_expr_array_add_length_1. run red_expr_array_add_length_2. \n run red_expr_array_add_length_3. apply red_expr_array_add_length_4.\nQed.\n\nLemma lexical_env_get_identifier_ref_correct : forall runs S C lexs x str y,\n runs_type_correct runs ->\n lexical_env_get_identifier_ref runs S C lexs x str = result_some y ->\n red_spec S C (spec_lexical_env_get_identifier_ref lexs x str) y.\nProof.\n introv IH. gen S C. induction lexs; introv HR.\n simpls. run_inv.\n applys* red_spec_lexical_env_get_identifier_ref_nil.\n simpls.\n applys red_spec_lexical_env_get_identifier_ref_cons.\n run red_spec_lexical_env_get_identifier_ref_cons_1 using env_record_has_binding_correct.\n cases_if; run_inv.\n apply~ red_spec_lexical_env_get_identifier_ref_cons_2_true.\n apply~ red_spec_lexical_env_get_identifier_ref_cons_2_false.\nQed.\n\nLemma run_typeof_value_correct : forall S v,\n run_typeof_value S v = typeof_value S v.\nProof. intros. destruct v; simpl. auto. case_if; case_if*. Qed.\n\nLtac run_select_proj_extra_get_value HT ::=\n match HT with\n | ref_get_value => constr:(ref_get_value_correct)\n end.\n\n\n(**************************************************************)\n(** ** Main theorem *)\n\nHint Extern 1 (regular_unary_op _) =>\n intros ?; false_invert.\n\nLemma prepost_op_correct : forall u F ispre,\n run_prepost_op u = Some (F,ispre) ->\n prepost_op u F ispre.\nProof.\n Hint Constructors prepost_op.\n introv HR. destruct u; simpls; inverts* HR.\nQed.\n\n\nLemma object_delete_default_correct : forall runs S C l x str o,\n runs_type_correct runs ->\n object_delete_default runs S C l x str = o ->\n red_expr S C (spec_object_delete_1 builtin_delete_default l x str) o.\nProof.\n introv IH HR. unfolds in HR. run red_spec_object_delete_1_default. destruct a.\n run_inv. applys red_spec_object_delete_2_undef. (* This rule is erroneous, the conclusion should contains [S0] instead [S]. *)\n case_if.\n run. forwards B: @pick_option_correct (rm E).\n applys_eq* red_spec_object_delete_2_some_configurable 1.\n applys* red_spec_object_delete_3_some_non_configurable.\n applys* out_error_or_cst_correct.\nQed.\n\nLemma object_delete_correct : forall runs S C l x str o,\n runs_type_correct runs ->\n object_delete runs S C l x str = o ->\n red_expr S C (spec_object_delete l x str) o.\nProof.\n introv IH HR. unfolds in HR. run. rename x0 into B. (* LTAC ARTHUR *)\n applys* red_spec_object_delete.\n applys* run_object_method_correct. clear E.\n destruct B.\n (* default *)\n applys~ object_delete_default_correct HR.\n (* argument object *)\n run. forwards* obpm: run_object_method_correct.\n run. substs. run~ red_spec_object_delete_args_obj.\n run red_spec_object_delete_args_obj_1 using object_delete_default_correct.\n cases_if. destruct a. (* LTAC ARTHUR *)\n apply~ red_spec_object_delete_args_obj_2_else.\n inverts HR. apply~ red_spec_object_delete_args_obj_4.\n run red_spec_object_delete_args_obj_2_if.\n apply~ red_spec_object_delete_args_obj_3.\n apply~ red_spec_object_delete_args_obj_4.\n apply~ red_spec_object_delete_args_obj_2_else.\n inverts HR. apply~ red_spec_object_delete_args_obj_4.\nQed.\n\n\nLemma env_record_delete_binding_correct : forall runs S C L x o,\n runs_type_correct runs ->\n env_record_delete_binding runs S C L x = o ->\n red_expr S C (spec_env_record_delete_binding L x) o.\nProof.\n introv IH HR. unfolds in HR.\n run_simpl. forwards B: @pick_option_correct (rm E).\n applys~ red_spec_env_record_delete_binding B. destruct x0.\n sets_eq <- ero E: (Heap.read_option d x). destruct ero as [[mu ?]|].\n rewrite <- Heap.binds_equiv_read_option in E. destruct mu; run_inv;\n applys~ red_spec_env_record_delete_binding_1_decl_indom E; case_if*.\n rewrite <- Heap.not_indom_equiv_read_option in E. run_inv.\n applys~ red_spec_env_record_delete_binding_1_decl_not_indom E.\n run. apply~ red_spec_env_record_delete_binding_1_object.\nQed.\n\n\nLemma identifier_resolution_correct : forall runs S C x y,\n runs_type_correct runs ->\n identifier_resolution runs S C x = result_some y ->\n red_spec S C (spec_identifier_resolution C x) y.\nProof.\n introv IH HR.\n unfolds spec_identifier_resolution, identifier_resolution.\n applys* lexical_env_get_identifier_ref_correct.\nQed.\n\nLemma run_expr_correct : forall runs S C e o,\n runs_type_correct runs ->\n run_expr runs S C e = o ->\n red_expr S C (expr_basic e) o.\nProof.\n introv IH R. unfolds in R.\n destruct e as [ | | | pds | oes | | | | | | | | | ].\n (* this *)\n run_inv. apply~ red_expr_this.\n (* identifier *)\n run_inv. run red_expr_identifier using identifier_resolution_correct.\n applys* red_expr_identifier_1.\n (* literal *)\n run_inv. apply~ red_expr_literal.\n (* object *)\n run red_expr_object using run_construct_prealloc_correct.\n applys red_expr_object_0.\n applys* init_object_correct.\n\n (* _ARRAYS_ *)\n run red_expr_array using run_construct_prealloc_correct.\n applys red_expr_array_0.\n applys* init_array_correct.\n\n (* function *)\n unfolds in R. destruct o0.\n let_name. destruct p as (lex'&S').\n destruct lex' as [|L lex']; simpls; tryfalse.\n run_simpl. forwards: @pick_option_correct (rm E).\n run* red_expr_function_named using env_record_create_immutable_binding_correct.\n run red_expr_function_named_1 using creating_function_object_correct.\n run red_expr_function_named_2 using env_record_initialize_immutable_binding_correct.\n apply~ red_expr_function_named_3.\n apply~ red_expr_function_unnamed. applys~ creating_function_object_correct IH.\n (* Access *)\n unfolds in R. run red_expr_access.\n run red_expr_access_1. cases_if.\n forwards [R1 N]: run_error_correct' C (rm R). applys red_expr_access_2.\n applys* red_spec_check_object_coercible_undef_or_null.\n abort.\n applys red_expr_access_2.\n applys* red_spec_check_object_coercible_return.\n run red_expr_access_3.\n applys* red_expr_access_4.\n (* member *)\n run_hyp R. apply~ red_expr_member.\n (* new *)\n unfolds in R. run red_expr_new.\n run red_expr_new_1.\n destruct a; tryfalse.\n applys* red_expr_new_2_type_error_not_object.\n run. lets M: run_object_method_correct (rm E).\n destruct x; tryfalse.\n applys red_expr_new_2_construct.\n applys* red_spec_constructor.\n applys* run_construct_correct.\n applys* red_expr_new_2_type_error_no_construct.\n (* call *)\n applys* run_expr_call_correct.\n (* unary operators *)\n unfolds in R. case_if as N.\n run* red_expr_prepost. run red_expr_prepost_1_valid.\n run red_expr_prepost_2. run. destruct x as [F ispre].\n let_simpl. let_name. lets: prepost_op_correct (rm E).\n run* red_expr_prepost_3. subst. applys* red_expr_prepost_4.\n destruct u; try solve [ false n; unfolds; do 2 eexists; constructors ].\n (* delete *)\n run red_expr_delete. destruct rv; run_inv.\n apply~ red_expr_delete_1_not_ref. intro; false_invert.\n apply~ red_expr_delete_1_not_ref. intro; false_invert.\n case_if; run_inv.\n apply~ red_expr_delete_1_ref_unresolvable. cases_if.\n apply~ red_expr_delete_2_strict. apply* run_error_correct.\n run_inv. apply~ red_expr_delete_2_not_strict.\n cases (ref_base r).\n run* red_expr_delete_1_ref_property using to_object_correct.\n apply* ref_is_property_from_not_unresolvable_value.\n apply~ red_expr_delete_3. runs~.\n rename e0 into L. apply* red_expr_delete_1_ref_env_record. cases_if.\n apply~ red_expr_delete_4_strict. apply* run_error_correct.\n apply~ red_expr_delete_4_not_strict. applys* env_record_delete_binding_correct.\n (* void *)\n run* red_expr_unary_op. applys red_expr_unary_op_1.\n applys* red_expr_unary_op_void.\n (* typeof *)\n run red_expr_typeof. destruct rv; tryfalse.\n applys* red_expr_typeof_1_value. run_inv. applys* red_expr_typeof_2.\n applys run_typeof_value_correct.\n case_if.\n run_inv. applys* red_expr_typeof_1_ref_unresolvable.\n run* red_expr_typeof_1_ref_resolvable.\n applys* red_expr_typeof_2.\n applys* run_typeof_value_correct.\n (* add *)\n run* red_expr_unary_op. applys red_expr_unary_op_1.\n applys red_expr_unary_op_add. run_hyp*.\n (* neg *)\n run* red_expr_unary_op. applys red_expr_unary_op_1.\n run red_expr_unary_op_neg. applys* red_expr_unary_op_neg_1.\n (* bitwise not *)\n run* red_expr_unary_op. applys red_expr_unary_op_1.\n run red_expr_unary_op_bitwise_not.\n applys* red_expr_unary_op_bitwise_not_1.\n (* not *)\n run* red_expr_unary_op. applys red_expr_unary_op_1.\n forwards* M: red_spec_to_boolean a.\n applys* red_expr_unary_op_not. applys* red_expr_unary_op_not_1.\n (* binary operators *)\n unfolds in R. rename b into op.\n lets: (is_lazy_op_correct op). cases (is_lazy_op op).\n run* red_expr_binary_op_lazy.\n let_name. applys* red_expr_lazy_op_1. applys* red_spec_to_boolean.\n case_if; subst; run_inv.\n applys* red_expr_lazy_op_2_first.\n run* red_expr_lazy_op_2_second.\n applys* red_expr_lazy_op_2_second_1.\n run* red_expr_binary_op.\n run red_expr_binary_op_1.\n applys* red_expr_binary_op_2.\n inverts R as M. applys* run_binary_op_correct M.\n (* conditionnal *)\n unfolds in R.\n run_pre. lets (y1&R2&K): if_spec_post_to_bool (rm R1) (rm R).\n applys* red_expr_conditional (rm R2). run_post_if_spec_ter_post_bool K.\n let_name. run red_expr_conditional_1. case_if in EQe; case_if*.\n applys* red_expr_conditional_2.\n (* assign *)\n unfolds in R. run red_expr_assign. let_name. rename rv into rv1.\n asserts follow_correct: (forall S0 S rv o, follow S rv = o ->\n exists v, rv = resvalue_value v /\\ red_expr S0 C (expr_assign_4 rv1 (ret S v)) o).\n subst follow. clear R. introv HR.\n destruct rv; tryfalse. exists v. split~.\n run red_expr_assign_4_put_value.\n applys* red_expr_assign_5_return.\n clear EQfollow.\n destruct o0.\n run red_expr_assign_1_compound using ref_get_value_correct.\n run red_expr_assign_2_compound_get_value.\n run red_expr_assign_3_compound_op using run_binary_op_correct.\n forwards (v&?&?): follow_correct (rm R). subst.\n applys* red_expr_assign_3'.\n run red_expr_assign_1_simple.\n forwards (v&?&?): follow_correct (rm R). run_inv. auto*.\nAdmitted. (*faster*)\n\n\n(* Hints for automatically applying \"run_hyp\" in obvious cases *)\nHint Extern 1 (red_stat ?S ?C ?s ?o) =>\n match goal with H: _ = result_some o |- _ => run_hyp H end.\nHint Extern 1 (red_expr ?S ?C ?s ?o) =>\n match goal with H: _ = result_some o |- _ => run_hyp H end.\n\n\nLemma run_var_decl_item_correct : forall runs S C x eo o,\n runs_type_correct runs ->\n run_var_decl_item runs S C x eo = o ->\n red_stat S C (stat_var_decl_item (x,eo)) o.\nProof.\n introv IH HR. unfolds in HR. destruct eo.\n run red_stat_var_decl_item_some using identifier_resolution_correct.\n run red_stat_var_decl_item_1. run red_stat_var_decl_item_2.\n applys* red_stat_var_decl_item_3.\n run_inv. applys* red_stat_var_decl_item_none.\nAdmitted. (* faster *)\n\nLemma run_var_decl_correct : forall runs S C ls o,\n runs_type_correct runs ->\n run_var_decl runs S C ls = o ->\n red_stat S C (stat_var_decl ls) o.\nProof.\n introv IH. gen S. induction ls as [|[x eo]]; introv HR.\n simpls. run_inv. applys* red_stat_var_decl_nil.\n simpls. run red_stat_var_decl_cons using run_var_decl_item_correct.\n applys* red_stat_var_decl_1.\nAdmitted. (* faster *)\n\n\nLemma run_elements_correct : forall runs S C str ls o,\n runs_type_correct runs ->\n run_elements runs S C ls = o ->\n red_prog S C (prog_intro str (rev ls)) o.\nProof.\n introv IH HR. gen S C str o.\n induction ls; introv HR; unfolds in HR; rew_list.\n run_inv. applys* red_prog_nil.\n run_pre. eauto. applys* red_prog_cons. run_post. clear R1.\n (* run* red_prog_cons. ==> LATER: should work*)\n destruct a.\n run red_prog_1_stat. applys* red_prog_2.\n run_inv. applys red_prog_1_funcdecl.\nAdmitted. (*faster*)\n\n\nLemma run_block_correct : forall runs S C ls o,\n runs_type_correct runs ->\n run_block runs S C ls = o ->\n red_stat S C (stat_block (rev ls)) o.\nProof.\n introv IH HR. gen S C o.\n induction ls; introv HR; unfolds in HR; rew_list.\n run_inv. applys* red_stat_block_nil.\n run_pre. eauto. applys* red_stat_block_cons.\n run_post. clear R1.\n (* run* red_stat_block_cons. ==> LATER: should work*)\n run red_stat_block_1.\n subst. applys* red_stat_block_2_throw.\n subst. applys* red_stat_block_2_not_throw.\n applys* red_stat_block_2_not_throw. simple*.\n unfolds res_overwrite_value_if_empty. case_if; case_if*.\nAdmitted. (*faster*)\n\nLemma run_stat_switch_no_default_end_correct : forall runs S C rv scs o,\n runs_type_correct runs ->\n run_stat_switch_end runs S C rv scs = o ->\n red_stat S C (stat_switch_nodefault_5 rv scs) o.\nProof.\n introv IH HR. gen S C rv o. induction scs; introv HR; unfolds in HR.\n run_inv. apply~ red_stat_switch_nodefault_5_nil.\n destruct a as [e ts]. run red_stat_switch_nodefault_5_cons.\n forwards~ H: run_block_correct R1. rew_list~ in H.\n substs. abort.\n substs. tests: (res_is_normal R).\n apply~ red_stat_switch_nodefault_6_abrupt.\n apply~ red_stat_switch_nodefault_6_normal. apply* IHscs. repeat case_if*.\nQed.\n\nLemma run_stat_switch_no_default_correct : forall runs S C vi rv scs o,\n runs_type_correct runs ->\n run_stat_switch_no_default runs S C vi rv scs = o ->\n red_stat S C (stat_switch_nodefault_1 vi rv scs) o.\nProof.\n introv IH HR. gen S C vi rv o. induction scs; introv HR; unfolds in HR.\n run_inv. apply~ red_stat_switch_nodefault_1_nil.\n apply~ red_stat_switch_nodefault_5_nil.\n destruct a. run red_stat_switch_nodefault_1_cons. let_simpl.\n apply~ red_stat_switch_nodefault_2. case_if.\n run red_stat_switch_nodefault_3_true using run_block_correct. rew_list~ in R1.\n apply~ red_stat_switch_nodefault_4.\n applys~ run_stat_switch_no_default_end_correct HR.\n apply~ red_stat_switch_nodefault_3_false.\nQed.\n\nLemma run_stat_switch_with_default_end_correct : forall runs S C rv scs o,\n runs_type_correct runs ->\n run_stat_switch_end runs S C rv scs = o ->\n red_stat S C (stat_switch_default_7 rv scs) o.\nProof.\n introv IH HR. gen S C rv o. induction scs; introv HR; unfolds in HR.\n run_inv. apply~ red_stat_switch_default_7_nil.\n destruct a as [e ts]. run red_stat_switch_default_7_cons.\n forwards~ H: run_block_correct R1. rew_list~ in H.\n substs. abort.\n substs. tests: (res_is_normal R).\n apply~ red_stat_switch_default_8_abrupt.\n apply~ red_stat_switch_default_8_normal. apply* IHscs. repeat case_if*.\nQed.\n\nLemma run_stat_switch_with_default_default_correct : forall runs S C vi rv ts scs o,\n runs_type_correct runs ->\n run_stat_switch_with_default_default runs S C ts scs = o ->\n red_stat S C (stat_switch_default_5 vi rv ts scs) o.\nProof.\n introv IH HR. unfolds in HR. run red_stat_switch_default_5\n using run_block_correct. rew_list~ in R1.\n apply~ red_stat_switch_default_6.\n applys~ run_stat_switch_with_default_end_correct HR.\nQed.\n\nLemma run_stat_switch_with_default_B_correct : forall runs S C vi rv ts scs o,\n runs_type_correct runs ->\n run_stat_switch_with_default_B runs S C vi rv ts scs = o ->\n red_stat S C (stat_switch_default_B_1 vi rv ts scs) o.\nProof.\n introv IH HR. gen S C vi rv ts o. induction scs; introv HR; unfolds in HR.\n apply~ red_stat_switch_default_B_1_nil.\n applys~ run_stat_switch_with_default_default_correct HR.\n destruct a. run red_stat_switch_default_B_1_cons. let_simpl.\n apply~ red_stat_switch_default_B_2. case_if.\n run red_stat_switch_default_B_3_true using run_block_correct. rew_list~ in R1.\n apply~ red_stat_switch_default_B_4.\n applys~ run_stat_switch_with_default_end_correct HR.\n apply~ red_stat_switch_default_B_3_false.\nQed.\n\nLemma run_stat_switch_with_default_A_correct : forall runs S C found vi rv scs1 ts scs2 o,\n runs_type_correct runs ->\n run_stat_switch_with_default_A runs S C found vi rv scs1 ts scs2 = o ->\n red_stat S C (stat_switch_default_A_1 found vi rv scs1 ts scs2) o.\nProof.\n introv IH HR. gen S C found vi rv ts scs2 o. induction scs1; introv HR; unfolds in HR.\n case_if.\n apply~ red_stat_switch_default_A_1_nil_true.\n applys~ run_stat_switch_with_default_default_correct HR.\n apply~ red_stat_switch_default_A_1_nil_false.\n applys~ run_stat_switch_with_default_B_correct HR.\n destruct a. let_name. asserts follow_correct: (forall S o,\n follow S = res_out o ->\n red_stat S C (stat_switch_default_A_4 rv vi l scs1 ts scs2) o).\n clear HR. introv E. substs. run red_stat_switch_default_A_4\n using run_block_correct. rew_list~ in R1. abort.\n substs. applys~ red_stat_switch_default_A_5_abrupt.\n apply~ red_stat_switch_default_A_5. apply~ IHscs1. repeat case_if~.\n clear EQfollow. case_if.\n apply~ red_stat_switch_default_A_1_cons_true.\n run red_stat_switch_default_A_1_cons_false.\n apply~ red_stat_switch_default_A_2. let_simpl. cases_if.\n apply~ red_stat_switch_default_A_3_true.\n apply~ red_stat_switch_default_A_3_false.\nQed.\n\nLemma run_stat_switch_correct : forall runs S C labs e sb o,\n runs_type_correct runs ->\n run_stat_switch runs S C labs e sb = o ->\n red_stat S C (stat_switch labs e sb) o.\nProof.\n introv IH HR. unfolds in HR.\n run red_stat_switch. let_name. asserts follow_correct: (forall S C o1 o,\n follow o1 = res_out o -> red_stat S C (stat_switch_2 o1 labs) o).\n clear HR. introv HR. substs.\n do 2 (run_pre; run_post; run_inv; substs); try solve [abort].\n case_if; run_inv.\n destruct R. simpls. substs. apply* red_stat_switch_2_break.\n abort.\n apply~ red_stat_switch_2_normal.\n case_if; run_inv; tryfalse.\n destruct R. simpls. substs. apply* red_stat_switch_2_break.\n asserts follow_arg: (forall W o,\n follow W = res_out o -> exists (o1 : out), W = o1).\n clear HR follow_correct. introv R. substs.\n do 2 (run_pre; run_post; run_inv; substs); tryfalse; auto*.\n clear EQfollow. destruct sb.\n forwards~ (o1&E): follow_arg HR.\n applys~ red_stat_switch_1_nodefault o1.\n applys~ run_stat_switch_no_default_correct E.\n apply~ follow_correct. rewrite~ <- E.\n forwards~ (o1&E): follow_arg HR.\n applys~ red_stat_switch_1_default o1.\n applys~ run_stat_switch_with_default_A_correct E.\n apply~ follow_correct. rewrite~ <- E.\nQed.\n\nLemma run_stat_for_correct : forall runs S C labs eo1 eo2 eo3 t o,\n runs_type_correct runs ->\n run_stat_for runs S C labs eo1 eo2 eo3 t = o ->\n red_stat S C (stat_for labs eo1 eo2 eo3 t) o.\nProof.\n introv IH R. unfolds in R. destruct eo1.\n run red_stat_for_some. run_hyp.\n apply~ red_stat_for_1.\n run_hyp R. apply~ red_stat_for_none.\nQed.\n\nLemma run_stat_for_var_correct : forall runs S C labs ds eo2 eo3 t o,\n runs_type_correct runs ->\n run_stat_for_var runs S C labs ds eo2 eo3 t = o ->\n red_stat S C (stat_for_var labs ds eo2 eo3 t) o.\nProof.\n introv IH R. unfolds in R.\n run red_stat_for_var. run_hyp. apply~ red_stat_for_var_1.\nQed.\n\n\nLemma run_stat_correct : forall runs S C t o,\n runs_type_correct runs ->\n run_stat runs S C t = o ->\n red_stat S C (stat_basic t) o.\nProof.\n introv RC R. unfolds in R.\n destruct t as [ | | ls | ls | e t1 t2o | labs t e | labs e t | e t\n | e | eo | labo | labo | t co fo | labs e1 e2 e3 t\n | labs xeo1s e2 e3 t | labs e1 e2 e3 t | labs str eo e t | eo | ].\n (* Expression *)\n run red_stat_expr. apply red_stat_expr_1.\n (* Label *)\n unfolds in R. run red_stat_label.\n tests HC: (res_is_normal R0).\n inverts HC. run_inv. subst. applys* red_stat_label_1_normal.\n subst. applys* red_stat_abort. intro M. inverts M. simpls. false.\n case_if.\n applys* red_stat_label_1_break_eq. destruct R0; simpls. fequal*.\n applys* red_stat_abort. constructors. intro N. inverts N. false.\n intro M. inverts M. simpls. false.\n (* LATER: change interpreter to make it more faithful *)\n (* Block *)\n forwards* E: run_block_correct (rev ls). rew_list* in E.\n (* Variable declaration *)\n applys* run_var_decl_correct.\n (* If *)\n unfolds in R.\n run_pre. lets (y1&R2&K): if_spec_post_to_bool (rm R1) (rm R).\n applys* red_stat_if (rm R2). run_post_if_spec_ter_post_bool K.\n case_if.\n applys~ red_stat_if_1_true. apply~ RC.\n destruct t2o.\n applys~ red_stat_if_1_false. apply~ RC.\n run_inv. applys* red_stat_if_1_false_implicit.\n (* Do-while *)\n applys* red_stat_do_while. applys* runs_type_correct_stat_do_while.\n (* While *)\n apply~ red_stat_while. applys* runs_type_correct_stat_while.\n (* With *)\n unfolds in R.\n run_pre. lets (y1&R2&K): if_spec_post_to_object (rm R1) (rm R).\n applys* red_stat_with (rm R2). run_post_if_spec_ter_post_bool K.\n let_name. let_name. destruct p as [lex' S3]. let_name.\n subst lex. applys* red_stat_with_1. subst C'. run_inv. run_hyp*.\n (* Throw *)\n unfolds in R.\n run red_stat_throw. applys* red_stat_throw_1.\n (* Return *)\n unfolds in R. destruct eo.\n run red_stat_return_some. apply* red_stat_return_1.\n inverts* R. applys red_stat_return_none.\n (* Break *)\n run_inv. applys* red_stat_break.\n (* Continue *)\n run_inv. applys* red_stat_continue.\n (* Try *)\n unfolds in R. let_name.\n asserts finally_correct: (forall S (R:res),\n finally S R = res_out o ->\n red_stat S C (stat_try_4 R fo) o).\n subst finally. clear R. introv HR.\n destruct fo.\n simpls. run red_stat_try_4_finally.\n applys* red_stat_try_5_finally_result.\n run_inv. applys* red_stat_try_4_no_finally.\n clear EQfinally.\n run red_stat_try. abort.\n applys* red_stat_try_1_no_throw.\n destruct co as [c|].\n destruct c as [x t2]. let_name. let_name.\n destruct p as [lex' S']. destruct lex'; tryfalse.\n subst lex. run* red_stat_try_1_throw_catch\n using env_record_create_set_mutable_binding_correct.\n run red_stat_try_2_catch.\n applys~ red_stat_try_3_catch_result finally_correct.\n applys~ red_stat_try_1_throw_no_catch. applys~ finally_correct.\n rewrite <- R. fequal. destruct R0; simpls; substs~.\n (* For *)\n apply* run_stat_for_correct.\n (* For-var *)\n apply* run_stat_for_var_correct.\n (* For-in *)\n discriminate.\n (* For-in-var *)\n discriminate.\n (* Debugger *)\n run_inv. apply red_stat_debugger.\n (* switch *)\n applys~ run_stat_switch_correct R.\nAdmitted. (*faster*)\n\nLemma run_prog_correct : forall runs S C p o,\n runs_type_correct runs ->\n run_prog runs S C p = o ->\n red_prog S C (prog_basic p) o.\nProof.\n introv RC R. unfolds in R. destruct p.\n forwards*: run_elements_correct (rev l). rew_list* in H.\nAdmitted. (*faster*)\n\n(* LATER: generalize statement to handle continuations *)\nLemma entering_func_code_correct : forall runs S C lf vthis args o,\n runs_type_correct runs ->\n entering_func_code runs S C lf vthis args = result_some (specret_out o) ->\n red_expr S C (spec_entering_func_code lf vthis args (spec_call_default_1 lf)) o.\nProof.\n introv IH HR. unfolds in HR. sets_eq K: (spec_call_default_1 lf).\n run. run. subst x. lets H: run_object_method_correct (rm E).\n let_name. let_name as M. rename x0 into bd.\n asserts M_correct: (forall S v o,\n M S v = res_out o ->\n red_expr S C (spec_entering_func_code_3 lf args str bd v K) o).\n clears HR S o. introv HR. subst M.\n run. run. subst x. lets H: run_object_method_correct (rm E).\n let_name. destruct p as [lex' S1]. let_name.\n run* (@red_spec_entering_func_code_3 lex' S1 C').\n applys* red_spec_entering_func_code_4.\n subst K. applys* run_call_default_correct.\n clear EQM.\n applys* red_spec_entering_func_code str.\n case_if; subst str.\n applys* red_spec_entering_func_code_1_strict.\n destruct vthis.\n destruct p. (* LATER: improve *)\n applys* red_spec_entering_func_code_1_null_or_undef.\n applys* red_spec_entering_func_code_1_null_or_undef.\n run red_spec_entering_func_code_1_not_object.\n simpls. splits; congruence.\n applys* to_object_correct.\n applys* red_spec_entering_func_code_2.\n run red_spec_entering_func_code_1_not_object.\n simpls. splits; congruence.\n applys* to_object_correct.\n applys* red_spec_entering_func_code_2.\n run red_spec_entering_func_code_1_not_object.\n simpls. splits; congruence.\n applys* to_object_correct.\n applys* red_spec_entering_func_code_2.\n applys* red_spec_entering_func_code_1_object.\nAdmitted. (* faster *)\n\nLemma if_spec_throw_result : forall S K, if_spec (@throw_result descriptor (run_error S native_error_type)) K = @throw_result descriptor (run_error S native_error_type).\nProof.\n intros. repeat unfolds.\n remember (run_error S native_error_type) as Error.\n unfolds run_error. unfolds if_object.\n unfolds if_value. unfolds if_success. unfolds if_ter.\n unfolds if_out_some. unfolds if_result_some. unfolds build_error. \n cases_if*; rewrite decide_def in H; cases_if*; clear H.\n remember (object_alloc S (object_new (prealloc_native_error_proto native_error_type) \"Error\")) as O.\n destruct O as (l & S'). simpls.\n unfolds if_empty_label.\n cases_if*. subst. simpls. cases_if*.\nQed.\n\nLemma run_to_descriptor_correct : forall runs S C v y,\n runs_type_correct runs ->\n run_to_descriptor runs S C v = result_some y ->\n red_spec S C (spec_to_descriptor v) y.\nProof.\n introv IH HR. unfold run_to_descriptor in HR.\n destruct v as [p | l]. \n\n apply~ red_spec_to_descriptor_not_object.\n applys* throw_result_run_error_correct.\n\n applys* red_spec_to_descriptor_object.\n run red_spec_to_descriptor_1a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_1b_false.\n run red_spec_to_descriptor_2a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n - apply red_spec_to_descriptor_2b_false.\n run red_spec_to_descriptor_3a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n * apply red_spec_to_descriptor_3b_false.\n run red_spec_to_descriptor_4a using object_has_prop_correct.\n { \n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_4b_false.\n run red_spec_to_descriptor_5a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n - apply red_spec_to_descriptor_5b_false.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n * apply red_spec_to_descriptor_6b_false.\n { \n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n * run red_spec_to_descriptor_6b_true using run_object_get_correct.\n {\n cases_if*.\n rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n - run red_spec_to_descriptor_5b_true using run_object_get_correct.\n cases_if*.\n * rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_5c_error.\n applys* throw_result_run_error_correct.\n * simpls. applys* red_spec_to_descriptor_5c_ok.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n {\n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_6b_false.\n cases_if*. \n - applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n + run red_spec_to_descriptor_6b_true using run_object_get_correct.\n cases_if*.\n - rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n - simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n * applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n + run red_spec_to_descriptor_4b_true using run_object_get_correct.\n simpls. applys* red_spec_to_descriptor_4c.\n run red_spec_to_descriptor_5a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n - apply red_spec_to_descriptor_5b_false.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n * apply red_spec_to_descriptor_6b_false.\n { \n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n * run red_spec_to_descriptor_6b_true using run_object_get_correct.\n {\n cases_if*.\n rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n - run red_spec_to_descriptor_5b_true using run_object_get_correct.\n cases_if*.\n * rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_5c_error.\n applys* throw_result_run_error_correct.\n * simpls. applys* red_spec_to_descriptor_5c_ok.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n {\n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_6b_false.\n cases_if*. \n - applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n + run red_spec_to_descriptor_6b_true using run_object_get_correct.\n cases_if*.\n - rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n - simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n * applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n }\n * run red_spec_to_descriptor_3b_true using run_object_get_correct.\n simpls. applys* red_spec_to_descriptor_3c. \n run red_spec_to_descriptor_4a using object_has_prop_correct.\n { \n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_4b_false.\n run red_spec_to_descriptor_5a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n - apply red_spec_to_descriptor_5b_false.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n * apply red_spec_to_descriptor_6b_false.\n { \n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n * run red_spec_to_descriptor_6b_true using run_object_get_correct.\n {\n cases_if*.\n rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n - run red_spec_to_descriptor_5b_true using run_object_get_correct.\n cases_if*.\n * rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_5c_error.\n applys* throw_result_run_error_correct.\n * simpls. applys* red_spec_to_descriptor_5c_ok.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n {\n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_6b_false.\n cases_if*. \n - applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n + run red_spec_to_descriptor_6b_true using run_object_get_correct.\n cases_if*.\n - rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n - simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n * applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n + run red_spec_to_descriptor_4b_true using run_object_get_correct.\n simpls. applys* red_spec_to_descriptor_4c.\n run red_spec_to_descriptor_5a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n - apply red_spec_to_descriptor_5b_false.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n * apply red_spec_to_descriptor_6b_false.\n { \n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n * run red_spec_to_descriptor_6b_true using run_object_get_correct.\n {\n cases_if*.\n rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n - run red_spec_to_descriptor_5b_true using run_object_get_correct.\n cases_if*.\n * rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_5c_error.\n applys* throw_result_run_error_correct.\n * simpls. applys* red_spec_to_descriptor_5c_ok.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n {\n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_6b_false.\n cases_if*. \n - applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n + run red_spec_to_descriptor_6b_true using run_object_get_correct.\n cases_if*.\n - rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n - simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n * applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n }\n - run red_spec_to_descriptor_2b_true using run_object_get_correct.\n simpls. applys* red_spec_to_descriptor_2c.\n run red_spec_to_descriptor_3a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n * apply red_spec_to_descriptor_3b_false.\n run red_spec_to_descriptor_4a using object_has_prop_correct.\n { \n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_4b_false.\n run red_spec_to_descriptor_5a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n - apply red_spec_to_descriptor_5b_false.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n * apply red_spec_to_descriptor_6b_false.\n { \n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n * run red_spec_to_descriptor_6b_true using run_object_get_correct.\n {\n cases_if*.\n rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n - run red_spec_to_descriptor_5b_true using run_object_get_correct.\n cases_if*.\n * rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_5c_error.\n applys* throw_result_run_error_correct.\n * simpls. applys* red_spec_to_descriptor_5c_ok.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n {\n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_6b_false.\n cases_if*. \n - applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n + run red_spec_to_descriptor_6b_true using run_object_get_correct.\n cases_if*.\n - rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n - simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n * applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n + run red_spec_to_descriptor_4b_true using run_object_get_correct.\n simpls. applys* red_spec_to_descriptor_4c.\n run red_spec_to_descriptor_5a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n - apply red_spec_to_descriptor_5b_false.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n * apply red_spec_to_descriptor_6b_false.\n { \n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n * run red_spec_to_descriptor_6b_true using run_object_get_correct.\n {\n cases_if*.\n rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n - run red_spec_to_descriptor_5b_true using run_object_get_correct.\n cases_if*.\n * rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_5c_error.\n applys* throw_result_run_error_correct.\n * simpls. applys* red_spec_to_descriptor_5c_ok.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n {\n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_6b_false.\n cases_if*. \n - applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n + run red_spec_to_descriptor_6b_true using run_object_get_correct.\n cases_if*.\n - rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n - simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n * applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n }\n * run red_spec_to_descriptor_3b_true using run_object_get_correct.\n simpls. applys* red_spec_to_descriptor_3c. \n run red_spec_to_descriptor_4a using object_has_prop_correct.\n { \n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_4b_false.\n run red_spec_to_descriptor_5a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n - apply red_spec_to_descriptor_5b_false.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n * apply red_spec_to_descriptor_6b_false.\n { \n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n * run red_spec_to_descriptor_6b_true using run_object_get_correct.\n {\n cases_if*.\n rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n - run red_spec_to_descriptor_5b_true using run_object_get_correct.\n cases_if*.\n * rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_5c_error.\n applys* throw_result_run_error_correct.\n * simpls. applys* red_spec_to_descriptor_5c_ok.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n {\n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_6b_false.\n cases_if*. \n - applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n + run red_spec_to_descriptor_6b_true using run_object_get_correct.\n cases_if*.\n - rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n - simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n * applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n + run red_spec_to_descriptor_4b_true using run_object_get_correct.\n simpls. applys* red_spec_to_descriptor_4c.\n run red_spec_to_descriptor_5a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n - apply red_spec_to_descriptor_5b_false.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n * apply red_spec_to_descriptor_6b_false.\n { \n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n * run red_spec_to_descriptor_6b_true using run_object_get_correct.\n {\n cases_if*.\n rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n - run red_spec_to_descriptor_5b_true using run_object_get_correct.\n cases_if*.\n * rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_5c_error.\n applys* throw_result_run_error_correct.\n * simpls. applys* red_spec_to_descriptor_5c_ok.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n {\n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_6b_false.\n cases_if*. \n - applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n + run red_spec_to_descriptor_6b_true using run_object_get_correct.\n cases_if*.\n - rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n - simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n * applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n }\n + run red_spec_to_descriptor_1b_true using run_object_get_correct.\n simpls. applys* red_spec_to_descriptor_1c.\n run red_spec_to_descriptor_2a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n - apply red_spec_to_descriptor_2b_false.\n run red_spec_to_descriptor_3a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n * apply red_spec_to_descriptor_3b_false.\n run red_spec_to_descriptor_4a using object_has_prop_correct.\n { \n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_4b_false.\n run red_spec_to_descriptor_5a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n - apply red_spec_to_descriptor_5b_false.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n * apply red_spec_to_descriptor_6b_false.\n { \n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n * run red_spec_to_descriptor_6b_true using run_object_get_correct.\n {\n cases_if*.\n rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n - run red_spec_to_descriptor_5b_true using run_object_get_correct.\n cases_if*.\n * rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_5c_error.\n applys* throw_result_run_error_correct.\n * simpls. applys* red_spec_to_descriptor_5c_ok.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n {\n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_6b_false.\n cases_if*. \n - applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n + run red_spec_to_descriptor_6b_true using run_object_get_correct.\n cases_if*.\n - rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n - simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n * applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n + run red_spec_to_descriptor_4b_true using run_object_get_correct.\n simpls. applys* red_spec_to_descriptor_4c.\n run red_spec_to_descriptor_5a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n - apply red_spec_to_descriptor_5b_false.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n * apply red_spec_to_descriptor_6b_false.\n { \n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n * run red_spec_to_descriptor_6b_true using run_object_get_correct.\n {\n cases_if*.\n rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n - run red_spec_to_descriptor_5b_true using run_object_get_correct.\n cases_if*.\n * rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_5c_error.\n applys* throw_result_run_error_correct.\n * simpls. applys* red_spec_to_descriptor_5c_ok.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n {\n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_6b_false.\n cases_if*. \n - applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n + run red_spec_to_descriptor_6b_true using run_object_get_correct.\n cases_if*.\n - rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n - simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n * applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n }\n * run red_spec_to_descriptor_3b_true using run_object_get_correct.\n simpls. applys* red_spec_to_descriptor_3c. \n run red_spec_to_descriptor_4a using object_has_prop_correct.\n { \n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_4b_false.\n run red_spec_to_descriptor_5a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n - apply red_spec_to_descriptor_5b_false.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n * apply red_spec_to_descriptor_6b_false.\n { \n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n * run red_spec_to_descriptor_6b_true using run_object_get_correct.\n {\n cases_if*.\n rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n - run red_spec_to_descriptor_5b_true using run_object_get_correct.\n cases_if*.\n * rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_5c_error.\n applys* throw_result_run_error_correct.\n * simpls. applys* red_spec_to_descriptor_5c_ok.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n {\n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_6b_false.\n cases_if*. \n - applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n + run red_spec_to_descriptor_6b_true using run_object_get_correct.\n cases_if*.\n - rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n - simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n * applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n + run red_spec_to_descriptor_4b_true using run_object_get_correct.\n simpls. applys* red_spec_to_descriptor_4c.\n run red_spec_to_descriptor_5a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n - apply red_spec_to_descriptor_5b_false.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n * apply red_spec_to_descriptor_6b_false.\n { \n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n * run red_spec_to_descriptor_6b_true using run_object_get_correct.\n {\n cases_if*.\n rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n - run red_spec_to_descriptor_5b_true using run_object_get_correct.\n cases_if*.\n * rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_5c_error.\n applys* throw_result_run_error_correct.\n * simpls. applys* red_spec_to_descriptor_5c_ok.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n {\n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_6b_false.\n cases_if*. \n - applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n + run red_spec_to_descriptor_6b_true using run_object_get_correct.\n cases_if*.\n - rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n - simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n * applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n }\n - run red_spec_to_descriptor_2b_true using run_object_get_correct.\n simpls. applys* red_spec_to_descriptor_2c.\n run red_spec_to_descriptor_3a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n * apply red_spec_to_descriptor_3b_false.\n run red_spec_to_descriptor_4a using object_has_prop_correct.\n { \n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_4b_false.\n run red_spec_to_descriptor_5a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n - apply red_spec_to_descriptor_5b_false.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n * apply red_spec_to_descriptor_6b_false.\n { \n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n * run red_spec_to_descriptor_6b_true using run_object_get_correct.\n {\n cases_if*.\n rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n - run red_spec_to_descriptor_5b_true using run_object_get_correct.\n cases_if*.\n * rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_5c_error.\n applys* throw_result_run_error_correct.\n * simpls. applys* red_spec_to_descriptor_5c_ok.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n {\n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_6b_false.\n cases_if*. \n - applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n + run red_spec_to_descriptor_6b_true using run_object_get_correct.\n cases_if*.\n - rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n - simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n * applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n + run red_spec_to_descriptor_4b_true using run_object_get_correct.\n simpls. applys* red_spec_to_descriptor_4c.\n run red_spec_to_descriptor_5a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n - apply red_spec_to_descriptor_5b_false.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n * apply red_spec_to_descriptor_6b_false.\n { \n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n * run red_spec_to_descriptor_6b_true using run_object_get_correct.\n {\n cases_if*.\n rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n - run red_spec_to_descriptor_5b_true using run_object_get_correct.\n cases_if*.\n * rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_5c_error.\n applys* throw_result_run_error_correct.\n * simpls. applys* red_spec_to_descriptor_5c_ok.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n {\n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_6b_false.\n cases_if*. \n - applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n + run red_spec_to_descriptor_6b_true using run_object_get_correct.\n cases_if*.\n - rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n - simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n * applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n }\n * run red_spec_to_descriptor_3b_true using run_object_get_correct.\n simpls. applys* red_spec_to_descriptor_3c. \n run red_spec_to_descriptor_4a using object_has_prop_correct.\n { \n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_4b_false.\n run red_spec_to_descriptor_5a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n - apply red_spec_to_descriptor_5b_false.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n * apply red_spec_to_descriptor_6b_false.\n { \n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n * run red_spec_to_descriptor_6b_true using run_object_get_correct.\n {\n cases_if*.\n rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n - run red_spec_to_descriptor_5b_true using run_object_get_correct.\n cases_if*.\n * rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_5c_error.\n applys* throw_result_run_error_correct.\n * simpls. applys* red_spec_to_descriptor_5c_ok.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n {\n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_6b_false.\n cases_if*. \n - applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n + run red_spec_to_descriptor_6b_true using run_object_get_correct.\n cases_if*.\n - rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n - simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n * applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n + run red_spec_to_descriptor_4b_true using run_object_get_correct.\n simpls. applys* red_spec_to_descriptor_4c.\n run red_spec_to_descriptor_5a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n - apply red_spec_to_descriptor_5b_false.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n cases_if*; destruct b; inverts H.\n * apply red_spec_to_descriptor_6b_false.\n { \n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n * run red_spec_to_descriptor_6b_true using run_object_get_correct.\n {\n cases_if*.\n rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n + applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n - run red_spec_to_descriptor_5b_true using run_object_get_correct.\n cases_if*.\n * rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_5c_error.\n applys* throw_result_run_error_correct.\n * simpls. applys* red_spec_to_descriptor_5c_ok.\n run red_spec_to_descriptor_6a using object_has_prop_correct.\n {\n cases_if*; destruct b; inverts H.\n + apply red_spec_to_descriptor_6b_false.\n cases_if*. \n - applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n + run red_spec_to_descriptor_6b_true using run_object_get_correct.\n cases_if*.\n - rewrite if_spec_throw_result in *.\n applys* red_spec_to_descriptor_6c_error.\n applys* throw_result_run_error_correct.\n - simpls. applys* red_spec_to_descriptor_6c_ok.\n cases_if*. \n * applys~ red_spec_to_descriptor_7_error.\n applys* throw_result_run_error_correct.\n * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. \n }\n }\nAdmitted. (* Faster *)\n\n\nLemma run_object_freeze_correct : forall runs S C l xs o,\n runs_type_correct runs ->\n run_object_freeze runs S C l xs = result_some (specret_out o) ->\n red_expr S C (spec_call_object_freeze_2 l xs) o.\nProof.\n introv IH HR. gen S. induction xs; introv HR; unfolds in HR.\n run. apply~ red_spec_call_object_freeze_2_nil.\n apply~ run_object_heap_set_extensible_correct.\n run red_spec_call_object_freeze_2_cons.\n destruct a0 as [|A]; tryfalse.\n applys~ red_spec_call_object_freeze_3.\n run red_spec_call_object_freeze_4.\n clear. rew_refl. destruct A as [()|()]; simpls; repeat cases_if;\n simpls; fold_bool; rew_refl in *; intuit; tryfalse; repeat (fequals); tryfalse*.\n applys~ red_spec_call_object_freeze_5.\nQed.\n\nLemma run_object_is_sealed_correct : forall runs S C l xs o,\n runs_type_correct runs ->\n run_object_is_sealed runs S C l xs = result_some (specret_out o) ->\n red_expr S C (spec_call_object_is_sealed_2 l xs) o.\nProof.\n introv IH HR. gen S. induction xs; introv HR; unfolds in HR.\n run. apply~ red_spec_call_object_is_sealed_2_nil.\n apply~ run_object_method_correct.\n run red_spec_call_object_is_sealed_2_cons.\n destruct a0 as [|A]; tryfalse. cases_if as CF.\n inverts HR. applys~ red_spec_call_object_is_sealed_3_prop_configurable.\n applys~ red_spec_call_object_is_sealed_3_prop_not_configurable.\nQed.\n\nLemma run_object_is_frozen_correct : forall runs S C l xs o,\n runs_type_correct runs ->\n run_object_is_frozen runs S C l xs = result_some (specret_out o) ->\n red_expr S C (spec_call_object_is_frozen_2 l xs) o.\nProof.\n introv IH HR. gen S o. induction xs; introv HR; unfolds in HR.\n run. apply~ red_spec_call_object_is_frozen_2_nil.\n apply~ run_object_method_correct.\n run red_spec_call_object_is_frozen_2_cons. let_name.\n asserts CC: (forall A o, check_configurable A = result_some (specret_out o) ->\n red_expr S1 C (spec_call_object_is_frozen_5 l xs A) o).\n rewrite EQcheck_configurable. clear - IHxs. introv HR. cases_if as AC.\n inverts HR. apply~ red_spec_call_object_is_frozen_5_prop_configurable.\n apply~ red_spec_call_object_is_frozen_5_prop_not_configurable.\n clear EQcheck_configurable. destruct a0 as [|[Ad|Aa]].\n discriminate.\n apply red_spec_call_object_is_frozen_3_desc_is_data; simpls~. cases_if as W.\n inverts HR. applys~ red_spec_call_object_is_frozen_4_prop_is_writable.\n apply~ red_spec_call_object_is_frozen_4_prop_is_not_writable.\n apply~ red_spec_call_object_is_frozen_3_desc_is_not_data.\nQed.\n\nLemma run_object_seal_correct : forall runs S C l xs o,\n runs_type_correct runs ->\n run_object_seal runs S C l xs = result_some (specret_out o) ->\n red_expr S C (spec_call_object_seal_2 l xs) o.\nProof.\n introv IH HR. gen o S. induction xs; introv HR; unfolds in HR.\n run. apply~ red_spec_call_object_seal_2_nil.\n apply~ run_object_heap_set_extensible_correct.\n run red_spec_call_object_seal_2_cons.\n destruct a0 as [|A]; tryfalse.\n run red_spec_call_object_seal_3.\n clear. repeat cases_if~. destruct~ A as [()|()].\n applys~ red_spec_call_object_seal_4.\nQed.\n\nLemma run_function_proto_apply_get_args_correct : forall runs S C array (index n : int) y,\n runs_type_correct runs ->\n run_get_args_for_apply runs S C array index n = result_some y ->\n red_spec S C (spec_function_proto_apply_get_args array index n) y.\nProof.\n introv IH HR; unfolds run_get_args_for_apply. cases_if*.\n + run~ red_spec_function_apply_get_args_true.\n run red_spec_function_apply_get_args_1 using run_object_get_correct.\n let_name; subst.\n run red_spec_function_apply_get_args_2 using runs_type_correct_get_args_for_apply.\n apply red_spec_function_apply_get_args_3.\n + inverts HR. applys~ red_spec_function_apply_get_args_false.\nQed.\n\nLemma push_correct : forall S S' C l args a o runs,\n runs_type_correct runs ->\n push runs S' C l args a = result_some (specret_out o) ->\n red_expr S C (spec_call_array_proto_push_3 l args (specret_val S' a)) o.\nProof.\n introv IH HR. \n apply red_spec_call_array_proto_push_3. \n gen a o S S' C l runs. inductions args; intros.\n + simpls; let_name; subst. \n apply red_spec_call_array_proto_push_4_empty.\n run red_spec_call_array_proto_push_5.\n apply red_spec_call_array_proto_push_6.\n + unfold push in HR. unfolds let_binding. (* Why doesn't let_name work here? *)\n apply red_spec_call_array_proto_push_4_nonempty. \n run red_spec_call_array_proto_push_4_nonempty_1. \n run red_spec_call_array_proto_push_4_nonempty_2. \n apply red_spec_call_array_proto_push_4_nonempty_3. \n applys* IHargs.\nQed.\n\nLemma vtsfj_correct : forall runs S C l index sR,\n runs_type_correct runs ->\n valueToStringForJoin runs S C l index = result_some sR ->\n red_spec S C (spec_call_array_proto_join_vtsfj l index) sR.\nProof.\n introv IH HR. unfolds in HR.\n run red_spec_call_array_proto_join_vtsfj. \n run red_spec_call_array_proto_join_vtsfj_1 using run_object_get_correct.\n destruct v as [p | loc].\n + destruct p; try solve [inverts HR; applys* red_spec_call_array_proto_join_vtsfj_2_undef_null];\n run* red_spec_call_array_proto_join_vtsfj_2_other; try solve [intuition; inverts H0]; \n applys* red_spec_call_array_proto_join_vtsfj_3.\n + run* red_spec_call_array_proto_join_vtsfj_2_other; try solve [intuition; inverts H0]; \n applys* red_spec_call_array_proto_join_vtsfj_3.\nQed.\n\nLemma run_array_join_elements_correct : forall runs S C l k length sep sR o,\n runs_type_correct runs -> \n run_array_join_elements runs S C l k length sep sR = o ->\n red_expr S C (spec_call_array_proto_join_elements l k length sep sR) o.\nProof.\n introv IH HR. unfolds in HR. cases_if*.\n + repeat let_name; subst.\n applys* red_spec_call_array_proto_join_elements_continue.\n run* red_spec_call_array_proto_join_elements_1 using vtsfj_correct. \n let_name; subst.\n apply red_spec_call_array_proto_join_elements_2.\n applys* runs_type_correct_array_join_elements.\n + inverts HR. applys* red_spec_call_array_proto_join_elements_exit.\nQed.\n\nLemma run_call_prealloc_correct : forall runs S C B vthis args o,\n runs_type_correct runs ->\n run_call_prealloc runs S C B vthis args = o ->\n red_expr S C (spec_call_prealloc B vthis args) o.\nProof.\n introv IH HR. unfolds in HR.\n destruct B.\n (* prealloc_global *)\n discriminate.\n (* prealloc_global_eval *)\n discriminate.\n (* prealloc_global_parse_int *)\n discriminate.\n (* prealloc_global_parse_float *)\n discriminate.\n (* prealloc_global_is_finite *)\n let_name. run red_spec_call_global_is_finite.\n substs. apply~ get_arg_correct_0.\n applys red_spec_call_global_is_finite_1.\n cases_if; fold_bool; rew_refl~.\n (* prealloc_global_is_nan *)\n let_name. run red_spec_call_global_is_nan.\n substs. apply~ get_arg_correct_0.\n applys red_spec_call_global_is_nan_1.\n cases_if; fold_bool; rew_refl~.\n (* prealloc_global_decode_uri *)\n discriminate.\n (* prealloc_global_decode_uri_component *)\n discriminate.\n (* prealloc_global_encode_uri *)\n discriminate.\n (* prealloc_global_encode_uri_component *)\n discriminate.\n (* prealloc_object *)\n let_name. subst.\n applys* red_spec_call_object_call.\n applys* get_arg_correct_0.\n destruct (get_arg 0 args) as [p | l].\n destruct p.\n applys* red_spec_call_object_call_1_null_or_undef.\n apply run_construct_prealloc_correct in HR; auto. \n applys* red_spec_call_object_call_1_null_or_undef.\n apply run_construct_prealloc_correct in HR; auto. \n applys* red_spec_call_object_call_1_other.\n splits; discriminate.\n applys~ to_object_correct.\n applys* red_spec_call_object_call_1_other.\n splits; discriminate.\n applys~ to_object_correct.\n applys* red_spec_call_object_call_1_other.\n splits; discriminate.\n applys~ to_object_correct.\n applys* red_spec_call_object_call_1_other.\n splits; discriminate.\n applys~ to_object_correct. \n (* prealloc_object_get_proto_of *)\n let_name. apply~ red_spec_call_object_get_proto_of.\n substs. apply* get_arg_correct_0.\n rewrite <- EQv in *. destruct v.\n apply red_spec_call_object_get_proto_of_1_not_object.\n apply* run_error_correct.\n run. apply~ red_spec_call_object_get_proto_of_1_object.\n apply* run_object_method_correct.\n (* prealloc_object_get_own_prop_descriptor *)\n let_name. apply~ red_spec_call_object_get_own_prop_descriptor.\n apply* get_arg_correct_1.\n rewrite <- EQv in *. destruct v.\n apply red_spec_call_object_get_own_prop_descriptor_1_not_object.\n destruct p; discriminate.\n apply* run_error_correct.\n run red_spec_call_object_get_own_prop_descriptor_1_object.\n run red_spec_call_object_get_own_prop_descriptor_2.\n apply* from_prop_descriptor_correct.\n (* prealloc_object_get_own_prop_name *)\n discriminate.\n (* prealloc_object_create *)\n discriminate.\n (* prealloc_object_define_prop *)\n let_name. let_name. let_name.\n apply~ red_spec_call_object_object_define_prop.\n apply* get_arg_correct_2.\n rewrite <- EQo0 in *. rewrite <- EQp in *. rewrite <- EQattr in *.\n destruct o0.\n apply red_spec_call_object_object_define_prop_1_not_object.\n destruct p0; discriminate.\n apply* run_error_correct.\n run red_spec_call_object_object_define_prop_1_object.\n run red_spec_call_object_object_define_prop_2.\n apply* run_to_descriptor_correct.\n run red_spec_call_object_object_define_prop_3.\n apply* red_spec_call_object_object_define_prop_4.\n (* prealloc_object_define_props *)\n discriminate.\n (* prealloc_object_seal *)\n let_name. apply~ red_spec_call_object_seal.\n apply* get_arg_correct_0.\n rewrite <- EQv in *. destruct v.\n apply red_spec_call_object_seal_1_not_object.\n destruct p; discriminate.\n apply* run_error_correct.\n run. forwards~ B: @pick_option_correct E.\n applys~ red_spec_call_object_seal_1_object B.\n applys~ run_object_seal_correct HR.\n (* prealloc_object_freeze *)\n let_name. apply~ red_spec_call_object_freeze.\n apply* get_arg_correct_0.\n rewrite <- EQv in *. destruct v.\n apply red_spec_call_object_freeze_1_not_object.\n destruct p; discriminate.\n apply* run_error_correct.\n run. forwards~ B: @pick_option_correct E.\n applys~ red_spec_call_object_freeze_1_object B.\n applys~ run_object_freeze_correct HR.\n (* prealloc_object_prevent_extensions *)\n let_name. apply~ red_spec_call_object_prevent_extensions.\n apply* get_arg_correct_0.\n rewrite <- EQv in *. destruct v.\n apply red_spec_call_object_prevent_extensions_not_object.\n destruct p; discriminate.\n apply* run_error_correct.\n run. forwards~ B: @pick_option_correct E.\n applys~ red_spec_call_object_prevent_extensions_object B.\n (* prealloc_object_is_sealed *)\n let_name. apply~ red_spec_call_object_is_sealed.\n apply* get_arg_correct_0.\n rewrite <- EQv in *. destruct v.\n apply red_spec_call_object_is_sealed_1_not_object.\n destruct p; discriminate.\n apply* run_error_correct.\n run. forwards~ B: @pick_option_correct E.\n applys~ red_spec_call_object_is_sealed_1_object B.\n applys~ run_object_is_sealed_correct HR.\n (* prealloc_object_is_frozen *)\n let_name. apply~ red_spec_call_object_is_frozen.\n apply* get_arg_correct_0.\n rewrite <- EQv in *. destruct v.\n apply red_spec_call_object_is_frozen_1_not_object.\n destruct p; discriminate.\n apply* run_error_correct.\n run. forwards~ B: @pick_option_correct E.\n applys~ red_spec_call_object_is_frozen_1_object B.\n applys~ run_object_is_frozen_correct HR.\n (* prealloc_object_is_extensible *)\n let_name. apply~ red_spec_call_object_is_extensible.\n apply* get_arg_correct_0.\n rewrite <- EQv in *. destruct v.\n apply red_spec_call_object_is_extensible_1_not_object.\n destruct p; discriminate.\n apply* run_error_correct.\n run. apply~ red_spec_call_object_is_extensible_1_object.\n apply~ run_object_method_correct.\n (* prealloc_object_keys *)\n discriminate.\n (* prealloc_object_keys_call *)\n discriminate.\n (* prealloc_object_proto *)\n discriminate.\n (* prealloc_object_proto_to_string *)\n apply red_spec_call_object_proto_to_string.\n destruct vthis as [p | l]; [destruct p | ].\n inverts HR. apply red_spec_call_object_proto_to_string_1_undef.\n inverts HR. apply red_spec_call_object_proto_to_string_1_null.\n run red_spec_call_object_proto_to_string_1_other using to_object_correct. rew_logic; splits; discriminate.\n run. apply run_object_method_correct in E.\n applys* red_spec_call_object_proto_to_string_2.\n run red_spec_call_object_proto_to_string_1_other using to_object_correct. rew_logic; splits; discriminate.\n run. apply run_object_method_correct in E.\n applys* red_spec_call_object_proto_to_string_2.\n run red_spec_call_object_proto_to_string_1_other using to_object_correct. rew_logic; splits; discriminate.\n run. apply run_object_method_correct in E.\n applys* red_spec_call_object_proto_to_string_2.\n run red_spec_call_object_proto_to_string_1_other using to_object_correct. rew_logic. splits; discriminate.\n run. apply run_object_method_correct in E.\n applys* red_spec_call_object_proto_to_string_2.\n (* prealloc_object_proto_value_of *)\n apply~ red_spec_call_object_proto_value_of.\n apply~ to_object_correct.\n (* prealloc_object_proto_has_own_prop *)\n let_name. run red_spec_call_object_proto_has_own_prop.\n substs. apply~ get_arg_correct_0.\n run red_spec_call_object_proto_has_own_prop_1 using to_object_correct.\n run red_spec_call_object_proto_has_own_prop_2.\n destruct a. (* LTAC ARTHUR *)\n inverts HR. apply~ red_spec_call_object_proto_has_own_prop_3_undef.\n inverts HR. apply~ red_spec_call_object_proto_has_own_prop_3_not_undef.\n (* prealloc_object_proto_is_prototype_of *)\n let_name. destruct v as [p | l].\n inverts HR. applys* red_spec_call_object_proto_is_prototype_of_not_object.\n applys* get_arg_correct_0.\n applys* red_spec_call_object_proto_is_prototype_of_1_not_object. \n rewrite~ <- EQv. \n applys* red_spec_call_object_proto_is_prototype_of_not_object. \n apply get_arg_correct_0.\n rewrite <- EQv. run red_spec_call_object_proto_is_prototype_of_1_object using to_object_correct.\n apply red_spec_call_object_proto_is_prototype_of_2.\n applys* runs_type_correct_object_proto_is_prototype_of.\n (* prealloc_object_proto_prop_is_enumerable *)\n let_name. \n applys* red_spec_call_object_proto_prop_is_enumerable.\n apply get_arg_correct_0. subst.\n run red_spec_call_object_proto_prop_is_enumerable_1.\n run red_spec_call_object_proto_prop_is_enumerable_2 using to_object_correct.\n run red_spec_call_object_proto_prop_is_enumerable_3.\n destruct a; inverts HR.\n apply red_spec_call_object_proto_prop_is_enumerable_4_undef.\n applys* red_spec_call_object_proto_prop_is_enumerable_4_not_undef.\n (* prealloc_function *)\n discriminate. (* LATER *)\n (* prealloc_function_proto *)\n inverts HR. apply red_spec_call_function_proto_invoked.\n\n (* prealloc_function_proto_to_string *)\n cases_if*. applys* red_spec_function_proto_to_string_not_callable.\n\n (* prealloc_function_proto_apply *)\n repeat let_name.\n cases_if*; [ | applys* red_spec_function_apply_1].\n destruct vthis as [p | func]; [inverts i; inverts H | ]. \n applys* red_spec_function_apply_1_2; [apply get_arg_correct_1 | substs].\n destruct (get_arg 1 args) as [p | array].\n destruct p;\n try solve [apply runs_type_correct_call in HR; auto;\n applys* red_spec_function_apply_2];\n try solve [apply red_spec_function_apply_3 with (array := func); [splits; discriminate | applys* run_error_correct]].\n run~ red_spec_function_apply_4 using run_object_get_correct.\n run red_spec_function_apply_5.\n run red_spec_function_apply_6 using run_function_proto_apply_get_args_correct. \n apply red_spec_function_apply_7. applys* runs_type_correct_call.\n\n (* prealloc_function_proto_call *)\n cases_if*; [ | applys* red_spec_call_function_not_callable].\n destruct vthis as [p | l]; [inverts i; inverts H |].\n remember (get_arg_first_and_rest args) as gargs; destruct gargs.\n applys* red_spec_call_function_callable.\n rewrite* <- get_arg_first_and_rest_correct.\n applys* runs_type_correct_call.\n\n (* prealloc_function_proto_bind *)\n cases_if*; [ | applys* red_spec_function_bind_1].\n destruct vthis as [p | this]; [inverts HR | ].\n remember (get_arg_first_and_rest args) as gargs; destruct gargs as (thisArg & A).\n applys* red_spec_function_bind_2.\n rewrite* <- get_arg_first_and_rest_correct.\n repeat let_simpl; \n match goal with H: context [object_alloc ?s ?o] |- _ => sets_eq X: (object_alloc s o) end;\n destruct X as (l & S'). \n applys* red_spec_function_bind_3.\n let_name. subst. run red_spec_function_bind_4.\n run. cases_if*; subst; apply run_object_method_correct in E.\n applys* red_spec_function_bind_length_true. \n run red_spec_function_bind_length_1 using run_object_get_correct.\n run red_spec_function_bind_length_2. cases_if*; inverts R1.\n applys* red_spec_function_bind_length_3_zero.\n applys* red_spec_function_bind_length_3_L.\n inverts R1. applys* red_spec_function_bind_length_false.\n repeat let_name. \n run; rename x into S''. run. repeat let_name.\n forwards B: @pick_option_correct (rm E0).\n applys* red_spec_function_bind_5.\n applys* red_spec_function_bind_6. rewrite* <- EQA0. substs.\n run* red_spec_function_bind_7. \n run* red_spec_function_bind_8. \n apply red_spec_function_bind_9.\n\n (* prealloc_bool *)\n inverts HR. apply~ red_spec_call_bool.\n apply~ get_arg_correct_0.\n apply~ red_spec_to_boolean.\n (* prealloc_bool_proto *)\n discriminate.\n (* prealloc_bool_proto_to_string *) \n destruct vthis as [p | l].\n destruct p; try solve [\n apply red_spec_call_bool_proto_to_string_not_bool;\n [introv Hv; inverts Hv | applys* run_error_correct]]. \n inverts HR. applys* red_spec_call_bool_proto_to_string_bool. constructor.\n remember (run_object_method object_class_ S l). destruct o0.\n simpls. cases_if*. \n remember (run_object_method object_prim_value_ S l). destruct o0.\n simpls. destruct o0. destruct v. \n destruct p.\n apply red_spec_call_bool_proto_to_string_not_bool;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n symmetry in Heqo1. apply run_object_method_correct in Heqo1.\n destruct Heqo1 as (O1 & Hb1 & Hv1).\n destruct H3 as (O2 & Hb2 & Hv2).\n assert (O1 = O2).\n {\n applys* Heap_binds_func.\n apply object_loc_comparable. \n } subst. false~.\n apply red_spec_call_bool_proto_to_string_not_bool;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n symmetry in Heqo1. apply run_object_method_correct in Heqo1.\n destruct Heqo1 as (O1 & Hb1 & Hv1).\n destruct H3 as (O2 & Hb2 & Hv2).\n assert (O1 = O2).\n {\n applys* Heap_binds_func.\n apply object_loc_comparable. \n } subst. false~.\n inverts HR. subst. \n symmetry in Heqo1, Heqo0. \n apply run_object_method_correct in Heqo0. \n apply run_object_method_correct in Heqo1. \n applys* red_spec_call_bool_proto_to_string_bool.\n constructor*.\n apply red_spec_call_bool_proto_to_string_not_bool;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n symmetry in Heqo1. apply run_object_method_correct in Heqo1.\n destruct Heqo1 as (O1 & Hb1 & Hv1).\n destruct H3 as (O2 & Hb2 & Hv2).\n assert (O1 = O2).\n {\n applys* Heap_binds_func.\n apply object_loc_comparable. \n } subst. false~.\n apply red_spec_call_bool_proto_to_string_not_bool;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n symmetry in Heqo1. apply run_object_method_correct in Heqo1.\n destruct Heqo1 as (O1 & Hb1 & Hv1).\n destruct H3 as (O2 & Hb2 & Hv2).\n assert (O1 = O2).\n {\n applys* Heap_binds_func.\n apply object_loc_comparable. \n } subst. false~.\n apply red_spec_call_bool_proto_to_string_not_bool;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n symmetry in Heqo1. apply run_object_method_correct in Heqo1.\n destruct Heqo1 as (O1 & Hb1 & Hv1).\n destruct H3 as (O2 & Hb2 & Hv2).\n assert (O1 = O2).\n {\n applys* Heap_binds_func.\n apply object_loc_comparable. \n } subst. false~.\n apply red_spec_call_bool_proto_to_string_not_bool;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n symmetry in Heqo1. apply run_object_method_correct in Heqo1.\n destruct Heqo1 as (O1 & Hb1 & Hv1).\n destruct H3 as (O2 & Hb2 & Hv2).\n assert (O1 = O2).\n {\n applys* Heap_binds_func.\n apply object_loc_comparable. \n } subst. false~.\n simpls. apply red_spec_call_bool_proto_to_string_not_bool;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n destruct H3 as (O & Hb & Hv).\n unfolds run_object_method.\n assert (exists a, object_binds S l a).\n eexists; jauto.\n lets Hyp : (@pick_option_defined _ (object_binds S l) (object_binds_pickable_option S l) H). \n destruct Hyp as (a & Heq). \n rewrite Heq in Heqo1.\n simpls. inverts Heqo1.\n apply red_spec_call_bool_proto_to_string_not_bool;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n destruct H0 as (O & Hb & Hv).\n unfolds run_object_method.\n assert (exists a, object_binds S l a).\n exists~ O. \n lets Hyp : (@pick_option_defined _ (object_binds S l) (object_binds_pickable_option S l) H). \n destruct Hyp as (a & Heq). \n rewrite Heq in Heqo0.\n simpls. assert (a = O).\n {\n apply pick_option_correct in Heq.\n applys* Heap_binds_func.\n apply object_loc_comparable. \n } subst. rewrite Hv in Heqo0. false*.\n simpls. apply red_spec_call_bool_proto_to_string_not_bool;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n destruct H0 as (O & Hb & Hv).\n unfolds run_object_method.\n assert (exists a, object_binds S l a).\n exists~ O. \n lets Hyp : (@pick_option_defined _ (object_binds S l) (object_binds_pickable_option S l) H). \n destruct Hyp as (a & Heq). \n rewrite Heq in Heqo0.\n simpls. inverts Heqo0. \n (* prealloc_bool_proto_value_of *)\n destruct vthis as [p | l].\n destruct p; try solve [\n apply red_spec_call_bool_proto_value_of_not_bool;\n [introv Hv; inverts Hv | applys* run_error_correct]]. \n inverts HR. apply red_spec_call_bool_proto_value_of_bool. constructor.\n remember (run_object_method object_class_ S l). destruct o0.\n simpls. cases_if*. \n remember (run_object_method object_prim_value_ S l). destruct o0.\n simpls. destruct o0. destruct v. \n destruct p.\n apply red_spec_call_bool_proto_value_of_not_bool;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n symmetry in Heqo1. apply run_object_method_correct in Heqo1.\n destruct Heqo1 as (O1 & Hb1 & Hv1).\n destruct H3 as (O2 & Hb2 & Hv2).\n assert (O1 = O2).\n {\n applys* Heap_binds_func.\n apply object_loc_comparable. \n } subst. false~.\n apply red_spec_call_bool_proto_value_of_not_bool;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n symmetry in Heqo1. apply run_object_method_correct in Heqo1.\n destruct Heqo1 as (O1 & Hb1 & Hv1).\n destruct H3 as (O2 & Hb2 & Hv2).\n assert (O1 = O2).\n {\n applys* Heap_binds_func.\n apply object_loc_comparable. \n } subst. false~.\n inverts HR. subst. apply red_spec_call_bool_proto_value_of_bool.\n symmetry in Heqo1, Heqo0. \n apply run_object_method_correct in Heqo0. \n apply run_object_method_correct in Heqo1. \n constructor*.\n apply red_spec_call_bool_proto_value_of_not_bool;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n symmetry in Heqo1. apply run_object_method_correct in Heqo1.\n destruct Heqo1 as (O1 & Hb1 & Hv1).\n destruct H3 as (O2 & Hb2 & Hv2).\n assert (O1 = O2).\n {\n applys* Heap_binds_func.\n apply object_loc_comparable. \n } subst. false~.\n apply red_spec_call_bool_proto_value_of_not_bool;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n symmetry in Heqo1. apply run_object_method_correct in Heqo1.\n destruct Heqo1 as (O1 & Hb1 & Hv1).\n destruct H3 as (O2 & Hb2 & Hv2).\n assert (O1 = O2).\n {\n applys* Heap_binds_func.\n apply object_loc_comparable. \n } subst. false~.\n apply red_spec_call_bool_proto_value_of_not_bool;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n symmetry in Heqo1. apply run_object_method_correct in Heqo1.\n destruct Heqo1 as (O1 & Hb1 & Hv1).\n destruct H3 as (O2 & Hb2 & Hv2).\n assert (O1 = O2).\n {\n applys* Heap_binds_func.\n apply object_loc_comparable. \n } subst. false~.\n apply red_spec_call_bool_proto_value_of_not_bool;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n symmetry in Heqo1. apply run_object_method_correct in Heqo1.\n destruct Heqo1 as (O1 & Hb1 & Hv1).\n destruct H3 as (O2 & Hb2 & Hv2).\n assert (O1 = O2).\n {\n applys* Heap_binds_func.\n apply object_loc_comparable. \n } subst. false~.\n simpls. apply red_spec_call_bool_proto_value_of_not_bool;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n destruct H3 as (O & Hb & Hv).\n unfolds run_object_method.\n assert (exists a, object_binds S l a).\n eexists; jauto.\n lets Hyp : (@pick_option_defined _ (object_binds S l) (object_binds_pickable_option S l) H). \n destruct Hyp as (a & Heq). \n rewrite Heq in Heqo1.\n simpls. inverts Heqo1.\n apply red_spec_call_bool_proto_value_of_not_bool;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n destruct H0 as (O & Hb & Hv).\n unfolds run_object_method.\n assert (exists a, object_binds S l a).\n exists~ O. \n lets Hyp : (@pick_option_defined _ (object_binds S l) (object_binds_pickable_option S l) H). \n destruct Hyp as (a & Heq). \n rewrite Heq in Heqo0.\n simpls. assert (a = O).\n {\n apply pick_option_correct in Heq.\n applys* Heap_binds_func.\n apply object_loc_comparable. \n } subst. rewrite Hv in Heqo0. false*.\n simpls. apply red_spec_call_bool_proto_value_of_not_bool;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n destruct H0 as (O & Hb & Hv).\n unfolds run_object_method.\n assert (exists a, object_binds S l a).\n exists~ O. \n lets Hyp : (@pick_option_defined _ (object_binds S l) (object_binds_pickable_option S l) H). \n destruct Hyp as (a & Heq). \n rewrite Heq in Heqo0.\n simpls. inverts Heqo0. \n (* prealloc_number *)\n cases_if.\n substs. inverts HR. apply~ red_spec_call_number_nil.\n inverts HR. apply~ red_spec_call_number_not_nil.\n apply~ get_arg_correct_0.\n apply* to_number_correct.\n (* prealloc_number_proto *)\n discriminate.\n (* prealloc_number_proto_to_string *)\n discriminate.\n (* prealloc_number_proto_value_of *)\n destruct vthis as [p | l].\n destruct p; try solve [\n apply red_spec_call_number_proto_value_of_not_number;\n [introv Hv; inverts Hv | applys* run_error_correct]]. \n inverts HR. apply red_spec_call_number_proto_value_of_number. constructor.\n remember (run_object_method object_class_ S l). destruct o0.\n simpls. cases_if*. \n remember (run_object_method object_prim_value_ S l). destruct o0.\n simpls. destruct o0. destruct v. \n destruct p.\n apply red_spec_call_number_proto_value_of_not_number;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n symmetry in Heqo1. apply run_object_method_correct in Heqo1.\n destruct Heqo1 as (O1 & Hb1 & Hv1).\n destruct H3 as (O2 & Hb2 & Hv2).\n assert (O1 = O2).\n {\n applys* Heap_binds_func.\n apply object_loc_comparable. \n } subst. false~.\n apply red_spec_call_number_proto_value_of_not_number;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n symmetry in Heqo1. apply run_object_method_correct in Heqo1.\n destruct Heqo1 as (O1 & Hb1 & Hv1).\n destruct H3 as (O2 & Hb2 & Hv2).\n assert (O1 = O2).\n {\n applys* Heap_binds_func.\n apply object_loc_comparable. \n } subst. false~.\n apply red_spec_call_number_proto_value_of_not_number;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n symmetry in Heqo1. apply run_object_method_correct in Heqo1.\n destruct Heqo1 as (O1 & Hb1 & Hv1).\n destruct H3 as (O2 & Hb2 & Hv2).\n assert (O1 = O2).\n {\n applys* Heap_binds_func.\n apply object_loc_comparable. \n } subst. false~.\n inverts HR. subst. apply red_spec_call_number_proto_value_of_number.\n symmetry in Heqo1, Heqo0. \n apply run_object_method_correct in Heqo0. \n apply run_object_method_correct in Heqo1. \n constructor*.\n apply red_spec_call_number_proto_value_of_not_number;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n symmetry in Heqo1. apply run_object_method_correct in Heqo1.\n destruct Heqo1 as (O1 & Hb1 & Hv1).\n destruct H3 as (O2 & Hb2 & Hv2).\n assert (O1 = O2).\n {\n applys* Heap_binds_func.\n apply object_loc_comparable. \n } subst. false~.\n apply red_spec_call_number_proto_value_of_not_number;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n symmetry in Heqo1. apply run_object_method_correct in Heqo1.\n destruct Heqo1 as (O1 & Hb1 & Hv1).\n destruct H3 as (O2 & Hb2 & Hv2).\n assert (O1 = O2).\n {\n applys* Heap_binds_func.\n apply object_loc_comparable. \n } subst. false~.\n apply red_spec_call_number_proto_value_of_not_number;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n symmetry in Heqo1. apply run_object_method_correct in Heqo1.\n destruct Heqo1 as (O1 & Hb1 & Hv1).\n destruct H3 as (O2 & Hb2 & Hv2).\n assert (O1 = O2).\n {\n applys* Heap_binds_func.\n apply object_loc_comparable. \n } subst. false~.\n simpls. apply red_spec_call_number_proto_value_of_not_number;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n destruct H3 as (O & Hb & Hv).\n unfolds run_object_method.\n assert (exists a, object_binds S l a).\n eexists; jauto.\n lets Hyp : (@pick_option_defined _ (object_binds S l) (object_binds_pickable_option S l) H). \n destruct Hyp as (a & Heq). \n rewrite Heq in Heqo1.\n simpls. inverts Heqo1.\n apply red_spec_call_number_proto_value_of_not_number;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n destruct H0 as (O & Hb & Hv).\n unfolds run_object_method.\n assert (exists a, object_binds S l a).\n exists~ O. \n lets Hyp : (@pick_option_defined _ (object_binds S l) (object_binds_pickable_option S l) H). \n destruct Hyp as (a & Heq). \n rewrite Heq in Heqo0.\n simpls. assert (a = O).\n {\n apply pick_option_correct in Heq.\n applys* Heap_binds_func.\n apply object_loc_comparable. \n } subst. rewrite Hv in Heqo0. false*.\n simpls. apply red_spec_call_number_proto_value_of_not_number;\n [introv Hv; inverts Hv | applys* run_error_correct]. \n destruct H0 as (O & Hb & Hv).\n unfolds run_object_method.\n assert (exists a, object_binds S l a).\n exists~ O. \n lets Hyp : (@pick_option_defined _ (object_binds S l) (object_binds_pickable_option S l) H). \n destruct Hyp as (a & Heq). \n rewrite Heq in Heqo0.\n simpls. inverts Heqo0. \n (* prealloc_number_proto_to_fixed *)\n discriminate.\n (* prealloc_number_proto_to_exponential *)\n discriminate.\n (* prealloc_number_proto_to_precision *)\n discriminate.\n\n (* prealloc_array *)\n apply run_construct_prealloc_correct in HR; auto.\n applys* red_spec_call_to_construct_array. auto.\n\n (* prealloc_array_is_array *)\n let_name; subst. \n applys* red_spec_call_array_is_array_fetch_arg.\n applys* get_arg_correct_0.\n destruct (get_arg 0 args). \n inverts HR. applys* red_spec_call_array_is_array_1. \n run. apply run_object_method_correct in E. \n applys* red_spec_call_array_is_array_2_branch.\n cases_if*; inverts HR.\n applys* red_spec_call_array_is_array_2.\n applys* red_spec_call_array_is_array_3.\n\n (* prealloc_array_proto *)\n discriminate.\n\n (* prealloc_array_proto_to_string *)\n run red_spec_call_array_proto_to_string using to_object_correct.\n run red_spec_call_array_proto_to_string_1 using run_object_get_correct.\n cases_if*. \n destruct v as [p | array]; inverts HR.\n applys* red_spec_call_array_proto_to_string_2_true.\n applys* runs_type_correct_call.\n applys* red_spec_call_array_proto_to_string_2_false.\n applys* runs_type_correct_call_prealloc.\n \n (* prealloc_array_proto_join *)\n let_name; subst.\n run red_spec_call_array_proto_join using to_object_correct.\n run red_spec_call_array_proto_join_1 using run_object_get_correct.\n run red_spec_call_array_proto_join_2. let_name; subst.\n applys* red_spec_call_array_proto_join_3. \n apply get_arg_correct_0. cases_if*.\n run~ red_spec_call_array_proto_join_3_other.\n cases_if*. inverts HR. applys* red_spec_call_array_proto_join_4.\n let_name; subst.\n run~ red_spec_call_array_proto_join_5 using vtsfj_correct. \n apply red_spec_call_array_proto_join_6. applys* run_array_join_elements_correct.\n run~ red_spec_call_array_proto_join_3_undef.\n cases_if*. inverts HR. applys* red_spec_call_array_proto_join_4.\n let_name; subst.\n run~ red_spec_call_array_proto_join_5 using vtsfj_correct. \n apply red_spec_call_array_proto_join_6. applys* run_array_join_elements_correct.\n\n (* prealloc_array_proto_pop *)\n run red_spec_call_array_proto_pop using to_object_correct. \n run red_spec_call_array_proto_pop_1 using run_object_get_correct.\n run red_spec_call_array_proto_pop_2. cases_if*. subst.\n apply red_spec_call_array_proto_pop_3_empty.\n run red_spec_call_array_proto_pop_3_empty_1.\n apply red_spec_call_array_proto_pop_3_empty_2.\n applys~ red_spec_call_array_proto_pop_3_nonempty.\n run red_spec_call_array_proto_pop_3_nonempty_1.\n run red_spec_call_array_proto_pop_3_nonempty_2 using run_object_get_correct.\n run red_spec_call_array_proto_pop_3_nonempty_3 using object_delete_default_correct. \n run red_spec_call_array_proto_pop_3_nonempty_4.\n applys~ red_spec_call_array_proto_pop_3_nonempty_5.\n \n (* prealloc_array_proto_push *)\n run red_spec_call_array_proto_push using to_object_correct. \n run red_spec_call_array_proto_push_1 using run_object_get_correct.\n run red_spec_call_array_proto_push_2.\n applys* push_correct.\n\n (* prealloc_string *)\n\n cases_if; substs.\n inverts HR. apply red_spec_call_string_empty.\n let_name; substs. run red_spec_call_string_non_empty.\n apply get_arg_correct_0.\n apply red_spec_call_string_non_empty_1.\n\n (* prealloc_string_proto *)\n discriminate. (* LATER *)\n (* prealloc_string_proto_to_string *)\n applys* red_spec_call_string_proto_to_string.\n destruct vthis as [p | l]. cases_if*. \n inverts HR. applys* red_spec_call_string_proto_value_of_prim_string.\n applys* red_spec_call_string_proto_value_of_bad_type.\n run. apply run_object_method_correct in E.\n cases_if*. subst.\n apply run_object_prim_value_correct in HR.\n destruct HR as (v & Heq & Hprim). subst.\n applys* red_spec_call_string_proto_value_of_obj_string.\n applys* red_spec_call_string_proto_value_of_obj_other.\n destruct E as (y & Hbind & Hclass).\n introv (y' & Hbind' & Hclass').\n assert (y = y'). applys* Heap_binds_func.\n apply object_loc_comparable. subst. false~.\n (* prealloc_string_proto_value_of *)\n destruct vthis as [p | l]. cases_if*. inverts HR. \n applys* red_spec_call_string_proto_value_of_prim_string.\n applys* red_spec_call_string_proto_value_of_bad_type.\nrun. apply run_object_method_correct in E.\n cases_if*. subst.\n apply run_object_prim_value_correct in HR.\n destruct HR as (v & Heq & Hprim). subst.\n applys* red_spec_call_string_proto_value_of_obj_string.\n applys* red_spec_call_string_proto_value_of_obj_other.\n destruct E as (y & Hbind & Hclass).\n introv (y' & Hbind' & Hclass').\n assert (y = y'). applys* Heap_binds_func.\n apply object_loc_comparable. subst. false~.\n (* prealloc_string_proto_char_at *)\n discriminate.\n (* prealloc_string_proto_char_code_at *)\n discriminate.\n (* prealloc_math *)\n discriminate.\n (* prealloc_mathop *)\n discriminate.\n (* prealloc_date *)\n discriminate.\n (* prealloc_regexp *)\n discriminate. \n (* prealloc_error *)\n let_name. apply~ red_spec_call_error.\n apply~ get_arg_correct_0.\n substs. apply* build_error_correct.\n (* prealloc_error_proto *)\n discriminate.\n (* prealloc_native_error *)\n let_name. applys* red_spec_call_native_error.\n apply~ get_arg_correct_0.\n substs; applys* build_error_correct.\n (* prealloc_native_error_proto *)\n discriminate.\n (* prealloc_error_proto_to_string *)\n discriminate.\n (* prealloc_throw_type_error *)\n apply~ red_spec_call_throw_type_error.\n apply* run_error_correct.\n (* prealloc_json *)\n discriminate.\nAdmitted. (* faster *)\n\nLemma run_call_correct : forall runs S C l v vs o,\n runs_type_correct runs ->\n run_call runs S C l v vs = o ->\n red_expr S C (spec_call l v vs) o.\nProof.\n introv IH HR. simpls. unfolds in HR.\n run. run. subst. lets H: run_object_method_correct (rm E).\n applys* red_spec_call. clear H.\n destruct x0.\n applys* red_spec_call_1_default. applys* red_spec_call_default.\n applys* entering_func_code_correct.\n\n repeat run. let_name. subst.\n apply run_object_method_correct in E; apply run_object_method_correct in E1; \n apply run_object_method_correct in E3.\n applys* red_spec_call_1_after_bind_full.\n applys* runs_type_correct_call.\n\n applys* red_spec_call_1_prealloc. applys* run_call_prealloc_correct.\nAdmitted. (* faster *)\n\n\nLemma run_stat_while_correct : forall runs S C rv ls e t o,\n runs_type_correct runs ->\n run_stat_while runs S C rv ls e t = o ->\n red_stat S C (stat_while_1 ls e t rv) o.\nProof.\n intros runs IH ls e t S C rv o R. unfolds in R.\n run_pre. lets (y1&R2&K): if_spec_post_to_bool (rm R1) (rm R).\n applys~ red_stat_while_1 (rm R2). run_post_if_spec_ter_post_bool K.\n case_if.\n run red_stat_while_2_true.\n let_name. let_simpl. applys red_stat_while_3 rv'. case_if; case_if*.\n case_if in K.\n applys red_stat_while_4_not_continue. rew_logic*. case_if in K.\n run_inv. applys* red_stat_while_5_break.\n applys* red_stat_while_5_not_break. case_if in K; run_inv.\n applys* red_stat_while_6_abort.\n applys* red_stat_while_6_normal. run_hyp*.\n rew_logic in *. applys* red_stat_while_4_continue. run_hyp*.\n run_inv. applys red_stat_while_2_false.\nAdmitted. (*faster*)\n\nLemma run_stat_do_while_correct : forall runs S C rv ls e t o,\n runs_type_correct runs ->\n run_stat_do_while runs S C rv ls e t = o ->\n red_stat S C (stat_do_while_1 ls t e rv) o.\nProof.\n introv IH R. unfolds in R.\n run red_stat_do_while_1. do 2 let_name.\n applys~ red_stat_do_while_2 rv'.\n repeat cases_if~. clear EQrv'.\n asserts loop_correct: (forall o, loop tt = res_out o ->\n red_stat S0 C (stat_do_while_6 ls t e rv') o).\n clear R. introv H. subst loop.\n run_pre. lets (y1&R2&K): if_spec_post_to_bool (rm R1) (rm H).\n applys~ red_stat_do_while_6 (rm R2). run_post_if_spec_ter_post_bool K.\n cases_if.\n apply~ red_stat_do_while_7_true. apply* IH.\n run_inv. apply* red_stat_do_while_7_false.\n clear EQloop. cases_if in R.\n apply~ red_stat_do_while_3_continue. rewrite decide_def in H. cases_if~ in H.\n apply~ red_stat_do_while_3_not_continue.\n rewrite decide_def in H. cases_if~ in H. clear H. cases_if.\n run_inv. apply~ red_stat_do_while_4_break.\n apply~ red_stat_do_while_4_not_break. cases_if; run_inv.\n apply~ red_stat_do_while_5_abort.\n apply~ red_stat_do_while_5_normal.\nAdmitted. (*faster*)\n\nLemma run_stat_for_loop_correct : forall runs S C labs rv eo2 eo3 t o,\n runs_type_correct runs ->\n run_stat_for_loop runs S C labs rv eo2 eo3 t = o ->\n red_stat S C (stat_for_2 labs rv eo2 eo3 t) o.\nProof.\n introv IH R. unfolds in R. let_name.\n asserts follows_correct: (forall S o, follows S = res_out o ->\n red_stat S C (stat_for_4 labs rv eo2 eo3 t) o).\n clear R. introv R. rewrite EQfollows in R. clear EQfollows.\n run red_stat_for_4. do 2 let_name. applys~ red_stat_for_5 rv'.\n repeat cases_if*.\n clear EQrv'. cases_if.\n run_inv. apply~ red_stat_for_6_break.\n apply~ red_stat_for_6_not_break. rew_logic~ in *. cases_if.\n apply red_stat_for_7_continue. rew_logic~ in *. destruct eo3.\n run red_stat_for_8_some. subst loop. run_hyp.\n apply~ red_stat_for_9.\n subst loop. run_hyp. apply~ red_stat_for_8_none.\n run_inv. apply~ red_stat_for_7_abort. rew_logic* in *.\n clear EQfollows. destruct eo2.\n run_pre. lets (y1&R2&K): if_spec_post_to_bool (rm R1) (rm R).\n applys~ red_stat_for_2_some (rm R2). run_post_if_spec_ter_post_bool K.\n cases_if; run_inv.\n apply~ red_stat_for_3_not_false. discriminate.\n apply~ red_stat_for_3_false.\n apply~ red_stat_for_2_none.\nAdmitted. (*faster*)\n\n\nLemma object_proto_is_prototype_of_correct : forall runs S C lthis l o,\n runs_type_correct runs ->\n object_proto_is_prototype_of runs S lthis l = o ->\n red_expr S C (spec_call_object_proto_is_prototype_of_2_3 lthis l) o.\nProof.\n introv IH HR. unfolds in HR.\n run. forwards* Omp: run_object_method_correct.\n applys~ red_spec_call_object_proto_is_prototype_of_3 Omp.\n destruct x as [p|]. (* LTAC ARTHUR *)\n destruct p; inverts HR.\n apply~ red_spec_call_object_proto_is_prototype_of_4_null.\n cases_if; substs; inverts HR.\n apply~ red_spec_call_object_proto_is_prototype_of_4_equal.\n run_hyp. apply* red_spec_call_object_proto_is_prototype_of_4_not_equal.\nAdmitted. (*faster*)\n\n\nLemma run_equal_correct : forall runs S C v1 v2 o,\n runs_type_correct runs ->\n run_equal runs S C v1 v2 = o ->\n red_expr S C (spec_equal v1 v2) o.\nProof.\n introv IH R. unfolds in R. let_simpl.\n apply~ red_spec_equal. cases_if.\n run_inv. rewrite e. apply~ red_spec_equal_1_same_type.\n apply~ red_spec_equal_1_diff_type. let_name.\n asserts dc_conv_correct: (forall v1 F Ext v2 o,\n dc_conv v1 F v2 = res_out o ->\n (forall S v o, F S v = o -> red_expr S C (Ext v) o) ->\n red_expr S C (spec_equal_3 v1 Ext v2) o).\n clear R. introv E Cor. substs. run red_spec_equal_3_convert_and_recurse.\n run_inv. apply* Cor.\n run_hyp. apply~ red_spec_equal_4_recurse.\n clear EQdc_conv.\n Ltac eqcas R :=\n match type of R with context [ ifb ?P then _ else _ ] =>\n let x := fresh \"x\" in set (x := P) in * end;\n case_if in R as C; [ rewrite If_l; try assumption\n | rewrite If_r; try assumption ].\n eqcas R. run_inv. applys red_spec_equal_2_return.\n eqcas R. run_inv. applys red_spec_equal_2_return.\n eqcas R. applys dc_conv_correct R. introv E. applys* to_number_correct E.\n eqcas R. applys dc_conv_correct R. introv E. applys* to_number_correct E.\n eqcas R. applys dc_conv_correct R. introv E. applys* to_number_correct E.\n eqcas R. applys dc_conv_correct R. introv E. applys* to_number_correct E.\n eqcas R. applys dc_conv_correct R. introv E. applys* to_primitive_correct E.\n eqcas R. applys dc_conv_correct R. introv E. applys* to_primitive_correct E.\n run_inv. applys red_spec_equal_2_return.\nAdmitted. (* faster *)\n\nTheorem runs_correct : forall num,\n runs_type_correct (runs num).\nProof.\n induction num.\n constructors;\n try (introv M; inverts M; introv P; inverts P). \n introv Hyp M; inverts M. \n constructors.\n introv. apply~ run_expr_correct.\n introv. apply~ run_stat_correct.\n introv. apply~ run_prog_correct.\n introv. apply~ run_call_correct.\n introv. apply~ run_call_prealloc_correct.\n introv. apply~ run_construct_correct.\n introv. apply~ run_function_has_instance_correct.\n introv. apply~ run_function_proto_apply_get_args_correct.\n introv. apply~ run_object_has_instance_correct.\n introv. apply~ run_stat_while_correct.\n introv. apply~ run_stat_do_while_correct.\n introv. apply~ run_stat_for_loop_correct.\n introv. apply~ object_delete_correct.\n introv. apply~ run_object_get_own_prop_correct.\n introv. apply~ run_object_get_prop_correct.\n introv. apply~ run_object_get_correct.\n introv. apply~ object_proto_is_prototype_of_correct.\n introv. apply~ object_put_correct.\n introv. apply~ run_equal_correct.\n introv. apply~ to_integer_correct.\n introv. apply~ to_string_correct.\n introv. apply~ run_array_element_list_correct.\n introv Hyp. apply~ run_object_define_own_prop_array_loop_correct.\n introv. apply~ run_array_join_elements_correct.\nQed.\n\nTheorem run_javascript_correct : forall runs p o,\n runs_type_correct runs ->\n run_javascript runs p = o ->\n red_javascript p o.\nProof.\n introv IH HR. unfolds in HR. run_pre as o1 R1.\n applys* red_javascript_intro R1. run_post. run_inv. run_hyp.\n apply~ red_javascript_intro_1.\nQed.\n\nCorollary run_javascript_correct_num : forall num p o,\n run_javascript (runs num) p = result_out o ->\n red_javascript p o.\nProof.\n introv IH. applys~ run_javascript_correct IH.\n apply~ runs_correct.\nQed. \n\n" }, { "path": "src/test/resources/samples/langs/Coq/JsInterpreterExtraction.v", "content": "Set Implicit Arguments.\nRequire Import JsSyntax JsInterpreterMonads JsInterpreter JsInit.\nRequire Import LibFix LibList.\n\nRequire Export Shared.\nRequire Export LibTactics LibLogic LibReflect LibList\n LibOperation LibStruct LibNat LibEpsilon LibFunc LibHeap.\nRequire Flocq.Appli.Fappli_IEEE Flocq.Appli.Fappli_IEEE_bits.\n\n\n\n(* Here stands some commands to extract relatively correctly the interpreter to Ocaml. *)\nExtraction Language Ocaml.\n\nRequire Import ExtrOcamlBasic.\nRequire Import ExtrOcamlNatInt.\nRequire Import ExtrOcamlString.\n\n(* Optimal fixpoint. *)\nExtraction Inline FixFun3 FixFun3Mod FixFun4 FixFun4Mod FixFunMod curry3 uncurry3 curry4 uncurry4.\n(* As classical logic statements are now unused, they should not be extracted\n (otherwise, useless errors will be launched). *)\nExtraction Inline epsilon epsilon_def classicT arbitrary indefinite_description Inhab_witness Fix isTrue.\n\n(**************************************************************)\n(** ** Numerical values *)\n\n(* number *)\n\nExtract Inductive positive => float\n[ \"(fun p -> 1. +. (2. *. p))\"\n \"(fun p -> 2. *. p)\"\n \"1.\" ]\n\"(fun f2p1 f2p f1 p ->\nif p <= 1. then f1 () else if mod_float p 2. = 0. then f2p (floor (p /. 2.)) else f2p1 (floor (p /. 2.)))\".\n\nExtract Inductive Z => float [ \"0.\" \"\" \"(~-.)\" ]\n\"(fun f0 fp fn z -> if z=0. then f0 () else if z>0. then fp z else fn (~-. z))\".\n\nExtract Inductive N => float [ \"0.\" \"\" ]\n\"(fun f0 fp n -> if n=0. then f0 () else fp n)\".\n\nExtract Constant Z.add => \"(+.)\".\nExtract Constant Z.succ => \"(+.) 1.\".\nExtract Constant Z.pred => \"(fun x -> x -. 1.)\".\nExtract Constant Z.sub => \"(-.)\".\nExtract Constant Z.mul => \"( *. )\".\nExtract Constant Z.opp => \"(~-.)\".\nExtract Constant Z.abs => \"abs_float\".\nExtract Constant Z.min => \"min\".\nExtract Constant Z.max => \"max\".\nExtract Constant Z.compare =>\n \"fun x y -> if x=y then Eq else if x \"(+.)\".\nExtract Constant Pos.succ => \"(+.) 1.\".\nExtract Constant Pos.pred => \"(fun x -> x -. 1.)\".\nExtract Constant Pos.sub => \"(-.)\".\nExtract Constant Pos.mul => \"( *. )\".\nExtract Constant Pos.min => \"min\".\nExtract Constant Pos.max => \"max\".\nExtract Constant Pos.compare =>\n \"fun x y -> if x=y then Eq else if x\n \"fun x y c -> if x=y then c else if x \"(+.)\".\nExtract Constant N.succ => \"(+.) 1.\".\nExtract Constant N.pred => \"(fun x -> x -. 1.)\".\nExtract Constant N.sub => \"(-.)\".\nExtract Constant N.mul => \"( *. )\".\nExtract Constant N.min => \"min\".\nExtract Constant N.max => \"max\".\nExtract Constant N.div => \"(fun x y -> if x = 0. then 0. else floor (x /. y))\".\nExtract Constant N.modulo => \"mod_float\".\nExtract Constant N.compare =>\n \"fun x y -> if x=y then Eq else if x float [\n \"(fun s -> if s then (0.) else (-0.))\"\n \"(fun s -> if s then infinity else neg_infinity)\"\n \"nan\"\n \"(fun (s, m, e) -> failwith \"\"FIXME: No extraction from binary float allowed yet.\"\")\"\n]. \n\nExtract Constant JsNumber.of_int => \"fun x -> x\".\n\nExtract Constant JsNumber.nan => \"nan\".\nExtract Constant JsNumber.zero => \"0.\".\nExtract Constant JsNumber.neg_zero => \"(-0.)\".\nExtract Constant JsNumber.one => \"1.\".\nExtract Constant JsNumber.infinity => \"infinity\".\nExtract Constant JsNumber.neg_infinity => \"neg_infinity\".\nExtract Constant JsNumber.max_value => \"max_float\".\nExtract Constant JsNumber.min_value => \"(Int64.float_of_bits Int64.one)\".\nExtract Constant JsNumber.pi => \"(4. *. atan 1.)\".\nExtract Constant JsNumber.e => \"(exp 1.)\".\nExtract Constant JsNumber.ln2 => \"(log 2.)\".\nExtract Constant JsNumber.floor => \"floor\".\nExtract Constant JsNumber.absolute => \"abs_float\".\n\nExtract Constant JsNumber.from_string =>\n \"(fun s ->\n try\n let s = (String.concat \"\"\"\" (List.map (String.make 1) s)) in\n if s = \"\"\"\" then 0. else float_of_string s\n with Failure \"\"float_of_string\"\" -> nan)\n (* Note that we're using `float_of_string' there, which does not have the same\n behavior than JavaScript. For instance it will read \"\"022\"\" as 22 instead of\n 18, which should be the JavaScript result for it. *)\".\n\nExtract Constant JsNumber.to_string =>\n \"(fun f -> \n prerr_string (\"\"Warning: JsNumber.to_string called. This might be responsible for errors. Argument value: \"\" ^ string_of_float f ^ \"\".\"\");\n prerr_newline();\n let string_of_number n =\n let sfn = string_of_float n in\n (if (sfn = \"\"inf\"\") then \"\"Infinity\"\" else\n if (sfn = \"\"-inf\"\") then \"\"-Infinity\"\" else\n if (sfn = \"\"nan\"\") then \"\"NaN\"\" else\n let inum = int_of_float n in\n if (float_of_int inum = n) then (string_of_int inum) else (string_of_float n)) in\n let ret = ref [] in (* Ugly, but the API for OCaml string is not very functional... *)\n String.iter (fun c -> ret := c :: !ret) (string_of_number f);\n List.rev !ret)\n (* Note that this is ugly, we should use the spec of JsNumber.to_string here (9.8.1). *)\".\n\nExtract Constant JsNumber.add => \"(+.)\".\nExtract Constant JsNumber.sub => \"(-.)\".\nExtract Constant JsNumber.mult => \"( *. )\".\nExtract Constant JsNumber.div => \"(/.)\".\nExtract Constant JsNumber.fmod => \"mod_float\".\nExtract Constant JsNumber.neg => \"(~-.)\".\nExtract Constant JsNumber.sign => \"(fun f -> float_of_int (compare f 0.))\".\nExtract Constant JsNumber.number_comparable => \"(fun n1 n2 -> 0 = compare n1 n2)\".\nExtract Constant JsNumber.lt_bool => \"(<)\".\n\nExtract Constant JsNumber.to_int32 => \n\"fun n ->\n match classify_float n with\n | FP_normal | FP_subnormal ->\n let i32 = 2. ** 32. in\n let i31 = 2. ** 31. in\n let posint = (if n < 0. then (-1.) else 1.) *. (floor (abs_float n)) in\n let int32bit =\n let smod = mod_float posint i32 in\n if smod < 0. then smod +. i32 else smod\n in\n (if int32bit >= i31 then int32bit -. i32 else int32bit)\n | _ -> 0.\". (* LATER: do in Coq. Spec is 9.5, p. 47.*)\n\nExtract Constant JsNumber.to_uint32 =>\n\"fun n ->\n match classify_float n with\n | FP_normal | FP_subnormal ->\n let i32 = 2. ** 32. in\n let posint = (if n < 0. then (-1.) else 1.) *. (floor (abs_float n)) in\n let int32bit =\n let smod = mod_float posint i32 in\n if smod < 0. then smod +. i32 else smod\n in\n int32bit\n | _ -> 0.\". (* LAER: do in Coq. Spec is 9.6, p47.*)\n\nExtract Constant JsNumber.modulo_32 => \"(fun x -> let r = mod_float x 32. in if x < 0. then r +. 32. else r)\".\nExtract Constant JsNumber.int32_bitwise_not => \"fun x -> Int32.to_float (Int32.lognot (Int32.of_float x))\".\nExtract Constant JsNumber.int32_bitwise_and => \"fun x y -> Int32.to_float (Int32.logand (Int32.of_float x) (Int32.of_float y))\".\nExtract Constant JsNumber.int32_bitwise_or => \"fun x y -> Int32.to_float (Int32.logor (Int32.of_float x) (Int32.of_float y))\".\nExtract Constant JsNumber.int32_bitwise_xor => \"fun x y -> Int32.to_float (Int32.logxor (Int32.of_float x) (Int32.of_float y))\".\nExtract Constant JsNumber.int32_left_shift => \"(fun x y -> Int32.to_float (Int32.shift_left (Int32.of_float x) (int_of_float y)))\".\nExtract Constant JsNumber.int32_right_shift => \"(fun x y -> Int32.to_float (Int32.shift_right (Int32.of_float x) (int_of_float y)))\".\nExtract Constant JsNumber.uint32_right_shift => \n\"(fun x y ->\n let i31 = 2. ** 31. in\n let i32 = 2. ** 32. in\n let newx = if x >= i31 then x -. i32 else x in\n let r = Int32.to_float (Int32.shift_right_logical (Int32.of_float newx) (int_of_float y)) in\n if r < 0. then r +. i32 else r)\".\n\nExtract Constant int_of_char => \"(fun c -> float_of_int (int_of_char c))\".\n\nExtract Constant ascii_comparable => \"(=)\".\nExtract Constant lt_int_decidable => \"(<)\".\nExtract Constant le_int_decidable => \"(<=)\".\nExtract Constant ge_nat_decidable => \"(>=)\".\n\n(* TODO ARTHUR: This TLC lemma does not extract to something computable... whereas it should! *)\nExtract Constant prop_eq_decidable => \"(=)\".\n\nExtract Constant env_loc_global_env_record => \"0\".\n\n(* The following functions make pattern matches with floats and shall thus be removed. *)\nExtraction Inline Fappli_IEEE.Bplus Fappli_IEEE.binary_normalize Fappli_IEEE_bits.b64_plus.\nExtraction Inline Fappli_IEEE.Bmult Fappli_IEEE.Bmult_FF Fappli_IEEE_bits.b64_mult.\nExtraction Inline Fappli_IEEE.Bdiv Fappli_IEEE_bits.b64_div.\n\n(* New options for the interpreter to work in Coq 8.4 *)\nSet Extraction AccessOpaque.\n\n(* These parameters are implementation-dependant according to the spec.\n I've chosed some very simple values, but we could choose another thing for them. *)\nExtract Constant object_prealloc_global_proto => \"(Coq_value_prim Coq_prim_null)\".\nExtract Constant object_prealloc_global_class => \"(\n let rec aux s = function\n | 0 -> []\n | n -> let n' = n - 1 in\n s.[n'] :: aux s n'\n in let aux2 s =\n List.rev (aux s (String.length s))\n in aux2 \"\"GlobalClass\"\")\".\n\n\n(* Parsing *)\nExtract Constant parse_pickable => \"(fun s strict ->\n let str = String.concat \"\"\"\" (List.map (String.make 1) s) in\n try\n let parserExp = Parser_main.exp_from_string ~force_strict:strict str in\n Some (JsSyntaxInfos.add_infos_prog strict\n (Translate_syntax.exp_to_prog parserExp))\n with\n (* | Translate_syntax.CoqSyntaxDoesNotSupport _ -> assert false (* Temporary *) *)\n | Parser.ParserFailure _\n | Parser.InvalidArgument ->\n prerr_string (\"\"Warning: Parser error on eval. Input string: \\\"\"\"\" ^ str ^ \"\"\\\"\"\\n\"\");\n None\n )\".\n\n\n(* Debugging *)\nExtract Inlined Constant not_yet_implemented_because => \"(fun s ->\n print_endline (__LOC__ ^ \"\": Not implemented because: \"\" ^ Prheap.string_of_char_list s) ;\n Coq_result_not_yet_implemented)\".\nExtract Inlined Constant impossible_because => \"(fun s ->\n print_endline (__LOC__ ^ \"\": Stuck because: \"\" ^ Prheap.string_of_char_list s) ;\n Coq_result_impossible)\".\nExtract Inlined Constant impossible_with_heap_because => \"(fun s message ->\n print_endline (__LOC__ ^ \"\": Stuck!\\nState: \"\" ^ Prheap.prstate true s\n ^ \"\"\\nMessage:\\t\"\" ^ Prheap.string_of_char_list message) ;\n Coq_result_impossible)\".\n\n\n(* Final Extraction *)\nExtraction Blacklist string list bool.\nSeparate Extraction runs run_javascript.\n\n\n\n(* -- LATER: extract inequality_test_string in more efficient way*)\n\n" }, { "path": "src/test/resources/samples/langs/Coq/JsNumber.v", "content": "Set Implicit Arguments.\nRequire Export Shared.\nRequire Flocq.Appli.Fappli_IEEE Flocq.Appli.Fappli_IEEE_bits.\n\n\n(**************************************************************)\n(** ** Type for number (IEEE floats) *)\n\nDefinition number : Type :=\n Fappli_IEEE_bits.binary64.\n\n\n(**************************************************************)\n(** ** Particular values of numbers *)\n\n(* LATER: find definitions in Flocq *)\nParameter nan : number.\nParameter zero : number.\nParameter neg_zero : number.\nDefinition one := Fappli_IEEE.binary_normalize 53 1024 eq_refl eq_refl Fappli_IEEE.mode_NE 1 0 false.\nParameter infinity : number.\nParameter neg_infinity : number.\nParameter max_value : number.\nParameter min_value : number.\nParameter pi : number.\nParameter e : number.\nParameter ln2 : number.\n\n(**************************************************************)\n(** ** Conversions on numbers *)\n\n(* LATER: implement definitions *)\nParameter from_string : string -> number.\nParameter to_string : number -> string.\n\n(**************************************************************)\n(** ** Unary operations on numbers *)\n\n(* LATER: find definitions in Flocq *)\n\nParameter neg : number -> number.\nParameter floor : number -> number.\nParameter absolute : number -> number.\nParameter sign : number -> number. (* returns arbitrary when x is zero or nan *)\nParameter lt_bool : number -> number -> bool.\n\n\n(**************************************************************)\n(** ** Binary operations on numbers *)\n\nDefinition add : number -> number -> number :=\n Fappli_IEEE_bits.b64_plus Fappli_IEEE.mode_NE.\n\nParameter sub : number -> number -> number. (* todo: bind *)\n\nParameter fmod : number -> number -> number. (* todo: bind *)\n\nDefinition mult : number -> number -> number :=\n Fappli_IEEE_bits.b64_mult Fappli_IEEE.mode_NE.\n\nDefinition div : number -> number -> number :=\n Fappli_IEEE_bits.b64_div Fappli_IEEE.mode_NE.\n\n(* Todo: find comparison operator *)\nGlobal Instance number_comparable : Comparable number.\nProof. Admitted.\n\n\n\n(**************************************************************)\n(** ** Conversions with Int32 *)\n\nParameter of_int : int -> number. (* LATER: this is quite complex. Should we make it precise? *)\n\nParameter to_int32 : number -> int. (* Remark: extracted code could, for efficiency reasons, use Ocaml Int32 *) \n\nParameter to_uint32 : number -> int.\n\nParameter to_int16 : number -> int. (* currently not used *)\n\n(* LATER: Check that the OCaml extraction is correct. *)\n\n\n(**************************************************************)\n\n(** Implements the operation that masks all but the 5 least significant bits\n of a non-negative number (obtained as the result of to_uint32 *)\n\nParameter modulo_32 : int -> int.\n\n(** Implements int32 operation *)\n\nParameter int32_bitwise_not : int -> int.\n\nParameter int32_bitwise_and : int -> int -> int.\nParameter int32_bitwise_or : int -> int -> int.\nParameter int32_bitwise_xor : int -> int -> int.\n\nParameter int32_left_shift : int -> int -> int.\nParameter int32_right_shift : int -> int -> int.\nParameter uint32_right_shift : int -> int -> int.\n\n\n\n\n(**************************************************************)\n(** ** Int32 related conversion *)\n" }, { "path": "src/test/resources/samples/langs/Coq/JsPrettyInterm.v", "content": "Set Implicit Arguments.\nRequire Export JsSyntax JsSyntaxAux JsPreliminary.\n\n(**************************************************************)\n(** ** Implicit Types -- copied from JsPreliminary *)\n\nImplicit Type b : bool.\nImplicit Type n : number.\nImplicit Type k : int.\nImplicit Type s : string.\nImplicit Type i : literal.\nImplicit Type l : object_loc.\nImplicit Type w : prim.\nImplicit Type v : value.\nImplicit Type r : ref.\n(*Implicit Type B : builtin.*)\nImplicit Type ty : type.\n\nImplicit Type rt : restype.\nImplicit Type rv : resvalue.\nImplicit Type lab : label.\nImplicit Type labs : label_set.\nImplicit Type R : res.\nImplicit Type o : out.\n\nImplicit Type x : prop_name.\nImplicit Type str : strictness_flag.\nImplicit Type m : mutability.\nImplicit Type Ad : attributes_data.\nImplicit Type Aa : attributes_accessor.\nImplicit Type A : attributes.\nImplicit Type Desc : descriptor.\nImplicit Type D : full_descriptor.\n\nImplicit Type L : env_loc.\nImplicit Type E : env_record.\nImplicit Type Ed : decl_env_record.\nImplicit Type X : lexical_env.\nImplicit Type O : object.\nImplicit Type S : state.\nImplicit Type C : execution_ctx.\nImplicit Type P : object_properties_type.\n\nImplicit Type e : expr.\nImplicit Type p : prog.\nImplicit Type t : stat.\n\n\n(****************************************************************)\n(** ** Intermediate expression for the Pretty-Big-Step semantic *)\n\n(** Grammar of extended expressions *)\n\nInductive ext_expr :=\n\n (** Extended expressions include expressions *)\n\n | expr_basic : expr -> ext_expr\n\n (** Extended expressions associated with primitive expressions *)\n\n | expr_identifier_1 : specret ref -> ext_expr\n\n | expr_object_0 : out -> propdefs -> ext_expr\n | expr_object_1 : object_loc -> propdefs -> ext_expr\n | expr_object_2 : object_loc -> string -> propbody -> propdefs -> ext_expr \n | expr_object_3_val : object_loc -> string -> specret value -> propdefs -> ext_expr\n | expr_object_3_get : object_loc -> string -> out -> propdefs -> ext_expr\n | expr_object_3_set : object_loc -> string -> out -> propdefs -> ext_expr\n | expr_object_4 : object_loc -> string -> descriptor -> propdefs -> ext_expr\n | expr_object_5 : object_loc -> propdefs -> out -> ext_expr\n\n\n\n\n\n (* _ARRAYS_ : support for array intermediate forms *)\n | expr_array_0 : out -> list (option expr) -> ext_expr\n | expr_array_1 : object_loc -> list (option expr) -> ext_expr\n | expr_array_2 : object_loc -> list (option expr) -> int -> ext_expr\n | expr_array_3 : object_loc -> list (option expr) -> int -> ext_expr\n | expr_array_3_1 : object_loc -> specret value -> list (option expr) -> int -> ext_expr\n | expr_array_3_2 : object_loc -> value -> out -> list (option expr) -> int -> ext_expr\n | expr_array_3_3 : object_loc -> value -> specret int -> list (option expr) -> int -> ext_expr\n | expr_array_3_4 : object_loc -> value -> out -> list (option expr) -> ext_expr\n | expr_array_3_5 : object_loc -> out -> list (option expr) -> ext_expr\n\n | expr_array_add_length : object_loc -> int -> out -> ext_expr\n | expr_array_add_length_0 : object_loc -> int -> ext_expr\n | expr_array_add_length_1 : object_loc -> int -> out -> ext_expr\n | expr_array_add_length_2 : object_loc -> specret int -> int -> ext_expr\n | expr_array_add_length_3 : object_loc -> specret int -> ext_expr\n | expr_array_add_length_4 : object_loc -> out -> ext_expr\n\n\n\n\n\n | expr_function_1 : string -> list string -> funcbody -> env_loc -> lexical_env -> out -> ext_expr\n | expr_function_2 : string -> env_loc -> out -> ext_expr\n | expr_function_3 : object_loc -> out -> ext_expr\n\n | expr_access_1 : specret value -> expr -> ext_expr (* The left expression has been executed *)\n | expr_access_2 : value -> specret value -> ext_expr (* The right expression is executed. *)\n | expr_access_3 : value -> out -> value -> ext_expr\n | expr_access_4 : value -> out -> ext_expr\n\n | expr_new_1 : specret value -> list expr -> ext_expr (* The arguments too. *)\n | expr_new_2 : value -> specret (list value) -> ext_expr (* The call has been executed. *)\n\n | expr_call_1 : out -> bool -> list expr -> ext_expr\n | expr_call_2 : res -> bool -> list expr -> specret value -> ext_expr (* The function has been evaluated. *)\n | expr_call_3 : res -> value -> bool -> specret (list value) -> ext_expr (* The arguments have been executed. *)\n | expr_call_4 : res -> object_loc -> bool -> list value -> ext_expr\n | expr_call_5 : object_loc -> bool -> list value -> out -> ext_expr (* The call has been executed. *)\n\n | spec_eval : bool -> value -> list value -> ext_expr\n\n | expr_unary_op_1 : unary_op -> (specret value) -> ext_expr (* The argument have been executed. *)\n | expr_unary_op_2 : unary_op -> value -> ext_expr (* The argument is a value. *)\n | expr_delete_1 : out -> ext_expr\n | expr_delete_2 : ref -> ext_expr\n | expr_delete_3 : ref -> out -> ext_expr\n | expr_delete_4 : ref -> env_loc -> ext_expr\n | expr_typeof_1 : out -> ext_expr\n | expr_typeof_2 : specret value -> ext_expr\n | expr_prepost_1 : unary_op -> out -> ext_expr\n | expr_prepost_2 : unary_op -> res -> specret value -> ext_expr\n | expr_prepost_3 : unary_op -> res -> out -> ext_expr\n | expr_prepost_4 : value -> out -> ext_expr\n | expr_unary_op_neg_1 : out -> ext_expr\n | expr_unary_op_bitwise_not_1 : specret int -> ext_expr\n | expr_unary_op_not_1 : out -> ext_expr\n | expr_conditional_1 : specret value -> expr -> expr -> ext_expr\n | expr_conditional_1': out -> expr -> expr -> ext_expr\n | expr_conditional_2 : specret value -> ext_expr\n\n | expr_binary_op_1 : binary_op -> (specret value) -> expr -> ext_expr\n | expr_binary_op_2 : binary_op -> value -> (specret value) -> ext_expr\n | expr_binary_op_3 : binary_op -> value -> value -> ext_expr\n | expr_binary_op_add_1 : specret (value*value) -> ext_expr\n | expr_binary_op_add_string_1 : specret (value*value) -> ext_expr\n | expr_puremath_op_1 : (number -> number -> number) -> specret (value*value) -> ext_expr\n | expr_shift_op_1 : (int -> int -> int) -> specret int -> value -> ext_expr\n | expr_shift_op_2 : (int -> int -> int) -> int -> specret int -> ext_expr\n | expr_inequality_op_1 : bool -> bool -> value -> value -> ext_expr\n | expr_inequality_op_2 : bool -> bool -> specret (value*value) -> ext_expr\n | expr_binary_op_in_1 : object_loc -> out -> ext_expr\n | expr_binary_op_disequal_1 : out -> ext_expr\n | spec_equal : value -> value -> ext_expr\n | spec_equal_1 : type -> type -> value -> value -> ext_expr\n | spec_equal_2 : bool -> ext_expr\n | spec_equal_3 : value -> (value -> ext_expr) -> value -> ext_expr\n | spec_equal_4 : value -> out -> ext_expr\n | expr_bitwise_op_1 : (int -> int -> int) -> specret int -> value -> ext_expr\n | expr_bitwise_op_2 : (int -> int -> int) -> int -> specret int -> ext_expr\n | expr_lazy_op_1 : bool -> (specret value) -> expr -> ext_expr\n | expr_lazy_op_2 : bool -> value -> out -> expr -> ext_expr\n | expr_lazy_op_2_1 : (specret value) -> ext_expr\n\n | expr_assign_1 : out -> option binary_op -> expr -> ext_expr\n | expr_assign_2 : res -> (specret value) -> binary_op -> expr -> ext_expr\n | expr_assign_3 : res -> value -> binary_op -> (specret value) -> ext_expr\n | expr_assign_3' : res -> out -> ext_expr\n | expr_assign_4 : res -> (specret value) -> ext_expr\n | expr_assign_5 : value -> out -> ext_expr\n\n (** Extended expressions for conversions *)\n\n | spec_to_primitive : value -> option preftype -> ext_expr\n | spec_to_boolean : value -> ext_expr\n | spec_to_number : value -> ext_expr\n | spec_to_number_1 : out -> ext_expr\n | spec_to_integer : value -> ext_expr\n | spec_to_integer_1 : out -> ext_expr\n | spec_to_string : value -> ext_expr\n | spec_to_string_1 : out -> ext_expr\n | spec_to_object : value -> ext_expr\n | spec_check_object_coercible : value -> ext_expr\n\n (** Extended expressions for comparison *)\n\n | spec_eq : value -> value -> ext_expr\n | spec_eq0 : value -> value -> ext_expr\n | spec_eq1 : value -> value -> ext_expr\n | spec_eq2 : ext_expr -> value -> value -> ext_expr\n\n (** Extended expressions for operations on objects *)\n\n | spec_object_get : object_loc -> prop_name -> ext_expr\n | spec_object_get_1 : builtin_get -> value -> object_loc -> prop_name -> ext_expr\n | spec_object_get_2 : value -> specret full_descriptor -> ext_expr\n | spec_object_get_3 : value -> value -> ext_expr\n\n | spec_object_can_put : object_loc -> prop_name -> ext_expr\n | spec_object_can_put_1 : builtin_can_put -> object_loc -> prop_name -> ext_expr\n | spec_object_can_put_2 : object_loc -> prop_name -> (specret full_descriptor) -> ext_expr\n\n (* LATER: shift names since spec_object_can_put_3 is not used *)\n | spec_object_can_put_4 : object_loc -> prop_name -> value -> ext_expr\n | spec_object_can_put_5 : object_loc -> specret full_descriptor -> ext_expr\n | spec_object_can_put_6 : attributes_data -> bool -> ext_expr\n\n | spec_object_put : object_loc -> prop_name -> value -> bool -> ext_expr\n | spec_object_put_1 : builtin_put -> value -> object_loc -> prop_name -> value -> bool -> ext_expr\n | spec_object_put_2 : value -> object_loc -> prop_name -> value -> bool -> out -> ext_expr\n | spec_object_put_3 : value -> object_loc -> prop_name -> value -> bool -> specret full_descriptor -> ext_expr\n | spec_object_put_4 : value -> object_loc -> prop_name -> value -> bool -> specret full_descriptor -> ext_expr\n | spec_object_put_5 : out -> ext_expr\n\n | spec_object_has_prop : object_loc -> prop_name -> ext_expr\n | spec_object_has_prop_1 : builtin_has_prop -> object_loc -> prop_name -> ext_expr\n | spec_object_has_prop_2 : specret full_descriptor -> ext_expr\n\n | spec_object_delete : object_loc -> prop_name -> bool -> ext_expr\n | spec_object_delete_1 : builtin_delete -> object_loc -> prop_name -> bool -> ext_expr\n | spec_object_delete_2 : object_loc -> prop_name -> bool -> (specret full_descriptor) -> ext_expr\n | spec_object_delete_3 : object_loc -> prop_name -> bool -> bool -> ext_expr\n\n | spec_object_default_value : object_loc -> option preftype -> ext_expr\n | spec_object_default_value_1 : builtin_default_value -> object_loc -> option preftype -> ext_expr\n | spec_object_default_value_2 : object_loc -> preftype -> preftype -> ext_expr\n | spec_object_default_value_3 : object_loc -> preftype -> ext_expr\n | spec_object_default_value_4 : ext_expr\n | spec_object_default_value_sub_1 : object_loc -> string -> ext_expr -> ext_expr\n | spec_object_default_value_sub_2 : object_loc -> out -> ext_expr -> ext_expr\n | spec_object_default_value_sub_3 : out -> ext_expr -> ext_expr\n\n | spec_object_define_own_prop : object_loc -> prop_name -> descriptor -> bool -> ext_expr\n | spec_object_define_own_prop_1 : builtin_define_own_prop -> object_loc -> prop_name -> descriptor -> bool -> ext_expr\n | spec_object_define_own_prop_2 : object_loc -> prop_name -> descriptor -> bool -> (specret full_descriptor) -> ext_expr\n | spec_object_define_own_prop_3 : object_loc -> prop_name -> descriptor -> bool -> full_descriptor -> bool -> ext_expr\n | spec_object_define_own_prop_4 : object_loc -> prop_name -> attributes -> descriptor -> bool -> ext_expr\n | spec_object_define_own_prop_5 : object_loc -> prop_name -> attributes -> descriptor -> bool -> ext_expr\n | spec_object_define_own_prop_6a : object_loc -> prop_name -> attributes -> descriptor -> bool -> ext_expr\n | spec_object_define_own_prop_6b : object_loc -> prop_name -> attributes -> descriptor -> bool -> ext_expr\n | spec_object_define_own_prop_6c : object_loc -> prop_name -> attributes -> descriptor -> bool -> ext_expr\n | spec_object_define_own_prop_reject : bool -> ext_expr\n | spec_object_define_own_prop_write : object_loc -> prop_name -> attributes -> descriptor -> bool -> ext_expr\n\n | spec_prim_value_get : value -> prop_name -> ext_expr\n | spec_prim_value_get_1 : value -> prop_name -> out -> ext_expr\n | spec_prim_value_put : value -> prop_name -> value -> bool -> ext_expr\n | spec_prim_value_put_1 : prim -> prop_name -> value -> bool -> out -> ext_expr\n\n (* ARRAYS *)\n | spec_object_define_own_prop_array_2 : object_loc -> prop_name -> descriptor -> bool -> (specret full_descriptor) -> ext_expr\n | spec_object_define_own_prop_array_2_1 : object_loc -> prop_name -> descriptor -> bool -> descriptor -> value -> ext_expr\n | spec_object_define_own_prop_array_branch_3_4 : object_loc -> prop_name -> descriptor -> bool -> descriptor -> (specret int) -> ext_expr\n | spec_object_define_own_prop_array_branch_4_5 : object_loc -> prop_name -> descriptor -> bool -> descriptor -> int -> ext_expr\n | spec_object_define_own_prop_array_branch_4_5_a : object_loc -> prop_name -> (specret int) -> descriptor -> bool -> descriptor -> int -> ext_expr\n | spec_object_define_own_prop_array_branch_4_5_b : object_loc -> prop_name -> int -> out -> descriptor -> bool -> descriptor -> int -> ext_expr \n | spec_object_define_own_prop_array_4a : object_loc -> prop_name -> descriptor -> bool -> descriptor -> int -> ext_expr\n | spec_object_define_own_prop_array_4b : object_loc -> prop_name -> (specret int) -> descriptor -> bool -> descriptor -> int -> ext_expr\n | spec_object_define_own_prop_array_4c : object_loc -> int -> descriptor -> bool -> int -> descriptor -> out -> ext_expr\n | spec_object_define_own_prop_array_5 : object_loc -> prop_name -> descriptor -> bool -> ext_expr\n | spec_object_define_own_prop_array_3 : object_loc -> descriptor -> bool -> descriptor -> int -> ext_expr\n | spec_object_define_own_prop_array_3c : object_loc -> value -> (specret int) -> descriptor -> bool -> descriptor -> int -> ext_expr\n | spec_object_define_own_prop_array_3d_e : object_loc -> out -> int -> descriptor -> bool -> descriptor -> int -> ext_expr\n | spec_object_define_own_prop_array_3f_g : object_loc -> int -> int -> descriptor -> bool -> descriptor -> ext_expr\n | spec_object_define_own_prop_array_3h_i : object_loc -> int -> int -> descriptor -> bool -> descriptor -> ext_expr\n | spec_object_define_own_prop_array_3j : object_loc -> int -> int -> descriptor -> bool -> bool -> descriptor -> ext_expr\n | spec_object_define_own_prop_array_3k_l : object_loc -> out -> int -> int -> descriptor -> bool -> bool -> descriptor -> ext_expr\n | spec_object_define_own_prop_array_3l : object_loc -> int -> int -> descriptor -> bool -> bool -> ext_expr\n | spec_object_define_own_prop_array_3l_ii : object_loc -> int -> int -> descriptor -> bool -> bool -> ext_expr\n | spec_object_define_own_prop_array_3l_ii_1 : object_loc -> int -> int -> descriptor -> bool -> bool -> out -> ext_expr\n | spec_object_define_own_prop_array_3l_ii_2 : object_loc -> int -> int -> descriptor -> bool -> bool -> out -> ext_expr\n | spec_object_define_own_prop_array_3l_iii_1 : object_loc -> int -> descriptor -> bool -> bool -> ext_expr\n | spec_object_define_own_prop_array_3l_iii_2 : object_loc -> descriptor -> bool -> bool -> ext_expr\n | spec_object_define_own_prop_array_3l_iii_3 : object_loc -> descriptor -> bool -> ext_expr\n | spec_object_define_own_prop_array_3l_iii_4 : object_loc -> bool -> out -> ext_expr\n | spec_object_define_own_prop_array_3m_n : object_loc -> bool -> ext_expr\n\n (** Extended expressions for operations on references *)\n | spec_put_value : resvalue -> value -> ext_expr\n\n (** Extended expressions for operations on environment records *)\n\n | spec_env_record_has_binding : env_loc -> prop_name -> ext_expr\n | spec_env_record_has_binding_1 : env_loc -> prop_name -> env_record -> ext_expr\n | spec_env_record_get_binding_value : env_loc -> prop_name -> bool -> ext_expr\n | spec_env_record_get_binding_value_1 : env_loc -> prop_name -> bool -> env_record -> ext_expr\n | spec_env_record_get_binding_value_2 : prop_name -> bool -> object_loc -> out -> ext_expr\n\n | spec_env_record_create_immutable_binding : env_loc -> prop_name -> ext_expr\n | spec_env_record_initialize_immutable_binding : env_loc -> prop_name -> value -> ext_expr\n | spec_env_record_create_mutable_binding : env_loc -> prop_name -> option bool -> ext_expr\n | spec_env_record_create_mutable_binding_1 : env_loc -> prop_name -> bool -> env_record -> ext_expr\n | spec_env_record_create_mutable_binding_2 : env_loc -> prop_name -> bool -> object_loc -> out -> ext_expr\n | spec_env_record_create_mutable_binding_3 : out -> ext_expr\n | spec_env_record_set_mutable_binding : env_loc -> prop_name -> value -> bool -> ext_expr\n | spec_env_record_set_mutable_binding_1 : env_loc -> prop_name -> value -> bool -> env_record -> ext_expr\n | spec_env_record_delete_binding : env_loc -> prop_name -> ext_expr\n | spec_env_record_delete_binding_1 : env_loc -> prop_name -> env_record -> ext_expr\n\n | spec_env_record_create_set_mutable_binding : env_loc -> prop_name -> option bool -> value -> bool -> ext_expr\n | spec_env_record_create_set_mutable_binding_1 : out -> env_loc -> prop_name -> value -> bool -> ext_expr\n\n | spec_env_record_implicit_this_value : env_loc -> ext_expr\n | spec_env_record_implicit_this_value_1 : env_loc -> env_record -> ext_expr\n\n\n (** Extended expressions for operations on property descriptors (8.10) *)\n\n | spec_from_descriptor : (specret full_descriptor) -> ext_expr\n | spec_from_descriptor_1 : attributes -> out -> ext_expr\n | spec_from_descriptor_2 : object_loc -> attributes_data -> out -> ext_expr\n | spec_from_descriptor_3 : object_loc -> attributes_accessor -> out -> ext_expr\n | spec_from_descriptor_4 : object_loc -> attributes -> out -> ext_expr\n | spec_from_descriptor_5 : object_loc -> attributes -> out -> ext_expr\n | spec_from_descriptor_6 : object_loc -> out -> ext_expr\n\n \n \n (** Extented expressions for eval *)\n\n | spec_entering_eval_code : bool -> funcbody -> ext_expr -> ext_expr\n | spec_entering_eval_code_1 : funcbody -> ext_expr -> bool -> ext_expr\n | spec_entering_eval_code_2 : out -> ext_expr -> ext_expr\n\n | spec_call_global_eval : bool -> list value -> ext_expr\n | spec_call_global_eval_1 : bool -> value -> ext_expr\n | spec_call_global_eval_2 : prog -> ext_expr\n | spec_call_global_eval_3 : out -> ext_expr\n\n (** Extended expressions for function calls *)\n\n | spec_entering_func_code : object_loc -> value -> list value -> ext_expr -> ext_expr\n | spec_entering_func_code_1 : object_loc -> list value -> funcbody -> value -> strictness_flag -> ext_expr -> ext_expr\n | spec_entering_func_code_2 : object_loc -> list value -> funcbody -> out -> ext_expr -> ext_expr\n | spec_entering_func_code_3 : object_loc -> list value -> strictness_flag -> funcbody -> value -> ext_expr -> ext_expr\n | spec_entering_func_code_4 : out -> ext_expr -> ext_expr\n\n | spec_binding_inst_formal_params : list value -> env_loc -> list string -> strictness_flag -> ext_expr\n | spec_binding_inst_formal_params_1 : list value -> env_loc -> string -> list string -> strictness_flag -> value -> out -> ext_expr\n | spec_binding_inst_formal_params_2 : list value -> env_loc -> string -> list string -> strictness_flag -> value -> out -> ext_expr\n | spec_binding_inst_formal_params_3 : list value -> env_loc -> string -> list string -> strictness_flag -> value -> ext_expr\n | spec_binding_inst_formal_params_4 : list value -> env_loc -> list string -> strictness_flag -> out -> ext_expr\n | spec_binding_inst_function_decls : list value -> env_loc -> list funcdecl -> strictness_flag -> bool -> ext_expr\n | spec_binding_inst_function_decls_1 : list value -> env_loc -> funcdecl -> list funcdecl -> strictness_flag -> bool -> out -> ext_expr\n | spec_binding_inst_function_decls_2 : list value -> env_loc -> funcdecl -> list funcdecl -> strictness_flag -> object_loc -> bool -> out -> ext_expr\n | spec_binding_inst_function_decls_3 : list value -> funcdecl -> list funcdecl -> strictness_flag -> object_loc -> bool -> specret full_descriptor -> ext_expr\n | spec_binding_inst_function_decls_3a : list value -> funcdecl -> list funcdecl -> strictness_flag -> object_loc -> bool -> full_descriptor -> ext_expr\n | spec_binding_inst_function_decls_4 : list value -> env_loc -> funcdecl -> list funcdecl -> strictness_flag -> object_loc -> bool -> out -> ext_expr\n | spec_binding_inst_function_decls_5 : list value -> env_loc -> funcdecl -> list funcdecl -> strictness_flag -> object_loc -> bool -> ext_expr\n | spec_binding_inst_function_decls_6 : list value -> env_loc -> list funcdecl -> strictness_flag -> bool -> out -> ext_expr\n | spec_binding_inst_arg_obj : object_loc -> prog -> list string -> list value -> env_loc -> ext_expr\n | spec_binding_inst_arg_obj_1 : prog -> env_loc -> strictness_flag -> out -> ext_expr\n | spec_binding_inst_arg_obj_2 : prog -> env_loc -> object_loc -> out -> ext_expr\n | spec_binding_inst_var_decls : env_loc -> list string -> bool -> strictness_flag -> ext_expr\n | spec_binding_inst_var_decls_1 : env_loc -> string -> list string -> bool -> strictness_flag -> out -> ext_expr\n | spec_binding_inst_var_decls_2 : env_loc -> list string -> bool -> strictness_flag -> out -> ext_expr\n | spec_binding_inst : codetype -> option object_loc -> prog -> list value -> ext_expr\n | spec_binding_inst_1 : codetype -> option object_loc -> prog -> list value -> env_loc -> ext_expr\n | spec_binding_inst_2 : codetype -> object_loc -> prog -> list string -> list value -> env_loc -> out -> ext_expr\n | spec_binding_inst_3 : codetype -> option object_loc -> prog -> list string -> list value -> env_loc -> ext_expr\n | spec_binding_inst_4 : codetype -> option object_loc -> prog -> list string -> list value -> bool -> env_loc -> out -> ext_expr\n | spec_binding_inst_5 : codetype -> option object_loc -> prog -> list string -> list value -> bool -> env_loc -> ext_expr\n | spec_binding_inst_6 : codetype -> option object_loc -> prog -> list string -> list value -> bool -> env_loc -> out -> ext_expr\n | spec_binding_inst_7 : prog -> bool -> env_loc -> out -> ext_expr\n | spec_binding_inst_8 : prog -> bool -> env_loc -> ext_expr\n \n | spec_make_arg_getter : string -> lexical_env -> ext_expr\n | spec_make_arg_setter : string -> lexical_env -> ext_expr\n \n | spec_args_obj_get_1 : value -> object_loc -> prop_name -> object_loc -> (specret full_descriptor) -> ext_expr\n \n \n | spec_args_obj_define_own_prop_1 : object_loc -> prop_name -> descriptor -> bool -> object_loc -> specret full_descriptor -> ext_expr\n | spec_args_obj_define_own_prop_2 : object_loc -> prop_name -> descriptor -> bool -> object_loc -> full_descriptor -> out -> ext_expr\n | spec_args_obj_define_own_prop_3 : object_loc -> prop_name -> descriptor -> bool -> object_loc -> out -> ext_expr\n | spec_args_obj_define_own_prop_4 : object_loc -> prop_name -> descriptor -> bool -> object_loc -> ext_expr\n | spec_args_obj_define_own_prop_5 : out -> ext_expr\n | spec_args_obj_define_own_prop_6 : ext_expr\n \n | spec_args_obj_delete_1 : object_loc -> prop_name -> bool -> object_loc -> specret full_descriptor -> ext_expr\n | spec_args_obj_delete_2 : object_loc -> prop_name -> bool -> object_loc -> full_descriptor -> out -> ext_expr\n | spec_args_obj_delete_3 : out -> ext_expr\n | spec_args_obj_delete_4 : bool -> ext_expr\n \n | spec_arguments_object_map : object_loc -> list string -> list value -> lexical_env -> strictness_flag -> ext_expr\n | spec_arguments_object_map_1 : object_loc -> list string -> list value -> lexical_env -> strictness_flag -> out -> ext_expr\n | spec_arguments_object_map_2 : object_loc -> list string -> list value -> lexical_env -> strictness_flag -> object_loc -> list string -> int -> ext_expr\n | spec_arguments_object_map_3 : object_loc -> list string -> list value -> lexical_env -> strictness_flag -> object_loc -> list string -> int -> out -> ext_expr\n | spec_arguments_object_map_4 : object_loc -> list string -> list value -> lexical_env -> strictness_flag -> object_loc -> list string -> int -> string -> ext_expr\n | spec_arguments_object_map_5 : object_loc -> list string -> list value -> lexical_env -> strictness_flag -> object_loc -> list string -> int -> string -> out -> ext_expr\n | spec_arguments_object_map_6 : object_loc -> list string -> list value -> lexical_env -> strictness_flag -> object_loc -> list string -> int -> object_loc -> out -> ext_expr\n | spec_arguments_object_map_7 : object_loc -> list string -> list value -> lexical_env -> strictness_flag -> object_loc -> list string -> int -> out -> ext_expr\n | spec_arguments_object_map_8 : object_loc -> object_loc -> list string -> ext_expr\n\n | spec_create_arguments_object : object_loc -> list string -> list value -> lexical_env -> strictness_flag -> ext_expr\n | spec_create_arguments_object_1 : object_loc -> list string -> list value -> lexical_env -> strictness_flag -> object_loc -> out -> ext_expr\n | spec_create_arguments_object_2 : object_loc -> strictness_flag -> object_loc -> out -> ext_expr\n | spec_create_arguments_object_3 : object_loc -> value -> attributes -> out -> ext_expr\n | spec_create_arguments_object_4 : object_loc -> out -> ext_expr\n\n (* Functions *)\n\n | spec_object_has_instance : object_loc -> value -> ext_expr\n | spec_object_has_instance_1 : builtin_has_instance -> object_loc -> value -> ext_expr\n | spec_function_has_instance_1 : object_loc -> out -> ext_expr\n | spec_function_has_instance_2 : object_loc -> object_loc -> ext_expr\n | spec_function_has_instance_3 : object_loc -> value -> ext_expr\n\n | spec_function_has_instance_after_bind_1 : object_loc -> value -> ext_expr\n | spec_function_has_instance_after_bind_2 : object_loc -> value -> ext_expr\n\n | spec_function_get_1 : object_loc -> prop_name -> out -> ext_expr\n\n (* Function.prototype.apply *)\n\n | spec_function_proto_apply : object_loc -> value -> value -> ext_expr\n | spec_function_proto_apply_1 : object_loc -> value -> object_loc -> out -> ext_expr \n | spec_function_proto_apply_2 : object_loc -> value -> object_loc -> specret int -> ext_expr\n | spec_function_proto_apply_3 : object_loc -> value -> specret (list value) -> ext_expr \n\n (* Function.prototype.bind *)\n\n | spec_function_proto_bind_1 : object_loc -> value -> list value -> ext_expr\n | spec_function_proto_bind_2 : object_loc -> value -> list value -> ext_expr\n | spec_function_proto_bind_3 : object_loc -> specret int -> ext_expr\n | spec_function_proto_bind_4 : object_loc -> int -> ext_expr\n | spec_function_proto_bind_5 : object_loc -> ext_expr\n | spec_function_proto_bind_6 : object_loc -> out -> ext_expr\n | spec_function_proto_bind_7 : object_loc -> out -> ext_expr\n\n (* Throwing of errors *)\n\n | spec_error : native_error -> ext_expr \n | spec_error_1 : out -> ext_expr\n | spec_error_or_cst : bool -> native_error -> value -> ext_expr\n | spec_error_or_void : bool -> native_error -> ext_expr\n\n (* LATER: these are currently unused *)\n | spec_init_throw_type_error : ext_expr\n | spec_init_throw_type_error_1 : out -> ext_expr\n\n | spec_build_error : value -> value -> ext_expr\n | spec_build_error_1 : object_loc -> value -> ext_expr\n | spec_build_error_2 : object_loc -> out -> ext_expr\n\n (* Object creation and calling continuation with object address *)\n\n | spec_new_object : (object_loc -> ext_expr) -> ext_expr\n | spec_new_object_1 : out -> (object_loc -> ext_expr) -> ext_expr\n\n | spec_prim_new_object : prim -> ext_expr\n\n (* Auxiliary reduction for creating function object steps 16 - 18 *)\n | spec_creating_function_object_proto : object_loc -> ext_expr\n | spec_creating_function_object_proto_1 : object_loc -> out -> ext_expr\n | spec_creating_function_object_proto_2 : object_loc -> object_loc -> out -> ext_expr\n\n | spec_creating_function_object : list string -> funcbody -> lexical_env -> strictness_flag -> ext_expr\n | spec_creating_function_object_1 : strictness_flag -> object_loc -> out -> ext_expr\n | spec_creating_function_object_2 : strictness_flag -> object_loc -> out -> ext_expr\n | spec_creating_function_object_3 : object_loc -> out -> ext_expr\n | spec_creating_function_object_4 : object_loc -> out -> ext_expr\n\n (* Function creation in give execution context*)\n | spec_create_new_function_in : execution_ctx -> list string -> funcbody -> ext_expr\n\n (* TODO: Check if object_loc or value could be None *)\n (* TODO: get rid of this: | spec_call : builtin -> option object_loc -> option value -> list value -> ext_expr *)\n | spec_call : object_loc -> value -> list value -> ext_expr (* object with the call method, this value, arguments *)\n | spec_call_1 : call -> object_loc -> value -> list value -> ext_expr\n\n | spec_call_prealloc : prealloc -> value -> list value -> ext_expr\n\n | spec_call_default : object_loc -> value -> list value -> ext_expr\n | spec_call_default_1 : object_loc -> ext_expr\n | spec_call_default_2 : option funcbody -> ext_expr\n | spec_call_default_3 : out -> ext_expr\n \n | spec_construct : object_loc -> list value -> ext_expr\n | spec_construct_1 : construct -> object_loc -> list value -> ext_expr\n\n | spec_construct_prealloc : prealloc -> list value -> ext_expr\n\n | spec_construct_default : object_loc -> list value -> ext_expr\n | spec_construct_default_1 : object_loc -> list value -> out -> ext_expr\n | spec_construct_default_2 : object_loc -> out -> ext_expr\n\n | spec_construct_1_after_bind : object_loc -> list value -> object_loc -> ext_expr\n\n (** Extended expressions for calling global object builtin functions *)\n (* LATER: rename all the spec_call into spec_builtin *)\n\n | spec_call_global_is_nan_1 : out -> ext_expr\n | spec_call_global_is_finite_1 : out -> ext_expr\n\n | spec_call_object_call_1 : value -> list value -> ext_expr\n | spec_call_object_new_1 : value -> ext_expr\n | spec_call_object_get_proto_of_1 : value -> ext_expr\n | spec_call_object_is_extensible_1 : value -> ext_expr\n\n | spec_call_object_create_1 : value -> value -> ext_expr\n | spec_call_object_create_2 : out -> value -> value -> ext_expr\n | spec_call_object_create_3 : object_loc -> value -> ext_expr\n\n | spec_call_object_define_props_1 : value -> value -> ext_expr\n | spec_call_object_define_props_2 : out -> object_loc -> ext_expr\n | spec_call_object_define_props_3 : object_loc -> object_loc -> list prop_name -> list (prop_name * attributes) -> ext_expr\n | spec_call_object_define_props_4 : out -> object_loc -> object_loc -> prop_name -> list prop_name -> list (prop_name * attributes) -> ext_expr\n | spec_call_object_define_props_5 : object_loc -> object_loc -> prop_name -> list prop_name -> list (prop_name * attributes) -> specret attributes -> ext_expr\n | spec_call_object_define_props_6 : object_loc -> list (prop_name * attributes) -> ext_expr\n | spec_call_object_define_props_7 : out -> object_loc -> list (prop_name * attributes) -> ext_expr\n\n | spec_call_object_seal_1 : value -> ext_expr\n | spec_call_object_seal_2 : object_loc -> list prop_name -> ext_expr\n | spec_call_object_seal_3 : object_loc -> prop_name -> list prop_name -> specret full_descriptor -> ext_expr\n | spec_call_object_seal_4 : object_loc -> list prop_name -> out -> ext_expr\n\n | spec_call_object_is_sealed_1 : value -> ext_expr\n | spec_call_object_is_sealed_2 : object_loc -> list prop_name -> ext_expr\n | spec_call_object_is_sealed_3 : object_loc -> list prop_name -> specret full_descriptor -> ext_expr\n\n | spec_call_object_freeze_1 : value -> ext_expr\n | spec_call_object_freeze_2 : object_loc -> list prop_name -> ext_expr\n | spec_call_object_freeze_3 : object_loc -> prop_name -> list prop_name -> specret full_descriptor -> ext_expr\n | spec_call_object_freeze_4 : object_loc -> prop_name -> list prop_name -> full_descriptor -> ext_expr\n | spec_call_object_freeze_5 : object_loc -> list prop_name -> out -> ext_expr\n\n | spec_call_object_is_frozen_1 : value -> ext_expr\n | spec_call_object_is_frozen_2 : object_loc -> list prop_name -> ext_expr\n | spec_call_object_is_frozen_3 : object_loc -> list prop_name -> specret full_descriptor -> ext_expr\n | spec_call_object_is_frozen_4 : object_loc -> list prop_name -> full_descriptor -> ext_expr\n | spec_call_object_is_frozen_5 : object_loc -> list prop_name -> full_descriptor -> ext_expr\n\n\n | spec_call_object_prevent_extensions_1 : value -> ext_expr\n\n | spec_call_object_define_prop_1 : value -> value -> value -> ext_expr\n | spec_call_object_define_prop_2 : object_loc -> out -> value -> ext_expr\n | spec_call_object_define_prop_3 : object_loc -> string -> specret descriptor -> ext_expr\n | spec_call_object_define_prop_4 : object_loc -> out -> ext_expr\n\n | spec_call_object_get_own_prop_descriptor_1: value -> value -> ext_expr\n | spec_call_object_get_own_prop_descriptor_2: object_loc -> out -> ext_expr\n\n\n | spec_call_object_proto_to_string_1 : value -> ext_expr\n | spec_call_object_proto_to_string_2 : out -> ext_expr\n\n | spec_call_object_proto_has_own_prop_1 : out -> value -> ext_expr\n | spec_call_object_proto_has_own_prop_2 : out -> prop_name -> ext_expr\n | spec_call_object_proto_has_own_prop_3 : specret full_descriptor -> ext_expr\n\n | spec_call_object_proto_is_prototype_of_2_1 : value -> value -> ext_expr\n | spec_call_object_proto_is_prototype_of_2_2 : out -> object_loc -> ext_expr\n | spec_call_object_proto_is_prototype_of_2_3 : object_loc -> object_loc -> ext_expr\n | spec_call_object_proto_is_prototype_of_2_4 : object_loc -> value -> ext_expr\n\n | spec_call_object_proto_prop_is_enumerable_1 : value -> value -> ext_expr\n | spec_call_object_proto_prop_is_enumerable_2 : value -> out -> ext_expr\n | spec_call_object_proto_prop_is_enumerable_3 : out -> string -> ext_expr\n | spec_call_object_proto_prop_is_enumerable_4 : specret full_descriptor -> ext_expr\n\n | spec_call_array_new_1 : list value -> ext_expr\n | spec_call_array_new_2 : object_loc -> list value -> ext_expr\n | spec_call_array_new_3 : object_loc -> list value -> int -> ext_expr\n\n | spec_call_array_new_single_1 : value -> ext_expr\n | spec_call_array_new_single_2 : object_loc -> value -> ext_expr\n | spec_call_array_new_single_3 : object_loc -> number -> specret int -> ext_expr\n | spec_call_array_new_single_4 : object_loc -> int -> ext_expr\n\n | spec_call_array_is_array_1 : value -> ext_expr\n | spec_call_array_is_array_2_3 : class_name -> ext_expr\n\n | spec_call_array_proto_to_string : out -> ext_expr\n | spec_call_array_proto_to_string_1 : object_loc -> out -> ext_expr\n\n | spec_call_array_proto_join : out -> list value -> ext_expr \n | spec_call_array_proto_join_1 : object_loc -> out -> list value -> ext_expr \n | spec_call_array_proto_join_2 : object_loc -> specret int -> list value -> ext_expr\n | spec_call_array_proto_join_3 : object_loc -> int -> value -> ext_expr\n | spec_call_array_proto_join_4 : object_loc -> int -> out -> ext_expr\n | spec_call_array_proto_join_5 : object_loc -> int -> string -> specret string -> ext_expr\n\n | spec_call_array_proto_join_elements : object_loc -> int -> int -> string -> string -> ext_expr\n | spec_call_array_proto_join_elements_1 : object_loc -> int -> int -> string -> string -> ext_expr\n | spec_call_array_proto_join_elements_2 : object_loc -> int -> int -> string -> string -> specret string -> ext_expr\n\n | spec_call_array_proto_pop_1 : out -> ext_expr\n | spec_call_array_proto_pop_2 : object_loc -> out -> ext_expr\n | spec_call_array_proto_pop_3 : object_loc -> specret int -> ext_expr\n | spec_call_array_proto_pop_3_empty_1 : object_loc -> ext_expr\n | spec_call_array_proto_pop_3_empty_2 : out -> ext_expr\n | spec_call_array_proto_pop_3_nonempty_1 : object_loc -> int -> ext_expr\n | spec_call_array_proto_pop_3_nonempty_2 : object_loc -> out -> ext_expr\n | spec_call_array_proto_pop_3_nonempty_3 : object_loc -> value -> out -> ext_expr\n | spec_call_array_proto_pop_3_nonempty_4 : object_loc -> value -> value -> out -> ext_expr\n | spec_call_array_proto_pop_3_nonempty_5 : value -> out -> ext_expr\n\n | spec_call_array_proto_push_1 : out -> list value -> ext_expr\n | spec_call_array_proto_push_2 : object_loc -> list value -> out -> ext_expr\n | spec_call_array_proto_push_3 : object_loc -> list value -> specret int -> ext_expr\n | spec_call_array_proto_push_4 : object_loc -> list value -> int -> ext_expr\n | spec_call_array_proto_push_4_nonempty_1 : object_loc -> list value -> int -> value -> ext_expr\n | spec_call_array_proto_push_4_nonempty_2 : object_loc -> list value -> int -> value -> out -> ext_expr\n | spec_call_array_proto_push_4_nonempty_3 : object_loc -> list value -> int -> value -> out -> ext_expr\n | spec_call_array_proto_push_5 : object_loc -> value -> ext_expr\n | spec_call_array_proto_push_6 : value -> out -> ext_expr\n\n | spec_call_string_non_empty : out -> ext_expr \n\n | spec_construct_string_1 : value -> ext_expr\n | spec_construct_string_2 : out -> ext_expr\n\n | spec_construct_bool_1 : out -> ext_expr\n | spec_call_bool_proto_to_string_1 : out -> ext_expr\n | spec_call_bool_proto_value_of_1 : value -> ext_expr\n | spec_call_bool_proto_value_of_2 : value -> ext_expr\n\n | spec_call_number_proto_to_string_1 : value -> list value -> ext_expr\n | spec_call_number_proto_to_string_2 : value -> out -> ext_expr\n | spec_construct_number_1 : out -> ext_expr\n | spec_call_number_proto_value_of_1 : value -> ext_expr\n\n | spec_call_error_proto_to_string_1 : value -> ext_expr\n | spec_call_error_proto_to_string_2 : object_loc -> out -> ext_expr\n | spec_call_error_proto_to_string_3 : object_loc -> out -> ext_expr\n | spec_call_error_proto_to_string_4 : object_loc -> string -> out -> ext_expr\n | spec_call_error_proto_to_string_5 : object_loc -> string -> out -> ext_expr\n | spec_call_error_proto_to_string_6 : object_loc -> string -> out -> ext_expr\n\n\n (** Special state for returning an outcome *)\n\n | spec_returns : out -> ext_expr\n\n(** Grammar of extended statements *)\n\nwith ext_stat :=\n\n (** Extended expressions include statements *)\n\n | stat_basic : stat -> ext_stat\n\n (** Extended statements associated with primitive statements *)\n | stat_expr_1: (specret value) -> ext_stat\n\n | stat_block_1 : out -> stat -> ext_stat\n | stat_block_2 : resvalue -> out -> ext_stat\n\n | stat_label_1 : label -> out -> ext_stat\n\n | stat_var_decl_1 : out -> list (string * option expr) -> ext_stat\n | stat_var_decl_item : (string * option expr) -> ext_stat\n | stat_var_decl_item_1 : string -> specret ref -> expr -> ext_stat\n | stat_var_decl_item_2 : string -> ref -> (specret value) -> ext_stat\n | stat_var_decl_item_3 : string -> out -> ext_stat\n\n | stat_if_1 : specret value -> stat -> option stat -> ext_stat\n\n | stat_while_1 : label_set -> expr -> stat -> resvalue -> ext_stat\n | stat_while_2 : label_set -> expr -> stat -> resvalue -> specret value -> ext_stat\n | stat_while_3 : label_set -> expr -> stat -> resvalue -> out -> ext_stat\n | stat_while_4 : label_set -> expr -> stat -> resvalue -> res -> ext_stat\n | stat_while_5 : label_set -> expr -> stat -> resvalue -> res -> ext_stat\n | stat_while_6 : label_set -> expr -> stat -> resvalue -> res -> ext_stat\n\n\n | stat_do_while_1 : label_set -> stat -> expr -> resvalue -> ext_stat\n | stat_do_while_2 : label_set -> stat -> expr -> resvalue -> out -> ext_stat\n | stat_do_while_3 : label_set -> stat -> expr -> resvalue -> res -> ext_stat\n | stat_do_while_4 : label_set -> stat -> expr -> resvalue -> res -> ext_stat\n | stat_do_while_5 : label_set -> stat -> expr -> resvalue -> res -> ext_stat\n | stat_do_while_6 : label_set -> stat -> expr -> resvalue -> ext_stat\n | stat_do_while_7 : label_set -> stat -> expr -> resvalue -> specret value -> ext_stat\n\n | stat_for_1 : label_set -> specret value -> option expr -> option expr -> stat -> ext_stat\n | stat_for_2 : label_set -> resvalue -> option expr -> option expr -> stat -> ext_stat\n | stat_for_3 : label_set -> resvalue -> expr -> specret value -> option expr -> stat -> ext_stat\n | stat_for_4 : label_set -> resvalue -> option expr -> option expr -> stat -> ext_stat\n | stat_for_5 : label_set -> resvalue -> option expr -> out -> option expr -> stat -> ext_stat\n | stat_for_6 : label_set -> resvalue -> option expr -> option expr -> stat -> res -> ext_stat\n | stat_for_7 : label_set -> resvalue -> option expr -> option expr -> stat -> res -> ext_stat\n | stat_for_8 : label_set -> resvalue -> option expr -> option expr -> stat -> ext_stat\n | stat_for_9 : label_set -> resvalue -> option expr -> expr -> specret value -> stat -> ext_stat\n\n | stat_for_var_1 : out -> label_set -> option expr -> option expr -> stat -> ext_stat\n\n\n(* LATER: define prop_names for [set prop_name] *)\n(* LATER\n | stat_for_in_1 : expr -> stat -> out -> ext_stat\n | stat_for_in_2 : expr -> stat -> out -> ext_stat\n | stat_for_in_3 : expr -> stat -> out -> ext_stat\n | stat_for_in_4 : expr -> stat -> object_loc -> option res -> option out -> set prop_name -> set prop_name -> ext_stat \n | stat_for_in_5 : expr -> stat -> object_loc -> option res -> option out -> set prop_name -> set prop_name -> prop_name -> ext_stat\n | stat_for_in_6 : expr -> stat -> object_loc -> option res -> option out -> set prop_name -> set prop_name -> prop_name -> ext_stat\n | stat_for_in_7 : expr -> stat -> object_loc -> option res -> option out -> set prop_name -> set prop_name -> out -> ext_stat\n | stat_for_in_8 : expr -> stat -> object_loc -> option res -> option out -> set prop_name -> set prop_name -> out -> ext_stat\n | stat_for_in_9 : expr -> stat -> object_loc -> option res -> option out -> set prop_name -> set prop_name -> res -> ext_stat\n*)\n\n (* Extended statements for 'switch' *)\n \n | stat_switch_1: (specret value) -> label_set -> switchbody -> ext_stat\n | stat_switch_2: out -> label_set -> ext_stat\n | stat_switch_nodefault_1: value -> resvalue -> list switchclause -> ext_stat\n | stat_switch_nodefault_2: (specret value) -> value -> resvalue -> list stat -> list switchclause -> ext_stat\n | stat_switch_nodefault_3: bool -> value -> resvalue -> list stat -> list switchclause -> ext_stat\n | stat_switch_nodefault_4: out -> list switchclause -> ext_stat\n | stat_switch_nodefault_5: resvalue -> list switchclause -> ext_stat\n | stat_switch_nodefault_6: resvalue -> out -> list switchclause -> ext_stat\n\n | stat_switch_default_1: value -> resvalue -> list switchclause -> list stat -> list switchclause -> ext_stat\n | stat_switch_default_A_1: bool -> value -> resvalue -> list switchclause -> list stat -> list switchclause -> ext_stat\n | stat_switch_default_A_2: (specret value) -> value -> resvalue -> list stat -> list switchclause -> list stat -> list switchclause -> ext_stat\n | stat_switch_default_A_3: bool -> value -> resvalue -> list stat -> list switchclause -> list stat -> list switchclause -> ext_stat\n | stat_switch_default_A_4: resvalue -> value -> list stat -> list switchclause -> list stat -> list switchclause -> ext_stat\n | stat_switch_default_A_5: resvalue -> out -> value -> list switchclause -> list stat -> list switchclause -> ext_stat\n\n | stat_switch_default_B_1: value -> resvalue -> list stat -> list switchclause -> ext_stat\n | stat_switch_default_B_2: (specret value) -> value -> resvalue -> list stat -> list stat -> list switchclause -> ext_stat\n | stat_switch_default_B_3: bool -> value -> resvalue -> list stat -> list stat -> list switchclause -> ext_stat\n | stat_switch_default_B_4: out -> list stat -> list switchclause -> ext_stat\n\n | stat_switch_default_5: value -> resvalue -> list stat -> list switchclause -> ext_stat\n | stat_switch_default_6: out -> list switchclause -> ext_stat\n | stat_switch_default_7: resvalue -> list switchclause -> ext_stat\n | stat_switch_default_8: resvalue -> out -> list switchclause -> ext_stat\n\n | stat_with_1 : stat -> specret value -> ext_stat (* The expression have been executed. *)\n\n | stat_throw_1 : (specret value) -> ext_stat (* The expression have been executed. *)\n\n | stat_return_1 : (specret value) -> ext_stat (* The expression have been executed. *)\n\n | stat_try_1 : out -> option (string*stat) -> option stat -> ext_stat (* The try block has been executed. *)\n | stat_try_2 : out -> lexical_env -> stat -> option stat -> ext_stat (* The catch block is actived and will be executed. *)\n | stat_try_3 : out -> option stat -> ext_stat (* The try catch block has been executed: there only stay an optional finally. *)\n | stat_try_4 : res -> option stat -> ext_stat (* The try catch block has been executed: there only stay an optional finally. *)\n | stat_try_5 : res -> out -> ext_stat (* The finally has been executed. *)\n\n(** Grammar of extended programs *)\n\nwith ext_prog :=\n\n | prog_basic : prog -> ext_prog\n | javascript_1 : out -> prog -> ext_prog\n | prog_1 : out -> element -> ext_prog\n | prog_2 : resvalue -> out -> ext_prog\n\n\n(** Grammar of extended forms for specification functions *)\n\nwith ext_spec :=\n | spec_to_int32 : value -> ext_spec\n | spec_to_int32_1 : out -> ext_spec\n | spec_to_uint32 : value -> ext_spec\n | spec_to_uint32_1 : out -> ext_spec\n\n | spec_expr_get_value_conv : (value -> ext_expr) -> expr -> ext_spec\n | spec_expr_get_value_conv_1 : (value -> ext_expr) -> (specret value) -> ext_spec\n | spec_expr_get_value_conv_2 : out -> ext_spec\n\n | spec_convert_twice : ext_expr -> ext_expr -> ext_spec\n | spec_convert_twice_1 : out -> ext_expr -> ext_spec\n | spec_convert_twice_2 : value -> out -> ext_spec\n\n (** Extended expressions for lists of expressions *)\n | spec_list_expr : list expr -> ext_spec\n | spec_list_expr_1 : list value -> list expr -> ext_spec\n | spec_list_expr_2 : list value -> (specret value) -> list expr -> ext_spec \n\n | spec_to_descriptor : value -> ext_spec\n | spec_to_descriptor_1a : object_loc -> descriptor -> ext_spec\n | spec_to_descriptor_1b : out -> object_loc -> descriptor -> ext_spec\n | spec_to_descriptor_1c : out -> object_loc -> descriptor -> ext_spec\n | spec_to_descriptor_2a : object_loc -> descriptor -> ext_spec \n | spec_to_descriptor_2b : out -> object_loc -> descriptor -> ext_spec\n | spec_to_descriptor_2c : out -> object_loc -> descriptor -> ext_spec\n | spec_to_descriptor_3a : object_loc -> descriptor -> ext_spec \n | spec_to_descriptor_3b : out -> object_loc -> descriptor -> ext_spec\n | spec_to_descriptor_3c : out -> object_loc -> descriptor -> ext_spec\n | spec_to_descriptor_4a : object_loc -> descriptor -> ext_spec \n | spec_to_descriptor_4b : out -> object_loc -> descriptor -> ext_spec\n | spec_to_descriptor_4c : out -> object_loc -> descriptor -> ext_spec\n | spec_to_descriptor_5a : object_loc -> descriptor -> ext_spec \n | spec_to_descriptor_5b : out -> object_loc -> descriptor -> ext_spec\n | spec_to_descriptor_5c : out -> object_loc -> descriptor -> ext_spec\n | spec_to_descriptor_6a : object_loc -> descriptor -> ext_spec \n | spec_to_descriptor_6b : out -> object_loc -> descriptor -> ext_spec\n | spec_to_descriptor_6c : out -> object_loc -> descriptor -> ext_spec\n | spec_to_descriptor_7 : object_loc -> descriptor -> ext_spec \n\n | spec_object_get_own_prop : object_loc -> prop_name -> ext_spec\n | spec_object_get_own_prop_1 : builtin_get_own_prop -> object_loc -> prop_name -> ext_spec\n | spec_object_get_own_prop_2 : object_loc -> prop_name -> option attributes -> ext_spec\n\n | spec_object_get_prop : object_loc -> prop_name -> ext_spec\n | spec_object_get_prop_1 : builtin_get_prop -> object_loc -> prop_name -> ext_spec\n | spec_object_get_prop_2 : object_loc -> prop_name -> specret full_descriptor -> ext_spec\n | spec_object_get_prop_3 : object_loc -> prop_name -> value -> ext_spec\n\n | spec_get_value : resvalue -> ext_spec\n | spec_get_value_ref_b_1 : out -> ext_spec\n | spec_get_value_ref_c_1 : out -> ext_spec\n\n (** Shorthand for calling [red_expr] then [ref_get_value] *)\n\n | spec_expr_get_value : expr -> ext_spec\n | spec_expr_get_value_1 : out -> ext_spec\n\n (** Extended expressions for operations on lexical environments *)\n\n | spec_lexical_env_get_identifier_ref : lexical_env -> prop_name -> bool -> ext_spec\n | spec_lexical_env_get_identifier_ref_1 : env_loc -> lexical_env -> prop_name -> bool -> ext_spec\n | spec_lexical_env_get_identifier_ref_2 : env_loc -> lexical_env -> prop_name -> bool -> out -> ext_spec\n\n (** Errors in the grammar of spec *) (* LATER: merge *)\n | spec_error_spec : native_error -> ext_spec\n | spec_error_spec_1 : out -> ext_spec\n\n (* .. *)\n | spec_args_obj_get_own_prop_1 : object_loc -> prop_name -> (specret full_descriptor) -> ext_spec\n | spec_args_obj_get_own_prop_2 : object_loc -> prop_name -> object_loc -> full_descriptor -> (specret full_descriptor) -> ext_spec\n | spec_args_obj_get_own_prop_3 : full_descriptor -> out -> ext_spec\n | spec_args_obj_get_own_prop_4 : full_descriptor -> ext_spec\n\n | spec_string_get_own_prop_1 : object_loc -> prop_name -> (specret full_descriptor) -> ext_spec\n | spec_string_get_own_prop_2 : object_loc -> prop_name -> (specret int) -> ext_spec\n | spec_string_get_own_prop_3 : object_loc -> prop_name -> out -> ext_spec\n | spec_string_get_own_prop_4 : prop_name -> string -> ext_spec\n | spec_string_get_own_prop_5 : string -> (specret int) -> ext_spec\n | spec_string_get_own_prop_6 : string -> int -> int -> ext_spec\n\n (* Argumenst for Function.prototype.apply *)\n\n | spec_function_proto_apply_get_args : object_loc -> int -> int -> ext_spec\n | spec_function_proto_apply_get_args_1 : object_loc -> int -> int -> out -> ext_spec\n | spec_function_proto_apply_get_args_2 : object_loc -> int -> int -> out -> ext_spec\n | spec_function_proto_apply_get_args_3 : value -> specret (list value) -> ext_spec \n\n (* Length for Function.prototype.bind *)\n\n | spec_function_proto_bind_length : object_loc -> list value -> ext_spec\n | spec_function_proto_bind_length_1 : object_loc -> list value -> ext_spec\n | spec_function_proto_bind_length_2 : list value -> out -> ext_spec\n | spec_function_proto_bind_length_3 : specret int -> list value -> ext_spec\n\n (* Conversion for Array.prototype.join *)\n\n | spec_call_array_proto_join_vtsfj : object_loc -> int -> ext_spec\n | spec_call_array_proto_join_vtsfj_1 : object_loc -> out -> ext_spec\n | spec_call_array_proto_join_vtsfj_2 : object_loc -> out -> ext_spec\n | spec_call_array_proto_join_vtsfj_3 : out -> ext_spec\n.\n\n(** Coercions *)\n\nCoercion expr_basic : expr >-> ext_expr.\nCoercion stat_basic : stat >-> ext_stat.\nCoercion prog_basic : prog >-> ext_prog.\n\n\n(** Shorthand for calling toPrimitive without prefered type *)\n\nDefinition spec_to_primitive_auto v :=\n spec_to_primitive v None.\n\n\n(**************************************************************)\n(** ** Extracting outcome from an extended expression. *)\n\n(** Auxiliary definition for extracting [out] of [specret] *)\n\nDefinition out_of_specret T (y:specret T) :=\n match y with\n | specret_out o => Some o\n | specret_val _ _ => None\n end.\n\n(** The [out_of_ext_*] family of definitions is used by\n the generic abort rule, which propagates exceptions,\n and divergence, break and continues. *)\n\nDefinition out_of_ext_expr (e : ext_expr) : option out :=\n match e with\n | expr_basic _ => None\n\n | expr_identifier_1 y => out_of_specret y \n | expr_object_0 o _ => Some o\n | expr_object_1 _ _ => None\n | expr_object_2 _ _ _ _ => None\n | expr_object_3_val _ _ y _ => out_of_specret y\n | expr_object_3_get _ _ o _ => Some o\n | expr_object_3_set _ _ o _ => Some o\n | expr_object_4 _ _ _ _ => None\n | expr_object_5 _ _ o => Some o\n\n\n\n\n (* _ARRAYS_ : support for array intermediate forms - CHECK!*)\n | expr_array_0 o _ => Some o\n | expr_array_1 _ _ => None\n | expr_array_2 _ _ _ => None\n | expr_array_3 _ _ _ => None\n | expr_array_3_1 _ y _ _ => out_of_specret y\n | expr_array_3_2 _ _ o _ _ => Some o\n | expr_array_3_3 _ _ y _ _ => out_of_specret y\n | expr_array_3_4 _ _ o _ => Some o\n | expr_array_3_5 _ o _ => Some o\n \n\n | expr_array_add_length _ _ o => Some o\n | expr_array_add_length_0 _ _ => None\n | expr_array_add_length_1 _ _ o => Some o \n | expr_array_add_length_2 _ y _ => out_of_specret y\n | expr_array_add_length_3 _ y => out_of_specret y\n | expr_array_add_length_4 _ o => Some o\n\n\n\n\n\n | expr_function_1 _ _ _ _ _ o => Some o\n | expr_function_2 _ _ o => Some o\n | expr_function_3 _ o => Some o\n\n | expr_access_1 y _ => out_of_specret y\n | expr_access_2 _ y => out_of_specret y\n | expr_access_3 _ o _ => Some o\n | expr_access_4 _ o => Some o\n\n | expr_new_1 y _ => out_of_specret y\n | expr_new_2 _ y => out_of_specret y \n\n | expr_call_1 o _ _ => Some o\n | expr_call_2 _ _ _ y => out_of_specret y\n | expr_call_3 _ _ _ y => out_of_specret y \n | expr_call_4 _ _ _ _ => None\n | expr_call_5 _ _ _ o => Some o\n\n | spec_eval _ _ _ => None\n\n | expr_unary_op_1 _ y => out_of_specret y\n | expr_unary_op_2 _ _ => None\n | expr_delete_1 o => Some o\n | expr_delete_2 _ => None\n | expr_delete_3 _ o => Some o\n | expr_delete_4 _ _ => None\n | expr_typeof_1 o => Some o\n | expr_typeof_2 y => out_of_specret y\n | expr_prepost_1 _ o => Some o\n(* | expr_prepost_2 _ _ o => Some o *)\n\n | expr_prepost_2 _ _ y => out_of_specret y\n\n | expr_prepost_3 _ _ o => Some o\n | expr_prepost_4 _ o => Some o\n | expr_unary_op_neg_1 o => Some o\n | expr_unary_op_bitwise_not_1 y => out_of_specret y\n | expr_unary_op_not_1 o => Some o\n | expr_conditional_1 y _ _ => out_of_specret y\n | expr_conditional_1' o _ _ => None\n | expr_conditional_2 y => out_of_specret y\n\n | expr_binary_op_1 _ y _ => out_of_specret y\n | expr_binary_op_2 _ _ y => out_of_specret y\n | expr_binary_op_3 _ _ _ => None\n | expr_binary_op_add_1 y => out_of_specret y\n | expr_binary_op_add_string_1 y => out_of_specret y\n | expr_puremath_op_1 _ y => out_of_specret y\n | expr_shift_op_1 _ y _ => out_of_specret y\n | expr_shift_op_2 _ _ y => out_of_specret y\n | expr_inequality_op_1 _ _ _ _ => None\n | expr_inequality_op_2 _ _ y => out_of_specret y\n | expr_binary_op_in_1 _ o => Some o\n | expr_binary_op_disequal_1 o => Some o\n | spec_equal _ _ => None\n | spec_equal_1 _ _ _ _ => None\n | spec_equal_2 _ => None\n | spec_equal_3 _ _ _ => None\n | spec_equal_4 _ o => Some o\n | expr_bitwise_op_1 _ y _ => out_of_specret y\n | expr_bitwise_op_2 _ _ y => out_of_specret y\n | expr_lazy_op_1 _ y _ => out_of_specret y\n | expr_lazy_op_2 _ _ o _ => Some o\n | expr_lazy_op_2_1 y => out_of_specret y\n\n | expr_assign_1 o _ _ => Some o\n | expr_assign_2 _ y _ _ => out_of_specret y\n | expr_assign_3 _ _ _ y => out_of_specret y\n | expr_assign_3' _ o => Some o\n | expr_assign_4 _ y => out_of_specret y\n | expr_assign_5 _ o => Some o\n\n | spec_to_primitive _ _ => None\n | spec_to_boolean _ => None\n | spec_to_number _ => None\n | spec_to_number_1 o => Some o\n | spec_to_integer _ => None\n | spec_to_integer_1 o => Some o\n | spec_to_string _ => None\n | spec_to_string_1 o => Some o\n | spec_to_object _ => None\n\n | spec_check_object_coercible _ => None\n\n | spec_eq _ _ => None\n | spec_eq0 _ _ => None\n | spec_eq1 _ _ => None\n | spec_eq2 _ _ _ => None\n\n | spec_object_get _ _ => None\n | spec_object_get_1 _ _ _ _ => None\n | spec_object_get_2 _ y => out_of_specret y\n | spec_object_get_3 _ _ => None\n\n | spec_object_can_put _ _ => None\n | spec_object_can_put_1 _ _ _ => None\n | spec_object_can_put_2 _ _ y => out_of_specret y\n | spec_object_can_put_4 _ _ _ => None\n | spec_object_can_put_5 _ y => out_of_specret y\n | spec_object_can_put_6 _ _ => None\n\n | spec_object_put _ _ _ _ => None\n | spec_object_put_1 _ _ _ _ _ _ => None\n | spec_object_put_2 _ _ _ _ _ o => Some o\n | spec_object_put_3 _ _ _ _ _ y => out_of_specret y\n | spec_object_put_4 _ _ _ _ _ y => out_of_specret y\n | spec_object_put_5 o => Some o\n\n | spec_object_has_prop _ _ => None\n | spec_object_has_prop_1 _ _ _ => None\n | spec_object_has_prop_2 y => out_of_specret y\n\n | spec_object_delete _ _ _ => None\n | spec_object_delete_1 _ _ _ _ => None\n | spec_object_delete_2 _ _ _ y => out_of_specret y\n | spec_object_delete_3 _ _ _ _ => None\n\n | spec_object_default_value _ _ => None\n | spec_object_default_value_1 _ _ _ => None\n | spec_object_default_value_2 _ _ _ => None\n | spec_object_default_value_3 _ _ => None\n | spec_object_default_value_4 => None\n | spec_object_default_value_sub_1 _ _ _ => None\n | spec_object_default_value_sub_2 _ o _ => Some o\n | spec_object_default_value_sub_3 o _ => Some o\n\n | spec_object_define_own_prop _ _ _ _ => None\n | spec_object_define_own_prop_1 _ _ _ _ _ => None\n | spec_object_define_own_prop_2 _ _ _ _ y => out_of_specret y\n | spec_object_define_own_prop_3 _ _ _ _ _ _ => None\n | spec_object_define_own_prop_4 _ _ _ _ _ => None\n | spec_object_define_own_prop_5 _ _ _ _ _ => None\n | spec_object_define_own_prop_6a _ _ _ _ _ => None\n | spec_object_define_own_prop_6b _ _ _ _ _ => None\n | spec_object_define_own_prop_6c _ _ _ _ _ => None\n | spec_object_define_own_prop_reject _ => None\n | spec_object_define_own_prop_write _ _ _ _ _ => None\n\n\n\n (* ARRAYS *)\n | spec_object_define_own_prop_array_2 _ _ _ _ y => out_of_specret y\n | spec_object_define_own_prop_array_2_1 _ _ _ _ _ _ => None\n | spec_object_define_own_prop_array_branch_3_4 _ _ _ _ _ y => out_of_specret y\n | spec_object_define_own_prop_array_branch_4_5 _ _ _ _ _ _ => None\n | spec_object_define_own_prop_array_branch_4_5_a _ _ y _ _ _ _ => out_of_specret y\n | spec_object_define_own_prop_array_branch_4_5_b _ _ _ o _ _ _ _ => Some o\n | spec_object_define_own_prop_array_4a _ _ _ _ _ _ => None\n | spec_object_define_own_prop_array_4b _ _ y _ _ _ _ => out_of_specret y\n | spec_object_define_own_prop_array_4c _ _ _ _ _ _ o => Some o\n | spec_object_define_own_prop_array_5 _ _ _ _ => None\n | spec_object_define_own_prop_array_3 _ _ _ _ _ => None\n | spec_object_define_own_prop_array_3c _ _ y _ _ _ _ => out_of_specret y\n | spec_object_define_own_prop_array_3d_e _ o _ _ _ _ _ => Some o\n | spec_object_define_own_prop_array_3f_g _ _ _ _ _ _ => None\n | spec_object_define_own_prop_array_3h_i _ _ _ _ _ _ => None\n | spec_object_define_own_prop_array_3j _ _ _ _ _ _ _ => None\n | spec_object_define_own_prop_array_3k_l _ o _ _ _ _ _ _ => Some o\n | spec_object_define_own_prop_array_3l _ _ _ _ _ _ => None\n | spec_object_define_own_prop_array_3l_ii _ _ _ _ _ _ => None\n | spec_object_define_own_prop_array_3l_ii_1 _ _ _ _ _ _ o => Some o\n | spec_object_define_own_prop_array_3l_ii_2 _ _ _ _ _ _ o => Some o\n | spec_object_define_own_prop_array_3l_iii_1 _ _ _ _ _ => None\n | spec_object_define_own_prop_array_3l_iii_2 _ _ _ _ => None\n | spec_object_define_own_prop_array_3l_iii_3 _ _ _ => None\n | spec_object_define_own_prop_array_3l_iii_4 _ _ o => Some o\n | spec_object_define_own_prop_array_3m_n _ _ => None\n\n | spec_prim_value_get _ _ => None\n | spec_prim_value_get_1 _ _ o => Some o\n\n | spec_prim_value_put _ _ _ _ => None\n | spec_prim_value_put_1 _ _ _ _ o => Some o\n\n | spec_put_value _ _ => None\n\n\n | spec_env_record_has_binding _ _ => None\n | spec_env_record_has_binding_1 _ _ _ => None\n | spec_env_record_get_binding_value _ _ _ => None\n | spec_env_record_get_binding_value_1 _ _ _ _ => None\n | spec_env_record_get_binding_value_2 _ _ _ o => Some o\n\n | spec_env_record_create_immutable_binding _ _ => None\n | spec_env_record_initialize_immutable_binding _ _ _ => None\n | spec_env_record_create_mutable_binding _ _ _ => None\n | spec_env_record_create_mutable_binding_1 _ _ _ _ => None\n | spec_env_record_create_mutable_binding_2 _ _ _ _ o => Some o\n | spec_env_record_create_mutable_binding_3 o => Some o\n | spec_env_record_set_mutable_binding _ _ _ _ => None\n | spec_env_record_set_mutable_binding_1 _ _ _ _ _ => None\n | spec_env_record_delete_binding _ _ => None\n | spec_env_record_delete_binding_1 _ _ _ => None\n\n | spec_env_record_create_set_mutable_binding _ _ _ _ _ => None\n | spec_env_record_create_set_mutable_binding_1 o _ _ _ _ => Some o\n\n | spec_env_record_implicit_this_value _ => None\n | spec_env_record_implicit_this_value_1 _ _ => None\n\n | spec_from_descriptor y => out_of_specret y\n | spec_from_descriptor_1 _ o => Some o\n | spec_from_descriptor_2 _ _ o => Some o\n | spec_from_descriptor_3 _ _ o => Some o\n | spec_from_descriptor_4 _ _ o => Some o\n | spec_from_descriptor_5 _ _ o => Some o\n | spec_from_descriptor_6 _ o => Some o\n\n\n | spec_entering_eval_code _ _ _ => None\n | spec_entering_eval_code_1 _ _ _ => None\n | spec_entering_eval_code_2 o _ => Some o\n\n | spec_call_global_eval _ _ => None\n | spec_call_global_eval_1 _ _ => None\n | spec_call_global_eval_2 _ => None\n | spec_call_global_eval_3 o => Some o\n\n | spec_entering_func_code _ _ _ _ => None\n | spec_entering_func_code_1 _ _ _ _ _ _ => None\n | spec_entering_func_code_2 _ _ _ o _ => Some o\n | spec_entering_func_code_3 _ _ _ _ _ _ => None\n | spec_entering_func_code_4 o _ => Some o\n\n | spec_binding_inst_formal_params _ _ _ _ => None\n | spec_binding_inst_formal_params_1 _ _ _ _ _ _ o => Some o\n | spec_binding_inst_formal_params_2 _ _ _ _ _ _ o => Some o\n | spec_binding_inst_formal_params_3 _ _ _ _ _ _ => None\n | spec_binding_inst_formal_params_4 _ _ _ _ o => Some o\n | spec_binding_inst_function_decls _ _ _ _ _ => None\n | spec_binding_inst_function_decls_1 _ _ _ _ _ _ o => Some o\n | spec_binding_inst_function_decls_2 _ _ _ _ _ _ _ o => Some o\n | spec_binding_inst_function_decls_3 _ _ _ _ _ _ y => out_of_specret y\n | spec_binding_inst_function_decls_3a _ _ _ _ _ _ _ => None\n | spec_binding_inst_function_decls_4 _ _ _ _ _ _ _ o => Some o\n | spec_binding_inst_function_decls_5 _ _ _ _ _ _ _ => None\n | spec_binding_inst_function_decls_6 _ _ _ _ _ o => Some o\n | spec_binding_inst_arg_obj object_loc _ _ _ _ => None\n | spec_binding_inst_arg_obj_1 _ _ _ o => Some o\n | spec_binding_inst_arg_obj_2 _ _ _ o => Some o\n | spec_binding_inst_var_decls _ _ _ _ => None\n | spec_binding_inst_var_decls_1 _ _ _ _ _ o => Some o\n | spec_binding_inst_var_decls_2 _ _ _ _ o => Some o\n | spec_binding_inst _ _ _ _ => None\n | spec_binding_inst_1 _ _ _ _ _ => None\n | spec_binding_inst_2 _ _ _ _ _ _ o => Some o\n | spec_binding_inst_3 _ _ _ _ _ _ => None\n | spec_binding_inst_4 _ _ _ _ _ _ _ o => Some o\n | spec_binding_inst_5 _ _ _ _ _ _ _ => None\n | spec_binding_inst_6 _ _ _ _ _ _ _ o => Some o\n | spec_binding_inst_7 _ _ _ o => Some o\n | spec_binding_inst_8 _ _ _ => None\n \n | spec_make_arg_getter _ _ => None\n | spec_make_arg_setter _ _ => None\n \n | spec_args_obj_get_1 _ _ _ _ y => out_of_specret y\n \n \n | spec_args_obj_define_own_prop_1 _ _ _ _ _ y => out_of_specret y\n | spec_args_obj_define_own_prop_2 _ _ _ _ _ _ o => Some o\n | spec_args_obj_define_own_prop_3 _ _ _ _ _ o => Some o\n | spec_args_obj_define_own_prop_4 _ _ _ _ _ => None\n | spec_args_obj_define_own_prop_5 o => Some o\n | spec_args_obj_define_own_prop_6 => None\n \n | spec_args_obj_delete_1 _ _ _ _ y => out_of_specret y\n | spec_args_obj_delete_2 _ _ _ _ _ o => Some o\n | spec_args_obj_delete_3 o => Some o\n | spec_args_obj_delete_4 _ => None\n \n | spec_arguments_object_map _ _ _ _ _ => None\n | spec_arguments_object_map_1 _ _ _ _ _ o => Some o\n | spec_arguments_object_map_2 _ _ _ _ _ _ _ _ => None\n | spec_arguments_object_map_3 _ _ _ _ _ _ _ _ o => Some o\n | spec_arguments_object_map_4 _ _ _ _ _ _ _ _ _ => None\n | spec_arguments_object_map_5 _ _ _ _ _ _ _ _ _ o => Some o\n | spec_arguments_object_map_6 _ _ _ _ _ _ _ _ _ o => Some o\n | spec_arguments_object_map_7 _ _ _ _ _ _ _ _ o => Some o\n | spec_arguments_object_map_8 _ _ _ => None\n\n\n | spec_create_arguments_object _ _ _ _ _ => None\n | spec_create_arguments_object_1 _ _ _ _ _ _ o => Some o\n | spec_create_arguments_object_2 _ _ _ o => Some o\n | spec_create_arguments_object_3 _ _ _ o => Some o\n | spec_create_arguments_object_4 _ o => Some o\n\n | spec_object_has_instance _ _ => None\n | spec_object_has_instance_1 _ _ _ => None\n | spec_function_has_instance_1 _ o => Some o\n | spec_function_has_instance_2 _ _ => None\n | spec_function_has_instance_3 _ _ => None\n | spec_function_has_instance_after_bind_1 _ _ => None\n | spec_function_has_instance_after_bind_2 _ _ => None \n\n | spec_function_get_1 _ _ o => Some o\n\n | spec_error _ => None\n | spec_error_1 o => Some o \n | spec_error_or_cst _ _ _ => None\n | spec_error_or_void _ _ => None\n\n | spec_init_throw_type_error => None\n | spec_init_throw_type_error_1 o => Some o\n\n | spec_build_error _ _ => None\n | spec_build_error_1 _ _ => None\n | spec_build_error_2 _ o => Some o\n\n | spec_new_object _ => None\n | spec_new_object_1 o _ => Some o\n\n | spec_prim_new_object _ => None\n\n | spec_creating_function_object_proto _ => None\n | spec_creating_function_object_proto_1 _ o => Some o\n | spec_creating_function_object_proto_2 _ _ o => Some o\n\n | spec_creating_function_object _ _ _ _ => None\n | spec_creating_function_object_1 _ _ o => Some o\n | spec_creating_function_object_2 _ _ o => Some o\n | spec_creating_function_object_3 _ o => Some o\n | spec_creating_function_object_4 _ o => Some o\n\n | spec_function_proto_apply _ _ _ => None\n | spec_function_proto_apply_1 _ _ _ o => Some o \n | spec_function_proto_apply_2 _ _ _ y => out_of_specret y\n | spec_function_proto_apply_3 _ _ y => out_of_specret y\n\n | spec_function_proto_bind_1 _ _ _ => None \n | spec_function_proto_bind_2 _ _ _ => None \n | spec_function_proto_bind_3 _ y => out_of_specret y \n | spec_function_proto_bind_4 _ _ => None \n | spec_function_proto_bind_5 _ => None\n | spec_function_proto_bind_6 _ o => Some o \n | spec_function_proto_bind_7 _ o => Some o\n\n | spec_create_new_function_in execution_ctx _ _ => None\n\n | spec_call _ _ _ => None\n | spec_call_1 _ _ _ _ => None\n\n | spec_call_prealloc _ _ _ => None\n\n | spec_call_default _ _ _ => None\n | spec_call_default_1 _ => None\n | spec_call_default_2 _ => None\n | spec_call_default_3 o => Some o\n\n | spec_construct _ _ => None\n | spec_construct_1 _ _ _ => None\n\n | spec_construct_prealloc _ _ => None\n\n | spec_construct_default _ _ => None\n | spec_construct_default_1 _ _ o => Some o\n | spec_construct_default_2 _ o => Some o\n\n | spec_construct_1_after_bind _ _ _ => None\n\n | spec_construct_bool_1 o => Some o\n\n | spec_construct_number_1 o => Some o\n\n | spec_call_global_is_nan_1 o => Some o\n | spec_call_global_is_finite_1 o => Some o\n\n | spec_call_object_call_1 _ _ => None\n | spec_call_object_new_1 _ => None\n | spec_call_object_get_proto_of_1 _ => None\n | spec_call_object_is_extensible_1 _ => None\n\n | spec_call_object_define_props_1 _ _ => None\n | spec_call_object_define_props_2 o _ => Some o\n | spec_call_object_define_props_3 _ _ _ _ => None\n | spec_call_object_define_props_4 o _ _ _ _ _ => Some o\n | spec_call_object_define_props_5 _ _ _ _ _ y => out_of_specret y\n | spec_call_object_define_props_6 _ _ => None\n | spec_call_object_define_props_7 o _ _ => Some o\n\n | spec_call_object_create_1 _ _ => None\n | spec_call_object_create_2 o _ _ => Some o\n | spec_call_object_create_3 _ _ => None\n\n | spec_call_object_seal_1 _ => None\n | spec_call_object_seal_2 _ _ => None\n | spec_call_object_seal_3 _ _ _ y => out_of_specret y\n | spec_call_object_seal_4 _ _ o => Some o\n\n | spec_call_object_is_sealed_1 _ => None\n | spec_call_object_is_sealed_2 _ _ => None\n | spec_call_object_is_sealed_3 _ _ y => out_of_specret y\n\n | spec_call_object_freeze_1 _ => None\n | spec_call_object_freeze_2 _ _ => None\n | spec_call_object_freeze_3 _ _ _ y => out_of_specret y\n | spec_call_object_freeze_4 _ _ _ _ => None\n | spec_call_object_freeze_5 _ _ o => Some o\n\n | spec_call_object_is_frozen_1 _ => None\n | spec_call_object_is_frozen_2 _ _ => None\n | spec_call_object_is_frozen_3 _ _ y => out_of_specret y\n | spec_call_object_is_frozen_4 _ _ _ => None\n | spec_call_object_is_frozen_5 _ _ _ => None\n\n\n | spec_call_object_prevent_extensions_1 _ => None\n\n | spec_call_object_define_prop_1 _ _ _ => None\n | spec_call_object_define_prop_2 _ o _ => Some o\n | spec_call_object_define_prop_3 _ _ y => out_of_specret y\n | spec_call_object_define_prop_4 _ o => Some o\n\n | spec_call_object_get_own_prop_descriptor_1 _ _ => None\n | spec_call_object_get_own_prop_descriptor_2 _ o => Some o\n\n | spec_call_object_proto_to_string_1 _ => None\n | spec_call_object_proto_to_string_2 o => Some o\n\n | spec_call_object_proto_has_own_prop_1 o _ => Some o\n | spec_call_object_proto_has_own_prop_2 o _ => Some o\n | spec_call_object_proto_has_own_prop_3 y => out_of_specret y\n\n | spec_call_object_proto_is_prototype_of_2_1 _ _ => None\n | spec_call_object_proto_is_prototype_of_2_2 o _ => Some o\n | spec_call_object_proto_is_prototype_of_2_3 _ _ => None\n | spec_call_object_proto_is_prototype_of_2_4 _ _ => None\n\n | spec_call_object_proto_prop_is_enumerable_1 _ _ => None\n | spec_call_object_proto_prop_is_enumerable_2 _ o => Some o\n | spec_call_object_proto_prop_is_enumerable_3 o _ => Some o\n | spec_call_object_proto_prop_is_enumerable_4 y => out_of_specret y\n\n | spec_call_array_new_1 _ => None\n | spec_call_array_new_2 _ _ => None\n | spec_call_array_new_3 _ _ _ => None\n\n | spec_call_array_new_single_1 _ => None\n | spec_call_array_new_single_2 _ _ => None\n | spec_call_array_new_single_3 _ _ y => out_of_specret y\n | spec_call_array_new_single_4 _ _ => None\n \n | spec_call_array_is_array_1 _ => None\n | spec_call_array_is_array_2_3 _ => None\n\n | spec_call_array_proto_join o _ => Some o \n | spec_call_array_proto_join_1 _ o _ => Some o \n | spec_call_array_proto_join_2 _ y _ => out_of_specret y\n | spec_call_array_proto_join_3 _ _ _ => None\n | spec_call_array_proto_join_4 _ _ o => Some o\n | spec_call_array_proto_join_5 _ _ _ y => out_of_specret y\n\n | spec_call_array_proto_join_elements _ _ _ _ _ => None\n | spec_call_array_proto_join_elements_1 _ _ _ _ _ => None\n | spec_call_array_proto_join_elements_2 _ _ _ _ _ y => out_of_specret y\n\n | spec_call_array_proto_to_string o => Some o\n | spec_call_array_proto_to_string_1 _ o => Some o\n\n | spec_call_array_proto_pop_1 o => Some o\n | spec_call_array_proto_pop_2 _ o => Some o\n | spec_call_array_proto_pop_3 _ y => out_of_specret y\n | spec_call_array_proto_pop_3_empty_1 _ => None\n | spec_call_array_proto_pop_3_empty_2 o => Some o\n | spec_call_array_proto_pop_3_nonempty_1 _ _ => None\n | spec_call_array_proto_pop_3_nonempty_2 _ o => Some o\n | spec_call_array_proto_pop_3_nonempty_3 _ _ o => Some o\n | spec_call_array_proto_pop_3_nonempty_4 _ _ _ o => Some o\n | spec_call_array_proto_pop_3_nonempty_5 _ o => Some o\n\n | spec_call_array_proto_push_1 o _ => Some o\n | spec_call_array_proto_push_2 _ _ o => Some o\n | spec_call_array_proto_push_3 _ _ y => out_of_specret y\n | spec_call_array_proto_push_4 _ _ _ => None\n | spec_call_array_proto_push_4_nonempty_1 _ _ _ _ => None\n | spec_call_array_proto_push_4_nonempty_2 _ _ _ _ o => Some o\n | spec_call_array_proto_push_4_nonempty_3 _ _ _ _ o => Some o\n | spec_call_array_proto_push_5 _ _ => None\n | spec_call_array_proto_push_6 _ o => Some o\n\n | spec_call_string_non_empty o => Some o \n\n | spec_construct_string_1 _ => None\n | spec_construct_string_2 o => Some o\n\n | spec_call_bool_proto_to_string_1 o => Some o\n | spec_call_bool_proto_value_of_1 _ => None\n | spec_call_bool_proto_value_of_2 _ => None\n\n | spec_call_number_proto_to_string_1 _ _ => None\n | spec_call_number_proto_to_string_2 _ o => Some o\n | spec_call_number_proto_value_of_1 _ => None\n\n | spec_call_error_proto_to_string_1 _ => None\n | spec_call_error_proto_to_string_2 _ o => Some o\n | spec_call_error_proto_to_string_3 _ o => Some o\n | spec_call_error_proto_to_string_4 _ _ o => Some o\n | spec_call_error_proto_to_string_5 _ _ o => Some o\n | spec_call_error_proto_to_string_6 _ _ o => Some o\n\n | spec_returns o => Some o\n end.\n\nDefinition out_of_ext_stat (p : ext_stat) : option out :=\n match p with\n | stat_expr_1 (specret_out o) => Some o\n | stat_expr_1 (specret_val _ _) => None\n | stat_basic _ => None\n\n | stat_block_1 o _ => Some o\n | stat_block_2 _ o => Some o\n\n | stat_label_1 _ o => Some o\n\n | stat_var_decl_1 o _ => Some o\n | stat_var_decl_item _ => None\n | stat_var_decl_item_1 _ y _ => out_of_specret y\n | stat_var_decl_item_2 _ _ y => out_of_specret y\n | stat_var_decl_item_3 _ o => Some o\n\n | stat_if_1 y _ _ => out_of_specret y\n\n | stat_while_1 _ _ _ _ => None\n | stat_while_2 _ _ _ _ y => out_of_specret y\n | stat_while_3 _ _ _ _ o => Some o\n | stat_while_4 _ _ _ _ _ => None\n | stat_while_5 _ _ _ _ _ => None\n | stat_while_6 _ _ _ _ _ => None\n\n | stat_do_while_1 _ _ _ _ => None\n | stat_do_while_2 _ _ _ _ o => Some o\n | stat_do_while_3 _ _ _ _ _ => None\n | stat_do_while_4 _ _ _ _ _ => None\n | stat_do_while_5 _ _ _ _ _ => None\n | stat_do_while_6 _ _ _ _ => None\n | stat_do_while_7 _ _ _ _ y => out_of_specret y\n\n | stat_for_1 _ y _ _ _ => out_of_specret y\n | stat_for_2 _ _ _ _ _ => None\n | stat_for_3 _ _ _ y _ _ => out_of_specret y\n | stat_for_4 _ _ _ _ _ => None\n | stat_for_5 _ _ _ o _ _ => Some o\n | stat_for_6 _ _ _ _ _ _ => None\n | stat_for_7 _ _ _ _ _ _ => None\n | stat_for_8 _ _ _ _ _ => None\n | stat_for_9 _ _ _ _ y _ => out_of_specret y\n | stat_for_var_1 o _ _ _ _ => Some o\n\n | stat_with_1 _ y => out_of_specret y\n\n | stat_throw_1 y => out_of_specret y\n\n | stat_return_1 y => out_of_specret y\n\n | stat_try_1 o _ _ => Some o\n | stat_try_2 o _ _ _ => Some o\n | stat_try_3 o _ => Some o\n | stat_try_4 _ _ => None\n | stat_try_5 _ o => Some o\n\n | stat_switch_1 y _ _ => out_of_specret y\n | stat_switch_2 o _ => Some o\n | stat_switch_nodefault_1 _ _ _=> None\n | stat_switch_nodefault_2 y _ _ _ _ => out_of_specret y\n | stat_switch_nodefault_3 _ _ _ _ _ => None\n | stat_switch_nodefault_4 o _ => Some o\n | stat_switch_nodefault_5 _ _ => None\n | stat_switch_nodefault_6 _ o _ => Some o\n\n | stat_switch_default_1 _ _ _ _ _ => None\n | stat_switch_default_A_1 _ _ _ _ _ _ => None \n | stat_switch_default_A_2 y _ _ _ _ _ _ => out_of_specret y\n | stat_switch_default_A_3 _ _ _ _ _ _ _ => None\n | stat_switch_default_A_4 _ _ _ _ _ _ => None\n | stat_switch_default_A_5 _ o _ _ _ _ => Some o\n | stat_switch_default_B_1 _ _ _ _ => None\n | stat_switch_default_B_2 y _ _ _ _ _ => out_of_specret y\n | stat_switch_default_B_3 _ _ _ _ _ _ => None\n | stat_switch_default_B_4 o _ _ => Some o\n\n | stat_switch_default_5 _ _ _ _ => None\n | stat_switch_default_6 o _ => Some o \n | stat_switch_default_7 _ _ => None\n | stat_switch_default_8 _ o _ => Some o\n\n end.\n\nDefinition out_of_ext_prog (p : ext_prog) : option out :=\n match p with\n | prog_basic _ => None\n | javascript_1 o _ => Some o\n | prog_1 o _ => Some o\n | prog_2 _ o => Some o\n\n end.\n\nDefinition out_of_ext_spec (es : ext_spec) : option out :=\n match es with\n | spec_to_int32 _ => None\n | spec_to_int32_1 o => Some o\n | spec_to_uint32 _ => None\n | spec_to_uint32_1 o => Some o\n | spec_expr_get_value_conv _ _ => None\n | spec_expr_get_value_conv_1 _ y => out_of_specret y\n | spec_expr_get_value_conv_2 o => Some o\n | spec_convert_twice _ _ => None\n | spec_convert_twice_1 o _ => Some o\n | spec_convert_twice_2 _ o => Some o\n | spec_list_expr _ => None\n | spec_list_expr_1 _ _ => None\n | spec_list_expr_2 _ y _ => out_of_specret y\n | spec_to_descriptor _ => None\n | spec_to_descriptor_1a _ _ => None\n | spec_to_descriptor_1b o _ _ => Some o\n | spec_to_descriptor_1c o _ _ => Some o\n | spec_to_descriptor_2a _ _ => None\n | spec_to_descriptor_2b o _ _ => Some o\n | spec_to_descriptor_2c o _ _ => Some o\n | spec_to_descriptor_3a _ _ => None\n | spec_to_descriptor_3b o _ _ => Some o\n | spec_to_descriptor_3c o _ _ => Some o\n | spec_to_descriptor_4a _ _ => None\n | spec_to_descriptor_4b o _ _ => Some o\n | spec_to_descriptor_4c o _ _ => Some o\n | spec_to_descriptor_5a _ _ => None\n | spec_to_descriptor_5b o _ _ => Some o\n | spec_to_descriptor_5c o _ _ => Some o\n | spec_to_descriptor_6a _ _ => None\n | spec_to_descriptor_6b o _ _=> Some o\n | spec_to_descriptor_6c o _ _ => Some o\n | spec_to_descriptor_7 _ _ => None\n | spec_object_get_own_prop _ _ => None\n | spec_object_get_own_prop_1 _ _ _ => None\n | spec_object_get_own_prop_2 _ _ _ => None\n | spec_object_get_prop _ _ => None\n | spec_object_get_prop_1 _ _ _ => None\n | spec_object_get_prop_2 _ _ y => out_of_specret y\n | spec_object_get_prop_3 _ _ _ => None\n | spec_get_value _ => None\n | spec_get_value_ref_b_1 o => Some o\n | spec_get_value_ref_c_1 o => Some o\n | spec_expr_get_value _ => None\n | spec_expr_get_value_1 o => Some o\n | spec_lexical_env_get_identifier_ref _ _ _ => None\n | spec_lexical_env_get_identifier_ref_1 _ _ _ _ => None\n | spec_lexical_env_get_identifier_ref_2 _ _ _ _ o => Some o\n | spec_error_spec _ => None\n | spec_error_spec_1 o => Some o\n | spec_args_obj_get_own_prop_1 _ _ y => out_of_specret y\n | spec_args_obj_get_own_prop_2 _ _ _ _ y => out_of_specret y\n | spec_args_obj_get_own_prop_3 _ o => Some o\n | spec_args_obj_get_own_prop_4 _ => None\n | spec_string_get_own_prop_1 _ _ y => out_of_specret y\n | spec_string_get_own_prop_2 _ _ y => out_of_specret y\n | spec_string_get_own_prop_3 _ _ o => Some o\n | spec_string_get_own_prop_4 _ _ => None\n | spec_string_get_own_prop_5 _ y => out_of_specret y\n | spec_string_get_own_prop_6 _ _ _ => None\n | spec_function_proto_apply_get_args _ _ _ => None\n | spec_function_proto_apply_get_args_1 _ _ _ o => Some o \n | spec_function_proto_apply_get_args_2 _ _ _ o => Some o \n | spec_function_proto_apply_get_args_3 _ y => out_of_specret y\n | spec_function_proto_bind_length _ _ => None\n | spec_function_proto_bind_length_1 _ _ => None\n | spec_function_proto_bind_length_2 _ o => Some o\n | spec_function_proto_bind_length_3 y _ => out_of_specret y\n | spec_call_array_proto_join_vtsfj _ _ => None\n | spec_call_array_proto_join_vtsfj_1 _ o => Some o \n | spec_call_array_proto_join_vtsfj_2 _ o => Some o \n | spec_call_array_proto_join_vtsfj_3 o => Some o \n end.\n\n\n(**************************************************************)\n(** ** Rules for propagating aborting expressions *)\n\n(** Definition of a result of type normal *)\n\nDefinition res_is_normal R :=\n res_type R = restype_normal.\n\n(** Definition of aborting outcomes: diverging outcomes,\n and terminating outcomes that are not of type \"normal\". *)\n\nInductive abort : out -> Prop :=\n | abort_div :\n abort out_div\n | abort_not_normal : forall S R,\n abrupt_res R ->\n abort (out_ter S R).\n\n(** Definition of the behaviors caught by an exception handler,\n and thus not propagated by the generic abort rule *)\n\nInductive abort_intercepted_prog : ext_prog -> Prop :=\n | abort_intercepted_prog_block_2 : forall S R rv,\n abort_intercepted_prog (prog_2 rv (out_ter S R)).\n\nInductive abort_intercepted_stat : ext_stat -> Prop :=\n\n | abort_intercepted_stat_block_2 : forall S R rv,\n abort_intercepted_stat (stat_block_2 rv (out_ter S R))\n | abort_intercepted_stat_label_1 : forall lab rv S R,\n R = res_intro restype_break rv lab ->\n abort_intercepted_stat (stat_label_1 lab (out_ter S R))\n | abort_intercepted_do_while_2 : forall labs e1 t2 rv S R,\n res_label_in R labs ->\n (res_type R = restype_continue \\/ res_type R = restype_break) ->\n abort_intercepted_stat (stat_do_while_2 labs t2 e1 rv (out_ter S R))\n | abort_intercepted_while_3 : forall labs e1 t2 rv S R,\n res_label_in R labs ->\n (res_type R = restype_continue \\/ res_type R = restype_break) ->\n abort_intercepted_stat (stat_while_3 labs e1 t2 rv (out_ter S R))\n | abort_intercepted_stat_try_1 : forall S R cb fo,\n res_type R = restype_throw ->\n abort_intercepted_stat (stat_try_1 (out_ter S R) (Some cb) fo)\n | abort_intercepted_stat_try_3 : forall S R fo,\n abort_intercepted_stat (stat_try_3 (out_ter S R) fo)\n | abort_intercepted_stat_switch_2 : forall S R labs,\n res_type R = restype_break ->\n res_label_in R labs -> \n abort_intercepted_stat (stat_switch_2 (out_ter S R) labs)\n | abort_intercepted_stat_switch_nodefault_6 : forall S rv R scs,\n abrupt_res R ->\n res_type R <> restype_throw -> \n abort_intercepted_stat (stat_switch_nodefault_6 rv (out_ter S R) scs)\n | abort_intercepted_stat_switch_default_8 : forall S rv R scs,\n abrupt_res R ->\n res_type R <> restype_throw ->\n abort_intercepted_stat (stat_switch_default_8 rv (out_ter S R) scs)\n | abort_intercepted_stat_switch_default_A_5 : forall S rv R vi scs ts1 scs2,\n abrupt_res R ->\n res_type R <> restype_throw ->\n abort_intercepted_stat (stat_switch_default_A_5 rv (out_ter S R) vi scs ts1 scs2)\n | abort_intercepted_stat_for_6 : forall S0 S C labs rv R eo2 eo3 t,\n abort_intercepted_stat (stat_for_6 labs rv eo2 eo3 t R)\n | abort_intercepted_stat_for_7 : forall S0 S C labs rv R eo2 eo3 t,\n abort_intercepted_stat (stat_for_7 labs rv eo2 eo3 t R)\n.\n\nInductive abort_intercepted_expr : ext_expr -> Prop :=\n | abort_intercepted_expr_call_default_2 : forall S R,\n res_type R = restype_return ->\n abort_intercepted_expr (spec_call_default_3 (out_ter S R))\n | abort_intercepted_expr_call_global_eval_3 : forall S R,\n res_type R = restype_throw ->\n abort_intercepted_expr (spec_call_global_eval_3 (out_ter S R)).\n\nInductive abort_intercepted_spec : ext_spec -> Prop :=\n .\n\n(**************************************************************)\n(** ** Auxiliary definition used in identifier resolution *)\n\n(** [spec_identifier_resolution C x] returns the extended expression\n which needs to be evaluated in order to perform the lookup\n of name [x] in the execution context [C]. Typically, a\n reduction rule that performs such a lookup would have a\n premise of the form [red_expr S C (identifier_resolution C x) o1]. *)\n\nDefinition spec_identifier_resolution C x :=\n let lex := execution_ctx_lexical_env C in\n let strict := execution_ctx_strict C in\n spec_lexical_env_get_identifier_ref lex x strict.\n\n\n(**************************************************************)\n(** ** Instantiation of arguments in function calls *)\n\nInductive arguments_from : list value -> list value -> Prop :=\n | arguments_from_nil : forall Vs,\n arguments_from Vs nil\n | arguments_from_undef : forall Vs: list value,\n arguments_from nil Vs ->\n arguments_from nil (undef::Vs)\n | arguments_from_cons : forall Vs1 Vs2 v,\n arguments_from Vs1 Vs2 ->\n arguments_from (v::Vs1) (v::Vs2).\n\nInductive arguments_first_and_rest : list value -> (value * list value) -> Prop :=\n | arguments_f_a_r_from_nil : arguments_first_and_rest nil (undef, nil)\n | arguments_f_a_r_from_cons : forall v lv, \n arguments_first_and_rest (v :: lv) (v, lv).\n\nHint Constructors arguments_first_and_rest.\n\n(**************************************************************)\n(** ** Rules for delete_events. *)\n\n(** [search_proto_chain S l x] returns the location l' of the first object \n in the prototype chain of l which contains property x. *)\n\nInductive search_proto_chain : state -> object_loc -> prop_name -> option object_loc -> Prop :=\n | search_proto_chain_found : forall S l x,\n object_has_property S l x ->\n search_proto_chain S l x (Some l)\n | search_proto_chain_not_found : forall S l x,\n not (object_has_property S l x) ->\n object_proto S l prim_null ->\n search_proto_chain S l x None\n | search_proto_chain_inductive : forall S l x v l' res,\n not (object_has_property S l x) ->\n object_proto S l (value_object l') ->\n search_proto_chain S l' x res ->\n search_proto_chain S l x res.\n\n\n(** [make_delete_event S l x ev] constructs a delete_event \"ev\" which\nrecords the deletion of the property (l,x) in the state S. *)\n\nInductive make_delete_event : state -> object_loc -> prop_name -> event -> Prop :=\n | make_delete_event_intro : forall S l x res ev,\n search_proto_chain S l x res ->\n ev = delete_event l x res ->\n make_delete_event S l x ev.\n\n(**************************************************************)\n(** ** Auxiliary definitions for the semantics of for-in. *)\n\n(* LATER *)\n\n\n(**************************************************************)\n(** ** Implementation Defined Object *)\n\n(** As stated in Section 2 of the ECMAScript specification, an\n implementation can provide additionnal properties not described in\n the specification. **)\n\n(** As we are only describing the core of JavaScrip here, this\n inductive shall be empty. But one can found in the other branches\n of this developpment some examples of non-empty instantiation of\n this predicate. **)\n\nInductive implementation_prealloc : prealloc -> Prop :=\n .\n\n\n(**************************************************************)\n(** Shorthand **)\n\nDefinition vret : state -> value -> specret value := ret (T:=value).\nDefinition dret : state -> full_descriptor -> specret full_descriptor := ret (T:=full_descriptor).\n\n" }, { "path": "src/test/resources/samples/langs/Coq/Lists.v", "content": "Require Export Basics.\nModule NatList.\nImport Playground1.\n\nInductive natprod : Type :=\n\tpair : nat -> nat -> natprod.\n\nDefinition fst (p : natprod) : nat :=\n\tmatch p with\n\t\t| pair x y => x\n\tend.\n\nDefinition snd (p : natprod) : nat :=\n\tmatch p with\n\t\t| pair x y => y\n\tend.\n\nNotation \"( x , y )\" := (pair x y).\n\nDefinition swap_pair (p : natprod) : natprod :=\n\tmatch p with\n\t\t\t| (x, y) => (y, x)\n\tend.\n\nTheorem surjective_pairing' : forall (n m : nat),\n\t(n, m) = (fst (n, m), snd (n, m)).\nProof.\n\treflexivity. Qed.\n\nTheorem surjective_pairing : forall (p : natprod),\n\tp = (fst p, snd p).\nProof.\n\tintros p.\n\tdestruct p as (n, m).\n\tsimpl.\n\treflexivity.\n\tQed.\n\nTheorem snd_fst_is_swap : forall (p : natprod),\n\t(snd p, fst p) = swap_pair p.\nProof.\n\tintros p.\n\tdestruct p.\n\treflexivity.\n\tQed.\n\nTheorem fst_swap_is_snd : forall (p : natprod),\n\t fst (swap_pair p) = snd p.\nProof.\n\tintros p.\n\tdestruct p.\n\treflexivity.\n\tQed.\n\nInductive natlist : Type :=\n\t| nil : natlist\n\t| cons : nat -> natlist -> natlist.\n\nDefinition l_123 := cons (S O) (cons (S (S O)) (cons (S (S (S O))) nil)).\n\nNotation \"x :: l\" := (cons x l) (at level 60, right associativity).\nNotation \"[ ]\" := nil.\nNotation \"[]\" := nil.\nNotation \"[ x , .. , y ]\" := (cons x .. (cons y nil) ..).\n\nFixpoint repeat (n count : nat) : natlist :=\n\tmatch count with\n\t\t| O => nil\n\t\t| S count' => n :: (repeat n count')\n\tend.\n\nFixpoint length (l:natlist) : nat :=\n\tmatch l with\n\t\t| nil => O\n\t\t| h :: t => S (length t)\n\tend.\n\nFixpoint app (l1 l2 : natlist) : natlist :=\n\tmatch l1 with\n\t\t| nil => l2\n\t\t| h :: t => h :: (app t l2)\n\tend.\n\nNotation \"x ++ y\" := (app x y) (right associativity, at level 60).\n\n(*\nExample test_app1: [1,2,3] ++ [4,5] = [1,2,3,4,5].\nProof. reflexivity. Qed.\nExample test_app2: nil ++ [4,5] = [4,5].\nProof. reflexivity. Qed.\nExample test_app3: [1,2,3] ++ [] = [1,2,3].\nProof. reflexivity. Qed.\n*)\n\nDefinition head (l : natlist) : nat :=\n\tmatch l with\n\t\t| nil => O\n\t\t| h :: t => h\n\tend.\n\nDefinition tl (l : natlist) : natlist :=\n\tmatch l with\n\t\t| nil => nil\n\t\t| h :: t => t\n\tend.\n\n\t\t\t(*\nExample test_tl: tl [1,2,3] = [2,3].\nProof. reflexivity. Qed.\n*)\n\nFixpoint nonzeros (l:natlist) : natlist :=\n\tmatch l with\n\t\t| nil => nil\n\t\t| O :: r => nonzeros r\n\t\t| n :: r => n :: (nonzeros r)\n\tend.\n\nExample test_nonzeros: nonzeros [O,S O,O,S (S O), S (S (S O)),O,O] = [S O,S (S O), S (S (S O))].\nProof. reflexivity. Qed.\n\nFixpoint oddmembers (l:natlist) : natlist :=\n\tmatch l with\n\t\t| nil => nil\n\t\t| n :: r => match (oddb n) with\n\t\t\t\t\t\t\t\t\t\t| true => n :: (oddmembers r)\n\t\t\t\t\t\t\t\t\t\t| false => oddmembers r\n\t\t\t\t\t\t\t\tend\n\tend.\n\nExample test_oddmembers: oddmembers [O, S O, O, S (S O), S (S (S O)), O, O] = [S O, S (S (S O))].\nProof. reflexivity. Qed.\n\nFixpoint countoddmembers (l:natlist) : nat :=\n\t\tlength (oddmembers l).\n\nExample test_countoddmembers2: countoddmembers [O, S (S O), S (S (S (S O)))] = O.\nProof. reflexivity. Qed.\n\nExample test_countoddmembers3: countoddmembers [] = O.\nProof. reflexivity. Qed.\n\nFixpoint alternate (l1 l2 : natlist) : natlist :=\n\t\tmatch l1 with\n\t\t\t\t| nil => l2\n\t\t\t\t| a :: r1 => match l2 with\n\t\t\t\t\t\t\t\t\t\t\t| nil => l1\n\t\t\t\t\t\t\t\t\t\t\t| b :: r2 => a :: b :: (alternate r1 r2)\n\t\t\t\t\t\t\t\t\t\tend\n\t\tend.\n\nExample test_alternative1: alternate [S O, S (S O), S (S (S O))] [S (S (S (S O))), S (S (S (S (S O)))), S (S (S (S (S (S O)))))] =\n\t\t[S O, S (S (S (S O))), S (S O), S (S (S (S (S O)))), S (S (S O)), S (S (S (S (S (S O)))))].\nProof. reflexivity. Qed.\n\nDefinition bag := natlist.\n\nFixpoint count (v : nat) (s: bag) : nat :=\n\tmatch s with\n\t\t| nil => O\n\t\t| v' :: r => match (beq_nat v' v) with\n\t\t\t\t\t\t\t\t\t\t| true => S (count v r)\n\t\t\t\t\t\t\t\t\t\t| false => count v r\n\t\t\t\t\t\t\t\t end\n\tend.\n\nExample test_count1: count (S O) [S O, S (S O), S (S (S O)), S O, S (S (S (S O))), S O] = S (S (S O)).\nProof. reflexivity. Qed.\n\nDefinition sum : bag -> bag -> bag := app.\n\nExample test_sum1: count (S O) (sum [S O, S (S O), S (S (S O))] [S O, S (S (S (S O))), S O]) = S (S (S O)).\nProof. reflexivity. Qed.\n\nDefinition add (v:nat) (s:bag) : bag := v :: s.\n\nExample test_add1: count (S O) (add (S O) [S O, S (S (S (S O))), S O]) = S (S (S O)).\nProof. reflexivity. Qed.\n\nDefinition member (v:nat) (s:bag) : bool :=\n\tble_nat (S O) (count v s).\n\nExample test_member1: member (S O) [S O, S (S (S (S O))), S O] = true.\nProof. reflexivity. Qed.\n\nExample test_member2: member (S (S O)) [S O, S (S (S (S O))), S O] = false.\nProof. reflexivity. Qed.\n\nFixpoint remove_one (v:nat) (s:bag) : bag :=\n\tmatch s with\n\t\t| nil => nil\n\t\t| v' :: r => match (beq_nat v v') with\n\t\t\t\t\t\t\t\t\t| true => r\n\t\t\t\t\t\t\t\t\t| false => v' :: (remove_one v r)\n\t\t\t\t\t\t\t\t end\n\tend.\n\nExample test_remove_one1: count (S (S (S (S (S O)))))\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t(remove_one (S (S (S (S (S O)))))\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t[S (S O), S O, S (S (S (S (S O)))), S (S (S (S O))), S O]) = O.\nProof. reflexivity. Qed.\n\nFixpoint remove_all (v:nat) (s:bag) : bag :=\n\tmatch s with\n\t\t| nil => nil\n\t\t| v' :: r => match (beq_nat v v') with\n\t\t\t\t\t\t\t\t\t\t| true => remove_all v r\n\t\t\t\t\t\t\t\t\t\t| false => v' :: (remove_all v r)\n\t\t\t\t\t\t\t\t end\n\tend.\n\nExample test_remove_all1: count (S (S (S (S (S O)))))\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t(remove_all (S (S (S (S (S O)))))\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t[S (S O), S O, S (S (S (S (S O)))), S (S (S (S O))), S O]) = O.\nProof. reflexivity. Qed.\n\nFixpoint subset (s1:bag) (s2:bag) : bool :=\n\t\tmatch s1 with\n\t\t\t| nil => true\n\t\t\t| v :: r => andb (member v s2)\n\t\t\t\t\t\t\t\t\t\t\t (subset r (remove_one v s2))\n\t\tend.\n\nDefinition test_subset1: subset [S O, S (S O)] [S (S O), S O, S (S (S (S O))), S O] = true.\nProof. reflexivity. Qed.\nDefinition test_subset2: subset [S O, S (S O), S (S O)] [S (S O), S O, S (S (S (S O))), S O] = false.\nProof. reflexivity. Qed.\n\nTheorem bag_count_add : forall n t: nat, forall s : bag,\n\t\t\t\tcount n s = t -> count n (add n s) = S t.\nProof.\n\tintros n t s.\n\tintros H.\n\tinduction s.\n\tsimpl.\n\trewrite <- beq_nat_refl.\n\trewrite <- H.\n\treflexivity.\n\trewrite <- H.\n\tsimpl.\n\trewrite <- beq_nat_refl.\n\treflexivity.\nQed.\n\nTheorem nil_app : forall l:natlist,\n\t[] ++ l = l.\nProof.\n\treflexivity. Qed.\n\nTheorem tl_length_pred : forall l:natlist,\n\tpred (length l) = length (tl l).\nProof.\n\tintros l. destruct l as [| n l'].\n\tCase \"l = nil\".\n\t\treflexivity.\n\tCase \"l = cons n l'\".\n\t\treflexivity. Qed.\n\nTheorem app_ass:forall l1 l2 l3 : natlist,\n\t(l1 ++ l2) ++ l3 = l1 ++ (l2 ++ l3).\nProof.\n\tintros l1 l2 l3. induction l1 as [| n l1'].\n\tCase \"l1 = nil\".\n\t\treflexivity.\n\tCase \"l1 = cons n l1'\".\n\t\tsimpl. rewrite -> IHl1'. reflexivity. Qed.\n\nTheorem app_length: forall l1 l2 : natlist,\n\tlength (l1 ++ l2) = (length l1) + (length l2).\nProof.\n\tintros l1 l2. induction l1 as [| n l1'].\n\tCase \"l1 = nil\".\n\t\treflexivity.\n\tCase \"l1 = cons\".\n\t\tsimpl. rewrite -> IHl1'. reflexivity. Qed.\n\nFixpoint snoc (l:natlist) (v:nat) : natlist :=\n\tmatch l with\n\t\t| nil => [v]\n\t\t| h :: t => h :: (snoc t v)\n\tend.\n\nFixpoint rev (l:natlist) : natlist :=\n\tmatch l with\n\t\t| nil => nil\n\t\t| h :: t => snoc (rev t) h\n\tend.\n\nExample test_rev1: rev [S O, S (S O), S (S (S O))] = [S (S (S O)), S (S O), S O].\nProof. reflexivity. Qed.\n\nTheorem length_snoc : forall n : nat, forall l : natlist,\n\tlength (snoc l n) = S (length l).\nProof.\n\tintros n l. induction l as [| n' l'].\n\tCase \"l = nil\".\n\t\treflexivity.\n\tCase \"l = cons n' l'\".\n\t\tsimpl. rewrite -> IHl'. reflexivity. Qed.\n\nTheorem rev_length : forall l : natlist,\n\tlength (rev l) = length l.\nProof.\n\tintros l. induction l as [| n l'].\n\tCase \"l = nil\".\n\t\treflexivity.\n\tCase \"l = cons\".\n\t\tsimpl. rewrite -> length_snoc.\n\t\trewrite -> IHl'. reflexivity. Qed.\n\nTheorem app_nil_end : forall l :natlist,\n\tl ++ [] = l.\nProof.\n\tintros l.\n\tinduction l.\n\tCase \"l = nil\".\n\t\treflexivity.\n\tCase \"l = cons\".\n\t\tsimpl. rewrite -> IHl. reflexivity. Qed.\n\n\n\nTheorem rev_snoc : forall l: natlist, forall n : nat,\n\trev (snoc l n) = n :: (rev l).\nProof.\n\tintros l n.\n\tinduction l.\n\tCase \"l = nil\".\n\t\treflexivity.\n\tCase \"l = cons\".\n\t\tsimpl.\n\t\trewrite -> IHl.\n\t\treflexivity.\n\t\tQed.\n\nTheorem rev_involutive : forall l : natlist,\n\trev (rev l) = l.\nProof.\n\tintros l.\n\tinduction l.\n\tCase \"l = nil\".\n\t\treflexivity.\n\tCase \"l = cons\".\n\t\tsimpl.\n\t\trewrite -> rev_snoc.\n\t\trewrite -> IHl.\n\t\treflexivity.\n\t\tQed.\n\nTheorem app_ass4 : forall l1 l2 l3 l4 : natlist,\n\tl1 ++ (l2 ++ (l3 ++ l4)) = ((l1 ++ l2) ++ l3) ++ l4.\nProof.\n\tintros l1 l2 l3 l4.\n\trewrite -> app_ass.\n\trewrite -> app_ass.\n\treflexivity.\n\tQed.\n\nTheorem snoc_append : forall (l : natlist) (n : nat),\n\tsnoc l n = l ++ [n].\nProof.\n\tintros l n.\n\tinduction l.\n\tCase \"l = nil\".\n\t\treflexivity.\n\tCase \"l = cons\".\n\t\tsimpl.\n\t\trewrite -> IHl.\n\t\treflexivity.\n\t\tQed.\n\nTheorem nonzeros_length : forall l1 l2 : natlist,\n\tnonzeros (l1 ++ l2) = (nonzeros l1) ++ (nonzeros l2).\nProof.\n\tintros l1 l2.\n\tinduction l1.\n\tCase \"l1 = nil\".\n\t\treflexivity.\n\tCase \"l1 = cons\".\n\t\tsimpl.\n\t\trewrite -> IHl1.\n\t\tdestruct n.\n\t\treflexivity.\n\t\treflexivity.\n\t\tQed.\n\nTheorem distr_rev : forall l1 l2 : natlist,\n\trev (l1 ++ l2) = (rev l2) ++ (rev l1).\nProof.\n\tintros l1 l2.\n\tinduction l1.\n\tCase \"l1 = nil\".\n\t\tsimpl.\n\t\trewrite -> app_nil_end.\n\t\treflexivity.\n\tCase \"l1 = cons\".\n\t\tsimpl.\n\t\trewrite -> IHl1.\n\t\tsimpl.\n\t\trewrite -> snoc_append.\n\t\trewrite -> snoc_append.\n\t\trewrite -> app_ass.\n\t\treflexivity.\n\t\tQed.\n\nTheorem count_number_nonzero : forall (s : bag),\n\tble_nat O (count (S O) (S O :: s)) = true.\nProof.\n\tintros s.\n\tinduction s.\n\t\treflexivity.\n\t\treflexivity.\n\t\tQed.\n\nTheorem ble_n_Sn : forall n,\n\tble_nat n (S n) = true.\nProof.\n\tintros n. induction n as [| n'].\n\tCase \"0\".\n\t\tsimpl. reflexivity.\n\tCase \"S n'\".\n\t\tsimpl. rewrite -> IHn'. reflexivity. Qed.\n\nTheorem remove_decreases_count: forall (s : bag),\n\tble_nat (count O (remove_one O s)) (count O s) = true.\nProof.\n\tintros s.\n\tinduction s.\n\tCase \"s = nil\".\n\t\treflexivity.\n\tCase \"s = cons\".\n\t\tsimpl.\n\t\tinduction n.\n\t\tSCase \"n = O\".\n\t\t\tsimpl. rewrite -> ble_n_Sn.\n\t\t\treflexivity.\n\t\tSCase \"n = S n'\".\n\t\t\tsimpl.\n\t\t\trewrite -> IHs.\n\t\t\treflexivity.\n\t\t\tQed.\n\nInductive natoption : Type :=\n\t| Some : nat -> natoption\n\t| None : natoption.\n\nFixpoint index (n:nat) (l:natlist) : natoption :=\n\tmatch l with\n\t\t| nil => None\n\t\t| a :: l' => if beq_nat n O then Some a else index (pred n) l'\n end.\n\nDefinition option_elim (o : natoption) (d : nat) : nat :=\n\tmatch o with\n\t\t| Some n' => n'\n\t\t| None => d\n\tend.\n\nDefinition hd_opt (l : natlist) : natoption :=\n\tmatch l with\n\t\t| nil => None\n\t\t| v :: r => Some v\n\tend.\n\nExample test_hd_opt1 : hd_opt [] = None.\nProof. reflexivity. Qed.\nExample test_hd_opt2 : hd_opt [S O] = Some (S O).\nProof. reflexivity. Qed.\n\nTheorem option_elim_hd : forall l:natlist,\n\thead l = option_elim (hd_opt l) O.\nProof.\n\tintros l.\n\tdestruct l.\n\treflexivity.\n\treflexivity.\n\tQed.\n\nFixpoint beq_natlist (l1 l2 : natlist) : bool :=\n\tmatch l1 with\n\t\t| nil => match l2 with\n\t\t\t\t\t\t\t| nil => true\n\t\t\t\t\t\t\t| _ => false\n\t\t\t\t\t\t end\n\t\t| v1 :: r1 => match l2 with\n\t\t\t\t\t\t\t\t\t | nil => false\n\t\t\t\t\t\t\t\t\t | v2 :: r2 => if beq_nat v1 v2 then beq_natlist r1 r2\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t else false\n\t\t\t\t\t\t\t\t\tend\n\tend.\n\nExample test_beq_natlist1 : (beq_natlist nil nil = true).\nProof. reflexivity. Qed.\nExample test_beq_natlist2 : (beq_natlist [S O, S (S O), S (S (S O))]\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t [S O, S (S O), S (S (S O))] = true).\nProof. reflexivity. Qed.\n\nTheorem beq_natlist_refl : forall l:natlist,\n\tbeq_natlist l l = true.\nProof.\n\tintros l.\n\tinduction l.\n\tCase \"l = nil\".\n\t\treflexivity.\n\tCase \"l = cons\".\n\t\tsimpl.\n\t\trewrite <- beq_nat_refl.\n\t\trewrite -> IHl.\n\t\treflexivity.\n\tQed.\n\nTheorem silly1 : forall (n m o p : nat),\n\tn = m -> [n, o] = [n, p] -> [n, o] = [m, p].\nProof.\n\tintros n m o p eq1 eq2.\n\trewrite <- eq1.\n\tapply eq2. Qed.\n\nTheorem silly2a : forall (n m : nat),\n\t(n,n) = (m,m) ->\n\t\t(forall (q r : nat), (q, q) = (r, r) -> [q] = [r]) ->\n\t\t\t[n] = [m].\nProof.\n\tintros n m eq1 eq2.\n\tapply eq2.\n\tapply eq1.\n\tQed.\n\nTheorem silly_ex :\n\t(forall n, evenb n = true -> oddb (S n) = true) ->\n\tevenb (S (S (S O))) = true ->\n\toddb (S (S (S (S O)))) = true.\nProof.\n\tintros eq1 eq2.\n\tapply eq1.\n\tapply eq2.\n\tQed.\n\nTheorem silly3 : forall (n : nat),\n\ttrue = beq_nat n (S (S (S (S (S O))))) ->\n\tbeq_nat (S (S n)) (S (S (S (S (S (S (S O))))))) = true.\nProof.\n\tintros n H.\n\tsymmetry.\n\tapply H.\n\tQed.\n\nTheorem rev_exercise : forall (l l' : natlist),\n\tl = rev l' -> l' = rev l.\nProof.\n\tintros l l' H.\n\trewrite -> H.\n\trewrite -> rev_involutive.\n\treflexivity.\n\tQed.\n\nTheorem beq_nat_sym : forall (n m:nat), forall (b: bool),\n\tbeq_nat n m = b -> beq_nat m n = b.\nProof.\n\tintros n.\n\tinduction n as [| n'].\n\tCase \"n = O\".\n\t\tintros m b eq1.\n\t\tinduction m.\n\t\tSCase \"m = 0\".\n\t\t\tapply eq1.\n\t\tSCase \"m = S m'\".\n\t\t\tapply eq1.\n\tCase \"n = S n'\".\n\t\tinduction m.\n\t\tSCase \"m = 0\".\n\t\t\tintros b eq1.\n\t\t\tapply eq1.\n\t\tSCase \"m = S m'\".\n\t\t\tintros b eq1.\n\t\t\tapply IHn'.\n\t\t\tapply eq1.\n\t\tQed.\n\nTheorem app_ass' : forall l1 l2 l3 : natlist,\n\t(l1 ++ l2) ++ l3 = l1 ++ (l2 ++ l3).\nProof.\n\tintros l1. induction l1 as [ | n l1'].\n\treflexivity.\n\tsimpl.\n\tintros l2 l3.\n\trewrite -> IHl1'.\n\treflexivity.\n\tQed.\n\nEnd NatList.\n" }, { "path": "src/test/resources/samples/langs/Coq/Main.v", "content": "Require Import FunctionNinjas.All.\nRequire Import ListString.All.\nRequire Import Computation.\n\nImport C.Notations.\n\nDefinition error (message : LString.t) : C.t :=\n do_call! Command.ShowError message in\n ret.\n\nDefinition main : C.t :=\n call! card_is_valid := Command.AskCard in\n if card_is_valid then\n call! pin := Command.AskPIN in\n match pin with\n | None => error @@ LString.s \"No PIN given.\"\n | Some pin =>\n call! pin_is_valid := Command.CheckPIN pin in\n if pin_is_valid then\n call! ask_amount := Command.AskAmount in\n match ask_amount with\n | None => error @@ LString.s \"No amount given.\"\n | Some amount =>\n call! amount_is_valid := Command.CheckAmount amount in\n if amount_is_valid then\n call! card_is_given := Command.GiveCard in\n if card_is_given then\n call! amount_is_given := Command.GiveAmount amount in\n if amount_is_given then\n ret\n else\n error @@ LString.s \"Cannot give you the amount. Please contact your bank.\"\n else\n error @@ LString.s \"Cannot give you back the card. Please contact your bank.\"\n else\n error @@ LString.s \"Invalid amount.\"\n end\n else\n error @@ LString.s \"Invalid PIN.\"\n end\n else\n error @@ LString.s \"Invalid card.\".\n" }, { "path": "src/test/resources/samples/langs/Coq/Poly.v", "content": "Require Export Lists.\nRequire Export Basics.\n\nImport Playground1.\n\nInductive list (X : Type) : Type :=\n\t| nil : list X\n\t| cons : X -> list X -> list X.\n\nFixpoint length (X:Type) (l:list X) : nat :=\n\tmatch l with\n\t\t| nil => O\n\t\t| cons h t => S (length X t)\n\tend.\n\nFixpoint app (X : Type) (l1 l2 : list X)\n\t\t\t\t\t\t\t\t\t\t: (list X) :=\n\tmatch l1 with\n\t\t| nil => l2\n\t\t| cons h t => cons X h (app X t l2)\n\tend.\n\nFixpoint snoc (X:Type) (l:list X) (v:X) : (list X) :=\n\tmatch l with\n\t\t| nil => cons X v (nil X)\n\t\t| cons h t => cons X h (snoc X t v)\n\tend.\n\nFixpoint rev (X:Type) (l:list X) : list X :=\n\tmatch l with\n\t\t| nil => nil X\n\t\t| cons h t => snoc X (rev X t) h\n\tend.\n\n\nImplicit Arguments nil [[X]].\nImplicit Arguments cons [[X]].\nImplicit Arguments length [[X]].\nImplicit Arguments app [[X]].\nImplicit Arguments rev [[X]].\nImplicit Arguments snoc [[X]].\n\nDefinition list123 := cons 1 (cons 2 (cons 3 (nil))).\n\nNotation \"x :: y\" := (cons x y) (at level 60, right associativity).\nNotation \"[]\" := nil.\nNotation \"[ x , .. , y ]\" := (cons x .. (cons y []) ..).\nNotation \"x ++ y\" := (app x y) (at level 60, right associativity).\n\nFixpoint repeat (X : Type) (n : X) (count : nat) : list X :=\n\tmatch count with\n\t\t| O => nil\n\t\t| S count' => n :: (repeat _ n count')\n\tend.\n\nExample test_repeat1:\n\trepeat bool true (S (S O)) = [true, true].\nProof. reflexivity. Qed.\n\nTheorem nil_app : forall X:Type, forall l:list X,\n\tapp [] l = l.\nProof.\n\treflexivity.\n\tQed.\n\nTheorem rev_snoc : forall X : Type,\n\t\t\t\t\t\t\t\t\t forall v : X,\n\t\t\t\t\t\t\t\t\t forall s : list X,\n\trev (snoc s v) = v :: (rev s).\nProof.\n\tintros X v s.\n\tinduction s.\n\t\treflexivity.\n\t\tsimpl.\n\t\trewrite -> IHs.\n\t\treflexivity.\n\t\tQed.\n\nTheorem snoc_with_append : forall X : Type,\n\t\t\t\t\t\t\t\t\t\t\t\t\t forall l1 l2 : list X,\n\t\t\t\t\t\t\t\t\t\t\t\t\t forall v : X,\n\tsnoc (l1 ++ l2) v = l1 ++ (snoc l2 v).\nProof.\n\tintros X l1 l2 v.\n\tinduction l1.\n\t\treflexivity.\n\t\tsimpl.\n\t\trewrite -> IHl1.\n\t\treflexivity.\n\t\tQed.\n\nInductive prod (X Y : Type) : Type :=\n\tpair : X -> Y -> prod X Y.\n\nImplicit Arguments pair [X Y].\n\nNotation \"( x , y )\" := (pair x y).\nNotation \"X * Y\" := (prod X Y) : type_scope.\n\nDefinition fst (X Y : Type) (p : X * Y) : X :=\n\tmatch p with (x,y) => x end.\nDefinition snd (X Y : Type) (p : X * Y) : Y :=\n\tmatch p with (x,y) => y end.\n\nFixpoint combine (X Y : Type) (lx : list X) (ly : list Y)\n\t\t\t: list (X * Y) :=\n\tmatch lx, ly with\n\t\t| [], _ => []\n\t\t| _,[] => []\n\t\t| x::tx, y::ty => (x,y) :: (combine _ _ tx ty)\n\tend.\n\nImplicit Arguments combine [X Y].\n\nFixpoint split {X Y: Type} (s : list (X * Y)) : (list X)*(list Y) :=\n\tmatch s with\n\t\t| nil => (nil, nil)\n\t\t| (x,y) :: tp => match split tp with\n\t\t\t\t\t\t\t\t\t\t\t| (lx, ly) => (x :: lx, y :: ly)\n\t\t\t\t\t\t\t\t\t\t end\n\tend.\n\nInductive option (X : Type) : Type :=\n\t| Some : X -> option X\n\t| None : option X.\n\nImplicit Arguments Some [X].\nImplicit Arguments None [X].\n\nFixpoint index (X : Type) (n : nat)\n\t\t\t\t\t\t\t (l : list X) : option X :=\n\tmatch n with\n\t\t| O => match l with\n\t\t\t\t\t\t\t\t| nil => None\n\t\t\t\t\t\t\t\t| x :: xs => Some x\n\t\t\t\t\t end\n\t\t| S n' => match l with\n\t\t\t\t\t\t\t\t\t| nil => None\n\t\t\t\t\t\t\t\t\t| x :: xs => index X n' xs\n\t\t\t\t\t\t\tend\n\tend.\n\nDefinition hd_opt (X : Type) (l : list X) : option X :=\n\t\tmatch l with\n\t\t\t| nil => None\n\t\t\t| x :: xs => Some x\n\t\tend.\n\nImplicit Arguments hd_opt [X].\n\nExample test_hd_opt1 : hd_opt [S O, S (S O)] = Some (S O).\nProof. reflexivity. Qed.\nExample test_hd_opt2 : hd_opt [[S O], [S (S O)]] = Some [S O].\nProof. reflexivity. Qed.\n\nDefinition plus3 := plus (S (S (S O))).\n\nDefinition prod_curry {X Y Z : Type}\n\t\t(f : X * Y -> Z) (x : X) (y : Y) : Z := f (x,y).\n\nDefinition prod_uncurry {X Y Z : Type}\n\t(f : X -> Y -> Z) (p : X * Y) : Z :=\n\tf (fst X Y p) (snd X Y p).\n\nTheorem uncurry_uncurry : forall (X Y Z : Type) (f : X -> Y -> Z) x y,\n\t\t\t\tprod_curry (prod_uncurry f) x y = f x y.\nProof.\n\treflexivity.\nQed.\n\nTheorem curry_uncurry : forall (X Y Z : Type) (f : (X * Y) -> Z)\n\t(p : X * Y),\n\t\tprod_uncurry (prod_curry f) p = f p.\nProof.\n\tdestruct p.\n\treflexivity.\n\tQed.\n\nFixpoint filter (X : Type) (test : X -> bool) (l:list X)\n\t\t\t\t: (list X) :=\n\t\tmatch l with\n\t\t\t| [] => []\n\t\t | h :: t => if test h then h :: (filter _ test t)\n\t\t\t\t\t\t\t\t\telse filter _ test t\n\t\tend.\n\nDefinition countoddmembers' (l:list nat) : nat :=\n\tlength (filter _ oddb l).\n\nDefinition partition (X : Type) (test : X -> bool) (l : list X)\n\t\t\t\t\t\t\t: list X * list X :=\n\t(filter _ test l, filter _ (fun el => negb (test el)) l).\n\nExample test_partition1: partition _ oddb [S O, S (S O), S (S (S O)), S (S (S (S O))), S (S (S (S (S O))))] = ([S O, S (S (S O)), S (S (S (S (S O))))], [S (S O), S (S (S (S O)))]).\nProof. reflexivity. Qed.\n\nFixpoint map {X Y : Type} (f : X -> Y) (l : list X) : (list Y ) :=\n\t\tmatch l with\n\t\t\t| [] => []\n\t\t\t| h :: t => (f h) :: (map f t)\n\t\tend.\n\nExample test_map1: map (plus (S (S (S O)))) [S (S O), O, S (S O)] = [S (S (S (S (S O)))), S (S (S O)), S (S (S (S (S O))))].\nProof. reflexivity. Qed.\n\n Theorem map_rev_1 : forall (X Y: Type) (f: X -> Y) (l : list X) (x : X),\n \t\tmap f (snoc l x) = snoc (map f l) (f x).\nProof.\n\tintros X Y f l x.\n\tinduction l.\n\treflexivity.\n\tsimpl.\n\trewrite -> IHl.\n\treflexivity.\n\tQed.\n\nTheorem map_rev : forall (X Y : Type) (f : X -> Y) (l : list X),\n\t\t\t\tmap f (rev l) = rev (map f l).\nProof.\n\tintros X Y f l.\n\tinduction l.\n\t\treflexivity.\n\t\tsimpl.\n\t\trewrite <- IHl.\n\t\trewrite -> map_rev_1.\n\t\treflexivity.\n\t\tQed.\n\nFixpoint flat_map {X Y : Type} (f : X -> list Y) (l : list X)\n\t\t\t: (list Y) :=\n\tmatch l with\n\t\t| [] => []\n\t\t| x :: xs => (f x) ++ (flat_map f xs)\n\tend.\n\nDefinition map_option {X Y : Type} (f : X -> Y) (xo : option X)\n\t\t: option Y :=\n\tmatch xo with\n\t\t| None => None\n\t\t| Some x => Some (f x)\n\tend.\n\nFixpoint fold {X Y: Type} (f: X -> Y -> Y) (l:list X) (b:Y) : Y :=\n\tmatch l with\n\t\t| nil => b\n\t\t| h :: t => f h (fold f t b)\n\tend.\n\nExample fold_example : fold andb [true, true, false, true] true = false.\nProof. reflexivity. Qed.\n\nDefinition constfun {X : Type} (x: X) : nat -> X :=\n\tfun (k:nat) => x.\n\nDefinition ftrue := constfun true.\nExample constfun_example : ftrue O = true.\nProof. reflexivity. Qed.\n\nDefinition override {X : Type} (f: nat -> X) (k:nat) (x:X) : nat->X :=\n\tfun (k':nat) => if beq_nat k k' then x else f k'.\n\nDefinition fmostlytrue := override (override ftrue (S O) false) (S (S (S O))) false.\n\nExample override_example1 : fmostlytrue O = true.\nProof. reflexivity. Qed.\nExample override_example2 : fmostlytrue (S O) = false.\nProof. reflexivity. Qed.\nExample override_example3 : fmostlytrue (S (S O)) = true.\nProof. reflexivity. Qed.\nExample override_example4 : fmostlytrue (S (S (S O))) = false.\nProof. reflexivity. Qed.\n\nTheorem override_example : forall (b: bool),\n\t(override (constfun b) (S (S (S O))) true) (S (S O)) = b.\nProof.\n\treflexivity.\nQed.\n\nTheorem unfold_example_bad : forall m n,\n\t(S (S (S O))) + n = m ->\n\tplus3 n = m.\nProof.\n\tintros m n H.\n\tunfold plus3.\n\trewrite -> H.\n\treflexivity.\n\tQed.\n\nTheorem override_eq : forall {X : Type} x k (f : nat -> X),\n\t(override f k x) k = x.\nProof.\n\tintros X x k f.\n\tunfold override.\n\trewrite <- beq_nat_refl.\n\treflexivity.\n\tQed.\n\nTheorem override_neq : forall {X : Type} x1 x2 k1 k2 (f : nat->X),\n\tf k1 = x1 ->\n\t\tbeq_nat k2 k1 = false ->\n\t\t\t(override f k2 x2) k1 = x1.\nProof.\n\tintros X x1 x2 k1 k2 f eq1 eq2.\n\tunfold override.\n\trewrite -> eq2.\n\trewrite -> eq1.\n\treflexivity.\nQed.\n\nTheorem eq_add_S : forall (n m : nat),\n\tS n = S m ->\n\t\tn = m.\nProof.\n\tintros n m eq.\n\tinversion eq.\n\treflexivity.\nQed.\n\nTheorem silly4 : forall (n m : nat),\n\t[n] = [m] ->\n\t\tn = m.\nProof.\n\tintros n o eq.\n\tinversion eq.\n\treflexivity.\nQed.\n\nTheorem silly5 : forall (n m o : nat),\n\t[n,m] = [o,o] ->\n\t\t[n] = [m].\nProof.\n\tintros n m o eq.\n\tinversion eq.\n\treflexivity.\nQed.\n\nTheorem sillyex1 : forall (X : Type) (x y z : X) (l j : list X),\n\tx :: y :: l = z :: j ->\n\t\ty :: l = x :: j ->\n\t\t\tx = y.\nProof.\n\tintros X x y z l j.\n\tintros eq1 eq2.\n\tinversion eq1.\n\tinversion eq2.\n\tsymmetry.\n\trewrite -> H0.\n\treflexivity.\nQed.\n\nTheorem silly6 : forall (n : nat),\n\tS n = O ->\n\t\t(S (S O)) + (S (S O)) = (S (S (S (S (S O))))).\nProof.\n\tintros n contra.\n\tinversion contra.\nQed.\n\nTheorem silly7 : forall (n m : nat),\n\t\t\t\tfalse = true ->\n\t\t\t\t\t[n] = [m].\nProof.\n\tintros n m contra.\n\tinversion contra.\nQed.\n\nTheorem sillyex2 : forall (X : Type) (x y z : X) (l j : list X),\n\tx :: y :: l = [] ->\n\t\ty :: l = z :: j ->\n\t\t\tx = z.\nProof.\n\tintros X x y z l j contra.\n\tinversion contra.\n\tQed.\n\nTheorem beq_nat_eq : forall n m,\n\ttrue = beq_nat n m -> n = m.\nProof.\n\tintros n. induction n as [| n'].\n\tCase \"n = O\".\n\t\tintros m. destruct m as [| m'].\n\t\tSCase \"m = 0\". reflexivity.\n\t\tSCase \"m = S m'\". simpl. intros contra. inversion contra.\n\tCase \"n = S n'\".\n\t\tintros m. destruct m as [| m'].\n\t\tSCase \"m = 0\". simpl. intros contra. inversion contra.\n\t\tSCase \"m = S m'\". simpl. intros H.\n\t\t\tassert(n' = m') as Hl.\n\t\t\t\tSSCase \"Proof of assertion\". apply IHn'. apply H.\n\t\t\trewrite -> Hl. reflexivity.\nQed.\n\nTheorem beq_nat_eq' : forall m n,\n\t\t\t\tbeq_nat n m = true -> n = m.\nProof.\n\tintros m. induction m as [| m'].\n\tCase \"m = O\".\n\t\tdestruct n.\n\t\tSCase \"n = O\".\n\t\t\treflexivity.\n\t\tSCase \"n = S n'\".\n\t\t\tsimpl. intros contra. inversion contra.\n\tCase \"m = S m'\".\n\t\tsimpl.\n\t\tdestruct n.\n\t\tSCase \"n = O\".\n\t\t\tsimpl. intros contra. inversion contra.\n\t\tSCase \"n = S n'\".\n\t\t\tsimpl. intros H.\n\t\t\tassert (n = m') as Hl.\n\t\t\t\tapply IHm'.\n\t\t\t\tapply H.\n\t\t\trewrite -> Hl.\n\t\t\treflexivity.\nQed.\n\nTheorem length_snoc' : forall (X : Type) (v : X)\n(l : list X) (n : nat),\n\tlength l = n ->\n\tlength (snoc l v) = S n.\n\tProof.\n\tintros X v l. induction l as [| v' l'].\n\tCase \"l = []\". intros n eq. rewrite <- eq. reflexivity.\n\tCase \"l = v' :: l'\". intros n eq. simpl. destruct n as [| n'].\n\tSCase \"n = 0\". inversion eq.\n\tSCase \"n = S n'\".\n\tassert (length (snoc l' v) = S n').\n\tSSCase \"Proof of assertion\". apply IHl'.\n\tinversion eq. reflexivity.\n\trewrite -> H. reflexivity.\n\tQed.\n\n\tTheorem beq_nat_O_l : forall n,\n\ttrue = beq_nat O n -> O = n.\n\tProof.\n\tintros n. destruct n.\n\treflexivity.\n\tsimpl.\n\tintros contra.\n\tinversion contra.\n\tQed.\n\nTheorem beq_nat_O_r : forall n,\n\ttrue = beq_nat n O -> O = n.\nProof.\n\tintros n.\n\tinduction n.\n\tCase \"n = O\".\n\t\treflexivity.\n\tCase \"n = S n'\".\n\t\tsimpl.\n\t\tintros contra.\n\t\tinversion contra.\n\tQed.\n\nTheorem double_injective : forall n m,\n\tdouble n = double m ->\n\t\tn = m.\nProof.\n\tintros n. induction n as [| n'].\n\tCase \"n = O\".\n\t\tsimpl. intros m eq.\n\t\tdestruct m as [|m'].\n\t\tSCase \"m = O\". reflexivity.\n\t\tSCase \"m = S m'\". inversion eq.\n\tCase \"n = S n'\". intros m eq. destruct m as [| m'].\n\t\tSCase \"m = O\". inversion eq.\n\t\tSCase \"m = S m'\".\n\t\t\tassert(n' = m') as H.\n\t\t\t\tSSCase \"Proof of assertion\". apply IHn'. inversion eq. reflexivity.\n\t\t\trewrite -> H. reflexivity.\nQed.\n\nTheorem silly3' : forall (n : nat),\n\t(beq_nat n (S (S (S (S (S O))))) = true ->\n\t \tbeq_nat (S (S n)) (S (S (S (S (S (S (S O))))))) = true) ->\n\t\ttrue = beq_nat n (S (S (S (S (S O))))) ->\n\t\t\ttrue = beq_nat (S (S n)) (S (S (S (S (S (S (S O))))))).\nProof.\n\tintros n eq H.\n\tsymmetry in H.\n\tapply eq in H.\n\tsymmetry in H.\n\tapply H.\nQed.\n\nTheorem plus_n_n_injective : forall n m,\n\t\t\t\t\tn + n = m + m ->\n\t\t\t\t\t\tn = m.\nProof.\n\tintros n. induction n as [| n'].\n\tCase \"n = O\".\n\t\tsimpl. intros m.\n\t\tdestruct m.\n\t\t\tSCase \"m = O\".\n\t\t\treflexivity.\n\t\t\tSCase \"m = S m'\".\n\t\t\tsimpl.\n\t\t\tintros contra.\n\t\t\tinversion contra.\n\tCase \"n = S n\".\n\t\tintros m.\n\t\tdestruct m.\n\t\t\tSCase \"m = O\".\n\t\t\tintros contra.\n\t\t\tinversion contra.\n\t\t\tSCase \"m = S m'\".\n\t\t\tintros eq.\n\t\t\tinversion eq.\n\t\t\trewrite <- plus_n_Sm in H0.\n\t\t\trewrite <- plus_n_Sm in H0.\n\t\t\tinversion H0.\n\t\t\tapply IHn' in H1.\n\t\t\trewrite -> H1.\n\t\t\treflexivity.\n\tQed.\n\nTheorem override_shadow : forall {X : Type} x1 x2 k1 k2 (f : nat -> X),\n\t(override (override f k1 x2) k1 x1) k2 = (override f k1 x1) k2.\nProof.\n\tintros X x1 x2 k1 k2 f.\n\tunfold override.\n\tdestruct (beq_nat k1 k2).\n\treflexivity.\n\treflexivity.\n\tQed.\n\nTheorem combine_split : forall (X : Type) (Y : Type) (l : list (X * Y)) (l1: list X) (l2: list Y),\n\t\t\t\tsplit l = (l1, l2) -> combine l1 l2 = l.\nProof.\n\tintros X Y l.\n\tinduction l as [| x y].\n\tCase \"l = nil\".\n\t\tintros l1 l2.\n\t\tintros eq.\n\t\tsimpl.\n\t\tsimpl in eq.\n\t\tinversion eq.\n\t\treflexivity.\n\tCase \"l = ::\".\n\t\tintros l1 l2.\n\t\tsimpl.\n\t\tdestruct x.\n\t\tdestruct (split y).\n\t\tsimpl.\n\t\tdestruct l1.\n\t\tSCase \"l1 = []\".\n\t\t\tsimpl.\n\t\t\tinduction l2.\n\t\t\tSSCase \"l2 = []\".\n\t\t\t\tintros contra.\n\t\t\t\tinversion contra.\n\t\t\tSSCase \"l2 = ::\".\n\t\t\t\tintros contra.\n\t\t\t\tinversion contra.\n\t\tSCase \"l1 = ::\".\n\t\t\tinduction l2.\n\t\t\tSSCase \"l2 = []\".\n\t\t\t\tsimpl.\n\t\t\t\tintros contra.\n\t\t\t\tinversion contra.\n\t\t\tSSCase \"l2 = ::\".\n\t\t\t\tsimpl.\n\t\t\t\tintros eq.\n\t\t\t\tinversion eq.\n\t\t\t\tsimpl.\n\t\t\t\trewrite IHy.\n\t\t\t\treflexivity.\n\t\t\t\tsimpl.\n\t\t\t\trewrite H1.\n\t\t\t\trewrite H3.\n\t\t\t\treflexivity.\nQed.\n\nTheorem split_combine : forall (X : Type) (Y : Type) (l1: list X) (l2: list Y),\n\t\t\t\tlength l1 = length l2 -> split (combine l1 l2) = (l1, l2).\nProof.\nintros X Y.\nintros l1.\ninduction l1.\nsimpl.\nintros l2.\ninduction l2.\nreflexivity.\n\nintros contra.\ninversion contra.\n\ndestruct l2.\nsimpl.\nintros contra.\ninversion contra.\n\nsimpl.\nintros eq.\ninversion eq.\napply IHl1 in H0.\nrewrite H0.\nreflexivity.\nQed.\n\nDefinition sillyfun1 (n : nat) : bool :=\n\t if beq_nat n (S (S (S O))) then true\n\t else if beq_nat n (S (S (S (S (S O))))) then true\n\t\t\t\telse false.\n\nTheorem beq_equal : forall (a b : nat),\n\t\tbeq_nat a b = true ->\n\t\t\ta = b.\nProof.\nintros a.\ninduction a.\ndestruct b.\nreflexivity.\n\nintros contra.\ninversion contra.\n\ndestruct b.\nintros contra.\ninversion contra.\n\nsimpl.\nintros eq.\napply IHa in eq.\nrewrite eq.\nreflexivity.\nQed.\n\nTheorem override_same : forall {X : Type} x1 k1 k2 (f : nat->X),\n\tf k1 = x1 ->\n\t\t(override f k1 x1) k2 = f k2.\nProof.\n\tintros X x1 k1 k2 f eq.\n\tunfold override.\n\tremember (beq_nat k1 k2) as a.\n\tdestruct a.\n\trewrite <- eq.\n\tsymmetry in Heqa.\n\tapply beq_equal in Heqa.\n\trewrite -> Heqa.\n\treflexivity.\n\treflexivity.\n\tQed.\n\n\nTheorem filter_exercise : forall (X : Type) (test : X -> bool)\n\t(x : X) (l lf : list X),\n\tfilter _ test l = x :: lf ->\n\t\ttest x = true.\nProof.\nintros X.\nintros test.\nintros x.\ninduction l.\nsimpl.\nintros lf.\nintros contra.\ninversion contra.\n\nsimpl.\nremember (test x0) as a.\ndestruct a.\nsimpl.\nintros lf.\nintros eq.\nrewrite Heqa.\ninversion eq.\nreflexivity.\n\nintros lf.\nintros eq.\napply IHl in eq.\nrewrite eq.\nreflexivity.\nQed.\n\nTheorem trans_eq : forall {X:Type} (n m o : X),\n\t\t\t\tn = m -> m = o -> n = o.\nProof.\n\tintros X n m o eq1 eq2. rewrite -> eq1. rewrite -> eq2.\n\treflexivity.\nQed.\n\nExample trans_eq_example' : forall (a b c d e f : nat),\n\t\t\t\t[a,b] = [c,d] ->\n\t\t\t\t[c,d] = [e,f] ->\n\t\t\t\t[a,b] = [e,f].\nProof.\n\tintros a b c d e f eq1 eq2.\n\tapply trans_eq with (m := [c,d]). apply eq1. apply eq2.\n\tQed.\n\nTheorem trans_eq_exercise : forall (n m o p : nat),\n\t\tm = (minustwo o) ->\n\t\t(n + p) = m ->\n\t\t(n + p) = (minustwo o).\nProof.\nintros n m o p.\nintros eq1 eq2.\nrewrite eq2.\nrewrite <- eq1.\nreflexivity.\nQed.\n\nTheorem beq_nat_trans : forall n m p,\n\t\t\t\ttrue = beq_nat n m ->\n\t\t\t\ttrue = beq_nat m p ->\n\t\t\t\ttrue = beq_nat n p.\nProof.\nintros n m p.\nintros eq1 eq2.\nsymmetry in eq1.\nsymmetry in eq2.\napply beq_equal in eq1.\napply beq_equal in eq2.\nrewrite eq1.\nrewrite <- eq2.\napply beq_nat_refl.\nQed.\n\nTheorem override_permute : forall {X:Type} x1 x2 k1 k2 k3 (f : nat->X),\n\tfalse = beq_nat k2 k1 ->\n\t(override (override f k2 x2) k1 x1) k3 = (override (override f k1 x1) k2 x2) k3.\nProof.\nintros X x1 x2 k1 k2 k3 f.\nsimpl.\nunfold override.\nremember (beq_nat k1 k3).\nremember (beq_nat k2 k3).\ndestruct b.\ndestruct b0.\nsymmetry in Heqb.\nsymmetry in Heqb0.\napply beq_equal in Heqb.\napply beq_equal in Heqb0.\nrewrite <- Heqb in Heqb0.\nassert (k2 = k1 -> true = beq_nat k2 k1).\ndestruct k2.\ndestruct k1.\nreflexivity.\n\nintros contra.\ninversion contra.\n\ndestruct k1.\nintros contra.\ninversion contra.\n\nsimpl.\nintros eq.\ninversion eq.\nsymmetry .\nsymmetry .\napply beq_nat_refl.\n\napply H in Heqb0.\nrewrite <- Heqb0.\nintros contra.\ninversion contra.\n\nintros eq.\nreflexivity.\n\ndestruct b0.\nintros eq.\nreflexivity.\n\nintros eq.\nreflexivity.\n\nQed.\n\nDefinition fold_length {X : Type} (l : list X) : nat :=\n\tfold (fun _ n => S n) l O.\n\nExample test_fold_length1 : fold_length [S (S (S (S O))), S (S (S (S (S (S (S O)))))), O] = S (S (S O)).\nProof. reflexivity. Qed.\n\nTheorem fold_length_correct : forall X (l :list X),\n\tfold_length l = length l.\nProof.\n\tintros X l.\n\tunfold fold_length.\n\tinduction l.\n\tCase \"l = O\".\n\t\treflexivity.\n\tCase \"l = ::\".\n\t\tsimpl.\n\t\trewrite IHl.\n\t\treflexivity.\n\tQed.\n\nDefinition fold_map {X Y: Type} (f : X -> Y) (l : list X) : list Y :=\n\tfold (fun x total => (f x) :: total) l [].\n\nTheorem fold_map_correct : forall (X Y: Type) (f : X -> Y) (l : list X),\n\tfold_map f l = map f l.\nProof.\n\tintros X Y f l.\n\tunfold fold_map.\n\tinduction l.\n\treflexivity.\n\t \n\tsimpl.\n\trewrite IHl.\n\treflexivity.\n\tQed.\n\nFixpoint forallb {X : Type} (f : X -> bool) (l : list X) :=\n\tmatch l with\n\t\t| nil => true\n\t\t| x :: xs => andb (f x) (forallb f xs)\n\tend.\n\nFixpoint existsb {X : Type} (f : X -> bool) (l : list X) :=\n\tmatch l with\n\t\t| nil => false\n\t\t| x :: xs => orb (f x) (existsb f xs)\n\tend.\n\nDefinition existsb2 {X : Type} (f: X -> bool) (l : list X) :=\n\tnegb (forallb (fun x => negb (f x)) l).\n\nTheorem existsb_correct : forall (X : Type) (f : X -> bool) (l : list X),\n\t\texistsb f l = existsb2 f l.\nProof.\nintros X f l.\ninduction l.\nreflexivity.\n\nsimpl.\nrewrite IHl.\nunfold existsb2.\nsimpl.\ndestruct (forallb (fun x0 : X => negb (f x0)) l).\nsimpl.\ndestruct (f x).\nreflexivity.\n\nreflexivity.\n\ndestruct (f x).\nreflexivity.\n\nreflexivity.\n\nQed.\n\nTheorem index_okx : forall (X:Type) (l : list X) (n : nat),\n\t\tlength l = n -> index X (S n) l = None.\nProof.\n\tintros X l.\n\tinduction l.\n\treflexivity.\n\n\tintros n.\n\tdestruct n.\n\tintros contra.\n\tinversion contra.\n\n\tintros eq.\n\tinversion eq.\n\tapply IHl.\n\treflexivity.\nQed.\n\nInductive mumble : Type :=\n | a : mumble\n\t| b : mumble -> nat -> mumble\n\t| c : mumble.\nInductive grumble (X:Type) : Type :=\n | d : mumble -> grumble X\n | e : X -> grumble X.\n\n" }, { "path": "src/test/resources/samples/langs/Coq/Rel.v", "content": "Require Export Logic.\nImport Playground1.\n\nDefinition relation (X:Type) := X -> X -> Prop.\n\nDefinition partial_function {X:Type} (R: relation X) :=\n\tforall x y1 y2 : X, R x y1 -> R x y2 -> y1 = y2.\n\nTheorem next_nat_partial_function :\n\tpartial_function next_nat.\nProof.\n\tunfold partial_function.\n\tintros x y1 y2 P Q.\n\tinversion P.\n\tinversion Q.\n\treflexivity.\nQed.\n\nTheorem le_not_a_partial_function :\n\t~ (partial_function le).\nProof.\n\tunfold not.\n\tunfold partial_function.\n\tintros H.\n\tassert (O = S O) as Nonsense.\n\t\tCase \"Proof of assertion.\".\n\t\tapply H with O.\n\t\tapply le_n.\n\n\t\tapply le_S.\n\t\tapply le_n.\n\n\tinversion Nonsense.\nQed.\n\nTheorem total_relation_not_partial_function :\n\t~ (partial_function total_relation).\nProof.\n\tunfold not.\n\tunfold partial_function.\n\tintros H.\n\tassert (O = S O) as Nonsense.\n\tapply H with O.\n\tapply total_relation1.\n\n\tapply total_relation1.\n\n\tinversion Nonsense.\nQed.\n\nTheorem empty_relation_not_partial_funcion :\n\tpartial_function empty_relation.\nProof.\n\tunfold partial_function.\n\tintros x y1 y2.\n\tintros H.\n\tinversion H.\nQed.\n\nDefinition reflexive {X:Type} (R: relation X) :=\n\tforall a : X, R a a.\n\nTheorem le_reflexive :\n\treflexive le.\nProof.\n\tunfold reflexive.\n\tintros n. apply le_n.\nQed.\n\nDefinition transitive {X:Type} (R: relation X) :=\n\tforall a b c : X, (R a b) -> (R b c) -> (R a c).\n\nTheorem le_trans:\n\ttransitive le.\nProof.\n\tintros n m o Hnm Hmo.\n\tinduction Hmo.\n\tCase \"le_n\". apply Hnm.\n\tCase \"le_S\". apply le_S. apply IHHmo.\nQed.\n\nTheorem lt_trans:\n\ttransitive lt.\nProof.\n\tunfold lt. unfold transitive.\n\tintros n m o Hnm Hmo.\n\tapply le_S in Hnm.\n\tapply le_trans with (a := (S n)) (b := (S m)) (c := o).\n\tapply Hnm.\n\tapply Hmo.\nQed.\n\nTheorem lt_trans' :\n\ttransitive lt.\nProof.\n\tunfold lt. unfold transitive.\n\tintros n m o Hnm Hmo.\n\tinduction Hmo as [| m' Hm'o].\n\tapply le_S.\n\tapply Hnm.\n\n\tapply le_S.\n\tapply IHHm'o.\nQed.\n\nTheorem le_Sn_le: forall n m, S n <= m -> n <= m.\nProof.\n\tintros n m H. apply le_trans with (S n).\n\tapply le_S. apply le_n.\n\tapply H. Qed.\n\nTheorem le_S_n : forall n m,\n\t(S n <= S m) -> (n <= m).\nProof.\nintros n m H.\napply Sn_le_Sm__n_le_m.\napply H.\nQed.\n\nTheorem le_Sn_n : forall n,\n\t~ (S n <= n).\nProof.\ninduction n.\nintros H.\ninversion H.\n\nunfold not in IHn.\nintros H.\napply le_S_n in H.\napply IHn.\napply H.\nQed.\n\n(*\n TODO\nTheorem lt_trans'' :\n\ttransitive lt.\nProof.\n\tunfold lt. unfold transitive.\n\tintros n m o Hnm Hmo.\n\tinduction o as [| o'].\n\t*)\n\nDefinition symmetric {X: Type} (R: relation X) :=\n\tforall a b : X, (R a b) -> (R b a).\n\nDefinition antisymmetric {X : Type} (R: relation X) :=\n\tforall a b : X, (R a b) -> (R b a) -> a = b.\n\nTheorem le_antisymmetric :\n\tantisymmetric le.\nProof.\nintros a b.\ngeneralize dependent a.\ninduction b.\nintros a.\nintros H.\nintros H1.\ninversion H.\nreflexivity.\n\nintros a H1 H2.\ndestruct a.\ninversion H2.\n\napply Sn_le_Sm__n_le_m in H1.\napply Sn_le_Sm__n_le_m in H2.\napply IHb in H1.\nrewrite H1 in |- *.\nreflexivity.\n\napply H2.\nQed.\n\n(*\n TODO\nTheorem le_step : forall n m p,\n\tn < m ->\n\tn <= S p ->\n\tn <= p.\nProof.\n*)\n\nDefinition equivalence {X:Type} (R: relation X) :=\n\t(reflexive R) /\\ (symmetric R) /\\ (transitive R).\n\nDefinition order {X:Type} (R: relation X) :=\n\t(reflexive R) /\\ (antisymmetric R) /\\ (transitive R).\n\nDefinition preorder {X:Type} (R: relation X) :=\n\t(reflexive R) /\\ (transitive R).\n\nTheorem le_order :\n\torder le.\nProof.\n\tunfold order. split.\n\tCase \"refl\". apply le_reflexive.\n\tsplit.\n\t\tCase \"antisym\". apply le_antisymmetric.\n\t\tCase \"transitive\". apply le_trans. Qed.\n\nInductive clos_refl_trans {A:Type} (R: relation A) : relation A :=\n\t| rt_step : forall x y, R x y -> clos_refl_trans R x y\n\t| rt_refl : forall x, clos_refl_trans R x x\n\t| rt_trans : forall x y z,\n\t\tclos_refl_trans R x y -> clos_refl_trans R y z -> clos_refl_trans R x z.\n\nTheorem next_nat_closure_is_le : forall n m,\n\t(n <= m) <-> ((clos_refl_trans next_nat) n m).\nProof.\nintros n m.\nsplit.\nintro H.\ninduction H.\napply rt_refl.\n\napply rt_trans with m.\napply IHle.\n\napply rt_step.\napply nn.\n\nintro H.\ninduction H.\ninversion H.\napply le_S.\napply le_n.\n\napply le_n.\n\napply le_trans with y.\napply IHclos_refl_trans1.\n\napply IHclos_refl_trans2.\nQed.\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t \n\nInductive refl_step_closure {X : Type} (R: relation X)\n\t\t\t\t\t\t\t\t\t\t\t: X -> X -> Prop :=\n\t| rsc_refl : forall (x : X), refl_step_closure R x x\n\t| rsc_step : forall (x y z : X), R x y ->\n\t\t\t\t\t\t\t\trefl_step_closure R y z ->\n\t\t\t\t\t\t\t\trefl_step_closure R x z.\n\nTactic Notation \"rt_cases\" tactic(first) ident(c) :=\n\tfirst;\n\t[ Case_aux c \"rt_step\" | Case_aux c \"rt_refl\" | Case_aux c \"rt_trans\" ].\n\nTactic Notation \"rsc_cases\" tactic(first) ident(c) :=\n\t first;\n\t\t [ Case_aux c \"rsc_refl\" | Case_aux c \"rsc_step\" ].\n\nTheorem rsc_R : forall (X:Type) (R:relation X) (x y:X),\n\t\t\t\tR x y -> refl_step_closure R x y.\nProof.\nintros X R x y r.\napply rsc_step with y.\n apply r.\n \n apply rsc_refl.\nQed.\n\nTheorem rsc_trans :\n\tforall (X : Type) (R : relation X) (x y z : X),\n\t\trefl_step_closure R x y ->\n\t\t\trefl_step_closure R y z ->\n\t\t\t\trefl_step_closure R x z.\nProof.\nintros X.\nintros R x y z.\nintros H.\ninduction H.\nintros H1.\napply H1.\n\nintros H1.\napply IHrefl_step_closure in H1.\napply rsc_step with y.\napply H.\n\napply H1.\nQed.\n\nTheorem rtc_rsc_coincide:\n\tforall (X:Type) (R: relation X) (x y : X),\n\t\tclos_refl_trans R x y <-> refl_step_closure R x y.\nProof.\nintros X R x y.\nsplit.\nintros H.\ninduction H.\napply rsc_step with y.\napply H.\n\napply rsc_refl.\n\napply rsc_refl.\n\napply rsc_trans with y.\napply IHclos_refl_trans1.\n\napply IHclos_refl_trans2.\n\nintros H1.\ninduction H1.\napply rt_refl.\n\napply rt_trans with y.\napply rt_step.\napply H.\n\napply IHrefl_step_closure.\nQed.\n" }, { "path": "src/test/resources/samples/langs/Coq/Smallstep.v", "content": "Require Export Imp.\nRequire Export Relations.\n\nInductive tm : Type :=\n | tm_const : nat -> tm\n | tm_plus : tm -> tm -> tm.\n\nTactic Notation \"tm_cases\" tactic(first) ident(c) :=\n first;\n [ Case_aux c \"tm_const\" | Case_aux c \"tm_plus\" ].\n\nModule SimpleArith0.\n\nFixpoint eval (t : tm) : nat :=\n match t with\n | tm_const n => n\n | tm_plus a1 a2 => eval a1 + eval a2\n end.\n\nEnd SimpleArith0.\n\nModule SimpleArith1.\n\nReserved Notation \" t '===>' n \" (at level 50, left associativity).\n\nInductive eval : tm -> nat -> Prop :=\n | E_Const : forall n,\n tm_const n ===> n\n | E_Plus : forall t1 t2 n1 n2,\n t1 ===> n1 ->\n t2 ===> n2 ->\n tm_plus t1 t2 ===> plus n1 n2\n\n where \" t '===>' n \" := (eval t n).\n\nEnd SimpleArith1.\n\nReserved Notation \" t '===>' t' \" (at level 50, left associativity).\n\nInductive eval : tm -> tm -> Prop :=\n | E_Const : forall n1,\n tm_const n1 ===> tm_const n1\n | E_Plus : forall t1 n1 t2 n2,\n t1 ===> tm_const n1 ->\n t2 ===> tm_const n2 ->\n tm_plus t1 t2 ===> tm_const (plus n1 n2)\n where \" t '===>' t' \" := (eval t t').\n\nTactic Notation \"eval_cases\" tactic(first) ident(c) :=\n first;\n [ Case_aux c \"E_Const\" | Case_aux c \"E_Plus\" ].\n\nModule SimpleArith2.\n\nReserved Notation \" t '=>' t' \" (at level 40).\n\nInductive step : tm -> tm -> Prop :=\n | ST_PlusConstConst : forall n1 n2,\n tm_plus (tm_const n1) (tm_const n2) => tm_const (plus n1 n2)\n | ST_Plus1 : forall t1 t1' t2,\n t1 => t1' ->\n tm_plus t1 t2 => tm_plus t1' t2\n | ST_Plus2 : forall n1 t2 t2',\n t2 => t2' ->\n tm_plus (tm_const n1) t2 => tm_plus (tm_const n1) t2'\n\n where \" t '=>' t' \" := (step t t').\n\nTactic Notation \"step_cases\" tactic(first) ident(c) :=\n first;\n [ Case_aux c \"ST_PlusConstConst\"\n | Case_aux c \"ST_Plus1\" | Case_aux c \"ST_Plus2\" ].\n\nExample test_step_1 : \n tm_plus \n (tm_plus (tm_const 0) (tm_const 3))\n (tm_plus (tm_const 2) (tm_const 4))\n =>\n tm_plus \n (tm_const (plus 0 3))\n (tm_plus (tm_const 2) (tm_const 4)).\nProof.\n apply ST_Plus1. apply ST_PlusConstConst. Qed.\n\nExample test_step_2 : \n tm_plus \n (tm_const 0)\n (tm_plus \n (tm_const 2) \n (tm_plus (tm_const 0) (tm_const 3)))\n =>\n tm_plus \n (tm_const 0)\n (tm_plus \n (tm_const 2) \n (tm_const (plus 0 3))).\nProof.\napply ST_Plus2.\nsimpl.\napply ST_Plus2.\napply ST_PlusConstConst.\nQed.\n\nTheorem step_deterministic:\n partial_function step.\nProof.\n unfold partial_function. intros x y1 y2 Hy1 Hy2.\n generalize dependent y2.\n step_cases (induction Hy1) Case; intros y2 Hy2.\n Case \"ST_PlusConstConst\". step_cases (inversion Hy2) SCase.\n SCase \"ST_PlusConstConst\". reflexivity.\n SCase \"ST_Plus1\". inversion H2.\n SCase \"ST_Plus2\". inversion H2.\n Case \"ST_Plus1\". step_cases (inversion Hy2) SCase.\n SCase \"ST_PlusConstConst\". rewrite <- H0 in Hy1. inversion Hy1.\n SCase \"ST_Plus1\".\n rewrite <- (IHHy1 t1'0).\n reflexivity. assumption.\n SCase \"ST_Plus2\". rewrite <- H in Hy1. inversion Hy1.\n Case \"ST_Plus2\". step_cases (inversion Hy2) SCase.\n SCase \"ST_PlusConstConst\". rewrite <- H1 in Hy1. inversion Hy1.\n SCase \"ST_Plus1\". inversion H2.\n SCase \"ST_Plus2\".\n rewrite <- (IHHy1 t2'0).\n reflexivity. assumption. Qed.\n\nEnd SimpleArith2.\n\nInductive value : tm -> Prop :=\n v_const: forall n, value (tm_const n).\n\nReserved Notation \" t '=>' t' \" (at level 40).\n\nInductive step : tm -> tm -> Prop :=\n | ST_PlusConstConst : forall n1 n2,\n tm_plus (tm_const n1) (tm_const n2)\n => tm_const (plus n1 n2)\n | ST_Plus1 : forall t1 t1' t2,\n t1 => t1' ->\n tm_plus t1 t2 => tm_plus t1' t2\n | ST_Plus2 : forall v1 t2 t2',\n value v1 ->\n t2 => t2' ->\n tm_plus v1 t2 => tm_plus v1 t2'\n\n where \" t '=>' t' \" := (step t t').\n\nTactic Notation \"step_cases\" tactic(first) ident(c) :=\n first;\n [ Case_aux c \"ST_PlusConstConst\"\n | Case_aux c \"ST_Plus1\" | Case_aux c \"ST_Plus2\" ].\n\nTheorem step_deterministic :\n partial_function step.\nProof.\nunfold partial_function.\nintros x y1 y2 Hy1 Hy2.\ngeneralize dependent y2.\nstep_cases (induction Hy1) Case; intros y2 Hy2.\n step_cases (inversion Hy2) SCase.\n reflexivity.\n \n inversion H2.\n \n inversion Hy2.\n subst.\n assumption.\n \n subst.\n inversion H3.\n \n subst.\n inversion H3.\n \n step_cases (inversion Hy2) SCase.\n rewrite <- H0 in Hy1.\n inversion Hy1.\n \n rewrite <- (IHHy1 t1'0).\n reflexivity.\n \n assumption.\n \n rewrite <- H in Hy1.\n rewrite <- H in H1.\n subst.\n inversion H1.\n subst.\n inversion Hy1.\n \n step_cases (inversion Hy2) SCase.\n subst.\n inversion Hy1.\n \n subst.\n inversion H.\n subst.\n inversion H3.\n \n subst.\n inversion H2.\n subst.\n rewrite <- (IHHy1 t2'0).\n reflexivity.\n \n assumption.\nQed.\n\nTheorem strong_progress : forall t,\n value t \\/ (exists t', t => t').\nProof.\n tm_cases (induction t) Case.\n Case \"tm_const\". left. apply v_const.\n Case \"tm_plus\". right. inversion IHt1.\n SCase \"l\". inversion IHt2.\n SSCase \"l\". inversion H. inversion H0.\n exists (tm_const (plus n n0)).\n apply ST_PlusConstConst.\n SSCase \"r\". inversion H0 as [t' H1].\n exists (tm_plus t1 t').\n apply ST_Plus2. apply H. apply H1.\n SCase \"r\". inversion H as [t' H0].\n exists (tm_plus t' t2).\n apply ST_Plus1. apply H0. Qed.\n\nDefinition normal_form {X:Type} (R: relation X) (t: X) : Prop :=\n ~ (exists t', R t t'). \n\nLemma value_is_nf: forall t,\n value t -> normal_form step t.\nProof.\n unfold normal_form. intros t H. inversion H.\n intros contra. inversion contra. inversion H1.\n Qed.\n\nLemma nf_is_value: forall t,\n normal_form step t -> value t.\nProof.\n unfold normal_form. intros t H.\n assert (G: value t \\/ (exists t', t => t')).\n SCase \"Proof of assertion\". apply strong_progress.\n inversion G.\n SCase \"l\". assumption.\n SCase \"r\". apply ex_falso_quodlibet. apply H. assumption. Qed.\n\nCorollary nf_same_as_value : forall t,\n normal_form step t <-> value t.\nProof.\n split. apply nf_is_value. apply value_is_nf.\nQed.\n\nModule Temp1.\n\nInductive value : tm -> Prop :=\n| v_const : forall n, value (tm_const n)\n| v_funny : forall t1 n2, (* <---- *)\n value (tm_plus t1 (tm_const n2)).\n\nReserved Notation \" t '=>' t' \" (at level 40).\n\nInductive step : tm -> tm -> Prop :=\n | ST_PlusConstConst : forall n1 n2,\n tm_plus (tm_const n1) (tm_const n2) => tm_const (plus n1 n2)\n | ST_Plus1 : forall t1 t1' t2,\n t1 => t1' ->\n tm_plus t1 t2 => tm_plus t1' t2\n | ST_Plus2 : forall v1 t2 t2',\n value v1 ->\n t2 => t2' ->\n tm_plus v1 t2 => tm_plus v1 t2'\n\n where \" t '=>' t' \" := (step t t').\n\nLemma value_not_same_as_normal_form:\n exists t, value t /\\ ~ normal_form step t.\nProof.\nintros.\nunfold normal_form.\nexists (tm_plus (tm_plus (tm_const 1) (tm_const 2)) (tm_const 2)).\nsplit.\n apply v_funny.\n \n unfold not.\n intros.\n apply H.\n exists (tm_plus (tm_const (1 + 2)) (tm_const 2)).\n apply ST_Plus1.\n apply ST_PlusConstConst.\nQed.\n\nEnd Temp1.\n\nModule Temp2.\n\nInductive value : tm -> Prop :=\n | v_const : forall n, value (tm_const n).\n\n(*Reserved Notation \" t '===>' t' \" (at level 40).*)\n\nInductive step : tm -> tm -> Prop :=\n | ST_Funny : forall n, (* <---- *)\n tm_const n ===> tm_plus (tm_const n) (tm_const 0)\n | ST_PlusConstConst : forall n1 n2,\n tm_plus (tm_const n1) (tm_const n2) ===> tm_const (plus n1 n2)\n | ST_Plus1 : forall t1 t1' t2,\n t1 ===> t1' ->\n tm_plus t1 t2 ===> tm_plus t1' t2\n | ST_Plus2 : forall v1 t2 t2',\n value v1 ->\n t2 ===> t2' ->\n tm_plus v1 t2 ===> tm_plus v1 t2'\n\n where \" t '===>' t' \" := (step t t').\n\nLemma value_not_same_as_normal_form :\n exists t, value t /\\ ~ normal_form step t.\nProof.\nexists (tm_const 0).\nsplit.\n apply v_const.\n \n unfold normal_form.\n unfold not.\n intro H.\n apply H.\n exists (tm_plus (tm_const 0) (tm_const 0)).\n apply ST_Funny.\nQed.\n\nEnd Temp2.\n\nModule Temp3.\n\nInductive value : tm -> Prop :=\n | v_const : forall n, value (tm_const n).\n\n(*Reserved Notation \" t '===>' t' \" (at level 40).*)\n\nInductive step : tm -> tm -> Prop :=\n | ST_PlusConstConst : forall n1 n2,\n tm_plus (tm_const n1) (tm_const n2) ===> tm_const (plus n1 n2)\n | ST_Plus1 : forall t1 t1' t2,\n t1 ===> t1' ->\n tm_plus t1 t2 ===> tm_plus t1' t2\n\n where \" t '===>' t' \" := (step t t').\n\nLemma value_not_same_as_normal_form:\n exists t, ~ value t /\\ normal_form step t.\nProof.\nexists (tm_plus (tm_const 1) (tm_plus (tm_const 0) (tm_const 0))).\nsplit.\n intros H.\n inversion H.\n \n unfold normal_form.\n intros H.\n inversion H.\n inversion H0.\n inversion H4.\nQed.\n\nEnd Temp3.\n\nModule Temp4.\nInductive tm : Type :=\n | tm_true : tm\n | tm_false : tm\n | tm_if : tm -> tm -> tm -> tm.\n\nInductive value : tm -> Prop :=\n | v_true : value tm_true\n | v_false : value tm_false.\n\nInductive step : tm -> tm -> Prop :=\n | ST_IfTrue : forall t1 t2,\n tm_if tm_true t1 t2 ===> t1\n | ST_IfFalse : forall t1 t2,\n tm_if tm_false t1 t2 ===> t2\n | ST_If : forall t1 t1' t2 t3,\n t1 ===> t1' ->\n tm_if t1 t2 t3 ===> tm_if t1' t2 t3\n\n where \" t '===>' t' \" := (step t t').\n\nExample bool_step_prop3 :\n tm_if\n (tm_if tm_true tm_true tm_true)\n (tm_if tm_true tm_true tm_true)\n tm_false\n ===>\n tm_if\n tm_true\n (tm_if tm_true tm_true tm_true)\n tm_false.\nProof.\napply ST_If.\napply ST_IfTrue.\nQed.\n\nTheorem strong_progress: forall t,\n value t \\/ (exists t', t ===> t').\nProof.\ninduction t.\n left.\n constructor.\n \n left.\n constructor.\n \n right.\n inversion IHt1.\n inversion H.\n exists t2.\n apply ST_IfTrue.\n \n exists t3.\n apply ST_IfFalse.\n \n inversion H.\n exists (tm_if x t2 t3).\n apply ST_If.\n assumption.\nQed.\n\nTheorem step_deterministic :\n partial_function step.\nProof.\nunfold partial_function.\nintros x y1 y2 Hy1 Hy2.\ngeneralize dependent y2.\ninduction Hy1.\n intros.\n inversion Hy2.\n reflexivity.\n \n subst.\n inversion H3.\n \n intros.\n inversion Hy2.\n reflexivity.\n \n inversion H3.\n \n intros.\n inversion Hy2.\n subst.\n inversion Hy1.\n \n subst.\n inversion Hy1.\n \n subst.\n apply IHHy1 in H3.\n subst.\n reflexivity.\nQed.\n\nModule Temp5.\n\n\nInductive step : tm -> tm -> Prop :=\n | ST_IfTrue : forall t1 t2,\n tm_if tm_true t1 t2 ===> t1\n | ST_IfFalse : forall t1 t2,\n tm_if tm_false t1 t2 ===> t2\n | ST_If : forall t1 t1' t2 t3,\n t1 ===> t1' ->\n tm_if t1 t2 t3 ===> tm_if t1' t2 t3\n | ST_ShortCut : forall v t,\n value v ->\n tm_if t v v ===> v\n\n where \" t '===>' t' \" := (step t t').\n\nDefinition bool_step_prop4 :=\n tm_if\n (tm_if tm_true tm_true tm_true)\n tm_false\n tm_false\n ===>\n tm_false.\n\nExample bool_step_prop4_holds : \n bool_step_prop4.\nProof.\n unfold bool_step_prop4.\n apply ST_ShortCut.\n constructor.\nQed.\n\nTheorem strong_progress: forall t,\n value t \\/ (exists t', t ===> t').\nProof.\n induction t.\n left.\n constructor.\n \n left.\n constructor.\n \n inversion IHt1.\n right.\n inversion H.\n exists t2.\n constructor.\n \n exists t3.\n constructor.\n \n right.\n inversion H.\n exists (tm_if x t2 t3).\n apply ST_If.\n assumption.\nQed.\n\nEnd Temp5.\nEnd Temp4.\n\nDefinition stepmany := refl_step_closure step.\n\nNotation \" t '===>*' t' \" := (stepmany t t') (at level 40).\n\nLemma test_stepmany_1:\n tm_plus\n (tm_plus (tm_const 0) (tm_const 3))\n (tm_plus (tm_const 2) (tm_const 4))\n ===>*\n tm_const (plus (plus 0 3) (plus 2 4)).\nProof.\n eapply rsc_step. apply ST_Plus1. apply ST_PlusConstConst.\n eapply rsc_step. apply ST_Plus2. apply v_const.\n apply ST_PlusConstConst.\n eapply rsc_step. apply ST_PlusConstConst.\n apply rsc_refl. Qed.\n\nLemma test_stepmany_2:\n tm_const 3 ===>* tm_const 3.\nProof.\n eapply rsc_refl.\nQed.\n\nLemma test_stepmany_3:\n tm_plus (tm_const 0) (tm_const 3)\n ===>*\n tm_plus (tm_const 0) (tm_const 3).\nProof.\n eapply rsc_refl.\nQed.\n\nLemma test_stepmany_4:\n tm_plus\n (tm_const 0)\n (tm_plus\n (tm_const 2)\n (tm_plus (tm_const 0) (tm_const 3)))\n ===>*\n tm_plus\n (tm_const 0)\n (tm_const (plus 2 (plus 0 3))).\nProof.\neapply rsc_step.\n apply ST_Plus2.\n apply v_const.\n \n apply ST_Plus2.\n apply v_const.\n \n apply ST_PlusConstConst.\n \n eapply rsc_step.\n apply ST_Plus2.\n apply v_const.\n \n apply ST_PlusConstConst.\n \n eapply rsc_refl.\nQed.\n\nDefinition step_normal_form := normal_form step.\n\nDefinition normal_form_of (t t' : tm) :=\n (t ===>* t' /\\ step_normal_form t').\n\n (*\nTheorem normal_forms_unique:\n partial_function normal_form_of.\nProof.\n unfold partial_function. unfold normal_form_of. intros x y1 y2 P1 P2.\n destruct P1 as [P11 P12]. destruct P2 as [P21 P22].\n generalize dependent y2.\n\n unfold step_normal_form in P12.\n unfold step_normal_form.\n unfold normal_form.\n unfold normal_form in P12.\n induction x.\n intros.\n unfold stepmany.\n inversion P11.\n subst.\n inversion P21.\n subst.\n reflexivity.\n\n subst.\n inversion P21.\n reflexivity.\n\n subst.\n inversion H1.\n\n inversion H.\n *)\n\nDefinition normalizing {X:Type} (R:relation X) :=\n forall t, exists t',\n (refl_step_closure R) t t' /\\ normal_form R t'.\n\nLemma stepmany_congr_1 : forall t1 t1' t2,\n t1 ===>* t1' ->\n tm_plus t1 t2 ===>* tm_plus t1' t2.\nProof.\nintros t1 t1' t2 H.\nrsc_cases (induction H) Case.\n apply rsc_refl.\n \n apply rsc_step with (tm_plus y t2).\n apply ST_Plus1.\n apply H.\n \n apply IHrefl_step_closure.\nQed.\n\nLemma stepmany_congr2 : forall t1 t2 t2',\n value t1 ->\n t2 ===>* t2' ->\n tm_plus t1 t2 ===>* tm_plus t1 t2'.\nProof.\nintros t1 t2 t2'.\nintros H1.\nintros H2.\ninduction H2.\n apply rsc_refl.\n \n apply rsc_step with (tm_plus t1 y).\n apply ST_Plus2.\n assumption.\n \n assumption.\n \n assumption.\nQed.\n\nTheorem step_normalizing :\n normalizing step.\nProof.\n unfold normalizing.\n tm_cases (induction t) Case.\n Case \"tm_const\".\n exists (tm_const n).\n split.\n SCase \"l\". apply rsc_refl.\n SCase \"r\".\n (* We can use rewrite with \"iff\" statements, not\n just equalities: *)\n rewrite nf_same_as_value. apply v_const.\n Case \"tm_plus\".\n destruct IHt1 as [t1' H1]. destruct IHt2 as [t2' H2].\n destruct H1 as [H11 H12]. destruct H2 as [H21 H22].\n rewrite nf_same_as_value in H12. rewrite nf_same_as_value in H22.\n inversion H12 as [n1]. inversion H22 as [n2].\n rewrite <- H in H11.\n rewrite <- H0 in H21.\n exists (tm_const (plus n1 n2)).\n split.\n SCase \"l\".\n apply rsc_trans with (tm_plus (tm_const n1) t2).\n apply stepmany_congr_1. apply H11.\n apply rsc_trans with \n (tm_plus (tm_const n1) (tm_const n2)).\n apply stepmany_congr2. apply v_const. apply H21.\n apply rsc_R. apply ST_PlusConstConst.\n SCase \"r\".\n rewrite nf_same_as_value. apply v_const. Qed.\n \n Lemma eval__value : forall t1 t2,\n eval t1 t2 ->\n value t2.\n Proof.\n intros t1 t2 HE.\n eval_cases (inversion HE) Case; apply v_const. Qed.\n \n\n (*\nTheorem eval__stepmany: forall t v,\n eval t v -> t ===>* v.\nProof. \n*)\n" }, { "path": "src/test/resources/samples/langs/Coq/Spec.v", "content": "(** Specifications. *)\nRequire Import Coq.Lists.List.\nRequire Import Coq.Strings.Ascii.\nRequire Import FunctionNinjas.All.\nRequire Import ListString.All.\nRequire Import Computation.\n\nImport ListNotations.\nLocal Open Scope char.\n\n(** A run is an execution of the program with explicit answers for the\n system calls. *)\nModule Run.\n (** We define a run by induction on the structure of a computation. *)\n Inductive t : C.t -> Type :=\n | Ret : t C.Ret\n | Call : forall (command : Command.t) (answer : Command.answer command)\n {handler : Command.answer command -> C.t}, t (handler answer) ->\n t (C.Call command handler).\n\n (** The trace of a run. *)\n Fixpoint trace {x : C.t} (run : t x)\n : list {command : Command.t & Command.answer command} :=\n match run with\n | Ret => []\n | Call command answer _ run => existT _ command answer :: trace run\n end.\nEnd Run.\n\nModule Temporal.\n Module All.\n Inductive t (P : Command.t -> Prop) : C.t -> Prop :=\n | Ret : t P C.Ret\n | Call : forall (c : Command.t) (h : Command.answer c -> C.t),\n P c -> (forall a, t P (h a)) ->\n t P (C.Call c h).\n End All.\n\n Module One.\n Inductive t (P : Command.t -> Prop) : C.t -> Prop :=\n | CallThis : forall (c : Command.t) (h : Command.answer c -> C.t),\n P c ->\n t P (C.Call c h)\n | CallOther : forall (c : Command.t) (h : Command.answer c -> C.t),\n (forall a, t P (h a)) ->\n t P (C.Call c h).\n End One.\n\n Module Then.\n Inductive t (P1 P2 : Command.t -> Prop) : C.t -> Prop :=\n | Ret : t P1 P2 C.Ret\n | Call : forall (c : Command.t) (h : Command.answer c -> C.t),\n (forall a, t P1 P2 (h a)) ->\n t P1 P2 (C.Call c h)\n | CallThen : forall (c : Command.t) (h : Command.answer c -> C.t),\n P1 c -> (forall a, One.t P2 (h a)) ->\n t P1 P2 (C.Call c h).\n End Then.\nEnd Temporal.\n\nModule CardBeforeMoney.\nEnd CardBeforeMoney.\n" }, { "path": "src/test/resources/samples/langs/Coq/Stlc.v", "content": "\nRequire Export SfLib.\n\nModule STLC.\n\nInductive ty : Type :=\n | ty_Bool : ty\n | ty_arrow : ty -> ty -> ty.\n\nInductive tm : Type :=\n | tm_var : id -> tm\n | tm_app : tm -> tm -> tm\n | tm_abs : id -> ty -> tm -> tm\n | tm_true : tm\n | tm_false : tm\n | tm_if : tm -> tm -> tm -> tm.\n\nTactic Notation \"tm_cases\" tactic(first) ident(c) :=\n first;\n [ Case_aux c \"tm_var\" | Case_aux c \"tm_app\" \n | Case_aux c \"tm_abs\" | Case_aux c \"tm_true\" \n | Case_aux c \"tm_false\" | Case_aux c \"tm_if\" ].\n \nNotation a := (Id 0).\nNotation b := (Id 1).\nNotation c := (Id 2).\n\nNotation idB :=\n (tm_abs a ty_Bool (tm_var a)).\n \nNotation idBB :=\n (tm_abs a (ty_arrow ty_Bool ty_Bool) (tm_var a)).\n \nNotation idBBBB :=\n (tm_abs a (ty_arrow (ty_arrow ty_Bool ty_Bool) \n (ty_arrow ty_Bool ty_Bool)) \n (tm_var a)).\n \nNotation k := (tm_abs a ty_Bool (tm_abs b ty_Bool (tm_var a))).\n\nInductive value : tm -> Prop :=\n | v_abs : forall x T t,\n value (tm_abs x T t)\n | t_true : \n value tm_true\n | t_false : \n value tm_false.\n\nHint Constructors value.\n\nFixpoint subst (s:tm) (x:id) (t:tm) : tm :=\n match t with\n | tm_var x' => if beq_id x x' then s else t\n | tm_abs x' T t1 => tm_abs x' T (if beq_id x x' then t1 else (subst s x t1))\n | tm_app t1 t2 => tm_app (subst s x t1) (subst s x t2)\n | tm_true => tm_true\n | tm_false => tm_false\n | tm_if t1 t2 t3 => tm_if (subst s x t1) (subst s x t2) (subst s x t3)\nend.\n\nReserved Notation \"t1 '==>' t2\" (at level 40).\n\nInductive step : tm -> tm -> Prop :=\n | ST_AppAbs : forall x T t12 v2,\n value v2 ->\n (tm_app (tm_abs x T t12) v2) ==> (subst v2 x t12)\n | ST_App1 : forall t1 t1' t2,\n t1 ==> t1' ->\n tm_app t1 t2 ==> tm_app t1' t2\n | ST_App2 : forall v1 t2 t2',\n value v1 ->\n t2 ==> t2' ->\n tm_app v1 t2 ==> tm_app v1 t2'\n | ST_IfTrue : forall t1 t2,\n (tm_if tm_true t1 t2) ==> t1\n | ST_IfFalse : forall t1 t2,\n (tm_if tm_false t1 t2) ==> t2\n | ST_If : forall t1 t1' t2 t3,\n t1 ==> t1' ->\n (tm_if t1 t2 t3) ==> (tm_if t1' t2 t3)\n\nwhere \"t1 '==>' t2\" := (step t1 t2).\n\nTactic Notation \"step_cases\" tactic(first) ident(c) :=\n first;\n [ Case_aux c \"ST_AppAbs\" | Case_aux c \"ST_App1\" \n | Case_aux c \"ST_App2\" | Case_aux c \"ST_IfTrue\" \n | Case_aux c \"ST_IfFalse\" | Case_aux c \"ST_If\" ].\n\nNotation stepmany := (refl_step_closure step).\nNotation \"t1 '==>*' t2\" := (stepmany t1 t2) (at level 40).\n\nHint Constructors step.\n\nLemma step_example3 :\n (tm_app (tm_app idBBBB idBB) idB)\n ==>* idB.\nProof.\n eapply rsc_step.\n apply ST_App1.\n apply ST_AppAbs.\n apply v_abs.\n \n simpl.\n eapply rsc_step.\n apply ST_AppAbs.\n apply v_abs.\n \n simpl.\n apply rsc_refl.\nQed.\n\nDefinition context := partial_map ty.\nModule Context.\n\nDefinition partial_map (A:Type) := id -> option A.\nDefinition empty {A:Type} : partial_map A := (fun _ => None).\nDefinition extend {A:Type} (Gamma : partial_map A) (x:id) (T : A) :=\n fun x' => if beq_id x x' then Some T else Gamma x'.\n \nLemma extend_eq : forall A (ctxt: partial_map A) x T,\n (extend ctxt x T) x = Some T.\nProof.\n intros. unfold extend. rewrite <- beq_id_refl. auto.\nQed.\n\nLemma extend_neq : forall A (ctxt: partial_map A) x1 T x2,\n beq_id x2 x1 = false ->\n (extend ctxt x2 T) x1 = ctxt x1.\nProof.\nintros. unfold extend. rewrite H. auto.\nQed.\n\nEnd Context.\n\nInductive has_type : context -> tm -> ty -> Prop :=\n | T_Var : forall Gamma x T,\n Gamma x = Some T ->\n has_type Gamma (tm_var x) T\n | T_Abs : forall Gamma x T11 T12 t12,\n has_type (extend Gamma x T11) t12 T12 ->\n has_type Gamma (tm_abs x T11 t12) (ty_arrow T11 T12)\n | T_App : forall T11 T12 Gamma t1 t2,\n has_type Gamma t1 (ty_arrow T11 T12) ->\n has_type Gamma t2 T11 ->\n has_type Gamma (tm_app t1 t2) T12\n | T_True : forall Gamma,\n has_type Gamma tm_true ty_Bool\n | T_False : forall Gamma,\n has_type Gamma tm_false ty_Bool\n | T_If : forall t1 t2 t3 T Gamma,\n has_type Gamma t1 ty_Bool ->\n has_type Gamma t2 T ->\n has_type Gamma t3 T ->\n has_type Gamma (tm_if t1 t2 t3) T.\n \nTactic Notation \"has_type_cases\" tactic(first) ident(c) :=\n first;\n [ Case_aux c \"T_Var\" | Case_aux c \"T_Abs\" \n | Case_aux c \"T_App\" | Case_aux c \"T_True\" \n | Case_aux c \"T_False\" | Case_aux c \"T_If\" ].\n\nHint Constructors has_type.\n\nHint Unfold beq_id beq_nat extend.\n\nExample typing_example_2_full :\n has_type empty\n (tm_abs a ty_Bool\n (tm_abs b (ty_arrow ty_Bool ty_Bool)\n (tm_app (tm_var b) (tm_app (tm_var b) (tm_var a)))))\n (ty_arrow ty_Bool (ty_arrow (ty_arrow ty_Bool ty_Bool) ty_Bool)).\nProof.\napply T_Abs.\napply T_Abs.\napply T_App with (T11 := ty_Bool).\n apply T_Var.\n unfold extend.\n simpl.\n reflexivity.\n \n apply T_App with (T11 := ty_Bool).\n apply T_Var.\n unfold extend.\n simpl.\n reflexivity.\n \n apply T_Var.\n unfold extend.\n simpl.\n reflexivity.\nQed.\n\nExample typing_example_3 :\n exists T, \n has_type empty\n (tm_abs a (ty_arrow ty_Bool ty_Bool)\n (tm_abs b (ty_arrow ty_Bool ty_Bool)\n (tm_abs c ty_Bool\n (tm_app (tm_var b) (tm_app (tm_var a) (tm_var c))))))\n T.\n\nProof with auto.\nexists\n (ty_arrow (ty_arrow ty_Bool ty_Bool)\n (ty_arrow (ty_arrow ty_Bool ty_Bool) (ty_arrow ty_Bool ty_Bool))).\napply T_Abs.\napply T_Abs.\napply T_Abs.\napply T_App with (T11 := ty_Bool).\n apply T_Var.\n unfold extend.\n simpl.\n reflexivity.\n \n apply T_App with (T11 := ty_Bool).\n auto.\n \n auto.\nQed.\n\n\nTheorem coiso : forall a b e,\n a ==>* b ->\n tm_app a e ==>* tm_app b e.\nProof.\nintros.\ninduction H.\n apply rsc_refl.\n \n apply rsc_step with (tm_app y e).\n apply ST_App1.\n assumption.\n \n assumption.\nQed.\n\nTheorem reptrans : forall a b c,\n a ==>* b ->\n b ==>* c ->\n a ==>* c.\nProof.\n\nintros a b c H.\ninduction H.\n intros.\n assumption.\n \n intros H1.\n apply IHrefl_step_closure in H1.\n apply rsc_step with y.\n assumption.\n \n assumption.\nQed.\n\n(* TODO\nExample typing_nonexample_3 :\n ~ (exists S, exists T,\n has_type empty \n (tm_abs a S\n (tm_app (tm_var a) (tm_var a)))\n T).\nProof.\n*)\n\nInductive appears_free_in : id -> tm -> Prop :=\n | afi_var : forall x,\n appears_free_in x (tm_var x)\n | afi_app1 : forall x t1 t2,\n appears_free_in x t1 -> appears_free_in x (tm_app t1 t2)\n | afi_app2 : forall x t1 t2,\n appears_free_in x t2 -> appears_free_in x (tm_app t1 t2)\n | afi_abs : forall x y T11 t12,\n y <> x ->\n appears_free_in x t12 ->\n appears_free_in x (tm_abs y T11 t12)\n | afi_if1 : forall x t1 t2 t3,\n appears_free_in x t1 ->\n appears_free_in x (tm_if t1 t2 t3)\n | afi_if2 : forall x t1 t2 t3,\n appears_free_in x t2 ->\n appears_free_in x (tm_if t1 t2 t3)\n | afi_if3 : forall x t1 t2 t3,\n appears_free_in x t3 ->\n appears_free_in x (tm_if t1 t2 t3).\n \nTactic Notation \"afi_cases\" tactic(first) ident(c) :=\n first;\n [ Case_aux c \"afi_var\"\n | Case_aux c \"afi_app1\" | Case_aux c \"afi_app2\" \n | Case_aux c \"afi_abs\" \n | Case_aux c \"afi_if1\" | Case_aux c \"afi_if2\" \n | Case_aux c \"afi_if3\" ].\n\nHint Constructors appears_free_in.\n\nDefinition closed (t:tm) :=\n forall x, ~ appears_free_in x t.\n \nLemma free_in_context : forall x t T Gamma,\n appears_free_in x t ->\n has_type Gamma t T ->\n exists T', Gamma x = Some T'.\nProof.\n intros. generalize dependent Gamma. generalize dependent T.\n afi_cases (induction H) Case; \n intros; try solve [inversion H0; eauto].\n Case \"afi_abs\".\n inversion H1; subst.\n apply IHappears_free_in in H7.\n apply not_eq_beq_id_false in H.\n rewrite extend_neq in H7; assumption.\nQed.\n\nCorollary typable_empty__closed : forall t T, \n has_type empty t T ->\n closed t.\nProof.\nintros t T H x H1.\nremember (@empty ty) as Gamma.\nassert (exists t' : _, Gamma x = Some t').\n apply free_in_context with (t := t) (T := T).\n assumption.\n \n assumption.\n \n inversion H0.\n rewrite HeqGamma in H2.\n inversion H2.\nQed.\n\nLemma context_invariance : forall Gamma Gamma' t S,\n has_type Gamma t S ->\n (forall x, appears_free_in x t -> Gamma x = Gamma' x) ->\n has_type Gamma' t S.\nProof with auto.\nintros.\ngeneralize dependent Gamma'.\nhas_type_cases (induction H) Case; intros; auto.\n apply T_Var.\n rewrite <- H0...\n \n apply T_Abs.\n apply IHhas_type.\n intros x0 Hafi.\n unfold extend.\n remember (beq_id x x0) as e.\n destruct e.\n reflexivity.\n \n auto.\n apply H0.\n apply afi_abs.\n auto.\n eauto .\n apply beq_id_false_not_eq.\n rewrite Heqe.\n reflexivity.\n \n assumption.\n \n apply T_App with T11.\n auto.\n \n auto.\nQed.\n\nLemma substitution_preserves_typing : forall Gamma x U v t T,\n has_type (extend Gamma x U) t T ->\n has_type empty v U ->\n has_type Gamma (subst v x t) T.\nProof with eauto.\n intros Gamma x U v t T Ht Hv.\n generalize dependent Gamma.\n generalize dependent T.\n tm_cases (induction t) Case; intros T Gamma H; inversion H; subst; simpl...\n Case \"tm_var\".\n rename i into y. remember (beq_id x y) as e. destruct e.\n SCase \"x=y\".\n apply beq_id_eq in Heqe. subst.\n rewrite extend_eq in H2.\n inversion H2; subst.\n clear H2.\n eapply context_invariance...\n intros x Hcontra.\n destruct (free_in_context _ _ T empty Hcontra) as (T', HT')...\n inversion HT'.\n\n apply T_Var.\n rewrite extend_neq in H2.\n assumption.\n\n rewrite Heqe.\n reflexivity.\n\n rename i into y.\n apply T_Abs.\n remember (beq_id x y) as e.\n destruct e.\n eapply context_invariance...\n apply beq_id_eq in Heqe.\n subst.\n intros x Hafi.\n unfold extend.\n destruct (beq_id y x).\n reflexivity.\n\n reflexivity.\n\n apply IHt.\n eapply context_invariance...\n intros x0 Hafi.\n unfold extend.\n remember (beq_id y x0) as Coiso1.\n remember (beq_id x x0) as Coiso2.\n destruct Coiso1.\n auto.\n eauto .\n destruct Coiso2.\n eauto .\n auto.\n apply beq_id_eq in HeqCoiso1.\n apply beq_id_eq in HeqCoiso2.\n subst.\n assert (x0 <> x0).\n apply beq_id_false_not_eq.\n rewrite Heqe.\n auto.\n\n apply ex_falso_quodlibet.\n apply H0.\n reflexivity.\n\n reflexivity.\n\n destruct Coiso2.\n auto.\n\n auto.\nQed.\n\nTheorem preservation : forall t t' T,\n has_type empty t T ->\n t ==> t' ->\n has_type empty t' T.\nProof.\nremember (@empty ty) as Gamma.\nintros t t' T HT.\ngeneralize dependent t'.\ninduction HT.\n intros t' H1.\n inversion H1.\n \n intros t' H1.\n inversion H1.\n \n intros t' H1.\n inversion H1.\n apply substitution_preserves_typing with T11.\n subst.\n inversion HT1.\n subst.\n apply H2.\n \n subst.\n assumption.\n \n subst.\n apply T_App with T11.\n apply IHHT1.\n reflexivity.\n \n assumption.\n \n assumption.\n \n subst.\n apply T_App with T11.\n assumption.\n \n apply IHHT2.\n reflexivity.\n \n assumption.\n \n intros t' H.\n inversion H.\n \n intros t' H.\n inversion H.\n \n intros t' H.\n inversion H.\n subst.\n assumption.\n \n subst.\n assumption.\n \n subst.\n apply T_If.\n apply IHHT1.\n reflexivity.\n \n assumption.\n \n assumption.\n \n assumption.\nQed.\n\nTheorem progress : forall t T,\n has_type empty t T ->\n value t \\/ exists t', t ==> t'.\nProof.\nintros t T.\nintros H.\nremember (@empty ty) as Gamma.\ninduction H.\n rewrite HeqGamma in H.\n unfold empty in H.\n inversion H.\n \n left.\n apply v_abs.\n \n right.\n assert (value t1 \\/ (exists t' : tm, t1 ==> t')).\n apply IHhas_type1.\n assumption.\n \n assert (value t2 \\/ (exists t' : tm, t2 ==> t')).\n apply IHhas_type2.\n assumption.\n \n inversion H1.\n inversion H2.\n inversion H3.\n subst.\n exists (subst t2 x t).\n apply ST_AppAbs.\n assumption.\n \n subst.\n inversion H.\n \n subst.\n inversion H.\n \n inversion H4.\n exists (tm_app t1 x).\n apply ST_App2.\n assumption.\n \n assumption.\n \n inversion H3.\n exists (tm_app x t2).\n apply ST_App1.\n assumption.\n \n left.\n auto.\n \n left.\n auto.\n \n right.\n assert (value t1 \\/ (exists t' : tm, t1 ==> t')).\n apply IHhas_type1.\n assumption.\n \n inversion H2.\n inversion H3.\n subst.\n inversion H.\n \n subst.\n exists t2.\n apply ST_IfTrue.\n \n subst.\n exists t3.\n apply ST_IfFalse.\n \n inversion H3.\n exists (tm_if x t2 t3).\n apply ST_If.\n assumption.\nQed.\n\nTheorem progress' : forall t T,\n has_type empty t T ->\n value t \\/ exists t', t ==> t'.\nProof.\nintros t.\ntm_cases (induction t) Case; intros T Ht; auto.\n inversion Ht.\n inversion H1.\n \n right.\n inversion Ht.\n subst.\n assert (value t1 \\/ (exists t' : tm, t1 ==> t')).\n apply IHt1 with (T := ty_arrow T11 T).\n assumption.\n \n assert (value t2 \\/ (exists t' : tm, t2 ==> t')).\n apply IHt2 with T11.\n assumption.\n \n inversion H.\n inversion H1.\n subst.\n inversion H0.\n exists (subst t2 x t).\n apply ST_AppAbs.\n assumption.\n \n inversion H3.\n exists (tm_app (tm_abs x T0 t) x0).\n apply ST_App2.\n assumption.\n \n assumption.\n \n subst.\n inversion H2.\n \n subst.\n inversion H2.\n \n inversion H1.\n exists (tm_app x t2).\n apply ST_App1.\n assumption.\n \n right.\n inversion Ht.\n subst.\n assert (value t1 \\/ (exists t' : tm, t1 ==> t')).\n apply IHt1 with ty_Bool.\n assumption.\n \n assert (value t2 \\/ (exists t' : tm, t2 ==> t')).\n apply IHt2 with T.\n assumption.\n \n assert (value t3 \\/ (exists t' : tm, t3 ==> t')).\n apply IHt3 with T.\n assumption.\n \n inversion H.\n inversion H2.\n subst.\n inversion H3.\n \n subst.\n subst.\n exists t2.\n apply ST_IfTrue.\n \n exists t3.\n apply ST_IfFalse.\n \n inversion H2.\n exists (tm_if x t2 t3).\n apply ST_If.\n assumption.\nQed.\n\nTheorem types_unique : forall t T Gamma,\n has_type Gamma t T ->\n (forall T', has_type Gamma t T' -> T' = T).\nProof.\nintros t T Gamma H.\ninduction H.\n intros T'.\n intros H1.\n inversion H1.\n subst.\n subst.\n auto.\n eauto .\n inversion H1.\n subst.\n assert (Some T = Some T').\n rewrite <- H3.\n rewrite <- H.\n reflexivity.\n \n inversion H0.\n reflexivity.\n \n intros T'.\n intros H1.\n inversion H1.\n subst.\n assert (T1 = T12).\n apply IHhas_type.\n assumption.\n \n rewrite H0.\n reflexivity.\n \n intros T' H1.\n subst.\n inversion H1.\n subst.\n assert (ty_arrow T0 T' = ty_arrow T11 T12).\n apply IHhas_type1.\n assumption.\n \n inversion H2.\n reflexivity.\n \n intros T'.\n intros H.\n inversion H.\n reflexivity.\n \n intros.\n inversion H.\n reflexivity.\n \n intros T'.\n intros H2.\n inversion H2.\n subst.\n apply IHhas_type2.\n assumption.\nQed." }, { "path": "src/test/resources/samples/langs/Creole/creole.creole", "content": "= Creole\n\nCreole is a Creole-to-HTML converter for Creole, the lightweight markup\nlanguage (http://wikicreole.org/). Github uses this converter to render *.creole files.\n\nProject page on github:\n\n* http://github.com/minad/creole\n\nTravis-CI:\n\n* https://travis-ci.org/minad/creole\n\nRDOC:\n\n* http://rdoc.info/projects/minad/creole\n\n== INSTALLATION\n\n{{{\ngem install creole\n}}}\n\n== SYNOPSIS\n\n{{{\nrequire 'creole'\nhtml = Creole.creolize('== Creole text')\n}}}\n\n== BUGS\n\nIf you found a bug, please report it at the Creole project's tracker\non GitHub:\n\nhttp://github.com/minad/creole/issues\n\n== AUTHORS\n\n* Lars Christensen (larsch)\n* Daniel Mendler (minad)\n\n== LICENSE\n\nCreole is Copyright (c) 2008 - 2013 Lars Christensen, Daniel Mendler. It is free software, and\nmay be redistributed under the terms specified in the README file of\nthe Ruby distribution.\n" }, { "path": "src/test/resources/samples/langs/Crystal/const_spec.cr", "content": "#!/usr/bin/env bin/crystal --run\nrequire \"../../spec_helper\"\n\ndescribe \"Codegen: const\" do\n it \"define a constant\" do\n run(\"A = 1; A\").to_i.should eq(1)\n end\n\n it \"support nested constant\" do\n run(\"class B; A = 1; end; B::A\").to_i.should eq(1)\n end\n\n it \"support constant inside a def\" do\n run(\"\n class Foo\n A = 1\n\n def foo\n A\n end\n end\n\n Foo.new.foo\n \").to_i.should eq(1)\n end\n\n it \"finds nearest constant first\" do\n run(\"\n A = 1\n\n class Foo\n A = 2.5_f32\n\n def foo\n A\n end\n end\n\n Foo.new.foo\n \").to_f32.should eq(2.5)\n end\n\n it \"allows constants with same name\" do\n run(\"\n A = 1\n\n class Foo\n A = 2.5_f32\n\n def foo\n A\n end\n end\n\n A\n Foo.new.foo\n \").to_f32.should eq(2.5)\n end\n\n it \"constants with expression\" do\n run(\"\n A = 1 + 1\n A\n \").to_i.should eq(2)\n end\n\n it \"finds global constant\" do\n run(\"\n A = 1\n\n class Foo\n def foo\n A\n end\n end\n\n Foo.new.foo\n \").to_i.should eq(1)\n end\n\n it \"define a constant in lib\" do\n run(\"lib Foo; A = 1; end; Foo::A\").to_i.should eq(1)\n end\n\n it \"invokes block in const\" do\n run(\"require \\\"prelude\\\"; A = [\\\"1\\\"].map { |x| x.to_i }; A[0]\").to_i.should eq(1)\n end\n\n it \"declare constants in right order\" do\n run(\"A = 1 + 1; B = true ? A : 0; B\").to_i.should eq(2)\n end\n\n it \"uses correct types lookup\" do\n run(\"\n module A\n class B\n def foo\n 1\n end\n end\n\n C = B.new;\n end\n\n def foo\n A::C.foo\n end\n\n foo\n \").to_i.should eq(1)\n end\n\n it \"codegens variable assignment in const\" do\n run(\"\n class Foo\n def initialize(@x)\n end\n\n def x\n @x\n end\n end\n\n A = begin\n f = Foo.new(1)\n f\n end\n\n def foo\n A.x\n end\n\n foo\n \").to_i.should eq(1)\n end\n\n it \"declaring var\" do\n run(\"\n BAR = begin\n a = 1\n while 1 == 2\n b = 2\n end\n a\n end\n class Foo\n def compile\n BAR\n end\n end\n\n Foo.new.compile\n \").to_i.should eq(1)\n end\n\n it \"initialize const that might raise an exception\" do\n run(\"\n require \\\"prelude\\\"\n CONST = (raise \\\"OH NO\\\" if 1 == 2)\n\n def doit\n CONST\n rescue\n end\n\n doit.nil?\n \").to_b.should be_true\n end\nend\n" }, { "path": "src/test/resources/samples/langs/Crystal/declare_var_spec.cr", "content": "#!/usr/bin/env bin/crystal --run\nrequire \"../../spec_helper\"\n\ndescribe \"Type inference: declare var\" do\n it \"types declare var\" do\n assert_type(\"a :: Int32\") { int32 }\n end\n\n it \"types declare var and reads it\" do\n assert_type(\"a :: Int32; a\") { int32 }\n end\n\n it \"types declare var and changes its type\" do\n assert_type(\"a :: Int32; while 1 == 2; a = 'a'; end; a\") { union_of(int32, char) }\n end\n\n it \"declares instance var which appears in initialize\" do\n result = assert_type(\"\n class Foo\n @x :: Int32\n end\n\n Foo.new\") { types[\"Foo\"] }\n\n mod = result.program\n\n foo = mod.types[\"Foo\"] as NonGenericClassType\n foo.instance_vars[\"@x\"].type.should eq(mod.int32)\n end\n\n it \"declares instance var of generic class\" do\n result = assert_type(\"\n class Foo(T)\n @x :: T\n end\n\n Foo(Int32).new\") do\n foo = types[\"Foo\"] as GenericClassType\n foo_i32 = foo.instantiate([int32] of Type | ASTNode)\n foo_i32.lookup_instance_var(\"@x\").type.should eq(int32)\n foo_i32\n end\n end\n\n it \"declares instance var of generic class after reopen\" do\n result = assert_type(\"\n class Foo(T)\n end\n\n f = Foo(Int32).new\n\n class Foo(T)\n @x :: T\n end\n\n f\") do\n foo = types[\"Foo\"] as GenericClassType\n foo_i32 = foo.instantiate([int32] of Type | ASTNode)\n foo_i32.lookup_instance_var(\"@x\").type.should eq(int32)\n foo_i32\n end\n end\n\n it \"declares an instance variable in initialize\" do\n assert_type(\"\n class Foo\n def initialize\n @x :: Int32\n end\n\n def x\n @x\n end\n end\n\n Foo.new.x\n \") { int32 }\n end\nend\n" }, { "path": "src/test/resources/samples/langs/Crystal/transformer.cr", "content": "module Crystal\n class ASTNode\n def transform(transformer)\n transformer.before_transform self\n node = transformer.transform self\n transformer.after_transform self\n node\n end\n end\n\n class Transformer\n def before_transform(node)\n end\n\n def after_transform(node)\n end\n\n def transform(node : Expressions)\n exps = [] of ASTNode\n node.expressions.each do |exp|\n new_exp = exp.transform(self)\n if new_exp\n if new_exp.is_a?(Expressions)\n exps.concat new_exp.expressions\n else\n exps << new_exp\n end\n end\n end\n\n if exps.length == 1\n exps[0]\n else\n node.expressions = exps\n node\n end\n end\n\n def transform(node : Call)\n if node_obj = node.obj\n node.obj = node_obj.transform(self)\n end\n transform_many node.args\n\n if node_block = node.block\n node.block = node_block.transform(self)\n end\n\n if node_block_arg = node.block_arg\n node.block_arg = node_block_arg.transform(self)\n end\n\n node\n end\n\n def transform(node : And)\n node.left = node.left.transform(self)\n node.right = node.right.transform(self)\n node\n end\n\n def transform(node : Or)\n node.left = node.left.transform(self)\n node.right = node.right.transform(self)\n node\n end\n\n def transform(node : StringInterpolation)\n transform_many node.expressions\n node\n end\n\n def transform(node : ArrayLiteral)\n transform_many node.elements\n\n if node_of = node.of\n node.of = node_of.transform(self)\n end\n\n node\n end\n\n def transform(node : HashLiteral)\n transform_many node.keys\n transform_many node.values\n\n if of_key = node.of_key\n node.of_key = of_key.transform(self)\n end\n\n if of_value = node.of_value\n node.of_value = of_value.transform(self)\n end\n\n node\n end\n\n def transform(node : If)\n node.cond = node.cond.transform(self)\n node.then = node.then.transform(self)\n node.else = node.else.transform(self)\n node\n end\n\n def transform(node : Unless)\n node.cond = node.cond.transform(self)\n node.then = node.then.transform(self)\n node.else = node.else.transform(self)\n node\n end\n\n def transform(node : IfDef)\n node.cond = node.cond.transform(self)\n node.then = node.then.transform(self)\n node.else = node.else.transform(self)\n node\n end\n\n def transform(node : MultiAssign)\n transform_many node.targets\n transform_many node.values\n node\n end\n\n def transform(node : SimpleOr)\n node.left = node.left.transform(self)\n node.right = node.right.transform(self)\n node\n end\n\n def transform(node : Def)\n transform_many node.args\n node.body = node.body.transform(self)\n\n if receiver = node.receiver\n node.receiver = receiver.transform(self)\n end\n\n if block_arg = node.block_arg\n node.block_arg = block_arg.transform(self)\n end\n\n node\n end\n\n def transform(node : Macro)\n transform_many node.args\n node.body = node.body.transform(self)\n\n if receiver = node.receiver\n node.receiver = receiver.transform(self)\n end\n\n if block_arg = node.block_arg\n node.block_arg = block_arg.transform(self)\n end\n\n node\n end\n\n def transform(node : PointerOf)\n node.exp = node.exp.transform(self)\n node\n end\n\n def transform(node : SizeOf)\n node.exp = node.exp.transform(self)\n node\n end\n\n def transform(node : InstanceSizeOf)\n node.exp = node.exp.transform(self)\n node\n end\n\n def transform(node : IsA)\n node.obj = node.obj.transform(self)\n node.const = node.const.transform(self)\n node\n end\n\n def transform(node : RespondsTo)\n node.obj = node.obj.transform(self)\n node\n end\n\n def transform(node : Case)\n node.cond = node.cond.transform(self)\n transform_many node.whens\n\n if node_else = node.else\n node.else = node_else.transform(self)\n end\n\n node\n end\n\n def transform(node : When)\n transform_many node.conds\n node.body = node.body.transform(self)\n node\n end\n\n def transform(node : ImplicitObj)\n node\n end\n\n def transform(node : ClassDef)\n node.body = node.body.transform(self)\n\n if superclass = node.superclass\n node.superclass = superclass.transform(self)\n end\n\n node\n end\n\n def transform(node : ModuleDef)\n node.body = node.body.transform(self)\n node\n end\n\n def transform(node : While)\n node.cond = node.cond.transform(self)\n node.body = node.body.transform(self)\n node\n end\n\n def transform(node : Generic)\n node.name = node.name.transform(self)\n transform_many node.type_vars\n node\n end\n\n def transform(node : ExceptionHandler)\n node.body = node.body.transform(self)\n transform_many node.rescues\n\n if node_ensure = node.ensure\n node.ensure = node_ensure.transform(self)\n end\n\n node\n end\n\n def transform(node : Rescue)\n node.body = node.body.transform(self)\n transform_many node.types\n node\n end\n\n def transform(node : Union)\n transform_many node.types\n node\n end\n\n def transform(node : Hierarchy)\n node.name = node.name.transform(self)\n node\n end\n\n def transform(node : Metaclass)\n node.name = node.name.transform(self)\n node\n end\n\n def transform(node : Arg)\n if default_value = node.default_value\n node.default_value = default_value.transform(self)\n end\n\n if restriction = node.restriction\n node.restriction = restriction.transform(self)\n end\n\n node\n end\n\n def transform(node : BlockArg)\n node.fun = node.fun.transform(self)\n node\n end\n\n def transform(node : Fun)\n transform_many node.inputs\n\n if output = node.output\n node.output = output.transform(self)\n end\n\n node\n end\n\n def transform(node : Block)\n node.args.map! { |exp| exp.transform(self) as Var }\n node.body = node.body.transform(self)\n node\n end\n\n def transform(node : FunLiteral)\n node.def.body = node.def.body.transform(self)\n node\n end\n\n def transform(node : FunPointer)\n if obj = node.obj\n node.obj = obj.transform(self)\n end\n node\n end\n\n def transform(node : Return)\n transform_many node.exps\n node\n end\n\n def transform(node : Break)\n transform_many node.exps\n node\n end\n\n def transform(node : Next)\n transform_many node.exps\n node\n end\n\n def transform(node : Yield)\n if scope = node.scope\n node.scope = scope.transform(self)\n end\n transform_many node.exps\n node\n end\n\n def transform(node : Include)\n node.name = node.name.transform(self)\n node\n end\n\n def transform(node : Extend)\n node.name = node.name.transform(self)\n node\n end\n\n def transform(node : RangeLiteral)\n node.from = node.from.transform(self)\n node.to = node.to.transform(self)\n node\n end\n\n def transform(node : Assign)\n node.target = node.target.transform(self)\n node.value = node.value.transform(self)\n node\n end\n\n def transform(node : Nop)\n node\n end\n\n def transform(node : NilLiteral)\n node\n end\n\n def transform(node : BoolLiteral)\n node\n end\n\n def transform(node : NumberLiteral)\n node\n end\n\n def transform(node : CharLiteral)\n node\n end\n\n def transform(node : StringLiteral)\n node\n end\n\n def transform(node : SymbolLiteral)\n node\n end\n\n def transform(node : RegexLiteral)\n node\n end\n\n def transform(node : Var)\n node\n end\n\n def transform(node : MetaVar)\n node\n end\n\n def transform(node : InstanceVar)\n node\n end\n\n def transform(node : ClassVar)\n node\n end\n\n def transform(node : Global)\n node\n end\n\n def transform(node : Require)\n node\n end\n\n def transform(node : Path)\n node\n end\n\n def transform(node : Self)\n node\n end\n\n def transform(node : LibDef)\n node.body = node.body.transform(self)\n node\n end\n\n def transform(node : FunDef)\n if body = node.body\n node.body = body.transform(self)\n end\n node\n end\n\n def transform(node : TypeDef)\n node\n end\n\n def transform(node : StructDef)\n node\n end\n\n def transform(node : UnionDef)\n node\n end\n\n def transform(node : EnumDef)\n node\n end\n\n def transform(node : ExternalVar)\n node\n end\n\n def transform(node : IndirectRead)\n node.obj = node.obj.transform(self)\n node\n end\n\n def transform(node : IndirectWrite)\n node.obj = node.obj.transform(self)\n node.value = node.value.transform(self)\n node\n end\n\n def transform(node : TypeOf)\n transform_many node.expressions\n node\n end\n\n def transform(node : Primitive)\n node\n end\n\n def transform(node : Not)\n node\n end\n\n def transform(node : TypeFilteredNode)\n node\n end\n\n def transform(node : TupleLiteral)\n transform_many node.exps\n node\n end\n\n def transform(node : Cast)\n node.obj = node.obj.transform(self)\n node.to = node.to.transform(self)\n node\n end\n\n def transform(node : DeclareVar)\n node.var = node.var.transform(self)\n node.declared_type = node.declared_type.transform(self)\n node\n end\n\n def transform(node : Alias)\n node.value = node.value.transform(self)\n node\n end\n\n def transform(node : TupleIndexer)\n node\n end\n\n def transform(node : Attribute)\n node\n end\n\n def transform_many(exps)\n exps.map! { |exp| exp.transform(self) } if exps\n end\n end\nend\n" }, { "path": "src/test/resources/samples/langs/Csound/allglass.orc", "content": "sr = 44100\nkr = 44100\nksmps = 1\nnchnls = 2\n\n; pvanal -n 512 -w 8 allglass1-L.wav allglass1-L.pvc\n; pvanal -n 512 -w 8 allglass1-R.wav allglass1-R.pvc\ninstr 1\n ktime line 0, p3, 17.5018\n arL pvoc ktime, 1, \"allglass1-L.pvc\"\n arR pvoc ktime, 1, \"allglass1-R.pvc\"\n out arL, arR\nendin\n" }, { "path": "src/test/resources/samples/langs/Csound/interp.orc", "content": "sr = 44100\nkr = 44100\nksmps = 1\nnchnls = 2\n\n; pvanal -n 1024 -w 2 partA-L.wav partA-L.pvc\n; pvanal -n 1024 -w 2 partA-R.wav partA-R.pvc\n; pvanal -n 1024 -w 2 partB.wav partB.pvc\ninstr 1\n iscale = 1\n\n ktimpnt1 line 0, iscale*(82196/44100), 82196/44100\n ktimpnt2 linseg 0, iscale*1.25, 0, iscale*(103518/44100), 103518/44100\n kfreqscale linseg 1, iscale*0.5, 1, iscale*1.6, 0.8\n kfreqinterpL linseg 0, iscale*0.25, 0, iscale*1.6, 1\n kampinterpL linseg 0, iscale*0.25, 0, iscale*1.6, 1\n kfreqinterpR linseg 0, iscale*0.5, 0, iscale*1.2, 1\n kampinterpR linseg 0, iscale*0.5, 0, iscale*1.2, 1\n\n pvbufread ktimpnt1, \"partB.pvc\"\n apvcL pvinterp ktimpnt2, 1, \"partA-L.pvc\", kfreqscale, 1, 1, 1, 1-kfreqinterpL, 1-kampinterpL\n pvbufread ktimpnt1, \"partB.pvc\"\n apvcR pvinterp ktimpnt2, 1, \"partA-R.pvc\", kfreqscale, 1, 1, 1, 1-kfreqinterpR, 1-kampinterpR\n\n outs apvcL*0.8, apvcR*0.8\nendin\n" }, { "path": "src/test/resources/samples/langs/Csound/test.orc", "content": "// Csound single-line comments can be preceded by a pair of forward slashes...\n; ...or a semicolon.\n\n/* Block comments begin with /* and end with */\n\n// Orchestras begin with a header of audio parameters.\nnchnls = 1\nnchnls_i = 1\nsr = 44100\n0dbfs = 1\nksmps = 10\n\n// The control rate kr = sr / ksmps can be omitted when the number of audio\n// samples in a control period (ksmps) is set, but kr may appear in older\n// orchestras.\nkr = 4410\n\n// Orchestras contain instruments. These begin with the keyword instr followed\n// by a comma-separated list of numbers or names of the instrument. Instruments\n// end at the endin keyword and cannot be nested.\ninstr 1, N_a_M_e_, +Name\n // Instruments contain statements. Here is a typical statement:\n aSignal oscil 0dbfs, 440, 1\n // Statements are terminated with a newline (possibly preceded by a comment).\n // To write a statement on several lines, precede the newline with a\n // backslash.\n prints \\\n \"hello, world\\n\";comment\n\n // Csound 6 introduced function syntax for opcodes with one or zero outputs.\n // The oscil statement above is the same as\n aSignal = oscil(0dbfs, 440, 1)\n\n // Instruments can contain control structures.\n kNote = p3\n if (kNote == 0) then\n kFrequency = 220\n elseif kNote == 1 then // Parentheses around binary expressions are optional.\n kFrequency = 440\n endif\n\n // Csound 6 introduced looping structures.\n iIndex = 0\n while iIndex < 5 do\n print iIndex\n iIndex += 1\n od\n iIndex = 0\n until iIndex >= 5 do\n print iIndex\n iIndex += 1\n enduntil\n // Both kinds of loops can be terminated by either od or enduntil.\n\n // Single-line strings are enclosed in double-quotes.\n prints \"string\\\\\\r\\n\\t\\\"\"\n // Multi-line strings are enclosed in pairs of curly braces.\n prints {{\n hello,\n\n world\n }}\n\n // Instruments often end with a statement containing an output opcode.\n outc aSignal\nendin\n\n// Orchestras can also contain user-defined opcodes (UDOs). Here is an\n// oscillator with one audio-rate output and two control-rate inputs:\nopcode anOscillator, a, kk\n kAmplitude, kFrequency xin\n aSignal vco2 kAmplitude, kFrequency\n xout aSignal\nendop\ninstr TestOscillator\n outc(anOscillator(0dbfs, 110))\nendin\n\n// Python can be executed in Csound\n// . So can Lua\n// .\npyruni {{\nimport random\n\npool = [(1 + i / 10.0) ** 1.2 for i in range(100)]\n\ndef get_number_from_pool(n, p):\n if random.random() < p:\n i = int(random.random() * len(pool))\n pool[i] = n;\n return random.choice(pool)\n}}\n\n// The Csound preprocessor supports conditional compilation and including files.\n#ifdef DEBUG\n#undef DEBUG\n#include \"filename.orc\"\n#endif\n\n// The preprocessor also supports object- and function-like macros. This is an\n// object-like macro that defines a number:\n#define A_HZ #440#\n\n// This is a function-like macro:\n#define OSCIL_MACRO(VOLUME'FREQUENCY'TABLE) #oscil $VOLUME, $FREQUENCY, $TABLE#\n\n// Bodies of macros are enclosed in # and can contain newlines. The arguments of\n// function-like macros are separated by single-quotes. Uses of macros are\n// prefixed with a dollar sign.\ninstr TestMacro\n aSignal $OSCIL_MACRO(1'$A_HZ'1)\n // Not unlike PHP, macros expand in double-quoted strings.\n prints \"The frequency of the oscillator is $A_HZ Hz.\\n\"\n out aSignal\nendin\n\n// Here are other things to note about Csound.\n\n// There are two bitwise NOT operators, ~ and ¬ (U+00AC). The latter is common\n// on keyboards in the United Kingdom\n// .\ninstr TestBitwiseNOT\n print ~42\n print ¬42\nendin\n\n// Csound uses # for bitwise XOR, which the Csound manual calls bitwise\n// non-equivalence .\ninstr TestBitwiseXOR\n print 0 # 0\n print 0 # 1\n print 1 # 0\n print 1 # 1\nendin\n\n// Loops and if-then statements are relatively recent additions to Csound. There\n// are many flow-control opcodes that involve goto and labels.\ninstr TestGoto\n // This...\n if p3 > 0 goto if_label\n goto else_label\nif_label:\n prints \"if branch\\n\"\n goto endif_label\nelse_label:\n prints \"else branch\\n\"\nendif_label:\n\n // ...is the same as this.\n if p3 > 0 then\n prints \"if branch\\n\"\n else\n prints \"else branch\\n\"\n endif\n\n // This...\n iIndex = 0\nloop_label:\n print iIndex\n iIndex += 1\n if iIndex < 10 goto loop_label\n\n // ...is the same as this...\n iIndex = 0\nloop_lt_label:\n print iIndex\n loop_lt iIndex, 1, 10, loop_lt_label\n\n // ...and this.\n iIndex = 0\n while iIndex < 10 do\n print iIndex\n iIndex += 1\n od\nendin\n\n// The prints and printks opcodes\n// , arguably\n// the primary methods of logging output, treat certain sequences of characters\n// different from printf in C.\ninstr TestPrints\n // ^ prints an ESCAPE character (U+001B), not a CIRCUMFLEX ACCENT character\n // (U+005E). ^^ prints a CIRCUMFLEX ACCENT.\n prints \"^^\\n\"\n // ~ prints an ESCAPE character (U+001B) followed by a [, not a TILDE\n // character (U+007E). ~~ prints a TILDE.\n prints \"~~\\n\"\n // \\A, \\B, \\N, \\R, and \\T correspond to the escaped lowercase characters (that\n // is, BELL (U+0007), BACKSPACE (U+0008), new line (U+000A), CARRIAGE RETURN\n // (U+000D), and tab (U+0009)).\n prints \"\\T\\R\\N\"\n // %n, %r, and %t are the same as \\n, \\r, and \\t, as are %N, %R, and %T.\n prints \"%t%r%n\"\n // %! prints a semicolon. This is a hold-over from old versions of Csound that\n // allowed comments to begin in strings.\n prints \"; %!\\n\"\nendin\n\n// The arguments of function-like macros can be separated by # instead of '.\n// These two lines define the same macro.\n#define OSCIL_MACRO(VOLUME'FREQUENCY'TABLE) #oscil $VOLUME, $FREQUENCY, $TABLE#\n#define OSCIL_MACRO(VOLUME#FREQUENCY#TABLE) #oscil $VOLUME, $FREQUENCY, $TABLE#\n\n// Uses of macros can optionally be suffixed with a period.\ninstr TestMacroPeriodSuffix\n aSignal $OSCIL_MACRO.(1'$A_HZ'1)\n prints \"The frequency of the oscillator is $A_HZ.Hz.\\n\"\n out aSignal\nendin\n\n// Csound has @ and @@ operator-like macros that, when followed by a literal\n// non-negative integer, expand to the next power of 2 and the next power of 2\n// plus 1:\n// @x = 2^(ceil(log2(x + 1))), x >= 0\n// @@0 = 2\n// @@x = 2^(ceil(log2(x))) + 1, x > 0\ninstr TestAt\n prints \"%d %2d %2d\\n\", 0, @0, @@0\n prints \"%d %2d %2d\\n\", 1, @1, @@1\n prints \"%d %2d %2d\\n\", 2, @2, @@2\n prints \"%d %2d %2d\\n\", 3, @3, @@3\n prints \"%d %2d %2d\\n\", 4, @4, @@4\n prints \"%d %2d %2d\\n\", 5, @5, @@5\n prints \"%d %2d %2d\\n\", 6, @6, @@6\n prints \"%d %2d %2d\\n\", 7, @7, @@7\n prints \"%d %2d %2d\\n\", 8, @8, @@8\n prints \"%d %2d %2d\\n\", 9, @9, @@9\nendin\n\n// Including newlines in macros can lead to confusing code.\ninstr MacroAbuse\n if 1 == 1 then\n prints \"on\\n\"\n#define FOO#\nBAR\n#endif // This ends the if block. It is not a preprocessor directive.\nendin\n\nscoreline_i {{\nf 1 0 16384 10 1\ni \"N_a_M_e_\" 0 2\ni \"TestOscillator\" 2 2\ni \"TestBitwiseNOT\" 0 1\ni \"TestBitwiseXOR\" 0 1\ni \"TestGoto\" 0 1\ni \"TestMacroPeriodSuffix\" 4 1\ni \"TestAt\" 0 1\ni \"MacroAbuse\" 0 1\ne\n}}\n" }, { "path": "src/test/resources/samples/langs/Csound Document/allglass.csd", "content": "\n\nsr = 44100\nkr = 44100\nksmps = 1\nnchnls = 2\n\n; pvanal -n 512 -w 8 allglass1-L.wav allglass1-L.pvc\n; pvanal -n 512 -w 8 allglass1-R.wav allglass1-R.pvc\ninstr 1\n ktime line 0, p3, 17.5018\n arL pvoc ktime, 1, \"allglass1-L.pvc\"\n arR pvoc ktime, 1, \"allglass1-R.pvc\"\n out arL, arR\nendin\n\n\ni 1 0 70.0073\ne\n\n\n" }, { "path": "src/test/resources/samples/langs/Csound Document/interp.csd", "content": "\n\nsr = 44100\nkr = 44100\nksmps = 1\nnchnls = 2\n\n; pvanal -n 1024 -w 2 partA-L.wav partA-L.pvc\n; pvanal -n 1024 -w 2 partA-R.wav partA-R.pvc\n; pvanal -n 1024 -w 2 partB.wav partB.pvc\ninstr 1\n iscale = 1\n\n ktimpnt1 line 0, iscale*(82196/44100), 82196/44100\n ktimpnt2 linseg 0, iscale*1.25, 0, iscale*(103518/44100), 103518/44100\n kfreqscale linseg 1, iscale*0.5, 1, iscale*1.6, 0.8\n kfreqinterpL linseg 0, iscale*0.25, 0, iscale*1.6, 1\n kampinterpL linseg 0, iscale*0.25, 0, iscale*1.6, 1\n kfreqinterpR linseg 0, iscale*0.5, 0, iscale*1.2, 1\n kampinterpR linseg 0, iscale*0.5, 0, iscale*1.2, 1\n\n pvbufread ktimpnt1, \"partB.pvc\"\n apvcL pvinterp ktimpnt2, 1, \"partA-L.pvc\", kfreqscale, 1, 1, 1, 1-kfreqinterpL, 1-kampinterpL\n pvbufread ktimpnt1, \"partB.pvc\"\n apvcR pvinterp ktimpnt2, 1, \"partA-R.pvc\", kfreqscale, 1, 1, 1, 1-kfreqinterpR, 1-kampinterpR\n\n outs apvcL*0.8, apvcR*0.8\nendin\n\n\ni 1 0 7\ne\n\n\n" }, { "path": "src/test/resources/samples/langs/Csound Document/test.csd", "content": "\n\n// Csound single-line comments can be preceded by a pair of forward slashes...\n; ...or a semicolon.\n\n/* Block comments begin with /* and end with */\n\n// Orchestras begin with a header of audio parameters.\nnchnls = 1\nnchnls_i = 1\nsr = 44100\n0dbfs = 1\nksmps = 10\n\n// The control rate kr = sr / ksmps can be omitted when the number of audio\n// samples in a control period (ksmps) is set, but kr may appear in older\n// orchestras.\nkr = 4410\n\n// Orchestras contain instruments. These begin with the keyword instr followed\n// by a comma-separated list of numbers or names of the instrument. Instruments\n// end at the endin keyword and cannot be nested.\ninstr 1, N_a_M_e_, +Name\n // Instruments contain statements. Here is a typical statement:\n aSignal oscil 0dbfs, 440, 1\n // Statements are terminated with a newline (possibly preceded by a comment).\n // To write a statement on several lines, precede the newline with a\n // backslash.\n prints \\\n \"hello, world\\n\";comment\n\n // Csound 6 introduced function syntax for opcodes with one or zero outputs.\n // The oscil statement above is the same as\n aSignal = oscil(0dbfs, 440, 1)\n\n // Instruments can contain control structures.\n kNote = p3\n if (kNote == 0) then\n kFrequency = 220\n elseif kNote == 1 then // Parentheses around binary expressions are optional.\n kFrequency = 440\n endif\n\n // Csound 6 introduced looping structures.\n iIndex = 0\n while iIndex < 5 do\n print iIndex\n iIndex += 1\n od\n iIndex = 0\n until iIndex >= 5 do\n print iIndex\n iIndex += 1\n enduntil\n // Both kinds of loops can be terminated by either od or enduntil.\n\n // Single-line strings are enclosed in double-quotes.\n prints \"string\\\\\\r\\n\\t\\\"\"\n // Multi-line strings are enclosed in pairs of curly braces.\n prints {{\n hello,\n\n world\n }}\n\n // Instruments often end with a statement containing an output opcode.\n outc aSignal\nendin\n\n// Orchestras can also contain user-defined opcodes (UDOs). Here is an\n// oscillator with one audio-rate output and two control-rate inputs:\nopcode anOscillator, a, kk\n kAmplitude, kFrequency xin\n aSignal vco2 kAmplitude, kFrequency\n xout aSignal\nendop\ninstr TestOscillator\n outc(anOscillator(0dbfs, 110))\nendin\n\n// Python can be executed in Csound\n// . So can Lua\n// .\npyruni {{\nimport random\n\npool = [(1 + i / 10.0) ** 1.2 for i in range(100)]\n\ndef get_number_from_pool(n, p):\n if random.random() < p:\n i = int(random.random() * len(pool))\n pool[i] = n;\n return random.choice(pool)\n}}\n\n// The Csound preprocessor supports conditional compilation and including files.\n#ifdef DEBUG\n#undef DEBUG\n#include \"filename.orc\"\n#endif\n\n// The preprocessor also supports object- and function-like macros. This is an\n// object-like macro that defines a number:\n#define A_HZ #440#\n\n// This is a function-like macro:\n#define OSCIL_MACRO(VOLUME'FREQUENCY'TABLE) #oscil $VOLUME, $FREQUENCY, $TABLE#\n\n// Bodies of macros are enclosed in # and can contain newlines. The arguments of\n// function-like macros are separated by single-quotes. Uses of macros are\n// prefixed with a dollar sign.\ninstr TestMacro\n aSignal $OSCIL_MACRO(1'$A_HZ'1)\n // Not unlike PHP, macros expand in double-quoted strings.\n prints \"The frequency of the oscillator is $A_HZ Hz.\\n\"\n out aSignal\nendin\n\n// Here are other things to note about Csound.\n\n// There are two bitwise NOT operators, ~ and ¬ (U+00AC). The latter is common\n// on keyboards in the United Kingdom\n// .\ninstr TestBitwiseNOT\n print ~42\n print ¬42\nendin\n\n// Csound uses # for bitwise XOR, which the Csound manual calls bitwise\n// non-equivalence .\ninstr TestBitwiseXOR\n print 0 # 0\n print 0 # 1\n print 1 # 0\n print 1 # 1\nendin\n\n// Loops and if-then statements are relatively recent additions to Csound. There\n// are many flow-control opcodes that involve goto and labels.\ninstr TestGoto\n // This...\n if p3 > 0 goto if_label\n goto else_label\nif_label:\n prints \"if branch\\n\"\n goto endif_label\nelse_label:\n prints \"else branch\\n\"\nendif_label:\n\n // ...is the same as this.\n if p3 > 0 then\n prints \"if branch\\n\"\n else\n prints \"else branch\\n\"\n endif\n\n // This...\n iIndex = 0\nloop_label:\n print iIndex\n iIndex += 1\n if iIndex < 10 goto loop_label\n\n // ...is the same as this...\n iIndex = 0\nloop_lt_label:\n print iIndex\n loop_lt iIndex, 1, 10, loop_lt_label\n\n // ...and this.\n iIndex = 0\n while iIndex < 10 do\n print iIndex\n iIndex += 1\n od\nendin\n\n// The prints and printks opcodes\n// , arguably\n// the primary methods of logging output, treat certain sequences of characters\n// different from printf in C.\ninstr TestPrints\n // ^ prints an ESCAPE character (U+001B), not a CIRCUMFLEX ACCENT character\n // (U+005E). ^^ prints a CIRCUMFLEX ACCENT.\n prints \"^^\\n\"\n // ~ prints an ESCAPE character (U+001B) followed by a [, not a TILDE\n // character (U+007E). ~~ prints a TILDE.\n prints \"~~\\n\"\n // \\A, \\B, \\N, \\R, and \\T correspond to the escaped lowercase characters (that\n // is, BELL (U+0007), BACKSPACE (U+0008), new line (U+000A), CARRIAGE RETURN\n // (U+000D), and tab (U+0009)).\n prints \"\\T\\R\\N\"\n // %n, %r, and %t are the same as \\n, \\r, and \\t, as are %N, %R, and %T.\n prints \"%t%r%n\"\n // %! prints a semicolon. This is a hold-over from old versions of Csound that\n // allowed comments to begin in strings.\n prints \"; %!\\n\"\nendin\n\n// The arguments of function-like macros can be separated by # instead of '.\n// These two lines define the same macro.\n#define OSCIL_MACRO(VOLUME'FREQUENCY'TABLE) #oscil $VOLUME, $FREQUENCY, $TABLE#\n#define OSCIL_MACRO(VOLUME#FREQUENCY#TABLE) #oscil $VOLUME, $FREQUENCY, $TABLE#\n\n// Uses of macros can optionally be suffixed with a period.\ninstr TestMacroPeriodSuffix\n aSignal $OSCIL_MACRO.(1'$A_HZ'1)\n prints \"The frequency of the oscillator is $A_HZ.Hz.\\n\"\n out aSignal\nendin\n\n// Csound has @ and @@ operator-like macros that, when followed by a literal\n// non-negative integer, expand to the next power of 2 and the next power of 2\n// plus 1:\n// @x = 2^(ceil(log2(x + 1))), x >= 0\n// @@0 = 2\n// @@x = 2^(ceil(log2(x))) + 1, x > 0\ninstr TestAt\n prints \"%d %2d %2d\\n\", 0, @0, @@0\n prints \"%d %2d %2d\\n\", 1, @1, @@1\n prints \"%d %2d %2d\\n\", 2, @2, @@2\n prints \"%d %2d %2d\\n\", 3, @3, @@3\n prints \"%d %2d %2d\\n\", 4, @4, @@4\n prints \"%d %2d %2d\\n\", 5, @5, @@5\n prints \"%d %2d %2d\\n\", 6, @6, @@6\n prints \"%d %2d %2d\\n\", 7, @7, @@7\n prints \"%d %2d %2d\\n\", 8, @8, @@8\n prints \"%d %2d %2d\\n\", 9, @9, @@9\nendin\n\n// Including newlines in macros can lead to confusing code.\ninstr MacroAbuse\n if 1 == 1 then\n prints \"on\\n\"\n#define FOO#\nBAR\n#endif // This ends the if block. It is not a preprocessor directive.\nendin\n\n\nf 1 0 16384 10 1\ni \"N_a_M_e_\" 0 2\ni \"TestOscillator\" 2 2\ni \"TestBitwiseNOT\" 0 1\ni \"TestBitwiseXOR\" 0 1\ni \"TestGoto\" 0 1\ni \"TestMacroPeriodSuffix\" 4 1\ni \"TestAt\" 0 1\ni \"MacroAbuse\" 0 1\ne\n\n\n" }, { "path": "src/test/resources/samples/langs/Csound Score/allglass.sco", "content": "i 1 0 70.0073\ne\n" }, { "path": "src/test/resources/samples/langs/Csound Score/interp.sco", "content": "i 1 0 7\ne\n" }, { "path": "src/test/resources/samples/langs/Csound Score/test.sco", "content": "f 1 0 16384 10 1\ni \"N_a_M_e_\" 0 2\ni \"TestOscillator\" 2 2\ni \"TestBitwiseNOT\" 0 1\ni \"TestBitwiseXOR\" 0 1\ni \"TestGoto\" 0 1\ni \"TestMacroPeriodSuffix\" 4 1\ni \"TestAt\" 0 1\ni \"MacroAbuse\" 0 1\ne\n" }, { "path": "src/test/resources/samples/langs/Cuda/scalarProd_kernel.cuh", "content": "__global__ void scalarProdGPU(\n float *d_C,\n float *d_A,\n float *d_B,\n int vectorN,\n int elementN\n)\n{\n //Accumulators cache\n __shared__ float accumResult[ACCUM_N];\n\n ////////////////////////////////////////////////////////////////////////////\n // Cycle through every pair of vectors,\n // taking into account that vector counts can be different\n // from total number of thread blocks\n ////////////////////////////////////////////////////////////////////////////\n for (int vec = blockIdx.x; vec < vectorN; vec += gridDim.x)\n {\n int vectorBase = IMUL(elementN, vec);\n int vectorEnd = vectorBase + elementN;\n\n ////////////////////////////////////////////////////////////////////////\n // Each accumulator cycles through vectors with\n // stride equal to number of total number of accumulators ACCUM_N\n // At this stage ACCUM_N is only preferred be a multiple of warp size\n // to meet memory coalescing alignment constraints.\n ////////////////////////////////////////////////////////////////////////\n for (int iAccum = threadIdx.x; iAccum < ACCUM_N; iAccum += blockDim.x)\n {\n float sum = 0;\n\n for (int pos = vectorBase + iAccum; pos < vectorEnd; pos += ACCUM_N)\n sum += d_A[pos] * d_B[pos];\n\n accumResult[iAccum] = sum;\n }\n\n ////////////////////////////////////////////////////////////////////////\n // Perform tree-like reduction of accumulators' results.\n // ACCUM_N has to be power of two at this stage\n ////////////////////////////////////////////////////////////////////////\n for (int stride = ACCUM_N / 2; stride > 0; stride >>= 1)\n {\n __syncthreads();\n\n for (int iAccum = threadIdx.x; iAccum < stride; iAccum += blockDim.x)\n accumResult[iAccum] += accumResult[stride + iAccum];\n }\n\n if (threadIdx.x == 0) d_C[vec] = accumResult[0];\n }\n}" }, { "path": "src/test/resources/samples/langs/Cuda/vectorAdd.cu", "content": "#include \n#include \n\n/**\n * CUDA Kernel Device code\n *\n * Computes the vector addition of A and B into C. The 3 vectors have the same\n * number of elements numElements.\n */\n__global__ void\nvectorAdd(const float *A, const float *B, float *C, int numElements)\n{\n int i = blockDim.x * blockIdx.x + threadIdx.x;\n\n if (i < numElements)\n {\n C[i] = A[i] + B[i];\n }\n}\n\n/**\n * Host main routine\n */\nint\nmain(void)\n{\n // Error code to check return values for CUDA calls\n cudaError_t err = cudaSuccess;\n\n // Launch the Vector Add CUDA Kernel\n int threadsPerBlock = 256;\n int blocksPerGrid =(numElements + threadsPerBlock - 1) / threadsPerBlock;\n vectorAdd<<>>(d_A, d_B, d_C, numElements);\n err = cudaGetLastError();\n\n if (err != cudaSuccess)\n {\n fprintf(stderr, \"Failed to launch vectorAdd kernel (error code %s)!\\n\", cudaGetErrorString(err));\n exit(EXIT_FAILURE);\n }\n\n // Reset the device and exit\n err = cudaDeviceReset();\n\n return 0;\n}" }, { "path": "src/test/resources/samples/langs/Cycript/utils.cy", "content": "(function(utils) {\n\t// Load C functions declared in utils.loadFuncs\n\tvar shouldLoadCFuncs = true;\n\t// Expose the C functions to cycript's global scope\n\tvar shouldExposeCFuncs = true;\n\t// Expose C constants to cycript's global scope\n\tvar shouldExposeConsts = true;\n\t// Expose functions defined here to cycript's global scope\n\tvar shouldExposeFuncs = true;\n\t// Which functions to expose\n\tvar funcsToExpose = [\"exec\", \"include\", \"sizeof\", \"logify\", \"apply\", \"str2voidPtr\", \"voidPtr2str\", \"double2voidPtr\", \"voidPtr2double\", \"isMemoryReadable\", \"isObject\", \"makeStruct\"];\n\t\n\t// C functions that utils.loadFuncs loads\n\tvar CFuncsDeclarations = [\n\t\t// \n\t\t\"void *calloc(size_t num, size_t size)\",\n\t\t// \n\t\t\"char *strcpy(char *restrict dst, const char *restrict src)\",\n\t\t\"char *strdup(const char *s1)\",\n\t\t\"void* memset(void* dest, int ch, size_t count)\",\n\t\t// \n\t\t\"FILE *fopen(const char *, const char *)\",\n\t\t\"int fclose(FILE *)\",\n\t\t\"size_t fread(void *restrict, size_t, size_t, FILE *restrict)\",\n\t\t\"size_t fwrite(const void *restrict, size_t, size_t, FILE *restrict)\",\n\t\t// \n\t\t\"mach_port_t mach_task_self()\",\n\t\t\"kern_return_t task_for_pid(mach_port_name_t target_tport, int pid, mach_port_name_t *tn)\",\n\t\t\"kern_return_t mach_vm_protect(vm_map_t target_task, mach_vm_address_t address, mach_vm_size_t size, boolean_t set_maximum, vm_prot_t new_protection)\",\n\t\t\"kern_return_t mach_vm_write(vm_map_t target_task, mach_vm_address_t address, vm_offset_t data, mach_msg_type_number_t dataCnt)\",\n\t\t\"kern_return_t mach_vm_read(vm_map_t target_task, mach_vm_address_t address, mach_vm_size_t size, vm_offset_t *data, mach_msg_type_number_t *dataCnt)\",\n\t];\n\t\n\t/*\n\t\tReplacement for eval that can handle @encode etc.\n\t\t\n\t\tUsage:\n\t\t\tcy# utils.exec(\"@encode(void *(int, char))\")\n\t\t\t@encode(void*(int,char))\n\t*/\n\tutils.exec = function(str) {\n\t\tvar mkdir = @encode(int (const char *, int))(dlsym(RTLD_DEFAULT, \"mkdir\"));\n\t\tvar tempnam = @encode(char *(const char *, const char *))(dlsym(RTLD_DEFAULT, \"tempnam\"));\n\t\tvar fopen = @encode(void *(const char *, const char *))(dlsym(RTLD_DEFAULT, \"fopen\"));\n\t\tvar fclose = @encode(int (void *))(dlsym(RTLD_DEFAULT, \"fclose\"));\n\t\tvar fwrite = @encode(int (const char *, int, int, void *))(dlsym(RTLD_DEFAULT, \"fwrite\"));\n\t\tvar symlink = @encode(int (const char *, const char *))(dlsym(RTLD_DEFAULT, \"symlink\"));\n\t\tvar unlink = @encode(int (const char *))(dlsym(RTLD_DEFAULT, \"unlink\"));\n\t\tvar getenv = @encode(const char *(const char *))(dlsym(RTLD_DEFAULT, \"getenv\"));\n\t\tvar setenv = @encode(int (const char *, const char *, int))(dlsym(RTLD_DEFAULT, \"setenv\"));\n\t\t\n\t\tvar libdir = \"/usr/lib/cycript0.9\";\n\t\tvar dir = libdir + \"/tmp\";\n\n\t\tmkdir(dir, 0777);\n\t\t\n\t\t// This is needed because tempnam seems to ignore the first argument on i386\n\t\tvar old_tmpdir = getenv(\"TMPDIR\");\n\t\tsetenv(\"TMPDIR\", dir, 1);\n\n\t\t// No freeing :(\n\t\tvar f = tempnam(dir, \"exec-\");\n\t\tsetenv(\"TMPDIR\", old_tmpdir, 1);\n\t\tif(!f) {\n\t\t\treturn false;\n\t\t}\n\n\t\tsymlink(f, f + \".cy\");\n\t\t\n\t\tstr = \"exports.result = \" + str;\n\n\t\tvar handle = fopen(f, \"w\");\n\t\tfwrite(str, str.length, 1, handle);\n\t\tfclose(handle);\n\t\t\n\t\tvar r;\n\t\tvar except = null;\n\t\ttry {\n\t\t\tr = require(f.replace(libdir + \"/\", \"\"));\n\t\t} catch(e) {\n\t\t\texcept = e;\n\t\t}\n\n\t\tunlink(f + \".cy\");\n\t\tunlink(f);\n\t\t\n\t\tif(except !== null) {\n\t\t\tthrow except;\n\t\t}\n\n\t\treturn r.result;\n\t};\n\t\n\t/*\n\t\tApplies known typedefs\n\t\tUsed in utils.include and utils.makeStruct\n\t\t\n\t\tUsage:\n\t\t\tcy# utils.applyTypedefs(\"mach_vm_address_t\")\n\t\t\t\"uint64_t\"\n\t*/\n\tutils.applyTypedefs = function(str) {\n\t\tvar typedefs = {\n\t\t\t\"struct\": \"\",\n\t\t\t\"restrict\": \"\",\n\t\t\t\"FILE\": \"void\",\n\t\t\t\"size_t\": \"uint64_t\",\n\t\t\t\"uintptr_t\": \"unsigned long\",\n\t\t\t\"kern_return_t\": \"int\",\n\t\t\t\"mach_port_t\": \"unsigned int\",\n\t\t\t\"mach_port_name_t\": \"unsigned int\",\n\t\t\t\"vm_offset_t\": \"unsigned long\",\n\t\t\t\"vm_size_t\": \"unsigned long\",\n\t\t\t\"mach_vm_address_t\": \"uint64_t\",\n\t\t\t\"mach_vm_offset_t\": \"uint64_t\",\n\t\t\t\"mach_vm_size_t\": \"uint64_t\",\n\t\t\t\"vm_map_offset_t\": \"uint64_t\",\n\t\t\t\"vm_map_address_t\": \"uint64_t\",\n\t\t\t\"vm_map_size_t\": \"uint64_t\",\n\t\t\t\"mach_port_context_t\": \"uint64_t\",\n\t\t\t\"vm_map_t\": \"unsigned int\",\n\t\t\t\"boolean_t\": \"unsigned int\",\n\t\t\t\"vm_prot_t\": \"int\",\n\t\t\t\"mach_msg_type_number_t\": \"unsigned int\",\n\t\t\t\"cpu_type_t\": \"int\",\n\t\t\t\"cpu_subtype_t\": \"int\",\n\t\t\t\"cpu_threadtype_t\": \"int\",\n\t\t};\n\t\t\n\t\tfor(var k in typedefs) {\n\t\t\tstr = str.replace(new RegExp(\"(\\\\s|\\\\*|,|\\\\(|^)\" + k + \"(\\\\s|\\\\*|,|\\\\)|$)\", \"g\"), \"$1\" + typedefs[k] + \"$2\");\n\t\t}\n\t\t\n\t\treturn str;\n\t};\n\t\n\t/*\n\t\tParses a C function declaration and returns the function name and cycript type\n\t\tIf load is true, tries to load it into cycript using utils.exec\n\t\t\n\t\tUsage:\n\t\t\tcy# var str = \"void *calloc(size_t num, size_t size)\";\n\t\t\t\"void *calloc(size_t num, size_t size)\"\n\t\t\tcy# utils.include(str)\n\t\t\t[\"calloc\",\"@encode(void *(uint64_t num, uint64_t size))(140735674376857)\"]\n\t\t\tcy# var ret = utils.include(str, true)\n\t\t\t[\"calloc\",0x7fff93e0e299]\n\t\t\tcy# ret[1].type\n\t\t\t@encode(void*(unsigned long long int,unsigned long long int))\n\t\t\tcy# ret[1](100, 1)\n\t\t\t0x100444100\n\t*/\n\tutils.include = function(str, load) {\n\t\tvar re = /^\\s*([^(]*(?:\\s+|\\*))(\\w*)\\s*\\(([^)]*)\\)\\s*;?\\s*$/;\n\t\tvar match = re.exec(str);\n\t\tif(!match) {\n\t\t\treturn -1;\n\t\t}\n\t\tvar rType = utils.applyTypedefs(match[1]);\n\t\tvar name = match[2];\n\t\tvar args = match[3];\n\n\t\tvar argsRe = /([^,]+)(?:,|$)/g;\n\t\tvar argsTypes = [];\n\t\twhile((match = argsRe.exec(args)) !== null) {\n\t\t\tvar type = utils.applyTypedefs(match[1]);\n\t\t\targsTypes.push(type);\n\t\t}\n\t\t\n\t\tvar encodeString = \"@encode(\";\n\t\tencodeString += rType + \"(\";\n\t\tencodeString += argsTypes.join(\", \") + \"))\";\n\n\t\tvar fun = dlsym(RTLD_DEFAULT, name);\n\t\tif(fun !== null) {\n\t\t\tencodeString += \"(\" + fun + \")\";\n\t\t\tif(load) {\n\t\t\t\treturn [name, utils.exec(encodeString)];\n\t\t\t}\n\t\t} else if(load) {\n\t\t\tthrow \"Function couldn't be found with dlsym!\";\n\t\t}\n\n\t\treturn [name, encodeString];\n\t};\n\t\n\t/*\n\t\tLoads the function declaration in the defs array using utils.exec and exposes to cycript's global scope\n\t\tIs automatically called if shouldLoadCFuncs is true\n\t*/\n\tutils.funcs = {};\n\tutils.loadfuncs = function(expose) {\n\t\tfor(var i = 0; i < CFuncsDeclarations.length; i++) {\n\t\t\ttry {\n\t\t\t\tvar o = utils.include(CFuncsDeclarations[i], true);\n\t\t\t\tutils.funcs[o[0]] = o[1];\n\t\t\t\tif(expose) {\n\t\t\t\t\tCycript.all[o[0]] = o[1];\n\t\t\t\t}\n\t\t\t} catch(e) {\n\t\t\t\tsystem.print(\"Failed to load function: \" + i);\n\t\t\t\ttry {\n\t\t\t\t\tsystem.print(utils.include(CFuncsDeclarations[i]));\n\t\t\t\t} catch(e2) {\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t};\n\t\n\t/*\n\t\tCalculates the size of a type like the C operator sizeof\n\t\t\n\t\tUsage:\n\t\t\tcy# utils.sizeof(int)\n\t\t\t4\n\t\t\tcy# utils.sizeof(@encode(void *))\n\t\t\t8\n\t\t\tcy# utils.sizeof(\"mach_vm_address_t\")\n\t\t\t8\n\t*/\n\tutils.sizeof = function(type) {\n\t\tif(typeof type === \"string\") {\n\t\t\ttype = utils.applyTypedefs(type);\n\t\t\ttype = utils.exec(\"@encode(\" + type + \")\");\n\t\t}\n\t\t\n\t\t// (const) char * has \"infinite\" preceision\n\t\tif(type.toString().slice(-1) === \"*\") {\n\t\t\treturn utils.sizeof(@encode(void *));\n\t\t}\n\t\t\n\t\t// float and double\n\t\tif(type.toString() === @encode(float).toString()) {\n\t\t\treturn 4;\n\t\t} else if (type.toString() === @encode(double).toString()) {\n\t\t\treturn 8;\n\t\t}\n\n\t\tvar typeInstance = type(0);\n\t\t\n\t\tif(typeInstance instanceof Object) {\n\t\t\t// Arrays\n\t\t\tif(\"length\" in typeInstance) {\n\t\t\t\treturn typeInstance.length * utils.sizeof(typeInstance.type);\n\t\t\t}\n\t\t\t\n\t\t\t// Structs\n\t\t\tif(typeInstance.toString() === \"[object Struct]\") {\n\t\t\t\tvar typeStr = type.toString();\n\t\t\t\tvar arrayTypeStr = \"[2\" + typeStr + \"]\";\n\t\t\t\tvar arrayType = new Type(arrayTypeStr);\n\t\t\t\t\n\t\t\t\tvar arrayInstance = new arrayType;\n\t\t\t\t\n\t\t\t\treturn @encode(void *)(&(arrayInstance[1])) - @encode(void *)(&(arrayInstance[0]));\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor(var i = 0; i < 5; i++) {\n\t\t\tvar maxSigned = Math.pow(2, 8 * Math.pow(2, i) - 1) - 1;\n\t\t\tif(i === 3) {\n\t\t\t\t// Floating point fix ;^)\n\t\t\t\tmaxSigned /= 1000;\n\t\t\t}\n\n\t\t\t// can't use !== or sizeof(void *) === 0.5\n\t\t\tif(type(maxSigned) != maxSigned) {\n\t\t\t\treturn Math.pow(2, i - 1);\n\t\t\t}\n\t\t}\n\t};\n\t\n\t/*\n\t\tLogs a specific message sent to an instance of a class like logify.pl in theos\n\t\tRequires Cydia Substrate (com.saurik.substrate.MS) and NSLog (org.cycript.NSLog) modules\n\t\tReturns the old message returned by MS.hookMessage (Note: this is not just the old message!)\n\t\t\n\t\tUsage:\n\t\t\tcy# var oldm = utils.logify(objc_getMetaClass(NSNumber), @selector(numberWithDouble:))\n\t\t\t...\n\t\t\tcy# var n = [NSNumber numberWithDouble:1.5]\n\t\t\t2014-07-28 02:26:39.805 cycript[71213:507] +[ numberWithDouble:1.5]\n\t\t\t2014-07-28 02:26:39.806 cycript[71213:507] = 1.5\n\t\t\t@1.5\n\t*/\n\tutils.logify = function(cls, sel) {\n\t\t@import com.saurik.substrate.MS;\n\t\t@import org.cycript.NSLog;\n\t\t\n\t\tvar oldm = {};\n\t\t\n\t\tMS.hookMessage(cls, sel, function() {\n\t\t\tvar args = [].slice.call(arguments);\n\t\t\t\n\t\t\tvar selFormat = sel.toString().replace(/:/g, \":%@ \").trim();\n\t\t\tvar logFormat = \"%@[<%@: 0x%@> \" + selFormat + \"]\";\n\t\t\t\n\t\t\tvar standardArgs = [logFormat, class_isMetaClass(cls)? \"+\": \"-\", cls.toString(), (&this).valueOf().toString(16)];\n\t\t\tvar logArgs = standardArgs.concat(args);\n\t\t\t\n\t\t\tNSLog.apply(null, logArgs);\n\t\t\t\n\t\t\tvar r = oldm->apply(this, arguments);\n\t\t\t\n\t\t\tif(r !== undefined) {\n\t\t\t\tNSLog(\" = %@\", r);\n\t\t\t}\n\t\t\t\n\t\t\treturn r;\n\t\t}, oldm);\n\t\t\n\t\treturn oldm;\n\t};\n\t\n\t/*\n\t\tCalls a C function by providing its name and arguments\n\t\tDoesn't support structs\n\t\tReturn value is always a void pointer\n\t\t\n\t\tUsage:\n\t\t\tcy# utils.apply(\"printf\", [\"%s %.3s, %d -> %c, float: %f\\n\", \"foo\", \"barrrr\", 97, 97, 1.5])\n\t\t\tfoo bar, 97 -> a, float: 1.500000\n\t\t\t0x22\n\t*/\n\tutils.apply = function(fun, args) {\n\t\tif(!(args instanceof Array)) {\n\t\t\tthrow \"Args needs to be an array!\";\n\t\t}\n\t\t\n\t\tvar argc = args.length;\n\t\tvar voidPtr = @encode(void *);\n\t\tvar argTypes = [];\n\t\tfor(var i = 0; i < argc; i++) {\n\t\t\tvar argType = voidPtr;\n\t\t\t\n\t\t\tvar arg = args[i];\n\t\t\tif(typeof arg === \"string\") {\n\t\t\t\targType = @encode(char *);\n\t\t\t}\n\t\t\tif(typeof arg === \"number\" && arg % 1 !== 0) {\n\t\t\t\targType = @encode(double);\n\t\t\t}\n\t\t\t\n\t\t\targTypes.push(argType);\n\t\t}\n\t\t\n\t\tvar type = voidPtr.functionWith.apply(voidPtr, argTypes);\n\t\t\n\t\tif(typeof fun === \"string\") {\n\t\t\tfun = dlsym(RTLD_DEFAULT, fun);\n\t\t}\n\t\t\n\t\tif(!fun) {\n\t\t\tthrow \"Function not found!\";\n\t\t}\n\n\t\treturn type(fun).apply(null, args);\n\t};\n\t\n\t/*\n\t\tConverts a string (char *) to a void pointer (void *)\n\t\tYou can't cast to strings to void pointers and vice versa in cycript. Blame saurik.\n\t\t\n\t\tUsage:\n\t\t\tcy# var voidPtr = utils.str2voidPtr(\"foobar\")\n\t\t\t0x100331590\n\t\t\tcy# utils.voidPtr2str(voidPtr)\n\t\t\t\"foobar\"\n\t*/\n\tutils.str2voidPtr = function(str) {\n\t\tvar strdup = @encode(void *(char *))(dlsym(RTLD_DEFAULT, \"strdup\"));\n\t\treturn strdup(str);\n\t};\n\t\n\t/*\n\t\tThe inverse function of str2voidPtr\n\t*/\n\tutils.voidPtr2str = function(voidPtr) {\n\t\tvar strdup = @encode(char *(void *))(dlsym(RTLD_DEFAULT, \"strdup\"));\n\t\treturn strdup(voidPtr);\n\t};\n\t\n\t/*\n\t\tConverts a double into a void pointer\n\t\tThis can be used to view the binary representation of a floating point number\n\t\t\n\t\tUsage:\n\t\t\tcy# var n = utils.double2voidPtr(-1.5)\n\t\t\t0xbff8000000000000\n\t\t\tcy# utils.voidPtr2double(n)\n\t\t\t-1.5\n\t*/\n\tutils.double2voidPtr = function(n) {\n\t\tvar doublePtr = new double;\n\t\t*doublePtr = n;\n\t\t\n\t\tvar voidPtrPtr = @encode(void **)(doublePtr);\n\t\t\n\t\treturn *voidPtrPtr;\n\t};\n\t\n\t/*\n\t\tThe inverse function of double2voidPtr\n\t*/\n\tutils.voidPtr2double = function(voidPtr) {\n\t\tvar voidPtrPtr = new @encode(void **);\n\t\t*voidPtrPtr = voidPtr;\n\t\t\n\t\tvar doublePtr = @encode(double *)(voidPtrPtr);\n\t\t\n\t\treturn *doublePtr;\n\t};\n\t\n\t/*\n\t\tDetermines in a safe way if a memory location is readable\n\t\t\n\t\tUsage:\n\t\t\tcy# utils.isMemoryReadable(0)\n\t\t\tfalse\n\t\t\tcy# utils.isMemoryReadable(0x1337)\n\t\t\tfalse\n\t\t\tcy# utils.isMemoryReadable(NSObject)\n\t\t\ttrue\n\t\t\tcy# var a = malloc(100); utils.isMemoryReadable(a)\n\t\t\ttrue\n\t*/\n\tutils.isMemoryReadable = function(ptr) {\n\t\tif(typeof ptr === \"string\") {\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tvar fds = new @encode(int [2]);\n\t\tutils.apply(\"pipe\", [fds]);\n\t\tvar result = utils.apply(\"write\", [fds[1], ptr, 1]) == 1;\n\t\t\n\t\tutils.apply(\"close\", [fds[0]]);\n\t\tutils.apply(\"close\", [fds[1]]);\n\t\t\n\t\treturn result;\n\t};\n\t\n\t/*\n\t\tDetermines in a safe way if the memory location contains an Objective-C object\n\n\t\tUsage:\n\t\t\tcy# utils.isObject(0)\n\t\t\tfalse\n\t\t\tcy# utils.isObject(0x1337)\n\t\t\tfalse\n\t\t\tcy# utils.isObject(NSObject)\n\t\t\ttrue\n\t\t\tcy# utils.isObject(objc_getMetaClass(NSObject))\n\t\t\ttrue\n\t\t\tcy# utils.isObject([new NSObject init])\n\t\t\ttrue\n\t\t\tcy# var a = malloc(100); utils.isObject(a)\n\t\t\tfalse\n\t\t\tcy# *@encode(void **)(a) = NSObject; utils.isObject(a)\n\t\t\ttrue\n\t*/\n\tutils.isObject = function(obj) {\n\t\tobj = @encode(void *)(obj);\n\t\tvar lastObj = -1;\n\t\t\n\t\tfunction objc_isa_ptr(obj) {\n\t\t\t// See http://www.sealiesoftware.com/blog/archive/2013/09/24/objc_explain_Non-pointer_isa.html\n\t\t\tvar objc_debug_isa_class_mask = 0x00000001fffffffa;\n\t\t\tobj = (obj & 1)? (obj & objc_debug_isa_class_mask): obj;\n\t\t\t\n\t\t\tif((obj & (utils.sizeof(@encode(void *)) - 1)) != 0) {\n\t\t\t\treturn null;\n\t\t\t} else {\n\t\t\t\treturn obj;\n\t\t\t}\n\t\t}\n\t\t\n\t\tfunction ptrValue(obj) {\n\t\t\treturn obj? obj.valueOf(): null;\n\t\t}\n\t\t\n\t\tvar foundMetaClass = false;\n\t\t\n\t\tfor(obj = objc_isa_ptr(obj); utils.isMemoryReadable(obj); ) {\n\t\t\tobj = *@encode(void **)(obj);\n\t\t\t\n\t\t\tif(ptrValue(obj) == ptrValue(lastObj)) {\n\t\t\t\tfoundMetaClass = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tlastObj = obj;\n\t\t}\n\t\t\n\t\tif(!foundMetaClass) {\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tif(lastObj === -1 || lastObj === null) {\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tvar obj_class = objc_isa_ptr(@encode(void **)(obj)[1]);\n\t\t\n\t\tif(!utils.isMemoryReadable(obj_class)) {\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tvar metaclass = objc_isa_ptr(@encode(void **)(obj_class)[0]);\n\t\tvar superclass = objc_isa_ptr(@encode(void **)(obj_class)[1]);\n\t\t\n\t\treturn ptrValue(obj) == ptrValue(metaclass) && superclass == null;\n\t};\n\t\n\t/*\n\t\tCreates a cycript struct type from a C struct definition\n\t\t\n\t\tUsage:\n\t\t\tcy# var foo = makeStruct(\"int a; short b; char c; uint64_t d; double e;\", \"foo\");\n\t\t\t@encode(foo)\n\t\t\tcy# var f = new foo\n\t\t\t&{a:0,b:0,c:0,d:0,e:0}\n\t\t\tcy# f->a = 100; f\n\t\t\t&{a:100,b:0,c:0,d:0,e:0}\n\t\t\tcy# *@encode(int *)(f)\n\t\t\t100\n\t*/\n\tutils.makeStruct = function(str, name) {\t\t\n\t\tvar fieldRe = /(?:\\s|\\n)*([^;]+\\s*(?:\\s|\\*))([^;]+)\\s*;/g;\n\t\t\n\t\tif(!name) {\n\t\t\tname = \"struct\" + Math.floor(Math.random() * 100000);\n\t\t}\n\t\tvar typeStr = \"{\" + name + \"=\";\n\t\t\n\t\twhile((match = fieldRe.exec(str)) !== null) {\n\t\t\tvar fieldType = utils.applyTypedefs(match[1]);\n\t\t\tvar fieldName = match[2];\n\t\t\tvar encodedType = utils.exec(\"@encode(\" + fieldType + \")\").toString();\n\t\t\t\n\t\t\ttypeStr += '\"' + fieldName + '\"' + encodedType;\n\t\t}\n\t\t\n\t\ttypeStr += \"}\";\n\t\t\n\t\treturn new Type(typeStr);\n\t};\n\t\n\t// Various constants\n\tutils.constants = {\n\t\tVM_PROT_NONE: 0x0,\n\t\tVM_PROT_READ: 0x1,\n\t\tVM_PROT_WRITE: 0x2,\n\t\tVM_PROT_EXECUTE: 0x4,\n\t\tVM_PROT_NO_CHANGE: 0x8,\n\t\tVM_PROT_COPY: 0x10,\n\t\tVM_PROT_WANTS_COPY: 0x10,\n\t\tVM_PROT_IS_MASK: 0x40,\n\t};\n\tvar c = utils.constants;\n\tc.VM_PROT_DEFAULT = c.VM_PROT_READ | c.VM_PROT_WRITE;\n\tc.VM_PROT_ALL = c.VM_PROT_READ | c.VM_PROT_WRITE | c.VM_PROT_EXECUTE;\n\t\n\tif(shouldExposeConsts) {\n\t\tfor(var k in c) {\n\t\t\tCycript.all[k] = c[k];\n\t\t}\n\t}\n\t\n\tif(shouldExposeFuncs) {\n\t\tfor(var i = 0; i < funcsToExpose.length; i++) {\n\t\t\tvar name = funcsToExpose[i];\n\t\t\tCycript.all[name] = utils[name];\n\t\t}\n\t}\n\t\n\tif(shouldLoadCFuncs) {\n\t\tutils.loadfuncs(shouldExposeCFuncs);\n\t}\n})(exports);\n" }, { "path": "src/test/resources/samples/langs/D/aa.d", "content": "/**\n * Implementation of associative arrays.\n *\n * Copyright: Martin Nowak 2015 -.\n * License: $(LINK2 http://www.boost.org/LICENSE_1_0.txt, Boost License 1.0)\n * Authors: Martin Nowak\n */\nmodule core.aa;\n\nimport core.memory : GC;\n\nprivate\n{\n // grow threshold\n enum GROW_NUM = 4;\n enum GROW_DEN = 5;\n // shrink threshold\n enum SHRINK_NUM = 1;\n enum SHRINK_DEN = 8;\n // grow factor\n enum GROW_FAC = 4;\n // growing the AA doubles it's size, so the shrink threshold must be\n // smaller than half the grow threshold to have a hysteresis\n static assert(GROW_FAC * SHRINK_NUM * GROW_DEN < GROW_NUM * SHRINK_DEN);\n // initial load factor (for literals), mean of both thresholds\n enum INIT_NUM = (GROW_DEN * SHRINK_NUM + GROW_NUM * SHRINK_DEN) / 2;\n enum INIT_DEN = SHRINK_DEN * GROW_DEN;\n\n // magic hash constants to distinguish empty, deleted, and filled buckets\n enum HASH_EMPTY = 0;\n enum HASH_DELETED = 0x1;\n enum HASH_FILLED_MARK = size_t(1) << 8 * size_t.sizeof - 1;\n}\n\nenum INIT_NUM_BUCKETS = 8;\n\nstruct AA(Key, Val)\n{\n this(size_t sz)\n {\n impl = new Impl(nextpow2(sz));\n }\n\n @property bool empty() const pure nothrow @safe @nogc\n {\n return !length;\n }\n\n @property size_t length() const pure nothrow @safe @nogc\n {\n return impl is null ? 0 : impl.length;\n }\n\n void opIndexAssign(Val val, in Key key)\n {\n // lazily alloc implementation\n if (impl is null)\n impl = new Impl(INIT_NUM_BUCKETS);\n\n // get hash and bucket for key\n immutable hash = calcHash(key);\n\n // found a value => assignment\n if (auto p = impl.findSlotLookup(hash, key))\n {\n p.entry.val = val;\n return;\n }\n\n auto p = findSlotInsert(hash);\n if (p.deleted)\n --deleted;\n // check load factor and possibly grow\n else if (++used * GROW_DEN > dim * GROW_NUM)\n {\n grow();\n p = findSlotInsert(hash);\n assert(p.empty);\n }\n\n // update search cache and allocate entry\n firstUsed = min(firstUsed, cast(uint)(p - buckets.ptr));\n p.hash = hash;\n p.entry = new Impl.Entry(key, val); // TODO: move\n return;\n }\n\n ref inout(Val) opIndex(in Key key) inout @trusted\n {\n auto p = opIn_r(key);\n assert(p !is null);\n return *p;\n }\n\n inout(Val)* opIn_r(in Key key) inout @trusted\n {\n if (empty)\n return null;\n\n immutable hash = calcHash(key);\n if (auto p = findSlotLookup(hash, key))\n return &p.entry.val;\n return null;\n }\n\n bool remove(in Key key)\n {\n if (empty)\n return false;\n\n immutable hash = calcHash(key);\n if (auto p = findSlotLookup(hash, key))\n {\n // clear entry\n p.hash = HASH_DELETED;\n p.entry = null;\n\n ++deleted;\n if (length * SHRINK_DEN < dim * SHRINK_NUM)\n shrink();\n\n return true;\n }\n return false;\n }\n\n Val get(in Key key, lazy Val val)\n {\n auto p = opIn_r(key);\n return p is null ? val : *p;\n }\n\n ref Val getOrSet(in Key key, lazy Val val)\n {\n // lazily alloc implementation\n if (impl is null)\n impl = new Impl(INIT_NUM_BUCKETS);\n\n // get hash and bucket for key\n immutable hash = calcHash(key);\n\n // found a value => assignment\n if (auto p = impl.findSlotLookup(hash, key))\n return p.entry.val;\n\n auto p = findSlotInsert(hash);\n if (p.deleted)\n --deleted;\n // check load factor and possibly grow\n else if (++used * GROW_DEN > dim * GROW_NUM)\n {\n grow();\n p = findSlotInsert(hash);\n assert(p.empty);\n }\n\n // update search cache and allocate entry\n firstUsed = min(firstUsed, cast(uint)(p - buckets.ptr));\n p.hash = hash;\n p.entry = new Impl.Entry(key, val);\n return p.entry.val;\n }\n\n /**\n Convert the AA to the type of the builtin language AA.\n */\n Val[Key] toBuiltinAA() pure nothrow\n {\n return cast(Val[Key]) _aaFromCoreAA(impl, rtInterface);\n }\n\nprivate:\n\n private this(inout(Impl)* impl) inout\n {\n this.impl = impl;\n }\n\n ref Val getLValue(in Key key)\n {\n // lazily alloc implementation\n if (impl is null)\n impl = new Impl(INIT_NUM_BUCKETS);\n\n // get hash and bucket for key\n immutable hash = calcHash(key);\n\n // found a value => assignment\n if (auto p = impl.findSlotLookup(hash, key))\n return p.entry.val;\n\n auto p = findSlotInsert(hash);\n if (p.deleted)\n --deleted;\n // check load factor and possibly grow\n else if (++used * GROW_DEN > dim * GROW_NUM)\n {\n grow();\n p = findSlotInsert(hash);\n assert(p.empty);\n }\n\n // update search cache and allocate entry\n firstUsed = min(firstUsed, cast(uint)(p - buckets.ptr));\n p.hash = hash;\n p.entry = new Impl.Entry(key); // TODO: move\n return p.entry.val;\n }\n\n static struct Impl\n {\n this(size_t sz)\n {\n buckets = allocBuckets(sz);\n }\n\n @property size_t length() const pure nothrow @nogc\n {\n assert(used >= deleted);\n return used - deleted;\n }\n\n @property size_t dim() const pure nothrow @nogc\n {\n return buckets.length;\n }\n\n @property size_t mask() const pure nothrow @nogc\n {\n return dim - 1;\n }\n\n // find the first slot to insert a value with hash\n inout(Bucket)* findSlotInsert(size_t hash) inout pure nothrow @nogc\n {\n for (size_t i = hash & mask, j = 1;; ++j)\n {\n if (!buckets[i].filled)\n return &buckets[i];\n i = (i + j) & mask;\n }\n }\n\n // lookup a key\n inout(Bucket)* findSlotLookup(size_t hash, in Key key) inout\n {\n for (size_t i = hash & mask, j = 1;; ++j)\n {\n if (buckets[i].hash == hash && key == buckets[i].entry.key)\n return &buckets[i];\n else if (buckets[i].empty)\n return null;\n i = (i + j) & mask;\n }\n }\n\n void grow()\n {\n // If there are so many deleted entries, that growing would push us\n // below the shrink threshold, we just purge deleted entries instead.\n if (length * SHRINK_DEN < GROW_FAC * dim * SHRINK_NUM)\n resize(dim);\n else\n resize(GROW_FAC * dim);\n }\n\n void shrink()\n {\n if (dim > INIT_NUM_BUCKETS)\n resize(dim / GROW_FAC);\n }\n\n void resize(size_t ndim) pure nothrow\n {\n auto obuckets = buckets;\n buckets = allocBuckets(ndim);\n\n foreach (ref b; obuckets)\n if (b.filled)\n *findSlotInsert(b.hash) = b;\n\n firstUsed = 0;\n used -= deleted;\n deleted = 0;\n GC.free(obuckets.ptr); // safe to free b/c impossible to reference\n }\n\n static struct Entry\n {\n Key key;\n Val val;\n }\n\n static struct Bucket\n {\n size_t hash;\n Entry* entry;\n\n @property bool empty() const\n {\n return hash == HASH_EMPTY;\n }\n\n @property bool deleted() const\n {\n return hash == HASH_DELETED;\n }\n\n @property bool filled() const\n {\n return cast(ptrdiff_t) hash < 0;\n }\n }\n\n Bucket[] allocBuckets(size_t dim) @trusted pure nothrow\n {\n enum attr = GC.BlkAttr.NO_INTERIOR;\n immutable sz = dim * Bucket.sizeof;\n return (cast(Bucket*) GC.calloc(sz, attr))[0 .. dim];\n }\n\n Bucket[] buckets;\n uint used;\n uint deleted;\n uint firstUsed;\n }\n\n RTInterface* rtInterface()() pure nothrow @nogc\n {\n static size_t aaLen(in void* pimpl) pure nothrow @nogc\n {\n auto aa = const(AA)(cast(const(Impl)*) pimpl);\n return aa.length;\n }\n\n static void* aaGetY(void** pimpl, in void* pkey)\n {\n auto aa = AA(cast(Impl*)*pimpl);\n auto res = &aa.getLValue(*cast(const(Key*)) pkey);\n *pimpl = aa.impl; // might have changed\n return res;\n }\n\n static inout(void)* aaInX(inout void* pimpl, in void* pkey)\n {\n auto aa = inout(AA)(cast(inout(Impl)*) pimpl);\n return aa.opIn_r(*cast(const(Key*)) pkey);\n }\n\n static bool aaDelX(void* pimpl, in void* pkey)\n {\n auto aa = AA(cast(Impl*) pimpl);\n return aa.remove(*cast(const(Key*)) pkey);\n }\n\n static immutable vtbl = RTInterface(&aaLen, &aaGetY, &aaInX, &aaDelX);\n return cast(RTInterface*)&vtbl;\n }\n\n static size_t calcHash(in ref Key key)\n {\n return hashOf(key) | HASH_FILLED_MARK;\n }\n\n Impl* impl;\n alias impl this;\n}\n\npackage extern (C) void* _aaFromCoreAA(void* impl, RTInterface* rtIntf) pure nothrow;\n\nprivate:\n\nstruct RTInterface\n{\n alias AA = void*;\n\n size_t function(in AA aa) pure nothrow @nogc len;\n void* function(AA* aa, in void* pkey) getY;\n inout(void)* function(inout AA aa, in void* pkey) inX;\n bool function(AA aa, in void* pkey) delX;\n}\n\nunittest\n{\n AA!(int, int) aa;\n assert(aa.length == 0);\n aa[0] = 1;\n assert(aa.length == 1 && aa[0] == 1);\n aa[1] = 2;\n assert(aa.length == 2 && aa[1] == 2);\n import core.stdc.stdio;\n\n int[int] rtaa = aa.toBuiltinAA();\n assert(rtaa.length == 2);\n puts(\"length\");\n assert(rtaa[0] == 1);\n assert(rtaa[1] == 2);\n rtaa[2] = 3;\n\n assert(aa[2] == 3);\n}\n\nunittest\n{\n auto aa = AA!(int, int)(3);\n aa[0] = 0;\n aa[1] = 1;\n aa[2] = 2;\n assert(aa.length == 3);\n}\n\n//==============================================================================\n// Helper functions\n//------------------------------------------------------------------------------\n\nsize_t nextpow2(in size_t n) pure nothrow @nogc\n{\n import core.bitop : bsr;\n\n if (n < 2)\n return 1;\n return size_t(1) << bsr(n - 1) + 1;\n}\n\npure nothrow @nogc unittest\n{\n // 0, 1, 2, 3, 4, 5, 6, 7, 8, 9\n foreach (const n, const pow2; [1, 1, 2, 4, 4, 8, 8, 8, 8, 16])\n assert(nextpow2(n) == pow2);\n}\n\nT min(T)(T a, T b) pure nothrow @nogc\n{\n return a < b ? a : b;\n}\n\nT max(T)(T a, T b) pure nothrow @nogc\n{\n return b < a ? a : b;\n}\n" }, { "path": "src/test/resources/samples/langs/D/arrayops.d", "content": "/**\n * Benchmark for array ops.\n *\n * Copyright: Copyright Martin Nowak 2016 -.\n * License: $(LINK2 http://www.boost.org/LICENSE_1_0.txt, Boost License 1.0)\n * Authors: Martin Nowak\n */\nimport core.cpuid, std.algorithm, std.datetime, std.meta, std.stdio, std.string,\n std.range;\n\nfloat[6] getLatencies(T, string op)()\n{\n enum N = (64 * (1 << 6) + 64) * T.sizeof;\n auto a = Array!T(N), b = Array!T(N), c = Array!T(N);\n float[6] latencies = float.max;\n foreach (i, ref latency; latencies)\n {\n auto len = 1 << i;\n foreach (_; 1 .. 32)\n {\n a[] = 24;\n b[] = 4;\n c[] = 2;\n auto sw = StopWatch(AutoStart.yes);\n foreach (off; size_t(0) .. size_t(64))\n {\n off = off * len + off;\n enum op = op.replace(\"const\", \"2\").replace(\"a\",\n \"a[off .. off + len]\").replace(\"b\",\n \"b[off .. off + len]\").replace(\"c\", \"c[off .. off + len]\");\n mixin(op ~ \";\");\n }\n latency = min(latency, sw.peek.nsecs);\n }\n }\n float[6] res = latencies[] / 1024;\n return res;\n}\n\nfloat[4] getThroughput(T, string op)()\n{\n enum N = (40 * 1024 * 1024 + 64 * T.sizeof) / T.sizeof;\n auto a = Array!T(N), b = Array!T(N), c = Array!T(N);\n float[4] latencies = float.max;\n size_t[4] lengths = [\n 8 * 1024 / T.sizeof, 32 * 1024 / T.sizeof, 512 * 1024 / T.sizeof, 32 * 1024 * 1024 / T\n .sizeof\n ];\n foreach (i, ref latency; latencies)\n {\n auto len = lengths[i] / 64;\n foreach (_; 1 .. 4)\n {\n a[] = 24;\n b[] = 4;\n c[] = 2;\n auto sw = StopWatch(AutoStart.yes);\n foreach (off; size_t(0) .. size_t(64))\n {\n off = off * len + off;\n enum op = op.replace(\"const\", \"2\").replace(\"a\",\n \"a[off .. off + len]\").replace(\"b\",\n \"b[off .. off + len]\").replace(\"c\", \"c[off .. off + len]\");\n mixin(op ~ \";\");\n }\n immutable nsecs = sw.peek.nsecs;\n runMasked({latency = min(latency, nsecs);});\n }\n }\n float[4] throughputs = void;\n runMasked({throughputs = T.sizeof * lengths[] / latencies[];});\n return throughputs;\n}\n\nstring[] genOps()\n{\n string[] ops;\n foreach (op1; [\"+\", \"-\", \"*\", \"/\"])\n {\n ops ~= \"a \" ~ op1 ~ \"= b\";\n ops ~= \"a \" ~ op1 ~ \"= const\";\n foreach (op2; [\"+\", \"-\", \"*\", \"/\"])\n {\n ops ~= \"a \" ~ op1 ~ \"= b \" ~ op2 ~ \" c\";\n ops ~= \"a \" ~ op1 ~ \"= b \" ~ op2 ~ \" const\";\n }\n }\n return ops;\n}\n\nvoid runOp(string op)()\n{\n foreach (T; AliasSeq!(ubyte, ushort, uint, ulong, byte, short, int, long, float,\n double))\n writefln(\"%s, %s, %(%.2f, %), %(%s, %)\", T.stringof, op,\n getLatencies!(T, op), getThroughput!(T, op));\n}\n\nstruct Array(T)\n{\n import core.stdc.stdlib : free, malloc;\n\n this(size_t n)\n {\n ary = (cast(T*) malloc(T.sizeof * n))[0 .. n];\n }\n\n ~this()\n {\n free(ary.ptr);\n }\n\n T[] ary;\n alias ary this;\n}\n\nversion (X86)\n version = SSE;\nelse version (X86_64)\n version = SSE;\nelse\n static assert(0, \"unimplemented\");\n\nversion (SSE)\n{\n uint mxcsr()\n {\n uint ret = void;\n asm\n {\n stmxcsr ret;\n }\n return ret;\n }\n\n void mxcsr(uint val)\n {\n asm\n {\n ldmxcsr val;\n }\n }\n\n // http://softpixel.com/~cwright/programming/simd/sse.php\n enum FPU_EXCEPTION_MASKS = 1 << 12 | 1 << 11 | 1 << 10 | 1 << 9 | 1 << 8 | 1 << 7;\n enum FPU_EXCEPTION_FLAGS = 1 << 5 | 1 << 4 | 1 << 3 | 1 << 2 | 1 << 1 | 1 << 0;\n\n void maskFPUExceptions()\n {\n mxcsr = mxcsr | FPU_EXCEPTION_MASKS;\n }\n\n void unmaskFPUExceptions()\n {\n mxcsr = mxcsr & ~FPU_EXCEPTION_MASKS;\n }\n\n uint FPUExceptionFlags()\n {\n return mxcsr & FPU_EXCEPTION_FLAGS;\n }\n\n void clearFPUExceptionFlags()\n {\n mxcsr = mxcsr & ~FPU_EXCEPTION_FLAGS;\n }\n}\n\nvoid runMasked(scope void delegate() dg)\n{\n assert(FPUExceptionFlags == 0);\n maskFPUExceptions;\n dg();\n clearFPUExceptionFlags;\n unmaskFPUExceptions;\n}\n\nvoid main()\n{\n unmaskFPUExceptions;\n\n writefln(\"type, op, %(latency%s, %), %-(throughput%s, %)\", iota(6)\n .map!(i => 1 << i), [\"8KB\", \"32KB\", \"512KB\", \"32MB\"]);\n foreach (op; mixin(\"AliasSeq!(%(%s, %))\".format(genOps)))\n runOp!op;\n maskFPUExceptions;\n}\n" }, { "path": "src/test/resources/samples/langs/D/function.d", "content": "void foo()\n{\n}\n" }, { "path": "src/test/resources/samples/langs/D/hello_world.d", "content": "import std.stdio;\n\nvoid main()\n{\n writeln(\"Hello World\");\n}\n" }, { "path": "src/test/resources/samples/langs/D/mpq.d", "content": "/*\n * mpq.d -- D programming language module for libmpq\n *\n * Copyright (c) 2008 Georg Lukas \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 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, write to the Free Software\n * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.\n *\n * This module is written to support Phobos. Patches to allow binding to\n * Tango are welcome.\n */\n\nmodule mpq;\n\n/* the following pragma does not work on DMD/Linux, generates a warning on\n * GDC/Linux and has not been tested on Windows. Commented out for now. */\n// pragma(lib, \"libmpq\");\n\nimport std.string; // for format() and toStringz()\nimport std.traits; // for ParameterTypeTuple!()\n\n/* XXX: this assumes that libmpq is compiled with Large File Support on */\nalias long off_t;\n\n/* libmpq error return values */\nconst LIBMPQ_ERROR_OPEN\t\t\t= -1;\t/* open error on file. */\nconst LIBMPQ_ERROR_CLOSE\t\t= -2;\t/* close error on file. */\nconst LIBMPQ_ERROR_SEEK\t\t\t= -3;\t/* lseek error on file. */\nconst LIBMPQ_ERROR_READ\t\t\t= -4;\t/* read error on file. */\nconst LIBMPQ_ERROR_WRITE\t\t= -5;\t/* write error on file. */\nconst LIBMPQ_ERROR_MALLOC\t\t= -6;\t/* memory allocation error. */\nconst LIBMPQ_ERROR_FORMAT\t\t= -7;\t/* format errror. */\nconst LIBMPQ_ERROR_NOT_INITIALIZED\t= -8;\t/* init() wasn't called. */\nconst LIBMPQ_ERROR_SIZE\t\t\t= -9;\t/* buffer size is to small. */\nconst LIBMPQ_ERROR_EXIST\t\t= -10;\t/* file or block does not exist in archive. */\nconst LIBMPQ_ERROR_DECRYPT\t\t= -11;\t/* we don't know the decryption seed. */\nconst LIBMPQ_ERROR_UNPACK\t\t= -12;\t/* error on unpacking file. */\n\n/** libmpq internal meta-data for an archive */\nextern struct mpq_archive_s;\n\nextern(C) {\n\n/* libmpq__generic information about library. */\nchar *libmpq__version();\n\n/* libmpq__generic mpq archive information. */\nint libmpq__archive_open(mpq_archive_s **mpq_archive, char *mpq_filename, off_t archive_offset);\nint libmpq__archive_close(mpq_archive_s *mpq_archive);\nint libmpq__archive_packed_size(mpq_archive_s *mpq_archive, off_t *packed_size);\nint libmpq__archive_unpacked_size(mpq_archive_s *mpq_archive, off_t *unpacked_size);\nint libmpq__archive_offset(mpq_archive_s *mpq_archive, off_t *offset);\nint libmpq__archive_version(mpq_archive_s *mpq_archive, uint *version_);\nint libmpq__archive_files(mpq_archive_s *mpq_archive, uint *files);\n\n/* libmpq__generic file processing functions. */\nint libmpq__file_packed_size(mpq_archive_s *mpq_archive, uint file_number, off_t *packed_size);\nint libmpq__file_unpacked_size(mpq_archive_s *mpq_archive, uint file_number, off_t *unpacked_size);\nint libmpq__file_offset(mpq_archive_s *mpq_archive, uint file_number, off_t *offset);\nint libmpq__file_blocks(mpq_archive_s *mpq_archive, uint file_number, uint *blocks);\nint libmpq__file_encrypted(mpq_archive_s *mpq_archive, uint file_number, uint *encrypted);\nint libmpq__file_compressed(mpq_archive_s *mpq_archive, uint file_number, uint *compressed);\nint libmpq__file_imploded(mpq_archive_s *mpq_archive, uint file_number, uint *imploded);\nint libmpq__file_number(mpq_archive_s *mpq_archive, char *filename, uint *number);\nint libmpq__file_read(mpq_archive_s *mpq_archive, uint file_number, ubyte *out_buf, off_t out_size, off_t *transferred);\n\n/* libmpq__generic block processing functions. */\nint libmpq__block_open_offset(mpq_archive_s *mpq_archive, uint file_number);\nint libmpq__block_close_offset(mpq_archive_s *mpq_archive, uint file_number);\nint libmpq__block_unpacked_size(mpq_archive_s *mpq_archive, uint file_number, uint block_number, off_t *unpacked_size);\nint libmpq__block_read(mpq_archive_s *mpq_archive, uint file_number, uint block_number, ubyte *out_buf, off_t out_size, off_t *transferred);\n\n}\n\n\n/** exception class for failed libmpq calls */\nclass MPQException : Exception {\n\tconst string[] Errors = [\n\t\t\"unknown error\",\n\t\t\"open error on file\",\n\t\t\"close error on file\",\n\t\t\"lseek error on file\",\n\t\t\"read error on file\",\n\t\t\"write error on file\",\n\t\t\"memory allocation error\",\n\t\t\"format errror\",\n\t\t\"init() wasn't called\",\n\t\t\"buffer size is to small\",\n\t\t\"file or block does not exist in archive\",\n\t\t\"we don't know the decryption seed\",\n\t\t\"error on unpacking file\"];\n\n\tpublic int errno;\n\tthis(char[] fnname = \"unknown_function\", int errno = 0) {\n\n\t\tthis.errno = errno;\n\t\tif (-errno >= Errors.length)\n\t\t\terrno = 0;\n\t\tsuper(std.string.format(\"Error in %s(): %s (%d)\",\n\t\t\t\t\tfnname, Errors[-errno], errno));\n\t}\n}\n\n\n/** template to wrap function calls and throw exceptions in case of error\n *\n * thanks for the idea to while(nan) blog,\n * http://while-nan.blogspot.com/2007/06/wrapping-functions-for-fun-and-profit.html\n *\n * use: MPQ_CHECKERR(libmpq__archive_open)(&m, \"foo.mpq\", -1);\n * returns the retval of archive_open on success;\n * throws an MPQException on failure.\n *\n * @param Fn libmpq__function reference\n * @param args libmpq__function parameters\n * @return return value of libmpq__function on success\n * @throw MPQException on error\n */\nint MPQ_CHECKERR(alias Fn)(ParameterTypeTuple!(Fn) args)\n{\n\tint result = Fn(args);\n\tif (result < 0) {\n\t\t/* XXX: relying on non-specified stringof() behaviour */\n\t\tthrow new MPQException((&Fn).stringof[2..$], result);\n\t}\n return result;\n}\n\n\n/** mixin alias to wrap library functions into MPQ_CHECKERR.\n *\n * alias mpq.func_name(...) to MPQ_CHECKERR(libmpq__func_name)(...)\n * @param func_name name of the function to be wrapped\n */\ntemplate MPQ_FUNC(char[] func_name) {\n\tconst char[] MPQ_FUNC = \"alias MPQ_CHECKERR!(libmpq__\" ~ func_name ~ \") \" ~ func_name ~ \";\";\n}\n\nalias libmpq__version libversion; /* must be direct alias because it returns char*, not error int */\nmixin(MPQ_FUNC!(\"archive_open\"));\nmixin(MPQ_FUNC!(\"archive_close\"));\nmixin(MPQ_FUNC!(\"archive_packed_size\"));\nmixin(MPQ_FUNC!(\"archive_unpacked_size\"));\nmixin(MPQ_FUNC!(\"archive_offset\"));\nmixin(MPQ_FUNC!(\"archive_version\"));\nmixin(MPQ_FUNC!(\"archive_files\"));\nmixin(MPQ_FUNC!(\"file_packed_size\"));\nmixin(MPQ_FUNC!(\"file_unpacked_size\"));\nmixin(MPQ_FUNC!(\"file_offset\"));\nmixin(MPQ_FUNC!(\"file_blocks\"));\nmixin(MPQ_FUNC!(\"file_encrypted\"));\nmixin(MPQ_FUNC!(\"file_compressed\"));\nmixin(MPQ_FUNC!(\"file_imploded\"));\nmixin(MPQ_FUNC!(\"file_number\"));\nmixin(MPQ_FUNC!(\"file_read\"));\nmixin(MPQ_FUNC!(\"block_open_offset\"));\nmixin(MPQ_FUNC!(\"block_close_offset\"));\nmixin(MPQ_FUNC!(\"block_unpacked_size\"));\nmixin(MPQ_FUNC!(\"block_read\"));\n\n/** getter function named name for returning archive_* single values:\n *\n * Archive.() { return libmpq__archive_() }\n *\n * @param type return type for the original function reference\n * @param name name of the original function\n * @param name2 name for the prototype (defaults to name, used for \"version\")\n * @return getter function mixin\n */\ntemplate MPQ_A_GET(char[] type, char[] name, char[] name2 = name) {\n\tconst char[] MPQ_A_GET = type ~ \" \" ~ name2 ~ \"() { \" ~\n\t\t\ttype ~ \" ret; \" ~\n\t\t\t\"archive_\" ~ name ~ \"(m, &ret); return ret;\" ~\n\t\t\"}\";\n}\n\n/** wrapper class for an MPQ Archive\n *\n * syntax: auto a = new mpq.Archive(\"somefile.mpq\");\n */\nclass Archive {\n\tmpq_archive_s *m;\n\tFile listfile;\n\tchar[][] listfiledata;\n\n\tthis(char[] archivename, off_t offset = -1) {\n\t\tarchive_open(&m, toStringz(archivename), offset);\n\t}\n\n\tmixin(MPQ_A_GET!(\"off_t\", \"packed_size\"));\n\tmixin(MPQ_A_GET!(\"off_t\", \"unpacked_size\"));\n\tmixin(MPQ_A_GET!(\"off_t\", \"offset\"));\n\tmixin(MPQ_A_GET!(\"uint\", \"version\", \"version_\"));\n\tmixin(MPQ_A_GET!(\"uint\", \"files\"));\n\n\t~this() {\n\t\tarchive_close(m);\n\t}\n\n\tmpq_archive_s* archive() {\n\t\treturn m;\n\t}\n\n\tFile opIndex(char[] fname) {\n\t\treturn new File(this, fname);\n\t}\n\tFile opIndex(int fno) {\n\t\treturn new File(this, fno);\n\t}\n\n\tchar[][] filelist() {\n\t\ttry {\n\t\t\tif (!listfile) {\n\t\t\t\tlistfile = this[\"(listfile)\"];\n\t\t\t\tlistfiledata = (cast(char[])listfile.read()).splitlines();\n\t\t\t}\n\t\t\treturn listfiledata;\n\t\t} catch (MPQException e) {\n\t\t\treturn [];\n\t\t}\n\t}\n\n\t/+uint filenumber(char[] filename) {\n\t\ttry {\n\t\t\tif (!listfile) {\n\t\t\t\tlistfile = this[\"(listfile)\"];\n\t\t\t\tlistfiledata = (cast(char[])listfile.read()).splitlines();\n\t\t\t}\n\t\t\treturn listfiledata;\n\t\t} catch (MPQException e) {\n\t\t\treturn [];\n\t\t}\n\t}+/\n\n}\n\n\n/** getter function named name for returning file_* single values:\n *\n * File.() { return libmpq__file_() }\n *\n * @param type return type for the original function reference\n * @param name name of the original function\n * @param name2 name for the prototype (defaults to name, used for \"version\")\n * @return getter function mixin\n */\ntemplate MPQ_F_GET(char[] type, char[] name, char[] name2 = name) {\n\tconst char[] MPQ_F_GET = type ~ \" \" ~ name2 ~ \"() { \" ~\n\t\t\ttype ~ \" ret; \" ~\n\t\t\t\"file_\" ~ name ~ \"(am, fileno, &ret); \" ~\n\t\t\t\"return ret;\" ~\n\t\t\"}\";\n}\n\n/** wrapper class for a single file in an MPQ Archive\n *\n * syntax:\n * auto a = new mpq.Archive(\"somefile.mpq\");\n * auto f = a[\"(listfile)\"];\n * auto f2 = a[0];\n * auto f3 = new File(a, \"(listfile)\");\n */\nclass File {\n\tArchive a;\n\tmpq_archive_s* am;\n\tchar[] filename;\n\tuint fileno;\n\n\tthis(Archive a, int fileno) {\n\t\tthis.a = a;\n\t\tthis.am = a.archive();\n\t\tif (fileno >= a.files) {\n\t\t\tthrow new MPQException(format(\"File(%d)\", fileno),\n\t\t\t\tLIBMPQ_ERROR_EXIST);\n\t\t}\n\t\tthis.filename = format(\"file%04d.xxx\", fileno);\n\t\tthis.fileno = fileno;\n\t}\n\n\tthis(Archive a, char[] filename) {\n\t\tthis.a = a;\n\t\tthis.am = a.archive();\n\t\tthis.filename = filename;\n\t\t/* this line will throw an exception when the file is not there */\n\t\tmpq.file_number(am, toStringz(filename), &this.fileno);\n\t}\n\n\tmixin(MPQ_F_GET!(\"off_t\", \"packed_size\"));\n\tmixin(MPQ_F_GET!(\"off_t\", \"unpacked_size\"));\n\tmixin(MPQ_F_GET!(\"off_t\", \"offset\"));\n\tmixin(MPQ_F_GET!(\"uint\", \"blocks\"));\n\tmixin(MPQ_F_GET!(\"uint\", \"encrypted\"));\n\tmixin(MPQ_F_GET!(\"uint\", \"compressed\"));\n\tmixin(MPQ_F_GET!(\"uint\", \"imploded\"));\n\n\tuint no() {\treturn fileno; }\n\tchar[] name() {\treturn filename; }\n\n\tubyte[] read() {\n\t\tubyte[] content;\n\t\tcontent.length = this.unpacked_size();\n\t\toff_t trans;\n\t\tmpq.file_read(am, fileno, content.ptr, content.length, &trans);\n\t\tcontent.length = trans;\n\t\treturn content;\n\t}\n}\n" }, { "path": "src/test/resources/samples/langs/D/template.d", "content": "template Fib(size_t N)\n{\n static if (N < 2)\n enum Fib = size_t(1);\n else\n enum Fib = Fib!(N - 2) + Fib!(N - 1);\n}\n" }, { "path": "src/test/resources/samples/langs/D/template_function.d", "content": "void bar(T)(T t)\n{\n}\n" }, { "path": "src/test/resources/samples/langs/D/unittest1.d", "content": "unittest\n{\n}\n" }, { "path": "src/test/resources/samples/langs/D/unittest2.d", "content": "unittest(\"optional name\")\n{\n}\n" }, { "path": "src/test/resources/samples/langs/DIGITAL Command Language/fis_gtm_kitinstal.com", "content": "$!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n$!\t\t\t\t\t\t\t\t!\n$!\tCopyright 2001, 2011 Fidelity Information Services, Inc\t!\n$!\t\t\t\t\t\t\t\t!\n$!\tThis source code contains the intellectual property\t!\n$!\tof its copyright holder(s), and is made available\t!\n$!\tunder a license. If you do not know the terms of\t!\n$!\tthe license, please stop and do not read further.\t!\n$!\t\t\t\t\t\t\t\t!\n$!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n$!\n$!\n$!\tKITINSTAL.COM PROCEDURE FOR THE GT.M PRODUCT\n$!\n$ ON CONTROL_Y THEN VMI$CALLBACK CONTROL_Y\n$! ON WARNING THEN EXIT $STATUS !! allow warning errors for INSTALL REPLACE\n$ IF P1 .EQS. \"VMI$_INSTALL\" THEN GOTO INSTALL\n$ IF P1 .EQS. \"VMI$_POSTINSTALL\" THEN GOTO POSTINSTALL\n$ IF P1 .EQS. \"VMI$_IVP\" THEN GOTO IVP\n$ EXIT VMI$_UNSUPPORTED\n$!\n$INSTALL:\n$ TYPE SYS$INPUT\n\n GT.M (c) COPYRIGHT 1985 - 2000 by Sanchez Computer Associates\n ALL RIGHTS RESERVED\n\n$! the following 2 lines must be maintained\n$ GTM$VMS_VERSION :== 072\t! Minimum VMS version required\n$ ALPHA = (f$getsyi(\"arch_name\") .eqs. \"Alpha\")\n$ IF ALPHA\n$ THEN\n$ GTM$DISK_SPACE == 28000\t! Minumum disk space on system disk required\n$ ELSE\n$ GTM$DISK_SPACE == 16000\t! Minumum disk space on system disk required\n$ ENDIF\n$ IF F$ELEMENT(0,\",\",VMI$VMS_VERSION) .EQS. \"RELEASED\"\n$ THEN\n$ GTM$VMS_IS == F$ELEMENT(1,\",\",VMI$VMS_VERSION)\n$ IF GTM$VMS_IS .LTS. GTM$VMS_VERSION\n$ THEN\n$ VMI$CALLBACK MESSAGE E VMSMISMATCH \"This GT.M kit requires an existing VMS''GTM$VMS_VERSION' system.\"\n$ EXIT VMI$_FAILURE\n$ ENDIF\n$ ELSE\n$ GTM$VMS_IS :==\n$ WRITE SYS$OUTPUT \" No VMS version checking performed for field test versions.\"\n$ ENDIF\n$ IF (GTM$VMS_IS .GES. \"052\") THEN T1 = F$VERIFY(VMI$KIT_DEBUG)\n$ VMI$CALLBACK CHECK_NET_UTILIZATION GTM$ROOM 'GTM$DISK_SPACE'\n$ IF .NOT. GTM$ROOM\n$ THEN\n$ VMI$CALLBACK MESSAGE E NOSPACE \"There is not enough disk space -- GT.M needs ''GTM$DISK_SPACE' blocks.\"\n$ EXIT VMI$_FAILURE\n$ ENDIF\n$! setup default answers\n$ GTM$DOPURGE :== YES\n$ GTM$RUN_IVP :== YES\n$ GTM$STD_CNF :== YES\n$ GTM$DST_OWN :== SYSTEM\n$ IF F$IDENTIFIER(GTM$DST_OWN,\"NAME_TO_NUMBER\") .EQ. 0 THEN GTM$DST_OWN :== 1,4\n$ GTM$SYS_DST :== YES\n$ GTM$DST_DIR :== GTM_DIST\n$ GTM$DST_CRE == GTM$DST_DIR\n$ GTM$DST_DEV :==\n$ GTM$STARTDB :== YES\n$ GTM$MGR_COM :== YES\n$ GTM$HLP_DIR :== NO\n$ GTM$DEF_DCL :== YES\n$ GTM$DEF_SYS :== YES\n$ GTM$LNK_LOG :== YES\n$ GTM$INSTALL :== YES\n$ GTM$DEF_GLD :== YES\n$ GTM$GBL_DIR :== MUMPS.GLD\n$ GTM$DEF_RTN :== YES\n$ GTM$RTN_DIR :== [],GTM$DIST:\n$ GTM$PCT_RTN :== YES\n$ VMI$CALLBACK ASK GTM$DOPURGE \"Do you want to purge files replaced by this installation\" 'GTM$DOPURGE' B -\n \"@VMI$KWD:GTMKITHLP HELP_PURGE\"\n$ IF .NOT. GTM$DOPURGE THEN VMI$CALLBACK SET PURGE NO\n$ VMI$CALLBACK ASK GTM$STD_CNF \"Do you want the standard GT.M configuration (performs INSTALL)\" 'GTM$STD_CNF' B -\n \"@VMI$KWD:GTMKITHLP HELP_STD_CNF\"\n$ IF GTM$STD_CNF\n$ THEN\n$ GTM$SYS_DST == 1\n$ GTM$STARTDB == 1\n$ GTM$MGR_COM == 1\n$ GTM$HLP_DIR == 0\n$ GTM$DEF_DCL == 1\n$ GTM$DEF_SYS == 1\n$ GTM$INSTALL == 1\n$ GTM$LNK_LOG == 1\n$ GTM$INSTALL == 1\n$ GTM$DEF_GLD == 1\n$ GTM$DEF_RTN == 1\n$ GTM$PCT_RTN == 1\n$ GTM$DST_LOG :== SYS$COMMON:['GTM$DST_DIR']\n$ GTM$DIR_TYPE :== COMMON\n$ ELSE ! Not standard configuration\n$ VMI$CALLBACK ASK GTM$DST_OWN \"What UIC should own the GT.M distribution\" 'GTM$DST_OWN' S \"@VMI$KWD:GTMKITHLP HELP_DST_OWN\"\n$ GTM$DST_OWN == GTM$DST_OWN - \"[\" - \"]\"\n$ VMI$CALLBACK ASK GTM$SYS_DST \"Do you want the GT.M distribution to go into a System Directory\" 'GTM$SYS_DST' B -\n \"@VMI$KWD:GTMKITHLP HELP_SYS_DST\"\n$ IF GTM$SYS_DST\n$ THEN\n$ VMI$CALLBACK ASK GTM$DST_DIR \"In what System Directory do you want to place GT.M\" 'GTM$DST_DIR' S -\n \"@VMI$KWD:GTMKITHLP HELP_SYS_DIR\"\n$ GTM$DST_DIR == GTM$DST_DIR - \"[\" - \"]\"\n$ GTM$DST_CRE == GTM$DST_DIR\n$ GTM$DST_LOG :== SYS$COMMON:['GTM$DST_DIR']\n$ GTM$DIR_TYPE :== COMMON\n$ ELSE ! Not system disk\n$ VMI$CALLBACK ASK GTM$DST_DEV \"On which device do you want to place GT.M\" \"''GTM$DST_DEV'\" S \"@VMI$KWD:GTMKITHLP HELP_DST_DEV\"\n$ VMI$CALLBACK ASK GTM$DST_DIR \"In what directory on that device do you want to place GT.M\" 'GTM$DST_DIR' S -\n \"@VMI$KWD:GTMKITHLP HELP_DST_DIR\"\n$ GTM$DST_DEV == GTM$DST_DEV - \":\"\n$ GTM$DST_DIR == GTM$DST_DIR - \"[\" - \"]\"\n$ GTM$DST_LOG :== 'GTM$DST_DEV':['GTM$DST_DIR']\n$ GTM$DST_CRE == GTM$DST_LOG\n$ GTM$DIR_TYPE :== USER\n$ ENDIF ! system disk\n$ VMI$CALLBACK ASK GTM$STARTDB \"Do you want GTMSTART.COM in the startup database\" 'GTM$STARTDB' B -\n \"@VMI$KWD:GTMKITHLP HELP_STARTDB\"\n$ IF .NOT. GTM$STARTDB\n$ THEN\n$ VMI$CALLBACK ASK GTM$MGR_COM \"Do you want the GT.M .COM files in SYS$MANAGER\" 'GTM$MGR_COM' B -\n \"@VMI$KWD:GTMKITHLP HELP_MGR_COM\"\n$ ENDIF\n$ VMI$CALLBACK ASK GTM$HLP_DIR \"Do you want the GT.M help files in SYS$HELP\" 'GTM$HLP_DIR' B \"@VMI$KWD:GTMKITHLP HELP_HLP_DIR\"\n$ VMI$CALLBACK ASK GTM$DEF_DCL \"Do you want to define GT.M commands to the system\" 'GTM$DEF_DCL' B -\n \"@VMI$KWD:GTMKITHLP HELP_DEF_DCL\"\n$ VMI$CALLBACK ASK GTM$DEF_SYS \"Do you want to define GT.M logical names in the System Table\" 'GTM$DEF_SYS' B -\n \"@VMI$KWD:GTMKITHLP HELP_DEF_SYS\"\n$ VMI$CALLBACK ASK GTM$LNK_LOG \"Do you want to define the LNK$LIBRARY logical names\" 'GTM$LNK_LOG' B -\n \"@VMI$KWD:GTMKITHLP HELP_LNK_LOG\"\n$ VMI$CALLBACK ASK GTM$RUN_IVP \"Do you want to run the IVP (performs INSTALL)\" 'GTM$RUN_IVP' B -\n \"@VMI$KWD:GTMKITHLP HELP_RUN_IVP\"\n$ IF GTM$RUN_IVP\n$ THEN\n$ GTM$PCT_RTN == 1\n$ ELSE\n$ VMI$CALLBACK ASK GTM$PCT_RTN \"Do you want to compile the GT.M percent routines (performs INSTALL)\" 'GTM$PCT_RTN' B -\n \"@VMI$KWD:GTMKITHLP HELP_PCT_RTN\"\n$ ENDIF\n$ IF (GTM$RUN_IVP .OR. GTM$PCT_RTN)\n$ THEN\n$ GTM$INSTALL == 1\n$ ELSE\n$ VMI$CALLBACK ASK GTM$INSTALL \"Do you want to INSTALL the GT.M shareable images now\" 'GTM$INSTALL' B -\n \"@VMI$KWD:GTMKITHLP HELP_INSTALL\"\n$ ENDIF\n$ VMI$CALLBACK ASK GTM$DEF_RTN \"Do you want to have a default definition for GTM$ROUTINES\" 'GTM$DEF_RTN' B -\n \"@VMI$KWD:GTMKITHLP HELP_DEF_RTN\"\n$ IF GTM$DEF_RTN\n$ THEN\n$ VMI$CALLBACK ASK GTM$RTN_DIR \"What is the search specification for GTM$ROUTINES\" 'GTM$RTN_DIR' S -\n \"@VMI$KWD:GTMKITHLP HELP_RTN_DIR\"\n$ ENDIF\n$ VMI$CALLBACK ASK GTM$DEF_GLD \"Do you want to have a default definition for GTM$GBLDIR\" 'GTM$DEF_GLD' B -\n \"@VMI$KWD:GTMKITHLP HELP_DEF_GLD\"\n$ IF GTM$DEF_GLD\n$ THEN\n$ VMI$CALLBACK ASK GTM$GBL_DIR \"What is the file specification for GTM$GBLDIR\" 'GTM$GBL_DIR' S -\n \"@VMI$KWD:GTMKITHLP HELP_GBL_DIR\"\n$ ENDIF\n$ ENDIF ! standard configuration\n$! tell them what's happening\n$ IF GTM$MGR_COM\n$ THEN\n$ WRITE SYS$OUTPUT \" The following command files are created and copied to SYS$MANAGER:\"\n$ ELSE\n$ WRITE SYS$OUTPUT \" The following command files are created:\"\n$ ENDIF\n$ TYPE SYS$INPUT\n\n GTMINSTALL.COM\n GTMLOGICALS.COM\n GTMLOGIN.COM\n GTMSTART.COM\n GTMSTOP.COM\n\n Each file contains its own user documentation.\n\n All the questions have been asked. Installation now proceeds without your\n manual intervention for about 10-15 minutes.\n$ IF GTM$RUN_IVP THEN WRITE SYS$OUTPUT \" Finally the Installation Verification Procedure tests the installation.\"\n$ WRITE SYS$OUTPUT \"\"\n$ VMI$CALLBACK CREATE_DIRECTORY 'GTM$DIR_TYPE' 'GTM$DST_CRE' \"/OWNER_UIC=[''GTM$DST_OWN'] /PROTECTION=(WO:RE)\"\n$ VMI$CALLBACK RESTORE_SAVESET B\n$ VMI$CALLBACK RESTORE_SAVESET C\n$ WRITE SYS$OUTPUT \"\"\n$ VMI$CALLBACK MESSAGE I CRECOM \"Creating command files.\"\n$! Create GTMINSTALL.COM\n$ OPEN /WRITE OUFILE VMI$KWD:GTMINSTALL.COM\n$ WRITE OUFILE \"$!\"\n$ WRITE OUFILE \"$!\tGTMINSTALL.COM installs GTMSECSHR and other GT.M images.\"\n$ WRITE OUFILE \"$! GTMSECSHR is a small protected image and must be installed.\"\n$ WRITE OUFILE \"$! GTMSHR is the run-time library and is installed for performance.\"\n$ WRITE OUFILE \"$! GTM$DMOD and MCOMPILE are small images frequently used in development.\"\n$ WRITE OUFILE \"$!\"\n$ WRITE OUFILE \"$ INSTALL\"\n$ WRITE OUFILE \"REPLACE /OPEN/SHARED/HEADER/PROTECTED\tGTMSECSHR\"\n$ WRITE OUFILE \"REPLACE /OPEN/SHARED/HEADER\t\tGTMSHR\"\n$ WRITE OUFILE \"REPLACE /OPEN/SHARED/HEADER\t\tGTM$DMOD\"\n$ WRITE OUFILE \"REPLACE /OPEN/SHARED/HEADER\t\tMCOMPILE\"\n$ WRITE OUFILE \"$ EXIT\"\n$ CLOSE OUFILE\n$! Create GTMLOGICALS.COM\n$ GTM$HLP_LOG :== GTM$DIST\n$ IF GTM$HLP_DIR THEN GTM$HLP_LOG :== SYS$HELP\n$ OPEN /WRITE OUFILE VMI$KWD:GTMLOGICALS.COM\n$ WRITE OUFILE \"$!\"\n$ WRITE OUFILE \"$!\tGTMLOGICALS.COM defines the logical names required to use GT.M.\"\n$ WRITE OUFILE \"$!\tBy default the definitions are placed in the PROCESS table.\"\n$ WRITE OUFILE \"$!\tParameter 1, if supplied should be the name of a logical name table\"\n$ WRITE OUFILE \"$!\tand/or the mode of definition.\"\n$ WRITE OUFILE \"$! Assignments in a \"\"permanent\"\" table reduce GT.M activation time.\"\n$ WRITE OUFILE \"$!\"\n$ IF GTM$LNK_LOG THEN WRITE OUFILE \"$!\tThe LNK$LIBRARY names many require adjustment to your environment.\"\n$ IF GTM$DEF_GLD THEN WRITE OUFILE \"$!\tGTM$GBLDIR is defined to provide default access to a global directory.\"\n$ IF GTM$DEF_RTN THEN WRITE OUFILE \"$!\tGTM$ROUTINES is defined to provide access to the GT.M utilities.\"\n$ IF GTM$DEF_RTN THEN WRITE OUFILE \"$!\tYou may wish to define a different structure for $ZROUTINES.\"\n$ WRITE OUFILE \"$!\"\n$ WRITE OUFILE \"$ IF (P1 .NES. \"\"\"\") .AND. (F$EXTRACT(0,1,P1) .NES. \"\"/\"\") THEN P1 := /'P1\"\n$ WRITE OUFILE \"$ DEFINE 'P1' GTM$DIST\t\t''GTM$DST_LOG'\"\n$ IF GTM$DEF_GLD THEN WRITE OUFILE \"$ DEFINE 'P1' GTM$GBLDIR\t''GTM$GBL_DIR'\"\n$ IF GTM$DEF_RTN THEN WRITE OUFILE \"$ DEFINE 'P1' GTM$ROUTINES\t\"\"''GTM$RTN_DIR'\"\"\"\n$ WRITE OUFILE \"$ DEFINE 'P1' GTM$HELP\t\t''GTM$HLP_LOG'\"\n$ WRITE OUFILE \"$ DEFINE 'P1' GTMSHR\t\tGTM$DIST:GTMSHR.EXE\"\n$ WRITE OUFILE \"$ DEFINE 'P1' GTMSECSHR\t\tGTM$DIST:GTMSECSHR.EXE\"\n$ WRITE OUFILE \"$ DEFINE 'P1' GTM$DMOD\t\tGTM$DIST:GTM$DMOD.EXE\"\n$ WRITE OUFILE \"$ DEFINE 'P1' MCOMPILE\t\tGTM$DIST:MCOMPILE.EXE\"\n$ IF GTM$LNK_LOG\n$ THEN\n$ N1 = 0\n$ DN = 0\n$ T1 = F$TRNLNM(\"LNK$LIBRARY\")\n$ IF (T1 .EQS. \"\") .OR. (F$LOCATE(\"GTMLIB\",T1) .NE. F$LENGTH(T1)) .OR. (F$LOCATE(\"GTMSHR\",T1) .NE. F$LENGTH(T1))\n$ THEN\n$ WRITE OUFILE \"$ DEFINE 'P1' LNK$LIBRARY\tGTM$DIST:GTMLIB.OLB\"\n$ DN = 1\n$ ELSE ! lnk$library is in use\n$LNK_LOOP:\n$ N1 = N1 + 1\n$ T1 = F$TRNLNM(\"LNK$LIBRARY_''N1'\")\n$ IF (T1 .EQS. \"\") .OR. (F$LOCATE(\"GTMLIB\",T1) .NE. F$LENGTH(T1)) .OR. (F$LOCATE(\"GTMSHR\",T1) .NE. F$LENGTH(T1))\n$ THEN\n$ WRITE OUFILE \"$ DEFINE 'P1' LNK$LIBRARY_''N1'\tGTM$DIST:GTMLIB.OLB\"\n$ DN = 1\n$ ENDIF\n$ IF (.NOT. DN) .AND. (N1 .LT. 998) THEN GOTO LNK_LOOP\n$ ENDIF ! gtmlib handling\n$ IF DN ! placed gtmlib\n$ THEN\n$ N1 = N1 + 1\n$ WRITE OUFILE \"$ DEFINE 'P1' LNK$LIBRARY_''N1'\tGTM$DIST:GTMSHR.OLB\"\n$ ELSE\n$ VMI$CALLBACK MESSAGE I NOLNKLOG \"No LNK$LIBRARY logical names available\"\n$ ENDIF\n$ ENDIF ! setting up LNK$LIBRARYs\n$ WRITE OUFILE \"$ EXIT\"\n$ CLOSE OUFILE\n$! Create GTMLOGIN.COM\n$ OPEN /WRITE OUFILE VMI$KWD:GTMLOGIN.COM\n$ WRITE OUFILE \"$!\"\n$ WRITE OUFILE \"$!\tGTMLOGIN.COM performs process specific setup for GT.M.\"\n$ WRITE OUFILE \"$!\tIt calls GTMLOGICALS.COM if the logical names are not\"\n$ WRITE OUFILE \"$! in the SYSTEM table.\"\n$ WRITE OUFILE \"$!\tIt defines symbols to access GT.M images.\"\n$ WRITE OUFILE \"$!\tIt defines GT.M commands locally if they are not defined to the system.\"\n$ WRITE OUFILE \"$! When the command and logical names are not defined on a process level,\"\n$ WRITE OUFILE \"$! a production user may save start-up time by not using GTMLOGIN.\"\n$ WRITE OUFILE \"$! CCE is infrequently used, but may be defined as a foreign command.\"\n$ WRITE OUFILE \"$!\"\n$ IF .NOT. GTM$DEF_SYS\n$ THEN\n$ WRITE OUFILE \"$ dir = F$ENVIRONMENT(\"\"PROCEDURE\"\")\"\n$ WRITE OUFILE \"$ dir = F$PARSE(dir,,,\"\"DEVICE\"\") + F$PARSE(dir,,,\"\"DIRECTORY\"\")\"\n$ WRITE OUFILE \"$ @'dir'GTMLOGICALS.COM\"\n$ ENDIF\n$ IF .NOT. GTM$DEF_DCL THEN WRITE OUFILE \"$ SET COMMAND GTM$DIST:GTMCOMMANDS.CLD\"\n$ WRITE OUFILE \"$ DSE :== $GTM$DIST:DSE.EXE\t! Database System Editor\"\n$ WRITE OUFILE \"$ GDE :== $GTM$DIST:GDE.EXE\t! Global Directory Editor\"\n$ WRITE OUFILE \"$ GTM :== MUMPS/DIRECT\t\t! Direct Mode MUMPS\"\n$ WRITE OUFILE \"$ LKE :== $GTM$DIST:LKE.EXE\t! Lock Editor\"\n$ WRITE OUFILE \"$ MUPI*P :== $GTM$DIST:MUPIP.EXE\t! MUMPS Peripheral Interchange Program\"\n$ WRITE OUFILE \"$ EXIT\"\n$ WRITE OUFILE \"$ CCE :== $GTM$DIST:CCE.EXE\t! GT.CX Operator Interface Program\"\n$ WRITE OUFILE \"$ EXIT\"\n$ CLOSE OUFILE\n$! Create GTMSTART.COM\n$ OPEN /WRITE OUFILE VMI$KWD:GTMSTART.COM\n$ WRITE OUFILE \"$!\"\n$ WRITE OUFILE \"$!\tGTMSTART.COM should be placed in the VMS startup database.\"\n$ WRITE OUFILE \"$!\tIt invokes GTMLOGICALS.COM and GTMINSTALL.COM.\"\n$ WRITE OUFILE \"$!\"\n$ WRITE OUFILE \"$ dir = F$ENVIRONMENT(\"\"PROCEDURE\"\")\"\n$ WRITE OUFILE \"$ dir = F$PARSE(dir,,,\"\"DEVICE\"\") + F$PARSE(dir,,,\"\"DIRECTORY\"\")\"\n$ IF GTM$DEF_SYS THEN WRITE OUFILE \"$ IF P1 .EQS. \"\"\"\" .OR. (P1 .EQS. \"\"FULL\"\") THEN P1 := SYSTEM/EXEC\"\n$ WRITE OUFILE \"$ @'dir'GTMLOGICALS 'P1'\"\n$ WRITE OUFILE \"$ @'dir'GTMINSTALL\"\n$ WRITE OUFILE \"$ EXIT\"\n$ CLOSE OUFILE\n$! Create GTMSTOP.COM\n$ OPEN /WRITE OUFILE VMI$KWD:GTMSTOP.COM\n$ WRITE OUFILE \"$!\"\n$ WRITE OUFILE \"$!\tGTMSTOP.COM stops all the active GT.M processes and does a RUNDOWN.\"\n$ WRITE OUFILE \"$!\tPlace an invocation or copy of this procedure in the site specific\"\n$ WRITE OUFILE \"$!\t shutdown: SYS$MANAGER:SYSHUTDWN to ensure all GT.M databases are\"\n$ WRITE OUFILE \"$!\t properly closed before VMS terminates. GTMSTOP should follow\"\n$ WRITE OUFILE \"$!\t GTCMSTOP and precede GTCXSTOP, if they are used.\"\n$ WRITE OUFILE \"$!\tIf GTMSTOP is not intended to disable subsequent use of GT.M,\"\n$ WRITE OUFILE \"$!\t add a comment (!) before the INSTALL REMOVE GTMSECSHR.\"\n$ WRITE OUFILE \"$!\"\n$ IF .NOT. GTM$DEF_SYS\n$ THEN\n$ WRITE OUFILE \"$ dir = F$ENVIRONMENT(\"\"PROCEDURE\"\")\"\n$ WRITE OUFILE \"$ dir = F$PARSE(dir,,,\"\"DEVICE\"\") + F$PARSE(dir,,,\"\"DIRECTORY\"\")\"\n$ WRITE OUFILE \"$ @'dir'GTMLOGICALS.COM\"\n$ ENDIF\n$ WRITE OUFILE \"$ MUPIP := $GTM$DIST:MUPIP.EXE\"\n$ WRITE OUFILE \"$ STOP := $GTM$DIST:GTM$STOP\"\n$ WRITE OUFILE \"$ STOP 'P1'\"\n$ WRITE OUFILE \"$ MUPIP RUNDOWN\"\n$ WRITE OUFILE \"$ INSTALL REMOVE GTMSECSHR\"\n$ WRITE OUFILE \"$ EXIT\"\n$ IF GTM$DEF_SYS THEN WRITE OUFILE \"$ IF P2 .EQS. \"\"\"\" THEN P2 := /SYSTEM/EXEC\"\n$ WRITE OUFILE \"$ DEASSIGN 'P2' GTMSECSHR\"\n$ CLOSE OUFILE\n$ VMI$CALLBACK MESSAGE I PREINS \"Preparing files for installation.\"\n$! GTMFILES.KIT must be maintained as kit contents change\n$ GTM$HLP_LOG == GTM$DST_LOG\n$ IF GTM$HLP_DIR THEN GTM$HLP_LOG :== VMI$ROOT:[SYSHLP]\n$ OPEN /WRITE OUFILE VMI$KWD:GTMFILES.KIT\n$ IF GTM$MGR_COM\n$ THEN\n$ WRITE OUFILE \"GTM$ GTMINSTALL.COM VMI$ROOT:[SYSMGR] C\"\n$ WRITE OUFILE \"GTM$ GTMLOGICALS.COM VMI$ROOT:[SYSMGR] C\"\n$ WRITE OUFILE \"GTM$ GTMLOGIN.COM VMI$ROOT:[SYSMGR] C\"\n$ WRITE OUFILE \"GTM$ GTMSTART.COM VMI$ROOT:[SYSMGR] C\"\n$ WRITE OUFILE \"GTM$ GTMSTOP.COM VMI$ROOT:[SYSMGR] C\"\n$ ENDIF\n$ WRITE OUFILE \"GTM$ GTMINSTALL.COM ''GTM$DST_LOG'\"\n$ WRITE OUFILE \"GTM$ GTMLOGICALS.COM ''GTM$DST_LOG'\"\n$ WRITE OUFILE \"GTM$ GTMLOGIN.COM ''GTM$DST_LOG'\"\n$ WRITE OUFILE \"GTM$ GTMSTART.COM ''GTM$DST_LOG'\"\n$ WRITE OUFILE \"GTM$ GTMSTOP.COM ''GTM$DST_LOG'\"\n$ WRITE OUFILE \"GTM$ DSE.HLB ''GTM$HLP_LOG'\"\n$ WRITE OUFILE \"GTM$ GDE.HLB ''GTM$HLP_LOG'\"\n$ WRITE OUFILE \"GTM$ LKE.HLB ''GTM$HLP_LOG'\"\n$ WRITE OUFILE \"GTM$ MUMPS.HLB ''GTM$HLP_LOG'\"\n$ WRITE OUFILE \"GTM$ MUPIP.HLB ''GTM$HLP_LOG'\"\n$ WRITE OUFILE \"GTM$ GTMLIB.OLB ''GTM$DST_LOG'\"\n$ WRITE OUFILE \"GTM$ GTMSHR.OLB ''GTM$DST_LOG'\"\n$ WRITE OUFILE \"GTM$ GTMZCALL.MLB ''GTM$DST_LOG'\"\n$ IF ALPHA\n$ THEN\n$ WRITE OUFILE \"GTM$ GTM$DEFAULTS.M64 ''GTM$DST_LOG'\"\n$ ELSE\n$ WRITE OUFILE \"GTM$ GTM$DEFAULTS.MAR ''GTM$DST_LOG'\"\n$ ENDIF\n$ WRITE OUFILE \"GTM$ GTM$CE.H ''GTM$DST_LOG'\"\n$ WRITE OUFILE \"GTM$ GTMCOLLECT.OPT ''GTM$DST_LOG'\"\n$ WRITE OUFILE \"GTM$ GTMCOMMANDS.CLD ''GTM$DST_LOG' C\"\n$ WRITE OUFILE \"GTM$ *.M ''GTM$DST_LOG'\"\n$ CLOSE OUFILE\n$! GTMIMAGES.KIT must be maintained as kit contents change\n$ OPEN /WRITE OUFILE VMI$KWD:GTMIMAGES.KIT\n$ WRITE OUFILE \"GTM$ GTMSECSHR.EXE ''GTM$DST_LOG'\"\n$ WRITE OUFILE \"GTM$ GTMSHR.EXE ''GTM$DST_LOG'\"\n$ WRITE OUFILE \"GTM$ DSE.EXE ''GTM$DST_LOG'\"\n$ WRITE OUFILE \"GTM$ GDE.EXE ''GTM$DST_LOG'\"\n$ WRITE OUFILE \"GTM$ GTM$DMOD.EXE ''GTM$DST_LOG'\"\n$ WRITE OUFILE \"GTM$ LKE.EXE ''GTM$DST_LOG'\"\n$ WRITE OUFILE \"GTM$ MCOMPILE.EXE ''GTM$DST_LOG'\"\n$ WRITE OUFILE \"GTM$ MUPIP.EXE ''GTM$DST_LOG'\"\n$ WRITE OUFILE \"GTM$ GTM$STOP.EXE ''GTM$DST_LOG'\"\n$ CLOSE OUFILE\n$! Provide with file.KITs\n$ VMI$CALLBACK PROVIDE_FILE \"\" VMI$KWD:GTMFILES.KIT \"\" T\n$ VMI$CALLBACK PROVIDE_IMAGE \"\" VMI$KWD:GTMIMAGES.KIT \"\" T\n$ VMI$CALLBACK MESSAGE I FININS \"Finalizing the installation.\"\n$ IF GTM$DEF_DCL THEN VMI$CALLBACK PROVIDE_DCL_COMMAND GTMCOMMANDS.CLD\n$ IF GTM$STARTDB THEN VMI$CALLBACK MODIFY_STARTUP_DB ADD GTMSTART.COM LPMAIN\n$! GTM$INSTALL is TRUE if GTM$RUN_IVP or GTM$PCT_RTN\n$ IF GTM$INSTALL THEN VMI$CALLBACK SET POSTINSTALL YES\n$ IF GTM$RUN_IVP THEN VMI$CALLBACK SET IVP YES\n$ EXIT VMI$_SUCCESS\n$!\n$POSTINSTALL:\n$ ON CONTROL_Y THEN EXIT VMI$_FAILURE\n$! remove MUPIP from command tables for change from V2.4 to V2.5\n$ SET NOON\n$ DEFINE /USER_MODE SYS$OUTPUT NL:\n$ DEFINE /USER_MODE SYS$ERROR NL:\n$ SET COMMAND /TABLE=SYS$COMMON:[SYSLIB]DCLTABLES /OUTPUT=SYS$COMMON:[SYSLIB]DCLTABLES /DELETE=MUPIP\n$ DEFINE /USER_MODE SYS$OUTPUT NL:\n$ DEFINE /USER_MODE SYS$ERROR NL:\n$ SET COMMAND /DELETE=MUPIP\n$ SET ON\n$ IF GTM$MGR_COM\n$ THEN\n$ T1 := SYS$MANAGER:\n$ ELSE\n$ T1 = GTM$DST_LOG\n$ ENDIF\n$ @'T1'GTMSTART\n$ @'T1'GTMLOGIN\n$ ON CONTROL_Y THEN EXIT VMI$_FAILURE\n$ SET DEFAULT GTM$DIST\n$ T2 = F$ENVIRONMENT(\"PROTECTION\")\n$ SET PROTECTION=(S=REWD,O=REWD,G=REWD,W=RE)/DEFAULT\n$ MUMPS GTM$DMOD.M\n$ IF GTM$LNK_LOG\n$ THEN\n$ T1 :=\n$ ELSE\n$ T1 :=,GTMLIB.OLB/LIB,GTMSHR.OLB/LIB\n$ ENDIF\n$ LINK GTM$DMOD.OBJ/NOTRACE'T1\n$ IF GTM$PCT_RTN\n$ THEN\n$ TYPE SYS$INPUT\n\n Compiling the GT.M percent (%) routines.\n$ MUMPS *\n$ IF GTM$DOPURGE THEN PURGE *.*\n$ SET DEFAULT VMI$KWD\n$ ENDIF ! percent routines\n$ SET PROTECTION=('T2')/DEFAULT\n$ EXIT VMI$_SUCCESS\n$!\n$IVP:\n$!\tThe real Installation Verification Procedure.\n$ TYPE SYS$INPUT\n\n GT.M Installation Verification Procedure\n\n$!\tExtract the IVP .COM file from the text library.\n$ LIBRARIAN /EXTRACT=GTM$IVP /OUTPUT=GTM$IVP.COM\tGTM$IVP.TLB\n$ @GTM$IVP\n$ EXIT $STATUS\n$!\n" }, { "path": "src/test/resources/samples/langs/DIGITAL Command Language/ghostpdl_zlib_make_vms.com", "content": "$! make libz under VMS written by\n$! Martin P.J. Zinser\n$!\n$! In case of problems with the install you might contact me at\n$! zinser@zinser.no-ip.info(preferred) or\n$! martin.zinser@eurexchange.com (work)\n$!\n$! Make procedure history for Zlib\n$!\n$!------------------------------------------------------------------------------\n$! Version history\n$! 0.01 20060120 First version to receive a number\n$! 0.02 20061008 Adapt to new Makefile.in\n$! 0.03 20091224 Add support for large file check\n$! 0.04 20100110 Add new gzclose, gzlib, gzread, gzwrite\n$! 0.05 20100221 Exchange zlibdefs.h by zconf.h.in\n$! 0.06 20120111 Fix missing amiss_err, update zconf_h.in, fix new exmples\n$! subdir path, update module search in makefile.in\n$! 0.07 20120115 Triggered by work done by Alexey Chupahin completly redesigned\n$! shared image creation\n$! 0.08 20120219 Make it work on VAX again, pre-load missing symbols to shared\n$! image\n$! 0.09 20120305 SMS. P1 sets builder (\"MMK\", \"MMS\", \" \" (built-in)).\n$! \"\" -> automatic, preference: MMK, MMS, built-in.\n$!\n$ on error then goto err_exit\n$!\n$ true = 1\n$ false = 0\n$ tmpnam = \"temp_\" + f$getjpi(\"\",\"pid\")\n$ tt = tmpnam + \".txt\"\n$ tc = tmpnam + \".c\"\n$ th = tmpnam + \".h\"\n$ define/nolog tconfig 'th'\n$ its_decc = false\n$ its_vaxc = false\n$ its_gnuc = false\n$ s_case = False\n$!\n$! Setup variables holding \"config\" information\n$!\n$ Make = \"''p1'\"\n$ name = \"Zlib\"\n$ version = \"?.?.?\"\n$ v_string = \"ZLIB_VERSION\"\n$ v_file = \"zlib.h\"\n$ ccopt = \"/include = []\"\n$ lopts = \"\"\n$ dnsrl = \"\"\n$ aconf_in_file = \"zconf.h.in#zconf.h_in#zconf_h.in\"\n$ conf_check_string = \"\"\n$ linkonly = false\n$ optfile = name + \".opt\"\n$ mapfile = name + \".map\"\n$ libdefs = \"\"\n$ vax = f$getsyi(\"HW_MODEL\").lt.1024\n$ axp = f$getsyi(\"HW_MODEL\").ge.1024 .and. f$getsyi(\"HW_MODEL\").lt.4096\n$ ia64 = f$getsyi(\"HW_MODEL\").ge.4096\n$!\n$! 2012-03-05 SMS.\n$! Why is this needed? And if it is needed, why not simply \".not. vax\"?\n$!\n$!!! if axp .or. ia64 then set proc/parse=extended\n$!\n$ whoami = f$parse(f$environment(\"Procedure\"),,,,\"NO_CONCEAL\")\n$ mydef = F$parse(whoami,,,\"DEVICE\")\n$ mydir = f$parse(whoami,,,\"DIRECTORY\") - \"][\"\n$ myproc = f$parse(whoami,,,\"Name\") + f$parse(whoami,,,\"type\")\n$!\n$! Check for MMK/MMS\n$!\n$ if (Make .eqs. \"\")\n$ then\n$ If F$Search (\"Sys$System:MMS.EXE\") .nes. \"\" Then Make = \"MMS\"\n$ If F$Type (MMK) .eqs. \"STRING\" Then Make = \"MMK\"\n$ else\n$ Make = f$edit( Make, \"trim\")\n$ endif\n$!\n$ gosub find_version\n$!\n$ open/write topt tmp.opt\n$ open/write optf 'optfile'\n$!\n$ gosub check_opts\n$!\n$! Look for the compiler used\n$!\n$ gosub check_compiler\n$ close topt\n$ close optf\n$!\n$ if its_decc\n$ then\n$ ccopt = \"/prefix=all\" + ccopt\n$ if f$trnlnm(\"SYS\") .eqs. \"\"\n$ then\n$ if axp\n$ then\n$ define sys sys$library:\n$ else\n$ ccopt = \"/decc\" + ccopt\n$ define sys decc$library_include:\n$ endif\n$ endif\n$!\n$! 2012-03-05 SMS.\n$! Why /NAMES = AS_IS? Why not simply \".not. vax\"? And why not on VAX?\n$!\n$ if axp .or. ia64\n$ then\n$ ccopt = ccopt + \"/name=as_is/opt=(inline=speed)\"\n$ s_case = true\n$ endif\n$ endif\n$ if its_vaxc .or. its_gnuc\n$ then\n$ if f$trnlnm(\"SYS\").eqs.\"\" then define sys sys$library:\n$ endif\n$!\n$! Build a fake configure input header\n$!\n$ open/write conf_hin config.hin\n$ write conf_hin \"#undef _LARGEFILE64_SOURCE\"\n$ close conf_hin\n$!\n$!\n$ i = 0\n$FIND_ACONF:\n$ fname = f$element(i,\"#\",aconf_in_file)\n$ if fname .eqs. \"#\" then goto AMISS_ERR\n$ if f$search(fname) .eqs. \"\"\n$ then\n$ i = i + 1\n$ goto find_aconf\n$ endif\n$ open/read/err=aconf_err aconf_in 'fname'\n$ open/write aconf zconf.h\n$ACONF_LOOP:\n$ read/end_of_file=aconf_exit aconf_in line\n$ work = f$edit(line, \"compress,trim\")\n$ if f$extract(0,6,work) .nes. \"#undef\"\n$ then\n$ if f$extract(0,12,work) .nes. \"#cmakedefine\"\n$ then\n$ write aconf line\n$ endif\n$ else\n$ cdef = f$element(1,\" \",work)\n$ gosub check_config\n$ endif\n$ goto aconf_loop\n$ACONF_EXIT:\n$ write aconf \"\"\n$ write aconf \"/* VMS specifics added by make_vms.com: */\"\n$ write aconf \"#define VMS 1\"\n$ write aconf \"#include \"\n$ write aconf \"#include \"\n$ write aconf \"#ifdef _LARGEFILE\"\n$ write aconf \"# define off64_t __off64_t\"\n$ write aconf \"# define fopen64 fopen\"\n$ write aconf \"# define fseeko64 fseeko\"\n$ write aconf \"# define lseek64 lseek\"\n$ write aconf \"# define ftello64 ftell\"\n$ write aconf \"#endif\"\n$ write aconf \"#if !defined( __VAX) && (__CRTL_VER >= 70312000)\"\n$ write aconf \"# define HAVE_VSNPRINTF\"\n$ write aconf \"#endif\"\n$ close aconf_in\n$ close aconf\n$ if f$search(\"''th'\") .nes. \"\" then delete 'th';*\n$! Build the thing plain or with mms\n$!\n$ write sys$output \"Compiling Zlib sources ...\"\n$ if make.eqs.\"\"\n$ then\n$ if (f$search( \"example.obj;*\") .nes. \"\") then delete example.obj;*\n$ if (f$search( \"minigzip.obj;*\") .nes. \"\") then delete minigzip.obj;*\n$ CALL MAKE adler32.OBJ \"CC ''CCOPT' adler32\" -\n adler32.c zlib.h zconf.h\n$ CALL MAKE compress.OBJ \"CC ''CCOPT' compress\" -\n compress.c zlib.h zconf.h\n$ CALL MAKE crc32.OBJ \"CC ''CCOPT' crc32\" -\n crc32.c zlib.h zconf.h\n$ CALL MAKE deflate.OBJ \"CC ''CCOPT' deflate\" -\n deflate.c deflate.h zutil.h zlib.h zconf.h\n$ CALL MAKE gzclose.OBJ \"CC ''CCOPT' gzclose\" -\n gzclose.c zutil.h zlib.h zconf.h\n$ CALL MAKE gzlib.OBJ \"CC ''CCOPT' gzlib\" -\n gzlib.c zutil.h zlib.h zconf.h\n$ CALL MAKE gzread.OBJ \"CC ''CCOPT' gzread\" -\n gzread.c zutil.h zlib.h zconf.h\n$ CALL MAKE gzwrite.OBJ \"CC ''CCOPT' gzwrite\" -\n gzwrite.c zutil.h zlib.h zconf.h\n$ CALL MAKE infback.OBJ \"CC ''CCOPT' infback\" -\n infback.c zutil.h inftrees.h inflate.h inffast.h inffixed.h\n$ CALL MAKE inffast.OBJ \"CC ''CCOPT' inffast\" -\n inffast.c zutil.h zlib.h zconf.h inffast.h\n$ CALL MAKE inflate.OBJ \"CC ''CCOPT' inflate\" -\n inflate.c zutil.h zlib.h zconf.h infblock.h\n$ CALL MAKE inftrees.OBJ \"CC ''CCOPT' inftrees\" -\n inftrees.c zutil.h zlib.h zconf.h inftrees.h\n$ CALL MAKE trees.OBJ \"CC ''CCOPT' trees\" -\n trees.c deflate.h zutil.h zlib.h zconf.h\n$ CALL MAKE uncompr.OBJ \"CC ''CCOPT' uncompr\" -\n uncompr.c zlib.h zconf.h\n$ CALL MAKE zutil.OBJ \"CC ''CCOPT' zutil\" -\n zutil.c zutil.h zlib.h zconf.h\n$ write sys$output \"Building Zlib ...\"\n$ CALL MAKE libz.OLB \"lib/crea libz.olb *.obj\" *.OBJ\n$ write sys$output \"Building example...\"\n$ CALL MAKE example.OBJ \"CC ''CCOPT' [.test]example\" -\n [.test]example.c zlib.h zconf.h\n$ call make example.exe \"LINK example,libz.olb/lib\" example.obj libz.olb\n$ write sys$output \"Building minigzip...\"\n$ CALL MAKE minigzip.OBJ \"CC ''CCOPT' [.test]minigzip\" -\n [.test]minigzip.c zlib.h zconf.h\n$ call make minigzip.exe -\n \"LINK minigzip,libz.olb/lib\" -\n minigzip.obj libz.olb\n$ else\n$ gosub crea_mms\n$ write sys$output \"Make ''name' ''version' with ''Make' \"\n$ 'make'\n$ endif\n$!\n$! Create shareable image\n$!\n$ gosub crea_olist\n$ write sys$output \"Creating libzshr.exe\"\n$ call map_2_shopt 'mapfile' 'optfile'\n$ LINK_'lopts'/SHARE=libzshr.exe modules.opt/opt,'optfile'/opt\n$ write sys$output \"Zlib build completed\"\n$ delete/nolog tmp.opt;*\n$ exit\n$AMISS_ERR:\n$ write sys$output \"No source for config.hin found.\"\n$ write sys$output \"Tried any of ''aconf_in_file'\"\n$ goto err_exit\n$CC_ERR:\n$ write sys$output \"C compiler required to build ''name'\"\n$ goto err_exit\n$ERR_EXIT:\n$ set message/facil/ident/sever/text\n$ close/nolog optf\n$ close/nolog topt\n$ close/nolog aconf_in\n$ close/nolog aconf\n$ close/nolog out\n$ close/nolog min\n$ close/nolog mod\n$ close/nolog h_in\n$ write sys$output \"Exiting...\"\n$ exit 2\n$!\n$!\n$MAKE: SUBROUTINE !SUBROUTINE TO CHECK DEPENDENCIES\n$ V = 'F$Verify(0)\n$! P1 = What we are trying to make\n$! P2 = Command to make it\n$! P3 - P8 What it depends on\n$\n$ If F$Search(P1) .Eqs. \"\" Then Goto Makeit\n$ Time = F$CvTime(F$File(P1,\"RDT\"))\n$arg=3\n$Loop:\n$ Argument = P'arg\n$ If Argument .Eqs. \"\" Then Goto Exit\n$ El=0\n$Loop2:\n$ File = F$Element(El,\" \",Argument)\n$ If File .Eqs. \" \" Then Goto Endl\n$ AFile = \"\"\n$Loop3:\n$ OFile = AFile\n$ AFile = F$Search(File)\n$ If AFile .Eqs. \"\" .Or. AFile .Eqs. OFile Then Goto NextEl\n$ If F$CvTime(F$File(AFile,\"RDT\")) .Ges. Time Then Goto Makeit\n$ Goto Loop3\n$NextEL:\n$ El = El + 1\n$ Goto Loop2\n$EndL:\n$ arg=arg+1\n$ If arg .Le. 8 Then Goto Loop\n$ Goto Exit\n$\n$Makeit:\n$ VV=F$VERIFY(0)\n$ write sys$output P2\n$ 'P2\n$ VV='F$Verify(VV)\n$Exit:\n$ If V Then Set Verify\n$ENDSUBROUTINE\n$!------------------------------------------------------------------------------\n$!\n$! Check command line options and set symbols accordingly\n$!\n$!------------------------------------------------------------------------------\n$! Version history\n$! 0.01 20041206 First version to receive a number\n$! 0.02 20060126 Add new \"HELP\" target\n$ CHECK_OPTS:\n$ i = 1\n$ OPT_LOOP:\n$ if i .lt. 9\n$ then\n$ cparm = f$edit(p'i',\"upcase\")\n$!\n$! Check if parameter actually contains something\n$!\n$ if f$edit(cparm,\"trim\") .nes. \"\"\n$ then\n$ if cparm .eqs. \"DEBUG\"\n$ then\n$ ccopt = ccopt + \"/noopt/deb\"\n$ lopts = lopts + \"/deb\"\n$ endif\n$ if f$locate(\"CCOPT=\",cparm) .lt. f$length(cparm)\n$ then\n$ start = f$locate(\"=\",cparm) + 1\n$ len = f$length(cparm) - start\n$ ccopt = ccopt + f$extract(start,len,cparm)\n$ if f$locate(\"AS_IS\",f$edit(ccopt,\"UPCASE\")) .lt. f$length(ccopt) -\n then s_case = true\n$ endif\n$ if cparm .eqs. \"LINK\" then linkonly = true\n$ if f$locate(\"LOPTS=\",cparm) .lt. f$length(cparm)\n$ then\n$ start = f$locate(\"=\",cparm) + 1\n$ len = f$length(cparm) - start\n$ lopts = lopts + f$extract(start,len,cparm)\n$ endif\n$ if f$locate(\"CC=\",cparm) .lt. f$length(cparm)\n$ then\n$ start = f$locate(\"=\",cparm) + 1\n$ len = f$length(cparm) - start\n$ cc_com = f$extract(start,len,cparm)\n if (cc_com .nes. \"DECC\") .and. -\n (cc_com .nes. \"VAXC\") .and. -\n (cc_com .nes. \"GNUC\")\n$ then\n$ write sys$output \"Unsupported compiler choice ''cc_com' ignored\"\n$ write sys$output \"Use DECC, VAXC, or GNUC instead\"\n$ else\n$ if cc_com .eqs. \"DECC\" then its_decc = true\n$ if cc_com .eqs. \"VAXC\" then its_vaxc = true\n$ if cc_com .eqs. \"GNUC\" then its_gnuc = true\n$ endif\n$ endif\n$ if f$locate(\"MAKE=\",cparm) .lt. f$length(cparm)\n$ then\n$ start = f$locate(\"=\",cparm) + 1\n$ len = f$length(cparm) - start\n$ mmks = f$extract(start,len,cparm)\n$ if (mmks .eqs. \"MMK\") .or. (mmks .eqs. \"MMS\")\n$ then\n$ make = mmks\n$ else\n$ write sys$output \"Unsupported make choice ''mmks' ignored\"\n$ write sys$output \"Use MMK or MMS instead\"\n$ endif\n$ endif\n$ if cparm .eqs. \"HELP\" then gosub bhelp\n$ endif\n$ i = i + 1\n$ goto opt_loop\n$ endif\n$ return\n$!------------------------------------------------------------------------------\n$!\n$! Look for the compiler used\n$!\n$! Version history\n$! 0.01 20040223 First version to receive a number\n$! 0.02 20040229 Save/set value of decc$no_rooted_search_lists\n$! 0.03 20060202 Extend handling of GNU C\n$! 0.04 20090402 Compaq -> hp\n$CHECK_COMPILER:\n$ if (.not. (its_decc .or. its_vaxc .or. its_gnuc))\n$ then\n$ its_decc = (f$search(\"SYS$SYSTEM:DECC$COMPILER.EXE\") .nes. \"\")\n$ its_vaxc = .not. its_decc .and. (F$Search(\"SYS$System:VAXC.Exe\") .nes. \"\")\n$ its_gnuc = .not. (its_decc .or. its_vaxc) .and. (f$trnlnm(\"gnu_cc\") .nes. \"\")\n$ endif\n$!\n$! Exit if no compiler available\n$!\n$ if (.not. (its_decc .or. its_vaxc .or. its_gnuc))\n$ then goto CC_ERR\n$ else\n$ if its_decc\n$ then\n$ write sys$output \"CC compiler check ... hp C\"\n$ if f$trnlnm(\"decc$no_rooted_search_lists\") .nes. \"\"\n$ then\n$ dnrsl = f$trnlnm(\"decc$no_rooted_search_lists\")\n$ endif\n$ define/nolog decc$no_rooted_search_lists 1\n$ else\n$ if its_vaxc then write sys$output \"CC compiler check ... VAX C\"\n$ if its_gnuc\n$ then\n$ write sys$output \"CC compiler check ... GNU C\"\n$ if f$trnlnm(topt) then write topt \"gnu_cc:[000000]gcclib.olb/lib\"\n$ if f$trnlnm(optf) then write optf \"gnu_cc:[000000]gcclib.olb/lib\"\n$ cc = \"gcc\"\n$ endif\n$ if f$trnlnm(topt) then write topt \"sys$share:vaxcrtl.exe/share\"\n$ if f$trnlnm(optf) then write optf \"sys$share:vaxcrtl.exe/share\"\n$ endif\n$ endif\n$ return\n$!------------------------------------------------------------------------------\n$!\n$! If MMS/MMK are available dump out the descrip.mms if required\n$!\n$CREA_MMS:\n$ write sys$output \"Creating descrip.mms...\"\n$ create descrip.mms\n$ open/append out descrip.mms\n$ copy sys$input: out\n$ deck\n# descrip.mms: MMS description file for building zlib on VMS\n# written by Martin P.J. Zinser\n# \n\nOBJS = adler32.obj, compress.obj, crc32.obj, gzclose.obj, gzlib.obj\\\n gzread.obj, gzwrite.obj, uncompr.obj, infback.obj\\\n deflate.obj, trees.obj, zutil.obj, inflate.obj, \\\n inftrees.obj, inffast.obj\n\n$ eod\n$ write out \"CFLAGS=\", ccopt\n$ write out \"LOPTS=\", lopts\n$ write out \"all : example.exe minigzip.exe libz.olb\"\n$ copy sys$input: out\n$ deck\n @ write sys$output \" Example applications available\"\n\nlibz.olb : libz.olb($(OBJS))\n\t@ write sys$output \" libz available\"\n\nexample.exe : example.obj libz.olb\n link $(LOPTS) example,libz.olb/lib\n\nminigzip.exe : minigzip.obj libz.olb\n link $(LOPTS) minigzip,libz.olb/lib\n\nclean :\n\tdelete *.obj;*,libz.olb;*,*.opt;*,*.exe;*\n\n\n# Other dependencies.\nadler32.obj : adler32.c zutil.h zlib.h zconf.h\ncompress.obj : compress.c zlib.h zconf.h\ncrc32.obj : crc32.c zutil.h zlib.h zconf.h\ndeflate.obj : deflate.c deflate.h zutil.h zlib.h zconf.h\nexample.obj : [.test]example.c zlib.h zconf.h\ngzclose.obj : gzclose.c zutil.h zlib.h zconf.h\ngzlib.obj : gzlib.c zutil.h zlib.h zconf.h\ngzread.obj : gzread.c zutil.h zlib.h zconf.h\ngzwrite.obj : gzwrite.c zutil.h zlib.h zconf.h\ninffast.obj : inffast.c zutil.h zlib.h zconf.h inftrees.h inffast.h\ninflate.obj : inflate.c zutil.h zlib.h zconf.h\ninftrees.obj : inftrees.c zutil.h zlib.h zconf.h inftrees.h\nminigzip.obj : [.test]minigzip.c zlib.h zconf.h\ntrees.obj : trees.c deflate.h zutil.h zlib.h zconf.h\nuncompr.obj : uncompr.c zlib.h zconf.h\nzutil.obj : zutil.c zutil.h zlib.h zconf.h\ninfback.obj : infback.c zutil.h inftrees.h inflate.h inffast.h inffixed.h\n$ eod\n$ close out\n$ return\n$!------------------------------------------------------------------------------\n$!\n$! Read list of core library sources from makefile.in and create options\n$! needed to build shareable image\n$!\n$CREA_OLIST:\n$ open/read min makefile.in\n$ open/write mod modules.opt\n$ src_check_list = \"OBJZ =#OBJG =\"\n$MRLOOP:\n$ read/end=mrdone min rec\n$ i = 0\n$SRC_CHECK_LOOP:\n$ src_check = f$element(i, \"#\", src_check_list)\n$ i = i+1\n$ if src_check .eqs. \"#\" then goto mrloop\n$ if (f$extract(0,6,rec) .nes. src_check) then goto src_check_loop\n$ rec = rec - src_check\n$ gosub extra_filnam\n$ if (f$element(1,\"\\\",rec) .eqs. \"\\\") then goto mrloop\n$MRSLOOP:\n$ read/end=mrdone min rec\n$ gosub extra_filnam\n$ if (f$element(1,\"\\\",rec) .nes. \"\\\") then goto mrsloop\n$MRDONE:\n$ close min\n$ close mod\n$ return\n$!------------------------------------------------------------------------------\n$!\n$! Take record extracted in crea_olist and split it into single filenames\n$!\n$EXTRA_FILNAM:\n$ myrec = f$edit(rec - \"\\\", \"trim,compress\")\n$ i = 0\n$FELOOP:\n$ srcfil = f$element(i,\" \", myrec)\n$ if (srcfil .nes. \" \")\n$ then\n$ write mod f$parse(srcfil,,,\"NAME\"), \".obj\"\n$ i = i + 1\n$ goto feloop\n$ endif\n$ return\n$!------------------------------------------------------------------------------\n$!\n$! Find current Zlib version number\n$!\n$FIND_VERSION:\n$ open/read h_in 'v_file'\n$hloop:\n$ read/end=hdone h_in rec\n$ rec = f$edit(rec,\"TRIM\")\n$ if (f$extract(0,1,rec) .nes. \"#\") then goto hloop\n$ rec = f$edit(rec - \"#\", \"TRIM\")\n$ if f$element(0,\" \",rec) .nes. \"define\" then goto hloop\n$ if f$element(1,\" \",rec) .eqs. v_string\n$ then\n$ version = 'f$element(2,\" \",rec)'\n$ goto hdone\n$ endif\n$ goto hloop\n$hdone:\n$ close h_in\n$ return\n$!------------------------------------------------------------------------------\n$!\n$CHECK_CONFIG:\n$!\n$ in_ldef = f$locate(cdef,libdefs)\n$ if (in_ldef .lt. f$length(libdefs))\n$ then\n$ write aconf \"#define ''cdef' 1\"\n$ libdefs = f$extract(0,in_ldef,libdefs) + -\n f$extract(in_ldef + f$length(cdef) + 1, -\n f$length(libdefs) - in_ldef - f$length(cdef) - 1, -\n libdefs)\n$ else\n$ if (f$type('cdef') .eqs. \"INTEGER\")\n$ then\n$ write aconf \"#define ''cdef' \", 'cdef'\n$ else\n$ if (f$type('cdef') .eqs. \"STRING\")\n$ then\n$ write aconf \"#define ''cdef' \", \"\"\"\", '''cdef'', \"\"\"\"\n$ else\n$ gosub check_cc_def\n$ endif\n$ endif\n$ endif\n$ return\n$!------------------------------------------------------------------------------\n$!\n$! Check if this is a define relating to the properties of the C/C++\n$! compiler\n$!\n$ CHECK_CC_DEF:\n$ if (cdef .eqs. \"_LARGEFILE64_SOURCE\")\n$ then\n$ copy sys$input: 'tc'\n$ deck\n#include \"tconfig\"\n#define _LARGEFILE\n#include \n\nint main(){\nFILE *fp;\n fp = fopen(\"temp.txt\",\"r\");\n fseeko(fp,1,SEEK_SET);\n fclose(fp);\n}\n\n$ eod\n$ test_inv = false\n$ comm_h = false\n$ gosub cc_prop_check\n$ return\n$ endif\n$ write aconf \"/* \", line, \" */\"\n$ return\n$!------------------------------------------------------------------------------\n$!\n$! Check for properties of C/C++ compiler\n$!\n$! Version history\n$! 0.01 20031020 First version to receive a number\n$! 0.02 20031022 Added logic for defines with value\n$! 0.03 20040309 Make sure local config file gets not deleted\n$! 0.04 20041230 Also write include for configure run\n$! 0.05 20050103 Add processing of \"comment defines\"\n$CC_PROP_CHECK:\n$ cc_prop = true\n$ is_need = false\n$ is_need = (f$extract(0,4,cdef) .eqs. \"NEED\") .or. (test_inv .eq. true)\n$ if f$search(th) .eqs. \"\" then create 'th'\n$ set message/nofac/noident/nosever/notext\n$ on error then continue\n$ cc 'tmpnam'\n$ if .not. ($status) then cc_prop = false\n$ on error then continue\n$! The headers might lie about the capabilities of the RTL\n$ link 'tmpnam',tmp.opt/opt\n$ if .not. ($status) then cc_prop = false\n$ set message/fac/ident/sever/text\n$ on error then goto err_exit\n$ delete/nolog 'tmpnam'.*;*/exclude='th'\n$ if (cc_prop .and. .not. is_need) .or. -\n (.not. cc_prop .and. is_need)\n$ then\n$ write sys$output \"Checking for ''cdef'... yes\"\n$ if f$type('cdef_val'_yes) .nes. \"\"\n$ then\n$ if f$type('cdef_val'_yes) .eqs. \"INTEGER\" -\n then call write_config f$fao(\"#define !AS !UL\",cdef,'cdef_val'_yes)\n$ if f$type('cdef_val'_yes) .eqs. \"STRING\" -\n then call write_config f$fao(\"#define !AS !AS\",cdef,'cdef_val'_yes)\n$ else\n$ call write_config f$fao(\"#define !AS 1\",cdef)\n$ endif\n$ if (cdef .eqs. \"HAVE_FSEEKO\") .or. (cdef .eqs. \"_LARGE_FILES\") .or. -\n (cdef .eqs. \"_LARGEFILE64_SOURCE\") then -\n call write_config f$string(\"#define _LARGEFILE 1\")\n$ else\n$ write sys$output \"Checking for ''cdef'... no\"\n$ if (comm_h)\n$ then\n call write_config f$fao(\"/* !AS */\",line)\n$ else\n$ if f$type('cdef_val'_no) .nes. \"\"\n$ then\n$ if f$type('cdef_val'_no) .eqs. \"INTEGER\" -\n then call write_config f$fao(\"#define !AS !UL\",cdef,'cdef_val'_no)\n$ if f$type('cdef_val'_no) .eqs. \"STRING\" -\n then call write_config f$fao(\"#define !AS !AS\",cdef,'cdef_val'_no)\n$ else\n$ call write_config f$fao(\"#undef !AS\",cdef)\n$ endif\n$ endif\n$ endif\n$ return\n$!------------------------------------------------------------------------------\n$!\n$! Check for properties of C/C++ compiler with multiple result values\n$!\n$! Version history\n$! 0.01 20040127 First version\n$! 0.02 20050103 Reconcile changes from cc_prop up to version 0.05\n$CC_MPROP_CHECK:\n$ cc_prop = true\n$ i = 1\n$ idel = 1\n$ MT_LOOP:\n$ if f$type(result_'i') .eqs. \"STRING\"\n$ then\n$ set message/nofac/noident/nosever/notext\n$ on error then continue\n$ cc 'tmpnam'_'i'\n$ if .not. ($status) then cc_prop = false\n$ on error then continue\n$! The headers might lie about the capabilities of the RTL\n$ link 'tmpnam'_'i',tmp.opt/opt\n$ if .not. ($status) then cc_prop = false\n$ set message/fac/ident/sever/text\n$ on error then goto err_exit\n$ delete/nolog 'tmpnam'_'i'.*;*\n$ if (cc_prop)\n$ then\n$ write sys$output \"Checking for ''cdef'... \", mdef_'i'\n$ if f$type(mdef_'i') .eqs. \"INTEGER\" -\n then call write_config f$fao(\"#define !AS !UL\",cdef,mdef_'i')\n$ if f$type('cdef_val'_yes) .eqs. \"STRING\" -\n then call write_config f$fao(\"#define !AS !AS\",cdef,mdef_'i')\n$ goto msym_clean\n$ else\n$ i = i + 1\n$ goto mt_loop\n$ endif\n$ endif\n$ write sys$output \"Checking for ''cdef'... no\"\n$ call write_config f$fao(\"#undef !AS\",cdef)\n$ MSYM_CLEAN:\n$ if (idel .le. msym_max)\n$ then\n$ delete/sym mdef_'idel'\n$ idel = idel + 1\n$ goto msym_clean\n$ endif\n$ return\n$!------------------------------------------------------------------------------\n$!\n$! Write configuration to both permanent and temporary config file\n$!\n$! Version history\n$! 0.01 20031029 First version to receive a number\n$!\n$WRITE_CONFIG: SUBROUTINE\n$ write aconf 'p1'\n$ open/append confh 'th'\n$ write confh 'p1'\n$ close confh\n$ENDSUBROUTINE\n$!------------------------------------------------------------------------------\n$!\n$! Analyze the project map file and create the symbol vector for a shareable\n$! image from it\n$!\n$! Version history\n$! 0.01 20120128 First version\n$! 0.02 20120226 Add pre-load logic\n$!\n$ MAP_2_SHOPT: Subroutine\n$!\n$ SAY := \"WRITE_ SYS$OUTPUT\"\n$!\n$ IF F$SEARCH(\"''P1'\") .EQS. \"\"\n$ THEN\n$ SAY \"MAP_2_SHOPT-E-NOSUCHFILE: Error, inputfile ''p1' not available\"\n$ goto exit_m2s\n$ ENDIF\n$ IF \"''P2'\" .EQS. \"\"\n$ THEN\n$ SAY \"MAP_2_SHOPT: Error, no output file provided\"\n$ goto exit_m2s\n$ ENDIF\n$!\n$ module1 = \"deflate#deflateEnd#deflateInit_#deflateParams#deflateSetDictionary\"\n$ module2 = \"gzclose#gzerror#gzgetc#gzgets#gzopen#gzprintf#gzputc#gzputs#gzread\"\n$ module3 = \"gzseek#gztell#inflate#inflateEnd#inflateInit_#inflateSetDictionary\"\n$ module4 = \"inflateSync#uncompress#zlibVersion#compress\"\n$ open/read map 'p1\n$ if axp .or. ia64\n$ then\n$ open/write aopt a.opt\n$ open/write bopt b.opt\n$ write aopt \" CASE_SENSITIVE=YES\"\n$ write bopt \"SYMBOL_VECTOR= (-\"\n$ mod_sym_num = 1\n$ MOD_SYM_LOOP:\n$ if f$type(module'mod_sym_num') .nes. \"\"\n$ then\n$ mod_in = 0\n$ MOD_SYM_IN:\n$ shared_proc = f$element(mod_in, \"#\", module'mod_sym_num')\n$ if shared_proc .nes. \"#\"\n$ then\n$ write aopt f$fao(\" symbol_vector=(!AS/!AS=PROCEDURE)\",-\n \t\t f$edit(shared_proc,\"upcase\"),shared_proc)\n$ write bopt f$fao(\"!AS=PROCEDURE,-\",shared_proc)\n$ mod_in = mod_in + 1\n$ goto mod_sym_in\n$ endif\n$ mod_sym_num = mod_sym_num + 1\n$ goto mod_sym_loop\n$ endif\n$MAP_LOOP:\n$ read/end=map_end map line\n$ if (f$locate(\"{\",line).lt. f$length(line)) .or. -\n (f$locate(\"global:\", line) .lt. f$length(line))\n$ then\n$ proc = true\n$ goto map_loop\n$ endif\n$ if f$locate(\"}\",line).lt. f$length(line) then proc = false\n$ if f$locate(\"local:\", line) .lt. f$length(line) then proc = false\n$ if proc\n$ then\n$ shared_proc = f$edit(line,\"collapse\")\n$ chop_semi = f$locate(\";\", shared_proc)\n$ if chop_semi .lt. f$length(shared_proc) then -\n shared_proc = f$extract(0, chop_semi, shared_proc)\n$ write aopt f$fao(\" symbol_vector=(!AS/!AS=PROCEDURE)\",-\n \t\t\t f$edit(shared_proc,\"upcase\"),shared_proc)\n$ write bopt f$fao(\"!AS=PROCEDURE,-\",shared_proc)\n$ endif\n$ goto map_loop\n$MAP_END:\n$ close/nolog aopt\n$ close/nolog bopt\n$ open/append libopt 'p2'\n$ open/read aopt a.opt\n$ open/read bopt b.opt\n$ALOOP:\n$ read/end=aloop_end aopt line\n$ write libopt line\n$ goto aloop\n$ALOOP_END:\n$ close/nolog aopt\n$ sv = \"\"\n$BLOOP:\n$ read/end=bloop_end bopt svn\n$ if (svn.nes.\"\")\n$ then\n$ if (sv.nes.\"\") then write libopt sv\n$ sv = svn\n$ endif\n$ goto bloop\n$BLOOP_END:\n$ write libopt f$extract(0,f$length(sv)-2,sv), \"-\"\n$ write libopt \")\"\n$ close/nolog bopt\n$ delete/nolog/noconf a.opt;*,b.opt;*\n$ else\n$ if vax\n$ then\n$ open/append libopt 'p2'\n$ mod_sym_num = 1\n$ VMOD_SYM_LOOP:\n$ if f$type(module'mod_sym_num') .nes. \"\"\n$ then\n$ mod_in = 0\n$ VMOD_SYM_IN:\n$ shared_proc = f$element(mod_in, \"#\", module'mod_sym_num')\n$ if shared_proc .nes. \"#\"\n$ then\n$ \t write libopt f$fao(\"UNIVERSAL=!AS\",-\n \t \t\t\t f$edit(shared_proc,\"upcase\"))\n$ mod_in = mod_in + 1\n$ goto vmod_sym_in\n$ endif\n$ mod_sym_num = mod_sym_num + 1\n$ goto vmod_sym_loop\n$ endif\n$VMAP_LOOP:\n$ \t read/end=vmap_end map line\n$ \t if (f$locate(\"{\",line).lt. f$length(line)) .or. -\n \t (f$locate(\"global:\", line) .lt. f$length(line))\n$ \t then\n$ \t proc = true\n$ \t goto vmap_loop\n$ \t endif\n$ \t if f$locate(\"}\",line).lt. f$length(line) then proc = false\n$ \t if f$locate(\"local:\", line) .lt. f$length(line) then proc = false\n$ \t if proc\n$ \t then\n$ \t shared_proc = f$edit(line,\"collapse\")\n$ \t chop_semi = f$locate(\";\", shared_proc)\n$ \t if chop_semi .lt. f$length(shared_proc) then -\n \t \t shared_proc = f$extract(0, chop_semi, shared_proc)\n$ \t write libopt f$fao(\"UNIVERSAL=!AS\",-\n \t \t\t\t f$edit(shared_proc,\"upcase\"))\n$ \t endif\n$ \t goto vmap_loop\n$VMAP_END:\n$ else\n$ write sys$output \"Unknown Architecture (Not VAX, AXP, or IA64)\"\n$ write sys$output \"No options file created\"\n$ endif\n$ endif\n$ EXIT_M2S:\n$ close/nolog map\n$ close/nolog libopt\n$ endsubroutine\n" }, { "path": "src/test/resources/samples/langs/DIGITAL Command Language/libxslt_build.com", "content": "$! BUILD_XSLT.COM\n$!\n$! Build the XSLT library\n$!\n$! Arguments:\n$!\n$!\tp1\t- \"DEBUG\" is you want to build with debug\n$!\n$! This package requires libxml to have already been installed. You need\n$! to ensure that the logical name LIBXML is defined and points to the \n$! directory containing libxml's .h files\n$!\n$! This procedure creates the object libraries\n$!\n$!\tXML_LIBDIR:LIBXSLT.OLB\n$!\tXML_LIBDIR:LIBEXSLT.OLB\n$!\n$! and the program\n$!\n$!\tXSLTPROC\n$!\n$! After the library is built, you can link these routines into\n$! your code with the command \n$!\n$! \tLINK your_modules,XML_LIBDIR:LIBEXSLT/LIB,LIBXSLT/LIBRARY,LIBXML/LIB\n$!\n$! Change History\n$! --------------\n$! Command file author : John A Fotheringham (jaf@jafsoft.com)\n$! Last update : 2 Nov 2001\n$! \n$!- configuration -------------------------------------------------------------\n$!\n$!- compile command.\n$!\n$ cc_opts = \"/INCLUDE=([],XML_SRCDIR:,[-.libxslt])/NAMES=(SHORTENED)/FLOAT=IEEE/IEEE_MODE=DENORM_RESULTS\"\n$!\n$ if p1.eqs.\"DEBUG\"\n$ then\n$ debug = \"Y\"\n$ cc_command = \"CC''cc_opts'/DEBUG/NOOPTIMIZE/LIST/SHOW=ALL\"\n$ else\n$ debug = \"N\"\n$ cc_command = \"CC''cc_opts'\"\n$ endif\n$!\n$!- configure multiple build passes for each library. -------------------------\n$!\n$! For each pass:\n$!\n$! \"libname\" is the name of the library or module being created\n$!\n$! \"progname\" is the name of the program being created\n$!\n$! \"src\" is the list of sources to be built into the library or program\n$!\t- This should be compared to the definition of \n$!\t \"_la_SOURCES\" in the MAKEFILE.IN file in \n$!\t corresponding directory.\n$!\n$ num_passes = 3\t! two libraries and a program\n$!\n$!- pass 1 - library LIBXSLT\n$!\n$ libname_1 = \"LIBXSLT\"\n$ h_file_1 = \"xslt.h\"\n$ progname_1 = \"\"\n$!\n$ ! see \"libxslt_la_SOURCES\" in [.libxslt]makefile.in\n$ src_1 = \"xslt.c xsltutils.c pattern.c templates.c variables.c keys.c\"\n$ src_1 = src_1 + \" numbers.c extensions.c extra.c functions.c\"\n$ src_1 = src_1 + \" namespaces.c imports.c attributes.c documents.c\"\n$ src_1 = src_1 + \" preproc.c transform.c security.c\"\n$!\n$!- pass 2 - library LIBEXSLT\n$!\n$ libname_2 = \"LIBEXSLT\"\n$ h_file_2 = \"exslt.h\"\n$ progname_2 = \"\"\n$!\n$ ! see \"libexslt_la_SOURCES\" in [.libexslt]makefile.in\n$ src_2 = \"exslt.c common.c math.c sets.c functions.c strings.c date.c saxon.c dynamic.c\"\n$!\n$!- pass 3 - program XSLTPROC\n$!\n$ libname_3 = \"\"\n$ h_file_3 = \"\"\n$ progname_3 = \"XSLTPROC\"\n$!\n$ ! see \"xsltproc_SOURCES\" in [.xsltproc]makefile.in\n$ src_3 = \"xsltproc.c\"\n$!\n$!- set up and check logicals -----------------------------------------------\n$!\n$! XML_LIBDIR - object library directory\n$! XML_SRCDIR - top-level build directory of libxml package -- needed for config.h and trio.h\n$! LIBXML - source directory containing .h files for libxml package\n$!\n$ if f$trnlnm(\"XML_LIBDIR\").eqs.\"\"\n$ then\n$ on error then continue\n$ globfile = f$search(\"[--...]libxml.olb\")\n$ if globfile.eqs.\"\"\n$ then\n$ write sys$output \"\"\n$ write sys$output \"\tYou need to define the XML_LIBDIR logical name to\"\n$ write sys$output \"\tpoint to the directory containing your object\"\n$ write sys$output \"\tlibraries. This should already contain LIBXML.OLB\"\n$ write sys$output \"\tfrom the libxml package, and will be the directory\"\n$ write sys$output \"\tthe new LIBXSLT.OLB library will be placed in\"\n$ write sys$output \"\"\n$ exit\n$ else\n$\tsrcdir = f$parse(globfile,,,\"DEVICE\") + f$parse(globfile,,,\"DIRECTORY\")\n$\tdefine/process XML_LIBDIR \"''srcdir'\"\n$ write sys$output \"Defining XML_LIBDIR as \"\"''srcdir'\"\"\"\n$ endif\n$ endif\n$!\n$ if f$trnlnm(\"libxml\").eqs.\"\"\n$ then\n$ ! look for globals.h in a directory installed paralle to this one\n$ on error then continue\n$ globfile = f$search(\"[--...]globals.h\")\n$ if globfile.eqs.\"\"\n$ then\n$ write sys$output \"\"\n$ write sys$output \"\tYou need to define a LIBXML logical directory to\"\n$ write sys$output \"\tpoint to the directory containing the .h files\"\n$ write sys$output \"\tfor the libxml package\"\n$ write sys$output \"\"\n$ exit\n$ else\n$\tsrcdir = f$element(0,\"]\",globfile)+ \"]\"\n$\tdefine/process LIBXML \"''srcdir'\"\n$ write sys$output \"Defining LIBXML as \"\"''srcdir'\"\"\"\n$ endif\n$ endif\n$!\n$ if f$trnlnm(\"XML_SRCDIR\").eqs.\"\"\n$ then\n$ globfile = f$search(\"[--...]globals.c\")\n$ if globfile.eqs.\"\"\n$ then\n$\twrite sys$output \"Can't locate globals.c. You need to manually define a XML_SRCDIR logical\"\n$\texit\n$ else\n$\tsrcdir = f$parse(globfile,,,\"DEVICE\") + f$parse(globfile,,,\"DIRECTORY\")\n$\tdefine/process XML_SRCDIR \"''srcdir'\"\n$ write sys$output \"Defining XML_SRCDIR as \"\"''srcdir'\"\"\"\n$ endif\n$ endif\n$!\n$!- set up some working logicals -------------------\n$!\n$ pass_no = 1\n$ set_pass_logical:\n$!\n$ if pass_no.le.num_passes\n$ then\n$!\n$ Libname = libname_'pass_no'\n$ progname = progname_'pass_no'\n$ if libname.nes.\"\"\n$ then\n$ logname = \"''libname'_SRCDIR\"\n$ else\n$ logname = \"''progname'_SRCDIR\"\n$ endif\n$ findfile = f$element(0,\" \",src_'pass_no')\n$!\n$!--- set up a source directory logical\n$!\n$ if f$trnlnm(\"''logname'\").eqs.\"\"\n$ then\n$ ! look for the target file in a parallel subdirectory\n$ globfile = f$search(\"[-...]''findfile'\")\n$ if globfile.eqs.\"\"\n$ then\n$ \t write sys$output \"Can't locate ''findfile'. You need to manually define a ''logname' logical\"\n$\t exit\n$ else\n$ \t srcdir = f$element(0,\"]\",globfile)+ \"]\"\n$\t define/process 'logname' \"''srcdir'\"\n$ write sys$output \"Defining ''logname' as \"\"''srcdir'\"\"\"\n$ endif\n$ endif\n$!\n$!--- if it's a library, set up a logical pointing to the .h files\n$!\n$ if libname.nes.\"\" \n$ then\n$\tif f$trnlnm(\"''libname'\").eqs.\"\" \n$ then \n$ ! look for the target .h file in a parallel subdirectory\n$ \t h_file = h_file_'pass_no'\n$ globfile = f$search(\"[-...]''h_file'\")\n$ if globfile.eqs.\"\"\n$ then\n$\t write sys$output \"Can't locate ''h_file'. You need to manually define a ''libname' logical\"\n$\t exit\n$ else\n$\t includedir = f$element(0,\"]\",globfile)+ \"]\"\n$\t define/process 'libname' \"''includedir'\"\n$ write sys$output \"Defining ''libname' as \"\"''includedir'\"\"\"\n$\t endif\n$ endif\n$ endif\n$!\n$ pass_no = pass_no +1\n$ goto set_pass_logical\n$!\n$ endif\t! for each pass\n$!\n$!- set up error handling (such as it is) -------------------------------------\n$!\n$ exit_status = 1\n$ saved_default = f$environment(\"default\")\n$ on error then goto ERROR_OUT \n$ on control_y then goto ERROR_OUT \n$!\n$ goto start_here\n$ start_here:\t ! move this line to debug/rerun parts of this command file\n$!\n$!- compile modules into the library ------------------------------------------\n$!\n$!\n$ pass_no = 1\t! make three passes, one for each library, one for XSLTPROC\n$ pass_loop:\n$!\n$ if pass_no.le.num_passes\n$ then\n$ Libname = libname_'pass_no'\n$ progname = progname_'pass_no'\n$ if libname.nes.\"\"\n$ then\n$ logname = \"''libname'_SRCDIR\"\n$ pass_description = \"the XML_LIBDIR:''libname'.OLB object library\"\n$ else\n$ logname = \"''progname'_SRCDIR\"\n$ pass_description = \"the programs in ''progname'\"\n$ endif\n$ src = src_'pass_no'\n$!\n$!- create the library if need\n$!\n$ if libname.nes.\"\" \n$ then\n$ if f$search(\"XML_LIBDIR:''libname'.OLB\").eqs.\"\" \n$ then\n$ write sys$output \"Creating new object library XML_LIBDIR:''libname'.OLB...\"\n$ library/create XML_LIBDIR:'libname'.OLB\n$ endif\n$ endif\n$!\n$!- move to the source directory \n$!\n$ set def 'logname'\n$!\n$!- define the library and link commands (link command not used as is)\n$!\n$ if libname.nes.\"\"\n$ then\n$ lib_command = \"LIBRARY/REPLACE XML_LIBDIR:''libname'.OLB\"\n$ link_command = \"\"\n$ else\n$ lib_command = \"\"\n$ link_command = \"LINK\"\n$ endif\n$!\n$ write sys$output \"\"\n$ write sys$output \"Building ''pass_description'\n$ write sys$output \"\"\n$!\n$ s_no = 0\n$ src = f$edit(src,\"COMPRESS\")\n$!\n$ source_loop:\n$!\n$ next_source = f$element (S_no,\" \",src)\n$ if next_source.nes.\"\" .and. next_source.nes.\" \"\n$ then\n$ call build 'next_source'\n$ s_no = s_no + 1\n$ goto source_loop\n$ endif\n$!\n$ pass_no = pass_no + 1\n$ goto pass_loop\n$!\n$ endif\t! for each pass\n$!\n$!- Th-th-th-th-th-that's all folks! ------------------------------------------\n$!\n$EXIT_OUT:\n$!\n$ set def 'saved_default\n$ exit 'exit_status\n$!\n$\n$ERROR_OUT:\n$ exit_status = $status\n$ write sys$output \"''f$message(exit_status)'\"\n$ goto EXIT_OUT\n$!\f\n$!- the BUILD subroutine. Compile then insert into library or link as required\n$!\n$BUILD: subroutine\n$ on warning then goto EXIT_BUILD\n$ source_file = p1\n$ name = f$element(0,\".\",source_file)\n$ object_file = f$fao(\"XML_LIBDIR:!AS.OBJ\",name)\n$!\n$!- compile\n$ write sys$output \"Compiling \",p1,p2,\"...\"\n$ cc_command /object='object_file 'source_file' 'p2'\n$!\n$!- insert into library if command defined\n$!\n$ if lib_command.nes.\"\" \n$ then \n$ lib_command 'object_file'\n$ delete/nolog 'object_file';*\n$ endif\n$!\n$!- link module if command defined\n$!\n$ if link_command.nes.\"\" \n$ then\n$\ttext = f$element(0,\".\",p1)\t! lose the \".c\"\n$\twrite sys$output \"Linking \",text,\"...\"\n$\tdbgopts = \"\"\n$\tif debug then dbgopts = \"/DEBUG\"\n$\tlink_command'dbgopts' 'object_file',-\n \t\tXML_LIBDIR:libexslt/lib,-\n \t\tXML_LIBDIR:libxslt/lib,-\n \t\tXML_LIBDIR:libxml/library\n$ endif\n$!\n$EXIT_BUILD:\n$ exit $status\n$!\n$endsubroutine\n" }, { "path": "src/test/resources/samples/langs/DIGITAL Command Language/vmsbackup_build.com", "content": "$! Compiling with VAXC is said to work, but it requires the usual cruft\n$! (vaxcrtl and all), and to avoid hair we don't supply said cruft here.\n$ CC/DECC/PREFIX=all VMSBACKUP.C/DEFINE=(HAVE_MT_IOCTLS=0,HAVE_UNIXIO_H=1)\n$ CC/DECC/PREFIX=all DCLMAIN.C\n$! Probably we don't want match as it probably doesn't implement VMS-style\n$! matching, but I haven't looking into the issues yet.\n$ CC/DECC/PREFIX=all match\n$ LINK/exe=VMSBACKUP.EXE -\nvmsbackup.obj,dclmain.obj,match.obj,sys$input/opt\nidentification=\"VMSBACKUP4.1.1\"\n" }, { "path": "src/test/resources/samples/langs/DM/example.dm", "content": "// This is a single line comment.\n/*\n\tThis is a multi-line comment\n*/\n\n// Pre-processor keywords\n\n#define PI 3.1415\n\n#if PI == 4\n\n#define G 5\n\n#elif PI == 3\n\n#define I 6\n\n#else\n\n#define K 7\n\n#endif\n\n\nvar/GlobalCounter = 0\nvar/const/CONST_VARIABLE = 2\nvar/list/MyList = list(\"anything\", 1, new /datum/entity)\nvar/list/EmptyList[99] // creates a list of 99 null entries\nvar/list/NullList = null\n\n/*\n\tEntity Class\n*/\n\n/datum/entity\n\tvar/name = \"Entity\"\n\tvar/number = 0\n\n/datum/entity/proc/myFunction()\n\tworld.log << \"Entity has called myFunction\"\n\n/datum/entity/New()\n\tnumber = GlobalCounter++\n\n/*\n\tUnit Class, Extends from Entity\n*/\n\n/datum/entity/unit\n\tname = \"Unit\"\n\n/datum/entity/unit/New()\n\t..() // calls the parent's proc; equal to super() and base() in other languages\n\tnumber = rand(1, 99)\n\n/datum/entity/unit/myFunction()\n\tworld.log << \"Unit has overriden and called myFunction\"\n\n// Global Function\n/proc/ReverseList(var/list/input)\n\tvar/list/output = list()\n\tfor(var/i = input.len; i >= 1; i--) // IMPORTANT: List Arrays count from 1.\n\t\toutput += input[i] // \"+= x\" is \".Add(x)\"\n\treturn output\n\n// Bitflags\n/proc/DoStuff()\n\tvar/bitflag = 0\n\tbitflag |= 8\n\treturn bitflag\n\n/proc/DoOtherStuff()\n\tvar/bitflag = 65535 // 16 bits is the maximum amount\n\tbitflag &= ~8\n\treturn bitflag\n\n// Logic\n/proc/DoNothing()\n\tvar/pi = PI\n\tif(pi == 4)\n\t\tworld.log << \"PI is 4\"\n\telse if(pi == CONST_VARIABLE)\n\t\tworld.log << \"PI is [CONST_VARIABLE]!\"\n\telse\n\t\tworld.log << \"PI is approximety [pi]\"\n\n#undef PI // Undefine PI" }, { "path": "src/test/resources/samples/langs/DNS Zone/sample.arpa", "content": "$ORIGIN 0.0.0.c.2.1.0.3.0.0.2.1.e.f.f.3.ip6.arpa.\n$TTL 60\n@ \t IN SOA ns root (\n\t 2002042901 ; SERIAL\n\t 7200 ; REFRESH\n\t 600 ; RETRY\n\t 36000000 ; EXPIRE\n\t 120 ; MINIMUM\n\t )\n\n\t NS\t ns.example.com.\n\nc.a.7.e.d.7.e.f.f.f.0.2.8.0.a.0 PTR sip01.example.com.\n" }, { "path": "src/test/resources/samples/langs/DNS Zone/sneaky.net.zone", "content": "$TTL 3d\n@ IN SOA root.localhost. root.sneaky.net. (\n 2015042907 ; serial\n 3d ; refresh\n 1h ; retry\n 12d ; expire\n 2h ; negative response TTL\n )\n IN NS root.localhost.\n IN NS localhost. ; secondary name server is preferably externally maintained\n\nwww IN A 3.141.59.26\n" }, { "path": "src/test/resources/samples/langs/DOS Batch/BatchInstall.bat", "content": "@ECHO OFF\r\nREM.-- Prepare the Command Processor\r\nSETLOCAL ENABLEEXTENSIONS\r\nSETLOCAL ENABLEDELAYEDEXPANSION\r\n\r\nREM.-- Version History --\r\nREM XX.XXX YYYYMMDD Author Description\r\nSET version=01.000-beta &rem 20051201 p.h. initial version, providing the framework\r\nREM !! For a new version entry, copy the last entry down and modify Date, Author and Description\r\nSET version=%version: =%\r\n\r\nREM.-- Set the window title\r\nSET title=%~n0\r\nTITLE %title%\r\n\r\nREM.--initialize the variables\r\nset FilePersist=%~dpn0+.cmd& rem --define the filename where persistent variables get stored\r\nset SvrCli_choice=,Server,Client,\r\ncall:setPersist SvrCli=Server\r\nset bShowReadMe_choice=,Yes,No,\r\ncall:setPersist bShowReadMe=No\r\nset InstSize_choice=,Full,Regular,Mini,\r\ncall:setPersist InstSize=Full\r\n\r\nrem.--read the persistent variables from the storage\r\ncall:restorePersistentVars \"%FilePersist%\"\r\n\r\n\r\n\r\n:menuLOOP\r\necho.\r\necho.= Menu =================================================\r\necho.\r\nfor /f \"tokens=1,2,* delims=_ \" %%A in ('\"findstr /b /c:\":menu_\" \"%~f0\"\"') do echo. %%B %%C\r\nset choice=\r\necho.&set /p choice=Make a choice or hit ENTER to quit: ||(\r\n call:savePersistentVars \"%FilePersist%\"& rem --save the persistent variables to the storage\r\n GOTO:EOF\r\n)\r\necho.&call:menu_%choice%\r\nGOTO:menuLOOP\r\n\r\n::-----------------------------------------------------------\r\n:: menu functions follow below here\r\n::-----------------------------------------------------------\r\n\r\n:menu_Options:\r\n\r\n:menu_1 Install version : '!SvrCli!' [!SvrCli_choice:~1,-1!]\r\ncall:getNextInList SvrCli \"!SvrCli_choice!\"\r\ncls\r\nGOTO:EOF\r\n\r\n:menu_2 Size of installation : '!InstSize!' [!InstSize_choice:~1,-1!]\r\ncall:getNextInList InstSize \"!InstSize_choice!\"\r\ncls\r\nGOTO:EOF\r\n\r\n:menu_3 Show Readme.txt when finished: '!bShowReadMe!' [!bShowReadMe_choice:~1,-1!]\r\ncall:getNextInList bShowReadMe \"!bShowReadMe_choice!\"\r\ncls\r\nGOTO:EOF\r\n\r\n:menu_\r\n:menu_Execute:\r\n\r\n:menu_I Start Installation (simulation only)\r\n\r\nset maxcnt=20\r\nif /i \"%InstSize:~0,1%\"==\"F\" set maxcnt=11\r\nif /i \"%InstSize:~0,1%\"==\"R\" set maxcnt=7\r\nif /i \"%InstSize:~0,1%\"==\"M\" set maxcnt=3\r\n\r\necho.Simulating an installation for !maxcnt! files...\r\ncall:initProgress maxcnt\r\nfor /l %%C in (1,1,!maxcnt!) do (\r\n echo.Pretend to install !SvrCli! file %%C.\r\n call:sleep 1\r\n call:doProgress\r\n)\r\ncall:sleep 1\r\nTITLE %title%\r\nif /i \"%bShowReadMe:~0,1%\"==\"Y\" notepad ReadMe.txt\r\nGOTO:EOF\r\n\r\n:menu_C Clear Screen\r\ncls\r\nGOTO:EOF\r\n\r\n\r\n::-----------------------------------------------------------\r\n:: helper functions follow below here\r\n::-----------------------------------------------------------\r\n\r\n\r\n:setPersist -- to be called to initialize persistent variables\r\n:: -- %*: set command arguments\r\nset %*\r\nGOTO:EOF\r\n\r\n\r\n:getPersistentVars -- returns a comma separated list of persistent variables\r\n:: -- %~1: reference to return variable\r\nSETLOCAL\r\nset retlist=\r\nset parse=findstr /i /c:\"call:setPersist\" \"%~f0%\"^|find /v \"ButNotThisLine\"\r\nfor /f \"tokens=2 delims== \" %%a in ('\"%parse%\"') do (set retlist=!retlist!%%a,)\r\n( ENDLOCAL & REM RETURN VALUES\r\n IF \"%~1\" NEQ \"\" SET %~1=%retlist%\r\n)\r\nGOTO:EOF\r\n\r\n\r\n:savePersistentVars -- Save values of persistent variables into a file\r\n:: -- %~1: file name\r\nSETLOCAL\r\necho.>\"%~1\"\r\ncall :getPersistentVars persvars\r\nfor %%a in (%persvars%) do (echo.SET %%a=!%%a!>>\"%~1\")\r\nGOTO:EOF\r\n\r\n\r\n:restorePersistentVars -- Restore the values of the persistent variables\r\n:: -- %~1: batch file name to restore from\r\nif exist \"%FilePersist%\" call \"%FilePersist%\"\r\nGOTO:EOF\r\n\r\n\r\n:getNextInList -- return next value in list\r\n:: -- %~1 - in/out ref to current value, returns new value\r\n:: -- %~2 - in choice list, must start with delimiter which must not be '@'\r\nSETLOCAL\r\nset lst=%~2& rem.-- get the choice list\r\nif \"%lst:~0,1%\" NEQ \"%lst:~-1%\" echo.ERROR Choice list must start and end with the delimiter&GOTO:EOF\r\nset dlm=%lst:~-1%& rem.-- extract the delimiter used\r\nset old=!%~1!& rem.-- get the current value\r\nset fst=&for /f \"delims=%dlm%\" %%a in (\"%lst%\") do set fst=%%a&rem.--get the first entry\r\n rem.-- replace the current value with a @, append the first value\r\nset lll=!lst:%dlm%%old%%dlm%=%dlm%@%dlm%!%fst%%dlm%\r\n rem.-- get the string after the @\r\nfor /f \"tokens=2 delims=@\" %%a in (\"%lll%\") do set lll=%%a\r\n rem.-- extract the next value\r\nfor /f \"delims=%dlm%\" %%a in (\"%lll%\") do set new=%%a\r\n( ENDLOCAL & REM RETURN VALUES\r\n IF \"%~1\" NEQ \"\" (SET %~1=%new%) ELSE (echo.%new%)\r\n)\r\nGOTO:EOF\r\n\r\n\r\n:initProgress -- initialize an internal progress counter and display the progress in percent\r\n:: -- %~1: in - progress counter maximum, equal to 100 percent\r\n:: -- %~2: in - title string formatter, default is '[P] completed.'\r\nset /a ProgressCnt=-1\r\nset /a ProgressMax=%~1\r\nset ProgressFormat=%~2\r\nif \"%ProgressFormat%\"==\"\" set ProgressFormat=[PPPP]\r\nset ProgressFormat=!ProgressFormat:[PPPP]=[P] completed.!\r\ncall :doProgress\r\nGOTO:EOF\r\n\r\n\r\n:doProgress -- display the next progress tick\r\nset /a ProgressCnt+=1\r\nSETLOCAL\r\nset /a per=100*ProgressCnt/ProgressMax\r\nset per=!per!%%\r\ntitle %ProgressFormat:[P]=!per!%\r\nGOTO:EOF\r\n\r\n\r\n\r\n\r\nFOR /l %%a in (%~1,-1,1) do (ping -n 2 -w 1 127.0.0.1>NUL)\r\ngoto :eof\r\n" }, { "path": "src/test/resources/samples/langs/DTrace/counts.d", "content": "/*\n * This software is in the public domain.\n *\n * $Id: counts.d 10510 2005-08-15 01:46:19Z kateturner $\n */\n\n#pragma D option quiet\n\nself int tottime;\nBEGIN {\n\ttottime = timestamp;\n}\n\nphp$target:::function-entry\n\t@counts[copyinstr(arg0)] = count();\n}\n\nEND {\n\tprintf(\"Total time: %dus\\n\", (timestamp - tottime) / 1000);\n\tprintf(\"# calls by function:\\n\");\n\tprinta(\"%-40s %@d\\n\", @counts);\n}\n\n" }, { "path": "src/test/resources/samples/langs/DTrace/probes.d", "content": "/* ----------\n *\tDTrace probes for PostgreSQL backend\n *\n *\tCopyright (c) 2006-2009, PostgreSQL Global Development Group\n *\n *\t$PostgreSQL: pgsql/src/backend/utils/probes.d,v 1.11 2009/04/02 20:59:10 momjian Exp $\n * ----------\n */\n\n\n/*\n * Typedefs used in PostgreSQL.\n *\n * NOTE: Do not use system-provided typedefs (e.g. uintptr_t, uint32_t, etc)\n * in probe definitions, as they cause compilation errors on Mac OS X 10.5.\n */\n#define LocalTransactionId unsigned int\n#define LWLockId int\n#define LWLockMode int\n#define LOCKMODE int\n#define BlockNumber unsigned int\n#define Oid unsigned int\n#define ForkNumber int\n#define bool char\n\nprovider postgresql {\n\n\tprobe transaction__start(LocalTransactionId);\n\tprobe transaction__commit(LocalTransactionId);\n\tprobe transaction__abort(LocalTransactionId);\n\n\tprobe lwlock__acquire(LWLockId, LWLockMode);\n\tprobe lwlock__release(LWLockId);\n\tprobe lwlock__wait__start(LWLockId, LWLockMode);\n\tprobe lwlock__wait__done(LWLockId, LWLockMode);\n\tprobe lwlock__condacquire(LWLockId, LWLockMode);\n\tprobe lwlock__condacquire__fail(LWLockId, LWLockMode);\n\n\tprobe lock__wait__start(unsigned int, unsigned int, unsigned int, unsigned int, unsigned int, LOCKMODE);\n\tprobe lock__wait__done(unsigned int, unsigned int, unsigned int, unsigned int, unsigned int, LOCKMODE);\n\n\tprobe query__parse__start(const char *);\n\tprobe query__parse__done(const char *);\n\tprobe query__rewrite__start(const char *);\n\tprobe query__rewrite__done(const char *);\n\tprobe query__plan__start();\n\tprobe query__plan__done();\n\tprobe query__execute__start();\n\tprobe query__execute__done();\n\tprobe query__start(const char *);\n\tprobe query__done(const char *);\n\tprobe statement__status(const char *);\n\n\tprobe sort__start(int, bool, int, int, bool);\n\tprobe sort__done(bool, long);\n\n\tprobe buffer__read__start(ForkNumber, BlockNumber, Oid, Oid, Oid, bool, bool);\n\tprobe buffer__read__done(ForkNumber, BlockNumber, Oid, Oid, Oid, bool, bool, bool);\n\tprobe buffer__flush__start(ForkNumber, BlockNumber, Oid, Oid, Oid);\n\tprobe buffer__flush__done(ForkNumber, BlockNumber, Oid, Oid, Oid);\n\n\tprobe buffer__checkpoint__start(int);\n\tprobe buffer__checkpoint__sync__start();\n\tprobe buffer__checkpoint__done();\n\tprobe buffer__sync__start(int, int);\n\tprobe buffer__sync__written(int);\n\tprobe buffer__sync__done(int, int, int);\n\tprobe buffer__write__dirty__start(ForkNumber, BlockNumber, Oid, Oid, Oid);\n\tprobe buffer__write__dirty__done(ForkNumber, BlockNumber, Oid, Oid, Oid);\n\n\tprobe deadlock__found();\n\n\tprobe checkpoint__start(int);\n\tprobe checkpoint__done(int, int, int, int, int);\n\tprobe clog__checkpoint__start(bool);\n\tprobe clog__checkpoint__done(bool);\n\tprobe subtrans__checkpoint__start(bool);\n\tprobe subtrans__checkpoint__done(bool);\n\tprobe multixact__checkpoint__start(bool);\n\tprobe multixact__checkpoint__done(bool);\n\tprobe twophase__checkpoint__start();\n\tprobe twophase__checkpoint__done();\n\n\tprobe smgr__md__read__start(ForkNumber, BlockNumber, Oid, Oid, Oid);\n\tprobe smgr__md__read__done(ForkNumber, BlockNumber, Oid, Oid, Oid, int, int);\n\tprobe smgr__md__write__start(ForkNumber, BlockNumber, Oid, Oid, Oid);\n\tprobe smgr__md__write__done(ForkNumber, BlockNumber, Oid, Oid, Oid, int, int);\n\n\tprobe xlog__insert(unsigned char, unsigned char);\n\tprobe xlog__switch();\n\tprobe wal__buffer__write__dirty__start();\n\tprobe wal__buffer__write__dirty__done();\n};\n" }, { "path": "src/test/resources/samples/langs/DTrace/trace_futexes.d", "content": "#!/usr/sbin/dtrace -qs\n\n// Source: https://github.com/bycn82/freebsd/blob/12a4a4a008eac3cfa71e496b33eaeaf426c374c1/sys/compat/linux/trace_futexes.d\n\n/*-\n * Copyright (c) 2011-2012 Alexander Leidinger \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\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 * in this position and unchanged.\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 *\n * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.\n * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT\n * NOT 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 OF\n * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * $FreeBSD$\n */\n\n/**\n * Trace futex operations:\n * - internal locks\n * - size of the futex list\n * - report error conditions (emulation errors, kernel errors,\n * programming errors)\n * - execution time (wallclock) of futex related functions\n */\n\n#pragma D option specsize=32m\n\n/* Error conditions */\nlinuxulator*:futex:futex_get:error,\nlinuxulator*:futex:futex_sleep:requeue_error,\nlinuxulator*:futex:futex_sleep:sleep_error,\nlinuxulator*:futex:futex_wait:copyin_error,\nlinuxulator*:futex:futex_wait:itimerfix_error,\nlinuxulator*:futex:futex_wait:sleep_error,\nlinuxulator*:futex:futex_atomic_op:missing_access_check,\nlinuxulator*:futex:futex_atomic_op:unimplemented_op,\nlinuxulator*:futex:futex_atomic_op:unimplemented_cmp,\nlinuxulator*:futex:linux_sys_futex:unimplemented_clockswitch,\nlinuxulator*:futex:linux_sys_futex:copyin_error,\nlinuxulator*:futex:linux_sys_futex:unhandled_efault,\nlinuxulator*:futex:linux_sys_futex:unimplemented_lock_pi,\nlinuxulator*:futex:linux_sys_futex:unimplemented_unlock_pi,\nlinuxulator*:futex:linux_sys_futex:unimplemented_trylock_pi,\nlinuxulator*:futex:linux_sys_futex:unimplemented_wait_requeue_pi,\nlinuxulator*:futex:linux_sys_futex:unimplemented_cmp_requeue_pi,\nlinuxulator*:futex:linux_sys_futex:unknown_operation,\nlinuxulator*:futex:linux_get_robust_list:copyout_error,\nlinuxulator*:futex:handle_futex_death:copyin_error,\nlinuxulator*:futex:fetch_robust_entry:copyin_error,\nlinuxulator*:futex:release_futexes:copyin_error\n{\n printf(\"ERROR: %s in %s:%s:%s\\n\", probename, probeprov, probemod,\n probefunc);\n stack();\n ustack();\n}\n\nlinuxulator*:futex:linux_sys_futex:invalid_cmp_requeue_use,\nlinuxulator*:futex:linux_sys_futex:deprecated_requeue,\nlinuxulator*:futex:linux_set_robust_list:size_error\n{\n printf(\"WARNING: %s:%s:%s:%s in application %s, maybe an application error?\\n\",\n probename, probeprov, probemod, probefunc, execname);\n stack();\n ustack();\n}\n\n\n/* Per futex checks/statistics */\n\nlinuxulator*:futex:futex:create\n{\n ++futex_count;\n @max_futexes = max(futex_count);\n}\n\nlinuxulator*:futex:futex:destroy\n/futex_count == 0/\n{\n printf(\"ERROR: Request to destroy a futex which was not created,\\n\");\n printf(\" or this script was started after some futexes where\\n\");\n printf(\" created. Stack trace:\\n\");\n stack();\n ustack();\n}\n\nlinuxulator*:futex:futex:destroy\n{\n --futex_count;\n}\n\n\n/* Internal locks */\n\nlinuxulator*:locks:futex_mtx:locked\n{\n ++check[probefunc, arg0];\n @stats[probefunc] = count();\n\n ts[probefunc] = timestamp;\n spec[probefunc] = speculation();\n printf(\"Stacktrace of last lock operation of the %s:\\n\", probefunc);\n stack();\n}\n\nlinuxulator*:locks:futex_mtx:unlock\n/check[probefunc, arg0] == 0/\n{\n printf(\"ERROR: unlock attempt of unlocked %s (%p),\", probefunc, arg0);\n printf(\" missing SDT probe in kernel, or dtrace program started\");\n printf(\" while the %s was already held (race condition).\", probefunc);\n printf(\" Stack trace follows:\");\n stack();\n}\n\nlinuxulator*:locks:futex_mtx:unlock\n{\n discard(spec[probefunc]);\n spec[probefunc] = 0;\n --check[probefunc, arg0];\n}\n\n/* Timeout handling for internal locks */\n\ntick-10s\n/spec[\"futex_mtx\"] != 0 && timestamp - ts[\"futex_mtx\"] >= 9999999000/\n{\n commit(spec[\"futex_mtx\"]);\n spec[\"futex_mtx\"] = 0;\n}\n\n\n/* Timing statistings */\n\nlinuxulator*:futex::entry\n{\n self->time[probefunc] = timestamp;\n @calls[probeprov, execname, probefunc] = count();\n}\n\nlinuxulator*:futex::return\n/self->time[probefunc] != 0/\n{\n this->timediff = self->time[probefunc] - timestamp;\n\n @timestats[probeprov, execname, probefunc] = quantize(this->timediff);\n @longest[probeprov, probefunc] = max(this->timediff);\n\n self->time[probefunc] = 0;\n}\n\n\n/* Statistics */\n\nEND\n{\n printf(\"Number of locks per type:\");\n printa(@stats);\n printf(\"Number of maximum number of futexes in the futex list:\");\n printa(@max_futexes);\n printf(\"Number of futexes still existing: %d\", futex_count);\n printf(\"Number of calls per provider/application/kernel function:\");\n printa(@calls);\n printf(\"Wallclock-timing statistics per provider/application/kernel function (in ns):\");\n printa(@timestats);\n printf(\"Longest running (wallclock!) functions per provider (in ns):\");\n printa(@longest);\n}" }, { "path": "src/test/resources/samples/langs/Dart/point.dart", "content": "import 'dart:math' as math;\n\nclass Point {\n num x, y;\n\n Point(this.x, this.y);\n\n num distanceTo(Point other) {\n var dx = x - other.x;\n var dy = y - other.y;\n return math.sqrt(dx * dx + dy * dy);\n }\n}\n\nvoid main() {\n var p = new Point(2, 3);\n var q = new Point(3, 4);\n print('distance from p to q = ${p.distanceTo(q)}');\n}\n" }, { "path": "src/test/resources/samples/langs/DataWeave/customInterpolator.dwl", "content": "fun SQL(literals, parts) = ''\n---\n[\n SQL `SELECT * FROM table WHERE id = $(1) AND name = $('a')`,\n SQL `$('p')`,\n SQL `$('a')$('b')`,\n SQL `$('a')---$('b')`,\n SQL `---$('a')---$('b')---`,\n SQL `$('p')bbb`,\n SQL `aaa$('p')`,\n SQL `aaa$('p')bbb`\n]" }, { "path": "src/test/resources/samples/langs/DataWeave/directives.dwl", "content": "%dw 2.0\nvar number = 1234\nfun foo(func,name=\"Mariano\") = func(name)\ninput payload application/test arg=\"value\"\noutput application/json\n---\n{\n foo: \"bar\"\n}" }, { "path": "src/test/resources/samples/langs/DataWeave/functions.dwl", "content": "%dw 2.0\nvar x=(param1, param2) -> { \"$param1\": param2 }\nvar y=(param1, param2 = \"c\") -> { \"$param1\": param2 }\nvar toUser = (user) -> { name: user.name,\tlastName: user.lastName }\nfun z(param1, param2) = { \"$param1\": param2 }\nvar a = { name: \"Mariano\" , toUser: ((param1, param2) -> { \"$param1\": param2 }) }\nvar applyFirst = (array, func) -> (func(array[0]) ++ array[1 to -1])\n\nvar nested = (array, func) -> (a) -> (b) -> (c) -> array map func(a ++ b ++ c)\n\n\nfun f2(a1, a2) = \"\"\nfun f3(a1:String, a2:Number):String = a1\nfun f4(a1:String, a2:(a:Number) -> Number):String = a1\n---\nresult: {\n a: x(\"a\", \"b\"),\n b: y(\"a\"),\n c: y(\"a\", \"b\"),\n users: { (in1 map ((user) -> { user: (toUser(user) ++ user) })) },\n d: z(\"a\", \"b\"),\n e: a.toUser(\"name\",\"Mariano\"),\n f: a.toUser(\"name\",\"Mariano\").name,\n f: applyFirst(\"mariano\", (s) -> upper(s) ),\n g: [] map (s) -> upper(s),\n h: 1 f2 2\n}\n" }, { "path": "src/test/resources/samples/langs/DataWeave/literals.dwl", "content": "%dw 2.0\n---\n{\n \"boolean\":{\n \"true\" : true,\n \"false\": false\n },\n \"Number\": {\n \"int\": 123,\n \"decimal\": 123.23\n },\n \"string\": {\n \"singleQuote\" : 'A String',\n \"doubleQuote\" : \"A String\"\n },\n \"regex\": /foo/,\n \"date\": {\n a: |2003-10-01|,\n b: |2005-045|,\n c: |2003-W14-3|,\n d: |23:57:59|,\n e: |23:57:30.700|,\n f: |23:50:30Z|,\n g: |+13:00|,\n h: |Z|,\n i: |-02:00|,\n j: |2005-06-02T15:10:16|,\n k: |2005-06-02T15:10:16Z|,\n l: |2005-06-02T15:10:16+03:00|,\n m: |P12Y7M11D|,\n n: |P12Y5M|,\n o: |P45DT9H20M8S|,\n p: |PT9H20M8S|\n }\n}\n\n" }, { "path": "src/test/resources/samples/langs/DataWeave/match.dwl", "content": "{\n // Regex Pattern Matching (Can be named or unnamed)\n a: in0.phones map $ match {\n case matches /\\+(\\d+)\\s\\((\\d+)\\)\\s(\\d+\\-\\d+)/ -> { country: $[0], area: $[1], number: $[2] }\n case matches /\\((\\d+)\\)\\s(\\d+\\-\\d+)/ -> { area: $[1], number: $[2] }\n case phone matches /\\((\\d+)\\)\\s(\\d+\\-\\d+)/ -> { area: phone[1], number: phone[2] }\n },\n // Type Pattern Matching (Can be named or unnamed)\n b: in0.object match {\n case is Object -> { object: $ }\n case is Number -> { number: $ }\n // This is how you name variables if needed\n case y is Boolean -> { boolean: y }\n },\n // Literal Pattern Matching (Can be named or unnamed)\n c: in0.value match {\n case \"Emiliano\" -> { string: $ }\n case 123 -> { number: $ }\n // This is how you name variables if needed\n case value: \"Mariano\" -> { name: value }\n },\n // Boolean Expression Pattern Matching (Always named)\n d: in0.value match {\n case x if x > 30 -> { biggerThan30: x }\n case x if x == 9 -> { nine: x }\n },\n // Default matches\n e: in0.value match {\n case \"Emiliano\" -> \"string\"\n case 3.14 -> number\n else -> \"1234\"\n }\n}" }, { "path": "src/test/resources/samples/langs/Diff/dude-thing-okay--001.patch", "content": "diff --git a/lib/linguist.rb b/lib/linguist.rb\nindex d472341..8ad9ffb 100644\n--- a/lib/linguist.rb\n+++ b/lib/linguist.rb\n" }, { "path": "src/test/resources/samples/langs/Dockerfile/filenames/Dockerfile", "content": "# This file describes the standard way to build Docker, using docker\ndocker-version 0.4.2\nfrom\tubuntu:12.04\nmaintainer\tSolomon Hykes \n# Build dependencies\nrun\tapt-get install -y -q curl\nrun\tapt-get install -y -q git\n# Install Go\nrun\tcurl -s https://go.googlecode.com/files/go1.1.1.linux-amd64.tar.gz | tar -v -C /usr/local -xz\nenv\tPATH\t/usr/local/go/bin:/usr/local/bin:/usr/local/sbin:/usr/bin:/usr/sbin:/bin:/sbin\nenv\tGOPATH\t/go\nenv\tCGO_ENABLED 0\nrun\tcd /tmp && echo 'package main' > t.go && go test -a -i -v\n# Download dependencies\nrun\tPKG=github.com/kr/pty REV=27435c699;\t\t git clone http://$PKG /go/src/$PKG && cd /go/src/$PKG && git checkout -f $REV\nrun\tPKG=github.com/gorilla/context/ REV=708054d61e5; git clone http://$PKG /go/src/$PKG && cd /go/src/$PKG && git checkout -f $REV\nrun\tPKG=github.com/gorilla/mux/ REV=9b36453141c;\t git clone http://$PKG /go/src/$PKG && cd /go/src/$PKG && git checkout -f $REV\n# Run dependencies\nrun\tapt-get install -y iptables\n# lxc requires updating ubuntu sources\nrun\techo 'deb http://archive.ubuntu.com/ubuntu precise main universe' > /etc/apt/sources.list\nrun\tapt-get update\nrun\tapt-get install -y lxc\nrun\tapt-get install -y aufs-tools\n# Upload docker source\nadd\t. /go/src/github.com/dotcloud/docker\n# Build the binary\nrun\tcd /go/src/github.com/dotcloud/docker/docker && go install -ldflags \"-X main.GITCOMMIT '??' -d -w\"\nenv\tPATH\t/usr/local/go/bin:/go/bin:/usr/local/bin:/usr/local/sbin:/usr/bin:/usr/sbin:/bin:/sbin\ncmd\t[\"docker\"]\n" }, { "path": "src/test/resources/samples/langs/Dogescript/example.djs", "content": "quiet\n wow \n such language\n very syntax\n github recognized wow\nloud\n\nsuch language much friendly\n rly friendly is true\n plz console.loge with 'such friend, very inclusive'\n but\n plz console.loge with 'no love for doge'\n wow\nwow\n\nmodule.exports is language" }, { "path": "src/test/resources/samples/langs/E/Extends.E", "content": "# from\n# http://wiki.erights.org/wiki/Walnut/Ordinary_Programming/Objects_and_Functions\ndef makeVehicle(self) {\n def vehicle {\n to milesTillEmpty() {\n return self.milesPerGallon() * self.getFuelRemaining()\n }\n }\n return vehicle\n}\n\ndef makeCar() {\n var fuelRemaining := 20\n def car extends makeVehicle(car) {\n to milesPerGallon() {return 19}\n to getFuelRemaining() {return fuelRemaining}\n }\n return car\n}\n\ndef makeJet() {\n var fuelRemaining := 2000\n def jet extends makeVehicle(jet) {\n to milesPerGallon() {return 2}\n to getFuelRemaining() {return fuelRemaining}\n }\n return jet\n}\n\ndef car := makeCar()\nprintln(`The car can go ${car.milesTillEmpty()} miles.`)\n" }, { "path": "src/test/resources/samples/langs/E/Functions.E", "content": "# from\n# http://wiki.erights.org/wiki/Walnut/Ordinary_Programming/Objects_and_Functions\ndef makeCar(var name) {\n var x := 0\n var y := 0\n def car {\n to moveTo(newX,newY) {\n x := newX\n y := newY\n }\n to getX() {return x}\n to getY() {return y}\n to setName(newName) {name := newName}\n to getName() {return name}\n } \n return car\n}\n# Now use the makeCar function to make a car, which we will move and print\ndef sportsCar := makeCar(\"Ferrari\")\nsportsCar.moveTo(10,20)\nprintln(`The car ${sportsCar.getName()} is at X location ${sportsCar.getX()}`)\n" }, { "path": "src/test/resources/samples/langs/E/Guards.E", "content": "# from\n# http://wiki.erights.org/wiki/Walnut/Advanced_Topics/Build_your_Own_Guards\ndef makeVOCPair(brandName :String) :near {\n\n var myTempContents := def none {}\n\n def brand {\n to __printOn(out :TextWriter) :void {\n out.print(brandName)\n }\n }\n\n def ProveAuth {\n to __printOn(out :TextWriter) :void {\n out.print(`<$brandName prover>`)\n }\n to getBrand() :near { return brand }\n to coerce(specimen, optEjector) :near {\n def sealedBox {\n to getBrand() :near { return brand }\n to offerContent() :void {\n myTempContents := specimen\n }\n }\n return sealedBox\n }\n }\n def CheckAuth {\n to __printOn(out :TextWriter) :void {\n out.print(`<$brandName checker template>`)\n }\n to getBrand() :near { return brand }\n match [`get`, authList :any[]] {\n def checker {\n to __printOn(out :TextWriter) :void {\n out.print(`<$brandName checker>`)\n }\n to getBrand() :near { return brand }\n to coerce(specimenBox, optEjector) :any {\n myTempContents := null\n if (specimenBox.__respondsTo(\"offerContent\", 0)) {\n # XXX Using __respondsTo/2 here is a kludge\n specimenBox.offerContent()\n } else {\n myTempContents := specimenBox\n }\n for auth in authList {\n if (auth == myTempContents) {\n return auth\n }\n }\n myTempContents := none\n throw.eject(optEjector,\n `Unmatched $brandName authorization`)\n }\n }\n }\n match [`__respondsTo`, [`get`, _]] {\n true\n }\n match [`__respondsTo`, [_, _]] {\n false\n }\n match [`__getAllegedType`, []] {\n null.__getAllegedType()\n }\n }\n return [ProveAuth, CheckAuth]\n}\n" }, { "path": "src/test/resources/samples/langs/E/IO.E", "content": "# E sample from\n# http://wiki.erights.org/wiki/Walnut/Ordinary_Programming/InputOutput\n#File objects for hardwired files:\ndef file1 := \ndef file2 := \n\n#Using a variable for a file name:\ndef filePath := \"c:\\\\docs\\\\myFile.txt\"\ndef file3 := [filePath]\n\n#Using a single character to specify a Windows drive\ndef file4 := \ndef file5 := \ndef file6 := \n" }, { "path": "src/test/resources/samples/langs/E/Promises.E", "content": "# E snippet from\n# http://wiki.erights.org/wiki/Walnut/Distributed_Computing/Promises\nwhen (tempVow) -> {\n #...use tempVow\n} catch prob {\n #.... report problem\n} finally {\n #....log event\n}\n" }, { "path": "src/test/resources/samples/langs/E/atomic-updates.E", "content": "#!/usr/bin/env rune\npragma.syntax(\"0.9\")\n\ndef pi := (-1.0).acos()\ndef makeEPainter := \ndef colors := \n\n# --------------------------------------------------------------\n# --- Definitions\n\n/** Execute 'task' repeatedly as long 'indicator' is unresolved. */\ndef doWhileUnresolved(indicator, task) {\n def loop() {\n if (!Ref.isResolved(indicator)) {\n task()\n loop <- ()\n }\n }\n loop <- ()\n}\n\n/** The data structure specified for the task. */\ndef makeBuckets(size) {\n def values := ([100] * size).diverge() # storage\n def buckets {\n to size() :int { return size }\n /** get current quantity in bucket 'i' */\n to get(i :int) { return values[i] }\n /** transfer 'amount' units, as much as possible, from bucket 'i' to bucket 'j'\n or vice versa if 'amount' is negative */\n to transfer(i :int, j :int, amount :int) {\n def amountLim := amount.min(values[i]).max(-(values[j]))\n values[i] -= amountLim\n values[j] += amountLim\n }\n }\n return buckets\n}\n\n/** A view of the current state of the buckets. */\ndef makeDisplayComponent(buckets) {\n def c := makeEPainter(def paintCallback {\n to paintComponent(g) {\n def pixelsW := c.getWidth()\n def pixelsH := c.getHeight()\n def bucketsW := buckets.size()\n\n g.setColor(colors.getWhite())\n g.fillRect(0, 0, pixelsW, pixelsH)\n\n g.setColor(colors.getDarkGray())\n var sum := 0\n for i in 0..!bucketsW {\n sum += def value := buckets[i]\n def x0 := (i * pixelsW / bucketsW).floor()\n def x1 := ((i + 1) * pixelsW / bucketsW).floor()\n g.fillRect(x0 + 1, pixelsH - value,\n x1 - x0 - 1, value)\n }\n\n g.setColor(colors.getBlack())\n g.\"drawString(String, int, int)\"(`Total: $sum`, 2, 20)\n }\n })\n c.setPreferredSize((500, 300))\n return c\n}\n\n# --------------------------------------------------------------\n# --- Application setup\n\ndef buckets := makeBuckets(100)\ndef done # Promise indicating when the window is closed\n\n# Create the window\ndef frame := (\"Atomic transfers\")\nframe.setContentPane(def display := makeDisplayComponent(buckets))\nframe.addWindowListener(def mainWindowListener {\n to windowClosing(event) :void {\n bind done := null\n }\n match _ {}\n})\nframe.setLocation(50, 50)\nframe.pack()\n\n# --------------------------------------------------------------\n# --- Tasks\n\n# Neatens up buckets\nvar ni := 0\ndoWhileUnresolved(done, fn {\n def i := ni\n def j := (ni + 1) %% buckets.size()\n buckets.transfer(i, j, (buckets[i] - buckets[j]) // 4)\n ni := j\n})\n\n# Messes up buckets\nvar mi := 0\ndoWhileUnresolved(done, fn {\n def i := (mi + entropy.nextInt(3)) %% buckets.size()\n def j := (i + entropy.nextInt(3)) %% buckets.size() #entropy.nextInt(buckets.size())\n buckets.transfer(i, j, (buckets[i] / pi).floor())\n mi := j\n})\n\n# Updates display at fixed 10 Hz\n# (Note: tries to catch up; on slow systems slow this down or it will starve the other tasks)\ndef clock := timer.every(100, def _(_) {\n if (Ref.isResolved(done)) {\n clock.stop()\n } else {\n display.repaint()\n }\n})\nclock.start()\n\n# --------------------------------------------------------------\n# --- All ready, go visible and wait\n\nframe.show()\ninterp.waitAtTop(done)\n" }, { "path": "src/test/resources/samples/langs/E/minChat.E", "content": "# from\n# http://wiki.erights.org/wiki/Walnut/Secure_Distributed_Computing/Auditing_minChat\npragma.syntax(\"0.9\")\nto send(message) {\n when (friend<-receive(message)) -> {\n chatUI.showMessage(\"self\", message)\n } catch prob {chatUI.showMessage(\"system\", \"connection lost\")}\n}\nto receive(message) {chatUI.showMessage(\"friend\", message)}\nto receiveFriend(friendRcvr) {\n bind friend := friendRcvr \n chatUI.showMessage(\"system\", \"friend has arrived\")\n}\nto save(file) {file.setText(makeURIFromObject(chatController))}\nto load(file) {\n bind friend := getObjectFromURI(file.getText())\n friend <- receiveFriend(chatController)\n}\n" }, { "path": "src/test/resources/samples/langs/EBNF/grammar.ebnf", "content": "(*\n Source: https://github.com/sunjay/lion\n License: MIT\n*)\n\nStatement = ( NamedFunction | AnonymousFunction | Assignment | Expr ) , \"\\n\" ;\nExpr = AnonymousFunction | Term | \"(\" , Expr , \")\" ,\n { AnonymousFunction | Term | \"(\" , Expr , \")\" } ;\n\nAssignment = Symbol , \"=\" , Expr ;\n\nAnonymousFunction = \"\\\" , FunctionRHS ;\nNamedFunction = Symbol , FunctionRHS ;\n\nFunctionRHS = FunctionParams , \"=\" , FunctionBody ;\nFunctionParams = FunctionParam , { FunctionParam } ;\nFunctionParam = Term ;\nFunctionBody = Expr ;\n\nTerm = Symbol | Number | SingleWordString ;\nSingleWordString = '\"' , Symbol , '\"' ;\n(* Symbol is a collection of valid symbol characters, not defined here *)\n(* Number is a valid numeric literal *)\n\n" }, { "path": "src/test/resources/samples/langs/EBNF/material.ebnf", "content": "(*\n Source: https://github.com/io7m/jsom0\n License: ISC\n*)\n\nname =\n \"name\" , string , \";\" ;\n\ndiffuse =\n \"diffuse\" , real , real , real , \";\" ;\n\nambient =\n \"ambient\" , real , real , real , \";\" ;\n\nspecular =\n \"specular\" , real , real , real , real , \";\" ;\n\nshininess =\n \"shininess\" , real , \";\" ;\n\nalpha =\n \"alpha\" , real , \";\" ;\n\nmapping =\n \"map_chrome\" | \"map_uv\" ;\n\ntexture =\n \"texture\" , string , real , mapping , \";\" ;\n\nmaterial =\n \"material\" , \";\" ,\n name ,\n diffuse ,\n ambient ,\n specular ,\n shininess ,\n alpha ,\n [ texture ] ,\n \"end\" , \";\" ;\n\n" }, { "path": "src/test/resources/samples/langs/EBNF/object.ebnf", "content": "(*\n Source: https://github.com/io7m/jsom0\n License: ISC\n*)\n\nvertex_p3n3_name =\n \"vertex_p3n3\" ;\n\nvertex_p3n3t2_name =\n \"vertex_p3n3t2\" ;\n\nvertex_type =\n vertex_p3n3_name | vertex_p3n3t2_name ;\n\nvertex_position =\n \"position\" , real , real , real , \";\" ;\n\nvertex_normal =\n \"normal\" , real , real , real , \";\" ;\n\nvertex_uv =\n \"uv\" , real , real , \";\" ;\n\nvertex_p3n3 =\n vertex_p3n3_name , vertex_position , vertex_normal , \"end\" , \";\" ;\n\nvertex_p3n3t2 =\n vertex_p3n3t2_name , vertex_position , vertex_normal , vertex_uv , \"end\" , \";\" ;\n\nvertex =\n vertex_p3n3 | vertex_p3n3t2 ;\n\nvertex_array =\n \"array\" , positive , vertex_type , { vertex } , \"end\" , \";\" ;\n\nvertices =\n \"vertices\" , \";\" , vertex_array , \"end\" , \";\" ;\n\ntriangle =\n \"triangle\" , natural , natural , natural , \";\" ;\n\ntriangle_array =\n \"array\" , positive, \"triangle\" , { triangle } , \"end\" , \";\" ;\n\ntriangles =\n \"triangles\" , \";\" , triangle_array , \"end\" , \";\" ;\n\nname =\n \"name\" , string , \";\" ;\n\nmaterial_name =\n \"material_name\" , string , \";\" ;\n\nobject =\n \"object\" , \";\" ,\n name ,\n material_name ,\n vertices ,\n triangles ,\n \"end\" , \";\" ;\n\n" }, { "path": "src/test/resources/samples/langs/EBNF/types.ebnf", "content": "(*\n Source: https://github.com/io7m/jsom0\n License: ISC\n*)\n\ndigit_without_zero =\n \"1\" | \"2\" | \"3\" | \"4\" | \"5\" | \"6\" | \"7\" | \"8\" | \"9\" ;\n\ndigit =\n \"0\" | digit_without_zero ;\n\npositive =\n digit_without_zero , { digit } ;\n\nnatural =\n \"0\" | positive ;\n\nreal =\n [ \"-\" ] , digit , [ \".\" , { digit } ] ;\n\n" }, { "path": "src/test/resources/samples/langs/ECL/sample.ecl", "content": "/* \n * Multi-line comment\n */\n#option ('slidingJoins', true);\n\nnamesRecord :=\n RECORD\nstring20 surname;\nstring10 forename;\ninteger2 age;\ninteger2 dadAge;\ninteger2 mumAge;\n END;\n\nnamesRecord2 :=\n record\nstring10 extra;\nnamesRecord;\n end;\n\nnamesTable := dataset('x',namesRecord,FLAT);\nnamesTable2 := dataset('y',namesRecord2,FLAT);\n\ninteger2 aveAgeL(namesRecord l) := (l.dadAge+l.mumAge)/2;\ninteger2 aveAgeR(namesRecord2 r) := (r.dadAge+r.mumAge)/2;\n\n// Standard join on a function of left and right\noutput(join(namesTable, namesTable2, aveAgeL(left) = aveAgeR(right)));\n\n//Several simple examples of sliding join syntax\noutput(join(namesTable, namesTable2, left.age >= right.age - 10 and left.age <= right.age +10));\noutput(join(namesTable, namesTable2, left.age between right.age - 10 and right.age +10));\noutput(join(namesTable, namesTable2, left.age between right.age + 10 and right.age +30));\noutput(join(namesTable, namesTable2, left.age between (right.age + 20) - 10 and (right.age +20) + 10));\noutput(join(namesTable, namesTable2, aveAgeL(left) between aveAgeR(right)+10 and aveAgeR(right)+40));\n\n//Same, but on strings. Also includes age to ensure sort is done by non-sliding before sliding.\noutput(join(namesTable, namesTable2, left.surname between right.surname[1..10]+'AAAAAAAAAA' and right.surname[1..10]+'ZZZZZZZZZZ' and left.age=right.age));\noutput(join(namesTable, namesTable2, left.surname between right.surname[1..10]+'AAAAAAAAAA' and right.surname[1..10]+'ZZZZZZZZZZ' and left.age=right.age,all));\n\n//This should not generate a self join\noutput(join(namesTable, namesTable, left.age between right.age - 10 and right.age +10));\n" }, { "path": "src/test/resources/samples/langs/ECLiPSe/or-constraint.ecl", "content": ":- lib(ic).\r\n\r\n/**\r\n * Question 1.11\r\n * vabs(?Val, ?AbsVal)\r\n */\r\nvabs(Val, AbsVal):-\r\n\tAbsVal #> 0,\r\n\t(\r\n\t\tVal #= AbsVal\r\n\t;\r\n\t\tVal #= -AbsVal\r\n\t),\r\n\tlabeling([Val, AbsVal]).\r\n\r\n/**\r\n * vabsIC(?Val, ?AbsVal)\r\n */\r\nvabsIC(Val, AbsVal):-\r\n\tAbsVal #> 0,\r\n\tVal #= AbsVal or Val #= -AbsVal,\r\n\tlabeling([Val, AbsVal]).\r\n\r\n/**\r\n * Question 1.12\r\n */\r\n% X #:: -10..10, vabs(X, Y).\r\n% X #:: -10..10, vabsIC(X, Y).\r\n\r\n/**\r\n * Question 1.13\r\n * faitListe(?ListVar, ?Taille, +Min, +Max)\r\n */\r\nfaitListe([], 0, _, _):-!.\r\nfaitListe([First|Rest], Taille, Min, Max):-\r\n\tFirst #:: Min..Max,\r\n\tTaille1 #= Taille - 1,\r\n\tfaitListe(Rest, Taille1, Min, Max).\r\n\r\n/**\r\n * Question 1.14\r\n * suite(?ListVar)\r\n */\r\nsuite([Xi, Xi1, Xi2]):-\r\n\tcheckRelation(Xi, Xi1, Xi2).\r\nsuite([Xi, Xi1, Xi2|Rest]):-\r\n\tcheckRelation(Xi, Xi1, Xi2),\r\n\tsuite([Xi1, Xi2|Rest]).\r\n\r\n/**\r\n * checkRelation(?Xi, ?Xi1, ?Xi2)\r\n */\r\ncheckRelation(Xi, Xi1, Xi2):-\r\n\tvabs(Xi1, VabsXi1),\r\n\tXi2 #= VabsXi1 - Xi.\r\n\r\n/**\r\n * Question 1.15\r\n * checkPeriode(+ListVar).\r\n */\r\n% TODO Any better solution?\r\ncheckPeriode(ListVar):-\r\n\tlength(ListVar, Length),\r\n\tLength < 10.\r\ncheckPeriode([X1, X2, X3, X4, X5, X6, X7, X8, X9, X10|Rest]):-\r\n\tX1 =:= X10,\r\n\tcheckPeriode([X2, X3, X4, X5, X6, X7, X8, X9, X10|Rest]).\r\n% faitListe(ListVar, 18, -9, 9), suite(ListVar), checkPeriode(ListVar). => 99 solutions\r\n\r\n\r\n/**\r\n * Tests\r\n */\r\n/*\r\nvabs(5, 5). => Yes\r\nvabs(5, -5). => No\r\nvabs(-5, 5). => Yes\r\nvabs(X, 5).\r\nvabs(X, AbsX). \r\nvabsIC(5, 5). => Yes\r\nvabsIC(5, -5). => No\r\nvabsIC(-5, 5). => Yes\r\nvabsIC(X, 5).\r\nvabsIC(X, AbsX).\r\n\r\nfaitListe(ListVar, 5, 1, 3). => 243 solutions\r\nfaitListe([_, _, _, _, _], Taille, 1, 3). => Taille = 5 !!!!!!!!!!!!!!!!\r\n\r\nfaitListe(ListVar, 18, -9, 9), suite(ListVar). => 99 solutions\r\n*/" }, { "path": "src/test/resources/samples/langs/EJS/dash.ejs", "content": "<% include parts/depend %>\n\n
\n <% if (user.primaryAccount == \"teacher\") { %>\n <% include teacher/sidebar %>\n <% include teacher/dashboard %>\n <% } else if (user.primaryAccount == \"student\") { %>\n <% include student/sidebar %>\n <% include student/dashboard %>\n <% } else { %>\n

There seems to be a problem

\n <% } %>\n
\n" }, { "path": "src/test/resources/samples/langs/EJS/page.ejs", "content": "<% include ../parts/depend %>\n\n
\n <% include sidebar %>\n
\n
\n

Pieces

\n <% if (pieces.length == 1) { %>\n

You have\n 1\n piece to practice

\n <% } else { %>\n

You have\n <%= pieces.length %>\n pieces to practice

\n <% } %>\n
\n
\n <% if (pieces == undefined || pieces.length == 0) { %>\n
\n

No Pieces

\n

You have no\n Pieces\n assigned.

\n
\n <% } else { %>\n
\n
\n \n \n
\n
\n\n
\n <% if (inProgressPieces == undefined || inProgressPieces.length == 0) { %>\n
\n

No Pieces in Progress

\n
\n <% } else { %>\n <% for (var i = 0; i < inProgressPieces.length; i++) { %>\n
\n
\n
\n

\n \"><%= inProgressPieces[i].title %>\n

\n

By\n <%= inProgressPieces[i].author %>\n

\n

\n Teacher:\n <%= inProgressPieces[i].teacherName %>\n

\n

Average Practice Time:\n <%= inProgressPieces[i].averagePracticeTime %>\n mins\n

\n \" class=\"btn btn-success btn-block\">Practice\n <%= inProgressPieces[i].title %>\n
\n
\n
\n <% } %>\n <% } %>\n
\n\n
\n <% if (completedPieces == undefined || completedPieces.length == 0) { %>\n
\n

No Completed Pieces

\n
\n <% } else { %>\n <% for (var i = 0; i < completedPieces.length; i++) { %>\n
\n
\n
\n

\n \"><%= completedPieces[i].title %>\n

\n

By\n <%= completedPieces[i].author %>\n

\n

\n Teacher:\n <%= completedPieces[i].teacherName %>\n

\n

Average Practice Time:\n <%= completedPieces[i].averagePracticeTime %>\n mins\n

\n \" class=\"btn btn-success btn-block\">Practice\n <%= completedPieces[i].title %>\n
\n
\n
\n <% } %>\n <% } %>\n
\n <% } %>\n
\n
\n
\n" }, { "path": "src/test/resources/samples/langs/EQ/HTTPServerVirtualHostListener.eq", "content": "\n/*\n * This file is part of Jkop\n * Copyright (c) 2016 Job and Esther Technologies, Inc.\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 deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * 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 all\n * 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 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\nIFNDEF(\"target_posix\")\n{\n\tpublic class HTTPServerVirtualHostListener : EventLoopReadListener\n\t{\n\t\tpublic static HTTPServerVirtualHostListener create(String name, HTTPServer server, String prefix = null) {\n\t\t\tLogger logger;\n\t\t\tif(server != null) {\n\t\t\t\tlogger = server.get_logger();\n\t\t\t}\n\t\t\tLog.error(\"Virtual hosts are not supported on this platform.\", logger);\n\t\t\treturn(null);\n\t\t}\n\n\t\tpublic void on_read_ready() {\n\t\t}\n\n\t\tpublic void close() {\n\t\t}\n\t}\n}\n\nELSE {\n\npublic class HTTPServerVirtualHostListener : LoggerObject, EventLoopReadListener\n{\n\tclass Client : LoggerObject, EventLoopReadListener\n\t{\n\t\tHTTPServer server;\n\t\tLocalSocket socket;\n\t\tEventLoopEntry ee;\n\n\t\tembed \"c\" {{{\n\t\t\t#include \n\t\t\t#include \n\t\t\t#include \n\t\t}}}\n\n\t\tpublic static Client create(HTTPServer server, LocalSocket socket) {\n\t\t\tif(server == null || socket == null) {\n\t\t\t\treturn(null);\n\t\t\t}\n\t\t\tvar eventloop = server.get_eventloop();\n\t\t\tif(eventloop == null) {\n\t\t\t\treturn(null);\n\t\t\t}\n\t\t\tvar v = new Client();\n\t\t\tv.set_logger(server.get_logger());\n\t\t\tv.server = server;\n\t\t\tv.socket = socket;\n\t\t\tv.ee = eventloop.entry_for_object(socket);\n\t\t\tif(v.ee == null) {\n\t\t\t\treturn(null);\n\t\t\t}\n\t\t\tv.ee.set_read_listener(v);\n\t\t\treturn(v);\n\t\t}\n\n\t\tpublic void close() {\n\t\t\tif(ee != null) {\n\t\t\t\tee.remove();\n\t\t\t\tee = null;\n\t\t\t}\n\t\t\tif(socket != null) {\n\t\t\t\tsocket.close();\n\t\t\t\tsocket = null;\n\t\t\t}\n\t\t\tserver = null;\n\t\t}\n\n\t\tpublic void on_read_ready() {\n\t\t\treceive_fd();\n\t\t\tclose();\n\t\t}\n\n\t\tprivate void receive_fd() {\n\t\t\tif(socket is FileDescriptor == false) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint lsfd = ((FileDescriptor)socket).get_fd();\n\t\t\tint r;\n\t\t\tint newfd = -1;\n\t\t\tembed \"c\" {{{\n\t\t\t\tchar buf[64];\n\t\t\t\tstruct msghdr msg;\n\t\t\t\tstruct iovec iov[1];\n\t\t\t\tssize_t n;\n\t\t\t\tunion {\n\t\t\t\t\tstruct cmsghdr cm;\n\t\t\t\t\tchar control[CMSG_SPACE(sizeof(int))];\n\t\t\t\t} control_un;\n\t\t\t\tstruct cmsghdr* cmptr;\n\t\t\t\tmsg.msg_control = control_un.control;\n\t\t\t\tmsg.msg_controllen = sizeof(control_un.control);\n\t\t\t\tmsg.msg_name = NULL;\n\t\t\t\tmsg.msg_namelen = 0;\n\t\t\t\tiov[0].iov_base = buf;\n\t\t\t\tiov[0].iov_len = 64;\n\t\t\t\tmsg.msg_iov = iov;\n\t\t\t\tmsg.msg_iovlen = 1;\n\t\t\t\tr = recvmsg(lsfd, &msg, 0);\n\t\t\t}}}\n\t\t\tif(r < 0) {\n\t\t\t\tlog_error(\"FAILED to recvmsg() from the local socket in virtual host receiver.\");\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tembed \"c\" {{{\n\t\t\t\tif((cmptr = CMSG_FIRSTHDR(&msg)) != NULL && cmptr->cmsg_len == CMSG_LEN(sizeof(int))) {\n\t\t\t\t\tif(cmptr->cmsg_level == SOL_SOCKET && cmptr->cmsg_type == SCM_RIGHTS) {\n\t\t\t\t\t\tnewfd = *((int*)CMSG_DATA(cmptr));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}}}\n\t\t\tif(newfd < 0) {\n\t\t\t\tlog_warning(\"No file descriptor was passed through the socket in virtual host receiver.\");\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tvar newsock = TCPSocket.create();\n\t\t\tif(newsock == null) {\n\t\t\t\tembed \"c\" {{{ close(newfd); }}}\n\t\t\t\tlog_error(\"FAILED to create a new socket\");\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tvar fds = newsock as FileDescriptorSocket;\n\t\t\tif(fds == null) {\n\t\t\t\tembed \"c\" {{{ close(newfd); }}}\n\t\t\t\tlog_error(\"TCPSocket is not a FileDescriptorSocket. Cannot set file descriptor.\");\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfds.set_fd(newfd);\n\t\t\tserver.on_new_client_socket(newsock);\n\t\t}\n\t}\n\n\tHTTPServer server;\n\tLocalSocket socket;\n\tEventLoopEntry ee;\n\tString socketprefix;\n\n\tpublic static HTTPServerVirtualHostListener create(String name, HTTPServer server, String prefix = null) {\n\t\tif(server == null) {\n\t\t\treturn(null);\n\t\t}\n\t\tvar v = new HTTPServerVirtualHostListener();\n\t\tv.server = server;\n\t\tv.socketprefix = prefix;\n\t\tv.set_logger(server.get_logger());\n\t\tif(v.start(name) == false) {\n\t\t\tv = null;\n\t\t}\n\t\treturn(v);\n\t}\n\n\tpublic bool start(String name) {\n\t\tif(String.is_empty(name) || server == null) {\n\t\t\treturn(false);\n\t\t}\n\t\tsocket = LocalSocket.create();\n\t\tif(socket == null) {\n\t\t\tlog_error(\"Cannot create local socket\");\n\t\t\treturn(false);\n\t\t}\n\t\tvar pp = socketprefix;\n\t\tif(String.is_empty(pp)) {\n\t\t\tpp = \"sympathy_vhost_\";\n\t\t}\n\t\tvar socketname = \"%s%s\".printf().add(pp).add(name).to_string();\n\t\tif(socket != null) {\n\t\t\tif(socket.listen(socketname) == false) {\n\t\t\t\tsocket = null;\n\t\t\t}\n\t\t}\n\t\tif(socket == null) {\n\t\t\tlog_error(\"FAILED to listen to local socket `%s'\".printf().add(socketname));\n\t\t\treturn(false);\n\t\t}\n\t\tvar event_loop = server.get_eventloop();\n\t\tif(event_loop == null) {\n\t\t\tlog_error(\"No eventloop\");\n\t\t\treturn(false);\n\t\t}\n\t\tee = event_loop.entry_for_object(socket);\n\t\tif(ee == null) {\n\t\t\tlog_error(\"Failed to register socket with eventloop\");\n\t\t\treturn(false);\n\t\t}\n\t\tee.set_read_listener(this);\n\t\tlog_debug(\"HTTPServerVirtualHostListener: Listening for virtual host `%s'\".printf().add(name));\n\t\treturn(true);\n\t}\n\n\tpublic void close() {\n\t\tif(ee != null) {\n\t\t\tee.remove();\n\t\t\tee = null;\n\t\t}\n\t\tif(socket != null) {\n\t\t\tsocket.close();\n\t\t\tsocket = null;\n\t\t}\n\t\tserver = null;\n\t}\n\n\tpublic void on_read_ready() {\n\t\tvar ns = socket.accept();\n\t\tif(ns != null) {\n\t\t\tClient.create(server, ns);\n\t\t}\n\t}\n}\n\n}\n" }, { "path": "src/test/resources/samples/langs/EQ/SEButtonEntity.eq", "content": "\n/*\n * This file is part of Jkop\n * Copyright (c) 2016 Job and Esther Technologies, Inc.\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 deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * 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 all\n * 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 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\npublic class SEButtonEntity : SESpriteEntity, SEPointerListener\n{\n\tclass SEImageButtonEntity : SEButtonEntity\n\t{\n\t\tproperty SEImage image_normal;\n\t\tproperty SEImage image_hover;\n\t\tproperty SEImage image_pressed;\n\n\t\tpublic void update() {\n\t\t\tif(get_pressed()) {\n\t\t\t\tvar img = image_pressed;\n\t\t\t\tif(img == null) {\n\t\t\t\t\timg = image_hover;\n\t\t\t\t}\n\t\t\t\tif(img == null) {\n\t\t\t\t\timg = image_normal;\n\t\t\t\t}\n\t\t\t\tset_image(img);\n\t\t\t}\n\t\t\telse if(get_has_pointer()) {\n\t\t\t\tvar img = image_hover;\n\t\t\t\tif(img == null) {\n\t\t\t\t\timg = image_normal;\n\t\t\t\t}\n\t\t\t\tset_image(img);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tset_image(image_normal);\n\t\t\t}\n\t\t}\n\t}\n\n\tclass SETextButtonEntity : SEButtonEntity\n\t{\n\t\tproperty String button_text;\n\t\tproperty String normal_font;\n\t\tproperty String hover_font;\n\t\tproperty String pressed_font;\n\n\t\tpublic void update() {\n\t\t\tif(get_pressed()) {\n\t\t\t\tvar ff = pressed_font;\n\t\t\t\tif(String.is_empty(ff)) {\n\t\t\t\t\tff = hover_font;\n\t\t\t\t}\n\t\t\t\tif(String.is_empty(ff)) {\n\t\t\t\t\tff = normal_font;\n\t\t\t\t}\n\t\t\t\tset_text(button_text, ff);\n\t\t\t}\n\t\t\telse if(get_has_pointer()) {\n\t\t\t\tvar ff = hover_font;\n\t\t\t\tif(String.is_empty(ff)) {\n\t\t\t\t\tff = normal_font;\n\t\t\t\t}\n\t\t\t\tset_text(button_text, ff);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tset_text(button_text, normal_font);\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic static SEButtonEntity for_image(SEImage img) {\n\t\treturn(SEButtonEntity.for_images(img, null, null));\n\t}\n\n\tpublic static SEButtonEntity for_images(SEImage normal, SEImage hover, SEImage pressed) {\n\t\treturn(new SEImageButtonEntity().set_image_normal(normal).set_image_hover(hover)\n\t\t\t.set_image_pressed(pressed));\n\t}\n\n\tpublic static SEButtonEntity for_text(String text, String normal_font = null, String hover_font = null, String pressed_font = null) {\n\t\treturn(new SETextButtonEntity().set_button_text(text).set_normal_font(normal_font).set_hover_font(hover_font)\n\t\t\t.set_pressed_font(pressed_font));\n\t}\n\n\tproperty SEMessageListener listener;\n\tproperty Object data;\n\tbool pressed = false;\n\tbool has_pointer = false;\n\n\tpublic bool get_pressed() {\n\t\treturn(pressed);\n\t}\n\n\tpublic bool get_has_pointer() {\n\t\treturn(has_pointer);\n\t}\n\n\tpublic void initialize(SEResourceCache rsc) {\n\t\tbase.initialize(rsc);\n\t\tupdate();\n\t}\n\n\tpublic virtual void update() {\n\t}\n\n\tpublic virtual void on_pointer_enter(SEPointerInfo pi) {\n\t\tif(has_pointer) {\n\t\t\treturn;\n\t\t}\n\t\thas_pointer = true;\n\t\tupdate();\n\t}\n\n\tpublic virtual void on_pointer_leave(SEPointerInfo pi) {\n\t\tif(has_pointer == false && pressed == false) {\n\t\t\treturn;\n\t\t}\n\t\thas_pointer = false;\n\t\tpressed = false;\n\t\tupdate();\n\t}\n\n\tpublic void on_pointer_move(SEPointerInfo pi) {\n\t\tif(pi.is_inside(get_x(), get_y(), get_width(), get_height())) {\n\t\t\tif(has_pointer == false) {\n\t\t\t\ton_pointer_enter(pi);\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tif(has_pointer) {\n\t\t\t\ton_pointer_leave(pi);\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic void on_pointer_press(SEPointerInfo pi) {\n\t\tif(pressed) {\n\t\t\treturn;\n\t\t}\n\t\tif(pi.is_inside(get_x(), get_y(), get_width(), get_height()) == false) {\n\t\t\treturn;\n\t\t}\n\t\tpressed = true;\n\t\tupdate();\n\t}\n\n\tpublic void on_pointer_release(SEPointerInfo pi) {\n\t\tif(pressed == false) {\n\t\t\treturn;\n\t\t}\n\t\tif(pi.is_inside(get_x(), get_y(), get_width(), get_height()) == false) {\n\t\t\treturn;\n\t\t}\n\t\ton_pointer_click(pi);\n\t\tpressed = false;\n\t\tupdate();\n\t}\n\n\tpublic virtual void on_pointer_click(SEPointerInfo pi) {\n\t\tif(listener != null) {\n\t\t\tlistener.on_message(data);\n\t\t}\n\t}\n}\n" }, { "path": "src/test/resources/samples/langs/EQ/String.eq", "content": "\n/*\n * This file is part of Jkop\n * Copyright (c) 2016 Job and Esther Technologies, Inc.\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 deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * 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 all\n * 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 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\npublic interface String : Stringable, Integer, Double, Boolean\n{\n\tpublic static String instance(String o) {\n\t\tif(o == null) {\n\t\t\treturn(\"\");\n\t\t}\n\t\treturn(o);\n\t}\n\n\tpublic static String as_string(Object o) {\n\t\tif(o == null) {\n\t\t\treturn(null);\n\t\t}\n\t\tif(o is String) {\n\t\t\treturn((String)o);\n\t\t}\n\t\tif(o is Stringable) {\n\t\t\treturn(((Stringable)o).to_string());\n\t\t}\n\t\treturn(null);\n\t}\n\n\tpublic static strptr as_strptr(Object o) {\n\t\tvar str = as_string(o);\n\t\tif(str == null) {\n\t\t\treturn(null);\n\t\t}\n\t\treturn(str.to_strptr());\n\t}\n\n\tpublic static bool is_in_collection(String str, Collection c) {\n\t\tif(str == null) {\n\t\t\treturn(false);\n\t\t}\n\t\tforeach(String s in c) {\n\t\t\tif(s.equals(str)) {\n\t\t\t\treturn(true);\n\t\t\t}\n\t\t}\n\t\treturn(false);\n\t}\n\n\tpublic static bool is_empty(Object o) {\n\t\tif(o == null) {\n\t\t\treturn(true);\n\t\t}\n\t\tvar str = o as String;\n\t\tif(str == null && o is Stringable) {\n\t\t\tstr = ((Stringable)o).to_string();\n\t\t}\n\t\tif(str == null) {\n\t\t\treturn(true);\n\t\t}\n\t\tif(str.get_char(0) < 1) {\n\t\t\treturn(true);\n\t\t}\n\t\treturn(false);\n\t}\n\n\tpublic static String for_object(Object o) {\n\t\tif(o is String) {\n\t\t\treturn((String)o);\n\t\t}\n\t\tif(o is Stringable) {\n\t\t\treturn(((Stringable)o).to_string());\n\t\t}\n\t\treturn(null);\n\t}\n\n\tpublic static String for_character(int c) {\n\t\tvar sb = StringBuffer.create();\n\t\tsb.append_c(c);\n\t\treturn(sb.to_string());\n\t}\n\n\tpublic static String for_integer(int av) {\n\t\tIFDEF(\"target_cs\") {\n\t\t\tstrptr v;\n\t\t\tembed {{{\n\t\t\t\tv = av.ToString();\n\t\t\t}}}\n\t\t\treturn(String.for_strptr(v));\n\t\t}\n\t\tELSE IFDEF(\"target_java\") {\n\t\t\tstrptr st;\n\t\t\tembed {{{\n\t\t\t\tst = java.lang.String.valueOf(av);\n\t\t\t}}}\n\t\t\treturn(String.for_strptr(st));\n\t\t}\n\t\tELSE {\n\t\t\treturn(\"%d\".printf().add(av).to_string());\n\t\t}\n\t}\n\n\tpublic static String for_long(long av) {\n\t\tIFDEF(\"target_cs\") {\n\t\t\tstrptr v;\n\t\t\tembed {{{\n\t\t\t\tv = av.ToString();\n\t\t\t}}}\n\t\t\treturn(String.for_strptr(v));\n\t\t}\n\t\tELSE IFDEF(\"target_java\") {\n\t\t\tstrptr st;\n\t\t\tembed {{{\n\t\t\t\tst = java.lang.String.valueOf(av);\n\t\t\t}}}\n\t\t\treturn(String.for_strptr(st));\n\t\t}\n\t\tELSE {\n\t\t\treturn(for_integer((int)av));\n\t\t}\n\t}\n\n\tpublic static String for_double(double v) {\n\t\tIFDEF(\"target_java\") {\n\t\t\tstrptr st;\n\t\t\tembed {{{\n\t\t\t\tst = java.lang.String.valueOf(v);\n\t\t\t}}}\n\t\t\treturn(String.for_strptr(st));\n\t\t}\n\t\tELSE {\n\t\t\treturn(\"%f\".printf().add(v).to_string());\n\t\t}\n\t}\n\n\tpublic static String for_boolean(bool val) {\n\t\tif(val) {\n\t\t\treturn(\"true\");\n\t\t}\n\t\treturn(\"false\");\n\t}\n\n\tpublic static String for_strptr(strptr literal) {\n\t\tvar v = new StringImpl();\n\t\tv.set_strptr(literal);\n\t\treturn(v);\n\t}\n\n\tpublic static String for_utf8_buffer(Buffer data, bool haszero = true) {\n\t\tvar v = new StringImpl();\n\t\tv.set_utf8_buffer(data, haszero);\n\t\treturn(v);\n\t}\n\n\tpublic static String combine(Collection strings, int delim = -1, bool unique = false) {\n\t\tvar sb = StringBuffer.create();\n\t\tHashTable flags;\n\t\tif(unique) {\n\t\t\tflags = HashTable.create();\n\t\t}\n\t\tforeach(Object o in strings) {\n\t\t\tvar s = String.as_string(o);\n\t\t\tif(s == null) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(flags != null) {\n\t\t\t\tif(flags.get(s) != null) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tflags.set(s, \"true\");\n\t\t\t}\n\t\t\tif(delim > 0 && sb.count() > 0) {\n\t\t\t\tsb.append_c(delim);\n\t\t\t}\n\t\t\tsb.append(s);\n\t\t}\n\t\treturn(sb.to_string());\n\t}\n\n\tpublic static String capitalize(String str) {\n\t\tif(str == null) {\n\t\t\treturn(null);\n\t\t}\n\t\tvar c0 = str.get_char(0);\n\t\tif(c0 < 1) {\n\t\t\treturn(null);\n\t\t}\n\t\tif(c0 >= 'a' && c0 <= 'z') {\n\t\t\tvar sb = StringBuffer.create();\n\t\t\tsb.append_c(c0 - 'a' + 'A');\n\t\t\tsb.append(str.substring(1));\n\t\t\treturn(sb.to_string());\n\t\t}\n\t\treturn(str);\n\t}\n\n\tpublic StringFormatter printf();\n\tpublic String dup();\n\tpublic String append(String str);\n\tpublic int get_length();\n\tpublic int get_char(int n);\n\tpublic String truncate(int len);\n\tpublic String replace(int o, int r);\n\tpublic String replace_char(int o, int r);\n\tpublic String replace_string(String o, String r);\n\tpublic String remove(int start, int len);\n\tpublic String insert(String str, int pos);\n\tpublic String substring(int start, int alength = -1);\n\tpublic String reverse();\n\tpublic String lowercase();\n\tpublic String uppercase();\n\tpublic String strip();\n\tpublic Iterator split(int delim, int max = -1);\n\tpublic int str(String s);\n\tpublic bool contains(String s);\n\tpublic int rstr(String s);\n\tpublic int chr(int c);\n\tpublic int rchr(int c);\n\tpublic bool has_prefix(String prefix);\n\tpublic bool has_suffix(String suffix);\n\tpublic int compare(Object ao);\n\tpublic int compare_ignore_case(Object ao);\n\tpublic bool equals(Object ao);\n\tpublic bool equals_ptr(strptr str);\n\tpublic bool equals_ignore_case(Object ao);\n\tpublic bool equals_ignore_case_ptr(strptr str);\n\tpublic StringIterator iterate();\n\tpublic StringIterator iterate_reverse();\n\tpublic int to_integer_base(int ibase);\n\tpublic strptr to_strptr();\n\tpublic Buffer to_utf8_buffer(bool zero = true);\n\tpublic int hash();\n\tpublic EditableString as_editable();\n}" }, { "path": "src/test/resources/samples/langs/Eagle/Eagle.brd", "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\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n<b>Resistors, Capacitors, Inductors</b><p>\nBased on the previous libraries:\n<ul>\n<li>r.lbr\n<li>cap.lbr \n<li>cap-fe.lbr\n<li>captant.lbr\n<li>polcap.lbr\n<li>ipc-smd.lbr\n</ul>\nAll SMD packages are defined according to the IPC specifications and CECC<p>\n<author>Created by librarian@cadsoft.de</author><p>\n<p>\nfor Electrolyt Capacitors see also :<p>\nwww.bccomponents.com <p>\nwww.panasonic.com<p>\nwww.kemet.com<p>\nhttp://www.secc.co.jp/pdf/os_e/2004/e_os_all.pdf <b>(SANYO)</b>\n<p>\nfor trimmer refence see : <u>www.electrospec-inc.com/cross_references/trimpotcrossref.asp</u><p>\n\n<table border=0 cellspacing=0 cellpadding=0 width=\"100%\" cellpaddding=0>\n<tr valign=\"top\">\n\n<! <td width=\"10\">&nbsp;</td>\n<td width=\"90%\">\n\n<b><font color=\"#0000FF\" size=\"4\">TRIM-POT CROSS REFERENCE</font></b>\n<P>\n<TABLE BORDER=0 CELLSPACING=1 CELLPADDING=2>\n <TR>\n <TD COLSPAN=8>\n <FONT SIZE=3 FACE=ARIAL><B>RECTANGULAR MULTI-TURN</B></FONT>\n </TD>\n </TR>\n <TR>\n <TD ALIGN=CENTER>\n <B>\n <FONT SIZE=3 FACE=ARIAL color=\"#FF0000\">BOURNS</FONT>\n </B>\n </TD>\n <TD ALIGN=CENTER>\n <B>\n <FONT SIZE=3 FACE=ARIAL color=\"#FF0000\">BI&nbsp;TECH</FONT>\n </B>\n </TD>\n <TD ALIGN=CENTER>\n <B>\n <FONT SIZE=3 FACE=ARIAL color=\"#FF0000\">DALE-VISHAY</FONT>\n </B>\n </TD>\n <TD ALIGN=CENTER>\n <B>\n <FONT SIZE=3 FACE=ARIAL color=\"#FF0000\">PHILIPS/MEPCO</FONT>\n </B>\n </TD>\n <TD ALIGN=CENTER>\n <B>\n <FONT SIZE=3 FACE=ARIAL color=\"#FF0000\">MURATA</FONT>\n </B>\n </TD>\n <TD ALIGN=CENTER>\n <B>\n <FONT SIZE=3 FACE=ARIAL color=\"#FF0000\">PANASONIC</FONT>\n </B>\n </TD>\n <TD ALIGN=CENTER>\n <B>\n <FONT SIZE=3 FACE=ARIAL color=\"#FF0000\">SPECTROL</FONT>\n </B>\n </TD>\n <TD ALIGN=CENTER>\n <B>\n <FONT SIZE=3 FACE=ARIAL color=\"#FF0000\">MILSPEC</FONT>\n </B>\n </TD><TD>&nbsp;</TD>\n </TR>\n <TR>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3 >\n 3005P<BR>\n 3006P<BR>\n 3006W<BR>\n 3006Y<BR>\n 3009P<BR>\n 3009W<BR>\n 3009Y<BR>\n 3057J<BR>\n 3057L<BR>\n 3057P<BR>\n 3057Y<BR>\n 3059J<BR>\n 3059L<BR>\n 3059P<BR>\n 3059Y<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n 89P<BR>\n 89W<BR>\n 89X<BR>\n 89PH<BR>\n 76P<BR>\n 89XH<BR>\n 78SLT<BR>\n 78L&nbsp;ALT<BR>\n 56P&nbsp;ALT<BR>\n 78P&nbsp;ALT<BR>\n T8S<BR>\n 78L<BR>\n 56P<BR>\n 78P<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n T18/784<BR>\n 783<BR>\n 781<BR>\n -<BR>\n -<BR>\n -<BR>\n 2199<BR>\n 1697/1897<BR>\n 1680/1880<BR>\n 2187<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n 8035EKP/CT20/RJ-20P<BR>\n -<BR>\n RJ-20X<BR>\n -<BR>\n -<BR>\n -<BR>\n 1211L<BR>\n 8012EKQ&nbsp;ALT<BR>\n 8012EKR&nbsp;ALT<BR>\n 1211P<BR>\n 8012EKJ<BR>\n 8012EKL<BR>\n 8012EKQ<BR>\n 8012EKR<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n 2101P<BR>\n 2101W<BR>\n 2101Y<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n 2102L<BR>\n 2102S<BR>\n 2102Y<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n EVMCOG<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n 43P<BR>\n 43W<BR>\n 43Y<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n 40L<BR>\n 40P<BR>\n 40Y<BR>\n 70Y-T602<BR>\n 70L<BR>\n 70P<BR>\n 70Y<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n RT/RTR12<BR>\n RT/RTR12<BR>\n RT/RTR12<BR>\n -<BR>\n RJ/RJR12<BR>\n RJ/RJR12<BR>\n RJ/RJR12<BR></FONT>\n </TD>\n </TR>\n <TR>\n <TD COLSPAN=8>&nbsp;\n </TD>\n </TR>\n <TR>\n <TD COLSPAN=8>\n <FONT SIZE=4 FACE=ARIAL><B>SQUARE MULTI-TURN</B></FONT>\n </TD>\n </TR>\n <TR>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>BOURN</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>BI&nbsp;TECH</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>DALE-VISHAY</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>PHILIPS/MEPCO</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>MURATA</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>PANASONIC</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>SPECTROL</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>MILSPEC</B></FONT>\n </TD>\n </TR>\n <TR>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n 3250L<BR>\n 3250P<BR>\n 3250W<BR>\n 3250X<BR>\n 3252P<BR>\n 3252W<BR>\n 3252X<BR>\n 3260P<BR>\n 3260W<BR>\n 3260X<BR>\n 3262P<BR>\n 3262W<BR>\n 3262X<BR>\n 3266P<BR>\n 3266W<BR>\n 3266X<BR>\n 3290H<BR>\n 3290P<BR>\n 3290W<BR>\n 3292P<BR>\n 3292W<BR>\n 3292X<BR>\n 3296P<BR>\n 3296W<BR>\n 3296X<BR>\n 3296Y<BR>\n 3296Z<BR>\n 3299P<BR>\n 3299W<BR>\n 3299X<BR>\n 3299Y<BR>\n 3299Z<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n 66P&nbsp;ALT<BR>\n 66W&nbsp;ALT<BR>\n 66X&nbsp;ALT<BR>\n 66P&nbsp;ALT<BR>\n 66W&nbsp;ALT<BR>\n 66X&nbsp;ALT<BR>\n -<BR>\n 64W&nbsp;ALT<BR>\n -<BR>\n 64P&nbsp;ALT<BR>\n 64W&nbsp;ALT<BR>\n 64X&nbsp;ALT<BR>\n 64P<BR>\n 64W<BR>\n 64X<BR>\n 66X&nbsp;ALT<BR>\n 66P&nbsp;ALT<BR>\n 66W&nbsp;ALT<BR>\n 66P<BR>\n 66W<BR>\n 66X<BR>\n 67P<BR>\n 67W<BR>\n 67X<BR>\n 67Y<BR>\n 67Z<BR>\n 68P<BR>\n 68W<BR>\n 68X<BR>\n 67Y&nbsp;ALT<BR>\n 67Z&nbsp;ALT<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n 5050<BR>\n 5091<BR>\n 5080<BR>\n 5087<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n T63YB<BR>\n T63XB<BR>\n -<BR>\n -<BR>\n -<BR>\n 5887<BR>\n 5891<BR>\n 5880<BR>\n -<BR>\n -<BR>\n -<BR>\n T93Z<BR>\n T93YA<BR>\n T93XA<BR>\n T93YB<BR>\n T93XB<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n 8026EKP<BR>\n 8026EKW<BR>\n 8026EKM<BR>\n 8026EKP<BR>\n 8026EKB<BR>\n 8026EKM<BR>\n 1309X<BR>\n 1309P<BR>\n 1309W<BR>\n 8024EKP<BR>\n 8024EKW<BR>\n 8024EKN<BR>\n RJ-9P/CT9P<BR>\n RJ-9W<BR>\n RJ-9X<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n 3103P<BR>\n 3103Y<BR>\n 3103Z<BR>\n 3103P<BR>\n 3103Y<BR>\n 3103Z<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n 3105P/3106P<BR>\n 3105W/3106W<BR>\n 3105X/3106X<BR>\n 3105Y/3106Y<BR>\n 3105Z/3105Z<BR>\n 3102P<BR>\n 3102W<BR>\n 3102X<BR>\n 3102Y<BR>\n 3102Z<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n EVMCBG<BR>\n EVMCCG<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n 55-1-X<BR>\n 55-4-X<BR>\n 55-3-X<BR>\n 55-2-X<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n 50-2-X<BR>\n 50-4-X<BR>\n 50-3-X<BR>\n -<BR>\n -<BR>\n -<BR>\n 64P<BR>\n 64W<BR>\n 64X<BR>\n 64Y<BR>\n 64Z<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n RT/RTR22<BR>\n RT/RTR22<BR>\n RT/RTR22<BR>\n RT/RTR22<BR>\n RJ/RJR22<BR>\n RJ/RJR22<BR>\n RJ/RJR22<BR>\n RT/RTR26<BR>\n RT/RTR26<BR>\n RT/RTR26<BR>\n RJ/RJR26<BR>\n RJ/RJR26<BR>\n RJ/RJR26<BR>\n RJ/RJR26<BR>\n RJ/RJR26<BR>\n RJ/RJR26<BR>\n RT/RTR24<BR>\n RT/RTR24<BR>\n RT/RTR24<BR>\n RJ/RJR24<BR>\n RJ/RJR24<BR>\n RJ/RJR24<BR>\n RJ/RJR24<BR>\n RJ/RJR24<BR>\n RJ/RJR24<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n </TR>\n <TR>\n <TD COLSPAN=8>&nbsp;\n </TD>\n </TR>\n <TR>\n <TD COLSPAN=8>\n <FONT SIZE=4 FACE=ARIAL><B>SINGLE TURN</B></FONT>\n </TD>\n </TR>\n <TR>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>BOURN</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>BI&nbsp;TECH</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>DALE-VISHAY</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>PHILIPS/MEPCO</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>MURATA</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>PANASONIC</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>SPECTROL</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>MILSPEC</B></FONT>\n </TD>\n </TR>\n <TR>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n 3323P<BR>\n 3323S<BR>\n 3323W<BR>\n 3329H<BR>\n 3329P<BR>\n 3329W<BR>\n 3339H<BR>\n 3339P<BR>\n 3339W<BR>\n 3352E<BR>\n 3352H<BR>\n 3352K<BR>\n 3352P<BR>\n 3352T<BR>\n 3352V<BR>\n 3352W<BR>\n 3362H<BR>\n 3362M<BR>\n 3362P<BR>\n 3362R<BR>\n 3362S<BR>\n 3362U<BR>\n 3362W<BR>\n 3362X<BR>\n 3386B<BR>\n 3386C<BR>\n 3386F<BR>\n 3386H<BR>\n 3386K<BR>\n 3386M<BR>\n 3386P<BR>\n 3386S<BR>\n 3386W<BR>\n 3386X<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n 25P<BR>\n 25S<BR>\n 25RX<BR>\n 82P<BR>\n 82M<BR>\n 82PA<BR>\n -<BR>\n -<BR>\n -<BR>\n 91E<BR>\n 91X<BR>\n 91T<BR>\n 91B<BR>\n 91A<BR>\n 91V<BR>\n 91W<BR>\n 25W<BR>\n 25V<BR>\n 25P<BR>\n -<BR>\n 25S<BR>\n 25U<BR>\n 25RX<BR>\n 25X<BR>\n 72XW<BR>\n 72XL<BR>\n 72PM<BR>\n 72RX<BR>\n -<BR>\n 72PX<BR>\n 72P<BR>\n 72RXW<BR>\n 72RXL<BR>\n 72X<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n T7YB<BR>\n T7YA<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n TXD<BR>\n TYA<BR>\n TYP<BR>\n -<BR>\n TYD<BR>\n TX<BR>\n -<BR>\n 150SX<BR>\n 100SX<BR>\n 102T<BR>\n 101S<BR>\n 190T<BR>\n 150TX<BR>\n 101<BR>\n -<BR>\n -<BR>\n 101SX<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n ET6P<BR>\n ET6S<BR>\n ET6X<BR>\n RJ-6W/8014EMW<BR>\n RJ-6P/8014EMP<BR>\n RJ-6X/8014EMX<BR>\n TM7W<BR>\n TM7P<BR>\n TM7X<BR>\n -<BR>\n 8017SMS<BR>\n -<BR>\n 8017SMB<BR>\n 8017SMA<BR>\n -<BR>\n -<BR>\n CT-6W<BR>\n CT-6H<BR>\n CT-6P<BR>\n CT-6R<BR>\n -<BR>\n CT-6V<BR>\n CT-6X<BR>\n -<BR>\n -<BR>\n 8038EKV<BR>\n -<BR>\n 8038EKX<BR>\n -<BR>\n -<BR>\n 8038EKP<BR>\n 8038EKZ<BR>\n 8038EKW<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n 3321H<BR>\n 3321P<BR>\n 3321N<BR>\n 1102H<BR>\n 1102P<BR>\n 1102T<BR>\n RVA0911V304A<BR>\n -<BR>\n RVA0911H413A<BR>\n RVG0707V100A<BR>\n RVA0607V(H)306A<BR>\n RVA1214H213A<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n 3104B<BR>\n 3104C<BR>\n 3104F<BR>\n 3104H<BR>\n -<BR>\n 3104M<BR>\n 3104P<BR>\n 3104S<BR>\n 3104W<BR>\n 3104X<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n EVMQ0G<BR>\n EVMQIG<BR>\n EVMQ3G<BR>\n EVMS0G<BR>\n EVMQ0G<BR>\n EVMG0G<BR>\n -<BR>\n -<BR>\n -<BR>\n EVMK4GA00B<BR>\n EVM30GA00B<BR>\n EVMK0GA00B<BR>\n EVM38GA00B<BR>\n EVMB6<BR>\n EVLQ0<BR>\n -<BR>\n EVMMSG<BR>\n EVMMBG<BR>\n EVMMAG<BR>\n -<BR>\n -<BR>\n EVMMCS<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n EVMM1<BR>\n -<BR>\n -<BR>\n EVMM0<BR>\n -<BR>\n -<BR>\n EVMM3<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n 62-3-1<BR>\n 62-1-2<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n 67R<BR>\n -<BR>\n 67P<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n 67X<BR>\n 63V<BR>\n 63S<BR>\n 63M<BR>\n -<BR>\n -<BR>\n 63H<BR>\n 63P<BR>\n -<BR>\n -<BR>\n 63X<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n RJ/RJR50<BR>\n RJ/RJR50<BR>\n RJ/RJR50<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n </TR>\n</TABLE>\n<P>&nbsp;<P>\n<TABLE BORDER=0 CELLSPACING=1 CELLPADDING=3>\n <TR>\n <TD COLSPAN=7>\n <FONT color=\"#0000FF\" SIZE=4 FACE=ARIAL><B>SMD TRIM-POT CROSS REFERENCE</B></FONT>\n <P>\n <FONT SIZE=4 FACE=ARIAL><B>MULTI-TURN</B></FONT>\n </TD>\n </TR>\n <TR>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>BOURNS</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>BI&nbsp;TECH</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>DALE-VISHAY</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>PHILIPS/MEPCO</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>PANASONIC</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>TOCOS</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>AUX/KYOCERA</B></FONT>\n </TD>\n </TR>\n <TR>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n 3224G<BR>\n 3224J<BR>\n 3224W<BR>\n 3269P<BR>\n 3269W<BR>\n 3269X<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n 44G<BR>\n 44J<BR>\n 44W<BR>\n 84P<BR>\n 84W<BR>\n 84X<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n ST63Z<BR>\n ST63Y<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n ST5P<BR>\n ST5W<BR>\n ST5X<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n </TR>\n <TR>\n <TD COLSPAN=7>&nbsp;\n </TD>\n </TR>\n <TR>\n <TD COLSPAN=7>\n <FONT SIZE=4 FACE=ARIAL><B>SINGLE TURN</B></FONT>\n </TD>\n </TR>\n <TR>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>BOURNS</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>BI&nbsp;TECH</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>DALE-VISHAY</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>PHILIPS/MEPCO</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>PANASONIC</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>TOCOS</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>AUX/KYOCERA</B></FONT>\n </TD>\n </TR>\n <TR>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n 3314G<BR>\n 3314J<BR>\n 3364A/B<BR>\n 3364C/D<BR>\n 3364W/X<BR>\n 3313G<BR>\n 3313J<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n 23B<BR>\n 23A<BR>\n 21X<BR>\n 21W<BR>\n -<BR>\n 22B<BR>\n 22A<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n ST5YL/ST53YL<BR>\n ST5YJ/5T53YJ<BR>\n ST-23A<BR>\n ST-22B<BR>\n ST-22<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n ST-4B<BR>\n ST-4A<BR>\n -<BR>\n -<BR>\n -<BR>\n ST-3B<BR>\n ST-3A<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n EVM-6YS<BR>\n EVM-1E<BR>\n EVM-1G<BR>\n EVM-1D<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n G4B<BR>\n G4A<BR>\n TR04-3S1<BR>\n TRG04-2S1<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n DVR-43A<BR>\n CVR-42C<BR>\n CVR-42A/C<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n </TR>\n</TABLE>\n<P>\n<FONT SIZE=4 FACE=ARIAL><B>ALT =&nbsp;ALTERNATE</B></FONT>\n<P>\n\n&nbsp;\n<P>\n</td>\n</tr>\n</table>\n\n\n<b>RESISTOR</b><p>\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n\n\n<b>Pin Header Connectors</b><p>\n<author>Created by librarian@cadsoft.de</author>\n\n\n<b>PIN HEADER</b>\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n<b>EAGLE Design Rules</b>\n<p>\nDie Standard-Design-Rules sind so gewählt, dass sie für \ndie meisten Anwendungen passen. Sollte ihre Platine \nbesondere Anforderungen haben, treffen Sie die erforderlichen\nEinstellungen hier und speichern die Design Rules unter \neinem neuen Namen ab.\n<b>EAGLE Design Rules</b>\n<p>\nThe default Design Rules have been set to cover\na wide range of applications. Your particular design\nmay have different requirements, so please make the\nnecessary adjustments and save your customized\ndesign rules under a new name.\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\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": "src/test/resources/samples/langs/Eagle/Eagle.sch", "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\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n<b>Frames for Sheet and Layout</b>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n>DRAWING_NAME\n>LAST_DATE_TIME\n>SHEET\nSheet:\n\n\n\n\n\n<b>FRAME</b><p>\nDIN A4, landscape with location and doc. field\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n<b>Resistors, Capacitors, Inductors</b><p>\nBased on the previous libraries:\n<ul>\n<li>r.lbr\n<li>cap.lbr \n<li>cap-fe.lbr\n<li>captant.lbr\n<li>polcap.lbr\n<li>ipc-smd.lbr\n</ul>\nAll SMD packages are defined according to the IPC specifications and CECC<p>\n<author>Created by librarian@cadsoft.de</author><p>\n<p>\nfor Electrolyt Capacitors see also :<p>\nwww.bccomponents.com <p>\nwww.panasonic.com<p>\nwww.kemet.com<p>\nhttp://www.secc.co.jp/pdf/os_e/2004/e_os_all.pdf <b>(SANYO)</b>\n<p>\nfor trimmer refence see : <u>www.electrospec-inc.com/cross_references/trimpotcrossref.asp</u><p>\n\n<table border=0 cellspacing=0 cellpadding=0 width=\"100%\" cellpaddding=0>\n<tr valign=\"top\">\n\n<! <td width=\"10\">&nbsp;</td>\n<td width=\"90%\">\n\n<b><font color=\"#0000FF\" size=\"4\">TRIM-POT CROSS REFERENCE</font></b>\n<P>\n<TABLE BORDER=0 CELLSPACING=1 CELLPADDING=2>\n <TR>\n <TD COLSPAN=8>\n <FONT SIZE=3 FACE=ARIAL><B>RECTANGULAR MULTI-TURN</B></FONT>\n </TD>\n </TR>\n <TR>\n <TD ALIGN=CENTER>\n <B>\n <FONT SIZE=3 FACE=ARIAL color=\"#FF0000\">BOURNS</FONT>\n </B>\n </TD>\n <TD ALIGN=CENTER>\n <B>\n <FONT SIZE=3 FACE=ARIAL color=\"#FF0000\">BI&nbsp;TECH</FONT>\n </B>\n </TD>\n <TD ALIGN=CENTER>\n <B>\n <FONT SIZE=3 FACE=ARIAL color=\"#FF0000\">DALE-VISHAY</FONT>\n </B>\n </TD>\n <TD ALIGN=CENTER>\n <B>\n <FONT SIZE=3 FACE=ARIAL color=\"#FF0000\">PHILIPS/MEPCO</FONT>\n </B>\n </TD>\n <TD ALIGN=CENTER>\n <B>\n <FONT SIZE=3 FACE=ARIAL color=\"#FF0000\">MURATA</FONT>\n </B>\n </TD>\n <TD ALIGN=CENTER>\n <B>\n <FONT SIZE=3 FACE=ARIAL color=\"#FF0000\">PANASONIC</FONT>\n </B>\n </TD>\n <TD ALIGN=CENTER>\n <B>\n <FONT SIZE=3 FACE=ARIAL color=\"#FF0000\">SPECTROL</FONT>\n </B>\n </TD>\n <TD ALIGN=CENTER>\n <B>\n <FONT SIZE=3 FACE=ARIAL color=\"#FF0000\">MILSPEC</FONT>\n </B>\n </TD><TD>&nbsp;</TD>\n </TR>\n <TR>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3 >\n 3005P<BR>\n 3006P<BR>\n 3006W<BR>\n 3006Y<BR>\n 3009P<BR>\n 3009W<BR>\n 3009Y<BR>\n 3057J<BR>\n 3057L<BR>\n 3057P<BR>\n 3057Y<BR>\n 3059J<BR>\n 3059L<BR>\n 3059P<BR>\n 3059Y<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n 89P<BR>\n 89W<BR>\n 89X<BR>\n 89PH<BR>\n 76P<BR>\n 89XH<BR>\n 78SLT<BR>\n 78L&nbsp;ALT<BR>\n 56P&nbsp;ALT<BR>\n 78P&nbsp;ALT<BR>\n T8S<BR>\n 78L<BR>\n 56P<BR>\n 78P<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n T18/784<BR>\n 783<BR>\n 781<BR>\n -<BR>\n -<BR>\n -<BR>\n 2199<BR>\n 1697/1897<BR>\n 1680/1880<BR>\n 2187<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n 8035EKP/CT20/RJ-20P<BR>\n -<BR>\n RJ-20X<BR>\n -<BR>\n -<BR>\n -<BR>\n 1211L<BR>\n 8012EKQ&nbsp;ALT<BR>\n 8012EKR&nbsp;ALT<BR>\n 1211P<BR>\n 8012EKJ<BR>\n 8012EKL<BR>\n 8012EKQ<BR>\n 8012EKR<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n 2101P<BR>\n 2101W<BR>\n 2101Y<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n 2102L<BR>\n 2102S<BR>\n 2102Y<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n EVMCOG<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n 43P<BR>\n 43W<BR>\n 43Y<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n 40L<BR>\n 40P<BR>\n 40Y<BR>\n 70Y-T602<BR>\n 70L<BR>\n 70P<BR>\n 70Y<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n RT/RTR12<BR>\n RT/RTR12<BR>\n RT/RTR12<BR>\n -<BR>\n RJ/RJR12<BR>\n RJ/RJR12<BR>\n RJ/RJR12<BR></FONT>\n </TD>\n </TR>\n <TR>\n <TD COLSPAN=8>&nbsp;\n </TD>\n </TR>\n <TR>\n <TD COLSPAN=8>\n <FONT SIZE=4 FACE=ARIAL><B>SQUARE MULTI-TURN</B></FONT>\n </TD>\n </TR>\n <TR>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>BOURN</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>BI&nbsp;TECH</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>DALE-VISHAY</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>PHILIPS/MEPCO</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>MURATA</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>PANASONIC</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>SPECTROL</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>MILSPEC</B></FONT>\n </TD>\n </TR>\n <TR>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n 3250L<BR>\n 3250P<BR>\n 3250W<BR>\n 3250X<BR>\n 3252P<BR>\n 3252W<BR>\n 3252X<BR>\n 3260P<BR>\n 3260W<BR>\n 3260X<BR>\n 3262P<BR>\n 3262W<BR>\n 3262X<BR>\n 3266P<BR>\n 3266W<BR>\n 3266X<BR>\n 3290H<BR>\n 3290P<BR>\n 3290W<BR>\n 3292P<BR>\n 3292W<BR>\n 3292X<BR>\n 3296P<BR>\n 3296W<BR>\n 3296X<BR>\n 3296Y<BR>\n 3296Z<BR>\n 3299P<BR>\n 3299W<BR>\n 3299X<BR>\n 3299Y<BR>\n 3299Z<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n 66P&nbsp;ALT<BR>\n 66W&nbsp;ALT<BR>\n 66X&nbsp;ALT<BR>\n 66P&nbsp;ALT<BR>\n 66W&nbsp;ALT<BR>\n 66X&nbsp;ALT<BR>\n -<BR>\n 64W&nbsp;ALT<BR>\n -<BR>\n 64P&nbsp;ALT<BR>\n 64W&nbsp;ALT<BR>\n 64X&nbsp;ALT<BR>\n 64P<BR>\n 64W<BR>\n 64X<BR>\n 66X&nbsp;ALT<BR>\n 66P&nbsp;ALT<BR>\n 66W&nbsp;ALT<BR>\n 66P<BR>\n 66W<BR>\n 66X<BR>\n 67P<BR>\n 67W<BR>\n 67X<BR>\n 67Y<BR>\n 67Z<BR>\n 68P<BR>\n 68W<BR>\n 68X<BR>\n 67Y&nbsp;ALT<BR>\n 67Z&nbsp;ALT<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n 5050<BR>\n 5091<BR>\n 5080<BR>\n 5087<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n T63YB<BR>\n T63XB<BR>\n -<BR>\n -<BR>\n -<BR>\n 5887<BR>\n 5891<BR>\n 5880<BR>\n -<BR>\n -<BR>\n -<BR>\n T93Z<BR>\n T93YA<BR>\n T93XA<BR>\n T93YB<BR>\n T93XB<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n 8026EKP<BR>\n 8026EKW<BR>\n 8026EKM<BR>\n 8026EKP<BR>\n 8026EKB<BR>\n 8026EKM<BR>\n 1309X<BR>\n 1309P<BR>\n 1309W<BR>\n 8024EKP<BR>\n 8024EKW<BR>\n 8024EKN<BR>\n RJ-9P/CT9P<BR>\n RJ-9W<BR>\n RJ-9X<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n 3103P<BR>\n 3103Y<BR>\n 3103Z<BR>\n 3103P<BR>\n 3103Y<BR>\n 3103Z<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n 3105P/3106P<BR>\n 3105W/3106W<BR>\n 3105X/3106X<BR>\n 3105Y/3106Y<BR>\n 3105Z/3105Z<BR>\n 3102P<BR>\n 3102W<BR>\n 3102X<BR>\n 3102Y<BR>\n 3102Z<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n EVMCBG<BR>\n EVMCCG<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n 55-1-X<BR>\n 55-4-X<BR>\n 55-3-X<BR>\n 55-2-X<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n 50-2-X<BR>\n 50-4-X<BR>\n 50-3-X<BR>\n -<BR>\n -<BR>\n -<BR>\n 64P<BR>\n 64W<BR>\n 64X<BR>\n 64Y<BR>\n 64Z<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n RT/RTR22<BR>\n RT/RTR22<BR>\n RT/RTR22<BR>\n RT/RTR22<BR>\n RJ/RJR22<BR>\n RJ/RJR22<BR>\n RJ/RJR22<BR>\n RT/RTR26<BR>\n RT/RTR26<BR>\n RT/RTR26<BR>\n RJ/RJR26<BR>\n RJ/RJR26<BR>\n RJ/RJR26<BR>\n RJ/RJR26<BR>\n RJ/RJR26<BR>\n RJ/RJR26<BR>\n RT/RTR24<BR>\n RT/RTR24<BR>\n RT/RTR24<BR>\n RJ/RJR24<BR>\n RJ/RJR24<BR>\n RJ/RJR24<BR>\n RJ/RJR24<BR>\n RJ/RJR24<BR>\n RJ/RJR24<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n </TR>\n <TR>\n <TD COLSPAN=8>&nbsp;\n </TD>\n </TR>\n <TR>\n <TD COLSPAN=8>\n <FONT SIZE=4 FACE=ARIAL><B>SINGLE TURN</B></FONT>\n </TD>\n </TR>\n <TR>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>BOURN</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>BI&nbsp;TECH</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>DALE-VISHAY</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>PHILIPS/MEPCO</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>MURATA</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>PANASONIC</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>SPECTROL</B></FONT>\n </TD>\n <TD ALIGN=CENTER>\n <FONT SIZE=3 FACE=ARIAL><B>MILSPEC</B></FONT>\n </TD>\n </TR>\n <TR>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n 3323P<BR>\n 3323S<BR>\n 3323W<BR>\n 3329H<BR>\n 3329P<BR>\n 3329W<BR>\n 3339H<BR>\n 3339P<BR>\n 3339W<BR>\n 3352E<BR>\n 3352H<BR>\n 3352K<BR>\n 3352P<BR>\n 3352T<BR>\n 3352V<BR>\n 3352W<BR>\n 3362H<BR>\n 3362M<BR>\n 3362P<BR>\n 3362R<BR>\n 3362S<BR>\n 3362U<BR>\n 3362W<BR>\n 3362X<BR>\n 3386B<BR>\n 3386C<BR>\n 3386F<BR>\n 3386H<BR>\n 3386K<BR>\n 3386M<BR>\n 3386P<BR>\n 3386S<BR>\n 3386W<BR>\n 3386X<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n 25P<BR>\n 25S<BR>\n 25RX<BR>\n 82P<BR>\n 82M<BR>\n 82PA<BR>\n -<BR>\n -<BR>\n -<BR>\n 91E<BR>\n 91X<BR>\n 91T<BR>\n 91B<BR>\n 91A<BR>\n 91V<BR>\n 91W<BR>\n 25W<BR>\n 25V<BR>\n 25P<BR>\n -<BR>\n 25S<BR>\n 25U<BR>\n 25RX<BR>\n 25X<BR>\n 72XW<BR>\n 72XL<BR>\n 72PM<BR>\n 72RX<BR>\n -<BR>\n 72PX<BR>\n 72P<BR>\n 72RXW<BR>\n 72RXL<BR>\n 72X<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n T7YB<BR>\n T7YA<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n TXD<BR>\n TYA<BR>\n TYP<BR>\n -<BR>\n TYD<BR>\n TX<BR>\n -<BR>\n 150SX<BR>\n 100SX<BR>\n 102T<BR>\n 101S<BR>\n 190T<BR>\n 150TX<BR>\n 101<BR>\n -<BR>\n -<BR>\n 101SX<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n ET6P<BR>\n ET6S<BR>\n ET6X<BR>\n RJ-6W/8014EMW<BR>\n RJ-6P/8014EMP<BR>\n RJ-6X/8014EMX<BR>\n TM7W<BR>\n TM7P<BR>\n TM7X<BR>\n -<BR>\n 8017SMS<BR>\n -<BR>\n 8017SMB<BR>\n 8017SMA<BR>\n -<BR>\n -<BR>\n CT-6W<BR>\n CT-6H<BR>\n CT-6P<BR>\n CT-6R<BR>\n -<BR>\n CT-6V<BR>\n CT-6X<BR>\n -<BR>\n -<BR>\n 8038EKV<BR>\n -<BR>\n 8038EKX<BR>\n -<BR>\n -<BR>\n 8038EKP<BR>\n 8038EKZ<BR>\n 8038EKW<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n 3321H<BR>\n 3321P<BR>\n 3321N<BR>\n 1102H<BR>\n 1102P<BR>\n 1102T<BR>\n RVA0911V304A<BR>\n -<BR>\n RVA0911H413A<BR>\n RVG0707V100A<BR>\n RVA0607V(H)306A<BR>\n RVA1214H213A<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n 3104B<BR>\n 3104C<BR>\n 3104F<BR>\n 3104H<BR>\n -<BR>\n 3104M<BR>\n 3104P<BR>\n 3104S<BR>\n 3104W<BR>\n 3104X<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n EVMQ0G<BR>\n EVMQIG<BR>\n EVMQ3G<BR>\n EVMS0G<BR>\n EVMQ0G<BR>\n EVMG0G<BR>\n -<BR>\n -<BR>\n -<BR>\n EVMK4GA00B<BR>\n EVM30GA00B<BR>\n EVMK0GA00B<BR>\n EVM38GA00B<BR>\n EVMB6<BR>\n EVLQ0<BR>\n -<BR>\n EVMMSG<BR>\n EVMMBG<BR>\n EVMMAG<BR>\n -<BR>\n -<BR>\n EVMMCS<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n EVMM1<BR>\n -<BR>\n -<BR>\n EVMM0<BR>\n -<BR>\n -<BR>\n EVMM3<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n 62-3-1<BR>\n 62-1-2<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n 67R<BR>\n -<BR>\n 67P<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n 67X<BR>\n 63V<BR>\n 63S<BR>\n 63M<BR>\n -<BR>\n -<BR>\n 63H<BR>\n 63P<BR>\n -<BR>\n -<BR>\n 63X<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n RJ/RJR50<BR>\n RJ/RJR50<BR>\n RJ/RJR50<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n </TR>\n</TABLE>\n<P>&nbsp;<P>\n<TABLE BORDER=0 CELLSPACING=1 CELLPADDING=3>\n <TR>\n <TD COLSPAN=7>\n <FONT color=\"#0000FF\" SIZE=4 FACE=ARIAL><B>SMD TRIM-POT CROSS REFERENCE</B></FONT>\n <P>\n <FONT SIZE=4 FACE=ARIAL><B>MULTI-TURN</B></FONT>\n </TD>\n </TR>\n <TR>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>BOURNS</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>BI&nbsp;TECH</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>DALE-VISHAY</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>PHILIPS/MEPCO</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>PANASONIC</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>TOCOS</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>AUX/KYOCERA</B></FONT>\n </TD>\n </TR>\n <TR>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n 3224G<BR>\n 3224J<BR>\n 3224W<BR>\n 3269P<BR>\n 3269W<BR>\n 3269X<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n 44G<BR>\n 44J<BR>\n 44W<BR>\n 84P<BR>\n 84W<BR>\n 84X<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n ST63Z<BR>\n ST63Y<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n ST5P<BR>\n ST5W<BR>\n ST5X<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n </TR>\n <TR>\n <TD COLSPAN=7>&nbsp;\n </TD>\n </TR>\n <TR>\n <TD COLSPAN=7>\n <FONT SIZE=4 FACE=ARIAL><B>SINGLE TURN</B></FONT>\n </TD>\n </TR>\n <TR>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>BOURNS</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>BI&nbsp;TECH</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>DALE-VISHAY</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>PHILIPS/MEPCO</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>PANASONIC</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>TOCOS</B></FONT>\n </TD>\n <TD>\n <FONT SIZE=3 FACE=ARIAL><B>AUX/KYOCERA</B></FONT>\n </TD>\n </TR>\n <TR>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n 3314G<BR>\n 3314J<BR>\n 3364A/B<BR>\n 3364C/D<BR>\n 3364W/X<BR>\n 3313G<BR>\n 3313J<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n 23B<BR>\n 23A<BR>\n 21X<BR>\n 21W<BR>\n -<BR>\n 22B<BR>\n 22A<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n ST5YL/ST53YL<BR>\n ST5YJ/5T53YJ<BR>\n ST-23A<BR>\n ST-22B<BR>\n ST-22<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n ST-4B<BR>\n ST-4A<BR>\n -<BR>\n -<BR>\n -<BR>\n ST-3B<BR>\n ST-3A<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n EVM-6YS<BR>\n EVM-1E<BR>\n EVM-1G<BR>\n EVM-1D<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n G4B<BR>\n G4A<BR>\n TR04-3S1<BR>\n TRG04-2S1<BR>\n -<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n <TD BGCOLOR=\"#cccccc\" ALIGN=CENTER><FONT FACE=ARIAL SIZE=3>\n -<BR>\n -<BR>\n DVR-43A<BR>\n CVR-42C<BR>\n CVR-42A/C<BR>\n -<BR>\n -<BR></FONT>\n </TD>\n </TR>\n</TABLE>\n<P>\n<FONT SIZE=4 FACE=ARIAL><B>ALT =&nbsp;ALTERNATE</B></FONT>\n<P>\n\n&nbsp;\n<P>\n</td>\n</tr>\n</table>\n\n\n<b>RESISTOR</b>\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b>\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b><p>\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b> wave soldering<p>\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b>\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b>\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b><p>\nwave soldering\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b>\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b><p>\nwave soldering\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b>\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>RESISTOR</b><p>\nwave soldering\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>RESISTOR</b>\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b><p>\nwave soldering\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b>\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b><p>\nwave soldering\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b>\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b><p>\nwave soldering\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b>\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b><p>\nwave soldering\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b>\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b><p>\nwave soldering\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b><p>\nSource: http://download.siliconexpert.com/pdfs/2005/02/24/Semi_Ap/2/VSH/Resistor/dcrcwfre.pdf\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b> wave soldering<p>\nSource: http://download.siliconexpert.com/pdfs/2005/02/24/Semi_Ap/2/VSH/Resistor/dcrcwfre.pdf\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b><p>\nMELF 0.10 W\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b><p>\nMELF 0.25 W\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b><p>\nMELF 0.12 W\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b><p>\nMELF 0.10 W\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b><p>\nMELF 0.25 W\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b><p>\nMELF 0.25 W\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b><p>\nMELF 0.12 W\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b><p>\nMELF 0.25 W\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b><p>\ntype 0204, grid 5 mm\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>RESISTOR</b><p>\ntype 0204, grid 7.5 mm\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>RESISTOR</b><p>\ntype 0207, grid 10 mm\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>RESISTOR</b><p>\ntype 0207, grid 12 mm\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n\n<b>RESISTOR</b><p>\ntype 0207, grid 15mm\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n\n<b>RESISTOR</b><p>\ntype 0207, grid 2.5 mm\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n<b>RESISTOR</b><p>\ntype 0207, grid 5 mm\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n<b>RESISTOR</b><p>\ntype 0207, grid 7.5 mm\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>RESISTOR</b><p>\ntype 0309, grid 10mm\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>RESISTOR</b><p>\ntype 0309, grid 12.5 mm\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>RESISTOR</b><p>\ntype 0411, grid 12.5 mm\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>RESISTOR</b><p>\ntype 0411, grid 15 mm\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>RESISTOR</b><p>\ntype 0411, grid 3.81 mm\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n<b>RESISTOR</b><p>\ntype 0414, grid 15 mm\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>RESISTOR</b><p>\ntype 0414, grid 5 mm\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n<b>RESISTOR</b><p>\ntype 0617, grid 17.5 mm\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>RESISTOR</b><p>\ntype 0617, grid 22.5 mm\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>RESISTOR</b><p>\ntype 0617, grid 5 mm\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n<b>RESISTOR</b><p>\ntype 0922, grid 22.5 mm\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n\n<b>RESISTOR</b><p>\ntype 0613, grid 5 mm\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n<b>RESISTOR</b><p>\ntype 0613, grid 15 mm\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>RESISTOR</b><p>\ntype 0817, grid 22.5 mm\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n0817\n\n\n\n\n<b>RESISTOR</b><p>\ntype 0817, grid 6.35 mm\n\n\n\n\n\n\n>NAME\n>VALUE\n0817\n\n\n\n<b>RESISTOR</b><p>\ntype V234, grid 12.5 mm\n\n\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>RESISTOR</b><p>\ntype V235, grid 17.78 mm\n\n\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>RESISTOR</b><p>\ntype V526-0, grid 2.5 mm\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n<b>Mini MELF 0102 Axial</b>\n\n\n\n\n>NAME\n>VALUE\n\n\n\n<b>RESISTOR</b><p>\ntype 0922, grid 7.5 mm\n\n\n\n\n\n\n>NAME\n>VALUE\n0922\n\n\n\n<b>CECC Size RC2211</b> Reflow Soldering<p>\nsource Beyschlag\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n<b>CECC Size RC2211</b> Wave Soldering<p>\nsource Beyschlag\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n<b>CECC Size RC3715</b> Reflow Soldering<p>\nsource Beyschlag\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n<b>CECC Size RC3715</b> Wave Soldering<p>\nsource Beyschlag\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n<b>CECC Size RC6123</b> Reflow Soldering<p>\nsource Beyschlag\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n<b>CECC Size RC6123</b> Wave Soldering<p>\nsource Beyschlag\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n<b>RESISTOR</b><p>\ntype RDH, grid 15 mm\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\nRDH\n\n\n\n\n<b>RESISTOR</b><p>\ntype 0204, grid 2.5 mm\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n<b>RESISTOR</b><p>\ntype 0309, grid 2.5 mm\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>RESISTOR</b> chip<p>\nSource: http://www.vishay.com/docs/20008/dcrcw.pdf\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>Bulk Metal® Foil Technology</b>, Tubular Axial Lead Resistors, Meets or Exceeds MIL-R-39005 Requirements<p>\nMIL SIZE RNC55<br>\nSource: VISHAY .. vta56.pdf\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>Bulk Metal® Foil Technology</b>, Tubular Axial Lead Resistors, Meets or Exceeds MIL-R-39005 Requirements<p>\nMIL SIZE RNC60<br>\nSource: VISHAY .. vta56.pdf\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>Bulk Metal® Foil Technology</b>, Tubular Axial Lead Resistors, Meets or Exceeds MIL-R-39005 Requirements<p>\nMIL SIZE RBR52<br>\nSource: VISHAY .. vta56.pdf\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>Bulk Metal® Foil Technology</b>, Tubular Axial Lead Resistors, Meets or Exceeds MIL-R-39005 Requirements<p>\nMIL SIZE RBR53<br>\nSource: VISHAY .. vta56.pdf\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>Bulk Metal® Foil Technology</b>, Tubular Axial Lead Resistors, Meets or Exceeds MIL-R-39005 Requirements<p>\nMIL SIZE RBR54<br>\nSource: VISHAY .. vta56.pdf\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>Bulk Metal® Foil Technology</b>, Tubular Axial Lead Resistors, Meets or Exceeds MIL-R-39005 Requirements<p>\nMIL SIZE RBR55<br>\nSource: VISHAY .. vta56.pdf\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>Bulk Metal® Foil Technology</b>, Tubular Axial Lead Resistors, Meets or Exceeds MIL-R-39005 Requirements<p>\nMIL SIZE RBR56<br>\nSource: VISHAY .. vta56.pdf\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>Package 4527</b><p>\nSource: http://www.vishay.com/docs/31059/wsrhigh.pdf\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n<b>Wirewound Resistors, Precision Power</b><p>\nSource: VISHAY wscwsn.pdf\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n<b>Wirewound Resistors, Precision Power</b><p>\nSource: VISHAY wscwsn.pdf\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n<b>Wirewound Resistors, Precision Power</b><p>\nSource: VISHAY wscwsn.pdf\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n<b>Wirewound Resistors, Precision Power</b><p>\nSource: VISHAY wscwsn.pdf\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n<b>Wirewound Resistors, Precision Power</b><p>\nSource: VISHAY wscwsn.pdf\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n<b>Wirewound Resistors, Precision Power</b><p>\nSource: VISHAY wscwsn.pdf\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n<b>CRCW1218 Thick Film, Rectangular Chip Resistors</b><p>\nSource: http://www.vishay.com .. dcrcw.pdf\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n<b>Chip Monolithic Ceramic Capacitors</b> Medium Voltage High Capacitance for General Use<p>\nSource: http://www.murata.com .. GRM43DR72E224KW01.pdf\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n\n<B>RESISTOR</B>, American symbol\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n<b>Pin Header Connectors</b><p>\n<author>Created by librarian@cadsoft.de</author>\n\n\n<b>PIN HEADER</b>\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n\n\n\n\n>NAME\n>VALUE\n\n\n\n\n\n<b>PIN HEADER</b>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\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": "src/test/resources/samples/langs/Easybuild/bzip2-1.0.6-GCC-4.9.2.eb", "content": "# not really (there's an EB_bzip2 easyblock), but fine for use in unit tests\neasyblock = 'ConfigureMake'\n\nname = 'bzip2'\nversion = '1.0.6'\n\nhomepage = 'http://www.bzip.org/'\ndescription = \"\"\"bzip2 is a freely available, patent free, high-quality data compressor. It typically\ncompresses files to within 10% to 15% of the best available techniques (the PPM family of statistical\ncompressors), whilst being around twice as fast at compression and six times faster at decompression.\"\"\"\n\ntoolchain = {'name': 'GCC', 'version': '4.9.2'}\ntoolchainopts = {'pic': True}\n\nsources = [SOURCE_TAR_GZ]\nsource_urls = ['http://www.bzip.org/%(version)s']\n\nbuilddependencies = [('gzip', '1.6')]\n\nmoduleclass = 'tools'\n" }, { "path": "src/test/resources/samples/langs/Edje Data Collection/mild.edc", "content": "// https://raw.githubusercontent.com/billiob/terminology/master/data/themes/mild.edc\n/* overlay to default to make theme easier on the eyes, less effects */\n\n#ifndef BG_COLOR\n#define BG_COLOR 48 48 48 255\n#endif\n\n#ifndef BG_COLOR_TRANSLUCENT\n#define BG_COLOR_TRANSLUCENT 48 48 48 200\n#endif\n\n#ifndef BELL_OVERLAY_COLOR\n#define BELL_OVERLAY_COLOR 220 220 220 16\n#endif\n\n\ncollections {\n group { name: \"terminology/background\";\n\n#ifndef INHERIT_PROVIDE_OWN_COLORS\n color_classes {\n#include \"default_colors.in.edc\"\n }\n#endif\n\n images {\n image: \"bg_bevel.png\" COMP;\n image: \"bg_shine.png\" COMP;\n image: \"bg_glint.png\" COMP;\n image: \"bg_led_base.png\" COMP;\n image: \"bg_led.png\" COMP;\n image: \"bg_led_strobe.png\" COMP;\n image: \"pm_shadow.png\" COMP;\n image: \"pm_overlay.png\" COMP;\n image: \"pm_fill.png\" COMP;\n image: \"tab_bg_l0.png\" COMP;\n image: \"tab_bg_l1.png\" COMP;\n image: \"tab_bg_r0.png\" COMP;\n image: \"tab_bg_r1.png\" COMP;\n image: \"tab_shad_l0.png\" COMP;\n image: \"tab_shad_l1.png\" COMP;\n image: \"tab_shad_r0.png\" COMP;\n image: \"tab_shad_r1.png\" COMP;\n }\n sounds {\n sample { name: \"bell\" LOSSY 64;\n source: \"bell.wav\";\n }\n }\n\n script {\n public message(Msg_Type:type, id, ...) {\n new r, g, b, a, v;\n\n if ((type != MSG_INT) || (id != 1)) return;\n\n v = (getarg(2) * 255) / 100;\n\n custom_state(PART:\"base\", \"default\", 0.0);\n get_state_val(PART:\"base\", STATE_COLOR, r, g, b, a);\n set_state_val(PART:\"base\", STATE_COLOR, r, g, b, v);\n set_state(PART:\"base\", \"custom\", 0.0);\n\n custom_state(PART:\"fade\", \"default\", 0.0);\n get_state_val(PART:\"fade\", STATE_COLOR, r, g, b, a);\n set_state_val(PART:\"fade\", STATE_COLOR, r, g, b, v);\n set_state(PART:\"fade\", \"custom\", 0.0);\n }\n }\n\n parts {\n ////////////////////////////////////////////////////////////////////\n // background handling\n\n part { name: \"focusclip\"; type: RECT;\n clip_to: \"bellclip\";\n description { state: \"default\" 0.0;\n }\n description { state: \"unfocused\" 0.0;\n color: 200 200 200 255;\n }\n }\n program {\n signal: \"focus,in\";\n source: \"terminology\";\n action: STATE_SET \"default\" 0.0;\n transition: ACCELERATE 0.1;\n target: \"focusclip\";\n }\n program {\n signal: \"focused,set\";\n source: \"terminology\";\n action: STATE_SET \"default\" 0.0;\n target: \"focusclip\";\n }\n program {\n signal: \"focus,out\";\n source: \"terminology\";\n action: STATE_SET \"unfocused\" 0.0;\n transition: ACCELERATE 0.1;\n target: \"focusclip\";\n }\n\n part { name: \"baseclip\"; type: RECT;\n clip_to: \"focusclip\";\n description { state: \"default\" 0.0;\n }\n description { state: \"image\" 0.0;\n inherit: \"default\" 0.0;\n color: 255 255 255 0;\n visible: 0;\n }\n description { state: \"scale\" 0.0;\n inherit: \"default\" 0.0;\n color: 255 255 255 0;\n visible: 0;\n }\n description { state: \"edje\" 0.0;\n inherit: \"default\" 0.0;\n color: 255 255 255 0;\n visible: 0;\n }\n description { state: \"movie\" 0.0;\n inherit: \"default\" 0.0;\n color: 255 255 255 0;\n visible: 0;\n }\n }\n part { name: \"base\"; type: RECT;\n mouse_events: 1;\n clip_to: \"baseclip\";\n description { state: \"default\" 0.0;\n color: BG_COLOR;\n }\n }\n part { name: \"fade\"; type: RECT;\n description { state: \"default\" 0.0;\n }\n }\n part { name: \"terminology.background\"; type: SWALLOW;\n clip_to: \"fade\";\n description { state: \"default\" 0.0;\n }\n description { state: \"image\" 0.0;\n inherit: \"default\" 0.0;\n }\n description { state: \"scale\" 0.0;\n inherit: \"default\" 0.0;\n }\n description { state: \"edje\" 0.0;\n inherit: \"default\" 0.0;\n }\n description { state: \"movie\" 0.0;\n inherit: \"default\" 0.0;\n }\n }\n program { name: \"media_off\";\n signal: \"media,off\";\n source: \"terminology\";\n action: STATE_SET \"default\" 0.0;\n target: \"terminology.background\";\n target: \"baseclip\";\n }\n program { name: \"media_img\";\n signal: \"media,image\";\n source: \"terminology\";\n action: STATE_SET \"image\" 0.0;\n target: \"terminology.background\";\n target: \"baseclip\";\n }\n program { name: \"media_scale\";\n signal: \"media,scale\";\n source: \"terminology\";\n action: STATE_SET \"scale\" 0.0;\n target: \"terminology.background\";\n target: \"baseclip\";\n }\n program { name: \"media_edje\";\n signal: \"media,edje\";\n source: \"terminology\";\n action: STATE_SET \"edje\" 0.0;\n target: \"terminology.background\";\n target: \"baseclip\";\n }\n program { name: \"media_mov\";\n signal: \"media,movie\";\n source: \"terminology\";\n action: STATE_SET \"movie\" 0.0;\n target: \"terminology.background\";\n target: \"baseclip\";\n }\n\n part { name: \"bellclip\"; type: RECT;\n description { state: \"default\" 0.0;\n }\n description { state: \"pulse1\" 0.0;\n inherit: \"default\" 0.0;\n color: 200 200 200 255;\n }\n description { state: \"pulse2\" 0.0;\n inherit: \"default\" 0.0;\n }\n }\n part { name: \"belloverlay\"; type: RECT;\n mouse_events: 0;\n description { state: \"default\" 0.0;\n color: 255 255 255 0;\n visible: 0;\n }\n description { state: \"pulse1\" 0.0;\n inherit: \"default\" 0.0;\n }\n description { state: \"pulse2\" 0.0;\n inherit: \"default\" 0.0;\n color: BELL_OVERLAY_COLOR;\n visible: 1;\n }\n }\n program {\n signal: \"bell,ring\"; source: \"terminology\";\n#if (EFL_VERSION_MAJOR > 1) || (EFL_VERSION_MINOR >= 9)\n action: PLAY_SAMPLE \"bell\" 1.0 ALERT;\n#else\n action: PLAY_SAMPLE \"bell\" 1.0;\n#endif\n }\n program {\n signal: \"bell\";\n source: \"terminology\";\n action: STATE_SET \"default\" 0.0;\n target: \"bellclip\";\n target: \"belloverlay\";\n after: \"bellclip_bell.2\";\n }\n program {\n name: \"bellclip_bell.2\";\n action: STATE_SET \"pulse1\" 0.0;\n transition: ACCELERATE 0.2;\n target: \"bellclip\";\n target: \"belloverlay\";\n after: \"bellclip_bell.3\";\n }\n program {\n name: \"bellclip_bell.3\";\n action: STATE_SET \"pulse2\" 0.0;\n transition: ACCELERATE 0.2;\n target: \"bellclip\";\n target: \"belloverlay\";\n after: \"bellclip_bell.4\";\n }\n program {\n name: \"bellclip_bell.4\";\n action: STATE_SET \"default\" 0.0;\n transition: ACCELERATE 0.2;\n target: \"bellclip\";\n target: \"belloverlay\";\n }\n\n ////////////////////////////////////////////////////////////////////\n // actual text grid for chars, cursors, selectiond etc. goes here\n part { name: \"terminology.content\"; type: SWALLOW;\n description { state: \"default\" 0.0;\n }\n }\n\n ////////////////////////////////////////////////////////////////////\n // indicator of other tabs and control\n part { name: \"tabcount_clip\"; type: RECT;\n description { state: \"default\" 0.0;\n color: 255 255 255 0;\n visible: 0;\n }\n description { state: \"on\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n color: 255 255 255 255;\n }\n }\n part { name: \"terminology.tabmissed.label\"; type: TEXT; mouse_events: 0;\n effect: GLOW;\n scale: 1;\n clip_to: \"tabcount_clip\";\n description { state: \"default\" 0.0;\n fixed: 1 1;\n rel1.to: \"terminology.tabcount.label\";\n rel2.to: \"terminology.tabcount.label\";\n rel1.offset: -4 0;\n rel2.relative: 0.0 1.0;\n rel2.offset: -5 -1;\n color: 255 153 51 64;\n align: 1.0 0.5;\n text { font: \"Sans\"; size: 8;\n align: 1.0 0.5;\n min: 1 1;\n ellipsis: 0;\n }\n }\n description { state: \"over\" 0.0;\n inherit: \"default\" 0.0;\n color: 255 255 64 255;\n }\n }\n part { name: \"terminology.tabcount.label\"; type: TEXT; mouse_events: 0;\n scale: 1;\n clip_to: \"tabcount_clip\";\n description { state: \"default\" 0.0;\n fixed: 1 1;\n rel1.to: \"terminology.tabcount.control\";\n rel2.to: \"terminology.tabcount.control\";\n rel1.relative: -0.2 0.0;\n rel2.relative: -0.2 1.0;\n color: 255 255 255 64;\n align: 1.0 0.5;\n text { font: \"Sans\"; size: 8;\n align: 1.0 0.5;\n min: 1 1;\n ellipsis: 0;\n }\n }\n description { state: \"over\" 0.0;\n inherit: \"default\" 0.0;\n color: 255 255 255 255;\n }\n }\n part { name: \"tabcount_r0\"; type: RECT;\n clip_to: \"tabcount_clip\";\n description { state: \"default\" 0.0;\n rel1.to: \"terminology.tabcount.control\";\n rel2.to: \"terminology.tabcount.control\";\n rel1.relative: 0.05 0.05;\n rel2.relative: 0.45 0.45;\n color: 255 255 255 32;\n }\n description { state: \"over\" 0.0;\n inherit: \"default\" 0.0;\n color: 255 255 255 255;\n }\n }\n part { name: \"tabcount_r1\"; type: RECT;\n clip_to: \"tabcount_clip\";\n description { state: \"default\" 0.0;\n rel1.to: \"terminology.tabcount.control\";\n rel2.to: \"terminology.tabcount.control\";\n rel1.relative: 0.55 0.05;\n rel2.relative: 0.95 0.45;\n color: 255 255 255 32;\n }\n description { state: \"over\" 0.0;\n inherit: \"default\" 0.0;\n color: 255 255 255 255;\n }\n }\n part { name: \"tabcount_r2\"; type: RECT;\n clip_to: \"tabcount_clip\";\n description { state: \"default\" 0.0;\n rel1.to: \"terminology.tabcount.control\";\n rel2.to: \"terminology.tabcount.control\";\n rel1.relative: 0.05 0.55;\n rel2.relative: 0.45 0.95;\n color: 255 255 255 32;\n }\n description { state: \"over\" 0.0;\n inherit: \"default\" 0.0;\n color: 255 255 255 255;\n }\n }\n part { name: \"tabcount_r3\"; type: RECT;\n clip_to: \"tabcount_clip\";\n description { state: \"default\" 0.0;\n rel1.to: \"terminology.tabcount.control\";\n rel2.to: \"terminology.tabcount.control\";\n rel1.relative: 0.55 0.55;\n rel2.relative: 0.95 0.95;\n color: 255 255 255 32;\n }\n description { state: \"over\" 0.0;\n inherit: \"default\" 0.0;\n color: 255 255 255 255;\n }\n }\n part { name: \"terminology.tabcount.control\"; type: SWALLOW;\n clip_to: \"tabcount_clip\";\n description { state: \"default\" 0.0;\n fixed: 1 1;\n rel1.relative: 1.0 0.0;\n rel1.offset: -3 2;\n rel1.to: \"viewregion\";\n rel2.relative: 1.0 0.0;\n rel2.offset: -3 2;\n rel2.to: \"viewregion\";\n align: 1.0 0.0;\n min: 16 16;\n }\n }\n part { name: \"tabcount_ev\"; type: RECT; repeat_events: 1;\n clip_to: \"tabcount_clip\";\n description { state: \"default\" 0.0;\n fixed: 1 1;\n rel1.to: \"terminology.tabcount.control\";\n rel2.to: \"terminology.tabcount.control\";\n color: 0 0 0 0;\n }\n }\n\n part { name: \"terminology.tabregion\"; type: SWALLOW;\n description { state: \"default\" 0.0;\n fixed: 1 1;\n rel1.to: \"terminology.content\";\n rel2.to: \"viewregion\";\n rel2.relative: 1.0 0.0;\n }\n }\n part { name: \"viewregion\"; type: SWALLOW;\n description { state: \"default\" 0.0;\n fixed: 1 1;\n rel1.to: \"terminology.content\";\n rel2.to: \"terminology.content\";\n }\n description { state: \"tab\" 0.0;\n inherit: \"default\" 0.0;\n rel1.to_y: \"tabmiddle\";\n rel1.relative: 0.0 1.0;\n }\n }\n\n program {\n signal: \"mouse,in\"; source: \"tabcount_ev\";\n action: STATE_SET \"over\" 0.0;\n transition: DECELERATE 0.5;\n target: \"tabcount_r0\";\n target: \"tabcount_r1\";\n target: \"tabcount_r2\";\n target: \"tabcount_r3\";\n target: \"terminology.tabcount.label\";\n target: \"terminology.tabmissed.label\";\n }\n program {\n signal: \"mouse,out\"; source: \"tabcount_ev\";\n action: STATE_SET \"default\" 0.0;\n transition: DECELERATE 2.0;\n target: \"tabcount_r0\";\n target: \"tabcount_r1\";\n target: \"tabcount_r2\";\n target: \"tabcount_r3\";\n target: \"terminology.tabcount.label\";\n target: \"terminology.tabmissed.label\";\n }\n program {\n signal: \"mouse,clicked,1\"; source: \"tabcount_ev\";\n action: SIGNAL_EMIT \"tabcount,go\" \"terminology\";\n }\n program {\n signal: \"tabcount,off\"; source: \"terminology\";\n action: STATE_SET \"default\" 0.0;\n transition: DECELERATE 0.5;\n target: \"tabcount_clip\";\n }\n program {\n signal: \"tabcount,on\"; source: \"terminology\";\n action: STATE_SET \"on\" 0.0;\n transition: DECELERATE 0.5;\n target: \"tabcount_clip\";\n }\n program {\n signal: \"tabmissed,off\"; source: \"terminology\";\n action: STATE_SET \"default\" 0.0;\n transition: DECELERATE 0.5;\n target: \"terminology.tabmissed.label\";\n }\n program {\n signal: \"tabmissed,on\"; source: \"terminology\";\n action: STATE_SET \"over\" 0.0;\n transition: DECELERATE 0.2;\n target: \"terminology.tabmissed.label\";\n after: \"tabmissed2\";\n }\n program { name: \"tabmissed2\";\n signal: \"tabmissed,on\"; source: \"terminology\";\n action: STATE_SET \"default\" 0.0;\n transition: DECELERATE 3.0;\n target: \"terminology.tabmissed.label\";\n }\n\n ////////////////////////////////////////////////////////////////////\n // miniview\n part { name: \"terminology.miniview\"; type: SWALLOW;\n description { state: \"default\" 0.0;\n rel1.to_x: \"terminology.content\";\n rel1.to_y: \"viewregion\";\n rel2.to: \"terminology.content\";\n //color: 255 255 255 0;\n visible: 0;\n fixed: 1 1;\n }\n description { state: \"on\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n //color: 255 255 255 255;\n }\n }\n\n program {\n signal: \"miniview,off\"; source: \"terminology\";\n action: STATE_SET \"default\" 0.0;\n target: \"terminology.miniview\";\n }\n program {\n signal: \"miniview,on\"; source: \"terminology\";\n action: STATE_SET \"on\" 0.0;\n target: \"terminology.miniview\";\n }\n\n part { name: \"tab_bevel_bg0\";\n mouse_events: 0;\n description { state: \"default\" 0.0;\n rel1.to: \"tableft\";\n rel2.to_y: \"tableft\";\n rel2.to_x: \"tab_bevel_bg1\";\n rel2.relative: 0.0 1.0;\n image.normal: \"tab_bg_l0.png\";\n image.border: 2 0 4 4;\n fill.smooth: 0;\n visible: 0;\n fixed: 1 1;\n }\n description { state: \"tab\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n }\n }\n part { name: \"tab_bevel_bg1\";\n mouse_events: 0;\n description { state: \"default\" 0.0;\n rel1.to: \"tabmiddle\";\n rel1.offset: -4 0;\n rel2.to: \"tabmiddle\";\n align: 0.0 0.0;\n max: 12 99999;\n min: 12 0;\n image.normal: \"tab_bg_l1.png\";\n image.border: 0 0 4 4;\n fill.smooth: 0;\n visible: 0;\n fixed: 1 1;\n }\n description { state: \"tab\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n }\n }\n part { name: \"tab_bevel_bg2\"; type: SPACER;\n description { state: \"default\" 0.0;\n rel1.to: \"tab_bevel_bg1\";\n rel1.relative: 1.0 0.0;\n rel2.to: \"tab_bevel_bg3\";\n rel2.relative: 0.0 1.0;\n fixed: 1 1;\n }\n }\n part { name: \"tab_bevel_bg3\";\n mouse_events: 0;\n description { state: \"default\" 0.0;\n rel1.to: \"tabmiddle\";\n rel2.to: \"tabmiddle\";\n rel2.offset: 3 -1;\n align: 1.0 0.0;\n max: 12 99999;\n min: 12 0;\n image.normal: \"tab_bg_r1.png\";\n image.border: 0 0 4 4;\n fill.smooth: 0;\n visible: 0;\n fixed: 1 1;\n }\n description { state: \"tab\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n }\n }\n part { name: \"tab_bevel_bg4\";\n mouse_events: 0;\n description { state: \"default\" 0.0;\n rel1.to_y: \"tabright\";\n rel1.to_x: \"tab_bevel_bg3\";\n rel1.relative: 1.0 0.0;\n rel2.to: \"tabright\";\n image.normal: \"tab_bg_r0.png\";\n image.border: 0 2 4 4;\n fill.smooth: 0;\n visible: 0;\n fixed: 1 1;\n }\n description { state: \"tab\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n }\n }\n\n part { name: \"terminology.tabl.content\"; type: SWALLOW;\n description { state: \"default\" 0.0;\n rel1.to: \"tableft\";\n rel2.to: \"tableft\";\n fixed: 1 1;\n }\n }\n part { name: \"terminology.tabr.content\"; type: SWALLOW;\n description { state: \"default\" 0.0;\n rel1.to: \"tabright\";\n rel2.to: \"tabright\";\n fixed: 1 1;\n }\n }\n\n ////////////////////////////////////////////////////////////////////\n // a swallow to hold a finger size rect for min tab size\n program {\n signal: \"tabbar,on\"; source: \"terminology\";\n action: STATE_SET \"tab\" 0.0;\n target: \"viewregion\";\n target: \"tableft\";\n target: \"tabmiddle\";\n target: \"tabright\";\n target: \"tab_bevel_bg0\";\n target: \"tab_bevel_bg1\";\n target: \"tab_bevel_bg3\";\n target: \"tab_bevel_bg4\";\n target: \"tabtitle\";\n }\n program {\n signal: \"tabbar,off\"; source: \"terminology\";\n action: STATE_SET \"default\" 0.0;\n target: \"viewregion\";\n target: \"tableft\";\n target: \"tabmiddle\";\n target: \"tabright\";\n target: \"tab_bevel_bg0\";\n target: \"tab_bevel_bg1\";\n target: \"tab_bevel_bg3\";\n target: \"tab_bevel_bg4\";\n target: \"tabtitle\";\n }\n\n part { name: \"terminology.tab\"; type: SWALLOW;\n mouse_events: 0;\n description { state: \"default\" 0.0;\n rel1.relative: 1.0 0.0;\n rel1.to_x: \"terminology.tabl\";\n rel2.relative: 0.0 0.0;\n rel2.to_x: \"terminology.tabr\";\n align: 0.5 0.0;\n visible: 0;\n fixed: 1 1;\n }\n }\n // some slot for dragable parts to stayt in along top edge of bg\n part { name: \"tabdrag\"; type: SPACER;\n description { state: \"default\" 0.0;\n rel2.relative: 1.0 0.0;\n fixed: 1 1;\n }\n }\n // left boundary of the active tab (ragable 0.0 -> 1.0)\n part { name: \"terminology.tabl\"; type: SPACER;\n dragable.x: 1 1 0;\n dragable.confine: \"tabdrag\";\n description { state: \"default\" 0.0;\n rel2.relative: 1.0 0.0;\n max: 1 1;\n fixed: 1 1;\n }\n }\n // right boundary of the active tab (ragable 0.0 -> 1.0)\n part { name: \"terminology.tabr\"; type: SPACER;\n dragable.x: 1 1 0;\n dragable.confine: \"tabdrag\";\n description { state: \"default\" 0.0;\n rel2.relative: 1.0 0.0;\n max: 1 1;\n fixed: 1 1;\n }\n }\n\n part { name: \"terminology.tab.title\"; type: TEXT; mouse_events: 0;\n scale: 1;\n effect: SOFT_SHADOW BOTTOM;\n mouse_events: 0;\n description { state: \"default\" 0.0;\n color: 255 255 255 255;\n color3: 0 0 0 18;\n text { font: \"Sans:style=Bold\"; size: 10;\n align: 0.5 0.0;\n min: 0 1;\n }\n align: 0.5 0.0;\n rel1.to_x: \"tab_bevel_bg2\";\n rel1.offset: 0 2;\n rel2.to_x: \"tab_bevel_bg2\";\n rel2.offset: -1 2;\n rel2.relative: 1.0 0.0;\n visible: 0;\n fixed: 1 1;\n }\n }\n part { name: \"tabtitle\"; type: TEXT; mouse_events: 0;\n scale: 1;\n mouse_events: 0;\n description { state: \"default\" 0.0;\n color: 255 255 255 255;\n text { font: \"Sans:style=Bold\"; size: 10;\n align: 0.5 0.5;\n min: 0 1;\n text_source: \"terminology.tab.title\";\n }\n align: 0.5 0.5;\n rel1.to_x: \"tab_bevel_bg2\";\n rel1.to_y: \"tabmiddle\";\n rel2.to_x: \"tab_bevel_bg2\";\n rel2.to_y: \"tabmiddle\";\n visible: 0;\n fixed: 1 1;\n }\n description { state: \"tab\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n }\n }\n part { name: \"tablimit0\"; type: SPACER;\n description { state: \"default\" 0.0;\n rel1.to_y: \"terminology.tab\";\n rel1.relative: 0.0 1.0;\n rel2.to_y: \"terminology.tab.title\";\n align: 0.0 0.0;\n fixed: 1 1;\n }\n }\n\n part { name: \"tableft\"; type: RECT;\n mouse_events: 0;\n description { state: \"default\" 0.0;\n rel2.to_x: \"terminology.tab\";\n rel2.to_y: \"tabmiddle\";\n rel2.relative: 0.0 1.0;\n color: 0 0 0 0;\n visible: 0;\n fixed: 1 1;\n }\n description { state: \"tab\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n }\n }\n part { name: \"tabright\"; type: RECT;\n mouse_events: 0;\n description { state: \"default\" 0.0;\n rel1.to: \"terminology.tab\";\n rel1.relative: 1.0 0.0;\n rel2.to_y: \"tabmiddle\";\n color: 0 0 0 0;\n visible: 0;\n fixed: 1 1;\n }\n description { state: \"tab\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n }\n }\n part { name: \"tabmiddle\"; type: RECT;\n description { state: \"default\" 0.0;\n rel1.to: \"terminology.tab\";\n rel2.to_x: \"terminology.tab\";\n rel2.to_y: \"tablimit0\";\n rel2.offset: -1 0;\n color: 0 0 0 0;\n align: 0.0 0.0;\n visible: 0;\n fixed: 1 1;\n }\n description { state: \"tab\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n }\n }\n\n ////////////////////////////////////////////////////////////////////\n // a place terminology will place an entry box for internal commands\n part { name: \"cmdclip\"; type: RECT;\n description { state: \"default\" 0.0;\n color: 255 255 255 255;\n rel1.to: \"terminology.cmdbox\";\n rel1.offset: -100 -100;\n rel2.to: \"terminology.cmdbox\";\n rel2.offset: 99 99;\n color: 255 255 255 0;\n visible: 0;\n }\n description { state: \"visible\" 0.0;\n inherit: \"default\" 0.0;\n color: 255 255 255 255;\n visible: 1;\n }\n }\n part { name: \"cmdback\"; type: RECT;\n clip_to: \"cmdclip\";\n description { state: \"default\" 0.0;\n color: 255 255 255 255;\n rel1.to: \"terminology.cmdbox\";\n rel1.offset: -2 -2;\n rel2.to: \"terminology.cmdbox\";\n rel2.offset: 1 1;\n }\n }\n part { name: \"terminology.cmdbox\"; type: SWALLOW;\n clip_to: \"cmdclip\";\n description { state: \"default\" 0.0;\n fixed: 1 1;\n min: 8 8;\n rel1.relative: 0.0 1.0;\n rel1.offset: 8 9;\n rel2.offset: -9 9;\n align: 0.5 0.0;\n }\n description { state: \"visible\" 0.0;\n inherit: \"default\" 0.0;\n rel1.offset: 8 -9;\n rel2.offset: -9 -9;\n align: 0.5 1.0;\n }\n }\n program { name: \"cmdshow0\";\n signal: \"cmdbox,show\";\n source: \"terminology\";\n action: STATE_SET \"visible\" 0.0;\n transition: DECELERATE 0.4;\n target: \"cmdclip\";\n }\n program { name: \"cmdshow\";\n signal: \"cmdbox,show\";\n source: \"terminology\";\n action: STATE_SET \"visible\" 0.0;\n transition: SPRING 0.4 0.5 4;\n target: \"terminology.cmdbox\";\n }\n program { name: \"cmdhide\";\n signal: \"cmdbox,hide\";\n source: \"terminology\";\n action: STATE_SET \"default\" 0.0;\n transition: ACCELERATE 0.5;\n target: \"terminology.cmdbox\";\n target: \"cmdclip\";\n }\n\n ////////////////////////////////////////////////////////////////////\n // visual bell - spinning red siren light\n part { name: \"bell_base\";\n mouse_events: 0;\n description { state: \"default\" 0.0;\n fixed: 1 1;\n visible: 0;\n color: 255 255 255 0;\n min: 32 32;\n max: 32 32;\n rel2.offset: -1 -1;\n align: 1.0 1.0;\n image.normal: \"bg_led_base.png\";\n }\n description { state: \"visible\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n color: 255 255 255 255;\n }\n }\n part { name: \"bell\";\n mouse_events: 0;\n description { state: \"default\" 0.0;\n fixed: 1 1;\n visible: 0;\n color: 255 255 255 0;\n rel1.to: \"bell_base\";\n rel2.to: \"bell_base\";\n image.normal: \"bg_led.png\";\n }\n description { state: \"visible\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n color: 255 255 255 255;\n }\n }\n part { name: \"bell_strobe\";\n mouse_events: 0;\n description { state: \"default\" 0.0;\n fixed: 1 1;\n visible: 0;\n color: 255 255 255 0;\n rel1.to: \"bell\";\n rel2.to: \"bell\";\n image.normal: \"bg_led_strobe.png\";\n map {\n on: 1;\n smooth: 1;\n rotation.center: \"bell\";\n }\n }\n description { state: \"spin\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n color: 255 255 255 255;\n map.rotation.z: 36.0;\n }\n description { state: \"spin_done\" 0.0;\n inherit: \"default\" 0.0;\n visible: 0;\n color: 255 255 255 0;\n map.rotation.z: 684.0;\n }\n }\n program { name: \"bell0\";\n signal: \"bell\";\n source: \"terminology\";\n action: STATE_SET \"default\" 0.0;\n target: \"bell_base\";\n target: \"bell\";\n target: \"bell_strobe\";\n after: \"bell\";\n }\n program { name: \"bell\";\n action: STATE_SET \"visible\" 0.0;\n target: \"bell_base\";\n after: \"bell2\";\n }\n program { name: \"bell2\";\n action: STATE_SET \"visible\" 0.0;\n transition: DECELERATE 0.1;\n target: \"bell\";\n after: \"bell3\";\n }\n program { name: \"bell3\";\n action: STATE_SET \"spin\" 0.0;\n transition: LINEAR 0.1;\n target: \"bell_strobe\";\n after: \"bell4.0\";\n after: \"bell4.1\";\n after: \"bell4.2\";\n }\n program { name: \"bell4.0\";\n action: STATE_SET \"default\" 0.0;\n transition: ACCELERATE 1.2;\n target: \"bell\";\n }\n program { name: \"bell4.1\";\n action: STATE_SET \"default\" 0.0;\n transition: ACCELERATE 1.6;\n target: \"bell_base\";\n }\n program { name: \"bell4.2\";\n action: STATE_SET \"spin_done\" 0.0;\n transition: LINEAR 0.9;\n target: \"bell_strobe\";\n }\n\n ////////////////////////////////////////////////////////////////////\n // popup media over the terminal (until dismissed)\n part { name: \"popmedia_clip\"; type: RECT;\n mouse_events: 1;\n description { state: \"default\" 0.0;\n fixed: 1 1;\n visible: 0;\n color: 255 255 255 0;\n }\n description { state: \"visible\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n color: 255 255 255 255;\n }\n }\n part { name: \"popmedia_shadow\";\n mouse_events: 0;\n description { state: \"default\" 0.0;\n fixed: 1 1;\n rel1 {\n to: \"terminology.popmedia\";\n }\n rel2 {\n to: \"terminology.popmedia\";\n }\n image.normal: \"pm_shadow.png\";\n image.border: 64 64 64 64;\n image.border_scale_by: 0.1;\n fill.smooth: 0;\n visible: 0;\n }\n description { state: \"visible\" 0.0;\n inherit: \"default\" 0.0;\n rel1.offset: -32 -32;\n rel2.offset: 31 31;\n image.border_scale_by: 1.0;\n visible: 1;\n }\n }\n part { name: \"popmedia_fill\";\n mouse_events: 0;\n description { state: \"default\" 0.0;\n fixed: 1 1;\n rel1.to: \"terminology.popmedia\";\n rel2.to: \"terminology.popmedia\";\n image.normal: \"pm_fill.png\";\n fill {\n size.relative: 0.0 0.0;\n size.offset: 64 64;\n }\n }\n }\n part { name: \"terminology.popmedia\"; type: SWALLOW;\n clip_to: \"popmedia_clip\";\n description { state: \"default\" 0.0;\n fixed: 1 1;\n rel1.relative: 0.5 0.5;\n rel2.relative: 0.5 0.5;\n visible: 0;\n }\n description { state: \"image\" 0.0;\n inherit: \"default\" 0.0;\n rel1.relative: 0.1 0.1;\n rel2.relative: 0.9 0.9;\n visible: 1;\n }\n description { state: \"scale\" 0.0;\n inherit: \"default\" 0.0;\n rel1.relative: 0.1 0.1;\n rel2.relative: 0.9 0.9;\n visible: 1;\n }\n description { state: \"edje\" 0.0;\n inherit: \"default\" 0.0;\n rel1.relative: 0.1 0.1;\n rel2.relative: 0.9 0.9;\n visible: 1;\n }\n description { state: \"movie\" 0.0;\n inherit: \"default\" 0.0;\n rel1.relative: 0.1 0.1;\n rel2.relative: 0.9 0.9;\n visible: 1;\n }\n }\n part { name: \"popmedia_overlay\";\n mouse_events: 0;\n description { state: \"default\" 0.0;\n fixed: 1 1;\n rel1.to: \"terminology.popmedia\";\n rel2.to: \"terminology.popmedia\";\n image.normal: \"pm_overlay.png\";\n fill.smooth: 0;\n visible: 0;\n }\n description { state: \"visible\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n }\n }\n part { name: \"popmedia_bevel\";\n mouse_events: 0;\n description { state: \"default\" 0.0;\n fixed: 1 1;\n rel1.to: \"terminology.popmedia\";\n rel2.to: \"terminology.popmedia\";\n image.normal: \"bg_bevel.png\";\n image.border: 3 3 5 3;\n image.middle: 0;\n fill.smooth: 0;\n visible: 0;\n }\n description { state: \"visible\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n }\n }\n part { name: \"popmedia_glintclip\"; type: RECT;\n mouse_events: 0;\n description { state: \"default\" 0.0;\n fixed: 1 1;\n visible: 0;\n }\n description { state: \"visible\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n }\n }\n part { name: \"popmedia_glint\";\n mouse_events: 0;\n clip_to: \"popmedia_glintclip\";\n description { state: \"default\" 0.0;\n fixed: 1 1;\n min: 79 5;\n max: 79 5;\n rel1 {\n to: \"terminology.popmedia\";\n relative: 0.0 0.0;\n offset: 0 0;\n }\n rel2 {\n to: \"terminology.popmedia\";\n relative: 1.0 0.0;\n offset: -1 0;\n }\n image.normal: \"bg_glint.png\";\n visible: 0;\n }\n description { state: \"visible\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n }\n }\n part { name: \"popmedia_shine\";\n mouse_events: 0;\n description { state: \"default\" 0.0;\n fixed: 1 1;\n rel1.to: \"terminology.popmedia\";\n rel2.to: \"terminology.popmedia\";\n image.normal: \"bg_shine.png\";\n fill.smooth: 0;\n align: 0.5 0.0;\n aspect: (255/120) (255/120);\n aspect_preference: HORIZONTAL;\n visible: 0;\n }\n description { state: \"visible\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n }\n }\n part { name: \"popmedia_dismiss\"; type: RECT;\n mouse_events: 1;\n description { state: \"default\" 0.0;\n fixed: 1 1;\n color: 0 0 0 0;\n visible: 0;\n }\n description { state: \"visible\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n }\n }\n program { name: \"popmedia_dismiss\";\n signal: \"mouse,clicked,*\";\n source: \"popmedia_dismiss\";\n action: STATE_SET \"default\" 0.0;\n transition: DECELERATE 0.5;\n target: \"terminology.popmedia\";\n target: \"popmedia_clip\";\n target: \"popmedia_dismiss\";\n target: \"popmedia_shadow\";\n target: \"popmedia_fill\";\n target: \"popmedia_overlay\";\n target: \"popmedia_bevel\";\n target: \"popmedia_glint\";\n target: \"popmedia_glintclip\";\n target: \"popmedia_shine\";\n after: \"popmedia_dismiss2\";\n }\n program { name: \"popmedia_dismiss2\";\n action: SIGNAL_EMIT \"popmedia,done\" \"terminology\";\n }\n program { name: \"popmedia_off\";\n signal: \"popmedia,off\";\n source: \"terminology\";\n action: STATE_SET \"default\" 0.0;\n transition: DECELERATE 0.2;\n target: \"terminology.popmedia\";\n target: \"popmedia_clip\";\n target: \"popmedia_dismiss\";\n target: \"popmedia_shadow\";\n target: \"popmedia_fill\";\n target: \"popmedia_overlay\";\n target: \"popmedia_bevel\";\n target: \"popmedia_glint\";\n target: \"popmedia_glintclip\";\n target: \"popmedia_shine\";\n after: \"popmedia_dismiss2\";\n }\n program { name: \"popmedia_img\";\n signal: \"popmedia,image\";\n source: \"terminology\";\n action: STATE_SET \"image\" 0.0;\n transition: DECELERATE 0.2;\n target: \"terminology.popmedia\";\n }\n program { name: \"popmedia_scale\";\n signal: \"popmedia,scale\";\n source: \"terminology\";\n action: STATE_SET \"scale\" 0.0;\n transition: DECELERATE 0.2;\n target: \"terminology.popmedia\";\n }\n program { name: \"popmedia_edje\";\n signal: \"popmedia,edje\";\n source: \"terminology\";\n action: STATE_SET \"edje\" 0.0;\n transition: DECELERATE 0.2;\n target: \"terminology.popmedia\";\n }\n program { name: \"popmedia_mov\";\n signal: \"popmedia,movie\";\n source: \"terminology\";\n action: STATE_SET \"movie\" 0.0;\n transition: DECELERATE 0.2;\n target: \"terminology.popmedia\";\n }\n program { name: \"popmedia_img2\";\n signal: \"popmedia,image\";\n source: \"terminology\";\n action: STATE_SET \"visible\" 0.0;\n transition: DECELERATE 0.2;\n target: \"popmedia_clip\";\n target: \"popmedia_dismiss\";\n target: \"popmedia_shadow\";\n target: \"popmedia_fill\";\n target: \"popmedia_overlay\";\n target: \"popmedia_bevel\";\n target: \"popmedia_glint\";\n target: \"popmedia_glintclip\";\n target: \"popmedia_shine\";\n }\n program { name: \"popmedia_scale2\";\n signal: \"popmedia,scale\";\n source: \"terminology\";\n action: STATE_SET \"visible\" 0.0;\n transition: DECELERATE 0.2;\n target: \"popmedia_clip\";\n target: \"popmedia_dismiss\";\n target: \"popmedia_shadow\";\n target: \"popmedia_fill\";\n target: \"popmedia_overlay\";\n target: \"popmedia_bevel\";\n target: \"popmedia_glint\";\n target: \"popmedia_glintclip\";\n target: \"popmedia_shine\";\n }\n program { name: \"popmedia_edje2\";\n signal: \"popmedia,edje\";\n source: \"terminology\";\n action: STATE_SET \"visible\" 0.0;\n transition: DECELERATE 0.2;\n target: \"popmedia_clip\";\n target: \"popmedia_dismiss\";\n target: \"popmedia_shadow\";\n target: \"popmedia_fill\";\n target: \"popmedia_overlay\";\n target: \"popmedia_bevel\";\n target: \"popmedia_glint\";\n target: \"popmedia_glintclip\";\n target: \"popmedia_shine\";\n }\n program { name: \"popmedia_mov2\";\n signal: \"popmedia,movie\";\n source: \"terminology\";\n action: STATE_SET \"visible\" 0.0;\n transition: DECELERATE 0.2;\n target: \"popmedia_clip\";\n target: \"popmedia_dismiss\";\n target: \"popmedia_shadow\";\n target: \"popmedia_fill\";\n target: \"popmedia_overlay\";\n target: \"popmedia_bevel\";\n target: \"popmedia_glint\";\n target: \"popmedia_glintclip\";\n target: \"popmedia_shine\";\n }\n\n ////////////////////////////////////////////////////////////////////\n // overlayed options and controls\n part { name: \"terminology.about\"; type: SWALLOW;\n scale: 1;\n description { state: \"default\" 0.0;\n fixed: 1 1;\n min: 198 198;\n max: 198 198;\n align: 0.5 0.0;\n visible: 0;\n rel1.relative: 0.0 1.0;\n rel2.relative: 1.0 1.0;\n }\n description { state: \"visible\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n align: 0.5 0.5;\n rel1.relative: 0.0 0.0;\n rel2.relative: 1.0 1.0;\n }\n }\n program { name: \"ab_show\";\n signal: \"about,show\";\n source: \"terminology\";\n action: STATE_SET \"visible\" 0.0;\n transition: SPRING 1.2 2.0 6;\n target: \"terminology.about\";\n }\n program { name: \"ab_hide\";\n signal: \"about,hide\";\n source: \"terminology\";\n action: STATE_SET \"default\" 0.0;\n transition: DECELERATE 0.6;\n target: \"terminology.about\";\n }\n\n ////////////////////////////////////////////////////////////////////\n // swallow to hold invisile rect to click on to dismiss things\n part { name: \"terminology.dismiss\"; type: SWALLOW;\n description { state: \"default\" 0.0;\n }\n }\n\n ////////////////////////////////////////////////////////////////////\n // overlayed options and controls\n part { name: \"terminology.optdetails\"; type: SWALLOW;\n scale: 1;\n description { state: \"default\" 0.0;\n fixed: 1 1;\n min: 40 40;\n align: 0.0 0.5;\n visible: 0;\n rel1 {\n relative: 1.0 0.02;\n offset: 2 2;\n }\n rel2 {\n relative: 1.0 0.98;\n offset: 2 -3;\n }\n }\n description { state: \"visible\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n align: 1.0 0.5;\n rel1 {\n relative: 0.1 0.02;\n offset: 2 2;\n }\n rel2 {\n to_x: \"terminology.options\";\n relative: 0.0 0.98;\n offset: -3 -3;\n }\n }\n }\n program { name: \"opdt_show\";\n signal: \"optdetails,show\";\n source: \"terminology\";\n action: STATE_SET \"visible\" 0.0;\n transition: DECELERATE 0.4;\n target: \"terminology.optdetails\";\n }\n program { name: \"opdt_hide\";\n signal: \"optdetails,hide\";\n source: \"terminology\";\n action: STATE_SET \"default\" 0.0;\n transition: DECELERATE 0.2;\n target: \"terminology.optdetails\";\n after: \"opdt_hide2\";\n }\n program { name: \"opdt_hide2\";\n action: SIGNAL_EMIT \"optdetails,hide,done\" \"terminology\";\n }\n \n part { name: \"terminology.options\"; type: SWALLOW;\n scale: 1;\n description { state: \"default\" 0.0;\n fixed: 1 1;\n align: 0.0 0.5;\n visible: 0;\n rel1.relative: 1.0 0.02;\n rel2 {\n relative: 1.0 0.98;\n offset: -3 -3;\n }\n }\n description { state: \"visible\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n align: 1.0 0.5;\n rel1 {\n offset: -3 2;\n }\n rel2 {\n offset: -3 -3;\n }\n }\n }\n program { name: \"op_show\";\n signal: \"options,show\";\n source: \"terminology\";\n action: STATE_SET \"visible\" 0.0;\n transition: DECELERATE 0.4;\n target: \"terminology.options\";\n }\n program { name: \"op_hide\";\n signal: \"options,hide\";\n source: \"terminology\";\n action: STATE_SET \"default\" 0.0;\n transition: DECELERATE 0.6;\n target: \"terminology.options\";\n }\n \n part { name: \"terminology.controls\"; type: SWALLOW;\n scale: 1;\n description { state: \"default\" 0.0;\n fixed: 1 1;\n min: 100 100;\n align: 0.0 1.0;\n visible: 0;\n rel1.relative: 1.0 1.0;\n rel2.relative: 1.0 1.0;\n }\n description { state: \"visible\" 0.0;\n inherit: \"default\" 0.0;\n align: 1.0 1.0;\n rel1.offset: -3 -3;\n rel2.offset: -3 -3;\n visible: 1;\n }\n }\n program { name: \"ct_show\";\n signal: \"controls,show\";\n source: \"terminology\";\n action: STATE_SET \"visible\" 0.0;\n transition: DECELERATE 0.3;\n target: \"terminology.controls\";\n }\n program { name: \"ct_hide\";\n signal: \"controls,hide\";\n source: \"terminology\";\n action: STATE_SET \"default\" 0.0;\n transition: DECELERATE 0.5;\n target: \"terminology.controls\";\n }\n }\n }\n\n group { name: \"terminology/tabbar_back\";\n images {\n image: \"tab_other_l.png\" COMP;\n image: \"tab_other_m.png\" COMP;\n image: \"tab_other_r.png\" COMP;\n image: \"tab_shad_l2.png\" COMP;\n image: \"tab_shad_r2.png\" COMP;\n }\n parts {\n part { name: \"tab_bevel_shad1\";\n mouse_events: 0;\n clip_to: \"clip\";\n description { state: \"default\" 0.0;\n rel1.to: \"tab_base_top1\";\n rel2.to: \"tab_base_top1\";\n image.normal: \"tab_shad_l2.png\";\n image.border: 0 0 10 10;\n fill.smooth: 0;\n }\n }\n part { name: \"tab_bevel_shad3\";\n mouse_events: 0;\n clip_to: \"clip\";\n description { state: \"default\" 0.0;\n rel1.to: \"tab_base_top3\";\n rel2.to: \"tab_base_top3\";\n image.normal: \"tab_shad_r2.png\";\n image.border: 0 0 10 10;\n fill.smooth: 0;\n }\n }\n part { name: \"tab_base_top1\";\n mouse_events: 0;\n clip_to: \"clip\";\n description { state: \"default\" 0.0;\n align: 0.0 0.0;\n rel1.offset: -4 0;\n max: 12 99999;\n min: 12 0;\n image.normal: \"tab_other_l.png\";\n image.border: 0 0 4 4;\n fill.smooth: 0;\n }\n }\n part { name: \"tab_base_top2\";\n mouse_events: 0;\n clip_to: \"clip\";\n description { state: \"default\" 0.0;\n rel1.to: \"tab_base_top1\";\n rel1.relative: 1.0 0.0;\n rel2.to: \"tab_base_top3\";\n rel2.relative: 0.0 1.0;\n image.normal: \"tab_other_m.png\";\n image.border: 0 0 4 4;\n fill.smooth: 0;\n }\n }\n part { name: \"tab_base_top3\";\n mouse_events: 0;\n clip_to: \"clip\";\n description { state: \"default\" 0.0;\n align: 1.0 0.0;\n rel2.offset: 3 -1;\n max: 12 99999;\n min: 12 0;\n image.normal: \"tab_base_r1.png\";\n image.normal: \"tab_other_r.png\";\n image.border: 0 0 4 4;\n fill.smooth: 0;\n }\n }\n part { name: \"terminology.title\"; type: TEXT; mouse_events: 0;\n scale: 1;\n description { state: \"default\" 0.0;\n text { font: \"Sans:style=Bold\"; size: 10;\n align: 0.5 0.5;\n min: 0 1;\n }\n align: 0.5 0.5;\n color: 96 96 96 255;\n rel1.to: \"tab_base_top2\";\n rel2.to: \"tab_base_top2\";\n }\n }\n part { name: \"clip\"; type: RECT;\n description { state: \"default\" 0.0;\n rel2.offset: -1 -2;\n }\n }\n part { name: \"event\"; type: RECT;\n description { state: \"default\" 0.0;\n color: 0 0 0 0;\n }\n }\n program {\n signal: \"mouse,clicked,1\"; source: \"event\";\n action: SIGNAL_EMIT \"tab,activate\" \"terminology\";\n }\n }\n }\n\n //////////////////////////////////////////////////////////////////////////////\n //// the cursor to show where text is typed\n group { name: \"terminology/cursor\";\n images {\n image: \"cr_key.png\" COMP;\n image: \"cr_out.png\" COMP;\n }\n sounds {\n sample { name: \"key-tap1\" LOSSY 64;\n source: \"kbd-tap.wav\";\n }\n sample { name: \"key-tap2\" LOSSY 64;\n source: \"kbd-tap2.wav\";\n }\n sample { name: \"key-tap3\" LOSSY 64;\n source: \"kbd-tap3.wav\";\n }\n sample { name: \"key-tap4\" LOSSY 64;\n source: \"kbd-tap4.wav\";\n }\n sample { name: \"key-tap5\" LOSSY 64;\n source: \"kbd-tap5.wav\";\n }\n }\n parts {\n part { name: \"pulsclip\"; type: RECT;\n description { state: \"default\" 0.0;\n }\n description { state: \"pulse\" 0.0;\n color: 255 255 255 80;\n }\n }\n part { name: \"key\";\n mouse_events: 0;\n description { state: \"default\" 0.0;\n rel1 {\n to: \"outline\";\n offset: -5 -5;\n }\n rel2 {\n to: \"outline\";\n offset: 4 4;\n }\n image {\n normal: \"cr_key.png\";\n border: 4 4 4 4;\n }\n color: 255 255 255 0;\n }\n description { state: \"on\" 0.0;\n inherit: \"default\" 0.0;\n color: 255 255 255 255;\n }\n description { state: \"out\" 0.0;\n inherit: \"default\" 0.0;\n color: 160 100 255 0;\n }\n }\n part { name: \"outline\";\n mouse_events: 0;\n clip_to: \"pulsclip\";\n description { state: \"default\" 0.0;\n image {\n normal: \"cr_out.png\";\n border: 3 3 3 3;\n }\n color: 255 255 255 64;\n }\n description { state: \"focused\" 0.0;\n inherit: \"default\" 0.0;\n color: 255 255 255 255;\n }\n }\n programs {\n program { name: \"focus_in_noblink\";\n signal: \"focus,in,noblink\";\n source: \"terminology\";\n action: STATE_SET \"focused\" 0.0;\n target: \"outline\";\n }\n program { name: \"focus_in\";\n signal: \"focus,in\";\n source: \"terminology\";\n action: STATE_SET \"focused\" 0.0;\n target: \"outline\";\n after: \"pulse-prepare\";\n }\n program { name: \"pulse-prepare\";\n action: STATE_SET \"default\" 0.0;\n target: \"pulsclip\";\n after: \"pulse\";\n }\n program { name: \"pulse\";\n action: STATE_SET \"pulse\" 0.0;\n transition: DECELERATE 0.5;\n target: \"pulsclip\";\n after: \"pulse2\";\n }\n program { name: \"pulse2\";\n action: STATE_SET \"default\" 0.0;\n in: 1.5 0.0;\n transition: DECELERATE 0.5;\n target: \"pulsclip\";\n after: \"pulse\";\n }\n\n program { name: \"focus_out\";\n signal: \"focus,out\";\n source: \"terminology\";\n action: ACTION_STOP;\n target: \"focus_in\";\n target: \"pulse\";\n target: \"pulse2\";\n after: \"focus_out2\";\n }\n program { name: \"focus_out2\";\n action: STATE_SET \"default\" 0.0;\n target: \"outline\";\n target: \"pulsclip\";\n }\n program {\n signal: \"key,down\"; source: \"terminology\";\n script {\n#if (EFL_VERSION_MAJOR > 1) || (EFL_VERSION_MINOR >= 8)\n new buf[32];\n snprintf(buf, 31, \"key-down%i\", (rand() % 5) + 1);\n run_program(get_program_id(buf));\n#else\n run_program(PROGRAM:\"key-down4\"); // chosen by a fair dice roll\n // guaranteed to be random.\n // http://xkcd.com/221/\n#endif\n }\n }\n program { name: \"key-down1\";\n action: PLAY_SAMPLE \"key-tap1\" 1.0;\n }\n program { name: \"key-down2\";\n action: PLAY_SAMPLE \"key-tap2\" 1.0;\n }\n program { name: \"key-down3\";\n action: PLAY_SAMPLE \"key-tap3\" 1.0;\n }\n program { name: \"key-down4\";\n action: PLAY_SAMPLE \"key-tap4\" 1.0;\n }\n program { name: \"key-down5\";\n action: PLAY_SAMPLE \"key-tap5\" 1.0;\n }\n program { name: \"key\";\n signal: \"key,down\";\n source: \"terminology\";\n action: STATE_SET \"default\" 0.0;\n target: \"key\";\n after: \"key2\";\n }\n program { name: \"key2\";\n action: STATE_SET \"on\" 0.0;\n target: \"key\";\n after: \"key3\";\n }\n program { name: \"key3\";\n action: STATE_SET \"out\" 0.0;\n transition: DECELERATE 0.3;\n target: \"key\";\n }\n }\n }\n }\n\n //////////////////////////////////////////////////////////////////////////////\n //// an object to contain the selection tool used for selecting tabs (with\n //// a glow grid of terms\n group { name: \"terminology/sel/base\";\n images {\n image: \"pm_fill.png\" COMP;\n }\n script {\n public message(Msg_Type:type, id, ...) {\n if ((type != MSG_INT) || (id != 1)) return;\n\n if (getarg(2) < 100)\n set_state(PART:\"fill\", \"translucent\", 0.0);\n else\n set_state(PART:\"fill\", \"default\", 0.0);\n }\n }\n parts {\n ////////////////////////////////////////////////////////////////////\n // background and shadows\n part { name: \"fill\";\n mouse_events: 0;\n description { state: \"default\" 0.0;\n image.normal: \"pm_fill.png\";\n fill {\n size.relative: 0.0 0.0;\n size.offset: 64 64;\n }\n }\n description { state: \"translucent\" 0.0;\n inherit: \"default\" 0.0;\n visible: 0;\n }\n }\n program {\n signal: \"translucent,on\"; source: \"terminology\";\n action: STATE_SET \"translucent\" 0.0;\n target: \"fill\";\n }\n program {\n signal: \"translucent,off\"; source: \"terminology\";\n action: STATE_SET \"default\" 0.0;\n target: \"fill\";\n }\n\n ////////////////////////////////////////////////////////////////////\n // content (where the grid of terms goes)\n part { name: \"clip\"; type: RECT;\n description { state: \"default\" 0.0;\n }\n }\n part { name: \"terminology.content\"; type: SWALLOW;\n clip_to: \"clip\";\n description { state: \"default\" 0.0;\n }\n }\n }\n }\n\n group { name: \"terminology/sel/item\";\n images {\n image: \"bg_bevel.png\" COMP;\n image: \"pm_shadow.png\" COMP;\n image: \"cr_glow.png\" COMP;\n image: \"bg_led_base.png\" COMP;\n image: \"bg_led.png\" COMP;\n image: \"bg_led_strobe.png\" COMP;\n }\n parts {\n ////////////////////////////////////////////////////////////////////\n // base background and selection image\n part { name: \"clip\"; type: RECT;\n description { state: \"default\" 0.0;\n rel1.to: \"terminology.content\";\n rel2.to: \"terminology.content\";\n color: 128 128 128 255;\n }\n description { state: \"selected\" 0.0;\n inherit: \"default\" 0.0;\n color: 255 255 255 255;\n }\n }\n part { name: \"shadow\";\n mouse_events: 0;\n description { state: \"default\" 0.0;\n fixed: 1 1;\n rel1.to: \"terminology.content\";\n rel2.to: \"terminology.content\";\n rel1.offset: -5 -5;\n rel2.offset: 4 4;\n image.normal: \"pm_shadow.png\";\n image.border: 64 64 64 64;\n image.border_scale_by: 0.1;\n color: 255 255 255 128;\n fill.smooth: 0;\n }\n description { state: \"selected\" 0.0;\n inherit: \"default\" 0.0;\n rel1.offset: -40 -40;\n rel2.offset: 39 39;\n image.border_scale_by: 1.0;\n color: 255 255 255 255;\n }\n }\n\n part { name: \"glow\";\n mouse_events: 0;\n description { state: \"default\" 0.0;\n rel1.to: \"terminology.content\";\n rel2.to: \"terminology.content\";\n rel1.offset: -4 -4;\n rel2.offset: 3 3;\n image {\n normal: \"cr_glow.png\";\n border: 9 9 9 9;\n }\n color: 255 255 255 0;\n }\n description { state: \"selected\" 0.0;\n inherit: \"default\" 0.0;\n color: 255 255 255 255;\n }\n }\n\n ////////////////////////////////////////////////////////////////////\n // swallowed terminal content + bg inside it\n part { name: \"base\"; type: RECT;\n clip_to: \"clip\";\n description { state: \"default\" 0.0;\n color: BG_COLOR;\n rel1.to: \"terminology.content\";\n rel2.to: \"terminology.content\";\n }\n }\n part { name: \"terminology.content\"; type: SWALLOW;\n clip_to: \"clip\";\n description { state: \"default\" 0.0;\n rel1.relative: 0.1 0.1;\n rel2.relative: 0.9 0.9;\n }\n description { state: \"selected\" 0.0;\n inherit: \"default\" 0.0;\n rel1.relative: 0.0 0.0;\n rel2.relative: 1.0 1.0;\n }\n }\n program {\n signal: \"selected\"; source: \"terminology\";\n action: STATE_SET \"selected\" 0.0;\n transition: DECELERATE 0.2 CURRENT;\n target: \"terminology.content\";\n target: \"terminology.label\";\n target: \"shadow\";\n target: \"clip\";\n target: \"glow\";\n }\n program {\n signal: \"selected,start\"; source: \"terminology\";\n action: STATE_SET \"selected\" 0.0;\n target: \"terminology.content\";\n target: \"terminology.label\";\n target: \"shadow\";\n target: \"clip\";\n target: \"glow\";\n }\n program {\n signal: \"unselected\"; source: \"terminology\";\n action: STATE_SET \"default\" 0.0;\n transition: DECELERATE 0.4 CURRENT;\n target: \"terminology.content\";\n target: \"terminology.label\";\n target: \"shadow\";\n target: \"clip\";\n target: \"glow\";\n }\n\n ////////////////////////////////////////////////////////////////////\n // fancy stuff over the top of the terminal for shading and labelling\n part { name: \"bevel\";\n mouse_events: 0;\n description { state: \"default\" 0.0;\n fixed: 1 1;\n rel1.to: \"terminology.content\";\n rel2.to: \"terminology.content\";\n image.normal: \"bg_bevel.png\";\n image.border: 3 3 5 3;\n image.middle: 0;\n fill.smooth: 0;\n }\n }\n part { name: \"terminology.label\"; type: TEXT; mouse_events: 0;\n scale: 1;\n description { state: \"default\" 0.0;\n rel1.to: \"terminology.content\";\n rel2.to: \"terminology.content\";\n color: 255 255 255 255;\n align: 0.5 1.0;\n text { font: \"Sans\"; size: 10;\n align: 0.5 1.0;\n min: 0 1;\n }\n }\n description { state: \"selected\" 0.0;\n inherit: \"default\" 0.0;\n color: 255 255 255 255;\n text { font:\"Sans:style=Bold\"; }\n }\n }\n\n ////////////////////////////////////////////////////////////////////\n // visual bell - spinning red siren light\n part { name: \"bell_base\";\n mouse_events: 0;\n description { state: \"default\" 0.0;\n fixed: 1 1;\n visible: 0;\n color: 255 255 255 0;\n min: 32 32;\n max: 32 32;\n rel1.to: \"terminology.content\";\n rel2.to: \"terminology.content\";\n align: 1.0 1.0;\n image.normal: \"bg_led_base.png\";\n }\n description { state: \"visible\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n color: 255 255 255 255;\n }\n }\n part { name: \"bell\";\n mouse_events: 0;\n description { state: \"default\" 0.0;\n fixed: 1 1;\n visible: 0;\n color: 255 255 255 0;\n rel1.to: \"bell_base\";\n rel2.to: \"bell_base\";\n image.normal: \"bg_led.png\";\n }\n description { state: \"visible\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n color: 255 255 255 255;\n }\n }\n part { name: \"bell_strobe\";\n mouse_events: 0;\n description { state: \"default\" 0.0;\n fixed: 1 1;\n visible: 0;\n color: 255 255 255 0;\n rel1.to: \"bell\";\n rel2.to: \"bell\";\n image.normal: \"bg_led_strobe.png\";\n map {\n on: 1;\n smooth: 1;\n rotation.center: \"bell\";\n }\n }\n description { state: \"spin\" 0.0;\n inherit: \"default\" 0.0;\n visible: 1;\n color: 255 255 255 255;\n map.rotation.z: 36.0;\n }\n description { state: \"spin_done\" 0.0;\n inherit: \"spin\" 0.0;\n map.rotation.z: 720.0;\n }\n description { state: \"spin_done2\" 0.0;\n inherit: \"spin\" 0.0;\n map.rotation.z: 1440.0;\n }\n }\n program {\n signal: \"bell\"; source: \"terminology\";\n action: STATE_SET \"default\" 0.0;\n target: \"bell_base\";\n target: \"bell\";\n target: \"bell_strobe\";\n after: \"bell\";\n }\n program { name: \"bell\";\n action: STATE_SET \"visible\" 0.0;\n target: \"bell_base\";\n after: \"bell2\";\n }\n program { name: \"bell2\";\n action: STATE_SET \"visible\" 0.0;\n transition: DECELERATE 0.1;\n target: \"bell\";\n after: \"bell3\";\n }\n program { name: \"bell3\";\n action: STATE_SET \"spin\" 0.0;\n transition: LINEAR 0.1;\n target: \"bell_strobe\";\n after: \"bell4.2\";\n }\n program { name: \"bell4.2\";\n action: STATE_SET \"spin_done\" 0.0;\n transition: LINEAR 0.9;\n target: \"bell_strobe\";\n after: \"bell4.3\";\n }\n program { name: \"bell4.3\";\n action: STATE_SET \"spin_done2\" 0.0;\n transition: LINEAR 1.0;\n target: \"bell_strobe\";\n after: \"bell4.4\";\n }\n program { name: \"bell4.4\";\n action: STATE_SET \"spin_done\" 0.0;\n target: \"bell_strobe\";\n after: \"bell4.3\";\n }\n }\n }\n\n\n//////////////////////////////////////////////////////////////////////////////\n //// an object overlayd on text that is a link\n group { name: \"terminology/link\";\n images {\n image: \"lk_bottom.png\" COMP;\n }\n parts {\n part { name: \"bottom\";\n mouse_events: 0;\n description { state: \"default\" 0.0;\n image.normal: \"lk_bottom.png\";\n image.border: 9 9 0 0;\n align: 0.5 1.0;\n min: 20 8;\n rel1.offset: -6 0;\n rel1.relative: 0.0 1.0;\n rel2.offset: 5 0;\n color: 100 200 255 255;\n fill.smooth: 0;\n }\n }\n part { name: \"event\"; type: RECT;\n mouse_events: 1;\n repeat_events: 1;\n description { state: \"default\" 0.0;\n color: 0 0 0 0;\n }\n }\n }\n }\n}\n" }, { "path": "src/test/resources/samples/langs/Eiffel/application.e", "content": "note\n\tdescription : \"nino application root class\"\n\tdate : \"$Date$\"\n\trevision : \"$Revision$\"\n\nclass\n\tAPPLICATION\n\ninherit\n\tARGUMENTS\n\n\tHTTP_SERVER_SHARED_CONFIGURATION\n\ncreate\n\tmake\n\nfeature {NONE} -- Initialization\n\n\tmake\n\t\t\t-- Run application.\n\t\tlocal\n\t\t\tl_server : HTTP_SERVER\n\t\t\tl_cfg: HTTP_SERVER_CONFIGURATION\n\t\t\tl_http_handler : HTTP_HANDLER\n\t\tdo\n\t\t\tcreate l_cfg.make\n\t\t\tl_cfg.http_server_port := 9_000\n\t\t\tl_cfg.document_root := default_document_root\n\t\t\tset_server_configuration (l_cfg)\n\t\t\tdebug (\"nino\")\n\t\t\t\tl_cfg.set_is_verbose (True)\n\t\t\tend\n\n\t\t\tcreate l_server.make (l_cfg)\n\t\t\tcreate {APPLICATION_CONNECTION_HANDLER} l_http_handler.make (l_server)\n\t\t\tl_server.setup (l_http_handler)\n\t\tend\n\nfeature -- Access\n\n\tdefault_document_root: STRING = \"webroot\"\n\nend\n\n" }, { "path": "src/test/resources/samples/langs/Eiffel/book_collection.e", "content": "class\n\tBOOK_COLLECTION\n\ncreate\n\tmake\n\nfeature {NONE} -- Initialization\n\n\tmake (a_name: STRING_32)\n\t\t\t-- Create a book collection with `a_name' as `name'.\n\t\tdo\n\t\t\tset_name (a_name)\n\t\t\tcreate book_index.make (10)\n\t\tensure\n\t\t\tname_set: name = a_name\n\t\tend\n\nfeature -- Access\n\n\tname: STRING_32\n\t\t\t-- Name.\n\n\tbooks: LIST [BOOK]\n\t\t\t-- collection of book.\n\t\tdo\n\t\t\tcreate {LINKED_LIST [BOOK]} Result.make\n\t\t\tacross\n\t\t\t\tbook_index as it\n\t\t\tloop\n\t\t\t\tResult.append (it.item)\n\t\t\tend\n\t\tend\n\n\tbooks_by_author (a_author: STRING_32): LIST [BOOK]\n\t\t\t-- Books wrote by `a_author' in this collection.\n\t\tdo\n\t\t\tif attached book_index [a_author] as l_result then\n\t\t\t\tResult := l_result\n\t\t\telse\n\t\t\t\tcreate {LINKED_LIST [BOOK]} Result.make\n\t\t\tend\n\t\tend\n\nfeature -- Change\n\n\tset_name (a_name: STRING_32)\n\t\t\t-- Set `name' with `a_name'.\n\t\tdo\n\t\t\tname := a_name\n\t\tensure\n\t\t\tname_set: name = a_name\n\t\tend\n\n\tadd_book (a_book: BOOK)\n\t\t\t-- Extend collection with `a_book'.\n\t\tlocal\n\t\t\tl: detachable LIST [BOOK]\n\t\tdo\n\t\t\tl := book_index.at (a_book.author.name)\n\t\t\tif l = Void then\n\t\t\t\tcreate {LINKED_LIST [BOOK]} l.make\n\t\t\t\tbook_index.put (l, a_book.author.name)\n\t\t\tend\n\t\t\tl.force (a_book)\n\t\tend\n\n\tadd_books (book_list: like books)\n\t\t\t-- Append collection with `book_list'.\n\t\tdo\n\t\t\tacross\n\t\t\t\tbook_list as it\n\t\t\tloop\n\t\t\t\tadd_book (it.item)\n\t\t\tend\n\t\tend\n\nfeature {NONE} -- Implementation\n\n\tbook_index: HASH_TABLE [LIST [BOOK], STRING_32]\n\t\t\t-- Association of author name and its books.\n\nend -- class BOOK_COLLECTION\n" }, { "path": "src/test/resources/samples/langs/Eiffel/git_checkout_command.e", "content": "note\n\tdescription: \"Git checkout command.\"\n\tauthor: \"Olivier Ligot\"\n\nclass\n\tGIT_CHECKOUT_COMMAND\n\ninherit\n\tGIT_COMMAND\n\ncreate\n\tmake,\n\tmake_master\n\nfeature {NONE} -- Initialization\n\n\tmake (a_branch: STRING)\n\t\t\t-- Checkout the branch `a_branch'.\n\t\tdo\n\t\t\tinitialize\n\t\t\targuments.force_last (a_branch)\n\t\t\tbranch := a_branch\n\t\tensure\n\t\t\tbranch_set: branch = a_branch\n\t\tend\n\n\tmake_master\n\t\t\t-- Checkout the master branch.\n\t\tdo\n\t\t\tmake (\"master\")\n\t\tend\n\nfeature -- Access\n\n\tbranch: STRING\n\t\t\t-- Branch to checkout\n\n\tname: STRING = \"checkout\"\n\t\t\t-- Git subcommand name\n\nend\n" }, { "path": "src/test/resources/samples/langs/Elixir/hello_world.exs", "content": "defmodule HelloWorld do\n @moduledoc \"this is the obligatory hello, world example\"\n\n @doc \"says hello to the name provided, or 'world' by default\"\n def hi(name \\\\ \"world\") do\n \"hello, #{name}\"\n end\nend\n" }, { "path": "src/test/resources/samples/langs/Elixir/hello_world_test.exs", "content": "Code.load_file(\"hello_world.exs\")\n\nExUnit.start\n\ndefmodule HelloWorldTest do\n use ExUnit.Case\n\n test \"say hello\" do\n assert HelloWorld.hi() == \"hello, world\"\n end\n\n test \"say hello to michael\" do\n assert HelloWorld.hi(\"michael\") == \"hello, michael\"\n end\nend\n" }, { "path": "src/test/resources/samples/langs/Elm/Basic.elm", "content": "\nimport List (intercalate,intersperse)\nimport Website.Skeleton\nimport Website.ColorScheme\n\naddFolder folder lst =\n let add (x,y) = (x, folder ++ y ++ \".elm\") in\n let f (n,xs) = (n, map add xs) in\n map f lst\n\nelements = addFolder \"Elements/\"\n [ (\"Primitives\",\n [ (\"Text\" , \"HelloWorld\")\n , (\"Images\", \"Image\")\n , (\"Fitted Images\", \"FittedImage\")\n , (\"Videos\", \"Video\")\n , (\"Markdown\", \"Markdown\")\n ])\n , (\"Formatting\",\n [ (\"Size\" , \"Size\")\n , (\"Opacity\" , \"Opacity\")\n , (\"Text\" , \"Text\")\n , (\"Typeface\", \"Typeface\")\n ])\n , (\"Layout\",\n [ (\"Simple Flow\", \"FlowDown1a\")\n , (\"Flow Down\" , \"FlowDown2\")\n , (\"Layers\" , \"Layers\")\n , (\"Positioning\", \"Position\")\n , (\"Spacers\" , \"Spacer\")\n ])\n , (\"Collage\", [ (\"Lines\" , \"Lines\")\n , (\"Shapes\" , \"Shapes\")\n , (\"Sprites\" , \"Sprite\")\n , (\"Elements\" , \"ToForm\")\n , (\"Colors\" , \"Color\")\n , (\"Textures\" , \"Texture\")\n , (\"Transforms\", \"Transforms\")\n ])\n ]\n\n\nfunctional = addFolder \"Functional/\"\n [ (\"Recursion\",\n [ (\"Factorial\" , \"Factorial\")\n , (\"List Length\", \"Length\")\n , (\"Zip\" , \"Zip\")\n , (\"Quick Sort\" , \"QuickSort\")\n ])\n , (\"Functions\",\n [ (\"Anonymous Functions\", \"Anonymous\")\n , (\"Application\" , \"Application\")\n , (\"Composition\" , \"Composition\")\n , (\"Infix Operators\" , \"Infix\")\n ])\n , (\"Higher-Order\",\n [ (\"Map\" , \"Map\")\n , (\"Fold\" , \"Sum\")\n , (\"Filter\" , \"Filter\")\n , (\"ZipWith\", \"ZipWith\")\n ])\n , (\"Data Types\",\n [ (\"Maybe\", \"Maybe\")\n , (\"Boolean Expressions\", \"BooleanExpressions\")\n , (\"Tree\", \"Tree\")\n ])\n ]\n\nreactive = addFolder \"Reactive/\"\n [ (\"Mouse\", [ (\"Position\", \"Position\")\n , (\"Presses\" , \"IsDown\")\n , (\"Clicks\" , \"CountClicks\")\n , (\"Position+Image\", \"ResizeYogi\")\n , (\"Position+Collage\" , \"Transforms\")\n -- , (\"Hover\" , \"IsAbove\")\n ])\n ,(\"Keyboard\",[ (\"Keys Down\" , \"KeysDown\")\n , (\"Key Presses\", \"CharPressed\")\n ])\n , (\"Window\", [ (\"Size\", \"ResizePaint\")\n , (\"Centering\", \"Centering\")\n ])\n , (\"Time\", [ (\"Before and After\", \"Between\")\n , (\"Every\" , \"Every\")\n , (\"Clock\" , \"Clock\")\n ])\n , (\"Input\", [ (\"Text Fields\", \"TextField\")\n , (\"Passwords\" , \"Password\")\n , (\"Check Boxes\", \"CheckBox\")\n , (\"String Drop Down\", \"StringDropDown\")\n , (\"Drop Down\", \"DropDown\")\n ])\n , (\"Random\", [ (\"Randomize\", \"Randomize\") ])\n , (\"HTTP\", [ (\"Zip Codes\", \"ZipCodes\") ])\n , (\"Filters\",[ (\"Sample\", \"SampleOn\")\n , (\"Keep If\", \"KeepIf\")\n , (\"Drop Repeats\", \"DropRepeats\")\n ])\n ]\n\nexample (name, loc) = Text.link (\"/edit/examples/\" ++ loc) (toText name)\ntoLinks (title, links) =\n flow right [ width 130 (text $ toText \" \" ++ italic (toText title))\n , text (intercalate (bold . Text.color accent4 $ toText \" · \") $ map example links)\n ]\n\ninsertSpace lst = case lst of { x:xs -> x : spacer 1 5 : xs ; [] -> [] }\n\nsubsection w (name,info) =\n flow down . insertSpace . intersperse (spacer 1 1) . map (width w) $\n (text . bold $ toText name) : map toLinks info\n\nwords = [markdown|\n\n### Basic Examples\n\nEach example listed below focuses on a single function or concept.\nThese examples demonstrate all of the basic building blocks of Elm.\n\n|]\n\ncontent w =\n words : map (subsection w) [ (\"Display\",elements), (\"React\",reactive), (\"Compute\",functional) ]\n\nexampleSets w = flow down . map (width w) . intersperse (plainText \" \") $ content w\n\nmain = lift (skeleton exampleSets) Window.width\n" }, { "path": "src/test/resources/samples/langs/Elm/QuickSort.elm", "content": "\nmain = asText (qsort [3,9,1,8,5,4,7])\n\nqsort lst =\n case lst of\n x:xs -> qsort (filter ((>=)x) xs) ++ [x] ++ qsort (filter ((<)x) xs)\n [] -> []\n\n\n{---------------------\n\nQuickSort works as follows:\n - Choose a pivot element which be placed in the \"middle\" of the sorted list.\n In our case we are choosing the first element as the pivot.\n - Gather all of the elements less than the pivot (the first filter).\n We know that these must come before our pivot element in the sorted list.\n Note: ((>=)x) === (\\y -> (>=) x y) === (\\y -> x >= y)\n - Gather all of the elements greater than the pivot (the second filter).\n We know that these must come after our pivot element in the sorted list.\n - Run `qsort` on the lesser elements, producing a sorted list that contains\n only elements less than the pivot. Put these before the pivot.\n - Run `qsort` on the greater elements, producing a sorted list. Put these\n after the pivot.\n\nNote that choosing a bad pivot can have bad effects. Take a sorted list with\nN elements. The pivot will always be the lowest member, meaning that it does\nnot divide the list very evenly. The list of lessers has 0 elements\nand the list of greaters has N-1 elemens. This means qsort will be called\nN times, each call looking through the entire list. This means, in the worst\ncase, QuickSort will make N^2 comparisons.\n\n----------------------}\n" }, { "path": "src/test/resources/samples/langs/Elm/Tree.elm", "content": "\n{-----------------------------------------------------------------\n\nOverview: A \"Tree\" represents a binary tree. A \"Node\" in a binary\ntree always has two children. A tree can also be \"Empty\". Below\nI have defined \"Tree\" and a number of useful functions.\n\nThis example also includes some challenge problems :)\n\n-----------------------------------------------------------------}\n\n\ndata Tree a = Node a (Tree a) (Tree a) | Empty\n\nempty = Empty\nsingleton v = Node v Empty Empty\n\ninsert x tree =\n case tree of\n Empty -> singleton x\n Node y left right ->\n if x == y then tree else\n if x < y then Node y (insert x left) right\n else Node y left (insert x right)\n\nfromList xs = foldl insert empty xs\n\ndepth tree =\n case tree of\n Node v left right -> 1 + max (depth left) (depth right)\n Empty -> 0\n\nmap f tree =\n case tree of\n Node v left right -> Node (f v) (map f left) (map f right)\n Empty -> Empty\n\nt1 = fromList [1,2,3]\nt2 = fromList [2,1,3]\n\nmain = flow down [ display \"depth\" depth t1\n , display \"depth\" depth t2\n , display \"map ((+)1)\" (map ((+)1)) t2\n ]\n\ndisplay name f v =\n text . monospace . toText $\n concat [ show (f v), \" ⇐ \", name, \" \", show v ]\n\n{-----------------------------------------------------------------\n\nExercises:\n\n(1) Sum all of the elements of a tree.\n\n sum :: Tree Number -> Number\n\n(2) Flatten a tree into a list.\n\n flatten :: Tree a -> [a]\n\n(3) Check to see if an element is in a given tree.\n\n isElement :: a -> Tree a -> Bool \n\n(4) Write a general fold function that acts on trees. The fold\n function does not need to guarantee a particular order of\n traversal.\n\n fold :: (a -> b -> b) -> b -> Tree a -> b\n\n(5) Use \"fold\" to do exercises 1-3 in one line each. The best\n readable versions I have come up have the following length\n in characters including spaces and function name:\n sum: 16\n flatten: 21\n isElement: 46\n See if you can match or beat me! Don't forget about currying\n and partial application!\n\n(6) Can \"fold\" be used to implement \"map\" or \"depth\"?\n\n(7) Try experimenting with different ways to traverse a\n tree: pre-order, in-order, post-order, depth-first, etc.\n More info at: http://en.wikipedia.org/wiki/Tree_traversal\n\n-----------------------------------------------------------------}\n\n\n\n\n" }, { "path": "src/test/resources/samples/langs/Emacs Lisp/.emacs.desktop", "content": ";; -*- mode: emacs-lisp; coding: emacs-mule; -*-\n;; --------------------------------------------------------------------------\n;; Desktop File for Emacs\n;; --------------------------------------------------------------------------\n;; Created Sat Jan 3 12:46:35 2015\n;; Desktop file format version 206\n;; Emacs version 24.3.1\n\n;; Global section:\n(setq desktop-missing-file-warning nil)\n(setq tags-file-name nil)\n(setq tags-table-list nil)\n(setq search-ring nil)\n(setq regexp-search-ring nil)\n(setq register-alist nil)\n(setq file-name-history nil)\n\n;; Buffer section -- buffers listed in same order as in buffer list:\n(desktop-create-buffer 206\n \"/home/foo/bar\"\n \"bar\"\n 'fundamental-mode\n nil\n 11572\n '(11554 nil)\n nil\n nil\n '((buffer-file-coding-system . undecided-unix)))\n\n" }, { "path": "src/test/resources/samples/langs/Emacs Lisp/dude.el", "content": "(print \"Dude!\")\n" }, { "path": "src/test/resources/samples/langs/Emacs Lisp/ess-julia.el", "content": ";; ess-julia.el --- ESS julia mode and inferior interaction\n;;\n;; Copyright (C) 2012 Vitalie Spinu.\n;;\n;; Filename: ess-julia.el\n;; Author: Vitalie Spinu (based on julia-mode.el from julia-lang project)\n;; Maintainer: Vitalie Spinu\n;; Created: 02-04-2012 (ESS 12.03)\n;; Keywords: ESS, julia\n;;\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;\n;; This file is *NOT* part of GNU Emacs.\n;; This file is part of ESS\n;;\n;; This program 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 3, any later version.\n;;\n;; This program is distributed in the hope that it will be useful, but WITHOUT\n;; ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n;; FOR A PARTICULAR PURPOSE. See the GNU General Public License for more\n;; details.\n;;\n;; You should have received a copy of the GNU General Public License along with\n;; this program; see the file COPYING. If not, write to the Free Software\n;; Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,\n;; USA.\n;;\n;;\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;\n;;; Commentary:\n;; customise inferior-julia-program-name to point to your julia-release-basic\n;; and start the inferior with M-x julia.\n;;\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;\n(require 'compile); for compilation-* below\n\n;;; Code:\n\n(defvar julia-mode-hook nil)\n\n(add-to-list 'auto-mode-alist '(\"\\\\.jl\\\\'\" . julia-mode))\n\n(defvar julia-syntax-table\n (let ((table (make-syntax-table)))\n (modify-syntax-entry ?_ \"_\" table) ; underscores in words\n (modify-syntax-entry ?@ \"_\" table)\n (modify-syntax-entry ?. \"_\" table)\n (modify-syntax-entry ?# \"<\" table) ; # single-line comment start\n (modify-syntax-entry ?\\n \">\" table) ; \\n single-line comment end\n (modify-syntax-entry ?\\{ \"(} \" table)\n (modify-syntax-entry ?\\} \"){ \" table)\n (modify-syntax-entry ?\\[ \"(] \" table)\n (modify-syntax-entry ?\\] \")[ \" table)\n (modify-syntax-entry ?\\( \"() \" table)\n (modify-syntax-entry ?\\) \")( \" table)\n ;(modify-syntax-entry ?\\\\ \".\" table) ; \\ is an operator outside quotes\n (modify-syntax-entry ?' \".\" table) ; character quote or transpose\n (modify-syntax-entry ?\\\" \"\\\"\" table)\n (modify-syntax-entry ?` \"\\\"\" table)\n ;; (modify-syntax-entry ?\\\" \".\" table)\n (modify-syntax-entry ?? \".\" table)\n (modify-syntax-entry ?$ \".\" table)\n (modify-syntax-entry ?& \".\" table)\n (modify-syntax-entry ?* \".\" table)\n (modify-syntax-entry ?+ \".\" table)\n (modify-syntax-entry ?- \".\" table)\n (modify-syntax-entry ?< \".\" table)\n (modify-syntax-entry ?> \".\" table)\n (modify-syntax-entry ?= \".\" table)\n (modify-syntax-entry ?% \".\" table)\n table)\n \"Syntax table for julia-mode\")\n\n;; syntax table that holds within strings\n(defvar julia-mode-string-syntax-table\n (let ((table (make-syntax-table)))\n table)\n \"Syntax table for julia-mode\")\n\n;; disable \" inside char quote\n(defvar julia-mode-char-syntax-table\n (let ((table (make-syntax-table)))\n (modify-syntax-entry ?\\\" \".\" table)\n table)\n \"Syntax table for julia-mode\")\n\n;; not used\n;; (defconst julia-string-regex\n;; \"\\\"[^\\\"]*?\\\\(\\\\(\\\\\\\\\\\\\\\\\\\\)*\\\\\\\\\\\"[^\\\"]*?\\\\)*\\\"\")\n\n(defconst julia-char-regex\n \"\\\\(\\\\s(\\\\|\\\\s-\\\\|-\\\\|[,%=<>\\\\+*/?&|$!\\\\^~\\\\\\\\;:]\\\\|^\\\\)\\\\('\\\\(\\\\([^']*?[^\\\\\\\\]\\\\)\\\\|\\\\(\\\\\\\\\\\\\\\\\\\\)\\\\)'\\\\)\")\n\n(defconst julia-unquote-regex\n \"\\\\(\\\\s(\\\\|\\\\s-\\\\|-\\\\|[,%=<>\\\\+*/?&|!\\\\^~\\\\\\\\;:]\\\\|^\\\\)\\\\($[a-zA-Z0-9_]+\\\\)\")\n\n(defconst julia-forloop-in-regex\n \"for +[^ \t\r]+ +.*\\\\(in\\\\)\\\\(\\\\s-\\\\|$\\\\)+\")\n\n(defconst ess-subset-regexp\n \"\\\\[[0-9:, ]*\\\\]\" )\n\n(defconst julia-font-lock-defaults\n (list '(\"\\\\<\\\\(\\\\|Uint\\\\(8\\\\|16\\\\|32\\\\|64\\\\)\\\\|Int\\\\(8\\\\|16\\\\|32\\\\|64\\\\)\\\\|Integer\\\\|Float\\\\|Float32\\\\|Float64\\\\|Complex128\\\\|Complex64\\\\|ComplexNum\\\\|Bool\\\\|Char\\\\|Number\\\\|Scalar\\\\|Real\\\\|Int\\\\|Uint\\\\|Array\\\\|DArray\\\\|AbstractArray\\\\|AbstractVector\\\\|AbstractMatrix\\\\|SubArray\\\\|StridedArray\\\\|StridedVector\\\\|StridedMatrix\\\\|VecOrMat\\\\|StridedVecOrMat\\\\|Range\\\\|Range1\\\\|SparseMatrixCSC\\\\|Tuple\\\\|NTuple\\\\|Buffer\\\\|Size\\\\|Index\\\\|Symbol\\\\|Function\\\\|Vector\\\\|Matrix\\\\|Union\\\\|Type\\\\|Any\\\\|Complex\\\\|None\\\\|String\\\\|Ptr\\\\|Void\\\\|Exception\\\\|PtrInt\\\\|Long\\\\|Ulong\\\\)\\\\>\" .\n font-lock-type-face)\n (cons\n (concat \"\\\\<\\\\(\"\n (mapconcat\n 'identity\n '(\"if\" \"else\" \"elseif\" \"while\" \"for\" \"begin\" \"end\" \"quote\"\n \"try\" \"catch\" \"return\" \"local\" \"abstract\" \"function\" \"macro\" \"ccall\"\n\t \"typealias\" \"break\" \"continue\" \"type\" \"global\" \"@\\\\w+\"\n\t \"module\" \"import\" \"export\" \"const\" \"let\" \"bitstype\" \"using\")\n \"\\\\|\") \"\\\\)\\\\>\")\n 'font-lock-keyword-face)\n '(\"\\\\<\\\\(true\\\\|false\\\\|C_NULL\\\\|Inf\\\\|NaN\\\\|Inf32\\\\|NaN32\\\\)\\\\>\" . font-lock-constant-face)\n (list julia-unquote-regex 2 'font-lock-constant-face)\n (list julia-char-regex 2 'font-lock-string-face)\n (list julia-forloop-in-regex 1 'font-lock-keyword-face)\n ;; (cons ess-subset-regexp 'font-lock-constant-face)\n (cons \"\\\\(\\\\sw+\\\\) ?(\" '(1 font-lock-function-name-face keep))\n ;(list julia-string-regex 0 'font-lock-string-face)\n))\n\n(defconst julia-block-start-keywords\n (list \"if\" \"while\" \"for\" \"begin\" \"try\" \"function\" \"type\" \"let\" \"macro\"\n\t\"quote\"))\n\n(defconst julia-block-other-keywords\n (list \"else\" \"elseif\"))\n\n(defconst julia-block-end-keywords\n (list \"end\" \"else\" \"elseif\" \"catch\"))\n\n(defun ess-inside-brackets-p (&optional pos)\n (save-excursion\n (let* ((pos (or pos (point)))\n\t (beg (re-search-backward \"\\\\[\" (max (point-min) (- pos 1000)) t))\n\t (end (re-search-forward \"\\\\]\" (min (point-max) (+ pos 1000)) t)))\n (and beg end (> pos beg) (> end pos)))))\n\n(defun julia-at-keyword (kw-list)\n ; not a keyword if used as a field name, X.word, or quoted, :word\n (and (or (= (point) 1)\n\t (and (not (equal (char-before (point)) ?.))\n\t\t(not (equal (char-before (point)) ?:))))\n (not (ess-inside-string-or-comment-p (point)))\n (not (ess-inside-brackets-p (point)))\n (member (current-word) kw-list)))\n\n; get the position of the last open block\n(defun julia-last-open-block-pos (min)\n (let ((count 0))\n (while (not (or (> count 0) (<= (point) min)))\n (backward-word 1)\n (setq count\n\t (cond ((julia-at-keyword julia-block-start-keywords)\n\t\t (+ count 1))\n\t\t ((and (equal (current-word) \"end\")\n\t\t\t(not (ess-inside-comment-p)) (not (ess-inside-brackets-p)))\n\t\t (- count 1))\n\t\t (t count))))\n (if (> count 0)\n\t(point)\n nil)))\n\n; get indent for last open block\n(defun julia-last-open-block (min)\n (let ((pos (julia-last-open-block-pos min)))\n (and pos\n\t (progn\n\t (goto-char pos)\n\t (+ julia-basic-offset (current-indentation))))))\n\n; return indent implied by a special form opening on the previous line, if any\n(defun julia-form-indent ()\n (forward-line -1)\n (end-of-line)\n (backward-sexp)\n (if (julia-at-keyword julia-block-other-keywords)\n (+ julia-basic-offset (current-indentation))\n (if (char-equal (char-after (point)) ?\\()\n (progn\n (backward-word 1)\n (let ((cur (current-indentation)))\n (if (julia-at-keyword julia-block-start-keywords)\n (+ julia-basic-offset cur)\n nil)))\n nil)))\n\n(defun julia-paren-indent ()\n (let* ((p (parse-partial-sexp (save-excursion\n\t\t\t\t ;; only indent by paren if the last open\n\t\t\t\t ;; paren is closer than the last open\n\t\t\t\t ;; block\n\t\t\t\t (or (julia-last-open-block-pos (point-min))\n\t\t\t\t (point-min)))\n\t\t\t\t(progn (beginning-of-line)\n\t\t\t\t (point))))\n (pos (cadr p)))\n (if (or (= 0 (car p)) (null pos))\n nil\n (progn (goto-char pos) (+ 1 (current-column))))))\n\t\t\t\t\t; (forward-line -1)\n\t\t\t\t\t; (end-of-line)\n\t\t\t\t\t; (let ((pos (condition-case nil\n\t\t\t\t\t; (scan-lists (point) -1 1)\n\t\t\t\t\t; (error nil))))\n\t\t\t\t\t; (if pos\n\t\t\t\t\t; (progn (goto-char pos) (+ 1 (current-column)))\n\t\t\t\t\t; nil)))\n\n(defun julia-indent-line ()\n \"Indent current line of julia code\"\n (interactive)\n\t\t\t\t\t; (save-excursion\n (end-of-line)\n (indent-line-to\n (or (and (ess-inside-string-p (point-at-bol)) 0)\n\t (save-excursion (ignore-errors (julia-form-indent)))\n (save-excursion (ignore-errors (julia-paren-indent)))\n ;; previous line ends in =\n\t (save-excursion\n (beginning-of-line)\n (skip-chars-backward \" \\t\\n\")\n (when (eql (char-before) ?=)\n (+ julia-basic-offset (current-indentation))))\n (save-excursion\n (let ((endtok (progn\n (beginning-of-line)\n (forward-to-indentation 0)\n (julia-at-keyword julia-block-end-keywords))))\n (ignore-errors (+ (julia-last-open-block (point-min))\n (if endtok (- julia-basic-offset) 0)))))\n\t ;; take same indentation as previous line\n\t (save-excursion (forward-line -1)\n\t\t\t (current-indentation))\n 0))\n (when (julia-at-keyword julia-block-end-keywords)\n (forward-word 1)))\n\n(defvar julia-editing-alist\n '((paragraph-start\t\t . (concat \"\\\\s-*$\\\\|\" page-delimiter))\n (paragraph-separate\t\t . (concat \"\\\\s-*$\\\\|\" page-delimiter))\n (paragraph-ignore-fill-prefix . t)\n (require-final-newline\t . t)\n (comment-start\t\t . \"# \")\n (comment-add . 1)\n (comment-start-skip\t\t . \"#+\\\\s-*\")\n (comment-column\t\t . 40)\n ;;(comment-indent-function\t. 'S-comment-indent)\n ;;(ess-comment-indent\t . 'S-comment-indent)\n ;; (ess-indent-line\t\t\t . 'S-indent-line)\n ;;(ess-calculate-indent\t . 'ess-calculate-indent)\n (ess-indent-line-function\t . 'julia-indent-line)\n (indent-line-function\t . 'julia-indent-line)\n (parse-sexp-ignore-comments\t . t)\n (ess-style\t\t \t . ess-default-style) ;; ignored\n (ess-local-process-name\t . nil)\n ;;(ess-keep-dump-files\t . 'ask)\n (ess-mode-syntax-table\t . julia-syntax-table)\n ;; For Changelog add, require ' ' before <- : \"attr<-\" is a function name :\n ;; (add-log-current-defun-header-regexp . \"^\\\\(.+\\\\)\\\\s-+=[ \\t\\n]*function\")\n (add-log-current-defun-header-regexp . \"^.*function[ \\t]*\\\\([^ \\t(]*\\\\)[ \\t]*(\")\n (font-lock-defaults\t\t . '(julia-font-lock-defaults\n nil nil ((?\\_ . \"w\"))))\n )\n \"General options for julia source files.\")\n\n(autoload 'inferior-ess \"ess-inf\" \"Run an ESS process.\")\n(autoload 'ess-mode \"ess-mode\" \"Edit an ESS process.\")\n\n(defun julia-send-string-function (process string visibly)\n (let ((file (concat temporary-file-directory \"julia_eval_region.jl\")))\n (with-temp-file file\n (insert string))\n (process-send-string process (format ess-load-command file))))\n\n(defun julia-get-help-topics (&optional proc)\n (ess-get-words-from-vector \"ESS.all_help_topics()\\n\"))\n ;; (ess-command com)))\n\n(defvar julia-help-command \"help(\\\"%s\\\")\\n\")\n\n(defvar ess-julia-error-regexp-alist '(julia-in julia-at)\n \"List of symbols which are looked up in `compilation-error-regexp-alist-alist'.\")\n\n(add-to-list 'compilation-error-regexp-alist-alist\n '(julia-in \"^\\\\s-*in [^ \\t\\n]* \\\\(at \\\\(.*\\\\):\\\\([0-9]+\\\\)\\\\)\" 2 3 nil 2 1))\n(add-to-list 'compilation-error-regexp-alist-alist\n '(julia-at \"^\\\\S-+\\\\s-+\\\\(at \\\\(.*\\\\):\\\\([0-9]+\\\\)\\\\)\" 2 3 nil 2 1))\n\n(defvar julia-customize-alist\n '((comint-use-prompt-regexp\t\t. t)\n (ess-eldoc-function . 'ess-julia-eldoc-function)\n (inferior-ess-primary-prompt\t. \"a> \") ;; from julia>\n (inferior-ess-secondary-prompt\t. nil)\n (inferior-ess-prompt\t\t. \"\\\\w*> \")\n (ess-local-customize-alist\t\t. 'julia-customize-alist)\n (inferior-ess-program\t\t. inferior-julia-program-name)\n (inferior-ess-font-lock-defaults\t. julia-font-lock-defaults)\n (ess-get-help-topics-function\t. 'julia-get-help-topics)\n (ess-help-web-search-command . \"http://docs.julialang.org/en/latest/search/?q=%s\")\n (ess-load-command \t\t. \"include(\\\"%s\\\")\\n\")\n (ess-funargs-command . \"ESS.fun_args(\\\"%s\\\")\\n\")\n (ess-dump-error-re\t\t\t. \"in \\\\w* at \\\\(.*\\\\):[0-9]+\")\n (ess-error-regexp\t\t\t. \"\\\\(^\\\\s-*at\\\\s-*\\\\(?3:.*\\\\):\\\\(?2:[0-9]+\\\\)\\\\)\")\n (ess-error-regexp-alist\t\t. ess-julia-error-regexp-alist)\n (ess-send-string-function\t\t. nil);'julia-send-string-function)\n (ess-imenu-generic-expression . julia-imenu-generic-expression)\n ;; (inferior-ess-objects-command\t. inferior-R-objects-command)\n ;; (inferior-ess-search-list-command\t. \"search()\\n\")\n (inferior-ess-help-command\t\t. julia-help-command)\n ;; (inferior-ess-help-command\t. \"help(\\\"%s\\\")\\n\")\n (ess-language\t\t\t. \"julia\")\n (ess-dialect\t\t\t. \"julia\")\n (ess-suffix\t\t\t\t. \"jl\")\n (ess-dump-filename-template\t\t. (ess-replace-regexp-in-string\n\t\t\t\t\t \"S$\" ess-suffix ; in the one from custom:\n\t\t\t\t\t ess-dump-filename-template-proto))\n (ess-mode-syntax-table\t\t. julia-syntax-table)\n (ess-mode-editing-alist\t . julia-editing-alist)\n (ess-change-sp-regexp\t\t. nil );ess-R-change-sp-regexp)\n (ess-help-sec-regex\t\t\t. ess-help-R-sec-regex)\n (ess-help-sec-keys-alist\t\t. ess-help-R-sec-keys-alist)\n (ess-loop-timeout\t\t\t. ess-S-loop-timeout);fixme: dialect spec.\n (ess-cmd-delay\t\t\t. ess-R-cmd-delay)\n (ess-function-pattern\t\t. ess-R-function-pattern)\n (ess-object-name-db-file\t\t. \"ess-r-namedb.el\" )\n (ess-smart-operators\t\t. ess-R-smart-operators)\n (inferior-ess-help-filetype . nil)\n (inferior-ess-exit-command\t\t. \"exit()\\n\")\n ;;harmful for shell-mode's C-a: -- but \"necessary\" for ESS-help?\n (inferior-ess-start-file\t\t. nil) ;; \"~/.ess-R\"\n (inferior-ess-start-args\t\t. \"\")\n (inferior-ess-language-start\t. nil)\n (ess-STERM\t\t. \"iESS\")\n (ess-editor\t. R-editor)\n (ess-pager\t\t. R-pager)\n )\n \"Variables to customize for Julia -- set up later than emacs initialization.\")\n\n\n(defvar ess-julia-versions '(\"julia\")\n \"List of partial strings for versions of Julia to access within ESS.\nEach string specifies the start of a filename. If a filename\nbeginning with one of these strings is found on `exec-path', a M-x\ncommand for that version of Julia is made available. \")\n\n(defcustom inferior-julia-args \"\"\n \"String of arguments (see 'julia --help') used when starting julia.\"\n;; These arguments are currently not passed to other versions of julia that have\n;; been created using the variable `ess-r-versions'.\"\n :group 'ess-julia\n :type 'string)\n\n;;;###autoload\n(defun julia-mode (&optional proc-name)\n \"Major mode for editing julia source. See `ess-mode' for more help.\"\n (interactive \"P\")\n ;; (setq ess-customize-alist julia-customize-alist)\n (ess-mode julia-customize-alist proc-name)\n ;; for emacs < 24\n ;; (add-hook 'comint-dynamic-complete-functions 'ess-complete-object-name nil 'local)\n ;; for emacs >= 24\n ;; (remove-hook 'completion-at-point-functions 'ess-filename-completion 'local) ;; should be first\n ;; (add-hook 'completion-at-point-functions 'ess-object-completion nil 'local)\n ;; (add-hook 'completion-at-point-functions 'ess-filename-completion nil 'local)\n (if (fboundp 'ess-add-toolbar) (ess-add-toolbar))\n (set (make-local-variable 'end-of-defun-function) 'ess-end-of-function)\n ;; (local-set-key \"\\t\" 'julia-indent-line) ;; temp workaround\n ;; (set (make-local-variable 'indent-line-function) 'julia-indent-line)\n (set (make-local-variable 'julia-basic-offset) 4)\n (setq imenu-generic-expression julia-imenu-generic-expression)\n (imenu-add-to-menubar \"Imenu-jl\")\n (run-hooks 'julia-mode-hook))\n\n\n(defvar ess-julia-post-run-hook nil\n \"Functions run in process buffer after the initialization of\n julia process.\")\n\n;;;###autoload\n(defun julia (&optional start-args)\n \"Call 'julia',\nOptional prefix (C-u) allows to set command line arguments, such as\n--load=. This should be OS agnostic.\nIf you have certain command line arguments that should always be passed\nto julia, put them in the variable `inferior-julia-args'.\"\n (interactive \"P\")\n ;; get settings, notably inferior-julia-program-name :\n (if (null inferior-julia-program-name)\n (error \"'inferior-julia-program-name' does not point to 'julia-release-basic' executable\")\n (setq ess-customize-alist julia-customize-alist)\n (ess-write-to-dribble-buffer ;; for debugging only\n (format\n \"\\n(julia): ess-dialect=%s, buf=%s, start-arg=%s\\n current-prefix-arg=%s\\n\"\n ess-dialect (current-buffer) start-args current-prefix-arg))\n (let* ((jl-start-args\n\t (concat inferior-julia-args \" \" ; add space just in case\n\t\t (if start-args\n\t\t\t(read-string\n (concat \"Starting Args\"\n (if inferior-julia-args\n (concat \" [other than '\" inferior-julia-args \"']\"))\n \" ? \"))\n\t\t nil))))\n (inferior-ess jl-start-args) ;; -> .. (ess-multi ...) -> .. (inferior-ess-mode) ..\n (ess--tb-start)\n (set (make-local-variable 'julia-basic-offset) 4)\n ;; remove ` from julia's logo\n (goto-char (point-min))\n (while (re-search-forward \"`\" nil t)\n (replace-match \"'\"))\n (goto-char (point-max))\n (ess--inject-code-from-file (format \"%sess-julia.jl\" ess-etc-directory))\n (with-ess-process-buffer nil\n (run-mode-hooks 'ess-julia-post-run-hook))\n )))\n\n;;; ELDOC\n\n(defun ess-julia-eldoc-function ()\n \"Return the doc string, or nil.\nIf an ESS process is not associated with the buffer, do not try\nto look up any doc strings.\"\n (interactive)\n (when (and (ess-process-live-p)\n (not (ess-process-get 'busy)))\n (let ((funname (or (and ess-eldoc-show-on-symbol ;; aggressive completion\n (symbol-at-point))\n (car (ess--funname.start)))))\n (when funname\n (let* ((args (copy-sequence (nth 2 (ess-function-arguments funname))))\n (W (- (window-width (minibuffer-window)) (+ 4 (length funname))))\n (doc (concat (propertize funname 'face font-lock-function-name-face) \": \")))\n (when args\n (setq args (sort args (lambda (s1 s2)\n (< (length s1) (length s2)))))\n (setq doc (concat doc (pop args)))\n (while (and args (< (length doc) W))\n (setq doc (concat doc \" \"\n (pop args))))\n (when (and args (< (length doc) W))\n (setq doc (concat doc \" {--}\"))))\n doc)))))\n\n\n;;; IMENU\n(defvar julia-imenu-generic-expression\n ;; don't use syntax classes, screws egrep\n '((\"Function (_)\" \"[ \\t]*function[ \\t]+\\\\(_[^ \\t\\n]*\\\\)\" 1)\n (\"Function\" \"[ \\t]*function[ \\t]+\\\\([^_][^\\t\\n]*\\\\)\" 1)\n (\"Const\" \"[ \\t]*const \\\\([^ \\t\\n]*\\\\)\" 1)\n (\"Type\" \"^[ \\t]*[a-zA-Z0-9_]*type[a-zA-Z0-9_]* \\\\([^ \\t\\n]*\\\\)\" 1)\n (\"Require\" \" *\\\\(\\\\brequire\\\\)(\\\\([^ \\t\\n)]*\\\\)\" 2)\n (\"Include\" \" *\\\\(\\\\binclude\\\\)(\\\\([^ \\t\\n)]*\\\\)\" 2)\n ;; (\"Classes\" \"^.*setClass(\\\\(.*\\\\),\" 1)\n ;; (\"Coercions\" \"^.*setAs(\\\\([^,]+,[^,]*\\\\),\" 1) ; show from and to\n ;; (\"Generics\" \"^.*setGeneric(\\\\([^,]*\\\\),\" 1)\n ;; (\"Methods\" \"^.*set\\\\(Group\\\\|Replace\\\\)?Method(\\\"\\\\(.+\\\\)\\\",\" 2)\n ;; ;;[ ]*\\\\(signature=\\\\)?(\\\\(.*,?\\\\)*\\\\),\" 1)\n ;; ;;\n ;; ;;(\"Other\" \"^\\\\(.+\\\\)\\\\s-*<-[ \\t\\n]*[^\\\\(function\\\\|read\\\\|.*data\\.frame\\\\)]\" 1)\n ;; (\"Package\" \"^.*\\\\(library\\\\|require\\\\)(\\\\(.*\\\\),\" 2)\n ;; (\"Data\" \"^\\\\(.+\\\\)\\\\s-*<-[ \\t\\n]*\\\\(read\\\\|.*data\\.frame\\\\).*(\" 1)))\n ))\n\n(provide 'ess-julia)\n" }, { "path": "src/test/resources/samples/langs/Emacs Lisp/filenames/.abbrev_defs", "content": "(define-abbrev-table 'c-mode-abbrev-table '(\n\t))\n(define-abbrev-table 'fundamental-mode-abbrev-table '(\n\t(\"TM\" \"™\" nil 0)\n\t(\"(R)\" \"®\" nil 0)\n\t(\"C=\" \"€\" nil 0)))\n" }, { "path": "src/test/resources/samples/langs/Emacs Lisp/filenames/.gnus", "content": "(setq user-full-name \"Alhadis\")\n(setq user-mail-address \"fake.account@gmail.com\")\n\n(auto-image-file-mode)\n(setq mm-inline-large-images t)\n(add-to-list 'mm-attachment-override-types \"image/*\")\n\n(setq gnus-select-method \n\t '(nnimap \"gmail\"\n\t\t(nnimap-address \"imap.gmail.com\")\n\t\t(nnimap-server-port 777)\n\t\t(nnimap-stream ssl)))\n\n(setq message-send-mail-function 'smtpmail-send-it\n\t smtpmail-starttls-credentials '((\"smtp.gmail.com\" 600 nil nil))\n\t smtpmail-auth-credentials '((\"smtp.gmail.com\" 700 \"me@lisp.com\" nil))\n\t smtpmail-default-smtp-server \"smtp.gmail.com\"\n\t smtpmail-smtp-server \"smtp.gmail.com\"\n\t smtpmail-smtp-service 800\n\t setq gnus-ignored-from-addresses \"^from\\\\.Telstra[ \\t\\r\\n]+Thanks\")\n" }, { "path": "src/test/resources/samples/langs/Emacs Lisp/filenames/.spacemacs", "content": ";; -*- mode: emacs-lisp -*-\n;; This file is loaded by Spacemacs at startup.\n;; It must be stored in your home directory.\n\n(defun dotspacemacs/layers ()\n \"Configuration Layers declaration.\"\n (setq-default\n ;; List of additional paths where to look for configuration layers.\n ;; Paths must have a trailing slash (i.e. `~/.mycontribs/')\n dotspacemacs-configuration-layer-path '()\n ;; List of configuration layers to load. If it is the symbol `all' instead\n ;; of a list then all discovered layers will be installed.\n dotspacemacs-configuration-layers\n '(\n ;; ----------------------------------------------------------------\n ;; Example of useful layers you may want to use right away.\n ;; Uncomment some layer names and press (Vim style) or\n ;; (Emacs style) to install them.\n ;; ----------------------------------------------------------------\n emacs-lisp\n charlock_holmes\n escape_utils\n mime-types\n rugged\n minitest\n mocha\n plist\n pry\n rake\n yajl-ruby\n colour-proximity\n licensed\n licensee\n ;; List of additional packages that will be installed without being\n ;; wrapped in a layer. If you need some configuration for these\n ;; packages then consider to create a layer, you can also put the\n ;; configuration in `dotspacemacs/config'.\n dotspacemacs-additional-packages '()\n ;; A list of packages and/or extensions that will not be install and loaded.\n dotspacemacs-excluded-packages '()\n ;; If non-nil spacemacs will delete any orphan packages, i.e. packages that\n ;; are declared in a layer which is not a member of\n ;; the list `dotspacemacs-configuration-layers'\n dotspacemacs-delete-orphan-packages t))\n\n(defun dotspacemacs/init ()\n \"Initialization function.\nThis function is called at the very startup of Spacemacs initialization\nbefore layers configuration.\"\n ;; This setq-default sexp is an exhaustive list of all the supported\n ;; spacemacs settings.\n (setq-default\n ;; Either `vim' or `emacs'. Evil is always enabled but if the variable\n ;; is `emacs' then the `holy-mode' is enabled at startup.\n dotspacemacs-editing-style 'vim\n ;; If non nil output loading progress in `*Messages*' buffer.\n dotspacemacs-verbose-loading nil\n ;; Specify the startup banner. Default value is `official', it displays\n ;; the official spacemacs logo. An integer value is the index of text\n ;; banner, `random' chooses a random text banner in `core/banners'\n ;; directory. A string value must be a path to an image format supported\n ;; by your Emacs build.\n ;; If the value is nil then no banner is displayed.\n dotspacemacs-startup-banner 'official\n ;; List of items to show in the startup buffer. If nil it is disabled.\n ;; Possible values are: `recents' `bookmarks' `projects'.\"\n dotspacemacs-startup-lists '(bookmarks projects recents)\n ;; List of themes, the first of the list is loaded when spacemacs starts.\n ;; Press T n to cycle to the next theme in the list (works great\n ;; with 2 themes variants, one dark and one light)\n dotspacemacs-themes '(\n spacemacs-dark\n spacemacs-light\n solarized-dark\n solarized-light\n atom-light-ui\n atom-dark-ui\n atom-material-ui\n zenburn\n ;; If non nil the cursor colour matches the state colour.\n dotspacemacs-colorize-cursor-according-to-state t\n ;; Default font. `powerline-scale' allows to quickly tweak the mode-line\n ;; size to make separators look not too crappy.\n dotspacemacs-default-font '(\"Menloco\"\n :size 11\n :weight normal\n :width normal\n :powerline-scale 1.1)\n ;; The leader key\n dotspacemacs-leader-key \"SPC\"\n ;; The leader key accessible in `emacs state' and `insert state'\n dotspacemacs-emacs-leader-key \"M-m\"\n ;; Major mode leader key is a shortcut key which is the equivalent of\n ;; pressing ` m`. Set it to `nil` to disable it.\n dotspacemacs-major-mode-leader-key \",\"\n ;; Major mode leader key accessible in `emacs state' and `insert state'\n dotspacemacs-major-mode-emacs-leader-key \"C-M-m\"\n ;; The command key used for Evil commands (ex-commands) and\n ;; Emacs commands (M-x).\n ;; By default the command key is `:' so ex-commands are executed like in Vim\n ;; with `:' and Emacs commands are executed with ` :'.\n dotspacemacs-command-key \":\"\n ;; Location where to auto-save files. Possible values are `original' to\n ;; auto-save the file in-place, `cache' to auto-save the file to another\n ;; file stored in the cache directory and `nil' to disable auto-saving.\n ;; Default value is `cache'.\n dotspacemacs-auto-save-file-location 'cache\n ;; If non nil then `ido' replaces `helm' for some commands. For now only\n ;; `find-files' (SPC f f) is replaced.\n dotspacemacs-use-ido nil\n ;; If non nil the paste micro-state is enabled. When enabled pressing `p`\n ;; several times cycle between the kill ring content.\n dotspacemacs-enable-paste-micro-state nil\n ;; Guide-key delay in seconds. The Guide-key is the popup buffer listing\n ;; the commands bound to the current keystrokes.\n dotspacemacs-guide-key-delay 0.4\n ;; If non nil a progress bar is displayed when spacemacs is loading. This\n ;; may increase the boot time on some systems and emacs builds, set it to\n ;; nil ;; to boost the loading time.\n dotspacemacs-loading-progress-bar t\n ;; If non nil the frame is fullscreen when Emacs starts up.\n ;; (Emacs 24.4+ only)\n dotspacemacs-fullscreen-at-startup nil\n ;; If non nil `spacemacs/toggle-fullscreen' will not use native fullscreen.\n ;; Use to disable fullscreen animations in OSX.\"\n dotspacemacs-fullscreen-use-non-native nil\n ;; If non nil the frame is maximized when Emacs starts up.\n ;; Takes effect only if `dotspacemacs-fullscreen-at-startup' is nil.\n ;; (Emacs 24.4+ only)\n dotspacemacs-maximized-at-startup nil\n ;; A value from the range (0..100), in increasing opacity, which describes\n ;; the transparency level of a frame when it's active or selected.\n ;; Transparency can be toggled through `toggle-transparency'.\n dotspacemacs-active-transparency 90\n ;; A value from the range (0..100), in increasing opacity, which describes\n ;; the transparency level of a frame when it's inactive or deselected.\n ;; Transparency can be toggled through `toggle-transparency'.\n dotspacemacs-inactive-transparency 90\n ;; If non nil unicode symbols are displayed in the mode line.\n dotspacemacs-mode-line-unicode-symbols t\n ;; If non nil smooth scrolling (native-scrolling) is enabled. Smooth\n ;; scrolling overrides the default behavior of Emacs which recenters the\n ;; point when it reaches the top or bottom of the screen.\n dotspacemacs-smooth-scrolling t\n ;; If non-nil smartparens-strict-mode will be enabled in programming modes.\n dotspacemacs-smartparens-strict-mode nil\n ;; Select a scope to highlight delimiters. Possible value is `all',\n ;; `current' or `nil'. Default is `all'\n dotspacemacs-highlight-delimiters 'all\n ;; If non nil advises quit functions to keep server open when quitting.\n dotspacemacs-persistent-server nil\n ;; List of search tool executable names. Spacemacs uses the first installed\n ;; tool of the list. Supported tools are `ag', `pt', `ack' and `grep'.\n dotspacemacs-search-tools '(\"ag\" \"pt\" \"ack\" \"grep\")\n ;; The default package repository used if no explicit repository has been\n ;; specified with an installed package.\n ;; Not used for now.\n dotspacemacs-default-package-repository nil\n\n ;; If non nil line numbers are turned on in all `prog-mode' and `text-mode'\n ;; derivatives. If set to `relative', also turns on relative line numbers.\n ;; (default nil)\n dotspacemacs-line-numbers 'relative\n\n ;; Delete whitespace while saving buffer. Possible values are `all',\n ;; `trailing', `changed' or `nil'. Default is `changed' (cleanup whitespace\n ;; on changed lines) (default 'changed)\n dotspacemacs-whitespace-cleanup 'changed\n )\n ;; User initialization goes here\n )\n\n(defun dotspacemacs/user-config ()\n \"Configuration function.\n This function is called at the very end of Spacemacs initialization after\nlayers configuration.\"\n (add-hook 'alchemist-mode-hook 'company-mode)\n\n (add-hook 'projectile-mode-hook 'projectile-rails-on)\n (setq ruby-insert-encoding-magic-comment nil)\n\n (setq web-mode-markup-indent-offset 2)\n (setq web-mode-code-indent-offset 2)\n\n (spacemacs/toggle-golden-ratio-on)\n (spacemacs/toggle-indent-guide-globally-on)\n (spacemacs/toggle-centered-point-globally-on)\n)\n\n;; Do not write anything past this comment. This is where Emacs will\n;; auto-generate custom variable definitions.\n(custom-set-variables\n ;; custom-set-variables was added by Custom.\n ;; If you edit it by hand, you could mess it up, so be careful.\n ;; Your init file should contain only one such instance.\n ;; If there is more than one, they won't work right.\n)\n" }, { "path": "src/test/resources/samples/langs/Emacs Lisp/filenames/.viper", "content": "(setq viper-inhibit-startup-message 't)\n(setq viper-expert-level '5)\n\n; Key bindings\n(define-key viper-vi-global-user-map \"\\C-d\" 'end-of-line)\n\n; Return to top of window\n(defun my-viper-return-to-top ()\n (interactive)\n (beginning-of-buffer))\n" }, { "path": "src/test/resources/samples/langs/Emacs Lisp/filenames/Cask", "content": "(package \"composer\" \"0.0.7\" \"Interface to PHP Composer\")\n(source \"melpa\" \"https://melpa.org/packages/\")\n\n(package-file \"composer.el\")\n\n(depends-on \"f\")\n(depends-on \"s\")\n(depends-on \"request\")\n(depends-on \"seq\")\n" }, { "path": "src/test/resources/samples/langs/Emacs Lisp/filenames/Project.ede", "content": ";; Object EDE\n(ede-proj-project \"Linguist\"\n :name \"Linguist\"\n :version \"4.9\"\n :file \"Project.ede\"\n :targets (list \n (ede-proj-target-elisp-autoloads \"autoloads\"\n :name \"autoloads\"\n :path \"test/samples/Emacs Lisp\"\n :autoload-file \"dude.el\"\n )\n (ede-proj-target-elisp \"init\"\n :name \"init\"\n :path \"\"\n :source '(\"ede-load.el\" \"wait-what.el\")\n :compiler 'ede-emacs-preload-compiler\n :pre-load-packages '(\"sample-names\")\n )\n (ede-proj-target-elisp \"what\"\n :name \"the\"\n :path \"\"\n :source '(\"h.el\" \"am-i-writing.el\")\n :versionsource '(\"hell.el\")\n :compiler 'ede-emacs-preload-compiler\n :aux-packages '(\"what\" \"the\" \"hell-files\" \"am-i-writing\")\n )\n )\n :web-site-url \"https://github.com/github/linguist\"\n :web-site-directory \"../\"\n :web-site-file \"CONTRIBUTING.md\"\n :ftp-upload-site \"/ftp@git.hub.com:/madeup\"\n :configuration-variables 'nil\n :metasubproject 't\n )\n" }, { "path": "src/test/resources/samples/langs/Emacs Lisp/filenames/_emacs", "content": ";; UTF-8 support\n;; (set-language-environment \"UTF-8\")\n(setenv \"LANG\" \"en_AU.UTF-8\")\n(setenv \"LC_ALL\" \"en_AU.UTF-8\")\n(setq default-tab-width 4)\n\n\n;;; Function to load all \".el\" files in ~/.emacs.d/config\n(defun load-directory (directory)\n \"Recursively load all Emacs Lisp files in a directory.\"\n (dolist (element (directory-files-and-attributes directory nil nil nil))\n (let* ((path (car element))\n (fullpath (concat directory \"/\" path))\n (isdir (car (cdr element)))\n (ignore-dir (or (string= path \".\") (string= path \"..\"))))\n (cond\n ((and (eq isdir t) (not ignore-dir))\n (load-directory fullpath))\n ((and (eq isdir nil) (string= (substring path -3) \".el\"))\n (load (file-name-sans-extension fullpath)))))))\n\n;; Tell Emacs we'd like to use Hunspell for spell-checking\n(setq ispell-program-name (executable-find \"hunspell\"))\n\n;; Load Homebrew-installed packages\n(let ((default-directory \"/usr/local/share/emacs/site-lisp/\"))\n (normal-top-level-add-subdirs-to-load-path))\n(load \"aggressive-indent\")\n(add-hook 'emacs-lisp-mode-hook #'aggressive-indent-mode)\n(autoload 'rust-mode \"rust-mode\" nil t)\n(add-to-list 'auto-mode-alist '(\"\\\\.rs\\\\'\" . rust-mode))\n\n;; Load Git-related syntax highlighting\n(add-to-list 'load-path \"~/.emacs.d/lisp/\")\n(load \"git-modes\")\n(load \"git-commit\")\n\n;; Keybindings\n(global-set-key (kbd \"C-u\") (lambda ()\n (interactive)\n (kill-line 0)))\n\n;; Show cursor's current column number\n(setq column-number-mode t)\n\n;; Disable autosave\n(setq auto-save-default nil)\n\n;; Use a single directory for storing backup files\n(setq backup-directory-alist `((\".\" . \"~/.emacs.d/auto-save-list\")))\n(setq backup-by-copying t)\n(setq delete-old-versions t\n kept-new-versions 6\n kept-old-versions 2\n version-control t)\n\n(custom-set-variables\n ;; custom-set-variables was added by Custom.\n ;; If you edit it by hand, you could mess it up, so be careful.\n ;; Your init file should contain only one such instance.\n ;; If there is more than one, they won't work right.\n '(blink-cursor-mode nil)\n '(column-number-mode t)\n '(show-paren-mode t))\n(custom-set-faces\n ;; custom-set-faces was added by Custom.\n ;; If you edit it by hand, you could mess it up, so be careful.\n ;; Your init file should contain only one such instance.\n ;; If there is more than one, they won't work right.\n )\n" }, { "path": "src/test/resources/samples/langs/Emacs Lisp/filenames/abbrev_defs", "content": "(define-abbrev-table 'fundamental-mode-abbrev-table '(\n\t(\"cat\" \"Concatenate\" nil 0)\n\t(\"WTF\" \"World Trade Federation \" nil 0)\n\t(\"rtbtm\" \"Read that back to me\" nil 0)))\n\n(define-abbrev-table 'shell-script-mode-abbrev-table '(\n\t(\"brake\", \"bundle rake exec\" nil 0)\n\t(\"pls\", \"warning: setting Encoding.default_external\")))\n" }, { "path": "src/test/resources/samples/langs/EmberScript/momentComponent.em", "content": "class App.FromNowView extends Ember.View\n tagName: 'time'\n template: Ember.Handlebars.compile '{{view.output}}'\n output: ~>\n return moment(@value).fromNow()\n\n didInsertElement: ->\n @tick()\n\n tick: ->\n f = ->\n @notifyPropertyChange 'output'\n @tick()\n\n nextTick = Ember.run.later(this, f, 1000)\n @set 'nextTick', nextTick\n\n willDestroyElement: ->\n nextTick = @nextTick\n Ember.run.cancel nextTick\n\nEmber.Handlebars.helper 'fromNow', App.FromNowView\n\n" }, { "path": "src/test/resources/samples/langs/Erlang/170-os-daemons.es", "content": "#! /usr/bin/env escript\n\n% Licensed under the Apache License, Version 2.0 (the \"License\"); you may not\n% use this file except in compliance with the License. You may obtain a copy of\n% 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, WITHOUT\n% WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n% License for the specific language governing permissions and limitations under\n% the License.\n\nloop() ->\n\tloop(io:read(\"\")).\n\nloop({ok, _}) ->\n\tloop(io:read(\"\"));\nloop(eof) ->\n\tstop;\nloop({error, Reason}) ->\n\tthrow({error, Reason}).\n\nmain([]) ->\n\tloop().\n" }, { "path": "src/test/resources/samples/langs/Erlang/elixir_parser.yrl", "content": "Nonterminals\n grammar expr_list\n expr container_expr block_expr access_expr\n no_parens_expr no_parens_zero_expr no_parens_one_expr no_parens_one_ambig_expr\n bracket_expr bracket_at_expr bracket_arg matched_expr unmatched_expr max_expr\n unmatched_op_expr matched_op_expr no_parens_op_expr no_parens_many_expr\n comp_op_eol at_op_eol unary_op_eol and_op_eol or_op_eol capture_op_eol\n add_op_eol mult_op_eol two_op_eol three_op_eol pipe_op_eol stab_op_eol\n arrow_op_eol match_op_eol when_op_eol in_op_eol in_match_op_eol\n type_op_eol rel_op_eol\n open_paren close_paren empty_paren eoe\n list list_args open_bracket close_bracket\n tuple open_curly close_curly\n bit_string open_bit close_bit\n map map_op map_close map_args map_expr struct_op\n assoc_op_eol assoc_expr assoc_base assoc_update assoc_update_kw assoc\n container_args_base container_args\n call_args_parens_expr call_args_parens_base call_args_parens parens_call\n call_args_no_parens_one call_args_no_parens_ambig call_args_no_parens_expr\n call_args_no_parens_comma_expr call_args_no_parens_all call_args_no_parens_many\n call_args_no_parens_many_strict\n stab stab_eoe stab_expr stab_op_eol_and_expr stab_parens_many\n kw_eol kw_base kw call_args_no_parens_kw_expr call_args_no_parens_kw\n dot_op dot_alias dot_alias_container\n dot_identifier dot_op_identifier dot_do_identifier\n dot_paren_identifier dot_bracket_identifier\n do_block fn_eoe do_eoe end_eoe block_eoe block_item block_list\n .\n\nTerminals\n identifier kw_identifier kw_identifier_safe kw_identifier_unsafe bracket_identifier\n paren_identifier do_identifier block_identifier\n fn 'end' aliases\n number atom atom_safe atom_unsafe bin_string list_string sigil\n dot_call_op op_identifier\n comp_op at_op unary_op and_op or_op arrow_op match_op in_op in_match_op\n type_op dual_op add_op mult_op two_op three_op pipe_op stab_op when_op assoc_op\n capture_op rel_op\n 'true' 'false' 'nil' 'do' eol ';' ',' '.'\n '(' ')' '[' ']' '{' '}' '<<' '>>' '%{}' '%'\n .\n\nRootsymbol grammar.\n\n%% Two shift/reduce conflicts coming from call_args_parens.\nExpect 2.\n\n%% Changes in ops and precedence should be reflected on lib/elixir/lib/macro.ex\n%% Note though the operator => in practice has lower precedence than all others,\n%% its entry in the table is only to support the %{user | foo => bar} syntax.\nLeft 5 do.\nRight 10 stab_op_eol. %% ->\nLeft 20 ','.\nNonassoc 30 capture_op_eol. %% &\nLeft 40 in_match_op_eol. %% <-, \\\\ (allowed in matches along =)\nRight 50 when_op_eol. %% when\nRight 60 type_op_eol. %% ::\nRight 70 pipe_op_eol. %% |\nRight 80 assoc_op_eol. %% =>\nRight 90 match_op_eol. %% =\nLeft 130 or_op_eol. %% ||, |||, or\nLeft 140 and_op_eol. %% &&, &&&, and\nLeft 150 comp_op_eol. %% ==, !=, =~, ===, !==\nLeft 160 rel_op_eol. %% <, >, <=, >=\nLeft 170 arrow_op_eol. %% |>, <<<, >>>, ~>>, <<~, ~>, <~, <~>, <|>\nLeft 180 in_op_eol. %% in\nLeft 190 three_op_eol. %% ^^^\nRight 200 two_op_eol. %% ++, --, .., <>\nLeft 210 add_op_eol. %% +, -\nLeft 220 mult_op_eol. %% *, /\nNonassoc 300 unary_op_eol. %% +, -, !, ^, not, ~~~\nLeft 310 dot_call_op.\nLeft 310 dot_op. %% .\nNonassoc 320 at_op_eol. %% @\nNonassoc 330 dot_identifier.\n\n%%% MAIN FLOW OF EXPRESSIONS\n\ngrammar -> eoe : nil.\ngrammar -> expr_list : to_block('$1').\ngrammar -> eoe expr_list : to_block('$2').\ngrammar -> expr_list eoe : to_block('$1').\ngrammar -> eoe expr_list eoe : to_block('$2').\ngrammar -> '$empty' : nil.\n\n% Note expressions are on reverse order\nexpr_list -> expr : ['$1'].\nexpr_list -> expr_list eoe expr : ['$3'|'$1'].\n\nexpr -> matched_expr : '$1'.\nexpr -> no_parens_expr : '$1'.\nexpr -> unmatched_expr : '$1'.\n\n%% In Elixir we have three main call syntaxes: with parentheses,\n%% without parentheses and with do blocks. They are represented\n%% in the AST as matched, no_parens and unmatched.\n%%\n%% Calls without parentheses are further divided according to how\n%% problematic they are:\n%%\n%% (a) no_parens_one: a call with one unproblematic argument\n%% (e.g. `f a` or `f g a` and similar) (includes unary operators)\n%%\n%% (b) no_parens_many: a call with several arguments (e.g. `f a, b`)\n%%\n%% (c) no_parens_one_ambig: a call with one argument which is\n%% itself a no_parens_many or no_parens_one_ambig (e.g. `f g a, b`\n%% or `f g h a, b` and similar)\n%%\n%% Note, in particular, that no_parens_one_ambig expressions are\n%% ambiguous and are interpreted such that the outer function has\n%% arity 1 (e.g. `f g a, b` is interpreted as `f(g(a, b))` rather\n%% than `f(g(a), b)`). Hence the name, no_parens_one_ambig.\n%%\n%% The distinction is required because we can't, for example, have\n%% a function call with a do block as argument inside another do\n%% block call, unless there are parentheses:\n%%\n%% if if true do true else false end do #=> invalid\n%% if(if true do true else false end) do #=> valid\n%%\n%% Similarly, it is not possible to nest calls without parentheses\n%% if their arity is more than 1:\n%%\n%% foo a, bar b, c #=> invalid\n%% foo(a, bar b, c) #=> invalid\n%% foo bar a, b #=> valid\n%% foo a, bar(b, c) #=> valid\n%%\n%% So the different grammar rules need to take into account\n%% if calls without parentheses are do blocks in particular\n%% segments and act accordingly.\nmatched_expr -> matched_expr matched_op_expr : build_op(element(1, '$2'), '$1', element(2, '$2')).\nmatched_expr -> unary_op_eol matched_expr : build_unary_op('$1', '$2').\nmatched_expr -> at_op_eol matched_expr : build_unary_op('$1', '$2').\nmatched_expr -> capture_op_eol matched_expr : build_unary_op('$1', '$2').\nmatched_expr -> no_parens_one_expr : '$1'.\nmatched_expr -> no_parens_zero_expr : '$1'.\nmatched_expr -> access_expr : '$1'.\nmatched_expr -> access_expr kw_identifier : throw_invalid_kw_identifier('$2').\n\nunmatched_expr -> matched_expr unmatched_op_expr : build_op(element(1, '$2'), '$1', element(2, '$2')).\nunmatched_expr -> unmatched_expr matched_op_expr : build_op(element(1, '$2'), '$1', element(2, '$2')).\nunmatched_expr -> unmatched_expr unmatched_op_expr : build_op(element(1, '$2'), '$1', element(2, '$2')).\nunmatched_expr -> unmatched_expr no_parens_op_expr : build_op(element(1, '$2'), '$1', element(2, '$2')).\nunmatched_expr -> unary_op_eol expr : build_unary_op('$1', '$2').\nunmatched_expr -> at_op_eol expr : build_unary_op('$1', '$2').\nunmatched_expr -> capture_op_eol expr : build_unary_op('$1', '$2').\nunmatched_expr -> block_expr : '$1'.\n\nno_parens_expr -> matched_expr no_parens_op_expr : build_op(element(1, '$2'), '$1', element(2, '$2')).\nno_parens_expr -> unary_op_eol no_parens_expr : build_unary_op('$1', '$2').\nno_parens_expr -> at_op_eol no_parens_expr : build_unary_op('$1', '$2').\nno_parens_expr -> capture_op_eol no_parens_expr : build_unary_op('$1', '$2').\nno_parens_expr -> no_parens_one_ambig_expr : '$1'.\nno_parens_expr -> no_parens_many_expr : '$1'.\n\nblock_expr -> parens_call call_args_parens do_block : build_identifier('$1', '$2' ++ '$3').\nblock_expr -> parens_call call_args_parens call_args_parens do_block : build_nested_parens('$1', '$2', '$3' ++ '$4').\nblock_expr -> dot_do_identifier do_block : build_identifier('$1', '$2').\nblock_expr -> dot_identifier call_args_no_parens_all do_block : build_identifier('$1', '$2' ++ '$3').\n\nmatched_op_expr -> match_op_eol matched_expr : {'$1', '$2'}.\nmatched_op_expr -> add_op_eol matched_expr : {'$1', '$2'}.\nmatched_op_expr -> mult_op_eol matched_expr : {'$1', '$2'}.\nmatched_op_expr -> two_op_eol matched_expr : {'$1', '$2'}.\nmatched_op_expr -> three_op_eol matched_expr : {'$1', '$2'}.\nmatched_op_expr -> and_op_eol matched_expr : {'$1', '$2'}.\nmatched_op_expr -> or_op_eol matched_expr : {'$1', '$2'}.\nmatched_op_expr -> in_op_eol matched_expr : {'$1', '$2'}.\nmatched_op_expr -> in_match_op_eol matched_expr : {'$1', '$2'}.\nmatched_op_expr -> type_op_eol matched_expr : {'$1', '$2'}.\nmatched_op_expr -> when_op_eol matched_expr : {'$1', '$2'}.\nmatched_op_expr -> pipe_op_eol matched_expr : {'$1', '$2'}.\nmatched_op_expr -> comp_op_eol matched_expr : {'$1', '$2'}.\nmatched_op_expr -> rel_op_eol matched_expr : {'$1', '$2'}.\nmatched_op_expr -> arrow_op_eol matched_expr : {'$1', '$2'}.\n%% Warn for no parens subset\nmatched_op_expr -> arrow_op_eol no_parens_one_expr : warn_pipe('$1', '$2'), {'$1', '$2'}.\n\nunmatched_op_expr -> match_op_eol unmatched_expr : {'$1', '$2'}.\nunmatched_op_expr -> add_op_eol unmatched_expr : {'$1', '$2'}.\nunmatched_op_expr -> mult_op_eol unmatched_expr : {'$1', '$2'}.\nunmatched_op_expr -> two_op_eol unmatched_expr : {'$1', '$2'}.\nunmatched_op_expr -> three_op_eol unmatched_expr : {'$1', '$2'}.\nunmatched_op_expr -> and_op_eol unmatched_expr : {'$1', '$2'}.\nunmatched_op_expr -> or_op_eol unmatched_expr : {'$1', '$2'}.\nunmatched_op_expr -> in_op_eol unmatched_expr : {'$1', '$2'}.\nunmatched_op_expr -> in_match_op_eol unmatched_expr : {'$1', '$2'}.\nunmatched_op_expr -> type_op_eol unmatched_expr : {'$1', '$2'}.\nunmatched_op_expr -> when_op_eol unmatched_expr : {'$1', '$2'}.\nunmatched_op_expr -> pipe_op_eol unmatched_expr : {'$1', '$2'}.\nunmatched_op_expr -> comp_op_eol unmatched_expr : {'$1', '$2'}.\nunmatched_op_expr -> rel_op_eol unmatched_expr : {'$1', '$2'}.\nunmatched_op_expr -> arrow_op_eol unmatched_expr : {'$1', '$2'}.\n\nno_parens_op_expr -> match_op_eol no_parens_expr : {'$1', '$2'}.\nno_parens_op_expr -> add_op_eol no_parens_expr : {'$1', '$2'}.\nno_parens_op_expr -> mult_op_eol no_parens_expr : {'$1', '$2'}.\nno_parens_op_expr -> two_op_eol no_parens_expr : {'$1', '$2'}.\nno_parens_op_expr -> three_op_eol no_parens_expr : {'$1', '$2'}.\nno_parens_op_expr -> and_op_eol no_parens_expr : {'$1', '$2'}.\nno_parens_op_expr -> or_op_eol no_parens_expr : {'$1', '$2'}.\nno_parens_op_expr -> in_op_eol no_parens_expr : {'$1', '$2'}.\nno_parens_op_expr -> in_match_op_eol no_parens_expr : {'$1', '$2'}.\nno_parens_op_expr -> type_op_eol no_parens_expr : {'$1', '$2'}.\nno_parens_op_expr -> when_op_eol no_parens_expr : {'$1', '$2'}.\nno_parens_op_expr -> pipe_op_eol no_parens_expr : {'$1', '$2'}.\nno_parens_op_expr -> comp_op_eol no_parens_expr : {'$1', '$2'}.\nno_parens_op_expr -> rel_op_eol no_parens_expr : {'$1', '$2'}.\nno_parens_op_expr -> arrow_op_eol no_parens_expr : {'$1', '$2'}.\n%% Warn for no parens subset\nno_parens_op_expr -> arrow_op_eol no_parens_one_ambig_expr : warn_pipe('$1', '$2'), {'$1', '$2'}.\nno_parens_op_expr -> arrow_op_eol no_parens_many_expr : warn_pipe('$1', '$2'), {'$1', '$2'}.\n\n%% Allow when (and only when) with keywords\nno_parens_op_expr -> when_op_eol call_args_no_parens_kw : {'$1', '$2'}.\n\nno_parens_one_ambig_expr -> dot_op_identifier call_args_no_parens_ambig : build_identifier('$1', '$2').\nno_parens_one_ambig_expr -> dot_identifier call_args_no_parens_ambig : build_identifier('$1', '$2').\n\nno_parens_many_expr -> dot_op_identifier call_args_no_parens_many_strict : build_identifier('$1', '$2').\nno_parens_many_expr -> dot_identifier call_args_no_parens_many_strict : build_identifier('$1', '$2').\n\nno_parens_one_expr -> dot_op_identifier call_args_no_parens_one : build_identifier('$1', '$2').\nno_parens_one_expr -> dot_identifier call_args_no_parens_one : build_identifier('$1', '$2').\nno_parens_zero_expr -> dot_do_identifier : build_identifier('$1', nil).\nno_parens_zero_expr -> dot_identifier : build_identifier('$1', nil).\n\n%% From this point on, we just have constructs that can be\n%% used with the access syntax. Notice that (dot_)identifier\n%% is not included in this list simply because the tokenizer\n%% marks identifiers followed by brackets as bracket_identifier.\naccess_expr -> bracket_at_expr : '$1'.\naccess_expr -> bracket_expr : '$1'.\naccess_expr -> at_op_eol number : build_unary_op('$1', ?exprs('$2')).\naccess_expr -> unary_op_eol number : build_unary_op('$1', ?exprs('$2')).\naccess_expr -> capture_op_eol number : build_unary_op('$1', ?exprs('$2')).\naccess_expr -> fn_eoe stab end_eoe : build_fn('$1', reverse('$2')).\naccess_expr -> open_paren stab close_paren : build_stab(reverse('$2')).\naccess_expr -> open_paren stab ';' close_paren : build_stab(reverse('$2')).\naccess_expr -> open_paren ';' stab ';' close_paren : build_stab(reverse('$3')).\naccess_expr -> open_paren ';' stab close_paren : build_stab(reverse('$3')).\naccess_expr -> open_paren ';' close_paren : build_stab([]).\naccess_expr -> empty_paren : nil.\naccess_expr -> number : ?exprs('$1').\naccess_expr -> list : element(1, '$1').\naccess_expr -> map : '$1'.\naccess_expr -> tuple : '$1'.\naccess_expr -> 'true' : ?id('$1').\naccess_expr -> 'false' : ?id('$1').\naccess_expr -> 'nil' : ?id('$1').\naccess_expr -> bin_string : build_bin_string('$1').\naccess_expr -> list_string : build_list_string('$1').\naccess_expr -> bit_string : '$1'.\naccess_expr -> sigil : build_sigil('$1').\naccess_expr -> max_expr : '$1'.\n\n%% Aliases and properly formed calls. Used by map_expr.\nmax_expr -> atom : ?exprs('$1').\nmax_expr -> atom_safe : build_quoted_atom('$1', true).\nmax_expr -> atom_unsafe : build_quoted_atom('$1', false).\nmax_expr -> parens_call call_args_parens : build_identifier('$1', '$2').\nmax_expr -> parens_call call_args_parens call_args_parens : build_nested_parens('$1', '$2', '$3').\nmax_expr -> dot_alias : '$1'.\n\nbracket_arg -> open_bracket kw close_bracket : build_list('$1', '$2').\nbracket_arg -> open_bracket container_expr close_bracket : build_list('$1', '$2').\nbracket_arg -> open_bracket container_expr ',' close_bracket : build_list('$1', '$2').\n\nbracket_expr -> dot_bracket_identifier bracket_arg : build_access(build_identifier('$1', nil), '$2').\nbracket_expr -> access_expr bracket_arg : build_access('$1', '$2').\n\nbracket_at_expr -> at_op_eol dot_bracket_identifier bracket_arg :\n build_access(build_unary_op('$1', build_identifier('$2', nil)), '$3').\nbracket_at_expr -> at_op_eol access_expr bracket_arg :\n build_access(build_unary_op('$1', '$2'), '$3').\n\n%% Blocks\n\ndo_block -> do_eoe 'end' : [[{do, nil}]].\ndo_block -> do_eoe stab end_eoe : [[{do, build_stab(reverse('$2'))}]].\ndo_block -> do_eoe block_list 'end' : [[{do, nil}|'$2']].\ndo_block -> do_eoe stab_eoe block_list 'end' : [[{do, build_stab(reverse('$2'))}|'$3']].\n\neoe -> eol : '$1'.\neoe -> ';' : '$1'.\neoe -> eol ';' : '$1'.\n\nfn_eoe -> 'fn' : '$1'.\nfn_eoe -> 'fn' eoe : '$1'.\n\ndo_eoe -> 'do' : '$1'.\ndo_eoe -> 'do' eoe : '$1'.\n\nend_eoe -> 'end' : '$1'.\nend_eoe -> eoe 'end' : '$2'.\n\nblock_eoe -> block_identifier : '$1'.\nblock_eoe -> block_identifier eoe : '$1'.\n\nstab -> stab_expr : ['$1'].\nstab -> stab eoe stab_expr : ['$3'|'$1'].\n\nstab_eoe -> stab : '$1'.\nstab_eoe -> stab eoe : '$1'.\n\n%% Here, `element(1, Token)` is the stab operator,\n%% while `element(2, Token)` is the expression.\nstab_expr -> expr :\n '$1'.\nstab_expr -> stab_op_eol_and_expr :\n build_op(element(1, '$1'), [], element(2, '$1')).\nstab_expr -> empty_paren stab_op_eol_and_expr :\n build_op(element(1, '$2'), [], element(2, '$2')).\nstab_expr -> call_args_no_parens_all stab_op_eol_and_expr :\n build_op(element(1, '$2'), unwrap_when(unwrap_splice('$1')), element(2, '$2')).\nstab_expr -> stab_parens_many stab_op_eol_and_expr :\n build_op(element(1, '$2'), unwrap_splice('$1'), element(2, '$2')).\nstab_expr -> stab_parens_many when_op expr stab_op_eol_and_expr :\n build_op(element(1, '$4'), [{'when', meta_from_token('$2'), unwrap_splice('$1') ++ ['$3']}], element(2, '$4')).\n\nstab_op_eol_and_expr -> stab_op_eol expr : {'$1', '$2'}.\nstab_op_eol_and_expr -> stab_op_eol : warn_empty_stab_clause('$1'), {'$1', nil}.\n\nblock_item -> block_eoe stab_eoe : {?exprs('$1'), build_stab(reverse('$2'))}.\nblock_item -> block_eoe : {?exprs('$1'), nil}.\n\nblock_list -> block_item : ['$1'].\nblock_list -> block_item block_list : ['$1'|'$2'].\n\n%% Helpers\n\nopen_paren -> '(' : '$1'.\nopen_paren -> '(' eol : '$1'.\nclose_paren -> ')' : '$1'.\nclose_paren -> eol ')' : '$2'.\n\nempty_paren -> open_paren ')' : '$1'.\n\nopen_bracket -> '[' : '$1'.\nopen_bracket -> '[' eol : '$1'.\nclose_bracket -> ']' : '$1'.\nclose_bracket -> eol ']' : '$2'.\n\nopen_bit -> '<<' : '$1'.\nopen_bit -> '<<' eol : '$1'.\nclose_bit -> '>>' : '$1'.\nclose_bit -> eol '>>' : '$2'.\n\nopen_curly -> '{' : '$1'.\nopen_curly -> '{' eol : '$1'.\nclose_curly -> '}' : '$1'.\nclose_curly -> eol '}' : '$2'.\n\n% Operators\n\nadd_op_eol -> add_op : '$1'.\nadd_op_eol -> add_op eol : '$1'.\nadd_op_eol -> dual_op : '$1'.\nadd_op_eol -> dual_op eol : '$1'.\n\nmult_op_eol -> mult_op : '$1'.\nmult_op_eol -> mult_op eol : '$1'.\n\ntwo_op_eol -> two_op : '$1'.\ntwo_op_eol -> two_op eol : '$1'.\n\nthree_op_eol -> three_op : '$1'.\nthree_op_eol -> three_op eol : '$1'.\n\npipe_op_eol -> pipe_op : '$1'.\npipe_op_eol -> pipe_op eol : '$1'.\n\ncapture_op_eol -> capture_op : '$1'.\ncapture_op_eol -> capture_op eol : '$1'.\n\nunary_op_eol -> unary_op : '$1'.\nunary_op_eol -> unary_op eol : '$1'.\nunary_op_eol -> dual_op : '$1'.\nunary_op_eol -> dual_op eol : '$1'.\n\nmatch_op_eol -> match_op : '$1'.\nmatch_op_eol -> match_op eol : '$1'.\n\nand_op_eol -> and_op : '$1'.\nand_op_eol -> and_op eol : '$1'.\n\nor_op_eol -> or_op : '$1'.\nor_op_eol -> or_op eol : '$1'.\n\nin_op_eol -> in_op : '$1'.\nin_op_eol -> in_op eol : '$1'.\n\nin_match_op_eol -> in_match_op : '$1'.\nin_match_op_eol -> in_match_op eol : '$1'.\n\ntype_op_eol -> type_op : '$1'.\ntype_op_eol -> type_op eol : '$1'.\n\nwhen_op_eol -> when_op : '$1'.\nwhen_op_eol -> when_op eol : '$1'.\n\nstab_op_eol -> stab_op : '$1'.\nstab_op_eol -> stab_op eol : '$1'.\n\nat_op_eol -> at_op : '$1'.\nat_op_eol -> at_op eol : '$1'.\n\ncomp_op_eol -> comp_op : '$1'.\ncomp_op_eol -> comp_op eol : '$1'.\n\nrel_op_eol -> rel_op : '$1'.\nrel_op_eol -> rel_op eol : '$1'.\n\narrow_op_eol -> arrow_op : '$1'.\narrow_op_eol -> arrow_op eol : '$1'.\n\n% Dot operator\n\ndot_op -> '.' : '$1'.\ndot_op -> '.' eol : '$1'.\n\ndot_identifier -> identifier : '$1'.\ndot_identifier -> matched_expr dot_op identifier : build_dot('$2', '$1', '$3').\n\ndot_alias -> aliases : {'__aliases__', meta_from_token('$1', 0), ?exprs('$1')}.\ndot_alias -> matched_expr dot_op aliases : build_dot_alias('$2', '$1', '$3').\ndot_alias -> matched_expr dot_op dot_alias_container : build_dot_container('$2', '$1', '$3').\n\ndot_alias_container -> open_curly '}' : [].\ndot_alias_container -> open_curly container_args close_curly : '$2'.\n\ndot_op_identifier -> op_identifier : '$1'.\ndot_op_identifier -> matched_expr dot_op op_identifier : build_dot('$2', '$1', '$3').\n\ndot_do_identifier -> do_identifier : '$1'.\ndot_do_identifier -> matched_expr dot_op do_identifier : build_dot('$2', '$1', '$3').\n\ndot_bracket_identifier -> bracket_identifier : '$1'.\ndot_bracket_identifier -> matched_expr dot_op bracket_identifier : build_dot('$2', '$1', '$3').\n\ndot_paren_identifier -> paren_identifier : '$1'.\ndot_paren_identifier -> matched_expr dot_op paren_identifier : build_dot('$2', '$1', '$3').\n\nparens_call -> dot_paren_identifier : '$1'.\nparens_call -> matched_expr dot_call_op : {'.', meta_from_token('$2'), ['$1']}. % Fun/local calls\n\n% Function calls with no parentheses\n\ncall_args_no_parens_expr -> matched_expr : '$1'.\ncall_args_no_parens_expr -> no_parens_expr : throw_no_parens_many_strict('$1').\n\ncall_args_no_parens_comma_expr -> matched_expr ',' call_args_no_parens_expr : ['$3', '$1'].\ncall_args_no_parens_comma_expr -> call_args_no_parens_comma_expr ',' call_args_no_parens_expr : ['$3'|'$1'].\n\ncall_args_no_parens_all -> call_args_no_parens_one : '$1'.\ncall_args_no_parens_all -> call_args_no_parens_ambig : '$1'.\ncall_args_no_parens_all -> call_args_no_parens_many : '$1'.\n\ncall_args_no_parens_one -> call_args_no_parens_kw : ['$1'].\ncall_args_no_parens_one -> matched_expr : ['$1'].\n\ncall_args_no_parens_ambig -> no_parens_expr : ['$1'].\n\ncall_args_no_parens_many -> matched_expr ',' call_args_no_parens_kw : ['$1', '$3'].\ncall_args_no_parens_many -> call_args_no_parens_comma_expr : reverse('$1').\ncall_args_no_parens_many -> call_args_no_parens_comma_expr ',' call_args_no_parens_kw : reverse(['$3'|'$1']).\n\ncall_args_no_parens_many_strict -> call_args_no_parens_many : '$1'.\ncall_args_no_parens_many_strict -> open_paren call_args_no_parens_kw close_paren : throw_no_parens_strict('$1').\ncall_args_no_parens_many_strict -> open_paren call_args_no_parens_many close_paren : throw_no_parens_strict('$1').\n\nstab_parens_many -> open_paren call_args_no_parens_kw close_paren : ['$2'].\nstab_parens_many -> open_paren call_args_no_parens_many close_paren : '$2'.\n\n% Containers\n\ncontainer_expr -> matched_expr : '$1'.\ncontainer_expr -> unmatched_expr : '$1'.\ncontainer_expr -> no_parens_expr : throw_no_parens_container_strict('$1').\n\ncontainer_args_base -> container_expr : ['$1'].\ncontainer_args_base -> container_args_base ',' container_expr : ['$3'|'$1'].\n\ncontainer_args -> container_args_base : lists:reverse('$1').\ncontainer_args -> container_args_base ',' : lists:reverse('$1').\ncontainer_args -> container_args_base ',' kw : lists:reverse(['$3'|'$1']).\n\n% Function calls with parentheses\n\ncall_args_parens_expr -> matched_expr : '$1'.\ncall_args_parens_expr -> unmatched_expr : '$1'.\ncall_args_parens_expr -> no_parens_expr : throw_no_parens_many_strict('$1').\n\ncall_args_parens_base -> call_args_parens_expr : ['$1'].\ncall_args_parens_base -> call_args_parens_base ',' call_args_parens_expr : ['$3'|'$1'].\n\ncall_args_parens -> empty_paren : [].\ncall_args_parens -> open_paren no_parens_expr close_paren : ['$2'].\ncall_args_parens -> open_paren kw close_paren : ['$2'].\ncall_args_parens -> open_paren call_args_parens_base close_paren : reverse('$2').\ncall_args_parens -> open_paren call_args_parens_base ',' kw close_paren : reverse(['$4'|'$2']).\n\n% KV\n\nkw_eol -> kw_identifier : ?exprs('$1').\nkw_eol -> kw_identifier eol : ?exprs('$1').\nkw_eol -> kw_identifier_safe : build_quoted_atom('$1', true).\nkw_eol -> kw_identifier_safe eol : build_quoted_atom('$1', true).\nkw_eol -> kw_identifier_unsafe : build_quoted_atom('$1', false).\nkw_eol -> kw_identifier_unsafe eol : build_quoted_atom('$1', false).\n\nkw_base -> kw_eol container_expr : [{'$1', '$2'}].\nkw_base -> kw_base ',' kw_eol container_expr : [{'$3', '$4'}|'$1'].\n\nkw -> kw_base : reverse('$1').\nkw -> kw_base ',' : reverse('$1').\n\ncall_args_no_parens_kw_expr -> kw_eol matched_expr : {'$1', '$2'}.\ncall_args_no_parens_kw_expr -> kw_eol no_parens_expr : {'$1', '$2'}.\n\ncall_args_no_parens_kw -> call_args_no_parens_kw_expr : ['$1'].\ncall_args_no_parens_kw -> call_args_no_parens_kw_expr ',' call_args_no_parens_kw : ['$1'|'$3'].\n\n% Lists\n\nlist_args -> kw : '$1'.\nlist_args -> container_args_base : reverse('$1').\nlist_args -> container_args_base ',' : reverse('$1').\nlist_args -> container_args_base ',' kw : reverse('$1', '$3').\n\nlist -> open_bracket ']' : build_list('$1', []).\nlist -> open_bracket list_args close_bracket : build_list('$1', '$2').\n\n% Tuple\n\ntuple -> open_curly '}' : build_tuple('$1', []).\ntuple -> open_curly container_args close_curly : build_tuple('$1', '$2').\n\n% Bitstrings\n\nbit_string -> open_bit '>>' : build_bit('$1', []).\nbit_string -> open_bit container_args close_bit : build_bit('$1', '$2').\n\n% Map and structs\n\n%% Allow unquote/@something/aliases inside maps and structs.\nmap_expr -> max_expr : '$1'.\nmap_expr -> dot_identifier : build_identifier('$1', nil).\nmap_expr -> at_op_eol map_expr : build_unary_op('$1', '$2').\n\nassoc_op_eol -> assoc_op : '$1'.\nassoc_op_eol -> assoc_op eol : '$1'.\n\nassoc_expr -> matched_expr assoc_op_eol matched_expr : {'$1', '$3'}.\nassoc_expr -> unmatched_expr assoc_op_eol unmatched_expr : {'$1', '$3'}.\nassoc_expr -> matched_expr assoc_op_eol unmatched_expr : {'$1', '$3'}.\nassoc_expr -> unmatched_expr assoc_op_eol matched_expr : {'$1', '$3'}.\nassoc_expr -> map_expr : '$1'.\n\nassoc_update -> matched_expr pipe_op_eol assoc_expr : {'$2', '$1', ['$3']}.\nassoc_update -> unmatched_expr pipe_op_eol assoc_expr : {'$2', '$1', ['$3']}.\n\nassoc_update_kw -> matched_expr pipe_op_eol kw : {'$2', '$1', '$3'}.\nassoc_update_kw -> unmatched_expr pipe_op_eol kw : {'$2', '$1', '$3'}.\n\nassoc_base -> assoc_expr : ['$1'].\nassoc_base -> assoc_base ',' assoc_expr : ['$3'|'$1'].\n\nassoc -> assoc_base : reverse('$1').\nassoc -> assoc_base ',' : reverse('$1').\n\nmap_op -> '%{}' : '$1'.\nmap_op -> '%{}' eol : '$1'.\n\nmap_close -> kw close_curly : '$1'.\nmap_close -> assoc close_curly : '$1'.\nmap_close -> assoc_base ',' kw close_curly : reverse('$1', '$3').\n\nmap_args -> open_curly '}' : build_map('$1', []).\nmap_args -> open_curly map_close : build_map('$1', '$2').\nmap_args -> open_curly assoc_update close_curly : build_map_update('$1', '$2', []).\nmap_args -> open_curly assoc_update ',' close_curly : build_map_update('$1', '$2', []).\nmap_args -> open_curly assoc_update ',' map_close : build_map_update('$1', '$2', '$4').\nmap_args -> open_curly assoc_update_kw close_curly : build_map_update('$1', '$2', []).\n\nstruct_op -> '%' : '$1'.\n\nmap -> map_op map_args : '$2'.\nmap -> struct_op map_expr map_args : {'%', meta_from_token('$1'), ['$2', '$3']}.\nmap -> struct_op map_expr eol map_args : {'%', meta_from_token('$1'), ['$2', '$4']}.\n\nErlang code.\n\n-define(file(), get(elixir_parser_file)).\n-define(id(Token), element(1, Token)).\n-define(location(Token), element(2, Token)).\n-define(exprs(Token), element(3, Token)).\n-define(meta(Node), element(2, Node)).\n-define(rearrange_uop(Op), (Op == 'not' orelse Op == '!')).\n\n%% The following directive is needed for (significantly) faster\n%% compilation of the generated .erl file by the HiPE compiler\n-compile([{hipe, [{regalloc, linear_scan}]}]).\n-import(lists, [reverse/1, reverse/2]).\n\nmeta_from_token(Token, Counter) -> [{counter, Counter}|meta_from_token(Token)].\nmeta_from_token(Token) -> meta_from_location(?location(Token)).\n\nmeta_from_location({Line, Column, EndColumn})\n when is_integer(Line), is_integer(Column), is_integer(EndColumn) -> [{line, Line}].\n\n%% Operators\n\nbuild_op({_Kind, Location, 'in'}, {UOp, _, [Left]}, Right) when ?rearrange_uop(UOp) ->\n {UOp, meta_from_location(Location), [{'in', meta_from_location(Location), [Left, Right]}]};\n\nbuild_op({_Kind, Location, Op}, Left, Right) ->\n {Op, meta_from_location(Location), [Left, Right]}.\n\nbuild_unary_op({_Kind, Location, Op}, Expr) ->\n {Op, meta_from_location(Location), [Expr]}.\n\nbuild_list(Marker, Args) ->\n {Args, ?location(Marker)}.\n\nbuild_tuple(_Marker, [Left, Right]) ->\n {Left, Right};\nbuild_tuple(Marker, Args) ->\n {'{}', meta_from_token(Marker), Args}.\n\nbuild_bit(Marker, Args) ->\n {'<<>>', meta_from_token(Marker), Args}.\n\nbuild_map(Marker, Args) ->\n {'%{}', meta_from_token(Marker), Args}.\n\nbuild_map_update(Marker, {Pipe, Left, Right}, Extra) ->\n {'%{}', meta_from_token(Marker), [build_op(Pipe, Left, Right ++ Extra)]}.\n\n%% Blocks\n\nbuild_block([{Op, _, [_]}]=Exprs) when ?rearrange_uop(Op) -> {'__block__', [], Exprs};\nbuild_block([{unquote_splicing, _, Args}]=Exprs) when\n length(Args) =< 2 -> {'__block__', [], Exprs};\nbuild_block([Expr]) -> Expr;\nbuild_block(Exprs) -> {'__block__', [], Exprs}.\n\n%% Dots\n\nbuild_dot_alias(Dot, {'__aliases__', _, Left}, {'aliases', _, Right}) ->\n {'__aliases__', meta_from_token(Dot), Left ++ Right};\n\nbuild_dot_alias(_Dot, Atom, {'aliases', _, _} = Token) when is_atom(Atom) ->\n throw_bad_atom(Token);\n\nbuild_dot_alias(Dot, Other, {'aliases', _, Right}) ->\n {'__aliases__', meta_from_token(Dot), [Other|Right]}.\n\nbuild_dot_container(Dot, Left, Right) ->\n Meta = meta_from_token(Dot),\n {{'.', Meta, [Left, '{}']}, Meta, Right}.\n\nbuild_dot(Dot, Left, Right) ->\n {'.', meta_from_token(Dot), [Left, extract_identifier(Right)]}.\n\nextract_identifier({Kind, _, Identifier}) when\n Kind == identifier; Kind == bracket_identifier; Kind == paren_identifier;\n Kind == do_identifier; Kind == op_identifier ->\n Identifier.\n\n%% Identifiers\n\nbuild_nested_parens(Dot, Args1, Args2) ->\n Identifier = build_identifier(Dot, Args1),\n Meta = ?meta(Identifier),\n {Identifier, Meta, Args2}.\n\nbuild_identifier({'.', Meta, _} = Dot, Args) ->\n FArgs = case Args of\n nil -> [];\n _ -> Args\n end,\n {Dot, Meta, FArgs};\n\nbuild_identifier({op_identifier, Location, Identifier}, [Arg]) ->\n {Identifier, [{ambiguous_op, nil}|meta_from_location(Location)], [Arg]};\n\nbuild_identifier({_, Location, Identifier}, Args) ->\n {Identifier, meta_from_location(Location), Args}.\n\n%% Fn\n\nbuild_fn(Op, [{'->', _, [_, _]}|_] = Stab) ->\n {fn, meta_from_token(Op), build_stab(Stab)};\nbuild_fn(Op, _Stab) ->\n throw(meta_from_token(Op), \"expected clauses to be defined with -> inside: \", \"'fn'\").\n\n%% Access\n\nbuild_access(Expr, {List, Location}) ->\n Meta = meta_from_location(Location),\n {{'.', Meta, ['Elixir.Access', get]}, Meta, [Expr, List]}.\n\n%% Interpolation aware\n\nbuild_sigil({sigil, Location, Sigil, Parts, Modifiers}) ->\n Meta = meta_from_location(Location),\n {list_to_atom(\"sigil_\" ++ [Sigil]), Meta, [{'<<>>', Meta, string_parts(Parts)}, Modifiers]}.\n\nbuild_bin_string({bin_string, _Location, [H]}) when is_binary(H) ->\n H;\nbuild_bin_string({bin_string, Location, Args}) ->\n {'<<>>', meta_from_location(Location), string_parts(Args)}.\n\nbuild_list_string({list_string, _Location, [H]}) when is_binary(H) ->\n elixir_utils:characters_to_list(H);\nbuild_list_string({list_string, Location, Args}) ->\n Meta = meta_from_location(Location),\n {{'.', Meta, ['Elixir.String', to_char_list]}, Meta, [{'<<>>', Meta, string_parts(Args)}]}.\n\nbuild_quoted_atom({_, _Location, [H]}, Safe) when is_binary(H) ->\n Op = binary_to_atom_op(Safe), erlang:Op(H, utf8);\nbuild_quoted_atom({_, Location, Args}, Safe) ->\n Meta = meta_from_location(Location),\n {{'.', Meta, [erlang, binary_to_atom_op(Safe)]}, Meta, [{'<<>>', Meta, string_parts(Args)}, utf8]}.\n\nbinary_to_atom_op(true) -> binary_to_existing_atom;\nbinary_to_atom_op(false) -> binary_to_atom.\n\nstring_parts(Parts) ->\n [string_part(Part) || Part <- Parts].\nstring_part(Binary) when is_binary(Binary) ->\n Binary;\nstring_part({Location, Tokens}) ->\n Form = string_tokens_parse(Tokens),\n Meta = meta_from_location(Location),\n {'::', Meta, [{{'.', Meta, ['Elixir.Kernel', to_string]}, Meta, [Form]}, {binary, Meta, nil}]}.\n\nstring_tokens_parse(Tokens) ->\n case parse(Tokens) of\n {ok, Forms} -> Forms;\n {error, _} = Error -> throw(Error)\n end.\n\n%% Keywords\n\nbuild_stab([{'->', Meta, [Left, Right]}|T]) ->\n build_stab(Meta, T, Left, [Right], []);\n\nbuild_stab(Else) ->\n build_block(Else).\n\nbuild_stab(Old, [{'->', New, [Left, Right]}|T], Marker, Temp, Acc) ->\n H = {'->', Old, [Marker, build_block(reverse(Temp))]},\n build_stab(New, T, Left, [Right], [H|Acc]);\n\nbuild_stab(Meta, [H|T], Marker, Temp, Acc) ->\n build_stab(Meta, T, Marker, [H|Temp], Acc);\n\nbuild_stab(Meta, [], Marker, Temp, Acc) ->\n H = {'->', Meta, [Marker, build_block(reverse(Temp))]},\n reverse([H|Acc]).\n\n%% Every time the parser sees a (unquote_splicing())\n%% it assumes that a block is being spliced, wrapping\n%% the splicing in a __block__. But in the stab clause,\n%% we can have (unquote_splicing(1, 2, 3)) -> :ok, in such\n%% case, we don't actually want the block, since it is\n%% an arg style call. unwrap_splice unwraps the splice\n%% from such blocks.\nunwrap_splice([{'__block__', [], [{unquote_splicing, _, _}] = Splice}]) ->\n Splice;\n\nunwrap_splice(Other) -> Other.\n\nunwrap_when(Args) ->\n case elixir_utils:split_last(Args) of\n {Start, {'when', Meta, [_, _] = End}} ->\n [{'when', Meta, Start ++ End}];\n {_, _} ->\n Args\n end.\n\nto_block([One]) -> One;\nto_block(Other) -> {'__block__', [], reverse(Other)}.\n\n%% Warnings and errors\n\nthrow(Meta, Error, Token) ->\n Line =\n case lists:keyfind(line, 1, Meta) of\n {line, L} -> L;\n false -> 0\n end,\n throw({error, {Line, ?MODULE, [Error, Token]}}).\n\nthrow_bad_atom(Token) ->\n throw(meta_from_token(Token), \"atom cannot be followed by an alias. If the '.' was meant to be \"\n \"part of the atom's name, the atom name must be quoted. Syntax error before: \", \"'.'\").\n\nthrow_no_parens_strict(Token) ->\n throw(meta_from_token(Token), \"unexpected parentheses. If you are making a \"\n \"function call, do not insert spaces between the function name and the \"\n \"opening parentheses. Syntax error before: \", \"'('\").\n\nthrow_no_parens_many_strict(Node) ->\n throw(?meta(Node),\n \"unexpected comma. Parentheses are required to solve ambiguity in nested calls.\\n\\n\"\n \"This error happens when you have nested function calls without parentheses. \"\n \"For example:\\n\\n\"\n \" one a, two b, c, d\\n\\n\"\n \"In the example above, we don't know if the parameters \\\"c\\\" and \\\"d\\\" apply \"\n \"to the function \\\"one\\\" or \\\"two\\\". You can solve this by explicitly adding \"\n \"parentheses:\\n\\n\"\n \" one a, two(b, c, d)\\n\\n\"\n \"Elixir cannot compile otherwise. Syntax error before: \", \"','\").\n\nthrow_no_parens_container_strict(Node) ->\n throw(?meta(Node),\n \"unexpected comma. Parentheses are required to solve ambiguity inside containers.\\n\\n\"\n \"This error may happen when you forget a comma in a list or other container:\\n\\n\"\n \" [a, b c, d]\\n\\n\"\n \"Or when you have ambiguous calls:\\n\\n\"\n \" [one, two three, four, five]\\n\\n\"\n \"In the example above, we don't know if the parameters \\\"four\\\" and \\\"five\\\" \"\n \"belongs to the list or the function \\\"two\\\". You can solve this by explicitly \"\n \"adding parentheses:\\n\\n\"\n \" [one, two(three, four), five]\\n\\n\"\n \"Elixir cannot compile otherwise. Syntax error before: \", \"','\").\n\nthrow_invalid_kw_identifier({_, _, do} = Token) ->\n throw(meta_from_token(Token), elixir_tokenizer:invalid_do_error(\"unexpected keyword \\\"do:\\\"\"), \"'do:'\");\nthrow_invalid_kw_identifier({_, _, KW} = Token) ->\n throw(meta_from_token(Token), \"syntax error before: \", \"'\" ++ atom_to_list(KW) ++ \"':\").\n\n%% TODO: Make those warnings errors.\nwarn_empty_stab_clause({stab_op, {Line, _Begin, _End}, '->'}) ->\n elixir_errors:warn(Line, ?file(),\n \"an expression is always required on the right side of ->. \"\n \"Please provide a value after ->\").\n\nwarn_pipe({arrow_op, {Line, _Begin, _End}, Op}, {_, [_|_], [_|_]}) ->\n elixir_errors:warn(Line, ?file(),\n io_lib:format(\n \"you are piping into a function call without parentheses, which may be ambiguous. \"\n \"Please wrap the function you are piping into in parentheses. For example:\\n\\n\"\n \" foo 1 ~ts bar 2 ~ts baz 3\\n\\n\"\n \"Should be written as:\\n\\n\"\n \" foo(1) ~ts bar(2) ~ts baz(3)\\n\",\n [Op, Op, Op, Op]\n )\n );\nwarn_pipe(_Token, _) ->\n ok.\n" }, { "path": "src/test/resources/samples/langs/Erlang/factorial", "content": "#!/usr/bin/env escript\n%% -*- erlang -*-\n%%! -smp enable -sname factorial -mnesia debug verbose\nmain([String]) ->\n try\n N = list_to_integer(String),\n F = fac(N),\n io:format(\"factorial ~w = ~w\\n\", [N,F])\n catch\n _:_ ->\n usage()\n end;\nmain(_) ->\n usage().\n\nusage() ->\n io:format(\"usage: factorial integer\\n\"),\n halt(1).\n\nfac(0) -> 1;\nfac(N) -> N * fac(N-1).\n" }, { "path": "src/test/resources/samples/langs/Erlang/filenames/Emakefile", "content": "{\"src/*\", [\n report, \n verbose, \n {i, \"include\"}, \n {outdir, \"ebin\"},\n debug_info \n]}.\n" }, { "path": "src/test/resources/samples/langs/Erlang/filenames/rebar.config", "content": "%% -*- mode: erlang;erlang-indent-level: 4;indent-tabs-mode: nil -*-\n%% ex: ts=4 sw=4 ft=erlang et\n%% This is a sample rebar.conf file that shows examples of some of rebar's\n%% options.\n\n%% == Core ==\n\n%% Extend list of always recursive commands\n{recursive_cmds, []}.\n\n%% Check required ERTS or OTP release version\n{require_erts_vsn, \".*\"}.\n{require_otp_vsn, \".*\"}.\n{require_min_otp_vsn, \".*\"}.\n\n%% Additional library directories to add to the code path\n{lib_dirs, []}.\n\n%% == Erlang Compiler ==\n\n%% Erlang files to compile before the rest. Rebar automatically compiles\n%% parse_transforms and custom behaviours before anything other than the files\n%% in this list.\n{erl_first_files, [\"src/mymib1.erl\", \"src/mymib2.erl\"]}.\n\n%% Erlang compiler options\n{erl_opts, [no_debug_info,\n {i, \"myinclude\"},\n {src_dirs, [\"src\", \"src2\", \"src3\"]},\n {platform_define,\n \"(linux|solaris|freebsd|darwin)\", 'HAVE_SENDFILE'},\n {platform_define, \"(linux|freebsd)\", 'BACKLOG', 128},\n {platform_define, \"R13\", 'old_inets'}]}.\n\n%% MIB Options?\n{mib_opts, []}.\n\n%% SNMP mibs to compile first?\n{mib_first_files, []}.\n\n%% leex options\n{xrl_opts, []}.\n\n%% leex files to compile first\n{xrl_first_files, []}.\n\n%% yecc options\n{yrl_opts, []}.\n\n%% yecc files to compile first\n{yrl_first_files, []}.\n\n%% == EDoc ==\n\n%% EDoc options\n{edoc_opts, []}.\n\n%% == Port Compiler ==\n\n%% Port compilation environment variables. See rebar_port_compiler.erl for\n%% more info. Default is `[]'\n{port_env, [{\"CFLAGS\", \"$CFLAGS -Ifoo\"},\n {\"freebsd\", \"LDFLAGS\", \"$LDFLAGS -lfoo\"}]}.\n\n%% port_specs\n%% List of filenames or wildcards to be compiled. May also contain a tuple\n%% consisting of a regular expression to be applied against the system\n%% architecture as a filter.\n{port_specs, [{\"priv/so_name.so\", [\"c_src/*.c\"]},\n {\"linux\", \"priv/hello_linux\", [\"c_src/hello_linux.c\"]},\n {\"linux\", \"priv/hello_linux\", [\"c_src/*.c\"], [{env, []}]}]}.\n\n%% == escriptize ==\n{escript_name, \"application\"}.\n{escript_incl_apps, []}.\n{escript_shebang, \"#!/usr/bin/env escript\\n\"}.\n{escript_comment, \"%%\\n\"}.\n{escript_emu_args, \"%%! -pa application/application/ebin\\n\"}.\n\n%% == LFE Compiler ==\n\n%% LFE files to compile before the rest\n{lfe_first_files, []}.\n\n%% Options for the LFE compiler: reuse {erl_opts, []}\n\n%% == ErlyDTL Compiler ==\n\n%% Options for the ErlyDTL compiler\n{erlydtl_opts, []}.\n\n%% == Proto compiler ==\n{proto_opts, [\n {compiler, protobuffs},\n {src_dirs, [\"src\"]}\n]}.\n%% Available compilers for protocol buffer files (*.proto):\n%% protobuffs (default)\n%% gpb\n%% Optional src_dirs which is a list of directories where\n%% to look for .proto files, default is src\n\n%% Options for the gpb protocol buffer compiler,\n%% if selected by the proto_compiler option\n{gpb_opts, []}.\n\n%% == EUnit ==\n\n%% Options for eunit:test()\n{eunit_opts, []}.\n\n%% Additional compile options for eunit. erl_opts is also used\n{eunit_compile_opts, []}.\n\n%% Same as erl_first_files, but used only when running 'eunit'\n{eunit_first_files, []}.\n\n%% == Cover ==\n\n%% Whether to enable coverage reporting. Default is `false'\n{cover_enabled, false}.\n\n%% Whether to print coverage report to console. Default is `false'\n{cover_print_enabled, false}.\n\n%% Whether to export coverage report to file. Default is `false'\n{cover_export_enabled, false}.\n\n%% == Common Test ==\n\n%% Override the default \"test\" directory in which SUITEs are located\n{ct_dir, \"itest\"}.\n\n%% Override the default \"logs\" directory in which SUITEs are logged\n{ct_log_dir, \"test/logs\"}.\n\n%% Option to pass extra parameters when launching Common Test\n{ct_extra_params, \"-boot start_sasl -s myapp\"}.\n\n%% Option to use short names (i.e., -sname test) when starting ct\n{ct_use_short_names, true}.\n\n%% == QuickCheck ==\n\n%% If qc_mod is unspecified, rebar tries to detect Triq or EQC\n{qc_opts, [{qc_mod, module()}, Options]}.\n\n%% Additional compile options for qc. erl_opts is also used\n{qc_compile_opts, []}.\n\n%% Same as erl_first_files, but used only when running 'qc'\n{qc_first_files, []}.\n\n%% == Cleanup ==\n\n%% Which files to cleanup\n{clean_files, [\"file\", \"file2\"]}.\n\n%% == OTP Applications ==\n\n%% Enable validation of the OTP app module list. Default is 'true'\n{validate_app_modules, true}.\n\n%% == Dependencies ==\n\n%% Where to put any downloaded dependencies. Default is \"deps\"\n{deps_dir, \"deps\"}.\n\n%% What dependencies we have, dependencies can be of 3 forms, an application\n%% name as an atom, eg. mochiweb, a name and a version (from the .app file), or\n%% an application name, a version and the SCM details on how to fetch it (SCM\n%% type, location and revision).\n%% Rebar currently supports git, hg, bzr, svn, rsync, fossil, and p4.\n{deps, [app_name,\n {rebar, \"1.0.*\"},\n {rebar, \".*\",\n {git, \"git://github.com/rebar/rebar.git\"}},\n {rebar, \".*\",\n {git, \"git://github.com/rebar/rebar.git\", \"Rev\"}},\n {rebar, \"1.0.*\",\n {git, \"git://github.com/rebar/rebar.git\", {branch, \"master\"}}},\n {rebar, \"1.0.0\",\n {git, \"git://github.com/rebar/rebar.git\", {tag, \"1.0.0\"}}},\n %% Dependencies can be marked as 'raw'. Rebar does not require\n %% such dependencies to have a standard Erlang/OTP layout\n %% which assumes the presence of either\n %% \"src/dependency_name.app.src\" or \"ebin/dependency_name.app\"\n %% files.\n %%\n %% 'raw' dependencies can still contain 'rebar.config' and\n %% even can have the proper OTP directory layout, but they\n %% won't be compiled.\n %%\n %% Only a subset of rebar commands will be executed on the\n %% 'raw' subdirectories: get-deps, update-deps, check-deps,\n %% list-deps and delete-deps.\n {rebar, \"\",\n {git, \"git://github.com/rebar/rebar.git\", {branch, \"master\"}},\n [raw]},\n {app_name, \".*\", {hg, \"https://www.example.org/url\"}},\n {app_name, \".*\", {rsync, \"Url\"}},\n {app_name, \".*\", {svn, \"https://www.example.org/url\"}},\n {app_name, \".*\", {svn, \"svn://svn.example.org/url\"}},\n {app_name, \".*\", {bzr, \"https://www.example.org/url\", \"Rev\"}},\n {app_name, \".*\", {fossil, \"https://www.example.org/url\"}},\n {app_name, \".*\", {fossil, \"https://www.example.org/url\", \"Vsn\"}},\n {app_name, \".*\", {p4, \"//depot/subdir/app_dir\"}}]}.\n\n%% == Subdirectories ==\n\n%% Subdirectories?\n{sub_dirs, [\"dir1\", \"dir2\"]}.\n\n%% == Plugins ==\n\n%% Plugins you wish to include.\n%% These can include any module on the code path, including deps.\n%% Alternatively, plugins can be placed as source files in the plugin_dir, in\n%% which case they will be compiled and loaded dynamically at runtime.\n{plugins, [plugin1, plugin2]}.\n\n%% Override the directory in which plugin sources can be found.\n%% Defaults to ./plugins\n{plugin_dir, \"some_other_directory\"}.\n\n\n%% == Pre/Post Command Hooks ==\n\n{pre_hooks, [{clean, \"./prepare_package_files.sh\"},\n {\"linux\", compile, \"c_src/build_linux.sh\"},\n {compile, \"escript generate_headers\"},\n {compile, \"escript check_headers\"}]}.\n\n{post_hooks, [{clean, \"touch file1.out\"},\n {\"freebsd\", compile, \"c_src/freebsd_tweaks.sh\"},\n {eunit, \"touch file2.out\"},\n {compile, \"touch postcompile.out\"}]}.\n\n%% == xref ==\n\n{xref_warnings, false}.\n\n%% optional extra paths to include in xref:set_library_path/2.\n%% specified relative location of rebar.config.\n%% e.g. {xref_extra_paths,[\"../gtknode/src\"]}\n{xref_extra_paths,[]}.\n\n%% xref checks to run\n{xref_checks, [undefined_function_calls, undefined_functions,\n locals_not_used, exports_not_used,\n deprecated_function_calls, deprecated_functions]}.\n\n%% Optional custom xref queries (xref manual has details) specified as\n%% {xref_queries, [{query_string(), expected_query_result()},...]}\n%% The following for example removes all references to mod:*foo/4\n%% functions from undefined external function calls as those are in a\n%% generated module\n{xref_queries,\n [{\"(XC - UC) || (XU - X - B\"\n \" - (\\\"mod\\\":\\\".*foo\\\"/\\\"4\\\"))\",[]}]}.\n" }, { "path": "src/test/resources/samples/langs/Erlang/hello.escript", "content": "#!/usr/bin/env escript\n-export([main/1]).\n\nmain([]) -> io:format(\"Hello, World!~n\").\n" }, { "path": "src/test/resources/samples/langs/Erlang/lfe_scan.xrl", "content": "%% Copyright (c) 2008-2013 Robert Virding\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%% File : lfe_scan.xrl\n%% Author : Robert Virding\n%% Purpose : Token definitions for Lisp Flavoured Erlang.\n\nDefinitions.\nB = [01]\nO = [0-7]\nD = [0-9]\nH = [0-9a-fA-F]\nB36 = [0-9a-zA-Z]\nU = [A-Z]\nL = [a-z]\nA = ({U}|{L})\nDEL = [][()}{\";\\000-\\s]\nSYM = [^][()}{\";\\000-\\s\\177-\\237]\nSSYM = [^][()}{\"|;#`',\\000-\\s\\177-\\237]\nWS = ([\\000-\\s]|;[^\\n]*)\n\nRules.\n%% Bracketed Comments using #| foo |#\n#{D}*\\|[^\\|]*\\|+([^#\\|][^\\|]*\\|+)*# :\n block_comment(string:substr(TokenChars, 3)).\n\n%% Separators\n' : {token,{'\\'',TokenLine}}.\n` : {token,{'`',TokenLine}}.\n, : {token,{',',TokenLine}}.\n,@ : {token,{',@',TokenLine}}.\n\\. : {token,{'.',TokenLine}}.\n[][()}{] : {token,{list_to_atom(TokenChars),TokenLine}}.\n\n#{D}*[bB]\\( : {token,{'#B(',TokenLine}}.\n#{D}*[mM]\\( : {token,{'#M(',TokenLine}}.\n#{D}*\\( : {token,{'#(',TokenLine}}.\n#{D}*\\. : {token,{'#.',TokenLine}}.\n\n#{D}*` : {token,{'#`',TokenLine}}.\n#{D}*; : {token,{'#;',TokenLine}}.\n#{D}*, : {token,{'#,',TokenLine}}.\n#{D}*,@ : {token,{'#,@',TokenLine}}.\n\n%% Characters\n#{D}*\\\\(x{H}+|.) : char_token(skip_past(TokenChars, $\\\\, $\\\\), TokenLine).\n\n%% Based numbers\n#{D}*\\*{SYM}+ : base_token(skip_past(TokenChars, $*, $*), 2, TokenLine).\n#{D}*[bB]{SYM}+ : base_token(skip_past(TokenChars, $b, $B), 2, TokenLine).\n#{D}*[oO]{SYM}+ : base_token(skip_past(TokenChars, $o, $O), 8, TokenLine).\n#{D}*[dD]{SYM}+ : base_token(skip_past(TokenChars, $d, $D), 10, TokenLine).\n#{D}*[xX]{SYM}+ : base_token(skip_past(TokenChars, $x, $X), 16, TokenLine).\n#{D}*[rR]{SYM}+ :\n %% Scan over digit chars to get base.\n {Base,[_|Ds]} = base1(tl(TokenChars), 10, 0),\n base_token(Ds, Base, TokenLine).\n\n%% String\n\"(\\\\x{H}+;|\\\\.|[^\"\\\\])*\" :\n %% Strip quotes.\n S = string:substr(TokenChars, 2, TokenLen - 2),\n {token,{string,TokenLine,chars(S)}}.\n%% Binary string\n#\"(\\\\x{H}+;|\\\\.|[^\"\\\\])*\" :\n %% Strip quotes.\n S = string:substr(TokenChars, 3, TokenLen - 3),\n Bin = unicode:characters_to_binary(chars(S), utf8, utf8),\n {token,{binary,TokenLine,Bin}}.\n%% Symbols\n\\|(\\\\x{H}+;|\\\\.|[^|\\\\])*\\| :\n %% Strip quotes.\n S = string:substr(TokenChars, 2, TokenLen - 2),\n symbol_token(chars(S), TokenLine).\n%% Funs\n#'{SSYM}{SYM}*/{D}+ :\n %% Strip sharpsign single-quote.\n FunStr = string:substr(TokenChars,3),\n {token,{'#\\'',TokenLine,FunStr}}.\n%% Atoms\n[+-]?{D}+ :\n case catch {ok,list_to_integer(TokenChars)} of\n {ok,I} -> {token,{number,TokenLine,I}};\n _ -> {error,\"illegal integer\"}\n end.\n[+-]?{D}+\\.{D}+([eE][+-]?{D}+)? :\n case catch {ok,list_to_float(TokenChars)} of\n {ok,F} -> {token,{number,TokenLine,F}};\n _ -> {error,\"illegal float\"}\n end.\n{SSYM}{SYM}* :\n symbol_token(TokenChars, TokenLine).\n{WS}+ : skip_token.\n\nErlang code.\n%% Copyright (c) 2008-2013 Robert Virding\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%% File : lfe_scan.erl\n%% Author : Robert Virding\n%% Purpose : Token definitions for Lisp Flavoured Erlang.\n\n-export([start_symbol_char/1,symbol_char/1]).\n\n-import(string, [substr/2,substr/3]).\n\n%% start_symbol_char(Char) -> true | false.\n%% symbol_char(Char) -> true | false.\n%% Define start symbol chars and symbol chars.\n\nstart_symbol_char($#) -> false;\nstart_symbol_char($`) -> false;\nstart_symbol_char($') -> false; %'\nstart_symbol_char($,) -> false;\nstart_symbol_char($|) -> false; %Symbol quote character\nstart_symbol_char(C) -> symbol_char(C).\n\nsymbol_char($() -> false;\nsymbol_char($)) -> false;\nsymbol_char($[) -> false;\nsymbol_char($]) -> false;\nsymbol_char(${) -> false;\nsymbol_char($}) -> false;\nsymbol_char($\") -> false;\nsymbol_char($;) -> false;\nsymbol_char(C) -> ((C > $\\s) and (C =< $~)) orelse (C > $\\240).\n\n%% symbol_token(Chars, Line) -> {token,{symbol,Line,Symbol}} | {error,E}.\n%% Build a symbol from list of legal characters, else error.\n\nsymbol_token(Cs, L) ->\n case catch {ok,list_to_atom(Cs)} of\n {ok,S} -> {token,{symbol,L,S}};\n _ -> {error,\"illegal symbol\"}\n end.\n\n%% base_token(Chars, Base, Line) -> Integer.\n%% Convert a string of Base characters into a number. We only allow\n%% base betqeen 2 and 36, and an optional sign character first.\n\nbase_token(_, B, _) when B < 2; B > 36 ->\n {error,\"illegal number base\"};\nbase_token([$+|Cs], B, L) -> base_token(Cs, B, +1, L);\nbase_token([$-|Cs], B, L) -> base_token(Cs, B, -1, L);\nbase_token(Cs, B, L) -> base_token(Cs, B, +1, L).\n\nbase_token(Cs, B, S, L) ->\n case base1(Cs, B, 0) of\n {N,[]} -> {token,{number,L,S*N}};\n {_,_} -> {error,\"illegal based number\"}\n end.\n\nbase1([C|Cs], Base, SoFar) when C >= $0, C =< $9, C < Base + $0 ->\n Next = SoFar * Base + (C - $0),\n base1(Cs, Base, Next);\nbase1([C|Cs], Base, SoFar) when C >= $a, C =< $z, C < Base + $a - 10 ->\n Next = SoFar * Base + (C - $a + 10),\n base1(Cs, Base, Next);\nbase1([C|Cs], Base, SoFar) when C >= $A, C =< $Z, C < Base + $A - 10 ->\n Next = SoFar * Base + (C - $A + 10),\n base1(Cs, Base, Next);\nbase1([C|Cs], _Base, SoFar) -> {SoFar,[C|Cs]};\nbase1([], _Base, N) -> {N,[]}.\n\n-define(IS_UNICODE(C), ((C >= 0) and (C =< 16#10FFFF))).\n\n%% char_token(InputChars, Line) -> {token,{number,L,N}} | {error,E}.\n%% Convert an input string into the corresponding character. For a\n%% sequence of hex characters we check resultant is code is in the\n%% unicode range.\n\nchar_token([$x,C|Cs], L) ->\n case base1([C|Cs], 16, 0) of\n {N,[]} when ?IS_UNICODE(N) -> {token,{number,L,N}};\n _ -> {error,\"illegal character\"}\n end;\nchar_token([C], L) -> {token,{number,L,C}}.\n\n%% chars(InputChars) -> Chars.\n%% Convert an input string into the corresponding string characters.\n%% We know that the input string is correct.\n\nchars([$\\\\,$x,C|Cs0]) ->\n case hex_char(C) of\n true ->\n case base1([C|Cs0], 16, 0) of\n {N,[$;|Cs1]} -> [N|chars(Cs1)];\n _Other -> [escape_char($x)|chars([C|Cs0])]\n end;\n false -> [escape_char($x)|chars([C|Cs0])]\n end;\nchars([$\\\\,C|Cs]) -> [escape_char(C)|chars(Cs)];\nchars([C|Cs]) -> [C|chars(Cs)];\nchars([]) -> [].\n\nhex_char(C) when C >= $0, C =< $9 -> true;\nhex_char(C) when C >= $a, C =< $f -> true;\nhex_char(C) when C >= $A, C =< $F -> true;\nhex_char(_) -> false.\n\nescape_char($b) -> $\\b; %\\b = BS\nescape_char($t) -> $\\t; %\\t = TAB\nescape_char($n) -> $\\n; %\\n = LF\nescape_char($v) -> $\\v; %\\v = VT\nescape_char($f) -> $\\f; %\\f = FF\nescape_char($r) -> $\\r; %\\r = CR\nescape_char($e) -> $\\e; %\\e = ESC\nescape_char($s) -> $\\s; %\\s = SPC\nescape_char($d) -> $\\d; %\\d = DEL\nescape_char(C) -> C.\n\n%% Block Comment:\n%% Provide a sensible error when people attempt to include nested\n%% comments because currently the parser cannot process them without\n%% a rebuild. But simply exploding on a '#|' is not going to be that\n%% helpful.\n\nblock_comment(TokenChars) ->\n %% Check we're not opening another comment block.\n case string:str(TokenChars, \"#|\") of\n 0 -> skip_token; %% No nesting found\n _ -> {error, \"illegal nested block comment\"}\n end.\n\n%% skip_until(String, Char1, Char2) -> String.\n%% skip_past(String, Char1, Char2) -> String.\n\n%% skip_until([C|_]=Cs, C1, C2) when C =:= C1 ; C =:= C2 -> Cs;\n%% skip_until([_|Cs], C1, C2) -> skip_until(Cs, C1, C2);\n%% skip_until([], _, _) -> [].\n\nskip_past([C|Cs], C1, C2) when C =:= C1 ; C =:= C2 -> Cs;\nskip_past([_|Cs], C1, C2) -> skip_past(Cs, C1, C2);\nskip_past([], _, _) -> [].\n" }, { "path": "src/test/resources/samples/langs/Erlang/record_helper.erl", "content": "%% For each header file, it scans thru all records and create helper functions\n%% Helper functions are:\n%% setters, getters, fields, fields_atom, type\n\n-module(record_helper).\n\n-export([make/1, make/2]).\n\nmake(HeaderFiles) ->\n make([ atom_to_list(X) || X <- HeaderFiles ], \".\").\n\n%% .hrl file, relative to current dir\nmake(HeaderFiles, OutDir) ->\n ModuleName = \"record_utils\",\n HeaderComment = \"%% This is auto generated file. Please don't edit it\\n\\n\",\n ModuleDeclaration = \"-module(\" ++ ModuleName ++ \").\\n\"\n\t++ \"-author(\\\"trung@mdkt.org\\\").\\n\"\n\t++ \"-compile(export_all).\\n\"\n\t++ [ \"-include(\\\"\" ++ X ++ \"\\\").\\n\" || X <- HeaderFiles ]\n\t++ \"\\n\",\n Src = format_src(lists:sort(lists:flatten([read(X) || X <- HeaderFiles] ++ [generate_type_default_function()]))),\n file:write_file(OutDir++\"/\" ++ ModuleName ++ \".erl\", list_to_binary([HeaderComment, ModuleDeclaration, Src])).\n\nread(HeaderFile) ->\n try epp:parse_file(HeaderFile,[],[]) of\n\t{ok, Tree} ->\n\t parse(Tree);\n\t{error, Error} ->\n\t {error, {\"Error parsing header file\", HeaderFile, Error}}\n catch\n\t_:Error ->\n\t {catched_error, {\"Error parsing header file\", HeaderFile, Error}}\n end.\n\nformat_src([{_, _, _, Src}|T]) when length(T) == 0 ->\n Src ++ \".\\n\\n\";\nformat_src([{Type, _, _, Src}|[{Type, A, B, NSrc}|T]]) ->\n Src ++ \";\\n\\n\" ++ format_src([{Type, A, B, NSrc}|T]);\nformat_src([{_Type, _, _, Src}|[{Type1, A, B, NSrc}|T]]) ->\n Src ++ \".\\n\\n\" ++ format_src([{Type1, A, B, NSrc}|T]);\nformat_src([{_, _, _, Src}|T]) when length(T) > 0 ->\n Src ++ \";\\n\\n\" ++ format_src(T).\n\nparse(Tree) ->\n [ parse_record(X) || X <- Tree ].\n\nparse_record({attribute, _, record, RecordInfo}) ->\n {RecordName, RecordFields} = RecordInfo,\n if\n\tlength(RecordFields) == 1 ->\n\t lists:flatten([ generate_setter_getter_function(RecordName, X) || X <- RecordFields ]\n\t\t ++ [generate_type_function(RecordName)]);\n\ttrue ->\n\t lists:flatten([generate_fields_function(RecordName, RecordFields)]\n\t\t\t ++ [generate_fields_atom_function(RecordName, RecordFields)]\n\t\t\t ++ [ generate_setter_getter_function(RecordName, X) || X <- RecordFields ]\n\t\t ++ [generate_type_function(RecordName)])\n end;\nparse_record(_) -> [].\n\nparse_field_name({record_field, _, {atom, _, FieldName}}) ->\n {field, \"\\\"\" ++ atom_to_list(FieldName) ++ \"\\\"\"};\nparse_field_name({record_field, _, {atom, _, _FieldName}, {record, _, ParentRecordName, _}}) ->\n\t{parent_field, \"fields(\" ++ atom_to_list(ParentRecordName) ++ \")\"};\nparse_field_name({record_field, _, {atom, _, FieldName}, _}) ->\n {field, \"\\\"\" ++ atom_to_list(FieldName) ++ \"\\\"\"}.\n\nparse_field_name_atom({record_field, _, {atom, _, FieldName}}) ->\n atom_to_list(FieldName);\nparse_field_name_atom({record_field, _, {atom, _, _FieldName}, {record, _, ParentRecordName, _}}) ->\n\t\"fields_atom(\" ++ atom_to_list(ParentRecordName) ++ \")\";\nparse_field_name_atom({record_field, _, {atom, _, FieldName}, _}) ->\n atom_to_list(FieldName).\n\nconcat([], _S) -> [];\nconcat([F|T], _S) when length(T) == 0 -> F;\nconcat([F|T], S) -> F ++ S ++ concat(T, S).\n\nconcat_ext([], _S) -> [];\nconcat_ext([F|T], S) -> F ++ S ++ concat_ext(T, S).\n\nparse_field([], AccFields, AccParentFields) -> concat_ext(AccParentFields, \" ++ \") ++ \"[\" ++ concat(AccFields, \", \") ++ \"]\";\n%parse_field([F|T], AccFields, AccParentFields) when length(T) == 0 -> parse_field_name(F);\nparse_field([F|T], AccFields, AccParentFields) ->\n\tcase parse_field_name(F) of\n\t\t{field, Field} ->\n\t\t\tparse_field(T, AccFields ++ [Field], AccParentFields);\n\t\t{parent_field, PField} ->\n\t\t\tparse_field(T, AccFields, AccParentFields ++ [PField])\n\tend.\n\nparse_field_atom([F|T]) when length(T) == 0 -> parse_field_name_atom(F);\nparse_field_atom([F|T]) ->\n parse_field_name_atom(F) ++ \", \" ++ parse_field_atom(T).\n\ngenerate_type_default_function() ->\n\t{type, zzz, 99, \"type(_) -> undefined\"}.\n\ngenerate_type_function(RecordName) ->\n {type, RecordName, 0, \"type(Obj) when is_record(Obj, \" ++ atom_to_list(RecordName) ++ \") -> \" ++ atom_to_list(RecordName)}.\n\ngenerate_fields_function(RecordName, RecordFields) ->\n Fields = parse_field(RecordFields, [], []),\n {field, RecordName, 1, \"fields(\" ++ atom_to_list(RecordName) ++ \") -> \\n\\t\" ++ Fields}.\n\ngenerate_fields_atom_function(RecordName, RecordFields) ->\n Fields = parse_field_atom(RecordFields),\n {field_atom, RecordName, 1, \"fields_atom(\" ++ atom_to_list(RecordName) ++ \") -> \\n\\tlists:flatten([\" ++ Fields ++ \"])\"}.\n\ngenerate_setter_getter_function(RecordName, {record_field, _, {atom, _, FieldName}, {record, _, ParentRecordName, _}}) ->\n to_setter_getter_function(atom_to_list(RecordName), atom_to_list(FieldName), atom_to_list(ParentRecordName));\ngenerate_setter_getter_function(RecordName, {record_field, _, {atom, _, FieldName}, _}) ->\n to_setter_getter_function(atom_to_list(RecordName), atom_to_list(FieldName));\ngenerate_setter_getter_function(RecordName, {record_field, _, {atom, _, FieldName}}) ->\n to_setter_getter_function(atom_to_list(RecordName), atom_to_list(FieldName)).\n\nto_setter_getter_function(RecordName, FieldName) ->\n [{setter, RecordName, 1, \"set(Obj, \" ++ FieldName ++ \", Value) when is_record(Obj, \" ++ RecordName ++ \") -> \\n\"\n\t++ \"\\tNewObj = Obj#\" ++ RecordName ++ \"{\" ++ FieldName ++ \" = Value},\\n\"\n\t++ \"\\t{ok, NewObj, {\" ++ FieldName ++ \", Value}}\"},\n\t{getter, RecordName, 1, \"get(Obj, \" ++ FieldName ++ \") when is_record(Obj, \" ++ RecordName ++ \") -> \\n\"\n\t++ \"\\t{ok, Obj#\" ++ RecordName ++ \".\" ++ FieldName ++ \"}\"}\n\t].\n\nto_setter_getter_function(RecordName, FieldName, ParentRecordName) ->\n [{setter, RecordName, 2, \"set(Obj, \" ++ FieldName ++ \", Value) when is_record(Obj, \" ++ RecordName ++ \") and is_record(Value, \" ++ ParentRecordName ++ \") -> \\n\"\n ++ \"\\tNewObj = Obj#\" ++ RecordName ++ \"{\" ++ FieldName ++ \" = Value},\\n\"\n ++ \"\\t{ok, NewObj, {\" ++ FieldName ++ \", Value}};\\n\\n\"\n ++ \"set(Obj, ParentProperty, Value) when is_record(Obj, \" ++ RecordName ++ \") and is_atom(ParentProperty) -> \\n\"\n ++ \"\\t{ok, NewParentObject, _} = set(Obj#\" ++ RecordName ++ \".parent, ParentProperty, Value),\\n\"\n ++ \"\\tset(Obj, parent, NewParentObject)\"},\n\t{getter, RecordName, 2, \"get(Obj, \" ++ FieldName ++ \") when is_record(Obj, \" ++ RecordName ++ \") -> \\n\"\n\t ++ \"\\t{ok, Obj#\" ++ RecordName ++ \".\" ++ FieldName ++ \"};\\n\\n\"\n ++ \"get(Obj, ParentProperty) when is_record(Obj, \" ++ RecordName ++ \") and is_atom(ParentProperty) -> \\n\"\n ++ \"\\tget(Obj#\" ++ RecordName ++ \".parent, ParentProperty)\"}\n\t]." }, { "path": "src/test/resources/samples/langs/Erlang/record_utils.erl", "content": "%% This is auto generated file. Please don't edit it\n\n-module(record_utils).\n-compile(export_all).\n-include(\"messages.hrl\").\n\nfields(abstract_message) ->\n\t[\"clientId\", \"destination\", \"messageId\", \"timestamp\", \"timeToLive\", \"headers\", \"body\"];\n\nfields(async_message) ->\n\tfields(abstract_message) ++ [\"correlationId\", \"correlationIdBytes\"].\n\nfields_atom(abstract_message) ->\n\tlists:flatten([clientId, destination, messageId, timestamp, timeToLive, headers, body]);\n\nfields_atom(async_message) ->\n\tlists:flatten([fields_atom(abstract_message), correlationId, correlationIdBytes]).\n\nget(Obj, body) when is_record(Obj, abstract_message) ->\n\t{ok, Obj#abstract_message.body};\n\nget(Obj, clientId) when is_record(Obj, abstract_message) ->\n\t{ok, Obj#abstract_message.clientId};\n\nget(Obj, destination) when is_record(Obj, abstract_message) ->\n\t{ok, Obj#abstract_message.destination};\n\nget(Obj, headers) when is_record(Obj, abstract_message) ->\n\t{ok, Obj#abstract_message.headers};\n\nget(Obj, messageId) when is_record(Obj, abstract_message) ->\n\t{ok, Obj#abstract_message.messageId};\n\nget(Obj, timeToLive) when is_record(Obj, abstract_message) ->\n\t{ok, Obj#abstract_message.timeToLive};\n\nget(Obj, timestamp) when is_record(Obj, abstract_message) ->\n\t{ok, Obj#abstract_message.timestamp};\n\nget(Obj, correlationId) when is_record(Obj, async_message) ->\n\t{ok, Obj#async_message.correlationId};\n\nget(Obj, correlationIdBytes) when is_record(Obj, async_message) ->\n\t{ok, Obj#async_message.correlationIdBytes};\n\nget(Obj, parent) when is_record(Obj, async_message) ->\n\t{ok, Obj#async_message.parent};\n\nget(Obj, ParentProperty) when is_record(Obj, async_message) and is_atom(ParentProperty) ->\n\tget(Obj#async_message.parent, ParentProperty).\n\nset(Obj, body, Value) when is_record(Obj, abstract_message) ->\n\tNewObj = Obj#abstract_message{body = Value},\n\t{ok, NewObj, {body, Value}};\n\nset(Obj, clientId, Value) when is_record(Obj, abstract_message) ->\n\tNewObj = Obj#abstract_message{clientId = Value},\n\t{ok, NewObj, {clientId, Value}};\n\nset(Obj, destination, Value) when is_record(Obj, abstract_message) ->\n\tNewObj = Obj#abstract_message{destination = Value},\n\t{ok, NewObj, {destination, Value}};\n\nset(Obj, headers, Value) when is_record(Obj, abstract_message) ->\n\tNewObj = Obj#abstract_message{headers = Value},\n\t{ok, NewObj, {headers, Value}};\n\nset(Obj, messageId, Value) when is_record(Obj, abstract_message) ->\n\tNewObj = Obj#abstract_message{messageId = Value},\n\t{ok, NewObj, {messageId, Value}};\n\nset(Obj, timeToLive, Value) when is_record(Obj, abstract_message) ->\n\tNewObj = Obj#abstract_message{timeToLive = Value},\n\t{ok, NewObj, {timeToLive, Value}};\n\nset(Obj, timestamp, Value) when is_record(Obj, abstract_message) ->\n\tNewObj = Obj#abstract_message{timestamp = Value},\n\t{ok, NewObj, {timestamp, Value}};\n\nset(Obj, correlationId, Value) when is_record(Obj, async_message) ->\n\tNewObj = Obj#async_message{correlationId = Value},\n\t{ok, NewObj, {correlationId, Value}};\n\nset(Obj, correlationIdBytes, Value) when is_record(Obj, async_message) ->\n\tNewObj = Obj#async_message{correlationIdBytes = Value},\n\t{ok, NewObj, {correlationIdBytes, Value}};\n\nset(Obj, parent, Value) when is_record(Obj, async_message) and is_record(Value, abstract_message) ->\n\tNewObj = Obj#async_message{parent = Value},\n\t{ok, NewObj, {parent, Value}};\n\nset(Obj, ParentProperty, Value) when is_record(Obj, async_message) and is_atom(ParentProperty) ->\n\t{ok, NewParentObject, _} = set(Obj#async_message.parent, ParentProperty, Value),\n\tset(Obj, parent, NewParentObject).\n\ntype(Obj) when is_record(Obj, abstract_message) -> abstract_message;\n\ntype(Obj) when is_record(Obj, async_message) -> async_message;\n\ntype(_) -> undefined." }, { "path": "src/test/resources/samples/langs/Erlang/release", "content": "#!/usr/bin/env escript\n%%!\n%-*-Mode:erlang;coding:utf-8;tab-width:4;c-basic-offset:4;indent-tabs-mode:()-*-\n% ex: set ft=erlang fenc=utf-8 sts=4 ts=4 sw=4 et:\n%%%\n%%%------------------------------------------------------------------------\n%%% BSD LICENSE\n%%%\n%%% Copyright (c) 2013, Michael Truog \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 met:\n%%%\n%%% * Redistributions of source code must retain the above copyright\n%%% notice, this list of conditions and the following disclaimer.\n%%% * Redistributions in binary form must reproduce the above copyright\n%%% notice, this list of conditions and the following disclaimer in\n%%% the documentation and/or other materials provided with the\n%%% distribution.\n%%% * All advertising materials mentioning features or use of this\n%%% software must display the following acknowledgment:\n%%% This product includes software developed by Michael Truog\n%%% * The name of the author may not be used to endorse or promote\n%%% products derived from this software without specific prior\n%%% written permission\n%%%\n%%% THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND\n%%% CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES,\n%%% INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n%%% OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n%%% DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n%%% CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n%%% SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n%%% BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n%%% SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n%%% INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n%%% WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n%%% NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n%%% OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH\n%%% DAMAGE.\n%%%------------------------------------------------------------------------\n\n-author('mjtruog [at] gmail (dot) com').\n\n-mode(compile).\n\nmain(_) ->\n {ok,\n [{sys, _} = RelToolConfig,\n {target_dir, TargetDir},\n {overlay, OverlayConfig}]} = file:consult(\"reltool.config\"),\n {ok, Spec} = reltool:get_target_spec([RelToolConfig]),\n case file:make_dir(TargetDir) of\n ok ->\n ok;\n {error, eexist} ->\n io:format(\"release already exists? (~p)~n\", [TargetDir]),\n exit_code(1)\n end,\n ok = reltool:eval_target_spec(Spec, code:root_dir(), TargetDir),\n ok = process_overlay(RelToolConfig, TargetDir, OverlayConfig),\n exit_code(0).\n\nshell(Command, Arguments) ->\n CommandSuffix = \" && echo 0 || echo 1\",\n case lists:reverse(os:cmd(lists:flatten(\n io_lib:format(Command ++ CommandSuffix, Arguments)))) of\n [_, $0 | _] ->\n ok;\n [_, $1 | _] ->\n io:format(\"\\\"~s\\\" failed!~n\", [io_lib:format(Command, Arguments)]),\n error\n end.\n\nboot_rel_vsn({sys, Config} = _RelToolConfig) ->\n {rel, _Name, Ver, _} = proplists:lookup(rel, Config),\n Ver.\n\n%% minimal parsing for handling mustache syntax\nmustache(Body, Context) ->\n mustache(Body, \"\", Context).\nmustache([], Result, _Context) ->\n lists:reverse(Result);\nmustache([${, ${ | KeyStr], Result, Context) ->\n mustache_key(KeyStr, \"\", Result, Context);\nmustache([C | Rest], Result, Context) ->\n mustache(Rest, [C | Result], Context).\nmustache_key([$}, $} | Rest], KeyStr, Result, Context) ->\n Key = erlang:list_to_existing_atom(lists:reverse(KeyStr)),\n {ok, Value} = dict:find(Key, Context),\n mustache(Rest, lists:reverse(Value) ++ Result, Context);\nmustache_key([C | Rest], KeyStr, Result, Context) ->\n mustache_key(Rest, [C | KeyStr], Result, Context).\n\n%% support minimal overlay based on rebar overlays\nprocess_overlay(RelToolConfig, TargetDir, OverlayConfig) ->\n BootRelVsn = boot_rel_vsn(RelToolConfig),\n OverlayVars =\n dict:from_list([{erts_vsn, \"erts-\" ++ erlang:system_info(version)},\n {rel_vsn, BootRelVsn},\n {target_dir, TargetDir},\n {hostname, net_adm:localhost()}]),\n {ok, BaseDir} = file:get_cwd(),\n execute_overlay(OverlayConfig, OverlayVars, BaseDir, TargetDir).\n\nexecute_overlay([], _Vars, _BaseDir, _TargetDir) ->\n ok;\nexecute_overlay([{mkdir, Out} | Rest], Vars, BaseDir, TargetDir) ->\n OutDir = mustache(filename:join(TargetDir, Out), Vars),\n ok = shell(\"mkdir -p ~s\", [OutDir]),\n execute_overlay(Rest, Vars, BaseDir, TargetDir);\nexecute_overlay([{copy, In, Out} | Rest], Vars, BaseDir, TargetDir) ->\n InFile = mustache(filename:join(BaseDir, In), Vars),\n OutFile = mustache(filename:join(TargetDir, Out), Vars),\n true = filelib:is_file(InFile),\n ok = shell(\"cp -R ~s ~s\", [InFile, OutFile]),\n execute_overlay(Rest, Vars, BaseDir, TargetDir).\n\nexit_code(ExitCode) ->\n erlang:halt(ExitCode, [{flush, true}]).\n" }, { "path": "src/test/resources/samples/langs/Erlang/sample.app.src", "content": "{application, sample,\n [{description, \"sample app\"},\n {vsn, \"1.0.0\"},\n {registered, []},\n {mod, {sample_app, []}},\n {applications, [kernel, stdlib]},\n {env, []},\n {modules, []}]}.\n" }, { "path": "src/test/resources/samples/langs/Erlang/single-context.es", "content": "#! /usr/bin/env escript\n% This file is part of Emonk released under the MIT license. \n% See the LICENSE file for more information.\n\nmain([]) ->\n\tstart(64, 1000);\nmain([N]) ->\n\tstart(list_to_integer(N), 1000);\nmain([N, M]) ->\n\tstart(list_to_integer(N), list_to_integer(M)).\n\n\nstart(N, M) ->\n\tcode:add_pathz(\"test\"),\n\tcode:add_pathz(\"ebin\"),\n\t{ok, Ctx} = emonk:create_ctx(),\n\t{ok, undefined} = emonk:eval(Ctx, js()),\n\trun(Ctx, N, M),\n\twait(N).\n\nrun(_, 0, _) ->\n\tok;\nrun(Ctx, N, M) ->\n\tSelf = self(),\n\tPid = spawn(fun() -> do_js(Self, Ctx, M) end),\n\tio:format(\"Spawned: ~p~n\", [Pid]),\n\trun(Ctx, N-1, M).\n\nwait(0) ->\n\tok;\nwait(N) ->\n\treceive\n\t\t{finished, Pid} -> ok\n\tend,\n\tio:format(\"Finished: ~p~n\", [Pid]),\n\twait(N-1).\n\ndo_js(Parent, _, 0) ->\n\tParent ! {finished, self()};\ndo_js(Parent, Ctx, M) ->\n\tio:format(\"Running: ~p~n\", [M]),\n\tTest = random_test(),\n\t{ok, [Resp]} = emonk:call(Ctx, <<\"f\">>, [Test]),\n\tSorted = sort(Resp),\n\ttrue = Test == Sorted,\n\tdo_js(Parent, Ctx, M-1).\n\njs() -> \n\t<<\"var f = function(x) {return [x];};\">>.\n\nrandom_test() ->\n\tTests = [\n\t\tnull,\n\t\ttrue,\n\t\tfalse,\n\t\t1,\n\t\t-1,\n\t\t3.1416,\n\t\t-3.1416,\n\t\t12.0e10,\n\t\t1.234E+10,\n\t\t-1.234E-10,\n\t\t10.0,\n\t\t123.456,\n\t\t10.0,\n\t\t<<\"foo\">>,\n\t\t<<\"foo\", 5, \"bar\">>,\n\t\t<<\"\">>,\n\t\t<<\"\\n\\n\\n\">>,\n\t\t<<\"\\\" \\b\\f\\r\\n\\t\\\"\">>,\n\t\t{[]},\n\t\t{[{<<\"foo\">>, <<\"bar\">>}]},\n\t\t{[{<<\"foo\">>, <<\"bar\">>}, {<<\"baz\">>, 123}]},\n\t\t[],\n\t\t[[]],\n\t\t[1, <<\"foo\">>],\n\t\t{[{<<\"foo\">>, [123]}]},\n\t\t{[{<<\"foo\">>, [1, 2, 3]}]},\n\t\t{[{<<\"foo\">>, {[{<<\"bar\">>, true}]}}]},\n\t\t{[\n\t\t\t{<<\"foo\">>, []},\n\t\t\t{<<\"bar\">>, {[{<<\"baz\">>, true}]}}, {<<\"alice\">>, <<\"bob\">>}\n\t\t]},\n\t\t[-123, <<\"foo\">>, {[{<<\"bar\">>, []}]}, null]\n\t],\n\t{_, [Test | _]} = lists:split(random:uniform(length(Tests)) - 1, Tests),\n\tsort(Test).\n\nsort({Props}) ->\n\tobjsort(Props, []);\nsort(List) when is_list(List) ->\n\tlstsort(List, []);\nsort(Other) ->\n\tOther.\n\nobjsort([], Acc) ->\n\t{lists:sort(Acc)};\nobjsort([{K,V} | Rest], Acc) ->\n\tobjsort(Rest, [{K, sort(V)} | Acc]).\n\nlstsort([], Acc) ->\n\tlists:reverse(Acc);\nlstsort([Val | Rest], Acc) ->\n\tlstsort(Rest, [sort(Val) | Acc]).\n" }, { "path": "src/test/resources/samples/langs/F#/Combinators.fs", "content": "namespace Nessos.FsPickler.Combinators\n\n open Nessos.FsPickler\n open Nessos.FsPickler.Json\n\n /// Json pickling methods\n []\n module Json =\n\n let private jsonSerializer = lazy(FsPickler.CreateJson(omitHeader = true))\n\n /// \n /// Pickles a value to Json.\n /// \n /// utilized pickler.\n /// input value.\n let pickle (pickler : Pickler<'T>) (value : 'T) : string =\n jsonSerializer.Value.PickleToString (pickler, value)\n\n /// \n /// Unpickles a value from Json.\n /// \n /// utilized pickler.\n /// input pickle.\n let unpickle (pickler : Pickler<'T>) (pickle : string) : 'T =\n jsonSerializer.Value.UnPickleOfString (pickler, pickle)\n\n\n /// Bson pickling methods\n []\n module Bson =\n\n let private bsonPickler = lazy(FsPickler.CreateBson())\n\n /// \n /// Pickles a value to Bson.\n /// \n /// utilized pickler.\n /// input value.\n let pickle (pickler : Pickler<'T>) (value : 'T) : byte [] =\n bsonPickler.Value.Pickle (pickler, value)\n\n /// \n /// Unpickles a value from bson.\n /// \n /// utilized pickler.\n /// input pickle.\n let unpickle (pickler : Pickler<'T>) (pickle : byte []) : 'T =\n bsonPickler.Value.UnPickle (pickler, pickle)" }, { "path": "src/test/resources/samples/langs/F#/JsonFormat.fs", "content": "namespace Nessos.FsPickler.Json\n\n open System\n open System.IO\n open System.Text\n\n open Newtonsoft.Json\n\n open Nessos.FsPickler\n\n /// \n /// Factory methods for the Json serialization format.\n /// \n type JsonPickleFormatProvider internal (indent, omitHeader) as self =\n\n let isCustomSeq isTopLevelSequence = \n isTopLevelSequence && self.OmitHeader && self.UseCustomTopLevelSequenceSeparator\n\n let mutable sequenceSeparator = \" \"\n\n member val Indent = indent with get,set\n member val OmitHeader = omitHeader with get,set\n member val UseCustomTopLevelSequenceSeparator = false with get,set\n\n member __.SequenceSeparator\n with get () = sequenceSeparator\n and set sep =\n if sep <> null && String.IsNullOrWhiteSpace sep then\n sequenceSeparator <- sep\n else\n invalidArg \"SequenceSeparator\" \"should be non-null whitespace.\"\n\n interface ITextPickleFormatProvider with\n member __.Name = \"Json\"\n\n // see discussion : https://github.com/nessos/FsPickler/issues/17\n member __.DefaultEncoding = new UTF8Encoding(false) :> Encoding\n\n member __.CreateWriter (stream, encoding, isTopLevelSequence, leaveOpen) =\n#if NET40\n if leaveOpen then raise <| new NotSupportedException(\"'leaveOpen' not supported in .NET 40.\")\n let sw = new StreamWriter(stream, encoding)\n#else\n let sw = new StreamWriter(stream, encoding, 1024, leaveOpen)\n#endif\n let jw = new JsonTextWriter(sw)\n new JsonPickleWriter(jw, __.OmitHeader, __.Indent, isCustomSeq isTopLevelSequence, sequenceSeparator, leaveOpen) :> _\n\n member __.CreateReader (stream, encoding, isTopLevelSequence, leaveOpen) =\n#if NET40\n if leaveOpen then raise <| new NotSupportedException(\"'leaveOpen' not supported in .NET 40.\")\n let sr = new StreamReader(stream, encoding)\n#else\n let sr = new StreamReader(stream, encoding, true, 1024, leaveOpen)\n#endif\n let jr = new JsonTextReader(sr)\n new JsonPickleReader(jr, __.OmitHeader, isCustomSeq isTopLevelSequence, leaveOpen) :> _\n\n member __.CreateWriter (textWriter, isTopLevelSequence, leaveOpen) =\n let jw = new JsonTextWriter(textWriter)\n new JsonPickleWriter(jw, __.OmitHeader, __.Indent, isCustomSeq isTopLevelSequence, sequenceSeparator, leaveOpen) :> _\n\n member __.CreateReader (textReader, isTopLevelSequence, leaveOpen) =\n let jr = new JsonTextReader(textReader)\n new JsonPickleReader(jr, __.OmitHeader, isCustomSeq isTopLevelSequence, leaveOpen) :> _" }, { "path": "src/test/resources/samples/langs/F#/JsonReader.fs", "content": "namespace Nessos.FsPickler.Json\n\n open System\n open System.Collections.Generic\n open System.Globalization\n open System.IO\n open System.Numerics\n open System.Text\n\n open Newtonsoft.Json\n\n open Nessos.FsPickler\n\n /// \n /// Json format deserializer\n /// \n type internal JsonPickleReader (jsonReader : JsonReader, omitHeader, isTopLevelSequence, leaveOpen) =\n\n do\n jsonReader.CloseInput <- not leaveOpen\n jsonReader.SupportMultipleContent <- isTopLevelSequence\n\n let isBsonReader = match jsonReader with :? Bson.BsonReader -> true | _ -> false\n\n let mutable depth = 0\n let arrayStack = new Stack ()\n do arrayStack.Push Int32.MinValue\n\n // do not write tag if omitting header or array element\n let omitTag () = (omitHeader && depth = 0) || arrayStack.Peek() = depth - 1\n\n interface IPickleFormatReader with\n \n member __.BeginReadRoot (tag : string) =\n do jsonReader.Read() |> ignore\n \n if omitHeader then () else\n\n if jsonReader.TokenType <> JsonToken.StartObject then raise <| new FormatException(\"invalid json root object.\")\n else\n do jsonReader.MoveNext()\n let version = jsonReader.ReadPrimitiveAs false \"FsPickler\"\n if version <> jsonFormatVersion then\n let v = Version(version)\n raise <| new FormatException(sprintf \"Invalid FsPickler format version %O.\" version)\n\n let sTag = jsonReader.ReadPrimitiveAs false \"type\"\n if tag <> sTag then\n raise <| new InvalidPickleTypeException(tag, sTag)\n\n member __.EndReadRoot () = \n if not omitHeader then jsonReader.Read() |> ignore\n\n member __.BeginReadObject (tag : string) =\n \n if not <| omitTag () then\n jsonReader.ReadProperty tag\n jsonReader.MoveNext ()\n\n if isTopLevelSequence && depth = 0 then\n arrayStack.Push depth\n depth <- depth + 1\n ObjectFlags.IsSequenceHeader\n\n else\n match jsonReader.TokenType with\n | JsonToken.Null -> ObjectFlags.IsNull\n | JsonToken.StartArray ->\n jsonReader.MoveNext()\n arrayStack.Push depth\n depth <- depth + 1\n ObjectFlags.IsSequenceHeader\n\n | JsonToken.StartObject ->\n do jsonReader.MoveNext()\n depth <- depth + 1\n\n if jsonReader.ValueAs () = \"_flags\" then\n jsonReader.MoveNext()\n let csvFlags = jsonReader.ValueAs()\n jsonReader.MoveNext()\n parseFlagCsv csvFlags\n else\n ObjectFlags.None\n\n | token -> raise <| new FormatException(sprintf \"expected start of Json object but was '%O'.\" token)\n\n\n member __.EndReadObject () =\n if isTopLevelSequence && depth = 1 then\n arrayStack.Pop () |> ignore\n depth <- depth - 1\n jsonReader.Read() |> ignore\n else\n match jsonReader.TokenType with\n | JsonToken.Null -> ()\n | JsonToken.EndObject -> depth <- depth - 1\n | JsonToken.EndArray ->\n arrayStack.Pop() |> ignore\n depth <- depth - 1\n\n | token -> raise <| new FormatException(sprintf \"expected end of Json object but was '%O'.\" token)\n\n if omitHeader && depth = 0 then ()\n else jsonReader.Read() |> ignore\n\n member __.SerializeUnionCaseNames = true\n\n member __.PreferLengthPrefixInSequences = false\n member __.ReadNextSequenceElement () = \n if isTopLevelSequence && depth = 1 then\n jsonReader.TokenType <> JsonToken.None\n else\n jsonReader.TokenType <> JsonToken.EndArray\n\n member __.ReadCachedObjectId () = jsonReader.ReadPrimitiveAs false \"id\"\n\n member __.ReadBoolean tag = jsonReader.ReadPrimitiveAs (omitTag ()) tag\n member __.ReadByte tag = jsonReader.ReadPrimitiveAs (omitTag ()) tag |> byte\n member __.ReadSByte tag = jsonReader.ReadPrimitiveAs (omitTag ()) tag |> sbyte\n\n member __.ReadInt16 tag = jsonReader.ReadPrimitiveAs (omitTag ()) tag |> int16\n member __.ReadInt32 tag = jsonReader.ReadPrimitiveAs (omitTag ()) tag |> int\n member __.ReadInt64 tag = jsonReader.ReadPrimitiveAs (omitTag ()) tag\n\n member __.ReadUInt16 tag = jsonReader.ReadPrimitiveAs (omitTag ()) tag |> uint16\n member __.ReadUInt32 tag = jsonReader.ReadPrimitiveAs (omitTag ()) tag |> uint32\n member __.ReadUInt64 tag = jsonReader.ReadPrimitiveAs (omitTag ()) tag |> uint64\n\n member __.ReadSingle tag =\n if not <| omitTag () then\n jsonReader.ReadProperty tag\n jsonReader.MoveNext()\n\n let value =\n match jsonReader.TokenType with\n | JsonToken.Float -> jsonReader.ValueAs () |> single\n | JsonToken.String -> Single.Parse(jsonReader.ValueAs(), CultureInfo.InvariantCulture)\n | _ -> raise <| new FormatException(\"not a float.\")\n\n jsonReader.Read() |> ignore\n value\n \n member __.ReadDouble tag =\n if not <| omitTag () then\n jsonReader.ReadProperty tag\n jsonReader.MoveNext()\n\n let value =\n match jsonReader.TokenType with\n | JsonToken.Float -> jsonReader.ValueAs ()\n | JsonToken.String -> Double.Parse(jsonReader.ValueAs(), CultureInfo.InvariantCulture)\n | _ -> raise <| new FormatException(\"not a float.\")\n\n jsonReader.Read() |> ignore\n value\n\n member __.ReadChar tag = let value = jsonReader.ReadPrimitiveAs (omitTag ()) tag in value.[0]\n member __.ReadString tag = jsonReader.ReadPrimitiveAs (omitTag ()) tag\n member __.ReadBigInteger tag = jsonReader.ReadPrimitiveAs (omitTag ()) tag |> BigInteger.Parse\n\n member __.ReadGuid tag = \n if isBsonReader then \n jsonReader.ReadPrimitiveAs (omitTag ()) tag\n else\n jsonReader.ReadPrimitiveAs (omitTag ()) tag |> Guid.Parse\n\n member __.ReadTimeSpan tag = jsonReader.ReadPrimitiveAs (omitTag ()) tag |> TimeSpan.Parse\n member __.ReadDecimal tag = jsonReader.ReadPrimitiveAs (omitTag ()) tag |> decimal\n\n // BSON spec mandates the use of Unix time; \n // this has millisecond precision which results in loss of accuracy w.r.t. ticks\n // since the goal of FsPickler is to offer faithful representations of .NET objects\n // we choose to override the spec and serialize ticks outright.\n // see also https://json.codeplex.com/discussions/212067 \n member __.ReadDate tag = \n if isBsonReader then\n let ticks = jsonReader.ReadPrimitiveAs (omitTag ()) tag\n DateTime(ticks)\n else\n jsonReader.ReadPrimitiveAs (omitTag ()) tag\n\n member __.ReadBytes tag =\n if not <| omitTag () then\n jsonReader.ReadProperty tag\n jsonReader.Read() |> ignore\n\n let bytes =\n if jsonReader.TokenType = JsonToken.Null then null\n elif isBsonReader then jsonReader.ValueAs ()\n else\n let base64 = jsonReader.ValueAs ()\n Convert.FromBase64String base64\n\n jsonReader.Read() |> ignore\n\n bytes\n\n member __.IsPrimitiveArraySerializationSupported = false\n member __.ReadPrimitiveArray _ _ = raise <| new NotImplementedException()\n\n member __.Dispose () = (jsonReader :> IDisposable).Dispose()" }, { "path": "src/test/resources/samples/langs/F#/JsonSerializer.fs", "content": "namespace Nessos.FsPickler.Json\n\n open System\n\n open Nessos.FsPickler\n\n type internal OAttribute = System.Runtime.InteropServices.OptionalAttribute\n type internal DAttribute = System.Runtime.InteropServices.DefaultParameterValueAttribute\n\n /// \n /// Json pickler instance.\n /// \n type JsonSerializer =\n inherit FsPicklerTextSerializer\n \n val private format : JsonPickleFormatProvider\n\n /// \n /// Initializes a new Json pickler instance.\n /// \n /// indent out Json pickles.\n /// omit FsPickler header in Json pickles.\n /// specify a custom type name converter.\n new ([] ?indent, [] ?omitHeader, [] ?typeConverter) =\n let indent = defaultArg indent false\n let omitHeader = defaultArg omitHeader false\n let json = new JsonPickleFormatProvider(indent, omitHeader)\n { \n inherit FsPicklerTextSerializer(json, ?typeConverter = typeConverter)\n format = json \n }\n\n /// \n /// Gets or sets whether Json output should be indented.\n /// \n member x.Indent\n with get () = x.format.Indent\n and set b = x.format.Indent <- b\n\n /// \n /// Gets or sets whether FsPickler headers should be ignored in pickle format.\n /// \n member x.OmitHeader\n with get () = x.format.OmitHeader\n and set b = x.format.OmitHeader <- b\n\n /// \n /// Gets or sets a non-null whitespace string that serves as a custom, top-level sequence separator.\n /// \n member x.SequenceSeparator\n with get () = x.format.SequenceSeparator\n and set sep = x.format.SequenceSeparator <- sep\n\n /// \n /// Gets or sets whether top-level sequences should be serialized using the custom separator.\n /// \n member x.UseCustomTopLevelSequenceSeparator\n with get () = x.format.UseCustomTopLevelSequenceSeparator\n and set e = x.format.UseCustomTopLevelSequenceSeparator <- e\n\n /// \n /// BSON pickler instance.\n /// \n type BsonSerializer([] ?typeConverter) =\n inherit FsPicklerSerializer(new BsonPickleFormatProvider(), ?typeConverter = typeConverter)\n\n\n /// FsPickler static methods.\n type FsPickler =\n\n /// \n /// Initializes a new Json pickler instance.\n /// \n /// indent out Json pickles.\n /// omit FsPickler header in Json pickles.\n /// specify a custom type name converter.\n static member CreateJson([] ?indent, [] ?omitHeader, [] ?typeConverter) = \n new JsonSerializer(?indent = indent, ?omitHeader = omitHeader, ?typeConverter = typeConverter)\n\n /// \n /// Initializes a new Bson pickler instance.\n /// \n /// specify a custom type name converter.\n static member CreateBson([] ?typeConverter) = \n new BsonSerializer(?typeConverter = typeConverter)" }, { "path": "src/test/resources/samples/langs/F#/JsonWriter.fs", "content": "namespace Nessos.FsPickler.Json\n\n open System\n open System.IO\n open System.Collections.Generic\n\n open Newtonsoft.Json\n\n open Nessos.FsPickler\n\n /// \n /// Json format serializer.\n /// \n type internal JsonPickleWriter (jsonWriter : JsonWriter, omitHeader, indented, isTopLevelSequence, separator, leaveOpen) =\n\n do \n jsonWriter.Formatting <- if indented then Formatting.Indented else Formatting.None\n jsonWriter.CloseOutput <- not leaveOpen\n\n let isBsonWriter = match jsonWriter with :? Bson.BsonWriter -> true | _ -> false\n\n let mutable depth = 0\n let mutable isTopLevelSequenceHead = false\n let mutable currentValueIsNull = false\n\n let arrayStack = new Stack ()\n do arrayStack.Push Int32.MinValue\n\n // do not write tag if omitting header or array element\n let omitTag () = (omitHeader && depth = 0) || arrayStack.Peek() = depth - 1\n\n interface IPickleFormatWriter with\n \n member __.BeginWriteRoot (tag : string) =\n if omitHeader then () else\n\n jsonWriter.WriteStartObject()\n writePrimitive jsonWriter false \"FsPickler\" jsonFormatVersion\n writePrimitive jsonWriter false \"type\" tag\n\n member __.EndWriteRoot () = \n if not omitHeader then jsonWriter.WriteEnd()\n\n member __.BeginWriteObject (tag : string) (flags : ObjectFlags) =\n\n if not <| omitTag () then\n jsonWriter.WritePropertyName tag\n\n if flags.HasFlag ObjectFlags.IsNull then\n currentValueIsNull <- true\n jsonWriter.WriteNull()\n\n elif flags.HasFlag ObjectFlags.IsSequenceHeader then\n if isTopLevelSequence && depth = 0 then\n isTopLevelSequenceHead <- true\n else\n jsonWriter.WriteStartArray()\n\n arrayStack.Push depth\n depth <- depth + 1\n else\n jsonWriter.WriteStartObject()\n depth <- depth + 1\n\n if flags = ObjectFlags.None then ()\n else\n let flagCsv = mkFlagCsv flags\n writePrimitive jsonWriter false \"_flags\" flagCsv\n\n member __.EndWriteObject () = \n if currentValueIsNull then \n currentValueIsNull <- false\n else\n depth <- depth - 1\n if arrayStack.Peek () = depth then\n if isTopLevelSequence && depth = 0 then ()\n else\n jsonWriter.WriteEndArray()\n\n arrayStack.Pop () |> ignore\n else\n jsonWriter.WriteEndObject()\n\n member __.SerializeUnionCaseNames = true\n\n member __.PreferLengthPrefixInSequences = false\n member __.WriteNextSequenceElement hasNext =\n if isTopLevelSequence && depth = 1 then\n if isTopLevelSequenceHead then\n isTopLevelSequenceHead <- false\n else\n jsonWriter.WriteWhitespace separator\n\n member __.WriteCachedObjectId id = writePrimitive jsonWriter false \"id\" id\n\n member __.WriteBoolean (tag : string) value = writePrimitive jsonWriter (omitTag ()) tag value\n member __.WriteByte (tag : string) value = writePrimitive jsonWriter (omitTag ()) tag value\n member __.WriteSByte (tag : string) value = writePrimitive jsonWriter (omitTag ()) tag value\n\n member __.WriteInt16 (tag : string) value = writePrimitive jsonWriter (omitTag ()) tag value\n member __.WriteInt32 (tag : string) value = writePrimitive jsonWriter (omitTag ()) tag value\n member __.WriteInt64 (tag : string) value = writePrimitive jsonWriter (omitTag ()) tag value\n\n member __.WriteUInt16 (tag : string) value = writePrimitive jsonWriter (omitTag ()) tag value\n member __.WriteUInt32 (tag : string) value = writePrimitive jsonWriter (omitTag ()) tag value\n member __.WriteUInt64 (tag : string) value = writePrimitive jsonWriter (omitTag ()) tag value\n\n member __.WriteSingle (tag : string) value = writePrimitive jsonWriter (omitTag ()) tag value\n member __.WriteDouble (tag : string) value = writePrimitive jsonWriter (omitTag ()) tag value\n member __.WriteDecimal (tag : string) value = writePrimitive jsonWriter (omitTag ()) tag (string value)\n\n member __.WriteChar (tag : string) value = writePrimitive jsonWriter (omitTag ()) tag value\n member __.WriteString (tag : string) value = writePrimitive jsonWriter (omitTag ()) tag value\n member __.WriteBigInteger (tag : string) value = writePrimitive jsonWriter (omitTag ()) tag (string value)\n\n member __.WriteGuid (tag : string) value = writePrimitive jsonWriter (omitTag ()) tag value\n member __.WriteTimeSpan (tag : string) value = writePrimitive jsonWriter (omitTag ()) tag (string value)\n\n // BSON spec mandates the use of Unix time; \n // this has millisecond precision which results in loss of accuracy w.r.t. ticks\n // since the goal of FsPickler is to offer faithful representations of .NET objects\n // we choose to override the spec and serialize ticks outright.\n // see also https://json.codeplex.com/discussions/212067 \n member __.WriteDate (tag : string) value = \n if isBsonWriter then\n writePrimitive jsonWriter (omitTag ()) tag value.Ticks\n else\n writePrimitive jsonWriter (omitTag ()) tag value\n\n member __.WriteBytes (tag : string) (value : byte []) =\n if not <| omitTag () then \n jsonWriter.WritePropertyName tag\n\n if obj.ReferenceEquals(value, null) then\n jsonWriter.WriteNull()\n else\n jsonWriter.WriteValue value\n\n member __.IsPrimitiveArraySerializationSupported = false\n member __.WritePrimitiveArray _ _ = raise <| NotSupportedException()\n\n member __.Dispose () = jsonWriter.Flush()" }, { "path": "src/test/resources/samples/langs/F#/PerformanceTesters.fs", "content": "namespace Nessos.FsPickler.Tests\n\n open PerfUtil\n open PerfUtil.NUnit\n\n open NUnit.Framework\n\n open Nessos.FsPickler\n open Nessos.FsPickler.Json\n\n []\n type PerfTester () =\n inherit NUnitPerf ()\n\n let tests = PerfTest.OfModuleMarker ()\n\n override __.PerfTests = tests\n\n\n type ``Serializer Comparison`` () =\n inherit PerfTester()\n\n let fsp = FsPickler.initBinary()\n let bfs = new BinaryFormatterSerializer() :> Serializer\n let ndc = new NetDataContractSerializer() :> Serializer\n let jdn = new JsonDotNetSerializer() :> Serializer\n let bdn = new JsonDotNetBsonSerializer () :> Serializer\n let pbn = new ProtoBufSerializer() :> Serializer\n let ssj = new ServiceStackJsonSerializer() :> Serializer\n let sst = new ServiceStackTypeSerializer() :> Serializer\n\n let comparer = new WeightedComparer(spaceFactor = 0.2, leastAcceptableImprovementFactor = 1.)\n let tester = new ImplementationComparer<_>(fsp, [bfs;ndc;jdn;bdn;pbn;ssj;sst], throwOnError = true, warmup = true, comparer = comparer)\n\n override __.PerfTester = tester :> _\n \n\n type ``FsPickler Formats Comparison`` () =\n inherit PerfTester ()\n\n let binary = FsPickler.initBinary()\n let json = FsPickler.initJson()\n let bson = FsPickler.initBson()\n let xml = FsPickler.initXml()\n\n let tester = new ImplementationComparer<_>(binary, [json ; bson; xml], warmup = true, throwOnError = false)\n\n override __.PerfTester = tester :> _\n\n\n type ``Past FsPickler Versions Comparison`` () =\n inherit PerfTester ()\n\n let persistResults = true\n let persistenceFile = \"fspPerf.xml\"\n\n let fsp = FsPickler.initBinary()\n let version = typeof.Assembly.GetName().Version\n let comparer = new WeightedComparer(spaceFactor = 0.2, leastAcceptableImprovementFactor = 0.8)\n let tester = \n new PastImplementationComparer(\n fsp, version, historyFile = persistenceFile, throwOnError = true, warmup = true, comparer = comparer)\n\n override __.PerfTester = tester :> _\n\n []\n member __.Persist() =\n if persistResults then tester.PersistCurrentResults ()" }, { "path": "src/test/resources/samples/langs/F#/PerformanceTests.fs", "content": "namespace Nessos.FsPickler.Tests\n\n open System\n open System.Collections.Generic\n\n open PerfUtil\n\n open Nessos.FsPickler\n open Nessos.FsPickler.Tests.Serializer\n open Nessos.FsPickler.Tests.TestTypes\n\n module PerformanceTests =\n\n type Marker = class end\n\n let guid = Guid.NewGuid()\n\n []\n let ``Value: Guid`` s = roundtrip guid s\n\n let date = DateTime.Now\n\n []\n let ``Value: DateTime`` s = roundtrip date s\n\n []\n let ``Value: String`` s = roundtrip stringValue s\n\n\n let boxed = box ([| 1 .. 1000 |], \"lorem ipsum\")\n\n []\n let ``Boxed Object`` s = roundtrip boxed s\n\n let fsClass = new Class(42, stringValue)\n\n []\n let ``Class: Simple F# Class`` s = roundtrip fsClass s\n\n let serializableClass = new SerializableClass<_>(42, stringValue, [|1..1000|])\n\n []\n let ``Class: ISerializable`` s = roundtrip serializableClass s\n\n let boxedClass = box(Some 42)\n\n []\n let ``Subtype Resolution`` s = roundtrip boxedClass s\n\n let floatArray = Array.init 100000 (fun i -> float i)\n\n []\n let ``Array: Float`` s = roundtrip floatArray s\n\n let intArray = Array.init 100000 id\n\n []\n let ``Array: Int`` s = roundtrip intArray s\n\n let stringArray = Array.init 10000 (fun i -> stringValue + string i)\n \n []\n let ``Array: String`` s = roundtrip stringArray s\n\n let kvarr = [|1..10000|] |> Array.map (fun i -> i, string i)\n\n []\n let ``Array: Key-Value Pairs`` s = roundtrip kvarr s\n\n let duArray = [| for i in 1 .. 10000 -> (Something (\"asdasdasdas\", i)) |]\n\n []\n let ``Array: Discriminated Unions`` s = roundtrip duArray s\n\n let objArray = \n [| \n box 2; box 3; box \"hello\" ; box <| Some 3; box(2,3) ; \n box <| new Class(2, stringValue) ; box <| new SerializableClass(2, stringValue, Some 12); \n box stringValue \n |]\n\n []\n let ``Array: Objects`` s = roundtrip objArray s\n\n\n let array3D = Array3D.init 100 100 100 (fun i j k -> float (i * j + k))\n\n []\n let ``Array: Rank-3 Float`` s = roundtrip array3D s\n\n let bclDict = dict [ for i in 1 .. 1000 -> (string i, i)]\n\n []\n let ``.NET Dictionary`` s = roundtrip bclDict s\n\n let bclStack = new Stack([for i in 1 .. 1000 -> string i])\n\n []\n let ``.NET Stack`` s = roundtrip bclStack s\n\n let bclList = new List([for i in 1 .. 1000 -> string i, i])\n\n []\n let ``.NET List`` s = roundtrip bclList s\n\n let bclSet = new SortedSet<_>([for i in 1 .. 1000 -> string i])\n\n []\n let ``.NET Set`` s = roundtrip bclSet s\n\n let smallTuple = (1, DateTime.Now,\"hello\")\n\n []\n let ``FSharp: Tuple Small`` s = roundtrip smallTuple s\n\n let largeTuple = (stringValue, 1, 2, 3, true, \"\", Some(3.14, [2]), 3, 2, 1, stringValue)\n\n []\n let ``FSharp: Tuple Large`` s =\n roundtrip largeTuple s\n\n let intList = [1..1000]\n\n []\n let ``FSharp: List Int`` s = roundtrip intList s\n\n let stringList = [ for i in 1 .. 1000 -> stringValue + string i ]\n\n []\n let ``FSharp: List String`` s = roundtrip stringList s\n\n let pairList = [ for i in 1 .. 1000 -> (string i, i) ]\n\n []\n let ``FSharp: List Key-Value`` s = roundtrip pairList s\n\n let nestedLst = let n = [1..1000] in [for _ in 1 .. 100 -> n]\n\n []\n let ``FSharp: List Nested`` s = roundtrip nestedLst s\n\n let union = SomethingElse(stringValue, 42, box (Some 42))\n\n []\n let ``FSharp: Union`` s = roundtrip union s\n\n let record = { Int = 42 ; String = stringValue ; Tuple = (13, \"\") }\n\n []\n let ``FSharp: Record`` s = roundtrip record s\n\n let peano = int2Peano 100\n\n []\n let ``FSharp: Peano Rectype`` s = roundtrip peano s\n\n let closure = (@) [ Some([1..100], Set.ofList [1..100]) ]\n\n []\n let ``FSharp: Curried Function`` s = roundtrip closure s\n\n let binTree = mkTree 10\n\n []\n let ``FSharp: Binary Tree`` s = roundtrip binTree s\n\n let intSet = [1..1000] |> List.map string |> set\n\n []\n let ``FSharp: Set`` s = roundtrip intSet s\n\n let fsMap = [1..1000] |> Seq.map (fun i -> (string i,i)) |> Map.ofSeq\n\n []\n let ``FSharp: Map`` s = roundtrip fsMap s\n\n let testType = typeof>\n\n []\n let ``Reflection: Type`` s = roundtrip testType s\n\n let quotationSmall = <@ fun x -> pown 2 x @>\n\n let quotationLarge =\n <@\n async {\n let rec fibAsync n =\n async {\n match n with\n | _ when n < 0 -> return invalidArg \"negative\" \"n\"\n | _ when n < 2 -> return n\n | n ->\n let! fn = fibAsync (n-1)\n let! fnn = fibAsync (n-2)\n return fn + fnn\n }\n\n let! values = [1..100] |> Seq.map fibAsync |> Async.Parallel\n return Seq.sum values\n }\n @>\n\n []\n let ``FSharp: Quotation Small`` s = roundtrip quotationSmall s\n\n []\n let ``FSharp: Quotation Large`` s = roundtrip quotationLarge s" }, { "path": "src/test/resources/samples/langs/F#/sample.fs", "content": "module Sample\n\nopen System\n\ntype Foo =\n {\n Bar : string\n }\n\ntype Baz = interface end\n\nlet Sample1(xs : int list) : string =\n xs\n |> List.map (fun x -> string x)\n |> String.concat \",\"\n" }, { "path": "src/test/resources/samples/langs/FLUX/gameserver.fx", "content": "typedef engine isEngineMessage;\ntypedef turn isTurnMessage;\ntypedef connect isConnectMessage;\ntypedef disconnect isDisconnectMessage;\n\nClientMessage(char* data) => ();\nParseMessage(char* data) => (int type, int client, char* data);\nReadMessage(int type, int client, char* data) => ();\n\nParseEngine(int type, int client, char* data) => (int client, int direction);\nDoEngine(int client, int direction) => ();\n\nParseTurn(int type, int client, char* data) => (int client, int direction);\nDoTurn(int client, int direction) => ();\n\nParseConnect(int type, int client, char* data) \n\t=> (int client, char* host, int port);\nDoConnect(int client, char* host, int port) => ();\n\nParseDisconnect(int type, int client, char* data) => (int client);\nDoDisconnect(int client) => ();\n\nUpdateBoard(ClientList clients) => (ClientList clients);\nSendData(ClientList clients) => ();\n\nDoUpdate(ClientList clients) => ();\n\nDataTimer() => (ClientList clients);\n\nGetClients() => (ClientList clients);\n\nWait(ClientList clients) => (ClientList clients);\n\nListen () => (char* data);\n\nsource Listen => ClientMessage;\nsource DataTimer => DoUpdate;\n\nDataTimer = GetClients -> Wait;\n\nDoUpdate = UpdateBoard -> SendData;\n\nClientMessage=ParseMessage -> ReadMessage;\n\nReadMessage:[engine, _, _] = ParseEngine -> DoEngine;\nReadMessage:[turn, _, _] = ParseTurn -> DoTurn;\nReadMessage:[connect, _, _] = ParseConnect -> DoConnect;\nReadMessage:[disconnect, _, _] = ParseDisconnect -> DoDisconnect;\n\natomic GetClients:{client_lock};\natomic DoConnect:{client_lock};\natomic DoDisconnect:{client_lock};\n\n\n" }, { "path": "src/test/resources/samples/langs/FLUX/imageserver.fx", "content": "typedef xml TestXML;\ntypedef html TestHTML;\n\ntypedef inCache TestInCache;\n\nPage (int socket) => ();\n\nReadRequest (int socket) => (int socket, bool close, image_tag *request);\n\nCheckCache (int socket, bool close, image_tag *request) \n\t=> (int socket, bool close, image_tag *request);\n\nHandler (int socket, bool close, image_tag *request)\n => (int socket, bool close, image_tag *request);\n\nComplete (int socket, bool close, image_tag *request) => ();\n\nReadInFromDisk (int socket, bool close, image_tag *request)\n => (int socket, bool close, image_tag *request, __u8 *rgb_data);\n\nWrite (int socket, bool close, image_tag *request)\n => (int socket, bool close, image_tag *request);\n\nCompress(int socket, bool close, image_tag *request, __u8 *rgb_data)\n\t=> (int socket, bool close, image_tag *request);\n\nStoreInCache(int socket, bool close, image_tag *request)\n\t=> (int socket, bool close, image_tag *request);\n\nListen () \n\t=> (int socket);\n\nsource Listen => Page;\n\nHandler:[_, _, inCache]=;\nHandler:[_, _, _]=ReadInFromDisk -> Compress -> StoreInCache;\n\nPage = ReadRequest -> CheckCache-> Handler -> Write -> Complete;\n\natomic CheckCache:{cache};\natomic StoreInCache:{cache};\natomic Complete:{cache};\n\nhandle error ReadInFromDisk => FourOhFor;\n" }, { "path": "src/test/resources/samples/langs/FLUX/mbittorrent.fx", "content": "typedef choke TestChoke;\ntypedef unchoke TestUnchoke;\ntypedef interested TestInterested;\ntypedef uninterested TestUninterested;\ntypedef request TestRequest;\ntypedef cancel TestCancel;\ntypedef piece TestPiece;\ntypedef bitfield TestBitfield;\ntypedef have TestHave;\ntypedef piececomplete TestPieceComplete;\n\nCheckinWithTracker (torrent_data_t *tdata)\n => ();\n\nSendRequestToTracker (torrent_data_t *tdata)\n => (torrent_data_t *tdata, int socket);\n \nGetTrackerResponse (torrent_data_t *tdata, int socket)\n => ();\n\nUpdateChokeList (torrent_data_t *tdata)\n => ();\n\nPickChoked (torrent_data_t *tdata)\n => (torrent_data_t *tdata, chokelist_t clist);\n \nSendChokeUnchoke (torrent_data_t *tdata, chokelist_t clist)\n => ();\n \nSetupConnection (torrent_data_t *tdata, int socket)\n => ();\n \nHandshake (torrent_data_t *tdata, int socket)\n => (torrent_data_t *tdata, client_data_t *client);\n \nSendBitfield (torrent_data_t *tdata, client_data_t *client)\n => ();\n\nMessage (torrent_data_t *tdata, client_data_t *client)\n => ();\n \nReadMessage (torrent_data_t *tdata, client_data_t *client)\n => (torrent_data_t *tdata, client_data_t *client, int type, int length, char *payload);\n \nHandleMessage (torrent_data_t *tdata, client_data_t *client, int type, int length, char *payload)\n => (client_data_t *client);\n \nMessageDone (client_data_t *client)\n => ();\n \nCompletePiece (torrent_data_t *tdata, client_data_t *client, int piece)\n => (torrent_data_t *tdata, client_data_t *client);\n\nVerifyPiece (torrent_data_t *tdata, client_data_t *client, int piece)\n => (torrent_data_t *tdata, client_data_t *client, int piece);\n\nSendHave (torrent_data_t *tdata, client_data_t *client, int piece)\n => (torrent_data_t *tdata, client_data_t *client);\n\nSendUninterested (torrent_data_t *tdata, client_data_t *client)\n => (torrent_data_t *tdata, client_data_t *client);\n \nChoke (torrent_data_t *tdata, client_data_t *client, int type, int length, char *payload)\n => (client_data_t *client);\n \nCancel (torrent_data_t *tdata, client_data_t *client, int type, int length, char *payload)\n => (client_data_t *client);\n\nInterested (torrent_data_t *tdata, client_data_t *client, int type, int length, char *payload)\n => (client_data_t *client);\n\nUninterested (torrent_data_t *tdata, client_data_t *client, int type, int length, char *payload)\n => (client_data_t *client);\n\nBitfield (torrent_data_t *tdata, client_data_t *client, int type, int length, char *payload)\n => (client_data_t *client);\n\nUnchoke (torrent_data_t *tdata, client_data_t *client, int type, int length, char *payload)\n => (torrent_data_t *tdata, client_data_t *client);\n\nSendRequest (torrent_data_t *tdata, client_data_t *client)\n => (client_data_t *client);\n\nHave (torrent_data_t *tdata, client_data_t *client, int type, int length, char *payload)\n => (torrent_data_t *tdata, client_data_t *client);\n\nPiece (torrent_data_t *tdata, client_data_t *client, int type, int length, char *payload)\n => (torrent_data_t *tdata, client_data_t *client, int piece);\n\nRequest (torrent_data_t *tdata, client_data_t *client, int type, int length, char *payload)\n => (client_data_t *client);\n \nSendKeepAlives (torrent_data_t *tdata)\n => ();\n\nGetClients () \n => (int maxfd, fd_set *fds);\n\nSelectSockets (int maxfd, fd_set *fds)\n => (fd_set *fds);\n\nCheckSockets (fd_set *fds)\n => (torrent_data_t *tdata, client_data_t *client);\n\nTrackerTimer () \n => (torrent_data_t *tdata);\n\nChokeTimer ()\n => (torrent_data_t *tdata);\n\nConnect ()\n => (torrent_data_t *tdata, int socket);\n\nKeepAliveTimer ()\n => (torrent_data_t *tdata);\n\nListen ()\n => (torrent_data_t *tdata, client_data_t *client);\n\nsource TrackerTimer => CheckinWithTracker;\nsource ChokeTimer => UpdateChokeList;\nsource Connect => SetupConnection;\nsource Listen => Message;\nsource KeepAliveTimer => SendKeepAlives;\n\nListen = GetClients -> SelectSockets -> CheckSockets;\nCheckinWithTracker = SendRequestToTracker -> GetTrackerResponse;\nUpdateChokeList = PickChoked -> SendChokeUnchoke;\nSetupConnection = Handshake -> SendBitfield;\nMessage = ReadMessage -> HandleMessage -> MessageDone;\n\nCompletePiece:[_, _, piececomplete] = VerifyPiece -> SendHave -> SendUninterested;\n\nHandleMessage:[_, _, choke, _, _] = Choke;\nHandleMessage:[_, _, unchoke, _, _] = Unchoke -> SendRequest;\nHandleMessage:[_, _, interested, _, _] = Interested;\n\nHandleMessage:[_, _, uninterested, _, _] = Uninterested;\nHandleMessage:[_, _, request, _, _] = Request;\nHandleMessage:[_, _, cancel, _, _] = Cancel;\nHandleMessage:[_, _, piece, _, _] = Piece -> CompletePiece -> SendRequest;\nHandleMessage:[_, _, bitfield, _, _] = Bitfield;\nHandleMessage:[_, _, have, _, _] = Have -> SendRequest;\n\natomic GetClients:{BigLock};\natomic CheckSockets:{BigLock};\natomic Message:{BigLock};\natomic CheckinWithTracker:{BigLock};\natomic UpdateChokeList:{BigLock};\natomic SetupConnection:{BigLock};\natomic SendKeepAlives:{BigLock};\n" }, { "path": "src/test/resources/samples/langs/FLUX/test.fx", "content": "// concrete node signatures\nListen ()\n => (int socket);\n\nReadRequest (int socket)\n => (int socket, bool close, image_tag *request);\n\nCheckCache (int socket, bool close, image_tag *request)\n => (int socket, bool close, image_tag *request);\n\n// omitted for space:\n// ReadInFromDisk, StoreInCache\nCompress (int socket, bool close, image_tag *request, __u8 *rgb_data)\n => (int socket, bool close, image_tag *request);\nWrite (int socket, bool close, image_tag *request)\n => (int socket, bool close, image_tag *request);\nComplete (int socket, bool close, image_tag *request) => ();\n\n// source node\nsource Listen => Image;\n\n// abstract node\nImage = ReadRequest -> CheckCache -> Handler -> Write -> Complete;\n\n// predicate type & dispatch\ntypedef hit TestInCache;\nHandler:[_, _, hit] = ;\nHandler:[_, _, _] =\nReadInFromDisk -> Compress -> StoreInCache;\n\n// error handler\nhandle error ReadInFromDisk => FourOhFor;\n\n// atomicity constraints\natomic CheckCache:{cache};\natomic StoreInCache:{cache};\natomic Complete:{cache};\n\n" }, { "path": "src/test/resources/samples/langs/Factor/hello-world.factor", "content": "USE: io\n IN: hello-world\n \n : hello ( -- ) \"Hello world\" print ;\n \n MAIN: hello\n " }, { "path": "src/test/resources/samples/langs/Fantom/sample1.fan", "content": "/*\n * Author: Robert Koeninger\n * License: WTFPL (http://www.wtfpl.net/)\n */\n\nclass Spelling {\n\n ** Load sample text and offer corrections for input\n static Void main(Str[] args) {\n text := File.os(\"big.txt\").readAllStr\n counts := Str:Int[:] { def = 0 }\n text.split.each |word| { counts[word] += 1 }\n args.each |arg| { echo(correction(counts, arg)) }\n }\n\n static const Range letters := Range.makeInclusive(97, 122)\n\n ** Most probable spelling correction for `word`.\n static Str correction(Str:Int counts, Str word) {\n candidates(counts, word).max |x, y| { counts[x] <=> counts[y] }\n }\n\n ** Generate possible spelling corrections for `word`.\n static Str[] candidates(Str:Int counts, Str word) {\n result := known(counts, Str[word])\n if (result.size > 0) return result\n\n result = known(counts, edits1(word))\n if (result.size > 0) return result\n\n result = known(counts, edits2(word))\n if (result.size > 0) return result\n\n return Str[word]\n }\n\n ** The subset of `words` that appear in the map of `counts`.\n static Str[] known(Str:Int counts, Str[] words) {\n words.findAll |word, i| { counts[word] > 0 }.unique\n }\n\n ** All edits that are one edit away from `word`.\n static Str[] edits1(Str word) {\n edits := Str[,]\n\n for (i := 0; i < word.size; ++i) {\n edits.add(delete(word, i))\n\n if (i < word.size - 2) {\n edits.add(transpose(word, i))\n }\n\n edits.addAll(replace(word, i))\n edits.addAll(insert(word, i))\n }\n\n edits = edits.unique\n edits.remove(word)\n return edits\n }\n\n ** Word with `i`th letter removed.\n static Str delete(Str word, Int i) {\n left := word.getRange(Range.makeExclusive(0, i))\n right := word.getRange(Range.makeExclusive(i + 1, word.size))\n return left + right\n }\n\n ** Word with `i`th and `i+1`st letter swapped.\n static Str transpose(Str word, Int i) {\n left := word.getRange(Range.makeExclusive(0, i))\n right := word.getRange(Range.makeExclusive(i, word.size))\n first := right.get(0).toChar\n second := right.get(1).toChar\n rest := right.getRange(Range.makeExclusive(2, right.size))\n return left + second + first + rest\n }\n\n ** Word with `i`th letter replaced with every other letter.\n static Str[] replace(Str word, Int i) {\n left := word.getRange(Range.makeExclusive(0, i))\n right := word.getRange(Range.makeExclusive(i + 1, word.size))\n return letters.map |ch| { left + ch.toChar + right }\n }\n\n ** Word with each letter inserted at `i`.\n static Str[] insert(Str word, Int i) {\n left := word.getRange(Range.makeExclusive(0, i))\n right := word.getRange(Range.makeExclusive(i, word.size))\n return letters.map |ch| { left + ch.toChar + right }\n }\n\n ** All edits that are two edits away from `word`.\n static Str[] edits2(Str word) {\n (Str[])(edits1(word).map |w| { edits1(w) }.flatten)\n }\n}\n" }, { "path": "src/test/resources/samples/langs/Fantom/sample2.fan", "content": "/*\n * Author: Robert Koeninger\n * License: WTFPL (http://www.wtfpl.net/)\n */\n\nmixin Expr\n{\n abstract Obj? eval()\n}\n\nclass Constant : Expr\n{\n Obj? value\n\n new make(Obj? value) { this.value = value }\n override Obj? eval() { value }\n}\n\nenum class Op\n{\n plus,\n minus\n}\n\nclass Infix : Expr\n{\n Op op\n Expr left\n Expr right\n\n new make(Op op, Expr left, Expr right)\n {\n this.op = op\n this.left = left\n this.right = right\n }\n\n override Obj? eval()\n {\n switch (op)\n {\n case Op.plus:\n return (Int)left.eval() + (Int)right.eval()\n case Op.minus:\n return (Int)left.eval() - (Int)right.eval()\n default:\n throw Err(\"undefined Op\")\n }\n }\n}\n" }, { "path": "src/test/resources/samples/langs/Filebench WML/copyfiles.f", "content": "#\n# CDDL HEADER START\n#\n# The contents of this file are subject to the terms of the\n# Common Development and Distribution License (the \"License\").\n# You may not use this file except in compliance with the License.\n#\n# You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE\n# or http://www.opensolaris.org/os/licensing.\n# See the License for the specific language governing permissions\n# and limitations under the License.\n#\n# When distributing Covered Code, include this CDDL HEADER in each\n# file and include the License file at usr/src/OPENSOLARIS.LICENSE.\n# If applicable, add the following below this CDDL HEADER, with the\n# fields enclosed by brackets \"[]\" replaced with your own identifying\n# information: Portions Copyright [yyyy] [name of copyright owner]\n#\n# CDDL HEADER END\n#\n#\n# Copyright 2009 Sun Microsystems, Inc. All rights reserved.\n# Use is subject to license terms.\n#\n\nset $dir=/tmp\nset $nfiles=1000\nset $meandirwidth=20\nset $meanfilesize=16k\nset $iosize=1m\nset $nthreads=1\n\nset mode quit firstdone\n\ndefine fileset name=bigfileset,path=$dir,size=$meanfilesize,entries=$nfiles,dirwidth=$meandirwidth,prealloc=100,paralloc\ndefine fileset name=destfiles,path=$dir,size=$meanfilesize,entries=$nfiles,dirwidth=$meandirwidth\n\ndefine process name=filereader,instances=1\n{\n thread name=filereaderthread,memsize=10m,instances=$nthreads\n {\n flowop openfile name=openfile1,filesetname=bigfileset,fd=1\n flowop readwholefile name=readfile1,fd=1,iosize=$iosize\n flowop createfile name=createfile2,filesetname=destfiles,fd=2\n flowop writewholefile name=writefile2,fd=2,srcfd=1,iosize=$iosize\n flowop closefile name=closefile1,fd=1\n flowop closefile name=closefile2,fd=2\n }\n}\n\necho \"Copyfiles Version 3.0 personality successfully loaded\"\n" }, { "path": "src/test/resources/samples/langs/Filterscript/colormatrix.fs", "content": "/*\n * Copyright (C) 2012 The Android Open Source Project\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\n#include \"ip.rsh\"\n\nstatic rs_matrix4x4 Mat;\n\nvoid init() {\n rsMatrixLoadIdentity(&Mat);\n}\n\nvoid setMatrix(rs_matrix4x4 m) {\n Mat = m;\n}\n\nuchar4 __attribute__((kernel)) root(uchar4 in) {\n float4 f = convert_float4(in);\n f = rsMatrixMultiply(&Mat, f);\n f = clamp(f, 0.f, 255.f);\n return convert_uchar4(f);\n}\n\n" }, { "path": "src/test/resources/samples/langs/Filterscript/fs_kernel.fs", "content": "#pragma version(1)\n#pragma rs java_package_name(foo)\n\nint __attribute__((kernel)) root(uint32_t ain) {\n return 0;\n}\n\nvoid __attribute__((kernel)) in_only(uint32_t ain) {\n}\n\nint __attribute__((kernel)) out_only() {\n return 0;\n}\n\nint __attribute__((kernel)) everything(uint32_t ain, uint32_t x, uint32_t y) {\n return 0;\n}\n\n" }, { "path": "src/test/resources/samples/langs/Formatted/NiAlH_jea.eam.fs", "content": "see James E Angelo, Neville R Moody, Michael I Baskes\n\"Trapping of hydrogen to lattice defects in nickel\", Modelling and\nSimulation in Materials Science & Engineering, vol. 3, pp. 289-307 (1995)\n 3 Ni Al H\n 1000 0.1300722995578975E-01 1000 0.5678391959798995E-02 0.5650000000000000E+01\n 28 58.710 3.5200 fcc \n 0.0000000000000000E+00 -0.1332662793615358E+00 -0.1452921454581837E+00 -0.1523531912368142E+00 -0.1581862523552362E+00\n -0.1639082041116888E+00 -0.1699426545382059E+00 -0.1764570476376752E+00 -0.1835109199136706E+00 -0.1911112227682255E+00\n -0.1992425242400153E+00 -0.2078735593152208E+00 -0.2169708161705926E+00 -0.2264981576262208E+00 -0.2364198685383210E+00\n -0.2467010212354559E+00 -0.2573089641630046E+00 -0.2682127177172648E+00 -0.2793832876249742E+00 -0.2907936148383499E+00\n -0.3024184814336230E+00 -0.3142343948579320E+00 -0.3262194641112117E+00 -0.3383532759151806E+00 -0.3506164751688710E+00\n -0.3629930849818281E+00 -0.3754632992578539E+00 -0.3880132539605681E+00 -0.4006282340364624E+00 -0.4132944249954278E+00\n -0.4259988342802910E+00 -0.4387292219786865E+00 -0.4514740394367802E+00 -0.4642223746432430E+00 -0.4769639034723383E+00\n -0.4896888460377404E+00 -0.5023882063058194E+00 -0.5150514008208491E+00 -0.5276733170954859E+00 -0.5402439685620584E+00\n -0.5527559057851690E+00 -0.5652019937956556E+00 -0.5775754037468577E+00 -0.5898697374354533E+00 -0.6020783706550734E+00\n -0.6141958187973504E+00 -0.6262163111449786E+00 -0.6381344390125845E+00 -0.6499424015305308E+00 -0.6616382540753616E+00\n -0.6731993263249691E+00 -0.6845796030423443E+00 -0.6957060801011892E+00 -0.7064948085245568E+00 -0.7168695757140675E+00\n -0.7267732527299753E+00 -0.7361710465584164E+00 -0.7450484575868490E+00 -0.7534069422321110E+00 -0.7612592416825148E+00\n -0.7686253227224800E+00 -0.7755292274454266E+00 -0.7819968032841373E+00 -0.7880540868431538E+00 -0.7937266203490037E+00\n -0.7990383766649565E+00 -0.8040117767243267E+00 -0.8086674652146524E+00 -0.8130242928279436E+00 -0.8170993717012625E+00\n -0.8209081734003210E+00 -0.8244646490459413E+00 -0.8277813583284139E+00 -0.8308695990447905E+00 -0.8337395320876144E+00\n -0.8364002989992798E+00 -0.8388601306360481E+00 -0.8411264464017005E+00 -0.8432059440847066E+00 -0.8451046806746021E+00\n -0.8468281447278194E+00 -0.8483813209452364E+00 -0.8497687476559737E+00 -0.8509945678935900E+00 -0.8520625747193371E+00\n -0.8529762514032520E+00 -0.8537388100896948E+00 -0.8543532100632678E+00 -0.8548222073722460E+00 -0.8551483635456201E+00\n -0.8553340719766496E+00 -0.8553815772750362E+00 -0.8552929923971586E+00 -0.8550703138095166E+00 -0.8547151651374190E+00\n -0.8542288599579191E+00 -0.8536141001159478E+00 -0.8528770375410186E+00 -0.8520101609408499E+00 -0.8510194840111716E+00\n -0.8499064644469634E+00 -0.8486725211340236E+00 -0.8473190381844873E+00 -0.8458473685456269E+00 -0.8442588372306652E+00\n -0.8425547442066161E+00 -0.8407363669700096E+00 -0.8388049628370240E+00 -0.8367617709719433E+00 -0.8346080141771175E+00\n -0.8323449004663495E+00 -0.8299736244409459E+00 -0.8274953684882504E+00 -0.8249113038193059E+00 -0.8222225913624328E+00\n -0.8194312028270083E+00 -0.8165381656110142E+00 -0.8135381986589678E+00 -0.8104430318985472E+00 -0.8072486480744487E+00\n -0.8039562298106482E+00 -0.8005669360809051E+00 -0.7970819051712361E+00 -0.7935022573432313E+00 -0.7898290971921718E+00\n -0.7860635135890277E+00 -0.7822065375250205E+00 -0.7782588382932190E+00 -0.7742197532367605E+00 -0.7700870580234671E+00\n -0.7658477859557991E+00 -0.7614923740747592E+00 -0.7569976237158578E+00 -0.7523403043259940E+00 -0.7474924540260339E+00\n -0.7424262490644793E+00 -0.7371152605107092E+00 -0.7315359786377336E+00 -0.7256688371398212E+00 -0.7194997208059100E+00\n -0.7130147649374017E+00 -0.7062107830858579E+00 -0.6990840527339586E+00 -0.6916355099263285E+00 -0.6838688833277935E+00\n -0.6757902321840703E+00 -0.6674074545321318E+00 -0.6587298477273151E+00 -0.6497677278712075E+00 -0.6405321085533657E+00\n -0.6310344355558080E+00 -0.6212863721358168E+00 -0.6112922466782784E+00 -0.6010783652240157E+00 -0.5906465248553197E+00\n -0.5800085678384548E+00 -0.5691757383537599E+00 -0.5581582564186043E+00 -0.5469659281367214E+00 -0.5356081318998811E+00\n -0.5240938131155666E+00 -0.5124314854938561E+00 -0.5006292372993926E+00 -0.4886947412876452E+00 -0.4766352673015746E+00\n -0.4644576967166927E+00 -0.4521685380961173E+00 -0.4397739435565100E+00 -0.4272797254586216E+00 -0.4146913731272406E+00\n -0.4020140693777172E+00 -0.3892527066834290E+00 -0.3764119028647137E+00 -0.3634960162151266E+00 -0.3505091600038455E+00\n -0.3374552163098947E+00 -0.3243378491869073E+00 -0.3111605171690215E+00 -0.2979264851148429E+00 -0.2846388353950218E+00\n -0.2713004784405015E+00 -0.2579141626735364E+00 -0.2444824838465252E+00 -0.2310078938154909E+00 -0.2174927087734169E+00\n -0.2039391169721405E+00 -0.1903491859578246E+00 -0.1767248693464794E+00 -0.1630680131652866E+00 -0.1493803617833507E+00\n -0.1356635634555516E+00 -0.1219191755016809E+00 -0.1081486691423308E+00 -0.9435343401120377E-01 -0.8054492422289172E-01\n -0.6670414857713070E-01 -0.5284236389642416E-01 -0.3896067277847237E-01 -0.2506137114673379E-01 -0.1114505736346416E-01\n 0.2787869992531000E-02 0.1673649714292225E-01 0.3069995798121283E-01 0.4467743152122949E-01 0.5866813997114662E-01\n 0.7267134735307934E-01 0.8668635275736136E-01 0.1007124932111410E+00 0.1147491401988674E+00 0.1287956978815430E+00\n 0.1428516014164529E+00 0.1569163153723068E+00 0.1709893322335105E+00 0.1850701709882827E+00 0.1991583757947666E+00\n 0.2132535147217212E+00 0.2273551785580352E+00 0.2414629796876397E+00 0.2555765510256194E+00 0.2696955450121337E+00\n 0.2838196326609008E+00 0.2979485026581798E+00 0.3120818605100766E+00 0.3262194277345074E+00 0.3403609410961295E+00\n 0.3545061518803436E+00 0.3686548252055175E+00 0.3828067393706931E+00 0.3969616852363487E+00 0.4111194656371424E+00\n 0.4252798948247261E+00 0.4394427979383266E+00 0.4536080105023714E+00 0.4677753779491880E+00 0.4819447551653937E+00\n 0.4961160060612713E+00 0.5102890031615175E+00 0.5244636272329899E+00 0.5386397670398893E+00 0.5528173195811590E+00\n 0.5669961916288884E+00 0.5811763038337503E+00 0.5953575986744184E+00 0.6095400529056221E+00 0.6237236940889446E+00\n 0.6379086197162707E+00 0.6520950167319981E+00 0.6662831791056405E+00 0.6804735214359070E+00 0.6946665872026117E+00\n 0.7088630510277696E+00 0.7230637149920511E+00 0.7372694995930971E+00 0.7514814302896511E+00 0.7657006207512822E+00\n 0.7799282539728765E+00 0.7941655623409360E+00 0.8084138075998624E+00 0.8226742614970703E+00 0.8369481877037046E+00\n 0.8512368254336948E+00 0.8655413750282932E+00 0.8798629856427098E+00 0.8942027450633461E+00 0.9085616716017455E+00\n 0.9229407079527192E+00 0.9373407168612360E+00 0.9517624784199370E+00 0.9662066888041991E+00 0.9806739602523891E+00\n 0.9951648221004206E+00 0.1009679722693299E+01 0.1024219032006336E+01 0.1038783044826459E+01 0.1053371984359273E+01\n 0.1067986006143130E+01 0.1082625202169261E+01 0.1097289605119975E+01 0.1111979192652043E+01 0.1126693891663521E+01\n 0.1141433582496241E+01 0.1156198103032580E+01 0.1170987252656857E+01 0.1185800796057570E+01 0.1200638466853661E+01\n 0.1215499971032784E+01 0.1230384990195972E+01 0.1245293184603845E+01 0.1260224196025355E+01 0.1275177650390923E+01\n 0.1290153160254313E+01 0.1305150327069121E+01 0.1320168743286779E+01 0.1335207994283188E+01 0.1350267660123350E+01\n 0.1365347317171768E+01 0.1380446539557269E+01 0.1395564900502009E+01 0.1410701973522016E+01 0.1425857333509093E+01\n 0.1441030557701353E+01 0.1456221226550525E+01 0.1471428924494518E+01 0.1486653240641253E+01 0.1501893769371186E+01\n 0.1517150110865678E+01 0.1532421871566029E+01 0.1547708664570152E+01 0.1563010109971501E+01 0.1578325835145321E+01\n 0.1593655474987493E+01 0.1608998672109891E+01 0.1624371180506387E+01 0.1639740502114151E+01 0.1655122356345302E+01\n 0.1670516417892671E+01 0.1685922369619611E+01 0.1701339902568634E+01 0.1716768715949499E+01 0.1732208517108212E+01\n 0.1747659021479414E+01 0.1763119952524256E+01 0.1778591041654877E+01 0.1794072028147745E+01 0.1809562659046684E+01\n 0.1825062689057695E+01 0.1840571880435753E+01 0.1856090002865933E+01 0.1871616833338670E+01 0.1887152156020591E+01\n 0.1902695762121880E+01 0.1918247449760493E+01 0.1933807023824201E+01 0.1949374295830467E+01 0.1964949083785456E+01\n 0.1980531212042564E+01 0.1996120511159695E+01 0.2011716817757780E+01 0.2027319974378536E+01 0.2042929829344224E+01\n 0.2058546236616969E+01 0.2074169055660697E+01 0.2089798151303690E+01 0.2105433393602993E+01 0.2121074657710956E+01\n 0.2136721823742874E+01 0.2152374776647946E+01 0.2168033406081115E+01 0.2183697606278244E+01 0.2199367275932566E+01\n 0.2215042318074360E+01 0.2230722639952553E+01 0.2246408152918789E+01 0.2262098772314182E+01 0.2277794417357875E+01\n 0.2293495011038814E+01 0.2309200480010006E+01 0.2324910754483760E+01 0.2340625768131687E+01 0.2356345457985135E+01\n 0.2372069764338704E+01 0.2387798630656611E+01 0.2403532003480336E+01 0.2419269832339658E+01 0.2435012069665014E+01\n 0.2450758670702946E+01 0.2466509593432718E+01 0.2482264798486547E+01 0.2498024249070006E+01 0.2513787910886542E+01\n 0.2529555752062322E+01 0.2545327743074537E+01 0.2561103856680077E+01 0.2576884067847857E+01 0.2592668353691494E+01\n 0.2608456693404804E+01 0.2624249068198495E+01 0.2640045461239012E+01 0.2655845857588801E+01 0.2671650244148466E+01\n 0.2687458609600455E+01 0.2703270944353804E+01 0.2719087240491504E+01 0.2734907491718758E+01 0.2750731693312261E+01\n 0.2766559842071786E+01 0.2782391936272532E+01 0.2798227975619128E+01 0.2814067961200806E+01 0.2829911895447779E+01\n 0.2845759782089161E+01 0.2861611626111980E+01 0.2877467433721947E+01 0.2893327212308449E+01 0.2909190970421690E+01\n 0.2925058717783131E+01 0.2940930465370343E+01 0.2956806225646105E+01 0.2972686013021615E+01 0.2988569844663630E+01\n 0.3004457741744432E+01 0.3020349731207816E+01 0.3036245848084562E+01 0.3052146138327856E+01 0.3068050662093938E+01\n 0.3083959497337403E+01 0.3099872743561932E+01 0.3115790525549542E+01 0.3131712996890727E+01 0.3147640343150343E+01\n 0.3163572784533585E+01 0.3179510577942580E+01 0.3195454018354155E+01 0.3211403439482311E+01 0.3227359213718501E+01\n 0.3243321751378190E+01 0.3259291499296893E+01 0.3275268938843027E+01 0.3291254583421065E+01 0.3307248975552397E+01\n 0.3323252683617341E+01 0.3339266298346260E+01 0.3355290429139160E+01 0.3371325700295216E+01 0.3387372747215409E+01\n 0.3403432212646379E+01 0.3419504743012368E+01 0.3435590984884243E+01 0.3451691581620338E+01 0.3467807170206726E+01\n 0.3483938378319635E+01 0.3500085821623841E+01 0.3516250101317652E+01 0.3532431801926151E+01 0.3548631489345226E+01\n 0.3564849709131778E+01 0.3581086985033565E+01 0.3597344652416893E+01 0.3613622490530517E+01 0.3629920843003930E+01\n 0.3646240132058665E+01 0.3662580753832387E+01 0.3678943078161282E+01 0.3695327448517830E+01 0.3711734182088804E+01\n 0.3728163569978022E+01 0.3744615877522165E+01 0.3761091344705235E+01 0.3777590186658585E+01 0.3794112594236921E+01\n 0.3810658734656357E+01 0.3827228752187168E+01 0.3843822768889325E+01 0.3860440885384449E+01 0.3877083181654072E+01\n 0.3893749717858398E+01 0.3910440535169144E+01 0.3927155656609344E+01 0.3943895087897474E+01 0.3960658818286859E+01\n 0.3977446821402751E+01 0.3994259056066866E+01 0.4011095467111076E+01 0.4027955986175584E+01 0.4044840532489744E+01\n 0.4061749013633730E+01 0.4078681326279053E+01 0.4095637356908441E+01 0.4112616982511369E+01 0.4129620071256468E+01\n 0.4146646483140302E+01 0.4163696070611252E+01 0.4180768679168807E+01 0.4197864147938219E+01 0.4214982310220819E+01\n 0.4232122994020187E+01 0.4249286022544283E+01 0.4266471214683492E+01 0.4283678385466899E+01 0.4300907346494270E+01\n 0.4318157906348262E+01 0.4335429870982637E+01 0.4352723044092500E+01 0.4370037227462390E+01 0.4387372221295607E+01\n 0.4404727824526063E+01 0.4422103835109979E+01 0.4439500050301689E+01 0.4456916266912927E+01 0.4474352281555639E+01\n 0.4491807890868955E+01 0.4509282891733321E+01 0.4526777081468666E+01 0.4544290258021121E+01 0.4561822220135298E+01\n 0.4579372767515736E+01 0.4596941700976757E+01 0.4614528822579842E+01 0.4632133935763207E+01 0.4649756845459109E+01\n 0.4667397358203146E+01 0.4685055282234032E+01 0.4702730427585877E+01 0.4720422606171269E+01 0.4738131631857456E+01\n 0.4755857320535952E+01 0.4773599490184296E+01 0.4791357960922696E+01 0.4809132555063428E+01 0.4826923097156268E+01\n 0.4844729414026645E+01 0.4862551334810888E+01 0.4880388690984844E+01 0.4898241316389871E+01 0.4916109047253045E+01\n 0.4933991722205747E+01 0.4951889182295560E+01 0.4969801270997834E+01 0.4987727834222142E+01 0.5005668720316748E+01\n 0.5023623780069656E+01 0.5041592866707418E+01 0.5059575835892119E+01 0.5077572545715171E+01 0.5095582856689347E+01\n 0.5113606631739316E+01 0.5131643736190284E+01 0.5149694037754543E+01 0.5167757406516841E+01 0.5185833714918900E+01\n 0.5203922837741345E+01 0.5222024652085636E+01 0.5240139037355135E+01 0.5258265875233761E+01 0.5276405049664660E+01\n 0.5294556446828821E+01 0.5312719955121622E+01 0.5330895465129331E+01 0.5349083197331439E+01 0.5367282875848076E+01\n 0.5385494235244209E+01 0.5403717174591350E+01 0.5421951595034059E+01 0.5440197399763505E+01 0.5458454493990288E+01\n 0.5476722784918579E+01 0.5495002181717851E+01 0.5513292595496480E+01 0.5531593939274245E+01 0.5549906127955438E+01\n 0.5568229078301286E+01 0.5586562708902733E+01 0.5604906940153441E+01 0.5623261694222876E+01 0.5641626895028466E+01\n 0.5660002468209782E+01 0.5678388341101183E+01 0.5696784442705152E+01 0.5715190703666806E+01 0.5733607056245972E+01\n 0.5752033434292926E+01 0.5770469773221294E+01 0.5788916009983083E+01 0.5807372083043617E+01 0.5825837932355000E+01\n 0.5844313499333083E+01 0.5862798726831699E+01 0.5881293559118404E+01 0.5899797941851205E+01 0.5918311822053070E+01\n 0.5936835148090665E+01 0.5955367869649308E+01 0.5973909937710687E+01 0.5992461304530181E+01 0.6010993710199870E+01\n 0.6029563495483089E+01 0.6048142443794930E+01 0.6066730512264272E+01 0.6085327659184557E+01 0.6103933843993559E+01\n 0.6122549027251964E+01 0.6141173170624000E+01 0.6159806236856411E+01 0.6178448189759933E+01 0.6197098994189034E+01\n 0.6215758616023336E+01 0.6234427022148239E+01 0.6253104180437035E+01 0.6271790059732240E+01 0.6290484629827574E+01\n 0.6309187861451164E+01 0.6327899726246912E+01 0.6346620196758565E+01 0.6365349246411810E+01 0.6384086849498459E+01\n 0.6402832981160216E+01 0.6421587617372310E+01 0.6440350734927804E+01 0.6459122311422306E+01 0.6477902325238560E+01\n 0.6496690755531631E+01 0.6515487582214305E+01 0.6534292785942100E+01 0.6553106348100002E+01 0.6571928250787252E+01\n 0.6590758476804609E+01 0.6609597009640567E+01 0.6628443833458164E+01 0.6647298933081430E+01 0.6666162293983589E+01\n 0.6685033902273446E+01 0.6703913744683604E+01 0.6722801808558643E+01 0.6741698081842145E+01 0.6760602553065809E+01\n 0.6779515211338037E+01 0.6798436046331943E+01 0.6817365048274937E+01 0.6836302207937280E+01 0.6855247516621816E+01\n 0.6874200966153282E+01 0.6893162548867991E+01 0.6912132257603389E+01 0.6931110085688530E+01 0.6950096026934304E+01\n 0.6969090075623598E+01 0.6988092226501735E+01 0.7007102474767507E+01 0.7026120816064235E+01 0.7045147246470421E+01\n 0.7064181762491003E+01 0.7083224361049062E+01 0.7102275039477362E+01 0.7121333795510111E+01 0.7140400627274076E+01\n 0.7159475533281437E+01 0.7178558512421901E+01 0.7197649563954585E+01 0.7216748687500626E+01 0.7235855883035654E+01\n 0.7254971150883136E+01 0.7274094491705881E+01 0.7293225906500751E+01 0.7312365396590522E+01 0.7331512963616746E+01\n 0.7350668609535120E+01 0.7369832336606407E+01 0.7389004147392185E+01 0.7408184044746747E+01 0.7427372031812411E+01\n 0.7446568112012670E+01 0.7465772289046285E+01 0.7484984566881565E+01 0.7504204949750658E+01 0.7523433442143897E+01\n 0.7542670048804212E+01 0.7561914774721672E+01 0.7581167625127947E+01 0.7600428605492169E+01 0.7619697721514100E+01\n 0.7638974979120491E+01 0.7658260384459254E+01 0.7677553943895177E+01 0.7696855664005213E+01 0.7716165551573454E+01\n 0.7735483613586325E+01 0.7754812044852841E+01 0.7774146430634772E+01 0.7793489013893222E+01 0.7812839802364948E+01\n 0.7832198803967884E+01 0.7851566026796888E+01 0.7870941479120802E+01 0.7890325169377391E+01 0.7909717106169680E+01\n 0.7929117298262355E+01 0.7948525754578284E+01 0.7967942484194026E+01 0.7987367496337072E+01 0.8006800800381754E+01\n 0.8026242405846276E+01 0.8045692322388845E+01 0.8065150559804493E+01 0.8084617128021762E+01 0.8104092037099576E+01\n 0.8123575297224079E+01 0.8143066918705415E+01 0.8162566911974665E+01 0.8182075287581299E+01 0.8201592056189469E+01\n 0.8221117228575778E+01 0.8240650815626054E+01 0.8260192828332890E+01 0.8279743277792548E+01 0.8299302175202868E+01\n 0.8318869531860187E+01 0.8338445359156225E+01 0.8358029668577160E+01 0.8377622471699610E+01 0.8397223780188767E+01\n 0.8416833605796000E+01 0.8436451960357047E+01 0.8456078855787993E+01 0.8475714304085500E+01 0.8495358317322456E+01\n 0.8515010907646797E+01 0.8534672087279333E+01 0.8554341868511301E+01 0.8574020263702693E+01 0.8593707285279649E+01\n 0.8613402945733171E+01 0.8633107257617183E+01 0.8652820233545668E+01 0.8672541886191894E+01 0.8692272228285830E+01\n 0.8712011272612585E+01 0.8731759032010899E+01 0.8751515519370983E+01 0.8771280747633298E+01 0.8791054729785913E+01\n 0.8810837478864300E+01 0.8830629007948218E+01 0.8850429330161134E+01 0.8870238458668837E+01 0.8890056406676365E+01\n 0.8909883187428321E+01 0.8929718814206822E+01 0.8949563300329515E+01 0.8969416659148337E+01 0.8989278904048760E+01\n 0.9009150048447722E+01 0.9029030105792657E+01 0.9048919089560115E+01 0.9068817013254048E+01 0.9088723890405547E+01\n 0.9108639734570488E+01 0.9128564559328495E+01 0.9148498378283008E+01 0.9168441205058130E+01 0.9188393053299251E+01\n 0.9208353936670647E+01 0.9228323868854844E+01 0.9248302863551771E+01 0.9268290934477903E+01 0.9288288095363413E+01\n 0.9308294359953749E+01 0.9328309742007235E+01 0.9348334255293310E+01 0.9368367913593602E+01 0.9388410730698894E+01\n 0.9408462720409801E+01 0.9428523896534983E+01 0.9448594272890006E+01 0.9468673863297340E+01 0.9488762681584802E+01\n 0.9508860741584925E+01 0.9528968057134250E+01 0.9549084642072614E+01 0.9569210510241618E+01 0.9589345675484282E+01\n 0.9609490151644962E+01 0.9629643952567108E+01 0.9649807092094022E+01 0.9669979584066937E+01 0.9690161442325262E+01\n 0.9710352680705284E+01 0.9730553313039422E+01 0.9750763353155946E+01 0.9770982814877840E+01 0.9791211712022829E+01\n 0.9811450058402528E+01 0.9831697867820566E+01 0.9851955154073806E+01 0.9872221930951270E+01 0.9892498212232454E+01\n 0.9912784011688075E+01 0.9933079343078646E+01 0.9953384220154447E+01 0.9973698656654562E+01 0.9994022666306762E+01\n 0.1001435626282665E+02 0.1003470009456882E+02 0.1005505370279354E+02 0.1007541692221616E+02 0.1009578976686720E+02\n 0.1011617225075480E+02 0.1013656438786407E+02 0.1015696619215623E+02 0.1017737767756941E+02 0.1019779885801728E+02\n 0.1021822974738978E+02 0.1023867035955192E+02 0.1025912070834428E+02 0.1027958080758259E+02 0.1030005067105711E+02\n 0.1032053031253292E+02 0.1034101974574955E+02 0.1036151898442014E+02 0.1038202804223235E+02 0.1040254693284723E+02\n 0.1042307566989899E+02 0.1044361426699570E+02 0.1046416273771851E+02 0.1048472109562067E+02 0.1050528935422884E+02\n 0.1052586752704187E+02 0.1054645562753072E+02 0.1056705366913900E+02 0.1058766166528144E+02 0.1060827962934513E+02\n 0.1062890757468810E+02 0.1064950908609077E+02 0.1067015700336870E+02 0.1069081494185409E+02 0.1071148291478914E+02\n 0.1073216093538781E+02 0.1075284901683381E+02 0.1077354717228192E+02 0.1079425541485676E+02 0.1081497375765323E+02\n 0.1083570221373617E+02 0.1085644079614013E+02 0.1087718951786965E+02 0.1089794839189827E+02 0.1091871743116957E+02\n 0.1093949664859596E+02 0.1096028605705928E+02 0.1098108566940994E+02 0.1100189549846826E+02 0.1102271555702228E+02\n 0.1104354585782909E+02 0.1106438641361461E+02 0.1108523723707299E+02 0.1110609834086651E+02 0.1112696973762601E+02\n 0.1114785143995061E+02 0.1116874346040703E+02 0.1118964581153000E+02 0.1121055850582263E+02 0.1123148155575473E+02\n 0.1125241497376490E+02 0.1127335877225852E+02 0.1129431296360895E+02 0.1131527756015691E+02 0.1133625257420954E+02\n 0.1135723801804252E+02 0.1137823390389772E+02 0.1139924024398471E+02 0.1142025705047962E+02 0.1144128433552578E+02\n 0.1146232211123331E+02 0.1148337038967921E+02 0.1150442918290690E+02 0.1152549850292635E+02 0.1154657836171509E+02\n 0.1156766877121638E+02 0.1158876974333961E+02 0.1160988128996192E+02 0.1163100342292520E+02 0.1165213615403900E+02\n 0.1167327949507859E+02 0.1169443345778498E+02 0.1171559805386622E+02 0.1173677329499617E+02 0.1175795919281455E+02\n 0.1177915575892700E+02 0.1180036300490579E+02 0.1182158094228856E+02 0.1184280958257915E+02 0.1186404893724685E+02\n 0.1188529901772762E+02 0.1190655983542237E+02 0.1192783140169806E+02 0.1194911372788769E+02 0.1197040682528970E+02\n 0.1199171070516803E+02 0.1201302537875296E+02 0.1203435085723962E+02 0.1205568715178919E+02 0.1207703427352811E+02\n 0.1209839223354848E+02 0.1211976104290818E+02 0.1214114071263091E+02 0.1216253125370503E+02 0.1218393267708453E+02\n 0.1220534499368958E+02 0.1222676821440496E+02 0.1224820235008141E+02 0.1226964741153520E+02 0.1229110340954733E+02\n 0.1231257035486524E+02 0.1233404825820068E+02 0.1235553713023114E+02 0.1237703698160018E+02 0.1239854782291576E+02\n 0.1242006966475194E+02 0.1244160251764720E+02 0.1246314639210712E+02 0.1248470129860064E+02 0.1250626724756299E+02\n 0.1252784424939512E+02 0.1254943231446288E+02 0.1257103145309731E+02 0.1259264167559508E+02 0.1261426299221796E+02\n 0.1263589541319379E+02 0.1265753894871477E+02 0.1267919360893930E+02 0.1270085940399096E+02 0.1272253634395807E+02\n 0.1274422443889557E+02 0.1276592369882235E+02 0.1278763413372411E+02 0.1280935575355105E+02 0.1283108856821895E+02\n 0.1285283258760953E+02 0.1287458782156935E+02 0.1289635427991064E+02 0.1291813197241135E+02 0.1293992090881460E+02\n 0.1296172109882920E+02 0.1298353255212942E+02 0.1300535527835513E+02 0.1302718928711147E+02 0.1304903458796954E+02\n 0.1307089119046614E+02 0.1309275910410295E+02 0.1311463833834799E+02 0.1313652890263444E+02 0.1315843080636154E+02\n 0.1318034405889441E+02 0.1320226866956276E+02 0.1322420464766316E+02 0.1324615200245751E+02 0.1326811074317337E+02\n 0.1329008087900448E+02 0.1331206241910968E+02 0.1333405537261467E+02 0.1335605974861005E+02 0.1337807555615254E+02\n 0.1340010280426523E+02 0.1342214150193681E+02 0.1344419165812167E+02 0.1346625328174062E+02 0.1348832638168022E+02\n 0.1351041096679353E+02 0.1353250704589885E+02 0.1355461462778115E+02 0.1357673372119115E+02 0.1359886433484638E+02\n 0.1362100647742997E+02 0.1364316015759144E+02 0.1366532538394614E+02 0.1368750216507624E+02 0.1370969050953028E+02\n 0.1373189042582217E+02 0.1375410192243334E+02 0.1377632500781127E+02 0.1379855969036910E+02 0.1382080597848685E+02\n 0.1384306388051198E+02 0.1386533340475719E+02 0.1388761455950183E+02 0.1390990735299232E+02 0.1393221179344152E+02\n 0.1395452788902909E+02 0.1397685564790063E+02 0.1399919507816944E+02 0.1402154618791462E+02 0.1404390898518284E+02\n 0.1406628347798727E+02 0.1408866967430708E+02 0.1411106758208999E+02 0.1413347720924909E+02 0.1415589856366520E+02\n 0.1417833165318584E+02 0.1420077648562560E+02 0.1422323306876623E+02 0.1424570141035628E+02 0.1426818151811159E+02\n 0.1429067339971510E+02 0.1431317706281675E+02 0.1433569251503422E+02 0.1435821976395167E+02 0.1438075881712129E+02\n 0.1440330968206166E+02 0.1442587236626011E+02 0.1444844687717011E+02 0.1447103322221295E+02 0.1449363140877790E+02\n 0.1451624144422053E+02 0.1453886333586524E+02 0.1456149709100336E+02 0.1458414271689378E+02 0.1460680022076286E+02\n 0.1462946960980574E+02 0.1465215089118382E+02 0.1467483217256191E+02 0.1469751345393999E+02 0.1472019473531807E+02\n 0.0000000000000000E+00 0.1353993104251454E-10 0.8388292241576100E-09 0.9249073098372293E-08 0.5030460210239372E-07\n 0.1857568627085415E-06 0.5369197789403567E-06 0.1310591025996369E-05 0.2826805415934704E-05 0.5547382204843158E-05\n 0.1010438933657199E-04 0.1732779196828242E-04 0.2827168149581216E-04 0.4423859602721504E-04 0.6680154505955162E-04\n 0.9782344112589946E-04 0.1394737204414197E-03 0.1942420040555485E-03 0.2649487116051849E-03 0.3547525922860875E-03\n 0.4671551828778767E-03 0.6060022412741116E-03 0.7754822366296253E-03 0.9801220045380374E-03 0.1224779698140599E-02\n 0.1514635184246249E-02 0.1855178047873591E-02 0.2252193379531577E-02 0.2711745527424523E-02 0.3240160001952968E-02\n 0.3844003722708506E-02 0.4530063798923195E-02 0.5305325033301281E-02 0.6176946336577127E-02 0.7152236236230247E-02\n 0.8238627657747143E-02 0.9443652150831976E-02 0.1077491372619769E-01 0.1224006246116400E-01 0.1384676802438050E-01\n 0.1560269326170134E-01 0.1751546797666743E-01 0.1959266303029807E-01 0.2184176487603834E-01 0.2427015063682662E-01\n 0.2688506382240104E-01 0.2969359077621229E-01 0.3270263793270082E-01 0.3591890995727141E-01 0.3934888883309312E-01\n 0.4299881395089809E-01 0.4687466325027261E-01 0.5098213545355013E-01 0.5532663342634311E-01 0.5991324869200370E-01\n 0.6474674712088738E-01 0.6983155580921956E-01 0.7517175115663279E-01 0.8077104814605506E-01 0.8663279082458433E-01\n 0.9275994397927995E-01 0.9915508599743368E-01 0.1058204028968442E+00 0.1127576835079031E+00 0.1199683157858993E+00\n 0.1274532842288529E+00 0.1352131683733934E+00 0.1432481423386811E+00 0.1515579753861312E+00 0.1601420334607315E+00\n 0.1689992816780165E+00 0.1781282877192849E+00 0.1875272260963912E+00 0.1971938832464155E+00 0.2071256634156783E+00\n 0.2173195952919433E+00 0.2277723393431911E+00 0.2384801958210745E+00 0.2494391133870441E+00 0.2606446983191641E+00\n 0.2720922242578070E+00 0.2837766424487163E+00 0.2956925924423432E+00 0.3078344132088888E+00 0.3201961546291090E+00\n 0.3327715893216590E+00 0.3455542247685515E+00 0.3585373157011766E+00 0.3717138767102711E+00 0.3850766950442213E+00\n 0.3986183435611380E+00 0.4123311938012285E+00 0.4262074291471305E+00 0.4402390580410298E+00 0.4544179272285823E+00\n 0.4687357350008659E+00 0.4831840444068136E+00 0.4977542964098284E+00 0.5124378229635098E+00 0.5272258599826819E+00\n 0.5421095601871498E+00 0.5570800057968556E+00 0.5721282210583372E+00 0.5872451845836121E+00 0.6024218414838124E+00\n 0.6176491152810919E+00 0.6329179195834939E+00 0.6482191695086116E+00 0.6635437928430084E+00 0.6788827409254566E+00\n 0.6942269992431367E+00 0.7095675977309721E+00 0.7248956207653083E+00 0.7402022168441228E+00 0.7554786079469059E+00\n 0.7707160985682907E+00 0.7859060844203938E+00 0.8010400607996875E+00 0.8161096306150647E+00 0.8311065120745426E+00\n 0.8460225460288135E+00 0.8608497029705907E+00 0.8755800896893798E+00 0.8902059555819789E+00 0.9047196986196469E+00\n 0.9191138709734521E+00 0.9333811842999254E+00 0.9475145146896305E+00 0.9615069072817952E+00 0.9753515805486259E+00\n 0.9890419302533513E+00 0.1002571533086473E+01 0.1015934149985090E+01 0.1029123729140496E+01 0.1042134408699634E+01\n 0.1054960519166231E+01 0.1067596585507774E+01 0.1080037328974709E+01 0.1092277668638490E+01 0.1104312722655314E+01\n 0.1116137809262549E+01 0.1127748447515049E+01 0.1139140357768670E+01 0.1150309461918440E+01 0.1161251883398932E+01\n 0.1171963946954482E+01 0.1182442178186937E+01 0.1192683302888721E+01 0.1202684246168965E+01 0.1212442131380551E+01\n 0.1221954278855855E+01 0.1231218204459002E+01 0.1240231617962418E+01 0.1248992421255417E+01 0.1257498706392534E+01\n 0.1265748753489242E+01 0.1273741028472617E+01 0.1281474180694483E+01 0.1288947040414400E+01 0.1296158616159860E+01\n 0.1303108091970871E+01 0.1309794824536052E+01 0.1316218340227214E+01 0.1322378332039313E+01 0.1328274656442483E+01\n 0.1333907330152773E+01 0.1339276526828055E+01 0.1344382573695405E+01 0.1349225948116168E+01 0.1353807274094698E+01\n 0.1358127318736686E+01 0.1362186988662762E+01 0.1365987326382977E+01 0.1369529506637536E+01 0.1372814832709058E+01\n 0.1375844732711431E+01 0.1378620755860210E+01 0.1381144568729309E+01 0.1383417951498597E+01 0.1385442794196838E+01\n 0.1387221092944273E+01 0.1388754946198940E+01 0.1390046551010727E+01 0.1391098199286932E+01 0.1391912274073011E+01\n 0.1392491245851972E+01 0.1392837668865793E+01 0.1392954177462024E+01 0.1392843482468616E+01 0.1392508367599889E+01\n 0.1391951685896345E+01 0.1391176356200982E+01 0.1390185359674514E+01 0.1388981736351864E+01 0.1387568581742103E+01\n 0.1385949043473885E+01 0.1384126317988323E+01 0.1382103647281089E+01 0.1379884315695416E+01 0.1377471646767576E+01\n 0.1374869000126249E+01 0.1372079768447110E+01 0.1369107374463862E+01 0.1365955268036790E+01 0.1362626923279866E+01\n 0.1359125835747256E+01 0.1355455519680076E+01 0.1351619505314043E+01 0.1347621336248676E+01 0.1343464566878517E+01\n 0.1339152759886839E+01 0.1334689483802160E+01 0.1330078310617843E+01 0.1325322813474955E+01 0.1320426564408511E+01\n 0.1315393132157122E+01 0.1310226080036051E+01 0.1304928963873535E+01 0.1299505330010257E+01 0.1293958713361729E+01\n 0.1288292635543297E+01 0.1282510603057466E+01 0.1276616105543136E+01 0.1270612614086314E+01 0.1264503579591840E+01\n 0.1258292431215576E+01 0.1251982574856509E+01 0.1245577391708143E+01 0.1239080236868539E+01 0.1232494438008325E+01\n 0.1225823294095955E+01 0.1219070074179471E+01 0.1212238016223985E+01 0.1205330326004104E+01 0.1198350176050432E+01\n 0.1191300704649328E+01 0.1184185014895046E+01 0.1177006173793340E+01 0.1169767211415667E+01 0.1162471120103017E+01\n 0.1155120853718478E+01 0.1147719326947540E+01 0.1140269414645216E+01 0.1132773951228974E+01 0.1125235730116526E+01\n 0.1117657503207466E+01 0.1110041980407784E+01 0.1102391829196240E+01 0.1094709674231619E+01 0.1086998096999836E+01\n 0.1079259635499933E+01 0.1071496783967914E+01 0.1063711992637463E+01 0.1055907667536516E+01 0.1048086170318704E+01\n 0.1040249818128692E+01 0.1032400883500383E+01 0.1024541594287072E+01 0.1016674133622509E+01 0.1008800639911969E+01\n 0.1000923206852306E+01 0.9930438834801176E+00 0.9851646742469989E+00 0.9772875391210279E+00 0.9694143937135093E+00\n 0.9615471094301068E+00 0.9536875136454389E+00 0.9458373899002650E+00 0.9379984781203971E+00 0.9301724748564474E+00\n 0.9223610335436100E+00 0.9145657647805825E+00 0.9067882366268739E+00 0.8990299749176214E+00 0.8912924635951891E+00\n 0.8835771450567167E+00 0.8758854205168844E+00 0.8682186503851309E+00 0.8605781546565948E+00 0.8529652133160540E+00\n 0.8453810667541574E+00 0.8378269161952663E+00 0.8303039241362116E+00 0.8228132147953376E+00 0.8153558745711390E+00\n 0.8079329525099168E+00 0.8005454607817869E+00 0.7931943751644794E+00 0.7858806355343143E+00 0.7786051463638074E+00\n 0.7713687772253328E+00 0.7641723633003079E+00 0.7570167058933844E+00 0.7499025729511121E+00 0.7428306995846062E+00\n 0.7358017885957079E+00 0.7288165110062022E+00 0.7218755065895981E+00 0.7149793844050807E+00 0.7081287233331618E+00\n 0.7013240726126531E+00 0.6945659523785421E+00 0.6878548542003931E+00 0.6811912416209033E+00 0.6745755506942478E+00\n 0.6680081905238785E+00 0.6614895437994238E+00 0.6550199673323996E+00 0.6485997925903795E+00 0.6422293262293763E+00\n 0.6359088506240991E+00 0.6296386243958603E+00 0.6234188829378302E+00 0.6172498389374158E+00 0.6111316828955082E+00\n 0.6050645836423746E+00 0.5990486888499783E+00 0.5930841255405085E+00 0.5871710005909401E+00 0.5813094012334057E+00\n 0.5754993955512363E+00 0.5697410329704640E+00 0.5640343447466610E+00 0.5583793444469337E+00 0.5527760284269526E+00\n 0.5472243763028636E+00 0.5417243514179740E+00 0.5362759013040796E+00 0.5308789581373305E+00 0.5255334391885358E+00\n 0.5202392472678002E+00 0.5149962711634282E+00 0.5098043860749818E+00 0.5046634540404551E+00 0.4995733243574682E+00\n 0.4945338339984403E+00 0.4895448080196743E+00 0.4846060599643165E+00 0.4797173922591353E+00 0.4748785966051021E+00\n 0.4700894543617143E+00 0.4653497369250721E+00 0.4606592060996474E+00 0.4560176144637674E+00 0.4514247057287724E+00\n 0.4468802150918596E+00 0.4423838695826035E+00 0.4379353884031551E+00 0.4335344832621323E+00 0.4291808587022021E+00\n 0.4248742124213836E+00 0.4206142355880688E+00 0.4164006131498095E+00 0.4122330241358657E+00 0.4081111419535712E+00\n 0.4040346346785266E+00 0.4000031653386660E+00 0.3960163921922264E+00 0.3920739689996687E+00 0.3881755452895829E+00\n 0.3843207666186236E+00 0.3805092748255328E+00 0.3767407082792822E+00 0.3730147021214013E+00 0.3693308885025316E+00\n 0.3656888968132757E+00 0.3620883539093817E+00 0.3585288843313358E+00 0.3550101105184098E+00 0.3515316530172374E+00\n 0.3480931306849715E+00 0.3446941608870878E+00 0.3413343596899074E+00 0.3380133420478924E+00 0.3347307219857906E+00\n 0.3314861127756896E+00 0.3282791271090590E+00 0.3251093772638369E+00 0.3219764752666408E+00 0.3188800330501668E+00\n 0.3158196626058555E+00 0.3127949761318864E+00 0.3098055861765790E+00 0.3068511057772733E+00 0.3039311485947566E+00\n 0.3010453290433147E+00 0.2981932624164749E+00 0.2953745650085209E+00 0.2925888542318437E+00 0.2898357487302072E+00\n 0.2871148684879984E+00 0.2844258349355381E+00 0.2817682710505188E+00 0.2791418014556485E+00 0.2765460525125659E+00\n 0.2739806524121053E+00 0.2714452312609780E+00 0.2689394211649400E+00 0.2664628563085241E+00 0.2640151730313972E+00\n 0.2615960099014194E+00 0.2592050077844695E+00 0.2568418099111116E+00 0.2545060619401636E+00 0.2521974120192415E+00\n 0.2499155108423418E+00 0.2476600117045342E+00 0.2454305705538249E+00 0.2432268460402566E+00 0.2410484995623153E+00\n 0.2388951953107000E+00 0.2367666003095238E+00 0.2346623844550057E+00 0.2325822205517195E+00 0.2305257843464541E+00\n 0.2284927545597522E+00 0.2264828129151803E+00 0.2244956441663966E+00 0.2225309361220672E+00 0.2205883796686914E+00\n 0.2186676687913947E+00 0.2167685005927387E+00 0.2148905753096101E+00 0.2130335963282359E+00 0.2111972701973850E+00\n 0.2093813066398013E+00 0.2075854185619259E+00 0.2058093220619543E+00 0.2040527364362842E+00 0.2023153841843948E+00\n 0.2005969910122156E+00 0.1988972858340233E+00 0.1972160007729189E+00 0.1955528711599284E+00 0.1939076355317738E+00\n 0.1922800356273561E+00 0.1906698163829959E+00 0.1890767259264730E+00 0.1875005155699057E+00 0.1859409398015150E+00\n 0.1843977562763068E+00 0.1828707258057186E+00 0.1813596123462640E+00 0.1798641829872162E+00 0.1783842079373634E+00\n 0.1769194605108787E+00 0.1754697171123329E+00 0.1740347572208903E+00 0.1726143633737163E+00 0.1712083211486371E+00\n 0.1698164191460766E+00 0.1684384489703060E+00 0.1670742052100373E+00 0.1657234854183902E+00 0.1643860900922608E+00\n 0.1630618226511230E+00 0.1617504894152905E+00 0.1604518995836656E+00 0.1591658652110027E+00 0.1578922011847117E+00\n 0.1566307252012296E+00 0.1553812577419816E+00 0.1541436220489565E+00 0.1529176440999246E+00 0.1517031525833137E+00\n 0.1504999788727721E+00 0.1493079570014363E+00 0.1481269236359270E+00 0.1469567180500930E+00 0.1457971820985229E+00\n 0.1446481601898438E+00 0.1435094992598286E+00 0.1423810487443264E+00 0.1412626605520352E+00 0.1401541890371375E+00\n 0.1390554909718100E+00 0.1379664255186285E+00 0.1368868542028802E+00 0.1358166408848024E+00 0.1347556517317591E+00\n 0.1337037551903719E+00 0.1326608219586172E+00 0.1316267249579071E+00 0.1306013393051614E+00 0.1295845422848884E+00\n 0.1285762133212826E+00 0.1275762339503552E+00 0.1265844877921041E+00 0.1256008605227379E+00 0.1246252398469633E+00\n 0.1236575154703454E+00 0.1226975790717512E+00 0.1217453242758857E+00 0.1208006466259300E+00 0.1198634435562893E+00\n 0.1189336143654594E+00 0.1180110601890202E+00 0.1170956839727626E+00 0.1161873904459593E+00 0.1152860860947805E+00\n 0.1143916791358692E+00 0.1135040794900743E+00 0.1126231987563555E+00 0.1117489501858582E+00 0.1108812486561707E+00\n 0.1100200106457653E+00 0.1091651542086276E+00 0.1083165989490820E+00 0.1074742659968154E+00 0.1066380779821052E+00\n 0.1058079590112519E+00 0.1049838346422265E+00 0.1041656318605295E+00 0.1033532790552702E+00 0.1025467059954647E+00\n 0.1017458438065610E+00 0.1009506249471885E+00 0.1001609831861390E+00 0.9937685357957692E-01 0.9859817244848566E-01\n 0.9782487735634983E-01 0.9705690708707349E-01 0.9629420162313919E-01 0.9553670212400750E-01 0.9478435090475915E-01\n 0.9403709141497944E-01 0.9329486821788784E-01 0.9255762696971309E-01 0.9182531439931366E-01 0.9109787828804443E-01\n 0.9037526744987140E-01 0.8965743171173354E-01 0.8894432189415159E-01 0.8823588979208480E-01 0.8753208815603555E-01\n 0.8683287067340226E-01 0.8613819195007733E-01 0.8544800749229453E-01 0.8476227368872161E-01 0.8408094779279952E-01\n 0.8340398790532604E-01 0.8273135295728512E-01 0.8206300269292026E-01 0.8139889765304979E-01 0.8073899915862499E-01\n 0.8008326929452908E-01 0.7943167089361686E-01 0.7878416752099129E-01 0.7814072345852002E-01 0.7750130368958605E-01\n 0.7686587388407512E-01 0.7623440038359473E-01 0.7560685018692687E-01 0.7498319093571042E-01 0.7436339090035288E-01\n 0.7374741896616860E-01 0.7313524461974377E-01 0.7252683793552536E-01 0.7192216956263091E-01 0.7132121071188088E-01\n 0.7072393314304767E-01 0.7013030915232332E-01 0.6954031156000041E-01 0.6895391369836718E-01 0.6837108939981353E-01\n 0.6779181298514624E-01 0.6721605925211059E-01 0.6664380346411826E-01 0.6607502133917825E-01 0.6550968903902774E-01\n 0.6494778315846379E-01 0.6438928071487048E-01 0.6383415913794230E-01 0.6328239625959906E-01 0.6273397030409252E-01\n 0.6218885987830131E-01 0.6164704396221248E-01 0.6110850189958664E-01 0.6057321338880634E-01 0.6004115847390429E-01\n 0.5951231753576908E-01 0.5898667128352685E-01 0.5846420074609691E-01 0.5794488726391903E-01 0.5742871248084910E-01\n 0.5691565833622340E-01 0.5640570705708669E-01 0.5589884115058460E-01 0.5539504339651542E-01 0.5489429684004177E-01\n 0.5439658478455860E-01 0.5390189078471544E-01 0.5341019863959112E-01 0.5292149238601910E-01 0.5243575629206128E-01\n 0.5195297485062703E-01 0.5147313277323774E-01 0.5099621498393213E-01 0.5052220661331305E-01 0.5005109299273101E-01\n 0.4958285964860470E-01 0.4911749229687554E-01 0.4865497683759399E-01 0.4819529934963621E-01 0.4773844608554897E-01\n 0.4728440346652141E-01 0.4683315807748007E-01 0.4638469666230777E-01 0.4593900611918208E-01 0.4549607349603369E-01\n 0.4505588598612064E-01 0.4461843092371864E-01 0.4418369577992455E-01 0.4375166815857148E-01 0.4332233579225347E-01\n 0.4289568653845881E-01 0.4247170837580991E-01 0.4205038940040735E-01 0.4163171782227736E-01 0.4121568196192090E-01\n 0.4080227024696274E-01 0.4039147120889799E-01 0.3998327347993617E-01 0.3957766578994016E-01 0.3917463696345855E-01\n 0.3877417591685010E-01 0.3837627165549899E-01 0.3798091327111933E-01 0.3758808993914695E-01 0.3719779091621782E-01\n 0.3681000553773126E-01 0.3642472321549702E-01 0.3604193343546399E-01 0.3566162575553031E-01 0.3528378980343305E-01\n 0.3490841527471608E-01 0.3453549193077510E-01 0.3416500959697864E-01 0.3379695816086406E-01 0.3343132757040658E-01\n 0.3306810783236118E-01 0.3270728901067565E-01 0.3234886122497425E-01 0.3199281464910996E-01 0.3163913950978563E-01\n 0.3128782608524168E-01 0.3093886470401072E-01 0.3059224574373675E-01 0.3024795963005924E-01 0.2990599683556058E-01\n 0.2956634787877624E-01 0.2922900332326631E-01 0.2889395377674870E-01 0.2856118989029233E-01 0.2823070235756949E-01\n 0.2790248191416771E-01 0.2757651933695894E-01 0.2725280544352705E-01 0.2693133109165141E-01 0.2661208717884729E-01\n 0.2629506464196176E-01 0.2598025445682497E-01 0.2566764763795566E-01 0.2535723523832159E-01 0.2504900834915327E-01\n 0.2474295809981158E-01 0.2443907565770799E-01 0.2413735222827780E-01 0.2383777905500606E-01 0.2354034741950517E-01\n 0.2324504864164501E-01 0.2295187407973472E-01 0.2266081513075604E-01 0.2237186323064830E-01 0.2208500985464502E-01\n 0.2180024651766184E-01 0.2151756477473634E-01 0.2123695622151859E-01 0.2095841249481422E-01 0.2068192527317876E-01\n 0.2040748627756411E-01 0.2013508727201714E-01 0.1986472006443057E-01 0.1959637650734679E-01 0.1933004849881481E-01\n 0.1906572798330038E-01 0.1880340695265023E-01 0.1854307744711091E-01 0.1828473155640220E-01 0.1802836142084625E-01\n 0.1777395923255295E-01 0.1752151723666215E-01 0.1727102773264334E-01 0.1702248307565384E-01 0.1677587567795624E-01\n 0.1653119801039607E-01 0.1628844260394024E-01 0.1604760205127793E-01 0.1580866900848456E-01 0.1557163619674996E-01\n 0.1533649640417201E-01 0.1510324248761716E-01 0.1487186737464884E-01 0.1464236406552526E-01 0.1441472563526792E-01\n 0.1418894523580252E-01 0.1396501609817369E-01 0.1374293153483488E-01 0.1352268494201562E-01 0.1330426980216726E-01\n 0.1308767968648953E-01 0.1287290825753935E-01 0.1265994927192371E-01 0.1244879658307933E-01 0.1223944414413996E-01\n 0.1203188601089432E-01 0.1182611634483635E-01 0.1162212941630988E-01 0.1141991960775031E-01 0.1121948141702494E-01\n 0.1102080946087490E-01 0.1082389847846042E-01 0.1062874333501194E-01 0.1043533902558977E-01 0.1024368067895393E-01\n 0.1005376356154735E-01 0.9865583081593922E-02 0.9679134793314684E-02 0.9494414401263529E-02 0.9311417764785166E-02\n 0.9130140902597625E-02 0.8950579997500882E-02 0.8772731401214267E-02 0.8596591639343950E-02 0.8422157416482423E-02\n 0.8249425621441884E-02 0.8078393332622082E-02 0.7909057823514530E-02 0.7741416568343256E-02 0.7575467247842871E-02\n 0.7411207755174127E-02 0.7248636201976184E-02 0.7087750924555473E-02 0.6928550490209059E-02 0.6771033703680868E-02\n 0.6615199613748215E-02 0.6461047519934641E-02 0.6308576979345235E-02 0.6157787813618597E-02 0.6008680115989046E-02\n 0.5861254258451652E-02 0.5715510899020261E-02 0.5571450989068522E-02 0.5429075780740853E-02 0.5288386834419521E-02\n 0.5149386026230897E-02 0.5012075555572173E-02 0.4876457952637328E-02 0.4742536085917297E-02 0.4610313169647435E-02\n 0.4479792771170533E-02 0.4350978818180493E-02 0.4223875605807347E-02 0.4098487803498918E-02 0.3974820461650163E-02\n 0.3852879017924298E-02 0.3732669303204216E-02 0.3614197547105479E-02 0.3497470382973937E-02 0.3382494852283408E-02\n 0.3269278408338597E-02 0.3157828919178777E-02 0.3048154669566634E-02 0.2940264361933685E-02 0.2834167116141327E-02\n 0.2729872467901025E-02 0.2627390365681719E-02 0.2526731165915232E-02 0.2427905626291050E-02 0.2330924896912227E-02\n 0.2235800509061165E-02 0.2142544361300639E-02 0.2051168702609613E-02 0.1961686112225166E-02 0.1874109475832896E-02\n 0.1788451957715710E-02 0.1704726968437611E-02 0.1622948127603452E-02 0.1543129221197582E-02 0.1465284152965789E-02\n 0.1389426889263572E-02 0.1315571396752711E-02 0.1243731572285281E-02 0.1173921164272465E-02 0.1106153684794404E-02\n 0.1040442311668004E-02 0.9767997796547971E-03 0.9152382599604941E-03 0.8557692271559906E-03 0.7984033126378760E-03\n 0.7431501437484684E-03 0.6900181676963877E-03 0.6390144594619438E-03 0.5901445129451447E-03 0.5434120147240581E-03\n 0.4988185999463610E-03 0.4563635900883120E-03 0.4160437125934487E-03 0.3778528027632167E-03 0.3417814887280997E-03\n 0.3078168608981688E-03 0.2759421279962239E-03 0.2461362626341978E-03 0.2183736404266527E-03 0.1926236778641105E-03\n 0.1688504756124491E-03 0.1470124755772384E-03 0.1270621419785909E-03 0.1089456788163143E-03 0.9260279843818645E-04\n 0.7796655839983218E-04 0.6496328632466781E-04 0.5351261488371726E-04 0.4352765109263255E-04 0.3491530554961739E-04\n 0.2757680758595959E-04 0.2140843101578471E-04 0.1630245156608879E-04 0.1214835033531085E-04 0.8834266891203550E-05\n 0.6248690035680286E-05 0.4282353222462611E-05 0.2830275035848309E-05 0.1793853932613698E-05 0.1082893085919590E-05\n 0.6174003285747537E-06 0.3289872539180627E-06 0.1616905202076728E-06 0.7206870776681014E-07 0.2849911999804606E-07\n 0.9712198708650968E-08 0.2742442283547959E-08 0.6076172112450161E-09 0.9772731077597771E-10 0.1017048852958432E-10\n 0.5734341782146348E-12 0.1311491489053561E-13 0.7338688834175233E-16 0.3808514445153469E-19 0.2185032842849075E-24\n 0.4450194794086531E-34 0.4448435176905321E-58 0.1173305758391880E-217 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.1353993104251454E-10 0.8388292241576100E-09 0.9249073098372293E-08 0.5030460210239372E-07\n 0.1857568627085415E-06 0.5369197789403567E-06 0.1310591025996369E-05 0.2826805415934704E-05 0.5547382204843158E-05\n 0.1010438933657199E-04 0.1732779196828242E-04 0.2827168149581216E-04 0.4423859602721504E-04 0.6680154505955162E-04\n 0.9782344112589946E-04 0.1394737204414197E-03 0.1942420040555485E-03 0.2649487116051849E-03 0.3547525922860875E-03\n 0.4671551828778767E-03 0.6060022412741116E-03 0.7754822366296253E-03 0.9801220045380374E-03 0.1224779698140599E-02\n 0.1514635184246249E-02 0.1855178047873591E-02 0.2252193379531577E-02 0.2711745527424523E-02 0.3240160001952968E-02\n 0.3844003722708506E-02 0.4530063798923195E-02 0.5305325033301281E-02 0.6176946336577127E-02 0.7152236236230247E-02\n 0.8238627657747143E-02 0.9443652150831976E-02 0.1077491372619769E-01 0.1224006246116400E-01 0.1384676802438050E-01\n 0.1560269326170134E-01 0.1751546797666743E-01 0.1959266303029807E-01 0.2184176487603834E-01 0.2427015063682662E-01\n 0.2688506382240104E-01 0.2969359077621229E-01 0.3270263793270082E-01 0.3591890995727141E-01 0.3934888883309312E-01\n 0.4299881395089809E-01 0.4687466325027261E-01 0.5098213545355013E-01 0.5532663342634311E-01 0.5991324869200370E-01\n 0.6474674712088738E-01 0.6983155580921956E-01 0.7517175115663279E-01 0.8077104814605506E-01 0.8663279082458433E-01\n 0.9275994397927995E-01 0.9915508599743368E-01 0.1058204028968442E+00 0.1127576835079031E+00 0.1199683157858993E+00\n 0.1274532842288529E+00 0.1352131683733934E+00 0.1432481423386811E+00 0.1515579753861312E+00 0.1601420334607315E+00\n 0.1689992816780165E+00 0.1781282877192849E+00 0.1875272260963912E+00 0.1971938832464155E+00 0.2071256634156783E+00\n 0.2173195952919433E+00 0.2277723393431911E+00 0.2384801958210745E+00 0.2494391133870441E+00 0.2606446983191641E+00\n 0.2720922242578070E+00 0.2837766424487163E+00 0.2956925924423432E+00 0.3078344132088888E+00 0.3201961546291090E+00\n 0.3327715893216590E+00 0.3455542247685515E+00 0.3585373157011766E+00 0.3717138767102711E+00 0.3850766950442213E+00\n 0.3986183435611380E+00 0.4123311938012285E+00 0.4262074291471305E+00 0.4402390580410298E+00 0.4544179272285823E+00\n 0.4687357350008659E+00 0.4831840444068136E+00 0.4977542964098284E+00 0.5124378229635098E+00 0.5272258599826819E+00\n 0.5421095601871498E+00 0.5570800057968556E+00 0.5721282210583372E+00 0.5872451845836121E+00 0.6024218414838124E+00\n 0.6176491152810919E+00 0.6329179195834939E+00 0.6482191695086116E+00 0.6635437928430084E+00 0.6788827409254566E+00\n 0.6942269992431367E+00 0.7095675977309721E+00 0.7248956207653083E+00 0.7402022168441228E+00 0.7554786079469059E+00\n 0.7707160985682907E+00 0.7859060844203938E+00 0.8010400607996875E+00 0.8161096306150647E+00 0.8311065120745426E+00\n 0.8460225460288135E+00 0.8608497029705907E+00 0.8755800896893798E+00 0.8902059555819789E+00 0.9047196986196469E+00\n 0.9191138709734521E+00 0.9333811842999254E+00 0.9475145146896305E+00 0.9615069072817952E+00 0.9753515805486259E+00\n 0.9890419302533513E+00 0.1002571533086473E+01 0.1015934149985090E+01 0.1029123729140496E+01 0.1042134408699634E+01\n 0.1054960519166231E+01 0.1067596585507774E+01 0.1080037328974709E+01 0.1092277668638490E+01 0.1104312722655314E+01\n 0.1116137809262549E+01 0.1127748447515049E+01 0.1139140357768670E+01 0.1150309461918440E+01 0.1161251883398932E+01\n 0.1171963946954482E+01 0.1182442178186937E+01 0.1192683302888721E+01 0.1202684246168965E+01 0.1212442131380551E+01\n 0.1221954278855855E+01 0.1231218204459002E+01 0.1240231617962418E+01 0.1248992421255417E+01 0.1257498706392534E+01\n 0.1265748753489242E+01 0.1273741028472617E+01 0.1281474180694483E+01 0.1288947040414400E+01 0.1296158616159860E+01\n 0.1303108091970871E+01 0.1309794824536052E+01 0.1316218340227214E+01 0.1322378332039313E+01 0.1328274656442483E+01\n 0.1333907330152773E+01 0.1339276526828055E+01 0.1344382573695405E+01 0.1349225948116168E+01 0.1353807274094698E+01\n 0.1358127318736686E+01 0.1362186988662762E+01 0.1365987326382977E+01 0.1369529506637536E+01 0.1372814832709058E+01\n 0.1375844732711431E+01 0.1378620755860210E+01 0.1381144568729309E+01 0.1383417951498597E+01 0.1385442794196838E+01\n 0.1387221092944273E+01 0.1388754946198940E+01 0.1390046551010727E+01 0.1391098199286932E+01 0.1391912274073011E+01\n 0.1392491245851972E+01 0.1392837668865793E+01 0.1392954177462024E+01 0.1392843482468616E+01 0.1392508367599889E+01\n 0.1391951685896345E+01 0.1391176356200982E+01 0.1390185359674514E+01 0.1388981736351864E+01 0.1387568581742103E+01\n 0.1385949043473885E+01 0.1384126317988323E+01 0.1382103647281089E+01 0.1379884315695416E+01 0.1377471646767576E+01\n 0.1374869000126249E+01 0.1372079768447110E+01 0.1369107374463862E+01 0.1365955268036790E+01 0.1362626923279866E+01\n 0.1359125835747256E+01 0.1355455519680076E+01 0.1351619505314043E+01 0.1347621336248676E+01 0.1343464566878517E+01\n 0.1339152759886839E+01 0.1334689483802160E+01 0.1330078310617843E+01 0.1325322813474955E+01 0.1320426564408511E+01\n 0.1315393132157122E+01 0.1310226080036051E+01 0.1304928963873535E+01 0.1299505330010257E+01 0.1293958713361729E+01\n 0.1288292635543297E+01 0.1282510603057466E+01 0.1276616105543136E+01 0.1270612614086314E+01 0.1264503579591840E+01\n 0.1258292431215576E+01 0.1251982574856509E+01 0.1245577391708143E+01 0.1239080236868539E+01 0.1232494438008325E+01\n 0.1225823294095955E+01 0.1219070074179471E+01 0.1212238016223985E+01 0.1205330326004104E+01 0.1198350176050432E+01\n 0.1191300704649328E+01 0.1184185014895046E+01 0.1177006173793340E+01 0.1169767211415667E+01 0.1162471120103017E+01\n 0.1155120853718478E+01 0.1147719326947540E+01 0.1140269414645216E+01 0.1132773951228974E+01 0.1125235730116526E+01\n 0.1117657503207466E+01 0.1110041980407784E+01 0.1102391829196240E+01 0.1094709674231619E+01 0.1086998096999836E+01\n 0.1079259635499933E+01 0.1071496783967914E+01 0.1063711992637463E+01 0.1055907667536516E+01 0.1048086170318704E+01\n 0.1040249818128692E+01 0.1032400883500383E+01 0.1024541594287072E+01 0.1016674133622509E+01 0.1008800639911969E+01\n 0.1000923206852306E+01 0.9930438834801176E+00 0.9851646742469989E+00 0.9772875391210279E+00 0.9694143937135093E+00\n 0.9615471094301068E+00 0.9536875136454389E+00 0.9458373899002650E+00 0.9379984781203971E+00 0.9301724748564474E+00\n 0.9223610335436100E+00 0.9145657647805825E+00 0.9067882366268739E+00 0.8990299749176214E+00 0.8912924635951891E+00\n 0.8835771450567167E+00 0.8758854205168844E+00 0.8682186503851309E+00 0.8605781546565948E+00 0.8529652133160540E+00\n 0.8453810667541574E+00 0.8378269161952663E+00 0.8303039241362116E+00 0.8228132147953376E+00 0.8153558745711390E+00\n 0.8079329525099168E+00 0.8005454607817869E+00 0.7931943751644794E+00 0.7858806355343143E+00 0.7786051463638074E+00\n 0.7713687772253328E+00 0.7641723633003079E+00 0.7570167058933844E+00 0.7499025729511121E+00 0.7428306995846062E+00\n 0.7358017885957079E+00 0.7288165110062022E+00 0.7218755065895981E+00 0.7149793844050807E+00 0.7081287233331618E+00\n 0.7013240726126531E+00 0.6945659523785421E+00 0.6878548542003931E+00 0.6811912416209033E+00 0.6745755506942478E+00\n 0.6680081905238785E+00 0.6614895437994238E+00 0.6550199673323996E+00 0.6485997925903795E+00 0.6422293262293763E+00\n 0.6359088506240991E+00 0.6296386243958603E+00 0.6234188829378302E+00 0.6172498389374158E+00 0.6111316828955082E+00\n 0.6050645836423746E+00 0.5990486888499783E+00 0.5930841255405085E+00 0.5871710005909401E+00 0.5813094012334057E+00\n 0.5754993955512363E+00 0.5697410329704640E+00 0.5640343447466610E+00 0.5583793444469337E+00 0.5527760284269526E+00\n 0.5472243763028636E+00 0.5417243514179740E+00 0.5362759013040796E+00 0.5308789581373305E+00 0.5255334391885358E+00\n 0.5202392472678002E+00 0.5149962711634282E+00 0.5098043860749818E+00 0.5046634540404551E+00 0.4995733243574682E+00\n 0.4945338339984403E+00 0.4895448080196743E+00 0.4846060599643165E+00 0.4797173922591353E+00 0.4748785966051021E+00\n 0.4700894543617143E+00 0.4653497369250721E+00 0.4606592060996474E+00 0.4560176144637674E+00 0.4514247057287724E+00\n 0.4468802150918596E+00 0.4423838695826035E+00 0.4379353884031551E+00 0.4335344832621323E+00 0.4291808587022021E+00\n 0.4248742124213836E+00 0.4206142355880688E+00 0.4164006131498095E+00 0.4122330241358657E+00 0.4081111419535712E+00\n 0.4040346346785266E+00 0.4000031653386660E+00 0.3960163921922264E+00 0.3920739689996687E+00 0.3881755452895829E+00\n 0.3843207666186236E+00 0.3805092748255328E+00 0.3767407082792822E+00 0.3730147021214013E+00 0.3693308885025316E+00\n 0.3656888968132757E+00 0.3620883539093817E+00 0.3585288843313358E+00 0.3550101105184098E+00 0.3515316530172374E+00\n 0.3480931306849715E+00 0.3446941608870878E+00 0.3413343596899074E+00 0.3380133420478924E+00 0.3347307219857906E+00\n 0.3314861127756896E+00 0.3282791271090590E+00 0.3251093772638369E+00 0.3219764752666408E+00 0.3188800330501668E+00\n 0.3158196626058555E+00 0.3127949761318864E+00 0.3098055861765790E+00 0.3068511057772733E+00 0.3039311485947566E+00\n 0.3010453290433147E+00 0.2981932624164749E+00 0.2953745650085209E+00 0.2925888542318437E+00 0.2898357487302072E+00\n 0.2871148684879984E+00 0.2844258349355381E+00 0.2817682710505188E+00 0.2791418014556485E+00 0.2765460525125659E+00\n 0.2739806524121053E+00 0.2714452312609780E+00 0.2689394211649400E+00 0.2664628563085241E+00 0.2640151730313972E+00\n 0.2615960099014194E+00 0.2592050077844695E+00 0.2568418099111116E+00 0.2545060619401636E+00 0.2521974120192415E+00\n 0.2499155108423418E+00 0.2476600117045342E+00 0.2454305705538249E+00 0.2432268460402566E+00 0.2410484995623153E+00\n 0.2388951953107000E+00 0.2367666003095238E+00 0.2346623844550057E+00 0.2325822205517195E+00 0.2305257843464541E+00\n 0.2284927545597522E+00 0.2264828129151803E+00 0.2244956441663966E+00 0.2225309361220672E+00 0.2205883796686914E+00\n 0.2186676687913947E+00 0.2167685005927387E+00 0.2148905753096101E+00 0.2130335963282359E+00 0.2111972701973850E+00\n 0.2093813066398013E+00 0.2075854185619259E+00 0.2058093220619543E+00 0.2040527364362842E+00 0.2023153841843948E+00\n 0.2005969910122156E+00 0.1988972858340233E+00 0.1972160007729189E+00 0.1955528711599284E+00 0.1939076355317738E+00\n 0.1922800356273561E+00 0.1906698163829959E+00 0.1890767259264730E+00 0.1875005155699057E+00 0.1859409398015150E+00\n 0.1843977562763068E+00 0.1828707258057186E+00 0.1813596123462640E+00 0.1798641829872162E+00 0.1783842079373634E+00\n 0.1769194605108787E+00 0.1754697171123329E+00 0.1740347572208903E+00 0.1726143633737163E+00 0.1712083211486371E+00\n 0.1698164191460766E+00 0.1684384489703060E+00 0.1670742052100373E+00 0.1657234854183902E+00 0.1643860900922608E+00\n 0.1630618226511230E+00 0.1617504894152905E+00 0.1604518995836656E+00 0.1591658652110027E+00 0.1578922011847117E+00\n 0.1566307252012296E+00 0.1553812577419816E+00 0.1541436220489565E+00 0.1529176440999246E+00 0.1517031525833137E+00\n 0.1504999788727721E+00 0.1493079570014363E+00 0.1481269236359270E+00 0.1469567180500930E+00 0.1457971820985229E+00\n 0.1446481601898438E+00 0.1435094992598286E+00 0.1423810487443264E+00 0.1412626605520352E+00 0.1401541890371375E+00\n 0.1390554909718100E+00 0.1379664255186285E+00 0.1368868542028802E+00 0.1358166408848024E+00 0.1347556517317591E+00\n 0.1337037551903719E+00 0.1326608219586172E+00 0.1316267249579071E+00 0.1306013393051614E+00 0.1295845422848884E+00\n 0.1285762133212826E+00 0.1275762339503552E+00 0.1265844877921041E+00 0.1256008605227379E+00 0.1246252398469633E+00\n 0.1236575154703454E+00 0.1226975790717512E+00 0.1217453242758857E+00 0.1208006466259300E+00 0.1198634435562893E+00\n 0.1189336143654594E+00 0.1180110601890202E+00 0.1170956839727626E+00 0.1161873904459593E+00 0.1152860860947805E+00\n 0.1143916791358692E+00 0.1135040794900743E+00 0.1126231987563555E+00 0.1117489501858582E+00 0.1108812486561707E+00\n 0.1100200106457653E+00 0.1091651542086276E+00 0.1083165989490820E+00 0.1074742659968154E+00 0.1066380779821052E+00\n 0.1058079590112519E+00 0.1049838346422265E+00 0.1041656318605295E+00 0.1033532790552702E+00 0.1025467059954647E+00\n 0.1017458438065610E+00 0.1009506249471885E+00 0.1001609831861390E+00 0.9937685357957692E-01 0.9859817244848566E-01\n 0.9782487735634983E-01 0.9705690708707349E-01 0.9629420162313919E-01 0.9553670212400750E-01 0.9478435090475915E-01\n 0.9403709141497944E-01 0.9329486821788784E-01 0.9255762696971309E-01 0.9182531439931366E-01 0.9109787828804443E-01\n 0.9037526744987140E-01 0.8965743171173354E-01 0.8894432189415159E-01 0.8823588979208480E-01 0.8753208815603555E-01\n 0.8683287067340226E-01 0.8613819195007733E-01 0.8544800749229453E-01 0.8476227368872161E-01 0.8408094779279952E-01\n 0.8340398790532604E-01 0.8273135295728512E-01 0.8206300269292026E-01 0.8139889765304979E-01 0.8073899915862499E-01\n 0.8008326929452908E-01 0.7943167089361686E-01 0.7878416752099129E-01 0.7814072345852002E-01 0.7750130368958605E-01\n 0.7686587388407512E-01 0.7623440038359473E-01 0.7560685018692687E-01 0.7498319093571042E-01 0.7436339090035288E-01\n 0.7374741896616860E-01 0.7313524461974377E-01 0.7252683793552536E-01 0.7192216956263091E-01 0.7132121071188088E-01\n 0.7072393314304767E-01 0.7013030915232332E-01 0.6954031156000041E-01 0.6895391369836718E-01 0.6837108939981353E-01\n 0.6779181298514624E-01 0.6721605925211059E-01 0.6664380346411826E-01 0.6607502133917825E-01 0.6550968903902774E-01\n 0.6494778315846379E-01 0.6438928071487048E-01 0.6383415913794230E-01 0.6328239625959906E-01 0.6273397030409252E-01\n 0.6218885987830131E-01 0.6164704396221248E-01 0.6110850189958664E-01 0.6057321338880634E-01 0.6004115847390429E-01\n 0.5951231753576908E-01 0.5898667128352685E-01 0.5846420074609691E-01 0.5794488726391903E-01 0.5742871248084910E-01\n 0.5691565833622340E-01 0.5640570705708669E-01 0.5589884115058460E-01 0.5539504339651542E-01 0.5489429684004177E-01\n 0.5439658478455860E-01 0.5390189078471544E-01 0.5341019863959112E-01 0.5292149238601910E-01 0.5243575629206128E-01\n 0.5195297485062703E-01 0.5147313277323774E-01 0.5099621498393213E-01 0.5052220661331305E-01 0.5005109299273101E-01\n 0.4958285964860470E-01 0.4911749229687554E-01 0.4865497683759399E-01 0.4819529934963621E-01 0.4773844608554897E-01\n 0.4728440346652141E-01 0.4683315807748007E-01 0.4638469666230777E-01 0.4593900611918208E-01 0.4549607349603369E-01\n 0.4505588598612064E-01 0.4461843092371864E-01 0.4418369577992455E-01 0.4375166815857148E-01 0.4332233579225347E-01\n 0.4289568653845881E-01 0.4247170837580991E-01 0.4205038940040735E-01 0.4163171782227736E-01 0.4121568196192090E-01\n 0.4080227024696274E-01 0.4039147120889799E-01 0.3998327347993617E-01 0.3957766578994016E-01 0.3917463696345855E-01\n 0.3877417591685010E-01 0.3837627165549899E-01 0.3798091327111933E-01 0.3758808993914695E-01 0.3719779091621782E-01\n 0.3681000553773126E-01 0.3642472321549702E-01 0.3604193343546399E-01 0.3566162575553031E-01 0.3528378980343305E-01\n 0.3490841527471608E-01 0.3453549193077510E-01 0.3416500959697864E-01 0.3379695816086406E-01 0.3343132757040658E-01\n 0.3306810783236118E-01 0.3270728901067565E-01 0.3234886122497425E-01 0.3199281464910996E-01 0.3163913950978563E-01\n 0.3128782608524168E-01 0.3093886470401072E-01 0.3059224574373675E-01 0.3024795963005924E-01 0.2990599683556058E-01\n 0.2956634787877624E-01 0.2922900332326631E-01 0.2889395377674870E-01 0.2856118989029233E-01 0.2823070235756949E-01\n 0.2790248191416771E-01 0.2757651933695894E-01 0.2725280544352705E-01 0.2693133109165141E-01 0.2661208717884729E-01\n 0.2629506464196176E-01 0.2598025445682497E-01 0.2566764763795566E-01 0.2535723523832159E-01 0.2504900834915327E-01\n 0.2474295809981158E-01 0.2443907565770799E-01 0.2413735222827780E-01 0.2383777905500606E-01 0.2354034741950517E-01\n 0.2324504864164501E-01 0.2295187407973472E-01 0.2266081513075604E-01 0.2237186323064830E-01 0.2208500985464502E-01\n 0.2180024651766184E-01 0.2151756477473634E-01 0.2123695622151859E-01 0.2095841249481422E-01 0.2068192527317876E-01\n 0.2040748627756411E-01 0.2013508727201714E-01 0.1986472006443057E-01 0.1959637650734679E-01 0.1933004849881481E-01\n 0.1906572798330038E-01 0.1880340695265023E-01 0.1854307744711091E-01 0.1828473155640220E-01 0.1802836142084625E-01\n 0.1777395923255295E-01 0.1752151723666215E-01 0.1727102773264334E-01 0.1702248307565384E-01 0.1677587567795624E-01\n 0.1653119801039607E-01 0.1628844260394024E-01 0.1604760205127793E-01 0.1580866900848456E-01 0.1557163619674996E-01\n 0.1533649640417201E-01 0.1510324248761716E-01 0.1487186737464884E-01 0.1464236406552526E-01 0.1441472563526792E-01\n 0.1418894523580252E-01 0.1396501609817369E-01 0.1374293153483488E-01 0.1352268494201562E-01 0.1330426980216726E-01\n 0.1308767968648953E-01 0.1287290825753935E-01 0.1265994927192371E-01 0.1244879658307933E-01 0.1223944414413996E-01\n 0.1203188601089432E-01 0.1182611634483635E-01 0.1162212941630988E-01 0.1141991960775031E-01 0.1121948141702494E-01\n 0.1102080946087490E-01 0.1082389847846042E-01 0.1062874333501194E-01 0.1043533902558977E-01 0.1024368067895393E-01\n 0.1005376356154735E-01 0.9865583081593922E-02 0.9679134793314684E-02 0.9494414401263529E-02 0.9311417764785166E-02\n 0.9130140902597625E-02 0.8950579997500882E-02 0.8772731401214267E-02 0.8596591639343950E-02 0.8422157416482423E-02\n 0.8249425621441884E-02 0.8078393332622082E-02 0.7909057823514530E-02 0.7741416568343256E-02 0.7575467247842871E-02\n 0.7411207755174127E-02 0.7248636201976184E-02 0.7087750924555473E-02 0.6928550490209059E-02 0.6771033703680868E-02\n 0.6615199613748215E-02 0.6461047519934641E-02 0.6308576979345235E-02 0.6157787813618597E-02 0.6008680115989046E-02\n 0.5861254258451652E-02 0.5715510899020261E-02 0.5571450989068522E-02 0.5429075780740853E-02 0.5288386834419521E-02\n 0.5149386026230897E-02 0.5012075555572173E-02 0.4876457952637328E-02 0.4742536085917297E-02 0.4610313169647435E-02\n 0.4479792771170533E-02 0.4350978818180493E-02 0.4223875605807347E-02 0.4098487803498918E-02 0.3974820461650163E-02\n 0.3852879017924298E-02 0.3732669303204216E-02 0.3614197547105479E-02 0.3497470382973937E-02 0.3382494852283408E-02\n 0.3269278408338597E-02 0.3157828919178777E-02 0.3048154669566634E-02 0.2940264361933685E-02 0.2834167116141327E-02\n 0.2729872467901025E-02 0.2627390365681719E-02 0.2526731165915232E-02 0.2427905626291050E-02 0.2330924896912227E-02\n 0.2235800509061165E-02 0.2142544361300639E-02 0.2051168702609613E-02 0.1961686112225166E-02 0.1874109475832896E-02\n 0.1788451957715710E-02 0.1704726968437611E-02 0.1622948127603452E-02 0.1543129221197582E-02 0.1465284152965789E-02\n 0.1389426889263572E-02 0.1315571396752711E-02 0.1243731572285281E-02 0.1173921164272465E-02 0.1106153684794404E-02\n 0.1040442311668004E-02 0.9767997796547971E-03 0.9152382599604941E-03 0.8557692271559906E-03 0.7984033126378760E-03\n 0.7431501437484684E-03 0.6900181676963877E-03 0.6390144594619438E-03 0.5901445129451447E-03 0.5434120147240581E-03\n 0.4988185999463610E-03 0.4563635900883120E-03 0.4160437125934487E-03 0.3778528027632167E-03 0.3417814887280997E-03\n 0.3078168608981688E-03 0.2759421279962239E-03 0.2461362626341978E-03 0.2183736404266527E-03 0.1926236778641105E-03\n 0.1688504756124491E-03 0.1470124755772384E-03 0.1270621419785909E-03 0.1089456788163143E-03 0.9260279843818645E-04\n 0.7796655839983218E-04 0.6496328632466781E-04 0.5351261488371726E-04 0.4352765109263255E-04 0.3491530554961739E-04\n 0.2757680758595959E-04 0.2140843101578471E-04 0.1630245156608879E-04 0.1214835033531085E-04 0.8834266891203550E-05\n 0.6248690035680286E-05 0.4282353222462611E-05 0.2830275035848309E-05 0.1793853932613698E-05 0.1082893085919590E-05\n 0.6174003285747537E-06 0.3289872539180627E-06 0.1616905202076728E-06 0.7206870776681014E-07 0.2849911999804606E-07\n 0.9712198708650968E-08 0.2742442283547959E-08 0.6076172112450161E-09 0.9772731077597771E-10 0.1017048852958432E-10\n 0.5734341782146348E-12 0.1311491489053561E-13 0.7338688834175233E-16 0.3808514445153469E-19 0.2185032842849075E-24\n 0.4450194794086531E-34 0.4448435176905321E-58 0.1173305758391880E-217 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.1353993104251454E-10 0.8388292241576100E-09 0.9249073098372293E-08 0.5030460210239372E-07\n 0.1857568627085415E-06 0.5369197789403567E-06 0.1310591025996369E-05 0.2826805415934704E-05 0.5547382204843158E-05\n 0.1010438933657199E-04 0.1732779196828242E-04 0.2827168149581216E-04 0.4423859602721504E-04 0.6680154505955162E-04\n 0.9782344112589946E-04 0.1394737204414197E-03 0.1942420040555485E-03 0.2649487116051849E-03 0.3547525922860875E-03\n 0.4671551828778767E-03 0.6060022412741116E-03 0.7754822366296253E-03 0.9801220045380374E-03 0.1224779698140599E-02\n 0.1514635184246249E-02 0.1855178047873591E-02 0.2252193379531577E-02 0.2711745527424523E-02 0.3240160001952968E-02\n 0.3844003722708506E-02 0.4530063798923195E-02 0.5305325033301281E-02 0.6176946336577127E-02 0.7152236236230247E-02\n 0.8238627657747143E-02 0.9443652150831976E-02 0.1077491372619769E-01 0.1224006246116400E-01 0.1384676802438050E-01\n 0.1560269326170134E-01 0.1751546797666743E-01 0.1959266303029807E-01 0.2184176487603834E-01 0.2427015063682662E-01\n 0.2688506382240104E-01 0.2969359077621229E-01 0.3270263793270082E-01 0.3591890995727141E-01 0.3934888883309312E-01\n 0.4299881395089809E-01 0.4687466325027261E-01 0.5098213545355013E-01 0.5532663342634311E-01 0.5991324869200370E-01\n 0.6474674712088738E-01 0.6983155580921956E-01 0.7517175115663279E-01 0.8077104814605506E-01 0.8663279082458433E-01\n 0.9275994397927995E-01 0.9915508599743368E-01 0.1058204028968442E+00 0.1127576835079031E+00 0.1199683157858993E+00\n 0.1274532842288529E+00 0.1352131683733934E+00 0.1432481423386811E+00 0.1515579753861312E+00 0.1601420334607315E+00\n 0.1689992816780165E+00 0.1781282877192849E+00 0.1875272260963912E+00 0.1971938832464155E+00 0.2071256634156783E+00\n 0.2173195952919433E+00 0.2277723393431911E+00 0.2384801958210745E+00 0.2494391133870441E+00 0.2606446983191641E+00\n 0.2720922242578070E+00 0.2837766424487163E+00 0.2956925924423432E+00 0.3078344132088888E+00 0.3201961546291090E+00\n 0.3327715893216590E+00 0.3455542247685515E+00 0.3585373157011766E+00 0.3717138767102711E+00 0.3850766950442213E+00\n 0.3986183435611380E+00 0.4123311938012285E+00 0.4262074291471305E+00 0.4402390580410298E+00 0.4544179272285823E+00\n 0.4687357350008659E+00 0.4831840444068136E+00 0.4977542964098284E+00 0.5124378229635098E+00 0.5272258599826819E+00\n 0.5421095601871498E+00 0.5570800057968556E+00 0.5721282210583372E+00 0.5872451845836121E+00 0.6024218414838124E+00\n 0.6176491152810919E+00 0.6329179195834939E+00 0.6482191695086116E+00 0.6635437928430084E+00 0.6788827409254566E+00\n 0.6942269992431367E+00 0.7095675977309721E+00 0.7248956207653083E+00 0.7402022168441228E+00 0.7554786079469059E+00\n 0.7707160985682907E+00 0.7859060844203938E+00 0.8010400607996875E+00 0.8161096306150647E+00 0.8311065120745426E+00\n 0.8460225460288135E+00 0.8608497029705907E+00 0.8755800896893798E+00 0.8902059555819789E+00 0.9047196986196469E+00\n 0.9191138709734521E+00 0.9333811842999254E+00 0.9475145146896305E+00 0.9615069072817952E+00 0.9753515805486259E+00\n 0.9890419302533513E+00 0.1002571533086473E+01 0.1015934149985090E+01 0.1029123729140496E+01 0.1042134408699634E+01\n 0.1054960519166231E+01 0.1067596585507774E+01 0.1080037328974709E+01 0.1092277668638490E+01 0.1104312722655314E+01\n 0.1116137809262549E+01 0.1127748447515049E+01 0.1139140357768670E+01 0.1150309461918440E+01 0.1161251883398932E+01\n 0.1171963946954482E+01 0.1182442178186937E+01 0.1192683302888721E+01 0.1202684246168965E+01 0.1212442131380551E+01\n 0.1221954278855855E+01 0.1231218204459002E+01 0.1240231617962418E+01 0.1248992421255417E+01 0.1257498706392534E+01\n 0.1265748753489242E+01 0.1273741028472617E+01 0.1281474180694483E+01 0.1288947040414400E+01 0.1296158616159860E+01\n 0.1303108091970871E+01 0.1309794824536052E+01 0.1316218340227214E+01 0.1322378332039313E+01 0.1328274656442483E+01\n 0.1333907330152773E+01 0.1339276526828055E+01 0.1344382573695405E+01 0.1349225948116168E+01 0.1353807274094698E+01\n 0.1358127318736686E+01 0.1362186988662762E+01 0.1365987326382977E+01 0.1369529506637536E+01 0.1372814832709058E+01\n 0.1375844732711431E+01 0.1378620755860210E+01 0.1381144568729309E+01 0.1383417951498597E+01 0.1385442794196838E+01\n 0.1387221092944273E+01 0.1388754946198940E+01 0.1390046551010727E+01 0.1391098199286932E+01 0.1391912274073011E+01\n 0.1392491245851972E+01 0.1392837668865793E+01 0.1392954177462024E+01 0.1392843482468616E+01 0.1392508367599889E+01\n 0.1391951685896345E+01 0.1391176356200982E+01 0.1390185359674514E+01 0.1388981736351864E+01 0.1387568581742103E+01\n 0.1385949043473885E+01 0.1384126317988323E+01 0.1382103647281089E+01 0.1379884315695416E+01 0.1377471646767576E+01\n 0.1374869000126249E+01 0.1372079768447110E+01 0.1369107374463862E+01 0.1365955268036790E+01 0.1362626923279866E+01\n 0.1359125835747256E+01 0.1355455519680076E+01 0.1351619505314043E+01 0.1347621336248676E+01 0.1343464566878517E+01\n 0.1339152759886839E+01 0.1334689483802160E+01 0.1330078310617843E+01 0.1325322813474955E+01 0.1320426564408511E+01\n 0.1315393132157122E+01 0.1310226080036051E+01 0.1304928963873535E+01 0.1299505330010257E+01 0.1293958713361729E+01\n 0.1288292635543297E+01 0.1282510603057466E+01 0.1276616105543136E+01 0.1270612614086314E+01 0.1264503579591840E+01\n 0.1258292431215576E+01 0.1251982574856509E+01 0.1245577391708143E+01 0.1239080236868539E+01 0.1232494438008325E+01\n 0.1225823294095955E+01 0.1219070074179471E+01 0.1212238016223985E+01 0.1205330326004104E+01 0.1198350176050432E+01\n 0.1191300704649328E+01 0.1184185014895046E+01 0.1177006173793340E+01 0.1169767211415667E+01 0.1162471120103017E+01\n 0.1155120853718478E+01 0.1147719326947540E+01 0.1140269414645216E+01 0.1132773951228974E+01 0.1125235730116526E+01\n 0.1117657503207466E+01 0.1110041980407784E+01 0.1102391829196240E+01 0.1094709674231619E+01 0.1086998096999836E+01\n 0.1079259635499933E+01 0.1071496783967914E+01 0.1063711992637463E+01 0.1055907667536516E+01 0.1048086170318704E+01\n 0.1040249818128692E+01 0.1032400883500383E+01 0.1024541594287072E+01 0.1016674133622509E+01 0.1008800639911969E+01\n 0.1000923206852306E+01 0.9930438834801176E+00 0.9851646742469989E+00 0.9772875391210279E+00 0.9694143937135093E+00\n 0.9615471094301068E+00 0.9536875136454389E+00 0.9458373899002650E+00 0.9379984781203971E+00 0.9301724748564474E+00\n 0.9223610335436100E+00 0.9145657647805825E+00 0.9067882366268739E+00 0.8990299749176214E+00 0.8912924635951891E+00\n 0.8835771450567167E+00 0.8758854205168844E+00 0.8682186503851309E+00 0.8605781546565948E+00 0.8529652133160540E+00\n 0.8453810667541574E+00 0.8378269161952663E+00 0.8303039241362116E+00 0.8228132147953376E+00 0.8153558745711390E+00\n 0.8079329525099168E+00 0.8005454607817869E+00 0.7931943751644794E+00 0.7858806355343143E+00 0.7786051463638074E+00\n 0.7713687772253328E+00 0.7641723633003079E+00 0.7570167058933844E+00 0.7499025729511121E+00 0.7428306995846062E+00\n 0.7358017885957079E+00 0.7288165110062022E+00 0.7218755065895981E+00 0.7149793844050807E+00 0.7081287233331618E+00\n 0.7013240726126531E+00 0.6945659523785421E+00 0.6878548542003931E+00 0.6811912416209033E+00 0.6745755506942478E+00\n 0.6680081905238785E+00 0.6614895437994238E+00 0.6550199673323996E+00 0.6485997925903795E+00 0.6422293262293763E+00\n 0.6359088506240991E+00 0.6296386243958603E+00 0.6234188829378302E+00 0.6172498389374158E+00 0.6111316828955082E+00\n 0.6050645836423746E+00 0.5990486888499783E+00 0.5930841255405085E+00 0.5871710005909401E+00 0.5813094012334057E+00\n 0.5754993955512363E+00 0.5697410329704640E+00 0.5640343447466610E+00 0.5583793444469337E+00 0.5527760284269526E+00\n 0.5472243763028636E+00 0.5417243514179740E+00 0.5362759013040796E+00 0.5308789581373305E+00 0.5255334391885358E+00\n 0.5202392472678002E+00 0.5149962711634282E+00 0.5098043860749818E+00 0.5046634540404551E+00 0.4995733243574682E+00\n 0.4945338339984403E+00 0.4895448080196743E+00 0.4846060599643165E+00 0.4797173922591353E+00 0.4748785966051021E+00\n 0.4700894543617143E+00 0.4653497369250721E+00 0.4606592060996474E+00 0.4560176144637674E+00 0.4514247057287724E+00\n 0.4468802150918596E+00 0.4423838695826035E+00 0.4379353884031551E+00 0.4335344832621323E+00 0.4291808587022021E+00\n 0.4248742124213836E+00 0.4206142355880688E+00 0.4164006131498095E+00 0.4122330241358657E+00 0.4081111419535712E+00\n 0.4040346346785266E+00 0.4000031653386660E+00 0.3960163921922264E+00 0.3920739689996687E+00 0.3881755452895829E+00\n 0.3843207666186236E+00 0.3805092748255328E+00 0.3767407082792822E+00 0.3730147021214013E+00 0.3693308885025316E+00\n 0.3656888968132757E+00 0.3620883539093817E+00 0.3585288843313358E+00 0.3550101105184098E+00 0.3515316530172374E+00\n 0.3480931306849715E+00 0.3446941608870878E+00 0.3413343596899074E+00 0.3380133420478924E+00 0.3347307219857906E+00\n 0.3314861127756896E+00 0.3282791271090590E+00 0.3251093772638369E+00 0.3219764752666408E+00 0.3188800330501668E+00\n 0.3158196626058555E+00 0.3127949761318864E+00 0.3098055861765790E+00 0.3068511057772733E+00 0.3039311485947566E+00\n 0.3010453290433147E+00 0.2981932624164749E+00 0.2953745650085209E+00 0.2925888542318437E+00 0.2898357487302072E+00\n 0.2871148684879984E+00 0.2844258349355381E+00 0.2817682710505188E+00 0.2791418014556485E+00 0.2765460525125659E+00\n 0.2739806524121053E+00 0.2714452312609780E+00 0.2689394211649400E+00 0.2664628563085241E+00 0.2640151730313972E+00\n 0.2615960099014194E+00 0.2592050077844695E+00 0.2568418099111116E+00 0.2545060619401636E+00 0.2521974120192415E+00\n 0.2499155108423418E+00 0.2476600117045342E+00 0.2454305705538249E+00 0.2432268460402566E+00 0.2410484995623153E+00\n 0.2388951953107000E+00 0.2367666003095238E+00 0.2346623844550057E+00 0.2325822205517195E+00 0.2305257843464541E+00\n 0.2284927545597522E+00 0.2264828129151803E+00 0.2244956441663966E+00 0.2225309361220672E+00 0.2205883796686914E+00\n 0.2186676687913947E+00 0.2167685005927387E+00 0.2148905753096101E+00 0.2130335963282359E+00 0.2111972701973850E+00\n 0.2093813066398013E+00 0.2075854185619259E+00 0.2058093220619543E+00 0.2040527364362842E+00 0.2023153841843948E+00\n 0.2005969910122156E+00 0.1988972858340233E+00 0.1972160007729189E+00 0.1955528711599284E+00 0.1939076355317738E+00\n 0.1922800356273561E+00 0.1906698163829959E+00 0.1890767259264730E+00 0.1875005155699057E+00 0.1859409398015150E+00\n 0.1843977562763068E+00 0.1828707258057186E+00 0.1813596123462640E+00 0.1798641829872162E+00 0.1783842079373634E+00\n 0.1769194605108787E+00 0.1754697171123329E+00 0.1740347572208903E+00 0.1726143633737163E+00 0.1712083211486371E+00\n 0.1698164191460766E+00 0.1684384489703060E+00 0.1670742052100373E+00 0.1657234854183902E+00 0.1643860900922608E+00\n 0.1630618226511230E+00 0.1617504894152905E+00 0.1604518995836656E+00 0.1591658652110027E+00 0.1578922011847117E+00\n 0.1566307252012296E+00 0.1553812577419816E+00 0.1541436220489565E+00 0.1529176440999246E+00 0.1517031525833137E+00\n 0.1504999788727721E+00 0.1493079570014363E+00 0.1481269236359270E+00 0.1469567180500930E+00 0.1457971820985229E+00\n 0.1446481601898438E+00 0.1435094992598286E+00 0.1423810487443264E+00 0.1412626605520352E+00 0.1401541890371375E+00\n 0.1390554909718100E+00 0.1379664255186285E+00 0.1368868542028802E+00 0.1358166408848024E+00 0.1347556517317591E+00\n 0.1337037551903719E+00 0.1326608219586172E+00 0.1316267249579071E+00 0.1306013393051614E+00 0.1295845422848884E+00\n 0.1285762133212826E+00 0.1275762339503552E+00 0.1265844877921041E+00 0.1256008605227379E+00 0.1246252398469633E+00\n 0.1236575154703454E+00 0.1226975790717512E+00 0.1217453242758857E+00 0.1208006466259300E+00 0.1198634435562893E+00\n 0.1189336143654594E+00 0.1180110601890202E+00 0.1170956839727626E+00 0.1161873904459593E+00 0.1152860860947805E+00\n 0.1143916791358692E+00 0.1135040794900743E+00 0.1126231987563555E+00 0.1117489501858582E+00 0.1108812486561707E+00\n 0.1100200106457653E+00 0.1091651542086276E+00 0.1083165989490820E+00 0.1074742659968154E+00 0.1066380779821052E+00\n 0.1058079590112519E+00 0.1049838346422265E+00 0.1041656318605295E+00 0.1033532790552702E+00 0.1025467059954647E+00\n 0.1017458438065610E+00 0.1009506249471885E+00 0.1001609831861390E+00 0.9937685357957692E-01 0.9859817244848566E-01\n 0.9782487735634983E-01 0.9705690708707349E-01 0.9629420162313919E-01 0.9553670212400750E-01 0.9478435090475915E-01\n 0.9403709141497944E-01 0.9329486821788784E-01 0.9255762696971309E-01 0.9182531439931366E-01 0.9109787828804443E-01\n 0.9037526744987140E-01 0.8965743171173354E-01 0.8894432189415159E-01 0.8823588979208480E-01 0.8753208815603555E-01\n 0.8683287067340226E-01 0.8613819195007733E-01 0.8544800749229453E-01 0.8476227368872161E-01 0.8408094779279952E-01\n 0.8340398790532604E-01 0.8273135295728512E-01 0.8206300269292026E-01 0.8139889765304979E-01 0.8073899915862499E-01\n 0.8008326929452908E-01 0.7943167089361686E-01 0.7878416752099129E-01 0.7814072345852002E-01 0.7750130368958605E-01\n 0.7686587388407512E-01 0.7623440038359473E-01 0.7560685018692687E-01 0.7498319093571042E-01 0.7436339090035288E-01\n 0.7374741896616860E-01 0.7313524461974377E-01 0.7252683793552536E-01 0.7192216956263091E-01 0.7132121071188088E-01\n 0.7072393314304767E-01 0.7013030915232332E-01 0.6954031156000041E-01 0.6895391369836718E-01 0.6837108939981353E-01\n 0.6779181298514624E-01 0.6721605925211059E-01 0.6664380346411826E-01 0.6607502133917825E-01 0.6550968903902774E-01\n 0.6494778315846379E-01 0.6438928071487048E-01 0.6383415913794230E-01 0.6328239625959906E-01 0.6273397030409252E-01\n 0.6218885987830131E-01 0.6164704396221248E-01 0.6110850189958664E-01 0.6057321338880634E-01 0.6004115847390429E-01\n 0.5951231753576908E-01 0.5898667128352685E-01 0.5846420074609691E-01 0.5794488726391903E-01 0.5742871248084910E-01\n 0.5691565833622340E-01 0.5640570705708669E-01 0.5589884115058460E-01 0.5539504339651542E-01 0.5489429684004177E-01\n 0.5439658478455860E-01 0.5390189078471544E-01 0.5341019863959112E-01 0.5292149238601910E-01 0.5243575629206128E-01\n 0.5195297485062703E-01 0.5147313277323774E-01 0.5099621498393213E-01 0.5052220661331305E-01 0.5005109299273101E-01\n 0.4958285964860470E-01 0.4911749229687554E-01 0.4865497683759399E-01 0.4819529934963621E-01 0.4773844608554897E-01\n 0.4728440346652141E-01 0.4683315807748007E-01 0.4638469666230777E-01 0.4593900611918208E-01 0.4549607349603369E-01\n 0.4505588598612064E-01 0.4461843092371864E-01 0.4418369577992455E-01 0.4375166815857148E-01 0.4332233579225347E-01\n 0.4289568653845881E-01 0.4247170837580991E-01 0.4205038940040735E-01 0.4163171782227736E-01 0.4121568196192090E-01\n 0.4080227024696274E-01 0.4039147120889799E-01 0.3998327347993617E-01 0.3957766578994016E-01 0.3917463696345855E-01\n 0.3877417591685010E-01 0.3837627165549899E-01 0.3798091327111933E-01 0.3758808993914695E-01 0.3719779091621782E-01\n 0.3681000553773126E-01 0.3642472321549702E-01 0.3604193343546399E-01 0.3566162575553031E-01 0.3528378980343305E-01\n 0.3490841527471608E-01 0.3453549193077510E-01 0.3416500959697864E-01 0.3379695816086406E-01 0.3343132757040658E-01\n 0.3306810783236118E-01 0.3270728901067565E-01 0.3234886122497425E-01 0.3199281464910996E-01 0.3163913950978563E-01\n 0.3128782608524168E-01 0.3093886470401072E-01 0.3059224574373675E-01 0.3024795963005924E-01 0.2990599683556058E-01\n 0.2956634787877624E-01 0.2922900332326631E-01 0.2889395377674870E-01 0.2856118989029233E-01 0.2823070235756949E-01\n 0.2790248191416771E-01 0.2757651933695894E-01 0.2725280544352705E-01 0.2693133109165141E-01 0.2661208717884729E-01\n 0.2629506464196176E-01 0.2598025445682497E-01 0.2566764763795566E-01 0.2535723523832159E-01 0.2504900834915327E-01\n 0.2474295809981158E-01 0.2443907565770799E-01 0.2413735222827780E-01 0.2383777905500606E-01 0.2354034741950517E-01\n 0.2324504864164501E-01 0.2295187407973472E-01 0.2266081513075604E-01 0.2237186323064830E-01 0.2208500985464502E-01\n 0.2180024651766184E-01 0.2151756477473634E-01 0.2123695622151859E-01 0.2095841249481422E-01 0.2068192527317876E-01\n 0.2040748627756411E-01 0.2013508727201714E-01 0.1986472006443057E-01 0.1959637650734679E-01 0.1933004849881481E-01\n 0.1906572798330038E-01 0.1880340695265023E-01 0.1854307744711091E-01 0.1828473155640220E-01 0.1802836142084625E-01\n 0.1777395923255295E-01 0.1752151723666215E-01 0.1727102773264334E-01 0.1702248307565384E-01 0.1677587567795624E-01\n 0.1653119801039607E-01 0.1628844260394024E-01 0.1604760205127793E-01 0.1580866900848456E-01 0.1557163619674996E-01\n 0.1533649640417201E-01 0.1510324248761716E-01 0.1487186737464884E-01 0.1464236406552526E-01 0.1441472563526792E-01\n 0.1418894523580252E-01 0.1396501609817369E-01 0.1374293153483488E-01 0.1352268494201562E-01 0.1330426980216726E-01\n 0.1308767968648953E-01 0.1287290825753935E-01 0.1265994927192371E-01 0.1244879658307933E-01 0.1223944414413996E-01\n 0.1203188601089432E-01 0.1182611634483635E-01 0.1162212941630988E-01 0.1141991960775031E-01 0.1121948141702494E-01\n 0.1102080946087490E-01 0.1082389847846042E-01 0.1062874333501194E-01 0.1043533902558977E-01 0.1024368067895393E-01\n 0.1005376356154735E-01 0.9865583081593922E-02 0.9679134793314684E-02 0.9494414401263529E-02 0.9311417764785166E-02\n 0.9130140902597625E-02 0.8950579997500882E-02 0.8772731401214267E-02 0.8596591639343950E-02 0.8422157416482423E-02\n 0.8249425621441884E-02 0.8078393332622082E-02 0.7909057823514530E-02 0.7741416568343256E-02 0.7575467247842871E-02\n 0.7411207755174127E-02 0.7248636201976184E-02 0.7087750924555473E-02 0.6928550490209059E-02 0.6771033703680868E-02\n 0.6615199613748215E-02 0.6461047519934641E-02 0.6308576979345235E-02 0.6157787813618597E-02 0.6008680115989046E-02\n 0.5861254258451652E-02 0.5715510899020261E-02 0.5571450989068522E-02 0.5429075780740853E-02 0.5288386834419521E-02\n 0.5149386026230897E-02 0.5012075555572173E-02 0.4876457952637328E-02 0.4742536085917297E-02 0.4610313169647435E-02\n 0.4479792771170533E-02 0.4350978818180493E-02 0.4223875605807347E-02 0.4098487803498918E-02 0.3974820461650163E-02\n 0.3852879017924298E-02 0.3732669303204216E-02 0.3614197547105479E-02 0.3497470382973937E-02 0.3382494852283408E-02\n 0.3269278408338597E-02 0.3157828919178777E-02 0.3048154669566634E-02 0.2940264361933685E-02 0.2834167116141327E-02\n 0.2729872467901025E-02 0.2627390365681719E-02 0.2526731165915232E-02 0.2427905626291050E-02 0.2330924896912227E-02\n 0.2235800509061165E-02 0.2142544361300639E-02 0.2051168702609613E-02 0.1961686112225166E-02 0.1874109475832896E-02\n 0.1788451957715710E-02 0.1704726968437611E-02 0.1622948127603452E-02 0.1543129221197582E-02 0.1465284152965789E-02\n 0.1389426889263572E-02 0.1315571396752711E-02 0.1243731572285281E-02 0.1173921164272465E-02 0.1106153684794404E-02\n 0.1040442311668004E-02 0.9767997796547971E-03 0.9152382599604941E-03 0.8557692271559906E-03 0.7984033126378760E-03\n 0.7431501437484684E-03 0.6900181676963877E-03 0.6390144594619438E-03 0.5901445129451447E-03 0.5434120147240581E-03\n 0.4988185999463610E-03 0.4563635900883120E-03 0.4160437125934487E-03 0.3778528027632167E-03 0.3417814887280997E-03\n 0.3078168608981688E-03 0.2759421279962239E-03 0.2461362626341978E-03 0.2183736404266527E-03 0.1926236778641105E-03\n 0.1688504756124491E-03 0.1470124755772384E-03 0.1270621419785909E-03 0.1089456788163143E-03 0.9260279843818645E-04\n 0.7796655839983218E-04 0.6496328632466781E-04 0.5351261488371726E-04 0.4352765109263255E-04 0.3491530554961739E-04\n 0.2757680758595959E-04 0.2140843101578471E-04 0.1630245156608879E-04 0.1214835033531085E-04 0.8834266891203550E-05\n 0.6248690035680286E-05 0.4282353222462611E-05 0.2830275035848309E-05 0.1793853932613698E-05 0.1082893085919590E-05\n 0.6174003285747537E-06 0.3289872539180627E-06 0.1616905202076728E-06 0.7206870776681014E-07 0.2849911999804606E-07\n 0.9712198708650968E-08 0.2742442283547959E-08 0.6076172112450161E-09 0.9772731077597771E-10 0.1017048852958432E-10\n 0.5734341782146348E-12 0.1311491489053561E-13 0.7338688834175233E-16 0.3808514445153469E-19 0.2185032842849075E-24\n 0.4450194794086531E-34 0.4448435176905321E-58 0.1173305758391880E-217 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 13 26.982 4.0500 fcc \n 0.0000000000000000E+00 -0.9628279509886344E-01 -0.9953365511717502E-01 -0.1085367257834955E+00 -0.1214218487615201E+00\n -0.1368680672855588E+00 -0.1540621427490459E+00 -0.1724823698187966E+00 -0.1917766936082239E+00 -0.2116972667780488E+00\n -0.2320627441427241E+00 -0.2527367403313019E+00 -0.2736137350811652E+00 -0.2946105714789528E+00 -0.3156602493701524E+00\n -0.3367083306444053E+00 -0.3577089488344269E+00 -0.3786243739249987E+00 -0.3994221660811231E+00 -0.4200735094048743E+00\n -0.4404904782781875E+00 -0.4603267076635175E+00 -0.4791342002596235E+00 -0.4966697876448934E+00 -0.5129130363987204E+00\n -0.5279649398751899E+00 -0.5419673801142365E+00 -0.5550615741668476E+00 -0.5673715677751278E+00 -0.5790001198451177E+00\n -0.5900298137753388E+00 -0.6005259461781434E+00 -0.6105396931325852E+00 -0.6201109775165654E+00 -0.6292707959422479E+00\n -0.6380435230284373E+00 -0.6464477036605579E+00 -0.6544979268477449E+00 -0.6622058329958839E+00 -0.6695796004816827E+00\n -0.6766263822113870E+00 -0.6833513422524340E+00 -0.6897586759282083E+00 -0.6958513916294100E+00 -0.7016318963634165E+00\n -0.7071020397392846E+00 -0.7122632455033970E+00 -0.7171166154132189E+00 -0.7216630115090188E+00 -0.7259031214369276E+00\n -0.7298375104167867E+00 -0.7334666626446351E+00 -0.7367910666835507E+00 -0.7398107650409456E+00 -0.7425268555598952E+00\n -0.7449393618108722E+00 -0.7470487599589724E+00 -0.7488555593770301E+00 -0.7503603132693473E+00 -0.7515636266841099E+00\n -0.7524661625108897E+00 -0.7530686459172391E+00 -0.7533718513852463E+00 -0.7533768363262632E+00 -0.7530840012877273E+00\n -0.7524921131814579E+00 -0.7515804606478103E+00 -0.7502792607163535E+00 -0.7484607038243816E+00 -0.7459636916668000E+00\n -0.7426298640002307E+00 -0.7383310820407341E+00 -0.7329796809143272E+00 -0.7265308852606689E+00 -0.7189742772379484E+00\n -0.7103273715872973E+00 -0.7006269201238819E+00 -0.6899214100415596E+00 -0.6782669062893683E+00 -0.6657222644919032E+00\n -0.6523467518594732E+00 -0.6381981822655980E+00 -0.6233317828078055E+00 -0.6077995440370048E+00 -0.5916499059655702E+00\n -0.5749276704151935E+00 -0.5576740608036261E+00 -0.5399269902646231E+00 -0.5217207897977505E+00 -0.5030872174417831E+00\n -0.4840550838961484E+00 -0.4646507036272260E+00 -0.4448981173724120E+00 -0.4248192982742891E+00 -0.4044343519155205E+00\n -0.3837617000246638E+00 -0.3628182478945590E+00 -0.3416195360896790E+00 -0.3201798773328464E+00 -0.2985124796289278E+00\n -0.2766295567505006E+00 -0.2545424272145054E+00 -0.2322616028428013E+00 -0.2097968679392537E+00 -0.1871573500428596E+00\n -0.1643515831380795E+00 -0.1413875641241673E+00 -0.1182728032683014E+00 -0.9501436929434126E-01 -0.7161893009339959E-01\n -0.4809278834346697E-01 -0.2444191370712145E-01 -0.6719720983290323E-03 0.2321164851959434E-01 0.4720381488457415E-01\n 0.7129962756731612E-01 0.9549440222479744E-01 0.1197836527451308E+00 0.1441630239601834E+00 0.1686284833950578E+00\n 0.1931760053643994E+00 0.2178017590483101E+00 0.2425020494231500E+00 0.2672733026214353E+00 0.2921120755096318E+00\n 0.3170150833336578E+00 0.3419794799317026E+00 0.3670036243095800E+00 0.3920881689533946E+00 0.4172368973967129E+00\n 0.4424568644116991E+00 0.4677578158531293E+00 0.4931511605824372E+00 0.5186488234682329E+00 0.5442622221402917E+00\n 0.5700014909585294E+00 0.5958749808858199E+00 0.6218890074764571E+00 0.6480477945330341E+00 0.6743535566999124E+00\n 0.7008066705597229E+00 0.7274058941450217E+00 0.7541486054898794E+00 0.7810310401956295E+00 0.8080485153972305E+00\n 0.8351956330126833E+00 0.8624664590130959E+00 0.8898546780165009E+00 0.9173537241128331E+00 0.9449568897488558E+00\n 0.9726574149554992E+00 0.1000448559348619E+01 0.1028323659291245E+01 0.1056276172451073E+01 0.1084299711777170E+01\n 0.1112388070685622E+01 0.1140535241011345E+01 0.1168735425061202E+01 0.1196983042901978E+01 0.1225272735836553E+01\n 0.1253599366863931E+01 0.1281958018782363E+01 0.1310343990479578E+01 0.1338752791854684E+01 0.1367180137734465E+01\n 0.1395621941077129E+01 0.1424074305699794E+01 0.1452533518717449E+01 0.1480996042842949E+01 0.1509458508665117E+01\n 0.1537917706995331E+01 0.1566370831749105E+01 0.1594814471963946E+01 0.1623246104160209E+01 0.1651663086958648E+01\n 0.1680062903840593E+01 0.1708443156854245E+01 0.1736801560607192E+01 0.1765135936545083E+01 0.1793444207513674E+01\n 0.1821724397566120E+01 0.1849974626590099E+01 0.1878193078402154E+01 0.1906378032515773E+01 0.1934527846644618E+01\n 0.1962640952792409E+01 0.1990715853560963E+01 0.2018751118665230E+01 0.2046745381644585E+01 0.2074697336759590E+01\n 0.2102605736064189E+01 0.2130469386642917E+01 0.2158287148004209E+01 0.2186057929620079E+01 0.2213780688603973E+01\n 0.2241454427518249E+01 0.2269078192303640E+01 0.2296651070323292E+01 0.2324172188515120E+01 0.2351640711701886E+01\n 0.2379055842086045E+01 0.2406416827027384E+01 0.2433722996957316E+01 0.2460973865437883E+01 0.2488169306929864E+01\n 0.2515309789359613E+01 0.2542396607347866E+01 0.2569432057808982E+01 0.2596419519065771E+01 0.2623363422536599E+01\n 0.2650269129601363E+01 0.2677142739909846E+01 0.2703990861443457E+01 0.2730820370008068E+01 0.2757638179775513E+01\n 0.2784451039495457E+01 0.2811265362580523E+01 0.2838087094127737E+01 0.2864921614243932E+01 0.2891773674664324E+01\n 0.2918647364337785E+01 0.2945546099121457E+01 0.2972472630730262E+01 0.2999429070422704E+01 0.3026416923420929E+01\n 0.3053437130653784E+01 0.3080490115009347E+01 0.3107575829842219E+01 0.3134693807981898E+01 0.3161843209919625E+01\n 0.3189022870212173E+01 0.3216231341437487E+01 0.3243466935272163E+01 0.3270727760447288E+01 0.3298011757479649E+01\n 0.3325316730182467E+01 0.3352640374035690E+01 0.3379980301550311E+01 0.3407334064796215E+01 0.3434699175284783E+01\n 0.3462073121407959E+01 0.3489453383638473E+01 0.3516837447692921E+01 0.3544222815852538E+01 0.3571607016626300E+01\n 0.3598987612930495E+01 0.3626362208945728E+01 0.3653728455799938E+01 0.3681084056213634E+01 0.3708426768230866E+01\n 0.3735754408148046E+01 0.3763064852741161E+01 0.3790356040882480E+01 0.3817625974627172E+01 0.3844872719842444E+01\n 0.3872094406443206E+01 0.3899289228291301E+01 0.3926455442808664E+01 0.3953591370348690E+01 0.3980695393365072E+01\n 0.4007765955412338E+01 0.4034801560008381E+01 0.4061800769384807E+01 0.4088762203148616E+01 0.4115684536874605E+01\n 0.4142566500646071E+01 0.4169406877558640E+01 0.4196204502200039E+01 0.4222958259116835E+01 0.4249667081277604E+01\n 0.4276329948540632E+01 0.4302945886132529E+01 0.4329513963143877E+01 0.4356033291046330E+01 0.4382503022235336E+01\n 0.4408922348601389E+01 0.4435290500132353E+01 0.4461606743549172E+01 0.4487870380976208E+01 0.4514080748647457E+01\n 0.4540237215649173E+01 0.4566339182699858E+01 0.4592386080967303E+01 0.4618377370923009E+01 0.4644312541233742E+01\n 0.4670191107689631E+01 0.4696012612168792E+01 0.4721776621637420E+01 0.4747482727184995E+01 0.4773130543093758E+01\n 0.4798719705941583E+01 0.4824249873737505E+01 0.4849720725089056E+01 0.4875131958400324E+01 0.4900483291100185E+01\n 0.4925774458899197E+01 0.4951005215074943E+01 0.4976175329784288E+01 0.5001284589402100E+01 0.5026332801140161E+01\n 0.5051319771276494E+01 0.5076245336511819E+01 0.5101109341973393E+01 0.5125911646062397E+01 0.5150652119931829E+01\n 0.5175330646984699E+01 0.5199947122391546E+01 0.5224501452626964E+01 0.5248993555024179E+01 0.5273423357346785E+01\n 0.5297790805953600E+01 0.5322095829385203E+01 0.5346338394872665E+01 0.5370518467903519E+01 0.5394636022497286E+01\n 0.5418691040867781E+01 0.5442683513098503E+01 0.5466613436830711E+01 0.5490480816963549E+01 0.5514285665365584E+01\n 0.5538028000597862E+01 0.5561707847647368E+01 0.5585325237670777E+01 0.5608880207748139E+01 0.5632372800646136E+01\n 0.5655803064590023E+01 0.5679171053044746E+01 0.5702476824504079E+01 0.5725720442287942E+01 0.5748901974347438E+01\n 0.5772021493077228E+01 0.5795079075135007E+01 0.5818074801267764E+01 0.5841008756144801E+01 0.5863881028196719E+01\n 0.5886691709361872E+01 0.5909440895975128E+01 0.5932128683720454E+01 0.5954755179911128E+01 0.5977320485443878E+01\n 0.5999824709469358E+01 0.6022267962734361E+01 0.6044650358660738E+01 0.6066972013230976E+01 0.6089233044877606E+01\n 0.6111433574377054E+01 0.6133573724746905E+01 0.6155653621147478E+01 0.6177673390786589E+01 0.6199633162827851E+01\n 0.6221533068302496E+01 0.6243373240024188E+01 0.6265153812506977E+01 0.6286874921886278E+01 0.6308536705842656E+01\n 0.6330139303528365E+01 0.6351682855496508E+01 0.6373167503632674E+01 0.6394593391089307E+01 0.6415960662221997E+01\n 0.6437269462528379E+01 0.6458519938589133E+01 0.6479712238010886E+01 0.6500846509371517E+01 0.6521922902167027E+01\n 0.6542941566760541E+01 0.6563902654333011E+01 0.6584806316835689E+01 0.6605652706944284E+01 0.6626441978014737E+01\n 0.6647174088072036E+01 0.6667849577716816E+01 0.6688468412040860E+01 0.6709030746709217E+01 0.6729536737868406E+01\n 0.6749986542110525E+01 0.6770380316439014E+01 0.6790718218235369E+01 0.6811000456475160E+01 0.6831227079554464E+01\n 0.6851398303748420E+01 0.6871514287649720E+01 0.6891575190080648E+01 0.6911581170066203E+01 0.6931532386808209E+01\n 0.6951428999660269E+01 0.6971271168103572E+01 0.6991059051723765E+01 0.7010792810188176E+01 0.7030472603224527E+01\n 0.7050098590599536E+01 0.7069670932099115E+01 0.7089189787508612E+01 0.7108655316594129E+01 0.7128067679084379E+01\n 0.7147427034653132E+01 0.7166733542902411E+01 0.7185987363346015E+01 0.7205188655394117E+01 0.7224337578337899E+01\n 0.7243434291334958E+01 0.7262478953395287E+01 0.7281471723367670E+01 0.7300412759926576E+01 0.7319302221559616E+01\n 0.7338140266555139E+01 0.7356927052990867E+01 0.7375662738722378E+01 0.7394347481372199E+01 0.7412981438319438E+01\n 0.7431564766689641E+01 0.7450097623345021E+01 0.7468580164875283E+01 0.7487012547588363E+01 0.7505394927501915E+01\n 0.7523727460334936E+01 0.7542010301499733E+01 0.7560243606094313E+01 0.7578427528894725E+01 0.7596562224348212E+01\n 0.7614647846566118E+01 0.7632684549317478E+01 0.7650672486022634E+01 0.7668611809747173E+01 0.7686502673196021E+01\n 0.7704345228708073E+01 0.7722139628250660E+01 0.7739886023414384E+01 0.7757584565408455E+01 0.7775235405055646E+01\n 0.7792838692788044E+01 0.7810394578642622E+01 0.7827903212257197E+01 0.7845364742866390E+01 0.7862779319297943E+01\n 0.7880147089969217E+01 0.7897468202883433E+01 0.7914742805626958E+01 0.7931971045365675E+01 0.7949153068842364E+01\n 0.7966289022373804E+01 0.7983379051848088E+01 0.8000423302722167E+01 0.8017421920019366E+01 0.8034375048327233E+01\n 0.8051282831795312E+01 0.8068145414133273E+01 0.8084962938608882E+01 0.8101735548046269E+01 0.8118463384824164E+01\n 0.8135146590874683E+01 0.8151785307681390E+01 0.8168379676278345E+01 0.8184929837248552E+01 0.8201435930723028E+01\n 0.8217898096379580E+01 0.8234316473441851E+01 0.8250691200678498E+01 0.8267022416402313E+01 0.8283310258469461E+01\n 0.8299554864278941E+01 0.8315756370771805E+01 0.8331914914430893E+01 0.8348030631280192E+01 0.8364103656884673E+01\n 0.8380134126349787E+01 0.8396122174321329E+01 0.8412067934985277E+01 0.8427971542067645E+01 0.8443833128834413E+01\n 0.8459652828091619E+01 0.8475430772185273E+01 0.8491167093001646E+01 0.8506861921967246E+01 0.8522515390049147E+01\n 0.8538127627755209E+01 0.8553698765134389E+01 0.8569228931777127E+01 0.8584718256815695E+01 0.8600166868924553E+01\n 0.8615574896321021E+01 0.8630942466765738E+01 0.8646269707563008E+01 0.8661556745561711E+01 0.8676803707155621E+01\n 0.8692010718284379E+01 0.8707177904433900E+01 0.8722305390637324E+01 0.8737393301475592E+01 0.8752441761078339E+01\n 0.8767450893124774E+01 0.8782420820844322E+01 0.8797351667017651E+01 0.8812243553977586E+01 0.8827096603609940E+01\n 0.8841910937354429E+01 0.8856686676205864E+01 0.8871423940714820E+01 0.8886122850988944E+01 0.8900783526693864E+01\n 0.8915406087054141E+01 0.8929990650854535E+01 0.8944537336441012E+01 0.8959046261721827E+01 0.8973517544168701E+01\n 0.8987951300817869E+01 0.9002347648271487E+01 0.9016706702698437E+01 0.9031028579835858E+01 0.9045313394990188E+01\n 0.9059561263038376E+01 0.9073772298429056E+01 0.9087946615184084E+01 0.9102084326899423E+01 0.9116185546746657E+01\n 0.9130250387474085E+01 0.9144278961408215E+01 0.9158271380454892E+01 0.9172227756100682E+01 0.9186148199414212E+01\n 0.9200032821047387E+01 0.9213881731236844E+01 0.9227695039805166E+01 0.9241472856162442E+01 0.9255215289307372E+01\n 0.9268922447828803E+01 0.9282594439906916E+01 0.9296231373314885E+01 0.9309833355419986E+01 0.9323400493185019E+01\n 0.9336932882359978E+01 0.9350430594893881E+01 0.9363893783342821E+01 0.9377322553011272E+01 0.9390717008807609E+01\n 0.9404077255245511E+01 0.9417403396445167E+01 0.9430695536134984E+01 0.9443953777652798E+01 0.9457178223947256E+01\n 0.9470368977579316E+01 0.9483526140723573E+01 0.9496649815169690E+01 0.9509740102323899E+01 0.9522797103210273E+01\n 0.9535822238420437E+01 0.9548812165768359E+01 0.9561769891801452E+01 0.9574694732427433E+01 0.9587586786767478E+01\n 0.9600446153569266E+01 0.9613272931208536E+01 0.9626067217690245E+01 0.9638829110650304E+01 0.9651558707356724E+01\n 0.9664256104711166E+01 0.9676921399250290E+01 0.9689554687147089E+01 0.9702157469174860E+01 0.9714727037387689E+01\n 0.9727264885308301E+01 0.9739771107669302E+01 0.9752245798846879E+01 0.9764689052861872E+01 0.9777100963381457E+01\n 0.9789481623720420E+01 0.9801831126842281E+01 0.9814149565361319E+01 0.9826437031543161E+01 0.9838693617306955E+01\n 0.9850919414226038E+01 0.9863114513529872E+01 0.9875279006105066E+01 0.9887412982496855E+01 0.9899516532910610E+01\n 0.9911589747212901E+01 0.9923632714933214E+01 0.9935645525264956E+01 0.9947628267067159E+01 0.9959581028865557E+01\n 0.9971503898854007E+01 0.9983396964895977E+01 0.9995260314525778E+01 0.1000709403494981E+02 0.1001889821304812E+02\n 0.1003067293537552E+02 0.1004241828816303E+02 0.1005413435731925E+02 0.1006582122843160E+02 0.1007747898676759E+02\n 0.1008910771727630E+02 0.1010070750458943E+02 0.1011227843302306E+02 0.1012382058657841E+02 0.1013533404894347E+02\n 0.1014681890349423E+02 0.1015827523329602E+02 0.1016970312110463E+02 0.1018110264936784E+02 0.1019247390022638E+02\n 0.1020381695551557E+02 0.1021513189676633E+02 0.1022641880520652E+02 0.1023767776176225E+02 0.1024890884705905E+02\n 0.1026011214142316E+02 0.1027128772488293E+02 0.1028243567716970E+02 0.1029355607771946E+02 0.1030464900567390E+02\n 0.1031571453988140E+02 0.1032675275889879E+02 0.1033776374099216E+02 0.1034874756413813E+02 0.1035970430602517E+02\n 0.1037063404405489E+02 0.1038153685534300E+02 0.1039241281672065E+02 0.1040326200473567E+02 0.1041408449565369E+02\n 0.1042488036545932E+02 0.1043564968985735E+02 0.1044639254427403E+02 0.1045710900385802E+02 0.1046779914348181E+02\n 0.1047846303774262E+02 0.1048910076096391E+02 0.1049971238719612E+02 0.1051029799021812E+02 0.1052085764353829E+02\n 0.1053139142039568E+02 0.1054189939376099E+02 0.1055238163633786E+02 0.1056283822056399E+02 0.1057326921861215E+02\n 0.1058367470239147E+02 0.1059405474354847E+02 0.1060440941346801E+02 0.1061473878327465E+02 0.1062504292383371E+02\n 0.1063532190575210E+02 0.1064557579937992E+02 0.1065580467481084E+02 0.1066600860188387E+02 0.1067618765018412E+02\n 0.1068634188904373E+02 0.1069647138754325E+02 0.1070657621451248E+02 0.1071665643853165E+02 0.1072671212793241E+02\n 0.1073674335079890E+02 0.1074675017496875E+02 0.1075673266803417E+02 0.1076669089734308E+02 0.1077662492999989E+02\n 0.1078653483286685E+02 0.1079642067256462E+02 0.1080628251547384E+02 0.1081612042773567E+02 0.1082593447525316E+02\n 0.1083572472369191E+02 0.1084549123848135E+02 0.1085523408481566E+02 0.1086495332765466E+02 0.1087464903172486E+02\n 0.1088432126152055E+02 0.1089397008130446E+02 0.1090359555510911E+02 0.1091319774673763E+02 0.1092277671976472E+02\n 0.1093233253753738E+02 0.1094186526317629E+02 0.1095137495957662E+02 0.1096086168940853E+02 0.1097032555892928E+02\n 0.1097976666590150E+02 0.1098918498743821E+02 0.1099858058553585E+02 0.1100795352196447E+02 0.1101730385826855E+02\n 0.1102663165576839E+02 0.1103593697556089E+02 0.1104521987852084E+02 0.1105448042530153E+02 0.1106371867633628E+02\n 0.1107293247783943E+02 0.1108212631163812E+02 0.1109129802968301E+02 0.1110044769153667E+02 0.1110957535654645E+02\n 0.1111868108384563E+02 0.1112776493235422E+02 0.1113682696078008E+02 0.1114586722761977E+02 0.1115488579115973E+02\n 0.1116388270947705E+02 0.1117285804044050E+02 0.1118181184171143E+02 0.1119074417074485E+02 0.1119965508479030E+02\n 0.1120854464089276E+02 0.1121741289589355E+02 0.1122625990643143E+02 0.1123508572894327E+02 0.1124389041966516E+02\n 0.1125267403463331E+02 0.1126143662968485E+02 0.1127017826045877E+02 0.1127889898239682E+02 0.1128759885074458E+02\n 0.1129627792055189E+02 0.1130493624667420E+02 0.1131357388377320E+02 0.1132219088631773E+02 0.1133078730858470E+02\n 0.1133936320465983E+02 0.1134791862843856E+02 0.1135645363362708E+02 0.1136496827374269E+02 0.1137346260211521E+02\n 0.1138193667188745E+02 0.1139039053601605E+02 0.1139882424727257E+02 0.1140723785824395E+02 0.1141563142133352E+02\n 0.1142400498876172E+02 0.1143235861256712E+02 0.1144069234460682E+02 0.1144900623655768E+02 0.1145730033991675E+02\n 0.1146557470600226E+02 0.1147382938595421E+02 0.1148206443073531E+02 0.1149027989113191E+02 0.1149847581775414E+02\n 0.1150665226103736E+02 0.1151480927124249E+02 0.1152294689845698E+02 0.1153106519259537E+02 0.1153916420340013E+02\n 0.1154724398044246E+02 0.1155530457312277E+02 0.1156334603067165E+02 0.1157136840215052E+02 0.1157937173645239E+02\n 0.1158735608230234E+02 0.1159532148825857E+02 0.1160326800271278E+02 0.1161119567389111E+02 0.1161910454985465E+02\n 0.1162699467850026E+02 0.1163486610756115E+02 0.1164271888460782E+02 0.1165055305704804E+02 0.1165836867212856E+02\n 0.1166616577693494E+02 0.1167394441839248E+02 0.1168170464326700E+02 0.1168944649816522E+02 0.1169717002953568E+02\n 0.1170487528366932E+02 0.1171256230670009E+02 0.1172023114460535E+02 0.1172788184320704E+02 0.1173551444817181E+02\n 0.1174312900501185E+02 0.1175072555908556E+02 0.1175830415559807E+02 0.1176586483960187E+02 0.1177340765599744E+02\n 0.1178093264953387E+02 0.1178843986480948E+02 0.1179592934627236E+02 0.1180340113822094E+02 0.1181085528480470E+02\n 0.1181829166269570E+02 0.1182570985953448E+02 0.1183311348562248E+02 0.1184049703658763E+02 0.1184786329267578E+02\n 0.1185521227437533E+02 0.1186254400205932E+02 0.1186985849598701E+02 0.1187715577630568E+02 0.1188443611784194E+02\n 0.1189169878246886E+02 0.1189894457481569E+02 0.1190617328225404E+02 0.1191338494670332E+02 0.1192057960986771E+02\n 0.1192775731323726E+02 0.1193491809808902E+02 0.1194206200548831E+02 0.1194918907628982E+02 0.1195629935113887E+02\n 0.1196339287047247E+02 0.1197046967452045E+02 0.1197752980330694E+02 0.1198457329665118E+02 0.1199160019416887E+02\n 0.1199861053527344E+02 0.1200560435917693E+02 0.1201258170489155E+02 0.1201954261123063E+02 0.1202648711680959E+02\n 0.1203341526004761E+02 0.1204032707916849E+02 0.1204722261220184E+02 0.1205410189698429E+02 0.1206096497116060E+02\n 0.1206781187218495E+02 0.1207464559802799E+02 0.1208146027002577E+02 0.1208825888009797E+02 0.1209504146494779E+02\n 0.1210180806109399E+02 0.1210855896537541E+02 0.1211529410378007E+02 0.1212201340030601E+02 0.1212871689296240E+02\n 0.1213540461963384E+02 0.1214207661808061E+02 0.1214873292593939E+02 0.1215537358072345E+02 0.1216199861982349E+02\n 0.1216860808050769E+02 0.1217520199992239E+02 0.1218178041509279E+02 0.1218834336292295E+02 0.1219489088019657E+02\n 0.1220142300357730E+02 0.1220793976960926E+02 0.1221444121471769E+02 0.1222092737520902E+02 0.1222739828727144E+02\n 0.1223385398697564E+02 0.1224029451027501E+02 0.1224671989300593E+02 0.1225313017088853E+02 0.1225952537952718E+02\n 0.1226590555441035E+02 0.1227227073091185E+02 0.1227862094429078E+02 0.1228495622969180E+02 0.1229127662214604E+02\n 0.1229758215657148E+02 0.1230387286777276E+02 0.1231014879044237E+02 0.1231640995916075E+02 0.1232265640839672E+02\n 0.1232888817250763E+02 0.1233510528574038E+02 0.1234130778223132E+02 0.1234749569600697E+02 0.1235366906098424E+02\n 0.1235982791097082E+02 0.1236597227966591E+02 0.1237210220066028E+02 0.1237821770743661E+02 0.1238431883337027E+02\n 0.1239040561172962E+02 0.1239647807567605E+02 0.1240253625826483E+02 0.1240858019244517E+02 0.1241460991106090E+02\n 0.1242062544685069E+02 0.1242662683244833E+02 0.1243261410038329E+02 0.1243858728308130E+02 0.1244454641286415E+02\n 0.1245049152195065E+02 0.1245642264245671E+02 0.1246233980639583E+02 0.1246824304567928E+02 0.1247413239211681E+02\n 0.1248000787741680E+02 0.1248586953318652E+02 0.1249171739093289E+02 0.1249755148206230E+02 0.1250337183788155E+02\n 0.1250917848959775E+02 0.1251497146831911E+02 0.1252075080505461E+02 0.1252651653071523E+02 0.1253226867611377E+02\n 0.1253800727196519E+02 0.1254373234888717E+02 0.1254944393740030E+02 0.1255514206792864E+02 0.1256082677079984E+02\n 0.1256649807624557E+02 0.1257215601440174E+02 0.1257780061530919E+02 0.1258343190891375E+02 0.1258904992506636E+02\n 0.1259465469352414E+02 0.1260024624394981E+02 0.1260582460591276E+02 0.1261138980888892E+02 0.1261694188226133E+02\n 0.1262248085532045E+02 0.1262800675726433E+02 0.1263351961719898E+02 0.1263901946413904E+02 0.1264450285631671E+02\n 0.1264997675865174E+02 0.1265543773449255E+02 0.1266088581249014E+02 0.1266632102120516E+02 0.1267174338910899E+02\n 0.1267715294458313E+02 0.1268254971592008E+02 0.1268793373132342E+02 0.1269330501890832E+02 0.1269866360670164E+02\n 0.1270400952264229E+02 0.1270934279458158E+02 0.1271466345028335E+02 0.1271997151742474E+02 0.1272526702359572E+02\n 0.1273054999630008E+02 0.1273582044112639E+02 0.1274107829127974E+02 0.1274632368547512E+02 0.1275155665077283E+02\n 0.1275677721414707E+02 0.1276198540248610E+02 0.1276718124259236E+02 0.1277236476118314E+02 0.1277753598489035E+02\n 0.1278269494026117E+02 0.1278784165375827E+02 0.1279297615176009E+02 0.1279809846056095E+02 0.1280320860637152E+02\n 0.1280830661531907E+02 0.1281339251344765E+02 0.1281846632671840E+02 0.1282352808100990E+02 0.1282857780211833E+02\n 0.1283361551575781E+02 0.1283864124756066E+02 0.1284365502307763E+02 0.1284865686777834E+02 0.1285364680705105E+02\n 0.1285862486620364E+02 0.1286359107046338E+02 0.1286854544497717E+02 0.1287348801481206E+02 0.1287841880495558E+02\n 0.1288333784031538E+02 0.1288824514572031E+02 0.1289314074592015E+02 0.1289802466558600E+02 0.1290289692931037E+02\n 0.1290775756160805E+02 0.1291260658691528E+02 0.1291744402959128E+02 0.1292226991391726E+02 0.1292708426409754E+02\n 0.1293188710425972E+02 0.1293667845845432E+02 0.1294145835065556E+02 0.1294622680476155E+02 0.1295098384459444E+02\n 0.1295572949390062E+02 0.1296046377635092E+02 0.1296518671554123E+02 0.1296989833499209E+02 0.1297459865814951E+02\n 0.1297928770838488E+02 0.1298396550899552E+02 0.1298863208320455E+02 0.1299328745416105E+02 0.1299793164494091E+02\n 0.1300256467854653E+02 0.1300718657790715E+02 0.1301179736587904E+02 0.1301639706524610E+02 0.1302098569871943E+02\n 0.1302556328893826E+02 0.1303012985846953E+02 0.1303468542980876E+02 0.1303923002537965E+02 0.1304376366753469E+02\n 0.1304828637855533E+02 0.1305279818065219E+02 0.1305729909596507E+02 0.1306178914656352E+02 0.1306626835444681E+02\n 0.1307073674154426E+02 0.1307519432971517E+02 0.1307964114074970E+02 0.1308407719636832E+02 0.1308850251822266E+02\n 0.1309291712789514E+02 0.1309732104689959E+02 0.1310172496590404E+02 0.1310612888490850E+02 0.1311053280391295E+02\n 0.0000000000000000E+00 0.2350503764662797E-10 0.1452741565148498E-08 0.1598024605657181E-07 0.8670887247915710E-07\n 0.3194268290355064E-06 0.9210999532108705E-06 0.2243032243257230E-05 0.4826533736759059E-05 0.9449280963997414E-05\n 0.1717086310497067E-04 0.2937628005930804E-04 0.4781640004850213E-04 0.7464459701436190E-04 0.1124489746320072E-03\n 0.1642797466831127E-03 0.2336714851009560E-03 0.3246600692852489E-03 0.4417942752036344E-03 0.5901420321021944E-03\n 0.7752914499470295E-03 0.1003346783485080E-02 0.1280919550391384E-02 0.1615115062592291E-02 0.2013514662642524E-02\n 0.2484153982012019E-02 0.3035497556237696E-02 0.3676410143962806E-02 0.4416125103690986E-02 0.5264210184320288E-02\n 0.6230531083824742E-02 0.7325213125386473E-02 0.8558601392363368E-02 0.9941219653166928E-02 0.1148372839483666E-01\n 0.1319688227020127E-01 0.1509148724834461E-01 0.1717835774193908E-01 0.1946827396813322E-01 0.2197193978231332E-01\n 0.2469994120640449E-01 0.2766270585561205E-01 0.3087046344978465E-01 0.3433320757803945E-01 0.3806065886804223E-01\n 0.4206222969448004E-01 0.4634699054488188E-01 0.5092363814510472E-01 0.5580046543156136E-01 0.6098533344267084E-01\n 0.6648564518809444E-01 0.7230832154110638E-01 0.7845977918695805E-01 0.8494591064833676E-01 0.9177206639800155E-01\n 0.9894303905839608E-01 0.1064630496784886E+00 0.1143357360692630E+00 0.1225641431711653E+00 0.1311507154193881E+00\n 0.1400972910661206E+00 0.1494050984128002E+00 0.1590747538999337E+00 0.1691062619971989E+00 0.1794990168322592E+00\n 0.1902518054930074E+00 0.2013628129347618E+00 0.2128296284212524E+00 0.2246492534260200E+00 0.2368181109190946E+00\n 0.2493320559624748E+00 0.2621863875369867E+00 0.2753758615225286E+00 0.2888947047534727E+00 0.3027366300710904E+00\n 0.3168948522952475E+00 0.3313621050382702E+00 0.3461306582847914E+00 0.3611923366625136E+00 0.3765385383301647E+00\n 0.3921602544104397E+00 0.4080480888974157E+00 0.4241922789697600E+00 0.4405827156430124E+00 0.4572089646963136E+00\n 0.4740602878111100E+00 0.4911256638616449E+00 0.5083938102993529E+00 0.5258532045756759E+00 0.5434921055502246E+00\n 0.5612985748336912E+00 0.5792604980173683E+00 0.5973656057436424E+00 0.6156014945742982E+00 0.6339556476159732E+00\n 0.6524154548645443E+00 0.6709682332326954E+00 0.6896012462273114E+00 0.7083017232457365E+00 0.7270568784622643E+00\n 0.7458539292785299E+00 0.7646801143137046E+00 0.7835227109126022E+00 0.8023690521519213E+00 0.8212065433269309E+00\n 0.8400226779029110E+00 0.8588050529176166E+00 0.8775413838228915E+00 0.8962195187553934E+00 0.9148274522281129E+00\n 0.9333533382360560E+00 0.9517855027710543E+00 0.9701124557421923E+00 0.9883229022998167E+00 0.1006405753562465E+01\n 0.1024350136747383E+01 0.1042145404706545E+01 0.1059781144871260E+01 0.1077247187609600E+01 0.1094533614001869E+01\n 0.1111630763040373E+01 0.1128529238260637E+01 0.1145219913812065E+01 0.1161693939976847E+01 0.1177942748146633E+01\n 0.1193958055267189E+01 0.1209731867761823E+01 0.1225256484945006E+01 0.1240524501938026E+01 0.1255528812099049E+01\n 0.1270262608980346E+01 0.1284719387825761E+01 0.1298892946621899E+01 0.1312777386716678E+01 0.1326367113019209E+01\n 0.1339656833795096E+01 0.1352641560071424E+01 0.1365316604665792E+01 0.1377677580853886E+01 0.1389720400690019E+01\n 0.1401441272995214E+01 0.1412836701027270E+01 0.1423903479847286E+01 0.1434638693397013E+01 0.1445039711301291E+01\n 0.1455104185409776E+01 0.1464830046091919E+01 0.1474215498299109E+01 0.1483259017407622E+01 0.1491959344855860E+01\n 0.1500315483589179E+01 0.1508326693325296E+01 0.1515992485653126E+01 0.1523312618977543E+01 0.1530287093322397E+01\n 0.1536916145003750E+01 0.1543200241185077E+01 0.1549140074325868E+01 0.1554736556534737E+01 0.1559990813837915E+01\n 0.1564904180373601E+01 0.1569478192522416E+01 0.1573714582983838E+01 0.1577615274808202E+01 0.1581182375393509E+01\n 0.1584418170455991E+01 0.1587325117983052E+01 0.1589905842176854E+01 0.1592163127396545E+01 0.1594099912106772E+01\n 0.1595719282839819E+01 0.1597024468178396E+01 0.1598018832765788E+01 0.1598705871349761E+01 0.1599089202866354E+01\n 0.1599172564569312E+01 0.1598959806210704E+01 0.1598454884277914E+01 0.1597661856291940E+01 0.1596584875171653E+01\n 0.1595228183668366E+01 0.1593596108874842E+01 0.1591693056812536E+01 0.1589523507100701E+01 0.1587092007710641E+01\n 0.1584403169808198E+01 0.1581461662687349E+01 0.1578272208797470E+01 0.1574839578866685E+01 0.1571168587123450E+01\n 0.1567264086618331E+01 0.1563130964647693E+01 0.1558774138280876E+01 0.1554198549992189E+01 0.1549409163398889E+01\n 0.1544410959106127E+01 0.1539208930659677E+01 0.1533808080607080E+01 0.1528213416667707E+01 0.1522429948012042E+01\n 0.1516462681650386E+01 0.1510316618931021E+01 0.1503996752147732E+01 0.1497508061256460E+01 0.1490855510700755E+01\n 0.1484044046345540E+01 0.1477078592518635E+01 0.1469964049159342E+01 0.1462705289073315E+01 0.1455307155292826E+01\n 0.1447774458541496E+01 0.1440111974802394E+01 0.1432324442988392E+01 0.1424416562713602E+01 0.1416392992164560E+01\n 0.1408258346069873E+01 0.1400017193766902E+01 0.1391674057364033E+01 0.1383233409997026E+01 0.1374699674177898E+01\n 0.1366077220234727E+01 0.1357370364840755E+01 0.1348583369631108E+01 0.1339720439905439E+01 0.1330785723414737E+01\n 0.1321783309230582E+01 0.1312717226695031E+01 0.1303591444449351E+01 0.1294409869539786E+01 0.1285176346598528E+01\n 0.1275894657098056E+01 0.1266568518676988E+01 0.1257201584535619E+01 0.1247797442899263E+01 0.1238359616547584E+01\n 0.1228891562408019E+01 0.1219396671211496E+01 0.1209878267208578E+01 0.1200339607944202E+01 0.1190783884089205E+01\n 0.1181214219326823E+01 0.1171633670292365E+01 0.1162045226564264E+01 0.1152451810704780E+01 0.1142856278348570E+01\n 0.1133261418337408E+01 0.1123669952899346E+01 0.1114084537870646E+01 0.1104507762958775E+01 0.1094942152044870E+01\n 0.1085390163524009E+01 0.1075854190681740E+01 0.1066336562105254E+01 0.1056839542127690E+01 0.1047365331304049E+01\n 0.1037916066917227E+01 0.1028493823512701E+01 0.1019100613460447E+01 0.1009738387542688E+01 0.1000409035566070E+01\n 0.9911143869969610E+00 0.9818562116185301E+00 0.9726362202083267E+00 0.9634560652350970E+00 0.9543173415736288E+00\n 0.9452215872364120E+00 0.9361702841209427E+00 0.9271648587715566E+00 0.9182066831546644E+00 0.9092970754463097E+00\n 0.9004373008310244E+00 0.8916285723109384E+00 0.8828720515241635E+00 0.8741688495714935E+00 0.8655200278504954E+00\n 0.8569265988960664E+00 0.8483895272266132E+00 0.8399097301949807E+00 0.8314880788433289E+00 0.8231253987611650E+00\n 0.8148224709457564E+00 0.8065800326641964E+00 0.7983987783164219E+00 0.7902793602984723E+00 0.7822223898653531E+00\n 0.7742284379928720E+00 0.7662980362378170E+00 0.7584316775959118E+00 0.7506298173569868E+00 0.7428928739568187E+00\n 0.7352212298251275E+00 0.7276152322292518E+00 0.7200751941130188E+00 0.7126013949303633E+00 0.7051940814732806E+00\n 0.6978534686936988E+00 0.6905797405188852E+00 0.6833730506600221E+00 0.6762335234136188E+00 0.6691612544554096E+00\n 0.6621563116264519E+00 0.6552187357111161E+00 0.6483485412067125E+00 0.6415457170844840E+00 0.6348102275417313E+00\n 0.6281420127448483E+00 0.6215409895630656E+00 0.6150070522926947E+00 0.6085400733717113E+00 0.6021399040845107E+00\n 0.5958063752566826E+00 0.5895392979396676E+00 0.5833384640851877E+00 0.5772036472093250E+00 0.5711346030461549E+00\n 0.5651310701908592E+00 0.5591927707322315E+00 0.5533194108745153E+00 0.5475106815485299E+00 0.5417662590120353E+00\n 0.5360858054393003E+00 0.5304689694998603E+00 0.5249153869264497E+00 0.5194246810720941E+00 0.5139964634563777E+00\n 0.5086303343008993E+00 0.5033258830539155E+00 0.4980826889042317E+00 0.4929003212843441E+00 0.4877783403628898E+00\n 0.4827162975264554E+00 0.4777137358507827E+00 0.4727701905614446E+00 0.4678851894840552E+00 0.4630582534840750E+00\n 0.4582888968962981E+00 0.4535766279440972E+00 0.4489209491485098E+00 0.4443213577272558E+00 0.4397773459837845E+00\n 0.4352884016864413E+00 0.4308540084378585E+00 0.4264736460346724E+00 0.4221467908176804E+00 0.4178729160125361E+00\n 0.4136514920611062E+00 0.4094819869436024E+00 0.4053638664915989E+00 0.4012965946920645E+00 0.3972796339825281E+00\n 0.3933124455374964E+00 0.3893944895462572E+00 0.3855252254821869E+00 0.3817041123636960E+00 0.3779306090069412E+00\n 0.3742041742704262E+00 0.3705242672916375E+00 0.3668903477158274E+00 0.3633018759170965E+00 0.3597583132118892E+00\n 0.3562591220650529E+00 0.3528037662885790E+00 0.3493917112331675E+00 0.3460224239727477E+00 0.3426953734820877E+00\n 0.3394100308076194E+00 0.3361658692316251E+00 0.3329623644299036E+00 0.3297989946230563E+00 0.3266752407215223E+00\n 0.3235905864644950E+00 0.3205445185528428E+00 0.3175365267761750E+00 0.3145661041341699E+00 0.3116327469522978E+00\n 0.3087359549920661E+00 0.3058752315559112E+00 0.3030500835868565E+00 0.3002600217630693E+00 0.2975045605874296E+00\n 0.2947832184722352E+00 0.2920955178191660E+00 0.2894409850946181E+00 0.2868191509005325E+00 0.2842295500408273E+00\n 0.2816717215835535E+00 0.2791452089188812E+00 0.2766495598130334E+00 0.2741843264582723E+00 0.2717490655190478E+00\n 0.2693433381744174E+00 0.2669667101568407E+00 0.2646187517874495E+00 0.2622990380079024E+00 0.2600071484089175E+00\n 0.2577426672555859E+00 0.2555051835095635E+00 0.2532942908482358E+00 0.2511095876809479E+00 0.2489506771623981E+00\n 0.2468171672032794E+00 0.2447086704782614E+00 0.2426248044314016E+00 0.2405651912790701E+00 0.2385294580104723E+00\n 0.2365172363858518E+00 0.2345281629324596E+00 0.2325618789383613E+00 0.2306180304441682E+00 0.2286962682327625E+00\n 0.2267962478170977E+00 0.2249176294261405E+00 0.2230600779890333E+00 0.2212232631175415E+00 0.2194068590868594E+00\n 0.2176105448148379E+00 0.2158340038397009E+00 0.2140769242963177E+00 0.2123389988910903E+00 0.2106199248755169E+00\n 0.2089194040184958E+00 0.2072371425774233E+00 0.2055728512681448E+00 0.2039262452338156E+00 0.2022970440127238E+00\n 0.2006849715051299E+00 0.1990897559391716E+00 0.1975111298358903E+00 0.1959488299734197E+00 0.1944025973503926E+00\n 0.1928721771486053E+00 0.1913573186949898E+00 0.1898577754229339E+00 0.1883733048329959E+00 0.1869036684530497E+00\n 0.1854486317979078E+00 0.1840079643284546E+00 0.1825814394103312E+00 0.1811688342722097E+00 0.1797699299636905E+00\n 0.1783845113128567E+00 0.1770123668835237E+00 0.1756532889322104E+00 0.1743070733648679E+00 0.1729735196933954E+00\n 0.1716524309919727E+00 0.1703436138532354E+00 0.1690468783443259E+00 0.1677620379628421E+00 0.1664889095927099E+00\n 0.1652273134600088E+00 0.1639770730887696E+00 0.1627380152567701E+00 0.1615099699513493E+00 0.1602927703252654E+00\n 0.1590862526526123E+00 0.1578902562848216E+00 0.1567046236067624E+00 0.1555291999929633E+00 0.1543638337639696E+00\n 0.1532083761428563E+00 0.1520626812119101E+00 0.1509266058694993E+00 0.1498000097871428E+00 0.1486827553667961E+00\n 0.1475747076983654E+00 0.1464757345174640E+00 0.1453857061634240E+00 0.1443044955375730E+00 0.1432319780617891E+00\n 0.1421680316373446E+00 0.1411125366040483E+00 0.1400653756996955E+00 0.1390264340198362E+00 0.1379955989778688E+00\n 0.1369727602654673E+00 0.1359578098133525E+00 0.1349506417524104E+00 0.1339511523751675E+00 0.1329592400976282E+00\n 0.1319748054214808E+00 0.1309977508966756E+00 0.1300279810843844E+00 0.1290654025203415E+00 0.1281099236785748E+00\n 0.1271614549355259E+00 0.1262199085345698E+00 0.1252851985509296E+00 0.1243572408569959E+00 0.1234359530880505E+00\n 0.1225212546083961E+00 0.1216130664778956E+00 0.1207113114189237E+00 0.1198159137837281E+00 0.1189267995222068E+00\n 0.1180438961500998E+00 0.1171671327175942E+00 0.1162964397783483E+00 0.1154317493589289E+00 0.1145729949286663E+00\n 0.1137201113699259E+00 0.1128730349487938E+00 0.1120317032861783E+00 0.1111960553293266E+00 0.1103660313237529E+00\n 0.1095415727855802E+00 0.1087226224742927E+00 0.1079091243658972E+00 0.1071010236264925E+00 0.1062982665862460E+00\n 0.1055008007137718E+00 0.1047085745909144E+00 0.1039215378879289E+00 0.1031396413390617E+00 0.1023628367185243E+00\n 0.1015910768168619E+00 0.1008243154177097E+00 0.1000625072749386E+00 0.9930560809018427E-01 0.9855357449075822E-01\n 0.9780636400793745E-01 0.9706393505562982E-01 0.9632624690941162E-01 0.9559325968593356E-01 0.9486493432269383E-01\n 0.9414123255817297E-01 0.9342211691232764E-01 0.9270755066744044E-01 0.9199749784932158E-01 0.9129192320885827E-01\n 0.9059079220391024E-01 0.8989407098154546E-01 0.8920172636061409E-01 0.8851372581465511E-01 0.8783003745513447E-01\n 0.8715063001500779E-01 0.8647547283260665E-01 0.8580453583584287E-01 0.8513778952672810E-01 0.8447520496620298E-01\n 0.8381675375927530E-01 0.8316240804045885E-01 0.8251214045951316E-01 0.8186592416747822E-01 0.8122373280299988E-01\n 0.8058554047894315E-01 0.7995132176928955E-01 0.7932105169631275E-01 0.7869470571803144E-01 0.7807225971593283E-01\n 0.7745368998296467E-01 0.7683897321179178E-01 0.7622808648331135E-01 0.7562100725542614E-01 0.7501771335206921E-01\n 0.7441818295247755E-01 0.7382239458071076E-01 0.7323032709541087E-01 0.7264195967979867E-01 0.7205727183190487E-01\n 0.7147624335502985E-01 0.7089885434843042E-01 0.7032508519822850E-01 0.6975491656853922E-01 0.6918832939281314E-01\n 0.6862530486539103E-01 0.6806582443326617E-01 0.6750986978805110E-01 0.6695742285814540E-01 0.6640846580110123E-01\n 0.6586298099618196E-01 0.6532095103711212E-01 0.6478235872501446E-01 0.6424718706153042E-01 0.6371541924212147E-01\n 0.6318703864954746E-01 0.6266202884751911E-01 0.6214037357452046E-01 0.6162205673779986E-01 0.6110706240752450E-01\n 0.6059537481109686E-01 0.6008697832762830E-01 0.5958185748256901E-01 0.5907999694248869E-01 0.5858138151000727E-01\n 0.5808599611887154E-01 0.5759382582917469E-01 0.5710485582271634E-01 0.5661907139850073E-01 0.5613645796836825E-01\n 0.5565700105276017E-01 0.5518068627661225E-01 0.5470749936537444E-01 0.5423742614115482E-01 0.5377045251898517E-01\n 0.5330656450320408E-01 0.5284574818395761E-01 0.5238798973381230E-01 0.5193327540447994E-01 0.5148159152365149E-01\n 0.5103292449193595E-01 0.5058726077990446E-01 0.5014458692523559E-01 0.4970488952995948E-01 0.4926815525779950E-01\n 0.4883437083160901E-01 0.4840352303089959E-01 0.4797559868946120E-01 0.4755058469306943E-01 0.4712846797727979E-01\n 0.4670923552530574E-01 0.4629287436597942E-01 0.4587937157179187E-01 0.4546871425701189E-01 0.4506088957588125E-01\n 0.4465588472088415E-01 0.4425368692108926E-01 0.4385428344056262E-01 0.4345766157684944E-01 0.4306380865952269E-01\n 0.4267271204879778E-01 0.4228435913421057E-01 0.4189873733335742E-01 0.4151583409069603E-01 0.4113563687640473E-01\n 0.4075813318529899E-01 0.4038331053580396E-01 0.4001115646898086E-01 0.3964165854760631E-01 0.3927480435530239E-01\n 0.3891058149571723E-01 0.3854897759175296E-01 0.3818998028484157E-01 0.3783357723426573E-01 0.3747975611652434E-01\n 0.3712850462474054E-01 0.3677981046811218E-01 0.3643366137140177E-01 0.3609004507446641E-01 0.3574894933182556E-01\n 0.3541036191226535E-01 0.3507427059847887E-01 0.3474066318674111E-01 0.3440952748661676E-01 0.3408085132070126E-01\n 0.3375462252439219E-01 0.3343082894569176E-01 0.3310945844503797E-01 0.3279049889516447E-01 0.3247393818098731E-01\n 0.3215976419951815E-01 0.3184796485980308E-01 0.3153852808288556E-01 0.3123144180179359E-01 0.3092669396154863E-01\n 0.3062427251919747E-01 0.3032416544386438E-01 0.3002636071682391E-01 0.2973084633159302E-01 0.2943761029404197E-01\n 0.2914664062252300E-01 0.2885792534801624E-01 0.2857145251429220E-01 0.2828721017808998E-01 0.2800518640931039E-01\n 0.2772536929122391E-01 0.2744774692069189E-01 0.2717230740840119E-01 0.2689903887911129E-01 0.2662792947191326E-01\n 0.2635896734050006E-01 0.2609214065344760E-01 0.2582743759450599E-01 0.2556484636290022E-01 0.2530435517364029E-01\n 0.2504595225783962E-01 0.2478962586304191E-01 0.2453536425355501E-01 0.2428315571079263E-01 0.2403298853362201E-01\n 0.2378485103871834E-01 0.2353873156092471E-01 0.2329461845361733E-01 0.2305250008907579E-01 0.2281236485885801E-01\n 0.2257420117417889E-01 0.2233799746629312E-01 0.2210374218688127E-01 0.2187142380843883E-01 0.2164103082466791E-01\n 0.2141255175087165E-01 0.2118597512435002E-01 0.2096128950479806E-01 0.2073848347470486E-01 0.2051754563975416E-01\n 0.2029846462922549E-01 0.2008122909639606E-01 0.1986582771894261E-01 0.1965224919934375E-01 0.1944048226528158E-01\n 0.1923051567004319E-01 0.1902233819292149E-01 0.1881593863961467E-01 0.1861130584262509E-01 0.1840842866165638E-01\n 0.1820729598400922E-01 0.1800789672497538E-01 0.1781021982822961E-01 0.1761425426621972E-01 0.1741998904055397E-01\n 0.1722741318238660E-01 0.1703651575280017E-01 0.1684728584318532E-01 0.1665971257561794E-01 0.1647378510323276E-01\n 0.1628949261059417E-01 0.1610682431406360E-01 0.1592576946216329E-01 0.1574631733593689E-01 0.1556845724930608E-01\n 0.1539217854942354E-01 0.1521747061702217E-01 0.1504432286676001E-01 0.1487272474756165E-01 0.1470266574295493E-01\n 0.1453413537140393E-01 0.1436712318663735E-01 0.1420161877797267E-01 0.1403761177063589E-01 0.1387509182607664E-01\n 0.1371404864227910E-01 0.1355447195406791E-01 0.1339635153340976E-01 0.1323967718971016E-01 0.1308443877010535E-01\n 0.1293062615974990E-01 0.1277822928209887E-01 0.1262723809918580E-01 0.1247764261189538E-01 0.1232943286023138E-01\n 0.1218259892357987E-01 0.1203713092096717E-01 0.1189301901131328E-01 0.1175025339368011E-01 0.1160882430751480E-01\n 0.1146872203288826E-01 0.1132993689072848E-01 0.1119245924304928E-01 0.1105627949317382E-01 0.1092138808595317E-01\n 0.1078777550798031E-01 0.1065543228779879E-01 0.1052434899610681E-01 0.1039451624595617E-01 0.1026592469294671E-01\n 0.1013856503541558E-01 0.1001242801462182E-01 0.9887504414926333E-02 0.9763785063966725E-02 0.9641260832827890E-02\n 0.9519922636207538E-02 0.9399761432577210E-02 0.9280768224338752E-02 0.9162934057976000E-02 0.9046250024202221E-02\n 0.8930707258102832E-02 0.8816296939273676E-02 0.8703010291955119E-02 0.8590838585161509E-02 0.8479773132806546E-02\n 0.8369805293824308E-02 0.8260926472285997E-02 0.8153128117512804E-02 0.8046401724184376E-02 0.7940738832443478E-02\n 0.7836131027996606E-02 0.7732569942210602E-02 0.7630047252205678E-02 0.7528554680944333E-02 0.7428083997316856E-02\n 0.7328627016223001E-02 0.7230175598650108E-02 0.7132721651747814E-02 0.7036257128899153E-02 0.6940774029788536E-02\n 0.6846264400466227E-02 0.6752720333409701E-02 0.6660133967581916E-02 0.6568497488486375E-02 0.6477803128219479E-02\n 0.6388043165519663E-02 0.6299209925814047E-02 0.6211295781262146E-02 0.6124293150797016E-02 0.6038194500163917E-02\n 0.5952992341956366E-02 0.5868679235650055E-02 0.5785247787634298E-02 0.5702690651241371E-02 0.5621000526773856E-02\n 0.5540170161529816E-02 0.5460192349826328E-02 0.5381059933021076E-02 0.5302765799532243E-02 0.5225302884857029E-02\n 0.5148664171588471E-02 0.5072842689431090E-02 0.4997831515215207E-02 0.4923623772910095E-02 0.4850212633636272E-02\n 0.4777591315676702E-02 0.4705753084487369E-02 0.4634691252707118E-02 0.4564399180166933E-02 0.4494870273898941E-02\n 0.4426097988144961E-02 0.4358075824365064E-02 0.4290797331245945E-02 0.4224256104709619E-02 0.4158445787922197E-02\n 0.4093360071303100E-02 0.4028992692534918E-02 0.3965337436573796E-02 0.3902388135660784E-02 0.3840138669334105E-02\n 0.3778582964442547E-02 0.3717714995160261E-02 0.3657528783002880E-02 0.3598018396845369E-02 0.3539177952941635E-02\n 0.3481001614946027E-02 0.3423483593937147E-02 0.3366618148443765E-02 0.3310399584473416E-02 0.3254822255543565E-02\n 0.3199880562715664E-02 0.3145568954632342E-02 0.3091881927557716E-02 0.3038814025421337E-02 0.2986359839865667E-02\n 0.2934514010297470E-02 0.2883271223943334E-02 0.2832626215909399E-02 0.2782573769245732E-02 0.2733108715015361E-02\n 0.2684225932368273E-02 0.2635920348620736E-02 0.2588186939339922E-02 0.2541020728434335E-02 0.2494416788250113E-02\n 0.2448370239673485E-02 0.2402876252239763E-02 0.2357930044248895E-02 0.2313526882888074E-02 0.2269662084361452E-02\n 0.2226331014027437E-02 0.2183529086543647E-02 0.2141251766019886E-02 0.2099494566179429E-02 0.2058253050528833E-02\n 0.2017522832536582E-02 0.1977299575820819E-02 0.1937578994346416E-02 0.1898356852631761E-02 0.1859628965965341E-02\n 0.1821391200632576E-02 0.1783639474153031E-02 0.1746369755528287E-02 0.1709578065500809E-02 0.1673260476823867E-02\n 0.1637413114542927E-02 0.1602032156288575E-02 0.1567113832581223E-02 0.1532654427147850E-02 0.1498650277250755E-02\n 0.1465097774028671E-02 0.1431993362850165E-02 0.1399333543679485E-02 0.1367114871454921E-02 0.1335333956479567E-02\n 0.1303987464824598E-02 0.1273072118744786E-02 0.1242584697106271E-02 0.1212522035826240E-02 0.1182881028324278E-02\n 0.1153658625985074E-02 0.1124851838631879E-02 0.1096457735010339E-02 0.1068473443281882E-02 0.1040896151525936E-02\n 0.1013723108250083E-02 0.9869516229069582E-03 0.9605790664167954E-03 0.9346028716940452E-03 0.9090205341765010E-03\n 0.8838296123550832E-03 0.8590277283020786E-03 0.8346125681955534E-03 0.8105818828371373E-03 0.7869334881601800E-03\n 0.7636652657249203E-03 0.7407751631967363E-03 0.7182611948033279E-03 0.6961214417659799E-03 0.6743540526996259E-03\n 0.6529572439758464E-03 0.6319293000421489E-03 0.6112685736903467E-03 0.5909734862658870E-03 0.5710425278092155E-03\n 0.5514742571193334E-03 0.5322673017285347E-03 0.5134203577763651E-03 0.4949321897694443E-03 0.4768016302125221E-03\n 0.4590275790946831E-03 0.4416090032129194E-03 0.4245449353136761E-03 0.4078344730309316E-03 0.3914767775974666E-03\n 0.3754710723036193E-03 0.3598166406754878E-03 0.3445128243419585E-03 0.3295590205570407E-03 0.3149546793411112E-03\n 0.3006993002013562E-03 0.2867924283882840E-03 0.2732336506415988E-03 0.2600225903747107E-03 0.2471589022432513E-03\n 0.2346422660385661E-03 0.2224723798427698E-03 0.2106489523774314E-03 0.1991716944731751E-03 0.1880403095829506E-03\n 0.1772544832569928E-03 0.1668138714930798E-03 0.1567180878715900E-03 0.1469666893810824E-03 0.1375591608372710E-03\n 0.1284948977961454E-03 0.1197731878613226E-03 0.1113931902866863E-03 0.1033539137784803E-03 0.9565419240704367E-04\n 0.8829265954769630E-04 0.8126771978413778E-04 0.7457751872672617E-04 0.6821991072362678E-04 0.6219242447627770E-04\n 0.5649222661344906E-04 0.5111608333233986E-04 0.4606032028242377E-04 0.4132078095054316E-04 0.3689278390632745E-04\n 0.3277107938782920E-04 0.2894980585093507E-04 0.2542244727468145E-04 0.2218179221009314E-04 0.1921989578338595E-04\n 0.1652804611495441E-04 0.1409673689099332E-04 0.1191564811913617E-04 0.9973637403230573E-05 0.8258744369264157E-05\n 0.6758211140689631E-05 0.5458521963065276E-05 0.4345465168603044E-05 0.3404220589992921E-05 0.2619475202729796E-05\n 0.1975569103509067E-05 0.1456672814492850E-05 0.1046995232007964E-05 0.7310192213004316E-06 0.4937588492987344E-06\n 0.3210285891032542E-06 0.1997107219284094E-06 0.1180030350752796E-06 0.6562550627018659E-07 0.3396305969110393E-07\n 0.1612304561662313E-07 0.6892228656363058E-08 0.2589636663001748E-08 0.8280887390551865E-09 0.2156614040605737E-09\n 0.4301139703498805E-10 0.6010118005039632E-11 0.5149083260942099E-12 0.2193180426472887E-13 0.3274661750280784E-15\n 0.9138109562588437E-18 0.1354704193168576E-21 0.5668023630192864E-28 0.1003507143230543E-40 0.5696705688614969E-79\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.2350503764662797E-10 0.1452741565148498E-08 0.1598024605657181E-07 0.8670887247915710E-07\n 0.3194268290355064E-06 0.9210999532108705E-06 0.2243032243257230E-05 0.4826533736759059E-05 0.9449280963997414E-05\n 0.1717086310497067E-04 0.2937628005930804E-04 0.4781640004850213E-04 0.7464459701436190E-04 0.1124489746320072E-03\n 0.1642797466831127E-03 0.2336714851009560E-03 0.3246600692852489E-03 0.4417942752036344E-03 0.5901420321021944E-03\n 0.7752914499470295E-03 0.1003346783485080E-02 0.1280919550391384E-02 0.1615115062592291E-02 0.2013514662642524E-02\n 0.2484153982012019E-02 0.3035497556237696E-02 0.3676410143962806E-02 0.4416125103690986E-02 0.5264210184320288E-02\n 0.6230531083824742E-02 0.7325213125386473E-02 0.8558601392363368E-02 0.9941219653166928E-02 0.1148372839483666E-01\n 0.1319688227020127E-01 0.1509148724834461E-01 0.1717835774193908E-01 0.1946827396813322E-01 0.2197193978231332E-01\n 0.2469994120640449E-01 0.2766270585561205E-01 0.3087046344978465E-01 0.3433320757803945E-01 0.3806065886804223E-01\n 0.4206222969448004E-01 0.4634699054488188E-01 0.5092363814510472E-01 0.5580046543156136E-01 0.6098533344267084E-01\n 0.6648564518809444E-01 0.7230832154110638E-01 0.7845977918695805E-01 0.8494591064833676E-01 0.9177206639800155E-01\n 0.9894303905839608E-01 0.1064630496784886E+00 0.1143357360692630E+00 0.1225641431711653E+00 0.1311507154193881E+00\n 0.1400972910661206E+00 0.1494050984128002E+00 0.1590747538999337E+00 0.1691062619971989E+00 0.1794990168322592E+00\n 0.1902518054930074E+00 0.2013628129347618E+00 0.2128296284212524E+00 0.2246492534260200E+00 0.2368181109190946E+00\n 0.2493320559624748E+00 0.2621863875369867E+00 0.2753758615225286E+00 0.2888947047534727E+00 0.3027366300710904E+00\n 0.3168948522952475E+00 0.3313621050382702E+00 0.3461306582847914E+00 0.3611923366625136E+00 0.3765385383301647E+00\n 0.3921602544104397E+00 0.4080480888974157E+00 0.4241922789697600E+00 0.4405827156430124E+00 0.4572089646963136E+00\n 0.4740602878111100E+00 0.4911256638616449E+00 0.5083938102993529E+00 0.5258532045756759E+00 0.5434921055502246E+00\n 0.5612985748336912E+00 0.5792604980173683E+00 0.5973656057436424E+00 0.6156014945742982E+00 0.6339556476159732E+00\n 0.6524154548645443E+00 0.6709682332326954E+00 0.6896012462273114E+00 0.7083017232457365E+00 0.7270568784622643E+00\n 0.7458539292785299E+00 0.7646801143137046E+00 0.7835227109126022E+00 0.8023690521519213E+00 0.8212065433269309E+00\n 0.8400226779029110E+00 0.8588050529176166E+00 0.8775413838228915E+00 0.8962195187553934E+00 0.9148274522281129E+00\n 0.9333533382360560E+00 0.9517855027710543E+00 0.9701124557421923E+00 0.9883229022998167E+00 0.1006405753562465E+01\n 0.1024350136747383E+01 0.1042145404706545E+01 0.1059781144871260E+01 0.1077247187609600E+01 0.1094533614001869E+01\n 0.1111630763040373E+01 0.1128529238260637E+01 0.1145219913812065E+01 0.1161693939976847E+01 0.1177942748146633E+01\n 0.1193958055267189E+01 0.1209731867761823E+01 0.1225256484945006E+01 0.1240524501938026E+01 0.1255528812099049E+01\n 0.1270262608980346E+01 0.1284719387825761E+01 0.1298892946621899E+01 0.1312777386716678E+01 0.1326367113019209E+01\n 0.1339656833795096E+01 0.1352641560071424E+01 0.1365316604665792E+01 0.1377677580853886E+01 0.1389720400690019E+01\n 0.1401441272995214E+01 0.1412836701027270E+01 0.1423903479847286E+01 0.1434638693397013E+01 0.1445039711301291E+01\n 0.1455104185409776E+01 0.1464830046091919E+01 0.1474215498299109E+01 0.1483259017407622E+01 0.1491959344855860E+01\n 0.1500315483589179E+01 0.1508326693325296E+01 0.1515992485653126E+01 0.1523312618977543E+01 0.1530287093322397E+01\n 0.1536916145003750E+01 0.1543200241185077E+01 0.1549140074325868E+01 0.1554736556534737E+01 0.1559990813837915E+01\n 0.1564904180373601E+01 0.1569478192522416E+01 0.1573714582983838E+01 0.1577615274808202E+01 0.1581182375393509E+01\n 0.1584418170455991E+01 0.1587325117983052E+01 0.1589905842176854E+01 0.1592163127396545E+01 0.1594099912106772E+01\n 0.1595719282839819E+01 0.1597024468178396E+01 0.1598018832765788E+01 0.1598705871349761E+01 0.1599089202866354E+01\n 0.1599172564569312E+01 0.1598959806210704E+01 0.1598454884277914E+01 0.1597661856291940E+01 0.1596584875171653E+01\n 0.1595228183668366E+01 0.1593596108874842E+01 0.1591693056812536E+01 0.1589523507100701E+01 0.1587092007710641E+01\n 0.1584403169808198E+01 0.1581461662687349E+01 0.1578272208797470E+01 0.1574839578866685E+01 0.1571168587123450E+01\n 0.1567264086618331E+01 0.1563130964647693E+01 0.1558774138280876E+01 0.1554198549992189E+01 0.1549409163398889E+01\n 0.1544410959106127E+01 0.1539208930659677E+01 0.1533808080607080E+01 0.1528213416667707E+01 0.1522429948012042E+01\n 0.1516462681650386E+01 0.1510316618931021E+01 0.1503996752147732E+01 0.1497508061256460E+01 0.1490855510700755E+01\n 0.1484044046345540E+01 0.1477078592518635E+01 0.1469964049159342E+01 0.1462705289073315E+01 0.1455307155292826E+01\n 0.1447774458541496E+01 0.1440111974802394E+01 0.1432324442988392E+01 0.1424416562713602E+01 0.1416392992164560E+01\n 0.1408258346069873E+01 0.1400017193766902E+01 0.1391674057364033E+01 0.1383233409997026E+01 0.1374699674177898E+01\n 0.1366077220234727E+01 0.1357370364840755E+01 0.1348583369631108E+01 0.1339720439905439E+01 0.1330785723414737E+01\n 0.1321783309230582E+01 0.1312717226695031E+01 0.1303591444449351E+01 0.1294409869539786E+01 0.1285176346598528E+01\n 0.1275894657098056E+01 0.1266568518676988E+01 0.1257201584535619E+01 0.1247797442899263E+01 0.1238359616547584E+01\n 0.1228891562408019E+01 0.1219396671211496E+01 0.1209878267208578E+01 0.1200339607944202E+01 0.1190783884089205E+01\n 0.1181214219326823E+01 0.1171633670292365E+01 0.1162045226564264E+01 0.1152451810704780E+01 0.1142856278348570E+01\n 0.1133261418337408E+01 0.1123669952899346E+01 0.1114084537870646E+01 0.1104507762958775E+01 0.1094942152044870E+01\n 0.1085390163524009E+01 0.1075854190681740E+01 0.1066336562105254E+01 0.1056839542127690E+01 0.1047365331304049E+01\n 0.1037916066917227E+01 0.1028493823512701E+01 0.1019100613460447E+01 0.1009738387542688E+01 0.1000409035566070E+01\n 0.9911143869969610E+00 0.9818562116185301E+00 0.9726362202083267E+00 0.9634560652350970E+00 0.9543173415736288E+00\n 0.9452215872364120E+00 0.9361702841209427E+00 0.9271648587715566E+00 0.9182066831546644E+00 0.9092970754463097E+00\n 0.9004373008310244E+00 0.8916285723109384E+00 0.8828720515241635E+00 0.8741688495714935E+00 0.8655200278504954E+00\n 0.8569265988960664E+00 0.8483895272266132E+00 0.8399097301949807E+00 0.8314880788433289E+00 0.8231253987611650E+00\n 0.8148224709457564E+00 0.8065800326641964E+00 0.7983987783164219E+00 0.7902793602984723E+00 0.7822223898653531E+00\n 0.7742284379928720E+00 0.7662980362378170E+00 0.7584316775959118E+00 0.7506298173569868E+00 0.7428928739568187E+00\n 0.7352212298251275E+00 0.7276152322292518E+00 0.7200751941130188E+00 0.7126013949303633E+00 0.7051940814732806E+00\n 0.6978534686936988E+00 0.6905797405188852E+00 0.6833730506600221E+00 0.6762335234136188E+00 0.6691612544554096E+00\n 0.6621563116264519E+00 0.6552187357111161E+00 0.6483485412067125E+00 0.6415457170844840E+00 0.6348102275417313E+00\n 0.6281420127448483E+00 0.6215409895630656E+00 0.6150070522926947E+00 0.6085400733717113E+00 0.6021399040845107E+00\n 0.5958063752566826E+00 0.5895392979396676E+00 0.5833384640851877E+00 0.5772036472093250E+00 0.5711346030461549E+00\n 0.5651310701908592E+00 0.5591927707322315E+00 0.5533194108745153E+00 0.5475106815485299E+00 0.5417662590120353E+00\n 0.5360858054393003E+00 0.5304689694998603E+00 0.5249153869264497E+00 0.5194246810720941E+00 0.5139964634563777E+00\n 0.5086303343008993E+00 0.5033258830539155E+00 0.4980826889042317E+00 0.4929003212843441E+00 0.4877783403628898E+00\n 0.4827162975264554E+00 0.4777137358507827E+00 0.4727701905614446E+00 0.4678851894840552E+00 0.4630582534840750E+00\n 0.4582888968962981E+00 0.4535766279440972E+00 0.4489209491485098E+00 0.4443213577272558E+00 0.4397773459837845E+00\n 0.4352884016864413E+00 0.4308540084378585E+00 0.4264736460346724E+00 0.4221467908176804E+00 0.4178729160125361E+00\n 0.4136514920611062E+00 0.4094819869436024E+00 0.4053638664915989E+00 0.4012965946920645E+00 0.3972796339825281E+00\n 0.3933124455374964E+00 0.3893944895462572E+00 0.3855252254821869E+00 0.3817041123636960E+00 0.3779306090069412E+00\n 0.3742041742704262E+00 0.3705242672916375E+00 0.3668903477158274E+00 0.3633018759170965E+00 0.3597583132118892E+00\n 0.3562591220650529E+00 0.3528037662885790E+00 0.3493917112331675E+00 0.3460224239727477E+00 0.3426953734820877E+00\n 0.3394100308076194E+00 0.3361658692316251E+00 0.3329623644299036E+00 0.3297989946230563E+00 0.3266752407215223E+00\n 0.3235905864644950E+00 0.3205445185528428E+00 0.3175365267761750E+00 0.3145661041341699E+00 0.3116327469522978E+00\n 0.3087359549920661E+00 0.3058752315559112E+00 0.3030500835868565E+00 0.3002600217630693E+00 0.2975045605874296E+00\n 0.2947832184722352E+00 0.2920955178191660E+00 0.2894409850946181E+00 0.2868191509005325E+00 0.2842295500408273E+00\n 0.2816717215835535E+00 0.2791452089188812E+00 0.2766495598130334E+00 0.2741843264582723E+00 0.2717490655190478E+00\n 0.2693433381744174E+00 0.2669667101568407E+00 0.2646187517874495E+00 0.2622990380079024E+00 0.2600071484089175E+00\n 0.2577426672555859E+00 0.2555051835095635E+00 0.2532942908482358E+00 0.2511095876809479E+00 0.2489506771623981E+00\n 0.2468171672032794E+00 0.2447086704782614E+00 0.2426248044314016E+00 0.2405651912790701E+00 0.2385294580104723E+00\n 0.2365172363858518E+00 0.2345281629324596E+00 0.2325618789383613E+00 0.2306180304441682E+00 0.2286962682327625E+00\n 0.2267962478170977E+00 0.2249176294261405E+00 0.2230600779890333E+00 0.2212232631175415E+00 0.2194068590868594E+00\n 0.2176105448148379E+00 0.2158340038397009E+00 0.2140769242963177E+00 0.2123389988910903E+00 0.2106199248755169E+00\n 0.2089194040184958E+00 0.2072371425774233E+00 0.2055728512681448E+00 0.2039262452338156E+00 0.2022970440127238E+00\n 0.2006849715051299E+00 0.1990897559391716E+00 0.1975111298358903E+00 0.1959488299734197E+00 0.1944025973503926E+00\n 0.1928721771486053E+00 0.1913573186949898E+00 0.1898577754229339E+00 0.1883733048329959E+00 0.1869036684530497E+00\n 0.1854486317979078E+00 0.1840079643284546E+00 0.1825814394103312E+00 0.1811688342722097E+00 0.1797699299636905E+00\n 0.1783845113128567E+00 0.1770123668835237E+00 0.1756532889322104E+00 0.1743070733648679E+00 0.1729735196933954E+00\n 0.1716524309919727E+00 0.1703436138532354E+00 0.1690468783443259E+00 0.1677620379628421E+00 0.1664889095927099E+00\n 0.1652273134600088E+00 0.1639770730887696E+00 0.1627380152567701E+00 0.1615099699513493E+00 0.1602927703252654E+00\n 0.1590862526526123E+00 0.1578902562848216E+00 0.1567046236067624E+00 0.1555291999929633E+00 0.1543638337639696E+00\n 0.1532083761428563E+00 0.1520626812119101E+00 0.1509266058694993E+00 0.1498000097871428E+00 0.1486827553667961E+00\n 0.1475747076983654E+00 0.1464757345174640E+00 0.1453857061634240E+00 0.1443044955375730E+00 0.1432319780617891E+00\n 0.1421680316373446E+00 0.1411125366040483E+00 0.1400653756996955E+00 0.1390264340198362E+00 0.1379955989778688E+00\n 0.1369727602654673E+00 0.1359578098133525E+00 0.1349506417524104E+00 0.1339511523751675E+00 0.1329592400976282E+00\n 0.1319748054214808E+00 0.1309977508966756E+00 0.1300279810843844E+00 0.1290654025203415E+00 0.1281099236785748E+00\n 0.1271614549355259E+00 0.1262199085345698E+00 0.1252851985509296E+00 0.1243572408569959E+00 0.1234359530880505E+00\n 0.1225212546083961E+00 0.1216130664778956E+00 0.1207113114189237E+00 0.1198159137837281E+00 0.1189267995222068E+00\n 0.1180438961500998E+00 0.1171671327175942E+00 0.1162964397783483E+00 0.1154317493589289E+00 0.1145729949286663E+00\n 0.1137201113699259E+00 0.1128730349487938E+00 0.1120317032861783E+00 0.1111960553293266E+00 0.1103660313237529E+00\n 0.1095415727855802E+00 0.1087226224742927E+00 0.1079091243658972E+00 0.1071010236264925E+00 0.1062982665862460E+00\n 0.1055008007137718E+00 0.1047085745909144E+00 0.1039215378879289E+00 0.1031396413390617E+00 0.1023628367185243E+00\n 0.1015910768168619E+00 0.1008243154177097E+00 0.1000625072749386E+00 0.9930560809018427E-01 0.9855357449075822E-01\n 0.9780636400793745E-01 0.9706393505562982E-01 0.9632624690941162E-01 0.9559325968593356E-01 0.9486493432269383E-01\n 0.9414123255817297E-01 0.9342211691232764E-01 0.9270755066744044E-01 0.9199749784932158E-01 0.9129192320885827E-01\n 0.9059079220391024E-01 0.8989407098154546E-01 0.8920172636061409E-01 0.8851372581465511E-01 0.8783003745513447E-01\n 0.8715063001500779E-01 0.8647547283260665E-01 0.8580453583584287E-01 0.8513778952672810E-01 0.8447520496620298E-01\n 0.8381675375927530E-01 0.8316240804045885E-01 0.8251214045951316E-01 0.8186592416747822E-01 0.8122373280299988E-01\n 0.8058554047894315E-01 0.7995132176928955E-01 0.7932105169631275E-01 0.7869470571803144E-01 0.7807225971593283E-01\n 0.7745368998296467E-01 0.7683897321179178E-01 0.7622808648331135E-01 0.7562100725542614E-01 0.7501771335206921E-01\n 0.7441818295247755E-01 0.7382239458071076E-01 0.7323032709541087E-01 0.7264195967979867E-01 0.7205727183190487E-01\n 0.7147624335502985E-01 0.7089885434843042E-01 0.7032508519822850E-01 0.6975491656853922E-01 0.6918832939281314E-01\n 0.6862530486539103E-01 0.6806582443326617E-01 0.6750986978805110E-01 0.6695742285814540E-01 0.6640846580110123E-01\n 0.6586298099618196E-01 0.6532095103711212E-01 0.6478235872501446E-01 0.6424718706153042E-01 0.6371541924212147E-01\n 0.6318703864954746E-01 0.6266202884751911E-01 0.6214037357452046E-01 0.6162205673779986E-01 0.6110706240752450E-01\n 0.6059537481109686E-01 0.6008697832762830E-01 0.5958185748256901E-01 0.5907999694248869E-01 0.5858138151000727E-01\n 0.5808599611887154E-01 0.5759382582917469E-01 0.5710485582271634E-01 0.5661907139850073E-01 0.5613645796836825E-01\n 0.5565700105276017E-01 0.5518068627661225E-01 0.5470749936537444E-01 0.5423742614115482E-01 0.5377045251898517E-01\n 0.5330656450320408E-01 0.5284574818395761E-01 0.5238798973381230E-01 0.5193327540447994E-01 0.5148159152365149E-01\n 0.5103292449193595E-01 0.5058726077990446E-01 0.5014458692523559E-01 0.4970488952995948E-01 0.4926815525779950E-01\n 0.4883437083160901E-01 0.4840352303089959E-01 0.4797559868946120E-01 0.4755058469306943E-01 0.4712846797727979E-01\n 0.4670923552530574E-01 0.4629287436597942E-01 0.4587937157179187E-01 0.4546871425701189E-01 0.4506088957588125E-01\n 0.4465588472088415E-01 0.4425368692108926E-01 0.4385428344056262E-01 0.4345766157684944E-01 0.4306380865952269E-01\n 0.4267271204879778E-01 0.4228435913421057E-01 0.4189873733335742E-01 0.4151583409069603E-01 0.4113563687640473E-01\n 0.4075813318529899E-01 0.4038331053580396E-01 0.4001115646898086E-01 0.3964165854760631E-01 0.3927480435530239E-01\n 0.3891058149571723E-01 0.3854897759175296E-01 0.3818998028484157E-01 0.3783357723426573E-01 0.3747975611652434E-01\n 0.3712850462474054E-01 0.3677981046811218E-01 0.3643366137140177E-01 0.3609004507446641E-01 0.3574894933182556E-01\n 0.3541036191226535E-01 0.3507427059847887E-01 0.3474066318674111E-01 0.3440952748661676E-01 0.3408085132070126E-01\n 0.3375462252439219E-01 0.3343082894569176E-01 0.3310945844503797E-01 0.3279049889516447E-01 0.3247393818098731E-01\n 0.3215976419951815E-01 0.3184796485980308E-01 0.3153852808288556E-01 0.3123144180179359E-01 0.3092669396154863E-01\n 0.3062427251919747E-01 0.3032416544386438E-01 0.3002636071682391E-01 0.2973084633159302E-01 0.2943761029404197E-01\n 0.2914664062252300E-01 0.2885792534801624E-01 0.2857145251429220E-01 0.2828721017808998E-01 0.2800518640931039E-01\n 0.2772536929122391E-01 0.2744774692069189E-01 0.2717230740840119E-01 0.2689903887911129E-01 0.2662792947191326E-01\n 0.2635896734050006E-01 0.2609214065344760E-01 0.2582743759450599E-01 0.2556484636290022E-01 0.2530435517364029E-01\n 0.2504595225783962E-01 0.2478962586304191E-01 0.2453536425355501E-01 0.2428315571079263E-01 0.2403298853362201E-01\n 0.2378485103871834E-01 0.2353873156092471E-01 0.2329461845361733E-01 0.2305250008907579E-01 0.2281236485885801E-01\n 0.2257420117417889E-01 0.2233799746629312E-01 0.2210374218688127E-01 0.2187142380843883E-01 0.2164103082466791E-01\n 0.2141255175087165E-01 0.2118597512435002E-01 0.2096128950479806E-01 0.2073848347470486E-01 0.2051754563975416E-01\n 0.2029846462922549E-01 0.2008122909639606E-01 0.1986582771894261E-01 0.1965224919934375E-01 0.1944048226528158E-01\n 0.1923051567004319E-01 0.1902233819292149E-01 0.1881593863961467E-01 0.1861130584262509E-01 0.1840842866165638E-01\n 0.1820729598400922E-01 0.1800789672497538E-01 0.1781021982822961E-01 0.1761425426621972E-01 0.1741998904055397E-01\n 0.1722741318238660E-01 0.1703651575280017E-01 0.1684728584318532E-01 0.1665971257561794E-01 0.1647378510323276E-01\n 0.1628949261059417E-01 0.1610682431406360E-01 0.1592576946216329E-01 0.1574631733593689E-01 0.1556845724930608E-01\n 0.1539217854942354E-01 0.1521747061702217E-01 0.1504432286676001E-01 0.1487272474756165E-01 0.1470266574295493E-01\n 0.1453413537140393E-01 0.1436712318663735E-01 0.1420161877797267E-01 0.1403761177063589E-01 0.1387509182607664E-01\n 0.1371404864227910E-01 0.1355447195406791E-01 0.1339635153340976E-01 0.1323967718971016E-01 0.1308443877010535E-01\n 0.1293062615974990E-01 0.1277822928209887E-01 0.1262723809918580E-01 0.1247764261189538E-01 0.1232943286023138E-01\n 0.1218259892357987E-01 0.1203713092096717E-01 0.1189301901131328E-01 0.1175025339368011E-01 0.1160882430751480E-01\n 0.1146872203288826E-01 0.1132993689072848E-01 0.1119245924304928E-01 0.1105627949317382E-01 0.1092138808595317E-01\n 0.1078777550798031E-01 0.1065543228779879E-01 0.1052434899610681E-01 0.1039451624595617E-01 0.1026592469294671E-01\n 0.1013856503541558E-01 0.1001242801462182E-01 0.9887504414926333E-02 0.9763785063966725E-02 0.9641260832827890E-02\n 0.9519922636207538E-02 0.9399761432577210E-02 0.9280768224338752E-02 0.9162934057976000E-02 0.9046250024202221E-02\n 0.8930707258102832E-02 0.8816296939273676E-02 0.8703010291955119E-02 0.8590838585161509E-02 0.8479773132806546E-02\n 0.8369805293824308E-02 0.8260926472285997E-02 0.8153128117512804E-02 0.8046401724184376E-02 0.7940738832443478E-02\n 0.7836131027996606E-02 0.7732569942210602E-02 0.7630047252205678E-02 0.7528554680944333E-02 0.7428083997316856E-02\n 0.7328627016223001E-02 0.7230175598650108E-02 0.7132721651747814E-02 0.7036257128899153E-02 0.6940774029788536E-02\n 0.6846264400466227E-02 0.6752720333409701E-02 0.6660133967581916E-02 0.6568497488486375E-02 0.6477803128219479E-02\n 0.6388043165519663E-02 0.6299209925814047E-02 0.6211295781262146E-02 0.6124293150797016E-02 0.6038194500163917E-02\n 0.5952992341956366E-02 0.5868679235650055E-02 0.5785247787634298E-02 0.5702690651241371E-02 0.5621000526773856E-02\n 0.5540170161529816E-02 0.5460192349826328E-02 0.5381059933021076E-02 0.5302765799532243E-02 0.5225302884857029E-02\n 0.5148664171588471E-02 0.5072842689431090E-02 0.4997831515215207E-02 0.4923623772910095E-02 0.4850212633636272E-02\n 0.4777591315676702E-02 0.4705753084487369E-02 0.4634691252707118E-02 0.4564399180166933E-02 0.4494870273898941E-02\n 0.4426097988144961E-02 0.4358075824365064E-02 0.4290797331245945E-02 0.4224256104709619E-02 0.4158445787922197E-02\n 0.4093360071303100E-02 0.4028992692534918E-02 0.3965337436573796E-02 0.3902388135660784E-02 0.3840138669334105E-02\n 0.3778582964442547E-02 0.3717714995160261E-02 0.3657528783002880E-02 0.3598018396845369E-02 0.3539177952941635E-02\n 0.3481001614946027E-02 0.3423483593937147E-02 0.3366618148443765E-02 0.3310399584473416E-02 0.3254822255543565E-02\n 0.3199880562715664E-02 0.3145568954632342E-02 0.3091881927557716E-02 0.3038814025421337E-02 0.2986359839865667E-02\n 0.2934514010297470E-02 0.2883271223943334E-02 0.2832626215909399E-02 0.2782573769245732E-02 0.2733108715015361E-02\n 0.2684225932368273E-02 0.2635920348620736E-02 0.2588186939339922E-02 0.2541020728434335E-02 0.2494416788250113E-02\n 0.2448370239673485E-02 0.2402876252239763E-02 0.2357930044248895E-02 0.2313526882888074E-02 0.2269662084361452E-02\n 0.2226331014027437E-02 0.2183529086543647E-02 0.2141251766019886E-02 0.2099494566179429E-02 0.2058253050528833E-02\n 0.2017522832536582E-02 0.1977299575820819E-02 0.1937578994346416E-02 0.1898356852631761E-02 0.1859628965965341E-02\n 0.1821391200632576E-02 0.1783639474153031E-02 0.1746369755528287E-02 0.1709578065500809E-02 0.1673260476823867E-02\n 0.1637413114542927E-02 0.1602032156288575E-02 0.1567113832581223E-02 0.1532654427147850E-02 0.1498650277250755E-02\n 0.1465097774028671E-02 0.1431993362850165E-02 0.1399333543679485E-02 0.1367114871454921E-02 0.1335333956479567E-02\n 0.1303987464824598E-02 0.1273072118744786E-02 0.1242584697106271E-02 0.1212522035826240E-02 0.1182881028324278E-02\n 0.1153658625985074E-02 0.1124851838631879E-02 0.1096457735010339E-02 0.1068473443281882E-02 0.1040896151525936E-02\n 0.1013723108250083E-02 0.9869516229069582E-03 0.9605790664167954E-03 0.9346028716940452E-03 0.9090205341765010E-03\n 0.8838296123550832E-03 0.8590277283020786E-03 0.8346125681955534E-03 0.8105818828371373E-03 0.7869334881601800E-03\n 0.7636652657249203E-03 0.7407751631967363E-03 0.7182611948033279E-03 0.6961214417659799E-03 0.6743540526996259E-03\n 0.6529572439758464E-03 0.6319293000421489E-03 0.6112685736903467E-03 0.5909734862658870E-03 0.5710425278092155E-03\n 0.5514742571193334E-03 0.5322673017285347E-03 0.5134203577763651E-03 0.4949321897694443E-03 0.4768016302125221E-03\n 0.4590275790946831E-03 0.4416090032129194E-03 0.4245449353136761E-03 0.4078344730309316E-03 0.3914767775974666E-03\n 0.3754710723036193E-03 0.3598166406754878E-03 0.3445128243419585E-03 0.3295590205570407E-03 0.3149546793411112E-03\n 0.3006993002013562E-03 0.2867924283882840E-03 0.2732336506415988E-03 0.2600225903747107E-03 0.2471589022432513E-03\n 0.2346422660385661E-03 0.2224723798427698E-03 0.2106489523774314E-03 0.1991716944731751E-03 0.1880403095829506E-03\n 0.1772544832569928E-03 0.1668138714930798E-03 0.1567180878715900E-03 0.1469666893810824E-03 0.1375591608372710E-03\n 0.1284948977961454E-03 0.1197731878613226E-03 0.1113931902866863E-03 0.1033539137784803E-03 0.9565419240704367E-04\n 0.8829265954769630E-04 0.8126771978413778E-04 0.7457751872672617E-04 0.6821991072362678E-04 0.6219242447627770E-04\n 0.5649222661344906E-04 0.5111608333233986E-04 0.4606032028242377E-04 0.4132078095054316E-04 0.3689278390632745E-04\n 0.3277107938782920E-04 0.2894980585093507E-04 0.2542244727468145E-04 0.2218179221009314E-04 0.1921989578338595E-04\n 0.1652804611495441E-04 0.1409673689099332E-04 0.1191564811913617E-04 0.9973637403230573E-05 0.8258744369264157E-05\n 0.6758211140689631E-05 0.5458521963065276E-05 0.4345465168603044E-05 0.3404220589992921E-05 0.2619475202729796E-05\n 0.1975569103509067E-05 0.1456672814492850E-05 0.1046995232007964E-05 0.7310192213004316E-06 0.4937588492987344E-06\n 0.3210285891032542E-06 0.1997107219284094E-06 0.1180030350752796E-06 0.6562550627018659E-07 0.3396305969110393E-07\n 0.1612304561662313E-07 0.6892228656363058E-08 0.2589636663001748E-08 0.8280887390551865E-09 0.2156614040605737E-09\n 0.4301139703498805E-10 0.6010118005039632E-11 0.5149083260942099E-12 0.2193180426472887E-13 0.3274661750280784E-15\n 0.9138109562588437E-18 0.1354704193168576E-21 0.5668023630192864E-28 0.1003507143230543E-40 0.5696705688614969E-79\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.2350503764662797E-10 0.1452741565148498E-08 0.1598024605657181E-07 0.8670887247915710E-07\n 0.3194268290355064E-06 0.9210999532108705E-06 0.2243032243257230E-05 0.4826533736759059E-05 0.9449280963997414E-05\n 0.1717086310497067E-04 0.2937628005930804E-04 0.4781640004850213E-04 0.7464459701436190E-04 0.1124489746320072E-03\n 0.1642797466831127E-03 0.2336714851009560E-03 0.3246600692852489E-03 0.4417942752036344E-03 0.5901420321021944E-03\n 0.7752914499470295E-03 0.1003346783485080E-02 0.1280919550391384E-02 0.1615115062592291E-02 0.2013514662642524E-02\n 0.2484153982012019E-02 0.3035497556237696E-02 0.3676410143962806E-02 0.4416125103690986E-02 0.5264210184320288E-02\n 0.6230531083824742E-02 0.7325213125386473E-02 0.8558601392363368E-02 0.9941219653166928E-02 0.1148372839483666E-01\n 0.1319688227020127E-01 0.1509148724834461E-01 0.1717835774193908E-01 0.1946827396813322E-01 0.2197193978231332E-01\n 0.2469994120640449E-01 0.2766270585561205E-01 0.3087046344978465E-01 0.3433320757803945E-01 0.3806065886804223E-01\n 0.4206222969448004E-01 0.4634699054488188E-01 0.5092363814510472E-01 0.5580046543156136E-01 0.6098533344267084E-01\n 0.6648564518809444E-01 0.7230832154110638E-01 0.7845977918695805E-01 0.8494591064833676E-01 0.9177206639800155E-01\n 0.9894303905839608E-01 0.1064630496784886E+00 0.1143357360692630E+00 0.1225641431711653E+00 0.1311507154193881E+00\n 0.1400972910661206E+00 0.1494050984128002E+00 0.1590747538999337E+00 0.1691062619971989E+00 0.1794990168322592E+00\n 0.1902518054930074E+00 0.2013628129347618E+00 0.2128296284212524E+00 0.2246492534260200E+00 0.2368181109190946E+00\n 0.2493320559624748E+00 0.2621863875369867E+00 0.2753758615225286E+00 0.2888947047534727E+00 0.3027366300710904E+00\n 0.3168948522952475E+00 0.3313621050382702E+00 0.3461306582847914E+00 0.3611923366625136E+00 0.3765385383301647E+00\n 0.3921602544104397E+00 0.4080480888974157E+00 0.4241922789697600E+00 0.4405827156430124E+00 0.4572089646963136E+00\n 0.4740602878111100E+00 0.4911256638616449E+00 0.5083938102993529E+00 0.5258532045756759E+00 0.5434921055502246E+00\n 0.5612985748336912E+00 0.5792604980173683E+00 0.5973656057436424E+00 0.6156014945742982E+00 0.6339556476159732E+00\n 0.6524154548645443E+00 0.6709682332326954E+00 0.6896012462273114E+00 0.7083017232457365E+00 0.7270568784622643E+00\n 0.7458539292785299E+00 0.7646801143137046E+00 0.7835227109126022E+00 0.8023690521519213E+00 0.8212065433269309E+00\n 0.8400226779029110E+00 0.8588050529176166E+00 0.8775413838228915E+00 0.8962195187553934E+00 0.9148274522281129E+00\n 0.9333533382360560E+00 0.9517855027710543E+00 0.9701124557421923E+00 0.9883229022998167E+00 0.1006405753562465E+01\n 0.1024350136747383E+01 0.1042145404706545E+01 0.1059781144871260E+01 0.1077247187609600E+01 0.1094533614001869E+01\n 0.1111630763040373E+01 0.1128529238260637E+01 0.1145219913812065E+01 0.1161693939976847E+01 0.1177942748146633E+01\n 0.1193958055267189E+01 0.1209731867761823E+01 0.1225256484945006E+01 0.1240524501938026E+01 0.1255528812099049E+01\n 0.1270262608980346E+01 0.1284719387825761E+01 0.1298892946621899E+01 0.1312777386716678E+01 0.1326367113019209E+01\n 0.1339656833795096E+01 0.1352641560071424E+01 0.1365316604665792E+01 0.1377677580853886E+01 0.1389720400690019E+01\n 0.1401441272995214E+01 0.1412836701027270E+01 0.1423903479847286E+01 0.1434638693397013E+01 0.1445039711301291E+01\n 0.1455104185409776E+01 0.1464830046091919E+01 0.1474215498299109E+01 0.1483259017407622E+01 0.1491959344855860E+01\n 0.1500315483589179E+01 0.1508326693325296E+01 0.1515992485653126E+01 0.1523312618977543E+01 0.1530287093322397E+01\n 0.1536916145003750E+01 0.1543200241185077E+01 0.1549140074325868E+01 0.1554736556534737E+01 0.1559990813837915E+01\n 0.1564904180373601E+01 0.1569478192522416E+01 0.1573714582983838E+01 0.1577615274808202E+01 0.1581182375393509E+01\n 0.1584418170455991E+01 0.1587325117983052E+01 0.1589905842176854E+01 0.1592163127396545E+01 0.1594099912106772E+01\n 0.1595719282839819E+01 0.1597024468178396E+01 0.1598018832765788E+01 0.1598705871349761E+01 0.1599089202866354E+01\n 0.1599172564569312E+01 0.1598959806210704E+01 0.1598454884277914E+01 0.1597661856291940E+01 0.1596584875171653E+01\n 0.1595228183668366E+01 0.1593596108874842E+01 0.1591693056812536E+01 0.1589523507100701E+01 0.1587092007710641E+01\n 0.1584403169808198E+01 0.1581461662687349E+01 0.1578272208797470E+01 0.1574839578866685E+01 0.1571168587123450E+01\n 0.1567264086618331E+01 0.1563130964647693E+01 0.1558774138280876E+01 0.1554198549992189E+01 0.1549409163398889E+01\n 0.1544410959106127E+01 0.1539208930659677E+01 0.1533808080607080E+01 0.1528213416667707E+01 0.1522429948012042E+01\n 0.1516462681650386E+01 0.1510316618931021E+01 0.1503996752147732E+01 0.1497508061256460E+01 0.1490855510700755E+01\n 0.1484044046345540E+01 0.1477078592518635E+01 0.1469964049159342E+01 0.1462705289073315E+01 0.1455307155292826E+01\n 0.1447774458541496E+01 0.1440111974802394E+01 0.1432324442988392E+01 0.1424416562713602E+01 0.1416392992164560E+01\n 0.1408258346069873E+01 0.1400017193766902E+01 0.1391674057364033E+01 0.1383233409997026E+01 0.1374699674177898E+01\n 0.1366077220234727E+01 0.1357370364840755E+01 0.1348583369631108E+01 0.1339720439905439E+01 0.1330785723414737E+01\n 0.1321783309230582E+01 0.1312717226695031E+01 0.1303591444449351E+01 0.1294409869539786E+01 0.1285176346598528E+01\n 0.1275894657098056E+01 0.1266568518676988E+01 0.1257201584535619E+01 0.1247797442899263E+01 0.1238359616547584E+01\n 0.1228891562408019E+01 0.1219396671211496E+01 0.1209878267208578E+01 0.1200339607944202E+01 0.1190783884089205E+01\n 0.1181214219326823E+01 0.1171633670292365E+01 0.1162045226564264E+01 0.1152451810704780E+01 0.1142856278348570E+01\n 0.1133261418337408E+01 0.1123669952899346E+01 0.1114084537870646E+01 0.1104507762958775E+01 0.1094942152044870E+01\n 0.1085390163524009E+01 0.1075854190681740E+01 0.1066336562105254E+01 0.1056839542127690E+01 0.1047365331304049E+01\n 0.1037916066917227E+01 0.1028493823512701E+01 0.1019100613460447E+01 0.1009738387542688E+01 0.1000409035566070E+01\n 0.9911143869969610E+00 0.9818562116185301E+00 0.9726362202083267E+00 0.9634560652350970E+00 0.9543173415736288E+00\n 0.9452215872364120E+00 0.9361702841209427E+00 0.9271648587715566E+00 0.9182066831546644E+00 0.9092970754463097E+00\n 0.9004373008310244E+00 0.8916285723109384E+00 0.8828720515241635E+00 0.8741688495714935E+00 0.8655200278504954E+00\n 0.8569265988960664E+00 0.8483895272266132E+00 0.8399097301949807E+00 0.8314880788433289E+00 0.8231253987611650E+00\n 0.8148224709457564E+00 0.8065800326641964E+00 0.7983987783164219E+00 0.7902793602984723E+00 0.7822223898653531E+00\n 0.7742284379928720E+00 0.7662980362378170E+00 0.7584316775959118E+00 0.7506298173569868E+00 0.7428928739568187E+00\n 0.7352212298251275E+00 0.7276152322292518E+00 0.7200751941130188E+00 0.7126013949303633E+00 0.7051940814732806E+00\n 0.6978534686936988E+00 0.6905797405188852E+00 0.6833730506600221E+00 0.6762335234136188E+00 0.6691612544554096E+00\n 0.6621563116264519E+00 0.6552187357111161E+00 0.6483485412067125E+00 0.6415457170844840E+00 0.6348102275417313E+00\n 0.6281420127448483E+00 0.6215409895630656E+00 0.6150070522926947E+00 0.6085400733717113E+00 0.6021399040845107E+00\n 0.5958063752566826E+00 0.5895392979396676E+00 0.5833384640851877E+00 0.5772036472093250E+00 0.5711346030461549E+00\n 0.5651310701908592E+00 0.5591927707322315E+00 0.5533194108745153E+00 0.5475106815485299E+00 0.5417662590120353E+00\n 0.5360858054393003E+00 0.5304689694998603E+00 0.5249153869264497E+00 0.5194246810720941E+00 0.5139964634563777E+00\n 0.5086303343008993E+00 0.5033258830539155E+00 0.4980826889042317E+00 0.4929003212843441E+00 0.4877783403628898E+00\n 0.4827162975264554E+00 0.4777137358507827E+00 0.4727701905614446E+00 0.4678851894840552E+00 0.4630582534840750E+00\n 0.4582888968962981E+00 0.4535766279440972E+00 0.4489209491485098E+00 0.4443213577272558E+00 0.4397773459837845E+00\n 0.4352884016864413E+00 0.4308540084378585E+00 0.4264736460346724E+00 0.4221467908176804E+00 0.4178729160125361E+00\n 0.4136514920611062E+00 0.4094819869436024E+00 0.4053638664915989E+00 0.4012965946920645E+00 0.3972796339825281E+00\n 0.3933124455374964E+00 0.3893944895462572E+00 0.3855252254821869E+00 0.3817041123636960E+00 0.3779306090069412E+00\n 0.3742041742704262E+00 0.3705242672916375E+00 0.3668903477158274E+00 0.3633018759170965E+00 0.3597583132118892E+00\n 0.3562591220650529E+00 0.3528037662885790E+00 0.3493917112331675E+00 0.3460224239727477E+00 0.3426953734820877E+00\n 0.3394100308076194E+00 0.3361658692316251E+00 0.3329623644299036E+00 0.3297989946230563E+00 0.3266752407215223E+00\n 0.3235905864644950E+00 0.3205445185528428E+00 0.3175365267761750E+00 0.3145661041341699E+00 0.3116327469522978E+00\n 0.3087359549920661E+00 0.3058752315559112E+00 0.3030500835868565E+00 0.3002600217630693E+00 0.2975045605874296E+00\n 0.2947832184722352E+00 0.2920955178191660E+00 0.2894409850946181E+00 0.2868191509005325E+00 0.2842295500408273E+00\n 0.2816717215835535E+00 0.2791452089188812E+00 0.2766495598130334E+00 0.2741843264582723E+00 0.2717490655190478E+00\n 0.2693433381744174E+00 0.2669667101568407E+00 0.2646187517874495E+00 0.2622990380079024E+00 0.2600071484089175E+00\n 0.2577426672555859E+00 0.2555051835095635E+00 0.2532942908482358E+00 0.2511095876809479E+00 0.2489506771623981E+00\n 0.2468171672032794E+00 0.2447086704782614E+00 0.2426248044314016E+00 0.2405651912790701E+00 0.2385294580104723E+00\n 0.2365172363858518E+00 0.2345281629324596E+00 0.2325618789383613E+00 0.2306180304441682E+00 0.2286962682327625E+00\n 0.2267962478170977E+00 0.2249176294261405E+00 0.2230600779890333E+00 0.2212232631175415E+00 0.2194068590868594E+00\n 0.2176105448148379E+00 0.2158340038397009E+00 0.2140769242963177E+00 0.2123389988910903E+00 0.2106199248755169E+00\n 0.2089194040184958E+00 0.2072371425774233E+00 0.2055728512681448E+00 0.2039262452338156E+00 0.2022970440127238E+00\n 0.2006849715051299E+00 0.1990897559391716E+00 0.1975111298358903E+00 0.1959488299734197E+00 0.1944025973503926E+00\n 0.1928721771486053E+00 0.1913573186949898E+00 0.1898577754229339E+00 0.1883733048329959E+00 0.1869036684530497E+00\n 0.1854486317979078E+00 0.1840079643284546E+00 0.1825814394103312E+00 0.1811688342722097E+00 0.1797699299636905E+00\n 0.1783845113128567E+00 0.1770123668835237E+00 0.1756532889322104E+00 0.1743070733648679E+00 0.1729735196933954E+00\n 0.1716524309919727E+00 0.1703436138532354E+00 0.1690468783443259E+00 0.1677620379628421E+00 0.1664889095927099E+00\n 0.1652273134600088E+00 0.1639770730887696E+00 0.1627380152567701E+00 0.1615099699513493E+00 0.1602927703252654E+00\n 0.1590862526526123E+00 0.1578902562848216E+00 0.1567046236067624E+00 0.1555291999929633E+00 0.1543638337639696E+00\n 0.1532083761428563E+00 0.1520626812119101E+00 0.1509266058694993E+00 0.1498000097871428E+00 0.1486827553667961E+00\n 0.1475747076983654E+00 0.1464757345174640E+00 0.1453857061634240E+00 0.1443044955375730E+00 0.1432319780617891E+00\n 0.1421680316373446E+00 0.1411125366040483E+00 0.1400653756996955E+00 0.1390264340198362E+00 0.1379955989778688E+00\n 0.1369727602654673E+00 0.1359578098133525E+00 0.1349506417524104E+00 0.1339511523751675E+00 0.1329592400976282E+00\n 0.1319748054214808E+00 0.1309977508966756E+00 0.1300279810843844E+00 0.1290654025203415E+00 0.1281099236785748E+00\n 0.1271614549355259E+00 0.1262199085345698E+00 0.1252851985509296E+00 0.1243572408569959E+00 0.1234359530880505E+00\n 0.1225212546083961E+00 0.1216130664778956E+00 0.1207113114189237E+00 0.1198159137837281E+00 0.1189267995222068E+00\n 0.1180438961500998E+00 0.1171671327175942E+00 0.1162964397783483E+00 0.1154317493589289E+00 0.1145729949286663E+00\n 0.1137201113699259E+00 0.1128730349487938E+00 0.1120317032861783E+00 0.1111960553293266E+00 0.1103660313237529E+00\n 0.1095415727855802E+00 0.1087226224742927E+00 0.1079091243658972E+00 0.1071010236264925E+00 0.1062982665862460E+00\n 0.1055008007137718E+00 0.1047085745909144E+00 0.1039215378879289E+00 0.1031396413390617E+00 0.1023628367185243E+00\n 0.1015910768168619E+00 0.1008243154177097E+00 0.1000625072749386E+00 0.9930560809018427E-01 0.9855357449075822E-01\n 0.9780636400793745E-01 0.9706393505562982E-01 0.9632624690941162E-01 0.9559325968593356E-01 0.9486493432269383E-01\n 0.9414123255817297E-01 0.9342211691232764E-01 0.9270755066744044E-01 0.9199749784932158E-01 0.9129192320885827E-01\n 0.9059079220391024E-01 0.8989407098154546E-01 0.8920172636061409E-01 0.8851372581465511E-01 0.8783003745513447E-01\n 0.8715063001500779E-01 0.8647547283260665E-01 0.8580453583584287E-01 0.8513778952672810E-01 0.8447520496620298E-01\n 0.8381675375927530E-01 0.8316240804045885E-01 0.8251214045951316E-01 0.8186592416747822E-01 0.8122373280299988E-01\n 0.8058554047894315E-01 0.7995132176928955E-01 0.7932105169631275E-01 0.7869470571803144E-01 0.7807225971593283E-01\n 0.7745368998296467E-01 0.7683897321179178E-01 0.7622808648331135E-01 0.7562100725542614E-01 0.7501771335206921E-01\n 0.7441818295247755E-01 0.7382239458071076E-01 0.7323032709541087E-01 0.7264195967979867E-01 0.7205727183190487E-01\n 0.7147624335502985E-01 0.7089885434843042E-01 0.7032508519822850E-01 0.6975491656853922E-01 0.6918832939281314E-01\n 0.6862530486539103E-01 0.6806582443326617E-01 0.6750986978805110E-01 0.6695742285814540E-01 0.6640846580110123E-01\n 0.6586298099618196E-01 0.6532095103711212E-01 0.6478235872501446E-01 0.6424718706153042E-01 0.6371541924212147E-01\n 0.6318703864954746E-01 0.6266202884751911E-01 0.6214037357452046E-01 0.6162205673779986E-01 0.6110706240752450E-01\n 0.6059537481109686E-01 0.6008697832762830E-01 0.5958185748256901E-01 0.5907999694248869E-01 0.5858138151000727E-01\n 0.5808599611887154E-01 0.5759382582917469E-01 0.5710485582271634E-01 0.5661907139850073E-01 0.5613645796836825E-01\n 0.5565700105276017E-01 0.5518068627661225E-01 0.5470749936537444E-01 0.5423742614115482E-01 0.5377045251898517E-01\n 0.5330656450320408E-01 0.5284574818395761E-01 0.5238798973381230E-01 0.5193327540447994E-01 0.5148159152365149E-01\n 0.5103292449193595E-01 0.5058726077990446E-01 0.5014458692523559E-01 0.4970488952995948E-01 0.4926815525779950E-01\n 0.4883437083160901E-01 0.4840352303089959E-01 0.4797559868946120E-01 0.4755058469306943E-01 0.4712846797727979E-01\n 0.4670923552530574E-01 0.4629287436597942E-01 0.4587937157179187E-01 0.4546871425701189E-01 0.4506088957588125E-01\n 0.4465588472088415E-01 0.4425368692108926E-01 0.4385428344056262E-01 0.4345766157684944E-01 0.4306380865952269E-01\n 0.4267271204879778E-01 0.4228435913421057E-01 0.4189873733335742E-01 0.4151583409069603E-01 0.4113563687640473E-01\n 0.4075813318529899E-01 0.4038331053580396E-01 0.4001115646898086E-01 0.3964165854760631E-01 0.3927480435530239E-01\n 0.3891058149571723E-01 0.3854897759175296E-01 0.3818998028484157E-01 0.3783357723426573E-01 0.3747975611652434E-01\n 0.3712850462474054E-01 0.3677981046811218E-01 0.3643366137140177E-01 0.3609004507446641E-01 0.3574894933182556E-01\n 0.3541036191226535E-01 0.3507427059847887E-01 0.3474066318674111E-01 0.3440952748661676E-01 0.3408085132070126E-01\n 0.3375462252439219E-01 0.3343082894569176E-01 0.3310945844503797E-01 0.3279049889516447E-01 0.3247393818098731E-01\n 0.3215976419951815E-01 0.3184796485980308E-01 0.3153852808288556E-01 0.3123144180179359E-01 0.3092669396154863E-01\n 0.3062427251919747E-01 0.3032416544386438E-01 0.3002636071682391E-01 0.2973084633159302E-01 0.2943761029404197E-01\n 0.2914664062252300E-01 0.2885792534801624E-01 0.2857145251429220E-01 0.2828721017808998E-01 0.2800518640931039E-01\n 0.2772536929122391E-01 0.2744774692069189E-01 0.2717230740840119E-01 0.2689903887911129E-01 0.2662792947191326E-01\n 0.2635896734050006E-01 0.2609214065344760E-01 0.2582743759450599E-01 0.2556484636290022E-01 0.2530435517364029E-01\n 0.2504595225783962E-01 0.2478962586304191E-01 0.2453536425355501E-01 0.2428315571079263E-01 0.2403298853362201E-01\n 0.2378485103871834E-01 0.2353873156092471E-01 0.2329461845361733E-01 0.2305250008907579E-01 0.2281236485885801E-01\n 0.2257420117417889E-01 0.2233799746629312E-01 0.2210374218688127E-01 0.2187142380843883E-01 0.2164103082466791E-01\n 0.2141255175087165E-01 0.2118597512435002E-01 0.2096128950479806E-01 0.2073848347470486E-01 0.2051754563975416E-01\n 0.2029846462922549E-01 0.2008122909639606E-01 0.1986582771894261E-01 0.1965224919934375E-01 0.1944048226528158E-01\n 0.1923051567004319E-01 0.1902233819292149E-01 0.1881593863961467E-01 0.1861130584262509E-01 0.1840842866165638E-01\n 0.1820729598400922E-01 0.1800789672497538E-01 0.1781021982822961E-01 0.1761425426621972E-01 0.1741998904055397E-01\n 0.1722741318238660E-01 0.1703651575280017E-01 0.1684728584318532E-01 0.1665971257561794E-01 0.1647378510323276E-01\n 0.1628949261059417E-01 0.1610682431406360E-01 0.1592576946216329E-01 0.1574631733593689E-01 0.1556845724930608E-01\n 0.1539217854942354E-01 0.1521747061702217E-01 0.1504432286676001E-01 0.1487272474756165E-01 0.1470266574295493E-01\n 0.1453413537140393E-01 0.1436712318663735E-01 0.1420161877797267E-01 0.1403761177063589E-01 0.1387509182607664E-01\n 0.1371404864227910E-01 0.1355447195406791E-01 0.1339635153340976E-01 0.1323967718971016E-01 0.1308443877010535E-01\n 0.1293062615974990E-01 0.1277822928209887E-01 0.1262723809918580E-01 0.1247764261189538E-01 0.1232943286023138E-01\n 0.1218259892357987E-01 0.1203713092096717E-01 0.1189301901131328E-01 0.1175025339368011E-01 0.1160882430751480E-01\n 0.1146872203288826E-01 0.1132993689072848E-01 0.1119245924304928E-01 0.1105627949317382E-01 0.1092138808595317E-01\n 0.1078777550798031E-01 0.1065543228779879E-01 0.1052434899610681E-01 0.1039451624595617E-01 0.1026592469294671E-01\n 0.1013856503541558E-01 0.1001242801462182E-01 0.9887504414926333E-02 0.9763785063966725E-02 0.9641260832827890E-02\n 0.9519922636207538E-02 0.9399761432577210E-02 0.9280768224338752E-02 0.9162934057976000E-02 0.9046250024202221E-02\n 0.8930707258102832E-02 0.8816296939273676E-02 0.8703010291955119E-02 0.8590838585161509E-02 0.8479773132806546E-02\n 0.8369805293824308E-02 0.8260926472285997E-02 0.8153128117512804E-02 0.8046401724184376E-02 0.7940738832443478E-02\n 0.7836131027996606E-02 0.7732569942210602E-02 0.7630047252205678E-02 0.7528554680944333E-02 0.7428083997316856E-02\n 0.7328627016223001E-02 0.7230175598650108E-02 0.7132721651747814E-02 0.7036257128899153E-02 0.6940774029788536E-02\n 0.6846264400466227E-02 0.6752720333409701E-02 0.6660133967581916E-02 0.6568497488486375E-02 0.6477803128219479E-02\n 0.6388043165519663E-02 0.6299209925814047E-02 0.6211295781262146E-02 0.6124293150797016E-02 0.6038194500163917E-02\n 0.5952992341956366E-02 0.5868679235650055E-02 0.5785247787634298E-02 0.5702690651241371E-02 0.5621000526773856E-02\n 0.5540170161529816E-02 0.5460192349826328E-02 0.5381059933021076E-02 0.5302765799532243E-02 0.5225302884857029E-02\n 0.5148664171588471E-02 0.5072842689431090E-02 0.4997831515215207E-02 0.4923623772910095E-02 0.4850212633636272E-02\n 0.4777591315676702E-02 0.4705753084487369E-02 0.4634691252707118E-02 0.4564399180166933E-02 0.4494870273898941E-02\n 0.4426097988144961E-02 0.4358075824365064E-02 0.4290797331245945E-02 0.4224256104709619E-02 0.4158445787922197E-02\n 0.4093360071303100E-02 0.4028992692534918E-02 0.3965337436573796E-02 0.3902388135660784E-02 0.3840138669334105E-02\n 0.3778582964442547E-02 0.3717714995160261E-02 0.3657528783002880E-02 0.3598018396845369E-02 0.3539177952941635E-02\n 0.3481001614946027E-02 0.3423483593937147E-02 0.3366618148443765E-02 0.3310399584473416E-02 0.3254822255543565E-02\n 0.3199880562715664E-02 0.3145568954632342E-02 0.3091881927557716E-02 0.3038814025421337E-02 0.2986359839865667E-02\n 0.2934514010297470E-02 0.2883271223943334E-02 0.2832626215909399E-02 0.2782573769245732E-02 0.2733108715015361E-02\n 0.2684225932368273E-02 0.2635920348620736E-02 0.2588186939339922E-02 0.2541020728434335E-02 0.2494416788250113E-02\n 0.2448370239673485E-02 0.2402876252239763E-02 0.2357930044248895E-02 0.2313526882888074E-02 0.2269662084361452E-02\n 0.2226331014027437E-02 0.2183529086543647E-02 0.2141251766019886E-02 0.2099494566179429E-02 0.2058253050528833E-02\n 0.2017522832536582E-02 0.1977299575820819E-02 0.1937578994346416E-02 0.1898356852631761E-02 0.1859628965965341E-02\n 0.1821391200632576E-02 0.1783639474153031E-02 0.1746369755528287E-02 0.1709578065500809E-02 0.1673260476823867E-02\n 0.1637413114542927E-02 0.1602032156288575E-02 0.1567113832581223E-02 0.1532654427147850E-02 0.1498650277250755E-02\n 0.1465097774028671E-02 0.1431993362850165E-02 0.1399333543679485E-02 0.1367114871454921E-02 0.1335333956479567E-02\n 0.1303987464824598E-02 0.1273072118744786E-02 0.1242584697106271E-02 0.1212522035826240E-02 0.1182881028324278E-02\n 0.1153658625985074E-02 0.1124851838631879E-02 0.1096457735010339E-02 0.1068473443281882E-02 0.1040896151525936E-02\n 0.1013723108250083E-02 0.9869516229069582E-03 0.9605790664167954E-03 0.9346028716940452E-03 0.9090205341765010E-03\n 0.8838296123550832E-03 0.8590277283020786E-03 0.8346125681955534E-03 0.8105818828371373E-03 0.7869334881601800E-03\n 0.7636652657249203E-03 0.7407751631967363E-03 0.7182611948033279E-03 0.6961214417659799E-03 0.6743540526996259E-03\n 0.6529572439758464E-03 0.6319293000421489E-03 0.6112685736903467E-03 0.5909734862658870E-03 0.5710425278092155E-03\n 0.5514742571193334E-03 0.5322673017285347E-03 0.5134203577763651E-03 0.4949321897694443E-03 0.4768016302125221E-03\n 0.4590275790946831E-03 0.4416090032129194E-03 0.4245449353136761E-03 0.4078344730309316E-03 0.3914767775974666E-03\n 0.3754710723036193E-03 0.3598166406754878E-03 0.3445128243419585E-03 0.3295590205570407E-03 0.3149546793411112E-03\n 0.3006993002013562E-03 0.2867924283882840E-03 0.2732336506415988E-03 0.2600225903747107E-03 0.2471589022432513E-03\n 0.2346422660385661E-03 0.2224723798427698E-03 0.2106489523774314E-03 0.1991716944731751E-03 0.1880403095829506E-03\n 0.1772544832569928E-03 0.1668138714930798E-03 0.1567180878715900E-03 0.1469666893810824E-03 0.1375591608372710E-03\n 0.1284948977961454E-03 0.1197731878613226E-03 0.1113931902866863E-03 0.1033539137784803E-03 0.9565419240704367E-04\n 0.8829265954769630E-04 0.8126771978413778E-04 0.7457751872672617E-04 0.6821991072362678E-04 0.6219242447627770E-04\n 0.5649222661344906E-04 0.5111608333233986E-04 0.4606032028242377E-04 0.4132078095054316E-04 0.3689278390632745E-04\n 0.3277107938782920E-04 0.2894980585093507E-04 0.2542244727468145E-04 0.2218179221009314E-04 0.1921989578338595E-04\n 0.1652804611495441E-04 0.1409673689099332E-04 0.1191564811913617E-04 0.9973637403230573E-05 0.8258744369264157E-05\n 0.6758211140689631E-05 0.5458521963065276E-05 0.4345465168603044E-05 0.3404220589992921E-05 0.2619475202729796E-05\n 0.1975569103509067E-05 0.1456672814492850E-05 0.1046995232007964E-05 0.7310192213004316E-06 0.4937588492987344E-06\n 0.3210285891032542E-06 0.1997107219284094E-06 0.1180030350752796E-06 0.6562550627018659E-07 0.3396305969110393E-07\n 0.1612304561662313E-07 0.6892228656363058E-08 0.2589636663001748E-08 0.8280887390551865E-09 0.2156614040605737E-09\n 0.4301139703498805E-10 0.6010118005039632E-11 0.5149083260942099E-12 0.2193180426472887E-13 0.3274661750280784E-15\n 0.9138109562588437E-18 0.1354704193168576E-21 0.5668023630192864E-28 0.1003507143230543E-40 0.5696705688614969E-79\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 1 1.0080 1.8000 fcc \n 0.0000000000000000E+00 -0.1535560579048078E+00 -0.2907237616945244E+00 -0.4159976694362098E+00 -0.5313742240924204E+00\n -0.6381516341634162E+00 -0.7372865497340048E+00 -0.8295323942693905E+00 -0.9155075568639930E+00 -0.9957340210656841E+00\n -0.1070661374993902E+01 -0.1140682768426532E+01 -0.1206146070115003E+01 -0.1267361986331669E+01 -0.1324610161159111E+01\n -0.1378143882981543E+01 -0.1428193796698535E+01 -0.1474970886958801E+01 -0.1518668914237085E+01 -0.1559466431801390E+01\n -0.1597528475905044E+01 -0.1633007997183788E+01 -0.1666047084236993E+01 -0.1696778018255523E+01 -0.1725324188761563E+01\n -0.1751800894031140E+01 -0.1776316044902340E+01 -0.1798970786973415E+01 -0.1819860053348930E+01 -0.1839073057876778E+01\n -0.1856693737076276E+01 -0.1872801147573207E+01 -0.1887469824748019E+01 -0.1900770107406360E+01 -0.1912768432550330E+01\n -0.1923527603729046E+01 -0.1933107035951585E+01 -0.1941562979733216E+01 -0.1948948726501137E+01 -0.1955314797295812E+01\n -0.1960709116458849E+01 -0.1965177171789682E+01 -0.1968762162475479E+01 -0.1971505135945817E+01 -0.1973445114672207E+01\n -0.1974619213818786E+01 -0.1975062750551728E+01 -0.1974809345728893E+01 -0.1973891018616083E+01 -0.1972338275210313E+01\n -0.1970180190692498E+01 -0.1967444486480829E+01 -0.1964157602310837E+01 -0.1960344763727966E+01 -0.1956030045342894E+01\n -0.1951236430167903E+01 -0.1945985865324263E+01 -0.1940299314385106E+01 -0.1934196806595530E+01 -0.1927697483190939E+01\n -0.1920819641016471E+01 -0.1913580773633311E+01 -0.1905997610082929E+01 -0.1898086151466418E+01 -0.1889861705483819E+01\n -0.1881338919067047E+01 -0.1872531809229777E+01 -0.1863453792248377E+01 -0.1854117711279363E+01 -0.1844535862511214E+01\n -0.1834720019941148E+01 -0.1824681458861012E+01 -0.1814430978130464E+01 -0.1803978921310083E+01 -0.1793335196722089E+01\n -0.1782509296501631E+01 -0.1771510314697401E+01 -0.1760346964476296E+01 -0.1749027594483329E+01 -0.1737560204404532E+01\n -0.1725952459777540E+01 -0.1714211706091635E+01 -0.1702344982216385E+01 -0.1690359033195583E+01 -0.1678260322440748E+01\n -0.1666055043356523E+01 -0.1653749130428169E+01 -0.1641348269799635E+01 -0.1628857909368793E+01 -0.1616283268425060E+01\n -0.1603629346852960E+01 -0.1590900933923877E+01 -0.1578102616696916E+01 -0.1565238788048639E+01 -0.1552313654350187E+01\n -0.1539331242809444E+01 -0.1526295408494650E+01 -0.1513209841055223E+01 -0.1500078071154424E+01 -0.1486903476627897E+01\n -0.1473689288381174E+01 -0.1460438596038697E+01 -0.1447154353356060E+01 -0.1433839383406718E+01 -0.1420496383553594E+01\n -0.1407127930215773E+01 -0.1393736483439595E+01 -0.1380324391283206E+01 -0.1366893894023143E+01 -0.1353447128190937E+01\n -0.1339986130447453E+01 -0.1326512841302277E+01 -0.1313029108685023E+01 -0.1299536691375160E+01 -0.1286037262296563E+01\n -0.1272532411682773E+01 -0.1259023650118594E+01 -0.1245512411463359E+01 -0.1232000055660992E+01 -0.1218487871441779E+01\n -0.1204977078920362E+01 -0.1191468832094503E+01 -0.1177964221248664E+01 -0.1164464275266519E+01 -0.1150969963856213E+01\n -0.1137482199691838E+01 -0.1124001840474834E+01 -0.1110529690918452E+01 -0.1097066504658454E+01 -0.1083612986093118E+01\n -0.1070169792155417E+01 -0.1056737534020013E+01 -0.1043316778747819E+01 -0.1029908050870580E+01 -0.1016511833917833E+01\n -0.1003128571888578E+01 -0.9897586706698354E+00 -0.9764024994041254E+00 -0.9630603918080221E+00 -0.9497326474434862E+00\n -0.9364195329439393E+00 -0.9231212831968543E+00 -0.9098381024844113E+00 -0.8965701655839697E+00 -0.8833176188297485E+00\n -0.8700805811373453E+00 -0.8568591449923775E+00 -0.8436533774046202E+00 -0.8304633208290344E+00 -0.8172889940547750E+00\n -0.8041303930634986E+00 -0.7909874918580566E+00 -0.7778602432626174E+00 -0.7647485796954503E+00 -0.7516524139151204E+00\n -0.7385716397412827E+00 -0.7255061327509165E+00 -0.7124557509508342E+00 -0.6994203354274540E+00 -0.6863997109745679E+00\n -0.6733936866998824E+00 -0.6604020566111790E+00 -0.6474246001827013E+00 -0.6344610829025981E+00 -0.6215112568020091E+00\n -0.6085748609664665E+00 -0.5956516220302268E+00 -0.5827412546541748E+00 -0.5698434619878014E+00 -0.5569579361158532E+00\n -0.5440843584902399E+00 -0.5312224003475492E+00 -0.5183717231128886E+00 -0.5055319787902968E+00 -0.4927028103404054E+00\n -0.4798838520455784E+00 -0.4670747298631208E+00 -0.4542750617668665E+00 -0.4414844580776081E+00 -0.4287025217826503E+00\n -0.4159288488449873E+00 -0.4031630285022929E+00 -0.3904046435562347E+00 -0.3776532706523132E+00 -0.3649084805505702E+00\n -0.3521698383875012E+00 -0.3394369039294391E+00 -0.3267092318177014E+00 -0.3139863718057774E+00 -0.3012678689887569E+00\n -0.2885532640253530E+00 -0.2758420933527601E+00 -0.2631338893944120E+00 -0.2504281807610877E+00 -0.2377244924455082E+00\n -0.2250223460105389E+00 -0.2123212597713198E+00 -0.1996207489715085E+00 -0.1869203259537742E+00 -0.1742195003247300E+00\n -0.1615177791145765E+00 -0.1488146669314823E+00 -0.1361096661109569E+00 -0.1234022768604086E+00 -0.1106919973989453E+00\n -0.9797832409262908E-01 -0.8526075158534008E-01 -0.7253877292531064E-01 -0.5981187968757973E-01 -0.4707956209239161E-01\n -0.3434130911979061E-01 -0.2159660862033985E-01 -0.8844947422254279E-02 0.3914188564942300E-02 0.1668131425026886E-01\n 0.2945694526441001E-01 0.4224159786604931E-01 0.5503578885129357E-01 0.6784003546613926E-01 0.8065485532187089E-01\n 0.9348076631322821E-01 0.1063182865393753E+00 0.1191679342274936E+00 0.1320302276589731E+00 0.1449056850980641E+00\n 0.1577948247229719E+00 0.1706981645593397E+00 0.1836162224158824E+00 0.1965495158223847E+00 0.2094985619696659E+00\n 0.2224638776517585E+00 0.2354459792100279E+00 0.2484453824792379E+00 0.2614626027354943E+00 0.2744981546460752E+00\n 0.2875525522209847E+00 0.3006263087661927E+00 0.3137199368386514E+00 0.3268339482028364E+00 0.3399688537888836E+00\n 0.3531251636522359E+00 0.3663033869348276E+00 0.3795040318275802E+00 0.3927276055344020E+00 0.4059746142374676E+00\n 0.4192455630638039E+00 0.4325409560532072E+00 0.4458612961272428E+00 0.4592070850596310E+00 0.4725788234476167E+00\n 0.4859770106845307E+00 0.4994021449334540E+00 0.5128547231018850E+00 0.5263352408174535E+00 0.5398441924046491E+00\n 0.5533820708624786E+00 0.5669493678430300E+00 0.5805465736309947E+00 0.5941741771240481E+00 0.6078326658140436E+00\n 0.6215225257691057E+00 0.6352442416164141E+00 0.6489982965258876E+00 0.6627851721945213E+00 0.6766053488314805E+00\n 0.6904593051439232E+00 0.7043475183234973E+00 0.7182704640335023E+00 0.7322286163966445E+00 0.7462224479835151E+00\n 0.7602524298016173E+00 0.7743190312849433E+00 0.7884227202841974E+00 0.8025639630575290E+00 0.8167432242618240E+00\n 0.8309609669444393E+00 0.8452176525355792E+00 0.8595137408410123E+00 0.8738496900353998E+00 0.8882259566559134E+00\n 0.9026429955964752E+00 0.9171012601023203E+00 0.9316012017649666E+00 0.9461432705176964E+00 0.9607279146312910E+00\n 0.9753555807102323E+00 0.9900267136892760E+00 0.1004741756830290E+01 0.1019501151719556E+01 0.1034305338265334E+01\n 0.1049154754695761E+01 0.1064049837557060E+01 0.1078991021712077E+01 0.1093978740339108E+01 0.1109013424930930E+01\n 0.1124095505294220E+01 0.1139225409549223E+01 0.1154403564129567E+01 0.1169630393782453E+01 0.1184906321569069E+01\n 0.1200231768865166E+01 0.1215607155361878E+01 0.1231032899066835E+01 0.1246509416305429E+01 0.1262037121722220E+01\n 0.1277616428282728E+01 0.1293247747275209E+01 0.1308931488312698E+01 0.1324668059335260E+01 0.1340457866612423E+01\n 0.1356301314745660E+01 0.1372198806671151E+01 0.1388150743662683E+01 0.1404157525334607E+01 0.1420219549645083E+01\n 0.1436337212899343E+01 0.1452510909753110E+01 0.1468741033216232E+01 0.1485027974656301E+01 0.1501372123802541E+01\n 0.1517773868749642E+01 0.1534233595961925E+01 0.1550751690277352E+01 0.1567328534911856E+01 0.1583964511463701E+01\n 0.1600659999917852E+01 0.1617415378650525E+01 0.1634231024433875E+01 0.1651107312440629E+01 0.1668044616248917E+01\n 0.1685043307847061E+01 0.1702103757638609E+01 0.1719226334447252E+01 0.1736411405521971E+01 0.1753659336542133E+01\n 0.1770970491622715E+01 0.1788345233319539E+01 0.1805783922634601E+01 0.1823286919021478E+01 0.1840854580390711E+01\n 0.1858487263115261E+01 0.1876185322036066E+01 0.1893949110467636E+01 0.1911778980203568E+01 0.1929675281522265E+01\n 0.1947638363192579E+01 0.1965668572479554E+01 0.1983766255150165E+01 0.2001931755479132E+01 0.2020165416254637E+01\n 0.2038467578784327E+01 0.2056838582901055E+01 0.2075278766968794E+01 0.2093788467888599E+01 0.2112368021104497E+01\n 0.2131017760609439E+01 0.2149738018951330E+01 0.2168529127238993E+01 0.2187391415148134E+01 0.2206325210927415E+01\n 0.2225330841404466E+01 0.2244408631991916E+01 0.2263558906693465E+01 0.2282781988109954E+01 0.2302078197445396E+01\n 0.2321447854513099E+01 0.2340891277741691E+01 0.2360408784181265E+01 0.2380000689509425E+01 0.2399667308037372E+01\n 0.2419408952716023E+01 0.2439225935142099E+01 0.2459118565564146E+01 0.2479087152888749E+01 0.2499132004686517E+01\n 0.2519253427198186E+01 0.2539451725340665E+01 0.2559727202713198E+01 0.2580080161603353E+01 0.2600510902993117E+01\n 0.2621019726564874E+01 0.2641606930707586E+01 0.2662272812522710E+01 0.2683017667830213E+01 0.2703841791174714E+01\n 0.2724745475831364E+01 0.2745729013811853E+01 0.2766792695870475E+01 0.2787936811510058E+01 0.2809161648987794E+01\n 0.2830467495321410E+01 0.2851854636294917E+01 0.2873323356464579E+01 0.2894873939164848E+01 0.2916506666514209E+01\n 0.2938221819421049E+01 0.2960019677589501E+01 0.2981900519525381E+01 0.3003864622541801E+01 0.3025912262765175E+01\n 0.3048043715140940E+01 0.3070259253439192E+01 0.3092559150260705E+01 0.3114943677042409E+01 0.3137413104063187E+01\n 0.3159967700449641E+01 0.3182607734181641E+01 0.3205333472098077E+01 0.3228145179902447E+01 0.3251043122168472E+01\n 0.3274027562345680E+01 0.3297098762765072E+01 0.3320256984644469E+01 0.3343502488094288E+01 0.3366835532122889E+01\n 0.3390256374642066E+01 0.3413765272472630E+01 0.3437362481349784E+01 0.3461048255928476E+01 0.3484822849788961E+01\n 0.3508686515442005E+01 0.3532639504334363E+01 0.3556682066854127E+01 0.3580814452335925E+01 0.3605036909066328E+01\n 0.3629349684289036E+01 0.3653753024210198E+01 0.3678247174003544E+01 0.3702832377815693E+01 0.3727508878771226E+01\n 0.3752276918977883E+01 0.3777136739531759E+01 0.3802088580522303E+01 0.3827132681037432E+01 0.3852269279168641E+01\n 0.3877498612015998E+01 0.3902820915693174E+01 0.3928236425332438E+01 0.3953745375089617E+01 0.3979347998149013E+01\n 0.4005044526728421E+01 0.4030835192083855E+01 0.4056720224514617E+01 0.4082699853368021E+01 0.4108774307044248E+01\n 0.4134943813001183E+01 0.4161208597759163E+01 0.4187568886905720E+01 0.4214024905100390E+01 0.4240576876079345E+01\n 0.4267225022660046E+01 0.4293969566746052E+01 0.4320810729331575E+01 0.4347748730506037E+01 0.4374783789458776E+01\n 0.4401916124483547E+01 0.4429145952983095E+01 0.4456473491473638E+01 0.4483898955589500E+01 0.4511422560087357E+01\n 0.4539044518850936E+01 0.4566765044895316E+01 0.4594584350371322E+01 0.4622502646570012E+01 0.4650520143926894E+01\n 0.4678637052026418E+01 0.4706853579606230E+01 0.4735169934561444E+01 0.4763586323948928E+01 0.4792102953991607E+01\n 0.4820720030082579E+01 0.4849437756789456E+01 0.4878256337858449E+01 0.4907175976218555E+01 0.4936196873985707E+01\n 0.4965319232466936E+01 0.4994543252164328E+01 0.5023869132779231E+01 0.5053297073216303E+01 0.5082827271587405E+01\n 0.5112459925215758E+01 0.5142195230639895E+01 0.5172033383617539E+01 0.5201974579129658E+01 0.5232019011384368E+01\n 0.5262166873820703E+01 0.5292418359112656E+01 0.5322773659173003E+01 0.5353232965157039E+01 0.5383796467466556E+01\n 0.5414464355753495E+01 0.5445236818923759E+01 0.5476114045141041E+01 0.5507096221830388E+01 0.5538183535682169E+01\n 0.5569376172655497E+01 0.5600674317982096E+01 0.5632078156169850E+01 0.5663587871006478E+01 0.5695203645563089E+01\n 0.5726925662197861E+01 0.5758754102559550E+01 0.5790689147591050E+01 0.5822730977532937E+01 0.5854879771926981E+01\n 0.5887135709619618E+01 0.5919498968765412E+01 0.5951969726830611E+01 0.5984548160596443E+01 0.6017234446162569E+01\n 0.6050028758950551E+01 0.6082931273707150E+01 0.6115942164507743E+01 0.6149061604759621E+01 0.6182289767205272E+01\n 0.6215626823925810E+01 0.6249072946344119E+01 0.6282628305228231E+01 0.6316293070694456E+01 0.6350067412210745E+01\n 0.6383951498599807E+01 0.6417945498042277E+01 0.6452049578080040E+01 0.6486263905619155E+01 0.6520588646933274E+01\n 0.6555023967666467E+01 0.6589570032836555E+01 0.6624227006838173E+01 0.6658995053445667E+01 0.6693874335816274E+01\n 0.6728865016493213E+01 0.6763967257408575E+01 0.6799181219886369E+01 0.6834507064645582E+01 0.6869944951802993E+01\n 0.6905495040876272E+01 0.6941157490786817E+01 0.6976932459862688E+01 0.7012820105841560E+01 0.7048820585873601E+01\n 0.7084934056524147E+01 0.7121160673776924E+01 0.7157500593036525E+01 0.7193953969131448E+01 0.7230520956316742E+01\n 0.7267201708277015E+01 0.7303996378128941E+01 0.7340905118424199E+01 0.7377928081152227E+01 0.7415065417742714E+01\n 0.7452317279068625E+01 0.7489683815448713E+01 0.7527165176650154E+01 0.7564761511891398E+01 0.7602472969844660E+01\n 0.7640299698638533E+01 0.7678241845860797E+01 0.7716299558560847E+01 0.7754472983252295E+01 0.7792762265915677E+01\n 0.7831167552000825E+01 0.7869688986429596E+01 0.7908326713598298E+01 0.7947080877380213E+01 0.7985951621128103E+01\n 0.8024939087676790E+01 0.8064043419345456E+01 0.8103264757940238E+01 0.8142603244756712E+01 0.8182059020582113E+01\n 0.8221632225698052E+01 0.8261322999882655E+01 0.8301131482413128E+01 0.8341057812068073E+01 0.8381102127129775E+01\n 0.8421264565386728E+01 0.8461545264135914E+01 0.8501944360185011E+01 0.8542461989854800E+01 0.8583098288981544E+01\n 0.8623853392919127E+01 0.8664727436541362E+01 0.8705720554244369E+01 0.8746832879948686E+01 0.8788064547101555E+01\n 0.8829415688679173E+01 0.8870886437188865E+01 0.8912476924671346E+01 0.8954187282702780E+01 0.8996017642397092E+01\n 0.9037968134408045E+01 0.9080038888931480E+01 0.9122230035707283E+01 0.9164541704021747E+01 0.9206974022709504E+01\n 0.9249527120155676E+01 0.9292201124297971E+01 0.9334996162628819E+01 0.9377912362197343E+01 0.9420949849611493E+01\n 0.9464108751040072E+01 0.9507389192214658E+01 0.9550791298431900E+01 0.9594315194555200E+01 0.9637961005016923E+01\n 0.9681728853820376E+01 0.9725618864541687E+01 0.9769631160331837E+01 0.9813765863918640E+01 0.9858023097608644E+01\n 0.9902402983288997E+01 0.9946905642429570E+01 0.9991531196084678E+01 0.1003627976489508E+02 0.1008115146908984E+02\n 0.1012614642848822E+02 0.1017126476250151E+02 0.1021650659013498E+02 0.1026187202998970E+02 0.1030736120026423E+02\n 0.1035297421875671E+02 0.1039871120286647E+02 0.1044457226959594E+02 0.1049055753555247E+02 0.1053666711695001E+02\n 0.1058290112961095E+02 0.1062925968896805E+02 0.1067574291006588E+02 0.1072235090756281E+02 0.1076908379573268E+02\n 0.1081594168846656E+02 0.1086292469927445E+02 0.1091003294128697E+02 0.1095726652725712E+02 0.1100462556956189E+02\n 0.1105211018020406E+02 0.1109972047081387E+02 0.1114745655265044E+02 0.1119531853660384E+02 0.1124330653319640E+02\n 0.1129142065258453E+02 0.1133966100456022E+02 0.1138802769855287E+02 0.1143652084363064E+02 0.1148514054850226E+02\n 0.1153388692151854E+02 0.1158276007067394E+02 0.1163176010360828E+02 0.1168088712760808E+02 0.1173014124960834E+02\n 0.1177952257619401E+02 0.1182903121360145E+02 0.1187866726772023E+02 0.1192843084409426E+02 0.1197832204792367E+02\n 0.1202834098406616E+02 0.1207848775703852E+02 0.1212876247101815E+02 0.1217916522984446E+02 0.1222969613702057E+02\n 0.1228035529571446E+02 0.1233114280876082E+02 0.1238205877866202E+02 0.1243310330759011E+02 0.1248427649738783E+02\n 0.1253557844957024E+02 0.1258700926532612E+02 0.1263856904551937E+02 0.1269025789069041E+02 0.1274207590105764E+02\n 0.1279402317651873E+02 0.1284609981665210E+02 0.1289830592071831E+02 0.1295064158766139E+02 0.1300310691611016E+02\n 0.1305570200437972E+02 0.1310842695047267E+02 0.1316128185208051E+02 0.1321426680658502E+02 0.1326738191105951E+02\n 0.1332062726227020E+02 0.1337400295667756E+02 0.1342750909043750E+02 0.1348114575940276E+02 0.1353491305912430E+02\n 0.1358881108485235E+02 0.1364283993153797E+02 0.1369699969383405E+02 0.1375129046609678E+02 0.1380571234238685E+02\n 0.1386026541647074E+02 0.1391494978182183E+02 0.1396976553162181E+02 0.1402471275876187E+02 0.1407979155584384E+02\n 0.1413500201518157E+02 0.1419034422880200E+02 0.1424581828844641E+02 0.1430142428557176E+02 0.1435716231135165E+02\n 0.1441303245667767E+02 0.1446903481216061E+02 0.1452516946813144E+02 0.1458143651464284E+02 0.1463783604146995E+02\n 0.1469436813811187E+02 0.1475103289379257E+02 0.1480783039746221E+02 0.1486476073779820E+02 0.1492182400320636E+02\n 0.1497902028182210E+02 0.1503634966151138E+02 0.1509381222987208E+02 0.1515140807423487E+02 0.1520913728166454E+02\n 0.1526699993896084E+02 0.1532499613265989E+02 0.1538312594903494E+02 0.1544138947409778E+02 0.1549978679359965E+02\n 0.1555831799303221E+02 0.1561698315762881E+02 0.1567578237236552E+02 0.1573471572196207E+02 0.1579378329088299E+02\n 0.1585298516333866E+02 0.1591232142328633E+02 0.1597179215443117E+02 0.1603139744022732E+02 0.1609113736387884E+02\n 0.1615101200834081E+02 0.1621102145632030E+02 0.1627116579027744E+02 0.1633144509242638E+02 0.1639185944473622E+02\n 0.1645240892893225E+02 0.1651309362649662E+02 0.1657391361866950E+02 0.1663486898645014E+02 0.1669595981059768E+02\n 0.1675718617163216E+02 0.1681854814983560E+02 0.1688004582525278E+02 0.1694167927769237E+02 0.1700344858672776E+02\n 0.1706535383169809E+02 0.1712739509170910E+02 0.1718957244563422E+02 0.1725188597211529E+02 0.1731433574956364E+02\n 0.1737692185616106E+02 0.1743964436986050E+02 0.1750250336838723E+02 0.1756549892923954E+02 0.1762863112968988E+02\n 0.1769190004678551E+02 0.1775530575734953E+02 0.1781884833798184E+02 0.1788252786505983E+02 0.1794634441473943E+02\n 0.1801029806295595E+02 0.1807438888542495E+02 0.1813861695764293E+02 0.1820298235488868E+02 0.1826748515222356E+02\n 0.1833212542449270E+02 0.1839690324632588E+02 0.1846181869213811E+02 0.1852687183613067E+02 0.1859206275229210E+02\n 0.1865739151439864E+02 0.1872285819601541E+02 0.1878846287049704E+02 0.1885420561098861E+02 0.1892008649042634E+02\n 0.1898610558153868E+02 0.1905226295684672E+02 0.1911855868866527E+02 0.1918499284910370E+02 0.1925156551006659E+02\n 0.1931827674325448E+02 0.1938512662016491E+02 0.1945211521209302E+02 0.1951924259013235E+02 0.1958650882517566E+02\n 0.1965391398791571E+02 0.1972145814884597E+02 0.1978914137826159E+02 0.1985696374625988E+02 0.1992492532274116E+02\n 0.1999302617740977E+02 0.2006126637977442E+02 0.2012964599914926E+02 0.2019816510465454E+02 0.2026682376521724E+02\n 0.2033562204957191E+02 0.2040456002626147E+02 0.2047363776363781E+02 0.2054285532986256E+02 0.2061221279290795E+02\n 0.2068171022055733E+02 0.2075134768040595E+02 0.2082112523986171E+02 0.2089104296614605E+02 0.2096110092629424E+02\n 0.2103129918715649E+02 0.2110163781539841E+02 0.2117211687750176E+02 0.2124273643976533E+02 0.2131349656830528E+02\n 0.2138439732905617E+02 0.2145543878777140E+02 0.2152662101002412E+02 0.2159794406120766E+02 0.2166940800653642E+02\n 0.2174101291104644E+02 0.2181275883959610E+02 0.2188464585686669E+02 0.2195667402736326E+02 0.2202884341541514E+02\n 0.2210115408517663E+02 0.2217360610062771E+02 0.2224619952557461E+02 0.2231893442365038E+02 0.2239181085831591E+02\n 0.2246482889286010E+02 0.2253798859040076E+02 0.2261129001388523E+02 0.2268473322609096E+02 0.2275831828962614E+02\n 0.2283204526693043E+02 0.2290591422027539E+02 0.2297992521176526E+02 0.2305407830333766E+02 0.2312837355676387E+02\n 0.2320281103364977E+02 0.2327739079543636E+02 0.2335211290340030E+02 0.2342697741865454E+02 0.2350198440214897E+02\n 0.2357713391467102E+02 0.2365242601684612E+02 0.2372786076913854E+02 0.2380343823185174E+02 0.2387915846512908E+02\n 0.2395502152895441E+02 0.2403102748315263E+02 0.2410717638739019E+02 0.2418346830117586E+02 0.2425990328386112E+02\n 0.2433648139464079E+02 0.2441320269255370E+02 0.2449006723648306E+02 0.2456707508515719E+02 0.2464422629715007E+02\n 0.2472152093088173E+02 0.2479895904461906E+02 0.2487654069647616E+02 0.2495426594441500E+02 0.2503213484624594E+02\n 0.2511014745962827E+02 0.2518830384207072E+02 0.2526660405093208E+02 0.2534504814342175E+02 0.2542363617660013E+02\n 0.2550236820737923E+02 0.2558124429252339E+02 0.2566026448864954E+02 0.2573942885222773E+02 0.2581873743958190E+02\n 0.2589819030689023E+02 0.2597778751018570E+02 0.2605752910535647E+02 0.2613741514814674E+02 0.2621744569415681E+02\n 0.2629762079884404E+02 0.2637794051752302E+02 0.2645840490536618E+02 0.2653901401740439E+02 0.2661976790852737E+02\n 0.2670066663348421E+02 0.2678171024688378E+02 0.2686289880319548E+02 0.2694423235674941E+02 0.2702571096173704E+02\n 0.2710733467221175E+02 0.2718910354208919E+02 0.2727101762514775E+02 0.2735307697502924E+02 0.2743528164523912E+02\n 0.2751763168914713E+02 0.2760012715998774E+02 0.2768276811086066E+02 0.2776555459473111E+02 0.2784848666443062E+02\n 0.2793156437265721E+02 0.2801478777197602E+02 0.2809815691481973E+02 0.2818167185348894E+02 0.2826533264015273E+02\n 0.2834913932684915E+02 0.2843309196548557E+02 0.2851719060783909E+02 0.2860143530555727E+02 0.2868582611015826E+02\n 0.2877036307303130E+02 0.2885504624543746E+02 0.2893987567850965E+02 0.2902485142325337E+02 0.2910997353054712E+02\n 0.2919524205114265E+02 0.2928065703566552E+02 0.2936621853461569E+02 0.2945192659836760E+02 0.2953778127717089E+02\n 0.2962378262115081E+02 0.2970993068030837E+02 0.2979622550452115E+02 0.2988266714354346E+02 0.2996925564700682E+02\n 0.3005599106442041E+02 0.3014287344517153E+02 0.3022990283852592E+02 0.3031707929362812E+02 0.3040440285950215E+02\n 0.3049187358505165E+02 0.3057949151906041E+02 0.3066725671019266E+02 0.3075516920699371E+02 0.3084322905789012E+02\n 0.3093143631119021E+02 0.3101979101508448E+02 0.3110829321764588E+02 0.3119694296683040E+02 0.3128574031047729E+02\n 0.3137468529630954E+02 0.3146377797193422E+02 0.3155301838484299E+02 0.3164240658241237E+02 0.3173194261190401E+02\n 0.3182162652046552E+02 0.3191145835513032E+02 0.3200143816281827E+02 0.3209156599033621E+02 0.3218184188437798E+02\n 0.3227226589152506E+02 0.3236283805824685E+02 0.3245355843090114E+02 0.3254442705573426E+02 0.3263544397888169E+02\n 0.3272660924636835E+02 0.3281792290410885E+02 0.3290938499790812E+02 0.3300099557346138E+02 0.3309275467635493E+02\n 0.3318466235206626E+02 0.3327671864596444E+02 0.3336892360331044E+02 0.3346127726925774E+02 0.3355377968885226E+02\n 0.3364643090703304E+02 0.3373923096863262E+02 0.3383217991837713E+02 0.3392527780088678E+02 0.3401852466067623E+02\n 0.3411192054215498E+02 0.3420546548962749E+02 0.3429915954729392E+02 0.3439300275925001E+02 0.3448699516948774E+02\n 0.3458113682189561E+02 0.3467542776025882E+02 0.3476986802825981E+02 0.3486445766947862E+02 0.3495919672739288E+02\n 0.3505408524537850E+02 0.3514912326671002E+02 0.3524431083456054E+02 0.3533964799200239E+02 0.3543513478200754E+02\n 0.3553077124744756E+02 0.3562655743109424E+02 0.3572249337561980E+02 0.3581857912359721E+02 0.3591481471750058E+02\n 0.3601120019970533E+02 0.3610773561248870E+02 0.3620442099802995E+02 0.3630125639841068E+02 0.3639824185561516E+02\n 0.3649537741153064E+02 0.3659266310794771E+02 0.3669009898656054E+02 0.3678768508896718E+02 0.3688542145666988E+02\n 0.3698330813107555E+02 0.3708134515349577E+02 0.3717938217591600E+02 0.3727741919833622E+02 0.3737545622075644E+02\n 0.0000000000000000E+00 0.8576998932607242E-09 0.5148474978702150E-07 0.5500333859843751E-06 0.2898571356744415E-05\n 0.1037065667137954E-04 0.2904394432880980E-04 0.6869069328866988E-04 0.1435525383839498E-03 0.2729524897641136E-03\n 0.4817179545381958E-03 0.8004046139757985E-03 0.1265323067409609E-02 0.1918378981427738E-02 0.2806743664553777E-02\n 0.3982376035816319E-02 0.5501419303057878E-02 0.7423496677200373E-02 0.9810930426149240E-02 0.1272790776956854E-01\n 0.1623961574245743E-01 0.2041136538278681E-01 0.2530772356585144E-01 0.3099166862766308E-01 0.3752378368081732E-01\n 0.4496149929855063E-01 0.5335839507962672E-01 0.6276356754813610E-01 0.7322106991690198E-01 0.8476942747035206E-01\n 0.9744123071429918E-01 0.1112628070018588E+00 0.1262539700776599E+00 0.1424278458837341E+00 0.1597907720342443E+00\n 0.1783422675846084E+00 0.1980750690841191E+00 0.2189752283993167E+00 0.2410222674169928E+00 0.2641893844693322E+00\n 0.2884437071578631E+00 0.3137465861762969E+00 0.3400539247340754E+00 0.3673165382520538E+00 0.3954805391293457E+00\n 0.4244877415567311E+00 0.4542760815685687E+00 0.4847800477740307E+00 0.5159311184824792E+00 0.5476582012304797E+00\n 0.5798880710234582E+00 0.6125458039182285E+00 0.6455552028889719E+00 0.6788392132348257E+00 0.7123203250985853E+00\n 0.7459209609702914E+00 0.7795638463441852E+00 0.8131723619807327E+00 0.8466708764954843E+00 0.8799850582522438E+00\n 0.9130421657784031E+00 0.9457713161447614E+00 0.9781037309602292E+00 0.1009972959823397E+01 0.1041315081248019E+01\n 0.1072068881238206E+01 0.1102176009831869E+01 0.1131581116058128E+01 0.1160231961866557E+01 0.1188079515683897E+01\n 0.1215078026337852E+01 0.1241185078158618E+01 0.1266361628127532E+01 0.1290572025989520E+01 0.1313784018282635E+01\n 0.1335968737264703E+01 0.1357100675734715E+01 0.1377157648755932E+01 0.1396120743289401E+01 0.1413974256741546E+01\n 0.1430705625418266E+01 0.1446305343861415E+01 0.1460766876022088E+01 0.1474086559199635E+01 0.1486263501646126E+01\n 0.1497299474703849E+01 0.1507198800308697E+01 0.1515968234655533E+01 0.1523616848783268E+01 0.1530155906797786E+01\n 0.1535598742410441E+01 0.1539960634428920E+01 0.1543258681796175E+01 0.1545511678732089E+01 0.1546739990491811E+01\n 0.1546965430214609E+01 0.1546211137297620E+01 0.1544501457690412E+01 0.1541861826468803E+01 0.1538318653010165E+01\n 0.1533899209057386E+01 0.1528631519925127E+01 0.1522544259069783E+01 0.1515666646213862E+01 0.1508028349186392E+01\n 0.1499659389613263E+01 0.1490590052565443E+01 0.1480850800248451E+01 0.1470472189793603E+01 0.1459484795190111E+01\n 0.1447919133377286E+01 0.1435805594497667E+01 0.1423174376295045E+01 0.1410055422625766E+01 0.1396478366037582E+01\n 0.1382472474357517E+01 0.1368066601218609E+01 0.1353289140445096E+01 0.1338167984206406E+01 0.1322730484842268E+01\n 0.1307003420254224E+01 0.1291012962752784E+01 0.1274784651244435E+01 0.1258343366638420E+01 0.1241713310349911E+01\n 0.1224917985773531E+01 0.1207980182599308E+01 0.1190921963841912E+01 0.1173764655453436E+01 0.1156528838389896E+01\n 0.1139234343002130E+01 0.1121900245622720E+01 0.1104544867221897E+01 0.1087185774007220E+01 0.1069839779843846E+01\n 0.1052522950374696E+01 0.1035250608722480E+01 0.1018037342658465E+01 0.1000897013126039E+01 0.9838427640104167E+00\n 0.9668870330493002E+00 0.9500415637828995E+00 0.9333174184453955E+00 0.9167249917036894E+00 0.9002740251531050E+00\n 0.8839736224835302E+00 0.8678322652333790E+00 0.8518578290525983E+00 0.8360576003997890E+00 0.8204382936023470E+00\n 0.8050060682122852E+00 0.7897665465941298E+00 0.7747248316849636E+00 0.7598855248702404E+00 0.7452527439225495E+00\n 0.7308301409539072E+00 0.7166209203354966E+00 0.7026278565420246E+00 0.6888533118809829E+00 0.6752992540701540E+00\n 0.6619672736296282E+00 0.6488586010574048E+00 0.6359741237603777E+00 0.6233144027150980E+00 0.6108796888351882E+00\n 0.5986699390246809E+00 0.5866848318987949E+00 0.5749237831558405E+00 0.5633859605859940E+00 0.5520702987046087E+00\n 0.5409755129995881E+00 0.5301001137840697E+00 0.5194424196473048E+00 0.5090005704981659E+00 0.4987725401971368E+00\n 0.4887561487740056E+00 0.4789490742297346E+00 0.4693488639221445E+00 0.4599529455361500E+00 0.4507586376402879E+00\n 0.4417631598321903E+00 0.4329636424765457E+00 0.4243571360398264E+00 0.4159406200268177E+00 0.4077110115246057E+00\n 0.3996651733602655E+00 0.3917999218790373E+00 0.3841120343502322E+00 0.3765982560085148E+00 0.3692553067386082E+00\n 0.3620798874117488E+00 0.3550686858825059E+00 0.3482183826548197E+00 0.3415256562262722E+00 0.3349871881197929E+00\n 0.3285996676120873E+00 0.3223597961681734E+00 0.3162642915914723E+00 0.3103098918988991E+00 0.3044933589304323E+00\n 0.2988114817025848E+00 0.2932610795151651E+00 0.2878390048206519E+00 0.2825421458654130E+00 0.2773674291118858E+00\n 0.2723118214507413E+00 0.2673723322118953E+00 0.2625460149830915E+00 0.2578299692446370E+00 0.2532213418286768E+00\n 0.2487173282112436E+00 0.2443151736451206E+00 0.2400121741413617E+00 0.2358056773071348E+00 0.2316930830473297E+00\n 0.2276718441371882E+00 0.2237394666729961E+00 0.2198935104076650E+00 0.2161315889778330E+00 0.2124513700288889E+00\n 0.2088505752441177E+00 0.2053269802839583E+00 0.2018784146411472E+00 0.1985027614173130E+00 0.1951979570263882E+00\n 0.1919619908299856E+00 0.1887929047096988E+00 0.1856887925810768E+00 0.1826477998538276E+00 0.1796681228426198E+00\n 0.1767480081326520E+00 0.1738857519039822E+00 0.1710796992184251E+00 0.1683282432726463E+00 0.1656298246209137E+00\n 0.1629829303707959E+00 0.1603860933549304E+00 0.1578378912818327E+00 0.1553369458685551E+00 0.1528819219578573E+00\n 0.1504715266224071E+00 0.1481045082583851E+00 0.1457796556707337E+00 0.1434957971521608E+00 0.1412517995578756E+00\n 0.1390465673779208E+00 0.1368790418088395E+00 0.1347481998263070E+00 0.1326530532602482E+00 0.1305926478738530E+00\n 0.1285660624478085E+00 0.1265724078709661E+00 0.1246108262385681E+00 0.1226804899590787E+00 0.1207806008705706E+00\n 0.1189103893675429E+00 0.1170691135389732E+00 0.1152560583183238E+00 0.1134705346461653E+00 0.1117118786460041E+00\n 0.1099794508138442E+00 0.1082726352219536E+00 0.1065908387372449E+00 0.1049334902546352E+00 0.1033000399456902E+00\n 0.1016899585228177E+00 0.1001027365192277E+00 0.9853788358483354E-01 0.9699492779823146E-01 0.9547341499485665E-01\n 0.9397290811138079E-01 0.9249298654638069E-01 0.9103324553728220E-01 0.8959329555354877E-01 0.8817276170606399E-01\n 0.8677128317262857E-01 0.8538851263947052E-01 0.8402411575864875E-01 0.8267777062120664E-01 0.8134916724591848E-01\n 0.8003800708345375E-01 0.7874400253576731E-01 0.7746687649051477E-01 0.7620636187027600E-01 0.7496220119635953E-01\n 0.7373414616695294E-01 0.7252195724937327E-01 0.7132540328616367E-01 0.7014426111477837E-01 0.6897831520058859E-01\n 0.6782735728294027E-01 0.6669118603398869E-01 0.6556960673003079E-01 0.6446243093505667E-01 0.6336947619623536E-01\n 0.6229056575105237E-01 0.6122552824581402E-01 0.6017419746523230E-01 0.5913641207280737E-01 0.5811201536172281E-01\n 0.5710085501597033E-01 0.5610278288142408E-01 0.5511765474658521E-01 0.5414533013271837E-01 0.5318567209310896E-01\n 0.5223854702116695E-01 0.5130382446711163E-01 0.5038137696297216E-01 0.4947107985564236E-01 0.4857281114773465E-01\n 0.4768645134597841E-01 0.4681188331691594E-01 0.4594899214965088E-01 0.4509766502540915E-01 0.4425779109367826E-01\n 0.4342926135469399E-01 0.4261196854804814E-01 0.4180580704719781E-01 0.4101067275965932E-01 0.4022646303267519E-01\n 0.3945307656414969E-01 0.3869041331864940E-01 0.3793837444827467E-01 0.3719686221820911E-01 0.3646577993676117E-01\n 0.3574503188971662E-01 0.3503452327882445E-01 0.3433416016424531E-01 0.3364384941079507E-01 0.3296349863782079E-01\n 0.3229301617255276E-01 0.3163231100677876E-01 0.3098129275669249E-01 0.3033987162577284E-01 0.2970795837055464E-01\n 0.2908546426915543E-01 0.2847230109242889E-01 0.2786838107761748E-01 0.2727361690438311E-01 0.2668792167309761E-01\n 0.2611120888527847E-01 0.2554339242606102E-01 0.2498438654859956E-01 0.2443410586029598E-01 0.2389246531075691E-01\n 0.2335938018138393E-01 0.2283476607650571E-01 0.2231853891596374E-01 0.2181061492906659E-01 0.2131091064983147E-01\n 0.2081934291343454E-01 0.2033582885379438E-01 0.1986028590221680E-01 0.1939263178703108E-01 0.1893278453415130E-01\n 0.1848066246849892E-01 0.1803618421622546E-01 0.1759926870767613E-01 0.1716983518103927E-01 0.1674780318662707E-01\n 0.1633309259173651E-01 0.1592562358604172E-01 0.1552531668746990E-01 0.1513209274851720E-01 0.1474587296296080E-01\n 0.1436657887292672E-01 0.1399413237627429E-01 0.1362845573426023E-01 0.1326947157944628E-01 0.1291710292381743E-01\n 0.1257127316707774E-01 0.1223190610509324E-01 0.1189892593845275E-01 0.1157225728111806E-01 0.1125182516913743E-01\n 0.1093755506939646E-01 0.1062937288838200E-01 0.1032720498093588E-01 0.1003097815897619E-01 0.9740619700164219E-02\n 0.9456057356497178E-02 0.9177219362806280E-02 0.8904034445141316E-02 0.8636431829023183E-02 0.8374341247546036E-02\n 0.8117692949311960E-02 0.7866417706180585E-02 0.7620446820816740E-02 0.7379712134019578E-02 0.7144146031816014E-02\n 0.6913681452302325E-02 0.6688251892216657E-02 0.6467791413225554E-02 0.6252234647907211E-02 0.6041516805413253E-02\n 0.5835573676791136E-02 0.5634341639947666E-02 0.5437757664233824E-02 0.5245759314629934E-02 0.5058284755509180E-02\n 0.4875272753955811E-02 0.4696662682613547E-02 0.4522394522037392E-02 0.4352408862520555E-02 0.4186646905366133E-02\n 0.4025050463570553E-02 0.3867561961883894E-02 0.3714124436208813E-02 0.3564681532297067E-02 0.3419177503699341E-02\n 0.3277557208920367E-02 0.3139766107727285E-02 0.3005750256555324E-02 0.2875456302949815E-02 0.2748831478978852E-02\n 0.2625823593545541E-02 0.2506381023522792E-02 0.2390452703627873E-02 0.2277988114946939E-02 0.2168937272013016E-02\n 0.2063250708333439E-02 0.1960879460254761E-02 0.1861775049045227E-02 0.1765889461065943E-02 0.1673175125893125E-02\n 0.1583584892244586E-02 0.1497072001553956E-02 0.1413590059026983E-02 0.1333093002004349E-02 0.1255535065446408E-02\n 0.1180870744346243E-02 0.1109054752869345E-02 0.1040041980010902E-02 0.9737874415562595E-03 0.9102462281261181E-03\n 0.8493734490870866E-03 0.7911241721104120E-03 0.7354533581681445E-03 0.6823157917680999E-03 0.6316660062474194E-03\n 0.5834582039715675E-03 0.5376461713226330E-03 0.4941831884102573E-03 0.4530219335027502E-03 0.4141143822583456E-03\n 0.3774117019399670E-03 0.3428641409258591E-03 0.3104209139870729E-03 0.2800300839961760E-03 0.2516384409654113E-03\n 0.2251913795924475E-03 0.2006327768245250E-03 0.1779048713433524E-03 0.1569481473297049E-03 0.1377012253937927E-03\n 0.1201007641585952E-03 0.1040813766598551E-03 0.8957556647504338E-04 0.7651368930508610E-04 0.6482394658893534E-04\n 0.5443241860150438E-04 0.4526314532314971E-04 0.3723826410463467E-04 0.3027821368846399E-04 0.2430201435404447E-04\n 0.1922763365777299E-04 0.1497244622116435E-04 0.1145379401469120E-04 0.8589650285013768E-05 0.6299385349542388E-05\n 0.4504625622961494E-05 0.3130188220885624E-05 0.2105062280742719E-05 0.1363395085845545E-05 0.8454270900288885E-06\n 0.4983067594254876E-06 0.2767065679872027E-06 0.1431594160449781E-06 0.6804490613003522E-07 0.2918182930693568E-07\n 0.1102919874006033E-07 0.3560261260656263E-08 0.9406176465862757E-09 0.1916420214061158E-09 0.2763777688791933E-10\n 0.2482312356945943E-11 0.1136644735947497E-12 0.1904831683752850E-14 0.6466043629846817E-17 0.1381172060080856E-20\n 0.1274303700193166E-26 0.2106088550891557E-38 0.1212886175035114E-71 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.8576998932607242E-09 0.5148474978702150E-07 0.5500333859843751E-06 0.2898571356744415E-05\n 0.1037065667137954E-04 0.2904394432880980E-04 0.6869069328866988E-04 0.1435525383839498E-03 0.2729524897641136E-03\n 0.4817179545381958E-03 0.8004046139757985E-03 0.1265323067409609E-02 0.1918378981427738E-02 0.2806743664553777E-02\n 0.3982376035816319E-02 0.5501419303057878E-02 0.7423496677200373E-02 0.9810930426149240E-02 0.1272790776956854E-01\n 0.1623961574245743E-01 0.2041136538278681E-01 0.2530772356585144E-01 0.3099166862766308E-01 0.3752378368081732E-01\n 0.4496149929855063E-01 0.5335839507962672E-01 0.6276356754813610E-01 0.7322106991690198E-01 0.8476942747035206E-01\n 0.9744123071429918E-01 0.1112628070018588E+00 0.1262539700776599E+00 0.1424278458837341E+00 0.1597907720342443E+00\n 0.1783422675846084E+00 0.1980750690841191E+00 0.2189752283993167E+00 0.2410222674169928E+00 0.2641893844693322E+00\n 0.2884437071578631E+00 0.3137465861762969E+00 0.3400539247340754E+00 0.3673165382520538E+00 0.3954805391293457E+00\n 0.4244877415567311E+00 0.4542760815685687E+00 0.4847800477740307E+00 0.5159311184824792E+00 0.5476582012304797E+00\n 0.5798880710234582E+00 0.6125458039182285E+00 0.6455552028889719E+00 0.6788392132348257E+00 0.7123203250985853E+00\n 0.7459209609702914E+00 0.7795638463441852E+00 0.8131723619807327E+00 0.8466708764954843E+00 0.8799850582522438E+00\n 0.9130421657784031E+00 0.9457713161447614E+00 0.9781037309602292E+00 0.1009972959823397E+01 0.1041315081248019E+01\n 0.1072068881238206E+01 0.1102176009831869E+01 0.1131581116058128E+01 0.1160231961866557E+01 0.1188079515683897E+01\n 0.1215078026337852E+01 0.1241185078158618E+01 0.1266361628127532E+01 0.1290572025989520E+01 0.1313784018282635E+01\n 0.1335968737264703E+01 0.1357100675734715E+01 0.1377157648755932E+01 0.1396120743289401E+01 0.1413974256741546E+01\n 0.1430705625418266E+01 0.1446305343861415E+01 0.1460766876022088E+01 0.1474086559199635E+01 0.1486263501646126E+01\n 0.1497299474703849E+01 0.1507198800308697E+01 0.1515968234655533E+01 0.1523616848783268E+01 0.1530155906797786E+01\n 0.1535598742410441E+01 0.1539960634428920E+01 0.1543258681796175E+01 0.1545511678732089E+01 0.1546739990491811E+01\n 0.1546965430214609E+01 0.1546211137297620E+01 0.1544501457690412E+01 0.1541861826468803E+01 0.1538318653010165E+01\n 0.1533899209057386E+01 0.1528631519925127E+01 0.1522544259069783E+01 0.1515666646213862E+01 0.1508028349186392E+01\n 0.1499659389613263E+01 0.1490590052565443E+01 0.1480850800248451E+01 0.1470472189793603E+01 0.1459484795190111E+01\n 0.1447919133377286E+01 0.1435805594497667E+01 0.1423174376295045E+01 0.1410055422625766E+01 0.1396478366037582E+01\n 0.1382472474357517E+01 0.1368066601218609E+01 0.1353289140445096E+01 0.1338167984206406E+01 0.1322730484842268E+01\n 0.1307003420254224E+01 0.1291012962752784E+01 0.1274784651244435E+01 0.1258343366638420E+01 0.1241713310349911E+01\n 0.1224917985773531E+01 0.1207980182599308E+01 0.1190921963841912E+01 0.1173764655453436E+01 0.1156528838389896E+01\n 0.1139234343002130E+01 0.1121900245622720E+01 0.1104544867221897E+01 0.1087185774007220E+01 0.1069839779843846E+01\n 0.1052522950374696E+01 0.1035250608722480E+01 0.1018037342658465E+01 0.1000897013126039E+01 0.9838427640104167E+00\n 0.9668870330493002E+00 0.9500415637828995E+00 0.9333174184453955E+00 0.9167249917036894E+00 0.9002740251531050E+00\n 0.8839736224835302E+00 0.8678322652333790E+00 0.8518578290525983E+00 0.8360576003997890E+00 0.8204382936023470E+00\n 0.8050060682122852E+00 0.7897665465941298E+00 0.7747248316849636E+00 0.7598855248702404E+00 0.7452527439225495E+00\n 0.7308301409539072E+00 0.7166209203354966E+00 0.7026278565420246E+00 0.6888533118809829E+00 0.6752992540701540E+00\n 0.6619672736296282E+00 0.6488586010574048E+00 0.6359741237603777E+00 0.6233144027150980E+00 0.6108796888351882E+00\n 0.5986699390246809E+00 0.5866848318987949E+00 0.5749237831558405E+00 0.5633859605859940E+00 0.5520702987046087E+00\n 0.5409755129995881E+00 0.5301001137840697E+00 0.5194424196473048E+00 0.5090005704981659E+00 0.4987725401971368E+00\n 0.4887561487740056E+00 0.4789490742297346E+00 0.4693488639221445E+00 0.4599529455361500E+00 0.4507586376402879E+00\n 0.4417631598321903E+00 0.4329636424765457E+00 0.4243571360398264E+00 0.4159406200268177E+00 0.4077110115246057E+00\n 0.3996651733602655E+00 0.3917999218790373E+00 0.3841120343502322E+00 0.3765982560085148E+00 0.3692553067386082E+00\n 0.3620798874117488E+00 0.3550686858825059E+00 0.3482183826548197E+00 0.3415256562262722E+00 0.3349871881197929E+00\n 0.3285996676120873E+00 0.3223597961681734E+00 0.3162642915914723E+00 0.3103098918988991E+00 0.3044933589304323E+00\n 0.2988114817025848E+00 0.2932610795151651E+00 0.2878390048206519E+00 0.2825421458654130E+00 0.2773674291118858E+00\n 0.2723118214507413E+00 0.2673723322118953E+00 0.2625460149830915E+00 0.2578299692446370E+00 0.2532213418286768E+00\n 0.2487173282112436E+00 0.2443151736451206E+00 0.2400121741413617E+00 0.2358056773071348E+00 0.2316930830473297E+00\n 0.2276718441371882E+00 0.2237394666729961E+00 0.2198935104076650E+00 0.2161315889778330E+00 0.2124513700288889E+00\n 0.2088505752441177E+00 0.2053269802839583E+00 0.2018784146411472E+00 0.1985027614173130E+00 0.1951979570263882E+00\n 0.1919619908299856E+00 0.1887929047096988E+00 0.1856887925810768E+00 0.1826477998538276E+00 0.1796681228426198E+00\n 0.1767480081326520E+00 0.1738857519039822E+00 0.1710796992184251E+00 0.1683282432726463E+00 0.1656298246209137E+00\n 0.1629829303707959E+00 0.1603860933549304E+00 0.1578378912818327E+00 0.1553369458685551E+00 0.1528819219578573E+00\n 0.1504715266224071E+00 0.1481045082583851E+00 0.1457796556707337E+00 0.1434957971521608E+00 0.1412517995578756E+00\n 0.1390465673779208E+00 0.1368790418088395E+00 0.1347481998263070E+00 0.1326530532602482E+00 0.1305926478738530E+00\n 0.1285660624478085E+00 0.1265724078709661E+00 0.1246108262385681E+00 0.1226804899590787E+00 0.1207806008705706E+00\n 0.1189103893675429E+00 0.1170691135389732E+00 0.1152560583183238E+00 0.1134705346461653E+00 0.1117118786460041E+00\n 0.1099794508138442E+00 0.1082726352219536E+00 0.1065908387372449E+00 0.1049334902546352E+00 0.1033000399456902E+00\n 0.1016899585228177E+00 0.1001027365192277E+00 0.9853788358483354E-01 0.9699492779823146E-01 0.9547341499485665E-01\n 0.9397290811138079E-01 0.9249298654638069E-01 0.9103324553728220E-01 0.8959329555354877E-01 0.8817276170606399E-01\n 0.8677128317262857E-01 0.8538851263947052E-01 0.8402411575864875E-01 0.8267777062120664E-01 0.8134916724591848E-01\n 0.8003800708345375E-01 0.7874400253576731E-01 0.7746687649051477E-01 0.7620636187027600E-01 0.7496220119635953E-01\n 0.7373414616695294E-01 0.7252195724937327E-01 0.7132540328616367E-01 0.7014426111477837E-01 0.6897831520058859E-01\n 0.6782735728294027E-01 0.6669118603398869E-01 0.6556960673003079E-01 0.6446243093505667E-01 0.6336947619623536E-01\n 0.6229056575105237E-01 0.6122552824581402E-01 0.6017419746523230E-01 0.5913641207280737E-01 0.5811201536172281E-01\n 0.5710085501597033E-01 0.5610278288142408E-01 0.5511765474658521E-01 0.5414533013271837E-01 0.5318567209310896E-01\n 0.5223854702116695E-01 0.5130382446711163E-01 0.5038137696297216E-01 0.4947107985564236E-01 0.4857281114773465E-01\n 0.4768645134597841E-01 0.4681188331691594E-01 0.4594899214965088E-01 0.4509766502540915E-01 0.4425779109367826E-01\n 0.4342926135469399E-01 0.4261196854804814E-01 0.4180580704719781E-01 0.4101067275965932E-01 0.4022646303267519E-01\n 0.3945307656414969E-01 0.3869041331864940E-01 0.3793837444827467E-01 0.3719686221820911E-01 0.3646577993676117E-01\n 0.3574503188971662E-01 0.3503452327882445E-01 0.3433416016424531E-01 0.3364384941079507E-01 0.3296349863782079E-01\n 0.3229301617255276E-01 0.3163231100677876E-01 0.3098129275669249E-01 0.3033987162577284E-01 0.2970795837055464E-01\n 0.2908546426915543E-01 0.2847230109242889E-01 0.2786838107761748E-01 0.2727361690438311E-01 0.2668792167309761E-01\n 0.2611120888527847E-01 0.2554339242606102E-01 0.2498438654859956E-01 0.2443410586029598E-01 0.2389246531075691E-01\n 0.2335938018138393E-01 0.2283476607650571E-01 0.2231853891596374E-01 0.2181061492906659E-01 0.2131091064983147E-01\n 0.2081934291343454E-01 0.2033582885379438E-01 0.1986028590221680E-01 0.1939263178703108E-01 0.1893278453415130E-01\n 0.1848066246849892E-01 0.1803618421622546E-01 0.1759926870767613E-01 0.1716983518103927E-01 0.1674780318662707E-01\n 0.1633309259173651E-01 0.1592562358604172E-01 0.1552531668746990E-01 0.1513209274851720E-01 0.1474587296296080E-01\n 0.1436657887292672E-01 0.1399413237627429E-01 0.1362845573426023E-01 0.1326947157944628E-01 0.1291710292381743E-01\n 0.1257127316707774E-01 0.1223190610509324E-01 0.1189892593845275E-01 0.1157225728111806E-01 0.1125182516913743E-01\n 0.1093755506939646E-01 0.1062937288838200E-01 0.1032720498093588E-01 0.1003097815897619E-01 0.9740619700164219E-02\n 0.9456057356497178E-02 0.9177219362806280E-02 0.8904034445141316E-02 0.8636431829023183E-02 0.8374341247546036E-02\n 0.8117692949311960E-02 0.7866417706180585E-02 0.7620446820816740E-02 0.7379712134019578E-02 0.7144146031816014E-02\n 0.6913681452302325E-02 0.6688251892216657E-02 0.6467791413225554E-02 0.6252234647907211E-02 0.6041516805413253E-02\n 0.5835573676791136E-02 0.5634341639947666E-02 0.5437757664233824E-02 0.5245759314629934E-02 0.5058284755509180E-02\n 0.4875272753955811E-02 0.4696662682613547E-02 0.4522394522037392E-02 0.4352408862520555E-02 0.4186646905366133E-02\n 0.4025050463570553E-02 0.3867561961883894E-02 0.3714124436208813E-02 0.3564681532297067E-02 0.3419177503699341E-02\n 0.3277557208920367E-02 0.3139766107727285E-02 0.3005750256555324E-02 0.2875456302949815E-02 0.2748831478978852E-02\n 0.2625823593545541E-02 0.2506381023522792E-02 0.2390452703627873E-02 0.2277988114946939E-02 0.2168937272013016E-02\n 0.2063250708333439E-02 0.1960879460254761E-02 0.1861775049045227E-02 0.1765889461065943E-02 0.1673175125893125E-02\n 0.1583584892244586E-02 0.1497072001553956E-02 0.1413590059026983E-02 0.1333093002004349E-02 0.1255535065446408E-02\n 0.1180870744346243E-02 0.1109054752869345E-02 0.1040041980010902E-02 0.9737874415562595E-03 0.9102462281261181E-03\n 0.8493734490870866E-03 0.7911241721104120E-03 0.7354533581681445E-03 0.6823157917680999E-03 0.6316660062474194E-03\n 0.5834582039715675E-03 0.5376461713226330E-03 0.4941831884102573E-03 0.4530219335027502E-03 0.4141143822583456E-03\n 0.3774117019399670E-03 0.3428641409258591E-03 0.3104209139870729E-03 0.2800300839961760E-03 0.2516384409654113E-03\n 0.2251913795924475E-03 0.2006327768245250E-03 0.1779048713433524E-03 0.1569481473297049E-03 0.1377012253937927E-03\n 0.1201007641585952E-03 0.1040813766598551E-03 0.8957556647504338E-04 0.7651368930508610E-04 0.6482394658893534E-04\n 0.5443241860150438E-04 0.4526314532314971E-04 0.3723826410463467E-04 0.3027821368846399E-04 0.2430201435404447E-04\n 0.1922763365777299E-04 0.1497244622116435E-04 0.1145379401469120E-04 0.8589650285013768E-05 0.6299385349542388E-05\n 0.4504625622961494E-05 0.3130188220885624E-05 0.2105062280742719E-05 0.1363395085845545E-05 0.8454270900288885E-06\n 0.4983067594254876E-06 0.2767065679872027E-06 0.1431594160449781E-06 0.6804490613003522E-07 0.2918182930693568E-07\n 0.1102919874006033E-07 0.3560261260656263E-08 0.9406176465862757E-09 0.1916420214061158E-09 0.2763777688791933E-10\n 0.2482312356945943E-11 0.1136644735947497E-12 0.1904831683752850E-14 0.6466043629846817E-17 0.1381172060080856E-20\n 0.1274303700193166E-26 0.2106088550891557E-38 0.1212886175035114E-71 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.8576998932607242E-09 0.5148474978702150E-07 0.5500333859843751E-06 0.2898571356744415E-05\n 0.1037065667137954E-04 0.2904394432880980E-04 0.6869069328866988E-04 0.1435525383839498E-03 0.2729524897641136E-03\n 0.4817179545381958E-03 0.8004046139757985E-03 0.1265323067409609E-02 0.1918378981427738E-02 0.2806743664553777E-02\n 0.3982376035816319E-02 0.5501419303057878E-02 0.7423496677200373E-02 0.9810930426149240E-02 0.1272790776956854E-01\n 0.1623961574245743E-01 0.2041136538278681E-01 0.2530772356585144E-01 0.3099166862766308E-01 0.3752378368081732E-01\n 0.4496149929855063E-01 0.5335839507962672E-01 0.6276356754813610E-01 0.7322106991690198E-01 0.8476942747035206E-01\n 0.9744123071429918E-01 0.1112628070018588E+00 0.1262539700776599E+00 0.1424278458837341E+00 0.1597907720342443E+00\n 0.1783422675846084E+00 0.1980750690841191E+00 0.2189752283993167E+00 0.2410222674169928E+00 0.2641893844693322E+00\n 0.2884437071578631E+00 0.3137465861762969E+00 0.3400539247340754E+00 0.3673165382520538E+00 0.3954805391293457E+00\n 0.4244877415567311E+00 0.4542760815685687E+00 0.4847800477740307E+00 0.5159311184824792E+00 0.5476582012304797E+00\n 0.5798880710234582E+00 0.6125458039182285E+00 0.6455552028889719E+00 0.6788392132348257E+00 0.7123203250985853E+00\n 0.7459209609702914E+00 0.7795638463441852E+00 0.8131723619807327E+00 0.8466708764954843E+00 0.8799850582522438E+00\n 0.9130421657784031E+00 0.9457713161447614E+00 0.9781037309602292E+00 0.1009972959823397E+01 0.1041315081248019E+01\n 0.1072068881238206E+01 0.1102176009831869E+01 0.1131581116058128E+01 0.1160231961866557E+01 0.1188079515683897E+01\n 0.1215078026337852E+01 0.1241185078158618E+01 0.1266361628127532E+01 0.1290572025989520E+01 0.1313784018282635E+01\n 0.1335968737264703E+01 0.1357100675734715E+01 0.1377157648755932E+01 0.1396120743289401E+01 0.1413974256741546E+01\n 0.1430705625418266E+01 0.1446305343861415E+01 0.1460766876022088E+01 0.1474086559199635E+01 0.1486263501646126E+01\n 0.1497299474703849E+01 0.1507198800308697E+01 0.1515968234655533E+01 0.1523616848783268E+01 0.1530155906797786E+01\n 0.1535598742410441E+01 0.1539960634428920E+01 0.1543258681796175E+01 0.1545511678732089E+01 0.1546739990491811E+01\n 0.1546965430214609E+01 0.1546211137297620E+01 0.1544501457690412E+01 0.1541861826468803E+01 0.1538318653010165E+01\n 0.1533899209057386E+01 0.1528631519925127E+01 0.1522544259069783E+01 0.1515666646213862E+01 0.1508028349186392E+01\n 0.1499659389613263E+01 0.1490590052565443E+01 0.1480850800248451E+01 0.1470472189793603E+01 0.1459484795190111E+01\n 0.1447919133377286E+01 0.1435805594497667E+01 0.1423174376295045E+01 0.1410055422625766E+01 0.1396478366037582E+01\n 0.1382472474357517E+01 0.1368066601218609E+01 0.1353289140445096E+01 0.1338167984206406E+01 0.1322730484842268E+01\n 0.1307003420254224E+01 0.1291012962752784E+01 0.1274784651244435E+01 0.1258343366638420E+01 0.1241713310349911E+01\n 0.1224917985773531E+01 0.1207980182599308E+01 0.1190921963841912E+01 0.1173764655453436E+01 0.1156528838389896E+01\n 0.1139234343002130E+01 0.1121900245622720E+01 0.1104544867221897E+01 0.1087185774007220E+01 0.1069839779843846E+01\n 0.1052522950374696E+01 0.1035250608722480E+01 0.1018037342658465E+01 0.1000897013126039E+01 0.9838427640104167E+00\n 0.9668870330493002E+00 0.9500415637828995E+00 0.9333174184453955E+00 0.9167249917036894E+00 0.9002740251531050E+00\n 0.8839736224835302E+00 0.8678322652333790E+00 0.8518578290525983E+00 0.8360576003997890E+00 0.8204382936023470E+00\n 0.8050060682122852E+00 0.7897665465941298E+00 0.7747248316849636E+00 0.7598855248702404E+00 0.7452527439225495E+00\n 0.7308301409539072E+00 0.7166209203354966E+00 0.7026278565420246E+00 0.6888533118809829E+00 0.6752992540701540E+00\n 0.6619672736296282E+00 0.6488586010574048E+00 0.6359741237603777E+00 0.6233144027150980E+00 0.6108796888351882E+00\n 0.5986699390246809E+00 0.5866848318987949E+00 0.5749237831558405E+00 0.5633859605859940E+00 0.5520702987046087E+00\n 0.5409755129995881E+00 0.5301001137840697E+00 0.5194424196473048E+00 0.5090005704981659E+00 0.4987725401971368E+00\n 0.4887561487740056E+00 0.4789490742297346E+00 0.4693488639221445E+00 0.4599529455361500E+00 0.4507586376402879E+00\n 0.4417631598321903E+00 0.4329636424765457E+00 0.4243571360398264E+00 0.4159406200268177E+00 0.4077110115246057E+00\n 0.3996651733602655E+00 0.3917999218790373E+00 0.3841120343502322E+00 0.3765982560085148E+00 0.3692553067386082E+00\n 0.3620798874117488E+00 0.3550686858825059E+00 0.3482183826548197E+00 0.3415256562262722E+00 0.3349871881197929E+00\n 0.3285996676120873E+00 0.3223597961681734E+00 0.3162642915914723E+00 0.3103098918988991E+00 0.3044933589304323E+00\n 0.2988114817025848E+00 0.2932610795151651E+00 0.2878390048206519E+00 0.2825421458654130E+00 0.2773674291118858E+00\n 0.2723118214507413E+00 0.2673723322118953E+00 0.2625460149830915E+00 0.2578299692446370E+00 0.2532213418286768E+00\n 0.2487173282112436E+00 0.2443151736451206E+00 0.2400121741413617E+00 0.2358056773071348E+00 0.2316930830473297E+00\n 0.2276718441371882E+00 0.2237394666729961E+00 0.2198935104076650E+00 0.2161315889778330E+00 0.2124513700288889E+00\n 0.2088505752441177E+00 0.2053269802839583E+00 0.2018784146411472E+00 0.1985027614173130E+00 0.1951979570263882E+00\n 0.1919619908299856E+00 0.1887929047096988E+00 0.1856887925810768E+00 0.1826477998538276E+00 0.1796681228426198E+00\n 0.1767480081326520E+00 0.1738857519039822E+00 0.1710796992184251E+00 0.1683282432726463E+00 0.1656298246209137E+00\n 0.1629829303707959E+00 0.1603860933549304E+00 0.1578378912818327E+00 0.1553369458685551E+00 0.1528819219578573E+00\n 0.1504715266224071E+00 0.1481045082583851E+00 0.1457796556707337E+00 0.1434957971521608E+00 0.1412517995578756E+00\n 0.1390465673779208E+00 0.1368790418088395E+00 0.1347481998263070E+00 0.1326530532602482E+00 0.1305926478738530E+00\n 0.1285660624478085E+00 0.1265724078709661E+00 0.1246108262385681E+00 0.1226804899590787E+00 0.1207806008705706E+00\n 0.1189103893675429E+00 0.1170691135389732E+00 0.1152560583183238E+00 0.1134705346461653E+00 0.1117118786460041E+00\n 0.1099794508138442E+00 0.1082726352219536E+00 0.1065908387372449E+00 0.1049334902546352E+00 0.1033000399456902E+00\n 0.1016899585228177E+00 0.1001027365192277E+00 0.9853788358483354E-01 0.9699492779823146E-01 0.9547341499485665E-01\n 0.9397290811138079E-01 0.9249298654638069E-01 0.9103324553728220E-01 0.8959329555354877E-01 0.8817276170606399E-01\n 0.8677128317262857E-01 0.8538851263947052E-01 0.8402411575864875E-01 0.8267777062120664E-01 0.8134916724591848E-01\n 0.8003800708345375E-01 0.7874400253576731E-01 0.7746687649051477E-01 0.7620636187027600E-01 0.7496220119635953E-01\n 0.7373414616695294E-01 0.7252195724937327E-01 0.7132540328616367E-01 0.7014426111477837E-01 0.6897831520058859E-01\n 0.6782735728294027E-01 0.6669118603398869E-01 0.6556960673003079E-01 0.6446243093505667E-01 0.6336947619623536E-01\n 0.6229056575105237E-01 0.6122552824581402E-01 0.6017419746523230E-01 0.5913641207280737E-01 0.5811201536172281E-01\n 0.5710085501597033E-01 0.5610278288142408E-01 0.5511765474658521E-01 0.5414533013271837E-01 0.5318567209310896E-01\n 0.5223854702116695E-01 0.5130382446711163E-01 0.5038137696297216E-01 0.4947107985564236E-01 0.4857281114773465E-01\n 0.4768645134597841E-01 0.4681188331691594E-01 0.4594899214965088E-01 0.4509766502540915E-01 0.4425779109367826E-01\n 0.4342926135469399E-01 0.4261196854804814E-01 0.4180580704719781E-01 0.4101067275965932E-01 0.4022646303267519E-01\n 0.3945307656414969E-01 0.3869041331864940E-01 0.3793837444827467E-01 0.3719686221820911E-01 0.3646577993676117E-01\n 0.3574503188971662E-01 0.3503452327882445E-01 0.3433416016424531E-01 0.3364384941079507E-01 0.3296349863782079E-01\n 0.3229301617255276E-01 0.3163231100677876E-01 0.3098129275669249E-01 0.3033987162577284E-01 0.2970795837055464E-01\n 0.2908546426915543E-01 0.2847230109242889E-01 0.2786838107761748E-01 0.2727361690438311E-01 0.2668792167309761E-01\n 0.2611120888527847E-01 0.2554339242606102E-01 0.2498438654859956E-01 0.2443410586029598E-01 0.2389246531075691E-01\n 0.2335938018138393E-01 0.2283476607650571E-01 0.2231853891596374E-01 0.2181061492906659E-01 0.2131091064983147E-01\n 0.2081934291343454E-01 0.2033582885379438E-01 0.1986028590221680E-01 0.1939263178703108E-01 0.1893278453415130E-01\n 0.1848066246849892E-01 0.1803618421622546E-01 0.1759926870767613E-01 0.1716983518103927E-01 0.1674780318662707E-01\n 0.1633309259173651E-01 0.1592562358604172E-01 0.1552531668746990E-01 0.1513209274851720E-01 0.1474587296296080E-01\n 0.1436657887292672E-01 0.1399413237627429E-01 0.1362845573426023E-01 0.1326947157944628E-01 0.1291710292381743E-01\n 0.1257127316707774E-01 0.1223190610509324E-01 0.1189892593845275E-01 0.1157225728111806E-01 0.1125182516913743E-01\n 0.1093755506939646E-01 0.1062937288838200E-01 0.1032720498093588E-01 0.1003097815897619E-01 0.9740619700164219E-02\n 0.9456057356497178E-02 0.9177219362806280E-02 0.8904034445141316E-02 0.8636431829023183E-02 0.8374341247546036E-02\n 0.8117692949311960E-02 0.7866417706180585E-02 0.7620446820816740E-02 0.7379712134019578E-02 0.7144146031816014E-02\n 0.6913681452302325E-02 0.6688251892216657E-02 0.6467791413225554E-02 0.6252234647907211E-02 0.6041516805413253E-02\n 0.5835573676791136E-02 0.5634341639947666E-02 0.5437757664233824E-02 0.5245759314629934E-02 0.5058284755509180E-02\n 0.4875272753955811E-02 0.4696662682613547E-02 0.4522394522037392E-02 0.4352408862520555E-02 0.4186646905366133E-02\n 0.4025050463570553E-02 0.3867561961883894E-02 0.3714124436208813E-02 0.3564681532297067E-02 0.3419177503699341E-02\n 0.3277557208920367E-02 0.3139766107727285E-02 0.3005750256555324E-02 0.2875456302949815E-02 0.2748831478978852E-02\n 0.2625823593545541E-02 0.2506381023522792E-02 0.2390452703627873E-02 0.2277988114946939E-02 0.2168937272013016E-02\n 0.2063250708333439E-02 0.1960879460254761E-02 0.1861775049045227E-02 0.1765889461065943E-02 0.1673175125893125E-02\n 0.1583584892244586E-02 0.1497072001553956E-02 0.1413590059026983E-02 0.1333093002004349E-02 0.1255535065446408E-02\n 0.1180870744346243E-02 0.1109054752869345E-02 0.1040041980010902E-02 0.9737874415562595E-03 0.9102462281261181E-03\n 0.8493734490870866E-03 0.7911241721104120E-03 0.7354533581681445E-03 0.6823157917680999E-03 0.6316660062474194E-03\n 0.5834582039715675E-03 0.5376461713226330E-03 0.4941831884102573E-03 0.4530219335027502E-03 0.4141143822583456E-03\n 0.3774117019399670E-03 0.3428641409258591E-03 0.3104209139870729E-03 0.2800300839961760E-03 0.2516384409654113E-03\n 0.2251913795924475E-03 0.2006327768245250E-03 0.1779048713433524E-03 0.1569481473297049E-03 0.1377012253937927E-03\n 0.1201007641585952E-03 0.1040813766598551E-03 0.8957556647504338E-04 0.7651368930508610E-04 0.6482394658893534E-04\n 0.5443241860150438E-04 0.4526314532314971E-04 0.3723826410463467E-04 0.3027821368846399E-04 0.2430201435404447E-04\n 0.1922763365777299E-04 0.1497244622116435E-04 0.1145379401469120E-04 0.8589650285013768E-05 0.6299385349542388E-05\n 0.4504625622961494E-05 0.3130188220885624E-05 0.2105062280742719E-05 0.1363395085845545E-05 0.8454270900288885E-06\n 0.4983067594254876E-06 0.2767065679872027E-06 0.1431594160449781E-06 0.6804490613003522E-07 0.2918182930693568E-07\n 0.1102919874006033E-07 0.3560261260656263E-08 0.9406176465862757E-09 0.1916420214061158E-09 0.2763777688791933E-10\n 0.2482312356945943E-11 0.1136644735947497E-12 0.1904831683752850E-14 0.6466043629846817E-17 0.1381172060080856E-20\n 0.1274303700193166E-26 0.2106088550891557E-38 0.1212886175035114E-71 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.3765610317640694E+00 0.7400358894127599E+00 0.1090712381667745E+01 0.1428873061247002E+01\n 0.1754795319320031E+01 0.2068751483890357E+01 0.2371008922950546E+01 0.2661830152878451E+01 0.2941472952229258E+01\n 0.3210190480819170E+01 0.3468231403786657E+01 0.3715840020150198E+01 0.3953256395252374E+01 0.4180716496383695E+01\n 0.4398452330811846E+01 0.4606692085398965E+01 0.4805660266967400E+01 0.4995577842570571E+01 0.5176662378836555E+01\n 0.5349128179575754E+01 0.5513186420878141E+01 0.5669045282968079E+01 0.5816910078133630E+01 0.5956983374101555E+01\n 0.6089465112286805E+01 0.6214552720405558E+01 0.6332441219002502E+01 0.6443323321505209E+01 0.6547389527480199E+01\n 0.6644828208826436E+01 0.6735825688701171E+01 0.6820566313030878E+01 0.6899232514514866E+01 0.6972004869081964E+01\n 0.7039062144810148E+01 0.7100581343365575E+01 0.7156737734061032E+01 0.7207704880673625E+01 0.7253654661198675E+01\n 0.7294757280749858E+01 0.7331181277846054E+01 0.7363093524351962E+01 0.7390659219363427E+01 0.7414041877348629E+01\n 0.7433403310874117E+01 0.7448903608259055E+01 0.7460701106512816E+01 0.7468952359920434E+01 0.7473812104646840E+01\n 0.7475433219735298E+01 0.7473966684877387E+01 0.7469561535331859E+01 0.7462364814367910E+01 0.7452521523604532E+01\n 0.7440174571612401E+01 0.7425464721137732E+01 0.7408530535299623E+01 0.7389508323102637E+01 0.7368532084596213E+01\n 0.7345733456000793E+01 0.7321241655108376E+01 0.7295183427252115E+01 0.7267682992125909E+01 0.7238861991720891E+01\n 0.7208839439630969E+01 0.7177731671964857E+01 0.7145652300086835E+01 0.7112712165393094E+01 0.7079019296315407E+01\n 0.7044678867728360E+01 0.7009793162921103E+01 0.6974461538279471E+01 0.6938780390809384E+01 0.6902843128617441E+01\n 0.6866740144450676E+01 0.6830558792382606E+01 0.6794383367719482E+01 0.6758295090186962E+01 0.6722372090444448E+01\n 0.6686689399961921E+01 0.6651318944281731E+01 0.6616329539676658E+01 0.6581786893203926E+01 0.6547753606144576E+01\n 0.6514289180807551E+01 0.6481450030667977E+01 0.6449289493800484E+01 0.6417857849559566E+01 0.6387202338451258E+01\n 0.6357367185132800E+01 0.6328393624470087E+01 0.6300319930576388E+01 0.6273181448749665E+01 0.6247010630220808E+01\n 0.6221837069619801E+01 0.6197687545062726E+01 0.6174586060758330E+01 0.6152553892029570E+01 0.6131609632642339E+01\n 0.6111769244331025E+01 0.6093046108408382E+01 0.6075451079345281E+01 0.6058992540204510E+01 0.6043676459811814E+01\n 0.6029506451546534E+01 0.6016483833633909E+01 0.6004607690820981E+01 0.5993874937318422E+01 0.5984280380890941E+01\n 0.5975816787979942E+01 0.5968474949742999E+01 0.5962243748896129E+01 0.5957110227246338E+01 0.5953059653803552E+01\n 0.5950075593363216E+01 0.5948139975452642E+01 0.5947233163536738E+01 0.5947334024380974E+01 0.5948419997472152E+01\n 0.5950467164400099E+01 0.5953450318106323E+01 0.5957343031908459E+01 0.5962117728212475E+01 0.5967745746827388E+01\n 0.5974197412800709E+01 0.5981442103695763E+01 0.5989448316235365E+01 0.5998183732239485E+01 0.6007615283788049E+01\n 0.6017709217542990E+01 0.6028431158167253E+01 0.6039746170781648E+01 0.6051618822403686E+01 0.6064013242315937E+01\n 0.6076893181314657E+01 0.6090222069792634E+01 0.6103963074613425E+01 0.6118079154737412E+01 0.6132533115562999E+01\n 0.6147287661949624E+01 0.6162305449892092E+01 0.6177549136818604E+01 0.6192981430488190E+01 0.6208565136465474E+01\n 0.6224263204154009E+01 0.6240038771371831E+01 0.6255855207455509E+01 0.6271676154881747E+01 0.6287465569397743E+01\n 0.6303187758654289E+01 0.6318807419337479E+01 0.6334289672797612E+01 0.6349600099175650E+01 0.6364704770029900E+01\n 0.6379570279467482E+01 0.6394163773787110E+01 0.6408452979641630E+01 0.6422406230730219E+01 0.6435992493032277E+01\n 0.6449181388596262E+01 0.6461943217898319E+01 0.6474248980787193E+01 0.6486070396033000E+01 0.6497379919498787E+01\n 0.6508150760955191E+01 0.6518356899559369E+01 0.6527973098020561E+01 0.6536974915475707E+01 0.6545338719099223E+01\n 0.6553041694472095E+01 0.6560061854736102E+01 0.6566378048559677E+01 0.6571969966942736E+01 0.6576818148888014E+01\n 0.6580903985967331E+01 0.6584209725811516E+01 0.6586718474552983E+01 0.6588414198250604E+01 0.6589281723326368E+01\n 0.6589306736044133E+01 0.6588475781060250E+01 0.6586776259076728E+01 0.6584196423626929E+01 0.6580725377024553E+01\n 0.6576353065506066E+01 0.6571070273597098E+01 0.6564868617732960E+01 0.6557740539163546E+01 0.6549679296172584E+01\n 0.6540678955640928E+01 0.6530734383983693E+01 0.6519841237490329E+01 0.6507995952096807E+01 0.6495195732618538E+01\n 0.6481438541472563E+01 0.6466723086916791E+01 0.6451048810834144E+01 0.6434415876088694E+01 0.6416825153480584E+01\n 0.6398278208326170E+01 0.6378777286689151E+01 0.6358325301288192E+01 0.6336925817105747E+01 0.6314583036722893E+01\n 0.6291301785403415E+01 0.6267087495951198E+01 0.6241946193363197E+01 0.6215884479300494E+01 0.6188909516399138E+01\n 0.6161029012441793E+01 0.6132251204410994E+01 0.6102584842443767E+01 0.6072039173707282E+01 0.6040623926214209E+01\n 0.6008349292596213E+01 0.5975225913853303E+01 0.5941264863095957E+01 0.5906477629296895E+01 0.5870876101068294E+01\n 0.5834472550479789E+01 0.5797279616932335E+01 0.5759310291102085E+01 0.5720577898967909E+01 0.5681096085935931E+01\n 0.5640878801073526E+01 0.5599940281464876E+01 0.5558295036699770E+01 0.5515957833506386E+01 0.5472943680538803E+01\n 0.5429267813328917E+01 0.5384945679412595E+01 0.5339992923638538E+01 0.5294425373668760E+01 0.5248259025678392E+01\n 0.5201510030262340E+01 0.5154194678555982E+01 0.5106329388576237E+01 0.5057930691789439E+01 0.5009015219911397E+01\n 0.4959599691945191E+01 0.4909700901461299E+01 0.4859335704124821E+01 0.4808521005473441E+01 0.4757273748950229E+01\n 0.4705610904194174E+01 0.4653549455591696E+01 0.4601106391091448E+01 0.4548298691284878E+01 0.4495143318754116E+01\n 0.4441657207689196E+01 0.4387857253775341E+01 0.4333760304351776E+01 0.4279383148842287E+01 0.4224742509458196E+01\n 0.4169855032173684E+01 0.4114737277973392E+01 0.4059405714371826E+01 0.4003876707203877E+01 0.3948166512685741E+01\n 0.3892291269744721E+01 0.3836266992617200E+01 0.3780109563712459E+01 0.3723834726741400E+01 0.3667458080107569E+01\n 0.3610995070558891E+01 0.3554460987097478E+01 0.3497870955145241E+01 0.3441239930962816E+01 0.3384582696318687E+01\n 0.3327913853406216E+01 0.3271247820004922E+01 0.3214598824883478E+01 0.3157980903440747E+01 0.3101407893581784E+01\n 0.3044893431825231E+01 0.2988450949638577E+01 0.2932093669997769E+01 0.2875834604167262E+01 0.2819686548696998E+01\n 0.2763662082632170E+01 0.2707773564932239E+01 0.2652033132094799E+01 0.2596452695980827E+01 0.2541043941836626E+01\n 0.2485818326509053E+01 0.2430787076849344E+01 0.2375961188301807E+01 0.2321351423672851E+01 0.2266968312076604E+01\n 0.2212822148052429E+01 0.2158922990850521E+01 0.2105280663881218E+01 0.2051904754323755E+01 0.1998804612890416E+01\n 0.1945989353741675E+01 0.1893467854548430E+01 0.1841248756696710E+01 0.1789340465631234E+01 0.1737751151333199E+01\n 0.1686488748928507E+01 0.1635560959422214E+01 0.1584975250555055E+01 0.1534738857778293E+01 0.1484858785342541E+01\n 0.1435341807496924E+01 0.1386194469794414E+01 0.1337423090499684E+01 0.1289033762095411E+01 0.1241032352883452E+01\n 0.1193424508676993E+01 0.1146215654580135E+01 0.1099410996851037E+01 0.1053015524845333E+01 0.1007034013035967E+01\n 0.9614710231061919E+00 0.9163309061121906E+00 0.8716178047119132E+00 0.8273356554569915E+00 0.7834881911441322E+00\n 0.7400789432232032E+00 0.6971112442584428E+00 0.6545882304400988E+00 0.6125128441430950E+00 0.5708878365301393E+00\n 0.5297157701959697E+00 0.4889990218502538E+00 0.4487397850361310E+00 0.4089400728816994E+00 0.3696017208819437E+00\n 0.3307263897082250E+00 0.2923155680431669E+00 0.2543705754380062E+00 0.2168925651904757E+00 0.1798825272404206E+00\n 0.1433412910812248E+00 0.1072695286845231E+00 0.7166775743626266E-01 0.3653634308175027E-01 0.1875502677966891E-02\n -0.3231469244926006E-01 -0.6603431374472693E-01 -0.9928357246226212E-01 -0.1320628167035092E+00 -0.1643725284591359E+00\n -0.1962133206540352E+00 -0.2275859341981871E+00 -0.2584912350448162E+00 -0.2889302112573159E+00 -0.3189039700865247E+00\n -0.3484137350596561E+00 -0.3774608430824280E+00 -0.4060467415555353E+00 -0.4341729855069461E+00 -0.4618412347410261E+00\n -0.4890532510058743E+00 -0.5158108951799040E+00 -0.5421161244787339E+00 -0.5679709896834355E+00 -0.5933776323912099E+00\n -0.6183382822893291E+00 -0.6428552544532798E+00 -0.6669309466699765E+00 -0.6905678367868668E+00 -0.7137684800877064E+00\n -0.7365355066956285E+00 -0.7588716190043869E+00 -0.7807795891382519E+00 -0.8022622564412896E+00 -0.8233225249964942E+00\n -0.8439633611754367E+00 -0.8641877912188305E+00 -0.8839988988484928E+00 -0.9033998229112149E+00 -0.9223937550548300E+00\n -0.9409839374369939E+00 -0.9591736604667737E+00 -0.9769662605796675E+00 -0.9943651180460338E+00 -0.1011373654813408E+01\n -0.1027995332382722E+01 -0.1044233649718800E+01 -0.1060092141195189E+01 -0.1075574374573462E+01 -0.1090683949017157E+01\n -0.1105424493140398E+01 -0.1119799663091301E+01 -0.1133813140670142E+01 -0.1147468631482395E+01 -0.1160769863126533E+01\n -0.1173720583416712E+01 -0.1186324558640121E+01 -0.1198585571849071E+01 -0.1210507421187702E+01 -0.1222093918253196E+01\n -0.1233348886491358E+01 -0.1244276159626517E+01 -0.1254879580125511E+01 -0.1265162997695628E+01 -0.1275130267816335E+01\n -0.1284785250304552E+01 -0.1294131807913390E+01 -0.1303173804963923E+01 -0.1311915106009982E+01 -0.1320359574535607E+01\n -0.1328511071684896E+01 -0.1336373455024057E+01 -0.1343950577335306E+01 -0.1351246285442432E+01 -0.1358264419067570E+01\n -0.1365008809719085E+01 -0.1371483279610062E+01 -0.1377691640607245E+01 -0.1383637693209943E+01 -0.1389325225558719E+01\n -0.1394758012473418E+01 -0.1399939814520254E+01 -0.1404874377107532E+01 -0.1409565429609723E+01 -0.1414016684519505E+01\n -0.1418231836627389E+01 -0.1422214562228558E+01 -0.1425968518356584E+01 -0.1429497342043625E+01 -0.1432804649606689E+01\n -0.1435894035959656E+01 -0.1438769073950589E+01 -0.1441433313724035E+01 -0.1443890282107847E+01 -0.1446143482024210E+01\n -0.1448196391924410E+01 -0.1450052465247018E+01 -0.1451715129899050E+01 -0.1453187787759769E+01 -0.1454473814206628E+01\n -0.1455576557663118E+01 -0.1456499339167960E+01 -0.1457245451965397E+01 -0.1457818161116118E+01 -0.1458220703128390E+01\n -0.1458456285609144E+01 -0.1458528086934452E+01 -0.1458439255939184E+01 -0.1458192911625301E+01 -0.1457792142888557E+01\n -0.1457240008263066E+01 -0.1456539535683532E+01 -0.1455693722264615E+01 -0.1454705534097164E+01 -0.1453577906060864E+01\n -0.1452313741653029E+01 -0.1450915912833076E+01 -0.1449387259882392E+01 -0.1447730591279191E+01 -0.1445948683588039E+01\n -0.1444044281363676E+01 -0.1442020097068773E+01 -0.1439878811005344E+01 -0.1437623071259354E+01 -0.1435255493658342E+01\n -0.1432778661741579E+01 -0.1430195126742490E+01 -0.1427507407583088E+01 -0.1424717990879937E+01 -0.1421829330961478E+01\n -0.1418843849896296E+01 -0.1415763937532114E+01 -0.1412591951545110E+01 -0.1409330217499327E+01 -0.1405981028915838E+01\n -0.1402546647351420E+01 -0.1399029302486348E+01 -0.1395431192221163E+01 -0.1391754482782035E+01 -0.1388001308834431E+01\n -0.1384173773604920E+01 -0.1380273949010718E+01 -0.1376303875796823E+01 -0.1372265563680394E+01 -0.1368160991502163E+01\n -0.1363992107384622E+01 -0.1359760828896748E+01 -0.1355469043224972E+01 -0.1351118607350228E+01 -0.1346711348230812E+01\n -0.1342249062990785E+01 -0.1337733519113769E+01 -0.1333166454641865E+01 -0.1328549578379474E+01 -0.1323884570101832E+01\n -0.1319173080768030E+01 -0.1314416732738336E+01 -0.1309617119995603E+01 -0.1304775808370537E+01 -0.1299894335770717E+01\n -0.1294974212413071E+01 -0.1290016921059716E+01 -0.1285023917256931E+01 -0.1279996629577071E+01 -0.1274936459863322E+01\n -0.1269844783477041E+01 -0.1264722949547587E+01 -0.1259572281224406E+01 -0.1254394075931317E+01 -0.1249189605622732E+01\n -0.1243960117041727E+01 -0.1238706831979822E+01 -0.1233430947538271E+01 -0.1228133636390794E+01 -0.1222816047047525E+01\n -0.1217479304120173E+01 -0.1212124508588114E+01 -0.1206752738065413E+01 -0.1201365047068555E+01 -0.1195962467284892E+01\n -0.1190546007841516E+01 -0.1185116655574617E+01 -0.1179675375299079E+01 -0.1174223110078329E+01 -0.1168760781494218E+01\n -0.1163289289916911E+01 -0.1157809514774660E+01 -0.1152322314823388E+01 -0.1146828528415948E+01 -0.1141328973770988E+01\n -0.1135824449241374E+01 -0.1130315733582035E+01 -0.1124803586217146E+01 -0.1119288747506621E+01 -0.1113771939011809E+01\n -0.1108253863760298E+01 -0.1102735206509786E+01 -0.1097216634010968E+01 -0.1091698795269313E+01 -0.1086182321805725E+01\n -0.1080667827915982E+01 -0.1075155910928945E+01 -0.1069647151463423E+01 -0.1064142113683687E+01 -0.1058641345553532E+01\n -0.1053145379088904E+01 -0.1047654730608969E+01 -0.1042169900985625E+01 -0.1036691375891408E+01 -0.1031219626045731E+01\n -0.1025755107459436E+01 -0.1020298261677578E+01 -0.1014849516020502E+01 -0.1009409283823040E+01 -0.1003977964671914E+01\n -0.9985559446412423E+00 -0.9931435965261650E+00 -0.9877412800745212E+00 -0.9823493422165672E+00 -0.9769681172927177E+00\n -0.9715979272792943E+00 -0.9662390820122231E+00 -0.9608918794086823E+00 -0.9555566056867116E+00 -0.9502335355826994E+00\n -0.9449229325667899E+00 -0.9396250490561532E+00 -0.9343401266261530E+00 -0.9290683962193379E+00 -0.9238100783522983E+00\n -0.9185653833203373E+00 -0.9133345113999997E+00 -0.9081176530493820E+00 -0.9029149891062611E+00 -0.8977266909840595E+00\n -0.8925529208655598E+00 -0.8873938318944620E+00 -0.8822495683646910E+00 -0.8771202659075404E+00 -0.8720060516765797E+00\n -0.8669070445303514E+00 -0.8618233552128786E+00 -0.8567550865319589E+00 -0.8517023335352547E+00 -0.8466651836841759E+00\n -0.8416437170255952E+00 -0.8366380063613471E+00 -0.8316481174155630E+00 -0.8266741089998076E+00 -0.8217160331760809E+00\n -0.8167739354176268E+00 -0.8118478547676139E+00 -0.8069378239956513E+00 -0.8020438697521995E+00 -0.7971660127208436E+00\n -0.7923042677684496E+00 -0.7874586440932471E+00 -0.7826291453708021E+00 -0.7778157698979398E+00 -0.7730185107345809E+00\n -0.7682373558435663E+00 -0.7634722882284258E+00 -0.7587232860691486E+00 -0.7539903228559367E+00 -0.7492733675209987E+00\n -0.7445723845683611E+00 -0.7398873342017247E+00 -0.7352181724504098E+00 -0.7305648512933688E+00 -0.7259273187813085E+00\n -0.7213055191569296E+00 -0.7166993929733191E+00 -0.7121088772104908E+00 -0.7075339053901175E+00 -0.7029744076884417E+00\n -0.6984303110474385E+00 -0.6939015392841926E+00 -0.6893880131985548E+00 -0.6848896506790639E+00 -0.6804063668071960E+00\n -0.6759380739599310E+00 -0.6714846819106545E+00 -0.6670460979284606E+00 -0.6626222268758263E+00 -0.6582129713047191E+00\n -0.6538182315511271E+00 -0.6494379058280859E+00 -0.6450718903171657E+00 -0.6407200792584876E+00 -0.6363823650392715E+00\n -0.6320586382809613E+00 -0.6277487879249267E+00 -0.6234527013167734E+00 -0.6191702642893190E+00 -0.6149013612442086E+00\n -0.6106458752322457E+00 -0.6064036880324198E+00 -0.6021746802297080E+00 -0.5979587312916264E+00 -0.5937557196436042E+00\n -0.5895655227431641E+00 -0.5853880171529922E+00 -0.5812230786128654E+00 -0.5770705821105107E+00 -0.5729304019514115E+00\n -0.5688024118275793E+00 -0.5646864848853448E+00 -0.5605824937921645E+00 -0.5564903108025173E+00 -0.5524098078228833E+00\n -0.5483408564758644E+00 -0.5442833281634526E+00 -0.5402370941295085E+00 -0.5362020255214600E+00 -0.5321779934512643E+00\n -0.5281648690556621E+00 -0.5241625235557782E+00 -0.5201708283160628E+00 -0.5161896549026552E+00 -0.5122188751411803E+00\n -0.5082583611740192E+00 -0.5043079855170916E+00 -0.5003676211161868E+00 -0.4964371414029022E+00 -0.4925164203501901E+00\n -0.4886053325275901E+00 -0.4847037531561659E+00 -0.4808115581632069E+00 -0.4769286242367184E+00 -0.4730548288797583E+00\n -0.4691900504646559E+00 -0.4653341682871753E+00 -0.4614870626206452E+00 -0.4576486147701215E+00 -0.4538187071266341E+00\n -0.4499972232215512E+00 -0.4461840477811270E+00 -0.4423790667812826E+00 -0.4385821675026696E+00 -0.4347932385860811E+00\n -0.4310121700882537E+00 -0.4272388535381303E+00 -0.4234731819936421E+00 -0.4197150500990645E+00 -0.4159643541430195E+00\n -0.4122209921171803E+00 -0.4084848637757519E+00 -0.4047558706957974E+00 -0.4010339163384737E+00 -0.3973189061112476E+00\n -0.3936107474311905E+00 -0.3899093497893938E+00 -0.3862146248166102E+00 -0.3825264863501910E+00 -0.3788448505024144E+00\n -0.3751696357302771E+00 -0.3715007629068495E+00 -0.3678381553942878E+00 -0.3641817391185885E+00 -0.3605314426461966E+00\n -0.3568871972625555E+00 -0.3532489370527205E+00 -0.3496165989841241E+00 -0.3459901229916214E+00 -0.3423694520649201E+00\n -0.3387545323385251E+00 -0.3351453131843082E+00 -0.3315417473068326E+00 -0.3279437908415819E+00 -0.3243514034561918E+00\n -0.3207645484548654E+00 -0.3171831928860834E+00 -0.3136073076537766E+00 -0.3100368676321130E+00 -0.3064718517840476E+00\n -0.3029122432838121E+00 -0.2993580296435038E+00 -0.2958092028439498E+00 -0.2922657594700352E+00 -0.2887277008506632E+00\n -0.2851950332035602E+00 -0.2816677677851020E+00 -0.2781459210453749E+00 -0.2746295147886844E+00 -0.2711185763397140E+00\n -0.2676131387155659E+00 -0.2641132408039054E+00 -0.2606189275474402E+00 -0.2571302501349864E+00 -0.2536472661993449E+00\n -0.2501700400222663E+00 -0.2466986427467328E+00 -0.2432331525968512E+00 -0.2397736551055949E+00 -0.2363202433506903E+00\n -0.2328730181989250E+00 -0.2294320885591435E+00 -0.2259975716442418E+00 -0.2225695932424345E+00 -0.2191482879980940E+00\n -0.2157337997024620E+00 -0.2123262815945201E+00 -0.2089258966723290E+00 -0.2055328180151234E+00 -0.2021472291164557E+00\n -0.1987693242286884E+00 -0.1953993087191055E+00 -0.1920373994379287E+00 -0.1886838250985003E+00 -0.1853388266698828E+00\n -0.1820026577821215E+00 -0.1786755851443744E+00 -0.1753578889761193E+00 -0.1720498634515968E+00 -0.1687518171576267E+00\n -0.1654640735649029E+00 -0.1621869715128154E+00 -0.1589208657078173E+00 -0.1556661272352739E+00 -0.1524231440846908E+00\n -0.1491923216881294E+00 -0.1459740834715274E+00 -0.1427688714185721E+00 -0.1395771466466322E+00 -0.1363993899941623E+00\n -0.1332361026188316E+00 -0.1300878066054895E+00 -0.1269550455829047E+00 -0.1238383853480043E+00 -0.1207384144961449E+00\n -0.1176557450556807E+00 -0.1145910131248316E+00 -0.1115448795085540E+00 -0.1085180303527610E+00 -0.1055111777728831E+00\n -0.1025250604733206E+00 -0.9956044435388604E-01 -0.9661812309881886E-01 -0.9369891874337012E-01 -0.9080368221234399E-01\n -0.8793329382426256E-01 -0.8508866375406340E-01 -0.8227073244639434E-01 -0.7948047097061904E-01 -0.7671888130764398E-01\n -0.7398699655753553E-01 -0.7128588105567601E-01 -0.6861663038386651E-01 -0.6598037126130515E-01 -0.6337826129880289E-01\n -0.6081148859784694E-01 -0.5828127117427706E-01 -0.5578885618432740E-01 -0.5333551892862030E-01 -0.5092256160742038E-01\n -0.4855131179798897E-01 -0.4622312062232615E-01 -0.4393936057086534E-01 -0.4170142294489704E-01 -0.3951071487762254E-01\n -0.3736865589081760E-01 -0.3527667394121730E-01 -0.3323620090791550E-01 -0.3124866746947142E-01 -0.2931549731709577E-01\n -0.2743810064840861E-01 -0.2561786688503255E-01 -0.2385615655688409E-01 -0.2215429229678155E-01 -0.2051354889121152E-01\n -0.1893514233719176E-01 -0.1742021786166798E-01 -0.1596983686930661E-01 -0.1458496279764457E-01 -0.1326644587608198E-01\n -0.1201500680808027E-01 -0.1083121942521028E-01 -0.9715492398480059E-02 -0.8668050137937885E-02 -0.7688913067140435E-02\n -0.6777877525966872E-02 -0.5934495634602323E-02 -0.5158055544131036E-02 -0.4447562605453990E-02 -0.3801722107660840E-02\n -0.3218924367835703E-02 -0.2697233092980475E-02 -0.2234378075199077E-02 -0.1827753413977412E-02 -0.1474422570309129E-02\n -0.1171131627019387E-02 -0.9143321317637030E-03 -0.7002148003936321E-03 -0.5247551181118452E-03 -0.3837714480605755E-03\n -0.2729955946109330E-03 -0.1881548319023403E-03 -0.1250631789481358E-03 -0.7971820570180325E-04 -0.4839798665393986E-04\n -0.2775118225470492E-04 -0.1487196131798424E-04 -0.7351058493098910E-05 -0.3295260747991843E-05 -0.1310550608265630E-05\n -0.4491803501599659E-06 -0.1275625109004752E-06 -0.2842493719500779E-07 -0.4598019108179812E-08 -0.4812641260020268E-09\n -0.2729062991232811E-10 -0.6277478184238277E-12 -0.3532884035284522E-14 -0.1843992263449434E-17 -0.1064033801639711E-22\n -0.2179574996326970E-32 -0.2191274365894180E-56 -0.5812978673716309E-216 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.8687248663605213E+00 0.1707263902374461E+01 0.2516310697140216E+01 0.3296545407385949E+01\n 0.4048635017677018E+01 0.4773233612655782E+01 0.5470982663629552E+01 0.6142511330615299E+01 0.6788436779961467E+01\n 0.7409364516870689E+01 0.8005888731517908E+01 0.8578592656974877E+01 0.9128048936794247E+01 0.9654819999856910E+01\n 0.1015945843992924E+02 0.1064250739729831E+02 0.1110450093984054E+02 0.1154596444092118E+02 0.1196741495160918E+02\n 0.1236936156481509E+02 0.1275230576911170E+02 0.1311674179017046E+02 0.1346315691793700E+02 0.1379203181786923E+02\n 0.1410384082476923E+02 0.1439905221795016E+02 0.1467812847668937E+02 0.1494152651512514E+02 0.1518969789595702E+02\n 0.1542308902250295E+02 0.1564214130885283E+02 0.1584729132803401E+02 0.1603897093826909E+02 0.1621760738756086E+02\n 0.1638362339698061E+02 0.1653743722316642E+02 0.1667946270065578E+02 0.1681010926478216E+02 0.1692978195595912E+02\n 0.1703888140625709E+02 0.1713780380924828E+02 0.1722694087415465E+02 0.1730667976538239E+02 0.1737740302856498E+02\n 0.1743948850426588E+02 0.1749330923051193E+02 0.1753923333533993E+02 0.1757762392054244E+02 0.1760883893779540E+02\n 0.1763323105833935E+02 0.1765114753736991E+02 0.1766293007427053E+02 0.1766891466979376E+02 0.1766943148126528E+02\n 0.1766480467684931E+02 0.1765535228987511E+02 0.1764138607418140E+02 0.1762321136139172E+02 0.1760112692098567E+02\n 0.1757542482398380E+02 0.1754639031101227E+02 0.1751430166546395E+02 0.1747943009241989E+02 0.1744203960394378E+02\n 0.1740238691130952E+02 0.1736072132467072E+02 0.1731728466062878E+02 0.1727231115810628E+02 0.1722602740288191E+02\n 0.1717865226109467E+02 0.1713039682197727E+02 0.1708146435003250E+02 0.1703205024682137E+02 0.1698234202248845E+02\n 0.1693251927710871E+02 0.1688275369189969E+02 0.1683320903030526E+02 0.1678404114892058E+02 0.1673539801819411E+02\n 0.1668741975280949E+02 0.1664023865162014E+02 0.1659397924698056E+02 0.1654875836329216E+02 0.1650468518455595E+02\n 0.1646186133070283E+02 0.1642038094245007E+02 0.1638033077441462E+02 0.1634179029619614E+02 0.1630483180112684E+02\n 0.1626952052237267E+02 0.1623591475605696E+02 0.1620406599106814E+02 0.1617401904520420E+02 0.1614581220729854E+02\n 0.1611947738496719E+02 0.1609504025761150E+02 0.1607252043430844E+02 0.1605193161621790E+02 0.1603328176313632E+02\n 0.1601657326382578E+02 0.1600180310974979E+02 0.1598896307184925E+02 0.1597803987999542E+02 0.1596901540476141E+02\n 0.1596186684115860E+02 0.1595656689399044E+02 0.1595308396448294E+02 0.1595138233785788E+02 0.1595142237152340E+02\n 0.1595316068356454E+02 0.1595655034122527E+02 0.1596154104908305E+02 0.1596807933662661E+02 0.1597610874495764E+02\n 0.1598557001234738E+02 0.1599640125838981E+02 0.1600853816650400E+02 0.1602191416454864E+02 0.1603646060332359E+02\n 0.1605210693274370E+02 0.1606878087548201E+02 0.1608640859789002E+02 0.1610491487801469E+02 0.1612422327054205E+02\n 0.1614425626850959E+02 0.1616493546163930E+02 0.1618618169115549E+02 0.1620791520096096E+02 0.1623005578505677E+02\n 0.1625252293110075E+02 0.1627523596000996E+02 0.1629811416152313E+02 0.1632107692564781E+02 0.1634404386992741E+02\n 0.1636693496247232E+02 0.1638967064070816E+02 0.1641217192580325E+02 0.1643436053274611E+02 0.1645615897605117E+02\n 0.1647749067108008E+02 0.1649828003097248E+02 0.1651845255918834E+02 0.1653793493767038E+02 0.1655665511064232E+02\n 0.1657454236406513E+02 0.1659152740077896E+02 0.1660754241136564E+02 0.1662252114077064E+02 0.1663639895072981E+02\n 0.1664911287805092E+02 0.1666060168880418E+02 0.1667080592848118E+02 0.1667966796818515E+02 0.1668713204691969E+02\n 0.1669314431004635E+02 0.1669765284398512E+02 0.1670060770723475E+02 0.1670196095779233E+02 0.1670166667705496E+02\n 0.1669968099028751E+02 0.1669596208374337E+02 0.1669047021852679E+02 0.1668316774128659E+02 0.1667401909183290E+02\n 0.1666299080776961E+02 0.1665005152623624E+02 0.1663517198285345E+02 0.1661832500796750E+02 0.1659948552028914E+02\n 0.1657863051802247E+02 0.1655573906758000E+02 0.1653079228997926E+02 0.1650377334501676E+02 0.1647466741331476E+02\n 0.1644346167633494E+02 0.1641014529445382E+02 0.1637470938319258E+02 0.1633714698769450E+02 0.1629745305554087E+02\n 0.1625562440799640E+02 0.1621165970977314E+02 0.1616555943740087E+02 0.1611732584629117E+02 0.1606696293657995E+02\n 0.1601447641783236E+02 0.1595987367269281E+02 0.1590316371956016E+02 0.1584435717436734E+02 0.1578346621154290E+02\n 0.1572050452422970E+02 0.1565548728383454E+02 0.1558843109898079E+02 0.1551935397393391E+02 0.1544827526656816E+02\n 0.1537521564594045E+02 0.1530019704953602E+02 0.1522324264024800E+02 0.1514437676315159E+02 0.1506362490213083E+02\n 0.1498101363641504E+02 0.1489657059707905E+02 0.1481032442355990E+02 0.1472230472024070E+02 0.1463254201315024E+02\n 0.1454106770682513E+02 0.1444791404137927E+02 0.1435311404982355E+02 0.1425670151567689E+02 0.1415871093090752E+02\n 0.1405917745424228E+02 0.1395813686987899E+02 0.1385562554663566E+02 0.1375168039756887E+02 0.1364633884009084E+02\n 0.1353963875661431E+02 0.1343161845575160E+02 0.1332231663409325E+02 0.1321177233858961E+02 0.1310002492955745E+02\n 0.1298711404433202E+02 0.1287307956158335E+02 0.1275796156631419E+02 0.1264180031555601E+02 0.1252463620477686E+02\n 0.1240650973501518E+02 0.1228746148075084E+02 0.1216753205852430E+02 0.1204676209631323E+02 0.1192519220367461E+02\n 0.1180286294265961E+02 0.1167981479950663E+02 0.1155608815711772E+02 0.1143172326832159E+02 0.1130676022992646E+02\n 0.1118123895756377E+02 0.1105519916132396E+02 0.1092868032218412E+02 0.1080172166922607E+02 0.1067436215764326E+02\n 0.1054664044753408E+02 0.1041859488347744E+02 0.1029026347488684E+02 0.1016168387713817E+02 0.1003289337346536E+02\n 0.9903928857617679E+01 0.9774826817272114E+01 0.9645623318193554E+01 0.9516353989134197E+01 0.9387054007464796E+01\n 0.9257758085527723E+01 0.9128500457703609E+01 0.8999314868181001E+01 0.8870234559419087E+01 0.8741292261293285E+01\n 0.8612520180912444E+01 0.8483949993096608E+01 0.8355612831503974E+01 0.8227539280395387E+01 0.8099759367023964E+01\n 0.7972302554638278E+01 0.7845197736086287E+01 0.7718473228007762E+01 0.7592156765602027E+01 0.7466275497958868E+01\n 0.7340855983939128E+01 0.7215924188591989E+01 0.7091505480096169E+01 0.6967624627211525E+01 0.6844305797227783E+01\n 0.6721572554397537E+01 0.6599447858839925E+01 0.6477954065901652E+01 0.6357112925962435E+01 0.6236945584671568E+01\n 0.6117472583602064E+01 0.5998713861309926E+01 0.5880688754784813E+01 0.5763416001279670E+01 0.5646913740506246E+01\n 0.5531199517183574E+01 0.5416290283926924E+01 0.5302202404464881E+01 0.5188951657171522E+01 0.5076553238901992E+01\n 0.4965021769119214E+01 0.4854371294299406E+01 0.4744615292604905E+01 0.4635766678812629E+01 0.4527837809486449E+01\n 0.4420840488382136E+01 0.4314785972074110E+01 0.4209684975792541E+01 0.4105547679460195E+01 0.4002383733918524E+01\n 0.3900202267332557E+01 0.3799011891764151E+01 0.3698820709903869E+01 0.3599636321951710E+01 0.3501465832636705E+01\n 0.3404315858366423E+01 0.3308192534496821E+01 0.3213101522713837E+01 0.3119048018517560E+01 0.3026036758800617E+01\n 0.2934072029512395E+01 0.2843157673401020E+01 0.2753297097824851E+01 0.2664493282626155E+01 0.2576748788059156E+01\n 0.2490065762765371E+01 0.2404445951788702E+01 0.2319890704624000E+01 0.2236400983291912E+01 0.2153977370433589E+01\n 0.2072620077419250E+01 0.1992328952464182E+01 0.1913103488746359E+01 0.1834942832520140E+01 0.1757845791220436E+01\n 0.1681810841551835E+01 0.1606836137557940E+01 0.1532919518665786E+01 0.1460058517700443E+01 0.1388250368865471E+01\n 0.1317492015684907E+01 0.1247780118901998E+01 0.1179111064331551E+01 0.1111480970661150E+01 0.1044885697198059E+01\n 0.9793208515582879E+00 0.9147817972939893E+00 0.8512636614565350E+00 0.7887613420918976E+00 0.7272695156654265E+00\n 0.6667826444134151E+00 0.6072949836187563E+00 0.5488005888082287E+00 0.4912933228690584E+00 0.4347668630826892E+00\n 0.3792147080735970E+00 0.3246301846712228E+00 0.2710064546832890E+00 0.2183365215789164E+00 0.1666132370796914E+00\n 0.1158293076575852E+00 0.6597730093832276E-01 0.1704965200881259E-01 -0.3096133037222471E-01 -0.7806345766145839E-01\n -0.1242646555170061E+00 -0.1695729578839355E+00 -0.2139965011800796E+00 -0.2575435185826074E+00 -0.3002223344158743E+00\n -0.3420413586411577E+00 -0.3830090814482432E+00 -0.4231340679495004E+00 -0.4624249529762802E+00 -0.5008904359780200E+00\n -0.5385392760237241E+00 -0.5753802869061535E+00 -0.6114223323483075E+00 -0.6466743213121019E+00 -0.6811452034089456E+00\n -0.7148439644120911E+00 -0.7477796218700159E+00 -0.7799612208208035E+00 -0.8113978296067292E+00 -0.8420985357887053E+00\n -0.8720724421598169E+00 -0.9013286628575624E+00 -0.9298763195738665E+00 -0.9577245378622440E+00 -0.9848824435414749E+00\n -0.1011359159194722E+01 -0.1037163800763434E+01 -0.1062305474235226E+01 -0.1086793272424552E+01 -0.1110636271845517E+01\n -0.1133843529675753E+01 -0.1156424080810253E+01 -0.1178386935004340E+01 -0.1199741074104586E+01 -0.1220495449366658E+01\n -0.1240658978858965E+01 -0.1260240544951108E+01 -0.1279248991885808E+01 -0.1297693123433412E+01 -0.1315581700627601E+01\n -0.1332923439581261E+01 -0.1349727009381238E+01 -0.1366001030060941E+01 -0.1381754070649363E+01 -0.1396994647295475E+01\n -0.1411731221466749E+01 -0.1425972198220502E+01 -0.1439725924546859E+01 -0.1453000687782247E+01 -0.1465804714091862E+01\n -0.1478146167020199E+01 -0.1490033146108215E+01 -0.1501473685575904E+01 -0.1512475753069052E+01 -0.1523047248468980E+01\n -0.1533196002763981E+01 -0.1542929776981157E+01 -0.1552256261177614E+01 -0.1561183073489532E+01 -0.1569717759238136E+01\n -0.1577867790091117E+01 -0.1585640563278520E+01 -0.1593043400861668E+01 -0.1600083549054143E+01 -0.1606768177593432E+01\n -0.1613104379162233E+01 -0.1619099168858133E+01 -0.1624759483710538E+01 -0.1630092182243682E+01 -0.1635104044084646E+01\n -0.1639801769615148E+01 -0.1644191979666060E+01 -0.1648281215253528E+01 -0.1652075937355576E+01 -0.1655582526728141E+01\n -0.1658807283759452E+01 -0.1661756428361703E+01 -0.1664436099898922E+01 -0.1666852357150144E+01 -0.1669011178306643E+01\n -0.1670918461002464E+01 -0.1672580022377071E+01 -0.1674001599169259E+01 -0.1675188847841216E+01 -0.1676147344732051E+01\n -0.1676882586239485E+01 -0.1677399989029130E+01 -0.1677704890270234E+01 -0.1677802547897067E+01 -0.1677698140895068E+01\n -0.1677396769610920E+01 -0.1676903456085609E+01 -0.1676223144409744E+01 -0.1675360701100275E+01 -0.1674320915497755E+01\n -0.1673108500183398E+01 -0.1671728091415232E+01 -0.1670184249582419E+01 -0.1668481459677102E+01 -0.1666624131783108E+01\n -0.1664616601580613E+01 -0.1662463130866198E+01 -0.1660167908087604E+01 -0.1657735048892448E+01 -0.1655168596690241E+01\n -0.1652472523227175E+01 -0.1649650729172852E+01 -0.1646707044718564E+01 -0.1643645230186273E+01 -0.1640468976647931E+01\n -0.1637181906554373E+01 -0.1633787574373395E+01 -0.1630289467236240E+01 -0.1626691005592231E+01 -0.1622995543870765E+01\n -0.1619206371150311E+01 -0.1615326711833899E+01 -0.1611359726330491E+01 -0.1607308511741977E+01 -0.1603176102555118E+01\n -0.1598965471338085E+01 -0.1594679529441171E+01 -0.1590321127701217E+01 -0.1585893057149300E+01 -0.1581398049721393E+01\n -0.1576838778971485E+01 -0.1572217860786824E+01 -0.1567537854104941E+01 -0.1562801261632051E+01 -0.1558010530562515E+01\n -0.1553168053298982E+01 -0.1548276168172963E+01 -0.1543337160165420E+01 -0.1538353261627133E+01 -0.1533326652998501E+01\n -0.1528259463528551E+01 -0.1523153771992774E+01 -0.1518011607409659E+01 -0.1512834949755512E+01 -0.1507625730677423E+01\n -0.1502385834204081E+01 -0.1497117097454231E+01 -0.1491821311342496E+01 -0.1486500221282453E+01 -0.1481155527886632E+01\n -0.1475788887663291E+01 -0.1470401913709823E+01 -0.1464996176402467E+01 -0.1459573204082366E+01 -0.1454134483737546E+01\n -0.1448681461680846E+01 -0.1443215544223580E+01 -0.1437738098344736E+01 -0.1432250452355627E+01 -0.1426753896559857E+01\n -0.1421249683908433E+01 -0.1415739030649932E+01 -0.1410223116975571E+01 -0.1404703087659131E+01 -0.1399180052691527E+01\n -0.1393655087910084E+01 -0.1388129235622212E+01 -0.1382603505223591E+01 -0.1377078873810667E+01 -0.1371556286787404E+01\n -0.1366036658466202E+01 -0.1360520872663014E+01 -0.1355009783286443E+01 -0.1349504214920848E+01 -0.1344004963403421E+01\n -0.1338512796395142E+01 -0.1333028453945557E+01 -0.1327552649051373E+01 -0.1322086068208856E+01 -0.1316629371959906E+01\n -0.1311183195431850E+01 -0.1305748148870926E+01 -0.1300324818169403E+01 -0.1294913765386324E+01 -0.1289515529261906E+01\n -0.1284130625725508E+01 -0.1278759548397190E+01 -0.1273402769082885E+01 -0.1268060738263149E+01 -0.1262733885575457E+01\n -0.1257422620290157E+01 -0.1252127331779953E+01 -0.1246848389983009E+01 -0.1241586145859656E+01 -0.1236340931842745E+01\n -0.1231113062281559E+01 -0.1225902833879501E+01 -0.1220710526125339E+01 -0.1215536401718194E+01 -0.1210380706986247E+01\n -0.1205243672299176E+01 -0.1200125512474344E+01 -0.1195026427176832E+01 -0.1189946601313249E+01 -0.1184886205419436E+01\n -0.1179845396042039E+01 -0.1174824316114016E+01 -0.1169823095324133E+01 -0.1164841850480436E+01 -0.1159880685867766E+01\n -0.1154939693599391E+01 -0.1150018953962708E+01 -0.1145118535759160E+01 -0.1140238496638358E+01 -0.1135378883426438E+01\n -0.1130539732448745E+01 -0.1125721069846856E+01 -0.1120922911890006E+01 -0.1116145265280953E+01 -0.1111388127456360E+01\n -0.1106651486881709E+01 -0.1101935323340800E+01 -0.1097239608219940E+01 -0.1092564304786787E+01 -0.1087909368463974E+01\n -0.1083274747097547E+01 -0.1078660381220247E+01 -0.1074066204309709E+01 -0.1069492143041646E+01 -0.1064938117538041E+01\n -0.1060404041610429E+01 -0.1055889822998297E+01 -0.1051395363602706E+01 -0.1046920559715141E+01 -0.1042465302241655E+01\n -0.1038029476922388E+01 -0.1033612964546500E+01 -0.1029215641162557E+01 -0.1024837378284490E+01 -0.1020478043093089E+01\n -0.1016137498633167E+01 -0.1011815604006419E+01 -0.1007512214560045E+01 -0.1003227182071147E+01 -0.9989603549270579E+00\n -0.9947115783015485E+00 -0.9904806943270184E+00 -0.9862675422627522E+00 -0.9820719586592493E+00 -0.9778937775186953E+00\n -0.9737328304516771E+00 -0.9695889468301108E+00 -0.9654619539365238E+00 -0.9613516771097025E+00 -0.9572579398867307E+00\n -0.9531805641415736E+00 -0.9491193702201466E+00 -0.9450741770719889E+00 -0.9410448023785890E+00 -0.9370310626784017E+00\n -0.9330327734886064E+00 -0.9290497494236897E+00 -0.9250818043108714E+00 -0.9211287513024286E+00 -0.9171904029850091E+00\n -0.9132665714859235E+00 -0.9093570685765163E+00 -0.9054617057726567E+00 -0.9015802944323839E+00 -0.8977126458507625E+00\n -0.8938585713520132E+00 -0.8900178823789437E+00 -0.8861903905797556E+00 -0.8823759078922311E+00 -0.8785742466254294E+00\n -0.8747852195388349E+00 -0.8710086399190866E+00 -0.8672443216543031E+00 -0.8634920793060465E+00 -0.8597517281789752E+00\n -0.8560230843882563E+00 -0.8523059649247257E+00 -0.8486001877179036E+00 -0.8449055716968552E+00 -0.8412219368489985E+00\n -0.8375491042768192E+00 -0.8338868962526480E+00 -0.8302351362714315E+00 -0.8265936491016083E+00 -0.8229622608341091E+00\n -0.8193407989295268E+00 -0.8157290922634788E+00 -0.8121269711702471E+00 -0.8085342674846857E+00 -0.8049508145824523E+00\n -0.8013764474186241E+00 -0.7978110025647080E+00 -0.7942543182440929E+00 -0.7907062343659974E+00 -0.7871665925579165E+00\n -0.7836352361966469E+00 -0.7801120104378853E+00 -0.7765967622444689E+00 -0.7730893404132703E+00 -0.7695895956008084E+00\n -0.7660973803475873E+00 -0.7626125491011952E+00 -0.7591349582382320E+00 -0.7556644660850415E+00 -0.7522009329373659E+00\n -0.7487442210788564E+00 -0.7452941947985601E+00 -0.7418507204073561E+00 -0.7384136662534099E+00 -0.7349829027366561E+00\n -0.7315583023223650E+00 -0.7281397395537861E+00 -0.7247270910639445E+00 -0.7213202355865901E+00 -0.7179190539663420E+00\n -0.7145234291680540E+00 -0.7111332462854418E+00 -0.7077483925489899E+00 -0.7043687573331715E+00 -0.7009942321630125E+00\n -0.6976247107200276E+00 -0.6942600888475667E+00 -0.6909002645555757E+00 -0.6875451380248399E+00 -0.6841946116106925E+00\n -0.6808485898462595E+00 -0.6775069794452312E+00 -0.6741696893042333E+00 -0.6708366305047628E+00 -0.6675077163147983E+00\n -0.6641828621900246E+00 -0.6608619857747765E+00 -0.6575450069026729E+00 -0.6542318475970094E+00 -0.6509224320708961E+00\n -0.6476166867272263E+00 -0.6443145401584339E+00 -0.6410159231461258E+00 -0.6377207686605807E+00 -0.6344290118601643E+00\n -0.6311405900906676E+00 -0.6278554428846229E+00 -0.6245735119605972E+00 -0.6212947412225088E+00 -0.6180190767589913E+00\n -0.6147464668428325E+00 -0.6114768619305104E+00 -0.6082102146618701E+00 -0.6049464798599574E+00 -0.6016856145310354E+00\n -0.5984275778648340E+00 -0.5951723312350204E+00 -0.5919198381999848E+00 -0.5886700645038960E+00 -0.5854229780781174E+00\n -0.5821785490429797E+00 -0.5789367497099552E+00 -0.5756975545842548E+00 -0.5724609403678959E+00 -0.5692268859632494E+00\n -0.5659953724771183E+00 -0.5627663832253617E+00 -0.5595399037381192E+00 -0.5563159217656418E+00 -0.5530944272847829E+00\n -0.5498754125061794E+00 -0.5466588718821447E+00 -0.5434448021153181E+00 -0.5402332021681084E+00 -0.5370240732729479E+00\n -0.5338174189434215E+00 -0.5306132449862715E+00 -0.5274115595143415E+00 -0.5242123729604776E+00 -0.5210156980924291E+00\n -0.5178215500287884E+00 -0.5146299462559857E+00 -0.5114409066464112E+00 -0.5082544534776542E+00 -0.5050706114529327E+00\n -0.5018894077227221E+00 -0.4987108719076290E+00 -0.4955350361225455E+00 -0.4923619350021070E+00 -0.4891916057274888E+00\n -0.4860240880545712E+00 -0.4828594243435082E+00 -0.4796976595897113E+00 -0.4765388414562883E+00 -0.4733830203079488E+00\n -0.4702302492464025E+00 -0.4670805841472636E+00 -0.4639340836984699E+00 -0.4607908094402333E+00 -0.4576508258065108E+00\n -0.4545142001680199E+00 -0.4513810028767579E+00 -0.4482513073120319E+00 -0.4451251899279745E+00 -0.4420027303025001E+00\n -0.4388840111876836E+00 -0.4357691185614755E+00 -0.4326581416807331E+00 -0.4295511731354427E+00 -0.4264483089040742E+00\n -0.4233496484099363E+00 -0.4202552945784125E+00 -0.4171653538949250E+00 -0.4140799364634484E+00 -0.4109991560653700E+00\n -0.4079231302184809E+00 -0.4048519802358120E+00 -0.4017858312840442E+00 -0.3987248124411331E+00 -0.3956690567527806E+00\n -0.3926187012873193E+00 -0.3895738871885333E+00 -0.3865347597258667E+00 -0.3835014683414236E+00 -0.3804741666930851E+00\n -0.3774530126929794E+00 -0.3744381685404753E+00 -0.3714298007487684E+00 -0.3684280801640104E+00 -0.3654331819758509E+00\n -0.3624452857181055E+00 -0.3594645752581452E+00 -0.3564912387734580E+00 -0.3535254687136594E+00 -0.3505674617460703E+00\n -0.3476174186827757E+00 -0.3446755443868791E+00 -0.3417420476554580E+00 -0.3388171410764583E+00 -0.3359010408565321E+00\n -0.3329939666165476E+00 -0.3300961411511784E+00 -0.3272077901487176E+00 -0.3243291418668700E+00 -0.3214604267599845E+00\n -0.3186018770527939E+00 -0.3157537262553701E+00 -0.3129162086136159E+00 -0.3100895584892342E+00 -0.3072740096627376E+00\n -0.3044697945526863E+00 -0.3016771433440111E+00 -0.2988962830179719E+00 -0.2961274362760575E+00 -0.2933708203499825E+00\n -0.2906266456898650E+00 -0.2878951145227867E+00 -0.2851764192741990E+00 -0.2824707408451726E+00 -0.2797782467393001E+00\n -0.2770990890342526E+00 -0.2744334021946651E+00 -0.2717813007251957E+00 -0.2691428766655449E+00 -0.2665181969328780E+00\n -0.2639073005217756E+00 -0.2613101955776174E+00 -0.2587268563663881E+00 -0.2561572201724773E+00 -0.2536011841663135E+00\n -0.2510586022957567E+00 -0.2485292822692960E+00 -0.2460129827152067E+00 -0.2435094106190135E+00 -0.2410182191615573E+00\n -0.2385390061013152E+00 -0.2360713128665393E+00 -0.2336146245440482E+00 -0.2311683709702571E+00 -0.2287319291436186E+00\n -0.2263046271825591E+00 -0.2238857500445038E+00 -0.2214745471939171E+00 -0.2190702423535930E+00 -0.2166720453861016E+00\n -0.2142791662241082E+00 -0.2118908305935776E+00 -0.2095062970515578E+00 -0.2071248745972281E+00 -0.2047459398312080E+00\n -0.2023689523724028E+00 -0.1999934670554019E+00 -0.1976191414090548E+00 -0.1952457371550912E+00 -0.1928731150462155E+00\n -0.1905012233025302E+00 -0.1881300810881581E+00 -0.1857597595959972E+00 -0.1833903639169085E+00 -0.1810220185223115E+00\n -0.1786548578143285E+00 -0.1762890213721006E+00 -0.1739246522622315E+00 -0.1715618967099617E+00 -0.1692009041513801E+00\n -0.1668418273480159E+00 -0.1644848225100573E+00 -0.1621300494242820E+00 -0.1597776715867397E+00 -0.1574278563403202E+00\n -0.1550807750173627E+00 -0.1527366030874480E+00 -0.1503955203105244E+00 -0.1480577108955310E+00 -0.1457233636646466E+00\n -0.1433926722233472E+00 -0.1410658351364051E+00 -0.1387430561099922E+00 -0.1364245441800418E+00 -0.1341105139070126E+00\n -0.1318011855772175E+00 -0.1294967854108453E+00 -0.1271975457768302E+00 -0.1249037054146965E+00 -0.1226155096635082E+00\n -0.1203332106980454E+00 -0.1180570677723090E+00 -0.1157873474704553E+00 -0.1135243239652422E+00 -0.1112682792840448E+00\n -0.1090195035824928E+00 -0.1067782954257439E+00 -0.1045449620773913E+00 -0.1023198197959724E+00 -0.1001031941390004E+00\n -0.9789542027442202E-01 -0.9569684329933507E-01 -0.9350781856577459E-01 -0.9132871201329762E-01 -0.8915990050804710E-01\n -0.8700177218790264E-01 -0.8485472681323365E-01 -0.8271917612269755E-01 -0.8059554419341119E-01 -0.7848426780471512E-01\n -0.7638579680463178E-01 -0.7430059447796174E-01 -0.7222913791482828E-01 -0.7017191837828506E-01 -0.6812944166942314E-01\n -0.6610222848819827E-01 -0.6409081478795155E-01 -0.6209575212134812E-01 -0.6011760797515669E-01 -0.5815696609097321E-01\n -0.5621442676864546E-01 -0.5429060714874503E-01 -0.5238614147002400E-01 -0.5050168129729559E-01 -0.4863789571467226E-01\n -0.4679547147851291E-01 -0.4497511312379645E-01 -0.4317754301696363E-01 -0.4140350134749559E-01 -0.3965374604968968E-01\n -0.3792905264519061E-01 -0.3623021399585374E-01 -0.3455803995547253E-01 -0.3291335690774033E-01 -0.3129700717659555E-01\n -0.2970984829376720E-01 -0.2815275210690626E-01 -0.2662660371018717E-01 -0.2513230017763598E-01 -0.2367074907776015E-01\n -0.2224286674626115E-01 -0.2084957629177444E-01 -0.1949180530768286E-01 -0.1817048326111876E-01 -0.1688653852836564E-01\n -0.1564089504398897E-01 -0.1443446852927493E-01 -0.1326816226396534E-01 -0.1214286236395461E-01 -0.1105943252668154E-01\n -0.1001870820551502E-01 -0.9021490174708021E-02 -0.8068537447652485E-02 -0.7160559513483508E-02 -0.6298207860858848E-02\n -0.5482066763324758E-02 -0.4712643308532483E-02 -0.3990356664167553E-02 -0.3315526587400327E-02 -0.2688361202633861E-02\n -0.2108944095059771E-02 -0.1577220795897805E-02 -0.1092984770086615E-02 -0.6558630595718385E-03 -0.2653017861664537E-03\n 0.7944822189490764E-04 0.3793453454019918E-03 0.6355702167323619E-03 0.8495373838452211E-03 0.1022904990027115E-02\n 0.1157581756795607E-02 0.1255730447553756E-02 0.1319766883295748E-02 0.1352353488459118E-02 0.1356386278494535E-02\n 0.1334974179358035E-02 0.1291409617048463E-02 0.1229129462600355E-02 0.1151665700113620E-02 0.1062585641275423E-02\n 0.9654221768740550E-03 0.8635954616548462E-03 0.7603285776664598E-03 0.6585610737771120E-03 0.5608657269660935E-03\n 0.4693752087118773E-03 0.3857262433307593E-03 0.3110288768033999E-03 0.2458671434387088E-03 0.1903343314865707E-03\n 0.1441011800570143E-03 0.1065093644667441E-03 0.7667716125666785E-04 0.5360156636052818E-04 0.3624338213230885E-04\n 0.2358881126340773E-04 0.1468957244294401E-04 0.8688517982512364E-05 0.4836926461183601E-05 0.2505806106186696E-05\n 0.1190778874910442E-05 0.5095498141563876E-06 0.1916497626697207E-06 0.6134629795982277E-07 0.1599283622173898E-07\n 0.3192844313628801E-08 0.4465991345509002E-09 0.3830055172706218E-10 0.1633011596692233E-11 0.2440735408533676E-13\n 0.6817882595562817E-16 0.1011756708173479E-19 0.4237417807138562E-26 0.7509788045435901E-39 0.4267446943283257E-77\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.5899841183367943E+00 0.1161355619573833E+01 0.1714505862663386E+01 0.2249819256784396E+01\n 0.2767673391510573E+01 0.3268439177645294E+01 0.3752481000506378E+01 0.4220156886514003E+01 0.4671818683172639E+01\n 0.5107812251922465E+01 0.5528477672848820E+01 0.5934149459862732E+01 0.6325156784687305E+01 0.6701823707789128E+01\n 0.7064469414269955E+01 0.7413408452670304E+01 0.7748950974623735E+01 0.8071402973330306E+01 0.8381066518882308E+01\n 0.8678239988567556E+01 0.8963218290390984E+01 0.9236293078186977E+01 0.9497752956839562E+01 0.9747883676281340E+01\n 0.9986968313100460E+01 0.1021528743874655E+02 0.1043311927348773E+02 0.1064073982542990E+02 0.1083842301406511E+02\n 0.1102644077796590E+02 0.1120506316638604E+02 0.1137455841466486E+02 0.1153519300345998E+02 0.1168723170195367E+02\n 0.1183093759528836E+02 0.1196657209658812E+02 0.1209439494401590E+02 0.1221466418339854E+02 0.1232763613702556E+02\n 0.1243356535929262E+02 0.1253270457991625E+02 0.1262530463549414E+02 0.1271161439022432E+02 0.1279188064662818E+02\n 0.1286634804714671E+02 0.1293525896749568E+02 0.1299885340267705E+02 0.1305736884654751E+02 0.1311104016584454E+02\n 0.1316009946956320E+02 0.1320477597456633E+02 0.1324529586829482E+02 0.1328188216942499E+02 0.1331475458729735E+02\n 0.1334412938091442E+02 0.1337021921827631E+02 0.1339323303679160E+02 0.1341337590546720E+02 0.1343084888954589E+02\n 0.1344584891822348E+02 0.1345856865604004E+02 0.1346919637850042E+02 0.1347791585244115E+02 0.1348490622162011E+02\n 0.1349034189796659E+02 0.1349439245888940E+02 0.1349722255100133E+02 0.1349899180057996E+02 0.1349985473104553E+02\n 0.1349996068770030E+02 0.1349945376993611E+02 0.1349847277108194E+02 0.1349715112602811E+02 0.1349561686673074E+02\n 0.1349399258566773E+02 0.1349239540728639E+02 0.1349093696745374E+02 0.1348972340089195E+02 0.1348885533655486E+02\n 0.1348842790087613E+02 0.1348853072879561E+02 0.1348924798244868E+02 0.1349065837738147E+02 0.1349283521613647E+02\n 0.1349584642903438E+02 0.1349975462196169E+02 0.1350461713095838E+02 0.1351048608338651E+02 0.1351740846544771E+02\n 0.1352542619580703E+02 0.1353457620507051E+02 0.1354489052085530E+02 0.1355639635818421E+02 0.1356911621492991E+02\n 0.1358306797202959E+02 0.1359826499818650E+02 0.1361471625877207E+02 0.1363242642864042E+02 0.1365139600856614E+02\n 0.1367162144501598E+02 0.1369309525296598E+02 0.1371580614147713E+02 0.1373973914174481E+02 0.1376487573734043E+02\n 0.1379119399636717E+02 0.1381866870525614E+02 0.1384727150393395E+02 0.1387697102209792E+02 0.1390773301634148E+02\n 0.1393952050787757E+02 0.1397229392061555E+02 0.1400601121935343E+02 0.1404062804785455E+02 0.1407609786658558E+02\n 0.1411237208990064E+02 0.1414940022246391E+02 0.1418712999471152E+02 0.1422550749716204E+02 0.1426447731339282E+02\n 0.1430398265150846E+02 0.1434396547393582E+02 0.1438436662538888E+02 0.1442512595885534E+02 0.1446618245946512E+02\n 0.1450747436611004E+02 0.1454893929069182E+02 0.1459051433488456E+02 0.1463213620430574E+02 0.1467374131999813E+02\n 0.1471526592713335E+02 0.1475664620085529E+02 0.1479781834918989E+02 0.1483871871295512E+02 0.1487928386261246E+02\n 0.1491945069200887E+02 0.1495915650896474E+02 0.1499833912267056E+02 0.1503693692786206E+02 0.1507488898574914E+02\n 0.1511213510168126E+02 0.1514861589953717E+02 0.1518427289283329E+02 0.1521904855255031E+02 0.1525288637168290E+02\n 0.1528573092652318E+02 0.1531752793469264E+02 0.1534822430994272E+02 0.1537776821374822E+02 0.1540610910372214E+02\n 0.1543319777888478E+02 0.1545898642182323E+02 0.1548342863778163E+02 0.1550647949072526E+02 0.1552809553642536E+02\n 0.1554823485261403E+02 0.1556685706626144E+02 0.1558392337803033E+02 0.1559939658396475E+02 0.1561324109447264E+02\n 0.1562542295066320E+02 0.1563590983810227E+02 0.1564467109805053E+02 0.1565167773625032E+02 0.1565690242932856E+02\n 0.1566031952888424E+02 0.1566190506332994E+02 0.1566163673755728E+02 0.1565949393049741E+02 0.1565545769064767E+02\n 0.1564951072963612E+02 0.1564163741389599E+02 0.1563182375452176E+02 0.1562005739537916E+02 0.1560632759954093E+02\n 0.1559062523411967E+02 0.1557294275356961E+02 0.1555327418152762E+02 0.1553161509126428E+02 0.1550796258481429E+02\n 0.1548231527085568E+02 0.1545467324140574E+02 0.1542503804740110E+02 0.1539341267322875E+02 0.1535980151027311E+02\n 0.1532421032954375E+02 0.1528664625344730E+02 0.1524711772676548E+02 0.1520563448690045E+02 0.1516220753344726E+02\n 0.1511684909715194E+02 0.1506957260831226E+02 0.1502039266467727E+02 0.1496932499890005E+02 0.1491638644559677E+02\n 0.1486159490806366E+02 0.1480496932470243E+02 0.1474652963520277E+02 0.1468629674652943E+02 0.1462429249875961E+02\n 0.1456053963081552E+02 0.1449506174613458E+02 0.1442788327831924E+02 0.1435902945680608E+02 0.1428852627259312E+02\n 0.1421640044406208E+02 0.1414267938293157E+02 0.1406739116037524E+02 0.1399056447333767E+02 0.1391222861107943E+02\n 0.1383241342198120E+02 0.1375114928063558E+02 0.1366846705525355E+02 0.1358439807541183E+02 0.1349897410016506E+02\n 0.1341222728654655E+02 0.1332419015847903E+02 0.1323489557611632E+02 0.1314437670563505E+02 0.1305266698949474E+02\n 0.1295980011718308E+02 0.1286580999646230E+02 0.1277073072513102E+02 0.1267459656331543E+02 0.1257744190630183E+02\n 0.1247930125792220E+02 0.1238020920450298E+02 0.1228020038938623E+02 0.1217930948803182E+02 0.1207757118370758E+02\n 0.1197502014377439E+02 0.1187169099657116E+02 0.1176761830890495E+02 0.1166283656414955E+02 0.1155738014095610E+02\n 0.1145128329257739E+02 0.1134458012680787E+02 0.1123730458653994E+02 0.1112949043093634E+02 0.1102117121721842E+02\n 0.1091238028306897E+02 0.1080315072964744E+02 0.1069351540521540E+02 0.1058350688936919E+02 0.1047315747787608E+02\n 0.1036249916810981E+02 0.1025156364508113E+02 0.1014038226805835E+02 0.1002898605777191E+02 0.9917405684197892E+01\n 0.9805671454913359E+01 0.9693813304017528E+01 0.9581860781611367E+01 0.9469843043828288E+01 0.9357788843408597E+01\n 0.9245726520809420E+01 0.9133683995842015E+01 0.9021688759828107E+01 0.8909767868266561E+01 0.8797947934001263E+01\n 0.8686255120881437E+01 0.8574715137904995E+01 0.8463353233835596E+01 0.8352194192283553E+01 0.8241262327241410E+01\n 0.8130581479064045E+01 0.8020175010883365E+01 0.7910065805447962E+01 0.7800276262377434E+01 0.7690828295821206E+01\n 0.7581743332512092E+01 0.7473042310204099E+01 0.7364745676484368E+01 0.7256873387949169E+01 0.7149444909733861E+01\n 0.7042479215386244E+01 0.6935994787073786E+01 0.6830009616114025E+01 0.6724541203818547E+01 0.6619606562640385E+01\n 0.6515222217614777E+01 0.6411404208083596E+01 0.6308168089693712E+01 0.6205528936659299E+01 0.6103501344278738E+01\n 0.6002099431696649E+01 0.5901336844901273E+01 0.5801226759948285E+01 0.5701781886401747E+01 0.5603014470983003E+01\n 0.5504936301418622E+01 0.5407558710478755E+01 0.5310892580196972E+01 0.5214948346263076E+01 0.5119736002580636E+01\n 0.5025265105980838E+01 0.4931544781084478E+01 0.4838583725304196E+01 0.4746390213979240E+01 0.4654972105634751E+01\n 0.4564336847358377E+01 0.4474491480286574E+01 0.4385442645193613E+01 0.4297196588176073E+01 0.4209759166425876E+01\n 0.4123135854085263E+01 0.4037331748177098E+01 0.3952351574603862E+01 0.3868199694209329E+01 0.3784880108896700E+01\n 0.3702396467797228E+01 0.3620752073483427E+01 0.3539949888221543E+01 0.3459992540257458E+01 0.3380882330130837E+01\n 0.3302621237012444E+01 0.3225210925059441E+01 0.3148652749783842E+01 0.3072947764429528E+01 0.2998096726353141E+01\n 0.2924100103404396E+01 0.2850958080301697E+01 0.2778670564998860E+01 0.2707237195038878E+01 0.2636657343891009E+01\n 0.2566930127267545E+01 0.2498054409416378E+01 0.2430028809386447E+01 0.2362851707262292E+01 0.2296521250364838E+01\n 0.2231035359415401E+01 0.2166391734659781E+01 0.2102587861949918E+01 0.2039621018780374E+01 0.1977488280277051E+01\n 0.1916186525135823E+01 0.1855712441508784E+01 0.1796062532835888E+01 0.1737233123619909E+01 0.1679220365142876E+01\n 0.1622020241122005E+01 0.1565628573303434E+01 0.1510041026992134E+01 0.1455253116516494E+01 0.1401260210626005E+01\n 0.1348057537820834E+01 0.1295640191612015E+01 0.1244003135710985E+01 0.1193141209147503E+01 0.1143049131314995E+01\n 0.1093721506942225E+01 0.1045152830990733E+01 0.9973374934770503E+00 0.9502697842192204E+00 0.9039438975069450E+00\n 0.8583539366947573E+00 0.8134939187180027E+00 0.7693577785309419E+00 0.7259393734669808E+00 0.6832324875204686E+00\n 0.6412308355501580E+00 0.5999280674039510E+00 0.5593177719650326E+00 0.5193934811192902E+00 0.4801486736441256E+00\n 0.4415767790185855E+00 0.4036711811552292E+00 0.3664252220536028E+00 0.3298322053757856E+00 0.2938853999441776E+00\n 0.2585780431619257E+00 0.2239033443561915E+00 0.1898544880448611E+00 0.1564246371270075E+00 0.1236069359975595E+00\n 0.9139451358676925E-01 0.5978048632501255E-01 0.2875796103333898E-01 -0.1679962259405253E-02 -0.3154018757241899E-01\n -0.6082962030108538E-01 -0.8955516461660286E-01 -0.1177237209366101E+00 -0.1453421834658722E+00 -0.1724174378064842E+00\n -0.1989563586366328E+00 -0.2249658074573321E+00 -0.2504526304061375E+00 -0.2754236561371938E+00 -0.2998856937666934E+00\n -0.3238455308829152E+00 -0.3473099316199632E+00 -0.3702856347944674E+00 -0.3927793521041590E+00 -0.4147977663876007E+00\n -0.4363475299441409E+00 -0.4574352629131093E+00 -0.4780675517114195E+00 -0.4982509475286878E+00 -0.5179919648788196E+00\n -0.5372970802072690E+00 -0.5561727305530091E+00 -0.5746253122642059E+00 -0.5926611797667505E+00 -0.6102866443846747E+00\n -0.6275079732115432E+00 -0.6443313880318098E+00 -0.6607630642913176E+00 -0.6768091301158876E+00 -0.6924756653771867E+00\n -0.7077687008048035E+00 -0.7226942171437692E+00 -0.7372581443564278E+00 -0.7514663608678986E+00 -0.7653246928540729E+00\n -0.7788389135713435E+00 -0.7920147427271221E+00 -0.8048578458902081E+00 -0.8173738339401606E+00 -0.8295682625548225E+00\n -0.8414466317350016E+00 -0.8530143853655495E+00 -0.8642769108119376E+00 -0.8752395385514281E+00 -0.8859075418380596E+00\n -0.8962861364005478E+00 -0.9063804801723496E+00 -0.9161956730529236E+00 -0.9257367566995721E+00 -0.9350087143488421E+00\n -0.9440164706668895E+00 -0.9527648916278635E+00 -0.9612587844196464E+00 -0.9695028973760704E+00 -0.9775019199350281E+00\n -0.9852604826214921E+00 -0.9927831570549439E+00 -0.1000074455980330E+01 -0.1007138833321882E+01 -0.1013980684259106E+01\n -0.1020604345324242E+01 -0.1027014094520476E+01 -0.1033214151460282E+01 -0.1039208677523227E+01 -0.1045001776032526E+01\n -0.1050597492449770E+01 -0.1055999814587213E+01 -0.1061212672836912E+01 -0.1066239940416186E+01 -0.1071085433628814E+01\n -0.1075752912141292E+01 -0.1080246079273645E+01 -0.1084568582304249E+01 -0.1088724012788046E+01 -0.1092715906887623E+01\n -0.1096547745716693E+01 -0.1100222955695317E+01 -0.1103744908916555E+01 -0.1107116923523791E+01 -0.1110342264098502E+01\n -0.1113424142057791E+01 -0.1116365716061343E+01 -0.1119170092427236E+01 -0.1121840325556284E+01 -0.1124379418364351E+01\n -0.1126790322722266E+01 -0.1129075939902947E+01 -0.1131239121035218E+01 -0.1133282667564084E+01 -0.1135209331716900E+01\n -0.1137021816975156E+01 -0.1138722778551496E+01 -0.1140314823871568E+01 -0.1141800513060382E+01 -0.1143182359432848E+01\n -0.1144462829988106E+01 -0.1145644345907359E+01 -0.1146729283054887E+01 -0.1147719972481915E+01 -0.1148618700933064E+01\n -0.1149427711355036E+01 -0.1150149203407336E+01 -0.1150785333974662E+01 -0.1151338217680745E+01 -0.1151809927403365E+01\n -0.1152202494790314E+01 -0.1152517910775978E+01 -0.1152758126098446E+01 -0.1152925051816752E+01 -0.1153020559828135E+01\n -0.1153046483385062E+01 -0.1153004617611814E+01 -0.1152896720020397E+01 -0.1152724511025663E+01 -0.1152489674459358E+01\n -0.1152193858082955E+01 -0.1151838674099132E+01 -0.1151425699661622E+01 -0.1150956477383416E+01 -0.1150432515843014E+01\n -0.1149855290088658E+01 -0.1149226242140391E+01 -0.1148546781489776E+01 -0.1147818285597133E+01 -0.1147042100386233E+01\n -0.1146219540736222E+01 -0.1145351890970717E+01 -0.1144440405343972E+01 -0.1143486308523956E+01 -0.1142490796072246E+01\n -0.1141455034920708E+01 -0.1140380163844745E+01 -0.1139267293933129E+01 -0.1138117509054281E+01 -0.1136931866318917E+01\n -0.1135711396538980E+01 -0.1134457104682830E+01 -0.1133169970326549E+01 -0.1131850948101341E+01 -0.1130500968136960E+01\n -0.1129120936501098E+01 -0.1127711735634675E+01 -0.1126274224782987E+01 -0.1124809240422688E+01 -0.1123317596684496E+01\n -0.1121800085771649E+01 -0.1120257478374031E+01 -0.1118690524077965E+01 -0.1117099951771584E+01 -0.1115486470045851E+01\n -0.1113850767591084E+01 -0.1112193513589038E+01 -0.1110515358100515E+01 -0.1108816932448459E+01 -0.1107098849596516E+01\n -0.1105361704523115E+01 -0.1103606074590946E+01 -0.1101832519911928E+01 -0.1100041583707593E+01 -0.1098233792664933E+01\n -0.1096409657287642E+01 -0.1094569672242852E+01 -0.1092714316703250E+01 -0.1090844054684662E+01 -0.1088959335379075E+01\n -0.1087060593483124E+01 -0.1085148249522008E+01 -0.1083222710168924E+01 -0.1081284368559944E+01 -0.1079333604604411E+01\n -0.1077370785290845E+01 -0.1075396264988352E+01 -0.1073410385743633E+01 -0.1071413477573506E+01 -0.1069405858753038E+01\n -0.1067387836099281E+01 -0.1065359705250640E+01 -0.1063321750941883E+01 -0.1061274247274852E+01 -0.1059217457984850E+01\n -0.1057151636702792E+01 -0.1055077027213080E+01 -0.1052993863707296E+01 -0.1050902371033679E+01 -0.1048802764942500E+01\n -0.1046695252327259E+01 -0.1044580031461829E+01 -0.1042457292233526E+01 -0.1040327216372171E+01 -0.1038189977675128E+01\n -0.1036045742228431E+01 -0.1033894668623957E+01 -0.1031736908172717E+01 -0.1029572605114311E+01 -0.1027401896822551E+01\n -0.1025224914007316E+01 -0.1023041780912662E+01 -0.1020852615511239E+01 -0.1018657529695029E+01 -0.1016456629462466E+01\n -0.1014250015101953E+01 -0.1012037781371852E+01 -0.1009820017676932E+01 -0.1007596808241376E+01 -0.1005368232278329E+01\n -0.1003134364156065E+01 -0.1000895273560783E+01 -0.9986510256561214E+00 -0.9964016812393415E+00 -0.9941472968943378E+00\n -0.9918879251414070E+00 -0.9896236145838693E+00 -0.9873544100515853E+00 -0.9850803527413915E+00 -0.9828014803544729E+00\n -0.9805178272307916E+00 -0.9782294244804987E+00 -0.9759363001124680E+00 -0.9736384791599416E+00 -0.9713359838033104E+00\n -0.9690288334901421E+00 -0.9667170450524106E+00 -0.9644006328210118E+00 -0.9620796087376083E+00 -0.9597539824638249E+00\n -0.9574237614878179E+00 -0.9550889512283189E+00 -0.9527495551361136E+00 -0.9504055747930490E+00 -0.9480570100085778E+00\n -0.9457038589139001E+00 -0.9433461180537021E+00 -0.9409837824755957E+00 -0.9386168458172143E+00 -0.9362453003910622E+00\n -0.9338691372671331E+00 -0.9314883463533257E+00 -0.9291029164737088E+00 -0.9267128354446561E+00 -0.9243180901489110E+00\n -0.9219186666075736E+00 -0.9195145500500918E+00 -0.9171057249822572E+00 -0.9146921752522568E+00 -0.9122738841148049E+00\n -0.9098508342934115E+00 -0.9074230080407725E+00 -0.9049903871973761E+00 -0.9025529532482975E+00 -0.9001106873782734E+00\n -0.8976635705250287E+00 -0.8952115834309455E+00 -0.8927547066930527E+00 -0.8902929208114043E+00 -0.8878262062358644E+00\n -0.8853545434113288E+00 -0.8828779128213984E+00 -0.8803962950305826E+00 -0.8779096707249944E+00 -0.8754180207516187E+00\n -0.8729213261561652E+00 -0.8704195682195257E+00 -0.8679127284928716E+00 -0.8654007888314326E+00 -0.8628837314269541E+00\n -0.8603615388388851E+00 -0.8578341940243193E+00 -0.8553016803666958E+00 -0.8527639817033201E+00 -0.8502210823517030E+00\n -0.8476729671347476E+00 -0.8451196214048268E+00 -0.8425610310667432E+00 -0.8399971825996356E+00 -0.8374280630778245E+00\n -0.8348536601906327E+00 -0.8322739622612096E+00 -0.8296889582643635E+00 -0.8270986378434532E+00 -0.8245029913263251E+00\n -0.8219020097403632E+00 -0.8192956848266297E+00 -0.8166840090531358E+00 -0.8140669756272810E+00 -0.8114445785074459E+00\n -0.8088168124137882E+00 -0.8061836728382580E+00 -0.8035451560538301E+00 -0.8009012591230101E+00 -0.7982519799055862E+00\n -0.7955973170657049E+00 -0.7929372700782288E+00 -0.7902718392344300E+00 -0.7876010256470514E+00 -0.7849248312546936E+00\n -0.7822432588256222E+00 -0.7795563119609465E+00 -0.7768639950972300E+00 -0.7741663135085275E+00 -0.7714632733078751E+00\n -0.7687548814482437E+00 -0.7660411457229735E+00 -0.7633220747657076E+00 -0.7605976780498430E+00 -0.7578679658874885E+00\n -0.7551329494280029E+00 -0.7523926406560499E+00 -0.7496470523892526E+00 -0.7468961982754271E+00 -0.7441400927894049E+00\n -0.7413787512294852E+00 -0.7386121897135014E+00 -0.7358404251745365E+00 -0.7330634753562915E+00 -0.7302813588081042E+00\n -0.7274940948796763E+00 -0.7247017037154513E+00 -0.7219042062487405E+00 -0.7191016241955283E+00 -0.7162939800480140E+00\n -0.7134812970679073E+00 -0.7106635992794407E+00 -0.7078409114621805E+00 -0.7050132591435788E+00 -0.7021806685913191E+00\n -0.6993431668054603E+00 -0.6965007815103690E+00 -0.6936535411464760E+00 -0.6908014748618515E+00 -0.6879446125036175E+00\n -0.6850829846091927E+00 -0.6822166223973989E+00 -0.6793455577594238E+00 -0.6764698232496565E+00 -0.6735894520763950E+00\n -0.6707044780924551E+00 -0.6678149357856630E+00 -0.6649208602692607E+00 -0.6620222872722230E+00 -0.6591192531294906E+00\n -0.6562117947721472E+00 -0.6532999497175199E+00 -0.6503837560592365E+00 -0.6474632524572266E+00 -0.6445384781276909E+00\n -0.6416094728330407E+00 -0.6386762768718036E+00 -0.6357389310685252E+00 -0.6327974767636543E+00 -0.6298519558034233E+00\n -0.6269024105297427E+00 -0.6239488837700962E+00 -0.6209914188274636E+00 -0.6180300594702640E+00 -0.6150648499223307E+00\n -0.6120958348529247E+00 -0.6091230593667976E+00 -0.6061465689942978E+00 -0.6031664096815428E+00 -0.6001826277806448E+00\n -0.5971952700400222E+00 -0.5942043835947710E+00 -0.5912100159571299E+00 -0.5882122150070307E+00 -0.5852110289827398E+00\n -0.5822065064716095E+00 -0.5791986964009260E+00 -0.5761876480288783E+00 -0.5731734109356420E+00 -0.5701560350145878E+00\n -0.5671355704636246E+00 -0.5641120677766707E+00 -0.5610855777352810E+00 -0.5580561514004118E+00 -0.5550238401043444E+00\n -0.5519886954427705E+00 -0.5489507692670410E+00 -0.5459101136765916E+00 -0.5428667810115466E+00 -0.5398208238455037E+00\n -0.5367722949785179E+00 -0.5337212474302724E+00 -0.5306677344334658E+00 -0.5276118094273992E+00 -0.5245535260517865E+00\n -0.5214929381407842E+00 -0.5184300997172553E+00 -0.5153650649872665E+00 -0.5122978883348268E+00 -0.5092286243168869E+00\n -0.5061573276585855E+00 -0.5030840532487656E+00 -0.5000088561357634E+00 -0.4969317915234724E+00 -0.4938529147677048E+00\n -0.4907722813728380E+00 -0.4876899469887706E+00 -0.4846059674081886E+00 -0.4815203985641517E+00 -0.4784332965280080E+00\n -0.4753447175076490E+00 -0.4722547178461055E+00 -0.4691633540205086E+00 -0.4660706826414067E+00 -0.4629767604524667E+00\n -0.4598816443305548E+00 -0.4567853912862148E+00 -0.4536880584645588E+00 -0.4505897031465675E+00 -0.4474903827508280E+00\n -0.4443901548357052E+00 -0.4412890771019746E+00 -0.4381872073959169E+00 -0.4350846037128897E+00 -0.4319813242013982E+00\n -0.4288774271676646E+00 -0.4257729710807258E+00 -0.4226680145780600E+00 -0.4195626164717658E+00 -0.4164568357553127E+00\n -0.4133507316108669E+00 -0.4102443634172216E+00 -0.4071377907583458E+00 -0.4040310734325635E+00 -0.4009242714623935E+00\n -0.3978174451050561E+00 -0.3947106548636826E+00 -0.3916039614992301E+00 -0.3884974260431417E+00 -0.3853911098107584E+00\n -0.3822850744155176E+00 -0.3791793817839579E+00 -0.3760740941715547E+00 -0.3729692741794092E+00 -0.3698649847718308E+00\n -0.3667612892948207E+00 -0.3636582514955066E+00 -0.3605559355425407E+00 -0.3574544060475049E+00 -0.3543537280873476E+00\n -0.3512539672278892E+00 -0.3481551895484317E+00 -0.3450574616675028E+00 -0.3419608507697824E+00 -0.3388654246342396E+00\n -0.3357712516635236E+00 -0.3326784009146562E+00 -0.3295869421310594E+00 -0.3264969457759724E+00 -0.3234084830672975E+00\n -0.3203216260139267E+00 -0.3172364474535990E+00 -0.3141530210923392E+00 -0.3110714215455339E+00 -0.3079917243806994E+00\n -0.3049140061619978E+00 -0.3018383444965689E+00 -0.2987648180827280E+00 -0.2956935067601084E+00 -0.2926244915618033E+00\n -0.2895578547685831E+00 -0.2864936799652645E+00 -0.2834320520992921E+00 -0.2803730575416270E+00 -0.2773167841500085E+00\n -0.2742633213346799E+00 -0.2712127601266646E+00 -0.2681651932486745E+00 -0.2651207151887529E+00 -0.2620794222767396E+00\n -0.2590414127636577E+00 -0.2560067869041315E+00 -0.2529756470419290E+00 -0.2499480976987507E+00 -0.2469242456663659E+00\n -0.2439042001022238E+00 -0.2408880726286486E+00 -0.2378759774357503E+00 -0.2348680313881797E+00 -0.2318643541358485E+00\n -0.2288650682287657E+00 -0.2258702992361172E+00 -0.2228801758697354E+00 -0.2198948301121145E+00 -0.2169143973491063E+00\n -0.2139390165074705E+00 -0.2109688301974238E+00 -0.2080039848603569E+00 -0.2050446309218908E+00 -0.2020909229504274E+00\n -0.1991430198213881E+00 -0.1962010848872974E+00 -0.1932652861539021E+00 -0.1903357964625070E+00 -0.1874127936787024E+00\n -0.1844964608876812E+00 -0.1815869865963202E+00 -0.1786845649422172E+00 -0.1757893959098759E+00 -0.1729016855542115E+00\n -0.1700216462315742E+00 -0.1671494968384586E+00 -0.1642854630580883E+00 -0.1614297776150348E+00 -0.1585826805380398E+00\n -0.1557444194312012E+00 -0.1529152497536538E+00 -0.1500954351078926E+00 -0.1472852475368416E+00 -0.1444849678297712E+00\n -0.1416948858371486E+00 -0.1389153007944590E+00 -0.1361465216550372E+00 -0.1333888674318927E+00 -0.1306426675484822E+00\n -0.1279082621983536E+00 -0.1251860027135053E+00 -0.1224762519412908E+00 -0.1197793846295987E+00 -0.1170957878199916E+00\n -0.1144258612484021E+00 -0.1117700177528869E+00 -0.1091286836878541E+00 -0.1065022993440523E+00 -0.1038913193734918E+00\n -0.1012962132183315E+00 -0.9871746554259221E-01 -0.9615557666540349E-01 -0.9361106299427452E-01 -0.9108445745667579E-01\n -0.8857630992797585E-01 -0.8608718765349675E-01 -0.8361767566217436E-01 -0.8116837716895883E-01 -0.7873991396273913E-01\n -0.7633292677617219E-01 -0.7394807563333809E-01 -0.7158604017067217E-01 -0.6924751992606029E-01 -0.6693323459041152E-01\n -0.6464392421534722E-01 -0.6238034936994107E-01 -0.6014329123865809E-01 -0.5793355165176966E-01 -0.5575195303860343E-01\n -0.5359933829294623E-01 -0.5147657053882339E-01 -0.4938453278367397E-01 -0.4732412744463571E-01 -0.4529627573227194E-01\n -0.4330191687455879E-01 -0.4134200716236433E-01 -0.3941751879595017E-01 -0.3752943851022626E-01 -0.3567876595462575E-01\n -0.3386651180149903E-01 -0.3209369555493235E-01 -0.3036134302986153E-01 -0.2867048346931652E-01 -0.2702214626567594E-01\n -0.2541735724993743E-01 -0.2385713451135265E-01 -0.2234248370839688E-01 -0.2087439283106441E-01 -0.1945382637408551E-01\n -0.1808171888098112E-01 -0.1675896782019106E-01 -0.1548642575704695E-01 -0.1426489178948888E-01 -0.1309510222150092E-01\n -0.1197772045673314E-01 -0.1091332610623831E-01 -0.9902403319266216E-02 -0.8945328365362132E-02 -0.8042356520369600E-02\n -0.7193608339198911E-02 -0.6399055435312237E-02 -0.5658505931682774E-02 -0.4971589801402351E-02 -0.4337744378844948E-02\n -0.3756200394787513E-02 -0.3225968971126078E-02 -0.2745830102014657E-02 -0.2314323246553361E-02 -0.1929740760130854E-02\n -0.1590124991640147E-02 -0.1293269963677403E-02 -0.1036728620523732E-02 -0.8178266578560640E-03 -0.6336839173092652E-03\n -0.4812442114554411E-03 -0.3573142088885663E-03 -0.2586116204308245E-03 -0.1818223529741868E-03 -0.1236655132753167E-03\n -0.8096414791917507E-04 -0.5071843506793948E-04 -0.3017679859046307E-04 -0.1689928305171012E-04 -0.8806800438416483E-05\n -0.4209924174242123E-05 -0.1812186230608453E-05 -0.6856430207874943E-06 -0.2207762234777510E-06 -0.5789808120346374E-07\n -0.1162764438867681E-07 -0.1636092194626611E-08 -0.1411469196261160E-09 -0.6053864648970130E-11 -0.9102103938482552E-13\n -0.2557695550579744E-15 -0.3818161159862620E-19 -0.1608640056516381E-25 -0.2867908542943528E-38 -0.1639405452192707E-76\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.1490972894185426E+01 0.2898594369705328E+01 0.4226102647398204E+01 0.5476628578286624E+01\n 0.6653199649346901E+01 0.7758744314426550E+01 0.8796096630727330E+01 0.9768001136837229E+01 0.1067711788189623E+02\n 0.1152602750277483E+02 0.1231723624359168E+02 0.1305318081663842E+02 0.1373623301352756E+02 0.1436870398832137E+02\n 0.1495284814912227E+02 0.1549086661002188E+02 0.1598491017060163E+02 0.1643708180475745E+02 0.1684943865406904E+02\n 0.1722399353297733E+02 0.1756271596351480E+02 0.1786753276618034E+02 0.1814032824076472E+02 0.1838294397656276E+02\n 0.1859717833554092E+02 0.1878478565478038E+02 0.1894747521601122E+02 0.1908691003043678E+02 0.1920470548645839E+02\n 0.1930242790649218E+02 0.1938159305696006E+02 0.1944366465286470E+02 0.1949005289524725E+02 0.1952211307638757E+02\n 0.1954114428394226E+02 0.1954838823141548E+02 0.1954502823850324E+02 0.1953218838101044E+02 0.1951093282627426E+02\n 0.1948226536638306E+02 0.1944712915800228E+02 0.1940640667433629E+02 0.1936091987169615E+02 0.1931143057032402E+02\n 0.1925864104655939E+02 0.1920319483112569E+02 0.1914567770627270E+02 0.1908661889272693E+02 0.1902649241587448E+02\n 0.1896571863932183E+02 0.1890466595293786E+02 0.1884365260166379E+02 0.1878294864077429E+02 0.1872277800286541E+02\n 0.1866332066162236E+02 0.1860471487736171E+02 0.1854705950943718E+02 0.1849041638082738E+02 0.1843481268057272E+02\n 0.1838024339018270E+02 0.1832667372067947E+02 0.1827404154756324E+02 0.1822225983166999E+02 0.1817121901462569E+02\n 0.1812078937837576E+02 0.1807082335907063E+02 0.1802115780640943E+02 0.1797161618037463E+02 0.1792201067812283E+02\n 0.1787214428462332E+02 0.1782181274145043E+02 0.1777080642893208E+02 0.1771891215763021E+02 0.1766591486587512E+02\n 0.1761159922079143E+02 0.1755575112093501E+02 0.1749815909930632E+02 0.1743861562611338E+02 0.1737691831122648E+02\n 0.1731287100679569E+02 0.1724628481099027E+02 0.1717697897426687E+02 0.1710478170998087E+02 0.1702953091152244E+02\n 0.1695107477848783E+02 0.1686927235468663E+02 0.1678399398103932E+02 0.1669512166663813E+02 0.1660254938142798E+02\n 0.1650618327411663E+02 0.1640594181904419E+02 0.1630175589583457E+02 0.1619356880571659E+02 0.1608133622844232E+02\n 0.1596502612374653E+02 0.1584461858128563E+02 0.1572010562296940E+02 0.1559149096155470E+02 0.1545878971931102E+02\n 0.1532202811049239E+02 0.1518124309126241E+02 0.1503648198061937E+02 0.1488780205575875E+02 0.1473527012519185E+02\n 0.1457896208281294E+02 0.1441896244597594E+02 0.1425536388050388E+02 0.1408826671541400E+02 0.1391777844999757E+02\n 0.1374401325574798E+02 0.1356709147548415E+02 0.1338713912187045E+02 0.1320428737738750E+02 0.1301867209766444E+02\n 0.1283043331994052E+02 0.1263971477828357E+02 0.1244666342705594E+02 0.1225142897398476E+02 0.1205416342406364E+02\n 0.1185502063538666E+02 0.1165415588789458E+02 0.1145172546589620E+02 0.1124788625511554E+02 0.1104279535490879E+02\n 0.1083660970619294E+02 0.1062948573553064E+02 0.1042157901572463E+02 0.1021304394318828E+02 0.1000403343227721E+02\n 0.9794698626690922E+01 0.9585188627981971E+01 0.9375650241143855E+01 0.9166227737187679E+01 0.8957062632560726E+01\n 0.8748293485208164E+01 0.8540055707031815E+01 0.8332481392456542E+01 0.8125699162775922E+01 0.7919834025914198E+01\n 0.7715007251210231E+01 0.7511336258802102E+01 0.7308934523167021E+01 0.7107911490350968E+01 0.6908372508405361E+01\n 0.6710418770533413E+01 0.6514147270438017E+01 0.6319650769353934E+01 0.6127017774240882E+01 0.5936332526610492E+01\n 0.5747675001458052E+01 0.5561120915770464E+01 0.5376741746084129E+01 0.5194604754569927E+01 0.5014773023128366E+01\n 0.4837305494984530E+01 0.4662257023280675E+01 0.4489678426173787E+01 0.4319616547955467E+01 0.4152114325723103E+01\n 0.3987210861143229E+01 0.3824941496860732E+01 0.3665337897121076E+01 0.3508428132186630E+01 0.3354236766142388E+01\n 0.3202784947701370E+01 0.3054090503634531E+01 0.2908168034465503E+01 0.2765029012085665E+01 0.2624681878960210E+01\n 0.2487132148611466E+01 0.2352382507080828E+01 0.2220432915085888E+01 0.2091280710604522E+01 0.1964920711632258E+01\n 0.1841345318874233E+01 0.1720544618147173E+01 0.1602506482281042E+01 0.1487216672323735E+01 0.1374658937865809E+01\n 0.1264815116314972E+01 0.1157665230963353E+01 0.1053187587702279E+01 0.9513588702517990E+00 0.8521542337834218E+00\n 0.7555473968256491E+00 0.6615107313528323E+00 0.5700153509680036E+00 0.4810311971000716E+00 0.3945271231455855E+00\n 0.3104709764939235E+00 0.2288296783834506E+00 0.1495693015446019E+00 0.7265514559315535E-01 -0.1948189855172862E-02\n -0.7427673437111640E-01 -0.1443670782148313E+00 -0.2122563061647371E+00 -0.2779819336760306E+00 -0.3415818453668393E+00\n -0.4030942358252462E+00 -0.4625575527254874E+00 -0.5200104422372566E+00 -0.5754916967079484E+00 -0.6290402045940768E+00\n -0.6806949026143181E+00 -0.7304947300937417E+00 -0.7784785854658435E+00 -0.8246852848961586E+00 -0.8691535229891830E+00\n -0.9119218355379459E+00 -0.9530285642737767E+00 -0.9925118235722190E+00 -0.1030409469069388E+01 -0.1066759068142054E+01\n -0.1101597872203433E+01 -0.1134962790765932E+01 -0.1166890367221378E+01 -0.1197416756288568E+01 -0.1226577703077706E+01\n -0.1254408523721037E+01 -0.1280944087518682E+01 -0.1306218800548890E+01 -0.1330266590691901E+01 -0.1353120894016819E+01\n -0.1374814642481296E+01 -0.1395380252894130E+01 -0.1414849617091440E+01 -0.1433254093277628E+01 -0.1450624498482941E+01\n -0.1466991102090209E+01 -0.1482383620384031E+01 -0.1496831212076521E+01 -0.1510362474764622E+01 -0.1523005442274803E+01\n -0.1534787582851975E+01 -0.1545735798150416E+01 -0.1555876422985430E+01 -0.1565235225805577E+01 -0.1573837409846275E+01\n -0.1581707614926664E+01 -0.1588869919852685E+01 -0.1595347845390397E+01 -0.1601164357774630E+01 -0.1606341872719178E+01\n -0.1610902259895794E+01 -0.1614866847850344E+01 -0.1618256429325549E+01 -0.1621091266960840E+01 -0.1623391099340840E+01\n -0.1625175147365167E+01 -0.1626462120913114E+01 -0.1627270225777996E+01 -0.1627617170846768E+01 -0.1627520175501631E+01\n -0.1626995977221341E+01 -0.1626060839360731E+01 -0.1624730559088164E+01 -0.1623020475461238E+01 -0.1620945477622288E+01\n -0.1618520013095815E+01 -0.1615758096171077E+01 -0.1612673316353719E+01 -0.1609278846871282E+01 -0.1605587453218097E+01\n -0.1601611501725963E+01 -0.1597362968147642E+01 -0.1592853446240992E+01 -0.1588094156342277E+01 -0.1583095953917781E+01\n -0.1577869338083636E+01 -0.1572424460084281E+01 -0.1566771131720695E+01 -0.1560918833720039E+01 -0.1554876724038992E+01\n -0.1548653646093535E+01 -0.1542258136908566E+01 -0.1535698435181091E+01 -0.1528982489251385E+01 -0.1522117964976844E+01\n -0.1515112253503763E+01 -0.1507972478932725E+01 -0.1500705505873594E+01 -0.1493317946886631E+01 -0.1485816169806484E+01\n -0.1478206304946291E+01 -0.1470494252179348E+01 -0.1462685687896228E+01 -0.1454786071835450E+01 -0.1446800653786156E+01\n -0.1438734480161472E+01 -0.1430592400441542E+01 -0.1422379073485444E+01 -0.1414098973711402E+01 -0.1405756397145003E+01\n -0.1397355467335255E+01 -0.1388900141138563E+01 -0.1380394214370867E+01 -0.1371841327328378E+01 -0.1363244970177461E+01\n -0.1354608488214437E+01 -0.1345935086996126E+01 -0.1337227837342175E+01 -0.1328489680210275E+01 -0.1319723431445484E+01\n -0.1310931786405037E+01 -0.1302117324460026E+01 -0.1293282513375510E+01 -0.1284429713570631E+01 -0.1275561182260429E+01\n -0.1266679077481073E+01 -0.1257785462000340E+01 -0.1248882307115163E+01 -0.1239971496338172E+01 -0.1231054828975166E+01\n -0.1222134023595495E+01 -0.1213210721397372E+01 -0.1204286489470143E+01 -0.1195362823955608E+01 -0.1186441153110434E+01\n -0.1177522840271803E+01 -0.1168609186728368E+01 -0.1159701434498662E+01 -0.1150800769019061E+01 -0.1141908321743441E+01\n -0.1133025172656630E+01 -0.1124152352703810E+01 -0.1115290846137928E+01 -0.1106441592787264E+01 -0.1097605490245227E+01\n -0.1088783395984451E+01 -0.1079976129397275E+01 -0.1071184473764625E+01 -0.1062409178155359E+01 -0.1053650959258049E+01\n -0.1044910503147221E+01 -0.1036188466985990E+01 -0.1027485480667053E+01 -0.1018802148393944E+01 -0.1010139050204464E+01\n -0.1001496743438119E+01 -0.9928757641494527E+00 -0.9842766284690484E+00 -0.9756998339140143E+00 -0.9671458606496940E+00\n -0.9586151727043447E+00 -0.9501082191384856E+00 -0.9416254351705762E+00 -0.9331672432606939E+00 -0.9247340541538072E+00\n -0.9163262678842421E+00 -0.9079442747428956E+00 -0.8995884562087340E+00 -0.8912591858460664E+00 -0.8829568301690750E+00\n -0.8746817494750385E+00 -0.8664342986476723E+00 -0.8582148279319598E+00 -0.8500236836818522E+00 -0.8418612090821510E+00\n -0.8337277448458742E+00 -0.8256236298884094E+00 -0.8175492019796625E+00 -0.8095047983754566E+00 -0.8014907564293513E+00\n -0.7935074141860654E+00 -0.7855551109576326E+00 -0.7776341878834073E+00 -0.7697449884750045E+00 -0.7618878591472366E+00\n -0.7540631497360738E+00 -0.7462712140046344E+00 -0.7385124101381848E+00 -0.7307871012290940E+00 -0.7230956557526664E+00\n -0.7154384480347357E+00 -0.7078158587119011E+00 -0.7002282751852088E+00 -0.6926760920681024E+00 -0.6851597116293913E+00\n -0.6776795442319780E+00 -0.6702360087680368E+00 -0.6628295330912921E+00 -0.6554605544470310E+00 -0.6481295199004043E+00\n -0.6408368867635551E+00 -0.6335831230220497E+00 -0.6263687077610380E+00 -0.6191941315915128E+00 -0.6120598970769715E+00\n -0.6049665191607240E+00 -0.5979145255940220E+00 -0.5909044573650831E+00 -0.5839368691290320E+00 -0.5770123296386506E+00\n -0.5701314221757601E+00 -0.5632947449829158E+00 -0.5565029116949882E+00 -0.5497565517700718E+00 -0.5430563109189926E+00\n -0.5364028515325477E+00 -0.5297968531054059E+00 -0.5232390126554224E+00 -0.5167300451368810E+00 -0.5102706838459522E+00\n -0.5038616808163805E+00 -0.4975038072031411E+00 -0.4911978536514589E+00 -0.4849446306482554E+00 -0.4787449688526985E+00\n -0.4725997194020929E+00 -0.4665097541888966E+00 -0.4604759661041344E+00 -0.4544992692419215E+00 -0.4485805990591846E+00\n -0.4427209124840173E+00 -0.4369211879653461E+00 -0.4311824254558134E+00 -0.4255056463188713E+00 -0.4198918931501576E+00\n -0.4143422295021775E+00 -0.4088577395001772E+00 -0.4034395273358983E+00 -0.3980887166245596E+00 -0.3928064496090112E+00\n -0.3875938861934557E+00 -0.3824522027875051E+00 -0.3773825909395854E+00 -0.3723862557368422E+00 -0.3674644139467203E+00\n -0.3626182918733373E+00 -0.3578491228995945E+00 -0.3531581446837392E+00 -0.3485465959768078E+00 -0.3440157130250673E+00\n -0.3395667255192788E+00 -0.3352008520504021E+00 -0.3309192950292724E+00 -0.3267232350259450E+00 -0.3226138244828918E+00\n -0.3185921807551977E+00 -0.3146593784305226E+00 -0.3108164408820478E+00 -0.3070643310091922E+00 -0.3034039411238457E+00\n -0.2998360819446073E+00 -0.2963614706684425E+00 -0.2929807180988327E+00 -0.2896943148224383E+00 -0.2865026164432708E+00\n -0.2834058279051005E+00 -0.2804039869602682E+00 -0.2774969468771566E+00 -0.2746843585203667E+00 -0.2719656519882723E+00\n -0.2693400180531267E+00 -0.2668063897203013E+00 -0.2643634243062732E+00 -0.2620094865300300E+00 -0.2597426332192892E+00\n -0.2575606003500299E+00 -0.2554607932624695E+00 -0.2534402810239623E+00 -0.2514957960316366E+00 -0.2496237400535760E+00\n -0.2478201979810306E+00 -0.2460809605838598E+00 -0.2444015574991944E+00 -0.2427773015044900E+00 -0.2412033447902379E+00\n -0.2396747474109387E+00 -0.2381865573144384E+00 -0.2367339003009647E+00 -0.2353120769446503E+00 -0.2339166619743637E+00\n -0.2325435999910598E+00 -0.2311892899420583E+00 -0.2298506498591054E+00 -0.2285251535007102E+00 -0.2272108322697357E+00\n -0.2259062395150722E+00 -0.2246103800296458E+00 -0.2233226143482858E+00 -0.2220425533758296E+00 -0.2207699612307818E+00\n -0.2195046807982463E+00 -0.2182465877415019E+00 -0.2169955687347858E+00 -0.2157515141286527E+00 -0.2145143163564465E+00\n -0.2132838697320672E+00 -0.2120600704271507E+00 -0.2108428164580473E+00 -0.2096320076725845E+00 -0.2084275457364440E+00\n -0.2072293341191706E+00 -0.2060372780798283E+00 -0.2048512846523208E+00 -0.2036712626303956E+00 -0.2024971225523388E+00\n -0.2013287766853885E+00 -0.2001661390098699E+00 -0.1990091252030775E+00 -0.1978576526229085E+00 -0.1967116402912710E+00\n -0.1955710088772761E+00 -0.1944356806802258E+00 -0.1933055796124141E+00 -0.1921806311817510E+00 -0.1910607624742264E+00\n -0.1899459021362168E+00 -0.1888359803566597E+00 -0.1877309288490946E+00 -0.1866306808335939E+00 -0.1855351710185818E+00\n -0.1844443355825659E+00 -0.1833581121557800E+00 -0.1822764398017569E+00 -0.1811992589988340E+00 -0.1801265116216080E+00\n -0.1790581409223451E+00 -0.1779940915123532E+00 -0.1769343093433298E+00 -0.1758787416886912E+00 -0.1748273371248939E+00\n -0.1737800455127509E+00 -0.1727368179787582E+00 -0.1716976068964338E+00 -0.1706623658676789E+00 -0.1696310497041661E+00\n -0.1686036144087650E+00 -0.1675800171570109E+00 -0.1665602162786198E+00 -0.1655441712390600E+00 -0.1645318426211851E+00\n -0.1635231921069348E+00 -0.1625181824591057E+00 -0.1615167775032033E+00 -0.1605189421093761E+00 -0.1595246421744391E+00\n -0.1585338446039885E+00 -0.1575465172946173E+00 -0.1565626291162327E+00 -0.1555821498944797E+00 -0.1546050503932762E+00\n -0.1536313022974632E+00 -0.1526608781955763E+00 -0.1516937515627348E+00 -0.1507298967436624E+00 -0.1497692889358336E+00\n -0.1488119041727559E+00 -0.1478577193073842E+00 -0.1469067119956771E+00 -0.1459588606802934E+00 -0.1450141445744331E+00\n -0.1440725436458233E+00 -0.1431340386008554E+00 -0.1421986108688733E+00 -0.1412662425866119E+00 -0.1403369165827954E+00\n -0.1394106163628882E+00 -0.1384873260940094E+00 -0.1375670305900030E+00 -0.1366497152966734E+00 -0.1357353662771839E+00\n -0.1348239701976193E+00 -0.1339155143127141E+00 -0.1330099864517488E+00 -0.1321073750046149E+00 -0.1312076689080463E+00\n -0.1303108576320237E+00 -0.1294169311663473E+00 -0.1285258800073831E+00 -0.1276376951449777E+00 -0.1267523680495491E+00\n -0.1258698906593478E+00 -0.1249902553678929E+00 -0.1241134550115789E+00 -0.1232394828574590E+00 -0.1223683325912011E+00\n -0.1214999983052166E+00 -0.1206344744869641E+00 -0.1197717560074267E+00 -0.1189118381097634E+00 -0.1180547163981319E+00\n -0.1172003868266877E+00 -0.1163488456887531E+00 -0.1155000896061621E+00 -0.1146541155187737E+00 -0.1138109206741603E+00\n -0.1129705026174663E+00 -0.1121328591814367E+00 -0.1112979884766172E+00 -0.1104658888817227E+00 -0.1096365590341772E+00\n -0.1088099978208190E+00 -0.1079862043687761E+00 -0.1071651780365066E+00 -0.1063469184050076E+00 -0.1055314252691870E+00\n -0.1047186986294014E+00 -0.1039087386831581E+00 -0.1031015458169785E+00 -0.1022971205984247E+00 -0.1014954637682864E+00\n -0.1006965762329294E+00 -0.9990045905680092E-01 -0.9910711345509600E-01 -0.9831654078657849E-01 -0.9752874254656095E-01\n -0.9674372036003734E-01 -0.9596147597497186E-01 -0.9518201125574054E-01 -0.9440532817672517E-01 -0.9363142881605759E-01\n -0.9286031534951537E-01 -0.9209199004456679E-01 -0.9132645525456264E-01 -0.9056371341307594E-01 -0.8980376702838780E-01\n -0.8904661867811879E-01 -0.8829227100400254E-01 -0.8754072670680409E-01 -0.8679198854137972E-01 -0.8604605931187735E-01\n -0.8530294186707681E-01 -0.8456263909586934E-01 -0.8382515392287562E-01 -0.8309048930419941E-01 -0.8235864822331807E-01\n -0.8162963368710800E-01 -0.8090344872200475E-01 -0.8018009637029486E-01 -0.7945957968654156E-01 -0.7874190173414135E-01\n -0.7802706558201103E-01 -0.7731507430140443E-01 -0.7660593096285831E-01 -0.7589963863326689E-01 -0.7519620037308256E-01\n -0.7449561923364434E-01 -0.7379789825463164E-01 -0.7310304046164423E-01 -0.7241104886390530E-01 -0.7172192645209033E-01\n -0.7103567619627764E-01 -0.7035230104402376E-01 -0.6967180391855922E-01 -0.6899418771710759E-01 -0.6831945530932572E-01\n -0.6764760953586510E-01 -0.6697865320705315E-01 -0.6631258910169627E-01 -0.6564941996600249E-01 -0.6498914851262336E-01\n -0.6433177741981720E-01 -0.6367730933073025E-01 -0.6302574685279916E-01 -0.6237709255727147E-01 -0.6173134897884694E-01\n -0.6108851861543815E-01 -0.6044860392805121E-01 -0.5981160734078578E-01 -0.5917753124095684E-01 -0.5854637797933600E-01\n -0.5791814987051506E-01 -0.5729284919339011E-01 -0.5667047819176833E-01 -0.5605103907509822E-01 -0.5543453401932198E-01\n -0.5482096516785345E-01 -0.5421033463268072E-01 -0.5360264449559476E-01 -0.5299789680954505E-01 -0.5239609360012387E-01\n -0.5179723686717961E-01 -0.5120132858656160E-01 -0.5060837071199547E-01 -0.5001836517709381E-01 -0.4943131389750106E-01\n -0.4884721877317583E-01 -0.4826608169081145E-01 -0.4768790452639723E-01 -0.4711268914792258E-01 -0.4654043741822612E-01\n -0.4597115119799098E-01 -0.4540483234889028E-01 -0.4484148273688456E-01 -0.4428110423567344E-01 -0.4372369873030461E-01\n -0.4316926812094350E-01 -0.4261781432680625E-01 -0.4206933929025882E-01 -0.4152384498108628E-01 -0.4098133340093556E-01\n -0.4044180658793538E-01 -0.3990526662149652E-01 -0.3937171562729746E-01 -0.3884115578245902E-01 -0.3831358932091222E-01\n -0.3778901853896358E-01 -0.3726744580106369E-01 -0.3674887354578273E-01 -0.3623330429199824E-01 -0.3572074064530062E-01\n -0.3521118530462180E-01 -0.3470464106909250E-01 -0.3420111084513349E-01 -0.3370059765378802E-01 -0.3320310463829990E-01\n -0.3270863507194550E-01 -0.3221719236612464E-01 -0.3172878007871772E-01 -0.3124340192271698E-01 -0.3076106177513717E-01\n -0.3028176368621473E-01 -0.2980551188890199E-01 -0.2933231080866432E-01 -0.2886216507358872E-01 -0.2839507952481046E-01\n -0.2793105922726807E-01 -0.2747010948079293E-01 -0.2701223583154306E-01 -0.2655744408378990E-01 -0.2610574031206566E-01\n -0.2565713087368143E-01 -0.2521162242162311E-01 -0.2476922191783597E-01 -0.2432993664690480E-01 -0.2389377423013912E-01\n -0.2346074264007272E-01 -0.2303085021538444E-01 -0.2260410567625017E-01 -0.2218051814013276E-01 -0.2176009713801780E-01\n -0.2134285263110349E-01 -0.2092879502794953E-01 -0.2051793520209298E-01 -0.2011028451013516E-01 -0.1970585481030489E-01\n -0.1930465848150186E-01 -0.1890670844282149E-01 -0.1851201817356444E-01 -0.1812060173372857E-01 -0.1773247378498237E-01\n -0.1734764961211651E-01 -0.1696614514496612E-01 -0.1658797698079692E-01 -0.1621316240714285E-01 -0.1584171942508113E-01\n -0.1547366677292802E-01 -0.1510902395033159E-01 -0.1474781124273767E-01 -0.1439004974619603E-01 -0.1403576139247217E-01\n -0.1368496897442080E-01 -0.1333769617157242E-01 -0.1299396757587675E-01 -0.1265380871753636E-01 -0.1231724609085785E-01\n -0.1198430718003442E-01 -0.1165502048476427E-01 -0.1132941554559642E-01 -0.1100752296888000E-01 -0.1068937445118038E-01\n -0.1037500280300520E-01 -0.1006444197166726E-01 -0.9757727063089234E-02 -0.9454894362331736E-02 -0.9155981352602857E-02\n -0.8861026732477590E-02 -0.8570070431026370E-02 -0.8283153620518910E-02 -0.8000318726330972E-02 -0.7721609433644288E-02\n -0.7447070690483597E-02 -0.7176748706588126E-02 -0.6910690947562739E-02 -0.6648946123695469E-02 -0.6391564172768492E-02\n -0.6138596236119977E-02 -0.5890094627143023E-02 -0.5646112791328837E-02 -0.5406705256875357E-02 -0.5171927574793084E-02\n -0.4941836247340325E-02 -0.4716488643516831E-02 -0.4495942900234213E-02 -0.4280257807663031E-02 -0.4069492677135494E-02\n -0.3863707189852578E-02 -0.3662961224513759E-02 -0.3467314661850819E-02 -0.3276827163911870E-02 -0.3091557925807099E-02\n -0.2911565397496689E-02 -0.2736906973081798E-02 -0.2567638644951017E-02 -0.2403814620049312E-02 -0.2245486895479086E-02\n -0.2092704790623673E-02 -0.1945514433017997E-02 -0.1803958195289058E-02 -0.1668074080673803E-02 -0.1537895054912087E-02\n -0.1413448322734187E-02 -0.1294754547748605E-02 -0.1181827015318322E-02 -0.1074670739037643E-02 -0.9732815127318119E-03\n -0.8776449115510747E-03 -0.7877352477807324E-03 -0.7035144894988547E-03 -0.6249311532533495E-03 -0.5519191855637202E-03\n -0.4843968523409821E-03 -0.4222656603112821E-03 -0.3654093402469373E-03 -0.3136929282422736E-03 -0.2669619883460904E-03\n -0.2250420274226155E-03 -0.1877381608793739E-03 -0.1548350954324305E-03 -0.1260975017208530E-03 -0.1012708544007759E-03\n -0.8008281908161370E-04 -0.6224526246190971E-04 -0.4745695222159778E-04 -0.3540699419800758E-04 -0.2577902344419184E-04\n -0.1825612034243538E-04 -0.1252636105889374E-04 -0.8288832859917125E-05 -0.5259851630896392E-05 -0.3179018438370757E-05\n -0.1814657830647114E-05 -0.9681145896094296E-06 -0.4763777092066571E-06 -0.2125847804801365E-06 -0.8416563922630169E-07\n -0.2871694661282378E-07 -0.8118483409326055E-08 -0.1800875019886702E-08 -0.2899912795055122E-09 -0.3021521412802248E-10\n -0.1705617717949463E-11 -0.3905505511147667E-13 -0.2187979755795985E-15 -0.1136823060733138E-18 -0.6529908184057616E-24\n -0.1331494455842040E-33 -0.1332533824576676E-57 -0.3518780789111388E-217 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.2980561953329615E-01 0.5916214233164482E-01 0.8807376775591262E-01 0.1165446070923979E+00\n 0.1445785896945104E+00 0.1721793127131528E+00 0.1993498372288393E+00 0.2260924395124203E+00 0.2524083296657185E+00\n 0.2782973516026372E+00 0.3037576786932059E+00 0.3287855187856478E+00 0.3533748410476745E+00 0.3775171353675275E+00\n 0.4012012131151563E+00 0.4244130560281678E+00 0.4471357179640750E+00 0.4693492823288160E+00 0.4910308762069837E+00\n 0.5121547406179706E+00 0.5326923549257166E+00 0.5526126122474077E+00 0.5718820417388514E+00 0.5904650728749644E+00\n 0.6083243362816283E+00 0.6254209952953163E+00 0.6417151022124156E+00 0.6571659731229090E+00 0.6717325752842186E+00\n 0.6853739211620790E+00 0.6980494635281584E+00 0.7097194863416821E+00 0.7203454865385274E+00 0.7298905422913191E+00\n 0.7383196637747241E+00 0.7456001229593330E+00 0.7517017594547573E+00 0.7565972599187180E+00 0.7602624090360081E+00\n 0.7626763105428430E+00 0.7638215772227638E+00 0.7636844892256079E+00 0.7622551204578512E+00 0.7595274331582714E+00\n 0.7554993411058685E+00 0.7501727422062439E+00 0.7435535214678834E+00 0.7356515256112056E+00 0.7264805107514307E+00\n 0.7160580647622865E+00 0.7044055060626673E+00 0.6915477606740609E+00 0.6775132194747052E+00 0.6623335776287783E+00\n 0.6460436581976104E+00 0.6286812219467698E+00 0.6102867653501249E+00 0.5909033087616116E+00 0.5705761766794121E+00\n 0.5493527719676207E+00 0.5272823458290659E+00 0.5044157652415996E+00 0.4808052794806210E+00 0.4565042872543610E+00\n 0.4315671058772241E+00 0.4060487438014351E+00 0.3800046777198434E+00 0.3534906353440669E+00 0.3265623848532687E+00\n 0.2992755319008061E+00 0.2716853249594787E+00 0.2438464696819385E+00 0.2158129528517275E+00 0.1876378764027582E+00\n 0.1593733018915083E+00 0.1310701057169563E+00 0.1027778452988341E+00 0.7454463634517153E-01 0.4641704126567402E-01\n 0.1843996871823178E-01 -0.9343415788128404E-02 -0.3689176836917064E-01 -0.6416563450906662E-01 -0.9112750630870141E-01\n -0.1177418695188684E+00 -0.1439752406767907E+00 -0.1697961946978080E+00 -0.1951753833029356E+00 -0.2200855446874273E+00\n -0.2445015048556650E+00 -0.2684001710639848E+00 -0.2917605178254852E+00 -0.3145635659398817E+00 -0.3367923550171064E+00\n -0.3584319099660255E+00 -0.3794692019194473E+00 -0.3998931040638364E+00 -0.4196943428370452E+00 -0.4388654449501550E+00\n -0.4574006806803239E+00 -0.4752960038707706E+00 -0.4925489890615999E+00 -0.5091587661615586E+00 -0.5251259530560686E+00\n -0.5404525865310800E+00 -0.5551420518758782E+00 -0.5691990115107658E+00 -0.5826293329679667E+00 -0.5954400165361110E+00\n -0.6076391228604799E+00 -0.6192357007728714E+00 -0.6302397156066638E+00 -0.6406619782344070E+00 -0.6505140750472834E+00\n -0.6598082990779603E+00 -0.6685575824509672E+00 -0.6767754303275997E+00 -0.6844758564958461E+00 -0.6916733207396428E+00\n -0.6983826681062417E+00 -0.7046190701754369E+00 -0.7103979684200303E+00 -0.7157350197331149E+00 -0.7206460441846081E+00\n -0.7251469750570049E+00 -0.7292538111984742E+00 -0.7329825717202728E+00 -0.7363492530549652E+00 -0.7393697883820587E+00\n -0.7420600094185869E+00 -0.7444356105635324E+00 -0.7465121153771925E+00 -0.7483048453692615E+00 -0.7498288910627880E+00\n -0.7510990852950691E+00 -0.7521299787110952E+00 -0.7529358174001737E+00 -0.7535305226219949E+00 -0.7539276725644879E+00\n -0.7541404860724225E+00 -0.7541818082827765E+00 -0.7540640981003759E+00 -0.7537994174452843E+00 -0.7533994222016963E+00\n -0.7528753547968463E+00 -0.7522380383374159E+00 -0.7514978722304342E+00 -0.7506648292152125E+00 -0.7497484537329505E+00\n -0.7487578615608312E+00 -0.7477017406379203E+00 -0.7465883530109418E+00 -0.7454255378288276E+00 -0.7442207153161546E+00\n -0.7429808916567682E+00 -0.7417126647203566E+00 -0.7404222305663006E+00 -0.7391153906607812E+00 -0.7377975597449168E+00\n -0.7364737742936068E+00 -0.7351487015066457E+00 -0.7338266487757376E+00 -0.7325115735730846E+00 -0.7312070937093148E+00\n -0.7299164979106890E+00 -0.7286427566676440E+00 -0.7273885333088894E+00 -0.7261561952575059E+00 -0.7249478254275804E+00\n -0.7237652337221139E+00 -0.7226099685950527E+00 -0.7214833286424112E+00 -0.7203863741895169E+00 -0.7193199388434760E+00\n -0.7182846409819289E+00 -0.7172808951511491E+00 -0.7163089233484455E+00 -0.7153687661656919E+00 -0.7144602937725963E+00\n -0.7135832167201219E+00 -0.7127370965461225E+00 -0.7119213561669281E+00 -0.7111352900401826E+00 -0.7103780740857679E+00\n -0.7096487753530824E+00 -0.7089463614243792E+00 -0.7082697095451826E+00 -0.7076176154740552E+00 -0.7069888020452744E+00\n -0.7063819274390548E+00 -0.7057955931550737E+00 -0.7052283516861344E+00 -0.7046787138897004E+00 -0.7041451560560322E+00\n -0.7036261266724787E+00 -0.7031200528842719E+00 -0.7026253466530071E+00 -0.7021404106145906E+00 -0.7016636436391807E+00\n -0.7011934460961990E+00 -0.7007282248280853E+00 -0.7002663978369600E+00 -0.6998063986888191E+00 -0.6993466806403545E+00\n -0.6988857204938393E+00 -0.6984220221858803E+00 -0.6979541201161606E+00 -0.6974805822225486E+00 -0.6970000128092043E+00\n -0.6965110551345379E+00 -0.6960123937660179E+00 -0.6955027567089953E+00 -0.6949809173168499E+00 -0.6944456959898160E+00\n -0.6938959616699598E+00 -0.6933306331398015E+00 -0.6927486801321128E+00 -0.6921491242584105E+00 -0.6915310397636959E+00\n -0.6908935541148920E+00 -0.6902358484304498E+00 -0.6895571577584888E+00 -0.6888567712107797E+00 -0.6881340319597943E+00\n -0.6873883371059062E+00 -0.6866191374217884E+00 -0.6858259369808462E+00 -0.6850082926764688E+00 -0.6841658136386904E+00\n -0.6832981605547428E+00 -0.6824050448998029E+00 -0.6814862280841192E+00 -0.6805415205224655E+00 -0.6795707806318362E+00\n -0.6785739137629465E+00 -0.6775508710711322E+00 -0.6765016483318922E+00 -0.6754262847062551E+00 -0.6743248614609347E+00\n -0.6731975006480673E+00 -0.6720443637491410E+00 -0.6708656502875580E+00 -0.6696615964141065E+00 -0.6684324734694262E+00\n -0.6671785865273722E+00 -0.6659002729230488E+00 -0.6645979007690805E+00 -0.6632718674635170E+00 -0.6619225981926605E+00\n -0.6605505444318366E+00 -0.6591561824471119E+00 -0.6577400118006743E+00 -0.6563025538625172E+00 -0.6548443503309030E+00\n -0.6533659617639238E+00 -0.6518679661243543E+00 -0.6503509573398282E+00 -0.6488155438802812E+00 -0.6472623473544041E+00\n -0.6456920011267967E+00 -0.6441051489573446E+00 -0.6425024436642409E+00 -0.6408845458119288E+00 -0.6392521224252083E+00\n -0.6376058457305376E+00 -0.6359463919255466E+00 -0.6342744399776308E+00 -0.6325906704524237E+00 -0.6308957643728299E+00\n -0.6291904021092484E+00 -0.6274752623015023E+00 -0.6257510208129137E+00 -0.6240183497169164E+00 -0.6222779163164849E+00\n -0.6205303821966133E+00 -0.6187764023100156E+00 -0.6170166240961311E+00 -0.6152516866334947E+00 -0.6134822198254523E+00\n -0.6117088436191340E+00 -0.6099321672576039E+00 -0.6081527885649929E+00 -0.6063712932644193E+00 -0.6045882543284419E+00\n -0.6028042313617739E+00 -0.6010197700159075E+00 -0.5992354014353167E+00 -0.5974516417348416E+00 -0.5956689915078388E+00\n -0.5938879353646483E+00 -0.5921089415009345E+00 -0.5903324612953872E+00 -0.5885589289362899E+00 -0.5867887610764325E+00\n -0.5850223565158195E+00 -0.5832600959116285E+00 -0.5815023415148403E+00 -0.5797494369329861E+00 -0.5780017069183963E+00\n -0.5762594571813876E+00 -0.5745229742277652E+00 -0.5727925252200571E+00 -0.5710683578618634E+00 -0.5693507003047140E+00\n -0.5676397610768275E+00 -0.5659357290331757E+00 -0.5642387733262232E+00 -0.5625490433967653E+00 -0.5608666689842511E+00\n -0.5591917601560096E+00 -0.5575244073547678E+00 -0.5558646814639211E+00 -0.5542126338899364E+00 -0.5525682966613572E+00\n -0.5509316825438423E+00 -0.5493027851706900E+00 -0.5476815791883145E+00 -0.5460680204161578E+00 -0.5444620460205136E+00\n -0.5428635747017666E+00 -0.5412725068945640E+00 -0.5396887249804451E+00 -0.5381120935124601E+00 -0.5365424594513395E+00\n -0.5349796524127961E+00 -0.5334234849255057E+00 -0.5318737526994184E+00 -0.5303302349039710E+00 -0.5287926944558559E+00\n -0.5272608783160018E+00 -0.5257345177954069E+00 -0.5242133288695329E+00 -0.5226970125009548E+00 -0.5211852549699725E+00\n -0.5196777282129478E+00 -0.5181740901680973E+00 -0.5166739851285399E+00 -0.5151770441023719E+00 -0.5136828851796083E+00\n -0.5121911139058056E+00 -0.5107013236622320E+00 -0.5092130960524547E+00 -0.5077260012952530E+00 -0.5062395986237541E+00\n -0.5047534366907523E+00 -0.5032670539801658E+00 -0.5017799792246062E+00 -0.5002917318290815E+00 -0.4988018223008544E+00\n -0.4973097526855100E+00 -0.4958150170093096E+00 -0.4943171017279344E+00 -0.4928154861817414E+00 -0.4913096430576898E+00\n -0.4897990388581003E+00 -0.4882831343764708E+00 -0.4867613851805592E+00 -0.4852332421030025E+00 -0.4836981517397486E+00\n -0.4821555569566233E+00 -0.4806048974043609E+00 -0.4790456100424820E+00 -0.4774771296724106E+00 -0.4758988894802721E+00\n -0.4743103215898168E+00 -0.4727108576259886E+00 -0.4710999292896421E+00 -0.4694769689439838E+00 -0.4678414102133217E+00\n -0.4661926885947614E+00 -0.4645302420834957E+00 -0.4628535118124025E+00 -0.4611619427066728E+00 -0.4594549841542420E+00\n -0.4577320906928324E+00 -0.4559927227144522E+00 -0.4542363471882220E+00 -0.4524624384024584E+00 -0.4506704787269636E+00\n -0.4488599593965099E+00 -0.4470303813165587E+00 -0.4451812558922650E+00 -0.4433121058818812E+00 -0.4414224662756842E+00\n -0.4395118852016028E+00 -0.4375799248587367E+00 -0.4356261624800019E+00 -0.4336501913251545E+00 -0.4316516217054698E+00\n -0.4296300820413793E+00 -0.4275852199543783E+00 -0.4255167033945205E+00 -0.4234242218048398E+00 -0.4213074873240124E+00\n -0.4191662360285776E+00 -0.4170002292160105E+00 -0.4148092547299044E+00 -0.4125931283284775E+00 -0.4103516950975684E+00\n -0.4080848309091941E+00 -0.4057924439266636E+00 -0.4034744761571206E+00 -0.4011309050522512E+00 -0.3987617451577198E+00\n -0.3963670498117089E+00 -0.3939469128927054E+00 -0.3915014706163934E+00 -0.3890309033812195E+00 -0.3865354376618079E+00\n -0.3840153479490107E+00 -0.3814709587348666E+00 -0.3789026465402212E+00 -0.3763108419821045E+00 -0.3736960318772730E+00\n -0.3710587613774890E+00 -0.3683996361312071E+00 -0.3657193244652975E+00 -0.3630185595792629E+00 -0.3602981417430927E+00\n -0.3575589404884341E+00 -0.3548018967810906E+00 -0.3520280251610328E+00 -0.3492384158340347E+00 -0.3464342366967726E+00\n -0.3436167352746726E+00 -0.3407872405489845E+00 -0.3379471646464616E+00 -0.3350980043615843E+00 -0.3322413424775305E+00\n -0.3293788488479631E+00 -0.3265122811972369E+00 -0.3236434855917447E+00 -0.3207743965298733E+00 -0.3179070365923667E+00\n -0.3150435155888747E+00 -0.3121860291300399E+00 -0.3093368565477600E+00 -0.3064983580792707E+00 -0.3036729712235190E+00\n -0.3008632061710796E+00 -0.2980716402017605E+00 -0.2953009109372595E+00 -0.2925537083300732E+00 -0.2898327652646850E+00\n -0.2871408466433073E+00 -0.2844807368267285E+00 -0.2818552253018305E+00 -0.2792670904519203E+00 -0.2767190813152813E+00\n -0.2742138972325089E+00 -0.2717541653057443E+00 -0.2693424156246247E+00 -0.2669810542566010E+00 -0.2646723340554829E+00\n -0.2624183234141169E+00 -0.2602208731776114E+00 -0.2580815820450847E+00 -0.2560017609230388E+00 -0.2539823968540338E+00\n -0.2520241173314579E+00 -0.2501271560242013E+00 -0.2482913211710008E+00 -0.2465159681564286E+00 -0.2447999780373049E+00\n -0.2431417440311489E+00 -0.2415391681797712E+00 -0.2399896705229777E+00 -0.2384902131086874E+00 -0.2370373409624846E+00\n -0.2356272416659091E+00 -0.2342558243668445E+00 -0.2329188177912029E+00 -0.2316118850938999E+00 -0.2303307511904072E+00\n -0.2290713356663495E+00 -0.2278298817525086E+00 -0.2266030696708936E+00 -0.2253881016292194E+00 -0.2241827467507004E+00\n -0.2229853380898954E+00 -0.2217947209120437E+00 -0.2206101607947411E+00 -0.2194312294160579E+00 -0.2182576912681023E+00\n -0.2170894123227367E+00 -0.2159263013992442E+00 -0.2147682815470252E+00 -0.2136152801508975E+00 -0.2124672267271450E+00\n -0.2113240526296465E+00 -0.2101856910076705E+00 -0.2090520767782083E+00 -0.2079231465985940E+00 -0.2067988388391586E+00\n -0.2056790935559256E+00 -0.2045638524633573E+00 -0.2034530589071708E+00 -0.2023466578372234E+00 -0.2012445957804879E+00\n -0.2001468208141218E+00 -0.1990532825386412E+00 -0.1979639320512100E+00 -0.1968787219190523E+00 -0.1957976061529950E+00\n -0.1947205401811518E+00 -0.1936474808227552E+00 -0.1925783862621419E+00 -0.1915132160229021E+00 -0.1904519309421991E+00\n -0.1893944931452612E+00 -0.1883408660200601E+00 -0.1872910141921747E+00 -0.1862449034998491E+00 -0.1852025009692512E+00\n -0.1841637747899360E+00 -0.1831286942905153E+00 -0.1820972299145447E+00 -0.1810693531966281E+00 -0.1800450367387435E+00\n -0.1790242541867973E+00 -0.1780069802074076E+00 -0.1769931904649212E+00 -0.1759828615986671E+00 -0.1749759712004503E+00\n -0.1739724977922888E+00 -0.1729724208043943E+00 -0.1719757205534020E+00 -0.1709823782208502E+00 -0.1699923758319090E+00\n -0.1690056962343670E+00 -0.1680223230778698E+00 -0.1670422407934179E+00 -0.1660654345731199E+00 -0.1650918903502081E+00\n -0.1641215947793118E+00 -0.1631545352169931E+00 -0.1621906997025439E+00 -0.1612300769390466E+00 -0.1602726562746950E+00\n -0.1593184276843816E+00 -0.1583673817515448E+00 -0.1574195096502818E+00 -0.1564748031277238E+00 -0.1555332544866742E+00\n -0.1545948565685086E+00 -0.1536596027363397E+00 -0.1527274868584397E+00 -0.1517985032919279E+00 -0.1508726468667154E+00\n -0.1499499128697113E+00 -0.1490302970292871E+00 -0.1481137954999969E+00 -0.1472004048475565E+00 -0.1462901220340763E+00\n -0.1453829444035485E+00 -0.1444788696675867E+00 -0.1435778958914185E+00 -0.1426800214801243E+00 -0.1417852451651289E+00\n -0.1408935659909356E+00 -0.1400049833021089E+00 -0.1391194967304976E+00 -0.1382371061827025E+00 -0.1373578118277804E+00\n -0.1364816140851888E+00 -0.1356085136129656E+00 -0.1347385112961426E+00 -0.1338716082353913E+00 -0.1330078057358998E+00\n -0.1321471052964751E+00 -0.1312895085988738E+00 -0.1304350174973551E+00 -0.1295836340084561E+00 -0.1287353603009860E+00\n -0.1278901986862372E+00 -0.1270481516084132E+00 -0.1262092216352652E+00 -0.1253734114489432E+00 -0.1245407238370528E+00\n -0.1237111616839186E+00 -0.1228847279620496E+00 -0.1220614257238084E+00 -0.1212412580932750E+00 -0.1204242282583109E+00\n -0.1196103394628140E+00 -0.1187995949991672E+00 -0.1179919982008737E+00 -0.1171875524353817E+00 -0.1163862610970906E+00\n -0.1155881276005403E+00 -0.1147931553737807E+00 -0.1140013478519165E+00 -0.1132127084708265E+00 -0.1124272406610577E+00\n -0.1116449478418844E+00 -0.1108658334155396E+00 -0.1100899007616072E+00 -0.1093171532315786E+00 -0.1085475941435698E+00\n -0.1077812267771939E+00 -0.1070180543685908E+00 -0.1062580801056096E+00 -0.1055013071231401E+00 -0.1047477384985937E+00\n -0.1039973772475303E+00 -0.1032502263194267E+00 -0.1025062885935886E+00 -0.1017655668751993E+00 -0.1010280638915064E+00\n -0.1002937822881413E+00 -0.9956272462557243E-01 -0.9883489337568613E-01 -0.9811029091849610E-01 -0.9738891953897792E-01\n -0.9667078142402649E-01 -0.9595587865953395E-01 -0.9524421322758671E-01 -0.9453578700377881E-01 -0.9383060175463867E-01\n -0.9312865913516950E-01 -0.9242996068649882E-01 -0.9173450783363590E-01 -0.9104230188333598E-01 -0.9035334402206746E-01\n -0.8966763531408090E-01 -0.8898517669957863E-01 -0.8830596899298146E-01 -0.8763001288129194E-01 -0.8695730892255034E-01\n -0.8628785754438455E-01 -0.8562165904264758E-01 -0.8495871358014560E-01 -0.8429902118545067E-01 -0.8364258175179907E-01\n -0.8298939503607108E-01 -0.8233946065785329E-01 -0.8169277809857793E-01 -0.8104934670074115E-01 -0.8040916566719632E-01\n -0.7977223406052095E-01 -0.7913855080245588E-01 -0.7850811467341570E-01 -0.7788092431206631E-01 -0.7725697821497177E-01\n -0.7663627473630474E-01 -0.7601881208762261E-01 -0.7540458833770475E-01 -0.7479360141245189E-01 -0.7418584909484364E-01\n -0.7358132902495440E-01 -0.7298003870002605E-01 -0.7238197547459475E-01 -0.7178713656067244E-01 -0.7119551902797848E-01\n -0.7060711980422413E-01 -0.7002193567544460E-01 -0.6943996328638005E-01 -0.6886119914090269E-01 -0.6828563960248966E-01\n -0.6771328089473920E-01 -0.6714411910192997E-01 -0.6657815016962187E-01 -0.6601536990529702E-01 -0.6545577397903950E-01\n -0.6489935792425362E-01 -0.6434611713841799E-01 -0.6379604688387538E-01 -0.6324914228865730E-01 -0.6270539834734140E-01\n -0.6216480992194123E-01 -0.6162737174282699E-01 -0.6109307840967654E-01 -0.6056192439245466E-01 -0.6003390403242120E-01\n -0.5950901154316545E-01 -0.5898724101166728E-01 -0.5846858639938206E-01 -0.5795304154335106E-01 -0.5744060015733360E-01\n -0.5693125583296245E-01 -0.5642500204092020E-01 -0.5592183213213570E-01 -0.5542173933900042E-01 -0.5492471677660394E-01\n -0.5443075744398622E-01 -0.5393985422540789E-01 -0.5345199989163673E-01 -0.5296718710124915E-01 -0.5248540840194668E-01\n -0.5200665623188704E-01 -0.5153092292102712E-01 -0.5105820069247997E-01 -0.5058848166388249E-01 -0.5012175784877501E-01\n -0.4965802115799089E-01 -0.4919726340105649E-01 -0.4873947628759936E-01 -0.4828465142876621E-01 -0.4783278033864765E-01\n -0.4738385443571101E-01 -0.4693786504423999E-01 -0.4649480339577959E-01 -0.4605466063058778E-01 -0.4561742779909139E-01\n -0.4518309586334694E-01 -0.4475165569850558E-01 -0.4432309809428110E-01 -0.4389741375642146E-01 -0.4347459330818220E-01\n -0.4305462729180289E-01 -0.4263750616998431E-01 -0.4222322032736679E-01 -0.4181176007201023E-01 -0.4140311563687321E-01\n -0.4099727718129280E-01 -0.4059423479246362E-01 -0.4019397848691562E-01 -0.3979649821199152E-01 -0.3940178384732158E-01\n -0.3900982520629698E-01 -0.3862061203754088E-01 -0.3823413402637604E-01 -0.3785038079629078E-01 -0.3746934191040018E-01\n -0.3709100687290486E-01 -0.3671536513054492E-01 -0.3634240607405034E-01 -0.3597211903958652E-01 -0.3560449331019496E-01\n -0.3523951811722967E-01 -0.3487718264178740E-01 -0.3451747601613299E-01 -0.3416038732511890E-01 -0.3380590560759827E-01\n -0.3345401985783308E-01 -0.3310471902689426E-01 -0.3275799202405693E-01 -0.3241382771818768E-01 -0.3207221493912545E-01\n -0.3173314247905550E-01 -0.3139659909387535E-01 -0.3106257350455455E-01 -0.3073105439848577E-01 -0.3040203043082867E-01\n -0.3007549022584622E-01 -0.2975142237823227E-01 -0.2942981545443215E-01 -0.2911065799395422E-01 -0.2879393851067332E-01\n -0.2847964549412637E-01 -0.2816776741079883E-01 -0.2785829270540316E-01 -0.2755120980214808E-01 -0.2724650710599997E-01\n -0.2694417300393482E-01 -0.2664419586618161E-01 -0.2634656404745713E-01 -0.2605126588819128E-01 -0.2575828971574435E-01\n -0.2546762384561452E-01 -0.2517925658263681E-01 -0.2489317622217316E-01 -0.2460937105129300E-01 -0.2432782934994559E-01\n -0.2404853939212278E-01 -0.2377148944701278E-01 -0.2349666778014561E-01 -0.2322406265452879E-01 -0.2295366233177469E-01\n -0.2268545507321884E-01 -0.2241942914102913E-01 -0.2215557279930686E-01 -0.2189387431517832E-01 -0.2163432195987824E-01\n -0.2137690400982439E-01 -0.2112160874768343E-01 -0.2086842446342893E-01 -0.2061733945539015E-01 -0.2036834203129333E-01\n -0.2012142050929418E-01 -0.1987656321900255E-01 -0.1963375850249907E-01 -0.1939299471534369E-01 -0.1915426022757691E-01\n -0.1891754342471287E-01 -0.1868283270872514E-01 -0.1845011649902528E-01 -0.1821938323343368E-01 -0.1799062136914412E-01\n -0.1776381938368037E-01 -0.1753896577584702E-01 -0.1731604906667307E-01 -0.1709505780034925E-01 -0.1687598054515926E-01\n -0.1665880589440464E-01 -0.1644352246732421E-01 -0.1623011891000752E-01 -0.1601858389630291E-01 -0.1580890612872058E-01\n -0.1560107433933019E-01 -0.1539507729065434E-01 -0.1519090377655698E-01 -0.1498854262312769E-01 -0.1478798268956219E-01\n -0.1458921286903872E-01 -0.1439222208959125E-01 -0.1419699931497929E-01 -0.1400353354555478E-01 -0.1381181381912668E-01\n -0.1362182921182277E-01 -0.1343356883894992E-01 -0.1324702185585244E-01 -0.1306217745876907E-01 -0.1287902488568931E-01\n -0.1269755341720873E-01 -0.1251775237738444E-01 -0.1233961113459019E-01 -0.1216311910237258E-01 -0.1198826574030775E-01\n -0.1181504055485940E-01 -0.1164343310023902E-01 -0.1147343297926770E-01 -0.1130502984424104E-01 -0.1113821339779698E-01\n -0.1097297339378707E-01 -0.1080929963815219E-01 -0.1064718198980239E-01 -0.1048661036150212E-01 -0.1032757472076096E-01\n -0.1017006509073034E-01 -0.1001407155110739E-01 -0.9859584239045534E-02 -0.9706593350073452E-02 -0.9555089139022180E-02\n -0.9405061920961404E-02 -0.9256502072145643E-02 -0.9109400030970487E-02 -0.8963746298940305E-02 -0.8819531441647413E-02\n -0.8676746089763751E-02 -0.8535380940045894E-02 -0.8395426756353708E-02 -0.8256874370684052E-02 -0.8119714684219669E-02\n -0.7983938668394324E-02 -0.7849537365975339E-02 -0.7716501892163617E-02 -0.7584823435712779E-02 -0.7454493260067761E-02\n -0.7325502704523865E-02 -0.7197843185407555E-02 -0.7071506197279220E-02 -0.6946483314159568E-02 -0.6822766190779977E-02\n -0.6700346563858386E-02 -0.6579216253401177E-02 -0.6459367164032316E-02 -0.6340791286350805E-02 -0.6223480698317331E-02\n -0.6107427566671246E-02 -0.5992624148378852E-02 -0.5879062792113993E-02 -0.5766735939772315E-02 -0.5655636128019704E-02\n -0.5545755989876484E-02 -0.5437088256338068E-02 -0.5329625758033137E-02 -0.5223361426920646E-02 -0.5118288298026128E-02\n -0.5014399511218785E-02 -0.4911688313029938E-02 -0.4810148058513781E-02 -0.4709772213151562E-02 -0.4610554354799431E-02\n -0.4512488175681280E-02 -0.4415567484426667E-02 -0.4319786208154660E-02 -0.4225138394604049E-02 -0.4131618214309937E-02\n -0.4039219962827338E-02 -0.3947938063001268E-02 -0.3857767067283620E-02 -0.3768701660096141E-02 -0.3680736660238960E-02\n -0.3593867023344052E-02 -0.3508087844372004E-02 -0.3423394360151161E-02 -0.3339781951956864E-02 -0.3257246148128755E-02\n -0.3175782626723511E-02 -0.3095387218199560E-02 -0.3016055908130390E-02 -0.2937784839941740E-02 -0.2860570317667780E-02\n -0.2784408808720544E-02 -0.2709296946665686E-02 -0.2635231533997301E-02 -0.2562209544902880E-02 -0.2490228128008725E-02\n -0.2419284609094953E-02 -0.2349376493767305E-02 -0.2280501470072159E-02 -0.2212657411038820E-02 -0.2145842377131630E-02\n -0.2080054618592456E-02 -0.2015292577651429E-02 -0.1951554890581906E-02 -0.1888840389572373E-02 -0.1827148104385303E-02\n -0.1766477263769774E-02 -0.1706827296590603E-02 -0.1648197832633426E-02 -0.1590588703040315E-02 -0.1533999940326040E-02\n -0.1478431777920006E-02 -0.1423884649172962E-02 -0.1370359185761869E-02 -0.1317856215419179E-02 -0.1266376758905965E-02\n -0.1215922026140108E-02 -0.1166493411382406E-02 -0.1118092487374301E-02 -0.1070720998310677E-02 -0.1024380851520841E-02\n -0.9790741077189988E-03 -0.9348029696732801E-03 -0.8915697691294780E-03 -0.8493769518112139E-03 -0.8082270603040555E-03\n -0.7681227146151712E-03 -0.7290665901840791E-03 -0.6910613931034242E-03 -0.6541098322911179E-03 -0.6182145883382149E-03\n -0.5833782787391545E-03 -0.5496034191941447E-03 -0.5168923806574943E-03 -0.4852473417906704E-03 -0.4546702364667819E-03\n -0.4251626959634362E-03 -0.3967259854759182E-03 -0.3693609345830440E-03 -0.3430678613055810E-03 -0.3178464894144324E-03\n -0.2936958586742664E-03 -0.2706142277521279E-03 -0.2485989695820504E-03 -0.2276464590608424E-03 -0.2077519530613687E-03\n -0.1889094628931880E-03 -0.1711116195232660E-03 -0.1543495320979493E-03 -0.1386126405900494E-03 -0.1238885637399120E-03\n -0.1101629438755946E-03 -0.9741929069423303E-04 -0.8563882667209854E-04 -0.7480033745236668E-04 -0.6488003134095919E-04\n -0.5585141292167375E-04 -0.4768517677466276E-04 -0.4034912832859186E-04 -0.3380813996360609E-04 -0.2802415155542768E-04\n -0.2295622562937124E-04 -0.1856066806040990E-04 -0.1479122565136393E-04 -0.1159937173437365E-04 -0.8934689902304919E-05\n -0.6745363761688971E-05 -0.4978776837729040E-05 -0.3582221071745688E-05 -0.2503704396851613E-05 -0.1692837474640400E-05\n -0.1101766951461853E-05 -0.6861082076102529E-06 -0.4058159914808505E-06 -0.2259190936022548E-06 -0.1170390843846189E-06\n -0.5561789832021472E-07 -0.2379962422071496E-07 -0.8951415949547709E-08 -0.2865311296782646E-08 -0.7469799452895257E-09\n -0.1491286872225022E-09 -0.2085937681520927E-10 -0.1788909961745903E-11 -0.7627333239967911E-13 -0.1139998169589491E-14\n -0.3184439268690364E-17 -0.4725628150249130E-21 -0.1979177475376566E-27 -0.3507608647733454E-40 -0.1993203231761145E-78\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.2092827306407022E+00 0.4057670184399992E+00 0.5898979350532600E+00 0.7621100296525628E+00\n 0.9228266176030425E+00 0.1072464703931703E+01 0.1211436937704310E+01 0.1340155639290343E+01 0.1459036896649656E+01\n 0.1568504688229295E+01 0.1668994708900562E+01 0.1760957569185768E+01 0.1844861052822834E+01 0.1921191152910295E+01\n 0.1990451661396074E+01 0.2053162158653891E+01 0.2109854336461265E+01 0.2161066684867483E+01 0.2207337676111377E+01\n 0.2249197680806415E+01 0.2287159946209046E+01 0.2321711046373938E+01 0.2353301272500611E+01 0.2382335462875013E+01\n 0.2409164771274074E+01 0.2434079838629096E+01 0.2457305766029753E+01 0.2478999191665430E+01 0.2499247656714136E+01\n 0.2518071314420061E+01 0.2535426902944383E+01 0.2551213776615215E+01 0.2565281681669818E+01 0.2577439879309795E+01\n 0.2587467166041904E+01 0.2595122320937184E+01 0.2600154520609984E+01 0.2602313301685621E+01 0.2601357711533437E+01\n 0.2597064364112607E+01 0.2589234201573016E+01 0.2577697846846366E+01 0.2562319511937518E+01 0.2542999496459417E+01\n 0.2519675368173886E+01 0.2492321960446077E+01 0.2460950350463687E+01 0.2425605997739516E+01 0.2386366226474959E+01\n 0.2343337229915742E+01 0.2296650762147126E+01 0.2246460665073238E+01 0.2192939357621151E+01 0.2136274392226351E+01\n 0.2076665161774061E+01 0.2014319819428672E+01 0.1949452454898987E+01 0.1882280554098696E+01 0.1813022755076766E+01\n 0.1741896901539862E+01 0.1669118386164077E+01 0.1594898769003028E+01 0.1519444651395879E+01 0.1442956782587889E+01\n 0.1365629374518453E+01 0.1287649599638170E+01 0.1209197246937915E+01 0.1130444512385982E+01 0.1051555901479737E+01\n 0.9726882234608905E+00 0.8939906587816835E+00 0.8156048835327433E+00 0.7376652366657381E+00 0.6602989178988580E+00\n 0.5836262061335374E+00 0.5077606900028175E+00 0.4328095037959179E+00 0.3588735634485049E+00 0.2860477985519050E+00\n 0.2144213774203916E+00 0.1440779231718307E+00 0.7509571953458535E-01 0.7547905706075591E-02 -0.5849733992897237E-01\n -0.1229766270456308E+00 -0.1858311911485266E+00 -0.2470067412388819E+00 -0.3064533166418045E+00 -0.3641251522021267E+00\n -0.4199805510487963E+00 -0.4739817641533713E+00 -0.5260948759595897E+00 -0.5762896954288581E+00 -0.6245396519239588E+00\n -0.6708216954350136E+00 -0.7151162007320108E+00 -0.7574068751038985E+00 -0.7976806694123654E+00 -0.8359276922467996E+00\n -0.8721411270148933E+00 -0.9063171518391930E+00 -0.9384548621556141E+00 -0.9685561959238236E+00 -0.9966258613642036E+00\n -0.1022671267132381E+01 -0.1046702454831763E+01 -0.1068732033749353E+01 -0.1088775117682357E+01 -0.1106849263704848E+01\n -0.1122974412708365E+01 -0.1137172831539331E+01 -0.1149469056553965E+01 -0.1159889838419920E+01 -0.1168464088017379E+01\n -0.1175222823334259E+01 -0.1180199117315087E+01 -0.1183428046714909E+01 -0.1184946642134393E+01 -0.1184793839575426E+01\n -0.1183010434064154E+01 -0.1179639036149073E+01 -0.1174724032402013E+01 -0.1168311551439714E+01 -0.1160449437451607E+01\n -0.1151187233775371E+01 -0.1140576179713346E+01 -0.1128669224538139E+01 -0.1115521063495940E+01 -0.1101188201577848E+01\n -0.1085729051876920E+01 -0.1069204076448596E+01 -0.1051675978683903E+01 -0.1033209957189757E+01 -0.1013874031892834E+01\n -0.9937394533112268E+00 -0.9728812053358954E+00 -0.9513786099635553E+00 -0.9293160385930985E+00 -0.9067837279225540E+00\n -0.8838786881577604E+00 -0.8607056760163188E+00 -0.8373781836996756E+00 -0.8140193666454354E+00 -0.7907627971280821E+00\n -0.7677528886053459E+00 -0.7451447902474176E+00 -0.7231035087242984E+00 -0.7018019856777432E+00 -0.6814178596116595E+00\n -0.6621286890901025E+00 -0.6441055293683786E+00 -0.6275049500959465E+00 -0.6124598554819389E+00 -0.5990697931249144E+00\n -0.5873917551816811E+00 -0.5774326999496706E+00 -0.5691450588850681E+00 -0.5624262731985009E+00 -0.5571229156877342E+00\n -0.5530392710790523E+00 -0.5499495211576281E+00 -0.5476120912055904E+00 -0.5457844127402661E+00 -0.5442364096307576E+00\n -0.5427613802609629E+00 -0.5411835048730576E+00 -0.5393618006932226E+00 -0.5371908460844405E+00 -0.5345989223491749E+00\n -0.5315443627327854E+00 -0.5280108835019925E+00 -0.5240025549054657E+00 -0.5195389048925442E+00 -0.5146504785947575E+00\n -0.5093750286076997E+00 -0.5037543971983343E+00 -0.4978320732717670E+00 -0.4916513597181557E+00 -0.4852540635555492E+00\n -0.4786796148269129E+00 -0.4719645242683226E+00 -0.4651420995758296E+00 -0.4582423523395834E+00 -0.4512920402678477E+00\n -0.4443148009770967E+00 -0.4373313437888304E+00 -0.4303596744600146E+00 -0.4234153346275730E+00 -0.4165116431348047E+00\n -0.4096599305448206E+00 -0.4028697612557244E+00 -0.3961491399203882E+00 -0.3895047005196642E+00 -0.3829418775915900E+00\n -0.3764650599017688E+00 -0.3700777273477470E+00 -0.3637825721974685E+00 -0.3575816059257799E+00 -0.3514762529766660E+00\n -0.3454674327743286E+00 -0.3395556312570763E+00 -0.3337409631312600E+00 -0.3280232259503844E+00 -0.3224019470255501E+00\n -0.3168764240734279E+00 -0.3114457604107825E+00 -0.3061088954126595E+00 -0.3008646308661068E+00 -0.2957116537733492E+00\n -0.2906485560879659E+00 -0.2856738518046101E+00 -0.2807859917668553E+00 -0.2759833765084032E+00 -0.2712643673995287E+00\n -0.2666272963328205E+00 -0.2620704741493222E+00 -0.2575921979776381E+00 -0.2531907576339031E+00 -0.2488644412092475E+00\n -0.2446115399531009E+00 -0.2404303525450218E+00 -0.2363191888342949E+00 -0.2322763731150775E+00 -0.2283002469950982E+00\n -0.2243891719075561E+00 -0.2205415313087940E+00 -0.2167557325982774E+00 -0.2130302087922870E+00 -0.2093634199784029E+00\n -0.2057538545741509E+00 -0.2022000304100722E+00 -0.1987004956548198E+00 -0.1952538295976336E+00 -0.1918586433016487E+00\n -0.1885135801398642E+00 -0.1852173162242242E+00 -0.1819685607370943E+00 -0.1787660561734181E+00 -0.1756085785009749E+00\n -0.1724949372454470E+00 -0.1694239755063514E+00 -0.1663945699093716E+00 -0.1634056305001383E+00 -0.1604561005841044E+00\n -0.1575449565168044E+00 -0.1546712074484661E+00 -0.1518338950266697E+00 -0.1490320930604994E+00 -0.1462649071494050E+00\n -0.1435314742798000E+00 -0.1408309623922306E+00 -0.1381625699217879E+00 -0.1355255253142844E+00 -0.1329190865205691E+00\n -0.1303425404712269E+00 -0.1277952025337876E+00 -0.1252764159544457E+00 -0.1227855512861943E+00 -0.1203220058051661E+00\n -0.1178852029168765E+00 -0.1154745915539778E+00 -0.1130896455670350E+00 -0.1107298631097586E+00 -0.1083947660200428E+00\n -0.1060838991980789E+00 -0.1037968299827469E+00 -0.1015331475274080E+00 -0.9929246217615594E-01 -0.9707440484152201E-01\n -0.9487862638456054E-01 -0.9270479699818115E-01 -0.9055260559454251E-01 -0.8842175919725527E-01 -0.8631198233909854E-01\n -0.8422301646589628E-01 -0.8215461934715129E-01 -0.8010656449399124E-01 -0.7807864058492887E-01 -0.7607065089990145E-01\n -0.7408241276301041E-01 -0.7211375699433867E-01 -0.7016452737119373E-01 -0.6823458009908026E-01 -0.6632378329267392E-01\n -0.6443201646703840E-01 -0.6255917003929234E-01 -0.6070514484090285E-01 -0.5886985164075899E-01 -0.5705321067914502E-01\n -0.5525515121271331E-01 -0.5347561107053028E-01 -0.5171453622124416E-01 -0.4997188035140731E-01 -0.4824760445495881E-01\n -0.4654167643385925E-01 -0.4485407070984989E-01 -0.4318476784728866E-01 -0.4153375418700541E-01 -0.3990102149109915E-01\n -0.3828656659858688E-01 -0.3669039109180319E-01 -0.3511250097343621E-01 -0.3355290635407111E-01 -0.3201162115010978E-01\n -0.3048866279191616E-01 -0.2898405194203557E-01 -0.2749781222332479E-01 -0.2602996995682040E-01 -0.2458055390917123E-01\n -0.2314959504944821E-01 -0.2173712631514516E-01 -0.2034318238717427E-01 -0.1896779947365720E-01 -0.1761101510230969E-01\n -0.1627286792121220E-01 -0.1495339750775495E-01 -0.1365264418554666E-01 -0.1237064884906971E-01 -0.1110745279586314E-01\n -0.9863097566016712E-02 -0.8637624788750709E-02 -0.7431076035862909E-02 -0.6243492681816734E-02 -0.5074915770246633E-02\n -0.3925385886656976E-02 -0.2794943037087542E-02 -0.1683626532521779E-02 -0.5914748788115108E-03 0.4814743281079707E-03\n 0.1535184501935395E-02 0.2569620160881108E-02 0.3584747017927284E-02 0.4580532066695804E-02 0.5556943663146154E-02\n 0.6513951603328201E-02 0.7451527197409622E-02 0.8369643340202203E-02 0.9268274578406274E-02 0.1014739717479459E-01\n 0.1100698916955656E-01 0.1184703043902031E-01 0.1266750275197406E-01 0.1346838982380348E-01 0.1424967736866517E-01\n 0.1501135314991321E-01 0.1575340702899826E-01 0.1647583101305540E-01 0.1717861930140175E-01 0.1786176833115984E-01\n 0.1852527682222726E-01 0.1916914582181181E-01 0.1979337874875210E-01 0.2039798143784515E-01 0.2098296218440263E-01\n 0.2154833178926046E-01 0.2209410360446425E-01 0.2262029357986047E-01 0.2312692031081800E-01 0.2361400508731372E-01\n 0.2408157194461195E-01 0.2452964771577501E-01 0.2495826208624157E-01 0.2536744765071304E-01 0.2575723997259286E-01\n 0.2612767764622501E-01 0.2647880236218226E-01 0.2681065897585869E-01 0.2712329557962571E-01 0.2741676357881194E-01\n 0.2769111777177585E-01 0.2794641643434182E-01 0.2818272140887457E-01 0.2840009819827491E-01 0.2859861606518020E-01\n 0.2877834813666253E-01 0.2893937151471862E-01 0.2908176739285332E-01 0.2920562117906286E-01 0.2931102262552834E-01\n 0.2939806596533533E-01 0.2946685005654058E-01 0.2951747853391014E-01 0.2955005996865805E-01 0.2956470803651828E-01\n 0.2956154169448472E-01 0.2954068536655733E-01 0.2950226913883336E-01 0.2944642896428323E-01 0.2937330687754944E-01\n 0.2928305122010533E-01 0.2917581687610584E-01 0.2905176551925757E-01 0.2891106587102654E-01 0.2875389397049235E-01\n 0.2858043345614350E-01 0.2839087585989199E-01 0.2818542091356523E-01 0.2796427686810767E-01 0.2772766082569555E-01\n 0.2747579908493241E-01 0.2720892749925168E-01 0.2692729184860401E-01 0.2663114822445014E-01 0.2632076342801500E-01\n 0.2599641538168244E-01 0.2565839355332355E-01 0.2530699939325154E-01 0.2494254678338238E-01 0.2456536249805061E-01\n 0.2417578667578270E-01 0.2377417330116236E-01 0.2336089069573457E-01 0.2293632201668000E-01 0.2250086576175244E-01\n 0.2205493627870053E-01 0.2159896427709156E-01 0.2113339734011533E-01 0.2065870043356471E-01 0.2017535640876495E-01\n 0.1968386649574995E-01 0.1918475078245607E-01 0.1867854867511944E-01 0.1816581933441314E-01 0.1764714208114318E-01\n 0.1712311676453094E-01 0.1659436408523645E-01 0.1606152586432164E-01 0.1552526524830300E-01 0.1498626683930028E-01\n 0.1444523673804386E-01 0.1390290248615655E-01 0.1336001289267242E-01 0.1281733772819916E-01 0.1227566726846887E-01\n 0.1173581166726628E-01 0.1119860013688112E-01 0.1066487991231793E-01 0.1013551497353980E-01 0.9611384498049214E-02\n 0.9093381014167966E-02 0.8582408223524964E-02 0.8079378459570645E-02 0.7585209747505587E-02 0.7100822429962137E-02\n 0.6627135322258290E-02 0.6165061361244632E-02 0.5715502712913672E-02 0.5279345306314358E-02 0.4857452765248114E-02\n 0.4450659715107746E-02 0.4059764450523725E-02 0.3685520960736674E-02 0.3328630324427772E-02 0.2989731504787848E-02\n 0.2669391599617415E-02 0.2368095630986141E-02 0.2086235995182996E-02 0.1824101737017772E-02 0.1581867863467087E-02\n 0.1359584970329603E-02 0.1157169521569523E-02 0.9743951931644752E-03 0.8108857691386213E-03 0.6661101530243749E-03\n 0.5393801270545922E-03 0.4298515449594449E-03 0.3365296699754433E-03 0.2582793513780087E-03 0.1938406504102719E-03\n 0.1418503565121643E-03 0.1008695525362177E-03 0.6941697110285677E-04 0.4600732088117413E-04 0.2919305903894978E-04\n 0.1760728677207078E-04 0.1000464291784026E-04 0.5296427334745831E-05 0.2575932371020878E-05 0.1130373835070578E-05\n 0.4371389867137730E-06 0.1443839527546615E-06 0.3903079296907923E-07 0.8136509367815676E-08 0.1200603994451306E-08\n 0.1103313091144371E-09 0.5169033352084336E-11 0.8862989414281884E-13 0.3078210235071099E-15 0.6727297563933329E-19\n 0.6350331239490211E-25 0.1073811882539351E-36 0.6326995303161769E-70 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00 0.0000000000000000E+00\n" }, { "path": "src/test/resources/samples/langs/Formatted/long_seq.for", "content": "ACCEPTABLE LEFT PRIMERS\n 1-based # self self hair- qual-\n # sequence start ln N GC% Tm any_th end_th pin lity\n 0 tgctagctaggcgatgctag 411 20 0 55.00 60.028 23.16 23.16 38.59 0.028\n 1 actgatacgcgatgctagct 476 20 0 50.00 59.957 17.69 1.35 0.00 0.043\n 2 gatcgatgctagctaggcga 405 20 0 55.00 60.100 16.30 16.30 0.00 0.100\n 3 tcgatcgatgctagctaggc 403 20 0 55.00 60.100 18.63 8.45 0.00 0.100\n 4 tagctgatcgatcgtagcgg 565 20 0 55.00 60.101 25.02 17.36 0.00 0.101\n 5 gctgactgatcgatcgatgc 113 20 0 55.00 59.826 24.08 17.09 35.21 0.174\n 6 tatcatctctgcgcgatcga 361 20 0 50.00 59.747 22.07 1.72 38.48 0.253\n 7 agctaggcgatgctagctag 415 20 0 55.00 59.742 17.46 17.46 41.54 0.258\n 8 ctagctaggcgatgctagct 413 20 0 55.00 59.742 18.68 17.35 43.53 0.258\n 9 ggcgatctagctagctgact 583 20 0 55.00 59.671 17.44 7.44 37.58 0.329\n 10 tcgatgctagctaggcgatg 407 20 0 55.00 60.382 14.03 0.00 0.00 0.382\n 11 gctgatcgatcgatgctagc 398 20 0 55.00 59.618 25.97 24.79 35.21 0.382\n 12 gctagctgatcgatcgatgc 394 20 0 55.00 59.618 24.08 21.09 35.21 0.382\n 13 atcatctctgcgcgatcgat 362 20 0 50.00 60.382 22.07 5.02 38.48 0.382\n 14 gactgatacgcgatgctagc 475 20 0 55.00 59.551 8.61 8.61 0.00 0.449\n 15 atcgatgctagctaggcgat 406 20 0 50.00 59.452 18.43 18.43 0.00 0.548\n 16 gctagctgactgatacgcga 468 20 0 55.00 60.589 16.29 0.00 0.00 0.589\n 17 agctagctgactgatacgcg 467 20 0 55.00 60.590 17.99 3.89 0.00 0.590\n 18 atgctagctaggcgatgcta 410 20 0 50.00 59.375 10.59 8.91 0.00 0.625\n 19 ctatcatctctgcgcgatcg 360 20 0 55.00 59.347 12.19 12.19 39.07 0.653\n 20 gatgctagctaggcgatgct 409 20 0 55.00 60.668 7.01 7.53 0.00 0.668\n 21 gctactatcatctctgcgcg 356 20 0 55.00 59.273 0.00 0.00 0.00 0.727\n 22 cgtagcggcgatctagctag 577 20 0 60.00 60.791 15.64 15.64 37.58 0.791\n 23 cggcgatctagctagctgac 582 20 0 60.00 61.003 14.84 7.25 38.70 1.003\n 24 gctagctgatcgatcgtagc 563 20 0 55.00 58.995 23.70 23.70 0.00 1.005\n 25 gatcgatcgatgtgcggcta 81 20 0 55.00 61.006 19.16 0.00 41.65 1.006\n 26 atcgatcgatgtgcggctag 82 20 0 55.00 61.008 29.65 0.00 41.65 1.008\n 27 gctgactgatacgcgatgc 472 19 0 57.89 60.025 0.00 0.00 0.00 1.025\n 28 agctagctgatcatcgatgct 190 21 0 47.62 60.035 17.99 11.09 0.00 1.035\n 29 gctagctagctgactgatcga 105 21 0 52.38 60.037 34.38 0.00 46.11 1.037\n 30 tcatctctgcgcgatcgat 363 19 0 52.63 59.946 22.07 0.12 38.48 1.054\n 31 atcatctctgcgcgatcga 362 19 0 52.63 59.946 22.07 1.72 38.48 1.054\n 32 atcgatcgatgtgcggcta 82 19 0 52.63 59.945 29.65 0.00 41.65 1.055\n 33 gtagcggcgatctagctagc 578 20 0 60.00 61.071 16.97 7.15 39.86 1.071\n 34 gctagctgactgatcgatcg 109 20 0 55.00 58.924 16.84 13.89 0.00 1.076\n 35 gctgatcgatcgatgtgcg 78 19 0 57.89 60.097 29.87 18.15 42.69 1.097\n 36 tatcatctctgcgcgatcgat 361 21 0 47.62 60.172 22.07 11.47 38.48 1.172\n 37 gctagctagctgatcgatcga 390 21 0 52.38 60.172 34.38 22.52 46.11 1.172\n 38 gctagctagctgatcgatcga 70 21 0 52.38 60.172 34.38 22.52 46.11 1.172\n 39 catctctgcgcgatcgatg 364 19 0 57.89 59.810 13.74 13.74 38.48 1.190\n 40 tcgtagcggcgatctagcta 576 20 0 55.00 61.231 11.55 9.27 36.40 1.231\n 41 actgatacgcgatgctagcta 476 21 0 47.62 59.765 17.69 3.08 0.00 1.235\n 42 actgatcgatcgatgctagct 117 21 0 47.62 59.763 23.29 11.70 35.21 1.237\n 43 agctagctgatcgatcgatgt 73 21 0 47.62 59.763 17.99 2.62 35.21 1.237\n 44 tagcggcgatctagctagct 579 20 0 55.00 61.243 23.74 23.74 46.60 1.243\n 45 cgtagcggcgatctagcta 577 19 0 57.89 59.729 11.55 9.27 37.58 1.271\n 46 ctagctgatcgatcgtagcg 564 20 0 55.00 58.727 25.02 15.05 0.00 1.273\n 47 tagcggcgatctagctagc 579 19 0 57.89 59.725 16.97 9.14 39.86 1.275\n 48 catcgatcgatgcatgcatg 442 20 0 50.00 58.722 37.80 23.31 44.93 1.278\n 49 tcatctctgcgcgatcgatg 363 20 0 55.00 61.279 18.01 18.01 38.48 1.279\n 50 gctagctagctgatcgatcg 559 20 0 55.00 58.714 34.38 11.90 46.11 1.286\n 51 gctagctagctgatcgatcg 390 20 0 55.00 58.714 34.38 11.90 46.11 1.286\n 52 gctagctagctgatcgatcg 70 20 0 55.00 58.714 34.38 11.90 46.11 1.286\n 53 agcatcggattagctagctga 3 21 0 47.62 59.689 28.29 20.88 0.00 1.311\n 54 agctgatcgatcgtagcgg 566 19 0 57.89 60.315 25.02 17.36 0.00 1.315\n 55 cggcgatctagctagctga 582 19 0 57.89 59.650 21.57 16.66 38.70 1.350\n 56 ctagctgatcgatcgatgtgc 75 21 0 52.38 59.643 31.83 30.04 35.21 1.357\n 57 gctagctgatcgatcgatgtg 74 21 0 52.38 59.643 12.06 6.93 35.21 1.357\n 58 gctagctaggcgatgctagc 412 20 0 60.00 61.357 30.41 30.41 46.19 1.357\n 59 tagctagctgactgatacgcg 466 21 0 52.38 60.373 28.29 3.89 0.00 1.373\n 60 gctagctgactgatcgatcga 109 21 0 52.38 60.374 22.52 22.52 0.00 1.374\n 61 agctagctgactgatcgatcg 108 21 0 52.38 60.374 17.99 13.89 0.00 1.374\n 62 cgatcgatgctagctaggcg 404 20 0 60.00 61.409 15.59 9.14 0.00 1.409\n 63 gctagctagctgactgatcg 105 20 0 55.00 58.563 34.38 1.84 46.11 1.437\n 64 atgctagctaggcgatgct 410 19 0 52.63 59.561 10.59 7.53 0.00 1.439\n 65 agctagctgatcgatcgtagc 562 21 0 52.38 60.441 26.87 26.87 0.00 1.441\n 66 gctagctagctgatcgatcgt 559 21 0 52.38 60.441 34.38 2.65 46.11 1.441\n 67 tagctaggcgatgctagctag 414 21 0 52.38 59.559 18.42 17.46 42.44 1.441\n 68 ctagctaggcgatgctagcta 413 21 0 52.38 59.559 18.69 17.64 42.44 1.441\n 69 tagctgatcgatcgatgtgc 76 20 0 50.00 58.558 31.83 30.04 35.21 1.442\n 70 gatgctagctaggcgatgcta 409 21 0 52.38 60.444 9.82 8.91 0.00 1.444\n 71 atgctagctaggcgatgctag 410 21 0 52.38 60.444 23.16 23.16 38.59 1.444\n 72 gctagctgatcatcgatgct 191 20 0 50.00 58.539 16.29 12.14 0.00 1.461\n 73 agctagctgatcatcgatgc 190 20 0 50.00 58.539 21.42 9.22 0.00 1.461\n 74 gctgactgatacgcgatgct 472 20 0 55.00 61.494 2.33 0.00 0.00 1.494\n 75 agctgactgatacgcgatgc 471 20 0 55.00 61.494 3.47 0.00 0.00 1.494\n 76 ggcgatctagctagctgacta 583 21 0 52.38 59.491 17.44 5.40 37.58 1.509\n 77 gatcgatgctagctaggcgat 405 21 0 52.38 60.510 21.61 21.61 0.00 1.510\n 78 atcgatcgatgctagctaggc 402 21 0 52.38 60.510 29.65 8.45 33.56 1.510\n 79 ctgatcgatcgatgtgcgg 79 19 0 57.89 59.447 15.54 5.83 41.65 1.553\n 80 agctgatcgatcgatgtgcg 77 20 0 55.00 61.556 31.92 20.26 42.69 1.556\n 81 cgatcatcgatgctagctagc 548 21 0 52.38 59.444 34.89 34.89 46.99 1.556\n 82 tagctaggcgatgctagcta 414 20 0 50.00 58.433 19.37 17.81 42.44 1.567\n 83 agctagctactgatcgatgct 303 21 0 47.62 59.415 17.56 11.51 0.00 1.585\n 84 tcgatcgatgtgcggctag 83 19 0 57.89 60.606 18.63 0.00 41.65 1.606\n 85 gactgatcgatcgatgctagc 116 21 0 52.38 59.378 15.86 8.45 35.21 1.622\n 86 agctagctgactgatcgatca 260 21 0 47.62 59.347 26.99 26.99 35.44 1.653\n 87 ctgactgatacgcgatgctag 473 21 0 52.38 59.312 1.70 0.00 0.00 1.688\n 88 ctagctgactgatacgcgatg 469 21 0 52.38 59.312 0.00 0.00 0.00 1.688\n 89 gctactatcatctctgcgcga 356 21 0 52.38 60.707 2.71 2.71 0.00 1.707\n 90 agctactatcatctctgcgcg 355 21 0 52.38 60.709 0.00 0.00 0.00 1.709\n 91 actatcatctctgcgcgatc 359 20 0 50.00 58.270 4.99 0.00 0.00 1.730\n 92 actgatcgatcgatgctagc 117 20 0 50.00 58.270 23.29 13.61 35.21 1.730\n 93 gctagctgatcgatcgatgt 74 20 0 50.00 58.270 14.29 2.62 35.21 1.730\n 94 ctatcatctctgcgcgatcga 360 21 0 52.38 60.771 22.07 1.72 38.48 1.771\n 95 atcgatgctagctaggcgatg 406 21 0 52.38 60.779 21.16 4.37 0.00 1.779\n 96 tgactgatacgcgatgctag 474 20 0 50.00 58.207 1.70 0.00 0.00 1.793\n 97 ctgactgatacgcgatgcta 473 20 0 50.00 58.207 2.33 0.00 0.00 1.793\n 98 tagctgactgatacgcgatg 470 20 0 50.00 58.207 0.00 0.00 0.00 1.793\n 99 ctgactgatcgatcgatgct 114 20 0 50.00 58.197 26.44 12.40 35.21 1.803\n 100 agctgactgatcgatcgatg 112 20 0 50.00 58.197 23.05 13.21 35.21 1.803\n 101 tcggattagctagctgatgc 7 20 0 50.00 58.176 17.46 17.46 40.05 1.824\n 102 gcatcggattagctagctga 4 20 0 50.00 58.176 28.29 20.88 0.00 1.824\n 103 agcatcggattagctagctg 3 20 0 50.00 58.171 28.29 10.80 0.00 1.829\n 104 gatgctagctaggcgatgc 409 19 0 57.89 59.141 4.18 0.00 0.00 1.859\n 105 ctgatacgcgatgctagctag 477 21 0 52.38 59.113 17.46 17.46 0.00 1.887\n 106 gctagctgactgatacgcg 468 19 0 57.89 59.086 8.21 3.89 0.00 1.914\n 107 ctctgcgcgatcgatgctag 367 20 0 60.00 61.946 21.94 18.16 38.48 1.946\n 108 tctgcgcgatcgatgctag 368 19 0 57.89 60.966 21.94 18.16 38.48 1.966\n 109 ctctgcgcgatcgatgcta 367 19 0 57.89 60.966 26.61 17.10 38.48 1.966\n 110 cgatgctagctaggcgatgc 408 20 0 60.00 61.968 11.09 0.00 0.00 1.968\n 111 gactgatacgcgatgctagct 475 21 0 52.38 60.975 17.69 1.35 0.00 1.975\n 112 gctagctgactgatacgcgat 468 21 0 52.38 60.975 8.21 0.00 0.00 1.975\n 113 tgatacgcgatgctagctag 478 20 0 50.00 57.994 17.46 17.46 0.00 2.006\n 114 ctgatacgcgatgctagcta 477 20 0 50.00 57.994 17.69 3.08 0.00 2.006\n 115 cgcgatcgatgctagctagc 372 20 0 60.00 62.011 34.89 34.89 43.67 2.011\n 116 gcgcgatcgatgctagctag 371 20 0 60.00 62.011 21.66 17.46 38.48 2.011\n 117 ctgatcgatcgatgctagct 399 20 0 50.00 57.983 19.70 2.01 35.21 2.017\n 118 agctgatcgatcgatgctag 397 20 0 50.00 57.983 27.33 18.05 34.69 2.017\n 119 ctagctgatcgatcgatgct 395 20 0 50.00 57.983 33.87 33.38 38.16 2.017\n 120 agctagctgatcgatcgatg 393 20 0 50.00 57.983 21.99 11.03 35.21 2.017\n 121 ctgatcgatcgatgctagct 118 20 0 50.00 57.983 19.70 2.01 35.21 2.017\n 122 agctagctgatcgatcgatg 73 20 0 50.00 57.983 21.99 11.03 35.21 2.017\n 123 catcggattagctagctgatgc 5 22 0 50.00 59.982 24.41 24.41 40.05 2.018\n 124 gcatcggattagctagctgatg 4 22 0 50.00 59.982 27.81 27.81 33.28 2.018\n 125 tcgatgctagctaggcgat 407 19 0 52.63 58.964 14.03 3.01 0.00 2.036\n 126 atcgatgctagctaggcga 406 19 0 52.63 58.964 16.30 16.30 0.00 2.036\n 127 actatcatctctgcgcgatcg 359 21 0 52.38 61.037 12.19 12.19 39.07 2.037\n 128 gcgcgatcgatgctagcta 371 19 0 57.89 61.037 21.66 3.08 38.48 2.037\n 129 gctgatcgatcgatgctagct 398 21 0 52.38 61.044 27.88 12.70 35.21 2.044\n 130 agctgatcgatcgatgctagc 397 21 0 52.38 61.044 27.33 27.90 34.69 2.044\n 131 gctagctgatcgatcgatgct 394 21 0 52.38 61.044 33.87 33.38 38.16 2.044\n 132 agctagctgatcgatcgatgc 393 21 0 52.38 61.044 24.08 21.09 35.21 2.044\n 133 cgcgatcgatgctagctag 372 19 0 57.89 58.947 22.07 17.46 38.48 2.053\n 134 tcgtagcggcgatctagc 576 18 0 61.11 59.936 4.70 0.00 36.40 2.064\n 135 cgtagcggcgatctagct 577 18 0 61.11 59.935 11.03 11.03 37.58 2.065\n 136 gcggcgatctagctagct 581 18 0 61.11 59.933 23.74 23.74 38.05 2.067\n 137 agcggcgatctagctagc 580 18 0 61.11 59.933 16.97 7.15 39.86 2.067\n 138 ctagctgactgatacgcgat 469 20 0 50.00 57.918 1.43 0.00 0.00 2.082\n 139 ctagctgatcgatcgtagcgg 564 21 0 57.14 61.096 20.31 16.15 0.00 2.096\n 140 agctactatcatctctgcgc 355 20 0 50.00 57.898 0.00 0.00 0.00 2.102\n 141 gctagctactgatcgatgct 304 20 0 50.00 57.898 11.51 11.51 0.00 2.102\n 142 agctagctactgatcgatgc 303 20 0 50.00 57.898 17.56 1.76 0.00 2.102\n 143 agcatcggattagctagctgat 3 22 0 45.45 60.108 17.84 15.13 0.00 2.108\n 144 tgctagctaggcgatgcta 411 19 0 52.63 58.881 17.69 8.91 0.00 2.119\n 145 aagcatcggattagctagctg 2 21 0 47.62 58.879 28.29 10.80 0.00 2.121\n 146 tctgcgcgatcgatgcta 368 18 0 55.56 59.857 26.61 16.13 38.48 2.143\n 147 cgatgctagctaggcgatg 408 19 0 57.89 58.856 11.09 0.00 0.00 2.144\n 148 agctagctgatcatcgatgcta 190 22 0 45.45 59.845 17.99 13.09 0.00 2.155\n 149 tagctagctgatcatcgatgct 189 22 0 45.45 59.845 16.29 15.30 0.00 2.155\n 150 atcgatcgatgtgcggct 82 18 0 55.56 60.166 29.65 4.36 41.65 2.166\n 151 gctagctgactgatcgatca 261 20 0 50.00 57.829 26.99 26.99 35.44 2.171\n 152 tagctagctgactgatcgatcg 107 22 0 50.00 60.174 28.29 13.89 0.00 2.174\n 153 agctgatcatcatcgatgct 515 20 0 45.00 57.788 11.25 0.72 40.32 2.212\n 154 agctagctgactgatcgatcat 260 22 0 45.45 59.778 26.67 18.02 36.62 2.222\n 155 tgactgatacgcgatgctagc 474 21 0 52.38 61.238 8.61 8.61 0.00 2.238\n 156 gctgactgatacgcgatgcta 472 21 0 52.38 61.238 2.33 0.00 0.00 2.238\n 157 tagctgactgatacgcgatgc 470 21 0 52.38 61.238 3.47 0.00 0.00 2.238\n 158 tagctagctgatcgatcgtagc 561 22 0 50.00 60.238 26.87 26.87 0.00 2.238\n 159 gctagctagctgatcgatcgta 559 22 0 50.00 60.238 34.38 3.07 46.11 2.238\n 160 tgatcgatcgatgctagctagg 400 22 0 50.00 60.239 26.44 6.29 35.21 2.239\n 161 gctgactgatcgatcgatgct 113 21 0 52.38 61.244 26.44 12.40 35.21 2.244\n 162 agctgactgatcgatcgatgc 112 21 0 52.38 61.244 24.08 19.43 35.21 2.244\n 163 gatcgatcgatgtgcggct 81 19 0 57.89 61.263 19.16 0.00 41.65 2.263\n 164 gctgatcatcgatgctactagc 195 22 0 50.00 59.727 18.08 16.44 45.61 2.273\n 165 gctagctgatcatcgatgctac 191 22 0 50.00 59.727 9.57 5.47 0.00 2.273\n 166 gatcgatcgatgtgcggc 81 18 0 61.11 59.714 18.10 0.95 41.65 2.286\n 167 ctagctagctgactgatacgc 465 21 0 52.38 58.703 14.90 0.00 0.00 2.297\n 168 tagctgatcgatcgatgtgcg 76 21 0 52.38 61.299 31.92 20.26 42.69 2.299\n 169 agctgatcgatcgatgtgc 77 19 0 52.63 58.698 31.83 30.04 35.21 2.302\n 170 gctgatcatcatcgatgctagc 516 22 0 50.00 60.302 10.80 10.34 40.32 2.302\n 171 gctagctgatcatcatcgatgc 512 22 0 50.00 60.302 21.42 7.40 40.32 2.302\n 172 aagcatcggattagctagctga 2 22 0 45.45 60.306 28.29 20.88 0.00 2.306\n 173 gatcgatcgtagcggcga 570 18 0 61.11 60.318 13.01 8.51 45.59 2.318\n 174 atcggattagctagctgatgc 6 21 0 47.62 58.673 17.46 17.46 40.05 2.327\n 175 gcatcggattagctagctgat 4 21 0 47.62 58.673 17.84 15.13 0.00 2.327\n 176 gcggcgatctagctagctg 581 19 0 63.16 61.329 17.07 8.17 38.05 2.329\n 177 tgctagtgatgcatgctagt 24 20 0 45.00 57.636 24.96 11.17 35.89 2.364\n 178 ctactatcatctctgcgcga 357 20 0 50.00 57.636 2.71 2.71 0.00 2.364\n 179 actagctagctgactgatacgc 464 22 0 50.00 60.368 21.52 0.00 0.00 2.368\n 180 gctagctagctgatcatcga 187 20 0 50.00 57.613 34.38 0.24 46.11 2.387\n 181 tctctgcgcgatcgatgcta 366 20 0 55.00 62.413 26.61 17.10 38.48 2.413\n 182 tgatcgatcgatgctagctagt 119 22 0 45.45 59.586 26.44 5.69 35.21 2.414\n 183 actgatcgatcgatgctagcta 117 22 0 45.45 59.586 23.29 7.65 35.21 2.414\n 184 tagctagctgatcgatcgatgt 72 22 0 45.45 59.586 14.29 2.62 35.21 2.414\n 185 agctaggcgatgctagcta 415 19 0 52.63 58.572 17.69 3.08 41.54 2.428\n 186 tagctaggcgatgctagct 414 19 0 52.63 58.572 17.35 17.35 43.53 2.428\n 187 gatcgatcgatgctagctagg 401 21 0 52.38 58.567 23.89 6.29 35.21 2.433\n 188 gctagctagctgactgatcgat 105 22 0 50.00 60.434 34.38 0.00 46.11 2.434\n 189 gatcgatgctagctaggcg 405 19 0 57.89 58.563 15.59 9.02 0.00 2.437\n 190 cgatcgatgctagctaggc 404 19 0 57.89 58.563 14.87 8.45 0.00 2.437\n 191 tagctagctgactgatacgc 466 20 0 50.00 57.549 28.29 0.00 0.00 2.451\n 192 agctagctgactgatcgatc 260 20 0 50.00 57.536 19.32 19.32 0.00 2.464\n 193 agctagctgactgatcgatc 108 20 0 50.00 57.536 19.32 19.32 0.00 2.464\n 194 aaagcatcggattagctagctg 1 22 0 45.45 59.524 28.29 10.80 0.00 2.476\n 195 gctgactgatcgatcatcatgc 265 22 0 50.00 60.493 25.66 25.12 41.77 2.493\n 196 tagctactatcatctctgcgcg 354 22 0 50.00 60.495 0.00 0.00 0.00 2.495\n 197 ctgatcgatcgatgtgcggc 79 20 0 60.00 62.497 15.54 4.15 41.65 2.497\n 198 gctgatcgatcgatgtgcgg 78 20 0 60.00 62.497 29.87 22.23 41.65 2.497\n 199 tcgtagcggcgatctagct 576 19 0 57.89 61.503 11.03 11.03 36.40 2.503\n 200 agcggcgatctagctagct 580 19 0 57.89 61.519 23.74 23.74 42.96 2.519\n 201 ctagctagctgatcatcgatgc 188 22 0 50.00 59.470 21.42 9.22 0.00 2.530\n 202 gctagctagctgatcatcgatg 187 22 0 50.00 59.470 34.38 20.23 46.11 2.530\n 203 tcatctctgcgcgatcga 363 18 0 55.56 59.468 22.07 0.00 38.48 2.532\n 204 tcgatcgatgtgcggcta 83 18 0 55.56 59.465 18.63 0.00 41.65 2.535\n 205 tgatcgatcgatgtgcggc 80 19 0 57.89 61.549 21.27 8.44 41.65 2.549\n 206 ctagctaggcgatgctagctag 413 22 0 54.55 60.561 22.99 22.99 46.84 2.561\n 207 gctagctagctgatcgatcgat 390 22 0 50.00 60.561 34.38 30.53 46.11 2.561\n 208 gctagctagctgatcgatcgat 70 22 0 50.00 60.561 34.38 30.53 46.11 2.561\n 209 ctgcgcgatcgatgctag 369 18 0 61.11 59.415 19.79 13.97 38.48 2.585\n 210 aagcatcggattagctagct 2 20 0 45.00 57.413 23.74 23.74 0.00 2.587\n 211 gctagctgatcatcgatgcta 191 21 0 47.62 58.410 16.61 13.09 0.00 2.590\n 212 tagctagctgatcatcgatgc 189 21 0 47.62 58.410 21.42 9.22 0.00 2.590\n 213 actgatacgcgatgctagc 476 19 0 52.63 58.407 8.61 8.61 0.00 2.593\n 214 gctagctgactgatcgatcatc 261 22 0 50.00 59.406 23.93 21.92 36.62 2.594\n 215 atcgatcgatgctagctagg 402 20 0 50.00 57.396 29.65 6.29 33.56 2.604\n 216 atctctgcgcgatcgatgc 365 19 0 57.89 61.618 22.01 22.01 38.48 2.618\n 217 tgatcgatcgtagcggcg 569 18 0 61.11 60.621 20.58 0.86 0.00 2.621\n 218 atcatctctgcgcgatcgatg 362 21 0 52.38 61.633 18.01 18.01 38.48 2.633\n 219 agctagctgatcgatcgtag 562 20 0 50.00 57.344 17.99 16.86 0.00 2.656\n 220 ctagctagctgatcgatcgt 560 20 0 50.00 57.344 16.40 2.65 0.00 2.656\n 221 gctagctgactgatcgatcat 261 21 0 47.62 58.339 26.67 18.02 36.62 2.661\n 222 ctgatcgatcgtagcggcg 568 19 0 63.16 61.664 14.21 0.86 0.00 2.664\n 223 ctgactgatacgcgatgct 473 19 0 52.63 58.330 2.33 0.00 0.00 2.670\n 224 agctgactgatacgcgatg 471 19 0 52.63 58.330 0.00 0.00 0.00 2.670\n 225 gctagctgatcgatcgtagcg 563 21 0 57.14 61.676 24.18 16.49 0.00 2.676\n 226 ctagctgactgatcgatcga 110 20 0 50.00 57.276 22.52 22.52 0.00 2.724\n 227 agctagctactgatcgatgcta 303 22 0 45.45 59.252 17.56 12.23 0.00 2.748\n 228 tagctagctactgatcgatgct 302 22 0 45.45 59.252 27.80 11.51 0.00 2.748\n 229 gactgatacgcgatgctagcta 475 22 0 50.00 60.751 17.69 3.08 0.00 2.751\n 230 actgatacgcgatgctagctag 476 22 0 50.00 60.752 17.46 17.46 0.00 2.752\n 231 gactgatcgatcgatgctagct 116 22 0 50.00 60.753 18.04 9.56 35.21 2.753\n 232 gctagctgactgatcgatcgat 109 22 0 50.00 60.753 30.53 30.53 37.90 2.753\n 233 tgcgcgatcgatgctagcta 370 20 0 55.00 62.756 26.61 9.85 38.48 2.756\n 234 gcggcgatctagctagctga 581 20 0 60.00 62.765 21.57 16.66 38.70 2.765\n 235 agcggcgatctagctagctg 580 20 0 60.00 62.771 17.07 8.17 44.87 2.771\n 236 ctactatcatctctgcgcgatc 357 22 0 50.00 59.220 4.99 0.00 0.00 2.780\n 237 tatcatctctgcgcgatcg 361 19 0 52.63 58.199 12.19 12.19 39.07 2.801\n 238 tactatcatctctgcgcgatcg 358 22 0 50.00 60.811 12.19 12.19 39.07 2.811\n 239 tagctagctgactgatcgatca 259 22 0 45.45 59.187 28.29 26.99 35.44 2.813\n 240 gctgatcgatcgatgctagcta 398 22 0 50.00 60.816 27.88 12.57 35.21 2.816\n 241 tagctgatcgatcgatgctagc 396 22 0 50.00 60.816 30.84 27.90 36.80 2.816\n 242 gctagctgatcgatcgatgcta 394 22 0 50.00 60.816 34.11 32.56 36.80 2.816\n 243 tagctagctgatcgatcgatgc 392 22 0 50.00 60.816 24.08 21.09 35.21 2.816\n 244 gctaggcgatgctagctag 416 19 0 57.89 58.179 17.46 17.46 35.42 2.821\n 245 ctagctaggcgatgctagc 413 19 0 57.89 58.179 18.68 9.44 36.95 2.821\n 246 gctagctaggcgatgctag 412 19 0 57.89 58.179 23.16 23.16 38.59 2.821\n 247 catctctgcgcgatcgatgc 364 20 0 60.00 62.823 22.01 22.01 38.48 2.823\n 248 aaagcatcggattagctagct 1 21 0 42.86 58.168 23.74 23.74 0.00 2.832\n 249 ctgactgatcgatcgatgctag 114 22 0 50.00 59.155 22.81 19.44 35.21 2.845\n 250 ctagctgactgatcgatcgatg 110 22 0 50.00 59.155 23.05 13.21 35.21 2.845\n 251 tactatcatctctgcgcgatc 358 21 0 47.62 58.155 4.99 0.00 0.00 2.845\n 252 gctagctactgatcgatgctac 304 22 0 50.00 59.151 8.57 4.26 0.00 2.849\n 253 ctactatcatctctgcgcgat 357 21 0 47.62 58.150 4.99 2.52 0.00 2.850\n 254 agctgatcatcgatgctact 194 20 0 45.00 57.134 17.14 8.95 0.00 2.866\n 255 gctagctagctgatcatcgat 187 21 0 47.62 58.132 34.38 0.00 46.11 2.868\n 256 ctgatacgcgatgctagct 477 19 0 52.63 58.107 17.69 1.35 0.00 2.893\n 257 ggcgatctagctagctgac 583 19 0 57.89 58.106 14.84 7.25 37.58 2.894\n 258 tgactgatcgatcgatgctag 115 21 0 47.62 58.084 22.81 19.44 35.21 2.916\n 259 ctgactgatcgatcgatgcta 114 21 0 47.62 58.084 26.44 14.64 35.21 2.916\n 260 tagctgactgatcgatcgatg 111 21 0 47.62 58.084 23.05 13.21 35.21 2.916\n 261 actgatcgatcatcatgctagc 269 22 0 45.45 59.071 26.67 8.61 41.77 2.929\n 262 agctgactgatcgatcatca 264 20 0 45.00 57.064 26.49 26.49 39.98 2.936\n 263 ctagctagctgatcgatcga 391 20 0 50.00 57.060 22.52 22.52 0.00 2.940\n 264 ctagctagctgatcgatcga 71 20 0 50.00 57.060 22.52 22.52 0.00 2.940\n 265 gatcgatcgatgtgcggctag 81 21 0 57.14 61.947 19.16 0.00 41.65 2.947\n 266 tgctagctaggcgatgct 411 18 0 55.56 59.050 17.69 7.53 0.00 2.950\n 267 gctgatcgatcgtagcggc 567 19 0 63.16 61.960 20.49 19.38 0.00 2.960\n 268 cgatcgatgtgcggctag 84 18 0 61.11 59.032 10.82 0.00 41.65 2.968\n 269 tgatcgatcgatgtgcggct 80 20 0 55.00 62.987 22.21 0.00 41.65 2.987\n 270 ctgactgatcgatcatcatgct 266 22 0 45.45 59.004 20.99 6.82 41.77 2.996\n 271 agctgactgatcgatcatcatg 264 22 0 45.45 59.004 22.70 19.51 41.77 2.996\n 272 agctagctgactgatacgcga 467 21 0 52.38 62.000 17.99 0.00 0.00 3.000\n 273 tgactgatcgatcgatgctagc 115 22 0 50.00 61.008 18.17 12.52 35.21 3.008\n 274 gctgactgatcgatcgatgcta 113 22 0 50.00 61.008 26.44 14.64 35.21 3.008\n 275 tagctgactgatcgatcgatgc 111 22 0 50.00 61.008 24.08 19.43 35.21 3.008\n 276 agctagctgatcgatcgatgtg 73 22 0 50.00 61.010 17.99 6.93 35.21 3.010\n 277 ctgatcgatcgatgctagctag 399 22 0 50.00 58.963 19.70 17.46 35.21 3.037\n 278 ctagctgatcgatcgatgctag 395 22 0 50.00 58.963 37.86 37.86 43.17 3.037\n 279 ctagctagctgatcgatcgatg 391 22 0 50.00 58.963 21.99 11.03 35.21 3.037\n 280 ctgatcgatcgatgctagctag 118 22 0 50.00 58.963 19.70 17.46 35.21 3.037\n 281 ctagctagctgatcgatcgatg 71 22 0 50.00 58.963 21.99 11.03 35.21 3.037\n 282 gactgatcgatcatcatgctagc 268 23 0 47.83 60.053 24.51 9.03 41.77 3.053\n 283 gctagtgatgcatgctagtagtg 25 23 0 47.83 59.929 24.96 10.54 0.00 3.071\n 284 gctactatcatctctgcgcgat 356 22 0 50.00 61.073 4.99 2.52 0.00 3.073\n 285 gtagcggcgatctagctag 578 19 0 57.89 57.903 15.64 15.64 37.58 3.097\n 286 tgactgatcgatcatcatgct 267 21 0 42.86 57.900 26.79 12.28 41.77 3.100\n 287 ctagctactatcatctctgcgc 353 22 0 50.00 58.892 0.00 0.00 0.00 3.108\n 288 gctagctactatcatctctgcg 352 22 0 50.00 58.892 8.21 0.00 0.00 3.108\n 289 ctagctagctactgatcgatgc 301 22 0 50.00 58.892 14.00 1.76 0.00 3.108\n 290 gctagctagctactgatcgatg 300 22 0 50.00 58.892 34.38 7.78 46.11 3.108\n 291 catcgatcgatgctagtatgct 325 22 0 45.45 58.885 37.80 10.02 44.93 3.115\n 292 tgatcgatcgatgctagctag 400 21 0 47.62 57.879 26.44 17.46 35.21 3.121\n 293 ctgatcgatcgatgctagcta 399 21 0 47.62 57.879 19.70 3.77 35.21 3.121\n 294 tagctgatcgatcgatgctag 396 21 0 47.62 57.879 34.03 27.12 36.80 3.121\n 295 ctagctgatcgatcgatgcta 395 21 0 47.62 57.879 34.11 32.56 36.80 3.121\n 296 tagctagctgatcgatcgatg 392 21 0 47.62 57.879 21.99 11.03 35.21 3.121\n 297 tgatcgatcgatgctagctag 119 21 0 47.62 57.879 26.44 17.46 35.21 3.121\n 298 ctgatcgatcgatgctagcta 118 21 0 47.62 57.879 19.70 3.77 35.21 3.121\n 299 tagctagctgatcgatcgatg 72 21 0 47.62 57.879 21.99 11.03 35.21 3.121\n 300 gatcgatcgatgctagctagt 120 21 0 47.62 57.878 23.89 3.56 35.21 3.122\n 301 ctatcatctctgcgcgatcgat 360 22 0 50.00 61.132 22.07 11.47 38.48 3.132\n 302 tgatcgatcgtagcggcga 569 19 0 57.89 62.144 20.58 8.51 45.59 3.144\n 303 tcgtagcggcgatctagctag 576 21 0 57.14 62.173 15.64 15.64 36.40 3.173\n 304 tactagctagctgactgatacgc 463 23 0 47.83 60.176 13.17 0.00 0.00 3.176\n 305 ctgatcatcatcgatgctagct 517 22 0 45.45 58.807 17.69 1.76 40.32 3.193\n 306 agctgatcatcatcgatgctag 515 22 0 45.45 58.807 5.93 2.76 40.32 3.193\n 307 ctagctgatcatcatcgatgct 513 22 0 45.45 58.807 14.14 8.34 40.32 3.193\n 308 agctagctgatcatcatcgatg 511 22 0 45.45 58.807 20.23 20.23 41.48 3.193\n 309 ctgatcgatcatcatgctagct 270 22 0 45.45 58.807 26.67 0.00 41.77 3.193\n 310 ctagctgactgatcgatcgat 110 21 0 47.62 57.806 30.53 30.53 37.90 3.194\n 311 ttagctagctgactgatcgatca 258 23 0 43.48 59.798 28.29 26.99 35.44 3.202\n 312 tagctactatcatctctgcgc 354 21 0 47.62 57.798 0.00 0.00 0.00 3.202\n 313 gctagctactgatcgatgcta 304 21 0 47.62 57.798 12.99 12.23 0.00 3.202\n 314 tagctagctactgatcgatgc 302 21 0 47.62 57.798 27.80 1.76 0.00 3.202\n 315 tctctgcgcgatcgatgc 366 18 0 61.11 61.229 22.01 22.01 38.48 3.229\n 316 ctctgcgcgatcgatgct 367 18 0 61.11 61.232 26.61 0.00 38.48 3.232\n 317 agctagctactatcatctctgcg 351 23 0 47.83 60.238 17.56 0.00 0.00 3.238\n 318 ctagctagctactgatcgatgct 301 23 0 47.83 60.238 14.00 11.51 0.00 3.238\n 319 ctgatcgatcgtagcggc 568 18 0 61.11 58.727 14.21 0.00 0.00 3.273\n 320 gctgatcgatcgtagcgg 567 18 0 61.11 58.727 20.49 15.03 0.00 3.273\n 321 agctaggcgatgctagct 415 18 0 55.56 58.725 17.69 13.00 39.84 3.275\n 322 tgctagtgatgcatgctagtagt 24 23 0 43.48 60.302 24.96 12.98 35.89 3.302\n 323 gcgcgatcgatgctagct 371 18 0 61.11 61.306 21.66 1.35 38.48 3.306\n 324 tgatcatcatcgatgctagct 518 21 0 42.86 57.691 17.69 1.76 40.32 3.309\n 325 agctgatcatcatcgatgcta 515 21 0 42.86 57.691 0.24 0.00 40.32 3.309\n 326 tagctgatcatcatcgatgct 514 21 0 42.86 57.691 14.14 8.34 40.32 3.309\n 327 tgatcgatcatcatgctagct 271 21 0 42.86 57.691 27.48 0.00 37.38 3.309\n 328 ctagctagctgactgatacgcg 465 22 0 54.55 61.313 14.90 3.89 0.00 3.313\n 329 tgctagtgatgcatgctagtag 24 22 0 45.45 58.673 24.96 19.76 35.89 3.327\n 330 gctagtgatgcatgctagtagt 25 22 0 45.45 58.672 24.96 12.98 0.00 3.328\n 331 tagctagctgatcatcgatgcta 189 23 0 43.48 59.671 17.82 15.89 0.00 3.329\n 332 agctagctgactgatacgc 467 19 0 52.63 57.642 17.99 0.00 0.00 3.358\n 333 tatcatctctgcgcgatcgatg 361 22 0 50.00 61.383 18.01 18.01 38.48 3.383\n 334 agctgactgatcgatcatcat 264 21 0 42.86 57.616 26.31 18.90 41.77 3.384\n 335 actagctagctgatcatcatcga 508 23 0 43.48 59.607 22.43 0.00 0.00 3.393\n 336 tagctagctgactgatcgatcat 259 23 0 43.48 59.607 28.29 18.02 36.62 3.393\n 337 gatgctagctaggcgatgctag 409 22 0 54.55 61.393 23.16 23.16 38.59 3.393\n 338 cggcgatctagctagctgact 582 21 0 57.14 62.394 17.44 7.44 38.70 3.394\n 339 ctagctagctgatcgatcgat 391 21 0 47.62 57.600 30.53 30.53 37.90 3.400\n 340 ctagctagctgatcgatcgat 71 21 0 47.62 57.600 30.53 30.53 37.90 3.400\n 341 actgatcgatcatcatgctagct 269 23 0 43.48 60.428 26.67 4.70 41.77 3.428\n 342 ctagctagctgactgatcgatc 106 22 0 50.00 58.567 19.32 19.32 0.00 3.433\n 343 ctgactgatcgatcatcatgc 266 21 0 47.62 57.562 20.99 12.19 41.77 3.438\n 344 gctgactgatcgatcatcatg 265 21 0 47.62 57.562 22.70 19.51 41.77 3.438\n 345 gatcgatcgatgctagctaggc 401 22 0 54.55 61.448 23.89 8.45 35.21 3.448\n 346 gtgatgcatgctagtagtgatgt 29 23 0 43.48 59.551 11.60 0.00 0.00 3.449\n 347 tgctagtgatgcatgctagta 24 21 0 42.86 57.546 24.96 21.25 35.89 3.454\n 348 tagcggcgatctagctagctg 579 21 0 57.14 62.457 18.98 9.30 45.57 3.457\n 349 gtagcggcgatctagctagct 578 21 0 57.14 62.458 23.74 23.74 46.60 3.458\n 350 tagctgatcgatcgtagcg 565 19 0 52.63 57.539 25.02 11.96 0.00 3.461\n 351 gctagctagctactgatcgat 300 21 0 47.62 57.517 34.38 0.00 46.11 3.483\n 352 agctagctactgatcgatgctac 303 23 0 47.83 60.487 17.56 7.81 0.00 3.487\n 353 atcgatcgatgctagtatgct 326 21 0 42.86 57.502 29.65 2.17 33.56 3.498\n 354 agctactgatcgatgctacatc 307 22 0 45.45 58.484 7.41 0.00 37.97 3.516\n 355 agtgatgcatgctagtagtga 28 21 0 42.86 57.471 0.00 0.00 0.00 3.529\n 356 gactgatcgatcgatgctagcta 116 23 0 47.83 60.546 18.04 4.19 35.21 3.546\n 357 ctgatcgatcgatgctagctagt 118 23 0 47.83 60.547 22.18 3.56 35.21 3.547\n 358 actgatcgatcgatgctagctag 117 23 0 47.83 60.547 23.29 17.46 35.21 3.547\n 359 ctagctagctgatcgatcgatgt 71 23 0 47.83 60.547 14.29 2.62 35.21 3.547\n 360 catcgatcgatgctagtatgc 325 21 0 47.62 57.452 37.80 0.00 44.93 3.548\n 361 tagctagctgactgatcgatc 259 21 0 47.62 57.451 28.29 19.32 0.00 3.549\n 362 tagctagctgactgatcgatc 107 21 0 47.62 57.451 28.29 19.32 0.00 3.549\n 363 ctagctagctgactgatcgat 106 21 0 47.62 57.445 14.90 0.00 0.00 3.555\n 364 tcgatgctagctaggcga 407 18 0 55.56 58.427 15.59 13.52 0.00 3.573\n 365 tgatcgatcgatgctagctagta 119 23 0 43.48 59.424 26.44 18.77 35.21 3.576\n 366 ctgcgcgatcgatgctagc 369 19 0 63.16 62.586 20.26 12.12 38.48 3.586\n 367 agctagctgatcatcatcgat 511 21 0 42.86 57.405 17.99 0.00 0.00 3.595\n 368 tgcgcgatcgatgctagc 370 18 0 61.11 61.605 26.61 17.77 38.48 3.605\n 369 ctagctagctgatcgatcgtag 560 22 0 50.00 58.387 16.86 16.86 0.00 3.613\n 370 actagctagctgactgatacg 464 21 0 47.62 57.384 21.52 2.77 0.00 3.616\n 371 ctagctgactgatacgcga 469 19 0 52.63 57.370 16.29 0.00 0.00 3.630\n 372 gctactagctagctgactgat 461 21 0 47.62 57.360 15.96 3.00 44.92 3.640\n 373 ctgatcatcatcgatgctagc 517 21 0 47.62 57.358 8.61 8.61 40.32 3.642\n 374 gctgatcatcatcgatgctag 516 21 0 47.62 57.358 5.93 2.76 40.32 3.642\n 375 ctagctgatcatcatcgatgc 513 21 0 47.62 57.358 21.42 7.40 40.32 3.642\n 376 gctagctgatcatcatcgatg 512 21 0 47.62 57.358 20.23 20.23 41.48 3.642\n 377 ctgatcgatcatcatgctagc 270 21 0 47.62 57.358 26.67 8.61 41.77 3.642\n 378 agctactgatcgatgctacat 307 21 0 42.86 57.344 7.41 0.00 0.00 3.656\n 379 tgatcgatcgatgtgcggcta 80 21 0 52.38 62.663 22.21 0.24 41.65 3.663\n 380 atctctgcgcgatcgatg 365 18 0 55.56 58.327 12.03 4.19 38.48 3.673\n 381 catctctgcgcgatcgat 364 18 0 55.56 58.327 22.07 1.26 38.48 3.673\n 382 atcatctctgcgcgatcg 362 18 0 55.56 58.327 12.19 12.19 39.07 3.673\n 383 aagcatcggattagctagctgat 2 23 0 43.48 60.682 17.84 15.13 0.00 3.682\n 384 agtgatgcatgctagtagtgatg 28 23 0 43.48 59.299 7.49 7.49 0.00 3.701\n 385 gatcgatgctagctaggcgatg 405 22 0 54.55 61.702 24.26 6.24 0.00 3.702\n 386 atctctgcgcgatcgatgcta 365 21 0 52.38 62.723 26.61 17.10 38.48 3.723\n 387 tagctagctgactgatacgcga 466 22 0 50.00 61.730 28.29 0.00 0.00 3.730\n 388 tagctagctgatcgatcgtag 561 21 0 47.62 57.269 16.86 16.86 0.00 3.731\n 389 ctagctagctgatcgatcgta 560 21 0 47.62 57.269 11.68 3.07 0.00 3.731\n 390 tcgatcgatgctagctagtag 122 21 0 47.62 57.269 18.63 2.63 0.00 3.731\n 391 gctagctactgatcgatgctaca 304 23 0 47.83 60.734 11.21 0.06 0.00 3.734\n 392 agctagctgactgatcgatcatc 260 23 0 47.83 60.736 23.93 21.92 36.62 3.736\n 393 agctagctgactgatcgatcga 108 22 0 50.00 61.737 22.52 22.52 0.00 3.737\n 394 tctctgcgcgatcgatgct 366 19 0 57.89 62.740 26.61 0.00 38.48 3.740\n 395 tgatgcatgctagtagtgatgt 30 22 0 40.91 58.256 11.60 0.00 0.00 3.744\n 396 tgatcgatcgatgtgcgg 80 18 0 55.56 58.244 21.27 0.00 41.65 3.756\n 397 cgatcgatgctagctaggcga 404 21 0 57.14 62.770 16.30 16.30 0.00 3.770\n 398 tcgatcgatgctagctaggcg 403 21 0 57.14 62.770 18.63 11.67 0.00 3.770\n 399 atcgatcgatgcatgcatg 443 19 0 47.37 57.226 29.65 23.31 37.30 3.774\n 400 catcgatcgatgcatgcat 442 19 0 47.37 57.226 37.80 33.45 44.93 3.774\n 401 actagctagctgatcatcatcg 508 22 0 45.45 58.219 22.43 3.40 0.00 3.781\n 402 ctgatcatcgatgctactagct 196 22 0 45.45 58.219 10.86 0.00 45.92 3.781\n 403 agctgatcatcgatgctactag 194 22 0 45.45 58.219 13.67 9.68 0.00 3.781\n 404 ctagctgatcatcgatgctact 192 22 0 45.45 58.219 14.85 7.80 0.00 3.781\n 405 tttagctagctgactgatcga 257 21 0 42.86 57.216 0.38 0.00 0.00 3.784\n 406 tagctagctgatcgatcgatgtg 72 23 0 47.83 60.793 10.14 4.94 35.21 3.793\n 407 gctagctagctgatcatcatct 146 22 0 45.45 58.203 34.38 0.00 46.11 3.797\n 408 ctagctagctgatcatcgatgct 188 23 0 47.83 60.799 16.29 15.30 0.00 3.799\n 409 agctagctactatcatcgatcga 429 23 0 43.48 59.170 22.52 22.52 0.00 3.830\n 410 ttagctagctgactgatcgatc 258 22 0 45.45 58.159 28.29 19.32 0.00 3.841\n 411 ctagctgactgatcgatcatca 262 22 0 45.45 58.155 26.49 26.49 39.98 3.845\n 412 aaagcatcggattagctagctga 1 23 0 43.48 60.870 28.29 20.88 0.00 3.870\n 413 agctgactgatacgcgatgct 471 21 0 52.38 62.876 7.57 2.13 0.00 3.876\n 414 tagctagctactgatcgatgcta 302 23 0 43.48 59.102 27.80 12.23 0.00 3.898\n 415 tcatcatcgatgctagctagt 521 21 0 42.86 57.067 22.18 3.56 40.32 3.933\n 416 tcgatcatcatgctagctact 274 21 0 42.86 57.067 0.00 0.00 0.00 3.933\n 417 tgatcatcgatgctactagct 197 21 0 42.86 57.067 17.14 0.00 45.92 3.933\n 418 agctgatcatcgatgctacta 194 21 0 42.86 57.067 17.14 4.89 0.00 3.933\n 419 tagctgatcatcgatgctact 193 21 0 42.86 57.067 14.85 7.80 0.00 3.933\n 420 tcgatcgatgctagtatgctag 327 22 0 45.45 58.044 18.63 13.77 46.09 3.956\n 421 gcgatctagctagctgact 584 19 0 52.63 57.034 17.44 7.44 0.00 3.966\n 422 gctactgatcgatgctacatc 308 21 0 47.62 57.028 2.44 0.00 37.97 3.972\n 423 cggcgatctagctagctg 582 18 0 61.11 58.018 17.07 8.17 37.58 3.982\n 424 gctagctgactgatcgatcatca 261 23 0 47.83 60.983 26.49 26.49 39.98 3.983\n 425 actatcatctctgcgcgat 359 19 0 47.37 57.015 4.99 2.52 0.00 3.985\n 426 catcggattagctagctgatg 5 21 0 47.62 57.003 23.69 23.29 0.00 3.997\n 427 tagctgactgatcgatcatca 263 21 0 42.86 57.000 26.49 26.49 39.98 4.000\n 428 actagctagctgatcatcatcgat 508 24 0 41.67 59.995 22.43 0.00 0.00 4.005\n 429 agtgatgcatgctagtagtgat 28 22 0 40.91 57.984 0.00 0.00 0.00 4.016\n 430 ctagctagctgatcatcatcga 509 22 0 45.45 57.958 11.68 0.00 0.00 4.042\n 431 gctgatcatcgatgctactagct 195 23 0 47.83 61.046 20.91 5.24 45.92 4.046\n 432 agctgatcatcgatgctactagc 194 23 0 47.83 61.046 20.78 20.78 45.61 4.046\n 433 gctagctgatcatcgatgctact 191 23 0 47.83 61.046 12.59 8.92 0.00 4.046\n 434 agctagctgatcatcgatgctac 190 23 0 47.83 61.046 17.99 7.99 0.00 4.046\n 435 tagctagctactatcatctctgcg 350 24 0 45.83 60.058 27.80 0.00 0.00 4.058\n 436 ctagctagctactgatcgatgcta 301 24 0 45.83 60.058 14.00 12.23 0.00 4.058\n 437 agctactatcatctctgcgcga 355 22 0 50.00 62.058 2.71 2.71 0.00 4.058\n 438 gctatttagctagctgactgatcg 253 24 0 45.83 60.060 7.27 0.00 46.11 4.060\n 439 tgatcgatcatcatgctagctac 271 23 0 43.48 58.931 27.48 0.00 37.38 4.069\n 440 gtgatgcatgctagtagtgatg 29 22 0 45.45 57.921 7.49 7.49 0.00 4.079\n 441 ctagctagctgactgatcgatcg 106 23 0 52.17 61.091 16.84 13.89 0.00 4.091\n 442 ctagctactgatcgatgctaca 305 22 0 45.45 57.898 13.79 1.61 0.00 4.102\n 443 cggcgatctagctagctgacta 582 22 0 54.55 62.109 17.44 5.40 38.70 4.109\n 444 atgctagctaggcgatgc 410 18 0 55.56 57.890 10.59 0.00 0.00 4.110\n 445 ctgatcgatcatcatgctagctac 270 24 0 45.83 59.882 26.67 0.00 41.77 4.118\n 446 gctactagctagctgatcatca 505 22 0 45.45 57.879 14.37 0.00 44.92 4.121\n 447 gctactagctagctgatcatca 208 22 0 45.45 57.879 14.37 0.00 44.92 4.121\n 448 ctgactgatacgcgatgctagc 473 22 0 54.55 62.128 8.61 8.61 0.00 4.128\n 449 gctgactgatacgcgatgctag 472 22 0 54.55 62.128 1.70 0.00 0.00 4.128\n 450 ctagctgactgatacgcgatgc 469 22 0 54.55 62.128 3.47 0.00 0.00 4.128\n 451 gctagctgactgatacgcgatg 468 22 0 54.55 62.128 8.21 0.00 0.00 4.128\n 452 tgactgatcgatcatcatgctag 267 23 0 43.48 58.866 26.79 18.40 41.77 4.134\n 453 ctgactgatcgatcatcatgcta 266 23 0 43.48 58.866 20.99 8.89 41.77 4.134\n 454 tagctgactgatcgatcatcatg 263 23 0 43.48 58.866 22.70 19.51 41.77 4.134\n 455 ctagctagctgatcgatcgtagc 560 23 0 52.17 61.151 26.87 26.87 0.00 4.151\n 456 gctagctagctgatcgatcgtag 559 23 0 52.17 61.151 34.38 16.86 46.11 4.151\n 457 ctgatcgatcgatgctagctagg 399 23 0 52.17 61.158 22.67 6.29 35.21 4.158\n 458 gatcgatcgatgctagctagtag 120 23 0 47.83 58.829 23.89 2.63 35.21 4.171\n 459 ttagctagctgactgatcgatcat 258 24 0 41.67 60.177 28.29 18.02 36.62 4.177\n 460 ctgactgatcgatcatcatgctag 266 24 0 45.83 59.822 20.99 12.80 41.77 4.178\n 461 ctagctgactgatcgatcatcatg 262 24 0 45.83 59.822 22.70 19.51 41.77 4.178\n 462 ctagctgatcgatcgatgtgcg 75 22 0 54.55 62.180 31.92 20.85 42.69 4.180\n 463 tttagctagctgactgatcgatc 257 23 0 43.48 58.807 19.32 19.32 0.00 4.193\n 464 tgactgatcgatcatcatgcta 267 22 0 40.91 57.803 26.79 13.11 41.77 4.197\n 465 gctagctactatcatcgatcga 430 22 0 45.45 57.783 22.52 22.52 0.00 4.217\n 466 gatcgatcgatgctagctagta 120 22 0 45.45 57.783 23.89 18.77 35.21 4.217\n 467 agctagctactatcatcgatcg 429 22 0 45.45 57.777 17.56 9.87 0.00 4.223\n 468 atcgatcgatgctagctagtag 121 22 0 45.45 57.777 29.65 2.63 33.56 4.223\n 469 tgatcatcatcgatgctagctagt 518 24 0 41.67 60.238 22.18 3.56 40.32 4.238\n 470 tgatcgatcatcatgctagctact 271 24 0 41.67 60.238 27.48 0.00 37.38 4.238\n 471 actgatcgatcatcatgctagcta 269 24 0 41.67 60.238 26.67 2.76 41.77 4.238\n 472 catcgatcgatgctagtatgcta 325 23 0 43.48 58.753 37.80 6.23 44.93 4.247\n 473 tttagctagctgactgatcgat 257 22 0 40.91 57.736 0.38 0.00 0.00 4.264\n 474 atttagctagctgactgatcga 256 22 0 40.91 57.736 4.16 0.00 0.00 4.264\n 475 cgcgatcgatgctagcta 372 18 0 55.56 57.717 22.07 3.08 38.48 4.283\n 476 catcgatcgatgctagtatgctag 325 24 0 45.83 59.708 37.80 16.01 44.93 4.292\n 477 tagctagctactgatcgatgctac 302 24 0 45.83 60.297 27.80 7.81 0.00 4.297\n 478 agcatcggattagctagctgatg 3 23 0 47.83 61.299 27.81 27.81 33.28 4.299\n 479 agctagctgactgatacgcgat 467 22 0 50.00 62.317 17.99 0.00 0.00 4.317\n 480 tgatcatcatcgatgctagctag 518 23 0 43.48 58.678 17.46 17.46 40.32 4.322\n 481 ctgatcatcatcgatgctagcta 517 23 0 43.48 58.678 17.69 2.41 40.32 4.322\n 482 tagctgatcatcatcgatgctag 514 23 0 43.48 58.678 9.90 2.76 40.32 4.322\n 483 ctagctgatcatcatcgatgcta 513 23 0 43.48 58.678 14.58 9.63 40.32 4.322\n 484 tagctagctgatcatcatcgatg 510 23 0 43.48 58.678 20.23 20.23 41.48 4.322\n 485 ctgatcgatcatcatgctagcta 270 23 0 43.48 58.678 26.67 2.76 41.77 4.322\n 486 gatcatcatcgatgctagctagt 519 23 0 43.48 58.677 22.18 3.56 40.32 4.323\n 487 gatcgatcatcatgctagctact 272 23 0 43.48 58.677 21.11 0.00 0.00 4.323\n 488 gctagctagctgactgatcgatc 105 23 0 52.17 61.341 34.38 19.32 46.11 4.341\n 489 tgatcgatcgatgctagctagtag 119 24 0 45.83 60.356 26.44 2.63 35.21 4.356\n 490 ctgatcgatcgatgctagctagta 118 24 0 45.83 60.356 22.18 18.77 35.21 4.356\n 491 ctgatcatcatcgatgctagctag 517 24 0 45.83 59.644 17.46 17.46 40.32 4.356\n 492 ctagctgatcatcatcgatgctag 513 24 0 45.83 59.644 19.54 18.30 42.07 4.356\n 493 ctagctagctgatcatcatcgatg 509 24 0 45.83 59.644 20.23 20.23 41.48 4.356\n 494 tttagctagctgactgatcgatca 257 24 0 41.67 60.358 26.99 26.99 35.44 4.358\n 495 actatcatctctgcgcgatcga 359 22 0 50.00 62.365 22.07 1.72 38.48 4.365\n 496 agctgatcgatcgtagcg 566 18 0 55.56 57.634 25.02 11.96 0.00 4.366\n 497 gctactagctagctgactgatac 461 23 0 47.83 58.626 15.96 1.42 44.92 4.374\n 498 agctgatcgatcgatgctagct 397 22 0 50.00 62.388 30.32 30.32 38.42 4.388\n 499 agctagctgatcgatcgatgct 393 22 0 50.00 62.388 33.87 33.38 38.16 4.388\n 500 ctagctgactgatcgatcatcat 262 23 0 43.48 58.612 26.31 20.43 41.77 4.388\n 501 agctagctactatcatctctgc 351 22 0 45.45 57.608 17.56 0.00 0.00 4.392\n 502 ctagctactatcatctctgcgcg 353 23 0 52.17 61.393 0.00 0.00 0.00 4.393\n 503 tgatcatcatcgatgctagcta 518 22 0 40.91 57.602 17.69 3.08 40.32 4.398\n 504 tagctgatcatcatcgatgcta 514 22 0 40.91 57.602 15.95 9.16 40.32 4.398\n 505 tgatcgatcatcatgctagcta 271 22 0 40.91 57.602 27.48 3.08 37.38 4.398\n 506 atcatcatcgatgctagctagt 520 22 0 40.91 57.595 22.18 3.56 40.32 4.405\n 507 atcgatcatcatgctagctact 273 22 0 40.91 57.595 0.00 0.00 0.00 4.405\n 508 agctagctactatcatcgatcgat 429 24 0 41.67 59.573 25.37 25.37 35.13 4.427\n 509 gctagctgatcgatcgatgtgc 74 22 0 54.55 62.443 31.83 30.04 35.21 4.443\n 510 tagctgactgatcgatcatcat 263 22 0 40.91 57.531 26.31 20.43 41.77 4.469\n 511 tagctagctgactgatcgatcga 107 23 0 47.83 61.487 28.29 22.52 0.00 4.487\n 512 atcgatcgatgctagtatgctag 326 23 0 43.48 58.501 29.65 13.77 46.09 4.499\n 513 ctagtgatgcatgctagtagtga 26 23 0 43.48 58.483 20.00 1.46 0.00 4.517\n 514 tagctagctgactgatcgatcatc 259 24 0 45.83 60.536 28.29 21.92 36.62 4.536\n 515 tactagctagctgatcatcatcga 507 24 0 41.67 59.449 0.00 0.00 0.00 4.551\n 516 gctagctagctactatcatcga 426 22 0 45.45 57.437 34.38 0.00 46.11 4.563\n 517 tgactgatacgcgatgctagct 474 22 0 50.00 62.569 17.69 1.35 0.00 4.569\n 518 agctgactgatacgcgatgcta 471 22 0 50.00 62.569 7.57 0.00 0.00 4.569\n 519 tagctgactgatacgcgatgct 470 22 0 50.00 62.569 10.87 8.44 0.00 4.569\n 520 atcgatcgatgctagtatgcta 326 22 0 40.91 57.423 29.65 0.00 33.56 4.577\n 521 ctagctagctgatcatcatcgat 509 23 0 43.48 58.422 11.68 0.00 0.00 4.578\n 522 agctgactgatcgatcgatgct 112 22 0 50.00 62.580 26.44 23.13 35.21 4.580\n 523 ctagctagctgatcatcgatgcta 188 24 0 45.83 60.596 16.78 15.81 0.00 4.596\n 524 gtgatgcatgctagtagtgatgta 29 24 0 41.67 59.398 11.60 8.84 0.00 4.602\n 525 gctgatcatcatcgatgctagct 516 23 0 47.83 61.603 20.15 8.14 40.32 4.603\n 526 agctgatcatcatcgatgctagc 515 23 0 47.83 61.603 20.04 19.26 40.32 4.603\n 527 gctagctgatcatcatcgatgct 512 23 0 47.83 61.603 14.14 8.34 40.32 4.603\n 528 agctagctgatcatcatcgatgc 511 23 0 47.83 61.603 21.42 7.40 40.32 4.603\n 529 tagtgatgcatgctagtagtga 27 22 0 40.91 57.391 0.01 0.00 0.00 4.609\n 530 ctactagctagctgactgatacg 462 23 0 47.83 58.387 3.12 0.00 0.00 4.613\n 531 tagctactgatcgatgctacatc 306 23 0 43.48 58.368 13.79 0.00 37.97 4.632\n 532 gactgatacgcgatgctagctag 475 23 0 52.17 61.633 17.46 17.46 0.00 4.633\n 533 ctagctactgatcgatgctacat 305 23 0 43.48 58.364 13.79 0.09 0.00 4.636\n 534 gctagctactatcatctctgcgc 352 23 0 52.17 61.644 8.21 0.00 0.00 4.644\n 535 gctagctagctactgatcgatgc 300 23 0 52.17 61.644 34.38 12.71 46.11 4.644\n 536 gctactagctagctgatcatcat 505 23 0 43.48 58.350 14.37 0.00 44.92 4.650\n 537 gctactagctagctgatcatcat 208 23 0 43.48 58.350 14.37 0.00 44.92 4.650\n 538 ctagctactgatcgatgctacatc 305 24 0 45.83 59.349 13.79 0.00 37.97 4.651\n 539 gctactagctagctgatcatcatc 505 24 0 45.83 59.343 14.37 0.00 44.92 4.657\n 540 gctactagctagctgatcatcatc 208 24 0 45.83 59.343 14.37 0.00 44.92 4.657\n 541 gctgatcatcatctagctagtagc 154 24 0 45.83 59.343 15.25 15.25 45.79 4.657\n 542 tagctagctgatcatcatcgat 510 22 0 40.91 57.329 10.14 0.00 0.00 4.671\n 543 ctactatcatctctgcgcgatcg 357 23 0 52.17 61.686 12.19 12.19 39.07 4.686\n 544 tactagctagctgactgatacg 463 22 0 45.45 57.310 13.17 0.00 0.00 4.690\n 545 gctgatcgatcgatgctagctag 398 23 0 52.17 61.697 27.88 18.22 35.21 4.697\n 546 ctagctgatcgatcgatgctagc 395 23 0 52.17 61.697 38.64 35.38 43.05 4.697\n 547 gctagctgatcgatcgatgctag 394 23 0 52.17 61.697 41.07 41.07 46.89 4.697\n 548 ctagctagctgatcgatcgatgc 391 23 0 52.17 61.697 24.08 21.09 35.21 4.697\n 549 gctagctagctgatcgatcgatg 390 23 0 52.17 61.697 34.38 11.03 46.11 4.697\n 550 gctagctagctgatcgatcgatg 70 23 0 52.17 61.697 34.38 11.03 46.11 4.697\n 551 gctactagctagctgactgata 461 22 0 45.45 57.286 15.96 3.69 44.92 4.714\n 552 gatcgatcatcatgctagctac 272 22 0 45.45 57.284 21.11 0.00 0.00 4.716\n 553 cgatgctagctaggcgat 408 18 0 55.56 57.277 10.81 3.01 0.00 4.723\n 554 atcgatgctagctaggcg 406 18 0 55.56 57.277 15.59 9.02 0.00 4.723\n 555 tagctactgatcgatgctacat 306 22 0 40.91 57.270 13.79 0.09 0.00 4.730\n 556 gctagctactatcatcgatcgat 430 23 0 43.48 58.251 25.37 25.37 35.13 4.749\n 557 tgcatgctagtagtgatgtatacg 33 24 0 41.67 59.224 20.79 0.00 0.00 4.776\n 558 gcatgctagtagtgatgtatacgt 34 24 0 41.67 59.223 11.60 0.00 0.00 4.777\n 559 atttagctagctgactgatcgatc 256 24 0 41.67 59.219 19.32 19.32 0.00 4.781\n 560 gactgatcgatcatcatgctag 268 22 0 45.45 57.215 24.51 15.87 41.77 4.785\n 561 atttagctagctgactgatcgat 256 23 0 39.13 58.215 4.16 0.00 0.00 4.785\n 562 gctgactgatcgatcatcatgct 265 23 0 47.83 61.788 27.72 15.10 41.77 4.788\n 563 agctgactgatcgatcatcatgc 264 23 0 47.83 61.788 27.74 27.74 41.77 4.788\n 564 tagctactatcatctctgcgcga 354 23 0 47.83 61.796 2.71 2.71 0.00 4.796\n 565 gctgatcatcgatgctactagcta 195 24 0 45.83 60.834 20.91 7.37 45.92 4.834\n 566 tagctgatcatcgatgctactagc 193 24 0 45.83 60.834 20.78 20.78 45.61 4.834\n 567 gctagctgatcatcgatgctacta 191 24 0 45.83 60.834 11.65 8.83 0.00 4.834\n 568 tagctagctgatcatcgatgctac 189 24 0 45.83 60.834 17.82 12.06 0.00 4.834\n 569 tagtgatgcatgctagtagtgatg 27 24 0 41.67 59.155 11.56 7.49 0.00 4.845\n 570 agtgatgcatgctagtagtgatgt 28 24 0 41.67 60.846 11.60 0.00 0.00 4.846\n 571 tgatgcatgctagtagtgatgta 30 23 0 39.13 58.147 11.60 8.84 0.00 4.853\n 572 ctgactgatcgatcgatgctagc 114 23 0 52.17 61.878 18.17 12.52 35.21 4.878\n 573 gctgactgatcgatcgatgctag 113 23 0 52.17 61.878 22.81 19.44 35.21 4.878\n 574 ctagctgactgatcgatcgatgc 110 23 0 52.17 61.878 24.08 19.43 35.21 4.878\n 575 gctagctgactgatcgatcgatg 109 23 0 52.17 61.878 23.05 13.21 35.21 4.878\n 576 tcatcatcgatgctagctagtag 521 23 0 43.48 58.114 2.81 0.00 40.32 4.886\n 577 tactagctagctgatcatcatcg 507 23 0 43.48 58.114 0.00 0.00 0.00 4.886\n 578 tcgatcatcatgctagctactag 274 23 0 43.48 58.114 0.00 0.00 37.62 4.886\n 579 tgatcatcgatgctactagctag 197 23 0 43.48 58.114 20.04 20.04 45.92 4.886\n 580 ctgatcatcgatgctactagcta 196 23 0 43.48 58.114 10.86 0.00 45.92 4.886\n 581 tagctgatcatcgatgctactag 193 23 0 43.48 58.114 13.67 9.68 0.00 4.886\n 582 ctagctgatcatcgatgctacta 192 23 0 43.48 58.114 11.65 8.83 0.00 4.886\n 583 ctactagctagctgatcatcatcg 506 24 0 45.83 59.110 1.08 0.00 0.00 4.890\n 584 ctgatcatcgatgctactagctag 196 24 0 45.83 59.110 20.04 20.04 45.92 4.890\n 585 ctagctgatcatcgatgctactag 192 24 0 45.83 59.110 15.68 15.68 0.00 4.890\n 586 gctagctagctgatcatcatctag 146 24 0 45.83 59.102 34.38 13.13 44.71 4.898\n 587 gctagctagctgatcatcatcta 146 23 0 43.48 58.097 34.38 0.00 46.11 4.903\n 588 ctagtgatgcatgctagtagtg 26 22 0 45.45 57.072 20.00 3.96 0.00 4.928\n 589 gctactatcatctctgcgcgatc 356 23 0 52.17 61.936 4.99 0.00 0.00 4.936\n 590 gctgatcgatcgatgtgc 78 18 0 55.56 57.052 29.71 26.38 35.21 4.948\n 591 tagctagctactatcatcgatcga 428 24 0 41.67 59.031 27.80 22.52 0.00 4.969\n 592 agctagctgatcgatcgtagcg 562 22 0 54.55 62.971 27.20 18.31 0.00 4.971\n 593 tgactgatacgcgatgct 474 18 0 50.00 57.028 2.33 0.00 0.00 4.972\n 594 gatcatcatcgatgctagctag 519 22 0 45.45 57.019 17.46 17.46 40.32 4.981\n 595 tcatcatcgatgctagctagta 521 22 0 40.91 57.005 22.18 18.77 40.32 4.995\n 596 tcgatcatcatgctagctacta 274 22 0 40.91 57.005 0.00 0.00 0.00 4.995\n 597 tgatcatcgatgctactagcta 197 22 0 40.91 57.005 17.14 1.01 45.92 4.995\n 598 tagctgatcatcgatgctacta 193 22 0 40.91 57.005 12.62 8.42 0.00 4.995\n 599 tagctagctgactgatacgcgat 466 23 0 47.83 62.044 28.29 0.00 0.00 5.044\n 600 ctagctagctactatcatcgatcga 427 25 0 44.00 59.949 27.80 22.52 0.00 5.051\n 601 agctagctgactgatcgatcgat 108 23 0 47.83 62.053 30.53 30.53 37.90 5.053\n 602 ctactagctagctgactgatacgc 462 24 0 50.00 61.062 3.61 0.00 0.00 5.062\n 603 gctactagctagctgactgatacg 461 24 0 50.00 61.062 14.37 0.00 44.92 5.062\n 604 tgatcatcatcgatgctagctagta 518 25 0 40.00 60.062 22.18 18.77 40.32 5.062\n 605 tgatcgatcatcatgctagctacta 271 25 0 40.00 60.062 27.48 0.00 37.38 5.062\n 606 ctagtgatgcatgctagtagtgatg 26 25 0 44.00 60.064 20.00 7.49 0.00 5.064\n 607 gctagctagctactatcatcgatc 426 24 0 45.83 58.932 34.38 4.20 46.11 5.068\n 608 gctagctactgatcgatgctacat 304 24 0 45.83 61.072 11.21 0.00 0.00 5.072\n 609 gctagctagctactatcatcgat 426 23 0 43.48 57.922 34.38 0.00 46.11 5.078\n 610 ctagtgatgcatgctagtagtgat 26 24 0 41.67 58.911 20.00 4.64 0.00 5.089\n 611 tactatcatctctgcgcgatcga 358 23 0 47.83 62.092 22.07 1.72 38.48 5.092\n 612 agctgatcgatcgatgctagcta 397 23 0 47.83 62.111 31.26 14.51 40.03 5.111\n 613 tagctgatcgatcgatgctagct 396 23 0 47.83 62.111 33.22 33.22 42.08 5.111\n 614 agctagctgatcgatcgatgcta 393 23 0 47.83 62.111 34.11 32.56 36.80 5.111\n 615 tagctagctgatcgatcgatgct 392 23 0 47.83 62.111 33.87 33.38 38.16 5.111\n 616 tagtgatgcatgctagtagtgat 27 23 0 39.13 57.886 11.56 0.00 0.00 5.114\n 617 tactagctagctgatcatcatcgat 507 25 0 40.00 59.828 0.00 0.00 0.00 5.172\n 618 gctagctagctgatcatcgatgc 187 23 0 52.17 62.193 34.38 9.22 46.11 5.193\n 619 gctagtgatgcatgctagtagtga 25 24 0 45.83 61.195 24.96 4.57 0.00 5.195\n 620 aaagcatcggattagctagctgat 1 24 0 41.67 61.209 17.84 15.13 0.00 5.209\n 621 gtgatgcatgctagtagtgatgtat 29 25 0 40.00 59.774 1.07 1.07 0.00 5.226\n 622 ctatcatctctgcgcgatcgatg 360 23 0 52.17 62.227 18.01 18.01 38.48 5.227\n 623 tgactgatacgcgatgctagcta 474 23 0 47.83 62.287 17.69 3.08 0.00 5.287\n 624 tagctgactgatacgcgatgcta 470 23 0 47.83 62.287 12.64 9.09 0.00 5.287\n 625 tgctagtagtgatgtatacgtagct 37 25 0 40.00 59.713 9.37 8.73 0.00 5.287\n 626 tgactgatcgatcgatgctagct 115 23 0 47.83 62.296 20.19 11.59 35.21 5.296\n 627 agctgactgatcgatcgatgcta 112 23 0 47.83 62.296 26.44 14.64 35.21 5.296\n 628 tagctgactgatcgatcgatgct 111 23 0 47.83 62.296 31.98 30.27 35.21 5.296\n 629 ctagctagctactatcatcgatcg 427 24 0 45.83 58.703 12.49 9.87 0.00 5.297\n 630 tagctagctactatcatcgatcg 428 23 0 43.48 57.691 27.80 9.87 0.00 5.309\n 631 gactgatcgatcatcatgctagct 268 24 0 45.83 61.313 24.51 7.81 41.77 5.313\n 632 gctagctgactgatcgatcatcat 261 24 0 45.83 61.313 26.31 20.43 41.77 5.313\n 633 ctatttagctagctgactgatcga 254 24 0 41.67 58.679 0.00 0.00 0.00 5.321\n 634 gcatgctagtagtgatgtatacg 34 23 0 43.48 57.659 11.60 0.00 0.00 5.341\n 635 tatttagctagctgactgatcga 255 23 0 39.13 57.650 0.00 0.00 0.00 5.350\n 636 ctactagctagctgatcatcatcga 506 25 0 44.00 60.352 1.08 0.00 0.00 5.352\n 637 agctactatcatctctgcgcgat 355 23 0 47.83 62.360 4.99 2.52 0.00 5.360\n 638 gctgatcatcatcgatgctagcta 516 24 0 45.83 61.370 20.15 8.49 40.32 5.370\n 639 tagctgatcatcatcgatgctagc 514 24 0 45.83 61.370 20.04 19.26 40.32 5.370\n 640 gctagctgatcatcatcgatgcta 512 24 0 45.83 61.370 14.58 9.63 40.32 5.370\n 641 tagctagctgatcatcatcgatgc 510 24 0 45.83 61.370 21.42 7.40 40.32 5.370\n 642 atgcatgctagtagtgatgtatacg 32 25 0 40.00 59.604 11.70 0.00 0.00 5.396\n 643 tgatgcatgctagtagtgatgtat 30 24 0 37.50 58.592 12.66 12.66 0.00 5.408\n 644 gactgatcgatcgatgctagctag 116 24 0 50.00 61.409 18.04 17.46 35.21 5.409\n 645 gctatttagctagctgactgatc 253 23 0 43.48 57.572 7.27 0.00 46.11 5.428\n 646 tgctagtgatgcatgctagtagtg 24 24 0 45.83 61.434 24.96 10.54 35.89 5.434\n 647 ctagctagctactatcatctctgc 349 24 0 45.83 58.562 27.80 0.00 0.00 5.438\n 648 gctagctagctactatcatctctg 348 24 0 45.83 58.562 34.38 6.79 46.11 5.438\n 649 gatcatcatcgatgctagctagta 519 24 0 41.67 58.557 22.18 18.77 40.32 5.443\n 650 gatcgatcatcatgctagctacta 272 24 0 41.67 58.557 21.11 0.00 0.00 5.443\n 651 atcatcatcgatgctagctagtag 520 24 0 41.67 58.554 2.13 0.00 40.32 5.446\n 652 atcgatcatcatgctagctactag 273 24 0 41.67 58.554 0.00 0.00 37.62 5.446\n 653 tagctagctactatcatctctgc 350 23 0 43.48 57.527 27.80 0.00 0.00 5.473\n 654 atcatcatcgatgctagctagta 520 23 0 39.13 57.514 22.18 18.77 40.32 5.486\n 655 atcgatcatcatgctagctacta 273 23 0 39.13 57.514 0.00 0.00 0.00 5.486\n 656 gatcatcatcgatgctagctagtag 519 25 0 44.00 59.494 0.21 0.00 40.32 5.506\n 657 gatcgatcatcatgctagctactag 272 25 0 44.00 59.494 21.11 0.00 37.62 5.506\n 658 actagctagctgatcatcatctact 211 25 0 40.00 59.471 22.43 6.99 0.00 5.529\n 659 tgactgatcgatcatcatgctagc 267 24 0 45.83 61.547 26.79 14.13 41.77 5.547\n 660 gctgactgatcgatcatcatgcta 265 24 0 45.83 61.547 27.72 16.42 41.77 5.547\n 661 tagctgactgatcgatcatcatgc 263 24 0 45.83 61.547 27.74 27.74 41.77 5.547\n 662 tgctagtagtgatgtatacgtagc 37 24 0 41.67 58.446 4.93 4.93 0.00 5.554\n 663 ctagctagctgactgatacgcga 465 23 0 52.17 62.571 14.90 0.00 0.00 5.571\n 664 tagctagctactatcatcgatcgat 428 25 0 40.00 59.423 27.80 25.37 35.13 5.577\n 665 gctactagctagctgatcatcatct 208 25 0 44.00 60.585 14.37 0.00 44.92 5.585\n 666 agctgatcatcatctagctagtagc 153 25 0 44.00 60.585 15.25 15.25 40.45 5.585\n 667 ctagctagctgatcgatcgatgtg 71 24 0 50.00 61.642 11.68 4.94 35.21 5.642\n 668 agtgatgcatgctagtagtgatgta 28 25 0 40.00 60.646 11.60 8.84 0.00 5.646\n 669 tagtgatgcatgctagtagtgatgt 27 25 0 40.00 60.646 11.60 0.00 0.00 5.646\n 670 actatcatctctgcgcgatcgat 359 23 0 47.83 62.652 22.07 11.47 38.48 5.652\n 671 ctatttagctagctgactgatcg 254 23 0 43.48 57.339 0.00 0.00 0.00 5.661\n 672 tagctagctgatcgatcgtagcg 561 23 0 52.17 62.677 27.20 18.31 0.00 5.677\n 673 gcatcggattagctagctgatgc 4 23 0 52.17 62.687 34.10 34.10 41.15 5.687\n 674 tgcatgctagtagtgatgtatacgt 33 25 0 40.00 60.700 20.79 0.00 0.00 5.700\n 675 tttagctagctgactgatcgatcat 257 25 0 40.00 60.702 26.67 18.02 36.62 5.702\n 676 atttagctagctgactgatcgatca 256 25 0 40.00 60.702 26.99 26.99 35.44 5.702\n 677 gctagctagctactatcatctct 348 23 0 43.48 57.266 34.38 0.00 46.11 5.734\n 678 aagcatcggattagctagctgatg 2 24 0 45.83 61.794 27.81 27.81 33.28 5.794\n 679 agtgatgtatacgtagctagtagc 44 24 0 41.67 58.201 15.25 15.25 45.79 5.799\n 680 gctagtagtgatgtatacgtagct 38 24 0 41.67 58.201 5.92 5.92 0.00 5.799\n 681 tagctagctgactgatcgatcgat 107 24 0 45.83 61.800 30.53 30.53 37.90 5.800\n 682 actagctagctgactgatacgcg 464 23 0 52.17 62.816 21.52 3.89 0.00 5.816\n 683 actagctagctgatcatcatctac 211 24 0 41.67 58.178 22.43 0.00 0.00 5.822\n 684 tagctgatcgatcgatgctagcta 396 24 0 45.83 61.857 34.98 33.55 41.05 5.857\n 685 tagctagctgatcgatcgatgcta 392 24 0 45.83 61.857 34.11 32.56 36.80 5.857\n 686 tatttagctagctgactgatcgat 255 24 0 37.50 58.112 1.68 0.00 0.00 5.888\n 687 gcatgctagtagtgatgtatacgta 34 25 0 40.00 59.089 11.60 0.00 0.00 5.911\n 688 tatttagctagctgactgatcgatc 255 25 0 40.00 59.084 19.32 19.32 0.00 5.916\n 689 ctatttagctagctgactgatcgat 254 25 0 40.00 59.082 0.00 0.00 0.00 5.918\n 690 ctagctagctactatcatctctgcg 349 25 0 48.00 60.920 27.80 5.75 0.00 5.920\n 691 tgatcgatcgatgctagctaggc 400 23 0 52.17 62.955 26.44 12.49 35.21 5.955\n 692 agctagctactgatcgatgctaca 303 24 0 45.83 61.988 17.56 3.03 0.00 5.988\n 693 tgactgatcgatcgatgctagcta 115 24 0 45.83 62.034 20.19 11.16 35.21 6.034\n 694 tagctgactgatcgatcgatgcta 111 24 0 45.83 62.034 33.43 30.74 35.21 6.034\n 695 catgctagtagtgatgtatacgtagc 35 26 0 42.31 59.961 4.93 4.93 0.00 6.039\n 696 gcatgctagtagtgatgtatacgtag 34 26 0 42.31 59.961 11.60 0.00 0.00 6.039\n 697 actgatcgatcgatgctagctagt 117 24 0 45.83 62.039 23.29 15.07 35.21 6.039\n 698 ctatttagctagctgactgatcgatc 254 26 0 42.31 59.960 19.32 19.32 0.00 6.040\n 699 ttagctagctgactgatcgatcatc 258 25 0 44.00 61.041 28.29 21.92 36.62 6.041\n 700 atgctagtagtgatgtatacgtagct 36 26 0 38.46 60.068 9.37 8.73 0.00 6.068\n 701 ctagctagctgatcatcatctact 212 24 0 41.67 57.930 11.68 6.99 0.00 6.070\n 702 ctactagctagctgatcatcatct 209 24 0 41.67 57.930 1.08 0.00 0.00 6.070\n 703 agctgatcatcatctagctagtag 153 24 0 41.67 57.930 7.49 3.73 40.45 6.070\n 704 ctagctgatcatcatctagctagt 151 24 0 41.67 57.930 21.70 5.56 46.15 6.070\n 705 tagctactatcatctctgcgcgat 354 24 0 45.83 62.096 4.99 2.52 0.00 6.096\n 706 gactgatcgatcatcatgctagcta 268 25 0 44.00 61.099 24.51 4.57 41.77 6.099\n 707 ctgatcatcatcgatgctagctagt 517 25 0 44.00 61.101 22.18 3.56 40.32 6.101\n 708 actagctagctgatcatcatcgatg 508 25 0 44.00 61.101 22.43 20.23 41.48 6.101\n 709 ctgatcgatcatcatgctagctact 270 25 0 44.00 61.101 26.67 0.00 41.77 6.101\n 710 atgctagtagtgatgtatacgtagc 36 25 0 40.00 58.855 4.93 4.93 0.00 6.145\n 711 ctagctagctactgatcgatgctac 301 25 0 48.00 61.145 14.00 7.81 0.00 6.145\n 712 gctagctagctactatcatctctgc 348 25 0 48.00 61.152 34.38 11.74 46.11 6.152\n 713 agctagctgatcatcatctactatca 214 26 0 38.46 59.840 17.99 0.00 0.00 6.160\n 714 ctgatcgatcgatgctagctagtag 118 25 0 48.00 61.197 19.70 5.49 35.21 6.197\n 715 agctagctgactgatcgatcatca 260 24 0 45.83 62.232 26.49 26.49 39.98 6.232\n 716 gctagctagctactatcatcgatcg 426 25 0 48.00 61.252 34.38 9.87 46.11 6.252\n 717 gctatttagctagctgactgatcga 253 25 0 44.00 61.268 7.27 0.00 46.11 6.268\n 718 ctagctagctactatcatcgatcgat 427 26 0 42.31 60.291 27.80 25.37 35.13 6.291\n 719 agctgatcatcgatgctactagct 194 24 0 45.83 62.294 24.11 23.60 45.92 6.294\n 720 agctagctgatcatcgatgctact 190 24 0 45.83 62.294 17.99 10.88 0.00 6.294\n 721 ctagctagctgactgatcgatcga 106 24 0 50.00 62.312 22.52 22.52 0.00 6.312\n 722 actgatcgatcatcatgctagctac 269 25 0 44.00 61.328 26.67 0.00 41.77 6.328\n 723 tgatgcatgctagtagtgatgtatac 30 26 0 38.46 59.623 9.19 6.43 0.00 6.377\n 724 gtgatgcatgctagtagtgatgtata 29 26 0 38.46 59.623 4.23 0.00 0.00 6.377\n 725 tactatcatctctgcgcgatcgat 358 24 0 45.83 62.379 22.07 11.47 38.48 6.379\n 726 gctagctgatcatcatctactatca 215 25 0 40.00 58.607 8.21 0.00 0.00 6.393\n 727 gctactagctagctgatcatcatcta 208 26 0 42.31 60.404 14.37 0.00 44.92 6.404\n 728 tagctgatcatcatctagctagtagc 152 26 0 42.31 60.404 15.25 15.25 41.48 6.404\n 729 tgctagtagtgatgtatacgtagcta 37 26 0 38.46 59.564 10.00 8.05 0.00 6.436\n 730 gatgcatgctagtagtgatgtatacg 31 26 0 42.31 60.453 7.40 0.00 0.00 6.453\n 731 tagtgatgcatgctagtagtgatgta 27 26 0 38.46 60.461 11.60 8.84 0.00 6.461\n 732 gctagtgatgcatgctagtagtgat 25 25 0 44.00 61.506 24.96 8.51 0.00 6.506\n 733 tgcatgctagtagtgatgtatacgta 33 26 0 38.46 60.515 20.79 0.00 0.00 6.515\n 734 tatttagctagctgactgatcgatca 255 26 0 38.46 60.516 26.99 26.99 35.44 6.516\n 735 tgatgcatgctagtagtgatgtata 30 25 0 36.00 58.479 4.13 0.00 0.00 6.521\n 736 tactagctagctgactgatacgcg 463 24 0 50.00 62.538 13.17 3.89 0.00 6.538\n 737 ctagctactatcatctctgcgcga 353 24 0 50.00 62.603 2.71 2.71 0.00 6.603\n 738 agctagctgatcatcatctactatc 214 25 0 40.00 58.369 17.99 0.00 0.00 6.631\n 739 agctagctgatcatcatctactat 214 24 0 37.50 57.345 17.99 0.00 0.00 6.655\n 740 gctactagctagctgatcatcatcg 505 25 0 48.00 61.656 14.37 0.00 44.92 6.656\n 741 gctgatcatcgatgctactagctag 195 25 0 48.00 61.656 20.91 20.04 45.92 6.656\n 742 ctagctgatcatcgatgctactagc 192 25 0 48.00 61.656 20.78 20.78 45.61 6.656\n 743 gctagctgatcatcgatgctactag 191 25 0 48.00 61.656 20.13 20.13 0.00 6.656\n 744 ctagctagctgatcatcgatgctac 188 25 0 48.00 61.656 17.82 12.06 0.00 6.656\n 745 actagctagctgatcatcatctacta 211 26 0 38.46 59.328 22.43 8.11 0.00 6.672\n 746 tactagctagctgatcatcatctact 210 26 0 38.46 59.328 6.99 6.99 0.00 6.672\n 747 ctactagctagctgatcatcatcgat 506 26 0 42.31 60.681 1.08 0.00 0.00 6.681\n 748 tagctagctactgatcgatgctaca 302 25 0 44.00 61.746 27.80 5.02 0.00 6.746\n 749 gtagtgatgtatacgtagctagtagc 42 26 0 42.31 59.249 15.25 15.25 45.79 6.751\n 750 actgatcgatcgatgctagctagta 117 25 0 44.00 61.797 23.29 18.77 35.21 6.797\n 751 gatgcatgctagtagtgatgtatac 31 25 0 40.00 58.175 20.79 1.70 0.00 6.825\n 752 agctgatcatcatcgatgctagct 515 24 0 45.83 62.835 23.00 22.41 41.74 6.835\n 753 agctagctgatcatcatcgatgct 511 24 0 45.83 62.835 17.99 8.34 40.32 6.835\n 754 ctagctagctgactgatacgcgat 465 24 0 50.00 62.838 14.90 0.00 0.00 6.838\n 755 atgcatgctagtagtgatgtatac 32 24 0 37.50 57.161 11.70 0.53 0.00 6.839\n 756 agctagctactatcatctctgcgc 351 24 0 50.00 62.858 17.56 0.00 0.00 6.858\n 757 gctagctagctactgatcgatgct 300 24 0 50.00 62.858 34.38 11.51 46.11 6.858\n 758 ctactatcatctctgcgcgatcga 357 24 0 50.00 62.878 22.07 1.72 38.48 6.878\n 759 gctagctactgatcgatgctacatc 304 25 0 48.00 61.879 11.21 4.40 37.97 6.879\n 760 tagtgatgtatacgtagctagtagc 43 25 0 40.00 58.104 15.25 15.25 45.79 6.896\n 761 gctagtagtgatgtatacgtagcta 38 25 0 40.00 58.104 7.24 5.34 0.00 6.896\n 762 tgatcatcatcgatgctagctagtag 518 26 0 42.31 60.902 14.93 0.00 40.32 6.902\n 763 ctgatcatcatcgatgctagctagta 517 26 0 42.31 60.902 22.18 18.77 40.32 6.902\n 764 tactagctagctgatcatcatcgatg 507 26 0 42.31 60.902 20.23 20.23 41.48 6.902\n 765 tgatcgatcatcatgctagctactag 271 26 0 42.31 60.902 27.48 0.00 37.38 6.902\n 766 ctgatcgatcatcatgctagctacta 270 26 0 42.31 60.902 26.67 1.37 41.77 6.902\n 767 agctgatcgatcgatgctagctag 397 24 0 50.00 62.904 31.26 19.90 40.03 6.904\n 768 ctagctgatcgatcgatgctagct 395 24 0 50.00 62.904 35.51 33.22 43.05 6.904\n 769 agctagctgatcgatcgatgctag 393 24 0 50.00 62.904 41.07 41.07 46.89 6.904\n 770 ctagctagctgatcgatcgatgct 391 24 0 50.00 62.904 33.87 33.38 38.16 6.904\n 771 tactagctagctgatcatcatctac 210 25 0 40.00 58.081 0.00 0.00 0.00 6.919\n 772 gctagctgatcatcatctactatc 215 24 0 41.67 57.062 8.21 0.00 0.00 6.938\n 773 agtgatgcatgctagtagtgatgtat 28 26 0 38.46 60.969 1.07 1.07 0.00 6.969\n 774 gctagtagtgatgtatacgtagctag 38 26 0 42.31 59.027 8.99 8.99 0.00 6.973\n 775 tagctagctgactgatcgatcatca 259 25 0 44.00 61.981 28.29 26.49 39.98 6.981\n 776 ctactagctagctgatcatcatctac 209 26 0 42.31 59.015 1.08 0.00 0.00 6.985\n 777 agtagtgatgtatacgtagctagt 41 24 0 37.50 57.012 8.68 8.68 0.00 6.988\n 778 gctagctgatcatcatctactatcat 215 26 0 38.46 59.001 8.21 0.00 0.00 6.999\n 779 agctgatcatcatctactatcatca 218 25 0 36.00 57.993 0.00 0.00 0.00 7.007\n 780 atgcatgctagtagtgatgtatacgt 32 26 0 38.46 61.018 11.70 0.00 0.00 7.018\n 781 atttagctagctgactgatcgatcat 256 26 0 38.46 61.022 26.67 18.02 36.62 7.022\n 782 agctgatcatcgatgctactagcta 194 25 0 44.00 62.040 24.59 9.79 45.92 7.040\n 783 tagctgatcatcgatgctactagct 193 25 0 44.00 62.040 27.00 27.00 45.92 7.040\n 784 agctagctgatcatcgatgctacta 190 25 0 44.00 62.040 17.99 11.59 0.00 7.040\n 785 tagctagctgatcatcgatgctact 189 25 0 44.00 62.040 17.55 15.53 0.00 7.040\n 786 atgctagtagtgatgtatacgtagcta 36 27 0 37.04 59.911 10.00 8.05 0.00 7.089\n 787 gctagctgatcatcatctactatcatc 215 27 0 40.74 59.861 8.21 0.00 0.00 7.139\n 788 ctagctagctgatcatcatctacta 212 25 0 40.00 57.842 11.68 8.11 0.00 7.158\n 789 ctactagctagctgatcatcatcta 209 25 0 40.00 57.842 1.08 0.00 0.00 7.158\n 790 tagctgatcatcatctagctagtag 152 25 0 40.00 57.842 13.40 3.73 41.48 7.158\n 791 ctagctgatcatcatctagctagta 151 25 0 40.00 57.842 21.70 7.13 46.15 7.158\n 792 gctgatcatcatcgatgctagctag 516 25 0 48.00 62.165 20.15 17.46 40.32 7.165\n 793 ctagctgatcatcatcgatgctagc 513 25 0 48.00 62.165 19.27 19.26 41.96 7.165\n 794 gctagctgatcatcatcgatgctag 512 25 0 48.00 62.165 23.70 23.70 45.51 7.165\n 795 ctagctagctgatcatcatcgatgc 509 25 0 48.00 62.165 21.42 7.40 40.32 7.165\n 796 agctagctgatcatcatctactatcat 214 27 0 37.04 60.181 17.99 0.00 0.00 7.181\n 797 ctactagctagctgatcatcatctact 209 27 0 40.74 60.181 6.99 6.99 0.00 7.181\n 798 ctagctgatcatcatctagctagtag 151 26 0 42.31 58.789 21.70 10.73 46.15 7.211\n 799 aaagcatcggattagctagctgatg 1 25 0 44.00 62.249 27.81 27.81 33.28 7.249\n 800 agctagctactgatcgatgctacat 303 25 0 44.00 62.272 17.56 6.16 0.00 7.272\n 801 tagctagctgatcatcatctactatca 213 27 0 37.04 59.689 8.31 0.00 0.00 7.311\n 802 actagctagctgatcatcatctactat 211 27 0 37.04 59.688 22.43 2.36 0.00 7.312\n 803 ctgactgatcgatcatcatgctagc 266 25 0 48.00 62.333 20.99 8.86 41.77 7.333\n 804 gctgactgatcgatcatcatgctag 265 25 0 48.00 62.333 27.72 21.73 41.77 7.333\n 805 ctagctgactgatcgatcatcatgc 262 25 0 48.00 62.333 27.74 27.74 41.77 7.333\n 806 gctagctgactgatcgatcatcatg 261 25 0 48.00 62.333 22.70 19.51 41.77 7.333\n 807 tgctagtagtgatgtatacgtagctag 37 27 0 40.74 60.395 8.99 8.99 0.00 7.395\n 808 agtagtgatgtatacgtagctagtagc 41 27 0 40.74 60.395 15.25 15.25 45.79 7.395\n 809 gctagtagtgatgtatacgtagctagt 38 27 0 40.74 60.395 15.55 15.55 0.00 7.395\n 810 ctagtgatgcatgctagtagtgatgt 26 26 0 42.31 61.460 20.00 0.00 0.00 7.460\n 811 gctgatcatcatctactatcatcatca 219 27 0 37.04 59.533 0.00 0.00 0.00 7.467\n 812 agctagctgactgatcgatcatcat 260 25 0 44.00 62.507 26.31 20.43 41.77 7.507\n 813 tttagctagctgactgatcgatcatc 257 26 0 42.31 61.507 23.93 21.92 36.62 7.507\n 814 catgctagtagtgatgtatacgtag 35 25 0 40.00 57.441 4.74 0.00 0.00 7.559\n 815 agctgatcatcatcgatgctagcta 515 25 0 44.00 62.561 23.50 10.90 43.19 7.561\n 816 tagctgatcatcatcgatgctagct 514 25 0 44.00 62.561 26.21 26.21 44.79 7.561\n 817 agctagctgatcatcatcgatgcta 511 25 0 44.00 62.561 17.99 9.63 40.32 7.561\n 818 tagctagctgatcatcatcgatgct 510 25 0 44.00 62.561 14.14 10.38 40.32 7.561\n 819 gctatttagctagctgactgatcgat 253 26 0 42.31 61.564 7.27 0.00 46.11 7.564\n 820 ctagctagctgactgatcgatcgat 106 25 0 48.00 62.579 30.53 30.53 37.90 7.579\n 821 agctgatcatcatctactatcatcat 218 26 0 34.62 58.415 0.00 0.00 0.00 7.585\n 822 tagctagctactatcatctctgcgc 350 25 0 48.00 62.587 27.80 0.00 0.00 7.587\n 823 gctagctagctactgatcgatgcta 300 25 0 48.00 62.587 34.38 12.23 46.11 7.587\n 824 tgctagtgatgcatgctagtagtga 24 25 0 44.00 62.622 24.96 13.57 35.89 7.622\n 825 tagctgatcgatcgatgctagctag 396 25 0 48.00 62.632 33.71 21.46 41.05 7.632\n 826 ctagctgatcgatcgatgctagcta 395 25 0 48.00 62.632 35.51 32.61 43.05 7.632\n 827 tagctagctgatcgatcgatgctag 392 25 0 48.00 62.632 41.07 41.07 46.89 7.632\n 828 ctagctagctgatcgatcgatgcta 391 25 0 48.00 62.632 34.11 32.56 36.80 7.632\n 829 gtgatgcatgctagtagtgatgtatac 29 27 0 40.74 60.659 9.56 7.17 0.00 7.659\n 830 agctgatcatcatctactatcatcatc 218 27 0 37.04 59.314 0.00 0.00 0.00 7.686\n 831 tagctagctgatcatcatctactat 213 25 0 36.00 57.279 8.31 0.00 0.00 7.721\n 832 tagctagctgatcatcatctactatc 213 26 0 38.46 58.269 8.31 0.00 0.00 7.731\n 833 tgactgatcgatcatcatgctagct 267 25 0 44.00 62.733 26.79 10.55 41.77 7.733\n 834 agctgactgatcgatcatcatgcta 264 25 0 44.00 62.733 30.60 18.10 41.77 7.733\n 835 tagctgactgatcgatcatcatgct 263 25 0 44.00 62.733 32.31 32.31 41.77 7.733\n 836 ctagctagctgatcatcatctactat 212 26 0 38.46 58.265 9.41 0.00 0.00 7.735\n 837 agtgatgcatgctagtagtgatgtata 28 27 0 37.04 60.779 4.23 0.00 0.00 7.779\n 838 tagtgatgcatgctagtagtgatgtat 27 27 0 37.04 60.779 11.56 0.00 0.00 7.779\n 839 tgactgatcgatcgatgctagctag 115 25 0 48.00 62.800 20.19 17.46 35.21 7.800\n 840 ctgactgatcgatcgatgctagcta 114 25 0 48.00 62.800 20.19 11.97 35.21 7.800\n 841 tagctgactgatcgatcgatgctag 111 25 0 48.00 62.800 31.45 26.34 35.21 7.800\n 842 ctagctgactgatcgatcgatgcta 110 25 0 48.00 62.800 31.54 29.68 35.21 7.800\n 843 tagctagctgactgatcgatcgatg 107 25 0 48.00 62.800 28.29 13.21 35.21 7.800\n 844 gactgatcgatcgatgctagctagt 116 25 0 48.00 62.802 22.18 12.64 35.21 7.802\n 845 tactagctagctgatcatcatctacta 210 27 0 37.04 59.196 8.79 8.11 0.00 7.804\n 846 tagctgatcatcgatgctactagcta 193 26 0 42.31 61.805 28.86 27.39 45.92 7.805\n 847 tagctagctgatcatcgatgctacta 189 26 0 42.31 61.805 18.93 16.03 0.00 7.805\n 848 atgcatgctagtagtgatgtatacgta 32 27 0 37.04 60.828 11.70 0.00 0.00 7.828\n 849 tatttagctagctgactgatcgatcat 255 27 0 37.04 60.831 26.67 18.02 36.62 7.831\n 850 ctagctagctgatcatcatctactatc 212 27 0 40.74 59.162 9.41 0.06 0.00 7.838\n 851 tagctactatcatctctgcgcgatc 354 25 0 48.00 62.854 0.00 0.00 0.00 7.854\n 852 gctgatcatcatctactatcatcat 219 25 0 36.00 57.142 0.00 0.00 0.00 7.858\n 853 ctagctactatcatctctgcgcgat 353 25 0 48.00 62.859 4.99 2.52 0.00 7.859\n 854 gctgatcatcatctactatcatcatc 219 26 0 38.46 58.126 0.00 0.00 0.00 7.874\n 855 tagctagctactgatcgatgctacat 302 26 0 42.31 62.028 27.80 3.08 0.00 8.028\n 856 agtagtgatgtatacgtagctagtag 41 26 0 38.46 57.950 9.92 1.30 0.00 8.050\n 857 ctagtagtgatgtatacgtagctagt 39 26 0 38.46 57.950 15.52 15.52 0.00 8.050\n 858 catgctagtagtgatgtatacgtagct 35 27 0 40.74 61.089 9.37 8.73 0.00 8.089\n 859 gactgatcgatcatcatgctagctac 268 26 0 46.15 62.094 24.51 8.36 41.77 8.094\n 860 tagctgatcatcatctactatcatca 217 26 0 34.62 57.906 0.00 0.00 0.00 8.094\n 861 ctagctgatcatcatctactatcatca 216 27 0 37.04 58.826 0.00 0.00 0.00 8.174\n 862 ctagctgatcatcatctagctagtagc 151 27 0 44.44 61.196 21.70 15.25 46.15 8.196\n 863 tagctagctgactgatcgatcatcat 259 26 0 42.31 62.255 28.29 20.43 41.77 8.255\n 864 ctagtgatgcatgctagtagtgatgta 26 27 0 40.74 61.255 20.00 8.84 0.00 8.255\n 865 tgcatgctagtagtgatgtatacgtag 33 27 0 40.74 61.300 20.79 0.00 0.00 8.300\n 866 ctatttagctagctgactgatcgatca 254 27 0 40.74 61.304 26.99 26.99 35.44 8.304\n 867 tagctgatcatcatcgatgctagcta 514 26 0 42.31 62.307 28.23 26.63 43.19 8.307\n 868 tagctagctgatcatcatcgatgcta 510 26 0 42.31 62.307 14.58 11.03 40.32 8.307\n 869 gctagctagctactatcatcgatcga 426 26 0 46.15 62.381 34.38 22.52 46.11 8.381\n 870 gctactagctagctgatcatcatctac 208 27 0 44.44 61.407 14.37 0.00 44.92 8.407\n 871 ttagctagctgactgatcgatcatca 258 26 0 42.31 62.416 28.29 26.49 39.98 8.416\n 872 tgactgatcgatcatcatgctagcta 267 26 0 42.31 62.472 26.79 11.24 41.77 8.472\n 873 tagctgactgatcgatcatcatgcta 263 26 0 42.31 62.472 33.83 32.61 41.77 8.472\n 874 actgatcgatcatcatgctagctact 269 26 0 42.31 62.478 26.67 0.00 41.77 8.478\n 875 gctagtgatgcatgctagtagtgatg 25 26 0 46.15 62.484 24.96 9.07 0.00 8.484\n 876 ctagctagctactgatcgatgctaca 301 26 0 46.15 62.503 14.00 5.87 0.00 8.503\n 877 gactgatcgatcgatgctagctagta 116 26 0 46.15 62.543 22.18 18.77 35.21 8.543\n 878 actgatcgatcgatgctagctagtag 117 26 0 46.15 62.548 23.29 12.42 35.21 8.548\n 879 ctagctgatcatcatctactatcatc 216 26 0 38.46 57.395 0.00 0.00 0.00 8.605\n 880 ctgatcatcatcgatgctagctagtag 517 27 0 44.44 61.665 10.30 1.36 40.32 8.665\n 881 ctactagctagctgatcatcatcgatg 506 27 0 44.44 61.665 20.23 20.23 41.48 8.665\n 882 ctgatcgatcatcatgctagctactag 270 27 0 44.44 61.665 26.67 8.14 41.77 8.665\n 883 tagctgatcatcatctactatcatcat 217 27 0 33.33 58.315 0.00 0.00 0.00 8.685\n 884 tgatgcatgctagtagtgatgtatacg 30 27 0 40.74 61.778 9.81 0.00 0.00 8.778\n 885 gatgcatgctagtagtgatgtatacgt 31 27 0 40.74 61.779 7.40 0.00 0.00 8.779\n 886 gctactagctagctgatcatcatcga 505 26 0 46.15 62.779 14.37 0.00 44.92 8.779\n 887 agctgatcatcgatgctactagctag 194 26 0 46.15 62.784 24.59 20.04 45.92 8.784\n 888 ctagctgatcatcgatgctactagct 192 26 0 46.15 62.784 27.00 27.00 45.92 8.784\n 889 agctagctgatcatcgatgctactag 190 26 0 46.15 62.784 20.13 20.13 0.00 8.784\n 890 ctagctagctgatcatcgatgctact 188 26 0 46.15 62.784 17.55 15.53 0.00 8.784\n 891 atttagctagctgactgatcgatcatc 256 27 0 40.74 61.785 23.93 21.92 36.62 8.785\n 892 tctactatcatcatcatctactagct 230 26 0 34.62 57.155 0.00 0.00 0.00 8.845\n 893 tgctagtgatgcatgctagtagtgat 24 26 0 42.31 62.874 24.96 8.51 35.89 8.874\n 894 ctgatcatcatctactatcatcatca 220 26 0 34.62 57.026 0.00 0.00 0.00 8.974\n 895 agctagctactgatcgatgctacatc 303 26 0 46.15 62.999 17.56 7.89 37.97 8.999\n 896 tagtagtgatgtatacgtagctagtag 40 27 0 37.04 57.869 16.78 1.30 0.00 9.131\n 897 ctagtagtgatgtatacgtagctagta 39 27 0 37.04 57.869 16.85 15.97 0.00 9.131\n 898 actgatcgatcatcatgctagctacta 269 27 0 40.74 62.236 26.67 1.37 41.77 9.236\n 899 gcatgctagtagtgatgtatacgtagc 34 27 0 44.44 62.283 11.60 4.93 0.00 9.283\n 900 gctatttagctagctgactgatcgatc 253 27 0 44.44 62.291 19.32 19.32 46.11 9.291\n 901 atctactatcatcatcatctactagct 229 27 0 33.33 57.592 0.00 0.00 0.00 9.408\n 902 catctactatcatcatcatctactagc 228 27 0 37.04 57.549 0.00 0.00 0.00 9.451\n 903 tgatcatcatctactatcatcatcatc 221 27 0 33.33 57.467 0.00 0.00 0.00 9.533\n 904 tagctgatcatcgatgctactagctag 193 27 0 44.44 62.534 27.70 20.04 45.92 9.534\n 905 ctagctgatcatcgatgctactagcta 192 27 0 44.44 62.534 27.76 26.73 45.92 9.534\n 906 tagctagctgatcatcgatgctactag 189 27 0 44.44 62.534 20.13 20.13 0.00 9.534\n 907 ctagctagctgatcatcgatgctacta 188 27 0 44.44 62.534 17.74 15.95 0.00 9.534\n 908 ctgatcatcatctactatcatcatcat 220 27 0 33.33 57.462 0.00 0.00 0.00 9.538\n 909 gctagctagctactatcatcgatcgat 426 27 0 44.44 62.627 34.38 25.37 46.11 9.627\n 910 ttagctagctgactgatcgatcatcat 258 27 0 40.74 62.665 28.29 20.43 41.77 9.665\n 911 tagctagctactgatcgatgctacatc 302 27 0 44.44 62.742 27.80 7.89 37.97 9.742\n 912 ctagctagctactgatcgatgctacat 301 27 0 44.44 62.747 14.00 2.51 0.00 9.747\n 913 gatcatcatctactatcatcatcatct 222 27 0 33.33 57.242 0.00 0.00 0.00 9.758\n 914 tttagctagctgactgatcgatcatca 257 27 0 40.74 62.820 26.49 26.49 39.98 9.820\n 915 tctactatcatcatcatctactagcta 230 27 0 33.33 57.100 0.00 0.00 0.00 9.900\n" }, { "path": "src/test/resources/samples/langs/Formatted/wksst8110.for", "content": " Weekly SST data starts week centered on 3Jan1990\n\n Nino1+2 Nino3 Nino34 Nino4\n Week SST SSTA SST SSTA SST SSTA SST SSTA\n 03JAN1990 23.4-0.4 25.1-0.3 26.6 0.0 28.6 0.3\n 10JAN1990 23.4-0.8 25.2-0.3 26.6 0.1 28.6 0.3\n 17JAN1990 24.2-0.3 25.3-0.3 26.5-0.1 28.6 0.3\n 24JAN1990 24.4-0.5 25.5-0.4 26.5-0.1 28.4 0.2\n 31JAN1990 25.1-0.2 25.8-0.2 26.7 0.1 28.4 0.2\n 07FEB1990 25.8 0.2 26.1-0.1 26.8 0.1 28.4 0.3\n 14FEB1990 25.9-0.1 26.4 0.0 26.9 0.2 28.5 0.4\n 21FEB1990 26.1-0.1 26.7 0.2 27.1 0.3 28.9 0.8\n 28FEB1990 26.1-0.2 26.7-0.1 27.2 0.3 29.0 0.8\n 07MAR1990 26.7 0.3 26.7-0.2 27.3 0.2 28.9 0.7\n 14MAR1990 26.1-0.4 26.9-0.2 27.3 0.1 28.6 0.4\n 21MAR1990 26.1-0.2 27.2 0.0 27.6 0.3 28.7 0.5\n 28MAR1990 25.7-0.4 27.5 0.2 27.8 0.3 28.8 0.5\n 04APR1990 25.6-0.3 27.6 0.3 27.9 0.4 28.8 0.4\n 11APR1990 25.1-0.6 27.6 0.2 27.9 0.2 28.8 0.3\n 18APR1990 25.3 0.0 27.7 0.2 28.0 0.2 28.9 0.4\n 25APR1990 25.1 0.0 27.7 0.4 28.2 0.4 29.2 0.6\n 02MAY1990 24.6-0.2 27.6 0.3 28.1 0.3 29.0 0.4\n 09MAY1990 24.2-0.2 27.5 0.3 28.1 0.3 28.9 0.2\n 16MAY1990 24.3 0.1 27.4 0.3 28.0 0.2 28.8 0.1\n 23MAY1990 23.7-0.2 27.2 0.2 28.1 0.3 29.0 0.2\n 30MAY1990 23.4-0.1 27.1 0.3 27.9 0.2 28.9 0.1\n 06JUN1990 23.2 0.0 26.7 0.1 27.7 0.0 28.9 0.1\n 13JUN1990 22.8-0.2 26.6 0.1 27.7 0.0 29.0 0.1\n 20JUN1990 22.5-0.1 26.4 0.0 27.5-0.1 29.0 0.1\n 27JUN1990 22.1-0.3 26.0-0.1 27.3-0.2 28.9 0.1\n 04JUL1990 21.7-0.4 25.8-0.2 27.3-0.1 28.9 0.1\n 11JUL1990 21.3-0.5 25.4-0.3 27.2-0.1 28.8 0.0\n 18JUL1990 21.0-0.5 25.7 0.1 27.4 0.2 29.1 0.3\n 25JUL1990 20.2-1.1 25.1-0.4 27.3 0.1 29.1 0.3\n 01AUG1990 20.6-0.6 25.1-0.2 27.1 0.1 29.0 0.3\n 08AUG1990 20.4-0.5 25.2 0.1 27.2 0.3 29.3 0.6\n 15AUG1990 20.4-0.3 25.1 0.1 27.0 0.2 29.2 0.5\n 22AUG1990 19.8-0.7 24.9 0.0 27.0 0.2 29.2 0.5\n 29AUG1990 20.2-0.3 25.0 0.1 26.9 0.2 29.0 0.4\n 05SEP1990 19.7-0.8 24.9 0.0 26.7 0.0 28.9 0.3\n 12SEP1990 20.1-0.3 24.7-0.2 26.7 0.0 29.1 0.4\n 19SEP1990 20.3-0.1 24.9 0.1 26.8 0.0 29.1 0.4\n 26SEP1990 20.3-0.2 24.8-0.1 26.7 0.0 29.0 0.3\n 03OCT1990 20.8 0.1 25.1 0.2 26.9 0.2 29.2 0.5\n 10OCT1990 20.1-0.6 24.9 0.0 27.0 0.3 29.1 0.5\n 17OCT1990 20.3-0.6 24.9 0.0 27.0 0.3 29.3 0.6\n 24OCT1990 20.1-0.9 24.9-0.1 27.0 0.4 29.3 0.6\n 31OCT1990 20.2-1.0 24.7-0.2 26.9 0.2 29.2 0.6\n 07NOV1990 20.5-0.8 25.0 0.1 26.9 0.3 29.1 0.5\n 14NOV1990 20.8-0.8 24.8-0.1 26.7 0.0 29.0 0.4\n 21NOV1990 20.9-0.9 24.6-0.4 26.6 0.0 29.0 0.4\n 28NOV1990 21.5-0.6 24.8-0.3 26.5-0.1 28.9 0.4\n 05DEC1990 22.2-0.2 25.2 0.1 26.9 0.3 29.2 0.7\n 12DEC1990 22.1-0.5 25.0-0.1 26.8 0.3 29.3 0.8\n 19DEC1990 22.2-0.8 24.9-0.3 26.9 0.4 29.2 0.7\n 26DEC1990 23.3 0.0 25.3 0.0 27.0 0.4 29.0 0.6\n 02JAN1991 23.2-0.5 25.3-0.1 26.9 0.4 28.9 0.5\n 09JAN1991 23.5-0.6 25.4-0.1 27.0 0.4 29.1 0.8\n 16JAN1991 23.7-0.7 25.7 0.1 27.0 0.5 29.0 0.8\n 23JAN1991 24.2-0.6 25.8 0.0 27.1 0.5 29.0 0.8\n 30JAN1991 24.7-0.5 26.0 0.0 27.0 0.3 28.9 0.7\n 06FEB1991 25.4-0.2 26.1 0.0 27.0 0.3 28.8 0.6\n 13FEB1991 26.0 0.0 26.3 0.0 27.0 0.3 28.8 0.7\n 20FEB1991 26.5 0.3 26.3-0.2 26.9 0.1 28.7 0.6\n 27FEB1991 26.5 0.2 26.5-0.2 26.8-0.1 28.5 0.4\n 06MAR1991 26.5 0.2 26.6-0.3 26.8-0.2 28.5 0.3\n 13MAR1991 26.8 0.4 27.0-0.1 27.1-0.1 28.5 0.3\n 20MAR1991 26.6 0.2 27.1-0.1 27.4 0.1 28.6 0.4\n 27MAR1991 26.2 0.1 27.4 0.1 27.7 0.3 28.9 0.6\n 03APR1991 25.8-0.1 27.3 0.0 27.8 0.2 28.9 0.5\n 10APR1991 25.2-0.5 27.0-0.4 27.8 0.1 29.1 0.7\n 17APR1991 24.9-0.5 27.5 0.0 28.2 0.4 29.2 0.7\n 24APR1991 24.3-0.8 27.4 0.0 28.1 0.3 29.2 0.6\n 01MAY1991 24.6-0.2 27.6 0.4 28.1 0.3 29.1 0.4\n 08MAY1991 24.4-0.2 27.5 0.3 28.3 0.5 29.3 0.6\n 15MAY1991 24.5 0.2 27.5 0.4 28.4 0.5 29.5 0.7\n 22MAY1991 24.3 0.4 27.7 0.7 28.5 0.7 29.5 0.7\n 29MAY1991 24.2 0.5 27.6 0.8 28.5 0.7 29.5 0.7\n 05JUN1991 23.7 0.4 27.5 0.8 28.3 0.6 29.3 0.5\n 12JUN1991 23.2 0.2 27.4 0.9 28.3 0.6 29.3 0.5\n 19JUN1991 23.0 0.3 27.2 0.9 28.4 0.8 29.4 0.5\n 26JUN1991 22.2-0.2 27.3 1.1 28.4 0.9 29.4 0.6\n 03JUL1991 22.8 0.7 27.0 1.0 28.1 0.7 29.2 0.4\n 10JUL1991 22.3 0.4 26.8 1.0 28.1 0.8 29.2 0.4\n 17JUL1991 21.9 0.3 26.6 1.0 27.9 0.7 29.3 0.5\n 24JUL1991 21.6 0.3 26.2 0.7 27.7 0.5 29.2 0.5\n 31JUL1991 21.6 0.5 26.1 0.8 27.9 0.9 29.5 0.7\n 07AUG1991 21.2 0.3 25.6 0.4 27.5 0.6 29.3 0.6\n 14AUG1991 21.3 0.5 25.4 0.4 27.6 0.7 29.3 0.6\n 21AUG1991 20.9 0.3 25.4 0.5 27.4 0.6 29.3 0.6\n 28AUG1991 20.7 0.2 25.2 0.3 27.0 0.3 29.0 0.3\n 04SEP1991 20.9 0.4 25.1 0.2 27.1 0.3 29.1 0.5\n 11SEP1991 20.7 0.3 24.7-0.1 26.9 0.1 29.0 0.4\n 18SEP1991 20.7 0.3 25.1 0.2 27.2 0.5 29.4 0.7\n 25SEP1991 20.8 0.3 25.2 0.3 27.1 0.4 29.2 0.5\n 02OCT1991 20.8 0.2 25.3 0.4 27.2 0.5 29.3 0.6\n 09OCT1991 21.1 0.4 25.6 0.7 27.7 1.0 29.5 0.8\n 16OCT1991 20.7-0.1 25.5 0.6 27.8 1.1 29.6 1.0\n 23OCT1991 21.2 0.2 25.7 0.8 27.6 0.9 29.4 0.7\n 30OCT1991 21.9 0.7 25.9 1.0 27.8 1.1 29.4 0.8\n 06NOV1991 22.0 0.7 25.8 0.9 27.8 1.1 29.5 0.8\n 13NOV1991 21.9 0.4 25.9 1.0 27.8 1.1 29.5 0.9\n 20NOV1991 22.5 0.7 26.1 1.1 27.9 1.3 29.4 0.8\n 27NOV1991 22.3 0.3 26.1 1.1 28.0 1.4 29.4 0.9\n 04DEC1991 22.8 0.5 26.2 1.1 28.1 1.5 29.4 0.9\n 11DEC1991 23.4 0.8 26.5 1.4 28.3 1.7 29.4 0.9\n 18DEC1991 23.7 0.8 26.6 1.5 28.5 2.0 29.5 1.0\n 25DEC1991 23.6 0.3 26.7 1.4 28.5 1.9 29.6 1.2\n 01JAN1992 24.0 0.3 26.7 1.3 28.5 1.9 29.3 1.0\n 08JAN1992 24.2 0.2 26.8 1.3 28.5 1.9 29.2 0.9\n 15JAN1992 24.6 0.2 26.9 1.3 28.4 1.9 29.1 0.8\n 22JAN1992 25.3 0.5 27.1 1.3 28.4 1.8 29.0 0.7\n 29JAN1992 25.9 0.7 27.4 1.4 28.3 1.7 28.7 0.6\n 05FEB1992 26.3 0.8 27.5 1.3 28.4 1.7 28.8 0.7\n 12FEB1992 26.4 0.5 27.6 1.3 28.6 1.9 29.0 0.9\n 19FEB1992 26.8 0.6 27.8 1.3 28.8 2.0 29.2 1.1\n 26FEB1992 27.3 1.1 27.9 1.2 28.8 1.9 29.1 1.0\n 04MAR1992 27.3 1.0 27.9 1.1 28.6 1.6 29.1 0.9\n 11MAR1992 27.7 1.2 28.1 1.0 28.7 1.6 29.2 1.0\n 18MAR1992 27.9 1.4 28.5 1.3 28.8 1.6 28.9 0.7\n 25MAR1992 28.1 1.9 28.7 1.4 29.0 1.6 29.1 0.8\n 01APR1992 27.9 1.9 28.7 1.3 29.1 1.6 29.4 1.0\n 08APR1992 28.3 2.6 28.8 1.4 29.3 1.6 29.6 1.2\n 15APR1992 28.0 2.5 28.8 1.3 29.2 1.4 29.5 1.0\n 22APR1992 27.1 1.9 28.6 1.2 29.0 1.2 29.3 0.8\n 29APR1992 27.0 2.1 28.8 1.5 29.1 1.2 29.2 0.6\n 06MAY1992 27.0 2.4 28.8 1.6 29.2 1.3 29.4 0.7\n 13MAY1992 26.6 2.3 28.6 1.5 29.1 1.2 29.5 0.8\n 20MAY1992 25.8 1.8 28.2 1.2 29.0 1.1 29.5 0.8\n 27MAY1992 25.9 2.2 28.1 1.3 28.8 1.1 29.5 0.7\n 03JUN1992 24.2 0.9 27.5 0.8 28.6 0.9 29.4 0.6\n 10JUN1992 24.2 1.2 26.8 0.3 28.3 0.6 29.4 0.6\n 17JUN1992 23.9 1.1 26.6 0.2 27.8 0.2 29.2 0.4\n 24JUN1992 23.5 1.0 26.2 0.0 27.6 0.1 29.2 0.4\n 01JUL1992 22.3 0.1 25.8-0.2 27.6 0.1 29.2 0.4\n 08JUL1992 23.0 1.1 26.2 0.4 28.0 0.7 29.5 0.7\n 15JUL1992 21.4-0.3 25.7 0.0 27.7 0.5 29.5 0.7\n 22JUL1992 21.6 0.2 25.1-0.4 27.2 0.0 29.2 0.5\n 29JUL1992 21.5 0.3 24.9-0.5 27.1 0.1 29.2 0.5\n 05AUG1992 20.8-0.2 24.6-0.6 26.7-0.2 29.1 0.4\n 12AUG1992 20.8 0.0 24.9-0.2 26.6-0.3 28.8 0.1\n 19AUG1992 20.3-0.4 24.6-0.4 26.6-0.3 28.8 0.2\n 26AUG1992 20.3-0.3 24.8-0.2 26.7-0.1 28.9 0.3\n 02SEP1992 20.3-0.2 24.4-0.5 26.3-0.4 28.6 0.0\n 09SEP1992 19.7-0.8 24.4-0.5 26.4-0.3 28.7 0.1\n 16SEP1992 20.1-0.2 24.5-0.3 26.5-0.2 28.9 0.2\n 23SEP1992 20.1-0.3 24.6-0.3 26.5-0.2 28.9 0.2\n 30SEP1992 20.2-0.4 24.7-0.2 26.6-0.1 28.7 0.0\n 07OCT1992 20.5-0.2 24.5-0.4 26.4-0.3 28.8 0.1\n 14OCT1992 20.7 0.0 24.6-0.3 26.4-0.3 28.6-0.1\n 21OCT1992 20.9 0.0 24.6-0.4 26.2-0.5 28.8 0.1\n 28OCT1992 21.5 0.4 24.8-0.1 26.2-0.4 28.5-0.1\n 04NOV1992 21.2-0.1 24.7-0.2 26.3-0.4 28.6 0.0\n 11NOV1992 21.2-0.3 24.8-0.1 26.6-0.1 28.8 0.2\n 18NOV1992 21.2-0.5 24.7-0.3 26.4-0.2 28.5-0.1\n 25NOV1992 22.1 0.2 24.9-0.2 26.7 0.0 28.8 0.2\n 02DEC1992 22.2 0.0 24.9-0.2 26.7 0.1 28.9 0.4\n 09DEC1992 22.2-0.3 25.1 0.0 26.8 0.2 28.7 0.2\n 16DEC1992 22.3-0.5 24.9-0.3 26.7 0.1 28.7 0.3\n 23DEC1992 22.5-0.7 25.1-0.2 26.8 0.2 28.9 0.4\n 30DEC1992 23.3-0.2 25.1-0.3 26.6 0.0 28.6 0.2\n 06JAN1993 23.6-0.3 25.4-0.1 26.7 0.1 28.5 0.2\n 13JAN1993 24.4 0.1 25.6 0.0 26.8 0.2 28.7 0.4\n 20JAN1993 24.5-0.2 25.5-0.2 26.6 0.0 28.6 0.3\n 27JAN1993 25.2 0.1 25.8-0.2 26.7 0.0 28.6 0.4\n 03FEB1993 26.2 0.8 26.3 0.2 26.9 0.3 28.5 0.3\n 10FEB1993 26.6 0.7 26.4 0.2 26.8 0.1 28.3 0.2\n 17FEB1993 26.6 0.4 26.9 0.5 27.0 0.2 28.3 0.2\n 24FEB1993 26.6 0.4 26.7 0.1 27.1 0.2 28.5 0.4\n 03MAR1993 26.9 0.6 26.9 0.1 27.2 0.2 28.4 0.3\n 10MAR1993 27.2 0.7 27.3 0.3 27.4 0.3 28.4 0.3\n 17MAR1993 27.1 0.6 27.5 0.3 27.7 0.4 28.6 0.4\n 24MAR1993 27.2 1.0 28.0 0.7 28.0 0.7 28.8 0.5\n 31MAR1993 27.7 1.7 28.3 1.0 28.2 0.7 28.9 0.6\n 07APR1993 26.6 0.9 28.4 1.0 28.3 0.6 28.7 0.3\n 14APR1993 26.3 0.7 28.5 1.0 28.8 1.1 29.0 0.5\n 21APR1993 26.3 1.0 28.4 1.0 28.7 0.9 29.0 0.5\n 28APR1993 26.0 1.1 28.5 1.2 28.8 1.0 29.0 0.4\n 05MAY1993 25.9 1.2 28.5 1.2 28.8 1.0 28.9 0.3\n 12MAY1993 25.6 1.2 28.3 1.2 28.9 1.0 29.1 0.4\n 19MAY1993 24.9 0.8 28.1 1.1 28.8 1.0 29.2 0.4\n 26MAY1993 24.3 0.6 27.9 1.0 28.9 1.1 29.2 0.4\n 02JUN1993 24.5 1.1 27.7 0.9 28.6 0.9 29.2 0.4\n 09JUN1993 23.9 0.7 27.2 0.6 28.3 0.6 29.1 0.2\n 16JUN1993 23.6 0.8 27.1 0.6 28.2 0.6 29.1 0.2\n 23JUN1993 23.8 1.3 26.9 0.7 28.2 0.7 29.3 0.5\n 30JUN1993 23.0 0.7 26.7 0.6 28.1 0.6 29.3 0.5\n 07JUL1993 22.4 0.4 26.1 0.3 27.9 0.6 29.3 0.5\n 14JUL1993 22.2 0.5 25.8 0.1 27.4 0.2 29.2 0.4\n 21JUL1993 22.0 0.6 25.6 0.1 27.5 0.4 29.2 0.4\n 28JUL1993 21.3 0.0 25.3-0.1 27.2 0.1 29.1 0.4\n 04AUG1993 21.2 0.2 25.0-0.3 26.8-0.2 28.9 0.2\n 11AUG1993 20.8 0.0 25.0-0.1 26.9 0.0 29.0 0.3\n 18AUG1993 21.1 0.5 24.8-0.1 26.8 0.0 28.7 0.1\n 25AUG1993 21.2 0.6 24.9 0.0 26.9 0.1 29.1 0.4\n 01SEP1993 20.9 0.4 24.9 0.0 26.9 0.2 29.1 0.4\n 08SEP1993 20.8 0.3 25.0 0.1 26.8 0.1 29.0 0.4\n 15SEP1993 20.8 0.4 24.9 0.0 26.9 0.2 29.1 0.5\n 22SEP1993 21.0 0.5 25.0 0.2 27.0 0.3 29.1 0.4\n 29SEP1993 20.7 0.2 25.1 0.2 27.0 0.3 29.0 0.3\n 06OCT1993 20.6-0.1 25.2 0.3 26.9 0.2 28.8 0.1\n 13OCT1993 20.8 0.0 25.3 0.4 27.0 0.3 29.0 0.3\n 20OCT1993 21.2 0.3 25.0 0.1 26.6 0.0 28.9 0.2\n 27OCT1993 21.3 0.2 25.3 0.4 27.1 0.4 29.0 0.3\n 03NOV1993 22.0 0.8 25.4 0.4 27.2 0.5 29.0 0.3\n 10NOV1993 21.4 0.0 25.1 0.1 26.9 0.2 28.8 0.2\n 17NOV1993 21.7 0.0 25.1 0.2 26.9 0.2 28.9 0.3\n 24NOV1993 21.4-0.5 25.1 0.0 26.7 0.1 29.0 0.5\n 01DEC1993 21.8-0.4 25.3 0.2 26.9 0.3 29.2 0.6\n 08DEC1993 22.1-0.3 25.3 0.2 26.9 0.4 29.0 0.5\n 15DEC1993 23.1 0.4 25.3 0.2 26.8 0.3 28.9 0.4\n 22DEC1993 23.0-0.2 25.3 0.1 26.6 0.1 28.9 0.4\n 29DEC1993 23.3-0.2 25.4 0.0 26.5-0.1 28.6 0.2\n 05JAN1994 23.8 0.0 25.7 0.2 26.7 0.1 28.7 0.3\n 12JAN1994 23.9-0.3 25.7 0.1 26.7 0.2 28.5 0.2\n 19JAN1994 24.6 0.0 25.7-0.1 26.5-0.1 28.5 0.2\n 26JAN1994 24.8-0.2 25.8-0.1 26.5-0.2 28.2 0.0\n 02FEB1994 25.4 0.0 25.9-0.1 26.6 0.0 28.2 0.0\n 09FEB1994 25.9 0.1 26.2 0.0 26.7 0.0 28.1 0.0\n 16FEB1994 25.6-0.5 26.1-0.3 26.6-0.1 28.0 0.0\n 23FEB1994 26.1-0.1 25.9-0.7 26.4-0.5 27.9-0.2\n 02MAR1994 26.2-0.1 26.6-0.2 26.6-0.3 27.9-0.2\n 09MAR1994 25.5-0.9 27.0 0.1 27.2 0.1 28.2 0.1\n 16MAR1994 25.7-0.9 27.0-0.1 27.4 0.2 28.4 0.2\n 23MAR1994 25.0-1.2 26.8-0.4 27.3-0.1 28.3 0.0\n 30MAR1994 24.8-1.3 27.0-0.3 27.7 0.2 28.3 0.0\n 06APR1994 24.9-0.9 27.0-0.4 27.6 0.0 28.5 0.1\n 13APR1994 24.7-0.9 27.2-0.3 28.0 0.2 28.6 0.2\n 20APR1994 24.2-1.1 27.0-0.4 28.0 0.2 28.6 0.1\n 27APR1994 23.4-1.6 27.1-0.2 28.1 0.3 28.7 0.2\n 04MAY1994 23.4-1.3 27.0-0.3 27.9 0.1 28.8 0.1\n 11MAY1994 23.6-0.8 26.8-0.3 27.8 0.0 28.9 0.2\n 18MAY1994 23.0-1.1 27.2 0.1 28.2 0.4 29.0 0.2\n 25MAY1994 23.0-0.8 26.9 0.0 28.1 0.3 29.1 0.3\n 01JUN1994 22.8-0.7 26.9 0.1 28.3 0.5 29.3 0.5\n 08JUN1994 22.7-0.5 26.7 0.1 28.0 0.3 29.1 0.3\n 15JUN1994 22.7-0.1 26.8 0.4 28.2 0.6 29.1 0.3\n 22JUN1994 22.2-0.4 26.2-0.1 27.9 0.3 29.2 0.4\n 29JUN1994 21.7-0.6 25.9-0.2 27.6 0.1 29.2 0.4\n 06JUL1994 21.9-0.1 25.6-0.3 27.4 0.1 29.3 0.5\n 13JUL1994 21.3-0.4 25.2-0.5 27.3 0.1 29.4 0.6\n 20JUL1994 20.9-0.6 25.1-0.4 27.4 0.2 29.5 0.8\n 27JUL1994 20.8-0.5 24.8-0.6 27.2 0.1 29.4 0.6\n 03AUG1994 20.1-1.0 24.5-0.8 27.3 0.3 29.4 0.7\n 10AUG1994 19.2-1.6 24.8-0.3 27.6 0.7 29.5 0.8\n 17AUG1994 19.6-1.1 24.8-0.2 27.4 0.6 29.5 0.9\n 24AUG1994 20.0-0.5 24.8-0.2 27.3 0.5 29.5 0.8\n 31AUG1994 19.6-0.9 24.7-0.2 27.1 0.3 29.4 0.7\n 07SEP1994 20.1-0.4 24.6-0.3 26.9 0.2 29.3 0.6\n 14SEP1994 20.0-0.3 24.6-0.2 26.9 0.1 29.2 0.5\n 21SEP1994 20.5 0.1 24.9 0.0 27.0 0.2 29.2 0.5\n 28SEP1994 20.2-0.3 25.2 0.3 27.2 0.5 29.2 0.6\n 05OCT1994 21.0 0.3 25.4 0.5 27.3 0.6 29.4 0.8\n 12OCT1994 21.7 0.9 25.6 0.7 27.5 0.8 29.4 0.8\n 19OCT1994 21.8 0.9 25.6 0.6 27.5 0.8 29.4 0.8\n 26OCT1994 21.7 0.7 25.6 0.6 27.6 1.0 29.5 0.9\n 02NOV1994 22.1 0.9 25.7 0.7 27.8 1.1 29.6 1.0\n 09NOV1994 22.1 0.7 26.0 1.0 27.9 1.3 29.5 0.9\n 16NOV1994 22.3 0.7 25.8 0.8 27.8 1.1 29.6 1.0\n 23NOV1994 22.8 0.9 25.9 0.9 27.9 1.2 29.7 1.1\n 30NOV1994 22.9 0.7 26.0 0.9 28.0 1.4 29.8 1.3\n 07DEC1994 23.3 0.9 26.0 0.9 27.9 1.3 29.6 1.1\n 14DEC1994 23.4 0.7 25.9 0.8 27.9 1.3 29.5 1.1\n 21DEC1994 23.7 0.6 26.2 1.0 27.9 1.3 29.3 0.9\n 28DEC1994 24.3 0.9 26.3 0.9 27.8 1.3 29.3 0.9\n 04JAN1995 24.7 0.8 26.1 0.7 27.6 1.1 29.3 0.9\n 11JAN1995 25.1 0.9 26.2 0.7 27.6 1.0 29.2 0.9\n 18JAN1995 25.3 0.8 26.4 0.7 27.6 1.0 29.3 1.0\n 25JAN1995 25.9 0.9 26.5 0.6 27.5 0.8 29.1 0.8\n 01FEB1995 26.2 0.9 26.7 0.7 27.4 0.8 29.0 0.9\n 08FEB1995 26.7 0.9 26.9 0.7 27.4 0.7 29.1 1.0\n 15FEB1995 26.5 0.4 26.8 0.4 27.3 0.5 28.9 0.8\n 22FEB1995 26.4 0.2 26.9 0.3 27.5 0.7 29.0 0.9\n 01MAR1995 26.0-0.2 26.9 0.2 27.7 0.7 29.0 0.9\n 08MAR1995 26.0-0.4 26.7-0.2 27.4 0.4 28.9 0.7\n 15MAR1995 26.6 0.1 27.1 0.0 27.7 0.5 29.0 0.9\n 22MAR1995 26.4 0.1 27.2-0.1 27.7 0.3 29.0 0.8\n 29MAR1995 25.4-0.6 27.4 0.1 27.7 0.2 28.8 0.5\n 05APR1995 24.9-1.0 27.2-0.2 27.9 0.3 28.8 0.5\n 12APR1995 24.9-0.7 27.3-0.2 27.8 0.1 28.8 0.4\n 19APR1995 24.6-0.7 27.3-0.2 28.2 0.4 28.9 0.3\n 26APR1995 23.5-1.5 26.6-0.7 27.9 0.1 28.9 0.3\n 03MAY1995 23.3-1.4 26.6-0.6 28.0 0.2 29.2 0.6\n 10MAY1995 23.0-1.4 26.3-0.8 27.7-0.1 29.1 0.4\n 17MAY1995 23.0-1.2 26.2-0.8 27.7-0.2 29.2 0.4\n 24MAY1995 23.2-0.6 26.4-0.5 27.6-0.2 29.1 0.3\n 31MAY1995 22.8-0.7 26.4-0.3 27.7 0.0 29.0 0.2\n 07JUN1995 22.9-0.3 26.4-0.2 27.7 0.0 29.1 0.3\n 14JUN1995 22.9 0.0 26.4-0.1 27.7 0.1 29.1 0.3\n 21JUN1995 21.9-0.7 26.0-0.3 27.5 0.0 28.9 0.1\n 28JUN1995 21.8-0.5 25.8-0.3 27.3-0.1 28.8 0.0\n 05JUL1995 22.0 0.0 25.7-0.2 27.3-0.1 29.0 0.2\n 12JUL1995 21.2-0.5 25.6-0.1 27.1-0.2 28.8 0.0\n 19JUL1995 21.0-0.5 25.3-0.2 26.9-0.3 28.7-0.1\n 26JUL1995 20.8-0.5 25.1-0.3 26.8-0.3 28.6-0.1\n 02AUG1995 20.3-0.8 24.8-0.5 26.7-0.3 28.5-0.2\n 09AUG1995 19.9-1.0 24.3-0.8 26.3-0.6 28.3-0.4\n 16AUG1995 20.0-0.7 24.3-0.7 26.4-0.4 28.5-0.2\n 23AUG1995 19.9-0.7 24.3-0.7 26.3-0.5 28.4-0.2\n 30AUG1995 20.1-0.5 24.0-0.9 25.9-0.8 28.2-0.5\n 06SEP1995 20.4 0.0 24.1-0.8 26.0-0.8 28.2-0.5\n 13SEP1995 19.9-0.5 24.1-0.8 26.0-0.7 28.0-0.6\n 20SEP1995 20.2-0.2 24.0-0.9 26.1-0.7 28.4-0.3\n 27SEP1995 20.2-0.3 23.9-1.0 25.9-0.8 28.4-0.3\n 04OCT1995 19.6-1.0 23.9-1.0 25.6-1.1 28.1-0.5\n 11OCT1995 20.2-0.5 24.1-0.8 25.6-1.1 28.0-0.6\n 18OCT1995 20.0-0.8 24.1-0.9 25.8-0.9 28.2-0.5\n 25OCT1995 20.3-0.7 24.0-0.9 25.6-1.1 27.9-0.8\n 01NOV1995 21.0-0.2 24.1-0.8 25.6-1.0 28.0-0.7\n 08NOV1995 20.6-0.8 23.9-1.1 25.8-0.9 28.1-0.5\n 15NOV1995 21.3-0.2 24.1-0.9 25.7-1.0 27.8-0.8\n 22NOV1995 21.4-0.4 24.1-0.9 25.5-1.1 27.7-0.9\n 29NOV1995 21.6-0.5 24.1-1.0 25.7-0.9 28.1-0.5\n 06DEC1995 21.5-0.9 24.1-1.0 25.6-1.0 27.9-0.6\n 13DEC1995 21.7-1.0 24.0-1.1 25.4-1.2 27.9-0.5\n 20DEC1995 22.0-1.0 24.1-1.1 25.6-1.0 28.1-0.3\n 27DEC1995 22.8-0.6 24.5-0.8 25.7-0.9 28.1-0.3\n 03JAN1996 23.4-0.4 24.6-0.8 25.6-1.0 28.1-0.3\n 10JAN1996 23.6-0.6 24.9-0.6 25.6-1.0 27.9-0.4\n 17JAN1996 24.0-0.5 25.2-0.5 25.9-0.7 27.8-0.5\n 24JAN1996 23.9-1.0 25.0-0.8 25.9-0.7 27.9-0.4\n 31JAN1996 24.6-0.7 25.2-0.8 25.8-0.9 27.8-0.4\n 07FEB1996 25.4-0.3 25.4-0.8 25.6-1.1 27.5-0.6\n 14FEB1996 25.9-0.1 25.7-0.6 25.8-0.9 27.5-0.5\n 21FEB1996 26.0-0.2 25.9-0.6 25.8-1.0 27.4-0.7\n 28FEB1996 26.1-0.2 26.3-0.5 26.3-0.6 27.5-0.6\n 06MAR1996 26.6 0.2 26.5-0.4 26.2-0.8 27.5-0.6\n 13MAR1996 26.1-0.3 26.9-0.2 26.6-0.6 27.7-0.5\n 20MAR1996 26.3-0.1 27.0-0.2 26.8-0.5 27.7-0.5\n 27MAR1996 25.7-0.4 26.7-0.6 26.8-0.6 27.8-0.4\n 03APR1996 24.4-1.5 26.5-0.9 27.0-0.6 27.9-0.5\n 10APR1996 23.9-1.7 27.0-0.4 27.4-0.3 27.9-0.5\n 17APR1996 23.8-1.6 26.8-0.7 27.3-0.4 28.0-0.5\n 24APR1996 23.6-1.5 26.7-0.7 27.6-0.1 28.2-0.3\n 01MAY1996 23.0-1.9 26.4-0.9 27.4-0.4 28.2-0.4\n 08MAY1996 23.0-1.6 26.5-0.7 27.6-0.2 28.4-0.3\n 15MAY1996 23.0-1.3 26.3-0.8 27.3-0.5 28.3-0.4\n 22MAY1996 23.0-0.9 26.2-0.7 27.2-0.6 28.5-0.3\n 29MAY1996 22.6-1.1 26.2-0.6 27.3-0.4 28.6-0.2\n 05JUN1996 22.3-1.0 26.0-0.6 27.3-0.4 28.6-0.3\n 12JUN1996 21.9-1.0 26.0-0.5 27.3-0.4 28.5-0.4\n 19JUN1996 21.4-1.3 25.8-0.6 27.3-0.3 28.4-0.4\n 26JUN1996 20.6-1.8 25.7-0.5 27.3-0.2 28.6-0.2\n 03JUL1996 20.4-1.7 25.9 0.0 27.6 0.2 28.6-0.2\n 10JUL1996 20.1-1.8 25.4-0.3 27.1-0.2 28.5-0.3\n 17JUL1996 20.0-1.6 25.4-0.2 27.1-0.1 28.3-0.5\n 24JUL1996 20.2-1.2 25.1-0.4 26.9-0.2 28.5-0.3\n 31JUL1996 19.2-1.9 24.7-0.6 26.6-0.4 28.4-0.3\n 07AUG1996 19.2-1.7 24.8-0.4 26.7-0.3 28.5-0.2\n 14AUG1996 20.0-0.8 24.6-0.5 26.5-0.4 28.6 0.0\n 21AUG1996 20.1-0.5 24.6-0.3 26.5-0.3 28.6-0.1\n 28AUG1996 18.9-1.6 24.4-0.6 26.5-0.2 28.4-0.3\n 04SEP1996 19.1-1.3 24.3-0.6 26.4-0.4 28.5-0.2\n 11SEP1996 19.4-1.0 24.4-0.5 26.2-0.5 28.3-0.4\n 18SEP1996 19.1-1.3 24.3-0.5 26.4-0.3 28.5-0.2\n 25SEP1996 19.3-1.2 24.4-0.4 26.3-0.4 28.4-0.3\n 02OCT1996 19.5-1.2 24.5-0.4 26.2-0.5 28.3-0.4\n 09OCT1996 19.5-1.3 24.3-0.6 26.2-0.5 28.5-0.2\n 16OCT1996 20.2-0.6 24.4-0.5 26.3-0.3 28.5-0.1\n 23OCT1996 20.5-0.5 24.4-0.6 26.2-0.5 28.3-0.3\n 30OCT1996 20.0-1.1 24.3-0.7 26.1-0.5 28.3-0.3\n 06NOV1996 20.2-1.2 24.4-0.6 26.1-0.5 28.1-0.5\n 13NOV1996 20.1-1.4 24.4-0.6 26.2-0.5 28.3-0.3\n 20NOV1996 20.3-1.5 24.4-0.6 26.3-0.3 28.4-0.1\n 27NOV1996 20.4-1.6 24.3-0.7 26.2-0.4 28.3-0.2\n 04DEC1996 20.8-1.5 24.4-0.7 26.3-0.3 28.5 0.0\n 11DEC1996 21.6-1.0 24.1-1.0 26.1-0.5 28.6 0.1\n 18DEC1996 21.6-1.3 24.2-1.0 25.9-0.6 28.3-0.1\n 25DEC1996 22.1-1.1 24.1-1.1 25.9-0.7 28.3-0.1\n 01JAN1997 22.5-1.2 24.3-1.1 25.8-0.8 28.2-0.2\n 08JAN1997 23.0-1.0 24.5-1.0 25.9-0.6 28.4 0.1\n 15JAN1997 23.6-0.8 24.6-1.0 25.8-0.7 28.4 0.1\n 22JAN1997 24.3-0.5 24.8-1.0 25.9-0.7 28.4 0.2\n 29JAN1997 24.6-0.6 25.1-0.8 26.3-0.4 28.4 0.2\n 05FEB1997 25.3-0.2 25.2-0.9 26.2-0.5 28.4 0.2\n 12FEB1997 25.4-0.6 25.8-0.5 26.4-0.3 28.3 0.2\n 19FEB1997 26.3 0.1 25.9-0.6 26.4-0.4 28.2 0.1\n 26FEB1997 26.2-0.1 26.2-0.4 26.5-0.4 28.2 0.1\n 05MAR1997 26.8 0.5 26.6-0.3 26.6-0.4 28.1 0.0\n 12MAR1997 26.9 0.5 26.8-0.3 26.8-0.4 28.3 0.1\n 19MAR1997 27.0 0.6 27.3 0.1 27.4 0.1 28.5 0.3\n 26MAR1997 27.2 1.0 27.4 0.1 27.3-0.1 28.9 0.7\n 02APR1997 27.0 1.1 27.3-0.1 27.5 0.0 29.2 0.8\n 09APR1997 26.4 0.7 27.3-0.1 27.8 0.2 29.2 0.8\n 16APR1997 26.5 1.1 27.6 0.1 28.0 0.3 29.3 0.8\n 23APR1997 26.6 1.4 27.8 0.4 28.4 0.6 29.5 0.9\n 30APR1997 26.8 1.9 28.0 0.7 28.4 0.6 29.5 0.8\n 07MAY1997 26.8 2.2 28.2 1.0 28.6 0.8 29.4 0.8\n 14MAY1997 26.7 2.4 28.0 0.9 28.5 0.6 29.3 0.6\n 21MAY1997 26.6 2.6 27.9 1.0 28.6 0.8 29.5 0.7\n 28MAY1997 26.8 3.1 28.1 1.3 28.8 1.0 29.5 0.7\n 04JUN1997 26.4 3.1 28.0 1.3 28.8 1.1 29.4 0.6\n 11JUN1997 26.5 3.5 28.1 1.6 28.9 1.2 29.3 0.5\n 18JUN1997 26.0 3.3 28.2 1.8 29.0 1.4 29.4 0.6\n 25JUN1997 26.2 3.7 28.2 2.0 29.1 1.6 29.5 0.7\n 02JUL1997 25.9 3.7 28.1 2.1 29.0 1.5 29.4 0.6\n 09JUL1997 25.7 3.8 28.0 2.2 28.9 1.6 29.5 0.7\n 16JUL1997 25.7 4.1 28.1 2.5 29.0 1.8 29.5 0.7\n 23JUL1997 25.5 4.1 27.9 2.4 28.8 1.7 29.5 0.8\n 30JUL1997 25.2 4.0 27.9 2.6 28.9 1.9 29.5 0.8\n 06AUG1997 25.3 4.3 27.8 2.6 28.8 1.8 29.4 0.7\n 13AUG1997 25.4 4.6 27.9 2.9 28.9 2.0 29.3 0.6\n 20AUG1997 24.2 3.6 27.9 2.9 28.9 2.1 29.2 0.5\n 27AUG1997 24.3 3.7 27.7 2.7 28.8 2.0 29.2 0.5\n 03SEP1997 24.6 4.2 27.8 2.9 28.9 2.1 29.2 0.6\n 10SEP1997 24.6 4.2 27.8 2.9 28.9 2.2 29.3 0.6\n 17SEP1997 24.2 3.8 27.8 2.9 28.9 2.2 29.3 0.6\n 24SEP1997 24.4 3.9 27.9 3.0 28.9 2.2 29.5 0.8\n 01OCT1997 24.1 3.5 28.0 3.1 29.1 2.4 29.4 0.7\n 08OCT1997 24.5 3.8 28.1 3.2 29.2 2.6 29.3 0.6\n 15OCT1997 24.5 3.7 28.1 3.2 29.2 2.5 29.3 0.7\n 22OCT1997 24.9 3.9 28.2 3.3 29.3 2.6 29.5 0.8\n 29OCT1997 24.7 3.6 28.3 3.4 29.2 2.6 29.2 0.6\n 05NOV1997 25.0 3.7 28.4 3.4 29.2 2.6 29.2 0.6\n 12NOV1997 25.8 4.3 28.5 3.6 29.3 2.7 29.5 0.8\n 19NOV1997 25.8 4.1 28.6 3.6 29.3 2.7 29.7 1.1\n 26NOV1997 25.9 3.9 28.7 3.7 29.4 2.8 29.7 1.1\n 03DEC1997 26.2 3.9 28.6 3.6 29.2 2.6 29.4 0.9\n 10DEC1997 26.7 4.2 28.7 3.6 29.2 2.7 29.4 0.9\n 17DEC1997 27.0 4.1 28.8 3.6 29.3 2.7 29.3 0.8\n 24DEC1997 27.2 4.0 28.8 3.5 29.3 2.7 29.3 0.9\n 31DEC1997 27.7 4.1 28.9 3.5 29.2 2.7 29.2 0.8\n 07JAN1998 28.0 4.0 28.9 3.4 29.2 2.6 29.1 0.8\n 14JAN1998 28.4 4.0 28.9 3.3 29.1 2.5 29.0 0.7\n 21JAN1998 28.4 3.7 28.9 3.2 29.0 2.4 28.9 0.7\n 28JAN1998 28.3 3.2 29.1 3.1 29.1 2.4 28.9 0.7\n 04FEB1998 28.9 3.4 29.1 3.0 29.2 2.5 29.0 0.9\n 11FEB1998 28.9 3.0 29.0 2.7 29.0 2.3 29.0 0.9\n 18FEB1998 29.1 3.0 28.8 2.3 28.7 1.9 28.8 0.7\n 25FEB1998 29.1 2.9 28.9 2.2 28.6 1.7 28.8 0.7\n 04MAR1998 29.2 2.8 29.0 2.2 28.5 1.5 28.6 0.4\n 11MAR1998 29.2 2.8 29.1 2.1 28.7 1.6 28.8 0.7\n 18MAR1998 29.2 2.7 29.1 2.0 28.6 1.4 28.6 0.4\n 25MAR1998 29.1 2.8 29.2 2.0 28.8 1.5 28.6 0.4\n 01APR1998 29.1 3.1 29.3 1.9 28.7 1.2 28.6 0.2\n 08APR1998 28.8 3.0 29.2 1.8 28.6 1.0 28.5 0.0\n 15APR1998 28.6 3.1 29.1 1.6 28.4 0.6 28.5 0.0\n 22APR1998 28.4 3.2 29.0 1.6 28.5 0.7 28.5-0.1\n 29APR1998 28.3 3.4 28.9 1.6 28.7 0.8 28.7 0.1\n 06MAY1998 27.8 3.2 29.4 2.1 29.1 1.3 28.7 0.1\n 13MAY1998 28.1 3.8 28.7 1.6 28.8 0.9 28.7-0.1\n 20MAY1998 27.9 3.9 27.6 0.7 28.3 0.5 28.6-0.2\n 27MAY1998 27.0 3.3 27.1 0.2 27.9 0.1 28.8 0.0\n 03JUN1998 26.2 2.8 26.1-0.6 27.1-0.6 28.7-0.1\n 10JUN1998 26.1 3.0 26.2-0.3 26.9-0.8 28.6-0.2\n 17JUN1998 24.6 1.8 25.8-0.6 26.7-1.0 28.7-0.1\n 24JUN1998 24.5 2.0 26.0-0.2 26.4-1.1 28.5-0.3\n 01JUL1998 24.1 1.9 25.7-0.3 26.4-1.1 28.3-0.5\n 08JUL1998 23.6 1.7 25.6-0.2 26.2-1.2 28.2-0.6\n 15JUL1998 23.6 2.0 25.3-0.4 25.9-1.4 28.1-0.7\n 22JUL1998 23.0 1.5 24.9-0.6 25.7-1.4 28.0-0.8\n 29JUL1998 23.2 2.0 24.9-0.5 25.7-1.4 27.8-1.0\n 05AUG1998 22.6 1.7 24.8-0.4 25.6-1.4 27.9-0.8\n 12AUG1998 21.8 1.1 24.6-0.5 25.5-1.4 27.8-0.9\n 19AUG1998 21.3 0.7 24.4-0.6 25.2-1.6 27.6-1.0\n 26AUG1998 21.2 0.7 24.7-0.3 25.6-1.2 27.6-1.0\n 02SEP1998 21.1 0.6 24.5-0.4 25.6-1.2 27.8-0.8\n 09SEP1998 20.9 0.5 24.3-0.6 25.9-0.8 28.3-0.4\n 16SEP1998 21.0 0.7 24.2-0.7 25.7-1.0 28.0-0.7\n 23SEP1998 20.5 0.1 24.1-0.7 25.5-1.2 27.6-1.1\n 30SEP1998 20.9 0.3 23.7-1.2 25.1-1.6 27.2-1.4\n 07OCT1998 20.9 0.2 23.9-1.0 25.3-1.4 27.5-1.2\n 14OCT1998 21.2 0.4 24.1-0.8 25.4-1.3 27.3-1.4\n 21OCT1998 21.1 0.1 24.1-0.8 25.3-1.4 27.2-1.5\n 28OCT1998 21.6 0.5 24.2-0.7 25.5-1.2 27.3-1.3\n 04NOV1998 21.4 0.1 24.4-0.6 25.2-1.5 27.2-1.4\n 11NOV1998 21.0-0.4 24.0-0.9 25.2-1.5 27.2-1.4\n 18NOV1998 21.7 0.0 24.1-0.9 25.2-1.4 27.1-1.5\n 25NOV1998 21.5-0.5 24.0-1.0 25.1-1.5 27.2-1.4\n 02DEC1998 21.7-0.5 23.9-1.2 25.1-1.5 27.3-1.2\n 09DEC1998 22.0-0.5 23.8-1.3 24.8-1.8 27.2-1.2\n 16DEC1998 22.5-0.3 23.9-1.3 24.7-1.8 27.1-1.4\n 23DEC1998 23.3 0.2 23.8-1.4 24.6-1.9 27.0-1.4\n 30DEC1998 23.2-0.4 23.9-1.5 24.7-1.9 26.7-1.7\n 06JAN1999 23.4-0.5 24.1-1.4 24.7-1.9 26.7-1.7\n 13JAN1999 23.7-0.6 24.2-1.4 25.0-1.6 26.8-1.5\n 20JAN1999 23.3-1.4 24.5-1.3 25.0-1.6 26.4-1.8\n 27JAN1999 24.5-0.6 24.9-1.0 25.0-1.6 26.2-2.0\n 03FEB1999 24.8-0.6 25.1-1.0 25.2-1.5 26.6-1.6\n 10FEB1999 25.1-0.7 25.0-1.2 25.2-1.5 26.5-1.6\n 17FEB1999 25.5-0.6 25.5-0.9 25.5-1.3 26.3-1.7\n 24FEB1999 26.8 0.6 26.4-0.2 25.7-1.2 26.4-1.7\n 03MAR1999 27.4 1.1 26.7-0.1 26.1-0.9 26.8-1.3\n 10MAR1999 27.0 0.6 26.6-0.4 26.1-1.0 26.7-1.5\n 17MAR1999 26.4 0.0 26.7-0.4 26.2-1.0 26.9-1.2\n 24MAR1999 26.3 0.0 26.7-0.6 26.5-0.9 27.0-1.2\n 31MAR1999 25.8-0.3 26.6-0.7 26.5-1.0 27.0-1.3\n 07APR1999 24.4-1.3 26.7-0.7 26.7-0.9 27.1-1.3\n 14APR1999 24.6-0.9 26.5-0.9 26.8-0.9 27.3-1.1\n 21APR1999 23.8-1.4 26.7-0.7 27.0-0.8 27.4-1.1\n 28APR1999 23.7-1.3 26.8-0.6 27.0-0.8 27.5-1.1\n 05MAY1999 23.6-1.1 26.6-0.6 27.0-0.8 27.8-0.9\n 12MAY1999 23.7-0.7 26.7-0.4 27.1-0.7 27.9-0.8\n 19MAY1999 23.7-0.4 26.5-0.5 26.9-0.9 27.8-0.9\n 26MAY1999 23.2-0.6 26.1-0.8 26.9-0.9 27.9-0.9\n 02JUN1999 22.5-0.9 25.8-0.9 26.7-1.1 28.0-0.8\n 09JUN1999 22.4-0.8 25.8-0.7 26.6-1.1 27.9-0.9\n 16JUN1999 21.6-1.2 25.6-0.9 26.6-1.1 28.0-0.9\n 23JUN1999 21.3-1.2 25.4-0.8 26.5-1.0 28.0-0.8\n 30JUN1999 21.3-1.0 25.3-0.8 26.6-0.8 28.1-0.7\n 07JUL1999 20.4-1.5 25.2-0.7 26.6-0.7 28.1-0.7\n 14JUL1999 20.4-1.3 24.9-0.7 26.4-0.8 27.8-1.0\n 21JUL1999 20.3-1.1 24.8-0.7 26.2-0.9 27.8-1.0\n 28JUL1999 20.2-1.0 24.4-1.0 26.0-1.0 27.8-0.9\n 04AUG1999 20.2-0.8 24.3-0.9 26.0-1.0 27.8-0.9\n 11AUG1999 19.7-1.1 24.1-1.0 25.6-1.3 27.7-1.0\n 18AUG1999 19.5-1.1 23.9-1.1 25.4-1.4 27.8-0.9\n 25AUG1999 19.7-0.9 24.0-1.0 25.5-1.3 27.6-1.1\n 01SEP1999 19.5-1.0 23.6-1.3 25.4-1.4 27.6-1.0\n 08SEP1999 19.2-1.2 23.7-1.2 25.7-1.1 27.7-0.9\n 15SEP1999 18.9-1.5 23.6-1.3 25.7-1.0 27.7-0.9\n 22SEP1999 19.3-1.2 23.8-1.1 25.8-0.9 27.9-0.7\n 29SEP1999 19.5-1.1 24.0-0.8 25.9-0.8 27.8-0.8\n 06OCT1999 19.7-0.9 23.6-1.3 25.7-1.0 27.9-0.8\n 13OCT1999 20.1-0.7 23.7-1.2 25.8-0.9 28.0-0.6\n 20OCT1999 20.0-1.0 23.7-1.2 25.6-1.0 27.8-0.9\n 27OCT1999 20.6-0.5 23.8-1.1 25.4-1.3 27.7-1.0\n 03NOV1999 20.1-1.2 23.6-1.3 25.4-1.3 27.6-1.0\n 10NOV1999 20.1-1.3 23.7-1.2 25.4-1.3 27.5-1.1\n 17NOV1999 20.6-1.0 23.5-1.5 25.2-1.5 27.6-1.0\n 24NOV1999 20.9-1.1 23.1-1.9 24.7-1.9 27.4-1.1\n 01DEC1999 21.0-1.2 23.1-1.9 24.9-1.7 27.3-1.2\n 08DEC1999 21.1-1.4 23.6-1.5 25.1-1.4 27.3-1.2\n 15DEC1999 21.3-1.4 23.4-1.7 24.9-1.7 27.1-1.4\n 22DEC1999 22.0-1.1 23.8-1.4 24.9-1.6 27.1-1.3\n 29DEC1999 23.0-0.5 23.6-1.8 24.6-1.9 27.2-1.2\n 05JAN2000 23.2-0.6 23.4-2.1 24.5-2.0 27.0-1.3\n 12JAN2000 23.8-0.4 23.9-1.7 24.7-1.9 26.9-1.4\n 19JAN2000 23.7-0.9 24.0-1.7 24.8-1.8 26.9-1.4\n 26JAN2000 24.0-1.0 24.0-1.8 24.6-2.0 26.9-1.3\n 02FEB2000 25.0-0.4 24.7-1.3 24.8-1.9 26.7-1.5\n 09FEB2000 25.1-0.7 25.3-0.9 25.1-1.6 26.6-1.5\n 16FEB2000 25.6-0.5 25.5-0.9 25.4-1.4 26.7-1.4\n 23FEB2000 26.2 0.0 25.4-1.2 25.2-1.6 26.6-1.5\n 01MAR2000 26.4 0.1 25.7-1.0 25.5-1.5 26.5-1.6\n 08MAR2000 26.6 0.2 26.2-0.8 25.7-1.4 26.6-1.5\n 15MAR2000 26.2-0.3 26.5-0.6 26.0-1.2 26.7-1.5\n 22MAR2000 25.3-1.0 26.9-0.3 26.3-1.1 26.7-1.5\n 29MAR2000 25.6-0.5 27.5 0.2 26.8-0.7 27.0-1.3\n 05APR2000 25.7-0.1 27.6 0.2 27.0-0.6 27.2-1.2\n 12APR2000 26.1 0.5 27.4-0.1 26.9-0.8 27.3-1.2\n 19APR2000 25.6 0.3 27.5 0.0 27.0-0.8 27.4-1.1\n 26APR2000 25.3 0.3 27.5 0.1 27.1-0.7 27.5-1.0\n 03MAY2000 24.9 0.2 27.3 0.0 27.1-0.7 27.5-1.1\n 10MAY2000 24.3-0.1 27.2 0.0 27.1-0.7 27.7-1.0\n 17MAY2000 23.9-0.3 26.6-0.4 27.1-0.8 27.8-1.0\n 24MAY2000 23.2-0.6 26.4-0.5 27.1-0.7 28.0-0.8\n 31MAY2000 23.2-0.3 26.3-0.4 27.2-0.5 28.1-0.7\n 07JUN2000 22.6-0.6 26.0-0.7 27.0-0.7 28.0-0.8\n 14JUN2000 22.4-0.5 25.9-0.6 27.1-0.6 28.1-0.7\n 21JUN2000 21.7-0.9 25.8-0.5 27.0-0.6 28.2-0.7\n 28JUN2000 21.4-0.9 25.5-0.6 26.9-0.6 28.0-0.8\n 05JUL2000 21.0-1.0 25.6-0.3 26.9-0.5 28.0-0.8\n 12JUL2000 20.6-1.2 25.2-0.5 26.8-0.5 28.1-0.7\n 19JUL2000 20.3-1.2 24.9-0.6 26.7-0.5 28.2-0.5\n 26JUL2000 20.2-1.1 24.9-0.5 26.5-0.6 28.3-0.4\n 02AUG2000 20.2-0.8 24.7-0.5 26.6-0.4 28.4-0.3\n 09AUG2000 20.1-0.8 24.5-0.6 26.6-0.3 28.4-0.3\n 16AUG2000 20.5-0.2 24.4-0.6 26.4-0.4 28.3-0.3\n 23AUG2000 20.1-0.5 24.3-0.7 26.3-0.5 28.1-0.5\n 30AUG2000 19.3-1.2 24.5-0.4 26.4-0.4 28.2-0.4\n 06SEP2000 20.2-0.3 24.4-0.4 26.3-0.5 28.4-0.2\n 13SEP2000 19.7-0.7 24.3-0.6 26.1-0.6 28.4-0.2\n 20SEP2000 20.1-0.3 24.2-0.6 26.1-0.6 28.5-0.2\n 27SEP2000 19.9-0.6 24.4-0.5 26.3-0.4 28.4-0.3\n 04OCT2000 20.2-0.5 24.7-0.2 26.1-0.6 28.1-0.5\n 11OCT2000 20.2-0.5 24.4-0.5 26.0-0.6 28.2-0.4\n 18OCT2000 20.5-0.3 24.3-0.6 25.9-0.8 28.1-0.5\n 25OCT2000 20.7-0.4 24.3-0.6 25.9-0.8 28.1-0.6\n 01NOV2000 20.6-0.6 24.2-0.8 25.6-1.1 28.0-0.6\n 08NOV2000 20.6-0.8 24.0-1.0 25.6-1.1 28.1-0.6\n 15NOV2000 20.3-1.3 24.2-0.7 25.9-0.7 28.2-0.4\n 22NOV2000 20.2-1.7 24.1-0.9 25.9-0.7 28.1-0.5\n 29NOV2000 21.4-0.7 24.4-0.6 25.9-0.7 27.8-0.7\n 06DEC2000 21.8-0.6 24.4-0.7 25.6-1.0 27.5-1.1\n 13DEC2000 22.4-0.2 24.5-0.6 25.6-1.0 27.6-0.9\n 20DEC2000 22.4-0.6 24.4-0.8 25.6-1.0 27.6-0.8\n 27DEC2000 22.2-1.2 24.4-1.0 25.5-1.0 27.5-0.9\n 03JAN2001 22.8-0.9 24.5-0.9 25.6-1.0 27.5-0.8\n 10JAN2001 23.3-0.8 24.7-0.8 25.6-1.0 27.5-0.9\n 17JAN2001 23.7-0.8 25.1-0.6 25.8-0.8 27.5-0.8\n 24JAN2001 24.6-0.3 25.3-0.5 25.9-0.8 27.4-0.8\n 31JAN2001 25.2 0.0 25.4-0.6 26.0-0.7 27.3-0.9\n 07FEB2001 25.6-0.1 25.8-0.4 25.9-0.8 27.1-1.0\n 14FEB2001 25.6-0.4 25.9-0.5 26.0-0.7 27.2-0.9\n 21FEB2001 26.0-0.2 26.4-0.1 26.3-0.6 27.3-0.8\n 28FEB2001 26.7 0.4 26.7 0.0 26.4-0.5 27.4-0.8\n 07MAR2001 27.2 0.8 27.1 0.2 26.6-0.5 27.4-0.7\n 14MAR2001 27.3 0.8 27.2 0.1 26.8-0.4 27.6-0.6\n 21MAR2001 27.6 1.3 27.4 0.2 27.1-0.2 27.7-0.6\n 28MAR2001 27.7 1.6 27.4 0.2 27.0-0.4 27.8-0.5\n 04APR2001 27.3 1.5 27.6 0.2 27.3-0.3 27.9-0.4\n 11APR2001 27.2 1.6 27.7 0.3 27.6-0.1 28.1-0.3\n 18APR2001 26.2 0.8 27.7 0.2 27.7-0.1 28.3-0.2\n 25APR2001 25.9 0.8 27.2-0.1 27.6-0.2 28.2-0.3\n 02MAY2001 24.2-0.6 27.1-0.2 27.5-0.3 28.3-0.3\n 09MAY2001 23.9-0.6 27.0-0.1 27.6-0.2 28.6-0.1\n 16MAY2001 23.6-0.6 26.7-0.4 27.5-0.3 28.6-0.1\n 23MAY2001 23.3-0.6 26.9-0.1 27.7-0.1 28.8 0.0\n 30MAY2001 23.1-0.5 26.7 0.0 27.7-0.1 28.8 0.0\n 06JUN2001 22.1-1.2 26.7 0.1 27.8 0.1 28.8 0.0\n 13JUN2001 21.7-1.3 26.3-0.1 27.7 0.0 28.8 0.0\n 20JUN2001 21.5-1.2 26.3 0.0 27.7 0.1 28.8-0.1\n 27JUN2001 20.7-1.6 25.9-0.2 27.6 0.1 28.9 0.1\n 04JUL2001 20.7-1.4 25.6-0.3 27.5 0.1 29.0 0.2\n 11JUL2001 21.2-0.6 25.5-0.2 27.4 0.1 29.0 0.2\n 18JUL2001 20.9-0.7 25.5-0.1 27.3 0.1 29.1 0.3\n 25JUL2001 20.7-0.6 25.2-0.2 27.2 0.1 29.1 0.3\n 01AUG2001 20.3-0.8 25.0-0.3 27.2 0.1 29.1 0.4\n 08AUG2001 20.1-0.8 25.0-0.1 27.0 0.1 28.9 0.2\n 15AUG2001 19.8-0.9 24.7-0.3 26.8 0.0 28.9 0.2\n 22AUG2001 19.8-0.8 24.6-0.3 26.8 0.0 28.9 0.2\n 29AUG2001 19.7-0.9 24.3-0.6 26.6-0.2 29.0 0.4\n 05SEP2001 19.6-0.8 24.4-0.5 26.6-0.1 29.2 0.5\n 12SEP2001 19.1-1.3 24.2-0.7 26.6-0.2 29.1 0.4\n 19SEP2001 19.4-1.0 24.2-0.6 26.5-0.2 29.2 0.5\n 26SEP2001 19.6-0.9 24.3-0.6 26.5-0.2 29.1 0.4\n 03OCT2001 19.2-1.4 24.4-0.5 26.5-0.2 28.9 0.3\n 10OCT2001 19.6-1.1 24.4-0.5 26.5-0.2 29.0 0.4\n 17OCT2001 19.4-1.4 24.5-0.4 26.6 0.0 29.0 0.3\n 24OCT2001 19.6-1.4 24.5-0.4 26.6 0.0 29.1 0.4\n 31OCT2001 19.9-1.3 24.5-0.5 26.6 0.0 28.9 0.3\n 07NOV2001 20.3-1.1 24.3-0.7 26.6-0.1 29.1 0.5\n 14NOV2001 20.1-1.5 24.3-0.7 26.5-0.1 29.0 0.4\n 21NOV2001 20.6-1.2 24.3-0.7 26.3-0.3 28.8 0.2\n 28NOV2001 21.4-0.7 24.4-0.6 26.3-0.3 28.7 0.2\n 05DEC2001 21.4-1.0 24.5-0.6 26.1-0.5 28.6 0.1\n 12DEC2001 21.6-1.1 24.5-0.7 26.1-0.4 28.6 0.1\n 19DEC2001 22.0-0.9 24.6-0.5 26.2-0.4 28.5 0.0\n 26DEC2001 22.5-0.8 24.8-0.5 26.2-0.3 28.6 0.2\n 02JAN2002 23.2-0.5 24.8-0.7 26.2-0.4 28.6 0.2\n 09JAN2002 23.3-0.8 25.0-0.5 26.5-0.1 28.8 0.5\n 16JAN2002 23.5-1.0 25.0-0.7 26.4-0.1 28.9 0.6\n 23JAN2002 23.8-1.1 25.3-0.5 26.6 0.0 28.9 0.6\n 30JAN2002 24.3-0.9 25.5-0.5 26.7 0.1 28.7 0.6\n 06FEB2002 25.4-0.2 26.0-0.2 26.9 0.3 28.8 0.7\n 13FEB2002 25.9-0.1 26.2-0.2 27.0 0.3 28.9 0.8\n 20FEB2002 26.3 0.1 26.4-0.1 26.8 0.0 28.6 0.5\n 27FEB2002 27.4 1.1 26.7 0.0 27.1 0.1 28.6 0.5\n 06MAR2002 27.1 0.8 27.1 0.2 27.2 0.1 28.5 0.4\n 13MAR2002 27.6 1.2 27.2 0.1 27.3 0.1 28.6 0.4\n 20MAR2002 27.8 1.4 27.3 0.1 27.4 0.1 28.8 0.6\n 27MAR2002 27.4 1.3 27.4 0.2 27.4 0.0 28.7 0.5\n 03APR2002 27.1 1.2 27.6 0.2 27.7 0.2 28.8 0.5\n 10APR2002 27.1 1.5 27.8 0.4 28.0 0.3 29.0 0.6\n 17APR2002 26.3 0.9 27.6 0.1 27.9 0.2 29.1 0.6\n 24APR2002 25.4 0.3 27.3 0.0 28.0 0.2 29.3 0.7\n 01MAY2002 25.4 0.6 27.4 0.1 28.0 0.2 29.2 0.6\n 08MAY2002 25.0 0.5 27.3 0.1 28.0 0.2 29.2 0.5\n 15MAY2002 24.5 0.2 27.2 0.1 28.0 0.1 29.4 0.6\n 22MAY2002 24.4 0.5 27.1 0.2 28.3 0.4 29.6 0.8\n 29MAY2002 24.5 0.9 27.4 0.5 28.4 0.7 29.7 0.9\n 05JUN2002 23.5 0.2 27.3 0.6 28.6 0.9 29.8 1.0\n 12JUN2002 22.7-0.3 27.1 0.6 28.6 0.9 29.7 0.9\n 19JUN2002 22.1-0.6 27.0 0.6 28.4 0.8 29.6 0.8\n 26JUN2002 22.0-0.4 26.9 0.8 28.2 0.7 29.4 0.6\n 03JUL2002 21.8-0.3 26.6 0.6 28.0 0.6 29.4 0.6\n 10JUL2002 21.1-0.8 26.3 0.5 28.0 0.7 29.4 0.6\n 17JUL2002 21.2-0.4 26.0 0.4 28.0 0.8 29.5 0.7\n 24JUL2002 20.5-0.8 25.7 0.2 27.9 0.8 29.5 0.8\n 31JUL2002 20.3-0.8 25.5 0.2 27.9 0.9 29.6 0.9\n 07AUG2002 20.0-0.9 25.3 0.1 27.8 0.9 29.4 0.7\n 14AUG2002 20.3-0.4 25.5 0.5 27.8 0.9 29.4 0.7\n 21AUG2002 19.8-0.8 25.5 0.5 27.8 1.0 29.3 0.7\n 28AUG2002 19.8-0.7 25.6 0.7 27.8 1.0 29.4 0.7\n 04SEP2002 19.3-1.2 25.4 0.5 27.7 0.9 29.3 0.7\n 11SEP2002 20.2-0.2 25.5 0.6 27.8 1.0 29.4 0.7\n 18SEP2002 20.1-0.3 25.5 0.7 27.9 1.2 29.5 0.9\n 25SEP2002 20.1-0.4 25.7 0.8 27.9 1.2 29.5 0.8\n 02OCT2002 20.1-0.5 25.7 0.8 28.0 1.3 29.5 0.8\n 09OCT2002 20.7 0.0 25.6 0.7 27.9 1.2 29.4 0.7\n 16OCT2002 21.7 0.9 25.7 0.8 27.9 1.2 29.4 0.7\n 23OCT2002 21.6 0.6 26.0 1.1 28.2 1.6 29.8 1.2\n 30OCT2002 21.9 0.7 26.3 1.4 28.3 1.7 29.9 1.2\n 06NOV2002 22.0 0.6 26.2 1.3 28.2 1.6 29.8 1.2\n 13NOV2002 21.9 0.4 26.3 1.4 28.3 1.7 29.9 1.3\n 20NOV2002 22.5 0.7 26.5 1.5 28.3 1.7 29.9 1.3\n 27NOV2002 22.6 0.6 26.4 1.4 28.2 1.6 29.7 1.2\n 04DEC2002 23.0 0.7 26.6 1.6 28.2 1.6 29.6 1.0\n 11DEC2002 23.5 0.9 26.5 1.4 28.1 1.5 29.4 1.0\n 18DEC2002 23.3 0.4 26.5 1.3 28.1 1.5 29.4 1.0\n 25DEC2002 23.5 0.2 26.3 1.0 28.0 1.4 29.5 1.1\n 01JAN2003 24.2 0.6 26.6 1.2 28.1 1.5 29.4 1.1\n 08JAN2003 23.9-0.1 26.3 0.8 27.9 1.3 29.2 0.9\n 15JAN2003 24.1-0.3 26.3 0.7 27.7 1.2 29.3 1.0\n 22JAN2003 24.4-0.4 26.5 0.7 27.7 1.1 29.3 1.0\n 29JAN2003 24.9-0.3 26.3 0.3 27.5 0.8 29.1 0.9\n 05FEB2003 25.3-0.3 26.4 0.3 27.3 0.6 28.9 0.7\n 12FEB2003 25.7-0.3 26.6 0.3 27.4 0.7 28.9 0.9\n 19FEB2003 26.2 0.0 27.0 0.6 27.7 0.9 29.1 1.0\n 26FEB2003 26.0-0.3 26.8 0.1 27.6 0.7 29.2 1.1\n 05MAR2003 25.7-0.7 27.0 0.2 27.6 0.6 29.0 0.9\n 12MAR2003 25.7-0.8 27.2 0.1 27.7 0.6 29.0 0.8\n 19MAR2003 26.5 0.1 27.6 0.4 28.0 0.8 29.1 0.9\n 26MAR2003 25.5-0.7 27.4 0.2 27.9 0.5 29.0 0.7\n 02APR2003 25.7-0.3 27.2-0.1 27.8 0.3 28.9 0.6\n 09APR2003 24.8-0.9 27.3-0.1 27.8 0.2 29.0 0.6\n 16APR2003 24.3-1.1 27.3-0.2 27.9 0.1 28.9 0.5\n 23APR2003 23.6-1.6 27.2-0.2 27.8 0.0 28.9 0.4\n 30APR2003 23.2-1.6 26.5-0.8 27.7-0.1 28.9 0.3\n 07MAY2003 23.0-1.6 26.3-0.9 27.4-0.4 28.9 0.2\n 14MAY2003 22.5-1.8 26.2-0.9 27.3-0.5 28.8 0.1\n 21MAY2003 22.3-1.7 26.0-1.0 27.3-0.6 28.8 0.1\n 28MAY2003 22.0-1.6 26.0-0.9 27.4-0.4 29.0 0.2\n 04JUN2003 21.9-1.4 25.7-0.9 27.4-0.3 29.0 0.2\n 11JUN2003 21.6-1.5 25.7-0.8 27.4-0.2 29.1 0.2\n 18JUN2003 21.1-1.6 25.9-0.5 27.5-0.1 29.1 0.3\n 25JUN2003 21.6-0.8 25.9-0.2 27.6 0.0 29.1 0.3\n 02JUL2003 21.4-0.7 25.9-0.1 27.5 0.1 29.2 0.4\n 09JUL2003 21.1-0.8 25.9 0.0 27.6 0.3 29.2 0.4\n 16JUL2003 20.8-0.8 25.8 0.1 27.5 0.3 29.1 0.3\n 23JUL2003 20.2-1.2 25.7 0.2 27.3 0.2 29.1 0.3\n 30JUL2003 20.3-0.9 25.5 0.2 27.1 0.1 29.0 0.3\n 06AUG2003 20.2-0.8 25.3 0.1 27.0 0.0 29.0 0.3\n 13AUG2003 20.0-0.8 25.0 0.0 26.9 0.1 29.1 0.5\n 20AUG2003 20.6 0.0 24.9-0.1 26.7-0.1 29.0 0.4\n 27AUG2003 20.0-0.5 24.8-0.2 26.7-0.1 29.0 0.3\n 03SEP2003 20.4-0.1 25.0 0.1 26.9 0.1 29.0 0.3\n 10SEP2003 19.9-0.5 24.8-0.1 26.8 0.0 28.9 0.2\n 17SEP2003 19.5-0.8 25.0 0.1 26.9 0.2 28.9 0.3\n 24SEP2003 20.5 0.0 25.0 0.2 27.1 0.4 29.1 0.5\n 01OCT2003 20.1-0.5 25.3 0.4 27.3 0.6 29.1 0.4\n 08OCT2003 20.9 0.2 25.5 0.6 27.4 0.7 29.1 0.5\n 15OCT2003 20.9 0.1 25.2 0.3 27.1 0.4 29.1 0.5\n 22OCT2003 21.5 0.6 25.3 0.3 27.1 0.4 29.3 0.6\n 29OCT2003 21.4 0.3 25.4 0.4 27.2 0.5 29.3 0.7\n 05NOV2003 21.6 0.3 25.3 0.4 27.0 0.4 29.4 0.7\n 12NOV2003 21.8 0.3 25.3 0.4 26.9 0.3 29.3 0.7\n 19NOV2003 22.0 0.3 25.4 0.4 27.1 0.4 29.3 0.7\n 26NOV2003 22.3 0.3 25.5 0.5 27.2 0.5 29.2 0.6\n 03DEC2003 22.5 0.2 25.6 0.5 27.1 0.5 29.2 0.6\n 10DEC2003 22.9 0.3 25.5 0.4 27.0 0.4 29.1 0.6\n 17DEC2003 23.0 0.1 25.4 0.3 26.8 0.3 29.0 0.5\n 24DEC2003 23.0-0.2 25.6 0.3 26.8 0.2 28.9 0.4\n 31DEC2003 23.8 0.2 25.7 0.4 26.7 0.1 28.7 0.4\n 07JAN2004 24.2 0.2 25.7 0.2 26.6 0.0 28.7 0.3\n 14JAN2004 24.6 0.2 25.9 0.3 26.6 0.0 28.9 0.6\n 21JAN2004 24.8 0.0 26.0 0.3 27.0 0.4 28.9 0.7\n 28JAN2004 24.7-0.4 26.1 0.1 26.9 0.2 28.8 0.6\n 04FEB2004 25.0-0.5 26.0-0.1 26.8 0.1 28.7 0.6\n 11FEB2004 25.4-0.5 26.4 0.1 26.8 0.1 28.5 0.4\n 18FEB2004 26.1 0.0 26.7 0.2 26.9 0.1 28.5 0.4\n 25FEB2004 26.3 0.1 26.7 0.1 27.0 0.1 28.5 0.4\n 03MAR2004 25.8-0.6 26.7-0.1 26.9-0.1 28.5 0.4\n 10MAR2004 25.4-1.0 27.1 0.1 26.9-0.2 28.3 0.1\n 17MAR2004 25.6-0.8 27.4 0.2 27.1-0.1 28.3 0.1\n 24MAR2004 26.0-0.3 27.4 0.1 27.3-0.1 28.4 0.2\n 31MAR2004 26.1 0.1 27.4 0.1 27.5 0.0 28.5 0.2\n 07APR2004 26.0 0.2 27.4 0.0 27.7 0.1 28.6 0.2\n 14APR2004 25.2-0.3 27.4 0.0 27.8 0.1 28.7 0.2\n 21APR2004 24.8-0.4 27.4 0.0 28.0 0.2 28.8 0.3\n 28APR2004 24.1-0.9 27.2-0.1 28.1 0.3 28.9 0.3\n 05MAY2004 23.6-1.0 26.7-0.5 27.9 0.1 29.0 0.3\n 12MAY2004 23.1-1.3 26.6-0.6 28.0 0.1 29.0 0.3\n 19MAY2004 22.8-1.3 26.8-0.3 28.2 0.4 29.2 0.4\n 26MAY2004 22.7-1.0 26.7-0.2 28.1 0.3 29.4 0.6\n 02JUN2004 22.1-1.4 26.7 0.0 28.1 0.3 29.2 0.4\n 09JUN2004 21.7-1.4 26.6 0.0 28.0 0.3 29.2 0.4\n 16JUN2004 21.5-1.3 26.4-0.1 27.8 0.1 29.2 0.4\n 23JUN2004 21.3-1.2 26.0-0.3 27.5 0.0 29.1 0.2\n 30JUN2004 21.0-1.2 25.6-0.4 27.3-0.1 29.1 0.3\n 07JUL2004 20.8-1.2 25.4-0.4 27.6 0.3 29.4 0.6\n 14JUL2004 20.9-0.8 25.5-0.2 27.7 0.4 29.4 0.6\n 21JUL2004 20.7-0.7 25.2-0.3 27.7 0.6 29.4 0.7\n 28JUL2004 20.3-0.9 25.4 0.0 27.9 0.8 29.4 0.6\n 04AUG2004 19.9-1.1 25.2 0.0 27.8 0.8 29.4 0.7\n 11AUG2004 19.7-1.1 25.1 0.0 27.6 0.7 29.2 0.6\n 18AUG2004 19.6-1.0 24.9 0.0 27.4 0.6 29.2 0.5\n 25AUG2004 19.2-1.4 24.9 0.0 27.4 0.7 29.3 0.7\n 01SEP2004 20.1-0.4 25.0 0.1 27.4 0.7 29.6 0.9\n 08SEP2004 19.8-0.6 25.0 0.1 27.4 0.6 29.6 0.9\n 15SEP2004 19.8-0.5 25.1 0.3 27.5 0.7 29.6 0.9\n 22SEP2004 20.4-0.1 25.3 0.4 27.6 0.9 29.6 0.9\n 29SEP2004 20.5-0.1 25.4 0.5 27.5 0.8 29.5 0.8\n 06OCT2004 20.8 0.1 25.2 0.4 27.4 0.7 29.5 0.8\n 13OCT2004 20.5-0.2 25.2 0.3 27.3 0.6 29.4 0.8\n 20OCT2004 21.4 0.5 25.4 0.5 27.4 0.7 29.6 1.0\n 27OCT2004 21.3 0.2 25.4 0.5 27.4 0.7 29.7 1.0\n 03NOV2004 21.5 0.3 25.4 0.5 27.3 0.6 29.6 1.0\n 10NOV2004 22.0 0.5 25.5 0.5 27.3 0.6 29.5 0.9\n 17NOV2004 22.2 0.5 25.5 0.5 27.3 0.7 29.6 1.0\n 24NOV2004 21.9 0.0 25.4 0.4 27.3 0.7 29.5 1.0\n 01DEC2004 22.4 0.2 25.6 0.6 27.4 0.8 29.4 0.9\n 08DEC2004 22.3-0.2 25.7 0.6 27.4 0.8 29.4 0.8\n 15DEC2004 22.9 0.2 25.8 0.6 27.3 0.7 29.2 0.8\n 22DEC2004 22.9-0.2 25.9 0.6 27.3 0.7 29.5 1.1\n 29DEC2004 23.6 0.2 25.8 0.5 27.2 0.6 29.5 1.1\n 05JAN2005 23.7-0.2 25.7 0.3 27.1 0.5 29.3 0.9\n 12JAN2005 24.2 0.0 25.9 0.3 27.1 0.5 29.2 0.9\n 19JAN2005 25.0 0.3 26.0 0.3 27.1 0.5 29.2 0.9\n 26JAN2005 24.9-0.1 26.0 0.1 27.1 0.5 29.2 1.0\n 02FEB2005 24.6-0.8 25.9-0.2 26.9 0.2 29.0 0.8\n 09FEB2005 25.1-0.6 26.2-0.1 27.0 0.3 28.8 0.7\n 16FEB2005 25.8-0.3 26.4 0.0 27.0 0.3 28.8 0.7\n 23FEB2005 25.7-0.5 26.3-0.3 27.0 0.1 28.7 0.6\n 02MAR2005 25.2-1.1 26.2-0.6 27.0 0.0 28.8 0.6\n 09MAR2005 25.9-0.5 26.7-0.2 27.2 0.1 28.8 0.6\n 16MAR2005 25.9-0.6 27.3 0.2 27.6 0.4 29.0 0.8\n 23MAR2005 25.0-1.3 27.3 0.0 27.9 0.5 28.9 0.7\n 30MAR2005 24.9-1.1 27.4 0.1 28.0 0.5 29.0 0.7\n 06APR2005 24.8-1.0 27.4 0.0 28.0 0.4 28.9 0.5\n 13APR2005 24.6-0.9 27.7 0.2 27.9 0.1 28.8 0.3\n 20APR2005 24.8-0.5 27.9 0.5 28.2 0.4 28.9 0.4\n 27APR2005 25.4 0.4 28.1 0.8 28.3 0.5 29.1 0.5\n 04MAY2005 25.2 0.5 28.1 0.9 28.3 0.4 29.1 0.4\n 11MAY2005 24.6 0.2 27.6 0.5 28.2 0.4 29.1 0.3\n 18MAY2005 24.5 0.4 27.4 0.3 28.2 0.4 29.3 0.5\n 25MAY2005 23.5-0.3 27.1 0.2 28.2 0.4 29.2 0.4\n 01JUN2005 23.0-0.5 26.8 0.0 28.1 0.3 29.2 0.4\n 08JUN2005 22.6-0.5 26.9 0.3 28.1 0.4 29.2 0.4\n 15JUN2005 22.3-0.5 26.8 0.3 28.1 0.4 29.2 0.4\n 22JUN2005 22.2-0.3 26.9 0.6 28.0 0.5 29.1 0.3\n 29JUN2005 21.6-0.7 26.7 0.6 28.0 0.5 29.1 0.3\n 06JUL2005 21.5-0.5 26.3 0.4 27.8 0.4 29.2 0.4\n 13JUL2005 21.5-0.3 26.2 0.5 27.6 0.3 29.1 0.3\n 20JUL2005 20.7-0.8 25.8 0.2 27.3 0.2 29.0 0.2\n 27JUL2005 20.8-0.5 25.4 0.0 27.1 0.1 28.9 0.1\n 03AUG2005 20.8-0.2 25.2-0.1 26.9-0.1 28.8 0.1\n 10AUG2005 20.6-0.2 25.2 0.1 26.9 0.0 28.7 0.0\n 17AUG2005 20.4-0.2 25.4 0.4 27.0 0.2 28.9 0.2\n 24AUG2005 20.8 0.3 25.2 0.3 26.9 0.1 28.9 0.3\n 31AUG2005 20.4-0.1 24.8-0.1 26.7-0.1 28.9 0.2\n 07SEP2005 20.0-0.5 24.5-0.3 26.5-0.3 28.7 0.1\n 14SEP2005 19.7-0.7 24.5-0.4 26.4-0.3 28.7 0.0\n 21SEP2005 19.6-0.9 24.7-0.2 26.8 0.1 28.9 0.3\n 28SEP2005 19.6-0.9 24.5-0.4 26.7 0.0 28.9 0.3\n 05OCT2005 19.4-1.2 24.6-0.3 26.9 0.2 29.0 0.3\n 12OCT2005 20.0-0.8 24.9 0.0 26.9 0.2 28.9 0.3\n 19OCT2005 19.8-1.1 24.7-0.2 26.7 0.0 28.8 0.2\n 26OCT2005 19.9-1.2 24.7-0.2 26.6-0.1 28.8 0.1\n 02NOV2005 19.8-1.4 24.3-0.7 26.5-0.2 28.7 0.1\n 09NOV2005 20.2-1.2 24.2-0.7 26.3-0.4 28.6 0.0\n 16NOV2005 21.0-0.6 24.3-0.7 26.5-0.2 28.6 0.0\n 23NOV2005 21.2-0.7 24.3-0.7 26.3-0.3 28.7 0.1\n 30NOV2005 21.2-0.9 24.2-0.9 26.1-0.5 28.6 0.1\n 07DEC2005 21.4-1.1 24.1-1.0 26.0-0.6 28.6 0.0\n 14DEC2005 21.8-0.9 24.0-1.1 25.8-0.7 28.5 0.0\n 21DEC2005 23.1 0.1 24.3-0.9 25.8-0.8 28.1-0.3\n 28DEC2005 23.3-0.2 24.7-0.6 25.9-0.7 28.0-0.4\n 04JAN2006 23.4-0.4 25.0-0.5 25.8-0.7 27.9-0.5\n 11JAN2006 24.2 0.0 25.0-0.6 25.7-0.9 27.8-0.5\n 18JAN2006 24.3-0.2 24.8-0.9 25.5-1.1 27.6-0.7\n 25JAN2006 24.8-0.1 25.1-0.8 25.5-1.1 27.4-0.8\n 01FEB2006 25.0-0.3 25.5-0.6 25.8-0.9 27.4-0.7\n 08FEB2006 25.9 0.2 25.8-0.4 26.0-0.7 27.3-0.9\n 15FEB2006 27.1 1.0 26.3 0.0 26.1-0.6 27.3-0.8\n 22FEB2006 26.8 0.6 26.4-0.2 26.3-0.5 27.4-0.7\n 01MAR2006 27.0 0.7 26.2-0.6 26.1-0.9 27.4-0.7\n 08MAR2006 26.9 0.5 26.5-0.4 26.4-0.7 27.6-0.6\n 15MAR2006 26.7 0.2 26.5-0.6 26.5-0.7 27.7-0.5\n 22MAR2006 26.6 0.3 26.6-0.6 26.7-0.6 28.0-0.3\n 29MAR2006 26.0-0.1 26.8-0.5 27.0-0.5 28.1-0.2\n 05APR2006 24.9-0.9 27.1-0.3 27.3-0.3 28.1-0.2\n 12APR2006 24.0-1.5 27.6 0.1 27.7 0.0 28.3-0.1\n 19APR2006 23.4-2.0 27.2-0.2 27.7-0.1 28.4-0.1\n 26APR2006 23.1-1.9 27.2-0.2 27.7-0.1 28.5 0.0\n 03MAY2006 23.9-0.8 27.2-0.1 27.7-0.1 28.6-0.1\n 10MAY2006 24.1-0.4 27.1 0.0 27.8 0.0 28.8 0.1\n 17MAY2006 23.8-0.3 27.1 0.0 28.1 0.2 29.1 0.3\n 24MAY2006 23.5-0.3 26.9 0.0 28.0 0.2 29.0 0.2\n 31MAY2006 23.4-0.1 26.8 0.0 28.0 0.3 29.2 0.4\n 07JUN2006 22.6-0.6 26.6 0.0 28.0 0.3 29.2 0.4\n 14JUN2006 22.8-0.1 26.5 0.1 27.9 0.3 29.2 0.3\n 21JUN2006 22.5-0.1 26.3 0.0 27.8 0.2 29.2 0.3\n 28JUN2006 22.4 0.0 26.1 0.0 27.6 0.1 29.0 0.2\n 05JUL2006 22.2 0.1 26.0 0.1 27.5 0.1 29.0 0.1\n 12JUL2006 22.0 0.2 25.8 0.0 27.3 0.0 29.0 0.2\n 19JUL2006 22.3 0.8 25.8 0.2 27.3 0.1 29.1 0.3\n 26JUL2006 22.0 0.7 25.7 0.3 27.3 0.2 29.2 0.4\n 02AUG2006 21.9 0.8 25.5 0.3 27.2 0.2 29.2 0.5\n 09AUG2006 21.7 0.8 25.3 0.2 27.1 0.2 29.1 0.4\n 16AUG2006 21.6 0.9 25.4 0.4 27.2 0.4 29.2 0.6\n 23AUG2006 21.5 1.0 25.5 0.5 27.3 0.5 29.3 0.6\n 30AUG2006 21.1 0.6 25.6 0.6 27.3 0.5 29.3 0.7\n 06SEP2006 21.6 1.2 25.6 0.7 27.4 0.6 29.4 0.8\n 13SEP2006 21.3 0.9 25.8 0.9 27.3 0.6 29.4 0.7\n 20SEP2006 21.2 0.8 25.9 1.1 27.4 0.7 29.4 0.8\n 27SEP2006 21.7 1.1 25.7 0.8 27.2 0.5 29.3 0.7\n 04OCT2006 21.7 1.0 25.7 0.8 27.2 0.5 29.2 0.6\n 11OCT2006 22.2 1.4 26.1 1.2 27.5 0.8 29.4 0.8\n 18OCT2006 22.4 1.5 26.0 1.1 27.5 0.8 29.5 0.8\n 25OCT2006 22.7 1.6 26.1 1.1 27.6 0.9 29.6 1.0\n 01NOV2006 22.4 1.2 25.9 1.0 27.6 0.9 29.5 0.9\n 08NOV2006 22.5 1.1 25.9 0.9 27.6 0.9 29.6 1.0\n 15NOV2006 22.6 1.0 26.1 1.1 27.8 1.2 29.7 1.1\n 22NOV2006 22.7 0.8 26.3 1.2 27.8 1.2 29.6 1.1\n 29NOV2006 23.0 0.9 26.1 1.1 27.8 1.2 29.6 1.0\n 06DEC2006 22.9 0.5 26.1 1.1 27.9 1.3 29.6 1.1\n 13DEC2006 22.9 0.2 26.3 1.2 27.8 1.2 29.5 1.0\n 20DEC2006 23.7 0.6 26.5 1.3 27.7 1.2 29.4 1.0\n 27DEC2006 24.0 0.6 26.6 1.3 27.7 1.1 29.4 1.0\n 03JAN2007 24.3 0.5 26.4 0.9 27.5 0.9 29.2 0.8\n 10JAN2007 24.9 0.7 26.7 1.1 27.5 0.9 29.1 0.8\n 17JAN2007 25.0 0.4 26.4 0.7 27.2 0.6 28.8 0.6\n 24JAN2007 25.2 0.3 26.5 0.7 27.1 0.5 28.7 0.5\n 31JAN2007 25.6 0.3 26.6 0.6 27.0 0.3 28.7 0.5\n 07FEB2007 26.0 0.4 26.6 0.4 26.9 0.2 28.6 0.4\n 14FEB2007 26.3 0.3 26.3-0.1 26.7 0.0 28.6 0.6\n 21FEB2007 26.4 0.3 26.4-0.1 26.8-0.1 28.6 0.5\n 28FEB2007 25.7-0.6 26.4-0.3 26.9 0.0 28.5 0.4\n 07MAR2007 25.8-0.5 26.6-0.3 26.9-0.2 28.5 0.4\n 14MAR2007 26.0-0.5 27.3 0.2 27.3 0.1 28.6 0.4\n 21MAR2007 25.6-0.8 26.8-0.4 27.2-0.1 28.5 0.3\n 28MAR2007 25.1-1.0 26.6-0.7 27.4 0.0 28.5 0.2\n 04APR2007 24.5-1.4 26.7-0.7 27.5 0.0 28.7 0.3\n 11APR2007 24.4-1.2 27.2-0.2 27.8 0.1 28.7 0.3\n 18APR2007 23.9-1.4 27.4-0.1 27.9 0.2 28.7 0.2\n 25APR2007 24.1-1.0 27.3-0.1 27.8 0.0 28.7 0.1\n 02MAY2007 23.6-1.2 26.9-0.4 27.7-0.1 28.6 0.0\n 09MAY2007 23.0-1.5 26.3-0.9 27.4-0.4 28.7 0.0\n 16MAY2007 22.9-1.3 26.3-0.8 27.5-0.4 28.8 0.1\n 23MAY2007 22.3-1.6 26.3-0.6 27.7-0.1 29.0 0.2\n 30MAY2007 21.8-1.8 26.1-0.7 27.6-0.2 29.0 0.2\n 06JUN2007 21.6-1.6 25.8-0.9 27.6-0.1 29.0 0.2\n 13JUN2007 22.2-0.7 26.1-0.4 27.7 0.1 29.1 0.3\n 20JUN2007 21.8-0.8 25.9-0.5 27.6 0.0 28.9 0.1\n 27JUN2007 20.7-1.7 25.5-0.6 27.3-0.1 28.8 0.0\n 04JUL2007 21.2-0.9 25.3-0.6 27.0-0.4 28.7-0.1\n 11JUL2007 20.1-1.7 24.9-0.9 26.8-0.5 28.8 0.0\n 18JUL2007 19.9-1.7 24.8-0.8 26.9-0.3 28.9 0.1\n 25JUL2007 20.3-1.0 24.5-1.0 26.6-0.5 28.9 0.1\n 01AUG2007 19.6-1.5 24.1-1.2 26.4-0.6 28.7 0.0\n 08AUG2007 19.3-1.6 23.8-1.3 26.2-0.7 28.6-0.1\n 15AUG2007 19.7-1.0 24.0-1.0 26.3-0.6 28.6-0.1\n 22AUG2007 19.2-1.4 23.8-1.2 26.1-0.7 28.5-0.1\n 29AUG2007 18.4-2.1 23.7-1.3 26.1-0.7 28.4-0.2\n 05SEP2007 19.4-1.1 23.7-1.2 26.0-0.8 28.3-0.4\n 12SEP2007 18.6-1.8 23.6-1.3 25.8-1.0 28.0-0.6\n 19SEP2007 18.5-2.0 23.6-1.2 25.8-0.9 28.0-0.7\n 26SEP2007 18.4-2.1 23.2-1.7 25.6-1.1 28.0-0.7\n 03OCT2007 18.3-2.3 23.2-1.7 25.4-1.3 27.9-0.7\n 10OCT2007 18.8-1.9 23.3-1.6 24.9-1.8 27.7-1.0\n 17OCT2007 18.6-2.2 23.5-1.4 25.3-1.4 27.9-0.7\n 24OCT2007 19.2-1.8 23.5-1.4 25.3-1.4 27.8-0.8\n 31OCT2007 19.7-1.5 23.2-1.8 25.2-1.5 27.8-0.8\n 07NOV2007 19.3-2.1 23.0-2.0 25.0-1.6 27.5-1.1\n 14NOV2007 19.2-2.3 23.2-1.7 25.2-1.5 27.3-1.3\n 21NOV2007 19.8-2.0 23.2-1.8 24.9-1.7 27.1-1.5\n 28NOV2007 19.8-2.2 23.3-1.8 25.1-1.6 27.4-1.1\n 05DEC2007 20.6-1.8 23.5-1.5 25.1-1.5 27.5-1.0\n 12DEC2007 20.3-2.4 23.3-1.8 24.9-1.7 27.5-1.0\n 19DEC2007 21.3-1.6 23.7-1.5 25.0-1.6 27.2-1.3\n 26DEC2007 21.9-1.4 23.7-1.6 24.9-1.6 27.0-1.4\n 02JAN2008 22.6-1.1 23.9-1.5 25.0-1.6 26.8-1.6\n 09JAN2008 23.3-0.8 24.0-1.5 24.8-1.8 26.6-1.7\n 16JAN2008 24.1-0.4 24.0-1.6 24.6-2.0 26.6-1.7\n 23JAN2008 24.1-0.7 24.1-1.7 24.4-2.2 26.4-1.8\n 30JAN2008 25.1-0.1 24.7-1.3 24.9-1.7 26.5-1.7\n 06FEB2008 25.9 0.3 24.8-1.4 24.6-2.1 26.4-1.8\n 13FEB2008 25.9-0.1 24.7-1.7 24.5-2.2 26.4-1.7\n 20FEB2008 26.7 0.6 25.1-1.4 24.9-2.0 26.4-1.7\n 27FEB2008 27.2 0.9 25.8-0.9 25.3-1.6 26.3-1.8\n 05MAR2008 27.3 1.0 26.3-0.6 25.7-1.3 26.6-1.5\n 12MAR2008 27.2 0.7 26.5-0.5 26.0-1.1 26.7-1.4\n 19MAR2008 27.3 0.9 26.7-0.5 26.2-1.1 26.8-1.4\n 26MAR2008 27.1 0.9 26.8-0.5 26.3-1.0 27.0-1.2\n 02APR2008 27.2 1.2 26.9-0.4 26.5-1.0 27.2-1.2\n 09APR2008 25.9 0.2 27.3-0.2 26.7-1.0 27.3-1.1\n 16APR2008 25.5 0.0 27.3-0.2 26.9-0.9 27.4-1.1\n 23APR2008 25.5 0.4 27.1-0.3 26.9-0.9 27.5-1.1\n 30APR2008 24.5-0.3 27.3 0.0 27.1-0.7 27.7-0.9\n 07MAY2008 24.1-0.5 26.8-0.4 27.0-0.9 27.7-1.0\n 14MAY2008 24.5 0.2 27.1-0.1 27.1-0.7 27.8-0.9\n 21MAY2008 24.1 0.1 27.2 0.2 27.3-0.5 28.0-0.7\n 28MAY2008 24.1 0.5 27.2 0.4 27.3-0.5 28.0-0.8\n 04JUN2008 24.0 0.7 27.0 0.3 27.3-0.4 28.0-0.8\n 11JUN2008 23.7 0.7 26.7 0.2 27.2-0.5 28.0-0.8\n 18JUN2008 23.3 0.6 26.3-0.1 27.1-0.5 28.1-0.8\n 25JUN2008 23.0 0.6 26.2 0.0 27.1-0.4 28.1-0.7\n 02JUL2008 22.7 0.5 26.3 0.4 27.2-0.2 28.2-0.6\n 09JUL2008 22.7 0.8 26.3 0.5 27.3-0.1 28.3-0.5\n 16JUL2008 22.7 1.1 26.2 0.5 27.3 0.0 28.3-0.5\n 23JUL2008 22.6 1.2 25.9 0.5 27.1 0.0 28.2-0.6\n 30JUL2008 22.2 1.1 25.9 0.5 27.1 0.0 28.2-0.5\n 06AUG2008 22.0 1.1 25.9 0.7 27.0 0.1 28.2-0.5\n 13AUG2008 22.5 1.8 25.8 0.8 27.0 0.2 28.2-0.5\n 20AUG2008 21.1 0.5 25.5 0.5 26.7-0.1 28.1-0.6\n 27AUG2008 21.3 0.8 25.3 0.4 26.6-0.2 28.1-0.6\n 03SEP2008 21.3 0.8 25.3 0.4 26.6-0.2 28.1-0.6\n 10SEP2008 21.0 0.6 25.2 0.3 26.6-0.2 28.1-0.6\n 17SEP2008 21.1 0.8 24.9 0.1 26.4-0.4 28.1-0.6\n 24SEP2008 21.3 0.8 25.1 0.2 26.4-0.4 28.1-0.6\n 01OCT2008 21.0 0.4 24.7-0.2 26.2-0.5 28.3-0.4\n 08OCT2008 20.6-0.1 24.9 0.0 26.3-0.4 28.3-0.4\n 15OCT2008 20.7-0.1 24.9-0.1 26.4-0.3 28.3-0.4\n 22OCT2008 21.0 0.0 24.8-0.2 26.3-0.4 28.2-0.4\n 29OCT2008 20.5-0.7 24.6-0.3 26.4-0.2 28.2-0.4\n 05NOV2008 21.3 0.0 24.6-0.3 26.3-0.3 28.2-0.4\n 12NOV2008 21.8 0.3 24.9-0.1 26.5-0.2 28.1-0.5\n 19NOV2008 21.5-0.2 24.9-0.1 26.3-0.3 28.0-0.6\n 26NOV2008 21.2-0.8 24.6-0.4 26.1-0.5 27.9-0.6\n 03DEC2008 21.4-0.9 24.8-0.3 26.0-0.6 27.9-0.6\n 10DEC2008 22.1-0.4 24.6-0.5 25.8-0.8 27.7-0.7\n 17DEC2008 22.6-0.3 24.6-0.6 25.8-0.8 27.7-0.8\n 24DEC2008 22.8-0.5 24.5-0.8 25.6-1.0 27.5-0.9\n 31DEC2008 23.3-0.3 24.4-1.0 25.4-1.2 27.5-0.9\n 07JAN2009 23.4-0.6 24.5-0.9 25.4-1.2 27.4-1.0\n 14JAN2009 24.0-0.3 24.8-0.8 25.4-1.1 27.4-0.9\n 21JAN2009 25.3 0.5 25.5-0.2 25.8-0.8 27.4-0.8\n 28JAN2009 25.3 0.2 25.5-0.4 25.7-1.0 27.3-0.9\n 04FEB2009 25.1-0.4 25.4-0.7 25.7-0.9 27.2-0.9\n 11FEB2009 25.8 0.0 25.6-0.6 25.9-0.8 27.3-0.8\n 18FEB2009 26.3 0.2 26.1-0.4 26.2-0.6 27.4-0.7\n 25FEB2009 26.5 0.2 26.4-0.3 26.3-0.6 27.4-0.7\n 04MAR2009 26.5 0.2 26.1-0.7 26.4-0.7 27.5-0.6\n 11MAR2009 26.1-0.3 26.1-0.9 26.7-0.5 27.7-0.4\n 18MAR2009 26.0-0.4 26.4-0.7 26.7-0.6 27.8-0.4\n 25MAR2009 26.3 0.1 26.7-0.5 26.8-0.6 27.9-0.4\n 01APR2009 26.4 0.5 27.2-0.1 27.1-0.4 28.1-0.2\n 08APR2009 25.7 0.0 27.4 0.0 27.4-0.2 28.3-0.1\n 15APR2009 26.1 0.7 27.5 0.0 27.5-0.2 28.3-0.2\n 22APR2009 25.4 0.2 27.3-0.1 27.6-0.2 28.4-0.2\n 29APR2009 25.3 0.4 27.5 0.2 27.7-0.1 28.6 0.0\n 06MAY2009 25.3 0.7 27.6 0.4 27.9 0.1 28.8 0.1\n 13MAY2009 24.8 0.5 27.4 0.3 28.0 0.2 29.0 0.2\n 20MAY2009 24.4 0.4 27.4 0.4 28.2 0.4 29.1 0.3\n 27MAY2009 24.3 0.6 27.2 0.4 28.1 0.3 29.1 0.3\n 03JUN2009 23.7 0.4 27.1 0.4 27.9 0.2 29.0 0.2\n 10JUN2009 23.7 0.6 27.2 0.6 28.1 0.4 29.1 0.3\n 17JUN2009 23.9 1.1 27.2 0.8 28.2 0.5 29.2 0.4\n 24JUN2009 23.5 1.0 27.1 0.9 28.2 0.7 29.3 0.5\n 01JUL2009 22.9 0.7 26.9 0.9 28.2 0.7 29.3 0.5\n 08JUL2009 23.0 1.1 26.7 0.9 28.0 0.7 29.2 0.4\n 15JUL2009 22.7 1.0 26.6 1.0 28.0 0.7 29.2 0.4\n 22JUL2009 22.2 0.8 26.5 1.0 27.9 0.8 29.2 0.4\n 29JUL2009 22.1 0.9 26.2 0.8 27.7 0.6 29.1 0.4\n 05AUG2009 22.2 1.2 26.0 0.8 27.6 0.6 29.1 0.4\n 12AUG2009 21.4 0.6 25.9 0.8 27.4 0.6 29.1 0.4\n 19AUG2009 21.6 0.9 25.8 0.9 27.4 0.6 29.2 0.6\n 26AUG2009 21.5 1.0 25.9 1.0 27.6 0.8 29.3 0.7\n 02SEP2009 21.4 0.9 25.9 1.0 27.6 0.8 29.3 0.6\n 09SEP2009 21.1 0.6 25.7 0.8 27.5 0.8 29.3 0.6\n 16SEP2009 20.8 0.4 25.6 0.8 27.5 0.8 29.3 0.6\n 23SEP2009 20.5 0.0 25.6 0.7 27.4 0.7 29.2 0.6\n 30SEP2009 20.4-0.2 25.4 0.6 27.3 0.6 29.2 0.6\n 07OCT2009 20.1-0.5 25.5 0.6 27.3 0.6 29.4 0.7\n 14OCT2009 21.0 0.2 25.6 0.7 27.5 0.8 29.6 1.0\n 21OCT2009 21.2 0.3 25.8 0.8 27.7 1.0 29.8 1.2\n 28OCT2009 21.6 0.5 26.1 1.2 28.1 1.4 30.0 1.3\n 04NOV2009 21.8 0.5 26.2 1.3 28.2 1.6 29.9 1.3\n 11NOV2009 22.1 0.6 26.2 1.2 28.2 1.5 29.9 1.3\n 18NOV2009 22.2 0.5 26.2 1.2 28.2 1.6 29.8 1.2\n 25NOV2009 22.2 0.3 26.3 1.2 28.2 1.6 29.9 1.3\n 02DEC2009 22.7 0.4 26.5 1.4 28.2 1.6 29.7 1.2\n 09DEC2009 22.7 0.2 26.6 1.5 28.2 1.7 29.6 1.1\n 16DEC2009 22.6-0.2 26.7 1.5 28.3 1.8 29.7 1.2\n 23DEC2009 23.7 0.5 26.8 1.5 28.4 1.9 29.7 1.3\n 30DEC2009 24.3 0.7 26.7 1.4 28.3 1.7 29.6 1.2\n 06JAN2010 24.3 0.4 26.7 1.2 28.3 1.7 29.7 1.3\n 13JAN2010 24.6 0.3 26.7 1.1 28.2 1.6 29.6 1.3\n 20JAN2010 24.7 0.1 26.5 0.8 28.0 1.4 29.5 1.2\n 27JAN2010 25.5 0.4 26.6 0.7 27.8 1.2 29.3 1.1\n 03FEB2010 25.4 0.0 26.7 0.6 27.8 1.2 29.1 1.0\n 10FEB2010 25.7-0.2 27.0 0.7 27.9 1.2 29.0 0.9\n 17FEB2010 26.4 0.3 27.2 0.8 27.9 1.2 29.0 1.0\n 24FEB2010 26.5 0.3 27.4 0.8 28.0 1.1 29.2 1.1\n 03MAR2010 26.3-0.1 27.5 0.7 28.1 1.1 29.2 1.0\n 10MAR2010 26.0-0.4 27.5 0.5 28.3 1.2 29.3 1.1\n 17MAR2010 26.2-0.3 27.8 0.7 28.4 1.1 29.2 1.1\n 24MAR2010 26.3 0.0 27.9 0.7 28.4 1.0 29.2 0.9\n 31MAR2010 25.9-0.1 28.1 0.8 28.4 0.9 29.2 0.8\n 07APR2010 26.0 0.3 28.1 0.7 28.4 0.8 29.3 0.9\n 14APR2010 26.6 1.0 28.2 0.8 28.5 0.7 29.2 0.7\n 21APR2010 26.0 0.8 28.0 0.6 28.4 0.6 29.2 0.7\n 28APR2010 25.2 0.3 27.8 0.4 28.2 0.4 29.3 0.7\n 05MAY2010 24.8 0.2 27.7 0.5 28.0 0.2 29.1 0.4\n 12MAY2010 24.8 0.5 27.1 0.0 27.7-0.2 29.0 0.3\n 19MAY2010 24.0 0.0 26.8-0.3 27.5-0.3 29.0 0.2\n 26MAY2010 23.2-0.5 26.4-0.4 27.5-0.3 29.0 0.2\n 02JUN2010 23.4 0.0 26.1-0.6 27.3-0.5 28.8 0.0\n 09JUN2010 23.1 0.0 26.0-0.6 27.1-0.6 28.7-0.1\n 16JUN2010 22.3-0.5 25.8-0.6 27.0-0.7 28.6-0.2\n 23JUN2010 22.4-0.2 25.5-0.8 26.9-0.7 28.5-0.3\n 30JUN2010 21.6-0.7 25.3-0.8 26.7-0.8 28.3-0.5\n 07JUL2010 20.9-1.1 24.8-1.0 26.4-0.9 28.2-0.6\n 14JUL2010 20.0-1.6 24.6-1.1 26.1-1.1 28.2-0.6\n 21JUL2010 19.6-1.9 24.4-1.1 26.0-1.2 28.0-0.8\n 28JUL2010 19.5-1.7 24.0-1.4 25.6-1.4 27.8-1.0\n 04AUG2010 19.5-1.5 24.0-1.3 25.8-1.2 27.7-1.0\n 11AUG2010 19.6-1.2 24.1-1.0 25.7-1.2 27.5-1.2\n 18AUG2010 19.2-1.4 23.8-1.1 25.6-1.2 27.5-1.1\n 25AUG2010 19.2-1.4 23.7-1.3 25.2-1.6 27.1-1.5\n 01SEP2010 18.8-1.7 23.4-1.5 25.1-1.7 27.2-1.5\n 08SEP2010 19.1-1.3 23.5-1.4 25.2-1.6 27.1-1.6\n 15SEP2010 18.6-1.8 23.4-1.5 25.1-1.6 27.1-1.6\n 22SEP2010 19.3-1.2 24.0-0.8 25.1-1.6 27.1-1.6\n 29SEP2010 19.2-1.4 23.5-1.3 24.8-1.9 27.1-1.6\n 06OCT2010 18.7-1.9 23.2-1.7 24.8-1.9 27.1-1.6\n 13OCT2010 18.9-1.9 23.0-2.0 25.1-1.6 27.1-1.6\n 20OCT2010 19.1-1.8 23.2-1.7 25.1-1.6 27.0-1.7\n 27OCT2010 19.8-1.3 23.6-1.4 25.2-1.5 27.0-1.6\n 03NOV2010 19.7-1.6 23.4-1.6 25.2-1.4 27.0-1.6\n 10NOV2010 19.5-1.9 23.5-1.5 25.2-1.4 27.2-1.5\n 17NOV2010 20.2-1.5 23.5-1.5 25.0-1.6 27.1-1.5\n 24NOV2010 20.6-1.3 23.3-1.7 24.9-1.7 26.9-1.7\n 01DEC2010 20.5-1.7 23.3-1.7 25.0-1.7 27.0-1.5\n 08DEC2010 20.9-1.5 23.4-1.7 25.0-1.6 26.9-1.6\n 15DEC2010 21.1-1.7 23.5-1.7 25.0-1.5 26.9-1.6\n 22DEC2010 21.7-1.4 23.4-1.8 24.8-1.8 26.8-1.6\n 29DEC2010 22.9-0.6 23.8-1.5 25.0-1.5 26.7-1.7\n 05JAN2011 23.1-0.7 24.1-1.3 25.0-1.5 26.7-1.7\n 12JAN2011 23.6-0.7 24.1-1.5 24.7-1.8 26.6-1.7\n 19JAN2011 24.2-0.5 24.4-1.3 25.0-1.6 26.7-1.6\n 26JAN2011 25.0 0.0 24.5-1.4 24.9-1.7 26.8-1.4\n 02FEB2011 25.3-0.1 24.9-1.1 25.1-1.5 26.6-1.5\n 09FEB2011 25.9 0.2 25.5-0.8 25.5-1.2 26.8-1.3\n 16FEB2011 26.8 0.7 25.6-0.8 25.4-1.3 27.0-1.1\n 23FEB2011 26.4 0.2 25.9-0.7 25.6-1.3 27.0-1.1\n 02MAR2011 25.7-0.6 26.0-0.8 25.7-1.3 27.1-1.1\n 09MAR2011 26.3-0.2 26.2-0.8 26.0-1.1 27.3-0.9\n 16MAR2011 26.6 0.1 26.3-0.8 26.4-0.9 27.5-0.7\n 23MAR2011 25.8-0.5 26.6-0.6 26.4-0.9 27.5-0.7\n 30MAR2011 25.6-0.4 26.9-0.4 26.6-0.9 27.5-0.8\n 06APR2011 25.4-0.4 27.1-0.2 26.9-0.7 27.7-0.6\n 13APR2011 25.8 0.3 27.3-0.2 27.1-0.7 27.9-0.6\n 20APR2011 25.4 0.1 27.2-0.3 27.1-0.7 27.8-0.7\n 27APR2011 25.8 0.8 27.2-0.1 27.1-0.7 27.9-0.7\n 04MAY2011 25.1 0.4 27.0-0.3 27.2-0.6 28.0-0.7\n 11MAY2011 25.3 0.9 27.0-0.2 27.4-0.5 28.3-0.5\n 18MAY2011 24.6 0.5 27.0-0.1 27.6-0.3 28.4-0.4\n 25MAY2011 24.0 0.3 26.8 0.0 27.5-0.3 28.3-0.5\n 01JUN2011 24.3 0.8 26.8 0.1 27.5-0.2 28.4-0.4\n 08JUN2011 24.2 1.1 26.7 0.1 27.5-0.2 28.4-0.4\n 15JUN2011 23.8 1.0 26.6 0.1 27.4-0.2 28.4-0.4\n 22JUN2011 23.2 0.6 26.5 0.2 27.4-0.1 28.4-0.4\n 29JUN2011 22.9 0.6 26.1 0.1 27.4-0.1 28.6-0.2\n 06JUL2011 22.2 0.2 25.8-0.1 27.1-0.3 28.5-0.3\n 13JUL2011 21.9 0.2 25.7 0.0 27.1-0.2 28.5-0.3\n 20JUL2011 22.1 0.6 25.6 0.0 26.9-0.3 28.4-0.4\n 27JUL2011 21.9 0.7 25.3-0.1 26.8-0.3 28.4-0.4\n 03AUG2011 21.5 0.4 25.0-0.3 26.4-0.6 28.3-0.4\n 10AUG2011 20.9 0.0 24.6-0.5 26.3-0.6 28.4-0.3\n 17AUG2011 20.5-0.1 24.5-0.5 26.0-0.8 28.2-0.4\n 24AUG2011 20.2-0.4 24.3-0.6 26.1-0.7 28.3-0.4\n 31AUG2011 20.0-0.5 24.4-0.5 26.1-0.7 28.3-0.4\n 07SEP2011 19.7-0.7 24.2-0.7 26.1-0.7 28.2-0.5\n 14SEP2011 19.6-0.8 24.1-0.7 26.0-0.8 28.0-0.7\n 21SEP2011 19.8-0.6 24.3-0.6 25.9-0.9 27.8-0.9\n 28SEP2011 19.9-0.6 24.1-0.7 26.0-0.7 28.0-0.7\n 05OCT2011 19.8-0.8 24.1-0.8 25.7-1.0 27.7-0.9\n 12OCT2011 19.7-1.0 24.1-0.8 25.8-0.9 27.9-0.8\n 19OCT2011 20.0-0.9 23.9-1.1 25.8-0.8 28.1-0.6\n 26OCT2011 21.2 0.2 23.8-1.1 25.4-1.2 28.0-0.7\n 02NOV2011 20.5-0.8 23.9-1.1 25.6-1.0 27.9-0.8\n 09NOV2011 20.5-0.9 23.9-1.1 25.7-0.9 27.9-0.7\n 16NOV2011 20.5-1.1 23.8-1.1 25.6-1.0 27.9-0.7\n 23NOV2011 21.4-0.5 24.0-1.0 25.6-1.0 27.8-0.8\n 30NOV2011 21.0-1.2 23.8-1.3 25.4-1.2 27.7-0.9\n 07DEC2011 21.4-1.0 23.9-1.2 25.5-1.1 27.5-1.0\n 14DEC2011 21.5-1.2 24.1-1.0 25.6-1.0 27.4-1.1\n 21DEC2011 22.1-1.0 24.5-0.7 25.6-1.0 27.2-1.3\n 28DEC2011 22.6-0.9 24.4-0.9 25.5-1.1 27.1-1.3\n 04JAN2012 22.7-1.1 24.6-0.8 25.5-1.0 27.2-1.2\n 11JAN2012 23.7-0.5 24.8-0.7 25.6-1.0 27.1-1.2\n 18JAN2012 24.0-0.6 24.9-0.8 25.4-1.2 27.1-1.2\n 25JAN2012 24.6-0.4 25.2-0.7 25.5-1.2 26.9-1.3\n 01FEB2012 24.6-0.8 25.2-0.8 25.5-1.2 27.0-1.2\n 08FEB2012 25.2-0.5 25.6-0.6 25.7-1.0 27.1-1.0\n 15FEB2012 26.9 0.8 26.3-0.1 26.1-0.7 27.1-1.0\n 22FEB2012 26.9 0.8 26.8 0.2 26.5-0.4 27.4-0.7\n 29FEB2012 27.3 1.0 27.1 0.4 26.4-0.6 27.2-0.9\n 07MAR2012 26.6 0.2 26.7-0.2 26.4-0.7 27.3-0.9\n 14MAR2012 26.6 0.2 26.6-0.4 26.6-0.6 27.5-0.7\n 21MAR2012 26.7 0.4 27.0-0.2 26.7-0.6 27.8-0.5\n 28MAR2012 26.9 0.8 27.5 0.3 27.1-0.3 27.7-0.6\n 04APR2012 26.2 0.3 27.6 0.3 27.2-0.3 27.9-0.5\n 11APR2012 27.4 1.8 27.8 0.4 27.3-0.4 28.1-0.3\n 18APR2012 26.8 1.4 27.5 0.0 27.3-0.5 28.1-0.4\n 25APR2012 26.6 1.5 27.5 0.1 27.6-0.2 28.4-0.2\n 02MAY2012 26.3 1.6 27.4 0.1 27.7-0.1 28.4-0.2\n 09MAY2012 25.7 1.2 27.3 0.1 27.8 0.0 28.4-0.3\n 16MAY2012 25.2 1.0 27.2 0.1 27.8 0.0 28.5-0.3\n 23MAY2012 24.8 0.9 27.1 0.2 27.8 0.0 28.6-0.2\n 30MAY2012 24.5 0.9 27.2 0.4 27.9 0.2 28.7-0.1\n 06JUN2012 24.7 1.5 27.1 0.4 27.8 0.1 28.6-0.2\n 13JUN2012 24.4 1.5 27.1 0.6 27.9 0.3 28.6-0.2\n 20JUN2012 24.3 1.7 27.1 0.8 28.0 0.4 28.8 0.0\n 27JUN2012 23.8 1.5 27.1 0.9 28.1 0.6 28.9 0.0\n 04JUL2012 23.2 1.1 26.8 0.8 27.9 0.5 28.8 0.0\n 11JUL2012 22.6 0.8 26.6 0.8 27.7 0.4 28.8 0.0\n 18JUL2012 22.6 1.1 26.5 0.9 27.7 0.5 28.8 0.0\n 25JUL2012 22.0 0.7 26.4 1.0 27.7 0.6 28.9 0.1\n 01AUG2012 21.6 0.5 26.1 0.9 27.6 0.6 29.0 0.3\n 08AUG2012 20.9 0.0 25.9 0.8 27.7 0.8 29.1 0.4\n 15AUG2012 20.8 0.1 25.6 0.6 27.4 0.6 29.1 0.4\n 22AUG2012 21.0 0.4 25.5 0.5 27.4 0.6 29.1 0.4\n 29AUG2012 20.3-0.2 25.6 0.7 27.7 0.9 29.1 0.5\n 05SEP2012 20.7 0.3 25.5 0.6 27.5 0.8 29.2 0.5\n 12SEP2012 20.9 0.5 25.3 0.4 27.3 0.5 29.1 0.4\n 19SEP2012 21.0 0.5 25.2 0.3 27.0 0.3 29.0 0.4\n 26SEP2012 21.0 0.5 25.1 0.2 26.9 0.2 29.1 0.4\n 03OCT2012 20.5-0.1 24.8-0.1 26.8 0.1 29.0 0.3\n 10OCT2012 20.2-0.6 24.7-0.2 26.8 0.1 29.1 0.4\n 17OCT2012 20.5-0.4 25.0 0.1 27.0 0.3 29.1 0.5\n 24OCT2012 21.0 0.0 25.0 0.1 27.2 0.5 29.3 0.7\n 31OCT2012 21.5 0.3 25.2 0.2 27.1 0.4 29.2 0.6\n 07NOV2012 21.5 0.2 25.1 0.1 27.0 0.4 29.2 0.6\n 14NOV2012 21.0-0.5 25.2 0.2 27.2 0.5 29.3 0.7\n 21NOV2012 21.1-0.7 25.1 0.1 26.9 0.3 29.1 0.5\n 28NOV2012 20.7-1.4 24.9-0.1 26.8 0.2 28.9 0.4\n 05DEC2012 21.5-0.9 24.9-0.2 26.5-0.1 28.6 0.1\n 12DEC2012 21.8-0.8 24.8-0.3 26.5-0.1 28.8 0.4\n 19DEC2012 22.4-0.6 24.9-0.3 26.4-0.2 28.6 0.2\n 26DEC2012 22.7-0.6 25.0-0.3 26.4-0.1 28.6 0.2\n 02JAN2013 23.3-0.4 25.0-0.4 26.3-0.3 28.4 0.1\n 09JAN2013 23.7-0.4 24.8-0.7 26.0-0.6 28.3 0.0\n 16JAN2013 24.1-0.4 25.0-0.6 26.0-0.6 28.1-0.2\n 23JAN2013 24.2-0.6 25.3-0.5 26.4-0.2 28.2 0.0\n 30JAN2013 24.8-0.5 25.1-0.9 26.1-0.5 28.1 0.0\n 06FEB2013 25.4-0.2 25.5-0.7 26.2-0.5 28.1-0.1\n 13FEB2013 25.9-0.1 25.9-0.4 26.4-0.3 28.1 0.0\n 20FEB2013 25.6-0.6 26.2-0.3 26.3-0.5 27.9-0.1\n 27FEB2013 25.8-0.4 26.5-0.2 26.6-0.3 27.9-0.2\n 06MAR2013 26.7 0.4 27.0 0.1 26.9-0.1 27.9-0.2\n 13MAR2013 27.0 0.5 27.1 0.0 26.8-0.3 27.7-0.4\n 20MAR2013 26.6 0.2 27.6 0.4 27.1-0.1 28.0-0.2\n 27MAR2013 25.6-0.5 27.6 0.3 27.3-0.1 28.1-0.2\n 03APR2013 25.0-0.9 27.3 0.0 27.6 0.1 28.3 0.0\n 10APR2013 24.8-0.9 27.5 0.0 27.7 0.0 28.5 0.1\n 17APR2013 24.6-0.8 27.5 0.0 27.7-0.1 28.5 0.0\n 24APR2013 24.5-0.6 27.3-0.1 27.7-0.1 28.4-0.1\n 01MAY2013 23.6-1.2 26.9-0.4 27.8 0.0 28.7 0.0\n 08MAY2013 22.9-1.6 26.7-0.5 27.7-0.1 28.7 0.0\n 15MAY2013 23.2-1.1 26.5-0.6 27.5-0.4 28.6-0.2\n 22MAY2013 22.3-1.6 25.9-1.0 27.4-0.4 28.7-0.1\n 29MAY2013 21.5-2.1 25.9-0.9 27.5-0.2 28.8 0.0\n 05JUN2013 22.0-1.3 25.9-0.8 27.5-0.2 28.8 0.0\n 12JUN2013 21.9-1.1 25.9-0.6 27.5-0.2 28.8-0.1\n 19JUN2013 21.1-1.6 25.7-0.7 27.3-0.3 28.6-0.2\n 26JUN2013 20.5-1.9 25.6-0.6 27.4-0.1 28.8 0.0\n 03JUL2013 20.6-1.5 25.4-0.5 27.2-0.2 28.8 0.0\n 10JUL2013 20.5-1.3 25.0-0.8 26.9-0.4 28.8 0.0\n 17JUL2013 20.1-1.5 24.8-0.8 26.8-0.4 28.7-0.1\n 24JUL2013 20.3-1.1 24.9-0.6 26.8-0.3 28.7-0.1\n 31JUL2013 19.8-1.3 24.6-0.8 26.8-0.2 28.7 0.0\n 07AUG2013 19.8-1.1 24.5-0.7 26.7-0.3 28.6-0.1\n 14AUG2013 19.6-1.1 24.4-0.7 26.4-0.4 28.7 0.0\n 21AUG2013 19.9-0.8 24.4-0.6 26.4-0.4 28.7 0.0\n 28AUG2013 19.4-1.1 24.5-0.5 26.7-0.1 28.8 0.2\n 04SEP2013 19.6-0.9 24.6-0.3 26.8 0.0 28.8 0.1\n 11SEP2013 20.0-0.4 24.7-0.2 26.8 0.0 28.7 0.0\n 18SEP2013 19.9-0.5 24.9 0.1 26.7-0.1 28.6-0.1\n 25SEP2013 20.1-0.4 24.7-0.2 26.5-0.2 28.5-0.1\n 02OCT2013 19.7-0.9 24.6-0.2 26.4-0.3 28.7 0.0\n 09OCT2013 20.1-0.7 24.6-0.3 26.3-0.3 28.6 0.0\n 16OCT2013 20.3-0.5 24.8-0.1 26.3-0.4 28.6-0.1\n 23OCT2013 20.5-0.4 24.7-0.2 26.3-0.4 28.7 0.1\n 30OCT2013 20.5-0.7 24.8-0.1 26.5-0.2 28.8 0.2\n 06NOV2013 21.0-0.4 24.8-0.1 26.6 0.0 28.9 0.3\n 13NOV2013 21.1-0.4 24.7-0.2 26.6 0.0 28.9 0.3\n 20NOV2013 21.3-0.5 24.8-0.2 26.7 0.1 28.9 0.3\n 27NOV2013 21.7-0.4 24.9-0.1 26.7 0.1 28.8 0.2\n 04DEC2013 22.0-0.3 24.9-0.2 26.8 0.2 28.8 0.3\n 11DEC2013 22.4-0.2 25.1 0.0 26.6 0.0 28.7 0.2\n 18DEC2013 22.4-0.5 25.2 0.0 26.5-0.1 28.6 0.1\n 25DEC2013 22.8-0.4 25.2-0.1 26.4-0.2 28.5 0.1\n 01JAN2014 23.7 0.0 25.2-0.2 26.3-0.3 28.2-0.2\n 08JAN2014 24.2 0.1 25.1-0.5 26.0-0.5 28.2-0.2\n 15JAN2014 25.0 0.6 25.2-0.4 25.9-0.7 28.0-0.3\n 22JAN2014 25.4 0.6 25.6-0.2 26.2-0.4 28.1-0.1\n 29JAN2014 25.4 0.2 25.3-0.7 25.9-0.7 27.9-0.2\n 05FEB2014 25.1-0.4 25.3-0.8 25.9-0.7 28.1 0.0\n 12FEB2014 25.4-0.6 25.4-0.9 26.2-0.5 28.5 0.4\n 19FEB2014 25.1-1.1 25.7-0.7 26.4-0.4 28.5 0.4\n 26FEB2014 25.5-0.7 26.0-0.6 26.3-0.6 28.2 0.1\n 05MAR2014 26.1-0.3 26.4-0.5 26.6-0.4 28.5 0.3\n 12MAR2014 25.8-0.6 26.8-0.3 26.8-0.4 28.7 0.6\n 19MAR2014 25.2-1.2 27.3 0.1 27.4 0.1 28.8 0.6\n 26MAR2014 25.4-0.7 27.6 0.4 27.6 0.2 29.0 0.7\n 02APR2014 25.2-0.7 27.8 0.5 27.8 0.3 29.0 0.7\n 09APR2014 24.9-0.8 27.6 0.1 27.9 0.2 29.1 0.7\n 16APR2014 24.8-0.7 27.7 0.2 28.0 0.2 29.1 0.6\n 23APR2014 25.3 0.1 27.8 0.4 28.2 0.4 29.2 0.6\n 30APR2014 25.7 0.8 27.8 0.5 28.2 0.4 29.3 0.7\n 07MAY2014 25.8 1.2 27.8 0.6 28.3 0.5 29.5 0.8\n 14MAY2014 25.5 1.3 27.7 0.6 28.3 0.4 29.5 0.8\n 21MAY2014 25.4 1.5 27.6 0.7 28.3 0.5 29.6 0.8\n 28MAY2014 25.3 1.6 27.6 0.7 28.4 0.6 29.7 0.9\n 04JUN2014 24.8 1.4 27.5 0.8 28.3 0.5 29.6 0.8\n 11JUN2014 24.6 1.6 27.3 0.8 28.1 0.4 29.5 0.6\n 18JUN2014 24.8 2.1 27.4 1.0 28.1 0.5 29.4 0.5\n 25JUN2014 24.0 1.6 27.2 1.0 28.0 0.5 29.3 0.5\n 02JUL2014 23.6 1.4 27.0 1.0 27.8 0.4 29.1 0.3\n 09JUL2014 23.0 1.1 26.5 0.6 27.6 0.3 29.1 0.3\n 16JUL2014 23.1 1.5 26.2 0.6 27.4 0.2 29.1 0.4\n 23JUL2014 22.9 1.6 26.0 0.5 27.1-0.1 28.9 0.2\n 30JUL2014 21.8 0.6 25.5 0.2 26.9-0.1 29.0 0.3\n 06AUG2014 22.2 1.2 25.6 0.4 27.0 0.0 29.2 0.5\n 13AUG2014 21.9 1.2 25.5 0.5 26.9 0.0 29.0 0.4\n 20AUG2014 22.1 1.4 25.5 0.5 27.1 0.3 29.1 0.4\n 27AUG2014 21.3 0.8 25.4 0.4 27.2 0.4 29.2 0.5\n 03SEP2014 21.7 1.2 25.3 0.4 27.1 0.4 29.2 0.5\n 10SEP2014 21.1 0.7 25.3 0.4 27.3 0.5 29.4 0.7\n 17SEP2014 21.0 0.7 25.2 0.4 27.2 0.5 29.4 0.8\n 24SEP2014 21.2 0.8 25.4 0.5 27.1 0.4 29.3 0.6\n 01OCT2014 21.7 1.1 25.4 0.5 27.1 0.3 29.2 0.5\n 08OCT2014 21.3 0.6 25.5 0.6 27.1 0.4 29.1 0.5\n 15OCT2014 21.5 0.7 25.5 0.5 27.2 0.5 29.4 0.7\n 22OCT2014 21.8 0.8 25.8 0.8 27.2 0.5 29.4 0.7\n 29OCT2014 21.8 0.6 25.8 0.9 27.3 0.6 29.4 0.8\n 05NOV2014 21.9 0.5 25.8 0.9 27.4 0.8 29.5 0.9\n 12NOV2014 22.4 0.9 25.8 0.9 27.5 0.8 29.5 0.9\n 19NOV2014 22.6 0.8 26.0 1.0 27.5 0.9 29.5 0.9\n 26NOV2014 22.4 0.4 25.9 0.9 27.6 1.0 29.5 0.9\n 03DEC2014 22.3 0.0 25.8 0.7 27.4 0.8 29.4 0.9\n 10DEC2014 22.8 0.2 26.0 0.9 27.5 0.9 29.4 0.9\n 17DEC2014 22.9 0.1 26.0 0.8 27.4 0.8 29.4 1.0\n 24DEC2014 23.1-0.2 26.0 0.7 27.3 0.7 29.3 0.9\n 31DEC2014 23.6 0.0 25.9 0.6 27.1 0.5 29.2 0.8\n 07JAN2015 23.7-0.2 25.9 0.4 27.0 0.4 29.1 0.7\n 14JAN2015 24.0-0.4 25.9 0.3 27.1 0.5 29.1 0.9\n 21JAN2015 24.3-0.4 26.1 0.3 27.2 0.6 29.2 1.0\n 28JAN2015 24.8-0.3 26.2 0.3 27.2 0.5 29.1 0.9\n 04FEB2015 25.0-0.5 26.2 0.1 27.2 0.5 29.1 0.9\n 11FEB2015 25.1-0.8 26.6 0.3 27.2 0.5 29.0 0.9\n 18FEB2015 26.1-0.1 26.7 0.3 27.3 0.5 29.0 1.0\n 25FEB2015 26.1-0.1 26.8 0.1 27.5 0.6 29.3 1.2\n" }, { "path": "src/test/resources/samples/langs/Forth/KataDiversion.fth", "content": "\\ KataDiversion in Forth\n\n\\ -- utils\n\n\\ empty the stack\n: EMPTY\n DEPTH 0 <> IF BEGIN\n DROP DEPTH 0 =\n UNTIL\n THEN ;\n\n\\ power\n: ** ( n1 n2 -- n1_pow_n2 ) 1 SWAP ?DUP IF 0 DO OVER * LOOP THEN NIP ;\n\n\\ compute the highest power of 2 below N.\n\\ e.g. : 31 -> 16, 4 -> 4\n: MAXPOW2 ( n -- log2_n ) DUP 1 < IF 1 ABORT\" Maxpow2 need a positive value.\"\n ELSE DUP 1 = IF 1\n ELSE\n 1 >R\n BEGIN ( n |R: i=1)\n DUP DUP I - 2 *\n ( n n 2*[n-i])\n R> 2 * >R ( … |R: i*2)\n > ( n n>2*[n-i] )\n UNTIL\n R> 2 /\n THEN\n THEN NIP ;\n\n\\ -- kata\n\n\\ test if the given N has two adjacent 1 bits\n\\ e.g. : 11 -> 1011 -> -1\n\\ 9 -> 1001 -> 0\n: ?NOT-TWO-ADJACENT-1-BITS ( n -- bool )\n \\ the word uses the following algorithm :\n \\ (stack|return stack)\n \\ ( A N | X ) A: 0, X: N LOG2\n \\ loop: if N-X > 0 then A++ else A=0 ; X /= 2\n \\ return 0 if A=2\n \\ if X=1 end loop and return -1\n 0 SWAP DUP DUP 0 <> IF\n MAXPOW2 >R\n BEGIN\n DUP I - 0 >= IF \n SWAP DUP 1 = IF 1+ SWAP\n ELSE DROP 1 SWAP I -\n THEN\n ELSE NIP 0 SWAP\n THEN\n OVER\n 2 =\n I 1 = OR\n R> 2 / >R\n UNTIL\n R> 2DROP\n 2 <>\n ELSE 2DROP INVERT\n THEN ;\n\n\\ return the maximum number which can be made with N (given number) bits\n: MAX-NB ( n -- m ) DUP 1 < IF DROP 0 ( 0 )\n ELSE \n DUP IF DUP 2 SWAP ** NIP 1 - ( 2**n - 1 )\n THEN\n THEN ;\n\n\n\\ return the number of numbers which can be made with N (given number) bits\n\\ or less, and which have not two adjacent 1 bits.\n\\ see http://www.codekata.com/2007/01/code_kata_fifte.html\n: HOW-MANY-NB-NOT-TWO-ADJACENT-1-BITS ( n -- m )\n DUP 1 < IF DUP 0\n ELSE\n 0 SWAP\n MAX-NB 1 + 0 DO I ?NOT-TWO-ADJACENT-1-BITS - LOOP\n THEN ;\n\n" }, { "path": "src/test/resources/samples/langs/Forth/asm.fr", "content": "\\ Copyright 2013-2014 Lars Brinkhoff\n\n\\ Assembler for x86.\n\n\\ Adds to FORTH vocabulary: ASSEMBLER CODE ;CODE.\n\\ Creates ASSEMBLER vocabulary with: END-CODE and x86 opcodes.\n\n\\ Conventional prefix syntax: \" ,\".\n\\ Addressing modes:\n\\ - immediate: \"n #\"\n\\ - direct: n\n\\ - register: \n\\ - indirect: \" )\"\n\\ - indirect with displacement: \"n )#\"\n\\ - indexed: not supported yet\n\nrequire lib/common.fth\nrequire search.fth\n\nvocabulary assembler\nalso assembler definitions\n\n\\ Access to the target image.\n' header, defer header, is header,\n' cell defer cell is cell\n' dp defer dp is dp\n0 value delta\n\n: aligned cell + 1 - cell negate nand invert ;\n: align dp @ aligned dp ! ;\n: allot dp +! ;\n: here dp @ ;\n: cells cell * ;\n: c! delta + c! ;\n: c, here c! 1 allot ;\n: h, dup c, 8 rshift c, ;\n: , dup h, 16 rshift h, ;\n\nbase @ hex\n\n\\ This constant signals that an operand is not a direct address.\ndeadbeef constant -addr\n\n\\ Assembler state.\nvariable opcode\nvariable d\nvariable s\nvariable dir?\nvariable mrrm defer ?mrrm,\nvariable sib defer ?sib,\nvariable disp defer ?disp,\nvariable imm defer ?imm,\ndefer imm,\ndefer immediate-opcode\ndefer reg\ndefer ?opsize\n\n\\ Set opcode. And destination: register or memory.\n: opcode! 3@ is immediate-opcode >r opcode ! ;\n: !reg dir? @ if 2 d ! then dir? off ;\n: !mem dir? off ;\n\n\\ Set bits in mod/reg/rm byte.\n: -mrrm ['] nop is ?mrrm, ;\n: mod! mrrm c0 !bits ;\n: reg@ mrrm 38 @bits ;\n: reg! mrrm 38 !bits ;\n: rm@ mrrm 7 @bits ;\n: rm! rm@ 3 lshift reg! mrrm 7 !bits ;\n: reg>opcode rm@ opcode 07 !bits ;\n: opcode>reg opcode @ dup 3 rshift rm! 8 rshift opcode ! ;\n\n\\ Write parts of instruction to memory.\n: ds d @ s @ + ;\n: ?twobyte dup FF > if dup 8 rshift c, then ;\n: opcode, opcode @ ?twobyte ds + c, ;\n: mrrm, mrrm @ c, ;\n: sib, sib @ c, ;\n: imm8, imm @ c, ;\n: imm16, imm @ h, ;\n: imm32, imm @ , ;\n: disp8, disp @ c, ;\n: disp32, disp @ , ;\n\n\\ Set operand size.\n: -opsize 2drop r> drop ;\n: opsize! is imm, s ! ['] -opsize is ?opsize ;\n: !op8 0 ['] imm8, ?opsize ;\n: !op32 1 ['] imm32, ?opsize ;\n: !op16 1 ['] imm16, ?opsize 66 c, ;\n\n\\ Set SIB byte.\n: !sib ['] sib, is ?sib, ;\n: sib! 3 lshift + sib ! !sib ;\n\n\\ Set displacement.\n: byte? -80 80 within ;\n: disp! is ?disp, disp ! ;\n: !disp8 ['] disp8, disp! ;\n: !disp32 ['] disp32, disp! ;\n: !disp ( a -- u ) dup byte? if !disp8 40 else !disp32 80 then ;\n: -pc here 5 + negate ;\n: relative -pc disp +! ;\n\n\\ Set immediate operand.\n: imm! imm ! ['] imm, is ?imm, ;\n\n\\ Implements addressing modes: register, indirect, indexed, and direct.\n: reg1 rm! !reg ;\n: reg2 3 lshift reg! ;\n: !reg2 ['] reg2 is reg ;\n: ind dup mod! rm! !mem !reg2 ;\n: ind# swap !disp + ind ;\n: idx 04 ind sib! ;\n: idx# rot !disp 04 + ind sib! ;\n: addr !disp32 05 ind ;\n\n\\ Reset assembler state.\n: 0opsize ['] opsize! is ?opsize ;\n: 0ds d off s off ;\n: 0reg ['] reg1 is reg ;\n: 0mrrm c0 mrrm ! ['] mrrm, is ?mrrm, ;\n: 0sib ['] nop is ?sib, ;\n: 0disp ['] nop is ?disp, ;\n: 0imm imm off ['] nop is ?imm, 0 is imm, ;\n: 0asm 0imm 0disp 0reg 0ds 0mrrm 0sib 0opsize dir? on ;\n\n\\ Enter and exit assembler mode.\n: start-code also assembler 0asm ;\n: end-code align previous ;\n\n\\ Implements addressing mode: immediate.\n: imm8? imm @ byte? ;\n: ?sign-extend d off imm8? if 2 d ! ['] imm8, is ?imm, then ;\n: alu# opcode @ reg! 80 opcode ! ?sign-extend ;\n: mov# B0 s @ 3 lshift + rm@ + opcode ! 0ds -mrrm ;\n: push# imm8? if ['] imm8, 6A else ['] imm32, 68 then dup opcode ! rm! is ?imm, ;\n: test# F6 opcode ! ;\n: imm-op imm! immediate-opcode ;\n\n\\ Process one operand. All operands except a direct address\n\\ have the stack picture ( n*x xt -addr ).\n: addr? dup -addr <> ;\n: op addr? if addr else drop execute then ;\n\n\\ Define instruction formats.\n: instruction, opcode! opcode, ?mrrm, ?sib, ?disp, ?imm, 0asm ;\n: mnemonic ( u a \"name\" -- ) create ['] nop 3, does> instruction, ;\n: format: create ] !csp does> mnemonic ;\n: immediate: ' latestxt >body ! ;\n\n\\ Instruction formats.\nformat: 0op -mrrm ;\nformat: 1reg op reg>opcode 0ds -mrrm ;\nformat: 1op opcode>reg op d off ;\nformat: 2op op op ;\nformat: 2op-d op op d off ;\nformat: 2op-ds op op 0ds ;\nformat: 1addr op relative -mrrm ;\nformat: 1imm8 !op8 op -mrrm ;\n\n\\ Instruction mnemonics.\n00 2op add, immediate: alu#\n08 2op or, immediate: alu#\n0F44 2op-ds cmove, \\ Todo: other condition codes.\n0FB6 2op-ds movzx,\n0FBE 2op-ds movsx,\n10 2op adc, immediate: alu#\n18 2op sbb, immediate: alu#\n20 2op and, immediate: alu#\n26 0op es,\n28 2op sub, immediate: alu#\n2E 0op cs,\n30 2op xor, immediate: alu#\n36 0op ss,\n38 2op cmp, immediate: alu#\n3E 0op ds,\n50 1reg push, immediate: push#\n58 1reg pop,\n64 0op fs,\n65 0op gs,\n\\ 70 jcc\n84 2op-d test, immediate: test#\n86 2op-d xchg,\n88 2op mov, immediate: mov#\n8D 2op-ds lea,\n\\ 8F/0 pop, rm\n90 0op nop,\nC3 0op ret,\n\\ C6/0 immediate mov to r/m\n\\ C7/0 immediate mov to r/m\nCD 1imm8 int,\nE8 1addr call,\nE9 1addr jmp,\n\\ EB jmp rel8\nF0 0op lock,\nF2 0op rep,\nF3 0op repz,\nF4 0op hlt,\nF5 0op cmc,\nF610 1op not,\nF618 1op neg,\nF8 0op clc,\nF9 0op stc,\nFA 0op cli,\nFB 0op sti,\nFC 0op cld,\nFD 0op std,\n\\ FE 0 inc rm\n\\ FF 1 dec rm\n\\ FF 2 call rm\n\\ FF 4 jmp rm\n\\ FF 6 push rm\n\n: sp? dup 4 = ;\n\n\\ Addressing mode syntax: immediate, indirect, and displaced indirect.\n: # ['] imm-op -addr ;\n: ) 2drop sp? if 4 ['] idx else ['] ind then -addr 0reg 0opsize ;\n: )# 2drop sp? if 4 ['] idx# else ['] ind# then -addr 0reg 0opsize ;\n\n\\ Define registers.\n: reg8 create , does> @ ['] reg -addr !op8 ;\n: reg16 create , does> @ ['] reg -addr !op16 ;\n: reg32 create , does> @ ['] reg -addr !op32 ;\n: reg: dup reg8 dup reg16 dup reg32 1+ ;\n\n\\ Register names.\n0\nreg: al ax eax reg: cl cx ecx reg: dl dx edx reg: bl bx ebx\nreg: ah sp esp reg: ch bp ebp reg: dh si esi reg: bh di edi\ndrop\n\n\\ Runtime for ;CODE. CODE! is defined elsewhere.\n: (;code) r> code! ;\n\nbase ! only forth definitions also assembler\n\n\\ Standard assembler entry points.\n: code parse-name header, ?code, start-code ;\n: ;code postpone (;code) reveal postpone [ ?csp start-code ; immediate\n\n0asm\nprevious\n" }, { "path": "src/test/resources/samples/langs/Forth/bitmap.frt", "content": "\\ Bit arrays.\n: bits ( u1 -- u2 ) 7 + 3 rshift ;\n: bitmap ( u \"name\" -- ) create bits here over erase allot\n does> ( u -- a x ) over 3 rshift + 1 rot 7 and lshift ;\n: bit@ ( a x -- f ) swap c@ and ;\n: 1bit ( a x -- ) over c@ or swap c! ;\n: 0bit ( a x -- ) invert over c@ and swap c! ;\n: bit! ( f a x -- ) rot if 1bit else 0bit then ;\n" }, { "path": "src/test/resources/samples/langs/Forth/block.fth", "content": "( Block words. )\n\nvariable blk\nvariable current-block\n\n: block ( n -- addr )\n current-block ! 0 ;\n\n: buffer ( n -- addr )\n current-block ! 0 ;\n\n\\ evaluate (extended semantics)\n\\ flush ( -- )\n\n: load ( ... n -- ... )\n dup current-block !\n blk !\n save-input\n 0 >in !\n blk @ block ''source ! 1024 ''#source !\n ( interpret )\n restore-input ;\n\n\\ save-buffers ( -- )\n\\ update ( -- )\n\n( Block extension words. )\n\n\\ empty-buffers ( -- )\n\nvariable scr\n\n: list ( n -- )\n dup scr !\n dup current-block !\n block 1024 bounds do i @ emit loop ;\n\n\\ refill (extended semantics)\n\n: thru ( x y -- ) +1 swap do i load loop ;\n\n\\ \\ (extended semantics)\n" }, { "path": "src/test/resources/samples/langs/Forth/core-ext.fth", "content": "\\ -*- forth -*- Copyright 2004, 2013 Lars Brinkhoff\n\n\\ Kernel: #tib\n\\ TODO: .r\n\n: .( ( \"\" -- )\n [char] ) parse type ; immediate\n\n: 0<> ( n -- flag ) 0 <> ;\n\n: 0> ( n -- flag ) 0 > ;\n\n\\ Kernel: 2>r\n\n: 2r> ( -- x1 x2 ) ( R: x1 x2 -- ) r> r> r> rot >r swap ;\n\n: 2r@ ( -- x1 x2 ) ( R: x1 x2 -- x1 x2 ) 2r> 2dup 2>r ;\n\n: :noname align here 0 c, 15 allot lastxt dup @ , !\n [ ' enter >code @ ] literal , 0 , ] lastxt @ ;\n\n\\ Kernel: <>\n\n\\ : ?do ( n1 n2 -- ) ( R: -- loop-sys ) ( C: -- do-sys )\n\\ here postpone 2>r unresolved branch here ;\n\n: again ( -- ) ( C: dest -- )\n postpone branch , ; immediate\n\n: string+ ( caddr -- addr )\n count + aligned ;\n\n: (c\") ( -- caddr ) ( R: ret1 -- ret2 )\n r> dup string+ >r ;\n\n: c\" ( \"\" -- caddr )\n postpone (c\") [char] \" parse dup c, string, ; immediate\n\n: case ( -- ) ( C: -- case-sys )\n 0 ;\n\n: compile, ( xt -- )\n , ;\n\n\\ TODO: convert\n\n: endcase ( x -- ) ( C: case-sys -- )\n 0 do postpone then loop\n postpone drop ;\n\n: endof ( -- ) ( C: case-sys1 of-sys -- case-sys2 )\n postpone else swap 1+ ;\n\n\\ TODO: erase\n\\ TODO: expect\n\n: false ( -- 0 )\n 0 ;\n\n: hex ( -- )\n 16 base ! ;\n\n\\ TODO: marker\n\\ Kernel: nip\n\n: of ( x x -- | x y -- x ) ( C: -- of-sys )\n postpone over postpone = postpone if postpone drop ;\n\n\\ Kernel: pad\n\\ Kernel: parse\n\n: pick ( xn ... x0 n -- xn ... x0 xn )\n 2 + cells 'SP @ + @ ;\n\n: query ( -- )\n tib ''source ! #tib ''#source ! 0 'source-id !\n refill drop ;\n\n\\ Kernel: refill\n\\ Kernel: restore-input\n\n\\ TODO: roll ( xn xn-1 ... x0 n -- xn-1 ... x0 xn ) ;\n\n\\ Kernel: save-input\n\\ Kernel: source-id\n\\ TODO: span\n\\ Kernel: tib\n\n: to ( x \"word\" -- )\n ' >body , ;\n\n: true ( -- -1 )\n -1 ;\n\n: tuck ( x y -- y x y )\n swap over ;\n\n\\ TODO: u.r\n\n: u> ( x y -- flag )\n 2dup u< if 2drop false else <> then ;\n\n\\ TODO: unused\n\n: value ( x \"word\" -- )\n create ,\n does> ( -- x )\n @ ;\n\n: within over - >r - r> u< ;\n\n\\ TODO: [compile]\n\n\\ Kernel: \\\n\n\\ ----------------------------------------------------------------------\n\n( Forth2012 core extension words. )\n\n\\ TODO: action-of\n\n\\ TODO: buffer:\n\n: defer create ['] abort , does> @ execute ;\n\n: defer! ( xt2 xt1 -- ) >body ! ;\n\n: defer@ ( xt1 -- xt2 ) >body @ ;\n\n\\ TODO: holds\n\n: is ( xt \"word\" -- ) ' defer! ;\n\n\\ TODO: parse-name\n\n\\ TODO: s\\\"\n" }, { "path": "src/test/resources/samples/langs/Forth/core.f", "content": ": immediate lastxt @ dup c@ negate swap c! ;\n\n: \\ source nip >in ! ; immediate \\ Copyright 2004, 2012 Lars Brinkhoff\n\n: char \\ ( \"word\" -- char )\n bl-word here 1+ c@ ;\n\n: ahead here 0 , ;\n\n: resolve here swap ! ;\n\n: ' bl-word here find 0branch [ ahead ] exit [ resolve ] 0 ;\n\n: postpone-nonimmediate [ ' literal , ' compile, ] literal , ;\n\n: create dovariable_code header, reveal ;\n\ncreate postponers\n ' postpone-nonimmediate ,\n ' abort ,\n ' , ,\n\n: word \\ ( char \"string\" -- caddr )\n drop bl-word here ;\n\n: postpone \\ ( C: \"word\" -- )\n bl word find 1+ cells postponers + @ execute ; immediate\n\n: unresolved \\ ( C: \"word\" -- orig )\n postpone postpone postpone ahead ; immediate\n\n: chars \\ ( n1 -- n2 )\n ;\n\n: else \\ ( -- ) ( C: orig1 -- orig2 )\n unresolved branch swap resolve ; immediate\n\n: if \\ ( flag -- ) ( C: -- orig )\n unresolved 0branch ; immediate\n\n: then \\ ( -- ) ( C: orig -- )\n resolve ; immediate\n\n: [char] \\ ( \"word\" -- )\n char postpone literal ; immediate\n\n: (does>) lastxt @ dodoes_code over >code ! r> swap >does ! ;\n\n: does> postpone (does>) ; immediate\n\n: begin \\ ( -- ) ( C: -- dest )\n here ; immediate\n\n: while \\ ( x -- ) ( C: dest -- orig dest )\n unresolved 0branch swap ; immediate\n\n: repeat \\ ( -- ) ( C: orig dest -- )\n postpone branch , resolve ; immediate\n\n: until \\ ( x -- ) ( C: dest -- )\n postpone 0branch , ; immediate\n\n: recurse lastxt @ compile, ; immediate\n\n: pad \\ ( -- addr )\n here 1024 + ;\n\n: parse \\ ( char \"string\" -- addr n )\n pad >r begin\n\tsource? if else 0 0 then\n while\n\tr@ c! r> 1+ >r\n repeat 2drop pad r> over - ;\n\n: ( \\ ( \"string\" -- )\n [ char ) ] literal parse 2drop ; immediate\n \\ TODO: If necessary, refill and keep parsing.\n\n: string, ( addr n -- )\n here over allot align swap cmove ;\n\n: (s\") ( -- addr n ) ( R: ret1 -- ret2 )\n r> dup @ swap cell+ 2dup + aligned >r swap ;\n\ncreate squote 128 allot\n\n: s\" ( \"string\" -- addr n )\n state @ if\n\tpostpone (s\") [char] \" parse dup , string,\n else\n\t[char] \" parse >r squote r@ cmove squote r>\n then ; immediate\n\n: (abort\") ( ... addr n -- ) ( R: ... -- )\n cr type cr abort ;\n\n: abort\" ( ... x \"string\" -- ) ( R: ... -- )\n postpone if postpone s\" postpone (abort\") postpone then ; immediate\n\n\\ ----------------------------------------------------------------------\n\n( Core words. )\n\n\\ TODO: #\n\\ TODO: #>\n\\ TODO: #s\n\n: and ( x y -- x&y ) nand invert ;\n\n: * 1 2>r 0 swap begin r@ while\n r> r> swap 2dup dup + 2>r and if swap over + swap then dup +\n repeat r> r> 2drop drop ;\n\n\\ TODO: */mod\n\n: +loop ( -- ) ( C: nest-sys -- )\n postpone (+loop) postpone 0branch , postpone unloop ; immediate\n\n: space bl emit ;\n\n: ?.- dup 0 < if [char] - emit negate then ;\n\n: digit [char] 0 + emit ;\n\n: (.) base @ /mod ?dup if recurse then digit ;\n\n: .\" ( \"string\" -- ) postpone s\" postpone type ; immediate\n\n: . ( x -- ) ?.- (.) space ;\n\n: postpone-number ( caddr -- )\n 0 0 rot count >number dup 0= if\n\t2drop nip\n\tpostpone (literal) postpone (literal) postpone ,\n\tpostpone literal postpone ,\n else\n\t.\" Undefined: \" type cr abort\n then ;\n\n' postpone-number postponers cell+ !\n\n: / ( x y -- x/y ) /mod nip ;\n\n: 0< ( n -- flag ) 0 < ;\n\n: 1- ( n -- n-1 ) -1 + ;\n\n: 2! ( x1 x2 addr -- ) swap over ! cell+ ! ;\n\n: 2* ( n -- 2n ) dup + ;\n\n\\ Kernel: 2/\n\n: 2@ ( addr -- x1 x2 ) dup cell+ @ swap @ ;\n\n\\ Kernel: 2drop\n\\ Kernel: 2dup\n\n\\ TODO: 2over ( x1 x2 x3 x4 -- x1 x2 x3 x4 x1 x2 )\n\\ 3 pick 3 pick ;\n\n\\ TODO: 2swap\n\n\\ TODO: <#\n\n: abs ( n -- |n| )\n dup 0< if negate then ;\n\n\\ TODO: accept\n\n: c, ( n -- )\n here c! 1 chars allot ;\n\n: char+ ( n1 -- n2 )\n 1+ ;\n\n: constant create , does> @ ;\n\n: decimal ( -- )\n 10 base ! ;\n\n: depth ( -- n )\n data_stack 100 cells + 'SP @ - /cell / 2 - ;\n\n: do ( n1 n2 -- ) ( R: -- loop-sys ) ( C: -- do-sys )\n postpone 2>r here ; immediate\n\n\\ TODO: environment?\n\\ TODO: evaluate\n\\ TODO: fill\n\\ TODO: fm/mod )\n\\ TODO: hold\n\n: j ( -- x1 ) ( R: x1 x2 x3 -- x1 x2 x3 )\n 'RP @ 3 cells + @ ;\n\n\\ TODO: leave\n\n: loop ( -- ) ( C: nest-sys -- )\n postpone 1 postpone (+loop)\n postpone 0branch ,\n postpone unloop ; immediate\n\n: lshift begin ?dup while 1- swap dup + swap repeat ;\n\n: rshift 1 begin over while dup + swap 1- swap repeat nip\n 2>r 0 1 begin r@ while\n r> r> 2dup swap dup + 2>r and if swap over + swap then dup +\n repeat r> r> 2drop drop ;\n\n: max ( x y -- max[x,y] )\n 2dup > if drop else nip then ;\n\n\\ Kernel: min\n\\ TODO: mod\n\\ TODO: move\n\n: (quit) ( R: ... -- )\n return_stack 100 cells + 'RP !\n 0 'source-id ! tib ''source ! #tib ''#source !\n postpone [\n begin\n\trefill\n while\n\tinterpret state @ 0= if .\" ok\" cr then\n repeat\n bye ;\n\n' (quit) ' quit >body cell+ !\n\n\\ TODO: s>d\n\\ TODO: sign\n\\ TODO: sm/rem\n\n: spaces ( n -- )\n 0 do space loop ;\n\n\\ TODO: u.\n\n: signbit ( -- n ) -1 1 rshift invert ;\n\n: xor ( x y -- x^y ) 2dup nand >r r@ nand swap r> nand nand ;\n\n: u< ( x y -- flag ) signbit xor swap signbit xor > ;\n\n\\ TODO: um/mod\n\n: variable ( \"word\" -- )\n create /cell allot ;\n\n: ['] \\ ( C: \"word\" -- )\n ' postpone literal ; immediate\n" }, { "path": "src/test/resources/samples/langs/Forth/core.for", "content": ": immediate lastxt @ dup c@ negate swap c! ;\n\n: \\ source nip >in ! ; immediate \\ Copyright 2004, 2012 Lars Brinkhoff\n\n: char \\ ( \"word\" -- char )\n bl-word here 1+ c@ ;\n\n: ahead here 0 , ;\n\n: resolve here swap ! ;\n\n: ' bl-word here find 0branch [ ahead ] exit [ resolve ] 0 ;\n\n: postpone-nonimmediate [ ' literal , ' compile, ] literal , ;\n\n: create dovariable_code header, reveal ;\n\ncreate postponers\n ' postpone-nonimmediate ,\n ' abort ,\n ' , ,\n\n: word \\ ( char \"string\" -- caddr )\n drop bl-word here ;\n\n: postpone \\ ( C: \"word\" -- )\n bl word find 1+ cells postponers + @ execute ; immediate\n\n: unresolved \\ ( C: \"word\" -- orig )\n postpone postpone postpone ahead ; immediate\n\n: chars \\ ( n1 -- n2 )\n ;\n\n: else \\ ( -- ) ( C: orig1 -- orig2 )\n unresolved branch swap resolve ; immediate\n\n: if \\ ( flag -- ) ( C: -- orig )\n unresolved 0branch ; immediate\n\n: then \\ ( -- ) ( C: orig -- )\n resolve ; immediate\n\n: [char] \\ ( \"word\" -- )\n char postpone literal ; immediate\n\n: (does>) lastxt @ dodoes_code over >code ! r> swap >does ! ;\n\n: does> postpone (does>) ; immediate\n\n: begin \\ ( -- ) ( C: -- dest )\n here ; immediate\n\n: while \\ ( x -- ) ( C: dest -- orig dest )\n unresolved 0branch swap ; immediate\n\n: repeat \\ ( -- ) ( C: orig dest -- )\n postpone branch , resolve ; immediate\n\n: until \\ ( x -- ) ( C: dest -- )\n postpone 0branch , ; immediate\n\n: recurse lastxt @ compile, ; immediate\n\n: pad \\ ( -- addr )\n here 1024 + ;\n\n: parse \\ ( char \"string\" -- addr n )\n pad >r begin\n\tsource? if else 0 0 then\n while\n\tr@ c! r> 1+ >r\n repeat 2drop pad r> over - ;\n\n: ( \\ ( \"string\" -- )\n [ char ) ] literal parse 2drop ; immediate\n \\ TODO: If necessary, refill and keep parsing.\n\n: string, ( addr n -- )\n here over allot align swap cmove ;\n\n: (s\") ( -- addr n ) ( R: ret1 -- ret2 )\n r> dup @ swap cell+ 2dup + aligned >r swap ;\n\ncreate squote 128 allot\n\n: s\" ( \"string\" -- addr n )\n state @ if\n\tpostpone (s\") [char] \" parse dup , string,\n else\n\t[char] \" parse >r squote r@ cmove squote r>\n then ; immediate\n\n: (abort\") ( ... addr n -- ) ( R: ... -- )\n cr type cr abort ;\n\n: abort\" ( ... x \"string\" -- ) ( R: ... -- )\n postpone if postpone s\" postpone (abort\") postpone then ; immediate\n\n\\ ----------------------------------------------------------------------\n\n( Core words. )\n\n\\ TODO: #\n\\ TODO: #>\n\\ TODO: #s\n\n: and ( x y -- x&y ) nand invert ;\n\n: * 1 2>r 0 swap begin r@ while\n r> r> swap 2dup dup + 2>r and if swap over + swap then dup +\n repeat r> r> 2drop drop ;\n\n\\ TODO: */mod\n\n: +loop ( -- ) ( C: nest-sys -- )\n postpone (+loop) postpone 0branch , postpone unloop ; immediate\n\n: space bl emit ;\n\n: ?.- dup 0 < if [char] - emit negate then ;\n\n: digit [char] 0 + emit ;\n\n: (.) base @ /mod ?dup if recurse then digit ;\n\n: .\" ( \"string\" -- ) postpone s\" postpone type ; immediate\n\n: . ( x -- ) ?.- (.) space ;\n\n: postpone-number ( caddr -- )\n 0 0 rot count >number dup 0= if\n\t2drop nip\n\tpostpone (literal) postpone (literal) postpone ,\n\tpostpone literal postpone ,\n else\n\t.\" Undefined: \" type cr abort\n then ;\n\n' postpone-number postponers cell+ !\n\n: / ( x y -- x/y ) /mod nip ;\n\n: 0< ( n -- flag ) 0 < ;\n\n: 1- ( n -- n-1 ) -1 + ;\n\n: 2! ( x1 x2 addr -- ) swap over ! cell+ ! ;\n\n: 2* ( n -- 2n ) dup + ;\n\n\\ Kernel: 2/\n\n: 2@ ( addr -- x1 x2 ) dup cell+ @ swap @ ;\n\n\\ Kernel: 2drop\n\\ Kernel: 2dup\n\n\\ TODO: 2over ( x1 x2 x3 x4 -- x1 x2 x3 x4 x1 x2 )\n\\ 3 pick 3 pick ;\n\n\\ TODO: 2swap\n\n\\ TODO: <#\n\n: abs ( n -- |n| )\n dup 0< if negate then ;\n\n\\ TODO: accept\n\n: c, ( n -- )\n here c! 1 chars allot ;\n\n: char+ ( n1 -- n2 )\n 1+ ;\n\n: constant create , does> @ ;\n\n: decimal ( -- )\n 10 base ! ;\n\n: depth ( -- n )\n data_stack 100 cells + 'SP @ - /cell / 2 - ;\n\n: do ( n1 n2 -- ) ( R: -- loop-sys ) ( C: -- do-sys )\n postpone 2>r here ; immediate\n\n\\ TODO: environment?\n\\ TODO: evaluate\n\\ TODO: fill\n\\ TODO: fm/mod )\n\\ TODO: hold\n\n: j ( -- x1 ) ( R: x1 x2 x3 -- x1 x2 x3 )\n 'RP @ 3 cells + @ ;\n\n\\ TODO: leave\n\n: loop ( -- ) ( C: nest-sys -- )\n postpone 1 postpone (+loop)\n postpone 0branch ,\n postpone unloop ; immediate\n\n: lshift begin ?dup while 1- swap dup + swap repeat ;\n\n: rshift 1 begin over while dup + swap 1- swap repeat nip\n 2>r 0 1 begin r@ while\n r> r> 2dup swap dup + 2>r and if swap over + swap then dup +\n repeat r> r> 2drop drop ;\n\n: max ( x y -- max[x,y] )\n 2dup > if drop else nip then ;\n\n\\ Kernel: min\n\\ TODO: mod\n\\ TODO: move\n\n: (quit) ( R: ... -- )\n return_stack 100 cells + 'RP !\n 0 'source-id ! tib ''source ! #tib ''#source !\n postpone [\n begin\n\trefill\n while\n\tinterpret state @ 0= if .\" ok\" cr then\n repeat\n bye ;\n\n' (quit) ' quit >body cell+ !\n\n\\ TODO: s>d\n\\ TODO: sign\n\\ TODO: sm/rem\n\n: spaces ( n -- )\n 0 do space loop ;\n\n\\ TODO: u.\n\n: signbit ( -- n ) -1 1 rshift invert ;\n\n: xor ( x y -- x^y ) 2dup nand >r r@ nand swap r> nand nand ;\n\n: u< ( x y -- flag ) signbit xor swap signbit xor > ;\n\n\\ TODO: um/mod\n\n: variable ( \"word\" -- )\n create /cell allot ;\n\n: ['] \\ ( C: \"word\" -- )\n ' postpone literal ; immediate\n" }, { "path": "src/test/resources/samples/langs/Forth/core.fs", "content": ": immediate lastxt @ dup c@ negate swap c! ;\n\n: \\ source nip >in ! ; immediate \\ Copyright 2004, 2012 Lars Brinkhoff\n\n: char \\ ( \"word\" -- char )\n bl-word here 1+ c@ ;\n\n: ahead here 0 , ;\n\n: resolve here swap ! ;\n\n: ' bl-word here find 0branch [ ahead ] exit [ resolve ] 0 ;\n\n: postpone-nonimmediate [ ' literal , ' compile, ] literal , ;\n\n: create dovariable_code header, reveal ;\n\ncreate postponers\n ' postpone-nonimmediate ,\n ' abort ,\n ' , ,\n\n: word \\ ( char \"string\" -- caddr )\n drop bl-word here ;\n\n: postpone \\ ( C: \"word\" -- )\n bl word find 1+ cells postponers + @ execute ; immediate\n\n: unresolved \\ ( C: \"word\" -- orig )\n postpone postpone postpone ahead ; immediate\n\n: chars \\ ( n1 -- n2 )\n ;\n\n: else \\ ( -- ) ( C: orig1 -- orig2 )\n unresolved branch swap resolve ; immediate\n\n: if \\ ( flag -- ) ( C: -- orig )\n unresolved 0branch ; immediate\n\n: then \\ ( -- ) ( C: orig -- )\n resolve ; immediate\n\n: [char] \\ ( \"word\" -- )\n char postpone literal ; immediate\n\n: (does>) lastxt @ dodoes_code over >code ! r> swap >does ! ;\n\n: does> postpone (does>) ; immediate\n\n: begin \\ ( -- ) ( C: -- dest )\n here ; immediate\n\n: while \\ ( x -- ) ( C: dest -- orig dest )\n unresolved 0branch swap ; immediate\n\n: repeat \\ ( -- ) ( C: orig dest -- )\n postpone branch , resolve ; immediate\n\n: until \\ ( x -- ) ( C: dest -- )\n postpone 0branch , ; immediate\n\n: recurse lastxt @ compile, ; immediate\n\n: pad \\ ( -- addr )\n here 1024 + ;\n\n: parse \\ ( char \"string\" -- addr n )\n pad >r begin\n\tsource? if else 0 0 then\n while\n\tr@ c! r> 1+ >r\n repeat 2drop pad r> over - ;\n\n: ( \\ ( \"string\" -- )\n [ char ) ] literal parse 2drop ; immediate\n \\ TODO: If necessary, refill and keep parsing.\n\n: string, ( addr n -- )\n here over allot align swap cmove ;\n\n: (s\") ( -- addr n ) ( R: ret1 -- ret2 )\n r> dup @ swap cell+ 2dup + aligned >r swap ;\n\ncreate squote 128 allot\n\n: s\" ( \"string\" -- addr n )\n state @ if\n\tpostpone (s\") [char] \" parse dup , string,\n else\n\t[char] \" parse >r squote r@ cmove squote r>\n then ; immediate\n\n: (abort\") ( ... addr n -- ) ( R: ... -- )\n cr type cr abort ;\n\n: abort\" ( ... x \"string\" -- ) ( R: ... -- )\n postpone if postpone s\" postpone (abort\") postpone then ; immediate\n\n\\ ----------------------------------------------------------------------\n\n( Core words. )\n\n\\ TODO: #\n\\ TODO: #>\n\\ TODO: #s\n\n: and ( x y -- x&y ) nand invert ;\n\n: * 1 2>r 0 swap begin r@ while\n r> r> swap 2dup dup + 2>r and if swap over + swap then dup +\n repeat r> r> 2drop drop ;\n\n\\ TODO: */mod\n\n: +loop ( -- ) ( C: nest-sys -- )\n postpone (+loop) postpone 0branch , postpone unloop ; immediate\n\n: space bl emit ;\n\n: ?.- dup 0 < if [char] - emit negate then ;\n\n: digit [char] 0 + emit ;\n\n: (.) base @ /mod ?dup if recurse then digit ;\n\n: .\" ( \"string\" -- ) postpone s\" postpone type ; immediate\n\n: . ( x -- ) ?.- (.) space ;\n\n: postpone-number ( caddr -- )\n 0 0 rot count >number dup 0= if\n\t2drop nip\n\tpostpone (literal) postpone (literal) postpone ,\n\tpostpone literal postpone ,\n else\n\t.\" Undefined: \" type cr abort\n then ;\n\n' postpone-number postponers cell+ !\n\n: / ( x y -- x/y ) /mod nip ;\n\n: 0< ( n -- flag ) 0 < ;\n\n: 1- ( n -- n-1 ) -1 + ;\n\n: 2! ( x1 x2 addr -- ) swap over ! cell+ ! ;\n\n: 2* ( n -- 2n ) dup + ;\n\n\\ Kernel: 2/\n\n: 2@ ( addr -- x1 x2 ) dup cell+ @ swap @ ;\n\n\\ Kernel: 2drop\n\\ Kernel: 2dup\n\n\\ TODO: 2over ( x1 x2 x3 x4 -- x1 x2 x3 x4 x1 x2 )\n\\ 3 pick 3 pick ;\n\n\\ TODO: 2swap\n\n\\ TODO: <#\n\n: abs ( n -- |n| )\n dup 0< if negate then ;\n\n\\ TODO: accept\n\n: c, ( n -- )\n here c! 1 chars allot ;\n\n: char+ ( n1 -- n2 )\n 1+ ;\n\n: constant create , does> @ ;\n\n: decimal ( -- )\n 10 base ! ;\n\n: depth ( -- n )\n data_stack 100 cells + 'SP @ - /cell / 2 - ;\n\n: do ( n1 n2 -- ) ( R: -- loop-sys ) ( C: -- do-sys )\n postpone 2>r here ; immediate\n\n\\ TODO: environment?\n\\ TODO: evaluate\n\\ TODO: fill\n\\ TODO: fm/mod )\n\\ TODO: hold\n\n: j ( -- x1 ) ( R: x1 x2 x3 -- x1 x2 x3 )\n 'RP @ 3 cells + @ ;\n\n\\ TODO: leave\n\n: loop ( -- ) ( C: nest-sys -- )\n postpone 1 postpone (+loop)\n postpone 0branch ,\n postpone unloop ; immediate\n\n: lshift begin ?dup while 1- swap dup + swap repeat ;\n\n: rshift 1 begin over while dup + swap 1- swap repeat nip\n 2>r 0 1 begin r@ while\n r> r> 2dup swap dup + 2>r and if swap over + swap then dup +\n repeat r> r> 2drop drop ;\n\n: max ( x y -- max[x,y] )\n 2dup > if drop else nip then ;\n\n\\ Kernel: min\n\\ TODO: mod\n\\ TODO: move\n\n: (quit) ( R: ... -- )\n return_stack 100 cells + 'RP !\n 0 'source-id ! tib ''source ! #tib ''#source !\n postpone [\n begin\n\trefill\n while\n\tinterpret state @ 0= if .\" ok\" cr then\n repeat\n bye ;\n\n' (quit) ' quit >body cell+ !\n\n\\ TODO: s>d\n\\ TODO: sign\n\\ TODO: sm/rem\n\n: spaces ( n -- )\n 0 do space loop ;\n\n\\ TODO: u.\n\n: signbit ( -- n ) -1 1 rshift invert ;\n\n: xor ( x y -- x^y ) 2dup nand >r r@ nand swap r> nand nand ;\n\n: u< ( x y -- flag ) signbit xor swap signbit xor > ;\n\n\\ TODO: um/mod\n\n: variable ( \"word\" -- )\n create /cell allot ;\n\n: ['] \\ ( C: \"word\" -- )\n ' postpone literal ; immediate\n" }, { "path": "src/test/resources/samples/langs/Forth/core.fth", "content": ": immediate lastxt @ dup c@ negate swap c! ;\n\n: \\ source nip >in ! ; immediate \\ Copyright 2004, 2012 Lars Brinkhoff\n\n: char \\ ( \"word\" -- char )\n bl-word here 1+ c@ ;\n\n: ahead here 0 , ;\n\n: resolve here swap ! ;\n\n: ' bl-word here find 0branch [ ahead ] exit [ resolve ] 0 ;\n\n: postpone-nonimmediate [ ' literal , ' compile, ] literal , ;\n\n: create dovariable_code header, reveal ;\n\ncreate postponers\n ' postpone-nonimmediate ,\n ' abort ,\n ' , ,\n\n: word \\ ( char \"string\" -- caddr )\n drop bl-word here ;\n\n: postpone \\ ( C: \"word\" -- )\n bl word find 1+ cells postponers + @ execute ; immediate\n\n: unresolved \\ ( C: \"word\" -- orig )\n postpone postpone postpone ahead ; immediate\n\n: chars \\ ( n1 -- n2 )\n ;\n\n: else \\ ( -- ) ( C: orig1 -- orig2 )\n unresolved branch swap resolve ; immediate\n\n: if \\ ( flag -- ) ( C: -- orig )\n unresolved 0branch ; immediate\n\n: then \\ ( -- ) ( C: orig -- )\n resolve ; immediate\n\n: [char] \\ ( \"word\" -- )\n char postpone literal ; immediate\n\n: (does>) lastxt @ dodoes_code over >code ! r> swap >does ! ;\n\n: does> postpone (does>) ; immediate\n\n: begin \\ ( -- ) ( C: -- dest )\n here ; immediate\n\n: while \\ ( x -- ) ( C: dest -- orig dest )\n unresolved 0branch swap ; immediate\n\n: repeat \\ ( -- ) ( C: orig dest -- )\n postpone branch , resolve ; immediate\n\n: until \\ ( x -- ) ( C: dest -- )\n postpone 0branch , ; immediate\n\n: recurse lastxt @ compile, ; immediate\n\n: pad \\ ( -- addr )\n here 1024 + ;\n\n: parse \\ ( char \"string\" -- addr n )\n pad >r begin\n\tsource? if else 0 0 then\n while\n\tr@ c! r> 1+ >r\n repeat 2drop pad r> over - ;\n\n: ( \\ ( \"string\" -- )\n [ char ) ] literal parse 2drop ; immediate\n \\ TODO: If necessary, refill and keep parsing.\n\n: string, ( addr n -- )\n here over allot align swap cmove ;\n\n: (s\") ( -- addr n ) ( R: ret1 -- ret2 )\n r> dup @ swap cell+ 2dup + aligned >r swap ;\n\ncreate squote 128 allot\n\n: s\" ( \"string\" -- addr n )\n state @ if\n\tpostpone (s\") [char] \" parse dup , string,\n else\n\t[char] \" parse >r squote r@ cmove squote r>\n then ; immediate\n\n: (abort\") ( ... addr n -- ) ( R: ... -- )\n cr type cr abort ;\n\n: abort\" ( ... x \"string\" -- ) ( R: ... -- )\n postpone if postpone s\" postpone (abort\") postpone then ; immediate\n\n\\ ----------------------------------------------------------------------\n\n( Core words. )\n\n\\ TODO: #\n\\ TODO: #>\n\\ TODO: #s\n\n: and ( x y -- x&y ) nand invert ;\n\n: * 1 2>r 0 swap begin r@ while\n r> r> swap 2dup dup + 2>r and if swap over + swap then dup +\n repeat r> r> 2drop drop ;\n\n\\ TODO: */mod\n\n: +loop ( -- ) ( C: nest-sys -- )\n postpone (+loop) postpone 0branch , postpone unloop ; immediate\n\n: space bl emit ;\n\n: ?.- dup 0 < if [char] - emit negate then ;\n\n: digit [char] 0 + emit ;\n\n: (.) base @ /mod ?dup if recurse then digit ;\n\n: .\" ( \"string\" -- ) postpone s\" postpone type ; immediate\n\n: . ( x -- ) ?.- (.) space ;\n\n: postpone-number ( caddr -- )\n 0 0 rot count >number dup 0= if\n\t2drop nip\n\tpostpone (literal) postpone (literal) postpone ,\n\tpostpone literal postpone ,\n else\n\t.\" Undefined: \" type cr abort\n then ;\n\n' postpone-number postponers cell+ !\n\n: / ( x y -- x/y ) /mod nip ;\n\n: 0< ( n -- flag ) 0 < ;\n\n: 1- ( n -- n-1 ) -1 + ;\n\n: 2! ( x1 x2 addr -- ) swap over ! cell+ ! ;\n\n: 2* ( n -- 2n ) dup + ;\n\n\\ Kernel: 2/\n\n: 2@ ( addr -- x1 x2 ) dup cell+ @ swap @ ;\n\n\\ Kernel: 2drop\n\\ Kernel: 2dup\n\n\\ TODO: 2over ( x1 x2 x3 x4 -- x1 x2 x3 x4 x1 x2 )\n\\ 3 pick 3 pick ;\n\n\\ TODO: 2swap\n\n\\ TODO: <#\n\n: abs ( n -- |n| )\n dup 0< if negate then ;\n\n\\ TODO: accept\n\n: c, ( n -- )\n here c! 1 chars allot ;\n\n: char+ ( n1 -- n2 )\n 1+ ;\n\n: constant create , does> @ ;\n\n: decimal ( -- )\n 10 base ! ;\n\n: depth ( -- n )\n data_stack 100 cells + 'SP @ - /cell / 2 - ;\n\n: do ( n1 n2 -- ) ( R: -- loop-sys ) ( C: -- do-sys )\n postpone 2>r here ; immediate\n\n\\ TODO: environment?\n\\ TODO: evaluate\n\\ TODO: fill\n\\ TODO: fm/mod )\n\\ TODO: hold\n\n: j ( -- x1 ) ( R: x1 x2 x3 -- x1 x2 x3 )\n 'RP @ 3 cells + @ ;\n\n\\ TODO: leave\n\n: loop ( -- ) ( C: nest-sys -- )\n postpone 1 postpone (+loop)\n postpone 0branch ,\n postpone unloop ; immediate\n\n: lshift begin ?dup while 1- swap dup + swap repeat ;\n\n: rshift 1 begin over while dup + swap 1- swap repeat nip\n 2>r 0 1 begin r@ while\n r> r> 2dup swap dup + 2>r and if swap over + swap then dup +\n repeat r> r> 2drop drop ;\n\n: max ( x y -- max[x,y] )\n 2dup > if drop else nip then ;\n\n\\ Kernel: min\n\\ TODO: mod\n\\ TODO: move\n\n: (quit) ( R: ... -- )\n return_stack 100 cells + 'RP !\n 0 'source-id ! tib ''source ! #tib ''#source !\n postpone [\n begin\n\trefill\n while\n\tinterpret state @ 0= if .\" ok\" cr then\n repeat\n bye ;\n\n' (quit) ' quit >body cell+ !\n\n\\ TODO: s>d\n\\ TODO: sign\n\\ TODO: sm/rem\n\n: spaces ( n -- )\n 0 do space loop ;\n\n\\ TODO: u.\n\n: signbit ( -- n ) -1 1 rshift invert ;\n\n: xor ( x y -- x^y ) 2dup nand >r r@ nand swap r> nand nand ;\n\n: u< ( x y -- flag ) signbit xor swap signbit xor > ;\n\n\\ TODO: um/mod\n\n: variable ( \"word\" -- )\n create /cell allot ;\n\n: ['] \\ ( C: \"word\" -- )\n ' postpone literal ; immediate\n" }, { "path": "src/test/resources/samples/langs/Forth/core1.F", "content": ": immediate lastxt @ dup c@ negate swap c! ;\n\n: \\ source nip >in ! ; immediate \\ Copyright 2004, 2012 Lars Brinkhoff\n\n: char \\ ( \"word\" -- char )\n bl-word here 1+ c@ ;\n\n: ahead here 0 , ;\n\n: resolve here swap ! ;\n\n: ' bl-word here find 0branch [ ahead ] exit [ resolve ] 0 ;\n\n: postpone-nonimmediate [ ' literal , ' compile, ] literal , ;\n\n: create dovariable_code header, reveal ;\n\ncreate postponers\n ' postpone-nonimmediate ,\n ' abort ,\n ' , ,\n\n: word \\ ( char \"string\" -- caddr )\n drop bl-word here ;\n\n: postpone \\ ( C: \"word\" -- )\n bl word find 1+ cells postponers + @ execute ; immediate\n\n: unresolved \\ ( C: \"word\" -- orig )\n postpone postpone postpone ahead ; immediate\n\n: chars \\ ( n1 -- n2 )\n ;\n\n: else \\ ( -- ) ( C: orig1 -- orig2 )\n unresolved branch swap resolve ; immediate\n\n: if \\ ( flag -- ) ( C: -- orig )\n unresolved 0branch ; immediate\n\n: then \\ ( -- ) ( C: orig -- )\n resolve ; immediate\n\n: [char] \\ ( \"word\" -- )\n char postpone literal ; immediate\n\n: (does>) lastxt @ dodoes_code over >code ! r> swap >does ! ;\n\n: does> postpone (does>) ; immediate\n\n: begin \\ ( -- ) ( C: -- dest )\n here ; immediate\n\n: while \\ ( x -- ) ( C: dest -- orig dest )\n unresolved 0branch swap ; immediate\n\n: repeat \\ ( -- ) ( C: orig dest -- )\n postpone branch , resolve ; immediate\n\n: until \\ ( x -- ) ( C: dest -- )\n postpone 0branch , ; immediate\n\n: recurse lastxt @ compile, ; immediate\n\n: pad \\ ( -- addr )\n here 1024 + ;\n\n: parse \\ ( char \"string\" -- addr n )\n pad >r begin\n\tsource? if else 0 0 then\n while\n\tr@ c! r> 1+ >r\n repeat 2drop pad r> over - ;\n\n: ( \\ ( \"string\" -- )\n [ char ) ] literal parse 2drop ; immediate\n \\ TODO: If necessary, refill and keep parsing.\n\n: string, ( addr n -- )\n here over allot align swap cmove ;\n\n: (s\") ( -- addr n ) ( R: ret1 -- ret2 )\n r> dup @ swap cell+ 2dup + aligned >r swap ;\n\ncreate squote 128 allot\n\n: s\" ( \"string\" -- addr n )\n state @ if\n\tpostpone (s\") [char] \" parse dup , string,\n else\n\t[char] \" parse >r squote r@ cmove squote r>\n then ; immediate\n\n: (abort\") ( ... addr n -- ) ( R: ... -- )\n cr type cr abort ;\n\n: abort\" ( ... x \"string\" -- ) ( R: ... -- )\n postpone if postpone s\" postpone (abort\") postpone then ; immediate\n\n\\ ----------------------------------------------------------------------\n\n( Core words. )\n\n\\ TODO: #\n\\ TODO: #>\n\\ TODO: #s\n\n: and ( x y -- x&y ) nand invert ;\n\n: * 1 2>r 0 swap begin r@ while\n r> r> swap 2dup dup + 2>r and if swap over + swap then dup +\n repeat r> r> 2drop drop ;\n\n\\ TODO: */mod\n\n: +loop ( -- ) ( C: nest-sys -- )\n postpone (+loop) postpone 0branch , postpone unloop ; immediate\n\n: space bl emit ;\n\n: ?.- dup 0 < if [char] - emit negate then ;\n\n: digit [char] 0 + emit ;\n\n: (.) base @ /mod ?dup if recurse then digit ;\n\n: .\" ( \"string\" -- ) postpone s\" postpone type ; immediate\n\n: . ( x -- ) ?.- (.) space ;\n\n: postpone-number ( caddr -- )\n 0 0 rot count >number dup 0= if\n\t2drop nip\n\tpostpone (literal) postpone (literal) postpone ,\n\tpostpone literal postpone ,\n else\n\t.\" Undefined: \" type cr abort\n then ;\n\n' postpone-number postponers cell+ !\n\n: / ( x y -- x/y ) /mod nip ;\n\n: 0< ( n -- flag ) 0 < ;\n\n: 1- ( n -- n-1 ) -1 + ;\n\n: 2! ( x1 x2 addr -- ) swap over ! cell+ ! ;\n\n: 2* ( n -- 2n ) dup + ;\n\n\\ Kernel: 2/\n\n: 2@ ( addr -- x1 x2 ) dup cell+ @ swap @ ;\n\n\\ Kernel: 2drop\n\\ Kernel: 2dup\n\n\\ TODO: 2over ( x1 x2 x3 x4 -- x1 x2 x3 x4 x1 x2 )\n\\ 3 pick 3 pick ;\n\n\\ TODO: 2swap\n\n\\ TODO: <#\n\n: abs ( n -- |n| )\n dup 0< if negate then ;\n\n\\ TODO: accept\n\n: c, ( n -- )\n here c! 1 chars allot ;\n\n: char+ ( n1 -- n2 )\n 1+ ;\n\n: constant create , does> @ ;\n\n: decimal ( -- )\n 10 base ! ;\n\n: depth ( -- n )\n data_stack 100 cells + 'SP @ - /cell / 2 - ;\n\n: do ( n1 n2 -- ) ( R: -- loop-sys ) ( C: -- do-sys )\n postpone 2>r here ; immediate\n\n\\ TODO: environment?\n\\ TODO: evaluate\n\\ TODO: fill\n\\ TODO: fm/mod )\n\\ TODO: hold\n\n: j ( -- x1 ) ( R: x1 x2 x3 -- x1 x2 x3 )\n 'RP @ 3 cells + @ ;\n\n\\ TODO: leave\n\n: loop ( -- ) ( C: nest-sys -- )\n postpone 1 postpone (+loop)\n postpone 0branch ,\n postpone unloop ; immediate\n\n: lshift begin ?dup while 1- swap dup + swap repeat ;\n\n: rshift 1 begin over while dup + swap 1- swap repeat nip\n 2>r 0 1 begin r@ while\n r> r> 2dup swap dup + 2>r and if swap over + swap then dup +\n repeat r> r> 2drop drop ;\n\n: max ( x y -- max[x,y] )\n 2dup > if drop else nip then ;\n\n\\ Kernel: min\n\\ TODO: mod\n\\ TODO: move\n\n: (quit) ( R: ... -- )\n return_stack 100 cells + 'RP !\n 0 'source-id ! tib ''source ! #tib ''#source !\n postpone [\n begin\n\trefill\n while\n\tinterpret state @ 0= if .\" ok\" cr then\n repeat\n bye ;\n\n' (quit) ' quit >body cell+ !\n\n\\ TODO: s>d\n\\ TODO: sign\n\\ TODO: sm/rem\n\n: spaces ( n -- )\n 0 do space loop ;\n\n\\ TODO: u.\n\n: signbit ( -- n ) -1 1 rshift invert ;\n\n: xor ( x y -- x^y ) 2dup nand >r r@ nand swap r> nand nand ;\n\n: u< ( x y -- flag ) signbit xor swap signbit xor > ;\n\n\\ TODO: um/mod\n\n: variable ( \"word\" -- )\n create /cell allot ;\n\n: ['] \\ ( C: \"word\" -- )\n ' postpone literal ; immediate\n" }, { "path": "src/test/resources/samples/langs/Forth/enum.frt", "content": "\\ Implements ENUM.\n\n\\ Double DOES>!\n: enum create 0 , does> create dup @ 1 rot +! , does> @ ;\n\n\\ But this is simpler.\n: enum create 0 , does> dup @ constant 1 swap +! ;\n" }, { "path": "src/test/resources/samples/langs/Forth/hello-forth.forth", "content": ": HELLO ( -- )\n .\" Hello Forth (forth)!\" ; \n\nHELLO\n\n" }, { "path": "src/test/resources/samples/langs/Forth/hello-forth.fth", "content": ": HELLO ( -- )\n .\" Hello Forth (fth)!\" ; \n\nHELLO\n\n" }, { "path": "src/test/resources/samples/langs/Forth/macros.frt", "content": "\\ Simplifies compiling words.\n\n: [[ ; immediate\n: '<> >in @ ' swap >in ! <> ;\n: (]]) begin dup '<> while postpone postpone repeat drop ;\n: ]] ['] [[ (]]) ; immediate\n\n( Usage: : foo ]] dup * [[ ; immediate : bar 42 foo . ; )\n" }, { "path": "src/test/resources/samples/langs/Forth/tools.4TH", "content": "\\ -*- forth -*- Copyright 2004, 2013 Lars Brinkhoff\n\n( Tools words. )\n\n: .s ( -- )\n [char] < emit depth (.) .\" > \"\n 'SP @ >r r@ depth 1- cells +\n begin\n\tdup r@ <>\n while\n\tdup @ .\n\t/cell -\n repeat r> 2drop ;\n\n: ? @ . ;\n\n: c? c@ . ;\n\n: dump bounds do i ? /cell +loop cr ;\n\n: cdump bounds do i c? loop cr ;\n\n: again postpone branch , ; immediate\n\n: see-find ( caddr -- end xt )\n >r here lastxt @\n begin\n\tdup 0= abort\" Undefined word\"\n\tdup r@ word= if r> drop exit then\n\tnip dup >nextxt\n again ;\n\n: cabs ( char -- |char| ) dup 127 > if 256 swap - then ;\n\n: xt. ( xt -- )\n ( >name ) count cabs type ;\n\n: xt? ( xt -- flag )\n >r lastxt @ begin\n\t?dup\n while\n\tdup r@ = if r> 2drop -1 exit then\n\t>nextxt\n repeat r> drop 0 ;\n\n: disassemble ( x -- )\n dup xt? if\n ( >name ) count\n dup 127 > if .\" postpone \" then\n cabs type\n else\n .\n then ;\n\n: .addr dup . ;\n\n: see-line ( addr -- )\n cr .\" ( \" .addr .\" ) \" @ disassemble ;\n\n: see-word ( end xt -- )\n >r .\" : \" r@ xt.\n r@ >body do i see-line /cell +loop\n .\" ;\" r> c@ 127 > if .\" immediate\" then ;\n\n: see bl word see-find see-word cr ;\n\n: #body bl word see-find >body - ;\n\n: type-word ( end xt -- flag )\n xt. space drop 0 ;\n\n: traverse-dictionary ( in.. xt -- out.. )\n \\ xt execution: ( in.. end xt2 -- in.. 0 | in.. end xt2 -- out.. true )\n >r here lastxt @ begin\n\t?dup\n while\n\tr> 2dup >r >r execute\n\tif r> r> 2drop exit then\n\tr> dup >nextxt\n repeat r> 2drop ;\n\n: words ( -- )\n ['] type-word traverse-dictionary cr ;\n\n\\ ----------------------------------------------------------------------\n\n( Tools extension words. )\n\n\\ ;code\n\n\\ assembler\n\n\\ in kernel: bye\n\n\\ code\n\n\\ cs-pick\n\n\\ cs-roll\n\n\\ editor\n\n: forget ' dup >nextxt lastxt ! 'here ! reveal ;\n\n\\ Kernel: state\n\n\\ [else]\n\n\\ [if]\n\n\\ [then]\n\n\\ ----------------------------------------------------------------------\n\n( Forth2012 tools extension words. )\n\n\\ TODO: n>r\n\n\\ TODO: nr>\n\n\\ TODO: synonym\n\n: [undefined] bl-word find nip 0= ; immediate\n\n: [defined] postpone [undefined] invert ; immediate\n\n\\ ----------------------------------------------------------------------\n\n: @+ ( addr -- addr+/cell x ) dup cell+ swap @ ;\n\n: !+ ( x addr -- addr+/cell ) tuck ! cell+ ;\n\n: -rot swap >r swap r> ;\n" }, { "path": "src/test/resources/samples/langs/Forth/tools.fth", "content": "\\ -*- forth -*- Copyright 2004, 2013 Lars Brinkhoff\n\n( Tools words. )\n\n: .s ( -- )\n [char] < emit depth (.) .\" > \"\n 'SP @ >r r@ depth 1- cells +\n begin\n\tdup r@ <>\n while\n\tdup @ .\n\t/cell -\n repeat r> 2drop ;\n\n: ? @ . ;\n\n: c? c@ . ;\n\n: dump bounds do i ? /cell +loop cr ;\n\n: cdump bounds do i c? loop cr ;\n\n: again postpone branch , ; immediate\n\n: see-find ( caddr -- end xt )\n >r here lastxt @\n begin\n\tdup 0= abort\" Undefined word\"\n\tdup r@ word= if r> drop exit then\n\tnip dup >nextxt\n again ;\n\n: cabs ( char -- |char| ) dup 127 > if 256 swap - then ;\n\n: xt. ( xt -- )\n ( >name ) count cabs type ;\n\n: xt? ( xt -- flag )\n >r lastxt @ begin\n\t?dup\n while\n\tdup r@ = if r> 2drop -1 exit then\n\t>nextxt\n repeat r> drop 0 ;\n\n: disassemble ( x -- )\n dup xt? if\n ( >name ) count\n dup 127 > if .\" postpone \" then\n cabs type\n else\n .\n then ;\n\n: .addr dup . ;\n\n: see-line ( addr -- )\n cr .\" ( \" .addr .\" ) \" @ disassemble ;\n\n: see-word ( end xt -- )\n >r .\" : \" r@ xt.\n r@ >body do i see-line /cell +loop\n .\" ;\" r> c@ 127 > if .\" immediate\" then ;\n\n: see bl word see-find see-word cr ;\n\n: #body bl word see-find >body - ;\n\n: type-word ( end xt -- flag )\n xt. space drop 0 ;\n\n: traverse-dictionary ( in.. xt -- out.. )\n \\ xt execution: ( in.. end xt2 -- in.. 0 | in.. end xt2 -- out.. true )\n >r here lastxt @ begin\n\t?dup\n while\n\tr> 2dup >r >r execute\n\tif r> r> 2drop exit then\n\tr> dup >nextxt\n repeat r> 2drop ;\n\n: words ( -- )\n ['] type-word traverse-dictionary cr ;\n\n\\ ----------------------------------------------------------------------\n\n( Tools extension words. )\n\n\\ ;code\n\n\\ assembler\n\n\\ in kernel: bye\n\n\\ code\n\n\\ cs-pick\n\n\\ cs-roll\n\n\\ editor\n\n: forget ' dup >nextxt lastxt ! 'here ! reveal ;\n\n\\ Kernel: state\n\n\\ [else]\n\n\\ [if]\n\n\\ [then]\n\n\\ ----------------------------------------------------------------------\n\n( Forth2012 tools extension words. )\n\n\\ TODO: n>r\n\n\\ TODO: nr>\n\n\\ TODO: synonym\n\n: [undefined] bl-word find nip 0= ; immediate\n\n: [defined] postpone [undefined] invert ; immediate\n\n\\ ----------------------------------------------------------------------\n\n: @+ ( addr -- addr+/cell x ) dup cell+ swap @ ;\n\n: !+ ( x addr -- addr+/cell ) tuck ! cell+ ;\n\n: -rot swap >r swap r> ;\n" }, { "path": "src/test/resources/samples/langs/Fortran/bug-185631.f", "content": "! Codes/HYCOM/hycom/ATLb2.00/src_2.0.01_22_one/\n real onemu, twomu\n data onemu/0.0098/\n data twomu/1./\n data threemu/0.e9/\n end\n" }, { "path": "src/test/resources/samples/langs/Fortran/m_filt2d.F90", "content": "!! ----------------------------------------------------------------------------------------------------------------------------- !!\n!>\n!! 2D wavenumber filtering\n!!\n!! @copyright\n!! Copyright 2013-2018 Takuto Maeda. All rights reserved. This project is released under the MIT license.\n!<\n!! ----------------------------------------------------------------------------------------------------------------------------- !!\nmodule m_filt2d\n\n use m_std\n use m_fk\n implicit none\n public\n save\n\n\ncontains\n\n subroutine filt2d__lowpass ( nx, ny, dx, dy, img, kmax, np )\n\n integer, intent(in) :: nx\n integer, intent(in) :: ny\n real(SP), intent(in) :: dx\n real(SP), intent(in) :: dy\n real(SP), intent(inout) :: img(nx,ny)\n real(SP), intent(in) :: kmax\n integer, intent(in) :: np\n !! --\n integer :: nx2, ny2\n integer :: i, j\n real(DP), allocatable :: xdom(:,:)\n complex(DP), allocatable :: kdom(:,:)\n real(DP), allocatable :: kx(:), ky(:)\n real(SP) :: k\n real(SP) :: H\n !! ----\n\n !! power of 2\n nx2 = 2 ** ceiling( log(dble(nx))/log(2.0_SP) )\n ny2 = 2 ** ceiling( log(dble(ny))/log(2.0_SP) )\n\n allocate( xdom(nx2,ny2), kdom(nx2,ny2) )\n allocate( kx(nx2), ky(ny2) )\n\n !! copy data\n xdom(:,:) = 0.0_DP\n xdom(1:nx,1:ny) = dble( img(1:nx,1:ny) )\n\n !! wavenumber spectrum\n call fk__x2k_2d( nx2, ny2, dble(dx), dble(dy), xdom, kdom, kx, ky )\n\n !! filtering\n do j=1, ny2\n do i=1, nx2\n\n !! absolute value of wavenumber\n k = sqrt( kx(i)**2 + ky(j)**2 )\n\n !! filter response\n H = 1 / sqrt( 1.0_DP + (k/kmax)**(2*np) )\n kdom(i,j) = kdom(i,j) * H\n\n end do\n end do\n\n !! back to the space domain\n call fk__k2x_2d( nx2, ny2, dble(dx), dble(dy), kdom, xdom )\n\n !! restore filtered data\n img(1:nx,1:ny) = real( xdom(1:nx,1:ny) )\n\n !! release temporal memory\n deallocate( xdom, kdom, kx, ky )\n\n end subroutine filt2d__lowpass\n\n\n\nend module m_filt2d\n" }, { "path": "src/test/resources/samples/langs/Fortran/sample1.f", "content": "c comment\n* comment\n\n program main\n\n end\n\n subroutine foo( i, x, b )\n INTEGER i\n REAL x\n LOGICAL b\n\n if( i.ne.0 ) then\n call bar( -i )\n end if\n\n return\n end\n\n double complex function baz()\n\n baz = (0.0d0,0.0d0)\n\n return \n end\n" }, { "path": "src/test/resources/samples/langs/Fortran/sample1.for", "content": "c comment\n* comment\n\n program main\n\n end\n\n subroutine foo( i, x, b )\n INTEGER i\n REAL x\n LOGICAL b\n\n if( i.ne.0 ) then\n call bar( -i )\n end if\n\n return\n end\n\n double complex function baz()\n\n baz = (0.0d0,0.0d0)\n\n return \n end\n" }, { "path": "src/test/resources/samples/langs/Fortran/sample2.f", "content": " PROGRAM MAIN\n\n END\n\nC comment\n* comment\n\n SUBROUTINE foo( i, x, b )\n INTEGER i\n REAL x\n LOGICAL b\n\n IF( i.NE.0 ) THEN\n CALL bar( -i )\n END IF\n\n RETURN\n END\n\n DOUBLE COMPLEX FUNCTION baz()\n\n baz = (0.0d0,0.0d0)\n\n RETURN \n END\n" }, { "path": "src/test/resources/samples/langs/Fortran/sample3.F", "content": "c comment\n* comment\n\n program main\n\n end\n\n subroutine foo( i, x, b )\n INTEGER i\n REAL x\n LOGICAL b\n\n if( i.ne.0 ) then\n call bar( -i )\n end if\n\n return\n end\n\n double complex function baz()\n\n baz = (0.0d0,0.0d0)\n\n return \n end\n" }, { "path": "src/test/resources/samples/langs/Fortran/tst.f03", "content": "! ----------------------------------------------------------------------------------------------------------------------------- !!\n!>\n!! Testing: no real code\n!!\n!<\n!! ----------------------------------------------------------------------------------------------------------------------------- !!" }, { "path": "src/test/resources/samples/langs/Fortran/tst.f08", "content": "! ----------------------------------------------------------------------------------------------------------------------------- !!\n!>\n!! Testing: no real code\n!!\n!<\n!! ----------------------------------------------------------------------------------------------------------------------------- !!" }, { "path": "src/test/resources/samples/langs/Fortran/tst.f15", "content": "! ----------------------------------------------------------------------------------------------------------------------------- !!\n!>\n!! Testing: no real code\n!!\n!<\n!! ----------------------------------------------------------------------------------------------------------------------------- !!" }, { "path": "src/test/resources/samples/langs/Fortran/tst.f95", "content": "! ----------------------------------------------------------------------------------------------------------------------------- !!\n!>\n!! Testing: no real code\n!!\n!<\n!! ----------------------------------------------------------------------------------------------------------------------------- !!" }, { "path": "src/test/resources/samples/langs/FreeMarker/example.ftl", "content": "<#import \"layout.ftl\" as layout>\n\n<#assign results = [\n {\n \"title\": \"Example Result\",\n \"description\": \"Lorem ipsum dolor sit amet, pede id pellentesque, sollicitudin turpis sed in sed sed, libero dictum.\"\n }\n ] />\n\n<@layout.page title=\"FreeMarker Example\">\n <#if results?size == 0>\n There were no results.\n <#else>\n
    \n <#list results as result>\n
  • \n ${result.title}\n

    ${result.description}

    \n
    • \n \n
\n \n\n <#-- This is a FreeMarker comment -->\n <@currentTime />\n\n\n\n<#macro currentTime>\n ${.now?string.full}\n\n" }, { "path": "src/test/resources/samples/langs/FreeMarker/layout.ftl", "content": "<#ftl strip_text=true />\n\n<#macro page title>\n \n \n \n ${title}\n <@metaTags />\n \n \n <#nested />\n <@footer />\n \n \n\n\n\n<#---\n Default meta tags\n-->\n<#macro metaTags>\n <#compress>\n \n \n \n \n \n\n\n<#macro footer>\n

This page is using FreeMarker v${.version}

\n\n" }, { "path": "src/test/resources/samples/langs/Frege/CommandLineClock.fr", "content": "{-- \n This program displays the\n current time on stdandard output\n every other second.\n -}\n \nmodule examples.CommandLineClock where\n\ndata Date = native java.util.Date where\n native new :: () -> IO (MutableIO Date) -- new Date()\n native toString :: Mutable s Date -> ST s String -- d.toString()\n\n--- 'IO' action to give us the current time as 'String'\ncurrent :: IO String\ncurrent = do\n d <- Date.new ()\n d.toString\n\n{- \n \"java.lang.Thread.sleep\" takes a \"long\" and\n returns nothing, but may throw an InterruptedException.\n This is without doubt an IO action.\n \n public static void sleep(long millis)\n throws InterruptedException\n \n Encoded in Frege:\n - argument type long Long\n - result void ()\n - does IO IO ()\n - throws ... throws ....\n \n-}\n-- .... defined in frege.java.Lang\n-- native sleep java.lang.Thread.sleep :: Long -> IO () throws InterruptedException\n\n \nmain args = \n forever do\n current >>= print\n print \"\\r\"\n stdout.flush\n Thread.sleep 999\n " }, { "path": "src/test/resources/samples/langs/Frege/Concurrent.fr", "content": "module examples.Concurrent where\n\nimport System.Random\nimport Java.Net (URL)\nimport Control.Concurrent as C\n\nmain2 args = do\n m <- newEmptyMVar\n forkIO do\n m.put 'x'\n m.put 'y' \n m.put 'z'\n replicateM_ 3 do\n c <- m.take\n print \"got: \"\n println c \n \n \nexample1 = do\n forkIO (replicateM_ 100000 (putChar 'a'))\n replicateM_ 100000 (putChar 'b')\n\nexample2 = do\n s <- getLine\n case s.long of\n Right n -> forkIO (setReminder n) >> example2\n Left _ -> println (\"exiting ...\")\n \nsetReminder :: Long -> IO ()\nsetReminder n = do\n println (\"Ok, I remind you in \" ++ show n ++ \" seconds\")\n Thread.sleep (1000L*n)\n println (show n ++ \" seconds is up!\")\n\ntable = \"table\"\n \nmainPhil _ = do\n [fork1,fork2,fork3,fork4,fork5] <- mapM MVar.new [1..5]\n forkIO (philosopher \"Kant\" fork5 fork1)\n forkIO (philosopher \"Locke\" fork1 fork2)\n forkIO (philosopher \"Wittgenstein\" fork2 fork3)\n forkIO (philosopher \"Nozick\" fork3 fork4)\n forkIO (philosopher \"Mises\" fork4 fork5)\n return () \n\nphilosopher :: String -> MVar Int -> MVar Int -> IO ()\nphilosopher me left right = do\n g <- Random.newStdGen\n let phil g = do\n let (tT,g1) = Random.randomR (60L, 120L) g\n (eT, g2) = Random.randomR (80L, 160L) g1\n thinkTime = 300L * tT\n eatTime = 300L * eT\n \n println(me ++ \" is going to the dining room and takes his seat.\") \n fl <- left.take \n println (me ++ \" takes up left fork (\" ++ show fl ++ \")\")\n rFork <- right.poll\n case rFork of\n Just fr -> do \n println (me ++ \" takes up right fork. (\" ++ show fr ++ \")\") \n println (me ++ \" is going to eat for \" ++ show eatTime ++ \"ms\")\n Thread.sleep eatTime\n println (me ++ \" finished eating.\")\n right.put fr\n println (me ++ \" took down right fork.\")\n left.put fl\n println (me ++ \" took down left fork.\")\n table.notifyAll \n println(me ++ \" is going to think for \" ++ show thinkTime ++ \"ms.\")\n Thread.sleep thinkTime\n phil g2\n Nothing -> do\n println (me ++ \" finds right fork is already in use.\")\n left.put fl\n println (me ++ \" took down left fork.\")\n table.notifyAll\n println (me ++ \" is going to the bar to await notifications from table.\")\n table.wait\n println (me ++ \" got notice that something changed at the table.\")\n phil g2\n \n inter :: InterruptedException -> IO ()\n inter _ = return () \n \n phil g `catch` inter\n\n \ngetURL xx = do\n url <- URL.new xx \n con <- url.openConnection\n con.connect\n is <- con.getInputStream\n typ <- con.getContentType\n -- stderr.println (\"content-type is \" ++ show typ) \n ir <- InputStreamReader.new is (fromMaybe \"UTF-8\" (charset typ))\n `catch` unsupportedEncoding is \n br <- BufferedReader.new ir\n br.getLines\n where\n unsupportedEncoding :: InputStream -> UnsupportedEncodingException -> IO InputStreamReader\n unsupportedEncoding is x = do\n stderr.println x.catched\n InputStreamReader.new is \"UTF-8\"\n \n charset ctyp = do\n typ <- ctyp\n case typ of\n m~´charset=(\\S+)´ -> m.group 1\n _ -> Nothing\n\n \ntype SomeException = Throwable\n\nmain [\"dining\"] = mainPhil []\n \nmain _ = do\n m1 <- MVar.newEmpty\n m2 <- MVar.newEmpty\n m3 <- MVar.newEmpty\n \n forkIO do\n r <- (catchAll . getURL) \"http://www.wikipedia.org/wiki/Haskell\"\n m1.put r\n \n forkIO do\n r <- (catchAll . getURL) \"htto://www.wikipedia.org/wiki/Java\"\n m2.put r\n \n forkIO do\n r <- (catchAll . getURL) \"http://www.wikipedia.org/wiki/Frege\"\n m3.put r\n \n r1 <- m1.take\n r2 <- m2.take\n r3 <- m3.take\n println (result r1, result r2, result r3)\n -- case r3 of\n -- Right ss -> mapM_ putStrLn ss\n -- Left _ -> return ()\n where\n result :: (SomeException|[String]) -> (String|Int)\n result (Left x) = Left x.getClass.getName\n result (Right y) = (Right . sum . map length) y\n -- mapM_ putStrLn r2\n\n " }, { "path": "src/test/resources/samples/langs/Frege/Sudoku.fr", "content": "package examples.Sudoku where\n\nimport Data.TreeMap (Tree, keys)\nimport Data.List as DL hiding (find, union)\n\n\ntype Element = Int -- 1,2,3,4,5,6,7,8,9\ntype Zelle = [Element] -- set of candidates\ntype Position = Int -- 0..80\ntype Feld = (Position, Zelle)\ntype Brett = [Feld]\n\n--- data type for assumptions and conclusions\ndata Assumption =\n !ISNOT Position Element\n | !IS Position Element\n\n\nderive Eq Assumption\nderive Ord Assumption\ninstance Show Assumption where\n show (IS p e) = pname p ++ \"=\" ++ e.show\n show (ISNOT p e) = pname p ++ \"/\" ++ e.show\n\nshowcs cs = joined \" \" (map Assumption.show cs)\n\nelements :: [Element] -- all possible elements\nelements = [1 .. 9]\n\n{-\n a b c d e f g h i\n 0 1 2 | 3 4 5 | 6 7 8 1\n 9 10 11 |12 13 14 |15 16 17 2\n 18 19 20 |21 22 23 |24 25 26 3\n ---------|---------|--------\n 27 28 29 |30 31 32 |33 34 35 4\n 36 37 38 |39 40 41 |42 43 44 5\n 45 46 47 |48 49 50 |51 52 53 6\n ---------|---------|--------\n 54 55 56 |57 58 59 |60 61 62 7\n 63 64 65 |66 67 68 |69 70 71 8\n 72 73 74 |75 76 77 |78 79 80 9\n-}\n\npositions :: [Position] -- all possible positions\npositions = [0..80]\nrowstarts :: [Position] -- all positions where a row is starting\nrowstarts = [0,9,18,27,36,45,54,63,72]\ncolstarts :: [Position] -- all positions where a column is starting\ncolstarts = [0,1,2,3,4,5,6,7,8]\nboxstarts :: [Position] -- all positions where a box is starting\nboxstarts = [0,3,6,27,30,33,54,57,60]\nboxmuster :: [Position] -- pattern for a box, by adding upper left position results in real box\nboxmuster = [0,1,2,9,10,11,18,19,20]\n\n\n--- extract field for position\ngetf :: Brett -> Position -> Feld\ngetf (f:fs) p\n | fst f == p = f\n | otherwise = getf fs p\ngetf [] p = (p,[])\n\n\n--- extract cell for position\ngetc :: Brett -> Position -> Zelle\ngetc b p = snd (getf b p)\n\n--- compute the list of all positions that belong to the same row as a given position\nrow :: Position -> [Position]\nrow p = [z..(z+8)] where z = (p `quot` 9) * 9\n\n--- compute the list of all positions that belong to the same col as a given position\ncol :: Position -> [Position]\ncol p = map (c+) rowstarts where c = p `mod` 9\n\n--- compute the list of all positions that belong to the same box as a given position\nbox :: Position -> [Position]\nbox p = map (z+) boxmuster where\n ri = p `div` 27 * 27 -- 0, 27 or 54, depending on row\n ci = p `mod` 9 -- column index 0..8, 0,1,2 is left, 3,4,5 is middle, 6,7,8 is right\n cs = ci `div` 3 * 3 -- 0, 3 or 6\n z = ri + cs\n\n--- check if candidate set has exactly one member, i.e. field has been solved\nsingle :: Zelle -> Bool\nsingle [_] = true\nsingle _ = false\n\nunsolved :: Zelle -> Bool\nunsolved [_] = false\nunsolved _ = true\n\n-- list of rows, cols, boxes\nallrows = map row rowstarts\nallcols = map col colstarts\nallboxs = map box boxstarts\nallrcb = zip (repeat \"row\") allrows\n ++ zip (repeat \"col\") allcols\n ++ zip (repeat \"box\") allboxs\n\n\ncontainers :: [(Position -> [Position], String)]\ncontainers = [(row, \"row\"), (col, \"col\"), (box, \"box\")]\n\n-- ----------------- PRINTING ------------------------------------\n-- printable coordinate of field, upper left is a1, lower right is i9\npname p = packed [chr (ord 'a' + p `mod` 9), chr (ord '1' + p `div` 9)]\n\n-- print board\nprintb b = mapM_ p1line allrows >> println \"\"\n where\n p1line row = do\n print (joined \"\" (map pfld line))\n where line = map (getc b) row\n\n-- print field (brief)\n-- ? = no candidate\n-- 5 = field is 5\n-- . = some candidates\npfld [] = \"?\"\npfld [x] = show x\npfld zs = \"0\"\n\n-- print initial/final board\nresult msg b = do\n println (\"Result: \" ++ msg)\n print (\"Board: \")\n printb b\n return b\n\nres012 b = case concatMap (getc b) [0,1,2] of\n [a,b,c] -> a*100+b*10+c\n _ -> 9999999\n\n-- -------------------------- BOARD ALTERATION ACTIONS ---------------------------------\n-- print a message about what is done to the board and return the new board\nturnoff1 :: Position -> Zelle -> Brett -> IO Brett\nturnoff1 i off b\n | single nc = do\n -- print (pname i)\n -- print \": set to \"\n -- print (head nc)\n -- println \" (naked single)\"\n return newb\n | otherwise = return newb\n where\n cell = getc b i\n nc = filter (`notElem` off) cell\n newb = (i, nc) : [ f | f <- b, fst f != i ]\n\nturnoff :: Int -> Zelle -> String -> Brett -> IO Brett\nturnoff i off msg b = do\n -- print (pname i)\n -- print \": set to \"\n -- print nc\n -- print \" by clearing \"\n -- print off\n -- print \" \"\n -- println msg\n return newb\n where\n cell = getc b i\n nc = filter (`notElem` off) cell\n newb = (i, nc) : [ f | f <- b, fst f != i ]\n\nturnoffh ps off msg b = foldM toh b ps\n where\n toh b p = turnoff p off msg b\n\nsetto :: Position -> Element -> String -> Brett -> IO Brett\nsetto i n cname b = do\n -- print (pname i)\n -- print \": set to \"\n -- print n\n -- print \" (hidden single in \"\n -- print cname\n -- println \")\"\n return newb\n where\n nf = [n]\n newb = (i, nf) : [ f | f <- b, fst f != i ]\n\n\n-- ----------------------------- SOLVING STRATEGIES ---------------------------------------------\n-- reduce candidate sets that contains numbers already in same row, col or box\n-- This finds (and logs) NAKED SINGLEs in passing.\nreduce b = [ turnoff1 p sss | (p,cell) <- b, -- for each field\n unsolved cell, -- with more than 1 candidate\n -- single fields in containers that are candidates of that field\n sss = [ s | (rcb, _) <- containers, [s] <- map (getc b) (rcb p), s `elem` cell],\n sss != [] ] -- collect field index, elements to remove from candidate set\n\n-- look for a number that appears in exactly 1 candidate set of a container\n-- this number can go in no other place (HIDDEN SINGLE)\nhiddenSingle b = [ setto i n cname | -- select index, number, containername\n (cname, rcb) <- allrcb, -- FOR rcb IN allrcb\n n <- elements, -- FOR n IN elements\n fs = filter (unsolved • snd) (map (getf b) rcb),\n occurs = filter ((n `elem`) • snd) fs,\n length occurs == 1,\n (i, _) <- occurs ]\n\n-- look for NAKED PAIRS, TRIPLES, QUADS\nnakedPair n b = [ turnoff p t (\"(naked tuple in \" ++ nm ++ \")\") | -- SELECT pos, tuple, name\n -- n <- [2,3,4], // FOR n IN [2,3,4]\n (nm, rcb) <- allrcb, -- FOR rcb IN containers\n fs = map (getf b) rcb, -- let fs = fields for rcb positions\n u = (fold union [] . filter unsolved . map snd) fs, -- let u = union of non single candidates\n t <- n `outof` u, -- FOR t IN n-tuples\n hit = (filter ((`subset` t) . snd) . filter (unsolved . snd)) fs,\n length hit == n,\n (p, cell) <- fs,\n p `notElem` map fst hit,\n any (`elem` cell) t\n ]\n\n-- look for HIDDEN PAIRS, TRIPLES or QUADS\nhiddenPair n b = [ turnoff p off (\"(hidden \" ++ show t ++ \" in \" ++ nm ++ \")\") | -- SELECT pos, tuple, name\n -- n <- [2,3,4], // FOR n IN [2,3,4]\n (nm, rcb) <- allrcb, -- FOR rcb IN containers\n fs = map (getf b) rcb, -- let fs = fields for rcb positions\n u = (fold union [] . filter ((>1) . length) . map snd) fs, -- let u = union of non single candidates\n t <- n `outof` u, -- FOR t IN n-tuples\n hit = (filter (any ( `elem` t) . snd) . filter (unsolved . snd)) fs,\n length hit == n,\n off = (fold union [] . map snd) hit `minus` t,\n off != [],\n (p, cell) <- hit,\n ! (cell `subset` t)\n ]\n\na `subset` b = all (`elem` b) a\na `union` b = uniq (sort (a ++ b))\na `minus` b = filter (`notElem` b) a\na `common` b = filter (`elem` b) a\nn `outof` as\n | length as < n = []\n | [] <- as = []\n | 1 >= n = map (:[]) as\n | (a:bs) <- as = map (a:) ((n-1) `outof` bs) ++ (n `outof` bs)\n | otherwise = undefined -- cannot happen because either as is empty or not\n\nsame f a b = b `elem` f a\n\nintersectionlist = [(allboxs, row, \"box/row intersection\"), (allboxs, col, \"box/col intersection\"),\n (allrows ++ allcols, box, \"line/box intersection\")]\nintersections b = [\n turnoff pos [c] reason | -- SELECT position, candidate, reson\n (from, container, reason) <- intersectionlist,\n rcb <- from,\n fs = (filter (unsolved . snd) . map (getf b)) rcb, -- fs = fields in from with more than 1 candidate\n c <- (fold union [] • map snd) fs, -- FOR c IN union of candidates\n cpos = (map fst • filter ((c `elem`) • snd)) fs, -- cpos = positions where c occurs\n cpos != [], -- WHERE cpos is not empty\n all (same container (head cpos)) (tail cpos), -- WHERE all positions are in the intersection\n -- we can remove all occurences of c that are in container, but not in from\n (pos, cell) <- map (getf b) (container (head cpos)),\n c `elem` cell,\n pos `notElem` rcb ]\n\n\n-- look for an XY Wing\n-- - there exists a cell A with candidates X and Y\n-- - there exists a cell B with candidates X and Z that shares a container with A\n-- - there exists a cell C with candidates Y and Z that shares a container with A\n-- reasoning\n-- - if A is X, B will be Z\n-- - if A is Y, C will be Z\n-- - since A will indeed be X or Y -> B or C will be Z\n-- - thus, no cell that can see B and C can be Z\nxyWing board = [ turnoff p [z] (\"xy wing \" ++ pname b ++ \" \" ++ pname c ++ \" because of \" ++ pname a) |\n (a, [x,y]) <- board, -- there exists a cell a with candidates x and y\n rcba = map (getf board) (row a ++ col a ++ box a), -- rcba = all fields that share a container with a\n (b, [b1, b2]) <- rcba,\n b != a,\n b1 == x && b2 != y || b2 == x && b1 != y, -- there exists a cell B with candidates x and z\n z = if b1 == x then b2 else b1,\n (c, [c1, c2]) <- rcba,\n c != a, c!= b,\n c1 == y && c2 == z || c1 == z && c2 == y, -- there exists a cell C with candidates y and z\n ps = (uniq . sort) ((row b ++ col b ++ box b) `common` (row c ++ col c ++ box c)),\n -- remove z in ps\n (p, cs) <- map (getf board) ps,\n p != b, p != c,\n z `elem` cs ]\n\n-- look for a N-Fish (2: X-Wing, 3: Swordfish, 4: Jellyfish)\n-- When all candidates for a particular digit in N rows are located\n-- in only N columns, we can eliminate all candidates from those N columns\n-- which are not located on those N rows\nfish n board = fish \"row\" allrows row col ++ fish \"col\" allcols col row where\n fishname 2 = \"X-Wing\"\n fishname 3 = \"Swordfish\"\n fishname 4 = \"Jellyfish\"\n fishname _ = \"unknown fish\"\n fish nm allrows row col = [ turnoff p [x] (fishname n ++ \" in \" ++ nm ++ \" \" ++ show (map (pname . head) rset)) |\n rset <- n `outof` allrows, -- take n rows (or cols)\n x <- elements, -- look for certain number\n rflds = map (filter ((>1) . length . snd) . map (getf board)) rset, -- unsolved fields in the rowset\n colss = (map (map (head . col . fst) . filter ((x `elem`) . snd)) rflds), -- where x occurs in candidates\n all ((>1) . length) colss, -- x must appear in at least 2 cols\n cols = fold union [] colss,\n length cols == n,\n cstart <- cols,\n (p, cell) <- map (getf board) (col cstart),\n x `elem` cell,\n all (p `notElem`) rset]\n\n\n-- compute immediate consequences of an assumption of the form (p `IS` e) or (p `ISNOT` e)\nconseq board (IS p e) = uniq (sort ([ p `ISNOT` x | x <- getc board p, x != e ] ++\n [ a `ISNOT` e |\n (a,cs) <- map (getf board) (row p ++ col p ++ box p),\n a != p,\n e `elem` cs\n ]))\nconseq board (ISNOT p e) = uniq (sort ([ p `IS` x | cs = getc board p, length cs == 2, x <- cs, x != e ] ++\n [ a `IS` e |\n cp <- [row p, box p, col p],\n as = (filter ((e `elem`) . getc board) . filter (p!=)) cp,\n length as == 1,\n a = head as\n ]))\n\n-- check if two assumptions contradict each other\ncontradicts (IS a x) (IS b y) = a==b && x!=y\ncontradicts (IS a x) (ISNOT b y) = a==b && x==y\ncontradicts (ISNOT a x) (IS b y) = a==b && x==y\ncontradicts (ISNOT _ _) (ISNOT _ _) = false\n\n-- get the Position of an Assumption\naPos (IS p _) = p\naPos (ISNOT p _) = p\n\n-- get List of elements that must be turned off when assumption is true/false\ntoClear board true (IS p x) = filter (x!=) (getc board p)\ntoClear board false (IS p x) = [x]\ntoClear board true (ISNOT p x) = [x]\ntoClear board false (ISNOT p x) = filter (x!=) (getc board p)\n\n\n-- look for assumptions whose implications contradict themself\nchain board paths = [ solution a (head cs) (reverse cs) |\n (a, css) <- paths,\n cs <- take 1 [ cs | cs <- css, contradicts a (head cs) ]\n ]\n where\n solution a c cs = turnoff (aPos a) (toClear board false a) reason where\n reason = \"Assumption \" ++ show a ++ \" implies \" ++ show c ++ \"\\n\\t\"\n ++ showcs cs ++ \"\\n\\t\"\n ++ \"Therefore, \" ++ show a ++ \" must be false.\"\n\n-- look for an assumption that yields to contradictory implications\n-- this assumption must be false\nchainContra board paths = [ solution a (reverse pro) (reverse contra) |\n (a, css) <- paths, -- FOR ALL assumptions \"a\" with list of conlusions \"css\"\n (pro, contra) <- take 1 [ (pro, contra) |\n pro <- (uniqBy (using head) . sortBy (comparing head)) css, -- FOR ALL conslusion chains \"pro\"\n c = head pro, -- LET \"c\" BE the final conclusion\n contra <- take 1 (filter ((contradicts c) . head) css) -- THE FIRST conclusion that contradicts c\n ]\n ]\n where\n solution a pro con = turnoff (aPos a) (toClear board false a) reason where\n reason = (\"assumption \" ++ show a ++ \" leads to contradictory conclusions\\n\\t\"\n ++ showcs pro ++ \"\\n\\t\" ++ showcs con)\n\n\n\n-- look for a common implication c of some assumptions ai, where at least 1 ai is true\n-- so that (a0 OR a1 OR a2 OR ...) IMPLIES c\n-- For all cells pi in same container that have x as candidate, we can construct (p0==x OR p1==x OR ... OR pi==x)\n-- For a cell p with candidates ci, we can construct (p==c0 OR p==c1)\ncellRegionChain board paths = [ solution b as (map head os) |\n as <- cellas ++ regionas, -- one of as must be true\n iss = filter ((`elem` as) . fst) paths, -- the implications for as\n (a, ass) <- take 1 iss, -- implications for first assumption\n fs <- (uniqBy (using head) . sortBy (comparing head)) ass,\n b = head fs, -- final conclusions of first assumption\n os = [fs] : map (take 1 . filter ((b==) . head) . snd) (tail iss), -- look for implications with same conclusion\n all ([]!=) os]\n where\n cellas = [ map (p `IS`) candidates | (p, candidates@(_:_:_)) <- board ]\n regionas = [ map (`IS` e) ps |\n region <- map (map (getf board)) (allrows ++ allcols ++ allboxs),\n e <- elements,\n ps = map fst (filter ((e `elem`) . snd) region),\n length ps > 1 ]\n solution b as oss = turnoff (aPos b) (toClear board true b) reason where\n reason = \"all of the assumptions \" ++ joined \", \" (map show as) ++ \" imply \" ++ show b ++ \"\\n\\t\"\n ++ joined \"\\n\\t\" (map (showcs . reverse) oss) ++ \"\\n\\t\"\n ++ \"One of them must be true, so \" ++ show b ++ \" must be true.\"\n\n\n{-\n Wir brauchen für einige Funktionen eine Datenstruktur wie\n [ (Assumption, [[Assumption]]) ]\n d.i. eine Liste von möglichen Annahmen samt aller Schlußketten.\n Idealerweise sollte die Schlußkette in umgekehrter Reihenfolge vorliegen,\n dann kann man einfach finden:\n - Annahmen, die zum Selbstwiderspruch führen.\n - alles, was aus einer bestimmten Annahme folgt (map (map head) [[a]])\n -...\n-}\n--- Liste aller Annahmen für ein bestimmtes Brett\nassumptions :: Brett -> [Assumption]\nassumptions board = [ a |\n (p, cs) <- board,\n !(single cs),\n a <- map (ISNOT p) cs ++ map (IS p) cs ]\n\nconsequences :: Brett -> [Assumption] -> [[Assumption]]\nconsequences board as = map (conseq board) as\n\nacstree :: Brett -> Tree Assumption [Assumption]\nacstree board = Tree.fromList (zip as cs)\n where\n as = assumptions board\n cs = consequences board as\n\n-- bypass maybe on tree lookup\nfind :: Tree Assumption [Assumption] -> Assumption -> [Assumption]\nfind t a\n | Just cs <- t.lookup a = cs\n | otherwise = error (\"no consequences for \" ++ show a)\n\n-- for performance resons, we confine ourselves to implication chains of length 20 per assumption\nmkPaths :: Tree Assumption [Assumption] -> [ (Assumption, [[Assumption]]) ]\nmkPaths acst = map impl (keys acst) -- {[a1], [a2], [a3] ]\n where\n -- [Assumption] -> [(a, [chains, ordered by length]\n impl a = (a, impls [[a]])\n impls ns = (take 1000 • concat • takeUntil null • iterate expandchain) ns\n -- expandchain :: [[Assumption]] -> [[Assumption]]\n expandchain css = [ (n:a:as) |\n (a : as) <- css, -- list of assumptions\n n <- find acst a, -- consequences of a\n n `notElem` as -- avoid loops\n ]\n -- uni (a:as) = a : uni (filter ((head a !=) • head) as)\n -- uni [] = empty\n -- empty = []\n\n\n-- ------------------ SOLVE A SUDOKU --------------------------\n-- Apply all available strategies until nothing changes anymore\n-- Strategy functions are supposed to return a list of\n-- functions, which, when applied to a board, give a changed board.\n-- When a strategy does not find anything to alter,\n-- it returns [], and the next strategy can be tried.\nsolve b\n | all (single . snd) b = result \"Solved\" b\n | any (([]==) . snd) b = result \"not solvable\" b\n | res@(_:_) <- reduce b = apply b res >>=solve -- compute smallest candidate sets\n -- comment \"candidate sets are up to date\" = ()\n | res@(_:_) <- hiddenSingle b = apply b res >>= solve -- find HIDDEN SINGLES\n -- comment \"no more hidden singles\" = ()\n | res@(_:_) <- intersections b = apply b res >>= solve -- find locked candidates\n -- comment \"no more intersections\" = ()\n | res@(_:_) <- nakedPair 2 b = apply b res >>= solve -- find NAKED PAIRS, TRIPLES or QUADRUPELS\n -- comment \"no more naked pairs\" = ()\n | res@(_:_) <- hiddenPair 2 b = apply b res >>= solve -- find HIDDEN PAIRS, TRIPLES or QUADRUPELS\n -- comment \"no more hidden pairs\" = ()\n -- res@(_:_) <- nakedPair 3 b = apply b res >>= solve // find NAKED PAIRS, TRIPLES or QUADRUPELS\n -- | comment \"no more naked triples\" = ()\n -- res@(_:_) <- hiddenPair 3 b = apply b res >>= solve // find HIDDEN PAIRS, TRIPLES or QUADRUPELS\n -- | comment \"no more hidden triples\" = ()\n -- res@(_:_) <- nakedPair 4 b = apply b res >>=solve // find NAKED PAIRS, TRIPLES or QUADRUPELS\n -- | comment \"no more naked quadruples\" = ()\n -- res@(_:_) <- hiddenPair 4 b = apply b res >>=solve // find HIDDEN PAIRS, TRIPLES or QUADRUPELS\n -- | comment \"no more hidden quadruples\" = ()\n | res@(_:_) <- xyWing b = apply b res >>=solve -- find XY WINGS\n -- comment \"no more xy wings\" = ()\n | res@(_:_) <- fish 2 b = apply b res >>=solve -- find 2-FISH\n -- comment \"no more x-wings\" = ()\n -- res@(_:_) <- fish 3 b = apply b res >>=solve // find 3-FISH\n -- | comment \"no more swordfish\" = ()\n -- res@(_:_) <- fish 4 b = apply b res >>=solve // find 4-FISH\n -- | comment \"no more jellyfish\" = ()\n -- | comment pcomment = ()\n | res@(_:_) <- chain b paths = apply b (take 9 res) >>= solve -- find forcing chains\n | res@(_:_) <- cellRegionChain b paths = apply b (take 9 res) >>= solve -- find common conclusion for true assumption\n | res@(_:_) <- chainContra b paths = apply b (take 9 res) >>= solve -- find assumptions that allow to infer both a and !a\n -- comment \"consistent conclusions only\" = ()\n\n | otherwise = result \"ambiguous\" b\n where\n apply brd fs = foldM (\\b\\f -> f b) brd fs\n paths = mkPaths (acstree b)\n -- pcomment = show (length paths) ++ \" assumptions with \" ++ show (fold (+) 0 (map (length <~ snd) paths))\n -- ++ \" implication chains\"\n\n-- comment com = do stderr << com << \"\\n\" for false\n-- log com = do stderr << com << \"\\n\" for true\n\n--- turn a string into a row\nmkrow :: String -> [Zelle]\nmkrow s = mkrow1 xs\n where\n xs = s ++ \"---------\" -- make sure at least 9 elements\n mkrow1 xs = (take 9 • filter ([]!=) • map f • unpacked) xs\n f x | x >= '1' && x <= '9' = [ord x - ord '0']\n | x == ' ' = [] -- ignored\n | otherwise = elements\n\nmain [\"-h\"] = main []\nmain [\"-help\"] = main []\nmain [] = do\n mapM_ stderr.println [\n \"usage: java Sudoku file ...\",\n \" java Sudoku position\",\n \"where position is a 81 char string consisting of digits\",\n \"One can get such a string by going to\",\n \"http://www.sudokuoftheday.com/pages/s-o-t-d.php\",\n \"Right click on the puzzle and open it in new tab\",\n \"Copy the 81 digits from the URL in the address field of your browser.\",\n \"\",\n \"There is also a file with hard sudokus in examples/top95.txt\\n\"]\n return ()\n\n\nmain [s@#^[0-9\\W]{81}$#] = solve board >> return ()\n where\n board = zip positions felder\n felder = decode s\n\nmain files = forM_ files sudoku\n where\n sudoku file = do\n br <- openReader file\n lines <- BufferedReader.getLines br\n bs <- process lines\n ss <- mapM (\\b -> print \"Puzzle: \" >> printb b >> solve b) bs\n println (\"Euler: \" ++ show (sum (map res012 ss)))\n return ()\n\n-- \"--3-\" => [1..9, 1..9, [3], 1..9]\ndecode s = map candi (unpacked s) where\n candi c | c >= '1' && c <= '9' = [(ord c - ord '0')]\n | otherwise = elements\nprocess [] = return []\nprocess (s:ss)\n | length s == 81 = consider b1\n | length s == 9,\n length acht == 8,\n all ((9==) • length) acht = consider b2\n | otherwise = do\n stderr.println (\"skipped line: \" ++ s)\n process ss\n where\n acht = take 8 ss\n neun = fold (++) \"\" (s:acht)\n b1 = zip positions (decode s)\n b2 = zip positions (decode neun)\n consider b = do\n -- print \"Puzzle: \"\n -- printb b\n bs <- process ss\n return (b:bs)\n\n" }, { "path": "src/test/resources/samples/langs/Frege/SwingExamples.fr", "content": "package examples.SwingExamples where\n\nimport Java.Awt (ActionListener)\nimport Java.Swing\n\n\nmain _ = do\n rs <- mapM Runnable.new [helloWorldGUI, buttonDemoGUI, celsiusConverterGUI]\n mapM_ invokeLater rs\n println \"Hit enter to end ....\"\n s <- getLine\n return ()\n\ncelsiusConverterGUI = do\n tempTextField <- JTextField.new()\n celsiusLabel <- JLabel.new ()\n convertButton <- JButton.new ()\n fahrenheitLabel <- JLabel.new () \n frame <- JFrame.new ()\n frame.setDefaultCloseOperation JFrame.dispose_on_close\n frame.setTitle \"Celsius Converter\"\n celsiusLabel.setText \"Celsius\"\n convertButton.setText \"Convert\"\n let convertButtonActionPerformed _ = do\n celsius <- tempTextField.getText\n case celsius.double of\n Left _ -> fahrenheitLabel.setText (\"not a valid number: \" ++ celsius)\n Right c -> fahrenheitLabel.setText (show (c*1.8 + 32.0).long ++ \" Fahrenheit\") \n return ()\n ActionListener.new convertButtonActionPerformed >>= convertButton.addActionListener\n fahrenheitLabel.setText \"Fahrenheit\"\n contentPane <- frame.getContentPane\n layout <- GroupLayout.new contentPane\n contentPane.setLayout layout\n -- TODO continue\n -- http://docs.oracle.com/javase/tutorial/displayCode.html?code=http://docs.oracle.com/javase/tutorial/uiswing/examples/learn/CelsiusConverterProject/src/learn/CelsiusConverterGUI.java\n frame.pack\n frame.setVisible true\n\nhelloWorldGUI = do\n frame <- JFrame.new \"Hello World Frege\"\n frame.setDefaultCloseOperation(JFrame.dispose_on_close)\n label <- JLabel.new \"Hello World!\"\n cp <- frame.getContentPane\n cp.add label\n frame.pack\n frame.setVisible true\n\nbuttonDemoGUI = do\n frame <- JFrame.new \"Button Demo\"\n frame.setDefaultCloseOperation(JFrame.dispose_on_close)\n newContentPane <- JPanel.new ()\n b1::JButton <- JButton.new \"Disable middle button\"\n b1.setVerticalTextPosition SwingConstants.center\n b1.setHorizontalTextPosition SwingConstants.leading\n b2::JButton <- JButton.new \"Middle button\"\n b2.setVerticalTextPosition SwingConstants.center\n b2.setHorizontalTextPosition SwingConstants.leading\n b3::JButton <- JButton.new \"Enable middle button\"\n b3.setVerticalTextPosition SwingConstants.center\n b3.setHorizontalTextPosition SwingConstants.leading\n b3.setEnabled false\n let action1 _ = do\n b2.setEnabled false\n b1.setEnabled false\n b3.setEnabled true\n action3 _ = do\n b2.setEnabled true\n b1.setEnabled true\n b3.setEnabled false\n ActionListener.new action1 >>= b1.addActionListener\n ActionListener.new action3 >>= b3.addActionListener \n newContentPane.add b1\n newContentPane.add b2\n newContentPane.add b3\n newContentPane.setOpaque true\n frame.setContentPane newContentPane\n frame.pack\n frame.setVisible true\n" }, { "path": "src/test/resources/samples/langs/G-code/duettest.g", "content": "; RepRapPro Ormerod\n; Board test GCodes\nM111 S1; Debug on\nG21 ; mm\nG90 ; Absolute positioning\nM83 ; Extrusion relative\nM906 X800 Y800 Z800 E800 ; Motor currents (mA)\nT0 ; Extruder 0\nG1 X50 F500\nG1 X0\nG4 P500\nG1 Y50 F500\nG1 Y0\nG4 P500\nG1 Z20 F200\nG1 Z0\nG4 P500\nG1 E20 F200\nG1 E-20\nG4 P500\nM106 S255\nG4 P500\nM106 S0\nG4 P500\nM105\nG10 P0 S100\nT0\nM140 S100\nG4 P5000\nM105\nG4 P5000\nM105\nG4 P5000\nM105\nG4 P5000\nM105\nG4 P5000\nM105\nG4 P5000\nM105\nG4 P5000\nM105\nG4 P5000\nM105\nG4 P5000\nM105\nG4 P5000\nM105\nG4 P5000\nM105\nG4 P5000\nM105\nM0\n\n\n\n\n" }, { "path": "src/test/resources/samples/langs/G-code/square.g", "content": "G28 X0 Y0\nG1 X55 Y5 F2000\nG1 Y180\nG1 X180\nG1 Y5\nG1 X55\nG1 Y180\nG1 X180\nG1 Y5\nG1 X55\nM0\n\n\n" }, { "path": "src/test/resources/samples/langs/GAMS/transport.gms", "content": "*Basic example of transport model from GAMS model library\n\n$Title A Transportation Problem (TRNSPORT,SEQ=1)\n$Ontext\n\nThis problem finds a least cost shipping schedule that meets\nrequirements at markets and supplies at factories.\n\n\nDantzig, G B, Chapter 3.3. In Linear Programming and Extensions.\nPrinceton University Press, Princeton, New Jersey, 1963.\n\nThis formulation is described in detail in:\nRosenthal, R E, Chapter 2: A GAMS Tutorial. In GAMS: A User's Guide.\nThe Scientific Press, Redwood City, California, 1988.\n\nThe line numbers will not match those in the book because of these\ncomments.\n\n$Offtext\n\n\n Sets\n i canning plants / seattle, san-diego /\n j markets / new-york, chicago, topeka / ;\n Parameters\n a(i) capacity of plant i in cases\n / seattle 350\n san-diego 600 /\n b(j) demand at market j in cases\n / new-york 325\n chicago 300\n topeka 275 / ;\n Table d(i,j) distance in thousands of miles\n new-york chicago topeka\n seattle 2.5 1.7 1.8\n san-diego 2.5 1.8 1.4 ;\n Scalar f freight in dollars per case per thousand miles /90/ ;\n Parameter c(i,j) transport cost in thousands of dollars per case ;\n c(i,j) = f * d(i,j) / 1000 ;\n Variables\n x(i,j) shipment quantities in cases\n z total transportation costs in thousands of dollars ;\n\n Positive Variable x ;\n\n Equations\n cost define objective function\n supply(i) observe supply limit at plant i\n demand(j) satisfy demand at market j ;\n\n cost .. z =e= sum((i,j), c(i,j)*x(i,j)) ;\n\n supply(i) .. sum(j, x(i,j)) =l= a(i) ;\n\n demand(j) .. sum(i, x(i,j)) =g= b(j) ;\n\n Model transport /all/ ;\n\n Solve transport using lp minimizing z ;\n\n Display x.l, x.m ;\n\n$ontext\n#user model library stuff\nMain topic Basic GAMS\nFeatured item 1 Trnsport model\nFeatured item 2\nFeatured item 3\nFeatured item 4\nDescription\nBasic example of transport model from GAMS model library\n\n\n\n$offtext" }, { "path": "src/test/resources/samples/langs/GAP/Magic.gd", "content": "#############################################################################\n##\n## Magic.gd AutoDoc package\n##\n## Copyright 2013, Max Horn, JLU Giessen\n## Sebastian Gutsche, University of Kaiserslautern\n##\n#############################################################################\n\n\n#! @Description\n#! This is the main function of the &AutoDoc; package. It can perform\n#! any combination of the following three tasks:\n#! \n#! \n#! It can (re)generate a scaffold for your package manual.\n#! That is, it can produce two XML files in &GAPDoc; format to be used as part\n#! of your manual: First, a file named doc/PACKAGENAME.xml\n#! (with your package's name substituted) which is used as\n#! main file for the package manual, i.e. this file sets the\n#! XML DOCTYPE and defines various XML entities, includes\n#! other XML files (both those generated by &AutoDoc; as well\n#! as additional files created by other means), tells &GAPDoc;\n#! to generate a table of content and an index, and more.\n#! Secondly, it creates a file doc/title.xml containing a title\n#! page for your documentation, with information about your package\n#! (name, description, version), its authors and more, based\n#! on the data in your PackageInfo.g.\n#! \n#! \n#! It can scan your package for &AutoDoc; based documentation (by using &AutoDoc;\n#! tags and the Autodoc command.\n#! This will\n#! produce further XML files to be used as part of the package manual.\n#! \n#! \n#! It can use &GAPDoc; to generate PDF, text and HTML (with\n#! MathJaX enabled) documentation from the &GAPDoc; XML files it\n#! generated as well as additional such files provided by you. For\n#! this, it invokes \n#! to convert the XML sources, and it also instructs &GAPDoc; to copy\n#! supplementary files (such as CSS style files) into your doc directory\n#! (see ).\n#! \n#! \n#! For more information and some examples, please refer to Chapter .\n#!

\n#! The parameters have the following meanings:\n#! \n#!\n#! package_name\n#! \n#! The name of the package whose documentation should be(re)generated.\n#! \n#!\n#!\n#! option_record\n#! \n#! option_record can be a record with some additional options.\n#! The following are currently supported:\n#! \n#! dir\n#! \n#! This should be a string containing a (relative) path or a\n#! Directory() object specifying where the package documentation\n#! (i.e. the &GAPDoc; XML files) are stored.\n#!
\n#! Default value: \"doc/\".\n#! \n#! scaffold\n#! \n#! This controls whether and how to generate scaffold XML files\n#! for the main and title page of the package's documentation. \n#!

\n#! The value should be either true, false or a\n#! record. If it is a record or true (the latter is\n#! equivalent to specifying an empty record), then this feature is\n#! enabled. It is also enabled if opt.scaffold is missing but the\n#! package's info record in PackageInfo.g has an AutoDoc entry.\n#! In all other cases (in particular if opt.scaffold is\n#! false), scaffolding is disabled.\n#!

\n#!\n#! If opt.scaffold is a record, it may contain the following entries.\n#!\n#### TODO: mention merging with PackageInfo.AutoDoc!\n#! \n#!\n#! includes\n#! \n#! A list of XML files to be included in the body of the main XML file.\n#! If you specify this list and also are using &AutoDoc; to document\n#! your operations with &AutoDoc; comments,\n#! you can add AutoDocMainFile.xml to this list\n#! to control at which point the documentation produced by &AutoDoc;\n#! is inserted. If you do not do this, it will be added after the last\n#! of your own XML files.\n#! \n#!\n#! appendix\n#! \n#! This entry is similar to opt.scaffold.includes but is used\n#! to specify files to include after the main body of the manual,\n#! i.e. typically appendices.\n#! \n#!\n#! bib\n#! \n#! The name of a bibliography file, in Bibtex or XML format.\n#! If this key is not set, but there is a file doc/PACKAGENAME.bib\n#! then it is assumed that you want to use this as your bibliography.\n#! \n#!\n#### TODO: The 'entities' param is a bit strange. We should probably change it to be a bit more\n#### general, as one might want to define other entities... For now, we do not document it\n#### to leave us the choice of revising how it works.\n####\n#### entities\n#### \n#### A list of package names or other entities which are used to define corresponding XML entities.\n#### For example, if set to a list containing the string SomePackage,\n#### then the following is added to the XML preamble:\n####

SomePackage'>]]>\n#### This allows you to write &SomePackage; in your documentation\n#### to reference that package. If another type of entity is desired, one can simply add,\n#### instead of a string, add a two entry list a to the list. It will be handled as\n#### a[ 2 ]'>]]>,\n#### so please be careful.\n#### \n#!\n#! TitlePage\n#! \n#! A record whose entries are used to embellish the generated titlepage\n#! for the package manual with extra information, such as a copyright\n#! statement or acknowledgments. To this end, the names of the record\n#! components are used as XML element names, and the values of the\n#! components are outputted as content of these XML elements. For\n#! example, you could pass the following record to set a custom\n#! acknowledgements text:\n#! \n#! For a list of valid entries in the titlepage, please refer to the\n#! &GAPDoc; manual, specifically section \n#! and following.\n#! \n#! document_class\n#! \n#! Sets the document class of the resulting pdf. The value can either be a string\n#! which has to be the name of the new document class, a list containing this string, or\n#! a list of two strings. Then the first one has to be the document class name, the second one\n#! the option string ( contained in [ ] ) in LaTeX.\n#! \n#! latex_header_file\n#! \n#! Replaces the standard header from &GAPDoc; completely with the header in this LaTeX file.\n#! Please be careful here, and look at GAPDoc's latexheader.tex file for an example.\n#! \n#! gapdoc_latex_options\n#! \n#! Must be a record with entries which can be understood by SetGapDocLaTeXOptions. Each entry can be a string, which\n#! will be given to &GAPDoc; directly, or a list containing of two entries: The first one must be the string \"file\",\n#! the second one a filename. This file will be read and then its content is passed to &GAPDoc; as option with the name\n#! of the entry.\n#! \n#!\n#! \n#! \n#!\n#!\n#! autodoc\n#! \n#! This controls whether and how to generate addition XML documentation files\n#! by scanning for &AutoDoc; documentation comments.\n#!

\n#! The value should be either true, false or a\n#! record. If it is a record or true (the latter is\n#! equivalent to specifying an empty record), then this feature is\n#! enabled. It is also enabled if opt.autodoc is missing but the\n#! package depends (directly) on the &AutoDoc; package.\n#! In all other cases (in particular if opt.autodoc is\n#! false), this feature is disabled.\n#!

\n#!\n#! If opt.autodoc is a record, it may contain the following entries.\n#!\n#! \n#!\n#! files\n#! \n#! A list of files (given by paths relative to the package directory)\n#! to be scanned for &AutoDoc; documentation comments.\n#! Usually it is more convenient to use autodoc.scan_dirs, see below.\n#! \n#!\n#! scan_dirs\n#! \n#! A list of subdirectories of the package directory (given as relative paths)\n#! which &AutoDoc; then scans for .gi, .gd and .g files; all of these files\n#! are then scanned for &AutoDoc; documentation comments.\n#!
\n#! Default value: [ \"gap\", \"lib\", \"examples\", \"examples/doc\" ].\n#! \n#!\n#! level\n#! \n#! This defines the level of the created documentation. The default value is 0.\n#! When parts of the manual are declared with a higher value\n#! they will not be printed into the manual.\n#! \n#!\n#### TODO: Document section_intros later on.\n#### However, note that thanks to the new AutoDoc comment syntax, the only remaining\n#### use for this seems to be the ability to specify the order of chapters and\n#### sections.\n#### section_intros\n#### \n#### TODO.\n#### \n#!\n#! \n#! \n#!\n#!\n#! gapdoc\n#! \n#! This controls whether and how to invoke &GAPDoc; to create HTML, PDF and text\n#! files from your various XML files.\n#!

\n#! The value should be either true, false or a\n#! record. If it is a record or true (the latter is\n#! equivalent to specifying an empty record), then this feature is\n#! enabled. It is also enabled if opt.gapdoc is missing.\n#! In all other cases (in particular if opt.gapdoc is\n#! false), this feature is disabled.\n#!

\n#!\n#! If opt.gapdoc is a record, it may contain the following entries.\n#!\n#! \n#!\n#!\n#### Note: 'main' is strictly speaking also used for the scaffold.\n#### However, if one uses the scaffolding mechanism, then it is not\n#### really necessary to specify a custom name for the main XML file.\n#### Thus, the purpose of this parameter is to cater for packages\n#### that have existing documentation using a different XML name,\n#### and which do not wish to use scaffolding.\n####\n#### This explain why we only allow specifying gapdoc.main.\n#### The scaffolding code will still honor it, though, just in case.\n#! main\n#! \n#! The name of the main XML file of the package manual.\n#! This exists primarily to support packages with existing manual\n#! which use a filename here which differs from the default.\n#! In particular, specifying this is unnecessary when using scaffolding.\n#!
\n#! Default value: PACKAGENAME.xml.\n#! \n#!\n#! files\n#! \n#! A list of files (given by paths relative to the package directory)\n#! to be scanned for &GAPDoc; documentation comments.\n#! Usually it is more convenient to use gapdoc.scan_dirs, see below.\n#! \n#!\n#! scan_dirs\n#! \n#! A list of subdirectories of the package directory (given as relative paths)\n#! which &AutoDoc; then scans for .gi, .gd and .g files; all of these files\n#! are then scanned for &GAPDoc; documentation comments.\n#!
\n#! Default value: [ \"gap\", \"lib\", \"examples\", \"examples/doc\" ].\n#! \n#!\n#! \n#! \n## This is the maketest part. Still under construction.\n#! maketest\n#! \n#! The maketest item can be true or a record. When it is true,\n#! a simple maketest.g is created in the main package directory,\n#! which can be used to test the examples from the manual. As a record,\n#! the entry can have the following entries itself, to specify some options.\n#! \n#! filename\n#! \n#! Sets the name of the test file.\n#! \n#! commands\n#! \n#! A list of strings, each one a command, which\n#! will be executed at the beginning of the test file.\n#! \n#! \n#! \n#!\n#! \n#! \n#! \n#!\n#! @Returns nothing\n#! @Arguments package_name[, option_record ]\n#! @ChapterInfo AutoDoc, The AutoDoc() function\nDeclareGlobalFunction( \"AutoDoc\" );\n\n" }, { "path": "src/test/resources/samples/langs/GAP/Magic.gi", "content": "#############################################################################\n##\n## Magic.gi AutoDoc package\n##\n## Copyright 2013, Max Horn, JLU Giessen\n## Sebastian Gutsche, University of Kaiserslautern\n##\n#############################################################################\n\n# Check if a string has the given suffix or not. Another\n# name for this would \"StringEndsWithOtherString\".\n# For example, AUTODOC_HasSuffix(\"file.gi\", \".gi\") returns\n# true while AUTODOC_HasSuffix(\"file.txt\", \".gi\") returns false.\nBindGlobal( \"AUTODOC_HasSuffix\",\nfunction(str, suffix)\n local n, m;\n n := Length(str);\n m := Length(suffix);\n return n >= m and str{[n-m+1..n]} = suffix;\nend );\n\n# Given a string containing a \".\", , return its suffix,\n# i.e. the bit after the last \".\". For example, given \"test.txt\",\n# it returns \"txt\".\nBindGlobal( \"AUTODOC_GetSuffix\",\nfunction(str)\n local i;\n i := Length(str);\n while i > 0 and str[i] <> '.' do i := i - 1; od;\n if i < 0 then return \"\"; fi;\n return str{[i+1..Length(str)]};\nend );\n\n# Check whether the given directory exists, and if not, attempt\n# to create it.\nBindGlobal( \"AUTODOC_CreateDirIfMissing\",\nfunction(d)\n local tmp;\n if not IsDirectoryPath(d) then\n tmp := CreateDir(d); # Note: CreateDir is currently undocumented\n if tmp = fail then\n Error(\"Cannot create directory \", d, \"\\n\",\n \"Error message: \", LastSystemError().message, \"\\n\");\n return false;\n fi;\n fi;\n return true;\nend );\n\n\n# Scan the given (by name) subdirs of a package dir for\n# files with one of the given extensions, and return the corresponding\n# filenames, as relative paths (relative to the package dir).\n#\n# For example, the invocation\n# AUTODOC_FindMatchingFiles(\"AutoDoc\", [ \"gap/\" ], [ \"gi\", \"gd\" ]);\n# might return a list looking like\n# [ \"gap/AutoDocMainFunction.gd\", \"gap/AutoDocMainFunction.gi\", ... ]\nBindGlobal( \"AUTODOC_FindMatchingFiles\",\nfunction (pkg, subdirs, extensions)\n local d_rel, d, tmp, files, result;\n\n result := [];\n\n for d_rel in subdirs do\n # Get the absolute path to the directory in side the package...\n d := DirectoriesPackageLibrary( pkg, d_rel );\n if IsEmpty( d ) then\n continue;\n fi;\n d := d[1];\n # ... but also keep the relative path (such as \"gap\")\n d_rel := Directory( d_rel );\n\n files := DirectoryContents( d );\n Sort( files );\n for tmp in files do\n if not AUTODOC_GetSuffix( tmp ) in [ \"g\", \"gi\", \"gd\", \"autodoc\" ] then\n continue;\n fi;\n if not IsReadableFile( Filename( d, tmp ) ) then\n continue;\n fi;\n Add( result, Filename( d_rel, tmp ) );\n od;\n od;\n return result;\nend );\n\n\n# AutoDoc(pkg[, opt])\n#\n## Make this function callable with the package_name AutoDocWorksheet.\n## Which will then create a worksheet!\nInstallGlobalFunction( AutoDoc,\nfunction( arg )\n local pkg, package_info, opt, scaffold, gapdoc, maketest,\n autodoc, pkg_dir, doc_dir, doc_dir_rel, d, tmp,\n title_page, tree, is_worksheet, position_document_class, i, gapdoc_latex_option_record;\n \n pkg := arg[1];\n \n if LowercaseString( pkg ) = \"autodocworksheet\" then\n is_worksheet := true;\n package_info := rec( );\n pkg_dir := DirectoryCurrent( );\n else\n is_worksheet := false;\n package_info := PackageInfo( pkg )[ 1 ];\n pkg_dir := DirectoriesPackageLibrary( pkg, \"\" )[1];\n fi;\n\n if Length(arg) >= 2 then\n opt := arg[2];\n else\n opt := rec();\n fi;\n\n # Check for certain user supplied options, and if present, add them\n # to the opt record.\n tmp := function( key )\n local val;\n val := ValueOption( key );\n if val <> fail then\n opt.(key) := val;\n fi;\n end;\n \n tmp( \"dir\" );\n tmp( \"scaffold\" );\n tmp( \"autodoc\" );\n tmp( \"gapdoc\" );\n tmp( \"maketest\" );\n \n #\n # Setup the output directory\n #\n if not IsBound( opt.dir ) then\n doc_dir := \"doc\";\n elif IsString( opt.dir ) or IsDirectory( opt.dir ) then\n doc_dir := opt.dir;\n else\n Error( \"opt.dir must be a string containing a path, or a directory object\" );\n fi;\n \n if IsString( doc_dir ) then\n # Record the relative version of the path\n doc_dir_rel := Directory( doc_dir );\n\n # We intentionally do not use\n # DirectoriesPackageLibrary( pkg, \"doc\" )\n # because it returns an empty list if the subdirectory is missing.\n # But we want to handle that case by creating the directory.\n doc_dir := Filename(pkg_dir, doc_dir);\n doc_dir := Directory(doc_dir);\n\n else\n # TODO: doc_dir_rel = ... ?\n fi;\n\n # Ensure the output directory exists, create it if necessary\n AUTODOC_CreateDirIfMissing(Filename(doc_dir, \"\"));\n \n # Let the developer know where we are generating the documentation.\n # This helps diagnose problems where multiple instances of a package\n # are visible to GAP and the wrong one is used for generating the\n # documentation.\n # TODO: Using Info() instead of Print?\n Print( \"Generating documentation in \", doc_dir, \"\\n\" );\n\n #\n # Extract scaffolding settings, which can be controlled via\n # opt.scaffold or package_info.AutoDoc. The former has precedence.\n #\n if not IsBound(opt.scaffold) then\n # Default: enable scaffolding if and only if package_info.AutoDoc is present\n if IsBound( package_info.AutoDoc ) then\n scaffold := rec( );\n fi;\n elif IsRecord(opt.scaffold) then\n scaffold := opt.scaffold;\n elif IsBool(opt.scaffold) then\n if opt.scaffold = true then\n scaffold := rec();\n fi;\n else\n Error(\"opt.scaffold must be a bool or a record\");\n fi;\n\n # Merge package_info.AutoDoc into scaffold\n if IsBound(scaffold) and IsBound( package_info.AutoDoc ) then\n AUTODOC_APPEND_RECORD_WRITEONCE( scaffold, package_info.AutoDoc );\n fi;\n \n if IsBound( scaffold ) then\n AUTODOC_WriteOnce( scaffold, \"TitlePage\", true );\n AUTODOC_WriteOnce( scaffold, \"MainPage\", true );\n fi;\n\n \n #\n # Extract AutoDoc settings\n #\n if not IsBound(opt.autodoc) and not is_worksheet then\n # Enable AutoDoc support if the package depends on AutoDoc.\n tmp := Concatenation( package_info.Dependencies.NeededOtherPackages,\n package_info.Dependencies.SuggestedOtherPackages );\n if ForAny( tmp, x -> LowercaseString(x[1]) = \"autodoc\" ) then\n autodoc := rec();\n fi;\n elif IsRecord(opt.autodoc) then\n autodoc := opt.autodoc;\n elif IsBool(opt.autodoc) and opt.autodoc = true then\n autodoc := rec();\n fi;\n \n if IsBound(autodoc) then\n if not IsBound( autodoc.files ) then\n autodoc.files := [ ];\n fi;\n \n if not IsBound( autodoc.scan_dirs ) and not is_worksheet then\n autodoc.scan_dirs := [ \"gap\", \"lib\", \"examples\", \"examples/doc\" ];\n elif not IsBound( autodoc.scan_dirs ) and is_worksheet then\n autodoc.scan_dirs := [ ];\n fi;\n \n if not IsBound( autodoc.level ) then\n autodoc.level := 0;\n fi;\n \n PushOptions( rec( level_value := autodoc.level ) );\n \n if not is_worksheet then\n Append( autodoc.files, AUTODOC_FindMatchingFiles(pkg, autodoc.scan_dirs, [ \"g\", \"gi\", \"gd\" ]) );\n fi;\n fi;\n\n #\n # Extract GAPDoc settings\n #\n if not IsBound( opt.gapdoc ) then\n # Enable GAPDoc support by default\n gapdoc := rec();\n elif IsRecord( opt.gapdoc ) then\n gapdoc := opt.gapdoc;\n elif IsBool( opt.gapdoc ) and opt.gapdoc = true then\n gapdoc := rec();\n fi;\n \n #\n # Extract test settings\n #\n \n if IsBound( opt.maketest ) then\n if IsRecord( opt.maketest ) then\n maketest := opt.maketest;\n elif opt.maketest = true then\n maketest := rec( );\n fi;\n fi;\n \n if IsBound( gapdoc ) then\n\n if not IsBound( gapdoc.main ) then\n gapdoc.main := pkg;\n fi;\n\n # FIXME: the following may break if a package uses more than one book\n if IsBound( package_info.PackageDoc ) and IsBound( package_info.PackageDoc[1].BookName ) then\n gapdoc.bookname := package_info.PackageDoc[1].BookName;\n elif not is_worksheet then\n # Default: book name = package name\n gapdoc.bookname := pkg;\n\n Print(\"\\n\");\n Print(\"WARNING: PackageInfo.g is missing a PackageDoc entry!\\n\");\n Print(\"Without this, your package manual will not be recognized by the GAP help system.\\n\");\n Print(\"You can correct this by adding the following to your PackageInfo.g:\\n\");\n Print(\"PackageDoc := rec(\\n\");\n Print(\" BookName := ~.PackageName,\\n\");\n #Print(\" BookName := \\\"\", pkg, \"\\\",\\n\");\n Print(\" ArchiveURLSubset := [\\\"doc\\\"],\\n\");\n Print(\" HTMLStart := \\\"doc/chap0.html\\\",\\n\");\n Print(\" PDFFile := \\\"doc/manual.pdf\\\",\\n\");\n Print(\" SixFile := \\\"doc/manual.six\\\",\\n\");\n Print(\" LongTitle := ~.Subtitle,\\n\");\n Print(\"),\\n\");\n Print(\"\\n\");\n fi;\n\n if not IsBound( gapdoc.files ) then\n gapdoc.files := [];\n fi;\n\n if not IsBound( gapdoc.scan_dirs ) and not is_worksheet then\n gapdoc.scan_dirs := [ \"gap\", \"lib\", \"examples\", \"examples/doc\" ];\n fi;\n \n if not is_worksheet then\n Append( gapdoc.files, AUTODOC_FindMatchingFiles(pkg, gapdoc.scan_dirs, [ \"g\", \"gi\", \"gd\" ]) );\n fi;\n\n # Attempt to weed out duplicates as they may confuse GAPDoc (this\n # won't work if there are any non-normalized paths in the list).\n gapdoc.files := Set( gapdoc.files );\n \n # Convert the file paths in gapdoc.files, which are relative to\n # the package directory, to paths which are relative to the doc directory.\n # For this, we assume that doc_dir_rel is normalized (e.g.\n # it does not contains '//') and relative.\n d := Number( Filename( doc_dir_rel, \"\" ), x -> x = '/' );\n d := Concatenation( ListWithIdenticalEntries(d, \"../\") );\n gapdoc.files := List( gapdoc.files, f -> Concatenation( d, f ) );\n fi;\n \n \n # read tree\n # FIXME: shouldn't tree be declared inside of an 'if IsBound(autodoc)' section?\n tree := DocumentationTree( );\n \n if IsBound( autodoc ) then\n if IsBound( autodoc.section_intros ) then\n AUTODOC_PROCESS_INTRO_STRINGS( autodoc.section_intros : Tree := tree );\n fi;\n \n AutoDocScanFiles( autodoc.files : PackageName := pkg, Tree := tree );\n fi;\n \n if is_worksheet then\n # FIXME: We use scaffold and autodoc here without checking whether\n # they are bound. Does that mean worksheets always use them?\n if IsRecord( scaffold.TitlePage ) and IsBound( scaffold.TitlePage.Title ) then\n pkg := scaffold.TitlePage.Title;\n\n elif IsBound( tree!.TitlePage.Title ) then\n pkg := tree!.TitlePage.Title;\n\n elif IsBound( autodoc.files ) and Length( autodoc.files ) > 0 then\n pkg := autodoc.files[ 1 ];\n \n while Position( pkg, '/' ) <> fail do\n Remove( pkg, 1 );\n od;\n \n while Position( pkg, '.' ) <> fail do\n Remove( pkg, Length( pkg ) );\n od;\n\n else\n Error( \"could not figure out a title.\" );\n fi;\n \n if not IsString( pkg ) then\n pkg := JoinStringsWithSeparator( pkg, \" \" );\n fi;\n \n gapdoc.main := ReplacedString( pkg, \" \", \"_\" );\n gapdoc.bookname := ReplacedString( pkg, \" \", \"_\" );\n fi;\n \n #\n # Generate scaffold\n #\n gapdoc_latex_option_record := rec( );\n \n if IsBound( scaffold ) then\n ## Syntax is [ \"class\", [ \"options\" ] ]\n if IsBound( scaffold.document_class ) then\n position_document_class := PositionSublist( GAPDoc2LaTeXProcs.Head, \"documentclass\" );\n \n if IsString( scaffold.document_class ) then\n scaffold.document_class := [ scaffold.document_class ];\n fi;\n \n if position_document_class = fail then\n Error( \"something is wrong with the LaTeX header\" );\n fi;\n \n GAPDoc2LaTeXProcs.Head := Concatenation(\n GAPDoc2LaTeXProcs.Head{[ 1 .. PositionSublist( GAPDoc2LaTeXProcs.Head, \"{\", position_document_class ) ]},\n scaffold.document_class[ 1 ],\n GAPDoc2LaTeXProcs.Head{[ PositionSublist( GAPDoc2LaTeXProcs.Head, \"}\", position_document_class ) .. Length( GAPDoc2LaTeXProcs.Head ) ]} );\n \n if Length( scaffold.document_class ) = 2 then\n \n GAPDoc2LaTeXProcs.Head := Concatenation(\n GAPDoc2LaTeXProcs.Head{[ 1 .. PositionSublist( GAPDoc2LaTeXProcs.Head, \"[\", position_document_class ) ]},\n scaffold.document_class[ 2 ],\n GAPDoc2LaTeXProcs.Head{[ PositionSublist( GAPDoc2LaTeXProcs.Head, \"]\", position_document_class ) .. Length( GAPDoc2LaTeXProcs.Head ) ]} );\n fi;\n fi;\n \n if IsBound( scaffold.latex_header_file ) then\n GAPDoc2LaTeXProcs.Head := StringFile( scaffold.latex_header_file );\n fi;\n \n if IsBound( scaffold.gapdoc_latex_options ) then\n if IsRecord( scaffold.gapdoc_latex_options ) then\n for i in RecNames( scaffold.gapdoc_latex_options ) do\n if not IsString( scaffold.gapdoc_latex_options.( i ) )\n and IsList( scaffold.gapdoc_latex_options.( i ) )\n and LowercaseString( scaffold.gapdoc_latex_options.( i )[ 1 ] ) = \"file\" then\n scaffold.gapdoc_latex_options.( i ) := StringFile( scaffold.gapdoc_latex_options.( i )[ 2 ] );\n fi;\n od;\n \n gapdoc_latex_option_record := scaffold.gapdoc_latex_options;\n fi;\n fi;\n \n if not IsBound( scaffold.includes ) then\n scaffold.includes := [ ];\n fi;\n\n if IsBound( autodoc ) then\n # If scaffold.includes is already set, then we add\n # AutoDocMainFile.xml to it, but *only* if it not already\n # there. This way, package authors can control where\n # it is put in their includes list.\n if not \"AutoDocMainFile.xml\" in scaffold.includes then\n Add( scaffold.includes, \"AutoDocMainFile.xml\" );\n fi;\n fi;\n\n if IsBound( scaffold.bib ) and IsBool( scaffold.bib ) then\n if scaffold.bib = true then\n scaffold.bib := Concatenation( pkg, \".bib\" );\n else\n Unbind( scaffold.bib );\n fi;\n elif not IsBound( scaffold.bib ) then\n # If there is a doc/PKG.bib file, assume that we want to reference it in the scaffold.\n if IsReadableFile( Filename( doc_dir, Concatenation( pkg, \".bib\" ) ) ) then\n scaffold.bib := Concatenation( pkg, \".bib\" );\n fi;\n fi;\n \n AUTODOC_WriteOnce( scaffold, \"index\", true );\n\n if IsBound( gapdoc ) then\n if AUTODOC_GetSuffix( gapdoc.main ) = \"xml\" then\n scaffold.main_xml_file := gapdoc.main;\n else\n scaffold.main_xml_file := Concatenation( gapdoc.main, \".xml\" );\n fi;\n fi;\n\n # TODO: It should be possible to only rebuild the title page. (Perhaps also only the main page? but this is less important)\n if IsBound( scaffold.TitlePage ) then\n if IsRecord( scaffold.TitlePage ) then\n title_page := scaffold.TitlePage;\n else\n title_page := rec( );\n fi;\n \n AUTODOC_WriteOnce( title_page, \"dir\", doc_dir );\n AUTODOC_APPEND_RECORD_WRITEONCE( title_page, tree!.TitlePage );\n \n if not is_worksheet then\n AUTODOC_APPEND_RECORD_WRITEONCE( title_page, ExtractTitleInfoFromPackageInfo( pkg ) );\n fi;\n \n CreateTitlePage( title_page );\n fi;\n \n if IsBound( scaffold.MainPage ) and scaffold.MainPage <> false then\n scaffold.dir := doc_dir;\n scaffold.book_name := pkg;\n CreateMainPage( scaffold );\n fi;\n fi;\n \n #\n # Run AutoDoc\n #\n if IsBound( autodoc ) then\n WriteDocumentation( tree, doc_dir );\n fi;\n \n \n #\n # Run GAPDoc\n #\n if IsBound( gapdoc ) then\n\n # Ask GAPDoc to use UTF-8 as input encoding for LaTeX, as the XML files\n # of the documentation are also in UTF-8 encoding, and may contain characters\n # not contained in the default Latin 1 encoding.\n SetGapDocLaTeXOptions( \"utf8\", gapdoc_latex_option_record );\n\n MakeGAPDocDoc( doc_dir, gapdoc.main, gapdoc.files, gapdoc.bookname, \"MathJax\" );\n\n CopyHTMLStyleFiles( Filename( doc_dir, \"\" ) );\n\n # The following (undocumented) API is there for compatibility\n # with old-style gapmacro.tex based package manuals. It\n # produces a manual.lab file which those packages can use if\n # they wish to link to things in the manual we are currently\n # generating. This can probably be removed eventually, but for\n # now, doing it does not hurt.\n \n # FIXME: It seems that this command does not work if pdflatex\n # is not present. Maybe we should remove it.\n \n if not is_worksheet then\n GAPDocManualLab( pkg );\n fi;\n\n fi;\n \n if IsBound( maketest ) then\n \n AUTODOC_WriteOnce( maketest, \"filename\", \"maketest.g\" );\n AUTODOC_WriteOnce( maketest, \"folder\", pkg_dir );\n AUTODOC_WriteOnce( maketest, \"scan_dir\", doc_dir );\n AUTODOC_WriteOnce( maketest, \"files_to_scan\", gapdoc.files );\n\n if IsString( maketest.folder ) then\n maketest.folder := Directory( maketest.folder );\n fi;\n \n if IsString( maketest.scan_dir ) then\n maketest.scan_dir := Directory( maketest.scan_dir );\n fi;\n \n AUTODOC_WriteOnce( maketest, \"commands\", [ ] );\n AUTODOC_WriteOnce( maketest, \"book_name\", gapdoc.main );\n \n CreateMakeTest( maketest );\n fi;\n\n return true;\nend );\n" }, { "path": "src/test/resources/samples/langs/GAP/PackageInfo.g", "content": "#############################################################################\n## \n## PackageInfo.g for the package `cvec' Max Neunhoeffer\n##\n## (created from Frank Lübeck's PackageInfo.g template file)\n## \n\nSetPackageInfo( rec(\n\nPackageName := \"cvec\",\nSubtitle := \"Compact vectors over finite fields\",\nVersion := \"2.5.1\",\nDate := \"04/04/2014\", # dd/mm/yyyy format\n\n## Information about authors and maintainers.\nPersons := [\n rec( \n LastName := \"Neunhoeffer\",\n FirstNames := \"Max\",\n IsAuthor := true,\n IsMaintainer := false,\n Email := \"neunhoef@mcs.st-and.ac.uk\",\n WWWHome := \"http://www-groups.mcs.st-and.ac.uk/~neunhoef/\",\n PostalAddress := Concatenation( [\n \"School of Mathematics and Statistics\\n\",\n \"University of St Andrews\\n\",\n \"Mathematical Institute\\n\",\n \"North Haugh\\n\",\n \"St Andrews, Fife KY16 9SS\\n\",\n \"Scotland, UK\" ] ),\n Place := \"St Andrews\",\n Institution := \"University of St Andrews\"\n ),\n],\n\n## Status information. Currently the following cases are recognized:\n## \"accepted\" for successfully refereed packages\n## \"deposited\" for packages for which the GAP developers agreed \n## to distribute them with the core GAP system\n## \"dev\" for development versions of packages \n## \"other\" for all other packages\n##\n# Status := \"accepted\",\nStatus := \"deposited\",\n\n## You must provide the next two entries if and only if the status is \n## \"accepted\" because is was successfully refereed:\n# format: 'name (place)'\n# CommunicatedBy := \"Mike Atkinson (St. Andrews)\",\n#CommunicatedBy := \"\",\n# format: mm/yyyy\n# AcceptDate := \"08/1999\",\n#AcceptDate := \"\",\n\nPackageWWWHome := \"http://neunhoef.github.io/cvec/\",\nREADME_URL := Concatenation(~.PackageWWWHome, \"README\"),\nPackageInfoURL := Concatenation(~.PackageWWWHome, \"PackageInfo.g\"),\nArchiveURL := Concatenation(\"https://github.com/neunhoef/cvec/\",\n \"releases/download/v\", ~.Version,\n \"/cvec-\", ~.Version),\nArchiveFormats := \".tar.gz .tar.bz2\",\n\n## Here you must provide a short abstract explaining the package content \n## in HTML format (used on the package overview Web page) and an URL \n## for a Webpage with more detailed information about the package\n## (not more than a few lines, less is ok):\n## Please, use 'GAP' and\n## 'MyPKG' for specifing package names.\n## \nAbstractHTML := \n \"This package provides an implementation of compact vectors over finite\\\n fields. Contrary to earlier implementations no table lookups are used\\\n but only word-based processor arithmetic. This allows for bigger finite\\\n fields and higher speed.\",\n\nPackageDoc := rec(\n BookName := \"cvec\",\n ArchiveURLSubset := [\"doc\"],\n HTMLStart := \"doc/chap0.html\",\n PDFFile := \"doc/manual.pdf\",\n SixFile := \"doc/manual.six\",\n LongTitle := \"Compact vectors over finite fields\",\n),\n\nDependencies := rec(\n GAP := \">=4.5.5\",\n NeededOtherPackages := [\n [\"GAPDoc\", \">= 1.2\"],\n [\"IO\", \">= 4.1\"],\n [\"orb\", \">= 4.2\"],\n ],\n SuggestedOtherPackages := [],\n ExternalConditions := []\n),\n\nAvailabilityTest := function()\n if not \"cvec\" in SHOW_STAT() and\n Filename(DirectoriesPackagePrograms(\"cvec\"), \"cvec.so\") = fail then\n #Info(InfoWarning, 1, \"cvec: kernel cvec functions not available.\");\n return fail;\n fi;\n return true;\nend,\n\n## *Optional*, but recommended: path relative to package root to a file which \n## contains as many tests of the package functionality as sensible.\n#TestFile := \"tst/testall.g\",\n\n## *Optional*: Here you can list some keyword related to the topic \n## of the package.\nKeywords := []\n\n));\n\n\n" }, { "path": "src/test/resources/samples/langs/GAP/bugfix.tst", "content": "gap> START_TEST(\"Test for various former bugs\");\n\n\ngap> # The following used to trigger an error starting with:\ngap> # \"SolutionMat: matrix and vector incompatible called from\"\ngap> K:=AbelianPcpGroup([3,3,3]);;\ngap> A:=Subgroup(K,[K.1]);;\ngap> cr:=CRRecordBySubgroup(K,A);;\ngap> ExtensionsCR(cr);;\n\n\n# Comparing homomorphisms used to be broken\ngap> K:=AbelianPcpGroup(1,[3]);;\ngap> hom1:=GroupHomomorphismByImages(K,K,[K.1],[K.1]);;\ngap> hom2:=GroupHomomorphismByImages(K,K,[K.1^2],[K.1^2]);;\ngap> hom1=hom2;\ntrue\ngap> hom1=IdentityMapping(K);\ntrue\ngap> hom2=IdentityMapping(K);\ntrue\n\n\ngap> # The following incorrectly triggered an error at some point\ngap> IsTorsionFree(ExamplesOfSomePcpGroups(5));\ntrue\n\n\ngap> # Verify IsGeneratorsOfMagmaWithInverses warnings are silenced\ngap> IsGeneratorsOfMagmaWithInverses(GeneratorsOfGroup(ExamplesOfSomePcpGroups(5)));\ntrue\n\n\ngap> # Check for a bug reported 2012-01-19 by Robert Morse\ngap> g := PcGroupToPcpGroup(SmallGroup(48,1));\nPcp-group with orders [ 2, 2, 2, 2, 3 ]\ngap> # The next two commands used to trigger errors\ngap> NonAbelianTensorSquare(Centre(g));\nPcp-group with orders [ 8 ]\ngap> NonAbelianExteriorSquare(Centre(g));\nPcp-group with orders [ ]\n\n\ngap> # Check for a bug reported 2012-01-19 by Robert Morse\ngap> F := FreeGroup(\"x\",\"y\");\n\ngap> x := F.1;; y := F.2;;\ngap> G := F/[x^2/y^24, y^24, y^x/y^23];\n\ngap> iso := IsomorphismPcGroup(G);\n[ x, y ] -> [ f1, f2*f5 ]\ngap> iso1 := IsomorphismPcpGroup(Image(iso));\n[ f1, f2, f3, f4, f5 ] -> [ g1, g2, g3, g4, g5 ]\ngap> G := Image(iso*iso1);\nPcp-group with orders [ 2, 2, 2, 2, 3 ]\ngap> # The next command used to trigger an error\ngap> NonAbelianTensorSquare(Image(iso*iso1));\nPcp-group with orders [ 2, 2, 3, 2, 2, 2, 2 ]\n\n\ngap> # The problem with the previous example is/was that Igs(G)\ngap> # is set to a non-standard value:\ngap> Igs(G);\n[ g1, g2*g5, g3*g4*g5^2, g4*g5, g5 ]\ngap> # Unfortunately, it seems that a lot of code that\ngap> # really should be using Ngs or Cgs is using Igs incorrectly.\ngap> # For example, direct products could return *invalid* embeddings:\ngap> D := DirectProduct(G, G);\nPcp-group with orders [ 2, 2, 2, 2, 3, 2, 2, 2, 2, 3 ]\ngap> hom:=Embedding(D,1);;\ngap> mapi:=MappingGeneratorsImages(hom);;\ngap> GroupHomomorphismByImages(Source(hom),Range(hom),mapi[1],mapi[2]) <> fail;\ntrue\ngap> hom:=Projection(D,1);;\ngap> mapi:=MappingGeneratorsImages(hom);;\ngap> GroupHomomorphismByImages(Source(hom),Range(hom),mapi[1],mapi[2]) <> fail;\ntrue\n\n\ngap> # Check for bug computing Schur extension of infinite cyclic groups,\ngap> # found by Max Horn 2012-05-25\ngap> G:=AbelianPcpGroup(1,[0]);\nPcp-group with orders [ 0 ]\ngap> # The next command used to trigger an error\ngap> SchurExtension(G);\nPcp-group with orders [ 0 ]\n\n\ngap> # Check for bug computing Schur extensions of subgroups, found by MH 2012-05-25.\ngap> G:=HeisenbergPcpGroup(2);\nPcp-group with orders [ 0, 0, 0, 0, 0 ]\ngap> H:=Subgroup(G,[G.2^3*G.3^2, G.1^9]);\nPcp-group with orders [ 0, 0, 0 ]\ngap> # The next command used to trigger an error\ngap> SchurExtension(H);\nPcp-group with orders [ 0, 0, 0, 0, 0, 0 ]\n\n\ngap> # Check for bug computing Schur extensions of subgroups, found by MH 2012-05-25.\ngap> G:=HeisenbergPcpGroup(2);\nPcp-group with orders [ 0, 0, 0, 0, 0 ]\ngap> H:=Subgroup(G,[G.1, G.2]);\nPcp-group with orders [ 0, 0 ]\ngap> # The next command used to trigger an error\ngap> SchurExtension(H);\nPcp-group with orders [ 0, 0, 0 ]\n\n\ngap> # Check for bug computing normalizer of two subgroups, found by MH 2012-05-30.\ngap> # The problem was caused by incorrect resp. overly restrictive use of Parent().\ngap> G:=HeisenbergPcpGroup(2);\nPcp-group with orders [ 0, 0, 0, 0, 0 ]\ngap> A:=Subgroup(Subgroup(G,[G.2,G.3,G.4,G.5]), [G.3]);\nPcp-group with orders [ 0 ]\ngap> B:=Subgroup(Subgroup(G,[G.1,G.4,G.5]), [G.4]);\nPcp-group with orders [ 0 ]\ngap> Normalizer(A,B);\nPcp-group with orders [ 0 ]\ngap> # The following used to trigger the error \"arguments must have a common parent group\"\ngap> Normalizer(B,A);\nPcp-group with orders [ 0 ]\n\n\ngap> # In polycyclic 2.9 and 2.10, the code for 2-cohomology computations was broken.\ngap> G := UnitriangularPcpGroup(3,0);\nPcp-group with orders [ 0, 0, 0 ]\ngap> mats := G!.mats;\n[ [ [ 1, 1, 0 ], [ 0, 1, 0 ], [ 0, 0, 1 ] ], \n [ [ 1, 0, 0 ], [ 0, 1, 1 ], [ 0, 0, 1 ] ], \n [ [ 1, 0, 1 ], [ 0, 1, 0 ], [ 0, 0, 1 ] ] ]\ngap> C := CRRecordByMats(G,mats);;\ngap> cc := TwoCohomologyCR(C);;\ngap> cc.factor.rels;\n[ 2, 0, 0 ]\ngap> c := cc.factor.prei[2];\n[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, -1, 1 ]\ngap> cc.gcb;\n[ [ 0, 0, 1, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ], \n [ 0, 0, -1, 0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0, 0, 0 ], \n [ 0, -1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, -1 ], \n [ -1, 0, 1, 1, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0 ], \n [ 0, -1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, 1 ] ]\ngap> cc.gcc;\n[ [ 1, 0, 0, 0, 0, -2, -1, 0, 1, 1, -1, -1, 0, 0, 0, 0, 0, 0 ], \n [ 0, 1, 0, 0, -1, -1, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0, 0, 0 ], \n [ 0, 0, 1, 0, 0, -2, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0, 0, 0 ], \n [ 0, 0, 0, 1, 0, 0, -1, -1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0 ], \n [ 0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0, 0, 0 ], \n [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, -1, 1 ], \n [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, -1 ] ]\n\n\ngap> # LowerCentralSeriesOfGroup for non-nilpotent pcp-groups used to trigger\ngap> # an infinite recursion\ngap> G := PcGroupToPcpGroup(SmallGroup(6,1));\nPcp-group with orders [ 2, 3 ]\ngap> LowerCentralSeriesOfGroup(G);\n[ Pcp-group with orders [ 2, 3 ], Pcp-group with orders [ 3 ] ]\n\n\ngap> STOP_TEST( \"bugfix.tst\", 10000000);\n" }, { "path": "src/test/resources/samples/langs/GAP/example.gd", "content": "#############################################################################\n##\n#W example.gd\n##\n## This file contains a sample of a GAP declaration file.\n##\nDeclareProperty( \"SomeProperty\", IsLeftModule );\nDeclareGlobalFunction( \"SomeGlobalFunction\" );\n\n\n#############################################################################\n##\n#C IsQuuxFrobnicator()\n##\n## \n## \n##\n## \n## Tests whether R is a quux frobnicator.\n## \n## \n##\nDeclareSynonym( \"IsQuuxFrobnicator\", IsField and IsGroup );\n" }, { "path": "src/test/resources/samples/langs/GAP/example.gi", "content": "#############################################################################\n##\n#W example.gd\n##\n## This file contains a sample of a GAP implementation file.\n##\n\n\n#############################################################################\n##\n#M SomeOperation( )\n##\n## performs some operation on \n##\nInstallMethod( SomeProperty,\n \"for left modules\",\n [ IsLeftModule ], 0,\n function( M )\n if IsFreeLeftModule( M ) and not IsTrivial( M ) then\n return true;\n fi;\n TryNextMethod();\n end );\n\n\n\n#############################################################################\n##\n#F SomeGlobalFunction( )\n##\n## A global variadic funfion.\n##\nInstallGlobalFunction( SomeGlobalFunction, function( arg )\n if Length( arg ) = 3 then\n return arg[1] + arg[2] * arg[3];\n elif Length( arg ) = 2 then\n return arg[1] - arg[2]\n else\n Error( \"usage: SomeGlobalFunction( , [, ] )\" );\n fi;\n end );\n\n\n#\n# A plain function.\n#\nSomeFunc := function(x, y)\n local z, func, tmp, j;\n z := x * 1.0;\n y := 17^17 - y;\n func := a -> a mod 5;\n tmp := List( [1..50], func );\n while y > 0 do\n for j in tmp do\n Print(j, \"\\n\");\n od;\n repeat\n y := y - 1;\n until 0 < 1;\n y := y -1;\n od;\n return z;\nend;\n " }, { "path": "src/test/resources/samples/langs/GAP/factor.tst", "content": "gap> START_TEST(\"Test of factor groups and natural homomorphisms\");\n\ngap> G:=HeisenbergPcpGroup(2);\nPcp-group with orders [ 0, 0, 0, 0, 0 ]\n\ngap> H:=Subgroup(G,[G.2,G.3,G.4,G.5]);\ngap> K:=G/H;\ngap> NaturalHomomorphism(K);\n\ngap> A:=Subgroup(H, [G.3]);\nPcp-group with orders [ 0 ]\ngap> B:=Subgroup(Subgroup(G,[G.1,G.4,G.5]), [G.4]);\nPcp-group with orders [ 0 ]\ngap> Normalizer(A,B);\nPcp-group with orders [ 0 ]\ngap> # The following used to trigger the error \"arguments must have a common parent group\"\ngap> Normalizer(B,A);\nPcp-group with orders [ 0 ]\n\n\ngap> STOP_TEST( \"factor.tst\", 10000000);\n" }, { "path": "src/test/resources/samples/langs/GAP/vspc.gd", "content": "#############################################################################\n##\n#W vspc.gd GAP library Thomas Breuer\n##\n##\n#Y Copyright (C) 1997, Lehrstuhl D für Mathematik, RWTH Aachen, Germany\n#Y (C) 1998 School Math and Comp. Sci., University of St Andrews, Scotland\n#Y Copyright (C) 2002 The GAP Group\n##\n## This file declares the operations for vector spaces.\n##\n## The operations for bases of free left modules can be found in the file\n## lib/basis.gd.\n##\n\n\n#############################################################################\n##\n#C IsLeftOperatorRing()\n##\n## \n## \n##\n## \n## \n## \n##\nDeclareSynonym( \"IsLeftOperatorRing\",\n IsLeftOperatorAdditiveGroup and IsRing and IsAssociativeLOpDProd );\n#T really?\n\n\n#############################################################################\n##\n#C IsLeftOperatorRingWithOne()\n##\n## \n## \n##\n## \n## \n## \n##\nDeclareSynonym( \"IsLeftOperatorRingWithOne\",\n IsLeftOperatorAdditiveGroup and IsRingWithOne\n and IsAssociativeLOpDProd );\n#T really?\n\n\n#############################################################################\n##\n#C IsLeftVectorSpace( )\n#C IsVectorSpace( )\n##\n## <#GAPDoc Label=\"IsLeftVectorSpace\">\n## \n## \n## \n##\n## \n## A vector space in &GAP; is a free left module\n## (see ) over a division ring\n## (see Chapter ).\n##

\n## Whenever we talk about an F-vector space V then V is\n## an additive group (see ) on which the\n## division ring F acts via multiplication from the left such that\n## this action and the addition in V are left and right distributive.\n## The division ring F can be accessed as value of the attribute\n## .\n##

\n## Vector spaces in &GAP; are always left vector spaces,\n## and are\n## synonyms.\n## \n## \n## <#/GAPDoc>\n##\nDeclareSynonym( \"IsLeftVectorSpace\",\n IsLeftModule and IsLeftActedOnByDivisionRing );\n\nDeclareSynonym( \"IsVectorSpace\", IsLeftVectorSpace );\n\nInstallTrueMethod( IsFreeLeftModule,\n IsLeftModule and IsLeftActedOnByDivisionRing );\n\n\n#############################################################################\n##\n#F IsGaussianSpace( )\n##\n## <#GAPDoc Label=\"IsGaussianSpace\">\n## \n## \n##\n## \n## The filter (see )\n## for the row space (see )\n## or matrix space (see ) V\n## over the field F, say,\n## indicates that the entries of all row vectors or matrices in V,\n## respectively, are all contained in F.\n## In this case, V is called a Gaussian vector space.\n## Bases for Gaussian spaces can be computed using Gaussian elimination for\n## a given list of vector space generators.\n## mats:= [ [[1,1],[2,2]], [[3,4],[0,1]] ];;\n## gap> V:= VectorSpace( Rationals, mats );;\n## gap> IsGaussianSpace( V );\n## true\n## gap> mats[1][1][1]:= E(4);; # an element in an extension field\n## gap> V:= VectorSpace( Rationals, mats );;\n## gap> IsGaussianSpace( V );\n## false\n## gap> V:= VectorSpace( Field( Rationals, [ E(4) ] ), mats );;\n## gap> IsGaussianSpace( V );\n## true\n## ]]>\n## \n## \n## <#/GAPDoc>\n##\nDeclareFilter( \"IsGaussianSpace\", IsVectorSpace );\n\nInstallTrueMethod( IsGaussianSpace,\n IsVectorSpace and IsFullMatrixModule );\n\nInstallTrueMethod( IsGaussianSpace,\n IsVectorSpace and IsFullRowModule );\n\n\n#############################################################################\n##\n#C IsDivisionRing( )\n##\n## <#GAPDoc Label=\"IsDivisionRing\">\n## \n## \n##\n## \n## A division ring in &GAP; is a nontrivial associative algebra\n## D with a multiplicative inverse for each nonzero element.\n## In &GAP; every division ring is a vector space over a division ring\n## (possibly over itself).\n## Note that being a division ring is thus not a property that a ring can\n## get, because a ring is usually not represented as a vector space.\n##

\n## The field of coefficients is stored as the value of the attribute\n## of D.\n## \n## \n## <#/GAPDoc>\n##\nDeclareSynonymAttr( \"IsDivisionRing\",\n IsMagmaWithInversesIfNonzero\n and IsLeftOperatorRingWithOne\n and IsLeftVectorSpace\n and IsNonTrivial\n and IsAssociative\n and IsEuclideanRing );\n\n\n#############################################################################\n##\n#A GeneratorsOfLeftVectorSpace( )\n#A GeneratorsOfVectorSpace( )\n##\n## <#GAPDoc Label=\"GeneratorsOfLeftVectorSpace\">\n## \n## \n## \n##\n## \n## For an F-vector space V,\n## returns a list of vectors in\n## V that generate V as an F-vector space.\n## GeneratorsOfVectorSpace( FullRowSpace( Rationals, 3 ) );\n## [ [ 1, 0, 0 ], [ 0, 1, 0 ], [ 0, 0, 1 ] ]\n## ]]>\n## \n## \n## <#/GAPDoc>\n##\nDeclareSynonymAttr( \"GeneratorsOfLeftVectorSpace\",\n GeneratorsOfLeftOperatorAdditiveGroup );\n\nDeclareSynonymAttr( \"GeneratorsOfVectorSpace\",\n GeneratorsOfLeftOperatorAdditiveGroup );\n\n\n#############################################################################\n##\n#A CanonicalBasis( )\n##\n## <#GAPDoc Label=\"CanonicalBasis\">\n## \n## \n##\n## \n## If the vector space V supports a canonical basis then\n## returns this basis,\n## otherwise fail is returned.\n##

\n## The defining property of a canonical basis is that its vectors are\n## uniquely determined by the vector space.\n## If canonical bases exist for two vector spaces over the same left acting\n## domain (see ) then the equality of\n## these vector spaces can be decided by comparing the canonical bases.\n##

\n## The exact meaning of a canonical basis depends on the type of V.\n## Canonical bases are defined for example for Gaussian row and matrix\n## spaces (see ).\n##

\n## If one designs a new kind of vector spaces\n## (see ) and\n## defines a canonical basis for these spaces then the\n## method one installs\n## (see )\n## must not call .\n## On the other hand, one probably should install a \n## method that simply calls ,\n## the value of the method\n## (see  and\n## )\n## being CANONICAL_BASIS_FLAGS.\n## vecs:= [ [ 1, 2, 3 ], [ 1, 1, 1 ], [ 1, 1, 1 ] ];;\n## gap> V:= VectorSpace( Rationals, vecs );;\n## gap> B:= CanonicalBasis( V );\n## CanonicalBasis( )\n## gap> BasisVectors( B );\n## [ [ 1, 0, -1 ], [ 0, 1, 2 ] ]\n## ]]>\n## \n## \n## <#/GAPDoc>\n##\nDeclareAttribute( \"CanonicalBasis\", IsFreeLeftModule );\n\n\n#############################################################################\n##\n#F IsRowSpace( )\n##\n## <#GAPDoc Label=\"IsRowSpace\">\n## \n## \n##\n## \n## A row space in &GAP; is a vector space that consists of\n## row vectors (see Chapter ).\n## \n## \n## <#/GAPDoc>\n##\nDeclareSynonym( \"IsRowSpace\", IsRowModule and IsVectorSpace );\n\n\n#############################################################################\n##\n#F IsGaussianRowSpace( )\n##\n## \n## \n##\n## \n## A row space is Gaussian if the left acting domain contains all\n## scalars that occur in the vectors.\n## Thus one can use Gaussian elimination in the calculations.\n##

\n## (Otherwise the space is non-Gaussian.\n## We will need a flag for this to write down methods that delegate from\n## non-Gaussian spaces to Gaussian ones.)\n## \n## \n## \n##\nDeclareSynonym( \"IsGaussianRowSpace\", IsGaussianSpace and IsRowSpace );\n\n\n#############################################################################\n##\n#F IsNonGaussianRowSpace( )\n##\n## \n## \n##\n## \n## If an F-vector space V is in the filter\n## then this expresses that V\n## consists of row vectors (see ) such\n## that not all entries in these row vectors are contained in F\n## (so Gaussian elimination cannot be used to compute an F-basis\n## from a list of vector space generators),\n## and that V is handled via the mechanism of nice bases\n## (see ) in the following way.\n## Let K be the field spanned by the entries of all vectors in\n## V.\n## Then the value of V is\n## a basis B of the field extension K / ( K \\cap F ),\n## and the value of v \\in V\n## is defined by replacing each entry of v by the list of its\n## B-coefficients, and then forming the concatenation.\n##

\n## So the associated nice vector space is a Gaussian row space\n## (see ).\n## \n## \n##\nDeclareHandlingByNiceBasis( \"IsNonGaussianRowSpace\",\n \"for non-Gaussian row spaces\" );\n\n\n#############################################################################\n##\n#F IsMatrixSpace( )\n##\n## <#GAPDoc Label=\"IsMatrixSpace\">\n## \n## \n##\n## \n## A matrix space in &GAP; is a vector space that consists of matrices\n## (see Chapter ).\n## \n## \n## <#/GAPDoc>\n##\nDeclareSynonym( \"IsMatrixSpace\", IsMatrixModule and IsVectorSpace );\n\n\n#############################################################################\n##\n#F IsGaussianMatrixSpace( )\n##\n## \n## \n##\n## \n## A matrix space is Gaussian if the left acting domain contains all\n## scalars that occur in the vectors.\n## Thus one can use Gaussian elimination in the calculations.\n##

\n## (Otherwise the space is non-Gaussian.\n## We will need a flag for this to write down methods that delegate from\n## non-Gaussian spaces to Gaussian ones.)\n## \n## \n##\nDeclareSynonym( \"IsGaussianMatrixSpace\", IsGaussianSpace and IsMatrixSpace );\n\n\n#############################################################################\n##\n#F IsNonGaussianMatrixSpace( )\n##\n## \n## \n##\n## \n## If an F-vector space V is in the filter\n## \n## then this expresses that V consists of matrices\n## (see )\n## such that not all entries in these matrices are contained in F\n## (so Gaussian elimination cannot be used to compute an F-basis\n## from a list of vector space generators),\n## and that V is handled via the mechanism of nice bases\n## (see ) in the following way.\n## Let K be the field spanned by the entries of all vectors in V.\n## The value of V is irrelevant,\n## and the value of v \\in V\n## is defined as the concatenation of the rows of v.\n##

\n## So the associated nice vector space is a (not necessarily Gaussian)\n## row space (see ).\n## \n## \n##\nDeclareHandlingByNiceBasis( \"IsNonGaussianMatrixSpace\",\n \"for non-Gaussian matrix spaces\" );\n\n\n#############################################################################\n##\n#A NormedRowVectors( ) . . . normed vectors in a Gaussian row space \n##\n## <#GAPDoc Label=\"NormedRowVectors\">\n## \n## \n##\n## \n## For a finite Gaussian row space V\n## (see , ),\n## returns a list of those nonzero\n## vectors in V that have a one in the first nonzero component.\n##

\n## The result list can be used as action domain for the action of a matrix\n## group via , which yields the natural action on\n## one-dimensional subspaces of V\n## (see also ).\n## vecs:= NormedRowVectors( GF(3)^2 );\n## [ [ 0*Z(3), Z(3)^0 ], [ Z(3)^0, 0*Z(3) ], [ Z(3)^0, Z(3)^0 ], \n## [ Z(3)^0, Z(3) ] ]\n## gap> Action( GL(2,3), vecs, OnLines );\n## Group([ (3,4), (1,2,4) ])\n## ]]>\n## \n## \n## <#/GAPDoc>\n##\nDeclareAttribute( \"NormedRowVectors\", IsGaussianSpace );\n\n\n#############################################################################\n##\n#A TrivialSubspace( )\n##\n## <#GAPDoc Label=\"TrivialSubspace\">\n## \n## \n##\n## \n## For a vector space V, returns the\n## subspace of V that consists of the zero vector in V.\n## V:= GF(3)^3;;\n## gap> triv:= TrivialSubspace( V );\n## \n## gap> AsSet( triv );\n## [ [ 0*Z(3), 0*Z(3), 0*Z(3) ] ]\n## ]]>\n## \n## \n## <#/GAPDoc>\n##\nDeclareSynonymAttr( \"TrivialSubspace\", TrivialSubmodule );\n\n\n#############################################################################\n##\n#F VectorSpace( , [, ][, \"basis\"] )\n##\n## <#GAPDoc Label=\"VectorSpace\">\n## \n## \n##\n## \n## For a field F and a collection gens of vectors,\n## returns the F-vector space spanned by\n## the elements in gens.\n##

\n## The optional argument zero can be used to specify the zero element\n## of the space; zero must be given if gens is empty.\n## The optional string \"basis\" indicates that gens is known to\n## be linearly independent over F, in particular the dimension of the\n## vector space is immediately set;\n## note that need not return the basis formed by\n## gens if the string \"basis\" is given as an argument.\n## \n## V:= VectorSpace( Rationals, [ [ 1, 2, 3 ], [ 1, 1, 1 ] ] );\n## \n## ]]>\n## \n## \n## <#/GAPDoc>\n##\nDeclareGlobalFunction( \"VectorSpace\" );\n\n\n#############################################################################\n##\n#F Subspace( , [, \"basis\"] ) . subspace of generated by \n#F SubspaceNC( , [, \"basis\"] )\n##\n## <#GAPDoc Label=\"Subspace\">\n## \n## \n## \n##\n## \n## For an F-vector space V and a list or collection\n## gens that is a subset of V,\n## returns the F-vector space spanned by\n## gens; if gens is empty then the trivial subspace\n## (see ) of V is returned.\n## The parent (see ) of the returned vector space\n## is set to V.\n##

\n## does the same as ,\n## except that it omits the check whether gens is a subset of\n## V.\n##

\n## The optional string \"basis\" indicates that gens is known to\n## be linearly independent over F.\n## In this case the dimension of the subspace is immediately set,\n## and both and do\n## not check whether gens really is linearly independent and\n## whether gens is a subset of V.\n## \n## V:= VectorSpace( Rationals, [ [ 1, 2, 3 ], [ 1, 1, 1 ] ] );;\n## gap> W:= Subspace( V, [ [ 0, 1, 2 ] ] );\n## \n## ]]>\n## \n## \n## <#/GAPDoc>\n##\nDeclareSynonym( \"Subspace\", Submodule );\n\nDeclareSynonym( \"SubspaceNC\", SubmoduleNC );\n\n\n#############################################################################\n##\n#O AsVectorSpace( , ) . . . . . . . . . view as -vector space\n##\n## <#GAPDoc Label=\"AsVectorSpace\">\n## \n## \n##\n## \n## Let F be a division ring and D a domain.\n## If the elements in D form an F-vector space then\n## returns this F-vector space,\n## otherwise fail is returned.\n##

\n## can be used for example to view a given\n## vector space as a vector space over a smaller or larger division ring.\n## V:= FullRowSpace( GF( 27 ), 3 );\n## ( GF(3^3)^3 )\n## gap> Dimension( V ); LeftActingDomain( V );\n## 3\n## GF(3^3)\n## gap> W:= AsVectorSpace( GF( 3 ), V );\n## \n## gap> Dimension( W ); LeftActingDomain( W );\n## 9\n## GF(3)\n## gap> AsVectorSpace( GF( 9 ), V );\n## fail\n## ]]>\n## \n## \n## <#/GAPDoc>\n##\nDeclareSynonym( \"AsVectorSpace\", AsLeftModule );\n\n\n#############################################################################\n##\n#O AsSubspace( , ) . . . . . . . . . . . view as subspace of \n##\n## <#GAPDoc Label=\"AsSubspace\">\n## \n## \n##\n## \n## Let V be an F-vector space, and U a collection.\n## If U is a subset of V such that the elements of U\n## form an F-vector space then returns this\n## vector space, with parent set to V\n## (see ).\n## Otherwise fail is returned.\n## V:= VectorSpace( Rationals, [ [ 1, 2, 3 ], [ 1, 1, 1 ] ] );;\n## gap> W:= VectorSpace( Rationals, [ [ 1/2, 1/2, 1/2 ] ] );;\n## gap> U:= AsSubspace( V, W );\n## \n## gap> Parent( U ) = V;\n## true\n## gap> AsSubspace( V, [ [ 1, 1, 1 ] ] );\n## fail\n## ]]>\n## \n## \n## <#/GAPDoc>\n##\nDeclareOperation( \"AsSubspace\", [ IsVectorSpace, IsCollection ] );\n\n\n#############################################################################\n##\n#F Intersection2Spaces( , , )\n##\n## \n## \n##\n## \n## is a function that takes two arguments V and W which must\n## be finite dimensional vector spaces,\n## and returns the intersection of V and W.\n##

\n## If the left acting domains are different then let F be their\n## intersection.\n## The intersection of V and W is computed as intersection of\n## AsStruct( F, V ) and\n## AsStruct( F, V ).\n##

\n## If the left acting domains are equal to F then the intersection of\n## V and W is returned either as F-Substruct\n## with the common parent of V and W or as\n## F-Struct, in both cases with known basis.\n##

\n## This function is used to handle the intersections of two vector spaces,\n## two algebras, two algebras-with-one, two left ideals, two right ideals,\n## two two-sided ideals.\n## \n## \n##\nDeclareGlobalFunction( \"Intersection2Spaces\" );\n\n\n#############################################################################\n##\n#F FullRowSpace( , )\n##\n## <#GAPDoc Label=\"FullRowSpace\">\n## \n## \n## \n##\n## \n## For a field F and a nonnegative integer n,\n## returns the F-vector space that\n## consists of all row vectors (see ) of\n## length n with entries in F.\n##

\n## An alternative to construct this vector space is via\n## F^n.\n## FullRowSpace( GF( 9 ), 3 );\n## ( GF(3^2)^3 )\n## gap> GF(9)^3; # the same as above\n## ( GF(3^2)^3 )\n## ]]>\n## \n## \n## <#/GAPDoc>\n##\nDeclareSynonym( \"FullRowSpace\", FullRowModule );\nDeclareSynonym( \"RowSpace\", FullRowModule );\n\n\n#############################################################################\n##\n#F FullMatrixSpace( , , )\n##\n## <#GAPDoc Label=\"FullMatrixSpace\">\n## \n## \n## \n##\n## \n## For a field F and two positive integers m and n,\n## returns the F-vector space that\n## consists of all m by n matrices\n## (see ) with entries in F.\n##

\n## If m = n then the result is in fact an algebra\n## (see ).\n##

\n## An alternative to construct this vector space is via\n## F^[m,n].\n## FullMatrixSpace( GF(2), 4, 5 );\n## ( GF(2)^[ 4, 5 ] )\n## gap> GF(2)^[ 4, 5 ]; # the same as above\n## ( GF(2)^[ 4, 5 ] )\n## ]]>\n## \n## \n## <#/GAPDoc>\n##\nDeclareSynonym( \"FullMatrixSpace\", FullMatrixModule );\nDeclareSynonym( \"MatrixSpace\", FullMatrixModule );\nDeclareSynonym( \"MatSpace\", FullMatrixModule );\n\n\n#############################################################################\n##\n#C IsSubspacesVectorSpace( )\n##\n## <#GAPDoc Label=\"IsSubspacesVectorSpace\">\n## \n## \n##\n## \n## The domain of all subspaces of a (finite) vector space or of all\n## subspaces of fixed dimension, as returned by \n## (see ) lies in the category\n## .\n## D:= Subspaces( GF(3)^3 );\n## Subspaces( ( GF(3)^3 ) )\n## gap> Size( D );\n## 28\n## gap> iter:= Iterator( D );;\n## gap> NextIterator( iter );\n## \n## gap> NextIterator( iter );\n## \n## gap> IsSubspacesVectorSpace( D );\n## true\n## ]]>\n## \n## \n## <#/GAPDoc>\n##\nDeclareCategory( \"IsSubspacesVectorSpace\", IsDomain );\n\n\n#############################################################################\n##\n#M IsFinite( ) . . . . . . . . . . . . . . . . . for a subspaces domain\n##\n## Returns `true' if is finite.\n## We allow subspaces domains in `IsSubspacesVectorSpace' only for finite\n## vector spaces.\n##\nInstallTrueMethod( IsFinite, IsSubspacesVectorSpace );\n\n\n#############################################################################\n##\n#A Subspaces( [, ] )\n##\n## <#GAPDoc Label=\"Subspaces\">\n## \n## \n##\n## \n## Called with a finite vector space v,\n## returns the domain of all subspaces of V.\n##

\n## Called with V and a nonnegative integer k,\n## returns the domain of all k-dimensional\n## subspaces of V.\n##

\n## Special and methods are\n## provided for these domains.\n## \n## \n## \n## <#/GAPDoc>\n##\nDeclareAttribute( \"Subspaces\", IsLeftModule );\nDeclareOperation( \"Subspaces\", [ IsLeftModule, IsInt ] );\n\n\n#############################################################################\n##\n#F IsSubspace( , )\n##\n## \n## \n##\n## \n## check that U is a vector space that is contained in V\n## \n## \n## \n##\nDeclareGlobalFunction( \"IsSubspace\" );\n\n\n#############################################################################\n##\n#A OrthogonalSpaceInFullRowSpace( )\n##\n## \n## \n##\n## \n## For a Gaussian row space U over F,\n## \n## returns a complement of U in the full row space of same vector\n## dimension as U over F.\n## \n## \n##\nDeclareAttribute( \"OrthogonalSpaceInFullRowSpace\", IsGaussianSpace );\n\n\n#############################################################################\n##\n#P IsVectorSpaceHomomorphism( )\n##\n## \n## \n##\n## \n## A mapping f is a vector space homomorphism (or linear mapping)\n## if the source and range are vector spaces\n## (see )\n## over the same division ring D\n## (see ),\n## and if f( a + b ) = f(a) + f(b) and f( s * a ) = s * f(a)\n## hold for all elements a, b in the source of f and\n## s \\in D.\n## \n## \n##\nDeclareProperty( \"IsVectorSpaceHomomorphism\", IsGeneralMapping );\n\n\n#############################################################################\n##\n#E\n\n" }, { "path": "src/test/resources/samples/langs/GAP/vspc.gi", "content": "#############################################################################\n##\n#W vspc.gi GAP library Thomas Breuer\n##\n##\n#Y Copyright (C) 1997, Lehrstuhl D für Mathematik, RWTH Aachen, Germany\n#Y (C) 1998 School Math and Comp. Sci., University of St Andrews, Scotland\n#Y Copyright (C) 2002 The GAP Group\n##\n## This file contains generic methods for vector spaces.\n##\n\n\n#############################################################################\n##\n#M SetLeftActingDomain( , )\n##\n## check whether the left acting domain of the external left set \n## knows that it is a division ring.\n## This is used, e.g., to tell a free module over a division ring\n## that it is a vector space.\n##\nInstallOtherMethod( SetLeftActingDomain,\n \"method to set also 'IsLeftActedOnByDivisionRing'\",\n [ IsAttributeStoringRep and IsLeftActedOnByRing, IsObject ],0,\n function( extL, D )\n if HasIsDivisionRing( D ) and IsDivisionRing( D ) then\n SetIsLeftActedOnByDivisionRing( extL, true );\n fi;\n TryNextMethod();\n end );\n\n\n#############################################################################\n##\n#M IsLeftActedOnByDivisionRing( )\n##\nInstallMethod( IsLeftActedOnByDivisionRing,\n \"method for external left set that is left acted on by a ring\",\n [ IsExtLSet and IsLeftActedOnByRing ],\n function( M )\n if IsIdenticalObj( M, LeftActingDomain( M ) ) then\n TryNextMethod();\n else\n return IsDivisionRing( LeftActingDomain( M ) );\n fi;\n end );\n\n\n#############################################################################\n##\n#F VectorSpace( , [, ][, \"basis\"] )\n##\n## The only difference between `VectorSpace' and `FreeLeftModule' shall be\n## that the left acting domain of a vector space must be a division ring.\n##\nInstallGlobalFunction( VectorSpace, function( arg )\n if Length( arg ) = 0 or not IsDivisionRing( arg[1] ) then\n Error( \"usage: VectorSpace( , [, ][, \\\"basis\\\"] )\" );\n fi;\n return CallFuncList( FreeLeftModule, arg );\n end );\n\n\n#############################################################################\n##\n#M AsSubspace( , ) . . . . . . . for a vector space and a collection\n##\nInstallMethod( AsSubspace,\n \"for a vector space and a collection\",\n [ IsVectorSpace, IsCollection ],\n function( V, C )\n local newC;\n\n if not IsSubset( V, C ) then\n return fail;\n fi;\n newC:= AsVectorSpace( LeftActingDomain( V ), C );\n if newC = fail then\n return fail;\n fi;\n SetParent( newC, V );\n UseIsomorphismRelation( C, newC );\n UseSubsetRelation( C, newC );\n\n return newC;\n end );\n\n\n#############################################################################\n##\n#M AsLeftModule( , ) . . . . . . for division ring and vector space\n##\n## View the vector space as a vector space over the division ring .\n##\nInstallMethod( AsLeftModule,\n \"method for a division ring and a vector space\",\n [ IsDivisionRing, IsVectorSpace ],\n function( F, V )\n\n local W, # the space, result\n base, # basis vectors of field extension\n gen, # loop over generators of 'V'\n b, # loop over 'base'\n gens, # generators of 'V'\n newgens; # extended list of generators\n\n if Characteristic( F ) <> Characteristic( LeftActingDomain( V ) ) then\n\n # This is impossible.\n return fail;\n\n elif F = LeftActingDomain( V ) then\n\n # No change of the left acting domain is necessary.\n return V;\n\n elif IsSubset( F, LeftActingDomain( V ) ) then\n\n # Check whether 'V' is really a space over the bigger field,\n # that is, whether the set of elements does not change.\n base:= BasisVectors( Basis( AsField( LeftActingDomain( V ), F ) ) );\n for gen in GeneratorsOfLeftModule( V ) do\n for b in base do\n if not b * gen in V then\n\n # The field extension would change the set of elements.\n return fail;\n\n fi;\n od;\n od;\n\n # Construct the space.\n W:= LeftModuleByGenerators( F, GeneratorsOfLeftModule(V), Zero(V) );\n\n elif IsSubset( LeftActingDomain( V ), F ) then\n\n # View 'V' as a space over a smaller field.\n # For that, the list of generators must be extended.\n gens:= GeneratorsOfLeftModule( V );\n if IsEmpty( gens ) then\n W:= LeftModuleByGenerators( F, [], Zero( V ) );\n else\n\n base:= BasisVectors( Basis( AsField( F, LeftActingDomain( V ) ) ) );\n newgens:= [];\n for b in base do\n for gen in gens do\n Add( newgens, b * gen );\n od;\n od;\n W:= LeftModuleByGenerators( F, newgens );\n\n fi;\n\n else\n\n # View 'V' first as space over the intersection of fields,\n # and then over the desired field.\n return AsLeftModule( F,\n AsLeftModule( Intersection( F,\n LeftActingDomain( V ) ), V ) );\n\n fi;\n\n UseIsomorphismRelation( V, W );\n UseSubsetRelation( V, W );\n return W;\n end );\n\n\n#############################################################################\n##\n#M ViewObj( ) . . . . . . . . . . . . . . . . . . . view a vector space\n##\n## print left acting domain, if known also dimension or no. of generators\n##\nInstallMethod( ViewObj,\n \"for vector space with known generators\",\n [ IsVectorSpace and HasGeneratorsOfLeftModule ],\n function( V )\n Print( \"\" );\n end );\n\nInstallMethod( ViewObj,\n \"for vector space with known dimension\",\n [ IsVectorSpace and HasDimension ],\n 1, # override method for known generators\n function( V )\n Print( \"\" );\n end );\n\nInstallMethod( ViewObj,\n \"for vector space\",\n [ IsVectorSpace ],\n function( V )\n Print( \"\" );\n end );\n\n\n#############################################################################\n##\n#M PrintObj( ) . . . . . . . . . . . . . . . . . . . for a vector space\n##\nInstallMethod( PrintObj,\n \"method for vector space with left module generators\",\n [ IsVectorSpace and HasGeneratorsOfLeftModule ],\n function( V )\n Print( \"VectorSpace( \", LeftActingDomain( V ), \", \",\n GeneratorsOfLeftModule( V ) );\n if IsEmpty( GeneratorsOfLeftModule( V ) ) and HasZero( V ) then\n Print( \", \", Zero( V ), \" )\" );\n else\n Print( \" )\" );\n fi;\n end );\n\nInstallMethod( PrintObj,\n \"method for vector space\",\n [ IsVectorSpace ],\n function( V )\n Print( \"VectorSpace( \", LeftActingDomain( V ), \", ... )\" );\n end );\n\n\n#############################################################################\n##\n#M \\/( , ) . . . . . . . . . factor of a vector space by a subspace\n#M \\/( , ) . . . . . . factor of a vector space by a subspace\n##\nInstallOtherMethod( \\/,\n \"method for vector space and collection\",\n IsIdenticalObj,\n [ IsVectorSpace, IsCollection ],\n function( V, vectors )\n if IsVectorSpace( vectors ) then\n TryNextMethod();\n else\n return V / Subspace( V, vectors );\n fi;\n end );\n\nInstallOtherMethod( \\/,\n \"generic method for two vector spaces\",\n IsIdenticalObj,\n [ IsVectorSpace, IsVectorSpace ],\n function( V, W )\n return ImagesSource( NaturalHomomorphismBySubspace( V, W ) );\n end );\n\n\n#############################################################################\n##\n#M Intersection2Spaces( , , )\n##\nInstallGlobalFunction( Intersection2Spaces,\n function( AsStructure, Substructure, Structure )\n return function( V, W )\n local inters, # intersection, result\n F, # coefficients field\n gensV, # list of generators of 'V'\n gensW, # list of generators of 'W'\n VW, # sum of 'V' and 'W'\n B; # basis of 'VW'\n\n if LeftActingDomain( V ) <> LeftActingDomain( W ) then\n\n # Compute the intersection as vector space over the intersection\n # of the coefficients fields.\n # (Note that the characteristic is the same.)\n F:= Intersection2( LeftActingDomain( V ), LeftActingDomain( W ) );\n return Intersection2( AsStructure( F, V ), AsStructure( F, W ) );\n\n elif IsFiniteDimensional( V ) and IsFiniteDimensional( W ) then\n\n # Compute the intersection of two spaces over the same field.\n gensV:= GeneratorsOfLeftModule( V );\n gensW:= GeneratorsOfLeftModule( W );\n if IsEmpty( gensV ) then\n if Zero( V ) in W then\n inters:= V;\n else\n inters:= [];\n fi;\n elif IsEmpty( gensW ) then\n if Zero( V ) in W then\n inters:= W;\n else\n inters:= [];\n fi;\n else\n # Compute a common coefficient space.\n VW:= LeftModuleByGenerators( LeftActingDomain( V ),\n Concatenation( gensV, gensW ) );\n B:= Basis( VW );\n\n # Construct the coefficient subspaces corresponding to 'V' and 'W'.\n gensV:= List( gensV, x -> Coefficients( B, x ) );\n gensW:= List( gensW, x -> Coefficients( B, x ) );\n\n # Construct the intersection of row spaces, and carry back to VW.\n inters:= List( SumIntersectionMat( gensV, gensW )[2],\n x -> LinearCombination( B, x ) );\n\n # Construct the intersection space, if possible with a parent.\n if HasParent( V ) and HasParent( W )\n and IsIdenticalObj( Parent( V ), Parent( W ) ) then\n inters:= Substructure( Parent( V ), inters, \"basis\" );\n elif IsEmpty( inters ) then\n inters:= Substructure( V, inters, \"basis\" );\n SetIsTrivial( inters, true );\n else\n inters:= Structure( LeftActingDomain( V ), inters, \"basis\" );\n fi;\n\n # Run implications by the subset relation.\n UseSubsetRelation( V, inters );\n UseSubsetRelation( W, inters );\n fi;\n\n # Return the result.\n return inters;\n\n else\n TryNextMethod();\n fi;\n end;\nend );\n\n\n#############################################################################\n##\n#M Intersection2( , ) . . . . . . . . . . . . . for two vector spaces\n##\nInstallMethod( Intersection2,\n \"method for two vector spaces\",\n IsIdenticalObj,\n [ IsVectorSpace, IsVectorSpace ],\n Intersection2Spaces( AsLeftModule, SubspaceNC, VectorSpace ) );\n\n\n#############################################################################\n##\n#M ClosureLeftModule( , ) . . . . . . . . . closure of a vector space\n##\nInstallMethod( ClosureLeftModule,\n \"method for a vector space with basis, and a vector\",\n IsCollsElms,\n [ IsVectorSpace and HasBasis, IsVector ],\n function( V, w )\n local B; # basis of 'V'\n\n # We can test membership easily.\n B:= Basis( V );\n#T why easily?\n if Coefficients( B, w ) = fail then\n\n # In the case of a vector space, we know a basis of the closure.\n B:= Concatenation( BasisVectors( B ), [ w ] );\n V:= LeftModuleByGenerators( LeftActingDomain( V ), B );\n UseBasis( V, B );\n\n fi;\n return V;\n end );\n\n\n#############################################################################\n##\n## Methods for collections of subspaces of a vector space\n##\n\n\n#############################################################################\n##\n#R IsSubspacesVectorSpaceDefaultRep( )\n##\n## is the representation of domains of subspaces of a vector space ,\n## with the components 'structure' (with value ) and 'dimension'\n## (with value either the dimension of the subspaces in the domain\n## or the string '\\\"all\\\"', which means that the domain contains all\n## subspaces of ).\n##\nDeclareRepresentation(\n \"IsSubspacesVectorSpaceDefaultRep\",\n IsComponentObjectRep,\n [ \"dimension\", \"structure\" ] );\n#T not IsAttributeStoringRep?\n\n\n#############################################################################\n##\n#M PrintObj( ) . . . . . . . . . . . . . . . . . for a subspaces domain\n##\nInstallMethod( PrintObj,\n \"method for a subspaces domain\",\n [ IsSubspacesVectorSpace and IsSubspacesVectorSpaceDefaultRep ],\n function( D )\n if IsInt( D!.dimension ) then\n Print( \"Subspaces( \", D!.structure, \", \", D!.dimension, \" )\" );\n else\n Print( \"Subspaces( \", D!.structure, \" )\" );\n fi;\n end );\n\n\n#############################################################################\n##\n#M Size( ) . . . . . . . . . . . . . . . . . . . for a subspaces domain\n##\n## The number of $k$-dimensional subspaces in a $n$-dimensional space over\n## the field with $q$ elements is\n## $$\n## a(n,k) = \\prod_{i=0}^{k-1} \\frac{q^n-q^i}{q^k-q^i} =\n## \\prod_{i=0}^{k-1} \\frac{q^{n-i}-1}{q^{k-i}-1}.\n## $$\n## We have the recursion\n## $$\n## a(n,k+1) = a(n,k) \\frac{q^{n-i}-1}{q^{i+1}-1}.\n## $$\n##\n## (The number of all subspaces is $\\sum_{k=0}^n a(n,k)$.)\n##\nInstallMethod( Size,\n \"method for a subspaces domain\",\n [ IsSubspacesVectorSpace and IsSubspacesVectorSpaceDefaultRep ],\n function( D )\n\n local k,\n n,\n q,\n size,\n qn,\n qd,\n ank,\n i;\n\n if D!.dimension = \"all\" then\n\n # all subspaces of the space\n n:= Dimension( D!.structure );\n\n q:= Size( LeftActingDomain( D!.structure ) );\n size:= 1;\n qn:= q^n;\n qd:= q;\n\n # $a(n,0)$\n ank:= 1;\n\n for k in [ 1 .. Int( (n-1)/2 ) ] do\n\n # Compute $a(n,k)$.\n ank:= ank * ( qn - 1 ) / ( qd - 1 );\n qn:= qn / q;\n qd:= qd * q;\n\n size:= size + ank;\n\n od;\n\n size:= 2 * size;\n\n if n mod 2 = 0 then\n\n # Add the number of spaces of dimension $n/2$.\n size:= size + ank * ( qn - 1 ) / ( qd - 1 );\n fi;\n\n else\n\n # number of spaces of dimension 'k' only\n n:= Dimension( D!.structure );\n if D!.dimension < 0 or\n n < D!.dimension then\n return 0;\n elif n / 2 < D!.dimension then\n k:= n - D!.dimension;\n else\n k:= D!.dimension;\n fi;\n\n q:= Size( LeftActingDomain( D!.structure ) );\n size:= 1;\n\n qn:= q^n;\n qd:= q;\n for i in [ 1 .. k ] do\n size:= size * ( qn - 1 ) / ( qd - 1 );\n qn:= qn / q;\n qd:= qd * q;\n od;\n\n fi;\n\n # Return the result.\n return size;\n end );\n\n\n#############################################################################\n##\n#M Enumerator( ) . . . . . . . . . . . . . . . . for a subspaces domain\n##\n## Use the iterator to compute the elements list.\n#T This is not allowed!\n##\nInstallMethod( Enumerator,\n \"method for a subspaces domain\",\n [ IsSubspacesVectorSpace and IsSubspacesVectorSpaceDefaultRep ],\n function( D )\n local iter, # iterator for 'D'\n elms; # elements list, result\n\n iter:= Iterator( D );\n elms:= [];\n while not IsDoneIterator( iter ) do\n Add( elms, NextIterator( iter ) );\n od;\n return elms;\n end );\n#T necessary?\n\n\n#############################################################################\n##\n#M Iterator( ) . . . . . . . . . . . . . . . . . for a subspaces domain\n##\n## uses the subspaces iterator for full row spaces and the mechanism of\n## associated row spaces.\n##\nBindGlobal( \"IsDoneIterator_Subspaces\",\n iter -> IsDoneIterator( iter!.associatedIterator ) );\n\nBindGlobal( \"NextIterator_Subspaces\", function( iter )\n local next;\n next:= NextIterator( iter!.associatedIterator );\n next:= List( GeneratorsOfLeftModule( next ),\n x -> LinearCombination( iter!.basis, x ) );\n return Subspace( iter!.structure, next, \"basis\" );\n end );\n\nBindGlobal( \"ShallowCopy_Subspaces\",\n iter -> rec( structure := iter!.structure,\n basis := iter!.basis,\n associatedIterator := ShallowCopy(\n iter!.associatedIterator ) ) );\n\nInstallMethod( Iterator,\n \"for a subspaces domain\",\n [ IsSubspacesVectorSpace and IsSubspacesVectorSpaceDefaultRep ],\n function( D )\n local V; # the vector space\n\n V:= D!.structure;\n return IteratorByFunctions( rec(\n IsDoneIterator := IsDoneIterator_Subspaces,\n NextIterator := NextIterator_Subspaces,\n ShallowCopy := ShallowCopy_Subspaces,\n structure := V,\n basis := Basis( V ),\n associatedIterator := Iterator(\n Subspaces( FullRowSpace( LeftActingDomain( V ),\n Dimension( V ) ),\n D!.dimension ) ) ) );\n end );\n\n\n#############################################################################\n##\n#M Subspaces( , )\n##\nInstallMethod( Subspaces,\n \"for a vector space, and an integer\",\n [ IsVectorSpace, IsInt ],\n function( V, dim )\n if IsFinite( V ) then\n return Objectify( NewType( CollectionsFamily( FamilyObj( V ) ),\n IsSubspacesVectorSpace\n and IsSubspacesVectorSpaceDefaultRep ),\n rec(\n structure := V,\n dimension := dim\n )\n );\n else\n TryNextMethod();\n fi;\n end );\n\n\n#############################################################################\n##\n#M Subspaces( )\n##\nInstallMethod( Subspaces,\n \"for a vector space\",\n [ IsVectorSpace ],\n function( V )\n if IsFinite( V ) then\n return Objectify( NewType( CollectionsFamily( FamilyObj( V ) ),\n IsSubspacesVectorSpace\n and IsSubspacesVectorSpaceDefaultRep ),\n rec(\n structure := V,\n dimension := \"all\"\n )\n );\n else\n TryNextMethod();\n fi;\n end );\n\n\n#############################################################################\n##\n#F IsSubspace( , ) . . . . . . . . . . . . . . . . . check <= \n##\nInstallGlobalFunction( IsSubspace, function( V, U )\n return IsVectorSpace( U ) and IsSubset( V, U );\nend );\n\n\n#############################################################################\n##\n#M IsVectorSpaceHomomorphism( )\n##\nInstallMethod( IsVectorSpaceHomomorphism,\n [ IsGeneralMapping ],\n function( map )\n local S, R, F;\n S:= Source( map );\n if not IsVectorSpace( S ) then\n return false;\n fi;\n R:= Range( map );\n if not IsVectorSpace( R ) then\n return false;\n fi;\n F:= LeftActingDomain( S );\n return ( F = LeftActingDomain( R ) ) and IsLinearMapping( F, map );\n end );\n\n\n#############################################################################\n##\n#E\n\n" }, { "path": "src/test/resources/samples/langs/GCC Machine Description/pdp10.md", "content": ";;- Machine description for the PDP-10.\n;; Copyright (C) 2001, 2002 Lars Brinkhoff.\n;; Contributed by Lars Brinkhoff , funded by XKL, LLC.\n\n\f\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Index\n\n;; Front Page\n;; Index\n;; Constraints for Immediate Operands\n;; To-do List\n;; Instruction Wish-List\n;; Attributes\n;;\tlength, skip, reorg_type\n;; Unspec Usage\n;;\tUNSPEC_ADJSP, UNSPEC_ADJBP, UNSPEC_ADDRESS, UNSPEC_FFO, UNSPEC_SUBBP,\n;;\tVUNSPEC_BLT, VUNSPEC_FSC, VUNSPEC_XBLT, VUNSPEC_MOVSLJ, VUNSPEC_MOVST\n;; Constants\n;; RIGHT_HALF, LEFT_HALF, SIGNBIT, SP_REGNUM\n;; Optimizations\n;; Data Movement\n;;\tLDB, ILDB, (LDBI), LDBE, ILDBE, (LDBEI), DPB, IDPB, (DPBI),\n;;\tHRR, HRL, HLR, HLL, HRRM, HRLM, HLRM, HLLM,\n;;\tHRRZ, HRLZ, HLRZ, HLLZ, HRRE, HRLE, HLRE, HLLE,\n;;\tSETZM, SETOM,\n;;\tMOVE, MOVEI, MOVSI, HRLOI, HRROI, MOVEM,\n;;\tMOVS, EXCH, SETZB,\n;;\tDMOVE, DMOVEM,\n;;\tBLT, XBLT, (MOVSLJ), (MOVST), (CMPS)\n;; Conditional Data Movement\n;;\tSKIPL, SKIPE, SKIPLE, SKIPGE, SKIPN, SKIPG,\n;;\tTDZA\n;; Integer Arithmetic\n;;\tAOS, SOS,\n;;\tADD, ADDI, ADDM, ADDB, DADD,\n;;\tSUB, SUBI, SUBM, SUBB, DSUB,\n;;\tIMUL, IMULI, IMULM, IMULB, MUL, MULI, MULM, MULB, DMUL,\n;;\tIDIV, IDIVI, IDIVM, DIV, DIVI, DIVM, DDIV,\n;;\tUIDIV, UIDIVI, UIDIVM, UIMOD, UIMODI, UIMODM,\n;;\tMOVN, MOVNM, MOVNS, MOVNI, DMOVN, DMOVNM,\n;;\tMOVM, MOVMM, MOVMS,\n;;\tFFS\n;; Integer Conversions\n;;\tANDI, HRRZ, SEXT, HRRE, ANDI, HRR\n;; Shifting and Rotating\n;;\tLSH, LSHC, ASH, ASHC, ROT, ROTC\n;; Logical Operations\n;;\tAND, ANDI, ANDM, ANDB, TLZ, ANDCMI,\n;;\tANDCA, ANDCAI, ANDCAM, ANDCAB, ANDCBI,\n;;\tANDCM, ANDCMM, ANDCMB,\n;;\tXOR, XORI, XORM, XORB, TLC, EQVI,\n;;\tIOR, IORI, IORM, IORB, TLO, ORCMI,\n;;\tANDCB, ANDCBM, ANDCBB,\n;;\tEQV, EQVM, EQVB,\n;;\tSETCA, SETCAM, SETCAB,\n;;\tSETCM, SETCMM, SETCMB,\n;;\tORCA, ORCAI, ORCAM, ORCAB, ORCBI,\n;;\tORCM, ORCMM, ORCMB,\n;;\tORCB, ORCBM, ORCBB\n;; Floating-point Arithmetic\n;;\tFADR, FADRI, FADRM, FADRB, DFAD, GFAD,\n;;\tFSBR, FSBRI, FSBRM, FSBRB, DFSB, GFSB,\n;;\tMOVM, MOVMM, MOVMS,\n;;\tMOVN, MOVNM, MOVNS, DMOVN, DMOVNM,\n;;\tFMPR, FMPRI, FMPRM, FMPRB, DFMP, GFMP,\n;;\tFDVR, FDVRI, FDVRM, FDVRB, DFDV, GFDV,\n;;\tSQRT, DSQRT, GSQRT,\n;;\tFSC, DFSC, GFSC\n;; Floating-point Conversions\n;;\tFIX, DFIX, GFIX, DDFIX, GDFIX,\n;;\tFLTR, DFLTR, GFLTR, DDFLTR, DGFLTR,\n;;\tGSNGL, GDBLE\n;; Pointer Arithmetic\n;;\tIBP, ADJBP, SUBBP\n;; Unconditional Jumps\n;;\tJFCL, JRST, PUSHJ\n;; Conditional Jumps\n;;\tTRNE, TLNE, TDNE, TRNN, TLNN, TDNN, TLZN,\n;;\tJUMP, SKIP, CAI, CAM,\n;;\tSOJ, SOS, AOJ, AOS,\n;;\tJFFO, CMPBP\n;; Function prologue and epilogue\n;;\tPOPJ, ADJSP, PUSH, POP\n;; Peepholes\n;; Miscellaneous\n;;\n;; Instructions in parentheses are either commented out or not\n;; generated by the compiler.\n\n\f\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Constraints for Immediate Operands\n\n;; 'G'\tAny valid immediate floating-point constant.\n;; 'I'\t0 .. 262143\n;; 'J'\t-262143 .. 0\n;; 'K'\t-131072 .. 131071\n;; 'L'\txxxxxx,,000000 (MOVSI, TLN, TLO, TLC)\n;; 'M'\t-1\n;; 'N'\txxxxxx,,777777 (HRLOI, TLZ)\n;; 'O'\t0\n;; 'P'\t777777,,xxxxxx (HRROI, ORCMI, ANDCBI, ANDCMI)\n;; 'Q'\t1\n;; 'R'\tFloating-point zero.\n;; 'S'\tLocal symbol.\n\n\f\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; To-do List\n\n;; Use peep2_reg_dead_p in peepholes.\n\n;; Unsigned multiplication.\n;;\n;;\tmul 1,3\t\t; multiply AC1 by AC3\n;;\tlsh 2,1\n;;\tlshc 1,-1\t; result in AC2\n\n;; 71-bit arithmetic.\n;;\n;; Addition, subtraction, multiplication, division, arithmetic shift:\n;; supported in hardware.\n;;\n;; Logical shift (left or right).\n;;\n;;\tlsh 2,-1\n;;\tlshc 1,3\n;;\tlsh 2,1\n\n;; 72-bit arithmetic.\n;;\n;; Addition 72 x 72 -> 72.\n;;\n;;\tjfcl 17,.+1\t; add AC1 and AC2 to AC3 and AC4\n;;\tadd 2,4\n;;\tjcry0 [aoja 1,.+1]\n;;\tadd 1,3\t\t; result in AC1 and AC2\n;;\n;; Subtraction 72 x 72 -> 72.\n;;\n;;\tjfcl 17,.+1\t; add AC1 and AC2 to AC3 and AC4\n;;\tsub 2,4\n;;\tjcry0 .+2\n;;\t subi 1,1\n;;\tsub 1,3\t\t; result in AC1 and AC2\n;;\n;; Negation 72 -> 72.\n;;\n;;\tsetcm 1,3\n;;\tmovn 2,4\n;;\tjumpe 2,[aoja 1,.+1]\n;;\n;;\t; to self\n;;\tsetca 1,\n;;\tjumpe 2,[aoja 1,.+2]\n;;\t movn 2,2\n;;\n;; Magnitude 72 -> 72.\n;;\n;;\t; conditional negation\n;;\tjumpge 1,.+4\n;;\tsetca 1,\n;;\tjumpe 2,[aoja 1,.+2]\n;;\t movn 2,2\n;;\n;;\t; mask = x >> 71 (arithmetic shift)\n;;\t; y = (x ^ mask) - mask\n;;\tmove 3,1\n;;\tash 1,-43\t; shortcut\n;;\txor 1,3\n;;\txor 2,3\n;;\tjfcl 17,.+1\n;;\tsub 2,3\n;;\tjcry0 [aoja 1,.+1]\n;;\n;; Signed right shift 72 -> 72.\n;;\n;;\tVariable amount:\n;;\n;;\t; only works if n <= 35\n;;\tmovn 4,3\t; operand in AC1:AC2, shift amount in AC3\n;;\tlshc 1,4\n;;\tlsh 1,3\n;;\tash 1,4\t\t; result in AC1:AC2\n;;\n;;\t; loop\n;;\tjumple 3,.+5\n;;\t lshc 1,-1\n;;\t tlne 1,200000\n;;\t tlo 1,400000\n;;\t sojg 3,.-3\n;;\n;;\t; only works if n <= 70\n;;\ttlnn 1,400000\n;;\t tdza 4,4\n;;\t movsi 4,400000\n;;\tmovei 5,0\n;;\tashc 4,3\n;;\tlsh 5,1\n;;\tlshc 1,3\n;;\tior 1,4\n;;\tior 2,5\n;;\n;;\tFixed amount:\n;;\n;;\tlshc 1,-n\n;;\ttlne 1,mask1\n;;\t tlo 1,mask2\n;;\n;;\tskipge 1\t; or cail 1,0 or jumpge 1,.+2 or tlne 1,400000\n;;\t iori 2,<2^n-1>\n;;\trotc 1,-n\n;;\n;; Signed multiplication 36 x 36 -> 72.\n;;\n;;\tjfcl .+1\t; multiply AC1 by AC3\n;;\tmul 1,3\n;;\tlsh 2,1\n;;\tjov [movsi 1,200000\n;;\t jrst .+4]\n;;\tlshc 1,-1\n;;\ttlne 1,200000\n;;\t tlo 1,400000\t; result in AC1 and AC2\n;;\n;;\tmul 1,3\n;;\tlsh 2,1\n;;\tjumpe 2,[cam 1,[400000000000]\n;;\t jrst .+1\n;;\t movsi 1,200000\n;;\t jrst .+4]\n;;\tlshc 1,-1\n;;\ttlne 1,200000\n;;\t tlo 1,400000\t; result in AC1 and AC2\n;;\n;;\t...\n;;\tlshc 1,-1\n;;\tlsh 1,1\n;;\tash 1,-1\t; result in AC1 and AC2\n;;\n;;\t...\n;;\tskipge 1\n;;\t iori 2,1\n;;\trotc 1,-1\t; result in AC1 and AC2\n;;\n;;\tjfcl .+1\t; multiply AC1 by AC3\n;;\tmul 1,3\n;;\tjov [movsi 1,200000\n;;\t movei 2,0\n;;\t jrst .+5]\n;;\ttrne 1,1\n;;\t tloa 2,400000\n;;\t tlz 2,400000\n;;\tash 1,-1\t; result in AC1 and AC2\n;;\n;;\t 377777,,777777 ^ 2\t\t = 177777,,777777 000000,,000001\n;;\t-400000,,000000 * 377777,,777777 = -177777,,777777 400000,,000000\n;;\t\t\t\t\t(= 600000,,000000 400000,,000000)\n;;\t-400000,,000000 ^ 2\t\t = 200000,,000000 000000,,000000\n;;\t-400000,,000000 * -1\t\t = 000000,,000000 400000,,000000\n;;\t-000000,,000001 ^ 2 = 000000,,000000 000000,,000001\n;;\t-000000,,000001 * 000000,,000001 = -000000,,000000 000000,,000001\n;;\t\t\t\t\t(= 777777,,777777 777777,,777777)\n;;\t-000000,,000001 * 000001,,000001 = -000000,,000000 000001,,000001\n;;\t\t\t\t\t(= 777777,,777777 777776,,777777)\n;;\n;; Signed high part multiplication 36 x 36 -> 36.\n;;\n;;\tjfcl .+1\t; multiply AC1 by AC2\n;;\tmulm 2,1\n;;\tjov [movsi 1,200000\n;;\t jrst .+2]\n;;\tash 1,-1\t; result in AC1\n;;\n;; Unsigned multiplication 36 x 36 -> 72.\n;;\n;;\t377777,,777777 ^ 2\t\t= 177777,,777777 000000,,000001\n;;\t400000,,000000 * 377777,,777777 = 177777,,777777 400000,,000000\n;;\t400000,,000000 ^ 2\t\t= 200000,,000000 000000,,000000\n;;\t400000,,000000 * 777777,,777777 = 377777,,777777 400000,,000000\n;;\t777777,,777777 ^ 2 = 777777,,777776 000000,,000001\n;;\t777777,,777777 * 000000,,000001 = 000000,,000000 777777,,777777\n;;\t777777,,777777 * 000001,,000001 = 000001,,000000 777776,,777777\n;;\n;; Multiplication 72 x 72 -> 72.\n;;\n;;\tdmul 1,3\t; multiply AC1 and AC2 by AC3 and AC4\n;;\tlsh 3,1\n;;\tlshc 2,-1\n;;\tlsh 4,1\n;;\tlshc 3,1\n;;\ttrne 2,1\n;;\t tlo 3,400000\t; result in AC3 and AC4\n;;\n;;\tdmul 1,3\n;;\tlsh 4,1\n;;\tlshc 3,-1\n;;\tlsh 3,2\n;;\tlshc 2,-2\n;;\n;; Comparisons 72 x 72.\n;;\n;;\t; x == y\n;;\tCAMN x+1,y+1\t\t\n;;\t CAME x,y\n;;\t ;here if false\n\n;; TSC, TSO, TSZ. TSNE, TSNN.\n\n;; Ok to negate double-word integer with DMOVN?\n;; Answer: perhaps not.\n;;\n;; If comparison code cares about bit 0 in the second word of a\n;; double-word integer, negation has to set the bit to the right\n;; value.\n\n;; Converting from double float to single float (truncdfsf2) needs\n;; rounding.\n\n;; ANDCMI really faster than TRZ?\n\n;; Add `cmpdi' pattern.\n\n;; Revisit `casesi'.\n\n;; *move_and_skipsi and *move_and_skipsf clobbers accumulator 0. Is\n;; it possible to allocate a scratch register?\n\n;; Peepholes for AOSA and SOSA.\n\n;; \"Self\" half-word instructions.\n\n;; AOBJP, AOBJN?\n\n;; SUBREG of DImode causes bad register allocation:\n;; divmodsi4, divmoddi4, expand_builtin_jffo, ffssi.\n\n;; String instructions. Avoid them for now. REG: \"None of these is\n;; fast. None of these is thoroughly tested. They all require a lot\n;; of registers for setup. They are uncharacteristic of other PDP-10\n;; instructions.\"\n\n;; Test-modify-skip instructions?\n\n;; In case anyone would like to play strange games, this could be\n;; optimized to use a PUSHJ instruction:\n;; static\n;; foo (void **p, void *f)\tFOO:\n;; {\t\t\t\t\tPUSHJ 1,(2)\n;; *++p = &&label;\t\t\tPOPJ 17,\n;; goto *f;\n;; label:\n;; return;\n;; }\n;; And POPJ:\n;; static void\n;; bar (void **p)\t\tBAR:\n;; {\t\t\t\t\tPOPJ 1,\n;; goto *p--;\n;; }\n\n;; Use JSP to call functions with __attribute__ ((fastcall)) or similar.\n\n;; Historical: KA10 software double precision floating-point.\n\n\f\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Instruction Wish-List\n\n;; ILDBE, LDBE - (increment and) load sign-extended byte.\n\n;; LDBI, LDBEI, DPBI - load/deposit byte, then increment.\n\n;; SUBBP - subtract byte pointers.\n\n;; CMPBP - compare byte pointers.\n\n;; SEXT r,n - sign-extend n-bit byte in register r.\n\n;; Clear/set byte.\n\n;; Test byte >0 =0 <0.\n\n;; UIDIV, UDIV, UDDIV - unsigned division (udivsi3, udivdi3).\n\n;; UIMOD, UMOD, UDMOD - unsigned modulo (umodsi3, umoddi3).\n\n;; UJUMP, USKIP, UCAI, UCAM - compare unsigned values.\n\n;; MIN, MAX, UMIN, UMAX - min/max (minsi3, maxsi3, uminsi3, umaxsi3).\n\n;; SQRT, DSQRT, GSQRT - square root (sqrtM2).\n\n;; SIN, DSIN, GSIN - sine function (__builtin_sin).\n\n;; COS, DCOS, GCOS - cosine function (__builtin_cos).\n\n;; Any other mathematical function: TAN, ASIN, ACOS, ATAN, SINH, COSH,\n;; TANH, ASINH, ACOSH, ATANH, EXP, LN, LOG2, LOG10, POW, ... All\n;; potentially in single, double, and giant versions.\n\n;; FFS - find first set, counting least significant bit first (ffsM2).\n\n;; ?DFIX, DFIXR - Double Floating to Integer (fix_truncdfsi2).\n;; ?DFIX, DFIXR - Single Floating to Double Precision Integer (fix_truncsfdi2).\n;; DDFIX, DDFIXR - Double Floating to Double Precision Integer (fix_truncdfdi2)\n\n;; ?DFLTR - Double Float and Round (floatsidf2).\n;; ?DFLTR - Float Double Precision Integer and Round (floatdisf2).\n;; DDFLTR - Double Float Double Precision Integer and Round (floatdidf2).\n\n;; UDFLTR, UGFLTR, ... - Unsigned Float and Round (floatuns...).\n\n;; WAIT - wait for interrupt.\n\n;; XPUSH, XPUSHJ, XPOP, XPOPJ - fast versions for use with a global\n;; stack pointer only.\n\n\f\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Attributes\n\n;; Length of the instruction, in words.\n(define_attr \"length\" \"\" (const_int 1))\n\n;; The instruction is a skip instruction.\n(define_attr \"skip\" \"no,yes\" (const_string \"no\"))\n\n;; Instruction type used in the machine dependent reorg pass.\n(define_attr \"reorg_type\" \"none,ibp,ldb,dpb\" (const_string \"none\"))\n\n\f\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Unspec Usage\n\n(define_constants\n [(UNSPEC_ADJSP\t0)\t; ADJSP operation (Pmode):\n\t\t\t\t; Operand 0 is the stack pointer.\n\t\t\t\t; Operand 1 is the adjustment.\n (UNSPEC_ADJBP\t1)\t; ADJBP operation (Pmode):\n\t\t\t\t; Operand 0 is the byte pointer.\n\t\t\t\t; Operand 1 is the adjustment.\n (UNSPEC_ADDRESS\t2)\t; Effective-address calculation (Pmode):\n\t\t\t\t; Operand 0 is the memory operand.\n (UNSPEC_FFO\t\t3)\t; Find-first-one operation in FFO (SImode):\n\t\t\t\t; Operand 0 is the register.\n (UNSPEC_FSC\t\t4)\t; FSC operation (SFmode, DFmode):\n\t\t\t\t; Operand 0 is the floating-point value.\n\t\t\t\t; Operand 1 is the scale factor.\n (UNSPEC_SHIFT\t5)\t; Left-shift operation (SImode, Pmode):\n\t\t\t\t; Used to compensate for unnecessary\n\t\t\t\t; shifts generated by pointer arithmetic.\n\t\t\t\t; Operand 0 is the value.\n\t\t\t\t; Operand 1 is the shift count.\n (UNSPEC_SHIFTRT\t6)\t; Right-shift operation (SImode, Pmode):\n\t\t\t\t; Used to compensate for unnecessary\n\t\t\t\t; shifts generated by pointer arithmetic.\n\t\t\t\t; Operand 0 is the value.\n\t\t\t\t; Operand 1 is the shift count.\n (UNSPEC_TLNE_TLZA_TLO\t; TLNE-TLZA-TLO sequence (SImode):\n\t\t\t7)\t; Operand 0 is the register.\n\t\t\t\t; Operand 1 is the TLNE operand.\n\t\t\t\t; Operand 2 is the TLZA operand.\n\t\t\t\t; Operand 3 is the TLO operand.\n (UNSPEC_SUBBP\t8)\t; Byte pointer difference (SImode):\n\t\t\t\t; Operand 0 is the first pointer.\n\t\t\t\t; Operand 1 is the second pointer.\n (UNSPEC_CMPBP\t9)\t; Prepare byte pointer for comparison (SImode):\n\t\t\t\t; Operand 0 is the pointer.\n (UNSPEC_REAL_ASHIFT\t10)\t; Arithmetic left shift (SImode, DImode):\n\t\t\t\t; Operand 0 is the value to shift.\n\t\t\t\t; Operand 1 is the amount to shift by.\n (UNSPEC_ASH71\t11)\t; 71-bit arithmetic shift (DImode):\n\t\t\t\t; Operand 0 is the value to shift.\n\t\t\t\t; Operand 1 is the amount to shift by.\n (UNSPEC_MUL71\t12)\t; 71-bit multiplication (DImode):\n\t\t\t\t; Operands 0 and 1 are the multiplicands.\n (UNSPEC_SIGN_EXTEND\t13)\t; Sign extension (SImode):\n\t\t\t\t; Operand 0 is the value to extend.\n\t\t\t\t; Operand 1 is the number of bits to extend.\n (UNSPEC_ZERO_EXTEND\t14)\t; Zero extension (SImode):\n\t\t\t\t; Operand 0 is the value to extend.\n\t\t\t\t; Operand 1 is the number of bits to extend.\n (UNSPEC_TRUNCATE\t15)\t; Truncate (SImode):\n\t\t\t\t; Operand 0 is the value to truncate.\n\t\t\t\t; Operand 1 is the number of bits to trunc.\n (UNSPEC_TRNE_TLO\t16)\t; TLNE-TLO sequence (SImode):\n\t\t\t\t; Operand 0 is the TRNE operand.\n\t\t\t\t; Operand 1 is the TLO operand.\n (UNSPEC_ASHC\t\t17)\t; ASHC operation (DImode):\n\t\t\t\t; Operand 0 is the value to shift.\n\t\t\t\t; Operand 1 is the amount to shift by.\n (UNSPEC_LSHC\t\t18)])\t; ASHC operation (DImode):\n\t\t\t\t; Operand 0 is the value to shift.\n\t\t\t\t; Operand 1 is the amount to shift by.\n\n(define_constants\n [(VUNSPEC_BLOCKAGE\t0)\n (VUNSPEC_BLT\t\t1)\t; BLT operation (BLKmode):\n\t\t\t\t; Operand 0 is the source address.\n\t\t\t\t; Operand 1 is the destination address.\n\t\t\t\t; Operand 2 is the block length.\n (VUNSPEC_XBLT\t2)\t; XBLT operation (BLKmode):\n\t\t\t\t; operand 0 is the block length\n\t\t\t\t; operand 1 is the source address\n\t\t\t\t; operand 2 is the destination address\n (VUNSPEC_MOVSLJ\t3)\t; MOVSLJ operation (BLKmode):\n\t\t\t\t; operand 0 is the register block\n (VUNSPEC_MOVST\t4)\t; MOVST operation (BLKmode):\n\t\t\t\t; operand 0 is the register block\n (VUNSPEC_CMPS\t5)])\t; CMPS operation (BLKmode):\n\t\t\t\t; operand 0 is the register block\n\n\f\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Constants\n\n(define_constants\n [(RIGHT_HALF\t262143)\t\t; 0000000777777\n (LEFT_HALF\t-262144)\t; 0777777000000\n (SIGNBIT\t-34359738368)\t; 0400000000000\n (FP_REGNUM\t13)\t\t; Frame pointer register.\n (SP_REGNUM\t15)])\t\t; Stack pointer register.\n\n\f\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Optimizations\n\n;; Adding a constant to a word pointer is done fastest by (X)MOVEI\n;; op0,const(op1). As a special case, recognize the stack pointer.\n(define_insn \"MOVEI_sp\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(plus:SI (reg:SI SP_REGNUM)\n\t\t (match_operand:SI 1 \"const_int_operand\" \"\")))]\n \"\"\n {\n operands[1] = gen_rtx_PLUS (Pmode, stack_pointer_rtx, operands[1]);\n /* ADDRESS: ... */\n return TARGET_EXTENDED ? \"xmovei %0,%a1\" : \"movei %0,%a1\";\n })\n\n;; Moving from any word pointer is done fastest by (X)MOVEI op0,(op1).\n;; As a special case, recognize the stack pointer.\n(define_insn \"*move_from_sp\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(reg:SI SP_REGNUM))]\n \"\"\n {\n /* ADDRESS: ... */\n return TARGET_EXTENDED ? \"xmovei %0,(17)\" : \"movei %0,(17)\";\n })\n\n;; Load scalar signed chars using HRRE.\n(define_insn \"\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n (sign_extend:SI\n\t (match_operand:QI 1 \"pdp10_maybe_volatile_memory_operand\" \"m\")))]\n \"MEM_SCALAR_P (operands[1])\"\n \"hrre %0,%W1\")\n(define_insn \"\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n (sign_extract:SI\n\t (match_operand:SI 1 \"pdp10_maybe_volatile_memory_operand\" \"m\")\n\t (const_int 9)\n\t (const_int 27)))]\n \"MEM_SCALAR_P (operands[1])\"\n \"hrre %0,%1\")\n\n(define_insn \"\"\n [(set (match_operand:QI 0 \"register_operand\" \"=r\")\n\t(subreg:QI\n\t (zero_extract:SI (match_operand: SI 1 \"memory_operand\" \"m\")\n\t\t\t (const_int 9)\n\t\t\t (const_int 27))\n\t 3))]\n \"MEM_SCALAR_P (operands[1])\"\n \"move %0,%1\")\n\n(define_insn \"\"\n [(set (subreg:QI\n\t (zero_extract:SI (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t\t\t (const_int 9)\n\t\t\t (const_int 27))\n\t 3)\n\t(match_operand:QI 1 \"register_operand\" \"r\"))]\n \"MEM_SCALAR_P (operands[0])\"\n \"movem %1,%0\")\n\n(define_insn \"\"\n [(set (subreg:HI\n\t (zero_extract:SI (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t\t\t (const_int 18)\n\t\t\t (const_int 18))\n\t 2)\n\t(match_operand:HI 1 \"register_operand\" \"r\"))]\n \"MEM_SCALAR_P (operands[0])\"\n \"movem %1,%0\")\n\n(define_insn \"\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(unspec:SI [(subreg:SI (match_operand:QI 1 \"memory_operand\" \"m\") 0)\n\t\t (match_operand 2 \"const_int_operand\" \"\")]\n\t\t UNSPEC_SIGN_EXTEND))]\n \"MEM_SCALAR_P (operands[1]) && INTVAL (operands[2]) >= 18\"\n \"hrre %0,%W1\")\n\n;; Load scalar unsigned chars using MOVE.\n(define_insn \"\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n (zero_extend:SI\n\t (match_operand:QI 1 \"pdp10_maybe_volatile_memory_operand\" \"m\")))]\n \"MEM_SCALAR_P (operands[1])\"\n \"move %0,%W1\")\n; (define_insn \"\"\n; [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n; \t(and:SI\n\t ;; This could well be a scalar int variable.\n; \t (match_operand:SI 1 \"pdp10_maybe_volatile_memory_operand\" \"m\")\n; \t (const_int 511)))]\n; \"MEM_SCALAR_P (operands[1])\"\n; \"move %0,%W1\")\n\n(define_insn \"\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(unspec:SI [(subreg:SI (match_operand:QI 1 \"memory_operand\" \"m\") 0)\n\t\t (match_operand 2 \"const_int_operand\" \"\")]\n\t\t UNSPEC_ZERO_EXTEND))]\n \"MEM_SCALAR_P (operands[1])\"\n \"move %0,%W1\")\n\n;; Store scalar chars using MOVEM.\n(define_insn \"\"\n [(set (match_operand:QI 0 \"pdp10_maybe_volatile_memory_operand\" \"=m\")\n\t(match_operand:QI 1 \"register_operand\" \"r\"))]\n \"MEM_SCALAR_P (operands[0])\"\n \"movem %1,%W0\")\n(define_insn \"\"\n [(set (match_operand:SI 0 \"pdp10_maybe_volatile_memory_operand\" \"=m\")\n\t(sign_extract:SI (match_operand:SI 1 \"register_operand\" \"r\")\n\t\t\t (const_int 9)\n\t\t\t (const_int 27)))]\n \"MEM_SCALAR_P (operands[0])\"\n \"movem %1,%0\")\n(define_insn \"\"\n [(set (zero_extract:SI\n\t (match_operand:SI 0 \"pdp10_maybe_volatile_memory_operand\" \"+m\")\n\t (const_int 9)\n\t (const_int 27))\n\t(and:SI (match_operand:SI 1 \"register_operand\" \"r\")\n\t\t(const_int 511)))]\n \"MEM_SCALAR_P (operands[0])\"\n \"movem %1,%0\")\n\n(define_insn \"\"\n [(set (match_operand:QI 0 \"memory_operand\" \"=m\")\n\t(subreg:QI (unspec:SI [(match_operand:SI 1 \"register_operand\" \"r\")\n\t\t\t (match_operand 2 \"const_int_operand\" \"\")]\n\t\t\t UNSPEC_SIGN_EXTEND)\n\t\t 3))]\n \"MEM_SCALAR_P (operands[0])\"\n \"movem %1,%W0\")\n\n(define_insn \"\"\n [(set (match_operand:QI 0 \"memory_operand\" \"=m\")\n\t(subreg:QI (unspec:SI [(match_operand:SI 1 \"register_operand\" \"r\")\n\t\t\t (match_operand 2 \"const_int_operand\" \"\")]\n\t\t\t UNSPEC_ZERO_EXTEND)\n\t\t 3))]\n \"MEM_SCALAR_P (operands[0])\"\n \"movem %1,%W0\")\n\n;; Load scalar unsigned shorts using MOVE.\n(define_insn \"\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n (zero_extend:SI\n\t (match_operand:HI 1 \"pdp10_maybe_volatile_memory_operand\" \"m\")))]\n \"MEM_SCALAR_P (operands[1])\"\n \"move %0,%W1\")\n(define_insn \"\"\n [(set (match_operand:HI 0 \"register_operand\" \"=r\")\n\t (subreg:HI\n\t (zero_extract:SI\n\t (match_operand:SI 1 \"pdp10_maybe_volatile_memory_operand\" \"m\")\n\t (const_int 18)\n\t (const_int 18))\n\t 2))]\n \"MEM_SCALAR_P (operands[1])\"\n \"move %0,%W1\")\n; (define_insn \"\"\n; [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t\t ;; This could well be a scalar int variable.\n; \t (and:SI (match_operand:SI 1 \"pdp10_maybe_volatile_memory_operand\" \"m\")\n; \t\t (const_int RIGHT_HALF)))]\n; \"MEM_SCALAR_P (operands[1])\"\n; \"move %0,%W1\")\n\n;; Load scalar signed shorts using HRRE.\n(define_insn \"\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(sign_extract:SI\n\t (match_operand:SI 1 \"pdp10_maybe_volatile_memory_operand\" \"m\")\n\t (const_int 18)\n\t (const_int 18)))]\n \"MEM_SCALAR_P (operands[1])\"\n \"hrre %0,%1\")\n(define_insn \"\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(sign_extend:SI\n\t (match_operand:HI 1 \"pdp10_maybe_volatile_memory_operand\" \"m\")))]\n \"MEM_SCALAR_P (operands[1])\"\n \"hrre %0,%W1\")\n\n;; Store scalar shorts using MOVEM.\n(define_insn \"\"\n [(set (match_operand:HI 0 \"pdp10_maybe_volatile_memory_operand\" \"=m\")\n\t(match_operand:HI 1 \"register_operand\" \"r\"))]\n \"MEM_SCALAR_P (operands[0])\"\n \"movem %1,%W0\")\n(define_insn \"\"\n [(set (zero_extract:SI\n\t (match_operand:SI 0 \"pdp10_maybe_volatile_memory_operand\" \"+m\")\n\t (const_int 18)\n\t (const_int 18))\n\t(and:SI (match_operand:SI 1 \"register_operand\" \"r\")\n\t\t(const_int RIGHT_HALF)))]\n \"MEM_SCALAR_P (operands[0])\"\n \"movem %1,%0\")\n\n(define_insn \"*sgeu\"\n [(set (match_operand:SI 0 \"register_operand\" \"=x\")\n\t(ge:SI (xor:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"rm\")\n\t\t (const_int SIGNBIT))\n\t (match_operand:SI 2 \"const_int_operand\" \"\")))]\n \"\"\n {\n HOST_WIDE_INT sign = (HOST_WIDE_INT)1 << 35;\n operands[2] = gen_int_mode (INTVAL (operands[2]) ^ sign, SImode);\n if (INTVAL (operands[2]) & ~(HOST_WIDE_INT)0777777)\n return \"skipl %0,%1\\;%_caml %0,[%2]\\;%_%_trna\\;%_%_%_tdza %0,%0\\;%_%_%_%_movei %0,1\";\n else\n return \"skipl %0,%1\\;%_cail %0,%2\\;%_%_trna\\;%_%_%_tdza %0,%0\\;%_%_%_%_movei %0,1\";\n }\n [(set_attr \"length\" \"5\")])\n\n(define_insn \"*sgeu_plus\"\n [(set (match_operand:SI 0 \"register_operand\" \"=&r\")\n\t(ge:SI (xor:SI (plus:SI (match_operand:SI 1 \"register_operand\" \"r\")\n\t\t\t\t(match_operand:SI 2 \"const_int_operand\" \"\"))\n\t\t (const_int SIGNBIT))\n\t (match_operand:SI 3 \"const_int_operand\" \"\")))]\n \"\"\n {\n HOST_WIDE_INT sign = (HOST_WIDE_INT)1 << 35;\n\n output_asm_insn (\"movei %0,0\", operands);\n\n operands[2] = gen_int_mode (-INTVAL (operands[2]), SImode);\n if (INTVAL (operands[2]) & ~(HOST_WIDE_INT)0777777)\n output_asm_insn (\"caml %1,[%2]\", operands);\n else\n output_asm_insn (\"cail %1,%2\", operands);\n \n operands[3] = gen_int_mode ((INTVAL (operands[3]) ^ sign)\n\t\t\t\t- INTVAL (operands[2]), SImode);\n if (INTVAL (operands[3]) & ~(HOST_WIDE_INT)0777777)\n output_asm_insn (\"%_caml %1,[%3]\", operands);\n else\n output_asm_insn (\"%_cail %1,%3\", operands);\n\n return \"%_%_movei %0,1\";\n }\n [(set_attr \"length\" \"4\")])\n\n(define_insn \"*cbranchgeu\"\n [(set (pc)\n\t(if_then_else\n\t (ge (xor:SI (match_operand:SI 0 \"register_operand\" \"r\")\n\t\t (const_int SIGNBIT))\n\t (match_operand:SI 1 \"const_int_operand\" \"\"))\n\t (label_ref (match_operand 2 \"\" \"\"))\n\t (pc)))]\n \"\"\n {\n rtx ops[5];\n ops[0] = operands[0];\n ops[1] = operands[0];\n ops[2] = GEN_INT (0);\n ops[3] = operands[1];\n ops[4] = operands[2];\n return pdp10_output_range_compare (insn, ops, 0);\n }\n [(set_attr \"length\" \"3\")])\n\n(define_insn \"*cbranchgeu_mem\"\n [(set (pc)\n\t(if_then_else\n\t (ge (xor:SI (match_operand:SI 0 \"memory_operand\" \"m\")\n\t\t (const_int SIGNBIT))\n\t (match_operand:SI 1 \"const_int_operand\" \"\"))\n\t (label_ref (match_operand 2 \"\" \"\"))\n\t (pc)))\n (clobber (match_scratch:SI 3 \"=x\"))]\n \"\"\n {\n rtx ops[5];\n ops[0] = operands[3];\n ops[1] = operands[0];\n ops[2] = GEN_INT (0);\n ops[3] = operands[1];\n ops[4] = operands[2];\n return pdp10_output_range_compare (insn, ops, 0);\n }\n [(set_attr \"length\" \"4\")])\n\n(define_insn \"*cbranchgeu_plus\"\n [(set (pc)\n\t(if_then_else\n\t (ge (xor:SI (plus:SI (match_operand:SI 0 \"reg_or_mem_operand\" \"r\")\n\t\t\t (match_operand:SI 1 \"const_int_operand\" \"\"))\n\t\t (const_int SIGNBIT))\n\t (match_operand:SI 2 \"const_int_operand\" \"\"))\n\t (label_ref (match_operand 3 \"\" \"\"))\n\t (pc)))]\n \"\"\n {\n rtx ops[5];\n ops[0] = operands[0];\n ops[1] = operands[0];\n ops[2] = operands[1];\n ops[3] = operands[2];\n ops[4] = operands[3];\n return pdp10_output_range_compare (insn, ops, 0);\n }\n [(set_attr \"length\" \"3\")])\n\n(define_insn \"*sltu\"\n [(set (match_operand:SI 0 \"register_operand\" \"=x\")\n\t(lt:SI (xor:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"rm\")\n\t\t (const_int SIGNBIT))\n\t (match_operand:SI 2 \"const_int_operand\" \"\")))]\n \"\"\n {\n HOST_WIDE_INT sign = (HOST_WIDE_INT)1 << 35;\n operands[2] = gen_int_mode (INTVAL (operands[2]) ^ sign, SImode);\n if (INTVAL (operands[2]) & ~(HOST_WIDE_INT)0777777)\n return \"skipl %0,%1\\;%_caml %0,[%2]\\;%_%_tdza %0,%0\\;%_%_%_movei %0,1\";\n else\n return \"skipl %0,%1\\;%_cail %0,%2\\;%_%_tdza %0,%0\\;%_%_%_movei %0,1\";\n }\n [(set_attr \"length\" \"4\")])\n\n(define_insn \"*sltu_plus\"\n [(set (match_operand:SI 0 \"register_operand\" \"=x\")\n\t(lt:SI (xor:SI (plus:SI (match_operand:SI 1 \"register_operand\" \"r\")\n\t\t\t\t(match_operand:SI 2 \"const_int_operand\" \"\"))\n\t\t (const_int SIGNBIT))\n\t (match_operand:SI 3 \"const_int_operand\" \"\")))]\n \"\"\n {\n HOST_WIDE_INT sign = (HOST_WIDE_INT)1 << 35;\n\n operands[2] = gen_int_mode (-INTVAL (operands[2]), SImode);\n if (INTVAL (operands[2]) & ~(HOST_WIDE_INT)0777777)\n output_asm_insn (\"caml %1,[%2]\", operands);\n else\n output_asm_insn (\"cail %1,%2\", operands);\n\n operands[3] = gen_int_mode ((INTVAL (operands[3]) ^ sign)\n\t\t\t\t- INTVAL (operands[2]), SImode);\n if (INTVAL (operands[3]) & ~(HOST_WIDE_INT)0777777)\n output_asm_insn (\"%_caml %1,[%3]\", operands);\n else\n output_asm_insn (\"%_cail %1,%3\", operands);\n\n return \"%_%_tdza %0,%0\\;%_%_%_movei %0,1\";\n }\n [(set_attr \"length\" \"4\")])\n\n(define_insn \"*cbranchltu\"\n [(set (pc)\n\t(if_then_else\n\t (lt (xor:SI (match_operand:SI 0 \"register_operand\" \"r\")\n\t\t (const_int SIGNBIT))\n\t (match_operand:SI 1 \"const_int_operand\" \"\"))\n\t (label_ref (match_operand 2 \"\" \"\"))\n\t (pc)))]\n \"\"\n {\n rtx ops[5];\n ops[0] = operands[0];\n ops[1] = operands[0];\n ops[2] = GEN_INT (0);\n ops[3] = operands[1];\n ops[4] = operands[2];\n return pdp10_output_range_compare (insn, ops, 1);\n }\n [(set_attr \"length\" \"4\")])\n\n(define_insn \"*cbranchltu_mem\"\n [(set (pc)\n\t(if_then_else\n\t (lt (xor:SI (match_operand:SI 0 \"memory_operand\" \"m\")\n\t\t (const_int SIGNBIT))\n\t (match_operand:SI 1 \"const_int_operand\" \"\"))\n\t (label_ref (match_operand 2 \"\" \"\"))\n\t (pc)))\n (clobber (match_scratch:SI 3 \"=x\"))]\n \"\"\n {\n rtx ops[5];\n ops[0] = operands[3];\n ops[1] = operands[0];\n ops[2] = GEN_INT (0);\n ops[3] = operands[1];\n ops[4] = operands[2];\n return pdp10_output_range_compare (insn, ops, 1);\n }\n [(set_attr \"length\" \"4\")])\n\n(define_insn \"*cbranchltu_plus\"\n [(set (pc)\n\t(if_then_else\n\t (lt (xor:SI (plus:SI (match_operand:SI 0 \"reg_or_mem_operand\" \"r\")\n\t\t\t (match_operand:SI 1 \"const_int_operand\" \"\"))\n\t\t (const_int SIGNBIT))\n\t (match_operand:SI 2 \"const_int_operand\" \"\"))\n\t (label_ref (match_operand 3 \"\" \"\"))\n\t (pc)))]\n \"\"\n {\n rtx ops[5];\n ops[0] = operands[0];\n ops[1] = operands[0];\n ops[2] = operands[1];\n ops[3] = operands[2];\n ops[4] = operands[3];\n return pdp10_output_range_compare (insn, ops, 1);\n }\n [(set_attr \"length\" \"4\")])\n\n(define_insn \"\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(lshiftrt:SI (match_operand:SI 1 \"memory_operand\" \"m\")\n\t\t (match_operand:SI 2 \"const_int_operand\" \"i\")))]\n \"INTVAL (operands[2]) != 4 && INTVAL (operands[2]) != 18\n && INTVAL (operands[2]) != 20\"\n {\n rtx ops[4];\n ops[0] = operands[0];\n ops[1] = operands[1];\n ops[2] = GEN_INT (BITS_PER_WORD - INTVAL (operands[2]));\n ops[3] = GEN_INT (0);\n if (get_attr_length (insn) == 1)\n output_asm_insn (pdp10_output_extzv (insn, ops), ops);\n else\n output_asm_insn (pdp10_output_extzv_sequence (ops), ops);\n return \"\";\n }\n [(set (attr \"length\")\n\t(if_then_else\n\t (and (ne (symbol_ref \"TARGET_LARGE\") (const_int 0))\n\t (match_operand:SI 1 \"pdp10_constaddr_memory_operand\" \"\"))\n\t (const_int 1)\n\t (const_int 2)))])\n\n(define_insn \"\"\n [(set (match_operand:SI 0 \"memory_operand\" \"=m\")\n\t(and:SI (match_operand:SI 1 \"memory_operand\" \"0\")\n\t\t(const_int LEFT_HALF)))]\n \"\"\n \"hllzs %W0\")\n\n(define_insn \"\"\n [(set (match_operand:HI 0 \"memory_operand\" \"=m\")\n\t(const_int 0))]\n \"MEM_ALIGN (operands[0]) == 36\"\n \"hrrzs %W0\")\n\n(define_insn \"\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"+rm\")\n\t(and:SI (match_dup 0) (const_int RIGHT_HALF)))\n (set (match_operand:SI 1 \"register_operand\" \"=x\")\n\t(and:SI (match_operand:SI 2 \"reg_or_mem_operand\" \"=0\")\n\t\t(const_int RIGHT_HALF)))]\n \"\"\n \"hrrzs %1,%0\")\n\n(define_insn \"\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"+rm\")\n\t(and:SI (match_dup 0) (const_int LEFT_HALF)))\n (set (match_operand:SI 1 \"register_operand\" \"=x\")\n\t(and:SI (match_operand:SI 2 \"reg_or_mem_operand\" \"=0\")\n\t\t(const_int LEFT_HALF)))]\n \"\"\n \"hllzs %1,%0\")\n\n(define_insn \"\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"+rm\")\n\t(ashift:SI (match_dup 0) (const_int 18)))\n (set (match_operand:SI 1 \"register_operand\" \"=x\")\n\t(ashift:SI (match_operand:SI 2 \"reg_or_mem_operand\" \"=0\")\n\t\t (const_int 18)))]\n \"\"\n \"hrlzs %1,%0\")\n\n(define_insn \"\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"+rm\")\n\t(lshiftrt:SI (match_dup 0) (const_int 18)))\n (set (match_operand:SI 1 \"register_operand\" \"=x\")\n\t(lshiftrt:SI (match_operand:SI 2 \"reg_or_mem_operand\" \"=0\")\n\t\t (const_int 18)))]\n \"\"\n \"hlrzs %1,%0\")\n\n(define_insn \"\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"+rm\")\n\t(ior:SI (match_dup 0) (const_int LEFT_HALF)))\n (set (match_operand:SI 1 \"register_operand\" \"=x\")\n\t(ior:SI (match_operand:SI 2 \"reg_or_mem_operand\" \"=0\")\n\t\t(const_int LEFT_HALF)))]\n \"\"\n \"hrros %1,%0\")\n\n(define_insn \"\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"+rm\")\n\t(ior:SI (match_dup 0) (const_int RIGHT_HALF)))\n (set (match_operand:SI 1 \"register_operand\" \"=x\")\n\t(ior:SI (match_operand:SI 2 \"reg_or_mem_operand\" \"=0\")\n\t\t(const_int RIGHT_HALF)))]\n \"\"\n \"hllos %1,%0\")\n\n(define_insn \"\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(ior:SI (ashift:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"rm\")\n\t\t\t (const_int 18))\n\t\t(const_int RIGHT_HALF)))]\n \"\"\n \"hrlo %0,%1\")\n\n(define_insn \"\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(ior:SI (lshiftrt:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"rm\")\n\t\t\t (const_int 18))\n\t\t(const_int LEFT_HALF)))]\n \"\"\n \"hlro %0,%1\")\n\n\f\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Data Movement\n\n(define_expand \"movqi\"\n [(set (match_operand:QI 0 \"reg_or_mem_operand\" \"\")\n (match_operand:QI 1 \"general_operand\" \"\"))]\n \"\"\n \"if (no_new_pseudos)\n {\n if (REG_P (operands[0]) && GET_CODE (operands[1]) == CONST_INT)\n operands[0] = gen_rtx_REG (SImode, REGNO (operands[0]));\n }\n else\n {\n if (GET_CODE (operands[0]) == SUBREG\n\t && GET_CODE (SUBREG_REG (operands[0])) == ZERO_EXTRACT)\n\t {\n\t if (GET_CODE (XEXP (SUBREG_REG (operands[0]), 0)) == MEM\n\t && SUBREG_BYTE (operands[0]) == 3\n\t && GET_CODE (XEXP (SUBREG_REG (operands[0]), 1)) == CONST_INT\n\t && INTVAL (XEXP (SUBREG_REG (operands[0]), 1)) == 9\n\t && GET_CODE (XEXP (SUBREG_REG (operands[0]), 2)) == CONST_INT\n\t && INTVAL (XEXP (SUBREG_REG (operands[0]), 2)) == 27\n\t && MEM_SCALAR_P (XEXP (SUBREG_REG (operands[0]), 0)))\n\t emit_move_insn (XEXP (SUBREG_REG (operands[0]), 0),\n\t\t\t convert_to_mode (SImode, operands[1], 1));\n\t else\n\t emit_move_insn (SUBREG_REG (operands[0]),\n\t\t\t convert_to_mode (SImode, operands[1], 1));\n\t DONE;\n\t }\n else if (GET_CODE (operands[1]) == SUBREG\n\t\t&& GET_CODE (SUBREG_REG (operands[1])) == ZERO_EXTRACT)\n\t {\n\t rtx temp = gen_reg_rtx (SImode);\n\t emit_move_insn (temp, SUBREG_REG (operands[1]));\n\t operands[1] = gen_rtx_SUBREG (QImode, temp, 3);\n\t }\n else if (GET_CODE (operands[1]) == CONST_INT)\n \t {\n \t rtx temp = gen_reg_rtx (SImode);\n \t emit_insn (gen_movsi (temp, operands[1]));\n \t operands[1] = gen_rtx_SUBREG (QImode, temp, 3);\n \t }\n if (GET_CODE (operands[0]) == MEM)\n \t operands[1] = force_reg (QImode, operands[1]);\n }\")\n\n(define_insn \"*movqi_reg\"\n [(set (match_operand:QI 0 \"register_operand\" \"=r\")\n\t(match_operand:QI 1 \"register_operand\" \"r\"))]\n \"\"\n \"move %0,%1\")\n\n(define_insn \"*LDBzqi_sequence\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r,r\")\n (zero_extend:SI (match_operand:QI 1 \"memory_operand\" \"m,>\")))]\n \"TARGET_EXTENDED\n && !CONSTANT_ADDRESS_P (XEXP (operands[1], 0))\n && pdp10_pointer_alignment (XEXP (operands[1], 0)) >= UNITS_PER_WORD\n && (GET_CODE (XEXP (operands[1], 0)) == REG\n || (INTVAL (XEXP (XEXP (operands[1], 0), 1)) % UNITS_PER_WORD == 0))\"\n {\n rtx ops[4];\n ops[0] = operands[0];\n ops[1] = operands[1];\n ops[2] = GEN_INT (9);\n ops[3] = GEN_INT (0);\n output_asm_insn (pdp10_output_extzv_sequence (ops), ops);\n return \"\";\n }\n [(set_attr \"length\" \"2\")])\n\n(define_insn \"*LDBzqi\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r,r\")\n (zero_extend:SI (match_operand:QI 1 \"memory_operand\" \">,m\")))]\n \"\"\n \"*return pdp10_output_load_unsigned_byte (insn, operands);\"\n [(set_attr \"reorg_type\" \"none,ldb\")])\n\n(define_insn \"*LDBIzqi\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n (zero_extend:SI (match_operand:QI 1 \"memory_operand\" \"<\")))]\n \"TARGET_XKL2\"\n \"*return pdp10_output_load_unsigned_byte (insn, operands);\")\n\n(define_insn \"*LDBEqi\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r,r,r\")\n (sign_extend:SI (match_operand:QI 1 \"memory_operand\" \">,<,m\")))]\n \"TARGET_XKL2\"\n \"*return pdp10_output_load_signed_byte (insn, operands);\"\n [(set_attr \"reorg_type\" \"none,none,ldb\")])\n\n(define_insn \"*LDBEqi_sequence\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r,r\")\n (sign_extend:SI (match_operand:QI 1 \"memory_operand\" \">,m\")))]\n \"!TARGET_XKL2\"\n {\n if (/*CONSTANT_ADDRESS_P (XEXP (operands[1], 0)) || */\n\tpdp10_pointer_alignment (XEXP (operands[1], 0)) >= UNITS_PER_WORD)\n {\n\trtx ops[4];\n\tint offset = pdp10_pointer_offset (XEXP (operands[1], 0));\n\tops[0] = operands[0];\n\tops[1] = operands[1];\n\tops[2] = GEN_INT (9);\n\tops[3] = GEN_INT (0);\n\toutput_asm_insn (pdp10_output_extv_sequence (ops), ops);\n\treturn \"\";\n }\n else\n {\n\tif (which_alternative == 0)\n\t return \"ildb %0,%1\\;trne %0,400\\;%_orcmi %0,777\";\n\telse\n\t return \"ldb %0,%1\\;trne %0,400\\;%_orcmi %0,777\";\n }\n }\n [(set_attr \"length\" \"3\")\n (set_attr \"reorg_type\" \"none,ldb\")])\n\n(define_insn \"*LDBqi\"\n [(set (match_operand:QI 0 \"register_operand\" \"=r,r\")\n (match_operand:QI 1 \"memory_operand\" \">,m\"))]\n \"\"\n \"*return pdp10_output_load_unsigned_byte (insn, operands);\"\n [(set_attr \"reorg_type\" \"none,ldb\")])\n; \"@\n; ildb %0,%1\n; ldb %0,%1\")\n\n(define_insn \"*LDBIqi\"\n [(set (match_operand:QI 0 \"register_operand\" \"=r\")\n (match_operand:QI 1 \"memory_operand\" \"<\"))]\n \"TARGET_XKL2\"\n \"*return pdp10_output_load_unsigned_byte (insn, operands);\")\n\n(define_insn \"*DPBqi\"\n [(set (match_operand:QI 0 \"memory_operand\" \"=>,m\")\n\t(match_operand:QI 1 \"register_operand\" \"r,r\"))]\n \"\"\n \"*return pdp10_output_store_byte (insn, operands);\"\n [(set_attr \"reorg_type\" \"none,dpb\")])\n\n(define_insn \"*DPBIqi\"\n [(set (match_operand:QI 0 \"memory_operand\" \"=<\")\n\t(match_operand:QI 1 \"register_operand\" \"r\"))]\n \"TARGET_XKL2\"\n \"*return pdp10_output_store_byte (insn, operands);\")\n\n(define_expand \"movhi\"\n [(set (match_operand:HI 0 \"reg_or_mem_operand\" \"\")\n (match_operand:HI 1 \"general_operand\" \"\"))]\n \"\"\n \"if (no_new_pseudos)\n {\n if (REG_P (operands[0]) && GET_CODE (operands[1]) == CONST_INT)\n operands[0] = gen_rtx_REG (SImode, REGNO (operands[0]));\n }\n else\n {\n if (GET_CODE (operands[0]) == SUBREG\n\t && GET_CODE (SUBREG_REG (operands[0])) == ZERO_EXTRACT)\n\t {\n\t if (GET_CODE (XEXP (SUBREG_REG (operands[0]), 0)) == MEM\n\t && SUBREG_BYTE (operands[0]) == 2\n\t && GET_CODE (XEXP (SUBREG_REG (operands[0]), 1)) == CONST_INT\n\t && INTVAL (XEXP (SUBREG_REG (operands[0]), 1)) == 18\n\t && GET_CODE (XEXP (SUBREG_REG (operands[0]), 2)) == CONST_INT\n\t && INTVAL (XEXP (SUBREG_REG (operands[0]), 2)) == 18\n\t && MEM_SCALAR_P (XEXP (SUBREG_REG (operands[0]), 0)))\n\t emit_move_insn (XEXP (SUBREG_REG (operands[0]), 0),\n\t\t\t convert_to_mode (SImode, operands[1], 1));\n\t else\n\t emit_move_insn (SUBREG_REG (operands[0]),\n\t\t\t convert_to_mode (SImode, operands[1], 1));\n\t DONE;\n\t }\n else if (GET_CODE (operands[1]) == SUBREG\n\t\t&& GET_CODE (SUBREG_REG (operands[1])) == ZERO_EXTRACT)\n\t {\n\t rtx temp = gen_reg_rtx (SImode);\n\t emit_move_insn (temp, XEXP (operands[1], 0));\n\t operands[1] = gen_rtx_SUBREG (HImode, temp, 2);\n\t }\n else if (GET_CODE (operands[1]) == CONST_INT)\n \t {\n \t rtx reg = gen_reg_rtx (SImode);\n \t emit_insn (gen_movsi (reg, operands[1]));\n \t operands[1] = gen_rtx_SUBREG (HImode, reg, 2);\n \t }\n if (GET_CODE (operands[0]) == MEM)\n \t operands[1] = force_reg (HImode, operands[1]);\n }\")\n\n(define_insn \"*movhi\"\n [(set (match_operand:HI 0 \"register_operand\" \"=r\")\n (match_operand:HI 1 \"register_operand\" \"r\"))]\n \"\"\n \"move %0,%1\")\n\n; (define_insn \"*halfword_move\"\n; [(set (match_operand:SI 0 \"pdp10_halfword_destination\" \"=\")\n; \t(match_operand:SI 1 \"pdp10_halfword_source\" \"\"))]\n; \"\"\n; \"*pdp10_output_halfword_move (operands);\")\n\n(define_insn \"*HLR\"\n [(set (zero_extract:SI (match_operand:SI 0 \"register_operand\" \"+r\")\n\t\t\t (const_int 18)\n\t\t\t (const_int 18))\n\t(subreg:SI (match_operand:HI 1 \"memory_operand\" \"m\") 0))]\n \"\"\n \"hlr %0,%W1\")\n\n(define_insn \"*HLL\"\n [(set (zero_extract:SI (match_operand:SI 0 \"register_operand\" \"+r\")\n\t\t\t (const_int 18)\n\t\t\t (const_int 0))\n\t(subreg:SI (match_operand:HI 1 \"memory_operand\" \"m\") 0))]\n \"\"\n \"hll %0,%W1\")\n\n(define_insn \"*HLLM\"\n [(set (mem:SI (match_operand:SI 0 \"address_operand\" \"p\"))\n\t(ior:SI (and:SI (match_operand:SI 1 \"register_operand\" \"r\")\n\t\t\t(const_int LEFT_HALF))\n\t\t(zero_extend:SI (mem:HI (match_dup 0)))))]\n \"\"\n {\n if (GET_CODE (operands[0]) == CONST\n && TARGET_EXTENDED && !TARGET_SMALLISH)\n /* ADDRESS: ... */\n return \"hllm %1,@[%W0]\";\n else\n return \"hllm %1,%W0\";\n })\n\n(define_insn \"HRR\"\n [(set (zero_extract:SI (match_operand:SI 0 \"reg_or_mem_operand\" \"+r,m\")\n\t\t\t (const_int 18)\n\t\t\t (const_int 18))\n\t(and:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"rm,r\")\n\t\t(const_int RIGHT_HALF)))]\n \"\"\n \"@\n hrr %0,%1\n hrrm %1,%0\")\n\n(define_insn \"*HRL\"\n [(set (zero_extract:SI (match_operand:SI 0 \"reg_or_mem_operand\" \"+r,m\")\n\t\t\t (const_int 18)\n\t\t\t (const_int 0))\n\t(and:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"rm,r\")\n\t\t(const_int RIGHT_HALF)))]\n \"\"\n \"@\n hrl %0,%1\n hrlm %1,%0\")\n\n; (define_insn \"*HxR\"\n; [(set (zero_extract:SI (match_operand:SI 0 \"register_operand\" \"+r\")\n; \t\t\t (const_int 18)\n; \t\t\t (const_int 18))\n; (subreg:SI (match_operand:HI 1 \"memory_operand\" \"m\") 0))]\n; \"\"\n; \"*return pdp10_output_halfword_insv (insn, operands, 18);\")\n\n(define_insn \"*HxRM\"\n [(set (subreg:SI (match_operand:HI 1 \"memory_operand\" \"=m\") 0)\n\t(zero_extract:SI (match_operand:SI 0 \"register_operand\" \"r\")\n\t\t\t (const_int 18)\n\t\t\t (const_int 18)))]\n \"\"\n \"*return pdp10_output_halfword_extv (insn, operands, 18);\")\n\n; (define_insn \"*HxL\"\n; [(set (zero_extract:SI (match_operand:SI 0 \"register_operand\" \"+r\")\n; \t\t\t (const_int 18)\n; \t\t\t (const_int 0))\n; (subreg:SI (match_operand:HI 1 \"memory_operand\" \"m\") 0))]\n; \"\"\n; \"*return pdp10_output_halfword_insv (insn, operands, 0);\")\n\n(define_insn \"*HxLM\"\n [(set (match_operand:HI 1 \"memory_operand\" \"=m\")\n\t(subreg:HI (lshiftrt:SI (match_operand:SI 0 \"register_operand\" \"r\")\n\t\t\t\t(const_int 18)) 2))]\n \"\"\n \"*return pdp10_output_halfword_extv (insn, operands, 0);\")\n\n(define_insn \"*HLR\"\n [(set (zero_extract:SI (match_operand:SI 0 \"reg_or_mem_operand\" \"+r,m\")\n\t\t\t (const_int 18)\n\t\t\t (const_int 18))\n (lshiftrt:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"rm,r\")\n\t\t (const_int 18)))]\n \"\"\n \"@\n hlr %0,%W1\n hlrm %1,%W0\")\n\n(define_insn \"HRRZ\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,m\")\n\t(and:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"rm,r\")\n\t\t(const_int RIGHT_HALF)))]\n \"\"\n {\n if (REG_P (operands[0]) && REG_P (operands[1])\n\t&& REGNO (operands[0]) == REGNO (operands[1])\n\t&& zero_extended_p (operands[0], 18, insn))\n return \"\";\n else\n {\n const char *insn[] = { \"hrrz %0,%W1\", \"hrrzm %1,%W0\" };\n\treturn insn[which_alternative];\n }\n })\n\n(define_insn \"*HRRO\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,m\")\n\t(ior:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"rm,r\")\n\t\t(const_int LEFT_HALF)))]\n \"\"\n \"@\n hrro %0,%W1\n hrrom %1,%W0\")\n\n(define_insn \"*HLLZ\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,m\")\n\t(and:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"rm,r\")\n\t\t(const_int LEFT_HALF)))]\n \"\"\n \"@\n hllz %0,%W1\n hllzm %1,%W0\")\n\n(define_insn \"*HLLO\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,m\")\n\t(ior:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"rm,r\")\n\t\t(const_int RIGHT_HALF)))]\n \"\"\n \"@\n hllo %0,%W1\n hllom %1,%W0\")\n\n(define_insn \"*HLL\"\n [(set (zero_extract:SI (match_operand:SI 0 \"reg_or_mem_operand\" \"+r,m\")\n\t\t\t (const_int 18)\n\t\t\t (const_int 0))\n (lshiftrt:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"rm,r\")\n\t\t (const_int 18)))]\n \"\"\n \"@\n hll %0,%W1\n hllm %1,%W0\")\n\n(define_insn \"HLRZ\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,m\")\n\t(lshiftrt:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"rm,r\")\n\t\t (const_int 18)))]\n \"\"\n \"@\n hlrz %0,%1\n hlrzm %1,%0\")\n\n(define_insn \"HLRE\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,m\")\n\t(ashiftrt:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"rm,r\")\n\t\t (const_int 18)))]\n \"\"\n \"@\n hlre %0,%1\n hlrem %1,%0\")\n\n(define_insn \"*HLRE_extract\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(sign_extract:SI (match_operand:HI 1 \"memory_operand\" \"m\")\n\t\t\t (const_int 18)\n\t\t\t (const_int 0)))]\n \"\"\n \"hlre %0,%W1\")\n\n(define_insn \"*HRLZ\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,m\")\n\t(ashift:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"rm,r\")\n\t\t (const_int 18)))]\n \"\"\n \"@\n hrlz %0,%1\n hrlzm %1,%0\")\n\n(define_insn \"*loadhi\"\n [(set (match_operand:HI 0 \"register_operand\" \"=r\")\n (match_operand:HI 1 \"memory_operand\" \"m>\"))]\n \"\"\n \"*return pdp10_output_movhi (operands, 0);\")\n\n(define_insn \"*zloadhi\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n (zero_extend:SI (match_operand:HI 1 \"memory_operand\" \"m>\")))]\n \"\"\n \"*return pdp10_output_movhi (operands, 0);\")\n\n(define_insn \"*sloadhi_1\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n (sign_extend:SI\n\t (match_operand:HI 1 \"pdp10_maybe_volatile_memory_operand\" \"m\")))]\n \"pdp10_pointer_alignment (XEXP (operands[1], 0)) >= UNITS_PER_WORD\"\n \"*return pdp10_output_movhi (operands, 1);\")\n\n(define_insn \"*sloadhi_2\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n (sign_extend:SI\n\t (match_operand:HI 1 \"pdp10_maybe_volatile_memory_operand\" \"m\")))]\n \"pdp10_pointer_alignment (XEXP (operands[1], 0)) < UNITS_PER_WORD\"\n {\n output_asm_insn (pdp10_output_movhi (operands, 0), operands);\n return \"hrre %0,%0\";\n }\n [(set_attr \"length\" \"2\")])\n\n(define_insn \"storehi\"\n [(set (match_operand:HI 0 \"memory_operand\" \"=m>\")\n\t(match_operand:HI 1 \"register_operand\" \"r\"))]\n \"\"\n \"*return pdp10_output_movhi (operands, 0);\")\n\n(define_insn \"*zstorehi\"\n [(set (match_operand:SI 0 \"memory_operand\" \"=m\")\n (zero_extend:SI (match_operand:HI 1 \"register_operand\" \"r\")))]\n \"\"\n \"hrrzm %1,%0\")\n\n(define_insn \"*sstorehi\"\n [(set (match_operand:SI 0 \"memory_operand\" \"=m\")\n (sign_extend:SI (match_operand:HI 1 \"memory_operand\" \"r\")))]\n \"\"\n \"hrrem %1,%0\")\n\n(define_expand \"extv\"\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(sign_extract:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"\")\n\t\t\t (match_operand:SI 2 \"const_int_operand\" \"\")\n\t\t\t (match_operand:SI 3 \"const_int_operand\" \"\")))]\n \"\"\n \"if (INTVAL (operands[2]) + INTVAL (operands[3]) > BITS_PER_WORD)\n FAIL;\n if (!TARGET_XKL2)\n {\n if (pdp10_expand_extv (operands))\n DONE;\n }\")\n\n(define_insn \"*extv_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(sign_extract:SI (match_operand:SI 1 \"register_operand\" \"r\")\n\t\t\t (match_operand:SI 2 \"const_int_operand\" \"\")\n\t\t\t (match_operand:SI 3 \"const_int_operand\" \"\")))]\n \"!TARGET_XKL2\"\n \"*return pdp10_output_extv_sequence (operands);\"\n [(set_attr \"length\" \"3\")])\n\n(define_insn \"*extv_mem\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(sign_extract:SI (match_operand:QI 1 \"memory_operand\" \"m\")\n\t\t\t (match_operand:SI 2 \"const_int_operand\" \"\")\n\t\t\t (match_operand:SI 3 \"const_int_operand\" \"\")))]\n \"!TARGET_XKL2\"\n \"*return pdp10_output_extv_sequence (operands);\"\n [(set_attr \"length\" \"3\")])\n\n(define_insn \"*extv_memsi\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(sign_extract:SI (match_operand:SI 1 \"memory_operand\" \"m\")\n\t\t\t (match_operand:SI 2 \"const_int_operand\" \"\")\n\t\t\t (match_operand:SI 3 \"const_int_operand\" \"\")))]\n \"!TARGET_XKL2\"\n \"*return pdp10_output_extv_sequence (operands);\"\n [(set_attr \"length\" \"3\")])\n\n(define_insn \"*LDBE_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(sign_extract:SI (match_operand:SI 1 \"register_operand\" \"r\")\n\t\t\t (match_operand:SI 2 \"const_int_operand\" \"\")\n\t\t\t (match_operand:SI 3 \"const_int_operand\" \"\")))]\n \"TARGET_XKL2\"\n \"*return pdp10_output_extv (insn, operands);\")\n\n(define_insn \"*LDBE_regqi\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(sign_extract:SI (match_operand:QI 1 \"register_operand\" \"r\")\n\t\t\t (match_operand:SI 2 \"const_int_operand\" \"\")\n\t\t\t (match_operand:SI 3 \"const_int_operand\" \"\")))]\n \"TARGET_XKL2\"\n \"*return pdp10_output_extv (insn, operands);\")\n\n(define_insn \"*LDBE_mem\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(sign_extract:SI (match_operand:QI 1 \"memory_operand\" \"r\")\n\t\t\t (match_operand:SI 2 \"const_int_operand\" \"\")\n\t\t\t (match_operand:SI 3 \"const_int_operand\" \"\")))]\n \"TARGET_XKL2\"\n \"*return pdp10_output_extv (insn, operands);\")\n\n(define_expand \"extzv\"\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(zero_extract:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"\")\n\t\t\t (match_operand:SI 2 \"const_int_operand\" \"\")\n\t\t\t (match_operand:SI 3 \"const_int_operand\" \"\")))]\n \"\"\n \"if (INTVAL (operands[2]) + INTVAL (operands[3]) > BITS_PER_WORD)\n FAIL;\n if (pdp10_expand_extzv (operands))\n DONE;\")\n\n(define_insn \"*extzv_reg_sequence\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(zero_extract:SI (match_operand:SI 1 \"register_operand\" \"r\")\n\t\t\t (match_operand:SI 2 \"const_int_operand\" \"\")\n\t\t\t (match_operand:SI 3 \"const_int_operand\" \"\")))]\n \"INTVAL (operands[2]) == 16 || INTVAL (operands[3]) == 0\"\n \"*return pdp10_output_extzv_sequence (operands);\"\n [(set_attr \"length\" \"3\")])\n\n(define_insn \"*extzv_memsi_sequence\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(zero_extract:SI (match_operand:SI 1 \"memory_operand\" \"m\")\n\t\t\t (match_operand:SI 2 \"const_int_operand\" \"\")\n\t\t\t (match_operand:SI 3 \"const_int_operand\" \"\")))]\n \"INTVAL (operands[2]) == 16\n || (TARGET_EXTENDED\n && (INTVAL (operands[3]) == 0\n\t || INTVAL (operands[2]) + INTVAL (operands[3]) == 36)\n && !CONSTANT_ADDRESS_P (XEXP (operands[1], 0)))\"\n; && (GET_CODE (XEXP (operands[1], 0)) == REG\n;\t || GET_CODE (XEXP (operands[1], 0)) == PLUS))\"\n;\t || (GET_CODE (XEXP (operands[1], 0)) == PLUS\n;\t && INTVAL (XEXP (XEXP (operands[1], 0), 1))\n;\t\t % UNITS_PER_WORD == 0)))\"\n \"*return pdp10_output_extzv_sequence (operands);\"\n [(set_attr \"length\" \"3\")])\n\n(define_insn \"*extzv_mem_sequence\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(zero_extract:SI (match_operand:QI 1 \"memory_operand\" \"m\")\n\t\t\t (match_operand:SI 2 \"const_int_operand\" \"\")\n\t\t\t (match_operand:SI 3 \"const_int_operand\" \"\")))]\n \"INTVAL (operands[2]) == 16\n || (TARGET_EXTENDED\n && INTVAL (operands[3]) == 0\n && !CONSTANT_ADDRESS_P (XEXP (operands[1], 0))\n && (GET_CODE (XEXP (operands[1], 0)) == REG\n\t || (GET_CODE (XEXP (operands[1], 0)) == PLUS\n\t && INTVAL (XEXP (XEXP (operands[1], 0), 1))\n\t\t % UNITS_PER_WORD == 0)))\"\n \"*return pdp10_output_extzv_sequence (operands);\"\n [(set_attr \"length\" \"3\")])\n\n(define_insn \"*extzv_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(zero_extract:SI (match_operand:SI 1 \"register_operand\" \"r\")\n\t\t\t (match_operand:SI 2 \"const_int_operand\" \"\")\n\t\t\t (match_operand:SI 3 \"const_int_operand\" \"\")))]\n \"INTVAL (operands[2]) != 16\"\n \"*return pdp10_output_extzv (insn, operands);\")\n\n(define_insn \"*extzv_mem\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(zero_extract:SI (match_operand:QI 1 \"memory_operand\" \"m\")\n\t\t\t (match_operand:SI 2 \"const_int_operand\" \"\")\n\t\t\t (match_operand:SI 3 \"const_int_operand\" \"\")))]\n \"INTVAL (operands[2]) != 16\"\n \"*return pdp10_output_extzv (insn, operands);\")\n\n(define_insn \"*extzv_memsi\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(zero_extract:SI (match_operand:SI 1 \"memory_operand\" \"m\")\n\t\t\t (match_operand:SI 2 \"const_int_operand\" \"\")\n\t\t\t (match_operand:SI 3 \"const_int_operand\" \"\")))]\n \"INTVAL (operands[2]) != 16\"\n \"*return pdp10_output_extzv (insn, operands);\")\n\n(define_insn \"*move_dpb\"\n [(set (match_operand:QI 0 \"memory_operand\" \"=m\")\n\t(subreg:QI (zero_extract:SI (match_operand:SI 2 \"memory_operand\" \"m\")\n\t\t\t\t (const_int 9)\n\t\t\t\t (const_int 27)) 3))\n (clobber (match_scratch:SI 1 \"=r\"))]\n \"\"\n {\n output_asm_insn (\"move %1,%2\", operands);\n return pdp10_output_store_byte (insn, operands);\n }\n [(set_attr \"length\" \"2\")])\n\n(define_insn \"*move_dpb2\"\n [(set (zero_extract:SI (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t\t\t (const_int 8)\n\t\t\t (const_int 0))\n\t(and:SI (match_operand:SI 2 \"memory_operand\" \"m\")\n\t\t(const_int 255)))\n (clobber (match_scratch:SI 1 \"=r\"))]\n \"\"\n {\n output_asm_insn (\"move %1,%2\", operands);\n return pdp10_output_store_byte (insn, operands);\n }\n [(set_attr \"length\" \"2\")])\n\n(define_expand \"insv\"\n [(set (zero_extract:SI (match_operand:SI 0 \"reg_or_mem_operand\" \"\")\n\t\t\t (match_operand:SI 1 \"const_int_operand\" \"\")\n\t\t\t (match_operand:SI 2 \"const_int_operand\" \"\"))\n\t(match_operand:SI 3 \"register_operand\" \"\"))]\n \"\"\n \"if (INTVAL (operands[1]) + INTVAL (operands[2]) > BITS_PER_WORD)\n FAIL;\n /* FIXME: is this necessary? According to test/misc/array-loop.c, yes. */\n if (GET_CODE (operands[0]) == MEM\n && GET_CODE (XEXP (operands[0], 0)) == REG\n && INTVAL (operands[1]) == BITS_PER_WORD\n && INTVAL (operands[2]) == 0)\n {\n emit_move_insn (gen_rtx_MEM (SImode, XEXP (operands[0], 0)),\n\t\t operands[3]);\n DONE;\n }\")\n\n; (define_insn \"\"\n; [(set (zero_extract:SI (match_operand:SI 0 \"register_operand\" \"+r\")\n; \t\t\t (const_int 18)\n; \t\t\t (const_int 18))\n; \t(match_operand:SI 3 \"register_operand\" \"r\"))]\n; \"\"\n; \"*return pdp10_output_insv (insn, operands);\")\n\n(define_insn \"*insv_reg\"\n [(set (zero_extract:SI (match_operand:SI 0 \"register_operand\" \"+r\")\n\t\t\t (match_operand:SI 1 \"const_int_operand\" \"\")\n\t\t\t (match_operand:SI 2 \"const_int_operand\" \"\"))\n\t(match_operand:SI 3 \"register_operand\" \"r\"))]\n \"\"\n \"*return pdp10_output_insv (insn, operands);\")\n\n(define_insn \"*insv_mem\"\n [(set (zero_extract:SI (match_operand:QI 0 \"memory_operand\" \"+m\")\n\t\t\t (match_operand:SI 1 \"const_int_operand\" \"\")\n\t\t\t (match_operand:SI 2 \"const_int_operand\" \"\"))\n\t(match_operand:SI 3 \"register_operand\" \"r\"))]\n \"\"\n \"*return pdp10_output_insv (insn, operands);\")\n\n(define_insn \"*insv_memsi\"\n [(set (zero_extract:SI (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t\t\t (match_operand:SI 1 \"const_int_operand\" \"\")\n\t\t\t (match_operand:SI 2 \"const_int_operand\" \"\"))\n\t(match_operand:SI 3 \"register_operand\" \"r\"))]\n \"\"\n \"*return pdp10_output_insv (insn, operands);\")\n\n(define_expand \"movsi\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"\")\n (match_operand:SI 1 \"general_operand\" \"\"))]\n \"\"\n \"if (GET_CODE (operands[0]) == ZERO_EXTRACT)\n operands[1] = force_reg (SImode, operands[1]);\")\n\n;; Special version using SKIPA to load a full-word constant. This may\n;; be beneficial on processors with a cache. Note the 'x' constraint\n;; on alternative 7. Reload can fall back on the last alternative if\n;; instisting on moving to register 0.\n(define_insn \"*movsi_cache\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,r,r,r,r,r,r,x,m,m,m,r\")\n\t;; ADDRESS: the S constraint allows a symbol.\n (match_operand:SI 1 \"general_operand\" \"rm,I,S,L,M,N,P,i,O,M,r,i\"))]\n \"TARGET_CACHE && !optimize_size\"\n \"*return pdp10_output_movsi (insn, which_alternative);\"\n [(set_attr \"length\" \"1,1,1,1,1,1,1,2,1,1,1,1\")])\n\n(define_insn \"*movsi_nocache\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,r,r,r,r,r,r,r,m,m,m\")\n\t;; ADDRESS: the S constraint allows a symbol.\n (match_operand:SI 1 \"general_operand\" \"rm,I,S,L,M,N,P,i,O,M,r\"))]\n \"\"\n \"*return pdp10_output_movsi (insn, which_alternative);\")\n\n(define_insn \"move_two_halves\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(ior:SI (ashift:SI (match_operand:SI 1 \"immediate_operand\" \"p\")\n\t\t\t (const_int 18))\n\t\t(match_operand:SI 2 \"immediate_operand\" \"p\")))]\n \"\"\n \"move %0,[%1,,%2]\")\n\n(define_insn \"*MOVEI_const_plus_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(and:SI (plus:SI (match_operand:SI 1 \"register_operand\" \"x\")\n\t\t\t (match_operand:SI 2 \"const_int_operand\" \"I\"))\n\t\t(const_int RIGHT_HALF)))]\n \"pdp10_const_ok_for_letter_p (INTVAL (operands[2]), 'I')\"\n \"movei %0,%2(%1)\")\n\n(define_insn \"*MOVS\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,m\")\n\t(match_operator:SI 1 \"pdp10_rotate_operator\"\n\t [(match_operand:SI 2 \"reg_or_mem_operand\" \"rm,r\") (const_int 18)]))]\n \"\"\n \"@\n movs %0,%2\n movsm %2,%0\")\n\n(define_insn \"*EXCH\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"+rm\")\n (match_operand:SI 1 \"register_operand\" \"r\"))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(match_dup 0))]\n \"\"\n \"exch %1,%0\")\n\n(define_insn \"*SETZB\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=rm\") (const_int 0))\n (set (match_operand:SI 1 \"register_operand\" \"=r\") (const_int 0))]\n \"\"\n \"setzb %1,%0\")\n\n(define_expand \"movdi\"\n [(set (match_operand:DI 0 \"reg_or_mem_operand\" \"\")\n (match_operand:DI 1 \"general_operand\" \"\"))]\n \"\"\n \"if (!HAVE_DMOVE && pdp10_expand_dmove (operands[0], operands[1]))\n DONE;\")\n\n;; TODO: if there's a REG_UNUSED note attached to this insn, avoid\n;; moving the unused part of the DImode register.\n(define_insn \"DMOVE\"\n [(set (match_operand:DI 0 \"reg_or_mem_operand\" \"=r,r,r,r,r,o,m\")\n (match_operand:DI 1 \"general_operand\" \"rm,O,I,J,i,O,r\"))]\n \"TARGET_KI10up\"\n \"@\n dmove %0,%1\n setzb %0,%Z0\n movei %0,0\\;movei %Z0,%1\n seto %0,\\;movni %Z0,%n1\n dmove %0,[%D1]\n setzm %0\\;setzm %Z0\n dmovem %1,%0\"\n [(set_attr \"length\" \"1,1,2,2,1,2,1\")])\n\n(define_insn \"*movdi\"\n [(set (match_operand:DI 0 \"reg_or_mem_operand\" \"=r,r,r,r,r,o,o\")\n (match_operand:DI 1 \"general_operand\" \"ro,O,I,J,i,O,r\"))]\n \"!TARGET_KI10up\"\n \"@\n move %0,%1\\;move %Z0,%Z1\n setzb %0,%Z0\n movei %0,0\\;movei %Z0,%1\n seto %0,\\;movni %Z0,%n1\n move %0,[%A1]\\;move %Z0,[%B1]\n setzm %0\\;setzm %Z0\n movem %1,%0\\;movem %Z1,%Z0\"\n [(set_attr \"length\" \"2,1,2,2,2,2,2\")])\n\n(define_expand \"movti\"\n [(set (match_operand:TI 0 \"reg_or_mem_operand\" \"\")\n (match_operand:TI 1 \"general_operand\" \"\"))]\n \"TARGET_KI10up\"\n \"if (pdp10_expand_move_4 (operands[0], operands[1]))\n DONE;\")\n\n(define_insn \"movsf\"\n [(set (match_operand:SF 0 \"reg_or_mem_operand\" \"=r,r,r,r,m,m\")\n (match_operand:SF 1 \"general_operand\" \"rm,R,G,F,R,r\"))]\n \"\"\n \"@\n move %0,%1%; movsf\n movei %0,0%; movsf\n movsi %0,%G1%; movsf\n move %0,[%1]%; movsf\n setzm %0%; movsf\n movem %1,%0%; movsf\")\n\n(define_expand \"movdf\"\n [(set (match_operand:DF 0 \"reg_or_mem_operand\" \"\")\n (match_operand:DF 1 \"general_operand\" \"\"))]\n \"\"\n \"if (!HAVE_DMOVE && pdp10_expand_dmove (operands[0], operands[1]))\n DONE;\")\n\n(define_insn \"*movdf_KI10up\"\n [(set (match_operand:DF 0 \"reg_or_mem_operand\" \"=r,r,r,r,o,m\")\n (match_operand:DF 1 \"general_operand\" \"rm,R,G,F,R,r\"))]\n \"TARGET_KI10up\"\n \"@\n dmove %0,%1\n setzb %0,%Z0%; movdf\n movsi %0,%G1%; movdf\\;movei %Z0,0%; movdf\n dmove %0,[%1]\n setzm %0%; movdf\\;setzm %Z0%; movdf\n dmovem %1,%0\"\n [(set_attr \"length\" \"1,1,2,1,2,1\")])\n\n(define_insn \"*movdf_notKI10up\"\n [(set (match_operand:DF 0 \"reg_or_mem_operand\" \"=r,r,r,r,o,o\")\n (match_operand:DF 1 \"general_operand\" \"ro,R,G,F,R,r\"))]\n \"!TARGET_KI10up\"\n \"@\n move %0,%1%; movdf\\;move %Z0,%Z1%; movdf\n setzb %0,%Z0%; movdf\n movsi %0,%G1%; movdf\\;movei %Z0,0%; movdf\n move %0,[%A1]%; movdf\\;move %Z0,[%B1]%; movdf\n setzm %0%; movdf\\;setzm %Z0%; movdf\n movem %1,%0%; movdf\\;movem %Z1,%Z0%; movdf\"\n [(set_attr \"length\" \"2,1,2,2,2,2\")])\n\n(define_expand \"movstrsi\"\n [(match_operand:BLK 0 \"general_operand\" \"\")\n (match_operand:BLK 1 \"general_operand\" \"\")\n (match_operand:SI 2 \"general_operand\" \"\")\n (match_operand:SI 3 \"const_int_operand\" \"\")]\n \"\"\n \"if (pdp10_expand_movstrsi (operands))\n DONE;\n FAIL;\")\n\n(define_expand \"clrstrsi\"\n [(match_operand:BLK 0 \"general_operand\" \"\")\n (match_operand:SI 1 \"general_operand\" \"\")\n (match_operand:SI 2 \"const_int_operand\" \"\")]\n \"\"\n \"if (pdp10_expand_clrstrsi (operands))\n DONE;\n FAIL;\")\n\n; (define_expand \"cmpstrsi\"\n; [(set (match_operand:SI 0 \"register_operand\" \"\")\n; \t(compare:SI (match_operand:BLK 1 \"general_operand\" \"\")\n; \t\t (match_operand:BLK 2 \"general_operand\" \"\")))\n; (use (match_operand:SI 3 \"general_operand\" \"\"))\n; (use (match_operand:SI 4 \"const_int_operand\" \"\"))]\n; \"TARGET_KL10up && TARGET_STRING\"\n; \"if (pdp10_expand_cmpstrsi (operands))\n; DONE;\n; FAIL;\")\n\n(define_insn \"BLT\"\n [(unspec_volatile:BLK\n [(match_operand:SI 0 \"register_operand\" \"r\")] VUNSPEC_BLT)\n (clobber (match_dup 0))\n (use (match_operand:BLK 1 \"memory_operand\" \"m\"))]\n \"\"\n \"blt %0,%1\")\n\n(define_insn \"XBLT\"\n [(unspec_volatile:BLK\n [(match_operand:TI 0 \"register_operand\" \"+r\")] VUNSPEC_XBLT)\n (clobber (match_dup 0))]\n \"TARGET_KL10up\"\n \"extend %0,[xblt]\")\n\n; (define_insn \"MOVSLJ\"\n; [(unspec_volatile:BLK [(match_operand:SI 0 \"register_operand\" \"+r\")]\n; \t\t\t VUNSPEC_MOVSLJ)]\n; \"TARGET_KL10up && TARGET_STRING\"\n; \"extend %0,[movslj]\")\n\n; (define_insn \"MOVST\"\n; [(unspec_volatile:BLK [(match_operand:SI 0 \"register_operand\" \"+r\")]\n; \t\t\t VUNSPEC_MOVST)]\n; \"TARGET_KL10up && TARGET_STRING\"\n; \"extend %0,[movst]\")\n\n; (define_insn \"CMPS\"\n; [(unspec_volatile:BLK [(match_operand:SI 0 \"register_operand\" \"+r\")]\n;\t\t\t VUNSPEC_CMPS)]\n; \"TARGET_KL10up && TARGET_STRING\"\n; \"extend %0,[cmps]\")\n\n\f\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Conditional Data Movement\n\n;; (define_expand \"cstoresi4\" ...)\n;; (define_expand \"cstoresf4\" ...)\n\n(define_expand \"seq\"\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(eq:SI (match_dup 1) (match_dup 2)))]\n \"\"\n \"if (GET_MODE (pdp10_compare_op0) == DFmode)\n FAIL;\n operands[1] = pdp10_compare_op0;\n operands[2] = pdp10_compare_op1;\")\n\n(define_expand \"sne\"\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(ne:SI (match_dup 1) (match_dup 2)))]\n \"\"\n \"if (GET_MODE (pdp10_compare_op0) == DFmode)\n FAIL;\n operands[1] = pdp10_compare_op0;\n operands[2] = pdp10_compare_op1;\")\n\n(define_expand \"slt\"\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(lt:SI (match_dup 1) (match_dup 2)))]\n \"\"\n \"if (GET_MODE (pdp10_compare_op0) == DFmode)\n FAIL;\n operands[1] = pdp10_compare_op0;\n operands[2] = pdp10_compare_op1;\")\n\n(define_expand \"sgt\"\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(gt:SI (match_dup 1) (match_dup 2)))]\n \"\"\n \"if (GET_MODE (pdp10_compare_op0) == DFmode)\n FAIL;\n operands[1] = pdp10_compare_op0;\n operands[2] = pdp10_compare_op1;\")\n\n(define_expand \"sle\"\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(le:SI (match_dup 1) (match_dup 2)))]\n \"\"\n \"if (GET_MODE (pdp10_compare_op0) == DFmode)\n FAIL;\n operands[1] = pdp10_compare_op0;\n operands[2] = pdp10_compare_op1;\")\n\n(define_expand \"sge\"\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(ge:SI (match_dup 1) (match_dup 2)))]\n \"\"\n \"if (GET_MODE (pdp10_compare_op0) == DFmode)\n FAIL;\n operands[1] = pdp10_compare_op0;\n operands[2] = pdp10_compare_op1;\")\n\n(define_expand \"sltu\"\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(lt:SI (match_dup 1) (match_dup 2)))]\n \"\"\n \"operands[1] = pdp10_flip_sign_bit (pdp10_compare_op0);\n operands[2] = pdp10_flip_sign_bit (pdp10_compare_op1);\")\n\n(define_expand \"sgtu\"\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(gt:SI (match_dup 1) (match_dup 2)))]\n \"\"\n \"operands[1] = pdp10_flip_sign_bit (pdp10_compare_op0);\n operands[2] = pdp10_flip_sign_bit (pdp10_compare_op1);\")\n\n(define_expand \"sleu\"\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(le:SI (match_dup 1) (match_dup 2)))]\n \"\"\n \"operands[1] = pdp10_flip_sign_bit (pdp10_compare_op0);\n operands[2] = pdp10_flip_sign_bit (pdp10_compare_op1);\")\n\n(define_expand \"sgeu\"\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(ge:SI (match_dup 1) (match_dup 2)))]\n \"\"\n \"operands[1] = pdp10_flip_sign_bit (pdp10_compare_op0);\n operands[2] = pdp10_flip_sign_bit (pdp10_compare_op1);\")\n\n(define_insn \"*snesi\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r,x\")\n\t(ne:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"0,rm\")\n\t (const_int 0)))]\n \"\"\n \"@\n skipe %@%0\\;%_movei %0,1\n skipe %0,%1\\;%_movei %0,1\"\n [(set_attr \"length\" \"2\")])\n\n(define_insn \"*sgesi\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(ge:SI (match_operand:SI 1 \"register_operand\" \"0\")\n\t (const_int 0)))]\n \"\"\n \"lsh %0,-43\\;xori %0,1\"\n [(set_attr \"length\" \"2\")])\n\n;; This seemingly useless instruction combination is needed to enable\n;; the combination below.\n(define_insn \"\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(xor:SI (plus:SI (match_operand:SI 1 \"register_operand\" \"0\")\n\t\t\t (match_operand:SI 2 \"reg_or_mem_operand\" \"rm\"))\n\t\t(const_int SIGNBIT)))]\n \"0\"\n \"add %0,%2\\;tlc %0,400000\")\n\n;; Calculate the truth value of this particular unsigned comparison\n;; with ADD and JCRY0.\n(define_insn \"\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(gt:SI (xor:SI (match_operand:SI 1 \"register_operand\" \"r\")\n\t\t (const_int SIGNBIT))\n\t (xor:SI (plus:SI (match_operand:SI 2 \"register_operand\" \"0\")\n\t\t\t\t(match_operand:SI 3 \"reg_or_mem_operand\" \"1\"))\n\t\t (const_int SIGNBIT))))]\n \"0\"\n \"jfcl 17,.+1\\;add %0,%3\\;jcry0 .+2\\;%_tdza %0,%0\\;movei %0,1\")\n\n(define_insn \"*sccsi\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r,r\")\n\t(match_operator:SI 1 \"pdp10_comparison_operator\"\n\t [(match_operand:SI 2 \"reg_or_mem_operand\" \"r,rm\")\n\t (match_operand:SI 3 \"general_operand\" \"rm,O\")]))]\n \"\"\n \"@\n cam%1 %2,%3\\;%_tdza %0,%0\\;%_%_movei %0,1\n skip%1 %@%2\\;%_tdza %0,%0\\;%_%_movei %0,1\"\n [(set_attr \"length\" \"3\")])\n\n(define_insn \"*snesf\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r,x\")\n\t(ne:SI (match_operand:SF 1 \"reg_or_mem_operand\" \"0,rm\")\n\t (match_operand:SF 2 \"immediate_operand\" \"R,R\")))]\n \"\"\n \"@\n skipe %@%0\\;%_movei %0,1\n skipe %0,%1\\;%_movei %0,1\"\n [(set_attr \"length\" \"2\")])\n\n(define_insn \"*sltsf\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(lt:SI (match_operand:SF 1 \"register_operand\" \"0\")\n\t (match_operand:SF 2 \"immediate_operand\" \"R\")))]\n \"\"\n \"lsh %0,-43\")\n\n(define_insn \"*sgesf\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(ge:SI (match_operand:SF 1 \"register_operand\" \"0\")\n\t (match_operand:SF 2 \"immediate_operand\" \"R\")))]\n \"\"\n \"lsh %0,-43\\;xori %0,1\"\n [(set_attr \"length\" \"2\")])\n\n(define_insn \"*sccsf\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r,r\")\n\t(match_operator:SI 1 \"pdp10_comparison_operator\"\n\t [(match_operand:SF 2 \"reg_or_mem_operand\" \"r,rm\")\n\t (match_operand:SF 3 \"general_operand\" \"rm,R\")]))]\n \"\"\n \"@\n cam%1 %2,%3\\;%_tdza %0,%0\\;%_%_movei %0,1\n skip%1 %@%2\\;%_tdza %0,%0\\;%_%_movei %0,1\"\n [(set_attr \"length\" \"3\")])\n\n(define_insn \"*snedf\"\n [(set (match_operand:SI 0 \"register_operand\" \"=x\")\n\t(ne:SI (match_operand:DF 1 \"reg_or_mem_operand\" \"ro\")\n\t (match_operand:DF 2 \"pdp10_const_double_0_operand\" \"\")))]\n \"\"\n \"skipn %@%1\\;%_skipe %0,%Z1\\;%_%_movei %0,1\"\n [(set_attr \"length\" \"3\")])\n\n(define_insn \"*sltdf\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(lt:SI (match_operand:DF 1 \"register_operand\" \"0\")\n\t (match_operand:DF 2 \"immediate_operand\" \"R\")))]\n \"\"\n \"lsh %0,-43\")\n\n(define_insn \"*sgedf\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(ge:SI (match_operand:DF 1 \"register_operand\" \"0\")\n\t (match_operand:DF 2 \"immediate_operand\" \"R\")))]\n \"\"\n \"lsh %0,-43\\;xori %0,1\"\n [(set_attr \"length\" \"2\")])\n\n;; (define_expand \"cmovsi6\" ...)\n;; (define_expand \"cmovsf6\" ...)\n\n;; Reload can't handle JUMP_INSNs (such as this one) with spilled\n;; register outputs. Therefore, this pattern must have a memory\n;; alternative for operand 3.\n(define_insn \"*move_and_skipsi\"\n [(set (pc)\n\t(if_then_else (match_operator 0 \"pdp10_comparison_operator\"\n\t\t [(match_operand:SI 1 \"reg_or_mem_operand\" \"r,rm,r,m\")\n\t\t (const_int 0)])\n\t (label_ref (match_operand 2 \"\" \"\"))\n\t (pc)))\n ;; The predicate is \"preferably_register_operand\" so that memory\n ;; operands are invalid until after register allocation. The\n ;; memory constraint is just there as a last resort when operand 3\n ;; is spilled to stack. The \"r\" constraint is there to allow\n ;; accumulator 0.\n (set (match_operand:SI 3 \"preferably_register_operand\" \"=1,x,rm,!rm\")\n\t(match_dup 1))]\n \"\"\n {\n if (which_alternative == 0)\n return \"jump%0 %1,%F2\";\n pdp10_remove_unnecessary_label (insn, operands[2]);\n switch (get_attr_length (insn))\n {\n case 1:\n\treturn \"skip%0 %3,%1\";\n case 2:\n\tif (which_alternative == 2)\n\t return \"movem %1,%3\\;jump%0 %1,%F2\";\n\telse if (REGNO (operands[3]) == 0)\n\t return \"move %3,%1\\;jump%0 %3,%F2\";\n\telse\n\t {\n\t output_asm_insn (\"skip%R0 %3,%1\", operands);\n\t return pdp10_output_jrst (operands[2]);\n\t }\n /* FIXME: is the use of a fixed scratch register avoidable? */\n case 3:\n\treturn \"move 0,%1\\;movem 0,%3\\;jump%0 0,%F2\";\n default:\n\tabort ();\n }\n }\n [(set (attr \"length\")\n\t(cond [(eq_attr \"alternative\" \"0\") (const_int 1)\n\t (eq_attr \"alternative\" \"2\") (const_int 2)\n\t (eq_attr \"alternative\" \"3\") (const_int 3)\n\t (eq (minus (match_dup 2) (pc)) (const_int 1)) (const_int 1)]\n\t (const_int 2)))\n (set_attr \"skip\" \"yes\")])\n; (define_insn \"*move_and_skipsi\"\n; [(set (pc)\n; \t(if_then_else (match_operator 0 \"pdp10_comparison_operator\"\n; \t\t [(match_operand:SI 1 \"reg_or_mem_operand\" \"r,rm,rm\")\n; \t\t (const_int 0)])\n; \t (label_ref (match_operand 2 \"\" \"\"))\n; \t (pc)))\n; ;; The predicate is \"preferably_register_operand\" so that memory\n; ;; operands are invalid until after register allocation. The\n; ;; memory constraint is just there as a last resort when operand 3\n; ;; is spilled to stack. The \"r\" constraint is there to allow\n; ;; accumulator 0.\n; (set (match_operand:SI 3 \"preferably_register_operand\" \"=1,x,!rm\")\n; \t(match_dup 1))]\n; \"\"\n; {\n; if (which_alternative == 0)\n; return \"jump%0 %1,%F2\";\n; pdp10_remove_unnecessary_label (insn, operands[2]);\n; switch (get_attr_length (insn))\n; {\n; case 1:\n; \treturn \"skip%0 %3,%1\";\n; case 2:\n; \tif (REGNO (operands[3]) == 0)\n; \t return \"move %3,%1\\;jump%0 %3,%F2\";\n; \telse\n; \t {\n; \t output_asm_insn (\"skip%R0 %3,%1\", operands);\n; \t return pdp10_output_jrst (operands[2]);\n; \t }\n; /* FIXME: is the use of a fixed scratch register avoidable? */\n; case 3:\n; \treturn \"move 0,%1\\;movem 0,%3\\;jump%0 0,%F2\";\n; default:\n; \tabort ();\n; }\n; }\n; [(set (attr \"length\")\n; \t(cond [(eq_attr \"alternative\" \"0\") (const_int 1)\n; \t (eq_attr \"alternative\" \"2\") (const_int 3)\n; \t (eq (minus (match_dup 2) (pc)) (const_int 1)) (const_int 1)]\n; \t (const_int 2)))\n; (set_attr \"skip\" \"yes\")])\n\n;; Reload can't handle JUMP_INSNs (such as this one) with spilled\n;; register outputs. Therefore, this pattern must have a memory\n;; alternative for operand 4.\n(define_insn \"*move_and_skipsf\"\n [(set (pc)\n\t(if_then_else\n\t (match_operator 0 \"pdp10_comparison_operator\"\n\t [(match_operand:SF 1 \"reg_or_mem_operand\" \"rm,rm,rm\")\n\t (match_operand:SF 2 \"pdp10_const_double_0_operand\" \"\")])\n\t (label_ref (match_operand 3 \"\" \"\"))\n\t (pc)))\n ;; The predicate is \"preferably_register_operand\" so that memory\n ;; operands are invalid until after register allocation pass. The\n ;; memory constraint is just there as a last resort when operand 3\n ;; is spilled to stack. The \"r\" constraint is there to allow\n ;; accumulator 0.\n (set (match_operand:SF 4 \"preferably_register_operand\" \"=1,x,!rm\")\n\t(match_dup 1))]\n \"\"\n {\n if (which_alternative == 0)\n return \"jump%0 %1,%F3\";\n pdp10_remove_unnecessary_label (insn, operands[3]);\n switch (get_attr_length (insn))\n {\n case 1:\n\treturn \"skip%0 %4,%1\";\n case 2:\n\tif (REGNO (operands[3]) == 0)\n\t return \"move %4,%1\\;jump%0 %4,%F3\";\n\telse\n\t {\n\t output_asm_insn (\"skip%R0 %4,%1\", operands);\n\t return pdp10_output_jrst (operands[3]);\n\t }\n /* FIXME: is the use of a fixed scratch register avoidable? */\n case 3:\n\treturn \"move 0,%1\\;movem 0,%4\\;jump%0 0,%F3\";\n default:\n\tabort ();\n }\n }\n [(set (attr \"length\")\n\t(cond [(eq_attr \"alternative\" \"0\") (const_int 1)\n\t (eq_attr \"alternative\" \"2\") (const_int 3)\n\t (eq (minus (match_dup 3) (pc)) (const_int 1)) (const_int 1)]\n\t (const_int 2)))\n (set_attr \"skip\" \"yes\")])\n\n\f\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Integer Arithmetic\n\n(define_expand \"addsi3\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"\")\n\t(plus:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"\")\n\t\t (match_operand:SI 2 \"general_operand\" \"\")))]\n \"\"\n ;; Make sure that for a MEM + x, x can only be a register or +/-1.\n \"if (memory_operand (operands[1], SImode)\n && !(register_operand (operands[2], SImode)\n\t || (const_int_operand (operands[2], SImode)\n\t\t&& (INTVAL (operands[2]) == 1 || INTVAL (operands[2]) == -1))))\n operands[2] = force_reg (SImode, operands[2]);\")\n\n(define_insn \"*addsi3\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,r,r,r,r,m,m,m\")\n\t(plus:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"%0,0,0,r,0,0,0,0\")\n\t\t ;; ADDRESS: an S constraint for the addi case would allow\n\t\t ;; a symbol.\n\t\t (match_operand:SI 2 \"general_operand\" \"rm,I,J,S,i,r,Q,M\")))]\n \"\"\n; ;; Make sure that for a MEM + x, x can only be a register or +/-1.\n; \"!(memory_operand (operands[1], SImode)\n; && !(register_operand (operands[2], SImode)\n;\t || (const_int_operand (operands[2], SImode)\n;\t && (INTVAL (operands[2]) == 1 || INTVAL (operands[2]) == -1))))\"\n \"@\n add %0,%2\n addi %0,%2\n subi %0,%N2\n xmovei %0,%2(%1)\n add %0,[%X2]\n addm %2,%0\n aos %@%0\n sos %@%0\")\n\n(define_insn \"*ADDI_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(plus:SI (and:SI (match_operand:SI 1 \"register_operand\" \"x\")\n\t\t\t (const_int RIGHT_HALF))\n\t\t (match_operand:SI 2 \"register_operand\" \"0\")))]\n \"\"\n \"addi %0,(%1)\")\n(define_insn \"*ADDI_const_plus_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(plus:SI (and:SI (plus:SI (match_operand:SI 1 \"register_operand\" \"x\")\n\t\t\t\t (match_operand:SI 2 \"const_int_operand\" \"I\"))\n\t\t\t (const_int RIGHT_HALF))\n\t\t (match_operand:SI 3 \"register_operand\" \"0\")))]\n \"pdp10_const_ok_for_letter_p (INTVAL (operands[2]), 'I')\"\n \"addi %0,%2(%1)\")\n\n(define_insn \"*ADDB1\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(plus:SI (match_dup 0) (match_operand:SI 1 \"register_operand\" \"r\")))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(plus:SI (match_dup 0) (match_dup 1)))]\n \"\"\n \"addb %1,%0\")\n(define_insn \"*ADDB2\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(plus:SI (match_operand:SI 1 \"register_operand\" \"r\") (match_dup 0)))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(plus:SI (match_dup 1) (match_dup 0)))]\n \"\"\n \"addb %1,%0\")\n\n(define_insn \"*AOS_and_move\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"+rm\")\n\t(plus:SI (match_dup 0) (const_int 1)))\n (set (match_operand:SI 1 \"register_operand\" \"=x\")\n\t(plus:SI (match_dup 0) (const_int 1)))]\n \"\"\n \"aos %1,%0\")\n\n(define_expand \"adddi3\"\n [(set (match_operand:DI 0 \"register_operand\" \"\")\n\t(plus:DI (match_operand:DI 1 \"register_operand\" \"\")\n\t\t (match_operand:DI 2 \"general_operand\" \"\")))]\n \"TARGET_KL10up && TARGET_71BIT\"\n \"\")\n\n(define_insn \"*adddi3\"\n [(set (match_operand:DI 0 \"reg_or_mem_operand\" \"=r,r,r,r,o,o,o\")\n\t(plus:DI (match_operand:DI 1 \"reg_or_mem_operand\" \"%0,0,0,0,0,0,0\")\n\t\t (match_operand:DI 2 \"general_operand\" \"ro,I,J,i,r,Q,M\")))]\n \"0 && !TARGET_71BIT\"\n \"@\n jfcl 17,.+1\\;add %Z0,%Z2\\;jcry0 [aoja %0,.+1]\\;add %0,%2\n jfcl 17,.+1\\;addi %Z0,%2\\;jcry0 [aoja %0,.+1]\n jfcl 17,.+1\\;subi %Z0,%N2\\;jcry0 .+2\\;%_subi %0,1\n jfcl 17,.+1\\;add %Z0,[%B2]\\;jcry0 [aoja %0,.+1]\\;add %0,[%A2]\n jfcl 17,.+1\\;addm %Z2,%Z0\\;jcry0 [aos %0\\;jrst .+1]\\;add %2,%0\n jfcl 17,.+1\\;aos %Z0\\;jcry0 [aos %0\\;jrst .+1]\\;aos %0\n jfcl 17,.+1\\;sos %Z0\\;jcry0 .+2\\;sos %0\\;sos %0\"\n [(set_attr \"length\" \"4,3,4,4,4,4,5\")])\n\n(define_insn \"*DADD\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r,r\")\n\t(plus:DI (match_operand:DI 1 \"register_operand\" \"%0,0\")\n\t\t (match_operand:DI 2 \"general_operand\" \"rm,i\")))]\n \"TARGET_71BIT && TARGET_KL10up\"\n \"@\n dadd %0,%2\n dadd %0,[%D2]\")\n\n(define_expand \"subsi3\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"\")\n\t(minus:SI (match_operand:SI 1 \"register_operand\" \"\")\n\t\t (match_operand:SI 2 \"general_operand\" \"\")))]\n \"\"\n \"if (!register_operand (operands[1], SImode))\n operands[1] = force_reg (SImode, operands[1]);\")\n\n(define_insn \"*subsi3\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,m\")\n\t(minus:SI (match_operand:SI 1 \"register_operand\" \"0,r\")\n\t\t (match_operand:SI 2 \"general_operand\" \"rm,0\")))]\n \"\"\n \"@\n sub %0,%2\n subm %1,%0\")\n\n(define_insn \"*SUBI_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(minus:SI (match_operand:SI 1 \"register_operand\" \"0\")\n\t\t (and:SI (match_operand:SI 2 \"register_operand\" \"x\")\n\t\t\t (const_int RIGHT_HALF))))]\n \"\"\n \"subi %0,(%2)\")\n(define_insn \"*SUBI_const_plus_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(minus:SI (match_operand:SI 1 \"register_operand\" \"0\")\n\t\t (and:SI (plus:SI\n\t\t\t (match_operand:SI 2 \"register_operand\" \"x\")\n\t\t\t (match_operand:SI 3 \"const_int_operand\" \"I\"))\n\t\t (const_int RIGHT_HALF))))]\n \"pdp10_const_ok_for_letter_p (INTVAL (operands[3]), 'I')\"\n \"subi %0,%3(%2)\")\n\n(define_insn \"*SUBB\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(minus:SI (match_operand:SI 1 \"register_operand\" \"r\") (match_dup 0)))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(minus:SI (match_dup 1) (match_dup 0)))]\n \"\"\n \"subb %1,%0\")\n\n(define_insn \"*SOS_and_move\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"+rm\")\n\t(plus:SI (match_dup 0) (const_int -1)))\n (set (match_operand:SI 1 \"register_operand\" \"=x\")\n\t(plus:SI (match_dup 0) (const_int -1)))]\n \"\"\n \"sos %1,%0\")\n\n(define_expand \"subdi3\"\n [(set (match_operand:DI 0 \"register_operand\" \"\")\n\t(minus:DI (match_operand:DI 1 \"register_operand\" \"\")\n\t\t (match_operand:DI 2 \"general_operand\" \"\")))]\n \"TARGET_KL10up && TARGET_71BIT\"\n \"\")\n\n(define_insn \"*subdi3\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r,o\")\n\t(minus:DI (match_operand:DI 1 \"register_operand\" \"%0,0\")\n\t\t (match_operand:DI 2 \"reg_or_mem_operand\" \"ro,r\")))]\n \"0 && !TARGET_71BIT\"\n \"@\n jfcl 17,.+1\\;sub %Z0,%Z2\\;jcry0 .+2\\;%_subi %0,1\\;sub %0,%2\n jfcl 17,.+1\\;subm %Z2,%Z0\\;jcry0 .+2\\;%_sos %0\\;subm %2,%0\"\n [(set_attr \"length\" \"5,5\")])\n\n(define_insn \"*DSUB\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r,r\")\n\t(minus:DI (match_operand:DI 1 \"register_operand\" \"0,0\")\n\t\t (match_operand:DI 2 \"reg_or_mem_operand\" \"rm,i\")))]\n \"TARGET_71BIT && TARGET_KL10up\"\n \"@\n dsub %0,%2\n dsub %0,[%D2]\")\n\n(define_insn \"mulsi3\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,r,r,m\")\n\t(mult:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"%0,0,0,0\")\n\t\t (match_operand:SI 2 \"general_operand\" \"rm,I,i,r\")))]\n \"\"\n \"@\n imul %0,%2\n imuli %0,%2\n imul %0,[%2]\n imulm %2,%0\")\n\n(define_insn \"*IMULI_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(mult:SI (and:SI (match_operand:SI 1 \"register_operand\" \"x\")\n\t\t\t (const_int RIGHT_HALF))\n\t\t (match_operand:SI 2 \"register_operand\" \"0\")))]\n \"\"\n \"imuli %0,(%1)\")\n(define_insn \"*IMULI_const_plus_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(mult:SI (and:SI (plus:SI (match_operand:SI 1 \"register_operand\" \"x\")\n\t\t\t\t (match_operand:SI 2 \"const_int_operand\" \"I\"))\n\t\t\t (const_int RIGHT_HALF))\n\t\t (match_operand:SI 3 \"register_operand\" \"0\")))]\n \"pdp10_const_ok_for_letter_p (INTVAL (operands[2]), 'I')\"\n \"imuli %0,%2(%1)\")\n\n(define_insn \"*IMULB1\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(mult:SI (match_dup 0) (match_operand:SI 1 \"register_operand\" \"r\")))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(mult:SI (match_dup 0) (match_dup 1)))]\n \"\"\n \"imulb %1,%0\")\n(define_insn \"*IMULB2\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(mult:SI (match_operand:SI 1 \"register_operand\" \"r\") (match_dup 0)))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(mult:SI (match_dup 1) (match_dup 0)))]\n \"\"\n \"imulb %1,%0\")\n\n(define_expand \"mulsidi3\"\n [(set (match_operand:DI 0 \"register_operand\" \"\")\n\t(mult:DI\n\t (sign_extend:DI (match_operand:SI 1 \"register_operand\" \"\"))\n\t (sign_extend:DI (match_operand:SI 2 \"general_operand\" \"\"))))]\n \"TARGET_71BIT\"\n \"\")\n\n(define_insn \"*mulsidi3\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r,r,r\")\n\t(mult:DI\n\t (sign_extend:DI (match_operand:SI 1 \"register_operand\" \"%0,0,0\"))\n\t (sign_extend:DI (match_operand:SI 2 \"general_operand\" \"rm,I,i\"))))]\n \"TARGET_71BIT\"\n \"@\n mul %0,%2\n muli %0,%2\n mul %0,[%2]\")\n\n(define_insn \"MUL\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r,r,r\")\n\t(unspec:DI\n\t [(sign_extend:DI (match_operand:SI 1 \"register_operand\" \"%0,0,0\"))\n\t (sign_extend:DI (match_operand:SI 2 \"general_operand\" \"rm,I,i\"))]\n\t UNSPEC_MUL71))]\n \"\"\n \"@\n mul %0,%2\n muli %0,%2\n mul %0,[%2]\")\n\n(define_expand \"smulsi3_highpart\"\n [(set (match_dup 3)\n\t(truncate:SI\n\t (lshiftrt:DI\n\t (mult:DI\n\t (sign_extend:DI (match_operand:SI 1 \"register_operand\" \"%r\"))\n\t (sign_extend:DI (match_operand:SI 2 \"reg_or_mem_operand\" \"0\")))\n\t (const_int 35))))\n (set (match_operand:SI 0 \"reg_or_mem_operand\" \"=rm\")\n\t(ashiftrt:SI (match_dup 3) (neg:SI (const_int -1))))]\n \"0\"\n \"operands[3] = gen_reg_rtx (SImode);\")\n\n(define_insn \"*smulsi3_highpart\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(truncate:SI\n\t (lshiftrt:DI\n\t (mult:DI\n\t (sign_extend:DI (match_operand:SI 1 \"register_operand\" \"%0\"))\n\t (sign_extend:DI (match_operand:SI 2 \"register_operand\" \"r\")))\n\t (const_int 36))))]\n \"0\"\n \"jfcl .+1\\;mulm %2,%0\\;jov [movsi %0,200000\\;%_%_%_%_%_jrst .+2]\\;ash %0,-1\"\n [(set_attr \"length\" \"4\")])\n\n(define_insn \"*smulsi3_highpart_71\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=rm\")\n\t(truncate:SI\n\t (lshiftrt:DI\n\t (mult:DI\n\t (sign_extend:DI (match_operand:SI 1 \"register_operand\" \"%r\"))\n\t (sign_extend:DI (match_operand:SI 2 \"reg_or_mem_operand\" \"0\")))\n\t (const_int 35))))]\n \"0\"\n \"mulm %1,%0\")\n\n(define_expand \"muldi3\"\n [(set (match_operand:DI 0 \"register_operand\" \"\")\n\t(mult:DI (match_operand:DI 1 \"register_operand\" \"\")\n\t\t (match_operand:DI 2 \"reg_or_mem_operand\" \"\")))]\n \"0\"\n \"{\n rtx temp = gen_reg_rtx (TImode);\n\n emit_move_insn (gen_rtx_SUBREG (DImode, temp, 0), operands[1]);\n emit_insn (gen_DMUL (temp, gen_rtx_SUBREG (DImode, temp, 8),\n\t\t\t operands[2]));\n emit_insn (gen_ashlsi3 (gen_rtx_SUBREG (SImode, temp, 8),\n\t\t\t gen_rtx_SUBREG (SImode, temp, 8),\n\t\t\t GEN_INT (1)));\n emit_insn (gen_lshrdi3 (gen_rtx_SUBREG (DImode, temp, 4),\n\t\t\t gen_rtx_SUBREG (DImode, temp, 4),\n\t\t\t GEN_INT (1)));\n emit_insn (gen_ashlsi3 (gen_rtx_SUBREG (SImode, temp, 12),\n\t\t\t gen_rtx_SUBREG (SImode, temp, 12),\n\t\t\t GEN_INT (1)));\n emit_insn (gen_lshrdi3 (gen_rtx_SUBREG (DImode, temp, 8),\n\t\t\t gen_rtx_SUBREG (DImode, temp, 8),\n\t\t\t GEN_INT (1)));\n emit_insn (gen_TRNE_TLO (gen_rtx_SUBREG (SImode, temp, 8),\n\t\t\t gen_rtx_SUBREG (SImode, temp, 8),\n\t\t\t gen_rtx_SUBREG (SImode, temp, 12)));\n\t\t\t\t\n DONE;\n }\")\n\n(define_insn \"TRNE_TLO\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(unspec:SI [(match_operand:SI 1 \"register_operand\" \"0\")\n\t\t (match_operand:SI 2 \"register_operand\" \"r\")]\n\t\t UNSPEC_TRNE_TLO))]\n \"\"\n \"trne %2,1\\;%_tlo %0,400000\"\n [(set_attr \"length\" \"2\")])\n\n(define_expand \"mulditi3\"\n [(set (match_operand:TI 0 \"register_operand\" \"=r,r\")\n\t(mult:TI\n\t (sign_extend:TI (match_operand:DI 1 \"register_operand\" \"%0,0\"))\n\t (sign_extend:TI (match_operand:DI 2 \"general_operand\" \"rm,i\"))))]\n \"TARGET_71BIT && TARGET_KL10up\"\n \"\")\n\n(define_insn \"DMUL\"\n [(set (match_operand:TI 0 \"register_operand\" \"=r,r\")\n\t(mult:TI\n\t (sign_extend:TI (match_operand:DI 1 \"register_operand\" \"%0,0\"))\n\t (sign_extend:TI (match_operand:DI 2 \"general_operand\" \"rm,i\"))))]\n \"TARGET_71BIT && TARGET_KL10up\"\n \"@\n dmul %0,%2\n dmul %0,[%D2]\")\n\n(define_insn \"IDIV\"\n [(set (subreg:SI (match_operand:DI 0 \"register_operand\" \"=r,r,r\") 0)\n (div:SI (match_operand:SI 1 \"register_operand\" \"0,0,0\")\n (match_operand:SI 2 \"general_operand\" \"rm,I,i\")))\n (set (subreg:SI (match_dup 0) 4)\n (mod:SI (match_dup 1) (match_dup 2)))]\n \"\"\n \"@\n idiv %0,%2\n idivi %0,%2\n idiv %0,[%2]\")\n\n(define_insn \"IDIVM\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=rm\")\n (div:SI (match_operand:SI 1 \"register_operand\" \"r\")\n (match_operand:SI 2 \"reg_or_mem_operand\" \"0\")))]\n \"\"\n \"idivm %1,%0\")\n\n;; IDIVI with indexing missing.\n;; IDIVB missing.\n\n(define_expand \"divsi3\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"\")\n\t(div:SI (match_operand:SI 1 \"register_operand\" \"\")\n\t\t(match_operand:SI 2 \"general_operand\" \"\")))]\n \"\"\n \"if (immediate_operand (operands[2], SImode))\n {\n rtx temp = gen_reg_rtx (DImode);\n rtx temp0 = gen_rtx_SUBREG (SImode, temp, 0);\n\n emit_move_insn (temp0, operands[1]);\n emit_insn (gen_IDIV (temp, temp0, operands[2]));\n emit_move_insn (operands[0], temp0);\n }\n else\n emit_insn (gen_IDIVM (operands[0], operands[1], operands[2]));\n DONE;\")\n\n(define_expand \"modsi3\"\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(mod:SI (match_operand:SI 1 \"register_operand\" \"\")\n\t\t(match_operand:SI 2 \"general_operand\" \"\")))]\n \"\"\n \"{\n rtx temp = gen_reg_rtx (DImode);\n rtx temp0 = gen_rtx_SUBREG (SImode, temp, 0);\n rtx temp1 = gen_rtx_SUBREG (SImode, temp, 4);\n\n emit_move_insn (temp0, operands[1]);\n emit_insn (gen_IDIV (temp, temp0, operands[2]));\n emit_move_insn (operands[0], temp1);\n DONE;\n }\")\n\n;; This is disabled, since it doesn't seem to have any advantages over\n;; the `divsi3' and `modsi3' patterns.\n(define_expand \"_divmodsi4\"\n [(parallel [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"\")\n\t\t (div:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"\")\n\t\t\t (match_operand:SI 2 \"general_operand\" \"\")))\n\t (set (match_operand:SI 3 \"reg_or_mem_operand\" \"\")\n\t\t (mod:SI (match_dup 1) (match_dup 2)))])]\n \"0\"\n \"{\n rtx temp = gen_reg_rtx (DImode);\n rtx temp0 = gen_rtx_SUBREG (SImode, temp, 0);\n rtx temp1 = gen_rtx_SUBREG (SImode, temp, 4);\n\n emit_move_insn (temp0, operands[1]);\n emit_insn (gen_IDIV (temp, temp0, operands[2]));\n emit_move_insn (operands[0], temp0);\n emit_move_insn (operands[3], temp1);\n DONE;\n }\")\n\n(define_insn \"*DIV\"\n [(set (subreg:SI (match_operand:DI 0 \"register_operand\" \"=r,r,r\") 0)\n (truncate:SI\n\t (div:DI\n\t (match_operand:DI 1 \"register_operand\" \"0,0,0\")\n\t (sign_extend:DI (match_operand:SI 2 \"general_operand\" \"rm,I,i\")))))\n (set (subreg:SI (match_dup 0) 4)\n (truncate:SI (mod:DI (match_dup 1) (sign_extend:DI (match_dup 2)))))]\n \"TARGET_71BIT\"\n \"@\n div %0,%2\n divi %0,%2\n div %0,[%D2]\")\n\n(define_insn \"*DIVM\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=rm\")\n\t(truncate:SI\n\t (div:DI\n\t (match_operand:DI 1 \"register_operand\" \"r\")\n\t (sign_extend:DI (match_operand:SI 2 \"memory_operand\" \"0\")))))]\n \"TARGET_71BIT\"\n \"divm %1,%0\")\n\n;; DIVB missing.\n\n(define_insn \"DDIV\"\n [(set (subreg:DI (match_operand:TI 0 \"register_operand\" \"=r,r\") 0)\n (truncate:DI\n\t (div:TI\n\t (match_operand:TI 1 \"register_operand\" \"0,0\")\n\t (sign_extend:TI (match_operand:DI 2 \"general_operand\" \"rm,i\")))))\n (set (subreg:DI (match_dup 0) 8)\n (truncate:DI (mod:TI (match_dup 1) (sign_extend:TI (match_dup 2)))))]\n \"TARGET_71BIT\"\n \"@\n ddiv %0,%2\n ddiv %0,[%D2]\")\n\n(define_expand \"divmoddi4\"\n [(parallel [(set (match_operand:DI 0 \"reg_or_mem_operand\" \"\")\n\t\t (div:DI (match_operand:DI 1 \"register_operand\" \"\")\n\t\t\t (match_operand:DI 2 \"general_operand\" \"\")))\n\t (set (match_operand:DI 3 \"register_operand\" \"\")\n\t\t (mod:DI (match_dup 1) (match_dup 2)))])]\n \"TARGET_71BIT\"\n \"{\n rtx temp = gen_reg_rtx (TImode);\n emit_move_insn (gen_rtx_SUBREG (SImode, temp, 0),\n\t\t gen_rtx_SUBREG (SImode, operands[1], 0));\n emit_insn (gen_ashrsi3 (gen_rtx_SUBREG (SImode, temp, 0),\n\t\t\t gen_rtx_SUBREG (SImode, temp, 0),\n\t\t\t GEN_INT (35)));\n emit_move_insn (gen_rtx_SUBREG (SImode, temp, 4),\n\t\t gen_rtx_SUBREG (SImode, temp, 0));\n emit_move_insn (gen_rtx_SUBREG (DImode, temp, 8), operands[1]);\n emit_insn (gen_DDIV (temp, temp, operands[2]));\n emit_move_insn (operands[0], gen_rtx_SUBREG (DImode, temp, 0));\n emit_move_insn (operands[3], gen_rtx_SUBREG (DImode, temp, 8));\n DONE;\n }\")\n\n(define_insn \"udivsi3\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,r,r,m\")\n\t(udiv:SI (match_operand:SI 1 \"register_operand\" \"0,0,0,r\")\n\t\t (match_operand:SI 2 \"general_operand\" \"I,i,rm,0\")))]\n \"TARGET_XKL2\"\n \"@\n extend %0,[uidivi %2]\n extend %0,[uidiv [%2]]\n extend %0,[uidiv %2]\n extend %1,[uidivm %0]\")\n\n;; UIDIVI with indexing missing.\n;; UIDIVB missing.\n\n(define_insn \"umodsi3\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r,r,r,m\")\n\t(umod:SI (match_operand:SI 1 \"register_operand\" \"0,0,0,r\")\n\t\t (match_operand:SI 2 \"general_operand\" \"I,i,rm,0\")))]\n \"TARGET_XKL2\"\n \"@\n extend %0,[uimodi %2]\n extend %0,[uimod [%2]]\n extend %0,[uimod %2]\n extend %1,[uimodm %0]\")\n\n;; UIMODI with indexing missing.\n;; UIMODB missing.\n\n(define_insn \"negsi2\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,m,r,m\")\n\t(neg:SI (match_operand:SI 1 \"general_operand\" \"rm,r,I,0\")))]\n \"\"\n \"@\n movn %0,%1\n movnm %1,%0\n movni %0,%N1\n movns %0\")\n\n(define_insn \"*MOVNI_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(neg:SI (and:SI (match_operand:SI 1 \"register_operand\" \"r\")\n\t\t\t(const_int RIGHT_HALF))))]\n \"\"\n \"movni %0,(%1)\")\n(define_insn \"*MOVNI_const_plus_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(neg:SI (and:SI (plus:SI (match_operand:SI 1 \"register_operand\" \"r\")\n\t\t\t\t (match_operand:SI 2 \"const_int_operand\" \"I\"))\n\t\t\t(const_int RIGHT_HALF))))]\n \"pdp10_const_ok_for_letter_p (INTVAL (operands[2]), 'I')\"\n \"movni %0,%2(%1)\")\n\n(define_insn \"*MOVNS\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"+rm\")\n\t(neg:SI (match_dup 0)))\n (set (match_operand:SI 1 \"register_operand\" \"=x\")\n\t(neg:SI (match_dup 0)))]\n \"\"\n \"movns %1,%0\")\n\n(define_expand \"negdi2\"\n [(set (match_operand:DI 0 \"reg_or_mem_operand\" \"\")\n\t(neg:DI (match_operand:DI 1 \"reg_or_mem_operand\" \"\")))]\n \"TARGET_KI10up && TARGET_71BIT\"\n \"\")\n\n(define_insn \"*negdi2\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r,r\")\n\t(neg:DI (match_operand:DI 1 \"reg_or_mem_operand\" \"0,ro\")))]\n \"!TARGET_71BIT\"\n \"@\n setca %0,\\;jumpe %Z0,[aoja %0,.+2]\\;%_movn %Z0,%Z0\n setcm %0,%1\\;movn %Z0,%Z1\\;jumpe %Z0,[aoja %0,.+1]\"\n [(set_attr \"length\" \"3,3\")])\n\n(define_insn \"*DMOVN\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r\")\n\t(neg:DI (match_operand:DI 1 \"reg_or_mem_operand\" \"rm\")))]\n \"TARGET_71BIT && TARGET_KI10up\"\n \"dmovn %0,%1\\;tlne %0,400000\\;%_tlo %Z0,400000\"\n [(set_attr \"length\" \"3\")])\n\n(define_insn \"abssi2\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,m,m\")\n\t(abs:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"rm,r,0\")))]\n \"\"\n \"@\n movm %0,%1\n movmm %1,%0\n movms %0\")\n\n(define_insn \"*MOVMS\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"+rm\")\n\t(abs:SI (match_dup 0)))\n (set (match_operand:SI 1 \"register_operand\" \"=x\")\n\t(abs:SI (match_dup 0)))]\n \"\"\n \"movms %1,%0\")\n\n(define_insn \"smaxsi3\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r,r,r,r,r,x,x,x\")\n (smax:SI (match_operand:SI 1 \"register_operand\" \"%0,0,0,0,r,r,r,r\")\n\t\t (match_operand:SI 2 \"general_operand\" \"rm,I,M,i,0,O,I,rm\")))]\n \"\"\n \"@\n camge %1,%2\\;%_move %0,%2\n caige %1,%2\\;%_movei %0,%2\n camge %1,[%2]\\;%_seto %0,\n camge %1,[%2]\\;%_move %0,[%2]\n camle %1,%2\\;%_move %0,%1\n skipge %0,%1\\;%_movei %0,0\n caile %1,%2\\;%_skipa %0,%1\\;%_%_movei %0,%2\n camle %1,%2\\;%_skipa %0,%1\\;%_%_move %0,%2\"\n [(set_attr \"length\" \"2,2,2,2,2,2,3,3\")])\n\n(define_expand \"umaxsi3\"\n [(set (match_dup 3)\n\t(xor:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"\")\n (const_int SIGNBIT)))\n (set (match_dup 4)\n\t(xor:SI (match_operand:SI 2 \"reg_or_mem_operand\" \"\")\n (const_int SIGNBIT)))\n (set (match_operand:SI 0 \"register_operand\" \"\")\n\t(if_then_else:SI\n\t (ge (match_dup 3) (match_dup 4))\n\t (match_dup 1)\n\t (match_dup 2)))]\n \"\"\n \"operands[3] = gen_reg_rtx (SImode);\n operands[4] = gen_reg_rtx (SImode);\")\n\n(define_insn \"*umaxsi3\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r,r,x\")\n\t(if_then_else:SI\n\t (ge (match_operand:SI 3 \"register_operand\" \"r,r,r\")\n\t (match_operand:SI 4 \"reg_or_mem_operand\" \"rm,rm,rm\"))\n\t (match_operand:SI 1 \"reg_or_mem_operand\" \"0,rm,rm\")\n\t (match_operand:SI 2 \"reg_or_mem_operand\" \"rm,0,rm\")))]\n \"\"\n \"@\n camge %3,%4\\;%_move %0,%2\n camle %3,%4\\;%_move %0,%1\n camle %3,%4\\;%_skipa %0,%1\\;%_%_move %0,%2\"\n [(set_attr \"length\" \"2,2,3\")])\n\n(define_insn \"sminsi3\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r,r,r,r,r,x,x,x\")\n (smin:SI (match_operand:SI 1 \"register_operand\" \"%0,0,0,0,r,r,r,r\")\n\t\t (match_operand:SI 2 \"general_operand\" \"rm,I,M,i,0,O,I,rm\")))]\n \"\"\n \"@\n camle %1,%2\\;%_move %0,%2\n caile %1,%2\\;%_movei %0,%2\n camle %1,[%2]\\;%_seto %0,\n camle %1,[%2]\\;%_move %0,[%2]\n camge %1,%2\\;%_move %0,%1\n skiple %0,%1\\;%_movei %0,0\n caige %1,%2\\;%_skipa %0,%1\\;%_%_movei %0,%2\n camge %1,%2\\;%_skipa %0,%1\\;%_%_move %0,%2\"\n [(set_attr \"length\" \"2,2,2,2,2,2,3,3\")])\n\n(define_expand \"uminsi3\"\n [(set (match_dup 3)\n\t(xor:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"\")\n (const_int SIGNBIT)))\n (set (match_dup 4)\n\t(xor:SI (match_operand:SI 2 \"reg_or_mem_operand\" \"\")\n (const_int SIGNBIT)))\n (set (match_operand:SI 0 \"register_operand\" \"\")\n\t(if_then_else:SI\n\t (le (match_dup 3) (match_dup 4))\n\t (match_dup 1)\n\t (match_dup 2)))]\n \"\"\n \"operands[3] = gen_reg_rtx (SImode);\n operands[4] = gen_reg_rtx (SImode);\")\n\n(define_insn \"*uminsi3\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r,r,x\")\n\t(if_then_else:SI\n\t (le (match_operand:SI 3 \"register_operand\" \"r,r,r\")\n\t (match_operand:SI 4 \"reg_or_mem_operand\" \"rm,rm,rm\"))\n\t (match_operand:SI 1 \"reg_or_mem_operand\" \"0,rm,rm\")\n\t (match_operand:SI 2 \"reg_or_mem_operand\" \"rm,0,rm\")))]\n \"\"\n \"@\n camle %3,%4\\;%_move %0,%2\n camge %3,%4\\;%_move %0,%1\n camge %3,%4\\;%_skipa %0,%1\\;%_%_move %0,%2\"\n [(set_attr \"length\" \"2,2,3\")])\n\n;; The JFFO instruction searches from the most significant bit while\n;; FFS searches from the least significant bit. The bit index and\n;; treatment of zero also differ.\n(define_expand \"ffssi2\"\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(ffs:SI (match_operand:SI 1 \"register_operand\" \"\")))]\n \"TARGET_KA10up\"\n \"if (!TARGET_XKL2)\n {\n rtx t1 = gen_reg_rtx (SImode);\n rtx t2 = gen_reg_rtx (SImode);\n rtx t3 = gen_reg_rtx (DImode);\n rtx t4 = gen_reg_rtx (SImode);\n rtx label = gen_label_rtx ();\n extern int pdp10_expand_ffs;\n\n pdp10_expand_ffs++;\n\n emit_insn (gen_negsi2 (t1, operands[1]));\n emit_insn (gen_andsi3 (t2, operands[1], t1));\n emit_move_insn (gen_rtx_SUBREG (SImode, t3, 0), t2);\n emit_jump_insn (gen_JFFO (t3, gen_rtx_LABEL_REF (Pmode, label)));\n emit_move_insn (gen_rtx_SUBREG (SImode, t3, 4),\n\t\t GEN_INT (36));\n emit_label (label);\n emit_insn (gen_subsi3 (t4,\n\t\t\t gen_rtx_SUBREG (SImode, t3, 4),\n\t\t\t GEN_INT (36)));\n emit_insn (gen_negsi2 (operands[0], t4));\n DONE;\n }\")\n\n(define_insn \"*FFS\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(ffs:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"rm\")))]\n \"TARGET_XKL2\"\n \"ffs %0,%1\")\n\n; (define_expand \"popcountsi\"\n; Sequence taken from HAKMEM.\n; LDB B,[014300,,A] ;or MOVE B,A then LSH B,-1\n; AND B,[333333,,333333]\n; SUB A,B\n; LSH B,-1\n; AND B,[333333,,333333]\n; SUBB A,B ;each octal digit is replaced by number of 1's in it\n; LSH B,-3\n; ADD A,B\n; AND A,[070707,,070707]\n; IDIVI A,77 ;casting out 63.'s\n\n\f\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Integer Conversions\n\n; (define_insn \"zero_extendqisi2\"\n; [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n; (zero_extend:SI (match_operand:QI 1 \"register_operand\" \"r\")))]\n; \"\"\n; \"\"\n; [(set_attr \"length\" \"0\")])\n(define_insn \"zero_extendqisi2\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n (zero_extend:SI (match_operand:QI 1 \"register_operand\" \"0\")))]\n \"\"\n {\n if (zero_extended_p (operands[0], 27, insn))\n return \"\";\n else\n return \"andi %0,777%; zero_extendqisi2\";\n })\n\n(define_insn \"zero_extendhisi2\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n (zero_extend:SI (match_operand:HI 1 \"register_operand\" \"r\")))]\n \"\"\n {\n if (REGNO (operands[0]) == REGNO (operands[1])\n\t&& zero_extended_p (operands[0], 18, insn))\n return \"\";\n else\n return \"hrrz %0,%1%; zero_extendhisi2\";\n })\n\n(define_insn \"zero_extendsi\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(unspec:SI [(match_operand:SI 1 \"register_operand\" \"0\")\n\t\t (match_operand:SI 2 \"const_int_operand\" \"\")]\n\t\t UNSPEC_ZERO_EXTEND))]\n \"\"\n {\n int extend_bits = INTVAL (operands[2]);\n int bitsize = BITS_PER_WORD - extend_bits;\n if (zero_extended_p (operands[0], extend_bits, insn))\n return \"\";\n else if (extend_bits > 18)\n {\n operands[2] = GEN_INT ((1 << bitsize) - 1);\n return \"andi %0,%2\";\n }\n else if (extend_bits == 18)\n return \"hrrz %0,%0\";\n else\n {\n operands[2] = GEN_INT (((1 << extend_bits) - 1) << (18 - extend_bits));\n return \"tlz %0,%2\";\n }\n })\n\n(define_insn \"*extendqisi2_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n (sign_extend:SI\n\t (subreg:QI (match_operand:SI 1 \"register_operand\" \"r\") 0)))]\n \"\"\n {\n if (REGNO (operands[0]) == REGNO (operands[1]))\n return \"\";\n else\n return \"move %0,%1%; extendqisi2_reg\";\n })\n\n(define_expand \"extendqisi2\"\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(sign_extend:SI (match_operand:QI 1 \"register_operand\" \"\")))]\n \"\"\n \"\")\n; \"if (!TARGET_XKL2)\n; {\n; rtx op1 = operands[1];\n; if (GET_CODE (op1) == SUBREG && SUBREG_BYTE (op1) == 3)\n; \top1 = SUBREG_REG (op1);\n; emit_insn (gen_ashlsi3 (operands[0],\n; \t\t\t gen_rtx_SUBREG (SImode, op1, 0),\n; \t\t\t GEN_INT (27)));\n; emit_insn (gen_ASH_right (operands[0], operands[0], GEN_INT (-27)));\n; DONE;\n; }\")\n\n\n(define_insn \"*extendqisi2\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(sign_extend:SI (match_operand:QI 1 \"register_operand\" \"0\")))]\n \"!TARGET_XKL2\"\n {\n if (sign_extended_p (operands[0], 27, insn))\n return \"\";\n else if (zero_extended_p (operands[0], 27, insn))\n return \"trne %0,400\\;%_orcmi %0,777\";\n else\n return \"lsh %0,33\\;ash %0,-33\";\n }\n [(set_attr \"length\" \"2\")])\n\n(define_insn \"*extendqisi2_xkl2\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(sign_extend:SI (match_operand:QI 1 \"register_operand\" \"0\")))]\n \"TARGET_XKL2\"\n \"extend %0,[sext 9]\")\n\n(define_insn \"extendhisi2\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(sign_extend:SI (match_operand:HI 1 \"register_operand\" \"r\")))]\n \"\"\n {\n if (sign_extended_p (operands[1], 18, insn)\n\t&& REGNO (operands[0]) == REGNO (operands[1]))\n return \"\";\n else\n return \"hrre %0,%1%; extendhisi2\";\n })\n\n(define_insn \"sign_extendsi\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(unspec:SI [(match_operand:SI 1 \"register_operand\" \"0\")\n\t\t (match_operand:SI 2 \"const_int_operand\" \"\")]\n\t\t UNSPEC_SIGN_EXTEND))]\n \"\"\n {\n int extend_bits = INTVAL (operands[2]);\n if (sign_extended_p (operands[0], extend_bits, insn))\n return \"\";\n else if (zero_extended_p (operands[0], extend_bits, insn))\n {\n int bitsize = BITS_PER_WORD - extend_bits;\n operands[1] = GEN_INT ((HOST_WIDE_INT)1 << (bitsize - 1));\n operands[2] = GEN_INT (((HOST_WIDE_INT)1 << bitsize) - 1);\n return \"trne %0,%1\\;%_orcmi %0,%2\";\n }\n else\n return \"lsh %0,%2\\;ash %0,-%2\";\n })\n\n(define_insn \"truncsiqi2\"\n [(set (match_operand:QI 0 \"register_operand\" \"=r\")\n\t(truncate:QI (match_operand:SI 1 \"register_operand\" \"0\")))]\n \"\"\n \"andi %0,777%; truncsiqi2\")\n\n(define_insn \"truncsihi2\"\n [(set (match_operand:HI 0 \"register_operand\" \"=r\")\n\t(truncate:HI (match_operand:SI 1 \"register_operand\" \"r\")))]\n \"\"\n \"hrr %0,%1%; truncsihi2\")\n\n(define_insn \"truncsi\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(unspec:SI [(match_operand:SI 1 \"register_operand\" \"0\")\n\t\t (match_operand 2 \"const_int_operand\" \"\")]\n\t\t UNSPEC_TRUNCATE))]\n \"\"\n {\n int bits = BITS_PER_WORD - INTVAL (operands[2]);\n if (bits < 18)\n {\n\toperands[2] = GEN_INT (((HOST_WIDE_INT)1 << bits) - 1);\n\treturn \"andi %0,%2%; truncsi\";\n }\n else\n {\n\toperands[2] = GEN_INT ((0777777 << (bits - 18)) & 0777777);\n\treturn \"tlz %0,%2%; truncsi\";\n }\n })\n\n\f\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Shifting and Rotating\n\n(define_insn \"real_ashlsi3\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r,r,r\")\n (unspec:SI\n\t[(match_operand:SI 1 \"register_operand\" \"0,0,0\")\n\t (match_operand:SI 2 \"general_operand\" \"x,K,m\")]\n\tUNSPEC_REAL_ASHIFT))]\n \"\"\n \"@\n ash %0,(%2)\n ash %0,%2\n ash %0,@%2\")\n\n(define_insn \"*ASH_left_plus\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n (unspec:SI\n\t[(match_operand:SI 1 \"register_operand\" \"0\")\n\t (plus:SI (match_operand:SI 2 \"register_operand\" \"x\")\n\t\t (match_operand:SI 3 \"immediate_operand\" \"K\"))]\n\tUNSPEC_REAL_ASHIFT))]\n \"\"\n \"ash %0,%3(%2)\")\n\n(define_expand \"lshrsi3\"\n [(set (match_dup 3) (neg:SI (match_operand:SI 2 \"general_operand\" \"\")))\n (set (match_operand:SI 0 \"register_operand\" \"\")\n\t(lshiftrt:SI (match_operand:SI 1 \"register_operand\" \"\")\n\t\t (neg:SI (match_dup 3))))]\n \"\"\n \"if (GET_CODE (operands[2]) == CONST_INT)\n {\n emit_insn (gen_LSH_right (operands[0], operands[1],\n\t\t\t\t GEN_INT (-INTVAL (operands[2]))));\n DONE;\n }\n else\n operands[3] = gen_reg_rtx (SImode);\")\n\n(define_insn \"LSH_right\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r,r,r\")\n\t(lshiftrt:SI (match_operand:SI 1 \"register_operand\" \"0,0,0\")\n\t\t (neg:SI (match_operand:SI 2 \"general_operand\" \"x,K,m\"))))]\n \"\"\n \"@\n lsh %0,(%2)\n lsh %0,%2\n lsh %0,@%2\")\n\n(define_insn \"*LSH_right_plus\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(lshiftrt:SI\n\t (match_operand:SI 1 \"register_operand\" \"0\")\n\t (neg:SI (plus:SI (match_operand:SI 2 \"register_operand\" \"x\")\n\t\t\t (match_operand:SI 3 \"const_int_operand\" \"K\")))))]\n \"\"\n \"lsh %0,%3(%2)\")\n\n(define_insn \"real_ashldi3\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r,r,r\")\n (unspec:DI\n\t[(match_operand:DI 1 \"register_operand\" \"0,0,0\")\n\t (match_operand:SI 2 \"general_operand\" \"x,K,m\")]\n\tUNSPEC_REAL_ASHIFT))]\n \"TARGET_71BIT\"\n \"@\n ashc %0,(%2)\n ashc %0,%2\n ashc %0,@%2\")\n\n(define_insn \"*ASHC\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r\")\n (unspec:DI\n\t[(match_operand:DI 1 \"register_operand\" \"0\")\n\t (plus:SI (match_operand:SI 2 \"register_operand\" \"x\")\n\t\t (match_operand:SI 3 \"immediate_operand\" \"K\"))]\n\tUNSPEC_REAL_ASHIFT))]\n \"TARGET_71BIT\"\n \"ashc %0,%3(%2)\")\n\n(define_expand \"lshrdi3\"\n [(set (match_dup 3) (neg:SI (match_operand:SI 2 \"general_operand\" \"\")))\n (set (match_operand:DI 0 \"register_operand\" \"\")\n\t(lshiftrt:DI (match_operand:DI 1 \"register_operand\" \"\")\n\t\t (neg:SI (match_dup 3))))]\n \"\"\n \"if (GET_CODE (operands[2]) == CONST_INT)\n {\n if (TARGET_71BIT)\n\t emit_insn (gen_LSHC_right_71 (operands[0], operands[1],\n\t\t\t\t GEN_INT (-INTVAL (operands[2]))));\n else\n\t emit_insn (gen_LSHC_right (operands[0], operands[1],\n\t\t\t\t GEN_INT (-INTVAL (operands[2]))));\n DONE;\n }\n else\n operands[3] = gen_reg_rtx (SImode);\")\n\n(define_insn \"LSHC_right_71\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r,r,r\")\n\t(lshiftrt:DI (match_operand:DI 1 \"register_operand\" \"0,0,0\")\n\t\t (neg:SI (match_operand:SI 2 \"general_operand\" \"x,K,m\"))))]\n \"TARGET_71BIT\"\n {\n const char *asms[] =\n {\n \"lsh %Z0,1\\;lshc %0,(%2)\\;lsh %Z0,-1\",\n \"lsh %Z0,1\\;lshc %0,%2\\;lsh %Z0,-1\",\n \"lsh %Z0,1\\;lshc %0,@%2\\;lsh %Z0,-1\"\n };\n int n;\n\n if (get_attr_length (insn) == 1)\n {\n operands[2] = GEN_INT (INTVAL (operands[2]) - 1);\n\treturn \"lshc %0,%2\";\n }\n /*else if (GET_CODE (operands[2]) == CONST_INT\n\t && INTVAL (operands[2]) == -1)\n return \"ashc %0,-1\\;tlze %0,400000\\;tlz %Z0,400000\";*/\n else if (GET_CODE (operands[2]) == CONST_INT\n\t && (n = INTVAL (operands[2])) >= -18)\n {\n int mask = (0777777 << (18 + n)) & 0777777;\n\tstatic char insn[100];\n\n\tsnprintf (insn, sizeof insn,\n\t\t \"ashc %%0,%%2\\;tlze %%0,%o\\;tlz %%Z0,400000\",\n\t\t mask);\n\treturn insn;\n }\n else\n return asms[which_alternative];\n }\n [(set (attr \"length\")\n\t(if_then_else (and (match_operand 2 \"const_int_operand\" \"\")\n\t\t\t (ge (symbol_ref \"-INTVAL (operands[2])\")\n\t\t\t (const_int 35)))\n\t\t (const_int 1)\n\t\t (const_int 3)))])\n\n(define_insn \"LSHC_right\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r,r,r\")\n\t(lshiftrt:DI (match_operand:DI 1 \"register_operand\" \"0,0,0\")\n\t\t (neg:SI (match_operand:SI 2 \"general_operand\" \"x,K,m\"))))]\n \"!TARGET_71BIT\"\n \"@\n lshc %0,(%2)\n lshc %0,%2\n lshc %0,@%2\")\n\n(define_insn \"*LSHC_right_plus_71\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r\")\n\t(lshiftrt:DI\n\t (match_operand:DI 1 \"register_operand\" \"0\")\n\t (neg:SI (plus:SI (match_operand:SI 2 \"register_operand\" \"x\")\n\t\t\t (match_operand:SI 3 \"immediate_operand\" \"K\")))))]\n \"TARGET_71BIT\"\n \"lsh %Z0,1\\;lshc %0,%3(%2)\\;lsh %Z0,-1\"\n [(set_attr \"length\" \"3\")])\n\n(define_insn \"*LSHC_right_plus\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r\")\n\t(lshiftrt:DI\n\t (match_operand:DI 1 \"register_operand\" \"0\")\n\t (neg:SI (plus:SI (match_operand:SI 2 \"register_operand\" \"x\")\n\t\t\t (match_operand:SI 3 \"immediate_operand\" \"K\")))))]\n \"!TARGET_71BIT\"\n \"lshc %0,%3(%2)\")\n\n(define_insn \"ashlsi3\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r,r,r\")\n\t(ashift:SI (match_operand:SI 1 \"register_operand\" \"0,0,0\")\n\t\t (match_operand:SI 2 \"general_operand\" \"x,K,m\")))]\n \"\"\n \"@\n lsh %0,(%2)\n lsh %0,%2\n lsh %0,@%2\")\n\n(define_insn \"*LSH_left_plus\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(ashift:SI (match_operand:SI 1 \"register_operand\" \"0\")\n\t\t (plus:SI (match_operand:SI 2 \"register_operand\" \"x\")\n\t\t\t (match_operand:SI 3 \"immediate_operand\" \"K\"))))]\n \"\"\n \"lsh %0,%3(%2)\")\n\n(define_expand \"ashrsi3\"\n [(set (match_dup 3) (neg:SI (match_operand:SI 2 \"general_operand\" \"\")))\n (set (match_operand:SI 0 \"register_operand\" \"\")\n\t(ashiftrt:SI (match_operand:SI 1 \"register_operand\" \"\")\n\t\t (neg:SI (match_dup 3))))]\n \"\"\n \"if (GET_CODE (operands[2]) == CONST_INT)\n {\n emit_insn (gen_ASH_right (operands[0], operands[1],\n\t\t\t\t GEN_INT (-INTVAL (operands[2]))));\n DONE;\n }\n else\n operands[3] = gen_reg_rtx (SImode);\")\n\n(define_insn \"ASH_right\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r,r,r\")\n\t(ashiftrt:SI (match_operand:SI 1 \"register_operand\" \"0,0,0\")\n\t\t (neg:SI (match_operand:SI 2 \"general_operand\" \"x,K,m\"))))]\n \"\"\n \"@\n ash %0,(%2)\n ash %0,%2\n ash %0,@%2\")\n\n(define_insn \"*ASH_right_plus\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(ashiftrt:SI\n\t (match_operand:SI 1 \"register_operand\" \"0\")\n\t (neg:SI (plus:SI (match_operand:SI 2 \"register_operand\" \"x\")\n\t\t\t (match_operand:SI 3 \"immediate_operand\" \"K\")))))]\n \"\"\n \"ash %0,%3(%2)\")\n\n(define_expand \"ashldi3\"\n [(set (match_operand:DI 0 \"register_operand\" \"\")\n\t(ashift:DI (match_operand:DI 1 \"register_operand\" \"\")\n\t\t (match_operand:SI 2 \"general_operand\" \"\")))]\n \"\"\n \"\")\n\n(define_insn \"*ashldi3\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r,r,r\")\n\t(ashift:DI (match_operand:DI 1 \"register_operand\" \"0,0,0\")\n\t\t (match_operand:SI 2 \"general_operand\" \"x,K,m\")))]\n \"!TARGET_71BIT\"\n \"@\n lshc %0,(%2)\n lshc %0,%2\n lshc %0,@%2\")\n\n(define_insn \"LSHC_left\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r,r,r\")\n\t(unspec:DI [(match_operand:DI 1 \"register_operand\" \"0,0,0\")\n\t\t (match_operand:SI 2 \"general_operand\" \"x,K,m\")]\n\t\t UNSPEC_LSHC))]\n \"TARGET_71BIT\"\n \"@\n lshc %0,(%2)\n lshc %0,%2\n lshc %0,@%2\")\n\n(define_insn \"*ashldi3_71bit\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r,r,r\")\n\t(ashift:DI (match_operand:DI 1 \"register_operand\" \"0,0,0\")\n\t\t (match_operand:SI 2 \"general_operand\" \"x,K,m\")))]\n \"TARGET_71BIT\"\n {\n const char *asms[] =\n {\n \"lsh %Z0,1\\;lshc %0,(%2)\\;lsh %Z0,-1\",\n \"lsh %Z0,1\\;lshc %0,%2\\;lsh %Z0,-1\",\n \"lsh %Z0,1\\;lshc %0,@%2\\;lsh %Z0,-1\"\n };\n\n switch (get_attr_length (insn))\n {\n case 3:\n operands[2] = GEN_INT (INTVAL (operands[2]) + 1);\n\toutput_asm_insn (\"lshc %0,%2\", operands);\n\tbreak;\n case 4:\n {\n\t static char insn[100];\n\t int n = INTVAL (operands[2]);\n\t snprintf (insn, sizeof insn,\n\t\t n < 18 ? \"tlne %%0,%o\" : \"trne %%0,%o\",\n\t\t 0400000 >> (n < 18 ? n: n - 18));\n\t output_asm_insn (insn, operands);\n return \"%_tloa %0,400000\\;%_%_tlz %0,400000\\;ashc %0,%2\";\n\t}\n case 5:\n output_asm_insn (asms[which_alternative], operands);\n\tbreak;\n default:\n abort ();\n }\n\n return \"tlne %0,400000\\;%_tlo %Z0,400000\";\n }\n [(set (attr \"length\")\n\t(if_then_else (match_operand 2 \"const_int_operand\" \"\")\n\t\t (if_then_else\n\t\t (ge (symbol_ref \"INTVAL (operands[2])\") (const_int 36))\n\t\t (const_int 3)\n\t\t (const_int 4))\n\t\t (const_int 5)))])\n\n(define_insn \"*LSHC_left_plus\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r\")\n\t(ashift:DI (match_operand:DI 1 \"register_operand\" \"0\")\n\t\t (plus:SI (match_operand:SI 2 \"register_operand\" \"x\")\n\t\t\t (match_operand:SI 3 \"immediate_operand\" \"K\"))))]\n \"!TARGET_71BIT\"\n \"lshc %0,%3(%2)\")\n\n(define_insn \"*LSHC_left_plus_71bit\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r\")\n\t(ashift:DI (match_operand:DI 1 \"register_operand\" \"0\")\n\t\t (plus:SI (match_operand:SI 2 \"register_operand\" \"x\")\n\t\t\t (match_operand:SI 3 \"immediate_operand\" \"K\"))))]\n \"TARGET_71BIT\"\n \"lsh %Z0,1\\;lshc %0,%3(%2)\\;lsh %Z0,-1\\;tlne %0,400000\\;%_tlo %Z0,400000\"\n [(set_attr \"length\" \"5\")])\n\n(define_expand \"ashrdi3\"\n [(set (match_dup 3) (neg:SI (match_operand:SI 2 \"general_operand\" \"\")))\n (set (match_operand:DI 0 \"register_operand\" \"\")\n\t(ashiftrt:DI (match_operand:DI 1 \"register_operand\" \"\")\n\t\t (neg:SI (match_dup 3))))]\n \"\"\n \"if (!TARGET_71BIT)\n {\n HOST_WIDE_INT mask;\n /*rtx op0hi = gen_rtx_SUBREG (SImode, operands[0], 0);\n rtx op0lo = gen_rtx_SUBREG (SImode, operands[0], 4);*/\n rtx temp = gen_reg_rtx (SImode);\n rtx label;\n\t\n\n if (GET_CODE (operands[2]) == CONST_INT)\n\t {\n\t int n = INTVAL (operands[2]);\n\t if (n <= 35)\n\t {\n\t label = gen_label_rtx ();\n\t mask = (HOST_WIDE_INT)1 << (35 - n);\n\t emit_insn (gen_lshrdi3 (operands[0], operands[1], operands[2]));\n\t emit_jump_insn (gen_test_and_skip (gen_rtx_EQ (VOIDmode,\n\t\t\t\t\t\t\t NULL_RTX,\n\t\t\t\t\t\t\t NULL_RTX),\n\t\t\t\t\t\t gen_rtx_SUBREG (SImode,\n\t\t\t\t\t\t\t\t operands[0],\n\t\t\t\t\t\t\t\t 0),\n\t\t\t\t\t\t gen_int_mode (mask, SImode),\n\t\t\t\t\t\t label));\n\t mask = ~(mask - 1);\n\t if (n != 17 && n != 35)\n\t\t mask <<= 1;\n\t emit_insn (gen_iorsi3 (gen_rtx_SUBREG (SImode, operands[0], 0),\n\t\t\t\t gen_rtx_SUBREG (SImode, operands[0], 0),\n\t\t\t\t gen_int_mode (mask, SImode)));\n\t emit_label (label);\n\t }\n\t else if (n == 36)\n\t /*{\n\t emit_insn (gen_ashrsi3 (gen_rtx_SUBREG (SImode, operands[0], 0),\n\t\t\t\t gen_rtx_SUBREG (SImode, operands[1], 0),\n\t\t\t\t GEN_INT (35)));\n\t emit_move_insn (gen_rtx_SUBREG (SImode, operands[0], 4),\n\t\t\t gen_rtx_SUBREG (SImode, operands[1], 0));\n\t }*/\n\t /*{\n\t emit_move_insn (gen_rtx_SUBREG (SImode, operands[0], 4),\n\t\t\t gen_rtx_SUBREG (SImode, operands[1], 0));\n\t emit_insn (gen_ashrsi3 (gen_rtx_SUBREG (SImode, operands[0], 0),\n\t\t\t\t gen_rtx_SUBREG (SImode, operands[1], 0),\n\t\t\t\t GEN_INT (35)));\n\t }*/\n\t emit_insn (gen_ashrdi3_36 (operands[0], operands[1]));\n\t else if (n >= 71 && !optimize_size)\n\t emit_insn (gen_sign_extension_di (operands[0], operands[1]));\n\t else\n\t emit_insn (gen_ASHC (operands[0], operands[1], GEN_INT (1 - n)));\n\t DONE;\n\t }\n\t \n /* Sequence adapted from Hacker's Delight, section 2-6. */\n emit_insn (gen_ashrsi3 (temp, gen_rtx_SUBREG (SImode, operands[1], 0),\n\t\t\t GEN_INT (35)));\n /*emit_move_insn (operands[0], operands[1]);\n emit_insn (gen_xorsi3 (op0hi, op0hi, temp));\n emit_insn (gen_xorsi3 (op0lo, op0lo, temp));*/\n emit_insn (gen_xordisi3 (operands[0], operands[1], temp));\n emit_insn (gen_lshrdi3 (operands[0], operands[0], operands[2]));\n /*emit_insn (gen_xorsi3 (op0hi, op0hi, temp));\n emit_insn (gen_xorsi3 (op0lo, op0lo, temp));*/\n emit_insn (gen_xordisi3 (operands[0], operands[0], temp));\n\n DONE;\n }\n else if (GET_CODE (operands[2]) == CONST_INT)\n {\n emit_insn (gen_ASHC_right (operands[0], operands[1],\n\t\t\t\t GEN_INT (-INTVAL (operands[2]))));\n DONE;\n }\n else\n operands[3] = gen_reg_rtx (SImode);\")\n\n(define_insn \"ashrdi3_36\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r\")\n\t(ashiftrt:DI (match_operand:DI 1 \"register_operand\" \"0\")\n\t\t (const_int 36)))]\n \"!TARGET_71BIT\"\n \"@\n move %Z0,%0\\;ash %0,-43\"\n [(set_attr \"length\" \"2\")])\n\n(define_insn \"sign_extension_di\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r,r\")\n\t(ashiftrt:DI (match_operand:DI 1 \"register_operand\" \"0,r\")\n\t\t (const_int 71)))]\n \"!TARGET_71BIT\"\n {\n if (which_alternative == 0)\n return \"ash %0,-43\\;move %Z0,%0\";\n else if (REGNO (operands[0]) + 1 == REGNO (operands[1]))\n return \"ash %Z0,-43\\;move %0,%Z0\";\n else\n return \"move %0,%1\\;ash %0,-43\\;move %Z0,%0\";\n }\n [(set_attr \"length\" \"2,3\")])\n\n(define_insn \"ASHC_right\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r,r,r\")\n\t(ashiftrt:DI (match_operand:DI 1 \"register_operand\" \"0,0,0\")\n\t\t (neg:SI (match_operand:SI 2 \"general_operand\" \"x,K,m\"))))]\n \"TARGET_71BIT\"\n \"@\n ashc %0,(%2)\n ashc %0,%2\n ashc %0,@%2\")\n\n(define_insn \"ASHC\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r\")\n\t(unspec:DI [(match_operand:DI 1 \"register_operand\" \"0\")\n\t\t (match_operand:SI 2 \"const_int_operand\" \"K\")]\n\t\t UNSPEC_ASHC))]\n \"!TARGET_71BIT\"\n \"ashc %0,%2\")\n\n(define_insn \"*ASHC_right_plus\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r\")\n\t(ashiftrt:DI\n\t (match_operand:DI 1 \"register_operand\" \"0\")\n\t (neg:SI (plus:SI (match_operand:SI 2 \"register_operand\" \"x\")\n\t\t\t (match_operand:SI 3 \"immediate_operand\" \"K\")))))]\n \"TARGET_71BIT\"\n \"ashc %0,%3(%2)\")\n\n(define_insn \"rotlsi3\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r,r,r\")\n\t(rotate:SI (match_operand:SI 1 \"register_operand\" \"0,0,0\")\n\t\t (match_operand:SI 2 \"general_operand\" \"x,K,m\")))]\n \"\"\n \"@\n rot %0,(%2)\n rot %0,%Y2\n rot %0,@%2\")\n\n(define_insn \"*ROT_left_plus\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(rotate:SI (match_operand:SI 1 \"register_operand\" \"0\")\n\t\t (plus:SI (match_operand:SI 2 \"register_operand\" \"x\")\n\t\t\t (match_operand:SI 3 \"immediate_operand\" \"K\"))))]\n \"\"\n \"rot %0,%Y3(%2)\")\n\n(define_expand \"rotrsi3\"\n [(set (match_dup 3) (neg:SI (match_operand:SI 2 \"general_operand\" \"\")))\n (set (match_operand:SI 0 \"register_operand\" \"\")\n\t(rotatert:SI (match_operand:SI 1 \"register_operand\" \"\")\n\t\t (neg:SI (match_dup 3))))]\n \"\"\n \"operands[3] = gen_reg_rtx (SImode);\")\n\n(define_insn \"*ROT_right\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r,r,r\")\n\t(rotatert:SI (match_operand:SI 1 \"register_operand\" \"0,0,0\")\n\t\t (neg:SI (match_operand:SI 2 \"general_operand\" \"x,K,m\"))))]\n \"\"\n \"@\n rot %0,(%2)\n rot %0,%Y2\n rot %0,@%2\")\n\n(define_insn \"*ROT_right_plus\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(rotatert:SI\n\t (match_operand:SI 1 \"register_operand\" \"0\")\n\t (neg:SI (plus:SI (match_operand:SI 2 \"register_operand\" \"x\")\n\t\t\t (match_operand:SI 3 \"immediate_operand\" \"K\")))))]\n \"\"\n \"rot %0,%Y3(%2)\")\n\n(define_insn \"rotldi3\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r,r,r\")\n\t(rotate:DI (match_operand:DI 1 \"register_operand\" \"0,0,0\")\n\t\t (match_operand:SI 2 \"general_operand\" \"x,K,m\")))]\n \"!TARGET_71BIT\"\n \"@\n rotc %0,(%2)\n rotc %0,%V2\n rotc %0,@%2\")\n\n(define_insn \"*ROTC_left_plus\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r\")\n\t(rotate:DI (match_operand:DI 1 \"register_operand\" \"0\")\n\t\t (plus:SI (match_operand:SI 2 \"register_operand\" \"x\")\n\t\t\t (match_operand:SI 3 \"immediate_operand\" \"K\"))))]\n \"!TARGET_71BIT\"\n \"rotc %0,%V3(%2)\")\n\n(define_expand \"rotrdi3\"\n [(set (match_dup 3) (neg:SI (match_operand:SI 2 \"general_operand\" \"\")))\n (set (match_operand:DI 0 \"register_operand\" \"\")\n\t(rotatert:DI (match_operand:DI 1 \"register_operand\" \"\")\n\t\t (neg:SI (match_dup 3))))]\n \"!TARGET_71BIT\"\n \"operands[3] = gen_reg_rtx (SImode);\")\n\n(define_insn \"*ROTC_right\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r,r,r\")\n\t(rotatert:DI (match_operand:DI 1 \"register_operand\" \"0,0,0\")\n\t\t (neg:SI (match_operand:SI 2 \"general_operand\" \"x,K,m\"))))]\n \"!TARGET_71BIT\"\n \"@\n rotc %0,(%2)\n rotc %0,%V2\n rotc %0,@%2\")\n\n(define_insn \"*ROTC_right_plus\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r\")\n\t(rotatert:DI\n\t (match_operand:DI 1 \"register_operand\" \"0\")\n\t (neg:SI (plus:SI (match_operand:SI 2 \"register_operand\" \"x\")\n\t\t\t (match_operand:SI 3 \"immediate_operand\" \"K\")))))]\n \"!TARGET_71BIT\"\n \"rotc %0,%V3(%2)\")\n\n\f\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Logical Operations\n\n;; SETZ -- in Data Movement\n\n;; AND -- andsi3\n\n(define_insn \"\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(and:SI (subreg:SI (match_operand:QI 1 \"memory_operand\" \"m\") 0)\n\t\t(const_int 63)))]\n \"\"\n \"*return pdp10_output_extzv_foo (insn, operands);\")\n\n(define_insn \"\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(and:SI (match_operand:SI 1 \"memory_operand\" \"m\")\n\t\t(match_operand:SI 2 \"const_int_operand\" \"i\")))]\n \"TARGET_LARGE && CONSTANT_ADDRESS_P (XEXP (operands[1], 0))\n && (INTVAL (operands[2]) == 077 || INTVAL (operands[2]) == 0777)\"\n {\n rtx ops[4];\n int bitsize = exact_log2 (INTVAL (operands[2]) + 1);\n ops[0] = operands[0];\n ops[1] = operands[1];\n ops[2] = GEN_INT (bitsize);\n ops[3] = GEN_INT (BITS_PER_WORD - bitsize);\n output_asm_insn (pdp10_output_extzv (insn, ops), ops);\n return \"\";\n })\n\n(define_expand \"andsi3\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"\")\n (and:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"\")\n (match_operand:SI 2 \"general_operand\" \"\")))]\n \"\"\n \"\")\n\n(define_insn \"*andsi3\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,r,r,r,r,m\")\n (and:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"%0,0,0,0,0,0\")\n (match_operand:SI 2 \"general_operand\" \"rm,I,N,P,i,r\")))]\n \"\"\n \"@\n and %0,%2\n andi %0,%2\n tlz %0,%T2\n andcmi %0,%C2\n and %0,[%2]\n andm %2,%0\")\n\n(define_insn \"*ANDI_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(and:SI (and:SI (match_operand:SI 1 \"register_operand\" \"x\")\n\t\t\t(const_int RIGHT_HALF))\n\t\t(match_operand:SI 2 \"register_operand\" \"0\")))]\n \"\"\n \"andi %0,(%1)\")\n(define_insn \"*ANDI_const_plus_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(and:SI (and:SI (plus:SI (match_operand:SI 1 \"register_operand\" \"x\")\n\t\t\t\t (match_operand:SI 2 \"const_int_operand\" \"I\"))\n\t\t\t(const_int RIGHT_HALF))\n\t\t(match_operand:SI 3 \"register_operand\" \"0\")))]\n \"pdp10_const_ok_for_letter_p (INTVAL (operands[2]), 'I')\"\n \"andi %0,%2(%1)\")\n(define_insn \"*TLZ_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(and:SI (not:SI (ashift:SI (match_operand:SI 1 \"register_operand\" \"x\")\n\t\t\t\t (const_int 18)))\n\t\t(match_operand:SI 2 \"register_operand\" \"0\")))]\n \"\"\n \"tlz %0,(%1)\")\n(define_insn \"*TLZ_const_plus_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(and:SI (not:SI (plus:SI (mult:SI\n\t\t\t\t (match_operand:SI 1 \"register_operand\" \"x\")\n\t\t\t\t (const_int 262144))\n\t\t\t\t (match_operand:SI 2 \"const_int_operand\" \"L\")))\n\t\t(match_operand:SI 3 \"register_operand\" \"0\")))]\n \"pdp10_const_ok_for_letter_p (INTVAL (operands[2]), 'L')\"\n \"tlz %0,%S2(%1)\")\n\n(define_insn \"*ANDB1\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(and:SI (match_dup 0) (match_operand:SI 1 \"register_operand\" \"r\")))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(and:SI (match_dup 0) (match_dup 1)))]\n \"\"\n \"andb %1,%0\")\n(define_insn \"*ANDB2\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(and:SI (match_operand:SI 1 \"register_operand\" \"r\") (match_dup 0)))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(and:SI (match_dup 1) (match_dup 0)))]\n \"\"\n \"andb %1,%0\")\n\n;; ANDCA, ANDCM\n\n(define_insn \"ANDCx\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,r,r,r,m,m\")\n (and:SI\n\t (not:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"0,rm,0,0,r,0\"))\n\t (match_operand:SI 2 \"general_operand\" \"rm,0,I,P,0,r\")))]\n \"\"\n \"@\n andca %0,%2\n andcm %0,%1\n andcai %0,%2\n andcbi %0,%C2\n andcam %1,%0\n andcmm %2,%0\")\n\n(define_insn \"*ANDCMI_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(and:SI (ior:SI (not:SI (match_operand:SI 1 \"register_operand\" \"x\"))\n\t\t\t(const_int LEFT_HALF))\n\t\t(match_operand:SI 2 \"register_operand\" \"0\")))]\n \"\"\n \"andcmi %0,(%1)\")\n(define_insn \"*ANDCMI_const_plus_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(and:SI (ior:SI (not:SI\n\t\t\t (plus:SI\n\t\t\t (match_operand:SI 1 \"register_operand\" \"x\")\n\t\t\t (match_operand:SI 2 \"const_int_operand\" \"I\")))\n\t\t\t(const_int LEFT_HALF))\n\t\t(match_operand:SI 3 \"register_operand\" \"0\")))]\n \"pdp10_const_ok_for_letter_p (INTVAL (operands[2]), 'I')\"\n \"andcmi %0,%2(%1)\")\n\n(define_insn \"*ANDCAB\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(and:SI (not:SI (match_operand:SI 1 \"register_operand\" \"r\"))\n\t\t(match_dup 0)))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(and:SI (not:SI (match_dup 1)) (match_dup 0)))]\n \"\"\n \"andcab %1,%0\")\n\n(define_insn \"*ANDCMB\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(and:SI (not:SI (match_dup 0))\n\t\t(match_operand:SI 1 \"register_operand\" \"r\")))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(and:SI (not:SI (match_dup 0)) (match_dup 1)))]\n \"\"\n \"andcmb %1,%0\")\n; (define_insn \"*ANDCMB\"\n; [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n; \t(and:SI (not:SI (match_operand:SI 1 \"memory_operand\" \"+m\"))\n; \t\t(match_operand:SI 2 \"register_operand\" \"0\")))\n; (set (match_dup 1)\n; \t(and:SI (not:SI (match_dup 1)) (match_dup 2)))]\n; \"\"\n; \"andcmb %0,%1\")\n\n;; SETM -- not useful\n\n;; SETA -- not useful\n\n;; XOR -- xorsi3\n\n(define_insn \"xorsi3\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,r,r,r,r,m\")\n (xor:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"%0,0,0,0,0,0\")\n (match_operand:SI 2 \"general_operand\" \"rm,I,L,P,i,r\")))]\n \"\"\n \"@\n xor %0,%2\n xori %0,%2\n tlc %0,%S2\n eqvi %0,%C2\n xor %0,[%2]\n xorm %2,%0\")\n\n(define_insn \"*XORI_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n (xor:SI (and:SI (match_operand:SI 1 \"register_operand\" \"r\")\n\t\t\t(const_int RIGHT_HALF))\n\t\t(match_operand:SI 2 \"register_operand\" \"0\")))]\n \"\"\n \"xori %0,(%1)\")\n(define_insn \"*XORI_const_plus_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n (xor:SI (and:SI (plus:SI (match_operand:SI 1 \"register_operand\" \"r\")\n\t\t\t\t (match_operand:SI 2 \"const_int_operand\" \"I\"))\n\t\t\t(const_int RIGHT_HALF))\n\t\t(match_operand:SI 3 \"register_operand\" \"0\")))]\n \"pdp10_const_ok_for_letter_p (INTVAL (operands[2]), 'I')\"\n \"xori %0,%2(%1)\")\n(define_insn \"*TLC_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n (xor:SI (ashift:SI (match_operand:SI 1 \"register_operand\" \"r\")\n\t\t\t (const_int 18))\n\t\t(match_operand:SI 2 \"register_operand\" \"0\")))]\n \"\"\n \"tlc %0,(%1)\")\n(define_insn \"*TLC_const_plus_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(xor:SI (plus:SI (mult:SI (match_operand:SI 1 \"register_operand\" \"x\")\n\t\t\t\t (const_int 262144))\n\t\t\t (match_operand:SI 2 \"const_int_operand\" \"L\"))\n\t\t(match_operand:SI 3 \"register_operand\" \"0\")))]\n \"pdp10_const_ok_for_letter_p (INTVAL (operands[2]), 'L')\"\n \"tlc %0,%S2(%1)\")\n\n(define_insn \"*XORB1\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(xor:SI (match_dup 0) (match_operand:SI 1 \"register_operand\" \"r\")))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(xor:SI (match_dup 0) (match_dup 1)))]\n \"\"\n \"xorb %1,%0\")\n(define_insn \"*XORB2\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(xor:SI (match_operand:SI 1 \"register_operand\" \"r\") (match_dup 0)))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(xor:SI (match_dup 1) (match_dup 0)))]\n \"\"\n \"xorb %1,%0\")\n\n(define_insn \"xordisi3\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r\")\n (xor:DI (match_operand:DI 1 \"register_operand\" \"%0\")\n (plus:DI\n\t\t (ashift:DI\n\t\t (zero_extend:DI (match_operand:SI 2 \"register_operand\" \"r\"))\n\t\t (const_int 36))\n\t\t (zero_extend:DI (match_dup 2)))))]\n \"\"\n \"xor %0,%2\\;xor %Z0,%2\")\n\n;; IOR -- iorsi3\n\n(define_insn \"iorsi3\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,r,r,r,r,m\")\n (ior:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"%0,0,0,0,0,0\")\n (match_operand:SI 2 \"general_operand\" \"rm,I,L,P,i,r\")))]\n \"\"\n \"@\n ior %0,%2\n iori %0,%2\n tlo %0,%S2\n orcmi %0,%C2\n ior %0,[%2]\n iorm %2,%0\")\n\n(define_insn \"*IORI_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(ior:SI (and:SI (match_operand:SI 1 \"register_operand\" \"x\")\n\t\t\t(const_int RIGHT_HALF))\n\t\t(match_operand:SI 2 \"register_operand\" \"0\")))]\n \"\"\n \"iori %0,(%1)\")\n(define_insn \"*IORI_const_plus_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(ior:SI (and:SI (plus:SI (match_operand:SI 1 \"register_operand\" \"x\")\n\t\t\t\t (match_operand:SI 2 \"const_int_operand\" \"I\"))\n\t\t\t(const_int RIGHT_HALF))\n\t\t(match_operand:SI 3 \"register_operand\" \"0\")))]\n \"pdp10_const_ok_for_letter_p (INTVAL (operands[2]), 'I')\"\n \"iori %0,%2(%1)\")\n(define_insn \"*TLO_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(ior:SI (ashift:SI (match_operand:SI 1 \"register_operand\" \"x\")\n\t\t\t (const_int 18))\n\t\t(match_operand:SI 2 \"register_operand\" \"0\")))]\n \"\"\n \"tlo %0,(%1)\")\n(define_insn \"*TLO_const_plus_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(ior:SI (plus:SI (mult:SI (match_operand:SI 1 \"register_operand\" \"x\")\n\t\t\t\t (const_int 262144))\n\t\t\t (match_operand:SI 2 \"const_int_operand\" \"L\"))\n\t\t(match_operand:SI 3 \"register_operand\" \"0\")))]\n \"pdp10_const_ok_for_letter_p (INTVAL (operands[2]), 'L')\"\n \"tlo %0,%S2(%1)\")\n\n(define_insn \"*IORB1\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(ior:SI (match_dup 0) (match_operand:SI 1 \"register_operand\" \"r\")))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(ior:SI (match_dup 0) (match_dup 1)))]\n \"\"\n \"iorb %1,%0\")\n(define_insn \"*IORB2\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(ior:SI (match_operand:SI 1 \"register_operand\" \"r\") (match_dup 0)))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(ior:SI (match_dup 1) (match_dup 0)))]\n \"\"\n \"iorb %1,%0\")\n\n;; ANDCB\n\n(define_insn \"*ANCDB\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,m\")\n (and:SI (not:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"%0,0\"))\n (not:SI (match_operand:SI 2 \"reg_or_mem_operand\" \"rm,r\"))))]\n \"\"\n \"@\n andcb %0,%2\n andcbm %2,%0\")\n\n(define_insn \"*ANDCBI_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(and:SI (not:SI (and:SI (match_operand:SI 1 \"register_operand\" \"x\")\n\t\t\t\t(const_int RIGHT_HALF)))\n\t\t(not:SI (match_operand:SI 2 \"register_operand\" \"0\"))))]\n \"\"\n \"andcbi %0,(%1)\")\n(define_insn \"*ANDCBI_const_plus_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(and:SI (not:SI (and:SI\n\t\t\t (plus:SI\n\t\t\t (match_operand:SI 2 \"register_operand\" \"x\")\n\t\t\t (match_operand:SI 3 \"const_int_operand\" \"I\"))\n\t\t\t (const_int RIGHT_HALF)))\n\t\t(not:SI (match_operand:SI 1 \"register_operand\" \"0\"))))]\n \"pdp10_const_ok_for_letter_p (INTVAL (operands[3]), 'I')\"\n \"andcbi %0,%3(%2)\")\n\n(define_insn \"*ANDCBB1\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(and:SI (not:SI (match_dup 0))\n\t\t(not:SI (match_operand:SI 1 \"register_operand\" \"r\"))))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(and:SI (not:SI (match_dup 0)) (not:SI (match_dup 1))))]\n \"\"\n \"andcbb %1,%0\")\n(define_insn \"*ANDCBB2\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(and:SI (not:SI (match_operand:SI 1 \"register_operand\" \"r\"))\n\t\t(not:SI (match_dup 0))))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(and:SI (not:SI (match_dup 1)) (not:SI (match_dup 0))))]\n \"\"\n \"andcbb %1,%0\")\n\n(define_insn \"*ANDCBB\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(and:SI (not:SI (match_operand:SI 1 \"register_operand\" \"%0\"))\n\t\t(not:SI (match_operand:SI 2 \"memory_operand\" \"+m\"))))\n (set (match_dup 2)\n\t(and:SI (not:SI (match_dup 1)) (not:SI (match_dup 2))))]\n \"\"\n \"andcbb %0,%2\")\n\n;; EQV\n\n(define_insn \"*EQV\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,m\")\n\t(not:SI (xor:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"%0,0\")\n\t\t\t(match_operand:SI 2 \"reg_or_mem_operand\" \"rm,r\"))))]\n \"\"\n \"@\n eqv %0,%2\n eqvm %2,%0\")\n\n(define_insn \"*EQVI_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(not:SI (xor:SI (and:SI (match_operand:SI 1 \"register_operand\" \"x\")\n\t\t\t\t(const_int RIGHT_HALF))\n\t\t\t(match_operand:SI 2 \"register_operand\" \"0\"))))]\n \"\"\n \"eqvi %0,(%1)\")\n(define_insn \"*EQVI_const_plus_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(not:SI (xor:SI (and:SI (plus:SI\n\t\t\t\t (match_operand:SI 1 \"register_operand\" \"x\")\n\t\t\t\t (match_operand:SI 2 \"const_int_operand\" \"I\"))\n\t\t\t\t(const_int RIGHT_HALF))\n\t\t\t(match_operand:SI 3 \"register_operand\" \"0\"))))]\n \"pdp10_const_ok_for_letter_p (INTVAL (operands[2]), 'I')\"\n \"eqvi %0,%2(%1)\")\n\n(define_insn \"*EQVB1\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(not:SI (xor:SI (match_dup 0)\n\t\t\t(match_operand:SI 1 \"register_operand\" \"r\"))))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(not:SI (xor:SI (match_dup 0) (match_dup 1))))]\n \"\"\n \"eqvb %1,%0\")\n(define_insn \"*EQVB2\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(not:SI (xor:SI (match_operand:SI 1 \"register_operand\" \"r\")\n\t\t\t(match_dup 0))))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(not:SI (xor:SI (match_dup 1) (match_dup 0))))]\n \"\"\n \"eqvb %1,%0\")\n\n;; SETCA, SETCM -- one_cmplsi2\n\n(define_insn \"one_cmplsi2\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,r,m,m\")\n (not:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"0,rm,r,0\")))]\n \"\"\n \"@\n setca %0,\n setcm %0,%1\n setcam %1,%0\n setcmm %0\")\n\n(define_insn \"*SETCAB\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(not:SI (match_operand:SI 1 \"register_operand\" \"r\")))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(not:SI (match_dup 1)))]\n \"\"\n \"setcab %1,%0\")\n\n(define_insn \"*SETCMB\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(not:SI (match_dup 0)))\n (set (match_operand:SI 1 \"register_operand\" \"=r\")\n\t(not:SI (match_dup 0)))]\n \"\"\n \"setcmb %0,%1\")\n\n;; SETCMI is done with ORCBI.\n\n;; ORCA, ORCM\n\n(define_insn \"*ORCx\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,r,r,r,m,m\")\n (ior:SI\n\t (not:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"0,rm,0,0,r,0\"))\n\t (match_operand:SI 2 \"general_operand\" \"rm,0,I,P,0,r\")))]\n \"\"\n \"@\n orca %0,%2\n orcm %0,%1\n orcai %0,%2\n orcbi %0,%C2\n orcam %1,%0\n orcmm %2,%0\")\n\n(define_insn \"*ORCMI_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n (ior:SI (ior:SI (not:SI (match_operand:SI 1 \"register_operand\" \"x\"))\n\t\t\t(const_int LEFT_HALF))\n\t\t(match_operand:SI 2 \"register_operand\" \"0\")))]\n \"\"\n \"orcmi %0,(%1)\")\n(define_insn \"*ORCMI_const_plus_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n (ior:SI (ior:SI (not:SI (plus:SI\n\t\t\t\t (match_operand:SI 1 \"register_operand\" \"x\")\n\t\t\t\t (match_operand:SI 2 \"const_int_operand\" \"I\")))\n\t\t\t(const_int LEFT_HALF))\n\t\t(match_operand:SI 3 \"register_operand\" \"0\")))]\n \"pdp10_const_ok_for_letter_p (INTVAL (operands[2]), 'I')\"\n \"orcmi %0,%2(%1)\")\n\n(define_insn \"*ORCAB1\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(ior:SI (match_dup 0)\n\t\t(not:SI (match_operand:SI 1 \"register_operand\" \"r\"))))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(ior:SI (match_dup 0) (not:SI (match_dup 1))))]\n \"\"\n \"orcab %1,%0\")\n(define_insn \"*ORCAB2\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(ior:SI (not:SI (match_operand:SI 1 \"register_operand\" \"r\"))\n\t\t(match_dup 0)))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(ior:SI (not:SI (match_dup 1)) (match_dup 0)))]\n \"\"\n \"orcab %1,%0\")\n\n(define_insn \"*ORCMB1\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(ior:SI (not:SI (match_dup 0))\n\t\t(match_operand:SI 1 \"register_operand\" \"r\")))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(ior:SI (not:SI (match_dup 0)) (match_dup 1)))]\n \"\"\n \"orcmb %1,%0\")\n(define_insn \"*ORCMB2\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(ior:SI (match_operand:SI 1 \"register_operand\" \"r\")\n\t\t(not:SI (match_dup 0))))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(ior:SI (match_dup 1) (not:SI (match_dup 0))))]\n \"\"\n \"orcmb %1,%0\")\n\n;; ORCB\n\n(define_insn \"*ORCB\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=r,m\")\n (ior:SI (not:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"%0,0\"))\n (not:SI (match_operand:SI 2 \"reg_or_mem_operand\" \"rm,r\"))))]\n \"\"\n \"@\n orcb %0,%2\n orcbm %2,%0\")\n\n(define_insn \"*ORCBI_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n (ior:SI (not:SI (and:SI (match_operand:SI 1 \"register_operand\" \"x\")\n\t\t\t\t(const_int RIGHT_HALF)))\n\t\t(not:SI (match_operand:SI 2 \"register_operand\" \"0\"))))]\n \"\"\n \"orcbi %0,(%1)\")\n(define_insn \"*ORCBI_const_plus_reg\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n (ior:SI (not:SI (and:SI (plus:SI\n\t\t\t\t (match_operand:SI 1 \"register_operand\" \"x\")\n\t\t\t\t (match_operand:SI 2 \"const_int_operand\" \"I\"))\n\t\t\t\t(const_int RIGHT_HALF)))\n\t\t(not:SI (match_operand:SI 3 \"register_operand\" \"0\"))))]\n \"\"\n \"orcbi %0,%2(%1)\")\n\n(define_insn \"*ORCMB1\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(ior:SI (not:SI (match_dup 0))\n\t\t(not:SI (match_operand:SI 1 \"register_operand\" \"r\"))))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(ior:SI (not:SI (match_dup 0)) (not:SI (match_dup 1))))]\n \"\"\n \"orcbb %1,%0\")\n(define_insn \"*ORCMB2\"\n [(set (match_operand:SI 0 \"memory_operand\" \"+m\")\n\t(ior:SI (not:SI (match_operand:SI 1 \"register_operand\" \"r\"))\n\t\t(not:SI (match_dup 0))))\n (set (match_operand:SI 2 \"register_operand\" \"=1\")\n\t(ior:SI (not:SI (match_dup 1)) (not:SI (match_dup 0))))]\n \"\"\n \"orcbb %1,%0\")\n\n;; SETO -- in Data Movement\n\n\f\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Floating-point Arithmetic\n\n(define_insn \"addsf3\"\n [(set (match_operand:SF 0 \"reg_or_mem_operand\" \"=r,r,r,m\")\n\t(plus:SF (match_operand:SF 1 \"reg_or_mem_operand\" \"%0,0,0,0\")\n\t\t (match_operand:SF 2 \"general_operand\" \"rm,G,F,r\")))]\n \"\"\n \"@\n fadr %0,%2\n fadri %0,%G2\n fadr %0,[%2]\n fadrm %2,%0\")\n\n(define_insn \"*FADRB1\"\n [(set (match_operand:SF 0 \"memory_operand\" \"+m\")\n\t(plus:SF (match_dup 0) (match_operand:SF 1 \"register_operand\" \"r\")))\n (set (match_operand:SF 2 \"register_operand\" \"=1\")\n\t(plus:SF (match_dup 0) (match_dup 1)))]\n \"\"\n \"fadrb %1,%0\")\n(define_insn \"*FADRB2\"\n [(set (match_operand:SF 0 \"memory_operand\" \"+m\")\n\t(plus:SF (match_operand:SF 1 \"register_operand\" \"r\") (match_dup 0)))\n (set (match_operand:SF 2 \"register_operand\" \"=1\")\n\t(plus:SF (match_dup 1) (match_dup 0)))]\n \"\"\n \"fadrb %1,%0\")\n\n(define_expand \"adddf3\"\n [(set (match_operand:DF 0 \"register_operand\" \"\")\n\t(plus:DF (match_operand:DF 1 \"register_operand\" \"\")\n\t\t (match_operand:DF 2 \"general_operand\" \"\")))]\n \"(TARGET_KI10up && !TARGET_GFLOAT) || (TARGET_KL10up && TARGET_GFLOAT)\"\n \"\")\n\n(define_insn \"DFAD\"\n [(set (match_operand:DF 0 \"register_operand\" \"=r,r\")\n\t(plus:DF (match_operand:DF 1 \"register_operand\" \"%0,0\")\n\t\t (match_operand:DF 2 \"general_operand\" \"rm,F\")))]\n \"TARGET_KI10up && !TARGET_GFLOAT\"\n \"@\n dfad %0,%2\n dfad %0,[%2]\")\n\n(define_insn \"*GFAD\"\n [(set (match_operand:DF 0 \"register_operand\" \"=r,r\")\n\t(plus:DF (match_operand:DF 1 \"register_operand\" \"%0,0\")\n\t\t (match_operand:DF 2 \"general_operand\" \"rm,F\")))]\n \"TARGET_KL10up && TARGET_GFLOAT\"\n \"@\n gfad %0,%2\n gfad %0,[%2]\")\n\n(define_insn \"subsf3\"\n [(set (match_operand:SF 0 \"reg_or_mem_operand\" \"=r,r,r,m\")\n\t(minus:SF (match_operand:SF 1 \"register_operand\" \"0,0,0,r\")\n\t\t (match_operand:SF 2 \"general_operand\" \"rm,G,F,0\")))]\n \"\"\n \"@\n fsbr %0,%2\n fsbri %0,%G2\n fsbr %0,[%2]\n fsbrm %1,%0\")\n\n(define_insn \"*FSBRB\"\n [(set (match_operand:SF 0 \"memory_operand\" \"+m\")\n\t(minus:SF (match_operand:SF 1 \"register_operand\" \"r\") (match_dup 0)))\n (set (match_operand:SF 2 \"register_operand\" \"=1\")\n\t(minus:SF (match_dup 1) (match_dup 0)))]\n \"\"\n \"fsbrb %1,%0\")\n\n(define_expand \"subdf3\"\n [(set (match_operand:DF 0 \"register_operand\" \"\")\n\t(minus:DF (match_operand:DF 1 \"register_operand\" \"\")\n\t\t (match_operand:DF 2 \"general_operand\" \"\")))]\n \"TARGET_KI10up\"\n \"\")\n\n(define_insn \"*DFSB\"\n [(set (match_operand:DF 0 \"register_operand\" \"=r,r\")\n\t(minus:DF (match_operand:DF 1 \"register_operand\" \"0,0\")\n\t\t (match_operand:DF 2 \"general_operand\" \"rm,F\")))]\n \"TARGET_KI10up && !TARGET_GFLOAT\"\n \"@\n dfsb %0,%2\n dfsb %0,[%2]\")\n\n(define_insn \"*GFSB\"\n [(set (match_operand:DF 0 \"register_operand\" \"=r,r\")\n\t(minus:DF (match_operand:DF 1 \"register_operand\" \"0,0\")\n\t\t (match_operand:DF 2 \"general_operand\" \"rm,F\")))]\n \"TARGET_KL10up && TARGET_GFLOAT\"\n \"@\n gfsb %0,%2\n gfsb %0,[%2]\")\n\n(define_insn \"abssf2\"\n [(set (match_operand:SF 0 \"reg_or_mem_operand\" \"=r,m,m\")\n\t(abs:SF (match_operand:SF 1 \"reg_or_mem_operand\" \"rm,r,0\")))]\n \"\"\n \"@\n movm %0,%1\n movmm %1,%0\n movms %0\")\n\n(define_insn \"*MOVMSsf\"\n [(set (match_operand:SF 0 \"reg_or_mem_operand\" \"+rm\")\n\t(abs:SF (match_dup 0)))\n (set (match_operand:SF 1 \"register_operand\" \"=x\")\n\t(abs:SF (match_dup 0)))]\n \"\"\n \"movms %1,%0\")\n\n(define_insn \"negsf2\"\n [(set (match_operand:SF 0 \"reg_or_mem_operand\" \"=r,m,m\")\n\t(neg:SF (match_operand:SF 1 \"reg_or_mem_operand\" \"rm,r,0\")))]\n \"\"\n \"@\n movn %0,%1\n movnm %1,%0\n movns %0\")\n\n(define_insn \"*MOVNS\"\n [(set (match_operand:SF 0 \"reg_or_mem_operand\" \"=rm\")\n\t(neg:SF (match_dup 0)))\n (set (match_operand:SF 1 \"register_operand\" \"+x\")\n\t(neg:SF (match_dup 0)))]\n \"\"\n \"movns %1,%0\")\n\n(define_insn \"negdf2\"\n [(set (match_operand:DF 0 \"reg_or_mem_operand\" \"=r,m\")\n\t(neg:DF (match_operand:DF 1 \"reg_or_mem_operand\" \"rm,r\")))]\n \"TARGET_KI10up\"\n \"@\n dmovn %0,%1\n dmovnm %1,%0\")\n\n(define_insn \"mulsf3\"\n [(set (match_operand:SF 0 \"reg_or_mem_operand\" \"=r,r,r,m\")\n\t(mult:SF (match_operand:SF 1 \"reg_or_mem_operand\" \"%0,0,0,0\")\n\t\t (match_operand:SF 2 \"general_operand\" \"rm,G,F,r\")))]\n \"\"\n \"@\n fmpr %0,%2\n fmpri %0,%G2\n fmpr %0,[%2]\n fmprm %2,%0\")\n\n(define_insn \"*FMPRB1\"\n [(set (match_operand:SF 0 \"memory_operand\" \"+m\")\n\t(mult:SF (match_dup 0) (match_operand:SF 1 \"register_operand\" \"r\")))\n (set (match_operand:SF 2 \"register_operand\" \"=1\")\n\t(mult:SF (match_dup 0) (match_dup 1)))]\n \"\"\n \"fmprb %1,%0\")\n(define_insn \"*FMPRB2\"\n [(set (match_operand:SF 0 \"memory_operand\" \"+m\")\n\t(mult:SF (match_operand:SF 1 \"register_operand\" \"r\") (match_dup 0)))\n (set (match_operand:SF 2 \"register_operand\" \"=1\")\n\t(mult:SF (match_dup 1) (match_dup 0)))]\n \"\"\n \"fmprb %1,%0\")\n\n(define_expand \"muldf3\"\n [(set (match_operand:DF 0 \"register_operand\" \"\")\n\t(mult:DF (match_operand:DF 1 \"register_operand\" \"\")\n\t\t (match_operand:DF 2 \"general_operand\" \"\")))]\n \"TARGET_KI10up\"\n \"\")\n\n(define_insn \"*DFMP\"\n [(set (match_operand:DF 0 \"register_operand\" \"=r,r\")\n\t(mult:DF (match_operand:DF 1 \"register_operand\" \"%0,0\")\n\t\t (match_operand:DF 2 \"general_operand\" \"rm,F\")))]\n \"TARGET_KI10up && !TARGET_GFLOAT\"\n \"@\n dfmp %0,%2\n dfmp %0,[%2]\")\n\n(define_insn \"*GFMP\"\n [(set (match_operand:DF 0 \"register_operand\" \"=r,r\")\n\t(mult:DF (match_operand:DF 1 \"register_operand\" \"%0,0\")\n\t\t (match_operand:DF 2 \"general_operand\" \"rm,F\")))]\n \"TARGET_KL10up && TARGET_GFLOAT\"\n \"@\n gfmp %0,%2\n gfmp %0,[%2]\")\n\n(define_insn \"divsf3\"\n [(set (match_operand:SF 0 \"reg_or_mem_operand\" \"=r,r,r,m\")\n\t(div:SF (match_operand:SF 1 \"register_operand\" \"0,0,0,r\")\n\t\t(match_operand:SF 2 \"general_operand\" \"rm,G,F,0\")))]\n \"\"\n \"@\n fdvr %0,%2\n fdvri %0,%G2\n fdvr %0,[%2]\n fdvrm %1,%0\")\n\n(define_insn \"*FDVRB2\"\n [(set (match_operand:SF 0 \"memory_operand\" \"+m\")\n\t(div:SF (match_operand:SF 1 \"register_operand\" \"r\") (match_dup 0)))\n (set (match_operand:SF 2 \"register_operand\" \"=1\")\n\t(div:SF (match_dup 1) (match_dup 0)))]\n \"\"\n \"fdvrb %1,%0\")\n\n(define_expand \"divdf3\"\n [(set (match_operand:DF 0 \"register_operand\" \"\")\n\t(div:DF (match_operand:DF 1 \"register_operand\" \"\")\n\t\t(match_operand:DF 2 \"general_operand\" \"\")))]\n \"TARGET_KI10up\"\n \"\")\n\n(define_insn \"*DFDV\"\n [(set (match_operand:DF 0 \"register_operand\" \"=r,r\")\n\t(div:DF (match_operand:DF 1 \"register_operand\" \"0,0\")\n\t\t(match_operand:DF 2 \"general_operand\" \"rm,F\")))]\n \"TARGET_KI10up && !TARGET_GFLOAT\"\n \"@\n dfdv %0,%2\n dfdv %0,[%2]\")\n\n(define_insn \"*GFDV\"\n [(set (match_operand:DF 0 \"register_operand\" \"=r,r\")\n\t(div:DF (match_operand:DF 1 \"register_operand\" \"0,0\")\n\t\t(match_operand:DF 2 \"general_operand\" \"rm,F\")))]\n \"TARGET_KL10up && TARGET_GFLOAT\"\n \"@\n gfdv %0,%2\n gfdv %0,[%2]\")\n\n(define_insn \"sqrtsf2\"\n [(set (match_operand:SF 0 \"register_operand\" \"=r\")\n\t(sqrt:SF (match_operand:SF 1 \"reg_or_mem_operand\" \"rm\")))]\n \"TARGET_XKL2\"\n \"extend %0,[sqrt %1]\")\n\n(define_expand \"sqrtdf2\"\n [(set (match_operand:DF 0 \"register_operand\" \"\")\n\t(sqrt:DF (match_operand:DF 1 \"reg_or_mem_operand\" \"\")))]\n \"TARGET_XKL2\"\n \"\")\n\n(define_insn \"*DSQRT\"\n [(set (match_operand:DF 0 \"register_operand\" \"=r\")\n\t(sqrt:DF (match_operand:DF 1 \"reg_or_mem_operand\" \"rm\")))]\n \"TARGET_XKL2 && !TARGET_GFLOAT\"\n \"extend %0,[dsqrt %1]\")\n\n(define_insn \"*GSQRT\"\n [(set (match_operand:DF 0 \"register_operand\" \"=r\")\n\t(sqrt:DF (match_operand:DF 1 \"reg_or_mem_operand\" \"rm\")))]\n \"TARGET_XKL2 && TARGET_GFLOAT\"\n \"extend %0,[gsqrt %1]\")\n\n(define_insn \"FSC\"\n [(set (match_operand:SF 0 \"register_operand\" \"=r,r\")\n\t(unspec:SF\n\t [(match_operand:SF 1 \"register_operand\" \"0,0\")\n\t (match_operand:SI 2 \"nonmemory_operand\" \"K,x\")]\n\t UNSPEC_FSC))]\n \"\"\n \"@\n fsc %0,%2\n fsc %0,(%2)\")\n\n(define_expand \"DFSC\"\n [(set (match_operand:DF 0 \"register_operand\" \"=r,r\")\n\t(unspec:DF\n\t [(match_operand:DF 1 \"register_operand\" \"0,0\")\n\t (match_operand:SI 2 \"nonmemory_operand\" \"K,r\")]\n\t UNSPEC_FSC))]\n \"!TARGET_GFLOAT\"\n \"if (!TARGET_XKL2)\n {\n rtx x = gen_rtx_REG (SFmode, REGNO (operands[0]));\n if (!flag_unsafe_math_optimizations)\n\t emit_insn (gen_DFAD (operands[0], operands[1], CONST0_RTX (DFmode)));\n emit_insn (gen_FSC (x, x, operands[2]));\n DONE;\n }\")\n\n(define_insn \"*DFSC\"\n [(set (match_operand:DF 0 \"register_operand\" \"=r,r\")\n\t(unspec:DF\n\t [(match_operand:DF 1 \"register_operand\" \"0,0\")\n\t (match_operand:SI 2 \"nonmemory_operand\" \"K,x\")]\n\t UNSPEC_FSC))]\n \"TARGET_XKL2 && !TARGET_GFLOAT\"\n \"@\n extend %0,[dfsc %2]\n extend %0,[dfsc (%2)]\")\n\n(define_insn \"GFSC\"\n [(set (match_operand:DF 0 \"register_operand\" \"=r,r\")\n\t(unspec:DF\n\t [(match_operand:DF 1 \"register_operand\" \"0,0\")\n\t (match_operand:SI 2 \"nonmemory_operand\" \"K,x\")]\n\t UNSPEC_FSC))]\n \"TARGET_KL10up && TARGET_GFLOAT\"\n \"@\n extend %0,[gfsc %2]\n extend %0,[gfsc (%2)]\")\n\n\f\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Floating-point Conversions\n\n(define_expand \"fix_truncsfsi2\"\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(fix:SI (match_operand:SF 1 \"reg_or_mem_operand\" \"\")))]\n \"\"\n \"if (!TARGET_KI10up)\n {\n rtx temp = gen_reg_rtx (DImode);\n rtx temp0 = gen_rtx_SUBREG (SImode, temp, 0);\n rtx temp1 = gen_rtx_SUBREG (SImode, temp, 4);\n\n /* Sequence taken from KCC. */\n emit_insn (gen_MUL (temp,\n\t\t\t gen_rtx_SUBREG (SImode, operands[1], 0),\n\t\t\t GEN_INT (0400)));\n emit_insn (gen_TSC (temp0, temp0));\n /*emit_insn (gen_ashrsi3 (operands[0], temp1,\n\t\t\t gen_rtx_PLUS (SImode, temp0, GEN_INT (-0243))));*/\n emit_insn\n\t (gen_rtx_SET\n\t (VOIDmode,\n\t operands[0],\n\t gen_rtx_ASHIFTRT\n\t (SImode,\n\t\ttemp0,\n\t\tgen_rtx_NEG\n\t\t (SImode,\n\t\t gen_rtx_PLUS\n\t\t (SImode,\n\t\t temp1,\n\t\t GEN_INT (-0243))))));\n\t\t\t\t\t \n DONE;\n }\")\n\n(define_insn \"*fix_truncsfsi2\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(fix:SI (match_operand:SF 1 \"reg_or_mem_operand\" \"rm\")))]\n \"TARGET_KI10up\"\n \"fix %0,%1\")\n\n; (define_insn \"fix_truncsfdi2\" ...)\n\n(define_expand \"fix_truncdfsi2\"\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(fix:SI (match_operand:DF 1 \"reg_or_mem_operand\" \"\")))]\n \"(TARGET_KL10up && TARGET_GFLOAT) || (TARGET_XKL2 && !TARGET_GFLOAT)\"\n \"\")\n\n(define_insn \"*DFIX\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(fix:SI (match_operand:DF 1 \"reg_or_mem_operand\" \"rm\")))]\n \"TARGET_XKL2 && !TARGET_GFLOAT\"\n \"extend %0,[dfix %1]\")\n\n(define_insn \"*GFIX\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(fix:SI (match_operand:DF 1 \"reg_or_mem_operand\" \"rm\")))]\n \"TARGET_KL10up && TARGET_GFLOAT\"\n \"extend %0,[gfix %1]\")\n\n(define_expand \"fix_truncdfdi2\"\n [(set (match_operand:DI 0 \"register_operand\" \"\")\n\t(fix:DI (match_operand:DF 1 \"reg_or_mem_operand\" \"\")))]\n \"(TARGET_KL10up && TARGET_GFLOAT) || (TARGET_XKL2 && !TARGET_GFLOAT)\"\n \"\")\n\n(define_insn \"*DDFIX\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r\")\n\t(fix:DI (match_operand:DF 1 \"reg_or_mem_operand\" \"rm\")))]\n \"TARGET_XKL2 && !TARGET_GFLOAT\"\n \"extend %0,[ddfix %1]\")\n\n(define_insn \"*GDFIX\"\n [(set (match_operand:DI 0 \"register_operand\" \"=r\")\n\t(fix:DI (match_operand:DF 1 \"reg_or_mem_operand\" \"rm\")))]\n \"TARGET_KL10up && TARGET_GFLOAT\"\n \"extend %0,[gdfix %1]\")\n\n(define_insn \"floatunsqisf2\"\n [(set (match_operand:SF 0 \"register_operand\" \"=r\")\n\t(unsigned_float:SF (match_operand:QI 1 \"register_operand\" \"0\")))]\n \"\"\n \"fsc %0,233\")\n\n(define_insn \"floatunshisf2\"\n [(set (match_operand:SF 0 \"register_operand\" \"=r\")\n\t(unsigned_float:SF (match_operand:HI 1 \"register_operand\" \"0\")))]\n \"\"\n \"fsc %0,233\")\n\n(define_insn \"floatsisf2\"\n [(set (match_operand:SF 0 \"register_operand\" \"=r\")\n\t(float:SF (match_operand:SI 1 \"reg_or_mem_operand\" \"rm\")))]\n \"TARGET_KI10up\"\n \"fltr %0,%1\")\n\n(define_insn \"floatunssisf2\"\n [(set (match_operand:SF 0 \"register_operand\" \"=r\")\n\t(unsigned_float:SF (match_operand:SI 1 \"reg_or_mem_operand\" \"rm\")))]\n \"TARGET_KI10up\"\n {\n if (TARGET_XKL2)\n return \"ufltr %0,%1\";\n else\n /* Sequence taken from KCC. */\n return \"skipge %0,%1\\;%_lsh %0,1\\;fltr %0,%0\\;skipge %@%1\\;%_fsc %0,1\";\n }\n [(set (attr \"length\")\n\t(if_then_else (ne (symbol_ref \"TARGET_XKL2\") (const_int 0))\n\t\t (const_int 1)\n\t\t (const_int 5)))])\n\n; (define_insn \"floatdisf2\" ...)\n\n(define_insn \"floatunsqidf2\"\n [(set (match_operand:DF 0 \"register_operand\" \"=r\")\n\t(unsigned_float:DF (match_operand:QI 1 \"register_operand\" \"0\")))]\n \"!TARGET_GFLOAT\"\n \"fsc %0,233\\;movei %Z0,0\"\n [(set_attr \"length\" \"2\")])\n\n(define_insn \"floatunshidf2\"\n [(set (match_operand:DF 0 \"register_operand\" \"=r\")\n\t(unsigned_float:DF (match_operand:HI 1 \"register_operand\" \"0\")))]\n \"!TARGET_GFLOAT\"\n \"fsc %0,233\\;movei %Z0,0\"\n [(set_attr \"length\" \"2\")])\n\n(define_expand \"floatsidf2\"\n [(set (match_operand:DF 0 \"register_operand\" \"\")\n\t(float:DF (match_operand:SI 1 \"reg_or_mem_operand\" \"\")))]\n \"TARGET_KL10up || (TARGET_KI10 && !TARGET_GFLOAT)\"\n \"if (TARGET_KI10up && !TARGET_XKL2 && !TARGET_GFLOAT)\n {\n rtx temp = gen_rtx_SUBREG (DImode, operands[0], 0);\n rtx temp0 = gen_rtx_SUBREG (SImode, operands[0], 0);\n rtx temp1 = gen_rtx_SUBREG (SImode, operands[0], 4);\n\n /* Sequence taken from KCC. */\n emit_move_insn (temp0, operands[1]);\n emit_move_insn (temp1, const0_rtx);\n emit_insn (gen_ASHC_right (temp, temp, GEN_INT (8)));\n emit_insn (gen_xorsi3 (temp0, temp0,\n\t\t\t GEN_INT ((HOST_WIDE_INT)0243 << 27)));\n if (!flag_unsafe_math_optimizations)\n\t emit_insn (gen_adddf3 (operands[0], operands[0],\n\t\t\t\tCONST0_RTX (DFmode)));\n DONE;\n }\")\n\n(define_insn \"*DFLTR\"\n [(set (match_operand:DF 0 \"register_operand\" \"=r\")\n\t(float:DF (match_operand:SI 1 \"reg_or_mem_operand\" \"rm\")))]\n \"TARGET_XKL2 && !TARGET_GFLOAT\"\n \"extend %0,[dfltr %1]\")\n\n(define_insn \"*GFLTR\"\n [(set (match_operand:DF 0 \"register_operand\" \"=r\")\n\t(float:DF (match_operand:SI 1 \"reg_or_mem_operand\" \"rm\")))]\n \"TARGET_KL10up && TARGET_GFLOAT\"\n \"extend %0,[gfltr %1]\")\n\n(define_expand \"floatunssidf2\"\n [(set (match_operand:DF 0 \"register_operand\" \"\")\n\t(unsigned_float:DF (match_operand:SI 1 \"reg_or_mem_operand\" \"\")))]\n \"\"\n \"if (!TARGET_XKL2)\n {\n rtx temp = gen_rtx_SUBREG (DImode, operands[0], 0);\n rtx temp0 = gen_rtx_SUBREG (SImode, operands[0], 0);\n rtx temp1 = gen_rtx_SUBREG (SImode, operands[0], 4);\n\n /* Sequence taken from KCC. */\n emit_move_insn (temp0, operands[1]);\n emit_move_insn (temp1, const0_rtx);\n emit_insn (gen_lshrdi3 (temp, temp, GEN_INT (9)));\n emit_insn (gen_lshrsi3 (temp1, temp1, GEN_INT (1)));\n emit_insn (gen_xorsi3 (temp0, temp0,\n\t\t\t TARGET_GFLOAT\n\t\t\t ? GEN_INT ((HOST_WIDE_INT)02743 << 24)\n\t\t\t : GEN_INT ((HOST_WIDE_INT)0243 << 27)));\n if (!flag_unsafe_math_optimizations)\n\t emit_insn (gen_adddf3 (operands[0], operands[0],\n\t\t\t\tCONST0_RTX (DFmode)));\n DONE;\n }\")\n\n(define_insn \"*UDFLTR\"\n [(set (match_operand:DF 0 \"register_operand\" \"=r\")\n\t(unsigned_float:DF (match_operand:SI 1 \"reg_or_mem_operand\" \"rm\")))]\n \"TARGET_XKL2 && !TARGET_GFLOAT\"\n \"extend %0,[udfltr %1]\")\n\n(define_insn \"*UGFLTR\"\n [(set (match_operand:DF 0 \"register_operand\" \"=r\")\n\t(unsigned_float:DF (match_operand:SI 1 \"reg_or_mem_operand\" \"rm\")))]\n \"TARGET_XKL2 && TARGET_GFLOAT\"\n \"extend %0,[ugfltr %1]\")\n\n(define_expand \"floatdidf2\"\n [(set (match_operand:DF 0 \"register_operand\" \"\")\n\t(float:DF (match_operand:DI 1 \"reg_or_mem_operand\" \"\")))]\n \"(TARGET_KL10up && TARGET_GFLOAT) || (TARGET_XKL2 && !TARGET_GFLOAT)\"\n \"\")\n\n(define_insn \"*DDFLTR\"\n [(set (match_operand:DF 0 \"register_operand\" \"=r\")\n\t(float:DF (match_operand:DI 1 \"reg_or_mem_operand\" \"rm\")))]\n \"TARGET_XKL2 && !TARGET_GFLOAT\"\n \"extend %0,[ddfltr %1]\")\n\n(define_insn \"*DGFLTR\"\n [(set (match_operand:DF 0 \"register_operand\" \"=r\")\n\t(float:DF (match_operand:DI 1 \"reg_or_mem_operand\" \"rm\")))]\n \"TARGET_KL10up && TARGET_GFLOAT\"\n \"extend %0,[dgfltr %1]\")\n\n(define_expand \"extendsfdf2\"\n [(set (match_operand:DF 0 \"reg_or_mem_operand\" \"\")\n\t(float_extend:DF (match_operand:SF 1 \"reg_or_mem_operand\" \"\")))]\n \"!TARGET_GFLOAT || TARGET_KL10up\"\n \"\")\n\n;; Extend to D-float by moving the high-order word (if necessary) and\n;; zeroing the low-order word.\n(define_insn \"*extendsfdf2\"\n [(set (match_operand:DF 0 \"reg_or_mem_operand\" \"=r,o,r,o\")\n\t(float_extend:DF\n\t (match_operand:SF 1 \"reg_or_mem_operand\" \"0,0,rm,r\")))]\n \"!TARGET_GFLOAT\"\n \"@\n movei %Z0,0%; extendsfdf2\n setzm %Z0%; extendsfdf2\n move %0,%1%; extendsfdf2\\;movei %Z0,0%; extendsfdf2\n movem %1,%0%; extendsfdf2\\;setzm %Z0%; extendsfdf2\"\n [(set (attr \"length\")\n\t(if_then_else (eq_attr \"alternative\" \"0,1\")\n\t\t (const_int 1)\n\t\t (const_int 2)))])\n\n(define_insn \"*GSNGL\"\n [(set (match_operand:DF 0 \"register_operand\" \"=r\")\n\t(float_extend:DF (match_operand:SF 1 \"reg_or_mem_operand\" \"rm\")))]\n \"TARGET_KL10up && TARGET_GFLOAT\"\n \"extend %0,[gsngl %1]\")\n\n(define_expand \"truncdfsf2\"\n [(set (match_operand:SF 0 \"reg_or_mem_operand\" \"\")\n\t(float_truncate:SF (match_operand:DF 1 \"reg_or_mem_operand\" \"\")))]\n \"!TARGET_GFLOAT || TARGET_KL10up\"\n \"\")\n\n;; Truncate from D-float by just dropping the low-order word.\n;; FIXME: this is not good enough, rounding needed. Or is it??\n(define_insn \"*truncdfsf2\"\n [(set (match_operand:SF 0 \"reg_or_mem_operand\" \"=r,m,r,m\")\n\t(float_truncate:SF\n\t (match_operand:DF 1 \"reg_or_mem_operand\" \"0,0,rm,r\")))]\n \"!TARGET_GFLOAT\"\n \"@\n \\\\t%; truncdfsf2\n \\\\t%; truncdfsf2\n move %0,%1%; truncdfsf2\n movem %1,%0%; truncdfsf2\"\n [(set (attr \"length\")\n\t(if_then_else (eq_attr \"alternative\" \"0,1\") \n\t\t (const_int 0)\n\t\t (const_int 1)))])\n\n(define_insn \"*GDBLE\"\n [(set (match_operand:SF 0 \"register_operand\" \"=r\")\n\t(float_truncate:SF (match_operand:DF 1 \"reg_or_mem_operand\" \"rm\")))]\n \"TARGET_KL10up && TARGET_GFLOAT\"\n \"extend %0,[gdble %1]\")\n\n\f\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Pointer Arithmetic\n\n(define_insn \"*ADJBP_0\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=rm,r,m\")\n\t(unspec:SI\n\t [(match_operand:SI 1 \"reg_or_mem_operand\" \"0,rm,r\")\n\t (const_int 0)]\n\t UNSPEC_ADJBP))]\n \"\"\n \"@\n %; nothing\n move %0,%1\n movem %1,%0\"\n [(set_attr \"length\" \"0,1,1\")])\n\n(define_insn \"IBP\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=rm\")\n\t(unspec:SI\n\t [(match_operand:SI 1 \"reg_or_mem_operand\" \"0\")\n\t (const_int 1)]\n\t UNSPEC_ADJBP))]\n \"!TARGET_KL10up\"\n \"ibp %0\"\n [(set_attr \"reorg_type\" \"ibp\")])\n\n(define_insn \"ADJBP\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=rm,x,x\")\n\t(unspec:SI\n\t [(match_operand:SI 1 \"general_operand\" \"0,rm,i\")\n\t (match_operand:SI 2 \"general_operand\" \"Q,0,0\")]\n\t UNSPEC_ADJBP))]\n \"TARGET_KL10up\"\n \"@\n ibp %0\n adjbp %0,%1\n adjbp %0,[%1]\"\n [(set_attr \"reorg_type\" \"ibp,none,none\")])\n\n(define_insn \"MOVEI\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(unspec:SI [(match_operand:SI 1 \"address_operand\" \"p\")]\n\t\t UNSPEC_ADDRESS))]\n \"\"\n {\n if (TARGET_EXTENDED)\n {\n\t/* ADDRESS: ... */\n if (GET_CODE (operands[1]) == CONST_INT\n\t && !pdp10_const_ok_for_letter_p (INTVAL (operands[1]), 'I'))\n\t return \"move %0,[%1]\";\n\telse\n return \"xmovei %0,%a1\";\n }\n else\n return \"movei %0,%a1\";\n })\n\n(define_insn \"MOVSI\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r,r\")\n\t(ashift:SI (unspec:SI [(match_operand:SI 1 \"address_operand\" \"r,p\")]\n\t\t\t UNSPEC_ADDRESS)\n\t\t (const_int 18)))]\n \"\"\n \"@\n movs %0,%1\n movsi %0,%a1\")\n\n(define_insn \"HRRI\"\n [(set (zero_extract:SI (match_operand:SI 0 \"register_operand\" \"+r,r\")\n\t\t\t (const_int 18)\n\t\t\t (const_int 18))\n\t(unspec:SI [(match_operand:SI 1 \"address_operand\" \"r,p\")]\n\t\t UNSPEC_ADDRESS))]\n \"\"\n \"@\n hrr %0,%1\n hrri %0,%a1\")\n\n(define_insn \"HRLI\"\n [(set (zero_extract:SI (match_operand:SI 0 \"register_operand\" \"+r,r\")\n\t\t\t (const_int 18)\n\t\t\t (const_int 0))\n\t(unspec:SI [(match_operand:SI 1 \"address_operand\" \"r,p\")]\n\t\t UNSPEC_ADDRESS))]\n \"\"\n \"@\n hrl %0,%1\n hrli %0,%a1\")\n\n(define_insn \"ADDI\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r,r,r,r\")\n\t(unspec:SI [(plus:SI (match_operand:SI 1 \"register_operand\" \"0,0,0,0\")\n\t\t\t (match_operand:SI 2 \"address_operand\" \"r,I,i,p\"))]\n\t\t UNSPEC_ADDRESS))]\n \"\"\n \"@\n add %0,%2\n addi %0,%2\n add %0,[%2]\n addi %0,%a2\")\n\n(define_insn \"ashrsi3_pointer\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(unspec:SI [(match_operand:SI 1 \"register_operand\" \"0\")\n\t\t (match_operand:SI 2 \"immediate_operand\" \"K\")]\n\t\t UNSPEC_SHIFTRT))]\n \"\"\n \"ash %0,%N2%; ashrsi3_pointer\")\n\n(define_insn \"ashlsi3_pointer\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(unspec:SI [(match_operand:SI 1 \"register_operand\" \"0\")\n\t\t (match_operand:SI 2 \"immediate_operand\" \"K\")]\n\t\t UNSPEC_SHIFT))]\n \"\"\n \"ash %0,%2%; ashlsi3_pointer\")\n\n(define_insn \"SUBBP\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(unspec:SI [(match_operand:SI 1 \"register_operand\" \"0\")\n\t\t (match_operand:SI 2 \"reg_or_mem_operand\" \"rm\")]\n\t\t UNSPEC_SUBBP))]\n \"TARGET_XKL2\"\n \"extend %0,[subbp %2]\")\n\n\f\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Unconditional Jumps\n\n(define_insn \"nop\"\n [(const_int 0)]\n \"\"\n ;; TODO: this is the traditional NOP instruction. On KL10, TRN is\n ;; faster.\n \"jfcl%; nop\")\n\n(define_insn \"jump\"\n [(set (pc)\n\t(label_ref (match_operand 0 \"\" \"\")))]\n \"\"\n {\n return pdp10_output_jrst (operands[0]);\n })\n\n(define_expand \"indirect_jump\"\n [(set (pc)\n\t(match_operand:SI 0 \"general_operand\" \"\"))]\n \"\"\n \"/* Strip off any byte pointer fields, leaving only the word address.\n TODO: do this earlier, before conversion to 'void *'? */\n if (GET_CODE (operands[0]) == CONST_INT)\n {\n HOST_WIDE_INT address = INTVAL (operands[0]);\n address &= TARGET_EXTENDED ? 07777777777 : 0777777;\n operands[0] = GEN_INT (address);\n }\n else if (GET_CODE (operands[0]) == CONST\n\t && GET_CODE (XEXP (operands[0], 0)) == PLUS\n\t && GET_CODE (XEXP (XEXP (operands[0], 0), 0)) == SYMBOL_REF\n\t && GET_CODE (XEXP (XEXP (operands[0], 0), 1)) == CONST_INT)\n {\n HOST_WIDE_INT offset = INTVAL (XEXP (XEXP (operands[0], 0), 1));\n offset &= TARGET_EXTENDED ? 07777777777 : 0777777;\n operands[0] = plus_constant (XEXP (XEXP (operands[0], 0), 0), offset);\n }\")\n\n(define_insn \"*indirect_jump\"\n [(set (pc)\n\t;; ADDRESS: the S constraint allows a symbol.\n\t(match_operand:SI 0 \"general_operand\" \"x,IS,i,rm\"))]\n \"\"\n \"@\n jrst (%0)\n jrst %0\n jrst @[%0]\n jrst @%0\")\n\n(define_expand \"call\"\n [(call (match_operand 0 \"memory_operand\" \"\")\n\t (match_operand 1 \"general_operand\" \"\"))]\n \"\"\n \"\")\n\n(define_insn \"*call_reg\"\n [(call (mem:SI (match_operand:SI 0 \"register_operand\" \"x\"))\n (match_operand 1 \"\" \"g\"))]\n \"\"\n {\n if (pdp10_output_call_as_jrst_p (insn))\n return \"jrst (%0)\";\n else\n return \"pushj 17,(%0)\";\n })\n\n(define_insn \"*call_mem2\"\n [(call (mem:SI (match_operand 0 \"immediate_operand\" \"i\"))\n\t (match_operand 1 \"general_operand\" \"g\"))]\n \"GET_CODE (operands[0]) != SYMBOL_REF\"\n {\n if (pdp10_output_call_as_jrst_p (insn))\n return \"jrst %a0\";\n else\n return \"pushj 17,%a0\";\n })\n\n(define_insn \"*call_symbol\"\n [(call (mem:SI (match_operand:SI 0 \"\" \"X\"))\n\t (match_operand:SI 1 \"general_operand\" \"g\"))]\n \"GET_CODE (operands[0]) == SYMBOL_REF\"\n {\n if (pdp10_output_call_as_jrst_p (insn))\n return \"jrst %L0\";\n else\n return \"pushj 17,%L0\";\n })\n\n(define_insn \"*call_mem1\"\n [(call (match_operand:SI 0 \"memory_operand\" \"m\")\n\t (match_operand:SI 1 \"general_operand\" \"g\"))]\n \"\"\n {\n if (pdp10_output_call_as_jrst_p (insn))\n return \"jrst @%0\";\n else\n return \"pushj 17,@%0\";\n })\n\n(define_expand \"call_value\"\n [(set (match_operand 0 \"\" \"\")\n\t(call (match_operand 1 \"memory_operand\" \"\")\n\t (match_operand 2 \"general_operand\" \"\")))]\n \"\"\n \"\")\n\n(define_insn \"*call_value_reg\"\n [(set (match_operand 0 \"\" \"=r\")\n (call (mem:SI (match_operand:SI 1 \"register_operand\" \"x\"))\n\t (match_operand:SI 2 \"general_operand\" \"g\")))]\n \"\"\n {\n if (pdp10_output_call_as_jrst_p (insn))\n return \"jrst (%1)\";\n else\n return \"pushj 17,(%1)\";\n })\n\n(define_insn \"*call_value_mem1\"\n [(set (match_operand 0 \"\" \"=r\")\n\t(call (mem:SI (match_operand 1 \"memory_operand\" \"o\"))\n\t (match_operand 2 \"general_operand\" \"g\")))]\n \"CONSTANT_ADDRESS_P (XEXP (operands[1], 0))\"\n {\n if (pdp10_output_call_as_jrst_p (insn))\n return \"jrst @%1\";\n else\n return \"pushj 17,@%1\";\n })\n\n(define_insn \"*call_value_mem2\"\n [(set (match_operand 0 \"register_operand\" \"=r\")\n\t(call (mem:SI (match_operand 1 \"immediate_operand\" \"i\"))\n\t (match_operand 2 \"general_operand\" \"g\")))]\n \"GET_CODE (operands[1]) != SYMBOL_REF\"\n {\n if (pdp10_output_call_as_jrst_p (insn))\n return \"jrst %a1\";\n else\n return \"pushj 17,%a1\";\n })\n\n(define_insn \"*call_value_symbol\"\n [(set (match_operand 0 \"register_operand\" \"=r\")\n\t(call (mem:SI (match_operand:SI 1 \"\" \"X\"))\n\t (match_operand:SI 2 \"general_operand\" \"g\")))]\n \"GET_CODE (operands[1]) == SYMBOL_REF\"\n {\n if (pdp10_output_call_as_jrst_p (insn))\n return \"jrst %L1\";\n else if (pdp10_output_call_as_jsp_p (operands[1]))\n return \"jsp ?,%L1\";\n else\n return \"pushj 17,%L1\";\n })\n\n(define_insn \"*call_value_mem3\"\n [(set (match_operand 0 \"register_operand\" \"=r\")\n;\t(call (mem:SI (match_operand:SI 1 \"address_operand\" \"a\"))\n\t(call (match_operand:SI 1 \"memory_operand\" \"m\")\n\t (match_operand:SI 2 \"general_operand\" \"g\")))]\n \"\"\n {\n/* operands[1] = gen_rtx_MEM (SImode, operands[1]);*/\n if (pdp10_output_call_as_jrst_p (insn))\n return \"jrst %1\";\n else\n return \"pushj 17,%1\";\n })\n\n; (define_expand \"sibcall\" ...)\n\n; (define_expand \"sibcall_value\" ...)\n\n(define_expand \"untyped_call\"\n [(parallel [(call (match_operand 0 \"\" \"\")\n\t\t (const_int 0))\n\t (match_operand 1 \"\" \"\")\n\t (match_operand 2 \"\" \"\")])]\n \"\"\n \"{\n int i;\n\n emit_call_insn (gen_call (operands[0], const0_rtx));\n\n for (i = 0; i < XVECLEN (operands[2], 0); i++)\n {\n\t rtx set = XVECEXP (operands[2], 0, i);\n\t emit_move_insn (SET_DEST (set), SET_SRC (set));\n }\n\n /* The optimizer doesn't know that the call sets the function value\n\tregisters we stored in the result block. We avoid problems by\n\tclaiming that all hard registers are used and clobbered at this\n\tpoint. */\n emit_insn (gen_blockage ());\n \n DONE;\n }\")\n\n(define_insn \"*PUSHJ\"\n [(parallel\n [(call (match_operand:SI 0 \"memory_operand\" \"m\")\n\t (match_operand:SI 1 \"\" \"\"))\n (use (match_operand:SI 2 \"register_operand\" \"+r\"))])]\n \"\"\n \"pushj %2,%0\")\n\n; (define_insn \"trap\"\n; [(trap_if (const_int 1) (const_int 0))]\n; \"\"\n; \"%; trap\")\n\n(define_expand \"casesi\"\n [(set (match_dup 5)\n\t(minus:SI (match_operand:SI 0 \"register_operand\" \"\")\n\t\t (match_operand:SI 1 \"general_operand\" \"\")))\n (set (pc)\n (if_then_else (lt (match_dup 5) (const_int 0))\n\t\t (label_ref (match_operand 4 \"\" \"\"))\n\t\t (pc)))\n (set (pc)\n (if_then_else (gt (match_dup 5)\n\t\t\t (match_operand:SI 2 \"general_operand\" \"\"))\n\t\t (label_ref (match_dup 4))\n\t\t (pc)))\n;;; This is too general. The jump table label will always be local.\n;;; Unless the table is in .rodata located in another section.\n; (set (match_dup 6)\n;\t(plus:SI (match_dup 5) (label_ref (match_operand 3 \"\" \"\"))))\n; (parallel [(set (pc) (if_then_else (const_int 1)\n;\t\t\t\t (mem:SI (match_dup 6))\n;\t\t\t\t (label_ref (match_dup 4))))\n;\t (use (label_ref (match_dup 3)))])]\n (parallel [(set (pc)\n\t\t (if_then_else\n\t\t (const_int 1)\n\t\t (mem:SI (plus:SI (match_dup 5)\n\t\t\t\t (label_ref (match_operand 3 \"\" \"\"))))\n\t\t (label_ref (match_dup 4))))\n\t (use (label_ref (match_dup 3)))])]\n \"\"\n \"operands[5] = gen_reg_rtx (SImode);\n /*operands[6] = gen_reg_rtx (SImode);*/\")\n\n;; This is the bare minimum of how an acceptable casesi dispatch\n;; instruction must look like.\n(define_insn \"\"\n [(parallel [(set (pc)\n\t\t (if_then_else (const_int 1)\n\t\t\t\t (match_operand:SI 0 \"address_operand\" \"p\")\n\t\t\t\t (label_ref (match_operand 1 \"\" \"\"))))\n\t (use (label_ref (match_operand 2 \"\" \"\")))])]\n \"\"\n \"jrst %a0\")\n\n\f\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Conditional Jumps\n\n(define_expand \"cmpsi\"\n [(set (cc0) (compare (match_operand:SI 0 \"register_operand\" \"\")\n (match_operand:SI 1 \"general_operand\" \"\")))]\n \"\"\n \"pdp10_compare_op0 = operands[0];\n pdp10_compare_op1 = operands[1];\n DONE;\")\n\n;; (define_expand \"cmpdi\"\n;; [(set (cc0) (compare (match_operand:DI 0 \"register_operand\" \"\")\n;; (match_operand:DI 1 \"general_operand\" \"\")))]\n;; \"\"\n;; \"pdp10_compare_op0 = operands[0];\n;; pdp10_compare_op1 = operands[1];\n;; DONE;\")\n\n(define_expand \"cmpsf\"\n [(set (cc0) (compare (match_operand:SF 0 \"register_operand\" \"\")\n (match_operand:SF 1 \"general_operand\" \"\")))]\n \"\"\n \"pdp10_compare_op0 = operands[0];\n pdp10_compare_op1 = operands[1];\n DONE;\")\n\n;; KCC generates this for double x, y:\n;; x == y:\n;;\tCAMN x+1,y+1\t\t\n;;\t CAME x,y\n;;\t ;here if false\n;; x < y:\t\t\txy\n;;\tCAML x,y\t\t?\tfalse\tfalse\n;;\t CAMGE x+1,y+1\t\tfalse\ttrue\t?\n;;\t CAMLE x,y\t\ttrue\t\tfalse\n;;\t ;here if false\tno\tyes\tyes\n;; x <= y:\n;;\tCAML x,y\t\t?\tfalse\tfalse\n;;\t CAMG x+1,y+1\t\tfalse\tfalse\t?\n;;\t CAMLE x,y\t\ttrue\ttrue\tfalse\n;;\t ;here if false\tno\tno\tyes\n;; These may also work for long long after adaptions.\n\n;; To compare a double against zero:\n;; x < 0:\n;;\tJUMPL x,label\n;;\t;here if false\n;; x >= 0:\n;;\tJUMPGE x,label\n;;\t;here if false\n;; x <= 0:\t\t\tx<0\tx==0\tx>0\n;;\tJUMPL x,label\t\ttrue\tfalse\tfalse\n;;\t SKIPN x\t\t\tfalse\n;;\t JUMPE x+1,label\t\ttrue\n;;\t ;here if false\n;; x > 0:\n;;\tJUMPG x,label\t\tfalse\tfalse\tmaybe\n;;\t SKIPL x\t\ttrue\tfalse\tfalse\n;;\t JUMPG x+1,label\t\tfalse\ttrue\n;;\t ;here if false\n\n(define_expand \"cmpdf\"\n [(set (cc0) (compare (match_operand:DF 0 \"register_operand\" \"\")\n (match_operand:DF 1 \"general_operand\" \"\")))]\n \"\"\n \"if (pdp10_const_double_0_operand (operands[1], DFmode))\n pdp10_compare_op0 = operands[0];\n else\n {\n pdp10_compare_op0 = gen_reg_rtx (DFmode);\n gen_subdf3 (pdp10_compare_op0, operands[0], operands[1]);\n }\n pdp10_compare_op1 = CONST0_RTX (DFmode);\n DONE;\")\n\n(define_insn \"test_and_skip\"\n [(set (pc)\n\t(if_then_else\n\t (match_operator 0 \"pdp10_equality_operator\"\n\t [(and:SI (match_operand:SI 1 \"register_operand\" \"r\")\n\t\t (match_operand:SI 2 \"general_operand\" \"g\"))\n\t (const_int 0)])\n\t (label_ref (match_operand 3 \"\" \"\"))\n\t (pc)))]\n \"\"\n \"*pdp10_remove_unnecessary_label (insn, operands[3]);\n return pdp10_output_test_and_skip (insn, operands);\"\n [(set (attr \"length\")\n\t(if_then_else (eq (minus (match_dup 3) (pc)) (const_int 1))\n\t\t (const_int 1)\n\t\t (const_int 2)))\n (set_attr \"skip\" \"yes\")])\n\n;; Equality comparisons of a contigous group of bits with zero will be\n;; written using zero_extract rather than the equivalent AND operations.\n(define_insn \"test_extract_skip\"\n [(set (pc)\n\t(if_then_else\n\t (match_operator 0 \"pdp10_equality_operator\"\n\t [(zero_extract:SI\n\t (match_operand:SI 1 \"register_operand\" \"r\")\n\t (match_operand:SI 2 \"const_int_operand\" \"\")\n\t (match_operand:SI 3 \"const_int_operand\" \"\"))\n\t (const_int 0)])\n\t (label_ref (match_operand 4 \"\" \"\"))\n\t (pc)))]\n \"\"\n {\n int len = INTVAL (operands[2]), pos = INTVAL (operands[3]);\n HOST_WIDE_INT mask = (((HOST_WIDE_INT)1 << len) - 1) << (36 - pos - len);\n /* Must assign operands[2] and operands[3], since\n pdp10_output_test_and_skip use those to output the\n instruction. */\n operands[2] = gen_int_mode (mask, SImode);\n operands[3] = operands[4];\n pdp10_remove_unnecessary_label (insn, operands[3]);\n return pdp10_output_test_and_skip (insn, operands);\n }\n [(set (attr \"length\")\n\t(if_then_else (eq (minus (match_dup 4) (pc)) (const_int 1))\n\t\t (const_int 1)\n\t\t (const_int 2)))\n (set_attr \"skip\" \"yes\")])\n\n(define_insn \"TLZN\"\n [(set (pc)\n\t(if_then_else\n\t (ne (and:SI (match_operand:SI 0 \"register_operand\" \"+r\")\n\t\t (match_operand:SI 1 \"const_int_operand\" \"\"))\n\t (const_int 0))\n\t (label_ref (match_operand 2 \"\" \"\"))\n\t (pc)))\n (set (match_dup 0) (and:SI (match_dup 0) (not:SI (match_dup 1))))]\n \"\"\n {\n pdp10_remove_unnecessary_label (insn, operands[2]);\n if (get_attr_length (insn) == 1)\n return \"tlzn %0,%1\";\n else\n return \"tlze %0,%1\\;jrst %2\";\n }\n [(set (attr \"length\")\n\t(if_then_else (eq (minus (match_dup 2) (pc)) (const_int 1))\n\t\t (const_int 1)\n\t\t (const_int 2)))\n (set_attr \"skip\" \"yes\")])\n\n(define_insn \"TLNE_TLZA_TLO\"\n [(set (match_operand:SI 0 \"register_operand\" \"+r\")\n\t(unspec:SI [(match_dup 0)\n\t\t (match_operand:SI 1 \"const_int_operand\" \"\")\n\t\t (match_operand:SI 2 \"const_int_operand\" \"\")\n\t\t (match_operand:SI 3 \"const_int_operand\" \"\")]\n\t\t UNSPEC_TLNE_TLZA_TLO))]\n \"\"\n \"tlne %0,%1\\;%_tlza %0,%2\\;%_%_tlo %0,%3\"\n [(set_attr \"length\" \"3\")])\n\n(define_expand \"bne\"\n [(set (pc)\n\t(if_then_else (ne (match_dup 1) (match_dup 2))\n\t\t (label_ref (match_operand 0 \"\" \"\"))\n\t\t (pc)))]\n \"\"\n \"if (pdp10_generate_cbranchdi (NE, pdp10_compare_op0, pdp10_compare_op1))\n DONE;\n operands[1] = pdp10_compare_op0;\n operands[2] = pdp10_compare_op1;\")\n\n(define_expand \"beq\"\n [(set (pc)\n\t(if_then_else (eq (match_dup 1) (match_dup 2))\n\t\t (label_ref (match_operand 0 \"\" \"\"))\n\t\t (pc)))]\n \"\"\n \"operands[1] = pdp10_compare_op0;\n operands[2] = pdp10_compare_op1;\")\n\n(define_expand \"bge\"\n [(set (pc)\n\t(if_then_else (ge (match_dup 1) (match_dup 2))\n\t\t (label_ref (match_operand 0 \"\" \"\"))\n\t\t (pc)))]\n \"\"\n \"operands[1] = pdp10_compare_op0;\n operands[2] = pdp10_compare_op1;\")\n\n(define_expand \"bgt\"\n [(set (pc)\n\t(if_then_else (gt (match_dup 1) (match_dup 2))\n\t\t (label_ref (match_operand 0 \"\" \"\"))\n\t\t (pc)))]\n \"\"\n \"operands[1] = pdp10_compare_op0;\n operands[2] = pdp10_compare_op1;\")\n\n(define_expand \"ble\"\n [(set (pc)\n\t(if_then_else (le (match_dup 1) (match_dup 2))\n\t\t (label_ref (match_operand 0 \"\" \"\"))\n\t\t (pc)))]\n \"\"\n \"operands[1] = pdp10_compare_op0;\n operands[2] = pdp10_compare_op1;\")\n\n(define_expand \"blt\"\n [(set (pc)\n\t(if_then_else (lt (match_dup 1) (match_dup 2))\n\t\t (label_ref (match_operand 0 \"\" \"\"))\n\t\t (pc)))]\n \"\"\n \"operands[1] = pdp10_compare_op0;\n operands[2] = pdp10_compare_op1;\")\n\n(define_expand \"bgeu\"\n [(set (pc)\n\t(if_then_else (ge (match_dup 1) (match_dup 2))\n\t\t (label_ref (match_operand 0 \"\" \"\"))\n\t\t (pc)))]\n \"\"\n \"operands[1] = pdp10_flip_sign_bit (pdp10_compare_op0);\n operands[2] = pdp10_flip_sign_bit (pdp10_compare_op1);\")\n\n(define_expand \"bgtu\"\n [(set (pc)\n\t(if_then_else (gt (match_dup 1) (match_dup 2))\n\t\t (label_ref (match_operand 0 \"\" \"\"))\n\t\t (pc)))]\n \"\"\n \"operands[1] = pdp10_flip_sign_bit (pdp10_compare_op0);\n operands[2] = pdp10_flip_sign_bit (pdp10_compare_op1);\")\n\n(define_expand \"bleu\"\n [(set (pc)\n\t(if_then_else (le (match_dup 1) (match_dup 2))\n\t\t (label_ref (match_operand 0 \"\" \"\"))\n\t\t (pc)))]\n \"\"\n \"operands[1] = pdp10_flip_sign_bit (pdp10_compare_op0);\n operands[2] = pdp10_flip_sign_bit (pdp10_compare_op1);\")\n\n(define_expand \"bltu\"\n [(set (pc)\n\t(if_then_else (lt (match_dup 1) (match_dup 2))\n\t\t (label_ref (match_operand 0 \"\" \"\"))\n\t\t (pc)))]\n \"\"\n \"operands[1] = pdp10_flip_sign_bit (pdp10_compare_op0);\n operands[2] = pdp10_flip_sign_bit (pdp10_compare_op1);\")\n\n; (define_insn \"cbranchsi4\" ...)\n\n(define_insn \"cbranchsi\"\n [(set (pc)\n\t(if_then_else (match_operator 3 \"comparison_operator\"\n\t\t [(match_operand:SI 1 \"reg_or_mem_operand\" \"r,m,r,r,r\")\n\t\t ;; ADDRESS: an S constraint for the cai case\n\t\t ;; (alternative 2) would allow a symbol.\n\t\t (match_operand:SI 2 \"general_operand\" \"O,O,I,i,rm\")])\n\t\t (label_ref (match_operand 0 \"\" \"\"))\n\t\t (pc)))]\n \"\"\n {\n static const char *asms[] =\n { \"jump%3 %1,%F0\",\n \"skip%3 %@%1\",\n \"cai%3 %1,%2\",\n \"cam%3 %1,[%X2]\",\n \"cam%3 %1,%2\" };\n if (which_alternative != 0)\n pdp10_remove_unnecessary_label (insn, operands[0]);\n /* ADDRESS: unextended code can store the symbol in the immediate\n field. */\n if (which_alternative == 3 && !TARGET_EXTENDED\n\t&& GET_CODE (operands[2]) == CONST)\n which_alternative = 2;\n if (get_attr_length (insn) == 1)\n return asms[which_alternative];\n else\n {\n\t/* Reverse the skip condition and output a JRST. */\n\toperands[3] = gen_rtx_fmt_ee (reverse_condition\n\t\t\t\t (GET_CODE (operands[3])),\n\t\t\t\t VOIDmode, NULL_RTX, NULL_RTX);\n\toutput_asm_insn (asms[which_alternative], operands);\n\treturn pdp10_output_jrst (operands[0]);\n }\n }\n [(set (attr \"length\")\n\t(if_then_else (ior (eq_attr \"alternative\" \"0\")\n\t\t\t (eq (minus (match_dup 0) (pc)) (const_int 1)))\n\t\t (const_int 1)\n\t\t (const_int 2)))\n (set_attr \"skip\" \"no,yes,yes,yes,yes\")])\n\n(define_insn \"*CAI_reg\"\n [(set (pc)\n\t(if_then_else (match_operator 0 \"comparison_operator\"\n\t\t [(and:SI (match_operand:SI 1 \"register_operand\" \"x\")\n\t\t\t\t(const_int RIGHT_HALF))\n\t\t (match_operand:SI 2 \"register_operand\" \"r\")])\n\t\t (label_ref (match_operand 3 \"\" \"\"))\n\t\t (pc)))]\n \"\"\n {\n pdp10_remove_unnecessary_label (insn, operands[3]);\n if (get_attr_length (insn) == 1)\n return \"cai%0 %2,(%1)\";\n else\n {\n\t/* Reverse the skip condition and output a JRST. */\n\toutput_asm_insn (\"cai%R0 %2,(%1)\", operands);\n\treturn pdp10_output_jrst (operands[3]);\n }\n }\n [(set (attr \"length\")\n\t(if_then_else (eq (minus (match_dup 3) (pc)) (const_int 1))\n\t\t (const_int 1)\n\t\t (const_int 2)))\n (set_attr \"skip\" \"yes\")])\n(define_insn \"*CAI_const_plus_reg\"\n [(set (pc)\n\t(if_then_else (match_operator 0 \"comparison_operator\"\n\t\t [(and:SI (plus:SI\n\t\t\t\t (match_operand:SI 1 \"register_operand\" \"x\")\n\t\t\t\t (match_operand:SI 2 \"const_int_operand\" \"I\"))\n\t\t\t\t(const_int RIGHT_HALF))\n\t\t (match_operand:SI 3 \"register_operand\" \"r\")])\n\t\t (label_ref (match_operand 4 \"\" \"\"))\n\t\t (pc)))]\n \"pdp10_const_ok_for_letter_p (INTVAL (operands[2]), 'I')\"\n {\n pdp10_remove_unnecessary_label (insn, operands[4]);\n if (get_attr_length (insn) == 1)\n return \"cai%0 %3,%2(%1)\";\n else\n {\n\t/* Reverse the skip condition and output a JRST. */\n\toutput_asm_insn (\"cai%R0 %3,%2(%1)\", operands);\n\treturn pdp10_output_jrst (operands[4]);\n }\n }\n [(set (attr \"length\")\n\t(if_then_else (eq (minus (match_dup 4) (pc)) (const_int 1))\n\t\t (const_int 1)\n\t\t (const_int 2)))\n (set_attr \"skip\" \"yes\")])\n\n(define_insn \"*cbranchsf\"\n [(set (pc)\n\t(if_then_else (match_operator 3 \"pdp10_comparison_operator\"\n\t\t [(match_operand:SF 1 \"reg_or_mem_operand\" \"r,m,r,r,r\")\n\t\t (match_operand:SF 2 \"general_operand\" \"R,R,I,i,rm\")])\n\t\t (label_ref (match_operand 0 \"\" \"\"))\n\t\t (pc)))]\n \"\"\n {\n /* TODO: Copy from cbranchsi. Maybe create an output function for\n both? */\n const char *asms[][2] =\n { { \"jump%3 %1,%F0\",\t0 },\n { \"skip%3 %@%1\",\t\t\"skip%R3 %@%1\\;jrst %l0\" },\n { \"cai%3 %1,%2\",\t\t\"cai%R3 %1,%2\\;jrst %l0\" },\n { \"cam%3 %1,[%2]\",\t\"cam%R3 %1,[%2]\\;jrst %l0\" },\n { \"cam%3 %1,%2\",\t\t\"cam%R3 %1,%2\\;jrst %l0\" } };\n if (which_alternative != 0)\n pdp10_remove_unnecessary_label (insn, operands[0]);\n return asms[which_alternative][get_attr_length (insn) - 1];\n }\n [(set (attr \"length\")\n\t(if_then_else (ior (eq_attr \"alternative\" \"0\")\n\t\t\t (eq (minus (match_dup 0) (pc)) (const_int 1)))\n\t\t (const_int 1)\n\t\t (const_int 2)))\n (set_attr \"skip\" \"no,yes,yes,yes,yes\")])\n\n(define_insn \"*cbranchdf\"\n [(set (pc)\n\t(if_then_else\n\t (match_operator 3 \"pdp10_comparison_operator\"\n [(match_operand:DF 1 \"reg_or_mem_operand\" \"r,m\")\n\t (match_operand:DF 2 \"pdp10_const_double_0_operand\" \"\")])\n\t (label_ref (match_operand 0 \"\" \"\"))\n\t (pc)))]\n \"\"\n {\n if (which_alternative == 0)\n return \"jump%3 %1,%F0\";\n pdp10_remove_unnecessary_label (insn, operands[0]);\n if (get_attr_length (insn) == 1)\n return \"skip%3 %@%1\";\n else\n {\n\toutput_asm_insn (\"skip%R3 %@%1\", operands);\n\treturn pdp10_output_jrst (operands[0]);\n }\n }\n [(set (attr \"length\")\n\t(if_then_else (ior (eq_attr \"alternative\" \"0\")\n\t\t\t (eq (minus (match_dup 0) (pc)) (const_int 1)))\n\t\t (const_int 1)\n\t\t (const_int 2)))\n (set_attr \"skip\" \"no,yes\")])\n\n(define_insn \"doloop_end\"\n [(set (pc)\n\t(if_then_else\n\t (ge (plus:SI (match_operand:SI 0 \"reg_or_mem_operand\" \"+r\")\n\t\t (const_int -1))\n\t (const_int 0))\n\t (label_ref (match_operand 4 \"\" \"\"))\n\t (pc)))\n (set (match_dup 0)\n\t(plus:SI (match_dup 0) (const_int -1)))\n (use (match_operand 1 \"\" \"\"))\t; iterations; zero if unknown\n (use (match_operand 2 \"\" \"\"))\t; max iterations\n (use (match_operand 3 \"\" \"\"))]\t; loop level\n \"\"\n \"sojge %0,%l4%; doloop_end\")\n\n(define_insn \"decrement_and_branch_until_zero\"\n [(set (pc)\n\t(if_then_else\n\t (match_operator 2 \"pdp10_comparison_operator\"\n\t [(plus:SI (match_operand:SI 0 \"reg_or_mem_operand\" \"+r,m\")\n\t\t (const_int -1))\n\t (const_int 0)])\n\t (label_ref (match_operand 1 \"\" \"\"))\n\t (pc)))\n (set (match_dup 0)\n\t(plus:SI (match_dup 0) (const_int -1)))]\n \"\"\n {\n if (which_alternative == 0)\n return \"soj%2 %0,%l1%; decrement_and_branch_until_zero\";\n pdp10_remove_unnecessary_label (insn, operands[1]);\n if (get_attr_length (insn) == 1)\n return \"sos%2 %@%0%; decrement_and_branch_until_zero\";\n else\n {\n\toutput_asm_insn (\"sos%R2 %@%0%; decrement_and_branch_until_zero\",\n\t\t\t operands);\n\treturn pdp10_output_jrst (operands[1]);\n }\n }\n [(set (attr \"length\")\n\t(if_then_else (ior (eq_attr \"alternative\" \"0\")\n\t\t\t (eq (minus (match_dup 1) (pc)) (const_int 1)))\n\t\t (const_int 1)\n\t\t (const_int 2)))\n (set_attr \"skip\" \"no,yes\")])\n\n(define_insn \"*AOJ\"\n [(set (pc)\n\t(if_then_else\n\t (match_operator 0 \"pdp10_comparison_operator\"\n\t [(plus:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"+r,m\")\n\t\t (const_int 1))\n\t (const_int 0)])\n\t (label_ref (match_operand 2 \"\" \"\"))\n\t (pc)))\n (set (match_dup 1)\n\t(plus:SI (match_dup 1) (const_int 1)))]\n \"\"\n {\n if (which_alternative == 0)\n return \"aoj%0 %1,%l2\";\n pdp10_remove_unnecessary_label (insn, operands[2]);\n if (get_attr_length (insn) == 1)\n return \"aos%0 %@%1\";\n else\n {\n\toutput_asm_insn (\"aos%R0 %@%1\", operands);\n\treturn pdp10_output_jrst (operands[2]);\n }\n }\n [(set (attr \"length\")\n\t(if_then_else (ior (eq_attr \"alternative\" \"0\")\n\t\t\t (eq (minus (match_dup 2) (pc)) (const_int 1)))\n\t\t (const_int 1)\n\t\t (const_int 2)))\n (set_attr \"skip\" \"no,yes\")])\n\n(define_insn \"*SOJA\"\n [(set (pc)\n\t(label_ref (match_operand 2 \"\" \"\")))\n (set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(plus:SI (match_operand:SI 1 \"register_operand\" \"0\")\n\t\t (const_int -1)))]\n \"\"\n {\n rtx next = next_nonnote_insn (insn);\n if (next == operands[2]\n\t|| (GET_CODE (next) == BARRIER\n\t && next_nonnote_insn (next) == operands[2]))\n {\n\tpdp10_remove_unnecessary_label (insn, operands[1]);\n\treturn \"subi %0,1\";\n }\n else\n return \"soja %0,%l2\";\n })\n\n(define_insn \"*AOJA\"\n [(set (pc)\n\t(label_ref (match_operand 2 \"\" \"\")))\n (set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(plus:SI (match_operand:SI 1 \"register_operand\" \"0\")\n\t\t (const_int 1)))]\n \"\"\n {\n rtx next = next_nonnote_insn (insn);\n if (next == operands[2]\n\t|| (GET_CODE (next) == BARRIER\n\t && next_nonnote_insn (next) == operands[2]))\n {\n\tpdp10_remove_unnecessary_label (insn, operands[2]);\n\treturn \"addi %0,1\";\n }\n else\n return \"aoja %0,%l2\";\n })\n\n(define_insn \"*SOSx_and_move\"\n [(set (pc)\n\t(if_then_else\n\t (match_operator 2 \"pdp10_comparison_operator\"\n\t [(plus:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"+rm\")\n\t\t (const_int -1))\n\t (const_int 0)])\n\t (label_ref (match_operand 3 \"\" \"\"))\n\t (pc)))\n (set (match_dup 1)\n\t(plus:SI (match_dup 1) (const_int -1)))\n (set (match_operand:SI 0 \"register_operand\" \"=x\")\n\t(plus:SI (match_dup 1) (const_int -1)))]\n \"\"\n {\n pdp10_remove_unnecessary_label (insn, operands[3]);\n if (get_attr_length (insn) == 1)\n return \"sos%2 %0,%1\";\n else\n {\n\toutput_asm_insn (\"sos%R2 %0,%1\", operands);\n\treturn pdp10_output_jrst (operands[3]);\n }\n }\n [(set (attr \"length\")\n\t(if_then_else (eq (minus (match_dup 3) (pc)) (const_int 1))\n\t\t (const_int 1)\n\t\t (const_int 2)))\n (set_attr \"skip\" \"yes\")])\n\n(define_insn \"*AOSx_and_move\"\n [(set (pc)\n\t(if_then_else\n\t (match_operator 2 \"pdp10_comparison_operator\"\n\t [(plus:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"+rm\")\n\t\t (const_int 1))\n\t (const_int 0)])\n\t (label_ref (match_operand 3 \"\" \"\"))\n\t (pc)))\n (set (match_dup 1)\n\t(plus:SI (match_dup 1) (const_int 1)))\n (set (match_operand:SI 0 \"register_operand\" \"=x\")\n\t(plus:SI (match_dup 1) (const_int 1)))]\n \"\"\n {\n pdp10_remove_unnecessary_label (insn, operands[3]);\n if (get_attr_length (insn) == 1)\n return \"aos%2 %0,%1\";\n else\n {\n\toutput_asm_insn (\"aos%R2 %0,%1\", operands);\n\treturn pdp10_output_jrst (operands[3]);\n }\n }\n [(set (attr \"length\")\n\t(if_then_else (eq (minus (match_dup 3) (pc)) (const_int 1))\n\t\t (const_int 1)\n\t\t (const_int 2)))\n (set_attr \"skip\" \"yes\")])\n\n(define_insn \"JFFO\"\n [(set (pc)\n\t(if_then_else (ne (subreg:SI\n\t\t\t (match_operand:DI 0 \"register_operand\" \"+r\") 0)\n\t\t\t (const_int 0))\n\t\t (match_operand 1 \"address_operand\" \"\")\n\t\t (pc)))\n (set (subreg:SI (match_dup 0) 4)\n\t(unspec:SI [(subreg:SI (match_dup 0) 0)] UNSPEC_FFO))]\n \"TARGET_KA10up\"\n {\n if (GET_CODE (operands[1]) == LABEL_REF)\n return \"jffo %0,%l1\";\n else\n return \"jffo %0,%1\";\n })\n\n(define_insn \"CMPBP\"\n [(set (pc)\n\t(if_then_else\n\t (match_operator 0 \"comparison_operator\"\n\t [(unspec:SI\n\t [(match_operand:SI 1 \"register_operand\" \"r\")] UNSPEC_CMPBP)\n\t (unspec:SI\n\t [(match_operand:SI 2 \"reg_or_mem_operand\" \"rm\")] UNSPEC_CMPBP)])\n\t (label_ref (match_operand 3 \"\" \"\"))\n\t (pc)))]\n \"TARGET_XKL2\"\n {\n pdp10_remove_unnecessary_label (insn, operands[3]);\n if (get_attr_length (insn) == 1)\n return \"extend %1,[cmpbp%0 %2]\";\n else\n return \"extend %1,[cmpbp%C0 %2]\\;jump %3\";\n }\n [(set (attr \"length\")\n\t(if_then_else (eq (minus (match_dup 3) (pc)) (const_int 1))\n\t\t (const_int 1)\n\t\t (const_int 2)))\n (set_attr \"skip\" \"yes\")])\n\n; (define_expand \"conditional_trap\"\n; [(trap_if (match_operator 0 \"pdp10_comparison_operator\" \n; [(match_dup 2) (const_int 0)])\n; (match_operand 1 \"const_int_operand\" \"\"))]\n; \"\"\n; \"operands[2] = pdp10_compare_op0;\")\n\n; (define_insn \"*trap\"\n; [(trap_if (match_operator 0 \"pdp10_comparison_operator\" \n; [(match_operand 2 \"memory_operand\" \"m\") (const_int 0)])\n; (match_operand 1 \"const_int_operand\" \"i\"))]\n; \"\"\n; \"skip%R0 %2\\;%_%; conditional_trap\"\n; [(set_attr \"length\" \"2\")])\n\n\f\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Function Prologue and Epilogue\n\n(define_expand \"prologue\"\n [(const_int 2)]\n \"\"\n \"pdp10_expand_prologue ();\n DONE;\")\n\n(define_expand \"epilogue\"\n [(return)]\n \"\"\n \"pdp10_expand_epilogue (1);\n DONE;\")\n\n(define_expand \"sibcall_epilogue\"\n [(const_int 3)]\n \"\"\n \"pdp10_expand_epilogue (0);\n DONE;\")\n\n(define_insn \"POPJ\"\n [(set (pc) (match_operand:SI 0 \"pdp10_pop_operand\" \"\"))]\n \"\"\n \"popj %P0,\")\n\n(define_insn \"POPJ_17\"\n [(return)]\n \"\"\n {\n return pdp10_output_return ();\n })\n\n;; Allocate stack space, and return the word address of the allocated\n;; memory.\n(define_expand \"allocate_stack\"\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(unspec:SI [(plus:SI (reg:SI SP_REGNUM) (const_int 1))]\n\t\t UNSPEC_ADDRESS))\n (set (reg:SI SP_REGNUM)\n\t(unspec:SI\n\t [(reg:SI SP_REGNUM)\n\t (match_operand:SI 1 \"general_operand\" \"\")]\n\t UNSPEC_ADJSP))]\n \"\"\n \"{\n rtx x = plus_constant (stack_pointer_rtx, 1);\n rtx y, z = gen_reg_rtx (Pmode);\n if (GET_CODE (operands[1]) == CONST_INT)\n y = GEN_INT ((INTVAL (operands[1]) + 3) / 4);\n else\n {\n\t y = gen_reg_rtx (Pmode);\n\t emit_insn (gen_addsi3 (y, operands[1], GEN_INT (3)));\n\t emit_insn (gen_ASH_right (y, y, GEN_INT (-2)));\n }\n emit_move_insn (z,\n\t\t gen_rtx_UNSPEC (Pmode, gen_rtvec (1, x), UNSPEC_ADDRESS));\n emit_move_insn (operands[0], z);\n emit_insn (pdp10_gen_stack_adjust (y));\n DONE;\n }\")\n\n(define_expand \"ADJSP\"\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(unspec:SI [(match_dup 0) (match_operand:SI 1 \"general_operand\" \"\")]\n\t\t UNSPEC_ADJSP))]\n \"\"\n \"\")\n\n(define_insn \"*ADJSP_KL10up\"\n [(set (match_operand:SI 0 \"register_operand\" \"+r,r,r,r\")\n\t(unspec:SI [(match_dup 0)\n\t\t (match_operand:SI 1 \"general_operand\" \"K,i,x,m\")]\n\t\t UNSPEC_ADJSP))]\n \"TARGET_KL10up\"\n \"@\n adjsp %0,%1\n adjsp %0,[%1]\n adjsp %0,(%1)\n adjsp %0,@%1\")\n\n(define_insn \"*ADJSP_noKL10up\"\n [(set (match_operand:SI 0 \"register_operand\" \"+r\")\n\t(unspec:SI [(match_dup 0)\n\t\t (match_operand:SI 1 \"immediate_operand\" \"K\")]\n\t\t UNSPEC_ADJSP))]\n \"!TARGET_KL10up && !TARGET_EXTENDED\"\n \"add %0,[%1,,%1]\")\n\n(define_insn \"PUSH\"\n [(set (match_operand:SI 0 \"pdp10_push_operand\" \"=m\")\n\t(match_operand:SI 1 \"reg_or_mem_operand\" \"rm\"))]\n \"\"\n \"push %P0,%1\")\n\n(define_insn \"*pushsi_combine\"\n [(parallel\n [(set (mem:SI (plus:SI (match_operand:SI 0 \"register_operand\" \"r\")\n\t\t\t (const_int 1)))\n\t ;; FIXME: empty predicate allowed?\n\t (match_operand:SI 1 \"\" \"rm\"))\n (set (match_operand:SI 2 \"register_operand\" \"=0\")\n\t (plus:SI (match_dup 0) (const_int 1)))])]\n \"optimize_size && TARGET_EXTENDED\"\n \"push %0,%1\")\n\n(define_insn \"*pushsf_combine\"\n [(parallel\n [(set (mem:SF (plus:SI (match_operand:SI 0 \"register_operand\" \"r\")\n\t\t\t (const_int 1)))\n\t (match_operand:SF 1 \"reg_or_mem_operand\" \"rm\"))\n (set (match_operand:SI 2 \"register_operand\" \"=0\")\n\t (plus:SI (match_dup 0) (const_int 1)))])]\n \"optimize_size && TARGET_EXTENDED\"\n \"push %0,%1\")\n\n(define_insn \"POP\"\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=rm\")\n\t(match_operand:SI 1 \"pdp10_pop_operand\" \"m\"))]\n \"\"\n \"pop %P1,%0\")\n\n(define_insn \"*popsi_combine\"\n [(parallel\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"=rm\")\n\t (mem:SI (match_operand:SI 1 \"register_operand\" \"r\")))\n (set (match_operand:SI 2 \"reg_or_mem_operand\" \"=1\")\n\t (plus:SI (match_dup 1) (const_int -1)))])]\n \"optimize_size && TARGET_EXTENDED\"\n \"pop %1,%0\")\n\n(define_insn \"*popsf_combine\"\n [(parallel\n [(set (match_operand:SF 0 \"reg_or_mem_operand\" \"=rm\")\n\t (mem:SF (match_operand:SI 1 \"register_operand\" \"+r\")))\n (set (match_dup 1)\n\t (plus:SI (match_dup 1) (const_int -1)))])]\n \"optimize_size && TARGET_EXTENDED\"\n \"pop %1,%0\")\n\n\f\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Peepholes\n\n;; The following four insns compensate for unnecessary shifts\n;; generated by pointer arithmetic.\n(define_insn \"*combine_nop_shift_left_right\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(unspec:SI\n\t [(ashift:SI (match_operand:SI 1 \"register_operand\" \"0\")\n\t\t (match_operand:SI 2 \"const_int_operand\" \"\"))\n\t (match_operand:SI 3 \"const_int_operand\" \"\")]\n\t UNSPEC_SHIFTRT))]\n \"INTVAL (operands[2]) == INTVAL (operands[3])\"\n \"\"\n [(set_attr \"length\" \"0\")])\n(define_insn \"*combine_shift_left_right\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(unspec:SI\n\t [(ashift:SI (match_operand:SI 1 \"register_operand\" \"0\")\n\t\t (match_operand:SI 2 \"const_int_operand\" \"\"))\n\t (match_operand:SI 3 \"const_int_operand\" \"\")]\n\t UNSPEC_SHIFTRT))]\n \"\"\n {\n operands[2] = GEN_INT (INTVAL (operands[2]) - INTVAL (operands[3]));\n return \"ash %0,%2\";\n })\n(define_insn \"*combine_nop_shift_right_left\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(ashiftrt:SI\n\t (unspec:SI [(match_operand:SI 1 \"register_operand\" \"0\")\n\t\t (match_operand:SI 2 \"const_int_operand\" \"\")]\n\t\t UNSPEC_SHIFT)\n\t (match_operand:SI 3 \"const_int_operand\" \"\")))]\n \"INTVAL (operands[2]) == INTVAL (operands[3])\"\n \"\"\n [(set_attr \"length\" \"0\")])\n(define_insn \"*combine_shift_right_left\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(ashiftrt:SI\n\t (unspec:SI [(match_operand:SI 1 \"register_operand\" \"0\")\n\t\t (match_operand:SI 2 \"const_int_operand\" \"\")]\n\t\t UNSPEC_SHIFT)\n\t (match_operand:SI 3 \"const_int_operand\" \"\")))]\n \"\"\n {\n operands[2] = GEN_INT (INTVAL (operands[2]) - INTVAL (operands[3]));\n return \"ash %0,%2\";\n })\n\n;; Remove unnecessary shifts generated by pointer arithmetic.\n(define_peephole2\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(unspec:SI\n\t [(truncate:SI\n\t (ashift:SI (match_operand:SI 1 \"register_operand\" \"\")\n\t\t (match_operand:SI 2 \"const_int_operand\" \"\")))\n\t (match_operand:SI 3 \"const_int_operand\" \"\")]\n\t UNSPEC_SHIFTRT))]\n \"INTVAL (operands[2]) == INTVAL (operands[3])\"\n [(set (match_dup 0) (truncate:SI (match_dup 1)))])\n(define_peephole2\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(ashiftrt:SI\n\t (unspec:SI [(match_operand:SI 1 \"register_operand\" \"\")\n\t\t (match_operand:SI 2 \"const_int_operand\" \"\")]\n\t\t UNSPEC_SHIFT)\n\t (match_operand:SI 3 \"const_int_operand\" \"\")))]\n \"INTVAL (operands[2]) == INTVAL (operands[3])\"\n [(set (match_dup 0) (match_dup 1))])\n\n;; Generate EXCH instructions.\n(define_peephole2\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(match_operand:SI 1 \"reg_or_mem_operand\" \"\"))\n (set (match_dup 1)\n\t(match_operand:SI 2 \"reg_or_mem_operand\" \"\"))\n (set (match_dup 2)\n\t(match_dup 0))]\n \"find_reg_note (next_nonnote_insn (next_nonnote_insn (insn)),\n\t\t REG_DEAD, operands[0])\n && (register_operand (operands[1], SImode)\n || register_operand (operands[2], SImode))\"\n ;\"peep2_reg_dead_p (2, operands[0]) && ...\"\n [(parallel [(set (match_dup 1) (match_dup 2))\n\t (set (match_dup 2) (match_dup 1))])]\n \"if (register_operand (operands[1], SImode))\n {\n rtx tmp = operands[1];\n operands[1] = operands[2];\n operands[2] = tmp;\n }\")\n\n;; Generate SETZB instructions.\n(define_peephole2\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"\") (const_int 0))\n (set (match_operand:SI 1 \"reg_or_mem_operand\" \"\") (const_int 0))]\n \"register_operand (operands[0], SImode)\n || register_operand (operands[1], SImode)\"\n [(parallel [(set (match_dup 0) (const_int 0))\n\t (set (match_dup 1) (const_int 0))])]\n \"if (register_operand (operands[0], SImode))\n {\n rtx tmp = operands[0];\n operands[0] = operands[1];\n operands[1] = tmp;\n }\")\n\n;; Remove an unneccesary MOVEI instruction.\n(define_peephole2\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n (unspec:SI\n\t [(plus:SI (match_dup 0) (match_operand 1 \"const_int_operand\" \"\"))]\n\t UNSPEC_ADDRESS))\n (parallel [(unspec_volatile:BLK\n\t [(match_operand:SI 2 \"register_operand\" \"\")]\n\t VUNSPEC_BLT)\n\t (use (mem:BLK (match_dup 0)))])]\n \"dead_or_set_p (insn, operands[0])\"\n ;\"peep2_reg_dead_p (0, operands[0])\"\n [(parallel [(unspec_volatile:BLK [(match_dup 2)] VUNSPEC_BLT)\n\t (use (mem:BLK (plus:SI (match_dup 0) (match_dup 1))))])])\n\n;; Optimize a block-copy operation with constant addresses.\n(define_peephole2\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(unspec:SI\n\t [(match_operand:SI 1 \"immediate_operand\" \"\")] UNSPEC_ADDRESS))\n (set (zero_extract:SI (match_dup 0) (const_int 18) (const_int 0))\n\t(unspec:SI\n\t [(match_operand:SI 2 \"immediate_operand\" \"\")] UNSPEC_ADDRESS))]\n \"\"\n [(set (match_dup 0)\n\t(ior:SI (ashift:SI (match_dup 2) (const_int 18))\n\t\t (match_dup 1)))])\n\n;; Optimize a block-clear operation with a constant address.\n(define_peephole2\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(match_operand:SI 1 \"immediate_operand\" \"\"))\n (set (match_operand:SI 2 \"register_operand\" \"\")\n\t(ashift:SI (unspec:SI [(match_dup 0)] UNSPEC_ADDRESS)\n\t\t (const_int 18)))\n (set (zero_extract:SI (match_dup 2) (const_int 18) (const_int 18))\n\t;; FIXME: (const_int 4) -> (const_int 1)?\n\t(unspec:SI [(plus:SI (match_dup 0) (const_int 4))] UNSPEC_ADDRESS))]\n \"dead_or_set_p (insn, operands[0])\"\n ;\"peep2_reg_dead_p (0, operands[0])\"\n [(set (match_dup 2)\n\t(ior:SI (ashift:SI (match_dup 1) (const_int 18))\n\t\t (const:SI (plus:SI (match_dup 1) (const_int 1)))))])\n\n;; Generate a PUSHJ instruction from an equivalent sequence of\n;; instructions.\n(define_peephole2\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(label_ref:SI (match_operand 1 \"\" \"\")))\n (parallel\n [(set (mem:SI (plus:SI (match_operand:SI 2 \"register_operand\" \"\")\n\t\t\t (const_int 1)))\n\t (match_operand:SI 3 \"\" \"\"))\n (set (match_dup 2)\n\t (plus:SI (match_dup 2) (const_int 1)))])\n (set (pc)\n\t(match_operand:SI 4 \"\" \"\"))]\n ;; TODO: find code_label corresponding to operands[1].\n \"0 && TARGET_EXTENDED\"\n [(parallel\n [(call (mem:SI (match_dup 4)) (const_int 0))\n (use (match_dup 2))])])\n\n;; Generate a POP instruction from an equivalent sequence of\n;; instructions.\n(define_peephole2\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(mem:SI (match_operand:SI 1 \"register_operand\" \"\")))\n (set (match_operand:SI 2 \"reg_or_mem_operand\" \"\")\n\t(match_dup 0))\n (set (match_dup 1)\n\t(plus:SI (match_dup 1) (const_int -1)))]\n \"optimize_size && TARGET_EXTENDED\"\n [(parallel\n [(set (match_dup 2)\n\t (mem:SI (match_dup 1)))\n (set (match_dup 1)\n\t (plus:SI (match_dup 1) (const_int -1)))])])\n(define_peephole2\n [(set (match_operand:SF 0 \"register_operand\" \"\")\n\t(mem:SF (match_operand:SI 1 \"register_operand\" \"\")))\n (set (match_operand:SF 2 \"reg_or_mem_operand\" \"\")\n\t(match_dup 0))\n (set (match_dup 1)\n\t(plus:SI (match_dup 1) (const_int -1)))]\n \"optimize_size && TARGET_EXTENDED\"\n [(parallel\n [(set (match_dup 2)\n\t (mem:SF (match_dup 1)))\n (set (match_dup 1)\n\t (plus:SI (match_dup 1) (const_int -1)))])])\n\n;; XMOVEI AC1,OFFSET(17)\n;; MOVE AC2,AC1\t\t\t->\tMOVE AC2,OFFSET(17)\n;; AC1 is dead\n(define_peephole2\n [(set (match_operand:SI 1 \"register_operand\" \"\")\n (plus:SI (reg:SI SP_REGNUM)\n\t\t (match_operand:SI 2 \"const_int_operand\" \"\")))\n (set (match_operand:SI 0 \"register_operand\" \"\")\n (match_dup 1))]\n ;\"dead_or_set_p (insn, operands[1])\"\n \"find_regno_note (next_real_insn (insn), REG_DEAD, REGNO (operands[1]))\"\n ;\"peep2_reg_dead_p (1, operands[1]);\"\n [(set (match_dup 0)\n (plus:SI (reg:SI SP_REGNUM) (match_dup 2)))])\n\n;; XMOVEI AC1,(17)\n;; ADDI AC1,OFFSET\t\t->\tXMOVEI AC1,OFFSET(17)\n(define_peephole2\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(reg:SI SP_REGNUM))\n (set (match_dup 0)\n\t(plus:SI (match_dup 0)\n\t\t (match_operand:SI 1 \"const_int_operand\" \"\")))]\n \"\"\n [(set (match_dup 0)\n\t(plus:SI (reg:SI SP_REGNUM) (match_dup 1)))])\n\n;; XMOVEI AC1,OFFSET1(17)\n;; ADDI AC1,OFFSET2\t\t->\tXMOVEI AC1,OFFSET1+OFFSET2(17)\n(define_peephole2\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(plus:SI (reg:SI SP_REGNUM)\n\t\t (match_operand:SI 1 \"const_int_operand\" \"\")))\n (set (match_dup 0)\n\t(plus:SI (match_dup 0)\n\t\t (match_operand:SI 2 \"const_int_operand\" \"\")))]\n \"\"\n [(set (match_dup 0)\n\t(plus:SI (reg:SI SP_REGNUM) (match_dup 3)))]\n \"operands[3] = gen_int_mode (INTVAL (operands[1]) + INTVAL (operands[2]),\n\t\t\t Pmode);\")\n\n;; AOS m\n;; MOVE a,m\t\t\t->\tAOS a,m\n(define_peephole2\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"\")\n\t(plus:SI (match_dup 0)\n\t\t (const_int 1)))\n (set (match_operand:SI 1 \"register_operand\" \"\")\n\t(match_dup 0))]\n \"REGNO (operands[1]) != 0\"\n [(parallel\n [(set (match_dup 0)\n\t (plus:SI (match_dup 0) (const_int 1)))\n (set (match_dup 1)\n\t (plus:SI (match_dup 0) (const_int 1)))])])\n\n;; SOS m\n;; MOVE a,m\t\t\t->\tSOS a,m\n(define_peephole2\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"\")\n\t(plus:SI (match_dup 0)\n\t\t (const_int -1)))\n (set (match_operand:SI 1 \"register_operand\" \"\")\n\t(match_dup 0))]\n \"REGNO (operands[1]) != 0\"\n [(parallel\n [(set (match_dup 0)\n\t (plus:SI (match_dup 0) (const_int -1)))\n (set (match_dup 1)\n\t (plus:SI (match_dup 0) (const_int -1)))])])\n\n;; AOS a,m\n;; CAILE a,0\t\t\t->\tAOSLE a,m\n;; MOVEI a,0\t\t\t\t MOVEI a,0\n(define_peephole\n [(parallel [(set (match_operand:SI 0 \"memory_operand\" \"\")\n\t\t (plus:SI (match_dup 0) (const_int 1)))\n\t (set (match_operand:SI 1 \"register_operand\" \"\")\n\t\t (plus:SI (match_dup 0) (const_int 1)))])\n (set (match_dup 1)\n\t(smin:SI (match_dup 1) (match_operand 2 \"const_int_operand\" \"\")))]\n \"REGNO (operands[1]) != 0\n && (INTVAL (operands[2]) >= -1 || INTVAL (operands[2]) <= 1)\"\n {\n if (INTVAL (operands[2]) == 0)\n return \"aosle %1,%0\\;%_movei %1,0\";\n else if (INTVAL (operands[2]) == 1)\n return \"aosle %1,%0\\;%_movei %1,1\";\n else\n return \"aosl %1,%0\\;%_seto %1,\";\n })\n\n;; SOS a,m\n;; CAILE a,0\t\t\t->\tSOSLE a,m\n;; MOVEI a,0\t\t\t\t MOVEI a,0\n(define_peephole\n [(parallel [(set (match_operand:SI 0 \"memory_operand\" \"\")\n\t\t (plus:SI (match_dup 0) (const_int -1)))\n\t (set (match_operand:SI 1 \"register_operand\" \"\")\n\t\t (plus:SI (match_dup 0) (const_int -1)))])\n (set (match_dup 1)\n\t(smin:SI (match_dup 1) (match_operand 2 \"const_int_operand\" \"\")))]\n \"REGNO (operands[1]) != 0\n && (INTVAL (operands[2]) >= -1 || INTVAL (operands[2]) <= 1)\"\n {\n if (INTVAL (operands[2]) == 0)\n return \"sosle %1,%0\\;%_movei %1,0\";\n else if (INTVAL (operands[2]) == 1)\n return \"sosle %1,%0\\;%_movei %1,1\";\n else\n return \"sosl %1,%0\\;%_seto %1,\";\n })\n\n;; AOS a,m\n;; CAIGE a,0\t\t\t->\tAOSGE a,m\n;; MOVEI a,0\t\t\t\t MOVEI a,0\n(define_peephole\n [(parallel [(set (match_operand:SI 0 \"memory_operand\" \"\")\n\t\t (plus:SI (match_dup 0) (const_int 1)))\n\t (set (match_operand:SI 1 \"register_operand\" \"\")\n\t\t (plus:SI (match_dup 0) (const_int 1)))])\n (set (match_dup 1)\n\t(smax:SI (match_dup 1) (match_operand 2 \"const_int_operand\" \"\")))]\n \"REGNO (operands[1]) != 0\n && (INTVAL (operands[2]) >= -1 || INTVAL (operands[2]) <= 1)\"\n {\n if (INTVAL (operands[2]) == 0)\n return \"aosge %1,%0\\;%_movei %1,0\";\n else if (INTVAL (operands[2]) == 1)\n return \"aosg %1,%0\\;%_movei %1,1\";\n else\n return \"aosge %1,%0\\;%_seto %1,\";\n })\n\n;; SOS a,m\n;; CAIGE a,0\t\t\t->\tSOSGE a,m\n;; MOVEI a,0\t\t\t\t MOVEI a,0\n(define_peephole\n [(parallel [(set (match_operand:SI 0 \"memory_operand\" \"\")\n\t\t (plus:SI (match_dup 0) (const_int -1)))\n\t (set (match_operand:SI 1 \"register_operand\" \"\")\n\t\t (plus:SI (match_dup 0) (const_int -1)))])\n (set (match_dup 1)\n\t(smax:SI (match_dup 1) (match_operand 2 \"const_int_operand\" \"\")))]\n \"REGNO (operands[1]) != 0\n && (INTVAL (operands[2]) >= -1 || INTVAL (operands[2]) <= 1)\"\n {\n if (INTVAL (operands[2]) == 0)\n return \"sosge %1,%0\\;%_movei %1,0\";\n else if (INTVAL (operands[2]) == 1)\n return \"sosg %1,%0\\;%_movei %1,1\";\n else\n return \"sosge %1,%0\\;%_seto %1,\";\n })\n\n;; AOS m\n;; SKIPx m\t\t\t->\tAOSx m\n(define_peephole2\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"\")\n\t(plus:SI (match_dup 0)\n\t\t (const_int 1)))\n (set (pc)\n\t (if_then_else\n\t (match_operator 2 \"pdp10_comparison_operator\"\n\t [(match_dup 0)\n\t (const_int 0)])\n\t (label_ref (match_operand 1 \"\" \"\"))\n\t (pc)))]\n \"\"\n [(parallel\n [(set (pc)\n\t (if_then_else\n\t (match_op_dup 2\n\t [(plus:SI (match_dup 0) (const_int 1))\n\t (const_int 0)])\n\t (label_ref (match_dup 1))\n\t (pc)))\n (set (match_dup 0)\n\t (plus:SI (match_dup 0) (const_int 1)))])])\n\n;; SOS m\n;; SKIPx m\t\t\t->\tSOSx m\n(define_peephole2\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"\")\n\t(plus:SI (match_dup 0)\n\t\t (const_int -1)))\n (set (pc)\n\t (if_then_else\n\t (match_operator 2 \"pdp10_comparison_operator\"\n\t [(match_dup 0)\n\t (const_int 0)])\n\t (label_ref (match_operand 1 \"\" \"\"))\n\t (pc)))]\n \"\"\n [(parallel\n [(set (pc)\n\t (if_then_else\n\t (match_op_dup 2\n\t [(plus:SI (match_dup 0) (const_int -1))\n\t (const_int 0)])\n\t (label_ref (match_dup 1))\n\t (pc)))\n (set (match_dup 0)\n\t (plus:SI (match_dup 0) (const_int -1)))])])\n\n;; AOS m\n;; SKIPx a,m\t\t\t->\tAOSx a,m\n(define_peephole2\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"\")\n\t(plus:SI (match_dup 0)\n\t\t (const_int 1)))\n (parallel\n [(set (pc)\n\t (if_then_else\n\t (match_operator 3 \"pdp10_comparison_operator\"\n\t [(match_dup 0)\n\t (const_int 0)])\n\t (label_ref (match_operand 1 \"\" \"\"))\n\t (pc)))\n (set (match_operand:SI 2 \"register_operand\" \"\")\n\t (match_dup 0))])]\n \"REGNO (operands[2]) != 0\"\n [(parallel\n [(set (pc)\n\t (if_then_else\n\t (match_op_dup 3\n\t [(plus:SI (match_dup 0) (const_int 1))\n\t (const_int 0)])\n\t (label_ref (match_dup 1))\n\t (pc)))\n (set (match_dup 0)\n\t (plus:SI (match_dup 0) (const_int 1)))\n (set (match_dup 2)\n\t (plus:SI (match_dup 0) (const_int 1)))])])\n\n;; SOS m\n;; SKIPx a,m\t\t\t->\tSOSx a,m\n(define_peephole2\n [(set (match_operand:SI 0 \"reg_or_mem_operand\" \"\")\n\t(plus:SI (match_dup 0)\n\t\t (const_int -1)))\n (parallel\n [(set (pc)\n\t (if_then_else\n\t (match_operator 3 \"pdp10_comparison_operator\"\n\t [(match_dup 0)\n\t (const_int 0)])\n\t (label_ref (match_operand 1 \"\" \"\"))\n\t (pc)))\n (set (match_operand:SI 2 \"register_operand\" \"\")\n\t (match_dup 0))])]\n \"REGNO (operands[2]) != 0\"\n [(parallel\n [(set (pc)\n\t (if_then_else\n\t (match_op_dup 3\n\t [(plus:SI (match_dup 0) (const_int -1))\n\t (const_int 0)])\n\t (label_ref (match_dup 1))\n\t (pc)))\n (set (match_dup 0)\n\t (plus:SI (match_dup 0) (const_int -1)))\n (set (match_dup 2)\n\t (plus:SI (match_dup 0) (const_int -1)))])])\n\n;; ADDI a,1\n;; JRST m\t\t\t->\tAOJA a,m\n;; The traditional peephole is needed to detect sequences after basic\n;; block reordering. peephole2 is run before that.\n(define_peephole2\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(plus:SI (match_dup 0)\n\t\t (const_int 1)))\n (set (pc)\n\t(label_ref (match_operand 1 \"\" \"\")))]\n \"\"\n [(parallel\n [(set (pc)\n\t (label_ref (match_dup 1)))\n (set (match_dup 0)\n\t (plus:SI (match_dup 0)\n\t\t (const_int 1)))])])\n(define_peephole\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(plus:SI (match_dup 0)\n\t\t (const_int 1)))\n (set (pc)\n\t(label_ref (match_operand 1 \"\" \"\")))]\n \"\"\n \"aoja %0,%l1\")\n\n;; SUBI a,1\n;; JRST m\t\t\t->\tSOJA a,m\n;; The traditional peephole is needed to detect sequences after basic\n;; block reordering. peephole2 is run before that.\n(define_peephole2\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(plus:SI (match_dup 0)\n\t\t (const_int -1)))\n (set (pc)\n\t(label_ref (match_operand 1 \"\" \"\")))]\n \"\"\n [(parallel\n [(set (pc)\n\t (label_ref (match_dup 1)))\n (set (match_dup 0)\n\t (plus:SI (match_dup 0)\n\t\t (const_int -1)))])])\n(define_peephole\n [(set (match_operand:SI 0 \"register_operand\" \"\")\n\t(plus:SI (match_dup 0)\n\t\t (const_int -1)))\n (set (pc)\n\t(label_ref (match_operand 1 \"\" \"\")))]\n \"\"\n \"soja %0,%l1\")\n\n;; AOS m1\n;; JRST m2\t\t\t->\tAOSA m1,m2 (if possible)\n;; TODO.\n\n;; SOS m1\n;; JRST m2\t\t\t->\tSOSA m1,m2 (if possible)\n;; TODO.\n\n\f\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Miscellaneous\n\n;; UNSPEC_VOLATILE is considered to use and clobber all hard registers\n;; and all of memory. This blocks insns from being moved across this\n;; point.\n(define_insn \"blockage\"\n [(unspec_volatile [(const_int 0)] VUNSPEC_BLOCKAGE)]\n \"\"\n \"\"\n [(set_attr \"length\" \"0\")])\n\n(define_insn \"*movqi_subreg\"\n [(set (match_operand:QI 0 \"register_operand\" \"=r\")\n\t(subreg:QI (match_operand:SI 1 \"register_operand\" \"r\") 3))]\n \"\"\n \"move %0,%1%; (set (reg:QI %0) (subreg:QI (reg:SI %1) 3)\")\n\n(define_insn \"\"\n [(set (subreg:QI (match_operand:SI 0 \"register_operand\" \"=r\") 3)\n\t(match_operand:QI 1 \"register_operand\" \"r\"))]\n \"\"\n \"move %0,%1%; (set (subreg:QI (reg:SI %0) 3) (reg:QI %1)\")\n\n(define_insn \"\"\n [(set (match_operand:QI 0 \"register_operand\" \"=r\")\n\t(subreg:QI (match_operand:SI 1 \"register_operand\" \"0\") 0))]\n \"\"\n \"lsh %0,-33%; (set (reg:QI %0) (subreg:QI (reg:SI %1) 0))\")\n\n(define_insn \"\"\n [(set (match_operand:HI 0 \"register_operand\" \"=r\")\n\t(subreg:HI (match_operand:SI 1 \"register_operand\" \"r\") 0))]\n \"\"\n \"hlrz %0,%1%; (set (reg:HI %0) (subreg:HI (reg:SI %1) 0))\")\n\n(define_insn \"\"\n [(set (match_operand:HI 0 \"register_operand\" \"=r\")\n\t(subreg:HI (match_operand:SI 1 \"register_operand\" \"r\") 2))]\n \"\"\n \"hrrz %0,%1%; (set (reg:HI %0) (subreg:HI (reg:SI %1) 2))\")\n\n(define_insn \"\"\n [(set (match_operand:HI 0 \"register_operand\" \"=r\")\n\t(subreg:HI (zero_extract:SI (match_operand:SI 1 \"memory_operand\" \"m\")\n\t\t\t\t (const_int 18)\n\t\t\t\t (const_int 18))\n\t\t 0))]\n \"\"\n \"hrrz %0,%1%; (set (reg:HI %0) (subreg:HI (zero_extr:SI %1 18 18) 0))\")\n\n(define_insn \"\"\n [(set (match_operand:QI 0 \"register_operand\" \"=r\")\n\t(subreg:QI (zero_extract:SI (match_operand:SI 1 \"memory_operand\" \"m\")\n\t\t\t\t (const_int 9)\n\t\t\t\t (const_int 27))\n\t\t 0))]\n \"\"\n ;; FIXME: will this do?\n \"move %0,%1\"\n [(set_attr \"length\" \"3\")])\n\n;; Only used in KA10 expansion of FIX.\n(define_insn \"TSC\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n (xor:SI\n\t (match_dup 0)\n\t (ior:SI\n\t (ashift:SI (match_operand:SI 1 \"reg_or_mem_operand\" \"rm\")\n\t\t (const_int 18))\n\t (lshiftrt:SI (match_dup 1) (const_int 18)))))]\n \"\"\n \"tsc %0,%1\")\n\n(define_insn \"\"\n [(set (match_operand:SI 0 \"register_operand\" \"=r\")\n\t(ashiftrt:SI (match_operand:SI 1 \"memory_operand\" \"m\")\n\t\t (const_int 27)))]\n \"\"\n \"move %0,%1\\;ash %0,-33\"\n [(set_attr \"length\" \"2\")])\n\n(define_insn \"\"\n [(set (match_operand:QI 0 \"register_operand\" \"=r\")\n (subreg:QI (zero_extract:SI (match_operand:SI 1 \"memory_operand\" \"m\")\n\t\t\t\t (const_int 9)\n\t\t\t\t (const_int 0))\n\t\t 3))]\n \"\"\n {\n rtx ops[4];\n ops[0] = operands[0];\n ops[1] = operands[1];\n ops[2] = GEN_INT (9);\n ops[3] = GEN_INT (0);\n if (get_attr_length (insn) == 1)\n output_asm_insn (pdp10_output_extzv (insn, ops), ops);\n else\n output_asm_insn (pdp10_output_extzv_sequence (ops), ops);\n return \"\";\n }\n [(set (attr \"length\")\n\t(if_then_else (ne (symbol_ref \"TARGET_LARGE\") (const_int 0))\n\t\t (const_int 1)\n\t\t (const_int 2)))])\n\n(define_insn \"\"\n [(set (match_operand:QI 0 \"register_operand\" \"=r\")\n\t(subreg:QI (zero_extract:SI (match_operand:SI 1 \"memory_operand\" \"m\")\n\t\t\t\t (const_int 9)\n\t\t\t\t (const_int 9))\n\t\t 3))]\n \"\"\n {\n rtx ops[4];\n ops[0] = operands[0];\n ops[1] = operands[1];\n ops[2] = GEN_INT (9);\n ops[3] = GEN_INT (9);\n output_asm_insn (pdp10_output_extzv (insn, ops), ops);\n return \"\";\n })\n" }, { "path": "src/test/resources/samples/langs/GDB/as3.gdbinit", "content": "# -*- gdb-script -*-\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\n# Interactive commands to help inspecting ActionScript execution state while debugging in gdb.\n#\n# To use this file, type from the gdb prompt: \n# source $(hg root)/utils/as3.gdbinit\n# or include in your .gdbinit.\n#\n# See gdb help for individual commands.\n#\n# In case of undefined symbols, try running the gdb 'where' command before aswhere.\n#\n# Typical use case:\n# (gdb) run\n# ^C\n# (gdb) where\n# (gdb) aswhere\n# (gdb) asframe 4 # select 4th AS3 frame from the top\n# (gdb) aslocal # print locals\n# (gdb) aslocal 2 # print 2nd local as a C++ value\n# $42 = ....\n# (gdb) print *$42 # dereference $42, assuming it's a pointer (to a ScriptObject or String)\n#\n# Note that the gdb scripting language is rather limited.\n#\n\ndefine aswhere\n set var $fcount = avmplus::AvmCore::getActiveCore()->debugger()->frameCount()\n set var $i = 0\n while ($i < $fcount) \n # set var $frame = avmplus::AvmCore::getActiveCore()->debugger()->frameAt($k)\n # call (void)avmplus::Debugger::printFrame($k)\n asprintframe $i\n set var $i = $i + 1\n end\nend\n\ndocument aswhere\nPrint backtrace of all the ActionScript stack frames.\nMay not work in all contexts (notably inside MMgc).\nMay not work properly until gdb 'where' is called at least once.\nend\n\nset var $_asframe_selected=-1\n\ndefine asprintframe \n set var $frame = avmplus::AvmCore::getActiveCore()->debugger()->frameAt($arg0)\n if ($frame == 0)\n echo no frame\\n\n else\n aspstring avmplus::Debugger::methodNameAt($frame)\n echo (\n set var $vcount = avmplus::Debugger::autoVarCount($frame, avmplus::Debugger::AUTO_ARGUMENT)\n set var $j = 0\n while ($j < $vcount) \n set var $argname = avmplus::Debugger::autoVarName($frame, $j, avmplus::Debugger::AUTO_ARGUMENT)\n aspstring $argname \n echo =\n set var $_atom = avmplus::Debugger::autoAtomAt($frame, $j, avmplus::Debugger::AUTO_ARGUMENT)\n call (void)avmplus::Debugger::printAtom($_atom)\n set var $j = $j + 1\n if ($j != $vcount) \n echo ,\n end\n end\n echo )\n echo \\n\n end\nend\n\n\ndefine asframe \n if ($argc != 0)\n set var $_asframe_selected=$arg0\n end\n if ($_asframe_selected >= 0)\n asprintframe $_asframe_selected\n else\n echo no frame\\n\n end\nend\n\ndocument asframe\nSelect and print an ActionScript stack frame.\nWith no argument, print the selected AS stack frame.\nAn argument specifies the number of the stack frame to select.\nend\n\n\ndefine aspstring\n call (void)avmplus::Debugger::printString($arg0)\nend\n\ndocument aspstring\nPrint the AS3 string.\nend\n\n# not pretty, but there's no switch\ndefine aslocal\n set var $frame = avmplus::AvmCore::getActiveCore()->debugger()->frameAt($_asframe_selected)\n if ($frame == 0)\n echo no frame\\n\n else\n if $argc == 0\n set var $lcount = avmplus::Debugger::autoVarCount($frame, avmplus::Debugger::AUTO_LOCAL)\n set var $k = 0\n while ($k < $lcount) \n set var $lname = avmplus::Debugger::autoVarName($frame, $k, avmplus::Debugger::AUTO_LOCAL)\n output $k\n echo :\\ \\ \n aspstring $lname\n echo :\\ \\ \n aslocal $k\n set var $k = $k + 1\n end\n else\n set var $_last_type=avmplus::Debugger::autoAtomKindAt($frame, $arg0, avmplus::Debugger::AUTO_LOCAL) \n if ($_last_type == 0)\n echo unknown\\n\n end\n if ($_last_type == 1)\n call avmplus::Debugger::autoVarAsObject($frame, $arg0, avmplus::Debugger::AUTO_LOCAL) \n end\n if ($_last_type == 2)\n call avmplus::Debugger::autoVarAsString($frame, $arg0, avmplus::Debugger::AUTO_LOCAL) \n end\n if ($_last_type == 3)\n ecno namespace (unfinished)\\n\n end\n if ($_last_type == 4)\n echo undefined\\n\n end\n if ($_last_type == 5)\n call avmplus::Debugger::autoVarAsBoolean($frame, $arg0, avmplus::Debugger::AUTO_LOCAL) \n end\n if ($_last_type == 6)\n call avmplus::Debugger::autoVarAsInteger($frame, $arg0, avmplus::Debugger::AUTO_LOCAL) \n end\n if ($_last_type == 7)\n call avmplus::Debugger::autoVarAsDouble($frame, $arg0, avmplus::Debugger::AUTO_LOCAL) \n end\n end\n end\nend\n\ndocument aslocal \nPrint local variables of the currently selected AS stack frame, if debuging information present.\nInformation may be incorrect if not at a debugger safepoint.\nWith no argument, print all the local variables.\nWith a numeric argument print the specific local variable (gdb will store value in history \nfor further manipulation).\nend\n\ndefine asarg\n set var $frame = avmplus::AvmCore::getActiveCore()->debugger()->frameAt($_asframe_selected)\n if ($frame == 0)\n echo no frame\\n\n else\n if $argc == 0\n set var $acount = avmplus::Debugger::autoVarCount($frame, avmplus::Debugger::AUTO_ARGUMENT)\n set var $k = 0\n while ($k < $acount) \n set var $name = avmplus::Debugger::autoVarName($frame, $k, avmplus::Debugger::AUTO_ARGUMENT)\n output $k\n echo :\\ \\ \n aspstring $name\n echo :\\ \\ \n asarg $k\n set var $k = $k + 1\n end\n else\n set var $_last_type=avmplus::Debugger::autoAtomKindAt($frame, $arg0, avmplus::Debugger::AUTO_ARGUMENT) \n if ($_last_type == 0)\n echo unknown\\n\n end\n if ($_last_type == 1)\n print avmplus::Debugger::autoVarAsObject($frame, $arg0, avmplus::Debugger::AUTO_ARGUMENT) \n end\n if ($_last_type == 2)\n print avmplus::Debugger::autoVarAsString($frame, $arg0, avmplus::Debugger::AUTO_ARGUMENT) \n end\n if ($_last_type == 3)\n echo namespace (unfinished)\\n\n end\n if ($_last_type == 4)\n echo undefined\\n\n end\n if ($_last_type == 5)\n print avmplus::Debugger::autoVarAsBoolean($frame, $arg0, avmplus::Debugger::AUTO_ARGUMENT) \n end\n if ($_last_type == 6)\n print avmplus::Debugger::autoVarAsInteger($frame, $arg0, avmplus::Debugger::AUTO_ARGUMENT) \n end\n if ($_last_type == 7)\n print avmplus::Debugger::autoVarAsDouble($frame, $arg0, avmplus::Debugger::AUTO_ARGUMENT) \n end\n end\n end\nend\n\ndocument asarg \nPrint arguments of the currently selected AS stack frame.\nIf no debugging information is available, argument names will not be printed.\nWith no argument, print all the arguments.\nWith a numeric argument print the specific argument (gdb will store value in history \nfor further manipulation).\nend\n\n\ndefine asthis\n set var $frame = avmplus::AvmCore::getActiveCore()->debugger()->frameAt($_asframe_selected)\n if ($frame == 0)\n echo no frame\\n\n else\n print avmplus::Debugger::autoVarAsObject($frame, 0, avmplus::Debugger::AUTO_THIS) \n end\nend\n\ndocument asthis\nPrint the receiver of the currently selected frame.\nend\n\ndefine asmixon\n print avmshell::DebugCLI::debuggerInterruptOnEnter\n print avmshell::DebugCLI::debuggerInterruptOnEnter = true\nend\n\ndocument asmixon\n turn on stepping.\n Execution will return to gdb propmpt after asstep* instructions.\n Requires debugging symbols in .abcs\nend\n\ndefine asstepout\n call avmplus::AvmCore::getActiveCore()->debugger()->stepOut()\n continue\n asprintframe 0\nend\n\ndefine asstepinto\n output avmplus::AvmCore::getActiveCore()->debugger()->stepInto()\n continue\n asprintframe 0\nend\n\ndefine asstepover\n output avmplus::AvmCore::getActiveCore()->debugger()->stepOver()\n continue\n asprintframe 0\nend\n\n\ndefine asprint\n aspstring $arg0->traits()->name()\n echo \\n\nend\n" }, { "path": "src/test/resources/samples/langs/GDB/gdb_lpc17xx_program.gdb", "content": "#\r\n# MicropendousX LPC17xx Development Board\r\n#\r\n# http://www.MicropendousX.org\r\n#\r\n# Connect to a debugger controlling a LPC17xx\r\n# and download firmware.\r\n#\r\n# Start your OpenOCD gdb server before running\r\n# this script with: arm-none-eabi-gdb -x gdb_lpc17xx_program.gdb\r\n#\r\n# Note the 'monitor' command just passes its\r\n# arguments to OpenOCD\r\n#\r\n# This file is released under the MIT License\r\n#\r\n\r\n# Connect to OpenOCD gdb server\r\ntarget remote localhost:3333\r\n\r\n# reset the LPC17xx IC with the OpenOCD reset command\r\nmonitor reset\r\n\r\n# the following are OpenOCD commands as in OpenOCD_program.script\r\n# which will download a hex file into your LPC17xx\r\nmonitor halt\r\nmonitor sleep 200\r\nmonitor wait_halt\r\nmonitor flash probe 0\r\nmonitor flash info 0\r\nmonitor flash write_image erase unlock USBtoSerial.hex\r\nmonitor sleep 200\r\nmonitor reset run\r\nmonitor exit\r\n\r\nquit\r\n" }, { "path": "src/test/resources/samples/langs/GDScript/example.gd", "content": "# Taken from https://github.com/okamstudio/godot/wiki/gdscript\n# a file is a class!\n\n# inheritance\n\nextends BaseClass\n\n# member variables\n\nvar a = 5 \nvar s = \"Hello\"\nvar arr = [1, 2, 3]\nvar dict = {\"key\":\"value\", 2:3}\n\n# constants\n\nconst answer = 42\nconst thename = \"Charly\"\n\n# built-in vector types\n\nvar v2 = Vector2(1, 2)\nvar v3 = Vector3(1, 2, 3)\n\n# function\n\nfunc some_function(param1, param2):\n var local_var = 5\n\n if param1 < local_var:\n print(param1)\n elif param2 > 5:\n print(param2)\n else:\n print(\"fail!\")\n\n for i in range(20):\n print(i)\n\n while(param2 != 0):\n param2 -= 1\n\n var local_var2 = param1+3\n return local_var2\n\n\n# subclass\n\nclass Something:\n var a = 10\n\n# constructor\n\nfunc _init():\n print(\"constructed!\")\n var lv = Something.new()\n print(lv.a)\n" }, { "path": "src/test/resources/samples/langs/GDScript/grid.gd", "content": "\n\nextends Control\n\n# Simple Tetris-like demo, (c) 2012 Juan Linietsky\n# Implemented by using a regular Control and drawing on it during the _draw() callback.\n# The drawing surface is updated only when changes happen (by calling update())\n\n\nvar score = 0\nvar score_label=null\n\nconst MAX_SHAPES = 7\n\nvar block = preload(\"block.png\")\n\nvar block_colors=[\n\tColor(1,0.5,0.5),\n\tColor(0.5,1,0.5),\n\tColor(0.5,0.5,1),\n\tColor(0.8,0.4,0.8),\n\tColor(0.8,0.8,0.4),\n\tColor(0.4,0.8,0.8),\n\tColor(0.7,0.7,0.7)]\n\nvar\tblock_shapes=[\n\t[ Vector2(0,-1),Vector2(0,0),Vector2(0,1),Vector2(0,2) ], # I\n\t[ Vector2(0,0),Vector2(1,0),Vector2(1,1),Vector2(0,1) ], # O\n\t[ Vector2(-1,1),Vector2(0,1),Vector2(0,0),Vector2(1,0) ], # S\n\t[ Vector2(1,1),Vector2(0,1),Vector2(0,0),Vector2(-1,0) ], # Z\n\t[ Vector2(-1,1),Vector2(-1,0),Vector2(0,0),Vector2(1,0) ], # L\n\t[ Vector2(1,1),Vector2(1,0),Vector2(0,0),Vector2(-1,0) ], # J\n\t[ Vector2(0,1),Vector2(1,0),Vector2(0,0),Vector2(-1,0) ]] # T\n\t\n\nvar block_rotations=[\n\tMatrix32( Vector2(1,0),Vector2(0,1), Vector2() ),\n\tMatrix32( Vector2(0,1),Vector2(-1,0), Vector2() ),\n\tMatrix32( Vector2(-1,0),Vector2(0,-1), Vector2() ),\n\tMatrix32( Vector2(0,-1),Vector2(1,0), Vector2() )\n]\n\t\n\nvar width=0\nvar height=0\n\nvar cells={}\n\nvar piece_active=false\nvar piece_shape=0\nvar piece_pos=Vector2()\nvar piece_rot=0\n\n\nfunc piece_cell_xform(p,er=0):\n\tvar r = (4+er+piece_rot)%4\n\treturn piece_pos+block_rotations[r].xform(p)\n\nfunc _draw():\n\n\tvar sb = get_stylebox(\"bg\",\"Tree\") # use line edit bg\n\tdraw_style_box(sb,Rect2(Vector2(),get_size()).grow(3))\n\t\n\tvar bs = block.get_size()\n\tfor y in range(height):\n\t\tfor x in range(width):\n\t\t\tif (Vector2(x,y) in cells):\n\t\t\t\tdraw_texture_rect(block,Rect2(Vector2(x,y)*bs,bs),false,block_colors[cells[Vector2(x,y)]])\n\t\t\t\t\n\tif (piece_active):\n\t\t\n\t\tfor c in block_shapes[piece_shape]:\n\t\t\tdraw_texture_rect(block,Rect2(piece_cell_xform(c)*bs,bs),false,block_colors[piece_shape])\n\t\t\t\n\nfunc piece_check_fit(ofs,er=0):\n\n\tfor c in block_shapes[piece_shape]:\n\t\tvar pos = piece_cell_xform(c,er)+ofs\n\t\tif (pos.x < 0):\n\t\t\treturn false\n\t\tif (pos.y < 0):\n\t\t\treturn false\n\t\tif (pos.x >= width):\n\t\t\treturn false\n\t\tif (pos.y >= height):\n\t\t\treturn false\n\t\tif (pos in cells):\n\t\t\treturn false\n\t\n\treturn true\t\n\nfunc new_piece():\n\n\tpiece_shape = randi() % MAX_SHAPES\t\n\tpiece_pos = Vector2(width/2,0)\n\tpiece_active=true\n\tpiece_rot=0\n\tif (piece_shape==0):\n\t\tpiece_pos.y+=1\n\t\t\n\tif (not piece_check_fit(Vector2())):\n\t\t#game over\n\t\t#print(\"GAME OVER!\")\n\t\tgame_over()\n\t\t\n\tupdate()\n\t\t\n\t\nfunc test_collapse_rows():\n\tvar accum_down=0\n\tfor i in range(height):\n\t\tvar y = height - i - 1\n\t\tvar collapse = true\n\t\tfor x in range(width):\n\t\t\tif (Vector2(x,y) in cells):\n\t\t\t\tif (accum_down):\n\t\t\t\t\tcells[ Vector2(x,y+accum_down) ] = cells[Vector2(x,y)]\n\t\t\telse:\n\t\t\t\tcollapse=false\n\t\t\t\tif (accum_down):\n\t\t\t\t\tcells.erase( Vector2(x,y+accum_down) )\n\t\t\t\t\t\t\n\t\tif (collapse):\n\t\t\taccum_down+=1\n\t\t\n\t\t\t\n\tscore+=accum_down*100\n\tscore_label.set_text(str(score))\n\t\t\t\n\t\t\nfunc game_over():\n\n\t\tpiece_active=false\n\t\tget_node(\"gameover\").set_text(\"Game Over\")\t\t\n\t\tupdate()\n\t\t\t\t\n\t\t\nfunc restart_pressed():\n\n\t\tscore=0\n\t\tscore_label.set_text(\"0\")\n\t\tcells.clear()\n\t\tget_node(\"gameover\").set_text(\"\")\t\t\n\t\tpiece_active=true\n\t\tupdate()\n\t\t\n\t\t\n\nfunc piece_move_down():\n\n\tif (!piece_active):\n\t\treturn\n\tif (piece_check_fit(Vector2(0,1))):\n\t\tpiece_pos.y+=1\n\t\tupdate()\t\t\n\telse:\n\n\t\tfor c in block_shapes[piece_shape]:\n\t\t\tvar pos = piece_cell_xform(c)\n\t\t\tcells[pos]=piece_shape\n\t\ttest_collapse_rows()\n\t\tnew_piece()\n\t\t\n\nfunc piece_rotate():\n\n\tvar adv = 1\n\tif (not piece_check_fit(Vector2(),1)):\n\t\treturn\n\tpiece_rot = (piece_rot + adv) % 4\n\tupdate()\n\t\n\t\n\nfunc _input(ie):\n\n\n\tif (not piece_active):\n\t\treturn\n\tif (!ie.is_pressed()):\n\t\treturn\n\n\tif (ie.is_action(\"move_left\")):\n\t\tif (piece_check_fit(Vector2(-1,0))):\n\t\t\tpiece_pos.x-=1\n\t\t\tupdate()\n\telif (ie.is_action(\"move_right\")):\n\t\tif (piece_check_fit(Vector2(1,0))):\n\t\t\tpiece_pos.x+=1\n\t\t\tupdate()\n\telif (ie.is_action(\"move_down\")):\n\t\tpiece_move_down()\n\telif (ie.is_action(\"rotate\")):\n\t\tpiece_rotate()\n\t\t\n\t\t\nfunc setup(w,h):\n\twidth=w\n\theight=h\n\tset_size( Vector2(w,h)*block.get_size() )\n\tnew_piece()\n\tget_node(\"timer\").start()\n\t\n\nfunc _ready():\n\t# Initalization here\n\n\tsetup(10,20)\n\tscore_label = get_node(\"../score\")\n\n\tset_process_input(true)\n\n\n\n\n" }, { "path": "src/test/resources/samples/langs/GDScript/player.gd", "content": "\nextends RigidBody\n\n# member variables here, example:\n# var a=2\n# var b=\"textvar\"\n\n#var dir=Vector3()\n\nconst ANIM_FLOOR = 0\nconst ANIM_AIR_UP = 1\nconst ANIM_AIR_DOWN = 2\n\nconst SHOOT_TIME = 1.5\nconst SHOOT_SCALE = 2\n\nconst CHAR_SCALE = Vector3(0.3,0.3,0.3)\n\nvar facing_dir = Vector3(1, 0, 0)\nvar movement_dir = Vector3()\n\nvar jumping=false\n\nvar turn_speed=40\nvar keep_jump_inertia = true\nvar air_idle_deaccel = false\nvar accel=19.0\nvar deaccel=14.0\nvar sharp_turn_threshhold = 140\n\nvar max_speed=3.1\nvar on_floor = false\n\nvar prev_shoot = false\n\nvar last_floor_velocity = Vector3()\n\nvar shoot_blend = 0\n\nfunc adjust_facing(p_facing, p_target,p_step, p_adjust_rate,current_gn):\n\n\tvar n = p_target # normal\n\tvar t = n.cross(current_gn).normalized()\n\t\n\tvar x = n.dot(p_facing)\n\tvar y = t.dot(p_facing)\n\t\n\tvar ang = atan2(y,x)\n\t\n\tif (abs(ang)<0.001): # too small\n\t\treturn p_facing\n\t\n\tvar s = sign(ang)\n\tang = ang * s\n\tvar turn = ang * p_adjust_rate * p_step\n\tvar a\n\tif (ang 0.1 and rad2deg(acos(target_dir.dot(hdir))) > sharp_turn_threshhold\n\n\t\tif (dir.length()>0.1 and !sharp_turn) :\n\t\t\tif (hspeed > 0.001) :\n\n\t\t\t\t#linear_dir = linear_h_velocity/linear_vel\n\t\t\t\t#if (linear_vel > brake_velocity_limit and linear_dir.dot(ctarget_dir)<-cos(Math::deg2rad(brake_angular_limit)))\n\t\t\t\t#\tbrake=true\n\t\t\t\t#else\n\t\t\t\thdir = adjust_facing(hdir,target_dir,delta,1.0/hspeed*turn_speed,up)\n\t\t\t\tfacing_dir = hdir\n\t\t\telse:\n\n\t\t\t\thdir = target_dir\n\t\t\t\n\t\t\tif (hspeed0):\n\t\t\tanim=ANIM_AIR_UP\n\t\telse:\n\t\t\tanim=ANIM_AIR_DOWN\n\t\t\t\n\t\tvar hs\n\t\tif (dir.length()>0.1):\n\n\t\t\thv += target_dir * (accel * 0.2) * delta\n\t\t\tif (hv.length() > max_speed):\n\t\t\t\thv = hv.normalized() * max_speed\n\n\t\telse:\n\n\t\t\tif (air_idle_deaccel):\n\t\t\t\thspeed = hspeed - (deaccel * 0.2) * delta\n\t\t\t\tif (hspeed<0):\n\t\t\t\t\thspeed=0\n\n\t\t\t\thv = hdir*hspeed\n\t\t\t\n\t\t\n\tif (jumping and vv < 0):\n\t\tjumping=false\n\n\tlv = hv+up*vv\n\t\n\t\n\n\tif (onfloor):\n\n\t\tmovement_dir = lv\n\t\t#lv += floor_velocity\n\t\tlast_floor_velocity = floor_velocity\n\telse:\n\n\t\tif (on_floor) :\n\n\t\t\t#if (keep_jump_inertia):\n\t\t\t#\tlv += last_floor_velocity\n\t\t\tpass\n\t\t\n\t\tlast_floor_velocity = Vector3()\n\t\tmovement_dir = lv\n\t\n\ton_floor = onfloor\n\n\tstate.set_linear_velocity(lv)\n\t\n\tif (shoot_blend>0):\n\t\tshoot_blend -= delta * SHOOT_SCALE\n\t\tif (shoot_blend<0):\n\t\t\tshoot_blend=0\n\t\n\tif (shoot_attempt and not prev_shoot):\n\t\tshoot_blend = SHOOT_TIME\t\t\n\t\tvar bullet = preload(\"res://bullet.scn\").instance()\n\t\tbullet.set_transform( get_node(\"Armature/bullet\").get_global_transform().orthonormalized() )\n\t\tget_parent().add_child( bullet )\n\t\tbullet.set_linear_velocity( get_node(\"Armature/bullet\").get_global_transform().basis[2].normalized() * 20 )\n\t\tPS.body_add_collision_exception( bullet.get_rid(), get_rid() ) #add it to bullet\n\t\tget_node(\"sfx\").play(\"shoot\")\n\t\t\n\tprev_shoot = shoot_attempt\n\t\n\tif (onfloor):\n\t\tget_node(\"AnimationTreePlayer\").blend2_node_set_amount(\"walk\",hspeed / max_speed)\n\t\t\n\tget_node(\"AnimationTreePlayer\").transition_node_set_current(\"state\",anim)\n\tget_node(\"AnimationTreePlayer\").blend2_node_set_amount(\"gun\",min(shoot_blend,1.0))\n#\tstate.set_angular_velocity(Vector3())\t\n\t\n\t\n\n\nfunc _ready():\n\n\n\t# Initalization here\n\tget_node(\"AnimationTreePlayer\").set_active(true)\n\tpass\n\n\n" }, { "path": "src/test/resources/samples/langs/GDScript/pong.gd", "content": "\nextends Node2D\n\n# member variables here, example:\n# var a=2\n# var b=\"textvar\"\nconst INITIAL_BALL_SPEED = 80\nvar ball_speed = INITIAL_BALL_SPEED\nvar screen_size = Vector2(640,400)\n#default ball direction\nvar direction = Vector2(-1,0)\nvar pad_size = Vector2(8,32)\nconst PAD_SPEED = 150\n\n\nfunc _process(delta):\n\n\n\t# get ball positio and pad rectangles\n\tvar ball_pos = get_node(\"ball\").get_pos()\n\tvar left_rect = Rect2( get_node(\"left\").get_pos() - pad_size*0.5, pad_size )\n\tvar right_rect = Rect2( get_node(\"right\").get_pos() - pad_size*0.5, pad_size )\n\t\n\t#integrate new ball postion\n\tball_pos+=direction*ball_speed*delta\n\t\n\t#flip when touching roof or floor\n\tif ( (ball_pos.y<0 and direction.y <0) or (ball_pos.y>screen_size.y and direction.y>0)):\n\t\tdirection.y = -direction.y\n\t\t\n\t#flip, change direction and increase speed when touching pads\t\n\tif ( (left_rect.has_point(ball_pos) and direction.x < 0) or (right_rect.has_point(ball_pos) and direction.x > 0)):\n\t\tdirection.x=-direction.x\n\t\tball_speed*=1.1\n\t\tdirection.y=randf()*2.0-1\n\t\tdirection = direction.normalized()\n\n\t#check gameover\n\tif (ball_pos.x<0 or ball_pos.x>screen_size.x):\n\t\tball_pos=screen_size*0.5\n\t\tball_speed=INITIAL_BALL_SPEED\n\t\tdirection=Vector2(-1,0)\n\t\t\t\n\t\t\t\t\t\t\n\tget_node(\"ball\").set_pos(ball_pos)\n\n\t#move left pad\t\n\tvar left_pos = get_node(\"left\").get_pos()\n\t\n\tif (left_pos.y > 0 and Input.is_action_pressed(\"left_move_up\")):\n\t\tleft_pos.y+=-PAD_SPEED*delta\n\tif (left_pos.y < screen_size.y and Input.is_action_pressed(\"left_move_down\")):\n\t\tleft_pos.y+=PAD_SPEED*delta\n\t\t\n\tget_node(\"left\").set_pos(left_pos)\n\t\t\n\t#move right pad\t\n\tvar right_pos = get_node(\"right\").get_pos()\n\t\n\tif (right_pos.y > 0 and Input.is_action_pressed(\"right_move_up\")):\n\t\tright_pos.y+=-PAD_SPEED*delta\n\tif (right_pos.y < screen_size.y and Input.is_action_pressed(\"right_move_down\")):\n\t\tright_pos.y+=PAD_SPEED*delta\n\t\t\n\tget_node(\"right\").set_pos(right_pos)\n\t\n\t \n\nfunc _ready():\n\tscreen_size = get_viewport_rect().size # get actual size\n\tpad_size = get_node(\"left\").get_texture().get_size()\n\tset_process(true)\n\n" }, { "path": "src/test/resources/samples/langs/GLSL/SimpleLighting.gl2.frag", "content": "static const char* SimpleFragmentShader = STRINGIFY(\n\nvarying vec4 FrontColor;\n\nvoid main(void)\n{\n gl_FragColor = FrontColor;\n}\n);\n" }, { "path": "src/test/resources/samples/langs/GLSL/SyLens.glsl", "content": "#version 120\n\n/*\n Original Lens Distortion Algorithm from SSontech (Syntheyes)\n http://www.ssontech.com/content/lensalg.htm\n \n r2 is radius squared.\n \n r2 = image_aspect*image_aspect*u*u + v*v\n f = 1 + r2*(k + kcube*sqrt(r2))\n u' = f*u\n v' = f*v\n\n*/\n\n// Controls\nuniform float kCoeff, kCube, uShift, vShift;\nuniform float chroma_red, chroma_green, chroma_blue;\nuniform bool apply_disto;\n\n// Uniform inputs\nuniform sampler2D input1;\nuniform float adsk_input1_w, adsk_input1_h, adsk_input1_aspect, adsk_input1_frameratio;\nuniform float adsk_result_w, adsk_result_h;\n\nfloat distortion_f(float r) {\n float f = 1 + (r*r)*(kCoeff + kCube * r);\n return f;\n}\n\n\nfloat inverse_f(float r)\n{\n \n // Build a lookup table on the radius, as a fixed-size table.\n // We will use a vec3 since we will store the multipled number in the Z coordinate.\n // So to recap: x will be the radius, y will be the f(x) distortion, and Z will be x * y;\n vec3[48] lut;\n \n // Since out LUT is shader-global check if it's been computed alrite\n // Flame has no overflow bbox so we can safely max out at the image edge, plus some cushion\n float max_r = sqrt((adsk_input1_frameratio * adsk_input1_frameratio) + 1) + 0.1;\n float incr = max_r / 48;\n float lut_r = 0;\n float f;\n for(int i=0; i < 48; i++) {\n f = distortion_f(lut_r);\n lut[i] = vec3(lut_r, f, lut_r * f);\n lut_r += incr;\n }\n \n float t;\n // Now find the nehgbouring elements\n // only iterate to 46 since we will need\n // 47 as i+1\n for(int i=0; i < 47; i++) {\n if(lut[i].z < r && lut[i+1].z > r) {\n // BAM! our value is between these two segments\n // get the T interpolant and mix\n t = (r - lut[i].z) / (lut[i+1].z - lut[i]).z;\n return mix(lut[i].y, lut[i+1].y, t );\n }\n }\n}\n\nfloat aberrate(float f, float chroma)\n{\n return f + (f * chroma);\n}\n\nvec3 chromaticize_and_invert(float f)\n{\n vec3 rgb_f = vec3(aberrate(f, chroma_red), aberrate(f, chroma_green), aberrate(f, chroma_blue));\n // We need to DIVIDE by F when we redistort, and x / y == x * (1 / y)\n if(apply_disto) {\n rgb_f = 1 / rgb_f;\n }\n return rgb_f;\n}\n\nvoid main(void)\n{\n vec2 px, uv;\n float f = 1;\n float r = 1;\n \n px = gl_FragCoord.xy;\n \n // Make sure we are still centered\n px.x -= (adsk_result_w - adsk_input1_w) / 2;\n px.y -= (adsk_result_h - adsk_input1_h) / 2;\n \n // Push the destination coordinates into the [0..1] range\n uv.x = px.x / adsk_input1_w;\n uv.y = px.y / adsk_input1_h;\n \n \n // And to Syntheyes UV which are [1..-1] on both X and Y\n uv.x = (uv.x *2 ) - 1;\n uv.y = (uv.y *2 ) - 1;\n \n // Add UV shifts\n uv.x += uShift;\n uv.y += vShift;\n \n // Make the X value the aspect value, so that the X coordinates go to [-aspect..aspect]\n uv.x = uv.x * adsk_input1_frameratio;\n \n // Compute the radius\n r = sqrt(uv.x*uv.x + uv.y*uv.y);\n \n // If we are redistorting, account for the oversize plate in the input, assume that\n // the input aspect is the same\n if(apply_disto) {\n r = r / (float(adsk_input1_w) / float(adsk_result_w));\n }\n \n // Apply or remove disto, per channel honoring chromatic aberration\n if(apply_disto) {\n f = inverse_f(r);\n } else {\n f = distortion_f(r);\n }\n \n vec2[3] rgb_uvs = vec2[](uv, uv, uv);\n \n // Compute distortions per component\n vec3 rgb_f = chromaticize_and_invert(f);\n \n // Apply the disto coefficients, per component\n rgb_uvs[0] = rgb_uvs[0] * rgb_f.rr;\n rgb_uvs[1] = rgb_uvs[1] * rgb_f.gg;\n rgb_uvs[2] = rgb_uvs[2] * rgb_f.bb;\n \n // Convert all the UVs back to the texture space, per color component\n for(int i=0; i < 3; i++) {\n uv = rgb_uvs[i];\n \n // Back from [-aspect..aspect] to [-1..1]\n uv.x = uv.x / adsk_input1_frameratio;\n \n // Remove UV shifts\n uv.x -= uShift;\n uv.y -= vShift;\n \n // Back to OGL UV\n uv.x = (uv.x + 1) / 2;\n uv.y = (uv.y + 1) / 2;\n \n rgb_uvs[i] = uv;\n }\n \n // Sample the input plate, per component\n vec4 sampled;\n sampled.r = texture2D(input1, rgb_uvs[0]).r;\n sampled.g = texture2D(input1, rgb_uvs[1]).g;\n sampled.b = texture2D(input1, rgb_uvs[2]).b;\n \n // and assign to the output\n gl_FragColor.rgba = vec4(sampled.rgb, 1.0 );\n}" }, { "path": "src/test/resources/samples/langs/GLSL/SyLens.shader", "content": "#version 120\n\n/*\n Original Lens Distortion Algorithm from SSontech (Syntheyes)\n http://www.ssontech.com/content/lensalg.htm\n \n r2 is radius squared.\n \n r2 = image_aspect*image_aspect*u*u + v*v\n f = 1 + r2*(k + kcube*sqrt(r2))\n u' = f*u\n v' = f*v\n\n*/\n\n// Controls\nuniform float kCoeff, kCube, uShift, vShift;\nuniform float chroma_red, chroma_green, chroma_blue;\nuniform bool apply_disto;\n\n// Uniform inputs\nuniform sampler2D input1;\nuniform float adsk_input1_w, adsk_input1_h, adsk_input1_aspect, adsk_input1_frameratio;\nuniform float adsk_result_w, adsk_result_h;\n\nfloat distortion_f(float r) {\n float f = 1 + (r*r)*(kCoeff + kCube * r);\n return f;\n}\n\n\nfloat inverse_f(float r)\n{\n \n // Build a lookup table on the radius, as a fixed-size table.\n // We will use a vec3 since we will store the multipled number in the Z coordinate.\n // So to recap: x will be the radius, y will be the f(x) distortion, and Z will be x * y;\n vec3[48] lut;\n \n // Since out LUT is shader-global check if it's been computed alrite\n // Flame has no overflow bbox so we can safely max out at the image edge, plus some cushion\n float max_r = sqrt((adsk_input1_frameratio * adsk_input1_frameratio) + 1) + 0.1;\n float incr = max_r / 48;\n float lut_r = 0;\n float f;\n for(int i=0; i < 48; i++) {\n f = distortion_f(lut_r);\n lut[i] = vec3(lut_r, f, lut_r * f);\n lut_r += incr;\n }\n \n float t;\n // Now find the nehgbouring elements\n // only iterate to 46 since we will need\n // 47 as i+1\n for(int i=0; i < 47; i++) {\n if(lut[i].z < r && lut[i+1].z > r) {\n // BAM! our value is between these two segments\n // get the T interpolant and mix\n t = (r - lut[i].z) / (lut[i+1].z - lut[i]).z;\n return mix(lut[i].y, lut[i+1].y, t );\n }\n }\n}\n\nfloat aberrate(float f, float chroma)\n{\n return f + (f * chroma);\n}\n\nvec3 chromaticize_and_invert(float f)\n{\n vec3 rgb_f = vec3(aberrate(f, chroma_red), aberrate(f, chroma_green), aberrate(f, chroma_blue));\n // We need to DIVIDE by F when we redistort, and x / y == x * (1 / y)\n if(apply_disto) {\n rgb_f = 1 / rgb_f;\n }\n return rgb_f;\n}\n\nvoid main(void)\n{\n vec2 px, uv;\n float f = 1;\n float r = 1;\n \n px = gl_FragCoord.xy;\n \n // Make sure we are still centered\n px.x -= (adsk_result_w - adsk_input1_w) / 2;\n px.y -= (adsk_result_h - adsk_input1_h) / 2;\n \n // Push the destination coordinates into the [0..1] range\n uv.x = px.x / adsk_input1_w;\n uv.y = px.y / adsk_input1_h;\n \n \n // And to Syntheyes UV which are [1..-1] on both X and Y\n uv.x = (uv.x *2 ) - 1;\n uv.y = (uv.y *2 ) - 1;\n \n // Add UV shifts\n uv.x += uShift;\n uv.y += vShift;\n \n // Make the X value the aspect value, so that the X coordinates go to [-aspect..aspect]\n uv.x = uv.x * adsk_input1_frameratio;\n \n // Compute the radius\n r = sqrt(uv.x*uv.x + uv.y*uv.y);\n \n // If we are redistorting, account for the oversize plate in the input, assume that\n // the input aspect is the same\n if(apply_disto) {\n r = r / (float(adsk_input1_w) / float(adsk_result_w));\n }\n \n // Apply or remove disto, per channel honoring chromatic aberration\n if(apply_disto) {\n f = inverse_f(r);\n } else {\n f = distortion_f(r);\n }\n \n vec2[3] rgb_uvs = vec2[](uv, uv, uv);\n \n // Compute distortions per component\n vec3 rgb_f = chromaticize_and_invert(f);\n \n // Apply the disto coefficients, per component\n rgb_uvs[0] = rgb_uvs[0] * rgb_f.rr;\n rgb_uvs[1] = rgb_uvs[1] * rgb_f.gg;\n rgb_uvs[2] = rgb_uvs[2] * rgb_f.bb;\n \n // Convert all the UVs back to the texture space, per color component\n for(int i=0; i < 3; i++) {\n uv = rgb_uvs[i];\n \n // Back from [-aspect..aspect] to [-1..1]\n uv.x = uv.x / adsk_input1_frameratio;\n \n // Remove UV shifts\n uv.x -= uShift;\n uv.y -= vShift;\n \n // Back to OGL UV\n uv.x = (uv.x + 1) / 2;\n uv.y = (uv.y + 1) / 2;\n \n rgb_uvs[i] = uv;\n }\n \n // Sample the input plate, per component\n vec4 sampled;\n sampled.r = texture2D(input1, rgb_uvs[0]).r;\n sampled.g = texture2D(input1, rgb_uvs[1]).g;\n sampled.b = texture2D(input1, rgb_uvs[2]).b;\n \n // and assign to the output\n gl_FragColor.rgba = vec4(sampled.rgb, 1.0 );\n}" }, { "path": "src/test/resources/samples/langs/GLSL/gbuffers_textured_lit.fsh", "content": "#version 120\n\nuniform sampler2D texture;\n\nvarying vec3 color;\nvarying vec2 texcoord;\n\nvec4 GetDiffuse() {\n\tvec4 diffuse = vec4(color.rgb, 1.0);\n\t diffuse *= texture2D(texture, texcoord);\n\t\n\treturn diffuse;\n}\n\n\nvoid main() {\n\tvec4 diffuse = GetDiffuse();\n\t\n\tgl_FragData[0] = diffuse;\n}" }, { "path": "src/test/resources/samples/langs/GLSL/gbuffers_textured_lit.vsh", "content": "#version 120\n\nvarying vec3 color;\nvarying vec2 texcoord;\n\nvoid main() {\n\tcolor = gl_Color.rgb;\n\ttexcoord = gl_MultiTexCoord0.st;\n\t\n\tgl_Position = ftransform();\n}" }, { "path": "src/test/resources/samples/langs/GLSL/islandScene.glsl", "content": "//// High quality (Some browsers may freeze or crash)\n//#define HIGHQUALITY\n\n//// Medium quality (Should be fine on all systems, works on Intel HD2000 on Win7 but quite slow)\n//#define MEDIUMQUALITY\n\n//// Defaults\n//#define REFLECTIONS\n#define SHADOWS\n//#define GRASS\n//#define SMALL_WAVES\n#define RAGGED_LEAVES\n//#define DETAILED_NOISE\n//#define LIGHT_AA // 2 sample SSAA\n//#define HEAVY_AA // 2x2 RG SSAA\n//#define TONEMAP\n\n//// Configurations\n#ifdef MEDIUMQUALITY\n\t#define SHADOWS\n\t#define SMALL_WAVES\n\t#define RAGGED_LEAVES\n\t#define TONEMAP\n#endif\n\n#ifdef HIGHQUALITY\n\t#define REFLECTIONS\n\t#define SHADOWS\n\t//#define GRASS\n\t#define SMALL_WAVES\n\t#define RAGGED_LEAVES\n\t#define DETAILED_NOISE\n\t#define LIGHT_AA\n\t#define TONEMAP\n#endif\n\n// Constants\nconst float eps = 1e-5;\nconst float PI = 3.14159265359;\n\nconst vec3 sunDir = vec3(0.79057,-0.47434, 0.0);\nconst vec3 skyCol = vec3(0.3, 0.5, 0.8);\nconst vec3 sandCol = vec3(0.9, 0.8, 0.5);\nconst vec3 treeCol = vec3(0.8, 0.65, 0.3);\nconst vec3 grassCol = vec3(0.4, 0.5, 0.18);\nconst vec3 leavesCol = vec3(0.3, 0.6, 0.2);\nconst vec3 leavesPos = vec3(-5.1,13.4, 0.0);\n\n#ifdef TONEMAP\nconst vec3 sunCol = vec3(1.8, 1.7, 1.6);\n#else\nconst vec3 sunCol = vec3(0.9, 0.85, 0.8);\n#endif\n\nconst float exposure = 1.1; // Only used when tonemapping\n\n// Description : Array and textureless GLSL 2D/3D/4D simplex\n// noise functions.\n// Author : Ian McEwan, Ashima Arts.\n// License : Copyright (C) 2011 Ashima Arts. All rights reserved.\n// Distributed under the MIT License. See LICENSE file.\n// https://github.com/ashima/webgl-noise\nvec3 mod289(vec3 x) {\n return x - floor(x * (1.0 / 289.0)) * 289.0;\n}\n\nvec4 mod289(vec4 x) {\n return x - floor(x * (1.0 / 289.0)) * 289.0;\n}\n\nvec4 permute(vec4 x) {\n return mod289(((x*34.0)+1.0)*x);\n}\n\nvec4 taylorInvSqrt(vec4 r) {\n return 1.79284291400159 - 0.85373472095314 * r;\n}\n\nfloat snoise(vec3 v) {\n const vec2 C = vec2(1.0/6.0, 1.0/3.0) ;\n const vec4 D = vec4(0.0, 0.5, 1.0, 2.0);\n\n// First corner\n vec3 i = floor(v + dot(v, C.yyy) );\n vec3 x0 = v - i + dot(i, C.xxx) ;\n\n// Other corners\n vec3 g = step(x0.yzx, x0.xyz);\n vec3 l = 1.0 - g;\n vec3 i1 = min( g.xyz, l.zxy );\n vec3 i2 = max( g.xyz, l.zxy );\n\n // x0 = x0 - 0.0 + 0.0 * C.xxx;\n // x1 = x0 - i1 + 1.0 * C.xxx;\n // x2 = x0 - i2 + 2.0 * C.xxx;\n // x3 = x0 - 1.0 + 3.0 * C.xxx;\n vec3 x1 = x0 - i1 + C.xxx;\n vec3 x2 = x0 - i2 + C.yyy; // 2.0*C.x = 1/3 = C.y\n vec3 x3 = x0 - D.yyy; // -1.0+3.0*C.x = -0.5 = -D.y\n\n// Permutations\n i = mod289(i);\n vec4 p = permute( permute( permute(\n i.z + vec4(0.0, i1.z, i2.z, 1.0 ))\n + i.y + vec4(0.0, i1.y, i2.y, 1.0 ))\n + i.x + vec4(0.0, i1.x, i2.x, 1.0 ));\n\n// Gradients: 7x7 points over a square, mapped onto an octahedron.\n// The ring size 17*17 = 289 is close to a multiple of 49 (49*6 = 294)\n float n_ = 0.142857142857; // 1.0/7.0\n vec3 ns = n_ * D.wyz - D.xzx;\n\n vec4 j = p - 49.0 * floor(p * ns.z * ns.z); // mod(p,7*7)\n\n vec4 x_ = floor(j * ns.z);\n vec4 y_ = floor(j - 7.0 * x_ ); // mod(j,N)\n\n vec4 x = x_ *ns.x + ns.yyyy;\n vec4 y = y_ *ns.x + ns.yyyy;\n vec4 h = 1.0 - abs(x) - abs(y);\n\n vec4 b0 = vec4( x.xy, y.xy );\n vec4 b1 = vec4( x.zw, y.zw );\n\n //vec4 s0 = vec4(lessThan(b0,0.0))*2.0 - 1.0;\n //vec4 s1 = vec4(lessThan(b1,0.0))*2.0 - 1.0;\n vec4 s0 = floor(b0)*2.0 + 1.0;\n vec4 s1 = floor(b1)*2.0 + 1.0;\n vec4 sh = -step(h, vec4(0.0));\n\n vec4 a0 = b0.xzyw + s0.xzyw*sh.xxyy ;\n vec4 a1 = b1.xzyw + s1.xzyw*sh.zzww ;\n\n vec3 p0 = vec3(a0.xy,h.x);\n vec3 p1 = vec3(a0.zw,h.y);\n vec3 p2 = vec3(a1.xy,h.z);\n vec3 p3 = vec3(a1.zw,h.w);\n\n//Normalise gradients\n vec4 norm = taylorInvSqrt(vec4(dot(p0,p0), dot(p1,p1), dot(p2, p2), dot(p3,p3)));\n p0 *= norm.x;\n p1 *= norm.y;\n p2 *= norm.z;\n p3 *= norm.w;\n\n// Mix final noise value\n vec4 m = max(0.6 - vec4(dot(x0,x0), dot(x1,x1), dot(x2,x2), dot(x3,x3)), 0.0);\n m = m * m;\n return 42.0 * dot( m*m, vec4( dot(p0,x0), dot(p1,x1),\n dot(p2,x2), dot(p3,x3) ) );\n}\n\n\n\n// Main\nfloat fbm(vec3 p)\n{\n\tfloat final = snoise(p); \n\tp *= 1.94; final += snoise(p) * 0.5;\n\t#ifdef DETAILED_NOISE\n\tp *= 3.75; final += snoise(p) * 0.25;\n\treturn final / 1.75;\n\t#else\n\treturn final / 1.5;\n\t#endif\n}\n\nfloat waterHeight(vec3 p)\n{\n\tfloat d = length(p.xz);\n\tfloat h = sin(d * 1.5 + iGlobalTime * 3.0) * 12.0 / d; // Island waves\n\t#ifdef SMALL_WAVES\n\th += fbm(p*0.5); // Other waves\n\t#endif\n\treturn h;\n}\n\nvec3 bump(vec3 pos, vec3 rayDir)\n{\n\tfloat s = 2.0;\n\t\n\t// Fade out waves to reduce aliasing\n\tfloat dist = dot(pos, rayDir);\n\ts *= dist < 2.0 ? 1.0 : 1.4142 / sqrt(dist);\n\t\n\t// Calculate normal from heightmap\n\tvec2 e = vec2(1e-2, 0.0);\n\tvec3 p = vec3(pos.x, iGlobalTime*0.5, pos.z)*0.7;\n\tfloat m = waterHeight(p)*s;\n\treturn normalize(vec3(\n\t\twaterHeight(p+e.xyy)*s-m,\n\t\t1.0,\n\t\twaterHeight(p+e.yxy)*s-m\n\t));\n}\n\n// Ray intersections\nvec4 intersectSphere(vec3 rpos, vec3 rdir, vec3 pos, float rad)\n{\n\tvec3 op = pos - rpos;\n\tfloat b = dot(op, rdir); \n\tfloat det = b*b - dot(op, op) + rad*rad; \n\t\t\n\tif (det > 0.0)\n\t{\n\t\tdet = sqrt(det);\n\t\tfloat t = b - det;\n\t\tif (t > eps)\n\t\t\treturn vec4(-normalize(rpos+rdir*t-pos), t);\n\t}\n\t\n\treturn vec4(0.0);\n}\n\nvec4 intersectCylinder(vec3 rpos, vec3 rdir, vec3 pos, float rad)\n{\n\tvec3 op = pos - rpos;\n\tvec2 rdir2 = normalize(rdir.yz);\n\tfloat b = dot(op.yz, rdir2);\n\tfloat det = b*b - dot(op.yz, op.yz) + rad*rad; \n\t\n\tif (det > 0.0)\n\t{\n\t\tdet = sqrt(det);\n\t\tfloat t = b - det;\n\t\tif (t > eps)\n\t\t\treturn vec4(-normalize(rpos.yz+rdir2*t-pos.yz), 0.0, t);\n\t\tt = b + det;\n\t\tif (t > eps)\n\t\t\treturn vec4(-normalize(rpos.yz+rdir2*t-pos.yz), 0.0, t);\n\t}\n\t\n\treturn vec4(0.0);\n}\n\nvec4 intersectPlane(vec3 rayPos, vec3 rayDir, vec3 n, float d)\n{\n\tfloat t = -(dot(rayPos, n) + d) / dot(rayDir, n);\n\treturn vec4(n * sign(dot(rayDir, n)), t);\n}\n\n// Helper functions\nvec3 rotate(vec3 p, float theta)\n{\n\tfloat c = cos(theta), s = sin(theta);\n\treturn vec3(p.x * c + p.z * s, p.y,\n\t\t\t\tp.z * c - p.x * s);\n}\n\nfloat impulse(float k, float x) // by iq\n{\n float h = k*x;\n return h * exp(1.0 - h);\n}\n\n// Raymarched parts of scene\nfloat grass(vec3 pos)\n{\n\tfloat h = length(pos - vec3(0.0, -7.0, 0.0)) - 8.0;\n\t\n\tif (h > 2.0) return h; // Optimization (Avoid noise if too far away)\n\t\n\treturn h + snoise(pos * 3.0) * 0.1 + pos.y * 0.9;\n}\n\nfloat tree(vec3 pos)\n{\n\tpos.y -= 0.5;\n\tfloat s = sin(pos.y*0.03);\n\tfloat c = cos(pos.y*0.03);\n\tmat2 m = mat2(c, -s, s, c);\n\tvec3 p = vec3(m*pos.xy, pos.z);\n\t\n\tfloat width = 1.0 - pos.y * 0.02 - clamp(sin(pos.y * 8.0) * 0.1, 0.05, 0.1);\n\t\n\treturn max(length(p.xz) - width, pos.y - 12.5);\n}\n\nvec2 scene(vec3 pos)\n{\n\tfloat vtree = tree(pos);\n\t#ifdef GRASS\n\tfloat vgrass = grass(pos);\n\tfloat v = min(vtree, vgrass);\n\t#else\n\tfloat v = vtree;\n\t#endif\n\treturn vec2(v, v == vtree ? 2.0 : 1.0);\n}\n\nvec3 normal(vec3 pos)\n{\n\tvec2 eps = vec2(1e-3, 0.0);\n\tfloat h = scene(pos).x;\n\treturn normalize(vec3(\n\t\tscene(pos-eps.xyy).x-h,\n\t\tscene(pos-eps.yxy).x-h,\n\t\tscene(pos-eps.yyx).x-h\n\t));\n}\n\nfloat plantsShadow(vec3 rayPos, vec3 rayDir)\n{\n\t// Soft shadow taken from iq\n\tfloat k = 6.0;\n\tfloat t = 0.0;\n\tfloat s = 1.0;\t\n\tfor (int i = 0; i < 30; i++)\n\t{\n\t\tvec3 pos = rayPos+rayDir*t;\t\n\t\tvec2 res = scene(pos);\t\t\n\t\tif (res.x < 0.001) return 0.0;\n\t\ts = min(s, k*res.x/t); \n\t\tt += max(res.x, 0.01);\n\t}\n\t\n\treturn s*s*(3.0 - 2.0*s);\n}\n\n// Ray-traced parts of scene\nvec4 intersectWater(vec3 rayPos, vec3 rayDir)\n{\n\tfloat h = sin(20.5 + iGlobalTime * 2.0) * 0.03;\n\tfloat t = -(rayPos.y + 2.5 + h) / rayDir.y;\n\treturn vec4(0.0, 1.0, 0.0, t);\n}\n\nvec4 intersectSand(vec3 rayPos, vec3 rayDir)\n{\n\treturn intersectSphere(rayPos, rayDir, vec3(0.0,-24.1,0.0), 24.1);\n}\n\nvec4 intersectTreasure(vec3 rayPos, vec3 rayDir)\n{\n\treturn vec4(0.0);\n}\n\nvec4 intersectLeaf(vec3 rayPos, vec3 rayDir, float openAmount)\n{\t\n\tvec3 dir = normalize(vec3(0.0, 1.0, openAmount));\n\tfloat offset = 0.0;\n\t\t\t\n\tvec4 res = intersectPlane(rayPos, rayDir, dir, 0.0);\n\tvec3 pos = rayPos+rayDir*res.w;\n\t#ifdef RAGGED_LEAVES\n\toffset = snoise(pos*0.8) * 0.3;\n\t#endif\n\tif (pos.y > 0.0 || length(pos * vec3(0.9, 2.0, 1.0)) > 4.0 - offset) res.w = 0.0;\n\t\n\tvec4 res2 = intersectPlane(rayPos, rayDir, vec3(dir.xy, -dir.z), 0.0);\n\tpos = rayPos+rayDir*res2.w;\n\t#ifdef RAGGED_LEAVES\n\toffset = snoise(pos*0.8) * 0.3;\n\t#endif\n\tif (pos.y > 0.0 || length(pos * vec3(0.9, 2.0, 1.0)) > 4.0 - offset) res2.w = 0.0;\n\t\n\tif (res2.w > 0.0 && res2.w < res.w || res.w <= 0.0)\n\t\tres = res2;\n\t\t\n\treturn res;\n}\n\nvec4 leaves(vec3 rayPos, vec3 rayDir)\n{\n\tfloat t = 1e20;\n\tvec3 n = vec3(0.0);\n\t\n\trayPos -= leavesPos;\n\t\n\tfloat sway = impulse(15.0, fract(iGlobalTime / PI * 0.125));\n\tfloat upDownSway = sway * -sin(iGlobalTime) * 0.06;\n\tfloat openAmount = sway * max(-cos(iGlobalTime) * 0.4, 0.0);\n\t\n\tfloat angleOffset = -0.1;\t\n\tfor (float k = 0.0; k < 6.2; k += 0.75)\n\t{\n\t\t// Left-right\n\t\tfloat alpha = k + (k - PI) * sway * 0.015;\n\t\tvec3 p = rotate(rayPos, alpha);\n\t\tvec3 d = rotate(rayDir, alpha);\n\t\t\n\t\t// Up-down\n\t\tangleOffset *= -1.0;\n\t\tfloat theta = -0.4 + \n\t\t\tangleOffset + \n\t\t\tcos(k) * 0.35 + \n\t\t\tupDownSway + \n\t\t\tsin(iGlobalTime+k*10.0) * 0.03 * (sway + 0.2);\n\t\t\n\t\tp = rotate(p.xzy, theta).xzy;\n\t\td = rotate(d.xzy, theta).xzy;\n\t\n\t\t// Shift\n\t\tp -= vec3(5.4, 0.0, 0.0);\n\t\t\n\t\t// Intersect individual leaf\n\t\tvec4 res = intersectLeaf(p, d, 1.0+openAmount);\n\t\tif (res.w > 0.0 && res.w < t)\n\t\t{\n\t\t\tt = res.w;\n\t\t\tn = res.xyz;\n\t\t}\n\t}\n\t\n\treturn vec4(n, t);\n}\n\n// Lighting\nfloat shadow(vec3 rayPos, vec3 rayDir)\n{\t\n\tfloat s = 1.0;\n\t\n\t// Intersect sand\n\t//vec4 resSand = intersectSand(rayPos, rayDir);\n\t//if (resSand.w > 0.0) return 0.0;\n\t\n\t// Intersect plants\n\ts = min(s, plantsShadow(rayPos, rayDir));\n\tif (s < 0.0001) return 0.0;\n\t\n\t// Intersect leaves\n\tvec4 resLeaves = leaves(rayPos, rayDir);\n\tif (resLeaves.w > 0.0 && resLeaves.w < 1e7) return 0.0;\n\t\n\treturn s;\n}\n\nvec3 light(vec3 p, vec3 n)\n{\n\tfloat s = 1.0;\n\t\n\t#ifdef SHADOWS\n\ts = shadow(p-sunDir*0.01, -sunDir);\n\t#endif\n\t\n\tvec3 col = sunCol * min(max(dot(n, sunDir), 0.0), s);\n\tcol += skyCol * (-n.y * 0.5 + 0.5) * 0.3;\n\treturn col;\n}\n\nvec3 lightLeaves(vec3 p, vec3 n)\n{\n\tfloat s = 1.0;\n\t\n\t#ifdef SHADOWS\n\ts = shadow(p-sunDir*0.01, -sunDir);\n\t#endif\n\t\n\tfloat ao = min(length(p - leavesPos) * 0.1, 1.0);\n\t\n\tfloat ns = dot(n, sunDir);\n\tfloat d = sqrt(max(ns, 0.0));\n\tvec3 col = sunCol * min(d, s);\n\tcol += sunCol * max(-ns, 0.0) * vec3(0.3, 0.3, 0.1) * ao;\n\tcol += skyCol * (-n.y * 0.5 + 0.5) * 0.3 * ao;\n\treturn col;\n}\n\nvec3 sky(vec3 n)\n{\n\treturn skyCol * (1.0 - n.y * 0.8);\n}\n\n// Ray-marching\nvec4 plants(vec3 rayPos, vec3 rayDir)\n{\n\tfloat t = 0.0;\n\t\n\tfor (int i = 0; i < 40; i++)\n\t{\n\t\tvec3 pos = rayPos+rayDir*t;\t\n\t\tvec2 res = scene(pos);\n\t\tfloat h = res.x;\n\t\t\n\t\tif (h < 0.001)\n\t\t{\n\t\t\tvec3 col = res.y == 2.0 ? treeCol : grassCol;\n\t\t\tfloat uvFact = res.y == 2.0 ? 1.0 : 10.0;\n\t\t\t\n\t\t\tvec3 n = normal(pos);\n\t\t\tvec2 uv = vec2(n.x, pos.y * 0.5) * 0.2 * uvFact;\n\t\t\tvec3 tex = texture2D(iChannel0, uv).rgb * 0.6 + 0.4;\n\t\t\tfloat ao = min(length(pos - leavesPos) * 0.1, 1.0);\n\t\t\treturn vec4(col * light(pos, n) * ao * tex, t);\n\t\t}\n\t\t\n\t\tt += h;\n\t}\n\t\n\treturn vec4(sky(rayDir), 1e8);\n}\n\n// Final combination\nvec3 traceReflection(vec3 rayPos, vec3 rayDir)\n{\n\tvec3 col = vec3(0.0);\n\tfloat t = 1e20;\n\t\t\t\n\t// Intersect plants\n\tvec4 resPlants = plants(rayPos, rayDir);\n\tif (resPlants.w > 0.0 && resPlants.w < t)\n\t{\n\t\tt = resPlants.w;\n\t\tcol = resPlants.xyz;\n\t}\n\t\n\t// Intersect leaves\n\tvec4 resLeaves = leaves(rayPos, rayDir);\n\tif (resLeaves.w > 0.0 && resLeaves.w < t)\n\t{\n\t\tvec3 pos = rayPos + rayDir * resLeaves.w;\n\t\tvec2 uv = (pos.xz - leavesPos.xz) * 0.3;\n\t\tfloat tex = texture2D(iChannel0, uv).r * 0.6 + 0.5;\n\t\t\n\t\tt = resLeaves.w;\n\t\tcol = leavesCol * lightLeaves(pos, resLeaves.xyz) * tex;\n\t}\n\t\t\n\tif (t > 1e7) return sky(rayDir);\n\t\n\treturn col;\n}\n\nvec3 trace(vec3 rayPos, vec3 rayDir)\n{\n\tvec3 col = vec3(0.0);\n\tfloat t = 1e20;\n\t\n\t// Intersect sand\n\tvec4 resSand = intersectSand(rayPos, rayDir);\n\tif (resSand.w > 0.0)\n\t{\n\t\tvec3 pos = rayPos + rayDir * resSand.w;\n\t\tt = resSand.w;\n\n\t\tcol = sandCol * light(pos, resSand.xyz);\n\t}\n\t\n\t// Intersect treasure chest\n\tvec4 resTreasure = intersectTreasure(rayPos, rayDir);\n\tif (resTreasure.w > 0.0 && resTreasure.w < t)\n\t{\n\t\tvec3 pos = rayPos + rayDir * resTreasure.w;\n\t\tt = resTreasure.w;\n\t\tcol = leavesCol * light(pos, resTreasure.xyz);\n\t}\n\t\n\t// Intersect leaves\n\tvec4 resLeaves = leaves(rayPos, rayDir);\n\tif (resLeaves.w > 0.0 && resLeaves.w < t)\n\t{\n\t\tvec3 pos = rayPos + rayDir * resLeaves.w;\n\t\tvec2 uv = (pos.xz - leavesPos.xz) * 0.3;\n\t\tfloat tex = texture2D(iChannel0, uv).r * 0.6 + 0.5;\n\t\t\n\t\tt = resLeaves.w;\n\t\tcol = leavesCol * lightLeaves(pos, resLeaves.xyz) * tex;\n\t}\n\t\n\t// Intersect plants\n\tvec4 resPlants = plants(rayPos, rayDir);\n\tif (resPlants.w > 0.0 && resPlants.w < t)\n\t{\n\t\tt = resPlants.w;\n\t\tcol = resPlants.xyz;\n\t}\n\t\t\n\t// Intersect water\t\n\tvec4 resWater = intersectWater(rayPos, rayDir);\n\tif (resWater.w > 0.0 && resWater.w < t)\n\t{\n\t\tvec3 pos = rayPos + rayDir * resWater.w;\n\t\tfloat dist = t - resWater.w;\n\t\tvec3 n = bump(pos, rayDir);\n\t\t\n\t\tfloat ct = -min(dot(n,rayDir), 0.0);\n\t\tfloat fresnel = 0.9 - 0.9 * pow(1.0 - ct, 5.0);\n\t\t\n\t\tvec3 trans = col * exp(-dist * vec3(1.0, 0.7, 0.4) * 3.0);\n\t\tvec3 reflDir = normalize(reflect(rayDir, n));\n\t\tvec3 refl = sky(reflDir);\n\t\t\n\t\t#ifdef REFLECTIONS\n\t\tif (dot(pos, rayDir) < -2.0)\n\t\t\trefl = traceReflection(pos, reflDir).rgb;\n\t\t#endif\n\t\t\t\t\n\t\tt = resWater.t;\n\t\tcol = mix(refl, trans, fresnel);\n\t}\n\t\n\tif (t > 1e7) return sky(rayDir);\n\t\n\treturn col;\n}\n\n// Ray-generation\nvec3 camera(vec2 px)\n{\n\tvec2 rd = (px / iResolution.yy - vec2(iResolution.x/iResolution.y*0.5-0.5, 0.0)) * 2.0 - 1.0;\n\tfloat t = sin(iGlobalTime * 0.1) * 0.2;\n\tvec3 rayDir = normalize(vec3(rd.x, rd.y, 1.0));\n\tvec3 rayPos = vec3(0.0, 3.0, -18.0);\n\treturn trace(rayPos, rayDir);\n}\n\nvoid main(void)\n{\n\t#ifdef HEAVY_AA\n\t\tvec3 col = camera(gl_FragCoord.xy+vec2(0.0,0.5))*0.25;\n\t\tcol += camera(gl_FragCoord.xy+vec2(0.25,0.0))*0.25;\n\t\tcol += camera(gl_FragCoord.xy+vec2(0.5,0.75))*0.25;\n\t\tcol += camera(gl_FragCoord.xy+vec2(0.75,0.25))*0.25;\n\t#else\n\t\tvec3 col = camera(gl_FragCoord.xy);\n\t\t#ifdef LIGHT_AA\n\t\t\tcol = col * 0.5 + camera(gl_FragCoord.xy+vec2(0.5,0.5))*0.5;\n\t\t#endif\n\t#endif\n\t\n\t#ifdef TONEMAP\n\t// Optimized Haarm-Peter Duiker’s curve\n\tvec3 x = max(vec3(0.0),col*exposure-0.004);\n\tcol = (x*(6.2*x+.5))/(x*(6.2*x+1.7)+0.06);\n\t#else\n\tcol = pow(col, vec3(0.4545));\n\t#endif\n\t\n\tgl_FragColor = vec4(col, 1.0);\n}" }, { "path": "src/test/resources/samples/langs/GLSL/islandScene.shader", "content": "//// High quality (Some browsers may freeze or crash)\n//#define HIGHQUALITY\n\n//// Medium quality (Should be fine on all systems, works on Intel HD2000 on Win7 but quite slow)\n//#define MEDIUMQUALITY\n\n//// Defaults\n//#define REFLECTIONS\n#define SHADOWS\n//#define GRASS\n//#define SMALL_WAVES\n#define RAGGED_LEAVES\n//#define DETAILED_NOISE\n//#define LIGHT_AA // 2 sample SSAA\n//#define HEAVY_AA // 2x2 RG SSAA\n//#define TONEMAP\n\n//// Configurations\n#ifdef MEDIUMQUALITY\n\t#define SHADOWS\n\t#define SMALL_WAVES\n\t#define RAGGED_LEAVES\n\t#define TONEMAP\n#endif\n\n#ifdef HIGHQUALITY\n\t#define REFLECTIONS\n\t#define SHADOWS\n\t//#define GRASS\n\t#define SMALL_WAVES\n\t#define RAGGED_LEAVES\n\t#define DETAILED_NOISE\n\t#define LIGHT_AA\n\t#define TONEMAP\n#endif\n\n// Constants\nconst float eps = 1e-5;\nconst float PI = 3.14159265359;\n\nconst vec3 sunDir = vec3(0.79057,-0.47434, 0.0);\nconst vec3 skyCol = vec3(0.3, 0.5, 0.8);\nconst vec3 sandCol = vec3(0.9, 0.8, 0.5);\nconst vec3 treeCol = vec3(0.8, 0.65, 0.3);\nconst vec3 grassCol = vec3(0.4, 0.5, 0.18);\nconst vec3 leavesCol = vec3(0.3, 0.6, 0.2);\nconst vec3 leavesPos = vec3(-5.1,13.4, 0.0);\n\n#ifdef TONEMAP\nconst vec3 sunCol = vec3(1.8, 1.7, 1.6);\n#else\nconst vec3 sunCol = vec3(0.9, 0.85, 0.8);\n#endif\n\nconst float exposure = 1.1; // Only used when tonemapping\n\n// Description : Array and textureless GLSL 2D/3D/4D simplex\n// noise functions.\n// Author : Ian McEwan, Ashima Arts.\n// License : Copyright (C) 2011 Ashima Arts. All rights reserved.\n// Distributed under the MIT License. See LICENSE file.\n// https://github.com/ashima/webgl-noise\nvec3 mod289(vec3 x) {\n return x - floor(x * (1.0 / 289.0)) * 289.0;\n}\n\nvec4 mod289(vec4 x) {\n return x - floor(x * (1.0 / 289.0)) * 289.0;\n}\n\nvec4 permute(vec4 x) {\n return mod289(((x*34.0)+1.0)*x);\n}\n\nvec4 taylorInvSqrt(vec4 r) {\n return 1.79284291400159 - 0.85373472095314 * r;\n}\n\nfloat snoise(vec3 v) {\n const vec2 C = vec2(1.0/6.0, 1.0/3.0) ;\n const vec4 D = vec4(0.0, 0.5, 1.0, 2.0);\n\n// First corner\n vec3 i = floor(v + dot(v, C.yyy) );\n vec3 x0 = v - i + dot(i, C.xxx) ;\n\n// Other corners\n vec3 g = step(x0.yzx, x0.xyz);\n vec3 l = 1.0 - g;\n vec3 i1 = min( g.xyz, l.zxy );\n vec3 i2 = max( g.xyz, l.zxy );\n\n // x0 = x0 - 0.0 + 0.0 * C.xxx;\n // x1 = x0 - i1 + 1.0 * C.xxx;\n // x2 = x0 - i2 + 2.0 * C.xxx;\n // x3 = x0 - 1.0 + 3.0 * C.xxx;\n vec3 x1 = x0 - i1 + C.xxx;\n vec3 x2 = x0 - i2 + C.yyy; // 2.0*C.x = 1/3 = C.y\n vec3 x3 = x0 - D.yyy; // -1.0+3.0*C.x = -0.5 = -D.y\n\n// Permutations\n i = mod289(i);\n vec4 p = permute( permute( permute(\n i.z + vec4(0.0, i1.z, i2.z, 1.0 ))\n + i.y + vec4(0.0, i1.y, i2.y, 1.0 ))\n + i.x + vec4(0.0, i1.x, i2.x, 1.0 ));\n\n// Gradients: 7x7 points over a square, mapped onto an octahedron.\n// The ring size 17*17 = 289 is close to a multiple of 49 (49*6 = 294)\n float n_ = 0.142857142857; // 1.0/7.0\n vec3 ns = n_ * D.wyz - D.xzx;\n\n vec4 j = p - 49.0 * floor(p * ns.z * ns.z); // mod(p,7*7)\n\n vec4 x_ = floor(j * ns.z);\n vec4 y_ = floor(j - 7.0 * x_ ); // mod(j,N)\n\n vec4 x = x_ *ns.x + ns.yyyy;\n vec4 y = y_ *ns.x + ns.yyyy;\n vec4 h = 1.0 - abs(x) - abs(y);\n\n vec4 b0 = vec4( x.xy, y.xy );\n vec4 b1 = vec4( x.zw, y.zw );\n\n //vec4 s0 = vec4(lessThan(b0,0.0))*2.0 - 1.0;\n //vec4 s1 = vec4(lessThan(b1,0.0))*2.0 - 1.0;\n vec4 s0 = floor(b0)*2.0 + 1.0;\n vec4 s1 = floor(b1)*2.0 + 1.0;\n vec4 sh = -step(h, vec4(0.0));\n\n vec4 a0 = b0.xzyw + s0.xzyw*sh.xxyy ;\n vec4 a1 = b1.xzyw + s1.xzyw*sh.zzww ;\n\n vec3 p0 = vec3(a0.xy,h.x);\n vec3 p1 = vec3(a0.zw,h.y);\n vec3 p2 = vec3(a1.xy,h.z);\n vec3 p3 = vec3(a1.zw,h.w);\n\n//Normalise gradients\n vec4 norm = taylorInvSqrt(vec4(dot(p0,p0), dot(p1,p1), dot(p2, p2), dot(p3,p3)));\n p0 *= norm.x;\n p1 *= norm.y;\n p2 *= norm.z;\n p3 *= norm.w;\n\n// Mix final noise value\n vec4 m = max(0.6 - vec4(dot(x0,x0), dot(x1,x1), dot(x2,x2), dot(x3,x3)), 0.0);\n m = m * m;\n return 42.0 * dot( m*m, vec4( dot(p0,x0), dot(p1,x1),\n dot(p2,x2), dot(p3,x3) ) );\n}\n\n\n\n// Main\nfloat fbm(vec3 p)\n{\n\tfloat final = snoise(p); \n\tp *= 1.94; final += snoise(p) * 0.5;\n\t#ifdef DETAILED_NOISE\n\tp *= 3.75; final += snoise(p) * 0.25;\n\treturn final / 1.75;\n\t#else\n\treturn final / 1.5;\n\t#endif\n}\n\nfloat waterHeight(vec3 p)\n{\n\tfloat d = length(p.xz);\n\tfloat h = sin(d * 1.5 + iGlobalTime * 3.0) * 12.0 / d; // Island waves\n\t#ifdef SMALL_WAVES\n\th += fbm(p*0.5); // Other waves\n\t#endif\n\treturn h;\n}\n\nvec3 bump(vec3 pos, vec3 rayDir)\n{\n\tfloat s = 2.0;\n\t\n\t// Fade out waves to reduce aliasing\n\tfloat dist = dot(pos, rayDir);\n\ts *= dist < 2.0 ? 1.0 : 1.4142 / sqrt(dist);\n\t\n\t// Calculate normal from heightmap\n\tvec2 e = vec2(1e-2, 0.0);\n\tvec3 p = vec3(pos.x, iGlobalTime*0.5, pos.z)*0.7;\n\tfloat m = waterHeight(p)*s;\n\treturn normalize(vec3(\n\t\twaterHeight(p+e.xyy)*s-m,\n\t\t1.0,\n\t\twaterHeight(p+e.yxy)*s-m\n\t));\n}\n\n// Ray intersections\nvec4 intersectSphere(vec3 rpos, vec3 rdir, vec3 pos, float rad)\n{\n\tvec3 op = pos - rpos;\n\tfloat b = dot(op, rdir); \n\tfloat det = b*b - dot(op, op) + rad*rad; \n\t\t\n\tif (det > 0.0)\n\t{\n\t\tdet = sqrt(det);\n\t\tfloat t = b - det;\n\t\tif (t > eps)\n\t\t\treturn vec4(-normalize(rpos+rdir*t-pos), t);\n\t}\n\t\n\treturn vec4(0.0);\n}\n\nvec4 intersectCylinder(vec3 rpos, vec3 rdir, vec3 pos, float rad)\n{\n\tvec3 op = pos - rpos;\n\tvec2 rdir2 = normalize(rdir.yz);\n\tfloat b = dot(op.yz, rdir2);\n\tfloat det = b*b - dot(op.yz, op.yz) + rad*rad; \n\t\n\tif (det > 0.0)\n\t{\n\t\tdet = sqrt(det);\n\t\tfloat t = b - det;\n\t\tif (t > eps)\n\t\t\treturn vec4(-normalize(rpos.yz+rdir2*t-pos.yz), 0.0, t);\n\t\tt = b + det;\n\t\tif (t > eps)\n\t\t\treturn vec4(-normalize(rpos.yz+rdir2*t-pos.yz), 0.0, t);\n\t}\n\t\n\treturn vec4(0.0);\n}\n\nvec4 intersectPlane(vec3 rayPos, vec3 rayDir, vec3 n, float d)\n{\n\tfloat t = -(dot(rayPos, n) + d) / dot(rayDir, n);\n\treturn vec4(n * sign(dot(rayDir, n)), t);\n}\n\n// Helper functions\nvec3 rotate(vec3 p, float theta)\n{\n\tfloat c = cos(theta), s = sin(theta);\n\treturn vec3(p.x * c + p.z * s, p.y,\n\t\t\t\tp.z * c - p.x * s);\n}\n\nfloat impulse(float k, float x) // by iq\n{\n float h = k*x;\n return h * exp(1.0 - h);\n}\n\n// Raymarched parts of scene\nfloat grass(vec3 pos)\n{\n\tfloat h = length(pos - vec3(0.0, -7.0, 0.0)) - 8.0;\n\t\n\tif (h > 2.0) return h; // Optimization (Avoid noise if too far away)\n\t\n\treturn h + snoise(pos * 3.0) * 0.1 + pos.y * 0.9;\n}\n\nfloat tree(vec3 pos)\n{\n\tpos.y -= 0.5;\n\tfloat s = sin(pos.y*0.03);\n\tfloat c = cos(pos.y*0.03);\n\tmat2 m = mat2(c, -s, s, c);\n\tvec3 p = vec3(m*pos.xy, pos.z);\n\t\n\tfloat width = 1.0 - pos.y * 0.02 - clamp(sin(pos.y * 8.0) * 0.1, 0.05, 0.1);\n\t\n\treturn max(length(p.xz) - width, pos.y - 12.5);\n}\n\nvec2 scene(vec3 pos)\n{\n\tfloat vtree = tree(pos);\n\t#ifdef GRASS\n\tfloat vgrass = grass(pos);\n\tfloat v = min(vtree, vgrass);\n\t#else\n\tfloat v = vtree;\n\t#endif\n\treturn vec2(v, v == vtree ? 2.0 : 1.0);\n}\n\nvec3 normal(vec3 pos)\n{\n\tvec2 eps = vec2(1e-3, 0.0);\n\tfloat h = scene(pos).x;\n\treturn normalize(vec3(\n\t\tscene(pos-eps.xyy).x-h,\n\t\tscene(pos-eps.yxy).x-h,\n\t\tscene(pos-eps.yyx).x-h\n\t));\n}\n\nfloat plantsShadow(vec3 rayPos, vec3 rayDir)\n{\n\t// Soft shadow taken from iq\n\tfloat k = 6.0;\n\tfloat t = 0.0;\n\tfloat s = 1.0;\t\n\tfor (int i = 0; i < 30; i++)\n\t{\n\t\tvec3 pos = rayPos+rayDir*t;\t\n\t\tvec2 res = scene(pos);\t\t\n\t\tif (res.x < 0.001) return 0.0;\n\t\ts = min(s, k*res.x/t); \n\t\tt += max(res.x, 0.01);\n\t}\n\t\n\treturn s*s*(3.0 - 2.0*s);\n}\n\n// Ray-traced parts of scene\nvec4 intersectWater(vec3 rayPos, vec3 rayDir)\n{\n\tfloat h = sin(20.5 + iGlobalTime * 2.0) * 0.03;\n\tfloat t = -(rayPos.y + 2.5 + h) / rayDir.y;\n\treturn vec4(0.0, 1.0, 0.0, t);\n}\n\nvec4 intersectSand(vec3 rayPos, vec3 rayDir)\n{\n\treturn intersectSphere(rayPos, rayDir, vec3(0.0,-24.1,0.0), 24.1);\n}\n\nvec4 intersectTreasure(vec3 rayPos, vec3 rayDir)\n{\n\treturn vec4(0.0);\n}\n\nvec4 intersectLeaf(vec3 rayPos, vec3 rayDir, float openAmount)\n{\t\n\tvec3 dir = normalize(vec3(0.0, 1.0, openAmount));\n\tfloat offset = 0.0;\n\t\t\t\n\tvec4 res = intersectPlane(rayPos, rayDir, dir, 0.0);\n\tvec3 pos = rayPos+rayDir*res.w;\n\t#ifdef RAGGED_LEAVES\n\toffset = snoise(pos*0.8) * 0.3;\n\t#endif\n\tif (pos.y > 0.0 || length(pos * vec3(0.9, 2.0, 1.0)) > 4.0 - offset) res.w = 0.0;\n\t\n\tvec4 res2 = intersectPlane(rayPos, rayDir, vec3(dir.xy, -dir.z), 0.0);\n\tpos = rayPos+rayDir*res2.w;\n\t#ifdef RAGGED_LEAVES\n\toffset = snoise(pos*0.8) * 0.3;\n\t#endif\n\tif (pos.y > 0.0 || length(pos * vec3(0.9, 2.0, 1.0)) > 4.0 - offset) res2.w = 0.0;\n\t\n\tif (res2.w > 0.0 && res2.w < res.w || res.w <= 0.0)\n\t\tres = res2;\n\t\t\n\treturn res;\n}\n\nvec4 leaves(vec3 rayPos, vec3 rayDir)\n{\n\tfloat t = 1e20;\n\tvec3 n = vec3(0.0);\n\t\n\trayPos -= leavesPos;\n\t\n\tfloat sway = impulse(15.0, fract(iGlobalTime / PI * 0.125));\n\tfloat upDownSway = sway * -sin(iGlobalTime) * 0.06;\n\tfloat openAmount = sway * max(-cos(iGlobalTime) * 0.4, 0.0);\n\t\n\tfloat angleOffset = -0.1;\t\n\tfor (float k = 0.0; k < 6.2; k += 0.75)\n\t{\n\t\t// Left-right\n\t\tfloat alpha = k + (k - PI) * sway * 0.015;\n\t\tvec3 p = rotate(rayPos, alpha);\n\t\tvec3 d = rotate(rayDir, alpha);\n\t\t\n\t\t// Up-down\n\t\tangleOffset *= -1.0;\n\t\tfloat theta = -0.4 + \n\t\t\tangleOffset + \n\t\t\tcos(k) * 0.35 + \n\t\t\tupDownSway + \n\t\t\tsin(iGlobalTime+k*10.0) * 0.03 * (sway + 0.2);\n\t\t\n\t\tp = rotate(p.xzy, theta).xzy;\n\t\td = rotate(d.xzy, theta).xzy;\n\t\n\t\t// Shift\n\t\tp -= vec3(5.4, 0.0, 0.0);\n\t\t\n\t\t// Intersect individual leaf\n\t\tvec4 res = intersectLeaf(p, d, 1.0+openAmount);\n\t\tif (res.w > 0.0 && res.w < t)\n\t\t{\n\t\t\tt = res.w;\n\t\t\tn = res.xyz;\n\t\t}\n\t}\n\t\n\treturn vec4(n, t);\n}\n\n// Lighting\nfloat shadow(vec3 rayPos, vec3 rayDir)\n{\t\n\tfloat s = 1.0;\n\t\n\t// Intersect sand\n\t//vec4 resSand = intersectSand(rayPos, rayDir);\n\t//if (resSand.w > 0.0) return 0.0;\n\t\n\t// Intersect plants\n\ts = min(s, plantsShadow(rayPos, rayDir));\n\tif (s < 0.0001) return 0.0;\n\t\n\t// Intersect leaves\n\tvec4 resLeaves = leaves(rayPos, rayDir);\n\tif (resLeaves.w > 0.0 && resLeaves.w < 1e7) return 0.0;\n\t\n\treturn s;\n}\n\nvec3 light(vec3 p, vec3 n)\n{\n\tfloat s = 1.0;\n\t\n\t#ifdef SHADOWS\n\ts = shadow(p-sunDir*0.01, -sunDir);\n\t#endif\n\t\n\tvec3 col = sunCol * min(max(dot(n, sunDir), 0.0), s);\n\tcol += skyCol * (-n.y * 0.5 + 0.5) * 0.3;\n\treturn col;\n}\n\nvec3 lightLeaves(vec3 p, vec3 n)\n{\n\tfloat s = 1.0;\n\t\n\t#ifdef SHADOWS\n\ts = shadow(p-sunDir*0.01, -sunDir);\n\t#endif\n\t\n\tfloat ao = min(length(p - leavesPos) * 0.1, 1.0);\n\t\n\tfloat ns = dot(n, sunDir);\n\tfloat d = sqrt(max(ns, 0.0));\n\tvec3 col = sunCol * min(d, s);\n\tcol += sunCol * max(-ns, 0.0) * vec3(0.3, 0.3, 0.1) * ao;\n\tcol += skyCol * (-n.y * 0.5 + 0.5) * 0.3 * ao;\n\treturn col;\n}\n\nvec3 sky(vec3 n)\n{\n\treturn skyCol * (1.0 - n.y * 0.8);\n}\n\n// Ray-marching\nvec4 plants(vec3 rayPos, vec3 rayDir)\n{\n\tfloat t = 0.0;\n\t\n\tfor (int i = 0; i < 40; i++)\n\t{\n\t\tvec3 pos = rayPos+rayDir*t;\t\n\t\tvec2 res = scene(pos);\n\t\tfloat h = res.x;\n\t\t\n\t\tif (h < 0.001)\n\t\t{\n\t\t\tvec3 col = res.y == 2.0 ? treeCol : grassCol;\n\t\t\tfloat uvFact = res.y == 2.0 ? 1.0 : 10.0;\n\t\t\t\n\t\t\tvec3 n = normal(pos);\n\t\t\tvec2 uv = vec2(n.x, pos.y * 0.5) * 0.2 * uvFact;\n\t\t\tvec3 tex = texture2D(iChannel0, uv).rgb * 0.6 + 0.4;\n\t\t\tfloat ao = min(length(pos - leavesPos) * 0.1, 1.0);\n\t\t\treturn vec4(col * light(pos, n) * ao * tex, t);\n\t\t}\n\t\t\n\t\tt += h;\n\t}\n\t\n\treturn vec4(sky(rayDir), 1e8);\n}\n\n// Final combination\nvec3 traceReflection(vec3 rayPos, vec3 rayDir)\n{\n\tvec3 col = vec3(0.0);\n\tfloat t = 1e20;\n\t\t\t\n\t// Intersect plants\n\tvec4 resPlants = plants(rayPos, rayDir);\n\tif (resPlants.w > 0.0 && resPlants.w < t)\n\t{\n\t\tt = resPlants.w;\n\t\tcol = resPlants.xyz;\n\t}\n\t\n\t// Intersect leaves\n\tvec4 resLeaves = leaves(rayPos, rayDir);\n\tif (resLeaves.w > 0.0 && resLeaves.w < t)\n\t{\n\t\tvec3 pos = rayPos + rayDir * resLeaves.w;\n\t\tvec2 uv = (pos.xz - leavesPos.xz) * 0.3;\n\t\tfloat tex = texture2D(iChannel0, uv).r * 0.6 + 0.5;\n\t\t\n\t\tt = resLeaves.w;\n\t\tcol = leavesCol * lightLeaves(pos, resLeaves.xyz) * tex;\n\t}\n\t\t\n\tif (t > 1e7) return sky(rayDir);\n\t\n\treturn col;\n}\n\nvec3 trace(vec3 rayPos, vec3 rayDir)\n{\n\tvec3 col = vec3(0.0);\n\tfloat t = 1e20;\n\t\n\t// Intersect sand\n\tvec4 resSand = intersectSand(rayPos, rayDir);\n\tif (resSand.w > 0.0)\n\t{\n\t\tvec3 pos = rayPos + rayDir * resSand.w;\n\t\tt = resSand.w;\n\n\t\tcol = sandCol * light(pos, resSand.xyz);\n\t}\n\t\n\t// Intersect treasure chest\n\tvec4 resTreasure = intersectTreasure(rayPos, rayDir);\n\tif (resTreasure.w > 0.0 && resTreasure.w < t)\n\t{\n\t\tvec3 pos = rayPos + rayDir * resTreasure.w;\n\t\tt = resTreasure.w;\n\t\tcol = leavesCol * light(pos, resTreasure.xyz);\n\t}\n\t\n\t// Intersect leaves\n\tvec4 resLeaves = leaves(rayPos, rayDir);\n\tif (resLeaves.w > 0.0 && resLeaves.w < t)\n\t{\n\t\tvec3 pos = rayPos + rayDir * resLeaves.w;\n\t\tvec2 uv = (pos.xz - leavesPos.xz) * 0.3;\n\t\tfloat tex = texture2D(iChannel0, uv).r * 0.6 + 0.5;\n\t\t\n\t\tt = resLeaves.w;\n\t\tcol = leavesCol * lightLeaves(pos, resLeaves.xyz) * tex;\n\t}\n\t\n\t// Intersect plants\n\tvec4 resPlants = plants(rayPos, rayDir);\n\tif (resPlants.w > 0.0 && resPlants.w < t)\n\t{\n\t\tt = resPlants.w;\n\t\tcol = resPlants.xyz;\n\t}\n\t\t\n\t// Intersect water\t\n\tvec4 resWater = intersectWater(rayPos, rayDir);\n\tif (resWater.w > 0.0 && resWater.w < t)\n\t{\n\t\tvec3 pos = rayPos + rayDir * resWater.w;\n\t\tfloat dist = t - resWater.w;\n\t\tvec3 n = bump(pos, rayDir);\n\t\t\n\t\tfloat ct = -min(dot(n,rayDir), 0.0);\n\t\tfloat fresnel = 0.9 - 0.9 * pow(1.0 - ct, 5.0);\n\t\t\n\t\tvec3 trans = col * exp(-dist * vec3(1.0, 0.7, 0.4) * 3.0);\n\t\tvec3 reflDir = normalize(reflect(rayDir, n));\n\t\tvec3 refl = sky(reflDir);\n\t\t\n\t\t#ifdef REFLECTIONS\n\t\tif (dot(pos, rayDir) < -2.0)\n\t\t\trefl = traceReflection(pos, reflDir).rgb;\n\t\t#endif\n\t\t\t\t\n\t\tt = resWater.t;\n\t\tcol = mix(refl, trans, fresnel);\n\t}\n\t\n\tif (t > 1e7) return sky(rayDir);\n\t\n\treturn col;\n}\n\n// Ray-generation\nvec3 camera(vec2 px)\n{\n\tvec2 rd = (px / iResolution.yy - vec2(iResolution.x/iResolution.y*0.5-0.5, 0.0)) * 2.0 - 1.0;\n\tfloat t = sin(iGlobalTime * 0.1) * 0.2;\n\tvec3 rayDir = normalize(vec3(rd.x, rd.y, 1.0));\n\tvec3 rayPos = vec3(0.0, 3.0, -18.0);\n\treturn trace(rayPos, rayDir);\n}\n\nvoid main(void)\n{\n\t#ifdef HEAVY_AA\n\t\tvec3 col = camera(gl_FragCoord.xy+vec2(0.0,0.5))*0.25;\n\t\tcol += camera(gl_FragCoord.xy+vec2(0.25,0.0))*0.25;\n\t\tcol += camera(gl_FragCoord.xy+vec2(0.5,0.75))*0.25;\n\t\tcol += camera(gl_FragCoord.xy+vec2(0.75,0.25))*0.25;\n\t#else\n\t\tvec3 col = camera(gl_FragCoord.xy);\n\t\t#ifdef LIGHT_AA\n\t\t\tcol = col * 0.5 + camera(gl_FragCoord.xy+vec2(0.5,0.5))*0.5;\n\t\t#endif\n\t#endif\n\t\n\t#ifdef TONEMAP\n\t// Optimized Haarm-Peter Duiker’s curve\n\tvec3 x = max(vec3(0.0),col*exposure-0.004);\n\tcol = (x*(6.2*x+.5))/(x*(6.2*x+1.7)+0.06);\n\t#else\n\tcol = pow(col, vec3(0.4545));\n\t#endif\n\t\n\tgl_FragColor = vec4(col, 1.0);\n}" }, { "path": "src/test/resources/samples/langs/GLSL/myfragment.frg", "content": "varying vec4 v_color;\n\nvoid main()\n{\n\tgl_FragColor = v_color;\n}" }, { "path": "src/test/resources/samples/langs/GLSL/myvertex.vrx", "content": "uniform mat4 u_MVPMatrix;\n\nattribute vec4 a_position;\nattribute vec4 a_color;\n\nvarying vec4 v_color;\n\nvoid main()\n{\n\tv_color = a_color;\n\tgl_Position = u_MVPMatrix * pos;\n}" }, { "path": "src/test/resources/samples/langs/GLSL/pntriangles.tesc", "content": "/**\n * The MIT License (MIT)\n *\n * Copyright (c) 2016 Sascha Willems\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \"Software\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n */\n\n#version 450\n\n#extension GL_ARB_separate_shader_objects : enable\n#extension GL_ARB_shading_language_420pack : enable\n\n// PN patch data\nstruct PnPatch\n{\n float b210;\n float b120;\n float b021;\n float b012;\n float b102;\n float b201;\n float b111;\n float n110;\n float n011;\n float n101;\n};\n\n// tessellation levels\nlayout (binding = 0) uniform UBO \n{\n\tfloat tessLevel;\n} ubo; \n\nlayout(vertices=3) out;\n\nlayout(location = 0) in vec3 inNormal[];\nlayout(location = 1) in vec2 inUV[];\n\nlayout(location = 0) out vec3 outNormal[3];\nlayout(location = 3) out vec2 outUV[3];\nlayout(location = 6) out PnPatch outPatch[3];\n\nfloat wij(int i, int j)\n{\n\treturn dot(gl_in[j].gl_Position.xyz - gl_in[i].gl_Position.xyz, inNormal[i]);\n}\n\nfloat vij(int i, int j)\n{\n\tvec3 Pj_minus_Pi = gl_in[j].gl_Position.xyz\n\t\t\t\t\t- gl_in[i].gl_Position.xyz;\n\tvec3 Ni_plus_Nj = inNormal[i]+inNormal[j];\n\treturn 2.0*dot(Pj_minus_Pi, Ni_plus_Nj)/dot(Pj_minus_Pi, Pj_minus_Pi);\n}\n\nvoid main()\n{\n\t// get data\n\tgl_out[gl_InvocationID].gl_Position = gl_in[gl_InvocationID].gl_Position;\n\toutNormal[gl_InvocationID] = inNormal[gl_InvocationID];\n\toutUV[gl_InvocationID] = inUV[gl_InvocationID];\n\n\t// set base \n\tfloat P0 = gl_in[0].gl_Position[gl_InvocationID];\n\tfloat P1 = gl_in[1].gl_Position[gl_InvocationID];\n\tfloat P2 = gl_in[2].gl_Position[gl_InvocationID];\n\tfloat N0 = inNormal[0][gl_InvocationID];\n\tfloat N1 = inNormal[1][gl_InvocationID];\n\tfloat N2 = inNormal[2][gl_InvocationID];\n\n\t// compute control points\n\toutPatch[gl_InvocationID].b210 = (2.0*P0 + P1 - wij(0,1)*N0)/3.0;\n\toutPatch[gl_InvocationID].b120 = (2.0*P1 + P0 - wij(1,0)*N1)/3.0;\n\toutPatch[gl_InvocationID].b021 = (2.0*P1 + P2 - wij(1,2)*N1)/3.0;\n\toutPatch[gl_InvocationID].b012 = (2.0*P2 + P1 - wij(2,1)*N2)/3.0;\n\toutPatch[gl_InvocationID].b102 = (2.0*P2 + P0 - wij(2,0)*N2)/3.0;\n\toutPatch[gl_InvocationID].b201 = (2.0*P0 + P2 - wij(0,2)*N0)/3.0;\n\tfloat E = ( outPatch[gl_InvocationID].b210\n\t\t\t+ outPatch[gl_InvocationID].b120\n\t\t\t+ outPatch[gl_InvocationID].b021\n\t\t\t+ outPatch[gl_InvocationID].b012\n\t\t\t+ outPatch[gl_InvocationID].b102\n\t\t\t+ outPatch[gl_InvocationID].b201 ) / 6.0;\n\tfloat V = (P0 + P1 + P2)/3.0;\n\toutPatch[gl_InvocationID].b111 = E + (E - V)*0.5;\n\toutPatch[gl_InvocationID].n110 = N0+N1-vij(0,1)*(P1-P0);\n\toutPatch[gl_InvocationID].n011 = N1+N2-vij(1,2)*(P2-P1);\n\toutPatch[gl_InvocationID].n101 = N2+N0-vij(2,0)*(P0-P2);\n\n\t// set tess levels\n\tgl_TessLevelOuter[gl_InvocationID] = ubo.tessLevel;\n\tgl_TessLevelInner[0] = ubo.tessLevel;\n}\n" }, { "path": "src/test/resources/samples/langs/GLSL/pntriangles.tese", "content": "/**\n * The MIT License (MIT)\n *\n * Copyright (c) 2016 Sascha Willems\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \"Software\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n */\n\n#version 450\n\n#extension GL_ARB_separate_shader_objects : enable\n#extension GL_ARB_shading_language_420pack : enable\n\n// PN patch data\nstruct PnPatch\n{\n float b210;\n float b120;\n float b021;\n float b012;\n float b102;\n float b201;\n float b111;\n float n110;\n float n011;\n float n101;\n};\n\nlayout (binding = 1) uniform UBO \n{\n mat4 projection;\n mat4 model;\n float tessAlpha;\n} ubo;\n\nlayout(triangles, fractional_odd_spacing, ccw) in;\n\nlayout(location = 0) in vec3 iNormal[];\nlayout(location = 3) in vec2 iTexCoord[];\nlayout(location = 6) in PnPatch iPnPatch[];\n\nlayout(location = 0) out vec3 oNormal;\nlayout(location = 1) out vec2 oTexCoord;\n\n#define uvw gl_TessCoord\n\nvoid main()\n{\n vec3 uvwSquared = uvw * uvw;\n vec3 uvwCubed = uvwSquared * uvw;\n\n // extract control points\n vec3 b210 = vec3(iPnPatch[0].b210, iPnPatch[1].b210, iPnPatch[2].b210);\n vec3 b120 = vec3(iPnPatch[0].b120, iPnPatch[1].b120, iPnPatch[2].b120);\n vec3 b021 = vec3(iPnPatch[0].b021, iPnPatch[1].b021, iPnPatch[2].b021);\n vec3 b012 = vec3(iPnPatch[0].b012, iPnPatch[1].b012, iPnPatch[2].b012);\n vec3 b102 = vec3(iPnPatch[0].b102, iPnPatch[1].b102, iPnPatch[2].b102);\n vec3 b201 = vec3(iPnPatch[0].b201, iPnPatch[1].b201, iPnPatch[2].b201);\n vec3 b111 = vec3(iPnPatch[0].b111, iPnPatch[1].b111, iPnPatch[2].b111);\n\n // extract control normals\n vec3 n110 = normalize(vec3(iPnPatch[0].n110, iPnPatch[1].n110, iPnPatch[2].n110));\n vec3 n011 = normalize(vec3(iPnPatch[0].n011, iPnPatch[1].n011, iPnPatch[2].n011));\n vec3 n101 = normalize(vec3(iPnPatch[0].n101, iPnPatch[1].n101, iPnPatch[2].n101));\n\n // compute texcoords\n oTexCoord = gl_TessCoord[2]*iTexCoord[0] + gl_TessCoord[0]*iTexCoord[1] + gl_TessCoord[1]*iTexCoord[2];\n\n // normal\n // Barycentric normal\n vec3 barNormal = gl_TessCoord[2]*iNormal[0] + gl_TessCoord[0]*iNormal[1] + gl_TessCoord[1]*iNormal[2];\n vec3 pnNormal = iNormal[0]*uvwSquared[2] + iNormal[1]*uvwSquared[0] + iNormal[2]*uvwSquared[1]\n + n110*uvw[2]*uvw[0] + n011*uvw[0]*uvw[1]+ n101*uvw[2]*uvw[1];\n oNormal = ubo.tessAlpha*pnNormal + (1.0-ubo.tessAlpha) * barNormal;\n\n // compute interpolated pos\n vec3 barPos = gl_TessCoord[2]*gl_in[0].gl_Position.xyz\n + gl_TessCoord[0]*gl_in[1].gl_Position.xyz\n + gl_TessCoord[1]*gl_in[2].gl_Position.xyz;\n\n // save some computations\n uvwSquared *= 3.0;\n\n // compute PN position\n vec3 pnPos = gl_in[0].gl_Position.xyz*uvwCubed[2]\n + gl_in[1].gl_Position.xyz*uvwCubed[0]\n + gl_in[2].gl_Position.xyz*uvwCubed[1]\n + b210*uvwSquared[2]*uvw[0]\n + b120*uvwSquared[0]*uvw[2]\n + b201*uvwSquared[2]*uvw[1]\n + b021*uvwSquared[0]*uvw[1]\n + b102*uvwSquared[1]*uvw[2]\n + b012*uvwSquared[1]*uvw[0]\n + b111*6.0*uvw[0]*uvw[1]*uvw[2];\n\n // final position and normal\n vec3 finalPos = (1.0-ubo.tessAlpha)*barPos + ubo.tessAlpha*pnPos;\n gl_Position = ubo.projection * ubo.model * vec4(finalPos,1.0);\n}\n" }, { "path": "src/test/resources/samples/langs/GLSL/recurse1.frag", "content": "#version 330 core\r\n\r\n// cross-unit recursion\r\n\r\nvoid main() {}\r\n\r\n// two-level recursion\r\n\r\nfloat cbar(int);\r\n\r\nvoid cfoo(float)\r\n{\r\n\tcbar(2);\r\n}\r\n\r\n// four-level, out of order\r\n\r\nvoid CB();\r\nvoid CD();\r\nvoid CA() { CB(); }\r\nvoid CC() { CD(); }\r\n\r\n// high degree\r\n\r\nvoid CBT();\r\nvoid CDT();\r\nvoid CAT() { CBT(); CBT(); CBT(); }\r\nvoid CCT() { CDT(); CDT(); CBT(); }\r\n\r\n// not recursive\r\n\r\nvoid norA() {}\r\nvoid norB() { norA(); }\r\nvoid norC() { norA(); }\r\nvoid norD() { norA(); }\r\nvoid norE() { norB(); }\r\nvoid norF() { norB(); }\r\nvoid norG() { norE(); }\r\nvoid norH() { norE(); }\r\nvoid norI() { norE(); }\r\n\r\n// not recursive, but with a call leading into a cycle if ignoring direction\r\n\r\nvoid norcA() { }\r\nvoid norcB() { norcA(); }\r\nvoid norcC() { norcB(); }\r\nvoid norcD() { norcC(); norcB(); } // head of cycle\r\nvoid norcE() { norcD(); } // lead into cycle\r\n" }, { "path": "src/test/resources/samples/langs/GLSL/recurse1.fs", "content": "#version 330 core\r\n\r\n// cross-unit recursion\r\n\r\nvoid main() {}\r\n\r\n// two-level recursion\r\n\r\nfloat cbar(int);\r\n\r\nvoid cfoo(float)\r\n{\r\n\tcbar(2);\r\n}\r\n\r\n// four-level, out of order\r\n\r\nvoid CB();\r\nvoid CD();\r\nvoid CA() { CB(); }\r\nvoid CC() { CD(); }\r\n\r\n// high degree\r\n\r\nvoid CBT();\r\nvoid CDT();\r\nvoid CAT() { CBT(); CBT(); CBT(); }\r\nvoid CCT() { CDT(); CDT(); CBT(); }\r\n\r\n// not recursive\r\n\r\nvoid norA() {}\r\nvoid norB() { norA(); }\r\nvoid norC() { norA(); }\r\nvoid norD() { norA(); }\r\nvoid norE() { norB(); }\r\nvoid norF() { norB(); }\r\nvoid norG() { norE(); }\r\nvoid norH() { norE(); }\r\nvoid norI() { norE(); }\r\n\r\n// not recursive, but with a call leading into a cycle if ignoring direction\r\n\r\nvoid norcA() { }\r\nvoid norcB() { norcA(); }\r\nvoid norcC() { norcB(); }\r\nvoid norcD() { norcC(); norcB(); } // head of cycle\r\nvoid norcE() { norcD(); } // lead into cycle\r\n" }, { "path": "src/test/resources/samples/langs/GLSL/shader.fp", "content": "/*\n * Copyright (C) 2010 Josh A. Beam\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\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 *\n * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.\n * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;\n * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n * WHETHER IN CONTACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR\n * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\n * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nconst int NUM_LIGHTS = 3;\nconst vec3 AMBIENT = vec3(0.1, 0.1, 0.1);\nconst float MAX_DIST = 2.5;\nconst float MAX_DIST_SQUARED = MAX_DIST * MAX_DIST;\n\nuniform vec3 lightColor[NUM_LIGHTS];\n\nvarying vec3 fragmentNormal;\nvarying vec3 cameraVector;\nvarying vec3 lightVector[NUM_LIGHTS];\n\nvoid\nmain()\n{\n\t// initialize diffuse/specular lighting\n\tvec3 diffuse = vec3(0.0, 0.0, 0.0);\n\tvec3 specular = vec3(0.0, 0.0, 0.0);\n\n\t// normalize the fragment normal and camera direction\n\tvec3 normal = normalize(fragmentNormal);\n\tvec3 cameraDir = normalize(cameraVector);\n\n\t// loop through each light\n\tfor(int i = 0; i < NUM_LIGHTS; ++i) {\n\t\t// calculate distance between 0.0 and 1.0\n\t\tfloat dist = min(dot(lightVector[i], lightVector[i]), MAX_DIST_SQUARED) / MAX_DIST_SQUARED;\n\t\tfloat distFactor = 1.0 - dist;\n\n\t\t// diffuse\n\t\tvec3 lightDir = normalize(lightVector[i]);\n\t\tfloat diffuseDot = dot(normal, lightDir);\n\t\tdiffuse += lightColor[i] * clamp(diffuseDot, 0.0, 1.0) * distFactor;\n\n\t\t// specular\n\t\tvec3 halfAngle = normalize(cameraDir + lightDir);\n\t\tvec3 specularColor = min(lightColor[i] + 0.5, 1.0);\n\t\tfloat specularDot = dot(normal, halfAngle);\n\t\tspecular += specularColor * pow(clamp(specularDot, 0.0, 1.0), 16.0) * distFactor;\n\t}\n\n\tvec4 sample = vec4(1.0, 1.0, 1.0, 1.0);\n\tgl_FragColor = vec4(clamp(sample.rgb * (diffuse + AMBIENT) + specular, 0.0, 1.0), sample.a);\n}\n" }, { "path": "src/test/resources/samples/langs/GN/BUILD.2.gn", "content": "# Copyright 2016 the V8 project authors. All rights reserved.\n# Use of this source code is governed by a BSD-style license that can be\n# found in the LICENSE file.\n\nimport(\"../gni/isolate.gni\")\n\ngroup(\"gn_all\") {\n testonly = true\n\n if (v8_test_isolation_mode != \"noop\") {\n deps = [\n \":check-static-initializers_run\",\n \":jsfunfuzz_run\",\n \":run-deopt-fuzzer_run\",\n \":run-gcmole_run\",\n \":run-valgrind_run\",\n ]\n }\n}\n\nv8_isolate_run(\"check-static-initializers\") {\n deps = [\n \"..:d8_run\",\n ]\n\n isolate = \"check-static-initializers.isolate\"\n}\n\nv8_isolate_run(\"jsfunfuzz\") {\n deps = [\n \"..:d8_run\",\n ]\n\n isolate = \"jsfunfuzz/jsfunfuzz.isolate\"\n}\n\nv8_isolate_run(\"run-deopt-fuzzer\") {\n deps = [\n \"..:d8_run\",\n ]\n\n isolate = \"run-deopt-fuzzer.isolate\"\n}\n\nv8_isolate_run(\"run-gcmole\") {\n deps = [\n \"..:d8_run\",\n ]\n\n isolate = \"gcmole/run-gcmole.isolate\"\n}\n\nv8_isolate_run(\"run-valgrind\") {\n deps = [\n \"..:d8_run\",\n ]\n\n isolate = \"run-valgrind.isolate\"\n}\n" }, { "path": "src/test/resources/samples/langs/GN/BUILD.3.gn", "content": "# Copyright (c) 2013 The Chromium Authors. All rights reserved.\n# Use of this source code is governed by a BSD-style license that can be\n# found in the LICENSE file.\n\nimport(\"//build/config/android/config.gni\")\nimport(\"//build/config/chrome_build.gni\")\nimport(\"//build/config/compiler/compiler.gni\")\nimport(\"//build/config/nacl/config.gni\")\nimport(\"//build/toolchain/cc_wrapper.gni\")\nimport(\"//build/toolchain/toolchain.gni\")\nimport(\"//build_overrides/build.gni\")\n\nif (current_cpu == \"arm\" || current_cpu == \"arm64\") {\n import(\"//build/config/arm.gni\")\n}\nif (current_cpu == \"mipsel\" || current_cpu == \"mips64el\") {\n import(\"//build/config/mips.gni\")\n}\nif (is_mac) {\n import(\"//build/config/mac/symbols.gni\")\n}\n\ndeclare_args() {\n # Default to warnings as errors for default workflow, where we catch\n # warnings with known toolchains. Allow overriding this e.g. for Chromium\n # builds on Linux that could use a different version of the compiler.\n # With GCC, warnings in no-Chromium code are always not treated as errors.\n treat_warnings_as_errors = true\n\n # Normally, Android builds are lightly optimized, even for debug builds, to\n # keep binary size down. Setting this flag to true disables such optimization\n android_full_debug = false\n\n # Whether to use the binary binutils checked into third_party/binutils.\n # These are not multi-arch so cannot be used except on x86 and x86-64 (the\n # only two architectures that are currently checked in). Turn this off when\n # you are using a custom toolchain and need to control -B in cflags.\n linux_use_bundled_binutils =\n linux_use_bundled_binutils_override && is_linux &&\n (current_cpu == \"x64\" || current_cpu == \"x86\")\n binutils_path = rebase_path(\"//third_party/binutils/Linux_x64/Release/bin\",\n root_build_dir)\n\n # Compile in such a way as to make it possible for the profiler to unwind full\n # stack frames. Setting this flag has a large effect on the performance of the\n # generated code than just setting profiling, but gives the profiler more\n # information to analyze.\n # Requires profiling to be set to true.\n enable_full_stack_frames_for_profiling = false\n\n # When we are going to use gold we need to find it.\n # This is initialized below, after use_gold might have been overridden.\n gold_path = false\n\n if (is_win) {\n # Whether the VS xtree header has been patched to disable warning 4702. If\n # it has, then we don't need to disable 4702 (unreachable code warning).\n # The patch is preapplied to the internal toolchain and hence all bots.\n msvs_xtree_patched = false\n }\n\n # Omit unwind support in official builds to save space.\n # We can use breakpad for these builds.\n exclude_unwind_tables = is_chrome_branded && is_official_build\n\n # If true, gold linker will save symbol table inside object files.\n # This speeds up gdb startup by 60%\n gdb_index = false\n\n # If true, optimize for size. Does not affect windows builds.\n # Linux & Mac favor speed over size.\n # TODO(brettw) it's weird that Mac and desktop Linux are different. We should\n # explore favoring size over speed in this case as well.\n optimize_for_size = is_android || is_ios\n\n # Enable fatal linker warnings. Building Chromium with certain versions\n # of binutils can cause linker warning.\n # See: https://bugs.chromium.org/p/chromium/issues/detail?id=457359\n fatal_linker_warnings = true\n\n # AFDO (Automatic Feedback Directed Optimizer) is a form of profile-guided\n # optimization that GCC supports. It used by ChromeOS in their official\n # builds. To use it, set auto_profile_path to the path to a file containing\n # the needed gcov profiling data.\n auto_profile_path = \"\"\n\n # Optimize for coverage guided fuzzing (balance between speed and number of\n # branches)\n optimize_for_fuzzing = false\n}\n\nif (is_clang && !is_nacl) {\n update_args = [ \"--print-revision\" ]\n if (llvm_force_head_revision) {\n update_args += [ \"--llvm-force-head-revision\" ]\n }\n clang_revision =\n exec_script(\"//tools/clang/scripts/update.py\", update_args, \"trim string\")\n}\n\n# Apply the default logic for these values if they were not set explicitly.\nif (gold_path == false) {\n if (use_gold) {\n gold_path = rebase_path(\"//third_party/binutils/Linux_x64/Release/bin\",\n root_build_dir)\n } else {\n gold_path = \"\"\n }\n}\n\nif (use_debug_fission == \"default\") {\n use_debug_fission = is_debug && !is_win && use_gold &&\n linux_use_bundled_binutils && cc_wrapper == \"\"\n}\n\n# default_include_dirs ---------------------------------------------------------\n#\n# This is a separate config so that third_party code (which would not use the\n# source root and might have conflicting versions of some headers) can remove\n# this and specify their own include paths.\nconfig(\"default_include_dirs\") {\n include_dirs = [\n \"//\",\n root_gen_dir,\n ]\n}\n\n# compiler ---------------------------------------------------------------------\n#\n# Base compiler configuration.\n#\n# See also \"runtime_library\" below for related stuff and a discussion about\n# where stuff should go. Put warning related stuff in the \"warnings\" config.\n\nconfig(\"compiler\") {\n asmflags = []\n cflags = []\n cflags_c = []\n cflags_cc = []\n cflags_objc = []\n cflags_objcc = []\n ldflags = []\n defines = []\n configs = []\n\n # System-specific flags. If your compiler flags apply to one of the\n # categories here, add it to the associated file to keep this shared config\n # smaller.\n if (is_win) {\n configs += [ \"//build/config/win:compiler\" ]\n } else if (is_android) {\n configs += [ \"//build/config/android:compiler\" ]\n } else if (is_linux) {\n configs += [ \"//build/config/linux:compiler\" ]\n } else if (is_nacl) {\n configs += [ \"//build/config/nacl:compiler\" ]\n } else if (is_ios || is_mac) {\n configs += [ \"//build/config/mac:compiler\" ]\n }\n\n # Applies to all Posix systems.\n if (is_posix) {\n configs += [ \"//build/config/posix:compiler\" ]\n }\n\n # See the definitions below.\n configs += [\n \":compiler_cpu_abi\",\n \":compiler_codegen\",\n ]\n\n # In general, Windows is totally different, but all the other builds share\n # some common GCC configuration.\n if (!is_win) {\n # Common GCC compiler flags setup.\n # --------------------------------\n cflags += [ \"-fno-strict-aliasing\" ] # See http://crbug.com/32204\n cflags_cc += [\n # If this is removed then remove the corresponding /Zc:threadSafeInit- for\n # Windows.\n \"-fno-threadsafe-statics\",\n\n # Not exporting C++ inline functions can generally be applied anywhere\n # so we do so here. Normal function visibility is controlled by\n # //build/config/gcc:symbol_visibility_hidden.\n \"-fvisibility-inlines-hidden\",\n ]\n\n # Stack protection.\n if (is_mac) {\n # The strong variant of the stack protector significantly increases\n # binary size, so only enable it in debug mode.\n if (is_debug) {\n cflags += [ \"-fstack-protector-strong\" ]\n } else {\n cflags += [ \"-fstack-protector\" ]\n }\n } else if (is_posix && !is_chromeos && !is_nacl) {\n # TODO(phajdan.jr): Use -fstack-protector-strong when our gcc supports it.\n # See also https://crbug.com/533294\n cflags += [ \"--param=ssp-buffer-size=4\" ]\n\n # The x86 toolchain currently has problems with stack-protector.\n if (is_android && current_cpu == \"x86\") {\n cflags += [ \"-fno-stack-protector\" ]\n } else {\n cflags += [ \"-fstack-protector\" ]\n }\n }\n\n # Linker warnings.\n if (fatal_linker_warnings && !(is_chromeos && current_cpu == \"arm\") &&\n !(is_android && use_order_profiling) && !is_mac && !is_ios) {\n # TODO(jochen): Enable this on chromeos on arm. http://crbug.com/356580\n # TODO(lizeb,pasko): Fix link errors when linking with order_profiling=1\n # crbug.com/485542\n ldflags += [ \"-Wl,--fatal-warnings\" ]\n }\n }\n\n if (is_clang && is_debug) {\n # Allow comparing the address of references and 'this' against 0\n # in debug builds. Technically, these can never be null in\n # well-defined C/C++ and Clang can optimize such checks away in\n # release builds, but they may be used in asserts in debug builds.\n cflags_cc += [\n \"-Wno-undefined-bool-conversion\",\n \"-Wno-tautological-undefined-compare\",\n ]\n }\n\n if (is_clang && !is_nacl) {\n # This is here so that all files get recompiled after a clang roll and\n # when turning clang on or off. (defines are passed via the command line,\n # and build system rebuild things when their commandline changes). Nothing\n # should ever read this define.\n defines += [ \"CR_CLANG_REVISION=$clang_revision\" ]\n }\n\n # Non-Mac Posix compiler flags setup.\n # -----------------------------------\n if (is_posix && !(is_mac || is_ios)) {\n if (enable_profiling) {\n if (!is_debug) {\n cflags += [ \"-g\" ]\n\n if (enable_full_stack_frames_for_profiling) {\n cflags += [\n \"-fno-inline\",\n \"-fno-optimize-sibling-calls\",\n ]\n }\n }\n }\n\n defines += [ \"_FILE_OFFSET_BITS=64\" ]\n\n if (!is_android) {\n defines += [\n \"_LARGEFILE_SOURCE\",\n \"_LARGEFILE64_SOURCE\",\n ]\n }\n\n if (!is_nacl) {\n if (exclude_unwind_tables) {\n cflags += [\n \"-fno-unwind-tables\",\n \"-fno-asynchronous-unwind-tables\",\n ]\n defines += [ \"NO_UNWIND_TABLES\" ]\n } else {\n cflags += [ \"-funwind-tables\" ]\n }\n }\n }\n\n # Linux/Android common flags setup.\n # ---------------------------------\n if (is_linux || is_android) {\n cflags += [\n \"-fPIC\",\n \"-pipe\", # Use pipes for communicating between sub-processes. Faster.\n ]\n\n ldflags += [\n \"-fPIC\",\n \"-Wl,-z,noexecstack\",\n \"-Wl,-z,now\",\n \"-Wl,-z,relro\",\n ]\n if (!using_sanitizer) {\n if (!use_cfi_diag) {\n ldflags += [ \"-Wl,-z,defs\" ]\n }\n\n # Functions interposed by the sanitizers can make ld think\n # that some libraries aren't needed when they actually are,\n # http://crbug.com/234010. As workaround, disable --as-needed.\n if (!is_nacl && !is_android) {\n # TODO(pcc): Fix linker bug which requires us to link pthread\n # unconditionally here (crbug.com/623236).\n ldflags += [\n \"-Wl,--no-as-needed\",\n \"-lpthread\",\n ]\n }\n ldflags += [ \"-Wl,--as-needed\" ]\n }\n }\n\n # Linux-specific compiler flags setup.\n # ------------------------------------\n if (is_android && is_clang) {\n _rebased_android_toolchain_root =\n rebase_path(android_toolchain_root, root_build_dir)\n\n # Let clang find the linker in the NDK.\n ldflags += [ \"--gcc-toolchain=$_rebased_android_toolchain_root\" ]\n }\n\n if (is_posix && use_lld && !is_nacl) {\n ldflags += [ \"-fuse-ld=lld\" ]\n } else if (use_gold) {\n ldflags += [ \"-fuse-ld=gold\" ]\n if (is_android) {\n # Use -mstackrealign due to a bug on ia32 Jelly Bean.\n # See crbug.com/521527\n if (current_cpu == \"x86\") {\n cflags += [ \"-mstackrealign\" ]\n }\n } else {\n # On Android, this isn't needed. gcc in the NDK knows to look next to\n # it with -fuse-ld=gold, and clang gets a --gcc-toolchain flag passed\n # above.\n ldflags += [ \"-B$gold_path\" ]\n\n if (linux_use_bundled_binutils) {\n ldflags += [\n # Experimentation found that using four linking threads\n # saved ~20% of link time.\n # https://groups.google.com/a/chromium.org/group/chromium-dev/browse_thread/thread/281527606915bb36\n # Only apply this to the target linker, since the host\n # linker might not be gold, but isn't used much anyway.\n \"-Wl,--threads\",\n \"-Wl,--thread-count=4\",\n ]\n }\n }\n\n if (gdb_index) {\n ldflags += [ \"-Wl,--gdb-index\" ]\n }\n\n # TODO(thestig): Make this flag work with GN.\n #if (!is_official_build && !is_chromeos && !(is_asan || is_lsan || is_tsan || is_msan)) {\n # ldflags += [\n # \"-Wl,--detect-odr-violations\",\n # ]\n #}\n } else if (linux_use_bundled_binutils) {\n # Gold is the default linker for the bundled binutils so we explicitly\n # enable the bfd linker when use_gold is not set.\n ldflags += [ \"-fuse-ld=bfd\" ]\n }\n\n if (is_posix && (use_gold || (use_lld && !is_nacl)) && !using_sanitizer &&\n !(is_android && use_order_profiling)) {\n # TODO(crbug.com/576197) - gcc on x86 platforms + gold + icf=all\n # doesn't currently work on non-chromeos platforms.\n # Additionally, on Android x86 --icf=safe seems to cause issues as well.\n # Additionally, on cast Android x86, --icf=all causes issues.\n if (is_android && current_cpu == \"x86\") {\n ldflags += [ \"-Wl,--icf=none\" ]\n } else if ((is_clang && !is_android) || is_chromeos ||\n (current_cpu != \"x86\" && current_cpu != \"x64\")) {\n # TODO(thakis): Remove `!is_android` above once our gold has been rolled\n # with the fix for https://sourceware.org/bugzilla/show_bug.cgi?id=17704\n # merged. See also https://crbug.com/663886\n ldflags += [ \"-Wl,--icf=all\" ]\n } else if (!is_android || is_clang) {\n ldflags += [ \"-Wl,--icf=safe\" ]\n }\n }\n\n if (linux_use_bundled_binutils) {\n cflags += [ \"-B$binutils_path\" ]\n }\n\n # Clang-specific compiler flags setup.\n # ------------------------------------\n if (is_clang) {\n cflags += [ \"-fcolor-diagnostics\" ]\n }\n\n # Print absolute paths in diagnostics. There is no precedent for doing this\n # on Linux/Mac (GCC doesn't support it), but MSVC does this with /FC and\n # Windows developers rely on it (crbug.com/636109) so only do this on Windows.\n if (is_clang && is_win) {\n cflags += [ \"-fdiagnostics-absolute-paths\" ]\n }\n\n # Makes builds independent of absolute file path.\n # clang-cl (used if is_win) doesn't expose this flag.\n # Currently disabled for nacl since its toolchain lacks this flag (too old).\n # TODO(zforman): Once nacl's toolchain is updated, remove check.\n if (is_clang && is_linux) {\n absolute_path = rebase_path(\"//.\")\n cflags += [ \"-fdebug-prefix-map=$absolute_path=.\" ]\n }\n\n # C++11 compiler flags setup.\n # ---------------------------\n if (is_linux || is_android || (is_nacl && is_clang)) {\n # gnu++11 instead of c++11 is needed because some code uses typeof() (a\n # GNU extension).\n # TODO(thakis): Eventually switch this to c++11 instead,\n # http://crbug.com/427584\n cflags_cc += [ \"-std=gnu++11\" ]\n } else if (!is_win && !is_nacl) {\n # TODO(mcgrathr) - the NaCl GCC toolchain doesn't support either gnu++11\n # or c++11; we technically don't need this toolchain any more, but there\n # are still a few buildbots using it, so until those are turned off\n # we need the !is_nacl clause and the (is_nacl && is_clang) clause, above.\n cflags_cc += [ \"-std=c++11\" ]\n }\n\n if (is_mac) {\n cflags_cc += [ \"-stdlib=libc++\" ]\n ldflags += [ \"-stdlib=libc++\" ]\n }\n\n # Add flags for link-time optimization. These flags enable\n # optimizations/transformations that require whole-program visibility at link\n # time, so they need to be applied to all translation units, and we may end up\n # with miscompiles if only part of the program is compiled with LTO flags. For\n # that reason, we cannot allow targets to enable or disable these flags, for\n # example by disabling the optimize configuration.\n # TODO(pcc): Make this conditional on is_official_build rather than on gn\n # flags for specific features.\n if (!is_debug && (allow_posix_link_time_opt || is_cfi) && !is_nacl) {\n if (use_thin_lto) {\n cflags += [ \"-flto=thin\" ]\n ldflags += [ \"-flto=thin\" ]\n\n # Limit the parallelism to avoid too agressive competition between\n # linker jobs. This is still suboptimal to a potential dynamic\n # resource allocation scheme, but should be good enough.\n if (use_lld) {\n ldflags += [ \"-Wl,--thinlto-jobs=8\" ]\n } else {\n ldflags += [ \"-Wl,-plugin-opt,jobs=8\" ]\n }\n } else {\n # Note: ThinLTO does not currently have this feature implemented\n # For Full LTO, it provides a measurable runtime speedup of Chrome.\n cflags += [\n \"-flto\",\n \"-fwhole-program-vtables\",\n ]\n ldflags += [\n \"-flto\",\n \"-fwhole-program-vtables\",\n ]\n\n # Apply a lower LTO optimization level as the default is too slow.\n if (is_linux) {\n if (use_lld) {\n ldflags += [ \"-Wl,--lto-O1\" ]\n } else {\n ldflags += [ \"-Wl,-plugin-opt,O1\" ]\n }\n } else if (is_mac) {\n ldflags += [ \"-Wl,-mllvm,-O1\" ]\n }\n }\n\n # Work-around for http://openradar.appspot.com/20356002\n if (is_mac) {\n ldflags += [ \"-Wl,-all_load\" ]\n }\n\n # Allows the linker to apply ICF to the LTO object file. Also, when\n # targeting ARM, without this flag, LTO produces a .text section that is\n # larger than the maximum call displacement, preventing the linker from\n # relocating calls (http://llvm.org/PR22999).\n if (is_linux) {\n ldflags += [ \"-Wl,-plugin-opt,-function-sections\" ]\n }\n }\n\n # Pass the same C/C++ flags to the objective C/C++ compiler.\n cflags_objc += cflags_c\n cflags_objcc += cflags_cc\n\n # Assign any flags set for the C compiler to asmflags so that they are sent\n # to the assembler. The Windows assembler takes different types of flags\n # so only do so for posix platforms.\n if (is_posix) {\n asmflags += cflags\n asmflags += cflags_c\n }\n}\n\n# This is separate from :compiler (and not even a sub-config there)\n# so that some targets can remove it from the list with:\n# configs -= [ \"//build/config/compiler:pthread\" ]\nconfig(\"pthread\") {\n if (is_linux) {\n cflags = [ \"-pthread\" ]\n ldflags = [ \"-pthread\" ]\n }\n}\n\n# This provides the basic options to select the target CPU and ABI.\n# It is factored out of \"compiler\" so that special cases can use this\n# without using everything that \"compiler\" brings in. Options that\n# tweak code generation for a particular CPU do not belong here!\n# See \"compiler_codegen\", below.\nconfig(\"compiler_cpu_abi\") {\n cflags = []\n ldflags = []\n\n if (is_posix && !(is_mac || is_ios)) {\n # CPU architecture. We may or may not be doing a cross compile now, so for\n # simplicity we always explicitly set the architecture.\n if (current_cpu == \"x64\") {\n cflags += [\n \"-m64\",\n \"-march=x86-64\",\n ]\n ldflags += [ \"-m64\" ]\n } else if (current_cpu == \"x86\") {\n cflags += [ \"-m32\" ]\n ldflags += [ \"-m32\" ]\n if (!is_nacl) {\n cflags += [\n \"-msse2\",\n \"-mfpmath=sse\",\n \"-mmmx\",\n ]\n }\n } else if (current_cpu == \"arm\") {\n if (is_clang && !is_android && !is_nacl) {\n cflags += [ \"--target=arm-linux-gnueabihf\" ]\n ldflags += [ \"--target=arm-linux-gnueabihf\" ]\n }\n if (!is_nacl) {\n cflags += [\n \"-march=$arm_arch\",\n \"-mfloat-abi=$arm_float_abi\",\n ]\n }\n if (arm_tune != \"\") {\n cflags += [ \"-mtune=$arm_tune\" ]\n }\n } else if (current_cpu == \"arm64\") {\n if (is_clang && !is_android && !is_nacl) {\n cflags += [ \"--target=aarch64-linux-gnu\" ]\n ldflags += [ \"--target=aarch64-linux-gnu\" ]\n }\n } else if (current_cpu == \"mipsel\" && !is_nacl) {\n if (mips_arch_variant == \"r6\") {\n if (is_clang) {\n cflags += [\n \"--target=mipsel-linux-gnu\",\n \"-march=mips32r6\",\n ]\n ldflags += [ \"--target=mipsel-linux-gnu\" ]\n } else {\n cflags += [\n \"-mips32r6\",\n \"-Wa,-mips32r6\",\n ]\n if (is_android) {\n ldflags += [\n \"-mips32r6\",\n \"-Wl,-melf32ltsmip\",\n ]\n }\n }\n if (mips_use_msa == true) {\n cflags += [\n \"-mmsa\",\n \"-mfp64\",\n ]\n }\n } else if (mips_arch_variant == \"r2\") {\n if (is_clang) {\n if (is_android) {\n cflags += [\n \"--target=mipsel-linux-android\",\n \"-march=mipsel\",\n \"-mcpu=mips32r2\",\n ]\n ldflags += [ \"--target=mipsel-linux-android\" ]\n } else {\n cflags += [\n \"--target=mipsel-linux-gnu\",\n \"-march=mipsel\",\n \"-mcpu=mips32r2\",\n ]\n ldflags += [ \"--target=mipsel-linux-gnu\" ]\n }\n } else {\n cflags += [\n \"-mips32r2\",\n \"-Wa,-mips32r2\",\n ]\n if (mips_float_abi == \"hard\" && mips_fpu_mode != \"\") {\n cflags += [ \"-m$mips_fpu_mode\" ]\n }\n }\n } else if (mips_arch_variant == \"r1\") {\n if (is_clang) {\n if (is_android) {\n cflags += [\n \"--target=mipsel-linux-android\",\n \"-march=mipsel\",\n \"-mcpu=mips32\",\n ]\n ldflags += [ \"--target=mipsel-linux-android\" ]\n } else {\n cflags += [\n \"--target=mipsel-linux-gnu\",\n \"-march=mipsel\",\n \"-mcpu=mips32\",\n ]\n ldflags += [ \"--target=mipsel-linux-gnu\" ]\n }\n } else {\n cflags += [\n \"-mips32\",\n \"-Wa,-mips32\",\n ]\n }\n }\n\n if (mips_dsp_rev == 1) {\n cflags += [ \"-mdsp\" ]\n } else if (mips_dsp_rev == 2) {\n cflags += [ \"-mdspr2\" ]\n }\n\n cflags += [ \"-m${mips_float_abi}-float\" ]\n } else if (current_cpu == \"mips64el\") {\n if (mips_arch_variant == \"r6\") {\n if (is_clang) {\n if (is_android) {\n cflags += [\n \"--target=mips64el-linux-android\",\n \"-march=mips64el\",\n \"-mcpu=mips64r6\",\n ]\n ldflags += [ \"--target=mips64el-linux-android\" ]\n }\n } else {\n cflags += [\n \"-mips64r6\",\n \"-Wa,-mips64r6\",\n ]\n ldflags += [ \"-mips64r6\" ]\n }\n if (mips_use_msa == true) {\n cflags += [\n \"-mmsa\",\n \"-mfp64\",\n ]\n }\n } else if (mips_arch_variant == \"r2\") {\n cflags += [\n \"-mips64r2\",\n \"-Wa,-mips64r2\",\n ]\n ldflags += [ \"-mips64r2\" ]\n }\n } else if (current_cpu == \"pnacl\" && is_nacl_nonsfi) {\n if (target_cpu == \"x86\" || target_cpu == \"x64\") {\n cflags += [\n \"-arch\",\n \"x86-32-nonsfi\",\n \"--pnacl-bias=x86-32-nonsfi\",\n \"--target=i686-unknown-nacl\",\n ]\n ldflags += [\n \"-arch\",\n \"x86-32-nonsfi\",\n \"--target=i686-unknown-nacl\",\n ]\n } else if (target_cpu == \"arm\") {\n cflags += [\n \"-arch\",\n \"arm-nonsfi\",\n \"-mfloat-abi=hard\",\n \"--pnacl-bias=arm-nonsfi\",\n \"--target=armv7-unknown-nacl-gnueabihf\",\n ]\n ldflags += [\n \"-arch\",\n \"arm-nonsfi\",\n \"--target=armv7-unknown-nacl-gnueabihf\",\n ]\n }\n }\n }\n\n asmflags = cflags\n}\n\n# This provides options to tweak code generation that are necessary\n# for particular Chromium code or for working around particular\n# compiler bugs (or the combination of the two).\nconfig(\"compiler_codegen\") {\n configs = []\n cflags = []\n\n if (is_nacl) {\n configs += [ \"//build/config/nacl:compiler_codegen\" ]\n } else if (is_posix && !is_mac && !is_ios) {\n if (current_cpu == \"x86\") {\n if (is_clang) {\n cflags += [\n # Else building libyuv gives clang's register allocator issues,\n # see llvm.org/PR15798 / crbug.com/233709\n \"-momit-leaf-frame-pointer\",\n ]\n }\n } else if (current_cpu == \"arm\") {\n if (is_android && !is_clang) {\n # Clang doesn't support these flags.\n cflags += [\n # The tree-sra optimization (scalar replacement for\n # aggregates enabling subsequent optimizations) leads to\n # invalid code generation when using the Android NDK's\n # compiler (r5-r7). This can be verified using\n # webkit_unit_tests' WTF.Checked_int8_t test.\n \"-fno-tree-sra\",\n\n # The following option is disabled to improve binary\n # size and performance in gcc 4.9.\n \"-fno-caller-saves\",\n ]\n }\n }\n }\n\n asmflags = cflags\n}\n\n# This is separate from :compiler_codegen (and not even a sub-config there)\n# so that some targets can remove it from the list with:\n# configs -= [ \"//build/config/compiler:clang_stackrealign\" ]\n# See https://crbug.com/556393 for details of where it must be avoided.\nconfig(\"clang_stackrealign\") {\n if (is_clang && current_cpu == \"x86\" && is_linux) {\n cflags = [\n # Align the stack on 16-byte boundaries, http://crbug.com/418554.\n \"-mstack-alignment=16\",\n \"-mstackrealign\",\n ]\n }\n}\n\nconfig(\"compiler_arm_fpu\") {\n if (current_cpu == \"arm\" && !is_ios && !is_nacl) {\n cflags = [ \"-mfpu=$arm_fpu\" ]\n asmflags = cflags\n }\n}\n\nconfig(\"compiler_arm_thumb\") {\n if (current_cpu == \"arm\" && arm_use_thumb && is_posix &&\n !(is_mac || is_ios || is_nacl)) {\n cflags = [ \"-mthumb\" ]\n if (is_android && !is_clang) {\n # Clang doesn't support this option.\n cflags += [ \"-mthumb-interwork\" ]\n }\n }\n}\n\nconfig(\"compiler_arm\") {\n if (current_cpu == \"arm\" && is_chromeos) {\n # arm is normally the default mode for clang, but on chromeos a wrapper\n # is used to pass -mthumb, and therefor change the default.\n cflags = [ \"-marm\" ]\n }\n}\n\n# runtime_library -------------------------------------------------------------\n#\n# Sets the runtime library and associated options.\n#\n# How do you determine what should go in here vs. \"compiler\" above? Consider if\n# a target might choose to use a different runtime library (ignore for a moment\n# if this is possible or reasonable on your system). If such a target would want\n# to change or remove your option, put it in the runtime_library config. If a\n# target wants the option regardless, put it in the compiler config.\n\nconfig(\"runtime_library\") {\n defines = []\n configs = []\n\n # System-specific flags. If your compiler flags apply to one of the\n # categories here, add it to the associated file to keep this shared config\n # smaller.\n if (is_win) {\n configs += [ \"//build/config/win:runtime_library\" ]\n } else if (is_linux) {\n configs += [ \"//build/config/linux:runtime_library\" ]\n } else if (is_ios) {\n configs += [ \"//build/config/ios:runtime_library\" ]\n } else if (is_mac) {\n configs += [ \"//build/config/mac:runtime_library\" ]\n } else if (is_android) {\n configs += [ \"//build/config/android:runtime_library\" ]\n }\n\n if (is_posix) {\n configs += [ \"//build/config/posix:runtime_library\" ]\n }\n\n if (is_component_build) {\n defines += [ \"COMPONENT_BUILD\" ]\n }\n}\n\n# default_warnings ------------------------------------------------------------\n#\n# Collects all warning flags that are used by default. This is used as a\n# subconfig of both chromium_code and no_chromium_code. This way these\n# flags are guaranteed to appear on the compile command line after -Wall.\nconfig(\"default_warnings\") {\n cflags = []\n cflags_cc = []\n\n if (is_win) {\n if (treat_warnings_as_errors) {\n cflags += [ \"/WX\" ]\n }\n\n cflags += [\n # Warnings permanently disabled:\n\n # C4091: 'typedef ': ignored on left of 'X' when no variable is\n # declared.\n # This happens in a number of Windows headers. Dumb.\n \"/wd4091\",\n\n # C4127: conditional expression is constant\n # This warning can in theory catch dead code and other problems, but\n # triggers in far too many desirable cases where the conditional\n # expression is either set by macros or corresponds some legitimate\n # compile-time constant expression (due to constant template args,\n # conditionals comparing the sizes of different types, etc.). Some of\n # these can be worked around, but it's not worth it.\n \"/wd4127\",\n\n # C4251: 'identifier' : class 'type' needs to have dll-interface to be\n # used by clients of class 'type2'\n # This is necessary for the shared library build.\n \"/wd4251\",\n\n # C4351: new behavior: elements of array 'array' will be default\n # initialized\n # This is a silly \"warning\" that basically just alerts you that the\n # compiler is going to actually follow the language spec like it's\n # supposed to, instead of not following it like old buggy versions did.\n # There's absolutely no reason to turn this on.\n \"/wd4351\",\n\n # C4355: 'this': used in base member initializer list\n # It's commonly useful to pass |this| to objects in a class' initializer\n # list. While this warning can catch real bugs, most of the time the\n # constructors in question don't attempt to call methods on the passed-in\n # pointer (until later), and annotating every legit usage of this is\n # simply more hassle than the warning is worth.\n \"/wd4355\",\n\n # C4503: 'identifier': decorated name length exceeded, name was\n # truncated\n # This only means that some long error messages might have truncated\n # identifiers in the presence of lots of templates. It has no effect on\n # program correctness and there's no real reason to waste time trying to\n # prevent it.\n \"/wd4503\",\n\n # Warning C4589 says: \"Constructor of abstract class ignores\n # initializer for virtual base class.\" Disable this warning because it\n # is flaky in VS 2015 RTM. It triggers on compiler generated\n # copy-constructors in some cases.\n \"/wd4589\",\n\n # C4611: interaction between 'function' and C++ object destruction is\n # non-portable\n # This warning is unavoidable when using e.g. setjmp/longjmp. MSDN\n # suggests using exceptions instead of setjmp/longjmp for C++, but\n # Chromium code compiles without exception support. We therefore have to\n # use setjmp/longjmp for e.g. JPEG decode error handling, which means we\n # have to turn off this warning (and be careful about how object\n # destruction happens in such cases).\n \"/wd4611\",\n\n # Warnings to evaluate and possibly fix/reenable later:\n\n \"/wd4100\", # Unreferenced formal function parameter.\n \"/wd4121\", # Alignment of a member was sensitive to packing.\n \"/wd4244\", # Conversion: possible loss of data.\n \"/wd4505\", # Unreferenced local function has been removed.\n \"/wd4510\", # Default constructor could not be generated.\n \"/wd4512\", # Assignment operator could not be generated.\n \"/wd4610\", # Class can never be instantiated, constructor required.\n \"/wd4838\", # Narrowing conversion. Doesn't seem to be very useful.\n \"/wd4995\", # 'X': name was marked as #pragma deprecated\n \"/wd4996\", # Deprecated function warning.\n\n # These are variable shadowing warnings that are new in VS2015. We\n # should work through these at some point -- they may be removed from\n # the RTM release in the /W4 set.\n \"/wd4456\",\n \"/wd4457\",\n \"/wd4458\",\n \"/wd4459\",\n ]\n\n cflags += [\n # C4312 is a VS 2015 64-bit warning for integer to larger pointer.\n # TODO(brucedawson): fix warnings, crbug.com/554200\n \"/wd4312\",\n ]\n\n if (current_cpu == \"x86\") {\n cflags += [\n # VC++ 2015 changes 32-bit size_t truncation warnings from 4244 to\n # 4267. Example: short TruncTest(size_t x) { return x; }\n # Since we disable 4244 we need to disable 4267 during migration.\n # TODO(jschuh): crbug.com/167187 fix size_t to int truncations.\n \"/wd4267\",\n ]\n }\n\n # VS xtree header file needs to be patched or 4702 (unreachable code\n # warning) is reported if _HAS_EXCEPTIONS=0. Disable the warning if xtree is\n # not patched.\n if (!msvs_xtree_patched &&\n exec_script(\"../../win_is_xtree_patched.py\", [], \"value\") == 0) {\n cflags += [ \"/wd4702\" ] # Unreachable code.\n }\n\n # Building with Clang on Windows is a work in progress and very\n # experimental. See crbug.com/82385.\n if (is_clang) {\n cflags += [\n # TODO(hans): Make this list shorter eventually, http://crbug.com/504657\n \"-Wno-microsoft-enum-value\", # http://crbug.com/505296\n \"-Wno-unknown-pragmas\", # http://crbug.com/505314\n \"-Wno-microsoft-cast\", # http://crbug.com/550065\n ]\n }\n } else {\n if (is_mac && !is_nacl) {\n # When compiling Objective-C, warns if a method is used whose\n # availability is newer than the deployment target. This is not\n # required when compiling Chrome for iOS.\n cflags += [ \"-Wpartial-availability\" ]\n }\n\n # Suppress warnings about ABI changes on ARM (Clang doesn't give this\n # warning).\n if (current_cpu == \"arm\" && !is_clang) {\n cflags += [ \"-Wno-psabi\" ]\n }\n\n if (!is_clang) {\n cflags_cc += [\n # See comment for -Wno-c++11-narrowing.\n \"-Wno-narrowing\",\n ]\n\n # Don't warn about the \"typedef 'foo' locally defined but not used\"\n # for gcc 4.8.\n # TODO: remove this flag once all builds work. See crbug.com/227506\n cflags += [ \"-Wno-unused-local-typedefs\" ]\n\n # Don't warn about \"maybe\" uninitialized. Clang doesn't include this\n # in -Wall but gcc does, and it gives false positives.\n cflags += [ \"-Wno-maybe-uninitialized\" ]\n }\n }\n\n # Common Clang and GCC warning setup.\n if (!is_win || is_clang) {\n cflags += [\n # Disables.\n \"-Wno-missing-field-initializers\", # \"struct foo f = {0};\"\n \"-Wno-unused-parameter\", # Unused function parameters.\n ]\n }\n\n if (is_chromeos) {\n # TODO(thakis): Remove, http://crbug.com/263960\n if (is_clang) {\n cflags_cc += [ \"-Wno-reserved-user-defined-literal\" ]\n } else {\n cflags_cc += [ \"-Wno-literal-suffix\" ]\n }\n }\n\n if (is_clang) {\n cflags += [\n # TODO(thakis): Consider -Wloop-analysis (turns on\n # -Wrange-loop-analysis too).\n\n # This warns on using ints as initializers for floats in\n # initializer lists (e.g. |int a = f(); CGSize s = { a, a };|),\n # which happens in several places in chrome code. Not sure if\n # this is worth fixing.\n \"-Wno-c++11-narrowing\",\n\n # Warns on switches on enums that cover all enum values but\n # also contain a default: branch. Chrome is full of that.\n \"-Wno-covered-switch-default\",\n\n # Clang considers the `register` keyword as deprecated, but e.g.\n # code generated by flex (used in angle) contains that keyword.\n # http://crbug.com/255186\n \"-Wno-deprecated-register\",\n\n # TODO(thakis): This used to be implied by -Wno-unused-function,\n # which we no longer use. Check if it makes sense to remove\n # this as well. http://crbug.com/316352\n \"-Wno-unneeded-internal-declaration\",\n\n # TODO(hans): Get this cleaned up, http://crbug.com/428099\n \"-Wno-inconsistent-missing-override\",\n ]\n\n # Chrome's hermetic Clang compiler, NaCl's Clang compiler and Xcode's Clang\n # compiler will almost always have different versions. Certain flags may not\n # be recognized by one version or the other.\n if (!is_nacl) {\n # Flags NaCl (Clang 3.7) does not recognize.\n cflags += [\n # TODO(thakis): Enable this, crbug.com/507717\n \"-Wno-shift-negative-value\",\n ]\n }\n if (!is_nacl && !use_xcode_clang) {\n # Flags NaCl (Clang 3.7) and Xcode 7.3 (Clang clang-703.0.31) do not\n # recognize.\n cflags += [\n # TODO(thakis): https://crbug.com/604888\n \"-Wno-undefined-var-template\",\n\n # TODO(thakis): https://crbug.com/617318\n \"-Wno-nonportable-include-path\",\n\n # TODO(hans): https://crbug.com/637306\n \"-Wno-address-of-packed-member\",\n ]\n }\n }\n}\n\n# chromium_code ---------------------------------------------------------------\n#\n# Toggles between higher and lower warnings for code that is (or isn't)\n# part of Chromium.\n\nconfig(\"chromium_code\") {\n if (is_win) {\n cflags = [ \"/W4\" ] # Warning level 4.\n\n # Assume UTF-8 by default to avoid code page dependencies.\n cflags += [ \"/utf-8\" ]\n } else {\n cflags = [ \"-Wall\" ]\n if (treat_warnings_as_errors) {\n cflags += [ \"-Werror\" ]\n\n # The compiler driver can sometimes (rarely) emit warnings before calling\n # the actual linker. Make sure these warnings are treated as errors as\n # well.\n ldflags = [ \"-Werror\" ]\n }\n if (is_clang) {\n # Enable -Wextra for chromium_code when we control the compiler.\n cflags += [ \"-Wextra\" ]\n }\n\n # In Chromium code, we define __STDC_foo_MACROS in order to get the\n # C99 macros on Mac and Linux.\n defines = [\n \"__STDC_CONSTANT_MACROS\",\n \"__STDC_FORMAT_MACROS\",\n ]\n\n if (!is_debug && !using_sanitizer &&\n (!is_linux || !is_clang || is_official_build)) {\n # _FORTIFY_SOURCE isn't really supported by Clang now, see\n # http://llvm.org/bugs/show_bug.cgi?id=16821.\n # It seems to work fine with Ubuntu 12 headers though, so use it in\n # official builds.\n #\n # Non-chromium code is not guaranteed to compile cleanly with\n # _FORTIFY_SOURCE. Also, fortified build may fail when optimizations are\n # disabled, so only do that for Release build.\n defines += [ \"_FORTIFY_SOURCE=2\" ]\n }\n\n if (is_mac || is_ios) {\n cflags_objc = [ \"-Wobjc-missing-property-synthesis\" ]\n cflags_objcc = [ \"-Wobjc-missing-property-synthesis\" ]\n }\n }\n\n configs = [ \":default_warnings\" ]\n}\n\nconfig(\"no_chromium_code\") {\n cflags = []\n cflags_cc = []\n defines = []\n\n if (is_win) {\n cflags += [\n \"/W3\", # Warning level 3.\n \"/wd4800\", # Disable warning when forcing value to bool.\n \"/wd4267\", # TODO(jschuh): size_t to int.\n \"/wd4996\", # Deprecated function warning.\n ]\n defines += [\n \"_CRT_NONSTDC_NO_WARNINGS\",\n \"_CRT_NONSTDC_NO_DEPRECATE\",\n ]\n } else {\n # GCC may emit unsuppressible warnings so don't add -Werror for no chromium\n # code. crbug.com/589724\n if (treat_warnings_as_errors && is_clang) {\n cflags += [ \"-Werror\" ]\n ldflags = [ \"-Werror\" ]\n }\n if (is_clang && !is_nacl) {\n # TODO(thakis): Remove !is_nacl once\n # https://codereview.webrtc.org/1552863002/ made its way into chromium.\n cflags += [ \"-Wall\" ]\n }\n }\n\n if (is_clang) {\n cflags += [\n # Lots of third-party libraries have unused variables. Instead of\n # suppressing them individually, we just blanket suppress them here.\n \"-Wno-unused-variable\",\n ]\n }\n\n if (is_linux || is_android) {\n cflags_cc += [\n # Don't warn about hash_map in third-party code.\n \"-Wno-deprecated\",\n ]\n }\n\n configs = [ \":default_warnings\" ]\n}\n\n# rtti ------------------------------------------------------------------------\n#\n# Allows turning Run-Time Type Identification on or off.\n\nconfig(\"rtti\") {\n if (is_win) {\n cflags_cc = [ \"/GR\" ]\n } else {\n cflags_cc = [ \"-frtti\" ]\n }\n}\nconfig(\"no_rtti\") {\n # CFI diagnostics and UBsan vptr require RTTI.\n if (!use_cfi_diag && !is_ubsan_vptr && !is_ubsan_security) {\n if (is_win) {\n cflags_cc = [ \"/GR-\" ]\n } else {\n cflags_cc = [ \"-fno-rtti\" ]\n cflags_objcc = cflags_cc\n }\n }\n}\n\n# Warnings ---------------------------------------------------------------------\n\n# This will generate warnings when using Clang if code generates exit-time\n# destructors, which will slow down closing the program.\n# TODO(thakis): Make this a blacklist instead, http://crbug.com/101600\nconfig(\"wexit_time_destructors\") {\n # TODO: Enable on Windows too, http://crbug.com/404525\n if (is_clang && !is_win) {\n cflags = [ \"-Wexit-time-destructors\" ]\n }\n}\n\n# On Windows compiling on x64, VC will issue a warning when converting\n# size_t to int because it will truncate the value. Our code should not have\n# these warnings and one should use a static_cast or a checked_cast for the\n# conversion depending on the case. However, a lot of code still needs to be\n# fixed. Apply this config to such targets to disable the warning.\n#\n# Note that this can be applied regardless of platform and architecture to\n# clean up the call sites. This will only apply the flag when necessary.\n#\n# TODO(jschuh): crbug.com/167187 fix this and delete this config.\nconfig(\"no_size_t_to_int_warning\") {\n if (is_win && current_cpu == \"x64\") {\n cflags = [ \"/wd4267\" ]\n }\n}\n\n# Some code presumes that pointers to structures/objects are compatible\n# regardless of whether what they point to is already known to be valid.\n# gcc 4.9 and earlier had no way of suppressing this warning without\n# supressing the rest of them. Here we centralize the identification of\n# the gcc 4.9 toolchains.\nconfig(\"no_incompatible_pointer_warnings\") {\n cflags = []\n if (is_clang) {\n cflags += [ \"-Wno-incompatible-pointer-types\" ]\n } else if (current_cpu == \"mipsel\") {\n cflags += [ \"-w\" ]\n } else if (is_chromeos && current_cpu == \"arm\") {\n cflags += [ \"-w\" ]\n }\n}\n\n# Optimization -----------------------------------------------------------------\n#\n# The BUILDCONFIG file sets the \"default_optimization\" config on targets by\n# default. It will be equivalent to either \"optimize\" (release) or\n# \"no_optimize\" (debug) optimization configs.\n#\n# You can override the optimization level on a per-target basis by removing the\n# default config and then adding the named one you want:\n#\n# configs -= [ \"//build/config/compiler:default_optimization\" ]\n# configs += [ \"//build/config/compiler:optimize_max\" ]\n\n# Shared settings for both \"optimize\" and \"optimize_max\" configs.\n# IMPORTANT: On Windows \"/O1\" and \"/O2\" must go before the common flags.\nif (is_win) {\n common_optimize_on_cflags = [\n \"/Ob2\", # Both explicit and auto inlining.\n \"/Oy-\", # Disable omitting frame pointers, must be after /O2.\n \"/d2Zi+\", # Improve debugging of optimized code.\n \"/Zc:inline\", # Remove unreferenced COMDAT (faster links).\n ]\n if (!is_asan) {\n common_optimize_on_cflags += [\n # Put data in separate COMDATs. This allows the linker\n # to put bit-identical constants at the same address even if\n # they're unrelated constants, which saves binary size.\n # This optimization can't be used when ASan is enabled because\n # it is not compatible with the ASan ODR checker.\n \"/Gw\",\n ]\n }\n common_optimize_on_ldflags = []\n if (!is_component_build) {\n common_optimize_on_ldflags += [ \"/OPT:ICF\" ] # Redundant COMDAT folding.\n }\n if (is_official_build) {\n common_optimize_on_ldflags += [ \"/OPT:REF\" ] # Remove unreferenced data.\n if (!use_lld) {\n common_optimize_on_ldflags += [\n # Set the number of LTCG code-gen threads to eight. The default is four.\n # This gives a 5-10% link speedup.\n \"/cgthreads:8\",\n ]\n if (use_incremental_wpo) {\n # Incremental Link-time code generation.\n common_optimize_on_ldflags += [ \"/LTCG:INCREMENTAL\" ]\n } else {\n common_optimize_on_ldflags += [ \"/LTCG\" ] # Link-time code generation.\n }\n }\n if (full_wpo_on_official) {\n if (use_incremental_wpo) {\n arflags = [ \"/LTCG:INCREMENTAL\" ]\n } else {\n arflags = [ \"/LTCG\" ]\n }\n }\n }\n} else {\n common_optimize_on_cflags = []\n common_optimize_on_ldflags = []\n\n if (is_android) {\n # TODO(jdduke) Re-enable on mips after resolving linking\n # issues with libc++ (crbug.com/456380).\n if (current_cpu != \"mipsel\" && current_cpu != \"mips64el\") {\n common_optimize_on_ldflags += [\n # Warn in case of text relocations.\n \"-Wl,--warn-shared-textrel\",\n ]\n }\n }\n\n if (is_mac || is_ios) {\n if (symbol_level == 2) {\n # Mac dead code stripping requires symbols.\n common_optimize_on_ldflags += [ \"-Wl,-dead_strip\" ]\n }\n } else {\n # Non-Mac Posix flags.\n\n common_optimize_on_cflags += [\n # Don't emit the GCC version ident directives, they just end up in the\n # .comment section taking up binary size.\n \"-fno-ident\",\n\n # Put data and code in their own sections, so that unused symbols\n # can be removed at link time with --gc-sections.\n \"-fdata-sections\",\n \"-ffunction-sections\",\n ]\n\n common_optimize_on_ldflags += [\n # Specifically tell the linker to perform optimizations.\n # See http://lwn.net/Articles/192624/ .\n \"-Wl,-O1\",\n \"-Wl,--gc-sections\",\n ]\n }\n}\n\nconfig(\"default_stack_frames\") {\n if (is_posix && !(is_mac || is_ios)) {\n if (using_sanitizer || enable_profiling || is_debug ||\n current_cpu == \"arm64\") {\n # Explicitly ask for frame pointers, otherwise:\n # * Stacks may be missing for sanitizer and profiling builds.\n # * Debug tcmalloc can crash (crbug.com/636489).\n # * Stacks may be missing for arm64 crash dumps (crbug.com/391706).\n cflags = [ \"-fno-omit-frame-pointer\" ]\n } else if (is_android) {\n cflags = [ \"-fomit-frame-pointer\" ]\n }\n }\n}\n\n# Default \"optimization on\" config.\nconfig(\"optimize\") {\n if (is_win) {\n # TODO(thakis): Remove is_clang here, https://crbug.com/598772\n if (is_official_build && full_wpo_on_official && !is_clang) {\n common_optimize_on_cflags += [\n \"/GL\", # Whole program optimization.\n\n # Disable Warning 4702 (\"Unreachable code\") for the WPO/PGO builds.\n # Probably anything that this would catch that wouldn't be caught in a\n # normal build isn't going to actually be a bug, so the incremental\n # value of C4702 for PGO builds is likely very small.\n \"/wd4702\",\n ]\n }\n\n # Favor size over speed, /O1 must be before the common flags. The GYP\n # build also specifies /Os and /GF but these are implied by /O1.\n cflags = [ \"/O1\" ] + common_optimize_on_cflags + [ \"/Oi\" ]\n } else if (optimize_for_size) {\n # Favor size over speed.\n cflags = [ \"-Os\" ] + common_optimize_on_cflags\n } else {\n cflags = [ \"-O2\" ] + common_optimize_on_cflags\n }\n ldflags = common_optimize_on_ldflags\n}\n\n# Same config as 'optimize' but without the WPO flag.\nconfig(\"optimize_no_wpo\") {\n if (is_win) {\n # Favor size over speed, /O1 must be before the common flags. The GYP\n # build also specifies /Os and /GF but these are implied by /O1.\n cflags = [ \"/O1\" ] + common_optimize_on_cflags + [ \"/Oi\" ]\n } else if (optimize_for_size) {\n # Favor size over speed.\n cflags = [ \"-Os\" ] + common_optimize_on_cflags\n } else if (optimize_for_fuzzing) {\n cflags = [ \"-O1\" ] + common_optimize_on_cflags\n } else {\n cflags = [ \"-O2\" ] + common_optimize_on_cflags\n }\n ldflags = common_optimize_on_ldflags\n}\n\n# Turn off optimizations.\nconfig(\"no_optimize\") {\n if (is_win) {\n cflags = [\n \"/Od\", # Disable optimization.\n \"/Ob0\", # Disable all inlining (on by default).\n ]\n } else if (is_android && !android_full_debug) {\n # On Android we kind of optimize some things that don't affect debugging\n # much even when optimization is disabled to get the binary size down.\n cflags = [ \"-Os\" ]\n } else {\n cflags = [ \"-O0\" ]\n ldflags = []\n }\n}\n\n# Turns up the optimization level. On Windows, this implies whole program\n# optimization and link-time code generation which is very expensive and should\n# be used sparingly.\nconfig(\"optimize_max\") {\n if (is_nacl_irt) {\n # The NaCl IRT is a special case and always wants its own config.\n # Various components do:\n # if (!is_debug) {\n # configs -= [ \"//build/config/compiler:default_optimization\" ]\n # configs += [ \"//build/config/compiler:optimize_max\" ]\n # }\n # So this config has to have the selection logic just like\n # \"default_optimization\", below.\n configs = [ \"//build/config/nacl:irt_optimize\" ]\n } else {\n ldflags = common_optimize_on_ldflags\n if (is_win) {\n # Favor speed over size, /O2 must be before the common flags. The GYP\n # build also specifies /Ot, /Oi, and /GF, but these are implied by /O2.\n cflags = [ \"/O2\" ] + common_optimize_on_cflags\n\n if (is_official_build) {\n if (!is_clang) {\n cflags += [\n \"/GL\", # Whole program optimization.\n\n # Disable Warning 4702 (\"Unreachable code\") for the WPO/PGO builds.\n # Probably anything that this would catch that wouldn't be caught\n # in a normal build isn't going to actually be a bug, so the\n # incremental value of C4702 for PGO builds is likely very small.\n \"/wd4702\",\n ]\n } else if (is_clang && use_lld) {\n cflags += [ \"-flto\" ] # Link-time optimization (whole program optimization).\n }\n }\n } else if (optimize_for_fuzzing) {\n cflags = [ \"-O1\" ] + common_optimize_on_cflags\n } else {\n cflags = [ \"-O2\" ] + common_optimize_on_cflags\n }\n }\n}\n\n# This config can be used to override the default settings for per-component\n# and whole-program optimization, optimizing the particular target for speed\n# instead of code size. This config is exactly the same as \"optimize_max\"\n# except that we use -O3 instead of -O2 on non-win, non-IRT platforms.\n#\n# TODO(crbug.com/621335) - rework how all of these configs are related\n# so that we don't need this disclaimer.\nconfig(\"optimize_speed\") {\n if (is_nacl_irt) {\n # The NaCl IRT is a special case and always wants its own config.\n # Various components do:\n # if (!is_debug) {\n # configs -= [ \"//build/config/compiler:default_optimization\" ]\n # configs += [ \"//build/config/compiler:optimize_max\" ]\n # }\n # So this config has to have the selection logic just like\n # \"default_optimization\", below.\n configs = [ \"//build/config/nacl:irt_optimize\" ]\n } else {\n ldflags = common_optimize_on_ldflags\n if (is_win) {\n # Favor speed over size, /O2 must be before the common flags. The GYP\n # build also specifies /Ot, /Oi, and /GF, but these are implied by /O2.\n cflags = [ \"/O2\" ] + common_optimize_on_cflags\n\n # TODO(thakis): Remove is_clang here, https://crbug.com/598772\n if (is_official_build && !is_clang) {\n cflags += [\n \"/GL\", # Whole program optimization.\n\n # Disable Warning 4702 (\"Unreachable code\") for the WPO/PGO builds.\n # Probably anything that this would catch that wouldn't be caught in a\n # normal build isn't going to actually be a bug, so the incremental\n # value of C4702 for PGO builds is likely very small.\n \"/wd4702\",\n ]\n }\n } else if (optimize_for_fuzzing) {\n cflags = [ \"-O1\" ] + common_optimize_on_cflags\n } else {\n cflags = [ \"-O3\" ] + common_optimize_on_cflags\n }\n }\n}\n\nconfig(\"optimize_fuzzing\") {\n cflags = [ \"-O1\" ] + common_optimize_on_cflags\n ldflags = common_optimize_on_ldflags\n visibility = [ \":default_optimization\" ]\n}\n\n# The default optimization applied to all targets. This will be equivalent to\n# either \"optimize\" or \"no_optimize\", depending on the build flags.\nconfig(\"default_optimization\") {\n if (is_nacl_irt) {\n # The NaCl IRT is a special case and always wants its own config.\n # It gets optimized the same way regardless of the type of build.\n configs = [ \"//build/config/nacl:irt_optimize\" ]\n } else if (is_debug) {\n configs = [ \":no_optimize\" ]\n } else if (optimize_for_fuzzing) {\n assert(!is_win, \"Fuzzing optimize level not supported on Windows\")\n configs = [ \":optimize_fuzzing\" ]\n } else {\n configs = [ \":optimize\" ]\n }\n}\n\n# GCC supports a form of profile-guided optimization called AFDO, which\n# is used by ChromeOS in their official builds. However,\n# //base/allocator:tcmalloc currently doesn't work correctly with AFDO\n# so we provide separate config so that the flag can be disabled per-target.\n# TODO(crbug.com/633719): Remove this config once tcmalloc works with AFDO\n# or we remove tcmalloc or we stop using AFDO.\nconfig(\"afdo\") {\n if (auto_profile_path != \"\" && current_toolchain == default_toolchain) {\n cflags = [ \"-fauto-profile=${auto_profile_path}\" ]\n }\n}\n\n# Symbols ----------------------------------------------------------------------\n\n# The BUILDCONFIG file sets the \"default_symbols\" config on targets by\n# default. It will be equivalent to one the three specific symbol levels.\n#\n# You can override the symbol level on a per-target basis by removing the\n# default config and then adding the named one you want:\n#\n# configs -= [ \"//build/config/compiler:default_symbols\" ]\n# configs += [ \"//build/config/compiler:symbols\" ]\n\n# Full symbols.\nconfig(\"symbols\") {\n if (is_win) {\n cflags = [ \"/Zi\" ] # Produce PDB file, no edit and continue.\n\n if (is_win_fastlink) {\n # Tell VS 2015+ to create a PDB that references debug\n # information in .obj and .lib files instead of copying\n # it all. This flag is incompatible with /PROFILE\n ldflags = [ \"/DEBUG:FASTLINK\" ]\n } else {\n ldflags = [ \"/DEBUG\" ]\n }\n } else {\n if (is_mac || is_ios) {\n cflags = [ \"-gdwarf-2\" ]\n if (is_mac && enable_dsyms) {\n # If generating dSYMs, specify -fno-standalone-debug. This was\n # originally specified for https://crbug.com/479841 because dsymutil\n # could not handle a 4GB dSYM file. But dsymutil from Xcodes prior to\n # version 7 also produces debug data that is incompatible with Breakpad\n # dump_syms, so this is still required (https://crbug.com/622406).\n cflags += [ \"-fno-standalone-debug\" ]\n }\n } else if (is_android) {\n # Breakpad can't handle DWARF 4 symbols properly yet, so use DWARF 3\n # explicitly on android where we are hitting https://crbug.com/638485.\n # The arguments MUST be in this order because of a gcc arg parsing bug.\n cflags = [\n \"-gdwarf-3\",\n \"-g2\",\n ]\n } else {\n cflags = [ \"-g2\" ]\n }\n if (use_debug_fission) {\n cflags += [ \"-gsplit-dwarf\" ]\n }\n asmflags = cflags\n ldflags = []\n }\n}\n\n# Minimal symbols.\nconfig(\"minimal_symbols\") {\n if (is_win) {\n # Linker symbols for backtraces only.\n cflags = []\n ldflags = [ \"/DEBUG\" ]\n } else {\n if (is_android) {\n # Breakpad can't handle DWARF 4 symbols properly yet, so use DWARF 3\n # explicitly on android where we are hitting https://crbug.com/638485.\n # The arguments MUST be in this order because of a gcc arg parsing bug.\n cflags = [\n \"-gdwarf-3\",\n \"-g1\",\n ]\n } else {\n cflags = [ \"-g1\" ]\n }\n if (use_debug_fission) {\n cflags += [ \"-gsplit-dwarf\" ]\n }\n asmflags = cflags\n ldflags = []\n }\n}\n\n# No symbols.\nconfig(\"no_symbols\") {\n if (!is_win) {\n cflags = [ \"-g0\" ]\n asmflags = cflags\n }\n}\n\n# Default symbols.\nconfig(\"default_symbols\") {\n if (symbol_level == 0) {\n configs = [ \":no_symbols\" ]\n } else if (symbol_level == 1) {\n configs = [ \":minimal_symbols\" ]\n } else if (symbol_level == 2) {\n configs = [ \":symbols\" ]\n } else {\n assert(false)\n }\n}\n\nif (is_ios || is_mac) {\n # On Mac and iOS, this enables support for ARC (automatic ref-counting).\n # See http://clang.llvm.org/docs/AutomaticReferenceCounting.html.\n config(\"enable_arc\") {\n common_flags = [ \"-fobjc-arc\" ]\n cflags_objc = common_flags\n cflags_objcc = common_flags\n }\n}\n" }, { "path": "src/test/resources/samples/langs/GN/BUILD.gn", "content": "# Copyright 2014 The Chromium Authors. All rights reserved.\n# Use of this source code is governed by a BSD-style license that can be\n# found in the LICENSE file.\n\nimport(\"//build/config/android/config.gni\")\nimport(\"//build/config/arm.gni\")\nimport(\"//build/config/dcheck_always_on.gni\")\nimport(\"//build/config/mips.gni\")\nimport(\"//build/config/sanitizers/sanitizers.gni\")\n\nif (is_android) {\n import(\"//build/config/android/rules.gni\")\n}\n\nimport(\"gni/v8.gni\")\nimport(\"gni/isolate.gni\")\nimport(\"//build_overrides/v8.gni\")\n\nimport(\"snapshot_toolchain.gni\")\n\ndeclare_args() {\n # Print to stdout on Android.\n v8_android_log_stdout = false\n\n # Sets -DVERIFY_HEAP.\n v8_enable_verify_heap = false\n\n # Enable compiler warnings when using V8_DEPRECATED apis.\n v8_deprecation_warnings = false\n\n # Enable compiler warnings when using V8_DEPRECATE_SOON apis.\n v8_imminent_deprecation_warnings = \"\"\n\n # Embeds the given script into the snapshot.\n v8_embed_script = \"\"\n\n # Sets -dENABLE_DISASSEMBLER.\n v8_enable_disassembler = \"\"\n\n # Sets -dENABLE_GDB_JIT_INTERFACE.\n v8_enable_gdbjit = \"\"\n\n # Sets -dENABLE_HANDLE_ZAPPING.\n v8_enable_handle_zapping = is_debug\n\n # Enable ECMAScript Internationalization API. Enabling this feature will\n # add a dependency on the ICU library.\n v8_enable_i18n_support = true\n\n # Enable slow dchecks.\n v8_enable_slow_dchecks = false\n\n # Interpreted regexp engine exists as platform-independent alternative\n # based where the regular expression is compiled to a bytecode.\n v8_interpreted_regexp = false\n\n # Sets -dOBJECT_PRINT.\n v8_object_print = \"\"\n\n # With post mortem support enabled, metadata is embedded into libv8 that\n # describes various parameters of the VM for use by debuggers. See\n # tools/gen-postmortem-metadata.py for details.\n v8_postmortem_support = false\n\n # Similar to vfp but on MIPS.\n v8_can_use_fpu_instructions = true\n\n # Similar to the ARM hard float ABI but on MIPS.\n v8_use_mips_abi_hardfloat = true\n}\n\n# Set project-specific defaults for some args if not provided in args.gn. The\n# defaults can be set in the respective build_overrides files.\nif (v8_imminent_deprecation_warnings == \"\") {\n if (defined(v8_imminent_deprecation_warnings_default)) {\n v8_imminent_deprecation_warnings = v8_imminent_deprecation_warnings_default\n } else {\n v8_imminent_deprecation_warnings = false\n }\n}\nif (v8_enable_gdbjit == \"\") {\n if (defined(v8_enable_gdbjit_default)) {\n v8_enable_gdbjit = v8_enable_gdbjit_default\n } else {\n v8_enable_gdbjit = false\n }\n}\n\n# Derived defaults.\nif (v8_object_print == \"\") {\n v8_object_print = is_debug && !v8_optimized_debug\n}\nif (v8_enable_disassembler == \"\") {\n v8_enable_disassembler = is_debug && !v8_optimized_debug\n}\n\nv8_generated_peephole_source = \"$target_gen_dir/bytecode-peephole-table.cc\"\nv8_random_seed = \"314159265\"\nv8_toolset_for_shell = \"host\"\n\n###############################################################################\n# Configurations\n#\nconfig(\"internal_config\") {\n visibility = [ \":*\" ] # Only targets in this file can depend on this.\n\n include_dirs = [ \".\" ]\n\n if (is_component_build) {\n defines = [\n \"V8_SHARED\",\n \"BUILDING_V8_SHARED\",\n ]\n }\n}\n\nconfig(\"internal_config_base\") {\n visibility = [ \":*\" ] # Only targets in this file can depend on this.\n\n include_dirs = [ \".\" ]\n}\n\n# This config should be applied to code using the libplatform.\nconfig(\"libplatform_config\") {\n include_dirs = [ \"include\" ]\n}\n\n# This config should be applied to code using the libsampler.\nconfig(\"libsampler_config\") {\n include_dirs = [ \"include\" ]\n}\n\n# This config should only be applied to code using V8 and not any V8 code\n# itself.\nconfig(\"external_config\") {\n if (is_component_build) {\n defines = [\n \"V8_SHARED\",\n \"USING_V8_SHARED\",\n ]\n }\n include_dirs = [ \"include\" ]\n libs = []\n if (is_android && current_toolchain != host_toolchain) {\n libs += [ \"log\" ]\n }\n}\n\n# This config should only be applied to code that needs to be explicitly\n# aware of whether we are using startup data or not.\nconfig(\"external_startup_data\") {\n if (v8_use_external_startup_data) {\n defines = [ \"V8_USE_EXTERNAL_STARTUP_DATA\" ]\n }\n}\n\nconfig(\"features\") {\n visibility = [ \":*\" ] # Only targets in this file can depend on this.\n\n defines = []\n\n if (v8_enable_disassembler) {\n defines += [ \"ENABLE_DISASSEMBLER\" ]\n }\n if (v8_enable_gdbjit) {\n defines += [ \"ENABLE_GDB_JIT_INTERFACE\" ]\n }\n if (v8_object_print) {\n defines += [ \"OBJECT_PRINT\" ]\n }\n if (v8_enable_verify_heap) {\n defines += [ \"VERIFY_HEAP\" ]\n }\n if (v8_interpreted_regexp) {\n defines += [ \"V8_INTERPRETED_REGEXP\" ]\n }\n if (v8_deprecation_warnings) {\n defines += [ \"V8_DEPRECATION_WARNINGS\" ]\n }\n if (v8_imminent_deprecation_warnings) {\n defines += [ \"V8_IMMINENT_DEPRECATION_WARNINGS\" ]\n }\n if (v8_enable_i18n_support) {\n defines += [ \"V8_I18N_SUPPORT\" ]\n }\n if (v8_enable_handle_zapping) {\n defines += [ \"ENABLE_HANDLE_ZAPPING\" ]\n }\n if (v8_use_external_startup_data) {\n defines += [ \"V8_USE_EXTERNAL_STARTUP_DATA\" ]\n }\n}\n\nconfig(\"toolchain\") {\n visibility = [ \":*\" ] # Only targets in this file can depend on this.\n\n defines = []\n cflags = []\n ldflags = []\n\n if (v8_current_cpu == \"arm\") {\n defines += [ \"V8_TARGET_ARCH_ARM\" ]\n if (arm_version == 7) {\n defines += [ \"CAN_USE_ARMV7_INSTRUCTIONS\" ]\n }\n if (arm_fpu == \"vfpv3-d16\") {\n defines += [ \"CAN_USE_VFP3_INSTRUCTIONS\" ]\n } else if (arm_fpu == \"vfpv3\") {\n defines += [\n \"CAN_USE_VFP3_INSTRUCTIONS\",\n \"CAN_USE_VFP32DREGS\",\n ]\n } else if (arm_fpu == \"neon\") {\n defines += [\n \"CAN_USE_VFP3_INSTRUCTIONS\",\n \"CAN_USE_VFP32DREGS\",\n \"CAN_USE_NEON\",\n ]\n }\n\n # TODO(jochen): Add support for arm_test_noprobe.\n\n if (current_cpu != \"arm\") {\n # These defines ares used for the ARM simulator.\n if (arm_float_abi == \"hard\") {\n defines += [ \"USE_EABI_HARDFLOAT=1\" ]\n } else if (arm_float_abi == \"softfp\") {\n defines += [ \"USE_EABI_HARDFLOAT=0\" ]\n }\n }\n }\n if (v8_current_cpu == \"arm64\") {\n defines += [ \"V8_TARGET_ARCH_ARM64\" ]\n }\n\n # TODO(jochen): Add support for mips.\n if (v8_current_cpu == \"mipsel\") {\n defines += [ \"V8_TARGET_ARCH_MIPS\" ]\n if (v8_can_use_fpu_instructions) {\n defines += [ \"CAN_USE_FPU_INSTRUCTIONS\" ]\n }\n if (v8_use_mips_abi_hardfloat) {\n defines += [\n \"__mips_hard_float=1\",\n \"CAN_USE_FPU_INSTRUCTIONS\",\n ]\n } else {\n defines += [ \"__mips_soft_float=1\" ]\n }\n if (mips_arch_variant == \"r6\") {\n defines += [\n \"_MIPS_ARCH_MIPS32R6\",\n \"FPU_MODE_FP64\",\n ]\n } else if (mips_arch_variant == \"r2\") {\n defines += [ \"_MIPS_ARCH_MIPS32R2\" ]\n if (mips_fpu_mode == \"fp64\") {\n defines += [ \"FPU_MODE_FP64\" ]\n } else if (mips_fpu_mode == \"fpxx\") {\n defines += [ \"FPU_MODE_FPXX\" ]\n } else if (mips_fpu_mode == \"fp32\") {\n defines += [ \"FPU_MODE_FP32\" ]\n }\n } else if (mips_arch_variant == \"r1\") {\n defines += [ \"FPU_MODE_FP32\" ]\n }\n\n # TODO(jochen): Add support for mips_arch_variant rx and loongson.\n }\n\n # TODO(jochen): Add support for mips64.\n if (v8_current_cpu == \"mips64el\") {\n defines += [ \"V8_TARGET_ARCH_MIPS64\" ]\n if (v8_can_use_fpu_instructions) {\n defines += [ \"CAN_USE_FPU_INSTRUCTIONS\" ]\n }\n\n # TODO(jochen): Add support for big endian host byteorder.\n defines += [ \"V8_TARGET_ARCH_MIPS64_LE\" ]\n if (v8_use_mips_abi_hardfloat) {\n defines += [\n \"__mips_hard_float=1\",\n \"CAN_USE_FPU_INSTRUCTIONS\",\n ]\n } else {\n defines += [ \"__mips_soft_float=1\" ]\n }\n if (mips_arch_variant == \"r6\") {\n defines += [ \"_MIPS_ARCH_MIPS64R6\" ]\n } else if (mips_arch_variant == \"r2\") {\n defines += [ \"_MIPS_ARCH_MIPS64R2\" ]\n }\n }\n if (v8_current_cpu == \"s390\" || v8_current_cpu == \"s390x\") {\n defines += [ \"V8_TARGET_ARCH_S390\" ]\n if (v8_current_cpu == \"s390x\") {\n defines += [ \"V8_TARGET_ARCH_S390X\" ]\n }\n if (host_cpu == \"x64\" || host_cpu == \"x86\") {\n defines += [ \"V8_TARGET_ARCH_S390_LE_SIM\" ]\n }\n }\n if (v8_current_cpu == \"x86\") {\n defines += [ \"V8_TARGET_ARCH_IA32\" ]\n if (is_win) {\n # Ensure no surprising artifacts from 80bit double math with x86.\n cflags += [ \"/arch:SSE2\" ]\n }\n }\n if (v8_current_cpu == \"x64\") {\n defines += [ \"V8_TARGET_ARCH_X64\" ]\n if (is_win) {\n # Increase the initial stack size. The default is 1MB, this is 2MB. This\n # applies only to executables and shared libraries produced by V8 since\n # ldflags are not pushed to dependants.\n ldflags += [ \"/STACK:2097152\" ]\n }\n }\n if (is_android && v8_android_log_stdout) {\n defines += [ \"V8_ANDROID_LOG_STDOUT\" ]\n }\n\n # TODO(jochen): Support v8_enable_prof on Windows.\n # TODO(jochen): Add support for compiling with simulators.\n\n if (is_debug) {\n if (is_linux && v8_enable_backtrace) {\n ldflags += [ \"-rdynamic\" ]\n }\n\n # TODO(jochen): Add support for different debug optimization levels.\n defines += [\n \"ENABLE_DISASSEMBLER\",\n \"V8_ENABLE_CHECKS\",\n \"OBJECT_PRINT\",\n \"VERIFY_HEAP\",\n \"DEBUG\",\n \"TRACE_MAPS\",\n ]\n if (v8_enable_slow_dchecks) {\n defines += [ \"ENABLE_SLOW_DCHECKS\" ]\n }\n } else if (dcheck_always_on) {\n defines += [ \"DEBUG\" ]\n }\n}\n\n###############################################################################\n# Actions\n#\n\naction(\"js2c\") {\n visibility = [ \":*\" ] # Only targets in this file can depend on this.\n\n script = \"tools/js2c.py\"\n\n # The script depends on this other script, this rule causes a rebuild if it\n # changes.\n inputs = [\n \"tools/jsmin.py\",\n ]\n\n # NOSORT\n sources = [\n \"src/js/macros.py\",\n \"src/messages.h\",\n \"src/js/prologue.js\",\n \"src/js/runtime.js\",\n \"src/js/v8natives.js\",\n \"src/js/symbol.js\",\n \"src/js/array.js\",\n \"src/js/string.js\",\n \"src/js/math.js\",\n \"src/js/regexp.js\",\n \"src/js/arraybuffer.js\",\n \"src/js/typedarray.js\",\n \"src/js/iterator-prototype.js\",\n \"src/js/collection.js\",\n \"src/js/weak-collection.js\",\n \"src/js/collection-iterator.js\",\n \"src/js/promise.js\",\n \"src/js/messages.js\",\n \"src/js/array-iterator.js\",\n \"src/js/string-iterator.js\",\n \"src/js/templates.js\",\n \"src/js/spread.js\",\n \"src/js/proxy.js\",\n \"src/debug/mirrors.js\",\n \"src/debug/debug.js\",\n \"src/debug/liveedit.js\",\n ]\n\n outputs = [\n \"$target_gen_dir/libraries.cc\",\n ]\n\n if (v8_enable_i18n_support) {\n sources += [ \"src/js/i18n.js\" ]\n }\n\n args = [\n rebase_path(\"$target_gen_dir/libraries.cc\", root_build_dir),\n \"CORE\",\n ] + rebase_path(sources, root_build_dir)\n\n if (v8_use_external_startup_data) {\n outputs += [ \"$target_gen_dir/libraries.bin\" ]\n args += [\n \"--startup_blob\",\n rebase_path(\"$target_gen_dir/libraries.bin\", root_build_dir),\n ]\n }\n}\n\naction(\"js2c_experimental\") {\n visibility = [ \":*\" ] # Only targets in this file can depend on this.\n\n script = \"tools/js2c.py\"\n\n # The script depends on this other script, this rule causes a rebuild if it\n # changes.\n inputs = [\n \"tools/jsmin.py\",\n ]\n\n # NOSORT\n sources = [\n \"src/js/macros.py\",\n \"src/messages.h\",\n \"src/js/harmony-async-await.js\",\n \"src/js/harmony-atomics.js\",\n \"src/js/harmony-simd.js\",\n \"src/js/harmony-string-padding.js\",\n ]\n\n outputs = [\n \"$target_gen_dir/experimental-libraries.cc\",\n ]\n\n if (v8_enable_i18n_support) {\n sources += [\n \"src/js/icu-case-mapping.js\",\n \"src/js/intl-extra.js\",\n ]\n }\n\n args = [\n rebase_path(\"$target_gen_dir/experimental-libraries.cc\",\n root_build_dir),\n \"EXPERIMENTAL\",\n ] + rebase_path(sources, root_build_dir)\n\n if (v8_use_external_startup_data) {\n outputs += [ \"$target_gen_dir/libraries_experimental.bin\" ]\n args += [\n \"--startup_blob\",\n rebase_path(\"$target_gen_dir/libraries_experimental.bin\", root_build_dir),\n ]\n }\n}\n\naction(\"js2c_extras\") {\n visibility = [ \":*\" ] # Only targets in this file can depend on this.\n\n script = \"tools/js2c.py\"\n\n # The script depends on this other script, this rule causes a rebuild if it\n # changes.\n inputs = [\n \"tools/jsmin.py\",\n ]\n\n sources = v8_extra_library_files\n\n outputs = [\n \"$target_gen_dir/extras-libraries.cc\",\n ]\n\n args = [\n rebase_path(\"$target_gen_dir/extras-libraries.cc\", root_build_dir),\n \"EXTRAS\",\n ] + rebase_path(sources, root_build_dir)\n\n if (v8_use_external_startup_data) {\n outputs += [ \"$target_gen_dir/libraries_extras.bin\" ]\n args += [\n \"--startup_blob\",\n rebase_path(\"$target_gen_dir/libraries_extras.bin\", root_build_dir),\n ]\n }\n}\n\naction(\"js2c_experimental_extras\") {\n visibility = [ \":*\" ] # Only targets in this file can depend on this.\n\n script = \"tools/js2c.py\"\n\n # The script depends on this other script, this rule causes a rebuild if it\n # changes.\n inputs = [\n \"tools/jsmin.py\",\n ]\n\n sources = v8_experimental_extra_library_files\n\n outputs = [\n \"$target_gen_dir/experimental-extras-libraries.cc\",\n ]\n\n args = [\n rebase_path(\"$target_gen_dir/experimental-extras-libraries.cc\",\n root_build_dir),\n \"EXPERIMENTAL_EXTRAS\",\n ] + rebase_path(sources, root_build_dir)\n\n if (v8_use_external_startup_data) {\n outputs += [ \"$target_gen_dir/libraries_experimental_extras.bin\" ]\n args += [\n \"--startup_blob\",\n rebase_path(\"$target_gen_dir/libraries_experimental_extras.bin\",\n root_build_dir),\n ]\n }\n}\n\naction(\"d8_js2c\") {\n visibility = [ \":*\" ] # Only targets in this file can depend on this.\n\n script = \"tools/js2c.py\"\n\n # NOSORT\n inputs = [\n \"src/d8.js\",\n \"src/js/macros.py\",\n ]\n\n outputs = [\n \"$target_gen_dir/d8-js.cc\",\n ]\n\n args = rebase_path(outputs, root_build_dir) + [ \"D8\" ] +\n rebase_path(inputs, root_build_dir)\n}\n\nif (is_android && enable_java_templates) {\n android_assets(\"v8_external_startup_data_assets\") {\n if (v8_use_external_startup_data) {\n deps = [\n \"//v8\",\n ]\n sources = [\n \"$root_out_dir/natives_blob.bin\",\n ]\n renaming_sources = [ \"$root_out_dir/snapshot_blob.bin\" ]\n if (current_cpu == \"arm\" || current_cpu == \"x86\" ||\n current_cpu == \"mipsel\") {\n renaming_destinations = [ \"snapshot_blob_32.bin\" ]\n } else {\n renaming_destinations = [ \"snapshot_blob_64.bin\" ]\n }\n disable_compression = true\n }\n }\n}\n\nif (v8_use_external_startup_data) {\n action(\"natives_blob\") {\n visibility = [ \":*\" ] # Only targets in this file can depend on this.\n\n deps = [\n \":js2c\",\n \":js2c_experimental\",\n \":js2c_experimental_extras\",\n \":js2c_extras\",\n ]\n\n # NOSORT\n sources = [\n \"$target_gen_dir/libraries.bin\",\n \"$target_gen_dir/libraries_experimental.bin\",\n \"$target_gen_dir/libraries_extras.bin\",\n \"$target_gen_dir/libraries_experimental_extras.bin\",\n ]\n\n outputs = [\n \"$root_out_dir/natives_blob.bin\",\n ]\n\n script = \"tools/concatenate-files.py\"\n\n args = rebase_path(sources + outputs, root_build_dir)\n }\n}\n\naction(\"postmortem-metadata\") {\n # Only targets in this file and the top-level visibility target can\n # depend on this.\n visibility = [\n \":*\",\n \"//:gn_visibility\",\n ]\n\n script = \"tools/gen-postmortem-metadata.py\"\n\n # NOSORT\n sources = [\n \"src/objects.h\",\n \"src/objects-inl.h\",\n ]\n\n outputs = [\n \"$target_gen_dir/debug-support.cc\",\n ]\n\n args = rebase_path(outputs, root_build_dir) +\n rebase_path(sources, root_build_dir)\n}\n\naction(\"run_mksnapshot\") {\n visibility = [ \":*\" ] # Only targets in this file can depend on this.\n\n deps = [\n \":mksnapshot($v8_snapshot_toolchain)\",\n ]\n\n script = \"tools/run.py\"\n\n sources = []\n\n outputs = [\n \"$target_gen_dir/snapshot.cc\",\n ]\n\n args = [\n \"./\" + rebase_path(get_label_info(\":mksnapshot($v8_snapshot_toolchain)\",\n \"root_out_dir\") + \"/mksnapshot\",\n root_build_dir),\n \"--startup_src\",\n rebase_path(\"$target_gen_dir/snapshot.cc\", root_build_dir),\n ]\n\n if (v8_random_seed != \"0\") {\n args += [\n \"--random-seed\",\n v8_random_seed,\n ]\n }\n\n if (v8_use_external_startup_data) {\n outputs += [ \"$root_out_dir/snapshot_blob.bin\" ]\n args += [\n \"--startup_blob\",\n rebase_path(\"$root_out_dir/snapshot_blob.bin\", root_build_dir),\n ]\n }\n\n if (v8_embed_script != \"\") {\n sources += [ v8_embed_script ]\n args += [ rebase_path(v8_embed_script, root_build_dir) ]\n }\n}\n\naction(\"run_mkpeephole\") {\n visibility = [ \":*\" ] # Only targets in this file can depend on this.\n\n deps = [\n \":mkpeephole($v8_snapshot_toolchain)\",\n ]\n\n outputs = [\n v8_generated_peephole_source,\n ]\n\n sources = []\n\n script = \"tools/run.py\"\n\n args = [\n \"./\" + rebase_path(get_label_info(\":mkpeephole($v8_snapshot_toolchain)\",\n \"root_out_dir\") + \"/mkpeephole\",\n root_build_dir),\n rebase_path(v8_generated_peephole_source, root_build_dir),\n ]\n}\n\naction(\"v8_dump_build_config\") {\n script = \"tools/testrunner/utils/dump_build_config.py\"\n outputs = [\n \"$root_out_dir/v8_build_config.json\",\n ]\n args = [\n rebase_path(\"$root_out_dir/v8_build_config.json\", root_build_dir),\n \"dcheck_always_on=$dcheck_always_on\",\n \"is_asan=$is_asan\",\n \"is_cfi=$is_cfi\",\n \"is_component_build=$is_component_build\",\n \"is_debug=$is_debug\",\n \"is_msan=$is_msan\",\n \"is_tsan=$is_tsan\",\n \"target_cpu=\\\"$target_cpu\\\"\",\n \"v8_enable_i18n_support=$v8_enable_i18n_support\",\n \"v8_target_cpu=\\\"$v8_target_cpu\\\"\",\n \"v8_use_snapshot=$v8_use_snapshot\",\n ]\n}\n\n###############################################################################\n# Source Sets (aka static libraries)\n#\n\nsource_set(\"v8_maybe_snapshot\") {\n if (v8_use_snapshot && v8_use_external_startup_data) {\n public_deps = [\n \":v8_external_snapshot\",\n ]\n } else if (v8_use_snapshot) {\n public_deps = [\n \":v8_snapshot\",\n ]\n } else {\n # Ignore v8_use_external_startup_data setting if no snapshot is used.\n public_deps = [\n \":v8_nosnapshot\",\n ]\n }\n}\n\nv8_source_set(\"v8_nosnapshot\") {\n visibility = [ \":*\" ] # Only targets in this file can depend on this.\n\n deps = [\n \":js2c\",\n \":js2c_experimental\",\n \":js2c_experimental_extras\",\n \":js2c_extras\",\n \":v8_base\",\n ]\n\n sources = [\n \"$target_gen_dir/experimental-extras-libraries.cc\",\n \"$target_gen_dir/experimental-libraries.cc\",\n \"$target_gen_dir/extras-libraries.cc\",\n \"$target_gen_dir/libraries.cc\",\n \"src/snapshot/snapshot-empty.cc\",\n ]\n\n configs = [ \":internal_config\" ]\n}\n\nv8_source_set(\"v8_snapshot\") {\n # Only targets in this file and the top-level visibility target can\n # depend on this.\n visibility = [\n \":*\",\n \"//:gn_visibility\",\n ]\n\n deps = [\n \":js2c\",\n \":js2c_experimental\",\n \":js2c_experimental_extras\",\n \":js2c_extras\",\n \":v8_base\",\n ]\n public_deps = [\n # This should be public so downstream targets can declare the snapshot\n # output file as their inputs.\n \":run_mksnapshot\",\n ]\n\n sources = [\n \"$target_gen_dir/experimental-extras-libraries.cc\",\n \"$target_gen_dir/experimental-libraries.cc\",\n \"$target_gen_dir/extras-libraries.cc\",\n \"$target_gen_dir/libraries.cc\",\n \"$target_gen_dir/snapshot.cc\",\n ]\n\n configs = [ \":internal_config\" ]\n}\n\nif (v8_use_external_startup_data) {\n v8_source_set(\"v8_external_snapshot\") {\n visibility = [ \":*\" ] # Only targets in this file can depend on this.\n\n deps = [\n \":js2c\",\n \":js2c_experimental\",\n \":js2c_experimental_extras\",\n \":js2c_extras\",\n \":v8_base\",\n ]\n public_deps = [\n \":natives_blob\",\n \":run_mksnapshot\",\n ]\n\n sources = [\n \"src/snapshot/natives-external.cc\",\n \"src/snapshot/snapshot-external.cc\",\n ]\n\n configs = [ \":internal_config\" ]\n }\n}\n\nv8_source_set(\"v8_base\") {\n visibility = [ \":*\" ] # Only targets in this file can depend on this.\n\n sources = [\n \"//base/trace_event/common/trace_event_common.h\",\n \"include/v8-debug.h\",\n \"include/v8-experimental.h\",\n \"include/v8-platform.h\",\n \"include/v8-profiler.h\",\n \"include/v8-testing.h\",\n \"include/v8-util.h\",\n \"include/v8-version.h\",\n \"include/v8.h\",\n \"include/v8config.h\",\n \"src/accessors.cc\",\n \"src/accessors.h\",\n \"src/address-map.cc\",\n \"src/address-map.h\",\n \"src/allocation-site-scopes.cc\",\n \"src/allocation-site-scopes.h\",\n \"src/allocation.cc\",\n \"src/allocation.h\",\n \"src/api-arguments-inl.h\",\n \"src/api-arguments.cc\",\n \"src/api-arguments.h\",\n \"src/api-experimental.cc\",\n \"src/api-experimental.h\",\n \"src/api-natives.cc\",\n \"src/api-natives.h\",\n \"src/api.cc\",\n \"src/api.h\",\n \"src/arguments.cc\",\n \"src/arguments.h\",\n \"src/asmjs/asm-js.cc\",\n \"src/asmjs/asm-js.h\",\n \"src/asmjs/asm-typer.cc\",\n \"src/asmjs/asm-typer.h\",\n \"src/asmjs/asm-types.cc\",\n \"src/asmjs/asm-types.h\",\n \"src/asmjs/asm-wasm-builder.cc\",\n \"src/asmjs/asm-wasm-builder.h\",\n \"src/assembler.cc\",\n \"src/assembler.h\",\n \"src/assert-scope.cc\",\n \"src/assert-scope.h\",\n \"src/ast/ast-expression-rewriter.cc\",\n \"src/ast/ast-expression-rewriter.h\",\n \"src/ast/ast-literal-reindexer.cc\",\n \"src/ast/ast-literal-reindexer.h\",\n \"src/ast/ast-numbering.cc\",\n \"src/ast/ast-numbering.h\",\n \"src/ast/ast-traversal-visitor.h\",\n \"src/ast/ast-type-bounds.h\",\n \"src/ast/ast-value-factory.cc\",\n \"src/ast/ast-value-factory.h\",\n \"src/ast/ast.cc\",\n \"src/ast/ast.h\",\n \"src/ast/context-slot-cache.cc\",\n \"src/ast/context-slot-cache.h\",\n \"src/ast/modules.cc\",\n \"src/ast/modules.h\",\n \"src/ast/prettyprinter.cc\",\n \"src/ast/prettyprinter.h\",\n \"src/ast/scopeinfo.cc\",\n \"src/ast/scopeinfo.h\",\n \"src/ast/scopes.cc\",\n \"src/ast/scopes.h\",\n \"src/ast/variables.cc\",\n \"src/ast/variables.h\",\n \"src/background-parsing-task.cc\",\n \"src/background-parsing-task.h\",\n \"src/bailout-reason.cc\",\n \"src/bailout-reason.h\",\n \"src/basic-block-profiler.cc\",\n \"src/basic-block-profiler.h\",\n \"src/bignum-dtoa.cc\",\n \"src/bignum-dtoa.h\",\n \"src/bignum.cc\",\n \"src/bignum.h\",\n \"src/bit-vector.cc\",\n \"src/bit-vector.h\",\n \"src/bootstrapper.cc\",\n \"src/bootstrapper.h\",\n \"src/builtins/builtins-api.cc\",\n \"src/builtins/builtins-array.cc\",\n \"src/builtins/builtins-arraybuffer.cc\",\n \"src/builtins/builtins-boolean.cc\",\n \"src/builtins/builtins-call.cc\",\n \"src/builtins/builtins-callsite.cc\",\n \"src/builtins/builtins-conversion.cc\",\n \"src/builtins/builtins-dataview.cc\",\n \"src/builtins/builtins-date.cc\",\n \"src/builtins/builtins-debug.cc\",\n \"src/builtins/builtins-error.cc\",\n \"src/builtins/builtins-function.cc\",\n \"src/builtins/builtins-generator.cc\",\n \"src/builtins/builtins-global.cc\",\n \"src/builtins/builtins-handler.cc\",\n \"src/builtins/builtins-internal.cc\",\n \"src/builtins/builtins-interpreter.cc\",\n \"src/builtins/builtins-json.cc\",\n \"src/builtins/builtins-math.cc\",\n \"src/builtins/builtins-number.cc\",\n \"src/builtins/builtins-object.cc\",\n \"src/builtins/builtins-proxy.cc\",\n \"src/builtins/builtins-reflect.cc\",\n \"src/builtins/builtins-sharedarraybuffer.cc\",\n \"src/builtins/builtins-string.cc\",\n \"src/builtins/builtins-symbol.cc\",\n \"src/builtins/builtins-typedarray.cc\",\n \"src/builtins/builtins-utils.h\",\n \"src/builtins/builtins.cc\",\n \"src/builtins/builtins.h\",\n \"src/cached-powers.cc\",\n \"src/cached-powers.h\",\n \"src/cancelable-task.cc\",\n \"src/cancelable-task.h\",\n \"src/char-predicates-inl.h\",\n \"src/char-predicates.cc\",\n \"src/char-predicates.h\",\n \"src/checks.h\",\n \"src/code-events.h\",\n \"src/code-factory.cc\",\n \"src/code-factory.h\",\n \"src/code-stub-assembler.cc\",\n \"src/code-stub-assembler.h\",\n \"src/code-stubs-hydrogen.cc\",\n \"src/code-stubs.cc\",\n \"src/code-stubs.h\",\n \"src/codegen.cc\",\n \"src/codegen.h\",\n \"src/collector.h\",\n \"src/compilation-cache.cc\",\n \"src/compilation-cache.h\",\n \"src/compilation-dependencies.cc\",\n \"src/compilation-dependencies.h\",\n \"src/compilation-statistics.cc\",\n \"src/compilation-statistics.h\",\n \"src/compiler-dispatcher/compiler-dispatcher-job.cc\",\n \"src/compiler-dispatcher/compiler-dispatcher-job.h\",\n \"src/compiler-dispatcher/optimizing-compile-dispatcher.cc\",\n \"src/compiler-dispatcher/optimizing-compile-dispatcher.h\",\n \"src/compiler.cc\",\n \"src/compiler.h\",\n \"src/compiler/access-builder.cc\",\n \"src/compiler/access-builder.h\",\n \"src/compiler/access-info.cc\",\n \"src/compiler/access-info.h\",\n \"src/compiler/all-nodes.cc\",\n \"src/compiler/all-nodes.h\",\n \"src/compiler/ast-graph-builder.cc\",\n \"src/compiler/ast-graph-builder.h\",\n \"src/compiler/ast-loop-assignment-analyzer.cc\",\n \"src/compiler/ast-loop-assignment-analyzer.h\",\n \"src/compiler/basic-block-instrumentor.cc\",\n \"src/compiler/basic-block-instrumentor.h\",\n \"src/compiler/branch-elimination.cc\",\n \"src/compiler/branch-elimination.h\",\n \"src/compiler/bytecode-branch-analysis.cc\",\n \"src/compiler/bytecode-branch-analysis.h\",\n \"src/compiler/bytecode-graph-builder.cc\",\n \"src/compiler/bytecode-graph-builder.h\",\n \"src/compiler/bytecode-loop-analysis.cc\",\n \"src/compiler/bytecode-loop-analysis.h\",\n \"src/compiler/c-linkage.cc\",\n \"src/compiler/checkpoint-elimination.cc\",\n \"src/compiler/checkpoint-elimination.h\",\n \"src/compiler/code-assembler.cc\",\n \"src/compiler/code-assembler.h\",\n \"src/compiler/code-generator-impl.h\",\n \"src/compiler/code-generator.cc\",\n \"src/compiler/code-generator.h\",\n \"src/compiler/common-node-cache.cc\",\n \"src/compiler/common-node-cache.h\",\n \"src/compiler/common-operator-reducer.cc\",\n \"src/compiler/common-operator-reducer.h\",\n \"src/compiler/common-operator.cc\",\n \"src/compiler/common-operator.h\",\n \"src/compiler/control-builders.cc\",\n \"src/compiler/control-builders.h\",\n \"src/compiler/control-equivalence.cc\",\n \"src/compiler/control-equivalence.h\",\n \"src/compiler/control-flow-optimizer.cc\",\n \"src/compiler/control-flow-optimizer.h\",\n \"src/compiler/dead-code-elimination.cc\",\n \"src/compiler/dead-code-elimination.h\",\n \"src/compiler/diamond.h\",\n \"src/compiler/effect-control-linearizer.cc\",\n \"src/compiler/effect-control-linearizer.h\",\n \"src/compiler/escape-analysis-reducer.cc\",\n \"src/compiler/escape-analysis-reducer.h\",\n \"src/compiler/escape-analysis.cc\",\n \"src/compiler/escape-analysis.h\",\n \"src/compiler/frame-elider.cc\",\n \"src/compiler/frame-elider.h\",\n \"src/compiler/frame-states.cc\",\n \"src/compiler/frame-states.h\",\n \"src/compiler/frame.cc\",\n \"src/compiler/frame.h\",\n \"src/compiler/gap-resolver.cc\",\n \"src/compiler/gap-resolver.h\",\n \"src/compiler/graph-reducer.cc\",\n \"src/compiler/graph-reducer.h\",\n \"src/compiler/graph-replay.cc\",\n \"src/compiler/graph-replay.h\",\n \"src/compiler/graph-trimmer.cc\",\n \"src/compiler/graph-trimmer.h\",\n \"src/compiler/graph-visualizer.cc\",\n \"src/compiler/graph-visualizer.h\",\n \"src/compiler/graph.cc\",\n \"src/compiler/graph.h\",\n \"src/compiler/instruction-codes.h\",\n \"src/compiler/instruction-scheduler.cc\",\n \"src/compiler/instruction-scheduler.h\",\n \"src/compiler/instruction-selector-impl.h\",\n \"src/compiler/instruction-selector.cc\",\n \"src/compiler/instruction-selector.h\",\n \"src/compiler/instruction.cc\",\n \"src/compiler/instruction.h\",\n \"src/compiler/int64-lowering.cc\",\n \"src/compiler/int64-lowering.h\",\n \"src/compiler/js-builtin-reducer.cc\",\n \"src/compiler/js-builtin-reducer.h\",\n \"src/compiler/js-call-reducer.cc\",\n \"src/compiler/js-call-reducer.h\",\n \"src/compiler/js-context-specialization.cc\",\n \"src/compiler/js-context-specialization.h\",\n \"src/compiler/js-create-lowering.cc\",\n \"src/compiler/js-create-lowering.h\",\n \"src/compiler/js-frame-specialization.cc\",\n \"src/compiler/js-frame-specialization.h\",\n \"src/compiler/js-generic-lowering.cc\",\n \"src/compiler/js-generic-lowering.h\",\n \"src/compiler/js-global-object-specialization.cc\",\n \"src/compiler/js-global-object-specialization.h\",\n \"src/compiler/js-graph.cc\",\n \"src/compiler/js-graph.h\",\n \"src/compiler/js-inlining-heuristic.cc\",\n \"src/compiler/js-inlining-heuristic.h\",\n \"src/compiler/js-inlining.cc\",\n \"src/compiler/js-inlining.h\",\n \"src/compiler/js-intrinsic-lowering.cc\",\n \"src/compiler/js-intrinsic-lowering.h\",\n \"src/compiler/js-native-context-specialization.cc\",\n \"src/compiler/js-native-context-specialization.h\",\n \"src/compiler/js-operator.cc\",\n \"src/compiler/js-operator.h\",\n \"src/compiler/js-typed-lowering.cc\",\n \"src/compiler/js-typed-lowering.h\",\n \"src/compiler/jump-threading.cc\",\n \"src/compiler/jump-threading.h\",\n \"src/compiler/linkage.cc\",\n \"src/compiler/linkage.h\",\n \"src/compiler/live-range-separator.cc\",\n \"src/compiler/live-range-separator.h\",\n \"src/compiler/liveness-analyzer.cc\",\n \"src/compiler/liveness-analyzer.h\",\n \"src/compiler/load-elimination.cc\",\n \"src/compiler/load-elimination.h\",\n \"src/compiler/loop-analysis.cc\",\n \"src/compiler/loop-analysis.h\",\n \"src/compiler/loop-peeling.cc\",\n \"src/compiler/loop-peeling.h\",\n \"src/compiler/loop-variable-optimizer.cc\",\n \"src/compiler/loop-variable-optimizer.h\",\n \"src/compiler/machine-operator-reducer.cc\",\n \"src/compiler/machine-operator-reducer.h\",\n \"src/compiler/machine-operator.cc\",\n \"src/compiler/machine-operator.h\",\n \"src/compiler/memory-optimizer.cc\",\n \"src/compiler/memory-optimizer.h\",\n \"src/compiler/move-optimizer.cc\",\n \"src/compiler/move-optimizer.h\",\n \"src/compiler/node-aux-data.h\",\n \"src/compiler/node-cache.cc\",\n \"src/compiler/node-cache.h\",\n \"src/compiler/node-marker.cc\",\n \"src/compiler/node-marker.h\",\n \"src/compiler/node-matchers.cc\",\n \"src/compiler/node-matchers.h\",\n \"src/compiler/node-properties.cc\",\n \"src/compiler/node-properties.h\",\n \"src/compiler/node.cc\",\n \"src/compiler/node.h\",\n \"src/compiler/opcodes.cc\",\n \"src/compiler/opcodes.h\",\n \"src/compiler/operation-typer.cc\",\n \"src/compiler/operation-typer.h\",\n \"src/compiler/operator-properties.cc\",\n \"src/compiler/operator-properties.h\",\n \"src/compiler/operator.cc\",\n \"src/compiler/operator.h\",\n \"src/compiler/osr.cc\",\n \"src/compiler/osr.h\",\n \"src/compiler/pipeline-statistics.cc\",\n \"src/compiler/pipeline-statistics.h\",\n \"src/compiler/pipeline.cc\",\n \"src/compiler/pipeline.h\",\n \"src/compiler/raw-machine-assembler.cc\",\n \"src/compiler/raw-machine-assembler.h\",\n \"src/compiler/redundancy-elimination.cc\",\n \"src/compiler/redundancy-elimination.h\",\n \"src/compiler/register-allocator-verifier.cc\",\n \"src/compiler/register-allocator-verifier.h\",\n \"src/compiler/register-allocator.cc\",\n \"src/compiler/register-allocator.h\",\n \"src/compiler/representation-change.cc\",\n \"src/compiler/representation-change.h\",\n \"src/compiler/schedule.cc\",\n \"src/compiler/schedule.h\",\n \"src/compiler/scheduler.cc\",\n \"src/compiler/scheduler.h\",\n \"src/compiler/select-lowering.cc\",\n \"src/compiler/select-lowering.h\",\n \"src/compiler/simplified-lowering.cc\",\n \"src/compiler/simplified-lowering.h\",\n \"src/compiler/simplified-operator-reducer.cc\",\n \"src/compiler/simplified-operator-reducer.h\",\n \"src/compiler/simplified-operator.cc\",\n \"src/compiler/simplified-operator.h\",\n \"src/compiler/source-position.cc\",\n \"src/compiler/source-position.h\",\n \"src/compiler/state-values-utils.cc\",\n \"src/compiler/state-values-utils.h\",\n \"src/compiler/store-store-elimination.cc\",\n \"src/compiler/store-store-elimination.h\",\n \"src/compiler/tail-call-optimization.cc\",\n \"src/compiler/tail-call-optimization.h\",\n \"src/compiler/type-hint-analyzer.cc\",\n \"src/compiler/type-hint-analyzer.h\",\n \"src/compiler/type-hints.cc\",\n \"src/compiler/type-hints.h\",\n \"src/compiler/typer.cc\",\n \"src/compiler/typer.h\",\n \"src/compiler/unwinding-info-writer.h\",\n \"src/compiler/value-numbering-reducer.cc\",\n \"src/compiler/value-numbering-reducer.h\",\n \"src/compiler/verifier.cc\",\n \"src/compiler/verifier.h\",\n \"src/compiler/wasm-compiler.cc\",\n \"src/compiler/wasm-compiler.h\",\n \"src/compiler/wasm-linkage.cc\",\n \"src/compiler/zone-pool.cc\",\n \"src/compiler/zone-pool.h\",\n \"src/context-measure.cc\",\n \"src/context-measure.h\",\n \"src/contexts-inl.h\",\n \"src/contexts.cc\",\n \"src/contexts.h\",\n \"src/conversions-inl.h\",\n \"src/conversions.cc\",\n \"src/conversions.h\",\n \"src/counters-inl.h\",\n \"src/counters.cc\",\n \"src/counters.h\",\n \"src/crankshaft/compilation-phase.cc\",\n \"src/crankshaft/compilation-phase.h\",\n \"src/crankshaft/hydrogen-alias-analysis.h\",\n \"src/crankshaft/hydrogen-bce.cc\",\n \"src/crankshaft/hydrogen-bce.h\",\n \"src/crankshaft/hydrogen-canonicalize.cc\",\n \"src/crankshaft/hydrogen-canonicalize.h\",\n \"src/crankshaft/hydrogen-check-elimination.cc\",\n \"src/crankshaft/hydrogen-check-elimination.h\",\n \"src/crankshaft/hydrogen-dce.cc\",\n \"src/crankshaft/hydrogen-dce.h\",\n \"src/crankshaft/hydrogen-dehoist.cc\",\n \"src/crankshaft/hydrogen-dehoist.h\",\n \"src/crankshaft/hydrogen-environment-liveness.cc\",\n \"src/crankshaft/hydrogen-environment-liveness.h\",\n \"src/crankshaft/hydrogen-escape-analysis.cc\",\n \"src/crankshaft/hydrogen-escape-analysis.h\",\n \"src/crankshaft/hydrogen-flow-engine.h\",\n \"src/crankshaft/hydrogen-gvn.cc\",\n \"src/crankshaft/hydrogen-gvn.h\",\n \"src/crankshaft/hydrogen-infer-representation.cc\",\n \"src/crankshaft/hydrogen-infer-representation.h\",\n \"src/crankshaft/hydrogen-infer-types.cc\",\n \"src/crankshaft/hydrogen-infer-types.h\",\n \"src/crankshaft/hydrogen-instructions.cc\",\n \"src/crankshaft/hydrogen-instructions.h\",\n \"src/crankshaft/hydrogen-load-elimination.cc\",\n \"src/crankshaft/hydrogen-load-elimination.h\",\n \"src/crankshaft/hydrogen-mark-deoptimize.cc\",\n \"src/crankshaft/hydrogen-mark-deoptimize.h\",\n \"src/crankshaft/hydrogen-mark-unreachable.cc\",\n \"src/crankshaft/hydrogen-mark-unreachable.h\",\n \"src/crankshaft/hydrogen-osr.cc\",\n \"src/crankshaft/hydrogen-osr.h\",\n \"src/crankshaft/hydrogen-range-analysis.cc\",\n \"src/crankshaft/hydrogen-range-analysis.h\",\n \"src/crankshaft/hydrogen-redundant-phi.cc\",\n \"src/crankshaft/hydrogen-redundant-phi.h\",\n \"src/crankshaft/hydrogen-removable-simulates.cc\",\n \"src/crankshaft/hydrogen-removable-simulates.h\",\n \"src/crankshaft/hydrogen-representation-changes.cc\",\n \"src/crankshaft/hydrogen-representation-changes.h\",\n \"src/crankshaft/hydrogen-sce.cc\",\n \"src/crankshaft/hydrogen-sce.h\",\n \"src/crankshaft/hydrogen-store-elimination.cc\",\n \"src/crankshaft/hydrogen-store-elimination.h\",\n \"src/crankshaft/hydrogen-types.cc\",\n \"src/crankshaft/hydrogen-types.h\",\n \"src/crankshaft/hydrogen-uint32-analysis.cc\",\n \"src/crankshaft/hydrogen-uint32-analysis.h\",\n \"src/crankshaft/hydrogen.cc\",\n \"src/crankshaft/hydrogen.h\",\n \"src/crankshaft/lithium-allocator-inl.h\",\n \"src/crankshaft/lithium-allocator.cc\",\n \"src/crankshaft/lithium-allocator.h\",\n \"src/crankshaft/lithium-codegen.cc\",\n \"src/crankshaft/lithium-codegen.h\",\n \"src/crankshaft/lithium.cc\",\n \"src/crankshaft/lithium.h\",\n \"src/crankshaft/typing.cc\",\n \"src/crankshaft/typing.h\",\n \"src/crankshaft/unique.h\",\n \"src/date.cc\",\n \"src/date.h\",\n \"src/dateparser-inl.h\",\n \"src/dateparser.cc\",\n \"src/dateparser.h\",\n \"src/debug/debug-evaluate.cc\",\n \"src/debug/debug-evaluate.h\",\n \"src/debug/debug-frames.cc\",\n \"src/debug/debug-frames.h\",\n \"src/debug/debug-scopes.cc\",\n \"src/debug/debug-scopes.h\",\n \"src/debug/debug.cc\",\n \"src/debug/debug.h\",\n \"src/debug/liveedit.cc\",\n \"src/debug/liveedit.h\",\n \"src/deoptimize-reason.cc\",\n \"src/deoptimize-reason.h\",\n \"src/deoptimizer.cc\",\n \"src/deoptimizer.h\",\n \"src/disasm.h\",\n \"src/disassembler.cc\",\n \"src/disassembler.h\",\n \"src/diy-fp.cc\",\n \"src/diy-fp.h\",\n \"src/double.h\",\n \"src/dtoa.cc\",\n \"src/dtoa.h\",\n \"src/effects.h\",\n \"src/eh-frame.cc\",\n \"src/eh-frame.h\",\n \"src/elements-kind.cc\",\n \"src/elements-kind.h\",\n \"src/elements.cc\",\n \"src/elements.h\",\n \"src/execution.cc\",\n \"src/execution.h\",\n \"src/extensions/externalize-string-extension.cc\",\n \"src/extensions/externalize-string-extension.h\",\n \"src/extensions/free-buffer-extension.cc\",\n \"src/extensions/free-buffer-extension.h\",\n \"src/extensions/gc-extension.cc\",\n \"src/extensions/gc-extension.h\",\n \"src/extensions/ignition-statistics-extension.cc\",\n \"src/extensions/ignition-statistics-extension.h\",\n \"src/extensions/statistics-extension.cc\",\n \"src/extensions/statistics-extension.h\",\n \"src/extensions/trigger-failure-extension.cc\",\n \"src/extensions/trigger-failure-extension.h\",\n \"src/external-reference-table.cc\",\n \"src/external-reference-table.h\",\n \"src/factory.cc\",\n \"src/factory.h\",\n \"src/fast-accessor-assembler.cc\",\n \"src/fast-accessor-assembler.h\",\n \"src/fast-dtoa.cc\",\n \"src/fast-dtoa.h\",\n \"src/field-index-inl.h\",\n \"src/field-index.h\",\n \"src/field-type.cc\",\n \"src/field-type.h\",\n \"src/fixed-dtoa.cc\",\n \"src/fixed-dtoa.h\",\n \"src/flag-definitions.h\",\n \"src/flags.cc\",\n \"src/flags.h\",\n \"src/frames-inl.h\",\n \"src/frames.cc\",\n \"src/frames.h\",\n \"src/full-codegen/full-codegen.cc\",\n \"src/full-codegen/full-codegen.h\",\n \"src/futex-emulation.cc\",\n \"src/futex-emulation.h\",\n \"src/gdb-jit.cc\",\n \"src/gdb-jit.h\",\n \"src/global-handles.cc\",\n \"src/global-handles.h\",\n \"src/globals.h\",\n \"src/handles-inl.h\",\n \"src/handles.cc\",\n \"src/handles.h\",\n \"src/heap-symbols.h\",\n \"src/heap/array-buffer-tracker-inl.h\",\n \"src/heap/array-buffer-tracker.cc\",\n \"src/heap/array-buffer-tracker.h\",\n \"src/heap/code-stats.cc\",\n \"src/heap/code-stats.h\",\n \"src/heap/gc-idle-time-handler.cc\",\n \"src/heap/gc-idle-time-handler.h\",\n \"src/heap/gc-tracer.cc\",\n \"src/heap/gc-tracer.h\",\n \"src/heap/heap-inl.h\",\n \"src/heap/heap.cc\",\n \"src/heap/heap.h\",\n \"src/heap/incremental-marking-job.cc\",\n \"src/heap/incremental-marking-job.h\",\n \"src/heap/incremental-marking.cc\",\n \"src/heap/incremental-marking.h\",\n \"src/heap/mark-compact-inl.h\",\n \"src/heap/mark-compact.cc\",\n \"src/heap/mark-compact.h\",\n \"src/heap/marking.h\",\n \"src/heap/memory-reducer.cc\",\n \"src/heap/memory-reducer.h\",\n \"src/heap/object-stats.cc\",\n \"src/heap/object-stats.h\",\n \"src/heap/objects-visiting-inl.h\",\n \"src/heap/objects-visiting.cc\",\n \"src/heap/objects-visiting.h\",\n \"src/heap/page-parallel-job.h\",\n \"src/heap/remembered-set.cc\",\n \"src/heap/remembered-set.h\",\n \"src/heap/scavenge-job.cc\",\n \"src/heap/scavenge-job.h\",\n \"src/heap/scavenger-inl.h\",\n \"src/heap/scavenger.cc\",\n \"src/heap/scavenger.h\",\n \"src/heap/slot-set.h\",\n \"src/heap/spaces-inl.h\",\n \"src/heap/spaces.cc\",\n \"src/heap/spaces.h\",\n \"src/heap/store-buffer.cc\",\n \"src/heap/store-buffer.h\",\n \"src/i18n.cc\",\n \"src/i18n.h\",\n \"src/ic/access-compiler.cc\",\n \"src/ic/access-compiler.h\",\n \"src/ic/call-optimization.cc\",\n \"src/ic/call-optimization.h\",\n \"src/ic/handler-compiler.cc\",\n \"src/ic/handler-compiler.h\",\n \"src/ic/ic-compiler.cc\",\n \"src/ic/ic-compiler.h\",\n \"src/ic/ic-inl.h\",\n \"src/ic/ic-state.cc\",\n \"src/ic/ic-state.h\",\n \"src/ic/ic.cc\",\n \"src/ic/ic.h\",\n \"src/ic/stub-cache.cc\",\n \"src/ic/stub-cache.h\",\n \"src/icu_util.cc\",\n \"src/icu_util.h\",\n \"src/identity-map.cc\",\n \"src/identity-map.h\",\n \"src/interface-descriptors.cc\",\n \"src/interface-descriptors.h\",\n \"src/interpreter/bytecode-array-builder.cc\",\n \"src/interpreter/bytecode-array-builder.h\",\n \"src/interpreter/bytecode-array-iterator.cc\",\n \"src/interpreter/bytecode-array-iterator.h\",\n \"src/interpreter/bytecode-array-writer.cc\",\n \"src/interpreter/bytecode-array-writer.h\",\n \"src/interpreter/bytecode-dead-code-optimizer.cc\",\n \"src/interpreter/bytecode-dead-code-optimizer.h\",\n \"src/interpreter/bytecode-decoder.cc\",\n \"src/interpreter/bytecode-decoder.h\",\n \"src/interpreter/bytecode-flags.cc\",\n \"src/interpreter/bytecode-flags.h\",\n \"src/interpreter/bytecode-generator.cc\",\n \"src/interpreter/bytecode-generator.h\",\n \"src/interpreter/bytecode-label.cc\",\n \"src/interpreter/bytecode-label.h\",\n \"src/interpreter/bytecode-peephole-optimizer.cc\",\n \"src/interpreter/bytecode-peephole-optimizer.h\",\n \"src/interpreter/bytecode-peephole-table.h\",\n \"src/interpreter/bytecode-pipeline.cc\",\n \"src/interpreter/bytecode-pipeline.h\",\n \"src/interpreter/bytecode-register-allocator.cc\",\n \"src/interpreter/bytecode-register-allocator.h\",\n \"src/interpreter/bytecode-register-optimizer.cc\",\n \"src/interpreter/bytecode-register-optimizer.h\",\n \"src/interpreter/bytecode-register.cc\",\n \"src/interpreter/bytecode-register.h\",\n \"src/interpreter/bytecode-traits.h\",\n \"src/interpreter/bytecodes.cc\",\n \"src/interpreter/bytecodes.h\",\n \"src/interpreter/constant-array-builder.cc\",\n \"src/interpreter/constant-array-builder.h\",\n \"src/interpreter/control-flow-builders.cc\",\n \"src/interpreter/control-flow-builders.h\",\n \"src/interpreter/handler-table-builder.cc\",\n \"src/interpreter/handler-table-builder.h\",\n \"src/interpreter/interpreter-assembler.cc\",\n \"src/interpreter/interpreter-assembler.h\",\n \"src/interpreter/interpreter-intrinsics.cc\",\n \"src/interpreter/interpreter-intrinsics.h\",\n \"src/interpreter/interpreter.cc\",\n \"src/interpreter/interpreter.h\",\n \"src/isolate-inl.h\",\n \"src/isolate.cc\",\n \"src/isolate.h\",\n \"src/json-parser.cc\",\n \"src/json-parser.h\",\n \"src/json-stringifier.cc\",\n \"src/json-stringifier.h\",\n \"src/keys.cc\",\n \"src/keys.h\",\n \"src/layout-descriptor-inl.h\",\n \"src/layout-descriptor.cc\",\n \"src/layout-descriptor.h\",\n \"src/list-inl.h\",\n \"src/list.h\",\n \"src/log-inl.h\",\n \"src/log-utils.cc\",\n \"src/log-utils.h\",\n \"src/log.cc\",\n \"src/log.h\",\n \"src/lookup.cc\",\n \"src/lookup.h\",\n \"src/machine-type.cc\",\n \"src/machine-type.h\",\n \"src/macro-assembler.h\",\n \"src/messages.cc\",\n \"src/messages.h\",\n \"src/msan.h\",\n \"src/objects-body-descriptors-inl.h\",\n \"src/objects-body-descriptors.h\",\n \"src/objects-debug.cc\",\n \"src/objects-inl.h\",\n \"src/objects-printer.cc\",\n \"src/objects.cc\",\n \"src/objects.h\",\n \"src/ostreams.cc\",\n \"src/ostreams.h\",\n \"src/parsing/expression-classifier.h\",\n \"src/parsing/func-name-inferrer.cc\",\n \"src/parsing/func-name-inferrer.h\",\n \"src/parsing/parameter-initializer-rewriter.cc\",\n \"src/parsing/parameter-initializer-rewriter.h\",\n \"src/parsing/parse-info.cc\",\n \"src/parsing/parse-info.h\",\n \"src/parsing/parser-base.h\",\n \"src/parsing/parser.cc\",\n \"src/parsing/parser.h\",\n \"src/parsing/pattern-rewriter.cc\",\n \"src/parsing/preparse-data-format.h\",\n \"src/parsing/preparse-data.cc\",\n \"src/parsing/preparse-data.h\",\n \"src/parsing/preparser.cc\",\n \"src/parsing/preparser.h\",\n \"src/parsing/rewriter.cc\",\n \"src/parsing/rewriter.h\",\n \"src/parsing/scanner-character-streams.cc\",\n \"src/parsing/scanner-character-streams.h\",\n \"src/parsing/scanner.cc\",\n \"src/parsing/scanner.h\",\n \"src/parsing/token.cc\",\n \"src/parsing/token.h\",\n \"src/pending-compilation-error-handler.cc\",\n \"src/pending-compilation-error-handler.h\",\n \"src/perf-jit.cc\",\n \"src/perf-jit.h\",\n \"src/profiler/allocation-tracker.cc\",\n \"src/profiler/allocation-tracker.h\",\n \"src/profiler/circular-queue-inl.h\",\n \"src/profiler/circular-queue.h\",\n \"src/profiler/cpu-profiler-inl.h\",\n \"src/profiler/cpu-profiler.cc\",\n \"src/profiler/cpu-profiler.h\",\n \"src/profiler/heap-profiler.cc\",\n \"src/profiler/heap-profiler.h\",\n \"src/profiler/heap-snapshot-generator-inl.h\",\n \"src/profiler/heap-snapshot-generator.cc\",\n \"src/profiler/heap-snapshot-generator.h\",\n \"src/profiler/profile-generator-inl.h\",\n \"src/profiler/profile-generator.cc\",\n \"src/profiler/profile-generator.h\",\n \"src/profiler/profiler-listener.cc\",\n \"src/profiler/profiler-listener.h\",\n \"src/profiler/sampling-heap-profiler.cc\",\n \"src/profiler/sampling-heap-profiler.h\",\n \"src/profiler/strings-storage.cc\",\n \"src/profiler/strings-storage.h\",\n \"src/profiler/tick-sample.cc\",\n \"src/profiler/tick-sample.h\",\n \"src/profiler/unbound-queue-inl.h\",\n \"src/profiler/unbound-queue.h\",\n \"src/property-descriptor.cc\",\n \"src/property-descriptor.h\",\n \"src/property-details.h\",\n \"src/property.cc\",\n \"src/property.h\",\n \"src/prototype.h\",\n \"src/regexp/bytecodes-irregexp.h\",\n \"src/regexp/interpreter-irregexp.cc\",\n \"src/regexp/interpreter-irregexp.h\",\n \"src/regexp/jsregexp-inl.h\",\n \"src/regexp/jsregexp.cc\",\n \"src/regexp/jsregexp.h\",\n \"src/regexp/regexp-ast.cc\",\n \"src/regexp/regexp-ast.h\",\n \"src/regexp/regexp-macro-assembler-irregexp-inl.h\",\n \"src/regexp/regexp-macro-assembler-irregexp.cc\",\n \"src/regexp/regexp-macro-assembler-irregexp.h\",\n \"src/regexp/regexp-macro-assembler-tracer.cc\",\n \"src/regexp/regexp-macro-assembler-tracer.h\",\n \"src/regexp/regexp-macro-assembler.cc\",\n \"src/regexp/regexp-macro-assembler.h\",\n \"src/regexp/regexp-parser.cc\",\n \"src/regexp/regexp-parser.h\",\n \"src/regexp/regexp-stack.cc\",\n \"src/regexp/regexp-stack.h\",\n \"src/register-configuration.cc\",\n \"src/register-configuration.h\",\n \"src/runtime-profiler.cc\",\n \"src/runtime-profiler.h\",\n \"src/runtime/runtime-array.cc\",\n \"src/runtime/runtime-atomics.cc\",\n \"src/runtime/runtime-classes.cc\",\n \"src/runtime/runtime-collections.cc\",\n \"src/runtime/runtime-compiler.cc\",\n \"src/runtime/runtime-date.cc\",\n \"src/runtime/runtime-debug.cc\",\n \"src/runtime/runtime-error.cc\",\n \"src/runtime/runtime-forin.cc\",\n \"src/runtime/runtime-function.cc\",\n \"src/runtime/runtime-futex.cc\",\n \"src/runtime/runtime-generator.cc\",\n \"src/runtime/runtime-i18n.cc\",\n \"src/runtime/runtime-internal.cc\",\n \"src/runtime/runtime-interpreter.cc\",\n \"src/runtime/runtime-literals.cc\",\n \"src/runtime/runtime-liveedit.cc\",\n \"src/runtime/runtime-maths.cc\",\n \"src/runtime/runtime-numbers.cc\",\n \"src/runtime/runtime-object.cc\",\n \"src/runtime/runtime-operators.cc\",\n \"src/runtime/runtime-proxy.cc\",\n \"src/runtime/runtime-regexp.cc\",\n \"src/runtime/runtime-scopes.cc\",\n \"src/runtime/runtime-simd.cc\",\n \"src/runtime/runtime-strings.cc\",\n \"src/runtime/runtime-symbol.cc\",\n \"src/runtime/runtime-test.cc\",\n \"src/runtime/runtime-typedarray.cc\",\n \"src/runtime/runtime-utils.h\",\n \"src/runtime/runtime-wasm.cc\",\n \"src/runtime/runtime.cc\",\n \"src/runtime/runtime.h\",\n \"src/safepoint-table.cc\",\n \"src/safepoint-table.h\",\n \"src/signature.h\",\n \"src/simulator.h\",\n \"src/small-pointer-list.h\",\n \"src/snapshot/code-serializer.cc\",\n \"src/snapshot/code-serializer.h\",\n \"src/snapshot/deserializer.cc\",\n \"src/snapshot/deserializer.h\",\n \"src/snapshot/natives-common.cc\",\n \"src/snapshot/natives.h\",\n \"src/snapshot/partial-serializer.cc\",\n \"src/snapshot/partial-serializer.h\",\n \"src/snapshot/serializer-common.cc\",\n \"src/snapshot/serializer-common.h\",\n \"src/snapshot/serializer.cc\",\n \"src/snapshot/serializer.h\",\n \"src/snapshot/snapshot-common.cc\",\n \"src/snapshot/snapshot-source-sink.cc\",\n \"src/snapshot/snapshot-source-sink.h\",\n \"src/snapshot/snapshot.h\",\n \"src/snapshot/startup-serializer.cc\",\n \"src/snapshot/startup-serializer.h\",\n \"src/source-position-table.cc\",\n \"src/source-position-table.h\",\n \"src/source-position.h\",\n \"src/splay-tree-inl.h\",\n \"src/splay-tree.h\",\n \"src/startup-data-util.cc\",\n \"src/startup-data-util.h\",\n \"src/string-builder.cc\",\n \"src/string-builder.h\",\n \"src/string-search.h\",\n \"src/string-stream.cc\",\n \"src/string-stream.h\",\n \"src/strtod.cc\",\n \"src/strtod.h\",\n \"src/tracing/trace-event.cc\",\n \"src/tracing/trace-event.h\",\n \"src/transitions-inl.h\",\n \"src/transitions.cc\",\n \"src/transitions.h\",\n \"src/type-cache.cc\",\n \"src/type-cache.h\",\n \"src/type-feedback-vector-inl.h\",\n \"src/type-feedback-vector.cc\",\n \"src/type-feedback-vector.h\",\n \"src/type-info.cc\",\n \"src/type-info.h\",\n \"src/types.cc\",\n \"src/types.h\",\n \"src/unicode-cache-inl.h\",\n \"src/unicode-cache.h\",\n \"src/unicode-decoder.cc\",\n \"src/unicode-decoder.h\",\n \"src/unicode-inl.h\",\n \"src/unicode.cc\",\n \"src/unicode.h\",\n \"src/uri.cc\",\n \"src/uri.h\",\n \"src/utils-inl.h\",\n \"src/utils.cc\",\n \"src/utils.h\",\n \"src/v8.cc\",\n \"src/v8.h\",\n \"src/v8memory.h\",\n \"src/v8threads.cc\",\n \"src/v8threads.h\",\n \"src/value-serializer.cc\",\n \"src/value-serializer.h\",\n \"src/version.cc\",\n \"src/version.h\",\n \"src/vm-state-inl.h\",\n \"src/vm-state.h\",\n \"src/wasm/ast-decoder.cc\",\n \"src/wasm/ast-decoder.h\",\n \"src/wasm/decoder.h\",\n \"src/wasm/encoder.cc\",\n \"src/wasm/encoder.h\",\n \"src/wasm/leb-helper.h\",\n \"src/wasm/module-decoder.cc\",\n \"src/wasm/module-decoder.h\",\n \"src/wasm/switch-logic.cc\",\n \"src/wasm/switch-logic.h\",\n \"src/wasm/wasm-debug.cc\",\n \"src/wasm/wasm-debug.h\",\n \"src/wasm/wasm-external-refs.cc\",\n \"src/wasm/wasm-external-refs.h\",\n \"src/wasm/wasm-function-name-table.cc\",\n \"src/wasm/wasm-function-name-table.h\",\n \"src/wasm/wasm-interpreter.cc\",\n \"src/wasm/wasm-interpreter.h\",\n \"src/wasm/wasm-js.cc\",\n \"src/wasm/wasm-js.h\",\n \"src/wasm/wasm-macro-gen.h\",\n \"src/wasm/wasm-module.cc\",\n \"src/wasm/wasm-module.h\",\n \"src/wasm/wasm-opcodes.cc\",\n \"src/wasm/wasm-opcodes.h\",\n \"src/wasm/wasm-result.cc\",\n \"src/wasm/wasm-result.h\",\n \"src/zone-allocator.h\",\n \"src/zone-containers.h\",\n \"src/zone.cc\",\n \"src/zone.h\",\n ]\n\n if (v8_current_cpu == \"x86\") {\n sources += [\n \"src/builtins/ia32/builtins-ia32.cc\",\n \"src/compiler/ia32/code-generator-ia32.cc\",\n \"src/compiler/ia32/instruction-codes-ia32.h\",\n \"src/compiler/ia32/instruction-scheduler-ia32.cc\",\n \"src/compiler/ia32/instruction-selector-ia32.cc\",\n \"src/crankshaft/ia32/lithium-codegen-ia32.cc\",\n \"src/crankshaft/ia32/lithium-codegen-ia32.h\",\n \"src/crankshaft/ia32/lithium-gap-resolver-ia32.cc\",\n \"src/crankshaft/ia32/lithium-gap-resolver-ia32.h\",\n \"src/crankshaft/ia32/lithium-ia32.cc\",\n \"src/crankshaft/ia32/lithium-ia32.h\",\n \"src/debug/ia32/debug-ia32.cc\",\n \"src/full-codegen/ia32/full-codegen-ia32.cc\",\n \"src/ia32/assembler-ia32-inl.h\",\n \"src/ia32/assembler-ia32.cc\",\n \"src/ia32/assembler-ia32.h\",\n \"src/ia32/code-stubs-ia32.cc\",\n \"src/ia32/code-stubs-ia32.h\",\n \"src/ia32/codegen-ia32.cc\",\n \"src/ia32/codegen-ia32.h\",\n \"src/ia32/cpu-ia32.cc\",\n \"src/ia32/deoptimizer-ia32.cc\",\n \"src/ia32/disasm-ia32.cc\",\n \"src/ia32/frames-ia32.cc\",\n \"src/ia32/frames-ia32.h\",\n \"src/ia32/interface-descriptors-ia32.cc\",\n \"src/ia32/macro-assembler-ia32.cc\",\n \"src/ia32/macro-assembler-ia32.h\",\n \"src/ic/ia32/access-compiler-ia32.cc\",\n \"src/ic/ia32/handler-compiler-ia32.cc\",\n \"src/ic/ia32/ic-compiler-ia32.cc\",\n \"src/ic/ia32/ic-ia32.cc\",\n \"src/ic/ia32/stub-cache-ia32.cc\",\n \"src/regexp/ia32/regexp-macro-assembler-ia32.cc\",\n \"src/regexp/ia32/regexp-macro-assembler-ia32.h\",\n ]\n } else if (v8_current_cpu == \"x64\") {\n sources += [\n \"src/builtins/x64/builtins-x64.cc\",\n \"src/compiler/x64/code-generator-x64.cc\",\n \"src/compiler/x64/instruction-codes-x64.h\",\n \"src/compiler/x64/instruction-scheduler-x64.cc\",\n \"src/compiler/x64/instruction-selector-x64.cc\",\n \"src/compiler/x64/unwinding-info-writer-x64.cc\",\n \"src/compiler/x64/unwinding-info-writer-x64.h\",\n \"src/crankshaft/x64/lithium-codegen-x64.cc\",\n \"src/crankshaft/x64/lithium-codegen-x64.h\",\n \"src/crankshaft/x64/lithium-gap-resolver-x64.cc\",\n \"src/crankshaft/x64/lithium-gap-resolver-x64.h\",\n \"src/crankshaft/x64/lithium-x64.cc\",\n \"src/crankshaft/x64/lithium-x64.h\",\n \"src/debug/x64/debug-x64.cc\",\n \"src/full-codegen/x64/full-codegen-x64.cc\",\n \"src/ic/x64/access-compiler-x64.cc\",\n \"src/ic/x64/handler-compiler-x64.cc\",\n \"src/ic/x64/ic-compiler-x64.cc\",\n \"src/ic/x64/ic-x64.cc\",\n \"src/ic/x64/stub-cache-x64.cc\",\n \"src/regexp/x64/regexp-macro-assembler-x64.cc\",\n \"src/regexp/x64/regexp-macro-assembler-x64.h\",\n \"src/x64/assembler-x64-inl.h\",\n \"src/x64/assembler-x64.cc\",\n \"src/x64/assembler-x64.h\",\n \"src/x64/code-stubs-x64.cc\",\n \"src/x64/code-stubs-x64.h\",\n \"src/x64/codegen-x64.cc\",\n \"src/x64/codegen-x64.h\",\n \"src/x64/cpu-x64.cc\",\n \"src/x64/deoptimizer-x64.cc\",\n \"src/x64/disasm-x64.cc\",\n \"src/x64/eh-frame-x64.cc\",\n \"src/x64/frames-x64.cc\",\n \"src/x64/frames-x64.h\",\n \"src/x64/interface-descriptors-x64.cc\",\n \"src/x64/macro-assembler-x64.cc\",\n \"src/x64/macro-assembler-x64.h\",\n ]\n } else if (v8_current_cpu == \"arm\") {\n sources += [\n \"src/arm/assembler-arm-inl.h\",\n \"src/arm/assembler-arm.cc\",\n \"src/arm/assembler-arm.h\",\n \"src/arm/code-stubs-arm.cc\",\n \"src/arm/code-stubs-arm.h\",\n \"src/arm/codegen-arm.cc\",\n \"src/arm/codegen-arm.h\",\n \"src/arm/constants-arm.cc\",\n \"src/arm/constants-arm.h\",\n \"src/arm/cpu-arm.cc\",\n \"src/arm/deoptimizer-arm.cc\",\n \"src/arm/disasm-arm.cc\",\n \"src/arm/eh-frame-arm.cc\",\n \"src/arm/frames-arm.cc\",\n \"src/arm/frames-arm.h\",\n \"src/arm/interface-descriptors-arm.cc\",\n \"src/arm/interface-descriptors-arm.h\",\n \"src/arm/macro-assembler-arm.cc\",\n \"src/arm/macro-assembler-arm.h\",\n \"src/arm/simulator-arm.cc\",\n \"src/arm/simulator-arm.h\",\n \"src/builtins/arm/builtins-arm.cc\",\n \"src/compiler/arm/code-generator-arm.cc\",\n \"src/compiler/arm/instruction-codes-arm.h\",\n \"src/compiler/arm/instruction-scheduler-arm.cc\",\n \"src/compiler/arm/instruction-selector-arm.cc\",\n \"src/compiler/arm/unwinding-info-writer-arm.cc\",\n \"src/compiler/arm/unwinding-info-writer-arm.h\",\n \"src/crankshaft/arm/lithium-arm.cc\",\n \"src/crankshaft/arm/lithium-arm.h\",\n \"src/crankshaft/arm/lithium-codegen-arm.cc\",\n \"src/crankshaft/arm/lithium-codegen-arm.h\",\n \"src/crankshaft/arm/lithium-gap-resolver-arm.cc\",\n \"src/crankshaft/arm/lithium-gap-resolver-arm.h\",\n \"src/debug/arm/debug-arm.cc\",\n \"src/full-codegen/arm/full-codegen-arm.cc\",\n \"src/ic/arm/access-compiler-arm.cc\",\n \"src/ic/arm/handler-compiler-arm.cc\",\n \"src/ic/arm/ic-arm.cc\",\n \"src/ic/arm/ic-compiler-arm.cc\",\n \"src/ic/arm/stub-cache-arm.cc\",\n \"src/regexp/arm/regexp-macro-assembler-arm.cc\",\n \"src/regexp/arm/regexp-macro-assembler-arm.h\",\n ]\n } else if (v8_current_cpu == \"arm64\") {\n sources += [\n \"src/arm64/assembler-arm64-inl.h\",\n \"src/arm64/assembler-arm64.cc\",\n \"src/arm64/assembler-arm64.h\",\n \"src/arm64/code-stubs-arm64.cc\",\n \"src/arm64/code-stubs-arm64.h\",\n \"src/arm64/codegen-arm64.cc\",\n \"src/arm64/codegen-arm64.h\",\n \"src/arm64/constants-arm64.h\",\n \"src/arm64/cpu-arm64.cc\",\n \"src/arm64/decoder-arm64-inl.h\",\n \"src/arm64/decoder-arm64.cc\",\n \"src/arm64/decoder-arm64.h\",\n \"src/arm64/deoptimizer-arm64.cc\",\n \"src/arm64/disasm-arm64.cc\",\n \"src/arm64/disasm-arm64.h\",\n \"src/arm64/eh-frame-arm64.cc\",\n \"src/arm64/frames-arm64.cc\",\n \"src/arm64/frames-arm64.h\",\n \"src/arm64/instructions-arm64.cc\",\n \"src/arm64/instructions-arm64.h\",\n \"src/arm64/instrument-arm64.cc\",\n \"src/arm64/instrument-arm64.h\",\n \"src/arm64/interface-descriptors-arm64.cc\",\n \"src/arm64/interface-descriptors-arm64.h\",\n \"src/arm64/macro-assembler-arm64-inl.h\",\n \"src/arm64/macro-assembler-arm64.cc\",\n \"src/arm64/macro-assembler-arm64.h\",\n \"src/arm64/simulator-arm64.cc\",\n \"src/arm64/simulator-arm64.h\",\n \"src/arm64/utils-arm64.cc\",\n \"src/arm64/utils-arm64.h\",\n \"src/builtins/arm64/builtins-arm64.cc\",\n \"src/compiler/arm64/code-generator-arm64.cc\",\n \"src/compiler/arm64/instruction-codes-arm64.h\",\n \"src/compiler/arm64/instruction-scheduler-arm64.cc\",\n \"src/compiler/arm64/instruction-selector-arm64.cc\",\n \"src/compiler/arm64/unwinding-info-writer-arm64.cc\",\n \"src/compiler/arm64/unwinding-info-writer-arm64.h\",\n \"src/crankshaft/arm64/delayed-masm-arm64-inl.h\",\n \"src/crankshaft/arm64/delayed-masm-arm64.cc\",\n \"src/crankshaft/arm64/delayed-masm-arm64.h\",\n \"src/crankshaft/arm64/lithium-arm64.cc\",\n \"src/crankshaft/arm64/lithium-arm64.h\",\n \"src/crankshaft/arm64/lithium-codegen-arm64.cc\",\n \"src/crankshaft/arm64/lithium-codegen-arm64.h\",\n \"src/crankshaft/arm64/lithium-gap-resolver-arm64.cc\",\n \"src/crankshaft/arm64/lithium-gap-resolver-arm64.h\",\n \"src/debug/arm64/debug-arm64.cc\",\n \"src/full-codegen/arm64/full-codegen-arm64.cc\",\n \"src/ic/arm64/access-compiler-arm64.cc\",\n \"src/ic/arm64/handler-compiler-arm64.cc\",\n \"src/ic/arm64/ic-arm64.cc\",\n \"src/ic/arm64/ic-compiler-arm64.cc\",\n \"src/ic/arm64/stub-cache-arm64.cc\",\n \"src/regexp/arm64/regexp-macro-assembler-arm64.cc\",\n \"src/regexp/arm64/regexp-macro-assembler-arm64.h\",\n ]\n } else if (v8_current_cpu == \"mipsel\") {\n sources += [\n \"src/builtins/mips/builtins-mips.cc\",\n \"src/compiler/mips/code-generator-mips.cc\",\n \"src/compiler/mips/instruction-codes-mips.h\",\n \"src/compiler/mips/instruction-scheduler-mips.cc\",\n \"src/compiler/mips/instruction-selector-mips.cc\",\n \"src/crankshaft/mips/lithium-codegen-mips.cc\",\n \"src/crankshaft/mips/lithium-codegen-mips.h\",\n \"src/crankshaft/mips/lithium-gap-resolver-mips.cc\",\n \"src/crankshaft/mips/lithium-gap-resolver-mips.h\",\n \"src/crankshaft/mips/lithium-mips.cc\",\n \"src/crankshaft/mips/lithium-mips.h\",\n \"src/debug/mips/debug-mips.cc\",\n \"src/full-codegen/mips/full-codegen-mips.cc\",\n \"src/ic/mips/access-compiler-mips.cc\",\n \"src/ic/mips/handler-compiler-mips.cc\",\n \"src/ic/mips/ic-compiler-mips.cc\",\n \"src/ic/mips/ic-mips.cc\",\n \"src/ic/mips/stub-cache-mips.cc\",\n \"src/mips/assembler-mips-inl.h\",\n \"src/mips/assembler-mips.cc\",\n \"src/mips/assembler-mips.h\",\n \"src/mips/code-stubs-mips.cc\",\n \"src/mips/code-stubs-mips.h\",\n \"src/mips/codegen-mips.cc\",\n \"src/mips/codegen-mips.h\",\n \"src/mips/constants-mips.cc\",\n \"src/mips/constants-mips.h\",\n \"src/mips/cpu-mips.cc\",\n \"src/mips/deoptimizer-mips.cc\",\n \"src/mips/disasm-mips.cc\",\n \"src/mips/frames-mips.cc\",\n \"src/mips/frames-mips.h\",\n \"src/mips/interface-descriptors-mips.cc\",\n \"src/mips/macro-assembler-mips.cc\",\n \"src/mips/macro-assembler-mips.h\",\n \"src/mips/simulator-mips.cc\",\n \"src/mips/simulator-mips.h\",\n \"src/regexp/mips/regexp-macro-assembler-mips.cc\",\n \"src/regexp/mips/regexp-macro-assembler-mips.h\",\n ]\n } else if (v8_current_cpu == \"mips64el\") {\n sources += [\n \"src/builtins/mips64/builtins-mips64.cc\",\n \"src/compiler/mips64/code-generator-mips64.cc\",\n \"src/compiler/mips64/instruction-codes-mips64.h\",\n \"src/compiler/mips64/instruction-scheduler-mips64.cc\",\n \"src/compiler/mips64/instruction-selector-mips64.cc\",\n \"src/crankshaft/mips64/lithium-codegen-mips64.cc\",\n \"src/crankshaft/mips64/lithium-codegen-mips64.h\",\n \"src/crankshaft/mips64/lithium-gap-resolver-mips64.cc\",\n \"src/crankshaft/mips64/lithium-gap-resolver-mips64.h\",\n \"src/crankshaft/mips64/lithium-mips64.cc\",\n \"src/crankshaft/mips64/lithium-mips64.h\",\n \"src/debug/mips64/debug-mips64.cc\",\n \"src/full-codegen/mips64/full-codegen-mips64.cc\",\n \"src/ic/mips64/access-compiler-mips64.cc\",\n \"src/ic/mips64/handler-compiler-mips64.cc\",\n \"src/ic/mips64/ic-compiler-mips64.cc\",\n \"src/ic/mips64/ic-mips64.cc\",\n \"src/ic/mips64/stub-cache-mips64.cc\",\n \"src/mips64/assembler-mips64-inl.h\",\n \"src/mips64/assembler-mips64.cc\",\n \"src/mips64/assembler-mips64.h\",\n \"src/mips64/code-stubs-mips64.cc\",\n \"src/mips64/code-stubs-mips64.h\",\n \"src/mips64/codegen-mips64.cc\",\n \"src/mips64/codegen-mips64.h\",\n \"src/mips64/constants-mips64.cc\",\n \"src/mips64/constants-mips64.h\",\n \"src/mips64/cpu-mips64.cc\",\n \"src/mips64/deoptimizer-mips64.cc\",\n \"src/mips64/disasm-mips64.cc\",\n \"src/mips64/frames-mips64.cc\",\n \"src/mips64/frames-mips64.h\",\n \"src/mips64/interface-descriptors-mips64.cc\",\n \"src/mips64/macro-assembler-mips64.cc\",\n \"src/mips64/macro-assembler-mips64.h\",\n \"src/mips64/simulator-mips64.cc\",\n \"src/mips64/simulator-mips64.h\",\n \"src/regexp/mips64/regexp-macro-assembler-mips64.cc\",\n \"src/regexp/mips64/regexp-macro-assembler-mips64.h\",\n ]\n } else if (v8_current_cpu == \"s390\" || v8_current_cpu == \"s390x\") {\n sources += [\n \"src/builtins/s390/builtins-s390.cc\",\n \"src/compiler/s390/code-generator-s390.cc\",\n \"src/compiler/s390/instruction-codes-s390.h\",\n \"src/compiler/s390/instruction-scheduler-s390.cc\",\n \"src/compiler/s390/instruction-selector-s390.cc\",\n \"src/crankshaft/s390/lithium-codegen-s390.cc\",\n \"src/crankshaft/s390/lithium-codegen-s390.h\",\n \"src/crankshaft/s390/lithium-gap-resolver-s390.cc\",\n \"src/crankshaft/s390/lithium-gap-resolver-s390.h\",\n \"src/crankshaft/s390/lithium-s390.cc\",\n \"src/crankshaft/s390/lithium-s390.h\",\n \"src/debug/s390/debug-s390.cc\",\n \"src/full-codegen/s390/full-codegen-s390.cc\",\n \"src/ic/s390/access-compiler-s390.cc\",\n \"src/ic/s390/handler-compiler-s390.cc\",\n \"src/ic/s390/ic-compiler-s390.cc\",\n \"src/ic/s390/ic-s390.cc\",\n \"src/ic/s390/stub-cache-s390.cc\",\n \"src/regexp/s390/regexp-macro-assembler-s390.cc\",\n \"src/regexp/s390/regexp-macro-assembler-s390.h\",\n \"src/s390/assembler-s390-inl.h\",\n \"src/s390/assembler-s390.cc\",\n \"src/s390/assembler-s390.h\",\n \"src/s390/code-stubs-s390.cc\",\n \"src/s390/code-stubs-s390.h\",\n \"src/s390/codegen-s390.cc\",\n \"src/s390/codegen-s390.h\",\n \"src/s390/constants-s390.cc\",\n \"src/s390/constants-s390.h\",\n \"src/s390/cpu-s390.cc\",\n \"src/s390/deoptimizer-s390.cc\",\n \"src/s390/disasm-s390.cc\",\n \"src/s390/frames-s390.cc\",\n \"src/s390/frames-s390.h\",\n \"src/s390/interface-descriptors-s390.cc\",\n \"src/s390/macro-assembler-s390.cc\",\n \"src/s390/macro-assembler-s390.h\",\n \"src/s390/simulator-s390.cc\",\n \"src/s390/simulator-s390.h\",\n ]\n }\n\n configs = [ \":internal_config\" ]\n\n defines = []\n deps = [\n \":v8_libbase\",\n \":v8_libsampler\",\n ]\n\n sources += [ v8_generated_peephole_source ]\n deps += [ \":run_mkpeephole\" ]\n\n if (is_win) {\n # TODO(jschuh): crbug.com/167187 fix size_t to int truncations.\n cflags = [ \"/wd4267\" ]\n }\n\n if (v8_enable_i18n_support) {\n deps += [ \"//third_party/icu\" ]\n if (is_win) {\n deps += [ \"//third_party/icu:icudata\" ]\n }\n } else {\n sources -= [\n \"src/i18n.cc\",\n \"src/i18n.h\",\n ]\n }\n\n if (v8_postmortem_support) {\n sources += [ \"$target_gen_dir/debug-support.cc\" ]\n deps += [ \":postmortem-metadata\" ]\n }\n}\n\nv8_source_set(\"v8_libbase\") {\n visibility = [ \":*\" ] # Only targets in this file can depend on this.\n\n sources = [\n \"src/base/accounting-allocator.cc\",\n \"src/base/accounting-allocator.h\",\n \"src/base/adapters.h\",\n \"src/base/atomic-utils.h\",\n \"src/base/atomicops.h\",\n \"src/base/atomicops_internals_arm64_gcc.h\",\n \"src/base/atomicops_internals_arm_gcc.h\",\n \"src/base/atomicops_internals_atomicword_compat.h\",\n \"src/base/atomicops_internals_mac.h\",\n \"src/base/atomicops_internals_mips64_gcc.h\",\n \"src/base/atomicops_internals_mips_gcc.h\",\n \"src/base/atomicops_internals_s390_gcc.h\",\n \"src/base/atomicops_internals_tsan.h\",\n \"src/base/atomicops_internals_x86_gcc.cc\",\n \"src/base/atomicops_internals_x86_gcc.h\",\n \"src/base/atomicops_internals_x86_msvc.h\",\n \"src/base/bits.cc\",\n \"src/base/bits.h\",\n \"src/base/build_config.h\",\n \"src/base/cpu.cc\",\n \"src/base/cpu.h\",\n \"src/base/debug/stack_trace.cc\",\n \"src/base/debug/stack_trace.h\",\n \"src/base/division-by-constant.cc\",\n \"src/base/division-by-constant.h\",\n \"src/base/file-utils.cc\",\n \"src/base/file-utils.h\",\n \"src/base/flags.h\",\n \"src/base/format-macros.h\",\n \"src/base/free_deleter.h\",\n \"src/base/functional.cc\",\n \"src/base/functional.h\",\n \"src/base/hashmap.h\",\n \"src/base/ieee754.cc\",\n \"src/base/ieee754.h\",\n \"src/base/iterator.h\",\n \"src/base/lazy-instance.h\",\n \"src/base/logging.cc\",\n \"src/base/logging.h\",\n \"src/base/macros.h\",\n \"src/base/once.cc\",\n \"src/base/once.h\",\n \"src/base/platform/condition-variable.cc\",\n \"src/base/platform/condition-variable.h\",\n \"src/base/platform/elapsed-timer.h\",\n \"src/base/platform/mutex.cc\",\n \"src/base/platform/mutex.h\",\n \"src/base/platform/platform.h\",\n \"src/base/platform/semaphore.cc\",\n \"src/base/platform/semaphore.h\",\n \"src/base/platform/time.cc\",\n \"src/base/platform/time.h\",\n \"src/base/safe_conversions.h\",\n \"src/base/safe_conversions_impl.h\",\n \"src/base/safe_math.h\",\n \"src/base/safe_math_impl.h\",\n \"src/base/sys-info.cc\",\n \"src/base/sys-info.h\",\n \"src/base/utils/random-number-generator.cc\",\n \"src/base/utils/random-number-generator.h\",\n ]\n\n configs = [ \":internal_config_base\" ]\n\n defines = []\n\n if (is_posix) {\n sources += [ \"src/base/platform/platform-posix.cc\" ]\n }\n\n if (is_linux) {\n sources += [\n \"src/base/debug/stack_trace_posix.cc\",\n \"src/base/platform/platform-linux.cc\",\n ]\n\n libs = [\n \"dl\",\n \"rt\",\n ]\n } else if (is_android) {\n if (current_toolchain == host_toolchain) {\n libs = [\n \"dl\",\n \"rt\",\n ]\n if (host_os == \"mac\") {\n sources += [\n \"src/base/debug/stack_trace_posix.cc\",\n \"src/base/platform/platform-macos.cc\",\n ]\n } else {\n sources += [\n \"src/base/debug/stack_trace_posix.cc\",\n \"src/base/platform/platform-linux.cc\",\n ]\n }\n } else {\n sources += [\n \"src/base/debug/stack_trace_android.cc\",\n \"src/base/platform/platform-linux.cc\",\n ]\n }\n } else if (is_mac) {\n sources += [\n \"src/base/debug/stack_trace_posix.cc\",\n \"src/base/platform/platform-macos.cc\",\n ]\n } else if (is_win) {\n # TODO(jochen): Add support for cygwin.\n sources += [\n \"src/base/debug/stack_trace_win.cc\",\n \"src/base/platform/platform-win32.cc\",\n \"src/base/win32-headers.h\",\n ]\n\n defines += [ \"_CRT_RAND_S\" ] # for rand_s()\n\n libs = [\n \"dbghelp.lib\",\n \"shlwapi.lib\",\n \"winmm.lib\",\n \"ws2_32.lib\",\n ]\n }\n\n # TODO(jochen): Add support for qnx, freebsd, openbsd, netbsd, and solaris.\n}\n\nv8_source_set(\"v8_libplatform\") {\n sources = [\n \"//base/trace_event/common/trace_event_common.h\",\n \"include/libplatform/libplatform.h\",\n \"include/libplatform/v8-tracing.h\",\n \"src/libplatform/default-platform.cc\",\n \"src/libplatform/default-platform.h\",\n \"src/libplatform/task-queue.cc\",\n \"src/libplatform/task-queue.h\",\n \"src/libplatform/tracing/trace-buffer.cc\",\n \"src/libplatform/tracing/trace-buffer.h\",\n \"src/libplatform/tracing/trace-config.cc\",\n \"src/libplatform/tracing/trace-object.cc\",\n \"src/libplatform/tracing/trace-writer.cc\",\n \"src/libplatform/tracing/trace-writer.h\",\n \"src/libplatform/tracing/tracing-controller.cc\",\n \"src/libplatform/worker-thread.cc\",\n \"src/libplatform/worker-thread.h\",\n ]\n\n configs = [ \":internal_config_base\" ]\n\n public_configs = [ \":libplatform_config\" ]\n\n deps = [\n \":v8_libbase\",\n ]\n}\n\nv8_source_set(\"v8_libsampler\") {\n sources = [\n \"src/libsampler/sampler.cc\",\n \"src/libsampler/sampler.h\",\n ]\n\n configs = [ \":internal_config_base\" ]\n\n public_configs = [ \":libsampler_config\" ]\n\n deps = [\n \":v8_libbase\",\n ]\n}\n\nv8_source_set(\"fuzzer_support\") {\n visibility = [ \":*\" ] # Only targets in this file can depend on this.\n\n sources = [\n \"test/fuzzer/fuzzer-support.cc\",\n \"test/fuzzer/fuzzer-support.h\",\n ]\n\n configs = [ \":internal_config_base\" ]\n\n deps = [\n \":v8_maybe_snapshot\",\n ]\n\n public_deps = [\n \":v8_libplatform\",\n ]\n}\n\nv8_source_set(\"simple_fuzzer\") {\n sources = [\n \"test/fuzzer/fuzzer.cc\",\n ]\n\n configs = [ \":internal_config_base\" ]\n}\n\n###############################################################################\n# Executables\n#\n\nif (current_toolchain == v8_snapshot_toolchain) {\n v8_executable(\"mksnapshot\") {\n visibility = [ \":*\" ] # Only targets in this file can depend on this.\n\n sources = [\n \"src/snapshot/mksnapshot.cc\",\n ]\n\n configs = [ \":internal_config\" ]\n\n deps = [\n \":v8_base\",\n \":v8_libplatform\",\n \":v8_nosnapshot\",\n \"//build/config/sanitizers:deps\",\n \"//build/win:default_exe_manifest\",\n ]\n }\n}\n\nv8_executable(\"mkpeephole\") {\n # mkpeephole needs to be built for the build host so the peephole lookup\n # table can built during build. The table depends on the properties of\n # bytecodes that are described in bytecodes.{cc,h}.\n visibility = [ \":*\" ] # Only targets in this file can depend on this.\n\n sources = [\n \"src/interpreter/bytecode-peephole-optimizer.h\",\n \"src/interpreter/bytecodes.cc\",\n \"src/interpreter/bytecodes.h\",\n \"src/interpreter/mkpeephole.cc\",\n ]\n\n configs = [\n \":external_config\",\n \":internal_config\",\n ]\n\n deps = [\n \":v8_libbase\",\n \"//build/config/sanitizers:deps\",\n \"//build/win:default_exe_manifest\",\n ]\n}\n\n###############################################################################\n# Public targets\n#\n\nwant_v8_shell =\n (current_toolchain == host_toolchain && v8_toolset_for_shell == \"host\") ||\n (current_toolchain == v8_snapshot_toolchain &&\n v8_toolset_for_shell == \"host\") ||\n (current_toolchain != host_toolchain && v8_toolset_for_shell == \"target\")\n\ngroup(\"gn_all\") {\n testonly = true\n\n deps = [\n \":d8\",\n \":v8_hello_world\",\n \":v8_parser_shell\",\n \":v8_sample_process\",\n \":v8_simple_json_fuzzer\",\n \":v8_simple_parser_fuzzer\",\n \":v8_simple_regexp_fuzzer\",\n \":v8_simple_wasm_asmjs_fuzzer\",\n \":v8_simple_wasm_fuzzer\",\n \"test:gn_all\",\n \"tools:gn_all\",\n ]\n\n if (want_v8_shell) {\n deps += [ \":v8_shell\" ]\n }\n\n if (v8_test_isolation_mode != \"noop\") {\n deps += [ \":d8_run\" ]\n }\n}\n\nif (is_component_build) {\n v8_component(\"v8\") {\n sources = [\n \"src/v8dll-main.cc\",\n ]\n\n deps = [\n \":v8_dump_build_config\",\n ]\n\n public_deps = [\n \":v8_base\",\n \":v8_maybe_snapshot\",\n ]\n\n configs = [ \":internal_config\" ]\n\n public_configs = [ \":external_config\" ]\n }\n} else {\n group(\"v8\") {\n deps = [\n \":v8_dump_build_config\",\n ]\n\n public_deps = [\n \":v8_base\",\n \":v8_maybe_snapshot\",\n ]\n public_configs = [ \":external_config\" ]\n }\n}\n\nv8_executable(\"d8\") {\n sources = [\n \"src/d8.cc\",\n \"src/d8.h\",\n ]\n\n configs = [\n # Note: don't use :internal_config here because this target will get\n # the :external_config applied to it by virtue of depending on :v8, and\n # you can't have both applied to the same target.\n \":internal_config_base\",\n ]\n\n deps = [\n \":d8_js2c\",\n \":v8\",\n \":v8_libplatform\",\n \"//build/config/sanitizers:deps\",\n \"//build/win:default_exe_manifest\",\n ]\n\n # TODO(jochen): Add support for vtunejit.\n\n if (is_posix) {\n sources += [ \"src/d8-posix.cc\" ]\n } else if (is_win) {\n sources += [ \"src/d8-windows.cc\" ]\n }\n\n if (!is_component_build) {\n sources += [ \"$target_gen_dir/d8-js.cc\" ]\n }\n if (v8_enable_i18n_support) {\n deps += [ \"//third_party/icu\" ]\n }\n}\n\nv8_isolate_run(\"d8\") {\n deps = [\n \":d8\",\n ]\n\n isolate = \"//src/d8.isolate\"\n}\n\nv8_executable(\"v8_hello_world\") {\n sources = [\n \"samples/hello-world.cc\",\n ]\n\n configs = [\n # Note: don't use :internal_config here because this target will get\n # the :external_config applied to it by virtue of depending on :v8, and\n # you can't have both applied to the same target.\n \":internal_config_base\",\n ]\n\n deps = [\n \":v8\",\n \":v8_libplatform\",\n \"//build/config/sanitizers:deps\",\n \"//build/win:default_exe_manifest\",\n ]\n\n if (v8_enable_i18n_support) {\n deps += [ \"//third_party/icu\" ]\n }\n}\n\nv8_executable(\"v8_sample_process\") {\n sources = [\n \"samples/process.cc\",\n ]\n\n configs = [\n # Note: don't use :internal_config here because this target will get\n # the :external_config applied to it by virtue of depending on :v8, and\n # you can't have both applied to the same target.\n \":internal_config_base\",\n ]\n\n deps = [\n \":v8\",\n \":v8_libplatform\",\n \"//build/config/sanitizers:deps\",\n \"//build/win:default_exe_manifest\",\n ]\n\n if (v8_enable_i18n_support) {\n deps += [ \"//third_party/icu\" ]\n }\n}\n\nv8_executable(\"v8_parser_shell\") {\n sources = [\n \"tools/parser-shell.cc\",\n \"tools/shell-utils.h\",\n ]\n\n configs = [\n \":external_config\",\n \":internal_config_base\",\n ]\n\n deps = [\n \":v8_libplatform\",\n \"//build/config/sanitizers:deps\",\n \"//build/win:default_exe_manifest\",\n ]\n\n if (is_component_build) {\n # v8_parser_shell can't be built against a shared library, so we\n # need to depend on the underlying static target in that case.\n deps += [ \":v8_maybe_snapshot\" ]\n } else {\n deps += [ \":v8\" ]\n }\n\n if (v8_enable_i18n_support) {\n deps += [ \"//third_party/icu\" ]\n }\n\n if (is_win) {\n # Suppress warnings about importing locally defined symbols.\n if (is_component_build) {\n ldflags = [\n \"/ignore:4049\",\n \"/ignore:4217\",\n ]\n }\n }\n}\n\nif (want_v8_shell) {\n v8_executable(\"v8_shell\") {\n sources = [\n \"samples/shell.cc\",\n ]\n\n configs = [\n # Note: don't use :internal_config here because this target will get\n # the :external_config applied to it by virtue of depending on :v8, and\n # you can't have both applied to the same target.\n \":internal_config_base\",\n ]\n\n deps = [\n \":v8\",\n \":v8_libplatform\",\n \"//build/config/sanitizers:deps\",\n \"//build/win:default_exe_manifest\",\n ]\n\n if (v8_enable_i18n_support) {\n deps += [ \"//third_party/icu\" ]\n }\n }\n}\n\ntemplate(\"v8_fuzzer\") {\n name = target_name\n forward_variables_from(invoker, \"*\")\n v8_executable(\"v8_simple_\" + name) {\n deps = [\n \":\" + name,\n \":simple_fuzzer\",\n \"//build/win:default_exe_manifest\",\n ]\n\n configs = [ \":external_config\" ]\n }\n}\n\nv8_source_set(\"json_fuzzer\") {\n sources = [\n \"test/fuzzer/json.cc\",\n ]\n\n deps = [\n \":fuzzer_support\",\n ]\n\n configs = [ \":internal_config\" ]\n}\n\nv8_fuzzer(\"json_fuzzer\") {\n}\n\nv8_source_set(\"parser_fuzzer\") {\n sources = [\n \"test/fuzzer/parser.cc\",\n ]\n\n deps = [\n \":fuzzer_support\",\n ]\n\n configs = [ \":internal_config\" ]\n}\n\nv8_fuzzer(\"parser_fuzzer\") {\n}\n\nv8_source_set(\"regexp_fuzzer\") {\n sources = [\n \"test/fuzzer/regexp.cc\",\n ]\n\n deps = [\n \":fuzzer_support\",\n ]\n\n configs = [ \":internal_config\" ]\n}\n\nv8_fuzzer(\"regexp_fuzzer\") {\n}\n\nv8_source_set(\"wasm_fuzzer\") {\n sources = [\n \"test/fuzzer/wasm.cc\",\n ]\n\n deps = [\n \":fuzzer_support\",\n ]\n\n configs = [ \":internal_config\" ]\n}\n\nv8_fuzzer(\"wasm_fuzzer\") {\n}\n\nv8_source_set(\"wasm_asmjs_fuzzer\") {\n sources = [\n \"test/fuzzer/wasm-asmjs.cc\",\n ]\n\n deps = [\n \":fuzzer_support\",\n ]\n\n configs = [ \":internal_config\" ]\n}\n\nv8_fuzzer(\"wasm_asmjs_fuzzer\") {\n}\n" }, { "path": "src/test/resources/samples/langs/GN/android-rules.gni", "content": "# Copyright 2014 The Chromium Authors. All rights reserved.\n# Use of this source code is governed by a BSD-style license that can be\n# found in the LICENSE file.\n\n# Do not add any imports to non-//build directories here.\n# Some projects (e.g. V8) do not have non-build directories DEPS'ed in.\nimport(\"//build/config/android/config.gni\")\nimport(\"//build/config/android/internal_rules.gni\")\nimport(\"//build/config/compiler/compiler.gni\")\nimport(\"//build/config/dcheck_always_on.gni\")\nimport(\"//build/toolchain/toolchain.gni\")\n\nassert(is_android)\n\n# Creates a dist directory for a native executable.\n#\n# Running a native executable on a device requires all the shared library\n# dependencies of that executable. To make it easier to install and run such an\n# executable, this will create a directory containing the native exe and all\n# it's library dependencies.\n#\n# Note: It's usually better to package things as an APK than as a native\n# executable.\n#\n# Variables\n# dist_dir: Directory for the exe and libraries. Everything in this directory\n# will be deleted before copying in the exe and libraries.\n# binary: Path to (stripped) executable.\n# extra_files: List of extra files to copy in (optional).\n#\n# Example\n# create_native_executable_dist(\"foo_dist\") {\n# dist_dir = \"$root_build_dir/foo_dist\"\n# binary = \"$root_build_dir/foo\"\n# deps = [ \":the_thing_that_makes_foo\" ]\n# }\ntemplate(\"create_native_executable_dist\") {\n forward_variables_from(invoker, [ \"testonly\" ])\n\n _libraries_list = \"${target_gen_dir}/${target_name}_library_dependencies.list\"\n\n _find_deps_target_name = \"${target_name}__find_library_dependencies\"\n\n # TODO(agrieve): Extract dependent libs from GN rather than readelf.\n action(_find_deps_target_name) {\n forward_variables_from(invoker, [ \"deps\" ])\n\n script = \"//build/android/gyp/write_ordered_libraries.py\"\n depfile = \"$target_gen_dir/$target_name.d\"\n inputs = [\n invoker.binary,\n android_readelf,\n ]\n outputs = [\n _libraries_list,\n ]\n rebased_binaries = rebase_path([ invoker.binary ], root_build_dir)\n args = [\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n \"--input-libraries=$rebased_binaries\",\n \"--libraries-dir\",\n rebase_path(root_shlib_dir, root_build_dir),\n \"--output\",\n rebase_path(_libraries_list, root_build_dir),\n \"--readelf\",\n rebase_path(android_readelf, root_build_dir),\n ]\n }\n\n copy_ex(target_name) {\n clear_dir = true\n\n inputs = [\n _libraries_list,\n invoker.binary,\n ]\n\n dest = invoker.dist_dir\n data = [\n \"${invoker.dist_dir}/\",\n ]\n\n _rebased_libraries_list = rebase_path(_libraries_list, root_build_dir)\n _rebased_binaries_list = rebase_path([ invoker.binary ], root_build_dir)\n args = [\n \"--files=@FileArg($_rebased_libraries_list:lib_paths)\",\n \"--files=$_rebased_binaries_list\",\n ]\n if (defined(invoker.extra_files)) {\n _rebased_extra_files = rebase_path(invoker.extra_files, root_build_dir)\n args += [ \"--files=$_rebased_extra_files\" ]\n }\n\n deps = [\n \":$_find_deps_target_name\",\n ]\n if (defined(invoker.deps)) {\n deps += invoker.deps\n }\n }\n}\n\n# Writes a script to root_out_dir/bin that passes --output-directory to the\n# wrapped script, in addition to forwarding arguments. Most / all of these\n# wrappers should be made deps of //tools/android:android_tools.\n#\n# Variables\n# target: Script to wrap.\n# flag_name: Default is \"--output-directory\"\n#\n# Example\n# wrapper_script(\"foo_wrapper\") {\n# target = \"//pkg/foo.py\"\n# }\ntemplate(\"wrapper_script\") {\n action(target_name) {\n _name = get_path_info(invoker.target, \"name\")\n _output = \"$root_out_dir/bin/$_name\"\n\n script = \"//build/android/gyp/create_tool_wrapper.py\"\n outputs = [\n _output,\n ]\n\n # The target isn't actually used by the script, but it's nice to have GN\n # check that it exists.\n inputs = [\n invoker.target,\n ]\n args = [\n \"--output\",\n rebase_path(_output, root_build_dir),\n \"--target\",\n rebase_path(invoker.target, root_build_dir),\n \"--output-directory\",\n rebase_path(root_out_dir, root_build_dir),\n ]\n if (defined(invoker.flag_name)) {\n args += [ \"--flag-name=${invoker.flag_name}\" ]\n }\n }\n}\n\nif (enable_java_templates) {\n import(\"//build/config/sanitizers/sanitizers.gni\")\n import(\"//tools/grit/grit_rule.gni\")\n\n # Declare a jni target\n #\n # This target generates the native jni bindings for a set of .java files.\n #\n # See base/android/jni_generator/jni_generator.py for more info about the\n # format of generating JNI bindings.\n #\n # Variables\n # sources: list of .java files to generate jni for\n # jni_package: subdirectory path for generated bindings\n #\n # Example\n # generate_jni(\"foo_jni\") {\n # sources = [\n # \"android/java/src/org/chromium/foo/Foo.java\",\n # \"android/java/src/org/chromium/foo/FooUtil.java\",\n # ]\n # jni_package = \"foo\"\n # }\n template(\"generate_jni\") {\n set_sources_assignment_filter([])\n forward_variables_from(invoker, [ \"testonly\" ])\n\n assert(defined(invoker.sources))\n assert(defined(invoker.jni_package))\n jni_package = invoker.jni_package\n base_output_dir = \"${target_gen_dir}/${target_name}\"\n package_output_dir = \"${base_output_dir}/${jni_package}\"\n jni_output_dir = \"${package_output_dir}/jni\"\n\n jni_generator_include =\n \"//base/android/jni_generator/jni_generator_helper.h\"\n\n foreach_target_name = \"${target_name}__jni_gen\"\n action_foreach(foreach_target_name) {\n script = \"//base/android/jni_generator/jni_generator.py\"\n depfile = \"$target_gen_dir/$target_name.{{source_name_part}}.d\"\n sources = invoker.sources\n outputs = [\n \"${jni_output_dir}/{{source_name_part}}_jni.h\",\n ]\n\n args = [\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n \"--input_file={{source}}\",\n \"--optimize_generation=1\",\n \"--ptr_type=long\",\n \"--output_dir\",\n rebase_path(jni_output_dir, root_build_dir),\n \"--includes\",\n rebase_path(jni_generator_include, jni_output_dir),\n \"--native_exports_optional\",\n ]\n\n if (enable_profiling) {\n args += [ \"--enable_profiling\" ]\n }\n }\n\n config(\"jni_includes_${target_name}\") {\n # TODO(cjhopman): #includes should probably all be relative to\n # base_output_dir. Remove that from this config once the includes are\n # updated.\n include_dirs = [\n base_output_dir,\n package_output_dir,\n ]\n }\n\n group(target_name) {\n forward_variables_from(invoker,\n [\n \"deps\",\n \"public_deps\",\n \"visibility\",\n ])\n if (!defined(public_deps)) {\n public_deps = []\n }\n public_deps += [ \":$foreach_target_name\" ]\n public_configs = [ \":jni_includes_${target_name}\" ]\n }\n }\n\n # Declare a jni target for a prebuilt jar\n #\n # This target generates the native jni bindings for a set of classes in a .jar.\n #\n # See base/android/jni_generator/jni_generator.py for more info about the\n # format of generating JNI bindings.\n #\n # Variables\n # classes: list of .class files in the jar to generate jni for. These should\n # include the full path to the .class file.\n # jni_package: subdirectory path for generated bindings\n # jar_file: the path to the .jar. If not provided, will default to the sdk's\n # android.jar\n #\n # deps, public_deps: As normal\n #\n # Example\n # generate_jar_jni(\"foo_jni\") {\n # classes = [\n # \"android/view/Foo.class\",\n # ]\n # jni_package = \"foo\"\n # }\n template(\"generate_jar_jni\") {\n set_sources_assignment_filter([])\n forward_variables_from(invoker, [ \"testonly\" ])\n\n assert(defined(invoker.classes))\n assert(defined(invoker.jni_package))\n\n if (defined(invoker.jar_file)) {\n jar_file = invoker.jar_file\n } else {\n jar_file = android_sdk_jar\n }\n\n jni_package = invoker.jni_package\n base_output_dir = \"${root_gen_dir}/${target_name}/${jni_package}\"\n jni_output_dir = \"${base_output_dir}/jni\"\n\n jni_generator_include =\n \"//base/android/jni_generator/jni_generator_helper.h\"\n\n # TODO(cjhopman): make jni_generator.py support generating jni for multiple\n # .class files from a .jar.\n jni_actions = []\n foreach(class, invoker.classes) {\n _classname_list = []\n _classname_list = process_file_template([ class ], \"{{source_name_part}}\")\n classname = _classname_list[0]\n jni_target_name = \"${target_name}__jni_${classname}\"\n jni_actions += [ \":$jni_target_name\" ]\n action(jni_target_name) {\n # The sources aren't compiled so don't check their dependencies.\n check_includes = false\n depfile = \"$target_gen_dir/$target_name.d\"\n script = \"//base/android/jni_generator/jni_generator.py\"\n sources = [\n jar_file,\n ]\n outputs = [\n \"${jni_output_dir}/${classname}_jni.h\",\n ]\n\n args = [\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n \"--jar_file\",\n rebase_path(jar_file, root_build_dir),\n \"--input_file\",\n class,\n \"--optimize_generation=1\",\n \"--ptr_type=long\",\n \"--output_dir\",\n rebase_path(jni_output_dir, root_build_dir),\n \"--includes\",\n rebase_path(jni_generator_include, jni_output_dir),\n \"--native_exports_optional\",\n ]\n\n if (enable_profiling) {\n args += [ \"--enable_profiling\" ]\n }\n }\n }\n\n config(\"jni_includes_${target_name}\") {\n include_dirs = [ base_output_dir ]\n }\n\n group(target_name) {\n public_deps = []\n forward_variables_from(invoker,\n [\n \"deps\",\n \"public_deps\",\n \"visibility\",\n ])\n public_deps += jni_actions\n public_configs = [ \":jni_includes_${target_name}\" ]\n }\n }\n\n # Declare a target for c-preprocessor-generated java files\n #\n # NOTE: For generating Java conterparts to enums prefer using the java_cpp_enum\n # rule instead.\n #\n # This target generates java files using the host C pre-processor. Each file in\n # sources will be compiled using the C pre-processor. If include_path is\n # specified, it will be passed (with --I) to the pre-processor.\n #\n # This target will create a single .srcjar. Adding this target to an\n # android_library target's srcjar_deps will make the generated java files be\n # included in that library's final outputs.\n #\n # Variables\n # sources: list of files to be processed by the C pre-processor. For each\n # file in sources, there will be one .java file in the final .srcjar. For a\n # file named FooBar.template, a java file will be created with name\n # FooBar.java.\n # inputs: additional compile-time dependencies. Any files\n # `#include`-ed in the templates should be listed here.\n # package_name: this will be the subdirectory for each .java file in the\n # .srcjar.\n #\n # Example\n # java_cpp_template(\"foo_generated_enum\") {\n # sources = [\n # \"android/java/templates/Foo.template\",\n # ]\n # inputs = [\n # \"android/java/templates/native_foo_header.h\",\n # ]\n #\n # package_name = \"org/chromium/base/library_loader\"\n # include_path = \"android/java/templates\"\n # }\n template(\"java_cpp_template\") {\n set_sources_assignment_filter([])\n forward_variables_from(invoker, [ \"testonly\" ])\n\n _include_path = \"//\"\n if (defined(invoker.include_path)) {\n _include_path = invoker.include_path\n }\n\n _apply_gcc_target_name = \"${target_name}__apply_gcc\"\n _base_gen_dir = \"${target_gen_dir}/${target_name}/java_cpp_template\"\n\n action_foreach(_apply_gcc_target_name) {\n forward_variables_from(invoker,\n [\n \"deps\",\n \"public_deps\",\n \"data_deps\",\n ])\n script = \"//build/android/gyp/gcc_preprocess.py\"\n if (defined(invoker.inputs)) {\n inputs = invoker.inputs + []\n }\n depfile =\n \"${target_gen_dir}/${invoker.target_name}_{{source_name_part}}.d\"\n\n sources = invoker.sources\n\n outputs = [\n \"$_base_gen_dir/${invoker.package_name}/{{source_name_part}}.java\",\n ]\n\n args = [\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n \"--include-path\",\n rebase_path(_include_path, root_build_dir),\n \"--output\",\n rebase_path(outputs[0], root_build_dir),\n \"--template={{source}}\",\n ]\n\n if (defined(invoker.defines)) {\n foreach(def, invoker.defines) {\n args += [\n \"--defines\",\n def,\n ]\n }\n }\n }\n\n # Filter out .d files.\n set_sources_assignment_filter([ \"*.d\" ])\n sources = get_target_outputs(\":$_apply_gcc_target_name\")\n\n zip(target_name) {\n forward_variables_from(invoker, [ \"visibility\" ])\n inputs = sources\n output = \"${target_gen_dir}/${target_name}.srcjar\"\n base_dir = _base_gen_dir\n deps = [\n \":$_apply_gcc_target_name\",\n ]\n }\n }\n\n # Declare a target for generating Java classes from C++ enums.\n #\n # This target generates Java files from C++ enums using a script.\n #\n # This target will create a single .srcjar. Adding this target to an\n # android_library target's srcjar_deps will make the generated java files be\n # included in that library's final outputs.\n #\n # Variables\n # sources: list of files to be processed by the script. For each annotated\n # enum contained in the sources files the script will generate a .java\n # file with the same name as the name of the enum.\n #\n # Example\n # java_cpp_enum(\"foo_generated_enum\") {\n # sources = [\n # \"src/native_foo_header.h\",\n # ]\n # }\n template(\"java_cpp_enum\") {\n action(target_name) {\n # The sources aren't compiled so don't check their dependencies.\n check_includes = false\n set_sources_assignment_filter([])\n\n assert(defined(invoker.sources))\n forward_variables_from(invoker,\n [\n \"sources\",\n \"testonly\",\n \"visibility\",\n ])\n\n script = \"//build/android/gyp/java_cpp_enum.py\"\n depfile = \"$target_gen_dir/$target_name.d\"\n\n _srcjar_path = \"${target_gen_dir}/${target_name}.srcjar\"\n _rebased_srcjar_path = rebase_path(_srcjar_path, root_build_dir)\n _rebased_sources = rebase_path(invoker.sources, root_build_dir)\n\n args = [\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n \"--srcjar=$_rebased_srcjar_path\",\n ] + _rebased_sources\n outputs = [\n _srcjar_path,\n ]\n }\n }\n\n # Declare a target for processing a Jinja template.\n #\n # Variables\n # input: The template file to be processed.\n # output: Where to save the result.\n # variables: (Optional) A list of variables to make available to the template\n # processing environment, e.g. [\"name=foo\", \"color=red\"].\n #\n # Example\n # jinja_template(\"chrome_public_manifest\") {\n # input = \"java/AndroidManifest.xml\"\n # output = \"$target_gen_dir/AndroidManifest.xml\"\n # }\n template(\"jinja_template\") {\n set_sources_assignment_filter([])\n forward_variables_from(invoker, [ \"testonly\" ])\n\n assert(defined(invoker.input))\n assert(defined(invoker.output))\n\n action(target_name) {\n forward_variables_from(invoker,\n [\n \"visibility\",\n \"deps\",\n ])\n\n sources = [\n invoker.input,\n ]\n script = \"//build/android/gyp/jinja_template.py\"\n depfile = \"$target_gen_dir/$target_name.d\"\n\n outputs = [\n invoker.output,\n ]\n\n args = [\n \"--loader-base-dir\",\n rebase_path(\"//\", root_build_dir),\n \"--inputs\",\n rebase_path(invoker.input, root_build_dir),\n \"--output\",\n rebase_path(invoker.output, root_build_dir),\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n ]\n if (defined(invoker.variables)) {\n variables = invoker.variables\n args += [ \"--variables=${variables}\" ]\n }\n }\n }\n\n # Declare a target for processing Android resources as Jinja templates.\n #\n # This takes an Android resource directory where each resource is a Jinja\n # template, processes each template, then packages the results in a zip file\n # which can be consumed by an android resources, library, or apk target.\n #\n # If this target is included in the deps of an android resources/library/apk,\n # the resources will be included with that target.\n #\n # Variables\n # resources: The list of resources files to process.\n # res_dir: The resource directory containing the resources.\n # variables: (Optional) A list of variables to make available to the template\n # processing environment, e.g. [\"name=foo\", \"color=red\"].\n #\n # Example\n # jinja_template_resources(\"chrome_public_template_resources\") {\n # res_dir = \"res_template\"\n # resources = [\"res_template/xml/syncable.xml\"]\n # variables = [\"color=red\"]\n # }\n template(\"jinja_template_resources\") {\n set_sources_assignment_filter([])\n forward_variables_from(invoker, [ \"testonly\" ])\n\n assert(defined(invoker.resources))\n assert(defined(invoker.res_dir))\n\n _base_path = \"$target_gen_dir/$target_name\"\n _resources_zip = _base_path + \".resources.zip\"\n _build_config = _base_path + \".build_config\"\n\n write_build_config(\"${target_name}__build_config\") {\n build_config = _build_config\n resources_zip = _resources_zip\n type = \"android_resources\"\n if (defined(invoker.deps)) {\n possible_config_deps = invoker.deps\n }\n }\n\n action(\"${target_name}__template\") {\n forward_variables_from(invoker, [ \"deps\" ])\n sources = invoker.resources\n script = \"//build/android/gyp/jinja_template.py\"\n depfile = \"$target_gen_dir/$target_name.d\"\n\n outputs = [\n _resources_zip,\n ]\n\n rebased_resources = rebase_path(invoker.resources, root_build_dir)\n args = [\n \"--inputs=${rebased_resources}\",\n \"--inputs-base-dir\",\n rebase_path(invoker.res_dir, root_build_dir),\n \"--outputs-zip\",\n rebase_path(_resources_zip, root_build_dir),\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n ]\n if (defined(invoker.variables)) {\n variables = invoker.variables\n args += [ \"--variables=${variables}\" ]\n }\n }\n\n group(target_name) {\n public_deps = [\n \":${target_name}__build_config\",\n \":${target_name}__template\",\n ]\n }\n }\n\n # Declare an Android resources target\n #\n # This creates a resources zip file that will be used when building an Android\n # library or apk and included into a final apk.\n #\n # To include these resources in a library/apk, this target should be listed in\n # the library's deps. A library/apk will also include any resources used by its\n # own dependencies.\n #\n # Variables\n # deps: Specifies the dependencies of this target. Any Android resources\n # listed in deps will be included by libraries/apks that depend on this\n # target.\n # resource_dirs: List of directories containing resources for this target.\n # generated_resource_dirs: List of directories containing resources for this\n # target which are *generated* by a dependency. |generated_resource_files|\n # must be specified if |generated_resource_dirs| is specified.\n # generated_resource_files: List of all files in |generated_resource_dirs|.\n # |generated_resource_dirs| must be specified in |generated_resource_files|\n # is specified.\n # android_manifest: AndroidManifest.xml for this target. Defaults to\n # //build/android/AndroidManifest.xml.\n # android_manifest_dep: Target that generates AndroidManifest (if applicable)\n # custom_package: java package for generated .java files.\n # v14_skip: If true, don't run v14 resource generator on this. Defaults to\n # false. (see build/android/gyp/generate_v14_compatible_resources.py)\n # shared_resources: If true make a resource package that can be loaded by a\n # different application at runtime to access the package's resources.\n # app_as_shared_lib: If true make a resource package that can be loaded as\n # both shared_resources and normal application.\n\n # Example:\n # android_resources(\"foo_resources\") {\n # deps = [\":foo_strings_grd\"]\n # resource_dirs = [\"res\"]\n # custom_package = \"org.chromium.foo\"\n # }\n #\n # android_resources(\"foo_resources_overrides\") {\n # deps = [\":foo_resources\"]\n # resource_dirs = [\"res_overrides\"]\n # }\n template(\"android_resources\") {\n set_sources_assignment_filter([])\n forward_variables_from(invoker, [ \"testonly\" ])\n\n assert(defined(invoker.resource_dirs))\n\n base_path = \"$target_gen_dir/$target_name\"\n zip_path = base_path + \".resources.zip\"\n srcjar_path = base_path + \".srcjar\"\n r_text_path = base_path + \"_R.txt\"\n build_config = base_path + \".build_config\"\n\n build_config_target_name = \"${target_name}__build_config\"\n process_resources_target_name = \"${target_name}__process_resources\"\n final_target_name = target_name\n\n write_build_config(build_config_target_name) {\n type = \"android_resources\"\n forward_variables_from(invoker,\n [\n \"android_manifest\",\n \"custom_package\",\n ])\n resource_dirs = []\n if (defined(invoker.resource_dirs)) {\n resource_dirs += invoker.resource_dirs\n }\n if (defined(invoker.generated_resource_dirs)) {\n resource_dirs += invoker.generated_resource_dirs\n }\n\n if (defined(invoker.deps)) {\n possible_config_deps = invoker.deps\n }\n if (defined(invoker.android_manifest_dep)) {\n deps = [\n invoker.android_manifest_dep,\n ]\n }\n\n # No package means resources override their deps.\n if (defined(custom_package) || defined(android_manifest)) {\n r_text = r_text_path\n } else {\n assert(defined(invoker.deps),\n \"Must specify deps when custom_package is omitted.\")\n }\n\n resources_zip = zip_path\n srcjar = srcjar_path\n }\n\n process_resources(process_resources_target_name) {\n forward_variables_from(invoker,\n [\n \"app_as_shared_lib\",\n \"android_manifest\",\n \"custom_package\",\n \"deps\",\n \"generated_resource_dirs\",\n \"generated_resource_files\",\n \"resource_dirs\",\n \"shared_resources\",\n \"v14_skip\",\n ])\n if (!defined(deps)) {\n deps = []\n }\n deps += [ \":$build_config_target_name\" ]\n if (defined(invoker.android_manifest_dep)) {\n deps += [ invoker.android_manifest_dep ]\n }\n\n # Always generate R.onResourcesLoaded() method, it is required for\n # compiling ResourceRewriter, there is no side effect because the\n # generated R.class isn't used in final apk.\n shared_resources = true\n if (!defined(android_manifest)) {\n android_manifest = \"//build/android/AndroidManifest.xml\"\n }\n }\n\n group(final_target_name) {\n forward_variables_from(invoker, [ \"visibility\" ])\n public_deps = [\n \":${target_name}__process_resources\",\n ]\n }\n }\n\n # Declare an Android assets target.\n #\n # Defines a set of files to include as assets in a dependent apk.\n #\n # To include these assets in an apk, this target should be listed in\n # the apk's deps, or in the deps of a library target used by an apk.\n #\n # Variables\n # deps: Specifies the dependencies of this target. Any Android assets\n # listed in deps will be included by libraries/apks that depend on this\n # target.\n # sources: List of files to include as assets.\n # renaming_sources: List of files to include as assets and be renamed.\n # renaming_destinations: List of asset paths for files in renaming_sources.\n # disable_compression: Whether to disable compression for files that are\n # known to be compressable (default: false).\n #\n # Example:\n # android_assets(\"content_shell_assets\") {\n # deps = [\n # \":generates_foo\",\n # \":other_assets\",\n # ]\n # sources = [\n # \"//path/asset1.png\",\n # \"//path/asset2.png\",\n # \"$target_gen_dir/foo.dat\",\n # ]\n # }\n #\n # android_assets(\"overriding_content_shell_assets\") {\n # deps = [ \":content_shell_assets\" ]\n # # Override foo.dat from content_shell_assets.\n # sources = [ \"//custom/foo.dat\" ]\n # renaming_sources = [ \"//path/asset2.png\" ]\n # renaming_destinations = [ \"renamed/asset2.png\" ]\n # }\n template(\"android_assets\") {\n set_sources_assignment_filter([])\n forward_variables_from(invoker, [ \"testonly\" ])\n\n _build_config = \"$target_gen_dir/$target_name.build_config\"\n _build_config_target_name = \"${target_name}__build_config\"\n\n write_build_config(_build_config_target_name) {\n type = \"android_assets\"\n build_config = _build_config\n\n forward_variables_from(invoker, [ \"disable_compression\" ])\n\n if (defined(invoker.deps)) {\n possible_config_deps = invoker.deps\n }\n\n if (defined(invoker.sources)) {\n asset_sources = invoker.sources\n }\n if (defined(invoker.renaming_sources)) {\n assert(defined(invoker.renaming_destinations))\n _source_count = 0\n foreach(_, invoker.renaming_sources) {\n _source_count += 1\n }\n _dest_count = 0\n foreach(_, invoker.renaming_destinations) {\n _dest_count += 1\n }\n assert(\n _source_count == _dest_count,\n \"android_assets() renaming_sources.length != renaming_destinations.length\")\n asset_renaming_sources = invoker.renaming_sources\n asset_renaming_destinations = invoker.renaming_destinations\n }\n }\n\n group(target_name) {\n forward_variables_from(invoker,\n [\n \"deps\",\n \"visibility\",\n ])\n public_deps = [\n \":$_build_config_target_name\",\n ]\n }\n }\n\n # Declare a group() that supports forwarding java dependency information.\n #\n # Example\n # java_group(\"conditional_deps\") {\n # if (enable_foo) {\n # deps = [\":foo_java\"]\n # }\n # }\n template(\"java_group\") {\n forward_variables_from(invoker, [ \"testonly\" ])\n write_build_config(\"${target_name}__build_config\") {\n type = \"group\"\n build_config = \"$target_gen_dir/${invoker.target_name}.build_config\"\n if (defined(invoker.deps)) {\n possible_config_deps = invoker.deps\n }\n }\n group(target_name) {\n forward_variables_from(invoker, \"*\")\n if (!defined(deps)) {\n deps = []\n }\n deps += [ \":${target_name}__build_config\" ]\n }\n }\n\n # Declare a target that generates localized strings.xml from a .grd file.\n #\n # If this target is included in the deps of an android resources/library/apk,\n # the strings.xml will be included with that target.\n #\n # Variables\n # deps: Specifies the dependencies of this target.\n # grd_file: Path to the .grd file to generate strings.xml from.\n # outputs: Expected grit outputs (see grit rule).\n #\n # Example\n # java_strings_grd(\"foo_strings_grd\") {\n # grd_file = \"foo_strings.grd\"\n # }\n template(\"java_strings_grd\") {\n set_sources_assignment_filter([])\n forward_variables_from(invoker, [ \"testonly\" ])\n\n base_path = \"$target_gen_dir/$target_name\"\n resources_zip = base_path + \".resources.zip\"\n build_config = base_path + \".build_config\"\n\n write_build_config(\"${target_name}__build_config\") {\n type = \"android_resources\"\n }\n\n # Put grit files into this subdirectory of target_gen_dir.\n extra_output_path = target_name + \"_grit_output\"\n\n grit_target_name = \"${target_name}__grit\"\n grit_output_dir = \"$target_gen_dir/$extra_output_path\"\n grit(grit_target_name) {\n forward_variables_from(invoker, [ \"deps\" ])\n grit_flags = [\n \"-E\",\n \"ANDROID_JAVA_TAGGED_ONLY=false\",\n ]\n output_dir = grit_output_dir\n resource_ids = \"\"\n source = invoker.grd_file\n outputs = invoker.outputs\n }\n\n # This needs to get outputs from grit's internal target, not the final\n # source_set.\n generate_strings_outputs = get_target_outputs(\":${grit_target_name}_grit\")\n\n zip(\"${target_name}__zip\") {\n base_dir = grit_output_dir\n inputs = generate_strings_outputs\n output = resources_zip\n deps = [\n \":$grit_target_name\",\n ]\n }\n\n group(target_name) {\n public_deps = [\n \":${target_name}__build_config\",\n \":${target_name}__zip\",\n ]\n }\n }\n\n # Declare a target that packages strings.xml generated from a grd file.\n #\n # If this target is included in the deps of an android resources/library/apk,\n # the strings.xml will be included with that target.\n #\n # Variables\n # grit_output_dir: directory containing grit-generated files.\n # generated_files: list of android resource files to package.\n #\n # Example\n # java_strings_grd_prebuilt(\"foo_strings_grd\") {\n # grit_output_dir = \"$root_gen_dir/foo/grit\"\n # generated_files = [\n # \"values/strings.xml\"\n # ]\n # }\n template(\"java_strings_grd_prebuilt\") {\n set_sources_assignment_filter([])\n forward_variables_from(invoker, [ \"testonly\" ])\n\n base_path = \"$target_gen_dir/$target_name\"\n resources_zip = base_path + \".resources.zip\"\n build_config = base_path + \".build_config\"\n\n build_config_target_name = \"${target_name}__build_config\"\n zip_target_name = \"${target_name}__zip\"\n final_target_name = target_name\n\n write_build_config(build_config_target_name) {\n type = \"android_resources\"\n }\n\n zip(zip_target_name) {\n visibility = [ \":$final_target_name\" ]\n\n base_dir = invoker.grit_output_dir\n inputs = rebase_path(invoker.generated_files, \".\", base_dir)\n output = resources_zip\n deps = [\n \":$build_config_target_name\",\n ]\n if (defined(invoker.deps)) {\n deps += invoker.deps\n }\n }\n\n group(final_target_name) {\n forward_variables_from(invoker, [ \"visibility\" ])\n public_deps = [\n \":$zip_target_name\",\n ]\n }\n }\n\n # Declare a Java executable target\n #\n # This target creates an executable from java code and libraries. The executable\n # will be in the output folder's /bin/ directory.\n #\n # Variables\n # deps: Specifies the dependencies of this target. Java targets in this list\n # will be included in the executable (and the javac classpath).\n # java_files: List of .java files included in this library.\n # srcjar_deps: List of srcjar dependencies. The .java files in the srcjars\n # will be added to java_files and be included in this library.\n # srcjars: List of srcjars to be included in this library, together with the\n # ones obtained from srcjar_deps.\n # bypass_platform_checks: Disables checks about cross-platform (Java/Android)\n # dependencies for this target. This will allow depending on an\n # android_library target, for example.\n # chromium_code: If true, extra analysis warning/errors will be enabled.\n # enable_errorprone: If true, enables the errorprone compiler.\n # enable_incremental_javac_override: Overrides the\n # global enable_incremental_javac.\n # main_class: When specified, a wrapper script is created within\n # $root_build_dir/bin to launch the binary with the given class as the\n # entrypoint.\n # wrapper_script_args: List of additional arguments for the wrapper script.\n #\n # data_deps, testonly\n #\n # Example\n # java_binary(\"foo\") {\n # java_files = [ \"org/chromium/foo/FooMain.java\" ]\n # deps = [ \":bar_java\" ]\n # main_class = \"org.chromium.foo.FooMain\"\n # }\n template(\"java_binary\") {\n set_sources_assignment_filter([])\n\n java_library_impl(target_name) {\n forward_variables_from(invoker, \"*\")\n supports_android = false\n main_class = invoker.main_class\n is_java_binary = true\n }\n }\n\n # Declare a Junit executable target\n #\n # This target creates an executable from java code for running as a junit test\n # suite. The executable will be in the output folder's /bin/ directory.\n #\n # Variables\n # deps: Specifies the dependencies of this target. Java targets in this list\n # will be included in the executable (and the javac classpath).\n #\n # java_files: List of .java files included in this library.\n # srcjar_deps: List of srcjar dependencies. The .java files in the srcjars\n # will be added to java_files and be included in this library.\n # srcjars: List of srcjars to be included in this library, together with the\n # ones obtained from srcjar_deps.\n #\n # chromium_code: If true, extra analysis warning/errors will be enabled.\n #\n # Example\n # junit_binary(\"foo\") {\n # java_files = [ \"org/chromium/foo/FooTest.java\" ]\n # deps = [ \":bar_java\" ]\n # }\n template(\"junit_binary\") {\n set_sources_assignment_filter([])\n testonly = true\n\n _java_binary_target_name = \"${target_name}__java_binary\"\n _test_runner_target_name = \"${target_name}__test_runner_script\"\n\n test_runner_script(_test_runner_target_name) {\n test_name = invoker.target_name\n test_suite = invoker.target_name\n test_type = \"junit\"\n ignore_all_data_deps = true\n }\n\n java_binary(_java_binary_target_name) {\n deps = []\n output_name = invoker.target_name\n forward_variables_from(invoker, \"*\")\n testonly = true\n bypass_platform_checks = true\n main_class = \"org.chromium.testing.local.JunitTestMain\"\n wrapper_script_name = \"helper/$target_name\"\n deps += [\n \"//testing/android/junit:junit_test_support\",\n \"//third_party/junit\",\n \"//third_party/mockito:mockito_java\",\n \"//third_party/robolectric:robolectric_all_java\",\n ]\n }\n group(target_name) {\n public_deps = [\n \":$_java_binary_target_name\",\n \":$_test_runner_target_name\",\n ]\n }\n }\n\n # Declare a java library target\n #\n # Variables\n # deps: Specifies the dependencies of this target. Java targets in this list\n # will be added to the javac classpath.\n #\n # java_files: List of .java files included in this library.\n # srcjar_deps: List of srcjar dependencies. The .java files in the srcjars\n # will be added to java_files and be included in this library.\n # srcjars: List of srcjars to be included in this library, together with the\n # ones obtained from srcjar_deps.\n #\n # input_jars_paths: A list of paths to the jars that should be included\n # in the classpath. These are in addition to library .jars that\n # appear in deps.\n #\n # chromium_code: If true, extra analysis warning/errors will be enabled.\n # enable_errorprone: If true, enables the errorprone compiler.\n # enable_incremental_javac_override: Overrides the global\n # enable_incremental_javac.\n #\n # jar_excluded_patterns: List of patterns of .class files to exclude from the\n # final jar.\n #\n # output_name: File name for the output .jar (not including extension).\n # Defaults to the input .jar file name.\n #\n # proguard_preprocess: If true, proguard preprocessing will be run. This can\n # be used to remove unwanted parts of the library.\n # proguard_preprocess_config: Path to the proguard config for preprocessing.\n # proguard_configs: List of proguard configs to use in final apk step for\n # any apk that depends on this library.\n #\n # supports_android: If true, Android targets (android_library, android_apk)\n # may depend on this target. Note: if true, this target must only use the\n # subset of Java available on Android.\n # bypass_platform_checks: Disables checks about cross-platform (Java/Android)\n # dependencies for this target. This will allow depending on an\n # android_library target, for example.\n #\n # additional_jar_files: Use to package additional files into the output jar.\n # Pass a list of length-2 lists with format\n # [ [ path_to_file, path_to_put_in_jar ] ]\n #\n #\n # data_deps, testonly\n #\n # Example\n # java_library(\"foo_java\") {\n # java_files = [\n # \"org/chromium/foo/Foo.java\",\n # \"org/chromium/foo/FooInterface.java\",\n # \"org/chromium/foo/FooService.java\",\n # ]\n # deps = [\n # \":bar_java\"\n # ]\n # srcjar_deps = [\n # \":foo_generated_enum\"\n # ]\n # jar_excluded_patterns = [\n # \"*/FooService.class\", \"*/FooService\\$*.class\"\n # ]\n # }\n template(\"java_library\") {\n set_sources_assignment_filter([])\n java_library_impl(target_name) {\n forward_variables_from(invoker, \"*\")\n }\n }\n\n # Declare a java library target for a prebuilt jar\n #\n # Variables\n # deps: Specifies the dependencies of this target. Java targets in this list\n # will be added to the javac classpath.\n # jar_path: Path to the prebuilt jar.\n # jar_dep: Target that builds jar_path (optional).\n # main_class: When specified, a wrapper script is created within\n # $root_build_dir/bin to launch the binary with the given class as the\n # entrypoint.\n # output_name: File name for the output .jar (not including extension).\n # Defaults to the input .jar file name.\n # proguard_preprocess: If true, proguard preprocessing will be run. This can\n # be used to remove unwanted parts of the library.\n # proguard_preprocess_config: Path to the proguard config for preprocessing.\n # proguard_configs: List of proguard configs to use in final apk step for\n # any apk that depends on this library.\n # supports_android: If true, Android targets (android_library, android_apk)\n # may depend on this target. Note: if true, this target must only use the\n # subset of Java available on Android.\n #\n # Example\n # java_prebuilt(\"foo_java\") {\n # jar_path = \"foo.jar\"\n # deps = [\n # \":foo_resources\",\n # \":bar_java\"\n # ]\n # }\n template(\"java_prebuilt\") {\n set_sources_assignment_filter([])\n java_prebuilt_impl(target_name) {\n forward_variables_from(invoker, \"*\")\n }\n }\n\n # Declare an Android library target\n #\n # This target creates an Android library containing java code and Android\n # resources.\n #\n # Variables\n # deps: Specifies the dependencies of this target. Java targets in this list\n # will be added to the javac classpath. Android resources in dependencies\n # will be used when building this library.\n #\n # java_files: List of .java files included in this library.\n # srcjar_deps: List of srcjar dependencies. The .java files in the srcjars\n # will be added to java_files and be included in this library.\n # srcjars: List of srcjars to be included in this library, together with the\n # ones obtained from srcjar_deps.\n #\n # input_jars_paths: A list of paths to the jars that should be included\n # in the classpath. These are in addition to library .jars that\n # appear in deps.\n #\n # chromium_code: If true, extra analysis warning/errors will be enabled.\n # enable_errorprone: If true, enables the errorprone compiler.\n # enable_incremental_javac_override: Overrides the global\n # enable_incremental_javac.\n #\n # jar_excluded_patterns: List of patterns of .class files to exclude from the\n # final jar.\n #\n # proguard_preprocess: If true, proguard preprocessing will be run. This can\n # be used to remove unwanted parts of the library.\n # proguard_preprocess_config: Path to the proguard config for preprocessing.\n # proguard_configs: List of proguard configs to use in final apk step for\n # any apk that depends on this library.\n #\n # output_name: File name for the output .jar (not including extension).\n # Defaults to the input .jar file name.\n # dex_path: If set, the resulting .dex.jar file will be placed under this\n # path.\n #\n # alternative_android_sdk_ijar: if set, the given android_sdk_ijar file\n # replaces the default android_sdk_ijar.\n #\n # alternative_android_sdk_ijar_dep: the target that generates\n # alternative_android_sdk_ijar, must be set if alternative_android_sdk_ijar\n # is used.\n #\n # emma_never_instrument: Disables EMMA Java code coverage for this target.\n #\n # Example\n # android_library(\"foo_java\") {\n # java_files = [\n # \"android/org/chromium/foo/Foo.java\",\n # \"android/org/chromium/foo/FooInterface.java\",\n # \"android/org/chromium/foo/FooService.java\",\n # ]\n # deps = [\n # \":bar_java\"\n # ]\n # srcjar_deps = [\n # \":foo_generated_enum\"\n # ]\n # jar_excluded_patterns = [\n # \"*/FooService.class\", \"*/FooService\\$*.class\"\n # ]\n # }\n template(\"android_library\") {\n set_sources_assignment_filter([])\n assert(!defined(invoker.jar_path),\n \"android_library does not support a custom jar path\")\n\n if (defined(invoker.alternative_android_sdk_ijar)) {\n assert(defined(invoker.alternative_android_sdk_ijar_dep))\n }\n\n java_library_impl(target_name) {\n forward_variables_from(invoker, \"*\")\n\n supports_android = true\n requires_android = true\n\n if (!defined(jar_excluded_patterns)) {\n jar_excluded_patterns = []\n }\n jar_excluded_patterns += [\n \"*/R.class\",\n \"*/R\\$*.class\",\n \"*/Manifest.class\",\n \"*/Manifest\\$*.class\",\n ]\n }\n }\n\n # Declare a target that packages a set of Java dependencies into a standalone\n # .dex.jar.\n #\n # Variables\n # deps: specifies the dependencies of this target. Android libraries in deps\n # will be packaged into the resulting .dex.jar file.\n # dex_path: location at which the output file will be put\n template(\"android_standalone_library\") {\n set_sources_assignment_filter([])\n deps_dex(target_name) {\n forward_variables_from(invoker,\n [\n \"deps\",\n \"dex_path\",\n \"excluded_jars\",\n ])\n }\n }\n\n # Declare an Android library target for a prebuilt jar\n #\n # This target creates an Android library containing java code and Android\n # resources.\n #\n # Variables\n # deps: Specifies the dependencies of this target. Java targets in this list\n # will be added to the javac classpath. Android resources in dependencies\n # will be used when building this library.\n # jar_path: Path to the prebuilt jar.\n # output_name: File name for the output .jar (not including extension).\n # Defaults to the input .jar file name.\n # proguard_preprocess: If true, proguard preprocessing will be run. This can\n # be used to remove unwanted parts of the library.\n # proguard_preprocess_config: Path to the proguard config for preprocessing.\n # proguard_configs: List of proguard configs to use in final apk step for\n # any apk that depends on this library.\n #\n # Example\n # android_java_prebuilt(\"foo_java\") {\n # jar_path = \"foo.jar\"\n # deps = [\n # \":foo_resources\",\n # \":bar_java\"\n # ]\n # }\n template(\"android_java_prebuilt\") {\n set_sources_assignment_filter([])\n java_prebuilt_impl(target_name) {\n forward_variables_from(invoker, \"*\")\n supports_android = true\n requires_android = true\n strip_resource_classes = true\n }\n }\n\n # Declare an Android apk target\n #\n # This target creates an Android APK containing java code, resources, assets,\n # and (possibly) native libraries.\n #\n # Variables\n # alternative_android_sdk_jar: The alternative android sdk jar used in\n # proguard.\n # android_aapt_path: Android aapt tool to replace default one to build\n # resource.\n # android_manifest: Path to AndroidManifest.xml.\n # android_manifest_dep: Target that generates AndroidManifest (if applicable)\n # chromium_code: If true, extra analysis warning/errors will be enabled.\n # dist_ijar_path: Path to create \"${target_name}_dist_ijar\" target\n # (used by instrumentation_test_apk).\n # data_deps: List of dependencies needed at runtime. These will be built but\n # won't change the generated .apk in any way (in fact they may be built\n # after the .apk is).\n # deps: List of dependencies. All Android java resources and libraries in the\n # \"transitive closure\" of these dependencies will be included in the apk.\n # Note: this \"transitive closure\" actually only includes such targets if\n # they are depended on through android_library or android_resources targets\n # (and so not through builtin targets like 'action', 'group', etc).\n # install_script_name: Name of wrapper script (default=target_name).\n # java_files: List of .java files to include in the apk.\n # srcjar_deps: List of srcjar dependencies. The .java files in the srcjars\n # will be added to java_files and be included in this apk.\n # apk_name: Name for final apk.\n # final_apk_path: Path to final built apk. Default is\n # $root_out_dir/apks/$apk_name.apk. Setting this will override apk_name.\n # loadable_modules: List of paths to native libraries to include. Different\n # from |shared_libraries| in that:\n # * dependencies of this .so are not automatically included\n # * \".cr.so\" is never added\n # * they are not side-loaded for _incremental targets.\n # * load_library_from_apk, use_chromium_linker,\n # and enable_relocation_packing do not apply\n # Use this instead of shared_libraries when you are going to load the library\n # conditionally, and only when shared_libraries doesn't work for you.\n # shared_libraries: List shared_library targets to bundle. If these\n # libraries depend on other shared_library targets, those dependencies will\n # also be included in the apk (e.g. for is_component_build).\n # secondary_abi_shared_libraries: secondary abi shared_library targets to\n # bundle. If these libraries depend on other shared_library targets, those\n # dependencies will also be included in the apk (e.g. for is_component_build).\n # native_lib_placeholders: List of placeholder filenames to add to the apk\n # (optional).\n # apk_under_test: For an instrumentation test apk, this is the target of the\n # tested apk.\n # include_all_resources - If true include all resource IDs in all generated\n # R.java files.\n # testonly: Marks this target as \"test-only\".\n # write_asset_list: Adds an extra file to the assets, which contains a list of\n # all other asset files.\n # requires_sdk_api_level_23: If defined and true, the apk is intended for\n # installation only on Android M or later. In these releases the system\n # linker does relocation unpacking, so we can enable it unconditionally.\n # secondary_native_libs (deprecated): The path of native libraries for secondary\n # app abi.\n # run_findbugs_override: Forces run_findbugs on or off. If undefined, the\n # default will use the build arg run_findbugs.\n # proguard_jar_path: The path to proguard.jar you wish to use. If undefined,\n # the proguard used will be the checked in one in //third_party/proguard.\n #\n # Example\n # android_apk(\"foo_apk\") {\n # android_manifest = \"AndroidManifest.xml\"\n # java_files = [\n # \"android/org/chromium/foo/FooApplication.java\",\n # \"android/org/chromium/foo/FooActivity.java\",\n # ]\n # deps = [\n # \":foo_support_java\"\n # \":foo_resources\"\n # ]\n # srcjar_deps = [\n # \":foo_generated_enum\"\n # ]\n # shared_libraries = [\n # \":my_shared_lib\",\n # ]\n # }\n template(\"android_apk\") {\n set_sources_assignment_filter([])\n forward_variables_from(invoker, [ \"testonly\" ])\n\n assert(defined(invoker.final_apk_path) || defined(invoker.apk_name))\n assert(defined(invoker.android_manifest))\n gen_dir = \"$target_gen_dir/$target_name\"\n base_path = \"$gen_dir/$target_name\"\n _build_config = \"$target_gen_dir/$target_name.build_config\"\n resources_zip_path = \"$base_path.resources.zip\"\n _all_resources_zip_path = \"$base_path.resources.all.zip\"\n _jar_path = \"$base_path.jar\"\n _lib_dex_path = \"$base_path.dex.jar\"\n _rebased_lib_dex_path = rebase_path(_lib_dex_path, root_build_dir)\n _template_name = target_name\n\n enable_multidex =\n defined(invoker.enable_multidex) && invoker.enable_multidex\n if (enable_multidex) {\n final_dex_path = \"$gen_dir/classes.dex.zip\"\n } else {\n final_dex_path = \"$gen_dir/classes.dex\"\n }\n final_dex_target_name = \"${_template_name}__final_dex\"\n\n _final_apk_path = \"\"\n if (defined(invoker.final_apk_path)) {\n _final_apk_path = invoker.final_apk_path\n } else if (defined(invoker.apk_name)) {\n _final_apk_path = \"$root_build_dir/apks/\" + invoker.apk_name + \".apk\"\n }\n _final_apk_path_no_ext_list =\n process_file_template([ _final_apk_path ],\n \"{{source_dir}}/{{source_name_part}}\")\n _final_apk_path_no_ext = _final_apk_path_no_ext_list[0]\n assert(_final_apk_path_no_ext != \"\") # Mark as used.\n\n _install_script_name = \"install_$_template_name\"\n if (defined(invoker.install_script_name)) {\n _install_script_name = invoker.install_script_name\n }\n _incremental_install_script_path =\n \"${root_out_dir}/bin/${_install_script_name}_incremental\"\n\n _version_code = android_default_version_code\n if (defined(invoker.version_code)) {\n _version_code = invoker.version_code\n }\n\n _version_name = android_default_version_name\n if (defined(invoker.version_name)) {\n _version_name = invoker.version_name\n }\n _keystore_path = android_keystore_path\n _keystore_name = android_keystore_name\n _keystore_password = android_keystore_password\n\n if (defined(invoker.keystore_path)) {\n _keystore_path = invoker.keystore_path\n _keystore_name = invoker.keystore_name\n _keystore_password = invoker.keystore_password\n }\n\n _srcjar_deps = []\n if (defined(invoker.srcjar_deps)) {\n _srcjar_deps += invoker.srcjar_deps\n }\n\n _use_chromium_linker =\n defined(invoker.use_chromium_linker) && invoker.use_chromium_linker\n _enable_relocation_packing = defined(invoker.enable_relocation_packing) &&\n invoker.enable_relocation_packing\n _load_library_from_apk =\n defined(invoker.load_library_from_apk) && invoker.load_library_from_apk\n _requires_sdk_api_level_23 = defined(invoker.requires_sdk_api_level_23) &&\n invoker.requires_sdk_api_level_23\n\n assert(_use_chromium_linker || true) # Mark as used.\n assert(_requires_sdk_api_level_23 || true)\n if (_enable_relocation_packing) {\n assert(_use_chromium_linker || _requires_sdk_api_level_23,\n \"enable_relocation_packing requires either use_chromium_linker \" +\n \"or requires_sdk_api_level_23\")\n }\n if (_load_library_from_apk) {\n assert(_use_chromium_linker || _requires_sdk_api_level_23,\n \"load_library_from_apk requires use_chromium_linker \" +\n \"or requires_sdk_api_level_23\")\n }\n\n # The dependency that makes the chromium linker, if any is needed.\n _native_libs_deps = []\n _shared_libraries_is_valid =\n defined(invoker.shared_libraries) && invoker.shared_libraries != []\n _secondary_abi_native_libs_deps = []\n assert(_secondary_abi_native_libs_deps == []) # mark as used.\n _secondary_abi_shared_libraries_is_valid =\n defined(invoker.secondary_abi_shared_libraries) &&\n invoker.secondary_abi_shared_libraries != []\n\n if (is_component_build || is_asan) {\n if (_shared_libraries_is_valid) {\n _native_libs_deps += [ \"//build/android:cpplib_stripped\" ]\n }\n if (_secondary_abi_shared_libraries_is_valid) {\n _secondary_abi_native_libs_deps += [ \"//build/android:cpplib_stripped($android_secondary_abi_toolchain)\" ]\n }\n }\n\n if (_shared_libraries_is_valid) {\n _native_libs_deps += invoker.shared_libraries\n\n # To determine the filenames of all dependent shared libraries, write the\n # runtime deps of |shared_libraries| to a file during \"gn gen\".\n # write_build_config.py will then grep this file for *.so to obtain the\n # complete list.\n _runtime_deps_file =\n \"$target_gen_dir/${_template_name}.native.runtimedeps\"\n group(\"${_template_name}__runtime_deps\") {\n deps = _native_libs_deps\n write_runtime_deps = _runtime_deps_file\n }\n\n _native_lib_version_rule = \"\"\n if (defined(invoker.native_lib_version_rule)) {\n _native_lib_version_rule = invoker.native_lib_version_rule\n }\n _native_lib_version_arg = \"\\\"\\\"\"\n if (defined(invoker.native_lib_version_arg)) {\n _native_lib_version_arg = invoker.native_lib_version_arg\n }\n }\n\n if (_secondary_abi_shared_libraries_is_valid) {\n _secondary_abi_native_libs_deps += invoker.secondary_abi_shared_libraries\n\n # To determine the filenames of all dependent shared libraries, write the\n # runtime deps of |shared_libraries| to a file during \"gn gen\".\n # write_build_config.py will then grep this file for *.so to obtain the\n # complete list.\n _secondary_abi_runtime_deps_file =\n \"$target_gen_dir/${_template_name}.secondary.abi.native.runtimedeps\"\n group(\"${_template_name}_secondary_abi__runtime_deps\") {\n deps = _secondary_abi_native_libs_deps\n write_runtime_deps = _secondary_abi_runtime_deps_file\n }\n }\n\n if (defined(invoker.deps)) {\n set_sources_assignment_filter([ \"*manifest*\" ])\n sources = invoker.deps\n set_sources_assignment_filter([])\n if (sources != invoker.deps) {\n _bad_deps = invoker.deps - sources\n assert(\n false,\n \"Possible manifest-generating dep found in deps. Use android_manifest_dep for this instead. Found: $_bad_deps\")\n }\n sources = []\n }\n _android_manifest_deps = []\n if (defined(invoker.android_manifest_dep)) {\n _android_manifest_deps = [ invoker.android_manifest_dep ]\n }\n _android_manifest = invoker.android_manifest\n\n _rebased_build_config = rebase_path(_build_config, root_build_dir)\n _create_abi_split =\n defined(invoker.create_abi_split) && invoker.create_abi_split\n _create_density_splits =\n defined(invoker.create_density_splits) && invoker.create_density_splits\n _create_language_splits =\n defined(invoker.language_splits) && invoker.language_splits != []\n\n # Help GN understand that _create_abi_split is not unused (bug in GN).\n assert(_create_abi_split || true)\n\n _proguard_enabled =\n defined(invoker.proguard_enabled) && invoker.proguard_enabled\n if (_proguard_enabled) {\n _proguard_output_jar_path = \"$base_path.proguard.jar\"\n }\n\n _emma_never_instrument = defined(invoker.testonly) && invoker.testonly\n\n build_config_target = \"${_template_name}__build_config\"\n write_build_config(build_config_target) {\n forward_variables_from(invoker, [ \"apk_under_test\" ])\n type = \"android_apk\"\n jar_path = _jar_path\n dex_path = final_dex_path\n apk_path = _final_apk_path\n incremental_apk_path = \"${_final_apk_path_no_ext}_incremental.apk\"\n incremental_install_script_path = _incremental_install_script_path\n resources_zip = resources_zip_path\n build_config = _build_config\n android_manifest = _android_manifest\n\n deps = _android_manifest_deps\n\n if (defined(invoker.deps)) {\n possible_config_deps = invoker.deps\n }\n\n # Added emma to the target's classpath via its .build_config.\n if (emma_coverage && !_emma_never_instrument) {\n possible_config_deps +=\n [ \"//third_party/android_tools:emma_device_java\" ]\n }\n\n proguard_enabled = _proguard_enabled\n if (_proguard_enabled) {\n proguard_info = \"$_proguard_output_jar_path.info\"\n }\n\n # Don't depend on the runtime_deps target in order to avoid having to\n # build the native libraries just to create the .build_config file.\n # The dep is unnecessary since the runtime_deps file is created by gn gen\n # and the runtime_deps file is added to write_build_config.py's depfile.\n if (_native_libs_deps != []) {\n shared_libraries_runtime_deps_file = _runtime_deps_file\n }\n if (_secondary_abi_native_libs_deps != []) {\n secondary_abi_shared_libraries_runtime_deps_file =\n _secondary_abi_runtime_deps_file\n }\n }\n\n _final_deps = []\n\n _generated_proguard_config = \"$base_path.resources.proguard.txt\"\n process_resources_target = \"${_template_name}__process_resources\"\n process_resources(process_resources_target) {\n forward_variables_from(invoker,\n [\n \"alternative_android_sdk_jar\",\n \"android_aapt_path\",\n \"app_as_shared_lib\",\n \"include_all_resources\",\n \"shared_resources\",\n ])\n srcjar_path = \"${target_gen_dir}/${target_name}.srcjar\"\n r_text_path = \"${target_gen_dir}/${target_name}_R.txt\"\n android_manifest = _android_manifest\n resource_dirs = [ \"//build/android/ant/empty/res\" ]\n zip_path = resources_zip_path\n all_resources_zip_path = _all_resources_zip_path\n generate_constant_ids = true\n proguard_file = _generated_proguard_config\n\n build_config = _build_config\n deps = _android_manifest_deps + [ \":$build_config_target\" ]\n if (defined(invoker.deps)) {\n deps += invoker.deps\n }\n }\n _srcjar_deps += [ \":$process_resources_target\" ]\n\n if (_native_libs_deps != []) {\n _enable_chromium_linker_tests = false\n if (defined(invoker.enable_chromium_linker_tests)) {\n _enable_chromium_linker_tests = invoker.enable_chromium_linker_tests\n }\n _ordered_libraries_json =\n \"$target_gen_dir/$target_name.ordered_libararies.json\"\n _rebased_ordered_libraries_json =\n rebase_path(_ordered_libraries_json, root_build_dir)\n _ordered_libraries_target = \"${_template_name}__write_ordered_libraries\"\n\n # TODO(agrieve): Make GN write runtime deps in dependency order so as to\n # not need this manual sorting step.\n action(_ordered_libraries_target) {\n script = \"//build/android/gyp/write_ordered_libraries.py\"\n deps = _native_libs_deps + [ \":$build_config_target\" ]\n outputs = [\n _ordered_libraries_json,\n ]\n _rebased_android_readelf = rebase_path(android_readelf, root_build_dir)\n args = [\n \"--readelf=$_rebased_android_readelf\",\n \"--output=$_rebased_ordered_libraries_json\",\n \"--libraries-dir=.\",\n \"--input-libraries=@FileArg($_rebased_build_config:native:libraries)\",\n ]\n }\n\n java_cpp_template(\"${_template_name}__native_libraries_java\") {\n package_name = \"org/chromium/base/library_loader\"\n sources = [\n \"//base/android/java/templates/NativeLibraries.template\",\n ]\n inputs = [\n _ordered_libraries_json,\n ]\n deps = [\n \":${_ordered_libraries_target}\",\n ]\n if (_native_lib_version_rule != \"\") {\n deps += [ _native_lib_version_rule ]\n }\n\n defines = [\n \"NATIVE_LIBRARIES_LIST=\" +\n \"@FileArg($_rebased_ordered_libraries_json:java_libraries_list)\",\n \"NATIVE_LIBRARIES_VERSION_NUMBER=$_native_lib_version_arg\",\n ]\n if (_use_chromium_linker) {\n defines += [ \"ENABLE_CHROMIUM_LINKER\" ]\n }\n if (_load_library_from_apk) {\n defines += [ \"ENABLE_CHROMIUM_LINKER_LIBRARY_IN_ZIP_FILE\" ]\n }\n if (_enable_chromium_linker_tests) {\n defines += [ \"ENABLE_CHROMIUM_LINKER_TESTS\" ]\n }\n }\n _srcjar_deps += [ \":${_template_name}__native_libraries_java\" ]\n }\n\n if (!defined(invoker.apk_under_test)) {\n java_cpp_template(\"${_template_name}__build_config_java\") {\n package_name = \"org/chromium/base\"\n sources = [\n \"//base/android/java/templates/BuildConfig.template\",\n ]\n deps = [\n \":$build_config_target\",\n ]\n\n defines = []\n if (enable_multidex) {\n defines += [ \"ENABLE_MULTIDEX\" ]\n }\n if (is_java_debug || dcheck_always_on) {\n defines += [ \"_DCHECK_IS_ON\" ]\n }\n defines += [\n \"COMPRESSED_LOCALE_LIST=\" +\n \"@FileArg($_rebased_build_config:compressed_locales_java_list)\",\n \"UNCOMPRESSED_LOCALE_LIST=\" +\n \"@FileArg($_rebased_build_config:uncompressed_locales_java_list)\",\n ]\n }\n _srcjar_deps += [ \":${_template_name}__build_config_java\" ]\n }\n\n java_target = \"${_template_name}__java\"\n java_library_impl(java_target) {\n forward_variables_from(invoker,\n [\n \"chromium_code\",\n \"java_files\",\n \"run_findbugs_override\",\n ])\n supports_android = true\n requires_android = true\n override_build_config = _build_config\n deps = _android_manifest_deps + [ \":$build_config_target\" ]\n\n android_manifest = _android_manifest\n srcjar_deps = _srcjar_deps\n jar_path = _jar_path\n dex_path = _lib_dex_path\n emma_never_instrument = _emma_never_instrument\n\n if (defined(invoker.deps)) {\n deps += invoker.deps\n }\n if (defined(invoker.apk_under_test)) {\n deps += [ \"${invoker.apk_under_test}__java\" ]\n }\n if (emma_coverage && !_emma_never_instrument) {\n deps += [ \"//third_party/android_tools:emma_device_java\" ]\n }\n }\n\n # TODO(cjhopman): This is only ever needed to calculate the list of tests to\n # run. See build/android/pylib/instrumentation/test_jar.py. We should be\n # able to just do that calculation at build time instead.\n if (defined(invoker.dist_ijar_path)) {\n _dist_ijar_path = invoker.dist_ijar_path\n action(\"${_template_name}_dist_ijar\") {\n script = \"//build/android/gyp/create_dist_jar.py\"\n depfile = \"$target_gen_dir/$target_name.d\"\n inputs = [\n _build_config,\n ]\n outputs = [\n \"${_dist_ijar_path}\",\n ]\n data = [\n _dist_ijar_path,\n ]\n args = [\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n \"--output\",\n rebase_path(\"${_dist_ijar_path}\", root_build_dir),\n \"--inputs=@FileArg($_rebased_build_config:dist_jar:all_interface_jars)\",\n ]\n deps = [\n \":$build_config_target\", # Generates the build config file.\n \":$java_target\", # Generates the jar file.\n ]\n }\n }\n\n if (_proguard_enabled) {\n _proguard_configs = [ _generated_proguard_config ]\n if (defined(invoker.proguard_configs)) {\n _proguard_configs += invoker.proguard_configs\n }\n assert(_proguard_configs != []) # Mark as used.\n _proguard_target = \"${_template_name}__proguard\"\n proguard(_proguard_target) {\n forward_variables_from(invoker,\n [\n \"alternative_android_sdk_jar\",\n \"deps\",\n \"proguard_jar_path\",\n ])\n if (!defined(deps)) {\n deps = []\n }\n deps += [\n \":$build_config_target\",\n \":$java_target\",\n \":$process_resources_target\",\n ]\n inputs = [\n _build_config,\n _jar_path,\n ] + _proguard_configs\n\n output_jar_path = _proguard_output_jar_path\n _rebased_proguard_configs =\n rebase_path(_proguard_configs, root_build_dir)\n args = [\n \"--proguard-configs=$_rebased_proguard_configs\",\n \"--proguard-configs=@FileArg($_rebased_build_config:proguard:lib_configs)\",\n \"--input-paths=@FileArg($_rebased_build_config:proguard:input_paths)\",\n \"--classpath=@FileArg($_rebased_build_config:proguard:lib_paths)\",\n ]\n if (defined(invoker.apk_under_test)) {\n deps += [\n \"${invoker.apk_under_test}__build_config\",\n \"${invoker.apk_under_test}__proguard\",\n ]\n _apk_under_test_build_config =\n get_label_info(invoker.apk_under_test, \"target_gen_dir\") + \"/\" +\n get_label_info(invoker.apk_under_test, \"name\") + \".build_config\"\n _rebased_apk_under_test_build_config =\n rebase_path(_apk_under_test_build_config, root_build_dir)\n args += [ \"--tested-apk-info=@FileArg($_rebased_apk_under_test_build_config:deps_info:proguard_info)\" ]\n }\n }\n _dex_sources = [ _proguard_output_jar_path ]\n _dex_deps = [ \":$_proguard_target\" ]\n\n _copy_proguard_mapping_target = \"${_template_name}__copy_proguard_mapping\"\n copy(_copy_proguard_mapping_target) {\n sources = [\n \"$_proguard_output_jar_path.mapping\",\n ]\n outputs = [\n \"$_final_apk_path.mapping\",\n ]\n deps = [\n \":$_proguard_target\",\n ]\n }\n } else {\n if (enable_multidex) {\n _dex_sources = [ _jar_path ]\n } else {\n _dex_sources = [ _lib_dex_path ]\n }\n _dex_deps = [ \":$java_target\" ]\n }\n\n dex(\"$final_dex_target_name\") {\n deps = _dex_deps + [ \":$build_config_target\" ]\n inputs = [\n _build_config,\n ]\n sources = _dex_sources\n output = final_dex_path\n\n # All deps are already included in _dex_sources when proguard is used.\n if (!_proguard_enabled) {\n if (enable_multidex) {\n _dex_arg_key = \"${_rebased_build_config}:dist_jar:dependency_jars\"\n } else {\n _dex_arg_key =\n \"${_rebased_build_config}:final_dex:dependency_dex_files\"\n }\n args = [ \"--inputs=@FileArg($_dex_arg_key)\" ]\n }\n }\n\n _native_libs_file_arg_dep = \":$build_config_target\"\n _native_libs_file_arg = \"@FileArg($_rebased_build_config:native:libraries)\"\n _secondary_abi_native_libs_file_arg_dep = \":$build_config_target\"\n _secondary_abi_native_libs_file_arg =\n \"@FileArg($_rebased_build_config:native:secondary_abi_libraries)\"\n assert(_secondary_abi_native_libs_file_arg != \"\" &&\n _secondary_abi_native_libs_file_arg_dep != \"\") # Mark as used.\n\n if (_native_libs_deps != [] && _enable_relocation_packing) {\n _prepare_native_target_name = \"${_template_name}__prepare_native\"\n _native_libs_json = \"$gen_dir/packed-libs/filelist.json\"\n _rebased_native_libs_json = rebase_path(_native_libs_json, root_build_dir)\n _native_libs_file_arg_dep = \":$_prepare_native_target_name\"\n _native_libs_file_arg = \"@FileArg($_rebased_native_libs_json:files)\"\n\n pack_relocation_section(_prepare_native_target_name) {\n forward_variables_from(invoker,\n [\n \"deps\",\n \"public_deps\",\n ])\n file_list_json = _native_libs_json\n libraries_filearg =\n \"@FileArg(${_rebased_build_config}:native:libraries)\"\n inputs = [\n _build_config,\n ]\n\n deps += _native_libs_deps\n deps += [ \":$build_config_target\" ]\n }\n if (_secondary_abi_native_libs_deps != []) {\n _prepare_native_target_name =\n \"${_template_name}_secondary_abi__prepare_native\"\n _native_libs_json =\n \"$gen_dir/packed-libs/$android_secondary_abi_cpu/filelist.json\"\n _rebased_native_libs_json =\n rebase_path(_native_libs_json, root_build_dir)\n _secondary_abi_native_libs_file_arg_dep =\n \":$_prepare_native_target_name\"\n _secondary_abi_native_libs_file_arg =\n \"@FileArg($_rebased_native_libs_json:files)\"\n\n pack_relocation_section(_prepare_native_target_name) {\n forward_variables_from(invoker,\n [\n \"deps\",\n \"public_deps\",\n ])\n file_list_json = _native_libs_json\n libraries_filearg = \"@FileArg(${_rebased_build_config}:native:secondary_abi_libraries)\"\n inputs = [\n _build_config,\n ]\n\n deps += _secondary_abi_native_libs_deps\n deps += [ \":$build_config_target\" ]\n }\n }\n }\n\n _extra_native_libs = []\n _extra_native_libs_deps = []\n _extra_native_libs_even_when_incremental = []\n _extra_native_libs_even_when_incremental_deps = []\n assert(_extra_native_libs_even_when_incremental_deps == []) # Mark as used.\n if (_native_libs_deps != []) {\n # zipalign can't align gdb_server, don't pack gdbserver temporarily.\n if (is_debug && (!defined(invoker.page_align_shared_libraries) ||\n !invoker.page_align_shared_libraries)) {\n _extra_native_libs_even_when_incremental = [ android_gdbserver ]\n }\n\n if (_use_chromium_linker) {\n _extra_native_libs =\n [ \"$root_shlib_dir/libchromium_android_linker$shlib_extension\" ]\n _extra_native_libs_deps +=\n [ \"//base/android/linker:chromium_android_linker\" ]\n }\n }\n if (defined(invoker.loadable_modules) && invoker.loadable_modules != []) {\n _extra_native_libs_even_when_incremental += invoker.loadable_modules\n }\n\n _final_deps += [ \":${_template_name}__create\" ]\n create_apk(\"${_template_name}__create\") {\n forward_variables_from(invoker,\n [\n \"alternative_android_sdk_jar\",\n \"android_aapt_path\",\n \"app_as_shared_lib\",\n \"deps\",\n \"extensions_to_not_compress\",\n \"language_splits\",\n \"page_align_shared_libraries\",\n \"public_deps\",\n \"secondary_native_libs\",\n \"shared_resources\",\n \"uncompress_shared_libraries\",\n \"write_asset_list\",\n ])\n if (!defined(deps)) {\n deps = []\n }\n apk_path = _final_apk_path\n android_manifest = _android_manifest\n assets_build_config = _build_config\n resources_zip = _all_resources_zip_path\n dex_path = final_dex_path\n load_library_from_apk = _load_library_from_apk\n create_density_splits = _create_density_splits\n emma_instrument = emma_coverage && !_emma_never_instrument\n\n if (!defined(extensions_to_not_compress)) {\n # Allow icu data, v8 snapshots, and pak files to be loaded directly from\n # the .apk.\n # Note: These are actually suffix matches, not necessarily extensions.\n extensions_to_not_compress = \".dat,.bin,.pak\"\n }\n\n version_code = _version_code\n version_name = _version_name\n\n keystore_name = _keystore_name\n keystore_path = _keystore_path\n keystore_password = _keystore_password\n\n # Incremental apk does not use native libs nor final dex.\n incremental_deps = deps + _android_manifest_deps + [\n \":$build_config_target\",\n \":$process_resources_target\",\n ]\n\n # This target generates the input file _all_resources_zip_path.\n deps += _android_manifest_deps + [\n \":$build_config_target\",\n \":$process_resources_target\",\n \":$final_dex_target_name\",\n ]\n\n if ((_native_libs_deps != [] ||\n _extra_native_libs_even_when_incremental != []) &&\n !_create_abi_split) {\n deps += _native_libs_deps + _extra_native_libs_deps +\n _extra_native_libs_even_when_incremental_deps +\n [ _native_libs_file_arg_dep ]\n native_libs_filearg = _native_libs_file_arg\n native_libs = _extra_native_libs\n native_libs_even_when_incremental =\n _extra_native_libs_even_when_incremental\n }\n\n if (_secondary_abi_native_libs_deps != [] && !_create_abi_split) {\n deps += _secondary_abi_native_libs_deps +\n [ _secondary_abi_native_libs_file_arg_dep ]\n secondary_abi_native_libs_filearg = _secondary_abi_native_libs_file_arg\n }\n\n # Placeholders necessary for some older devices.\n # http://crbug.com/395038\n forward_variables_from(invoker, [ \"native_lib_placeholders\" ])\n }\n\n if ((_native_libs_deps != [] ||\n _extra_native_libs_even_when_incremental != []) && _create_abi_split) {\n _manifest_rule =\n \"${_template_name}__split_manifest_abi_${android_app_abi}\"\n generate_split_manifest(_manifest_rule) {\n main_manifest = _android_manifest\n out_manifest =\n \"$gen_dir/split-manifests/${android_app_abi}/AndroidManifest.xml\"\n split_name = \"abi_${android_app_abi}\"\n deps = _android_manifest_deps\n }\n\n _apk_rule = \"${_template_name}__split_apk_abi_${android_app_abi}\"\n _final_deps += [ \":$_apk_rule\" ]\n\n create_apk(_apk_rule) {\n apk_path = \"${_final_apk_path_no_ext}-abi-${android_app_abi}.apk\"\n base_path = \"$gen_dir/$_apk_rule\"\n\n manifest_outputs = get_target_outputs(\":${_manifest_rule}\")\n android_manifest = manifest_outputs[1]\n load_library_from_apk = _load_library_from_apk\n\n version_code = _version_code\n version_name = _version_name\n\n keystore_name = _keystore_name\n keystore_path = _keystore_path\n keystore_password = _keystore_password\n\n # Placeholders necessary for some older devices.\n # http://crbug.com/395038\n deps = []\n forward_variables_from(invoker,\n [\n \"alternative_android_sdk_jar\",\n \"android_aapt_path\",\n \"deps\",\n \"native_lib_placeholders\",\n \"public_deps\",\n ])\n\n incremental_deps =\n deps + _extra_native_libs_even_when_incremental_deps +\n [ \":$_manifest_rule\" ]\n deps = []\n deps = incremental_deps + _native_libs_deps + _extra_native_libs_deps +\n [ _native_libs_file_arg_dep ]\n native_libs_filearg = _native_libs_file_arg\n native_libs = _extra_native_libs\n native_libs_even_when_incremental =\n _extra_native_libs_even_when_incremental\n }\n }\n\n _create_incremental_script_rule_name =\n \"${_template_name}__incremental_script\"\n action(_create_incremental_script_rule_name) {\n script = \"//build/android/incremental_install/create_install_script.py\"\n depfile = \"$target_gen_dir/$target_name.d\"\n deps = [\n _native_libs_file_arg_dep,\n ]\n\n outputs = [\n _incremental_install_script_path,\n ]\n\n _rebased_apk_path_no_ext =\n rebase_path(_final_apk_path_no_ext, root_build_dir)\n _rebased_incremental_install_script_path =\n rebase_path(_incremental_install_script_path, root_build_dir)\n _rebased_depfile = rebase_path(depfile, root_build_dir)\n _dex_arg_key = \"${_rebased_build_config}:final_dex:dependency_dex_files\"\n args = [\n \"--apk-path=${_rebased_apk_path_no_ext}_incremental.apk\",\n \"--script-output-path=$_rebased_incremental_install_script_path\",\n \"--dex-file=$_rebased_lib_dex_path\",\n \"--dex-file-list=@FileArg($_dex_arg_key)\",\n \"--depfile=$_rebased_depfile\",\n ]\n if (_proguard_enabled) {\n args += [ \"--show-proguard-warning\" ]\n }\n if (defined(_native_libs_file_arg)) {\n args += [ \"--native-libs=$_native_libs_file_arg\" ]\n }\n if (_extra_native_libs != []) {\n # Don't pass in _extra_native_libs_even_when_incremental, since these are\n # end up in the apk and are not side-loaded.\n _rebased_extra_native_libs =\n rebase_path(_extra_native_libs, root_build_dir)\n args += [ \"--native-libs=$_rebased_extra_native_libs\" ]\n }\n if (_create_density_splits) {\n args += [ \"--split=${_rebased_apk_path_no_ext}-density-*.apk\" ]\n }\n if (_create_language_splits) {\n args += [ \"--split=${_rebased_apk_path_no_ext}-language-*.apk\" ]\n }\n if (_load_library_from_apk) {\n args += [ \"--dont-even-try=Incremental builds do not work with load_library_from_apk. Try setting is_component_build=true in your GN args.\" ]\n }\n }\n\n group(target_name) {\n forward_variables_from(invoker,\n [\n \"data\",\n \"data_deps\",\n ])\n public_deps = _final_deps\n\n # Make the proguard .mapping file easy to find by putting it beside the .apk.\n if (_proguard_enabled) {\n deps = [\n \":$_copy_proguard_mapping_target\",\n ]\n }\n }\n group(\"${target_name}_incremental\") {\n forward_variables_from(invoker,\n [\n \"data\",\n \"data_deps\",\n ])\n if (!defined(data_deps)) {\n data_deps = []\n }\n\n # device/commands is used by the installer script to push files via .zip.\n data_deps += [ \"//build/android/pylib/device/commands\" ] +\n _native_libs_deps + _extra_native_libs_deps\n\n # Since the _incremental.apk does not include use .so nor .dex from the\n # actual target, but instead loads them at runtime, we need to explicitly\n # depend on them here.\n public_deps = [\n \":${_create_incremental_script_rule_name}\",\n \":${_template_name}__create_incremental\",\n \":${java_target}\",\n ]\n }\n }\n\n # Declare an Android instrumentation test apk\n #\n # This target creates an Android instrumentation test apk.\n #\n # Variables\n # android_manifest: Path to AndroidManifest.xml.\n # data_deps: List of dependencies needed at runtime. These will be built but\n # won't change the generated .apk in any way (in fact they may be built\n # after the .apk is).\n # deps: List of dependencies. All Android java resources and libraries in the\n # \"transitive closure\" of these dependencies will be included in the apk.\n # Note: this \"transitive closure\" actually only includes such targets if\n # they are depended on through android_library or android_resources targets\n # (and so not through builtin targets like 'action', 'group', etc).\n # java_files: List of .java files to include in the apk.\n # srcjar_deps: List of srcjar dependencies. The .java files in the srcjars\n # will be added to java_files and be included in this apk.\n # apk_name: Name for final apk.\n # final_apk_path: Path to final built apk. Default is\n # $root_out_dir/apks/$apk_name.apk. Setting this will override apk_name.\n # shared_libraries: List shared_library targets to bundle. If these\n # libraries depend on other shared_library targets, those dependencies will\n # also be included in the apk (e.g. for is_component_build).\n # apk_under_test: The apk being tested.\n #\n # Example\n # instrumentation_test_apk(\"foo_test_apk\") {\n # android_manifest = \"AndroidManifest.xml\"\n # apk_name = \"FooTest\"\n # apk_under_test = \"Foo\"\n # java_files = [\n # \"android/org/chromium/foo/FooTestCase.java\",\n # \"android/org/chromium/foo/FooExampleTest.java\",\n # ]\n # deps = [\n # \":foo_test_support_java\"\n # ]\n # }\n template(\"instrumentation_test_apk\") {\n assert(defined(invoker.apk_name))\n testonly = true\n _apk_target_name = \"${target_name}__apk\"\n _test_runner_target_name = \"${target_name}__test_runner_script\"\n _install_script_name = \"install_$target_name\"\n _dist_ijar_path =\n \"$root_build_dir/test.lib.java/\" + invoker.apk_name + \".jar\"\n\n test_runner_script(_test_runner_target_name) {\n forward_variables_from(invoker,\n [\n \"additional_apks\",\n \"apk_under_test\",\n \"data\",\n \"data_deps\",\n \"deps\",\n \"ignore_all_data_deps\",\n \"public_deps\",\n ])\n test_name = invoker.target_name\n test_type = \"instrumentation\"\n apk_target = \":$_apk_target_name\"\n test_jar = _dist_ijar_path\n }\n\n test_runner_script(\"${_test_runner_target_name}_incremental\") {\n forward_variables_from(invoker,\n [\n \"additional_apks\",\n \"apk_under_test\",\n \"data\",\n \"data_deps\",\n \"deps\",\n \"ignore_all_data_deps\",\n \"public_deps\",\n ])\n test_name = \"${invoker.target_name}_incremental\"\n test_type = \"instrumentation\"\n apk_target = \":$_apk_target_name\"\n test_jar = _dist_ijar_path\n incremental_install = true\n }\n\n android_apk(_apk_target_name) {\n deps = []\n data_deps = []\n forward_variables_from(invoker, \"*\")\n install_script_name = _install_script_name\n deps += [ \"//testing/android/broker:broker_java\" ]\n data_deps += [\n \"//build/android/pylib/device/commands\",\n \"//tools/android/forwarder2\",\n \"//tools/android/md5sum\",\n ]\n if (defined(invoker.additional_apks)) {\n data_deps += invoker.additional_apks\n }\n\n if (defined(invoker.proguard_enabled) && invoker.proguard_enabled) {\n # When ProGuard is on, we use ProGuard to combine the under test java\n # code and the test java code. This is to allow us to apply all ProGuard\n # optimizations that we ship with, but not have them break tests. The\n # apk under test will still have the same resources, assets, and\n # manifest, all of which are the ones used in the tests.\n if (!defined(invoker.proguard_configs)) {\n proguard_configs = []\n }\n proguard_configs += [ \"//testing/android/proguard_for_test.flags\" ]\n }\n\n dist_ijar_path = _dist_ijar_path\n if (defined(invoker.run_findbugs_override)) {\n # Only allow findbugs when there are java files.\n run_findbugs_override =\n invoker.run_findbugs_override && defined(invoker.java_files)\n }\n }\n\n group(target_name) {\n public_deps = [\n \":$_apk_target_name\",\n \":$_test_runner_target_name\",\n\n # Required by test runner to enumerate test list.\n \":${_apk_target_name}_dist_ijar\",\n ]\n if (defined(invoker.apk_under_test)) {\n public_deps += [ invoker.apk_under_test ]\n }\n }\n\n # TODO: Delete once recipes no longer use this target.\n group(\"${target_name}_run\") {\n public_deps = [\n \":${invoker.target_name}\",\n ]\n }\n group(\"${target_name}_incremental\") {\n public_deps = [\n \":${_apk_target_name}_dist_ijar\",\n \":${_apk_target_name}_incremental\",\n \":${_test_runner_target_name}_incremental\",\n ]\n if (defined(invoker.apk_under_test)) {\n public_deps += [ \"${invoker.apk_under_test}_incremental\" ]\n }\n }\n }\n\n # Declare an Android gtest apk\n #\n # This target creates an Android apk for running gtest-based unittests.\n #\n # Variables\n # deps: Specifies the dependencies of this target. These will be passed to\n # the underlying android_apk invocation and should include the java and\n # resource dependencies of the apk.\n # shared_library: shared_library target that contains the unit tests.\n # apk_name: The name of the produced apk. If unspecified, it uses the name\n # of the shared_library target suffixed with \"_apk\"\n # use_default_launcher: Whether the default activity (NativeUnitTestActivity)\n # should be used for launching tests.\n # use_native_activity: Test implements ANativeActivity_onCreate().\n #\n # Example\n # unittest_apk(\"foo_unittests_apk\") {\n # deps = [ \":foo_java\", \":foo_resources\" ]\n # shared_library = \":foo_unittests\"\n # }\n template(\"unittest_apk\") {\n _use_native_activity =\n defined(invoker.use_native_activity) && invoker.use_native_activity\n _android_manifest = \"$target_gen_dir/$target_name/AndroidManifest.xml\"\n assert(invoker.shared_library != \"\")\n\n # This trivial assert is needed in case android_manifest is defined,\n # as otherwise _use_native_activity and _android_manifest would not be used.\n assert(_use_native_activity != \"\" && _android_manifest != \"\")\n\n if (!defined(invoker.android_manifest)) {\n jinja_template(\"${target_name}_manifest\") {\n _native_library_name = get_label_info(invoker.shared_library, \"name\")\n input = \"//testing/android/native_test/java/AndroidManifest.xml.jinja2\"\n output = _android_manifest\n variables = [\n \"is_component_build=${is_component_build}\",\n \"native_library_name=${_native_library_name}\",\n \"use_native_activity=${_use_native_activity}\",\n ]\n }\n }\n\n android_apk(target_name) {\n set_sources_assignment_filter([])\n data_deps = []\n deps = []\n forward_variables_from(invoker, \"*\")\n testonly = true\n\n assert(!defined(invoker.proguard_enabled) || !invoker.proguard_enabled ||\n invoker.proguard_configs != [])\n\n if (!defined(apk_name)) {\n apk_name = get_label_info(invoker.shared_library, \"name\")\n }\n\n if (!defined(android_manifest)) {\n android_manifest_dep = \":${target_name}_manifest\"\n android_manifest = _android_manifest\n }\n\n final_apk_path = \"$root_build_dir/${apk_name}_apk/${apk_name}-debug.apk\"\n\n if (!defined(use_default_launcher) || use_default_launcher) {\n deps += [ \"//testing/android/native_test:native_test_java\" ]\n }\n shared_libraries = [ invoker.shared_library ]\n deps += [\n \"//base:base_java\",\n \"//testing/android/appurify_support:appurify_support_java\",\n \"//testing/android/reporter:reporter_java\",\n ]\n data_deps += [\n \"//build/android/pylib/device/commands\",\n \"//tools/android/md5sum\",\n ]\n if (host_os == \"linux\") {\n data_deps += [ \"//tools/android/forwarder2\" ]\n }\n }\n }\n\n # Generate .java files from .aidl files.\n #\n # This target will store the .java files in a srcjar and should be included in\n # an android_library or android_apk's srcjar_deps.\n #\n # Variables\n # sources: Paths to .aidl files to compile.\n # import_include: Path to directory containing .java files imported by the\n # .aidl files.\n # interface_file: Preprocessed aidl file to import.\n #\n # Example\n # android_aidl(\"foo_aidl\") {\n # import_include = \"java/src\"\n # sources = [\n # \"java/src/com/foo/bar/FooBarService.aidl\",\n # \"java/src/com/foo/bar/FooBarServiceCallback.aidl\",\n # ]\n # }\n template(\"android_aidl\") {\n set_sources_assignment_filter([])\n forward_variables_from(invoker, [ \"testonly\" ])\n\n srcjar_path = \"${target_gen_dir}/${target_name}.srcjar\"\n aidl_path = \"${android_sdk_build_tools}/aidl\"\n framework_aidl = \"$android_sdk/framework.aidl\"\n\n action(target_name) {\n script = \"//build/android/gyp/aidl.py\"\n sources = invoker.sources\n\n imports = [ framework_aidl ]\n if (defined(invoker.interface_file)) {\n assert(invoker.interface_file != \"\")\n imports += [ invoker.interface_file ]\n }\n\n inputs = [ aidl_path ] + imports\n\n depfile = \"${target_gen_dir}/${target_name}.d\"\n outputs = [\n srcjar_path,\n ]\n rebased_imports = rebase_path(imports, root_build_dir)\n args = [\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n \"--aidl-path\",\n rebase_path(aidl_path, root_build_dir),\n \"--imports=$rebased_imports\",\n \"--srcjar\",\n rebase_path(srcjar_path, root_build_dir),\n ]\n if (defined(invoker.import_include) && invoker.import_include != \"\") {\n # TODO(cjhopman): aidl supports creating a depfile. We should be able to\n # switch to constructing a depfile for the overall action from that\n # instead of having all the .java files in the include paths as inputs.\n rebased_import_includes =\n rebase_path([ invoker.import_include ], root_build_dir)\n args += [ \"--includes=$rebased_import_includes\" ]\n\n _java_files_build_rel =\n exec_script(\"//build/android/gyp/find.py\",\n rebase_path([ invoker.import_include ], root_build_dir),\n \"list lines\")\n _java_files = rebase_path(_java_files_build_rel, \".\", root_build_dir)\n inputs += _java_files\n }\n args += rebase_path(sources, root_build_dir)\n }\n }\n\n # Compile a protocol buffer to java.\n #\n # This generates java files from protocol buffers and creates an Android library\n # containing the classes.\n #\n # Variables\n # sources: Paths to .proto files to compile.\n # proto_path: Root directory of .proto files.\n #\n # Example:\n # proto_java_library(\"foo_proto_java\") {\n # proto_path = \"src/foo\"\n # sources = [ \"$proto_path/foo.proto\" ]\n # }\n template(\"proto_java_library\") {\n set_sources_assignment_filter([])\n forward_variables_from(invoker, [ \"testonly\" ])\n _protoc_dep =\n \"//third_party/android_protobuf:android_protoc($host_toolchain)\"\n _protoc_out_dir = get_label_info(_protoc_dep, \"root_out_dir\")\n _protoc_bin = \"$_protoc_out_dir/android_protoc\"\n _proto_path = invoker.proto_path\n\n _template_name = target_name\n\n action(\"${_template_name}__protoc_java\") {\n srcjar_path = \"$target_gen_dir/$target_name.srcjar\"\n script = \"//build/protoc_java.py\"\n\n deps = [\n _protoc_dep,\n ]\n if (defined(invoker.deps)) {\n deps += invoker.deps\n }\n\n sources = invoker.sources\n depfile = \"$target_gen_dir/$target_name.d\"\n outputs = [\n srcjar_path,\n ]\n args = [\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n \"--protoc\",\n rebase_path(_protoc_bin, root_build_dir),\n \"--proto-path\",\n rebase_path(_proto_path, root_build_dir),\n \"--srcjar\",\n rebase_path(srcjar_path, root_build_dir),\n ] + rebase_path(sources, root_build_dir)\n }\n\n android_library(target_name) {\n chromium_code = false\n java_files = []\n srcjar_deps = [ \":${_template_name}__protoc_java\" ]\n deps = [\n \"//third_party/android_protobuf:protobuf_nano_javalib\",\n ]\n }\n }\n\n # Declare an Android library target for a prebuilt AAR.\n #\n # This target creates an Android library containing java code and Android\n # resources. For libraries without resources, it will not generate\n # corresponding android_resources targets.\n #\n # Variables\n # aar_path: Path to the AAR.\n # proguard_configs: List of proguard configs to use in final apk step for\n # any apk that depends on this library.\n # ignore_aidl: Whether to ignore .aidl files found with the .aar.\n # ignore_assets: Whether to ignore assets found in the .aar.\n # ignore_manifest: Whether to ignore merging of AndroidManifest.xml.\n # ignore_native_libraries: Whether to ignore .so files found in the .aar.\n # TODO(jbudorick@): remove this arguments after crbug.com/522043 is fixed.\n # requires_android: Whether this target can only be used for compiling Android related targets.\n #\n # Example\n # android_aar_prebuilt(\"foo_java\") {\n # aar_path = \"foo.aar\"\n # }\n template(\"android_aar_prebuilt\") {\n _output_path = \"${target_gen_dir}/${target_name}\"\n _unpack_target_name = \"${target_name}__unpack_aar\"\n _ignore_aidl = defined(invoker.ignore_aidl) && invoker.ignore_aidl\n _ignore_assets = defined(invoker.ignore_assets) && invoker.ignore_assets\n _ignore_manifest =\n defined(invoker.ignore_manifest) && invoker.ignore_manifest\n _ignore_native_libraries = defined(invoker.ignore_native_libraries) &&\n invoker.ignore_native_libraries\n\n # Scan the AAR file and determine the resources and jar files.\n # Some libraries might not have resources; others might have two jars.\n _scanned_files =\n exec_script(\"//build/android/gyp/aar.py\",\n [\n \"--input-file\",\n rebase_path(invoker.aar_path, root_build_dir),\n \"--list\",\n ],\n \"scope\")\n\n assert(_ignore_aidl || _scanned_files.aidl == [],\n \"android_aar_prebuilt() aidl not yet supported.\" +\n \" Implement or use ignore_aidl = true.\" +\n \" http://crbug.com/644439\")\n assert(_ignore_assets || _scanned_files.assets == [],\n \"android_aar_prebuilt() assets not yet supported.\" +\n \" Implement or use ignore_assets = true.\" +\n \" http://crbug.com/643966\")\n assert(_ignore_native_libraries || !_scanned_files.has_native_libraries,\n \"android_aar_prebuilt() with .so files is not supported.\" +\n \" Use ignore_native_libraries = true to silence this error.\")\n assert(_ignore_manifest || _scanned_files.is_manifest_empty,\n \"android_aar_prebuilt() manifest merging not yet supported and\" +\n \" non-trivial AndroidManifest.xml detected.\" +\n \" Implement or use ignore_manifest = true.\" +\n \" http://crbug.com/643967\")\n assert(_scanned_files.has_classes_jar || _scanned_files.subjars == [])\n\n action(_unpack_target_name) {\n script = \"//build/android/gyp/aar.py\" # Unzips the AAR\n args = [\n \"--input-file\",\n rebase_path(invoker.aar_path, root_build_dir),\n \"--output-dir\",\n rebase_path(_output_path, root_build_dir),\n \"--extract\",\n ]\n inputs = [\n invoker.aar_path,\n ]\n outputs = [\n \"${_output_path}/AndroidManifest.xml\",\n ]\n\n if (_scanned_files.resources != []) {\n outputs += [ \"${_output_path}/R.txt\" ]\n outputs += get_path_info(\n rebase_path(_scanned_files.resources, \"\", _output_path),\n \"abspath\")\n }\n if (_scanned_files.has_classes_jar) {\n outputs += [ \"${_output_path}/classes.jar\" ]\n }\n outputs +=\n get_path_info(rebase_path(_scanned_files.subjars, \"\", _output_path),\n \"abspath\")\n if (_scanned_files.has_proguard_flags) {\n outputs += [ \"${_output_path}/proguard.txt\" ]\n }\n }\n\n # Create the android_resources target for resources.\n if (_scanned_files.resources != []) {\n _res_target_name = \"${target_name}__res\"\n android_resources(_res_target_name) {\n forward_variables_from(invoker, [ \"deps\" ])\n if (!defined(deps)) {\n deps = []\n }\n deps += [ \":$_unpack_target_name\" ]\n resource_dirs = []\n generated_resource_dirs = [ \"${_output_path}/res\" ]\n generated_resource_files =\n rebase_path(_scanned_files.resources, \"\", _output_path)\n android_manifest_dep = \":$_unpack_target_name\"\n android_manifest = \"${_output_path}/AndroidManifest.xml\"\n v14_skip = true\n }\n }\n\n # Create android_java_prebuilt target for extra jars within jars/.\n _subjar_targets = []\n foreach(_tuple, _scanned_files.subjar_tuples) {\n _current_target = \"${target_name}__subjar_${_tuple[0]}\"\n _subjar_targets += [ \":$_current_target\" ]\n java_prebuilt(_current_target) {\n forward_variables_from(invoker,\n [\n \"jar_excluded_patterns\",\n \"requires_android\",\n ])\n deps = [\n \":$_unpack_target_name\",\n ]\n if (!defined(requires_android)) {\n requires_android = true\n }\n supports_android = true\n jar_path = \"$_output_path/${_tuple[1]}\"\n _base_output_name = get_path_info(jar_path, \"name\")\n output_name = \"${invoker.target_name}-$_base_output_name\"\n }\n }\n\n # Create android_java_prebuilt target for classes.jar.\n if (_scanned_files.has_classes_jar) {\n _jar_target_name = \"${target_name}__classes\"\n java_prebuilt(_jar_target_name) {\n forward_variables_from(invoker,\n [\n \"deps\",\n \"input_jars_paths\",\n \"jar_excluded_patterns\",\n \"proguard_configs\",\n \"requires_android\",\n ])\n if (!defined(deps)) {\n deps = []\n }\n deps += _subjar_targets + [ \":$_unpack_target_name\" ]\n if (defined(_res_target_name)) {\n deps += [ \":$_res_target_name\" ]\n }\n if (!defined(requires_android)) {\n requires_android = true\n }\n supports_android = true\n jar_path = \"$_output_path/classes.jar\"\n output_name = invoker.target_name\n\n if (_scanned_files.has_proguard_flags) {\n if (!defined(proguard_configs)) {\n proguard_configs = []\n }\n proguard_configs += [ \"$_output_path/proguard.txt\" ]\n }\n }\n }\n\n java_group(target_name) {\n deps = []\n if (defined(_jar_target_name)) {\n deps += [ \":$_jar_target_name\" ]\n\n # Although subjars are meant to be private, we add them as deps here\n # because in practice they seem to contain classes required to be in the\n # classpath.\n deps += _subjar_targets\n }\n if (defined(_res_target_name)) {\n deps += [ \":$_res_target_name\" ]\n }\n }\n }\n}\n" }, { "path": "src/test/resources/samples/langs/GN/clang.gni", "content": "# Copyright 2014 The Chromium Authors. All rights reserved.\n# Use of this source code is governed by a BSD-style license that can be\n# found in the LICENSE file.\n\nimport(\"//build/toolchain/toolchain.gni\")\n\ndeclare_args() {\n # Indicates if the build should use the Chrome-specific plugins for enforcing\n # coding guidelines, etc. Only used when compiling with Clang.\n clang_use_chrome_plugins = is_clang && !is_nacl && !use_xcode_clang\n\n clang_base_path = \"//third_party/llvm-build/Release+Asserts\"\n}\n" }, { "path": "src/test/resources/samples/langs/GN/filenames/.gn", "content": "# This file is used by the GN meta build system to find the root of the source\n# tree and to set startup options. For documentation on the values set in this\n# file, run \"gn help dotfile\" at the command line.\n\nimport(\"//build/dotfile_settings.gni\")\n\n# The location of the build configuration file.\nbuildconfig = \"//build/config/BUILDCONFIG.gn\"\n\n# The secondary source root is a parallel directory tree where\n# GN build files are placed when they can not be placed directly\n# in the source tree, e.g. for third party source trees.\nsecondary_source = \"//build/secondary/\"\n\n# These are the targets to check headers for by default. The files in targets\n# matching these patterns (see \"gn help label_pattern\" for format) will have\n# their includes checked for proper dependencies when you run either\n# \"gn check\" or \"gn gen --check\".\ncheck_targets = []\n\n# These are the list of GN files that run exec_script. This whitelist exists\n# to force additional review for new uses of exec_script, which is strongly\n# discouraged except for gypi_to_gn calls.\nexec_script_whitelist =\n build_dotfile_settings.exec_script_whitelist + [ \"//test/test262/BUILD.gn\" ]\n" }, { "path": "src/test/resources/samples/langs/GN/gcc_toolchain.gni", "content": "# Copyright (c) 2013 The Chromium Authors. All rights reserved.\n# Use of this source code is governed by a BSD-style license that can be\n# found in the LICENSE file.\n\nimport(\"//build/config/android/config.gni\")\nimport(\"//build/config/clang/clang.gni\")\nimport(\"//build/config/nacl/config.gni\")\nimport(\"//build/config/sanitizers/sanitizers.gni\")\nimport(\"//build/config/v8_target_cpu.gni\")\nimport(\"//build/toolchain/cc_wrapper.gni\")\nimport(\"//build/toolchain/goma.gni\")\nimport(\"//build/toolchain/toolchain.gni\")\n\n# This template defines a toolchain for something that works like gcc\n# (including clang).\n#\n# It requires the following variables specifying the executables to run:\n# - ar\n# - cc\n# - cxx\n# - ld\n#\n# Optional parameters that control the tools:\n#\n# - extra_cflags\n# Extra flags to be appended when compiling C files (but not C++ files).\n# - extra_cppflags\n# Extra flags to be appended when compiling both C and C++ files. \"CPP\"\n# stands for \"C PreProcessor\" in this context, although it can be\n# used for non-preprocessor flags as well. Not to be confused with\n# \"CXX\" (which follows).\n# - extra_cxxflags\n# Extra flags to be appended when compiling C++ files (but not C files).\n# - extra_ldflags\n# Extra flags to be appended when linking\n#\n# - libs_section_prefix\n# - libs_section_postfix\n# The contents of these strings, if specified, will be placed around\n# the libs section of the linker line. It allows one to inject libraries\n# at the beginning and end for all targets in a toolchain.\n# - solink_libs_section_prefix\n# - solink_libs_section_postfix\n# Same as libs_section_{pre,post}fix except used for solink instead of link.\n# - link_outputs\n# The content of this array, if specified, will be added to the list of\n# outputs from the link command. This can be useful in conjunction with\n# the post_link parameter.\n# - post_link\n# The content of this string, if specified, will be run as a separate\n# command following the the link command.\n# - deps\n# Just forwarded to the toolchain definition.\n# - executable_extension\n# If this string is specified it will be used for the file extension\n# for an executable, rather than using no extension; targets will\n# still be able to override the extension using the output_extension\n# variable.\n# - rebuild_define\n# The contents of this string, if specified, will be passed as a #define\n# to the toolchain. It can be used to force recompiles whenever a\n# toolchain is updated.\n# - shlib_extension\n# If this string is specified it will be used for the file extension\n# for a shared library, rather than default value specified in\n# toolchain.gni\n# - strip\n# Location of the strip executable. When specified, strip will be run on\n# all shared libraries and executables as they are built. The pre-stripped\n# artifacts will be put in lib.unstripped/ and exe.unstripped/.\ntemplate(\"gcc_toolchain\") {\n toolchain(target_name) {\n assert(defined(invoker.ar), \"gcc_toolchain() must specify a \\\"ar\\\" value\")\n assert(defined(invoker.cc), \"gcc_toolchain() must specify a \\\"cc\\\" value\")\n assert(defined(invoker.cxx), \"gcc_toolchain() must specify a \\\"cxx\\\" value\")\n assert(defined(invoker.ld), \"gcc_toolchain() must specify a \\\"ld\\\" value\")\n\n # This define changes when the toolchain changes, forcing a rebuild.\n # Nothing should ever use this define.\n if (defined(invoker.rebuild_define)) {\n rebuild_string = \"-D\" + invoker.rebuild_define + \" \"\n } else {\n rebuild_string = \"\"\n }\n\n # GN's syntax can't handle more than one scope dereference at once, like\n # \"invoker.toolchain_args.foo\", so make a temporary to hold the toolchain\n # args so we can do \"invoker_toolchain_args.foo\".\n assert(defined(invoker.toolchain_args),\n \"Toolchains must specify toolchain_args\")\n invoker_toolchain_args = invoker.toolchain_args\n assert(defined(invoker_toolchain_args.current_cpu),\n \"toolchain_args must specify a current_cpu\")\n assert(defined(invoker_toolchain_args.current_os),\n \"toolchain_args must specify a current_os\")\n\n # When invoking this toolchain not as the default one, these args will be\n # passed to the build. They are ignored when this is the default toolchain.\n toolchain_args = {\n # Populate toolchain args from the invoker.\n forward_variables_from(invoker_toolchain_args, \"*\")\n\n # The host toolchain value computed by the default toolchain's setup\n # needs to be passed through unchanged to all secondary toolchains to\n # ensure that it's always the same, regardless of the values that may be\n # set on those toolchains.\n host_toolchain = host_toolchain\n\n if (!defined(invoker_toolchain_args.v8_current_cpu)) {\n v8_current_cpu = invoker_toolchain_args.current_cpu\n }\n }\n\n # When the invoker has explicitly overridden use_goma or cc_wrapper in the\n # toolchain args, use those values, otherwise default to the global one.\n # This works because the only reasonable override that toolchains might\n # supply for these values are to force-disable them.\n if (defined(toolchain_args.use_goma)) {\n toolchain_uses_goma = toolchain_args.use_goma\n } else {\n toolchain_uses_goma = use_goma\n }\n if (defined(toolchain_args.cc_wrapper)) {\n toolchain_cc_wrapper = toolchain_args.cc_wrapper\n } else {\n toolchain_cc_wrapper = cc_wrapper\n }\n\n # Compute the compiler prefix.\n if (toolchain_uses_goma) {\n assert(toolchain_cc_wrapper == \"\",\n \"Goma and cc_wrapper can't be used together.\")\n compiler_prefix = \"$goma_dir/gomacc \"\n } else if (toolchain_cc_wrapper != \"\") {\n compiler_prefix = toolchain_cc_wrapper + \" \"\n } else {\n compiler_prefix = \"\"\n }\n\n cc = compiler_prefix + invoker.cc\n cxx = compiler_prefix + invoker.cxx\n ar = invoker.ar\n ld = invoker.ld\n if (defined(invoker.readelf)) {\n readelf = invoker.readelf\n } else {\n readelf = \"readelf\"\n }\n if (defined(invoker.nm)) {\n nm = invoker.nm\n } else {\n nm = \"nm\"\n }\n\n if (defined(invoker.shlib_extension)) {\n default_shlib_extension = invoker.shlib_extension\n } else {\n default_shlib_extension = shlib_extension\n }\n\n if (defined(invoker.executable_extension)) {\n default_executable_extension = invoker.executable_extension\n } else {\n default_executable_extension = \"\"\n }\n\n # Bring these into our scope for string interpolation with default values.\n if (defined(invoker.libs_section_prefix)) {\n libs_section_prefix = invoker.libs_section_prefix\n } else {\n libs_section_prefix = \"\"\n }\n\n if (defined(invoker.libs_section_postfix)) {\n libs_section_postfix = invoker.libs_section_postfix\n } else {\n libs_section_postfix = \"\"\n }\n\n if (defined(invoker.solink_libs_section_prefix)) {\n solink_libs_section_prefix = invoker.solink_libs_section_prefix\n } else {\n solink_libs_section_prefix = \"\"\n }\n\n if (defined(invoker.solink_libs_section_postfix)) {\n solink_libs_section_postfix = invoker.solink_libs_section_postfix\n } else {\n solink_libs_section_postfix = \"\"\n }\n\n if (defined(invoker.extra_cflags) && invoker.extra_cflags != \"\") {\n extra_cflags = \" \" + invoker.extra_cflags\n } else {\n extra_cflags = \"\"\n }\n\n if (defined(invoker.extra_cppflags) && invoker.extra_cppflags != \"\") {\n extra_cppflags = \" \" + invoker.extra_cppflags\n } else {\n extra_cppflags = \"\"\n }\n\n if (defined(invoker.extra_cxxflags) && invoker.extra_cxxflags != \"\") {\n extra_cxxflags = \" \" + invoker.extra_cxxflags\n } else {\n extra_cxxflags = \"\"\n }\n\n if (defined(invoker.extra_ldflags) && invoker.extra_ldflags != \"\") {\n extra_ldflags = \" \" + invoker.extra_ldflags\n } else {\n extra_ldflags = \"\"\n }\n\n # These library switches can apply to all tools below.\n lib_switch = \"-l\"\n lib_dir_switch = \"-L\"\n\n # Object files go in this directory.\n object_subdir = \"{{target_out_dir}}/{{label_name}}\"\n\n tool(\"cc\") {\n depfile = \"{{output}}.d\"\n command = \"$cc -MMD -MF $depfile ${rebuild_string}{{defines}} {{include_dirs}} {{cflags}} {{cflags_c}}${extra_cppflags}${extra_cflags} -c {{source}} -o {{output}}\"\n depsformat = \"gcc\"\n description = \"CC {{output}}\"\n outputs = [\n # The whitelist file is also an output, but ninja does not\n # currently support multiple outputs for tool(\"cc\").\n \"$object_subdir/{{source_name_part}}.o\",\n ]\n if (enable_resource_whitelist_generation) {\n compile_wrapper =\n rebase_path(\"//build/toolchain/gcc_compile_wrapper.py\",\n root_build_dir)\n command = \"$python_path \\\"$compile_wrapper\\\" --resource-whitelist=\\\"{{output}}.whitelist\\\" $command\"\n }\n }\n\n tool(\"cxx\") {\n depfile = \"{{output}}.d\"\n command = \"$cxx -MMD -MF $depfile ${rebuild_string}{{defines}} {{include_dirs}} {{cflags}} {{cflags_cc}}${extra_cppflags}${extra_cxxflags} -c {{source}} -o {{output}}\"\n depsformat = \"gcc\"\n description = \"CXX {{output}}\"\n outputs = [\n # The whitelist file is also an output, but ninja does not\n # currently support multiple outputs for tool(\"cxx\").\n \"$object_subdir/{{source_name_part}}.o\",\n ]\n if (enable_resource_whitelist_generation) {\n compile_wrapper =\n rebase_path(\"//build/toolchain/gcc_compile_wrapper.py\",\n root_build_dir)\n command = \"$python_path \\\"$compile_wrapper\\\" --resource-whitelist=\\\"{{output}}.whitelist\\\" $command\"\n }\n }\n\n tool(\"asm\") {\n # For GCC we can just use the C compiler to compile assembly.\n depfile = \"{{output}}.d\"\n command = \"$cc -MMD -MF $depfile ${rebuild_string}{{defines}} {{include_dirs}} {{asmflags}} -c {{source}} -o {{output}}\"\n depsformat = \"gcc\"\n description = \"ASM {{output}}\"\n outputs = [\n \"$object_subdir/{{source_name_part}}.o\",\n ]\n }\n\n tool(\"alink\") {\n rspfile = \"{{output}}.rsp\"\n whitelist_flag = \" \"\n if (enable_resource_whitelist_generation) {\n whitelist_flag = \" --resource-whitelist=\\\"{{output}}.whitelist\\\"\"\n }\n\n # This needs a Python script to avoid using simple sh features in this\n # command, in case the host does not use a POSIX shell (e.g. compiling\n # POSIX-like toolchains such as NaCl on Windows).\n ar_wrapper =\n rebase_path(\"//build/toolchain/gcc_ar_wrapper.py\", root_build_dir)\n command = \"$python_path \\\"$ar_wrapper\\\"$whitelist_flag --output={{output}} --ar=\\\"$ar\\\" {{arflags}} rcsD @\\\"$rspfile\\\"\"\n description = \"AR {{output}}\"\n rspfile_content = \"{{inputs}}\"\n outputs = [\n \"{{output_dir}}/{{target_output_name}}{{output_extension}}\",\n ]\n\n # Shared libraries go in the target out directory by default so we can\n # generate different targets with the same name and not have them collide.\n default_output_dir = \"{{target_out_dir}}\"\n default_output_extension = \".a\"\n output_prefix = \"lib\"\n }\n\n tool(\"solink\") {\n soname = \"{{target_output_name}}{{output_extension}}\" # e.g. \"libfoo.so\".\n sofile = \"{{output_dir}}/$soname\" # Possibly including toolchain dir.\n rspfile = sofile + \".rsp\"\n pool = \"//build/toolchain:link_pool($default_toolchain)\"\n whitelist_flag = \" \"\n if (enable_resource_whitelist_generation) {\n whitelist_file = \"$sofile.whitelist\"\n whitelist_flag = \" --resource-whitelist=\\\"$whitelist_file\\\"\"\n }\n\n if (defined(invoker.strip)) {\n unstripped_sofile = \"{{root_out_dir}}/lib.unstripped/$soname\"\n } else {\n unstripped_sofile = sofile\n }\n\n # These variables are not built into GN but are helpers that\n # implement (1) linking to produce a .so, (2) extracting the symbols\n # from that file (3) if the extracted list differs from the existing\n # .TOC file, overwrite it, otherwise, don't change it.\n tocfile = sofile + \".TOC\"\n\n link_command = \"$ld -shared {{ldflags}}${extra_ldflags} -o \\\"$unstripped_sofile\\\" -Wl,-soname=\\\"$soname\\\" @\\\"$rspfile\\\"\"\n\n assert(defined(readelf), \"to solink you must have a readelf\")\n assert(defined(nm), \"to solink you must have an nm\")\n strip_switch = \"\"\n if (defined(invoker.strip)) {\n strip_switch = \"--strip=${invoker.strip}\"\n }\n\n # This needs a Python script to avoid using a complex shell command\n # requiring sh control structures, pipelines, and POSIX utilities.\n # The host might not have a POSIX shell and utilities (e.g. Windows).\n solink_wrapper = rebase_path(\"//build/toolchain/gcc_solink_wrapper.py\")\n command = \"$python_path \\\"$solink_wrapper\\\" --readelf=\\\"$readelf\\\" --nm=\\\"$nm\\\" $strip_switch --sofile=\\\"$unstripped_sofile\\\" --tocfile=\\\"$tocfile\\\" --output=\\\"$sofile\\\"$whitelist_flag -- $link_command\"\n\n rspfile_content = \"-Wl,--whole-archive {{inputs}} {{solibs}} -Wl,--no-whole-archive $solink_libs_section_prefix {{libs}} $solink_libs_section_postfix\"\n\n description = \"SOLINK $sofile\"\n\n # Use this for {{output_extension}} expansions unless a target manually\n # overrides it (in which case {{output_extension}} will be what the target\n # specifies).\n default_output_extension = default_shlib_extension\n\n default_output_dir = \"{{root_out_dir}}\"\n if (shlib_subdir != \".\") {\n default_output_dir += \"/$shlib_subdir\"\n }\n\n output_prefix = \"lib\"\n\n # Since the above commands only updates the .TOC file when it changes, ask\n # Ninja to check if the timestamp actually changed to know if downstream\n # dependencies should be recompiled.\n restat = true\n\n # Tell GN about the output files. It will link to the sofile but use the\n # tocfile for dependency management.\n outputs = [\n sofile,\n tocfile,\n ]\n if (enable_resource_whitelist_generation) {\n outputs += [ whitelist_file ]\n }\n if (sofile != unstripped_sofile) {\n outputs += [ unstripped_sofile ]\n }\n link_output = sofile\n depend_output = tocfile\n }\n\n tool(\"solink_module\") {\n soname = \"{{target_output_name}}{{output_extension}}\" # e.g. \"libfoo.so\".\n sofile = \"{{output_dir}}/$soname\"\n rspfile = sofile + \".rsp\"\n pool = \"//build/toolchain:link_pool($default_toolchain)\"\n\n if (defined(invoker.strip)) {\n unstripped_sofile = \"{{root_out_dir}}/lib.unstripped/$soname\"\n } else {\n unstripped_sofile = sofile\n }\n\n command = \"$ld -shared {{ldflags}}${extra_ldflags} -o \\\"$unstripped_sofile\\\" -Wl,-soname=\\\"$soname\\\" @\\\"$rspfile\\\"\"\n\n if (defined(invoker.strip)) {\n strip_command = \"${invoker.strip} --strip-unneeded -o \\\"$sofile\\\" \\\"$unstripped_sofile\\\"\"\n command += \" && \" + strip_command\n }\n rspfile_content = \"-Wl,--whole-archive {{inputs}} {{solibs}} -Wl,--no-whole-archive $solink_libs_section_prefix {{libs}} $solink_libs_section_postfix\"\n\n description = \"SOLINK_MODULE $sofile\"\n\n # Use this for {{output_extension}} expansions unless a target manually\n # overrides it (in which case {{output_extension}} will be what the target\n # specifies).\n if (defined(invoker.loadable_module_extension)) {\n default_output_extension = invoker.loadable_module_extension\n } else {\n default_output_extension = default_shlib_extension\n }\n\n default_output_dir = \"{{root_out_dir}}\"\n if (shlib_subdir != \".\") {\n default_output_dir += \"/$shlib_subdir\"\n }\n\n output_prefix = \"lib\"\n\n outputs = [\n sofile,\n ]\n if (sofile != unstripped_sofile) {\n outputs += [ unstripped_sofile ]\n }\n }\n\n tool(\"link\") {\n exename = \"{{target_output_name}}{{output_extension}}\"\n outfile = \"{{output_dir}}/$exename\"\n rspfile = \"$outfile.rsp\"\n unstripped_outfile = outfile\n pool = \"//build/toolchain:link_pool($default_toolchain)\"\n\n # Use this for {{output_extension}} expansions unless a target manually\n # overrides it (in which case {{output_extension}} will be what the target\n # specifies).\n default_output_extension = default_executable_extension\n\n default_output_dir = \"{{root_out_dir}}\"\n\n if (defined(invoker.strip)) {\n unstripped_outfile = \"{{root_out_dir}}/exe.unstripped/$exename\"\n }\n\n command = \"$ld {{ldflags}}${extra_ldflags} -o \\\"$unstripped_outfile\\\" -Wl,--start-group @\\\"$rspfile\\\" {{solibs}} -Wl,--end-group $libs_section_prefix {{libs}} $libs_section_postfix\"\n if (defined(invoker.strip)) {\n link_wrapper =\n rebase_path(\"//build/toolchain/gcc_link_wrapper.py\", root_build_dir)\n command = \"$python_path \\\"$link_wrapper\\\" --strip=\\\"${invoker.strip}\\\" --unstripped-file=\\\"$unstripped_outfile\\\" --output=\\\"$outfile\\\" -- $command\"\n }\n description = \"LINK $outfile\"\n rspfile_content = \"{{inputs}}\"\n outputs = [\n outfile,\n ]\n if (outfile != unstripped_outfile) {\n outputs += [ unstripped_outfile ]\n }\n if (defined(invoker.link_outputs)) {\n outputs += invoker.link_outputs\n }\n }\n\n # These two are really entirely generic, but have to be repeated in\n # each toolchain because GN doesn't allow a template to be used here.\n # See //build/toolchain/toolchain.gni for details.\n tool(\"stamp\") {\n command = stamp_command\n description = stamp_description\n }\n tool(\"copy\") {\n command = copy_command\n description = copy_description\n }\n\n forward_variables_from(invoker, [ \"deps\" ])\n }\n}\n\n# This is a shorthand for gcc_toolchain instances based on the Chromium-built\n# version of Clang. Only the toolchain_cpu and toolchain_os variables need to\n# be specified by the invoker, and optionally toolprefix if it's a\n# cross-compile case. Note that for a cross-compile case this toolchain\n# requires a config to pass the appropriate -target option, or else it will\n# actually just be doing a native compile. The invoker can optionally override\n# use_gold too.\ntemplate(\"clang_toolchain\") {\n if (defined(invoker.toolprefix)) {\n toolprefix = invoker.toolprefix\n } else {\n toolprefix = \"\"\n }\n\n gcc_toolchain(target_name) {\n prefix = rebase_path(\"$clang_base_path/bin\", root_build_dir)\n cc = \"$prefix/clang\"\n cxx = \"$prefix/clang++\"\n ld = cxx\n\n readelf = \"${toolprefix}readelf\"\n ar = \"${toolprefix}ar\"\n nm = \"${toolprefix}nm\"\n\n forward_variables_from(invoker, [ \"strip\" ])\n\n toolchain_args = {\n if (defined(invoker.toolchain_args)) {\n forward_variables_from(invoker.toolchain_args, \"*\")\n }\n is_clang = true\n }\n }\n}\n" }, { "path": "src/test/resources/samples/langs/GN/icu.gn", "content": "# Copyright 2016 The Chromium Authors. All rights reserved.\n# Use of this source code is governed by a BSD-style license that can be\n# found in the LICENSE file.\n\nimport(\"//build/config/linux/pkg_config.gni\")\nimport(\"//build/shim_headers.gni\")\n\ngroup(\"icu\") {\n public_deps = [\n \":icui18n\",\n \":icuuc\",\n ]\n}\n\nconfig(\"icu_config\") {\n defines = [\n \"USING_SYSTEM_ICU=1\",\n \"ICU_UTIL_DATA_IMPL=ICU_UTIL_DATA_STATIC\",\n ]\n}\n\npkg_config(\"system_icui18n\") {\n packages = [ \"icu-i18n\" ]\n}\n\npkg_config(\"system_icuuc\") {\n packages = [ \"icu-uc\" ]\n}\n\nsource_set(\"icui18n\") {\n deps = [\n \":icui18n_shim\",\n ]\n public_configs = [\n \":icu_config\",\n \":system_icui18n\",\n ]\n}\n\nsource_set(\"icuuc\") {\n deps = [\n \":icuuc_shim\",\n ]\n public_configs = [\n \":icu_config\",\n \":system_icuuc\",\n ]\n}\n\nshim_headers(\"icui18n_shim\") {\n root_path = \"source/i18n\"\n headers = [\n # This list can easily be updated using the command below:\n # find third_party/icu/source/i18n/unicode \\\n # -iname '*.h' -printf '\"%p\",\\n' | \\\n # sed -e 's|third_party/icu/i18n/common/||' | sort -u\n \"unicode/alphaindex.h\",\n \"unicode/basictz.h\",\n \"unicode/calendar.h\",\n \"unicode/choicfmt.h\",\n \"unicode/coleitr.h\",\n \"unicode/coll.h\",\n \"unicode/compactdecimalformat.h\",\n \"unicode/curramt.h\",\n \"unicode/currpinf.h\",\n \"unicode/currunit.h\",\n \"unicode/datefmt.h\",\n \"unicode/dcfmtsym.h\",\n \"unicode/decimfmt.h\",\n \"unicode/dtfmtsym.h\",\n \"unicode/dtitvfmt.h\",\n \"unicode/dtitvinf.h\",\n \"unicode/dtptngen.h\",\n \"unicode/dtrule.h\",\n \"unicode/fieldpos.h\",\n \"unicode/fmtable.h\",\n \"unicode/format.h\",\n \"unicode/fpositer.h\",\n \"unicode/gender.h\",\n \"unicode/gregocal.h\",\n \"unicode/locdspnm.h\",\n \"unicode/measfmt.h\",\n \"unicode/measunit.h\",\n \"unicode/measure.h\",\n \"unicode/msgfmt.h\",\n \"unicode/numfmt.h\",\n \"unicode/numsys.h\",\n \"unicode/plurfmt.h\",\n \"unicode/plurrule.h\",\n \"unicode/rbnf.h\",\n \"unicode/rbtz.h\",\n \"unicode/regex.h\",\n \"unicode/region.h\",\n \"unicode/reldatefmt.h\",\n \"unicode/scientificnumberformatter.h\",\n \"unicode/search.h\",\n \"unicode/selfmt.h\",\n \"unicode/simpletz.h\",\n \"unicode/smpdtfmt.h\",\n \"unicode/sortkey.h\",\n \"unicode/stsearch.h\",\n \"unicode/tblcoll.h\",\n \"unicode/timezone.h\",\n \"unicode/tmunit.h\",\n \"unicode/tmutamt.h\",\n \"unicode/tmutfmt.h\",\n \"unicode/translit.h\",\n \"unicode/tzfmt.h\",\n \"unicode/tznames.h\",\n \"unicode/tzrule.h\",\n \"unicode/tztrans.h\",\n \"unicode/ucal.h\",\n \"unicode/ucol.h\",\n \"unicode/ucoleitr.h\",\n \"unicode/ucsdet.h\",\n \"unicode/ucurr.h\",\n \"unicode/udat.h\",\n \"unicode/udateintervalformat.h\",\n \"unicode/udatpg.h\",\n \"unicode/udisplaycontext.h\",\n \"unicode/ufieldpositer.h\",\n \"unicode/uformattable.h\",\n \"unicode/ugender.h\",\n \"unicode/uldnames.h\",\n \"unicode/ulocdata.h\",\n \"unicode/umsg.h\",\n \"unicode/unirepl.h\",\n \"unicode/unum.h\",\n \"unicode/unumsys.h\",\n \"unicode/upluralrules.h\",\n \"unicode/uregex.h\",\n \"unicode/uregion.h\",\n \"unicode/usearch.h\",\n \"unicode/uspoof.h\",\n \"unicode/utmscale.h\",\n \"unicode/utrans.h\",\n \"unicode/vtzone.h\",\n ]\n}\n\nshim_headers(\"icuuc_shim\") {\n root_path = \"source/common\"\n headers = [\n # This list can easily be updated using the command below:\n # find third_party/icu/source/common/unicode \\\n # -iname '*.h' -printf '\"%p\",\\n' | \\\n # sed -e 's|third_party/icu/source/common/||' | sort -u\n \"unicode/appendable.h\",\n \"unicode/brkiter.h\",\n \"unicode/bytestream.h\",\n \"unicode/bytestrie.h\",\n \"unicode/bytestriebuilder.h\",\n \"unicode/caniter.h\",\n \"unicode/chariter.h\",\n \"unicode/dbbi.h\",\n \"unicode/docmain.h\",\n \"unicode/dtintrv.h\",\n \"unicode/enumset.h\",\n \"unicode/errorcode.h\",\n \"unicode/filteredbrk.h\",\n \"unicode/icudataver.h\",\n \"unicode/icuplug.h\",\n \"unicode/idna.h\",\n \"unicode/listformatter.h\",\n \"unicode/localpointer.h\",\n \"unicode/locid.h\",\n \"unicode/messagepattern.h\",\n \"unicode/normalizer2.h\",\n \"unicode/normlzr.h\",\n \"unicode/parseerr.h\",\n \"unicode/parsepos.h\",\n \"unicode/platform.h\",\n \"unicode/ptypes.h\",\n \"unicode/putil.h\",\n \"unicode/rbbi.h\",\n \"unicode/rep.h\",\n \"unicode/resbund.h\",\n \"unicode/schriter.h\",\n \"unicode/std_string.h\",\n \"unicode/strenum.h\",\n \"unicode/stringpiece.h\",\n \"unicode/stringtriebuilder.h\",\n \"unicode/symtable.h\",\n \"unicode/ubidi.h\",\n \"unicode/ubrk.h\",\n \"unicode/ucasemap.h\",\n \"unicode/ucat.h\",\n \"unicode/uchar.h\",\n \"unicode/ucharstrie.h\",\n \"unicode/ucharstriebuilder.h\",\n \"unicode/uchriter.h\",\n \"unicode/uclean.h\",\n \"unicode/ucnv.h\",\n \"unicode/ucnv_cb.h\",\n \"unicode/ucnv_err.h\",\n \"unicode/ucnvsel.h\",\n \"unicode/uconfig.h\",\n \"unicode/udata.h\",\n \"unicode/uenum.h\",\n \"unicode/uidna.h\",\n \"unicode/uiter.h\",\n \"unicode/ulistformatter.h\",\n \"unicode/uloc.h\",\n \"unicode/umachine.h\",\n \"unicode/umisc.h\",\n \"unicode/unifilt.h\",\n \"unicode/unifunct.h\",\n \"unicode/unimatch.h\",\n \"unicode/uniset.h\",\n \"unicode/unistr.h\",\n \"unicode/unorm.h\",\n \"unicode/unorm2.h\",\n \"unicode/uobject.h\",\n \"unicode/urename.h\",\n \"unicode/urep.h\",\n \"unicode/ures.h\",\n \"unicode/uscript.h\",\n \"unicode/uset.h\",\n \"unicode/usetiter.h\",\n \"unicode/ushape.h\",\n \"unicode/usprep.h\",\n \"unicode/ustring.h\",\n \"unicode/ustringtrie.h\",\n \"unicode/utext.h\",\n \"unicode/utf.h\",\n \"unicode/utf16.h\",\n \"unicode/utf32.h\",\n \"unicode/utf8.h\",\n \"unicode/utf_old.h\",\n \"unicode/utrace.h\",\n \"unicode/utypes.h\",\n \"unicode/uvernum.h\",\n \"unicode/uversion.h\",\n ]\n}\n" }, { "path": "src/test/resources/samples/langs/GN/internal_rules.gni", "content": "# Copyright 2014 The Chromium Authors. All rights reserved.\n# Use of this source code is governed by a BSD-style license that can be\n# found in the LICENSE file.\n\n# Do not add any imports to non-//build directories here.\n# Some projects (e.g. V8) do not have non-build directories DEPS'ed in.\nimport(\"//build_overrides/build.gni\")\nimport(\"//build/config/android/config.gni\")\nimport(\"//build/config/dcheck_always_on.gni\")\nimport(\"//build/config/sanitizers/sanitizers.gni\")\n\nassert(is_android)\n\n# These identify targets that have .build_config files (except for android_apk,\n# java_binary, resource_rewriter, since we never need to depend on these).\n_java_target_whitelist = [\n \"*:*_java\",\n \"*:*_javalib\",\n \"*:*_java_*\", # e.g. java_test_support\n \"*:java\",\n \"*:junit\",\n \"*:junit_*\",\n \"*:*_junit_*\",\n \"*:*javatests\",\n \"*:*_assets\",\n \"*android*:assets\",\n \"*:*_apk_*resources\",\n \"*android*:resources\",\n \"*:*_resources\",\n \"*:*_grd\",\n \"*:*locale_paks\",\n\n # TODO(agrieve): Rename targets below to match above patterns.\n \"*android_webview/glue:glue\",\n \"//build/android/rezip:rezip\",\n \"//chrome/test/android/cast_emulator:cast_emulator\",\n]\n\n# Targets that match the whitelist but are not actually java targets.\n_java_target_blacklist = [\n \"//chrome:packed_resources\",\n \"//remoting/android:remoting_android_raw_resources\",\n \"*:*_unpack_aar\",\n]\n\n# Write the target's .build_config file. This is a json file that contains a\n# dictionary of information about how to build this target (things that\n# require knowledge about this target's dependencies and cannot be calculated\n# at gn-time). There is a special syntax to add a value in that dictionary to\n# an action/action_foreachs args:\n# --python-arg=@FileArg($rebased_build_config_path:key0:key1)\n# At runtime, such an arg will be replaced by the value in the build_config.\n# See build/android/gyp/write_build_config.py and\n# build/android/gyp/util/build_utils.py:ExpandFileArgs\ntemplate(\"write_build_config\") {\n type = invoker.type\n _is_prebuilt_binary =\n defined(invoker.is_prebuilt_binary) && invoker.is_prebuilt_binary\n\n # Don't need to enforce naming scheme for these targets since we never\n # consider them in dependency chains.\n if (!_is_prebuilt_binary && type != \"android_apk\" && type != \"java_binary\" &&\n type != \"resource_rewriter\") {\n set_sources_assignment_filter(_java_target_whitelist)\n _parent_invoker = invoker.invoker\n _target_label =\n get_label_info(\":${_parent_invoker.target_name}\", \"label_no_toolchain\")\n sources = [\n _target_label,\n ]\n if (sources != []) {\n set_sources_assignment_filter(_java_target_blacklist)\n sources = []\n sources = [\n _target_label,\n ]\n if (sources != []) {\n assert(false, \"Invalid java target name: $_target_label\")\n }\n }\n sources = []\n }\n\n action(target_name) {\n set_sources_assignment_filter([])\n build_config = invoker.build_config\n\n assert(type == \"android_apk\" || type == \"java_library\" ||\n type == \"android_resources\" || type == \"deps_dex\" ||\n type == \"android_assets\" || type == \"resource_rewriter\" ||\n type == \"java_binary\" || type == \"group\" || type == \"java_prebuilt\")\n\n forward_variables_from(invoker,\n [\n \"deps\",\n \"testonly\",\n ])\n if (!defined(deps)) {\n deps = []\n }\n\n script = \"//build/android/gyp/write_build_config.py\"\n depfile = \"$target_gen_dir/$target_name.d\"\n inputs = []\n\n _deps_configs = []\n if (defined(invoker.possible_config_deps)) {\n foreach(_possible_dep, invoker.possible_config_deps) {\n set_sources_assignment_filter(_java_target_whitelist)\n _target_label = get_label_info(_possible_dep, \"label_no_toolchain\")\n sources = [\n _target_label,\n ]\n if (sources == []) {\n set_sources_assignment_filter(_java_target_blacklist)\n sources = []\n sources = [\n _target_label,\n ]\n if (sources != []) {\n deps += [ \"${_target_label}__build_config\" ]\n _dep_gen_dir = get_label_info(_possible_dep, \"target_gen_dir\")\n _dep_name = get_label_info(_possible_dep, \"name\")\n _deps_configs += [ \"$_dep_gen_dir/$_dep_name.build_config\" ]\n }\n }\n sources = []\n }\n set_sources_assignment_filter([])\n }\n _rebased_deps_configs = rebase_path(_deps_configs, root_build_dir)\n\n outputs = [\n build_config,\n ]\n\n args = [\n \"--type\",\n type,\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n \"--deps-configs=$_rebased_deps_configs\",\n \"--build-config\",\n rebase_path(build_config, root_build_dir),\n ]\n\n is_java = type == \"java_library\" || type == \"java_binary\" ||\n type == \"java_prebuilt\"\n is_apk = type == \"android_apk\"\n is_android_assets = type == \"android_assets\"\n is_android_resources = type == \"android_resources\"\n is_deps_dex = type == \"deps_dex\"\n is_group = type == \"group\"\n\n supports_android = is_apk || is_android_assets || is_android_resources ||\n is_deps_dex || is_group ||\n (is_java && defined(invoker.supports_android) &&\n invoker.supports_android)\n requires_android =\n is_apk || is_android_assets || is_android_resources || is_deps_dex ||\n (is_java && defined(invoker.requires_android) &&\n invoker.requires_android)\n\n assert(!requires_android || supports_android,\n \"requires_android requires\" + \" supports_android\")\n\n # Mark these variables as used.\n assert(is_java || true)\n assert(is_apk || true)\n assert(is_android_resources || true)\n assert(is_deps_dex || true)\n assert(is_group || true)\n\n if (is_java || is_apk) {\n args += [\n \"--jar-path\",\n rebase_path(invoker.jar_path, root_build_dir),\n ]\n }\n\n if (is_apk || is_deps_dex || (is_java && supports_android)) {\n args += [\n \"--dex-path\",\n rebase_path(invoker.dex_path, root_build_dir),\n ]\n }\n if (supports_android) {\n args += [ \"--supports-android\" ]\n }\n if (requires_android) {\n args += [ \"--requires-android\" ]\n }\n if (defined(invoker.bypass_platform_checks) &&\n invoker.bypass_platform_checks) {\n args += [ \"--bypass-platform-checks\" ]\n }\n\n if (defined(invoker.apk_under_test)) {\n deps += [ \"${invoker.apk_under_test}__build_config\" ]\n apk_under_test_gen_dir =\n get_label_info(invoker.apk_under_test, \"target_gen_dir\")\n apk_under_test_name = get_label_info(invoker.apk_under_test, \"name\")\n apk_under_test_config =\n \"$apk_under_test_gen_dir/$apk_under_test_name.build_config\"\n args += [\n \"--tested-apk-config\",\n rebase_path(apk_under_test_config, root_build_dir),\n ]\n }\n\n if (is_android_assets) {\n if (defined(invoker.asset_sources)) {\n _rebased_asset_sources =\n rebase_path(invoker.asset_sources, root_build_dir)\n args += [ \"--asset-sources=$_rebased_asset_sources\" ]\n }\n if (defined(invoker.asset_renaming_sources)) {\n _rebased_asset_renaming_sources =\n rebase_path(invoker.asset_renaming_sources, root_build_dir)\n args += [ \"--asset-renaming-sources=$_rebased_asset_renaming_sources\" ]\n\n # These are zip paths, so no need to rebase.\n args += [ \"--asset-renaming-destinations=${invoker.asset_renaming_destinations}\" ]\n }\n if (defined(invoker.disable_compression) && invoker.disable_compression) {\n args += [ \"--disable-asset-compression\" ]\n }\n }\n\n if (is_android_resources || is_apk) {\n assert(defined(invoker.resources_zip))\n args += [\n \"--resources-zip\",\n rebase_path(invoker.resources_zip, root_build_dir),\n ]\n if (defined(invoker.android_manifest)) {\n inputs += [ invoker.android_manifest ]\n args += [\n \"--android-manifest\",\n rebase_path(invoker.android_manifest, root_build_dir),\n ]\n } else {\n assert(!is_apk, \"apk build configs require an android_manifest\")\n }\n if (defined(invoker.custom_package)) {\n args += [\n \"--package-name\",\n invoker.custom_package,\n ]\n }\n if (defined(invoker.r_text)) {\n args += [\n \"--r-text\",\n rebase_path(invoker.r_text, root_build_dir),\n ]\n }\n }\n\n if (is_android_resources && defined(invoker.resource_dirs)) {\n resource_dirs = rebase_path(invoker.resource_dirs, root_build_dir)\n args += [ \"--resource-dirs=$resource_dirs\" ]\n }\n\n if (is_apk) {\n if (defined(invoker.shared_libraries_runtime_deps_file)) {\n # Don't list shared_libraries_runtime_deps_file as an input in order to\n # avoid having to depend on the runtime_deps target. See comment in\n # rules.gni for why we do this.\n args += [\n \"--shared-libraries-runtime-deps\",\n rebase_path(invoker.shared_libraries_runtime_deps_file,\n root_build_dir),\n ]\n }\n\n if (defined(invoker.secondary_abi_shared_libraries_runtime_deps_file)) {\n # Don't list secondary_abi_shared_libraries_runtime_deps_file as an\n # input in order to avoid having to depend on the runtime_deps target.\n # See comment in rules.gni for why we do this.\n args += [\n \"--secondary-abi-shared-libraries-runtime-deps\",\n rebase_path(invoker.secondary_abi_shared_libraries_runtime_deps_file,\n root_build_dir),\n ]\n }\n\n if (defined(invoker.proguard_enabled) && invoker.proguard_enabled) {\n args += [\n \"--proguard-enabled\",\n \"--proguard-info\",\n rebase_path(invoker.proguard_info, root_build_dir),\n ]\n }\n\n if (defined(invoker.apk_path)) {\n _rebased_apk_path = rebase_path(invoker.apk_path, root_build_dir)\n _rebased_incremental_apk_path =\n rebase_path(invoker.incremental_apk_path, root_build_dir)\n _rebased_incremental_install_script_path =\n rebase_path(invoker.incremental_install_script_path, root_build_dir)\n args += [ \"--apk-path=$_rebased_apk_path\" ]\n args += [ \"--incremental-apk-path=$_rebased_incremental_apk_path\" ]\n args += [ \"--incremental-install-script-path=$_rebased_incremental_install_script_path\" ]\n }\n }\n\n if (defined(invoker.java_sources_file)) {\n args += [\n \"--java-sources-file\",\n rebase_path(invoker.java_sources_file, root_build_dir),\n ]\n }\n if (defined(invoker.srcjar)) {\n args += [\n \"--srcjar\",\n rebase_path(invoker.srcjar, root_build_dir),\n ]\n }\n if (defined(invoker.bundled_srcjars)) {\n _rebased_bundled_srcjars =\n rebase_path(invoker.bundled_srcjars, root_build_dir)\n args += [ \"--bundled-srcjars=$_rebased_bundled_srcjars\" ]\n }\n if (defined(invoker.input_jars_paths)) {\n _rebased_input_jars_paths =\n rebase_path(invoker.input_jars_paths, root_build_dir)\n args += [ \"--extra-classpath-jars=$_rebased_input_jars_paths\" ]\n }\n if (defined(invoker.proguard_configs)) {\n _rebased_proguard_configs =\n rebase_path(invoker.proguard_configs, root_build_dir)\n args += [ \"--proguard-configs=$_rebased_proguard_configs\" ]\n }\n if (defined(invoker.gradle_treat_as_prebuilt) &&\n invoker.gradle_treat_as_prebuilt) {\n args += [ \"--gradle-treat-as-prebuilt\" ]\n }\n if (defined(invoker.main_class)) {\n args += [\n \"--main-class\",\n invoker.main_class,\n ]\n }\n if (current_toolchain != default_toolchain) {\n # This has to be a built-time error rather than a GN assert because many\n # packages have a mix of java and non-java targets. For example, the\n # following would fail even though nothing depends on :bar(//baz):\n #\n # shared_library(\"foo\") {\n # }\n #\n # android_library(\"bar\") {\n # deps = [ \":foo(//baz)\" ]\n # assert(current_toolchain == default_toolchain)\n # }\n _msg = [\n \"Tried to build an Android target in a non-default toolchain.\",\n \"target: \" + get_label_info(\":$target_name\", \"label_with_toolchain\"),\n \"default_toolchain: $default_toolchain\",\n ]\n args += [ \"--fail=$_msg\" ]\n }\n }\n}\n\ntemplate(\"copy_ex\") {\n set_sources_assignment_filter([])\n action(target_name) {\n forward_variables_from(invoker,\n [\n \"data\",\n \"deps\",\n \"inputs\",\n \"sources\",\n \"testonly\",\n \"visibility\",\n ])\n if (!defined(sources)) {\n sources = []\n }\n script = \"//build/android/gyp/copy_ex.py\"\n depfile = \"$target_gen_dir/$target_name.d\"\n\n _stamp_file = \"$target_gen_dir/$target_name.stamp\"\n outputs = [\n _stamp_file,\n ]\n\n args = [\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n \"--stamp\",\n rebase_path(_stamp_file, root_build_dir),\n \"--dest\",\n rebase_path(invoker.dest, root_build_dir),\n ]\n rebased_sources = rebase_path(sources, root_build_dir)\n args += [ \"--files=$rebased_sources\" ]\n\n if (defined(invoker.clear_dir) && invoker.clear_dir) {\n args += [ \"--clear\" ]\n }\n\n if (defined(invoker.args)) {\n args += invoker.args\n }\n\n if (defined(invoker.renaming_sources) &&\n defined(invoker.renaming_destinations)) {\n sources += invoker.renaming_sources\n rebased_renaming_sources =\n rebase_path(invoker.renaming_sources, root_build_dir)\n args += [ \"--renaming-sources=$rebased_renaming_sources\" ]\n\n renaming_destinations = invoker.renaming_destinations\n args += [ \"--renaming-destinations=$renaming_destinations\" ]\n }\n }\n}\n\n# Generates a script in the build bin directory which runs the test\n# target using the test runner script in build/android/test_runner.py.\ntemplate(\"test_runner_script\") {\n testonly = true\n _test_name = invoker.test_name\n _test_type = invoker.test_type\n _incremental_install =\n defined(invoker.incremental_install) && invoker.incremental_install\n\n _runtime_deps =\n !defined(invoker.ignore_all_data_deps) || !invoker.ignore_all_data_deps\n\n if (_runtime_deps) {\n # This runtime_deps file is used at runtime and thus cannot go in\n # target_gen_dir.\n _target_dir_name = get_label_info(\":$target_name\", \"dir\")\n _runtime_deps_file =\n \"$root_out_dir/gen.runtime/$_target_dir_name/$target_name.runtime_deps\"\n _runtime_deps_target = \"${target_name}__write_deps\"\n group(_runtime_deps_target) {\n forward_variables_from(invoker,\n [\n \"data\",\n \"data_deps\",\n \"deps\",\n \"public_deps\",\n ])\n write_runtime_deps = _runtime_deps_file\n }\n }\n\n action(target_name) {\n forward_variables_from(invoker,\n [\n \"data_deps\",\n \"deps\",\n ])\n if (!defined(deps)) {\n deps = []\n }\n if (!defined(data_deps)) {\n data_deps = []\n }\n\n script = \"//build/android/gyp/create_test_runner_script.py\"\n depfile = \"$target_gen_dir/$target_name.d\"\n\n data_deps += [ \"//build/android:test_runner_py\" ]\n data = []\n\n test_runner_args = [\n _test_type,\n \"--output-directory\",\n rebase_path(root_build_dir, root_build_dir),\n ]\n\n if (_runtime_deps) {\n deps += [ \":$_runtime_deps_target\" ]\n data += [ _runtime_deps_file ]\n test_runner_args += [\n \"--runtime-deps-path\",\n rebase_path(_runtime_deps_file, root_build_dir),\n ]\n }\n\n # apk_target is not used for native executable tests\n # (e.g. breakpad_unittests).\n if (defined(invoker.apk_target)) {\n assert(!defined(invoker.executable_dist_dir))\n deps += [ \"${invoker.apk_target}__build_config\" ]\n _apk_build_config =\n get_label_info(invoker.apk_target, \"target_gen_dir\") + \"/\" +\n get_label_info(invoker.apk_target, \"name\") + \".build_config\"\n _rebased_apk_build_config = rebase_path(_apk_build_config, root_build_dir)\n assert(_rebased_apk_build_config != \"\") # Mark as used.\n } else if (_test_type == \"gtest\") {\n assert(\n defined(invoker.executable_dist_dir),\n \"Must define either apk_target or executable_dist_dir for test_runner_script()\")\n test_runner_args += [\n \"--executable-dist-dir\",\n rebase_path(invoker.executable_dist_dir, root_build_dir),\n ]\n }\n\n if (_test_type == \"gtest\") {\n assert(defined(invoker.test_suite))\n test_runner_args += [\n \"--suite\",\n invoker.test_suite,\n ]\n } else if (_test_type == \"instrumentation\") {\n _test_apk = \"@FileArg($_rebased_apk_build_config:deps_info:apk_path)\"\n if (_incremental_install) {\n _test_apk = \"@FileArg($_rebased_apk_build_config:deps_info:incremental_apk_path)\"\n }\n test_runner_args += [\n \"--test-apk=$_test_apk\",\n \"--test-jar\",\n rebase_path(invoker.test_jar, root_build_dir),\n ]\n if (defined(invoker.apk_under_test)) {\n deps += [ \"${invoker.apk_under_test}__build_config\" ]\n _apk_under_test_build_config =\n get_label_info(invoker.apk_under_test, \"target_gen_dir\") + \"/\" +\n get_label_info(invoker.apk_under_test, \"name\") + \".build_config\"\n _rebased_apk_under_test_build_config =\n rebase_path(_apk_under_test_build_config, root_build_dir)\n _apk_under_test =\n \"@FileArg($_rebased_apk_under_test_build_config:deps_info:apk_path)\"\n if (_incremental_install) {\n _apk_under_test = \"@FileArg($_rebased_apk_under_test_build_config:deps_info:incremental_apk_path)\"\n }\n test_runner_args += [ \"--apk-under-test=$_apk_under_test\" ]\n }\n if (emma_coverage) {\n # Set a default coverage output directory (can be overridden by user\n # passing the same flag).\n test_runner_args += [\n \"--coverage-dir\",\n rebase_path(\"$root_out_dir/coverage\", root_build_dir),\n ]\n }\n } else if (_test_type == \"junit\") {\n assert(defined(invoker.test_suite))\n test_runner_args += [\n \"--test-suite\",\n invoker.test_suite,\n ]\n } else {\n assert(false, \"Invalid test type: $_test_type.\")\n }\n\n if (defined(invoker.additional_apks)) {\n foreach(additional_apk, invoker.additional_apks) {\n deps += [ \"${additional_apk}__build_config\" ]\n _build_config = get_label_info(additional_apk, \"target_gen_dir\") + \"/\" +\n get_label_info(additional_apk, \"name\") + \".build_config\"\n _rebased_build_config = rebase_path(_build_config, root_build_dir)\n test_runner_args += [\n \"--additional-apk\",\n \"@FileArg($_rebased_build_config:deps_info:apk_path)\",\n ]\n }\n }\n if (defined(invoker.shard_timeout)) {\n test_runner_args += [ \"--shard-timeout=${invoker.shard_timeout}\" ]\n }\n if (_incremental_install) {\n test_runner_args += [\n \"--test-apk-incremental-install-script\",\n \"@FileArg($_rebased_apk_build_config:deps_info:incremental_install_script_path)\",\n ]\n if (defined(invoker.apk_under_test)) {\n test_runner_args += [\n \"--apk-under-test-incremental-install-script\",\n \"@FileArg($_rebased_apk_under_test_build_config:deps_info:incremental_install_script_path)\",\n ]\n }\n test_runner_args += [ \"--fast-local-dev\" ]\n }\n if (is_asan) {\n test_runner_args += [ \"--tool=asan\" ]\n }\n\n generated_script = \"$root_build_dir/bin/run_${_test_name}\"\n outputs = [\n generated_script,\n ]\n data += [ generated_script ]\n\n args = [\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n \"--script-output-path\",\n rebase_path(generated_script, root_build_dir),\n ]\n if (defined(android_test_runner_script)) {\n args += [\n \"--test-runner-path\",\n android_test_runner_script,\n ]\n }\n\n args += test_runner_args\n }\n}\n\nif (enable_java_templates) {\n import(\"//build/config/zip.gni\")\n import(\"//third_party/ijar/ijar.gni\")\n import(\"//third_party/android_platform/config.gni\")\n\n rebased_android_sdk = rebase_path(android_sdk, root_build_dir)\n rebased_android_sdk_build_tools =\n rebase_path(android_sdk_build_tools, root_build_dir)\n\n android_sdk_jar = \"$android_sdk/android.jar\"\n rebased_android_sdk_jar = rebase_path(android_sdk_jar, root_build_dir)\n android_default_aapt_path = \"$rebased_android_sdk_build_tools/aapt\"\n\n android_configuration_name = \"Release\"\n if (is_debug) {\n android_configuration_name = \"Debug\"\n }\n\n template(\"android_lint\") {\n action(target_name) {\n forward_variables_from(invoker,\n [\n \"deps\",\n \"data_deps\",\n \"public_deps\",\n \"testonly\",\n ])\n if (!defined(deps)) {\n deps = []\n }\n\n if (!defined(lint_suppressions_file)) {\n lint_suppressions_file = \"//build/android/lint/suppressions.xml\"\n }\n\n _cache_dir = \"$root_build_dir/android_lint_cache\"\n _result_path = \"$target_gen_dir/$target_name/result.xml\"\n _config_path = \"$target_gen_dir/$target_name/config.xml\"\n _suppressions_file = lint_suppressions_file\n _platform_xml_path =\n \"${android_sdk_root}/platform-tools/api/api-versions.xml\"\n _rebased_lint_android_sdk_root =\n rebase_path(lint_android_sdk_root, root_build_dir)\n\n script = \"//build/android/gyp/lint.py\"\n depfile = \"$target_gen_dir/$target_name.d\"\n inputs = [\n _platform_xml_path,\n _suppressions_file,\n invoker.android_manifest,\n ]\n\n outputs = [\n _result_path,\n _config_path,\n ]\n\n args = [\n \"--lint-path=$_rebased_lint_android_sdk_root/tools/lint\",\n \"--cache-dir\",\n rebase_path(_cache_dir, root_build_dir),\n \"--platform-xml-path\",\n rebase_path(_platform_xml_path, root_build_dir),\n \"--android-sdk-version=${lint_android_sdk_version}\",\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n \"--config-path\",\n rebase_path(_suppressions_file, root_build_dir),\n \"--manifest-path\",\n rebase_path(invoker.android_manifest, root_build_dir),\n \"--product-dir=.\",\n \"--processed-config-path\",\n rebase_path(_config_path, root_build_dir),\n \"--result-path\",\n rebase_path(_result_path, root_build_dir),\n \"--enable\",\n ]\n\n if (defined(invoker.create_cache) && invoker.create_cache) {\n args += [\n \"--create-cache\",\n \"--silent\",\n ]\n } else {\n inputs += invoker.java_files\n inputs += [\n invoker.jar_path,\n invoker.build_config,\n ]\n if (invoker.java_files != []) {\n inputs += [ invoker.java_sources_file ]\n _rebased_java_sources_file =\n rebase_path(invoker.java_sources_file, root_build_dir)\n args += [ \"--java-sources-file=$_rebased_java_sources_file\" ]\n }\n deps += [ \"//build/android:prepare_android_lint_cache\" ]\n\n _rebased_build_config =\n rebase_path(invoker.build_config, root_build_dir)\n args += [\n \"--jar-path\",\n rebase_path(invoker.jar_path, root_build_dir),\n \"--classpath=@FileArg($_rebased_build_config:javac:interface_classpath)\",\n \"--resource-sources=@FileArg($_rebased_build_config:deps_info:owned_resources_dirs)\",\n \"--resource-sources=@FileArg($_rebased_build_config:deps_info:owned_resources_zips)\",\n \"--can-fail-build\",\n ]\n }\n }\n }\n\n template(\"proguard\") {\n action(target_name) {\n set_sources_assignment_filter([])\n forward_variables_from(invoker,\n [\n \"deps\",\n \"data_deps\",\n \"public_deps\",\n \"testonly\",\n ])\n script = \"//build/android/gyp/proguard.py\"\n if (defined(invoker.proguard_jar_path)) {\n _proguard_jar_path = invoker.proguard_jar_path\n } else {\n _proguard_jar_path = \"//third_party/proguard/lib/proguard.jar\"\n }\n _output_jar_path = invoker.output_jar_path\n inputs = [\n _proguard_jar_path,\n ]\n if (defined(invoker.alternative_android_sdk_jar)) {\n inputs += [ invoker.alternative_android_sdk_jar ]\n _rebased_android_sdk_jar =\n rebase_path(invoker.alternative_android_sdk_jar)\n } else {\n inputs += [ android_sdk_jar ]\n _rebased_android_sdk_jar = rebased_android_sdk_jar\n }\n if (defined(invoker.inputs)) {\n inputs += invoker.inputs\n }\n depfile = \"${target_gen_dir}/${target_name}.d\"\n outputs = [\n _output_jar_path,\n \"$_output_jar_path.dump\",\n \"$_output_jar_path.seeds\",\n \"$_output_jar_path.mapping\",\n \"$_output_jar_path.usage\",\n ]\n args = [\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n \"--proguard-path\",\n rebase_path(_proguard_jar_path, root_build_dir),\n \"--output-path\",\n rebase_path(_output_jar_path, root_build_dir),\n \"--classpath\",\n _rebased_android_sdk_jar,\n ]\n if (proguard_verbose) {\n args += [ \"--verbose\" ]\n }\n if (defined(invoker.args)) {\n args += invoker.args\n }\n if (defined(invoker.proguard_jar_path)) {\n # We assume that if we are using a different ProGuard, this new version\n # can handle the 'dangerous' optimizaions.\n args += [ \"--enable-dangerous-optimizations\" ]\n }\n }\n }\n\n template(\"findbugs\") {\n action(target_name) {\n forward_variables_from(invoker,\n [\n \"deps\",\n \"testonly\",\n ])\n script = \"//build/android/findbugs_diff.py\"\n depfile = \"$target_gen_dir/$target_name.d\"\n _result_path = \"$target_gen_dir/$target_name/result.xml\"\n _exclusions_file = \"//build/android/findbugs_filter/findbugs_exclude.xml\"\n\n _rebased_build_config = rebase_path(invoker.build_config, root_build_dir)\n\n inputs = [\n \"//build/android/pylib/utils/findbugs.py\",\n _exclusions_file,\n invoker.jar_path,\n invoker.build_config,\n ]\n\n outputs = [\n _result_path,\n ]\n\n args = [\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n \"--exclude\",\n rebase_path(_exclusions_file, root_build_dir),\n \"--auxclasspath-gyp\",\n \"@FileArg($_rebased_build_config:javac:classpath)\",\n \"--output-file\",\n rebase_path(_result_path, root_build_dir),\n rebase_path(invoker.jar_path, root_build_dir),\n ]\n\n if (findbugs_verbose) {\n args += [ \"-vv\" ]\n }\n }\n }\n\n # Generates a script in the build bin directory to run a java binary.\n #\n # Variables\n # main_class: The class containing the program entry point.\n # jar_path: The path to the jar to run.\n # script_name: Name of the script to generate.\n # build_config: Path to .build_config for the jar (contains classpath).\n # wrapper_script_args: List of extra arguments to pass to the executable.\n #\n template(\"java_binary_script\") {\n set_sources_assignment_filter([])\n forward_variables_from(invoker, [ \"testonly\" ])\n\n _main_class = invoker.main_class\n _build_config = invoker.build_config\n _jar_path = invoker.jar_path\n _script_name = invoker.script_name\n\n action(target_name) {\n script = \"//build/android/gyp/create_java_binary_script.py\"\n depfile = \"$target_gen_dir/$_script_name.d\"\n java_script = \"$root_build_dir/bin/$_script_name\"\n inputs = [\n _build_config,\n ]\n outputs = [\n java_script,\n ]\n forward_variables_from(invoker, [ \"deps\" ])\n _rebased_build_config = rebase_path(_build_config, root_build_dir)\n args = [\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n \"--output\",\n rebase_path(java_script, root_build_dir),\n \"--classpath=@FileArg($_rebased_build_config:deps_info:java:full_classpath)\",\n \"--jar-path\",\n rebase_path(_jar_path, root_build_dir),\n \"--main-class\",\n _main_class,\n ]\n if (emma_coverage) {\n args += [\n \"--classpath\",\n rebase_path(\"//third_party/android_tools/sdk/tools/lib/emma.jar\",\n root_build_dir),\n ]\n args += [ \"--noverify\" ]\n }\n if (defined(invoker.wrapper_script_args)) {\n args += [ \"--\" ] + invoker.wrapper_script_args\n }\n if (defined(invoker.bootclasspath)) {\n args += [\n \"--bootclasspath\",\n rebase_path(invoker.bootclasspath, root_build_dir),\n ]\n }\n }\n }\n\n template(\"dex\") {\n set_sources_assignment_filter([])\n\n _enable_multidex =\n defined(invoker.enable_multidex) && invoker.enable_multidex\n\n if (_enable_multidex) {\n _main_dex_list_path = invoker.output + \".main_dex_list\"\n _main_dex_list_target_name = \"${target_name}__main_dex_list\"\n action(_main_dex_list_target_name) {\n forward_variables_from(invoker,\n [\n \"deps\",\n \"inputs\",\n \"sources\",\n \"testonly\",\n ])\n\n script = \"//build/android/gyp/main_dex_list.py\"\n depfile = \"$target_gen_dir/$target_name.d\"\n\n main_dex_rules = \"//build/android/main_dex_classes.flags\"\n\n if (!defined(inputs)) {\n inputs = []\n }\n inputs += [ main_dex_rules ]\n\n outputs = [\n _main_dex_list_path,\n ]\n\n args = [\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n \"--android-sdk-tools\",\n rebased_android_sdk_build_tools,\n \"--main-dex-list-path\",\n rebase_path(_main_dex_list_path, root_build_dir),\n \"--main-dex-rules-path\",\n rebase_path(main_dex_rules, root_build_dir),\n ]\n\n if (defined(invoker.args)) {\n args += invoker.args\n }\n\n if (defined(invoker.sources)) {\n args += rebase_path(invoker.sources, root_build_dir)\n }\n }\n }\n\n assert(defined(invoker.output))\n action(target_name) {\n forward_variables_from(invoker,\n [\n \"deps\",\n \"inputs\",\n \"sources\",\n \"testonly\",\n ])\n script = \"//build/android/gyp/dex.py\"\n depfile = \"$target_gen_dir/$target_name.d\"\n outputs = [\n invoker.output,\n ]\n\n rebased_output = rebase_path(invoker.output, root_build_dir)\n\n args = [\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n \"--android-sdk-tools\",\n rebased_android_sdk_build_tools,\n \"--dex-path\",\n rebased_output,\n ]\n\n if (enable_incremental_dx) {\n args += [ \"--incremental\" ]\n }\n\n # EMMA requires --no-locals.\n if (emma_coverage) {\n args += [ \"--no-locals=1\" ]\n }\n\n if (_enable_multidex) {\n args += [\n \"--multi-dex\",\n \"--main-dex-list-path\",\n rebase_path(_main_dex_list_path, root_build_dir),\n ]\n deps += [ \":${_main_dex_list_target_name}\" ]\n inputs += [ _main_dex_list_path ]\n }\n\n if (defined(invoker.args)) {\n args += invoker.args\n }\n\n if (defined(invoker.sources)) {\n args += rebase_path(invoker.sources, root_build_dir)\n }\n }\n }\n\n template(\"process_java_prebuilt\") {\n set_sources_assignment_filter([])\n forward_variables_from(invoker, [ \"testonly\" ])\n\n assert(invoker.build_config != \"\")\n _build_config = invoker.build_config\n _rebased_build_config = rebase_path(_build_config, root_build_dir)\n assert(_rebased_build_config != \"\" || true) # Mark used.\n\n _input_jar_path = invoker.input_jar_path\n _output_jar_path = invoker.output_jar_path\n\n _jar_excluded_patterns = []\n if (defined(invoker.jar_excluded_patterns)) {\n _jar_excluded_patterns = invoker.jar_excluded_patterns\n }\n _strip_resource_classes = defined(invoker.strip_resource_classes) &&\n invoker.strip_resource_classes\n _filter_jar = _jar_excluded_patterns != [] || _strip_resource_classes\n\n _proguard_preprocess =\n defined(invoker.proguard_preprocess) && invoker.proguard_preprocess\n\n _enable_assert =\n defined(invoker.supports_android) && invoker.supports_android &&\n (is_java_debug || dcheck_always_on)\n\n _retrolambda = defined(invoker.supports_android) &&\n invoker.supports_android && use_java8\n\n _deps = []\n _previous_output_jar = _input_jar_path\n\n if (_filter_jar) {\n _filter_target = \"${target_name}__filter\"\n _filter_input_jar = _previous_output_jar\n _filter_output_jar = \"$target_out_dir/$target_name-filtered.jar\"\n\n action(_filter_target) {\n script = \"//build/android/gyp/jar.py\"\n deps = _deps\n if (defined(invoker.deps)) {\n deps += invoker.deps\n }\n if (defined(invoker.public_deps)) {\n public_deps = invoker.public_deps\n }\n inputs = [\n _build_config,\n _filter_input_jar,\n ]\n outputs = [\n _filter_output_jar,\n ]\n args = [\n \"--input-jar\",\n rebase_path(_filter_input_jar, root_build_dir),\n \"--jar-path\",\n rebase_path(_filter_output_jar, root_build_dir),\n \"--excluded-classes=$_jar_excluded_patterns\",\n ]\n if (_strip_resource_classes) {\n args += [ \"--strip-resource-classes-for=@FileArg($_rebased_build_config:javac:resource_packages)\" ]\n }\n }\n\n _deps = []\n _deps = [ \":$_filter_target\" ]\n _previous_output_jar = _filter_output_jar\n }\n\n if (_proguard_preprocess) {\n _proguard_target = \"${target_name}__proguard_process\"\n _proguard_input_jar = _previous_output_jar\n _proguard_output_jar = \"$target_out_dir/$target_name-proguarded.jar\"\n _proguard_config_path = invoker.proguard_preprocess_config\n\n proguard(_proguard_target) {\n deps = _deps\n if (defined(invoker.deps)) {\n deps += invoker.deps\n }\n if (defined(invoker.public_deps)) {\n public_deps = invoker.public_deps\n }\n inputs = [\n _build_config,\n _proguard_config_path,\n _proguard_input_jar,\n ]\n output_jar_path = _proguard_output_jar\n\n _rebased_input_paths =\n [ rebase_path(_proguard_input_jar, root_build_dir) ]\n _rebased_proguard_configs =\n [ rebase_path(_proguard_config_path, root_build_dir) ]\n args = [\n \"--input-paths=$_rebased_input_paths\",\n \"--proguard-configs=$_rebased_proguard_configs\",\n \"--classpath=@FileArg($_rebased_build_config:javac:classpath)\",\n ]\n }\n\n _deps = []\n _deps = [ \":$_proguard_target\" ]\n _previous_output_jar = _proguard_output_jar\n }\n\n if (_enable_assert) {\n _assert_target = \"${target_name}__assert\"\n _assert_input_jar = _previous_output_jar\n _assert_output_jar = \"$target_out_dir/$target_name-asserted.jar\"\n\n action(_assert_target) {\n script = \"$root_build_dir/bin/helper/java_assertion_enabler\"\n deps = [\n \"//build/android/java_assertion_enabler($default_toolchain)\",\n ]\n deps += _deps\n if (defined(invoker.deps)) {\n deps += invoker.deps\n }\n if (defined(invoker.public_deps)) {\n public_deps = invoker.public_deps\n }\n inputs = [\n _assert_input_jar,\n ]\n outputs = [\n _assert_output_jar,\n ]\n args = [\n rebase_path(_assert_input_jar, root_build_dir),\n rebase_path(_assert_output_jar, root_build_dir),\n ]\n }\n\n _deps = []\n _deps = [ \":$_assert_target\" ]\n _previous_output_jar = _assert_output_jar\n }\n\n if (_retrolambda) {\n _retrolambda_target = \"${target_name}__retrolambda\"\n _retrolambda_input_jar = _previous_output_jar\n _retrolambda_output_jar = \"$target_out_dir/$target_name-retrolambda.jar\"\n\n android_sdk_jar = \"$android_sdk/android.jar\"\n action(_retrolambda_target) {\n script = \"//build/android/gyp/retrolambda.py\"\n deps = _deps\n if (defined(invoker.deps)) {\n deps += invoker.deps\n }\n if (defined(invoker.public_deps)) {\n public_deps = invoker.public_deps\n }\n inputs = [\n _build_config,\n _retrolambda_input_jar,\n ]\n outputs = [\n _retrolambda_output_jar,\n ]\n args = [\n \"--input-jar\",\n rebase_path(_retrolambda_input_jar, root_build_dir),\n \"--output-jar\",\n rebase_path(_retrolambda_output_jar, root_build_dir),\n \"--classpath=@FileArg($_rebased_build_config:javac:classpath)\",\n \"--android-sdk-jar\",\n rebase_path(android_sdk_jar, root_build_dir),\n ]\n }\n\n _deps = []\n _deps = [ \":$_retrolambda_target\" ]\n _previous_output_jar = _retrolambda_output_jar\n }\n\n _output_jar_target = \"${target_name}__copy\"\n copy(_output_jar_target) {\n deps = _deps\n if (defined(invoker.deps)) {\n deps += invoker.deps\n }\n if (defined(invoker.public_deps)) {\n public_deps = invoker.public_deps\n }\n sources = [\n _previous_output_jar,\n ]\n outputs = [\n _output_jar_path,\n ]\n }\n\n group(target_name) {\n forward_variables_from(invoker,\n [\n \"data_deps\",\n \"visibility\",\n ])\n public_deps = [\n \":$_output_jar_target\",\n ]\n }\n }\n\n template(\"emma_instr\") {\n action(target_name) {\n forward_variables_from(invoker,\n [\n \"deps\",\n \"testonly\",\n ])\n\n _coverage_file = \"$target_out_dir/${target_name}.em\"\n _source_dirs_listing_file = \"$target_out_dir/${target_name}_sources.txt\"\n _emma_jar = \"${android_sdk_root}/tools/lib/emma.jar\"\n\n script = \"//build/android/gyp/emma_instr.py\"\n depfile = \"${target_gen_dir}/${target_name}.d\"\n inputs = invoker.java_files + [\n _emma_jar,\n invoker.input_jar_path,\n ]\n outputs = [\n _coverage_file,\n _source_dirs_listing_file,\n invoker.output_jar_path,\n ]\n args = [\n \"instrument_jar\",\n \"--input-path\",\n rebase_path(invoker.input_jar_path, root_build_dir),\n \"--output-path\",\n rebase_path(invoker.output_jar_path, root_build_dir),\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n \"--coverage-file\",\n rebase_path(_coverage_file, root_build_dir),\n \"--sources-list-file\",\n rebase_path(_source_dirs_listing_file, root_build_dir),\n \"--src-root\",\n rebase_path(\"//\", root_build_dir),\n \"--emma-jar\",\n rebase_path(_emma_jar, root_build_dir),\n ]\n _rebased_java_sources_file =\n rebase_path(invoker.java_sources_file, root_build_dir)\n args += [ \"--java-sources-file=$_rebased_java_sources_file\" ]\n\n if (emma_filter != \"\") {\n args += [\n \"--filter-string\",\n emma_filter,\n ]\n }\n }\n }\n\n # Creates an unsigned .apk.\n #\n # Variables\n # assets_build_config: Path to android_apk .build_config containing merged\n # asset information.\n # deps: Specifies the dependencies of this target.\n # dex_path: Path to classes.dex file to include (optional).\n # resource_packaged_apk_path: Path to .ap_ to use.\n # output_apk_path: Output path for the generated .apk.\n # native_lib_placeholders: List of placeholder filenames to add to the apk\n # (optional).\n # native_libs: List of native libraries.\n # native_libs_filearg: @FileArg() of additionaly native libraries.\n # write_asset_list: Adds an extra file to the assets, which contains a list of\n # all other asset files.\n template(\"package_apk\") {\n action(target_name) {\n forward_variables_from(invoker,\n [\n \"deps\",\n \"public_deps\",\n \"testonly\",\n ])\n _native_lib_placeholders = []\n if (defined(invoker.native_lib_placeholders)) {\n _native_lib_placeholders = invoker.native_lib_placeholders\n }\n\n script = \"//build/android/gyp/apkbuilder.py\"\n depfile = \"$target_gen_dir/$target_name.d\"\n data_deps = [\n \"//tools/android/md5sum\",\n ] # Used when deploying APKs\n\n inputs = invoker.native_libs + [ invoker.resource_packaged_apk_path ]\n if (defined(invoker.dex_path)) {\n inputs += [ invoker.dex_path ]\n }\n\n outputs = [\n invoker.output_apk_path,\n ]\n\n _rebased_resource_packaged_apk_path =\n rebase_path(invoker.resource_packaged_apk_path, root_build_dir)\n _rebased_packaged_apk_path =\n rebase_path(invoker.output_apk_path, root_build_dir)\n args = [\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n \"--resource-apk=$_rebased_resource_packaged_apk_path\",\n \"--output-apk=$_rebased_packaged_apk_path\",\n ]\n if (defined(invoker.assets_build_config)) {\n inputs += [ invoker.assets_build_config ]\n _rebased_build_config =\n rebase_path(invoker.assets_build_config, root_build_dir)\n args += [\n \"--assets=@FileArg($_rebased_build_config:assets)\",\n \"--uncompressed-assets=@FileArg($_rebased_build_config:uncompressed_assets)\",\n ]\n }\n if (defined(invoker.write_asset_list) && invoker.write_asset_list) {\n args += [ \"--write-asset-list\" ]\n }\n if (defined(invoker.dex_path)) {\n _rebased_dex_path = rebase_path(invoker.dex_path, root_build_dir)\n args += [ \"--dex-file=$_rebased_dex_path\" ]\n }\n if (invoker.native_libs != [] || defined(invoker.native_libs_filearg) ||\n _native_lib_placeholders != []) {\n args += [ \"--android-abi=$android_app_abi\" ]\n }\n if (invoker.native_libs != []) {\n _rebased_native_libs = rebase_path(invoker.native_libs, root_build_dir)\n args += [ \"--native-libs=$_rebased_native_libs\" ]\n }\n if (defined(invoker.native_libs_filearg)) {\n args += [ \"--native-libs=${invoker.native_libs_filearg}\" ]\n }\n if (_native_lib_placeholders != []) {\n args += [ \"--native-lib-placeholders=$_native_lib_placeholders\" ]\n }\n\n # TODO (michaelbai): Remove the secondary_native_libs variable.\n if (defined(invoker.secondary_abi_native_libs_filearg)) {\n assert(defined(android_app_secondary_abi))\n args += [\n \"--secondary-native-libs=${invoker.secondary_abi_native_libs_filearg}\",\n \"--secondary-android-abi=$android_app_secondary_abi\",\n ]\n } else if (defined(invoker.secondary_native_libs) &&\n invoker.secondary_native_libs != []) {\n assert(defined(android_app_secondary_abi))\n inputs += invoker.secondary_native_libs\n _secondary_native_libs = rebase_path(invoker.secondary_native_libs)\n args += [\n \"--secondary-native-libs=$_secondary_native_libs\",\n \"--secondary-android-abi=$android_app_secondary_abi\",\n ]\n }\n\n if (defined(invoker.emma_instrument) && invoker.emma_instrument) {\n _emma_device_jar = \"$android_sdk_root/tools/lib/emma_device.jar\"\n _rebased_emma_device_jar = rebase_path(_emma_device_jar, root_build_dir)\n args += [ \"--emma-device-jar=$_rebased_emma_device_jar\" ]\n }\n\n if (defined(invoker.uncompress_shared_libraries) &&\n invoker.uncompress_shared_libraries) {\n args += [ \"--uncompress-shared-libraries\" ]\n }\n }\n }\n\n # Signs & zipaligns an apk.\n #\n # Variables\n # input_apk_path: Path of the .apk to be finalized.\n # output_apk_path: Output path for the generated .apk.\n # keystore_path: Path to keystore to use for signing.\n # keystore_name: Key alias to use.\n # keystore_password: Keystore password.\n # rezip_apk: Whether to add crazy-linker alignment.\n template(\"finalize_apk\") {\n action(target_name) {\n deps = []\n script = \"//build/android/gyp/finalize_apk.py\"\n depfile = \"$target_gen_dir/$target_name.d\"\n forward_variables_from(invoker,\n [\n \"deps\",\n \"data_deps\",\n \"public_deps\",\n \"testonly\",\n ])\n\n sources = [\n invoker.input_apk_path,\n ]\n inputs = [\n invoker.keystore_path,\n ]\n outputs = [\n invoker.output_apk_path,\n ]\n data = [\n invoker.output_apk_path,\n ]\n\n args = [\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n \"--zipalign-path\",\n rebase_path(zipalign_path, root_build_dir),\n \"--unsigned-apk-path\",\n rebase_path(invoker.input_apk_path, root_build_dir),\n \"--final-apk-path\",\n rebase_path(invoker.output_apk_path, root_build_dir),\n \"--key-path\",\n rebase_path(invoker.keystore_path, root_build_dir),\n \"--key-name\",\n invoker.keystore_name,\n \"--key-passwd\",\n invoker.keystore_password,\n ]\n if (defined(invoker.rezip_apk) && invoker.rezip_apk) {\n deps += [ \"//build/android/rezip\" ]\n _rezip_jar_path = \"$root_build_dir/lib.java/rezip_apk.jar\"\n args += [\n \"--load-library-from-zip=1\",\n \"--rezip-apk-jar-path\",\n rebase_path(_rezip_jar_path, root_build_dir),\n ]\n }\n\n if (defined(invoker.page_align_shared_libraries) &&\n invoker.page_align_shared_libraries) {\n args += [ \"--page-align-shared-libraries\" ]\n }\n }\n }\n\n # Packages resources, assets, dex, and native libraries into an apk. Signs and\n # zipaligns the apk.\n template(\"create_apk\") {\n set_sources_assignment_filter([])\n forward_variables_from(invoker, [ \"testonly\" ])\n\n _android_manifest = invoker.android_manifest\n _base_path = invoker.base_path\n _final_apk_path = invoker.apk_path\n _incremental_final_apk_path_helper =\n process_file_template(\n [ _final_apk_path ],\n \"{{source_dir}}/{{source_name_part}}_incremental.apk\")\n _incremental_final_apk_path = _incremental_final_apk_path_helper[0]\n\n if (defined(invoker.resources_zip)) {\n _resources_zip = invoker.resources_zip\n assert(_resources_zip != \"\") # Mark as used.\n }\n if (defined(invoker.dex_path)) {\n _dex_path = invoker.dex_path\n }\n _load_library_from_apk = invoker.load_library_from_apk\n\n _deps = []\n if (defined(invoker.deps)) {\n _deps = invoker.deps\n }\n _incremental_deps = []\n if (defined(invoker.incremental_deps)) {\n _incremental_deps = invoker.incremental_deps\n }\n _native_libs = []\n if (defined(invoker.native_libs)) {\n _native_libs = invoker.native_libs\n }\n _native_libs_even_when_incremental = []\n if (defined(invoker.native_libs_even_when_incremental)) {\n _native_libs_even_when_incremental =\n invoker.native_libs_even_when_incremental\n }\n\n _version_code = invoker.version_code\n _version_name = invoker.version_name\n assert(_version_code != -1) # Mark as used.\n assert(_version_name != \"\") # Mark as used.\n\n _base_apk_path = _base_path + \".apk_intermediates\"\n\n _resource_packaged_apk_path = _base_apk_path + \".ap_\"\n _incremental_resource_packaged_apk_path =\n _base_apk_path + \"_incremental.ap_\"\n _packaged_apk_path = _base_apk_path + \".unfinished.apk\"\n _incremental_packaged_apk_path =\n _base_apk_path + \"_incremental.unfinished.apk\"\n _shared_resources =\n defined(invoker.shared_resources) && invoker.shared_resources\n assert(_shared_resources || true) # Mark as used.\n _app_as_shared_lib =\n defined(invoker.app_as_shared_lib) && invoker.app_as_shared_lib\n assert(_app_as_shared_lib || true) # Mark as used.\n assert(!(_shared_resources && _app_as_shared_lib))\n\n _keystore_path = invoker.keystore_path\n _keystore_name = invoker.keystore_name\n _keystore_password = invoker.keystore_password\n\n _split_densities = []\n if (defined(invoker.create_density_splits) &&\n invoker.create_density_splits) {\n _split_densities = [\n \"hdpi\",\n \"xhdpi\",\n \"xxhdpi\",\n \"xxxhdpi\",\n \"tvdpi\",\n ]\n }\n\n _split_languages = []\n if (defined(invoker.language_splits)) {\n _split_languages = invoker.language_splits\n }\n\n template(\"package_resources_helper\") {\n action(target_name) {\n deps = invoker.deps\n\n script = \"//build/android/gyp/package_resources.py\"\n depfile = \"${target_gen_dir}/${target_name}.d\"\n inputs = [\n invoker.android_manifest,\n ]\n if (defined(_resources_zip)) {\n inputs += [ _resources_zip ]\n }\n outputs = [\n invoker.resource_packaged_apk_path,\n ]\n\n if (defined(invoker.android_aapt_path)) {\n _android_aapt_path = invoker.android_aapt_path\n } else {\n _android_aapt_path = android_default_aapt_path\n }\n\n if (defined(invoker.alternative_android_sdk_jar)) {\n _rebased_android_sdk_jar =\n rebase_path(invoker.alternative_android_sdk_jar)\n } else {\n _rebased_android_sdk_jar = rebased_android_sdk_jar\n }\n\n args = [\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n \"--android-sdk-jar\",\n _rebased_android_sdk_jar,\n \"--aapt-path\",\n _android_aapt_path,\n \"--configuration-name=$android_configuration_name\",\n \"--android-manifest\",\n rebase_path(invoker.android_manifest, root_build_dir),\n \"--version-code\",\n _version_code,\n \"--version-name\",\n _version_name,\n \"--apk-path\",\n rebase_path(invoker.resource_packaged_apk_path, root_build_dir),\n ]\n\n if (defined(_resources_zip)) {\n args += [\n \"--resource-zips\",\n rebase_path(_resources_zip, root_build_dir),\n ]\n }\n if (_shared_resources) {\n args += [ \"--shared-resources\" ]\n }\n if (_app_as_shared_lib) {\n args += [ \"--app-as-shared-lib\" ]\n }\n if (_split_densities != []) {\n args += [ \"--create-density-splits\" ]\n foreach(_density, _split_densities) {\n outputs += [ \"${invoker.resource_packaged_apk_path}_${_density}\" ]\n }\n }\n if (_split_languages != []) {\n args += [ \"--language-splits=$_split_languages\" ]\n foreach(_language, _split_languages) {\n outputs += [ \"${invoker.resource_packaged_apk_path}_${_language}\" ]\n }\n }\n if (defined(invoker.extensions_to_not_compress)) {\n args += [\n \"--no-compress\",\n invoker.extensions_to_not_compress,\n ]\n }\n }\n }\n\n _package_resources_target_name = \"${target_name}__package_resources\"\n package_resources_helper(_package_resources_target_name) {\n forward_variables_from(invoker,\n [\n \"alternative_android_sdk_jar\",\n \"android_aapt_path\",\n \"extensions_to_not_compress\",\n ])\n deps = _deps\n android_manifest = _android_manifest\n resource_packaged_apk_path = _resource_packaged_apk_path\n }\n\n _generate_incremental_manifest_target_name =\n \"${target_name}_incremental_generate_manifest\"\n _incremental_android_manifest =\n get_label_info(_generate_incremental_manifest_target_name,\n \"target_gen_dir\") + \"/AndroidManifest.xml\"\n action(_generate_incremental_manifest_target_name) {\n deps = _incremental_deps\n script =\n \"//build/android/incremental_install/generate_android_manifest.py\"\n depfile = \"${target_gen_dir}/${target_name}.d\"\n inputs = [\n _android_manifest,\n ]\n outputs = [\n _incremental_android_manifest,\n ]\n\n _rebased_src_manifest = rebase_path(_android_manifest, root_build_dir)\n _rebased_incremental_manifest =\n rebase_path(_incremental_android_manifest, root_build_dir)\n _rebased_depfile = rebase_path(depfile, root_build_dir)\n args = [\n \"--src-manifest=$_rebased_src_manifest\",\n \"--out-manifest=$_rebased_incremental_manifest\",\n \"--depfile=$_rebased_depfile\",\n ]\n if (disable_incremental_isolated_processes) {\n args += [ \"--disable-isolated-processes\" ]\n }\n }\n\n _incremental_package_resources_target_name =\n \"${target_name}_incremental__package_resources\"\n\n # TODO(agrieve): See if we can speed up this step by swapping the manifest\n # from the result of the main package_resources step.\n package_resources_helper(_incremental_package_resources_target_name) {\n forward_variables_from(invoker,\n [\n \"alternative_android_sdk_jar\",\n \"android_aapt_path\",\n \"extensions_to_not_compress\",\n ])\n deps =\n _incremental_deps + [ \":$_generate_incremental_manifest_target_name\" ]\n android_manifest = _incremental_android_manifest\n resource_packaged_apk_path = _incremental_resource_packaged_apk_path\n }\n\n package_target = \"${target_name}__package\"\n package_apk(package_target) {\n forward_variables_from(invoker,\n [\n \"assets_build_config\",\n \"emma_instrument\",\n \"native_lib_placeholders\",\n \"native_libs_filearg\",\n \"secondary_abi_native_libs_filearg\",\n \"secondary_native_libs\",\n \"uncompress_shared_libraries\",\n \"write_asset_list\",\n ])\n deps = _deps + [ \":${_package_resources_target_name}\" ]\n native_libs = _native_libs + _native_libs_even_when_incremental\n\n if (defined(_dex_path)) {\n dex_path = _dex_path\n }\n\n output_apk_path = _packaged_apk_path\n resource_packaged_apk_path = _resource_packaged_apk_path\n }\n\n _incremental_package_target = \"${target_name}_incremental__package\"\n package_apk(_incremental_package_target) {\n forward_variables_from(invoker,\n [\n \"assets_build_config\",\n \"emma_instrument\",\n \"secondary_native_libs\",\n \"uncompress_shared_libraries\",\n ])\n _dex_target = \"//build/android/incremental_install:bootstrap_java__dex\"\n deps = _incremental_deps + [\n \":${_incremental_package_resources_target_name}\",\n _dex_target,\n ]\n\n if (defined(_dex_path)) {\n dex_path =\n get_label_info(_dex_target, \"target_gen_dir\") + \"/bootstrap.dex\"\n }\n\n native_libs = _native_libs_even_when_incremental\n\n # http://crbug.com/384638\n _has_native_libs =\n defined(invoker.native_libs_filearg) || _native_libs != []\n if (_has_native_libs && _native_libs_even_when_incremental == []) {\n native_lib_placeholders = [ \"libfix.crbug.384638.so\" ]\n }\n\n output_apk_path = _incremental_packaged_apk_path\n resource_packaged_apk_path = _incremental_resource_packaged_apk_path\n }\n\n _finalize_apk_rule_name = \"${target_name}__finalize\"\n finalize_apk(_finalize_apk_rule_name) {\n forward_variables_from(invoker, [ \"page_align_shared_libraries\" ])\n\n input_apk_path = _packaged_apk_path\n output_apk_path = _final_apk_path\n keystore_path = _keystore_path\n keystore_name = _keystore_name\n keystore_password = _keystore_password\n rezip_apk = _load_library_from_apk\n\n public_deps = [\n # Generator of the _packaged_apk_path this target takes as input.\n \":$package_target\",\n ]\n }\n\n _incremental_finalize_apk_rule_name = \"${target_name}_incremental__finalize\"\n finalize_apk(_incremental_finalize_apk_rule_name) {\n input_apk_path = _incremental_packaged_apk_path\n output_apk_path = _incremental_final_apk_path\n keystore_path = _keystore_path\n keystore_name = _keystore_name\n keystore_password = _keystore_password\n\n public_deps = [\n \":$_incremental_package_target\",\n ]\n }\n\n _split_deps = []\n\n template(\"finalize_split\") {\n finalize_apk(target_name) {\n _config = invoker.split_config\n _type = invoker.split_type\n input_apk_path = \"${_resource_packaged_apk_path}_${_config}\"\n _output_paths = process_file_template(\n [ _final_apk_path ],\n \"{{source_dir}}/{{source_name_part}}-${_type}-${_config}.apk\")\n output_apk_path = _output_paths[0]\n keystore_path = _keystore_path\n keystore_name = _keystore_name\n keystore_password = _keystore_password\n deps = [\n \":${_package_resources_target_name}\",\n ]\n }\n }\n\n foreach(_split, _split_densities) {\n _split_rule = \"${target_name}__finalize_${_split}_split\"\n finalize_split(_split_rule) {\n split_type = \"density\"\n split_config = _split\n }\n _split_deps += [ \":$_split_rule\" ]\n }\n foreach(_split, _split_languages) {\n _split_rule = \"${target_name}__finalize_${_split}_split\"\n finalize_split(_split_rule) {\n split_type = \"lang\"\n split_config = _split\n }\n _split_deps += [ \":$_split_rule\" ]\n }\n\n group(target_name) {\n public_deps = [ \":${_finalize_apk_rule_name}\" ] + _split_deps\n }\n group(\"${target_name}_incremental\") {\n public_deps = [ \":${_incremental_finalize_apk_rule_name}\" ] + _split_deps\n }\n }\n\n template(\"java_prebuilt_impl\") {\n set_sources_assignment_filter([])\n forward_variables_from(invoker, [ \"testonly\" ])\n _supports_android =\n defined(invoker.supports_android) && invoker.supports_android\n\n assert(defined(invoker.jar_path))\n if (defined(invoker.output_name)) {\n _output_name = invoker.output_name\n } else {\n _output_name = get_path_info(invoker.jar_path, \"name\")\n }\n _base_path = \"${target_gen_dir}/$target_name\"\n\n # Jar files can be needed at runtime (by Robolectric tests or java binaries),\n # so do not put them under gen/.\n _target_dir_name = get_label_info(\":$target_name\", \"dir\")\n _jar_path = \"$root_out_dir/lib.java$_target_dir_name/$_output_name.jar\"\n _ijar_path =\n \"$root_out_dir/lib.java$_target_dir_name/$_output_name.interface.jar\"\n _build_config = _base_path + \".build_config\"\n\n if (_supports_android) {\n _dex_path = _base_path + \".dex.jar\"\n }\n _deps = []\n if (defined(invoker.deps)) {\n _deps = invoker.deps\n }\n _jar_deps = []\n if (defined(invoker.jar_dep)) {\n _jar_deps = [ invoker.jar_dep ]\n }\n\n _template_name = target_name\n\n _build_config_target_name = \"${_template_name}__build_config\"\n _process_jar_target_name = \"${_template_name}__process_jar\"\n _ijar_target_name = \"${_template_name}__ijar\"\n if (_supports_android) {\n _dex_target_name = \"${_template_name}__dex\"\n }\n\n write_build_config(_build_config_target_name) {\n type = \"java_prebuilt\"\n is_prebuilt_binary = defined(invoker.main_class)\n forward_variables_from(invoker,\n [\n \"input_jars_paths\",\n \"proguard_configs\",\n ])\n supports_android = _supports_android\n requires_android =\n defined(invoker.requires_android) && invoker.requires_android\n\n if (defined(invoker.deps)) {\n possible_config_deps = _deps\n }\n build_config = _build_config\n jar_path = _jar_path\n if (_supports_android) {\n dex_path = _dex_path\n }\n }\n\n process_java_prebuilt(_process_jar_target_name) {\n forward_variables_from(invoker,\n [\n \"jar_excluded_patterns\",\n \"proguard_preprocess\",\n \"proguard_preprocess_config\",\n \"strip_resource_classes\",\n ])\n\n visibility = [\n \":$_ijar_target_name\",\n \":$_template_name\",\n ]\n if (_supports_android) {\n visibility += [ \":$_dex_target_name\" ]\n }\n\n supports_android = _supports_android\n build_config = _build_config\n input_jar_path = invoker.jar_path\n output_jar_path = _jar_path\n\n deps = [ \":$_build_config_target_name\" ] + _deps + _jar_deps\n }\n\n generate_interface_jar(_ijar_target_name) {\n if (!defined(invoker.proguard_preprocess) ||\n !invoker.proguard_preprocess) {\n # Always used the unfiltered .jar to create the interface jar so that\n # other targets will resolve filtered classes when depending on\n # BuildConfig, NativeLibraries, etc.\n input_jar = invoker.jar_path\n deps = _deps + _jar_deps\n } else {\n # However, still apply pre-proguarding, since ignoring that can break\n # compiles.\n input_jar = _jar_path\n deps = [\n \":$_process_jar_target_name\",\n ]\n }\n\n output_jar = _ijar_path\n }\n\n if (_supports_android) {\n dex(_dex_target_name) {\n sources = [\n _jar_path,\n ]\n output = _dex_path\n deps = [ \":$_process_jar_target_name\" ] + _deps + _jar_deps\n }\n }\n\n if (defined(invoker.main_class)) {\n _binary_script_target_name = \"${_template_name}__java_binary_script\"\n java_binary_script(_binary_script_target_name) {\n forward_variables_from(invoker,\n [\n \"bootclasspath\",\n \"deps\",\n \"main_class\",\n \"wrapper_script_args\",\n ])\n if (!defined(deps)) {\n deps = []\n }\n build_config = _build_config\n jar_path = _jar_path\n script_name = _template_name\n if (defined(invoker.wrapper_script_name)) {\n script_name = invoker.wrapper_script_name\n }\n deps += [ \":$_build_config_target_name\" ]\n }\n }\n\n group(target_name) {\n forward_variables_from(invoker, [ \"data_deps\" ])\n public_deps = [\n \":$_ijar_target_name\",\n \":$_process_jar_target_name\",\n ]\n if (_supports_android) {\n public_deps += [ \":$_dex_target_name\" ]\n }\n if (defined(invoker.main_class)) {\n # Some targets use the generated script while building, so make it a dep\n # rather than a data_dep.\n public_deps += [ \":$_binary_script_target_name\" ]\n }\n }\n }\n\n # Compiles and jars a set of java files.\n #\n # Outputs:\n # $jar_path.jar\n # $jar_path.interface.jar\n #\n # Variables\n # java_files: List of .java files to compile (same as exists in java_sources_file)\n # java_sources_file: Path to file containing list of files to compile.\n # chromium_code: If true, enable extra warnings.\n # srcjar_deps: List of srcjar dependencies. The .java files contained in the\n # dependencies srcjar outputs will be compiled and added to the output jar.\n # jar_path: Use this to explicitly set the output jar path. Defaults to\n # \"${target_gen_dir}/${target_name}.jar.\n template(\"compile_java\") {\n set_sources_assignment_filter([])\n forward_variables_from(invoker, [ \"testonly\" ])\n\n assert(defined(invoker.build_config))\n assert(defined(invoker.jar_path))\n\n _build_config = invoker.build_config\n\n _chromium_code = false\n if (defined(invoker.chromium_code)) {\n _chromium_code = invoker.chromium_code\n }\n\n _supports_android = true\n if (defined(invoker.supports_android)) {\n _supports_android = invoker.supports_android\n }\n\n _requires_android =\n defined(invoker.requires_android) && invoker.requires_android\n\n _enable_errorprone = use_errorprone_java_compiler\n if (!_chromium_code) {\n _enable_errorprone = false\n } else if (defined(invoker.enable_errorprone)) {\n _enable_errorprone = invoker.enable_errorprone\n }\n\n _provider_configurations = []\n if (defined(invoker.provider_configurations)) {\n _provider_configurations = invoker.provider_configurations\n }\n\n _processors = []\n _enable_interface_jars_javac = true\n if (defined(invoker.processors_javac)) {\n _processors = invoker.processors_javac\n _enable_interface_jars_javac = _processors == []\n }\n\n _processor_args = []\n if (defined(invoker.processor_args_javac)) {\n _processor_args = invoker.processor_args_javac\n }\n\n _additional_jar_files = []\n if (defined(invoker.additional_jar_files)) {\n _additional_jar_files = invoker.additional_jar_files\n }\n\n if (defined(invoker.enable_incremental_javac_override)) {\n # Use invoker-specified override.\n _enable_incremental_javac = invoker.enable_incremental_javac_override\n } else {\n # Default to build arg if not overridden.\n _enable_incremental_javac = enable_incremental_javac\n }\n\n _manifest_entries = []\n if (defined(invoker.manifest_entries)) {\n _manifest_entries = invoker.manifest_entries\n }\n\n _srcjar_deps = []\n if (defined(invoker.srcjar_deps)) {\n _srcjar_deps += invoker.srcjar_deps\n }\n\n _java_srcjars = []\n if (defined(invoker.srcjars)) {\n _java_srcjars = invoker.srcjars\n }\n foreach(dep, _srcjar_deps) {\n _dep_gen_dir = get_label_info(dep, \"target_gen_dir\")\n _dep_name = get_label_info(dep, \"name\")\n _java_srcjars += [ \"$_dep_gen_dir/$_dep_name.srcjar\" ]\n }\n\n # Mark srcjar_deps as used.\n assert(_srcjar_deps == [] || true)\n\n _javac_target_name = \"${target_name}__javac\"\n _process_prebuilt_target_name = \"${target_name}__process_prebuilt\"\n _ijar_target_name = \"${target_name}__ijar\"\n _final_target_name = target_name\n\n _final_jar_path = invoker.jar_path\n _javac_jar_path = \"$target_gen_dir/$target_name.javac.jar\"\n _process_prebuilt_jar_path = _final_jar_path\n _final_ijar_path = get_path_info(_final_jar_path, \"dir\") + \"/\" +\n get_path_info(_final_jar_path, \"name\") + \".interface.jar\"\n\n _emma_instrument = defined(invoker.emma_instrument) &&\n invoker.emma_instrument && invoker.java_files != []\n if (_emma_instrument) {\n _emma_instr_target_name = \"${target_name}__emma_instr\"\n _process_prebuilt_jar_path =\n \"$target_gen_dir/$target_name.process_prebuilt.jar\"\n }\n\n _rebased_build_config = rebase_path(_build_config, root_build_dir)\n _rebased_jar_path = rebase_path(_javac_jar_path, root_build_dir)\n\n action(_javac_target_name) {\n script = \"//build/android/gyp/javac.py\"\n depfile = \"$target_gen_dir/$target_name.d\"\n deps = _srcjar_deps\n if (defined(invoker.deps)) {\n deps += invoker.deps\n }\n\n outputs = [\n _javac_jar_path,\n _javac_jar_path + \".md5.stamp\",\n ]\n sources = invoker.java_files + _java_srcjars\n inputs = [\n _build_config,\n ]\n if (invoker.java_files != []) {\n inputs += [ invoker.java_sources_file ]\n }\n\n _rebased_java_srcjars = rebase_path(_java_srcjars, root_build_dir)\n _rebased_depfile = rebase_path(depfile, root_build_dir)\n args = [\n \"--depfile=$_rebased_depfile\",\n \"--jar-path=$_rebased_jar_path\",\n \"--java-srcjars=$_rebased_java_srcjars\",\n \"--java-srcjars=@FileArg($_rebased_build_config:javac:srcjars)\",\n ]\n if (_enable_interface_jars_javac) {\n args += [ \"--classpath=@FileArg($_rebased_build_config:javac:interface_classpath)\" ]\n } else {\n args +=\n [ \"--classpath=@FileArg($_rebased_build_config:javac:classpath)\" ]\n }\n if (_enable_incremental_javac) {\n args += [ \"--incremental\" ]\n deps += [ \"//third_party/jmake($default_toolchain)\" ]\n inputs += [ \"$root_build_dir/bin/jmake\" ]\n outputs += [ \"${_javac_jar_path}.pdb\" ]\n }\n if (_requires_android) {\n if (defined(invoker.alternative_android_sdk_ijar)) {\n deps += [ invoker.alternative_android_sdk_ijar_dep ]\n _android_sdk_ijar = invoker.alternative_android_sdk_ijar\n } else {\n deps += [ \"//build/android:android_ijar\" ]\n _android_sdk_ijar = \"$root_out_dir/lib.java/android.interface.jar\"\n }\n inputs += [ _android_sdk_ijar ]\n _rebased_android_sdk_ijar =\n rebase_path(_android_sdk_ijar, root_build_dir)\n args += [ \"--bootclasspath=$_rebased_android_sdk_ijar\" ]\n }\n if (use_java8) {\n args += [ \"--java-version=1.8\" ]\n } else if (_supports_android) {\n args += [ \"--java-version=1.7\" ]\n }\n foreach(e, _manifest_entries) {\n args += [ \"--manifest-entry=\" + e ]\n }\n if (_chromium_code) {\n args += [ \"--chromium-code=1\" ]\n }\n if (_enable_errorprone) {\n deps += [ \"//third_party/errorprone:chromium_errorprone\" ]\n args += [\n \"--use-errorprone-path\",\n \"bin/chromium_errorprone\",\n ]\n }\n foreach(e, _provider_configurations) {\n args += [ \"--provider-configuration=\" + rebase_path(e, root_build_dir) ]\n }\n foreach(e, _processors) {\n args += [ \"--processor=\" + e ]\n }\n foreach(e, _processor_args) {\n args += [ \"--processor-arg=\" + e ]\n }\n foreach(file_tuple, _additional_jar_files) {\n # Each element is of length two, [ path_to_file, path_to_put_in_jar ]\n inputs += [ file_tuple[0] ]\n args +=\n [ \"--additional-jar-file=\" + file_tuple[0] + \":\" + file_tuple[1] ]\n }\n if (invoker.java_files != []) {\n args += [ \"@\" + rebase_path(invoker.java_sources_file, root_build_dir) ]\n }\n }\n\n process_java_prebuilt(_process_prebuilt_target_name) {\n forward_variables_from(invoker,\n [\n \"jar_excluded_patterns\",\n \"proguard_preprocess\",\n \"proguard_preprocess_config\",\n ])\n supports_android = _supports_android\n build_config = _build_config\n input_jar_path = _javac_jar_path\n output_jar_path = _process_prebuilt_jar_path\n\n deps = [\n \":$_javac_target_name\",\n ]\n if (defined(invoker.deps)) {\n deps += invoker.deps\n }\n }\n\n if (_emma_instrument) {\n emma_instr(_emma_instr_target_name) {\n forward_variables_from(invoker,\n [\n \"deps\",\n \"java_files\",\n \"java_sources_file\",\n ])\n\n input_jar_path = _process_prebuilt_jar_path\n output_jar_path = _final_jar_path\n\n if (!defined(deps)) {\n deps = []\n }\n deps += [ \":$_process_prebuilt_target_name\" ]\n }\n }\n\n generate_interface_jar(_ijar_target_name) {\n if (!defined(invoker.proguard_preprocess) ||\n !invoker.proguard_preprocess) {\n # Always used the unfiltered .jar to create the interface jar so that\n # other targets will resolve filtered classes when depending on\n # BuildConfig, NativeLibraries, etc.\n input_jar = _javac_jar_path\n deps = [\n \":$_javac_target_name\",\n ]\n } else {\n # However, still apply pre-proguarding, since ignoring that can break\n # compiles.\n input_jar = _process_prebuilt_jar_path\n deps = [\n \":$_process_prebuilt_target_name\",\n ]\n }\n output_jar = _final_ijar_path\n }\n\n group(_final_target_name) {\n forward_variables_from(invoker, [ \"visibility\" ])\n public_deps = [\n \":$_ijar_target_name\",\n ]\n if (_emma_instrument) {\n public_deps += [ \":$_emma_instr_target_name\" ]\n } else {\n public_deps += [ \":$_process_prebuilt_target_name\" ]\n }\n }\n }\n\n template(\"java_library_impl\") {\n set_sources_assignment_filter([])\n forward_variables_from(invoker, [ \"testonly\" ])\n _accumulated_deps = []\n if (defined(invoker.deps)) {\n _accumulated_deps = invoker.deps\n }\n\n assert(defined(invoker.java_files) || defined(invoker.srcjars) ||\n defined(invoker.srcjar_deps))\n _base_path = \"$target_gen_dir/$target_name\"\n\n if (defined(invoker.output_name)) {\n _output_name = invoker.output_name\n } else {\n _output_name = target_name\n }\n\n # Jar files can be needed at runtime (by Robolectric tests or java binaries),\n # so do not put them under gen/.\n target_dir_name = get_label_info(\":$target_name\", \"dir\")\n _jar_path = \"$root_out_dir/lib.java$target_dir_name/$_output_name.jar\"\n if (defined(invoker.jar_path)) {\n _jar_path = invoker.jar_path\n }\n _template_name = target_name\n\n _final_deps = []\n\n _supports_android =\n defined(invoker.supports_android) && invoker.supports_android\n _requires_android =\n defined(invoker.requires_android) && invoker.requires_android\n assert(_requires_android || true) # Mark as used.\n _android_manifest = \"//build/android/AndroidManifest.xml\"\n if (defined(invoker.android_manifest)) {\n _android_manifest = invoker.android_manifest\n }\n assert(_android_manifest != \"\") # Mark as used.\n\n if (defined(invoker.run_findbugs_override)) {\n _run_findbugs = invoker.run_findbugs_override\n } else {\n _run_findbugs = run_findbugs # Default to build arg if not overridden.\n }\n assert(_run_findbugs || true) # Mark as used.\n\n # Don't enable coverage, lint, findbugs unless the target has some\n # non-generated files.\n if (defined(invoker.chromium_code)) {\n _chromium_code = invoker.chromium_code\n } else {\n _chromium_code = defined(invoker.java_files) && invoker.java_files != []\n if (_chromium_code) {\n # Make chromium_code = false be the default for targets within\n # third_party which contain no chromium-namespaced java files.\n set_sources_assignment_filter([ \"*\\bthird_party\\b*\" ])\n sources = [\n get_label_info(\":$target_name\", \"dir\"),\n ]\n if (sources == []) {\n set_sources_assignment_filter([ \"*\\bchromium\\b*\" ])\n sources = invoker.java_files\n _chromium_code = invoker.java_files != sources\n }\n set_sources_assignment_filter([])\n sources = []\n }\n }\n\n _emma_never_instrument = !_chromium_code\n if (defined(invoker.emma_never_instrument)) {\n _emma_never_instrument = invoker.emma_never_instrument\n }\n assert(_emma_never_instrument || true) # Mark as used\n _emma_instrument = emma_coverage && !_emma_never_instrument\n\n if (_supports_android) {\n _dex_path = _base_path + \".dex.jar\"\n if (defined(invoker.dex_path)) {\n _dex_path = invoker.dex_path\n }\n }\n\n _java_files = []\n if (defined(invoker.java_files)) {\n _java_files += invoker.java_files\n }\n if (_java_files != []) {\n _java_sources_file = \"$_base_path.sources\"\n write_file(_java_sources_file, rebase_path(_java_files, root_build_dir))\n }\n\n # Define build_config_deps which will be a list of targets required to\n # build the _build_config.\n if (defined(invoker.override_build_config)) {\n _build_config = invoker.override_build_config\n } else {\n _build_config = _base_path + \".build_config\"\n build_config_target_name = \"${_template_name}__build_config\"\n\n write_build_config(build_config_target_name) {\n forward_variables_from(invoker,\n [\n \"gradle_treat_as_prebuilt\",\n \"input_jars_paths\",\n \"main_class\",\n \"proguard_configs\",\n ])\n if (defined(invoker.is_java_binary) && invoker.is_java_binary) {\n type = \"java_binary\"\n } else {\n type = \"java_library\"\n }\n if (defined(invoker.deps)) {\n possible_config_deps = invoker.deps\n }\n supports_android = _supports_android\n requires_android = _requires_android\n bypass_platform_checks = defined(invoker.bypass_platform_checks) &&\n invoker.bypass_platform_checks\n\n build_config = _build_config\n jar_path = _jar_path\n if (_supports_android) {\n dex_path = _dex_path\n }\n if (_java_files != []) {\n java_sources_file = _java_sources_file\n }\n\n if (defined(invoker.srcjar_deps)) {\n bundled_srcjars = []\n foreach(d, invoker.srcjar_deps) {\n _dep_gen_dir = get_label_info(d, \"target_gen_dir\")\n _dep_name = get_label_info(d, \"name\")\n bundled_srcjars += [ \"$_dep_gen_dir/$_dep_name.srcjar\" ]\n }\n }\n }\n _accumulated_deps += [ \":$build_config_target_name\" ]\n }\n\n _srcjar_deps = []\n if (defined(invoker.srcjar_deps)) {\n _srcjar_deps = invoker.srcjar_deps\n }\n\n _srcjars = []\n if (defined(invoker.srcjars)) {\n _srcjars = invoker.srcjars\n }\n\n assert(_java_files != [] || _srcjar_deps != [] || _srcjars != [])\n\n _compile_java_target = \"${_template_name}__compile_java\"\n _final_deps += [ \":$_compile_java_target\" ]\n compile_java(_compile_java_target) {\n forward_variables_from(invoker,\n [\n \"additional_jar_files\",\n \"alternative_android_sdk_ijar\",\n \"alternative_android_sdk_ijar_dep\",\n \"dist_jar_path\",\n \"enable_errorprone\",\n \"enable_incremental_javac_override\",\n \"jar_excluded_patterns\",\n \"manifest_entries\",\n \"processors_javac\",\n \"processor_args_javac\",\n \"proguard_preprocess_config\",\n \"proguard_preprocess\",\n \"provider_configurations\",\n ])\n jar_path = _jar_path\n build_config = _build_config\n java_files = _java_files\n if (_java_files != []) {\n java_sources_file = _java_sources_file\n }\n srcjar_deps = _srcjar_deps\n srcjars = _srcjars\n chromium_code = _chromium_code\n supports_android = _supports_android\n requires_android = _requires_android\n emma_instrument = _emma_instrument\n deps = _accumulated_deps\n }\n _accumulated_deps += [ \":$_compile_java_target\" ]\n assert(_accumulated_deps != []) # Mark used.\n\n if (defined(invoker.main_class)) {\n # Targets might use the generated script while building, so make it a dep\n # rather than a data_dep.\n _final_deps += [ \":${_template_name}__java_binary_script\" ]\n java_binary_script(\"${_template_name}__java_binary_script\") {\n forward_variables_from(invoker,\n [\n \"bootclasspath\",\n \"main_class\",\n \"wrapper_script_args\",\n ])\n build_config = _build_config\n jar_path = _jar_path\n script_name = _template_name\n if (defined(invoker.wrapper_script_name)) {\n script_name = invoker.wrapper_script_name\n }\n deps = _accumulated_deps\n }\n }\n\n _has_lint_target = false\n if (_supports_android) {\n if (_chromium_code) {\n _has_lint_target = true\n android_lint(\"${_template_name}__lint\") {\n android_manifest = _android_manifest\n build_config = _build_config\n jar_path = _jar_path\n java_files = _java_files\n if (_java_files != []) {\n java_sources_file = _java_sources_file\n }\n deps = _accumulated_deps\n }\n\n if (_run_findbugs) {\n findbugs(\"${_template_name}__findbugs\") {\n build_config = _build_config\n jar_path = _jar_path\n deps = _accumulated_deps\n }\n }\n\n # Use an intermediate group() rather as the data_deps target in order to\n # avoid lint artifacts showing up as runtime_deps (while still having lint\n # run in parallel to other targets).\n group(\"${_template_name}__analysis\") {\n public_deps = [\n \":${_template_name}__lint\",\n ]\n if (_run_findbugs) {\n public_deps += [ \":${_template_name}__findbugs\" ]\n }\n }\n }\n\n _final_deps += [ \":${_template_name}__dex\" ]\n dex(\"${_template_name}__dex\") {\n sources = [\n _jar_path,\n ]\n output = _dex_path\n deps = [\n \":$_compile_java_target\",\n ]\n }\n }\n\n group(target_name) {\n forward_variables_from(invoker,\n [\n \"data\",\n \"data_deps\",\n \"visibility\",\n ])\n if (!defined(data_deps)) {\n data_deps = []\n }\n public_deps = _final_deps\n if (_has_lint_target) {\n data_deps += [ \":${_template_name}__analysis\" ]\n }\n }\n }\n\n # Runs process_resources.py\n template(\"process_resources\") {\n set_sources_assignment_filter([])\n forward_variables_from(invoker, [ \"testonly\" ])\n\n zip_path = invoker.zip_path\n srcjar_path = invoker.srcjar_path\n r_text_path = invoker.r_text_path\n build_config = invoker.build_config\n android_manifest = invoker.android_manifest\n\n non_constant_id = true\n if (defined(invoker.generate_constant_ids) &&\n invoker.generate_constant_ids) {\n non_constant_id = false\n }\n\n action(target_name) {\n forward_variables_from(invoker,\n [\n \"deps\",\n \"visibility\",\n ])\n script = \"//build/android/gyp/process_resources.py\"\n\n depfile = \"$target_gen_dir/$target_name.d\"\n outputs = [\n zip_path,\n srcjar_path,\n r_text_path,\n ]\n\n _all_resource_dirs = []\n sources = []\n\n if (defined(invoker.resource_dirs)) {\n _all_resource_dirs += invoker.resource_dirs\n\n # Speed up \"gn gen\" by short-circuiting the empty directory.\n if (invoker.resource_dirs != [ \"//build/android/ant/empty/res\" ] &&\n invoker.resource_dirs != []) {\n _sources_build_rel =\n exec_script(\"//build/android/gyp/find.py\",\n rebase_path(invoker.resource_dirs, root_build_dir),\n \"list lines\")\n sources += rebase_path(_sources_build_rel, \".\", root_build_dir)\n }\n }\n\n if (defined(invoker.generated_resource_dirs)) {\n assert(defined(invoker.generated_resource_files))\n _all_resource_dirs += invoker.generated_resource_dirs\n sources += invoker.generated_resource_files\n }\n\n inputs = [\n build_config,\n android_manifest,\n ]\n\n _rebased_all_resource_dirs =\n rebase_path(_all_resource_dirs, root_build_dir)\n rebase_build_config = rebase_path(build_config, root_build_dir)\n\n if (defined(invoker.android_aapt_path)) {\n _android_aapt_path = invoker.android_aapt_path\n } else {\n _android_aapt_path = android_default_aapt_path\n }\n\n if (defined(invoker.alternative_android_sdk_jar)) {\n _rebased_android_sdk_jar =\n rebase_path(invoker.alternative_android_sdk_jar)\n } else {\n _rebased_android_sdk_jar = rebased_android_sdk_jar\n }\n\n args = [\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n \"--android-sdk-jar\",\n _rebased_android_sdk_jar,\n \"--aapt-path\",\n _android_aapt_path,\n \"--android-manifest\",\n rebase_path(android_manifest, root_build_dir),\n \"--resource-dirs=$_rebased_all_resource_dirs\",\n \"--srcjar-out\",\n rebase_path(srcjar_path, root_build_dir),\n \"--resource-zip-out\",\n rebase_path(zip_path, root_build_dir),\n \"--r-text-out\",\n rebase_path(r_text_path, root_build_dir),\n \"--dependencies-res-zips=@FileArg($rebase_build_config:resources:dependency_zips)\",\n \"--extra-res-packages=@FileArg($rebase_build_config:resources:extra_package_names)\",\n \"--extra-r-text-files=@FileArg($rebase_build_config:resources:extra_r_text_files)\",\n ]\n\n if (non_constant_id) {\n args += [ \"--non-constant-id\" ]\n }\n\n if (defined(invoker.custom_package)) {\n args += [\n \"--custom-package\",\n invoker.custom_package,\n ]\n }\n\n if (defined(invoker.v14_skip) && invoker.v14_skip) {\n args += [ \"--v14-skip\" ]\n }\n\n if (defined(invoker.shared_resources) && invoker.shared_resources) {\n args += [ \"--shared-resources\" ]\n }\n\n if (defined(invoker.app_as_shared_lib) && invoker.app_as_shared_lib) {\n args += [ \"--app-as-shared-lib\" ]\n }\n\n if (defined(invoker.include_all_resources) &&\n invoker.include_all_resources) {\n args += [ \"--include-all-resources\" ]\n }\n\n if (defined(invoker.all_resources_zip_path)) {\n all_resources_zip = invoker.all_resources_zip_path\n outputs += [ all_resources_zip ]\n args += [\n \"--all-resources-zip-out\",\n rebase_path(all_resources_zip, root_build_dir),\n ]\n }\n\n if (defined(invoker.proguard_file)) {\n outputs += [ invoker.proguard_file ]\n args += [\n \"--proguard-file\",\n rebase_path(invoker.proguard_file, root_build_dir),\n ]\n }\n\n if (defined(invoker.args)) {\n args += invoker.args\n }\n }\n }\n\n # Produces a single .dex.jar out of a set of Java dependencies.\n template(\"deps_dex\") {\n set_sources_assignment_filter([])\n build_config = \"$target_gen_dir/${target_name}.build_config\"\n build_config_target_name = \"${target_name}__build_config\"\n\n write_build_config(build_config_target_name) {\n forward_variables_from(invoker, [ \"dex_path\" ])\n if (defined(invoker.deps)) {\n possible_config_deps = invoker.deps\n }\n type = \"deps_dex\"\n build_config = build_config\n }\n\n rebased_build_config = rebase_path(build_config, root_build_dir)\n dex(target_name) {\n inputs = [\n build_config,\n ]\n output = invoker.dex_path\n dex_arg_key = \"${rebased_build_config}:final_dex:dependency_dex_files\"\n args = [ \"--inputs=@FileArg($dex_arg_key)\" ]\n if (defined(invoker.excluded_jars)) {\n excluded_jars = rebase_path(invoker.excluded_jars, root_build_dir)\n args += [ \"--excluded-paths=${excluded_jars}\" ]\n }\n deps = [\n \":$build_config_target_name\",\n ]\n }\n }\n\n # Creates an AndroidManifest.xml for an APK split.\n template(\"generate_split_manifest\") {\n assert(defined(invoker.main_manifest))\n assert(defined(invoker.out_manifest))\n assert(defined(invoker.split_name))\n\n action(target_name) {\n forward_variables_from(invoker,\n [\n \"deps\",\n \"testonly\",\n ])\n depfile = \"$target_gen_dir/$target_name.d\"\n args = [\n \"--main-manifest\",\n rebase_path(invoker.main_manifest, root_build_dir),\n \"--out-manifest\",\n rebase_path(invoker.out_manifest, root_build_dir),\n \"--split\",\n invoker.split_name,\n ]\n if (defined(invoker.version_code)) {\n args += [\n \"--version-code\",\n invoker.version_code,\n ]\n }\n if (defined(invoker.version_name)) {\n args += [\n \"--version-name\",\n invoker.version_name,\n ]\n }\n if (defined(invoker.has_code)) {\n args += [\n \"--has-code\",\n invoker.has_code,\n ]\n }\n args += [\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n ]\n\n script = \"//build/android/gyp/generate_split_manifest.py\"\n outputs = [\n invoker.out_manifest,\n ]\n inputs = [\n invoker.main_manifest,\n ]\n }\n }\n\n template(\"pack_relocation_section\") {\n assert(defined(invoker.file_list_json))\n assert(defined(invoker.libraries_filearg))\n action(target_name) {\n forward_variables_from(invoker,\n [\n \"deps\",\n \"public_deps\",\n \"inputs\",\n \"testonly\",\n ])\n script = \"//build/android/gyp/pack_relocations.py\"\n depfile = \"$target_gen_dir/$target_name.d\"\n _packed_libraries_dir = \"$target_gen_dir/$target_name/packed-libs\"\n outputs = [\n invoker.file_list_json,\n ]\n deps += [ relocation_packer_target ]\n\n args = [\n \"--depfile\",\n rebase_path(depfile, root_build_dir),\n \"--enable-packing=1\",\n \"--android-pack-relocations\",\n rebase_path(relocation_packer_exe, root_build_dir),\n \"--stripped-libraries-dir\",\n rebase_path(root_build_dir, root_build_dir),\n \"--packed-libraries-dir\",\n rebase_path(_packed_libraries_dir, root_build_dir),\n \"--libraries=${invoker.libraries_filearg}\",\n \"--filelistjson\",\n rebase_path(invoker.file_list_json, root_build_dir),\n ]\n }\n }\n}\n" }, { "path": "src/test/resources/samples/langs/GN/ios-rules.gni", "content": "# Copyright 2015 The Chromium Authors. All rights reserved.\n# Use of this source code is governed by a BSD-style license that can be\n# found in the LICENSE file.\n\nimport(\"//build/config/ios/ios_sdk.gni\")\nimport(\"//build/config/mac/base_rules.gni\")\nimport(\"//build/config/mac/symbols.gni\")\nimport(\"//build/toolchain/toolchain.gni\")\n\n# Invokes lipo on multiple arch-specific binaries to create a fat binary.\n#\n# Arguments\n#\n# arch_binary_target\n# name of the target generating the arch-specific binaries, they must\n# be named $target_out_dir/$toolchain_cpu/$arch_binary_output.\n#\n# arch_binary_output\n# (optional, defaults to the name of $arch_binary_target) base name of\n# the arch-specific binary generated by arch_binary_target.\n#\n# output_name\n# (optional, defaults to $target_name) base name of the target output,\n# the full path will be $target_out_dir/$output_name.\n#\n# configs\n# (optional) a list of configurations, this is used to check whether\n# the binary should be stripped, when \"enable_stripping\" is true.\n#\ntemplate(\"lipo_binary\") {\n assert(defined(invoker.arch_binary_target),\n \"arch_binary_target must be defined for $target_name\")\n\n _target_name = target_name\n _output_name = target_name\n if (defined(invoker.output_name)) {\n _output_name = invoker.output_name\n }\n\n _all_target_cpu = [ current_cpu ] + additional_target_cpus\n _all_toolchains = [ current_toolchain ] + additional_toolchains\n\n _arch_binary_target = invoker.arch_binary_target\n _arch_binary_output = get_label_info(_arch_binary_target, \"name\")\n if (defined(invoker.arch_binary_output)) {\n _arch_binary_output = invoker.arch_binary_output\n }\n\n action(_target_name) {\n forward_variables_from(invoker,\n \"*\",\n [\n \"arch_binary_output\",\n \"arch_binary_target\",\n \"configs\",\n \"output_name\",\n ])\n\n script = \"//build/toolchain/mac/linker_driver.py\"\n\n outputs = [\n \"$target_out_dir/$_output_name\",\n ]\n\n deps = []\n _index = 0\n inputs = []\n foreach(_cpu, _all_target_cpu) {\n _toolchain = _all_toolchains[_index]\n _index = _index + 1\n\n inputs +=\n [ get_label_info(\"$_arch_binary_target($_toolchain)\",\n \"target_out_dir\") + \"/$_cpu/$_arch_binary_output\" ]\n\n deps += [ \"$_arch_binary_target($_toolchain)\" ]\n }\n\n args = []\n if (!use_system_xcode) {\n args += [\n \"--developer_dir\",\n hermetic_xcode_path,\n ]\n }\n args += [\n \"xcrun\",\n \"lipo\",\n \"-create\",\n \"-output\",\n rebase_path(\"$target_out_dir/$_output_name\", root_build_dir),\n ] + rebase_path(inputs, root_build_dir)\n\n if (enable_dsyms) {\n _dsyms_output_dir = \"$root_out_dir/$_output_name.dSYM\"\n outputs += [\n \"$_dsyms_output_dir/\",\n \"$_dsyms_output_dir/Contents/Info.plist\",\n \"$_dsyms_output_dir/Contents/Resources/DWARF/$_output_name\",\n ]\n args += [ \"-Wcrl,dsym,\" + rebase_path(\"$root_out_dir/.\", root_build_dir) ]\n }\n\n if (enable_stripping) {\n # Check whether //build/config/mac:strip_all has been removed from the\n # configs variables (as this is how stripping is disabled for a single\n # target).\n _strip_all_in_config = false\n if (defined(invoker.configs)) {\n foreach(_config, invoker.configs) {\n if (_config == \"//build/config/mac:strip_all\") {\n _strip_all_in_config = true\n }\n }\n }\n\n if (_strip_all_in_config) {\n args += [ \"-Wcrl,strip,-x,-S\" ]\n if (save_unstripped_output) {\n outputs += [ \"$root_out_dir/$_output_name.unstripped\" ]\n args += [ \"-Wcrl,unstripped,\" +\n rebase_path(\"$root_out_dir/.\", root_build_dir) ]\n }\n }\n }\n }\n}\n\n# Wrapper around create_bundle taking care of code signature settings.\n#\n# Arguments\n#\n# product_type\n# string, product type for the generated Xcode project.\n#\n# bundle_deps\n# (optional) list of additional dependencies\n#\n# bundle_deps_filter\n# (optional) list of dependencies to filter (for more information\n# see \"gn help bundle_deps_filter\")\n#\n# bundle_extension\n# string, extension of the bundle, used to generate bundle name.\n#\n# bundle_binary_target\n# string, label of the target generating the bundle main binary.\n#\n# bundle_binary_output\n# (optional) string, base name of the binary generated by the\n# bundle_binary_target target, defaults to the target name.\n#\n# extra_system_frameworks\n# (optional) list of system framework to copy to the bundle.\n#\n# enable_code_signing\n# (optional) boolean, control whether code signing is enabled or not,\n# default to ios_enable_code_signing if not defined.\n#\n# entitlements_path:\n# (optional) path to the template to use to generate the application\n# entitlements by performing variable substitutions, defaults to\n# //build/config/ios/entitlements.plist.\n#\n# entitlements_target:\n# (optional) label of the target generating the application\n# entitlements (must generate a single file as output); cannot be\n# defined if entitlements_path is set.\n#\ntemplate(\"create_signed_bundle\") {\n assert(defined(invoker.product_type),\n \"product_type must be defined for $target_name\")\n assert(defined(invoker.bundle_extension),\n \"bundle_extension must be defined for $target_name\")\n assert(defined(invoker.bundle_binary_target),\n \"bundle_binary_target must be defined for $target_name\")\n\n _target_name = target_name\n _output_name = target_name\n if (defined(invoker.output_name)) {\n _output_name = invoker.output_name\n }\n\n _bundle_binary_target = invoker.bundle_binary_target\n _bundle_binary_output = get_label_info(_bundle_binary_target, \"name\")\n if (defined(invoker.bundle_binary_output)) {\n _bundle_binary_output = invoker.bundle_binary_output\n }\n\n _bundle_extension = invoker.bundle_extension\n _bundle_root_dir = \"$root_out_dir/$_output_name$_bundle_extension\"\n\n if (!defined(invoker.entitlements_target)) {\n _entitlements_path = \"//build/config/ios/entitlements.plist\"\n if (defined(invoker.entitlements_path)) {\n _entitlements_path = invoker.entitlements_path\n }\n } else {\n assert(!defined(invoker.entitlements_path),\n \"Cannot define both entitlements_path and entitlements_target \" +\n \"for $target_name\")\n\n _entitlements_target_outputs =\n get_target_outputs(invoker.entitlements_target)\n _entitlements_path = _entitlements_target_outputs[0]\n }\n\n _enable_code_signing = ios_enable_code_signing\n if (defined(invoker.enable_code_signing)) {\n _enable_code_signing = invoker.enable_code_signing\n }\n\n create_bundle(_target_name) {\n forward_variables_from(invoker,\n [\n \"bundle_deps_filter\",\n \"data_deps\",\n \"deps\",\n \"product_type\",\n \"public_configs\",\n \"public_deps\",\n \"testonly\",\n \"visibility\",\n ])\n\n bundle_root_dir = _bundle_root_dir\n bundle_resources_dir = _bundle_root_dir\n bundle_executable_dir = _bundle_root_dir\n bundle_plugins_dir = \"$_bundle_root_dir/PlugIns\"\n\n if (!defined(public_deps)) {\n public_deps = []\n }\n public_deps += [ _bundle_binary_target ]\n\n if (defined(invoker.bundle_deps)) {\n if (!defined(deps)) {\n deps = []\n }\n deps += invoker.bundle_deps\n }\n if (defined(invoker.entitlements_target)) {\n if (!defined(deps)) {\n deps = []\n }\n deps += [ invoker.entitlements_target ]\n }\n\n code_signing_script = \"//build/config/ios/codesign.py\"\n code_signing_sources = [\n _entitlements_path,\n get_label_info(_bundle_binary_target, \"target_out_dir\") +\n \"/$_bundle_binary_output\",\n ]\n code_signing_outputs = [ \"$_bundle_root_dir/$_output_name\" ]\n if (_enable_code_signing) {\n code_signing_outputs +=\n [ \"$_bundle_root_dir/_CodeSignature/CodeResources\" ]\n }\n if (ios_code_signing_identity != \"\" && !use_ios_simulator) {\n code_signing_outputs += [ \"$_bundle_root_dir/embedded.mobileprovision\" ]\n }\n\n if (defined(invoker.extra_system_frameworks)) {\n foreach(_framework, invoker.extra_system_frameworks) {\n code_signing_outputs += [ \"$bundle_root_dir/Frameworks/\" +\n get_path_info(_framework, \"file\") ]\n }\n }\n\n code_signing_args = []\n if (!use_system_xcode) {\n code_signing_args += [\n \"--developer_dir\",\n hermetic_xcode_path,\n ]\n }\n code_signing_args += [\n \"code-sign-bundle\",\n \"-t=\" + ios_sdk_name,\n \"-i=\" + ios_code_signing_identity,\n \"-e=\" + rebase_path(_entitlements_path, root_build_dir),\n \"-b=\" + rebase_path(\"$target_out_dir/$_output_name\", root_build_dir),\n rebase_path(bundle_root_dir, root_build_dir),\n ]\n if (!_enable_code_signing) {\n code_signing_args += [ \"--disable-code-signature\" ]\n }\n if (defined(invoker.extra_system_frameworks)) {\n # All framework in extra_system_frameworks are expected to be\n # system framework and the path to be already system absolute\n # so do not use rebase_path here.\n foreach(_framework, invoker.extra_system_frameworks) {\n code_signing_args += [ \"-F=\" + _framework ]\n }\n }\n }\n}\n\n# Generates Info.plist files for Mac apps and frameworks.\n#\n# Arguments\n#\n# info_plist:\n# (optional) string, path to the Info.plist file that will be used for\n# the bundle.\n#\n# info_plist_target:\n# (optional) string, if the info_plist is generated from an action,\n# rather than a regular source file, specify the target name in lieu\n# of info_plist. The two arguments are mutually exclusive.\n#\n# executable_name:\n# string, name of the generated target used for the product\n# and executable name as specified in the output Info.plist.\n#\n# extra_substitutions:\n# (optional) string array, 'key=value' pairs for extra fields which are\n# specified in a source Info.plist template.\ntemplate(\"ios_info_plist\") {\n assert(defined(invoker.info_plist) != defined(invoker.info_plist_target),\n \"Only one of info_plist or info_plist_target may be specified in \" +\n target_name)\n\n if (defined(invoker.info_plist)) {\n _info_plist = invoker.info_plist\n } else {\n _info_plist_target_output = get_target_outputs(invoker.info_plist_target)\n _info_plist = _info_plist_target_output[0]\n }\n\n info_plist(target_name) {\n format = \"binary1\"\n extra_substitutions = []\n if (defined(invoker.extra_substitutions)) {\n extra_substitutions = invoker.extra_substitutions\n }\n extra_substitutions += [\n \"IOS_BUNDLE_ID_PREFIX=$ios_app_bundle_id_prefix\",\n \"IOS_DEPLOYMENT_TARGET=$ios_deployment_target\",\n \"IOS_PLATFORM_BUILD=$ios_platform_build\",\n \"IOS_PLATFORM_NAME=$ios_sdk_name\",\n \"IOS_PLATFORM_VERSION=$ios_sdk_version\",\n \"IOS_SDK_BUILD=$ios_sdk_build\",\n \"IOS_SDK_NAME=$ios_sdk_name$ios_sdk_version\",\n \"IOS_SUPPORTED_PLATFORM=$ios_sdk_platform\",\n ]\n plist_templates = [\n \"//build/config/ios/BuildInfo.plist\",\n _info_plist,\n ]\n if (defined(invoker.info_plist_target)) {\n deps = [\n invoker.info_plist_target,\n ]\n }\n forward_variables_from(invoker,\n [\n \"executable_name\",\n \"output_name\",\n \"visibility\",\n ])\n }\n}\n\n# Template to build an application bundle for iOS.\n#\n# This should be used instead of \"executable\" built-in target type on iOS.\n# As the template forward the generation of the application executable to\n# an \"executable\" target, all arguments supported by \"executable\" targets\n# are also supported by this template.\n#\n# Arguments\n#\n# output_name:\n# (optional) string, name of the generated application, if omitted,\n# defaults to the target_name.\n#\n# extra_substitutions:\n# (optional) list of string in \"key=value\" format, each value will\n# be used as an additional variable substitution rule when generating\n# the application Info.plist\n#\n# info_plist:\n# (optional) string, path to the Info.plist file that will be used for\n# the bundle.\n#\n# info_plist_target:\n# (optional) string, if the info_plist is generated from an action,\n# rather than a regular source file, specify the target name in lieu\n# of info_plist. The two arguments are mutually exclusive.\n#\n# entitlements_path:\n# (optional) path to the template to use to generate the application\n# entitlements by performing variable substitutions, defaults to\n# //build/config/ios/entitlements.plist.\n#\n# entitlements_target:\n# (optional) label of the target generating the application\n# entitlements (must generate a single file as output); cannot be\n# defined if entitlements_path is set.\n#\n# bundle_extension:\n# (optional) bundle extension including the dot, default to \".app\".\n#\n# product_type\n# (optional) string, product type for the generated Xcode project,\n# default to \"com.apple.product-type.application\". Should generally\n# not be overridden.\n#\n# enable_code_signing\n# (optional) boolean, control whether code signing is enabled or not,\n# default to ios_enable_code_signing if not defined.\n#\n# For more information, see \"gn help executable\".\ntemplate(\"ios_app_bundle\") {\n _output_name = target_name\n _target_name = target_name\n if (defined(invoker.output_name)) {\n _output_name = invoker.output_name\n }\n\n _arch_executable_source = _target_name + \"_arch_executable_sources\"\n _arch_executable_target = _target_name + \"_arch_executable\"\n _lipo_executable_target = _target_name + \"_executable\"\n\n source_set(_arch_executable_source) {\n forward_variables_from(invoker,\n \"*\",\n [\n \"bundle_deps\",\n \"bundle_deps_filter\",\n \"bundle_extension\",\n \"enable_code_signing\",\n \"entitlements_path\",\n \"entitlements_target\",\n \"extra_substitutions\",\n \"extra_system_frameworks\",\n \"info_plist\",\n \"info_plist_target\",\n \"output_name\",\n \"product_type\",\n \"visibility\",\n ])\n\n visibility = [ \":$_arch_executable_target\" ]\n }\n\n if (current_toolchain == default_toolchain || use_ios_simulator) {\n _generate_entitlements_target = _target_name + \"_gen_entitlements\"\n _generate_entitlements_output =\n get_label_info(\":$_generate_entitlements_target($default_toolchain)\",\n \"target_out_dir\") + \"/$_output_name.xcent\"\n }\n\n executable(_arch_executable_target) {\n forward_variables_from(invoker,\n \"*\",\n [\n \"bundle_deps\",\n \"bundle_deps_filter\",\n \"bundle_extension\",\n \"enable_code_signing\",\n \"entitlements_path\",\n \"entitlements_target\",\n \"extra_substitutions\",\n \"extra_system_frameworks\",\n \"info_plist\",\n \"info_plist_target\",\n \"output_name\",\n \"product_type\",\n \"sources\",\n \"visibility\",\n ])\n\n visibility = [ \":$_lipo_executable_target($default_toolchain)\" ]\n if (current_toolchain != default_toolchain) {\n visibility += [ \":$_target_name\" ]\n }\n\n if (!defined(deps)) {\n deps = []\n }\n deps += [ \":$_arch_executable_source\" ]\n\n if (!defined(libs)) {\n libs = []\n }\n libs += [ \"UIKit.framework\" ]\n\n if (!defined(ldflags)) {\n ldflags = []\n }\n ldflags += [\n \"-Xlinker\",\n \"-rpath\",\n \"-Xlinker\",\n \"@executable_path/Frameworks\",\n \"-Xlinker\",\n \"-objc_abi_version\",\n \"-Xlinker\",\n \"2\",\n ]\n\n if (use_ios_simulator) {\n deps += [ \":$_generate_entitlements_target($default_toolchain)\" ]\n\n if (!defined(inputs)) {\n inputs = []\n }\n inputs += [ _generate_entitlements_output ]\n\n if (!defined(ldflags)) {\n ldflags = []\n }\n ldflags += [\n \"-Xlinker\",\n \"-sectcreate\",\n \"-Xlinker\",\n \"__TEXT\",\n \"-Xlinker\",\n \"__entitlements\",\n \"-Xlinker\",\n rebase_path(_generate_entitlements_output, root_build_dir),\n ]\n }\n\n output_name = _output_name\n output_prefix_override = true\n output_dir = \"$target_out_dir/$current_cpu\"\n }\n\n if (current_toolchain != default_toolchain) {\n # For fat builds, only the default toolchain will generate an application\n # bundle. For the other toolchains, the template is only used for building\n # the arch-specific binary, thus the default target is just a group().\n\n group(_target_name) {\n forward_variables_from(invoker,\n [\n \"visibility\",\n \"testonly\",\n ])\n public_deps = [\n \":$_arch_executable_target\",\n ]\n }\n } else {\n lipo_binary(_lipo_executable_target) {\n forward_variables_from(invoker,\n [\n \"configs\",\n \"testonly\",\n ])\n\n visibility = [ \":$_target_name\" ]\n output_name = _output_name\n arch_binary_target = \":$_arch_executable_target\"\n arch_binary_output = _output_name\n }\n\n _generate_info_plist = target_name + \"_generate_info_plist\"\n ios_info_plist(_generate_info_plist) {\n forward_variables_from(invoker,\n [\n \"extra_substitutions\",\n \"info_plist\",\n \"info_plist_target\",\n ])\n\n executable_name = _output_name\n }\n\n if (current_toolchain == default_toolchain) {\n if (!defined(invoker.entitlements_target)) {\n _entitlements_path = \"//build/config/ios/entitlements.plist\"\n if (defined(invoker.entitlements_path)) {\n _entitlements_path = invoker.entitlements_path\n }\n } else {\n assert(!defined(invoker.entitlements_path),\n \"Cannot define both entitlements_path and entitlements_target\" +\n \"for $_target_name\")\n\n _entitlements_target_outputs =\n get_target_outputs(invoker.entitlements_target)\n _entitlements_path = _entitlements_target_outputs[0]\n }\n\n action(_generate_entitlements_target) {\n _gen_info_plist_outputs = get_target_outputs(\":$_generate_info_plist\")\n _info_plist_path = _gen_info_plist_outputs[0]\n\n script = \"//build/config/ios/codesign.py\"\n deps = [\n \":$_generate_info_plist\",\n ]\n if (defined(invoker.entitlements_target)) {\n deps += [ invoker.entitlements_target ]\n }\n sources = [\n _entitlements_path,\n _info_plist_path,\n ]\n outputs = [\n _generate_entitlements_output,\n ]\n\n args = []\n if (!use_system_xcode) {\n args += [\n \"--developer_dir\",\n hermetic_xcode_path,\n ]\n }\n args += [\n \"generate-entitlements\",\n \"-e=\" + rebase_path(_entitlements_path, root_build_dir),\n \"-p=\" + rebase_path(_info_plist_path, root_build_dir),\n ] + rebase_path(outputs, root_build_dir)\n }\n }\n\n _bundle_data_info_plist = target_name + \"_bundle_data_info_plist\"\n bundle_data(_bundle_data_info_plist) {\n forward_variables_from(invoker, [ \"testonly\" ])\n\n sources = get_target_outputs(\":$_generate_info_plist\")\n outputs = [\n \"{{bundle_root_dir}}/Info.plist\",\n ]\n public_deps = [\n \":$_generate_info_plist\",\n ]\n }\n\n create_signed_bundle(_target_name) {\n forward_variables_from(invoker,\n [\n \"bundle_deps\",\n \"bundle_deps_filter\",\n \"bundle_extension\",\n \"data_deps\",\n \"deps\",\n \"enable_code_signing\",\n \"entitlements_path\",\n \"entitlements_target\",\n \"extra_system_frameworks\",\n \"product_type\",\n \"public_configs\",\n \"public_deps\",\n \"testonly\",\n \"visibility\",\n ])\n\n output_name = _output_name\n bundle_binary_target = \":$_lipo_executable_target\"\n bundle_binary_output = _output_name\n\n if (!defined(bundle_deps)) {\n bundle_deps = []\n }\n bundle_deps += [ \":$_bundle_data_info_plist\" ]\n\n if (use_ios_simulator) {\n if (!defined(data_deps)) {\n data_deps = []\n }\n data_deps += [ \"//testing/iossim\" ]\n }\n\n if (!defined(product_type)) {\n product_type = \"com.apple.product-type.application\"\n }\n\n if (!defined(bundle_extension)) {\n bundle_extension = \".app\"\n }\n }\n }\n}\n\nset_defaults(\"ios_app_bundle\") {\n configs = default_executable_configs\n}\n\n# Template to build an application extension bundle for iOS.\n#\n# This should be used instead of \"executable\" built-in target type on iOS.\n# As the template forward the generation of the application executable to\n# an \"executable\" target, all arguments supported by \"executable\" targets\n# are also supported by this template.\n#\n# Arguments\n#\n# output_name:\n# (optional) string, name of the generated application, if omitted,\n# defaults to the target_name.\n#\n# extra_substitutions:\n# (optional) list of string in \"key=value\" format, each value will\n# be used as an additional variable substitution rule when generating\n# the application Info.plist\n#\n# info_plist:\n# (optional) string, path to the Info.plist file that will be used for\n# the bundle.\n#\n# info_plist_target:\n# (optional) string, if the info_plist is generated from an action,\n# rather than a regular source file, specify the target name in lieu\n# of info_plist. The two arguments are mutually exclusive.\n#\n# For more information, see \"gn help executable\".\ntemplate(\"ios_appex_bundle\") {\n ios_app_bundle(target_name) {\n forward_variables_from(invoker,\n \"*\",\n [\n \"bundle_extension\",\n \"product_type\",\n ])\n bundle_extension = \".appex\"\n product_type = \"com.apple.product-type.app-extension\"\n\n # Add linker flags required for an application extension (determined by\n # inspecting the link command-line when using Xcode 9.0+).\n if (!defined(ldflags)) {\n ldflags = []\n }\n ldflags += [\n \"-e\",\n \"_NSExtensionMain\",\n \"-fapplication-extension\",\n ]\n }\n}\n\nset_defaults(\"ios_appex_bundle\") {\n configs = default_executable_configs\n}\n\n# Compile a xib or storyboard file and add it to a bundle_data so that it is\n# available at runtime in the bundle.\n#\n# Arguments\n#\n# source:\n# string, path of the xib or storyboard to compile.\n#\n# Forwards all variables to the bundle_data target.\ntemplate(\"bundle_data_xib\") {\n assert(defined(invoker.source), \"source needs to be defined for $target_name\")\n\n _source_extension = get_path_info(invoker.source, \"extension\")\n assert(_source_extension == \"xib\" || _source_extension == \"storyboard\",\n \"source must be a .xib or .storyboard for $target_name\")\n\n _target_name = target_name\n _compile_xib = target_name + \"_compile_xib\"\n\n compile_xibs(_compile_xib) {\n sources = [\n invoker.source,\n ]\n visibility = [ \":$_target_name\" ]\n ibtool_flags = [\n \"--minimum-deployment-target\",\n ios_deployment_target,\n \"--auto-activate-custom-fonts\",\n \"--target-device\",\n \"iphone\",\n \"--target-device\",\n \"ipad\",\n ]\n }\n\n bundle_data(_target_name) {\n forward_variables_from(invoker, \"*\", [ \"source\" ])\n\n if (!defined(public_deps)) {\n public_deps = []\n }\n public_deps += [ \":$_compile_xib\" ]\n\n sources = get_target_outputs(\":$_compile_xib\")\n\n outputs = [\n \"{{bundle_resources_dir}}/{{source_file_part}}\",\n ]\n }\n}\n\n# Compile a strings file and add it to a bundle_data so that it is available\n# at runtime in the bundle.\n#\n# Arguments\n#\n# source:\n# string, path of the strings file to compile.\n#\n# output:\n# string, path of the compiled file in the final bundle.\n#\n# Forwards all variables to the bundle_data target.\ntemplate(\"bundle_data_strings\") {\n assert(defined(invoker.source), \"source needs to be defined for $target_name\")\n assert(defined(invoker.output), \"output needs to be defined for $target_name\")\n\n _source_extension = get_path_info(invoker.source, \"extension\")\n assert(_source_extension == \"strings\",\n \"source must be a .strings for $target_name\")\n\n _target_name = target_name\n _convert_target = target_name + \"_compile_strings\"\n\n convert_plist(_convert_target) {\n visibility = [ \":$_target_name\" ]\n source = invoker.source\n output =\n \"$target_gen_dir/$_target_name/\" + get_path_info(invoker.source, \"file\")\n format = \"binary1\"\n }\n\n bundle_data(_target_name) {\n forward_variables_from(invoker,\n \"*\",\n [\n \"source\",\n \"output\",\n ])\n\n if (!defined(public_deps)) {\n public_deps = []\n }\n public_deps += [ \":$_convert_target\" ]\n\n sources = get_target_outputs(\":$_convert_target\")\n\n outputs = [\n invoker.output,\n ]\n }\n}\n\n# Template to package a shared library into an iOS framework bundle.\n#\n# By default, the bundle target this template generates does not link the\n# resulting framework into anything that depends on it. If a dependency wants\n# a link-time (as well as build-time) dependency on the framework bundle,\n# depend against \"$target_name+link\". If only the build-time dependency is\n# required (e.g., for copying into another bundle), then use \"$target_name\".\n#\n# Arguments\n#\n# output_name:\n# (optional) string, name of the generated framework without the\n# .framework suffix. If omitted, defaults to target_name.\n#\n# public_headers:\n# (optional) list of paths to header file that needs to be copied\n# into the framework bundle Headers subdirectory. If omitted or\n# empty then the Headers subdirectory is not created.\n#\n# sources\n# (optional) list of files. Needs to be defined and non-empty if\n# public_headers is defined and non-empty.\n#\n# enable_code_signing\n# (optional) boolean, control whether code signing is enabled or not,\n# default to ios_enable_code_signing if not defined.\n#\n# This template provides two targets for the resulting framework bundle. The\n# link-time behavior varies depending on which of the two targets below is\n# added as a dependency:\n# - $target_name only adds a build-time dependency. Targets that depend on\n# it will not link against the framework.\n# - $target_name+link adds a build-time and link-time dependency. Targets\n# that depend on it will link against the framework.\n#\n# The build-time-only dependency is used for when a target needs to use the\n# framework either only for resources, or because the target loads it at run-\n# time, via dlopen() or NSBundle. The link-time dependency will cause the\n# dependee to have the framework loaded by dyld at launch.\n#\n# Example of build-time only dependency:\n#\n# framework_bundle(\"CoreTeleportation\") {\n# sources = [ ... ]\n# }\n#\n# bundle_data(\"core_teleportation_bundle_data\") {\n# deps = [ \":CoreTeleportation\" ]\n# sources = [ \"$root_out_dir/CoreTeleportation.framework\" ]\n# outputs = [ \"{{bundle_root_dir}}/Frameworks/{{source_file_part}}\" ]\n# }\n#\n# app_bundle(\"GoatTeleporter\") {\n# sources = [ ... ]\n# deps = [\n# \":core_teleportation_bundle_data\",\n# ]\n# }\n#\n# The GoatTeleporter.app will not directly link against\n# CoreTeleportation.framework, but it will be included in the bundle's\n# Frameworks directory.\n#\n# Example of link-time dependency:\n#\n# framework_bundle(\"CoreTeleportation\") {\n# sources = [ ... ]\n# ldflags = [\n# \"-install_name\",\n# \"@executable_path/../Frameworks/$target_name.framework\"\n# ]\n# }\n#\n# bundle_data(\"core_teleportation_bundle_data\") {\n# deps = [ \":CoreTeleportation+link\" ]\n# sources = [ \"$root_out_dir/CoreTeleportation.framework\" ]\n# outputs = [ \"{{bundle_root_dir}}/Frameworks/{{source_file_part}}\" ]\n# }\n#\n# app_bundle(\"GoatTeleporter\") {\n# sources = [ ... ]\n# deps = [\n# \":core_teleportation_bundle_data\",\n# ]\n# }\n#\n# Note that the framework is still copied to the app's bundle, but dyld will\n# load this library when the app is launched because it uses the \"+link\"\n# target as a dependency. This also requires that the framework set its\n# install_name so that dyld can locate it.\n#\n# See \"gn help shared_library\" for more information on arguments supported\n# by shared library target.\ntemplate(\"ios_framework_bundle\") {\n _target_name = target_name\n _output_name = target_name\n if (defined(invoker.output_name)) {\n _output_name = invoker.output_name\n }\n\n _has_public_headers =\n defined(invoker.public_headers) && invoker.public_headers != []\n\n if (_has_public_headers) {\n _framework_headers_target = _target_name + \"_framework_headers\"\n _framework_headers_config = _target_name + \"_framework_headers_config\"\n _headers_map_config = _target_name + \"_headers_map\"\n }\n\n _arch_shared_library_source = _target_name + \"_arch_shared_library_sources\"\n _arch_shared_library_target = _target_name + \"_arch_shared_library\"\n _lipo_shared_library_target = _target_name + \"_shared_library\"\n\n source_set(_arch_shared_library_source) {\n forward_variables_from(invoker,\n \"*\",\n [\n \"bundle_deps\",\n \"bundle_deps_filter\",\n \"data_deps\",\n \"enable_code_signing\",\n \"info_plist\",\n \"info_plist_target\",\n \"output_name\",\n \"visibility\",\n ])\n\n visibility = [ \":$_arch_shared_library_target\" ]\n\n if (_has_public_headers) {\n configs += [\n \":$_framework_headers_config($default_toolchain)\",\n \":$_headers_map_config($default_toolchain)\",\n ]\n\n if (!defined(deps)) {\n deps = []\n }\n deps += [ \":$_framework_headers_target($default_toolchain)\" ]\n }\n }\n\n shared_library(_arch_shared_library_target) {\n forward_variables_from(invoker,\n \"*\",\n [\n \"bundle_deps\",\n \"bundle_deps_filter\",\n \"data_deps\",\n \"enable_code_signing\",\n \"info_plist\",\n \"info_plist_target\",\n \"output_name\",\n \"sources\",\n \"visibility\",\n ])\n\n visibility = [ \":$_lipo_shared_library_target($default_toolchain)\" ]\n if (current_toolchain != default_toolchain) {\n visibility += [ \":$_target_name\" ]\n }\n\n if (!defined(deps)) {\n deps = []\n }\n deps += [ \":$_arch_shared_library_source\" ]\n\n if (!defined(ldflags)) {\n ldflags = []\n }\n ldflags += [\n \"-Xlinker\",\n \"-install_name\",\n \"-Xlinker\",\n \"@rpath/$_output_name.framework/$_output_name\",\n \"-Xlinker\",\n \"-objc_abi_version\",\n \"-Xlinker\",\n \"2\",\n ]\n\n output_extension = \"\"\n output_name = _output_name\n output_prefix_override = true\n output_dir = \"$target_out_dir/$current_cpu\"\n }\n\n if (current_toolchain != default_toolchain) {\n # For fat builds, only the default toolchain will generate a framework\n # bundle. For the other toolchains, the template is only used for building\n # the arch-specific binary, thus the default target is just a group().\n\n group(_target_name) {\n forward_variables_from(invoker,\n [\n \"visibility\",\n \"testonly\",\n ])\n public_deps = [\n \":$_arch_shared_library_target\",\n ]\n }\n\n group(_target_name + \"+link\") {\n forward_variables_from(invoker,\n [\n \"visibility\",\n \"testonly\",\n ])\n public_deps = [\n \":$_target_name+link($default_toolchain)\",\n ]\n }\n\n if (defined(invoker.bundle_deps)) {\n assert(invoker.bundle_deps != [], \"mark bundle_deps as used\")\n }\n } else {\n if (_has_public_headers) {\n _public_headers = invoker.public_headers\n _framework_root = \"$root_out_dir/$_output_name.framework\"\n\n _header_map_filename = \"$target_gen_dir/$_output_name.headers.hmap\"\n\n _compile_headers_map_target = _target_name + \"_compile_headers_map\"\n action(_compile_headers_map_target) {\n visibility = [ \":$_framework_headers_target\" ]\n script = \"//build/config/ios/write_framework_hmap.py\"\n outputs = [\n _header_map_filename,\n ]\n\n # The header map generation only wants the list of headers, not all of\n # sources, so filter any non-header source files from \"sources\". It is\n # less error prone that having the developer duplicate the list of all\n # headers in addition to \"sources\".\n set_sources_assignment_filter([\n \"*.c\",\n \"*.cc\",\n \"*.cpp\",\n \"*.m\",\n \"*.mm\",\n ])\n sources = invoker.sources\n set_sources_assignment_filter([])\n\n args = [\n rebase_path(_header_map_filename),\n rebase_path(_framework_root, root_build_dir),\n ] + rebase_path(sources, root_build_dir)\n }\n\n _create_module_map_target = _target_name + \"_module_map\"\n action(_create_module_map_target) {\n visibility = [ \":$_framework_headers_target\" ]\n script = \"//build/config/ios/write_framework_modulemap.py\"\n outputs = [\n \"$_framework_root/Modules/module.modulemap\",\n ]\n args = [ rebase_path(\"$_framework_root\", root_build_dir) ]\n }\n\n _copy_public_headers_target = _target_name + \"_copy_public_headers\"\n copy(_copy_public_headers_target) {\n visibility = [ \":$_framework_headers_target\" ]\n sources = _public_headers\n outputs = [\n \"$_framework_root/Headers/{{source_file_part}}\",\n ]\n }\n\n config(_headers_map_config) {\n visibility = [ \":$_target_name\" ]\n include_dirs = [ _header_map_filename ]\n }\n\n group(_framework_headers_target) {\n deps = [\n \":$_compile_headers_map_target\",\n \":$_copy_public_headers_target\",\n \":$_create_module_map_target\",\n ]\n }\n\n config(_framework_headers_config) {\n # The link settings are inherited from the framework_bundle config.\n cflags = [\n \"-F\",\n rebase_path(\"$root_out_dir/.\", root_build_dir),\n ]\n }\n }\n\n lipo_binary(_lipo_shared_library_target) {\n forward_variables_from(invoker,\n [\n \"configs\",\n \"testonly\",\n ])\n\n visibility = [ \":$_target_name\" ]\n output_name = _output_name\n arch_binary_target = \":$_arch_shared_library_target\"\n arch_binary_output = _output_name\n }\n\n _framework_public_config = _target_name + \"_public_config\"\n config(_framework_public_config) {\n # TODO(sdefresne): should we have a framework_dirs similar to lib_dirs\n # and include_dirs to avoid duplicate values on the command-line.\n visibility = [ \":$_target_name\" ]\n ldflags = [\n \"-F\",\n rebase_path(\"$root_out_dir/.\", root_build_dir),\n ]\n lib_dirs = [ root_out_dir ]\n libs = [ \"$_output_name.framework\" ]\n }\n\n _info_plist_target = _target_name + \"_info_plist\"\n _info_plist_bundle = _target_name + \"_info_plist_bundle\"\n ios_info_plist(_info_plist_target) {\n visibility = [ \":$_info_plist_bundle\" ]\n executable_name = _output_name\n forward_variables_from(invoker,\n [\n \"extra_substitutions\",\n \"info_plist\",\n \"info_plist_target\",\n ])\n }\n\n bundle_data(_info_plist_bundle) {\n visibility = [ \":$_target_name\" ]\n forward_variables_from(invoker, [ \"testonly\" ])\n sources = get_target_outputs(\":$_info_plist_target\")\n outputs = [\n \"{{bundle_root_dir}}/Info.plist\",\n ]\n public_deps = [\n \":$_info_plist_target\",\n ]\n }\n\n create_signed_bundle(_target_name) {\n forward_variables_from(invoker,\n [\n \"bundle_deps\",\n \"bundle_deps_filter\",\n \"data_deps\",\n \"deps\",\n \"enable_code_signing\",\n \"public_configs\",\n \"public_deps\",\n \"testonly\",\n \"visibility\",\n ])\n\n product_type = \"com.apple.product-type.framework\"\n bundle_extension = \".framework\"\n\n output_name = _output_name\n bundle_binary_target = \":$_lipo_shared_library_target\"\n bundle_binary_output = _output_name\n\n if (!defined(deps)) {\n deps = []\n }\n deps += [ \":$_info_plist_bundle\" ]\n }\n\n group(_target_name + \"+link\") {\n forward_variables_from(invoker,\n [\n \"public_deps\",\n \"public_configs\",\n \"testonly\",\n \"visibility\",\n ])\n if (!defined(public_deps)) {\n public_deps = []\n }\n public_deps += [ \":$_target_name\" ]\n if (!defined(public_configs)) {\n public_configs = []\n }\n public_configs += [ \":$_framework_public_config\" ]\n\n if (_has_public_headers) {\n public_configs += [ \":$_framework_headers_config\" ]\n }\n }\n\n bundle_data(_target_name + \"+bundle\") {\n forward_variables_from(invoker,\n [\n \"testonly\",\n \"visibility\",\n ])\n public_deps = [\n \":$_target_name\",\n ]\n sources = [\n \"$root_out_dir/$_output_name.framework\",\n ]\n outputs = [\n \"{{bundle_resources_dir}}/Frameworks/$_output_name.framework\",\n ]\n }\n }\n}\n\nset_defaults(\"ios_framework_bundle\") {\n configs = default_shared_library_configs\n}\n\n# For Chrome on iOS we want to run XCTests for all our build configurations\n# (Debug, Release, ...). In addition, the symbols visibility is configured to\n# private by default. To simplify testing with those constraints, our tests are\n# compiled in the TEST_HOST target instead of the .xctest bundle.\ntemplate(\"ios_xctest_test\") {\n _target_name = target_name\n _output_name = target_name\n if (defined(invoker.output_name)) {\n _output_name = invoker.output_name\n }\n\n _xctest_target = _target_name + \"_module\"\n _xctest_output = _output_name + \"_module\"\n\n _host_target = _target_name\n _host_output = _output_name\n\n _xctest_arch_loadable_module_target = _xctest_target + \"_arch_loadable_module\"\n _xctest_lipo_loadable_module_target = _xctest_target + \"_loadable_module\"\n\n loadable_module(_xctest_arch_loadable_module_target) {\n visibility = [ \":$_xctest_lipo_loadable_module_target($default_toolchain)\" ]\n if (current_toolchain != default_toolchain) {\n visibility += [ \":$_xctest_target\" ]\n }\n\n sources = [\n \"//build/config/ios/xctest_shell.mm\",\n ]\n configs += [ \"//build/config/ios:xctest_config\" ]\n\n output_dir = \"$target_out_dir/$current_cpu\"\n output_name = _xctest_output\n output_prefix_override = true\n output_extension = \"\"\n }\n\n if (current_toolchain != default_toolchain) {\n # For fat builds, only the default toolchain will generate a test bundle.\n # For the other toolchains, the template is only used for building the\n # arch-specific binary, thus the default target is just a group().\n group(_xctest_target) {\n forward_variables_from(invoker,\n [\n \"visibility\",\n \"testonly\",\n ])\n public_deps = [\n \":$_xctest_arch_loadable_module_target\",\n ]\n }\n } else {\n _xctest_info_plist_target = _xctest_target + \"_info_plist\"\n _xctest_info_plist_bundle = _xctest_target + \"_info_plist_bundle\"\n ios_info_plist(_xctest_info_plist_target) {\n visibility = [ \":$_xctest_info_plist_bundle\" ]\n info_plist = \"//build/config/ios/Module-Info.plist\"\n extra_substitutions = [ \"MODULE_NAME=$_xctest_output\" ]\n executable_name = _host_output\n }\n\n bundle_data(_xctest_info_plist_bundle) {\n visibility = [ \":$_xctest_target\" ]\n public_deps = [\n \":$_xctest_info_plist_target\",\n ]\n sources = get_target_outputs(\":$_xctest_info_plist_target\")\n outputs = [\n \"{{bundle_root_dir}}/Info.plist\",\n ]\n }\n\n lipo_binary(_xctest_lipo_loadable_module_target) {\n forward_variables_from(invoker,\n [\n \"configs\",\n \"testonly\",\n ])\n\n visibility = [ \":$_xctest_target\" ]\n output_name = _xctest_output\n arch_binary_target = \":$_xctest_arch_loadable_module_target\"\n arch_binary_output = _xctest_output\n }\n\n _xctest_bundle = _xctest_target + \"_bundle\"\n create_signed_bundle(_xctest_target) {\n forward_variables_from(invoker, [ \"enable_code_signing\" ])\n visibility = [ \":$_xctest_bundle\" ]\n\n product_type = \"com.apple.product-type.bundle.unit-test\"\n bundle_extension = \".xctest\"\n\n output_name = _xctest_output\n bundle_binary_target = \":$_xctest_lipo_loadable_module_target\"\n bundle_binary_output = _xctest_output\n\n deps = [\n \":$_xctest_info_plist_bundle\",\n ]\n }\n\n bundle_data(_xctest_bundle) {\n visibility = [ \":$_host_target\" ]\n public_deps = [\n \":$_xctest_target\",\n ]\n sources = [\n \"$root_out_dir/$_xctest_output.xctest\",\n ]\n outputs = [\n \"{{bundle_plugins_dir}}/$_xctest_output.xctest\",\n ]\n }\n }\n\n ios_app_bundle(_host_target) {\n forward_variables_from(invoker, \"*\", [ \"testonly\" ])\n\n testonly = true\n output_name = _host_output\n configs += [ \"//build/config/ios:xctest_config\" ]\n\n if (!defined(invoker.info_plist) && !defined(invoker.info_plist_target)) {\n info_plist = \"//build/config/ios/Host-Info.plist\"\n }\n\n # Xcode needs those two framework installed in the application (and signed)\n # for the XCTest to run, so install them using extra_system_frameworks.\n _ios_platform_library = \"$ios_sdk_platform_path/Developer/Library\"\n extra_system_frameworks = [\n \"$_ios_platform_library/Frameworks/XCTest.framework\",\n \"$_ios_platform_library/PrivateFrameworks/IDEBundleInjection.framework\",\n ]\n\n if (current_toolchain == default_toolchain) {\n if (!defined(bundle_deps)) {\n bundle_deps = []\n }\n bundle_deps += [ \":$_xctest_bundle\" ]\n }\n\n if (!defined(ldflags)) {\n ldflags = []\n }\n ldflags += [\n \"-Xlinker\",\n \"-rpath\",\n \"-Xlinker\",\n \"@executable_path/Frameworks\",\n \"-Xlinker\",\n \"-rpath\",\n \"-Xlinker\",\n \"@loader_path/Frameworks\",\n ]\n }\n}\n\nset_defaults(\"ios_xctest_test\") {\n configs = default_executable_configs\n}\n" }, { "path": "src/test/resources/samples/langs/GN/isolate.gni", "content": "# Copyright 2016 the V8 project authors. All rights reserved.\n# Use of this source code is governed by a BSD-style license that can be\n# found in the LICENSE file.\n\nimport(\"//build/config/sanitizers/sanitizers.gni\")\nimport(\"//third_party/icu/config.gni\")\nimport(\"v8.gni\")\n\ndeclare_args() {\n # Sets the test isolation mode (noop|prepare|check).\n v8_test_isolation_mode = \"noop\"\n}\n\ntemplate(\"v8_isolate_run\") {\n forward_variables_from(invoker,\n \"*\",\n [\n \"deps\",\n \"isolate\",\n ])\n\n # Remember target name as within the action scope the target name will be\n # different.\n name = target_name\n\n assert(defined(invoker.deps))\n assert(defined(invoker.isolate))\n\n if (name != \"\" && v8_test_isolation_mode != \"noop\") {\n action(name + \"_run\") {\n testonly = true\n\n deps = invoker.deps\n\n script = \"//tools/isolate_driver.py\"\n\n sources = [\n invoker.isolate,\n ]\n\n inputs = [\n # Files that are known to be involved in this step.\n \"//tools/swarming_client/isolate.py\",\n \"//tools/swarming_client/run_isolated.py\",\n ]\n\n if (v8_test_isolation_mode == \"prepare\") {\n outputs = [\n \"$root_out_dir/$name.isolated.gen.json\",\n ]\n } else if (v8_test_isolation_mode == \"check\") {\n outputs = [\n \"$root_out_dir/$name.isolated\",\n \"$root_out_dir/$name.isolated.state\",\n ]\n }\n\n # Translate gn to gyp variables.\n if (is_asan) {\n asan = \"1\"\n } else {\n asan = \"0\"\n }\n if (is_msan) {\n msan = \"1\"\n } else {\n msan = \"0\"\n }\n if (is_tsan) {\n tsan = \"1\"\n } else {\n tsan = \"0\"\n }\n if (is_cfi) {\n cfi_vptr = \"1\"\n } else {\n cfi_vptr = \"0\"\n }\n if (target_cpu == \"x86\") {\n target_arch = \"ia32\"\n } else {\n target_arch = target_cpu\n }\n if (is_debug) {\n configuration_name = \"Debug\"\n } else {\n configuration_name = \"Release\"\n }\n if (is_component_build) {\n component = \"shared_library\"\n } else {\n component = \"static_library\"\n }\n if (icu_use_data_file) {\n icu_use_data_file_flag = \"1\"\n } else {\n icu_use_data_file_flag = \"0\"\n }\n if (v8_enable_inspector) {\n enable_inspector = \"1\"\n } else {\n enable_inspector = \"0\"\n }\n if (v8_use_external_startup_data) {\n use_external_startup_data = \"1\"\n } else {\n use_external_startup_data = \"0\"\n }\n if (v8_use_snapshot) {\n use_snapshot = \"true\"\n } else {\n use_snapshot = \"false\"\n }\n if (v8_has_valgrind) {\n has_valgrind = \"1\"\n } else {\n has_valgrind = \"0\"\n }\n if (v8_gcmole) {\n gcmole = \"1\"\n } else {\n gcmole = \"0\"\n }\n\n # Note, all paths will be rebased in isolate_driver.py to be relative to\n # the isolate file.\n args = [\n v8_test_isolation_mode,\n \"--isolated\",\n rebase_path(\"$root_out_dir/$name.isolated\", root_build_dir),\n \"--isolate\",\n rebase_path(invoker.isolate, root_build_dir),\n\n # Path variables are used to replace file paths when loading a .isolate\n # file\n \"--path-variable\",\n \"DEPTH\",\n rebase_path(\"//\", root_build_dir),\n \"--path-variable\",\n \"PRODUCT_DIR\",\n rebase_path(root_out_dir, root_build_dir),\n\n # TODO(machenbach): Set variables for remaining features.\n \"--config-variable\",\n \"CONFIGURATION_NAME=$configuration_name\",\n \"--config-variable\",\n \"OS=$target_os\",\n \"--config-variable\",\n \"asan=$asan\",\n \"--config-variable\",\n \"cfi_vptr=$cfi_vptr\",\n \"--config-variable\",\n \"gcmole=$gcmole\",\n \"--config-variable\",\n \"has_valgrind=$has_valgrind\",\n \"--config-variable\",\n \"icu_use_data_file_flag=$icu_use_data_file_flag\",\n \"--config-variable\",\n \"is_gn=1\",\n \"--config-variable\",\n \"msan=$msan\",\n \"--config-variable\",\n \"tsan=$tsan\",\n \"--config-variable\",\n \"coverage=0\",\n \"--config-variable\",\n \"sanitizer_coverage=0\",\n \"--config-variable\",\n \"component=$component\",\n \"--config-variable\",\n \"target_arch=$target_arch\",\n \"--config-variable\",\n \"v8_enable_inspector=$enable_inspector\",\n \"--config-variable\",\n \"v8_use_external_startup_data=$use_external_startup_data\",\n \"--config-variable\",\n \"v8_use_snapshot=$use_snapshot\",\n ]\n\n if (is_win) {\n args += [\n \"--config-variable\",\n \"msvs_version=2015\",\n ]\n } else {\n args += [\n \"--config-variable\",\n \"msvs_version=0\",\n ]\n }\n }\n }\n}\n" }, { "path": "src/test/resources/samples/langs/Game Maker Language/GMLmenus.gml", "content": "// Source - https://github.com/faissaloo/GMLmenus/blob/master/GMLmenus.gml\n\n#define draw_menu\n///draw_menu(str,background,foreground,x,y,hpadding,vpadding,height,mouse_button)\n//Distributed under the MIT licence:\n/////////////////////////////////////////\n/*Permission 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//Height is the height of 1 box\n//Menu syntax:\n// |s = seperator (Bug: if |s is placed next to a |n an extra menu item would be added)\n// |n = new item\nvar str, background, foreground,xx,yy, width, height;\nstr = \" \"+argument0 //A hacky thing so that it draws the first item properly, I should probably properly fix this later\nbackground = argument1\nforeground = argument2\nxx = argument3\nyy = argument4\nwidth = 0//argument5\nhpadding = argument5\nvpadding = argument6\nheight = argument7\nmb=argument8 //This is the main mouse button, I added this to give more choice to the dev\n//xx and yy should be corrected if they are placed outside of the room or if they will lead to the menu being cut off by the edge of the room\nitem_list = ds_list_create()\nitem_string = \"\"\n///////////////////////////////////\nfor (i=0;iwidth\n {\n width=string_width(item_string)\n }\n \n \n ds_list_add(item_list,item_string) //Add a new item to the list\n item_string=\"\" //Reset the item_string\n}\n}\n}\ndraw_set_color(background)\n//draw_rectangle(xx,yy,xx+width,yy+(height*ds_list_size(item_list)),false) //Background, temporary?\ndraw_button(xx,yy,xx+width+(hpadding*2),yy+(height*(ds_list_size(item_list)-1))+vpadding,true) //Background, temporary?\n\nfor (i=0;ixx) and (mouse_xyy) and mouse_check_button_released(mb)\n {\n //show_message(i+1) //Debugging\n return i+1; //Returns the number of the item in the list, we're adding 1 because 0 is reserved for if nothing is clicked\n }\n\n \n\n}\n\nif mouse_check_button_released(mb) and !(mouse_x>xx and mouse_y>yy and mouse_x\n \n***********************************************************************************/\n\n/*\nThis event should be placed in the draw event of the platform character.\n*/\n//draws the sprite\ndraw = true;\nif (facing == RIGHT) image_xscale = -1;\nelse image_xscale = 1;\n\nif (blinkToggle != 1)\n{\n if ((state == CLIMBING or (sprite_index == sPExit or sprite_index == sDamselExit or sprite_index == sTunnelExit)) and global.hasJetpack and not whipping)\n {\n draw_sprite_ext(sprite_index, -1, x, y, image_xscale, image_yscale, image_angle, image_blend, image_alpha);\n //draw_sprite(sprite_index,-1,x,y);\n draw_sprite(sJetpackBack,-1,x,y);\n draw = false;\n }\n else if (global.hasJetpack and facing == RIGHT) draw_sprite(sJetpackRight,-1,x-4,y-1);\n else if (global.hasJetpack) draw_sprite(sJetpackLeft,-1,x+4,y-1);\n if (draw)\n {\n if (redColor > 0) draw_sprite_ext(sprite_index, -1, x, y, image_xscale, image_yscale, image_angle, make_color_rgb(200 + redColor,0,0), image_alpha);\n else draw_sprite_ext(sprite_index, -1, x, y, image_xscale, image_yscale, image_angle, image_blend, image_alpha);\n }\n if (facing == RIGHT)\n {\n if (holdArrow == ARROW_NORM)\n {\n draw_sprite(sArrowRight, -1, x+4, y+1);\n }\n else if (holdArrow == ARROW_BOMB)\n {\n if (holdArrowToggle) draw_sprite(sBombArrowRight, 0, x+4, y+2);\n else draw_sprite(sBombArrowRight, 1, x+4, y+2);\n }\n }\n else if (facing == LEFT)\n {\n if (holdArrow == ARROW_NORM)\n {\n draw_sprite(sArrowLeft, -1, x-4, y+1);\n }\n else if (holdArrow == ARROW_BOMB)\n {\n if (holdArrowToggle) draw_sprite(sBombArrowLeft, 0, x-4, y+2);\n else draw_sprite(sBombArrowLeft, 1, x-4, y+2);\n }\n }\n}\n/*\nif canRun\n{\n xOffset=80\n if player=1\n yOffset=120\n else\n yOffset=143\n //draw the \"flySpeed\" bar, which shows how much speed the character has acquired while holding the \"run\" button\n //draw_healthbar(view_xview[0]+224+xOffset,view_yview[0]+432+yOffset,view_xview[0]+400+xOffset,view_yview[0]+450+yOffset,flySpeed,make_color_rgb(0,64,128),c_blue,c_aqua,0,1,1)\n}\n*/\n" }, { "path": "src/test/resources/samples/langs/Game Maker Language/characterStepEvent.gml", "content": "// Originally from /spelunky/Scripts/Platform Engine/characterStepEvent.gml in the Spelunky Community Update Project\n\n/**********************************************************************************\n Copyright (c) 2008, 2009 Derek Yu and Mossmouth, LLC\n \n This file is part of Spelunky.\n\n You can redistribute and/or modify Spelunky, including its source code, under\n the terms of the Spelunky User License.\n\n Spelunky is distributed in the hope that it will be entertaining and useful,\n but WITHOUT WARRANTY. Please see the Spelunky User License for more details.\n\n The Spelunky User License should be available in \"Game Information\", which\n can be found in the Resource Explorer, or as an external file called COPYING.\n If not, please obtain a new copy of Spelunky from \n \n***********************************************************************************/\n\n/*\nThis script should be placed in the step event for the platform character.\nIt updates the keys used by the character, moves all of the solids, moves the\ncharacter, sets the sprite index, and sets the animation speed for the sprite.\n*/\nhangCountMax = 3;\n\n//////////////////////////////////////\n// KEYS\n//////////////////////////////////////\n\nkLeft = checkLeft();\n\nif (kLeft) kLeftPushedSteps += 1;\nelse kLeftPushedSteps = 0;\n \nkLeftPressed = checkLeftPressed();\nkLeftReleased = checkLeftReleased();\n \nkRight = checkRight();\n \nif (kRight) kRightPushedSteps += 1;\nelse kRightPushedSteps = 0;\n \nkRightPressed = checkRightPressed();\nkRightReleased = checkRightReleased();\n \nkUp = checkUp();\nkDown = checkDown();\n \n//key \"run\"\nif canRun\n kRun = 0;\n// kRun=runKey\nelse\n kRun=0\n \nkJump = checkJump();\nkJumpPressed = checkJumpPressed();\nkJumpReleased = checkJumpReleased();\n \nif (cantJump > 0)\n{\n kJump = 0;\n kJumpPressed = 0;\n kJumpReleased = 0;\n cantJump -= 1;\n}\nelse\n{\n if (global.isTunnelMan and\n sprite_index == sTunnelAttackL and\n !holdItem)\n {\n kJump = 0;\n kJumpPressed = 0;\n kJumpReleased = 0;\n cantJump -= 1;\n }\n}\n\nkAttack = checkAttack();\nkAttackPressed = checkAttackPressed();\nkAttackReleased = checkAttackReleased();\n\nkItemPressed = checkItemPressed();\n\nxPrev = x;\nyPrev = y;\n\nif (stunned or dead)\n{\n kLeft = false;\n kLeftPressed = false;\n kLeftReleased = false;\n kRight = false;\n kRightPressed = false;\n kRightReleased = false;\n kUp = false;\n kDown = false;\n kJump = false;\n kJumpPressed = false;\n kJumpReleased = false;\n kAttack = false;\n kAttackPressed = false;\n kAttackReleased = false;\n kItemPressed = false;\n}\n\n//////////////////////////////////////////\n// Collisions\n//////////////////////////////////////////\n\ncolSolidLeft = false;\ncolSolidRight = false;\ncolLeft = false;\ncolRight = false;\ncolTop = false;\ncolBot = false;\ncolLadder = false;\ncolPlatBot = false;\ncolPlat = false;\ncolWaterTop = false;\ncolIceBot = false;\nrunKey = false;\nif (isCollisionMoveableSolidLeft(1)) colSolidLeft = true;\nif (isCollisionMoveableSolidRight(1)) colSolidRight = true;\nif (isCollisionLeft(1)) colLeft = true;\nif (isCollisionRight(1)) colRight = true;\nif (isCollisionTop(1)) colTop = true;\nif (isCollisionBottom(1)) colBot = true;\nif (isCollisionLadder()) colLadder = true;\nif (isCollisionPlatformBottom(1)) colPlatBot = true;\nif (isCollisionPlatform()) colPlat = true;\nif (isCollisionWaterTop(1)) colWaterTop = true;\nif (collision_point(x, y+8, oIce, 0, 0)) colIceBot = true;\nif (checkRun())\n{\n runHeld = 100;\n runKey = true;\n}\n\nif (checkAttack() and not whipping)\n{\n runHeld += 1;\n runKey = true;\n}\n\nif (not runKey or (not kLeft and not kRight)) runHeld = 0;\n\n// allows the character to run left and right\n// if state!=DUCKING and state!=LOOKING_UP and state!=CLIMBING\nif (state != CLIMBING and state != HANGING)\n{\n if (kLeftReleased and approximatelyZero(xVel)) xAcc -= 0.5\n if (kRightReleased and approximatelyZero(xVel)) xAcc += 0.5\n \n if (kLeft and not kRight)\n {\n if (colSolidLeft)\n {\n // xVel = 3;\n if (platformCharacterIs(ON_GROUND) and state != DUCKING)\n {\n xAcc -= 1;\n pushTimer += 10;\n //if (not SS_IsSoundPlaying(global.sndPush)) playSound(global.sndPush);\n }\n }\n else if (kLeftPushedSteps > 2) and (facing=LEFT or approximatelyZero(xVel))\n {\n xAcc -= runAcc;\n }\n facing = LEFT;\n //if (platformCharacterIs(ON_GROUND) and abs(xVel) > 0 and alarm[3] < 1) alarm[3] = floor(16/-xVel);\n }\n \n if (kRight and not kLeft)\n {\n if (colSolidRight)\n {\n // xVel = 3;\n if (platformCharacterIs(ON_GROUND) and state != DUCKING)\n {\n xAcc += 1;\n pushTimer += 10;\n //if (not SS_IsSoundPlaying(global.sndPush)) playSound(global.sndPush);\n }\n }\n else if (kRightPushedSteps > 2 or colSolidLeft) and (facing=RIGHT or approximatelyZero(xVel))\n {\n xAcc += runAcc;\n }\n facing = RIGHT;\n //if (platformCharacterIs(ON_GROUND) and abs(xVel) > 0 and alarm[3] < 1) alarm[3] = floor(16/xVel);\n }\n}\n\n/******************************************\n\n LADDERS\n \n*******************************************/\n\nif (state == CLIMBING)\n{\n if (instance_exists(oCape))\n {\n oCape.open = false;\n }\n kJumped = false;\n ladderTimer = 10;\n ladder = collision_point(x, y, oLadder, 0, 0);\n if (ladder) x = ladder.x + 8;\n\n if (kLeft) facing = LEFT;\n else if (kRight) facing = RIGHT;\n if (kUp)\n {\n if (collision_point(x, y-8, oLadder, 0, 0) or collision_point(x, y-8, oLadderTop, 0, 0))\n {\n yAcc -= climbAcc;\n if (alarm[2] < 1) alarm[2] = 8;\n }\n }\n else if (kDown)\n {\n if (collision_point(x, y+8, oLadder, 0, 0) or collision_point(x, y+8, oLadderTop, 0, 0))\n {\n yAcc += climbAcc;\n if (alarm[2] < 1) alarm[2] = 8;\n }\n else\n state = FALLING;\n if (colBot) state = STANDING;\n }\n \n if (kJumpPressed and not whipping)\n {\n if (kLeft)\n xVel = -departLadderXVel;\n else if (kRight)\n xVel = departLadderXVel;\n else\n xVel = 0;\n yAcc += departLadderYVel;\n state = JUMPING;\n jumpButtonReleased = 0;\n jumpTime = 0;\n ladderTimer = 5;\n }\n}\nelse\n{\n if (ladderTimer > 0) ladderTimer -= 1;\n}\n\nif (platformCharacterIs(IN_AIR) and state != HANGING)\n{\n yAcc += gravityIntensity;\n}\n\n// Player has landed\nif ((colBot or colPlatBot) and platformCharacterIs(IN_AIR) and yVel >= 0)\n{\n if (not colPlat or colBot)\n {\n yVel = 0;\n yAcc = 0;\n state = RUNNING;\n jumps = 0;\n }\n //playSound(global.sndLand);\n}\nif ((colBot or colPlatBot) and not colPlat) yVel = 0;\n\n// Player has just walked off of the edge of a solid\nif (colBot == 0 and (not colPlatBot or colPlat) and platformCharacterIs(ON_GROUND))\n{\n state = FALLING;\n yAcc += grav;\n kJumped = true;\n if (global.hasGloves) hangCount = 5;\n}\n\nif (colTop)\n{\n if (dead or stunned) yVel = -yVel * 0.8;\n else if (state == JUMPING) yVel = abs(yVel*0.3)\n}\n\nif (colLeft and facing == LEFT) or (colRight and facing == RIGHT)\n{\n if (dead or stunned) xVel = -xVel * 0.5;\n else xVel = 0;\n}\n\n/******************************************\n\n JUMPING\n \n*******************************************/\n\nif (kJumpReleased and platformCharacterIs(IN_AIR))\n{\n kJumped = true;\n}\nelse if (platformCharacterIs(ON_GROUND))\n{\n oCape.open = false;\n kJumped = false;\n}\n\nif (kJumpPressed and collision_point(x, y, oWeb, 0, 0))\n{\n obj = instance_place(x, y, oWeb);\n obj.life -= 1;\n yAcc += initialJumpAcc * 2;\n yVel -= 3;\n xAcc += xVel/2;\n \n state = JUMPING;\n jumpButtonReleased = 0;\n jumpTime = 0;\n \n grav = gravNorm;\n}\nelse if (kJumpPressed and colWaterTop)\n{\n yAcc += initialJumpAcc * 2;\n yVel -= 3;\n xAcc += xVel/2;\n \n state = JUMPING;\n jumpButtonReleased = 0;\n jumpTime = 0;\n \n grav = gravNorm;\n}\nelse if (global.hasCape and kJumpPressed and kJumped and platformCharacterIs(IN_AIR))\n{\n if (not oCape.open) oCape.open = true;\n else oCape.open = false;\n}\nelse if (global.hasJetpack and kJump and kJumped and platformCharacterIs(IN_AIR) and jetpackFuel > 0)\n{\n yAcc += initialJumpAcc;\n yVel = -1;\n jetpackFuel -= 1;\n if (alarm[10] < 1) alarm[10] = 3;\n \n state = JUMPING;\n jumpButtonReleased = 0;\n jumpTime = 0;\n \n grav = 0;\n}\nelse if (platformCharacterIs(ON_GROUND) and kJumpPressed and fallTimer == 0)\n{\n if (xVel > 3 or xVel < -3)\n {\n yAcc += initialJumpAcc * 2;\n xAcc += xVel * 2;\n }\n else\n {\n yAcc += initialJumpAcc * 2;\n xAcc += xVel/2;\n }\n \n if (global.hasJordans)\n {\n yAcc *= 3;\n yAccLimit = 12;\n grav = 0.5;\n }\n else if (global.hasSpringShoes) yAcc *= 1.5;\n else\n {\n yAccLimit = 6;\n grav = gravNorm;\n }\n \n playSound(global.sndJump);\n \n pushTimer = 0;\n\n // the \"state\" gets changed to JUMPING later on in the code\n state = FALLING;\n // \"variable jumping\" states\n jumpButtonReleased = 0;\n jumpTime = 0;\n}\n\nif (jumpTime < jumpTimeTotal) jumpTime += 1;\n//let the character continue to jump\nif (kJump == 0) jumpButtonReleased = 1;\nif (jumpButtonReleased) jumpTime = jumpTimeTotal;\n\ngravityIntensity = (jumpTime/jumpTimeTotal) * grav;\n\nif (kUp and platformCharacterIs(ON_GROUND) and not colLadder)\n{\n looking = UP;\n if (xVel == 0 and xAcc == 0) state = LOOKING_UP;\n}\nelse looking = 0;\n\nif (not kUp and state == LOOKING_UP)\n{\n state=STANDING\n}\n\n/******************************************\n\n HANGING\n \n*******************************************/\n\nif (not colTop)\n{\nif (global.hasGloves and yVel > 0)\n{\n if (hangCount == 0 and y > 16 and !platformCharacterIs(ON_GROUND) and kRight and colRight and\n (collision_point(x+9, y-5, oSolid, 0, 0) or collision_point(x+9, y-6, oSolid, 0, 0)))\n {\n state = HANGING;\n move_snap(1, 8);\n yVel = 0;\n yAcc = 0;\n grav = 0;\n }\n else if (hangCount == 0 and y > 16 and !platformCharacterIs(ON_GROUND) and kLeft and colLeft and\n (collision_point(x-9, y-5, oSolid, 0, 0) or collision_point(x-9, y-6, oSolid, 0, 0)))\n {\n state = HANGING;\n move_snap(1, 8);\n yVel = 0;\n yAcc = 0;\n grav = 0;\n }\n}\nelse if (hangCount == 0 and y > 16 and !platformCharacterIs(ON_GROUND) and kRight and colRight and\n (collision_point(x+9, y-5, oTree, 0, 0) or collision_point(x+9, y-6, oTree, 0, 0)))\n{\n state = HANGING;\n move_snap(1, 8);\n yVel = 0;\n yAcc = 0;\n grav = 0;\n}\nelse if (hangCount == 0 and y > 16 and !platformCharacterIs(ON_GROUND) and kLeft and colLeft and\n (collision_point(x-9, y-5, oTree, 0, 0) or collision_point(x-9, y-6, oTree, 0, 0)))\n{\n state = HANGING;\n move_snap(1, 8);\n yVel = 0;\n yAcc = 0;\n grav = 0;\n}\nelse if (hangCount == 0 and y > 16 and !platformCharacterIs(ON_GROUND) and kRight and colRight and\n (collision_point(x+9, y-5, oSolid, 0, 0) or collision_point(x+9, y-6, oSolid, 0, 0)) and\n not collision_point(x+9, y-9, oSolid, 0, 0) and not collision_point(x, y+9, oSolid, 0, 0))\n{\n state = HANGING;\n move_snap(1, 8);\n yVel = 0;\n yAcc = 0;\n grav = 0;\n}\nelse if (hangCount == 0 and y > 16 and !platformCharacterIs(ON_GROUND) and kLeft and colLeft and\n (collision_point(x-9, y-5, oSolid, 0, 0) or collision_point(x-9, y-6, oSolid, 0, 0)) and\n not collision_point(x-9, y-9, oSolid, 0, 0) and not collision_point(x, y+9, oSolid, 0, 0))\n{\n state = HANGING;\n move_snap(1, 8);\n yVel = 0;\n yAcc = 0;\n grav = 0;\n}\n\nif (hangCount == 0 and y > 16 and !platformCharacterIs(ON_GROUND) and state == FALLING and\n (collision_point(x, y-5, oArrow, 0, 0) or collision_point(x, y-6, oArrow, 0, 0)) and\n not collision_point(x, y-9, oArrow, 0, 0) and not collision_point(x, y+9, oArrow, 0, 0))\n{\n obj = instance_nearest(x, y-5, oArrow);\n if (obj.stuck)\n {\n state = HANGING;\n // move_snap(1, 8);\n yVel = 0;\n yAcc = 0;\n grav = 0;\n }\n}\n\n/*\nif (hangCount == 0 and y > 16 and !platformCharacterIs(ON_GROUND) and state == FALLING and\n (collision_point(x, y-5, oTreeBranch, 0, 0) or collision_point(x, y-6, oTreeBranch, 0, 0)) and\n not collision_point(x, y-9, oTreeBranch, 0, 0) and not collision_point(x, y+9, oTreeBranch, 0, 0))\n{\n state = HANGING;\n // move_snap(1, 8);\n yVel = 0;\n yAcc = 0;\n grav = 0;\n}\n*/\n\n}\n\nif (hangCount > 0) hangCount -= 1;\n\nif (state == HANGING)\n{\n if (instance_exists(oCape)) oCape.open = false;\n kJumped = false;\n \n if (kDown and kJumpPressed)\n {\n grav = gravNorm;\n state = FALLING;\n yAcc -= grav;\n hangCount = 5;\n if (global.hasGloves) hangCount = 10;\n }\n else if (kJumpPressed)\n {\n grav = gravNorm;\n if ((facing == RIGHT and kLeft) or (facing == LEFT and kRight))\n {\n state = FALLING;\n yAcc -= grav;\n }\n else\n {\n state = JUMPING;\n yAcc += initialJumpAcc * 2;\n if (facing == RIGHT) x -= 2;\n else x += 2;\n }\n hangCount = hangCountMax;\n }\n \n if ((facing == LEFT and not isCollisionLeft(2)) or\n (facing == RIGHT and not isCollisionRight(2)))\n {\n grav = gravNorm;\n state = FALLING;\n yAcc -= grav;\n hangCount = 4;\n }\n}\nelse\n{\n grav = gravNorm;\n}\n\n// pressing down while standing\nif (kDown and platformCharacterIs(ON_GROUND) and not whipping)\n{\n if (colBot)\n {\n state = DUCKING;\n }\n else if colPlatBot\n {\n // climb down ladder if possible, else jump down\n fallTimer = 0;\n if (not colBot)\n {\n ladder = 0;\n ladder = instance_place(x, y+16, oLadder);\n if (instance_exists(ladder))\n {\n if (abs(x-(ladder.x+8)) < 4)\n {\n x = ladder.x + 8;\n\n xVel = 0;\n yVel = 0;\n xAcc = 0;\n yAcc = 0;\n state = CLIMBING;\n }\n }\n else\n {\n y += 1;\n state = FALLING;\n yAcc += grav;\n }\n }\n else\n {\n //the character can't move down because there is a solid in the way\n state = RUNNING;\n }\n }\n}\nif (not kDown and state == DUCKING)\n{\n state = STANDING;\n xVel = 0;\n xAcc = 0;\n}\nif (xVel == 0 and xAcc == 0 and state == RUNNING)\n{\n state = STANDING;\n}\nif (xAcc != 0 and state == STANDING)\n{\n state = RUNNING;\n}\nif (yVel < 0 and platformCharacterIs(IN_AIR) and state != HANGING)\n{\n state = JUMPING;\n}\nif (yVel > 0 and platformCharacterIs(IN_AIR) and state != HANGING)\n{\n state = FALLING;\n setCollisionBounds(-5, -6, 5, 8);\n}\nelse setCollisionBounds(-5, -8, 5, 8);\n\n// CLIMB LADDER\ncolPointLadder = collision_point(x, y, oLadder, 0, 0) or collision_point(x, y, oLadderTop, 0, 0);\n\nif ((kUp and platformCharacterIs(IN_AIR) and collision_point(x, y-8, oLadder, 0, 0) and ladderTimer == 0) or\n (kUp and colPointLadder and ladderTimer == 0) or\n (kDown and colPointLadder and ladderTimer == 0 and platformCharacterIs(ON_GROUND) and collision_point(x, y+9, oLadderTop, 0, 0) and xVel == 0))\n{\n ladder = 0;\n ladder = instance_place(x, y-8, oLadder);\n if (instance_exists(ladder))\n {\n if (abs(x-(ladder.x+8)) < 4)\n {\n x = ladder.x + 8;\n if (not collision_point(x, y, oLadder, 0, 0) and\n not collision_point(x, y, oLadderTop, 0, 0))\n {\n y = ladder.y + 14;\n }\n\n xVel = 0;\n yVel = 0;\n xAcc = 0;\n yAcc = 0;\n state = CLIMBING;\n }\n }\n}\n\n/*\nif (sprite_index == sDuckToHangL or sprite_index == sDamselDtHL)\n{\n ladder = 0;\n if (facing == LEFT and collision_rectangle(x-8, y, x, y+16, oLadder, 0, 0) and not collision_point(x-4, y+16, oSolid, 0, 0))\n {\n ladder = instance_nearest(x-4, y+16, oLadder);\n }\n else if (facing == RIGHT and collision_rectangle(x, y, x+8, y+16, oLadder, 0, 0) and not collision_point(x+4, y+16, oSolid, 0, 0))\n {\n ladder = instance_nearest(x+4, y+16, oLadder);\n }\n \n if (ladder)\n {\n x = ladder.x + 8;\n\n xVel = 0;\n yVel = 0;\n xAcc = 0;\n yAcc = 0;\n state = CLIMBING;\n }\n}\n*/\n/*\nif (colLadder and state == CLIMBING and kJumpPressed and not whipping)\n{\n if (kLeft)\n xVel = -departLadderXVel;\n else if (kRight)\n xVel = departLadderXVel;\n else\n xVel = 0;\n yAcc += departLadderYVel;\n state = JUMPING;\n jumpButtonReleased = 0;\n jumpTime = 0;\n ladderTimer = 5;\n}\n*/\n\n// Calculate horizontal/vertical friction\nif (state == CLIMBING)\n{\n xFric = frictionClimbingX;\n yFric = frictionClimbingY;\n}\nelse\n{\n if (runKey and platformCharacterIs(ON_GROUND) and runHeld >= 10)\n {\n if (kLeft) // run\n {\n xVel -= 0.1;\n xVelLimit = 6;\n xFric = frictionRunningFastX;\n }\n else if (kRight)\n {\n xVel += 0.1;\n xVelLimit = 6;\n xFric = frictionRunningFastX;\n }\n }\n else if (state == DUCKING)\n {\n if (xVel<2 and xVel>-2)\n {\n xFric = 0.2\n xVelLimit = 3;\n image_speed = 0.8;\n }\n else if (kLeft and global.downToRun) // run\n {\n xVel -= 0.1;\n xVelLimit = 6;\n xFric = frictionRunningFastX;\n }\n else if (kRight and global.downToRun)\n {\n xVel += 0.1;\n xVelLimit = 6;\n xFric = frictionRunningFastX;\n }\n else\n {\n xVel *= 0.8;\n if (xVel < 0.5) xVel = 0;\n xFric = 0.2\n xVelLimit = 3;\n image_speed = 0.8;\n }\n }\n else\n {\n //decrease the friction when the character is \"flying\"\n if (platformCharacterIs(IN_AIR))\n {\n if (dead or stunned) xFric = 1.0;\n else xFric = 0.8;\n }\n else\n {\n xFric = frictionRunningX;\n }\n }\n \n // Stuck on web or underwater\n if (collision_point(x, y, oWeb, 0, 0))\n {\n xFric = 0.2;\n yFric = 0.2;\n fallTimer = 0;\n }\n else if (collision_point(x, y, oWater, -1, -1))\n {\n if (instance_exists(oCape)) oCape.open = false;\n \n if (state == FALLING and yVel > 0)\n {\n yFric = 0.5;\n }\n else if (not collision_point(x, y-9, oWater, -1, -1))\n {\n yFric = 1;\n }\n else\n {\n yFric = 0.9;\n }\n }\n else\n {\n swimming = false;\n yFric = 1;\n }\n}\n\nif (colIceBot and state != DUCKING and not global.hasSpikeShoes)\n{\n xFric = 0.98;\n yFric = 1;\n}\n\n// RUNNING\n\nif (platformCharacterIs(ON_GROUND))\n{\n if (state == RUNNING and kLeft and colLeft)\n {\n pushTimer += 1;\n }\n else if (state == RUNNING and kRight and colRight)\n {\n pushTimer += 1;\n }\n else\n {\n pushTimer = 0;\n }\n \n if (platformCharacterIs(ON_GROUND) and not kJump and not kDown and not runKey)\n { \n xVelLimit = 3;\n }\n \n \n // ledge flip\n if (state == DUCKING and abs(xVel) < 3 and facing == LEFT and\n collision_point(x, y+9, oSolid, 0, 0) and not collision_line(x-1, y+9, x-10, y+9, oSolid, 0, 0) and kLeft)\n {\n state = DUCKTOHANG;\n \n if (holdItem)\n {\n holdItem.held = false;\n if (holdItem.type == \"Gold Idol\") holdItem.y -= 8;\n scrDropItem(-1, -4);\n }\n \n with oMonkey\n {\n // knock off monkeys that grabbed you\n if (status == 7)\n {\n xVel = -1;\n yVel = -4;\n status = 1;\n vineCounter = 20;\n grabCounter = 60;\n }\n }\n }\n else if (state == DUCKING and abs(xVel) < 3 and facing == RIGHT and\n collision_point(x, y+9, oSolid, 0, 0) and not collision_line(x+1, y+9, x+10, y+9, oSolid, 0, 0) and kRight)\n {\n state = DUCKTOHANG;\n \n if (holdItem)\n {\n // holdItem.held = false;\n if (holdItem.type == \"Gold Idol\") holdItem.y -= 8;\n scrDropItem(1, -4);\n }\n \n with oMonkey\n {\n // knock off monkeys that grabbed you\n if (status == 7)\n {\n xVel = 1;\n yVel = -4;\n status = 1;\n vineCounter = 20;\n grabCounter = 60;\n }\n }\n }\n}\n\nif (state == DUCKTOHANG)\n{\n x = xPrev;\n y = yPrev;\n xVel = 0;\n yVel = 0;\n xAcc = 0;\n yAcc = 0;\n grav = 0;\n}\n\n// PARACHUTE AND CAPE\nif (instance_exists(oParachute))\n{\n yFric = 0.5;\n}\nif (instance_exists(oCape))\n{\n if (oCape.open) yFric = 0.5;\n}\n\nif (pushTimer > 100) pushTimer = 100;\n\n// limits the acceleration if it is too extreme\nif (xAcc > xAccLimit) xAcc = xAccLimit;\nelse if (xAcc < -xAccLimit) xAcc = -xAccLimit;\nif (yAcc > yAccLimit) yAcc = yAccLimit;\nelse if (yAcc < -yAccLimit) yAcc = -yAccLimit;\n\n// applies the acceleration\nxVel += xAcc;\nif (dead or stunned) yVel += 0.6;\nelse yVel += yAcc;\n\n// nullifies the acceleration\nxAcc = 0;\nyAcc = 0;\n\n// applies the friction to the velocity, now that the velocity has been calculated\nxVel *= xFric;\nyVel *= yFric;\n\n// apply ball and chain\nif (instance_exists(oBall))\n{\n if (distance_to_object(oBall) >= 24)\n {\n if (xVel > 0 and oBall.x < x and abs(oBall.x-x) > 24) xVel = 0;\n if (xVel < 0 and oBall.x > x and abs(oBall.x-x) > 24) xVel = 0;\n if (yVel > 0 and oBall.y < y and abs(oBall.y-y) > 24)\n {\n if (abs(oBall.x-x) < 1)\n {\n x = oBall.x;\n }\n else if (oBall.x < x and not kRight)\n {\n if (xVel > 0) xVel *= -0.25;\n else if (xVel == 0) xVel -= 1;\n }\n else if (oBall.x > x and not kLeft)\n {\n if (xVel < 0) xVel *= -0.25;\n else if (xVel == 0) xVel += 1;\n }\n yVel = 0;\n fallTimer = 0;\n }\n if (yVel < 0 and oBall.y > y and abs(oBall.y-y) > 24) yVel = 0;\n }\n}\n\n// apply the limits since the velocity may be too extreme\nif (not dead and not stunned)\n{\n if (xVel > xVelLimit) xVel = xVelLimit;\n else if (xVel < -xVelLimit) xVel = -xVelLimit;\n}\nif (yVel > yVelLimit) yVel = yVelLimit;\nelse if (yVel < -yVelLimit) yVel = -yVelLimit;\n \n// approximates the \"active\" variables\nif approximatelyZero(xVel) xVel=0\nif approximatelyZero(yVel) yVel=0\nif approximatelyZero(xAcc) xAcc=0\nif approximatelyZero(yAcc) yAcc=0\n\n// prepares the character to move up a hill\n// we need to use the \"slopeYPrev\" variable later to know the \"true\" y previous value\n// keep this condition the same\nif maxSlope>0 and platformCharacterIs(ON_GROUND) and xVel!=0\n{\n slopeYPrev=y\n for(y=y;y>=slopeYPrev-maxSlope;y-=1)\n if colTop\n break\n slopeChangeInY=slopeYPrev-y\n}\nelse\n slopeChangeInY=0\n\n// moves the character, and balances out the effects caused by other processes\n// keep this condition the same\nif maxSlope*abs(xVel)>0 and platformCharacterIs(ON_GROUND)\n{\n // we need to check if we should dampen out the speed as the character runs on upward slopes\n xPrev=x\n yPrev=slopeYPrev // we don't want to use y, because y is too high\n yPrevHigh=y // we'll use the higher previous variable later\n moveTo(xVel,yVel+slopeChangeInY)\n dist=point_distance(xPrev,yPrev,x,y)// overall distance that has been traveled\n // we should have only ran at xVel\n if dist>abs(xVelInteger)\n {\n // show_message(string(dist)+ \" \"+string(abs(xVelInteger)))\n excess=dist-abs(xVelInteger)\n if(xVelInteger<0)\n excess*=-1\n // move back since the character moved too far\n x=xPrev\n y=yPrevHigh // we need the character to be high so the character can move down\n // this time we'll move the correct distance, but we need to shorten out the xVel a little\n // these lines can be changed for different types of slowing down when running up hills\n ratio=abs(xVelInteger)/dist*0.9 //can be changed\n moveTo( round(xVelInteger*ratio),round(yVelInteger*ratio+slopeChangeInY) )\n }\n}\nelse\n{\n // we simply move xVel and yVel while in the air or on a ladder\n moveTo(xVel,yVel)\n}\n// move the character downhill if possible\n// we need to multiply maxDownSlope by the absolute value of xVel since the character normally runs at an xVel larger than 1\nif not colBot and maxDownSlope>0 and xVelInteger!=0 and platformCharacterIs(ON_GROUND)\n{\n //the character is floating just above the slope, so move the character down\n upYPrev=y\n for(y=y;y<=upYPrev+maxDownSlope;y+=1)\n if colBot // we hit a solid below\n {\n upYPrev=y // I know that this doesn't seem to make sense, because of the name of the variable, but it all works out correctly after we break out of this loop\n break\n }\n y=upYPrev\n}\n\n//figures out what the sprite index of the character should be\ncharacterSprite();\n\n//sets the previous state and the previously previous state\nstatePrevPrev = statePrev;\nstatePrev = state;\n\n//calculates the image_speed based on the character's velocity\nif (state == RUNNING or state == DUCKING or state == LOOKING_UP)\n{\n if (state == RUNNING or state == LOOKING_UP) image_speed = abs(xVel) * runAnimSpeed + 0.1;\n}\n\nif (state == CLIMBING) image_speed = sqrt(sqr(abs(xVel))+sqr(abs(yVel))) * climbAnimSpeed\nif (xVel >= 4 or xVel <= -4)\n{\n image_speed = 1;\n if (platformCharacterIs(ON_GROUND)) setCollisionBounds(-8, -8, 8, 8);\n else setCollisionBounds(-5, -8, 5, 8);\n}\nelse setCollisionBounds(-5, -8, 5, 8);\nif (whipping) image_speed = 1;\nif (state == DUCKTOHANG)\n{\n image_index = 0;\n image_speed = 0.8;\n}\n//limit the image_speed at 1 so the animation always looks good\nif (image_speed > 1) image_speed = 1;\n" }, { "path": "src/test/resources/samples/langs/Game Maker Language/draw_menu.gml", "content": "// Source - https://github.com/faissaloo/GMLmenus/blob/master/GMLmenus_example.gmx/scripts/draw_menu.gml\n\n///draw_menu(str,background,foreground,x,y,hpadding,vpadding,height,mouse_button)\n//Distributed under the MIT licence:\n/////////////////////////////////////////\n/*Permission 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//Height is the height of 1 box\n//Menu syntax:\n// |s = seperator (Bug: if |s is placed next to a |n an extra menu item would be added)\n// |n = new item\nvar str, background, foreground,xx,yy, width, height;\nstr = \" \"+argument0 //A hacky thing so that it draws the first item properly, I should probably properly fix this later\nbackground = argument1\nforeground = argument2\nxx = argument3\nyy = argument4\nwidth = 0//argument5\nhpadding = argument5\nvpadding = argument6\nheight = argument7\nmb=argument8 //This is the main mouse button, I added this to give more choice to the dev\n//xx and yy should be corrected if they are placed outside of the room or if they will lead to the menu being cut off by the edge of the room\nitem_list = ds_list_create()\nitem_string = \"\"\n///////////////////////////////////\nfor (i=0;iwidth\n {\n width=string_width(item_string)\n }\n \n \n ds_list_add(item_list,item_string) //Add a new item to the list\n item_string=\"\" //Reset the item_string\n}\n}\n}\ndraw_set_color(background)\n//draw_rectangle(xx,yy,xx+width,yy+(height*ds_list_size(item_list)),false) //Background, temporary?\ndraw_button(xx,yy,xx+width+(hpadding*2),yy+(height*(ds_list_size(item_list)-1))+vpadding,true) //Background, temporary?\n\nfor (i=0;ixx) and (mouse_xyy) and mouse_check_button_released(mb)\n {\n //show_message(i+1) //Debugging\n return i+1; //Returns the number of the item in the list, we're adding 1 because 0 is reserved for if nothing is clicked\n }\n\n \n\n}\n\nif mouse_check_button_released(mb) and !(mouse_x>xx and mouse_y>yy and mouse_x\r\n// \r\n// Permission to use, copy, modify, and/or distribute this software for any\r\n// purpose with or without fee is hereby granted, provided that the above\r\n// copyright notice and this permission notice appear in all copies.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\r\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\r\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\r\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\r\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\r\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\r\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\r\n// ***\r\n\r\n// Creates global.__HttpClient\r\n// real __http_init()\r\n\r\nglobal.__HttpClient = object_add();\r\nobject_set_persistent(global.__HttpClient, true);\r\n\r\n#define __http_split\r\n// ***\r\n// This function forms part of Faucet HTTP v1.0\r\n// https://github.com/TazeTSchnitzel/Faucet-HTTP-Extension\r\n// \r\n// Copyright (c) 2013-2014, Andrea Faulds \r\n// \r\n// Permission to use, copy, modify, and/or distribute this software for any\r\n// purpose with or without fee is hereby granted, provided that the above\r\n// copyright notice and this permission notice appear in all copies.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\r\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\r\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\r\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\r\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\r\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\r\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\r\n// ***\r\n\r\n// real __http_split(string text, delimeter delimeter, real limit)\r\n// Splits string into items\r\n\r\n// text - string comma-separated values\r\n// delimeter - delimeter to split by\r\n// limit if non-zero, maximum times to split text\r\n// When limited, the remaining text will be left as the last item.\r\n// E.g. splitting \"1,2,3,4,5\" with delimeter \",\" and limit 2 yields this list:\r\n// \"1\", \"2\", \"3,4,5\"\r\n\r\n// return value - ds_list containing strings of values\r\n\r\nvar text, delimeter, limit;\r\ntext = argument0;\r\ndelimeter = argument1;\r\nlimit = argument2;\r\n\r\nvar list, count;\r\nlist = ds_list_create();\r\ncount = 0;\r\n\r\nwhile (string_pos(delimeter, text) != 0)\r\n{\r\n ds_list_add(list, string_copy(text, 1, string_pos(delimeter,text) - 1));\r\n text = string_copy(text, string_pos(delimeter, text) + string_length(delimeter), string_length(text) - string_pos(delimeter, text));\r\n\r\n count += 1;\r\n if (limit and count == limit)\r\n break;\r\n}\r\nds_list_add(list, text);\r\n\r\nreturn list;\r\n\r\n#define __http_parse_url\r\n// ***\r\n// This function forms part of Faucet HTTP v1.0\r\n// https://github.com/TazeTSchnitzel/Faucet-HTTP-Extension\r\n// \r\n// Copyright (c) 2013-2014, Andrea Faulds \r\n// \r\n// Permission to use, copy, modify, and/or distribute this software for any\r\n// purpose with or without fee is hereby granted, provided that the above\r\n// copyright notice and this permission notice appear in all copies.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\r\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\r\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\r\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\r\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\r\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\r\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\r\n// ***\r\n\r\n// Parses a URL into its components\r\n// real __http_parse_url(string url)\r\n\r\n// Return value is a ds_map containing keys for the different URL parts: (or -1 on failure)\r\n// \"url\" - the URL which was passed in\r\n// \"scheme\" - the URL scheme (e.g. \"http\")\r\n// \"host\" - the hostname (e.g. \"example.com\" or \"127.0.0.1\")\r\n// \"port\" - the port (e.g. 8000) - this is a real, unlike the others\r\n// \"abs_path\" - the absolute path (e.g. \"/\" or \"/index.html\")\r\n// \"query\" - the query string (e.g. \"a=b&c=3\")\r\n// Parts which are not included will not be in the map\r\n// e.g. http://example.com will not have the \"port\", \"path\" or \"query\" keys\r\n\r\n// This will *only* work properly for URLs of format:\r\n// scheme \":\" \"//\" host [ \":\" port ] [ abs_path [ \"?\" query ]]\"\r\n// where [] denotes an optional component\r\n// file: URLs will *not* work as they lack the authority (host:port) component\r\n// It will not work correctly for IPv6 host values\r\n\r\nvar url;\r\nurl = argument0;\r\n\r\nvar map;\r\nmap = ds_map_create();\r\nds_map_add(map, 'url', url);\r\n\r\n// before scheme\r\nvar colonPos;\r\n// Find colon for end of scheme\r\ncolonPos = string_pos(':', url);\r\n// No colon - bad URL\r\nif (colonPos == 0)\r\n return -1;\r\nds_map_add(map, 'scheme', string_copy(url, 1, colonPos - 1));\r\nurl = string_copy(url, colonPos + 1, string_length(url) - colonPos);\r\n\r\n// before double slash\r\n// remove slashes (yes this will screw up file:// but who cares)\r\nwhile (string_char_at(url, 1) == '/')\r\n url = string_copy(url, 2, string_length(url) - 1);\r\n\r\n// before hostname\r\nvar slashPos, colonPos;\r\n// Find slash for beginning of path\r\nslashPos = string_pos('/', url);\r\n// No slash ahead - http://host format with no ending slash\r\nif (slashPos == 0)\r\n{\r\n // Find : for beginning of port\r\n colonPos = string_pos(':', url);\r\n}\r\nelse\r\n{\r\n // Find : for beginning of port prior to /\r\n colonPos = string_pos(':', string_copy(url, 1, slashPos - 1));\r\n}\r\n// No colon - no port\r\nif (colonPos == 0)\r\n{\r\n // There was no slash\r\n if (slashPos == 0)\r\n {\r\n ds_map_add(map, 'host', url);\r\n return map;\r\n }\r\n // There was a slash\r\n else\r\n {\r\n ds_map_add(map, 'host', string_copy(url, 1, slashPos - 1));\r\n url = string_copy(url, slashPos, string_length(url) - slashPos + 1);\r\n }\r\n}\r\n// There's a colon - port specified\r\nelse\r\n{\r\n // There was no slash\r\n if (slashPos == 0)\r\n {\r\n ds_map_add(map, 'host', string_copy(url, 1, colonPos - 1));\r\n ds_map_add(map, 'port', real(string_copy(url, colonPos + 1, string_length(url) - colonPos)));\r\n return map;\r\n }\r\n // There was a slash\r\n else\r\n {\r\n ds_map_add(map, 'host', string_copy(url, 1, colonPos - 1));\r\n url = string_copy(url, colonPos + 1, string_length(url) - colonPos);\r\n slashPos = string_pos('/', url);\r\n ds_map_add(map, 'port', real(string_copy(url, 1, slashPos - 1)));\r\n url = string_copy(url, slashPos, string_length(url) - slashPos + 1); \r\n }\r\n}\r\n\r\n// before path\r\nvar queryPos;\r\nqueryPos = string_pos('?', url);\r\n// There's no ? - no query\r\nif (queryPos == 0)\r\n{\r\n ds_map_add(map, 'abs_path', url);\r\n return map;\r\n}\r\nelse\r\n{\r\n ds_map_add(map, 'abs_path', string_copy(url, 1, queryPos - 1));\r\n ds_map_add(map, 'query', string_copy(url, queryPos + 1, string_length(url) - queryPos));\r\n return map;\r\n}\r\n\r\n// Return -1 upon unlikely error\r\nds_map_destroy(map);\r\nreturn -1;\r\n\r\n#define __http_resolve_url\r\n// ***\r\n// This function forms part of Faucet HTTP v1.0\r\n// https://github.com/TazeTSchnitzel/Faucet-HTTP-Extension\r\n// \r\n// Copyright (c) 2013-2014, Andrea Faulds \r\n// \r\n// Permission to use, copy, modify, and/or distribute this software for any\r\n// purpose with or without fee is hereby granted, provided that the above\r\n// copyright notice and this permission notice appear in all copies.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\r\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\r\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\r\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\r\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\r\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\r\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\r\n// ***\r\n\r\n// Takes a base URL and a URL reference and applies it to the base URL\r\n// Returns resulting absolute URL\r\n// string __http_resolve_url(string baseUrl, string refUrl)\r\n\r\n// Return value is a string containing the new absolute URL, or \"\" on failure\r\n\r\n// Works only for restricted URL syntax as understood by by http_resolve_url\r\n// The sole restriction of which is that only scheme://authority/path URLs work\r\n// This notably excludes file: URLs which lack the authority component\r\n\r\n// As described by RFC3986:\r\n// URI-reference = URI / relative-ref\r\n// relative-ref = relative-part [ \"?\" query ] [ \"#\" fragment ]\r\n// relative-part = \"//\" authority path-abempty\r\n// / path-absolute\r\n// / path-noscheme\r\n// / path-empty\r\n// However http_resolve_url does *not* deal with fragments\r\n\r\n// Algorithm based on that of section 5.2.2 of RFC 3986\r\n\r\nvar baseUrl, refUrl;\r\nbaseUrl = argument0;\r\nrefUrl = argument1;\r\n\r\n// Parse base URL\r\nvar urlParts;\r\nurlParts = __http_parse_url(baseUrl);\r\nif (urlParts == -1)\r\n return '';\r\n\r\n// Try to parse reference URL\r\nvar refUrlParts, canParseRefUrl;\r\nrefUrlParts = __http_parse_url(refUrl);\r\ncanParseRefUrl = (refUrlParts != -1);\r\nif (refUrlParts != -1)\r\n ds_map_destroy(refUrlParts);\r\n\r\nvar result;\r\nresult = '';\r\n\r\n// Parsing of reference URL succeeded - it's absolute and we're done\r\nif (canParseRefUrl)\r\n{\r\n result = refUrl;\r\n}\r\n// Begins with '//' - scheme-relative URL\r\nelse if (string_copy(refUrl, 1, 2) == '//' and string_length(refUrl) > 2)\r\n{\r\n result = ds_map_find_value(urlParts, 'scheme') + ':' + refUrl;\r\n}\r\n// Is or begins with '/' - absolute path relative URL\r\nelse if (((string_char_at(refUrl, 1) == '/' and string_length(refUrl) > 1) or refUrl == '/')\r\n// Doesn't begin with ':' and is not blank - relative path relative URL\r\n or (string_char_at(refUrl, 1) != ':' and string_length(refUrl) > 0)) \r\n{\r\n // Find '?' for query\r\n var queryPos;\r\n queryPos = string_pos('?', refUrl);\r\n // No query\r\n if (queryPos == 0)\r\n {\r\n refUrl = __http_resolve_path(ds_map_find_value(urlParts, 'abs_path'), refUrl);\r\n ds_map_replace(urlParts, 'abs_path', refUrl);\r\n if (ds_map_exists(urlParts, 'query'))\r\n ds_map_delete(urlParts, 'query');\r\n }\r\n // Query exists, split\r\n else\r\n {\r\n var path, query;\r\n path = string_copy(refUrl, 1, queryPos - 1);\r\n query = string_copy(refUrl, queryPos + 1, string_length(relUrl) - queryPos);\r\n path = __http_resolve_path(ds_map_find_value(urlParts, 'abs_path'), path);\r\n ds_map_replace(urlParts, 'abs_path', path);\r\n if (ds_map_exists(urlParts, 'query'))\r\n ds_map_replace(urlParts, 'query', query);\r\n else\r\n ds_map_add(urlParts, 'query', query);\r\n }\r\n result = __http_construct_url(urlParts);\r\n}\r\n\r\nds_map_destroy(urlParts);\r\nreturn result;\r\n\r\n#define __http_resolve_path\r\n// ***\r\n// This function forms part of Faucet HTTP v1.0\r\n// https://github.com/TazeTSchnitzel/Faucet-HTTP-Extension\r\n// \r\n// Copyright (c) 2013-2014, Andrea Faulds \r\n// \r\n// Permission to use, copy, modify, and/or distribute this software for any\r\n// purpose with or without fee is hereby granted, provided that the above\r\n// copyright notice and this permission notice appear in all copies.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\r\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\r\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\r\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\r\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\r\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\r\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\r\n// ***\r\n\r\n// Takes a base path and a path reference and applies it to the base path\r\n// Returns resulting absolute path\r\n// string __http_resolve_path(string basePath, string refPath)\r\n\r\n// Return value is a string containing the new absolute path\r\n\r\n// Deals with UNIX-style / paths, not Windows-style \\ paths\r\n// Can be used to clean up .. and . in non-absolute paths too ('' as basePath)\r\n\r\nvar basePath, refPath;\r\nbasePath = argument0;\r\nrefPath = argument1;\r\n\r\n// refPath begins with '/' (is absolute), we can ignore all of basePath\r\nif (string_char_at(refPath, 1) == '/')\r\n{\r\n basePath = refPath;\r\n refPath = '';\r\n}\r\n\r\nvar parts, refParts;\r\nparts = __http_split(basePath, '/', 0);\r\nrefParts = __http_split(refPath, '/', 0);\r\n\r\nif (refPath != '')\r\n{\r\n // Find last part of base path\r\n var lastPart;\r\n lastPart = ds_list_find_value(parts, ds_list_size(parts) - 1);\r\n\r\n // If it's not blank (points to a file), remove it\r\n if (lastPart != '')\r\n {\r\n ds_list_delete(parts, ds_list_size(parts) - 1);\r\n }\r\n \r\n // Concatenate refParts to end of parts\r\n var i;\r\n for (i = 0; i < ds_list_size(refParts); i += 1)\r\n ds_list_add(parts, ds_list_find_value(refParts, i));\r\n}\r\n\r\n// We now don't need refParts any more\r\nds_list_destroy(refParts);\r\n\r\n// Deal with '..' and '.'\r\nfor (i = 0; i < ds_list_size(parts); i += 1)\r\n{\r\n var part;\r\n part = ds_list_find_value(parts, i);\r\n\r\n if (part == '.')\r\n {\r\n if (i == 1 or i == ds_list_size(parts) - 1)\r\n ds_list_replace(parts, i, '');\r\n else\r\n ds_list_delete(parts, i);\r\n i -= 1;\r\n continue;\r\n }\r\n else if (part == '..')\r\n {\r\n if (i > 1)\r\n {\r\n ds_list_delete(parts, i - 1);\r\n ds_list_delete(part, i);\r\n i -= 2;\r\n }\r\n else\r\n {\r\n ds_list_replace(parts, i, '');\r\n i -= 1;\r\n }\r\n continue;\r\n }\r\n else if (part == '' and i != 0 and i != ds_list_size(parts) - 1)\r\n {\r\n ds_list_delete(parts, i);\r\n i -= 1;\r\n continue;\r\n }\r\n}\r\n\r\n// Reconstruct path from parts\r\nvar path;\r\npath = '';\r\nfor (i = 0; i < ds_list_size(parts); i += 1)\r\n{\r\n if (i != 0)\r\n path += '/';\r\n path += ds_list_find_value(parts, i);\r\n}\r\n\r\nds_map_destroy(parts);\r\nreturn path;\r\n\r\n#define __http_parse_hex\r\n// ***\r\n// This function forms part of Faucet HTTP v1.0\r\n// https://github.com/TazeTSchnitzel/Faucet-HTTP-Extension\r\n// \r\n// Copyright (c) 2013-2014, Andrea Faulds \r\n// \r\n// Permission to use, copy, modify, and/or distribute this software for any\r\n// purpose with or without fee is hereby granted, provided that the above\r\n// copyright notice and this permission notice appear in all copies.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\r\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\r\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\r\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\r\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\r\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\r\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\r\n// ***\r\n\r\n// Takes a lowercase hexadecimal string and returns its integer value\r\n// real __http_parse_hex(string hexString)\r\n\r\n// Return value is the whole number value (or -1 if invalid)\r\n// Only works for whole numbers (non-fractional numbers >= 0) and lowercase hex\r\n\r\nvar hexString;\r\nhexString = argument0;\r\n\r\nvar result, hexValues;\r\nresult = 0;\r\nhexValues = \"0123456789abcdef\";\r\n\r\nvar i;\r\nfor (i = 1; i <= string_length(hexString); i += 1) {\r\n result *= 16;\r\n var digit;\r\n digit = string_pos(string_char_at(hexString, i), hexValues) - 1;\r\n if (digit == -1)\r\n return -1;\r\n result += digit;\r\n}\r\n\r\nreturn result;\r\n\r\n#define __http_construct_url\r\n// ***\r\n// This function forms part of Faucet HTTP v1.0\r\n// https://github.com/TazeTSchnitzel/Faucet-HTTP-Extension\r\n// \r\n// Copyright (c) 2013-2014, Andrea Faulds \r\n// \r\n// Permission to use, copy, modify, and/or distribute this software for any\r\n// purpose with or without fee is hereby granted, provided that the above\r\n// copyright notice and this permission notice appear in all copies.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\r\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\r\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\r\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\r\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\r\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\r\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\r\n// ***\r\n\r\n// Constructs an URL from its components (as http_parse_url would return)\r\n// string __http_construct_url(real parts)\r\n\r\n// Return value is the string of the constructed URL\r\n// Keys of parts map:\r\n// \"scheme\" - the URL scheme (e.g. \"http\")\r\n// \"host\" - the hostname (e.g. \"example.com\" or \"127.0.0.1\")\r\n// \"port\" - the port (e.g. 8000) - this is a real, unlike the others\r\n// \"abs_path\" - the absolute path (e.g. \"/\" or \"/index.html\")\r\n// \"query\" - the query string (e.g. \"a=b&c=3\")\r\n// Parts which are omitted will be omitted in the URL\r\n// e.g. http://example.com lacks \"port\", \"path\" or \"query\" keys\r\n\r\n// This will *only* work properly for URLs of format:\r\n// scheme \":\" \"//\" host [ \":\" port ] [ abs_path [ \"?\" query ]]\"\r\n// where [] denotes an optional component\r\n// file: URLs will *not* work as they lack the authority (host:port) component\r\n// Should work correctly for IPv6 host values, but bare in mind parse_url won't\r\n\r\nvar parts;\r\nparts = argument0;\r\n\r\nvar url;\r\nurl = '';\r\n\r\nurl += ds_map_find_value(parts, 'scheme');\r\nurl += '://';\r\nurl += ds_map_find_value(parts, 'host');\r\nif (ds_map_exists(parts, 'port'))\r\n url += ':' + string(ds_map_find_value(parts, 'port'));\r\nif (ds_map_exists(parts, 'abs_path'))\r\n{\r\n url += ds_map_find_value(parts, 'abs_path');\r\n if (ds_map_exists(parts, 'query'))\r\n url += '?' + ds_map_find_value(parts, 'query');\r\n}\r\n\r\nreturn url;\r\n\r\n#define __http_prepare_request\r\n// ***\r\n// This function forms part of Faucet HTTP v1.0\r\n// https://github.com/TazeTSchnitzel/Faucet-HTTP-Extension\r\n// \r\n// Copyright (c) 2013-2014, Andrea Faulds \r\n// \r\n// Permission to use, copy, modify, and/or distribute this software for any\r\n// purpose with or without fee is hereby granted, provided that the above\r\n// copyright notice and this permission notice appear in all copies.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\r\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\r\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\r\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\r\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\r\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\r\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\r\n// ***\r\n\r\n// Internal function - prepares request\r\n// void __http_prepare_request(real client, string url, real headers)\r\n\r\n// client - HttpClient object to prepare\r\n// url - URL to send GET request to\r\n// headers - ds_map of extra headers to send, -1 if none\r\n\r\nvar client, url, headers;\r\nclient = argument0;\r\nurl = argument1;\r\nheaders = argument2;\r\n\r\nvar parsed;\r\nparsed = __http_parse_url(url);\r\n\r\nif (parsed == -1)\r\n show_error(\"Error when making HTTP GET request - can't parse URL: \" + url, true);\r\n\r\nif (!ds_map_exists(parsed, 'port'))\r\n ds_map_add(parsed, 'port', 80);\r\nif (!ds_map_exists(parsed, 'abs_path'))\r\n ds_map_add(parsed, 'abs_path', '/');\r\n\r\nwith (client)\r\n{\r\n destroyed = false;\r\n CR = chr(13);\r\n LF = chr(10);\r\n CRLF = CR + LF;\r\n socket = tcp_connect(ds_map_find_value(parsed, 'host'), ds_map_find_value(parsed, 'port'));\r\n state = 0;\r\n errored = false;\r\n error = '';\r\n linebuf = '';\r\n line = 0;\r\n statusCode = -1;\r\n reasonPhrase = '';\r\n responseBody = buffer_create();\r\n responseBodySize = -1;\r\n responseBodyProgress = -1;\r\n responseHeaders = ds_map_create();\r\n requestUrl = url;\r\n requestHeaders = headers;\r\n\r\n // Request = Request-Line ; Section 5.1\r\n // *(( general-header ; Section 4.5\r\n // | request-header ; Section 5.3\r\n // | entity-header ) CRLF) ; Section 7.1\r\n // CRLF\r\n // [ message-body ] ; Section 4.3\r\n\r\n // \"The Request-Line begins with a method token, followed by the\r\n // Request-URI and the protocol version, and ending with CRLF. The\r\n // elements are separated by SP characters. No CR or LF is allowed\r\n // except in the final CRLF sequence.\"\r\n if (ds_map_exists(parsed, 'query'))\r\n write_string(socket, 'GET ' + ds_map_find_value(parsed, 'abs_path') + '?' + ds_map_find_value(parsed, 'query') + ' HTTP/1.1' + CRLF);\r\n else\r\n write_string(socket, 'GET ' + ds_map_find_value(parsed, 'abs_path') + ' HTTP/1.1' + CRLF);\r\n\r\n // \"A client MUST include a Host header field in all HTTP/1.1 request\r\n // messages.\"\r\n // \"A \"host\" without any trailing port information implies the default\r\n // port for the service requested (e.g., \"80\" for an HTTP URL).\"\r\n if (ds_map_find_value(parsed, 'port') == 80)\r\n write_string(socket, 'Host: ' + ds_map_find_value(parsed, 'host') + CRLF);\r\n else\r\n write_string(socket, 'Host: ' + ds_map_find_value(parsed, 'host')\r\n + ':' + string(ds_map_find_value(parsed, 'port')) + CRLF);\r\n\r\n // \"An HTTP/1.1 server MAY assume that a HTTP/1.1 client intends to\r\n // maintain a persistent connection unless a Connection header including\r\n // the connection-token \"close\" was sent in the request.\"\r\n write_string(socket, 'Connection: close' + CRLF);\r\n\r\n // \"If no Accept-Encoding field is present in a request, the server MAY\r\n // assume that the client will accept any content coding.\"\r\n write_string(socket, 'Accept-Encoding:' + CRLF);\r\n \r\n // If headers specified\r\n if (headers != -1)\r\n {\r\n var key;\r\n // Iterate over headers map\r\n for (key = ds_map_find_first(headers); is_string(key); key = ds_map_find_next(headers, key))\r\n {\r\n write_string(socket, key + ': ' + ds_map_find_value(headers, key) + CRLF);\r\n }\r\n }\r\n \r\n // Send extra CRLF to terminate request\r\n write_string(socket, CRLF);\r\n \r\n socket_send(socket);\r\n\r\n ds_map_destroy(parsed);\r\n}\r\n\r\n#define __http_parse_header\r\n// ***\r\n// This function forms part of Faucet HTTP v1.0\r\n// https://github.com/TazeTSchnitzel/Faucet-HTTP-Extension\r\n// \r\n// Copyright (c) 2013-2014, Andrea Faulds \r\n// \r\n// Permission to use, copy, modify, and/or distribute this software for any\r\n// purpose with or without fee is hereby granted, provided that the above\r\n// copyright notice and this permission notice appear in all copies.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\r\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\r\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\r\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\r\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\r\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\r\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\r\n// ***\r\n\r\n// Internal function - parses header\r\n// real __http_parse_header(string linebuf, real line)\r\n// Returns false if it errored (caller should return and destroy)\r\n\r\nvar linebuf, line;\r\nlinebuf = argument0;\r\nline = argument1;\r\n\r\n// \"HTTP/1.1 header field values can be folded onto multiple lines if the\r\n// continuation line begins with a space or horizontal tab.\"\r\nif ((string_char_at(linebuf, 1) == ' ' or ord(string_char_at(linebuf, 1)) == 9))\r\n{\r\n if (line == 1)\r\n {\r\n errored = true;\r\n error = \"First header line of response can't be a continuation, right?\";\r\n return false;\r\n }\r\n headerValue = ds_map_find_value(responseHeaders, string_lower(headerName))\r\n + string_copy(linebuf, 2, string_length(linebuf) - 1);\r\n}\r\n// \"Each header field consists\r\n// of a name followed by a colon (\":\") and the field value. Field names\r\n// are case-insensitive. The field value MAY be preceded by any amount\r\n// of LWS, though a single SP is preferred.\"\r\nelse\r\n{\r\n var colonPos;\r\n colonPos = string_pos(':', linebuf);\r\n if (colonPos == 0)\r\n {\r\n errored = true;\r\n error = \"No colon in a header line of response\";\r\n return false;\r\n }\r\n headerName = string_copy(linebuf, 1, colonPos - 1);\r\n headerValue = string_copy(linebuf, colonPos + 1, string_length(linebuf) - colonPos);\r\n // \"The field-content does not include any leading or trailing LWS:\r\n // linear white space occurring before the first non-whitespace\r\n // character of the field-value or after the last non-whitespace\r\n // character of the field-value. Such leading or trailing LWS MAY be\r\n // removed without changing the semantics of the field value.\"\r\n while (string_char_at(headerValue, 1) == ' ' or ord(string_char_at(headerValue, 1)) == 9)\r\n headerValue = string_copy(headerValue, 2, string_length(headerValue) - 1);\r\n}\r\n\r\nds_map_add(responseHeaders, string_lower(headerName), headerValue);\r\n\r\nif (string_lower(headerName) == 'content-length')\r\n{\r\n responseBodySize = real(headerValue);\r\n responseBodyProgress = 0;\r\n}\r\n\r\nreturn true;\r\n\r\n#define __http_client_step\r\n// ***\r\n// This function forms part of Faucet HTTP v1.0\r\n// https://github.com/TazeTSchnitzel/Faucet-HTTP-Extension\r\n// \r\n// Copyright (c) 2013-2014, Andrea Faulds \r\n// \r\n// Permission to use, copy, modify, and/or distribute this software for any\r\n// purpose with or without fee is hereby granted, provided that the above\r\n// copyright notice and this permission notice appear in all copies.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\r\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\r\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\r\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\r\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\r\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\r\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\r\n// ***\r\n\r\n// Steps the HTTP client (needs to be called each step or so)\r\n\r\nvar client;\r\nclient = argument0;\r\n\r\nwith (client)\r\n{\r\n if (errored)\r\n exit;\r\n \r\n // Socket error\r\n if (socket_has_error(socket))\r\n {\r\n errored = true;\r\n error = \"Socket error: \" + socket_error(socket);\r\n return __http_client_destroy();\r\n }\r\n \r\n var available;\r\n available = tcp_receive_available(socket);\r\n \r\n switch (state)\r\n {\r\n // Receiving lines\r\n case 0:\r\n if (!available && tcp_eof(socket))\r\n {\r\n errored = true;\r\n error = \"Unexpected EOF when receiving headers/status code\";\r\n return __http_client_destroy();\r\n }\r\n \r\n var bytesRead, c;\r\n for (bytesRead = 1; bytesRead <= available; bytesRead += 1)\r\n {\r\n c = read_string(socket, 1);\r\n // Reached end of line\r\n // \"HTTP/1.1 defines the sequence CR LF as the end-of-line marker for all\r\n // protocol elements except the entity-body (see appendix 19.3 for\r\n // tolerant applications).\"\r\n if (c == LF and string_char_at(linebuf, string_length(linebuf)) == CR)\r\n {\r\n // Strip trailing CR\r\n linebuf = string_copy(linebuf, 1, string_length(linebuf) - 1);\r\n // First line - status code\r\n if (line == 0)\r\n {\r\n // \"The first line of a Response message is the Status-Line, consisting\r\n // of the protocol version followed by a numeric status code and its\r\n // associated textual phrase, with each element separated by SP\r\n // characters. No CR or LF is allowed except in the final CRLF sequence.\"\r\n var httpVer, spacePos;\r\n spacePos = string_pos(' ', linebuf);\r\n if (spacePos == 0)\r\n {\r\n errored = true;\r\n error = \"No space in first line of response\";\r\n return __http_client_destroy();\r\n }\r\n httpVer = string_copy(linebuf, 1, spacePos);\r\n linebuf = string_copy(linebuf, spacePos + 1, string_length(linebuf) - spacePos);\r\n \r\n spacePos = string_pos(' ', linebuf);\r\n if (spacePos == 0)\r\n {\r\n errored = true;\r\n error = \"No second space in first line of response\";\r\n return __http_client_destroy();\r\n }\r\n statusCode = real(string_copy(linebuf, 1, spacePos));\r\n reasonPhrase = string_copy(linebuf, spacePos + 1, string_length(linebuf) - spacePos);\r\n }\r\n // Other line\r\n else\r\n {\r\n // Blank line, end of response headers\r\n if (linebuf == '')\r\n {\r\n state = 1;\r\n // write remainder\r\n write_buffer_part(responseBody, socket, available - bytesRead);\r\n responseBodyProgress = available - bytesRead;\r\n break;\r\n }\r\n // Header\r\n else\r\n {\r\n if (!__http_parse_header(linebuf, line))\r\n return __http_client_destroy();\r\n }\r\n }\r\n \r\n linebuf = '';\r\n line += 1;\r\n }\r\n else\r\n linebuf += c;\r\n }\r\n break;\r\n // Receiving response body\r\n case 1:\r\n write_buffer(responseBody, socket);\r\n responseBodyProgress += available;\r\n if (tcp_eof(socket))\r\n {\r\n if (ds_map_exists(responseHeaders, 'transfer-encoding'))\r\n {\r\n if (ds_map_find_value(responseHeaders, 'transfer-encoding') == 'chunked')\r\n {\r\n // Chunked transfer, let's decode it\r\n var actualResponseBody, actualResponseSize;\r\n actualResponseBody = buffer_create();\r\n actualResponseBodySize = 0;\r\n\r\n // Parse chunks\r\n // chunk = chunk-size [ chunk-extension ] CRLF\r\n // chunk-data CRLF\r\n // chunk-size = 1*HEX\r\n while (buffer_bytes_left(responseBody))\r\n {\r\n var chunkSize, c;\r\n chunkSize = '';\r\n \r\n // Read chunk size byte by byte \r\n while (buffer_bytes_left(responseBody))\r\n {\r\n c = read_string(responseBody, 1);\r\n if (c == CR or c == ';')\r\n break;\r\n else\r\n chunkSize += c;\r\n }\r\n \r\n // We found a semicolon - beginning of chunk-extension\r\n if (c == ';')\r\n {\r\n // skip all extension stuff\r\n while (buffer_bytes_left(responseBody) && c != CR)\r\n {\r\n c = read_string(responseBody, 1);\r\n }\r\n }\r\n // Reached end of header\r\n if (c == CR)\r\n {\r\n c += read_string(responseBody, 1);\r\n // Doesn't end in CRLF\r\n if (c != CRLF)\r\n {\r\n errored = true;\r\n error = 'header of chunk in chunked transfer did not end in CRLF';\r\n buffer_destroy(actualResponseBody);\r\n return __http_client_destroy();\r\n }\r\n // chunk-size is empty - something's up!\r\n if (chunkSize == '')\r\n {\r\n errored = true;\r\n error = 'empty chunk-size in a chunked transfer';\r\n buffer_destroy(actualResponseBody);\r\n return __http_client_destroy();\r\n }\r\n chunkSize = __http_parse_hex(chunkSize);\r\n // Parsing of size failed - not hex?\r\n if (chunkSize == -1)\r\n {\r\n errored = true;\r\n error = 'chunk-size was not hexadecimal in a chunked transfer';\r\n buffer_destroy(actualResponseBody);\r\n return __http_client_destroy();\r\n }\r\n // Is the chunk bigger than the remaining response?\r\n if (chunkSize + 2 > buffer_bytes_left(responseBody))\r\n {\r\n errored = true;\r\n error = 'chunk-size was greater than remaining data in a chunked transfer';\r\n buffer_destroy(actualResponseBody);\r\n return __http_client_destroy();\r\n }\r\n // OK, everything's good, read the chunk\r\n write_buffer_part(actualResponseBody, responseBody, chunkSize);\r\n actualResponseBodySize += chunkSize;\r\n // Check for CRLF\r\n if (read_string(responseBody, 2) != CRLF)\r\n {\r\n errored = true;\r\n error = 'chunk did not end in CRLF in a chunked transfer';\r\n return __http_client_destroy();\r\n }\r\n }\r\n else\r\n {\r\n errored = true;\r\n error = 'did not find CR after reading chunk header in a chunked transfer, Faucet HTTP bug?';\r\n return __http_client_destroy();\r\n }\r\n // if the chunk size is zero, then it was the last chunk\r\n if (chunkSize == 0\r\n // trailer headers will be present\r\n and ds_map_exists(responseHeaders, 'trailer'))\r\n {\r\n // Parse header lines\r\n var line;\r\n line = 1;\r\n while (buffer_bytes_left(responseBody))\r\n {\r\n var linebuf;\r\n linebuf = '';\r\n while (buffer_bytes_left(responseBody))\r\n {\r\n c = read_string(responseBody, 1);\r\n if (c != CR)\r\n linebuf += c;\r\n else\r\n break;\r\n }\r\n c += read_string(responseBody, 1);\r\n if (c != CRLF)\r\n {\r\n errored = true;\r\n error = 'trailer header did not end in CRLF in a chunked transfer';\r\n return __http_client_destroy();\r\n }\r\n if (!__http_parse_header(linebuf, line))\r\n return __http_client_destroy();\r\n line += 1;\r\n }\r\n }\r\n }\r\n responseBodySize = actualResponseBodySize;\r\n buffer_destroy(responseBody);\r\n responseBody = actualResponseBody;\r\n }\r\n else\r\n {\r\n errored = true;\r\n error = 'Unsupported Transfer-Encoding: \"' + ds_map_find_value(responseHaders, 'transfer-encoding') + '\"';\r\n return __http_client_destroy();\r\n }\r\n }\r\n else if (responseBodySize != -1)\r\n {\r\n if (responseBodyProgress < responseBodySize)\r\n {\r\n errored = true;\r\n error = \"Unexpected EOF, response body size is less than expected\";\r\n return __http_client_destroy();\r\n }\r\n }\r\n // 301 Moved Permanently/302 Found/303 See Other/307 Moved Temporarily\r\n if (statusCode == 301 or statusCode == 302 or statusCode == 303 or statusCode == 307)\r\n {\r\n if (ds_map_exists(responseHeaders, 'location'))\r\n {\r\n var location, resolved;\r\n location = ds_map_find_value(responseHeaders, 'location');\r\n resolved = __http_resolve_url(requestUrl, location);\r\n // Resolving URL didn't fail and it's http://\r\n if (resolved != '' and string_copy(resolved, 1, 7) == 'http://')\r\n {\r\n // Restart request\r\n __http_client_destroy();\r\n __http_prepare_request(client, resolved, requestHeaders);\r\n }\r\n else\r\n {\r\n errored = true;\r\n error = \"301, 302, 303 or 307 response with invalid or unsupported Location URL ('\" + location + \"') - can't redirect\";\r\n return __http_client_destroy();\r\n }\r\n exit;\r\n }\r\n else\r\n {\r\n errored = true;\r\n error = \"301, 302, 303 or 307 response without Location header - can't redirect\";\r\n return __http_client_destroy();\r\n }\r\n }\r\n else\r\n state = 2;\r\n }\r\n break;\r\n // Done.\r\n case 2:\r\n break;\r\n }\r\n}\r\n\r\n#define __http_client_destroy\r\n// ***\r\n// This function forms part of Faucet HTTP v1.0\r\n// https://github.com/TazeTSchnitzel/Faucet-HTTP-Extension\r\n// \r\n// Copyright (c) 2013-2014, Andrea Faulds \r\n// \r\n// Permission to use, copy, modify, and/or distribute this software for any\r\n// purpose with or without fee is hereby granted, provided that the above\r\n// copyright notice and this permission notice appear in all copies.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\r\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\r\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\r\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\r\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\r\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\r\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\r\n// ***\r\n\r\n// Clears up contents of an httpClient prior to destruction or after error\r\n\r\nif (!destroyed) {\r\n socket_destroy(socket);\r\n buffer_destroy(responseBody);\r\n ds_map_destroy(responseHeaders);\r\n}\r\ndestroyed = true;\r\n\r\n#define http_new_get\r\n// ***\r\n// This function forms part of Faucet HTTP v1.0\r\n// https://github.com/TazeTSchnitzel/Faucet-HTTP-Extension\r\n// \r\n// Copyright (c) 2013-2014, Andrea Faulds \r\n// \r\n// Permission to use, copy, modify, and/or distribute this software for any\r\n// purpose with or without fee is hereby granted, provided that the above\r\n// copyright notice and this permission notice appear in all copies.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\r\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\r\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\r\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\r\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\r\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\r\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\r\n// ***\r\n\r\n// Makes a GET HTTP request\r\n// real http_new_get(string url)\r\n\r\n// url - URL to send GET request to\r\n\r\n// Return value is an HttpClient instance that can be passed to\r\n// fct_http_request_status etc.\r\n// (errors on failure to parse URL)\r\n\r\nvar url, client;\r\n\r\nurl = argument0;\r\n\r\nif (!variable_global_exists('__HttpClient'))\r\n __http_init();\r\n\r\nclient = instance_create(0, 0, global.__HttpClient);\r\n__http_prepare_request(client, url, -1);\r\nreturn client;\r\n\r\n#define http_new_get_ex\r\n// ***\r\n// This function forms part of Faucet HTTP v1.0\r\n// https://github.com/TazeTSchnitzel/Faucet-HTTP-Extension\r\n// \r\n// Copyright (c) 2013-2014, Andrea Faulds \r\n// \r\n// Permission to use, copy, modify, and/or distribute this software for any\r\n// purpose with or without fee is hereby granted, provided that the above\r\n// copyright notice and this permission notice appear in all copies.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\r\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\r\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\r\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\r\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\r\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\r\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\r\n// ***\r\n\r\n// Makes a GET HTTP request with custom headers\r\n// real http_new_get_ex(string url, real headers)\r\n\r\n// url - URL to send GET request to\r\n// headers - ds_map of extra headers to send\r\n\r\n// Return value is an HttpClient instance that can be passed to\r\n// fct_http_request_status etc.\r\n// (errors on failure to parse URL)\r\n\r\nvar url, headers, client;\r\n\r\nurl = argument0;\r\nheaders = argument1;\r\n\r\nif (!variable_global_exists('__HttpClient'))\r\n __http_init();\r\n\r\nclient = instance_create(0, 0, global.__HttpClient);\r\n__http_prepare_request(client, url, headers);\r\nreturn client;\r\n\r\n#define http_step\r\n// ***\r\n// This function forms part of Faucet HTTP v1.0\r\n// https://github.com/TazeTSchnitzel/Faucet-HTTP-Extension\r\n// \r\n// Copyright (c) 2013-2014, Andrea Faulds \r\n// \r\n// Permission to use, copy, modify, and/or distribute this software for any\r\n// purpose with or without fee is hereby granted, provided that the above\r\n// copyright notice and this permission notice appear in all copies.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\r\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\r\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\r\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\r\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\r\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\r\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\r\n// ***\r\n\r\n// Steps the HTTP client. This is what makes everything actually happen.\r\n// Call it each step. Returns whether or not the request has finished.\r\n// real http_step(real client)\r\n\r\n// client - HttpClient object\r\n\r\n// Return value is either:\r\n// 0 - In progress\r\n// 1 - Done or Errored\r\n\r\n// Example usage:\r\n// req = http_new_get(\"http://example.com/x.txt\");\r\n// while (http_step(req)) {}\r\n// if (http_status_code(req) != 200) {\r\n// // Errored!\r\n// } else {\r\n// // Hasn't errored, do stuff here.\r\n// }\r\n\r\nvar client;\r\nclient = argument0;\r\n\r\n__http_client_step(client);\r\n\r\nif (client.errored || client.state == 2)\r\n return 1;\r\nelse\r\n return 0;\r\n\r\n#define http_status_code\r\n// ***\r\n// This function forms part of Faucet HTTP v1.0\r\n// https://github.com/TazeTSchnitzel/Faucet-HTTP-Extension\r\n// \r\n// Copyright (c) 2013-2014, Andrea Faulds \r\n// \r\n// Permission to use, copy, modify, and/or distribute this software for any\r\n// purpose with or without fee is hereby granted, provided that the above\r\n// copyright notice and this permission notice appear in all copies.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\r\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\r\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\r\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\r\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\r\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\r\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\r\n// ***\r\n\r\n// Gets the status code\r\n// real http_status_code(real client)\r\n\r\n// client - HttpClient object\r\n\r\n// Return value is either:\r\n// * 0, if the request has not yet finished\r\n// * a negative value, if there was an internal Faucet HTTP error\r\n// * a positive value, the status code of the HTTP request\r\n\r\n// \"The Status-Code element is a 3-digit integer result code of the\r\n// attempt to understand and satisfy the request. These codes are fully\r\n// defined in section 10. The Reason-Phrase is intended to give a short\r\n// textual description of the Status-Code. The Status-Code is intended\r\n// for use by automata and the Reason-Phrase is intended for the human\r\n// user. The client is not required to examine or display the Reason-\r\n// Phrase.\"\r\n\r\n// See also: http_reason_phrase, gets the Reason-Phrase\r\n\r\nvar client;\r\nclient = argument0;\r\n\r\nif (client.errored)\r\n return -1;\r\nelse if (client.state == 2)\r\n return client.statusCode;\r\nelse\r\n return 0;\r\n\r\n#define http_reason_phrase\r\n// ***\r\n// This function forms part of Faucet HTTP v1.0\r\n// https://github.com/TazeTSchnitzel/Faucet-HTTP-Extension\r\n// \r\n// Copyright (c) 2013-2014, Andrea Faulds \r\n// \r\n// Permission to use, copy, modify, and/or distribute this software for any\r\n// purpose with or without fee is hereby granted, provided that the above\r\n// copyright notice and this permission notice appear in all copies.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\r\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\r\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\r\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\r\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\r\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\r\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\r\n// ***\r\n\r\n// Gets the reason phrase\r\n// string http_reason_phrase(real client)\r\n\r\n// client - HttpClient object\r\n// Return value is either:\r\n// * \"\", if the request has not yet finished\r\n// * an internal Faucet HTTP error message, if there was one\r\n// * the reason phrase of the HTTP request\r\n\r\n// \"The Status-Code element is a 3-digit integer result code of the\r\n// attempt to understand and satisfy the request. These codes are fully\r\n// defined in section 10. The Reason-Phrase is intended to give a short\r\n// textual description of the Status-Code. The Status-Code is intended\r\n// for use by automata and the Reason-Phrase is intended for the human\r\n// user. The client is not required to examine or display the Reason-\r\n// Phrase.\"\r\n\r\n// See also: http_status_code, gets the Status-Code\r\n\r\nvar client;\r\nclient = argument0;\r\n\r\nif (client.errored)\r\n return client.error;\r\nelse if (client.state == 2)\r\n return client.reasonPhrase;\r\nelse\r\n return \"\";\r\n\r\n#define http_response_body\r\n// ***\r\n// This function forms part of Faucet HTTP v1.0\r\n// https://github.com/TazeTSchnitzel/Faucet-HTTP-Extension\r\n// \r\n// Copyright (c) 2013-2014, Andrea Faulds \r\n// \r\n// Permission to use, copy, modify, and/or distribute this software for any\r\n// purpose with or without fee is hereby granted, provided that the above\r\n// copyright notice and this permission notice appear in all copies.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\r\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\r\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\r\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\r\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\r\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\r\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\r\n// ***\r\n\r\n// Gets the response body returned by an HTTP request as a buffer\r\n// real http_response_body(real client)\r\n\r\n// client - HttpClient object\r\n\r\n// Return value is a buffer if client hasn't errored and is finished\r\n\r\nvar client;\r\nclient = argument0;\r\n\r\nreturn client.responseBody;\r\n\r\n#define http_response_body_size\r\n// ***\r\n// This function forms part of Faucet HTTP v1.0\r\n// https://github.com/TazeTSchnitzel/Faucet-HTTP-Extension\r\n// \r\n// Copyright (c) 2013-2014, Andrea Faulds \r\n// \r\n// Permission to use, copy, modify, and/or distribute this software for any\r\n// purpose with or without fee is hereby granted, provided that the above\r\n// copyright notice and this permission notice appear in all copies.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\r\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\r\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\r\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\r\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\r\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\r\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\r\n// ***\r\n\r\n// Gets the size of response body returned by an HTTP request\r\n// real http_response_body_size(real client)\r\n\r\n// client - HttpClient object\r\n\r\n// Return value is the size in bytes, or -1 if we don't know or don't know yet\r\n\r\n// Call this each time you use the size - it may have changed in the case of redirect\r\n\r\nvar client;\r\nclient = argument0;\r\n\r\nreturn client.responseBodySize;\r\n\r\n#define http_response_body_progress\r\n// ***\r\n// This function forms part of Faucet HTTP v1.0\r\n// https://github.com/TazeTSchnitzel/Faucet-HTTP-Extension\r\n// \r\n// Copyright (c) 2013-2014, Andrea Faulds \r\n// \r\n// Permission to use, copy, modify, and/or distribute this software for any\r\n// purpose with or without fee is hereby granted, provided that the above\r\n// copyright notice and this permission notice appear in all copies.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\r\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\r\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\r\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\r\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\r\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\r\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\r\n// ***\r\n\r\n// Gets the size of response body returned by an HTTP request which is so far downloaded \r\n// real http_response_body_progress(real client)\r\n\r\n// client - HttpClient object\r\n\r\n// Return value is the size in bytes, or -1 if we haven't started yet or client has errored\r\n\r\nvar client;\r\nclient = argument0;\r\n\r\nreturn client.responseBodyProgress;\r\n\r\n#define http_response_headers\r\n// ***\r\n// This function forms part of Faucet HTTP v1.0\r\n// https://github.com/TazeTSchnitzel/Faucet-HTTP-Extension\r\n// \r\n// Copyright (c) 2013-2014, Andrea Faulds \r\n// \r\n// Permission to use, copy, modify, and/or distribute this software for any\r\n// purpose with or without fee is hereby granted, provided that the above\r\n// copyright notice and this permission notice appear in all copies.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\r\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\r\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\r\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\r\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\r\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\r\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\r\n// ***\r\n\r\n// Gets the response headers returned by an HTTP request as a ds_map\r\n// real http_response_headers(real client)\r\n\r\n// client - HttpClient object\r\n\r\n// Return value is a ds_map if client hasn't errored and is finished\r\n\r\n// All headers will have lowercase keys\r\n// The ds_map is owned by the HttpClient, do not use ds_map_destroy() yourself\r\n// Call when the request has finished - otherwise may be incomplete or missing\r\n\r\nvar client;\r\nclient = argument0;\r\n\r\nreturn client.responseHeaders;\r\n\r\n#define http_destroy\r\n// ***\r\n// This function forms part of Faucet HTTP v1.0\r\n// https://github.com/TazeTSchnitzel/Faucet-HTTP-Extension\r\n// \r\n// Copyright (c) 2013-2014, Andrea Faulds \r\n// \r\n// Permission to use, copy, modify, and/or distribute this software for any\r\n// purpose with or without fee is hereby granted, provided that the above\r\n// copyright notice and this permission notice appear in all copies.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\r\n// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\r\n// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\r\n// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\r\n// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\r\n// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\r\n// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\r\n// ***\r\n\r\n// Cleans up HttpClient\r\n// void http_destroy(real client)\r\n\r\n// client - HttpClient object\r\n\r\nvar client;\r\nclient = argument0;\r\n\r\nwith (client)\r\n{\r\n __http_client_destroy();\r\n instance_destroy();\r\n}\r\n\r\n" }, { "path": "src/test/resources/samples/langs/Game Maker Language/jsonion.gml", "content": "// Originally from /jsonion.gml in JSOnion\r\n// JSOnion v1.0.0d is licensed under the MIT licence. You may freely adapt and use this library in commercial and non-commercial projects.\r\n\r\n#define __jso_gmt_tuple\r\n{\r\n\r\n /**\r\n tuple(>element_0<, >element_1<, ..., >element_n<): Return an n-tuple\r\n @author: GameGeisha\r\n @version: 1.2 (GMTuple)\r\n */\r\n\r\n //Position, address table and data\r\n var pos, addr_table, data;\r\n pos = 6*argument_count+4;\r\n addr_table = \"\";\r\n data = \"\";\r\n \r\n //Build the tuple element-by-element\r\n var i, ca, isstr, datastr;\r\n for (i=0; ith element of \r\n @author: GameGeisha\r\n @version: 1.2 (GMTuple)\r\n */\r\n\r\n //Capture arguments\r\n var t, n, size;\r\n t = argument0;\r\n n = argument1;\r\n size = __jso_gmt_size(t);\r\n \r\n //Search for the bounding positions for the th element in the address table\r\n var start, afterend, isstr;\r\n isstr = ord(string_char_at(t, 4+6*n))-$30;\r\n start = real(string_copy(t, 5+6*n, 5));\r\n if (n < size-1) {\r\n afterend = real(string_copy(t, 11+6*n, 5));\r\n } else {\r\n afterend = string_length(t)+1;\r\n }\r\n \r\n //Return the th element with the correct type\r\n if (isstr) {\r\n return string_copy(t, start, afterend-start);\r\n }\r\n else {\r\n return real(string_copy(t, start, afterend-start));\r\n }\r\n\r\n}\r\n\r\n#define __jso_gmt_size\r\n{\r\n \r\n /**\r\n size(tuple_source): Return the size of \r\n @author: GameGeisha\r\n @version: 1.2 (GMTuple)\r\n */\r\n\r\n return real(string_copy(argument0, 1, 3));\r\n\r\n}\r\n\r\n#define __jso_gmt_numtostr\r\n{\r\n\r\n /**\r\n __gmt_numtostr(num): Return string representation of . Decimal numbers expressed as scientific notation\r\n with double precision (i.e. 15 digits)\r\n @author: GameGeisha\r\n @version: 1.2 (edited)\r\n */\r\n if (frac(argument0) == 0) {\r\n return string(argument0);\r\n }\r\n \r\n var mantissa, exponent;\r\n exponent = floor(log10(abs(argument0)));\r\n mantissa = string_format(argument0/power(10,exponent), 15, 14);\r\n var i, ca;\r\n i = string_length(mantissa);\r\n do {\r\n ca = string_char_at(mantissa, i);\r\n i -= 1;\r\n } until (ca != \"0\")\r\n if (ca != \".\") {\r\n mantissa = string_copy(mantissa, 1, i+1);\r\n }\r\n else {\r\n mantissa = string_copy(mantissa, 1, i);\r\n }\r\n if (exponent != 0) {\r\n return mantissa + \"e\" + string(exponent);\r\n }\r\n else {\r\n return mantissa;\r\n }\r\n\r\n}\r\n\r\n#define __jso_gmt_test_all\r\n{\r\n\r\n /**\r\n test_all(): Runs all test suites\r\n @author: GameGeisha\r\n @version: 1.2 (GMTuple)\r\n */\r\n \r\n //Automated testing sequence\r\n __jso_gmt_test_elem();\r\n __jso_gmt_test_size();\r\n __jso_gmt_test_numtostr();\r\n\r\n}\r\n\r\n#define __jso_gmt_test_numtostr\r\n{\r\n \r\n /**\r\n _test_numtostr(): Runs number-to-string tests\r\n @author: GameGeisha\r\n @version: 1.2 (GMTuple)\r\n */\r\n\r\n var tolerance;\r\n tolerance = 1/10000000000;\r\n\r\n if (real(__jso_gmt_numtostr(9)) != 9) {\r\n show_message(\"Scientific notation conversion failed for 1-digit integer! Result: \" + __jso_gmt_numtostr(9));\r\n }\r\n if (real(__jso_gmt_numtostr(500)) != 500) {\r\n show_message(\"Scientific notation conversion failed for 3-digit integer! Result: \" + __jso_gmt_numtostr(500));\r\n }\r\n if (abs(real(__jso_gmt_numtostr(pi))-pi) > tolerance) {\r\n show_message(\"Scientific notation conversion failed for pi! Result: \" + __jso_gmt_numtostr(pi));\r\n }\r\n if (abs(real(__jso_gmt_numtostr(104729.903455))-104729.903455) > tolerance) {\r\n show_message(\"Scientific notation conversion failed for large decimal number! Result: \" + __jso_gmt_numtostr(104729.903455));\r\n }\r\n if (abs(real(__jso_gmt_numtostr(-pi))+pi) > tolerance) {\r\n show_message(\"Scientific notation conversion failed for -pi! Result: \" + __jso_gmt_numtostr(-pi));\r\n }\r\n if (abs(real(__jso_gmt_numtostr(1/pi))-1/pi) > tolerance) {\r\n show_message(\"Scientific notation conversion failed for 1/pi! Result: \" + __jso_gmt_numtostr(1/pi));\r\n }\r\n\r\n}\r\n\r\n#define __jso_gmt_test_elem\r\n{\r\n\r\n /**\r\n _test_elem(): Runs tuple element retrieval tests\r\n @author: GameGeisha\r\n @version: 1.2 (GMTuple)\r\n */\r\n\r\n if (__jso_gmt_elem(__jso_gmt_tuple(\"Qblock\", \"kll\"), 0) != \"Qblock\") {\r\n show_message(\"Element retrieval failed for simple string. #Should be:Qblock#Actual:\" + __jso_gmt_elem(__jso_gmt_tuple(\"Qblock\"), 0));\r\n }\r\n if (__jso_gmt_elem(__jso_gmt_tuple(9, \"Q\", -7), 0) != 9) {\r\n show_message(\"Element retrieval failed for simple number. #Should be 9#Actual:\" + string(__jso_gmt_elem(__jso_gmt_tuple(9, \"Q\", 7), 0)));\r\n }\r\n if (__jso_gmt_elem(__jso_gmt_tuple(\"Qblock\", \"\", \"Negg\"), 1) != \"\") {\r\n show_message(\"Element retrieval failed for empty string#Should be empty string#Actual:\"+string(__jso_gmt_elem(__jso_gmt_tuple(\"Qblock\", \"\", \"Negg\"), 0)));\r\n }\r\n \r\n if (__jso_gmt_elem(__jso_gmt_elem(__jso_gmt_tuple(\"Not this\", __jso_gmt_tuple(0, 1, 2, 3), \"Waahoo\"), 1), 3) != 3) {\r\n show_message(\"Element retrieval failed in nested tuple. #Should be 3#Actual:\" + string(__jso_gmt_elem(__jso_gmt_elem(__jso_gmt_tuple(\"Not this\", __jso_gmt_tuple(0, 1, 2, 3), \"Waahoo\"), 1), 3)));\r\n } \r\n\r\n}\r\n\r\n#define __jso_gmt_test_size\r\n{\r\n\r\n /**\r\n _test_size(): Runs tuple size tests\r\n @author: GameGeisha\r\n @version: 1.2 (GMTuple)\r\n */\r\n\r\n if (__jso_gmt_size(__jso_gmt_tuple(\"Waahoo\", \"Negg\", 0)) != 3) {\r\n show_message(\"Bad size for 3-tuple\");\r\n }\r\n if (__jso_gmt_size(__jso_gmt_tuple()) != 0) {\r\n show_message(\"Bad size for null tuple\");\r\n }\r\n if (__jso_gmt_size(__jso_gmt_tuple(7)) != 1) {\r\n show_message(\"Bad size for 1-tuple\");\r\n }\r\n if (__jso_gmt_size(__jso_gmt_tuple(1,2,3,4,5,6,7,8,9,10)) != 10) {\r\n show_message(\"Bad size for 10-tuple\");\r\n }\r\n\r\n}\r\n\r\n#define jso_new_map\r\n{\r\n /**\r\n jso_new_map(): Create a new map.\r\n JSOnion version: 1.0.0d\r\n */\r\n return ds_map_create();\r\n}\r\n\r\n#define jso_new_list\r\n{\r\n /**\r\n jso_new_list(): Create a new list.\r\n JSOnion version: 1.0.0d\r\n */\r\n return ds_list_create();\r\n}\r\n\r\n#define jso_map_add_real\r\n{\r\n /**\r\n jso_map_add_real(map, key, val): Add the key-value pair : to , where is a real value.\r\n JSOnion version: 1.0.0d\r\n */\r\n ds_map_add(argument0, argument1, argument2);\r\n}\r\n\r\n#define jso_map_add_string\r\n{\r\n /**\r\n jso_map_add_string(map, key, str): Add the key-value pair : to , where is a string value.\r\n JSOnion version: 1.0.0d\r\n */\r\n ds_map_add(argument0, argument1, \"s\" + argument2);\r\n}\r\n\r\n#define jso_map_add_sublist\r\n{\r\n /**\r\n jso_map_add_sublist(map, key, sublist): Add the key-value pair : to , where is a list.\r\n JSOnion version: 1.0.0d\r\n */\r\n ds_map_add(argument0, argument1, \"l\" + string(argument2));\r\n}\r\n\r\n#define jso_map_add_submap\r\n{\r\n /**\r\n jso_map_add_submap(map, key, submap): Add the key-value pair : to , where is a map.\r\n JSOnion version: 1.0.0d\r\n */\r\n ds_map_add(argument0, argument1, \"m\" + string(argument2));\r\n}\r\n\r\n#define jso_map_add_integer\r\n{\r\n /**\r\n jso_map_add_integer(map, key, int): Add the key-value pair : to , where is a integer value.\r\n JSOnion version: 1.0.0d\r\n */\r\n ds_map_add(argument0, argument1, floor(argument2));\r\n}\r\n\r\n#define jso_map_add_boolean\r\n{\r\n /**\r\n jso_map_add_boolean(map, key, bool): Add the key-value pair : to , where is a boolean value.\r\n JSOnion version: 1.0.0d\r\n */\r\n if (argument2) {\r\n ds_map_add(argument0, argument1, \"btrue\");\r\n } else {\r\n ds_map_add(argument0, argument1, \"bfalse\");\r\n }\r\n}\r\n\r\n#define jso_list_add_real\r\n{\r\n /**\r\n jso_list_add_real(list, val): Append the real value to .\r\n JSOnion version: 1.0.0d\r\n */\r\n ds_list_add(argument0, argument1);\r\n}\r\n\r\n#define jso_list_add_string\r\n{\r\n /**\r\n jso_list_add_string(list, str): Append the string value to .\r\n JSOnion version: 1.0.0d\r\n */\r\n ds_list_add(argument0, \"s\" + argument1);\r\n}\r\n\r\n#define jso_list_add_sublist\r\n{\r\n /**\r\n jso_list_add_sublist(list, sublist): Append the list to .\r\n JSOnion version: 1.0.0d\r\n */\r\n ds_list_add(argument0, \"l\" + string(argument1));\r\n}\r\n\r\n#define jso_list_add_submap\r\n{\r\n /**\r\n jso_list_add_submap(list, submap): Append the map to .\r\n JSOnion version: 1.0.0d\r\n */\r\n ds_list_add(argument0, \"m\" + string(argument1));\r\n}\r\n\r\n#define jso_list_add_integer\r\n{\r\n /**\r\n jso_list_add_integer(list, int): Append the integer to .\r\n JSOnion version: 1.0.0d\r\n */\r\n ds_list_add(argument0, floor(argument1));\r\n}\r\n\r\n#define jso_list_add_boolean\r\n{\r\n /**\r\n jso_list_add_boolean(list, bool): Append the boolean value to .\r\n JSOnion version: 1.0.0d\r\n */\r\n if (argument1) {\r\n ds_list_add(argument0, \"btrue\");\r\n } else {\r\n ds_list_add(argument0, \"bfalse\");\r\n }\r\n}\r\n\r\n#define jso_map_get\r\n{\r\n /**\r\n jso_map_get(map, key): Retrieve the value stored in with the key value , with the correct type.\r\n JSOnion version: 1.0.0d\r\n */\r\n\r\n //Grab the value\r\n var v;\r\n v = ds_map_find_value(argument0, argument1);\r\n \r\n //String; could be string, map or list\r\n if (is_string(v)) {\r\n switch (string_char_at(v, 1)) {\r\n case \"s\":\r\n return string_delete(v, 1, 1);\r\n break;\r\n case \"l\": case \"m\":\r\n return real(string_delete(v, 1, 1));\r\n break;\r\n case \"b\":\r\n if (v == \"btrue\") {\r\n return true;\r\n }\r\n else if (v == \"bfalse\") {\r\n return false;\r\n }\r\n else {\r\n show_error(\"Invalid boolean value.\", true);\r\n }\r\n break;\r\n default: show_error(\"Invalid map contents.\", true); break;\r\n } \r\n }\r\n \r\n //Real; return real value as-is\r\n else {\r\n return v;\r\n }\r\n}\r\n\r\n#define jso_map_get_type\r\n{\r\n /**\r\n jso_map_get_type(map, key): Return the type of value to which the key value is mapped to in .\r\n JSOnion version: 1.0.0d\r\n */\r\n\r\n //Grab the value\r\n var v;\r\n v = ds_map_find_value(argument0, argument1);\r\n \r\n //String; could be string, map or list\r\n if (is_string(v)) {\r\n switch (string_char_at(v, 1)) {\r\n case \"s\":\r\n return jso_type_string;\r\n break;\r\n case \"l\":\r\n return jso_type_list;\r\n break;\r\n case \"m\":\r\n return jso_type_map;\r\n break;\r\n case \"b\":\r\n return jso_type_boolean;\r\n break;\r\n default: show_error(\"Invalid map content type.\", true); break;\r\n } \r\n }\r\n \r\n //Real\r\n else {\r\n return jso_type_real;\r\n }\r\n}\r\n\r\n#define jso_list_get\r\n{\r\n /**\r\n jso_list_get(list, index): Retrieve the value stored in at position , with the correct type.\r\n JSOnion version: 1.0.0d\r\n */\r\n\r\n //Grab the value\r\n var v;\r\n v = ds_list_find_value(argument0, argument1);\r\n \r\n //String; could be string, map or list\r\n if (is_string(v)) {\r\n switch (string_char_at(v, 1)) {\r\n case \"s\":\r\n return string_delete(v, 1, 1);\r\n break;\r\n case \"l\": case \"m\":\r\n return real(string_delete(v, 1, 1));\r\n break;\r\n case \"b\":\r\n if (v == \"btrue\") {\r\n return true;\r\n }\r\n else if (v == \"bfalse\") {\r\n return false;\r\n }\r\n else {\r\n show_error(\"Invalid boolean value.\", true);\r\n }\r\n break;\r\n default: show_error(\"Invalid list contents.\", true); break;\r\n } \r\n }\r\n \r\n //Real; return real value as-is\r\n else {\r\n return v;\r\n }\r\n}\r\n\r\n#define jso_list_get_type\r\n{\r\n /**\r\n jso_list_get_type(list, index): Retrieve the type of value found at position of .\r\n JSOnion version: 1.0.0d\r\n */\r\n \r\n //Grab the value\r\n var v;\r\n v = ds_list_find_value(argument0, argument1);\r\n \r\n //String; could be string, map or list\r\n if (is_string(v)) {\r\n switch (string_char_at(v, 1)) {\r\n case \"s\":\r\n return jso_type_string;\r\n break;\r\n case \"l\":\r\n return jso_type_list;\r\n break;\r\n case \"m\":\r\n return jso_type_map;\r\n break;\r\n case \"b\":\r\n return jso_type_boolean;\r\n break;\r\n default: show_error(\"Invalid list content type.\", true); break;\r\n } \r\n }\r\n \r\n //Real\r\n else {\r\n return jso_type_real;\r\n }\r\n}\r\n\r\n#define jso_cleanup_map\r\n{\r\n /**\r\n jso_cleanup_map(map): Recursively free up .\r\n JSOnion version: 1.0.0d\r\n */\r\n \r\n //Loop through all keys\r\n var i, l, k;\r\n l = ds_map_size(argument0);\r\n k = ds_map_find_first(argument0);\r\n for (i=0; i.\r\n JSOnion version: 1.0.0d\r\n */\r\n \r\n //Loop through all elements\r\n var i, l, v;\r\n l = ds_list_size(argument0);\r\n for (i=0; i): Return a JSON-encoded version of real value .\r\n This uses scientific notation with up to 15 significant digits for decimal values.\r\n For integers, it just uses string().\r\n This is adapted from the same algorithm used in GMTuple.\r\n JSOnion version: 1.0.0d\r\n */\r\n \r\n return __jso_gmt_numtostr(argument0);\r\n}\r\n\r\n#define jso_encode_string\r\n{\r\n /**\r\n jso_encode_string(str): Return a JSON-encoded version of string .\r\n JSOnion version: 1.0.0d\r\n */\r\n \r\n //Iteratively reconstruct the string\r\n var i, l, s, c;\r\n s = \"\";\r\n l = string_length(argument0);\r\n for (i=1; i<=l; i+=1) {\r\n //Replace escape characters\r\n c = string_char_at(argument0, i);\r\n switch (ord(c)) {\r\n case 34: case 92: case 47: //Double quotes, backslashes and slashes\r\n s += \"\\\" + c;\r\n break;\r\n case 8: //Backspace\r\n s += \"\\b\";\r\n break;\r\n case 12: //Form feed\r\n s += \"\\f\";\r\n break;\r\n case 10: //New line\r\n s += \"\\n\";\r\n break;\r\n case 13: //Carriage return\r\n s += \"\\r\";\r\n break;\r\n case 9: //Horizontal tab\r\n s += \"\\t\";\r\n break;\r\n default: //Not an escape character\r\n s += c;\r\n break;\r\n }\r\n }\r\n\r\n //Add quotes\r\n return '\"' + s + '\"';\r\n}\r\n\r\n#define jso_encode_list\r\n{\r\n /**\r\n jso_encode_list(list): Return a JSON-encoded version of list .\r\n JSOnion version: 1.0.0d\r\n */\r\n \r\n //Iteratively encode each element\r\n var i, l, s;\r\n s = \"\";\r\n l = ds_list_size(argument0);\r\n for (i=0; i 0) {\r\n s += \",\";\r\n }\r\n //Select correct encoding for each element, then recursively encode each\r\n switch (jso_list_get_type(argument0, i)) {\r\n case jso_type_real:\r\n s += jso_encode_real(jso_list_get(argument0, i));\r\n break;\r\n case jso_type_string:\r\n s += jso_encode_string(jso_list_get(argument0, i));\r\n break;\r\n case jso_type_map:\r\n s += jso_encode_map(jso_list_get(argument0, i));\r\n break;\r\n case jso_type_list:\r\n s += jso_encode_list(jso_list_get(argument0, i));\r\n break;\r\n case jso_type_boolean:\r\n s += jso_encode_boolean(jso_list_get(argument0, i));\r\n break;\r\n }\r\n }\r\n \r\n //Done, add square brackets\r\n return \"[\" + s + \"]\";\r\n}\r\n\r\n#define jso_encode_map\r\n{\r\n /**\r\n jso_encode_map(map): Return a JSON-encoded version of map .\r\n JSOnion version: 1.0.0d\r\n */\r\n \r\n //Go through every key-value pair\r\n var i, l, k, s;\r\n s = \"\";\r\n l = ds_map_size(argument0);\r\n k = ds_map_find_first(argument0);\r\n for (i=0; i 0) {\r\n s += \",\";\r\n }\r\n //Find the key and encode it\r\n if (is_real(k)) {\r\n s += jso_encode_real(k);\r\n } else {\r\n s += jso_encode_string(k);\r\n }\r\n //Add the : separator\r\n s += \":\";\r\n //Select correct encoding for each value, then recursively encode each \r\n switch (jso_map_get_type(argument0, k)) {\r\n case jso_type_real:\r\n s += jso_encode_real(jso_map_get(argument0, k));\r\n break;\r\n case jso_type_string:\r\n s += jso_encode_string(jso_map_get(argument0, k));\r\n break;\r\n case jso_type_map:\r\n s += jso_encode_map(jso_map_get(argument0, k));\r\n break;\r\n case jso_type_list:\r\n s += jso_encode_list(jso_map_get(argument0, k));\r\n break;\r\n case jso_type_boolean:\r\n s += jso_encode_boolean(jso_map_get(argument0, k));\r\n break;\r\n }\r\n //Get next key\r\n k = ds_map_find_next(argument0, k);\r\n }\r\n \r\n //Done, add braces\r\n return \"{\" + s + \"}\";\r\n}\r\n\r\n#define jso_encode_integer\r\n{\r\n /**\r\n jso_encode_integer(int): Return a JSON-encoded version of the integer value .\r\n JSOnion version: 1.0.0d\r\n */\r\n return string(floor(argument0));\r\n}\r\n\r\n#define jso_encode_boolean\r\n{\r\n /**\r\n jso_encode_boolean(bool): Return a JSON-encoded version of the boolean value .\r\n JSOnion version: 1.0.0d\r\n */\r\n if (argument0) {\r\n return \"true\";\r\n } else {\r\n return \"false\";\r\n }\r\n}\r\n\r\n#define jso_decode_map\r\n{\r\n /**\r\n jso_decode_map(json): Return a JSOnion-compatible map representing the JSON string .\r\n JSOnion version: 1.0.0d\r\n */\r\n return __jso_gmt_elem(_jso_decode_map(argument0, 1), 0);\r\n}\r\n\r\n#define jso_decode_list\r\n{\r\n /**\r\n jso_decode_list(json): Return a JSOnion-compatible list representing the JSON string .\r\n JSOnion version: 1.0.0d\r\n */\r\n return __jso_gmt_elem(_jso_decode_list(argument0, 1), 0);\r\n}\r\n\r\n#define jso_decode_string\r\n{\r\n /**\r\n jso_decode_string(json): Return a string representing the JSON string .\r\n JSOnion version: 1.0.0d\r\n */\r\n return __jso_gmt_elem(_jso_decode_string(argument0, 1), 0);\r\n}\r\n\r\n#define jso_decode_boolean\r\n{\r\n /**\r\n jso_decode_boolean(json): Return a boolean value representing the JSON string .\r\n JSOnion version: 1.0.0d\r\n */\r\n return __jso_gmt_elem(_jso_decode_boolean(argument0, 1), 0);\r\n}\r\n\r\n#define jso_decode_real\r\n{\r\n /**\r\n jso_decode_real(json): Return a real value representing the JSON string .\r\n JSOnion version: 1.0.0d\r\n */\r\n return __jso_gmt_elem(_jso_decode_real(argument0, 1), 0);\r\n}\r\n\r\n#define jso_decode_integer\r\n{\r\n /**\r\n jso_decode_integer(json): Return an integer value representing the JSON string .\r\n JSOnion version: 1.0.0d\r\n */\r\n return __jso_gmt_elem(_jso_decode_integer(argument0, 1), 0);\r\n}\r\n\r\n#define _jso_decode_map\r\n{\r\n /**\r\n _jso_decode_map(json, startindex): Extract a map from JSON string starting at position .\r\n Return a 2-tuple of the extracted map handle and the position after the ending }.\r\n JSOnion version: 1.0.0d\r\n */\r\n var i, len, map;\r\n i = argument1;\r\n len = string_length(argument0);\r\n map = jso_new_map();\r\n \r\n //Seek to first {\r\n var c;\r\n c = string_char_at(argument0, i);\r\n if (c != \"{\") {\r\n do {\r\n i += 1;\r\n c = string_char_at(argument0, i);\r\n if (!_jso_is_whitespace_char(c)) && (c != \"{\") {\r\n show_error(\"Cannot parse map at position \" + string(i), true);\r\n }\r\n } until (c == \"{\")\r\n }\r\n i += 1;\r\n \r\n //Read until end of JSON or ending }\r\n var found_end, state, found, current_key;\r\n found_end = false;\r\n state = 0;\r\n for (i=i; i<=len && !found_end; i+=1) {\r\n c = string_char_at(argument0, i);\r\n switch (state) {\r\n //0: Looking for a key or closing }\r\n case 0:\r\n switch (c) {\r\n case \"}\":\r\n found_end = true;\r\n break;\r\n case '\"':\r\n found = _jso_decode_string(argument0, i);\r\n current_key = __jso_gmt_elem(found, 0);\r\n i = __jso_gmt_elem(found, 1)-1;\r\n state = 1;\r\n break;\r\n case \"0\": case \"1\": case \"2\": case \"3\": case \"4\": case \"5\": case \"6\": case \"7\": case \"8\": case \"9\": case \"+\": case \"-\":\r\n found = _jso_decode_real(argument0, i);\r\n current_key = __jso_gmt_elem(found, 0);\r\n i = __jso_gmt_elem(found, 1)-1;\r\n state = 1;\r\n break;\r\n default:\r\n if (!_jso_is_whitespace_char(c)) {\r\n show_error(\"Unexpected character at position \" + string(i) + \".\", true);\r\n }\r\n break;\r\n }\r\n break;\r\n //1: Looking for the : separator\r\n case 1:\r\n switch (c) {\r\n case \":\":\r\n state = 2;\r\n break;\r\n default:\r\n if (!_jso_is_whitespace_char(c)) {\r\n show_error(\"Unexpected character at position \" + string(i) + \".\", true);\r\n }\r\n break;\r\n }\r\n break;\r\n //2: Looking for a value\r\n case 2:\r\n switch (c) {\r\n case \"[\":\r\n found = _jso_decode_list(argument0, i);\r\n jso_map_add_sublist(map, current_key, __jso_gmt_elem(found, 0));\r\n i = __jso_gmt_elem(found, 1)-1;\r\n state = 3;\r\n break;\r\n case \"{\":\r\n found = _jso_decode_map(argument0, i);\r\n jso_map_add_submap(map, current_key, __jso_gmt_elem(found, 0));\r\n i = __jso_gmt_elem(found, 1)-1;\r\n state = 3;\r\n break;\r\n case '\"':\r\n found = _jso_decode_string(argument0, i);\r\n jso_map_add_string(map, current_key, __jso_gmt_elem(found, 0));\r\n i = __jso_gmt_elem(found, 1)-1;\r\n state = 3;\r\n break;\r\n case \"0\": case \"1\": case \"2\": case \"3\": case \"4\": case \"5\": case \"6\": case \"7\": case \"8\": case \"9\": case \"+\": case \"-\":\r\n found = _jso_decode_real(argument0, i);\r\n jso_map_add_real(map, current_key, __jso_gmt_elem(found, 0));\r\n i = __jso_gmt_elem(found, 1)-1;\r\n state = 3;\r\n break;\r\n case \"t\": case \"f\":\r\n found = _jso_decode_boolean(argument0, i);\r\n jso_map_add_boolean(map, current_key, __jso_gmt_elem(found, 0));\r\n i = __jso_gmt_elem(found, 1)-1;\r\n state = 3;\r\n break;\r\n default:\r\n if (!_jso_is_whitespace_char(c)) {\r\n show_error(\"Unexpected character at position \" + string(i) + \".\", true);\r\n }\r\n break;\r\n }\r\n break;\r\n //3: Done looking for an entry, want comma or }\r\n case 3:\r\n switch (c) {\r\n case \"}\":\r\n found_end = true;\r\n break;\r\n case \",\":\r\n state = 0;\r\n break;\r\n default:\r\n if (!_jso_is_whitespace_char(c)) {\r\n show_error(\"Unexpected character at position \" + string(i) + \".\", true);\r\n }\r\n break;\r\n }\r\n break;\r\n }\r\n }\r\n \r\n //Return extracted map with ending position if the ending } is found\r\n if (found_end) {\r\n return __jso_gmt_tuple(map, i);\r\n }\r\n //Ended too early, throw error\r\n else {\r\n show_error(\"Unexpected end of map in JSON string.\", true);\r\n }\r\n}\r\n\r\n#define _jso_decode_list\r\n{\r\n /**\r\n _jso_decode_list(json, startindex): Extract a list from JSON string starting at position .\r\n Return a 2-tuple of the extracted list handle and the position after the ending ].\r\n JSOnion version: 1.0.0d\r\n */\r\n var i, len, list;\r\n i = argument1;\r\n len = string_length(argument0);\r\n list = jso_new_list();\r\n \r\n //Seek to first [\r\n var c;\r\n c = string_char_at(argument0, i);\r\n if (c != \"[\") {\r\n do {\r\n i += 1;\r\n c = string_char_at(argument0, i);\r\n if (!_jso_is_whitespace_char(c)) && (c != \"[\") {\r\n show_error(\"Cannot parse list at position \" + string(i), true);\r\n }\r\n } until (c == \"[\")\r\n }\r\n i += 1;\r\n \r\n //Read until end of JSON or ending ]\r\n var found_end, state, found;\r\n found_end = false;\r\n state = 0;\r\n for (i=i; i<=len && !found_end; i+=1) {\r\n c = string_char_at(argument0, i);\r\n switch (state) {\r\n //0: Looking for an item\r\n case 0:\r\n switch (c) {\r\n case \"]\":\r\n found_end = true;\r\n break;\r\n case \"[\":\r\n found = _jso_decode_list(argument0, i);\r\n jso_list_add_sublist(list, __jso_gmt_elem(found, 0));\r\n i = __jso_gmt_elem(found, 1)-1;\r\n state = 1;\r\n break;\r\n case \"{\":\r\n found = _jso_decode_map(argument0, i);\r\n jso_list_add_submap(list, __jso_gmt_elem(found, 0));\r\n i = __jso_gmt_elem(found, 1)-1;\r\n state = 1;\r\n break;\r\n case '\"':\r\n found = _jso_decode_string(argument0, i);\r\n jso_list_add_string(list, __jso_gmt_elem(found, 0));\r\n i = __jso_gmt_elem(found, 1)-1;\r\n state = 1;\r\n break;\r\n case \"0\": case \"1\": case \"2\": case \"3\": case \"4\": case \"5\": case \"6\": case \"7\": case \"8\": case \"9\": case \"+\": case \"-\":\r\n found = _jso_decode_real(argument0, i);\r\n jso_list_add_real(list, __jso_gmt_elem(found, 0));\r\n i = __jso_gmt_elem(found, 1)-1;\r\n state = 1;\r\n break;\r\n case \"t\": case \"f\":\r\n found = _jso_decode_boolean(argument0, i);\r\n jso_list_add_boolean(list, __jso_gmt_elem(found, 0));\r\n i = __jso_gmt_elem(found, 1)-1;\r\n state = 1;\r\n break;\r\n default:\r\n if (!_jso_is_whitespace_char(c)) {\r\n show_error(\"Unexpected character at position \" + string(i) + \".\", true);\r\n }\r\n break;\r\n }\r\n break;\r\n //1: Done looking for an item, want comma or ]\r\n case 1:\r\n switch (c) {\r\n case \"]\":\r\n found_end = true;\r\n break;\r\n case \",\":\r\n state = 0;\r\n break;\r\n default:\r\n if (!_jso_is_whitespace_char(c)) {\r\n show_error(\"Unexpected character at position \" + string(i) + \".\", true);\r\n }\r\n break;\r\n }\r\n break;\r\n }\r\n }\r\n \r\n //Return extracted list with ending position if the ending ] is found\r\n if (found_end) {\r\n return __jso_gmt_tuple(list, i);\r\n }\r\n //Ended too early, throw error\r\n else {\r\n show_error(\"Unexpected end of list in JSON string.\", true);\r\n }\r\n}\r\n\r\n#define _jso_decode_string\r\n{\r\n /**\r\n _jso_decode_string(json, startindex): Extract a string from JSON string starting at position .\r\n Return a 2-tuple of the extracted string and the position after the ending double quote.\r\n JSOnion version: 1.0.0d\r\n */\r\n var i, len, str;\r\n i = argument1;\r\n len = string_length(argument0);\r\n str = \"\";\r\n \r\n //Seek to first double quote\r\n var c;\r\n c = string_char_at(argument0, i);\r\n if (c != '\"') {\r\n do {\r\n i += 1;\r\n c = string_char_at(argument0, i);\r\n } until (c == '\"')\r\n }\r\n i += 1;\r\n \r\n //Read until end of JSON or ending double quote\r\n var found_end, escape_mode;\r\n found_end = false;\r\n escape_mode = false;\r\n for (i=i; i<=len && !found_end; i+=1) {\r\n c = string_char_at(argument0, i);\r\n //Escape mode\r\n if (escape_mode) {\r\n switch (c) {\r\n case '\"': case \"\\\": case \"/\":\r\n str += c;\r\n escape_mode = false;\r\n break;\r\n case \"b\":\r\n str += chr(8);\r\n escape_mode = false;\r\n break;\r\n case \"f\":\r\n str += chr(12);\r\n escape_mode = false;\r\n break;\r\n case \"n\":\r\n str += chr(10);\r\n escape_mode = false;\r\n break;\r\n case \"r\":\r\n str += chr(13);\r\n escape_mode = false;\r\n break;\r\n case \"t\":\r\n str += chr(9);\r\n escape_mode = false;\r\n break;\r\n case \"u\":\r\n var u;\r\n if (len-i < 5) {\r\n show_error(\"Invalid escape character at position \" + string(i) + \".\", true);\r\n } else {\r\n str += chr(_jso_hex_to_decimal(string_copy(argument0, i+1, 4)));\r\n escape_mode = false;\r\n i += 4;\r\n }\r\n break;\r\n default:\r\n show_error(\"Invalid escape character at position \" + string(i) + \".\", true);\r\n break;\r\n }\r\n }\r\n //Regular mode\r\n else {\r\n switch (c) {\r\n case '\"': found_end = true; break;\r\n case \"\\\": escape_mode = true; break;\r\n default: str += c; break;\r\n }\r\n }\r\n }\r\n \r\n //Return extracted string with ending position if the ending double quote is found\r\n if (found_end) {\r\n return __jso_gmt_tuple(str, i);\r\n }\r\n //Ended too early, throw error\r\n else {\r\n show_error(\"Unexpected end of string in JSON string.\", true);\r\n }\r\n}\r\n\r\n#define _jso_decode_boolean\r\n{\r\n /**\r\n _jso_decode_boolean(json, startindex): Extract a boolean from JSON string starting at position .\r\n Return a 2-tuple of the extracted boolean and the position after the last e.\r\n JSOnion version: 1.0.0d\r\n */\r\n var i, len, str;\r\n i = argument1;\r\n len = string_length(argument0);\r\n \r\n //Seek to first t or f that can be found\r\n var c;\r\n c = string_char_at(argument0, i);\r\n if (c != \"t\") && (c != \"f\") {\r\n do {\r\n i += 1;\r\n c = string_char_at(argument0, i);\r\n if (!_jso_is_whitespace_char(c)) && (c != \"t\") && (c != \"f\") {\r\n show_error(\"Cannot parse boolean value at position \" + string(i), true);\r\n }\r\n } until (c == \"t\") || (c == \"f\")\r\n }\r\n \r\n //Look for true if t is found\r\n if (c == \"t\") && (string_copy(argument0, i, 4) == \"true\") {\r\n return __jso_gmt_tuple(true, i+4);\r\n }\r\n //Look for false if f is found\r\n else if (c == \"f\") && (string_copy(argument0, i, 5) == \"false\") {\r\n return __jso_gmt_tuple(false, i+5);\r\n }\r\n //Error: unexpected ending\r\n else {\r\n show_error(\"Unexpected end of boolean in JSON string.\", true);\r\n }\r\n}\r\n\r\n#define _jso_decode_real\r\n{\r\n /**\r\n _jso_decode_real(json, startindex): Extract a real value from JSON string starting at position .\r\n Return a 2-tuple of the extracted real value and the position after the real value.\r\n JSOnion version: 1.0.0d\r\n */\r\n var i, len, str;\r\n i = argument1;\r\n len = string_length(argument0);\r\n str = \"\";\r\n \r\n //Seek to first character: +, -, or 0-9\r\n var c;\r\n c = string_char_at(argument0, i);\r\n if (string_pos(c, \"0123456789+-\") == 0) {\r\n do {\r\n i += 1;\r\n c = string_char_at(argument0, i);\r\n if (!_jso_is_whitespace_char(c)) && (string_pos(c, \"0123456789+-\") == 0) {\r\n show_error(\"Cannot parse real value at position \" + string(i), true);\r\n }\r\n } until (string_pos(c, \"0123456789+-\") > 0)\r\n }\r\n \r\n //Determine starting state\r\n var state;\r\n switch (c) {\r\n case \"+\": case \"-\":\r\n state = 0;\r\n break;\r\n default:\r\n state = 1;\r\n break;\r\n }\r\n str += c;\r\n i += 1;\r\n \r\n //Loop until no more digits found\r\n var done;\r\n done = false;\r\n for (i=i; i<=len && !done; i+=1) {\r\n c = string_char_at(argument0, i);\r\n switch (state) {\r\n //0: Found a sign, looking for a starting number\r\n case 0:\r\n switch (c) {\r\n case \"0\": case \"1\": case \"2\": case \"3\": case \"4\": case \"5\": case \"6\": case \"7\": case \"8\": case \"9\":\r\n str += c;\r\n state = 1;\r\n break;\r\n default:\r\n show_error(\"Unexpected character at position \" + string(i) + \", expecting a digit.\", true);\r\n break;\r\n }\r\n break;\r\n //1: Found a starting digit, looking for decimal dot, e, E, or more digits\r\n case 1:\r\n if (_jso_is_whitespace_char(c)) || (string_pos(c, \":,]}\") > 0) {\r\n done = true;\r\n i -= 1;\r\n } else {\r\n switch (c) {\r\n case \"0\": case \"1\": case \"2\": case \"3\": case \"4\": case \"5\": case \"6\": case \"7\": case \"8\": case \"9\":\r\n str += c;\r\n break;\r\n case \".\":\r\n str += c;\r\n state = 2;\r\n break;\r\n case \"e\": case \"E\":\r\n str += c;\r\n state = 3;\r\n break;\r\n default:\r\n show_error(\"Unexpected character at position \" + string(i) + \", expecting a dot, e, E or a digit.\", true);\r\n break;\r\n }\r\n }\r\n break;\r\n //2: Found a decimal dot, looking for more digits\r\n case 2:\r\n switch (c) {\r\n case \"0\": case \"1\": case \"2\": case \"3\": case \"4\": case \"5\": case \"6\": case \"7\": case \"8\": case \"9\":\r\n str += c;\r\n state = -2;\r\n break;\r\n default:\r\n show_error(\"Unexpected character at position \" + string(i) + \", expecting a digit.\", true);\r\n break;\r\n }\r\n break;\r\n //-2: Found a decimal dot and a digit after it, looking for more digits, e, or E\r\n case -2:\r\n if (_jso_is_whitespace_char(c)) || (string_pos(c, \":,]}\") > 0) {\r\n done = true;\r\n i -= 1;\r\n } else {\r\n switch (c) {\r\n case \"0\": case \"1\": case \"2\": case \"3\": case \"4\": case \"5\": case \"6\": case \"7\": case \"8\": case \"9\":\r\n str += c;\r\n break;\r\n case \"e\": case \"E\":\r\n str += c;\r\n state = 3;\r\n break;\r\n default:\r\n show_error(\"Unexpected character at position \" + string(i) + \", expecting an e, E or a digit.\", true);\r\n break;\r\n }\r\n }\r\n break;\r\n //3: Found an e/E, looking for +, - or more digits\r\n case 3:\r\n switch (c) {\r\n case \"+\": case \"-\":\r\n str += c;\r\n state = 4;\r\n break;\r\n case \"0\": case \"1\": case \"2\": case \"3\": case \"4\": case \"5\": case \"6\": case \"7\": case \"8\": case \"9\":\r\n str += c;\r\n state = 5;\r\n break;\r\n default:\r\n show_error(\"Unexpected character at position \" + string(i) + \", expecting a +, - or a digit.\", true);\r\n break;\r\n }\r\n break;\r\n //4: Found an e/E exponent sign, looking for more digits\r\n case 4:\r\n switch (c) {\r\n case \"0\": case \"1\": case \"2\": case \"3\": case \"4\": case \"5\": case \"6\": case \"7\": case \"8\": case \"9\":\r\n str += c;\r\n state = 5;\r\n break;\r\n default:\r\n show_error(\"Unexpected character at position \" + string(i) + \", expecting a digit.\", true);\r\n break;\r\n }\r\n break;\r\n //5: Looking for final digits of the exponent\r\n case 5:\r\n if (_jso_is_whitespace_char(c)) || (string_pos(c, \":,]}\") > 0) {\r\n done = true;\r\n i -= 1;\r\n } else {\r\n switch (c) {\r\n case \"0\": case \"1\": case \"2\": case \"3\": case \"4\": case \"5\": case \"6\": case \"7\": case \"8\": case \"9\":\r\n str += c;\r\n state = 5;\r\n break;\r\n default:\r\n show_error(\"Unexpected character at position \" + string(i) + \", expecting a digit.\", true);\r\n break;\r\n }\r\n }\r\n break;\r\n }\r\n }\r\n \r\n //Am I still expecting more characters?\r\n if (done) || (state == 1) || (state == -2) || (state == 5) {\r\n return __jso_gmt_tuple(real(str), i);\r\n }\r\n //Error: unexpected ending\r\n else {\r\n show_error(\"Unexpected end of real in JSON string.\", true);\r\n }\r\n}\r\n\r\n#define _jso_decode_integer\r\n{\r\n /**\r\n _jso_decode_real(json, startindex): Extract a real value from JSON string starting at position .\r\n Return a 2-tuple of the extracted integer value (with leading i) and the position after the real value.\r\n JSOnion version: 1.0.0d\r\n */\r\n var i, len, str;\r\n i = argument1;\r\n len = string_length(argument0);\r\n str = \"\";\r\n \r\n //Seek to first character: +, -, or 0-9\r\n var c;\r\n c = string_char_at(argument0, i);\r\n if (string_pos(c, \"0123456789+-\") == 0) {\r\n do {\r\n i += 1;\r\n c = string_char_at(argument0, i);\r\n if (!_jso_is_whitespace_char(c)) && (string_pos(c, \"0123456789+-\") == 0) {\r\n show_error(\"Cannot parse integer value at position \" + string(i), true);\r\n }\r\n } until (string_pos(c, \"0123456789+-\") > 0)\r\n }\r\n \r\n //Determine starting state\r\n var state;\r\n switch (c) {\r\n case \"+\": case \"-\":\r\n state = 0;\r\n break;\r\n default:\r\n state = 1;\r\n break;\r\n }\r\n str += c;\r\n i += 1;\r\n \r\n //Loop until no more digits found\r\n var done;\r\n done = false;\r\n for (i=i; i<=len && !done; i+=1) {\r\n c = string_char_at(argument0, i);\r\n switch (state) {\r\n //0: Found a sign, looking for a starting number\r\n case 0:\r\n switch (c) {\r\n case \"0\": case \"1\": case \"2\": case \"3\": case \"4\": case \"5\": case \"6\": case \"7\": case \"8\": case \"9\":\r\n str += c;\r\n state = 1;\r\n break;\r\n default:\r\n show_error(\"Unexpected character at position \" + string(i) + \", expecting a digit.\", true);\r\n break;\r\n }\r\n break;\r\n //1: Found a starting digit, looking for decimal dot, e, E, or more digits\r\n case 1:\r\n if (_jso_is_whitespace_char(c)) || (string_pos(c, \":,]}\") > 0) {\r\n done = true;\r\n i -= 1;\r\n } else {\r\n switch (c) {\r\n case \"0\": case \"1\": case \"2\": case \"3\": case \"4\": case \"5\": case \"6\": case \"7\": case \"8\": case \"9\":\r\n str += c;\r\n break;\r\n default:\r\n show_error(\"Unexpected character at position \" + string(i) + \", expecting a digit.\", true);\r\n break;\r\n }\r\n }\r\n break;\r\n }\r\n }\r\n \r\n //Am I still expecting more characters?\r\n if (done) || (state == 1) {\r\n return __jso_gmt_tuple(floor(real(str)), i);\r\n }\r\n //Error: unexpected ending\r\n else {\r\n show_error(\"Unexpected end of integer in JSON string.\", true);\r\n }\r\n}\r\n\r\n#define jso_compare_maps\r\n{\r\n /**\r\n jso_compare_maps(map1, map2): Return whether the contents of JSOnion-compatible maps and are the same.\r\n JSOnion version: 1.0.0d\r\n */\r\n \r\n //If they aren't the same size, they can't be the same\r\n var size;\r\n size = ds_map_size(argument0);\r\n if (size != ds_map_size(argument1)) {\r\n return false;\r\n }\r\n \r\n //Compare contents pairwise\r\n var i, k, type, a, b;\r\n k = ds_map_find_first(argument0);\r\n for (i=0; i and are the same.\r\n JSOnion version: 1.0.0d\r\n */\r\n \r\n //If they aren't the same size, they can't be the same\r\n var size;\r\n size = ds_list_size(argument0);\r\n if (size != ds_list_size(argument1)) {\r\n return false;\r\n }\r\n \r\n //Compare contents pairwise\r\n var i, type, a, b;\r\n for (i=0; i, return whether a value exists there.\r\n JSOnion version: 1.0.0d\r\n */\r\n \r\n //Catch empty calls\r\n if (argument_count < 2) {\r\n show_error(\"Expected at least 2 arguments, got \" + string(argument_count) + \".\", true);\r\n }\r\n \r\n //Build list of keys/indices\r\n var i, key_list;\r\n key_list = ds_list_create();\r\n for (i=1; i, return whether a value exists there.\r\n JSOnion version: 1.0.0d\r\n */\r\n \r\n //Catch empty calls\r\n if (argument_count < 2) {\r\n show_error(\"Expected at least 2 arguments, got \" + string(argument_count) + \".\", true);\r\n }\r\n \r\n //Build list of keys/indices\r\n var i, key_list;\r\n key_list = ds_list_create();\r\n for (i=1; i, return the value that exists there.\r\n JSOnion version: 1.0.0d\r\n */\r\n \r\n //Catch empty calls\r\n if (argument_count < 2) {\r\n show_error(\"Expected at least 2 arguments, got \" + string(argument_count) + \".\", true);\r\n }\r\n \r\n //Build list of keys/indices\r\n var i, key_list;\r\n key_list = ds_list_create();\r\n for (i=1; i, return the type of value that exists there.\r\n JSOnion version: 1.0.0d\r\n */\r\n \r\n //Catch empty calls\r\n if (argument_count < 2) {\r\n show_error(\"Expected at least 2 arguments, got \" + string(argument_count) + \".\", true);\r\n }\r\n \r\n //Build list of keys/indices\r\n var i, key_list;\r\n key_list = ds_list_create();\r\n for (i=1; i, return the value that exists there.\r\n JSOnion version: 1.0.0d\r\n */\r\n \r\n //Catch empty calls\r\n if (argument_count < 2) {\r\n show_error(\"Expected at least 2 arguments, got \" + string(argument_count) + \".\", true);\r\n }\r\n \r\n //Build list of keys/indices\r\n var i, key_list;\r\n key_list = ds_list_create();\r\n for (i=1; i, return the type of value that exists there.\r\n JSOnion version: 1.0.0d\r\n */\r\n \r\n //Catch empty calls\r\n if (argument_count < 2) {\r\n show_error(\"Expected at least 2 arguments, got \" + string(argument_count) + \".\", true);\r\n }\r\n \r\n //Build list of keys/indices\r\n var i, key_list;\r\n key_list = ds_list_create();\r\n for (i=1; i= ds_list_size(data)) {\r\n switch (task_type) {\r\n case 0:\r\n return false;\r\n break;\r\n default:\r\n show_error(\"Index overflow for nested lists in \" + type_string + \" lookup.\", true);\r\n break;\r\n }\r\n }\r\n type = jso_list_get_type(data, k);\r\n data = jso_list_get(data, k);\r\n break;\r\n //Trying to go through a leaf; don't attempt to look further\r\n default:\r\n switch (task_type) {\r\n case 0:\r\n return false;\r\n break;\r\n default:\r\n show_error(\"Recursive overflow in \" + type_string + \" lookup.\", true);\r\n break;\r\n }\r\n break;\r\n }\r\n }\r\n \r\n //Can find something, return the value requested by the task\r\n switch (task_type) {\r\n case 0:\r\n return true;\r\n break;\r\n case 1:\r\n return data;\r\n break;\r\n case 2:\r\n return type;\r\n break;\r\n }\r\n}\r\n\r\n#define _jso_is_whitespace_char\r\n{\r\n /**\r\n _jso_is_whitespace_char(char): Return whether is a whitespace character.\r\n Definition of whitespace is given by Unicode 6.0, Chapter 4.6.\r\n JSOnion version: 1.0.0d\r\n */\r\n switch (ord(argument0)) {\r\n case $0009:\r\n case $000A:\r\n case $000B:\r\n case $000C:\r\n case $000D:\r\n case $0020:\r\n case $0085:\r\n case $00A0:\r\n case $1680:\r\n case $180E:\r\n case $2000:\r\n case $2001:\r\n case $2002:\r\n case $2003:\r\n case $2004:\r\n case $2005:\r\n case $2006:\r\n case $2007:\r\n case $2008:\r\n case $2009:\r\n case $200A:\r\n case $2028:\r\n case $2029:\r\n case $202F:\r\n case $205F:\r\n case $3000:\r\n return true;\r\n }\r\n return false;\r\n}\r\n\r\n#define _jso_hex_to_decimal\r\n{\r\n /**\r\n _jso_hex_to_decimal(hex_string): Return the decimal value of the hex number represented by \r\n JSOnion version: 1.0.0d\r\n */\r\n var hex_string, hex_digits;\r\n hex_string = string_lower(argument0);\r\n hex_digits = \"0123456789abcdef\";\r\n \r\n //Convert digit-by-digit\r\n var i, len, digit_value, num;\r\n len = string_length(hex_string);\r\n num = 0;\r\n for (i=1; i<=len; i+=1) {\r\n digit_value = string_pos(string_char_at(hex_string, i), hex_digits)-1;\r\n if (digit_value >= 0) {\r\n num *= 16;\r\n num += digit_value;\r\n } \r\n //Unknown character\r\n else {\r\n show_error(\"Invalid hex number: \" + argument0, true);\r\n }\r\n }\r\n return num;\r\n}\r\n\r\n" }, { "path": "src/test/resources/samples/langs/Game Maker Language/jsonion_test.gml", "content": "// Originally from /jsonion_test.gml in JSOnion\r\n// JSOnion v1.0.0d is licensed under the MIT licence. You may freely adapt and use this library in commercial and non-commercial projects.\r\n\r\n#define assert_true\r\n{\r\n /**\r\n assert_true(result, errormsg): Display error unless is true.\r\n */\r\n \r\n if (!argument0) {\r\n _assert_error_popup(argument1 + string_repeat(_assert_newline(), 2) + \"Expected true, got false.\");\r\n }\r\n}\r\n\r\n#define assert_false\r\n{\r\n /**\r\n assert_false(result, errormsg): Display error unless is false.\r\n */\r\n \r\n if (argument0) {\r\n _assert_error_popup(argument1 + string_repeat(_assert_newline(), 2) + \"Expected false, got true.\");\r\n }\r\n}\r\n\r\n#define assert_equal\r\n{\r\n /**\r\n assert_equal(expected, result, errormsg): Display error unless and are equal.\r\n */\r\n \r\n //Safe equality check; won't crash even if the two are different types\r\n var match;\r\n match = is_string(argument0) == is_string(argument1);\r\n if (match) {\r\n match = argument0 == argument1;\r\n }\r\n\r\n //No match?\r\n if (!match) {\r\n //Data types\r\n var type;\r\n type[0] = \"(Real)\";\r\n type[1] = \"(String)\";\r\n \r\n //Construct message\r\n var msg;\r\n msg = argument2;\r\n //Add expected value\r\n msg += string_repeat(_assert_newline(), 2);\r\n msg += \"Expected \" + type[is_string(argument0)] + \":\" + _assert_newline();\r\n msg += _assert_debug_value(argument0);\r\n //Add actual value\r\n msg += string_repeat(_assert_newline(), 2);\r\n msg += \"Actual \" + type[is_string(argument1)] + \":\" + _assert_newline();\r\n msg += _assert_debug_value(argument1);\r\n \r\n //Display message\r\n _assert_error_popup(msg);\r\n }\r\n}\r\n\r\n#define _assert_error_popup\r\n{\r\n /**\r\n _assert_error_popup(msg): Display an assertion error.\r\n */\r\n \r\n //Display message\r\n if (os_browser == browser_not_a_browser) {\r\n show_error(argument0, false); //Full-fledged error message for non-browser environments\r\n } else {\r\n show_message(argument0); //Browsers don't support show_error(), use show_message() instead\r\n }\r\n}\r\n\r\n#define _assert_debug_value\r\n{\r\n /**\r\n _assert_debug_value(val): Returns a low-level debug value for the value .\r\n can be a string or a real value.\r\n */\r\n \r\n //String\r\n if (is_string(argument0)) {\r\n if (os_browser == browser_not_a_browser) {\r\n return argument0;\r\n } else {\r\n return string_replace_all(argument0, \"#\", \"\\#\");\r\n }\r\n }\r\n \r\n //Numeric --- use GMTuple's algorithm\r\n else {\r\n \r\n //Integers\r\n if (frac(argument0) == 0) {\r\n return string(argument0);\r\n }\r\n \r\n //Decimal numbers; get exponent and mantissa \r\n var mantissa, exponent;\r\n exponent = floor(log10(abs(argument0)));\r\n mantissa = string_format(argument0/power(10,exponent), 15, 14);\r\n //Look for trailing zeros in the mantissa\r\n var i, ca;\r\n i = string_length(mantissa);\r\n do {\r\n ca = string_char_at(mantissa, i);\r\n i -= 1;\r\n } until (ca != \"0\")\r\n //Remove the dot if only the first digit of the normalized mantissa is nonzero\r\n if (ca != \".\") {\r\n mantissa = string_copy(mantissa, 1, i+1);\r\n }\r\n else {\r\n mantissa = string_copy(mantissa, 1, i);\r\n }\r\n //Remove the exponent if it is 0\r\n if (exponent != 0) {\r\n return mantissa + \"e\" + string(exponent);\r\n } else {\r\n return mantissa;\r\n }\r\n \r\n //GMTuple algorithm done\r\n }\r\n}\r\n\r\n#define _assert_newline\r\n{\r\n /**\r\n _assert_newline(): Returns a system-appropriate newline character sequence.\r\n */\r\n \r\n if (os_browser == browser_not_a_browser) {\r\n return chr(13) + chr(10);\r\n } else {\r\n return \"#\";\r\n }\r\n}\r\n\r\n#define jso_test_all\r\n{\r\n /**\r\n jso_test_all(): Run the test suite for the JSOnion library.\r\n JSOnion version: 1.0.0d\r\n */\r\n var a, b;\r\n a = current_time;\r\n _test_jso_new();\r\n _test_jso_map_add();\r\n _test_jso_list_add();\r\n _test_jso_encode();\r\n _test_jso_compare();\r\n _test_jso_decode();\r\n _test_jso_lookup();\r\n _test_jso_bugs();\r\n __jso_gmt_test_all();\r\n b = current_time;\r\n show_debug_message(\"JSOnion: Tests completed in \" + string(b-a) + \"ms.\");\r\n}\r\n\r\n#define _test_jso_new\r\n{\r\n /**\r\n _test_jso_new(): Test jso_new_*() functions.\r\n JSOnion version: 1.0.0d\r\n */\r\n \r\n var expected, actual;\r\n \r\n //jso_new_map()\r\n actual = jso_new_map();\r\n assert_true(actual >= 0, \"jso_new_map() failed to create a new map.\");\r\n ds_map_destroy(actual);\r\n \r\n //jso_new_list()\r\n actual = jso_new_list();\r\n assert_true(actual >= 0, \"jso_new_list() failed to create a new list.\");\r\n ds_list_destroy(actual);\r\n}\r\n\r\n#define _test_jso_map_add\r\n{\r\n /**\r\n _test_jso_map_add(): Test jso_map_add_*() functions.\r\n JSOnion version: 1.0.0d\r\n */\r\n \r\n var expected, actual, key, map;\r\n map = jso_new_map();\r\n \r\n //jso_map_add_real()\r\n expected = pi;\r\n key = \"pi\";\r\n jso_map_add_real(map, key, expected);\r\n actual = jso_map_get(map, key);\r\n assert_true(ds_map_exists(map, key), \"jso_map_add_real() failed to add the number.\");\r\n assert_equal(expected, actual, \"jso_map_add_real() added the wrong number.\");\r\n ds_map_delete(map, key);\r\n \r\n //jso_map_add_string()\r\n expected = \"waahoo\";\r\n key = \"str\";\r\n jso_map_add_string(map, key, expected);\r\n actual = jso_map_get(map, key);\r\n assert_true(ds_map_exists(map, key), \"jso_map_add_string() failed to add the string.\");\r\n assert_equal(expected, actual, \"jso_map_add_string() added the wrong string.\");\r\n ds_map_delete(map, key);\r\n \r\n //jso_map_add_sublist()\r\n expected = jso_new_list();\r\n key = \"sublist\";\r\n jso_map_add_sublist(map, key, expected);\r\n actual = jso_map_get(map, key);\r\n assert_true(ds_map_exists(map, key), \"jso_map_add_sublist() failed to add the new sublist.\");\r\n assert_equal(expected, actual, \"jso_map_add_sublist() added the wrong sublist.\");\r\n ds_map_delete(map, key);\r\n ds_list_destroy(expected);\r\n \r\n //jso_map_add_submap()\r\n expected = jso_new_map();\r\n key = \"sublist\";\r\n jso_map_add_sublist(map, key, expected);\r\n actual = jso_map_get(map, key);\r\n assert_true(ds_map_exists(map, key), \"jso_map_add_submap() failed to add the new submap.\");\r\n assert_equal(expected, actual, \"jso_map_add_submap() added the wrong submap.\");\r\n ds_map_delete(map, key);\r\n ds_map_destroy(expected);\r\n \r\n //jso_map_add_integer()\r\n expected = 2345;\r\n key = \"integer\";\r\n jso_map_add_integer(map, key, expected);\r\n actual = jso_map_get(map, key);\r\n assert_true(ds_map_exists(map, key), \"jso_map_add_integer() failed to add the new integer.\");\r\n assert_equal(expected, actual, \"jso_map_add_integer() added the wrong integer.\");\r\n ds_map_delete(map, key);\r\n \r\n //jso_map_add_boolean() --- true\r\n expected = true;\r\n key = \"booleantrue\";\r\n jso_map_add_boolean(map, key, expected);\r\n actual = jso_map_get(map, key);\r\n assert_true(ds_map_exists(map, key), \"jso_map_add_boolean() failed to add true.\");\r\n assert_true(actual, \"jso_map_add_boolean() added the wrong true.\");\r\n ds_map_delete(map, key);\r\n \r\n //jso_map_add_boolean() --- false\r\n expected = false;\r\n key = \"booleanfalse\";\r\n jso_map_add_boolean(map, key, expected);\r\n actual = jso_map_get(map, key)\r\n assert_true(ds_map_exists(map, key), \"jso_map_add_boolean() failed to add false.\");\r\n assert_false(actual, \"jso_map_add_boolean() added the wrong false.\");\r\n ds_map_delete(map, key);\r\n \r\n //Cleanup\r\n ds_map_destroy(map);\r\n}\r\n\r\n#define _test_jso_list_add\r\n{\r\n /**\r\n _test_jso_list_add(): Test jso_list_add_*() functions.\r\n JSOnion version: 1.0.0d\r\n */\r\n \r\n var expected, actual, list;\r\n list = jso_new_list();\r\n \r\n //jso_list_add_real()\r\n expected = pi;\r\n jso_list_add_real(list, expected);\r\n actual = jso_list_get(list, 0);\r\n assert_false(ds_list_empty(list), \"jso_list_add_real() failed to add the number.\");\r\n assert_equal(expected, actual, \"jso_list_add_real() added the wrong number.\");\r\n ds_list_clear(list);\r\n \r\n //jso_list_add_string()\r\n expected = \"waahoo\";\r\n jso_list_add_string(list, expected);\r\n actual = jso_list_get(list, 0);\r\n assert_false(ds_list_empty(list), \"jso_list_add_string() failed to add the string.\");\r\n assert_equal(expected, actual, \"jso_list_add_string() added the wrong string.\");\r\n ds_list_clear(list);\r\n \r\n //jso_list_add_sublist()\r\n expected = jso_new_list();\r\n jso_list_add_sublist(list, expected);\r\n actual = jso_list_get(list, 0);\r\n assert_false(ds_list_empty(list), \"jso_list_add_sublist() failed to add the sublist.\");\r\n assert_equal(expected, actual, \"jso_list_add_sublist() added the wrong sublist.\");\r\n ds_list_clear(list);\r\n ds_list_destroy(expected);\r\n \r\n //jso_list_add_submap()\r\n expected = jso_new_map();\r\n jso_list_add_submap(list, expected);\r\n actual = jso_list_get(list, 0);\r\n assert_false(ds_list_empty(list), \"jso_list_add_submap() failed to add the submap.\");\r\n assert_equal(expected, actual, \"jso_list_add_submap() added the wrong submap.\");\r\n ds_list_clear(list);\r\n ds_map_destroy(expected);\r\n \r\n //jso_list_add_integer()\r\n expected = 2345;\r\n jso_list_add_integer(list, expected);\r\n actual = jso_list_get(list, 0);\r\n assert_false(ds_list_empty(list), \"jso_list_add_integer() failed to add integer.\");\r\n assert_equal(expected, actual, \"jso_list_add_integer() added the wrong integer.\");\r\n ds_list_clear(list);\r\n \r\n //jso_list_add_boolean() --- true\r\n expected = true;\r\n jso_list_add_boolean(list, expected);\r\n actual = jso_list_get(list, 0);\r\n assert_false(ds_list_empty(list), \"jso_list_add_boolean() failed to add boolean true.\");\r\n assert_true(actual, \"jso_list_add_boolean() added the wrong boolean true.\");\r\n ds_list_clear(list);\r\n \r\n //jso_list_add_boolean() --- false\r\n expected = false;\r\n jso_list_add_boolean(list, expected);\r\n actual = jso_list_get(list, 0);\r\n assert_false(ds_list_empty(list), \"jso_list_add_boolean() failed to add boolean false.\");\r\n assert_false(actual, \"jso_list_add_boolean() added the wrong boolean false.\");\r\n ds_list_clear(list);\r\n \r\n //Cleanup\r\n ds_list_destroy(list);\r\n}\r\n\r\n#define _test_jso_encode\r\n{\r\n /**\r\n _test_jso_encode(): Tests jso_encode_*() functions.\r\n JSOnion version: 1.0.0d\r\n */\r\n \r\n var original, expected, actual;\r\n \r\n //jso_encode_real() --- Positive\r\n expected = 3.1415;\r\n actual = jso_encode_real(3.1415);\r\n assert_equal(expected, real(actual), \"jso_encode_real() failed to encode positive real!\");\r\n \r\n //jso_encode_real() --- Negative\r\n expected = -2.71828;\r\n actual = jso_encode_real(-2.71828);\r\n assert_equal(expected, real(actual), \"jso_encode_real() failed to encode negative real!\");\r\n \r\n //jso_encode_real() --- Zero\r\n expected = 0;\r\n actual = jso_encode_integer(0);\r\n assert_equal(expected, real(actual), \"jso_encode_real() failed to encode zero!\");\r\n \r\n //jso_encode_integer() --- Positive\r\n expected = \"2345\";\r\n actual = jso_encode_integer(2345);\r\n assert_equal(expected, actual, \"jso_encode_integer() failed to encode positive integer!\");\r\n \r\n //jso_encode_integer() --- Negative\r\n expected = \"-45\";\r\n actual = jso_encode_integer(-45);\r\n assert_equal(expected, actual, \"jso_encode_integer() failed to encode negative integer!\");\r\n \r\n //jso_encode_integer() --- Zero\r\n expected = \"0\";\r\n actual = jso_encode_integer(0);\r\n assert_equal(expected, actual, \"jso_encode_integer() failed to encode zero!\");\r\n \r\n //jso_encode_boolean() --- true\r\n expected = \"true\";\r\n actual = jso_encode_boolean(true);\r\n assert_equal(expected, actual, \"jso_encode_boolean() failed to encode true!\");\r\n \r\n //jso_encode_boolean() --- false\r\n expected = \"false\";\r\n actual = jso_encode_boolean(false);\r\n assert_equal(expected, actual, \"jso_encode_boolean() failed to encode false!\");\r\n \r\n //jso_encode_string() --- Simple string\r\n expected = '\"waahoo\"';\r\n actual = jso_encode_string(\"waahoo\");\r\n assert_equal(expected, actual, \"jso_encode_string() failed to encode simple string!\");\r\n \r\n //jso_encode_string() --- Empty string\r\n expected = '\"\"';\r\n actual = jso_encode_string(\"\");\r\n assert_equal(expected, actual, \"jso_encode_string() failed to encode empty string!\");\r\n \r\n //jso_encode_string() --- Basic escape characters\r\n expected = '\"\\\\\\\"\\b\\f\\n\\r\\t\"';\r\n actual = jso_encode_string('\\\"' + chr(8) + chr(12) + chr(10) + chr(13) + chr(9));\r\n assert_equal(expected, actual, \"jso_encode_string() failed to encode escape character string!\");\r\n \r\n //jso_encode_map() --- Empty map\r\n var empty_map;\r\n empty_map = jso_new_map();\r\n expected = \"{}\";\r\n actual = jso_encode_map(empty_map);\r\n assert_equal(expected, actual, \"jso_encode_map() failed to encode empty map!\");\r\n jso_cleanup_map(empty_map);\r\n \r\n //jso_encode_map() --- One-element map\r\n var one_map;\r\n one_map = jso_new_map();\r\n jso_map_add_string(one_map, \"key\", \"value\");\r\n expected = '{\"key\":\"value\"}';\r\n actual = jso_encode_map(one_map);\r\n assert_equal(expected, actual, \"jso_encode_map() failed to encode one-element map!\");\r\n jso_cleanup_map(one_map);\r\n \r\n //jso_encode_map() --- Multi-element map\r\n var multi_map, ok1, ok2;\r\n multi_map = jso_new_map();\r\n jso_map_add_string(multi_map, \"key1\", \"value\\1\");\r\n jso_map_add_integer(multi_map, \"key2\", 2);\r\n ok1 = '{\"key1\":\"value\\\\1\",\"key2\":2}';\r\n ok2 = '{\"key2\":2,\"key1\":\"value\\\\1\"}';\r\n actual = jso_encode_map(multi_map);\r\n assert_true((actual == ok1) || (actual == ok2), \"jso_encode_map() failed to encode multi-element map!\");\r\n jso_cleanup_map(multi_map);\r\n \r\n //jso_encode_list() --- Empty list\r\n var empty_list;\r\n empty_list = jso_new_list();\r\n expected = \"[]\";\r\n actual = jso_encode_list(empty_list);\r\n assert_equal(expected, actual, \"jso_encode_list() failed to encode empty list!\");\r\n jso_cleanup_list(empty_list);\r\n \r\n //jso_encode_list() --- One-element nested list\r\n var one_list;\r\n one_list = jso_new_list();\r\n jso_list_add_submap(one_list, jso_new_map());\r\n expected = \"[{}]\";\r\n actual = jso_encode_list(one_list);\r\n assert_equal(expected, actual, \"jso_encode_list() failed to encode one-element nested list!\");\r\n jso_cleanup_list(one_list);\r\n \r\n //jso_encode_list() --- Multi-element nested list\r\n var multi_list, submap, sublist;\r\n multi_list = jso_new_list();\r\n submap = jso_new_map();\r\n jso_map_add_string(submap, \"1\", \"one\");\r\n jso_list_add_submap(multi_list, submap);\r\n jso_list_add_integer(multi_list, 2);\r\n sublist = jso_new_list();\r\n jso_list_add_string(sublist, \"three\");\r\n jso_list_add_boolean(sublist, true);\r\n jso_list_add_sublist(multi_list, sublist);\r\n expected = '[{\"1\":\"one\"},2,[\"three\",true]]';\r\n actual = jso_encode_list(multi_list);\r\n assert_equal(expected, actual, \"jso_encode_list() failed to encode one-element nested list!\");\r\n jso_cleanup_list(multi_list);\r\n}\r\n\r\n#define _test_jso_decode\r\n{\r\n /**\r\n _test_jso_decode(): Test core _jso_decode_*() functions.\r\n The formatting is intentionally erratic here to simulate actual formatting deviations.\r\n JSOnion version: 1.0.0d\r\n */\r\n var json, expected, actual, expected_structure, actual_structure;\r\n \r\n ////Primitives\r\n \r\n //_jso_decode_string(): Empty string\r\n json = '\"\"';\r\n expected = __jso_gmt_tuple(\"\", 3);\r\n actual = _jso_decode_string(json, 1);\r\n assert_equal(expected, actual, \"_jso_decode_string() failed to decode an empty string!\");\r\n \r\n //_jso_decode_string(): Small string\r\n json = '\"key\" ';\r\n expected = __jso_gmt_tuple(\"key\", 6);\r\n actual = _jso_decode_string(json, 1);\r\n assert_equal(expected, actual, \"_jso_decode_string() failed to decode a small string!\");\r\n \r\n //_jso_decode_string(): Simple string\r\n json = ' \"The quick brown fox jumps over the lazy dog.\" ';\r\n expected = __jso_gmt_tuple(\"The quick brown fox jumps over the lazy dog.\", 49);\r\n actual = _jso_decode_string(json, 1);\r\n assert_equal(expected, actual, \"_jso_decode_string() failed to decode a simple string!\");\r\n \r\n //_jso_decode_string(): Escape characters\r\n json = ' \"\\\"\\\\\\b\\f\\n\\r\\t\\u003A\"';\r\n expected = __jso_gmt_tuple('\"\\' + chr(8) + chr(12) + chr(10) + chr(13) + chr(9) + chr($003a), 24);\r\n actual = _jso_decode_string(json, 1);\r\n assert_equal(expected, actual, \"_jso_decode_string() failed to decode a string with escape characters!\");\r\n \r\n //_jso_decode_string(): Mixed characters\r\n json = ' \"\\\"\\\\\\bWaahoo\\f\\n\\r\\tnegg\\u003a\"';\r\n expected = __jso_gmt_tuple('\"\\' + chr(8) + \"Waahoo\" + chr(12) + chr(10) + chr(13) + chr(9) + \"negg\" + chr($003a), 34);\r\n actual = _jso_decode_string(json, 1);\r\n assert_equal(expected, actual, \"_jso_decode_string() failed to decode a string with mixed characters!\");\r\n \r\n //_jso_decode_boolean(): True\r\n json = 'true';\r\n expected = __jso_gmt_tuple(true, 5);\r\n actual = _jso_decode_boolean(json, 1);\r\n assert_equal(expected, actual, \"_jso_decode_boolean() failed to decode true!\");\r\n \r\n //_jso_decode_boolean(): False\r\n json = ' false ';\r\n expected = __jso_gmt_tuple(false, 8);\r\n actual = _jso_decode_boolean(json, 1);\r\n assert_equal(expected, actual, \"_jso_decode_boolean() failed to decode false!\");\r\n \r\n //_jso_decode_real(): Zero\r\n json = '0';\r\n expected = __jso_gmt_tuple(0, 2);\r\n actual = _jso_decode_real(json, 1);\r\n assert_equal(expected, actual, \"_jso_decode_real() failed to decode standard zero!\");\r\n \r\n //_jso_decode_real(): Signed zero\r\n json = ' +0 ';\r\n expected = __jso_gmt_tuple(0, 5);\r\n actual = _jso_decode_real(json, 1);\r\n assert_equal(expected, actual, \"_jso_decode_real() failed to decode signed zero!\");\r\n \r\n //_jso_decode_real(): Signed zero with decimal digits\r\n json = ' -0.000';\r\n expected = __jso_gmt_tuple(0, 8);\r\n actual = _jso_decode_real(json, 1);\r\n assert_equal(expected, actual, \"_jso_decode_real() failed to decode signed zero with decimal digits!\");\r\n \r\n //_jso_decode_real(): Positive real\r\n json = '3.14159';\r\n expected = __jso_gmt_tuple(3.14159, 8);\r\n actual = _jso_decode_real(json, 1);\r\n assert_equal(expected, actual, \"_jso_decode_real() failed to decode positive real number!\");\r\n \r\n //_jso_decode_real(): Negative real\r\n json = ' -2.71828';\r\n expected = __jso_gmt_tuple(-2.71828, 10);\r\n actual = _jso_decode_real(json, 1);\r\n assert_equal(expected, actual, \"_jso_decode_real() failed to decode negative real number!\");\r\n \r\n //_jso_decode_real(): Positive real with positive exponent\r\n json = ' 3.14159e2';\r\n expected = __jso_gmt_tuple(3.14159*100, 11);\r\n actual = _jso_decode_real(json, 1);\r\n assert_equal(expected, actual, \"_jso_decode_real() failed to decode positive real number with positive exponent!\");\r\n \r\n //_jso_decode_real(): Negative real with positive exponent\r\n json = ' -2.71828E2';\r\n expected = __jso_gmt_tuple(-2.71828*100, 12);\r\n actual = _jso_decode_real(json, 1);\r\n assert_equal(expected, actual, \"_jso_decode_real() failed to decode negative real number with positive exponent!\");\r\n \r\n //_jso_decode_real(): Positive real with negative exponent\r\n json = ' 314.159e-2';\r\n expected = __jso_gmt_tuple(3.14159, 12);\r\n actual = _jso_decode_real(json, 1);\r\n assert_equal(expected, actual, \"_jso_decode_real() failed to decode positive real number with negative exponent!\");\r\n \r\n //_jso_decode_real(): Negative real with negative exponent\r\n json = ' -271.828E-2';\r\n expected = __jso_gmt_tuple(-2.71828, 13);\r\n actual = _jso_decode_real(json, 1);\r\n assert_equal(expected, actual, \"_jso_decode_real() failed to decode negative real number with negative exponent!\");\r\n \r\n //_jso_decode_real(): Positive integer\r\n json = ' +1729';\r\n expected = __jso_gmt_tuple(1729, 7);\r\n actual = _jso_decode_real(json, 1);\r\n assert_equal(expected, actual, \"_jso_decode_real() failed to decode positive integer!\");\r\n \r\n //_jso_decode_real(): Negative integer\r\n json = '-583';\r\n expected = __jso_gmt_tuple(-583, 5);\r\n actual = _jso_decode_real(json, 1);\r\n assert_equal(expected, actual, \"_jso_decode_real() failed to decode negative integer!\");\r\n \r\n //_jso_decode_integer(): Zero\r\n json = ' 0 ';\r\n expected = __jso_gmt_tuple(0, 3);\r\n actual = _jso_decode_integer(json, 1);\r\n assert_equal(expected, actual, \"_jso_decode_integer() failed to decode zero!\");\r\n \r\n //_jso_decode_integer(): Positive integer\r\n json = ' 1729 ';\r\n expected = __jso_gmt_tuple(1729, 6);\r\n actual = _jso_decode_integer(json, 1);\r\n assert_equal(expected, actual, \"_jso_decode_integer() failed to decode positive integer!\");\r\n \r\n //_jso_decode_integer(): Negative integer\r\n json = ' -583';\r\n expected = __jso_gmt_tuple(-583, 8);\r\n actual = _jso_decode_integer(json, 1);\r\n assert_equal(expected, actual, \"_jso_decode_integer() failed to decode negative integer!\");\r\n \r\n \r\n ////Data structures\r\n \r\n //_jso_decode_map(): Empty map #1\r\n json = '{}';\r\n expected_structure = jso_new_map();\r\n expected = __jso_gmt_tuple(expected_structure, 3);\r\n actual = _jso_decode_map(json, 1);\r\n actual_structure = __jso_gmt_elem(actual, 0);\r\n assert_equal(__jso_gmt_elem(expected, 1), __jso_gmt_elem(actual, 1), \"_jso_decode_map() didn't stop at the right place! (#1)\");\r\n assert_equal(actual_structure, __jso_gmt_elem(actual, 0), \"_jso_decode_map() didn't include the right prefix! (#1)\");\r\n assert_true(jso_compare_maps(expected_structure, actual_structure), \"_jso_decode_map() failed to decode an empty map! (#1)\");\r\n jso_cleanup_map(expected_structure);\r\n jso_cleanup_map(actual_structure);\r\n \r\n //_jso_decode_map(): Empty map #2\r\n json = ' { } ';\r\n expected_structure = jso_new_map();\r\n expected = __jso_gmt_tuple(expected_structure, 7);\r\n actual = _jso_decode_map(json, 1);\r\n actual_structure = __jso_gmt_elem(actual, 0);\r\n assert_equal(__jso_gmt_elem(expected, 1), __jso_gmt_elem(actual, 1), \"_jso_decode_map() didn't stop at the right place! (#2)\");\r\n assert_equal(actual_structure, __jso_gmt_elem(actual, 0), \"_jso_decode_map() didn't include the right prefix! (#2)\");\r\n assert_true(jso_compare_maps(expected_structure, actual_structure), \"_jso_decode_map() failed to decode an empty map! (#2)\");\r\n jso_cleanup_map(expected_structure);\r\n jso_cleanup_map(actual_structure);\r\n \r\n //_jso_decode_map(): One-entry map\r\n json = ' {\"key\": \"value\"} ';\r\n expected_structure = jso_new_map();\r\n expected = __jso_gmt_tuple(expected_structure, 18);\r\n jso_map_add_string(expected_structure, \"key\", \"value\");\r\n actual = _jso_decode_map(json, 1);\r\n actual_structure = __jso_gmt_elem(actual, 0);\r\n assert_equal(__jso_gmt_elem(expected, 1), __jso_gmt_elem(actual, 1), \"_jso_decode_map() didn't stop at the right place! (one-entry map)\");\r\n assert_equal(actual_structure, __jso_gmt_elem(actual, 0), \"_jso_decode_map() didn't include the right prefix! (one-entry map)\");\r\n assert_true(jso_compare_maps(expected_structure, actual_structure), \"_jso_decode_map() failed to decode a one-entry map!\");\r\n jso_cleanup_map(expected_structure);\r\n jso_cleanup_map(actual_structure);\r\n \r\n //_jso_decode_map(): Multi-entry map\r\n json = ' {\"key\" : \"value\", \"pi\":3.14, \"bool\" : true} ';\r\n expected_structure = jso_new_map();\r\n expected = __jso_gmt_tuple(expected_structure, 48);\r\n jso_map_add_string(expected_structure, \"key\", \"value\");\r\n jso_map_add_real(expected_structure, \"pi\", 3.14);\r\n jso_map_add_boolean(expected_structure, \"bool\", true);\r\n actual = _jso_decode_map(json, 1);\r\n actual_structure = __jso_gmt_elem(actual, 0);\r\n assert_equal(__jso_gmt_elem(expected, 1), __jso_gmt_elem(actual, 1), \"_jso_decode_map() didn't stop at the right place! (multi-entry map)\");\r\n assert_equal(actual_structure, __jso_gmt_elem(actual, 0), \"_jso_decode_map() didn't include the right prefix! (multi-entry map)\");\r\n assert_true(jso_compare_maps(expected_structure, actual_structure), \"_jso_decode_map() failed to decode a multi-entry map!\");\r\n jso_cleanup_map(expected_structure);\r\n jso_cleanup_map(actual_structure);\r\n \r\n //_jso_decode_map(): Nested maps\r\n var submap;\r\n json = '{ \"waahoo\" : { \"woohah\" : 3 } , \"woohah\" : 4 }';\r\n expected_structure = jso_new_map();\r\n expected = __jso_gmt_tuple(expected_structure, 47);\r\n jso_map_add_integer(expected_structure, \"woohah\", 4);\r\n submap = jso_new_map();\r\n jso_map_add_integer(submap, \"woohah\", 3);\r\n jso_map_add_submap(expected_structure, \"waahoo\", submap);\r\n actual = _jso_decode_map(json, 1);\r\n actual_structure = __jso_gmt_elem(actual, 0);\r\n assert_equal(__jso_gmt_elem(expected, 1), __jso_gmt_elem(actual, 1), \"_jso_decode_map() didn't stop at the right place! (nested map)\");\r\n assert_equal(actual_structure, __jso_gmt_elem(actual, 0), \"_jso_decode_map() didn't include the right prefix! (nested map)\");\r\n assert_true(jso_compare_maps(expected_structure, actual_structure), \"_jso_decode_map() failed to decode a nested map!\");\r\n jso_cleanup_map(expected_structure);\r\n jso_cleanup_map(actual_structure);\r\n \r\n //_jso_decode_map(): Map with nested lists\r\n var sublist, subsublist;\r\n json = '{ \"waahoo\" : [ \"woohah\", [true] ] , \"woohah\" : 4 }';\r\n expected_structure = jso_new_map();\r\n expected = __jso_gmt_tuple(expected_structure, 51);\r\n jso_map_add_real(expected_structure, \"woohah\", 4);\r\n sublist = jso_new_list();\r\n jso_list_add_string(sublist, \"woohah\");\r\n subsublist = jso_new_list();\r\n jso_list_add_boolean(subsublist, true);\r\n jso_list_add_sublist(sublist, subsublist);\r\n jso_map_add_sublist(expected_structure, \"waahoo\", sublist);\r\n actual = _jso_decode_map(json, 1);\r\n actual_structure = __jso_gmt_elem(actual, 0);\r\n assert_equal(__jso_gmt_elem(expected, 1), __jso_gmt_elem(actual, 1), \"_jso_decode_map() didn't stop at the right place! (map with nested lists)\");\r\n assert_equal(actual_structure, __jso_gmt_elem(actual, 0), \"_jso_decode_map() didn't include the right prefix! (map with nested lists)\");\r\n assert_true(jso_compare_maps(expected_structure, actual_structure), \"_jso_decode_map() failed to decode a map with nested lists!\");\r\n jso_cleanup_map(expected_structure);\r\n jso_cleanup_map(actual_structure);\r\n \r\n //_jso_decode_map(): Mix-up nested map\r\n var sublist;\r\n json = ' { \"waahoo\" : [{}, \"a\", 1] }';\r\n expected_structure = jso_new_map();\r\n expected = __jso_gmt_tuple(expected_structure, 30);\r\n sublist = jso_new_list();\r\n jso_list_add_submap(sublist, jso_new_map());\r\n jso_list_add_string(sublist, \"a\");\r\n jso_list_add_real(sublist, 1);\r\n jso_map_add_sublist(expected_structure, \"waahoo\", sublist);\r\n actual = _jso_decode_map(json, 1);\r\n actual_structure = __jso_gmt_elem(actual, 0);\r\n assert_equal(__jso_gmt_elem(expected, 1), __jso_gmt_elem(actual, 1), \"_jso_decode_map() didn't stop at the right place! (mix-up nested map)\");\r\n assert_equal(actual_structure, __jso_gmt_elem(actual, 0), \"_jso_decode_map() didn't include the right prefix! (mix-up nested map)\");\r\n assert_true(jso_compare_maps(expected_structure, actual_structure), \"_jso_decode_map() failed to decode a mix-up nested map!\");\r\n jso_cleanup_map(expected_structure);\r\n jso_cleanup_map(actual_structure);\r\n \r\n //_jso_decode_list(): Empty list #1\r\n json = '[]';\r\n expected_structure = jso_new_list();\r\n expected = __jso_gmt_tuple(expected_structure, 3);\r\n actual = _jso_decode_list(json, 1);\r\n actual_structure = __jso_gmt_elem(actual, 0);\r\n assert_equal(__jso_gmt_elem(expected, 1), __jso_gmt_elem(actual, 1), \"_jso_decode_list() didn't stop at the right place! (#1)\");\r\n assert_equal(actual_structure, __jso_gmt_elem(actual, 0), \"_jso_decode_list() didn't include the right prefix! (#1)\");\r\n assert_true(jso_compare_lists(expected_structure, actual_structure), \"_jso_decode_list() failed to decode an empty list! (#1)\");\r\n jso_cleanup_list(expected_structure);\r\n jso_cleanup_list(actual_structure)\r\n \r\n //_jso_decode_list(): Empty list #2\r\n json = ' [ ] ';\r\n expected_structure = jso_new_list();\r\n expected = __jso_gmt_tuple(expected_structure, 6);\r\n actual = _jso_decode_list(json, 1);\r\n actual_structure = __jso_gmt_elem(actual, 0);\r\n assert_equal(__jso_gmt_elem(expected, 1), __jso_gmt_elem(actual, 1), \"_jso_decode_list() didn't stop at the right place! (#2)\");\r\n assert_equal(actual_structure, __jso_gmt_elem(actual, 0), \"_jso_decode_list() didn't include the right prefix! (#2)\");\r\n assert_true(jso_compare_lists(expected_structure, actual_structure), \"_jso_decode_list() failed to decode an empty list! (#2)\");\r\n jso_cleanup_list(expected_structure);\r\n jso_cleanup_list(actual_structure);\r\n \r\n //_jso_decode_list(): One-entry list\r\n json = '[3]';\r\n expected_structure = jso_new_list();\r\n expected = __jso_gmt_tuple(expected_structure, 4);\r\n jso_list_add_integer(expected_structure, 3);\r\n actual = _jso_decode_list(json, 1);\r\n actual_structure = __jso_gmt_elem(actual, 0);\r\n assert_equal(__jso_gmt_elem(expected, 1), __jso_gmt_elem(actual, 1), \"_jso_decode_list() didn't stop at the right place! (one-entry list)\");\r\n assert_equal(actual_structure, __jso_gmt_elem(actual, 0), \"_jso_decode_list() didn't include the right prefix! (one-entry list)\");\r\n assert_true(jso_compare_lists(expected_structure, actual_structure), \"_jso_decode_list() failed to decode a one-entry list!\");\r\n jso_cleanup_list(expected_structure);\r\n jso_cleanup_list(actual_structure);\r\n \r\n //_jso_decode_list(): Multi-entry list\r\n json = ' [4,\"multi-entry\",true]';\r\n expected_structure = jso_new_list();\r\n expected = __jso_gmt_tuple(expected_structure, 24);\r\n jso_list_add_real(expected_structure, 4);\r\n jso_list_add_string(expected_structure, \"multi-entry\");\r\n jso_list_add_boolean(expected_structure, true);\r\n actual = _jso_decode_list(json, 1);\r\n actual_structure = __jso_gmt_elem(actual, 0);\r\n assert_equal(__jso_gmt_elem(expected, 1), __jso_gmt_elem(actual, 1), \"_jso_decode_list() didn't stop at the right place! (multi-entry list)\");\r\n assert_equal(actual_structure, __jso_gmt_elem(actual, 0), \"_jso_decode_list() didn't include the right prefix! (multi-entry list)\");\r\n assert_true(jso_compare_lists(expected_structure, actual_structure), \"_jso_decode_list() failed to decode a multi-entry list!\");\r\n jso_cleanup_list(expected_structure);\r\n jso_cleanup_list(actual_structure);\r\n \r\n //_jso_decode_list(): Nested list\r\n var sublist;\r\n json = ' [ [], 3, false, [\"waahoo\"]]';\r\n expected_structure = jso_new_list();\r\n expected = __jso_gmt_tuple(expected_structure, 29);\r\n jso_list_add_sublist(expected_structure, jso_new_list());\r\n jso_list_add_integer(expected_structure, 3);\r\n jso_list_add_boolean(expected_structure, false);\r\n sublist = jso_new_list();\r\n jso_list_add_string(sublist, \"waahoo\");\r\n jso_list_add_sublist(expected_structure, sublist);\r\n actual = _jso_decode_list(json, 1);\r\n actual_structure = __jso_gmt_elem(actual, 0);\r\n assert_equal(__jso_gmt_elem(expected, 1), __jso_gmt_elem(actual, 1), \"_jso_decode_list() didn't stop at the right place! (nested list)\");\r\n assert_equal(actual_structure, __jso_gmt_elem(actual, 0), \"_jso_decode_list() didn't include the right prefix! (nested list)\");\r\n assert_true(jso_compare_lists(expected_structure, actual_structure), \"_jso_decode_list() failed to decode a nested list!\");\r\n jso_cleanup_list(expected_structure);\r\n jso_cleanup_list(actual_structure);\r\n \r\n //_jso_decode_list(): List with nested maps\r\n var submap;\r\n json = ' [3, false, { \"waahoo\":\"woo\"}]';\r\n expected_structure = jso_new_list();\r\n expected = __jso_gmt_tuple(expected_structure, 31);\r\n jso_list_add_integer(expected_structure, 3);\r\n jso_list_add_boolean(expected_structure, false);\r\n submap = jso_new_map();\r\n jso_map_add_string(submap, \"waahoo\", \"woo\");\r\n jso_list_add_submap(expected_structure, submap);\r\n actual = _jso_decode_list(json, 1);\r\n actual_structure = __jso_gmt_elem(actual, 0);\r\n assert_equal(__jso_gmt_elem(expected, 1), __jso_gmt_elem(actual, 1), \"_jso_decode_list() didn't stop at the right place! (list with nested maps)\");\r\n assert_equal(actual_structure, __jso_gmt_elem(actual, 0), \"_jso_decode_list() didn't include the right prefix! (list with nested maps)\");\r\n assert_true(jso_compare_lists(expected_structure, actual_structure), \"_jso_decode_list() failed to decode a list with nested maps!\");\r\n jso_cleanup_list(expected_structure);\r\n jso_cleanup_list(actual_structure);\r\n \r\n //_jso_decode_list(): Mix-up nested list\r\n var submap;\r\n json = '[{}, {\"a\":[]}]';\r\n expected_structure = jso_new_list();\r\n expected = __jso_gmt_tuple(expected_structure, 15);\r\n jso_list_add_submap(expected_structure, jso_new_map());\r\n submap = jso_new_map();\r\n jso_map_add_sublist(submap, \"a\", jso_new_list());\r\n jso_list_add_submap(expected_structure, submap);\r\n actual = _jso_decode_list(json, 1);\r\n actual_structure = __jso_gmt_elem(actual, 0);\r\n assert_equal(__jso_gmt_elem(expected, 1), __jso_gmt_elem(actual, 1), \"_jso_decode_list() didn't stop at the right place! (mix-up nested list)\");\r\n assert_equal(actual_structure, __jso_gmt_elem(actual, 0), \"_jso_decode_list() didn't include the right prefix! (mix-up nested list)\");\r\n assert_true(jso_compare_lists(expected_structure, actual_structure), \"_jso_decode_list() failed to decode a mix-up nested list!\");\r\n jso_cleanup_list(expected_structure);\r\n jso_cleanup_list(actual_structure);\r\n}\r\n\r\n#define _test_jso_compare\r\n{\r\n /**\r\n _test_jso_compare(): Test basic jso_compare_*() functions.\r\n JSOnion version: 1.0.0d\r\n */\r\n var a, b;\r\n \r\n //jso_compare_maps(): Empty maps should equal each other\r\n a = jso_new_map();\r\n b = jso_new_map();\r\n assert_true(jso_compare_maps(a, b), \"Empty maps should equal each other. (#1)\");\r\n assert_true(jso_compare_maps(b, a), \"Empty maps should equal each other. (#2)\");\r\n jso_cleanup_map(a);\r\n jso_cleanup_map(b);\r\n \r\n //jso_compare_maps(): An empty map should not equal a filled map\r\n a = jso_new_map();\r\n b = jso_new_map();\r\n jso_map_add_string(b, \"junk\", \"info\");\r\n jso_map_add_integer(b, \"taxi\", 1729);\r\n assert_false(jso_compare_maps(a, b), \"An empty map should not equal a filled map. (#1)\");\r\n assert_false(jso_compare_maps(b, a), \"An empty map should not equal a filled map. (#2)\");\r\n jso_cleanup_map(a);\r\n jso_cleanup_map(b);\r\n \r\n //jso_compare_maps(): Maps with same content entered in different orders should equal each other\r\n a = jso_new_map();\r\n b = jso_new_map();\r\n jso_map_add_real(a, \"A\", 1);\r\n jso_map_add_real(a, \"B\", 2);\r\n jso_map_add_real(a, \"C\", 3);\r\n jso_map_add_real(b, \"C\", 3);\r\n jso_map_add_real(b, \"A\", 1);\r\n jso_map_add_real(b, \"B\", 2);\r\n assert_true(jso_compare_maps(a, b), \"Maps with same content entered in different orders should equal each other. (#1)\");\r\n assert_true(jso_compare_maps(b, a), \"Maps with same content entered in different orders should equal each other. (#2)\");\r\n jso_cleanup_map(a);\r\n jso_cleanup_map(b);\r\n \r\n //jso_compare_maps(): Maps with different keys should not equal each other\r\n a = jso_new_map();\r\n b = jso_new_map();\r\n jso_map_add_real(a, \"A\", 1);\r\n jso_map_add_real(a, \"B\", 2);\r\n jso_map_add_real(a, \"C\", 3);\r\n jso_map_add_real(b, \"D\", 3);\r\n jso_map_add_real(b, \"A\", 1);\r\n jso_map_add_real(b, \"B\", 2);\r\n assert_false(jso_compare_maps(a, b), \"Maps with different keys should not equal each other. (#1)\");\r\n assert_false(jso_compare_maps(b, a), \"Maps with different keys should not equal each other. (#2)\");\r\n jso_cleanup_map(a);\r\n jso_cleanup_map(b);\r\n \r\n //jso_compare_maps(): Maps with different values should not equal each other\r\n a = jso_new_map();\r\n b = jso_new_map();\r\n jso_map_add_real(a, \"A\", 5);\r\n jso_map_add_real(a, \"B\", 6);\r\n jso_map_add_real(a, \"C\", 9);\r\n jso_map_add_real(b, \"A\", 5);\r\n jso_map_add_real(b, \"B\", 6);\r\n jso_map_add_real(b, \"C\", 8);\r\n assert_false(jso_compare_maps(a, b), \"Maps with different values should not equal each other. (#1)\");\r\n assert_false(jso_compare_maps(b, a), \"Maps with different values should not equal each other. (#2)\");\r\n jso_cleanup_map(a);\r\n jso_cleanup_map(b);\r\n \r\n //jso_compare_maps(): Maps with corresponding values of different types should not equal each other, and should not crash.\r\n a = jso_new_map();\r\n b = jso_new_map();\r\n jso_map_add_real(a, \"A\", 5);\r\n jso_map_add_real(a, \"B\", 6);\r\n jso_map_add_real(a, \"C\", 8);\r\n jso_map_add_real(b, \"A\", 5);\r\n jso_map_add_string(b, \"B\", \"six\");\r\n jso_map_add_real(b, \"C\", 8);\r\n assert_false(jso_compare_maps(a, b), \"Maps with corresponding values of different types should not equal each other, and should not crash. (#1)\");\r\n assert_false(jso_compare_maps(b, a), \"Maps with corresponding values of different types should not equal each other, and should not crash. (#2)\");\r\n jso_cleanup_map(a);\r\n jso_cleanup_map(b);\r\n \r\n //jso_compare_lists(): Empty lists should equal each other\r\n a = jso_new_list();\r\n b = jso_new_list();\r\n assert_true(jso_compare_lists(a, b), \"Empty lists should equal each other. (#1)\");\r\n assert_true(jso_compare_lists(b, a), \"Empty lists should equal each other. (#2)\");\r\n jso_cleanup_list(a);\r\n jso_cleanup_list(b);\r\n \r\n //jso_compare_lists(): An empty list should not equal a filled list\r\n a = jso_new_list();\r\n b = jso_new_list();\r\n jso_list_add_string(b, \"junk\");\r\n jso_list_add_integer(b, 1729);\r\n assert_false(jso_compare_lists(a, b), \"An empty list should not equal a filled list. (#1)\");\r\n assert_false(jso_compare_lists(b, a), \"An empty list should not equal a filled list. (#2)\");\r\n jso_cleanup_list(a);\r\n jso_cleanup_list(b);\r\n \r\n //jso_compare_lists(): Lists with same content entered in different orders should not equal each other\r\n a = jso_new_list();\r\n b = jso_new_list();\r\n jso_list_add_real(a, 1);\r\n jso_list_add_real(a, 2);\r\n jso_list_add_real(a, 3);\r\n jso_list_add_real(b, 3);\r\n jso_list_add_real(b, 1);\r\n jso_list_add_real(b, 2);\r\n assert_false(jso_compare_lists(a, b), \"Lists with same content entered in different orders should not equal each other. (#1)\");\r\n assert_false(jso_compare_lists(b, a), \"Lists with same content entered in different orders should not equal each other. (#2)\");\r\n jso_cleanup_list(a);\r\n jso_cleanup_list(b);\r\n \r\n //jso_compare_lists(): Lists with corresponding entries of different types should not equal each other, should also not crash.\r\n a = jso_new_list();\r\n b = jso_new_list();\r\n jso_list_add_real(a, 1);\r\n jso_list_add_real(a, 2);\r\n jso_list_add_real(a, 3);\r\n jso_list_add_real(b, 1);\r\n jso_list_add_string(b, \"two\");\r\n jso_list_add_real(b, 3);\r\n assert_false(jso_compare_lists(a, b), \"Lists with corresponding entries of different types should not equal each other, should also not crash. (#1)\");\r\n assert_false(jso_compare_lists(b, a), \"Lists with corresponding entries of different types should not equal each other, should also not crash. (#2)\");\r\n jso_cleanup_list(a);\r\n jso_cleanup_list(b);\r\n}\r\n\r\n#define _test_jso_lookup\r\n{\r\n /**\r\n _test_jso_lookup(): Test core jso_*_lookup() and jso_*_check() functions for nested structures.\r\n JSOnion version: 1.0.0d\r\n */\r\n var json, structure, expected, actual;\r\n \r\n //jso_map_check(): Single argument --- exists\r\n json = '{ \"one\" : 1, \"two\" : 2, \"three\" : 3 }';\r\n structure = jso_decode_map(json);\r\n assert_true(jso_map_check(structure, \"one\"), \"jso_map_check() failed to find existing entry! (single argument)\");\r\n jso_cleanup_map(structure);\r\n \r\n //jso_map_lookup(): Single argument --- exists\r\n json = '{ \"one\" : 1, \"two\" : 2, \"three\" : 3 }';\r\n structure = jso_decode_map(json);\r\n expected = 1;\r\n actual = jso_map_lookup(structure, \"one\")\r\n assert_equal(expected, actual, \"jso_map_lookup() found the wrong entry! (single argument)\");\r\n jso_cleanup_map(structure);\r\n \r\n //jso_map_lookup_type(): Single argument --- exists\r\n json = '{ \"one\" : -1, \"two\" : true, \"three\" : \"trap\" }';\r\n structure = jso_decode_map(json);\r\n expected = jso_type_real;\r\n actual = jso_map_lookup_type(structure, \"one\")\r\n assert_equal(expected, actual, \"jso_map_lookup_type() found the wrong type! (single argument)\");\r\n jso_cleanup_map(structure);\r\n \r\n //jso_map_check(): Single argument --- doesn't exist\r\n json = '{ \"one\" : 1, \"two\" : 2, \"three\" : 3 }';\r\n structure = jso_decode_map(json);\r\n assert_false(jso_map_check(structure, \"four\"), \"jso_map_check() found an inexistent entry! (single argument)\");\r\n jso_cleanup_map(structure);\r\n \r\n //jso_map_check(): Single argument --- doesn't exist\r\n json = '{ \"one\" : 1, \"two\" : 2, \"three\" : 3, \"four\" : { \"A\":true, \"B\":false } }';\r\n structure = jso_decode_map(json);\r\n assert_false(jso_map_check(structure, \"A\"), \"jso_map_check() found an inexistent entry! (single argument, nested)\");\r\n jso_cleanup_map(structure);\r\n \r\n //jso_map_check(): Multiple arguments (recurse) --- exists\r\n json = '{ \"one\" : 1, \"two\" : 2, \"three\" : 3, \"four\" : { \"A\":true, \"B\":false } }';\r\n structure = jso_decode_map(json);\r\n assert_true(jso_map_check(structure, \"four\", \"A\"), \"jso_map_check() failed to find existing entry! (multiple arguments)\");\r\n jso_cleanup_map(structure);\r\n \r\n //jso_map_lookup(): Multiple arguments (recurse) --- exists\r\n json = '{ \"one\" : 1, \"two\" : 2, \"three\" : 3, \"four\" : { \"A\":true, \"B\":false } }';\r\n structure = jso_decode_map(json);\r\n expected = true;\r\n actual = jso_map_lookup(structure, \"four\", \"A\");\r\n assert_equal(expected, actual, \"jso_map_lookup() found the wrong entry! (multiple arguments)\");\r\n jso_cleanup_map(structure);\r\n \r\n //jso_map_lookup_type(): Multiple arguments (recurse) --- exists\r\n json = '{ \"one\" : 1, \"two\" : 2, \"three\" : 3, \"four\" : { \"A\":true, \"B\":\"trap\" } }';\r\n structure = jso_decode_map(json);\r\n expected = jso_type_boolean;\r\n actual = jso_map_lookup_type(structure, \"four\", \"A\");\r\n assert_equal(expected, actual, \"jso_map_lookup_type() found the wrong type! (multiple arguments)\");\r\n jso_cleanup_map(structure);\r\n \r\n //jso_map_check(): Multiple arguments (recurse) --- doesn't exist\r\n json = '{ \"one\" : 1, \"two\" : 2, \"three\" : 3, \"four\" : { \"A\":true, \"B\":false } }';\r\n structure = jso_decode_map(json);\r\n assert_false(jso_map_check(structure, \"four\", \"C\"), \"jso_map_check() found an inexistent entry! (multiple arguments, 1)\");\r\n jso_cleanup_map(structure);\r\n \r\n //jso_map_check(): Multiple arguments (recurse) --- doesn't exist\r\n json = '{ \"one\" : 1, \"two\" : 2, \"three\" : 3, \"four\" : { \"A\":true, \"B\":false } }';\r\n structure = jso_decode_map(json);\r\n assert_false(jso_map_check(structure, \"three\", \"\"), \"jso_map_check() found an inexistent entry! (multiple arguments, 2)\");\r\n jso_cleanup_map(structure);\r\n \r\n //jso_map_check(): Multiple arguments with nested list --- exists\r\n json = '{ \"one\" : 1, \"two\" : 2, \"three\" : 3, \"four\" : [ \"A\", true, [\"B\", false] ] }';\r\n structure = jso_decode_map(json);\r\n assert_true(jso_map_check(structure, \"four\", 2, 1), \"jso_map_check() failed to find an existing entry! (multiple arguments, nested)\");\r\n jso_cleanup_map(structure);\r\n \r\n //jso_map_lookup(): Multiple arguments with nested list --- exists\r\n json = '{ \"one\" : 1, \"two\" : 2, \"three\" : 3, \"four\" : [ \"A\", true, [\"B\", false] ] }';\r\n structure = jso_decode_map(json);\r\n expected = false;\r\n actual = jso_map_lookup(structure, \"four\", 2, 1);\r\n assert_equal(expected, actual, \"jso_map_lookup() failed to find an existing entry! (multiple arguments, nested)\");\r\n jso_cleanup_map(structure);\r\n \r\n //jso_map_lookup_type(): Multiple arguments with nested list --- exists\r\n json = '{ \"one\" : 1, \"two\" : 2, \"three\" : 3, \"four\" : [ \"A\", true, [false, \"false\"] ] }';\r\n structure = jso_decode_map(json);\r\n expected = jso_type_string;\r\n actual = jso_map_lookup_type(structure, \"four\", 2, 1);\r\n assert_equal(expected, actual, \"jso_map_lookup_type() found the wrong type! (multiple arguments, nested)\");\r\n jso_cleanup_map(structure);\r\n \r\n //jso_map_check(): Multiple arguments with nested list --- wrong type\r\n json = '{ \"one\" : 1, \"two\" : 2, \"three\" : 3, \"four\" : [ \"A\", true, [\"B\", false] ] }';\r\n structure = jso_decode_map(json);\r\n assert_false(jso_map_check(structure, \"four\", \"A\", 1), \"jso_map_check() found an inexistent entry! (multiple arguments, nested, wrong type)\");\r\n jso_cleanup_map(structure);\r\n \r\n //jso_map_check(): Multiple arguments with nested list --- index overflow\r\n json = '{ \"one\" : 1, \"two\" : 2, \"three\" : 3, \"four\" : [ \"A\", true, [\"B\", false] ] }';\r\n structure = jso_decode_map(json);\r\n assert_false(jso_map_check(structure, \"four\", 2, 3), \"jso_map_check() found an inexistent entry! (multiple arguments, nested, index overflow)\");\r\n jso_cleanup_map(structure);\r\n \r\n //jso_list_check(): Single argument --- exists\r\n json = '[\"one\", 2, \"three\", true, 5]';\r\n structure = jso_decode_list(json);\r\n assert_true(jso_list_check(structure, 2), \"jso_list_check() failed to find an existing index! (single argument)\");\r\n jso_cleanup_list(structure);\r\n \r\n //jso_list_lookup(): Single argument --- exists\r\n json = '[\"one\", 2, \"three\", true, 5]';\r\n structure = jso_decode_list(json);\r\n expected = \"three\";\r\n actual = jso_list_lookup(structure, 2);\r\n assert_equal(expected, actual, \"jso_list_lookup() found the wrong index! (single argument)\");\r\n jso_cleanup_list(structure);\r\n \r\n //jso_list_lookup_type(): Single argument --- exists\r\n json = '[\"one\", 2, \"three\", true, 5]';\r\n structure = jso_decode_list(json);\r\n expected = jso_type_string;\r\n actual = jso_list_lookup_type(structure, 2);\r\n assert_equal(expected, actual, \"jso_list_lookup_type() found the wrong type! (single argument)\");\r\n jso_cleanup_list(structure);\r\n \r\n //jso_list_check(): Single argument --- doesn't exist\r\n json = '[\"one\", 2, \"three\", true, 5]';\r\n structure = jso_decode_list(json);\r\n assert_false(jso_list_check(structure, 5), \"jso_list_check() found an inexistent index! (single argument)\");\r\n jso_cleanup_list(structure);\r\n \r\n //jso_list_check(): Multiple arguments (recurse) --- exists\r\n json = '[\"one\", 2, [\"three\", 3], true, 5]';\r\n structure = jso_decode_list(json);\r\n assert_true(jso_list_check(structure, 2, 1), \"jso_list_check() failed to find an existing index! (multiple arguments)\");\r\n jso_cleanup_list(structure);\r\n \r\n //jso_list_lookup(): Multiple arguments (recurse) --- exists\r\n json = '[\"one\", 2, [\"three\", 3], true, 5]';\r\n structure = jso_decode_list(json);\r\n expected = 3;\r\n actual = jso_list_lookup(structure, 2, 1);\r\n assert_equal(expected, actual, \"jso_list_lookup() failed to find an existing index! (multiple arguments)\");\r\n jso_cleanup_list(structure);\r\n \r\n //jso_list_lookup_type(): Multiple arguments (recurse) --- exists\r\n json = '[\"one\", 2, [\"three\", 3], true, 5]';\r\n structure = jso_decode_list(json);\r\n expected = jso_type_real;\r\n actual = jso_list_lookup_type(structure, 2, 1);\r\n assert_equal(expected, actual, \"jso_list_lookup_type() found the wrong type! (multiple arguments)\");\r\n jso_cleanup_list(structure);\r\n \r\n //jso_list_check(): Multiple arguments (recurse) --- doesn't exist, inner index overflow\r\n json = '[\"one\", 2, [\"three\", 3], true, 5]';\r\n structure = jso_decode_list(json);\r\n assert_false(jso_list_check(structure, 2, 2), \"jso_list_check() found an inexistent index! (multiple arguments, inner index overflow)\");\r\n jso_cleanup_list(structure);\r\n \r\n //jso_list_check(): Multiple arguments (recurse) --- doesn't exist, trying to index single entry\r\n json = '[\"one\", 2, [\"three\", 3], true, 5]';\r\n structure = jso_decode_list(json);\r\n assert_false(jso_list_check(structure, 1, 0), \"jso_list_check() found an inexistent index! (multiple arguments, indexing single entry)\");\r\n jso_cleanup_list(structure);\r\n \r\n //jso_list_check(): Multiple arguments with nested map --- exists\r\n json = '[\"one\", 2, {\"three\":3}, true, 5]';\r\n structure = jso_decode_list(json);\r\n assert_true(jso_list_check(structure, 2, \"three\"), \"jso_list_check() failed to find an existing entry! (multiple arguments, nested map)\");\r\n jso_cleanup_list(structure);\r\n \r\n //jso_list_lookup(): Multiple arguments with nested map --- exists\r\n json = '[\"one\", 2, {\"three\":3}, true, 5]';\r\n structure = jso_decode_list(json);\r\n expected = 3;\r\n actual = jso_list_lookup(structure, 2, \"three\");\r\n assert_equal(expected, actual, \"jso_list_lookup() failed to find an existing entry! (multiple arguments, nested map)\");\r\n jso_cleanup_list(structure);\r\n \r\n //jso_list_lookup_type(): Multiple arguments with nested map --- exists\r\n json = '[\"one\", 2, {\"three\":false}, true, 5]';\r\n structure = jso_decode_list(json);\r\n expected = jso_type_boolean;\r\n actual = jso_list_lookup_type(structure, 2, \"three\");\r\n assert_equal(expected, actual, \"jso_list_lookup_type() found the wrong type! (multiple arguments, nested map)\");\r\n jso_cleanup_list(structure);\r\n \r\n //jso_list_exists(): Multiple arguments with nested map --- doesn't exist, key on single entry\r\n json = '[\"one\", 2, {\"three\":3}, true, 5]';\r\n structure = jso_decode_list(json);\r\n assert_false(jso_list_check(structure, 1, \"\"), \"jso_list_check() found an inexistent entry! (multiple arguments, nested map, key on single entry)\");\r\n jso_cleanup_list(structure);\r\n \r\n //jso_list_exists(): Multiple arguments with nested map --- doesn't exist, bad key\r\n json = '[\"one\", 2, {\"three\":3}, true, 5]';\r\n structure = jso_decode_list(json);\r\n assert_false(jso_list_check(structure, 2, \"\"), \"jso_list_check() found an inexistent entry! (multiple arguments, nested map, bad key)\");\r\n jso_cleanup_list(structure);\r\n}\r\n\r\n#define _test_jso_bugs\r\n{\r\n /**\r\n _test_jso_bugs(): Test reported bugs.\r\n JSOnion version: 1.0.0d\r\n */\r\n var expected, actual;\r\n \r\n //jso_encode_map() --- One-element map\r\n //Bug 1: Crash when encoding boolean-valued entries in maps, unknown variable jso_type_integer\r\n var one_map;\r\n one_map = jso_new_map();\r\n jso_map_add_boolean(one_map, \"true\", true);\r\n expected = '{\"true\":true}';\r\n actual = jso_encode_map(one_map);\r\n assert_equal(expected, actual, \"jso_encode_map() failed to encode one-element map with boolean entry!\");\r\n jso_cleanup_map(one_map);\r\n}\r\n\r\n" }, { "path": "src/test/resources/samples/langs/Game Maker Language/scrInitLevel.gml", "content": "// Originally from /spelunky/Scripts/Level Generation/scrInitLevel.gml in the Spelunky Community Update Project\n\n//\n// scrInitLevel()\n//\n// Calls scrLevelGen(), scrRoomGen*(), and scrEntityGen() to build level.\n//\n\n/**********************************************************************************\n Copyright (c) 2008, 2009 Derek Yu and Mossmouth, LLC\n \n This file is part of Spelunky.\n\n You can redistribute and/or modify Spelunky, including its source code, under\n the terms of the Spelunky User License.\n\n Spelunky is distributed in the hope that it will be entertaining and useful,\n but WITHOUT WARRANTY. Please see the Spelunky User License for more details.\n\n The Spelunky User License should be available in \"Game Information\", which\n can be found in the Resource Explorer, or as an external file called COPYING.\n If not, please obtain a new copy of Spelunky from \n \n***********************************************************************************/\n\nglobal.levelType = 0;\n//global.currLevel = 16;\nif (global.currLevel > 4 and global.currLevel < 9) global.levelType = 1;\nif (global.currLevel > 8 and global.currLevel < 13) global.levelType = 2;\nif (global.currLevel > 12 and global.currLevel < 16) global.levelType = 3;\nif (global.currLevel == 16) global.levelType = 4;\n\nif (global.currLevel <= 1 or\n global.currLevel == 5 or\n global.currLevel == 9 or\n global.currLevel == 13)\n{\n global.hadDarkLevel = false;\n}\n\n// global.levelType = 3; // debug\n\n// DEBUG MODE //\n/*\nif (global.currLevel == 2) global.levelType = 4;\nif (global.currLevel == 3) global.levelType = 2;\nif (global.currLevel == 4) global.levelType = 3;\nif (global.currLevel == 5) global.levelType = 4;\n*/\n\n// global.levelType = 0;\n\nglobal.startRoomX = 0;\nglobal.startRoomY = 0;\nglobal.endRoomX = 0;\nglobal.endRoomY = 0;\noGame.levelGen = false;\n\n// this is used to determine the path to the exit (generally no bombs required)\nfor (i = 0; i < 4; i += 1)\n{\n for (j = 0; j < 4; j += 1)\n {\n global.roomPath[i,j] = 0;\n }\n}\n\n// side walls\nif (global.levelType == 4)\n k = 54;\nelse if (global.levelType == 2)\n k = 38;\nelse if (global.lake)\n k = 41;\nelse\n k = 33;\nfor (i = 0; i <= 42; i += 1)\n{\n for (j = 0; j <= k; j += 1)\n {\n if (not isLevel())\n {\n i = 999;\n j = 999;\n }\n else if (global.levelType == 2)\n {\n if (i*16 == 0 or\n i*16 == 656 or\n j*16 == 0)\n {\n obj = instance_create(i*16, j*16, oDark);\n obj.invincible = true;\n obj.sprite_index = sDark;\n }\n }\n else if (global.levelType == 4)\n {\n if (i*16 == 0 or\n i*16 == 656 or\n j*16 == 0)\n {\n obj = instance_create(i*16, j*16, oTemple);\n obj.invincible = true;\n if (not global.cityOfGold) obj.sprite_index = sTemple;\n }\n }\n else if (global.lake)\n {\n if (i*16 == 0 or\n i*16 == 656 or\n j*16 == 0 or\n j*16 >= 656)\n {\n obj = instance_create(i*16, j*16, oLush); obj.sprite_index = sLush;\n obj.invincible = true;\n }\n }\n else if (i*16 == 0 or\n i*16 == 656 or\n j*16 == 0 or\n j*16 >= 528)\n {\n if (global.levelType == 0) { obj = instance_create(i*16, j*16, oBrick); obj.sprite_index = sBrick; }\n else if (global.levelType == 1) { obj = instance_create(i*16, j*16, oLush); obj.sprite_index = sLush; }\n else { obj = instance_create(i*16, j*16, oTemple); if (not global.cityOfGold) obj.sprite_index = sTemple; }\n obj.invincible = true;\n }\n }\n}\n\nif (global.levelType == 2)\n{\n for (i = 0; i <= 42; i += 1)\n {\n instance_create(i*16, 40*16, oDark);\n //instance_create(i*16, 35*16, oSpikes);\n }\n}\n\nif (global.levelType == 3)\n{\n background_index = bgTemple;\n}\n\nglobal.temp1 = global.gameStart;\nscrLevelGen();\n\nglobal.cemetary = false;\nif (global.levelType == 1 and rand(1,global.probCemetary) == 1) global.cemetary = true;\n\nwith oRoom\n{\n if (global.levelType == 0) scrRoomGen();\n else if (global.levelType == 1)\n {\n if (global.blackMarket) scrRoomGenMarket();\n else scrRoomGen2();\n }\n else if (global.levelType == 2)\n {\n if (global.yetiLair) scrRoomGenYeti();\n else scrRoomGen3();\n }\n else if (global.levelType == 3) scrRoomGen4();\n else scrRoomGen5();\n}\n\nglobal.darkLevel = false;\n//if (not global.hadDarkLevel and global.currLevel != 0 and global.levelType != 2 and global.currLevel != 16 and rand(1,1) == 1)\nif (not global.hadDarkLevel and not global.noDarkLevel and global.currLevel != 0 and global.currLevel != 1 and global.levelType != 2 and global.currLevel != 16 and rand(1,global.probDarkLevel) == 1)\n{\n global.darkLevel = true;\n global.hadDarkLevel = true;\n //instance_create(oPlayer1.x, oPlayer1.y, oFlare);\n}\n\nif (global.blackMarket) global.darkLevel = false;\n\nglobal.genUdjatEye = false;\nif (not global.madeUdjatEye)\n{\n if (global.currLevel == 2 and rand(1,3) == 1) global.genUdjatEye = true;\n else if (global.currLevel == 3 and rand(1,2) == 1) global.genUdjatEye = true;\n else if (global.currLevel == 4) global.genUdjatEye = true;\n}\n\nglobal.genMarketEntrance = false;\nif (not global.madeMarketEntrance)\n{\n if (global.currLevel == 5 and rand(1,3) == 1) global.genMarketEntrance = true;\n else if (global.currLevel == 6 and rand(1,2) == 1) global.genMarketEntrance = true;\n else if (global.currLevel == 7) global.genMarketEntrance = true;\n}\n\n////////////////////////////\n// ENTITY / TREASURES\n////////////////////////////\nglobal.temp2 = global.gameStart;\nif (not isRoom(\"rTutorial\") and not isRoom(\"rLoadLevel\")) scrEntityGen();\n\nif (instance_exists(oEntrance) and not global.customLevel)\n{\n oPlayer1.x = oEntrance.x+8;\n oPlayer1.y = oEntrance.y+8;\n}\n\nif (global.darkLevel or\n global.blackMarket or\n global.snakePit or\n global.cemetary or\n global.lake or\n global.yetiLair or\n global.alienCraft or\n global.sacrificePit or\n global.cityOfGold)\n{\n if (not isRoom(\"rLoadLevel\"))\n {\n with oPlayer1 { alarm[0] = 10; }\n }\n}\n\nif (global.levelType == 4) scrSetupWalls(864);\nelse if (global.lake) scrSetupWalls(656);\nelse scrSetupWalls(528);\n\n// add background details\nif (global.graphicsHigh)\n{\n repeat(20)\n {\n // bg = instance_create(16*rand(1,42), 16*rand(1,33), oCaveBG);\n if (global.levelType == 1 and rand(1,3) < 3)\n tile_add(bgExtrasLush, 32*rand(0,1), 0, 32, 32, 16*rand(1,42), 16*rand(1,33), 10002);\n else if (global.levelType == 2 and rand(1,3) < 3)\n tile_add(bgExtrasIce, 32*rand(0,1), 0, 32, 32, 16*rand(1,42), 16*rand(1,33), 10002);\n else if (global.levelType == 3 and rand(1,3) < 3)\n tile_add(bgExtrasTemple, 32*rand(0,1), 0, 32, 32, 16*rand(1,42), 16*rand(1,33), 10002);\n else\n tile_add(bgExtras, 32*rand(0,1), 0, 32, 32, 16*rand(1,42), 16*rand(1,33), 10002);\n }\n}\n\noGame.levelGen = true;\n\n// generate angry shopkeeper at exit if murderer or thief\nif ((global.murderer or global.thiefLevel > 0) and isRealLevel())\n{\n with oExit\n {\n if (type == \"Exit\")\n {\n obj = instance_create(x, y, oShopkeeper);\n obj.status = 4;\n }\n }\n // global.thiefLevel -= 1;\n}\n\nwith oTreasure\n{\n if (collision_point(x, y, oSolid, 0, 0))\n {\n obj = instance_place(x, y, oSolid);\n if (obj.invincible) instance_destroy();\n }\n}\n\nwith oWater\n{\n if (sprite_index == sWaterTop or sprite_index == sLavaTop)\n {\n scrCheckWaterTop();\n }\n /*\n obj = instance_place(x-16, y, oWater);\n if (instance_exists(obj))\n {\n if (obj.sprite_index == sWaterTop or obj.sprite_index == sLavaTop)\n {\n if (type == \"Lava\") sprite_index = sLavaTop;\n else sprite_index = sWaterTop;\n }\n }\n obj = instance_place(x+16, y, oWater);\n if (instance_exists(obj))\n {\n if (obj.sprite_index == sWaterTop or obj.sprite_index == sLavaTop)\n {\n if (type == \"Lava\") sprite_index = sLavaTop;\n else sprite_index = sWaterTop;\n }\n }\n */\n}\n\nglobal.temp3 = global.gameStart;\n" }, { "path": "src/test/resources/samples/langs/Genie/Class.gs", "content": "init\n\tnew Demo( \"Demonstration class\" ).run()\n\nclass Demo\n\t_message:string = \"\"\n\n\tconstruct ( message:string = \"Optional argument - no message passed in constructor\" )\n\t\t_message = message\n\n\tdef run()\n\t\tprint( _message )\n\t\t\n" }, { "path": "src/test/resources/samples/langs/Genie/Hello.gs", "content": "init\n\tprint( \"Hello, World!\" )\n" }, { "path": "src/test/resources/samples/langs/Gerber Image/FelinaePurr-B.Cu.gbl", "content": "G04 #@! TF.FileFunction,Copper,L2,Bot,Signal*\n%FSLAX46Y46*%\nG04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*\nG04 Created by KiCad (PCBNEW (2016-07-14 BZR 6980)-product) date Sunday, 23 April 2017 'PMt' 23:49:01*\n%MOMM*%\n%LPD*%\nG01*\nG04 APERTURE LIST*\n%ADD10C,0.150000*%\n%ADD11C,0.175000*%\n%ADD12R,1.727200X2.032000*%\n%ADD13O,1.727200X2.032000*%\n%ADD14R,2.032000X1.727200*%\n%ADD15O,2.032000X1.727200*%\n%ADD16C,1.300000*%\n%ADD17C,2.800000*%\n%ADD18C,0.685800*%\n%ADD19C,0.800000*%\n%ADD20C,0.400000*%\n%ADD21C,0.800000*%\n%ADD22C,0.300000*%\n%ADD23C,0.500000*%\n%ADD24C,0.180000*%\nG04 APERTURE END LIST*\nD10*\nD11*\nX162816666Y-95670833D02*\nX162883333Y-95637500D01*\nX163016666Y-95637500D01*\nX163083333Y-95670833D01*\nX163150000Y-95737500D01*\nX163183333Y-95804166D01*\nX163183333Y-95937500D01*\nX163150000Y-96004166D01*\nX163083333Y-96070833D01*\nX163016666Y-96104166D01*\nX162883333Y-96104166D01*\nX162816666Y-96070833D01*\nX162950000Y-95404166D02*\nX163116666Y-95437500D01*\nX163283333Y-95537500D01*\nX163383333Y-95704166D01*\nX163416666Y-95870833D01*\nX157450000Y-95870833D01*\nX157483333Y-95837500D01*\nX157550000Y-95804166D01*\nX156816666Y-95504166D02*\nX156950000Y-95504166D01*\nX157016666Y-95537500D01*\nX157050000Y-95570833D01*\nX157116666Y-95670833D01*\nX157150000Y-95804166D01*\nX157150000Y-96070833D01*\nX157116666Y-96137500D01*\nX157083333Y-96170833D01*\nX157016666Y-96204166D01*\nX156883333Y-96204166D01*\nX156816666Y-96170833D01*\nX156783333Y-96137500D01*\nX156750000Y-96070833D01*\nX156750000Y-95904166D01*\nX156783333Y-95837500D01*\nX156816666Y-95804166D01*\nX156883333Y-95770833D01*\nX157016666Y-95770833D01*\nX157083333Y-95804166D01*\nX157116666Y-95837500D01*\nX157150000Y-95904166D01*\nX156450000Y-95937500D02*\nX155916666Y-95937500D01*\nX155616666Y-96170833D02*\nX155516666Y-96204166D01*\nX155350000Y-96204166D01*\nX155283333Y-96170833D01*\nX155250000Y-96137500D01*\nX155216666Y-96070833D01*\nX155216666Y-96004166D01*\nX155250000Y-95937500D01*\nX155283333Y-95904166D01*\nX155350000Y-95870833D01*\nX155483333Y-95837500D01*\nX155550000Y-95804166D01*\nX155583333Y-95770833D01*\nX155616666Y-95704166D01*\nX155616666Y-95637500D01*\nX155583333Y-95570833D01*\nX155550000Y-95537500D01*\nX155483333Y-95504166D01*\nX155316666Y-95504166D01*\nX155216666Y-95537500D01*\nX155016666Y-95737500D02*\nX154750000Y-95737500D01*\nX154916666Y-95504166D02*\nX154916666Y-96104166D01*\nX154883333Y-96170833D01*\nX154816666Y-96204166D01*\nX154750000Y-96204166D01*\nX154216666Y-95737500D02*\nX154216666Y-96204166D01*\nX154516666Y-95737500D02*\nX154516666Y-96104166D01*\nX154483333Y-96170833D01*\nX154416666Y-96204166D01*\nX154316666Y-96204166D01*\nX154250000Y-96170833D01*\nX154216666Y-96137500D01*\nX153583333Y-96204166D02*\nX153583333Y-95504166D01*\nX153583333Y-96170833D02*\nX153650000Y-96204166D01*\nX153783333Y-96204166D01*\nX156883333Y-96795833D01*\nX156850000Y-96762500D01*\nX156883333Y-96729166D01*\nX156883333Y-96795833D01*\nX156450000Y-97429166D02*\nX156516666Y-97395833D01*\nX156550000Y-97329166D01*\nX156550000Y-96729166D01*\nX156183333Y-96962500D02*\nX155650000Y-97162500D01*\nX156183333Y-97362500D01*\nX154883333Y-96729166D02*\nX154483333Y-96729166D01*\nX154683333Y-97429166D02*\nX154683333Y-96729166D01*\nX154250000Y-97429166D02*\nX154250000Y-96962500D01*\nX154250000Y-97095833D02*\nX154216666Y-97029166D01*\nX154183333Y-96995833D01*\nX154116666Y-96962500D01*\nX154050000Y-96962500D01*\nX153516666Y-97429166D02*\nX153516666Y-97062500D01*\nX153550000Y-96995833D01*\nX153616666Y-96962500D01*\nX153750000Y-96962500D01*\nX153816666Y-96995833D01*\nX153516666Y-97395833D02*\nX153583333Y-97429166D01*\nX153750000Y-97429166D01*\nX153816666Y-97395833D01*\nX153850000Y-97329166D01*\nX153850000Y-97262500D01*\nX153816666Y-97195833D01*\nX153750000Y-97162500D01*\nX153583333Y-97162500D01*\nX153516666Y-97129166D01*\nX153183333Y-96962500D02*\nX153183333Y-97662500D01*\nX153183333Y-96995833D02*\nX153116666Y-96962500D01*\nX152983333Y-96962500D01*\nX152916666Y-96995833D01*\nX152883333Y-97029166D01*\nX152850000Y-97095833D01*\nX152850000Y-97295833D01*\nX152883333Y-97362500D01*\nX152916666Y-97395833D01*\nX152983333Y-97429166D01*\nX153116666Y-97429166D01*\nX153183333Y-97395833D01*\nX152550000Y-97429166D02*\nX152550000Y-96962500D01*\nX152550000Y-96729166D02*\nX152583333Y-96762500D01*\nX152550000Y-96795833D01*\nX152516666Y-96762500D01*\nX152550000Y-96729166D01*\nX152550000Y-96795833D01*\nX151950000Y-97395833D02*\nX152016666Y-97429166D01*\nX152150000Y-97429166D01*\nX152216666Y-97395833D01*\nX152250000Y-97329166D01*\nX152250000Y-97062500D01*\nX152216666Y-96995833D01*\nX152150000Y-96962500D01*\nX152016666Y-96962500D01*\nX151950000Y-96995833D01*\nX151916666Y-97062500D01*\nX151916666Y-97129166D01*\nX152250000Y-97195833D01*\nX151616666Y-97429166D02*\nX151616666Y-96962500D01*\nX151616666Y-97095833D02*\nX151583333Y-97029166D01*\nX151550000Y-96995833D01*\nX151483333Y-96962500D01*\nX151416666Y-96962500D01*\nD12*\nX175640000Y-81600000D03*\nD13*\nX173100000Y-81600000D03*\nX170560000Y-81600000D03*\nD14*\nX184000000Y-86460000D03*\nD15*\nX184000000Y-89000000D03*\nX184000000Y-91540000D03*\nD16*\nX152900000Y-88350000D03*\nX152900000Y-90350000D03*\nX152900000Y-92850000D03*\nX152900000Y-85850000D03*\nD17*\nX150800000Y-83500000D03*\nX150800000Y-95200000D03*\nD18*\nX173700000Y-89200000D03*\nX162300004Y-87000000D03*\nX159600000Y-82700000D03*\nX161700000Y-94600000D03*\nX176200000Y-96600000D03*\nX179600000Y-91700000D03*\nX158100000Y-83900000D03*\nX168600000Y-89399998D03*\nX167200000Y-85000000D03*\nX159600000Y-81100000D03*\nX163800000Y-81100000D03*\nD19*\nX159300000Y-87400000D03*\nX167300000Y-96600000D03*\nX167300000Y-94500000D03*\nX160900000Y-87400000D03*\nD18*\nX174900000Y-90299999D03*\nX174900000Y-85300000D03*\nD19*\nX166500002Y-90900000D03*\nX177200000Y-90200000D03*\nX168000000Y-87400000D03*\nX173800000Y-87400000D03*\nD18*\nX154500000Y-89792900D03*\nX154500000Y-88907100D03*\nD20*\nX167200000Y-87999998D02*\nX168257101Y-89057099D01*\nX167200000Y-85000000D02*\nX167200000Y-87999998D01*\nX168257101Y-89057099D02*\nX168600000Y-89399998D01*\nD21*\nX163800000Y-81100000D02*\nX159600000Y-81100000D01*\nD22*\nX159300000Y-87965685D02*\nX159300000Y-87400000D01*\nX159300000Y-88600000D02*\nX159300000Y-87965685D01*\nX167300000Y-96600000D02*\nX159300000Y-88600000D01*\nX167300000Y-94500000D02*\nX160900000Y-88100000D01*\nX160900000Y-88100000D02*\nX160900000Y-87400000D01*\nD23*\nX174900000Y-85300000D02*\nX174900000Y-90299999D01*\nD22*\nX177200000Y-90200000D02*\nX175300000Y-92100000D01*\nX175300000Y-92100000D02*\nX167700002Y-92100000D01*\nX167700002Y-92100000D02*\nX166500002Y-90900000D01*\nX173800000Y-87400000D02*\nX168000000Y-87400000D01*\nX154500000Y-88907100D02*\nX154342900Y-88907100D01*\nX154342900Y-88907100D02*\nX152900000Y-90350000D01*\nD24*\nG36*\nX159316814Y-80416329D02*\nX159076741Y-80576741D01*\nX158916329Y-80816814D01*\nX158860000Y-81100000D01*\nX158916329Y-81383186D01*\nX159076741Y-81623259D01*\nX159316814Y-81783671D01*\nX159600000Y-81840000D01*\nX163800000Y-81840000D01*\nX164083186Y-81783671D01*\nX176823872Y-82748661D01*\nX176850260Y-82616000D01*\nX176850260Y-82265373D01*\nX151860838Y-81760869D01*\nX151114549Y-81487287D01*\nX150320374Y-81520123D01*\nX149739162Y-81760869D01*\nX149586248Y-82054317D01*\nX148415000Y-82054317D01*\nX148415000Y-81040874D01*\nX148467041Y-80779242D01*\nX148592092Y-80592091D01*\nX148779241Y-80467042D01*\nX149040874Y-80415000D01*\nX159323495Y-80415000D01*\nX159316814Y-80416329D01*\nX159316814Y-80416329D01*\nG37*\nX159316814Y-80416329D02*\nX159076741Y-80576741D01*\nX158916329Y-80816814D01*\nX158860000Y-81100000D01*\nX158916329Y-81383186D01*\nX159076741Y-81623259D01*\nX159323495Y-80415000D01*\nX159316814Y-80416329D01*\nM02*\n" }, { "path": "src/test/resources/samples/langs/Gerber Image/FelinaePurr-B.Mask.gbs", "content": "G04 #@! TF.FileFunction,Soldermask,Bot*\n%FSLAX46Y46*%\nG04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*\nG04 Created by KiCad (PCBNEW (2016-07-14 BZR 6980)-product) date Sunday, 23 April 2017 'PMt' 23:49:01*\n%MOMM*%\n%LPD*%\nG01*\nG04 APERTURE LIST*\n%ADD10C,0.150000*%\n%ADD11R,1.727200X2.032000*%\n%ADD12O,1.727200X2.032000*%\n%ADD13R,2.032000X1.727200*%\n%ADD14O,2.032000X1.727200*%\n%ADD15C,1.300000*%\n%ADD16C,2.800000*%\n%ADD17C,1.200000*%\nG04 APERTURE END LIST*\nD10*\nD11*\nX175640000Y-81600000D03*\nD12*\nX173100000Y-81600000D03*\nX170560000Y-81600000D03*\nD13*\nX184000000Y-86460000D03*\nD14*\nX184000000Y-89000000D03*\nX184000000Y-91540000D03*\nD15*\nX152900000Y-88350000D03*\nX152900000Y-90350000D03*\nX152900000Y-92850000D03*\nX152900000Y-85850000D03*\nD16*\nX150800000Y-83500000D03*\nX150800000Y-95200000D03*\nD17*\nX150800000Y-87100000D03*\nX150800000Y-91600000D03*\nM02*\n" }, { "path": "src/test/resources/samples/langs/Gerber Image/FelinaePurr-B.SilkS.gbo", "content": "G04 #@! TF.FileFunction,Legend,Bot*\n%FSLAX46Y46*%\nG04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*\nG04 Created by KiCad (PCBNEW (2016-07-14 BZR 6980)-product) date Sunday, 23 April 2017 'PMt' 23:49:01*\n%MOMM*%\n%LPD*%\nG01*\nG04 APERTURE LIST*\n%ADD10C,0.150000*%\n%ADD11C,0.175000*%\n%ADD12C,0.375000*%\n%ADD13C,0.254000*%\n%ADD14R,1.727200X2.032000*%\n%ADD15O,1.727200X2.032000*%\n%ADD16R,2.032000X1.727200*%\n%ADD17O,2.032000X1.727200*%\n%ADD18C,1.300000*%\n%ADD19C,2.800000*%\n%ADD20C,1.200000*%\nG04 APERTURE END LIST*\nD10*\nD11*\nX164233333Y-82450000D02*\nX164133333Y-82483333D01*\nX164100000Y-82516666D01*\nX164066666Y-82583333D01*\nX164066666Y-82683333D01*\nX164100000Y-82750000D01*\nX164133333Y-82783333D01*\nX164200000Y-82816666D01*\nX164466666Y-82816666D01*\nX164466666Y-82116666D01*\nX164233333Y-82116666D01*\nX164166666Y-82150000D01*\nX164133333Y-82183333D01*\nX164100000Y-82250000D01*\nX164100000Y-82316666D01*\nX164133333Y-82383333D01*\nX164166666Y-82416666D01*\nX164233333Y-82450000D01*\nX164466666Y-82450000D01*\nX163666666Y-82816666D02*\nX163733333Y-82783333D01*\nX163766666Y-82750000D01*\nX163800000Y-82683333D01*\nX163800000Y-82483333D01*\nX163766666Y-82416666D01*\nX163733333Y-82383333D01*\nX163666666Y-82350000D01*\nX163566666Y-82350000D01*\nX163500000Y-82383333D01*\nX163466666Y-82416666D01*\nX163433333Y-82483333D01*\nX163433333Y-82683333D01*\nX163466666Y-82750000D01*\nX163500000Y-82783333D01*\nX163566666Y-82816666D01*\nX163666666Y-82816666D01*\nX162833333Y-82816666D02*\nX162833333Y-82450000D01*\nX162866666Y-82383333D01*\nX162933333Y-82350000D01*\nX163066666Y-82350000D01*\nX163133333Y-82383333D01*\nX162833333Y-82783333D02*\nX162900000Y-82816666D01*\nX163066666Y-82816666D01*\nX163133333Y-82783333D01*\nX163166666Y-82716666D01*\nX163166666Y-82650000D01*\nX163133333Y-82583333D01*\nX163066666Y-82550000D01*\nX162900000Y-82550000D01*\nX162833333Y-82516666D01*\nX162500000Y-82816666D02*\nX162500000Y-82350000D01*\nX162500000Y-82483333D02*\nX162466666Y-82416666D01*\nX162433333Y-82383333D01*\nX162366666Y-82350000D01*\nX162300000Y-82350000D01*\nX161766666Y-82816666D02*\nX161766666Y-82116666D01*\nX161766666Y-82783333D02*\nX161833333Y-82816666D01*\nX161966666Y-82816666D01*\nX162033333Y-82783333D01*\nX162066666Y-82750000D01*\nX162100000Y-82683333D01*\nX162100000Y-82483333D01*\nX162066666Y-82416666D01*\nX162033333Y-82383333D01*\nX161966666Y-82350000D01*\nX161833333Y-82350000D01*\nX161766666Y-82383333D01*\nX160933333Y-82350000D02*\nX160433333Y-82350000D01*\nX160733333Y-82050000D02*\nX160933333Y-82950000D01*\nX160500000Y-82650000D02*\nX161000000Y-82650000D01*\nX160700000Y-82950000D02*\nX160500000Y-82050000D01*\nD12*\nX181899107Y-86482142D02*\nX180756250Y-86482142D01*\nX181327678Y-87053571D02*\nX181327678Y-85910714D01*\nX179327678Y-85553571D02*\nX180041964Y-85553571D01*\nX180113392Y-86267857D01*\nX180041964Y-86196428D01*\nX179899107Y-86125000D01*\nX179541964Y-86125000D01*\nX179399107Y-86196428D01*\nX179327678Y-86267857D01*\nX179256250Y-86410714D01*\nX179256250Y-86767857D01*\nX179327678Y-86910714D01*\nX179399107Y-86982142D01*\nX179541964Y-87053571D01*\nX179899107Y-87053571D01*\nX180041964Y-86982142D01*\nX180113392Y-86910714D01*\nX178827678Y-85553571D02*\nX178327678Y-87053571D01*\nX177827678Y-85553571D01*\nX176184821Y-87053571D02*\nX176184821Y-85553571D01*\nX175827678Y-85553571D01*\nX175613392Y-85625000D01*\nX175470535Y-85767857D01*\nX175399107Y-85910714D01*\nX175327678Y-86196428D01*\nX175327678Y-86410714D01*\nX175399107Y-86696428D01*\nX175470535Y-86839285D01*\nX175613392Y-86982142D01*\nX175827678Y-87053571D01*\nX176184821Y-87053571D01*\nX174684821Y-86267857D02*\nX174184821Y-86267857D01*\nX173970535Y-87053571D02*\nX174684821Y-87053571D01*\nX174684821Y-85553571D01*\nX173970535Y-85553571D01*\nX173541964Y-85553571D02*\nX173041964Y-87053571D01*\nX172541964Y-85553571D01*\nX181041964Y-89678571D02*\nX181541964Y-88964285D01*\nX181899107Y-89678571D02*\nX181899107Y-88178571D01*\nX181327678Y-88178571D01*\nX181184821Y-88250000D01*\nX181113392Y-88321428D01*\nX181041964Y-88464285D01*\nX181041964Y-88678571D01*\nX181113392Y-88821428D01*\nX181184821Y-88892857D01*\nX181327678Y-88964285D01*\nX181899107Y-88964285D01*\nX180541964Y-88178571D02*\nX179541964Y-89678571D01*\nX179541964Y-88178571D02*\nX180541964Y-89678571D01*\nX179184821Y-88178571D02*\nX178327678Y-88178571D01*\nX178756250Y-89678571D02*\nX178756250Y-88178571D01*\nX177970535Y-88178571D02*\nX176970535Y-89678571D01*\nX176970535Y-88178571D02*\nX177970535Y-89678571D01*\nX181113392Y-90875000D02*\nX181256250Y-90803571D01*\nX181470535Y-90803571D01*\nX181684821Y-90875000D01*\nX181827678Y-91017857D01*\nX181899107Y-91160714D01*\nX181970535Y-91446428D01*\nX181970535Y-91660714D01*\nX181899107Y-91946428D01*\nX181827678Y-92089285D01*\nX181684821Y-92232142D01*\nX181470535Y-92303571D01*\nX181327678Y-92303571D01*\nX181113392Y-92232142D01*\nX181041964Y-92160714D01*\nX181041964Y-91660714D01*\nX181327678Y-91660714D01*\nX180399107Y-92303571D02*\nX180399107Y-90803571D01*\nX179541964Y-92303571D01*\nX179541964Y-90803571D01*\nX178827678Y-92303571D02*\nX178827678Y-90803571D01*\nX178470535Y-90803571D01*\nX178256250Y-90875000D01*\nX178113392Y-91017857D01*\nX178041964Y-91160714D01*\nX177970535Y-91446428D01*\nX177970535Y-91660714D01*\nX178041964Y-91946428D01*\nX178113392Y-92089285D01*\nX178256250Y-92232142D01*\nX178470535Y-92303571D01*\nX178827678Y-92303571D01*\nD13*\nG36*\nX164873000Y-87373000D02*\nX154627000Y-87373000D01*\nX154627000Y-83127000D01*\nX164873000Y-83127000D01*\nX164873000Y-87373000D01*\nX164873000Y-87373000D01*\nG37*\nX164873000Y-87373000D02*\nX154627000Y-87373000D01*\nX154627000Y-83127000D01*\nX164873000Y-83127000D01*\nX164873000Y-87373000D01*\n%LPC*%\nD14*\nX175640000Y-81600000D03*\nD15*\nX173100000Y-81600000D03*\nX170560000Y-81600000D03*\nD16*\nX184000000Y-86460000D03*\nD17*\nX184000000Y-89000000D03*\nX184000000Y-91540000D03*\nD18*\nX152900000Y-88350000D03*\nX152900000Y-90350000D03*\nX152900000Y-92850000D03*\nX152900000Y-85850000D03*\nD19*\nX150800000Y-83500000D03*\nX150800000Y-95200000D03*\nD20*\nX150800000Y-87100000D03*\nX150800000Y-91600000D03*\nM02*\n" }, { "path": "src/test/resources/samples/langs/Gerber Image/FelinaePurr-F.Cu.gtl", "content": "G04 #@! TF.FileFunction,Copper,L1,Top,Signal*\n%FSLAX46Y46*%\nG04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*\nG04 Created by KiCad (PCBNEW (2016-07-14 BZR 6980)-product) date Sunday, 23 April 2017 'PMt' 23:49:01*\n%MOMM*%\n%LPD*%\nG01*\nG04 APERTURE LIST*\n%ADD10C,0.150000*%\n%ADD11R,0.800000X0.750000*%\n%ADD12R,0.750000X0.800000*%\n%ADD13R,1.198880X1.198880*%\n%ADD14R,1.727200X2.032000*%\n%ADD15O,1.727200X2.032000*%\n%ADD16R,0.500000X0.900000*%\n%ADD17R,0.450000X1.750000*%\n%ADD18R,1.060000X0.650000*%\n%ADD19R,2.032000X1.727200*%\n%ADD20O,2.032000X1.727200*%\n%ADD21R,0.900000X0.500000*%\n%ADD22C,1.300000*%\n%ADD23C,2.800000*%\n%ADD24C,0.685800*%\n%ADD25C,0.800000*%\n%ADD26C,0.500000*%\n%ADD27C,0.300000*%\n%ADD28C,0.400000*%\n%ADD29C,0.800000*%\n%ADD30C,0.250000*%\n%ADD31C,0.180000*%\n%ADD32C,0.160000*%\nG04 APERTURE END LIST*\nD10*\nD11*\nX165350000Y-82700000D03*\nX163850000Y-82700000D03*\nX162350000Y-82700000D03*\nX160850000Y-82700000D03*\nD12*\nX172700000Y-87350000D03*\nX172700000Y-88850000D03*\nD11*\nX181100000Y-90600000D03*\nX179600000Y-90600000D03*\nD13*\nX168800000Y-94500000D03*\nX168800000Y-96598040D03*\nX170800000Y-94500000D03*\nX170800000Y-96598040D03*\nX172800000Y-94500000D03*\nX172800000Y-96598040D03*\nD14*\nX175640000Y-81600000D03*\nD15*\nX173100000Y-81600000D03*\nX170560000Y-81600000D03*\nD16*\nX181100000Y-89000000D03*\nX179600000Y-89000000D03*\nX179600000Y-87300000D03*\nX181100000Y-87300000D03*\nD17*\nX156775000Y-92600000D03*\nX157425000Y-92600000D03*\nX158075000Y-92600000D03*\nX158725000Y-92600000D03*\nX159375000Y-92600000D03*\nX160025000Y-92600000D03*\nX160675000Y-92600000D03*\nX161325000Y-92600000D03*\nX161975000Y-92600000D03*\nX162625000Y-92600000D03*\nX163275000Y-92600000D03*\nX163925000Y-92600000D03*\nX164575000Y-92600000D03*\nX165225000Y-92600000D03*\nX165225000Y-85400000D03*\nX164575000Y-85400000D03*\nX163925000Y-85400000D03*\nX163275000Y-85400000D03*\nX162625000Y-85400000D03*\nX161975000Y-85400000D03*\nX161325000Y-85400000D03*\nX160675000Y-85400000D03*\nX160025000Y-85400000D03*\nX159375000Y-85400000D03*\nX158725000Y-85400000D03*\nX158075000Y-85400000D03*\nX157425000Y-85400000D03*\nX156775000Y-85400000D03*\nD18*\nX175000000Y-87150000D03*\nX175000000Y-88100000D03*\nX175000000Y-89050000D03*\nX177200000Y-89050000D03*\nX177200000Y-87150000D03*\nD19*\nX184000000Y-86460000D03*\nD20*\nX184000000Y-89000000D03*\nX184000000Y-91540000D03*\nD13*\nX174900000Y-94501960D03*\nX174900000Y-96600000D03*\nD11*\nX159000000Y-94600000D03*\nX160500000Y-94600000D03*\nX162350000Y-81100000D03*\nX160850000Y-81100000D03*\nD21*\nX171150000Y-88600000D03*\nX171150000Y-90100000D03*\nX169550000Y-88600000D03*\nX169550000Y-90100000D03*\nX168800000Y-91300000D03*\nX168800000Y-92800000D03*\nX170800000Y-91300000D03*\nX170800000Y-92800000D03*\nX172800000Y-91300000D03*\nX172800000Y-92800000D03*\nX174900000Y-91300000D03*\nX174900000Y-92800000D03*\nX176600000Y-91300000D03*\nX176600000Y-92800000D03*\nD22*\nX152900000Y-88350000D03*\nX152900000Y-90350000D03*\nX152900000Y-92850000D03*\nX152900000Y-85850000D03*\nD23*\nX150800000Y-83500000D03*\nX150800000Y-95200000D03*\nD24*\nX173700000Y-89200000D03*\nX162300004Y-87000000D03*\nX159600000Y-82700000D03*\nX161700000Y-94600000D03*\nX176200000Y-96600000D03*\nX179600000Y-91700000D03*\nX158100000Y-83900000D03*\nX168600000Y-89399998D03*\nX167200000Y-85000000D03*\nX159600000Y-81100000D03*\nX163800000Y-81100000D03*\nD25*\nX159300000Y-87400000D03*\nX167300000Y-96600000D03*\nX167300000Y-94500000D03*\nX160900000Y-87400000D03*\nD24*\nX174900000Y-90299999D03*\nX174900000Y-85300000D03*\nD25*\nX166500002Y-90900000D03*\nX177200000Y-90200000D03*\nX168000000Y-87400000D03*\nX173800000Y-87400000D03*\nD24*\nX154500000Y-89792900D03*\nX154500000Y-88907100D03*\nD26*\nX165325000Y-82700000D02*\nX165325000Y-83475000D01*\nX165325000Y-83475000D02*\nX164900000Y-83900000D01*\nX164900000Y-83900000D02*\nX164250677Y-83900000D01*\nX163947598Y-84375049D02*\nX163927410Y-84395237D01*\nX164250677Y-83900000D02*\nX163947598Y-84203079D01*\nX163947598Y-84203079D02*\nX163947598Y-84375049D01*\nX163927410Y-84395237D02*\nX163927410Y-85400000D01*\nD27*\nX165325000Y-82700000D02*\nX165325000Y-82826415D01*\nD26*\nX165350000Y-82700000D02*\nX165325000Y-82700000D01*\nX172700000Y-88850000D02*\nX173350000Y-88850000D01*\nX173350000Y-88850000D02*\nX173700000Y-89200000D01*\nX175000000Y-89050000D02*\nX173850000Y-89050000D01*\nX173850000Y-89050000D02*\nX173700000Y-89200000D01*\nX175000000Y-88100000D02*\nX175000000Y-89050000D01*\nX163850000Y-82700000D02*\nX163850000Y-83378030D01*\nX163850000Y-83378030D02*\nX163295188Y-83932842D01*\nX163275000Y-84125000D02*\nX163295188Y-84104812D01*\nX163295188Y-84104812D02*\nX163295188Y-83932842D01*\nX163275000Y-85400000D02*\nX163275000Y-84125000D01*\nX160850000Y-82700000D02*\nX160850000Y-83575000D01*\nX160850000Y-83575000D02*\nX160875000Y-83600000D01*\nX160875000Y-83600000D02*\nX160900000Y-83600000D01*\nX161325000Y-85400000D02*\nX161325000Y-84025000D01*\nX161325000Y-84025000D02*\nX160900000Y-83600000D01*\nX160675000Y-92600000D02*\nX160675000Y-93800000D01*\nX160500000Y-94600000D02*\nX160500000Y-93975000D01*\nX160500000Y-93975000D02*\nX160675000Y-93800000D01*\nX163275000Y-85400000D02*\nX163275000Y-86509937D01*\nX163275000Y-86509937D02*\nX162784937Y-87000000D01*\nX162784937Y-87000000D02*\nX162300004Y-87000000D01*\nX161325000Y-86509929D02*\nX161815071Y-87000000D01*\nX161325000Y-85400000D02*\nX161325000Y-86509929D01*\nX161815071Y-87000000D02*\nX162300004Y-87000000D01*\nX159700000Y-82700000D02*\nX159600000Y-82700000D01*\nX160850000Y-82700000D02*\nX159700000Y-82700000D01*\nX160850000Y-82700000D02*\nX160850000Y-81100000D01*\nX160500000Y-94600000D02*\nX161700000Y-94600000D01*\nX158075000Y-85400000D02*\nX158075000Y-83925000D01*\nX158075000Y-83925000D02*\nX158100000Y-83900000D01*\nX158075000Y-85400000D02*\nX158725000Y-85400000D01*\nX179600000Y-90600000D02*\nX179600000Y-91700000D01*\nX174900000Y-96600000D02*\nX176200000Y-96600000D01*\nX172800000Y-96598040D02*\nX174898040Y-96598040D01*\nX174898040Y-96598040D02*\nX174900000Y-96600000D01*\nX169250000Y-85000000D02*\nX170560000Y-83690000D01*\nX170560000Y-83690000D02*\nX170560000Y-81600000D01*\nX167200000Y-85000000D02*\nX169250000Y-85000000D01*\nX168600000Y-90500000D02*\nX168600000Y-89399998D01*\nX168800000Y-91300000D02*\nX168800000Y-90700000D01*\nX168800000Y-90700000D02*\nX168600000Y-90500000D01*\nD28*\nX170500000Y-88600000D02*\nX171150000Y-88600000D01*\nD26*\nX169550000Y-88600000D02*\nX170500000Y-88600000D01*\nX168600000Y-89399998D02*\nX168750002Y-89399998D01*\nX168750002Y-89399998D02*\nX169550000Y-88600000D01*\nX162350000Y-82700000D02*\nX162350000Y-83575000D01*\nX162350000Y-83575000D02*\nX161977410Y-83947590D01*\nX161977410Y-83947590D02*\nX161977410Y-85400000D01*\nD29*\nX162350000Y-81100000D02*\nX163800000Y-81100000D01*\nD30*\nX174222599Y-89677401D02*\nX175726921Y-89677401D01*\nX175726921Y-89677401D02*\nX176250000Y-89154322D01*\nX176250000Y-89154322D02*\nX176250000Y-88675000D01*\nX176250000Y-88675000D02*\nX177200000Y-87725000D01*\nX177200000Y-87725000D02*\nX177200000Y-87150000D01*\nD26*\nX177200000Y-87150000D02*\nX179450000Y-87150000D01*\nX179450000Y-87150000D02*\nX179600000Y-87300000D01*\nX159000000Y-94600000D02*\nX159000000Y-94000000D01*\nX159000000Y-94000000D02*\nX158725000Y-93725000D01*\nX158725000Y-93725000D02*\nX158725000Y-92600000D01*\nD28*\nX174222599Y-89677401D02*\nX173800000Y-90100000D01*\nX159600000Y-96600000D02*\nX159000000Y-96000000D01*\nD27*\nX181100000Y-87300000D02*\nX181100000Y-89000000D01*\nX181100000Y-90600000D02*\nX181100000Y-89000000D01*\nX181100000Y-89000000D02*\nX184000000Y-89000000D01*\nD26*\nX168800000Y-94500000D02*\nX168800000Y-92800000D01*\nX168800000Y-96598040D02*\nX167301960Y-96598040D01*\nX167301960Y-96598040D02*\nX167300000Y-96600000D01*\nD27*\nX159300000Y-87400000D02*\nX160025000Y-86675000D01*\nX160025000Y-86675000D02*\nX160025000Y-85400000D01*\nD26*\nX170800000Y-92800000D02*\nX170800000Y-94500000D01*\nX167300000Y-94500000D02*\nX167300000Y-95065685D01*\nX167300000Y-95065685D02*\nX167734314Y-95499999D01*\nX167734314Y-95499999D02*\nX167876797Y-95499999D01*\nX167876797Y-95499999D02*\nX167878639Y-95501841D01*\nX167878639Y-95501841D02*\nX170603241Y-95501841D01*\nX170603241Y-95501841D02*\nX170800000Y-95698600D01*\nX170800000Y-95698600D02*\nX170800000Y-96598040D01*\nD27*\nX160675000Y-85400000D02*\nX160675000Y-86400000D01*\nX160900000Y-86900000D02*\nX160675000Y-86675000D01*\nX160675000Y-86675000D02*\nX160675000Y-86400000D01*\nX160900000Y-87400000D02*\nX160900000Y-86900000D01*\nD26*\nX172800000Y-92800000D02*\nX172800000Y-94500000D01*\nD27*\nX175640000Y-81600000D02*\nX175640000Y-84560000D01*\nX175640000Y-84560000D02*\nX174900000Y-85300000D01*\nD26*\nX176600000Y-91300000D02*\nX175599999Y-90299999D01*\nX175599999Y-90299999D02*\nX174900000Y-90299999D01*\nD29*\nX175640000Y-81600000D02*\nX180803600Y-81600000D01*\nX180803600Y-81600000D02*\nX184000000Y-84796400D01*\nX184000000Y-84796400D02*\nX184000000Y-86460000D01*\nD26*\nX174900000Y-92800000D02*\nX174900000Y-94501960D01*\nD27*\nX165934317Y-90900000D02*\nX166500002Y-90900000D01*\nX159900000Y-90900000D02*\nX165934317Y-90900000D01*\nX159375000Y-91425000D02*\nX159900000Y-90900000D01*\nX159375000Y-92600000D02*\nX159375000Y-91425000D01*\nX177200000Y-90200000D02*\nX177200000Y-89050000D01*\nX177200000Y-89050000D02*\nX179550000Y-89050000D01*\nX179550000Y-89050000D02*\nX179600000Y-89000000D01*\nX166000000Y-89400000D02*\nX167600001Y-87799999D01*\nX158400000Y-89400000D02*\nX166000000Y-89400000D01*\nX167600001Y-87799999D02*\nX168000000Y-87400000D01*\nX156775000Y-91025000D02*\nX158400000Y-89400000D01*\nX175000000Y-87150000D02*\nX174050000Y-87150000D01*\nX174050000Y-87150000D02*\nX173800000Y-87400000D01*\nX156775000Y-91025000D02*\nX156800000Y-91000000D01*\nX156775000Y-92600000D02*\nX156775000Y-91025000D01*\nD26*\nX169550000Y-90100000D02*\nX169600000Y-90100000D01*\nX169600000Y-90100000D02*\nX170800000Y-91300000D01*\nX174900000Y-91300000D02*\nX175100000Y-91300000D01*\nX175100000Y-91300000D02*\nX176600000Y-92800000D01*\nX171150000Y-90100000D02*\nX171600000Y-90100000D01*\nX171600000Y-90100000D02*\nX172800000Y-91300000D01*\nD27*\nX154500000Y-89792900D02*\nX154342900Y-89792900D01*\nX154342900Y-89792900D02*\nX152900000Y-88350000D01*\nX157560197Y-89599999D02*\nX154692901Y-89599999D01*\nX154692901Y-89599999D02*\nX154500000Y-89792900D01*\nX165225000Y-86712500D02*\nX165150000Y-86787500D01*\nX165225000Y-85400000D02*\nX165225000Y-86712500D01*\nX165150000Y-86787500D02*\nX165150000Y-87703552D01*\nX165150000Y-87703552D02*\nX163905962Y-88947590D01*\nX163905962Y-88947590D02*\nX158212605Y-88947591D01*\nX158212605Y-88947591D02*\nX157560197Y-89599999D01*\nX157353101Y-89100001D02*\nX154692901Y-89100001D01*\nX154692901Y-89100001D02*\nX154500000Y-88907100D01*\nX164650000Y-86787500D02*\nX164650000Y-87496448D01*\nX158005501Y-88447601D02*\nX157353101Y-89100001D01*\nX164575000Y-85400000D02*\nX164575000Y-86712500D01*\nX164575000Y-86712500D02*\nX164650000Y-86787500D01*\nX164650000Y-87496448D02*\nX163698847Y-88447601D01*\nX163698847Y-88447601D02*\nX158005501Y-88447601D01*\nD31*\nG36*\nX161443040Y-80386260D02*\nX161404451Y-80479422D01*\nX161363152Y-80451826D01*\nX161250000Y-80429319D01*\nX160450000Y-80429319D01*\nX160336848Y-80451826D01*\nX160240922Y-80515922D01*\nX160176826Y-80611848D01*\nX160154319Y-80725000D01*\nX160154319Y-81475000D01*\nX160176826Y-81588152D01*\nX160240922Y-81684078D01*\nX160310000Y-81730235D01*\nX160310000Y-82069765D01*\nX160240922Y-82115922D01*\nX160211470Y-82160000D01*\nX159949905Y-82160000D01*\nX159726444Y-82067210D01*\nX159474661Y-82066991D01*\nX159241959Y-82163141D01*\nX159063767Y-82341023D01*\nX158967210Y-82573556D01*\nX158966991Y-82825339D01*\nX159063141Y-83058041D01*\nX159241023Y-83236233D01*\nX159473556Y-83332790D01*\nX159725339Y-83333009D01*\nX159950439Y-83240000D01*\nX160211470Y-83240000D01*\nX160240922Y-83284078D01*\nX160310000Y-83330235D01*\nX160310000Y-83575000D01*\nX160351105Y-83781649D01*\nX160468162Y-83956838D01*\nX160493160Y-83981835D01*\nX160493162Y-83981838D01*\nX160568503Y-84032179D01*\nX160765644Y-84229319D01*\nX160450000Y-84229319D01*\nX160350000Y-84249210D01*\nX160250000Y-84229319D01*\nX159800000Y-84229319D01*\nX159700000Y-84249210D01*\nX159600000Y-84229319D01*\nX159150000Y-84229319D01*\nX159050000Y-84249210D01*\nX158950000Y-84229319D01*\nX158648548Y-84229319D01*\nX158732790Y-84026444D01*\nX172906000Y-81774000D01*\nX172906000Y-81426000D01*\nX172926000Y-81426000D01*\nX172926000Y-81406000D01*\nX173274000Y-81406000D01*\nX173274000Y-81426000D01*\nX173274000Y-81426000D01*\nG37*\nX173274000Y-81426000D02*\nX180070000Y-89624732D01*\nX180070000Y-89953439D01*\nX180000000Y-89939515D01*\nX179200000Y-89939515D01*\nX179090750Y-89961246D01*\nX178998132Y-90023132D01*\nX178936246Y-90115750D01*\nX172926000Y-81774000D01*\nX172906000Y-81774000D01*\nX172906000Y-81426000D01*\nX172926000Y-81426000D01*\nX172926000Y-81406000D01*\nX173274000Y-81406000D01*\nX173274000Y-81426000D01*\nD31*\nG36*\nX181810000Y-87900000D02*\nX181816851Y-87934442D01*\nX181836360Y-87963640D01*\nX181865558Y-87983149D01*\nX181900000Y-87990000D01*\nX185210000Y-87990000D01*\nX185210000Y-89910000D01*\nX182100000Y-89910000D01*\nX182065558Y-89916851D01*\nX182036360Y-89936360D01*\nX182016851Y-89965558D01*\nX182010000Y-90000000D01*\nX182010000Y-91310000D01*\nX180490000Y-91310000D01*\nX180490000Y-86190000D01*\nX181810000Y-86190000D01*\nX181810000Y-87900000D01*\nX181810000Y-87900000D01*\nG37*\nX181810000Y-87900000D02*\nX181816851Y-87934442D01*\nX181836360Y-87963640D01*\nX181865558Y-87983149D01*\nX181900000Y-87990000D01*\nX185210000Y-87990000D01*\nX185210000Y-89910000D01*\nX182100000Y-89910000D01*\nX182065558Y-89916851D01*\nX182036360Y-89936360D01*\nX182016851Y-89965558D01*\nX182010000Y-90000000D01*\nX182010000Y-91310000D01*\nX180490000Y-91310000D01*\nX180490000Y-86190000D01*\nX181810000Y-86190000D01*\nX181810000Y-87900000D01*\nM02*\n" }, { "path": "src/test/resources/samples/langs/Gerber Image/FelinaePurr-F.Mask.gts", "content": "G04 #@! TF.FileFunction,Soldermask,Top*\n%FSLAX46Y46*%\nG04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*\nG04 Created by KiCad (PCBNEW (2016-07-14 BZR 6980)-product) date Sunday, 23 April 2017 'PMt' 23:49:01*\n%MOMM*%\n%LPD*%\nG01*\nG04 APERTURE LIST*\n%ADD10C,0.150000*%\n%ADD11R,0.800000X0.750000*%\n%ADD12R,0.750000X0.800000*%\n%ADD13R,1.198880X1.198880*%\n%ADD14R,1.727200X2.032000*%\n%ADD15O,1.727200X2.032000*%\n%ADD16R,0.500000X0.900000*%\n%ADD17R,0.450000X1.750000*%\n%ADD18R,1.060000X0.650000*%\n%ADD19R,2.032000X1.727200*%\n%ADD20O,2.032000X1.727200*%\n%ADD21R,0.900000X0.500000*%\n%ADD22C,1.300000*%\n%ADD23C,2.800000*%\n%ADD24C,1.200000*%\nG04 APERTURE END LIST*\nD10*\nD11*\nX165350000Y-82700000D03*\nX163850000Y-82700000D03*\nX162350000Y-82700000D03*\nX160850000Y-82700000D03*\nD12*\nX172700000Y-87350000D03*\nX172700000Y-88850000D03*\nD11*\nX181100000Y-90600000D03*\nX179600000Y-90600000D03*\nD13*\nX168800000Y-94500000D03*\nX168800000Y-96598040D03*\nX170800000Y-94500000D03*\nX170800000Y-96598040D03*\nX172800000Y-94500000D03*\nX172800000Y-96598040D03*\nD14*\nX175640000Y-81600000D03*\nD15*\nX173100000Y-81600000D03*\nX170560000Y-81600000D03*\nD16*\nX181100000Y-89000000D03*\nX179600000Y-89000000D03*\nX179600000Y-87300000D03*\nX181100000Y-87300000D03*\nD17*\nX156775000Y-92600000D03*\nX157425000Y-92600000D03*\nX158075000Y-92600000D03*\nX158725000Y-92600000D03*\nX159375000Y-92600000D03*\nX160025000Y-92600000D03*\nX160675000Y-92600000D03*\nX161325000Y-92600000D03*\nX161975000Y-92600000D03*\nX162625000Y-92600000D03*\nX163275000Y-92600000D03*\nX163925000Y-92600000D03*\nX164575000Y-92600000D03*\nX165225000Y-92600000D03*\nX165225000Y-85400000D03*\nX164575000Y-85400000D03*\nX163925000Y-85400000D03*\nX163275000Y-85400000D03*\nX162625000Y-85400000D03*\nX161975000Y-85400000D03*\nX161325000Y-85400000D03*\nX160675000Y-85400000D03*\nX160025000Y-85400000D03*\nX159375000Y-85400000D03*\nX158725000Y-85400000D03*\nX158075000Y-85400000D03*\nX157425000Y-85400000D03*\nX156775000Y-85400000D03*\nD18*\nX175000000Y-87150000D03*\nX175000000Y-88100000D03*\nX175000000Y-89050000D03*\nX177200000Y-89050000D03*\nX177200000Y-87150000D03*\nD19*\nX184000000Y-86460000D03*\nD20*\nX184000000Y-89000000D03*\nX184000000Y-91540000D03*\nD13*\nX174900000Y-94501960D03*\nX174900000Y-96600000D03*\nD11*\nX159000000Y-94600000D03*\nX160500000Y-94600000D03*\nX162350000Y-81100000D03*\nX160850000Y-81100000D03*\nD21*\nX171150000Y-88600000D03*\nX171150000Y-90100000D03*\nX169550000Y-88600000D03*\nX169550000Y-90100000D03*\nX168800000Y-91300000D03*\nX168800000Y-92800000D03*\nX170800000Y-91300000D03*\nX170800000Y-92800000D03*\nX172800000Y-91300000D03*\nX172800000Y-92800000D03*\nX174900000Y-91300000D03*\nX174900000Y-92800000D03*\nX176600000Y-91300000D03*\nX176600000Y-92800000D03*\nD22*\nX152900000Y-88350000D03*\nX152900000Y-90350000D03*\nX152900000Y-92850000D03*\nX152900000Y-85850000D03*\nD23*\nX150800000Y-83500000D03*\nX150800000Y-95200000D03*\nD24*\nX150800000Y-87100000D03*\nX150800000Y-91600000D03*\nM02*\n" }, { "path": "src/test/resources/samples/langs/Gerber Image/FelinaePurr-F.Paste.gtp", "content": "G04 #@! TF.FileFunction,Paste,Top*\n%FSLAX46Y46*%\nG04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*\nG04 Created by KiCad (PCBNEW (2016-07-14 BZR 6980)-product) date Sunday, 23 April 2017 'PMt' 23:49:01*\n%MOMM*%\n%LPD*%\nG01*\nG04 APERTURE LIST*\n%ADD10C,0.150000*%\nG04 APERTURE END LIST*\nD10*\nM02*\n" }, { "path": "src/test/resources/samples/langs/Gerber Image/FelinaePurr-F.SilkS.gto", "content": "G04 #@! TF.FileFunction,Legend,Top*\n%FSLAX46Y46*%\nG04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*\nG04 Created by KiCad (PCBNEW (2016-07-14 BZR 6980)-product) date Sunday, 23 April 2017 'PMt' 23:49:01*\n%MOMM*%\n%LPD*%\nG01*\nG04 APERTURE LIST*\n%ADD10C,0.150000*%\n%ADD11C,0.200000*%\n%ADD12C,0.500000*%\n%ADD13C,0.175000*%\n%ADD14C,0.120000*%\n%ADD15R,0.800000X0.750000*%\n%ADD16R,0.750000X0.800000*%\n%ADD17R,1.198880X1.198880*%\n%ADD18R,1.727200X2.032000*%\n%ADD19O,1.727200X2.032000*%\n%ADD20R,0.500000X0.900000*%\n%ADD21R,0.450000X1.750000*%\n%ADD22R,1.060000X0.650000*%\n%ADD23R,2.032000X1.727200*%\n%ADD24O,2.032000X1.727200*%\n%ADD25R,0.900000X0.500000*%\n%ADD26C,1.300000*%\n%ADD27C,2.800000*%\n%ADD28C,1.200000*%\nG04 APERTURE END LIST*\nD10*\nD11*\nX181000000Y-96250000D02*\nX181000000Y-96750000D01*\nX180750000Y-96500000D02*\nX181250000Y-96500000D01*\nX180750000Y-97250000D02*\nX181250000Y-97250000D01*\nD12*\nX156000000Y-92800000D02*\nG75*\nG03X156000000Y-92800000I-200000J0D01*\nG01*\nD13*\nX174800000Y-84116666D02*\nX174800000Y-83416666D01*\nX174966666Y-83416666D01*\nX175066666Y-83450000D01*\nX175133333Y-83516666D01*\nX175166666Y-83583333D01*\nX175200000Y-83716666D01*\nX175200000Y-83816666D01*\nX175166666Y-83950000D01*\nX175133333Y-84016666D01*\nX175066666Y-84083333D01*\nX174966666Y-84116666D01*\nX174800000Y-84116666D01*\nX175500000Y-83750000D02*\nX175733333Y-83750000D01*\nX157483333Y-97316666D02*\nX161783333Y-96816666D01*\nX162450000Y-97116666D02*\nX162783333Y-97116666D01*\nX162383333Y-97316666D02*\nX162616666Y-96616666D01*\nX162850000Y-97316666D01*\nD10*\nX164950000Y-83300000D02*\nX164250000Y-83300000D01*\nX164250000Y-82100000D02*\nX164950000Y-82100000D01*\nX161950000Y-83300000D02*\nX161250000Y-83300000D01*\nX161250000Y-82100000D02*\nX161950000Y-82100000D01*\nX173300000Y-87750000D02*\nX173300000Y-88450000D01*\nX172100000Y-88450000D02*\nX172100000Y-87750000D01*\nX180700000Y-91200000D02*\nX180000000Y-91200000D01*\nX180000000Y-90000000D02*\nX180700000Y-90000000D01*\nX169550000Y-97149020D02*\nX169550000Y-94449020D01*\nX168050000Y-97149020D02*\nX168050000Y-94449020D01*\nX168950000Y-95649020D02*\nX168700000Y-95649020D01*\nX168700000Y-95649020D02*\nX168850000Y-95799020D01*\nX168450000Y-95899020D02*\nX169150000Y-95899020D01*\nX168800000Y-95549020D02*\nX168800000Y-95199020D01*\nX168800000Y-95899020D02*\nX168450000Y-95549020D01*\nX168450000Y-95549020D02*\nX169150000Y-95549020D01*\nX169150000Y-95549020D02*\nX168800000Y-95899020D01*\nX171550000Y-97149020D02*\nX171550000Y-94449020D01*\nX170050000Y-97149020D02*\nX170050000Y-94449020D01*\nX170950000Y-95649020D02*\nX170700000Y-95649020D01*\nX170700000Y-95649020D02*\nX170850000Y-95799020D01*\nX170450000Y-95899020D02*\nX171150000Y-95899020D01*\nX170800000Y-95549020D02*\nX170800000Y-95199020D01*\nX175900000Y-86400000D02*\nG75*\nG03X175900000Y-86400000I-100000J0D01*\nG01*\nX176350000Y-86650000D02*\nX175850000Y-86650000D01*\nX176350000Y-89550000D02*\nX176350000Y-86650000D01*\nX175850000Y-89550000D02*\nX176350000Y-89550000D01*\nX175850000Y-86650000D02*\nX175850000Y-89550000D01*\nX182730000Y-87730000D02*\nX182730000Y-92810000D01*\nX182730000Y-92810000D02*\nX185270000Y-92810000D01*\nX185270000Y-92810000D02*\nX185270000Y-87730000D01*\nX185550000Y-84910000D02*\nX185550000Y-86460000D01*\nX185270000Y-87730000D02*\nX182730000Y-87730000D01*\nX175580000Y-92550000D01*\nX175920000Y-92550000D02*\nX175920000Y-91550000D01*\nX177280000Y-91550000D02*\nX177280000Y-92550000D01*\nD10*\nX148000000Y-95350000D02*\nX148000000Y-83350000D01*\nX134100000Y-83350000D02*\nX152800000Y-83350000D01*\nX134100000Y-95350000D02*\nX134100000Y-83350000D01*\nX152900000Y-95350000D02*\nX141352380Y-88850000D02*\nX140352380Y-88850000D01*\nX140495238Y-88945238D01*\nX140590476Y-89040476D01*\nX140638095Y-89135714D01*\n%LPC*%\nD15*\nX165350000Y-82700000D03*\nX163850000Y-82700000D03*\nX162350000Y-82700000D03*\nX160850000Y-82700000D03*\nD16*\nX172700000Y-87350000D03*\nX172700000Y-88850000D03*\nD15*\nX181100000Y-90600000D03*\nX179600000Y-90600000D03*\nD17*\nX168800000Y-94500000D03*\nX168800000Y-96598040D03*\nX170800000Y-94500000D03*\nX170800000Y-96598040D03*\nX172800000Y-94500000D03*\nX172800000Y-96598040D03*\nD18*\nX175640000Y-81600000D03*\nD19*\nX173100000Y-81600000D03*\nX170560000Y-81600000D03*\nD20*\nX181100000Y-89000000D03*\nX179600000Y-89000000D03*\nX179600000Y-87300000D03*\nX181100000Y-87300000D03*\nD21*\nX156775000Y-92600000D03*\nX157425000Y-92600000D03*\nX158075000Y-92600000D03*\nX158725000Y-92600000D03*\nX159375000Y-92600000D03*\nX160025000Y-92600000D03*\nX160675000Y-92600000D03*\nX161325000Y-92600000D03*\nX161975000Y-92600000D03*\nX162625000Y-92600000D03*\nX163275000Y-92600000D03*\nX163925000Y-92600000D03*\nX164575000Y-92600000D03*\nX165225000Y-92600000D03*\nX165225000Y-85400000D03*\nX164575000Y-85400000D03*\nX163925000Y-85400000D03*\nX163275000Y-85400000D03*\nX162625000Y-85400000D03*\nX161975000Y-85400000D03*\nX161325000Y-85400000D03*\nX160675000Y-85400000D03*\nX160025000Y-85400000D03*\nX159375000Y-85400000D03*\nX158725000Y-85400000D03*\nX158075000Y-85400000D03*\nX157425000Y-85400000D03*\nX156775000Y-85400000D03*\nD22*\nX175000000Y-87150000D03*\nX175000000Y-88100000D03*\nX175000000Y-89050000D03*\nX177200000Y-89050000D03*\nX177200000Y-87150000D03*\nD23*\nX184000000Y-86460000D03*\nD24*\nX184000000Y-89000000D03*\nX184000000Y-91540000D03*\nD17*\nX174900000Y-94501960D03*\nX174900000Y-96600000D03*\nD15*\nX159000000Y-94600000D03*\nX160500000Y-94600000D03*\nX162350000Y-81100000D03*\nX160850000Y-81100000D03*\nD25*\nX171150000Y-88600000D03*\nX171150000Y-90100000D03*\nX169550000Y-88600000D03*\nX169550000Y-90100000D03*\nX168800000Y-91300000D03*\nX168800000Y-92800000D03*\nX170800000Y-91300000D03*\nX170800000Y-92800000D03*\nX172800000Y-91300000D03*\nX172800000Y-92800000D03*\nX174900000Y-91300000D03*\nX174900000Y-92800000D03*\nX176600000Y-91300000D03*\nX176600000Y-92800000D03*\nD26*\nX152900000Y-88350000D03*\nX152900000Y-90350000D03*\nX152900000Y-92850000D03*\nX152900000Y-85850000D03*\nD27*\nX150800000Y-83500000D03*\nX150800000Y-95200000D03*\nD28*\nX150800000Y-87100000D03*\nX150800000Y-91600000D03*\nM02*\n" }, { "path": "src/test/resources/samples/langs/Gerber Image/GOLMain_RevA-B.Paste.gbp", "content": "G04 #@! TF.FileFunction,Paste,Bot*\n%FSLAX46Y46*%\nG04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*\nG04 Created by KiCad (PCBNEW 4.0.4-stable) date 03/23/17 03:26:40*\n%MOMM*%\n%LPD*%\nG01*\nG04 APERTURE LIST*\n%ADD10C,0.100000*%\n%ADD11R,1.100000X2.400000*%\n%ADD12O,1.100000X2.400000*%\n%ADD13R,2.000000X2.032000*%\n%ADD14R,1.727200X2.032000*%\nG04 APERTURE END LIST*\nD10*\nD11*\nX153000000Y-135000000D03*\nD12*\nX151000000Y-135000000D03*\nX149000000Y-135000000D03*\nX147000000Y-135000000D03*\nX145000000Y-135000000D03*\nX143000000Y-135000000D03*\nX141000000Y-135000000D03*\nX139000000Y-135000000D03*\nX139000000Y-119000000D03*\nX141000000Y-119000000D03*\nX143000000Y-119000000D03*\nX145000000Y-119000000D03*\nX147000000Y-119000000D03*\nX149000000Y-119000000D03*\nX151000000Y-119000000D03*\nX153000000Y-119000000D03*\nD13*\nX94500000Y-125500000D03*\nX97040000Y-125500000D03*\nX99580000Y-125500000D03*\nX94500000Y-128500000D03*\nX97040000Y-128500000D03*\nX99580000Y-128500000D03*\nX94500000Y-131500000D03*\nX97040000Y-131500000D03*\nX99580000Y-131500000D03*\nX94500000Y-134500000D03*\nX97040000Y-134500000D03*\nX99580000Y-134500000D03*\nX97040000Y-137500000D03*\nX99580000Y-137500000D03*\nD14*\nX94500000Y-140500000D03*\nD13*\nX97040000Y-140500000D03*\nX99580000Y-140500000D03*\nX94500000Y-143500000D03*\nX97040000Y-143500000D03*\nX99580000Y-143500000D03*\nX94500000Y-146500000D03*\nX97040000Y-146500000D03*\nX99580000Y-146500000D03*\nM02*\n" }, { "path": "src/test/resources/samples/langs/Gerber Image/nonaprs_contour.gko", "content": "G04 MADE WITH FRITZING*\nG04 WWW.FRITZING.ORG*\nG04 DOUBLE SIDED*\nG04 HOLES PLATED*\nG04 CONTOUR ON CENTER OF CONTOUR VECTOR*\n%ASAXBY*%\n%FSLAX23Y23*%\n%MOIN*%\n%OFA0B0*%\n%SFA1.0B1.0*%\n%ADD10R,1.267940X2.408830*%\n%ADD11C,0.008000*%\n%ADD10C,0.008*%\n%LNCONTOUR*%\nG90*\nG70*\nG54D10*\nG54D11*\nX4Y2405D02*\nX1264Y2405D01*\nX1264Y4D01*\nX4Y4D01*\nX4Y2405D01*\nD02*\nG04 End of contour*\nM02*" }, { "path": "src/test/resources/samples/langs/Gerber Image/simonShield-B.Cu.gbr", "content": "G04 #@! TF.FileFunction,Copper,L2,Bot,Signal*\n%FSLAX46Y46*%\nG04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*\nG04 Created by KiCad (PCBNEW 4.0.6-e0-6349~53~ubuntu16.04.1) date Sat Jul 1 03:26:18 2017*\n%MOMM*%\n%LPD*%\nG01*\nG04 APERTURE LIST*\n%ADD10C,0.100000*%\n%ADD11C,0.150000*%\n%ADD12C,0.300000*%\n%ADD13C,1.600000*%\n%ADD14O,1.600000X1.600000*%\n%ADD15R,2.000000X1.524000*%\n%ADD16O,2.000000X1.524000*%\n%ADD17R,1.300000X1.300000*%\n%ADD18C,1.300000*%\n%ADD19C,1.998980*%\n%ADD20R,1.900000X2.000000*%\n%ADD21C,1.900000*%\n%ADD22R,1.727200X1.727200*%\n%ADD23O,1.727200X1.727200*%\n%ADD24C,1.000760*%\n%ADD25C,1.397000*%\n%ADD26C,1.600200*%\n%ADD27C,1.270000*%\n%ADD28C,1.500000*%\n%ADD29C,1.200000*%\n%ADD30C,0.900000*%\n%ADD31C,0.600000*%\n%ADD32C,0.304800*%\n%ADD33C,0.635000*%\n%ADD34C,0.450000*%\nG04 APERTURE END LIST*\nD10*\nD11*\nX196250000Y-118000000D02*\nX113000000Y-118000000D01*\nX196250000Y-52750000D02*\nX196250000Y-118000000D01*\nX113000000Y-52750000D02*\nX196250000Y-52750000D01*\nX113000000Y-118000000D02*\nX113000000Y-52750000D01*\nD12*\nX189307143Y-112775000D02*\nX188592857Y-112775000D01*\nX189450000Y-113203571D02*\nX188950000Y-111703571D01*\nX191107143Y-58571429D01*\nX191178571Y-58714286D01*\nX191321429Y-58857143D01*\nX191535714Y-58928571D01*\nX191892857Y-58928571D01*\nX190392857Y-57428571D02*\nX190392857Y-58642857D01*\nX190321429Y-58785714D01*\nX190250000Y-58857143D01*\nX190107143Y-58928571D01*\nX189821429Y-58928571D01*\nX189678571Y-58857143D01*\nX189607143Y-58785714D01*\nX189535714Y-58642857D01*\nX189535714Y-57428571D01*\nX188821428Y-58357143D02*\nX170107142Y-55928571D01*\nX170392856Y-55928571D01*\nX170535713Y-55857143D01*\nX170678570Y-55714286D01*\nX170749999Y-55428571D01*\nX170749999Y-54928571D01*\nX170678570Y-54642857D01*\nX170535713Y-54500000D01*\nX170392856Y-54428571D01*\nX169107141Y-55928571D02*\nX169107141Y-54428571D01*\nX168249998Y-55928571D01*\nX168249998Y-54428571D01*\nD13*\nX145400000Y-68800000D03*\nD14*\nX145400000Y-58640000D03*\nD15*\nX189230000Y-61468000D03*\nD16*\nX191770000Y-61468000D03*\nX189230000Y-74168000D03*\nX191770000Y-64008000D03*\nX189230000Y-76708000D03*\nX191770000Y-66548000D03*\nX189230000Y-79248000D03*\nX191770000Y-69088000D03*\nX189230000Y-81788000D03*\nX191770000Y-71628000D03*\nX189230000Y-84328000D03*\nX191770000Y-74168000D03*\nX189230000Y-86868000D03*\nX191770000Y-76708000D03*\nX189230000Y-89408000D03*\nX191770000Y-79248000D03*\nX189230000Y-91948000D03*\nX191770000Y-81788000D03*\nX189230000Y-94488000D03*\nX191770000Y-84328000D03*\nX189230000Y-97028000D03*\nX191770000Y-86868000D03*\nX189230000Y-99568000D03*\nX191770000Y-89408000D03*\nX191770000Y-91948000D03*\nX189230000Y-102108000D03*\nX191770000Y-94488000D03*\nX191770000Y-99568000D03*\nX191770000Y-102108000D03*\nX191770000Y-104648000D03*\nX191770000Y-107188000D03*\nX189230000Y-104648000D03*\nX189230000Y-107188000D03*\nX189230000Y-64008000D03*\nX189230000Y-66548000D03*\nX189230000Y-69088000D03*\nX189230000Y-71628000D03*\nX189230000Y-109728000D03*\nX191770000Y-109728000D03*\nX191770000Y-97028000D03*\nD15*\nX118110000Y-61468000D03*\nD16*\nX120650000Y-61468000D03*\nX118110000Y-64008000D03*\nX120650000Y-64008000D03*\nX118110000Y-66548000D03*\nX120650000Y-66548000D03*\nX118110000Y-69088000D03*\nX120650000Y-69088000D03*\nX118110000Y-71628000D03*\nX120650000Y-71628000D03*\nX118110000Y-74168000D03*\nX120650000Y-74168000D03*\nX118110000Y-76708000D03*\nX120650000Y-76708000D03*\nX118110000Y-79248000D03*\nX120650000Y-79248000D03*\nX118110000Y-81788000D03*\nX120650000Y-81788000D03*\nX118110000Y-84328000D03*\nX120650000Y-84328000D03*\nX118110000Y-86868000D03*\nX120650000Y-86868000D03*\nX118110000Y-89408000D03*\nX120650000Y-89408000D03*\nX118110000Y-91948000D03*\nX120650000Y-91948000D03*\nX118110000Y-94488000D03*\nX120650000Y-94488000D03*\nX118110000Y-97028000D03*\nX120650000Y-97028000D03*\nX118110000Y-99568000D03*\nX120650000Y-99568000D03*\nX118110000Y-102108000D03*\nX120650000Y-102108000D03*\nX118110000Y-104648000D03*\nX120650000Y-104648000D03*\nX118110000Y-107188000D03*\nX120650000Y-107188000D03*\nX118110000Y-109728000D03*\nX120650000Y-109728000D03*\nD17*\nX135255000Y-64008000D03*\nD18*\nX135255000Y-61508000D03*\nD19*\nX164465000Y-85471000D03*\nX164465000Y-77851000D03*\nD20*\nX136017000Y-72644000D03*\nD21*\nX133477000Y-72644000D03*\nD20*\nX173863000Y-72644000D03*\nD21*\nX176403000Y-72644000D03*\nD20*\nX136017000Y-96139000D03*\nD21*\nX133477000Y-96139000D03*\nD20*\nX173863000Y-96012000D03*\nD21*\nX176403000Y-96012000D03*\nD22*\nX127007800Y-61542700D03*\nD23*\nX129547800Y-61542700D03*\nX127007800Y-64082700D03*\nX129547800Y-64082700D03*\nD24*\nX166243000Y-67056000D03*\nX164973000Y-68326000D03*\nX164973000Y-65786000D03*\nX128143000Y-71374000D03*\nX129413000Y-72644000D03*\nX126873000Y-72644000D03*\nX181737000Y-73914000D03*\nX180467000Y-72644000D03*\nX183007000Y-72644000D03*\nX128143000Y-94742000D03*\nX129413000Y-96012000D03*\nX126873000Y-96012000D03*\nX181737000Y-97282000D03*\nX180467000Y-96012000D03*\nX183007000Y-96012000D03*\nD19*\nX134239000Y-85344000D03*\nX134239000Y-77724000D03*\nX145415000Y-85344000D03*\nX145415000Y-77724000D03*\nX175641000Y-85217000D03*\nX175641000Y-77597000D03*\nX145415000Y-108966000D03*\nX145415000Y-101346000D03*\nX134239000Y-108458000D03*\nX134239000Y-100838000D03*\nX175641000Y-108585000D03*\nX175641000Y-100965000D03*\nX164465000Y-108839000D03*\nX164465000Y-101219000D03*\nX169164000Y-62611000D03*\nX161544000Y-62611000D03*\nX169164000Y-59563000D03*\nX161544000Y-59563000D03*\nX129921000Y-85217000D03*\nX129921000Y-77597000D03*\nX126365000Y-85217000D03*\nX126365000Y-77597000D03*\nX180086000Y-85217000D03*\nX180086000Y-77597000D03*\nX183515000Y-85217000D03*\nX183515000Y-77597000D03*\nX129921000Y-108458000D03*\nX129921000Y-100838000D03*\nX126365000Y-108458000D03*\nX126365000Y-100838000D03*\nX179959000Y-108585000D03*\nX179959000Y-100965000D03*\nX183515000Y-108585000D03*\nX183515000Y-100965000D03*\nD13*\nX155000000Y-99000000D03*\nD14*\nX155000000Y-88840000D03*\nD25*\nX137287000Y-77724000D03*\nX142367000Y-77724000D03*\nX137287000Y-85344000D03*\nX142367000Y-85344000D03*\nX148463000Y-77724000D03*\nX153543000Y-77724000D03*\nX148463000Y-85344000D03*\nX153543000Y-85344000D03*\nX172593000Y-85344000D03*\nX167513000Y-85344000D03*\nX172593000Y-77724000D03*\nX167513000Y-77724000D03*\nX161417000Y-85344000D03*\nX156337000Y-85344000D03*\nX161417000Y-77724000D03*\nX156337000Y-77724000D03*\nX148463000Y-101219000D03*\nX153543000Y-101219000D03*\nX148463000Y-108839000D03*\nX153543000Y-108839000D03*\nX137287000Y-101219000D03*\nX142367000Y-101219000D03*\nX137287000Y-108839000D03*\nX142367000Y-108839000D03*\nX172593000Y-108712000D03*\nX167513000Y-108712000D03*\nX172593000Y-101092000D03*\nX167513000Y-101092000D03*\nX161417000Y-108712000D03*\nX156337000Y-108712000D03*\nX161417000Y-101092000D03*\nX156337000Y-101092000D03*\nD26*\nX157178971Y-64124429D03*\nX150828971Y-64124429D03*\nD27*\nX137287000Y-80137000D03*\nX137287000Y-83439000D03*\nX148336000Y-79629000D03*\nX148463000Y-83185000D03*\nX172593000Y-80137000D03*\nX172593000Y-83312000D03*\nX161417000Y-80010000D03*\nX161417000Y-83439000D03*\nX137287000Y-103505000D03*\nX137287000Y-106680000D03*\nX172593000Y-103378000D03*\nX172593000Y-106934000D03*\nX148463000Y-103505000D03*\nX148463000Y-106934000D03*\nX161417000Y-103759000D03*\nX161417000Y-106934000D03*\nD28*\nX145400000Y-68800000D02*\nX145400000Y-70800000D01*\nX148800000Y-74200000D02*\nX153200000Y-74200000D01*\nX153200000Y-74200000D02*\nX154947800Y-75947800D01*\nX154947800Y-75947800D02*\nX154947800Y-77858800D01*\nX145400000Y-70800000D02*\nX148800000Y-74200000D01*\nX145400000Y-61508000D02*\nX145400000Y-58640000D01*\nD29*\nX135255000Y-61508000D02*\nX142600000Y-61508000D01*\nX142600000Y-61508000D02*\nX145400000Y-61508000D01*\nX145400000Y-61508000D02*\nX148212542Y-61508000D01*\nX148212542Y-61508000D02*\nX150828971Y-64124429D01*\nD30*\nX118110000Y-64008000D02*\nX116908002Y-64008000D01*\nD28*\nX131147000Y-57400000D02*\nX135255000Y-61508000D01*\nD29*\nX118100000Y-57400000D02*\nX131147000Y-57400000D01*\nD30*\nX116100002Y-59399998D02*\nX118100000Y-57400000D01*\nX116100002Y-63200000D02*\nX116100002Y-59399998D01*\nX116908002Y-64008000D02*\nX116100002Y-63200000D01*\nX167513000Y-101092000D02*\nX167513000Y-108712000D01*\nD31*\nX156337000Y-101092000D02*\nX156337000Y-104037000D01*\nX177103500Y-105300000D02*\nX177998300Y-104405200D01*\nX157600000Y-105300000D02*\nX177103500Y-105300000D01*\nX156337000Y-104037000D02*\nX157600000Y-105300000D01*\nD30*\nX142367000Y-85344000D02*\nX142367000Y-81661000D01*\nD32*\nX142367000Y-81661000D02*\nX142367000Y-81608700D01*\nD28*\nX154947800Y-85598000D02*\nX154947800Y-77858800D01*\nD33*\nX154947800Y-85418700D02*\nX154947800Y-85598000D01*\nX154947800Y-77858800D02*\nX154940000Y-77851000D01*\nX154940000Y-77851000D02*\nX154940000Y-77798700D01*\nD30*\nX167513000Y-85344000D02*\nX167513000Y-81534000D01*\nD32*\nX167513000Y-81534000D02*\nX167520800Y-81534000D01*\nD29*\nX154940000Y-108786700D02*\nX154940000Y-101219000D01*\nD33*\nX154940000Y-101219000D02*\nX154940000Y-101166700D01*\nD29*\nX142367000Y-108839000D02*\nX142367000Y-105029000D01*\nD32*\nX142367000Y-105029000D02*\nX142367000Y-104976700D01*\nD33*\nX153550800Y-108786700D02*\nX154940000Y-108786700D01*\nX154940000Y-108786700D02*\nX156344800Y-108786700D01*\nD30*\nX153550800Y-85418700D02*\nX154947800Y-85418700D01*\nX154947800Y-85418700D02*\nX156344800Y-85418700D01*\nD33*\nX153550800Y-101166700D02*\nX154940000Y-101166700D01*\nX154940000Y-101166700D02*\nX155074800Y-101166700D01*\nX155074800Y-101166700D02*\nX156344800Y-101166700D01*\nD31*\nX174632800Y-98118700D02*\nX173870800Y-97356700D01*\nX173870800Y-97356700D02*\nX173870800Y-96086700D01*\nX132468800Y-104976700D02*\nX142367000Y-104976700D01*\nD32*\nX142367000Y-104976700D02*\nX142374800Y-104976700D01*\nX136024800Y-96086700D02*\nX136024800Y-96856700D01*\nD29*\nX131960800Y-98880700D02*\nX131960800Y-104468700D01*\nD31*\nX132422800Y-98418700D02*\nX131960800Y-98880700D01*\nX134462800Y-98418700D02*\nX132422800Y-98418700D01*\nX136024800Y-96856700D02*\nX134462800Y-98418700D01*\nX131960800Y-104468700D02*\nX132468800Y-104976700D01*\nD29*\nX142374800Y-101166700D02*\nX142374800Y-104976700D01*\nD30*\nX153550800Y-104214700D02*\nX153550800Y-101166700D01*\nX152788800Y-104976700D02*\nX153550800Y-104214700D01*\nD31*\nX142374800Y-104976700D02*\nX152788800Y-104976700D01*\nD32*\nX177426800Y-104976700D02*\nX177998300Y-104405200D01*\nX177998300Y-104405200D02*\nX177934800Y-104468700D01*\nD30*\nX177934800Y-104468700D02*\nX177934800Y-98880700D01*\nX177934800Y-98880700D02*\nX177172800Y-98118700D01*\nD31*\nX177172800Y-98118700D02*\nX174632800Y-98118700D01*\nX173870800Y-73988700D02*\nX173870800Y-72718700D01*\nD30*\nX174632800Y-74750700D02*\nX173870800Y-73988700D01*\nD32*\nX131960800Y-81100700D02*\nX132024300Y-81164200D01*\nD33*\nX132024300Y-81164200D02*\nX132468800Y-81608700D01*\nX131960800Y-75512700D02*\nX131960800Y-81100700D01*\nD30*\nX177172800Y-74750700D02*\nX174632800Y-74750700D01*\nX177934800Y-75512700D02*\nX177172800Y-74750700D01*\nX177934800Y-81100700D02*\nX177934800Y-75512700D01*\nD31*\nX177426800Y-81608700D02*\nX177934800Y-81100700D01*\nD33*\nX132722800Y-74750700D02*\nX131960800Y-75512700D01*\nX135262800Y-74750700D02*\nX132722800Y-74750700D01*\nX136024800Y-73988700D02*\nX135262800Y-74750700D01*\nX136024800Y-72718700D02*\nX136024800Y-73988700D01*\nX132468800Y-81608700D02*\nX142367000Y-81608700D01*\nD32*\nX142367000Y-81608700D02*\nX142374800Y-81608700D01*\nX167520800Y-81608700D02*\nX167520800Y-81534000D01*\nD30*\nX167520800Y-81534000D02*\nX167520800Y-77798700D01*\nD31*\nX157106800Y-81608700D02*\nX167520800Y-81608700D01*\nX167520800Y-81608700D02*\nX177426800Y-81608700D01*\nD33*\nX153550800Y-77798700D02*\nX154940000Y-77798700D01*\nX154940000Y-77798700D02*\nX156344800Y-77798700D01*\nX142374800Y-81608700D02*\nX152788800Y-81608700D01*\nD30*\nX152788800Y-81608700D02*\nX153550800Y-80846700D01*\nX153550800Y-80846700D02*\nX153550800Y-77798700D01*\nX156344800Y-77798700D02*\nX156344800Y-80846700D01*\nX156344800Y-80846700D02*\nX157106800Y-81608700D01*\nX142374800Y-77798700D02*\nX142374800Y-81608700D01*\nD32*\nX133484800Y-72718700D02*\nX133738800Y-72464700D01*\nX133738800Y-72464700D02*\nX133484800Y-72718700D01*\nD29*\nX129420800Y-72718700D02*\nX133484800Y-72718700D01*\nD30*\nX180474800Y-72718700D02*\nX176410800Y-72718700D01*\nX180474800Y-96086700D02*\nX176410800Y-96086700D01*\nD32*\nX166410164Y-67016464D02*\nX166936536Y-67016464D01*\nD30*\nX169235300Y-64717700D02*\nX169235300Y-62558700D01*\nX166936536Y-67016464D02*\nX169235300Y-64717700D01*\nX165140164Y-68286464D02*\nX163616164Y-68286465D01*\nX159552164Y-64222465D02*\nX157266164Y-64222465D01*\nX163616164Y-68286465D02*\nX159552164Y-64222465D01*\nD32*\nX157266164Y-64222465D02*\nX157178971Y-64124429D01*\nX157262972Y-64194429D02*\nX157178971Y-64124429D01*\nD34*\nX128150800Y-75004700D02*\nX128150800Y-71448700D01*\nD33*\nX128658800Y-75512700D02*\nX128150800Y-75004700D01*\nX129420800Y-75512700D02*\nX128658800Y-75512700D01*\nX129928800Y-76020700D02*\nX129420800Y-75512700D01*\nX129928800Y-77544700D02*\nX129928800Y-76020700D01*\nD31*\nX127084050Y-75715950D02*\nX127084050Y-75584050D01*\nX126873000Y-75373000D02*\nX126873000Y-72644000D01*\nX127084050Y-75584050D02*\nX126873000Y-75373000D01*\nD34*\nX128150800Y-76782700D02*\nX127084050Y-75715950D01*\nX127084050Y-75715950D02*\nX126880800Y-75512700D01*\nX128150800Y-79576700D02*\nX128150800Y-76782700D01*\nD30*\nX126372800Y-81354700D02*\nX128150800Y-79576700D01*\nX126372800Y-85164700D02*\nX126372800Y-81354700D01*\nX181744800Y-73988700D02*\nX181744800Y-75004700D01*\nX179966800Y-76020700D02*\nX179966800Y-77290700D01*\nX180474800Y-75512700D02*\nX179966800Y-76020700D01*\nX181236800Y-75512700D02*\nX180474800Y-75512700D01*\nX181744800Y-75004700D02*\nX181236800Y-75512700D01*\nD32*\nX179966800Y-77290700D02*\nX180220800Y-77544700D01*\nD30*\nX183522800Y-85164700D02*\nX183522800Y-81354700D01*\nD34*\nX183014800Y-75512700D02*\nX183014800Y-72718700D01*\nX181744800Y-76782700D02*\nX183014800Y-75512700D01*\nX181744800Y-79576700D02*\nX181744800Y-76782700D01*\nD30*\nX183522800Y-81354700D02*\nX181744800Y-79576700D01*\nD32*\nX179966800Y-100658700D02*\nX180220800Y-100912700D01*\nD31*\nX179966800Y-99388700D02*\nX179966800Y-100658700D01*\nX180474800Y-98880700D02*\nX179966800Y-99388700D01*\nX181236800Y-98880700D02*\nX180474800Y-98880700D01*\nX181744800Y-98372700D02*\nX181236800Y-98880700D01*\nX181744800Y-97356700D02*\nX181744800Y-98372700D01*\nX183515000Y-108585000D02*\nX183515000Y-106115000D01*\nX183600000Y-96605000D02*\nX183007000Y-96012000D01*\nX183600000Y-98100000D02*\nX183600000Y-96605000D01*\nX181700000Y-100000000D02*\nX183600000Y-98100000D01*\nX181700000Y-104300000D02*\nX181700000Y-100000000D01*\nX183515000Y-106115000D02*\nX181700000Y-104300000D01*\nD30*\nX120650000Y-84328000D02*\nX122828000Y-84328000D01*\nD34*\nX127000000Y-88100000D02*\nX131483000Y-88100000D01*\nX131483000Y-88100000D02*\nX134239000Y-85344000D01*\nX125100000Y-88100000D02*\nX123200000Y-86200000D01*\nX123200000Y-86200000D02*\nX123200000Y-84700000D01*\nX123200000Y-84700000D02*\nX122900000Y-84400000D01*\nX127000000Y-88100000D02*\nX125100000Y-88100000D01*\nD30*\nX122828000Y-84328000D02*\nX122900000Y-84400000D01*\nD29*\nX137287000Y-85344000D02*\nX137287000Y-83439000D01*\nX137287000Y-80137000D02*\nX137287000Y-77724000D01*\nD32*\nX137040800Y-85164700D02*\nX137294800Y-85418700D01*\nD29*\nX134246800Y-85164700D02*\nX137040800Y-85164700D01*\nD30*\nX120650000Y-86868000D02*\nX121668000Y-86868000D01*\nD34*\nX123900000Y-89100000D02*\nX122800000Y-88000000D01*\nX141659000Y-89100000D02*\nX145415000Y-85344000D01*\nX141659000Y-89100000D02*\nX123900000Y-89100000D01*\nD30*\nX121668000Y-86868000D02*\nX122800000Y-88000000D01*\nX148463000Y-85344000D02*\nX148463000Y-83185000D01*\nX148463000Y-79502000D02*\nX148463000Y-77724000D01*\nD32*\nX148336000Y-79629000D02*\nX148463000Y-79502000D01*\nD30*\nX148470800Y-85418700D02*\nX145422800Y-85418700D01*\nX120650000Y-91948000D02*\nX123152000Y-91948000D01*\nD34*\nX141100000Y-91300000D02*\nX123800000Y-91300000D01*\nX123800000Y-91300000D02*\nX123300000Y-91800000D01*\nD30*\nX165237000Y-92700000D02*\nX172593000Y-85344000D01*\nX142500000Y-92700000D02*\nX165237000Y-92700000D01*\nD34*\nX142050000Y-92250000D02*\nX142500000Y-92700000D01*\nX142050000Y-92250000D02*\nX141100000Y-91300000D01*\nD30*\nX123152000Y-91948000D02*\nX123300000Y-91800000D01*\nX175641000Y-85217000D02*\nX172720000Y-85217000D01*\nX172720000Y-85217000D02*\nX172593000Y-85344000D01*\nX172593000Y-85344000D02*\nX172593000Y-83312000D01*\nX172593000Y-80137000D02*\nX172593000Y-77724000D01*\nD32*\nX172600800Y-85418700D02*\nX172854800Y-85164700D01*\nD30*\nX120650000Y-89408000D02*\nX122108000Y-89408000D01*\nX122108000Y-89408000D02*\nX122800000Y-90100000D01*\nD34*\nX142100000Y-90100000D02*\nX122800000Y-90100000D01*\nX142100000Y-90100000D02*\nX143000000Y-91000000D01*\nD30*\nX143000000Y-91000000D02*\nX158936000Y-91000000D01*\nX164465000Y-85471000D02*\nX158936000Y-91000000D01*\nD34*\nX122800000Y-90100000D02*\nX122900000Y-90200000D01*\nD30*\nX161417000Y-85344000D02*\nX161417000Y-83439000D01*\nX161417000Y-80010000D02*\nX161417000Y-77724000D01*\nX161424800Y-85418700D02*\nX165234800Y-85418700D01*\nX120650000Y-104648000D02*\nX122548000Y-104648000D01*\nD34*\nX123500000Y-105600000D02*\nX122750000Y-104850000D01*\nX123500000Y-110100000D02*\nX123500000Y-105600000D01*\nX124900000Y-111500000D02*\nX123500000Y-110100000D01*\nD31*\nX131100000Y-111500000D02*\nX124900000Y-111500000D01*\nX131100000Y-111500000D02*\nX134142000Y-108458000D01*\nD30*\nX122548000Y-104648000D02*\nX122750000Y-104850000D01*\nD34*\nX134239000Y-108458000D02*\nX134142000Y-108458000D01*\nD30*\nX137287000Y-108839000D02*\nX137287000Y-106680000D01*\nX137287000Y-103505000D02*\nX137287000Y-101219000D01*\nD32*\nX137040800Y-108532700D02*\nX137294800Y-108786700D01*\nD30*\nX134246800Y-108532700D02*\nX137040800Y-108532700D01*\nD32*\nX120653400Y-104651400D02*\nX120650000Y-104648000D01*\nD30*\nX116100000Y-105700000D02*\nX116100000Y-105400000D01*\nD31*\nX175641000Y-110559000D02*\nX171100000Y-115100000D01*\nX171100000Y-115100000D02*\nX119900000Y-115100000D01*\nX119900000Y-115100000D02*\nX116100000Y-111300000D01*\nX116100000Y-111300000D02*\nX116100000Y-105700000D01*\nX175641000Y-108585000D02*\nX175641000Y-110559000D01*\nD30*\nX116852000Y-104648000D02*\nX118110000Y-104648000D01*\nX116100000Y-105400000D02*\nX116852000Y-104648000D01*\nX172593000Y-108712000D02*\nX172593000Y-106934000D01*\nX172593000Y-103378000D02*\nX172593000Y-101092000D01*\nX175641000Y-108585000D02*\nX172720000Y-108585000D01*\nD32*\nX172720000Y-108585000D02*\nX172593000Y-108712000D01*\nD28*\nX164973000Y-65786000D02*\nX164973000Y-61515307D01*\nX164700000Y-61242307D02*\nX163108164Y-59650464D01*\nX163108164Y-59650464D02*\nX161584164Y-59650465D01*\nX164973000Y-61515307D02*\nX164700000Y-61242307D01*\nD30*\nX129420800Y-96086700D02*\nX133484800Y-96086700D01*\nD32*\nX133738800Y-95832700D02*\nX133484800Y-96086700D01*\nX133484800Y-96086700D02*\nX133738800Y-95832700D01*\nD31*\nX129928800Y-99388700D02*\nX129420800Y-98880700D01*\nX129420800Y-98880700D02*\nX128658800Y-98880700D01*\nX128658800Y-98880700D02*\nX128150800Y-98372700D01*\nX129928800Y-100912700D02*\nX129928800Y-99388700D01*\nD34*\nX128150800Y-98372700D02*\nX128150800Y-94816700D01*\nD28*\nX126372800Y-104722700D02*\nX128150800Y-102944700D01*\nD34*\nX128150800Y-102944700D02*\nX128150800Y-100150700D01*\nX128150800Y-100150700D02*\nX126880800Y-98880700D01*\nD28*\nX126372800Y-108532700D02*\nX126372800Y-104722700D01*\nD31*\nX126880800Y-98880700D02*\nX126880800Y-96086700D01*\nD34*\nX120650000Y-107188000D02*\nX122488000Y-107188000D01*\nD31*\nX141800000Y-112700000D02*\nX145415000Y-109085000D01*\nX141800000Y-112700000D02*\nX124100000Y-112700000D01*\nD34*\nX124100000Y-112700000D02*\nX122600000Y-111200000D01*\nX122600000Y-107300000D02*\nX122600000Y-111200000D01*\nX122488000Y-107188000D02*\nX122600000Y-107300000D01*\nD30*\nX145415000Y-108966000D02*\nX145415000Y-109085000D01*\nX148463000Y-108839000D02*\nX148463000Y-106934000D01*\nX148463000Y-103505000D02*\nX148463000Y-101219000D01*\nX148470800Y-108786700D02*\nX145422800Y-108786700D01*\nD32*\nX145422800Y-108786700D02*\nX144660800Y-108786700D01*\nD30*\nX120650000Y-109728000D02*\nX120650000Y-111350000D01*\nD31*\nX160300000Y-113900000D02*\nX123200000Y-113900000D01*\nX123200000Y-113900000D02*\nX120900000Y-111600000D01*\nX160300000Y-113900000D02*\nX164465000Y-109735000D01*\nD30*\nX120650000Y-111350000D02*\nX120900000Y-111600000D01*\nD34*\nX164465000Y-108839000D02*\nX164465000Y-109735000D01*\nD30*\nX161417000Y-108712000D02*\nX161417000Y-106934000D01*\nX161417000Y-103759000D02*\nX161417000Y-101092000D01*\nX164465000Y-108839000D02*\nX161544000Y-108839000D01*\nD32*\nX161544000Y-108839000D02*\nX161417000Y-108712000D01*\nD29*\nX118110000Y-61468000D02*\nX118110000Y-60190000D01*\nX124665100Y-59200000D02*\nX127007800Y-61542700D01*\nX119100000Y-59200000D02*\nX124665100Y-59200000D01*\nX118110000Y-60190000D02*\nX119100000Y-59200000D01*\nX120650000Y-61468000D02*\nX122968000Y-61468000D01*\nX124882700Y-64082700D02*\nX127007800Y-64082700D01*\nX124000000Y-63200000D02*\nX124882700Y-64082700D01*\nX124000000Y-62500000D02*\nX124000000Y-63200000D01*\nX122968000Y-61468000D02*\nX124000000Y-62500000D01*\nD30*\nX120650000Y-81788000D02*\nX122488000Y-81788000D01*\nX122488000Y-81788000D02*\nX122600000Y-81900000D01*\nD34*\nX127400000Y-87100000D02*\nX125500000Y-87100000D01*\nX122600000Y-81900000D02*\nX122500000Y-81900000D01*\nX124300000Y-83600000D02*\nX122600000Y-81900000D01*\nX124300000Y-85900000D02*\nX124300000Y-83600000D01*\nX125500000Y-87100000D02*\nX124300000Y-85900000D01*\nD31*\nX129921000Y-86579000D02*\nX129921000Y-85217000D01*\nX129400000Y-87100000D02*\nX129921000Y-86579000D01*\nD34*\nX127400000Y-87100000D02*\nX129400000Y-87100000D01*\nD30*\nX120650000Y-94488000D02*\nX123012000Y-94488000D01*\nD34*\nX140500000Y-93400000D02*\nX139400000Y-92300000D01*\nX139400000Y-92300000D02*\nX125200000Y-92300000D01*\nX125200000Y-92300000D02*\nX123200000Y-94300000D01*\nD30*\nX180086000Y-87214000D02*\nX180086000Y-85217000D01*\nD34*\nX142700000Y-94900000D02*\nX141200000Y-93400000D01*\nD30*\nX166500000Y-94900000D02*\nX142700000Y-94900000D01*\nX171100000Y-90300000D02*\nX166500000Y-94900000D01*\nX177000000Y-90300000D02*\nX171100000Y-90300000D01*\nX180086000Y-87214000D02*\nX177000000Y-90300000D01*\nD34*\nX141200000Y-93400000D02*\nX140500000Y-93400000D01*\nD30*\nX123012000Y-94488000D02*\nX123200000Y-94300000D01*\nD32*\nX179966800Y-85164700D02*\nX180220800Y-85164700D01*\nD30*\nX120650000Y-102108000D02*\nX123408000Y-102108000D01*\nD34*\nX124500000Y-103200000D02*\nX123250000Y-101950000D01*\nX124500000Y-109300000D02*\nX124500000Y-103200000D01*\nX125600000Y-110400000D02*\nX124500000Y-109300000D01*\nX127900000Y-110400000D02*\nX125600000Y-110400000D01*\nD31*\nX127900000Y-110400000D02*\nX129842000Y-108458000D01*\nD30*\nX123408000Y-102108000D02*\nX123250000Y-101950000D01*\nD34*\nX129921000Y-108458000D02*\nX129842000Y-108458000D01*\nD30*\nX115800000Y-102600000D02*\nX116300000Y-102100000D01*\nD31*\nX179959000Y-110841000D02*\nX174400000Y-116400000D01*\nX174400000Y-116400000D02*\nX118500000Y-116400000D01*\nX118500000Y-116400000D02*\nX114800000Y-112700000D01*\nX114800000Y-112700000D02*\nX114800000Y-103600000D01*\nX114800000Y-103600000D02*\nX115800000Y-102600000D01*\nX179959000Y-108585000D02*\nX179959000Y-110841000D01*\nD30*\nX116300000Y-102100000D02*\nX118102000Y-102100000D01*\nX118102000Y-102100000D02*\nX118110000Y-102108000D01*\nX118110000Y-71628000D02*\nX115400000Y-71628000D01*\nX114600000Y-64700000D02*\nX115400000Y-65500000D01*\nX115400000Y-65500000D02*\nX115400000Y-71800000D01*\nD28*\nX159811000Y-62611000D02*\nX161544000Y-62611000D01*\nX157600000Y-60400000D02*\nX159811000Y-62611000D01*\nX157600000Y-58667000D02*\nX157600000Y-60400000D01*\nX153733000Y-54800000D02*\nX157600000Y-58667000D01*\nX117400000Y-54800000D02*\nX153733000Y-54800000D01*\nD30*\nX114600000Y-57600000D02*\nX117400000Y-54800000D01*\nX114600000Y-57600000D02*\nX114600000Y-64700000D01*\nX115400000Y-71628000D02*\nX115400000Y-71800000D01*\nD29*\nX145415000Y-97300000D02*\nX151200000Y-97300000D01*\nX158600000Y-97200000D02*\nX169200000Y-97200000D01*\nX158200000Y-96800000D02*\nX158600000Y-97200000D01*\nD30*\nX151700000Y-96800000D02*\nX158200000Y-96800000D01*\nX151200000Y-97300000D02*\nX151700000Y-96800000D01*\nX170900000Y-98900000D02*\nX169200000Y-97200000D01*\nX173500000Y-98900000D02*\nX170900000Y-98900000D01*\nX175565000Y-100965000D02*\nX173500000Y-98900000D01*\nD29*\nX164465000Y-97965000D02*\nX164400000Y-97900000D01*\nX164465000Y-101219000D02*\nX164465000Y-97965000D01*\nX145415000Y-101346000D02*\nX145415000Y-97300000D01*\nX145415000Y-97300000D02*\nX145415000Y-97200000D01*\nD30*\nX175641000Y-100965000D02*\nX175565000Y-100965000D01*\nD29*\nX138400000Y-98900000D02*\nX138700000Y-98900000D01*\nD30*\nX136200000Y-98900000D02*\nX138400000Y-98900000D01*\nX134262000Y-100838000D02*\nX136200000Y-98900000D01*\nD29*\nX138700000Y-98900000D02*\nX140400000Y-97200000D01*\nX145500000Y-97500000D02*\nX145500000Y-97200000D01*\nX145500000Y-97285000D02*\nX145500000Y-97500000D01*\nX145415000Y-97200000D02*\nX145500000Y-97285000D01*\nX139400000Y-94700000D02*\nX139400000Y-96200000D01*\nX139400000Y-96200000D02*\nX140400000Y-97200000D01*\nX171700000Y-93200000D02*\nX183300000Y-93200000D01*\nX169200000Y-97200000D02*\nX171100000Y-95300000D01*\nX171100000Y-95300000D02*\nX171100000Y-93800000D01*\nX171100000Y-93800000D02*\nX171700000Y-93200000D01*\nX140400000Y-97200000D02*\nX145500000Y-97200000D01*\nD30*\nX183250000Y-93150000D02*\nX183300000Y-93200000D01*\nD28*\nX183300000Y-93200000D02*\nX185900000Y-95800000D01*\nX183515000Y-100965000D02*\nX185900000Y-98580000D01*\nX185900000Y-95800000D02*\nX185900000Y-98580000D01*\nX183700000Y-92900000D02*\nX186316800Y-90283200D01*\nD29*\nX186316800Y-90283200D02*\nX186316800Y-75004700D01*\nD28*\nX185618300Y-68273700D02*\nX180093800Y-68273700D01*\nD29*\nX186316800Y-68972200D02*\nX185935800Y-68591200D01*\nD33*\nX185935800Y-68591200D02*\nX185618300Y-68273700D01*\nD29*\nX186316800Y-75004700D02*\nX186316800Y-68972200D01*\nD31*\nX134239000Y-100838000D02*\nX134262000Y-100838000D01*\nX126365000Y-100838000D02*\nX126338000Y-100838000D01*\nX126338000Y-100838000D02*\nX125000000Y-99500000D01*\nX125000000Y-99500000D02*\nX125000000Y-95200000D01*\nX125000000Y-95200000D02*\nX126700000Y-93500000D01*\nX126700000Y-93500000D02*\nX138200000Y-93500000D01*\nX138200000Y-93500000D02*\nX139400000Y-94700000D01*\nD30*\nX139400000Y-94700000D02*\nX139200000Y-94500000D01*\nD28*\nX170500000Y-75500000D02*\nX170500000Y-68273700D01*\nD29*\nX170500000Y-68273700D02*\nX170010000Y-68273700D01*\nD28*\nX164465000Y-77851000D02*\nX164465000Y-76285000D01*\nX165250000Y-75500000D02*\nX170500000Y-75500000D01*\nD30*\nX170500000Y-75500000D02*\nX171250000Y-75500000D01*\nD28*\nX164465000Y-76285000D02*\nX165250000Y-75500000D01*\nD30*\nX173544000Y-75500000D02*\nX175641000Y-77597000D01*\nX171250000Y-75500000D02*\nX173544000Y-75500000D01*\nD28*\nX145415000Y-77724000D02*\nX145415000Y-75665000D01*\nX144000000Y-74250000D02*\nX140500000Y-74250000D01*\nX145415000Y-75665000D02*\nX144000000Y-74250000D01*\nD31*\nX134239000Y-77724000D02*\nX134239000Y-77511000D01*\nX134239000Y-77511000D02*\nX136500000Y-75250000D01*\nD29*\nX136500000Y-75250000D02*\nX139500000Y-75250000D01*\nX139500000Y-75250000D02*\nX140500000Y-74250000D01*\nD28*\nX140500000Y-74250000D02*\nX140500000Y-71250000D01*\nX140500000Y-71250000D02*\nX137750000Y-68500000D01*\nX137750000Y-68500000D02*\nX129250000Y-68500000D01*\nD30*\nX129250000Y-68500000D02*\nX129250000Y-68750000D01*\nD31*\nX126365000Y-77597000D02*\nX126347000Y-77597000D01*\nD29*\nX126347000Y-77597000D02*\nX123200000Y-74450000D01*\nX123200000Y-74450000D02*\nX123200000Y-73050000D01*\nD28*\nX123200000Y-73050000D02*\nX127500000Y-68750000D01*\nX127500000Y-68750000D02*\nX129250000Y-68750000D01*\nD30*\nX129250000Y-68750000D02*\nX129000000Y-68750000D01*\nX129000000Y-68750000D02*\nX129547800Y-68202200D01*\nD28*\nX129547800Y-68202200D02*\nX129547800Y-64082700D01*\nX129547800Y-61542700D02*\nX129547800Y-64082700D01*\nX131000000Y-64082700D02*\nX129547800Y-64082700D01*\nX159974000Y-67750000D02*\nX150322000Y-67750000D01*\nX150322000Y-67750000D02*\nX146642000Y-64070000D01*\nX146642000Y-64070000D02*\nX142070000Y-64070000D01*\nD33*\nX142070000Y-64070000D02*\nX142070000Y-64082700D01*\nD28*\nX170010000Y-68273700D02*\nX168726300Y-68273700D01*\nX163224000Y-71000000D02*\nX159974000Y-67750000D01*\nX166000000Y-71000000D02*\nX163224000Y-71000000D01*\nX168726300Y-68273700D02*\nX166000000Y-71000000D01*\nD33*\nX171457800Y-68273700D02*\nX170010000Y-68273700D01*\nD28*\nX180093800Y-68273700D02*\nX171457800Y-68273700D01*\nD33*\nX170010000Y-68273700D02*\nX169806800Y-68273700D01*\nX142438300Y-64082700D02*\nX142070000Y-64082700D01*\nD28*\nX142070000Y-64082700D02*\nX131000000Y-64082700D01*\nD33*\nX131000000Y-64082700D02*\nX130817800Y-64082700D01*\nX132722800Y-64082700D02*\nX130817800Y-64082700D01*\nD28*\nX171521300Y-59637700D02*\nX171521300Y-59650464D01*\nD29*\nX169204164Y-59650464D02*\nX171521300Y-59650464D01*\nD33*\nX171521300Y-59650464D02*\nX171534064Y-59650464D01*\nD28*\nX171534064Y-59650464D02*\nX180093800Y-68210200D01*\nD33*\nX180093800Y-68210200D02*\nX180093800Y-68273700D01*\nD32*\nX145422800Y-101166700D02*\nX145422800Y-100658700D01*\nM02*\n" }, { "path": "src/test/resources/samples/langs/Gerber Image/simonShield-B.Mask.gbr", "content": "G04 #@! TF.FileFunction,Soldermask,Bot*\n%FSLAX46Y46*%\nG04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*\nG04 Created by KiCad (PCBNEW 4.0.6-e0-6349~53~ubuntu16.04.1) date Sat Jul 1 03:26:18 2017*\n%MOMM*%\n%LPD*%\nG01*\nG04 APERTURE LIST*\n%ADD10C,0.100000*%\n%ADD11C,0.150000*%\n%ADD12C,2.000000*%\n%ADD13O,2.000000X2.000000*%\n%ADD14R,2.400000X1.924000*%\n%ADD15O,2.400000X1.924000*%\n%ADD16R,1.700000X1.700000*%\n%ADD17C,1.700000*%\n%ADD18C,2.398980*%\n%ADD19R,2.300000X2.400000*%\n%ADD20C,2.300000*%\n%ADD21R,2.127200X2.127200*%\n%ADD22O,2.127200X2.127200*%\n%ADD23C,1.400760*%\n%ADD24C,1.797000*%\n%ADD25C,2.000200*%\nG04 APERTURE END LIST*\nD10*\nD11*\nX196250000Y-118000000D02*\nX113000000Y-118000000D01*\nX196250000Y-52750000D02*\nX196250000Y-118000000D01*\nX113000000Y-52750000D02*\nX196250000Y-52750000D01*\nX113000000Y-118000000D02*\nX113000000Y-52750000D01*\nD12*\nX145400000Y-68800000D03*\nD13*\nX145400000Y-58640000D03*\nD14*\nX189230000Y-61468000D03*\nD15*\nX191770000Y-61468000D03*\nX189230000Y-74168000D03*\nX189230000Y-109728000D03*\nX191770000Y-109728000D03*\nX191770000Y-97028000D03*\nD14*\nX118110000Y-61468000D03*\nD15*\nX120650000Y-61468000D03*\nX118110000Y-64008000D03*\nX120650000Y-64008000D03*\nX118110000Y-66548000D03*\nX120650000Y-66548000D03*\nX118110000Y-69088000D03*\nX120650000Y-69088000D03*\nX118110000Y-71628000D03*\nX120650000Y-71628000D03*\nX118110000Y-74168000D03*\nX120650000Y-74168000D03*\nX118110000Y-76708000D03*\nX120650000Y-76708000D03*\nX118110000Y-79248000D03*\nX120650000Y-79248000D03*\nX118110000Y-81788000D03*\nX120650000Y-81788000D03*\nX118110000Y-84328000D03*\nX120650000Y-84328000D03*\nX118110000Y-86868000D03*\nX120650000Y-86868000D03*\nX118110000Y-89408000D03*\nX120650000Y-89408000D03*\nX118110000Y-91948000D03*\nX120650000Y-91948000D03*\nX118110000Y-94488000D03*\nX120650000Y-94488000D03*\nX118110000Y-97028000D03*\nX120650000Y-97028000D03*\nX118110000Y-99568000D03*\nX120650000Y-99568000D03*\nX118110000Y-102108000D03*\nX120650000Y-102108000D03*\nX118110000Y-104648000D03*\nX120650000Y-104648000D03*\nX118110000Y-107188000D03*\nX120650000Y-107188000D03*\nX118110000Y-109728000D03*\nX120650000Y-109728000D03*\nD16*\nX135255000Y-64008000D03*\nD17*\nX135255000Y-61508000D03*\nD18*\nX164465000Y-85471000D03*\nX164465000Y-77851000D03*\nD19*\nX136017000Y-72644000D03*\nD20*\nX133477000Y-72644000D03*\nD19*\nX173863000Y-72644000D03*\nD20*\nX176403000Y-72644000D03*\nD19*\nX136017000Y-96139000D03*\nD20*\nX133477000Y-96139000D03*\nD19*\nX173863000Y-96012000D03*\nD20*\nX176403000Y-96012000D03*\nD21*\nX127007800Y-61542700D03*\nD22*\nX129547800Y-61542700D03*\nX127007800Y-64082700D03*\nX129547800Y-64082700D03*\nD23*\nX166243000Y-67056000D03*\nX164973000Y-68326000D03*\nX164973000Y-65786000D03*\nX128143000Y-71374000D03*\nX129413000Y-72644000D03*\nX126873000Y-72644000D03*\nX181737000Y-73914000D03*\nX180467000Y-72644000D03*\nX183007000Y-72644000D03*\nX128143000Y-94742000D03*\nX129413000Y-96012000D03*\nX126873000Y-96012000D03*\nX181737000Y-97282000D03*\nX180467000Y-96012000D03*\nX183007000Y-96012000D03*\nD18*\nX134239000Y-85344000D03*\nX134239000Y-77724000D03*\nX145415000Y-85344000D03*\nX145415000Y-77724000D03*\nX175641000Y-85217000D03*\nX175641000Y-77597000D03*\nX145415000Y-108966000D03*\nX145415000Y-101346000D03*\nX134239000Y-108458000D03*\nX134239000Y-100838000D03*\nX175641000Y-108585000D03*\nX175641000Y-100965000D03*\nX164465000Y-108839000D03*\nX164465000Y-101219000D03*\nX169164000Y-62611000D03*\nX161544000Y-62611000D03*\nX169164000Y-59563000D03*\nX161544000Y-59563000D03*\nX129921000Y-85217000D03*\nX129921000Y-77597000D03*\nX126365000Y-85217000D03*\nX126365000Y-77597000D03*\nX180086000Y-85217000D03*\nX180086000Y-77597000D03*\nX183515000Y-85217000D03*\nX183515000Y-77597000D03*\nX129921000Y-108458000D03*\nX129921000Y-100838000D03*\nX126365000Y-108458000D03*\nX126365000Y-100838000D03*\nX179959000Y-108585000D03*\nX179959000Y-100965000D03*\nX183515000Y-108585000D03*\nX183515000Y-100965000D03*\nD12*\nX155000000Y-99000000D03*\nD13*\nX155000000Y-88840000D03*\nD24*\nX137287000Y-77724000D03*\nX142367000Y-77724000D03*\nX137287000Y-85344000D03*\nX142367000Y-85344000D03*\nX148463000Y-77724000D03*\nX153543000Y-77724000D03*\nX148463000Y-85344000D03*\nX153543000Y-85344000D03*\nX172593000Y-85344000D03*\nX167513000Y-85344000D03*\nX172593000Y-77724000D03*\nX167513000Y-77724000D03*\nX161417000Y-85344000D03*\nX156337000Y-85344000D03*\nX161417000Y-77724000D03*\nX156337000Y-77724000D03*\nX148463000Y-101219000D03*\nX153543000Y-101219000D03*\nX148463000Y-108839000D03*\nX153543000Y-108839000D03*\nX137287000Y-101219000D03*\nX142367000Y-101219000D03*\nX137287000Y-108839000D03*\nX142367000Y-108839000D03*\nX172593000Y-108712000D03*\nX167513000Y-108712000D03*\nX172593000Y-101092000D03*\nX167513000Y-101092000D03*\nX161417000Y-108712000D03*\nX156337000Y-108712000D03*\nX161417000Y-101092000D03*\nX156337000Y-101092000D03*\nD25*\nX157178971Y-64124429D03*\nX150828971Y-64124429D03*\nM02*\n" }, { "path": "src/test/resources/samples/langs/Gerber Image/simonShield-Edge.Cuts.gbr", "content": "G04 #@! TF.FileFunction,Profile,NP*\n%FSLAX46Y46*%\nG04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*\nG04 Created by KiCad (PCBNEW 4.0.6-e0-6349~53~ubuntu16.04.1) date Sat Jul 1 03:26:18 2017*\n%MOMM*%\n%LPD*%\nG01*\nG04 APERTURE LIST*\n%ADD10C,0.100000*%\n%ADD11C,0.150000*%\nG04 APERTURE END LIST*\nD10*\nD11*\nX196250000Y-118000000D02*\nX113000000Y-118000000D01*\nX196250000Y-52750000D02*\nX196250000Y-118000000D01*\nX113000000Y-52750000D02*\nX196250000Y-52750000D01*\nX113000000Y-118000000D02*\nX113000000Y-52750000D01*\nM02*\n" }, { "path": "src/test/resources/samples/langs/Gerber Image/simonShield-F.Cu.gbr", "content": "G04 #@! TF.FileFunction,Copper,L1,Top,Signal*\n%FSLAX46Y46*%\nG04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*\nG04 Created by KiCad (PCBNEW 4.0.6-e0-6349~53~ubuntu16.04.1) date Sat Jul 1 03:26:18 2017*\n%MOMM*%\n%LPD*%\nG01*\nG04 APERTURE LIST*\n%ADD10C,0.100000*%\n%ADD11C,0.150000*%\n%ADD12C,1.600000*%\n%ADD13O,1.600000X1.600000*%\n%ADD14R,2.000000X1.524000*%\n%ADD15O,2.000000X1.524000*%\n%ADD16R,1.300000X1.300000*%\n%ADD17C,1.300000*%\n%ADD18C,1.998980*%\n%ADD19R,1.900000X2.000000*%\n%ADD20C,1.900000*%\n%ADD21C,1.000000*%\n%ADD22R,1.727200X1.727200*%\n%ADD23O,1.727200X1.727200*%\n%ADD24C,1.000760*%\n%ADD25C,1.397000*%\n%ADD26C,1.600200*%\n%ADD27C,1.270000*%\n%ADD28C,0.304800*%\nG04 APERTURE END LIST*\nD10*\nD11*\nX196250000Y-118000000D02*\nX113000000Y-118000000D01*\nX196250000Y-52750000D02*\nX196250000Y-118000000D01*\nX113000000Y-52750000D02*\nX196250000Y-52750000D01*\nX113000000Y-118000000D02*\nX113000000Y-52750000D01*\nD12*\nX145400000Y-68800000D03*\nD13*\nX145400000Y-58640000D03*\nD14*\nX189230000Y-61468000D03*\nD15*\nX191770000Y-61468000D03*\nX189230000Y-74168000D03*\nX191770000Y-64008000D03*\nX189230000Y-76708000D03*\nX191770000Y-66548000D03*\nX189230000Y-79248000D03*\nX191770000Y-69088000D03*\nX189230000Y-81788000D03*\nX191770000Y-71628000D03*\nX189230000Y-84328000D03*\nX191770000Y-74168000D03*\nX189230000Y-86868000D03*\nX191770000Y-76708000D03*\nX189230000Y-89408000D03*\nX191770000Y-79248000D03*\nX189230000Y-91948000D03*\nX191770000Y-81788000D03*\nX189230000Y-94488000D03*\nX191770000Y-84328000D03*\nX189230000Y-97028000D03*\nX191770000Y-86868000D03*\nX189230000Y-99568000D03*\nX191770000Y-89408000D03*\nX191770000Y-91948000D03*\nX189230000Y-102108000D03*\nX191770000Y-94488000D03*\nX191770000Y-99568000D03*\nX191770000Y-102108000D03*\nX191770000Y-104648000D03*\nX191770000Y-107188000D03*\nX189230000Y-104648000D03*\nX189230000Y-107188000D03*\nX189230000Y-64008000D03*\nX189230000Y-66548000D03*\nX189230000Y-69088000D03*\nX189230000Y-71628000D03*\nX189230000Y-109728000D03*\nX191770000Y-109728000D03*\nX191770000Y-97028000D03*\nD14*\nX118110000Y-61468000D03*\nD15*\nX120650000Y-61468000D03*\nX118110000Y-64008000D03*\nX120650000Y-64008000D03*\nX118110000Y-66548000D03*\nX120650000Y-66548000D03*\nX118110000Y-69088000D03*\nX120650000Y-69088000D03*\nX118110000Y-71628000D03*\nX120650000Y-71628000D03*\nX118110000Y-74168000D03*\nX120650000Y-74168000D03*\nX118110000Y-76708000D03*\nX120650000Y-76708000D03*\nX118110000Y-79248000D03*\nX120650000Y-79248000D03*\nX118110000Y-81788000D03*\nX120650000Y-81788000D03*\nX118110000Y-84328000D03*\nX120650000Y-84328000D03*\nX118110000Y-86868000D03*\nX120650000Y-86868000D03*\nX118110000Y-89408000D03*\nX120650000Y-89408000D03*\nX118110000Y-91948000D03*\nX120650000Y-91948000D03*\nX118110000Y-94488000D03*\nX120650000Y-94488000D03*\nX118110000Y-97028000D03*\nX120650000Y-97028000D03*\nX118110000Y-99568000D03*\nX120650000Y-99568000D03*\nX118110000Y-102108000D03*\nX120650000Y-102108000D03*\nX118110000Y-104648000D03*\nX120650000Y-104648000D03*\nX118110000Y-107188000D03*\nX120650000Y-107188000D03*\nX118110000Y-109728000D03*\nX120650000Y-109728000D03*\nD16*\nX135255000Y-64008000D03*\nD17*\nX135255000Y-61508000D03*\nD18*\nX164465000Y-85471000D03*\nX164465000Y-77851000D03*\nD19*\nX136017000Y-72644000D03*\nD20*\nX133477000Y-72644000D03*\nD19*\nX173863000Y-72644000D03*\nD20*\nX176403000Y-72644000D03*\nD19*\nX136017000Y-96139000D03*\nD20*\nX133477000Y-96139000D03*\nD19*\nX173863000Y-96012000D03*\nD20*\nX176403000Y-96012000D03*\nD21*\nX125250000Y-112250000D03*\nX160500000Y-70500000D03*\nX167250000Y-92250000D03*\nD22*\nX127007800Y-61542700D03*\nD23*\nX129547800Y-61542700D03*\nX127007800Y-64082700D03*\nX129547800Y-64082700D03*\nD24*\nX166243000Y-67056000D03*\nX164973000Y-68326000D03*\nX164973000Y-65786000D03*\nX128143000Y-71374000D03*\nX129413000Y-72644000D03*\nX126873000Y-72644000D03*\nX181737000Y-73914000D03*\nX180467000Y-72644000D03*\nX183007000Y-72644000D03*\nX128143000Y-94742000D03*\nX129413000Y-96012000D03*\nX126873000Y-96012000D03*\nX181737000Y-97282000D03*\nX180467000Y-96012000D03*\nX183007000Y-96012000D03*\nD18*\nX134239000Y-85344000D03*\nX134239000Y-77724000D03*\nX145415000Y-85344000D03*\nX145415000Y-77724000D03*\nX175641000Y-85217000D03*\nX175641000Y-77597000D03*\nX145415000Y-108966000D03*\nX145415000Y-101346000D03*\nX134239000Y-108458000D03*\nX134239000Y-100838000D03*\nX175641000Y-108585000D03*\nX175641000Y-100965000D03*\nX164465000Y-108839000D03*\nX164465000Y-101219000D03*\nX169164000Y-62611000D03*\nX161544000Y-62611000D03*\nX169164000Y-59563000D03*\nX161544000Y-59563000D03*\nX129921000Y-85217000D03*\nX129921000Y-77597000D03*\nX126365000Y-85217000D03*\nX126365000Y-77597000D03*\nX180086000Y-85217000D03*\nX180086000Y-77597000D03*\nX183515000Y-85217000D03*\nX183515000Y-77597000D03*\nX129921000Y-108458000D03*\nX129921000Y-100838000D03*\nX126365000Y-108458000D03*\nX126365000Y-100838000D03*\nX179959000Y-108585000D03*\nX179959000Y-100965000D03*\nX183515000Y-108585000D03*\nX183515000Y-100965000D03*\nD12*\nX155000000Y-99000000D03*\nD13*\nX155000000Y-88840000D03*\nD25*\nX137287000Y-77724000D03*\nX142367000Y-77724000D03*\nX137287000Y-85344000D03*\nX142367000Y-85344000D03*\nX148463000Y-77724000D03*\nX153543000Y-77724000D03*\nX148463000Y-85344000D03*\nX153543000Y-85344000D03*\nX172593000Y-85344000D03*\nX167513000Y-85344000D03*\nX172593000Y-77724000D03*\nX167513000Y-77724000D03*\nX161417000Y-85344000D03*\nX156337000Y-85344000D03*\nX161417000Y-77724000D03*\nX156337000Y-77724000D03*\nX148463000Y-101219000D03*\nX153543000Y-101219000D03*\nX148463000Y-108839000D03*\nX153543000Y-108839000D03*\nX137287000Y-101219000D03*\nX142367000Y-101219000D03*\nX137287000Y-108839000D03*\nX142367000Y-108839000D03*\nX172593000Y-108712000D03*\nX167513000Y-108712000D03*\nX172593000Y-101092000D03*\nX167513000Y-101092000D03*\nX161417000Y-108712000D03*\nX156337000Y-108712000D03*\nX161417000Y-101092000D03*\nX156337000Y-101092000D03*\nD26*\nX157178971Y-64124429D03*\nX150828971Y-64124429D03*\nD27*\nX137287000Y-80137000D03*\nX137287000Y-83439000D03*\nX148336000Y-79629000D03*\nX148463000Y-83185000D03*\nX172593000Y-80137000D03*\nX172593000Y-83312000D03*\nX161417000Y-80010000D03*\nX161417000Y-83439000D03*\nX137287000Y-103505000D03*\nX137287000Y-106680000D03*\nX172593000Y-103378000D03*\nX172593000Y-106934000D03*\nX148463000Y-103505000D03*\nX148463000Y-106934000D03*\nX161417000Y-103759000D03*\nX161417000Y-106934000D03*\nD28*\nX137287000Y-83439000D02*\nX137287000Y-80137000D01*\nX148336000Y-83058000D02*\nX148336000Y-79629000D01*\nX148463000Y-83185000D02*\nX148336000Y-83058000D01*\nX172593000Y-83312000D02*\nX172593000Y-80137000D01*\nX161417000Y-83439000D02*\nX161417000Y-80010000D01*\nX137287000Y-106680000D02*\nX137287000Y-103505000D01*\nX172593000Y-106934000D02*\nX172593000Y-103378000D01*\nX148463000Y-106934000D02*\nX148463000Y-103505000D01*\nX161417000Y-106934000D02*\nX161417000Y-103759000D01*\nM02*\n" }, { "path": "src/test/resources/samples/langs/Gerber Image/simonShield-F.Mask.gbr", "content": "G04 #@! TF.FileFunction,Soldermask,Top*\n%FSLAX46Y46*%\nG04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*\nG04 Created by KiCad (PCBNEW 4.0.6-e0-6349~53~ubuntu16.04.1) date Sat Jul 1 03:26:18 2017*\n%MOMM*%\n%LPD*%\nG01*\nG04 APERTURE LIST*\n%ADD10C,0.100000*%\n%ADD11C,0.150000*%\n%ADD12C,2.000000*%\n%ADD13O,2.000000X2.000000*%\n%ADD14R,2.400000X1.924000*%\n%ADD15O,2.400000X1.924000*%\n%ADD16R,1.700000X1.700000*%\n%ADD17C,1.700000*%\n%ADD18C,2.398980*%\n%ADD19R,2.300000X2.400000*%\n%ADD20C,2.300000*%\n%ADD21C,4.000000*%\n%ADD22R,2.127200X2.127200*%\n%ADD23O,2.127200X2.127200*%\n%ADD24C,1.400760*%\n%ADD25C,1.797000*%\n%ADD26C,2.000200*%\nG04 APERTURE END LIST*\nD10*\nD11*\nX196250000Y-118000000D02*\nX113000000Y-118000000D01*\nX196250000Y-52750000D02*\nX196250000Y-118000000D01*\nX113000000Y-52750000D02*\nX196250000Y-52750000D01*\nX113000000Y-118000000D02*\nX113000000Y-52750000D01*\nD12*\nX145400000Y-68800000D03*\nD13*\nX145400000Y-58640000D03*\nD14*\nX189230000Y-61468000D03*\nD15*\nX191770000Y-61468000D03*\nX189230000Y-74168000D03*\nX191770000Y-64008000D03*\nX189230000Y-76708000D03*\nX191770000Y-66548000D03*\nX189230000Y-79248000D03*\nX191770000Y-69088000D03*\nX189230000Y-81788000D03*\nX191770000Y-71628000D03*\nX189230000Y-84328000D03*\nX191770000Y-74168000D03*\nX189230000Y-86868000D03*\nX191770000Y-76708000D03*\nX189230000Y-89408000D03*\nX191770000Y-79248000D03*\nX189230000Y-91948000D03*\nX191770000Y-81788000D03*\nX189230000Y-94488000D03*\nX191770000Y-84328000D03*\nX189230000Y-97028000D03*\nX191770000Y-86868000D03*\nX189230000Y-99568000D03*\nX191770000Y-89408000D03*\nX191770000Y-91948000D03*\nX189230000Y-102108000D03*\nX191770000Y-94488000D03*\nX191770000Y-99568000D03*\nX191770000Y-102108000D03*\nX191770000Y-104648000D03*\nX191770000Y-107188000D03*\nX189230000Y-104648000D03*\nX189230000Y-107188000D03*\nX189230000Y-64008000D03*\nX189230000Y-66548000D03*\nX189230000Y-69088000D03*\nX189230000Y-71628000D03*\nX189230000Y-109728000D03*\nX191770000Y-109728000D03*\nX191770000Y-97028000D03*\nD14*\nX118110000Y-61468000D03*\nD15*\nX120650000Y-61468000D03*\nX118110000Y-64008000D03*\nX120650000Y-64008000D03*\nX118110000Y-66548000D03*\nX120650000Y-66548000D03*\nX118110000Y-69088000D03*\nX120650000Y-69088000D03*\nX118110000Y-71628000D03*\nX120650000Y-71628000D03*\nX118110000Y-74168000D03*\nX120650000Y-74168000D03*\nX118110000Y-76708000D03*\nX120650000Y-76708000D03*\nX118110000Y-79248000D03*\nX120650000Y-79248000D03*\nX118110000Y-81788000D03*\nX120650000Y-81788000D03*\nX118110000Y-84328000D03*\nX120650000Y-84328000D03*\nX118110000Y-86868000D03*\nX120650000Y-86868000D03*\nX118110000Y-89408000D03*\nX120650000Y-89408000D03*\nX118110000Y-91948000D03*\nX120650000Y-91948000D03*\nX118110000Y-94488000D03*\nX120650000Y-94488000D03*\nX118110000Y-97028000D03*\nX120650000Y-97028000D03*\nX118110000Y-99568000D03*\nX120650000Y-99568000D03*\nX118110000Y-102108000D03*\nX120650000Y-102108000D03*\nX118110000Y-104648000D03*\nX120650000Y-104648000D03*\nX118110000Y-107188000D03*\nX120650000Y-107188000D03*\nX118110000Y-109728000D03*\nX120650000Y-109728000D03*\nD16*\nX135255000Y-64008000D03*\nD17*\nX135255000Y-61508000D03*\nD18*\nX164465000Y-85471000D03*\nX164465000Y-77851000D03*\nD19*\nX136017000Y-72644000D03*\nD20*\nX133477000Y-72644000D03*\nD19*\nX173863000Y-72644000D03*\nD20*\nX176403000Y-72644000D03*\nD19*\nX136017000Y-96139000D03*\nD20*\nX133477000Y-96139000D03*\nD19*\nX173863000Y-96012000D03*\nD20*\nX176403000Y-96012000D03*\nD21*\nX125250000Y-112250000D03*\nX160500000Y-70500000D03*\nX167250000Y-92250000D03*\nD22*\nX127007800Y-61542700D03*\nD23*\nX129547800Y-61542700D03*\nX127007800Y-64082700D03*\nX129547800Y-64082700D03*\nD24*\nX166243000Y-67056000D03*\nX164973000Y-68326000D03*\nX164973000Y-65786000D03*\nX128143000Y-71374000D03*\nX129413000Y-72644000D03*\nX126873000Y-72644000D03*\nX181737000Y-73914000D03*\nX180467000Y-72644000D03*\nX183007000Y-72644000D03*\nX128143000Y-94742000D03*\nX129413000Y-96012000D03*\nX126873000Y-96012000D03*\nX181737000Y-97282000D03*\nX180467000Y-96012000D03*\nX183007000Y-96012000D03*\nD18*\nX134239000Y-85344000D03*\nX134239000Y-77724000D03*\nX145415000Y-85344000D03*\nX145415000Y-77724000D03*\nX175641000Y-85217000D03*\nX175641000Y-77597000D03*\nX145415000Y-108966000D03*\nX145415000Y-101346000D03*\nX134239000Y-108458000D03*\nX134239000Y-100838000D03*\nX175641000Y-108585000D03*\nX175641000Y-100965000D03*\nX164465000Y-108839000D03*\nX164465000Y-101219000D03*\nX169164000Y-62611000D03*\nX161544000Y-62611000D03*\nX169164000Y-59563000D03*\nX161544000Y-59563000D03*\nX129921000Y-85217000D03*\nX129921000Y-77597000D03*\nX126365000Y-85217000D03*\nX126365000Y-77597000D03*\nX180086000Y-85217000D03*\nX180086000Y-77597000D03*\nX183515000Y-85217000D03*\nX183515000Y-77597000D03*\nX129921000Y-108458000D03*\nX129921000Y-100838000D03*\nX126365000Y-108458000D03*\nX126365000Y-100838000D03*\nX179959000Y-108585000D03*\nX179959000Y-100965000D03*\nX183515000Y-108585000D03*\nX183515000Y-100965000D03*\nD12*\nX155000000Y-99000000D03*\nD13*\nX155000000Y-88840000D03*\nD25*\nX137287000Y-77724000D03*\nX142367000Y-77724000D03*\nX137287000Y-85344000D03*\nX142367000Y-85344000D03*\nX148463000Y-77724000D03*\nX153543000Y-77724000D03*\nX148463000Y-85344000D03*\nX153543000Y-85344000D03*\nX172593000Y-85344000D03*\nX167513000Y-85344000D03*\nX172593000Y-77724000D03*\nX167513000Y-77724000D03*\nX161417000Y-85344000D03*\nX156337000Y-85344000D03*\nX161417000Y-77724000D03*\nX156337000Y-77724000D03*\nX148463000Y-101219000D03*\nX153543000Y-101219000D03*\nX148463000Y-108839000D03*\nX153543000Y-108839000D03*\nX137287000Y-101219000D03*\nX142367000Y-101219000D03*\nX137287000Y-108839000D03*\nX142367000Y-108839000D03*\nX172593000Y-108712000D03*\nX167513000Y-108712000D03*\nX172593000Y-101092000D03*\nX167513000Y-101092000D03*\nX161417000Y-108712000D03*\nX156337000Y-108712000D03*\nX161417000Y-101092000D03*\nX156337000Y-101092000D03*\nD26*\nX157178971Y-64124429D03*\nX150828971Y-64124429D03*\nM02*\n" }, { "path": "src/test/resources/samples/langs/Gerber Image/simonShield-F.SilkS.gbr", "content": "G04 #@! TF.FileFunction,Legend,Top*\n%FSLAX46Y46*%\nG04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*\nG04 Created by KiCad (PCBNEW 4.0.6-e0-6349~53~ubuntu16.04.1) date Sat Jul 1 03:26:18 2017*\n%MOMM*%\n%LPD*%\nG01*\nG04 APERTURE LIST*\n%ADD10C,0.100000*%\n%ADD11C,0.150000*%\n%ADD12C,0.187500*%\n%ADD13C,0.125000*%\n%ADD14C,0.300000*%\n%ADD15C,0.120000*%\n%ADD16C,0.002540*%\n%ADD17C,0.200000*%\n%ADD18C,0.170000*%\n%ADD19C,0.175000*%\n%ADD20C,0.180000*%\n%ADD21C,0.190000*%\nG04 APERTURE END LIST*\nD10*\nD11*\nX196250000Y-118000000D02*\nX113000000Y-118000000D01*\nX196250000Y-52750000D02*\nX196250000Y-118000000D01*\nX113000000Y-52750000D02*\nX196250000Y-52750000D01*\nX113000000Y-118000000D02*\nX113000000Y-52750000D01*\nD12*\nX171964285Y-68083333D02*\nX123317001Y-106767381D01*\nX123650334Y-106767381D02*\nX123745572Y-106767381D01*\nX123793191Y-106815000D01*\nX123840810Y-106910238D01*\nX123864619Y-107100714D01*\nX123864619Y-107434048D01*\nX123840810Y-107624524D01*\nX123793191Y-107719762D01*\nX123745572Y-107767381D01*\nX123650334Y-107767381D01*\nX123602715Y-107719762D01*\nX123555096Y-107624524D01*\nX123531286Y-107434048D01*\nX123531286Y-107100714D01*\nX123555096Y-106910238D01*\nX123602715Y-106815000D01*\nX123650334Y-106767381D01*\nX124031287Y-106767381D02*\nX196102429Y-69431810D01*\nD13*\nX193274334Y-66254381D02*\nX193393381Y-67254381D01*\nX193488619Y-66540095D01*\nX193583857Y-67254381D01*\nX193702905Y-66254381D01*\nX193869572Y-66968667D02*\nX194107667Y-66968667D01*\nX193821953Y-67254381D02*\nX193988620Y-66254381D01*\nX194155286Y-67254381D01*\nX194321953Y-67254381D02*\nX194321953Y-66254381D01*\nX194607667Y-67254381D02*\nX194393381Y-66682952D01*\nX194607667Y-66254381D02*\nX194321953Y-66825810D01*\nX194821953Y-66730571D02*\nX194988619Y-66730571D01*\nX195060048Y-67254381D02*\nX194821953Y-67254381D01*\nX194821953Y-66254381D01*\nX195060048Y-66254381D01*\nX195274334Y-66254381D02*\nX195274334Y-67063905D01*\nX195298143Y-67159143D01*\nX195321953Y-67206762D01*\nX195369572Y-67254381D01*\nX195464810Y-67254381D01*\nX195512429Y-67206762D01*\nX195536238Y-67159143D01*\nX195560048Y-67063905D01*\nX195560048Y-66254381D01*\nX195798144Y-67254381D02*\nX195798144Y-66254381D01*\nX195988620Y-66254381D01*\nX196036239Y-66302000D01*\nX196060048Y-66349619D01*\nX196083858Y-66444857D01*\nX196083858Y-66587714D01*\nX196060048Y-66682952D01*\nX196036239Y-66730571D01*\nX195988620Y-66778190D01*\nX195798144Y-66778190D01*\nD17*\nX193929096Y-64016000D02*\nX193833858Y-63968381D01*\nX193691001Y-63968381D01*\nX193548143Y-64016000D01*\nX193452905Y-64111238D01*\nX193405286Y-64206476D01*\nX193357667Y-64396952D01*\nX193357667Y-64539810D01*\nX193405286Y-64730286D01*\nX193452905Y-64825524D01*\nX193548143Y-64920762D01*\nX193691001Y-64968381D01*\nX193786239Y-64968381D01*\nX193929096Y-64920762D01*\nX193976715Y-64873143D01*\nX193976715Y-64539810D01*\nX193786239Y-64539810D01*\nX194405286Y-64968381D02*\nX194405286Y-63968381D01*\nX194976715Y-64968381D01*\nX194976715Y-63968381D01*\nX195452905Y-64968381D02*\nX195452905Y-63968381D01*\nX195691000Y-63968381D01*\nX195833858Y-64016000D01*\nX195929096Y-64111238D01*\nX195976715Y-64206476D01*\nX196024334Y-64396952D01*\nX196024334Y-64539810D01*\nX195976715Y-64730286D01*\nX195929096Y-64825524D01*\nX195833858Y-64920762D01*\nX195691000Y-64968381D01*\nX195452905Y-64968381D01*\nX193278286Y-61539429D02*\nX194040191Y-61539429D01*\nX193659239Y-61920381D02*\nX193659239Y-61158476D01*\nX194992572Y-60920381D02*\nX194516381Y-60920381D01*\nX194468762Y-61396571D01*\nX194516381Y-61348952D01*\nX194611619Y-61301333D01*\nX194849715Y-61301333D01*\nX194944953Y-61348952D01*\nX194992572Y-61396571D01*\nX186697905Y-84637524D01*\nX186602667Y-84732762D01*\nX186459809Y-84780381D01*\nX186221714Y-84780381D01*\nX187174095Y-84494667D02*\nX187650286Y-84494667D01*\nX187078857Y-84780381D02*\nX187412190Y-83780381D01*\nX187745524Y-84780381D01*\nD13*\nX185555048Y-81240381D02*\nX185721715Y-82240381D01*\nX185888381Y-81240381D01*\nX186055048Y-82240381D02*\nX186055048Y-81240381D01*\nX186174095Y-81240381D01*\nX186245524Y-81288000D01*\nX186293143Y-81383238D01*\nX186316952Y-81478476D01*\nX186340762Y-81668952D01*\nX186340762Y-81811810D01*\nX186316952Y-82002286D01*\nX186293143Y-82097524D01*\nX186245524Y-82192762D01*\nX186174095Y-82240381D01*\nX186055048Y-82240381D01*\nX186555048Y-82240381D02*\nX186555048Y-81240381D01*\nX186674095Y-81240381D01*\nX186745524Y-81288000D01*\nX186793143Y-81383238D01*\nX186816952Y-81478476D01*\nX186840762Y-81668952D01*\nX186840762Y-81811810D01*\nX186816952Y-82002286D01*\nX186793143Y-82097524D01*\nX186745524Y-82192762D01*\nX186674095Y-82240381D01*\nX186555048Y-82240381D01*\nX187031238Y-81954667D02*\nX187269333Y-81954667D01*\nX186983619Y-82240381D02*\nX187150286Y-81240381D01*\nX187316952Y-82240381D01*\nD17*\nX185245524Y-79700381D02*\nX185245524Y-78700381D01*\nX185483619Y-78700381D01*\nX185626477Y-78748000D01*\nX185721715Y-78843238D01*\nX185769334Y-78938476D01*\nX185816953Y-79128952D01*\nX185816953Y-79271810D01*\nX185769334Y-79462286D01*\nX185721715Y-79557524D01*\nX185626477Y-79652762D01*\nX185483619Y-79700381D01*\nX185245524Y-79700381D01*\nX186197905Y-79414667D02*\nX186674096Y-79414667D01*\nX186102667Y-79700381D02*\nX186436000Y-78700381D01*\nX186769334Y-79700381D01*\nX187674096Y-79605143D02*\nX187626477Y-79652762D01*\nX187483620Y-79700381D01*\nX187388382Y-79700381D01*\nX187245524Y-79652762D01*\nX187150286Y-79557524D01*\nX187102667Y-79462286D01*\nX187055048Y-79271810D01*\nX187055048Y-79128952D01*\nX187102667Y-78938476D01*\nX187150286Y-78843238D01*\nX187245524Y-78748000D01*\nX187388382Y-78700381D01*\nX187483620Y-78700381D01*\nX187626477Y-78748000D01*\nX187674096Y-78795619D01*\nX185745524Y-77065143D02*\nX185697905Y-77112762D01*\nX185555048Y-77160381D01*\nX185459810Y-77160381D01*\nX185316952Y-77112762D01*\nX185221714Y-77017524D01*\nX185174095Y-76922286D01*\nX185126476Y-76731810D01*\nX185126476Y-76588952D01*\nX185174095Y-76398476D01*\nX185221714Y-76303238D01*\nX185316952Y-76208000D01*\nX185459810Y-76160381D01*\nX185555048Y-76160381D01*\nX185697905Y-76208000D01*\nX185745524Y-76255619D01*\nX186174095Y-77160381D02*\nX186174095Y-76160381D01*\nX186174095Y-76636571D02*\nX186745524Y-76636571D01*\nX186745524Y-77160381D02*\nX186745524Y-76160381D01*\nX187745524Y-77160381D02*\nX187174095Y-77160381D01*\nX187459809Y-77160381D02*\nX187459809Y-76160381D01*\nX187364571Y-76303238D01*\nX187269333Y-76398476D01*\nX187174095Y-76446095D01*\nX185491524Y-74525143D02*\nX185443905Y-74572762D01*\nX185301048Y-74620381D01*\nX185205810Y-74620381D01*\nX185062952Y-74572762D01*\nX184967714Y-74477524D01*\nX184920095Y-74382286D01*\nX184872476Y-74191810D01*\nX184872476Y-74048952D01*\nX184920095Y-73858476D01*\nX184967714Y-73763238D01*\nX185062952Y-73668000D01*\nX185205810Y-73620381D01*\nX185301048Y-73620381D01*\nX185443905Y-73668000D01*\nX185491524Y-73715619D01*\nX185920095Y-74620381D02*\nX185920095Y-73620381D01*\nX185920095Y-74096571D02*\nX186491524Y-74096571D01*\nX186491524Y-74620381D02*\nX186491524Y-73620381D01*\nX186920095Y-73715619D02*\nX186967714Y-73668000D01*\nX187062952Y-73620381D01*\nX187301048Y-73620381D01*\nX187396286Y-73668000D01*\nX187443905Y-73715619D01*\nX187491524Y-73810857D01*\nX187491524Y-73906095D01*\nX187443905Y-74048952D01*\nX186872476Y-74620381D01*\nX187491524Y-74620381D01*\nX185491524Y-71985143D02*\nX185443905Y-72032762D01*\nX185301048Y-72080381D01*\nX185205810Y-72080381D01*\nX185062952Y-72032762D01*\nX184967714Y-71937524D01*\nX184920095Y-71842286D01*\nX184872476Y-71651810D01*\nX184872476Y-71508952D01*\nX184920095Y-71318476D01*\nX184967714Y-71223238D01*\nX185062952Y-71128000D01*\nX185205810Y-71080381D01*\nX185301048Y-71080381D01*\nX185443905Y-71128000D01*\nX185491524Y-71175619D01*\nX185920095Y-72080381D02*\nX185920095Y-71080381D01*\nX185920095Y-71556571D02*\nX186491524Y-71556571D01*\nX186491524Y-72080381D02*\nX186491524Y-71080381D01*\nX186872476Y-71080381D02*\nX187491524Y-71080381D01*\nX187158190Y-71461333D01*\nX187301048Y-71461333D01*\nX187396286Y-71508952D01*\nX187443905Y-71556571D01*\nX187491524Y-71651810D01*\nX187491524Y-71889905D01*\nX187443905Y-71985143D01*\nX187396286Y-72032762D01*\nX187301048Y-72080381D01*\nX187015333Y-72080381D01*\nX186920095Y-72032762D01*\nX186872476Y-71985143D01*\nD13*\nX186094762Y-68588000D02*\nX186047143Y-68540381D01*\nX185975715Y-68540381D01*\nX185904286Y-68588000D01*\nX185856667Y-68683238D01*\nX185832858Y-68778476D01*\nX185809048Y-68968952D01*\nX185809048Y-69111810D01*\nX185832858Y-69302286D01*\nX185856667Y-69397524D01*\nX185904286Y-69492762D01*\nX185975715Y-69540381D01*\nX186023334Y-69540381D01*\nX186094762Y-69492762D01*\nX186118572Y-69445143D01*\nX186118572Y-69111810D01*\nX186023334Y-69111810D01*\nX186332858Y-69540381D02*\nX186332858Y-68540381D01*\nX186618572Y-69540381D01*\nX186618572Y-68540381D01*\nX186856668Y-69540381D02*\nX186856668Y-68540381D01*\nX186975715Y-68540381D01*\nX187047144Y-68588000D01*\nX187094763Y-68683238D01*\nX187118572Y-68778476D01*\nX187142382Y-68968952D01*\nX187142382Y-69111810D01*\nX187118572Y-69302286D01*\nX187094763Y-69397524D01*\nX187047144Y-69492762D01*\nX186975715Y-69540381D01*\nX186856668Y-69540381D01*\nX187332858Y-69254667D02*\nX187570953Y-69254667D01*\nX187285239Y-69540381D02*\nX187451906Y-68540381D01*\nX187618572Y-69540381D01*\nD17*\nX185459810Y-67000381D02*\nX185459810Y-66000381D01*\nX185888381Y-66952762D02*\nX186031238Y-67000381D01*\nX186269334Y-67000381D01*\nX186364572Y-66952762D01*\nX186412191Y-66905143D01*\nX186459810Y-66809905D01*\nX186459810Y-66714667D01*\nX186412191Y-66619429D01*\nX186364572Y-66571810D01*\nX186269334Y-66524190D01*\nX186078857Y-66476571D01*\nX185983619Y-66428952D01*\nX185936000Y-66381333D01*\nX185888381Y-66286095D01*\nX185888381Y-66190857D01*\nX185936000Y-66095619D01*\nX185983619Y-66048000D01*\nX186078857Y-66000381D01*\nX186316953Y-66000381D01*\nX186459810Y-66048000D01*\nX186888381Y-67000381D02*\nX186888381Y-66000381D01*\nX170488095Y-97273810D01*\nX146122399Y-64195858D02*\nX146884304Y-64195858D01*\nX146503352Y-64576810D02*\nX146503352Y-63814905D01*\nM02*\n" }, { "path": "src/test/resources/samples/langs/Gerber Image/simonShield-drl_map.gbr", "content": "%FSLAX45Y45*%\nG04 Gerber Fmt 4.5, Leading zero omitted, Abs format (unit mm)*\nG04 Created by KiCad (PCBNEW 4.0.6-e0-6349~53~ubuntu16.04.1) date Sat Jul 1 03:26:22 2017*\n%MOMM*%\n%LPD*%\nG01*\nG04 APERTURE LIST*\n%ADD10C,0.127000*%\n%ADD11C,0.150000*%\n%ADD12C,0.200000*%\n%ADD13C,0.300000*%\nG04 APERTURE END LIST*\nD10*\nD11*\nX19625000Y-11800000D02*\nX11300000Y-11800000D01*\nX19625000Y-5275000D02*\nX19625000Y-11800000D01*\nX11300000Y-5275000D02*\nX19625000Y-5275000D01*\nX11300000Y-11800000D02*\nX11300000Y-5275000D01*\nD12*\nX12657300Y-7234400D02*\nX12717300Y-7294400D01*\nX12717300Y-7234400D02*\nX12657300Y-7294400D01*\nX12657300Y-9571200D02*\nX18270700Y-9571200D02*\nX18330700Y-9631200D01*\nX18330700Y-9571200D02*\nX18270700Y-9631200D01*\nX13764260Y-8013700D02*\nG75*\nG03X13764260Y-8013700I-35560J0D01*\nG01*\nX13764260Y-8343900D02*\nG75*\nG03X13764260Y-8343900I-35560J0D01*\nG01*\nX13764260Y-10350500D02*\nG75*\nG03X13764260Y-10350500I-35560J0D01*\nG01*\nX13764260Y-10668000D02*\nG75*\nG03X13764260Y-10668000I-35560J0D01*\nG01*\nX14869160Y-7962900D02*\nG75*\nG03X14869160Y-7962900I-35560J0D01*\nG01*\nX14881860Y-8318500D02*\nG75*\nG03X14881860Y-8318500I-35560J0D01*\nG01*\nX14881860Y-10350500D02*\nG75*\nG03X14881860Y-10350500I-35560J0D01*\nG01*\nX14881860Y-10693400D02*\nG75*\nG03X14881860Y-10693400I-35560J0D01*\nG01*\nX16177260Y-8001000D02*\nG75*\nG03X16177260Y-8001000I-35560J0D01*\nG01*\nX16177260Y-8343900D02*\nG75*\nG03X16177260Y-8343900I-35560J0D01*\nG01*\nX16177260Y-10375900D02*\nG75*\nG03X16177260Y-10375900I-35560J0D01*\nG01*\nX16177260Y-10693400D02*\nG75*\nG03X16177260Y-10693400I-35560J0D01*\nG01*\nX17294860Y-8013700D02*\nG75*\nG03X17294860Y-8013700I-35560J0D01*\nG01*\nX17294860Y-8331200D02*\nG75*\nG03X17294860Y-8331200I-35560J0D01*\nG01*\nX17294860Y-10337800D02*\nG75*\nG03X17294860Y-10337800I-35560J0D01*\nG01*\nX17294860Y-10693400D02*\nG75*\nG03X17294860Y-10693400I-35560J0D01*\nG01*\nX13525500Y-6360800D02*\nX13525500Y-6440800D01*\nX13485500Y-6400800D02*\nX13565500Y-6400800D01*\nX14540000Y-5824000D02*\nX14540000Y-5904000D01*\nX14500000Y-5864000D02*\nX14580000Y-5864000D01*\nX14540000Y-6840000D02*\nX14540000Y-6920000D01*\nX14500000Y-6880000D02*\nX14580000Y-6880000D01*\nX15500000Y-8844000D02*\nX15500000Y-8924000D01*\nX15460000Y-8884000D02*\nX15540000Y-8884000D01*\nX15500000Y-9860000D02*\nX15500000Y-9940000D01*\nX15460000Y-9900000D02*\nX15540000Y-9900000D01*\nX12586462Y-7809738D01*\nX12686538Y-7759700D02*\nG75*\nG03X12686538Y-7759700I-50038J0D01*\nG01*\nX12586462Y-8471662D02*\nX12686538Y-8571738D01*\nX12686538Y-8471662D02*\nX12586462Y-8571738D01*\nX12686538Y-8521700D02*\nG75*\nG03X12686538Y-8521700I-50038J0D01*\nG01*\nX12586462Y-10033762D02*\nX12686538Y-10133838D01*\nX12686538Y-10033762D02*\nX12586462Y-10133838D01*\nX12686538Y-10083800D02*\nG75*\nG03X12686538Y-10083800I-50038J0D01*\nG01*\nX12586462Y-10795762D02*\nX12686538Y-10895838D01*\nX12686538Y-10795762D02*\nX12586462Y-10895838D01*\nX12686538Y-10845800D02*\nG75*\nG03X12686538Y-10845800I-50038J0D01*\nG01*\nX12942062Y-7709662D02*\nX13042138Y-7809738D01*\nX13042138Y-7709662D02*\nX12942062Y-7809738D01*\nX13042138Y-7759700D02*\nG75*\nG03X13042138Y-7759700I-50038J0D01*\nG01*\nX12942062Y-8471662D02*\nX13042138Y-8571738D01*\nX13042138Y-8471662D02*\nX12942062Y-8571738D01*\nX13042138Y-8521700D02*\nG75*\nG03X13042138Y-8521700I-50038J0D01*\nG01*\nX12942062Y-10033762D02*\nX13042138Y-10133838D01*\nX13042138Y-10033762D02*\nX12942062Y-10133838D01*\nX13042138Y-10083800D02*\nG75*\nG03X13042138Y-10083800I-50038J0D01*\nG01*\nX12942062Y-10795762D02*\nX13042138Y-10895838D01*\nX13042138Y-10795762D02*\nX12942062Y-10895838D01*\nX13042138Y-10845800D02*\nG75*\nG03X13042138Y-10845800I-50038J0D01*\nG01*\nX13297662Y-7214362D02*\nX13397738Y-7314438D01*\nX13397738Y-7214362D02*\nX13297662Y-7314438D01*\nX13397738Y-7264400D02*\nG75*\nG03X13397738Y-7264400I-50038J0D01*\nG01*\nX13297662Y-9563862D02*\nX13397738Y-9663938D01*\nX13397738Y-9563862D02*\nX13297662Y-9663938D01*\nX13397738Y-9613900D02*\nG75*\nG03X13397738Y-9613900I-50038J0D01*\nG01*\nX13373862Y-7722362D02*\nX13473938Y-7822438D01*\nX13473938Y-7722362D02*\nX13373862Y-7822438D01*\nX13473938Y-7772400D02*\nG75*\nG03X13473938Y-7772400I-50038J0D01*\nG01*\nX13373862Y-8484362D02*\nX13473938Y-8584438D01*\nX13473938Y-8484362D02*\nX13373862Y-8584438D01*\nX13473938Y-8534400D02*\nG75*\nG03X13473938Y-8534400I-50038J0D01*\nG01*\nX13373862Y-10033762D02*\nX13473938Y-10133838D01*\nX13473938Y-10033762D02*\nX13373862Y-10133838D01*\nX13473938Y-10083800D02*\nG75*\nG03X13473938Y-10083800I-50038J0D01*\nG01*\nX13373862Y-10795762D02*\nX13473938Y-10895838D01*\nX13473938Y-10795762D02*\nX13373862Y-10895838D01*\nX13473938Y-10845800D02*\nG75*\nG03X13473938Y-10845800I-50038J0D01*\nG01*\nX13551662Y-7214362D02*\nX13651738Y-7314438D01*\nX13651738Y-7214362D02*\nX13551662Y-7314438D01*\nX13651738Y-7264400D02*\nG75*\nG03X13651738Y-7264400I-50038J0D01*\nG01*\nX13551662Y-9563862D02*\nX13651738Y-9663938D01*\nX13651738Y-9563862D02*\nX13551662Y-9663938D01*\nX13651738Y-9613900D02*\nG75*\nG03X13651738Y-9613900I-50038J0D01*\nG01*\nX14491462Y-7722362D02*\nX14591538Y-7822438D01*\nX14591538Y-7722362D02*\nX14491462Y-7822438D01*\nX14591538Y-7772400D02*\nG75*\nG03X14591538Y-7772400I-50038J0D01*\nG01*\nX14491462Y-8484362D02*\nX14591538Y-8584438D01*\nX14591538Y-8484362D02*\nX14491462Y-8584438D01*\nX14591538Y-8534400D02*\nG75*\nG03X14591538Y-8534400I-50038J0D01*\nG01*\nX14491462Y-10084562D02*\nX14591538Y-10184638D01*\nX14591538Y-10084562D02*\nX14491462Y-10184638D01*\nX14591538Y-10134600D02*\nG75*\nG03X14591538Y-10134600I-50038J0D01*\nG01*\nX14491462Y-10846562D02*\nX14591538Y-10946638D01*\nX14591538Y-10846562D02*\nX14491462Y-10946638D01*\nX14591538Y-10896600D02*\nG75*\nG03X14591538Y-10896600I-50038J0D01*\nG01*\nX15032859Y-6362405D02*\nX15132935Y-6462481D01*\nX15132935Y-6362405D02*\nX15032859Y-6462481D01*\nX15132935Y-6412443D02*\nG75*\nG03X15132935Y-6412443I-50038J0D01*\nG01*\nX15667859Y-6362405D02*\nX15767935Y-6462481D01*\nX15767935Y-6362405D02*\nX15667859Y-6462481D01*\nX15767935Y-6412443D02*\nG75*\nG03X15767935Y-6412443I-50038J0D01*\nG01*\nX16104362Y-5906262D02*\nX16204438Y-6006338D01*\nX16204438Y-5906262D02*\nX16104362Y-6006338D01*\nX16204438Y-5956300D02*\nG75*\nG03X16204438Y-5956300I-50038J0D01*\nG01*\nX16104362Y-6211062D02*\nX16204438Y-6311138D01*\nX16204438Y-6211062D02*\nX16104362Y-6311138D01*\nX16204438Y-6261100D02*\nG75*\nG03X16204438Y-6261100I-50038J0D01*\nG01*\nX16396462Y-7735062D02*\nX16496538Y-7835138D01*\nX16496538Y-7735062D02*\nX16396462Y-7835138D01*\nX16496538Y-7785100D02*\nG75*\nG03X16496538Y-7785100I-50038J0D01*\nG01*\nX16396462Y-8497062D02*\nX16496538Y-8597138D01*\nX16496538Y-8497062D02*\nX16396462Y-8597138D01*\nX16496538Y-8547100D02*\nG75*\nG03X16496538Y-8547100I-50038J0D01*\nG01*\nX16396462Y-10071862D02*\nX16496538Y-10171938D01*\nX16496538Y-10071862D02*\nX16396462Y-10171938D01*\nX16496538Y-10121900D02*\nG75*\nG03X16496538Y-10121900I-50038J0D01*\nG01*\nX16396462Y-10833862D02*\nX16496538Y-10933938D01*\nX16496538Y-10833862D02*\nX16396462Y-10933938D01*\nX16496538Y-10883900D02*\nG75*\nG03X16496538Y-10883900I-50038J0D01*\nG01*\nX16866362Y-5906262D02*\nX16966438Y-6006338D01*\nX16966438Y-5906262D02*\nX16866362Y-6006338D01*\nX16966438Y-5956300D02*\nG75*\nG03X16966438Y-5956300I-50038J0D01*\nG01*\nX16866362Y-6211062D02*\nX16966438Y-6311138D01*\nX16966438Y-6211062D02*\nX16866362Y-6311138D01*\nX16966438Y-6261100D02*\nG75*\nG03X16966438Y-6261100I-50038J0D01*\nG01*\nX17336262Y-7214362D02*\nX17436338Y-7314438D01*\nX17436338Y-7214362D02*\nX17336262Y-7314438D01*\nX17436338Y-7264400D02*\nG75*\nG03X17436338Y-7264400I-50038J0D01*\nG01*\nX17336262Y-9551162D02*\nX17436338Y-9651238D01*\nX17436338Y-9551162D02*\nX17336262Y-9651238D01*\nX17436338Y-9601200D02*\nG75*\nG03X17436338Y-9601200I-50038J0D01*\nG01*\nX17514062Y-7709662D02*\nX17614138Y-7809738D01*\nX17614138Y-7709662D02*\nX17514062Y-7809738D01*\nX17614138Y-7759700D02*\nG75*\nG03X17614138Y-7759700I-50038J0D01*\nG01*\nX17514062Y-8471662D02*\nX17614138Y-8571738D01*\nX17614138Y-8471662D02*\nX17514062Y-8571738D01*\nX17614138Y-8521700D02*\nG75*\nG03X17614138Y-8521700I-50038J0D01*\nG01*\nX17514062Y-10046462D02*\nX17614138Y-10146538D01*\nX17614138Y-10046462D02*\nX17514062Y-10146538D01*\nX17614138Y-10096500D02*\nG75*\nG03X17614138Y-10096500I-50038J0D01*\nG01*\nX17514062Y-10808462D02*\nX17614138Y-10908538D01*\nX17614138Y-10808462D02*\nX17514062Y-10908538D01*\nX17614138Y-10858500D02*\nG75*\nG03X17614138Y-10858500I-50038J0D01*\nG01*\nX17590262Y-7214362D02*\nX17690338Y-7314438D01*\nX17690338Y-7214362D02*\nX17590262Y-7314438D01*\nX17690338Y-7264400D02*\nG75*\nG03X17690338Y-7264400I-50038J0D01*\nG01*\nX17590262Y-9551162D02*\nX17690338Y-9651238D01*\nX17690338Y-9551162D02*\nX17590262Y-9651238D01*\nX17690338Y-9601200D02*\nG75*\nG03X17690338Y-9601200I-50038J0D01*\nG01*\nX17945862Y-10046462D02*\nX18045938Y-10146538D01*\nX18045938Y-10046462D02*\nX17945862Y-10146538D01*\nX18045938Y-10096500D02*\nG75*\nG03X18045938Y-10096500I-50038J0D01*\nG01*\nX17945862Y-10808462D02*\nX18045938Y-10908538D01*\nX18045938Y-10808462D02*\nX17945862Y-10908538D01*\nX18045938Y-10858500D02*\nG75*\nG03X18045938Y-10858500I-50038J0D01*\nG01*\nX17958562Y-7709662D02*\nX18058638Y-7809738D01*\nX18058638Y-7709662D02*\nX17958562Y-7809738D01*\nX18058638Y-7759700D02*\nG75*\nG03X18058638Y-7759700I-50038J0D01*\nG01*\nX17958562Y-8471662D02*\nX18058638Y-8571738D01*\nX18058638Y-8471662D02*\nX17958562Y-8571738D01*\nX18058638Y-8521700D02*\nG75*\nG03X18058638Y-8521700I-50038J0D01*\nG01*\nX18301462Y-7709662D02*\nX18401538Y-7809738D01*\nX18401538Y-7709662D02*\nX18301462Y-7809738D01*\nX18401538Y-7759700D02*\nG75*\nG03X18401538Y-7759700I-50038J0D01*\nG01*\nX18301462Y-8471662D02*\nX18401538Y-8571738D01*\nX18401538Y-8471662D02*\nX18301462Y-8571738D01*\nX18401538Y-8521700D02*\nG75*\nG03X18401538Y-8521700I-50038J0D01*\nG01*\nX18301462Y-10046462D02*\nX18401538Y-10146538D01*\nX18401538Y-10046462D02*\nX18301462Y-10146538D01*\nX18401538Y-10096500D02*\nG75*\nG03X18401538Y-10096500I-50038J0D01*\nG01*\nX18301462Y-10808462D02*\nX18401538Y-10908538D01*\nX18401538Y-10808462D02*\nX18301462Y-10908538D01*\nX18401538Y-10858500D02*\nG75*\nG03X18401538Y-10858500I-50038J0D01*\nG01*\nX11760200Y-6096000D02*\nX11861800Y-6197600D01*\nX11861800Y-6096000D02*\nX18872200Y-10668000D02*\nX18973800Y-10769600D01*\nX18973800Y-10668000D02*\nX18872200Y-10769600D01*\nX18923000Y-10668000D02*\nX18923000Y-10769600D01*\nX18872200Y-10718800D02*\nX18973800Y-10718800D01*\nX18872200Y-10922000D02*\nX18973800Y-11023600D01*\nX18973800Y-10922000D02*\nX18872200Y-11023600D01*\nX18923000Y-10922000D02*\nX18923000Y-11023600D01*\nX18872200Y-10972800D02*\nX18973800Y-10972800D01*\nX19126200Y-6096000D02*\nX19227800Y-6197600D01*\nX19227800Y-6096000D02*\nX19126200Y-6197600D01*\nX19177000Y-6096000D02*\nX19177000Y-6197600D01*\nX19126200Y-6146800D02*\nX19227800Y-6146800D01*\nX19126200Y-6350000D02*\nX19227800Y-6451600D01*\nX19227800Y-6350000D02*\nX19126200Y-6451600D01*\nX19177000Y-6350000D02*\nX19177000Y-6451600D01*\nX19126200Y-6400800D02*\nX19227800Y-6400800D01*\nX19126200Y-6604000D02*\nX19227800Y-6705600D01*\nX19227800Y-6604000D02*\nX19126200Y-6705600D01*\nX19177000Y-6604000D02*\nX19177000Y-6705600D01*\nX19126200Y-6654800D02*\nX19227800Y-6654800D01*\nX19126200Y-6858000D02*\nX19227800Y-6959600D01*\nX19227800Y-6858000D02*\nX19126200Y-6959600D01*\nX19177000Y-6858000D02*\nX19177000Y-6959600D01*\nX19126200Y-6908800D02*\nX19227800Y-6908800D01*\nX19126200Y-7112000D02*\nX19227800Y-7213600D01*\nX19227800Y-7112000D02*\nX19126200Y-7213600D01*\nX19177000Y-7112000D02*\nX19177000Y-7213600D01*\nX19126200Y-7162800D02*\nX19227800Y-7162800D01*\nX19126200Y-7366000D02*\nX19227800Y-7467600D01*\nX19227800Y-7366000D02*\nX19126200Y-7467600D01*\nX19177000Y-7366000D02*\nX19177000Y-7467600D01*\nX19126200Y-7416800D02*\nX19227800Y-7416800D01*\nX19126200Y-7620000D02*\nX19227800Y-7721600D01*\nX19227800Y-7620000D02*\nX19126200Y-7721600D01*\nX19177000Y-7620000D02*\nX19177000Y-7721600D01*\nX19126200Y-7670800D02*\nX19227800Y-7670800D01*\nX19126200Y-7874000D02*\nX19227800Y-7975600D01*\nX19227800Y-7874000D02*\nX19126200Y-7975600D01*\nX19177000Y-7874000D02*\nX19177000Y-7975600D01*\nX19126200Y-7924800D02*\nX19227800Y-7924800D01*\nX19126200Y-8128000D02*\nX19227800Y-8229600D01*\nX19227800Y-8128000D02*\nX19126200Y-8229600D01*\nX19177000Y-8128000D02*\nX19177000Y-8229600D01*\nX19126200Y-8178800D02*\nX19227800Y-8178800D01*\nX19126200Y-8382000D02*\nX19227800Y-8483600D01*\nX19227800Y-8382000D02*\nX19126200Y-8483600D01*\nX19177000Y-8382000D02*\nX19177000Y-8483600D01*\nX19126200Y-8432800D02*\nX19227800Y-8432800D01*\nX19126200Y-8636000D02*\nX19227800Y-8737600D01*\nX19227800Y-8636000D02*\nX19126200Y-8737600D01*\nX19177000Y-8636000D02*\nX19177000Y-8737600D01*\nX19126200Y-8686800D02*\nX19227800Y-8686800D01*\nX19126200Y-8890000D02*\nX19227800Y-8991600D01*\nX19227800Y-8890000D02*\nX19126200Y-8991600D01*\nX19177000Y-8890000D02*\nX19177000Y-8991600D01*\nX19126200Y-8940800D02*\nX19227800Y-8940800D01*\nX19126200Y-9144000D02*\nX19227800Y-9245600D01*\nX19227800Y-9144000D02*\nX19126200Y-9245600D01*\nX19177000Y-9144000D02*\nX19177000Y-9245600D01*\nX19126200Y-9194800D02*\nX19227800Y-9194800D01*\nX19126200Y-9398000D02*\nX19227800Y-9499600D01*\nX19227800Y-9398000D02*\nX19126200Y-9499600D01*\nX19177000Y-9398000D02*\nX19177000Y-9499600D01*\nX19126200Y-9448800D02*\nX19227800Y-9448800D01*\nX19126200Y-9652000D02*\nX19227800Y-9753600D01*\nX19227800Y-9652000D02*\nX19126200Y-9753600D01*\nX19177000Y-9652000D02*\nX19177000Y-9753600D01*\nX19126200Y-9702800D02*\nX19227800Y-9702800D01*\nX19126200Y-9906000D02*\nX19227800Y-10007600D01*\nX19227800Y-9906000D02*\nX19126200Y-10007600D01*\nX19177000Y-9906000D02*\nX19177000Y-10007600D01*\nX19126200Y-9956800D02*\nX19227800Y-9956800D01*\nX19126200Y-10160000D02*\nX19227800Y-10261600D01*\nX19227800Y-10160000D02*\nX19126200Y-10261600D01*\nX19177000Y-10160000D02*\nX19177000Y-10261600D01*\nX19126200Y-10210800D02*\nX19227800Y-10210800D01*\nX19126200Y-10414000D02*\nX19227800Y-10515600D01*\nX19227800Y-10414000D02*\nX19126200Y-10515600D01*\nX19177000Y-10414000D02*\nX19177000Y-10515600D01*\nX19126200Y-10464800D02*\nX19227800Y-10464800D01*\nX19126200Y-10668000D02*\nX19227800Y-10769600D01*\nX19227800Y-10668000D02*\nX19126200Y-10769600D01*\nX19177000Y-10668000D02*\nX19177000Y-10769600D01*\nX19126200Y-10718800D02*\nX19227800Y-10718800D01*\nX19126200Y-10922000D02*\nX19227800Y-11023600D01*\nX19227800Y-10922000D02*\nX19126200Y-11023600D01*\nX19177000Y-10922000D02*\nX19177000Y-11023600D01*\nX19126200Y-10972800D02*\nX19227800Y-10972800D01*\nD13*\nX11563928Y-12273214D02*\nX11563928Y-11973214D01*\nX11635357Y-11973214D01*\nX11678214Y-11987500D01*\nX11706786Y-12016071D01*\nX11721071Y-12044643D01*\nX11735357Y-12101786D01*\nX11735357Y-12144643D01*\nX11721071Y-12201786D01*\nX11706786Y-12230357D01*\nX11678214Y-12258929D01*\nX11635357Y-12273214D01*\nX11563928Y-12273214D01*\nX11863928Y-12273214D02*\nX11863928Y-12073214D01*\nX11863928Y-12130357D02*\nX11878214Y-12101786D01*\nX11892500Y-12087500D01*\nX11921071Y-12073214D01*\nX11949643Y-12073214D01*\nX12049643Y-12273214D02*\nX12049643Y-12073214D01*\nX12049643Y-11973214D02*\nX12035357Y-11987500D01*\nX12049643Y-12001786D01*\nX12063928Y-11987500D01*\nX12049643Y-11973214D01*\nX18121071Y-12688929D01*\nX18106786Y-12646071D01*\nX18092500Y-12617500D01*\nX18063929Y-12574643D01*\nX18049643Y-12560357D01*\nX11292500Y-13163500D02*\nG75*\nG03X11292500Y-13163500I-35560J0D01*\nG01*\nX11621071Y-12999214D02*\nX11649643Y-12999214D01*\nX11678214Y-13013500D01*\nX11692500Y-13027786D01*\nX11706786Y-13056357D01*\nX11721071Y-13113500D01*\nX11721071Y-13184929D01*\nX11706786Y-13242071D01*\nX11692500Y-13270643D01*\nX12706786Y-13509500D01*\nX12735357Y-13495214D01*\nX12778214Y-13495214D01*\nX12806786Y-13509500D01*\nX12821071Y-13538071D01*\nX12821071Y-13695214D01*\nX12963928Y-13695214D02*\nX12963928Y-13495214D01*\nX12963928Y-13523786D02*\nX12978214Y-13509500D01*\nX13006786Y-13495214D01*\nX13049643Y-13495214D01*\nX13078214Y-13509500D01*\nX13092500Y-13538071D01*\nX13092500Y-13695214D01*\nX13092500Y-13538071D02*\nX13106786Y-13509500D01*\nX13135357Y-13495214D01*\nX13178214Y-13495214D01*\nX13206786Y-13509500D01*\nX13221071Y-13538071D01*\nX13221071Y-13695214D01*\nX13806786Y-13380929D02*\nX13549643Y-13766643D01*\nX14192500Y-13395214D02*\nX14221071Y-13395214D01*\nX14249643Y-13409500D01*\nX14263928Y-13423786D01*\nX14278214Y-13452357D01*\nX14292500Y-13509500D01*\nX14292500Y-13580929D01*\nX14278214Y-13638071D01*\nX14263928Y-13666643D01*\nX14249643Y-13680929D01*\nX14221071Y-13695214D01*\nX14192500Y-13695214D01*\nX14163928Y-13680929D01*\nX14149643Y-13666643D01*\nX14135357Y-13638071D01*\nX14121071Y-13580929D01*\nX14121071Y-13509500D01*\nX14135357Y-13452357D01*\nX14149643Y-13423786D01*\nX14163928Y-13409500D01*\nX14192500Y-13395214D01*\nX14421071Y-13666643D02*\nX14435357Y-13680929D01*\nX14421071Y-13695214D01*\nX14406786Y-13680929D01*\nX14421071Y-13666643D01*\nX14421071Y-13695214D01*\nX14621071Y-13395214D02*\nX14649643Y-13395214D01*\nX14678214Y-13409500D01*\nX14692500Y-13423786D01*\nX14706785Y-13452357D01*\nX14721071Y-13509500D01*\nX14721071Y-13580929D01*\nX14706785Y-13638071D01*\nX14692500Y-13666643D01*\nX14678214Y-13680929D01*\nX14649643Y-13695214D01*\nX14621071Y-13695214D01*\nX14592500Y-13680929D01*\nX14578214Y-13666643D01*\nX14563928Y-13638071D01*\nX14549643Y-13580929D01*\nX14549643Y-13509500D01*\nX14563928Y-13452357D01*\nX14578214Y-13423786D01*\nX14592500Y-13409500D01*\nX14621071Y-13395214D01*\nX14821071Y-13395214D02*\nX15006785Y-13395214D01*\nX14906785Y-13509500D01*\nX14949643Y-13509500D01*\nX14978214Y-13523786D01*\nX14992500Y-13538071D01*\nX15006785Y-13566643D01*\nX11292500Y-14797538D01*\nX11292500Y-14697462D02*\nX11192424Y-14797538D01*\nX11292500Y-14747500D02*\nG75*\nG03X11292500Y-14747500I-50038J0D01*\nG01*\nX11721071Y-14883214D02*\nX11549643Y-14883214D01*\nX11635357Y-14883214D02*\nX11635357Y-14583214D01*\nX11606786Y-14626071D01*\nX11578214Y-14654643D01*\nX18135357Y-15136357D01*\nX18121071Y-15064929D01*\nX18106786Y-15022071D01*\nX18092500Y-14993500D01*\nX18063929Y-14950643D01*\nX18049643Y-14936357D01*\nM02*\n" }, { "path": "src/test/resources/samples/langs/Gnuplot/dashcolor.1.gnu", "content": "# set terminal pngcairo background \"#ffffff\" fontscale 1.0 dashed size 640, 480 \n# set output 'dashcolor.1.png'\nset label 1 \"set style line 1 lt 2 lc rgb \\\"red\\\" lw 3\" at -0.4, -0.25, 0 left norotate back textcolor rgb \"red\" nopoint offset character 0, 0, 0\nset label 2 \"set style line 2 lt 2 lc rgb \\\"orange\\\" lw 2\" at -0.4, -0.35, 0 left norotate back textcolor rgb \"orange\" nopoint offset character 0, 0, 0\nset label 3 \"set style line 3 lt 2 lc rgb \\\"yellow\\\" lw 3\" at -0.4, -0.45, 0 left norotate back textcolor rgb \"yellow\" nopoint offset character 0, 0, 0\nset label 4 \"set style line 4 lt 2 lc rgb \\\"green\\\" lw 2\" at -0.4, -0.55, 0 left norotate back textcolor rgb \"green\" nopoint offset character 0, 0, 0\nset label 5 \"plot ... lt 1 lc 3 \" at -0.4, -0.65, 0 left norotate back textcolor lt 3 nopoint offset character 0, 0, 0\nset label 6 \"plot ... lt 3 lc 3 \" at -0.4, -0.75, 0 left norotate back textcolor lt 3 nopoint offset character 0, 0, 0\nset label 7 \"plot ... lt 5 lc 3 \" at -0.4, -0.85, 0 left norotate back textcolor lt 3 nopoint offset character 0, 0, 0\nset style line 1 linetype 2 linecolor rgb \"red\" linewidth 3.000 pointtype 2 pointsize default pointinterval 0\nset style line 2 linetype 2 linecolor rgb \"orange\" linewidth 2.000 pointtype 2 pointsize default pointinterval 0\nset style line 3 linetype 2 linecolor rgb \"yellow\" linewidth 3.000 pointtype 2 pointsize default pointinterval 0\nset style line 4 linetype 2 linecolor rgb \"green\" linewidth 2.000 pointtype 2 pointsize default pointinterval 0\nset noxtics\nset noytics\nset title \"Independent colors and dot/dash styles\" \nset xlabel \"You will only see dashed lines if your current terminal setting permits it\" \nset xrange [ -0.500000 : 3.50000 ] noreverse nowriteback\nset yrange [ -1.00000 : 1.40000 ] noreverse nowriteback\nset bmargin 7\nunset colorbox\nplot cos(x) ls 1 title 'ls 1', cos(x-.2) ls 2 title 'ls 2', cos(x-.4) ls 3 title 'ls 3', cos(x-.6) ls 4 title 'ls 4', cos(x-.8) lt 1 lc 3 title 'lt 1 lc 3', cos(x-1.) lt 3 lc 3 title 'lt 3 lc 3', cos(x-1.2) lt 5 lc 3 title 'lt 5 lc 3'\n" }, { "path": "src/test/resources/samples/langs/Gnuplot/histograms.2.gnu", "content": "# set terminal pngcairo transparent enhanced font \"arial,10\" fontscale 1.0 size 500, 350 \n# set output 'histograms.2.png'\nset boxwidth 0.9 absolute\nset style fill solid 1.00 border lt -1\nset key inside right top vertical Right noreverse noenhanced autotitles nobox\nset style histogram clustered gap 1 title offset character 0, 0, 0\nset datafile missing '-'\nset style data histograms\nset xtics border in scale 0,0 nomirror rotate by -45 offset character 0, 0, 0 autojustify\nset xtics norangelimit font \",8\"\nset xtics ()\nset title \"US immigration from Northern Europe\\nPlot selected data columns as histogram of clustered boxes\" \nset yrange [ 0.00000 : 300000. ] noreverse nowriteback\ni = 22\nplot 'immigration.dat' using 6:xtic(1) ti col, '' u 12 ti col, '' u 13 ti col, '' u 14 ti col\n" }, { "path": "src/test/resources/samples/langs/Gnuplot/rates.gp", "content": "#!/usr/bin/env gnuplot\n\nreset\n\nset terminal png\nset output 'rates100.png'\n\nset xlabel \"A2A price\"\nset ylabel \"Response Rate\"\n\n#set xr [0:5]\n#set yr [0:6]\n\nplot 'rates100.dat' pt 7 notitle\n" }, { "path": "src/test/resources/samples/langs/Gnuplot/surface1.16.gnu", "content": "# set terminal pngcairo transparent enhanced font \"arial,10\" fontscale 1.0 size 500, 350 \n# set output 'surface1.16.png'\nset dummy u,v\nset label 1 \"increasing v\" at 6, 0, -1 left norotate back nopoint offset character 0, 0, 0\nset label 2 \"u=0\" at 5, 6.5, -1 left norotate back nopoint offset character 0, 0, 0\nset label 3 \"u=1\" at 5, 6.5, 0.100248 left norotate back nopoint offset character 0, 0, 0\nset arrow 1 from 5, -5, -1.2 to 5, 5, -1.2 head back nofilled linetype -1 linewidth 1.000\nset arrow 2 from 5, 6, -1 to 5, 5, -1 head back nofilled linetype -1 linewidth 1.000\nset arrow 3 from 5, 6, 0.100248 to 5, 5, 0.100248 head back nofilled linetype -1 linewidth 1.000\nset parametric\nset view 70, 20, 1, 1\nset samples 51, 51\nset isosamples 2, 33\nset hidden3d back offset 1 trianglepattern 3 undefined 1 altdiagonal bentover\nset ztics -1.00000,0.25,1.00000 norangelimit\nset title \"\\\"fence plot\\\" using separate parametric surfaces\" \nset xlabel \"X axis\" \nset xlabel offset character -3, -2, 0 font \"\" textcolor lt -1 norotate\nset xrange [ -5.00000 : 5.00000 ] noreverse nowriteback\nset ylabel \"Y axis\" \nset ylabel offset character 3, -2, 0 font \"\" textcolor lt -1 rotate by -270\nset yrange [ -5.00000 : 5.00000 ] noreverse nowriteback\nset zlabel \"Z axis\" \nset zlabel offset character -5, 0, 0 font \"\" textcolor lt -1 norotate\nset zrange [ -1.00000 : 1.00000 ] noreverse nowriteback\nsinc(u,v) = sin(sqrt(u**2+v**2)) / sqrt(u**2+v**2)\nGPFUN_sinc = \"sinc(u,v) = sin(sqrt(u**2+v**2)) / sqrt(u**2+v**2)\"\nxx = 6.08888888888889\ndx = 1.10888888888889\nx0 = -5\nx1 = -3.89111111111111\nx2 = -2.78222222222222\nx3 = -1.67333333333333\nx4 = -0.564444444444444\nx5 = 0.544444444444445\nx6 = 1.65333333333333\nx7 = 2.76222222222222\nx8 = 3.87111111111111\nx9 = 4.98\nsplot [u=0:1][v=-4.99:4.99] \tx0, v, (u<0.5) ? -1 : sinc(x0,v) notitle, \tx1, v, (u<0.5) ? -1 : sinc(x1,v) notitle, \tx2, v, (u<0.5) ? -1 : sinc(x2,v) notitle, \tx3, v, (u<0.5) ? -1 : sinc(x3,v) notitle, \tx4, v, (u<0.5) ? -1 : sinc(x4,v) notitle, \tx5, v, (u<0.5) ? -1 : sinc(x5,v) notitle, \tx6, v, (u<0.5) ? -1 : sinc(x6,v) notitle, \tx7, v, (u<0.5) ? -1 : sinc(x7,v) notitle, \tx8, v, (u<0.5) ? -1 : sinc(x8,v) notitle, \tx9, v, (u<0.5) ? -1 : sinc(x9,v) notitle\n" }, { "path": "src/test/resources/samples/langs/Gnuplot/surface1.17.gnu", "content": "# set terminal pngcairo transparent enhanced font \"arial,10\" fontscale 1.0 size 500, 350 \n# set output 'surface1.17.png'\nset dummy u,v\nset label 1 \"increasing v\" at 6, 0, -1 left norotate back nopoint offset character 0, 0, 0\nset label 2 \"increasing u\" at 0, -5, -1.5 left norotate back nopoint offset character 0, 0, 0\nset label 3 \"floor(u)%3=0\" at 5, 6.5, -1 left norotate back nopoint offset character 0, 0, 0\nset label 4 \"floor(u)%3=1\" at 5, 6.5, 0.100248 left norotate back nopoint offset character 0, 0, 0\nset arrow 1 from 5, -5, -1.2 to 5, 5, -1.2 head back nofilled linetype -1 linewidth 1.000\nset arrow 2 from -5, -5, -1.2 to 5, -5, -1.2 head back nofilled linetype -1 linewidth 1.000\nset arrow 3 from 5, 6, -1 to 5, 5, -1 head back nofilled linetype -1 linewidth 1.000\nset arrow 4 from 5, 6, 0.100248 to 5, 5, 0.100248 head back nofilled linetype -1 linewidth 1.000\nset parametric\nset view 70, 20, 1, 1\nset samples 51, 51\nset isosamples 30, 33\nset hidden3d back offset 1 trianglepattern 3 undefined 1 altdiagonal bentover\nset ztics -1.00000,0.25,1.00000 norangelimit\nset title \"\\\"fence plot\\\" using single parametric surface with undefined points\" \nset xlabel \"X axis\" \nset xlabel offset character -3, -2, 0 font \"\" textcolor lt -1 norotate\nset xrange [ -5.00000 : 5.00000 ] noreverse nowriteback\nset ylabel \"Y axis\" \nset ylabel offset character 3, -2, 0 font \"\" textcolor lt -1 rotate by -270\nset yrange [ -5.00000 : 5.00000 ] noreverse nowriteback\nset zlabel \"Z axis\" \nset zlabel offset character -5, 0, 0 font \"\" textcolor lt -1 norotate\nset zrange [ -1.00000 : 1.00000 ] noreverse nowriteback\nsinc(u,v) = sin(sqrt(u**2+v**2)) / sqrt(u**2+v**2)\nGPFUN_sinc = \"sinc(u,v) = sin(sqrt(u**2+v**2)) / sqrt(u**2+v**2)\"\nxx = 6.08888888888889\ndx = 1.11\nx0 = -5\nx1 = -3.89111111111111\nx2 = -2.78222222222222\nx3 = -1.67333333333333\nx4 = -0.564444444444444\nx5 = 0.544444444444445\nx6 = 1.65333333333333\nx7 = 2.76222222222222\nx8 = 3.87111111111111\nx9 = 4.98\nxmin = -4.99\nxmax = 5\nn = 10\nzbase = -1\nsplot [u=.5:3*n-.5][v=-4.99:4.99] \t xmin+floor(u/3)*dx, v, ((floor(u)%3)==0) ? zbase : \t\t\t (((floor(u)%3)==1) ? sinc(xmin+u/3.*dx,v) : 1/0) notitle\n" }, { "path": "src/test/resources/samples/langs/Gnuplot/world2.1.gnu", "content": "# set terminal pngcairo transparent enhanced font \"arial,10\" fontscale 1.0 size 500, 350 \n# set output 'world2.1.png'\nunset border\nset dummy u,v\nset angles degrees\nset parametric\nset view 60, 136, 1.22, 1.26\nset samples 64, 64\nset isosamples 13, 13\nset mapping spherical\nset noxtics\nset noytics\nset noztics\nset title \"Labels colored by GeV plotted in spherical coordinate system\" \nset urange [ -90.0000 : 90.0000 ] noreverse nowriteback\nset vrange [ 0.00000 : 360.000 ] noreverse nowriteback\nset cblabel \"GeV\" \nset cbrange [ 0.00000 : 8.00000 ] noreverse nowriteback\nset colorbox user\nset colorbox vertical origin screen 0.9, 0.2, 0 size screen 0.02, 0.75, 0 front bdefault\nsplot cos(u)*cos(v),cos(u)*sin(v),sin(u) notitle with lines lt 5, 'world.dat' notitle with lines lt 2, 'srl.dat' using 3:2:(1):1:4 with labels notitle point pt 6 lw .1 left offset 1,0 font \"Helvetica,7\" tc pal\n" }, { "path": "src/test/resources/samples/langs/Go/api.pb.go", "content": "// Code generated by protoc-gen-gogo.\n// source: api.proto\n// DO NOT EDIT!\n\n/*\n\tPackage proto is a generated protocol buffer package.\n\n\tIt is generated from these files:\n\t\tapi.proto\n\t\tconfig.proto\n\t\tdata.proto\n\t\terrors.proto\n\t\tgossip.proto\n\t\theartbeat.proto\n\t\tinternal.proto\n\n\tIt has these top-level messages:\n\t\tClientCmdID\n\t\tRequestHeader\n\t\tResponseHeader\n\t\tContainsRequest\n\t\tContainsResponse\n\t\tGetRequest\n\t\tGetResponse\n\t\tPutRequest\n\t\tPutResponse\n\t\tConditionalPutRequest\n\t\tConditionalPutResponse\n\t\tIncrementRequest\n\t\tIncrementResponse\n\t\tDeleteRequest\n\t\tDeleteResponse\n\t\tDeleteRangeRequest\n\t\tDeleteRangeResponse\n\t\tScanRequest\n\t\tScanResponse\n\t\tEndTransactionRequest\n\t\tEndTransactionResponse\n\t\tReapQueueRequest\n\t\tReapQueueResponse\n\t\tEnqueueUpdateRequest\n\t\tEnqueueUpdateResponse\n\t\tEnqueueMessageRequest\n\t\tEnqueueMessageResponse\n\t\tRequestUnion\n\t\tResponseUnion\n\t\tBatchRequest\n\t\tBatchResponse\n\t\tAdminSplitRequest\n\t\tAdminSplitResponse\n\t\tAdminMergeRequest\n\t\tAdminMergeResponse\n*/\npackage proto\n\nimport proto1 \"github.com/gogo/protobuf/proto\"\nimport math \"math\"\n\n// discarding unused import gogoproto \"github.com/gogo/protobuf/gogoproto/gogo.pb\"\n\n// Reference imports to suppress errors if they are not otherwise used.\nvar _ = proto1.Marshal\nvar _ = math.Inf\n\n// ClientCmdID provides a unique ID for client commands. Clients which\n// provide ClientCmdID gain operation idempotence. In other words,\n// clients can submit the same command multiple times and always\n// receive the same response. This is common on retries over flaky\n// networks. However, the system imposes a limit on how long\n// idempotence is provided. Retries over an hour old are not\n// guaranteed idempotence and may be executed more than once with\n// potentially different results.\n//\n// ClientCmdID contains the client's timestamp and a client-generated\n// random number. The client Timestamp is specified in unix\n// nanoseconds and is used for some uniqueness but also to provide a\n// rough ordering of requests, useful for data locality on the\n// server. The Random is specified for additional uniqueness.\n// NOTE: An accurate time signal IS NOT required for correctness.\ntype ClientCmdID struct {\n\t// Nanoseconds since Unix epoch.\n\tWallTime int64 `protobuf:\"varint,1,opt,name=wall_time\" json:\"wall_time\"`\n\tRandom int64 `protobuf:\"varint,2,opt,name=random\" json:\"random\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *ClientCmdID) Reset() { *m = ClientCmdID{} }\nfunc (m *ClientCmdID) String() string { return proto1.CompactTextString(m) }\nfunc (*ClientCmdID) ProtoMessage() {}\n\nfunc (m *ClientCmdID) GetWallTime() int64 {\n\tif m != nil {\n\t\treturn m.WallTime\n\t}\n\treturn 0\n}\n\nfunc (m *ClientCmdID) GetRandom() int64 {\n\tif m != nil {\n\t\treturn m.Random\n\t}\n\treturn 0\n}\n\n// RequestHeader is supplied with every storage node request.\ntype RequestHeader struct {\n\t// Timestamp specifies time at which read or writes should be\n\t// performed. If the timestamp is set to zero value, its value\n\t// is initialized to the wall time of the receiving node.\n\tTimestamp Timestamp `protobuf:\"bytes,1,opt,name=timestamp\" json:\"timestamp\"`\n\t// CmdID is optionally specified for request idempotence\n\t// (i.e. replay protection).\n\tCmdID ClientCmdID `protobuf:\"bytes,2,opt,name=cmd_id\" json:\"cmd_id\"`\n\t// The key for request. If the request operates on a range, this\n\t// represents the starting key for the range.\n\tKey Key `protobuf:\"bytes,3,opt,name=key,customtype=Key\" json:\"key\"`\n\t// End key is empty if request spans only a single key.\n\tEndKey Key `protobuf:\"bytes,4,opt,name=end_key,customtype=Key\" json:\"end_key\"`\n\t// User is the originating user. Used to lookup priority when\n\t// scheduling queued operations at target node.\n\tUser string `protobuf:\"bytes,5,opt,name=user\" json:\"user\"`\n\t// Replica specifies the destination for the request. This is a specific\n\t// instance of the available replicas belonging to RangeID.\n\tReplica Replica `protobuf:\"bytes,6,opt,name=replica\" json:\"replica\"`\n\t// RaftID specifies the ID of the Raft consensus group which the key\n\t// range belongs to. This is used by the receiving node to route the\n\t// request to the correct range.\n\tRaftID int64 `protobuf:\"varint,7,opt,name=raft_id\" json:\"raft_id\"`\n\t// UserPriority specifies priority multiple for non-transactional\n\t// commands. This value should be a positive integer [1, 2^31-1).\n\t// It's properly viewed as a multiple for how likely this\n\t// transaction will be to prevail if a write conflict occurs.\n\t// Commands with UserPriority=100 will be 100x less likely to be\n\t// aborted as conflicting transactions or non-transactional commands\n\t// with UserPriority=1. This value is ignored if Txn is\n\t// specified. If neither this value nor Txn is specified, the value\n\t// defaults to 1.\n\tUserPriority *int32 `protobuf:\"varint,8,opt,name=user_priority,def=1\" json:\"user_priority,omitempty\"`\n\t// Txn is set non-nil if a transaction is underway. To start a txn,\n\t// the first request should set this field to non-nil with name and\n\t// isolation level set as desired. The response will contain the\n\t// fully-initialized transaction with txn ID, priority, initial\n\t// timestamp, and maximum timestamp.\n\tTxn *Transaction `protobuf:\"bytes,9,opt,name=txn\" json:\"txn,omitempty\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *RequestHeader) Reset() { *m = RequestHeader{} }\nfunc (m *RequestHeader) String() string { return proto1.CompactTextString(m) }\nfunc (*RequestHeader) ProtoMessage() {}\n\nconst Default_RequestHeader_UserPriority int32 = 1\n\nfunc (m *RequestHeader) GetTimestamp() Timestamp {\n\tif m != nil {\n\t\treturn m.Timestamp\n\t}\n\treturn Timestamp{}\n}\n\nfunc (m *RequestHeader) GetCmdID() ClientCmdID {\n\tif m != nil {\n\t\treturn m.CmdID\n\t}\n\treturn ClientCmdID{}\n}\n\nfunc (m *RequestHeader) GetUser() string {\n\tif m != nil {\n\t\treturn m.User\n\t}\n\treturn \"\"\n}\n\nfunc (m *RequestHeader) GetReplica() Replica {\n\tif m != nil {\n\t\treturn m.Replica\n\t}\n\treturn Replica{}\n}\n\nfunc (m *RequestHeader) GetRaftID() int64 {\n\tif m != nil {\n\t\treturn m.RaftID\n\t}\n\treturn 0\n}\n\nfunc (m *RequestHeader) GetUserPriority() int32 {\n\tif m != nil && m.UserPriority != nil {\n\t\treturn *m.UserPriority\n\t}\n\treturn Default_RequestHeader_UserPriority\n}\n\nfunc (m *RequestHeader) GetTxn() *Transaction {\n\tif m != nil {\n\t\treturn m.Txn\n\t}\n\treturn nil\n}\n\n// ResponseHeader is returned with every storage node response.\ntype ResponseHeader struct {\n\t// Error is non-nil if an error occurred.\n\tError *Error `protobuf:\"bytes,1,opt,name=error\" json:\"error,omitempty\"`\n\t// Timestamp specifies time at which read or write actually was\n\t// performed. In the case of both reads and writes, if the timestamp\n\t// supplied to the request was 0, the wall time of the node\n\t// servicing the request will be set here. Additionally, in the case\n\t// of writes, this value may be increased from the timestamp passed\n\t// with the RequestHeader if the key being written was either read\n\t// or written more recently.\n\tTimestamp Timestamp `protobuf:\"bytes,2,opt,name=timestamp\" json:\"timestamp\"`\n\t// Transaction is non-nil if the request specified a non-nil\n\t// transaction. The transaction timestamp and/or priority may have\n\t// been updated, depending on the outcome of the request.\n\tTxn *Transaction `protobuf:\"bytes,3,opt,name=txn\" json:\"txn,omitempty\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *ResponseHeader) Reset() { *m = ResponseHeader{} }\nfunc (m *ResponseHeader) String() string { return proto1.CompactTextString(m) }\nfunc (*ResponseHeader) ProtoMessage() {}\n\nfunc (m *ResponseHeader) GetError() *Error {\n\tif m != nil {\n\t\treturn m.Error\n\t}\n\treturn nil\n}\n\nfunc (m *ResponseHeader) GetTimestamp() Timestamp {\n\tif m != nil {\n\t\treturn m.Timestamp\n\t}\n\treturn Timestamp{}\n}\n\nfunc (m *ResponseHeader) GetTxn() *Transaction {\n\tif m != nil {\n\t\treturn m.Txn\n\t}\n\treturn nil\n}\n\n// A ContainsRequest is arguments to the Contains() method.\ntype ContainsRequest struct {\n\tRequestHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *ContainsRequest) Reset() { *m = ContainsRequest{} }\nfunc (m *ContainsRequest) String() string { return proto1.CompactTextString(m) }\nfunc (*ContainsRequest) ProtoMessage() {}\n\n// A ContainsResponse is the return value of the Contains() method.\ntype ContainsResponse struct {\n\tResponseHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\tExists bool `protobuf:\"varint,2,opt,name=exists\" json:\"exists\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *ContainsResponse) Reset() { *m = ContainsResponse{} }\nfunc (m *ContainsResponse) String() string { return proto1.CompactTextString(m) }\nfunc (*ContainsResponse) ProtoMessage() {}\n\nfunc (m *ContainsResponse) GetExists() bool {\n\tif m != nil {\n\t\treturn m.Exists\n\t}\n\treturn false\n}\n\n// A GetRequest is arguments to the Get() method.\ntype GetRequest struct {\n\tRequestHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *GetRequest) Reset() { *m = GetRequest{} }\nfunc (m *GetRequest) String() string { return proto1.CompactTextString(m) }\nfunc (*GetRequest) ProtoMessage() {}\n\n// A GetResponse is the return value from the Get() method.\n// If the key doesn't exist, returns nil for Value.Bytes.\ntype GetResponse struct {\n\tResponseHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\tValue *Value `protobuf:\"bytes,2,opt,name=value\" json:\"value,omitempty\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *GetResponse) Reset() { *m = GetResponse{} }\nfunc (m *GetResponse) String() string { return proto1.CompactTextString(m) }\nfunc (*GetResponse) ProtoMessage() {}\n\nfunc (m *GetResponse) GetValue() *Value {\n\tif m != nil {\n\t\treturn m.Value\n\t}\n\treturn nil\n}\n\n// A PutRequest is arguments to the Put() method. Note that to write\n// an empty value, the value parameter is still specified, but both\n// Bytes and Integer are set to nil.\ntype PutRequest struct {\n\tRequestHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\tValue Value `protobuf:\"bytes,2,opt,name=value\" json:\"value\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *PutRequest) Reset() { *m = PutRequest{} }\nfunc (m *PutRequest) String() string { return proto1.CompactTextString(m) }\nfunc (*PutRequest) ProtoMessage() {}\n\nfunc (m *PutRequest) GetValue() Value {\n\tif m != nil {\n\t\treturn m.Value\n\t}\n\treturn Value{}\n}\n\n// A PutResponse is the return value from the Put() method.\ntype PutResponse struct {\n\tResponseHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *PutResponse) Reset() { *m = PutResponse{} }\nfunc (m *PutResponse) String() string { return proto1.CompactTextString(m) }\nfunc (*PutResponse) ProtoMessage() {}\n\n// A ConditionalPutRequest is arguments to the ConditionalPut() method.\n//\n// - Returns true and sets value if ExpValue equals existing value.\n// - If key doesn't exist and ExpValue is nil, sets value.\n// - If key exists, but value is empty and ExpValue is not nil but empty, sets value.\n// - Otherwise, returns error and the actual value of the key in the response.\ntype ConditionalPutRequest struct {\n\tRequestHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\t// The value to put.\n\tValue Value `protobuf:\"bytes,2,opt,name=value\" json:\"value\"`\n\t// ExpValue.Bytes empty to test for non-existence. Specify as nil\n\t// to indicate there should be no existing entry. This is different\n\t// from the expectation that the value exists but is empty.\n\tExpValue *Value `protobuf:\"bytes,3,opt,name=exp_value\" json:\"exp_value,omitempty\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *ConditionalPutRequest) Reset() { *m = ConditionalPutRequest{} }\nfunc (m *ConditionalPutRequest) String() string { return proto1.CompactTextString(m) }\nfunc (*ConditionalPutRequest) ProtoMessage() {}\n\nfunc (m *ConditionalPutRequest) GetValue() Value {\n\tif m != nil {\n\t\treturn m.Value\n\t}\n\treturn Value{}\n}\n\nfunc (m *ConditionalPutRequest) GetExpValue() *Value {\n\tif m != nil {\n\t\treturn m.ExpValue\n\t}\n\treturn nil\n}\n\n// A ConditionalPutResponse is the return value from the\n// ConditionalPut() method.\ntype ConditionalPutResponse struct {\n\tResponseHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *ConditionalPutResponse) Reset() { *m = ConditionalPutResponse{} }\nfunc (m *ConditionalPutResponse) String() string { return proto1.CompactTextString(m) }\nfunc (*ConditionalPutResponse) ProtoMessage() {}\n\n// An IncrementRequest is arguments to the Increment() method. It\n// increments the value for key, and returns the new value. If no\n// value exists for a key, incrementing by 0 is not a noop, but will\n// create a zero value. IncrementRequest cannot be called on a key set\n// by Put() or ConditionalPut(). Similarly, Get(), Put() and\n// ConditionalPut() cannot be invoked on an incremented key.\ntype IncrementRequest struct {\n\tRequestHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\tIncrement int64 `protobuf:\"varint,2,opt,name=increment\" json:\"increment\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *IncrementRequest) Reset() { *m = IncrementRequest{} }\nfunc (m *IncrementRequest) String() string { return proto1.CompactTextString(m) }\nfunc (*IncrementRequest) ProtoMessage() {}\n\nfunc (m *IncrementRequest) GetIncrement() int64 {\n\tif m != nil {\n\t\treturn m.Increment\n\t}\n\treturn 0\n}\n\n// An IncrementResponse is the return value from the Increment\n// method. The new value after increment is specified in NewValue. If\n// the value could not be decoded as specified, Error will be set.\ntype IncrementResponse struct {\n\tResponseHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\tNewValue int64 `protobuf:\"varint,2,opt,name=new_value\" json:\"new_value\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *IncrementResponse) Reset() { *m = IncrementResponse{} }\nfunc (m *IncrementResponse) String() string { return proto1.CompactTextString(m) }\nfunc (*IncrementResponse) ProtoMessage() {}\n\nfunc (m *IncrementResponse) GetNewValue() int64 {\n\tif m != nil {\n\t\treturn m.NewValue\n\t}\n\treturn 0\n}\n\n// A DeleteRequest is arguments to the Delete() method.\ntype DeleteRequest struct {\n\tRequestHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *DeleteRequest) Reset() { *m = DeleteRequest{} }\nfunc (m *DeleteRequest) String() string { return proto1.CompactTextString(m) }\nfunc (*DeleteRequest) ProtoMessage() {}\n\n// A DeleteResponse is the return value from the Delete() method.\ntype DeleteResponse struct {\n\tResponseHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *DeleteResponse) Reset() { *m = DeleteResponse{} }\nfunc (m *DeleteResponse) String() string { return proto1.CompactTextString(m) }\nfunc (*DeleteResponse) ProtoMessage() {}\n\n// A DeleteRangeRequest is arguments to the DeleteRange method. It\n// specifies the range of keys to delete.\ntype DeleteRangeRequest struct {\n\tRequestHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\t// If 0, *all* entries between Key (inclusive) and EndKey\n\t// (exclusive) are deleted. Must be >= 0\n\tMaxEntriesToDelete int64 `protobuf:\"varint,2,opt,name=max_entries_to_delete\" json:\"max_entries_to_delete\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *DeleteRangeRequest) Reset() { *m = DeleteRangeRequest{} }\nfunc (m *DeleteRangeRequest) String() string { return proto1.CompactTextString(m) }\nfunc (*DeleteRangeRequest) ProtoMessage() {}\n\nfunc (m *DeleteRangeRequest) GetMaxEntriesToDelete() int64 {\n\tif m != nil {\n\t\treturn m.MaxEntriesToDelete\n\t}\n\treturn 0\n}\n\n// A DeleteRangeResponse is the return value from the DeleteRange()\n// method.\ntype DeleteRangeResponse struct {\n\tResponseHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\t// Number of entries removed.\n\tNumDeleted int64 `protobuf:\"varint,2,opt,name=num_deleted\" json:\"num_deleted\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *DeleteRangeResponse) Reset() { *m = DeleteRangeResponse{} }\nfunc (m *DeleteRangeResponse) String() string { return proto1.CompactTextString(m) }\nfunc (*DeleteRangeResponse) ProtoMessage() {}\n\nfunc (m *DeleteRangeResponse) GetNumDeleted() int64 {\n\tif m != nil {\n\t\treturn m.NumDeleted\n\t}\n\treturn 0\n}\n\n// A ScanRequest is arguments to the Scan() method. It specifies the\n// start and end keys for the scan and the maximum number of results.\ntype ScanRequest struct {\n\tRequestHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\t// Must be > 0.\n\tMaxResults int64 `protobuf:\"varint,2,opt,name=max_results\" json:\"max_results\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *ScanRequest) Reset() { *m = ScanRequest{} }\nfunc (m *ScanRequest) String() string { return proto1.CompactTextString(m) }\nfunc (*ScanRequest) ProtoMessage() {}\n\nfunc (m *ScanRequest) GetMaxResults() int64 {\n\tif m != nil {\n\t\treturn m.MaxResults\n\t}\n\treturn 0\n}\n\n// A ScanResponse is the return value from the Scan() method.\ntype ScanResponse struct {\n\tResponseHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\t// Empty if no rows were scanned.\n\tRows []KeyValue `protobuf:\"bytes,2,rep,name=rows\" json:\"rows\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *ScanResponse) Reset() { *m = ScanResponse{} }\nfunc (m *ScanResponse) String() string { return proto1.CompactTextString(m) }\nfunc (*ScanResponse) ProtoMessage() {}\n\nfunc (m *ScanResponse) GetRows() []KeyValue {\n\tif m != nil {\n\t\treturn m.Rows\n\t}\n\treturn nil\n}\n\n// An EndTransactionRequest is arguments to the EndTransaction() method.\n// It specifies whether to commit or roll back an extant transaction.\ntype EndTransactionRequest struct {\n\tRequestHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\t// False to abort and rollback.\n\tCommit bool `protobuf:\"varint,2,opt,name=commit\" json:\"commit\"`\n\t// Optional commit triggers. Note that commit triggers are for\n\t// internal use only and will be ignored if requested through the\n\t// public-facing KV API.\n\tSplitTrigger *SplitTrigger `protobuf:\"bytes,3,opt,name=split_trigger\" json:\"split_trigger,omitempty\"`\n\tMergeTrigger *MergeTrigger `protobuf:\"bytes,4,opt,name=merge_trigger\" json:\"merge_trigger,omitempty\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *EndTransactionRequest) Reset() { *m = EndTransactionRequest{} }\nfunc (m *EndTransactionRequest) String() string { return proto1.CompactTextString(m) }\nfunc (*EndTransactionRequest) ProtoMessage() {}\n\nfunc (m *EndTransactionRequest) GetCommit() bool {\n\tif m != nil {\n\t\treturn m.Commit\n\t}\n\treturn false\n}\n\nfunc (m *EndTransactionRequest) GetSplitTrigger() *SplitTrigger {\n\tif m != nil {\n\t\treturn m.SplitTrigger\n\t}\n\treturn nil\n}\n\nfunc (m *EndTransactionRequest) GetMergeTrigger() *MergeTrigger {\n\tif m != nil {\n\t\treturn m.MergeTrigger\n\t}\n\treturn nil\n}\n\n// An EndTransactionResponse is the return value from the\n// EndTransaction() method. The final transaction record is returned\n// as part of the response header. In particular, transaction status\n// and timestamp will be updated to reflect final committed\n// values. Clients may propagate the transaction timestamp as the\n// final txn commit timestamp in order to preserve causal ordering\n// between subsequent transactions. CommitWait specifies the commit\n// wait, which is the remaining time the client MUST wait before\n// signalling completion of the transaction to another distributed\n// node to maintain consistency.\ntype EndTransactionResponse struct {\n\tResponseHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\t// Remaining time (ns).\n\tCommitWait int64 `protobuf:\"varint,2,opt,name=commit_wait\" json:\"commit_wait\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *EndTransactionResponse) Reset() { *m = EndTransactionResponse{} }\nfunc (m *EndTransactionResponse) String() string { return proto1.CompactTextString(m) }\nfunc (*EndTransactionResponse) ProtoMessage() {}\n\nfunc (m *EndTransactionResponse) GetCommitWait() int64 {\n\tif m != nil {\n\t\treturn m.CommitWait\n\t}\n\treturn 0\n}\n\n// A ReapQueueRequest is arguments to the ReapQueue() method. It\n// specifies the recipient inbox key to which messages are waiting\n// to be reapted and also the maximum number of results to return.\ntype ReapQueueRequest struct {\n\tRequestHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\t// Maximum results to return; must be > 0.\n\tMaxResults int64 `protobuf:\"varint,2,opt,name=max_results\" json:\"max_results\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *ReapQueueRequest) Reset() { *m = ReapQueueRequest{} }\nfunc (m *ReapQueueRequest) String() string { return proto1.CompactTextString(m) }\nfunc (*ReapQueueRequest) ProtoMessage() {}\n\nfunc (m *ReapQueueRequest) GetMaxResults() int64 {\n\tif m != nil {\n\t\treturn m.MaxResults\n\t}\n\treturn 0\n}\n\n// A ReapQueueResponse is the return value from the ReapQueue() method.\ntype ReapQueueResponse struct {\n\tResponseHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\tMessages []Value `protobuf:\"bytes,2,rep,name=messages\" json:\"messages\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *ReapQueueResponse) Reset() { *m = ReapQueueResponse{} }\nfunc (m *ReapQueueResponse) String() string { return proto1.CompactTextString(m) }\nfunc (*ReapQueueResponse) ProtoMessage() {}\n\nfunc (m *ReapQueueResponse) GetMessages() []Value {\n\tif m != nil {\n\t\treturn m.Messages\n\t}\n\treturn nil\n}\n\n// An EnqueueUpdateRequest is arguments to the EnqueueUpdate() method.\n// It specifies the update to enqueue for asynchronous execution.\n// Update is an instance of one of the following messages: PutRequest,\n// IncrementRequest, DeleteRequest, DeleteRangeRequest, or\n// AccountingRequest.\ntype EnqueueUpdateRequest struct {\n\tRequestHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *EnqueueUpdateRequest) Reset() { *m = EnqueueUpdateRequest{} }\nfunc (m *EnqueueUpdateRequest) String() string { return proto1.CompactTextString(m) }\nfunc (*EnqueueUpdateRequest) ProtoMessage() {}\n\n// An EnqueueUpdateResponse is the return value from the\n// EnqueueUpdate() method.\ntype EnqueueUpdateResponse struct {\n\tResponseHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *EnqueueUpdateResponse) Reset() { *m = EnqueueUpdateResponse{} }\nfunc (m *EnqueueUpdateResponse) String() string { return proto1.CompactTextString(m) }\nfunc (*EnqueueUpdateResponse) ProtoMessage() {}\n\n// An EnqueueMessageRequest is arguments to the EnqueueMessage() method.\n// It specifies the recipient inbox key and the message (an arbitrary\n// byte slice value).\ntype EnqueueMessageRequest struct {\n\tRequestHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\t// Message value to delivery to inbox.\n\tMsg Value `protobuf:\"bytes,2,opt,name=msg\" json:\"msg\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *EnqueueMessageRequest) Reset() { *m = EnqueueMessageRequest{} }\nfunc (m *EnqueueMessageRequest) String() string { return proto1.CompactTextString(m) }\nfunc (*EnqueueMessageRequest) ProtoMessage() {}\n\nfunc (m *EnqueueMessageRequest) GetMsg() Value {\n\tif m != nil {\n\t\treturn m.Msg\n\t}\n\treturn Value{}\n}\n\n// An EnqueueMessageResponse is the return value from the\n// EnqueueMessage() method.\ntype EnqueueMessageResponse struct {\n\tResponseHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *EnqueueMessageResponse) Reset() { *m = EnqueueMessageResponse{} }\nfunc (m *EnqueueMessageResponse) String() string { return proto1.CompactTextString(m) }\nfunc (*EnqueueMessageResponse) ProtoMessage() {}\n\n// A RequestUnion contains exactly one of the optional requests.\ntype RequestUnion struct {\n\tContains *ContainsRequest `protobuf:\"bytes,1,opt,name=contains\" json:\"contains,omitempty\"`\n\tGet *GetRequest `protobuf:\"bytes,2,opt,name=get\" json:\"get,omitempty\"`\n\tPut *PutRequest `protobuf:\"bytes,3,opt,name=put\" json:\"put,omitempty\"`\n\tConditionalPut *ConditionalPutRequest `protobuf:\"bytes,4,opt,name=conditional_put\" json:\"conditional_put,omitempty\"`\n\tIncrement *IncrementRequest `protobuf:\"bytes,5,opt,name=increment\" json:\"increment,omitempty\"`\n\tDelete *DeleteRequest `protobuf:\"bytes,6,opt,name=delete\" json:\"delete,omitempty\"`\n\tDeleteRange *DeleteRangeRequest `protobuf:\"bytes,7,opt,name=delete_range\" json:\"delete_range,omitempty\"`\n\tScan *ScanRequest `protobuf:\"bytes,8,opt,name=scan\" json:\"scan,omitempty\"`\n\tEndTransaction *EndTransactionRequest `protobuf:\"bytes,9,opt,name=end_transaction\" json:\"end_transaction,omitempty\"`\n\tReapQueue *ReapQueueRequest `protobuf:\"bytes,10,opt,name=reap_queue\" json:\"reap_queue,omitempty\"`\n\tEnqueueUpdate *EnqueueUpdateRequest `protobuf:\"bytes,11,opt,name=enqueue_update\" json:\"enqueue_update,omitempty\"`\n\tEnqueueMessage *EnqueueMessageRequest `protobuf:\"bytes,12,opt,name=enqueue_message\" json:\"enqueue_message,omitempty\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *RequestUnion) Reset() { *m = RequestUnion{} }\nfunc (m *RequestUnion) String() string { return proto1.CompactTextString(m) }\nfunc (*RequestUnion) ProtoMessage() {}\n\nfunc (m *RequestUnion) GetContains() *ContainsRequest {\n\tif m != nil {\n\t\treturn m.Contains\n\t}\n\treturn nil\n}\n\nfunc (m *RequestUnion) GetGet() *GetRequest {\n\tif m != nil {\n\t\treturn m.Get\n\t}\n\treturn nil\n}\n\nfunc (m *RequestUnion) GetPut() *PutRequest {\n\tif m != nil {\n\t\treturn m.Put\n\t}\n\treturn nil\n}\n\nfunc (m *RequestUnion) GetConditionalPut() *ConditionalPutRequest {\n\tif m != nil {\n\t\treturn m.ConditionalPut\n\t}\n\treturn nil\n}\n\nfunc (m *RequestUnion) GetIncrement() *IncrementRequest {\n\tif m != nil {\n\t\treturn m.Increment\n\t}\n\treturn nil\n}\n\nfunc (m *RequestUnion) GetDelete() *DeleteRequest {\n\tif m != nil {\n\t\treturn m.Delete\n\t}\n\treturn nil\n}\n\nfunc (m *RequestUnion) GetDeleteRange() *DeleteRangeRequest {\n\tif m != nil {\n\t\treturn m.DeleteRange\n\t}\n\treturn nil\n}\n\nfunc (m *RequestUnion) GetScan() *ScanRequest {\n\tif m != nil {\n\t\treturn m.Scan\n\t}\n\treturn nil\n}\n\nfunc (m *RequestUnion) GetEndTransaction() *EndTransactionRequest {\n\tif m != nil {\n\t\treturn m.EndTransaction\n\t}\n\treturn nil\n}\n\nfunc (m *RequestUnion) GetReapQueue() *ReapQueueRequest {\n\tif m != nil {\n\t\treturn m.ReapQueue\n\t}\n\treturn nil\n}\n\nfunc (m *RequestUnion) GetEnqueueUpdate() *EnqueueUpdateRequest {\n\tif m != nil {\n\t\treturn m.EnqueueUpdate\n\t}\n\treturn nil\n}\n\nfunc (m *RequestUnion) GetEnqueueMessage() *EnqueueMessageRequest {\n\tif m != nil {\n\t\treturn m.EnqueueMessage\n\t}\n\treturn nil\n}\n\n// A ResponseUnion contains exactly one of the optional responses.\ntype ResponseUnion struct {\n\tContains *ContainsResponse `protobuf:\"bytes,1,opt,name=contains\" json:\"contains,omitempty\"`\n\tGet *GetResponse `protobuf:\"bytes,2,opt,name=get\" json:\"get,omitempty\"`\n\tPut *PutResponse `protobuf:\"bytes,3,opt,name=put\" json:\"put,omitempty\"`\n\tConditionalPut *ConditionalPutResponse `protobuf:\"bytes,4,opt,name=conditional_put\" json:\"conditional_put,omitempty\"`\n\tIncrement *IncrementResponse `protobuf:\"bytes,5,opt,name=increment\" json:\"increment,omitempty\"`\n\tDelete *DeleteResponse `protobuf:\"bytes,6,opt,name=delete\" json:\"delete,omitempty\"`\n\tDeleteRange *DeleteRangeResponse `protobuf:\"bytes,7,opt,name=delete_range\" json:\"delete_range,omitempty\"`\n\tScan *ScanResponse `protobuf:\"bytes,8,opt,name=scan\" json:\"scan,omitempty\"`\n\tEndTransaction *EndTransactionResponse `protobuf:\"bytes,9,opt,name=end_transaction\" json:\"end_transaction,omitempty\"`\n\tReapQueue *ReapQueueResponse `protobuf:\"bytes,10,opt,name=reap_queue\" json:\"reap_queue,omitempty\"`\n\tEnqueueUpdate *EnqueueUpdateResponse `protobuf:\"bytes,11,opt,name=enqueue_update\" json:\"enqueue_update,omitempty\"`\n\tEnqueueMessage *EnqueueMessageResponse `protobuf:\"bytes,12,opt,name=enqueue_message\" json:\"enqueue_message,omitempty\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *ResponseUnion) Reset() { *m = ResponseUnion{} }\nfunc (m *ResponseUnion) String() string { return proto1.CompactTextString(m) }\nfunc (*ResponseUnion) ProtoMessage() {}\n\nfunc (m *ResponseUnion) GetContains() *ContainsResponse {\n\tif m != nil {\n\t\treturn m.Contains\n\t}\n\treturn nil\n}\n\nfunc (m *ResponseUnion) GetGet() *GetResponse {\n\tif m != nil {\n\t\treturn m.Get\n\t}\n\treturn nil\n}\n\nfunc (m *ResponseUnion) GetPut() *PutResponse {\n\tif m != nil {\n\t\treturn m.Put\n\t}\n\treturn nil\n}\n\nfunc (m *ResponseUnion) GetConditionalPut() *ConditionalPutResponse {\n\tif m != nil {\n\t\treturn m.ConditionalPut\n\t}\n\treturn nil\n}\n\nfunc (m *ResponseUnion) GetIncrement() *IncrementResponse {\n\tif m != nil {\n\t\treturn m.Increment\n\t}\n\treturn nil\n}\n\nfunc (m *ResponseUnion) GetDelete() *DeleteResponse {\n\tif m != nil {\n\t\treturn m.Delete\n\t}\n\treturn nil\n}\n\nfunc (m *ResponseUnion) GetDeleteRange() *DeleteRangeResponse {\n\tif m != nil {\n\t\treturn m.DeleteRange\n\t}\n\treturn nil\n}\n\nfunc (m *ResponseUnion) GetScan() *ScanResponse {\n\tif m != nil {\n\t\treturn m.Scan\n\t}\n\treturn nil\n}\n\nfunc (m *ResponseUnion) GetEndTransaction() *EndTransactionResponse {\n\tif m != nil {\n\t\treturn m.EndTransaction\n\t}\n\treturn nil\n}\n\nfunc (m *ResponseUnion) GetReapQueue() *ReapQueueResponse {\n\tif m != nil {\n\t\treturn m.ReapQueue\n\t}\n\treturn nil\n}\n\nfunc (m *ResponseUnion) GetEnqueueUpdate() *EnqueueUpdateResponse {\n\tif m != nil {\n\t\treturn m.EnqueueUpdate\n\t}\n\treturn nil\n}\n\nfunc (m *ResponseUnion) GetEnqueueMessage() *EnqueueMessageResponse {\n\tif m != nil {\n\t\treturn m.EnqueueMessage\n\t}\n\treturn nil\n}\n\n// A BatchRequest contains one or more requests to be executed in\n// parallel, or if applicable (based on write-only commands and\n// range-locality), as a single update.\ntype BatchRequest struct {\n\tRequestHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\tRequests []RequestUnion `protobuf:\"bytes,2,rep,name=requests\" json:\"requests\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *BatchRequest) Reset() { *m = BatchRequest{} }\nfunc (m *BatchRequest) String() string { return proto1.CompactTextString(m) }\nfunc (*BatchRequest) ProtoMessage() {}\n\nfunc (m *BatchRequest) GetRequests() []RequestUnion {\n\tif m != nil {\n\t\treturn m.Requests\n\t}\n\treturn nil\n}\n\n// A BatchResponse contains one or more responses, one per request\n// corresponding to the requests in the matching BatchRequest. The\n// error in the response header is set to the first error from the\n// slice of responses, if applicable.\ntype BatchResponse struct {\n\tResponseHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\tResponses []ResponseUnion `protobuf:\"bytes,2,rep,name=responses\" json:\"responses\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *BatchResponse) Reset() { *m = BatchResponse{} }\nfunc (m *BatchResponse) String() string { return proto1.CompactTextString(m) }\nfunc (*BatchResponse) ProtoMessage() {}\n\nfunc (m *BatchResponse) GetResponses() []ResponseUnion {\n\tif m != nil {\n\t\treturn m.Responses\n\t}\n\treturn nil\n}\n\n// An AdminSplitRequest is arguments to the AdminSplit() method. The\n// existing range which contains RequestHeader.Key is split by\n// split_key. If split_key is not specified, then this method will\n// determine a split key that is roughly halfway through the\n// range. The existing range is resized to cover only its start key to\n// the split key. The new range created by the split starts at the\n// split key and extends to the original range's end key. If split_key\n// is known, header.key should also be set to split_key.\n//\n// New range IDs for each of the split range's replica and a new Raft\n// ID are generated by the operation. Split requests are done in the\n// context of a distributed transaction which updates range addressing\n// records, range metadata and finally, provides a commit trigger to\n// update bookkeeping and instantiate the new range on commit.\n//\n// The new range contains range replicas located on the same stores;\n// no range data is moved during this operation. The split can be\n// thought of as a mostly logical operation, though some other\n// metadata (e.g. response cache and range stats must be copied or\n// recomputed).\ntype AdminSplitRequest struct {\n\tRequestHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\tSplitKey Key `protobuf:\"bytes,2,opt,name=split_key,customtype=Key\" json:\"split_key\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *AdminSplitRequest) Reset() { *m = AdminSplitRequest{} }\nfunc (m *AdminSplitRequest) String() string { return proto1.CompactTextString(m) }\nfunc (*AdminSplitRequest) ProtoMessage() {}\n\n// An AdminSplitResponse is the return value from the AdminSplit()\n// method.\ntype AdminSplitResponse struct {\n\tResponseHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *AdminSplitResponse) Reset() { *m = AdminSplitResponse{} }\nfunc (m *AdminSplitResponse) String() string { return proto1.CompactTextString(m) }\nfunc (*AdminSplitResponse) ProtoMessage() {}\n\n// An AdminMergeRequest is arguments to the AdminMerge() method. A\n// merge is always performed by calling AdminMerge on the range\n// that is subsuming the passed in subsumed_range. The ranges must\n// be consecutive in the key space, such that the end_key of the\n// subsuming range must match the start_key of the range being subsumed.\n// After the merge operation, the subsumed_range will no longer exist and\n// the subsuming range will now encompass all keys from its original\n// start_key to the end_key of the subsumed_range.\ntype AdminMergeRequest struct {\n\tRequestHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\tSubsumedRange RangeDescriptor `protobuf:\"bytes,2,opt,name=subsumed_range\" json:\"subsumed_range\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *AdminMergeRequest) Reset() { *m = AdminMergeRequest{} }\nfunc (m *AdminMergeRequest) String() string { return proto1.CompactTextString(m) }\nfunc (*AdminMergeRequest) ProtoMessage() {}\n\nfunc (m *AdminMergeRequest) GetSubsumedRange() RangeDescriptor {\n\tif m != nil {\n\t\treturn m.SubsumedRange\n\t}\n\treturn RangeDescriptor{}\n}\n\n// An AdminMergeResponse is the return value from the AdminMerge()\n// method.\ntype AdminMergeResponse struct {\n\tResponseHeader `protobuf:\"bytes,1,opt,name=header,embedded=header\" json:\"header\"`\n\tXXX_unrecognized []byte `json:\"-\"`\n}\n\nfunc (m *AdminMergeResponse) Reset() { *m = AdminMergeResponse{} }\nfunc (m *AdminMergeResponse) String() string { return proto1.CompactTextString(m) }\nfunc (*AdminMergeResponse) ProtoMessage() {}\n\nfunc init() {\n}\nfunc (this *RequestUnion) GetValue() interface{} {\n\tif this.Contains != nil {\n\t\treturn this.Contains\n\t}\n\tif this.Get != nil {\n\t\treturn this.Get\n\t}\n\tif this.Put != nil {\n\t\treturn this.Put\n\t}\n\tif this.ConditionalPut != nil {\n\t\treturn this.ConditionalPut\n\t}\n\tif this.Increment != nil {\n\t\treturn this.Increment\n\t}\n\tif this.Delete != nil {\n\t\treturn this.Delete\n\t}\n\tif this.DeleteRange != nil {\n\t\treturn this.DeleteRange\n\t}\n\tif this.Scan != nil {\n\t\treturn this.Scan\n\t}\n\tif this.EndTransaction != nil {\n\t\treturn this.EndTransaction\n\t}\n\tif this.ReapQueue != nil {\n\t\treturn this.ReapQueue\n\t}\n\tif this.EnqueueUpdate != nil {\n\t\treturn this.EnqueueUpdate\n\t}\n\tif this.EnqueueMessage != nil {\n\t\treturn this.EnqueueMessage\n\t}\n\treturn nil\n}\n\nfunc (this *RequestUnion) SetValue(value interface{}) bool {\n\tswitch vt := value.(type) {\n\tcase *ContainsRequest:\n\t\tthis.Contains = vt\n\tcase *GetRequest:\n\t\tthis.Get = vt\n\tcase *PutRequest:\n\t\tthis.Put = vt\n\tcase *ConditionalPutRequest:\n\t\tthis.ConditionalPut = vt\n\tcase *IncrementRequest:\n\t\tthis.Increment = vt\n\tcase *DeleteRequest:\n\t\tthis.Delete = vt\n\tcase *DeleteRangeRequest:\n\t\tthis.DeleteRange = vt\n\tcase *ScanRequest:\n\t\tthis.Scan = vt\n\tcase *EndTransactionRequest:\n\t\tthis.EndTransaction = vt\n\tcase *ReapQueueRequest:\n\t\tthis.ReapQueue = vt\n\tcase *EnqueueUpdateRequest:\n\t\tthis.EnqueueUpdate = vt\n\tcase *EnqueueMessageRequest:\n\t\tthis.EnqueueMessage = vt\n\tdefault:\n\t\treturn false\n\t}\n\treturn true\n}\nfunc (this *ResponseUnion) GetValue() interface{} {\n\tif this.Contains != nil {\n\t\treturn this.Contains\n\t}\n\tif this.Get != nil {\n\t\treturn this.Get\n\t}\n\tif this.Put != nil {\n\t\treturn this.Put\n\t}\n\tif this.ConditionalPut != nil {\n\t\treturn this.ConditionalPut\n\t}\n\tif this.Increment != nil {\n\t\treturn this.Increment\n\t}\n\tif this.Delete != nil {\n\t\treturn this.Delete\n\t}\n\tif this.DeleteRange != nil {\n\t\treturn this.DeleteRange\n\t}\n\tif this.Scan != nil {\n\t\treturn this.Scan\n\t}\n\tif this.EndTransaction != nil {\n\t\treturn this.EndTransaction\n\t}\n\tif this.ReapQueue != nil {\n\t\treturn this.ReapQueue\n\t}\n\tif this.EnqueueUpdate != nil {\n\t\treturn this.EnqueueUpdate\n\t}\n\tif this.EnqueueMessage != nil {\n\t\treturn this.EnqueueMessage\n\t}\n\treturn nil\n}\n\nfunc (this *ResponseUnion) SetValue(value interface{}) bool {\n\tswitch vt := value.(type) {\n\tcase *ContainsResponse:\n\t\tthis.Contains = vt\n\tcase *GetResponse:\n\t\tthis.Get = vt\n\tcase *PutResponse:\n\t\tthis.Put = vt\n\tcase *ConditionalPutResponse:\n\t\tthis.ConditionalPut = vt\n\tcase *IncrementResponse:\n\t\tthis.Increment = vt\n\tcase *DeleteResponse:\n\t\tthis.Delete = vt\n\tcase *DeleteRangeResponse:\n\t\tthis.DeleteRange = vt\n\tcase *ScanResponse:\n\t\tthis.Scan = vt\n\tcase *EndTransactionResponse:\n\t\tthis.EndTransaction = vt\n\tcase *ReapQueueResponse:\n\t\tthis.ReapQueue = vt\n\tcase *EnqueueUpdateResponse:\n\t\tthis.EnqueueUpdate = vt\n\tcase *EnqueueMessageResponse:\n\t\tthis.EnqueueMessage = vt\n\tdefault:\n\t\treturn false\n\t}\n\treturn true\n}\n" }, { "path": "src/test/resources/samples/langs/Go/embedded.go", "content": "// Code generated by go-bindata.\n// sources:\n// ui/css/app.css\n// ui/css/graph.css\n// ui/css/libs/nvd3/1.7.1/nv.d3.min.css\n// ui/css/rest_explorer.css\n// ui/index.html\n// ui/js/app.js\n// ui/js/libs/d3/3.3.5/d3.min.js\n// ui/js/libs/mithriljs/0.2.0/mithril.min.js\n// ui/js/libs/mithriljs/0.2.0/mithril.min.js.map\n// ui/js/libs/nvd3/1.7.1/nv.d3.min.js\n// ui/ts/app.ts\n// ui/ts/components/metrics.ts\n// ui/ts/header.ts\n// ui/ts/models/node_status.ts\n// ui/ts/models/stats.ts\n// ui/ts/models/store_status.ts\n// ui/ts/models/timeseries.ts\n// ui/ts/pages/graph.ts\n// ui/ts/pages/monitor.ts\n// ui/ts/pages/nodes.ts\n// ui/ts/pages/rest_explorer.ts\n// ui/ts/pages/stores.ts\n// ui/ts/tsconfig.json\n// ui/ts/typings/d3/d3.d.ts\n// ui/ts/typings/jquery/jquery.d.ts\n// ui/ts/typings/mithriljs/mithril.d.ts\n// DO NOT EDIT!\npackage resource\n\nimport (\n \"bytes\"\n \"compress/gzip\"\n \"fmt\"\n \"io\"\n \"io/ioutil\"\n \"os\"\n \"path\"\n \"path/filepath\"\n \"strings\"\n \"time\"\n)\n\nfunc bindataRead(data []byte, name string) ([]byte, error) {\n gz, err := gzip.NewReader(bytes.NewBuffer(data))\n if err != nil {\n return nil, fmt.Errorf(\"Read %q: %v\", name, err)\n }\n\n var buf bytes.Buffer\n _, err = io.Copy(&buf, gz)\n clErr := gz.Close()\n\n if err != nil {\n return nil, fmt.Errorf(\"Read %q: %v\", name, err)\n }\n if clErr != nil {\n return nil, err\n }\n\n return buf.Bytes(), nil\n}\n\ntype asset struct {\n bytes []byte\n info os.FileInfo\n}\n\ntype bindataFileInfo struct {\n name string\n size int64\n mode os.FileMode\n modTime time.Time\n}\n\nfunc (fi bindataFileInfo) Name() string {\n return fi.name\n}\nfunc (fi bindataFileInfo) Size() int64 {\n return fi.size\n}\nfunc (fi bindataFileInfo) Mode() os.FileMode {\n return fi.mode\n}\nfunc (fi bindataFileInfo) ModTime() time.Time {\n return fi.modTime\n}\nfunc (fi bindataFileInfo) IsDir() bool {\n return false\n}\nfunc (fi bindataFileInfo) Sys() interface{} {\n return nil\n}\n\nvar _uiCssAppCss = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\x7c\\x54\\xdb\\x6e\\xdb\\x38\\x10\\x7d\\xe7\\x57\\x0c\\x52\\x2c\\x72\\x81\\x65\\x3b\\x4e\\x16\\x58\\xd8\\x2f\\xab\\xba\\x59\\xc4\\x68\\xa1\\x2c\\x22\\x67\\x8b\\x3e\\x52\\xd2\\x48\\x22\\x42\\x91\\x5c\\x92\\xb2\\xec\\x2e\\xfa\\xef\\x3b\\x94\\xe4\\x34\\xee\\xcd\\x0f\\x86\\x67\\xe6\\x78\\xe6\\x9c\\xb9\\x70\\x76\\x75\\xc5\\xd6\\xda\\x1c\\xac\\xa8\\x6a\\x0f\\x8b\\xf9\\xf5\\x2d\\x6c\\x6b\\x84\\xb5\\xce\\x9f\\xad\\xe6\\x79\\x0d\\x71\\xeb\\x6b\\x6d\\xdd\\x94\\xb1\\x0f\\x22\\x47\\xe5\\xb0\\x80\\x56\\x15\\x68\\xc1\\x13\\x2c\\x36\\x04\\x41\\x18\\x23\\x13\\xf8\\x07\\xad\\x13\\x5a\\xc1\\x62\\x3a\\x87\\x8b\\x00\\x38\\x1b\\x43\\x67\\x97\\x2b\\x76\\xd0\\x2d\\x34\\xfc\\x00\\x4a\\x7b\\x68\\x1d\\x52\\x02\\xe1\\xa0\\x14\\x12\\x01\\xf7\\x39\\x1a\\x0f\\x42\\x41\\xae\\x1b\\x23\\x05\\x57\\x39\\x42\\x27\\x7c\\xdd\\x17\\x19\\x53\\x4c\\xd9\\xa7\\x31\\x81\\xce\\x3c\\x27\\x2c\\x27\\xb4\\x21\\xab\\x7c\\x8d\\x02\\xee\\x19\\x03\\xfa\\xd4\\xde\\x9b\\xe5\\x6c\\xd6\\x75\\xdd\\x94\\xf7\\x2c\\xa7\\xda\\x56\\x33\\x39\\xa0\\xdc\\xec\\xc3\\x66\\x7d\\x97\\xa4\\x77\\x11\\x31\\x65\\xec\\x49\\x49\\x74\\x0e\\x2c\\xfe\\xdb\\x0a\\x4b\\x02\\xb3\\x03\\x70\\x43\\x3c\\x72\\x9e\\x11\\x3b\\xc9\\x3b\\xd0\\x16\\x78\\x65\\x91\\x62\\x5e\\x07\\x9e\\x9d\\x15\\x5e\\xa8\\x6a\\x02\\x4e\\x97\\xbe\\xe3\\x16\\x59\\x21\\x9c\\xb7\\x22\\x6b\\xfd\\x49\\x83\\x8e\\xac\\x48\\xe9\\x6b\\x00\\xb5\\x88\\x2b\\x38\\x8b\\x53\\xd8\\xa4\\x67\\xf0\\x36\\x4e\\x37\\xe9\\x84\\x7d\\xdc\\x6c\\xef\\x1f\\x9e\\xb6\\xf0\\x31\\x7e\\x7c\\x8c\\x93\\xed\\xe6\\x2e\\x85\\x87\\x47\\x58\\x3f\\x24\\xef\\x36\\xdb\\xcd\\x43\\x42\\xd6\\x5f\\x10\\x27\\x9f\\xe0\\xfd\\x26\\x79\\x37\\x01\\xa4\\xf6\\x50\\x11\\xdc\\x1b\\x1b\\xb8\\x6b\\xcb\\x44\\x68\\x1d\\x16\\x53\\x48\\x11\\x4f\\x8a\\x97\\x7a\\x20\\xe3\\x0c\\xe6\\xa2\\x14\\x39\\x29\\x52\\x55\\xcb\\x2b\\x84\\x4a\\xef\\xd0\\x2a\\x12\\xc2\\x0c\\xda\\x46\\xb8\\x30\\x3c\\x47\\xd4\\x0a\\x90\\xa2\\x11\\x9e\\xfb\\xde\\xfe\\x4e\\xce\\xd7\\x12\\xf1\\x13\\x71\\x7e\\x4c\\xfb\\x31\\xb2\\x50\\x47\\xf1\\x06\\x5d\\x98\\x49\\xae\\xd5\\x20\\x77\\x58\\x9e\\x61\\x8d\\x96\\x10\\xab\\xc2\\x62\\x07\\x6f\\xb5\\xda\\x21\\x01\\x10\\x2e\\xa8\\xda\\x21\\xa3\\x32\\x7f\\x56\\x0d\\x17\\x72\\x4a\\x1b\\x70\\xc9\\xae\\x66\\xec\\x0a\\xfe\\xa3\\x39\\x36\\xdc\\x56\\x42\\x2d\\x61\\xbe\\x22\\xc3\\xf0\\xa2\\x20\\xae\\xa3\\x15\\x35\\xfa\\x73\\x94\\xe9\\x7d\\xe4\\xc4\\xe7\\xde\\x9b\\x69\\x4b\\x3c\\x83\\xab\\x0f\\x77\\x98\\x3d\\x0b\\xff\\x0b\\xc4\\xcf\\x22\\x5f\\x58\\xed\\x1b\\x39\\x61\\x99\\x2e\\x0e\\x3d\\x89\\x1a\\xc3\\x71\\x2c\\xe1\\x7a\\x3e\\xff\\xed\\x5b\\x1e\\x5f\\xbe\\xc2\\x32\\x9e\\x3f\\x57\\x56\\x53\\xb7\\xa2\\x5c\\xcb\\x20\\xf6\\x4d\\x79\\x5d\\x2e\\xca\\x9b\\xf0\\x9f\\xa3\\xe7\\xe6\\xa6\\x37\\x4b\\xea\\x4e\\x54\\xf2\\x46\\xc8\\xc3\\x12\\xce\\x53\\xdd\\x5a\\xda\\xf8\\x94\\x53\\xb3\\xff\\xb6\\xfa\\x7c\\x02\\xe7\\xf7\\x28\\x77\\xe8\\x69\\x03\\x21\\xc1\\x16\\xc9\\xf3\\xe2\\xa0\\x9d\\x23\\x5c\\xe4\\xd0\\x8a\\xf2\\x25\\x55\\x37\\x52\\xbc\\x9d\\xcf\\x5f\\x7c\\xa4\\x0d\\x89\\xf4\\xad\\xe9\\x35\\x4d\\xcb\\x56\\xca\\xfb\\x1e\\xb6\\xa6\\x28\\x1d\\x10\\xcd\\xf4\\xb5\\xba\\x9c\\xcb\\xfc\\x22\\x48\\x84\\x08\\x7e\\x9f\\x9b\\xfd\\xe5\\x0a\\x66\\x57\\xf0\\x1e\\xd1\\x84\\x85\\x97\\x84\\x1f\\x4e\\x72\\xc0\\x87\\x11\\xd3\\x61\\x99\\x84\\xef\\x80\\xa6\\x45\\xf9\\x47\\xe3\\x75\\xca\\x90\\x66\\xf5\\x93\\xce\\x94\\xe5\\x30\\x83\\xb1\\xef\\xde\\xeb\\x86\\xc8\\x9a\\x3d\\x5d\\x94\\x14\\x05\\xbc\\x29\\x8a\\xe2\\xa4\\xd7\\xd7\\x94\\x8b\\xde\\xa7\\x51\\xcc\\x50\\x2c\\x22\\x56\\xcf\\xcb\\xf0\\x35\\x39\\x75\\xed\\x84\\x13\\xe1\\xce\\x02\\x19\\x8f\\x7b\\x1f\\x15\\x98\\x6b\\xdb\\xaf\\xf3\\x92\\xde\\x1f\\x85\\xab\\x63\\xc0\\x5b\\x6a\\x26\\x2d\\x2e\\x15\\x6f\\x0d\\x1d\\x41\\xce\\x1d\\xfe\\x60\\x5e\\x74\\xbc\\x46\\x72\\x9a\\x95\\x50\\xa1\\x13\\x51\\x26\\xe9\\x81\\x5c\\xbd\\x2c\\x68\\x64\\x07\\xc1\\x3f\\xe2\\x77\\xfc\\x5d\\xeb\\x06\\x13\\xba\\x8e\\x9e\\xd4\\xc9\\xd0\\xfe\\xf8\\x6e\\x68\\x8b\\xc5\\xd0\\xb8\\x6f\\x29\\x1e\\xa9\\xd3\\xd5\\x86\\x55\\x90\\x11\\x97\\xa2\\x22\\x49\\xd1\\x62\\xa8\\xfb\\x7f\\x00\\x00\\x00\\xff\\xff\\x4c\\xec\\x61\\x77\\xce\\x05\\x00\\x00\")\n\nfunc uiCssAppCssBytes() ([]byte, error) {\n return bindataRead(\n _uiCssAppCss,\n \"ui/css/app.css\",\n )\n}\n\nfunc uiCssAppCss() (*asset, error) {\n bytes, err := uiCssAppCssBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/css/app.css\", size: 1486, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiCssGraphCss = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\x7c\\x8d\\x31\\x0e\\xc2\\x30\\x0c\\x45\\xf7\\x9c\\xc2\\x12\\x2b\\xad\\xd2\\x81\\x25\\x9d\\x39\\x48\\x20\\x9f\\xc6\\x22\\x72\\x23\\x27\\x88\\x4a\\x88\\xbb\\x03\\x29\\x12\\x4c\\xdd\\xfc\\xf4\\x9e\\xed\\x3e\\xb1\\x80\\x1e\\x86\\xe8\\xc2\\x29\\x39\\x92\\x59\\x30\\xbe\\xa9\\x54\\x9d\\xaf\\xe8\\xee\\x1c\\x6a\\x74\\x34\\xf4\\x87\\xbc\\x8c\\xe6\\x69\\x4c\\xeb\\x6d\\x5b\\x58\\x13\\xa7\\x08\\x3f\\x33\\xfc\\x9b\\x53\\xba\\x61\\x55\\x7e\\xe1\\x42\\xd9\\xd7\\xb8\\xff\\xce\\x9b\\x5f\\x1d\\xed\\xac\\xb5\\x8d\\xa3\\xcf\\xe8\\x14\\x12\\xa0\\x2c\\x93\\xa3\\xb3\\x72\\xc9\\xc7\\x30\\xa1\\x7c\\x0e\\xbf\\x02\\x00\\x00\\xff\\xff\\xd9\\x8a\\x57\\x81\\xbd\\x00\\x00\\x00\")\n\nfunc uiCssGraphCssBytes() ([]byte, error) {\n return bindataRead(\n _uiCssGraphCss,\n \"ui/css/graph.css\",\n )\n}\n\nfunc uiCssGraphCss() (*asset, error) {\n bytes, err := uiCssGraphCssBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/css/graph.css\", size: 189, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiCssLibsNvd3171NvD3MinCss = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\xcc\\x5a\\x4f\\x6f\\xe3\\xba\\x11\\xff\\x2a\\x2a\\x16\\x05\\x1a\\x40\\x12\\x24\\xc5\\x4e\\x62\\xe9\\xf4\\x5e\\x1b\\xb4\\x87\\x3e\\xa0\\x87\\xa2\\x77\\x5a\\xa2\\x6d\\xc2\\x94\\x28\\x50\\x74\\x6c\\xc7\\xd8\\xef\\x5e\\xfe\\x11\\x25\\x52\\xa4\\x64\\x67\\x91\\xc3\\x83\\x91\\x0d\\x43\\xfe\\x66\\x38\\x1c\\xce\\x5f\\x7a\\xe3\\xe6\\xa3\\x7a\\x0e\\xf8\\xbf\\x11\\xb8\\xa0\\xee\\xd6\\x12\\xd4\\x30\\x48\\x23\\xf8\\x01\\x1b\\xd6\\xe5\\x0d\\x69\\x60\\x41\\x5a\\x50\\x22\\x76\\xcd\\xd3\\x9f\\x36\\x38\\x68\\x01\\x3b\\xdc\\x76\\x08\\x63\\x85\\xeb\\x18\\x25\\x47\\x98\\xff\\x48\\x92\\xa4\\x1f\\x47\\x9a\\x34\\x7e\\x5d\\x17\\xdd\\x01\\xb4\\x30\\xa2\\xb0\\xa9\\x20\\x45\\xcd\\x3e\\x2f\\x29\\xea\\xda\\xf7\\x6a\\x0f\\x3b\\x1f\\xdf\\xb8\\x22\\x35\\x40\\xcd\\xcd\\x65\\x34\\x41\\x8b\\xdf\\x97\\x25\\x92\\x64\\xca\\x1e\\xa3\\x06\\x7a\\xc4\\x86\\x6b\\xf1\\xf9\\x82\\x98\\xf1\\x27\\xa4\\x44\\x72\\x0b\\x3d\\x3b\\xc8\\xd5\\xfb\\xe2\\x0f\\x83\\x3f\\xc0\\xe5\\x0f\\xd4\\x04\\x0c\\x5e\\xd8\\x6d\\x47\\x1a\\x16\\x9d\\x21\\xda\\x1f\\x58\\xfe\\x9a\\x0c\\x07\\xb8\\x2c\\x52\\x69\\x21\\x2e\\xd9\\x63\\xb0\\x3b\\x32\\x88\\x7f\\x22\\xd0\\x94\\x07\\x42\\xf3\\x1a\\x55\\x15\\x86\\x1e\\xc5\\x57\\xa8\\x03\\x5b\\x0c\\xab\\x9b\\x4f\\xd9\\x5b\\x40\\xbb\\x80\\xc2\\x92\\x49\\x65\\x5b\\xb6\\xc0\\x28\\x68\\x3a\\xc4\\x10\\x69\\x72\\x73\\x2d\\xc8\\xd6\\x49\\xad\\xd4\\x07\\x68\\x11\\xd5\\xe4\\x33\\x7a\\x0c\\x79\\x86\\xdb\\x23\\x62\\x0f\\x81\\x7d\\x02\\xc6\\x07\\xf2\\x01\\xa9\\x2d\\x66\\x3a\\x05\\x2a\\xd0\\x78\\xa0\\xfc\\x07\\xa8\\xaa\\x37\\xf8\\x32\\xc5\\xa9\\x1b\\x14\\x00\\xba\\xdf\\x82\\xbf\\x25\\xa1\\xfc\\x3c\\xcd\\xb0\\xf3\\xa2\\x53\\x13\\x5d\\x9f\\x30\\x43\\x9c\\x44\\xfe\\xb1\\xa7\\xe4\\xd4\\x2a\\xa1\\x43\\x17\\xf2\\x2f\\x42\\xd1\\x27\\xb7\\x1d\\x80\\x17\\xc0\\xfc\\xce\\x4a\\x0a\\x19\\xf4\\xb0\\x74\\x5c\\xe7\\x4f\\x72\\x51\\x73\\x2a\\xc8\\xa5\\x0e\\xbf\\xa4\\x08\\x87\\x64\\x41\\x1d\\xf9\\x1d\\xb3\\x98\\x21\\x35\\xbd\\xec\\xae\\x4c\\x3e\\x7f\\x2f\\x5c\\x7b\\xd0\\x51\\xca\\x63\\x52\\xd2\\xa2\\x4e\\x18\\x43\\xc5\\x27\\x4f\\x93\\xf6\\x12\\x74\\x5c\\xbf\\x51\\xc7\\x23\\xd8\\x6e\\x0a\\x52\\x32\\x41\\xd0\\x9d\\x28\\x9c\\x38\\xe6\\xdb\\x12\\x76\\x41\\x19\\x53\\x02\\x40\\x8f\\x1c\\xe9\\x49\\x07\\x67\\x54\\xb1\\x43\\x9e\\xb5\\x97\\x05\\xba\\xff\\x52\\x04\\x9a\\x3d\\x86\\x16\\xbd\\xf2\\xb7\\xdd\\x6e\\x67\\x73\\x4a\\xe3\\xf5\\x0c\\x2f\\x86\\xca\\xa3\\x0a\\xf4\\x9a\\xcd\\xcb\\xcb\\x8b\\x4d\\x3c\\x4b\\xcb\\x6d\\x73\\x0f\\xc5\\xa0\\x4b\\x7a\\x47\\x87\\x10\\xde\\x41\\xa6\\x3d\\xb2\\xaa\\xaa\\x3b\\xc8\\xac\\x47\\x96\\x65\\x39\\x23\\x39\\xe3\\x87\\x97\\x16\\xd1\\xa1\\x4f\\x98\\xa7\\xab\\xf6\\x52\\x78\\x13\\xc2\\x84\\xb0\\x3b\\x6d\\x7b\\x5a\\xc9\\x7f\\xb3\\xd9\\xcc\\x4b\\xd2\\x63\\xb6\\x40\\x7c\\x0a\\xdb\\x0a\\x56\\xf3\\x64\\x3e\\x1b\\x88\\x5f\\x47\\xbc\\x50\\xf8\\x7f\\xf0\\xa9\\xfb\\xbd\\x77\\x08\\xe1\\x18\\xde\\x04\\x70\\x9f\\xe4\\x9e\\xef\\xf5\\xee\\x23\\xf3\\x7e\\xcf\\x66\\xcc\\xe9\\xf3\\x38\\x40\\x21\\xd0\\x26\\x31\\x22\\x35\\x87\\x60\\xf8\\xab\\x2b\\x01\\xe3\\x75\\x90\\xc9\\x42\\x0c\\x65\\x79\\x64\\x0b\\xe5\\xd4\\x3a\\xc6\\xed\\xf4\\x5c\\xe4\\x10\\x09\\xa3\\x56\\x0c\\x1e\\xe0\\x1a\\xaf\\xff\\x82\\xea\\x96\\x50\\x06\\x1a\\xe6\\x14\\x53\\xc6\\xda\\xcf\\xf8\\x8c\\xd8\\xc1\\x88\\xa7\\x5d\\xe0\\x9c\\x7d\\xdc\\xc2\\x08\\xbb\\xa6\\x2b\\x58\\x61\\x37\\xb4\\x77\\x5b\\x8e\\xf4\\xbf\\xc8\\xc5\\xcd\\x02\\xbf\\xc4\\xc8\\x51\\xb4\\xf7\\xd4\\xf1\\x34\\xe2\\xfb\\x01\\x37\\x2b\\x38\\xbc\\x0a\\xa7\\xb3\\x2e\\x64\\xb3\\x74\\x23\\x1b\\xeb\\x4a\\x86\\x9d\\x24\\xfb\\x48\\xd8\\x5e\\x5f\\x2c\\xeb\\x60\\x04\\x00\\x70\\xcc\\xa6\\x18\\x62\\x8d\\xbd\\xb3\\x59\\x52\\x21\\x5e\\x95\\x5e\\xfe\\x2d\\x6c\\xbd\\x3c\\xd1\\x8e\\x57\\x66\\xf0\\xcc\\x4b\\x55\\x11\\x27\\x7e\\x76\\x1f\\x7b\\x89\\x8b\\xf8\\xe0\\x36\\x68\\x98\\x9c\\xca\\x43\\x54\\x02\\x8c\\xc9\\x89\\xa9\\x72\\x57\\x2f\\x9d\\x78\\x76\\xe0\\x19\\x02\\x0b\\x5f\\x53\\x0b\\xc7\\x03\\xab\\xb1\\x67\\xbe\\xee\\x7c\\x93\\xdc\\x10\\x9c\\x59\\x67\\x82\\x67\\xc8\\x16\\x83\\x6b\\xbe\\xc5\\xa4\\x3c\\x16\\x7d\\xd0\\x4e\\x92\\xbf\\x16\\x07\\x15\\xcb\\xc4\\x58\\x1c\\x8f\\x11\\xc2\\x93\\x64\\xab\\x8c\\xf9\\xb9\\x8a\\x78\\x11\\x5e\\x91\\x73\\x38\\xf9\\x3b\\x18\\x91\\x37\\x29\\xc0\\x96\\x5c\\xfa\\xa5\\x3c\\x09\\x78\\x38\\x0f\\x64\\xee\\x33\\x72\\x64\\x9c\\x3d\\x0d\\x07\\x7e\\x08\\xfc\\x45\\x8e\\x94\\x37\\x09\\x3c\\x34\\x56\\xe8\\xd4\\xe5\\x1c\\x5d\\xf4\\x52\\x4d\\xa7\\x9d\\x99\\xfe\\x4a\\x87\\xe4\\x9f\\xaf\\x92\\x24\\x48\\x79\\x62\\x0c\\x7e\\xe3\\xe9\\x0f\\xeb\\x1b\\x1f\\x73\\x81\\x88\\xfa\\x81\\x48\\x05\\x36\\x40\\x06\\xcc\\xf2\\x28\\x2c\\xba\\xa9\\x6e\\x63\\x96\\xf4\\x19\\x90\\x00\\x37\\xe4\\x1f\\x80\\x01\\x33\\xbb\\xbc\\xf9\\xb3\\x4b\\xb4\\xa5\\xa7\\xee\\x10\\xc4\\x5c\\x40\\xe8\\xc4\\xa6\\x34\\xbb\\xd7\\x26\\x69\\x72\\x65\\x9b\\x46\\xa3\\x28\\xcd\\xdb\\x48\\xc9\\xc6\\x41\\x30\\xdc\\x73\\x6e\\x2a\\x95\\x71\\x9e\\xb0\\xd3\\x36\\xde\\xf7\\xa4\\x7e\\xa8\\xee\\x40\\x82\\x12\\xd1\\x12\\x4f\\x2a\\x1a\\xab\\x1b\\x99\\x3f\\x50\\xe2\\x75\\x5e\\x49\\xf0\\xfb\\xa0\\x5d\\xb3\\x40\\xf6\\x14\\x35\\xf1\\xaa\\x98\\x51\\xbf\\x99\\x20\\xc9\\x01\\x97\\x3a\\xd3\\x89\\x12\\xa5\\x1b\\x46\\x76\\xf8\\x49\\xcd\\xd2\\x64\\x9e\\xc8\\x17\\xb9\\xb2\\x07\\x49\\x5b\\x22\\x42\\xef\\xc7\\x58\\x20\\x65\\x25\\x48\\xb2\\xf2\\x21\\xda\\x06\\xee\\x81\\x45\\x5b\\xbd\\x64\\xaf\\xd9\\x9b\\x56\\xde\\x68\\x92\\x73\\x4f\\x04\\xef\\xef\\xef\\x4e\\x0c\\x5d\\x3d\\xd0\\x7a\\xef\\x08\\x85\\x4b\\x9c\\x1d\\xa5\\xab\\x30\\x0c\\x28\\x8f\\x80\\x10\\xff\\x9d\\x70\\x3f\\x44\\x0d\\x60\\xb0\\xf3\\x98\\x83\\xef\\xea\\x74\\xc9\\x98\\xef\\x29\\xb8\\x3e\\xf6\\x34\\xe0\\xd9\\x2c\\xf0\\xf6\\x97\\xb6\\xfd\\x3c\\x0f\\x41\\x21\\xae\\x51\\x27\\xaa\\x85\\xff\\x01\\x7c\\x82\\x9d\\x2c\\x4b\\x66\\x5e\\x2c\\x1c\\x23\\x4c\\xa7\\x6a\\x18\\x26\\x2a\\xc0\\x85\\xa7\\xfc\\x10\\xf9\\x3a\\x34\\xaa\\xaf\\x16\\x41\\x33\\x31\\x7d\\xb1\\xf1\\x0b\\xbf\\xa7\\x88\\xf8\\x76\\xfe\\x5f\\x68\\x32\\x7f\\x6d\\x0b\\x5b\\x81\\xfd\\x6f\\xa7\\x72\\xcf\\x56\\x7d\\x11\\xa1\\xba\\xb6\\x74\\x13\\xa6\\x9b\\x97\\x30\\x5b\\x6d\\xc2\\x78\\xbd\\x79\\x72\\x79\\xf0\\xbb\\x2e\\xa1\\xca\\x09\\xb3\\x37\\x9c\\xcc\\xde\\x9d\\xaf\\x3d\\xe2\\xfb\\x4f\\x0d\\x62\\xb2\\xad\\x7a\\x84\\x18\\x7c\\xc9\\x1b\\xb4\\xb4\\x7c\\x18\\x6c\\x21\\xf6\\xbd\\x10\\xce\\x40\\x3d\\xa5\\xff\\x5c\\xb1\\xfc\\x70\\x5d\\x96\\x25\\xee\\x99\\x62\\xf3\\x4d\\xcd\\xac\\x04\\x4d\\x2e\\x6e\\x23\\xc1\\x93\\x61\\x23\\x8f\\x02\\x4a\\x19\\xcb\\x66\\x0e\\x26\\x32\\x0c\\xbb\\x84\\x7a\\x74\\x5d\\x56\\x40\\xc7\\xdd\\xff\\x28\\x7d\\xd6\\x8e\\x4f\\x1e\\x44\\xcb\\xbb\\x9e\\x40\\xd4\\x6c\\x91\\x94\\x50\\xba\\xfb\\x83\\xcc\\x25\\xa9\\x4d\\x69\\x37\\xbb\\xcf\\xcf\\xcf\\x8b\\x9d\\xb2\\xc5\\x29\\x9c\\x93\\x6d\\x2a\\x0d\\x8f\\x6b\\x86\\xa6\\xe5\\xde\\xbf\\x89\\x7e\\xea\\xf1\\x7e\\xc8\\x39\\xc0\\x45\\x0a\\x3f\\x27\\x81\\x98\\xb9\\x2a\\xc5\\xd8\\x5e\\x50\\x8c\\x5e\\x16\\x6f\\x60\\x6d\\x55\\x30\\xab\\x64\\x71\\x47\\x8b\\x1f\\x77\\x1a\\x5d\\x83\\xf8\\xd1\\x35\\xb8\\xd8\\x78\\x95\\x25\\xfb\\x5c\\x3f\\x4d\\x99\\x1e\\x7a\\xd4\\xd8\\xf4\\x2a\\x53\\xf6\\xf4\\x66\\xda\\xf4\\xd3\\xf3\\x12\\x88\\xe7\\x1b\\xa6\\x78\\x38\\xcf\\x44\\x63\\x19\\x17\\xa7\\xb0\\x36\\xf8\\x30\\x9e\\x81\\x61\\x25\\x9a\\x5d\\xbb\\xf3\\x9d\\xf8\\xb8\\xdb\\x83\\x7c\\x25\\x66\\x7e\\x4f\\x70\\xff\\xb6\\x10\\x7e\\xa7\\x43\\x9c\\x51\\x89\\x2f\\x3c\\xc4\\x1b\\x3f\\x9d\\xb7\\xa7\\xf6\\xb6\\x71\\xb6\\xf1\\xeb\\x9e\\x45\\x95\\x5c\\xfc\\x2c\\x60\\xdb\\x11\\x7c\\x62\\xb0\\x18\\x2b\\xa5\\xa8\\x24\\x98\\xd7\\xba\\x32\\x53\\x64\\xeb\\x75\\xa8\\x7f\\xd2\\xa7\\xc2\\x58\\x19\\x9e\\x03\\x5b\\x50\\x55\\xa2\\x04\\x49\\x87\\xee\\x42\\x0c\\x03\\xce\\x16\\x55\\xd3\\x76\\xe5\\x53\\xb5\\x8d\\xa2\\xd9\\xe2\\x46\\x63\\xb7\\x64\\xd2\\x84\\x76\\xa0\\x46\\xf8\\x9a\\xcb\\xce\\xc2\\x34\\x2a\\x5e\\x93\\x14\\xea\\x6b\\x00\\x8c\\xf6\\x4d\\x8e\\xe1\\x8e\\x15\\xbe\\x2f\\x88\\xce\\x07\\xc4\\xa0\\x30\\xde\\x52\\x3c\\xaa\\x9c\\x29\\x68\\x8b\\xef\\x6d\\x40\\x7d\\xbd\\xa6\\xb7\\x2d\\x9d\\x4e\\x98\\xda\\x1f\\x75\\xed\\x6a\\x39\\x7e\\x7b\\x5a\\x56\\xe3\\xfa\\x69\\xd2\\xc4\\xad\\x54\\x38\\xb5\\x1a\\x57\\xe3\\x15\\x26\\xf4\\xbe\\xcb\\x68\\x51\\x0c\\xb3\\xd6\\x56\\xbb\\xe4\\x43\\x5e\\x8c\\xeb\\x21\\x3e\\xd8\\xb8\\x1c\\x55\\x50\\x5c\\x7b\\x96\\xf0\\xd5\\xe9\\x0e\\xf6\\x9a\\xc3\\xd9\\x5c\\x36\\x0f\\x7d\\x89\\x86\\x71\\x68\\x4c\\x5f\\x23\\xc3\\xe4\\x7b\\x3b\\x7d\\xb3\\xd4\\x15\\x1c\\x9e\\x6f\\x35\\xa0\\x7b\\xd4\\x70\\x7f\\xd1\\x10\\xd1\\xdc\\xca\\xc7\\x4e\\x21\\x7a\\xa4\\x1f\\x08\\xa6\\xfd\\x29\\x8f\\xee\\x73\\x5e\\xb3\\x7a\\x0d\\xf5\\x4f\\xfc\\xba\\xf6\\xfb\\x8d\\x61\\xce\\x25\\x14\\x86\\xac\\xaf\\x75\\x4b\\x18\\x23\\xb5\\x71\\xfb\\x3f\\xe0\\x56\\x7c\\xe6\\x9b\\x7d\\xf9\\x3c\\x90\\x04\\xc9\\x4c\\xd3\\x3f\\x2c\\xdb\\x2b\\xe9\\xb8\\x62\\x2a\\xa4\\x75\\xf5\\xb1\\xd6\\xfa\\x70\\x64\\x36\\x09\\xb9\\xd7\\x35\\x37\\xed\\xd3\\xa8\\x91\\xba\\x53\\xae\\xdd\\x33\\x14\\x8f\\x0a\\xd6\\x56\\x4c\\xf4\\xcb\\x7a\\xbb\\x97\\xf1\\x75\\x42\\xf8\\xaf\\xd8\\xd7\\x05\\x07\\xac\\x1a\\x2e\\x52\\xb0\\xdb\\xf0\\x1f\\xc9\\xb6\\xe0\\xa1\\x93\\x37\\x84\\x00\\xf7\\xe2\\x8d\\xdf\\x13\\x4e\\xe9\\xe3\\x23\\xbc\\xde\\x3c\\x59\\xda\\xc1\\x7d\\xc8\\x4c\\x67\\x1c\\x99\\x0a\\xb8\\xef\\x89\\x62\\x42\\x4a\\xe3\\x03\\x5f\\xc5\\x02\\x61\\xca\\x9b\\xf6\\xf2\\xa6\\x52\\x5e\\xeb\\xb2\\x79\\x6c\\xbf\\x62\\x98\\xcb\\xeb\\x9e\\xac\\x8c\\xf5\\x73\\x3f\\xcf\\x48\\xeb\\x83\\x8b\\x69\\xab\\x63\\x77\\xce\\xa3\\x9e\\x2a\\x94\\x9d\\x46\\xfb\\x13\\xaa\\x60\\x50\\xa1\\x8f\\x9b\\x22\\x12\\xc6\\xdd\\x1b\\xba\\x18\\x3e\\xae\\xcd\\x45\\xae\\xe2\\x1d\\x69\\x78\\x60\\xcb\\x7c\\x09\\x42\\x7f\\x39\\xa0\\xf9\\xf2\\xbe\\x9a\\x70\\xbb\\x1a\\x94\\xf6\\x7c\\xc7\\xea\\xa2\\x96\\xef\\xce\\x81\\xbc\\x17\\xae\\x09\\xbf\\x31\\xef\\x7f\\x1b\\xd0\\x46\\x39\\x79\\x90\\x37\\x4a\\xee\\x7f\\x0a\\xc1\\xe5\\x6b\\xe6\\x6c\\xd9\\xab\\xbe\\x4a\\x17\\x79\\x57\\x60\\xad\\x1a\\x57\\x7c\\x81\\xf2\\xff\\x00\\x00\\x00\\xff\\xff\\x04\\x28\\x3d\\x62\\xbe\\x20\\x00\\x00\")\n\nfunc uiCssLibsNvd3171NvD3MinCssBytes() ([]byte, error) {\n return bindataRead(\n _uiCssLibsNvd3171NvD3MinCss,\n \"ui/css/libs/nvd3/1.7.1/nv.d3.min.css\",\n )\n}\n\nfunc uiCssLibsNvd3171NvD3MinCss() (*asset, error) {\n bytes, err := uiCssLibsNvd3171NvD3MinCssBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/css/libs/nvd3/1.7.1/nv.d3.min.css\", size: 8382, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiCssRest_explorerCss = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\x94\\x54\\xdd\\x6f\\xdb\\x36\\x10\\x7f\\xe7\\x5f\\x71\\xc8\\x30\\xa4\\x0d\\xfc\\x91\\xb6\\xdb\\x8b\\x02\\x0c\\x53\\xdc\\x0c\\x13\\x16\\x38\\x83\\xe5\\xac\\xe8\\x23\\x45\\x9d\\x24\\xa2\\x14\\x8f\\x23\\xa9\\xc8\\xc6\\xb0\\xff\\x7d\\x47\\xc9\\xd9\\x9a\\x64\\x5f\\xf5\\x93\\x8f\\xbc\\xbb\\xdf\\xc7\\x1d\\xb5\\xbe\\xb8\\x10\\x1b\\x72\\x47\\xaf\\xdb\\x2e\\xc2\\xdb\\xcb\\x37\\xdf\\xc0\\xbe\\x43\\xd8\\x90\\xfa\\xe4\\x49\\xaa\\x0e\\xf2\\x21\\x76\\xe4\\xc3\\x4a\\x88\\x5b\\xad\\xd0\\x06\\xac\\x61\\xb0\\x35\\x7a\\x88\\x9c\\x96\\x3b\\x4e\\x41\\x38\\xdd\\x2c\\xe0\\x17\\xf4\\x41\\x93\\x85\\xb7\\xab\\x4b\\x78\\x95\\x12\\xce\\x4e\\x57\\x67\\xaf\\xaf\\xc4\\x91\\x06\\xe8\\xe5\\x11\\x2c\\x45\\x18\\x02\\x72\\x03\\x1d\\xa0\\xd1\\x06\\x01\\x0f\\x0a\\x5d\\x04\\x6d\\x41\\x51\\xef\\x8c\\x96\\x56\\x21\\x8c\\x3a\\x76\\x13\\xc8\\xa9\\xc5\\x4a\\x7c\\x3c\\x35\\xa0\\x2a\\x4a\\xce\\x95\\x9c\\xed\\x38\\x6a\\x3e\\xcf\\x02\\x19\\x85\\x00\\xfe\\x75\\x31\\xba\\x6c\\xbd\\x1e\\xc7\\x71\\x25\\x27\\x96\\x2b\\xf2\\xed\\xda\\xcc\\x59\\x61\\x7d\\x5b\\x6c\\x6e\\xb6\\xe5\\xcd\\x92\\x99\\x0a\\x71\\x6f\\x0d\\x86\\x00\\x1e\\x7f\\x1d\\xb4\\x67\\x81\\xd5\\x11\\xa4\\x63\\x1e\\x4a\\x56\\xcc\\xce\\xc8\\x11\\xc8\\x83\\x6c\\x3d\\xf2\\x5d\\xa4\\xc4\\x73\\xf4\\x3a\\x6a\\xdb\\x2e\\x20\\x50\\x13\\x47\\xe9\\x51\\xd4\\x3a\\x44\\xaf\\xab\\x21\\x3e\\x31\\xe8\\x91\\x15\\x2b\\xfd\\x3c\\x81\\x2d\\x92\\x16\\xce\\xf2\\x12\\x8a\\xf2\\x0c\\xae\\xf3\\xb2\\x28\\x17\\xe2\\x43\\xb1\\xff\\xf1\\xee\\x7e\\x0f\\x1f\\xf2\\xdd\\x2e\\xdf\\xee\\x8b\\x9b\\x12\\xee\\x76\\xb0\\xb9\\xdb\\xbe\\x2f\\xf6\\xc5\\xdd\\x96\\xa3\\x1f\\x20\\xdf\\x7e\\x84\\x9f\\x8a\\xed\\xfb\\x05\\x20\\xdb\\xc3\\x20\\x78\\x70\\x3e\\x71\\x27\\x2f\\x74\\xb2\\x0e\\xeb\\x15\\x94\\x88\\x4f\\xc0\\x1b\\x9a\\xc9\\x04\\x87\\x4a\\x37\\x5a\\xb1\\x22\\xdb\\x0e\\xb2\\x45\\x68\\xe9\\x01\\xbd\\x65\\x21\\xc2\\xa1\\xef\\x75\\x48\\xc3\\x0b\\x4c\\xad\\x06\\xa3\\x7b\\x1d\\x65\\x9c\\xe2\\x17\\x72\\xfe\\x82\\xc8\\xef\\x99\\xf3\\xae\\x9c\\xc6\\x28\\x12\\x8e\\x95\\x3d\\x86\\x34\\x13\\x45\\x76\\x96\\x3b\\x2f\\xcf\\xbc\\x46\\x19\\xe4\\xb6\\xf6\\x38\\xc2\\x35\\xd9\\x07\\xe4\\x04\\x84\\x57\\x8c\\x76\\xac\\x18\\xe6\\xfb\\xb6\\x97\\xda\\xac\\x78\\x03\\x5e\\x8b\\x8b\\xb5\\x58\\xb1\\xac\\x78\\x73\\x70\\x86\\x3c\\xfa\\xc5\\xd3\\x70\\x93\\x7a\\x93\\x09\\xcf\\x8e\\x6f\\xa9\\x85\\xdf\\x78\\xf8\\x1d\\xa6\\x65\\xce\\xe0\\xcd\\xe5\\xe5\\xd7\\x57\\xe2\\xf7\\x2f\\xaa\\x6d\\x0c\\x49\\x2e\\x35\\xd8\\xc4\\x2b\\x0e\\x9d\\xac\\x6b\\xb6\\x27\\xf5\\x72\\x07\\x7e\\x1e\\xee\\x90\\x4e\\x47\\x5d\\xc7\\x2e\\x83\\x6f\\xff\\xa5\\xfd\\xd4\\xac\\x92\\xea\\x53\\xeb\\x89\\xfd\\x5b\\x2a\\x32\\x49\\xfe\\x57\\x4d\\xd3\\xfc\\x63\\xcd\\x52\\xcd\\x7f\\xa6\\xda\\x5e\\xfa\\x56\\xdb\\x65\\x45\\x31\\x52\\x9f\\x9d\\xa0\\xff\\xab\\xf0\\x3b\\xe8\\xde\\xcd\\x32\\xf8\\x60\\x39\\x9e\\x7c\\xb0\\xe4\\x7b\\x69\\x12\\xf1\\x88\\x87\\xb8\\x8c\\x5e\\xda\\xc0\\xb3\\xe2\\xae\\x83\\xe3\\xb9\\x2b\\x19\\xf0\\xea\\x25\\xe2\\xbb\\xff\\x03\\xa8\\xad\\x1b\\xe2\\x9f\\x88\\x19\\xc7\\xbc\\x94\\x3a\\xbe\\x28\\x7c\\xb4\\xd7\\x51\\xd0\\x69\\xa9\\x32\\x7e\\x6c\\x86\\xd7\\xeb\\x61\\x42\\x9e\\xd8\\x36\\xb2\\xd7\\xe6\\x98\\xc1\\x79\\x49\\x83\\x57\\xe9\\x13\\x54\\x23\\xfc\\xec\\xe9\\x7c\\x01\\xe7\\x1b\\x3e\\xd2\\xbc\\x83\\x5b\\x1c\\x39\\x3c\\x45\\x0b\\xe8\\xc9\\x52\\xe0\\xc7\\x8d\\x7f\\x87\\xb7\\x54\\x06\\xa5\\xbf\\x1e\\x58\\x8d\\x7d\\x86\\x2d\\xab\\x40\\x86\\x1f\\x62\\xc2\\xf6\\xb3\\x47\\x8f\\xa3\\x8d\\xe4\\xe6\\x61\\xa7\\x96\\x7f\\x04\\x00\\x00\\xff\\xff\\x29\\xec\\xd5\\x5f\\x1d\\x05\\x00\\x00\")\n\nfunc uiCssRest_explorerCssBytes() ([]byte, error) {\n return bindataRead(\n _uiCssRest_explorerCss,\n \"ui/css/rest_explorer.css\",\n )\n}\n\nfunc uiCssRest_explorerCss() (*asset, error) {\n bytes, err := uiCssRest_explorerCssBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/css/rest_explorer.css\", size: 1309, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiIndexHtml = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\x94\\x55\\x51\\x93\\x9b\\x36\\x10\\x7e\\xe7\\x57\\x6c\\xe8\\x83\\x93\\x89\\x0d\\xbe\\x5c\\x3a\\x6d\\xaf\\xf6\\xb5\\xc4\\x71\\x1b\\x4f\\x53\\xae\\x63\\x7c\\xcd\\xe4\\xa9\\x23\\xc3\\x02\\x4a\\x84\\x44\\x25\\x61\\x1f\\x33\\xfd\\xf1\\x5d\\x01\\xbe\\xf8\\x5a\\x2e\\x93\\xf8\\xc5\\x48\\xfb\\xed\\xee\\xb7\\xbb\\xdf\\xc2\\xe2\\xc9\\x6c\\xe6\\xad\\x54\\xdd\\x6a\\x5e\\x94\\x16\\x5e\\xcc\\x2f\\x5e\\xc2\\xae\\x44\\x58\\xa9\\xf4\\xa3\\x56\\x2c\\x2d\\x21\\x6a\\x6c\\xa9\\xb4\\x09\\x3c\\xef\\x2d\\x4f\\x51\\x1a\\xcc\\xa0\\x91\\x19\\x6a\\xb0\\x04\\x8b\\x6a\\x82\\x20\\x0c\\x96\\x29\\xfc\\x89\\xda\\x70\\x25\\xe1\\x45\\x30\\x87\\xa7\\x0e\\xe0\\x0f\\x26\\xff\\xd9\\x8f\\x5e\\xab\\x1a\\xa8\\x58\\x0b\\x52\\x59\\x68\\x0c\\x52\\x00\\x6e\\x20\\xe7\\x02\\x01\\xef\\x52\\xac\\x2d\\x70\\x09\\xa9\\xaa\\x6a\\xc1\\x99\\x4c\\x11\\x8e\\xdc\\x96\\x5d\\x92\\x21\\x44\\xe0\\xbd\\x1f\\x02\\xa8\\xbd\\x65\\x84\\x65\\x84\\xae\\xe9\\x94\\x9f\\xa3\\x80\\x59\\xcf\\x03\\xfa\\x95\\xd6\\xd6\\x57\\x61\\x78\\x3c\\x1e\\x03\\xd6\\xb1\\x0c\\x94\\x2e\\x42\\xd1\\xa3\\x4c\\xf8\\x76\\xb3\\x5a\\xc7\\xc9\\x7a\\x46\\x4c\\x3d\\xef\\x56\\x0a\\x34\\x06\\x34\\xfe\\xdd\\x70\\x4d\\x05\\xee\\x5b\\x60\\x35\\xf1\\x48\\xd9\\x9e\\xd8\\x09\\x76\\x04\\xa5\\x81\\x15\\x1a\\xc9\\x66\\x95\\xe3\\x79\\xd4\\xdc\\x72\\x59\\x4c\\xc1\\xa8\\xdc\\x1e\\x99\\x46\\x2f\\xe3\\xc6\\x6a\\xbe\\x6f\\xec\\x83\\x06\\x9d\\x58\\x51\\xa5\\xe7\\x00\\x6a\\x11\\x93\\xe0\\x47\\x09\\x6c\\x12\\x1f\\x5e\\x45\\xc9\\x26\\x99\\x7a\\xef\\x36\\xbb\\x37\\x37\\xb7\\x3b\\x78\\x17\\x6d\\xb7\\x51\\xbc\\xdb\\xac\\x13\\xb8\\xd9\\xc2\\xea\\x26\\x7e\\xbd\\xd9\\x6d\\x6e\\x62\\x3a\\xfd\\x02\\x51\\xfc\\x1e\\x7e\\xdb\\xc4\\xaf\\xa7\\x80\\xd4\\x1e\\x4a\\x82\\x77\\xb5\\x76\\xdc\\x95\\xf6\\xb8\\x6b\\x1d\\x66\\x01\\x24\\x88\\x0f\\x92\\xe7\\xaa\\x27\\x63\\x6a\\x4c\\x79\\xce\\x53\\xaa\\x48\\x16\\x0d\\x2b\\x10\\x0a\\x75\\x40\\x2d\\xa9\\x10\\xaf\\x46\\x5d\\x71\\xe3\\x86\\x67\\x88\\x5a\\x06\\x82\\x57\\xdc\\x32\\xdb\\x9d\\xff\\x57\\xce\\xa7\\x14\\xd1\\x2d\\x71\\xde\\x26\\xdd\\x18\\x3d\\x97\\x47\\xb2\\x0a\\x8d\\x9b\\x49\\xaa\\x64\\x5f\\x6e\\x2f\\x9e\\x5e\\x46\\x57\\x10\\xc9\\x4c\\xe3\\x11\\x5e\\x29\\x79\\x40\\x02\\x20\\x3c\\xa5\\x6c\\xed\\x9e\\xd2\\xfc\\x5c\\x54\\x8c\\x8b\\x80\\x14\\xf0\\xcc\\x9b\\xcd\\xae\\xbd\\xc5\\x93\\x4c\\xa5\\xb6\\xad\\x91\\x46\\x59\\x09\\x3a\\xf7\\x7f\\x00\\x8b\\x12\\x59\\x76\\xdd\\x0d\\x79\\x51\\xa1\\x25\\x19\\x94\\x4c\\x1b\\xb4\\x4b\\xbf\\xb1\\xf9\\xec\\x7b\\x7f\\x30\\x09\\x2e\\x3f\\x42\\xa9\\x31\\x5f\\x4e\\x9c\\x16\\x0c\\x89\\x21\\x27\\x4e\\x26\\x28\\x94\\x2a\\x04\\xb2\\x9a\\x1b\\x97\\x2c\\x4c\\x8d\\xf9\\x29\\x67\\x15\\x17\\xed\\x32\\x51\\x8d\\x4e\\xf1\\x79\\xc2\\xa4\\x79\\xfe\\x87\\x56\\x57\\x2f\\xe7\\xf3\\xe9\\x0f\\xf3\\xf9\\x3f\\xc3\\xfd\\x4a\\x65\\xe8\\xee\\x27\\xa4\\x14\\xb1\\x9c\\x18\\xdb\\x92\\x6c\\x4a\\x44\\x3b\\x01\\xc7\\x73\\x39\\xb1\\x78\\x67\\x5d\\xbc\\xc9\\x39\\x05\\x87\\xf5\\x3f\\x61\\xfd\\x9e\\x93\\xef\\x70\\x24\\xc7\\xbd\\x09\\xe5\\x21\\xbb\\x0c\\x2f\\x82\\xef\\x82\\x0b\\x7a\\x0c\\xb2\\xcb\\xa0\\xe2\\x32\\x20\\xab\\xff\\xa5\\x51\\x48\\xab\\x5f\\x85\\x27\\xc1\\xd8\\xbf\\x48\\x38\\x42\\x69\\xd4\\x5f\\xe5\\x59\\x68\\x56\\x97\\xe7\\x1e\\x26\\xd5\\x9c\\x36\\xd7\\xe8\\x94\\x10\\x1f\\x86\\x82\\xa8\\x9c\\xcb\\xe0\\x32\\xf8\\x36\\x1c\\x6a\\xf9\\x40\\xf0\\x45\\xd8\\x43\\x3f\\xe7\\x37\\xda\\x88\\x2f\\x75\\x26\\xb9\\x96\\x9a\\x0b\\x3a\\xce\\x03\\x5a\\xea\\xd3\\xf9\\xb1\\x18\\x96\\x5b\\x81\\xd7\\xf7\\xaf\\xb9\\x45\\xd8\\x5f\\x38\\x79\\x85\\x27\\x7d\\x2d\\xf6\\x2a\\x6b\\x07\\xbc\\xbb\\xa3\\x25\\x48\\x05\\x33\\x66\\xe9\\x53\\xc7\\x63\\x76\\x18\\x9a\\x40\\x56\\x36\\x34\\xe9\\x9b\\xd0\\x7f\\x08\\x99\\x75\\x2d\\x1d\\x9e\\x4b\\x55\\x61\\x4c\\xfb\\xe1\\x9f\\xe7\\x65\\x23\\x41\\x2a\\x25\\x39\\xed\\xcd\\x58\\x2c\\xff\\xfa\\xf7\\xde\\x38\\xee\\xe9\\x46\\x3b\\x3b\\x8d\\x76\\xdc\\x7f\\xbb\\x4e\\x76\\xb0\\x1e\\x20\\xe3\\x51\\x24\\x09\\xdd\\x8c\\x7b\\xc7\\xce\\x34\\xee\\x65\\x88\\xd5\\x63\\x6e\\x49\\x67\\x1b\\xf7\\xeb\\x44\\x35\\xee\\xf6\\xab\\x33\\xdd\\x7b\\xf5\\x93\\x41\\x3d\\x9c\\x32\\x7e\\x00\\x9e\\x2d\\x7d\\xad\\x94\\xbd\\x77\\xcf\\x1b\\x21\\xde\\xa0\\xfb\\x98\\xad\\x68\\xd9\\xe9\\x33\\x41\\x6d\\xa0\\xd9\\x13\\xf6\\x11\\xf1\\xb8\\xe5\\xf9\\xaf\\x3e\\x16\\x61\\x3f\\x79\\x4a\\xd8\\xbd\\x73\\xfe\\x0d\\x00\\x00\\xff\\xff\\xee\\xd4\\x3d\\x5f\\x26\\x07\\x00\\x00\")\n\nfunc uiIndexHtmlBytes() ([]byte, error) {\n return bindataRead(\n _uiIndexHtml,\n \"ui/index.html\",\n )\n}\n\nfunc uiIndexHtml() (*asset, error) {\n bytes, err := uiIndexHtmlBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/index.html\", size: 1830, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiJsAppJs = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\xec\\x3d\\x7f\\x73\\xdb\\x36\\xb2\\x7f\\x5f\\x3f\\x05\\xaa\\x99\\x9c\\xa9\\x8b\\x4c\\xd9\\xed\\xdc\\xcd\\x7b\\xf2\\xb9\\x77\\x6e\\xec\\xa6\\xbe\\x4b\\xec\\x3c\\xdb\\xc9\\xbd\\x8e\\xc7\\xe3\\xa1\\x45\\x58\\x62\\x4b\\x91\\x2a\\x49\\xf9\\xc7\\xf5\\xfc\\xdd\\xdf\\x2e\\x7e\\x90\\x00\\x08\\x90\\x94\\x6c\\x39\\x69\\x5e\\x38\\x99\\x48\\x02\\x17\\x8b\\xc5\\x62\\xb1\\xd8\\x5d\\x00\\xeb\\xe1\\x90\\xbc\\xa6\\x09\\xcd\\x82\\x82\\x86\\xe4\\xea\\x9e\\x14\\xf9\\xd8\\xff\\x0a\\x0a\\xf3\\x74\\x91\\x8d\\xe9\\x88\\x8c\\xd3\\xf1\\x2f\\x59\\x1a\\x8c\\xa7\\xc3\\x8c\\xf2\\xb2\\xe1\\x22\\x1f\\x16\\xf9\\xd0\\xf7\\x19\\xdc\\xfe\\x31\\x39\\x3a\\x3e\\x23\\x07\\xfb\\x87\\x67\\x5f\\xc3\\x6f\\x2c\\x7a\\x95\\xce\\xef\\xb3\\x68\\x32\\x2d\\xc8\\x37\\x5b\\xdb\\x7f\\x26\\x67\\x53\\x0a\\x45\\x02\\x0b\\xd9\\x5b\\x14\\xd3\\x34\\xcb\\x7d\\x01\\xfb\\x26\\x1a\\xd3\\x24\\x87\\xa6\\x17\\x49\\x48\\x33\\x52\\x00\\xec\\xde\\x1c\\xe0\\xa8\\x7c\\x33\\x20\\x1f\\x68\\x96\\x47\\x69\\x42\\xbe\\xf1\\xb7\\x88\\x87\\x00\\x3d\\xf1\\xaa\\xd7\\xdf\\x41\\x14\\xf7\\xe9\\x82\\xcc\\x82\\x7b\\x92\\xa4\\x05\\x59\\xe4\\x14\\x70\\x44\\x39\\xb9\\x8e\\x62\\x4a\\xe8\\xdd\\x98\\xce\\x0b\\x12\\x25\\xd0\\x8b\\xd9\\x3c\\x8e\\x82\\x64\\x4c\\xc9\\x6d\\x54\\x4c\\x59\\x3b\\x02\\x0b\\xeb\\xc5\\x4f\\x02\\x47\\x7a\\x55\\x04\\x00\\x1e\\x40\\x85\\x39\\xfc\\xba\\x56\\x01\\x49\\x50\\x08\\xa2\\xf1\\x99\\x16\\xc5\\x7c\\x34\\x1c\\xde\\xde\\xde\\xfa\\x01\\x23\\xd8\\x4f\\xb3\\xc9\\x30\\xe6\\xa0\\xf9\\xf0\\xcd\\xe1\\xab\\x83\\xa3\\xd3\\x83\\x4d\\x20\\x5a\\x54\\x7a\\x9f\\xc4\\x34\\xcf\\x49\\x46\\x7f\\x5d\\x44\\x19\\xe7\\x75\\x30\\x07\\xa2\\xc6\\xc1\\x15\\x90\\x1a\\x07\\xb7\\x24\\xcd\\x48\\x30\\xc9\\x28\\xbc\\x2b\\x52\\x24\\xfa\\x36\\x8b\\x8a\\x28\\x99\\x0c\\x60\\x2c\\xae\\x8b\\xdb\\x20\\xa3\\x88\\x26\\x8c\\xf2\\x22\\x8b\\xae\\x16\\x85\\xc6\\x33\\x49\\x22\\xf4\\x5c\\x05\\x00\\xae\\x05\\x09\\xe9\\xed\\x9d\\x92\\xc3\\xd3\\x1e\\xf9\\x7e\\xef\\xf4\\xf0\\x74\\x80\\x48\\xfe\\x75\\x78\\xf6\\xe3\\xf1\\xfb\\x33\\xf2\\xaf\\xbd\\x93\\x93\\xbd\\xa3\\xb3\\xc3\\x83\\x53\\x72\\x7c\\x42\\x5e\\x1d\\x1f\\xc1\\x28\\x1e\\x1e\\x1f\\xc1\\xaf\\x1f\\xc8\\xde\\xd1\\x4f\\xe4\\x9f\\x87\\x47\\xfb\\x03\\x42\\x81\\x63\\xd0\\x0e\\xbd\\x9b\\x67\\xd8\\x83\\x34\\x43\\x14\\x11\\x32\\x94\\x86\\x3e\\x39\\xa5\\x54\\x23\\xe1\\x3a\\xe5\\x24\\xe5\\x73\\x3a\\x8e\\xae\\xa3\\x31\\x74\\x2d\\x99\\x2c\\x82\\x09\\x25\\x93\\xf4\\x86\\x66\\x09\\xf4\\x08\\xeb\\xcf\\x69\\x36\\x8b\\x72\\x1c\\xd8\\x1c\\x68\\x0c\\x49\\x1c\\xcd\\xa2\\x22\\x28\\xd8\\xef\\x5a\\xbf\\xaa\\x56\\xf6\\xde\\x03\\xe5\\x27\\xa7\\x6c\\x7c\\x11\\x0d\\xb6\\x96\\x04\\x33\\x9a\\xe3\\x60\\x8d\\xd3\\x84\\x77\\x5d\\x11\\x30\\x21\\x6f\\x23\\xf2\\x7d\\x16\\xcc\\xc8\\xeb\\x6c\\x91\\xd0\\x28\\x23\\xde\\x15\\xfc\\xf2\\x27\\xfc\\xd7\\xdf\\x27\\xb3\\x20\\x8a\\x7d\\x90\\x91\\x3e\\xd4\\xf8\\xc3\\x1f\\x70\\x78\\xf7\\x92\\x30\\xa3\\xb7\\xe4\\xfb\\x34\\xb9\\xa1\\x80\\x94\\x12\\x0f\\x88\\xbc\\xbf\\x02\\xea\\x6c\\xd0\\x6f\\x83\\xa2\\x20\\x67\\x59\\x30\\xbe\\x27\\xde\\x0c\\xbe\\xff\\xbd\\x9c\\x35\\x71\\x70\\x95\\x4b\\xd8\\xaf\\x6e\\x82\\x8c\\x4c\\x69\\x00\\x9d\\xdb\\xa7\\xf9\\x38\\x8b\\xe6\\xd8\\x5d\\xb2\\x4b\\x36\\xce\\x4a\\x91\\xc5\\x01\\xa4\\x79\\x34\\x49\\xb8\\x14\\x04\\x61\\xc8\\xba\\xcd\\x6b\\x61\\x09\\xfe\\x2a\\xd2\\xb9\\x94\\x4d\\x40\\x7d\\x15\\x21\\xf0\\xcf\\x1c\\x81\\xbf\\xb1\\xa3\\xce\\xde\\x59\\x1a\\xd2\\x18\\xa6\\x6b\\x04\\x1c\\xa2\\x59\\x44\\x73\\xbf\\xc8\\xe1\\xfd\\x90\\xfc\\x35\\xa3\\xd7\\x34\\xa3\\x38\\x21\\xe6\\x41\\x31\\xdd\\xed\\xf9\\xfe\\xb0\\xb8\\x9f\\xc3\\xe0\\xe4\\x43\\x18\\x88\\x69\\x16\\xc5\\x3f\\x97\\xdf\\xfc\\x10\\xaa\\xf5\\xc8\\xf0\\xbb\\x8a\\xa1\\xa3\\x4e\\x7d\\xc6\\x0e\\xbf\\x65\\x24\\xec\\x7c\\xe5\\x5d\\x2f\\x92\\x31\\xeb\\xb0\\xc7\\x8b\\xfa\\xe4\\xb7\\xaf\\x90\\x79\\x0c\\x88\\xc2\\xc0\\x8d\\x01\\x0a\\x0b\\x54\\x48\\x5e\\x2e\\x41\\x8d\\xb7\\xff\\xb3\\xa0\\xd9\\xfd\\xde\\x04\\xe6\\xcc\\x24\\x80\\x31\\x57\\xa1\\xf0\\x31\\x5e\\x9f\\x9b\\xbf\\x7b\\x7b\\x1f\\x5e\\xf7\\x2e\\x80\\xff\\xdb\\xf8\\x1f\\xfb\\xb5\\xb3\\x34\\x82\\xcb\\x93\\xbd\\xb3\\x03\\x86\\xe5\\x1b\\x89\\x85\\x17\\x55\\xa8\\x1e\\xfa\\xb2\\x1f\\xbe\\x81\\x81\\xfc\\xe7\\x3f\\xc4\\xf9\\x6e\\x97\\xfc\\xf6\\xd0\\xef\\x57\\x68\\x90\\x4f\\x75\\x18\\x47\\xed\\xaa\\x5a\\xc9\\xae\\x5f\\x11\\xc2\\xcb\\x8b\\x20\\x2b\\x60\\x4e\\x27\\xe1\\x00\\xb4\\x0d\\x2a\\x17\\x26\\x17\\x26\\xef\\xb0\\xb1\\x45\\x16\\x63\\x8f\\x50\\xd9\\xb3\\xba\\x06\\x77\\x10\\x24\\x0c\\x8a\\x00\\x09\\xd5\\x5e\\xe0\\xc3\\x9a\\xb9\\x4c\\x82\\x24\\x85\\xa9\\xc7\\x7e\\xf8\\x13\\x5a\\x9c\\x81\\x1c\\x7a\\x7d\\xf2\\x27\\xb2\\xed\\x6f\\xd1\\xbf\\x0c\\x6a\\xb5\\x80\\x2a\\x59\\x07\\xbe\\x76\\xa9\\x81\\x84\\x01\\xf9\\x23\\xd1\\x0d\\x7f\\x16\\xcc\\x15\\x01\\xa9\\x89\\x84\\x7c\\x32\\x5a\\x2c\\xb2\\xc4\\xf1\\x12\\x1f\\xd4\\x29\\x23\\x92\\xd5\\x1b\\x94\\x4f\\x50\\xb2\\x7a\\xc4\\xf8\\x68\\x05\\x7c\\xd8\\xa9\\x15\\x3f\\xf4\\x75\\x50\\x03\\x44\\x10\\x36\\xf3\\x71\\x9d\\xa0\\x79\\xe1\\xfd\\x86\\xc3\\x30\\xc2\\xff\\x06\\x64\\x46\\x61\\xea\\x85\\x23\\xd2\\x7b\\x77\\x7c\\x7a\\xd6\\x83\\x41\\xbc\\x2b\\x60\\xfe\\x15\\x23\\x58\\xfa\\x92\\x7f\\xe4\\x69\\x72\\x90\\x65\\xa0\\xea\\x06\\x6c\\x54\\x46\\x7c\\x6c\\x1e\\xfa\\x35\\x0a\\x7c\\xd0\\x1b\\x89\\xc2\\xa4\\xd0\\xc6\\xa4\\xe8\\x9a\\x78\\x5f\\x87\\x40\\x45\\xbe\\x88\\x8b\\x9a\\x74\\xc8\\xa7\\x04\\x00\\x19\\x38\\xbf\\xb0\\x74\\xb6\\x56\\x52\\xd6\\xf0\\x41\\x73\\x1f\\x80\\xb2\\xe8\\x32\\x5a\\x8c\\x98\\xcc\\xc7\\x0e\\xcd\\xd3\\x28\\x71\\xd3\\xc3\\x38\\xa8\\xc0\\x39\\xc8\\xb2\\x93\\xf6\\xd0\\xaf\\x43\\x8a\\xe1\\x08\\xf5\\x37\\x2a\\xe4\\x83\\x36\\x3f\\x4f\\x28\\xac\\x57\\x05\\x9b\\x8b\\xd0\\xb6\\xd2\\x37\\x93\\xe2\\xf2\\x8d\\x52\\xc3\\xbb\\x8d\\x92\\x30\\xbd\\xdd\\x5f\\x64\\x6c\\x1d\\x1c\\x90\\x4b\\x10\\x2c\\x5b\\x57\\xb1\\x25\\x2e\\xef\\x8e\\x0e\\xe2\\xaa\\xe8\\x21\\xd4\\x65\\x84\\x8a\\x69\\x07\\x3f\\xff\\x4a\\x82\\x6c\\xb2\\x98\\x41\\x63\\xb9\\x1f\\xd3\\x64\\x52\\x4c\\xb1\\xf8\\xe5\\x4b\\x17\\x2f\\x79\\x03\\xe7\\x50\\x73\\x93\\xab\\xb6\\xb2\\x3a\\x94\\x75\\x1a\\x6b\\x34\\xc4\\x7c\\xbd\\x4f\\x80\\x46\\x2f\\xa8\\xe3\\x61\\xb5\\xb0\\xe7\\x00\\x8b\\x1f\\x2e\\x88\\x92\\x01\\xfc\\x8b\\x31\\x42\\xda\\x2f\\x85\\xc7\\xfe\\x3c\\x4b\\x8b\\x14\\x56\\x3a\\xea\\xff\\x2a\\x46\\xc9\\x3d\\x48\\x92\\xd7\\xa0\\x8b\\x50\\x0f\\x01\\x6c\\x02\\x36\\xc1\\x3e\\x98\\xca\\x9e\\x45\\x56\\xd8\\xa8\\xa0\\xa6\\x33\\x61\\x45\\x75\\x45\\x9d\\x6d\\xda\\x78\\xe3\\x16\\x3f\\x45\\x73\\x23\\x82\\x81\\x24\\x68\\x50\\x31\\x6b\\xa0\\x71\\xc5\\x40\\x65\\xd7\\x31\\x0a\\x57\\xb4\\xb5\\x4a\\xa9\\x2c\\x17\\x17\\x5d\\xac\\xad\\x15\\xcb\\xd5\\xe9\\x6d\\x90\\x80\\xb1\\x97\\x75\\x14\\x7f\\xb5\\x8a\\x77\\xc9\\x3a\\x6a\\x1b\\x05\\xde\\x39\\x39\\x62\\xfc\\x8b\\x4b\\x30\\xb8\\x82\\xc1\\x01\\x58\\xc4\\xb1\\x0b\\x88\\xa2\\xaa\\x6c\\x81\\xe1\\x88\\x0e\\xe6\\x29\\xb8\\x2d\\xbb\\x64\\xcb\\x05\\x96\\x2e\\x0a\\x18\\x9a\\x24\\x04\\xdb\\xc9\\x8a\\xf0\\xa1\\x6e\\x53\\x88\\x0e\\x2b\\xc2\\x08\\xdf\\xc6\\x60\\x5c\\x1f\\x6b\\xb8\\x9a\\x25\\x13\\xb5\\x62\\x8d\\x02\\xd7\\x6c\\xc6\\xe1\\x61\\x4e\\x10\\x45\\xbf\\x60\\xd7\\x52\\xd3\\x67\\x2c\\x81\\x96\\xbe\\xe6\\x9d\\x40\\xdb\\xa4\\x0e\\xc4\\x79\\x52\\x41\\x59\\x84\\x56\\xd2\\x56\\x36\\xd7\\xa4\\xad\\x8d\\x21\\x73\\x37\\x68\\x6f\\xa7\\x42\\x21\\x07\\xd4\\xd9\\xaf\\x36\\x04\\x6d\\xc3\\xe8\\xa2\\x9a\\xc9\\xc7\\xcb\\x97\\x9d\\x57\\x99\\xa6\\x99\\xe9\\x10\\x8e\\x9c\\x96\\x73\\xaf\\x12\\x89\\x5f\\xdb\\xe7\\xc9\\xaf\\x8d\\x6a\\xc0\\xd1\\x58\\x39\\x16\\xcd\\xd2\\xc7\\x5a\\xaa\\x4b\\xad\\x8d\\xcf\\x42\\xdf\\xa8\\x4c\\x5b\\x85\\x30\\x2a\\x26\\xe2\\x3a\\xe9\\x62\\x83\\xb9\\x12\\x71\\x42\\xfc\\xd6\\x43\\x1c\\xc3\\xbe\\xda\\x60\\x5e\\x43\\xc7\\x3a\\x72\\xcd\\x3d\\xd5\\x98\\x01\\xd6\\x59\\xd7\\xd8\\xe6\\x53\\x83\\xbd\\xc6\\x5a\\x1d\\xa9\\xa2\\xcb\\x97\\x66\\xaf\\xef\\xb6\\xbe\\x19\\x43\\xc0\\xbd\\xc5\\xae\\xce\\x3d\\xa6\\x88\\x3a\\x5b\\xe0\\x56\\x12\\x45\\xe7\\xb9\\x6d\\x8c\\xf8\\x06\\x2e\\x4d\\x62\\x61\\x4f\\x7d\\x96\\x6b\\xa3\\x57\\x6f\\xa6\\xcb\\xf2\\xac\\x8e\\x68\\xdb\\xfa\\x6c\\x2c\\xbc\\xf6\\xaa\\xa5\\x04\\x68\\xde\\x82\\x77\\x37\\xcd\\x06\\x24\\x9d\\xd7\\x8d\\x6a\\x41\\x07\\xbc\\xf7\\x81\\xfc\\x62\\x91\\x93\\xef\\xc8\\x37\\x5b\\x5b\\xe4\\x6f\\xe4\\x1f\\xa7\\xc7\\x47\\x3e\\x46\\x99\\x92\\x49\\x74\\x7d\\x8f\\x18\\xb0\\x5f\\xf3\\x34\\xc9\\xe9\\x19\\xf8\\x24\\x7d\\x32\\x22\\x66\\x99\\x69\\x30\\x57\\x3e\\x31\\xfa\\xb0\\x2c\\x1e\\xe0\\xcb\\x02\\xe6\\x14\\xeb\\x45\\xd2\\x17\\xc6\\x6a\\xec\\x8d\\x02\\x54\\xbe\\xd4\\xa2\\x96\\x33\\x68\\x1a\\x8d\\xd5\\xe1\\x4c\\xf0\\xe8\\xb1\\x81\\x8f\\xe6\\xaa\\xe1\\xb7\\xf0\\xaf\\x1d\\xdc\\x16\\x8f\\x61\\x15\\x70\\x7d\\x7e\\x55\\x12\\xad\\x45\\x4b\\xaa\\xe2\\x15\\x23\\x26\\x08\\xfe\\x26\\x4a\\xe8\\xeb\\x2c\\x98\\x2b\\xca\\x4d\\xa9\\x54\\xbe\\xb5\\x85\\x01\\x5e\\x61\\x54\\x2d\\x8d\\xe3\\x36\\x9b\\x4e\\x93\\xb1\\xaa\\x92\\x77\\x33\\x6b\\x32\\x4a\\x2e\\x59\\xb8\\x96\\xaf\\xdb\\x0d\\x73\\xf5\\x66\\x06\\x30\\x37\\xb3\\x06\\x88\\xf1\\x14\\xcc\\x63\\x5c\\xb9\\x6f\\x7c\\xce\\x65\\x3f\\x86\\x5e\\xbd\\xc2\\x52\\xaf\\xee\\x04\\xcb\\xc7\\xbf\\x33\\x3c\\x61\\x29\\xf6\\xa5\\xf5\\x0e\\x63\\x8a\\xa3\\x55\\x04\\xb3\\x39\\x8f\\x4d\\x90\\x21\\x0f\\x46\\xf4\\x77\\x6c\\xde\\x75\\x89\\xf8\\xde\\x81\\x38\\xf4\\x6f\\x82\\x78\\x41\\x9b\\x2b\\x2f\\x72\\x7a\\x98\\x14\\x14\\xbd\\xfb\\xe8\\x86\\xbe\\x5e\\x44\\xd0\\x21\\xe8\\x8d\\x57\\x64\\x0b\\xda\\x50\\x2d\\x9f\\xa6\\xb7\\x6f\\xe8\\x04\\xdc\\x83\\x2e\\x90\\x3f\\xed\\xdd\\x45\\x79\\x17\\xc0\\xff\\xed\\x02\\x78\\x77\\x3a\\x0e\\x62\\x60\\xd7\\xb7\\x8c\\x5f\\x7e\\xce\\x7e\\xf5\\x1d\\x66\\x17\\x1b\\xb1\\x30\\x0b\\x6e\\x99\\xd4\\x69\\xcb\\x13\\x8d\\x29\\x7a\\x99\\x03\\x12\\xe5\\x87\\x49\\x54\\x44\\x41\\x1c\\xfd\\x9b\\x86\\x03\\x16\\xdc\\x65\\xca\\xc5\\xbd\\x94\\xb0\\x65\\x4a\\xab\\xd6\\x04\\x8d\\x0f\\x08\\x4b\\x10\\x86\\x8c\\x08\\xef\\xb2\\x12\\xa3\\x06\\x63\\xb1\\xae\\xeb\\xd5\\xd6\\x39\\x0e\\xe0\\xd9\\x22\\x0e\\x4f\\x28\\x86\\xb1\\x41\\x86\\x02\\x60\\x43\\x0b\\x1d\\x38\\x13\\xc0\\x69\\xc7\\x38\\x2a\\x0d\\xf7\\x79\\x50\\xcd\\x15\\xb9\\xa8\\xb7\\x77\\x33\\xe3\\x2b\\x66\\xb9\\x82\\xb7\\x35\\x87\\x8f\\xd9\\x9c\\x03\\x55\\x19\\xaf\\xd1\\x23\\x6b\\xad\\x9c\\x95\\x4f\\x6b\\xa4\\xad\\xce\\x0a\\x98\\x1d\\xf9\\x08\\xe6\\x49\\x15\\xc7\\x71\\x1b\\x02\\xe6\\xf3\\x0b\\xbd\\xc7\\xaa\\x18\\xbe\\xeb\\x5e\\x69\\x9c\\xc6\\x68\\x4d\\x54\\x3a\\xcb\\x67\\x25\\xb9\\xc7\\x11\\x35\\xd8\\x21\\xe6\\x13\\x64\\x34\\x00\\x53\\x06\\x66\\x4a\\xf7\\x3a\\xd7\\x51\\x1c\\x1f\\xcf\\x83\\x71\\x54\\x00\\xe9\\xfe\\x76\\xb7\\x8a\\x0e\\xbb\\x46\\x03\\x69\\x90\\x62\\xf6\\xbe\\xf1\\x2d\\xcc\\xe3\\x1c\\xa6\\xe2\\xb8\\x90\\x13\\xd2\\x3d\\xf5\\xe5\\x83\\x03\\xb6\\x98\\x79\\x9a\\x60\\x75\\xa8\\x55\\x64\\x41\\x92\\x47\\x28\\x56\\x20\\x6d\\xa1\\x08\\x86\\x78\\x7f\\xde\\xda\\xea\\x50\\x17\\x94\\x4c\\xfc\\xa8\\x89\\xdb\\x64\\x1f\\x32\\x8c\\xfe\\x1d\\x2a\\x3f\\xb7\\xda\\x2b\\xa2\\xf1\\x2f\\x3f\\xb0\\x1e\\x97\\xaa\\x8f\\x33\\xc0\\xdb\\x78\\x71\\x38\\x7a\\xf1\\x76\\xf4\\xe2\\x74\\xa3\\xdf\\xa2\\x5f\\xdf\\x06\\x77\\x6f\\xa3\\xc4\\xbb\\x0e\\xe2\\x9c\\x76\\x32\\x2f\\x15\\x49\\x55\\xbc\\x44\\x43\\xeb\\xb4\\x1a\\xfd\\xf8\\xb0\\xf0\\x96\\x70\\xac\\x74\\x05\\xc0\\x4a\\x5d\\x6e\\x33\\xea\\x1e\\x5e\\xed\\xbb\\xb2\\x5a\\x1c\\xe4\\xdc\\x7f\\x6a\\xf5\\xf7\\x55\\x60\\x68\\x97\\xd6\\x9d\\x2e\\xf5\\x91\\xb6\\x34\\x4c\\xaa\\xae\\x4e\\xb6\\x52\\x8d\\x31\\xd5\\xc2\\xd3\\x7a\\x91\\x95\\xa9\\xd3\\x20\\xef\\xcc\\x4b\\xd5\\xe8\\x37\\xd9\\x08\\x7c\\xb2\\x04\\x90\\x9a\\xa9\\xe0\\x4a\\x08\\x9a\\xc6\\xb9\\x88\\xcb\\x29\\x88\\x7b\\x41\\x27\\x69\\x76\\xbf\\xbd\\xd5\\xe0\\x32\\x56\\x18\\xcc\\xa8\\xb5\\x59\\xa9\\xec\\xd2\\xb8\\xb2\\xd6\\x98\\xed\\x64\\xeb\\xa1\\x62\\x17\\xbd\\x32\\xc1\\x9b\\x02\\x5e\\xa5\\x6d\\xe9\\x8f\\x55\\x43\\x72\\xec\\xa0\\xb2\\xa4\\xe9\\x26\\xa2\\xb7\\xde\\xb8\\xc8\\xac\\xc4\\xb0\\xf8\\x12\\xbc\\x93\\xe3\\xe3\\x5e\\xf2\\xe4\\x86\\x8a\\xd7\\x63\\xf6\\xe0\\x04\\x29\\xe9\\x0d\\xc0\\x1c\\xcb\\x8b\\xfb\\x18\\x3c\\x85\\xde\\x6d\\x14\\x16\\xd3\\x11\\xa8\\x9b\\xf9\\xdd\\xce\\x94\\xe2\\xb1\\x85\\xd1\\xb7\\xec\\x47\\x8f\\x3c\\x0c\\xb0\\x5e\\x7e\\x33\\xf1\\xab\\x6a\\x40\\xf7\\x75\\x34\\x01\\x0f\\x03\\x5b\\xaf\\x2c\\x98\\x07\\x9b\\xa5\\x53\\x17\\x4c\\x30\\x4b\\x69\\x2b\\xa1\\xd0\\x4e\\x2f\\x4e\\x03\\xe6\\x2f\\xfa\\x7e\\xaf\\x15\\xb1\\x8b\\xdf\\xc8\\x41\\xb4\\x9a\\xe1\\xc3\\x35\\xee\\xb0\\x5c\\x81\\x89\\xcb\\x24\\x75\\x80\\x6b\\xa7\\x2b\\x02\\xce\\xcc\\xef\\xdf\\x48\\x39\\x6b\\x47\\x64\\x6b\\xc0\\xc3\\xd2\\x23\\xfe\\x61\\x13\\x65\\x1c\\x24\\x07\\x4e\\x86\\x77\\xe6\\xc3\\x5b\\xc0\\x0b\\xff\\x2f\\xe1\\x53\\xcf\\xfc\\xd2\\xb9\\xab\\xfc\\x96\\x01\\x60\\xeb\\x2a\\x85\\xac\\xcf\\x28\\x81\\xec\\x8b\\xe6\\x5a\\x97\\x50\\xca\\xc6\\x6a\\x55\\xa6\\x6e\\xd6\\xaa\\x90\\xd5\\x36\\xad\\xe6\\xd5\\x56\\x7e\\x9b\\xe6\\xd9\\x5a\\x8a\\x15\\xef\\xb6\\x7a\\x6b\\x00\\xdb\\xbc\\xdc\\x39\\x38\\xf8\\xf9\\x90\\xc9\\xe6\\x27\\xee\\xde\\xba\\x2a\\x58\\xfd\\xf4\\xd2\\x21\\xde\\x0b\\x67\\x51\\xf2\\x01\\xc4\\x57\\x77\\x88\\xab\\x62\\xd5\\x21\\x56\\xbc\\x5b\\x05\\xb6\\xe6\\xd5\\x22\\xe8\\x3b\\xe0\\x9b\\xd5\\x0f\\xc6\\x17\\xeb\\x70\\x81\\x9f\\xc0\\x01\\xce\\x17\\x33\\x19\\xd6\\x45\\x15\\xac\\xc7\\x47\\xd4\\x0d\\x1a\\x6f\\x7b\\x8b\\xfc\\x89\\xfc\\x05\\xff\\xdb\\xde\\xda\\x82\\x69\\x6a\\x80\\x1a\\x07\\x05\\xfc\\xbd\\x0f\\xaf\\x41\\xdf\\x8c\\x33\\x3f\\x01\\x38\\x66\\x50\\x61\\x63\\x63\\x0c\\x51\\xfa\\xdb\\x36\\xe5\\x53\\x92\\x84\\x67\\xc6\\xd6\\x46\\x13\\x3b\\x44\\xb1\\x22\\x61\\x45\\x3a\\x99\\xc4\\xb4\\xee\\x5a\\x36\\x19\\x26\\xa5\\xe7\\x76\\x7b\\x02\\xdd\\xc2\\x01\\xf9\\xda\\x28\\x72\\x5b\\x28\\x9a\\xe7\\xc7\\x81\\xdb\\xdc\\x23\\x0e\\x3e\\x13\\x01\\x5b\\x19\\xe0\\x17\\x58\\x4a\\xc6\\xae\\xe4\\x87\\x36\\xac\\x31\\x9d\\x5a\\x97\\x92\\xb6\\x52\\xe3\\x3a\\x66\\x11\\x7e\\x76\\x59\\x91\\x4d\\xc6\\xf7\\xac\\x8c\\x66\\x5a\\x44\\x4b\\xdb\\x35\\xec\\x42\\xf4\\x32\\x54\\x31\\xd8\\x08\\xa3\\x2f\\xe0\\x8a\\xb2\\xfd\\xe5\\xe2\\x50\\xfc\\xd2\\xa7\\xbe\\x5c\\x91\\x5c\\x7d\\x46\\xfb\\x01\\xc5\\x7d\\x6b\\x75\\x9b\\x3e\\x4d\\x16\\x09\\x9a\\x02\\x9d\\xc4\\x78\\x1c\\xd3\\x20\\x2b\\x49\\xd5\\xba\\x61\\xa3\\x60\\x4d\\x06\\x64\\x77\\xdb\\xb1\\x71\\xc1\\x46\\x55\\xfc\\x94\\x16\\x23\\xaa\\xda\\xab\\x45\\x51\\xa4\\x89\\x1e\\x8e\\x96\\x4f\\x69\\x51\\xb6\\x4e\\xe1\\x0a\\x0b\\x9e\\x8e\\x3a\\x05\\x70\\x72\\x96\\x16\\xe0\\x66\\xf4\\x1e\\x69\\x01\\x5a\\x10\\x33\\x42\\x3a\\xe1\\x55\\xec\\x5c\\x66\\x10\\x20\\xff\\xc0\\x90\\x3c\\xb7\\xb6\\x04\\x50\\x3f\\x7e\\x8b\\x66\\x26\\xd7\\x91\\xfb\\x74\\x96\\xf6\\x1c\\x51\\x8e\\xba\\xb9\\xe2\\x9b\\xb6\\x14\\xe7\\x9b\\x90\\xff\\xf5\\xa2\\xe1\\xd6\\x31\\xfc\\x1f\\x25\\xf3\\x45\\x71\\x8e\\x73\\x64\\x97\\xb3\\xed\\x02\\xad\\x73\\xa7\\x5a\\x62\\x41\\xa5\\x91\\xc2\\x61\\x77\\x94\\x25\\x4d\\xc6\\x31\\xf8\\xf4\\xc2\\xc2\\x57\\x96\\x12\\xc7\\x06\\x53\\xdf\\x42\\xea\\x45\\xbb\\x68\\x5b\\x8d\\x73\\x98\\x61\\xf8\\x12\\xca\\x39\\x63\\xd8\\x0f\\xb4\\x03\\x95\\x9f\\x86\\xbd\\x29\\x57\\xb9\\xca\\x28\\xf2\\x2b\\x6b\\xb5\\x56\\xa8\\x58\\x9a\\xd5\\x3b\\x03\\xd4\\x6d\\x69\\xce\\xd2\\x24\\xc2\\xe5\\xf9\\x71\\xb6\\xe6\\xd2\\x96\\xdd\\x5b\\xde\\x6c\\x7d\\xab\\x83\\x97\\x3f\\xca\\xba\\x73\\x68\\xb0\\x27\\x52\\x46\\x0d\\xba\\x10\\x64\\x78\\xca\\xa6\\xa0\\xe8\\x05\\x79\\x17\\x07\\x63\\x3a\\x4d\\xe3\\x90\\x66\\xa6\\x71\\xb3\\xbc\\xf8\\x08\\xa4\\x95\\x00\\x69\\x05\\xa6\\xcb\\x22\\x28\\xd0\\x84\\x48\\x16\\x1a\\x62\\x54\\xc1\\xae\\x26\\x48\\xc2\\x43\\xc0\\x0d\\xc5\\x27\\x3c\\x8b\\xdc\\xf5\\x6c\\xb7\\x49\\x06\\x5a\\x96\\x97\\x7c\\x73\\x73\\x1d\\x0e\\x94\\xec\\xe5\\x6a\\xe4\\x76\\x3e\\x3c\\x7d\\x04\\x25\\xa7\\xac\\x13\\xb5\\x29\\x52\\xbd\\x32\\x67\\x09\\xbe\\xc9\\x3b\\x1e\\xd2\\x62\\xb0\\xee\\x73\\x03\\x97\\xe2\\x14\\xb0\\xd8\\x8d\\xff\\xcd\\x16\\x78\\xe6\\x1b\\x3e\\x34\\x1f\\x77\\x81\\xe3\\x23\\xc2\\xc8\\x73\\xc1\\xea\\x53\\x82\\x11\\xa8\\x98\\x4d\\xf5\\xd3\\x32\\x2e\\x93\\xa0\\xd9\\xfb\\x52\\x4f\\x41\\x0b\\x39\\x61\\x32\\x93\\x0f\\x2d\\x6b\\x72\\xb7\\xa3\\xbb\\xaf\\x0f\\xdc\\x27\\x77\\x5d\\x5b\\x82\\xe6\\x89\\xdd\\x96\\x53\\xb9\\x72\\xc7\\x26\\xb4\\x9c\\xb1\\xcd\\x6b\\xc2\\x60\\xeb\\x33\\xf6\\xf1\\x10\\x8d\\x4e\\x31\\x37\\x70\\xe0\\x98\\x1b\\x76\\x19\\x85\\x5d\\xdc\\x20\\x26\\x11\\x5e\\xff\\x9c\\xe3\\xb9\\x20\\xbb\\xe2\\xb0\\x58\\x27\\xb7\\xa4\\x56\\xb9\\x71\\x27\\xcc\\xed\\x8a\\x88\\xf3\\x98\\x40\\xff\\x9b\\x28\\x2f\\xca\\x1d\\x2e\\x03\\x7d\\x73\\x77\\xbc\\x0a\\x81\\x38\\x34\\x8b\\x7d\\xd9\\xea\\x83\\xa6\\x6b\\xec\\x89\\x52\\xef\\xbc\\x8e\\x62\\x93\\x6c\\x5f\\xf8\\x8b\\x79\\x88\\x77\\xae\\x2e\\x83\\x82\\xfc\\x55\\xf2\\xb9\\x2a\\x6b\\xdd\\xc2\\xb3\\x76\\xc6\\x9f\\x2f\\xc0\\xf3\\x10\\x63\\xdc\\xbc\\xfb\\x73\\xa9\\xcd\\x34\\x8d\\xdd\\xb9\\xa2\\x4b\\x6c\\x8f\\x63\\x27\\xc5\\xd1\\xa0\\x20\\x74\\x8e\\x0a\\xee\\x38\\x0e\\x0f\\xf0\\x8a\\x0e\\x36\\xd8\\x08\\xcd\\x19\\xa1\\xdc\\x92\\x71\\x56\\x10\\xb3\\x4e\\xc8\\xbc\\xc5\\x52\\x6e\\x3e\\x0b\\x6b\\x6a\\x0e\\x4b\\xcb\\xdd\\x0e\\x4f\\xe1\\x14\\xb1\\xab\\xb4\\x6a\\x42\\xd5\\xdf\\xb1\\x83\\xda\\x62\\xb6\\x45\\x09\\x51\\xc7\\xb4\\xf1\\x74\\x15\\x6b\\x4d\\x1d\\x33\\x9b\\x34\\x9c\\x5b\\x45\\x44\\x95\\x41\\x44\\xd3\\x1a\\x5d\\x6e\\x61\\x98\\x31\\xb0\\x9d\\xb4\\xee\\x13\\xb2\\xa3\\x9a\\xe5\\x0e\\x2e\\xb8\\x37\\xb0\\xc4\\xa4\\x13\\x0c\\xf9\\x4e\\x74\\x8d\\x55\\x7f\\x83\\xb7\\xd1\\x9a\\xa6\\x60\\xd9\\xa4\\x40\\x92\\xa3\\xd3\\x40\\x0d\\x94\\x9b\\x2a\\xca\\x77\\xc8\\xa7\\xf0\\x34\\xfa\\x37\\x1d\\x10\\x13\\x6c\\xdb\\x15\\x20\\x79\\xe4\\xd8\\x04\\x37\\x60\\x4d\\x04\\x57\\x51\\x1c\\x15\\xfa\\x72\\xc8\\x79\\xd3\\x34\\x3c\\x92\\x9b\\x75\\x0d\\x61\\xf7\\x9d\\x59\\x90\\x2e\\x66\\xd7\\xd4\\x2e\\xb3\\x20\\x99\\xd0\\xcb\\x71\\xba\\x48\\x0a\\xa1\\x2e\\x1b\\xb7\\x3c\\x7a\\xdb\\x5b\\x5b\\x2f\\x96\\x71\\x72\\x79\\x63\\xa2\\x73\\x31\\xd5\\xda\\x1b\\x12\\x17\\x25\\x2c\\xf6\\xd8\\x07\\x8f\\xee\\x94\\x9d\\x5c\\x03\\xe1\\x7c\\x49\\x7a\\x66\\xbb\\x6d\\x1c\\xcd\\x28\\xbb\\xb2\\xc9\\x0f\\x51\\x7f\\x5e\\xfc\\xac\\xba\\xb6\\x76\\x86\\x5e\\xf2\\x2d\\xf2\\x7d\\xbe\\x11\\xa3\\xb0\\x11\\xcf\\x57\\xb9\\xb8\\x88\\x7a\\xb9\\x30\\xae\\x56\\x18\\x07\\xb2\\x5c\\x1d\\xac\\xa6\\x21\\xc3\\xc0\\xf7\\xeb\\xc1\\xd3\\x93\\x05\\xcb\\xad\\x11\\xfb\\xb4\\x00\\xc9\\xcb\\x9f\\x41\\x00\\xda\\x0c\\xa7\\xca\\x97\\x0c\\xa3\\x1b\\x74\\x26\\x8f\\x52\\x7e\\xed\\x0b\\x6f\\xea\\x52\\x18\\xa2\\x7b\\x5a\\x74\\xd8\\x40\\xb4\\xa1\\x72\\x06\\x8e\\x0a\\x9c\\x72\\x4e\\x00\\x09\\x94\\x21\\x04\\x7e\\x09\\x91\\xac\\x53\\x70\\x19\\x61\\x69\\xf0\\x7a\\x20\\x21\\x4c\\x9a\\x72\\x2c\\x00\\x63\\xb2\\xd4\\x81\\x20\\x39\\xfd\\x91\\x2b\\x06\\xa5\\x22\\x46\\x7c\\xe7\\x06\\x0e\\xfd\\x68\\x12\\x2b\\xb7\\x8f\\x45\\x17\\x1e\\xba\\xfb\\x65\\x21\\x27\\x38\\x9f\\x82\\xd3\\xb7\\x3b\\x64\\x6d\\x82\\x57\\x00\\xfd\\x10\\xcd\\x63\\x8f\\x2e\\xb4\\x1d\\x63\\x70\\x0c\\xd2\\x05\\x08\\xfc\\xc3\\x40\\xc2\\x2c\\x71\\xb0\\xa8\\x07\\xd8\\x5a\\x2c\\x3a\\x7c\\x1e\\xfa\\x17\\xee\\xb3\\x26\\x17\\x0d\\xed\\xd5\\xc7\\xec\\x88\\x16\\xb7\\x69\\xf6\\x0b\\x0e\\x4a\\xc9\\x78\\xc6\\x77\\xe6\\x0c\\x04\\x61\\x88\\x97\\xc1\\xfd\\x84\\x43\\xf5\\x97\\xc3\\xbd\\xc7\\x6b\\xb7\\xe0\\x16\\x9f\\x4b\\xe2\\x3e\\xc5\\x6b\\x52\\xa0\\x9e\\x83\\x42\\x43\\x5f\\x53\\x3c\\x9e\\x10\\x22\\x06\\xcd\\x2c\\xee\\xe5\\xda\\x79\\xcf\\x6d\\xf5\\x8e\\xed\\xa8\\x96\\xfd\\x72\\xed\\x9c\\xa0\\xc6\\xb5\\xb0\\x4a\\xd1\\xc4\\x4b\\x62\\x7c\\xc3\\x2f\\x93\\xbb\\x10\\xd7\\x35\\xfd\\xb2\\xa3\\x2b\\x17\\x66\\x67\\x13\\xd6\\xa5\\x7b\\xc5\\x56\\x98\\x71\\xa3\\x35\\x21\\x2e\\xc5\\x29\\xb6\\x8f\\x54\\xcf\\xcb\\x0e\\x31\\x1e\\xa5\\xda\\x3c\\xa9\\x96\\xfc\\xee\\x2c\\x03\\xa3\\xae\\x61\\x51\\x5d\\x92\\x8e\\x1f\\x60\\x09\\xb8\\x27\\x15\\x1d\\x96\\xde\\x56\\xed\\x28\\x7d\\xb5\\x36\\x61\\x29\\xae\\x85\\xab\\xad\\x6b\\x76\\x69\\x17\\xe3\\x8d\\x79\\xdc\\xd6\\xda\\x72\\x82\\x55\\xb6\\x2e\\xc0\\xfe\\x77\\x13\\xa8\\xb6\\x1e\\xf3\\xa3\\x4e\\xea\\x19\\xba\\xde\\x8b\\x9f\\x36\\x5f\\xcc\\x36\\x5f\\x84\\xe4\\xc5\\x8f\\xfc\\x30\\x9d\\xb9\\x9a\\xa9\\x2b\\xbc\\x16\\x09\\x55\\xe0\\xaa\\x28\\x98\\x2f\\xc3\\x5e\\x06\\xfc\\xa7\\x76\\x37\\xa2\\xa2\\xb8\\xba\\x1e\\xa1\\x94\\x29\\x37\\x24\\x34\\xc8\\xe5\\x2e\\x49\\xf0\\xa0\\x3e\\x8b\\x67\\xad\\xe9\\xf8\\x88\\x35\\xcc\\xba\\xda\\x26\\x80\\x32\\x60\\x46\\x7c\\x53\\x1b\\x1c\\x2e\\x59\\x49\\xc9\\x14\\x36\\xd8\\xca\\x0e\\xb2\\x29\\x0a\\x9e\\x91\\x60\\xa1\\xeb\\x49\\x8f\\xae\\xa7\\x3c\\xea\\xf4\\xf0\\xe0\\xa4\\x2d\\x9c\\xc1\\x67\\xf2\\x32\\x3b\\xcf\\x0d\\xd8\\xd1\\xcc\\x50\\xb6\\x94\\xf9\\xc5\\xaa\\x83\\x1b\\xdc\\x37\\x3f\\x6d\\x8c\\xa5\\x3e\\x6e\\x1f\\xda\\xb2\\x07\\x7d\\xe9\\xd8\\x84\\x36\\xb4\\x8c\\x8b\\x58\\xa9\\x6d\\xac\\xd3\\xde\\xb6\\x55\\x5d\\x9f\\xfb\\xb9\\xaf\\x0d\\xab\\xad\\x52\\x29\\x62\\xce\\xdd\\xa3\\xf2\\x6d\\xc7\\x2d\\x24\\x97\\x85\\xbd\\xcc\\x26\\x78\\xd9\\xe6\\xd3\\x6f\\x3e\\xb5\\x58\\xf9\\xd3\\x6f\\xb8\\x3b\\x81\\xda\\x12\\x43\\x97\\x2e\\xd3\\x1c\\x40\\x17\\x71\\xa3\\xd5\\x7c\\x7c\\xf5\\x33\\x1d\\x17\\x78\\xd4\\x2f\\xf7\\x2c\\xf2\\xca\\x23\\x59\\x7d\\x3f\\x4f\\xf1\\x9e\\x8e\\x61\\xca\\xbb\\xbd\\x2a\\xf5\\x61\\xce\\x21\\xdf\\x5a\\x70\\x36\\xd0\\x1e\\xee\\xd5\\xd9\\x13\\x47\\xcc\\x76\\xe7\\xd7\\x09\\x94\\xe8\\xb7\\x38\\x13\\xda\\xd5\\x55\\x98\\xf9\\x45\\xb6\\xc8\\x61\\x1d\\xfb\\x63\\x72\\x95\\xcf\\x77\\xfe\\x78\\x85\\xd7\\x8a\\xf9\\xf7\\x36\\x67\\x87\\x55\\xaf\\x3c\\x0c\\xb1\\xed\\x00\\x6e\\x85\\x46\\x4e\\x93\\x97\\xc1\\x86\\x6f\\x64\\x56\\xe9\\xd0\\x6c\\x8f\\x27\\xc9\\x2a\\xad\\x74\\x89\\xc1\\x30\\xfa\\xb1\\xf1\\xcd\\xda\\x4b\\xf1\\xd9\\xd8\\xc8\\x85\\xeb\\x5e\\x10\\x3e\\x66\\x86\\x94\\xaa\\xd2\\xb2\\x1b\\xed\\xd5\\xf4\\x71\\x6d\\x97\\x96\\x10\\xa5\\xec\\x54\\x25\\xb8\\x78\\x9a\\x65\\xb6\\x9c\\x3c\\xf8\\xb6\\x51\\x6b\\x7c\\x04\\xa5\\xf1\\x94\\x3a\\x43\\xdb\\x10\\x12\\xe2\\xe5\\xcf\\x83\\x2c\\x00\\xe9\\x14\\x32\\x65\\x0b\\x31\\xac\\xa0\\x6a\\x08\\x9f\\xb4\\x0d\\xba\\xa6\\x6d\\xde\\x95\\xbb\\xea\\x4c\\xf4\\x89\\x8c\\x37\\x34\\xba\\xda\\x16\\x9d\\x21\\x22\\x3c\\x52\\xff\\xac\\x6c\\x47\\xdb\\xc7\\xa5\\x49\\x18\\x6b\\xb2\\x68\\x11\\x45\\xdb\\x1e\\xbe\\xb4\\x6b\\x95\\xad\\x7a\\x5e\\x64\\xec\\xdf\\x4b\\xb8\\xc7\\x1c\\x03\\x81\\xe9\\x5d\\x5c\\xd2\\xbb\\x79\\x9c\\x66\\xf4\\xd9\\x0f\\x83\\x9c\\x40\\xe3\\x07\\xa2\\xed\\x9a\\x39\\xa8\\xbe\\x34\\x37\\xbc\\x99\\x01\\x68\\x9d\\xa3\\xec\\x8d\\x29\\xf9\\xac\\xd0\\xcf\\x81\\xfe\\x98\\xfe\\x93\\x1d\\x53\\x17\\x5b\\xd1\\x3d\\x53\\xd8\\x55\\xc8\\x0f\\x78\\xce\\xa8\\x23\\xec\\x2b\\xf4\\x04\\xd9\\xdc\\x14\\xd0\\xe6\\x39\\x41\\x0e\\xcc\\xdc\\x46\\x16\\xd4\\x68\\xc5\\xcb\\x40\\x0f\\x92\\xb0\\x1d\\x50\\x78\\x1f\\x6f\\xd2\\x49\\x05\\x7b\\x6e\\x8a\\x6f\\xc9\\xa1\\x38\\x9d\\x9c\\x88\\x1a\\x6e\\x97\\x48\\xf2\\x19\\xfd\\x3f\\x7b\\x44\\x53\\xf3\\x7b\\xc0\\xaa\\x24\\xbb\\xbb\\xbb\\xa4\\xf7\\x33\\xb8\\x5b\\x3d\\x67\\x82\\x29\\x7e\\xb2\\xa0\\xc1\\xa9\\x7a\\xec\\xb5\\x0b\\xd1\\x82\\xdb\\x27\\x73\\x63\\x15\\x55\\xf1\\xa3\\xda\\x44\\x42\\x1f\\x90\\xbd\\x00\\xed\\x03\\xfa\\x83\\x48\\xa4\\xe4\\x2a\\x0d\\xef\\xfb\\x96\\xa8\\xbc\\xc0\\x72\\xbe\\x71\\xbe\\xc1\\x19\\xeb\\xf3\\xb3\\x02\\x03\\xb2\\x71\\x41\\xa0\\xa8\\xf2\\x31\\xa1\\x84\\x48\\x18\\x76\\xa8\\x60\\x63\\x84\\xbf\\x11\\xc1\\x85\\xff\\x73\\x1a\\x25\\xde\\xc6\\x86\\x85\\x1d\\xb5\\x21\\x07\\x33\\x8b\\xed\\x13\\x63\\x45\\xb7\\xe2\\x36\\x78\\x6e\\x01\\x7e\\xb0\\x4b\\x4b\\x3e\\x0e\\x12\\x8f\\xf7\\xa1\\x21\\xa1\\x12\\xbb\\xd8\\xc9\\x0e\\x56\\xfc\\x72\\xc3\\x34\\xca\\x90\\x49\\xef\\xdf\\x58\\x40\\x6e\\x17\\x15\\x37\\xe8\\x12\\xa0\\xfc\\xfd\\xc9\\x61\\x79\\x76\\xd0\\x33\\x67\\x84\\xf5\\x7e\\x31\\xbb\\x05\\xfc\\xb5\\x3e\\x23\\xdc\\xfb\\x87\\x25\\x29\\x2f\\x77\\xc9\\xc6\\x1f\\xe1\\xd7\\xee\\x46\\x6b\\xdb\\x1c\\xe1\\x32\\x51\\xf5\\xea\\x4c\\x88\\x7d\\x65\\x13\\xa7\\x43\\xc4\\xc8\\x5b\\x61\\xd8\\x59\\x12\\x49\\xad\\x1d\\xa4\\x3c\\x55\\xa2\\x4c\\xd8\\x3a\\x64\\xf3\\x51\\x1a\\xa1\\xa1\\x60\\x0c\\xd1\\x01\\x85\\x0f\\x87\\x4e\\xc0\\xac\\x98\\xf7\\xab\\x0c\\x33\\xab\\xc8\\x0c\\x59\\x43\\xc5\\xba\\x72\\x6a\\x09\\xd6\\x39\\x93\\x88\\x3c\\x2b\\xf3\\xf0\\xc1\\xab\\x2d\\xec\\x7a\\xf9\\x48\\x71\\x86\\xd9\\xfc\\x50\\x6e\\xf9\\xa3\\x16\\x04\\x23\\xbc\\xce\\x7d\\xbb\\xc0\\x72\\xe2\\xb9\\x46\\x64\\xd9\\xfd\\xdc\\x5b\\x3e\\x8c\\x1b\\x3e\\xb7\\xf7\\x35\\x7f\\xbc\\x51\\x35\\xcb\\x87\\xa9\\x13\\x5a\\x9c\\x70\\x34\\x3f\\xb2\\xc0\\xa5\\xd7\\x43\\xdb\\x12\\x06\\x66\\x13\\xd5\\x32\\x9a\\x4f\\x78\\xd3\\x7e\\x38\\x8f\\x83\\x28\\xd9\\x21\\x78\\x0d\\x16\\x6a\\xec\\xbe\\x3f\\xfb\\x61\\xf3\\xbf\\x5c\\xf7\\x2e\\x38\\x69\\x32\\x28\\xe6\\xd8\\xcd\\xb6\\x17\\xcb\\x1e\\x09\\x45\\x58\\x5b\\x4e\\x6d\\x72\\xd1\\x61\\xa6\\x89\\xcf\\x0e\\xc2\\xce\\x24\\x12\\xef\\xa1\\xe2\\xa7\\x43\\xdc\\xc7\\x7c\\xb1\\x5e\\x45\\xe0\\x45\\xd5\\x2f\\x22\\xaf\\x3c\\x9f\\xa0\\xc8\\x8b\\x64\\xcc\\x88\\x77\\x78\\xb7\\x79\\x7b\\x7b\\xbb\\x89\\x31\\xe8\\x4d\\x60\\x23\\x5f\\x0c\\xc2\\x8f\\x3a\\x13\\x84\\xb1\\xb8\\xf6\\xb9\\x30\\x2e\\x8d\\x52\\xf1\\xcd\\x35\\x1f\\x30\\xce\\xc7\\x6c\\x09\\x0b\\xe3\\xeb\\x16\\x47\\xcd\\xb6\\xb4\\xb6\\x2d\\x70\\x62\\xe3\\xe2\\xab\\x5e\\x49\\xf3\\x96\\x58\\x9d\\x2a\\xc2\\x5d\\x73\\xcd\\x4b\\x52\\xf9\\xa1\\x7f\\x0f\\x55\\xda\\x40\\x9e\\xee\\x1f\\x60\\x9a\\x6c\\xdc\\x80\\xaa\\x4d\\xe5\\xca\\x6d\\xed\\x78\\xc5\\x40\\x5c\\x2d\\x28\\xac\\x97\\x0a\\x64\\x2b\\xa3\\xf2\\x9b\\x2d\\xab\\x55\\x79\\xe5\\x40\\x52\\xa7\\xb3\\xca\\x9a\\x6d\\xb4\\xec\\xde\\x75\\x44\\xe3\\x50\\xf4\\x8e\\xd1\\xb2\\x64\\xdf\\xb0\\xa6\\xbd\\x67\\xf3\\xea\\x44\\xfa\\xe3\\xfa\\x27\\x58\\x74\\xc3\\xb5\\xb9\\xb5\\xff\\x53\\xb4\\xab\\x30\\x7a\\x85\\x91\\xa7\\xbd\\xa2\\x80\\x09\\xca\\xc0\\x7b\\xa2\\x53\\x66\\xd6\\x5c\\x67\\x06\\x56\\x3c\\x86\\x76\\x5f\\x5a\\x6d\\x56\\x7f\\x4f\\x07\\xf9\\x44\\xef\\x7b\\xca\\xd9\\xf3\\x8e\\xca\\x14\\x6a\\xc2\\x4d\\x73\\x65\\x89\\x28\\x6b\\xf2\\x4b\\xd5\\xc6\\x4a\\xd3\\x00\\xcf\\xf7\\x1a\\x6a\\xcb\\x6e\\x43\\x0d\\x99\\xd9\\xd1\\xdc\\x0d\\xd0\\x2f\\xc4\\x19\\x3d\\x90\\x84\\x37\\xde\\xfa\\x9b\\xd0\\x5a\\xe6\\x41\\x13\\x29\\xd7\\x68\\xec\\x1c\\x75\\x0b\\xb2\\x79\\x9a\\x77\\xc5\\xc6\\xd7\\x9f\\x66\\x74\\x98\\x83\\xbd\\x23\\xba\\x1f\\x0f\\xf6\\xf6\\xdb\\xd0\\x01\\xbb\\x3b\\xb0\\x50\\x20\\xdc\\x3f\\x78\\x73\\x70\\x76\\xe0\\x40\\xd9\\xf1\\x2e\\x61\\x65\\x54\\x54\\x2d\\xba\\xcd\\x99\\x92\\x4e\\x73\\x18\\x59\\x1a\\x28\\x7b\\xbf\\x14\\x73\\x4a\\x62\\xe6\\x47\\xd7\\x35\\xa9\\x19\\xe8\\x42\\xf4\\xfb\\xbb\\x9a\\xa8\\xeb\\x8f\\xa7\\xbc\\xa4\\x58\\x29\\xe8\\x9c\\x32\\x70\\xe4\\x7e\\x19\\xd1\\x12\\xf4\\xe5\\x9b\\xa2\\x91\\xc6\\xa0\\x2a\\x8b\\x82\\xfe\\x73\\xf8\\x81\\xbc\\x0b\\xa2\\xac\\x21\\xa2\\x8a\\x46\\x4e\\x63\\x48\\x95\\xaf\\x2f\\x3d\\xd0\\x21\\x00\\xc6\\xee\\xc4\\x81\\x82\\x11\\xdf\\x0c\\xd9\\x68\\x3a\\xd4\\x50\\x6e\\x84\\x64\\x41\\x96\\x35\\x6e\\x7e\\x88\\x06\\x3f\\x08\\xf5\\xcf\\x1a\\x02\\x1d\\xb5\\x74\\x93\\x62\\xdd\\xef\\xbd\\xa6\\x85\\x44\\x03\\xea\\x65\\x65\\x34\\x68\\x37\\x4a\\x3c\\xa8\\x0a\\x56\\x46\\xf4\\x6e\\x51\\xd2\\x83\\x1a\\x6a\\x65\\x3c\\xfb\\x4c\\x81\\x48\\x54\\x5c\\x9d\\x2c\\x85\\x6c\\xe9\\x08\\xb6\\x21\\xf8\\xae\\x38\\xb6\\x0e\\xc6\\x4c\\x34\\xa3\\xc8\\xb6\\x8d\\xc2\\xce\\xd6\\x34\\x2f\\xdc\\x3a\\xc8\\x67\\xb7\\x70\\x6b\\x91\\x5e\\x33\\xd4\\xd5\\x56\\x8f\\x87\\x7d\\xf5\\x20\\xd5\\xef\\x7f\\x09\\xff\\x6c\\x17\\x49\\x35\\x48\\xfa\\x39\\xae\\x91\\xfa\\x54\\xfd\\x94\\xd7\\x48\\x46\\xe9\\x13\\x2c\\x90\\x6c\\x96\\x4a\\x6d\\x5c\\xcd\\xdb\\x67\\x58\\x29\\x61\\xa6\\x6b\\xed\\x1e\\x24\\xab\\x2f\\x4e\\x4f\\xb4\\x58\\x3e\\xff\\xda\\x64\\x08\\x9c\\x6b\\x6d\\xd2\\xc1\\xd8\\xda\\x64\\x14\\xd9\\xd6\\x26\\x11\\x7d\\x69\\x5e\\x9d\\x4c\\xa0\\xcf\\x6e\\x7d\\x7a\\xbc\\x63\\xf9\\xca\\x16\\x53\\xd2\\xea\\xfc\\x4e\\xd6\\xa5\\x2f\\xae\\xe5\\x47\\x59\\x35\\x8d\\x28\\xfc\\xe7\\xb8\\x70\\x9a\\x5a\\xe4\\x53\\x5e\\x3a\\x05\\xad\\x5f\\xbc\\xcb\\x2f\\xde\\x65\\xfd\\x59\\x7a\\x05\\xaf\\x49\\xbe\\x6b\\x0d\\x37\\x01\\x45\\xa6\\x44\\xa3\\xd0\\xb6\\x8e\\xbf\\x49\\x27\\xcd\\x6b\\xb8\\x0a\\xf0\\xc8\\x23\\x7b\\x76\\xbd\\x17\\xa7\\x93\\x51\\x7d\\x7f\\xc4\\xce\\x41\\xb6\\x09\\x32\\x32\\x36\\x47\\x5a\\xb7\\xd7\\x8c\\xbc\\x97\\x4a\\x87\\xd6\\xa3\\x4a\\x34\\x1d\\x02\\xcd\\x75\\x51\\x1b\\x49\\x9e\\xc6\\x4e\\x9b\\x5b\\x4a\\xe0\\x2b\\xec\\xb1\\x14\\x40\\xd6\\xfd\\x81\\x7d\\x41\\xe3\\x29\\x7e\\x9d\\xe7\\x46\\x59\\xfd\\x98\\x1d\\x7b\\x31\\x2f\\x0a\\x3a\\xff\\xe2\\x9c\\xde\\xc5\\x1e\\xde\\xd8\\xb3\\xfd\\xe1\\x0f\\xc6\\xef\\x65\\xe5\\x5c\\x1b\\x12\\x97\\x8c\\xab\\x40\\x4c\\xbe\\xb5\\x02\\x9b\\x6c\\xff\\x6e\\xd2\\x1e\\x69\\x02\\xd3\\x24\\x2d\\xd6\\xd5\\xa9\\x71\\x35\\xd1\\xc3\\x4c\\x6e\\x25\\xa7\\x9b\\xfc\\x6e\\x38\\x53\\xa9\\x74\\x3f\\x98\\x8c\\x8f\\x3a\\x64\\xeb\\xc8\\x11\\xa6\\x9e\\x76\\xac\\x32\\x3d\\xd5\\x4b\\x8d\\xa3\\xa2\\x2a\\x80\\x7e\\x62\\x54\\x7b\\x63\\x1c\\x1c\\x35\\x6a\\x3d\\x32\\xfb\\x13\\xde\\xdc\\x5d\\x5f\\xde\\xa5\\x25\\x13\\xd7\\x5a\\xae\\x27\\x7d\\xcc\\x74\\x4e\\xec\\xb2\\xb4\\x23\\x9f\\x93\\xf2\\xce\\x3c\\xdf\\x2a\\xee\\x58\\x77\\xbb\\xb5\\xc4\\x81\\x3f\\xe5\\x94\\x4e\\x9c\\xc2\\x67\\xca\\xe9\\x24\\xaf\\x6f\\x3b\\x5d\\x83\\xcf\\x21\\xa9\\x93\\xbc\\x98\\xae\\x67\\x75\\x92\\xb7\\xe8\\xed\\x8b\\x1b\\x3e\\xf5\\xb4\\x4e\\x02\\xd3\\x8a\\x79\\x9d\\xaa\\xda\\xeb\\x49\\xec\\x24\\xf1\\x37\\xf7\\xe8\\xf7\\x92\\xd9\\x49\\xf6\\xe6\\x31\\xa9\\x9d\\x14\\x8e\\xff\\x7f\\xca\\xed\\x54\\x53\\x21\\x5f\\x92\\x3b\\xb5\\x24\\x10\\xaa\\x73\\xec\\xf3\\xc9\\xee\\x24\\xfa\\xf6\\xa4\\xe9\\x9d\\x54\\x9c\\xcf\\x90\\xdf\\xa9\\x3e\\x3c\\xce\\x04\\x4f\\x0d\\x49\\x50\\xca\\xb5\\xc0\\x92\\x91\\xc6\\xad\\x3b\\x39\\x4b\\xe1\\xed\\xb3\\x25\\x25\\xe2\\xad\\xb9\\xb2\\x3c\\x39\\x69\\x59\\x25\\x2b\\x51\\x9d\\xb1\\x8e\\x3c\\x4f\\x9f\\x0d\\x5b\\x9d\\xc9\\x9e\\xd6\\xc1\\xd7\\xe7\\x4e\\xf7\\xa4\\x4c\\xcb\\x55\\xf2\\x3d\\xd5\\xa4\\xc1\\x96\\xf0\\x69\\x7d\\x92\\xf0\\xb9\\x24\\x7d\\x62\\x37\\x3a\\x0f\\xf5\\x64\\x25\\xd6\\x0b\\xcd\\x5c\\xe4\\xca\\x3b\\xca\\x9d\\xee\\x36\\x3b\\xea\\x2c\\x9b\\xe1\\x85\\xd1\\x68\\xcb\\x74\\x64\\xe2\\x7f\\x5c\\xbe\\x23\\xd6\\x8c\\x2d\\xe9\\x91\\xab\\x99\\x27\\x4d\\x7d\\x54\\x9f\\x85\\x42\\x09\\x3c\\x79\\xf2\\x23\\x67\\x4b\\x4f\\x9a\\xfe\\x48\\x68\\xb0\\x35\\xe4\\x3f\\x72\\x29\\xbf\\xa7\\x4c\\x80\\xd4\\xb0\\xac\\xad\\x33\\x03\\x92\\xd4\\x57\\x6b\\x48\\x81\\xe4\\x5c\\x32\\x36\\x49\\xd3\\x62\\xb3\\xd6\\x24\\x48\\x4a\\x77\\x57\\xde\\x9d\\xb0\\xaf\\x65\\x6d\\x69\\x90\\xec\\x36\\xa1\\x3d\\x0f\\x92\\x6b\\xa1\\x7a\\x44\\x22\\x24\\x8e\\x52\\x0b\\x17\\x2a\\x80\\x4a\\xfc\\xc8\\x2f\\x03\\x46\\x66\\x95\\x4f\\x2d\\x19\\x92\\x42\\x74\\x95\\x0d\\x49\\x2d\\x54\\xd2\\x21\\xe9\\xb0\\xab\\xe4\\x43\\xe2\\xb1\\xa0\\xf5\\x26\\x44\\x32\\x02\\xa0\\xab\\xdd\\x84\\x57\\x87\\xcd\\x0c\\x11\\x6a\\x63\\x24\\xa4\\x2c\\xaf\\x58\\x63\\x66\\x45\\xaa\\x8b\\xc5\\xba\\xf3\\x22\\xd9\\x68\\x7a\\xca\\xcc\\x48\\x8d\\xf8\\xbf\\xe4\\x46\\xd2\\x06\\xa1\\x53\\x72\\x24\\x0e\\xeb\\xdc\\x64\\xaa\\x5e\\x3f\\x63\\xa6\\x93\\xaa\\xd1\\x8f\\x94\\x1f\\x49\\xa8\\xd0\\xa7\\x4b\\x90\\x64\\x15\\xdb\\xc6\\x14\\x49\\x1d\\xb3\\x9d\\x2a\\x39\\x92\\x1a\\xda\\xe8\\x10\\x3b\\xd5\\xb9\\x54\\x4b\\x93\\x24\\xc3\\xc9\\x1f\\x2d\\x4f\\xd2\\x92\\x99\\x58\\xf9\\x10\\x8e\\x14\\xf0\\x4e\\xf9\\x91\\x80\\xf3\\xbd\\xc7\\xa6\\x6f\\x5a\\x35\\x87\\xd3\\x13\\x24\\x72\\xb2\\xb9\\x34\\x7a\\x36\\x27\\x9b\\x37\\xd2\\xd8\\xdc\\x33\\xa5\\x74\\x52\\xa6\\xbc\\x6b\\x77\\xb4\\x02\\xa9\\x84\\x5d\\x29\\x43\\x1b\\xa0\\x5e\\x6a\\xdb\\x51\\x67\\xaf\\x9b\\x35\\xde\\xc7\\x50\\x78\\x4f\\x9d\\xdb\\xa9\\xda\\x17\\x32\\x92\\x3b\\xc9\\xb9\\xfc\\x04\\xd9\\x9d\\x18\\xe1\\x4f\\x98\\xde\\x89\\xcf\\x5a\\xd2\\x6d\\xda\\x5a\\x15\\x9e\\x4c\\xf1\\x24\\xab\\xaf\\xec\\x25\\x38\\x06\\xa8\\x51\\x3a\\x2d\\xc2\\x69\\x95\\x4d\\xdb\\xf6\\x7d\\x69\\xb6\\x2b\\x9b\\xf3\\xa2\\xcc\\xd8\\xb2\\x2f\\x21\\x57\\xdb\\xac\\x0f\\xe6\\x73\\xa7\\x15\\xbc\\xaa\\x09\\xac\\xff\\xc5\\xda\\x36\\xb8\\xea\\xef\\x8d\\xb5\\x41\\xca\\x24\\xa6\\x6d\\x70\\x66\\xea\\xaa\\x36\\xf8\\xd2\\x19\\x60\\x80\\x72\\x7e\\xa0\\x15\\x8f\\xfb\\xc7\\xd3\\x20\\x9f\\xf6\\x76\\x64\\xb1\\x17\\xa6\\xe3\\x05\\xfe\\xa5\\x7c\\x3c\\x08\\x78\\xc0\\xff\\x68\\xfe\\xf7\\xf7\\x87\\xa1\\xd7\\xcb\\xd2\\x14\\xed\\x03\\xd2\\x63\\xed\\x6f\\xd2\\xea\\xec\\x0b\\x9f\\x91\\x3d\\xce\\x91\\xde\\xa8\\xf6\\x57\\xdc\\xd8\\x01\\x8e\\x81\\x00\\x12\\xec\\xd0\\xc1\\xd4\\x3f\\xec\\x25\\x01\\x91\\x1b\\x3a\\x94\\x91\\xc7\\x4e\\x05\\xcc\\x3b\\x43\\x0e\\x47\\x32\\xdd\\x9b\\xa3\\x46\\x0d\\xf5\\x52\\x35\\x74\\xde\\x8c\\x5c\\x07\\x53\\xb4\\x9e\\xb2\\xf1\\xd1\\x61\\xcd\\xf9\\xa3\\x81\\xe6\\x6e\\xd8\\xbc\\x06\\x3c\\x1c\\x95\\x1a\\x70\\x89\\x16\\xba\\xd6\\xfa\\x0a\\xb7\\x13\\xff\\x2f\\x00\\x00\\xff\\xff\\x1f\\x41\\x30\\x6b\\x7e\\x9d\\x00\\x00\")\n\nfunc uiJsAppJsBytes() ([]byte, error) {\n return bindataRead(\n _uiJsAppJs,\n \"ui/js/app.js\",\n )\n}\n\nfunc uiJsAppJs() (*asset, error) {\n bytes, err := uiJsAppJsBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/js/app.js\", size: 40318, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiJsLibsD3335D3MinJs = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\xbc\\xbd\\x69\\x77\\xdb\\x46\\xd2\\x28\\xfc\\xfd\\xfd\\x15\\x16\\x6f\\xa2\\x83\\xa5\\xc1\\x4d\\xde\\x02\\xaa\\xc9\\xe3\\x38\\xce\\x32\\xb1\\x1c\\xc7\\xca\\xce\\x61\\x74\\x20\\xb0\\x49\\x22\\x06\\x01\\x1a\\x8b\\x44\\xda\\xd2\\xf3\\xdb\\xdf\\xaa\\xea\\x6e\\xa0\\x01\\x52\\xb2\\x3d\\xf3\\xdc\\x3b\\x19\\x8b\\x00\\x7a\\xdf\\x6a\\xaf\\xea\\xa3\\x45\\x99\\x84\\x45\\x94\\x26\\x96\\xfd\\x41\\x3f\\x3e\\x48\\xac\\xc4\\xfe\\x90\\x89\\xa2\\xcc\\xe0\\xf9\\xf8\\xd8\\x4a\\xba\\xe9\\x75\\x22\\xb2\\x6f\\xd2\\xb0\\x5c\\x8b\\xa4\\xb8\\xb9\\x49\\xba\\xf3\\xfa\\xd9\\xae\\x5e\\x5e\\xc4\\x02\\x7f\\x6e\\xab\\x8a\\x8a\\xfb\\x2b\\x3a\\x3e\\x6e\\x7d\\xe8\\xce\\xc5\\x22\\x28\\xe3\\xe2\\xb7\\x48\\x5c\\x9b\\xad\\x40\\x46\\x7a\\xad\\x53\\xed\\xba\\x11\\x61\\x25\\xac\\xa8\\x9a\\x29\\xc6\\xc9\\xc4\\x1b\\xf8\\xc9\\xb8\\x98\\xe0\\x5f\\x5e\\x4c\\xfa\\x7e\\xbf\\xd7\\xaf\\xb3\\x67\\x66\\x9f\\xca\\x38\\xe6\\x9c\\x27\\x13\\xc8\\xe1\\xbb\\x49\\x9d\\xa9\\xac\\x33\\x1d\\x45\\xf9\\xab\\xe0\\x15\\xbc\\xd7\\xa9\\x51\\x9d\\xfa\\x21\\x16\\x8b\\xc2\\xaf\\x26\\xb1\\x60\\x82\\x65\\xac\\x84\\xb9\\x4c\\x33\\x2b\\xc8\\x96\\xd4\\xfb\\xbc\\x1b\\x8b\\x64\\x59\\xac\\x4e\\x4f\\x60\\x0a\\x32\\xde\\xb7\\xd9\\x5e\\xca\\x43\\x48\\x29\\x79\\xa1\\x5e\\xed\\x51\\x39\\xce\\x46\\xf6\\x87\\xab\\x20\\x7b\\x10\\xf1\\xcc\\x2d\\xc7\\xe3\\xf1\\x60\\x04\\xb5\\x4f\\xa3\\x19\\x13\\xf6\\x69\\x7f\\x92\\xf1\\xc8\\x1d\\xf8\\x25\\x8f\\x6e\\xd5\\x48\\xb2\\x5b\\x96\\x45\\xcb\\xd5\\xff\\xeb\\xae\\x8c\\xfb\\x13\\xe8\\x84\\x4f\\xdd\\xa9\\xbb\\x72\\x5b\\x4f\\x55\\x6a\\xce\\xb6\\xaa\\xb3\\x4e\\x0d\\x30\\x15\\xfb\\x87\\xd5\\x17\\x1c\\x2a\\x76\\x8a\\x2f\\x07\\x23\\xbb\\x70\\xf8\\xa0\\x3f\\xd2\\x2b\\x5a\\xe7\\x0f\\xe5\\x52\\xeb\\x12\\xe2\\x41\\x04\\xc9\\xf6\\x4f\\x97\\xff\\x88\\x90\\xf6\\x4e\\x94\\x88\\xd7\\x59\\xba\\x11\\x59\\xb1\\x83\\xbd\\xb6\\xc9\\xd2\\x22\\x2d\\x76\\x1b\\x01\\x33\\x01\\x03\\x88\\x4b\\xe1\\x17\\x53\\x01\\xdd\\x4e\\x60\\xc4\\x59\\x70\\x19\\x0b\\xff\\x68\\x70\\x6b\\xac\\x6b\\x0c\\x87\\xa0\\x58\\x45\\x79\\xf7\\x82\\xab\\x3a\\xc3\\x4c\\x04\\x05\\x6c\\x30\\xd8\\x27\\x46\\xbe\\xbc\\x1e\\x94\\x95\\xb8\\xbc\\xd3\\xb1\\x61\\x13\\x6d\\x02\\xd8\\xa2\\xd3\\xfe\\x0c\\x1e\\xaf\\x82\\xc9\\x55\\xe0\\x26\\xbe\\xb1\\xa1\\x16\\x7b\\x45\\xaa\\xac\\x49\\x37\\x8f\\xa3\\x50\\x58\\x03\\xdb\\x2c\\xb0\\x32\\x26\\x0e\\xdb\\xc3\\x91\\x52\\xd7\\xea\\x2c\\x4b\\xb3\\x4e\\x8e\\x99\\xea\\x5c\\xc7\\xc7\\x73\\x11\\x8b\\x42\\xa8\\xd7\\x69\\x32\\xab\\xcb\\x6d\\x2c\\xb9\\x9e\\x09\\x9f\\xce\\x46\\xd5\\xec\\x3f\\xa8\\xca\\xda\\x30\\x75\\x65\\xbe\\xb2\\x16\\x56\\x61\\xdb\\x7a\\x15\\x8c\\xae\\x5d\\x55\\xe5\\xfb\\x07\\x8b\\xbb\\x6e\\x72\\xa0\\xd4\\xdc\\xaa\\x17\\x2e\\x31\\x72\\xab\\x53\\x36\\x50\\x45\\x8e\\x8c\\xa3\\xba\\xfe\\xc4\\xf5\\xd8\\x99\\x9b\\xac\\xfe\\x7c\\x86\\xbb\\x05\\x36\\xa9\\x4e\\x32\\x40\\x1d\\x76\\x22\\xe3\\xa2\\x1b\\x6c\\x36\\xf1\\x0e\\x8e\\x4a\\x75\\x0a\\xaa\\xf1\\x66\\xb0\\x38\\xc5\\x24\\xf1\\x33\\x63\\x33\\x6f\\xe5\\xf6\\x8b\\x60\\x62\\x70\\x00\\x89\\xad\\x77\\xe8\\xa8\\x80\\x03\\x13\\xae\\x82\\xec\\x59\\x61\\xf5\\xed\\x6e\\x91\\xfe\\xba\\x81\\x4d\\xf8\\x3c\\xc8\\x85\\x65\\xbb\\x45\\xb5\\xbe\\xd5\\x6c\\x09\\xde\\x67\\x19\\x9f\\x07\\xea\\x40\\x8c\\xb2\\xb1\\x18\\xb9\\xae\\x90\\xfd\\x2a\\x21\\x01\\xb6\\xa9\\x5b\\x8c\\xa0\\xa1\\xb2\\xd1\\x50\\x69\\x74\\xe6\\x12\\x86\\x51\\xbf\\x5d\\x34\\xde\\xae\\xe9\\x5c\\xd5\\x50\\xd8\\x38\\x64\\xd0\\xae\\x60\\x25\\xf7\\x06\\x0c\\x8e\\xb3\\x6e\\xdf\\x75\\xcb\\xd3\\x68\\x64\\x5b\\x05\\xcf\\xa6\\xe5\\xac\\x9b\\x26\\xf6\\xf1\\x71\\xa1\\x27\\x07\\x16\\xe0\\xc0\\xfc\\x24\\xb7\\x72\\x20\\xd3\\x19\\xd4\\x98\\x88\\xeb\\x07\\x71\\x75\\x5e\\xa1\\x3c\\x37\\xc0\\x50\\xa9\\xa0\\x07\\x4b\\xa1\\xc1\\xa5\\x28\\x60\\x57\\xe9\\xac\\x7b\\xc0\\x67\\x38\\x49\\x8f\\x8f\\x53\\xa8\\xc0\\xb7\\xe0\\xc1\\xc2\\x27\\x8e\\x8b\\xcd\\x04\\x2c\\x96\\x9c\\xc6\\x3e\\x74\\x5c\\x74\\xa3\\x64\\x2e\\xb6\\x3f\\x2d\\xac\\xd4\\xb6\\xbb\\x61\\x9a\\x84\\x41\\x61\\xe9\\x0c\\x00\\x8a\\x6c\\x9b\\x65\\xdd\\x4c\\xac\\xd3\\x2b\\x81\\x7b\\x98\\x95\\xc7\\xc7\\x42\\xee\\xe9\\xac\\x9b\\x63\\x0f\\xd8\\x07\\x68\\xa2\\xbc\\x85\\x24\\x80\\xeb\\xcc\\x80\\x30\\xe7\\xb8\\xe5\\x82\\xae\\xb8\\x42\\x6c\\xb4\\xc9\\xe8\\xf7\\x1b\\x89\\x76\\x2c\\x63\\xc7\\xbd\\x35\\x37\\x33\\x83\\xd5\\x57\\x45\\x46\\x09\\x6c\\x84\\x3c\\x2d\\xb3\\x50\\xbc\\xa0\\x77\\xbb\\xe0\\xc9\\x01\\x40\\xf6\\xa2\\x09\\xf8\\x70\\xfe\\x2e\\x98\\xdc\\x15\\xed\\x39\\xc1\\x8d\\x71\\x0a\\x20\\xb8\\x98\\x56\\x29\\xb0\\x3b\\x66\\xfc\\xda\\x98\\x47\\x98\\xf2\\x45\\x3d\\xe5\\x00\\xf7\\xf7\\xf7\\x3c\\xac\\x42\\x91\\xed\\x14\\x1c\\x2f\\xcd\\x3e\\xd6\\x9d\\x2f\\xbb\\x05\\xb4\\x21\\xa0\\x3f\\x4c\\x7f\\xe3\\x25\\x2b\\xa6\\xf0\\x1d\\xa0\\xe8\\x4c\\x6d\\x08\\xac\\xfe\\x16\\x40\\x6d\\x10\\xc7\\xbb\\x6a\\xae\\x00\\x13\\xdd\\x36\\x26\\xf2\\x99\\x71\\x26\\x77\\x00\\xe7\\xd9\\x45\\x00\\x93\\x5d\\xa7\\xbf\\xaa\\xd3\\x3b\\xfa\\x63\\x07\\x8e\\x1c\\x34\\x94\\x2e\\x1e\\x24\\x70\\xf2\\x8c\\xe3\\xaa\\xea\\x39\\xc3\\x7a\\x70\\x3f\\xda\\xc6\\x39\\x78\\xfe\\x1f\\x54\\xb4\\x3d\\x54\\xd1\\x7b\\x85\\x5c\\x6a\\xba\\x42\\x41\\x1f\\xb9\\x91\\x9e\\x15\\x45\\x16\\x5d\\x96\\x08\\x7d\\x6c\\x93\\x9a\\x38\\x9c\\xe9\\xd5\\x39\\x20\\xa0\\x7c\\x13\\x84\\x82\\x01\\xda\\x4b\\xc3\\xc0\\x84\\x57\\xa5\\x2e\\x04\\x7b\\xd1\\xa8\\x16\\x5a\\x37\\x69\\x8c\\x03\\x79\\xf6\\x6b\\x6d\\x94\\x49\\x15\\x64\\x13\\xfc\\xae\\xc3\\x2b\\x09\\x1e\\x31\\xb9\\x63\\x5c\\xfe\\xa1\\x5e\\x09\\xdb\\x44\\xd8\\xff\\x4d\\x0b\\x07\\x26\\x65\\xbf\\xc5\\x03\\x63\\x84\\x1e\\x68\\xa8\\x83\\x9b\\x35\\xc9\\xbb\\xef\\xca\\x20\\x8e\\x16\\x08\\xf7\\x99\\x6c\\x10\\x40\\xb5\\xcc\\x3c\\xc9\\x7c\\xe1\\x1f\\xd8\\x08\\x75\\x86\\xc0\\x4f\\x7d\\xfd\\x1c\\x01\\x10\\xa8\\x06\\xf7\\xae\\x41\\xab\\x40\\x77\\x00\\xff\\xc0\\x10\\x36\\x31\\xf4\\xc5\\xea\\xfd\\x3b\\x77\\x7b\\x4b\\xd6\\x79\\xd0\\x31\\xa6\\xe3\\xa5\\x59\\x02\\xce\\xf0\\x1b\\xb1\\x7c\\xb1\\xdd\\x58\\x1d\\x6b\\xe2\\xff\\x7d\\xf3\\x6f\\x28\\x61\\x77\\x5c\\xe8\\x70\\x26\\xde\\x95\\x29\\x4d\\xb0\\x8b\\x49\\x98\\x70\\xf3\\x85\\xdd\\x61\\x9d\\xa5\\x59\\xd9\\x2f\\x0d\\x12\\x01\\x28\\x04\\xdd\\x85\\x7c\\x13\\x47\\x85\\xd5\\x83\\x1a\\xa1\\x0b\\x46\\x81\\x37\\x07\\x36\\x6c\\x8d\\x61\\xbc\\x01\\x41\\x8e\\x72\\x64\\x27\\x00\\x2f\\xe4\\x3a\\x15\\xad\\x9d\\x6b\\xe6\\x06\\xd0\\x73\\xd7\\x9a\\xee\\xd5\\x03\\x00\\x20\\xe1\\xd8\\xdf\\xee\\x3a\\xd8\\x58\\xdf\\xd8\\x23\\x89\\xb7\\x92\\x0a\\x9f\\xdd\\x75\\x1c\\x0b\\x5c\\x9e\\xba\\x0f\\xdf\\xe0\\x90\\x25\\x08\\xc4\\xa9\\x1c\\xb5\\x81\\x16\\x41\\x32\\xc4\\x82\\x00\\xf1\\xc3\\x38\\xc8\\xf3\\x97\\x51\\x5e\\x68\\x64\\x98\\x4d\\xca\\x6e\\x30\\x9f\\xe3\\xb6\\x2d\\x35\\xb0\\x4f\\x74\\x57\\x04\\x62\\x9a\\x7a\\x17\\x77\\xa8\\x74\\xc7\\xbe\\xb9\\xe9\\x74\\x46\\xd9\\xc4\\x02\\xf2\\x36\\xc8\\x8b\\x1f\\x10\\x89\\x00\\xd0\\x2d\\xba\\x85\\xc8\\x0b\\x00\\x91\\x37\\x37\\xa2\\xb9\\xfb\\x55\\x39\\xf6\\xce\\x2a\\x5d\\x58\\x7a\\x17\\x48\\x2c\\xdb\\xbf\\x3b\\x4f\\xb5\\x5b\\x0a\\xda\\x28\\xb6\\x09\\x5e\\x5e\\x6b\\x6a\\x64\\x1f\\x76\\xe4\\xc5\\x2e\\x16\\x6a\\x08\\x35\\xfd\\x7a\\x10\\x60\\x50\\x4e\\x68\\xbe\\xce\\x46\\x95\\x36\\xe1\\x86\\xa4\\x6e\\xee\\x3f\\xa1\\xd9\\xe4\\xbe\\xa6\\xfd\\x3b\\x5b\\xcb\\xcc\\xd3\\xa8\\x8e\\x5e\\x76\\xf8\\xc0\\x35\\x0e\\xd7\\xaf\\x07\\x36\\xab\\x41\\xa2\\x36\\x08\\x54\\x3d\\x31\\xf0\\x91\\x17\\xcd\\x59\\xf8\\x34\\xe0\\xd3\\xac\\xd8\\xd7\\x75\\x89\\x76\\xc7\\xef\\x80\\x14\\x25\\x50\\x7d\\x55\\xab\\xff\\xec\\xd1\\x52\\x72\\xc3\\xd2\\x0c\\x35\\xb8\\x57\\x40\\xe0\\xf4\\x31\\x09\\xd6\\x82\\x00\\xd8\\xaf\\x6f\\x7e\\xd0\\x5b\\x1a\\x00\\xa2\\x22\\x5e\\x15\\x93\\x0c\\x60\\x0e\\x00\\x1c\\x4c\\x74\\xf3\\x73\\x63\\xd9\\x45\\x8d\\xb1\\xf6\\x5b\\xdb\\xab\\x6e\\x0f\\xdf\\xdc\\x8b\\x14\\xad\\x7d\\x50\\x6a\\x2b\\xa0\\x08\\x6c\\x52\\xdd\\x87\\x6f\\x2b\\x62\\x9f\\xba\\xb0\\x09\\x32\\x6c\\x2d\\x9d\\x8b\\x51\\x82\\xec\\xbb\\xdc\\x39\\xcf\\x57\\x51\\x3c\\xb7\\x24\\x42\\xad\\x4a\\x7e\\x6f\\x70\\xc9\\x17\\x17\\xf3\\xa0\\x08\\x2e\\x2e\\x80\\xc3\\xa9\\x33\\xfc\\x64\\x40\\xcf\\x7d\\x1c\\x7d\\x19\\xc8\\xe5\\x4d\\xcc\\x43\\xf4\\x83\\x51\\xa4\\x4d\\x28\\xdd\\xdc\\xc0\\x98\\x84\\xcd\\x4c\\x0e\\xb8\\x9e\\x3f\\xa0\\x00\\x27\\xf0\\xa9\\xab\\x7b\\xc2\\x44\\xf5\\x68\\xfb\\x47\\x85\\x77\\x24\\x8c\\x66\\xfe\\x6c\\xf1\\x99\\x44\\x98\\x25\\x26\\xb5\\x2e\\x5c\\xd7\\xd6\\xc9\\x25\\x50\\xa4\\x08\\x1b\\x81\\xc0\\xed\\xb3\\x80\\x47\\x3a\\x5f\\x30\\x4e\\x47\\x29\\xe4\\x03\\xf0\\x15\\x4d\\xd3\\x19\\xd2\\xd4\\x56\\xc9\\x52\\xe8\\xd5\\x01\\xf6\\xe8\\xaf\\x36\\xbd\\x74\\xde\\xa4\\x97\\x7e\\xab\\x40\\x25\\x13\\x7b\\x70\\x12\\xf8\\x7c\\x16\\xc9\\xe4\\x14\\x7a\\x90\\x00\\x73\\xde\\x2d\\x37\\x30\\x3a\\xc1\\x42\\x5e\\x71\\x19\\xd8\\xdf\\xe8\\x88\\x0b\\x20\\xac\\x05\\x8f\\x80\\x6a\\x05\\xf6\\xbf\\x1c\\x73\\x98\\x1a\\x20\\xfc\\x4b\\xa0\\x9a\\x47\\x47\\x56\\xca\\x83\\x69\\x81\\x5d\\x75\\xdd\\xe2\\x34\\x1c\\x55\\x3d\\x4d\\x8d\\xd9\\xf9\\xe3\\x20\\x24\\xab\\x4f\\x05\\x8c\\x75\\x44\\x95\\xd6\\x24\\x00\\x11\\x9a\\x08\\xbc\\x05\\xec\\x60\\x2a\\x5e\\x74\\xbf\\xb0\\x99\\x79\\x4e\\x61\\x82\\xf6\\x8f\\x7a\\xc9\\x43\\x58\\xc6\\x2c\\xa8\\x05\\x18\\xc8\\x91\\x76\\x61\\x97\\xc6\\x72\\xbb\\x11\\x15\\x87\\x68\\x60\\xaf\\x05\\x59\\x27\\xd0\\xaf\\x65\\xf7\\x0b\\xdc\\x16\\x25\\x70\\x91\\xc5\\x3e\\x9c\\xc4\\x53\\x6b\\xa2\\xee\\xbf\\x2f\\x2e\\x60\\x42\\xa7\\x7f\\x77\\x67\\x07\\x90\\xf7\\x17\\x9d\\x9a\\x87\\xcb\\x34\\x0f\\x6b\\x23\\x3f\\x08\\xac\\xcd\\x3a\\x28\\xc2\\x95\\x25\\x6c\\xdd\\x73\\xea\\x41\\x06\\x53\\x71\\xd7\\x34\\x14\\xd3\\xc1\\x8c\\x51\\xff\\x9a\\x33\\x91\\xcd\\x6e\\x89\\xb9\\x4a\\x79\\x07\\x3b\\x03\\x58\\x07\\xd7\\xb4\\x62\\x79\\x3a\\xdd\\x8e\\x0d\\xcb\\xfa\\x05\\xec\\xaf\\x3e\\xca\\xd4\\x78\\x52\\x71\\x46\\x81\\x2d\\xf1\\x5f\\xcc\\xdf\\x06\\xc4\\x6a\\xd5\\x38\\x35\\xa6\\xac\\x31\\x14\\xfc\\xda\\x66\\xc1\\x84\\x80\\x9c\\x5f\\x4c\\x2e\\xfd\\xa8\\x9e\\x93\\x2f\\x1a\\x92\\xb4\\x1a\\x0b\\x57\\x18\\x45\\x33\\x0a\\x15\\xd5\\x2f\\x80\\x3b\\xe8\\xcf\\x24\\x68\\xd0\\xc7\\x69\\x84\\x7c\\x46\\x62\\x42\\xe8\\xe2\\x00\\xbf\\xd0\\x90\\x12\\x7d\\x2d\\x1b\\x96\\x67\\x4d\\xf6\\x62\\x6f\\x8f\\x27\\xe6\\x16\\xa3\\xe3\\x98\\x89\\x18\\x76\\xf8\\xfc\\x17\\xe2\\x59\\x46\\x19\\x49\\xb4\\x00\\xc6\\xdd\\xdc\\x3c\\x3d\\x86\\x2d\\x92\\xae\\x11\\x56\\x69\\x68\\xf9\\x3a\\xcd\\x23\\x09\\x14\\x6c\\xc2\\xf2\\x72\\x07\\x35\\x81\\xcb\\xef\\xf5\\x48\\x3b\\xdd\\x79\\x16\\x2c\\xf3\\x72\\x03\\x2c\\x60\\x9e\\x7b\\x1d\\xf7\\x81\\xeb\\x3e\\x0b\\x80\\x6f\\x06\\x64\\x1f\\x85\\x6f\\x3b\\x6e\\x06\\x67\\x1e\\xc6\\x92\\xc3\\xb2\\x85\\xc0\\x4f\\xe2\\xb2\\x03\\xaf\\x6a\\x75\\x8a\\xb4\\x0c\\x57\\xb8\\xd4\\x98\\xe5\\x5c\\x7e\\xa3\\xaa\\x80\\xb3\\x2a\\x8c\\x6f\\xb2\\xa0\\xf1\\x15\\x99\\x7d\\x89\\x96\\x5e\\x04\\x30\\x92\\x17\\x01\\xef\\xa4\\x89\\x99\\x2b\\x42\\x24\\x72\\x34\\xf0\\xb7\\xc8\\xe8\\x22\\x62\\x66\\x9d\\x32\\x17\\xd9\\x39\\x65\\x01\\x5a\\x83\\xbd\\x08\\x14\\x04\\xe0\\xb8\\x64\\x2a\\x4f\\xc0\\xd3\\xe9\\x8b\\x60\\x36\\xa2\\xbf\\xbc\\x93\\xa4\\x89\\xe8\\xdc\\x1e\\x98\\x5a\\x68\\x3d\\xea\\x12\\x24\\x21\\xd9\\x0a\\xa3\\x4e\\xc8\\x42\\x08\\x87\\xf4\\xdc\\x1b\\x60\\x9a\\xb2\\x97\\x32\\xfb\\xed\\x48\\xbd\\x19\\xe9\\xc0\\x49\\x33\\xe4\\x99\\xd9\\x11\\x80\\x19\\xa0\\x21\\x7e\\x89\\xd6\\x22\\x2d\\x91\\xf7\\xee\\xdb\\xe6\\xda\\xff\\x8b\\x58\\x8c\\x0f\\x02\\xe5\\x27\\xc9\\x12\\x96\\x13\\x67\\x50\\xe4\\x04\\xa4\\xda\\x1f\\x61\\xaf\\xc9\\x0d\\x8e\\xcb\\x4f\\xd8\\xf0\\xfc\\xb7\\xef\\x14\\x06\\xbc\\xb9\\x49\\x70\\x0e\\x33\\x85\\x17\\x21\\xe1\\x75\\x1a\\x25\\x85\\x3e\\x8d\\xed\\xef\\x16\\xcd\\x78\\x7f\\xfc\\x2a\\xd0\\xc2\\x4d\\x3a\\x2d\\x34\\x0f\\x79\\x98\\xa5\\x71\\xfc\\xc7\\xcd\\x8d\\x7e\\xfc\\x13\\x0e\\x85\\xb1\\xdc\\x9d\\xcb\\x74\\xbe\\x03\\xfa\\x1c\\xb6\\xb8\\x48\\xe6\\xb0\\x98\\x57\\x40\\xc8\\xcb\\x09\\xb7\\x3e\\x6c\\xd4\\x4e\\xf3\\x3b\\xc1\\x65\\x9e\\xc6\\x40\\x21\\x76\\x58\\x91\\x6e\\xfc\\x3e\\x23\\x51\\x71\\x9f\\xad\\x61\\xbf\\x46\\x09\\x3c\\x6c\\x00\\x6c\\x45\\xc9\\x12\\x9e\\x2e\\xd3\\x6c\\x2e\\x80\\x8a\\x92\\xcb\\xc3\\x3a\\xd1\\x7a\\x93\\x66\\x45\\x90\\xc0\\xba\\x8e\\xe4\\x92\\x66\\x30\\x74\\xf8\\x3f\\x1e\\xea\\x73\\x18\\x88\\x48\\x9e\\xff\\x72\\x06\\x43\\x78\\x15\\x70\\x80\\xd9\\xdd\\xc5\\xcd\\x4d\\xda\\x15\\x86\\xd0\\x03\\x66\\x58\\x2d\\xf2\\xab\\x60\\x02\\x74\\xe9\\x16\\xa6\\x72\\x13\\x2c\\xc5\\x1f\\x00\\x6d\\x76\\xea\\xf9\\x4f\\xdb\\x57\\x29\\xb0\\xa7\\x61\\x02\\x75\\x9a\\x7c\\xfb\\x13\\x20\\x26\\x2f\\x11\\xa8\\x65\\xd1\\xf6\\x97\\x2c\\x48\\x72\\x00\\x7c\\x6b\\x20\\x32\\x9a\\x3d\\x00\\xa8\\x74\\x25\\x32\\x94\\x73\\xd9\\x6c\\x0a\\xb5\\x61\\x1d\\x33\\x82\\x5e\\x08\\xb2\\x20\\xef\\xd7\\x69\\x99\\xe0\\x28\\x9f\\x53\\xad\\x6f\\x70\\xfa\\xf4\\xd9\\x9e\\x56\\x2d\\x7b\\x88\\xa3\\x16\\x85\\x97\\xa8\\x0f\\x2f\\xe1\\x85\\x55\\x3d\\x81\\x54\\x98\\xc0\\x2a\\xf1\\x97\\x74\\x63\\xd0\\x8a\\xdf\\x19\\x34\\x92\\x96\\xdb\\xec\\x6d\\x9a\\x6e\\x34\\x87\\xef\\xd1\\x22\\x12\\x06\\x61\\xf7\\xa3\\xc9\\xbc\\x8d\\xfb\\x93\\x81\\xdf\\x97\\xba\\x03\\x43\\x02\\xf9\\x73\\x53\\x84\\x68\\x21\\xb4\\xf3\\x50\\xca\\x6b\\x3b\\x96\\x00\\xf0\\x0d\\xcf\\x83\\x99\\xed\\x11\\x28\\x97\\xcf\\xf8\\x5d\\xe7\\xa9\\xeb\\x49\\x1a\\x9a\\x90\\xf1\\x60\\xd2\\xf7\\xbd\\x01\\xb4\\xf6\\x2e\\xf0\\xcf\\x82\\x62\\xd5\\x0d\\xc2\\x34\\x6f\\x90\\x7e\\x45\\xbb\\xc0\\x9b\\x40\\x96\\xf0\\xde\\xe8\\x22\\x79\\x94\\x34\\xa9\\x45\\xa3\\x88\\x05\\xb0\\x9e\\x72\\x09\\xc0\\x69\\x40\\xd9\\x79\\x83\\x5e\\x62\\xf7\\x86\\x06\\x89\\x7d\\x4f\\x66\\xb7\\x9d\\xb9\\xbc\\x2b\\xf3\\xd0\\xa1\\xba\\xed\\x1e\\x30\\xac\\x03\\x93\\x09\\x29\\x1a\\xa2\\x69\\xca\\x4f\\xdd\\xed\\x0d\\x6d\\xdb\\x31\\xa8\\x9a\\xb4\\x68\\xc8\\x2d\\x83\\xa2\\x25\\xb2\\x45\\x58\\x0f\\x78\\x16\\x20\\x60\\x12\\x22\\xe5\\x1a\\x14\\x13\\x49\\x56\\xac\\xb8\\x2b\\x71\\x7c\\x37\\xe7\\x6e\\xc1\\xae\\xd2\\x48\\xd2\\x9f\\xdd\\x98\\xbb\\x00\\x8b\\xfd\\x03\\x92\\xc5\\xa4\\x55\\x11\\x62\\x7d\\x6c\\xb0\\xbb\\x02\\x92\\x39\\x47\\xb2\\xd9\\xf6\\x2f\\xe1\\x70\\x23\\xbe\\xbd\\x28\\x58\\x50\\xd8\\xbe\\xce\\xd2\\xe2\\xb1\\xc2\\xe2\\x00\\x05\\x64\\x2e\\xd7\\xc9\\xe3\\xfe\\x24\\xf1\\x38\\xfc\\xe0\\x9e\\x42\\xcc\\xeb\\xe2\\x8b\\xcd\\x1e\\xe3\\x16\\x8b\\x5c\\x2b\\xf5\\x22\\x98\\x87\\x1e\\xa4\\x0f\\x9e\\xe2\\xa7\\xd4\\x1f\\x3e\\x34\\x93\\x2c\\x78\\xf5\\x60\\x11\\x20\\x43\\x74\\x50\\x2b\\xf5\\x80\\xe6\\x34\\xc3\\xc3\\x65\\x0d\\x1f\\x3d\\x72\\xb0\\x7d\\xfb\\x56\\xc9\\x59\\x2b\\xf2\\x92\\x6b\\xdd\\x15\\xec\\x37\\x2b\\xf9\\x92\\xfa\\x70\\x0a\\x5d\\x73\\xb1\\x67\\x28\\xb7\\x94\\xe9\\x05\\xa6\\xf7\\xc7\\xa8\\x2a\\x2b\\x60\\xab\\x0d\\x7c\\x24\\x8a\\xfa\\x63\\x01\\xef\\x82\\xde\\x05\\x90\\xb6\\xdd\\x47\\x63\\xe0\\xac\\x84\\x63\\x0d\\x5c\\x98\\x19\\xe1\\x16\\x9e\\x70\\x0a\\xc0\\x82\\x43\\x47\\x78\\x29\\xc3\\x99\\x5a\\x03\\x79\\x8b\\x1b\\x61\\x88\\x74\\x25\\x8a\\x66\\xe0\\x8f\\x87\\x6f\\xa6\\x8a\\xe5\\x63\\x2b\\x1c\\xef\\xaf\\x70\\xf8\\x1f\\xad\\x70\\x2c\\x57\\x38\\xd6\\x2b\\x1c\\xca\\x15\\x6e\\xe4\\x59\\x14\\x93\\x25\\xa6\\xc7\\x90\\x16\\xc0\\xbf\\x4b\\xdb\\x87\\x77\\xd8\\xb1\\xd7\\xf4\\x17\\xa9\\xbf\\xe5\\x25\\x71\\x46\\x80\\x17\\xbb\\x4b\\xca\\x61\\x9b\\xb9\\x75\\x0b\\xad\\x0d\\x92\\xb7\\x47\\xa9\\xd7\\x81\\x88\\x30\\x98\\x1e\\x3d\\xef\\x44\\x7a\\xc3\\x3b\\xd6\\xb3\\x00\\x2a\\x82\\xd1\\xb2\\x12\\x30\\x70\\xf8\\x37\\x81\\x0d\\x33\\x5c\\x1f\\x1e\\x78\\x33\\xda\\x58\\x7c\\x6c\\x26\\x17\\x7a\\x26\\xe3\\x6a\\x26\\x83\\xe6\\x4c\\x5e\\x7e\\xda\\x4c\\x2e\\xe4\\x4c\\x2e\\x5a\\x33\\xd5\\x9e\\xed\\xbc\\x35\\xd3\\x72\\x0e\\xd7\\x45\\x6b\\xfe\\x7c\\x5d\\x57\\x6b\\xce\\x56\\xd5\\x78\\x24\\x82\\xc7\\x9d\\xf4\\xd8\\xee\\x0d\\x06\\x8f\\x01\\x11\\x65\\x6e\\xd1\\x7b\\xd4\\x47\\xd1\\x7f\\xe6\\x89\\xde\\xb0\\x5f\\x29\\x07\\x4b\\xbe\\x41\\xc1\\x8d\\xf3\\x47\\x00\\x24\\x21\\x3c\\x66\\xb6\\xf3\\x45\\x00\\xd9\\xe0\\x11\\x8e\\xd1\\xd7\\x81\\xde\\x98\\xf3\\xc2\\x3a\\xe9\\xc2\\xa1\\x7a\\xf8\\xe8\\xe1\\xd0\\x29\\xbd\\x41\\xf7\\xd1\\xc9\\x93\\xc1\\xc9\\x53\\x38\\x38\\x5e\\xf7\\xe1\\x57\\x4f\\x1f\\x9d\\x0c\\x1e\\x3a\\x11\\x90\\xe1\\x85\\xe5\\x75\\xbf\\x7a\\xfc\\xd5\\xf0\\xf1\\x63\\x07\\x38\\xa2\\xee\\xd3\\x27\\x8f\\xfb\\x83\\xfe\\x53\\x27\\x73\\xbb\\xfd\\x87\\x83\\x47\\x8f\\x1e\\xab\\x4c\\xdd\\x3e\\x3c\\x3f\\x3c\\x79\\x08\\x55\\x75\\x87\\xfd\\x87\\xfd\\xe1\\xa3\\xaf\\x20\\xcf\\x00\\x3e\\x3f\\x19\\x0e\\x1f\\x0d\\x21\\x97\\x31\\xb2\\x65\\x7b\\xa5\\x10\\xdb\\xa8\\x9d\\x23\\x41\\x39\\xcc\\xe2\\x10\\x16\\xbf\\xb0\\x9d\\xd7\\x81\\x5a\\xf0\\x77\\x00\\xa1\\x0b\\xa7\\x70\\x85\\x23\\x90\\xfe\\xd2\\x3b\\xad\\xdf\\xeb\\x33\\xfc\\x67\\x02\\xfe\\x4d\\x13\\x57\\x40\\x87\\x1e\\x3f\\xfd\\xea\\xa4\\x7f\\xf2\\x70\\x92\\x38\\xf0\\x1f\\x9c\\x7c\\xef\\x61\\x6f\\xf8\\x95\\xdd\\x7b\\xd2\\x7d\\xf2\\xf4\\x49\\xff\\xe4\\x89\\xa1\\xca\\x6b\\x15\\xed\\xf7\\x9f\\x3e\\x7d\\xf4\\x78\\x42\\x5d\\xd8\\xa4\\xd7\\xd0\\xef\\x41\\xef\\xc4\\xf6\\x75\\x41\\x27\\x71\\xb1\\x26\\x43\\xa9\\x57\\xdc\\x0d\\x92\\x60\\x92\\xfa\\x27\\xfd\\x87\\x63\\x9e\\x4c\\x06\\xc3\\xee\\x57\\x80\\x2b\\x7c\\x9c\\xa0\\x47\\x4e\\xa3\\xf6\\x61\\xf7\\xa1\\xed\\xe1\\x67\\x73\\xc6\\xd6\\x1f\\xdb\\xdb\\x6b\\xbd\\xb7\\x33\\xfe\\x3f\\xff\\xa3\\x36\\xf7\\x12\\x1e\\x9b\\xbb\\xfb\\x7f\\xfe\\xe7\\x53\\xb6\\xf7\\x5a\\x6e\\x6f\\x6c\\xd3\\xdc\\xa6\\x1a\\x15\\xac\\x0b\\x16\\x2a\\x54\\xb0\\xde\\xdf\\xb5\\xbb\\xa2\\x25\\x02\\xc6\\x3c\\xe3\\x31\\x6c\\x5a\\xf8\\xfb\\xf4\\x18\\xe6\\x81\\xc1\\xbf\\x63\\x73\\xb9\\xce\\xcc\\x22\\x54\\xde\\xed\\x74\\x0c\\x25\\xa3\\x99\\x3c\\x78\\x0c\\x48\\xa1\\xd3\\xef\\xb8\\x34\\x67\\xeb\\x60\\x6b\\xe1\\xd2\\x03\\x39\\x74\\x0e\\x64\\x59\\xb2\\xb4\\xe0\\x84\\x48\\x6a\\x60\\x0d\\x00\\x02\\x1b\\x6b\\x25\\x1a\\xea\\xc2\\xe6\\xf1\\x42\\x81\\x81\\x92\\x57\\xf4\\x81\\x27\\xec\\x13\\xe9\\xcc\\x7b\\xd6\\x34\\xf0\\xde\\x03\\xe7\\xfb\\x6f\\xcb\\xea\\x3a\\xf6\\xbf\\xed\\x5e\\x04\\x78\\x5e\\x84\\x78\\x84\\xf3\\xeb\\x08\\xf9\\x5b\\x38\\x8b\\xd3\\xe1\\x4c\\xc9\\xa4\\x3b\\x0c\\x58\\xd1\\x0c\\xc9\\x9e\\x0f\\x61\\x90\\x8b\\xce\\x2a\\x8f\\x3b\\xbe\\x96\\x78\\x59\\xc0\\x7f\\xe5\\xe2\\xdb\\x38\\x05\\x0c\\x5a\\x22\\x39\\xc4\\x1a\\x1f\\xa0\\x50\\x6f\\xd0\\xef\\x37\\x3f\\x0e\\xe5\\x47\\x7b\\x44\\xd5\\x01\\xf0\\xad\\xaa\\x2b\\xac\\xb7\\xba\\x9a\\xb7\\xaa\\xb8\\x7c\\x80\\x22\\x5a\\xd4\\x65\\x45\\xfc\\x3b\\xc5\\xf7\\xc2\\x2c\\xbc\\x4c\\xaf\\xb5\\x0e\\xd6\\xb6\\x27\\x00\\x0f\\x60\\x75\\x23\\x58\\xdd\\x08\\x57\\x57\\xf1\\x5a\\xc9\\xcd\\x4d\\xe7\\xff\\x74\\x8e\\xe0\\xa1\\x56\\xdf\\x02\\xd9\\x4f\\xd0\\x19\\x80\\x08\\x76\\xed\\x07\\xa4\\xdd\\x2a\\x15\\x2e\\x83\\x49\\x85\\x1c\\xd6\\x43\\x34\\x1b\\x51\\x1b\\x6a\\x62\\xa5\\xdc\\x3a\\x79\\xfa\\xb0\\x7f\\x1c\\xd9\\xe3\\xf1\\x43\\x98\\xd6\\x14\\x7e\\x6e\\x50\\x12\\x33\\xc4\\x8f\\xf0\\x1b\\xe0\\x87\\x00\\x26\\x7a\\xf0\\x08\\xde\\x43\\x1e\\x9e\\x9e\\x3e\\xbc\\x09\\xe1\\x60\\x19\\xd5\\x20\\xc3\\xc5\\x61\\xd1\\x9e\\x00\\xc8\\x7b\\x2a\\xeb\\x82\\x6d\\x14\\x70\\xeb\\xf1\\xa3\\xa1\\x7a\\x7f\\x0a\\x45\\x71\\x3b\\x01\\x78\\x01\\xde\\x0a\\x1a\\x60\\xa1\\x79\\x6c\\x2e\\xf6\\xd7\\x98\\x57\\xbb\\x23\\xe9\\x61\\x51\\x56\\xc8\\x1f\\x41\\x3f\\x36\\xf4\\xb5\\xda\\x59\\xb2\\x28\\x72\\x8c\\x1e\\x76\\xd1\\x4a\\xdd\\x08\\xa8\\xc0\\x4a\\x55\\x0b\\x6c\\x04\\xd2\\x00\\xe1\\x24\\xe8\\x51\\x92\\x0f\\xbf\\x43\\x0f\\xa9\\x15\\x64\\xc6\\x39\\x4f\\xe1\\x44\\x7a\\xc2\\xee\\x05\\xae\\x25\\x80\\x94\\x78\\xec\\xf7\\x6d\\xbf\\xa0\\xcf\\x02\\x29\\x99\\xc0\\x1d\\x22\\x20\\x2a\\xf0\\xe9\\x21\\xcb\\x1c\\x0e\\xa4\\x88\\x8f\\x26\\x28\\x00\\xcc\\x4a\\x1e\\xa2\\x28\\x63\\x00\\x95\\xf7\\xfd\\x4c\\x62\\x43\\xd8\\x0e\\x38\\x80\\xd0\\x18\\xde\\x75\\x35\\xbc\\x84\\x9f\\xe3\\x29\\x01\\x02\\xe6\\x1c\\xd5\\xc9\\x40\\xad\\x9c\\x23\\x0b\\xae\\x58\\x43\\x00\\x6a\\x56\\xf7\\xe1\\x60\\xf8\\x10\\x40\\x34\\x40\\xac\\xee\\xc9\\xa3\\x27\\x8f\\x9e\\x3c\\x1e\\x00\\x30\\xed\\x02\\xb5\\xf5\\xf0\\xe4\\xc9\\x23\\x80\\xa9\\xbd\\x3f\\x02\\xe4\\x70\\x28\\xef\\x70\\x30\\x7c\\xfc\\x64\\xf8\\x15\\xe6\\x7d\\x32\\x78\\x34\\x78\\x34\\x1c\\x62\\xde\\xfe\\x93\\xe1\\x40\\x66\\xfd\\x02\\xb2\\x46\\x32\\x6b\\x7f\\xf0\\xd5\\xc9\\xc9\\x09\\x65\\x1d\\x0c\\xbe\\x1a\\x7c\\x45\\x39\\xbf\\x7a\\x84\\x80\\x6e\\x80\\x59\\xbf\\x0e\\x6a\\xc9\\x45\\x61\\xc1\\x4a\\x22\\xb2\\x79\\xcc\\x00\\x77\\x39\\x56\\xe6\\x95\\x36\\x1b\\xe2\\x53\\xe9\\x35\\x10\\xc4\\x79\\x83\\x5c\\x96\\x2b\\x73\\xca\\x01\\xe3\\x00\\xba\\x9a\\x24\\x3d\\x82\\x9e\\x7e\\x05\\x35\\x01\\x31\\x12\\xbc\\xec\\x11\\x34\\x65\\x08\\x40\\x0d\\xc5\\x74\\x51\\x0b\\x4a\\x8c\\x93\\x55\\xc9\\x81\\x3a\\x5f\\x76\\xb8\\xb1\\xdb\\xf5\\xde\\x03\\x1a\\x7e\\x62\\x82\\xef\\x2e\\x80\\x69\\x00\\x7a\\xa6\\xc6\\xba\\xf8\\x0f\\xf4\\xac\\xa6\\xb4\\xf7\\x59\\x71\\x48\\xdc\\x4b\\x56\\x4a\\xd5\\xe7\\x21\\xf4\\xad\\x0d\\xae\\x8f\\x8f\\x0f\\x34\\x27\\x48\\xd8\\x23\\x50\\x76\\x47\\xe2\\x8a\\x57\\x05\\xd5\\x94\\xa0\\x66\\xca\\xd0\\x31\\xab\\x0d\\x83\\x2d\\xec\\x89\\x16\\x91\\xfc\\x0d\\x81\\x69\\x0f\\x8a\\x32\\x47\\xe8\\x77\\x54\\x1c\\x1f\\xbf\\x2f\\xac\\x10\\x4e\\x77\\x31\\xe6\\xb0\\x4c\\xc7\\xc7\\x27\\x7d\\x20\\x8a\\x6f\\x6e\\x60\\x6d\\x51\\xae\\x24\\x15\\xe8\\x09\\x57\\xc2\\xa3\\x08\\xf7\\x66\\x48\\x32\\xbf\\x7a\\x00\\x88\\x7d\\x1e\\x00\\x2b\\x9e\\x65\\x69\\xa6\\xb3\\x41\\x97\\xd2\\x2e\\xac\\xc2\\x5c\\x7f\\x00\\x64\\x20\\xe2\\x5c\\xb4\\xf3\\x85\\x8a\\x7e\\xe7\\x1f\\x6e\\xe1\\x58\\x02\\xed\\x39\\x8f\\xf2\\x0d\\xd5\\xdf\\xb9\\x14\\xc0\\x7c\\x8b\\x5c\\x24\\x73\\x80\\xb8\\x9b\\x2c\\x5d\\xa2\\x54\\x0a\\x1e\\xb1\\x56\\xf8\\xa1\\x6a\\x3a\\x78\\x74\\xa1\\x68\\x48\\xe2\\xcc\\x3f\\xce\\x5e\\x7e\\x5f\\x14\\x9b\\x37\\xe2\\x5d\\x29\\xf2\\x82\\xc5\\x34\\x4f\\xda\\xc4\\x86\\xd0\\xe3\\x1f\\xdf\\xa4\\xeb\\x20\\x4a\\x54\\x0e\\x80\\x83\\x00\\xdf\\x57\\xcf\\x33\\x41\\x9c\\x72\\x10\\xe7\\x28\\x70\\x0a\\x6f\\x6e\\x8e\\x7a\\x7f\\x5b\\x2b\\xa8\\xc9\\xca\\xed\\x89\\x6f\\x4f\\xfe\\xdd\\xfb\\x77\\xaf\\x27\\xd5\\x65\\x09\\xc2\\x41\\xd5\\x5a\\xa3\\x2e\\x9b\\x75\\xd2\\x84\\xba\\x86\\x55\\x4c\\xc2\\xae\\x7c\\xe3\\xf8\\x40\\x5d\\xe5\\xa5\\x8f\\xcf\\x99\\x08\\xe6\\x3b\\x5c\\x00\\x21\\x19\\x76\\x53\\xba\\x14\\x76\\x29\\xf5\\x1c\\x53\\xc7\\x27\\xc7\\xc7\\x25\\x4a\\x92\\xb0\\x90\\x1e\\x3d\\x3f\\x20\\x18\\xdc\\x13\\x4f\\x26\\x24\\x8b\\x4c\\xbb\\xba\\x90\\x31\\xd5\\x7b\\x02\\xc9\\xe2\\xf6\\x16\\x50\\xc3\\x0a\\x5a\\x15\\x99\\x51\\xb9\\x21\\x10\\x4d\\xb8\\xd6\\xcb\\x9a\\xb8\\x65\\xdf\\x82\\x6e\\x38\\x09\\x50\\xeb\\x64\\x69\\x2d\\x93\\x92\\xed\\xd2\\xc7\\x80\\x74\\x5a\\x50\\x0b\\x8b\\x6c\\x6c\\x6f\\x1d\\xad\\xc5\\x2f\\xb0\\xa7\\x1b\\xc3\\xb9\\x43\\xc1\\x01\\x00\\x96\\x2b\\xb4\\x35\\xc1\\x5f\\x3f\\x91\\xf5\\xc0\\x31\\x85\\x9a\\x60\\x7c\\x1b\\x94\\x18\\x7e\\x7a\\x6d\\xb0\\x29\\xb0\\x74\\x6c\\x96\\x3e\\x54\\x52\\x60\\xbe\\x5b\\x36\\xed\\x00\\x66\\xc5\\xfd\\x97\\xe6\\x45\\x67\\xd6\\x85\\x1d\\xf9\\x22\\x80\\xcd\\xd9\\x90\\x22\\xe2\\xe8\\xf6\\xc1\\x40\\xd4\\xc5\\xad\\xab\\x24\\xc2\\x11\\x83\\x4c\\xda\\x66\\xa7\\x29\\xd9\\x87\\xb3\\x0b\\x80\\x96\\x32\\x37\\xac\\x59\\xd0\\x84\\x08\\x4e\\xe8\\x27\\x43\\x87\\x8c\\x4c\\x18\\x33\\xc4\\x4b\\x04\\x1d\\x60\\xdf\\x6c\\x04\\xd6\\x94\\x90\\x30\\x52\\xad\\x0b\\x6c\\xf9\\x20\\x0c\\xc5\\x86\\x44\\xab\\x01\\xec\\xe5\\xa0\\x2b\\xdf\\x71\\x7d\\x98\\xd3\\x73\\x50\\xcc\\x8e\\xda\\x4f\\xb5\\xad\\xbf\\xa7\\xad\\x51\\x69\\x7d\\x90\\x1e\\x7d\\x10\\xd8\\xfb\\x39\\xac\\x9c\\x05\\xd3\\x7c\\x56\\x2b\\x79\\xa0\\xb9\\x23\\xd4\\xb2\\x40\\x37\\xae\\x60\\xff\\x47\\x73\\x71\\xa6\\x56\\xfd\\xd0\\x37\\xc4\\x67\\xb2\\x08\\x8a\\xec\\xc3\\xe6\\xba\\xc6\\x3a\\xad\\x3c\\x3e\\x26\\x91\\xab\\x3a\\xfb\\x30\\x43\\xf4\\x26\\x01\\x82\\xb9\\x24\\x25\\x6d\\x43\\x84\\x39\\x80\\xec\\xbb\\x35\\x20\\xa9\\x8f\\x02\\x0d\\x12\\x80\\xbe\\xd6\\x0b\\xd3\\xd6\\x02\\x2c\\x1c\\xe1\\xbe\\x08\\x2e\\xd3\\xac\\x38\\xb0\\xa4\\xa1\\x4c\\xb1\\x28\\x1b\\x69\\x49\\x2e\\x23\\xa8\\x03\\x68\\x4a\\x3c\\xfc\\x1d\\x3d\\xc9\\xd9\\x24\\xf2\\x23\\xa2\\xc8\\x9e\\x23\\x6f\\x66\\x20\\xaa\\xe7\\x0d\\x32\\xd7\\xa4\\xa6\\x9a\\xfa\\xbb\\xc4\\xaa\\x95\\xb5\\x52\\xd6\\x6c\\x5a\\x49\\xbe\\x37\\xd0\\x5d\\xd2\\x98\\xaa\\x51\\xad\\xf8\\xeb\\x14\\x62\\x5b\\x20\\x91\\x87\\x36\\x20\\x3a\\x8f\\x6f\\x64\\x87\\x64\\xc3\\x0a\\xa4\\xa8\\x34\\x9e\\x2f\\x71\\x7c\\x05\\xff\\x05\\x7e\\x3c\\x00\\x25\\xe3\\xe1\\xc3\\x89\\x15\\xe5\\xdf\\x46\\x49\\x54\\x08\\xc9\\xbc\\x87\\xb1\\x08\\xb2\\x4a\\xb2\\x0d\\x73\\x59\\x84\\xdc\\x90\\x75\\xbf\\x2b\\x18\\x9a\\x9f\\x25\\x40\\x60\\x23\\xc9\\x09\\xe4\\x1f\\xcb\\x42\\xf8\\x6a\\x4e\\xc4\\xcb\\xba\\xbd\\x6f\\x00\\xd8\\x75\\x13\\x40\\xf1\\x52\\xcb\\x24\\x42\\xfe\\x63\\x30\\x12\\xe1\\xc8\\x4e\\xc6\\x5c\\x84\\x5d\\xd4\\xa9\\xc1\\xcf\\x02\\x9f\\x81\\x24\\xf7\\xf0\\x13\\xd4\\x0e\\xd9\\xe0\\xe9\\x90\\xc9\\xe5\\x2f\\x45\\xcb\\x4c\\xed\\xc7\\x00\\x30\\xe6\\xa0\\xd7\\x1f\\xa1\\x61\\x5a\\x77\\x31\\x29\\x10\\x92\\x74\\xd1\\x66\\x2d\\xf1\\x7f\\x0c\\xe8\\xc7\\x2a\\xba\\xc5\\xa9\\x54\\x11\\xc2\\x13\\x0e\\x1f\\x05\\x21\\x76\\xb7\\xd6\\x24\\xfd\\x1c\\x00\\x3c\\x30\\x8c\\x38\\xde\\x14\\x4d\\x03\\x6c\\xcf\\x4a\\x24\\x2d\\x11\\x8a\\x28\\x96\\x0c\\x6e\\x9c\\xa2\\xad\\x6a\\x8f\\x9e\\x5f\\xbe\\x1a\\xc0\\x64\\x98\\xd2\\xc2\\x6f\\x0a\\x53\\xfd\\x53\\xd1\\x39\\x83\\x3e\\x3b\\x71\\x96\\x81\\xf5\\xd4\\xab\\xcd\\x50\\x3f\\xe4\\xb0\\x6d\\x85\\x5f\\x8c\\x9f\\x4e\\x0e\\x00\\xaa\\xa4\\x27\\x6e\\xfd\\x43\\xdf\\x1d\\x71\\xcb\\xf2\\xdd\\xfa\\x32\\x8d\\x1b\\x0a\\xe8\\xd7\\x8d\\xdd\\x33\\x17\\x61\\xb4\\x46\\x6b\\x23\\x78\\x2e\\x56\\x69\\x99\\x07\\xc9\\x5c\\x2a\\x9a\\x96\\x40\\x15\\x6d\\x80\\xa3\\x62\\x68\\xe2\\x12\\x96\\x59\\x26\\x92\\x70\\x87\\xb2\\x08\\x54\\x2a\\x37\\x51\\x45\\xa5\\x13\\xae\\xf6\\x33\\xe4\\x9b\\x6a\\xd5\\x30\\x4a\\xf1\\x89\\xdb\\x2a\\x91\\xde\\x95\\xfa\\xbb\\xd0\\x0d\\xdc\\xc1\\x18\\xd7\\x36\\xa8\\x69\\xf1\\x01\\x2b\\x3c\\x20\\xed\\xe1\\x00\\x92\\xd5\\x22\\xf0\\x1f\\xe5\\x65\\x2e\\xb9\\xba\\xd2\\xe3\\x01\\x2b\\xdd\\x00\\x52\\x8f\\x2c\\x28\\xcd\\xa1\\xb8\\x3d\\xc6\\x29\\xb2\\xb1\\x81\\x14\\x09\\xf7\\x81\\xfd\\xa5\\xb6\\xed\\x9c\\x8d\\x2a\\x20\\x8c\\xd6\\x8c\\x24\\xaa\\xef\\xfe\\x93\\x46\\xa8\\x23\\xba\\xf5\\x77\\x77\\xa9\\xd9\\x04\\x8f\\x42\\xcd\\xfa\\xa1\\xc9\\x28\\xf0\\x5b\\x00\\x2f\\x1f\\x74\\x60\\x20\\x02\\x58\\x2e\\x78\\x1e\\x77\\x60\\x40\\x62\\x7a\\x82\\xcf\\x5e\\x07\\x46\\x25\\xa6\\x0f\\xf1\\xb9\\x03\\xc4\\x86\\x98\\x3e\\x9a\\xb1\\x9c\\xbb\\x62\\xfa\\x78\\xc6\\x60\\xbf\\x4e\\x9f\\xcc\\xd8\\x0a\\x7e\\x9e\\xce\\xd8\\x12\\x7e\\xbe\\x9a\\xb1\\x0d\\x1c\\x85\\x2b\\x0e\\x99\\xe7\\xf8\\x67\\xcd\\x8f\\x06\\x6c\\xc7\\x8f\\xfa\\x23\\xc5\\x65\\x22\\x33\\xb4\\xe2\\xee\\xca\\x18\\x37\\x1a\\x75\\x5a\\x31\\x34\\xd0\\x47\\x0a\\x16\\xa6\\xbe\\xc3\\xf1\\x21\\xc5\\x63\\x18\\xf3\\x8c\\xc3\\x77\\xe8\\x1c\\x7c\\xb4\\xd9\\x52\\xb1\\xa3\\x49\\xc7\\x5f\\x40\\xa5\\xd0\\x66\\x67\\xd9\\x19\\x5d\\x02\\x45\\xf1\\x56\\x32\\x96\\x5f\\x76\\x7c\\xe8\\x00\\x30\\x9f\\xd0\\xfa\\x97\\x1d\\x4c\\x5f\\x34\\xd2\\x37\\x7b\\xe9\\x59\\x23\\x1d\\xd8\\x52\\xfa\\x4d\\xd5\\xef\\x56\\xfd\\xfe\\xd1\\xf1\\x81\\x9d\\x84\\x5e\\x85\\xd0\\xa9\\x2b\\xec\\x92\\xbb\\x6c\\x71\\xa2\\xb2\\x82\\xb0\\xe3\\xc3\\x70\\x07\\xf2\\x65\\xde\\xf1\\xd7\\xd8\\xcd\\x15\\x6c\\x0c\\xa3\\x91\\x1c\\x3b\\xe1\\x0d\\x64\\xeb\\xb7\\x9d\\x2f\\xea\\x7a\\x91\\x0d\\x86\\xae\\x49\\x26\\x18\\x12\\x8f\\xf8\\xf2\\xe6\\x06\\xed\\x1f\\x68\\xa0\\x1a\\x45\\xe0\\x1c\\xc2\\x2b\\xe7\\xcb\\xc9\\xca\\xdc\\x59\\xb5\\xbc\\x60\\xc0\\x56\\x36\\xc0\\xa5\\x8e\\xc0\\x4c\\x30\\xb3\\x0b\\xfc\\xb5\\x69\\xea\\x0d\\x79\\x43\\x9d\\xbf\\x8f\\xf9\\x61\\x19\\x96\\x3c\\x0d\\x09\\xa8\\x2f\\x81\\x04\\xfc\\xb5\\x20\\xb6\\xeb\\x0c\\xd1\\xd5\\xe2\\xee\\xed\\x34\\x47\\x1a\\x7b\\x7d\\x7c\\x9c\\x7c\\x39\\x50\\x06\\x5c\\x9d\\x8e\\xb2\\xd5\\xea\\x8f\\x81\\x0d\\xef\\x23\\x0a\\x38\\x3e\\xee\\x8f\\x07\\xbd\\x64\\x02\\x20\\xc7\\x4b\\x18\\x6c\\x2b\\xdb\\x87\\x3f\\x88\\xf6\\x27\\x9d\\x8e\\x1f\\x48\\x8d\\xdd\\x46\\x56\\x19\\x22\\xbd\\x87\\x3a\\xa9\\xa0\\x78\\x9d\\x89\\x45\\x84\\x0c\\xec\\xca\\x1e\\x25\\x48\\xd4\\x23\\x90\\xc0\\x8d\\x2b\\xf0\\x85\\xce\\xbd\\x3b\\x97\\x34\\x77\\xe2\\xf0\\x0d\\xe4\\x59\\xca\\xcc\\x58\\xcf\\x96\\x5d\\xb2\\x0b\\x3c\\xad\\xda\\x20\\x4c\\xa9\\xd8\\x65\\x63\\x17\\xb2\\xb1\\x6b\\xbe\\x9b\\xb4\\xb2\\x08\\xe8\\x9c\\x37\\x18\\xf5\\xc7\\xd7\\x13\\x6b\\x0b\\x10\\xf1\\x12\\x8d\\xfa\\x7d\\x7c\\x34\\x36\\x6d\\x9f\\x5d\\xdb\\x90\\x62\\x7e\\xba\\xb6\\x15\\xf9\\xdf\\xce\\x79\\x81\\x39\\x0b\\xd7\\xfc\\x78\\x41\\x46\\x19\\x38\\xb1\\xb0\\x28\\x5b\\x1e\\x59\\x5b\\x06\\xd0\\x5b\\x29\\xf9\\xcf\\xf9\\x95\\x3a\\xe3\\xee\\x56\\x3f\\x5c\\xea\\x07\\xeb\\x0c\\x58\\xe9\\x52\\x3b\\x71\\xb0\\xb7\\x3c\\x1f\\x9f\\x93\\x98\\xeb\\x59\\x96\\x05\\x3b\\xeb\\x9c\\xe7\\xde\\x39\\x54\\x2e\\x21\\x41\\x06\\xd3\\xdc\\xd1\\x4b\\x77\\xa6\\x9a\\x7a\\xeb\\x6e\\xd9\\x5b\\x8d\\x93\\x73\\x4f\\xd7\\xec\\x53\\x07\\x00\\x00\\xf1\\x2b\\x96\\xf0\\xad\\x7b\\xc9\\xac\\xce\\x29\\x1d\\xc4\\x49\\xe9\\x26\\xee\\x5b\\x1f\\x00\\x03\\xbd\\xbd\\x75\\xe1\\xdd\\xef\\xfc\\xad\\xde\\x1a\\x43\\x3d\\x1f\\x8f\\xf9\\xc0\\x76\\xa9\\x80\\x91\\x70\\x6e\\xfb\\x25\\xf6\\x3c\\xf1\\xdf\\xa2\\xa5\\x9d\\x2b\\x4c\\x3d\\xf1\\xaf\\x0d\\x49\\x5b\\x43\\x64\\xf6\\x4f\\x51\\x3b\\x0a\\xe0\\x18\\x11\\x8f\\xee\\xb9\\xbc\\x8c\\x07\\x13\\xc2\\xaf\\xbf\\xfe\\xf2\\xfc\\xb0\\xf5\\x58\\x2d\\x28\\x6c\\xea\\xee\\xbe\\x3d\\xa4\\xed\\xa9\\xd0\\x15\\x5a\\x14\\x00\\x80\\x8c\\x80\\xba\\x1c\\xd4\\xce\\x03\\x5e\\x31\\x2e\\x3c\\x01\\x24\\x4b\\x66\\x6a\\x6f\\x0c\\x79\\xa6\\x85\\x25\\xb1\\xaf\\x61\\x68\\x09\\x0f\\x61\\xdb\\xc0\\x36\\x91\\x6a\\x24\\xb5\\xe2\\x55\\xf6\\x84\\xab\\xcc\\x2e\\x6e\\xeb\\x86\\x65\\x50\\x4a\\x56\\x79\\xda\\xfc\\x87\\x93\\xe6\\x25\\x40\\xd7\\x0e\\xd4\\x65\\x8f\\x07\\x44\\xb0\\x8e\\xb2\\x71\\x3a\\xb2\\x85\\x95\\xda\\x5f\\x46\\x37\\x37\\x81\\xc2\\x2a\\x7a\\xaa\\xdc\\x54\\xc9\\x93\\x60\\x04\\xb4\\x35\\xeb\\x22\\xf7\\x65\\xd5\\x8c\\x45\\xc3\\x9f\\x47\\xce\\x14\\xb2\\x5d\\x61\\xc8\\xff\\x29\\xb4\\xb6\\x1e\\xca\\xc3\\x8b\\x9e\\x1e\\x5c\\x27\\x96\\x5a\\x99\\x12\\xa6\\x2a\\x56\\x0c\\x0a\\x60\\x1b\\xb7\\xb7\\x49\\x77\\x11\\xa7\\xc0\\x26\\x26\\x2c\\x91\\x02\\x09\\x8e\\x72\\x59\\x24\\x27\\x78\\x09\\x0f\\xe9\\x62\\x01\\x34\\x16\\x8f\\x30\\x95\\xf8\\xc6\\x74\\x24\\x01\\x42\\xd2\\x2d\\x81\\xfe\\xfa\\xde\\x34\\x7b\\x09\\x55\\x55\\x21\\x50\\xb9\\xb2\\xaa\\xef\\x91\\x10\\x85\\x37\\xaa\\xee\\x7b\\x54\\x1e\\x20\\x7f\\x20\\xab\\xfc\\x1e\\xb5\\x06\\x98\\x93\\xaa\\x0d\\xcc\\x59\\xfe\\xfe\\x2e\\xf1\\xc5\\xa7\\x0c\\xb6\\x60\\x68\\x59\\x21\\x6c\\xf4\\xde\\x69\\x0f\\xd6\\xb0\\x87\\x2b\\x5a\\xa6\\x86\\xcd\\x37\\xd3\\x20\\x4d\\x89\\x6f\\x81\\xb0\\x08\\x10\\x45\\x20\\x49\\xe1\\xba\\x01\\xba\\x09\\x9c\\x3c\\xa9\\xe4\\x3b\\xcf\\xd3\\xb9\\x78\\x56\\x58\\x81\\x4d\\x9e\\x14\\x9a\\x90\\x20\\x41\\x66\\x88\\xa6\\x42\\x0a\\x4f\\x00\\xab\\x94\\x87\\x53\\x51\\x0b\\x85\\xa0\\x26\\x1b\\x4d\\xc0\\xac\\xd6\\x37\\xc0\\xbf\\x11\\x7f\\x35\\x15\\x2a\\x2d\\x42\\xfb\\x19\\xa2\\xcd\\xcb\\x09\\xa1\\x10\\x2e\\x26\\x40\\x21\\xf8\\x80\\xf5\\xfc\\xd2\\x46\\x6e\\x83\\x9a\\x14\\x68\\xac\\x84\\x34\\x4a\\x65\\x4a\\x76\\xa8\\x2b\\xa9\\x84\\x44\\x00\\x42\\x6f\\xb5\\x7d\\x47\\xc3\\x96\\xf8\\x41\\xd1\\x25\\x71\\x96\\xe1\\x58\\xa2\\x15\\x45\\x1f\\x76\\xfe\\xe0\\x2b\\xc0\\xd5\\x6b\\x1f\\xf0\\xb5\\x3f\\x60\\xdf\\xc3\\xef\\x19\\xfc\\x3b\\x87\\x7f\\x2f\\xe1\\xdf\\x5f\\xc4\\x37\\xdc\\x02\\xf1\\x26\\xd0\\xbc\\x85\\xa1\\x01\\x0a\\xb9\\xd6\\x1c\\xd5\\x5e\\x6e\\x06\\xab\\x36\\x02\\xec\\x0f\\x9c\\x1d\\x99\\x13\\x75\\xbf\\xe7\\xf0\\xef\\xcb\\xc1\\xd0\\x1d\\x0c\\x9d\\xac\\xbb\\x91\\x80\\x37\\xe2\\x72\\xe2\\xb2\\xee\\x5f\\xc0\\xc0\\x85\\xc0\\x58\\xfc\\x53\\xc0\\x62\\xc0\\xb2\\x5b\\xd1\\xe4\\x9f\\xc2\\x0f\\xc3\\x4a\\xda\\xf6\\x0f\\x55\\x35\\x49\\x91\\x49\\xfc\\x16\\x0a\\xfd\\x09\\xec\\x02\\x54\\xbb\\x63\\x7d\\x96\\x75\\xff\\x01\\xb0\\x7b\\xad\\xdb\\xea\\xfc\\x4e\\x4f\\x80\\x85\\x7f\\xa5\\x07\\x7b\\x62\\x1d\\x2a\\x35\\xc0\\xa9\\xda\\xff\\xac\\x4a\\x4f\\xe0\\xf5\\xda\\x7d\\x6c\\x7f\\xf9\\xc4\\x7d\\x02\\xfd\\xfd\\xdd\\x83\\x3a\\x00\\x4f\\x7f\\x03\\x10\\xdf\\x76\\x1f\\xc1\\x67\\x1f\\xd3\\x31\\xe9\\xd7\\x46\\x12\\x96\\x00\\x4a\\x60\\xbf\\xe6\\xac\\xbb\\x86\\x7f\\x73\\xd5\\xe8\\xf7\\x69\\x99\\xe5\\x38\\x2b\\x2e\\xfc\\xf9\\x0b\\x05\\xf5\\x37\\x7d\\x34\\x3a\\x39\\x73\\xe1\\xf5\\x4b\\xa4\\x97\\xb2\\xee\\x39\\xfc\\x7b\\x09\\x84\\x2b\\x8c\\xf9\\xc2\\x4f\\x6f\\xd1\\xb6\\x5a\\xe9\\x23\\x0e\\x70\\x91\\x49\\xc3\\x65\\x44\\x18\\xd2\\xba\\xda\\xb4\\x92\\xa5\\x4a\\x47\\xa1\\x17\\x0b\\xe9\\x4b\\xbd\\x39\\xc2\\x71\\x30\\x22\\xd9\\x40\\x36\\x06\\xde\\x58\\xd6\\x0a\\x48\\x99\\x4c\\xc6\\x8b\\xc6\\x21\\x70\\x5d\\x9b\\xd1\\xd9\\x90\\xb2\\x84\\xb4\\x76\\xd8\\xa2\\xa4\\x88\\x3f\\x9f\\xa6\\xc8\\xd1\\xe7\\xe1\\xa4\\x91\\xe2\\xa7\\x33\\x76\\x04\\x30\\xd3\\x42\\x18\\x9f\\x50\\xef\\xec\\xd3\\x7e\\xd5\\x94\\x44\\xe5\\x72\\x37\\x09\\xb3\\xc1\\x0c\\xca\\xd6\\xb9\\x34\\x2c\\x68\\xb8\\xa1\\x4a\\x50\\x79\\x61\\x9a\\xa2\\x2b\\x08\\x72\\x21\\x49\\x6f\\xed\\x39\\x26\\x6a\\x37\\x3c\\x58\\xe2\\xa4\\x7b\\xcd\\xaf\\x89\\xfc\\x42\\x76\\xa2\\x45\\x5e\\x32\\xe1\\xd2\\x57\\xb5\\xaf\\x81\\x42\\x69\\x98\\x0f\\xc8\\x26\\xb7\\x07\\x9a\\xdc\\x7e\\xac\\xc9\\xcb\\xff\\xa4\\xc9\\x48\\x37\\xf9\\xe2\\x40\\x93\\x2f\\xee\\x6f\\x72\\xcd\\x9f\\xfd\\x27\\x4d\\xa6\\xba\\xc9\\xf3\\x03\\x4d\\x9e\\x7f\\xac\\xc9\\xb7\\xff\\x49\\x93\\x12\\xed\\xd5\\x52\\x60\\xdc\\xc8\\xaf\\xba\\x61\\xad\\x89\\xb3\\x29\\xb9\\xe5\\xc7\\xba\\x57\\x60\\x7b\\x77\\x81\\xf8\\x60\\x81\\x3f\\xee\\x2e\\x90\\x37\\x95\\xe9\\x67\\xd2\\xf1\\x4e\\x0f\\x1b\\x06\\xc3\\x87\\x76\\x9b\\x33\\x69\\x18\\xc7\\x67\\x68\\x09\\x85\\x4e\\xb4\\x9c\\x2c\\xfe\\xb1\\x9a\\x05\\x32\\xc9\\x80\\xb3\\x50\\xba\\x01\\xcc\\x8a\\x7c\\x01\\x66\\x00\\xd8\\x65\\xfc\\xb2\\x81\\x87\\x8d\\xc8\\xa2\\x14\\xb8\\xe6\\x2b\\x4a\\xdd\\xe5\\xc0\\xa5\\x00\\x9c\\x5f\\xa5\\x19\\x02\\x9a\\x1c\\xf8\\x3c\\x98\\xe3\\x34\\x29\\x56\\x39\\x70\\x7b\\x2a\\xe1\\x8c\\xde\\x47\\x05\\xe1\\x6e\\x93\\x6f\\x30\\xe1\\x42\\x1b\\xc9\\x16\\x8a\\x1c\\xaa\\xb1\\x03\\x52\\x14\\x48\\x96\\xed\\x23\\x58\\x65\\xbb\\x6a\\x10\\x05\\xa2\\x8d\\x4b\\x0e\\xd4\\x9f\\xc9\\x3c\\x46\\xa9\\x02\\x7d\\x22\\x0f\\x20\\x70\\x26\\x6a\\x10\\x97\\x55\\x8f\\x40\\xcc\\x01\\xec\\x5b\\x97\\x71\\x11\\x71\\x1a\\x9b\\x7a\\x0e\\x84\\x62\\x97\\x80\\x7b\\x41\\xe7\\x19\\x9b\\x6d\\xf9\\x9f\\x85\\x75\\x85\\xc4\\xff\\x5f\\xf4\\x7b\\x81\\xef\\x00\\x72\\xaf\\xf1\\x1d\\x7e\\xcf\\xf1\\x7d\\x8d\\x34\\xfc\\x5f\\xf4\\xfb\\x02\\xdf\\x77\\x36\\x7b\\x86\\xef\\x3b\\x7b\\xb4\\x39\\x20\\x8a\\x45\\x51\\xc4\\x19\\xb9\\x3a\\xb6\\x34\\xa1\\x68\\x8b\\x2b\\xb1\\xd8\\x2b\\xfe\\x21\\x38\\x24\\x2c\\x99\\x4f\\x93\\x0a\\x31\\xcc\\x6e\\xd9\\xb3\\x43\\x79\\xae\\x9a\\x79\\x2e\\x0f\\xe5\\xd9\\xc9\\x3c\\xb4\\xbc\\x94\\xeb\\xeb\\x43\\xb9\\xd6\\xed\\x5c\\xa1\\x5f\\x58\\x0b\\x1b\\x10\\xf9\\x41\\x11\\xfc\\x0f\\x85\\xa5\\x5a\\x2e\\x68\\x30\\x6c\\x68\\xc3\\xfc\\x7f\\x46\\xde\\xef\\xef\\xcf\\x2b\\x31\\x9c\\xce\\xfc\\xc3\\x27\\x65\\x06\\xf2\\xe0\\xe6\\x66\\x30\\x54\\x65\\xfe\\xb9\\xb3\\xcc\\xc0\\x0d\\x42\\x3c\\x14\\x3f\\x2d\\x08\\xbd\\xa2\\xfa\\x92\\x9d\\x40\\x89\\x97\\xf7\\xb7\\x72\\x16\\xc5\\x71\\x94\\x8b\\x30\\x4d\\xe6\\xb2\\x67\\x58\\x66\\xfd\\x91\\x32\\x72\\x3a\\xdd\\x81\\xea\\xd4\\xd9\\xc7\\x9a\\x48\\xca\\x42\\xd4\\xe3\\xde\\x1c\\x5a\\xa9\\xcd\\xd4\\x6d\\x0c\\x1b\\x38\\xb8\\x21\\x2e\\xd8\\xf9\\xfd\\x75\\x9f\\x1b\\x3d\\xc7\\xba\\x7f\\xbd\\x33\\x3b\\xcc\\x4e\\x0e\\x04\\x7a\\x73\\x82\\xb0\\xc8\\xf5\\x41\\x99\\x5e\\xb5\\x01\\x6f\\xd9\\xef\\xf7\\xd5\\x09\\xf0\\xe6\\x40\\x9d\\x5b\\xd8\\x66\\xc0\\x17\\xff\\xe1\\xa3\\x10\\x83\\xed\\xee\\x1f\\x43\\x45\\x12\\xd9\\x44\\xe4\\xc8\\x1a\\xfe\\xfc\\xf4\\x32\\xe2\\x21\\x94\\x79\\x08\\x65\\xfe\\xf2\\x23\\xc1\\x50\\xfa\\xb4\\x47\\x0a\\xc1\\x47\\x80\\x24\\xcf\\xf1\\x4c\\x66\\x70\\xe6\\x4a\\x38\\x53\\x11\\x9c\\x98\\x14\\xce\\x43\\x00\\x87\\xe1\\x67\\x80\\xe5\\xf8\\xe7\\x7b\\x1f\\x20\\xee\\x0f\\xf8\\xe7\\x1f\\x3f\\x11\\xb0\\x75\\x4a\\x01\\x7b\\xe1\\xc7\\x02\\x56\\x58\\x00\\x04\\xf6\\x73\\x58\\x8e\\x4c\\xc0\\x24\\xff\\x51\\xc0\\xb4\\xfd\\x56\\xc0\\xd4\\x7c\\x51\\xc0\\x60\\x43\\x18\\x69\\x0c\\xc3\\xfc\\xbd\\x80\\x7e\\x7f\\x5d\\x40\\x47\\xfe\\x55\\x50\\x47\\x52\\x71\\x7b\\xc0\\x3d\\xf9\\x87\\x96\\x2d\\x16\\x9a\\x26\\x76\\x3c\\x20\\xed\\x3b\\x40\\x45\\x5b\\x80\\x1a\\x12\\x9f\\xac\\x56\\x18\\xba\\x12\\x37\\xe9\\xf4\\x0c\\xd5\\xff\\x91\\x21\\x6a\\x10\\x5e\\x54\\x09\\x1a\\x0a\\xe0\\xf9\\x81\\x37\\x30\\x1c\\x6d\\xda\\xe6\\x33\\x95\\x1b\\x86\\x35\\xf1\\x3b\\x6e\\x42\\x20\\xb2\\x76\\xc2\\x50\\xd5\\x74\\x6e\\x3a\\xd0\\x3a\\x3a\\x50\\x46\\xa6\\x03\\xe5\\x5f\\xc5\\xbe\\x57\\x35\\x8a\\x73\\xc9\\xb7\\x31\\x69\\xbb\\x53\\x4b\\xe8\\x08\\xdc\\x4c\\x0b\\x40\\xd6\\xde\\x39\\xc6\\x84\\xfc\\x56\\xcb\\x00\\xc2\\x03\\x64\\xc5\\x22\\x6c\\xd1\\x15\\x80\\x60\\x07\\x7b\\x14\\x14\\x11\\x10\\xf7\\xd1\\x11\\x7f\\x7c\\x66\\x2b\\xad\\x16\\x7e\\xfd\\x78\\x0b\\x5f\\xfc\\x77\\x2d\\xfc\\xfe\\xf1\\x16\\xbe\\xfe\\xfc\\x99\\x7a\\xd8\\x6a\\x65\\xf7\\xf1\\x56\\x7e\\xff\\xfc\\x56\\x86\\x7b\\xad\\x7c\\x07\\x6c\\x6d\\x46\\x16\\x45\\xf7\\xb4\\xf4\\xaf\\x96\\x29\\x5a\\xef\\xef\\xa9\\xeb\\xcd\\xfe\\x3d\\xff\\xf0\\xf0\\xf6\\x0b\\xa5\\x08\\xc7\\xe0\\x0f\\x75\\x3b\\x8f\\x6c\\x1b\\xab\\xff\\x8b\\x7b\\x05\\xbd\\x35\\x6a\\xfb\\xae\\x29\\xc4\\xb2\\x92\\xf1\\xe3\\xa7\\x13\\xe4\\x5e\\xfd\\xa1\\x38\\x31\\xb6\\xf2\\x8f\\xff\\xfd\\xf8\\xd6\\xa4\\x6d\\x80\\xbd\\x7f\\xcf\\xe0\\x7e\\xfe\\xef\\x9b\\x99\\x7f\\x7c\\xb1\\x12\\xf1\\xd9\\xad\\x9c\\xb4\\x5a\\xf9\\xe7\\xe3\\xad\\x14\\x9f\\xdf\\x4a\\x7b\\x2c\\xdf\\x7f\\xbc\\x15\\xf1\\xdf\\xb7\\x72\\xf6\\xf1\\x56\\xb2\\xff\\xbe\\x95\\xf3\\x8f\\xb7\\x52\\xfe\\xf7\\xeb\\xf2\\xf2\\xe3\\xad\\x44\\xc2\\x54\\xb2\\x2d\\xa5\\x72\\xf4\\x7d\\x9a\\x88\\x9f\\x48\\xe6\\x86\\x10\\x97\\x17\\xe3\\xbe\\xc4\\x2f\\x6e\\x07\\x40\\xf5\\x32\\x00\\x44\\xd1\\x7b\\xdc\\xbf\\x41\\xcb\\x30\\x7a\\xf9\\xf2\\x71\\x65\\xf0\\x2b\\xdc\\x1f\\xd0\\x32\\x0c\\xb5\\x3d\\x43\\x1b\\x9f\\x4b\\xf5\\x6c\\x70\\x80\\xd5\\xb8\\x56\\x87\\xc6\\xb5\\xfa\\x18\\xb0\\x6e\\x0c\\xa6\\xc9\\xe8\\x89\\x16\\x86\\xd1\\x22\\x89\\xca\\xdd\\xbe\\x90\\x6e\\xf2\\xda\\x29\\xce\\x52\\x2f\\xfb\\xee\\x6c\\xfb\\xee\\xa5\\x90\\x73\\x74\\x84\\xc6\\x94\\x18\\xd8\\xc3\\xc6\\x0f\\x50\\x61\\xa5\\xbe\\xc3\\x2e\\x21\\x7b\\x63\\x30\\x91\\xa2\\xe1\\x3b\\x11\\x8b\\x26\\xce\\x16\\xdd\\x9c\\x27\\x6e\\x81\\xc6\\xd3\\x5e\\x42\\x86\\xd3\\xe5\\x08\\x38\\x15\\x9e\\x00\\x3e\\xb6\\x0a\\xcf\\xc4\\xc2\\xb9\\x0a\\xa1\\x95\\x1c\\x1f\\xcf\\xc3\\xee\\x2a\\xc8\\x7f\\xba\\x4e\\x8c\\x38\\x4a\\x68\\x55\\x61\\x63\\xd2\\x54\\x3e\\xcf\\x5a\\xa1\\x2a\\x16\\xa2\\x65\\x76\\x28\\xa3\\xcb\\x54\\xb6\\x65\\x82\\xb4\\xd9\\x45\\x37\\x8e\\x12\\x71\\x8e\\xbe\\x6c\\x96\\xad\\x23\\xce\\xe0\\x28\\xcb\\x19\\x30\\x4a\\x1b\\xf2\\xc9\\xa2\\xbd\\x84\\x53\\xc0\\xd0\\xc8\\xd4\\x1e\\xc9\\x32\\x2f\\x92\\xb9\\x19\\x7b\\x65\\x25\\x4c\\x75\\x71\\x13\\xb9\\xcb\\x86\\x36\\x69\\xbc\\x5b\\xa6\\x49\\xdd\\x16\\x61\\x7c\\xec\\x26\\x7a\\xe9\\x16\\x28\\xbb\\xae\\x32\\xb5\\x2a\\x5f\\x8a\\x56\\x20\\x34\\x9a\\x17\\xb4\\xc5\\xc7\\x28\\x2f\\xce\\x37\\x41\\x6f\\xe8\\xbe\\x0b\\x7a\\x0f\\x47\\x4a\\xfa\\xef\\x65\\xa8\\x11\\x1d\\x73\\x74\\x1f\\x82\\xae\\x04\\x3c\\x75\\xd0\\xe7\\xb6\\x32\\xe3\\x2f\\x6c\\x16\\xd7\\xfe\\x2f\\xf0\\x96\\xf3\\xc8\\x89\\xd9\\x82\\x97\\x4e\\xe8\\xe6\\x4e\\x95\\x2f\\xb0\\x81\\xa3\\xce\\x9d\\xd4\\xa9\\xf2\\x06\\xf6\\x68\\x17\\x52\\x80\\x03\\xc3\\x46\\x7c\\xc5\\x16\\x36\\xd9\\x5b\\xa2\\xcd\\x24\\xcc\\x71\\x7c\\xab\\x7c\\x58\\x19\\x59\\x7b\\x8e\\xce\\x42\\x39\\x93\\x35\\x6b\\x9b\\xb2\\x00\\x58\\x41\\xfd\\x19\\x78\\x64\\x0e\\xf8\\x2a\\xb5\\x61\\x24\\x50\\x45\\xdd\\x3c\\xb7\\x04\\x0f\\xec\\x7a\\x7c\\xb6\\x36\\x1d\\x95\\x5d\\x01\\x16\\x22\\xd4\\x6b\\x61\\xca\\xf1\\xa4\\x04\\xdc\\xd8\\x94\\x1b\\xf3\\xb4\\x13\\x64\\xe0\\x09\\xad\\x67\\xdd\\x56\\x45\\x60\\x4d\\x33\\xc7\\x9c\\xa7\\xcc\\x31\\xe7\\xa9\\x7a\\x16\\xb6\\xe1\\xed\\x75\\xd5\\x0c\\xf6\\x86\\x2d\\x38\\xe8\\x93\\xe5\\x62\\x23\\x0e\\x7a\\x61\\xc1\\xd3\\x10\\x9f\\x86\\x46\\xa9\\x79\\xa3\\xd4\\x54\\xe5\\x1d\\xa2\\x97\\xd6\\x50\\x96\\x62\\xea\\x49\\x79\\x6e\\x51\\x2a\\x53\\x4f\\xca\\xb3\\x8b\\x52\\x8d\\x4a\\xd7\\xfa\\xd0\\x60\\xf3\\x1c\\x13\\x19\\x66\\xc3\\x47\\x55\\x1f\\x3e\\x9a\\xdd\\xd8\\xb5\\xbb\\x81\\xd5\\x33\\x59\\xb7\\xea\\x80\\x91\\xfb\\xcc\\x98\\xc9\\xda\\x25\\x80\\x0a\\x25\\xd5\\x88\\x93\\x6a\\xc4\\x09\\x1d\\x18\\x4c\\xe9\\x71\\x59\\xa9\\xfc\\x1d\\xe2\\xaf\\x61\\x5d\\x2e\\x6a\\x02\\x64\\x6a\\x6c\\xac\\x44\\x76\\x1a\\x89\\x21\\x74\\x3d\\xc3\\xca\\x8c\\xbe\\x5c\\x36\\xa7\\x1d\\x60\\x32\\x66\\xf5\\x70\\xd0\\xf6\\xe9\\xf3\\xe0\\xf8\\x98\\xbe\\x0c\\xf0\\xcb\\x80\\xbe\\x18\\x36\\xc9\\xc2\\x38\\x43\\x23\\xc3\\xc4\\x83\\x56\\x9d\\x9c\\x5c\\x46\\xd7\\x00\\x84\\xeb\\xad\\x80\\x0a\\x2e\\xc7\\xf0\\x7a\\x61\\xc6\\xb6\\x30\\xad\\x81\\x2b\\xa8\\xe3\\xba\\xdb\\x90\\x5d\\x84\\x2e\\xb7\\x12\\xef\\x22\\xb4\\x7b\\xf0\\x76\\x8d\\x6f\\x85\\x77\\x2d\\xdf\\xce\\xf1\\x4d\\x78\\xe7\\xf4\\x66\\x98\\xdd\\xee\\x9d\\xf5\\xd2\\xec\\x67\\x54\\xf7\\xb3\\xa4\\x7e\\xc2\\x49\\x8f\\x1a\\xdd\\x0c\\xf4\\xbb\\xea\\x68\\x58\\x1f\\x99\\xb2\\x3a\\xf7\\x72\\x7e\\xeb\\x15\\xb4\\x62\\x2e\\x9c\\xd0\\xcb\\x1c\\x38\\x6e\\xb1\\x8b\\xa6\\x0b\\x4e\\xea\\x15\\x4e\\xa8\\xde\\x0a\\x27\\xf0\\x84\\x03\\x07\\x34\\x86\\x95\\x70\\x52\\x57\\x38\\x81\\x9b\\x41\\xea\\xe8\\x12\\x06\\x11\\xb3\\xb7\\xf8\\xd7\\xb1\\x0a\\x97\\x4e\\xb1\\xcd\\x5e\\xc8\\x77\\xe1\\xd2\\xf9\\xb5\\xd9\\x33\\xf9\\x0e\\x5c\\x58\\xc6\\xd1\\x80\\xe4\\x5a\\x28\\x13\\xdb\\x1a\\x50\\x8c\\xde\\xed\\x01\\x09\\x8a\\x1e\\x50\\x56\\x23\\x4f\\xeb\\x91\\x47\\x72\\x85\\xa0\\xb1\\x7a\\xe4\\x25\\xa2\\x6c\\x03\\x52\\x95\\xb6\\x3e\\xde\\xf8\\x16\\xd9\\xec\\x5d\\x0d\\x6e\\xea\\xf6\\x0d\\x1b\\x65\\x9c\\xf7\\x2a\\xcf\\x85\\xa1\\xf5\\x7c\\x71\\x27\\xf4\\x3d\\xbc\\x73\\x10\\xf6\\xb6\\x56\\x44\\xdc\\xb5\\x22\\x04\\x89\\x01\\xea\\x7a\\x91\\x13\\x10\\x14\\x4e\\x61\\x0d\\x42\\x80\\xc4\\xb0\\x12\\x5e\\xe9\\xa4\\x6c\\x65\\x1c\\xb3\\x18\\x16\\x23\\x77\\x72\\x77\\xe1\\x2c\\xd0\\xdc\\x01\\x96\\xc8\\x2d\\x61\\x21\\x22\\x28\\xb0\\x41\\xc3\\x0a\\x2f\\x41\\xb9\\x41\\x6f\\xc5\\xae\\x78\\x03\\x3a\\x2f\\xed\\xd1\\x2b\\x58\\x81\\x0d\\x80\\xf8\\xe7\\xf4\\x9b\\xb3\\xf7\\xf4\\xbb\\x60\\xb8\\x7e\\x57\\xb4\\x7e\\x57\\x6a\\x7d\\xf4\\xfa\\xc1\\x7b\\xe9\\x5a\\x65\\xb5\\x7e\\xf0\\x0e\\x28\\x3a\\xd2\\xeb\\x27\\x83\\x3b\\xb4\\x00\\xfd\\xfe\\x1a\\x12\\xa0\\x87\\x75\\x62\\xa8\\xb8\\x34\\x56\\x20\\xad\\xa6\\xcf\\x40\\x4b\\x81\\x5c\\x56\\xd8\\x23\\xf5\\xf4\\xa5\\x68\\x0f\\x1f\\xd6\\xd3\\x97\\xb6\\x70\\x80\\xd1\\x17\\xac\\xff\\x4e\\x6c\\x60\\x26\\xbe\\x15\\xcc\\x5c\\x68\\xc3\\x1a\\x5c\\xec\\xc5\\x83\\x31\\x0d\\xc1\\x51\\x3b\\x8e\\xef\\xac\\x20\\x77\\x5a\\x86\\xf6\\x47\\x75\\xd8\\x19\\xe9\\x74\\x4c\\xf2\\x58\\xfd\\x64\\x09\\xf5\\xd8\\x30\\x1c\\x35\\xea\\xd3\\x59\\x65\\xb5\\x02\\x63\\x97\\xe8\\x0f\\x75\\x03\\x0d\\x15\\xfc\\xab\\x3a\\xfc\\x8a\\x19\\x94\\xf0\\x79\\xa5\\xa6\\xaa\\x22\\xdb\\x49\\x03\\x2f\\xa9\\x71\\x4f\\x0e\\x1b\\xc6\\x2e\\xac\\x23\\xcb\\xaa\\x09\\x46\\x6f\\x60\\x9f\\xf2\\xbe\\x6d\\x84\\xa0\\x20\\xca\\x07\\x7e\\x0a\\xaa\\xe5\\x52\\x4e\\x07\\x1c\\xca\\x06\\xd5\\xa4\\x29\\xc6\\x00\\x88\\xd9\\x62\\x1c\\xa0\\xce\\xd7\\x2e\\x15\\xed\\x84\\xda\\xda\\x69\\x30\\xb3\\xab\\xd1\\x8c\\x4c\\x9b\\xf4\\xd2\\xa0\\xa4\\x94\\xb2\\x5c\\x5c\\x3f\\x78\\x27\\xc8\\x28\\x96\\x2c\\x44\\xd1\\x32\\x36\\x36\\xbe\\xe2\\xb7\\x90\\x1d\\x01\\xad\\x14\\x76\\x53\\x80\\x3c\\xca\\x14\\x2d\\xac\\x14\\xbb\\x68\\x58\\xab\\xf3\\x67\\x55\\x2d\\x03\\xa3\\x96\\xac\\xaa\\xa5\\x4f\\x4a\\xf6\\xc3\\xb5\\xdc\\x92\\x65\\x6a\\x8e\\xd6\\xa4\\x70\\x46\\xdf\\x0b\\x84\\x20\\xef\\x05\\x6d\\x3f\\xcd\\x50\\x7c\\x30\\x06\\x8e\\x96\\x66\\xd0\\x44\\xaa\\x49\\xbe\\x58\\xcd\\x43\\x0a\\x83\\xef\\x0a\\x1e\\xf2\\xa3\\xb0\\x9a\\xa7\\x9c\\x2d\\xe0\\x58\\x47\\x30\\x25\\xa3\\x51\\x5d\\xc9\\x92\\xaf\\xe0\\x14\\x1f\\xf5\\x47\\xcb\\xee\\xd5\\x08\\xa3\\x77\\x58\\x4b\\xbe\\xec\\x26\\x18\\xc4\\x53\\x6b\\x82\\x47\\x39\\x7c\\x79\\xcf\\x9a\\xb3\\x3f\\x4f\\x71\\x1d\\xa1\\x10\\xa4\\xa5\\xf0\\x17\\x2d\\xcb\\xba\\x82\\x16\\x77\\x63\\x9b\\x3d\\x8c\\x79\\xde\\xee\\x5d\\xb5\\x4a\\x0b\\x9e\\xeb\\x55\\x5a\\xd0\\x2a\\x91\\x02\\x31\\x83\\x6a\\xb7\\x50\\x5b\\x02\\x7f\\x07\\xb0\\xaf\\x46\\xd4\\x23\\x52\\x2e\\xca\\xea\\x3f\\x60\\x87\\x36\\xdd\\xf7\\xc6\\x16\\xc8\\xab\\xbd\\x34\\x0a\\x80\\x00\\x1d\\x79\\xde\\x3d\\xcd\\xdc\\x36\\x9a\\xd9\\xc0\\x5f\\xaf\\x6a\\x67\\x73\\x8b\\x7f\\x53\\x26\\xc7\\x0c\\x33\\xb3\\xb9\\xbd\\x5e\\x45\\xc0\\x4f\\x1c\\xc1\\x58\\xed\\x91\\xb9\\x75\\xcc\\x70\\x79\\x42\\x6d\\xec\\x7a\\x57\\x9b\\x61\\x26\\x61\\xfb\\x72\\xe4\\xdf\\x70\\x63\\xc3\\x0c\\x64\\xc8\\x19\\x95\\xdd\\x84\\xe3\\x2e\\xcd\\x60\\x87\\x76\\x37\\x18\\x9a\\x85\\x8b\\x91\\xfe\\xd8\\x57\\x1f\\x8d\\x26\\xde\\x19\\x1a\\x61\\x32\\xef\\x41\\x3b\\x2b\\x7a\\x78\\x0f\\xb4\\x8d\\x0c\\x89\\x84\\x21\\x48\\xf0\\x41\\xf0\\x4c\\x3e\\x5c\\xa1\\x2d\\xa1\\x8c\\xc3\\xa4\\x42\\x16\\x91\\xba\\xde\\x30\\xb8\\x35\\x6a\\x6d\\x73\\x65\\x84\\x08\\x0d\\x55\\xa2\\xc1\\x4f\\x95\\xf4\\x82\\xa1\\x6f\\xa5\\x19\\x27\\x34\\x88\\x13\\x8b\\x76\\xd8\\x72\\xce\\x8b\\x56\\xa4\\x3c\\x83\\x49\\x29\\x65\\x48\\x93\\xb9\\xca\\x69\\x40\\x1c\\x43\\x25\\x68\\x7f\\xd8\\x29\\x48\\x19\\xb0\\xb9\\xb9\\xf1\\x4c\\x35\\x60\\x9d\\x29\\x55\\x99\\x5a\\x0c\\x4c\\xae\\xda\\x95\\xa7\\x6b\\x0a\\x2f\\x2a\\x64\\x46\\xd5\\x8b\\xed\\x3d\\xbd\\x58\\x58\\xa4\\x1d\\xae\\xdb\\x06\\x04\\x37\\x35\\x08\\xc1\\x15\\xa4\\xe7\\xd6\\x95\\x0c\\x46\\xc1\\xe8\\x17\\x6d\\x10\\xb7\\x75\\x4f\\x46\\xda\\xd6\\x78\\xdb\\x45\\xe3\\xe8\\x84\\xf8\\xfb\\xb3\\xee\\x65\\xb9\\x58\\x88\\xcc\\x22\\x5b\\x52\\x7d\\x36\\x60\\xef\\x40\\x37\\x53\\xd4\\x81\\x6d\\x64\\x77\\xaf\\xb0\\x3d\\x82\\x19\\x19\\x9e\\xcb\\xc1\\x31\\xa2\\x7f\\x8e\\x1d\\x95\\xa6\\x82\\x06\\xab\\x07\\xdb\\x37\\xe5\\x52\\xd5\\x9f\\x8d\\xfb\\x72\\xe7\\x5d\\xde\\xdc\\x58\\x51\\x8b\\xfb\\x63\\x97\\x1c\\xa1\\x4f\\xd4\\xe2\\x3e\\x53\\xe4\\x08\\xf5\\xca\\x59\\xb8\\x4d\\x53\\x79\\x5a\\xc8\\xa8\\x72\\x14\\x99\\x7b\\x5e\\x1e\\x9d\\xf1\\xe0\\xf8\\x78\\x78\\x5c\\x54\\x91\\x44\\x85\\xec\\xba\\x11\\x7d\\x74\\x15\\x2d\\x0a\\x8b\\xec\\x23\\x75\\x8e\\x45\\x14\\x17\\x30\\xea\\x5f\\x84\\xf2\\xcd\\x5f\\xb2\\x0d\\xbb\\x62\\x73\\x4e\\x66\\x46\\x6b\\x5e\\x6a\\x14\\x54\\xf1\\xbd\\x36\\xdb\\xf1\\x0f\\xd4\\x29\\x3f\\x65\\x55\\x8f\\xfd\\x90\\xa9\\xee\\xf8\\x31\\x33\\x87\\x67\\xea\\x11\\xf4\\xbe\\xc8\\xd9\\xae\\x1e\\x2b\\x5f\\xa8\\x37\\x44\\xc6\\x40\\x9e\\x20\\xa6\\xda\\xe0\\x8a\\xb2\\x9a\\xfd\\x3d\\x54\\x49\\xda\\xa8\\x24\\x34\\x2a\\x89\\xa1\\x12\\x54\\x5d\\x8a\\x0c\\x58\\xe5\\xa5\\x5a\\x6e\\xfe\\xad\\xb0\\xd6\\x6c\\x03\\xe0\\xa4\\x72\\x2e\\xb9\\x67\\x2d\\x00\\x83\\x2e\\xd9\\x37\\x88\\x78\\x04\\x1c\\x37\\xdb\\xc7\\x00\\x09\\x9f\\xba\\x74\\x4c\\x28\\x7f\\x06\\xfc\\x33\\x80\\xe2\\xcc\\x58\\x2a\\x28\\x01\\x55\\x45\\x0d\\xd6\\x1e\\x2b\\x19\\x20\\x0d\\xa7\\xc0\\x00\\xcb\\x37\\x2b\\x91\\x09\\x73\\xd0\\x7b\\xed\\x7e\\x7a\\x8b\\xac\\xd9\\xd8\\x2d\\xf0\\xc9\\xfc\\x8d\\x20\\xa5\\x6e\\x61\\x9d\\xc9\\xc6\\x35\\x1e\\xde\\x19\\x90\\xed\\x17\\x71\\x20\\x2e\\xf6\\xd8\\x90\\x34\\x61\\x25\\x95\\x9b\\xda\\x54\\x4b\\x81\\x3e\\xd4\\x5b\\xc2\\xe8\\x7f\\xa1\\x0c\\xaa\\x20\\x1f\\x2a\\xef\\x68\\xf7\\x34\\x2d\\xd4\\x54\\x40\\xe7\\x29\\xbc\\x60\\x16\\xbd\\x99\\x2e\\x99\\x3c\\x96\\x66\\x65\\x2a\\xc0\\x5e\\xa5\\x03\\xc1\\x1d\\xa3\\x63\\xf0\\xde\\xb2\\x4c\\xa0\\x02\\xa6\\xd9\\xb8\\xee\\x3c\\x92\\x63\\xd4\\x4c\\xd1\\x3c\\x19\\x45\\x7d\\x32\\x4c\\xfc\\xf1\\x4d\\x83\\xa7\\xb4\\x28\\x8e\\xd5\\x16\\x8f\\x20\\x06\\xa8\\x40\\x5e\\xf2\\x4d\\xe0\\x3d\\x0f\\x7c\\xf8\\xab\\x62\\xac\\x90\\x9c\\x5d\\xe7\\x28\\x1a\\x39\\x8a\\x26\\x14\\x7b\\x2d\\x8c\\x60\\x69\\xe4\\x61\\xaa\\xfd\\x4c\\xe1\\xef\\xbd\\x53\\x99\\x34\\x56\\xbe\\xe0\\x83\\xbd\\xf9\\x8c\\x58\\x2a\\xab\\x06\\xe6\\x6f\\xdc\\xc7\\x00\\x2e\\xde\\x3b\\x74\\xec\\x05\\x0e\\x38\\xf2\\x00\\x3f\\xc0\\x6f\\x08\\x5f\\x90\\x09\\x46\\x01\\xa9\\x02\\xb5\\x28\\x76\\xc9\\xdc\\xd4\\xee\\x0d\\xa1\\x0c\\x86\\x72\\x79\\x83\\x51\\x95\\x54\\x6a\\x89\\x14\\x69\\x62\\x6c\\xaa\\x66\\x2f\\x74\\xb6\\x40\\x66\\x93\\x2f\\x11\\x11\\xc7\\xe8\\x56\\x52\\x1e\\x71\\x0e\\x1c\\x78\\x38\\xe6\\xef\\x30\\x66\\x13\\xb4\\x2f\\xbc\\x52\\x72\\xe5\\xf0\\x04\\x1c\\xcf\\x73\\x68\\x8a\\x7a\\x17\\xa8\\xaf\\x91\\xc7\\x03\\xfa\\x9a\\xf1\\x5f\\x89\\xce\\x44\\x23\\xab\\xff\\xac\\x3b\\x32\\x78\\x85\\x1e\\x25\\x87\\x5e\\x71\\x62\\x23\\x82\\x7a\\x93\\xed\\xcd\\xae\\xac\\x14\\xd0\\x27\\xae\\xc6\\x2d\\x23\\x2c\\x71\\xc0\\x77\\x74\\xe8\\x15\\x0d\\xf3\\x5f\\x03\\x6b\\x57\\x96\\x61\\x46\\x64\\x19\\xaf\\xd6\\xdb\\xc1\\x60\\x53\\x7b\\x0c\\xf3\\x5f\\xb1\\x66\\x96\\x65\\xb0\\x81\\xc0\\x5d\\xd5\\x8c\\x10\\xd0\\xd8\\x8e\\x21\\x6a\\xf2\\xaa\\xe7\\x0c\\xf2\\x95\\xa6\\x1c\\xcf\\x36\\x19\\x4b\\xbb\\x67\\x95\\x0e\\xb0\\x90\\x68\\x3e\\x5f\\xb8\\x59\\x23\\x5a\\xce\\x3f\\xed\\x9e\\xd6\\xa1\\xbd\\x12\\x1b\\x28\\x1e\\xe7\\x0d\\x4c\\x9d\\x9a\\x32\\xdc\\x3b\\xc8\\x3e\\xab\\xd7\\xbe\\xf9\\xd2\\x4c\\x82\\xb7\\x7e\\xe3\\xcd\\x6b\\x94\\x33\\xdf\\xbc\\x56\\xaa\\xd7\\x2c\\x2b\\xdb\\x1c\\x69\\xc3\\xb5\\x86\\x30\\x07\\x66\\x4d\\xf3\\x34\\xf8\\xf1\\x14\\x3f\\xaa\\x3d\\x3e\\xc2\\xae\\x47\\xbd\\x61\\x5d\\x4f\\x74\\x67\\xd7\\x31\\x45\\xa1\\x4d\\x4d\\x1c\\x21\\x86\\x6b\\x1d\\xd3\\x6f\\x1b\\x82\\xdc\\x8a\\x03\\xc2\\xa0\\x78\\x7c\\x6a\\x2c\\x0a\\xf3\\x0c\\xd9\\x21\\x83\\x5c\\x11\\x50\\x96\\x29\\x50\\xbc\\x3b\\xf2\\x8e\\x13\\x2d\\xce\\xc8\\x30\\x15\\x24\\xfb\\x40\\x24\\xbf\\x3f\\xc8\\xa8\\x78\\x05\\xd0\\xc4\\x40\\xe6\\xc6\\x06\\x05\\x92\\x57\\x94\\xfb\\x82\\xc7\\xd8\\x85\\x15\\x5f\\xe0\\xcf\\x92\\x23\\xdd\\xac\\xa4\\xa1\\x80\\x33\\xab\\xfe\\x2c\\x6d\\xcd\\xf4\\x63\\x87\\xe0\\x6d\\xce\\x07\\xc8\\x5d\\xcc\\x81\\x7d\\xc0\\xa8\\x65\\x73\\x3a\\x12\\x50\\xd7\\x5c\\x12\\x2d\\x6b\\x39\\xb2\\x1d\\x8d\\x4c\\xd7\\x77\\x56\\xd7\\xb7\\x43\\x64\\x51\\xd5\\xb7\\x43\\x9c\\xb1\\xf6\\x56\\xec\\x82\\x5f\\x56\\x52\\xe5\\x6b\\x7e\\xe1\\x5c\\xb2\\x73\\x7e\\x3d\\x86\\xa5\\x7b\\xcb\\x37\\xce\\x19\\xf6\\x7c\\x5f\\x3a\\xfc\\xd6\\xb9\\xa8\\x37\\xe9\\x35\\xf4\\xd3\\xd9\\xba\\x6f\\x6b\\x06\\xff\\x1a\\x69\\x93\\xc8\\xe5\\xe7\\x93\\x4b\\xf7\\xc2\\x79\\x19\\x00\\xfc\\x3f\\xff\\x7b\\x35\\xe6\\xe2\\xef\\x35\\xfc\\x91\\x73\\xf4\\x82\\xcf\\x85\\xb5\\x11\\x68\\x82\\x43\\xa2\\x5c\\x7b\\x74\\x26\\xac\\x17\\x12\\xcd\\x3f\\xc3\\xb4\\x92\\xbd\\xa0\\x6f\\xcf\\xb4\\x15\\x91\\x75\\xfe\\x37\\xf5\\xd4\\x1b\\xf8\\x03\\xdb\\x29\\x0a\\xeb\\x19\\x49\\x22\\x81\\x2a\\x7b\\x75\\x73\\x83\\x01\\xf9\\x5e\\x61\\x38\\x3b\\x98\\x82\\x9b\\x9b\\x17\\xb8\\xfe\\x64\\x8d\\x0c\\x9d\\xf8\\xbb\\x1a\\x9f\\x7d\\x8b\\xec\\xf1\\xdc\\x75\\x6d\\xe9\\xfd\\xb2\\xe2\\x6b\\x9c\\x70\\x98\\xe6\\x2d\\x5b\\xf0\\x44\\x87\\x32\\xb3\\x00\\xd8\\x8f\\xa3\\x9b\\x1b\\xfc\\x8b\\x8e\\x22\\xbb\\xd0\\xfe\\x7b\\x70\\x9c\\x1a\\x26\\xda\\xa2\\x6d\\x3f\\x6d\\xc8\\x2c\\x0d\\x29\\x91\\x29\\x75\\x1e\\x47\\xb7\\x4d\\x3b\\x33\\x69\\x5e\\x1d\\x01\\xd3\\x1a\\xb3\\xfc\\x5e\\x5c\\x11\\x23\\xaf\\x39\\x80\\xed\\xb4\\x8f\\x24\\x80\\xeb\\x94\\x35\\x2d\\x91\\xda\\x82\\x37\\xa0\\x95\\x81\\x20\\xc0\\xcf\\xb0\\x5d\\xd2\\xc9\\x15\\x3a\\x67\\xd0\\xab\\x7f\\x35\\x81\\x07\\xd7\\xea\\x8f\\x17\\xea\\x9c\\xd9\\xf8\\x95\\xe2\\x71\\x1c\\x09\\x72\\x6d\\x0a\\xf9\\x95\\x8d\\xe2\\x8a\\x06\\x55\\x7e\\x24\\x7d\\x81\\x96\\x3c\\x03\\x00\\xbe\\xb1\\x99\\x94\\x18\\xa0\\x3f\\x0e\\x3c\\x6c\\xe0\\x01\\xa7\\x79\\x43\\xa2\\xe9\\xe7\\x01\\xdb\\x90\\x60\\x1a\\x1e\\xb0\\x17\\xf8\\x95\\xbe\\xe0\\x76\\xa0\\x8a\\xec\\x1c\\x4e\\xcd\\x15\\xa2\\x2b\\xb3\\x0d\\xac\\x7b\\x43\\xbe\\x06\\xea\\x0c\\x2f\\xe9\\x5c\\x50\\x41\\xbf\\x6e\\x79\\x3f\\xd5\\x44\\x1e\\x08\\xe8\\x97\\x15\\xac\\x01\\xec\\x03\\x63\\x4a\\xff\\xbe\\x92\\xb3\\xb3\\x1e\\xcd\\x8f\\x61\\x41\\x8f\\xac\\xb5\\x6c\\x0a\\xe5\\x04\\xe8\\x54\\x8e\\xdd\\x49\\xdb\\xdd\\xd1\\xed\\xac\\x15\\xf3\\xb1\\xd6\\xcc\\x47\\x9d\\x30\\x50\\x09\\x83\\xd9\\x5e\\x37\\x7c\\xeb\\x53\\xb2\\xdd\\x81\\xea\\xda\\x4d\\x02\\x21\\x73\\x74\\x75\\x73\\x03\\x43\\xa1\\x59\\xdf\\xd8\\x78\\x39\\x8d\\xcc\\x5a\\x4f\\x2e\\x0c\\x7c\\x03\\xa0\\xe8\\x0a\\xa0\\xd5\\xfc\\x20\\x36\\x0c\\xf5\\xa2\\x6a\\x84\\x28\\xe9\\xd3\\xbb\\xf0\\x61\\x7e\\x63\\xc5\\x80\\xe6\\xed\\xd3\\xd3\\x81\\x89\\x17\\xb3\\xa6\\xd6\\x8f\\x0e\\x2d\\xc0\\x4f\\xe9\\x47\\x9c\\xf2\\xe9\\x80\\xf5\\x11\\x64\\x06\\x78\\x76\\x51\\x62\\x85\\x5d\\x12\\x80\\xbc\\x03\\x94\\xd3\\x04\\xd8\\xdb\\x9c\\x87\\x5e\\xec\\xc4\\xb4\\xe3\\x72\\x7d\\x1d\\x07\\x0a\\xc8\\x46\\x12\\x2a\\x46\\x4e\\xd8\\xcb\\x01\\x2c\\x7a\\x91\\x13\\xc3\\xc3\\x12\\x6b\\x42\\x61\\x23\\x6c\\xed\\x1d\\x3e\\x2d\\x10\\x20\\xee\\xb0\\xce\\x95\\x3d\\x5a\\xe3\\xee\\xbb\\x92\\xb0\\x61\\xce\\x97\\xc0\\xe4\\x5c\\xe1\\x97\\x39\\x32\\x36\\xf0\\x34\\xc7\\xa7\\x33\\xbe\\x76\\xd6\\xde\\xce\\xb1\\x28\\x69\\x83\\x01\\xe4\\xa8\\x71\\x38\\x04\\x67\\x4a\\x24\\xb6\\x35\\x64\\xb1\\x44\\x46\\xef\\xb0\\xac\\xe5\\xad\\xbd\\xad\\xdd\\xdb\\x51\\x76\\x68\\xe9\\x12\\xf7\\xdf\\x25\\xdf\\xc2\\x93\\xcd\\x8e\\x84\\xb6\\xe2\\xbf\\xa4\\xd6\\x2f\\x00\\x6c\\x12\\xe4\\x3d\\x97\\xca\\x99\\xb7\\x12\\xb5\\xbc\\x20\\xfd\\xcc\\xe8\\x7a\\x7c\\x0e\\x07\\xe4\\x82\\x5f\\x43\\xae\\x73\\xc8\\x72\\xa1\\x41\\xdc\\xb9\\x77\\xcd\\x5e\\x21\\x35\\xf7\\x4c\\x51\\x71\\xec\\x39\\x7f\\x45\\x40\\xe7\\x19\\x75\\x12\\xa0\\xd9\\xdb\\xf1\\x0b\\x2a\\xfb\\x16\\xea\\x7c\\x01\\x15\\x5e\\x00\\x4b\\x33\\x79\\x35\\x79\\xeb\\xbe\\x18\\xf7\\xff\\xbe\\x84\\xda\\x4f\\x11\\xa9\\x5e\\x22\\x52\\xbd\\x26\\x3a\\xf0\\xad\\xff\\xc2\\xf6\\xdf\\x9e\\x72\\x4c\\x83\\x3d\\x83\\x39\\xf8\\x0b\\xff\\x19\\x40\\xf3\\xbf\\xad\\x6b\\xfc\\xdc\\xa7\\xcf\\x80\\x6f\\xf9\\xb9\\x9a\\x80\\xf7\\xd5\\x88\\x5d\\x39\\x62\\x6d\\x2f\\x29\\xac\\xf7\\x38\\xea\\xe9\\x25\\x83\\x61\\xbf\\xb7\\x67\\xe6\\x5e\\x28\\x4d\\x79\\x45\\x3a\\x49\\xfc\\x77\\x40\\x3c\\x23\\xd5\\xab\\x4a\\x7b\\xd9\\xb8\\x98\\x94\\x37\\x7c\\xe0\\x17\\x63\\xf2\\x91\\xbf\\xe1\\x43\\xc0\\xae\\xd9\\x58\\xe0\\xd7\\x87\\xbe\\xd0\\x5f\\x9f\\xc2\\x16\\xba\\x6d\\xe9\\x40\\x12\\xd2\\x7f\\x8c\\xd1\\x8d\\x15\\xa9\\x49\\x24\\x15\\x90\\xec\\xc5\\xfd\\xf7\\xd8\\xf9\\xa6\\x0e\\x7b\\xf2\\x52\\x4a\\xfc\\x43\\x38\\xc1\\x53\\xa0\\x4b\\x92\\x99\\x3f\\x45\\x8a\\x23\\x81\\x3f\\x26\\xf2\\xff\\xe9\\x3e\\x29\\x4c\\x7d\\x63\\x48\\xd9\\x85\\xad\\x0a\\x7f\\x2f\\xa1\\xad\\xb4\\xbb\\x25\\xc1\\xdf\\x0e\\xb6\\x6c\\xd0\\x45\\xdc\\x10\\xc0\\xf3\\x8a\\xa3\\x83\\xe7\\x00\\x76\\x63\\xee\\x85\\xb0\\x13\\x17\\x1e\\x6d\\x65\\x20\\x60\\xe0\\x75\\x83\\xd0\\x05\\x3a\\x6d\\xcb\\x08\\xa7\\x3d\\x38\\x92\\xe4\\x40\\x08\\x2f\\xab\\x71\\xa4\\x85\\x7d\\x4b\\x44\\x28\\x00\\xd1\\x22\\xbb\\x32\\xe7\\xdf\\xa0\\x4c\\x81\\x1c\\xa8\\x96\\x3a\\x57\\x34\\x96\\x5e\\xa9\\x11\\xe1\\xab\\x88\\x0b\\x5d\\x7f\\x1f\\x6a\\xda\\xaf\\xff\\x70\\xc9\\x76\\xfd\\x87\\x7b\\x41\\xf5\\x17\\x5e\\xcc\\xae\\xda\\xfd\\xbf\\x82\\xfa\\xaf\\x3e\\xa1\\xff\\x57\\x1f\\xef\\x7f\\xa6\\xeb\\x37\\xfb\\x5f\\xd7\\x7f\\x7f\\xff\\xaf\\xee\\xed\\xbf\\x5a\\xd0\\x15\\x39\\x38\\xc3\\x12\\xf2\\x0f\\x5b\\x3f\\x74\\x57\\xce\\x86\\xed\\xfc\\x18\\x7e\\xaf\\x6e\\x6d\\x36\\x18\\x2f\\x29\\xf1\\x52\\x26\\x2e\\x55\\xe2\\x92\\x12\\xcb\\x5b\\xfa\\x5f\\x6d\\x90\\x28\\x0e\\x46\\x72\\x21\\x11\\x7c\\x4d\\xf5\\x93\\xc1\\x53\\x42\\x47\\xae\\x04\\x3e\\xab\\xef\\x9f\\xf8\\xfa\\xab\\xa8\\xbe\\x0e\\xfd\\x81\\xfc\\x8a\\xea\\xca\\xea\\xeb\\xc0\\x07\\x8c\\x0c\\xbf\\x27\\xfe\\xb0\\xe5\\xbd\\x50\\x35\\x90\\x5a\\x28\\x9d\\x45\\x16\\xb4\\xe5\\x6c\\x60\\x4a\\xf9\\x06\\xc8\\x55\\xe1\\x39\\xac\\xfd\\x9d\\xc4\\x11\\x5a\\xd3\\x0b\\x2f\\xf3\\xfb\\xe4\\x23\\x55\\x69\\x94\\xfd\\x01\\xbd\\x57\\xd4\\xb7\\x3f\\x54\\xef\\x4a\\x91\\xea\\x57\\xfa\\xe8\\xbd\\x88\\xbd\\x81\\x31\\x0d\\x61\\xd3\\x26\\xa5\\x0f\\x98\\x64\\xae\\xed\\x52\\x2a\\x7a\\xba\\x3f\\x12\\xe3\\x12\\xad\\x2e\\x2a\\x72\\x17\\x4f\\x17\\x1a\\x2c\\xcc\\xd1\\x00\\xa3\\x8e\\x12\\xae\\xb0\\x02\\x50\\xce\\x29\\x8a\\xc9\\xec\\x08\\x5e\\xd3\\x19\\x8b\\x09\\x68\\x65\\x93\\x08\\x7e\\x11\\x4a\\xfc\\x6c\\xc5\\x0c\\x23\\xd9\\xe0\\x0a\\xbb\\x6e\\xe1\\x47\\x32\\xbd\\x4e\\x38\\x85\\x04\\xcf\\xc3\\xc8\\x33\\x91\\x9e\\x88\\x3e\\x86\\x60\\x30\\x85\\x99\\x11\\x06\\xb0\\x62\\xb1\\x9c\\x3f\\x44\\xfa\\x0b\\x19\\x88\\x4c\\x32\\x4b\\x11\\x51\\x02\\x25\\xc5\\xa8\\xb0\\xa1\\xa8\\xb5\\x80\\x17\\x8a\\x78\\x75\\x73\\x93\\x62\\x59\\x68\\xe3\\xef\\x10\\xf7\\xe1\\x3c\\x7d\\x10\\x6b\\x36\\x04\\xa9\\xf0\\x9b\\x9b\\x13\\xfc\\x01\\x00\\x28\\x58\\x3e\\x1e\\x4c\\x32\\xbf\\xb0\\x47\\x52\\xa4\\x0d\\x35\\x5a\\xb9\\x1b\\xba\\x0f\\xed\\x2f\\x1f\\x62\\xa5\\x0b\\xb5\\xa5\\x75\\x79\\xc2\\x88\\x41\\x93\\x4f\\xc9\\xa5\\x58\\x58\\x8d\\xa2\\x1c\\xa3\\x9f\\xb2\\x18\\x53\\x08\\x0e\\x8a\\x9e\\x9e\\x8d\\x79\\x64\\x8a\\x50\\x69\\x4b\\x48\\x39\\xec\\xf1\\x71\\xa0\\x2a\\x6e\\x9a\\xcc\\xa0\\x1c\\xf5\\xb9\\x92\\xb5\\x01\\x76\\x3c\\x3e\\x9e\\x4b\\xd1\\xc9\\x1a\\x65\\x38\\x80\\x8e\\x8e\\xfa\\x80\\x97\\x80\\xb8\\xbc\\xe4\\x17\\xbc\\x71\\x7b\\xdd\\x12\\x45\\x34\\x48\\xda\\x59\\x3b\\x06\\x88\\x71\\x7b\\x7c\\x7c\\x7d\\x7c\\xfc\\xac\\x2b\\xe5\\x32\\x48\\x18\\xca\\x7a\\x9e\\x55\\x02\\x57\\xa0\\xc0\\x74\\x43\\x0b\\x76\\x8d\\xfd\\x39\\x20\\x34\\xde\\x28\\x4d\\x6b\\xed\\xf6\\xed\\xfd\\x12\\xd6\\x8e\\xdf\\xf0\\x9c\\xa0\\xdb\\xe7\\xdd\\xc9\\x85\\xad\\x85\\xcc\\x72\\xdc\\xb8\\x8a\\x30\\xaa\\xb5\\x29\\x85\\x66\\xe7\\x36\\x30\\x41\\x80\\xfd\\x0b\\x60\\x78\\x04\\x0e\\x72\\x80\\x7a\\x38\\x2b\\x68\\xd0\\x5c\\xe6\\x7c\\xd5\\x4c\\x2a\\xe4\\xbb\\xb6\\xcd\\x24\\x4a\\xd1\\x0e\\x80\\x81\\x0f\\x20\\xe4\\x12\\xc0\\xc7\\x05\\xfa\\x22\\xc0\\x73\\x02\\xcf\\xc5\\xed\\xed\\xe8\\x95\\x85\\x7e\\x74\\xd7\\x14\\xdb\\xe5\\x50\\x23\\x59\\x17\\xf1\\x08\\xfe\\xdd\\xd9\\xe6\\xd7\\x4b\\xfa\\x7a\\x09\\x5f\\x99\\x40\\x77\\xd9\\x9a\\x4a\\x7b\\x8b\\xd2\\x44\\xff\\xfe\\x6e\\xcb\\x4c\\xb7\\x97\\x30\\x58\\x74\\xfd\\xbc\\xe6\\x82\\x70\\xe9\\x15\\x9b\\xb3\\x35\\x83\\x65\\x63\\xe4\\x72\\xce\\xae\\xd9\\x39\\x7b\\x0b\\xe4\\x43\\xc0\\x9e\\x49\\x99\\xe1\\x2b\\x6e\\x20\\x45\\xb4\\x05\\x57\\x5c\\x85\\x21\\x08\\x5e\\x55\\x84\\xe4\\xf2\\x4e\\x41\\x70\\xc0\\x9f\\x91\\xd4\\x1e\\x38\\x8d\\x29\\x92\\x3d\\x47\\xfd\\xbb\\xa4\\xbd\\x01\\x90\\x2f\\x57\\xb5\\x34\\x57\\x91\\x6d\\x05\\x0f\\x71\\xc5\\x32\\x22\\x61\\xdf\\x1e\\x1f\\xa3\\x09\\x99\\xf6\\x34\\x1f\\x59\\x30\\x1f\\xa5\\x4d\\xc3\\x6f\\x09\\x4d\\xf7\\xe7\\x24\\x6e\\x08\\x4e\\x03\\x9c\\x24\\x83\\x2f\\x80\\xe3\\xf3\\x1c\\xda\\x04\\x60\\x01\\x40\\x42\\xa6\\x9a\\xa2\\x54\\x24\\x2a\\xe7\\x7c\\x2d\\x89\\xe2\\xca\\x46\\xfd\\xb9\\x79\\x49\\x83\\x61\\x20\\x83\\x40\\x0f\\x18\\xeb\\x13\\xf4\\xc4\\xce\\x24\\x05\\x9c\\x49\\x7d\\x8d\\x3e\\xb5\\xe8\\xce\\x13\\xc4\\x31\\x6c\\x9b\\x4f\\x0a\\x8e\\x94\\x59\\xd2\\x7e\\xc9\\x81\\x5a\\x07\\x4f\\xfb\\xca\\x8c\\x49\\xbd\\xd9\\xfe\\xb4\\xe8\\xbd\\x0b\\x1c\\x4a\\x50\\x0f\\xb3\\x5b\\x66\\xdc\\x76\\xf2\\xd7\\xbe\\x7a\\xbb\\x1d\\xe2\\x84\\x68\\xdb\\xc8\\x1b\\x3a\\xa5\\x69\\xf7\\x64\\xf7\\x4a\\x6d\\x1d\\x65\\x5a\\x32\\x38\\x1c\\x28\\xf7\\xd4\\x6b\\x18\\x3b\\xcc\\x94\\x67\\x93\\x69\\xef\\x80\\xd6\\xf9\\x6e\\xa3\\xba\\x21\\xf0\\x1f\\x03\\x37\\x73\\x2c\\x0c\\x7b\\x9a\\x55\\x01\\xff\\x64\\xeb\\x75\\x6b\\x0f\\xf6\\xf5\\xe7\\x46\\x87\\x53\\x4f\\x0b\\x84\\x1b\\x36\\x43\\x30\\xbf\\xbd\\x12\\xed\\x85\\x60\\x1c\\xd0\\xc7\\x84\\x82\\x95\\xc2\\x78\\x4a\\xbb\\x87\\xcd\\xd9\\xe8\\x1e\\x62\\x28\\xd4\\x7f\\x3b\\x64\\xdd\\xf1\\x4d\\xe8\\xf2\\xd2\\x01\\xd2\\xd4\\x29\\x94\\x5d\\x5b\\x61\\x9a\\x3a\\x8c\\xbe\\xdf\\x33\\x74\\x20\\x09\\xec\\xf7\\xb5\\x81\\x43\\xc1\\x61\\xd1\\x61\\x81\\x4a\\x9e\\xde\\xb2\\xef\\x3f\\xcd\\x4c\\xed\\x0f\\xb5\\x1e\\xaf\\x43\\x0a\\xcf\\xfc\\x3a\\xe4\\x78\\x93\\xd4\\xf8\\x1f\\xe4\\xa9\\xff\\xa1\\x97\\x5f\\x43\\x8a\\xc9\\xf2\\x6b\\xc8\\x31\\x08\\xce\\xf8\\x5b\\x4c\\xf9\\x16\\x5f\\x0c\\x63\\xfa\\x43\\xe3\\x51\\x6a\\xed\\xce\\x59\\x87\\x25\\xac\\x03\\xff\\x15\\x68\\x30\\xd1\\x16\\x4a\\xec\\xe7\\xaa\\x40\\x08\\x17\\xb7\\xed\\x5d\\xa3\\x73\\xbf\\xac\\x73\\x9b\\x0c\\x20\\x1c\\x64\\x3d\\x19\\x26\\x2f\\x50\\x97\\xfb\\xab\\xa3\\x43\\xcb\\x7d\\x2d\\xac\\x87\\x5d\\x0a\\xfb\\x48\\xae\\xe3\\x0a\\xc2\\x24\\xec\\xa0\\x80\\x43\\xd7\\x5a\\xd4\\xec\\x6b\\x76\\x37\\xd4\\xa9\\xe6\\xbd\\xbc\\x13\\xdc\\x54\\x59\\x32\\x56\\xf7\\x58\\xca\\x4e\\xde\\x04\\xf3\\xa8\\xcc\\x0f\\x39\\xfa\\x50\\xa7\\xd1\\xb4\\x07\\xb5\\x0f\\x79\\x19\\x37\\x5a\\x45\\x4f\\xde\\x4a\\xf9\\x2c\\x55\\x51\\xb5\\x27\\x79\\xe5\\x70\\x4e\\x3a\\x8c\\xdb\\x1a\\x8a\\x18\\xe6\\x69\\x5f\\x1b\\x8a\\x98\\xce\\xba\\xcf\\x3a\\x6e\\xe2\\x76\\x02\\xfa\\x2b\\x9f\\x1f\\xf4\\x1f\\x0c\\xd8\\xe0\\x01\\xa6\\xc0\\x59\\xbd\\x3b\\x91\\xd2\\xde\\x1b\\x41\\x29\\x7e\\x57\\x8b\\x87\\x86\\x69\\x09\\x19\\xa4\\x15\\xcc\\x75\\xcf\\x0d\\xfb\\xb3\\x7f\\xed\\xed\\x1f\\x2d\\x31\\x06\\xde\\xa5\\x90\\xb1\\x8e\\x1b\\xe7\\x15\\x4e\\x96\\x1b\\x39\\x91\\x3d\\x42\\x2b\\xa2\\x14\\xad\\xc0\\x30\\x4e\\x3b\\xd9\\x10\\xa5\\x68\\x03\\x86\\x72\\x68\\xb2\\x20\\x4a\\x19\\xb4\\x8e\\x67\\x43\\xf0\\xda\\xf2\\x6b\\xf4\\xc3\\xde\\x51\\x22\\xfa\\xf9\\x87\\xfa\\x28\\x51\\xa9\\x0c\\xcf\\x92\\x79\\x58\\xbe\\xc3\\x7e\\x56\\xb9\\x7e\\x37\\xf6\\xe7\\x8f\\x87\\x4e\\x40\\x6d\\x19\\x8b\\x3c\\x4c\\xd9\\x18\\x01\\x00\\x88\\xc6\\x08\\xb2\\xc6\\x08\\x4a\\xb7\\xa8\\x47\\x90\\x56\\x60\\xe1\\x55\\x9d\\x97\\xac\\xaa\\x54\\x4e\\xb2\\xac\\x3a\\x71\\x68\\xac\\x0a\\x72\\x34\\xac\\xa4\\x0e\\x8c\\x97\\x40\\xc7\\xde\\x78\\x35\\xf4\\x40\\x8f\\xbf\\x4f\\x03\\x1f\\x3f\\xb7\\x25\\x8d\\x4a\\xcb\\x86\\x77\\x2f\\xfc\\x92\\xc2\\xba\\xa4\\x52\\x6e\\x16\\x64\\x21\\x31\\xc3\\x29\\xeb\\xb3\\x97\\x41\\xe3\\x66\\xa7\\x56\\x09\\x8a\\xbc\\xaa\\xfa\\xd5\\xf0\\x12\\x57\\xf9\\xb0\\x57\\x2a\\x5f\\xf3\\x8c\\xd7\\x87\\xd4\\x60\\x5b\\xb0\\x44\\x18\\xa7\\xb9\\x78\\x1d\\xa0\\x1f\\xa0\\xba\\x4d\\x06\\x4e\\x7e\\x7d\\xe6\\x8b\\xfb\\xcf\\xbc\\xa8\\xcf\\x7c\\xf9\\x09\\x67\\x3e\\xfa\\xf8\\x99\\x2f\\x99\\x01\\x4f\\x3e\\x72\\xe6\\x53\\x58\\x9b\\xfa\\xbc\\x5f\\x1e\\x3a\\xb8\\x49\\xb6\\x1f\\x2c\\x43\\xc9\\x89\\x03\\xbc\\x64\\xce\\x6e\\xdd\\xa4\\x55\\xf3\\x71\\x19\\x4e\\x6a\\xd3\\x4a\\xac\\x36\\x37\\xdb\\xb7\\x8d\\x68\\x80\\xda\\x03\\x16\\x6b\\xf7\\x95\\x6d\\x00\\xe9\\x33\\xd2\\x41\\x9e\\xab\\x49\\x00\\xb2\\xe7\\xb0\\x8d\\x47\\x64\\x55\\x9a\\xa3\\x08\\xc5\\x78\\x53\\x41\\xa4\\x58\\xaa\\x9a\\x19\\x95\\x16\\x12\\x90\\x3b\\x45\\x42\\x9e\\xf1\\x14\\x9b\\xdb\\xc2\\xcf\\x00\\x95\\x0c\\x02\\x58\\x06\\xb4\\x77\\x02\\xca\\x13\\x59\\x32\\x20\\x3e\\x23\\x34\\x65\\x0e\\x10\\xc1\\xe8\\x0e\\x42\\xf9\\xd6\\xa5\\x91\\xba\\x53\\x82\\x1d\\xb4\\xb8\\x47\\xdb\\x14\\xb4\\xdd\\xd0\\xd9\\x62\\x78\\xd2\\xcb\\x9a\\xb7\\x9c\\xd4\\x01\\x26\\x03\\xa3\\x96\\xb0\\x15\\xe2\\xcd\\x25\\x3f\\x63\\x1b\\xbe\\x05\\x52\\xee\\x12\\xa8\\xd1\\x0b\\xb6\\xe6\\xd7\\xf5\\x04\\x98\\x0c\\x16\\xc6\\x29\\x34\\x87\\x85\\x86\\x12\\x0b\\x26\\x29\\x66\\xea\\x7b\\xdd\\x20\\x40\\x06\\xb5\\xa3\\x17\\x6c\\xc5\\x94\\x45\\x45\\x9b\\xb0\\xd6\\xbb\\x5c\\x18\\xbb\\x3c\\xab\\x76\\x74\\x7a\\xe7\\x8e\\x6e\\xfb\\x0e\\xa8\\x76\\x95\\x19\\xc4\\xff\\x77\\xd7\\x2e\\x6f\\x7a\\x13\\x34\\x0a\\x65\\x35\\xda\\x39\\x6f\\x49\\xea\\x00\\x48\\x05\\x52\\xcf\\xc0\\x1a\\x43\\x91\\x8b\\xbf\\xe3\\x39\\x20\\x81\\x33\\xbe\\x00\\x24\\xb0\\xe5\\x3b\\x67\\xe7\\x9e\\x49\\xbd\\xcf\\x76\\xfc\\xd0\\x89\\x80\\x63\\xf4\\x3c\\x99\\xf1\\x92\\x07\\xee\\x12\\xd6\\x3b\\x74\\x37\\xb0\\xdc\\xb1\\x7b\\x05\\xc3\\xaf\\x21\\xee\\xa5\\x83\\xca\\x9e\\x0b\\xf7\\xda\\xb9\\x46\\xc6\\xa4\\xbe\\x3a\\xe4\\xba\\xc7\\xcf\\xd1\\x99\\x7c\\x19\\xa0\\xb4\\xf2\\x1a\\xa5\\xb0\\xa7\\xcf\\x83\\x9b\\x1b\\x94\\x8d\\x78\\x2b\\xa9\\xbf\\xce\\xdc\\x15\\x00\\x64\\xdf\\xa0\\xf9\\x2e\\xd8\\x25\\x7a\\x9e\\x27\\xd6\\x0b\\xf6\\x16\\x39\\x96\\x67\\xb8\\xd7\\x9e\\xc3\\x0f\\xec\\xb5\\xf7\\xfc\\x15\\xf4\\xf8\\x1d\\x7f\\x0e\\x3d\\x7e\\xc9\\xcf\\x9c\\xf7\\xde\\xce\\x79\\x37\\xb2\\x5e\\x3a\\x2f\\x7b\\x5b\\x54\\xdc\\x40\\xcd\\xd6\\xce\\x79\\x0f\\xe3\\x78\\x67\\xf7\\xb6\\x1e\\xd0\\x21\\xe3\\xee\\x09\\xf0\\xf2\\xe3\\xc0\\x59\\xba\\xa1\\xb3\\x71\\x63\\x07\\x35\\x1d\\x56\\x73\\x72\\x5e\\xb1\\xe7\\xec\\x05\\xbb\\x84\\xde\\xb2\\x0b\\xfc\\x73\\x4d\\x53\\xc4\\xd6\\x6a\\x33\\x43\\x32\\x5e\\x34\\xa1\\x72\\xd1\\xea\\xb7\\xa7\\xd3\\xbe\\x55\\xd4\\x0f\\xc0\\x3f\\xc3\\xb4\\xf9\\xa4\\x8f\\x62\\x4b\\x80\\x88\\x83\\xc7\\x46\\x90\\x99\\x4c\\x84\\x51\\x1e\\x99\\x37\\x18\\xdf\\x17\\x42\\x35\\xe0\\x28\\x68\\x74\\xa4\\x1c\\x64\\xf0\\x18\\x76\\xaa\\x6f\\x92\\xd7\\x8d\\xf0\\x26\\x45\\x66\\xb8\\x46\\x64\\x56\\xd3\\x42\\x43\\x9b\\x82\\x58\\xd3\\x02\\xef\\x00\\x10\\xf0\\x07\\x61\\xcf\\xa1\\x78\\x6a\\x1a\\x46\\x02\\x34\\xa2\\x4b\\x3f\\x0c\\x28\\x47\\x2d\\xa8\\xab\\x1b\\x33\\x11\\xac\\x4d\\x82\\x30\\xcb\\x4c\\x69\\x56\\x85\\x05\\xf6\\xcd\\x61\\xf0\\x1e\\x41\\xfc\\x66\\x29\\x4b\\x91\\xfb\\x8d\\x24\\x3e\\xa6\\xe8\\xbf\\xbd\\xf3\\xac\\x25\\xad\\xb3\\x76\\xd7\\xe1\\x4a\\x5a\\x26\\x36\\xc6\\x29\\x32\\x6f\\x5d\\x89\\x8c\\x29\\x35\\x02\\xcc\\xd8\\x0d\\xd8\\x7a\\x27\\xd2\\x00\\xc2\\x51\\xea\\xc1\\xd1\\x31\\x86\\x58\\x3d\\xdc\\x1b\\xd2\\x47\\x63\\xe5\\xc2\\x3e\\x94\\x3e\\x20\\xab\\x59\\x4b\\x5d\\x58\\x97\\xd6\\xb6\\x5c\\x52\\x9b\\x1e\\xa2\\x71\\xb8\\x25\\x4b\\xc1\\x23\\x10\\x03\\xc7\\xc7\\xb2\\xb6\\xd7\\xaa\\x7e\\x58\\xe0\\x16\\x11\\xcf\\x9f\\x09\\x2b\\xe5\\x71\\x66\\xad\\x11\\x94\\xd9\\xc0\\x37\\x28\\xeb\\xaa\\x08\\xd8\\xe4\\x79\\x1d\\xd2\\x8a\\x2f\\xa5\\x93\\x0a\\xca\\xea\\x36\\xd2\\x0f\\x64\\xc5\\x4a\\xab\\x45\\x18\\x68\\xb5\\x11\\x1c\\xa8\\xbc\\x7b\\x15\\xc4\\xd1\\x5c\\x6a\\x2b\\x65\\x48\\xdc\\x42\\xdf\\x15\\x53\\x83\\xa0\\xc6\\xa6\\x6c\\xc6\\x3d\\x96\\x82\\xd0\\x83\\xd3\\x81\\x7e\\x4b\\x83\\x47\\x28\\x82\\x7f\\x08\\xdc\\xf0\\x86\\x0f\\xe1\\xf9\\x8a\\x63\\xe4\\xc4\\x3e\\x80\\xfb\\x3e\\x00\\xb0\\x3e\\xc3\\x3b\\x56\\x2f\\xf9\\xcb\\x10\\x80\\xd4\\x0e\\xb5\\x32\\x28\\x10\\x38\\x37\\x23\\x52\\xc3\\xc1\\x53\\x1b\\xf6\\xc0\\x46\\x6f\\x8e\\x00\\x3d\\xa8\\xd0\\xd4\\x0f\\x15\\x4f\\xd6\\x05\\x1e\\x00\\x1b\\x3e\\xe9\\xe4\\x3e\\xcb\\x31\\xec\\x46\\x18\\x47\\x9b\\x67\\xc9\\x32\\xfe\\xc4\\x40\\xc8\\x97\\x55\\x58\\x65\\x0b\\x7a\\xc7\\x5e\\x86\\xb6\\xff\\xbd\\xb0\\xe0\\x19\\x28\\x4e\\xda\\x07\\x25\\x6a\\x10\\xaf\\x75\\xcd\\x2f\\xb6\\x85\\x30\\xa9\\xca\\xfb\\xaa\\x3e\\x27\\x21\\x50\\x32\\x41\\x01\\xb6\\xd2\\x22\\x26\\x52\\x8b\\x48\\xbb\\x40\\x7b\\x0d\\xe1\\x2e\\xf1\\x77\\xb2\\x9d\\x73\\x6c\\x87\\x42\\x18\\x7e\\x5a\\x13\\x74\\x51\\x0e\\x4a\\xfa\\xfc\\x15\\x85\\x5b\\xc2\\xbb\\xba\\xf0\\x62\\xbc\\x4f\\x2b\\xbd\\x84\\xd2\\xa4\\xb3\\xe4\\xae\\x74\\xd4\\xc2\\x8a\\xa6\\x00\\x3c\\x67\\x34\\x5c\\xc8\\xdb\\x08\\x87\\x7d\\x4f\\x4d\\x57\\x24\\x30\\xf9\\xf2\\xe4\\x31\\xc2\\x55\\x0c\\xfc\\x02\\xd5\\xe9\\x37\\x59\\xeb\\x15\\x6e\\xfe\\x39\\xed\\x7c\\xa8\\x3b\\x4b\\x8b\\x4f\\xee\\xe5\\xba\\x51\\xf7\\x59\\xa3\\xee\\x6d\\x65\\x13\\x3a\\x1e\\x4e\\xd0\\x73\\x49\\x25\\xf8\\x7d\\xd5\\xec\\x9a\\x6e\\x55\\xc1\\x3f\\x5b\\xd5\\x76\\x15\\xaf\\x18\\x08\\x41\\x0c\\xa8\\xae\\x60\\x7e\\xc7\\x66\\xfb\\x20\\x04\\x1d\\x19\\x0f\\xc6\\x0b\\x64\\xda\\xa5\\x80\\x47\\x95\\x1b\\x82\\xc0\\x26\\x0d\\x08\\x95\\x9a\\x10\\x8a\\x20\\xf0\\x9e\\x61\\x9e\\x34\\x8f\\xc1\\x81\\x08\\xdc\\x6b\\x26\\xbd\\x19\\x64\\x4d\\x87\\x31\\x66\\xfa\\x87\\x85\\xad\\xc4\\xf1\\xbb\\x60\\x92\\x78\\x2f\\xc9\\x86\\x60\\x9c\\x4c\\x12\\x17\\x1e\\x9b\\x25\\xe2\\xac\\x7d\\x0f\\xcd\\xa4\\xb8\\xb9\\x11\\x13\\x00\\x3b\\x0b\\x12\\x9a\\xad\\x24\\xbb\\x61\\xfb\\xf4\\xea\\x53\\xa2\\xfa\\xe6\\x87\\x06\\x57\\x92\\x67\\x77\\xc6\\xc2\\xd3\\xe7\\x19\\x79\\xde\\x69\\x81\\x7d\\x2a\\x74\\x9f\\x8a\\x49\\x81\\x7d\\x42\\x1b\\x44\\x63\\x86\\x16\\x06\\x56\\xa4\\x7a\\x6b\\x90\\xa0\\x66\\x17\\xbe\\x7a\\x18\\xb7\\xc3\\x90\\x9e\\x67\\x1f\\x95\\xae\\x29\\x9f\\xc2\\xc0\\xd4\\x5f\\xd6\\x9e\\x99\\xea\\x3a\\x25\\xb1\\xe7\\x9b\\x19\\x3b\\x99\\x1b\\x38\\xe5\\x01\\x61\\x57\\xe8\\x44\\x5e\\x0e\\xcc\\x66\\xe0\\x64\\x5e\\xec\\x94\\xe4\\x26\\x97\\x3b\\x11\\xd0\\x2d\\x69\\x53\\x12\\xa7\\x74\\xa5\\x65\\x43\\x2e\\x17\\x35\\x7a\\x95\\x9a\\xad\\x7e\\x92\\x00\\xee\\xbf\\x1b\\x53\\xe4\\x41\\x2f\\x0f\\x8f\\x09\\x68\\x2e\\x1a\\x93\\x9b\\x57\\x63\\xca\\x3c\\x98\\x81\\x96\\xe8\\x6e\\x99\\x1d\\xec\\x4d\\xd2\\xf0\\xfc\\x3a\\x70\\x81\\xb7\\x8a\\xdf\\xa6\\x23\\xb6\\xa6\\x4e\\x31\\x52\\xf1\\xcb\\xf1\\x3a\\x91\\x0d\\x9a\\x90\\x94\\x38\\x3b\\xf4\\x14\\xd9\\xcc\\x4a\\xc7\\xfd\\x49\\x34\\x2e\\xfd\\x72\\x1c\\x11\\x29\\x88\\xdc\\x3e\\x70\\xce\\x78\\x55\\x21\\x4f\\x5c\\x7c\\x46\\xcf\\x62\\xa0\\x1d\\xd1\\x25\\x4e\\xab\\xb2\\x00\\x7d\\xf1\\x72\\x84\\x45\\xf3\\x71\\xe4\\x47\\xe3\\x7c\\x94\\x7b\\x3c\\xac\\xf4\\x05\\x56\\x8c\\x26\\x02\\xc0\\x47\\x79\\x86\\xc3\\x69\\x6e\\x57\\xaf\\xd8\\xf7\\xdc\\x9e\\xd9\\x64\\xff\\x1d\\x13\\xe3\\x66\\xa8\\x46\\x1a\\x23\\x27\\xb3\\x8a\\x11\\xdd\\xf0\\x87\\xaa\\x0c\\x51\\x5f\\x3a\\x82\\x06\\x71\\xa6\\xdb\\x8d\\x85\\xaf\\x43\\x34\\x55\\xf5\\x32\\x3f\\xb3\\xdd\\xa1\\x6c\\xeb\\xf5\\x0f\\xde\\xf3\\xc0\\xfe\\xd2\\xaa\\x5e\\x8d\\xe3\\x7e\\xd5\\xb2\\xe5\\x40\\x30\\x85\\x81\\x28\\xf1\\x2b\\x94\\xc2\\xf8\\x91\\xda\\xa4\\xf6\\x3e\\xc2\\x30\\xa3\\xa0\\x29\\xf5\\xb1\\x6c\\xc2\\x0f\\x73\\x6c\\xf3\\xff\\xcb\\x0d\\x16\\x2c\\x69\\x36\\xb8\\x6e\\x5c\\x93\\xd7\\xcd\\xd3\\x32\\x0b\\x8d\\x5d\\xb6\\x6b\\x26\\x17\\x74\\xb1\\xab\\xe1\\x11\\x9b\\xb5\\x0c\\x2b\\x1b\\xc7\\x22\\x6a\\x6c\\xfb\\xd4\\x34\\xf1\\xd4\\x47\\x46\\xda\\x75\\xc2\\x81\\x29\\x1b\\x4e\\x83\\x31\\x2f\\x1b\\x4e\\x83\\xb9\\xe9\\xec\\x88\\x17\\x4a\\x9b\\xce\\x8e\\x02\\x09\\x1e\\xb5\\x7a\\xc4\\x47\\x19\\xf4\\x7e\\x01\\x9c\\x13\\x86\\xb8\\x71\\x52\\x07\\x9e\\xf1\\xda\\x1b\\x0a\\x96\\x3c\\xe8\\x55\\xa5\\x57\\x68\\x35\\xb3\\x6a\\xc4\\x2e\\x37\\x3d\\x7c\\xa5\\xa8\\x7f\\x65\\x3b\\x4b\\x26\\xea\\x4f\\x2b\\xa8\\x08\\xbe\\x64\\xe8\\x37\\xea\\x16\\x4e\\x8e\\x6e\\x33\\x4e\\x0c\\x4f\\x0b\\xf2\\x7f\\x8c\\xe0\\x29\\x38\\x70\\xba\\xd1\\x8e\\xb7\\xba\\x4f\\x4c\\x7e\\x4a\\x8d\\xcb\\xc5\\x32\\x38\\xf4\\x28\\xaa\\xb7\\x09\\x27\\xee\\x1b\\x1c\\x4d\\x13\\x2c\\x5c\\x50\\xaa\\x5e\\xfc\\x0d\\xde\\x49\\x42\\xf7\\x66\\xa1\\x0b\\x95\\xe1\\x55\\x9c\\x1d\\xf0\\xa4\\x35\\xec\\x47\\xc8\\x4b\\x54\\x7b\\x6c\\x9a\\x7e\\xa4\\x64\\x4b\\xa2\\xee\\xba\\x83\\xa9\\x33\\x3d\\xe7\\x03\\x7b\\xf4\\x67\\xe8\\xde\\xe1\\x43\\x1b\\xf0\\x86\\xa7\\xbc\\xed\\x04\\x2e\\x7c\\xcb\\x00\\xd2\\x09\\x98\\xfc\\x10\\xde\\xd1\\x89\\x38\\x72\\x33\\x7a\\x63\\x52\\x14\\x4a\\xd6\\xc9\\x86\\x1f\\xec\\x5f\\x87\\xfd\\x60\\x0b\\xd8\\x0e\\x88\\x8d\\x0d\\x97\\x56\\xd9\\x75\\x03\\xc0\\x03\\xa8\\xaa\\x4a\\x27\\xb7\\xf8\\x7c\\x40\\x6c\\x58\\xe5\\x30\\x92\\x2f\\x8d\\xd3\\x70\\xb9\\x8f\\xc6\\xcc\\x90\\x7d\\xc6\\xde\\x2e\\x4d\\xef\\x79\\x04\\x80\\xb0\\x7a\\x65\\xe5\\x46\\x1f\\x35\\x55\\x48\\x2c\\x72\\x1a\\xce\\xf3\\xf7\\xe0\\x97\\x66\\x63\\xd2\\xc1\\x5c\\xa9\\x71\\x50\\x9c\\x8a\\x87\\x25\\x6a\\xf8\\x34\\x37\\x56\\xef\\x90\\x4a\\xc8\\x81\\x49\\x06\\x8c\\xc8\\xea\\xf3\\x81\\x41\\xf2\\x9d\\xa8\\x97\\xb5\\x30\\xca\\xc5\\x1d\\x38\\x1c\\xa1\\xb8\\xf7\\x26\\x70\\x9f\\x07\\x63\\x79\\x31\\xb9\\x7c\\x01\\x6a\\x64\\x4c\\xe6\\xfe\\xf4\\x8d\\x9e\\xb4\\xc6\\x39\\x95\\xc7\\x0b\\xaf\\x0c\\x28\\x69\\xf8\\xf6\\x01\\x0d\\x5a\\xe4\\x24\\x2d\\x05\\x1a\\x7e\\x39\\x8c\\xb8\\x0f\\x80\\x38\\xca\\x80\\x86\\xe4\\x68\\xbd\\xeb\\xe2\\x35\\xa6\\xb7\\xb8\\x0c\\x78\\x2d\\xd0\\xc4\\x00\\x1d\\x92\\xf9\\xc7\\xdb\\x0e\\xb2\\x9e\\x69\\x3a\\xde\\xab\\xbe\\x63\\x0f\\x7b\\x18\\xa2\\x19\\xe7\\x32\\x73\\x8c\\x9e\\x23\\x95\\x60\\xf7\\x2a\\x63\\x89\\x68\\x72\\xc0\\xa5\\xb5\\xa9\\x92\\x83\\x0d\\xf9\\x23\\xde\\x72\\xb8\\xbf\\x78\\x77\\x29\\xeb\\x22\\xa6\\x21\\x17\\x8e\\xa5\\x6a\\x3c\\xed\\x65\\x6c\\xd0\\x8b\\x6c\\x1b\\xe6\\x1a\\x57\\x09\\x78\\x10\\x83\\xda\\xbb\\xbe\\x97\\xda\\x8a\\x6a\\xd5\\xa0\\x31\\xdd\\x25\\x4e\\x77\\x64\\x4e\\x77\\x79\\xe7\\x74\\xef\\xcf\\x22\\x80\\xd1\\xc6\\xec\\x59\\x85\\x47\\x34\\x54\\xd6\\x2b\\xdd\\xc4\\xb0\\xf2\\x27\\x37\\x87\\x49\\x90\\xf9\\xf7\\x4f\\x55\\x74\\x9f\\xf6\\x32\\xf2\\x7e\\xc4\\xfb\\x23\\xf7\\xe7\\x90\\x26\\xc2\\x08\\x16\\xd0\\xa6\\xc5\\xab\\x25\\x6d\\xee\\x8d\\x02\\xaf\\xb8\\x35\\x88\\xee\\xb7\\x99\\xe9\\x8b\\x42\\x12\\x0b\\xf2\\x81\\x23\\x06\\x0f\\x21\\x79\\xcd\\xb0\\xc1\\x08\\x85\\xc1\\x60\\xd6\\x84\\x61\\x8b\\x19\\xd4\\x9a\\xae\\x4c\\xf1\\x25\\xc2\\x60\\x4a\\x46\\x15\\xcf\\x4e\\xa6\\x46\\x13\\xb3\\x42\\x52\\xc7\\xdb\\xbe\\xf0\\x13\\x8a\\x59\\xb9\\xcf\\x27\\xea\\x8a\\xcb\\xff\\xaa\\xe2\\x3b\\x58\\x64\\xa9\\x83\\x88\\x0e\\x55\\x4d\\xf1\\x78\\x39\\x17\\xda\\x9d\\x54\\xf9\\x4a\\x28\\x37\\x9b\\x77\\x40\\x9e\\x5a\\x84\\xb5\\xf1\\xce\\x6e\\x6b\\x3a\\x0d\\x91\\xfc\\x0a\\x58\\x88\\x76\\x52\\xc1\\x8c\\xd1\\xbb\\x2b\\xdf\\xdd\\x60\\x36\\xd3\\x1e\\x7b\\x05\\x5d\\xa8\\x47\\x5d\\xab\\x34\\x81\\xcd\\xfe\\xc9\\x7e\\x1b\\xe1\\x07\\x9a\\x6b\\x7c\\xdf\\x0a\\xa3\\x61\\xa3\\xe1\\xcd\\xde\\x20\\x5c\\xd0\\x60\\xab\\x4a\\x7a\\xd5\\x4c\\x1a\\x18\\x49\\xcf\\xb3\\x3b\\xa3\\x09\\x4d\\xfb\\x8c\\x82\\xa6\\x0c\\x61\\x87\\x0c\\x47\\xc5\\xb8\\x1c\\x95\\xae\\x2b\\xf3\\x8e\\xc8\\x13\\xf1\\x67\\x8c\\x65\\x33\\xcd\\xbc\\xe1\\x0c\\x05\\x08\\xf8\\x34\\xa0\\xa7\\x72\\x86\\x8e\\xe5\\x23\\xdb\\xf3\\x32\\x20\\x53\\x33\\xd7\\x9d\\xf1\\xb2\\xc6\\x00\\x32\\xe0\\x51\\xbf\\x11\\x29\\xf6\\x7d\\xb6\\x17\\x52\\x85\\xac\\xd1\\x6e\\x6e\\x2a\\x43\\x34\\xc3\\x23\\xb7\\xc5\\x42\\xca\\xcb\\xae\\xc9\\x75\\xc4\\x31\\x23\\x80\\xc8\\xcb\\xb1\\x0b\\x79\\x21\\x76\\xed\\x5e\\x62\\x38\\xe1\\xee\\xd1\\x72\\x24\\x85\\x88\\xc8\\xd9\\x13\\xaf\\x3f\\xc3\\x32\\xa5\\xba\\x32\\x85\\xee\\x23\\x24\\xe9\\x44\\x4c\\x37\\x91\\x00\\x85\\x46\\x46\\x74\\x14\\xbd\\x01\\x1f\\x62\\xa0\\xc9\\xac\\xc0\\xb1\\x42\\x2f\\xb6\\xbd\\x85\\xba\\x5f\\xaf\\x67\\x2d\\x9c\\x14\\x78\\x99\\x6a\\xef\\x4e\\x4b\\x77\\x05\\xdc\\x0e\\x1a\\x22\\xe6\\xc6\\x98\\x7e\\xc9\\x0e\\x84\\xac\\xa9\\xdd\\x4c\\xb5\\xef\\xdd\\x91\\xbc\\xfc\\x5b\\xd0\\xd4\\x50\\xf3\\x2d\\x1d\\xcf\\x1b\\x24\\x82\\x8a\\x92\\xc4\\x04\\xb6\\x72\\x4a\\x9e\\x2f\\x85\\x74\\x42\\xce\\xa3\\x42\\x3d\\x85\\x51\\x16\\xc6\\xa2\\xe5\\x93\\xfc\\x8d\\xd1\\x07\\x11\\x4b\\xff\\x39\\x58\\x00\\x0c\\x88\\x98\\x19\\x32\\x32\\xac\\x24\\x31\\x39\\xe1\\xd7\\x54\\xee\\x0f\\x82\\x2a\\x3f\\x87\\xfa\\xf6\\x77\\x8c\\xa0\\x12\\x2b\\xa7\\x40\\xe8\\x49\\xd9\\x50\\x85\\xfd\\x6a\\x0e\\x57\\xf5\\x06\\x43\\x70\\xa1\\xc9\\x13\\x06\\xc5\\xde\\xc1\\x96\\xfb\\xb0\\xf5\\x05\\xdb\\xf9\\x19\\x21\\xb9\\xee\\x6b\\x54\\x3e\\x75\\x5f\\xe1\\xa5\\x02\\xc9\\x6c\\x44\\x4d\\x56\\xac\\x57\\xc8\\xa3\\x51\\xa8\\x6a\\xa1\\x30\\x30\\xc2\\xd3\\xaf\\xdd\\x6d\\x15\\x1b\\x26\\xab\\x3f\\x86\\x3b\\xfc\\x3a\\xb2\\x23\\x1e\\x42\\xc5\\x41\\xb7\\x4c\\xa4\\x77\\x20\\x50\\x69\\x50\\x33\\xde\\x46\\x05\\x35\\x36\\x3e\\xff\\x81\\x9f\\x6b\\x5e\\x8f\\xa7\\xa3\\xb8\\xd9\\x60\\x7c\\xa8\\xc1\\xb8\\xdd\\x60\\xca\\x63\\x1c\\x43\\x15\\xbb\\x00\\x5a\\x8b\\x91\\xf6\\x4f\\x47\\xf5\\xb7\\x3f\\xf0\\xdb\\x48\\x45\\x0e\\xa8\\x4c\\x22\\xa9\\xed\\x9c\\x0f\\x46\\x0b\\xe0\\x2c\\x5d\\x37\\xb7\\xd1\\x44\\x32\\x27\\xa3\\xc9\\x69\\x0e\\x1b\\x84\\xfd\\x08\\xc5\\x68\\xad\\xf1\\x2a\\x2d\\x58\\x23\\x16\\xcb\\x1f\\x20\\x91\\x42\\x69\\x63\\x8f\\x25\\x16\\x98\\x55\\xe6\\xe3\\xff\\x82\\x31\\x35\\xb2\\x92\\x4c\\x14\\x08\\xac\\xdf\\x68\\x0e\\x7e\\xc3\\x7e\\x18\\x1e\\x65\\x4d\\x40\\xa1\\x83\\x80\\xa0\\xc3\\x24\\x2d\\xcd\\x0e\\x96\\x06\\x56\\xff\\x62\\x14\\x50\\x38\\x83\\x8c\\x7f\\x9b\\x59\\x01\\x4b\\x6d\\x38\\x37\\x19\\x7a\\x74\\x05\\x30\\x94\\x97\\x23\\x1d\\x4c\\xa0\\x04\\x84\\xf8\\xbd\\xcc\\xc0\\x8e\\xac\\x12\\x33\\xc0\\x71\\x1e\\x7b\\xa8\\xf0\\x29\\x20\\xe7\\x6b\\x8c\\x20\\x62\\x03\\x07\\xae\\xbf\\xe0\\x7b\\xf7\\x15\\xde\\xe6\\x09\\x0f\\xf2\\x86\\x1a\\xf2\\xd8\\x09\\xba\\x6f\\x90\\x5a\\xd6\\x9f\\xb0\\x95\\x37\\x2a\\xb8\\x04\\xed\\x67\\x84\\xeb\\xd0\\xad\\x28\\xc9\\x51\\x2e\\x5e\\xe0\\x55\\x63\\x28\\x52\\x52\\x50\\x1e\\xe1\\xbd\\xda\\xd9\\x7f\\x64\\xf2\\x12\\xcf\\x6f\\x30\\x78\\x17\\x4e\\x07\\x6d\\x66\\x55\\x2e\\x44\\xd5\\x78\\x28\\xa7\\x4d\\x54\\xb3\\x27\\xf3\\xa9\\xf9\\xa6\\x09\\x83\\x1a\\x28\\xd2\\x05\\x3c\\x0a\\xe9\\x4f\\x50\\xd5\\x4f\\x77\\x02\\x87\\x77\\x94\\xb5\\x47\\xb2\\xf9\\x3f\\x32\\xcd\\xcc\\xc7\\x5c\\xe5\\x40\\x4f\\x31\\x34\\x33\\x8f\\xc9\\xcc\\x1c\\x66\\xdb\\xcb\\x29\\xdc\\xf5\\xce\\x5b\\x00\\x1b\\x27\\x64\\xa6\\x2b\\xbe\\xa1\\x84\\x39\\xfc\\x62\\xc2\\x1a\\xb8\\x43\\x6b\\xe5\\xcc\\xbd\\xa5\\x73\\x85\\x5e\\x0f\\x2b\\x67\\xe5\\x2e\\x81\\x7d\\x3b\\xe3\\x57\\xce\\x95\\x3b\\x77\\xe6\\x6c\\x8b\\xe7\\xcb\\x9a\\x3b\\x3b\\xc8\\x72\\x66\\xf7\\xd6\\x6e\\x0e\\x67\\x0d\\x8a\\x9c\\x79\\x57\\xce\\x0e\\xdf\\x17\\xb7\\x23\\xd8\\x52\\x72\\xb0\\x2c\\x66\\x1b\\x54\\x06\\xd4\\xdd\\x8f\\x75\\xac\\x0d\\xf8\\x5a\\x4f\\x48\\x02\\xd9\\xf4\\x57\\x39\\x1b\\x34\\x11\\x06\\xbb\\xf1\\x6d\\x43\\x92\\x91\\xc8\\xde\\x23\\x29\\xb2\\x25\\x32\\x04\\x2f\\xb4\\x2a\\x81\\x52\\xc2\\x99\\xd3\\x36\\xdd\\x0f\\x32\\x15\\x0f\\x08\\x80\\x00\\x25\\xa4\\x55\\x48\\xfb\\x5e\\x7f\\x04\\x44\\x28\\x55\\x32\\x92\\x78\\x1a\\x2b\\x0a\\xa9\\xa2\\x98\\x87\\xaa\\x22\\x1d\\x93\\xff\\x81\\x8c\\x40\\x93\\xf3\\xc0\\xcb\\x60\\x42\\x81\\xd8\\x84\\x1a\\x10\\x6a\\xe7\\xbd\\x4a\\x07\\xb0\\x98\\x58\\xde\\xca\\xad\\x09\\x31\\x98\\x38\\x6f\\xe8\\x00\\x34\\xcf\\x9d\\xbc\\x67\\xc1\\x23\\xc0\\xf6\\xd0\\x8d\\x7b\\x43\\x17\\xc0\\x3b\\xe2\\x60\\xbb\\xb7\\x70\\x81\\xf6\\xcb\\xdc\\xa0\\xe1\\x7f\\xf9\\x7d\\x6b\\x9c\\xaf\\xb0\\x27\\xd5\\x5e\\xf8\\x36\\xa3\\x8b\\xb6\\xb5\\xd4\\x46\\x0e\\xa0\\x12\\x64\\xec\\x88\\x16\\xcd\\xba\\x5b\\xbc\\xe6\\xc6\\x70\\x56\\x30\\x14\\x6b\\x0a\\x06\\x6b\\xf0\\x9e\\x37\\xe2\\x23\\xfc\\x70\\xf8\\xa4\\x36\\xd5\\x2c\\x4a\\x0f\\xb0\\xe2\\x5a\\x03\\xb0\\xe4\\x5a\\x27\\xb0\\xe1\\x4a\\x1b\\x00\\xdb\\xea\\xc7\\x10\\xf6\\x54\\x65\\x78\\x39\\xf7\\x3c\\x3a\\xdc\\x11\\xbf\\x9a\\xce\\x01\\x51\\x52\\xdc\\x89\\x4c\\x6c\\x02\\x54\\xd4\\x91\\x51\\x77\\x00\\xc4\\x15\\xf5\\xc8\\xb4\\xe6\\x46\\x37\\x49\\x34\\xe5\\xb6\\x73\\xb2\\xe3\\xee\\x0a\\x52\\x50\\x67\\x3c\\xa7\\x55\\xcf\\x69\\xb1\\x82\\xa9\\xeb\\xa6\\x5f\\x86\\x33\\xbc\\x0c\\x55\\xf9\\x3d\\xe3\\xbe\\x17\\xb4\\xef\\x2d\\x82\\xa6\\x05\\xba\\x7b\\x90\\x06\\xb7\\xf4\\x04\\x79\\x89\\x92\\xb5\\x27\\xde\\x02\\x1d\\xa2\\x0f\\x50\\x9f\\xee\\xec\\xfd\\x39\\xb3\\xbe\\xcb\\xac\\x48\\x1d\\x1e\\x46\\x25\\x17\\x12\\x26\\x6f\\x3c\\x04\\x34\\x13\\xd8\\xf8\\x0b\\xd8\\xec\\x18\\xd4\\x51\\xa6\\x4c\\x84\\xbf\\xb9\\xf5\\xa9\\xde\\x8d\\xcc\\xb9\\xf2\\x32\\x95\\x93\\x80\\x3b\\x7d\\x9d\\xa0\\xe5\\xeb\\x4e\\xe5\\x54\\xda\\xe9\\xe3\\xe3\\xd2\\x5b\\xaa\\x9c\\x2b\\x5d\\xe7\\x4a\\xd5\\xb9\\x54\\x75\\x2e\\x65\\x4e\\xe8\\x86\\x59\\xe7\\x52\\xd5\\x49\\x5d\\xb9\\x95\\xd7\\x0a\\xb2\\xa8\\x06\\xc4\\x40\\xde\\xb9\\xae\\x79\\xf3\\xf0\\x9f\\x4d\\x1a\\xa9\\xe8\\x06\\xa8\\x5c\\xf2\\x12\\xf9\\x6b\\x98\\x7d\\xee\\x93\\x00\\x5b\\x89\\xf5\\x77\\xf2\\x27\\xc8\\xc2\\x3d\\x7a\\x60\\xd7\\xa2\\x05\\x7e\\x6b\\x20\\xe8\\xd7\\xac\\xda\\xc3\\xa8\\x5f\\xa8\\x44\\x75\\x0a\\xc3\\xe8\\x73\\x1c\\x29\\x70\\x44\\xf1\\x30\\x8e\\x38\\xaf\\xaf\\x03\\x82\\x95\\x44\\x07\\x9a\\x1d\\xec\\x0a\\xd8\\xd7\\x5e\\x0a\\x0b\\x0e\\xfb\\xdc\\xa3\\x18\\x58\\xf4\\xbe\\x80\\x5f\\x7c\\x47\\xb1\\x96\\x15\\x3a\\x0b\\x2f\\x76\\x72\\xe5\\x90\\xb5\\x1a\\x73\\xef\\x7d\\xa0\\x5c\\x92\\x96\\x3c\\x74\\xe0\\xfc\\x39\\x31\\xba\\xda\\xc8\\xd8\\x58\\xb0\\x4b\\x81\\xc8\\x5a\\x42\\x89\\x0d\\xea\\x3b\\xe7\\x1c\\xca\\x6f\\xbc\\xdc\\xa1\\xd0\\x58\\x0b\\x3e\\x07\\xaa\\x7c\\xcd\\xb3\\x06\\x3d\\xf3\\x57\\x36\\x5a\\xd3\\x34\\x24\\x6c\\x2d\\x67\\xa1\\x84\\x87\\x2d\\xbf\\x72\\x53\\xf8\\xdd\\xf1\\x85\\x01\\x01\\x14\\xc0\\x44\\x65\\x3f\\xcc\\xd2\\x82\\x69\\x72\\x85\\xaf\\x2b\\x72\\x40\\x4e\\x1e\\x1a\\x95\\xc7\\x80\\xff\\xce\\xe8\\x88\\x40\\x35\\xa7\\x67\\xdd\\xdd\\xcd\\xcd\\x9a\\xce\\x33\\x3c\\xa2\\x25\\xfa\\xf6\\x14\\x9e\\xb6\\x32\\x14\\xd3\\x59\\xf7\\xa5\\xfd\\x61\\x07\\xef\\xaf\\x15\\xee\\x3a\\x83\\xe7\\x97\\x55\\xb8\\x1d\\x48\\x7f\\x43\\xe9\\x46\\xea\\x9b\\x5b\\x68\\x41\\xa1\\xa4\\x1d\\x1a\\x20\\x40\\xfd\\x56\\x12\\xf3\\xb5\\xdd\\x70\\x54\\xf9\\xe3\\x00\\x75\\x35\\x22\\x41\\x46\\xf7\\xb5\\x2c\\x50\\x00\\x2a\\x65\\x50\\x97\\xa2\\xd5\\x30\\xf0\\xa1\\xa2\\xd5\\x0a\\xa2\\xd5\\xf0\\xfa\\x4f\\x93\\x48\\x34\\x0d\\x4e\\xdb\\xd0\\x85\\x7f\\x17\\xc2\\x59\\xfe\\xe9\\xe3\\xba\\x45\\x82\\xf0\\x0a\\x92\\x94\\x08\\x49\\x00\\x97\\xa3\\xdf\\x87\\x75\\xf4\\x35\\xea\\x77\\xf0\\x2a\\xdf\\x23\\x44\\x1a\\x74\\xc4\\x0b\\xb4\\x8a\\xf7\\x0a\\xb4\\x82\\xaf\\x08\\x2a\\xfc\\xb6\\xa3\\x6f\\x44\\x4e\\xd9\\x34\\x22\\xbc\\x31\\xf2\\x52\\xc5\\x86\\xd0\\xb0\\xa0\\x64\\x03\\x33\\x4a\\xdf\\xd7\\x2d\\x60\\x7c\\x69\\x02\\xe3\\x23\\x15\\x92\\x55\\x11\\x33\\x81\\xa2\\xfb\\xc9\\x05\\x83\\x28\\xfc\\x29\\x5d\\x97\\x58\\xa8\\x41\\xc5\\xf2\\x1b\\xd1\\xff\\x40\\x9f\\x23\\x28\\xed\\x66\\x88\\x43\\x30\\xa6\\x11\\xc1\\xb2\\x0d\\x5f\\x74\\xd1\\xda\\x68\\x01\\xcf\\xb0\\x19\\x57\\xee\\x06\\xed\\x09\\xd7\\xdc\\x5a\\xba\\x57\\x78\\x97\\x39\\x3a\\x2e\\x71\\xbc\\xe3\\x8e\\x0c\\x47\\xc7\\xf3\\x9b\\x9b\\xf9\\x18\\x68\\x1d\\xed\\xe6\\x84\\xee\\x4c\\xca\\x79\\x4b\\xfe\\xed\\xee\\xea\\x6b\\x65\\x94\\xeb\\x13\\xe2\\xee\\x39\\xc0\\x8d\\xf0\\x16\\xf0\\x9f\\x7a\\x8e\\x6f\\xab\\xad\\x53\\x15\\x3c\\x0d\\x0f\\x97\\x8b\\x8d\\x72\\xe1\\xed\\x6d\\xe5\\x50\\x95\\x41\\x77\\x01\\xd8\\xf5\\xac\\x2b\\x00\\x4f\\xb0\\x5c\\x6b\\x2f\\x03\\x52\\xc1\\x1b\\x8c\\xb3\\x9b\\x1b\\xe0\\xf8\\xec\\x4f\\xee\\x1c\\x30\\x41\\xa5\\xdd\\xcb\\x8c\\x2e\\x5a\\xb1\\xfe\\xf2\\xa9\\x1d\\x35\\x4b\\xa8\\x3a\\x8c\\x5a\\x0d\\x27\\xb0\\x65\\xa3\\x43\\xdb\\x7a\\x32\\x8d\\xca\\x52\\xe4\\x24\\x30\\x80\\x9e\\xaa\\x2a\\xa0\\xf7\\x00\\xde\\xf7\\x3a\\xb3\\x3d\\x4d\\xf7\\xcb\\xd7\\xf9\\x65\\xf9\\xba\\xbe\\x3a\\x20\\x5c\\x40\\xb7\\x81\\x5d\\x72\\x74\\x21\\x36\\x4c\\x70\\xd5\\xe6\\x23\\x38\\x1b\\x6b\\xac\\x9d\\xe9\\xd8\\x51\\x81\\x04\\xc0\\x97\\x2d\\xf8\\xfb\\xaf\\x7d\\xd6\\x14\\xe0\\x96\\xaa\\x4b\\x93\\x0a\\xdf\\x85\\xf2\\xcc\\x96\\xe4\\xf8\\x00\\xd4\\x5a\\xc9\\x24\\x63\\xcc\\x32\\xf5\\x5a\\xd0\\x6d\\xe4\\xec\\x47\\x8c\\x9a\\x1b\\xcd\\x24\\x66\\xae\\x2f\\x53\\xfb\\x59\\x95\\xb0\\x29\\x47\\x71\\x57\\x8e\\x82\\x1c\\x6f\\x0c\\xc7\\x82\\xef\\x5a\\x2a\\x9b\\xaa\\x6b\\x0d\\x39\\x47\\x86\\x63\\x43\\x0f\\x16\\x98\\x10\\xdd\\x53\\xe8\\x8b\\x21\\xd4\\xfb\\xd1\\x18\\x24\\x4c\\x1f\\x3a\\x30\\x5f\\xe2\\x0d\\x87\\xd2\\x03\\x0d\\x0a\\x66\\x3e\\xce\\x6a\\x86\\x7e\\xd3\\x01\\x5d\\xbf\\x16\\x63\\x38\\x51\\x98\\x3c\\x53\\x28\\xf6\\x73\\xbb\\x37\\xdd\\x80\\x50\\xd2\\xe5\\xa8\\x66\\x7f\\xd5\\xac\\x4b\\x84\\xa7\\x26\\x9e\\x4c\\x33\\xc4\\xc4\\x90\\xc6\\x09\\x82\\x2e\\x3b\\x80\\x23\\x08\\x79\\xb6\\xb6\\x2f\\xfb\\x52\\x98\\x79\\x00\\x95\\x79\\x19\\x79\\xe6\\xec\\x3c\\x40\\x68\\xb6\\x69\\x97\\x86\\xa8\\x0d\\x51\\x1d\\x7c\\x87\\x3c\\x3b\\xa3\\x8f\\x49\\x69\\x5c\\x0e\\xd8\\x58\\x68\\x62\\x8c\\x3f\\x60\\xdc\\xfc\\xa4\\xfb\\x9c\\x63\\x30\\xeb\\xa4\\xfb\\x06\\x51\\x2e\\x22\\xdc\\x56\\x5e\\x51\\x9a\\x70\\xac\\x20\\x56\\xf9\\x0d\\x41\\xd5\\x5f\\x47\\xe5\\xa4\\x84\\xb2\\x38\\x71\\xf8\\x9b\\xf9\\x25\\xd4\\x82\\xd3\\x77\\x81\\x57\\x50\\x43\\xed\\x25\\x8c\\xea\\x57\\x34\\xab\\xc6\\xef\\xdd\\x97\\xf8\\x4b\\x01\\x0b\\xdf\\xc0\\x57\\xdc\\x30\\x50\\xc8\\xa0\\x21\\xb2\\x03\\x2d\\xbd\\xfc\\xec\\x96\\x20\\x15\\xfa\\x07\\xbf\\xd4\\xd2\\x4b\\xdd\\xd2\\x1b\\xb3\\xa5\\xb2\\xd4\\xe8\\x64\\x04\\x83\\x1f\\xd9\\x18\\x81\\xe7\\x65\\x25\\xe7\\x33\\xac\\xa6\\xcc\\x1e\\x55\\xac\\x27\\x05\\xec\\x4b\\x4b\\x5b\\x22\\x77\\x42\\xc8\\xdf\\x85\\x68\\x69\\xff\\xa3\\x8c\\x0a\\x28\\x6f\\x7f\\xa8\\x42\\xc3\\x01\\x47\\x47\\x9f\\x13\\xd8\\xd4\\xb1\\x7a\\x1a\\x11\\xba\\x86\\x0d\\x13\\x23\\x3d\\x6b\\x1d\\x95\\x37\\x37\\x08\\x90\\x4a\\xc4\\xdd\\x11\\xe1\\xee\\x12\\x71\\x37\\xc2\\x05\\x58\\x5b\\xdb\\x46\\x08\\x01\\xb4\\x8d\\xa0\\x54\\xf4\\xaa\\x44\\x34\\x04\\xc7\\x27\\x82\\xe3\\x43\\x55\\x02\\x9d\\x1e\\xd9\\xec\\x1f\\xfa\\x2b\\x90\\xbc\\x41\\x7f\\x20\\xf4\\xe2\\xc2\\x0e\\xcb\\x7e\\x56\\x38\\xbe\\x54\\xd1\\x26\\x7e\\xcd\\xd0\\x43\\x35\\x03\\x72\\x0f\\xd1\\xf4\\x17\\xc4\\x3a\\xfd\\x80\\x7f\\x6d\\xc5\\xfb\\x7c\\x08\\x45\\x1c\\xe7\\x3e\\x90\\xe3\\x74\\x42\\xfd\\xef\\xc2\\x4a\\x1f\\x06\\x63\\x82\\xc1\\xc0\\xb0\\x71\\xcc\\x88\\x06\\x8d\\x68\\x14\\x69\\xd9\\xa2\\x19\\x77\\x40\\x2f\\xc2\\xc0\\x60\\x77\\xc3\\xc3\\xd6\\xb0\\xf2\\x28\\x5b\\x32\\x35\\x64\\x34\\x51\\x98\\xe1\\x58\\xaa\\x90\\xed\\xd1\\xb7\\x82\\xbe\\x09\\xf5\\xcd\\xb0\\x04\\x29\\x1b\\x6a\\x53\\xa3\\xea\\xb8\\x99\\xb2\\x33\\x4c\\x38\\x6a\\x13\\xb1\\x0f\\xb1\\x08\\x16\\xfe\\x11\\x90\\xf0\\xe9\\x1c\\x86\\x87\\x11\\xc2\\xa4\\x57\\x08\\x71\\x93\\xf2\\x67\\x27\\xef\\xd0\\x33\\xcc\\x36\\xca\\x3a\\x0a\\x26\\x93\\xe0\\xfb\\x28\\xb1\\xea\\x0f\\x9a\\xfc\\xec\\x3e\\x42\\xc7\\x04\\xd2\\xf4\\xe1\\x63\\xe6\\xe2\\xfd\\x8a\\x78\\xd1\\x34\\xb6\\x35\\x0a\\xc9\\xf3\\x9d\\xea\\x0a\\x49\\xf2\\x06\\xa5\\x29\\xb4\\x40\\x48\\x9e\\xf2\\x2a\\x01\\x10\\x7e\\x4a\\xd5\\x52\\xc2\\xb0\\x4e\\x18\\x62\\x09\\xa0\\x1a\\xd0\\x72\\x20\\x9c\\x9e\\xd4\\x09\\x27\\x33\\xe2\\xb8\\x28\\x56\\xa9\\x61\\x36\\xd2\\xe8\\x73\\x15\\xc7\\x09\\xfa\\x33\\xa8\\xc2\\x42\\x3d\\x68\\x58\\x33\\x2b\\x4b\\x52\\x15\\xbf\\x33\\x47\\x23\\xd6\\xc5\\x38\\x45\\x84\\xbc\\xba\\xb9\\x29\\x01\\xfb\\xc9\\xe0\\x8f\\x5c\\x99\\xf1\\xc8\\x0a\\x37\\xe8\\x53\\x87\\x4b\\x0c\\x24\\x08\\xf2\\x08\\x3b\\x0c\\x82\\x20\\x29\\x59\\x24\\x31\\xc2\\x71\\x65\\xe0\\x5b\\x53\\xba\\x21\\xd0\\x91\\x23\\x38\\xe9\\x1e\\x4a\\xdf\\x84\\x87\\xbc\\x78\\xe1\\xee\\x50\\xbd\\xeb\\xa2\\x70\\x67\\x03\\xa3\\x50\\x54\\xdf\\x19\\x34\\x46\\x93\\xc7\\xb6\\x34\\xa3\\xb9\\xbb\\xc2\\x18\\x08\\xf8\\xb8\\x70\\x97\\x78\\x7b\\x54\\x31\\xe6\\x5b\\x74\\x3a\\x1c\\x73\\x8a\\x19\\x73\\x7a\\x3a\\xb8\\xb9\\x60\\x6f\\xf9\\xb9\\xfb\\x70\\xf4\\x76\\x7c\\x3e\\x72\\xdd\\x73\\x3c\\x75\\x09\\x3f\\x9b\\x9e\\x1c\\x9f\\xcf\\x6c\\x75\\xe3\\x32\\x3c\\xcb\\x5b\\x93\\x1f\\xf4\\x7d\\x3d\\xf4\\x2d\\xbb\\xb4\\x8d\\x1b\\x89\\x1f\\x0c\\x28\\x65\\x4b\\x93\\xd2\\x4c\\x19\\xaa\\x32\\x97\\x90\\xba\\x6c\\xa4\\x9c\\xa8\\x32\\x97\\x34\\x91\\x40\\xf0\\xa0\\x9b\\x8b\\x9a\\x7f\\x66\\xd8\\xf3\\x2f\\x4b\\xed\\x83\\x8a\\x56\\x08\\xcb\\x4b\\x92\\x5c\\xea\\xe7\\x42\\xeb\\xfa\\x90\\xe0\\xa3\\x1b\\xb9\\x25\\x9a\\xc1\\x69\\xea\\x4a\\x2f\\x99\\xa2\\xbb\\xf4\\x32\\x46\\x14\\xa9\\x57\\xde\\x6d\\xac\\xd0\\xf9\\x3f\\x1d\\x77\\x5b\\x48\\x89\\x3e\\xdd\\x07\\x6a\\xa1\\x43\\x0a\\x5e\\x36\\xdb\\xfc\\x9a\\xb9\\xe9\\x81\\xaf\\xa5\\x1b\\x38\\x4d\\x93\\xdb\\x4d\\x13\\x36\\xf2\\x0f\\x78\\xcf\\xe4\\x87\\x5b\\x79\\x7f\\x3b\\xde\\x27\\x98\\xd8\\xf4\\x53\\x4c\\xb2\\xa9\\x98\\xf1\\x75\\xa9\\x62\\xd0\\xe3\\x2d\\x9a\\x7e\\x89\\x9f\\x28\\xee\\x7f\\x95\\xbd\\x90\\xd9\\x13\\xe0\\x15\\x28\\x95\\x32\\x1e\\x1a\\x4e\\x55\\x22\\xb3\\x29\\x23\\x56\\x6f\\x58\\xe0\\x98\\x61\\x34\\xaf\\xca\\x96\\x39\\xa7\\x8b\\x4e\\x73\\xae\\xe9\\x04\\x61\\x5c\\x95\\x6e\\x0d\\x80\\xc3\\x77\\x0b\\xc7\\x8c\\xd6\\x3b\\x3f\\x80\\x01\\xa2\\xd8\\xb8\\x5b\\x21\\x35\\x5f\\xfa\\x14\\x99\\x91\\xee\\xa0\\x65\\x88\\x11\\x68\\x74\\x89\\x8b\\x17\\x7d\\x17\\xf8\\x77\\x84\\x91\\xc2\\x62\\x7d\\xbb\\x38\\xc2\\xf0\\x0c\\x2b\\x90\\x97\\x32\\xe0\\x3d\\xe6\\x80\\x12\\x32\\xe0\\xb5\\xa0\\x2e\\x9b\\x62\\x0a\\x94\\xd5\\x05\\x2b\\x14\\x72\\x0a\\x05\\x19\\x13\\xfc\\xe3\\xf2\\xd2\\x27\\xe1\\xc5\\x0c\\xdd\\x23\\xa1\\x56\\x14\\xce\\x63\\x18\\x57\\xa8\\x90\\x2e\\x76\\x99\\x18\\x59\\x33\\x9d\\x15\\x68\\x1a\\xf5\\x24\\xa3\\xd3\\x4a\\xf2\\xe8\\x43\\x04\\x84\\xe5\\xd6\\x87\\xb9\\xa2\\x68\\xd5\\x18\\x29\\xa9\\x31\\xaa\\x4a\\x2f\\x7b\\xaa\\x83\\x4b\\x35\\x3b\\x76\\x67\\xb7\\xb4\\x28\\xe6\\x74\\x38\\x41\\x18\\x87\\x12\\x55\\xfc\\x45\\xc1\\xe2\\xbe\\x9e\\x19\\x2d\\x92\\xf1\\x6a\\x63\\xfb\\x40\\x00\\x98\\xe2\\xd6\\xc7\\xb2\\x5a\\xb2\\xd3\\xde\\x0c\\x7a\\x07\\x62\\x64\\xe0\\x0c\\x23\\xae\\xda\\xc1\\x14\\xa6\\x24\\x9c\\x66\\x33\\x1b\\xf1\\x23\\x60\\x14\\x63\\x7f\\x04\\xf5\\x7d\\xab\\x06\\x26\\x59\\xab\\x75\\x36\\xeb\\x2b\\xd0\\xb2\\xb9\\x10\\xd9\\x26\\x8d\\x83\\x22\\xcd\\xaa\\xc8\\xb6\\x9e\\x97\\x8d\\x79\\xff\\xf8\\xf8\\x08\\x1a\\x69\\xe7\\x81\\x36\\x95\\x03\\x77\\x6d\\xde\\x66\\x98\\xf9\\xb4\\xce\\xcc\\x94\\x02\\x7e\\xcd\\x8c\\x2b\\x23\\xe8\\x3c\\xab\\x47\\x7d\\x2b\\x3e\\xaa\\x86\\xf5\\xb7\\xea\\xde\\x56\\x79\\x70\\x60\\xcc\\xc1\\x58\\xe0\\x3d\\x0f\\x76\\xa6\\xfc\\xe8\\xcd\\x73\\x26\\x73\\x8d\\x22\\x95\\xa5\\x79\\xea\\x46\\xa9\\xf9\\x19\\xf3\\xdf\\x79\\xda\\x8c\\x66\\x3e\\x76\\xe4\\xce\\xca\\x83\\x16\\x92\\xd5\\xa7\\xfe\\x18\\x48\\xdb\\xbe\\x0f\\xa0\\x7a\\x30\\x19\\xf8\\x49\\xf3\\x62\\x8f\\xed\\x47\\x0a\\x0f\\xbc\\x04\\x0e\\x69\\xa3\\xc8\\xe5\\xfd\\x45\\x10\\x3b\\x74\\x1f\\x8d\\x8b\\x49\\x62\\x0d\\x9d\\xc2\\xf6\\x87\\x50\\xc3\\xd0\\xc3\\x47\\xb3\\x92\\x8b\\x06\\xb5\\xe0\\x18\\x14\\xe0\\x75\\x2b\\xc5\\x4c\\x3b\\x2f\\x55\\x1c\\x60\\x18\\x53\\xa2\\xa5\\xac\\x32\\x8c\\x03\\x5e\\xf2\\xad\\xfb\\xac\\x5c\\xcb\\xa1\\x28\\x2a\\x9b\\x9c\\x4a\\x8d\\xff\\x90\\x7a\\x96\\x4c\\x84\\x7f\\xe2\\x58\\x09\\x9a\\x4f\\x09\\xaf\\xfb\\xe4\\x91\\xb1\\x29\\xdf\\x7e\\x64\\x3a\\x2a\\x33\\x06\\x64\\x96\\x8c\\xe1\\xbc\\x30\\xcb\\x0d\\x6a\\x8b\\x82\\xc4\\x79\\x63\\xba\\xe2\\x3d\\x2b\\xdb\\x76\\x1e\\x58\\xd7\\x90\\x0d\\xfa\\xd8\\x9f\\x86\\x30\\xe3\\xd5\\x81\\x1a\\x09\\x7d\\xc3\\x8a\\x38\\xa6\\x8e\\xed\\xb9\\xb9\\xc3\\x47\\x77\\x58\\x35\\x9f\\x0e\\xc9\\x96\\xa5\\xfb\\xf0\\x91\\xcd\\xf6\\x2c\\x9e\\x61\\x8e\\x7a\\x2f\\x03\\xc3\\xcc\\x6c\\xd0\\x43\\xc3\\x88\\x84\\x0f\\x70\\xfa\\xf0\\x7e\\x8e\\x6a\\x26\\xea\\x00\\x3a\\x03\\x37\\x71\\x8c\\x11\\x78\\x30\\x84\\xcc\\x08\\x5b\\x68\\x01\\xa6\\xb4\\x9d\\x97\\x41\\xaf\\xb1\\x75\\xde\\x37\\xd6\\x16\\x65\\x54\\x7c\\xd0\\x7d\\xd2\\x1f\\x3c\\x7a\\x6a\\xb4\\x61\\xd0\\xb1\\x4e\\xe1\\x58\\x00\\xcd\\x31\\xd6\\x9b\\xd7\\x98\\xef\\x77\\x8d\\xd9\\xe9\\x0d\\x61\\x15\\x61\\x5d\\x9f\\x74\\x1f\\x3d\\x1e\\x3e\\xc2\\x2d\\xe3\\x0f\\x5b\\xdf\\x60\\x7a\\xa1\\xa9\\x47\\xf4\\xd5\\x76\\x12\\x17\\x7e\\xfc\\xa1\\x7a\\x6f\\xe6\\x1a\\x76\\x87\\x46\\xb6\\xaf\\x4e\\x20\\x63\\x23\\xf5\\x71\\x23\\xf9\\xe9\\x43\\xc8\\x60\\xa8\\x9a\\x4d\\xca\\x62\\x15\\xc6\\x15\\x65\\x81\\xcf\\x06\\x65\\x41\\xd1\\x52\\xba\\x21\\x51\\x16\\x31\\x51\\x16\\x2b\\x45\\x59\\x84\\x8a\\xb2\\x88\\x6b\\xca\\x22\\xca\\x5f\\x05\\xaf\\xac\\x94\\x82\\xd9\\xd1\\xf5\\x3d\\xf2\\x43\\x66\\xe3\\xed\\xc1\\x3e\\xda\\x4d\\xd1\\x7b\\x64\\x4f\\xac\\x88\\xa2\\x13\\xc8\\x77\\x81\\xe9\\x2b\\x5f\\xd8\\x7e\\x34\\x1e\\x3c\\xed\\x4f\\x22\\x8f\\x9f\\x3c\\xee\\xfb\\x1e\\x3c\\x13\\xa6\\x8b\\x5c\\x7c\\xb7\\x0f\\xa1\\x86\\xbc\\x90\\xa4\\x0a\\x23\\xd2\\x84\\x49\\x52\\x04\\x71\\x85\\xa1\\xc9\\x6e\\x8c\\x34\\x37\\x46\\x9a\\x1f\\x18\\x69\\x7e\\x60\\xa4\\xf9\\xe7\\x8d\\x34\\xff\\xbf\\x32\\xd2\\xf0\\xe3\\x23\\x7d\\x63\\x8e\\x34\\x0e\\x6a\\x6a\\x11\\x9f\\x8d\\x91\\xc6\\xcc\\x10\\x4a\\xd0\\x48\\x63\\x35\\xd2\\xe0\\x53\\xa8\\xc5\\x07\\xab\\x8f\\x77\\xe5\\x9b\\x16\\x9f\\x87\\x86\\xc1\\x07\\x08\\x2b\\x83\\x8a\\x4c\\x90\\xba\\x32\\x4f\\xce\\xeb\\xb2\\x16\\x1a\\x4f\\xb1\\xbb\\xd0\\x59\\x34\\x43\\x98\\xe2\\x76\\x4c\\xba\\x73\\xb4\\x04\\xf9\\xa7\\x94\\x86\\x80\\xbf\\xca\\x20\\x5f\\x30\\x16\\xf8\\xf2\\x2d\\x52\\x2b\\x05\\x06\\xfb\\xb4\\x6f\\x6e\\x00\\xf1\\xa3\\x7b\\x0e\\x5a\\x25\\x9c\\x0a\\x7d\\x75\\x0d\\x82\\x18\\x7c\\x46\\x82\\x0c\\xdf\\xe9\\x21\\xa3\\xbf\\x25\\xfe\\x55\\x5a\\x0a\\xe5\\x8b\\x61\\x65\\xa6\\xbc\\x85\\x2e\\xb2\\x21\\xbb\\x0d\\x53\\xd2\\xe2\\xd5\\xfe\\xad\\x64\\x5e\\x4a\\xe5\\x6b\\x63\\x22\\xe8\\xb3\\x80\\x3e\\x2f\\x66\\x4a\\xec\\x43\\xa6\\x4b\\xd3\\x8c\\x45\\xfa\\xc3\\x5b\\x71\\xcd\\xa3\\x86\\x58\\x07\\xb8\\x34\\xa8\\xc8\\x37\\x04\\x77\\xbf\\x96\\x1f\\xbb\\xe6\\xc7\\x50\\x8e\\x97\\x6d\\x2b\\x5a\\x84\\xc8\\x54\\x43\\x62\\x9b\\x97\\xf7\\x5a\\xad\\xcb\\x71\\x1a\\x2e\\x05\\xdf\\x96\\x6d\\xdf\\x08\\x8a\\x9d\\x28\\x1c\\xe3\\x62\\x1f\\xa1\\xae\\x0a\\x32\\x54\\x8d\\x77\\x52\\x32\\xb0\\x15\\x69\\x4e\\x80\\x70\\x58\\xcb\\xd0\\x69\\x8d\\x2f\\x64\\xc6\\x1f\\x19\\xa6\\x5f\\x18\\xdd\\xac\\x7e\\x8b\\x21\\x4d\\x2e\\x09\\x1a\\x23\\xeb\\x47\\x54\\xd4\\xe0\\xf4\\xb1\\x15\\x2a\\x5e\\xf1\\x61\\x89\\x5f\\xc8\\x90\\x6c\\x83\\x9f\\xf0\\xa9\\xc2\\x36\\xd0\\xef\\x23\\xa2\\x34\\x6f\\x6e\\x30\\x9e\\x11\\x3e\\x0f\\x66\\x78\\x41\\xbc\\x8c\\x09\\x51\\x35\\x66\\x75\\xa4\\xde\\x18\\xe3\\x4a\\xc8\\x07\\xbb\\x03\\x1b\\xad\\xa2\\x8a\\x07\\x92\\x2a\\x26\\x33\\x86\\x90\\x8c\\x78\\x18\\x7c\\x3d\\xd1\\x5f\\x07\\x33\\xe2\\xd0\\x91\\x62\\xf6\\x55\\xdd\\xb2\\x51\\x6a\\xce\\x6c\\xc6\\x0d\\xf1\\xce\\x4e\\x1f\\x48\\x4e\\x16\\x1f\\xf1\\x7c\\x62\\xc5\\x5e\\x4e\\xa0\\x21\\x27\\x50\\xe0\\xe7\\x5e\\x8c\\xaf\\x18\\xf3\\x52\\xc1\\x86\\xba\\x13\\xaa\\xe6\\x4c\\x0a\\x71\\xdc\\x8e\\x9c\\x11\\xcb\\xe8\\xb1\\x37\\x94\\x3d\\x8a\\x59\\x4e\\x7d\\xc9\\x8f\\x8f\\xef\\x2a\\xe4\\xe6\\x2e\\x8d\\x71\\x71\\xc4\\x57\\x93\\xbb\\xdb\\xc0\\x19\\xfe\\xe3\\x50\\x13\\x18\\xb7\\x13\\x28\\xf4\\xd5\\x7e\\x0b\\xaa\\x88\\xbb\\x92\\x0d\\x2c\\x69\\x0d\\x36\\x34\\x1d\\x4b\\x5a\\x83\\x0d\\xad\\x81\\xe0\\x7b\\x05\\x71\\xe9\\x3e\\xb6\\x12\\xc2\\x7b\\x28\\x3b\\xb0\\x94\\x41\\x26\\xf5\\x5a\\x08\\xdd\\xb1\\x25\\xa9\\x90\\xf5\\x6a\\x58\\x03\\xdd\\xf6\\x40\\x36\\x6c\\x1f\\xe8\\xb0\\x6c\\xd7\\xdd\\xc8\\x0e\\x8b\\xea\\x3a\\xd7\\x83\\xec\\x05\\xc6\\xa4\\xa0\\x7b\\xee\\xa2\\x53\\x31\\xb2\\xb3\\x29\\x50\\x2f\\xe5\\x34\\x92\\xec\\x45\\xd1\\x60\\x2f\\xb2\\x9a\\xbd\\x30\\xb4\\xe8\\x2d\\x48\\x89\\x37\\x34\\x71\\xe4\\x46\\x01\\x78\\x0d\\x7a\\x87\\xd8\\x51\\xb2\\xa1\\xef\\x15\\x66\\x20\\xb8\\xcf\\xae\\xe3\\x41\\x15\\xb4\\xaa\\x5f\\x87\\xac\\x1a\\x30\\x55\\x75\\x83\\x00\\xfe\\xb3\\x6c\\x1b\\xe4\\x49\\x0f\\x05\\x52\\xc1\\x4a\\x6f\\x04\\x38\\xe4\\xbf\\x29\\x08\\x0c\\x27\\xbd\\x98\\x8d\\x0a\\x94\\x43\\xa2\\x3e\\xad\\xc0\\x08\\x43\\x40\\xc2\\xe9\\x05\\x2b\\x6a\\x9b\\x25\\xe3\\x96\\x5c\\x21\\xb3\\x97\\x5a\\x5d\\x16\\xb1\\x3e\\xd6\\x85\\xa6\\x2d\\xb2\\x78\\xcd\\x4d\\xd4\\x5a\\xe5\\x56\\xb7\\xa6\\x64\\xa2\\xa6\\xf3\\x4b\\x7f\\x1a\\x81\\x37\\xda\\x6a\\x8b\\xaf\\x84\\x8b\\x03\\x35\\xd6\\xe9\\xe6\\xc5\\xb6\\x6a\\x3e\\x49\\x22\\xc4\\x01\\x28\\x6a\\xf0\\x37\\xaa\\x6f\\x27\\xa4\\xf6\\x61\\xe0\\x7f\\x29\\x14\\xa4\\x6e\\x3e\\x40\\x83\\x5c\\xf5\\x24\\xcd\\x2c\\x47\\x25\\xd4\\x10\\xa1\\xa5\\x55\\x79\\x28\\x57\\x6d\\x84\\x59\\x6b\\x4b\\x95\\x04\\x7e\\x11\\x6d\\xc5\\xfc\\x86\\x1b\\x46\\x1c\\x5f\\x98\\x29\\xc7\\xdc\\x7b\\x62\\xa8\\x14\\x9b\\x85\\x1e\\x62\\x98\\xd6\\x2d\\xd9\\x42\\xc1\\x03\\x5e\\x2b\\x6f\\x88\\x39\\x7f\\x6f\\x55\\x63\\x90\\x85\\xff\\x2a\\x9b\\xba\\x0b\\x0a\\x0f\\x2f\\x6f\\xf0\\x09\\x57\\xb8\\xd6\\xf0\\xe5\\x08\\x39\\xce\\x60\\xd1\\x88\\x99\\xa7\\xc5\\x6f\\x41\\x75\\x05\\x0d\\x00\\x6f\\x3a\\x15\\xe1\\x29\\xd9\\xb5\\xa5\\xd3\\x70\\xc6\\xe4\\xaa\\x20\\xa1\\xf3\\x2f\\x8c\\x60\\x57\\xc8\\x78\\x20\\xb2\\x62\\x17\\xa0\\xb6\\x7c\\x02\\xb2\\xa2\\x7a\\x76\\xe0\\x61\\x0b\\x14\\x46\\xe3\\x83\\x0c\\x75\\x5a\\x89\\x17\\x65\\x77\\x90\\x46\\x97\\x5f\\xba\\x5b\\xe5\\x20\\x01\\x50\\x76\\x9e\\xae\\x2d\\xdb\\xeb\\x3e\\xd2\\x51\\x6b\\xbb\\xbb\\xfd\\xb4\\xca\\xbe\\x09\\xa8\\x04\\x9d\\x8d\\xe4\\x2c\\xb3\\x51\\xdd\\x39\\x95\\xf0\\x5c\\x4e\\x42\\x8c\\x7d\\x8c\\x9d\\xaa\\x41\\xec\\x61\\xfd\\xba\\xbb\\x85\\x72\\x5b\\x9e\\xf5\\x74\\x71\\x1c\\xe4\\x8e\\x97\\xd5\\xbb\\xa1\\xb9\\x6a\\x9d\\xdc\\xca\\x07\\x13\\x57\\xa1\\x83\\xda\\x04\\x80\\x7b\\xe1\\x2a\\x8a\\xe7\\xb0\\x69\\xe1\\xf1\\x2a\\x88\\x4b\\xd1\\xc1\\x59\\xa3\\xf9\\x06\\xaa\\x8a\\xbc\\xca\\xdf\\xe6\\x3c\\x8b\\x4c\\x1c\\xfc\\x63\\x5b\\x66\\x41\\x56\\x8a\\x72\\xfe\\x61\\x4f\\xab\\x6d\\x68\\x93\\xaa\\x01\\xc5\\x2b\\x0c\\x15\\x0e\\x5d\\xdd\\x90\\x94\\x3e\\xe9\\xe3\\x69\\x57\\x2b\\x8d\\xf1\\x63\\xa4\\x84\\x63\\x64\\xab\\x0b\\x3f\\x4a\\x94\\xa4\\x18\\xba\\xaf\\x43\\xed\\x12\\x0d\\x70\\x47\\xe3\\x59\\x75\\xfe\\x30\\x66\\x40\\xa3\\x07\\x25\\x8f\\xf6\\x7a\\x20\\x03\\xdc\\xd3\\xc6\\x4a\\x4f\\xcb\\xaa\\x17\\x11\\x5e\\x54\\x22\\x25\\x17\\x55\\x33\\x59\\xd5\\x4c\\xd1\\x30\\xf5\\x4c\\xa2\\x86\\xf8\\x5f\\xb7\\x68\\x68\\xc0\\x9a\\x19\\x68\\xca\\x0d\\x9d\\x57\\xd4\\xd2\\x60\\x50\\xba\\xb7\\x97\\x2f\\x33\\x6b\\xa9\\xa2\\xc9\\x25\\x4d\\xaf\\xb0\\xc4\\x50\\x6f\\xe8\\x8e\\xdc\\xdc\\x4c\\x01\\x79\\x1c\\x76\\x1e\\xfb\\x20\\x41\\x2f\\xba\\xb0\\x12\\xe0\\xc5\\x78\\x7e\\x88\\xd6\\x0c\\xf5\\x55\\x74\\x97\\xda\\x23\\x8a\\xee\\x52\\x7b\\xa4\\x91\\x3e\\xf4\\xf0\\xb9\\x4f\\x1a\\xcd\\x9d\\xa9\\x12\\x0b\\x5a\\x43\\x51\\xee\\x70\\x7a\\x71\\x0c\\x9d\\x4b\\xd4\\x84\\xc9\\x78\\xcf\\x32\\x59\\x71\\xd5\\x91\\x37\\xa7\\x78\\xef\\x51\\x21\\x31\\x65\\x31\\xab\\x82\\xf0\\x3e\\x30\\xb4\\xb0\\x71\\xd4\\x36\\xe8\\x18\\x18\\xd7\\x26\\x21\\x36\\xaf\\x65\\x62\\x95\\xfc\\x8a\\x22\\xd3\\x09\\x32\\xeb\\x18\\x97\\xb4\\x7d\\x05\\xc5\\x3e\\x3a\\x50\\x7f\\xde\\x9c\\x88\\x4c\\xcc\\x4b\\xc0\\x39\\x0b\\x40\\x3a\\xe6\\x9d\\x3f\\xcd\\x65\\x06\\xee\\xa4\\x41\\x5f\\xaf\\x9a\\xc9\\x4b\\x7c\\x95\\xb2\\x14\\x11\\xc5\\x56\\x65\\x23\\x5f\\x89\\xe4\\xa4\\xaf\\xcb\\xcb\\x57\\x43\\xb7\\x21\\x3b\\x59\\x46\\xed\\xe3\\x42\\x37\\xb7\\x4a\\xe7\\xf3\\x92\\x4b\\xe3\\xf1\\x0c\\x30\\x32\\x8b\\xe4\\xcc\\x89\\x53\\x5e\\xc0\\xb9\\x41\\x41\\x5b\\xe9\\x08\\xb7\\x32\\x83\\x36\\xe2\\xc6\\x6c\\x8c\\xe1\\x4d\\x71\\xe3\\x49\\xff\\x3d\\x7c\\x0a\\x90\\x1a\\x31\\x2f\\x0e\\x6d\\x0d\\x52\\xed\\xe5\\xa2\\xbd\\x97\\xe7\\x51\\xd3\\x5e\\xe5\\x62\\x13\\x84\\x6f\\x2f\\x12\\xb1\\x05\\x44\\x6b\\xbc\\xa0\\x26\\x5b\\xbd\\x6e\\x32\\x71\\x85\\x4a\\x6e\\x33\\x15\\xd0\\xaf\\x99\\x6a\\xe0\\xdb\\xb5\\xaa\\xff\\xde\\xca\\x0c\\x51\\x69\\xa3\\x3b\\x4a\\x75\\x48\\x2a\\x61\\x52\\x02\\x12\\x5f\\x9b\\xb9\\x45\\x57\\xcf\\x4e\\xf7\\xab\\xaf\\xbe\\xc2\\x00\\x7c\\x63\\x0c\\xb4\\x95\\x39\\xc6\\x56\\x38\\x8b\\xf6\\x43\\x5f\\xe4\\xa6\\x68\\x15\\xab\\xce\\x80\\x78\\x06\\x36\\xa3\\xa2\\x98\\xe0\\xab\\x8b\\x5f\\x17\\xb6\\xbe\\x1d\\x51\\xe6\\xdd\\x51\\xde\\x15\\x05\\xf8\\xa9\\xf3\\xee\\x28\\xef\\x92\\xc2\\x0b\\xe3\\x6d\\x74\\x0d\\x10\\x17\\x57\\x06\\x48\\x76\\x43\\x8f\\x50\\x9b\\x46\\xa2\\x16\\x0e\\x1a\\x47\\xd3\\x52\\x8c\\x29\\xd1\\xc3\\x98\\x12\\x64\\x67\\x8a\\x16\\x43\\xd5\\xad\\x7a\\xdb\\x88\\xfc\\x67\\xe8\\xb2\\x88\\xee\\x96\\x7b\\x19\\x6a\\x84\\xe0\\x10\\xf7\\x19\\xb9\\xab\\xc5\\xe8\\x1c\\x01\\xf0\\x94\\xdc\\x04\\x4a\\xc8\\x50\\x42\\x7a\\xa9\\xd2\\xf1\\x52\\xce\\xf1\\x50\\x82\\x58\\xf4\\x34\\x18\\xce\\xd8\\x75\\xa4\\xee\\x34\\x64\\x74\\x27\\xd3\\x1c\\x5f\\xb1\\x05\\x73\\x3d\\x22\\xfc\\x4c\\x9a\\x07\\xd4\\x4b\\xd4\\xeb\\x06\\xe0\\xf9\\x64\\x14\\x8f\\xd3\\x51\\x8a\\xbe\\x19\\xba\\x26\\xa8\\x37\\x55\\x57\\x6e\\x6d\\x30\\xac\\x3e\\x1c\\x69\\xbc\\x21\\x42\\x5a\\x68\\x96\\xe6\\x86\\x0a\\x80\\x16\\x2c\\x47\\x68\\x36\\x6d\\xd4\\x79\\x05\\x75\\xe1\\xe5\\x0e\\x91\\x15\\x90\\x1a\\x75\\x03\\x65\\x2b\\x93\\xeb\\x01\\xe7\\xf2\\xa6\\xb9\\x90\\x9b\\x3d\\x1c\\x85\\x78\\x07\\x8c\\xf1\\xe1\\xf8\\xf8\\x08\\x2a\\x08\\xd1\\x15\\x2e\\xe4\\xa1\\x91\\xc0\\xf0\\x96\\x85\\xd1\\x66\\x62\\xcd\\xc7\\x57\\x37\\x37\\x57\\x9c\\xcf\\x8f\\x8f\\x61\\x86\\x4e\\x61\\x16\\x27\\x6b\\x1a\\x00\\x9a\\x7e\\xe3\\x13\\x0f\\x19\\x85\\x9c\\xf4\\x80\\x91\\xd0\\xb3\\x52\\x62\\xd4\\x2a\\x98\\x26\\x19\\x7e\\x69\\x8d\\x91\\x74\\x17\\x68\\x60\\xb5\\x43\\x53\\xab\\x25\\x3e\\x9d\\x01\\x98\\xc3\\xfe\\xa1\\xd9\\xa9\\x9e\\x19\\x39\\x23\\x0c\\x8d\\x0d\\xf9\\x9a\\xa1\\xad\\x21\\xdf\\xe9\\x0b\\x30\\x70\\xe3\\x9c\\xc1\\xb7\\xcc\\xb0\\xfa\\x83\\x8c\\x40\\xfa\\x6c\\x5d\\xc8\\xe9\\xa0\\xf2\\xde\\x1e\\xa1\\xd9\\xc9\\x19\\xab\\xf7\\xc0\\x65\\x43\\xad\\xbb\\x8d\\x24\\x8d\\x67\\x1c\\xa8\\xe4\\x8e\\xe3\\x74\\x49\\x59\\xe7\\x22\\x16\\x85\\x78\\x60\\x96\\x60\\xad\\x6f\\x58\\xd0\\x10\\x8c\\x47\\x7b\\x16\\x41\\xd5\\xde\\x96\\xf4\\xd9\\x96\\x17\\x2e\\xcf\\x1c\\x49\\x84\\x02\\x46\\x91\\x2f\\x3b\\x34\\x98\\x71\\x38\\x46\\xd9\\xab\\x59\\x01\\xba\\xb8\\xac\\xe2\\x07\\x90\\x97\\x4a\\x47\\x36\\xb4\\x80\\x9c\\x94\\x6a\\xc4\\x10\\xbc\\x47\\x6d\\x03\\x9b\\xcc\\x15\\xb8\\xa3\\x2b\\x58\\x10\\x69\\x58\\x40\\x96\\x9f\\x14\\xbe\\xfd\\xa6\\x56\\xbf\\x17\\x2a\\x3f\\xec\\x3c\\x19\\x3b\\x70\\x94\\x3a\\x3c\\x45\\x01\\x50\\xa6\\xae\\x04\\xed\\x3e\\x72\\xad\\xcc\\x4b\\x29\\x62\\x67\\x50\\x5f\\x56\\x4d\\x81\\xf7\\x6b\\xc6\\x69\\xe8\\x50\\x00\\xbe\\xc0\\xf6\\x20\\x33\\x5e\\x14\\x0d\\x45\\xf0\\xf6\\x1b\\x59\\x6a\\x24\\xba\\x44\\x80\\xbb\\x21\\x34\\x12\\x3b\\x11\\x2c\\x15\\xd1\\xe1\\x2e\\x06\\x4d\\x88\\x9d\\x52\\x1a\\x73\\xe9\\x4c\\x99\\x4e\\x36\\x74\\x08\\x6d\\xe8\\x2c\\x39\\x17\\x5e\\x31\\x55\\x93\\x81\\x19\\x97\\xfb\\x6d\\xd4\\x30\\xb2\\xd4\\x2b\\x51\\xd1\\x29\\x4a\\x86\\x4e\\x31\\xb5\\x81\\x71\\x33\\x54\\x02\\x91\\xe9\\x8c\\xb7\\x57\\x14\\x30\\x6b\\x05\\xa4\\x26\\x62\\x5a\\x78\\x83\\x56\\xf9\\x67\\xad\\xe5\\x10\\x3d\\xc0\\x7b\\x11\\xcc\\x7e\\x84\\x37\\x8a\\x87\\x1e\\xde\\x41\\xd8\\xcd\\x5d\\x4e\\x64\\xb0\\x4b\\x6f\\xef\\x5d\\x8a\\xaa\\xb6\\x76\\x4d\\x32\\xe3\\xd5\\x1e\\xde\\xef\\x6b\\xbc\\x5f\\xf5\\x89\\x19\\x5c\\xa3\\xe7\\x45\\x44\\x89\\x4a\\x7e\\xbb\\x59\\x2b\\x83\\xcd\\x86\\x8d\\xc2\\xf2\\xa0\\xa8\\xda\\xd4\\x42\\x44\\x6d\\x99\\x56\\x37\\xa8\\x66\\xb6\\x9e\\x5a\\xf8\\xea\\x1b\\x7d\\x7b\\x6f\\xd2\\x0c\\x03\\x57\\x23\\xd3\\x43\\x82\\x5a\\x5c\\x43\\xa3\\xbd\\x77\\x87\\xa9\\x8d\\xaa\\x5c\\x93\\xc8\\x00\\x82\\x0d\\xc8\\x90\\x9e\\x26\\x6f\\x0c\\x79\\xfd\\xfd\\xab\\x8b\\xd7\\x8c\\xa9\\x05\\x86\\x9c\\x52\\x3c\\x69\\x1c\\xf1\\x5f\\xee\\x5f\\xe2\\x07\\x82\\x94\\x2e\\xf5\\x32\\x43\\x7e\\xb9\\xd2\\x8d\\x5a\\xde\\x18\\x43\\xc1\\x78\\xd2\\x70\\xd0\\x76\\x3e\\x1e\\xe8\\x39\\xbe\\xcc\\xb7\\x6c\\x8e\\xaf\\x73\\xf3\\x4a\\xb7\\x6f\\x5a\\x94\\xc3\\x16\\xe8\\xa8\\x13\\xba\\xd1\\x08\\x0e\\x42\\x21\\xa9\\x1c\\x2c\\x4a\\x5e\\x71\\x1e\\xa5\\x21\\x71\\x37\\xdf\\x91\\x6b\\x9c\\x87\\x57\\x85\\x8f\\x2a\\xed\\x20\\xd2\\x75\\xb0\\xae\\x65\\x0f\\x1d\\x00\\xfb\\x36\\x93\\x32\\x73\\xe4\\x16\\x29\\xa0\\x2f\\x7c\\xd1\\x2e\\x5a\\xd8\\xa3\\x12\\xbb\\x13\\x99\\x02\\xe5\\xe8\\x93\\x5c\\xda\\x1e\\x88\\x71\\x31\\xa1\\x4b\\xe1\\xfc\\xa9\\x68\\x84\\x8a\\xf9\\xb5\\xb5\\x94\\x48\\x06\\x4b\\x9f\\xc9\\x49\\xe3\\xcd\\xb2\\x7d\\x6c\\x4b\\xd1\\xc9\\x26\\xbd\\xf7\\xcf\\x1e\\xcc\\x94\\x56\\xca\\x24\\x4b\\x25\\xa9\\x80\\x71\\x27\\xd4\\x3d\\x12\\xf8\\x88\\x5c\\xa3\\x1b\\x7e\\x2c\\x51\\x53\\xe8\\x2a\\x8f\\x4d\\x75\\x2b\\x64\\x24\\x2f\\x18\\x05\\x46\\x7d\\x5a\\x56\\x03\\x8d\\xc6\\x29\\xce\\x28\\x9a\\xc9\\x49\\xe1\\x04\\x85\\x03\\x88\\x28\\xcc\\x28\\x72\\xe6\\x50\\x02\\x0e\\xc4\\x22\\x4e\\x53\\xb2\\x1d\\xc3\\xa2\\x78\\x98\\x90\\xc2\\xc5\\x9b\\xd1\\x0c\\x89\\x6f\\x63\\x62\\x26\\x1f\\xa8\\x88\\x7f\\x97\\x56\\x52\\x56\\x58\\xf4\\x12\\xdb\\x49\\x6e\\x19\\x56\\x77\\x67\\x56\\x6a\\x4b\\xe5\\xbc\\xf5\\xd7\\x86\\xe9\\xe1\\x4f\\x7b\\x33\\x49\\x12\\x66\\xba\\x73\\xb8\\x7f\\xbf\\x7a\\xdc\\x93\\x74\\x07\\xde\\x0b\\x7c\\x9a\\x90\\xad\\x15\\x5d\\xb3\\x27\\x4d\\x16\\x6c\\x38\\xa1\\x57\\x22\\xcb\\x05\\x79\\x7c\\x14\\xfb\\x5f\\xe5\\x3d\\x99\\x3c\\x40\\x71\\x95\\xbc\\xd0\\x12\\x6a\\x4a\\x3d\\x32\\x2f\\x07\\x12\\xc7\\xd6\\x97\\xf9\\xe2\\x4a\\xd2\\xe7\\x82\\x3e\\xef\\x2d\\x66\\x4d\\xbf\\x06\\xdd\\xcb\\x28\\x17\\x21\\x05\\x41\\xa6\\x90\\xe0\\x5e\\x75\\x3b\\x22\\x12\\xfa\\x64\\xf2\\x62\\x35\\x65\\x72\\x3f\\x18\\xa3\\xaf\\x59\\x3f\\xab\\x11\\x01\\xe4\\xf0\\xe0\\xc7\\xc3\\xc9\\x4f\\x91\\xff\\x0f\\xfa\\x8e\\x66\\x93\\x1f\\x4a\\xff\\xa7\\x4a\\xd1\\x93\\xca\\xab\\x50\\x19\\xb9\\x96\\x05\\x74\\x5d\\x43\\x02\\x2f\\x6b\\x0c\\x45\\x63\\x70\\x91\\xc6\\x4a\\xa7\\xc8\\x57\\x13\\x4a\\x65\\x41\\xd5\\xe3\\x7d\\x9f\\xf3\\x3a\\x82\\x15\\xe6\\x87\\xf9\\x99\\xa7\\xeb\\x20\\x32\\x62\\x09\\x16\\xf7\\xc4\\xb8\\x4a\\x60\\x0d\\x90\\x17\\x7e\\x55\\xae\\x2f\\x45\\xa6\\x82\\x8e\\x25\\x58\\x0b\\x9d\\xae\\x83\\xcd\\xec\\x55\\x82\\x91\\x2e\\xa8\\x60\\x51\\x15\\x7c\\x83\\x4a\\xa7\\x43\\xa5\\x23\\xcd\\xde\\xda\\x86\\xf5\\x86\\xb0\\xbe\\x29\\xa9\\xeb\\x61\\x1c\\xac\\x37\\x9f\\xd6\\x68\\xa6\\x1b\\x45\\x87\\x51\\xb3\\xae\\x4f\\x2b\\x2e\\x74\\x71\\x81\\xc5\\x8b\\x28\\x7c\\x9b\\x1f\\x9a\\xb1\\x3f\\xe4\\xb9\\xd7\\x79\\xbe\\x4d\\xb3\\x75\\x60\\x4c\\xbe\\x89\\xe8\\xbe\\xd0\\x98\\x0f\\x33\\x27\\xb0\\xad\\x0f\\xd5\\xf7\\x97\\x8a\\x6a\\x87\\x91\\xf3\\x70\\xbc\\xe9\\x66\\xc7\\xf7\\xad\\x6e\\x8c\\xfd\\x77\\xdb\\x0c\\xb2\\xf7\\x67\\x74\\x9f\\x40\\x8b\\xa6\\xb6\\xa3\\x7e\\x69\\x09\\xe0\\xc5\\x98\\x1a\\x14\\x76\\xe1\\x0c\\x77\\x8c\\x1a\\xff\\x6a\\xd6\\x48\\x80\\x0e\\x00\\xce\\x6f\\xf2\\x33\\x5e\\xab\\x66\\x64\\xfe\\x4d\\x73\\x92\\xe4\\x2d\\x2f\\x63\\x65\\x0c\\xfa\\x5a\\xf5\\x49\\x18\\x80\\x18\\xa5\\x81\\xf4\\x59\\xd6\\x31\\x44\\xd0\\x34\\x60\\xa0\\x24\\xe1\\x12\\x3c\\x19\\x31\\x2b\\x8a\\x8a\\x7b\\x87\\x9a\\x10\\x48\\x17\\xbd\\xac\\x8a\\x86\\xd5\\x1d\\x3c\\x1a\\xf3\\x68\\x52\\x3a\\xd0\\x8c\\xdf\\x3d\\xd1\\x2f\\x8f\\x7c\\x54\\xd7\\x93\\xa8\\x13\\xde\\x86\\x36\\xc3\\xd6\\x78\\x0d\\xd3\\xf0\\xb5\\x57\\xda\\x4e\\x49\\x3a\\x43\\x6e\\x34\\x8c\\xef\\x94\\xe2\\x76\\x1f\\x51\\xf2\\x70\\x86\\x16\\xcc\\x86\\x78\\x78\\x7f\\x86\\x71\\x36\\x75\\x38\\xb6\\x80\\xa9\\x39\\x30\\x5d\\x64\\x5a\\x14\\x9a\\xca\\x21\\xbd\\x4e\\x14\\xcc\\x88\\x42\\x69\\x6b\\x26\\xdd\\x44\\x4b\\x7d\\x3d\\x29\\xeb\\xe4\\x1d\\x34\\x39\\x9e\\x3e\\x9d\\xe9\\xe0\\x35\\xd0\\xe2\\x82\\xb6\\xd9\\xeb\\x4c\\x2c\\xa2\\x6d\\x4d\\x11\\xab\\x6b\\x65\\xe8\\x62\\xcd\\x4c\\x5e\\x09\\x56\\x09\\xee\\xa7\\x4f\\x66\\x64\\xbd\\xf7\\x64\\xc6\\x3b\\xdd\\x8e\\xfb\\x75\\x64\\x29\\x25\\x1d\\xe4\\x1c\\xd2\\xa5\\x6b\\xd8\\x04\\xef\\x2c\\x3a\\x4c\\xd4\\x2d\\x40\\x3f\\xb4\\xca\\xe4\\xa0\\x52\\x5c\\x54\\xb5\\xa0\\x59\\x22\\x3c\\xef\\xd6\\x97\\x69\\x7c\\x7b\\xdb\\x6e\\xee\\x77\\xe4\\x24\\x9e\\xce\\xf0\\xf2\\x78\\x52\\xe7\\x54\\x7a\\x18\\x49\\x83\\xf3\\x0e\\x93\\x7d\\xa2\\xbe\\xb8\\xd0\\x89\\x51\\x3d\\xbb\\xaa\\x27\\xa6\\x85\\xff\\xd7\\x06\\x14\\xf4\\x0e\\x6d\\x9a\\xc4\\xd8\\x32\\x6e\\xb7\\x3f\\x30\\xca\\xfe\\xde\\xa0\\x88\\xbe\\x46\\x62\\x6d\\x58\\xe3\\xfa\\x04\\x8d\\x17\\x77\\xb1\\xd2\\x04\\x5f\\xe6\\x96\\xf0\\x20\\x8b\\x39\\xc3\\x85\\x9e\\xe1\\x42\\xce\\xb0\\xed\\x3e\\x70\\xad\\x8e\\xe8\\x1c\\x61\\x70\\x08\\xd4\\x7a\\x39\\x56\\xe7\\x4b\\x5c\\x32\\x53\\xe6\\xf9\\xaf\\xc3\\xf8\\xa2\\x16\\x3f\\x2a\\xb7\\x03\\xec\\x7b\\x7f\\x9c\\x4c\\xfa\\x3e\\xd4\\xe5\\xd5\\xc3\\xa1\\x7b\\x83\\x30\\x72\\x53\\x1d\\xb3\\xa5\\xb0\\x0f\\x23\\x05\\x55\\x93\\x36\\x3d\\x52\\xb5\\xc8\\x57\\x2f\\x69\\x84\\x58\\x36\\x28\\x5f\\x0a\\x01\\x53\\x5d\\x91\\x94\\xee\\x21\\x91\\xc2\\x20\\x7d\\x12\\x1d\\x54\\x14\\x4b\\xb0\\xf4\\xb3\\xd0\\x89\\x20\\xbf\\x29\\x60\\x1b\\xd0\\x82\\x80\\xca\\x59\\x56\\xd6\\x44\\x31\\x52\\xf6\\x5a\\x62\\x2c\\x1a\\x82\\xdd\\x69\\xf7\\x32\\xc8\\x0d\\x58\\x29\\xee\\x45\\x34\\xae\\xa8\\x6b\\xce\\xcc\\x9a\\x0a\\xac\\xa9\\x09\\x75\\x35\\x31\\x0a\\x20\\x4d\\x67\\x65\\x72\\xfa\\xfc\\x6d\\xed\\xb6\\x52\\x55\\x87\\x4e\\x71\\xaa\\xab\\x40\\x8d\\xa5\\x58\\x5f\\x0b\\x2d\\xe8\\x50\\x25\\x00\\xe7\\xb2\\xea\\x3a\\x83\\x44\\xfa\\x8b\\xa9\\x48\\x11\\xc6\\x6e\\x2d\\x31\\x46\\x14\\xcb\\x0d\\xa8\\x54\\x5a\\x21\\x9e\\x33\\x5e\\x7c\\x39\\x98\\x0c\\x7d\\x72\\x56\\x8e\\xf2\\x6f\\xa3\\x24\\x02\\x04\\x98\\x7b\\xb1\\x34\\xec\\x16\\xca\\x3b\\x22\\x1f\\xc7\\xa3\\xd8\\x75\\x2b\\x26\\x7e\\x45\\xb1\\x00\\x56\\xa3\\x15\\x7c\\x53\\x77\\x2c\\x44\\x56\\x6c\\x3b\\x2b\\x7b\\x64\\xbc\\xaa\\x23\\x47\\xe2\\x10\\xe3\\x2b\\xd6\\x74\\x9a\\x8f\\x8c\\xca\\x16\\x40\\x05\\xad\\xc6\\xfd\\xd1\\xca\\xf3\\xda\\xd5\\x61\\xa6\\x18\\x38\\xbf\\x74\\x1a\\xcf\\x4e\\x03\\xea\\x84\\x8a\\x46\\xa0\\x95\\x4f\\x90\\x84\\x31\\x08\\xc6\\xe1\\x28\\x87\\xe2\\xa3\\x14\\xed\\x00\\x88\\x90\\x23\\x45\\x78\\xa5\\x72\\x53\\x33\\xd8\\x46\\x9a\\x5a\\xf7\\x77\\xd4\\x5e\\x60\\xad\\x07\\x3c\\x8b\\x47\\xfb\\x76\\x6b\\x93\\x82\\x9f\\xc5\\x7e\\x47\\xd7\\x02\\x07\\xb2\\xd8\\x6d\\x44\\xba\\x78\\x20\\xb1\\x50\\x0d\\x49\\xb4\\x13\\x45\\x56\\x91\\xa9\\x70\\xb2\\xbb\\x03\\x96\\xf4\\xd4\\x82\\x02\\xb9\\xa9\\xfd\\x43\\x42\\x2e\\x90\\x92\\x18\\x08\\x6f\\x30\\xac\\x05\\xcc\\x18\\x0c\\x88\\x7b\\xc6\\x47\\x5a\\xd0\\xfb\\x18\\x86\\xa4\\x17\\x59\\x21\\x31\\x0d\\x2e\\xec\\x70\\x20\\x5f\\x27\\x28\\xeb\\xf4\\xd1\\x66\\x07\\x26\\xe1\\x0e\\x2c\\x8f\\x50\\x83\\xd2\\x90\\x16\\x56\\xc8\\x1e\\xf0\\x7b\\xca\\xcc\\x63\\xfc\\x5d\\x85\\x5b\\x6a\\xd5\\xc7\\x81\\x93\\x2d\\x91\\xcc\\x8f\\x91\\x0c\\x4a\\x07\\xbf\\x83\\x9e\\x21\\x9c\\xff\\x8c\\xf3\\x9e\\x7d\\x1e\\xf9\\x58\\x9d\\x72\\x71\\xd7\\x29\\xcf\\x88\\xc4\\xca\\xda\\x67\\x29\\x31\\x49\\x2c\\x81\\x43\\x56\\x79\\x0e\\xee\\x96\\x9a\\xc4\\x12\\x4c\\xd2\\x63\\x59\\xeb\\xb0\\x9b\\x91\\x01\\x55\\x9f\\xfe\\x92\\x15\\x53\\x66\\xb1\\xdd\\xa4\\x49\\x23\\x3a\\x50\\x7a\\xcf\\xb0\\xe4\\x4c\\xe2\\xad\\xd2\\xd5\\x5c\\xd6\\x60\\x47\\x98\\x43\\x2b\\xb0\\xf2\\x3b\\xd6\\xf7\\xbb\\xe6\\xfa\\xca\\xd5\\xcd\\x1a\\xab\\xfb\\x63\\xf4\\x31\\x93\\xdd\\x62\\x52\\x43\\x78\\x8f\\x20\\xfe\\x5d\\xa6\\xa7\\x3f\\x47\\x7b\\x21\\xb3\\x6a\\x58\\x1a\\x4d\\x2d\\x40\\xf6\\x4b\\x81\\x88\\x16\\x30\\xb7\\xa2\\x14\\x49\\x22\\x53\\x4c\\x80\\x1a\\xc1\\x04\\xa6\\x6e\\x6c\\xc7\\x60\\xac\\xfd\\x1e\\xd0\\x62\\xde\\xc0\\xfe\\x52\\xeb\\x08\\x1b\\x71\\xa3\\x1b\\x51\\x57\\xf7\\x14\\x56\\x77\\xe8\\xe0\\x1e\\x14\\xae\\x00\\x3e\\x53\\xed\\x55\\x14\\xc2\\x57\\x12\\x81\\xbd\\x3d\\x97\\xdd\\x0f\\x20\\x92\\x51\\x22\\xcd\\x9e\\xd0\\xff\\x2a\\x1e\\x99\\x9a\\x72\\xf2\\x01\\xc8\\x6a\\x49\\x67\\x7a\\x4a\\xac\\xe4\\x2a\\xc8\\xf1\\xf6\\x41\\xe4\\x15\\x6f\\x6e\\xe4\\x78\\x23\\x3d\\xde\\xa8\\xa6\\xa3\\xc4\\x14\\xe6\\x63\\x56\\x85\\x8b\\x2a\\xba\\x81\\x8d\\xd1\\x9b\\x3e\\x83\\x17\\x8a\\x80\\xaf\\x40\\x16\\xb9\\xe0\\x1f\\x0a\\x5f\\x13\\xe4\\x81\\x5f\\x65\\xa4\\x48\\x67\\x51\\x55\\xe9\\x6b\\xd4\\x68\\x1b\\xc7\\x02\\xfd\\x8d\\x3e\\x1c\\x34\\xda\\x0d\\xb8\\xa2\\xb3\\x43\\xa0\\x16\\x29\\xba\\x4b\\x59\\x79\\x25\\x6b\\x10\\x69\\x85\\xdc\\x0a\\xdd\\x18\\x85\\xe2\\x7d\\x1b\\x1d\\x6a\\x43\\xbb\\x67\\xd5\\x62\\x0a\\xb7\\xbe\\x30\\x13\\x45\\x21\\xa1\\x9b\\x3b\\x01\\x64\\xcd\\xed\\x76\\x8f\\x65\\xaf\\xda\\xfd\\xae\\x3a\\x4d\\x9c\\xc5\\xff\\x7a\\xcf\\x15\\xf2\\x94\\xe6\\x8a\\x6a\\x18\\xf6\\x5d\\xe3\\xb8\\xe9\\x37\\x47\\x62\\x14\\xa5\\x41\\xb9\\x58\\xc8\\x6b\\x96\\x71\\x72\\xaa\\x71\\x7f\\xb8\\xc6\\x78\\xee\\x1c\\xf3\\xd7\\x41\\x32\\x6f\\x8e\\x96\\x85\\xf7\\x8c\\x77\\xcf\\xb8\\xfa\\xf4\\x04\\x52\\x42\\x1e\\x68\\x6b\\x08\\x9c\\x82\\xd3\\x52\\x5e\\x85\\x5b\\x4e\\x63\\x0f\\x1e\\x16\\xf8\\xd1\\x8b\\x31\\x48\\x87\\xb5\\xf0\\x72\\x73\\xc8\\x81\\x3b\\xc4\\xd8\\xb3\\xc6\\x90\\x73\\x77\\xe5\\x84\\xa8\\x0d\\x8b\\xd1\\x57\\xb1\\x16\\xaa\\xa4\\x7c\\x85\\xde\\x34\\x81\\x6d\\x0e\\x90\\x3a\\x7f\\xff\\x72\\xfe\\xbf\\x1d\\x9f\\x41\\x26\\x1d\\x1e\\x6a\\x6b\\xac\\xe6\\xce\\x80\\xfc\\xc6\\xc2\\x06\\x48\\xb2\\xe0\\xb2\\x1e\\x9a\\x0a\\xa3\\x98\\x9a\\x15\\x7b\\x6f\\xdd\\xef\\x9f\\x1b\\x4c\\x3d\\x00\\xda\\xd3\\x2a\\x43\\x3b\\xe8\\x5c\\x95\\x05\\x88\\x44\\x00\\x1f\\xd2\\x5e\\x4e\\xdc\\x85\\x22\\x7e\\xd6\\xe2\\x05\\x0d\\x02\\x9b\\xa6\\x14\\x69\\x0b\\xa2\\x47\\x96\\x66\\x6c\\xfa\\x44\\xab\\x1a\\xa1\\xa2\\x02\\xad\\xc0\\xce\\x46\\x76\\x30\\x05\\xd2\\x65\\x86\\x24\\xd1\\xbb\\x32\\x48\\x0a\\xbc\\x82\\x32\\x61\\xa2\\x97\\x1d\\xb2\\x86\\x4a\\x4d\\xd9\\x0c\\x19\\x51\\x93\\x61\\xdb\\x84\\xc2\\x1a\\xf5\\xfd\\x62\\x5a\\xcb\\xcf\\x02\\xa6\\xa3\\x29\\x56\\xe2\\xa8\\xcf\\xe3\\x0e\\xb4\\xb0\\x29\\xb3\\xbb\\x8b\\x28\\x2e\\x04\\xd0\\xc8\\xb6\\x74\\xe9\\x45\\xdb\\x62\\x25\\x79\\x4a\\x3f\\x57\\xf2\\x14\\x29\\xc9\\x53\\x5a\\x8d\\x36\\x3f\\x30\\xd3\\x01\\x66\\x90\\x84\\x4e\\x7b\\xc9\\x6a\\x5c\\x86\\x44\\x0c\\x99\\x26\\xfd\\xb4\\xa0\\x5b\\xff\\xc7\\x62\\x32\\xc5\\xfb\\x73\\xe0\\x1f\\x4a\\xab\\x81\\x4d\\x93\\x53\\xeb\\x4b\\xf9\\xf6\\xa9\\x76\\xb3\\xc2\\xcf\\xf8\\xd1\\x90\\x76\\xcf\\xee\\x21\\xfc\\xd4\\xba\\xde\\x62\\xd7\\x0d\\xbb\\x98\\xf4\\x5e\\x4a\\x4f\\x4c\\x0f\\xd9\\x14\\xa6\\xa6\\x50\\x25\\x72\\x28\\x68\\xa5\\xdd\\x88\\x05\\x59\\x9a\\x51\\xe5\\xb5\\x0a\\x42\\x45\\xb7\\x4c\\xab\\x0f\\x68\\x17\\xa1\\x6f\\x67\\x18\\xb5\\x08\\xa9\\x4f\\xe3\\xcd\\x60\\xdb\\x90\\xc8\\x07\\x79\\xb4\\x69\\x5d\\xed\\x4c\\x4a\\xd9\\x64\\x1c\\x68\\xa0\\x95\\x3e\\x63\\x71\\x4d\\x11\\x5d\\x76\\xc7\\xda\\x99\\x56\\x99\\xa2\\x5a\\x3b\\x34\\xb3\\xe6\\x48\\x3b\\xc1\\xc2\\xf9\\x45\\x2f\\x72\\x31\\x2e\\x3c\\x2b\\xdc\\x41\\x2f\\x9a\\xdd\\x43\\xb0\\x55\\x2b\\xd0\\x12\\xba\\x89\\xf6\\x39\\x34\\x29\\x2b\\x31\\xa6\\xeb\\x75\\x4d\\x31\\xb3\\xb0\\x67\\xbe\\x3c\\x3f\\xb7\\x77\\x52\\x38\\x1f\\x39\\x27\\x48\\x25\\x24\\x9f\\x49\\x7a\\x50\\xc0\\x61\\x3a\\x0a\\xe2\\x73\\x77\\xfa\\x34\\xa1\\x7d\\x8d\\x51\\x1d\\x71\\xe7\\xde\\x09\\xaf\\x84\\xde\\xb9\\xa6\\x25\\x56\\xba\\x6f\\xe4\\x21\\xb3\\xbb\\xc9\\x6d\\xa5\\x1e\\x55\\x1c\\x08\\x5a\\x9d\\xa8\\xa9\\x28\\xda\\x63\\xbb\\x7f\\x77\\x49\\xb2\\x1b\\x57\\x96\\x66\\xa6\\xf8\\x04\\x99\\x6d\\xf1\\x39\\x32\\xdb\\xe2\\xae\\x31\\xd3\\xf8\\x1a\\x97\\xea\\x94\\x69\\x9d\\x6a\\x38\\x10\\x44\\x69\\x43\\x7f\\x15\\x25\\x89\\xc8\\xe4\\x75\\x63\\x06\\xb8\\x6d\\xe6\\x49\\xcb\\x62\\x3f\\x4f\\xd0\\xcc\\x43\\x01\\xb2\\x9e\\x35\\x63\\x3e\\x85\\xcd\\x2c\\x22\\x99\\xb7\\x32\\xc4\\x8d\\x0c\\x78\\xe9\\xff\\x26\\x68\\xe7\\xc9\\xd3\\x5a\\x6a\\xa5\\xe4\\x54\\x09\\x3a\\x6b\\x15\\x1e\\x40\\x87\\xcc\\x76\\xa4\\x58\\x6a\\x60\\x18\\x6d\\xa5\\xb5\\x2f\\xbb\\x96\\x56\\x56\\x71\\x36\\x49\\xf9\\xa5\\xe2\\x6f\\x02\\x09\\x6e\\x95\\x93\\xcc\\x47\\xdb\\x2a\\xc3\\xc6\\xc2\\x89\\x5c\\x54\\xe0\\x63\\xa8\\x30\\x07\\x43\\x42\\x79\\x81\\x13\\x21\\x19\\x88\\x5e\\x0f\\x21\\x05\\x29\\x1b\\xcc\\x5c\\x0c\\xd0\\x56\\xc8\\x2f\\x4b\\x8a\\xbd\\xe3\\x62\\xec\\x27\\x72\\x39\\x07\\x5a\\x15\\x63\\x3f\\x49\\xab\\x8f\\x39\\x5f\\x79\\x39\\x5b\\xf3\\xa5\\xb7\\x60\\x3b\\x3e\\x77\\xe6\\xee\\xda\\x59\\xb3\\x33\\x2e\\xbc\\x8c\\x6d\\x79\\xee\\x2c\\xbd\\x95\\xb3\\x60\\x97\\xdc\\xea\\x8f\\xd7\\x13\\x6f\\xe0\\x0f\\xcc\\x78\\xbb\\x67\\xce\\x99\\xb3\\xf3\\xb6\\xce\\x16\\x7d\\xd7\\xad\\xad\\xb3\\xf6\\xe6\\xce\\xa5\\xdd\\xc3\\x8b\\x62\\x2c\\xf8\\x3c\\xf7\\xd6\\xf2\\xf5\\x9c\\x12\\x5d\\x95\\xf8\\x56\\x26\\xba\\x2a\\xf1\\x05\\xbf\\xf0\\x36\\xec\\x19\\xbf\\xf6\\xae\\xd8\\x2b\\x7e\\x0e\\xcf\\xcf\\xf9\\x5b\\xef\\x4a\\x83\\xcf\\x17\\xce\\x0b\\xf7\\x99\\xf3\\x6c\\xfc\\xca\\x79\\xe5\\x3e\\x77\\x9e\\xd3\\xed\\xfd\\xe7\\xd0\\xc0\\x5b\\x38\\x6e\\xd3\\x0b\\x2f\\x64\\xd7\\x48\\x0b\\x4d\\x2f\\x1c\\xd1\\x3b\\x63\\xd7\\xf8\\x77\\x66\\x5a\\xc0\\xb5\\x4f\\x95\\x09\\x7f\\x70\\xff\\xc5\\xf5\\x6d\\x9e\\xb0\\x89\\xf1\\x6a\\x81\\x00\\x65\\xd2\\x3a\\x44\\x26\\x4c\\xef\\x14\\x69\\xaf\\xe9\\x8c\\xcc\\x9b\\x70\\x52\\xb5\\xb2\\x6a\\xc9\\x5f\\x10\\xc6\\xdd\\xe0\\x6f\\x86\\x0a\\xb7\\xc5\\xe9\\x0a\\x99\\xa4\\x30\\x88\\x63\\x79\\xe1\\x08\\xc6\\x3f\\x5a\\x40\\x49\\x7b\\xa2\\x82\\xc3\\x4c\\xdd\\xa5\\x99\\x8c\\xc6\\x59\\xee\\xa6\\xf5\\x65\\x66\\xfb\\x79\\xed\\xa6\\x0c\\x7d\\xa4\\xe6\\x2b\\xa2\\xa3\\x4e\\xc3\\xa4\\x58\\x1f\\xed\\xb8\\x92\\x16\\xcb\\x70\\x0f\\x92\\xbe\\x79\\x86\\x4a\\xd3\\x57\\x68\\x73\\xf2\\x0a\\xe3\\x8c\\x2d\\x51\\x67\\x1a\\x75\\xdf\\x0a\\x0c\\x4c\\xd0\\x7d\\x52\\x5b\\x5d\\x6c\\x3f\\x1d\\x95\\x14\\x84\\x48\\x8a\\xee\\xee\\xd3\\xf5\\x4b\\x05\\x49\\x28\\x01\\x62\\x89\\x45\\x94\\x88\\x83\\xfa\\xac\\x43\\xc2\\x03\\x2a\\x58\\xde\\xd2\\x5d\\x2d\\x9f\\xa9\\x96\\x4a\\x79\\x2d\\xe1\\xe2\\x5a\\xc2\\x95\\x4c\\xe0\\x9c\\xf9\\xc0\\x5a\\xbe\\x88\\x89\\x85\\x47\\xbf\\x83\\x65\\x6a\\xd3\\x74\\x40\\x4b\\x29\\x41\\x3a\\x91\\x7c\\xce\\x0d\\x62\\xd4\\xc5\\xa0\\x01\\xd5\\x96\\x4d\\x98\\x22\\x57\\xe5\\xa5\\xa9\\x2a\\xda\\x98\\x39\\x28\\xbb\\xdb\\xf9\\xcb\\xb8\\x7d\\xf4\\x2a\\x6d\\xda\\xa7\\xd2\\x0d\\xc6\\xe6\\xad\\xf0\\xa4\\x11\\x9a\\xa2\\x12\\x83\\xfc\\x4d\\x50\\x89\\x51\\xd9\\xab\\x2a\\x75\\x6f\\xe7\\xfb\\x0e\\x23\\x35\\x87\\x8b\\x2b\\x30\\x2d\\x66\\x78\\x41\\x06\\x9e\\xf7\\xce\\x6f\\xb2\\x40\\xcd\\xab\\xa3\\xd5\\x9d\\x51\\x4a\\xea\\x46\\x0c\\xe5\\x43\\xd5\\xaf\\xf5\\xff\\x46\\xbf\\x7e\\xc3\\x7e\\xa9\\x1e\\x01\\x84\\xab\\x5a\\xac\\x54\\x30\\x07\\x1a\\xde\\xfd\\xaf\\x4d\\x48\\x35\\x15\\xfb\\xf3\\x70\\xa8\\xe1\\xb3\\xb4\\x65\\xdb\\xa4\\x98\\xb4\\x87\\x13\\x5a\\x36\\x9f\\x20\\xed\\x05\\x3c\\x2a\\xb9\\xed\\x80\\xa1\\x57\\xde\\x75\\xda\\xd6\\x6c\\x6d\\xef\\xa8\\xe7\\xa4\\xaa\\xa7\\x4f\\xf5\\x58\\x4a\\x94\\x92\\xd0\\x1a\\x24\\x54\\xd5\\xd4\\xa0\\x87\\x87\\xb3\\x99\\xbe\\xd5\\x23\\x41\\x62\\x03\\x86\\x69\\x37\\x5b\\xba\\xfc\\xc4\\x96\\x92\\x03\\xbd\\xbc\\x48\\x2b\\x99\\xb2\\x06\\x72\\xa7\\x03\\x8c\\x2e\\x25\\x9f\\x8f\\x78\\x1d\\x3d\\x61\\xff\\x9b\\x3b\\xb4\\xcd\\x1d\\x5d\\x7b\\x71\\xb6\\xf2\\xc1\\x7a\\x75\\x3a\\xac\\x0a\\x19\\x4d\\xf2\\x7e\\x19\\x3a\\x0e\\xbd\\x32\\x30\\x9e\\xcb\\x48\\xde\\x19\\x8f\\x16\\x33\\x9d\\x9f\\x3b\\xae\\x85\\x57\\x62\\x7a\\x43\\x07\\xef\\xca\\xec\\x9d\\xd8\\x74\\x7d\\xaf\\x85\\xf7\\x63\\xd2\\xb7\\x41\\xf5\\x0d\\xb3\\xa9\\x87\\x01\\xc9\\xb4\\xc8\\xbd\\x0d\\x95\\x9a\\xba\\xe9\\xf1\\x00\\x2f\\x6a\\x2b\\x94\\x69\\x36\\x7a\\x7a\\x84\\xae\\x8b\\x2e\\x12\\x9d\\xe7\\x50\\x25\\x32\\xd9\\x2e\\x36\\xa2\\x9a\\x40\\xce\\xdb\\xc5\\x06\\xaa\\x26\\x31\\x72\\x79\\x9d\\x4e\\x5d\\x08\\xaa\\xf4\\x46\\xf3\\x46\\xc4\\xe3\\xe1\\x28\\xae\\xa2\\x4e\\xa0\\x0e\\x00\\xdb\\xb4\\x55\\xf3\\xd8\\x19\\xc0\\x5d\\xd8\\x83\\xf3\\xcf\\x6c\\xe1\\xb6\\x56\\x8a\\xe6\\x54\\xd9\\xc8\\x9c\\x2e\\xe0\\xfd\\x83\\xf6\\x74\\xd1\\xb7\\x7a\\xba\\x72\\x5d\\x5b\\x8e\\xb5\\x69\\x1a\\xcd\\xb0\\x5e\\x4c\\xf7\\xc3\\x49\\x90\\xac\\x90\\xc2\\x17\\x90\\x25\\x53\\x52\\x93\\x2b\\x78\\x13\\x23\\x6a\\x6f\\x6a\\x81\\x61\\x70\\x1a\\x8e\\xec\\xda\\x50\\x07\\xcd\\x58\\x98\\xf2\\xa2\\x98\\x96\\x8e\\x95\\xea\\x78\\xdc\\x00\\x6a\\xf0\\x4d\\x87\\xe4\\x9e\\x1d\\x32\\x85\\x3f\\x4f\\x55\\x98\\x82\\x7a\\x3b\\xef\\x6f\\xb6\\x82\\xdc\\xeb\\xf7\\xc1\\x42\\x26\\x37\\x5a\\x26\\x37\\xda\\xb4\\x64\\xf8\\x1f\\x41\\x82\\x01\\x41\\x02\\xec\\xfb\\x14\\xba\\x09\\xff\\x11\\xdc\\xc0\\xb0\\x27\\x25\\x81\\x91\\x88\\xe1\\xad\\xdd\\xaf\\x52\\xeb\\x79\\x8c\\x01\\x6f\\xf0\\x93\\x7c\\x09\\x6c\\x15\\x17\\x45\\x9f\\x56\\x24\\xfa\\x6d\\x02\\x38\\xe8\\xcc\\x25\\xa1\\x0c\\xf0\\xad\\x5a\\x39\\xad\\x14\\x43\\x12\\xb2\\x06\\xd5\\xe7\\x40\\x7f\\x46\\xa3\\xaa\\xe7\\xa9\\x15\\x52\\xfc\\xa4\\x5a\\xa1\\x26\\x7d\\xb0\\xc2\\xfa\\x02\\x71\\xbc\\xff\\xe6\\x00\\x94\\x7a\\xbb\\x37\\x3d\\x0f\\x9b\\xd3\\x63\\x1a\\x2b\\x4e\\xd1\\xac\\x0d\\x3d\\x88\\xeb\\xa9\\x8a\\xb8\\x5c\\x48\\xf8\\x8b\\xb1\\x47\\x4e\\x4f\\xd0\\x58\\x91\\x0c\\xb1\\x94\\x91\\x90\\x54\\xe6\\xa6\\xfa\\x65\\xa0\\x9c\\x58\\x94\\x57\\x8b\\x9c\\x93\\x48\\x6e\\x2b\\x3d\\x5b\\x36\\xc3\\x28\\xf6\\x58\\x5b\\x69\\xd4\\xa6\\x47\\xde\\xaa\\xb7\\x35\\x4f\\x85\\x9e\\x10\\x41\\x91\\x86\\x6a\\xf1\\xf6\\xfe\\xd0\\x5f\\xa4\\x56\\x3b\\x66\\xef\\xde\\xe0\\x4a\\xf7\\xa1\\x56\\x32\\x4e\\xe5\\x00\\x1f\\xe2\\xce\\x84\\x2e\\x7d\\x59\\xce\\x74\\x9b\\x42\\xad\\x8d\\x7a\\xd1\\x43\\x2c\\xf8\\xf4\\xf0\\xfa\\x57\\xc3\\x8b\\x1a\\x75\\xb5\\x46\\x22\\x0e\\xaf\\xb8\\xd0\\x03\\x2c\\x1a\\x2b\\x5e\\x1c\\x18\\xe0\\xb3\\xb4\\x69\\x99\\xa8\\xe5\\x01\\xd2\\x28\\xc2\\xf0\\x78\\x52\\xe7\\x51\\x1f\\x49\\xe9\\x81\\x12\\x48\\x6f\\x93\\x2a\\x0a\\x3f\\x79\\x9e\\x50\\x18\\x59\\xf2\\x4d\\x8a\\xab\\xed\\x1a\\xe3\\x49\\x89\\x7b\\x82\\x70\\x31\\x2f\\x1c\\x49\\x39\\xe0\\x49\\x77\\xac\\xc8\\x2d\\xd1\\xba\\x18\\xb7\\x29\\xa5\\x0c\\xaa\\x94\\x14\\x52\\x6a\\x71\\x2a\\x9d\\x52\\xc3\\x4e\\x36\\xfd\\x98\\x1f\\xb8\\x8b\\x17\\xfe\\x39\\x68\\x58\\x00\\x4f\\x27\\xf8\\x74\\x62\\xde\\xb0\\x90\\xd6\\xee\\x3e\\xf2\\x04\\x3c\\xa7\\xf9\\x7f\\x16\\xa3\\xe1\\x8f\\x5a\\x0c\\x78\\x11\\xd5\\xcb\\x2b\\x33\\xe5\\x95\\x99\\xf2\\xdc\\x4c\\x79\\x8e\\x29\\xe6\\x25\\x0a\\x8d\\x8e\\xd2\\xee\\x53\\x57\\x7f\\xca\\x5b\\x03\\x08\\x19\\x1b\\x96\\xb2\\xf7\\x10\\x23\\xe4\\x16\\x23\\x35\\x2a\\x0d\\xf4\\x46\\xb3\\x0a\\xed\\xa0\\xb3\\x42\\xc3\\xb1\\x08\\xa6\\x10\\x68\\x55\\x4c\\x21\\x48\\x09\\x70\\xc3\\x25\\x73\\x89\\xde\\xb0\\x02\\x83\\x98\\x2d\\x35\\xc3\\x3f\\xbe\\xdc\\xdf\\xf3\\xb4\\xfc\\x64\\x54\\x48\\xbd\\x83\\x75\\xf7\\x4c\\x70\\x4c\\x8b\\x4d\\x00\\xb9\\xc0\\xb6\\x08\\x16\\xc3\\x1f\\x6c\\x8a\\x4c\\x34\\x28\\xa4\\x72\\x0a\\x5f\\x79\\x4a\\x5f\\x79\\xdf\\x07\\x52\\x1f\\x3f\\xf4\\xd0\\x69\\x56\\x7e\\x84\\x47\\xbc\\xbb\\x8a\\x5c\\x53\\x58\\x39\\xfe\\x8a\\x5c\\x35\\x4e\\x9c\\xc2\\xe0\\x4c\\xd1\\xe9\\x00\\x6b\\x29\\x1d\\xc1\\x54\\x4d\\xa5\\x93\\xa9\\x18\\x3e\\x01\\x57\\xdd\\xe0\\xd0\\x0f\\x72\\x1a\\xaa\\xa4\\x6f\\x21\\x83\\xbc\\xf6\\x4c\\x4e\\xb6\\x21\\x9e\\x0b\\x3c\\xf9\\x15\\x56\\xe2\\xb1\\x63\\x0d\\x5c\\xac\\xdc\\xc1\\x3f\\xb5\\xfd\\xe2\\xb4\\xbc\\xb9\\xe9\\x53\\xab\\x0e\\x3e\\xd5\\xe8\\xc3\\x30\\x06\\xfc\\xa5\\x49\\x91\\xdf\\x49\\x11\\xd1\\xc4\\x9a\\x97\\x42\\x1c\\x9a\\x68\\x2e\\xcd\\x54\\x6b\\x44\\x57\\x22\\x08\\x28\\xc8\\x62\\x95\\x49\\xbb\\x0d\\x94\\x29\\xe3\\x26\\x7a\\x13\\x50\\x04\\x06\\x6e\\xdc\\xa4\\x83\\x57\\x8d\\xe3\\x39\\x32\\xae\\xdb\\xa9\\xc5\\xc9\\x86\\xa9\\xea\\x37\\xf7\\xb1\\xad\\x78\\xa5\\xf7\\x55\\xcd\\xb6\\x06\\xc0\\xb6\\xae\\x6d\\x64\\x25\\x73\\x16\\xc3\\xf3\\xdc\\xb0\\x02\\xc5\\xaf\\xc0\\x5b\\xd4\\x0c\\xad\\xba\\x5b\\x19\\x37\\xcb\\x1c\\xff\\xac\\xf1\\xcf\\x0e\\x07\\x75\\x56\\x93\\x68\\x5b\\xc5\\xd9\\x5e\\xe2\\x6f\\x89\\xbc\\xbd\\xe0\\x9c\\x67\\x93\\x7d\\xa1\\xce\\xf2\\xd6\\x27\\xe6\\x17\\xf8\\x71\\x72\\x20\\x3e\\x90\\x65\\x43\\x59\\x68\\xdf\\xef\\x4e\\xcf\\x46\\x76\\x6a\\xb0\\xbb\\x28\\xa2\\xd8\\x41\\xfb\\xf6\\x04\\x7a\\x2d\\xd7\\x73\\xc9\\xdd\\xad\\x99\\x03\\x12\\xf1\\x7e\\xd3\\xcb\\xd6\\xb7\\x19\\xdd\\x22\\x2d\\x59\\xea\\x8b\\x76\\x7e\\xf7\\x7a\\x2f\\xb7\\xed\\xcf\\x6b\\x9e\\x1a\\x26\\xb0\\x1e\\x7d\\x35\\xfd\\x75\\x06\\x4c\\xd7\\xc1\\xdb\\x27\\x57\\x77\\x33\\xd6\\xcf\\x70\\x3f\\xf4\\x61\\x3b\\x00\\x87\\x9d\\x22\\x87\\x1d\\x20\\x87\\x8d\\x11\\xdc\\x91\\xa5\\x8c\\x39\\xc6\\xe9\\x46\\xbc\\xbd\\xf8\\xcf\\x78\\x6d\\x93\\x75\\xde\\xf6\\x3f\\x9f\\x43\\xdf\\x0e\\x3e\\x8f\\x45\\xff\\xff\\x3e\\x83\\xad\\x07\\x78\\x25\\x4b\\x45\\x54\\xe8\\x13\\x7b\\x67\\xf2\\xf4\\xbb\\x4f\\xec\\x9d\\xd9\\xce\\x67\\x09\\x10\\x52\\x59\\x30\\xfd\\x8f\\x04\\x08\\xe1\\x61\\x01\\x42\\x80\\x02\\x84\\xe0\\x90\\x00\\x01\\x56\\x5b\\x9f\\xbb\\x9b\\x1b\\x5c\\xf8\\xa0\\x1b\\xc6\\x69\\x2e\\xe6\\x13\\x38\\xa3\\x3e\\xee\\x02\\xe8\\x4b\\xf8\\xd9\\x22\\x86\\x85\\x1c\\xc4\\xa2\\x21\\x62\\x78\\x9d\\xb6\\x2c\\xfc\\x9b\\x82\\xcf\\x5f\\x8d\\xe4\\xa9\\x72\\x6b\\x32\\x83\\xae\\xa4\\x87\\x8c\\x25\\x6a\\xaf\\x8d\\xc3\\x17\\xe6\\xb6\\x41\\x9b\\xda\\xcf\\xd3\\x26\\x70\\x6b\\xc0\\x35\\xf3\\xaa\\xd8\\x6f\\x0d\\x59\\xef\\xe3\\x87\\x86\\x4d\\x7e\\xfd\\xbd\\x23\\x03\\xa7\\x1b\\x82\\x90\\x9f\\xd2\\x43\\xe1\\x61\\x92\\xde\\xbb\\x8a\\x66\\xea\\x9c\\xf5\\x81\\xe8\\x2c\\xdc\\xce\\x33\\xfa\\x2b\\x9f\\x1f\\xf4\\x1f\\x0c\\xd8\\xe0\\x01\\xa6\\x78\\x77\\x27\\x15\\x4d\\xa1\\xcb\\x0f\\xf7\\xcd\\x0a\\x13\\x23\\xb4\\x8d\\x82\\x29\\x99\\x26\\x18\\x8a\\x83\\x0c\\xf4\\x8a\\x6e\\x00\\x99\\xae\\x04\\x7d\\xf0\\x3c\\x14\\x7c\\x97\\x49\\x31\\x51\\xde\\x68\\x46\\xba\\xaf\\x3f\\xc9\\xf2\\x4c\\x27\\xb8\\x78\\xa9\\xbd\\xe8\\xc2\\xa6\\x49\\xf0\\x7a\\x00\\xf9\\x20\\xb7\\x6a\\x56\\x6e\\x0a\\x03\\x86\\xc9\\x10\\xc8\\x17\\xf3\\xa0\\x08\\x2e\\x2e\\x98\\x52\\xd0\\x34\\xc3\\x5f\\xa4\\x2d\\x7f\\xa1\\x1d\\xa0\\x05\\xf6\\x3a\\x26\\x1f\\xfc\\x60\\x2d\\xf2\\x4d\\x10\\x0a\\xf2\\x99\\x8e\\xe6\\xe8\\xe2\\x64\\x18\\x2e\\xa7\\xfb\\x0e\\x72\\xd1\\x9c\\x70\\x5c\\x55\\x50\\x03\\xaf\\x3f\\x21\\xeb\\x81\\x73\\x21\\x8c\\x4b\\x31\\xe5\\x95\\xb1\\xc9\\x34\\x9a\\x01\\x42\\xec\\x16\\xd7\\x42\\x24\\x64\\x26\\x02\\x84\\x04\\x30\\x0c\\x34\\x24\\x8c\\x06\\x50\\x0d\\x06\\xb3\\xc3\\x48\\x90\\xe0\\xc8\\xe8\\xc2\\x4e\\xe3\\x54\\x1c\\xaa\\x45\\x34\\x1d\\xc9\\x7f\\x6b\\x1c\\x05\\x79\\xf9\\x18\\x79\\x4a\\x74\\x9a\\x17\\x42\\xcb\\x48\\x47\\x62\\x5b\\x3c\\x4f\\x13\\x52\\xe6\\x24\\x66\\xe0\\xff\\x03\\x95\\x4c\\x3a\\x17\\x17\\x14\\x00\\x27\\xc2\\x2c\\x17\\x17\\x70\\x86\\x1b\\x1f\\x3a\\x6e\\xe2\\xc2\\x17\\x63\\x07\\x7d\\x71\\x50\\xac\\x2f\\xd0\\xc2\\x17\\x7f\\xf8\\x07\\xb9\\xea\\x7e\\x9f\\xd1\\x46\\xf1\\xfb\\xb7\\xa8\\x39\\x8c\\x80\\x33\\x52\\xd7\\xb3\\xa8\\x3b\\xd3\\xca\\x6e\\x11\\xad\\xc5\\x48\\x26\\xf1\\x0f\\x34\\x78\\x9f\\x2c\\x74\\x18\\x26\\xf8\\x01\\x3a\\x3c\\x06\\x3b\\xbf\\xec\\xd2\\x2f\\x9b\\x97\\x59\\x80\\x1d\\xc0\\x0f\\xea\\x91\\x89\\x20\\x17\\xf0\\x8e\\x3f\\x8c\\x36\\x0b\\xaa\\xb3\\x4a\\x19\\x34\\xd3\\x75\\x23\\xb9\\x55\\xd1\\xd9\\x1a\\x6b\\x34\\xae\\x8e\\x2f\\x1b\\x64\\x86\\x50\\xa1\\xdd\\x65\\xc7\\xc7\\x99\\xe6\\x2a\\x73\\x4b\\xb2\\xdc\\x80\\x04\\xa6\\x3a\\x75\\x36\\x2a\\xe9\\x18\\xe8\\xba\\xd5\\x9e\\x37\\x32\\xb0\\x52\\x6f\\xf5\\xf2\\xf0\\x56\\x6f\\xec\\x8b\\x52\\x6f\\x72\\xa6\\x2b\\xe0\\x80\\x64\\x75\\x0d\\xea\\x41\\x2a\\x75\\x0e\\x94\\xc6\\x5b\\x64\\xd5\\xb6\\xd1\\x8e\\xa7\\xb5\\x7e\\x0c\\x77\\x3a\\x46\\x19\\x3d\\x58\\x0e\\x0e\\xf3\\x95\\x0e\\xba\\x4e\\x17\\xe4\\xa7\\x72\\x16\\x17\\xf0\\x50\\x4d\\xef\\xfe\\xc4\\xd5\\xe4\\x4e\\x37\\xe4\\xb1\\x05\\x38\\x60\\x60\\x4f\\x5e\\x09\\x3f\\x66\\x83\\x5b\\x06\\x94\\xac\\xb1\\x65\\xe3\\xd6\\xbc\\x52\\x30\\x6c\\x55\\x7a\\x50\\xf1\\xea\\x40\\x6b\\xf7\\x16\\x40\\x50\\x50\\x98\\xfa\\xb0\\xbe\\x4b\\x26\\x1c\\xf7\\x47\\xf6\\xd5\\xd4\\xf3\\xc2\\x99\\xee\\x7f\\xcd\\x41\\x96\\x18\\x93\\xd2\\xda\\x9b\\x25\\x91\\xcc\\x0f\\xcf\\x51\\x8e\\x6a\\x61\\xa5\\x62\\xad\\xf5\\x59\\xd5\\x60\\xaa\\xd5\\x9c\\x54\\xab\\x99\\x55\\xd0\\xec\\xff\\x67\\xee\\xcf\\xbb\\xdb\\xc6\\x91\\x87\\x51\\xf8\\xef\\xf7\\xf9\\x14\\x1d\\xfd\\xa6\\x3d\\xa4\\x04\\x49\\xd4\\x6a\\x9b\\x0a\\xac\\x93\\x49\\xd2\\xdb\\xc4\\xe9\\x74\\x9c\\x5e\\x15\\x8d\\x0f\\x4d\\x51\\x12\\xdb\\x14\\xa9\\x70\\xb1\\xad\\xd8\\xfa\\xee\\x6f\\x55\\x01\\x20\\x41\\x89\\x72\\x9c\\xb9\\xbf\\xfb\\x9c\\x3b\\xd3\\xb1\\x48\\x10\\x6b\\x01\\x28\\x54\\x15\\x6a\\x21\\x1f\\x9d\\x1d\\x22\\x87\\xc8\\xd1\\x32\\xc2\\x87\\xd6\\xe3\\x9a\\x7b\\x2e\\x51\\x98\\xa3\\x1c\\x24\\x29\\x5f\\x34\\x1c\\x60\\x1a\\xf8\\x62\\xec\\x52\\x64\\x17\\x6a\\xd4\\x40\\x58\\xb9\\xa6\\x84\\x8f\\xa6\\xb7\\xae\\x71\\x7e\\x4e\\x9a\\xc6\\xd2\\xe1\\x15\\xea\\xa5\\xd6\\x4a\\xf8\\x41\\x86\\x53\\x31\\x72\\xdf\\x45\\x25\\x97\\x55\\x85\\x52\\x70\\x6c\\x8e\\x63\\x5b\\x28\\xdf\\xd7\\x98\\x65\\xd6\\x74\\xc3\\xc7\\xdf\\xff\\x37\\x1a\\xb3\\xd8\\xa1\\xe6\\xca\\x8d\\xfd\\x54\\x3e\\xb8\\xd3\\xe8\\xc7\\x8b\\x9f\\x2f\\xd2\\xd8\\x0f\\x17\\xfa\\x3d\\xf9\\xf7\\x8f\\x6b\\x30\\x84\\x25\\xa5\\xf6\\xcc\\xd0\\x42\\xc1\\x86\\x82\\x77\\x15\\x72\\xaf\\xb6\\x27\\x7c\\x99\\xc9\\xfb\\xf4\\xdf\\x30\\x46\\x59\\xa1\\x0e\\xc4\\x7f\\xcb\\xaf\\x8e\\xe0\\xa4\\xda\\x78\\x4e\\x4c\\x16\\x19\\x87\\x94\\x0e\\xc3\\x76\\xaf\\x33\\xe8\\x0d\\xbd\\x21\\xec\\x09\\x0f\\xcd\\x59\\xa6\\xb6\\x3f\\x4e\\x27\\x59\\xfb\\xb7\\x60\\xe2\\x37\\x3b\\xd3\\xe7\\xf8\\x3b\\x6d\\x67\\x63\\x78\\xb1\\xfd\\xa9\\x3d\\xf9\\x57\\x20\\x2c\\x3c\\x44\\xe6\\xed\\x13\\x54\\x68\\xff\\x1d\\xfd\\xef\\xe8\\xd0\\xa6\\xa4\\x51\\x9a\\xbf\\x0a\\x3d\\xca\\x7f\\x47\\x55\\xca\\xae\\x87\\xb4\\x11\\x9e\\x29\\x3f\\x88\\x47\\x47\\xcf\\x94\\x81\\xa4\\xc7\\xa0\\x83\\x0d\\xaf\\x81\\x6e\\xf7\\x94\\xe6\\xb3\\x50\\xf5\\xe0\\xb9\\xaa\\x2c\\x22\\xf4\\x77\\x3e\\x39\\x14\\x56\\x91\\x30\\xc7\\x99\\x11\\xb1\\x8e\\x65\\xda\\xb5\\x90\\x54\\x7a\\x35\\x6a\\x12\\x10\\x21\\x69\\x29\\xab\\x49\\x71\\xe8\\xe0\\x72\\x84\\xf6\\x07\\xc9\\x7d\\x73\\x10\\x18\\xdf\\xa1\\x17\\x83\\xf4\\xac\\x53\\x65\\xb5\\x48\\x7a\\xee\\x1e\\xea\\x2d\\x28\\xa3\\x45\\x72\\x27\\xc3\\xa1\\xbf\\x29\\x70\\xd0\\x39\\xe7\\x51\\x61\\xc5\\xa8\\x15\\x15\\x46\\x8c\\x79\\x49\\xa0\\x8f\\xf4\\xa2\\x5b\\x5b\\x6a\\x00\\xef\\xea\\x1f\\x17\\xc2\\x29\\x54\\xe7\\xcf\\x01\\x41\\x6e\\xfb\\x73\\x08\\x78\\x07\\x20\\x40\\x9f\\x80\\x07\\x57\\x40\\x3e\\x3a\\x9a\\xdc\\xd3\\x03\\xa9\\x26\\x14\\x16\\xa0\\x04\\x18\\x5f\\x00\\xc6\\x27\\xc0\\xe4\\xb3\\x82\\x89\\x34\\x31\\x28\\x50\\x82\\xb9\\xe9\\x9c\\xa1\\xc1\\x79\\x7a\\x50\\x0f\\xba\\xd0\\xc1\\x78\\x4c\\xe5\\x38\\xfa\\xb2\\xca\\x71\\x69\\x2b\\xc3\\xe9\\xfc\\x0a\\x11\\x81\\x9e\\xe3\\x17\\x3d\\xc7\\x4f\\x17\\x3f\\xbf\\x45\\xa3\\xed\\x04\\x15\\x7c\\x63\\xa0\\xaa\\xa2\\x30\\xf1\\x3e\\x00\\x3d\\xa2\\xeb\\xa9\\x39\\x05\\xb9\\x9b\\x01\\xfb\\x10\\x7b\\x50\\xe5\\x7b\\x61\\x9d\\x5b\\xb0\\x8f\\x09\\xa0\\x5f\\x37\\x7d\\x1b\\xcd\\x3c\\x03\\x32\\x5d\\x45\\xb3\\x0d\\xde\\x70\\x88\\xcc\\x44\\xdc\\xdc\\xa5\\x99\\x13\\x7c\\x17\\x3b\\x8b\\x15\\x85\\x49\\xdd\\x69\\x8d\\xaa\\x77\\xf8\\x3d\\x72\\x2a\\x48\\x34\\xd4\\x7a\\xad\\x41\\x6b\\x50\\xdb\\x02\\xc9\\x00\\x28\\x5b\\xdc\\x63\\xb1\\xd8\\xa9\\xe2\\x4e\\x3c\\x47\\x9e\\x22\\xa8\\xd8\\x23\\x03\\xb0\\xcc\\x22\\x97\\xf6\\x21\\x59\\x63\\x39\\x66\\x1a\\x6f\\x60\\x02\\xb1\\x63\\xea\\xc3\\xeb\\xc0\\xc3\\x1f\\x61\\xcb\\x8d\\xbd\\x4e\\x50\\xe8\\x4e\\x7e\\xa1\\x3e\\xc0\\x2a\\xd8\\xba\\x0e\\x7a\\xb0\\xf7\\x81\\x66\\xdc\\x69\\xb4\\x32\\xb6\\x6a\\x11\\x9c\\x22\\x35\\x47\\x29\\x06\\x43\\xf2\\x50\\x3e\\x86\\xf2\\xf6\\x5c\\x4c\\xbc\\xc5\\xbb\\x11\\x9c\\x0d\\x68\\xe4\\x16\\x88\\x2f\\xf5\\xb8\\x3f\\xcf\\x0d\\x35\\x6f\\x80\\xd4\\x64\\xe7\\x73\\xb8\\xcb\\x7e\\x1b\\xb5\\x57\\x3f\\xfe\\x56\\x33\\x81\\xd0\\xd8\\x04\\x1e\\x92\\xa0\\xef\\xe2\\x68\\x0d\\x18\\x6a\\x63\\xd4\\x22\\xa0\\x8c\\xfd\\x74\\x03\\x27\\x0a\\x43\\x91\\xad\\x18\\x48\\xe4\\x48\\x32\\x4e\\xc2\\x47\\x0d\\x7f\\x1d\\x47\\x69\\x84\\xcb\\x9e\\xb9\\x0e\\x77\\x1c\\xac\\xe9\\x05\\x9c\\x36\\xfe\\x55\\x86\\x2e\\x23\\xf7\\x92\\xde\\x5e\\xb0\\x44\\xd6\\xf0\\xf2\\xe2\\xe2\\x02\\x1b\\x7f\\xe5\\xb9\\x81\\x23\\xe8\\x0f\\xad\\xb6\\xb9\\xc3\\x13\\x47\\xef\\xd7\\x68\\xa7\\xa6\\x9d\\xad\\xea\\x3a\\x1a\\x5b\\x01\\x29\\x0d\\xec\\x3a\\xdb\\x6b\\xbd\\x54\\x0a\\xcf\\x97\\x60\\xa7\\x1c\\xf3\\x44\\xc9\\x72\\xe3\\x7b\\xc5\\xe6\\xfb\\xcd\\xe1\\x76\\xda\\xc2\\xb1\\xe4\\x24\\x2e\\xd0\\x25\\x70\\xf4\\xa1\\x37\\x04\\x58\\x2f\\x5e\\xfe\\x5e\\xee\\xb1\\xda\\x62\\xa8\\xc2\\x0f\\x1b\\xfb\\x2c\\xc4\\xed\\x7d\\xc6\\xd1\\xfa\\xcb\\x6a\\x5b\\x5b\\x26\\x7c\\x07\\x55\\x61\\xa4\\x0a\\x71\\x9d\\xf0\\xc3\\xc2\\xf7\\x14\\xe2\\x05\\x22\\x94\\xc2\\x3c\\xbc\\x49\\x11\\xee\\xb9\\x62\\x12\\xeb\\xa1\\xef\\xc5\\x33\\xa0\\xd1\\xee\\x81\\x04\\x95\\xfe\\x5c\\xf4\\xec\\xbb\\x79\\x81\\x50\\x16\\xf6\\xea\\xc2\\x88\\xe8\\x60\\xd5\\x05\\xdd\\x8a\\xa2\\xc3\\xcc\\x7c\\x6a\\x33\\x15\\xe5\\xb4\\x26\\x0b\\xec\\x26\\xbc\\x3f\\xfc\\x7f\\x08\\x30\\xf1\\x99\\xf7\\x7f\\x1b\\x30\\x5a\\x93\\x25\\xc0\\x78\\xbb\\x31\\xae\\x77\\x23\\x24\\x90\\xa7\\x97\\x27\\x43\\x87\\xfc\\xc0\\x94\\xa1\\xe3\\xeb\\xd0\\xc9\\x76\\x3b\\x4e\\x05\\x76\\x73\\x1b\\xc5\\x34\\xb2\\x98\\xdc\\x48\\x40\\x39\\xb3\\x0c\\xac\\xbd\\x96\\xb4\\x41\\xfb\\x53\\xf4\\x3a\\xf4\\xe4\\x56\\x2b\\x4a\\x1e\\xea\\x81\\x92\\xf5\\xb0\\x6c\\x4a\\xe0\\x4b\\xb2\\x55\\x35\\xec\\x48\\x1a\\xaa\\x45\\x02\\x10\\x17\\x55\\x95\\xb0\\x93\\x7d\\x8a\\x70\\x0a\\x81\\x0c\\x40\\x6f\\x62\\x11\\x41\\x21\\x6e\\x70\\x4f\\xc4\\xfa\\xf9\\x66\\x2f\\x8f\\xd6\\xe7\\x68\\x8a\\xd7\\x8c\\x79\\xfe\\xfc\\xd6\\x98\\xd6\\xbd\\xe7\\x54\\x63\\x04\\x9f\\x02\\x5c\\xe4\\x1d\\x94\\xf7\\x24\\xd1\\x97\\x3a\\xe9\\x20\\xe0\\x32\\x12\\x51\\x84\\x74\\xfd\\x30\\xf6\\xa1\\x51\\x1b\\x98\\xb0\\x52\\x3f\\xb5\\x6c\\x5a\\x47\\x9d\\x29\\x89\\x38\\x8a\\x22\\xb2\\xab\\xee\\xd8\\x6f\\xbb\\x8a\\xfb\\x62\\x9a\\x96\\x79\\x25\\x75\\xa5\\xd9\\x60\\x98\\x75\\xa0\\xcd\\x58\\x5c\\x32\\xc7\\x46\\x07\\x4f\\x00\\x41\\x0c\\x25\\x8e\\x6e\\xac\\x9a\\x85\\xcb\\xb5\\x31\\xfa\\x0e\\x32\\xf0\\x02\\xb6\\x99\\x09\\xd1\\x2b\\xc2\\x67\\xe6\\x57\\x42\\xc8\\xcf\\xcd\\x31\\x15\\x88\\xdc\\x27\\xcc\\x21\\x39\\xcf\\xcc\\xd0\\x30\\xc8\\x40\\x55\\x04\\x9c\\x15\\x65\\x0b\\x59\\x9e\\x48\\x2d\\xa3\\x06\\x20\\x54\\xc4\\x30\\xcb\\x85\\x72\\xbd\\x78\\xe5\\x0e\\x48\\xd3\\xc1\\x8f\\x72\\x5d\\xf7\\xd6\\xc0\\xd4\\xe1\\x07\\x03\\x80\\x51\\xed\\x11\\xf8\\x72\\xe6\\xcb\\xf3\\x6e\\xc1\\xc0\\x2c\\xba\\x07\\x65\\x89\\x70\\x1d\\xfa\\xd8\\x00\\x03\\x7d\\xfe\\x03\\x1a\\x20\\x3a\\x21\\x6b\\x3a\\xcc\\x41\\xb7\\x2e\\x8d\\x46\\xc2\\x5c\\x78\\xa8\\x1b\\x1e\\xda\\x46\\x94\\x86\\x1c\\x54\\xae\\x89\\x60\\xca\\x02\\xf3\\x4b\\xd5\\x28\\x69\\x0b\\x50\\xfd\\x6e\\xdb\\x48\\x60\\xe2\\xf5\\xd1\\xce\\xbc\\x1b\\x9f\\xa8\\x01\\xbe\\x23\\xad\\x24\\xbf\\xea\\x0a\\x16\\xd5\\xd2\\xdc\\xfc\\xc6\\x69\\xac\\x89\\x55\\x51\\x1f\\x98\\xc4\\x3a\\x4b\\x87\\xfb\\x68\\x60\\x9f\\xf3\\x8e\\x6f\\xbc\\x79\\xca\\x97\\xa8\\xa5\\x3f\\x27\\xa1\\x91\\x48\\x2d\\x78\\xcb\\xf7\\xfe\\x62\\x49\\x19\\x62\\x7c\\x28\\x72\\x44\\x71\\x15\\x19\\xe9\\x13\\xa8\\xd5\\x5c\\x8c\\x35\\x85\\xe2\\x58\\xb3\\x98\\x97\\x7c\\x1c\\xf2\\x1d\\x02\\xe5\\x2c\\xb3\\xf9\\x7c\\x67\\x6f\\x20\\x85\\x01\\x00\\xdc\\x9b\\x35\\x32\\xa2\\xd1\\x74\\x41\\xba\\xe4\\x81\\x27\\xe5\\x96\\x59\\xe8\\x42\\x48\\x7f\\x6f\\x18\\xeb\\x18\\xaf\\x23\\x4b\\xde\\x56\\xeb\\x7e\\xb3\\xf9\\x60\\x91\\x0a\\x89\\xdf\\x48\\xf1\\xae\\x14\\x7f\\xf0\\x18\\x13\\x6f\\xf8\\xc3\\xe3\\xe2\\xda\\x0e\\xfb\\x07\\xf4\\xcf\\x6a\\x9f\\xdc\\x2a\\x3c\\x26\\x6a\\xfa\\x4f\\x05\\x11\\x8b\\x78\\x0e\\x89\\xd8\\x58\\x84\\x35\\xc1\\x08\\x26\\xd3\\x32\\x26\\x5b\\x3b\\x7e\\x9c\\x54\\xd3\\xc5\\xd2\\xf3\\x94\\x76\\xf7\\x5c\\x5c\\x3b\\xe7\\x2d\\x58\\x67\\x31\\x10\\x4a\\x78\\xc7\\x78\\xe6\\x49\\x8f\\x8c\\x93\\x94\\xdc\\xe8\\x84\\x93\\x46\\x43\\x6b\\xce\\xa7\\xe6\\x3e\\xfb\\x6b\\x7d\\x39\\x51\\xe8\\xac\\x78\\x1f\\xc0\\x52\\x5c\\x35\\x29\\x14\\x9d\\x42\\x72\\x52\\xcf\\xa5\\x23\\xc7\\xbc\\x00\\xea\\x4d\\xec\\x50\\xed\\x8d\\x46\\xf8\\x3c\\x1d\\xe9\\xaa\\x0b\\x82\\x14\\xf1\\x26\\xe1\\x54\\xcb\\x49\\x0a\\xb5\\x19\\x9a\\xe1\\xf8\\xe8\\xd0\\x27\\xaf\\x11\\x5e\\xd0\\x47\\x6c\\xe9\\x34\\x27\\x41\\xcc\\x3a\\x4a\\x2a\\xef\\x76\\xc4\\xa8\\x0a\\xbf\\x13\\x72\\x3d\\x5d\\x7b\\x9b\\x32\\x5c\\x95\\x7f\\xe6\\xc2\\x79\\xb2\\x08\\x01\\x95\\x2a\\x6b\\x4e\\x8d\\x8f\\xa6\\x0d\\x16\\x64\\xde\\x57\\xd5\\x10\\xea\\xe1\\xa0\\x44\\x25\\x30\\xa0\\xd8\\xff\\xba\\x5a\\xee\\xa1\\xe3\\xb6\\xc7\\xa8\\x79\\x1b\\xab\\xdc\\xee\\xd4\\x49\\x1e\\x5c\\x0f\\xad\\x18\\xa2\\xfc\\x34\\xdd\\x18\\x22\\x73\\x2c\\x22\\x0d\\xb2\\x91\\x19\\x35\\x88\\x14\\xd1\\xed\\xa1\\xf4\\xc9\\x8b\\xcc\\x51\\xb3\\x99\\x91\\x33\\x33\\xfc\\x24\\xe8\\x3a\\x98\\xf4\\xdc\\x4c\\xb4\\xd9\\x4c\\x85\\xd3\\xdd\\x49\\xb3\\x89\\xc1\\x9a\\x4a\\x5c\\x19\\xa1\\x96\\x85\\xb4\\x25\\x77\\xae\\x92\\x91\\xb2\\x78\\xdd\\xdb\\xd2\\xb0\\xea\\x2a\\xcd\\xe2\\xd0\\xc3\\xea\\x81\\x40\\x2c\\x80\\x53\\x71\\x77\\x33\\xb2\\xc7\\x69\\xe3\\x6d\\x75\\xa7\\x6d\\x99\\xe9\\x32\\x8e\\x6e\\x89\\x39\\x7f\\x1d\\xc7\\xd0\\xe3\\x9a\\x1f\\xce\\x49\\x44\\xf7\\x8d\\x30\\x28\\x55\\x06\\xee\\xd2\\x2b\\x93\\x83\\x8e\\x2b\\x3c\\xf4\\x83\\x20\\xcf\\xbc\\xb0\\x8e\\x4e\\x13\\xf1\\x8f\\x87\\x7f\\xac\\x33\\xa1\\x71\\x33\\xc2\\xa1\\x37\\xbc\\x3a\\x10\\x26\\xe6\\x59\\x9a\\x6b\\x98\\xc6\\xed\\xd2\\x69\\xa7\\x65\\x7a\\xbe\\x93\\x49\\x49\\x6b\\x25\\x8d\\xbe\\xae\\x3c\\xf0\\x85\\x4d\\x2e\\xf6\\x02\\xe6\\x3f\\x49\\x11\\x99\\x47\\xf3\\x6f\\x02\\xb3\\x42\\xa2\\x4d\\xa5\\x88\\x3b\\x15\\x16\\x1b\\xb2\\x1b\\x50\\x96\\x26\\xae\\xe5\\x27\\x32\\xa0\\xa3\\xf4\\x2d\\xf8\\x74\\xf2\\x5f\\xa7\\xb3\\x45\\x03\\x19\\x51\\xd7\\xe5\\x33\\x4e\\xfb\\x9c\\x9f\\x71\\x72\\x75\\x64\\x84\\xc4\\xf3\\xcc\\xe4\\x86\\x49\\x86\\x56\\xa3\\xfc\\x91\\xf0\\x47\\xb5\\xb3\\x4c\\xd6\\x0e\\xaf\\x5d\\x5e\\x12\\x97\\x7b\\x79\\x59\\x83\\xc5\\xce\\x6b\\x1f\\xef\\x2c\\xab\\x36\\x72\\x8d\\x80\\xdd\\x2f\\x9d\\xc4\\x5e\\x32\\xf4\\x2b\\x5c\\xb5\\xdd\\xe9\\xaa\\x6c\\x92\\x18\\x68\\x64\\xc7\\x92\\x52\\x26\\xdd\\x1f\\x8d\\x96\\x8d\\xa3\\xf5\\x39\\x45\\x74\\xb6\\x17\\x0c\\xf1\\x82\\xbd\\x16\\xfb\\x2b\\xb1\\xf7\\x8e\\x56\\x6d\\x5f\\xa6\\x14\\xf3\\x8d\\xea\\x31\\xa5\\x8a\\x92\\xac\\x35\\xd5\\x3c\\xa5\\x6c\\x99\\xdc\\xe4\\x5f\\x5b\\x17\\x6d\\x74\\xb2\\xc1\\x12\\x7b\\x3d\\xaf\\x7b\\xab\\x57\\x9e\\xf8\\x9f\\x3d\\xfb\\x86\\x79\\xab\\x75\\xba\\xb1\\x67\\x4c\\x2e\\x0d\\xbb\\x72\\xfb\\x97\\xda\\x28\\xd8\\x72\\x61\\xe7\\x95\\xf7\\x7c\\xbb\\x25\\x2f\\xbc\\xa1\\x97\\x94\\xa4\\x66\\x85\\x94\\x4a\\x6a\\xad\\xd1\\x36\\x3d\\x2b\\x9c\\x5f\\xab\\x63\\x6b\\x2c\\xef\\x55\\x32\\x74\\x27\\xe2\\x8d\\x73\\x6a\\xcd\\x8e\\x46\\x85\\x55\\x85\\x0c\\xce\\x88\\xab\\x70\\x5d\\xf8\\x62\\xbf\\xe1\\xfe\\xc4\\x69\\x34\\x50\\x35\\x45\\xac\\xfe\\x46\\x63\\xf1\\x7c\\x3d\\x32\\x8d\\x25\\x9f\\xd1\\x85\\xbb\\xcb\\x6f\\xd0\\x7d\\xc6\\x64\\x81\\x3a\\x52\\xe3\\xa5\\x00\\x54\\x82\\xba\\x1d\\xb8\\x96\\x5c\\x36\\x49\\x34\\x0c\\x3b\\x86\\xac\\xa8\\x74\\x37\\xe7\\xe5\\xab\\x9f\\x44\\x99\\xe9\\x23\\xc5\\x41\\xd6\\x1e\\xa6\\x0d\\x59\\xef\\xb7\\xfb\\x39\\xe9\\x58\\x96\\xd9\\x00\\x2c\\xb3\\x62\\xeb\\x99\\x4c\\xbb\\x70\\x17\\xc6\\x6a\\xe4\\x75\\x64\\x1f\\x20\\xa1\\x40\\x32\\x42\\x2d\\x2c\\x9a\\x78\\x30\\xbe\\x42\\xc5\\xb3\\x62\\x2b\\x67\\xb0\\x46\\xb5\\x15\\x10\\xaa\\xa5\\x88\\x5b\\x0f\\x2f\\x3f\\x51\\x56\\x05\\x30\\x26\\xa8\\x56\\x2e\\xed\\x0c\\x58\\x05\\x32\\x69\\xc0\\xbf\\x38\\x38\\x61\\x91\\x28\\x70\\x3f\\x8c\\x52\\x6a\\x8a\\x15\\xf7\\x33\\x59\\x19\\x07\\x95\\xbc\\x4e\\x52\\x8c\\x1a\\x0b\\x05\\x7e\\xfb\\x87\\x95\\xe6\\xbc\\x00\\xc9\\x35\\x42\\x65\\x70\\xc4\\xa0\\xcb\\x43\\x2a\\x00\\xcd\\x57\\xd2\\x7f\\xb9\\x2f\\xf5\\x0c\\x73\\xe1\\x40\\xfe\\xbd\\x7b\\x18\\x2b\\xfa\\x7f\\xe2\\x17\\x16\\x90\\x68\\xc6\\xa8\\x0a\\xfc\\xb6\\x7f\\xfa\\x2a\\x0c\\xa2\\xb2\\xc5\\x51\\x10\\x64\\x95\\x4e\\xd0\\x62\\x99\\x45\\xd0\\x95\\x5e\\x5a\\x71\\xfc\\xe2\\xf2\\x5b\\x11\\xf2\\x35\\x0b\\x12\\x4e\\xa7\\xb6\\x88\\x9e\\x42\\x8f\\xde\\x69\\xcb\\x99\\xcd\\xf6\\xce\\x76\\xd7\\x58\\x29\\x3c\\x05\\x9f\\x1f\\xc7\\x53\\x18\\x56\\x11\\x90\\x10\\x06\\x71\\xd5\\xf0\\x90\\x9c\\xf5\\xf5\\xff\\xd6\\x0e\\x57\\xfb\\xfa\\xca\\x5b\\x3a\\x37\\x7e\\x44\\xd1\\x2e\\x73\\xb7\\x67\\x87\\xa8\\x56\\x18\\x30\\x52\\x95\\xbb\\xc7\\x82\\xd2\\xeb\\x85\\x51\\x6b\\x84\\x59\\x3c\\x9d\\xf2\\x73\\x3a\\xc3\\x4b\\x81\\x2f\\x25\\x53\\x31\\x73\\xf8\\xa4\\x76\\xeb\\x5d\\x5d\\xfb\\x18\\x2b\\x60\\x95\\xe0\\x9f\\xe8\\x33\\xfc\\x3d\\xa7\\xbf\\x11\\xfc\\xfb\\xb9\\x36\\x45\\xa2\\x60\\xe6\\x27\\x6b\\x94\\xa5\\x96\\xb0\\x4f\\x4e\\x66\\xe2\\xcc\\x5c\\x32\\xe9\\xb4\\xbd\\xa2\\x63\\xa4\\x5b\\x09\\x4c\\x77\\xde\\xad\\x14\\xba\\x75\\x5b\\xdc\\xda\\x21\\xd2\\xbc\\x2c\\x04\\xa8\\xad\\xa8\\x52\\x50\\x80\\x3a\\x10\\xd2\\xac\\xb3\\xd6\\xaa\\x99\\x64\\xb4\\x30\\x12\\xfb\\xdb\\x22\\xb7\\xed\\xca\\xe2\\x83\\xee\\x83\\x0a\\xbf\\x8c\\x18\\x10\\x04\\x0d\\x37\\x0e\\xdc\\x52\\xa1\\xfb\\x1d\\xa1\\x04\\xd2\\x22\\xef\\x1c\\xb6\\xfe\\x26\\x5d\\x9d\\x75\\x2b\\x05\\x4d\\x52\\xe4\\x83\\x51\\x3e\\x48\\xf3\\x5c\\xcd\\xb4\\x49\\xd3\\x0d\\x2b\\xed\\xe7\\xdb\\x30\\x17\\x4d\\xa3\\xd3\\xee\\x52\\xcd\\xa5\\x00\\xe3\\xf8\\x65\\x2b\\xc8\\xcf\\x1b\\xd2\\x84\\x40\\xa5\\x00\\x5a\\x0a\\x9f\\xb2\\xa8\\x5a\\x3f\\x0a\\x2f\\x11\\xd6\\x81\\x03\\x03\\x5c\\x39\\xac\\xf6\\xf1\\xe3\\x3f\\x8e\\x6a\\xa6\\x98\\xd6\\x95\\xc3\\xdb\\x93\\x8f\\x1f\\x3f\\xfe\\xe7\\xe3\\x3f\\x3e\\xd6\\x3f\\x36\\x3e\\x8e\\x3f\\x3e\\x7c\\x9c\\x7c\\x9c\\x7e\\x34\\x3e\\x9a\\x1f\\x5b\\x1f\\xef\\x3f\\x6e\\xa7\\xed\\x05\\xdb\\x38\\xb0\\xda\\x5a\\xf9\\x81\\x3e\\x2e\\x03\\x3c\\x2c\\xbe\\xc0\\x49\\x6c\\x1f\\x58\\x8a\\x22\\xc0\\x6a\\xa8\\x02\\x3d\\x6e\\xd9\\xb9\\x53\\x2d\\x28\\x4e\\x5b\\x9f\\x32\\x2f\\xde\\x5c\\xd0\\x35\\x09\\x82\\x0a\\x70\\xd1\\xdd\\xd3\\xf2\\xbe\\x90\\x97\\x1b\\x57\\xbb\\xd9\\xd5\\x9a\\x58\\xe1\\xba\\xf4\\x92\\x87\\x87\\x70\\x82\\x6e\\x75\\x6b\\xf2\\x5d\\x95\\x87\\x6d\\x2c\\x81\\x6c\\xec\\x55\\x91\\x2b\\xb1\\x4b\\xfa\\x08\\xc9\\x34\\xf1\\x33\\xaa\\xd0\\xa8\\xb9\\xf0\\x3f\\x7f\\x0e\\x50\\x74\\x79\\x68\\x94\\x22\\x83\\xf0\\x2d\\x88\\x61\\x82\\x48\\x35\\x11\\xc7\\x29\\x3e\\xe0\\x10\\xc4\\x53\\x6b\\xa7\\x8f\\xa6\\x40\\x7a\\xf8\\xb2\\x23\\x3b\\x28\\xf8\\x25\\xf1\\xb9\\xe2\\x16\\x47\\x4e\\xfa\\xa5\\xc3\\xf5\\x4a\\x8a\\xdd\\x84\\x87\\xca\\xa5\\xfa\\xb2\\x8f\\x56\\x35\\x55\\xe5\\x51\\xc8\\xdf\\xea\\xa6\\x09\\xd2\\xe3\\x8c\\x88\\xf6\\x5f\\x72\\x3a\\x73\\xaf\\x8c\\x05\\x50\\x57\\x93\\x29\\xcf\\xc7\\x78\\x93\\x44\\x42\\x4c\\x5c\\xe6\\x40\\x40\\x6a\\xc9\\x05\\x99\\x81\\x75\\x06\\xba\\x17\\x1b\\xf7\\x79\\x20\\x22\\xd4\\xa2\\x94\\x6a\\x6c\\x28\\xd6\\x8e\\x87\\x8a\\x64\\xc9\\x0a\\xf5\\x08\\x97\\xac\\x18\\x60\\x0e\\x6a\\x2a\\x09\\xd8\\x87\\x6f\\xc8\\xb9\\x6f\\x9e\\x89\\x17\\xf9\\xd1\\x79\\x82\\x3c\\xd8\\x70\\xb3\\x29\\x71\\xf3\\x0b\\xc3\\x87\\x05\\x95\\xc3\\x04\\x56\\x58\\x35\\x58\\x04\\x48\\x5e\\xea\\x20\\x91\\x34\\x7a\\x19\\x24\\x44\\x6a\\x17\\x40\\xa3\\xe1\\x67\\xd3\\x5c\\x90\\xb9\\x63\\x7f\\x23\\xb5\\xb8\\x49\\x4a\\xaa\\xa0\\x18\\x3b\\x86\\x1c\\x2e\\x45\\x3a\\x50\\xc3\\x75\\x50\\x60\\xbe\\x03\\xdf\\x82\\xe7\\x7d\\x81\\xda\\x30\\x34\\xf7\\xb7\\xb0\\x97\\x93\\x9b\\x85\\x5d\\x5b\\xa6\\xe9\\xda\\x6e\\xb7\\x6f\\x6f\\x6f\\x5b\\xb7\\xbd\\x56\\x14\\x2f\\xda\\x5d\\xcb\\xb2\\xda\\xf0\\xad\\xc6\\xee\\x96\\xe9\\x2a\\xa8\\xca\\xd2\\x39\\x3d\\x3d\\x6d\\xd3\\x57\\xc8\\x84\\x11\\x61\\x0e\\x67\\xc2\\xaf\\x90\\xa9\\xba\\x9e\\x3f\\xce\\xdf\\x60\\xb6\\x93\\x76\\xae\\xa2\\x46\\x59\\xc3\\xe4\\x60\\xbf\\xe8\\x6b\\xbb\\xb6\\xc5\\x13\\x26\\x04\\x6a\\x6f\\x4d\\x5e\\x21\\xed\\x5b\\x87\\x7d\\xca\\x9c\\xc0\\x9f\\x6f\\xec\\x0a\\x2a\\xa0\\x38\\x04\\x6c\\x8a\\xb0\\x55\\x78\\xb2\\x16\\xe7\\x80\\xa7\\x21\\xfe\\x54\\x3f\\x07\\xf0\\xf2\\xdc\\x64\\xb7\\xce\\x2e\\x66\\xf6\\xcc\\xf1\\x3d\\x75\\x17\\x1a\\x46\\xfd\\x99\\x20\\x82\\x99\\xb0\\xc3\\x2d\\xfc\\x47\\xab\\x04\\x35\\x50\\x76\\x36\\x7c\\x15\\x37\\xdc\\xa5\\xe4\\x5a\\x42\\xaa\\x23\\xda\\x7d\\x7a\\xee\\xac\\x17\\xd7\\x0c\\x5e\\xb1\\x16\\x17\\xc7\\x24\\x15\\x0c\\x93\\x96\\x1c\\x2d\\x92\\x5f\\x40\\xcb\\x60\\xf3\\x63\\x0f\\x69\\x6b\\xed\\xf2\\x0f\\xcd\\x19\\xb1\\x8f\\x2a\\x03\\x90\\xf1\\xa5\\x1c\\x74\\xcb\\x8d\\x6a\\x06\\x52\\x30\\x81\\x8d\\x79\\x48\\xc5\\x7e\\x46\\x5f\\x5a\\xc8\\x43\\x94\\xcf\\x1a\\x9d\\xe2\\x91\\xf9\\x84\\xe5\\x21\\x8e\\xd8\\x0d\\x9c\\x24\\xf1\\x76\\x29\\x90\\xff\\x87\\x83\\x86\\xfd\\x64\\x84\\xfc\\x03\\x32\\xbc\\x8a\\xb7\\xc8\\x24\\x4f\\x8f\\xfe\\x2d\\xa8\\xcd\\x37\\x7e\\x92\\x6a\\xd7\\x5b\\x31\\x5d\\xab\\x3c\\x43\\x2d\\xce\\x30\\x75\\x80\\xe3\\x36\\x88\\xcf\\x95\\x27\\xf9\\xb3\\x4e\\xc1\\xc3\\x62\\x0d\\x25\\x70\\xd4\\xa8\\xbe\\x9a\\xa9\\xd7\\xf3\\x46\\x14\\x6f\\xa5\\xc0\\x46\\x21\\xf5\\xa5\\xaa\\x91\\x80\\x79\\x66\\x55\\x43\\xf0\\xfd\\x13\\x21\\xf8\\x5e\\x83\\x20\\x5d\\x4d\\xeb\\xf0\\xd3\\x54\\x39\\xf7\\x08\\x24\\xe8\\x5b\\xef\\x2c\\x2b\\x41\\xf2\\x99\\x06\\xc9\\xae\\xf0\\x5e\\x8e\\x14\\x29\\xe1\\xa1\\x78\\xb7\\x83\\xef\\x90\\x9a\\x40\\x63\\x2e\\x6f\\xa7\\x8b\\x48\\xb9\\x9c\\xe5\\x7a\\x8f\\x15\\x0b\\x10\\x6d\\x00\\x10\\x6e\\x2f\\xa3\\xd5\\x1a\\xa0\\x36\\xa3\\x4b\\x6d\\xf4\\x1e\\x86\\xe8\\x12\\x3f\\xa8\\x4d\\x42\\xb4\\x3d\\xae\\x31\\x24\\xba\\xf6\\x87\\xfe\\x4e\\x8e\\x50\\x0c\\x7e\\x5d\\x75\\xf3\\xfc\\x95\\xeb\\x47\\x6f\\x42\\xf4\\x19\\x25\\x8c\\x95\\xf3\\xf3\\xeb\\x13\\xe7\\xe7\\x57\\x6d\\x7e\\x50\\x23\\xe3\\x49\\xca\\xde\\x45\\xf1\\x4a\\xdd\\xf3\\xa7\\xaa\\x6a\\x8f\\xf6\\x75\\x5d\\x05\\xe5\\x38\\xae\\xd5\\x6c\\x20\\xb0\\x94\\x5a\\xce\\x63\\xda\\xb1\\x00\\x78\\xfb\\x71\\xed\\x59\\x41\\xbb\\x4a\\x78\\xe9\\xdf\\x68\\xcc\\x88\\xe1\\xff\\xef\\x8f\\x99\\x5c\\x85\\xfc\\xf0\\xe1\\xfc\\xcd\\x13\\x47\\x5c\\xe4\\xaf\\x1a\\xaf\\x56\\xdb\\xce\\x68\\xf3\\x2f\\x02\\x67\\xaf\\xd7\\x5e\\xb5\\x93\\xee\\x90\\xff\\x8d\\x78\\x56\\xc4\\x4e\\x15\\x34\\x55\\x05\\xbd\\x85\\x5f\\x45\\x1d\\x2f\\x51\\x47\\xc6\\x38\\x30\\x44\\x64\\xfd\\xb1\\x39\\x40\\x4d\\x65\\xc7\\xe5\\xba\\x92\\x84\\x6c\\x10\\x68\\xab\\xf4\\x49\\xed\\x8a\\xca\\xfe\\xe5\\xc1\\x62\\xf7\\x0e\\x35\\x8c\\xfa\\xea\\x55\\xe9\\x82\\xe8\\x54\\xdd\\x12\\x8c\\x6b\\x15\\x3d\\x99\\xcf\\xf0\\x77\\x22\\x27\\x12\\x1c\\x87\\x75\\xf0\\x0a\\x6d\\x46\\x11\\x61\\xa8\\x90\\x56\\xcf\\x73\\x2f\\x4b\\x7a\\x40\\xa3\\x08\\x4d\\x9c\\x16\\x9a\\x94\\x7a\\x8e\\xf6\\x42\\xa5\\xd7\\x9b\\xb2\\x0c\\x1b\\x0f\\x01\\xd1\\xc4\\x8c\\xad\\x84\\xa0\\x89\\x6d\\xca\\x59\\x84\\x78\\x9b\\xec\\xd5\\x62\\xbc\\xbf\\x5b\\x91\\xe3\\xc3\\x99\\xba\\x32\\xcf\\x84\\x3d\\xab\\x46\\x2c\\x02\\x3a\\x1a\\xdf\\xa0\\xba\\x76\\x66\\xaf\\x48\\xbc\\x34\\x43\\xc9\\xe7\\x06\\x53\\x66\\xe5\\xda\\xe6\\x44\\x80\\xae\\x48\\x9c\\x95\\x57\\xe8\\xd1\\xfd\\x47\\x4c\\x9e\\x9f\\xcd\\x71\\xf6\\x8c\\xf3\\x67\\x48\\x5e\\x2c\\xa8\\x46\\xad\\x1d\\xee\\x9b\\xf6\\x1a\\x13\\x7f\\x40\\x1d\\x43\\xd5\\xd2\\x33\\xab\\xaa\\xc7\\xd8\\x00\\x76\\xc0\\x54\\xb5\\x51\\xff\\x42\\x0a\\x84\\x97\\x6b\\x14\\xe4\\x45\\xd0\\x71\\x89\\xb4\\xd2\\x15\\x3d\\xc9\\xc6\\x86\\xde\\x2e\\x13\\x7d\\xd1\\x9a\\x17\\x71\\xec\\xe6\\x67\\x64\\x06\\x6b\\xca\\x64\\x2c\\x6a\\xaa\\xd8\\xfc\\xe2\\x4b\\xde\\xec\\x76\\xdd\\xca\\xd6\\x33\\xb4\\xc0\\x59\\xb0\\xb5\\x4e\\x66\\x2e\\xf4\\x97\\x1b\\xfd\\x25\\xd4\\x5e\\x94\\xf1\\xec\\x3a\\x37\\x89\\x5e\\x98\\x4c\\xba\\x55\\xb9\\x11\\x7a\\x6d\\x9a\\xea\\x86\\x4e\\x35\\x57\\xba\\xc0\\xa4\\xe1\\x87\\xfa\\xb4\\xe7\\xec\\x84\\x35\\xcd\\x3d\\xdb\\x2a\\xa5\\x09\\xe2\\x19\\x84\\x92\\x06\\xde\\x90\\xe8\\x74\\x7f\\x21\\x57\\x10\\xea\\xfb\\x7f\\x19\\xc8\\xa7\\xb8\\xfc\\x05\\xfd\\x26\\xe2\\x17\\xfb\\x50\\x85\\xe0\\x4c\\x5d\\x33\\xc3\\x53\\x1d\\xf0\\xa7\\x4c\\x92\\xe8\\x18\\x1f\\xab\\x00\\x41\\xb1\\xde\\xfc\\x9d\\x5b\\xe6\\xfd\\xf2\\x79\\xbf\\x5c\\x14\\xdc\\x79\\x71\\xc5\\xce\\x74\\xb6\\x0c\\xbd\\xa9\\xfb\\x55\\xda\\x91\\x09\\x7c\\x53\\xbb\\xb5\\xa4\\xec\\xf1\\x05\\x54\\xbe\\xce\\xd5\\xe3\\x72\\xae\\x09\\x15\\x3c\\x0f\\x7d\\x13\\x18\\x41\\x78\\xb1\\x3b\\xc4\\x2f\\x22\\x6b\\x54\\xe1\\xaf\\x58\\x98\\x79\\xfc\\x8c\\x34\\x9e\\x16\\xac\\xd5\\xda\\x99\\xfb\\xe8\\xcc\\x1f\\xf9\\x18\\xe2\\x2b\\x3b\\xcc\\x45\\x7a\\x0a\\x6a\\x95\\x5c\\xa4\\xd0\\x15\\xf0\\x0a\\xfd\\x7b\\x67\\xe4\\x40\\x85\\x18\\xba\\x4f\\xb0\\x56\\xda\\x54\\x69\\xdc\\x94\\x8f\\x32\\x98\\xdc\\x90\\x20\\x67\\xa3\\x32\\x31\\xe2\\x28\\x9e\\x95\\xa7\\x64\\xf7\\x1e\\xb5\\xc4\\xf4\\x95\\x2e\\x4c\\x91\\x59\\x54\\x96\\x44\\x59\\xce\\xdc\\x12\\xab\\x18\\x63\\xd4\\x14\\x75\\x45\\x87\\x2a\\x07\\x42\\xef\\xca\\xf0\\x8f\\x8e\\x7c\\xc0\\x02\\x5e\\x0b\\xc3\\x65\\x5d\\xf8\\x57\\xc0\\x5a\\x2d\\xd0\\xc7\\xa3\\xb6\\xb2\\x4a\\x07\\x81\\x87\\x01\\xc3\\x7c\\x8d\\xfd\\x23\\x22\\x87\\x68\\xcd\\x68\\x27\\x66\\x46\\xc8\\x7f\\x3c\\x70\\x22\\xcf\\xcb\\xf1\\x15\\xcb\\x23\\x22\\x29\\x1d\\x8d\\x22\\x9d\\x0a\\x51\\x76\\x58\\x6a\\x4c\\x00\\xc8\\x10\\xc0\\xc2\\xc3\\xa3\\x6a\\x05\\xfe\\x29\\xa5\\x9b\\x9a\\xe0\\x1a\\x29\\x5f\\x25\\xf9\\xc4\\xc0\\x7c\\xb9\\xc9\\x14\\xde\\x42\\x49\\x86\\xc3\\xa9\\xe2\\xc1\\x91\\x2d\\xae\\xd0\\x8f\\x50\\x63\\x23\\xab\\x78\\xb2\\xc4\\x12\\xc7\\xaa\\xe8\\x17\\x8a\\x64\\xf7\\xf7\\xce\\x33\\x8d\\x54\\xa0\\x7c\\xf8\\x58\\x3d\\xd7\\xd6\\xce\\x54\\xa7\\x67\\xe1\\x28\\xd4\\x9c\\x95\\x7b\\xf9\\x4c\\x8b\\x50\\x39\\xf9\\x2a\\xcc\\x00\\xb9\\xc6\\xb8\\xac\\xc5\\xaa\\xf7\\xa4\\x11\\x91\\x6f\\xe6\\xb7\\xf9\\x9a\\x35\\x93\\x98\\x39\\xff\\xf3\\x9e\\x4f\\xf7\\xb0\\x08\\x6c\\xb9\\x0b\\x4b\\xf3\\x1e\\x96\\xdd\\x16\\xc3\\xe7\\x10\\xd7\\x7f\\x41\\xbe\\x13\\x4a\\x42\\x1f\\x81\\x55\\xfe\\x62\\xfb\\x89\\x9a\\x3c\\xe8\\xc2\\x61\\x17\\x39\\x85\\x94\\xd3\\x4a\\x98\\x26\\x80\\xa7\\xa0\\x88\\x29\\x04\\x26\\x09\\x2e\\x7c\\xa7\\x89\\x92\\x13\\x86\\xef\\x34\\x02\\x39\\x12\\x7a\\xdf\\x97\\x32\\xed\\x19\\xc5\\x2b\\x75\\x26\\x92\\x8e\\x94\\x97\\x20\\x09\\x48\\xee\\x81\\x51\\xcc\\x04\\x90\\x61\\x2f\\xcb\\xf3\\x29\\xf7\\x43\\xb1\\x8f\\x2b\\xb2\\x2a\\x0c\\x21\\xb5\\x88\\xb4\\xb8\\x70\\x01\\x3a\\x89\\x37\\x7c\\xf4\\xd8\\xaa\\xc9\\x99\\x62\\x78\\xe3\\x85\\xb0\\x49\\x3f\\xdb\\xfc\\x62\\xa9\\xa2\\x7b\\x09\\x53\\x93\\xcc\\xf0\\xe2\\xdb\\x21\\x11\\x13\\xda\\x36\\x5c\\x3c\\x4e\\x19\\x1e\\xb8\\x37\\xff\\x8d\\xa6\\x1d\\xda\\xcb\\x09\\xcb\\xb2\\xbe\\xae\\xd4\\xbd\\xd9\\x81\\xb4\\x92\\x88\\x2a\\x43\\x98\\x5d\\x96\\x2a\\x45\\x3b\\xe4\\xc9\\xb9\\x03\\x7b\\x30\\x43\\x5f\\x19\\x5e\\x09\\x84\\xfb\\x52\\x45\\x34\\xfe\\x43\\x8f\\x29\\xa5\\x7c\\xd8\\x8c\\xc9\\xe0\\xf4\\xf4\\xa6\\x7a\\x2f\\x2a\\x25\\x68\\x87\\x3a\\x12\\x8e\\x85\\xc0\\xeb\\x0e\\x8d\\x21\\x33\\x67\\x57\\xbe\\x55\\xd9\\x95\\x94\\x02\\x82\\xea\\x1d\\x41\\x60\\x63\\x47\\xf0\\x72\\x94\\x90\\x77\\xb8\\xa7\\xb2\\x20\\xae\\xf8\\xaa\\xb9\\xed\\xf8\\x11\\x6e\\x3b\\xa6\\x59\\x78\\xd6\\x91\\x0e\\x55\\x76\\xd9\\xcd\\x3f\\xf0\\x9a\\x12\\xe5\\x44\\x69\\x15\\xb7\\xad\\xac\\xc6\\xe4\\xb1\\xaf\\x78\\x57\\x38\\x5d\\xe1\\x9c\\x6c\\x84\\x22\\x66\\xfc\\xe5\\xc8\\x83\\xfa\\xf7\\x39\\xd4\\x3f\\x64\\xd7\\xa5\\x58\\xef\\x9a\\x44\\xba\\x68\\x29\\x73\\xbf\\x8a\\xb2\\xc4\\xa3\\x8d\\x6c\\xd7\\xe8\\x19\\xe8\\xfa\\xb8\\xc6\\xe8\\x31\\xf0\\x9c\\x1b\\x4f\\x25\\x67\\x69\\x6d\\x6b\\x8e\\x32\\xe7\\xe8\\xe8\\xda\\xa9\\xb8\\xc9\\x34\\xef\\x6b\\xd4\\x0f\\x1c\\x94\\xcc\\x24\\x98\\x04\\xe4\\xed\\x85\\xea\\xc5\\x6b\\x87\\xbd\\x80\\xf3\\x15\\x11\\x0b\\x55\\x59\\x85\\xe5\\x7f\\x82\\x8e\\x5e\\x1b\\xaa\\x9f\\x6f\\xa5\\x8c\\x38\\x74\\x6e\\xfc\\x85\\x93\\x46\\x00\\xc0\\xf6\\xef\\xde\\xd5\\xbf\\xfd\\xb4\\x2d\\x65\\x2d\\xa5\\xaf\\x2d\\xa8\\x34\\x7e\\xb1\\xc0\\x99\\x45\\xed\\x71\\x6a\\x29\\x8d\\xb2\\xd2\\x79\\xf2\\x25\\xa5\\x13\\x38\\x48\\x38\\x74\\x00\\x83\\x62\\x87\\x0b\\x6f\\xf6\\x01\\x8b\\x7b\\xc8\\x16\\x95\\x74\\x98\\x2c\\x8a\\xe6\\xa8\\xe6\\xfd\\x2c\\x43\\x61\\x10\\x4a\\x82\\x70\\x72\\x48\\x12\\xe4\\xcf\\xa0\\x6a\\x7f\\xee\\x03\\xd2\\x84\\xa3\\xd8\\xd4\\x46\\x17\\x8b\\xf5\\xad\\x6e\\xe6\\x5a\\xb3\\xd8\\x59\\x1c\\xb8\\x7a\\x97\\xac\\x29\\x24\\x8b\\x39\\x98\\x45\\xb7\\x21\\xe5\\xaf\\xc1\\x91\\x4d\\xc9\\x34\\x3a\\x61\\x16\\x29\\xd2\\x23\\xdd\\x03\\xab\\xb4\\x50\\x45\\xb7\\x3a\\x15\\xb6\\xce\\x79\\x3e\\x47\\x1d\\x10\\x24\\x9a\\x4e\\x8d\\x25\\xbb\\x81\\xf5\\x47\\x04\\x17\\xba\\x32\\x69\\x9e\\x8b\\xb8\\x74\\xe8\\x0b\\x06\\x9e\\x3b\\x53\\xb6\\x7e\\xe0\\xe1\\x83\\xc7\\xce\\x79\\xcc\\x16\\xc6\\x3d\\xae\\x70\\xbb\\x26\\x9a\\xbf\\xb3\\xc9\\x97\\x4c\\x80\\x25\\x36\\x36\\x79\\x8f\\x09\\xb0\\x04\\x06\\xe3\\xc3\\xd0\\x77\\x5e\\xc9\\x9c\\x17\\x5d\\x5b\\x88\\xe6\\xa0\\xb1\\x15\\x0e\\xc8\\x6f\\xcc\\xa4\\x88\\x08\\x5e\\x22\\xf5\\xc2\\x36\\xc6\\x1a\\xe8\\x2b\\x79\\x85\\x25\\xe3\\xfb\\x03\\x5c\\x91\\x17\\xd4\\xdb\\x87\\xc3\\xa6\\xb6\\x95\\x71\\x1d\\x30\\x4c\\xad\\x38\\xe4\\xf8\\x4e\\x41\\xe0\\x27\\x13\\x1d\\x1b\\x2f\\x80\\xac\\x8a\\xe6\\x46\\x89\\x09\\x16\\xf1\\x60\\x43\\xf2\\x1c\\x51\\x13\\xa0\\x6d\\xc8\\x2b\\xb9\\x1b\\x14\\x33\\xd4\\x9a\\xb5\\xc6\\x0d\\xf0\\x64\\xc5\\xcd\\x88\\xe1\\x01\\xf3\\x69\\xaa\\x31\\x38\\xf9\\x00\\x5c\\xe8\\x3d\\xff\\x1d\\x19\\xd3\\x73\\x05\\x5a\\x60\\xb6\\x02\\x38\\x3f\\x04\\xb1\\x51\\x6a\\x36\\xe0\\x93\\xa0\\x75\\x27\\x00\\x1e\\xb4\\x36\\x04\\xed\\xa9\\x69\\x43\\xb2\\xc5\\x20\\xa9\\x34\\x58\\x9a\\x75\\xb4\\x37\\x14\\xcc\\x10\\x7f\\x8d\\x57\\x54\\x62\\x16\\xb4\\xef\\x2c\\x07\\x8c\\xa9\\x2c\\x82\\x81\\x80\\x30\\xae\\x98\\xda\\x84\\x18\\x01\\x8b\\x1e\\x70\\xaf\\xd6\\xe4\\x73\\xb6\\xae\\x91\\x9f\\x63\\xe3\\x7b\\xa6\\xb6\\x10\\xdb\\x30\\xb1\\xda\\x64\\x3e\\x7a\\xa6\\x7a\\x0b\\xf2\\x29\\x8a\\xfd\\xc5\\x53\\x0d\\xf8\\x32\\x4e\\x71\\x19\\x32\\xed\\x5e\\x1a\\x37\\x07\\x43\\x2c\\x22\\x76\\x88\\x68\\x61\\xd7\\xfa\\xec\\xf1\\x13\\x0e\\x77\\x6e\\x9a\\x6f\\xd9\\x71\\x8c\\xee\\x6e\\xf6\\xc2\\x96\\x0b\\x5a\\xeb\\x27\\x11\\x6e\\x2a\\xbf\\xa9\\xd3\\x76\\x6c\\xaa\\xbd\\x30\\x58\\xb2\\xf6\\x64\\x2a\\xf0\\xd1\\x4b\\x07\\xa3\\x9e\\x0c\\xd9\\x67\\x87\\xbf\\x74\\xea\\x2f\\x1d\\xf6\\x49\\x6a\\xb8\\xbd\\xfb\\x91\\xbd\\x71\\x78\\xb7\\xfe\\xc9\\x61\\x1f\\x1c\\xfe\\xc6\\x69\\xc2\\xb7\\xf7\\x0e\\xff\\x84\\x91\\x02\\x5e\\xd1\\x6f\\xe7\\xc4\\x62\\xef\\xa0\\xf8\\x89\\xd5\\x86\\x4c\\xbf\\xca\\x72\\x17\\xbf\\xbc\\xff\\xd0\\x65\\x7f\\x43\\x51\\xf6\\x9d\\xc3\\xfb\\x88\\xb0\\x34\\xe7\\x15\\x7f\\x45\\xd1\\xae\\xe6\\xbd\\xbe\\xb9\\x73\\x29\\x59\\x9d\\x42\\xca\\xae\\xd4\\xc8\\x80\\xbe\\xbe\\x21\\x63\\xf3\\xb6\\xf1\\xb7\\x53\\x5f\\x9a\\x75\\xc3\\xab\\x67\\xa9\\xf1\\xab\\x53\\x4f\\x61\\xd1\\x36\\x3d\\xfc\\xac\\x06\\x3e\\x89\\x1b\\x51\\x3d\\x60\\x19\\xfc\\x4d\\x98\\x5f\\xf7\\xda\\x71\\x9e\\x51\\x99\\x71\\x42\\x96\\x90\\xb2\\x84\\x94\\x85\\xfa\\xed\\xdd\\xad\\x29\\x9b\\x74\\x6d\\x9e\\xbb\\x5f\\x0b\\x95\\xbb\\xbd\\xae\\xe6\\xe7\\x2f\\x15\\xbe\\xf9\\xd0\\xf5\\x13\\xac\\xf0\\xa8\\x19\\xa3\\xbf\\x8c\\x66\\x06\\x3b\\x33\\xa8\\x07\\x8d\\xa4\\x9e\\x28\\x09\\x0f\\x69\\x26\\x93\\x80\\xc7\\x70\\xeb\\x6e\\x13\\x5d\\xdf\\x7e\\xe7\\xd4\\xe7\\x14\\xbb\\xd6\\xaf\\xd3\\x58\\xd0\\xab\\xad\\xfc\\xd6\\xcc\\xbf\\xb9\\xf2\\xdb\\x0d\\xcf\\x23\\x41\\x15\\xf5\\x2d\\xea\\x8b\\x46\\xc7\\x6c\\x2e\\x70\\x2b\\x57\\x7c\\x5e\\xd7\\xd7\\xf8\\x79\\x8d\\x9b\\x79\\xd6\\xbc\\xc1\\x08\\xc9\\xab\\x87\\x87\\x3c\\xa3\\xdb\\x06\\xe6\\xbb\\xfd\\xab\\x53\\xac\\x13\\x65\\x16\\x0e\\x2b\\xa1\\x57\\xdf\\x30\\xaf\\x8c\\xcd\\x3f\\x97\\xa6\\xac\\x84\\xcd\\x29\\xf4\\x31\\x24\\x7e\\x62\\x73\\xc2\\x0e\\x3f\\x3b\\x8d\\x1a\\xe5\\xaf\\xb1\\x85\\xc0\\xe6\\xb3\\xab\\xc0\\x0d\\x7c\\xf7\\x5a\\xa6\\xae\\x29\\xf5\\x3d\\x5b\\x96\\x71\\x7a\\xee\\xec\\x83\\x1c\\x47\\x36\\xaf\\x5b\\x77\\x66\\xfb\\xba\\x75\\xcd\\x44\\x60\\xf6\\xeb\\xd6\\x86\\x5e\\x4b\\xa1\\x47\\x34\\x07\\x21\\xe8\\x98\\x0b\\x3e\\x37\\xae\\xd1\\x53\\x08\\xfa\\xe6\\x12\\x2f\\x9b\\x92\\xf3\\x73\\xc8\\x0f\\xc9\\x45\\x20\\xa0\\xb7\\x38\\x91\\xb9\\x10\\xee\\x2d\\xce\\x67\\xc9\\x77\\x92\\x0c\\xa2\\x92\\xa2\\xda\\xbb\\xc9\\xa0\\xea\\x86\\xe6\\xe2\\x18\\x2a\\x6f\\x14\\x5e\\x8e\\x8b\\x42\\x91\\x60\\xe1\\xf0\\x70\\x42\\xde\\x0d\\x0e\\xdc\\x38\\x05\\x02\\xf8\\xfe\\xce\\xbe\\xa6\\x20\\xae\\x50\\x8e\\x5d\\xc3\\xdf\\x6b\\x74\\x2c\\x9e\\xc7\\x6f\\xe9\\xd2\\x45\\xad\\x6f\\xa0\\x5f\\x8b\\xd8\\x14\\x4a\\xc8\\x12\\x03\\x43\\xd3\\x2f\\xcf\\x2c\\x11\\xd8\\xa8\\x55\\x38\\x6f\\x00\\x94\\xa0\\xe6\\xcc\\x78\\x49\\x44\\xa1\\xb8\\x94\\x17\\x87\\x82\\x36\\x0a\\x3c\\x07\\xaf\\x8e\\x8e\\xae\\x94\\x59\\xeb\\x9d\\x0a\\x96\\x7a\\xc0\\x4c\\xda\\x08\\x73\\xe0\\x6f\\x45\\x9e\\x3b\\x69\\xd1\\x8c\\xb7\\x81\\x47\\x47\\xb7\\xaa\\xa2\\xcb\\xa7\\x54\\xb4\\xd1\\x2b\\xba\\xcc\\x2b\\xd2\\x4f\\x4b\\x28\\xf0\\xb9\\xd1\\x78\\x78\\x08\\xd5\\x39\\x80\\xeb\\x24\\x3f\\x07\\xf2\\x8c\\xa8\\xd6\\x70\\x0f\\x83\\x61\\xa5\\x7c\\x35\\x46\\x41\\xe9\\x10\\xa0\\x2c\\xb7\\x65\\xb7\\x27\\x08\\x6b\\x9a\\x7e\\x53\\xf7\\x09\\x00\\x15\\x34\\x9b\\x9f\\x77\\x5a\\x12\\xc7\\x2b\\xaa\\xeb\\x21\\x9b\\x99\\xe7\\x9e\\xef\\x12\\x2d\\x73\\xde\\x81\\x09\\x52\\x07\\x0c\\x7a\\x34\\x80\\xcd\\x17\\x18\\xba\\x57\\x04\\x60\\xf6\\xef\\x97\\xb8\\xba\\xdf\\x14\\xc7\\xfd\\x07\\x79\\xd8\\x03\\x84\\xaa\\x0e\\xfb\\x08\\x1d\\x18\\x38\\x2a\\x68\\x13\\x1d\\xed\\xd1\\xde\\xd1\\xee\\xf0\\x57\\x78\\x96\\x67\\xfa\\xa1\\x3a\\xe7\\x18\\xa5\\x5e\\x5b\\x26\\x18\\x86\\x48\\xb6\\x2d\\x1b\\x8e\\x11\\xe7\\x78\\x7a\\x97\\x11\\xd1\\xfc\\x0e\\xbf\\xa3\\x57\\x81\\x64\\xe0\\x4c\\xe6\\x96\\x86\\xb0\\xdc\\x1d\\x76\\x6e\\x8d\\x21\\x0f\\x20\\x63\\x9d\\x9f\\x2e\\x0b\\x8e\\x50\\xaf\\x52\\x00\\x44\\x9c\\x50\\x1c\\x36\\x48\\x3c\\xcf\\x60\\x01\\xcf\\x26\\x7a\\xea\\x94\\x93\\x7b\\x81\\x6d\\x29\\xbc\\x6d\\x9a\\x5f\\x92\\xec\\xc0\\x60\\xa4\\x6f\\x08\\x1c\\xde\\x1d\\x0c\\x0f\\x7f\\xaf\\x80\\x2a\\x41\\x65\\x28\\x62\\x76\\x0b\\x89\\x8d\\x57\\x54\\x50\\xa6\\x79\\x25\\x99\\xeb\\xed\\x92\\xb9\\xb3\\x89\\x87\\x6e\\x5a\\xf4\\xfe\\xe1\\xc4\\xc9\\x60\\x35\\x48\\x33\\x05\\x5c\\x59\\xe1\\x1a\\xa6\\x52\\x36\\x76\\x75\\xe5\\xa6\\x81\\x65\\x9d\\x05\\xcd\\x73\\xe5\\xd1\\xd4\\x45\\x5f\\x94\\x91\\xb1\\x66\\x09\\x9b\\x4d\\x12\\xbd\\xe6\\xca\\xe8\\x97\\x00\\xcb\\x3c\\x94\\x61\\xd7\\x44\\x95\\xac\\x0b\\xc3\\xdc\\x9e\\xf3\\x60\\xab\\x14\\xa1\\x5d\\xcd\\x07\\x6c\\xd1\\x04\\xac\\x04\\x17\\x51\\x17\\xd0\\x7f\\x88\\x9c\\xe6\\x98\\xb4\\xe0\\xe8\\x11\\x15\\x9e\\x3b\\xd3\\xd1\\x8a\\x2f\\xeb\\xcb\\x06\\x9c\\x17\\xdb\\xf2\\x42\\x15\\xb4\\xb1\\x44\\x56\\x3b\\x13\\xac\\x96\\xc7\\xda\\xdc\\x11\\x21\\x46\\xba\\x08\\xb1\\xd1\\x70\\x50\\x9b\\x10\\x97\\x37\\xaa\\x95\\x91\\x9a\\x06\\x24\\x00\\x24\\xf5\\xc1\\x0a\\x5f\\xbc\\x26\\x19\\xf1\\x8d\\x42\\x34\\x94\\xe5\\x31\\xf2\\x7e\\xb1\\x1a\\x84\\x91\\x70\\x2f\\xf7\\x51\\x58\\x4f\\x1a\\xf4\\xae\\xfc\\x17\\xd6\\x91\\xd4\\x5d\\x1d\\x1d\\x15\\x47\\x5b\\xd2\\x5e\\x99\\x18\\xf3\\x89\\xce\\x09\\x8a\\x33\\x81\\x9e\\x5c\\xe9\\x98\\x20\\x03\\x7a\\x78\\x43\\x85\\xfe\\x09\\x09\\xbc\\x1a\\xb1\\xfa\\x4e\\xce\\x1a\\x63\\xf5\\x3d\\x33\\xe6\\xf5\\x05\\x42\\x57\\xd0\\x8e\\x84\\xe8\\x61\\x33\\xdf\\xec\\xe0\\x4d\\xec\\x79\\xbe\\x0e\\x05\\x78\\x4a\\xb2\\xf7\\x9d\\xa5\\xba\\xb3\\xd2\\x76\\x42\\xb3\\x28\\x6d\\x4b\\xe9\\x7b\\x64\\x46\\xa6\\x32\\x3a\\xa4\\x0a\\xad\\x19\\xda\\x31\\x8a\\xbd\\x22\\x7b\\x29\\x58\\x80\\x5b\\x5d\\x7e\\x60\\x5c\\xd2\\xea\\xdf\\x48\\xec\\x72\\xab\\x1f\\xc1\\x78\\xb6\\xb2\\xd7\\xe8\\x73\\x5d\\x5d\\x2a\\x2c\\x60\\xdf\\x13\\x6e\\xb9\\x11\\x98\\x64\\xad\\x63\\x92\\x19\\xaa\\x51\\xae\\xa0\\xaf\\x1b\\x2e\\x4e\\x6e\\xe0\\x02\\x0e\\x0c\\x09\\xad\\xde\\x35\\x22\\xf2\\x8e\\x6b\\xc4\\x73\\x63\\xc3\\xae\\x78\\x41\\x40\\xc3\\xeb\\x25\\xca\\xad\\x6e\\x35\\x1c\\x05\\xe4\\xc8\\x6b\\xc0\\x3f\\xb0\\xaa\\x50\\xa7\\xd9\\x45\\x7a\\x4e\\x76\\x3c\\x47\\x97\\xef\\x99\\x7e\\x76\\x2d\\x72\\x04\\x44\\xdd\\xde\\x15\\xcf\\x6e\\xc6\\x2e\\x30\\xf3\\xf1\\x07\\x7f\\x85\\x8c\\xbc\\xb1\\x31\\x6d\\xe3\\x06\\xb0\\xca\\x8c\\x03\\xad\\x93\\x63\\x3d\\x29\\x1c\\x52\\x4b\\x9a\\x5e\\x19\\x9e\\x3a\\xc8\\xc2\\x24\\x5e\\xaa\\x4a\\x6b\\xe4\\xcd\\x46\\x2c\\x8b\\x84\\x14\\xe9\\x06\\x16\\xed\\xc4\\xf2\\x69\\xdd\\xb2\\xac\\x6e\\xfd\\x07\\x58\\x22\\x26\\x52\\x1a\\x74\\x72\\x03\\x0f\\xc4\\x82\\x92\\xf3\\x84\\xb5\\x8e\\x3e\\xb5\\xce\\xb0\\x94\\x57\\xef\\x7a\\xc0\\x16\\x52\\x68\\xe5\\xd1\\x15\\xa8\\x9a\\x04\\x72\\xbd\\xfa\\x6f\\x6f\\x33\\xd6\\x22\\x75\\x9b\\xcd\\x8e\\xad\\xc7\\xf8\\x46\\x8c\\x41\\x73\\x7d\\xc3\\x66\\x6c\\x05\\x7c\\xcd\\x39\\xbb\\x63\\x57\\xec\\x92\\xdd\\xb2\\x6b\\xa4\\x3e\\x60\\x7a\\xe1\\xdf\\xb5\\xdd\\xd9\\xb2\\x17\\x7c\\x72\\x3a\\xb4\\x60\\x60\\x80\\x29\\xde\\xf2\\x1f\\x1d\\xf6\\x92\\x77\\x07\\x16\\xfb\\x0c\\x4b\\xe0\\x13\\xd7\\x78\\x72\\x71\\xbe\\xbe\\xe1\\x05\\x27\\x25\\x93\\x3e\\x70\\xc5\\x50\\xc9\\x84\\xf7\\x5c\\xe7\\xd9\\x45\\xda\\x2b\\xc1\\xbb\\x15\\x87\\x39\\x93\\x07\\x76\\x7e\\xea\\xe6\\x07\\xc9\\xcf\\xce\\xc3\\x03\\x10\\x8e\\x1c\\xb8\\xa4\\xdb\\xa5\\xe7\\x05\\xa4\\xa4\\xe6\\x8c\\x8d\\x1f\\x9c\\x7d\\xc9\\x74\\x33\\x87\\x0a\\xec\\xa3\\xd4\\xf9\\xb3\\x6e\\x94\\x13\\xce\\x81\\xf9\\x1d\\x77\\xba\\x96\\x0d\\xe0\\x60\\x35\\x51\\x9d\\x69\\x43\\xcd\\xd4\\xe3\\x2f\\x56\\xff\\x4d\\x5e\\x1b\\x65\\x7d\\x85\\x55\\x6e\\x25\\xff\\xa8\\x2a\\xfb\\x62\\xbf\\x52\\xc7\\x0f\\xb6\\xa4\\x15\\x7c\\x8e\\xe5\\xde\\xf9\\x77\\x5e\\x70\\xe1\\xa2\\x32\\x37\\x06\\xd7\\x95\\x24\\x5a\\xf9\\x0a\\x42\\x08\\xb4\\xf6\\x64\\xdb\\x55\\xcb\\x1e\\x45\\x39\\xa3\\x0f\\xc1\\x58\\x3b\\x11\\x71\\x55\\x95\\x69\\x43\\xa1\\x8e\\xa0\\xcf\\x87\\x56\\xf7\\x35\\x97\\xce\\xd8\\x24\\x75\\xfa\\xf0\\x50\\x5e\\x20\\x2e\\x49\\xb7\\x84\\xef\\x29\\x83\\xa6\\xcb\\xde\\xab\\x43\\x1c\\xb2\\x2f\\x84\\x3f\\xbd\\x17\\xc2\\x5d\\xf9\\x6c\\x3c\\x83\\x77\\xdb\\x23\\xcf\\xda\\xf8\\xd2\\x99\\xda\\x31\\xbc\\xd0\\xf1\\xb2\\xc3\\x01\\x1a\\x13\\x23\\xd3\\xa8\\x7c\\x3f\\xa7\\x15\\x99\\x47\\x84\\x3e\\xc3\\xef\\x29\\x7e\\x4f\\xc5\\xf7\\x14\\xbf\\xa7\\xf4\\x1d\\xfe\\x56\\xc4\\xec\\x4f\\x95\\x08\\x13\\xc3\\xdd\\x02\\xcd\\x04\\x5c\\x1f\\xf0\\x66\\xa3\\xf2\\x50\\x39\\x6d\\x86\\xac\\x89\\xe7\\x42\\xdd\\x81\\x21\\xfb\\x4d\\x3c\\x14\\xe0\\xf1\\x1a\\x63\\x20\\xd0\\x06\\xde\\x2a\\xf0\\x15\\xbe\\xbd\\xf6\\x86\\x9f\\x08\\x10\\x89\\x7c\\xe8\\x9b\\xea\\x40\\x0e\\xdb\\xd8\\x6d\\x9f\\xa0\\x4b\\x0d\\x11\\x82\\xa1\\x2b\\x9d\\xb0\\x95\\xd3\\xae\\x4f\\x93\\x33\\xd0\\x28\\x1a\\xa9\\x10\\x48\\x35\\x88\\x15\\x95\\x4c\\x05\\x51\\xc8\\xa6\\x46\\x01\\x43\\xe5\\x44\\x22\\x7f\\x45\\xc5\\x3a\\xa7\\xd2\\x48\\xf3\\x3a\\xa9\\x7e\\x59\\xdb\\xe1\\xe0\\x4b\\xfb\\x75\\xbe\\xcd\\x55\\x59\\x7e\\x74\\xec\\x89\\xe8\\x35\\xf5\\x19\\xf9\\x2d\\xfb\\x2d\\xd6\\xe9\\xee\\xdc\\xef\\x3e\\x56\\xdd\\x0a\\x83\\x8d\\xef\\x55\\xb3\\xa2\\xae\\x95\\x2e\\x88\\x1e\\xab\\xe4\\x45\\x65\\x25\\x2f\\xb0\\x92\\x9c\\x15\\x7e\\x52\\x45\\x2f\\x79\\x83\\x44\\x3e\\x2f\\xb1\\xe8\\xdd\\xd3\\xca\\x5c\\xf1\\x14\\xce\\xce\\x54\\x79\\xe7\\xd9\\xc5\\xcf\\x50\\xdb\\x15\\xd6\\xb6\\x79\\x5a\\x6d\\x70\\xc2\\xc2\\x51\\xfb\\x58\\x6d\\xb7\\x65\\x71\\xd4\\x2b\\x29\\x8e\\x22\\xda\\xf6\\x07\\x87\\xfd\\xec\\xb0\\x1f\\x1d\\x14\\xc6\\x75\\xda\\x16\\x5d\\x90\\xb9\\x51\\x10\\xc1\\x36\\x4a\\x59\\xa4\\x39\\x7d\\x01\\x02\\x48\\xb8\\xf9\\x3a\\xa4\\x1f\\x13\\x2f\\xae\\x0c\\xb3\\x51\\xab\\x51\\x63\\xcb\\x24\\xe0\\x4e\\x4a\\x2d\\xfc\\xe9\\xc0\\x93\\x76\\x9f\\x86\\xea\\x0a\\x51\\x3a\\xfa\\xd3\\x69\\x5d\\x91\\xad\\xb5\\x57\\x69\\x61\\x1d\\x16\\xe1\\xe2\\x5b\\xc7\\x7b\\x26\\x93\\xe3\\xd0\\x46\\x9b\\x05\\xa8\\xc9\\x91\\xe2\\xf2\\xa5\\x54\\x15\\x12\\x3f\\x41\\x1b\\x8f\\xee\\x3f\\xf1\\xea\\x3f\\xbe\\xfe\\x5f\\x6e\\x20\\xac\\x8b\\x26\\x44\\x03\\x30\\xea\\x0a\\x80\\xb8\\xd5\\xbd\\x12\\x22\\xc0\\xa5\\x1b\\xf0\\x40\\xc0\\xe6\\x2f\\x07\\x9e\\xf6\\x61\\xf3\\xd7\\x17\\x60\\x83\\xfa\\x3e\\xe5\\x16\\xdc\\x42\\x90\\xd1\\xb1\\x2c\\xd9\\x5c\\xe3\\x37\\xa7\\xbe\\x77\\x23\\x40\\x23\\x43\\xb5\\xbe\\xbf\\x1e\\x85\\xce\\xe1\\x26\\xc8\\xad\\xb5\\x68\\xa0\\xf9\\xa5\\x06\\xaa\\xa1\\x93\\xec\\x56\\x2c\\xa1\\x23\\x96\\x10\\xc1\\x28\\x70\\xa0\\xa0\\x80\\xd1\\x6f\\x28\\x5f\\x64\\x7f\\x38\\xbc\\x75\\x3a\\xb0\\xfa\\xc7\\xec\\x1f\\x18\\xa7\\xe1\\x5f\\xf0\\xa7\\x65\\x9d\\x9c\\x9c\\xf4\\xd8\\xef\\x70\\x1a\\x57\\xc0\\xf0\\xf7\\x2f\\xc3\\x70\\x9e\\x1a\\x5f\\x07\\x35\\x91\\xc3\\x11\\x3f\\x57\\xd0\\xd3\\xdf\\xbf\\x04\\xc3\\xbc\\x89\\xa7\\x41\\xad\\xaa\\x81\\x6a\\x18\\x2e\\x25\\x0c\\x83\\xbd\\x22\\xa9\\x28\\xb2\\x12\\xd0\\xfb\\xc9\\x81\\xa7\\x7d\\xe8\\xfc\\x74\\x00\\x3a\\x4f\\xd8\\x15\\x32\\x52\\x85\\xd8\\xf3\\x4a\\x2b\\x62\\x21\\x35\\x3a\\x5a\\x57\\x40\\x07\\xf4\\xf2\\x2b\\xf9\\xf4\\xe1\\xc1\\x7b\\x78\\x88\\xc7\\x06\\x7a\\xcc\\x3c\\x13\\xe1\\xb9\\x33\\xb2\\x48\\xc8\\xa4\\x57\\x1b\\x34\\xae\\xc5\\xb7\\x98\\x4c\\x92\\x32\\xb1\\xe7\\x56\\xda\\xc4\\x74\\x07\\x03\\x96\\xc2\\x76\\x66\\xa5\\x14\\x6f\\x2f\\x25\\x6e\\x63\\xb8\\x43\\x5b\\x16\\xa7\\x10\\x19\\x00\\x8c\\x9f\\xfe\\x37\\x50\\x00\\xd4\\x27\\x37\\x7d\\xac\\x76\\xff\\x42\\x3d\\x5c\\x89\\x46\\x10\\xdf\\xed\\x4f\\xd2\\xa5\\x9c\\xa4\\x98\\xc9\\x42\\x7a\\x91\\xc3\\xf8\\xb4\\xf6\\x3f\\xb5\\xc6\\x9d\\x2a\\x6a\\xe6\\x8f\\x8b\\xe2\\xf1\\x4a\\x62\\xef\\xef\\x8b\\x2b\\x4f\\x07\\x95\\xf6\\xaf\\xd0\\xca\\xb6\\x33\\x38\\x3e\\xed\\xf6\\x60\\x67\\xa0\\xb3\\x91\\x4f\\x19\\xd0\\xad\\x7e\\x0a\\xa9\\xc3\\x7e\\xbf\\xdf\\x3b\\x1e\\x30\\xe7\\x53\\xe6\\xd8\\xc3\\xc1\\xa0\\x27\\x1e\\x57\\x0e\\x74\\xc2\\xb3\\x4f\\x7a\\x27\\x27\\x83\\x61\\x9f\\x39\\x9f\\xb3\\x58\\x54\\xd1\\xef\\x40\\xe6\\x2b\\xcf\\x5f\\x60\\xd9\\x4e\\xe7\\xb4\\x0b\\x3c\\xc3\\x95\\x9f\\x7c\\xc2\\x16\\x86\\xc7\\xc7\\x56\\xb7\\xdf\\x67\\x57\\x81\\xe3\\x5e\\xc3\\x49\\x03\\xbf\\x21\\xf0\\x7d\\x33\\x27\\x58\\x45\\xe1\\x8c\\xbe\\x77\\xad\\x3e\\x14\\xc7\\xfe\\xe0\\xec\\xe0\\xc3\\x8d\\x1f\\x01\\xe7\\x6b\\x9f\\x5a\\x83\\x41\\xd7\\xea\\xb2\\xab\\x18\\x98\\x0c\\xbb\\x63\\x9d\\x74\\xfb\\xdd\\x1e\\x54\\x95\\xc5\\xc1\\xe6\\x36\\x8a\\xa0\\x74\\x7f\\x70\\x3a\\xec\\xf6\\x3a\\xcc\\x75\\x80\\x96\\xa6\\x2a\\x86\\xdd\\xe1\\x70\\xd0\\x3d\\x61\\x44\\x45\\xc5\\x1e\\x10\\xd5\\xd4\\xe1\\xde\\xa0\\x0b\\x49\\x91\\x4b\\x54\\xa5\\xdd\\xe9\\x1d\\x9f\\x9c\\xf6\\x8f\\xd1\\x37\\x6d\\xec\\x04\\xd8\\x89\\x7e\\xbf\\x7b\\xdc\\xc5\\xd7\\x10\\xb8\\xa4\\x5b\\x2f\\x16\\x75\\x0d\\x4e\\x3b\\xa7\\x27\\x1d\\x4a\\x4e\\xfc\\xe0\\x9a\\x7a\\x3b\\x80\\xda\\x98\\x1b\\xfb\\xab\\x24\\x82\\x3e\\x41\\xb9\\x1e\\x22\\x04\\x77\\xe3\\x84\\x12\\x54\\xb8\\x8a\\x04\\x74\\x7b\\xa7\\xf4\\x42\\xdf\\x7a\\x83\\xe3\\x6e\\x8f\\x5e\\x17\\x51\\x00\\x8c\\x71\\x8c\\xdd\\xef\\x5a\\xa7\\xdd\\x53\\x99\\x6b\\x11\\x3b\\x1b\\xbb\\x03\\xff\\x3b\\xb5\\x3a\\xc7\\x32\\x05\\x7d\\xe1\\x76\\x07\\x43\\xa8\\x5f\\xbe\\xef\\xe4\\xb8\\x5e\\x3a\\xd7\\x3e\\x54\\xd3\\xef\\xf5\\xba\\x03\\x51\\xcd\\x0a\\x6f\\xbb\\x52\\xc7\\x3e\\xed\\x58\\xa7\\xc3\\xbe\\x68\\x31\\x0a\\xfc\\x1b\\x4f\\xd4\\x36\\x18\\x9c\\x1e\\x9f\\x9e\\x8a\\xac\\x91\\x70\\x3e\\x88\\xa3\\x3f\\x06\\x38\\xcb\\x34\\x77\\xe9\\x43\\xcf\\x2c\\xab\\x6f\\x59\\x9d\\x2e\\xa5\\xc5\\xde\\x8c\\xaa\\x03\\x9c\\x4a\\xef\\x09\\xcd\\x1d\\xcc\\x7c\\xcf\\x3a\\xe9\\x77\\x44\\xb9\\xc4\\x73\\x44\\x03\\xb0\\x18\\x4e\\x01\\x6a\\x22\\x11\\x81\\x4d\\xa0\\xe8\\x1f\\xf7\\xfa\\xbd\\xfe\\x71\\x91\\x4a\\xa3\\x45\\xc8\\xf5\\x4f\\x07\\x7a\\xaa\\x57\\x4e\\x85\\x35\\xfe\\x29\\x8b\\x7c\\x98\\xc4\\x41\\xf7\\xb4\\x2f\\xd2\\xd4\\xe2\\x18\\x9e\\x9e\\x0e\\x10\\x76\\x9e\\xb7\\x5e\\xa3\\x6d\\x0d\\x8c\\xa3\\x33\\x3c\\xc5\\x46\\x20\\x25\\xb9\\xde\\x88\\x86\\x4f\\x3b\\x83\\x0e\\x9b\\xf9\\x2b\\x6a\\x70\\x78\\x0a\\x6b\\x68\\x38\\x10\\xef\\x9e\\xf6\\x1e\\xcd\\x16\\x72\\xce\\xbb\\x96\\xd5\\x83\\x11\\xb0\\xb9\\x0f\\x54\\x50\\xec\\xc3\\x9a\\xed\\x20\\x80\\x3a\\xfd\\x21\\x83\\x95\\x01\\xab\\x45\\xed\\x11\\x58\\x09\\xa7\\x00\\x34\\x54\\x21\\x4b\\x52\\x39\\x55\\xdd\\x61\\xef\\xa4\\xdf\\x05\\xda\\x1e\\x18\\x5c\\xdf\\xa1\\x1e\\x75\\x4e\\x61\\x49\\x2c\\xd0\\xc4\\xe2\\x2a\\x8a\\x23\\x5c\\x30\\xb0\\xd6\\x60\\x7f\\x2c\\x96\\x51\\x92\\xaa\\xba\\x7a\\x9d\\x21\\x64\\x65\\xb8\\x32\\xb0\\x10\\xbc\\x40\\xcd\\xda\\x3a\\xe9\\xf7\\xba\\xa7\\x1d\\x4c\\xc2\\x41\\x40\\x0b\\x1d\\x9c\\x0a\\xd1\\x66\\xaf\\x7b\\x3c\\x3c\\x11\\xcf\\x1b\\x2f\\x80\\xb5\\x0b\\xfd\\xed\\x5b\\x3d\\xd8\\x39\\x8c\\x86\\xa8\\x72\\x2f\\xa3\\xd0\\xdb\\xcc\\xbc\\x5b\\xb9\\x61\\xa1\\x07\\xcb\\x28\\x55\\x70\\xeb\\x9d\\x1c\\xf7\\x2d\\x74\\x9d\\xec\\x3b\\x21\\xce\\x76\\xa7\\xd7\\x1f\\x9c\\x0c\\xba\\x7d\\x4a\\x5a\\x44\\x04\\xc5\\x5e\\x0f\\x72\\xdc\\x44\\xf1\\x86\\xc6\\x0e\\x1d\\x04\\xaa\\x51\\x2c\\xbf\\xc1\\xf1\\x09\\x74\\xd9\\x62\\x81\\x03\\xdc\\xea\\xcc\\x8b\\x21\\xa5\\xd3\\xeb\\xe2\\xca\\x50\\x29\\x00\\xd9\\x64\\x49\\xe5\\x7a\\x3d\\x00\\x77\\xe0\\xdc\\x86\\xa2\\xf7\\x27\\xb0\\x96\\x4f\\x8f\\x87\\x2c\\xf0\\x60\\x45\\xc1\\xca\\x9b\\xcf\\x71\\x61\\x21\\x6c\\x01\\xc7\\xb0\\x00\\x8f\\x1d\\xb1\\x95\\x60\\x2f\\xc1\\x12\\xef\\x8b\\x24\\xb9\\x6b\\x07\\xc7\\x43\\xf4\\xd2\\x2a\\xd3\\x70\\x93\\x75\\x00\\xb8\\xb0\\xc2\\x4f\\x45\\x52\\x0e\\x40\\x05\\x18\\xc0\\x6b\\x27\\x5d\\xec\\x16\\x7d\\xa5\\xfd\\x06\\x9b\\xb9\\xdb\\x83\\x8d\\x29\\x93\\xc4\\x0a\\x3e\\x3d\\x81\\x4d\\x97\\x27\\xed\\xe6\\x52\\x40\\x1b\\x9c\\xf4\\x87\\xb2\\x8f\\x6a\\x47\\x40\\x22\\x4c\\x47\\x57\\x26\\xaa\\x2d\\xd1\\xed\\xf4\\xbb\\x27\\xa7\\xb2\\x59\\xb5\\x30\\x21\\xc1\\xea\\xf5\\x65\\x2b\\xc5\\x96\\x38\\x3e\\xe9\\x01\\xe6\\xed\\x95\\x92\\xbd\\xdd\\xe4\\xd4\\xf3\\x02\\x09\\x16\\xe8\\x04\\x6c\\x2d\\x91\\x9e\\x0f\\x13\\xa6\\xa7\\x73\\x82\\x89\\x2b\\xc4\\x61\\xdd\\x13\\x8b\\x1e\\xe5\\x7a\\x81\\xa5\\x84\\x53\\x19\\x00\\x2a\\x0f\\x09\\x24\\x83\\x21\\x20\\x42\\x85\\x36\\xf2\\x25\\x0b\\xc8\\x3e\\x82\\x21\\x21\\xee\\x1c\\x5a\\x27\\x0c\\x7d\\x68\\x65\\x2b\\xed\\x14\\x80\\x45\\x73\\xdc\\xeb\\x76\\xe5\\x07\\xb9\\x75\\x06\\xf2\\x55\\x61\\x91\\x6e\\xb7\\x83\\x2b\\x5b\\xa6\\xae\\xb3\\x78\\x1d\\x78\\xb0\\x71\\x01\\x47\\xc3\\x99\\x23\\x12\\x73\\x28\\xf5\\x4e\\x8f\\x4f\\x60\\x2d\\xa8\\xe4\\x1c\\x75\\x9c\\x58\\x27\\xc7\\xc7\\x00\\x3d\\x99\\xbe\\xc6\\x83\\x50\\x94\\x18\\xf6\\x3b\\xb0\\x22\\x44\\x7a\\x81\\x28\\xfa\\xb0\\x36\\x7b\\x96\\xca\\x2f\\x90\\x85\\x58\\xd3\\x40\\x12\\x76\\x8e\\xa1\\x5d\\x7f\\x16\\x16\\x0b\\x0b\\x00\\x00\\x5b\\x0b\\x12\\xc3\\x14\\x5d\\x61\\xae\\xf0\\x04\\xeb\\x76\\x4e\\x06\\x50\\x81\\x9f\\xa4\\x9b\\x38\\x4a\\xd4\\x21\\x86\\x45\\x23\\xd7\\x75\\x12\\x3f\\x94\\x29\\xdd\\x53\\x16\\x3a\\x37\\xce\\xdf\\x51\\x8e\\x13\\x86\\x27\\x43\\x58\\xb7\\x90\\x08\\x8b\\x06\\x0e\\x21\\x58\\x80\\x68\\x47\\x0c\\x5f\\x00\\x15\\x0f\\x06\\x98\\x80\\x3e\\xd1\\x71\\x4f\\xf6\\x60\\xd5\\xd3\\xdb\\x2c\\x76\\xae\\xec\\x63\\xab\\x7f\\x72\\x0c\\xc8\\xac\\x40\\xc9\\x80\\xda\\x60\\xc3\\x8b\\x77\\xea\\x3e\\xe0\\x84\\xd3\\x1e\\x1c\\xa4\\x0a\\xb6\\xfd\\x1e\\x6c\\x00\\x98\\xfa\\x35\\xf0\\xd8\\x1a\\xaa\\x18\\x0c\\x07\\xc7\\x30\\x54\\x91\\x4c\\x60\\x02\\x74\\xda\\x85\\xed\\x24\\x92\\x0a\\x38\\xc1\\xda\\xe9\\x9e\\xc2\\x5c\\x50\\xb2\\x06\\xa6\\x7e\\xef\\x04\\x50\\x4d\\x0f\\x92\\xd7\\xce\\xc6\\x81\\x91\\xad\\xc5\\xc6\\xb5\\x8e\\x8f\\xd9\\x1a\\xa5\\x18\\xeb\\x6c\\x3e\\xa7\\xb1\\xc2\\xff\\x21\\x9b\\x17\\x67\\x88\\x2f\\x86\\x27\\x80\\xf6\\x99\\xda\\x1b\\xc3\\x8e\\x05\\x6b\\x68\\x1d\\x64\\x2b\\x3c\\xa3\\xbb\\xfd\\x61\\x0f\\x0a\\x47\\xb7\\x33\\x89\\x64\\xa1\\x6d\\x38\\x23\\x60\\x27\\xca\\x25\\x81\\xab\\xec\\x18\\x76\\x32\\xa0\\x5c\\x0f\\x20\\x2c\\x53\\x87\\x43\\x58\\x12\\x70\\xfc\\xca\\xe1\\xc3\\x52\\x82\\x41\\xc0\\x84\\x6c\\x24\\x3d\\xd0\\x85\\x33\\x75\\x00\\x47\\x4d\\x1c\\x6d\\x1c\\xb1\\x1f\\x60\\x9f\\x0d\\xf1\\x98\\x48\\x9c\\xd9\\x2c\\xf0\\x44\\x36\\x98\\x5d\\xd8\\x0d\\xc7\\x2c\\xdf\\xa3\\x80\\xfc\\x60\\x3b\\xc3\\x7b\\x38\\x53\\x35\\x0d\\xad\\x1e\\x94\\xec\\xb3\\x62\\x31\\x5a\\x03\\x48\\x3a\\xc6\\x84\\x64\\x09\\xdb\\x8a\\x40\\x00\\xa3\\x38\\x61\\x89\\xef\\x85\\x21\\xec\\x13\\xc8\\x30\\x3c\\x86\\xe5\\x0a\\x74\\xc1\\x0d\\xa2\\x3c\\x40\\xfd\\x5d\\xc4\\x1a\\xa5\\xfd\\x0d\\x94\\x49\\xb1\\x90\\x61\\x34\\x96\\x35\\x94\\x29\\x62\\xb3\\xf7\\x60\\x4e\\x61\\x4a\\xb5\\x7d\\xae\\x52\\x42\\xb9\\x91\\x07\\xa7\\x30\\x97\\xa5\\x45\\x3f\\xe8\\x5b\\xd0\\x6a\\x8e\\x02\\xfa\\x43\\x20\\x22\\x00\\x2e\\x29\\xa2\\xbf\\x1e\\x6e\\x16\\x7c\\xf1\\x00\\x3f\\xc2\\x90\\x4e\\x87\\x44\\x47\\xa6\\x00\\x4c\\xc0\\x41\\xb0\\xc6\\x80\\x74\\x49\\xa3\\x95\\x93\\x46\\x84\\xf5\\x8f\\xe1\\x4c\\x67\\xda\\xce\\xe9\\x0e\\x60\\xe1\\x0f\\x99\\x3c\\x60\\x61\\x29\\xc1\\x51\\x7c\\x32\\x64\\xb7\\x4b\\xcf\\x49\\x89\\xb2\\xeb\\xe1\\x88\\x8a\\x03\\xf0\\x18\\x8e\\x16\\xf1\\x9a\\xac\\xa2\\x6b\\x45\\xfc\\xc1\\x06\\xd0\\x30\\xd1\\x10\\x05\\xc8\\xe2\\x5d\\x2d\\x47\\x58\\x11\\xd6\\x71\\x7f\\x6b\\x8e\\xbe\\xaf\\x52\\xa4\\xc3\\x8b\\xf4\\xef\\x1d\\xe9\\xde\\x67\\x23\\x9c\\x63\\x93\\x84\\x9b\\xb2\\x44\\x31\\x7f\\x4d\\x3e\\xd7\\xee\\x96\\x31\\x7f\\x81\\x92\\x7c\\xf2\\x0e\\x97\\xdc\\x3c\\x6a\\x63\\xc3\\x7c\\xf3\\xbe\\x52\\xdf\\xcd\\xe7\\x1e\\x93\\x3a\\x8f\\x23\\x61\\x63\\xfc\\x96\\xbc\\x0a\\x31\\x21\\x87\\xf2\\xc6\\xb1\\x9d\\x51\\x9c\\x79\\xcd\\x49\\x5f\\xac\\x3b\\xd7\\x7d\\xc4\\x42\\x20\\xca\\x7d\\x11\\x4b\\xcd\\x29\\x34\\xa0\\x35\\xa9\\xc6\\x50\\xc4\\x27\\x8f\\x2a\\x75\\x14\\xbe\\xf1\\xbe\\xe4\\x3a\\x39\\xab\\x0a\\xde\\x91\\xee\\x95\\x4f\\x4b\\xe5\\xd1\\x15\\x98\\xae\\xb1\\xa0\\xfb\\x05\\x40\\xb6\\x20\\x32\\x45\\xe8\\x1f\\xfd\\x5e\\x42\\xf7\\xe9\\xec\\x08\\x8d\\x43\\x18\\xc1\\x3f\\x6b\\xff\\x6c\\x14\\x3e\\x12\\xda\\x1f\\x6b\\xed\\x05\\xfb\\x67\\xad\\xf6\\x4f\\xb3\\x01\\x5f\\x6c\\x65\\x19\\x82\\xec\\xd0\\x7b\\x6f\\xf1\\xfa\\x6e\\x6d\\xfc\\x73\\x82\\x25\\x1a\\xb5\\x8f\\xe1\\xb4\\x66\\x52\\xa4\\x2e\\xa4\\xce\\x5f\\x46\\x33\\x0f\\x66\\xd0\\xd2\\x74\\x90\\xa8\\xdf\\x15\\xde\\x08\\xe2\\x9d\\x2c\\xef\\xa3\\xdb\\x04\\xbe\\xea\\x56\\xa0\\x74\\x05\\x97\\x47\\x16\\x88\\x31\\xa9\\xd9\\x51\\x81\\x1b\\xb0\\x2f\\xdf\\xa9\\xcc\\xb5\\x59\\x8d\\xd5\\x64\\xbe\\xfb\\x5a\\x63\\xd7\\x09\\xbc\\xa6\\x64\\x45\\x6e\\xac\\x85\\x26\\xab\\x30\\x22\\x6e\\xd4\\xec\\x6f\\x66\\x13\\x8a\\xa6\\x32\\xad\\x6d\\x25\\xc0\\xa0\\x36\\xf8\\xb0\\xc5\\x4b\\x0a\\x9e\\x8e\\xcb\\x7d\\xca\\xad\\x41\\x71\\xca\\xd0\\xa1\\x8d\\x9d\\xa1\\x14\\x57\\x1b\\xc6\\xe1\\x75\\x4b\\x23\\x4a\\xce\\x78\\xa0\\x06\\x45\\x8e\\x3b\\x33\\xf5\\x96\\xf1\\x67\\x1d\\xe6\\x4b\\x16\\x3b\\x21\\xe5\\xdb\\x3e\\x79\\x1a\\xd4\\x60\\x0b\\x7b\\x47\\x77\\xca\\x37\\xf2\\x1a\\x0d\\xf4\\x09\\x50\\x99\\xd7\\x33\\xa9\\xc1\\x5e\\xff\\xd9\\xee\\x07\\xb4\\xee\\x16\\x97\\xb2\\x8d\\x86\\xb7\\x4d\\xb8\\xd7\\xe8\\x4a\\x2f\\x3f\\x7b\\xf9\\xd4\\x3c\\x75\\x7a\\x14\\x42\\xcb\\xc8\\xd0\\xd1\\x4b\\xc7\\xda\\x6b\\xab\\xd1\\x35\\x8f\\x8e\\x1a\\x8d\\xc4\\xb4\\xe9\\x63\\x4c\\xbe\\x57\\x9f\\x59\\x78\\xe5\\x91\\x9b\\x94\\x03\\xb8\\x8a\\x45\\x56\\x13\\x8b\\xec\\x9f\\xc2\\x16\\x7b\\x14\\x9c\\x25\\xa3\\x3c\\x0c\\x80\\x5e\\x73\\xd2\\x68\\xa0\\x44\\x5f\\x38\\xf1\\xa4\\xaa\\x4d\\xac\\x38\\x77\\x11\\x26\\x3a\\x66\\x1e\\xe8\\x57\\x82\\x8a\\x98\\xe8\\x98\\xb2\\xd1\\x70\\x0a\\xb7\\x62\\x31\\x40\\xc4\\x35\\xd1\\x52\\xda\\x0f\\x33\\xaf\\x50\\xf7\\x93\\x3d\\x65\\x49\\xd3\\xc9\\xd5\\xd3\\xf3\\xd4\\x22\\x08\\x99\\xb0\\xd3\\xba\\x87\\xed\\x8e\\x7f\\xd0\\xb4\\x80\\x05\\x85\\x9d\\x5f\\xc2\\x2d\\xd4\\xd0\\x40\\x07\\x6a\\x18\\xc2\\x0c\\x9a\\x8a\\x46\\xc5\\xa4\\x2d\\xc9\\x71\\x11\\x24\\xfa\\x47\\x47\\xb1\\xf8\\xb6\\x54\\x66\\x36\\x8c\\x4a\\x8c\\xd2\\xa3\\x23\\x89\\x5e\\x96\\xa4\\x60\\x39\\x07\\x08\\x98\\x0f\\x0f\\xd2\\x7e\\x6c\\x99\\xf7\\xcc\\xc1\\x65\\x37\\xdf\\x0d\\x6b\\x4f\\x73\\x5e\\xf6\\x9b\\x46\\x71\\x2a\\xcd\\x7c\\xc3\\x89\\x22\\xb4\\xe3\\x52\\x53\\xcd\\x3b\\x8a\\x3a\\x84\\xad\\x52\\x8e\\x43\\xaa\\x74\\x3b\\x4a\\xae\\x7a\\x42\\x33\\x26\\xc3\\xc2\\x14\\x7a\\xa7\\xfc\\xc3\\x91\\x3b\\x21\\x81\\xe1\\x27\\xd9\\x0e\\x1a\\xca\\x83\\xff\\xa6\\x7b\\x1a\\x8c\\x6a\\x0b\\x1c\\x8a\\xdf\\x10\\xc1\\x20\\xc2\\xa9\\xb9\\x2d\\x50\\x9a\\xa9\\x36\\xeb\\x47\\x52\\xaf\\xd4\\x87\\x55\\xed\\x02\\x06\\x6b\\xf6\\x77\\x0a\\x91\\xc4\\xcc\\x85\\xb3\\x46\\x1c\\x39\\xb8\\xf3\\x59\\x0d\\x8d\\x81\\xdb\\x90\\x58\\xa3\\x93\\x28\\xd5\\xbe\\xfe\\xff\\xd4\\xd7\\xd4\\xb9\\x6a\\x26\\xde\\x1a\\xfd\\x99\\x7b\\xb3\\xa6\\xf0\\x75\\x24\\xdd\\xf1\\xfd\\xdb\\x61\\xbf\\x38\\x2c\\x74\\x59\\xea\\x32\\xcf\\x65\\xb1\\xb0\\xdb\\x98\\xdc\\x89\\xab\\xbc\\x1a\\x7a\\xa9\\x01\\xac\\xfb\\x22\\xf4\\x57\\x74\\xd3\\xf0\\x5d\\xec\\xac\\xbc\\x9a\\x39\\x7d\\x78\\xd0\\x3b\\xad\\xdd\\x4d\\x87\\xac\\x73\\x6c\\x92\\xdb\\x07\\x0a\\xd9\\xf2\\x54\\xd5\\x7d\\xa5\\x9b\\x0f\\x3b\\xb0\\x27\\x9d\\x22\\x17\\x2a\\x2c\\x0a\\x8b\\x7a\\x8d\\x14\\x17\\xb2\\x6b\\x43\\x5d\\x76\\xc6\\xe6\\x36\\x20\\xa0\\x50\\x84\\x89\\x1b\\xfd\\xe2\\x8c\\x7f\\x71\\x5a\\x21\\xf7\\xed\\x7f\\x3b\\xdc\\x87\\x31\\xc1\\x9f\\xd0\\x7d\\x78\\x30\\x52\\x97\\x97\\xae\\xde\\x53\\x17\\x36\\xb9\\xcb\\x81\\xaa\\x73\\x8d\\x4f\\x64\\x34\\xae\\xfa\\xda\\x9a\\x23\\x97\\xa8\\xcb\\xb8\\xde\\xe0\\xe5\\xff\\x87\\x54\\x0a\\x7a\\xe3\\x28\\xdb\\xf3\\xdd\\xa4\\x56\\x9f\\xb8\\xef\\xa6\\x1c\\x46\\x58\\x37\\xd2\\x42\\x5c\\xd7\\x41\\x5f\\x15\\xa6\\xd9\\x4e\\x6d\\x3d\\x8b\\x14\\x8a\\x65\\x2e\\x9f\\xd4\\x36\\x78\\xd1\\x0c\\xff\\x1c\\xf8\\x37\\x87\\x7f\\x6b\\xf8\\x17\\xc2\\xbf\\x8f\\x77\\x57\\x03\\x54\\x08\\x86\\x7f\\xf0\\xdf\\x35\\x3a\\x6f\\x82\\x7f\\xdf\\xc3\\xbf\\x0f\\xf0\\xef\\x1d\\xfc\\x7b\\x5d\\xc3\\x70\\x83\\xac\\xf6\\x67\\x6d\\x4a\\xeb\\xe5\\x55\\x4a\\x6e\\x64\\xc5\\xd2\\x7a\\x47\\x2e\\x37\\x2a\\x5d\\xeb\\xe4\\x42\\x4f\\xb4\\xea\\xb3\\xce\\xc8\\xb6\\xaf\\xce\\x31\\x98\\x76\\x4a\\x5a\\xe7\\x6a\\xb0\\x50\\xe6\\xbd\\x70\\x72\\x88\\x36\\x32\\xbc\\xd3\\xd0\\xae\\xf1\\x3b\\x70\\xbc\\x75\\x1b\\xb9\\x76\\x40\\x98\\xeb\\x06\\x74\\x2c\\xcc\\x9b\\x8b\\x92\\x9b\\xc0\\xc5\\x17\\xd2\\xcf\\x3e\\xeb\\xd5\\xb5\\x4a\\x0c\\x3c\\x23\\xdb\\x3d\\x13\\xeb\\xcf\\xdc\\xc9\\x49\\xc3\\x6b\\xf7\\xa4\\xaa\\xaf\\xef\\xf2\\xb6\\x31\\xb6\\x8d\\xc9\\x7f\\xee\\xd1\\xa8\\x67\\xf2\\xfc\\x8c\\xff\\x07\\x5d\\x41\\x1b\\x93\\xc6\\xc7\\xe6\\x37\\x94\\xf4\\x8f\\xff\\xc1\\x1f\\x0b\\xfe\\x7d\\x9c\\x35\\xe0\\x2f\\xc3\\xa7\\x56\\x73\\x2c\\xde\\x26\\x4e\\xf3\\xf3\\xb7\\x90\\xa1\\xed\\xb3\\xc8\\xcd\\x65\\x8f\\x57\\x55\\xde\\xc1\\xc2\\x5c\\xc2\\x69\\x74\\x61\\xae\\xdd\\xaa\\x3c\\xe2\\x7b\\x6b\\x1e\\x47\\xab\\x97\\x12\\x61\\x93\\xd2\\x45\\xf4\\x85\\x0a\\x4f\\xd0\\x21\\xd2\\x17\\xf2\\x74\\x86\\x90\\xe9\\x8f\\x2f\\x67\\x82\\x97\\x5f\\xd7\\xc0\\xf0\\xbc\\x74\\x12\\xb2\\x76\\x5b\\x54\\x7b\\x5b\\xc4\\x42\\x30\\xfb\\xae\\x9f\\x08\\x74\\x05\\x98\\xe3\\x70\\x46\\xa0\\x8f\\xa2\\x10\\xf5\\x64\\x9c\\x80\\xb2\\xce\\x0f\\x67\\xfd\\xce\\xbf\\xf3\\x66\\x94\\x29\\xae\\xcc\\x74\\x60\\xe5\\xe4\\x25\\xb5\\xeb\\x85\\x62\\x45\\x58\\x94\\x11\\xe3\\x8d\\xe2\\x8a\\x1a\\x50\\x80\\x75\\xe1\\x3e\\xcd\\xa1\\x59\\xc3\\xad\\x89\\xe7\\x96\\xeb\\x12\\x46\\x18\\xfd\\xad\\x5f\\x11\\xdc\\x2f\\xbc\\x14\\x53\\xed\\x03\\x17\\x7d\\x97\\x68\\x97\\xfd\\xeb\\x87\\x97\\x14\\x2d\\x04\\x01\\x86\\xd9\\x37\\x5f\\xce\\xbd\\x91\\x99\\xbf\\x03\\xdc\\xf2\\x27\\x20\\x8f\\x2f\\x95\\x50\\xf9\\x64\\xb1\\x1f\\xa2\\x2c\\x4e\\xbe\\x54\\x86\\x32\\xc9\\x02\\xe7\\x7e\\x10\\xa0\\x0f\\xe7\\x28\\x9c\\x7d\\xb1\\x9c\\x9e\\x37\\x2f\\x1e\\x66\\xa9\\xf7\\x84\\x92\\x94\\x4d\\x15\\x02\\x7a\\x62\\xf9\\xc5\\x22\\x98\\x49\\x16\\xb8\\x78\\x5a\\xff\\x2e\\x4a\\x5d\\x43\\xb4\\xfb\\x68\\x09\\xcc\\xa0\\xe5\\xfd\\x0c\\x8b\\xf1\\xe7\\xf9\\xbc\\xe4\\x49\\x34\\x2f\\x65\\x6d\\x85\\xa3\\xbe\\x9f\\xe7\\x87\\xab\\x94\\x19\\xb0\\xca\\x64\\x7f\\x71\\x04\\x2e\\x32\\x76\\x72\\x45\\x68\\xa6\\xb4\\xad\\x4b\\x4d\\x6d\\x45\\x96\\xdc\\x1c\\x28\\xb8\\x79\\xb4\\x5c\\xd5\\x92\\xc9\\x0b\\xab\\x8f\\x8f\\xd6\\xb0\\xb7\\x7a\\xf2\\xe2\\xf4\\xe5\\xd1\\xb2\\x87\\x16\\x52\\x5e\\x85\\x9e\\xe1\\x0b\\x35\\xed\\xad\\x29\\xad\\x12\\xfa\\xf6\\x78\\xf9\\xdd\\xe5\\x55\\x94\\xc6\\x2f\\x8f\\x96\\xad\\x58\\x69\\x79\\xe9\\x8b\\x27\\xf4\\x7d\\x77\\xd1\\x89\\xc2\\x98\\x7a\\xb0\\x98\\x38\\x74\\x02\\x81\\x64\\x0a\\x0c\\x33\\x72\\x5c\\x8a\\xd6\\xc5\\xbf\\x4b\\x2b\\xe3\\x74\\x71\\xf8\\x3e\\x73\\xa4\\x7f\\x27\\x35\\x6a\\xc0\\x6f\\x78\\x1d\\xb7\\x65\\x65\\x24\\x49\\x19\\x72\\x4c\\x11\\xb6\\x34\\xfc\\x62\\x98\\x0d\\xc2\\xbd\\x55\\x07\\x40\\x29\\x1b\\xa1\\x45\\xea\\x51\\xc2\\xe5\\x83\\xd0\\x6d\\xcf\\x93\\x5b\\x19\\x50\\x3c\\xea\\x13\\x3c\\x17\\x9f\\xa1\\x9f\\xbb\\xc3\\x28\\xdc\\x6f\\xba\\xae\\xd1\\xf5\\x7a\\xcc\\x2a\\x85\\x3e\\x3a\\xd8\\x5b\\x46\\xef\\x12\\x39\\x88\\x17\\x81\\x62\\x01\\x7d\\x57\\x0e\\x5b\\x84\\x6b\\x2a\\xf2\\x3d\\x3a\\x5c\\x91\\xa5\\xd9\\x11\\x83\\x85\\x6e\\x27\\x12\\xcc\\xa5\\xb1\\xe4\\x23\\xc5\\x0f\\xbb\\x03\\xfd\\x79\\x8e\\x1d\\xad\\x30\\x3c\\x97\\x90\\xd1\\x0c\\xe0\\x75\\x72\\x24\\x6c\\xa6\\xcd\\xa1\\xd7\\xaf\\x8b\\xae\\x96\\xf1\\x11\\xf4\\x28\\xad\\x4a\\x05\\xda\\xee\\x64\\xd8\\xf7\\x06\\x30\\xa0\\x49\\x2d\\x81\\xb3\\xcf\\xd9\\x90\\x19\\x97\\x7c\\x48\\x81\\x7e\\x16\\x4f\\xb7\\xde\\x2c\\x54\\xcf\\xe9\\x12\\x76\\xb2\\x78\\x9c\\xc7\\xbe\\x78\\x48\\x1c\\xe8\\x0f\\x3e\\x4e\\x0f\\x48\\xa5\\x52\\x7e\\xdc\\x14\\x57\\xe5\\x1e\\x8c\\x03\\x1d\\xb8\\x57\\xae\\x4a\\x43\\x5b\\x95\\x66\\x15\\xf0\\x9b\\xea\\x65\\x43\\x13\\xf1\\xed\\xf1\\xa1\\xc5\\xba\\x37\\x6b\\xc7\\xf5\\x92\\x22\\xe7\\xce\\x1c\\xaa\\x9e\\x29\\x08\\xe7\\x8d\\x54\\x81\\x5a\\x9f\\x27\\x94\\x6c\\x00\\x4f\\x4e\\x5d\\x69\\x1f\\x43\\xff\\x30\\x4a\\x23\\x79\\xd6\\xc6\\x61\\x36\\x6a\\x49\\x6d\\xca\\xbd\\x7c\\x7e\\x65\\x0a\\x4d\\xbf\\x57\\x9a\\x79\\xfc\\x22\\x6a\\x84\\x02\\xff\\x6f\\xf4\\x4c\\x90\\x25\\xad\\x5b\\xcf\\xbb\\xc6\\xda\\xc4\\x6c\\xab\\x94\\xa4\\x48\\x2a\\xd6\\x22\\x7d\\x50\\x2b\\x55\\x7e\\x2c\\x2d\\x56\\xcc\\x20\\x57\\x6b\\x9e\\x43\\xbc\\xd3\\x4c\\x27\\x2e\\xbf\\xaf\\x35\\x6b\\x36\\xb0\\x00\\x97\\x76\\xed\\x9b\\x1a\\xb3\\xec\\x9a\\x55\\x03\\xb8\\x03\\x79\\xfc\\x9f\\x8f\\x49\\x1d\\x68\\xdd\\x36\\x5b\\xe2\\xcb\\xb7\\x6d\\xa4\\xfd\\xc9\\x85\\x5c\\x95\\x65\\xef\\xbd\\x08\\x07\\x27\\x02\\xb4\\xd9\\xef\\x52\\x52\\xdb\\x85\\xa5\\x2c\\x13\\x7e\\x4e\\x49\\x9f\\x50\\xb8\\x8d\\x27\\xc2\\x4b\\xd4\\x64\\xdc\\xcf\\x80\\x90\\x5c\\x39\\x81\\x5d\\x6b\\xd5\\x58\\xba\\x8c\\x32\\x94\\x5b\\x27\\x36\\xb2\\x9e\\x0b\\x20\\xf5\\xd6\\x40\\x9a\\xda\\x93\\xde\\x94\\xb9\\x59\\x1c\\x7b\\xa1\\xbb\\xb1\\x27\\xb5\\x7f\\x20\\xc7\\x32\\x65\\x68\\xdc\\x4f\\x98\\xb8\\xf6\\xad\\xf3\\xcd\\xb7\\x57\\xdf\\x7c\\xeb\\x7d\\xf3\\xed\\x1f\\xdf\\x7c\\xfb\\x67\\x8d\\xbe\\x40\\xea\\xaa\\xfd\\xed\\xac\\x8d\\xef\\xa9\\xc8\\xf5\\x83\\xfd\\xed\\xb9\\xfd\\xed\\x45\\x0d\\x65\\xfa\\x7e\\x04\\x8d\\x4c\\x6a\\x2f\\x90\\xe5\\x79\\x77\\x4e\\xb5\\x6d\\x30\\xe1\\x42\\x6d\\xb0\\x73\\xb5\\xc1\\x3e\\xe4\\x1b\\xec\\x77\\x6d\\x83\\x7d\\x28\\x36\\xd8\\x77\\x6a\\x83\\x5d\\xe4\\x1b\\x8c\\x25\\xcb\\x28\\xc6\\x15\\x20\\xab\\x14\\xf5\\x89\\xca\\x44\\x45\\xa2\\x0a\\x51\\x5a\\x14\\x85\\x52\\x2b\\x44\\x78\\x58\\xe4\\x27\\x27\\xcc\\x9c\\x98\\x2a\\xf7\\xae\\x62\\xf9\\x78\\xee\\xc4\\xee\\x12\\x7e\\x5f\\xac\\x63\\x3f\\xa0\\x77\\x4c\\xfd\\x29\\x0b\\x3d\\xfa\\x09\\xf0\\xed\\x45\\xb6\\xc8\\x12\\x54\\x30\\xbe\\xf0\\xd6\\xa9\\x47\\xf1\\xf9\\x58\\xed\\x67\\x37\\x8d\\xc4\\xd3\\xdb\\xe8\\x46\\x25\\xbe\\xf2\\x5c\\xf1\\x28\\x3b\\x7b\\xae\\xb5\\x2d\\xda\\x15\\x4d\\x8a\\x06\\xf5\\xe6\\x44\\x6b\\xa2\\x31\\xd1\\x92\\x68\\x43\\xd4\\x2f\\xaa\\xae\\xa1\\x5f\\xf3\\x9c\\x55\\xe4\\x0b\\xb7\\xa5\\x2f\\x0f\\xe4\\x76\\x17\\x1e\\x89\\x8b\\x5c\\x4f\\x27\\xb7\\x13\\x1b\\xb8\\x59\\xf8\\xb7\\xeb\\x65\\x59\\xf8\\x46\\x25\\xb7\\x65\\x6c\\x0d\\x0c\\x36\\xbc\\xaf\\x5d\\xa5\\x4b\\x26\\x7e\\x94\\x83\\x2c\\xe1\\xb8\\x26\\x6d\\x70\\xc8\\x90\\x0a\\x4f\\x35\\x09\\x3d\\xff\\x1f\\x74\\xc7\\xbc\\x43\\xf7\\xc9\\xcf\\xa2\\x08\\xff\\x32\\xf9\\x97\\xc8\\x15\\xbc\\x76\\xc5\\xa1\\xe6\\x8d\\xc4\\x48\\x50\\x88\\xea\\x39\\xbb\\xb6\\x9c\\xc0\\xf7\\xde\\xb8\\x7b\\xde\\x7c\\x5b\\x38\\x54\\x73\\x7c\\x03\\xd8\\x84\\x1e\\xa7\\x94\\xd9\\x4e\\x3c\\xe9\\x3f\\x96\\x34\\xd7\\x61\\x57\\x7e\\xe7\\xe1\\x72\\xda\\xe5\\xac\\x12\\x81\\x30\\xa3\\x95\\x97\\xc6\\x1b\\xf2\\xe8\\x20\\xf3\\xbd\\x8c\\x02\\xe9\\xb6\\xe3\\x90\\xcf\\x5d\\x0c\\x28\\x29\\xf2\\x26\\x0c\\x3d\\x45\\xe9\\x1e\\x48\\xa4\\x0b\\xe8\\xc4\\x23\\x9f\\x4f\\xa5\\x06\\xb6\\x6c\\x06\\xbd\\xb9\\x58\\x2f\\xbd\\xbd\\xce\\xc0\\x19\\x4e\\xc9\\x48\\x0c\\xbf\\x8b\\xfc\\x70\\xd7\\x3b\\x3f\\x7a\\xd0\\x74\\x01\\xe7\\xcd\\xfc\\x10\\x76\\x64\\x82\\x8e\\x18\\x30\\x17\\xd9\\xab\\x90\\x71\\x22\\x43\\x43\\x52\\x28\\x7c\\x9e\\x05\\xa9\\x5f\\x55\\x83\\xde\\x79\\xbd\\xa6\\x03\\xfd\\x0f\\x85\\xb7\\xab\\x83\\xed\\xbc\\xf1\\x43\\x4f\\xb0\\xbb\\xbb\\xed\\x78\\xc6\\x4e\\x57\\xc9\\xeb\\x39\\xf5\\xeb\\x70\\xa1\\xaf\\xeb\\xdc\\x5c\\x00\\x57\\x56\\xfd\\x2e\\x0a\\x36\\x8b\\xbd\\xc9\\x5a\\xee\\xf5\\xa3\\x80\\x4e\\x55\\xfe\\xaf\\xec\\xc2\\x52\\x75\\x01\\x6a\\xfd\\x5e\\xce\\xf1\\x93\\x16\\x8e\\x5c\\x10\\xfe\\x17\\x97\\x0e\\xad\\x18\\xb5\\x2b\\x1c\\xd8\\x14\\x55\\xd2\\xc7\\x15\\x46\\x6b\\x2a\\xed\\x1c\\x68\\xf1\\x1c\\xf6\\xf5\\xca\\x95\\x7e\\xa8\\x5d\\xb6\\x51\\x5b\\x0c\\x3e\\x00\\x62\\xd8\\x59\\x7e\\xe6\\xfd\\xca\\x6d\\xf0\\x7e\\xfd\\x93\\xb3\\x65\\x34\\xd7\\xf6\\x15\\xdd\\xf8\\x5f\\xa0\\x9a\\xbf\\x7c\\x7e\\x1d\\xce\\xe0\\x69\\x2d\\xe0\\x26\\x3e\\xe8\\x96\\x2d\\x6e\\x8b\\xd0\\x01\\xd0\\x97\\xe7\\x6e\\x2b\\x2f\\xcb\\x17\\xde\\x56\\x95\\xc1\\x0a\\xf6\\xec\\x10\\xba\\xf5\\x8d\\x3b\\xc2\\xc6\\xad\\xb3\\x70\\x8c\\x1d\\x68\\x84\\x76\\x58\\xae\\x42\\xbe\\x40\\x71\\x7c\\xa4\\xee\\xf1\\xab\\x02\\x2a\\x57\\x28\\xc0\\x48\\x0e\\x19\\x11\\x23\\xe4\\xcf\\x85\\xf4\\xf8\\x8e\\x4f\\x12\\x1e\\xb2\\x25\\x0f\\xa7\\x26\\x9b\\x93\\xce\\xe0\\x9c\\xa3\\xcb\\xa2\\xb3\\x05\\xba\\x93\\xe3\\xfa\\x95\\x99\\x08\\xa6\\x2e\\xc5\\x9f\\x6b\\xcf\\x98\\xa4\\xf5\\x57\\x0e\\xf3\\xe0\\x8f\\x70\\x57\\xb6\\x52\\x3e\\x44\\x67\\x9e\\xb1\\x42\\x7b\\x48\\x9f\\x4f\\x32\\xdc\\x19\\xcd\\x0c\\x37\\x89\\x85\\xe6\\xdc\\x33\\x74\\xe0\\x99\\x99\\xa3\\x73\\xcf\\x88\\xd0\\xbe\\xfc\\x0e\\x7f\\xa5\\xd9\\x5f\\xda\\x5c\\xb3\\x80\\xbb\\x67\\xd6\\xb8\\x63\\xc3\\xfc\\xdf\\xf0\\x08\\xcd\\x06\\xde\\x39\\xf5\\x80\\xcd\\xf8\\xc2\\x31\\x5c\\xf3\\xac\\x73\\x42\\x91\\xb7\\x66\\xff\\x31\\x6e\\xce\\x82\\xfa\\xfa\\xe8\\x28\\xa8\\xa7\\x67\\x37\\x32\\x48\\xc9\\x06\\x0a\\x74\\xb0\\xc0\\x68\\x23\\x7b\\xbf\\x31\\x73\\x73\\xbe\\x1b\\x6e\\xdc\\x34\\x7a\\x43\\xcb\\xfc\\x16\\xfe\\x34\\xd1\\x92\\xfe\\x50\\x25\\x4d\\x55\\xcb\\xfc\\x6c\\x43\\xe0\\x50\\xb5\\xcc\\x49\\x89\\x72\\xce\\x3d\\x93\\x79\\xb2\\x01\\xcf\\x1c\\xcd\\xc6\\xeb\\xb3\\x74\\xec\\x18\\xb8\\x8f\\xce\\xf0\\x67\\x89\\x17\\x20\\x4b\\x80\\x9c\\x8d\\xee\\x6c\\x96\\x5a\\x62\\x82\\x89\\xcb\\x33\\x9e\\x8c\\x8d\\x84\\x40\\x9d\\x08\\x50\\x2f\\x65\\x01\\xd3\\x4e\\xcf\\xd6\\x4f\\xaf\\x4a\\xf4\\x4a\\x84\\x5f\\x18\\xad\\x78\\x8c\\x66\\x67\\xdb\\xd2\\xe5\\xd7\\x95\\x5c\\x19\\x69\\xd9\\x18\\xf1\\x0e\\x9d\\x53\\x25\\xec\\x0e\\xc6\\xc9\\x97\\x4c\\x65\\x0a\\xd1\\xb7\\x61\\xc9\\x2a\\x37\\xcb\\x2f\\x05\\x57\\xf9\\x45\\x51\\x73\\x3d\\xda\\x34\\x70\\x36\\x62\\x9a\\x8d\\x71\\xdc\\x30\\x62\\x98\\x31\\x00\\xaa\\xdd\\x44\\xf0\\xda\\xb1\\xe8\\xd6\\x0d\\xd4\\x37\\xe3\\xde\\x48\\xad\\x4e\\xaa\\x8a\\x89\\x1f\\xfd\\x0a\\x15\\x56\\xa2\\xb6\\xae\\x8d\\xd2\\xc5\\xa9\\x79\\x9f\\x19\\x37\\x6c\\x96\\xef\\x1e\\x58\\xed\\xb0\\x95\\xa0\\xed\\x8d\\x79\\xf6\\xd2\\x21\\x28\\x34\\x01\\x3c\\xd0\\x0d\\x60\\xda\\xca\\x83\\xda\\x1d\\x8a\\x53\\x12\\xf2\\xa5\\x4d\\x1e\\x9a\\xcf\\xad\\x71\\x8a\\x2b\\xc2\\x4e\\x4b\\xf6\\xd1\\xba\\xc0\\x50\\xd9\\x9f\\x97\\xec\\xa2\\x75\\x99\\x39\\x7c\\x7b\\x4e\\xbe\\x09\\xc6\\xe2\\x11\\x8e\\xe3\\x50\\x24\\xd8\\xe1\\xf3\\x94\\xfc\\xac\\xe3\\xcb\\x73\\x71\\xa1\\x2b\\x63\\x98\\xb0\\x35\\x2b\\x99\\x8d\\xf1\\x7b\\x81\\x5e\\x42\\x0d\\xbd\\x78\\x39\\x7a\\x89\\x0f\\xa2\\x17\\x35\\x71\\x19\\x4c\\x61\\x81\\x19\\x7c\\xf9\\x86\\xa8\\x21\\x62\\x1b\\xc0\\x82\\x34\\x05\\x45\\x15\\x78\\x92\\x56\\x63\\x9f\\x22\\xa3\\x80\\x74\\xb1\\x32\\xf4\\x06\\x3c\\xad\\x81\\x98\\x59\\x67\\x1b\\x77\\xac\\x4d\\x04\\x9b\\xc3\\xe3\\x82\\x9f\\xc2\\x94\\xd8\\x1b\\x98\\xa5\\x31\\x3e\\xdb\\xcd\\x97\\x8e\\xdc\\x4c\\x4d\\xf8\\x52\\x9e\\x2b\\xc0\\x5a\\xbb\\xf7\\xf0\\x80\\xc6\\x17\\x7c\\x09\\x15\\x01\\x0a\\xa3\\xb8\\x4c\\xec\\x1c\\xaf\\xfc\\x76\\xd1\\xf9\\x95\\xd2\\x8e\\x3e\\xd7\\xdc\\x27\\x11\\x6e\\x23\\x07\\x71\\xae\\x66\\xa0\\x2c\\xe3\\x52\\x9c\\x8b\\x68\\x67\\xe8\\xf5\\x2e\\x95\\xde\\x26\\x3d\\x48\\x84\\x33\\x25\\x10\\x81\\xa1\\x33\\xf3\\xe1\\x01\\x1f\\xd1\\xc2\\xca\\x1c\\x1b\\x8e\\x41\\xa8\\x8b\\x2c\\x5d\\xcf\\xe4\\x0b\\xa2\\x34\\xdc\\x82\\xf8\\x4b\\xb6\\xb3\\xc0\\x4f\\xc9\\xc2\\xd5\\xd9\\xac\\x29\\x99\\xdc\\x02\\x40\\xa4\\x63\\xfa\\x0c\\xf1\\x46\\xee\\x92\\x9d\\x79\\xb0\\x71\\x9b\\x30\\x4a\\x0c\\x55\\x5d\\x38\\xe7\\x13\\xfe\\xdb\\x7c\\x8c\\x88\\x95\\x9e\\xf1\\x78\\x04\\x85\\x98\\xe8\\x2f\\xc6\\xd4\\x67\\x46\\xc4\\x1d\\xea\\x02\\x13\\x75\\x9f\\x01\\x1e\\x33\\xd6\\x30\\xe3\\xc2\\xbe\\x17\\x30\\x3a\\x75\\x40\\xdd\\x5c\\x9e\\xf3\\x3b\\x61\\x66\\x09\\xed\\x70\\xce\\x93\\x87\\x07\\xf1\\x30\\x1f\\x4f\\x26\\x16\\x34\\x0d\\xff\\xa6\\x2c\\x7f\\x9a\\xda\\x93\\x09\\x2c\\x56\\x48\\x81\\xe5\\x3a\\x9d\\x6e\\xb7\\x86\\xa9\\x80\\x8f\\xb6\\x43\\x71\\xe4\\x97\\xbd\\xd7\\xde\\xb9\\xfc\\xca\\xe5\\x97\\x2e\\xbf\\x75\\xf9\\x85\\xcb\\xaf\\x5d\\xfe\\xda\\xe5\\x2f\\x5c\\xfe\\xd6\\xe5\\x2f\\x5d\\xfe\\xb9\\xea\\x28\\xfe\\xe4\\xaa\\xc9\\x7b\\xeb\\x32\\x0f\\xb2\\xc1\\x80\\x3f\\xbb\\x30\\xe2\\xb4\\x9e\\x36\\xbc\\xba\\xd7\\x88\\xeb\\xb9\\xc6\\xc2\\x67\\x87\\x9c\\x4c\\xa7\\x50\\x31\\x64\\x7d\\x8d\\x59\\x5f\\xb8\\x0c\\x96\\xd4\\x95\\x4b\\xc9\\x97\\x98\\x7c\\x8b\\xc9\\x17\\xae\\x59\\xae\\x82\\x61\\x59\\x73\\x9c\\x8f\\xcc\\x9e\\x88\\x68\\x62\\xa9\\x13\\x76\\x31\\x52\\x8d\\x09\\x88\\x9e\\xa5\\xa9\\x11\\xb7\\x0b\\x9b\\xe7\\xcc\\xc4\\x54\\x79\\x87\\x73\\xe7\\xb2\\x2b\\x97\\x41\\x0b\\x50\\xff\\x85\\xcb\\xa0\\x07\\xd0\\x3e\\xb4\\x0e\\xbd\\x86\\x3e\\x43\\x8f\\x3f\\x15\\xa4\\xc3\\x95\\xa4\\x13\\x2e\\x3d\\x6d\\x27\\x5f\\x14\\x5b\\xf9\\xda\\x3b\\xb8\\x97\\x3f\\xe9\\x87\\xfb\\xeb\\x83\\xf4\\x41\\x29\\xdb\\x85\\x07\\x84\\xf3\\x1b\\x97\\xbf\\xf1\\x8c\\xb7\\x1e\\x7b\\xe7\\xb1\\xbf\\x3d\\x36\\x69\\x7e\\x72\\x58\\x13\\x7d\\xc6\\xc0\\xb2\\xfc\\xe0\\xf2\\x8e\\x77\\xaa\\x68\\x02\\x37\\xf0\\xd7\\xbb\\x86\\x64\\x65\\xc3\\x74\\xe1\\xfe\\xee\\x5e\\xcc\\x51\\xd5\\x55\\x0e\\xc5\\x77\\x45\\xf1\\x34\\xcc\\xff\\xb3\\x0e\\x82\\xda\\xa7\\xa8\\x3c\\x2a\\xc9\\xc2\\x10\\x39\\x22\\x52\\x6e\\x51\\xdc\\x79\\xc4\\x9a\\xca\\xe7\\x3f\\x02\\x35\\xca\\x1b\\x18\\xc2\\x5e\\x04\\x6b\\x17\\x8f\\xb8\\xac\\xf1\\xb1\\x33\\x15\\x26\\x8f\\xe2\\x11\\xb7\\x5a\\xb9\\x0b\\xd2\\x1f\\x91\\x89\\x91\\xa3\\x26\\x13\\x18\\x07\\x2c\\x59\\x18\\x09\\x2e\\xd9\\x42\\xd9\\x48\\x74\\xc8\\x98\\x08\\x07\\x48\\xb9\\x35\\x2e\\x12\\xeb\\x86\\x82\\x4d\\x14\\xfa\\xee\\x6b\\xf4\\x74\\xff\\xa2\\x44\\x4f\\x16\\x9e\\x23\\x3d\\xe3\\x2f\\x8c\\xa5\\xd4\\x8a\\x9d\\x5b\\xfe\\x97\\xa7\\x96\\xb3\\x13\\x00\\xc3\\x99\\x54\\x1b\\xb6\\xee\\xd7\\x6b\\x40\\xf1\\x28\\x45\\x31\\x14\\x74\\x82\\xa1\\xd3\\x58\\x61\\x89\\x67\\x4c\\x9a\\xad\\x21\\xeb\\x9d\\xb4\\x8e\\x85\\x43\\x51\\x07\\xa8\\xe5\\x20\\x31\\x26\\xdd\\xd3\\xd6\\x80\\xf5\\x07\\xad\\x01\\x24\\x93\\x1d\\xa0\\xd1\\xb1\\x8e\\x2d\\x71\\x93\\x5b\\xb4\\xfe\\x6b\\xe2\\x1c\\xf6\\x16\\x23\\xbc\\x3d\\x12\\x93\\x12\\x91\\x03\\x95\\x5c\\x36\\x2a\\xd0\\x01\\x92\\x63\\x40\\x88\\xa5\\x0f\\x0f\\x46\\x2c\\x1f\\x51\\xb5\\x40\\x3e\\x6e\\xcb\\x41\\x38\\x4a\\xcd\\x1a\\xa6\\xb0\\x34\\x7d\\x74\\x98\\xa8\\x5c\\x5a\\x1a\\x67\\x97\\x0d\\x4e\\x68\\x3c\\xda\\x30\\x07\\x03\\x36\\x1c\\x20\\x16\\x7d\\x42\\x75\\xc7\\xe5\\xea\\x7a\\xac\\x73\\xda\\x3a\\x2d\\x57\\x77\\xc2\\x3a\\x27\\xe4\\x4f\\x57\\x1e\\xab\\x65\\x6d\\xa2\\x94\\xc3\\x32\\xf1\\xb4\\xf5\\x11\\x4a\\x37\\x29\\x15\\x82\\x56\\x5f\\x42\\x1d\\x2f\\x83\\xfd\\xc2\\x68\\x54\\x46\\x0b\\x40\\xe2\\x40\\x38\\x44\\x48\\x61\\x19\\x0a\\xcf\\x39\\xc2\\x25\\x82\\xf2\\x2e\\x68\\x64\\x67\\xbc\\xd5\\xe9\\x1e\\x1d\\xb5\\xba\\xbd\\x3e\\xa2\\xb0\\xf8\\x8c\\x37\\x5b\\xfd\\xee\\xe0\\xe8\\xa8\\xd9\\xea\\x76\\xfa\\x67\\xf1\\x38\\xb2\\x29\\xcf\\x70\\xb8\\x93\\x09\\xbe\\x62\\xa6\\x4e\\x67\\x00\\x99\\x1c\\xdb\\x37\\x65\\x2f\\xe9\\xbe\\x36\\xdc\\x97\\x05\\x68\\x5d\\x96\\x18\\x16\\x3b\\x1d\\x69\\x6f\\x31\\x77\\x8a\\x37\\xd9\\xc1\\x7d\\x08\\x65\\xc8\\x71\\x2b\\x82\\x0d\\x6d\\x87\\xf4\\x97\\x58\\x7b\\xd9\\xb2\\x7d\\x7e\\xa9\\xe0\\xd5\\xa1\\x5c\\xfe\\x18\\x6b\\x1c\\x7c\\x81\\x16\\x4b\\xc5\\x34\\xfa\\x0f\\x4a\\xea\\x6f\\x71\\x89\\x36\\xcc\\x31\\xe9\\x5e\\x69\\x41\\xb0\\x78\\xda\\x73\\x5c\\x3c\\x6f\\x0f\\xa2\\xdd\\x74\\x87\\x32\\xa2\\xf1\\x96\\x12\\xe2\\x27\\xd2\\x4e\\x69\\x99\\x74\\xf2\\xca\\xaf\\x71\\xe9\\x75\\xbb\\xc5\\x39\\x5c\\xab\\xeb\\xed\\xa7\\x19\\x9e\\xfa\\x45\\x01\\xb4\\xb8\\x8e\\xca\\xaf\\x4e\\xf9\\x35\\x24\\x5a\\x23\\x4f\\x31\\xbf\\xd2\\x2e\\x59\\x2d\\x7c\\x6a\\x47\\x3c\\xb6\\x7a\\x83\\x3a\\xb5\\x93\\x7f\\xd1\\xcc\\xa8\\x8d\\xd2\\xee\\x20\\x42\\x47\\xee\\x9c\\xc3\\xd6\\xd6\\x95\\x3e\\xb6\\x95\\x33\\x5a\\xbd\\x3a\\x71\\xab\\xa5\\x6d\\xc6\\x84\\x0b\\x4b\\xe2\\x39\\x27\\x5b\\xe2\\x5c\\xaf\\xb1\\xb4\\x47\\x53\\x53\\x3b\\xf0\\x00\\xf7\\x27\\xb0\\xf1\\x06\\x03\\x60\\x25\\xe7\\xb0\\xb9\\x7a\\x27\\xf5\\x00\\x4e\\x82\\xa4\\xa1\\xd2\\x1a\\x32\\x0d\\x11\\xad\\xd8\\x23\\xae\\x29\\x16\\x3b\\xec\\x9b\\x48\\xab\\x16\\xeb\\xe9\\x59\\xc7\\xb2\\x8c\\xd5\\x81\\x32\\x15\\x0d\\x75\\xa1\\xd2\\xc6\\x4b\\x07\\xf3\\x74\\xba\\xf4\\x88\\xad\\xd1\\xae\\xae\\x07\\x4d\\xf1\\x01\\x76\\x3b\\x3d\\x57\\xb5\\x99\\x71\\x67\\xa7\\xcd\\xae\\xa5\\xfa\\x89\\x15\\x56\\xb4\\x49\\x55\\xab\\x36\\x87\\x43\\xad\\x51\\xc0\\x21\\x4f\\x6a\\x34\\xcc\\x17\\x89\\x3c\\x66\\x08\\xf0\\xef\\x5d\\xf6\\xca\\x65\\xef\\x5c\\xf6\\xab\\xcb\\xfe\\x76\\xd9\\x77\\x2e\\xfb\\x21\\xc7\\xac\\x5f\\x2b\\x0f\\x79\\x85\\x84\\xe0\\x0f\\x3a\\x09\\xf3\\xdb\\x41\\x4a\\xa7\\x94\\xed\\x87\\x42\\xda\\xf1\\x43\\x2e\\xed\\x60\\xef\\x5d\\x62\\x44\\x5f\\xb9\\xed\\x2e\\x8a\\x10\\x7f\\xce\\xfb\\xf5\\x87\\xf7\\x94\\x8e\\x5d\\xe9\\x2d\\x5f\\x6d\\xd9\\x8f\\x79\\xf9\\xdf\\xf5\\xf2\\x3f\\x15\\xf4\\xdb\\xf7\\x87\\xe9\\xb7\\x1f\\xf5\\xee\\xfe\\xfb\\xe0\\xa8\\x7e\\x54\\xbd\\x87\\x26\\x4a\\x45\\x7e\\xca\\xdf\\x71\\x90\\xdf\\x7b\\x85\\x28\\x67\\x0d\\x74\\xe9\\xe1\\xf3\\x5d\\x53\\x82\\xaa\\xf0\\x16\\xef\\x90\\xcf\\x6e\\x6c\\xf0\\xbd\\x33\\xf3\\xb3\\xc4\\x68\\x38\\x07\\x42\\x45\\xb0\\x08\\x83\\xa9\\x13\\x59\\x05\\xa4\\x40\\xc4\\x81\\x02\\x30\\xcd\\x3d\\xa2\\x9d\\xdc\\xa6\\xa1\\x4c\\x2b\\x0b\\x4a\\xac\\x7a\\x5a\\x10\\x3e\\x91\\xa0\\x2b\\xc2\\x22\\x82\\x24\\x12\\x95\\x70\\xb6\\xf7\\x5b\\x03\\xcd\\x49\\xf6\\x01\\xa9\\xdd\\xfb\\x2a\\x56\\x21\\x33\\x7e\\x70\\xa1\\xe1\\xf7\\xae\\xf2\\x5d\\xb0\\xc7\\x7f\\x28\\x03\\xd0\\xaf\\x61\\x40\\x32\\xe3\\x47\\xac\\xf5\\xb3\\x3b\\x9e\\xbc\\x75\\xdb\\x9f\\x91\\x9c\\x87\\xbf\\x53\\xfb\\x05\\x24\\x5c\\xbb\\xed\\x17\\x48\\xe8\\xc3\\xdf\\xa9\\x7d\\x01\\x09\\x97\\x6e\\xfb\\x02\\x59\\x00\\xf8\\x0b\\x2c\\x84\\x62\\x26\\xb0\\x3f\\xbb\\x92\\xb6\\xa2\\x37\\x7f\\xbb\\xfc\\x3b\\x17\\x78\\xd8\\x77\\x2e\\xff\\xd5\\x15\\x5c\\xec\\x7e\\x1f\\x7e\\xc6\\x3e\\x4c\\x26\\xb4\\xbf\\x60\\xbb\\xd2\\x0e\\x9b\\x4e\\xc5\\xf1\\x10\\xfd\\xbd\\x1b\\x72\\xed\\x11\\x4d\\x79\\x60\\x2a\\x85\\x6e\\xbc\\x22\\x0e\\x1e\\x1e\\x52\\xbc\\xfa\\xb3\\x37\\x0c\\x2f\\x78\\x51\\x55\\x3e\\xa4\\x48\\x45\\x4f\\x8d\\x2d\\x03\\xb4\\xb9\\xd4\\x89\\x8d\\xa9\\x5a\\xef\\xf6\\x9b\\x7f\\x78\\x64\\xf0\\xfb\\x0b\\xf9\\xcb\\xa9\\x70\\xb0\\xbf\\xb7\\xdc\\x1c\\x53\\x34\\x1e\\xd3\\x80\\x8a\\x0f\\x4f\\x3b\\x85\\x1c\\x5e\\xb1\\xa4\\xd3\\x71\\x6a\\x1b\\x3b\\x8b\\x1a\\x0e\\xa3\\x86\\x38\\xf4\\x9c\\x32\\xe4\\x8c\\x5d\\x42\\x19\\x3a\\xa3\\x80\\x20\\x5d\\x62\\xab\\x39\\x21\\x74\\x8b\\x57\\x49\\x55\\xf7\\x8e\\xbb\\x1c\\x51\\x29\\xe4\\xb2\\x17\\xeb\\xae\\xd0\\x64\\xfc\\x23\\x4f\\xc5\\xb0\\xc8\\x4f\\x27\\x3c\\xf4\\x4b\\x9e\\xce\\xf7\\x89\\xaf\\x54\\xdd\\x16\\x51\\x73\\x39\\xb1\\x95\\x56\\x13\\x5b\\x5a\\xce\\x2f\\x11\\x58\\x5a\\xd6\\x2f\\x92\\x53\\x3b\\x79\\xbf\\x44\\x40\\x95\\xfa\\xfb\\x24\\x42\\x69\\xbf\\x84\\x24\\x8a\\xd4\\x54\\x68\\x2b\\x3f\\x8b\\xf7\\x13\\xcf\\xb3\\x14\\x1d\\x35\\x73\\x3f\\xce\\xd9\\x37\\xef\\x53\\xe6\\x03\\xb1\\x03\\x4c\\xfd\\x22\\x0b\\x9c\\xaa\\xc8\\x15\\x59\\x6c\\x38\\xb1\\xe2\\xdf\\x9c\\x58\\xd1\\xfc\\x4e\\x5e\\x3f\\xb1\\x18\\xbb\\x9b\\x4d\\x17\\x7d\\x17\\xac\\x1d\\x3a\\x1a\\x47\\xc9\\xf4\\x2b\\x87\\x21\\xfd\\x01\\xbf\\xb0\\xcc\\x31\\x81\\xbf\\x93\\x29\\xf4\\x90\\xab\\xb3\\xf3\\x20\\x26\\x6e\\x01\\x25\\xcf\\x58\\x28\\x14\\x85\\x98\\xd2\\x5f\\x3f\\xeb\\x8e\\xf1\\xee\\x08\\x92\\x6c\\xc4\\x11\\x7b\\xfc\\x48\\xa9\\x69\\xc5\\x07\\x3c\\xa9\\x07\\xf8\\x9f\\x5b\\x31\\x58\\xd7\\x8f\\xdd\\xc0\\x3b\\xe8\\x31\\x5a\\xdc\\x42\\x54\\x6c\\x3e\\x0c\\xd5\\x5c\\x79\\x7e\\xd8\\x50\\x35\\x0e\\x93\\xdc\\xca\\x61\\xb7\\x9a\\x6a\\x90\\x96\\xe2\\x5c\\x4a\\xaa\\xee\\xc2\\x9c\\x87\\x09\\x89\\x14\\xab\\x64\\xd4\\xa4\\x7a\\x7b\\xc8\\x85\\xcc\\x18\\xb6\\xb7\\x1a\\x60\\x28\\x07\\x88\\x9a\\x0c\\xd2\\xb5\\xa4\\xbc\\xb9\\xaa\\x31\\xed\\x82\\xca\\x9e\\x64\\xd3\\xed\\x56\\x8b\\x97\\x48\\xec\\x7f\\xc6\\x87\\xff\\x9d\\xb3\\xe1\\x58\\x38\\x1b\\x26\\x54\\x06\\xeb\\x4c\\x07\\x5f\\xfc\\x48\\x31\\x8f\\x2f\\x62\\xc3\\x48\\x79\\x23\\x36\\x11\\x1c\\x19\\xcd\\x15\\xc6\\x37\\x39\\xc0\\x02\\x7c\\xb1\\x2e\\xba\\x74\\x01\\x6c\\x2f\\x2a\\x34\\xa5\\x03\\x64\\xd9\\x27\\xe3\\x54\\x13\\x0f\\xcc\\x7c\\x11\\x04\\xbe\\x4a\\x7f\\x1a\\x39\\xd8\\xb4\\xf0\\x03\\x88\\x3d\\xe3\\x6a\\xca\\x7c\\x2e\\x17\\x15\\x30\\xf8\\x42\\x2a\\xe6\\x63\\xbf\\x98\\xf4\\x37\\xec\\x46\\x09\\xbe\\xb9\\xc5\\xb7\\x0c\\xdd\\x35\\xe6\\xdf\\x32\\xa4\\xd0\\xf3\\x6f\\x3e\\x4a\\x84\\xf3\\x6f\\x7e\\x59\\x5b\\x45\\x88\\xe1\\x0a\\xc9\\x1b\\x8c\\x70\\x5e\\x8f\\xcc\\xba\\xd7\\x80\\xa7\\xa0\\x9e\\x34\\xdd\\xfa\\xbc\\xee\\xc0\\x3b\\x34\\x57\\x4f\\x1a\\x01\\xbd\\xe5\\xe3\\x5b\\xa0\\xe7\\x20\\x37\\x7b\\x64\\x21\\x4b\\xf4\\x2d\\xd6\\xc8\\xce\\x45\\x6b\\x79\\xad\\x20\\xc2\\xaa\\xa4\\x67\\x50\\x1b\\x98\\x1c\\xaf\\x16\\xde\\xe0\\xfc\\xf6\\xcc\\xac\\xcf\\x80\\xb0\\x99\\x09\\x47\\xab\\x4b\\x33\\xb7\\xb2\\xd8\\xcf\\x1c\\xb4\\x57\\x66\\x7d\\xc5\\x5c\\xb6\\x12\\x99\\x17\\xe6\\x63\\xb9\\xe3\\xf6\\xda\\xac\\x63\\x48\\xec\\xb5\\x29\\x63\\xdc\\x54\\xa9\\xec\\x01\\xd1\\x1b\\x7e\\x3b\\xc3\\x3b\\x10\\xe9\\xea\\x35\\x79\\xb4\\x52\\xa7\\x7d\\x63\\xd6\\x6f\\x80\\x08\\xbb\\xf9\\x62\\xa5\\x2b\\xad\\xd2\\xb9\\xf4\\x82\\xae\\x11\\x71\\x30\\x8c\\x80\\xe5\\xb7\\x18\\xbc\\x83\\x0e\\xce\\xd7\\x6c\\xc6\\xd1\\xb4\\x98\\xf7\\xd0\\x48\\x91\\x77\\x75\\x32\\x0f\\x0f\\x90\\x4a\\xe9\\xd8\\x41\\x37\\xb6\\x72\\xae\\x0e\\x4d\\x53\\xb8\\x15\\x0e\\xbc\\xa2\\x2c\\xc5\\xba\\xf7\\xab\\x7e\\x14\\x1f\\x2c\\xd1\\x1a\\x45\\xc2\\x69\\x81\\x8c\\x8f\\xb0\\x33\\xea\\x98\\x6c\\x09\\xab\\x16\\xe8\\x5a\\xc0\\x53\\xa8\\x95\\x5e\\xa4\\x2f\\x8c\\xa0\\x2a\\xdd\\x9c\\x12\\x07\\xef\\x3d\\xdd\\x2d\\x17\\x1a\\xc3\\xfc\\x1d\\xc5\\x92\\x63\\x43\\x87\\xe2\\x7e\\xa8\\xbd\\xda\\x61\\x29\\x81\\xc6\\xa8\\x15\\x78\\x22\\xd7\\x2e\\xf8\\x62\\xe1\\x45\\x9b\\x58\\x63\\xf2\\x01\\x2f\\x53\\xc9\\x7f\\xb6\\x48\\x45\\xff\\xda\\x52\\xa2\\xee\\xc3\\x6e\\xcf\\x50\\x64\\x0e\\x5b\\xf8\\x4c\\x48\\xd3\\x03\\xbc\\x84\\x45\\x5f\\xdb\\xa6\\x8e\\xa1\\x8c\\x8d\\x89\\x22\\x56\\x9f\\x21\\xe3\\x9c\\x31\\x49\\xa4\\x6a\\x9d\\x7e\\x2a\\x16\\xcd\\xfb\\xe8\\x15\\x7d\\x74\\x8a\\x3e\\x46\\x45\\x1f\\x63\\xba\\x6f\\x4d\\x79\\x8c\\x56\\x5a\\xe8\\xfa\\x06\\x50\\xd0\\x59\\x44\\x49\\x0e\\x14\\x89\\x50\\xfe\\x58\\xd5\\xc7\\x98\\x39\\x24\\x06\\x8e\\x44\\x1f\\x93\\xd4\\x5b\\x7f\\xcd\\x1c\\x5d\\x40\\xfe\\x7c\\x86\\xe4\\x8b\\x9a\\x1f\\x7a\\x2d\\x66\\xe7\\xe2\\xa9\\x55\\x1b\\x33\\x29\\xb3\\x58\\x89\\xe1\\x91\\xd3\\xb8\\x19\\x5b\\x15\\x40\\x7c\\x7a\\x55\\x6b\\x59\\xd5\\x8d\\x56\\xd5\\x9a\\xdd\\x4c\\xff\\x0b\\x99\\xd2\\x06\\xdd\\xa9\\x25\\xfc\\x06\\x88\\x23\\xd8\\xde\\xa7\\x74\\x7b\\x37\\x8b\\x8d\\x18\\x10\\xd0\\x06\\x36\\x05\\x7e\\x08\\x60\\xcf\\xe3\\x87\\x05\\x7e\\xf0\\x01\\x11\\x6c\\xe8\\xc8\\xd9\\xec\\xac\\x50\\x63\\x32\\xa1\\x4b\\xf5\\xe6\\xa9\\x25\\x04\\x0f\\xf8\\x72\\x6a\\x49\\x51\\x83\\xbe\\xb6\\x55\\xc6\\x13\\xfa\\x28\\x32\\x9e\\x50\\xa1\\xa9\\x8e\\xda\\x3d\\x27\\x7d\\x11\\xbb\\x4f\\xc3\\xec\\x87\\xb0\\xc5\\x24\\x7d\\x78\\x38\\x40\\xb0\\x30\\x0f\\x0d\\xe8\\x2a\\x3f\\x95\\x88\\x86\\x15\\x46\\xea\\xd8\\xc4\\x05\\x4a\\xdb\\x3f\\x54\\x77\\x65\\xfe\\x2a\\x87\\xf1\\x5f\\xb5\\x2e\\x44\\x75\\x51\\x16\\xeb\\x4d\\x78\\x8f\\xee\\x28\\x74\\xf2\\x5b\\x41\\xac\\x79\\x63\\x24\\xaf\\x6c\\x2f\\xa7\\x5a\\xa4\\x1b\\xec\\x27\\xad\\x0c\\x0c\\xad\\xe0\\x55\\xf3\\x5f\\x54\\x6b\\x9a\\xd3\\x1d\\x15\\x4b\\xee\\x91\\x2d\\x66\\x5b\\x5b\\x14\\x34\\x49\\x50\\x69\\x5e\\x2a\\xab\\x8d\\xd2\\xce\\x05\\xe5\\xac\\x53\\xcd\\xbb\\x84\\x6f\\x5e\\x99\\x68\\xa2\\x8a\\xb7\\xfd\\xb3\\x8a\\xff\\xff\\xcb\\x35\\xd9\\x9f\\x52\\x17\\xe8\\x4f\\x17\\x5e\\xf7\\xae\\xf1\\x74\\xf1\\xd6\\x5d\\xfc\\x54\\x31\\xd2\\x6f\\x2e\\xbf\\xaa\\x3c\\x60\\x0b\\x32\\xa7\\xdb\\x36\\x3a\\x8d\\x70\\x57\\xf5\\x58\\x66\\xeb\\x0a\\xfd\\x64\\x74\\x91\\x61\\x84\\x28\\xd9\\x32\\x47\\x39\\x1b\\xfb\\xd9\\x5f\\x65\\xe9\\xd2\\x09\\x1e\\xbb\\xa9\\x02\\x4e\\xe7\\x37\\x57\\x71\\x3a\\xbf\\xb9\\x34\\xbe\\x3f\\xf6\\xfa\\x24\\xef\\xcd\\xa9\\x25\\x24\\xcc\\xb4\\x60\\x6a\\x47\\x47\\x69\\x3b\\x27\\xdf\\x90\\xf7\\xdc\\x54\\xf7\\xc0\\x17\\x0b\\xbd\\x2a\\x16\\x20\\xf4\\xe1\\x8f\\xbc\\x0f\\x7f\\xb8\\xe5\\x6b\\xb6\\x97\\x51\\x48\\x2a\\x9b\\x55\\x2e\\xbc\\xfe\\xf4\\x8c\\xcb\\x9c\\x4d\\xbb\\x8c\\xf7\\xee\\xe7\\x1e\\x69\\x13\\x8a\\xde\\xe6\\x45\\x6f\\x85\\xe6\\xf1\\x3f\\x0e\\xcd\\x45\\xa7\\x0d\\x8b\\x30\\x27\\x41\\x8b\\xf1\\x2d\\xc2\\x68\\x85\\x4d\\x55\\x8f\\xe9\\x1f\\xf9\\x98\\xfe\\xe1\\xb2\\x8b\\x78\\xff\\xe2\\xa8\\x58\\xb9\\x93\\x90\\xa9\\x89\\x84\\x06\\x8c\\x3c\\xe0\\x45\\x6a\\x9a\\xcd\\xf7\\xce\\xb4\\xb8\\x79\\x5c\\x79\\xb1\\x4b\\xec\\xec\\x7e\\x8b\\xd7\\xb1\\x71\\x91\\x8f\\xe8\\x42\\x8c\\xe8\\x5f\\xe5\\x11\\x15\\x03\\x52\\xc3\\x81\\x49\\x2b\\x86\\x13\\xc5\\xe9\\x32\\x02\\x32\\x79\\xbd\\x3c\\x34\\xa4\\x7f\\xe5\\x43\\xfa\\x97\\x58\\x2a\\xbf\\x1f\\x06\\x19\\x2d\\xda\\x47\\xd7\\x2c\\x0e\\x35\\xd4\\x57\\x2c\\x9c\\xbd\\xb1\\xf7\\x78\\x0f\\x7e\\xcf\\x7b\\xf0\\xbb\\xcb\\x5e\\x3f\\x0e\\xd4\\x66\\x5a\\x0d\\xd5\\x70\\x17\\xaa\\x24\\xcd\\x21\\xaa\\xed\\xbc\\x02\\xbe\\x82\\xbf\\x05\\xf0\\xbe\\xa6\\xe8\\x0f\\xca\\x21\\x2a\\x7a\\xb1\\x90\\x57\\x8d\\x05\\xbe\\xdf\\xf5\\x95\\xaa\\xc9\\x5c\\xc7\\x70\\x98\\x35\\xa5\\xea\\x27\\x5e\\x27\\xdb\\xc4\\xac\\x9a\\x6c\\x42\\x69\\x4d\\x91\\x88\\x28\\x52\\xd4\\x59\\x5d\\x87\\x67\\x4c\\x34\\x15\\xd2\\xb2\\x44\\xa0\\x71\\x6a\\xd9\\xa7\\x96\\xa8\\xd8\\x13\\x15\\xeb\\xca\\xa6\\x4d\\xfc\\xb6\\x65\\x50\\x03\\x70\\xb6\\x8c\\x5e\\x04\\x20\\x5f\\x2b\\x46\\x7f\\x85\\xea\\xcf\\xf2\\xb1\\xb5\\xcc\\x76\\x02\\xa1\\x69\\xec\\x4e\\x48\\xf7\\x31\\x61\\xee\\xd6\\x43\\x5e\\xc4\\x00\\xc3\\x2e\\x8e\\xc2\\x8c\\xbf\\x4e\\xc9\\x87\\x07\\xfe\\xc6\\xa6\\x1e\\x64\\x97\\x8c\\xf1\\x5d\\xe4\\xed\\x45\\xa8\\x73\\x6b\\x14\\x9d\\xa5\\xa3\\xb4\\xd1\\x30\\xa5\\xf9\\xfc\\xa4\\x91\\xe9\\x21\\xe2\\x30\\x6c\\x1b\\x0a\\xec\\xfc\\x8a\\xc4\\x54\\x86\\x82\\x15\\x61\\x23\\x8d\\xcf\\x34\\x3d\\x45\\x85\\x32\\x8a\\xeb\\xc4\\x81\\xec\\x08\\x89\\x26\\x3d\\x60\\x78\\x23\\x79\\x47\\xf4\\x32\\x46\\x91\\x63\\x82\\xbf\\x2e\\xd2\\x32\\xe8\\x42\\x9d\\x73\\x1e\\x08\\x85\\x98\\x64\\x92\\xe4\\xea\\x35\\x22\\x39\\x28\\xde\\x81\\xc0\\xc9\\x87\\x50\\x24\\xa3\\xea\\x8d\\x35\\x6a\\x36\\x53\\x73\\x21\\xc5\\x11\\xd0\\x78\\x00\\xad\\x4e\\x01\\xfe\\xb2\\xb3\\xc0\\xdb\\xcf\\x47\\xe9\\xf3\\xbc\\x6e\\x8a\\x56\\xa9\\xe7\\x4f\\x8a\\xfc\\x8a\\xd7\\xda\\x4a\\x87\\xce\\x48\\xda\\xbe\\xcd\\xa9\\x8b\\xfd\\x00\\xa9\\x28\\xc0\\x35\\x52\\xdd\\xd3\\xed\\x63\\x12\\x5b\\x8f\\x93\\x9a\\x37\\xda\\xd8\\xeb\\xee\\x6c\\x1f\\x2b\\x12\\x8b\\x22\\x40\\x1f\\xa4\\x66\\xb1\\x54\\xe4\\x89\\x56\\x55\\xc5\\x06\\x35\\xe9\\x7e\\x72\\xf3\\x38\\x8f\\x3f\\xb9\\x7c\\xa7\\x94\\x26\\xe2\\x04\\x88\\xfe\\xe4\\xee\\x08\\xfb\\xb5\\x68\\x96\\x6c\\x3f\\xd2\\xa7\\x0a\\x55\\xea\\x35\\xc9\\xc7\\xb5\\xa5\\x22\\x7f\\x86\\xc4\\x05\\xc8\\xf8\\x9f\\x2c\\x13\\xc1\\x60\\xea\\xb1\\x92\\x60\\xd4\\xe3\\xe2\\x22\\xb0\\x35\\xa8\\x03\\x61\\x02\\xed\\x56\\x5e\\x15\\x14\\xa4\\x1d\\xa9\\x18\\xeb\\x4d\\x8b\\x58\\xb0\\x16\\x13\\x01\\xe3\\x26\\x19\\x74\\x41\\xac\\xc6\\x1d\\xa8\\x3d\\x3c\\x18\\x18\\x74\\xb5\\x6d\\x0c\\x85\\x53\\x4a\\x87\\x94\\x14\\x4c\\x53\\xa9\\x29\\x0b\\xf6\\x84\\xea\\xc0\\xb0\\xf7\\x14\\xc2\\xa8\\x8e\\x0a\\x2c\\x4d\\xd4\\x6d\\xa9\\x13\\xd1\\xee\\x37\\x84\\xfc\\x85\\xd4\\x5d\\xcc\\x3a\\x30\\x2b\\x94\\xd0\\x99\\x92\\xa6\\x0b\\x24\\xc8\\xc1\\x4c\\xfc\\x7a\\xc8\\xa2\\x7a\\x38\\x15\\x23\\x0a\\xfc\\x75\\x79\\x0b\\xef\\x87\\xaf\\x84\\xa6\\x3f\\xa0\\xe0\\x1f\\xf6\\x24\\x8c\\x30\\xd0\\x47\\xd8\\x84\\x0f\\xc2\\x8e\\x41\\xd8\\x23\\x4c\\x02\\x1c\\x62\\xa3\\xe1\\xa2\\x43\\x93\\x7b\\xb1\\x96\\x95\\xf3\\x0d\\x33\\x47\\x46\\xa4\\x87\\x46\\xd9\\xdd\\x29\\xc9\\x86\\x8c\\x22\\xcc\\x42\\xd3\\x31\\x9b\\xa4\\xab\\x43\\x41\\xa1\\xbd\\xe7\\xf1\\xc8\\xc4\\x90\\x4d\\xde\\x94\\x7d\\x8a\\x8d\\x88\\x25\\xa4\\x44\\xf7\\x09\\x19\\x87\\x84\\x54\\xeb\\x42\\xb1\\x2b\\xde\\x90\\xae\\x09\\xa5\\x11\\x03\\x87\\x69\\x11\\xf0\\x6e\\x79\\x4e\\x8c\\x91\\xbb\\x9f\\xd3\\xe7\\xd1\\xc8\\xc9\\x3f\\x91\\xe4\\x0a\\xa3\\x68\\xe6\\x82\\x56\\xe9\\xa5\\xd3\\x65\\xff\\x76\\xd9\\x2f\\x2e\\x0b\\x03\\x96\\x06\\xcc\\x0b\\x10\\x41\\xc5\\xf8\\x77\\xf4\\xb3\\x26\\x7f\\x47\\xc2\\x15\\x23\\xb8\\x1d\\x5a\\x99\\x22\\xf0\\xe1\\x6c\\x41\\xa1\\x25\\xf2\\xb0\\x12\\x5e\\xb3\\x89\\x8b\\x91\\x82\\x49\\xe0\\x47\\xbc\\x01\\xc2\\x1e\\x39\\x0f\\x0f\\xa8\\xfd\\x40\\xa0\\xf3\\x58\\x47\\x37\\x41\\x44\\x4c\\xf6\\x27\\x62\\x32\\x59\\xc7\\x96\\xfd\\x52\\xba\\x06\\x48\\x76\\x65\\xea\\xba\\x35\\x08\\xb6\\xd1\\x0a\\x00\\x59\\x09\\xb1\\xb9\\x9f\\x7a\\xe3\\x22\\xdd\\xb1\\x8b\\x67\\xa0\\x3c\\xbd\\xb2\\xa0\\xfd\\xc9\\xd5\\x5c\\x69\\xd5\\x38\\x28\\xd8\\xc8\\xf4\\xee\\x89\\x20\\x9f\\x76\\xa5\\x0c\\x91\\x65\\xa8\\x71\\x29\\x0e\\x8f\\xb4\\xf5\\x8e\\xe2\\x60\\xbe\\x85\\x25\\xf4\\x16\\xc0\\xf2\\x16\\xdd\\x30\\xb4\\xde\\x42\\x2a\\x31\\xe9\\x6f\\x51\\x7c\\xda\\x7a\\x9f\\x47\\xd1\\x6e\\xbd\\x1f\\x85\\xad\\x37\\x08\\x4b\\xfc\\x81\\x7f\\x3c\\x95\\xfa\\xcc\\xad\\xf7\\xe8\\x65\\x87\\x87\\xe2\\x55\\x98\\xb9\\x8e\\xa1\\x48\\x96\\x49\\x9b\\x57\\x04\\xe5\\x3b\\x71\\xcd\\x48\\xcd\\x41\\xbd\\xef\\x38\\xd5\\x80\\x27\\x38\\x21\\x4c\\x68\\xb4\\xf5\\x56\\x66\\xa1\\x32\\xe2\\x1b\\xf9\\xa8\\xa2\\x75\\x8e\\xb9\\xa1\\x21\\x59\\xc9\\xaf\\xc8\\x43\\xb5\\x5e\\xa2\\x02\\x5b\\x88\\x8d\\x1f\\x1d\\x79\\xad\\x97\\x23\\x13\\x58\\xab\\xd6\\xaf\\x50\\x8e\\xf3\\xb8\\xf5\\x06\\x79\\xa2\\xb8\\xf5\\x1e\\x15\\xd0\\xb2\\xd6\\x4b\\x40\\xb6\\x90\\x3f\\xc3\\x32\\x1d\\x16\\xab\\xa2\\x31\\x1d\\xd5\\x18\\x37\\xf9\\x3d\\xfa\\xff\\x10\\x1d\\x46\\xbd\\xe7\\x50\\xf8\\xc8\\x6a\\xfd\\x8a\\x9a\\x21\\x7a\\x99\\x58\\xe6\\xc1\\x30\\xee\\x36\\xb5\\xf0\\xe6\\x89\\x2d\\xbc\\x41\\x17\\xbe\\x4f\\x68\\xc1\\xd3\\x5a\\x10\\x39\\xa4\\x93\\x7e\\xca\\x85\\x06\\x4b\\x18\\x6b\\xa2\\xa4\\xed\\xa7\\x4f\\x1e\\xc0\\x16\\xa7\\xef\\x1d\\x25\\xbc\\x13\\xb3\\x2b\\xe6\\x33\\x94\\x93\\x30\\xd2\\x10\\x10\\x56\\x8f\\xb1\\xdb\\x60\\x14\\x11\\xcd\\x31\\x85\\xaa\\xf1\\xc7\\xd1\\x18\\x66\\x2f\\x32\\x6d\\xdf\\x8e\\x58\\x36\\xce\\x00\\xfa\\x9c\\x87\\xf4\\xeb\\xd9\\x19\\xcc\\x83\\x67\\xcb\\x69\\xf2\\x98\\x7f\\x74\\x14\\x11\\x57\\xdb\\x7a\\x49\\x23\\x09\\xe9\\xf7\\x0d\\x4a\\xaa\\x68\\x9e\\xd0\\xae\\x32\\xc2\\xc9\\xa0\\xb9\\x81\\x24\\x6c\\x32\\x44\\x90\\x33\\xac\\x2f\\x84\\xb4\\xf7\\x28\\x1b\\xc2\\xcc\\x18\\x27\\x16\\x7e\\x51\\xc0\\xe5\\x89\\x3c\\x08\\xe5\\x98\\xea\\x0c\\x51\\x8f\\x9f\\xdc\\x86\\x60\\x0e\\x93\\x3d\\x13\\x51\\x57\\x51\\x83\\xbb\\xf5\\x52\\x8f\\x06\\x03\\x19\\x5e\\x52\\xc0\\xd5\\x59\\x44\\x19\\xd4\\x2e\\xba\\x94\\x0e\\x9d\\x64\\x1a\\x34\\x2e\\xf6\\x01\\x3c\\xbd\\xc7\\xd5\\x84\\x82\\x2a\\x31\\x13\\x59\\x79\\x26\\x32\\xa4\\x6a\\x20\\x13\\xae\\xe3\\x37\\x18\\xf3\\xfb\\x4d\\xeb\\x25\\xa2\\x8f\\xf7\\xf8\\xfc\\x1e\\x1a\\xbf\\x2f\\x9e\\xd1\\xfb\\x0b\\x7e\\xc7\\x6a\\xd2\\xf2\\x92\\x49\\xb5\\x6a\\x68\\xa1\\x50\\x3b\\x54\\x0a\\x73\\x6b\\xad\\x85\\xb2\\xc3\\x23\\xea\\xf0\\x36\\xb7\\x89\\xc0\\xe2\\x6f\\x2a\\xbb\\x1a\\x97\\xbb\\xfa\\xe6\\xb1\\xae\\x16\\xe9\\x46\\xde\\x78\\x5a\\x1e\\x71\\xaa\\x55\\xa3\\x77\\x55\\x0e\\x2c\\x3e\\xd8\\xd5\\x7c\\x53\\xe2\\x14\\x66\\xad\\x5f\\xb7\\xb7\\x4b\\x3f\\xf0\\x8c\\x67\\x38\\x45\\x23\\x31\\x79\\x34\\x37\\xdb\\x6d\\x41\\xbc\\xdc\\x44\\x71\\x14\\x46\\xfe\\x23\\xa4\\x6e\\x61\\x32\\x2e\\xbc\\x35\\xa9\\x93\\x8e\\x94\\xe4\\x72\\x09\\xaa\\x52\\x44\\xf5\\xb9\\xd2\\x43\\x8d\\xb8\\x54\\x43\\x55\\xd8\\xdd\\xcf\\x0c\\xba\\x0b\\x77\\x50\\x25\\x31\\x08\\x92\\x7d\\xa3\\x67\\x0f\\xbe\\xdd\\x0b\\xf3\\x16\\x4f\\x9e\\x26\\x01\\x3c\\x21\\x06\\xc6\\x43\\x78\\xe2\\x4c\\xf3\\xa8\\x56\\x63\\x77\\x4f\\x26\\x2e\\x3b\\xda\\x4a\\xc4\\x95\\xaa\\xa2\\x09\\x80\\x20\\x44\\x0a\\x6f\\xba\\x35\\xed\\xa0\\x75\\x77\\x86\\xae\\xbf\\xe0\\xf7\\x39\\x3a\\xb8\\x0a\\x5a\\x9b\\x33\\x9e\\xd1\\xef\\x73\\xd8\\x26\\x28\\x0c\\x8d\\xa6\\x6c\\xe2\\xcb\\xbf\\x19\\xfc\\x85\\x6d\\x8a\\x0a\\xde\\xd3\\x51\\xa2\\xd4\\xfb\\xa1\\x17\\xe8\\x1e\\x50\\xb7\\x1d\\xd9\\x75\\xe3\\x54\\xc5\\x8e\\xdd\\xdf\\xe9\\xfe\\x80\\x44\\x58\\xa7\\xf6\\x4b\\xc7\\xc4\\xa0\\x96\\x1b\\xfd\\x53\\x54\\xfa\\xe4\\xdb\\x29\\x4a\\xf1\\x85\\x3d\\xc9\\x0b\\x44\\x1a\\x6f\\x63\\x0c\\x45\\x0f\\xe0\\xcd\\x80\\x78\\xc9\\x82\\x91\\xc6\\x60\\x09\\x74\\x1e\\xf8\\xe1\\x75\\xa5\\x8e\\x85\\x9c\\x00\\x53\\x80\\xf6\\x91\\xdb\\x0d\\x98\\x62\\xdc\\xd8\\xf1\\x76\\x3f\\x94\\xa7\\xba\\xe3\\x27\\x99\\x9b\\x8d\\xd0\\x0d\\x5a\\x3e\\x1a\\x1b\\xa0\\xb4\\x8c\\xde\\x81\\x29\\x9d\\xd2\\xc5\\x03\\x86\\x04\\xf4\\xe9\\xa2\\x2d\\xa9\\xd0\\xbd\\x9c\\xec\\xae\\x8b\\x47\\x56\\x45\\x5c\\x10\\x1b\\x42\\xeb\\x5a\\xae\\x09\\x47\\x2d\\x93\\x82\\x6e\\x90\\x74\\x9c\\x53\\x78\\x3b\\x73\\x88\\x70\\x13\\xf4\\x07\\x30\\x39\\x74\\xb0\\x47\\xe3\\xa4\\x15\\xdb\\xf0\\xac\\xe8\\xb9\\x8c\\x27\\x00\\xd5\\x39\\x65\\x77\\x0f\\x65\\x66\\xf1\\x73\\xbf\\x85\\x7e\\xd1\\x9e\\xcf\\xf1\\xc7\\x01\\x24\\x0d\\xbd\\x99\\x9b\\xcf\\x2d\\xdc\\xd4\\x82\\xdb\\x42\\x2d\\x06\\xe0\\xd0\\x7c\\x04\\x4a\\x38\\x81\\x7c\\xc8\\xd5\\x92\\x93\\x84\\x27\\x33\\x26\\x82\\x6d\\xe4\\x68\\xae\\x2d\\x78\\x8d\\xa7\\xb2\\x27\\x11\\x16\\xcc\\x64\\x41\\x8c\\xf3\\x5a\\xa9\\xc5\\xfe\\x58\\x0d\\x8e\\xd4\\x62\\x81\\xd3\\x26\\xb0\\x89\\xd7\\x71\\x10\\x59\\x07\\x42\\x8c\\xe9\\x60\\x95\\xe5\\x38\\x26\\x8f\\x54\\xa6\\xb7\\x8e\\x07\\x85\\xd4\\x28\\x0f\\xa7\\x3b\\x95\\x02\\x20\\x31\\x4a\\x65\\x6e\\x6a\\x9b\\x01\\xf1\\x39\\x69\\x76\\xbc\\x21\\xc3\\x3f\\x28\\xf3\\x86\\x47\\x7c\\x9a\\x8e\\x14\\xd2\\x9a\\x79\\x81\\x93\\x85\\x4e\\x25\\x58\\x76\\x10\\x1b\\x86\\xa7\\x55\\xab\\x90\\xd4\\x81\\xd5\\xf7\\x4f\\x99\\x33\\x4b\\x63\\xcf\\xdb\\x71\\x58\\x86\\xe7\\xb2\\x86\\x01\\xfd\\x12\\x3e\\xf4\\x8d\\x92\\xf2\\x3f\\x62\\x2b\\x54\\xcc\\xf4\\x93\\xb7\\xce\\x5b\\x60\\xf8\\x8f\\x8e\\xe4\\x23\\x50\\x0f\\x52\\x40\\xe0\\xcc\\x15\\x42\\x0b\\x01\\x0d\\x25\\xf0\\x97\\x22\\xc7\\xe2\\xc8\\x9f\\x71\\x17\\x73\\xa1\\xa9\\x5e\\xd3\\x33\\x1b\\xf0\\x9b\\x34\\x63\\xf3\\x79\\xcb\\xea\\x98\\xc1\\x5e\\x3b\\xe4\\x1a\\x90\\x6a\\x9a\\x73\\xa9\\x1c\\x34\\xc2\\x98\\x2e\\x18\\x89\\x25\\x54\\x98\\x09\\xc9\\x33\\x2c\\x3a\\x67\\x2e\\xf2\\x00\\xb2\\x28\\xdb\\xaf\\x4d\\xd1\\x8e\\x77\\x78\\xd0\\x43\\x0d\\xb1\\x52\\x38\\x52\\x64\\x65\\x45\\x91\\x1c\\x08\\xfa\\x37\\xba\\xe5\\x14\\x23\\x0c\\x38\\xb0\\x92\\x46\\xd6\\x20\\x91\\x02\\x3e\\x46\\x0d\\x92\\x2a\\x78\\x67\\x3c\\x60\\x4b\\x1e\\x9f\\xc1\\x0e\\x5b\\xf0\\xe5\\xf3\\xe7\\x9d\\x87\\xf9\\x48\\x80\\x06\\x4f\\x33\\xa4\\x68\\x31\\xb0\\x7a\\x32\\x59\\x4c\\x91\\x55\\xcc\\x5f\\x78\\x92\\xa1\\x77\\x91\\xf9\\x38\\xe3\\xb0\\x48\\xb0\\x8e\\x71\\xc4\\x13\\xdb\\xc5\\x8d\\xba\\xd7\\x83\\x43\\x06\\x63\\xb8\\x21\\xa0\\x43\\x77\\xf8\\xeb\\x9a\\x05\\xe4\\x53\\xf3\\x06\\x68\\x5c\\x8c\\x68\\x8a\\x96\\x80\\x1b\\x9e\\xe5\\xae\\x17\\x57\\x7c\\xc3\\x9b\\xc6\\x0d\\x9f\\x09\\x1d\\xb4\\x39\\xb2\\x43\\xe8\\x13\\x91\\xad\\x0b\\x21\\x4e\\x44\\x91\\xc9\\x17\\xc0\\x6f\\xaf\\xcf\\x16\\x80\\x41\\x16\\x26\\x4c\\x2c\\x74\\x99\\x25\\x70\\xae\\xdc\\xc0\\x39\\x7b\\x03\\x98\\xe3\\x0e\\xe0\\x00\\xc7\\x0a\\x05\\x97\\x84\\xd7\\x0d\\xbe\\xde\\x9d\\xad\\x30\\xee\\x76\\xfe\\x95\\xac\\xbc\\x36\\xe2\\xeb\\x5c\\x20\\x10\\xfa\\xb4\\x54\\xcf\\x1b\\xe9\\x13\\x72\\xb7\\x3d\\x82\\xf8\\x15\\x6f\\x9c\\x1b\\xb2\\xe5\\x85\\xc9\\x2e\\x79\\xe3\\xce\\x00\\x18\\x9b\\xa3\\x9b\\xb3\\x2b\\xea\\xc4\\x95\\xc9\\x66\\x67\\x97\\xd4\\x01\\x60\\x03\\xae\\x64\\xe3\\x90\\x7a\\x29\\x1b\\xbe\\xcc\\x9b\\xbd\\xca\\x1b\\xbd\\x14\\xc0\\xbc\\xe5\\xab\\xe6\\x0d\\xbb\\xe0\\x9b\\xe6\\x6c\\x74\\x7b\\x76\\x31\\xde\\xf0\\x59\\xe3\\xd6\\x5e\\xf1\\x9b\\xc6\\x85\\x08\\x68\\x4f\\xf3\\x83\\x10\\xbd\\x46\\x97\\x8a\\xa5\\x9d\\xe8\\x1b\\xd7\\x2c\\x64\\xd0\\x39\\xf8\\x03\\x9d\\x65\\xd0\\xaf\\x10\\x7b\\x28\\xa7\\x05\\x36\\xe1\\x75\\xeb\\xc6\\x07\\x0c\\xbe\\x43\\x75\\x60\\x24\\xfa\\x52\\xa6\\xb9\\x1f\\x56\\xaa\\x2e\\x2e\\x33\\x6c\\x21\\x17\\xef\\x15\\x45\\x16\\x88\\xfd\\x65\\x44\\x27\\x71\\x66\\x20\\xb8\\x9e\\xaf\\x47\\x26\\xf5\\x09\\x21\\x35\\xc7\\x3f\\x4b\\xfc\\xa3\\x8a\\x8d\\x9a\\xcd\\x85\\xda\\x11\\xea\\xf0\\xa1\\x41\\x15\\x71\\xbc\\xf8\\x92\\x87\\x3c\\x11\\x3b\\xec\\x7a\\x2b\\x0c\\xd1\\x1c\\x3c\\x8e\\xdd\\x42\\x20\\x85\\x36\\x66\\xbb\\x1a\\xda\\x88\\x51\\xdd\\x0c\\x72\\x05\\x19\\x43\\x3f\\xa0\\x11\\xb9\\x1d\\xa5\\xa0\\xef\\xc8\\x27\\xa3\\xf7\\x43\\x9f\\x7c\\xf3\\x1a\\xfe\\x53\\x4f\\x07\\x40\\xd1\\xcc\\x27\\xdd\\x3d\\xff\\xa9\\xe7\\x82\\x2b\\x8a\\xb8\\x58\\x64\\xf7\\x16\\xfe\\xb1\\x72\\xea\\x2c\\x48\\xb9\\xc7\\x63\\x2e\\x8c\\x87\\x6c\\x94\\xe0\\x85\\xc5\\xa5\\x74\\x28\\xe9\\xbe\\x18\\x1f\\x3b\\xea\\x3a\\x3d\\x54\\x06\\x48\\xd0\\xac\\x0a\\xb0\\x45\\xa5\\x27\\x13\\x18\\xb8\\x22\\xab\\xb0\\x3f\\x4f\\x3e\\x4e\\x0e\\xf6\\x46\\x84\\xb2\\x6c\\x84\\x5a\\xd3\\x15\\xed\\xc6\\xcd\\x94\\x65\\x4d\\x0f\\xdb\\x14\\x87\\x80\\x76\\x9b\\xf6\\x7e\\x71\\xc5\\x17\\xd9\\x4e\\xe2\\xcf\\x57\\xa8\\x41\\xc7\\xd7\\xbb\\xe9\\x6f\\xc9\\x6d\\x06\\xbf\\xd9\\x4d\\x97\\x01\\x53\\x66\\x99\\x70\\x66\\x18\\xf0\\xf6\\xa4\\xd9\\x98\\x8e\\x8d\\xb1\\xfd\\x71\\xd6\\xf8\\xd8\\x1a\\x7f\\x9c\\xd5\\x1f\\xe8\\xa7\\x61\\x42\\xda\\xc4\\x7b\\x3d\\xa5\\xef\\xe4\\xba\\xb0\\xbd\\x60\\x51\\xa0\\xfb\\x2f\\xf6\\x03\\x79\\xab\\xc9\\x6a\\x8b\\x9a\\xb9\\x13\\xa4\\x9c\\xaf\\x76\\xda\\x8e\\xe2\\x84\\x4f\\x2a\\x44\\x0e\\xf9\\x2d\\xa4\\x5a\\xa1\\x35\\xe1\\x5a\\xb8\\x86\\x2c\\xf1\\xf8\\x7b\\x27\\x77\\x8e\\xda\\xfe\\x8f\\xf1\\x3f\\x0f\\xf1\\xe2\\xea\\xa3\\xf1\\xb0\\x4c\\x82\\x8f\\x86\\xd9\\x16\\xae\\x97\\x53\\x73\\xbc\\xc8\\xec\\x59\\x66\\xa3\\x3b\\x55\\x71\\x4f\\x0b\\xd5\\x45\\x29\\xa6\\xee\\xb8\\x70\\x35\\xc7\\x9b\\xcc\\xae\\x45\\x04\\x34\\xaa\\xff\\xe8\\x48\\x9c\\x85\\xf0\\x65\\x9d\\xd9\\x37\\x99\\x29\\x74\\x33\\xa7\\x3b\\x60\\xa3\\xe2\\x7c\\x23\\xa0\\x56\\x79\\xcb\\xb5\\xd9\\x32\\x37\\xc8\\xdd\\x39\\xe2\\xbd\\xa2\\x13\\xdb\\x4e\\x40\\x17\\x89\\xf6\\x75\\xc6\\xf0\\x20\\xaf\\x90\\xe4\\x5c\\x02\\x01\\xe4\\x66\\x57\\xbe\\x5b\\xf1\\xed\\x16\\xbe\\xa1\\x53\\xfd\\xfd\\x2f\\xaf\\xc9\\x24\\x6f\\x5d\\xf1\\xe5\\x05\\xd6\\x47\\x9a\\x80\\x15\\x1f\\xdf\\x62\\xb1\\xc0\\x49\\x52\\x68\\xee\\x65\\xc6\\xae\\x30\\xf2\\xcc\\x67\\xf8\\x05\\x82\\xde\\xad\\xca\\xff\\x29\\x43\\x75\\xbc\\xa0\\x18\\x56\\xcd\\x0f\\x6b\\xf6\\x86\\x45\\x59\\x6a\\xdf\\x65\\x0c\\xde\\x9a\\xf0\\x58\\xb3\\xaf\\xe0\\x19\\x1e\\x9a\\xf8\\xb5\\x62\\x93\\x5c\\x65\\xc6\\x1d\\xf9\\xf6\\xde\\x0a\\xe7\\x2e\\x9e\\x93\\x78\\x15\\xa4\\x36\\xaa\\x41\\xce\\xbc\\xbb\\x9f\\xe7\\x46\\xad\\x59\\x43\\xb1\\x06\\xca\\xe9\\xc7\\x4a\\x76\\x89\\xee\\x4a\\x81\\xd6\\x8b\\xcb\\xa9\\x69\\xa3\\x63\\xda\\xd8\\xab\\xc2\\x60\\xc4\\x0d\\xd0\\x8b\\x12\\xd0\\x39\\x0f\\x0f\\x00\\xfe\\x98\\x07\\xe2\\x3d\\x86\\x77\\x38\\x6a\\x33\\x23\\x36\\x94\\xb7\\x35\\x61\\x2c\\xe7\\x88\\x3b\\x8b\\x7c\\x27\\xb3\\x0e\\x39\\x7a\\xdc\\x59\\x00\\x3f\\xc0\\xe4\\xbe\\xd9\\xdd\\x4c\\x3f\\x24\\x01\\xff\\xb0\\x9b\\xf8\\xc6\\xb9\\xe2\\xef\\x77\\x13\\xdf\\x93\\x8f\\xd6\\x57\\x94\\x5c\\xad\\x95\\x2c\\x60\\x90\\x41\\x6f\\x50\\x4d\\xc2\\x7b\\x1d\\x78\\xd8\\x9b\\xb7\\x17\\x78\\xfb\\x15\\x26\\x28\\xd8\\x9c\\xfb\\x77\\xad\\xe4\\x66\\x21\\xf6\\x9a\\x32\\x7a\\x3f\\x54\\x5d\\x4e\\x43\\x84\\x64\\xc2\\xe5\\xa5\\x2f\\x52\\xd8\\x54\\x57\\x59\\xea\\x19\\xb5\\xbc\\x44\\x8d\\x85\\xa6\\xf4\\xdb\\x95\\x16\\xf5\\xb4\\xae\\x60\\x7e\\x7e\\x73\\x02\\xbc\\xa0\\x4d\\xa2\\xc0\\x9f\\x09\\x27\\x95\\x8a\\xe9\\x82\\xed\\xff\\x0e\\x58\\xa1\\xb1\\x07\\x4b\\x02\\xaa\\xbc\\xb3\\x93\\x00\\x58\\x07\\x22\\x5a\\xdf\\x65\\x4f\\x0a\\x76\\x57\\x2b\\xcc\\x60\\x6a\\x0d\\xe1\\x43\\x47\\x25\\x34\\x6a\\xa6\\xb4\\x0b\\x94\\x5f\\xc4\\x1b\\x24\\x27\\xd7\\xde\\xed\\x1f\\x2a\\x15\\x5f\\x30\\x8d\\x0c\\x5b\\x54\\x1a\\xbe\\x40\\x62\\x4d\\xd0\\xe7\\x30\\x35\\xf7\\x8e\\xdd\\x61\\x57\\xb6\\xc5\\x5c\\xf8\\x37\\x83\\x67\\x0f\\x7e\\xe7\\xb6\\xb5\\xdd\\xc1\\x54\\x1f\\x72\\x08\\xfe\\x90\\x89\\xc8\\x69\\x1b\\x58\\xcd\\xf2\\x9a\\x4d\\xbc\\xb4\\xae\\x60\\xfe\\x82\\x2a\\x05\\x91\\x4a\\xc9\\x3d\\x52\\x62\\x28\\x3f\\xc7\\xe0\\xce\\x85\\xbf\\x13\\x12\\xa5\\x4b\\x0e\\xec\\x4f\\xd8\\x10\\x13\\x6f\\x6a\\x16\\x42\\xe5\\xad\\xde\\x9c\\xbb\\x8c\\xe2\\xd9\\xe3\\xba\\xbc\\x2c\\xc8\\x75\\xf6\\xa0\\xa7\\x37\\xd8\\xe4\\x8c\\xe7\\x9a\\x82\\xbe\\x09\\x34\\xa3\\xbc\\xfc\\xf2\\x48\\x58\\x8e\\x7f\\x42\\x0a\\x79\\x4e\\x72\\xfd\\xe5\\x73\\x5f\\xde\\x0f\\x04\\x90\\xb8\\x10\\x89\\x0b\\x4c\\x0c\\x1a\\x3c\\x9b\\x2c\\xa7\\x40\\x7b\\x8c\\x6e\\x44\\x67\\x03\\xa8\\x4c\\xc6\\x07\\x2f\\xea\\x37\\x59\\xd8\\xe0\\x01\\x79\\xf3\\x06\\x7a\\x61\\x26\\x78\\xdb\\x4a\\x85\\x8f\\xc8\\xb8\\x99\\x84\\x40\\xc8\\x4c\\x52\\x62\\x32\\x81\\x95\\x5a\\x1d\\xf0\\x24\\x17\\xee\\xd5\\xa2\\x69\\xc9\\x18\\x19\\xde\\x0c\\x86\\x68\\x85\\x0f\\xbf\\x1e\\xd6\\x85\\xa1\\xcf\\xb9\\xf1\\xc6\\x69\\x26\\x75\\xdf\\x6c\\x03\\x48\\xaa\\xc6\\x37\\x07\\xaa\\x5c\\x1f\\x9f\\x74\\x09\\x32\\x83\\x31\\x02\\xe9\\xbd\\x9a\\x6c\\x70\\xa8\\x40\\x7c\\x67\\xf8\\x74\\x3e\\x65\\x57\\x90\\xff\\x92\\x03\\x14\\xee\\xea\\xe1\\x68\\x3d\\xd9\\x34\\x00\\x1d\\x35\\xce\\xa7\\x28\\x35\\x07\\xf4\\x04\\xe8\\x2f\\xc9\\xae\\xc4\\xe3\\x39\\x23\\x21\\xce\\x0b\\x64\\xdb\\xec\\x2b\\x94\\xd5\\x8b\\xc7\\x4b\\xe1\\x0f\\xca\\xbe\\xdb\\x6e\\x63\\xa8\\x54\\x2b\\x59\\x64\\x9f\\x17\\xd9\\x03\\x99\\xdd\\x08\\x9a\\x73\\x13\\x95\\x18\\xa0\\xed\\x84\\x00\\xab\\x8f\\x45\\x10\\xd7\\xcb\\x9d\\x71\\xdc\\xf2\\xf5\\x64\\x49\\x3d\\x84\\x31\\x5c\\xc0\\xcb\\x82\\x5e\\x96\\xd3\\x91\\x71\\x2b\\x7c\\x8e\\x3e\\x3c\\x5c\\x88\\x07\\x13\\x25\\xe0\\x34\\x8b\\xf2\\xcb\\x73\\xf9\\x61\\xac\\xe4\\x24\\x17\\x4a\\x40\\x72\\xbb\\xb5\\x55\\xda\\xad\\x4a\\xbb\\x00\\x70\\xbb\\x47\\x47\\x7b\\x36\\x42\\xde\\x23\\x33\\xef\\x1a\\x86\\x52\\x7c\\x12\\x4d\\x35\\x94\\xc6\\x92\\xec\\x12\\xc5\\x15\\x2f\\xe7\\x48\\x77\\x73\\x98\\xdb\\x4a\\x9d\\x55\\x5c\\xf5\\x49\\xe1\\x32\\x3a\\x90\\xe8\\xe8\\xa9\\xc2\\x0b\\x92\\x40\\xa0\\x50\\x5e\\x72\\x4b\\x48\\xad\\x09\\xd6\\x94\\x84\\x12\\x41\\x6b\\x0d\\xa4\\x75\\x09\\x7d\\x3d\\x56\\x1f\\xfa\\xdb\\xd1\\x6b\\x48\\xb0\\x06\\x84\\xcb\\xf7\\xe8\\x8b\\xae\\x52\\xcc\\x55\\x25\\x18\\x29\\x57\\x12\\xa9\\x4a\\x2e\\xb2\\xab\\xc5\\x57\\xd4\\xe3\\x50\\x3d\\xaa\\x16\\x47\\xd5\\xf2\\x12\\x71\\xca\\x13\\xab\\x40\\x5a\\xdc\\xa3\\xc9\\xc6\\x2a\\x5c\\xac\\xc2\\xdd\\x29\\x9e\\x97\\x86\\x15\\x86\\xc1\\xfd\\x3d\\xcc\\xb4\\xdb\\xcd\\x3c\\x53\\x2c\\x32\\xc5\\x90\\x49\\xc7\\x73\\xb0\\xa8\\xdd\\x43\\xaa\\xde\\x55\\xb1\\x3c\\x94\\xe4\\x83\\xee\\xa6\\x48\\x16\\x80\\x51\\x19\\x94\\x49\\x3c\\xe0\\xcd\\xbb\\x26\\x4a\\x30\\x22\\x7c\\xdc\\xc0\\xe3\\x06\\x85\\x8f\\x4d\\x0f\\x58\\x1b\\xbf\\xee\\x37\\xa2\\x3a\\x85\\x8a\\x70\\xcf\\x9c\\xba\\xd3\\x9e\\x51\\x2d\\xeb\\xb3\\x5c\\x30\\x40\\xa1\\xda\\x61\\xe5\\xb5\\x5d\\x60\\xfc\\xd7\\x77\\x4d\\x28\\x12\\xa0\\xc4\\x61\\xd3\\xe4\\x51\\x3d\\x90\\xe7\\xdf\\x33\\x6b\\x5b\\xb4\\x7d\\x74\\x04\\x1b\\xa2\\x54\\x03\\x25\\xbf\\x7c\\xac\\x1a\\x55\\x8f\\x6a\\xad\\xa4\\xa1\\x4e\\xf7\\x34\\xeb\\xbb\\x22\\x1e\\xfe\\x1d\\x95\\x2c\\xde\\x61\\x3c\\x64\\xaa\\x47\\xbe\\x89\\x77\\xad\\xf1\\xd0\\x2d\\x1e\\x39\\xd9\\xf7\\x93\\xb5\\x93\\xe6\\xd1\\xab\\xd1\\xad\\xa7\\xef\\xa2\\x9f\\x76\\x0a\\x19\\x0e\\x3b\\x67\\xd2\\x61\\xc0\\x0b\\x25\\xbc\\x75\\xca\\xe6\\x7c\\x8e\\x72\\x8f\\x25\\xa1\\x48\\x0c\\x8f\\xc4\\x17\\x80\\x8e\\x78\\xab\\x03\\x87\\x49\\x6b\\xd8\\xa7\\x43\\x84\\x1c\\xb5\\xe4\\xfa\\x0c\\x2d\\xac\\x4c\\x9f\\x32\\x80\\x87\\x11\\xd7\\xa1\\xb2\\x53\\x14\\x0b\\x59\\x03\\x75\\xcf\\xe2\\xb6\\xa0\\x3d\\x43\\xaa\\x73\\x62\\xd3\\xcc\\x09\\xd6\\x4b\\xc7\\x8e\\xb9\\x05\\x78\\xfb\\x99\\x95\\xdf\\x31\\x39\\x74\\x90\\xad\\x81\\xcf\\xdd\\x90\\xeb\\x9c\\x95\\xda\\x93\\x97\\x85\\x13\\x18\\x71\\x8e\\x59\\xa3\\xcb\\x33\\x0f\\x4f\\x52\\xd3\\xe1\\xe7\\x78\\x23\\x3d\\x47\\x03\\x78\\xc1\\x82\\x2c\\xd1\\xbe\\x96\\x30\\x07\\xdb\\xf0\\x65\\xeb\\xae\\x39\\x07\\xe8\\xdd\\xc1\\xd3\\x06\\x9e\\x36\\xcc\\x58\\xf3\\x4d\\x7d\\xd3\\xb8\\xab\\xdf\\x99\\xe4\\x54\\x25\\xae\\xfb\\x50\\x41\\xdd\\x80\\xc7\\x42\\x89\\x6f\\x6d\\x9a\\xcd\\x0c\\x8f\\x96\\xf6\\x9a\\x6d\\xea\\x7c\\xcd\\xee\\xf0\\x0f\\x56\\x06\\x85\\x0d\\x38\\x90\\x5b\\xb7\\x1e\\x86\\xc8\\x6a\\x1b\\x4b\\xf9\\xd4\\x50\\x49\\x26\\x8a\\x26\\x60\\x8e\\xef\\xea\\x33\\x06\\x2d\\x37\\x44\\x81\\x4e\\x73\\x86\\xc2\\x8b\\x0d\\x1e\\x26\\x33\\x92\\x43\\x40\\x62\\x5c\\xbf\\x31\\x49\\xb0\\x81\\x3a\\x2c\\x80\\x01\\xef\\xe0\\xa1\\x83\\x0f\\x44\\x32\\xcc\\x4c\\x53\\x4a\\x04\\xbc\\xe7\\x57\\x23\\x18\\xe8\\x0a\\x07\\xea\\x60\\x95\\xc6\\xa6\\x09\\xbf\\x68\\xa7\\xe0\\x60\\x95\\xc6\\x1d\\xbc\\x6e\\xe0\\x15\\xeb\\x5d\\x50\\xa9\\x9f\\x32\\x60\\x35\\x77\\x65\\x87\\xc6\\x0a\\x36\\x1e\\xfa\\x7e\\xc8\\xaf\\xf4\\xa1\\x5e\\x43\\x54\\x8c\\xd6\\x03\\x77\\xde\\x0c\\xef\\x7f\\x48\\xd6\\x61\\xa0\\x6f\\x0f\\x53\\x82\\xbb\\xc8\\x9d\\xf7\\x82\\x72\\x03\\x8a\\x69\\xdd\\x01\\xb8\\xd7\\x77\\xd8\\x11\\x7c\\xd8\\x98\\x36\\xa6\\x35\\xb9\\x81\\xa9\\x4d\\xfa\\xcb\\xb1\\xaf\\x66\\x3d\\xc1\\x3c\\xe2\\xc3\\x86\\x3e\\x60\\x81\\x0d\\x7e\\x30\\x47\\x2e\\x2d\\x26\\xb5\\x46\\xc4\\x2a\\x95\\x8b\\x04\\x45\\xf3\\x8e\\x10\\xb3\\x3d\\x0d\\x65\\xad\\x00\\x65\\x39\\x14\\xc5\\xda\\x39\\x7c\\xb7\\xb0\\x5f\\xec\\x5c\\x14\\x3b\\xc7\\x62\\x4f\\xe7\\xf2\\x03\\x51\\x2a\\x50\\x8d\\xbd\\xda\\x37\\xcb\\x79\\xa4\\xf4\\xbc\\x4a\\x09\\x37\\x1c\\x87\\x76\\x83\\x6a\\x9d\\x63\\xad\\xb9\\x4e\\x72\\xb9\\x01\\xd9\\x1e\\x90\\xd6\\x07\\x35\\x63\\xf7\\xdb\\x5b\\x3e\\xde\\xde\\x12\\xdb\\x9b\\xc7\\x3e\\x65\\x78\\xea\\x79\\x27\\x8a\\x26\\x58\\x54\\x20\\xb2\\xa7\\x15\\x5c\\x3c\\xde\\x95\\x45\\x51\\xdf\\xd7\\x81\\x74\\xcd\\xc3\\xba\\x98\\x48\\x6d\\x33\\x63\\x65\\x8b\\xd8\\xb9\\xf1\\xd3\\x27\\x8a\\xa0\\x6e\\xe4\\xb0\\x6e\\xb0\\x64\\xba\\xf4\\xd2\\x4a\\x83\\xe6\\x2a\\x4b\\x80\\xbd\\xd6\\x67\\xd4\\x3a\\x2d\\xe6\\x27\\x0a\\x8e\\xb0\\xed\\x78\\x0c\\xc7\\xff\\x99\\x85\\x3a\\xd5\\x36\\xfc\\x02\\x96\\x70\\xe5\\x45\\xa1\\xdc\\x23\\x12\\xa3\\x2b\\x4c\\x1a\\x8a\\x10\\x60\\x14\\x27\\xc4\\x10\\xa8\\xd9\\xc4\\xab\\x4b\\xbc\\x90\\x71\\x44\\xc9\\x83\\x0e\\x03\\xc5\\xdd\\xf8\\x33\\x4f\\x50\\xc9\\x9e\\x76\\x77\\xea\\xa2\\x5d\\x98\\x35\\x82\\x73\\x72\\x84\\x01\\x7f\\x3c\\xbc\\xd1\\x94\\xbc\\x04\\xa6\\x27\\x32\\x5d\\x7a\\x06\\x3c\\x87\\xcf\\x23\\x6f\\x92\\x29\\x32\\x8e\\x88\\xdd\\xa9\\xf4\\x8a\\x25\\x51\\x32\\xe0\\x9e\\x89\\x7a\\xde\\xc9\\x20\\x4a\\xa1\\xa5\\x96\\xe4\\x9e\\xe8\\xe6\\x0c\\x35\\xc2\\x1c\\x71\\x49\\x16\\x15\\x1c\\x94\\x23\\xa3\\x34\\xc9\\x0b\\x0c\\x9f\\x47\\xd0\\x36\\x46\\xb4\\xc9\\x9d\\x4c\\x94\\x4c\\xd1\\x80\\x55\\x99\\x45\\x2b\\xc3\\xac\\xc7\\x9a\\xd3\\x1b\\xb7\\x38\\x5f\\x92\\xfc\\x7c\\x81\\x73\\x2f\\x10\\xf6\\x17\\x88\\x8a\\x73\\xad\\x47\\xf7\\x2c\\x25\\xc5\\x3f\\x23\\x06\\xfc\\x07\\xdc\\x8b\\xe8\\x3a\\x4f\\x59\\x2c\\xb1\\x3e\\xe4\\x51\\x79\\x13\\x99\\x37\\x06\\x80\\x40\\xe7\\x6b\\xc2\\x71\\xad\\x66\\x67\\x29\\x47\\x8a\\x2a\\x1e\\xca\\x18\\x60\\x35\\x51\\x8f\\x53\\xb3\\xaa\\x84\\x00\\x18\\x95\\x90\\x8a\\xfe\\x58\\x42\\x3c\\x42\\x89\\x46\\x43\\x15\\x97\\xdd\\xa1\\x14\\x09\\x65\\x91\\xb2\\x37\\x14\\x31\\x12\\x26\\x6f\\x80\\x5a\\x74\\x1a\\xc6\\x78\\x45\\x63\\xd4\\xee\\x6a\\x6c\\x8d\\x1a\\x59\\xf2\\xd3\\x46\\x7c\\xda\\xe0\\xa7\\x4d\\x8d\\xdd\\x68\\x9f\\xd6\\xb2\\x18\\x20\\x79\\xac\\xa2\\x48\\x97\\x65\\x00\\xc7\\x63\\x79\\x8a\\xcb\\x85\\x04\\x44\\xc5\\x9e\\x9f\\x9b\\xbb\\x80\\x43\\xb6\\x8e\\xc3\\x79\\x5a\\xa8\\x90\\x9e\\x0b\\x15\\xd2\\xe2\\x72\\x61\\x2f\\xfb\\x1c\\x9b\\xf0\\x0f\\x34\\xb1\\xdc\\x6b\\xc2\\xa7\\x26\\x96\\x4f\\x6d\\x82\\xb2\\x93\\x03\\xba\\xe8\\x40\\x13\\x0b\\x73\\x17\\xbe\\x11\\x35\\xb1\\xd0\\x9a\\x58\\x55\\x35\\x51\\xca\\xbe\\x28\\x88\\xab\\x9c\\xb8\\xcb\\x09\\xbd\\x2a\\x13\\x0c\\x81\\x57\\x8c\\x56\\xc7\\x14\\xdb\\x3c\\x5a\\x3f\\x92\\xcb\\xa2\\x4c\\xb3\\xd8\\xa9\\x10\\xc5\\x20\\xf1\\x0e\\x5b\\x1f\\x50\\xc8\\x95\\xb7\\x04\\x44\\x19\\xc5\\x94\\xd1\\x30\\xa5\\x19\\xad\\xb1\\x81\\x27\\x0c\\x0d\\x07\\x89\\x84\\x4d\\x04\\xc5\\x5e\\x63\\x7f\\x64\\xc5\\x07\\x95\\x96\\x16\\x49\\x40\\xee\\xa9\\xd4\\x7f\\xa0\\x96\\xdf\\x1e\\xba\\x43\\x25\\x1c\\xa1\\x07\\x86\\x45\\x56\\x51\\x96\\x78\\xd1\\x0d\\xc6\\x3a\\x12\\x85\\xfe\\x25\\xab\\x17\\x1f\\xb2\\xbc\\xd9\\xdf\\x21\\x9d\\x20\\xeb\\x09\\x95\\x58\\x04\\x12\\x32\\xe3\\x06\\xb2\\x84\\xb5\\x08\\xc3\\x51\\x11\\x59\\x39\\x0f\\x78\\xd7\\x62\\xcb\\x80\\x77\\xd8\\x22\\xc0\\x3b\\xb2\\x51\\xc1\\x73\\x2c\\x7d\\x2f\\x46\\x97\\xd8\\x9b\\x03\\x98\\x31\\x93\\xec\\x04\\xa0\\xa1\\x49\\x36\\x25\\x5d\\x68\\xda\\x45\\x59\\x6b\\xe6\\xad\\x51\\x75\\x72\\x24\\x24\\x6b\\x88\\x7e\\x80\\xe0\\x5f\\x63\\x20\\x28\\x44\\x4a\\x52\\x35\\xda\\x37\\x99\\x81\\xea\\x20\\xd4\\xcd\\x90\\xa1\\x8a\\x13\\x95\\x33\\x71\\x6b\\xb8\\xb9\\x1e\\xb2\\x16\\x81\\x8e\\x0c\\x30\\x47\\xcd\\xa6\\x8b\\x7a\\xc9\\x66\\x24\\x6f\\xd5\\x00\\x13\\xb9\\xa8\\x0b\\x89\\x6e\\xb0\\xf0\\x2e\\xc4\\x87\\x47\\xd1\\x01\\x59\\x61\\xa3\\x33\\xc2\\x88\\x54\\xbe\\x60\\x94\\xe9\\x92\\x06\\x8e\\x4e\\x3f\\x98\\x41\\x76\\x1e\\x88\\xab\\x22\\x3d\\x03\\xa0\\x86\\xbd\\x3e\\x3d\\x3c\\x40\\xb1\\x99\\x17\\x78\\xa9\\xf7\\x4d\\x51\\x5a\\x2d\\xc7\\x5f\\x32\\x23\\xdb\\xf7\\xa4\\xcf\\x32\\x8c\\xad\\x66\\x90\\xeb\\x60\\x59\\x80\\x44\\x0b\\x24\\x06\\x48\\x29\\x18\\x3d\\x32\\xd7\\xb2\\xdf\\xa6\\xf2\\xed\\x06\\xac\\x3d\\x24\\x0a\\xa6\\x1e\\xa5\\x40\\x02\\x25\\x73\\xcf\\x47\\x5e\\xd5\\x47\\xc1\\xae\\x5f\\x68\\xe8\\x63\\x5d\\x4f\\x33\\x95\\x42\\xdf\\x95\\xca\\xf4\\x3a\\x1f\\xfd\\x93\\xcc\\xa1\\x3c\\x61\\xfc\\x4d\\x4e\\x34\\x04\\x84\\x9e\\x54\\x4c\\xb7\\x19\\x8f\\xbd\\x83\\x05\\x11\\x0a\\xff\\x06\\x6a\\x9c\\x95\\x95\\xf0\\x54\\x17\\x49\\xcd\\x49\\x4d\\x1c\\x80\\xe3\\x97\\x52\\x56\\x75\\x35\\x32\\x4a\\xf3\\x02\\xa4\\x89\\xb5\\x3b\\x91\\x29\\x4b\\xf5\\x89\\xc4\\x21\\x69\\x60\\x57\\x12\\x15\\x9e\\xe6\\x60\\x27\\x15\\x8f\\x50\\xe7\\xc0\\x21\\x7b\\xea\\x97\\x09\\xbf\\xd2\\x6e\\xc8\\x59\\xee\\x9c\\xc5\\x56\\x8b\\x84\\xf8\\xe0\\x3b\\xd2\\xb2\\x04\\x0e\\x55\\xf4\\xa3\\x9e\\x61\\x8f\\xe0\\x54\\xc0\\x9f\\x0d\\xcf\\x50\\xf3\\x0f\\x90\\xa7\\x5f\\x2c\\x7a\\x79\\x2b\\x49\\x12\\x1c\\xe0\\x2f\\x70\\x0f\\xc4\\xaa\\x83\\xe3\\xb8\\x2d\\x9f\\x6c\\x54\\x12\\x0f\\x9e\\x47\\x23\\x13\\xf8\\x11\\xee\\x4f\\x82\\x29\\x43\\x26\\xde\\x11\\x5f\\xeb\\x31\\xb9\\x31\\x6b\\x70\\x77\\x97\\x7b\\xce\\x7d\\x5a\\xcb\\x4e\\xa2\\xc7\\x4d\\xd2\\x57\\x14\\x37\\x9a\\x79\\x37\\x34\\x3d\\x1d\\xc1\\xe5\\xf8\\xa8\\xe4\\x1d\\x17\\xe1\\xc1\\x60\\x00\\x86\\x37\\xf1\\x35\\x01\\x6d\\xa7\\x11\\xeb\\xca\\x54\\x14\\x3b\\x55\\x84\\x46\\x8d\\x35\\x64\\xef\\x69\\x21\\x51\\x43\\x23\\x22\\x1f\\xc9\\x2c\\xf7\\x1d\\xda\\x4e\\x29\\x09\\x5d\\xf3\\x48\\x5d\\xa9\\x0a\\xb4\\x64\\xa0\\x0f\\x46\\x62\\xd1\\xf3\\x4b\\x8d\\xaf\\xe0\\x4c\\x32\\x94\\xdc\\x90\\x08\\xeb\\xfb\\x8c\\x74\\x92\\x4a\\x93\\xed\\x1f\\x12\\xb6\\x44\\x62\\x30\\x30\\x2f\\x39\\xbd\\x45\\xa4\\x57\\x49\\xb1\\x8a\\x54\\x9c\\x44\\xcb\\x8d\\x54\\xad\\x41\\x6a\\x83\\x1c\\x78\\x55\\x79\\x2b\\x7a\\xc4\\xbb\\x04\\xaa\\x2d\\x54\\x15\\x41\\x5d\\xd2\\xea\\x22\\x99\\xd9\\x4c\\x80\\xcf\\xcf\\x83\\x74\\x09\\xab\\xa1\\xab\\xc4\\x98\\x9b\\x6d\\x97\\x55\\xb6\\xef\\x8f\\xfd\\x03\\x95\\xa1\\x04\\x7b\\xc1\\x97\\x75\\xc3\\x3a\\x9b\\x8f\\x9b\\x1d\\xbb\\x63\\x02\\x11\\x68\\xcc\\x9b\\x6e\\x7d\\x61\\xb6\\x01\\x64\\x70\\xf6\\xa2\\xe0\\xfb\\xa6\\x90\\xa9\\x03\\x59\\x3c\\xd3\\x24\\x21\\xe2\\x14\\x80\\x95\\x75\\x23\\x50\\x1f\\xea\\x14\\xaf\\x83\\x71\\xa5\\x20\\x14\\xcd\\x4b\\x9a\\x01\\x50\\xaa\\xdb\\xea\\x30\\x66\\x1e\\xac\\x8b\\x70\\xca\\x22\\x29\\x22\\xbf\\xa9\\x8c\\x1a\\x39\\xc3\\xd0\\x2a\\xf7\\x33\\x27\\x75\\x6c\\xca\\x2d\\x76\\x8a\\xc3\\xb1\\x5e\\x5d\\xb4\\x9c\\x14\\xa2\\xe5\\xa4\\xc1\\x9d\\xfa\\xba\\xb1\\x60\\x6b\\x47\\xa6\\x2c\\xf1\\x4a\\x6f\\x26\\x91\\xaf\\xb8\\x25\\x06\\x04\\xbc\\x0e\\xa4\\x6f\\xda\\x37\\xe8\\x2a\\xa2\\x88\\xc3\\xb7\\x8b\\x18\\x9f\\x8a\\x89\\xcb\\xf8\\xfb\\xa9\\x58\\xb8\\x18\\xc3\\xd7\\xa3\\x62\\x35\\xe4\\xa7\\x9b\\xc2\\xe6\\xc6\\xae\\xce\\xd7\\x94\\xf4\\x45\\x49\\x7f\\xab\\x8c\\x65\\xd6\\x28\\x89\\xd6\\xc8\\x0b\\x18\\x44\\x59\\x3e\\xa6\\xed\\x32\\x52\\x43\\x42\\xfe\\xc5\\x58\\xe6\\xba\\x7f\\x39\\xef\\xe2\\x48\\x83\\x27\\xe7\\xe0\\xa6\\xfb\\x66\\x7f\\xd3\\x05\\x87\\x62\\x80\\xee\\x06\\x07\\x2d\\x6e\\x52\\x26\\x7e\\x71\\x7c\\x78\\xe8\\x0c\\x50\\x7b\\x9b\\xd2\\x9d\\xca\\xbc\\x20\\x5f\\x12\\xe8\\xf1\\x88\\x2e\\x80\\xd7\\x5e\\xbc\\xc2\\xeb\\xc3\\x80\\xcd\\xc9\\xd6\\xa4\\x48\\x49\\x20\\x85\\xfa\\x9e\\xab\\x35\\xf1\\x58\\x2f\\xcf\\x56\\xc4\\x5c\\xe9\\xa2\\xbc\\x35\\xac\\xb1\\xd5\\xd9\\x1a\\x10\\xef\\xda\\x14\\xb4\\x95\\xcc\\x8f\\x19\\x27\\x6b\\x64\\xc4\\x66\\xf8\\x93\\x88\\x57\\x52\\x96\\x58\\xf0\\xce\\x68\\x29\\x35\\x8b\\xb4\\xfc\\x0b\\x91\\xbf\\xc1\\x93\\xc9\\xa2\\xd9\\x91\\xb9\\x59\\x22\\xd2\\xb1\\x60\\x4e\\x5c\\xcb\\x45\\xbf\\x81\\xf5\\xee\\x20\\xc1\\xe1\\xfa\\xb0\\xe0\\x23\\xf2\\x96\\x80\\xc4\\x9e\\xef\\xef\\x2c\\xfb\\xe4\\xeb\\xd7\\x7d\\x14\\xcf\\x74\\xc3\\xc2\\xc7\\x17\\xfe\\x01\\x4f\\x58\\x37\\xe2\\xc2\\x1a\\x35\\x1e\\xa0\\x9b\\x6a\\x6f\\x44\\x14\\xd6\\xe9\\xa9\\xfb\\xe2\\x40\\xd5\\xb3\\xa2\\x6a\\xd7\\xcf\\xb7\\xce\\xdd\\x57\\xaf\\x7c\\x5d\\xa5\\xe7\\xb1\\x22\\x91\\x28\\x12\\x49\\xf7\\x1e\\x5f\\xbd\\x37\\x65\\x54\\x93\\x92\\x02\\x42\\xe2\\xcf\\x3c\\xa1\\x76\\xb0\\x77\\x7d\\x4e\\x26\\x60\\xb9\\xfe\\x1b\\xd2\\xa0\\x58\\x28\\xf0\\x4d\\x32\\x5f\\x20\\xa7\\x2a\\xbe\\xf4\\x70\\x2b\\x30\\x7a\\x6c\\x3e\\x72\\x79\\x95\\x01\\x5a\\x6d\\x22\\x97\\xb9\\x25\\x71\\x08\\x43\\x83\\x73\\xb2\\x3b\\x4a\\x74\\xc3\\xc8\\x58\\x32\\x72\\x1e\\x47\\xe4\\xcd\\xdc\\x33\\x67\\x6c\\x38\\x0d\\x8e\\xc2\\x65\\xbc\\x44\\x42\\x52\\xde\\x43\\xcd\\x29\\x57\\xa6\\x25\\x79\\x9a\\x5a\\x6d\\x89\\xe6\\x8c\\x44\\x3a\\x32\\x41\\x1f\\x66\\x32\\xb1\\x4a\\xa1\\x22\\xef\\x7f\\xae\\xe4\\x5e\\x54\\xb1\\x65\\xb5\\x99\\x37\\x77\\xb2\\x00\\x00\\xe4\\xf8\\x88\\xeb\\x0b\\xe8\\x25\\x7e\\xb0\\x8c\\x32\\x2f\\x4d\\xbd\\x6a\\xd8\\x11\\xc8\\x72\\xc3\\xb9\\xb0\\xd8\\xb3\\x8c\\xf8\\x5f\\x01\\x84\\xfc\\x52\\x19\\x08\\x2b\\x29\\x8c\\x97\\x66\\x66\\x16\\x51\\x5b\\x99\\x34\\xec\\x8c\\xd1\\x9e\\x8f\\x2e\\x6a\\x49\\xb9\\xfe\\x0c\\x7d\\xfb\\x3b\\x3c\\x26\\x2f\\xa7\\x22\\x50\\xf3\\x76\\xb7\\x1e\\x17\\x32\\x73\\xc3\\x69\\x46\\x24\\x82\\xef\\x2a\\x00\\xb9\\x5b\\x76\\xeb\\x2f\\x16\\xc1\\xc1\\x5e\\xeb\\x8e\\x6c\\x8a\\x11\\xcc\\x85\\x8b\\xe4\\x25\\x9f\\xab\\x94\\xdc\\x1c\\x74\\x81\\x36\\xa4\\xc0\\x8b\\x41\\x97\\x3d\\xc2\\x2a\\x3b\\xe3\\xc8\\x74\\x39\\x43\\x69\\x1c\\x2a\\x87\\x4f\\x36\\x85\\x73\\x4c\\xb5\\xa6\\xcd\\x39\\xd9\\x36\\xc2\\x53\\x5e\\xea\\x5e\\x10\\xb6\\x68\\x7c\\x68\\x14\\xc5\\x9b\\xe2\\xb1\\x29\\xd4\\xce\\xda\\x46\\xb7\\xee\\x98\\xb9\\xd3\\x7a\\xb4\\x16\\x44\\xbd\\xec\\x3c\\x6b\\xac\\x65\\x75\\x46\\x7e\\x83\\x47\\xf5\\xa2\\xaa\\xed\\x02\\x81\\xe5\\x36\\x79\\x36\\xf6\\xdb\\x59\\xdd\\xb1\\x2d\\xe9\\xec\\x25\\xe0\\x6e\\x01\\x59\\x35\\x32\\xcc\\xdc\\xe4\\x41\\x61\\xab\\x8a\\xea\\x43\\x4e\\x38\\xfb\\xfa\\x75\\xd0\\x69\\x67\\x05\\x4b\\xfc\\x95\\x8b\\x80\\x22\\xd1\\xab\\x8d\\xa3\\xb2\\x14\\xdf\\xdb\\x3c\\x2e\\x0b\\x49\\xf6\\xb3\\xf0\\x68\\x6f\\xd1\\x38\\x08\\x07\\xab\\x40\\xf2\\xec\\xb3\\x17\\x47\\xb6\\xeb\\x0b\\x5d\\xa3\\x9c\\xb8\\x4e\\x52\\x34\\x59\\x5f\\x1d\\x94\\x86\\xfa\\x05\\x3f\\x4e\\x6b\\x49\\x85\\x23\\xc7\\x8d\\xe3\\x31\\x65\\x61\\xa9\\x93\\xfa\\x01\\x23\\x3f\\x58\\xba\\x21\\xb4\\x4c\\x44\\x9e\\x02\\xd6\\x5d\\x50\\xac\\xbb\\x79\\x11\\x03\\x60\\xcd\\xd3\\x31\\x50\\x9b\\xed\\x25\\x71\\x1d\\x0b\\x34\\xae\\x74\\x81\\xd1\\xc0\\xf6\\x22\\x64\\x9d\\xe6\\x13\\xbf\\x01\\xd3\\x6f\\x44\\x2d\\x7a\\x9e\\xe2\\x86\\xd9\\x08\\x2e\\x66\\x71\\x66\\x11\\xf8\\x72\\x9e\\x65\\x89\\x37\\x33\\x01\\x64\\x62\\xce\\x19\\x19\\x46\\x1f\\x1d\\x39\\xcf\\xe1\\xa1\\x33\\x25\\xb6\\xcb\\x9d\\xa0\\x60\\x07\\xc3\\x6a\\x02\\x8a\\x83\\x41\\x75\\xd8\\x82\\x4c\\x3b\\x23\\xbc\\x3d\\x5a\\xab\\x8d\\x18\\x96\\xd8\\x1c\\x57\\x9e\\x92\\x68\\xe9\\xa3\\xe8\\xc3\\x98\\xaf\\xf1\\xa8\\x5c\\xee\\x1e\\x90\\x5f\\x4f\\xe1\\x11\\xda\\x7a\\xea\\x21\\xf6\\x3a\\x95\\x6e\\x8f\\xe9\\x94\\xba\\x02\\xd4\\xff\\xd4\\x03\\x64\\x4f\\x94\\x9a\\x8e\\x2b\\xd0\\xe8\\x42\\x98\\xb7\\x6c\\xed\\xbc\\x21\\xa2\\x07\\xe7\\x14\\x5c\\x3c\\x74\\x37\\x4f\\x3d\\xfe\\x9f\\x3d\\xcb\\x09\\x80\\x32\\x67\\x7d\\x90\\x0e\\x0c\\x0b\\xe6\\xd1\\xd3\\x4d\\xe6\\x71\\xf1\\x38\\x14\\x22\\x07\\x16\\x60\\x26\\x3c\\x3d\\x51\\x3c\\x88\\x84\\x2b\\x3d\\xd1\\xfc\\x86\\xc1\\x3e\\x70\\xc6\\xef\\xcb\\xf8\\xd2\\xed\\x88\\xc4\\x53\\x78\\x23\\x87\\xb1\\x43\\x7e\\xc9\\x80\\x10\\x2d\\x8b\\x25\\x62\\xde\\x48\\x0c\\x4d\\x3a\\x43\\x59\\xce\\xa1\\x37\\xb1\\x29\\xd5\\xf9\\xe3\\xba\\x81\\xeb\\x36\\x67\\x90\\x01\\x75\\xb5\\x62\\xe0\\xba\\xc4\\x6f\\x60\\x22\\xbe\\xae\\xaa\\xb8\\xc1\\xe7\\x7a\\x7d\\x55\\x59\\x9a\\x98\\x45\\xe9\\x97\\x5d\\xfa\\x48\\x25\\xb7\\xbb\\x2c\\x80\\x7f\\x62\\xa7\\x1c\\x6e\\x53\\xb2\\xd1\\xa4\\xa5\\x5c\\xc5\\x48\\x8b\\xd3\\xfd\\x06\\xc7\\x41\\x58\\xbd\\xc4\\x55\\x87\\x3b\\x5c\\xf5\\x53\\xf9\\x85\\x78\\xc7\\xdd\\xe9\\xe3\\x8b\\x43\\xcc\\x9b\\xf7\\xf0\\x50\\xe9\\xcd\\xc7\\xb3\\x1b\\x05\\xf1\\xb8\\xa7\\x71\\xf2\\x25\\xa7\\x5b\\x72\\x6f\\x7c\\x2f\\x62\\xfa\\xe8\\x6b\\xaf\\x6c\\x32\\xb2\\xb3\\xf6\\xa4\\x30\\x27\\xe1\\x51\\x69\\xed\\x65\\xca\\xbb\\x02\\xa0\\x2e\\xc0\\x17\\x24\\xbd\\x87\\xe9\\x5a\\x22\\x93\\xb0\\x94\\x62\\xa5\\xd6\\x8a\\x37\\x97\\xad\\xcf\\xec\\xdf\\x98\\x1e\\xa3\\x72\\x08\\x3c\\xcd\\x51\\xe6\\x91\\x5b\\x7e\\x40\\xff\\x01\\xc7\\xcd\\x81\\x82\\x9f\\x8f\\xe8\\x63\\x79\\xb6\\xef\\x9e\\x2f\\x5a\\x77\\x14\\x67\\x89\\x62\\xd3\\xde\\x9d\\xad\\xe9\\x75\\x2d\\x5e\\x49\\x88\\x74\\x76\\x23\\x7e\\xc9\\x3a\\x80\\x5c\\x8f\\x60\\xbd\\x33\\xee\\x18\\xc0\\x5e\\xc0\\x3a\\x6b\\x42\\x0d\\xc0\\x53\\xb8\\x78\\x7b\\x6e\\x40\\xf1\\x86\\x63\\xac\\x01\\xb3\\xb5\\xbb\\x8d\\x99\\xc9\\x36\\x90\\x0e\\x47\\x89\\x21\\xeb\\x78\\x78\\xe8\\x98\\x95\\xdd\\x80\\xb3\\x16\\x4a\\xce\\xd0\\x8f\\x9f\\xb0\\x4e\\x11\\xf2\\xab\\x4d\\xb1\\x12\\x93\\x1d\\xd9\\x92\\x66\\x97\\xcf\\xef\\x5f\\x90\\xe2\\x36\\x53\\x72\\x26\\x1b\\x59\\x7b\\xd4\\xb1\\xf3\\xa6\\x4a\\x3a\\x9c\\xf2\\x38\\x97\\x0e\\xeb\\xe2\\xa6\\x42\\x82\\x26\\x1d\\x13\\x28\\xe1\\xd8\\xc8\\x39\\x8b\\x00\\xab\\x47\\x66\\x2c\\xf0\\xb2\\xe1\\x4f\\xa2\\x29\\xcf\\xf8\\xfd\\xa5\\x8d\\x4f\\x4c\\xcc\\x80\\x9d\\x16\\x8d\\x1a\\x18\\x4b\\x26\\x9a\\xea\\x62\\xd8\\x4c\\x99\\xfa\\x3f\\x3c\\xc0\\x81\\x22\\x7b\\xe9\\x88\\x9f\\xcf\\x40\\x23\\xac\\xa4\\x3a\\xa4\\x88\\x98\\x48\\xc9\\x3e\\xd0\\xe7\\x66\\xcb\\xe1\\x99\\x59\\xc8\\x9b\\x54\\x8d\\xa5\\x38\\x49\\x9e\\xae\\xab\\x9b\\x0f\\xc2\\xcb\\x45\\xbd\\xba\\xd4\\x2d\\x6c\\xf9\\x63\\x6f\\x02\\x7f\\x9b\\x18\\x36\\x09\\x2d\\x8a\\x49\\x5c\\x28\\xc9\\xd5\\xfb\\xb7\\x68\\x4f\\x20\\x54\\xd0\\x85\\xcf\\x84\\xd6\\xe7\\x46\\x3a\\x49\\x0b\\xd7\\x1d\\xad\\xcf\\x44\\x00\\x8e\\x61\\x96\\x3e\\x03\\x20\\x3f\\xc3\\x1c\\x87\\xad\\x4b\\x16\\xa3\\xa5\\x38\\x1c\\xca\\x50\\xff\\xe7\\x26\\x6a\\xcf\\xc3\\x57\\xbf\\x10\\x75\\xef\\x67\\x36\\x47\\x79\\xef\\x5e\\x70\\xdc\\x27\\x64\\x44\\x24\\x13\\x1e\\x1e\\x28\\xd6\\x43\\x31\\xc2\\x58\\x2c\\x8e\\x4b\\x32\\x59\\xfa\\xdc\\xc8\\x73\\xe2\\x1a\\x59\\x35\\x8a\\x81\\xae\\x8a\\x22\\x99\\xe4\\x9c\\xef\\x45\\x98\\xa2\\xdc\\x65\\x30\\xd2\\x50\\x48\\x3c\\x21\\xbb\\x81\\xc8\\x7c\\x17\\x46\\x12\\xb9\\x43\\xd5\\x09\\xac\\x80\\x15\\x6c\\xbd\\x08\\xfe\\x2e\\xb9\\xdb\\x5a\\x8d\\x22\\xfe\\xda\\xc7\\x50\\x6a\\x19\\xbf\\xf6\\xd1\\xf5\\x66\\x04\\xf3\\x3a\\x32\\x5d\\x7c\\x73\\xc9\\x5f\\x8b\\x8f\\xb7\\x0c\\x7e\\x0b\\x15\\xbd\\xd0\\x95\\xfd\\xe7\\xc6\\xbc\\x99\\x01\\x40\\x02\\x18\\x78\\x04\\x03\\xcf\\x10\\x4a\\x31\\x5d\\x1f\\xbf\\xf0\\x8d\\x97\\x50\\x17\\xa3\\x48\\x5d\\x21\\x6d\\xd9\\x06\\x8f\\x59\\xd2\\x40\\x4a\\x7c\\xde\\xa0\\x46\\x51\\xe1\\x13\\xdb\\x6e\\x60\\xe3\\xf8\\xc9\\xc7\\x3e\\x1c\\x1d\\x3d\\xa3\\x76\\xe8\\x06\\x21\\xe5\\x11\\xb4\\x07\\x20\\x98\\x37\\x13\\x8a\\xd7\\xf2\\x8c\\xfa\\x42\\xf7\\xd3\\x18\\xac\\xca\\xc5\\x6f\\x41\\x73\\x49\\xc6\\xfa\\x6a\\x03\\x79\\x05\\x94\\x7c\\xb9\\xeb\\xea\\xb4\\x6b\\x4b\\x3b\\x0e\\xb7\\xab\\xb0\\x55\\x79\\x0c\\x87\\x93\\x99\\xbf\\x38\\x9f\\xc4\\x33\\x6c\\x9c\\x0b\\x1f\\xc9\\x34\\xd2\\x65\\x0a\\x84\\xd5\\x7a\\x81\\xd9\\xd1\\x0d\\xc4\\x8e\\xef\\xdf\\xc7\\xdd\\x52\\xa7\\xb9\\xab\\xe9\\xa7\\x9f\\x0a\\x81\\xf2\\xa6\\x8d\\x8e\\x15\\xc7\\xbe\\xd8\\x4e\\x50\\x8d\\xb4\\x19\\x24\\xdf\\xe6\\xa8\\xc1\\x72\\xf1\\x5f\\xd6\\x48\\xb5\\xf8\\xa2\\x46\\x97\\x6a\\x97\\xc8\\x3e\\x2a\\x21\\x7b\\x37\\xc8\\x92\\x92\\x3f\\xa3\\x03\\xb4\\x06\\x3a\\x30\\xd9\\xa5\\x36\\x5c\\x32\\x89\\x46\\xc5\\x59\\x3c\\xbd\\xdd\\xbd\\xdb\\x1e\\x7d\\xab\\xe3\\xb5\\x4f\\x5a\\xe8\\x2b\\xc0\\x26\\xf9\\xe4\\x8b\\xa0\\x11\\x1b\\xfe\\x19\\x9f\\xd0\\x8f\\x01\\xa4\\x46\\x63\\x58\\x51\\x1e\\x75\\x13\\xb0\\x4c\\x48\\x34\\x47\\x54\\x20\\xf2\\x84\\xbf\\xf1\\x85\\x2b\\x9f\\x0f\\xf4\\xbb\\x44\\x43\\xb3\\xa6\\x10\\x23\\xc1\\x99\\x8f\\xc4\\xf2\\x5d\\xc3\\x03\\x8c\\x9d\\x68\\x3c\\x20\\x75\\x2e\\x1b\\x57\\x21\\xf1\\xa6\\x8b\\x3a\\x51\\xb1\\x5a\\x57\\xb0\\x22\\x49\\xf3\\xcf\\x24\\xff\\x31\\x5b\\xbb\\xb2\\xc8\\x12\\x98\\xaf\\x05\\xfc\\xd5\\x8a\\x75\\x9a\\x58\\x72\\x0c\\xcf\\x6d\\xf8\\xb5\\x3b\\xa6\\xac\\xa0\\xb8\\xaa\\xfa\\xaa\\xe5\\xe9\\xe1\\xf2\\x8c\\xe5\\xf2\\xcc\\xf8\\xb3\\xce\\x7f\\xbf\\x38\\x4b\\x22\\xd2\\xaf\\x20\\x59\\x72\\x57\\xef\\x92\\xb8\\x15\\xeb\\x29\\xfe\\xfa\\x55\\x29\\xaa\\x7a\\xa6\\x57\\x15\\xeb\\xcb\\x31\\xdd\\xa3\\x3d\\x80\\x6b\\x3a\\xb8\\x1c\\xf5\\x10\\xa1\\xc4\\x6b\\x02\\x53\\xe4\\xeb\\x7a\\xf2\\x19\\x6a\\x37\\xc7\\xe4\\xfa\\x7e\\x92\\x4d\\x25\\x58\\x51\\x4e\\x9f\\x8e\\x2d\\x1b\\x55\\x49\\x84\\xf7\\x21\\x65\\xc4\\xfa\\xf0\\x60\\x9d\\xf1\\x18\\x3e\\xc5\\xfa\\x81\\xed\\xa9\\x1b\\x2b\\xaf\\x74\\x63\\xe5\\xa3\\x3b\\x7b\\x75\\x0a\\xe9\\x77\\x51\\x73\\x74\\x85\\x95\\x08\\x3b\\x4a\\x3f\\xf7\\x97\\xb3\\xc6\\xbb\\x63\\x20\\x65\\x6a\\x94\\x80\\x16\\x43\\x8b\\x71\\x00\\x5c\\x9a\\x5d\\x9b\\xe9\\xef\\x1b\\x5b\\x64\\x68\\x16\\xa9\\x9d\\x23\\x4f\\x20\\x38\\xf1\\x9d\\x0a\\xe5\\x17\\x17\\xf8\\xc6\\x30\\x5d\\x68\\xda\\x85\\x40\\x4c\\x61\\x52\\x1d\\x93\\xda\\xf2\\xda\\x0e\\xaf\\x7e\\x69\\x9c\\xd6\\x08\\xb0\\xc1\\x52\\x75\\xfa\\xcc\\x1a\\x99\\x52\\x86\\x14\\xf1\\xe5\\xc4\\x6d\\x76\\xa6\\x2a\\x27\\x62\\x73\\xfc\\x65\\xb5\\xe4\\x53\\xe6\\xc4\\xfe\\x7c\\x53\\x7b\\x06\\x5d\\x79\\x78\\x40\\xb9\\x0b\\x6c\\xaf\\x1b\\xd3\\x7c\\xce\\xd7\\x63\\x63\\x29\\xe8\\x12\\x18\\x9c\\x03\\x3b\\x56\\x94\\x6d\\xf2\\x44\\xa4\\x8a\\x1a\\x32\\xcc\\x0e\\xcc\\x2c\\x06\\x04\\xbb\\xe1\\x15\\xfd\\x66\\x6a\\x75\\x70\\xd5\\x4b\\x01\\x2b\\x73\\xa4\\x3e\\xe0\\x8d\\x9b\\xaa\\xc5\\xaa\\xc8\\x8f\\x07\\x98\\xba\\xe5\\x48\\x75\\x47\\xcd\\x9e\\xba\\xfe\\x8c\\x77\\x6e\\x1b\\xe1\\x84\\x8f\\x4b\\x73\\x87\\x52\\xdb\\x39\\x45\\xca\\x81\\x53\\x5f\\x4d\\x59\\x2e\\xa1\\x42\\x71\\x3b\\x72\\xd4\\xf5\\x08\\xa1\\xaa\\xee\\x40\\x99\\xab\\xa0\\xea\\xa3\\xe2\\x22\\x0e\\x79\\xa4\\x9c\\x90\\xf9\\xea\\x2b\\x1e\\x81\\x04\\x07\\xb1\\xee\\xfd\\xd6\\x67\\x1a\\x8d\\x0b\\x5d\\xfe\\x3c\\xc6\\x3a\\x6d\\xac\\x93\\x45\\xec\\x59\\x2e\\xc5\\x67\\xca\\xe5\\x03\\x57\\x0d\\x00\\x39\\x95\\x0f\\xd0\\xd3\\x07\\x18\\xef\\x6d\\x02\\x1e\\x4a\\xb0\\x93\\x64\\x09\\x97\\x5c\\x84\\xbb\\xc2\\xd1\\x77\\x45\\xf4\\xdc\\x19\\x99\\xb4\\x27\\x80\\xe2\\xc3\\xdc\\x74\\x32\\x93\\x3b\\x5d\\x5f\\x84\\x2f\\xcd\\xc4\\x25\\x67\\xc1\\xcb\\xc7\\x75\\xbc\\x88\\xad\\xa3\\xbe\\xd2\\x38\\x67\\xa2\\xd2\\x7a\\x56\\x5f\\xb7\\x81\\xa9\\x6f\\xc3\\xa3\\x5f\\x5f\\x03\\xd6\\x86\\x06\\xf7\\x08\\x1a\\xc5\\xf9\\x89\\x1b\\xd2\\xb2\\x73\\x38\\x0f\\xe8\\x6f\\x54\\x71\\xd8\\xe0\\x3d\\xc0\\xd8\\x35\\x44\\xef\\xdb\\x29\\xa0\\x7b\\x22\\xf3\\xd0\\x95\\xcd\\xec\\x4e\\x8c\\xd0\\x88\\x1f\\x1e\\x92\\x33\\x0f\\xd7\\x0c\\x05\\xf7\\xa4\\x27\\x12\\x5e\\x44\\xe8\\xcf\\x00\\x85\\x0f\\x40\\xaf\\x00\\x6b\\x0a\\x7f\\x37\\x3c\\x80\\xbf\\xb3\\x0d\\x4f\\x98\\x83\\x34\\xc9\\xec\\xae\\x58\\x7a\\x1e\\x1e\\x0a\\x90\\xd2\\x74\\x58\\x02\\x4d\\x66\\xa2\\xc9\\x04\\x9a\\x34\\x47\\x40\\xfb\\x50\\x9c\\x3a\\xf8\\xdc\\xe0\\x5a\\x46\\x0f\\xe5\\x1c\\x09\\xc3\\x26\\x61\\x7d\\x13\\x99\\x58\\xee\\xd3\\x5d\\xde\\xa7\\xbb\\x2f\\xf4\\xe9\\x0e\\xea\\x21\\x3a\\x09\\x7a\\xa7\\xf5\\x69\\xd3\\xa0\\xca\\x83\\x03\\x7d\\xea\\xd0\\x70\\xb0\\x4f\\x79\\x46\\xec\\x9e\\xe8\\xd3\\x1d\\xf6\\x49\\x27\\x91\\x14\\xc4\\x79\\xf4\\xf0\\x80\\xb1\\x58\\xf1\\x62\\x02\\x65\\x8a\\x4a\\xb7\\x0d\\x7a\\x64\\x91\\x39\\x2d\\xfe\\x9d\\xdd\\x09\\x8d\\x35\\x1f\\x7b\\x14\\x90\\x97\\xe5\\xa3\\x23\\x47\\x69\\x24\\xe0\\x52\\x0e\\x0d\\x1c\\x07\\xe6\\xac\\x63\\xa6\\xb6\\xaf\\x76\\x80\\x11\\x01\\xdf\\x99\\x9a\\x98\\x67\\x49\\x72\\x22\\x20\\x31\\xb3\\xdc\\x5c\\xb8\\xfa\\x46\\x5a\\x7a\\x86\\x27\\xdf\\x1f\\x9a\\x06\\x39\\x51\\x3c\\x73\\xfe\\xde\\x07\\xac\\x09\\xa3\\x5d\\xf0\\x02\\xf5\\x00\\x3e\\x40\\xfb\\xfa\\x4e\\xa3\\xd0\\x89\\x1c\\xc0\\xd2\\xfc\\x3f\\xf9\\x68\\xbe\\x4e\\xdb\\xd6\\x27\\x6d\\x5b\\xbf\\xd2\\x2c\\x43\\x43\\xfb\\xa9\\xa6\\x03\\x80\\x94\\x8e\\xaf\\xe9\\x48\\xe8\\x17\\xb7\\x68\\x5a\\xfa\\x1e\\x69\\x16\\xfb\\x15\\xfc\\xdd\\xd7\\xbd\\xf3\\xc6\\x13\\x8f\\xd1\\xff\\xa7\\xb6\\x1e\\xdc\\xd6\\xd3\\x0e\\x4a\\x2a\\x09\\x64\\xcd\\x63\\x51\\xaf\\x12\\x22\\x79\\xe2\\xc2\\x44\\x5b\\x1e\\xca\\x09\\xc6\\x5f\\x79\\xef\\x97\\x84\\x38\\x78\\xbc\\x4a\\x85\\x58\\x73\\x9c\\xda\\x45\\x9f\\x38\\xf2\\x41\\x18\\xe3\\x8e\\xfe\\x3f\\xc5\\xfb\\x7d\\x8f\\xf9\\x08\\x0d\\x9a\\x8f\\x27\\x9b\\x74\\x8c\\x8b\\x39\\xb4\\xa5\\x68\\x0f\\x0d\\xae\\x9f\\x49\\x39\\x1f\\x19\\x3a\\xa3\\x0a\\xe9\\x13\\xb5\\x65\\x97\\xc4\\xdd\\x08\\x1e\\x92\\xb4\\x88\\xa1\\x3f\\x48\\xd6\\x3c\\x59\\x63\\x17\\x8b\\xad\\xb1\\xd8\\x0a\\xc8\\x91\\xa7\\xea\\x0f\\x87\\x8d\\x5a\\x0d\\x0b\\x2e\\x88\\xf8\\xf0\\x99\\xf4\\x16\\x2c\\x74\\x3d\\xf9\\x7d\\x48\\x6e\\x68\\xab\\x5c\\x9b\\xed\\xd9\\xbd\\xab\\x49\\xe9\\x4a\\x9f\\xe4\\x70\\xd6\\x75\\xe8\\x31\\xc4\\xd3\\x49\\x23\\x5f\\x0a\\xcf\\x68\\xb3\\x08\\xea\\x91\\xee\\x4a\\x95\\x76\\x29\\x99\\xf9\\xed\\xa7\\x01\\x26\\x96\\x11\\x4f\\xa5\\x7f\\xa3\\xec\\xe1\\x21\\x3b\\x2b\\xbc\\xc8\\x85\\x8d\\xb4\\xee\\xd5\\x8b\\xcd\\xd1\\x94\\x55\\x04\\xd1\\x02\\x78\\xbe\\x76\\x86\\xc1\\x53\\xe0\\xf9\\xed\\xce\\x78\\x94\\xa7\\xd3\\x7c\\xc8\\x2d\\x31\\x62\\xa5\\xe5\\xe0\\x68\\x3a\\x0e\\xa3\\x5d\\xfb\\x99\\xb2\\xdf\\x62\\xf2\\xb2\\x6a\\xa0\\x59\\x2e\\xbb\\x22\\xdf\\xda\\xfb\\xc4\\x7f\\xd1\\x8a\\x1f\\xdf\\xfa\\xe1\\x0f\\x74\\xe9\\xfa\\x48\\xbd\\xa9\\x81\\x06\\x6c\\x30\\xa5\\x2a\\x77\\xd5\\xf5\\x95\\x4e\\x18\\xe6\\x16\\x93\\x28\\x6e\\xb6\\x46\\xe1\\x99\\x37\\xf2\\x1a\\x0d\\x33\\x6d\\xf0\\x12\\x3c\\x35\\x2b\\x49\\x9a\\x6d\\x11\\xf7\\xee\\x5e\\x46\\x7d\\x0f\\xf8\\xfd\\x3c\\x88\\xa2\\xd8\\xde\\x30\\x0c\\x8e\\x60\\x6f\\xe8\\x3e\\x9e\\xf2\\xb4\\x84\\x25\\x76\\x85\\xe6\\xe3\\x8f\\x3e\\xfa\\x58\\xed\\x60\\x84\\x5c\\xfc\\xbb\\xca\\x90\\xd8\\x11\\x15\\x6e\\xa0\\xc2\\xc4\\x06\\x74\\x06\\xff\\xd6\\xf0\\x2f\\x26\\xdb\\xd1\\x8e\\x5e\\x6b\\x54\\xa5\\x4c\\xf9\\x93\\x6f\\xec\\xb4\\x0b\\xf4\\x14\\xf4\\xdf\\x81\\xb3\\x82\\x5a\\x81\\x05\\x66\\x01\\x35\\xc4\\x10\\x7d\\xa2\\xe0\\x81\\x5a\\x3b\\xa7\\x0b\\x3a\\x72\\x9f\\x9c\\x1a\\xb5\\x96\\xe5\\xd5\\x4c\\x76\\x97\\x0f\\x69\\x1f\\x7e\\xcd\\x22\\x0a\\x44\\x13\\xad\\x6e\\x69\\xc8\\x87\\xb2\\x51\\x25\\x94\\x4f\\xeb\\xfd\\x3a\\xba\\xad\\xe8\\xfd\\xf7\\x15\\xbd\\x67\\x1d\\x01\\x1e\\xb3\\x80\\x3a\\xad\\xd6\\x8a\\xe2\\x7a\\xed\\x30\\x6c\\x58\\x5c\\x51\\x88\\x3e\\x75\\x5a\\x03\\xbd\\xb0\\x70\\xe4\\x5e\\x65\\x40\\xff\\x0b\\xcc\\xc7\\x94\\xdd\\x03\\xde\\xa3\\x4b\\x82\\x1a\\x73\\xec\\xc9\\x64\\x3a\\xdd\\xea\\xa5\\x5d\\x58\\xa6\\x8b\\x28\\xde\\x74\\xac\\xc7\\x3a\\x20\\xdb\\xc0\\x18\\xa3\\x74\\x4b\\x7a\\x15\\x54\\xd5\\xd1\\xfd\\xaa\\x3a\\x2e\\x0f\\xd4\\x71\\xf5\\x35\\x95\\xdc\\x1e\\xa8\\xa4\\xca\\x8b\\xf2\\xc1\\x4a\\x2e\\x02\\xb9\\x6e\\xae\\xe0\\x18\\xee\\x5a\\xc3\\x6e\\x77\\x08\\x33\\x34\\x3c\\xee\\xf7\\xe1\\x85\\x75\\x4f\\xbb\\xfd\\xc1\\xc9\\x09\\xeb\\xf4\\xad\\x5e\\xff\\xb8\\x7b\\xc2\\x4e\\x8f\\xbb\\xf0\\x3e\\x60\\xa7\\x9d\\xd3\\xe3\\x4e\\x0f\\xd6\\x5d\\xff\\xd4\\x3a\\xee\\xf5\\x2c\\x76\\xd2\\x1b\\x0c\\x8e\\x3b\\x90\\xd0\\xed\\x0d\\x4f\\x3b\\x27\\x43\\xd6\\x19\\x0c\\x86\\x9d\\xe3\\xc1\\x94\\xae\\xbc\\xce\\x81\\xaa\\xbe\\xd4\\x1b\\xe8\\xf4\\x07\\xfd\\x7e\\x5f\\x6b\\x09\\x1e\\x06\\xa7\\xc3\\xe3\\x6e\\xd1\\xa4\\x65\\x41\\x35\\xa7\\x5a\\xdb\\x98\\xc5\\x3a\\xee\\x77\\xf3\\x4e\\x74\\xba\\xa7\\x83\\xc1\\xc9\\xb0\\x53\\xf4\\xa6\\x0b\\xc9\\x1d\\xac\\x56\\x75\\xab\\x33\\xec\\xf6\\xfa\\x9d\\xd3\\x7e\\xd1\\xbf\\x9e\\x75\\xda\\x3d\\xb1\\x8e\\xb5\\x8e\\x42\\x3f\\x4e\\x06\\x27\\xa7\\xaa\\xc7\\xd0\\x72\\xbf\\x63\\x41\\x13\\x45\\xd7\\x6f\\xa1\\xeb\\x3d\\x6c\\xfc\\xf8\\x98\\x0d\\x7a\\xa7\\x90\\xed\\x94\\x1d\\x5b\\x7d\\xeb\\x18\\x7e\\x3b\\x56\\x77\\xd8\\xef\\x42\\x3d\\xc3\\x41\\xe7\\xd4\\x3a\\x3d\\x66\\xa7\\xdd\\xce\\x70\\x00\\x2d\\x76\\x3a\\xa7\\x9d\\x41\\xa7\\x03\\xf5\\x41\\xd3\\xc3\\x61\\x6f\\x08\\x5f\\xac\\xee\\xe9\\x69\\x0f\\x9a\\xee\\x77\\x87\\x27\\x16\\xb6\\x08\\x1d\\x80\\x0e\\xe3\\x03\\x94\\xed\\x75\\xd9\\xc9\\x70\\x38\\xec\\x0c\\xe1\\x0b\\x14\\x1a\\xc2\\x20\\x70\\xf4\\xfd\\xd3\\x61\\xbf\\x87\\x59\\x8e\\x8f\\x7b\\x00\\x20\\xe8\\xfc\\xf1\\xf0\\x04\\x12\\xac\\x93\\x5e\\xbf\\xd7\\xed\\x63\\xfd\\xdd\\x93\\x01\\x56\\x07\\x80\\x3b\\x1d\\x0e\\xfa\\x45\\xc7\\x2f\\xb0\\xe3\\xdd\\x7e\\x1f\\x60\\x01\\x1d\\x46\\x00\\x58\\x38\\x3c\\x6b\\x38\\xec\\x62\\xbf\\x2c\\xf8\\x86\\x60\\x83\\xc2\\x03\\x6b\\x00\\x55\\x62\\xe3\\xc7\\xc3\\x3e\\x3e\\x74\\x07\\xdd\\xc1\\x29\\x3e\\xf4\\xfa\\x30\\x11\\xac\\xd7\\x1d\\xf4\\xac\\xe3\\x21\\x3b\\x1e\\x0e\\xba\\xfd\\x63\\xac\\x65\\x68\\x1d\\x5b\\x16\\x94\\xe9\\x75\\x2c\\xa8\\xa0\\x0f\\x5f\\x4e\\xa1\\x1f\\x88\\x8a\\x7a\\xa7\\x50\\x6b\\x57\\x40\\x18\\x7b\\xdc\\xe9\\xf7\\x00\\x42\\xa7\\x1d\\x04\\x51\\x0f\\xa0\\xc8\\x4e\\x4f\\x86\\x27\\xd0\\x22\\x02\\xa2\\xd7\\x3f\\x01\\xa0\\x76\\xfa\\xdd\\xe3\\x63\\xeb\\xa4\\x93\\xf7\\xbc\\xc0\\x2e\\x40\\x00\\x86\\xa9\\x5f\\x69\\x2c\\x1f\\x46\\xb8\\xc7\\x27\\x25\\x74\\x22\\xb2\\x7f\\xae\\x0c\\xbe\\x10\\x19\\x56\\x15\\x06\\x4a\\x97\\xb1\\x97\\x2c\\xa3\\x60\\x56\\xa5\\xd0\\x0e\\x4d\\xb4\\x06\\xd3\\xfd\\x42\\xfe\\x0c\\xb0\\x51\\xc9\\x12\\xa8\\xd0\\xd5\\x8d\\x0c\\x3d\\xfb\\xcd\\x42\\xda\\xfe\\xc3\\x13\\x90\\xf4\\x87\\x03\\x56\\x88\\x93\\x38\\xe7\\xac\\x2c\\xd6\\xf0\\x0e\\x85\\x62\\x0c\\x4a\\xd9\\x0e\\xe8\\x44\\xa2\\x00\\x22\\xaa\\xfe\\xd4\\x7c\\xef\\x90\\xb1\\xe3\\xc1\\x8f\\x52\\x2d\\x92\\xb4\\x21\\x51\\x46\\xbb\\xe0\\xc9\\xd9\\x7c\\x6c\\xd9\\x1d\\x72\\x27\\x75\\x16\\xd0\\x1d\\x0b\\x86\\x81\\x01\\x0a\\x92\\xaf\\x81\\xf2\\x3f\\xe3\\x1f\\x1c\\x33\\x3f\\xb6\\x03\\xb6\\x30\\x1b\\x06\\x79\\xe7\\x63\\x9d\\xe6\\xc2\\xb4\\x6b\\x35\\xb3\\x51\\xfb\\xab\\x26\\x54\\xdc\\x0a\\x57\\x55\\x68\\xa0\\xc9\\x2e\\xd9\\x2d\\xbb\\x60\\xd7\\xec\\x35\\x9c\\xda\\x2f\\xe0\\xdf\\x5b\\x64\\xb9\\xd1\\xb6\\x71\\xc5\\x8d\\x86\\x5b\\xdd\\x47\\x54\\x50\\x6e\\x77\\x4d\\x72\\xf3\\xe4\\x03\\x49\\x7b\\x1d\\x14\\x57\\x99\\x46\\x58\\x0f\\x1b\\x41\\x3d\\x30\\xed\\xc6\\x01\\x6d\\x4d\\x86\\x52\\x8c\\x17\\x75\\xe0\\x44\\x01\\x94\\x28\\xd6\\xe6\\x69\\x6a\\xcc\\xda\\x41\\x3d\\x0f\\x6a\\xb0\\x42\\x57\\xa8\\xa8\\x56\\xfd\\x5a\\x7c\\x0a\\xcb\\x9f\\xf0\\xaa\\xea\\x1e\\x18\\xa5\\x7a\\x1e\\xb6\\x2a\\x69\\xbc\\x30\\xd9\\x39\\xd7\\xaa\\xa0\\x94\\x3b\\x3d\\xcf\\xbc\\x09\\x29\\x57\\x7a\\x1e\\x4c\\x21\\x98\\xbc\\x2c\\xc1\\x1b\\x88\\xb7\\x17\\xe6\\x73\\xfe\\xc9\\x51\\x10\\x7f\\x71\\x74\\x94\\x44\\x86\\x04\\x98\\x89\\x12\\xa1\\xff\\xbc\\x14\\x0b\\xe6\\x33\\x10\\xff\\x0d\\x94\\x74\\x8e\\x4a\\xdd\\xf9\\xbc\\xd3\\x99\\xcf\\xd8\\x95\\x2b\\xa2\\xae\\xa5\\x73\\x4f\\x60\\x3c\\x85\\x1a\\x00\\x1c\\xf1\\x97\\x3c\\xd4\\x7b\\xf9\\x1a\\x30\\x1e\\x0f\\xf5\\x5e\\x42\\xca\\x85\\x9e\\x27\\x69\\x40\\xca\\xb5\\x9e\\x07\\x53\\x68\\x24\\x9f\\x8a\\x91\\x24\\xcd\\x79\\xa3\\x5b\\x7f\\x5d\\x1a\\xc9\\x6b\\x1a\\x89\\x9c\\x72\\x1c\\x09\\x2c\\x8f\\xff\\x7c\\x12\\x63\\x79\\x93\\x8f\\xa5\\xd4\\xa1\\x37\\x3b\\xdd\\x79\\x83\\x9d\\xb9\\xd6\\xc7\\x72\\xc9\\x6f\\xc5\\x58\\x94\\xf9\\x6d\\x49\\x9d\\x37\\x00\\x7a\\xa5\\xdd\\x65\\x8d\\x43\\xe1\\x54\\xcc\\xb3\\x16\\x9c\\x35\\xd0\\x05\\x1e\\x9c\\x85\\xff\\x59\\x50\\x4f\\xb1\\x3b\\x1f\\x24\\x77\\x75\\x31\\x9e\\x40\\x7f\\xa7\\xd2\\xb7\\xd2\\xdd\\x78\\x02\\xf3\\x30\\xb5\\xdf\\xc4\\x06\\x3d\\xb0\\x09\\x0c\\x04\\xfe\\xc2\\xc4\\xc0\\x5f\\xcc\\x68\\xb2\\xf7\\x7c\\xd3\\xfc\\x80\\xec\\xf4\\x2b\\x7e\\x0e\\x0f\\x40\\x0f\\xbe\\xe3\\x77\\x22\\xe5\\x57\\x7e\\x25\\x52\\xfe\\xe6\\x9d\\x22\\x86\\x46\\x11\\x65\\xc3\\x78\\x5f\\x7f\\xd7\\x78\\x55\\xff\\xd5\\x6c\\x6b\\x41\\xcf\\xde\\xd7\\xdf\\x43\\xda\\x2b\\x53\\xa3\\xef\\xdf\\x41\\xb6\\x5f\\x21\\x1b\\xde\\x94\\x9b\\xec\\x3b\\xcd\\xea\\x18\\x9b\\xa9\\xe3\\x9f\\x06\\xb6\\x53\\xff\\x40\\x4a\\x8b\\xb9\\x03\\x97\\x3b\\x01\\xea\\x1f\\x0a\\x38\\xad\\x19\\x40\\xe8\\x3b\\x68\\xef\\xef\\x46\\x07\\x16\\xf6\\xcf\\x7c\\x1e\\x19\\xe5\\x81\\xcb\\x11\\xd2\\x68\\x03\\xf6\\x03\\x7a\\x35\\xfb\\x11\\x73\\x69\\x63\\x96\\xe9\\xa3\\x35\\xcc\\xe8\\x0f\\xe3\\xb7\\x42\\x00\\x56\\x3b\\xaf\\xb1\\x9f\\x71\\xd0\\xb5\\x17\\x35\\xf8\\x5c\\x63\\xf4\\xf7\\x1b\\xeb\\x1b\\x0b\\x9e\\x6e\\xe0\\x09\\x3f\\x77\\xc4\\xe7\\x80\\x3e\\x07\\xf4\\xb9\\x86\\x38\\xe3\\x3f\\xb0\\x4c\\x7e\\x96\\xce\\xb5\\x7e\\x96\\xe1\\x9e\\x7e\\x94\\xef\\x3f\\x2a\\x4f\\x5b\\x58\\x66\\x41\\x15\\xfd\\xa8\\x2a\\xaa\\x6e\\xe7\\x47\\xbc\\x99\\xb3\\xbf\\xd4\\xaf\\x4e\\x39\\xbf\\x58\\x5c\\x5a\\xa1\\x0d\\xe5\\x3d\\xd7\\xc0\\x79\\x21\\xc0\\xf9\\x67\\x09\\x9c\\xa1\\x00\\x67\\x13\\xc1\\xf9\\x17\\x01\\x4a\\x5b\\x28\\x21\\x6b\\xfe\\x89\\x10\\xfc\\x8d\\x3e\\x10\\xec\\xca\\x0b\\x4b\\x40\\x55\\x66\\x23\\x80\\xfe\\x99\\x03\\xf4\\x4d\\x8d\\xfd\\xa6\\x3a\\xfe\\x27\\x75\\xe6\\xcf\\x9d\\x81\\xfe\\xa6\\xe0\\x10\\xd2\\xe7\\x50\\x02\\x94\\xc0\\xf9\\x9b\\x04\\xdf\\x6f\\x12\\x9c\\x7f\\xc9\\xf7\\xbf\\x74\\x70\\x02\\xe8\\xa9\\xa2\\xbf\\x54\\x45\\xd5\\xed\\xfc\\x55\\x02\\xe8\\x97\\xfb\\xf5\\xd7\\x3e\\x40\\xa1\\xd0\\x25\\xe5\\xbd\\x3d\\x0c\\x69\\x29\\x32\\xbd\\x3b\\x3a\\x52\\x1f\\xf7\\xd6\\xca\\x4b\\x6d\\x15\\xdc\\xd1\\xf3\\x95\\xc9\\x2a\\xda\\x90\\x55\\x5d\\x94\\xaa\\x2a\\x43\\xe9\\x53\\x09\\x02\\x17\\xf4\\x76\\x9d\\x73\\x8b\\xaa\\xd8\\x5f\\x35\\xac\\xff\\xef\\x08\\x26\\x1b\\x8e\\xb5\\xd2\\xb5\\x7e\\xa1\\xef\\x59\\x3b\\x87\\xb1\\x37\\xc2\\x06\\x34\\x82\\x7f\\xc5\\xb3\\x58\\x62\\x8d\\x14\\x9f\\xe0\\xb7\\xf9\\xf8\\x67\\x19\\x20\\x99\\xfb\\x11\\x5e\\xcb\\x46\\xe8\\xde\\x38\\x62\\x3e\\x1c\\x75\\xe8\\x65\\x18\\x65\\x6b\\x6e\\x84\\x4e\\xf6\\xa2\\xe2\\x2a\\xc8\\x0f\\x43\\x2f\\xfe\\x9a\\xf8\\xb9\\x5e\\xa1\\x15\\xe5\\x49\\xad\\xda\\xaf\\xab\\x60\\x57\\xad\\xca\\x8d\\xe2\\xaf\\xec\\x42\\xc6\\xcb\\xfa\\x52\\x6b\\x67\\xf6\\x35\\xc5\\x7d\\x9e\\xd2\\xe9\\x7f\\x1d\\x14\\x7a\\x57\\xfe\\x7f\\xa3\\xfd\\x1f\\x15\\xfd\\x88\\xbe\\xde\\x02\\xc0\\x29\\x4a\\x3b\\x5f\\x6f\\x05\\xe0\\x16\\xa5\\x0f\\x44\\xb0\\x56\\xd4\\xa1\\x71\\x88\\x26\\x6c\\x7c\\x73\\x90\\x0c\\x44\\xcd\\x27\\x28\\x78\\x80\\x14\\x84\\x82\\x87\\x22\\x7e\\xb7\\xbb\\x40\\x0a\\xca\\xd5\\x35\\xc9\\x8f\\xe3\\xd4\\xac\\x87\\x4c\\x8b\\xfe\\x44\\x91\\x27\\xa4\\x6e\\xf5\\x75\\xc0\\x6b\\x4e\\x96\\x46\\xb5\\x91\\xa4\\x77\\xab\\x43\\x30\\x7e\\xb3\\x04\\x62\\x46\\xf2\\x9d\\xaf\\xf7\\xdc\\xdc\\x2d\\x22\\x56\\x13\\x8f\\x4d\\x37\\x88\\x12\\x6f\\x56\\xb3\\xd7\\x11\\xc3\\x18\\x7d\\xf6\\x0d\\x7c\\xc2\\x87\\xe6\\x95\\x37\\x8f\\x62\\xaf\\x66\\xaf\\x54\\x82\\x33\\x87\\x95\\x5b\\xb3\\x37\\x11\\xbb\\x72\\x12\\x3f\\xb1\\x2f\\xe0\\x03\\x3d\\x35\\xa3\\xb5\\x17\\xd6\\xec\\xeb\\xfc\\x5d\\xd5\\xf9\\x1a\\xb2\\x92\\x1b\\x2e\\xfb\\x05\\xec\\x23\\x47\\xf0\\xc5\\xf6\\x15\\xe4\\x53\\x2f\\xb2\\xe8\\xb9\\x9e\\xa4\\x4a\\xdf\\x45\\x6c\\x15\\x85\\x51\\x1a\\x85\\x9e\\xfd\\x21\\xda\\x9a\\xa3\\xd7\\xc1\\x01\\x2f\\x54\\x69\\xeb\\xda\\xdb\\x50\\xdc\\x03\\x51\\x96\\xb7\\x65\\x25\\xff\\x90\\x0e\\x07\\xf3\\xab\\xec\\x17\\x01\\x46\\xa0\\xed\\xb6\\x81\\xa9\\x82\\x7f\\x80\\x4e\\xdf\\x52\\x02\\xbe\\x74\\x45\\xc2\\x4b\\x99\\x30\\x94\\xb9\\x86\\x53\\x1d\\xd0\\xa4\\x4b\\x56\\x96\\x86\\x88\\x55\\x03\\xe0\\x7e\\x1f\\x15\\xa2\\x42\\xa5\\x73\\x86\\xbe\\x6d\\xa4\\xb5\\x66\\x48\\xbe\\x61\\x44\\xd0\\x5a\\xf4\\x73\\x93\\x27\\x6f\\x50\\x0b\\x71\\x15\\x29\\x8d\\x70\\x0e\\x00\\xde\\x14\\x6f\\x00\\xfe\\x9c\\xb1\\xa9\\x0c\\x35\\xf6\\x8a\\x26\\x5a\\xcf\\x74\\xb0\\x93\\xaf\\x9e\\xd8\\x49\\x1d\\xc9\\x41\\x8a\\xa5\\x7d\\xb5\\x76\\x50\\x18\\x24\\x75\\xb4\\xcf\\x9d\\x83\\x43\\xd4\\xb1\\x05\\x24\\x68\\x75\\x6e\\x2c\\x1d\\x17\\xc0\\xbb\\x56\\x21\\x3c\\x87\\xf9\\xd8\\x1e\\xf3\\xb1\\x16\\x16\\x2e\\xde\\x53\\xb1\\xcb\\x7c\\x16\\x92\\x97\\x62\\xf5\\x1e\\xd1\\xfb\\x48\\x9d\\x1d\\x35\\xe0\\x7b\\xd6\\x56\\x23\\x36\\xdc\\x56\\xcc\\xe0\\xb1\\x83\\x37\\x89\\x9d\\x26\\xfc\\xb1\\x80\\xaf\\xf2\\x0c\\x17\\xf8\\x8f\\x71\\xa6\\x7f\\xa5\\x07\\x0b\\x70\\x68\\x91\\x18\\xc0\\x43\\x80\\x89\\x50\\x8f\\x7c\\xc6\\x44\\xa8\\x27\\xa0\\x7a\\xb2\\x22\\x35\\x2f\\x4f\\x5c\\xda\\xce\\x91\\xa6\\xdd\\xde\\xf1\\x92\\xc9\\x10\\xfa\\xbd\\x57\\xef\\x19\\xa3\\x98\\x4f\\xae\\xfe\\x8e\\x8c\\x24\\xda\\x14\\x95\\x93\\xe4\\x20\\xef\\x63\\xdb\\x67\\x8e\\x65\\xc3\\x41\\xd6\\xb1\\x13\\xb6\\xb6\\xec\\x89\\x5f\\xd0\\xfc\\x11\\x54\\x5e\\x50\\xfc\\x91\\x39\\x65\\xeb\\x4e\\x29\\x43\\x52\\xca\\x40\\x21\\x19\\x75\\xcd\\x32\\xcd\\xf0\\x02\\xe6\\xdc\\xe2\\xd0\\x71\\xc7\\xa2\\x28\\x2c\\x1d\\x7a\\xee\\xec\\xdc\\x9f\\x16\\xf6\\x4c\\xbb\\x27\\x72\\x0d\\x10\\xa4\\xe1\\x9d\\x7d\\x72\\x00\\x34\\xac\\x03\\xaf\\x69\\xe5\\xe5\\xa6\\x2c\\xfc\\x0b\\x9c\\xdc\\x58\\x46\\xb8\\x88\\xf0\\x31\\x38\\x64\\xc4\\x37\\x31\\x1c\\xd6\\xef\\xf0\\xb0\\x86\\x63\\x3b\\x80\\x63\\x7b\\x6f\\x91\\xff\\x57\\x67\\xcc\\x6e\\x08\\xc8\\xc7\\x8f\\xc9\\xf2\\xe9\\xf8\\x35\\x81\\x1e\\x77\\x4f\\xc6\\xaf\\x3d\\x59\\x77\\x4f\\xb7\\xaf\\x3b\\x59\\x83\\xa2\\x74\\xb0\\xd5\\xf6\\x1b\\x20\\x91\\x45\\xb4\\x23\\xfb\\xad\\xd2\\x4b\\xf5\\x77\\xb4\\x94\\x50\\x01\\x6e\\x47\\x4d\\x3a\\xc3\\x2b\\x7f\\xc3\\x6f\\x6d\\xe0\\x8c\\xdc\\xe0\\x71\\xe9\\xf2\\x89\\xcf\\xee\\xef\\x6c\\x1f\\x10\\xce\\x06\\x81\\x7d\\x8f\\x57\\xf4\\xf2\\x39\\xca\\xaf\\x50\\x5d\\x2e\\xe2\\x31\\xc0\\xca\\xa7\\x2d\\x8b\\x3c\\x57\\xed\\xff\\x4f\\xdb\\xd5\\x38\\xb5\\xad\\x2b\\xfb\\x7f\\xa5\\x78\\x2e\\x8c\\xdd\\x38\\x21\\x90\\x53\\x7a\\x6f\\xa8\\xc9\\xf4\\xd0\\x76\\xe8\\xb9\\xd0\\xf6\\x95\\x94\\x7e\\x30\\x39\\x8c\\x49\\x1c\\xe2\\xd6\\xb1\\x53\\x7f\\x00\\x29\\xe1\\x7f\\x7f\\xfb\\x5b\\x49\\xb6\\xec\\x38\\x9c\\xd0\\x79\\x6f\\xce\\x29\\xb1\\xbe\\x77\\xa5\\xd5\\x6a\\x25\\xad\\x76\\x0f\\xf1\\xb1\\x43\\x1f\\x4f\\xf0\\xb1\\xab\\x3e\\x3a\\x03\\xa9\\xf6\\x33\\xc5\\x03\\xc9\\x39\\xb4\\xe0\\x3f\\x45\\xfa\\x0b\\xf5\\xf5\\xdd\\x79\\xa6\\xd2\\xd3\\x9a\\x52\\xf4\\x7d\\xcc\\x58\\x56\\x05\\x3e\\xcd\\x91\\xfe\\x9a\\xf2\\x5e\\xfe\\x46\\x72\\x69\\x24\\x56\\x72\\xf6\\x4a\\x3e\\x13\\xae\\x3e\\x3e\\x45\\x42\\xd5\\x33\\x6f\\xbf\\xe8\\x8b\\x3a\\x98\\x1e\\xb8\\xc4\\xf3\\xcc\\xef\\x11\\x34\\xa3\\x2d\\x4d\\x67\\x1e\\xcd\\x25\\xf3\\xe9\\x65\\xb4\\x9a\\x3c\\xf2\\x39\\x6b\\xfe\\x92\\xcf\\xd8\\x4a\\x34\\x11\\x5b\\xd6\\x62\\xf1\\x3e\\xb2\\x4c\\xaf\\x1a\\x2d\\xc7\\xf1\\x08\\x08\\xbc\\xd1\\x86\\x90\\x7d\\x21\\xfd\\xd6\\x00\\xae\\xaf\\x85\\x55\\x19\\x3e\\x21\\x41\\xfd\\x2a\\x24\\x28\\x69\\xab\\xf7\\x3d\\xf1\\x9a\\x38\\x4a\\xea\\xae\\xe0\\xb4\\x53\\xb2\\xed\\x67\\x85\\x46\\x1c\\xe8\\xb7\\xd9\\x79\\x9a\\x32\\xe3\\x6b\\xd2\\xcf\\x91\\xf8\\x39\\x53\\xd1\\x47\\xbc\\x2f\\x39\\xcb\\x13\\x39\\xf2\\x8c\\x23\\xf3\\x24\\x95\\xb1\\xa9\\x27\\x89\\xe2\\xb4\\xa8\\xd8\\x34\\xfe\\x24\\x32\\xd5\\x3c\\x12\\x2a\\x01\\x65\\xee\\x3e\\x3d\\x0e\\xd8\\x0f\\x51\\x4a\\x1f\\xfb\\xfa\\x6e\\x0a\\xf5\\x1e\\x1b\\x0d\\x8f\\x80\\xe4\\xad\\x25\\xef\\x94\\x28\\x9a\\x23\\xd0\\x02\\x6b\\x0b\\xd4\\xbc\\xeb\\xd2\\x1b\\xa8\\xe0\\x5c\\x60\\x7c\\xcc\\xf5\\xc9\\xc0\\x13\\x15\\x90\\x4d\\xe4\\x01\\x34\\x63\\x28\\xe7\\x0a\\xcd\\x51\\x74\\x13\\xd6\\xbc\\x1c\\x2c\\x21\\xf4\\x33\\x10\\xc8\\xfc\\x0c\\xb4\\x96\\x01\\xbd\\xa7\\xb7\\xe9\\xe9\\xed\\x20\\x54\\x6e\\x28\\x9b\\xfd\\x76\\x33\\x4d\\xbd\\x9d\\x52\\x33\\xa2\\x15\\xf1\\xb2\\xa9\\x98\\x31\\x7d\\xa2\\xe3\\xc4\\xa1\\x49\\x41\\x62\\x6b\\x62\\xca\\x43\\xbd\\x40\\x6b\\xab\\x63\\xd9\\xc7\\x32\\x0c\\x17\\x9b\\x9d\\x36\\x7c\\xec\\xee\\x5f\\x48\\xdb\\xc1\\xfe\\xd2\\xc4\\x2d\\x79\\xa0\\x73\\xfa\\xc1\\x62\\xd1\\x68\\x7c\\x0a\\x68\\x3b\\xfb\\x25\\x82\\x67\\x1c\\xb6\\xb7\\x13\\x39\\x1f\\x29\\xfe\\x0e\\x96\\xa7\\xba\\xaf\\xdc\\xd4\\x6b\\x85\\xb8\\xf6\\xb3\\x61\\xdb\\xb9\\x7b\\x9a\\x41\\xe4\\x72\\xe7\\x30\\xbb\\x9b\\x09\\x4d\\xc7\\xee\\xee\\xb3\\xf6\\xbd\\xb0\\xe8\\x34\\xd4\\xdd\\xd7\\xb1\\x51\\xa7\\xe1\\xbe\\x75\\xe7\\x4b\\x03\\xb3\\x54\\xb7\\x50\\x8a\\x93\\x26\\x15\\xe1\\xa3\\xce\\x85\\xaa\\x09\\x95\\x1c\\xe7\\x4f\\xaa\\xa8\\x58\\xf2\\x62\\xcc\\xfa\\x50\\xc1\\x79\\x32\\xb0\\xb6\\xb6\\xfe\\x15\\x99\\x1e\\xbb\\x93\\x60\\x4b\\x77\\xa9\\x7a\\x65\\xa9\\x74\\x91\\xbf\\x46\\xec\\xe8\\x1a\\xe6\\x10\\x2e\\xa4\\xf1\\xdf\\x38\\x9b\\xd5\\x5a\\x98\\x17\\x8e\\xd3\\xb0\\x2d\\x50\\xb6\\xdc\\x5f\\x05\\xdd\\xb7\\x91\\xc9\\xc8\\x5b\\x72\\x13\\xd4\\x0f\\xec\\x8f\\x81\\xfd\\x2a\\x70\\x44\\x02\\x91\\xff\\x07\\x7e\\x1b\\xfa\\x09\\x9a\\xb4\\x1f\\x84\\x04\\xe5\\x5c\\x08\\x61\\x8b\\x92\\x5a\\xde\\x74\\x96\\xce\\x11\\xc1\\x1f\\x88\\x81\\x0a\\x26\\x22\\xf0\\x8b\\x30\\xf3\\x94\\x0b\\x61\\x84\\x2e\\x37\\x13\\x5d\\x1d\\x1b\\x5d\\x4a\\x82\\x70\\x54\\x64\\xea\\xf5\\x83\\x9e\\x1e\\x66\\x07\\xe7\\x5d\\xd0\\x09\\x09\\xbf\\x92\\x9f\\xea\\xc9\\xd2\\xc9\\x48\\x11\\xa3\\xf9\\x87\\xfb\\xc0\\x20\\x8b\\x82\\xce\\xaa\\x17\\x82\\xdc\\x4d\\xfe\\x08\\x2f\\x1a\\xf0\\x15\\xba\\x53\\x2f\\x99\\xb9\\x43\\x8f\\xdf\\x8a\\xee\\x87\\xce\\x3b\\x28\\x0a\\xa8\\x81\\x7c\\x60\\xe0\\xa3\\xdf\\x1b\\xf8\\x58\\x0d\\xbc\\x99\\xeb\\xfa\\xc4\\xd0\\xf8\\xbf\\x80\\x7d\\x84\\x8b\\x0b\\x22\\x05\\xd7\\xb2\\x7a\\xa6\\xa1\\x22\\x0c\\x5f\\xd8\\x64\\xf1\\xf2\\x2c\\x4e\\x91\\xdb\\xb2\\x25\\xf9\\x30\\x8d\\x9c\\xfb\\x03\\xe8\\x9d\\x16\\x44\\x44\\x5c\\x5f\\x3e\\x95\\x83\\x6a\\xaf\\x46\\x52\\x70\\xac\\x93\\xc1\\xf0\\xb5\\xea\\xad\\x97\\x15\\x77\\xac\\x95\\x47\\xaa\\x79\\xa7\\xb9\\xd5\\x4e\\x1b\\x8a\\x4e\\x3b\\xd4\\x3b\\x0d\\x06\\x52\\xa4\\x57\\xc7\\x02\\xfb\\xe0\\x45\\x52\\xbc\\x27\\x19\\x4b\\x97\\x8f\\x03\\xb6\\x7a\\xac\\xbd\\x33\\x64\\xa3\\xc1\\x57\\x6c\\x96\\x28\\x76\\xc6\\xe7\\x93\\x01\\x4d\\x30\\x27\\x86\\xb1\\xb4\\x68\\x60\\xd7\\x77\\xd8\\x84\\x76\\x28\\xf6\\xb0\\x6e\\x30\\x66\\xa8\\xfb\\x3a\\xb7\\x9e\\x82\\x47\\xfb\\x2f\\xae\\x69\\x08\\x32\\xc7\\x3b\\x9f\\xc9\\xb9\\x97\\xd9\\x33\\x1b\\xfe\\xe6\\xfd\\xbc\\xdb\\x32\\xbd\\xa3\\x86\\x48\\x14\\x1d\\x25\\xfc\\x39\\xad\\x24\\x2b\\xea\\x86\\x42\\x27\\x6a\\x23\\x57\\x88\\x62\\xad\\x9c\\xf7\\x98\\x80\\x39\\x58\\xc2\\xb5\\xa7\\xde\\x3b\\xd1\\x81\\xbf\\xef\\x37\\x1a\\xd6\\x5d\\x56\\x87\\x86\\xf0\\x49\\xca\\x8f\\x25\\xf9\\x21\\x73\\x8e\\x0f\\xec\\xdc\\xb9\\x54\\x0c\\x0e\\xea\\xa8\\x8b\\xd8\\x51\\xe5\\x72\\xff\\xb8\\x36\\xde\\x42\\xa4\\xf9\\xe3\\xe5\\x02\\xb9\\xcc\\xae\\x0c\\xa6\\x1c\\x65\\x81\\x6f\\x7a\\xe3\\x79\\xd5\\x29\\x5c\\x80\\x03\\x62\\x88\\x2b\\xc4\\xb0\\xbf\\x42\\x9a\\x78\\xb1\\x2b\\x1c\\x3c\\x82\\x63\\x98\\x96\\x78\\x29\\x2c\\xaa\\x67\\x71\\x88\\x44\\x8c\\xaf\\x52\\xea\\x91\\x6f\\x05\\x75\\x09\\x25\\x2d\\xe5\\x17\\x0e\\x02\\xc1\\x04\\x8a\\x45\\x8a\\xc4\\xef\\xac\\x94\\x29\\xf1\\xc4\\x01\\xe9\\xbd\\x40\\xc4\\x4d\\xd3\\xb8\\x82\\x87\\xb6\\x81\\xa3\\x16\\xd8\\x5e\\x3b\\x57\\x5c\\x18\\x9b\\x77\\x4b\\xaf\\x6b\\xea\\x33\\xbd\\x3b\\x85\\x73\\x60\\xee\\x39\\xb7\\x15\\x44\\xd4\\xf5\\x56\\x69\\xc7\\x56\\xb0\\x3c\\xc9\\x8f\\xbd\\xae\\x19\\x36\\x1c\\xc3\\xa8\\xea\\x68\\xa5\\xca\\xef\\xec\\x95\\x6e\\xef\\xde\\x2d\\xde\\x35\\xc1\\x58\\x30\\xab\\x7a\\x61\\xb6\\x87\\x56\\xe9\\xb5\\x83\\x30\\x22\\x5f\\x2a\\x68\\xa7\\xec\\xb5\\x00\\xff\\x95\\x5f\\xb2\\x54\\xe0\\x89\\x1f\\x03\\x4f\\x0d\\xb6\\xbf\\x07\\xdf\\x72\\x45\\x1a\\xbc\\x78\\xf0\\xb9\\x44\\x3e\\xf2\\x8d\\xf6\\x13\\x62\\x85\\xa1\\x25\\xdc\\xdc\\x52\\x65\\x50\\x62\\x84\\xdd\\x99\\x7d\\x6d\\xfd\\x93\\x0f\\x72\\x34\\x57\\x01\\xc0\\xf3\\x28\\xeb\\x4e\\x33\\xa1\\x22\\x1a\\x26\\xb8\\xb8\\x0f\\xfc\\xf1\\x5c\\xd3\\x07\\xfb\\x16\\x09\\xfa\\x33\\x50\\x6d\\x8b\\xf6\\xe3\\xb4\\xd7\\x96\\xa0\\xf5\\xfc\\x6e\\x56\\x90\\x51\\xbf\\x66\\x4e\\x94\\x0e\\x03\\x3c\\x4d\\x03\\x5c\\x13\\xe6\\xe5\\xd4\\x2a\\x0d\\x6f\\xa6\\xe9\\x3b\\x6f\\x6d\\x3d\\x3c\\xa2\\xc4\\xdc\\x85\\x1f\\x8a\\xd2\\x59\\xc2\\xfa\\x8d\\x51\\x97\\x67\\xb2\\xcb\\x33\\x39\\x76\\x6b\\x37\\xbe\\x5c\\x56\\x01\\x23\\x0f\\x6a\\x56\\x74\\xaa\\x70\\x90\\x80\\x0e\\x33\\x8b\\x7e\\x95\\x35\\x10\\xe5\\x79\\x72\\xf9\\x49\\xe7\\x41\\xc9\\x49\\x98\\x70\\x47\\x57\\xcc\\x22\\x05\\x11\\xf2\\xc9\\x09\\xf8\\x21\\x8e\\x66\\x5e\\x9c\\xa2\\x31\\x9d\\xbe\\xbd\\x0a\\x7d\\x7b\\xbd\\xac\\x6b\\x7a\\x75\\xf4\\xcd\\xcf\\x19\\x85\\xf7\\x61\\x74\\xd3\\x61\\x34\\x9d\\x11\\xa2\\xa3\\x53\\xb4\\x51\\x70\\x22\\x4e\\x53\\x6d\\x9d\\x89\\x27\\x32\\x39\\x76\\xfe\\x06\\x3b\\x61\\xa1\\xb5\\x64\\x0a\\x65\\x4e\\xcf\\x2a\\x19\\x41\\xd3\\x40\\x4e\\x8a\\x3a\\x70\\x54\\xc0\\x86\\xe6\\x04\\xa9\\x0b\\x52\\x5d\\x52\\xee\\xa4\\x19\\xd0\\x39\\x88\\xf8\\x5d\\x9e\\x72\\x28\\x53\\x2c\\x27\\xd6\\xdd\\xee\\x41\\xc4\\xb2\\x83\\x61\\x88\\x15\\x22\\xd6\\x66\\x05\\xb7\\x48\\xdc\\x9f\\xbd\\xe4\\x79\\xe5\\x89\\x11\\x53\\x89\\xfb\\x2a\\xbd\\x0b\\x10\\x31\\x30\\x1e\\x3b\\xee\\x51\\x03\\xb2\\x44\\xe7\\xd5\\x51\\xc9\\xea\\x1f\\x82\\x43\\x58\\xf8\\xcd\\x8e\\xcd\\xa1\\x8d\\x34\\x7a\\x7c\\xa8\\x2b\\x23\\xd9\\x95\\xf7\\xab\\x56\\x9d\\x0e\\x4c\\x7a\\xa2\\x9f\\x6c\\x9d\\x14\\x0b\\x94\\xe5\\xbc\\x4e\\xbd\\xdb\\x5a\\x71\\x3a\\xef\\x24\\x64\\xc0\\xcd\\xdd\\x99\\x14\\x04\\x04\\x11\\xd6\\x1c\\x3e\\xd4\\x2e\\x86\\x85\\x54\\x0e\\x5b\\xe2\\x9a\\xdc\\xba\\xcc\\x75\\xd9\\x17\\xee\\x79\\x38\\x68\\x0d\\xa3\\x2c\\x4c\\x5f\\xec\\x32\\x47\\xe5\\xf2\\xe2\\x0d\\xe6\\x3b\\x5a\\x3f\\x79\\x29\\x17\\x10\\x1c\\xe2\\x89\\x89\\xe8\\x6c\\xb9\\xd2\\xad\\x70\\x50\\xa3\\xd6\\x6b\\x6f\\xdd\\xf5\\x7a\\xa7\\xb4\\x5e\\x7b\\x03\\xe2\\xb2\\x5c\\x77\\xd7\\x5c\\x29\\xe2\\x48\\xf7\\x38\\x75\\xda\\xbc\\x96\\x2d\\x97\\xf7\\x1c\\x32\\x9c\\x88\\x68\\xd5\\xc2\\x1a\\xb0\\x40\\x80\\x77\\x5f\\xff\\x5f\\x18\\x88\\xad\\x9d\\x84\\xa5\\xd6\\x9a\\x73\\x01\\xa0\\xcd\\x04\\x1e\\xeb\\x25\\x9d\\x46\\x9d\\x74\\x85\\x7c\\xf7\\x5d\\x61\\x04\\xb9\\x0e\\x3f\\x51\\xb4\\x40\\x30\\xab\\x3e\\xa0\\xfb\\x3f\\xc6\\x51\\x6d\\x5b\\x7f\\x0b\\x4d\\x05\\x5c\\xae\\xf2\\x85\\x7b\\x8c\\x7a\\x9c\\x05\\xd2\\x7a\\x46\\xab\\x1e\\x7f\\x55\\x67\\xde\\x05\\x98\\x0b\\x8f\\x13\\x2b\\x57\\xc8\\x04\\x62\\xf9\\xa1\\xdd\\xac\\x4f\\x5b\\xfd\\xfd\\x34\\x9e\\xdf\\xf5\\x03\\xc7\\x5b\\x22\\xb6\\x54\\x20\\xf9\\x91\\xb6\\x66\\x42\\x4a\\x54\\x38\\xe1\\x81\\x45\\x79\\x1c\\x69\\x39\\xc1\\xd5\\x5b\\x30\\x47\\xee\\xcc\\xa6\\xea\\x7c\\xa9\\xf7\\x53\\xad\\x34\\x3f\\xf2\\x95\\x92\\xe7\\xbe\\xe9\\x0b\\x4f\\x07\\x8b\\x85\\xfa\\xaa\\xf7\\x68\\xc0\\xfe\\x04\\x8c\\x7c\\x1f\\x6f\\xd0\\xc6\\xbc\\x25\\xbb\\xe1\\xbe\\xcc\\xb0\\x99\\x37\\xd5\\xec\\xa5\\x4b\\x9e\\xe1\\x97\\xf6\\xb4\\x7c\\xe0\\x11\\x55\\x77\\x69\\x30\\x7c\\x23\\xed\\x40\\xe9\\xfb\\x8e\\xe0\\x60\\xb8\\x3f\\xc4\\xbe\\x43\\x9a\\x80\\x0d\\x4b\\xfb\\x8e\\x34\\x77\\xb4\\x9f\\x50\\xc9\\x71\\xe1\\x77\\x7e\\x7c\\x90\\xec\\x27\\xd8\\x77\\xd0\\x98\\xc9\\xbd\\x2c\\x76\\x20\\x11\\x76\\x9f\\x6a\\x43\\x8a\\x1d\\xa6\\x38\\x64\\x89\\xd9\\xca\\xb7\\x38\\x60\\x89\\x79\\xbe\\xcb\\x43\\x96\\x58\\x4c\\x8e\\x46\\x9c\\x13\\x49\\x71\\xea\\x52\\xc4\\xdd\\x17\\x5e\\xf9\\x4b\\xa7\\x22\\x62\\xd3\\x56\\x5c\\xf8\\xdd\\xfa\\xc9\\xaa\\x13\\x58\\xbc\\x9f\\xf5\\x4a\\xd7\\xa5\\xb9\\x2b\\x22\\x27\\x3f\\x68\\x30\\x95\\xa9\\x1c\\xe1\\xf3\\xf9\\x02\\xc6\\xdc\\xd3\\x8b\\x8b\\xc5\\x02\\x9e\\x6a\\xcb\\x71\\x58\\xf2\\xa2\\x19\\x5e\\x17\\x4d\\xa4\\xe2\\xd6\\xb0\\x37\\x66\\x1b\\xe6\\x89\\xfa\\x95\\x7c\\x70\\xcc\\x66\\xf1\\x95\\x2a\\xbd\\xd5\\x1d\\xd2\\x56\\x37\\xdf\\xe4\\x70\\xce\\x37\\xac\\x3e\\x5f\\x0a\\xe8\\x65\\xe7\\xdd\\x14\\x26\\xbe\\x8b\\x5d\\xba\\x69\\x70\\x4e\\xc3\\x6a\\x81\\x70\\xcd\\x09\\x8c\\xda\\x5d\\x3b\\xb3\\x96\\x07\\x8a\\x32\\x61\\xe8\\x1b\\x1e\\xf2\\x4d\\xe3\\x8a\\xa8\\x4c\\xb6\\x4b\\x79\\x59\\x5c\\x36\\x86\\x81\\x9b\\x24\\xca\\xab\\x86\\x25\\xa5\\x05\\x23\\x22\\x0a\\xf1\\xd3\\xb9\\x61\\x1f\\xba\\x96\\xf0\\xc4\\xa4\\x9d\\xb6\\x50\\xc5\\xb7\\x7e\\x6a\\x5a\\xb5\\xb9\\xd5\\x6e\\x0c\\x86\\xf2\\xaa\\xc5\\xd8\\xa0\\x5c\\x5d\\xb9\\x1d\\xe8\\x0b\\xe6\\x7c\\x23\\xb3\\xdb\\x56\\x23\\xb2\\x6f\\x9d\\x4f\\xbe\\x39\\x66\\x95\\xc5\\x12\\xaa\\x39\\x02\\x8c\\x2c\\x14\\x7b\\xec\\x0b\\xc7\\xbc\\xcc\\xb1\\xa5\\x9e\\x82\\xaf\\x0e\\x83\\x26\\xd9\\x64\\x09\\x4d\\x55\\xb8\\x7c\\x5c\\x64\\x5e\\x92\\xa8\\x71\\x9d\\x97\\xc4\\x6d\\xb6\\x01\\xc3\\x95\\x2a\\x82\\x57\\x7b\\x71\\x16\\x29\\x95\\x45\\xed\\x97\\xce\\xb5\\x22\\x12\\x95\\xff\\x9d\\x33\\xad\\x46\\x1d\\xd2\\x28\\xa8\\x28\\x51\\x09\\x8b\\x16\\xe6\\x95\\x65\\xff\\xd2\\x2a\\x10\\x49\\xf6\\x4f\\xad\\x02\\x19\\x75\\x4c\\xdb\\x96\\x68\\xc6\\xcf\\xa6\\x16\\x0b\\x23\\xf0\\xc6\\xa9\\x78\\x42\\x05\\x1b\\x9f\\xe0\\x81\\xc6\\x65\\x94\\xa6\\xd1\\x54\\x65\\x50\\x79\\xf1\\xc4\\xea\\xcf\\xc8\\xbe\\x71\\x60\\x07\\xfd\\x87\\x03\\x93\\xe7\\xa7\\xf4\\xbd\\x6b\\xd8\\xaf\\x29\\x40\\x3f\\x87\\xb2\\x5f\\x46\\x94\\xd2\\x3e\\x38\\xee\\x19\\x6d\\x6f\\x6a\\x74\\x8d\\xd6\\xf3\\x1d\\xfa\\xcd\\x07\\x08\\x40\\x34\\xdd\\x10\\x97\\xcb\\xd4\\x77\\x53\\x7f\\x34\\x0a\\x80\\xd5\\x85\\x2a\\x6c\\xf0\\xcd\\xd3\\x2d\\xdf\\x3c\\xd9\\x46\\xe3\\xf8\\xa9\\xdf\\x30\\xce\\xda\\x47\\x88\\xc2\\x1d\\xd4\\x19\\x47\\xf1\\x4b\\x7a\\xe7\\x33\\x43\\x33\\x67\\x68\\x6e\\x19\\x9a\\xb9\\x80\\xe6\\xb6\\x02\\x8d\\xd1\\xea\\xec\\xae\\x84\\x81\\x41\\x05\\xbb\\x54\\xce\\x03\\x96\\x80\\x61\\x18\\x6c\\x05\\xd4\\x51\\xfb\\x4c\\x01\\x73\\x24\\x81\\xb1\\x5f\\x8a\\x02\\xaf\\xed\\xe3\\xa7\\x19\\x0d\\x83\\x08\\xfd\\xa0\\xd0\\x09\\x14\\xab\\x38\\x74\\x4a\\x14\\x58\\xca\\xf5\\x53\\x84\\x6e\\xf2\\x78\\x99\\x7f\\x2c\\xde\\x31\\xfc\\xe9\\x86\\x23\\xc1\\x3e\\xfa\\xce\\xd8\\xfe\\xe8\\xf4\\x8b\\x68\\x13\\x27\\xfe\\xc4\\x85\\xea\\xa4\\xc9\\x3e\\x7d\\x37\\x3e\\xca\\xd5\\x24\\x29\\xca\\xf4\\x28\\x7f\\x77\\xa4\\x2e\\xae\\x61\\x3b\\x80\\x88\\x33\\xb7\\x41\\x39\\x86\\x03\\xb3\\x3c\\x6d\\xac\\x76\\x0d\\xd2\\x6e\\x50\\xe5\\xc9\\x4b\\xec\\x7c\\xc7\\x59\\xf7\\x1e\\xad\\x02\\x7b\\xb4\\x04\\x74\\xc0\\xf5\\x77\\xd8\\x22\\x53\\xc5\\xc6\\x04\\xbf\\x41\\x5a\\xf3\\x16\\xa8\\x78\\xc1\\x1f\\xc5\\x7e\\xc9\\xb5\\xe9\\x3f\\x5c\\xde\\x61\\x5b\\xf2\\x26\\xe8\\xa5\\x0d\\xc3\\xe8\\x7e\\x0f\\x72\\xb5\\x2d\\xe6\\x8e\\x35\\xea\\x1b\\x75\\x97\\xd0\\x85\\x6b\\x43\\x75\\x11\\x8d\\xd2\\x67\\x15\\x13\\x97\\x0f\\x5f\\x08\\xa7\\xf9\\x65\\x70\\xc1\\x60\\x1f\\x6f\\x1e\\x13\\x65\\x97\\xcc\\x0e\\x3c\\xfc\\x38\\xcf\\x83\\xc2\\x59\\x23\\xc5\\x92\\x9c\\x67\\x61\\xb3\\x78\\xb9\\xfe\\x19\\xab\\x97\\xf4\\xeb\\x6a\\x7e\\x40\\x85\\xad\\x51\\xd8\\x73\\x62\\xfd\\x93\\xc7\\x95\\xf7\\x65\\x79\\x5f\\x21\\xf5\\xe1\\x31\\xa6\\x9b\\x22\\x59\\x3a\\xca\\xbb\\x24\\xbb\\x1c\\xf9\\xd7\\xfe\\xa8\\xd6\\xd6\\x7f\\xa5\\xf8\\xd6\\x56\\x98\\xdf\\x23\\x7e\\x0f\\x1c\\xc5\\xcc\\xec\\x37\\x81\\x73\\x47\\xac\\x0c\\xaf\\xd5\\xe0\\xf7\\x01\\x9e\\x0f\\x39\\x85\\x3e\\xc0\\x02\\xd5\\xeb\\x35\\x5a\\xe2\\x2f\\x63\\x12\\x02\\x56\\xac\\xf1\\xac\\xfd\\x54\\xb7\\xc6\\xa7\\xd5\\x15\\x5e\\xf1\\x1a\\xf6\\x78\\xe5\\xc5\\x4d\\x96\\xd5\\xb0\\x5c\\xd0\\x2c\\x2b\\x38\\x51\\xf3\\xc6\\xbb\\xfc\\xe1\\xa7\\xcd\\xd4\\x9d\\x35\\x27\\x04\\x57\\x00\\xd8\\x9a\\xc3\\x28\\x60\\xee\\x18\\x5f\\x5d\\xba\\x66\\xdb\\xe6\\xff\\x2c\\x43\\xb3\\xf8\\x8f\\x5b\\x3a\\x01\\x27\\x9e\\x7a\\x72\\x7c\\x1a\\x65\\xc3\\x89\\x70\\x41\\x90\\x27\\xb0\\x9f\\x2f\\x7d\\x9d\\x83\\x47\\xd3\\x2b\\x7e\\xdf\\xaa\\xaf\\x75\\xfb\\xd1\\xd2\\x42\\x17\\xc3\\xff\\x6b\\x75\\xa1\\x2b\\x95\\x96\\x08\\xc0\\x29\\xd2\\xa5\\x1f\\xf0\\x92\\x6b\\x4c\\x88\\x9b\\x7b\\x61\\x91\\x38\\xcc\\xe2\\x84\\x11\\xe1\\xbb\\xdb\\x89\\xeb\\xc7\\x58\\x25\\x4b\\x10\\x09\\x47\\xc6\\x3a\\x34\\xeb\\xc1\\x92\\x97\\xab\\x36\\x05\\x49\\x41\\xae\\xab\\x6e\\x05\\xfb\\xd8\\xc3\\xdd\\x91\\x6a\\xeb\\x1a\\x3e\\xa3\\x5d\\x29\\x77\\x14\\x22\\x86\\xbb\\xd4\\xfe\\x55\\xb5\\xf1\\x65\\xb6\\x6b\\x88\\xaa\\x9f\\x40\\xc5\\x75\\x09\\xa4\\x1a\\x2e\\x7d\\xc4\\xa6\\xae\\x57\\xa0\\x78\\x5b\\x57\\x64\\xfb\\xdc\\xbb\\x19\\x14\\xfa\\x75\\xbd\\x66\\x47\\x18\\x18\\x51\\x85\\xe6\\xb5\\x85\\xfe\\x3e\\x0f\\x93\\xc1\\xea\\x42\\x37\\xfe\\x88\\xe4\\x19\\x7b\\x4f\\x85\\x27\\xec\\x12\\x85\\x23\\x1e\\x1a\\x5e\\x76\\xa9\\xc1\\xc9\\xd8\\x77\\x90\\x68\\x6d\\x40\\x07\\x06\\xf7\\x76\\xa6\\xd5\\x33\\xc2\\x88\\xc4\\x14\\x6e\\x47\\x8c\\xc2\\x10\\x72\\xad\\x5b\\xbe\\x79\\x83\\x05\\xb5\\x52\\x54\\x64\\xed\\x07\\xec\\xfe\\x81\\xe4\\xb3\\x00\\xe6\\xd4\\xf2\\xae\\x18\\x32\\x4d\\x94\\xe0\\x85\\x36\\x4a\\x93\\xe3\\xed\\x98\\xa4\\x39\\x12\\xa6\\x55\\xd1\\xa4\\x28\\x3a\\x2f\\x17\\x55\\xa8\\x69\\x65\\x33\\x2e\\xeb\\x99\\xe3\\xd2\\xf9\\xb5\\x27\\xe4\\xf8\\x5a\\xba\\x11\\x55\\x69\\xee\\x61\\x6b\\x28\\x41\\xf7\\xdd\\x3a\\x3e\\x6f\\x6c\\x7b\\xc5\\xa0\\x09\\x89\\x66\\x42\\x91\\x7f\\x27\\x7a\\xa4\\x65\\xdc\\x2f\\xdb\\xd8\\x52\\x42\\x5b\\x31\\x43\\x0a\\xea\\x60\\xf0\\xc3\\x9a\\x79\\x64\\xb7\\xc2\\x03\\xd0\\x92\\xdd\\x4a\\x0e\\x4a\\x34\\x25\\x7b\\x6e\\x0c\\xec\\xc7\\x65\\x9b\\x5e\\xd9\\xc3\\xed\\x51\\x3f\\x4e\\x1e\\x68\\xcf\\x93\\xed\\xdd\\x94\\xdb\\x53\\xdd\\x3d\\x41\\x83\\x93\\x72\\x83\\xbe\\xce\\x52\\x11\\xe8\\xec\\x3a\\x85\\x07\\xbf\\x1f\\xde\\xfc\\x30\\x1a\\xe1\\xc8\\xf3\\x90\\xf6\\xb8\\x27\\xe2\\xf9\\xfc\\x4f\\x18\\x91\\x75\\x00\\x3d\\x7d\\x52\\x8d\\x0e\\xea\\x25\\x49\\x78\\xd7\\xb2\\x4f\\xf1\\x40\\x3b\\xaf\\xee\\x7a\\x65\\x75\\x14\\x79\\x48\\x95\\xa2\\xa6\\x46\\x51\\x53\\x43\\xd5\\xd4\\xae\\x54\\x34\\xd2\\x75\\x7d\\x98\\xe7\\xc2\\xb9\\x7e\\x0a\\x3b\\x45\\x30\\xc7\\x17\\x72\\x35\\xb7\\xca\\x77\\x3d\\x3e\\xf1\\xdc\\x00\\x20\\xe7\\x4d\\xbb\\x41\\xfa\\x5f\\x6f\\xde\\x33\\x4f\\x18\\x8f\\x73\\x13\\xfd\\xde\\x18\\xb3\\xb5\\xda\\x5d\\xdb\\x44\\xa7\\x34\\x26\\x22\\x44\\x25\\x01\\x17\\x81\\xd5\\xe0\\x9a\\x5f\\x9c\\xa0\\xc7\\x04\\x84\\x04\\x20\\x22\\x77\\x10\\x49\\x99\\x07\\x56\\x57\\xf4\\x09\\x09\\x9d\\x5b\\x5b\\x53\\x58\\xf8\\xa6\\xb5\\x01\\x3b\\x63\\xf3\\x07\\xc3\\xd7\\x26\\x89\\x53\\x24\\xc0\\x53\\x33\\x9b\\x65\\xc9\\x13\\xd8\\x2d\\x09\\x82\\x37\\xca\\x5d\\x96\\x5c\\x2a\\x60\\x5f\\xa0\\x7b\\xd8\\x13\\xcc\\xb3\\x2b\\xb9\\x99\\x71\\xaf\\x77\\xc8\\x54\\x29\\x15\\x4a\\xeb\\x6d\\x24\\x70\\x7c\\x62\\xeb\\x56\\x43\\xc7\\x17\\x16\\xb2\\x7c\\x61\\x88\\xf3\\x27\\x8e\\x3e\\xae\\x1d\\xaf\\x37\\xe9\\x8e\\x69\\x9f\\x77\\x8d\\xf1\\xba\\xd6\\xcc\\x74\\x60\\x14\\x86\\x4d\\x98\\x0b\\x69\\x3a\\xa3\\x46\\x02\\x79\\xd2\\xf4\\x7a\\xb3\\xee\\x95\\x55\\xd8\\x60\\x19\\xda\\x85\\x49\\x1d\\x5b\\xf8\\x01\\xee\\xe2\\xc7\\x3e\\xec\\x65\\x8e\\x19\\x37\\x9c\\xc4\\x6a\\x8c\\xba\\xe6\\x09\\x5b\\x27\\xa9\\x2f\\xb5\\xfb\\x14\\x0e\\x10\\x9b\\x31\\x9e\\xb6\\xc5\\x07\\x09\\x64\\x1a\\xa8\\xa8\\xc1\\x4b\\x02\\xfd\\xb1\\x01\\xd1\\x06\\xf6\\x37\\x80\\x6f\\xc3\\xc9\\x48\\x06\\xed\\xb9\\xc2\\x19\\xbd\\x34\\xd9\\x80\\x1c\\x54\\x04\\xe9\\x4e\\x06\\x13\\x3d\\x5d\\xf6\\xc9\\xa3\\x59\\x82\\x21\\x76\\x77\\x47\\x74\\x62\\xff\\xf8\\xa7\\xb5\\xbe\\x8e\\x97\\xac\\xc7\\x41\\xed\\x42\\xaa\\x20\\x49\\x86\\xf6\\x32\\x4b\\xab\\x8b\\xc8\\x76\\x5c\\xc8\\x06\\x18\\x43\\x25\\x02\\x88\\x53\\xf0\\x3c\\x29\\x9b\\x2d\\x27\\xb0\\xdc\\x50\\x5f\\x86\\x93\\x70\\x98\\xbc\\x94\\x42\\xb3\\x4a\\x17\\x41\\x4a\\x09\\x95\\x46\\xec\\x5f\\x66\\x95\\xde\\xb0\\xd9\\x92\\x3b\\x0c\\x7e\\xfe\\xc7\\xc7\\x1e\\xb4\\xe1\\xd6\\x24\\x28\\x35\\x87\\x94\\x77\\xb4\\x1b\\x67\\xd8\\x8a\\xc6\\xe6\\xa5\\xfe\\xe4\\xf1\\x87\\x56\\x80\\xe6\\xe6\\x6b\\xe7\\x02\\x0b\\x7b\\x36\\xa5\\xf6\\x5e\\x3a\\x1b\\xdb\\x7f\\x9b\\xe1\\x22\\xb1\\x14\\xf7\\x7d\\x4d\\x53\\x21\\xa0\\xed\\x34\\xe2\\xbd\\xc5\\x4d\\x29\\x3e\\xa1\\xf9\\x7f\\xd1\\xe2\\xc5\\xdd\\xa3\\xc5\\x58\\x31\\x40\\xda\\x4e\\x7f\\x46\\xc5\\x3f\\x4b\\x2c\\xe0\\x58\\x07\\x13\\x9b\\xfc\\xba\\x0e\\xf1\\x6b\\x7a\\xe3\\x9a\\x1f\\x59\\xe5\\x98\\x0d\\x27\\xd8\\x9a\\x8d\\xfa\\xdc\\xc7\\x49\\xef\\xb8\\x7e\\x30\\x46\\xf5\\x23\\x31\\xb7\\xba\\x2b\\x46\\x7c\\x54\\x3b\\xdc\\x73\\x10\\x69\\x7e\\x18\\x68\\x96\\x48\\xf2\\xa9\\x61\\xe9\\x49\\xf6\\xa1\\x25\\x79\\x11\\xb1\\x5c\\x7c\\x29\\x2e\\xc4\\xc1\\x9d\\x81\\xb0\\x40\\x8d\\x77\\x8f\\x6a\\x77\\xda\\xd8\\xbe\\x29\\x7a\\x93\\x76\\xaa\\xb4\\xbc\\x85\\x79\\x78\\xff\\xd6\\x39\\x27\\x9e\\xd7\\xec\\xcb\\xca\\x88\\xe3\\x35\\x3f\\x8a\\x9a\\x06\\x8a\\xe9\\xf5\\xf3\\x36\\x3e\\x0e\\xc4\\xc6\\xb5\\xc2\\x43\\x69\\x9a\\x9f\\x38\\x3f\\x95\\x05\\x2b\\x6b\\x7f\\xf5\\x84\\xe3\\xa9\\xb3\\xee\\x8c\\x5b\\x6f\\x82\\x5d\\x54\\x22\\xac\\x2a\\x39\\x8b\\x53\\x03\\x58\\x92\\x97\\x3e\\x67\\x85\\x7d\\xec\\xd7\\xc4\\x30\\xf5\\x0c\\xb6\\x62\\xb6\\xc5\\x24\\xb0\\xa4\\x5d\\xc6\\xc2\\x50\\xd0\\x79\\xdb\\x66\\xfb\\xb2\\xe2\\xf7\\x0a\\x56\\x9b\\x66\\xf8\\x73\\xed\\xbc\\x0f\\x34\\x1e\\x1a\\xca\\xa3\\x5f\\x5d\\xfe\\x58\\x71\\xf6\\x28\\x26\\x4e\\xf5\\xb9\\x70\\xea\\xdc\\xdd\\x12\\x7b\\x9e\\x77\\x27\\x30\\x6f\\x6a\\x7f\\xc7\\xb6\\xd7\\x5b\\x3a\\x92\\x14\\x37\\x45\\xda\\x81\\x64\\x6a\\xf7\\x69\\xab\\x5d\\xd9\\xe8\\x68\\x62\\x9c\\x25\\x6f\\xa0\\x4a\\xfb\\x10\\x0d\\x22\\xdc\\xe2\\xf9\\x6c\\x20\\xeb\\x3b\\x3b\\xd1\\xb8\\x25\\x54\\x61\\x26\\x2b\\xac\\xed\\x50\\x92\\x53\\xe5\\x65\\x1a\\x47\\x77\\x97\\xeb\\x13\\x5b\\xe3\\x39\\xcc\\xd7\\xa6\\xf0\\xb3\\x17\\xe3\\x7b\\x02\\x87\\x4b\\xc5\\x35\\x9f\\xe3\\xca\\xce\\xd5\\xce\\xd4\\x71\\xc8\\x7c\\xeb\\xe0\\x6e\\x1c\\x92\\x68\\x6b\\xee\\xc4\\xf8\\x0c\\xeb\\x56\\xc5\\x62\\x31\\xbc\\xbf\\xb7\\xb4\\x0b\\xb6\\x3a\\xe4\\x52\\x46\\x2e\\x25\\xe4\\xfe\\xa1\\xaa\\x4a\\xba\\x64\\x88\\x38\\xd4\\xaa\\xa7\\xac\\xdf\\xa9\\x8e\\x2f\\xeb\\xd6\\x76\\x5e\\x11\\xd0\\xd8\\x32\\x91\\x6d\\x04\\x2f\\x5e\\xec\\x2c\\x36\\x92\\x81\\xd2\\x4f\\x5f\\xd7\\x97\\x45\\x52\\x5b\\x43\\xc2\\xaf\\xbf\\x02\\x77\\x3a\\x5b\\x13\\x0e\\x62\\xc7\\xb0\\x62\\xb4\\xb1\\x01\\xab\\xb7\\x20\\x7e\\xfa\\x20\\xb9\\xa7\\x1b\\xf4\\x38\\xb2\\x9b\\xf0\\x43\\x7d\\xfa\\x12\\x0a\\xf4\\xc8\\x7e\\x7e\\x65\\xcf\\x06\\xc8\\xd0\\x4d\\x48\\x8e\\x10\\x76\\x17\\x43\\x29\\xa1\\x2e\\x9f\\xa4\\x48\\x5d\\xb3\\xe1\\xaa\\xfb\\x2e\\x86\\x81\\xaf\\x1c\\xa8\\xfd\\xd8\\x49\\x59\\xaa\\xe1\\x18\\x4f\\xc4\\xc4\\x2c\\x0e\\x47\\xce\\x39\\x55\\x05\\x1f\\x16\\x7e\\x78\\xed\\xc5\\xc2\\xe3\\x1b\\xfc\\xee\\x51\\x8e\\xc0\\x8c\\xb1\\xb3\\x38\\x88\\x79\\x5f\\xe2\\xc1\\x69\\x39\\xdc\\xa9\\xc0\\x01\\xd9\\x06\\x33\\xd6\\xc5\\x22\\xde\\x60\\x21\\x14\\x02\\xda\\x58\\xd4\\x24\\xf7\\x31\\x99\\x68\\xd8\\x17\\x0d\\x07\\x1c\\xc3\\x26\\xce\\x7d\\x16\\xb0\\xa0\\xd8\\x7f\\x4e\\xf0\\xc3\\x51\\x46\\xde\\x30\\x49\\x34\\xa0\\x5f\\x9f\\x7e\\x70\\x1a\\x99\\x1d\\xf8\\xdc\\x70\\x66\\x67\\x0e\\xbc\\xb7\\xa0\\xe1\\x6c\\x83\\x59\\xf8\\x62\\xe1\\x6f\\xb0\\xc8\\x8b\\x86\\x27\\xa2\\x26\\x8b\\x7b\\x92\\xb1\\x8e\\x70\\x14\\x17\\x09\\x34\\x23\\xee\\x76\\x0a\\x8f\\x45\\x98\\x65\\xe6\\x32\\xb6\\x32\\x20\\x91\\x56\\xa1\\x7a\\xdc\\x25\\x7a\\x2e\\x04\\x31\\x57\\x60\\xe8\\x8a\\x16\\x32\\x86\\x8c\\xc2\\x2c\\x8a\\x97\\xd1\\x52\\x75\\x0a\\xec\\x54\\xa8\\x1e\\x49\\x8b\\x4d\\x1f\\x10\\x39\\x50\\x77\\x66\\x03\\xfb\\x3c\\x26\\xdc\\x40\\x16\\xdc\\xbb\\xa0\\x1b\\x81\\xad\\x20\\xc8\\x7a\\x9b\\x47\\xb9\\x10\\x46\\x22\\x7b\\x95\\x19\\x2b\\x46\\x62\\x41\\x23\\x5f\\x66\\x5c\\xae\\x62\\x63\\x83\\x60\\x40\\x8f\\x39\\xdc\\x61\\x8b\\xc5\\xc6\\x06\\xb5\\x3c\\xe1\\x08\\xe0\\xa7\\xfb\\x64\\x0c\\xcb\\x3e\\x19\\x8f\\x02\\xe7\\x2e\\xec\\x1a\\x61\\xd2\\x94\\x13\\xdb\\x86\\x5f\\xf0\\x9b\\x3c\\x94\\x94\\xd2\\x6e\\x4a\\x69\\x21\\x05\\xc3\\x9b\\xc4\\x2b\\x22\\xa8\\x6c\\xe8\\x25\\x5a\\x69\\xaf\\x92\\x23\\xb9\\x29\\xe7\\xb8\\xb7\\xdf\\x07\\xce\\xf9\\xb9\\x11\\xe2\\x74\\x85\\xfe\\x61\\x39\\xbd\\xc1\\x92\\xca\\x7f\\x38\\x86\\xff\\xdc\\x18\\xd4\\xb7\\x9c\\x43\\x7c\\x85\\x9c\\x17\\x56\\x4b\\x06\\xf6\\xdb\\xc0\\x71\\x87\\xd2\\x54\\x93\\x73\\x35\\xe4\\x1b\\x39\\x71\\x16\\x6a\\x7f\\x0d\\x9c\\xb7\\x41\\x2b\\x4b\\x87\\xf6\\xb7\\xc0\\xf9\\x4a\\x0b\\xf3\\xe6\\xd7\\xe6\\xe6\\xb4\\xb9\\x39\\xea\\x6f\\x1e\\x75\\x37\\x4f\\xba\\x9b\\xa7\\xad\\xcd\\xe3\\x6f\\x86\\xb5\\x4f\\xb9\\xfc\\x24\\x72\\x58\\x67\\x3a\\x57\\xb9\\x6d\\xa5\\xd1\\xdb\\xd3\\xf7\\xa7\\xac\\xa6\\xb2\\xb5\\xd5\\x80\\x2b\\xde\\x57\\xbc\\xc7\\xde\\x6d\\xb7\\xdb\\xcd\\xf6\\x0e\\xfd\\xdf\\x6f\\xb7\\xbb\\xfc\\x7f\\x8b\\xa2\\xa8\\xa2\\xde\\x5f\\x51\\xf7\\x5b\\x60\\xff\\x15\\x41\\xab\\xa1\\x56\\x5f\\x21\\xaf\\x45\\x53\\xb7\\x61\\x9b\\xa9\\xca\\xb4\\x70\\x7a\\x8f\\xe2\\x69\\x24\\xda\\x75\\xbe\\x05\\xf9\\xb7\\x4d\\x68\\x26\\xde\\x30\\x0a\\x47\\xce\\x9b\\xd4\\xac\\x39\\xe1\\x41\\xdd\\xc3\\xa1\\xb9\\xe3\\x75\\x9e\\x6a\\x76\\xa6\\xc2\\x6d\\x8a\\xc0\\xfd\\x74\\xf9\\x5e\\x9a\\x55\\x09\\xfb\\xd4\\x57\\x26\\x6b\\x2a\\xf2\\x97\\xd5\\xa8\\x94\\x4d\\xcb\\xe5\\x34\\x9a\\xa5\\x22\\xa7\\x0c\\x4b\\x62\\xb2\\xe7\\x48\\x05\\x5a\\xe2\\xe4\\x9f\\xe2\\x22\\x40\\x4b\\xc2\\x48\\x68\\xc9\\x14\\x2a\\xb2\\xd0\\x06\\x2a\\x4b\\xbd\\x87\\x11\\xdb\\xf3\\xfe\\x28\\x23\\x46\\x11\\xeb\\x22\\x56\\x29\\xfb\\x20\\x62\\x27\\x0c\\x4b\\x8e\\x98\\x00\\x8d\\x11\\x13\\x9f\\x55\\xa8\\x73\\xc4\\x64\\x72\\x09\\xb1\\x49\\x94\\xc5\\x55\\xb4\\x94\\x11\\x67\\x09\\xde\\x2f\\x12\\x20\\xdf\\xb3\\x2b\\x29\\xd3\\xda\\xde\\x2b\\x1c\\xbd\\x09\\xac\\x3b\\x7b\\xde\\xb3\\xa7\\x66\\x09\\x6f\\x44\\x35\\x53\\xab\\x91\\xae\\x8b\\x3d\\xd7\\xb1\\x2e\\xfa\\x47\\x04\\x71\\x8e\\x3c\\xc0\\x67\\xd4\\xf1\\x51\\xc6\\x2a\\x47\\x9b\\x93\\xca\\xa3\\x19\\x85\\xe9\\x64\\xd5\\x60\\xa2\\xc8\\xc8\\x85\\x86\\x1b\\x9f\\xef\\xa4\\x3c\\x1d\\x76\\x98\\xc5\\xd5\\xe0\\x72\\x82\\xaa\\x04\\x32\\xe2\\x13\\x68\\x3f\\x30\\x76\\x22\\x8f\\x1c\\x39\\x04\\xc4\\xc0\\xe1\\xab\\x02\\x5f\\x31\\x6c\\x9c\\x98\\x23\\xc0\\x8c\\xf1\\x0c\\xf6\\x34\\xbd\\x8e\\xfd\\xcc\\x83\\xd1\\x28\\xfa\\xd3\\xf1\\xfe\\xb0\\x89\\x88\\xe8\\xf7\\x99\\xfd\\x1f\\xfa\\xb7\\xf3\\x6f\\xfa\\x83\\x7e\\x85\\x09\\x29\\xfa\\xbb\\xbb\\x83\\xef\\x3f\\x3a\\xbb\\xf4\\xf7\\xdf\\x7b\\x7f\\x20\\xfe\\xf9\\x2e\\x12\\xf6\\xda\\x7f\\x70\\xfa\\xb3\\xff\\xec\\x7a\\x7b\\xf6\\xf3\\xe7\\xcf\\xf7\\xe8\\xa7\\xb3\\xf3\\x8c\\xca\\xee\\x0d\\xec\\x2f\\xe0\\x7f\\xf9\\x9c\\x60\\xd3\\x77\\x45\\xe8\\x59\\x29\\xb4\\x53\\x0e\\x76\\xda\\x22\\x28\\x88\\x4e\\x95\\x94\\xa1\\x67\\xe5\\xb4\\x72\\x50\\x95\\xc4\\xb8\\xa9\\x72\\xfc\\xdd\\xd1\\xbe\\xf7\\xf4\\x3c\\xbb\\x22\\x40\\xa3\\xa6\\xf2\\xe3\\x53\\xc6\\x92\\xb8\\xfc\\x23\\x6f\\x1e\\x5d\\x59\\x0e\\xc8\\x4a\\xe7\\xb4\\xfa\\xd9\\xd8\\x80\\xfd\\x8b\\x99\\xf2\\x34\\x0b\\x52\\xdf\\x24\\xd6\\x4f\\x1c\\xb8\\xf6\\xb8\\x5a\\xce\\xc4\\x20\\xf0\\x93\\x9c\\xcf\\x80\\xf5\\x13\\xd3\\x5e\\x9d\\xff\\xb4\\x94\\x75\\xf3\\x2d\\x31\\xf9\\x87\\x2a\\x57\\xd3\\x5c\\x64\\x7e\\xb2\\x39\\x5b\\x9d\\x59\\x4d\\x0a\\xce\\xea\\x3e\\xd9\\x1c\\xad\\xce\\xfa\\x8a\\x68\\x9b\\x44\\x9d\\x9d\\x0d\\x47\\x06\\x53\\x4f\\x15\\xbc\\x5c\\x55\\xb0\\x2e\\xf3\\x9f\\x0f\\x80\\x2e\\xa9\\x9c\\xf3\\x7d\\x35\\xec\\x77\\xde\\x80\\xa4\\xb4\\x3f\\x69\\x31\\x67\\x0a\\x2e\\x59\\xda\\x2c\\x1e\\xe5\\x16\\x3e\\xca\\x0a\\x6b\\x85\\xe1\\xb6\\x67\\x3d\\xf5\\xec\\x06\\xb2\\xf1\\xeb\\xb7\\xff\\x42\\x13\\xb0\\x6a\\xb9\\xf1\\x4b\\xc0\\xe3\\xe7\\xa8\\x71\\x04\\x15\\x96\\x6f\\x5a\\x0b\\x8b\\x85\\x51\\x8d\\xc5\\xc2\\x2f\\x01\\x0d\\xbb\\x14\\x39\\x3e\\x07\\xce\\x97\\x8a\\x87\\xc4\\x1c\\xbb\\x73\\xf6\\x6b\\x85\\x05\\x1b\\xa7\\x8f\\xb0\\xf3\\xfe\\x17\\x16\\xee\\x35\\xa9\\xe5\\x53\\xff\\xf0\\xb1\\x04\\x43\\x45\\x1e\\x45\\x33\\xdc\\xc4\\x23\\xc8\\x86\\xf2\\x3f\\x82\\x72\\x28\\x77\\x85\\x78\\x38\\xe6\\x11\\xf4\\x53\\xc9\\xff\\x00\\x09\\x01\\x93\\x3a\\x2a\\xda\\xff\\x5c\\x1e\\x6b\\x1e\\x0d\\x35\\xde\\xcc\\x31\\xd7\\x1c\\xf3\\xcf\\x24\\x07\\x49\\xdb\\x8a\\xac\\x86\\xfa\\xb2\\x7e\\x35\\xc0\\x59\\xc9\\x2c\\x0a\\x13\\xaf\\x4f\\x99\\xee\\xf9\\x6c\\xe4\\x7b\\xb2\\xea\\x7d\\xd5\\x3b\\x3c\\x7e\\x30\\xa0\\x43\\xe4\\x0f\\x59\\x83\\x6a\\x1b\\x79\\x0d\\xfb\\x7f\\x22\\x65\\xef\\x7e\\x92\\x4e\\x83\\x87\\xca\\x02\\x94\\x6d\\x64\\x22\\x71\\xd5\\x55\\x85\\x6e\\xa9\\xcc\\x3f\\x81\\xf7\\xe5\\xe4\\x98\\xa0\\xab\\xd1\\x39\\x1c\\x79\\x63\\x42\\x79\\x6b\\x4b\\xfc\\xb6\\xdc\\xe9\\xa8\\x27\\x3e\\xa9\\x4f\\xac\\xae\\x11\\x5d\\xe2\\x19\\x6e\\x91\\x9d\\xb6\\xd1\\x59\\x40\\xd9\\xc5\\x2f\\x9b\\xe4\\x8c\\x53\\xec\\x52\\xca\\x11\\x0e\\x15\\x16\\xba\\xbd\\xa3\\x0e\\x7d\\xdf\\x9b\\xd6\\xfe\\xff\\x06\\x00\\x00\\xff\\xff\\x3b\\xc1\\xeb\\x31\\x55\\x4e\\x02\\x00\")\n\nfunc uiJsLibsD3335D3MinJsBytes() ([]byte, error) {\n return bindataRead(\n _uiJsLibsD3335D3MinJs,\n \"ui/js/libs/d3/3.3.5/d3.min.js\",\n )\n}\n\nfunc uiJsLibsD3335D3MinJs() (*asset, error) {\n bytes, err := uiJsLibsD3335D3MinJsBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/js/libs/d3/3.3.5/d3.min.js\", size: 151125, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiJsLibsMithriljs020MithrilMinJs = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\x94\\x7c\\x79\\x77\\xdb\\xb6\\xd2\\xf7\\xff\\xf9\\x14\\x32\\xeb\\xe3\\x97\\xac\\x60\\x5a\\x4e\\x9e\\xf7\\x9e\\xe7\\x52\\x41\\x78\\x9c\\xc4\\x59\\xda\\x38\\x8b\\xe3\\xb4\\x4d\\x14\\x35\\xe5\\x02\\x89\\x94\\xb9\\xa8\\x22\\xe5\\x25\\x26\\xbf\\xfb\\x33\\x33\\x00\\xb8\\x48\\x72\\x7a\\xef\\xe9\\xa9\\x45\\x62\\x1d\\x0c\\x66\\xf9\\xcd\\x00\\xcc\\xd1\\xcf\\x0f\\xce\\xe2\\x32\\x5a\\xc5\\xc9\\xe0\\x6a\\x64\\x3f\\xb4\\x47\\x0f\\xa2\\xb2\\x5c\\x3a\\x47\\x47\\x73\\x28\\x5d\\xfb\\x76\\x90\\xa7\\x47\\x49\\x94\\xaf\\x62\\x71\\x94\\xca\\x76\\xf6\\xa2\\x78\\x60\\x06\\xd6\\xe0\\x8d\\xc8\\x07\\xaf\\xb0\\xe2\\xc1\\x9b\\x38\\x10\\x59\\x21\\x9c\\xc1\\xd9\\xeb\\x8b\\x07\\x3f\\x1f\\x3d\\xb8\\xf2\\x56\\x83\\x94\\xcf\\xd6\\x59\\x50\\xc6\\x79\\x36\\xf0\\x4c\\x9f\\x05\\xd6\\x5d\\xf3\\x1e\\x9a\\x9e\\x75\\xf7\\x9c\\x7b\\x76\\x98\\x07\\xeb\\x54\\x64\\x25\\x3b\\x85\\x97\\x24\\x0f\\x3c\\xac\\x66\\x2f\\xe1\\x25\\xf0\\xb2\\x40\\x24\\x27\\x59\\x9c\\x52\\xd9\\x8b\\x95\\x97\\x8a\\xaa\\x82\\xf2\\x44\\x78\\xab\\x8b\\x38\\x15\\xf9\\xba\\x64\\x2f\\xa0\\xe1\\x4a\\xfc\\xbd\\x16\\x45\\xb9\\xdd\\xb2\\x10\\xa5\\x6a\\x57\\x37\\x13\\x0b\\xd3\\xba\\x43\\xda\\x3c\\xe6\\xf3\\xc9\\xd4\\x2e\\x12\\xa0\\x1b\\xa6\\x4a\\x12\\xd3\\x5b\\xcd\\x89\\x92\\xc2\\x62\\x01\\xdf\\x33\\xb3\\x75\\x92\\x70\\xee\\x4f\\x8e\\xa7\\x55\\xf5\\x46\\xb6\\xc0\\x17\\x6b\\x8f\\xf3\\x57\\x55\\x65\\x94\\xde\\xdc\\x88\\xb3\\x81\\xac\\x37\\xae\\x62\\x71\\xdd\\x79\\x2d\\xd6\\x7e\\xb9\\x12\\x42\\x97\\x58\\x2c\\xe4\\x81\\x8b\\x4f\\xce\\x5d\\xcd\\x04\\x37\\x82\\xc4\\x2b\\x0a\\xac\\x0d\\x5d\\xf5\\xec\\xc8\\xdf\\xb7\\x40\\xb9\\xc1\\x66\\xfc\\x0e\\x86\\x77\\x8c\\x30\\xbe\\x32\\x98\\x57\\x96\\xab\\x02\\xfa\\xd5\\x6c\\x0e\\x04\\x8f\\xe3\\x99\\xd9\\x50\\x33\\x42\\x6a\\x7e\\xb1\\x60\\x47\\xf2\\xeb\\x41\\x26\\xae\\x07\\xa7\\xab\\x55\\xbe\\x32\\x8d\\x42\\x24\\x22\\x28\\xf3\\xd5\\x00\\x66\\x48\\x4d\\xfd\\xc6\\x06\\x34\\x14\\x1b\\x04\\x51\\x9c\\x84\\x2b\\x91\\x59\\x83\\x22\\xca\\xd7\\x49\\x38\\xf0\\xc5\\xc0\\x1b\\x14\\xe5\\x2a\\xce\\xe6\\x86\\x35\\x9e\\xc1\\x10\\x63\\x8f\\x9f\\xd9\\xe2\\x46\\x04\\x72\\x96\\xb1\\x05\\xd3\\x1a\\x06\\xe7\\xdc\\x83\\x45\\x1c\\x1c\\x78\\x93\\x87\\x53\\x6b\\x66\\x03\\x91\\x1c\\x1f\\xc7\\x22\\x29\\xc4\\x00\\x9b\\xfc\\xa4\\xdb\\x40\\x2d\\xcd\\x66\\xc7\\xe1\\x46\\x13\\xbb\\x69\\x32\\xb7\\x97\\xeb\\x22\\x32\\x69\\xb0\\xb6\\x7e\\x22\\xeb\\x1f\\x4d\\x71\\x62\\xda\\xaa\\x88\\xbf\\x95\\xb4\\x60\\x29\\xd0\\x27\\x47\\x9e\\x44\\x30\\xc6\\x94\\x47\\x50\\x56\\x55\\x66\\x04\\x83\\xb8\\x86\\xe1\\xec\\x8d\\xac\\x1a\\xfb\\xc4\\xdc\\x97\\x7b\\x6b\\x06\\xee\\x43\\xe7\\x18\\x7b\\xe9\\x65\\xf3\\x63\\x98\\x20\\xb6\\x13\\x91\\xcd\\xcb\\xe8\\xe0\\x40\\x71\\x33\\xc6\\xe9\\xa0\\xe2\\xb5\\x8b\\x4f\\x4e\\x4c\\x6c\\xc0\\x91\\x16\\xc8\\xc5\\xd0\\x0a\\xed\\xc8\\x2b\\xde\\x5d\\x67\\xef\\x57\\xf9\\x52\\xac\\xca\\x5b\\x73\\x61\\x1d\\x1c\\x98\\x0b\\xe8\\x21\\x0e\\x0e\\x50\\x56\\xf6\\x78\\x38\\x59\\x00\\x6f\\x0c\\x03\\x24\\x04\\x1f\\x5d\\x53\\x2d\\x10\\x5f\\x2c\\xa6\\xc9\\x5e\\x4c\\xb9\\x61\\x58\\x4e\\xe7\\x95\\xea\\xc7\\x2b\\x51\\xae\\x57\\xd9\\x60\\xae\\x08\\x7b\\x32\\x82\\xe1\\x75\\x23\\x31\\xe5\\x73\\x7b\\x91\\xc7\\x99\\x69\\x0c\\x0c\\x0b\\xc6\\x6a\\xe5\\x79\\x66\\x82\\x24\\xb3\\x90\\x2d\\x58\\xc2\\x52\\x96\\xb1\\x9c\\x2d\\xd9\\xdf\\x6c\\x65\\xdd\\x95\\xab\\xdb\\x3b\\x25\\xc4\\x49\\x55\\xa9\\x07\\xbb\\xcc\\x3f\\xd2\\x3e\\x9b\\x16\\x92\\x9f\\x20\\x29\\x35\\xe8\\x5c\\x10\\x99\\x85\\x75\\x87\\xaf\\x35\\xee\\x01\\xd0\\xe2\\xc5\\x19\\x6e\\x44\\x62\\x2b\\x59\\xb6\\x14\\x7d\\xe9\\x18\\x99\\x52\\x72\\xc5\\xb6\\xd4\\x62\\x6b\\xfd\\x9c\\x58\\x28\\x9d\\x72\\xa6\\xb4\\xaa\\x4a\\xe0\\xc3\\xda\\xba\\x53\\x45\\x7b\\x3c\\x45\\x21\\x0a\\x0f\\x0e\\x42\\x3b\\xcb\\x43\\x51\\xc8\\xbd\\xbd\\xe2\\xf9\\xe1\\x82\\x5d\\xf3\\xab\\xa1\\xb9\\x26\\xee\\x27\\x4e\\xaa\\xea\\x15\\x23\\xc6\\xb1\\xa9\\x7a\\xa8\\x0d\\xbd\\x62\\xd7\\xa0\\x50\\x9d\\x17\\xab\\x26\\xe1\\x51\\xfd\\x0e\\x0e\\x62\\x53\\x3d\\xb2\\xd4\\x1a\\xa7\\x1c\\x15\\x23\\x01\\x1b\\x96\\x81\\x84\\xaf\\x49\\x11\\x52\\x94\\x5c\\x58\\x7e\\xca\\xef\\x6a\\x8b\\xa9\\xc6\\xa0\\x5c\\xb8\\x76\\xa2\\x02\\x0c\\x95\\xda\\xfd\\x1b\\x3e\\x62\\xb7\\xc0\\x05\\x45\\xcb\\xed\\x93\\x9b\\xf1\\xcd\\x70\\x68\\xe9\\x15\\x4f\\x6e\\xa4\\xd0\\x10\\x2f\\x69\\x12\\x60\\xa6\\xed\\x2d\\x97\\xc9\\xad\\x39\\x99\\xb2\\xc4\\x62\\x37\\x87\\x87\\x9d\\x01\\xac\\x46\\xac\\xbe\\xc3\\x7c\\xec\\x84\\xa7\\xaa\\x82\\x58\\x2d\\x1f\\xd9\\x53\\x98\\xf3\\x19\\x3f\\x06\\x8b\\xf8\\x10\\xec\\xdb\\x23\\x30\\x86\\x60\\x35\\xce\\xf8\\xde\\x31\\x03\\x6a\\xc6\\x37\\x8f\\x75\\x1f\\xa2\\x24\\x05\\x12\\x0e\\x0e\\xf0\\xaf\\x94\\x15\\x2d\\x8c\\x6d\\x89\\x7d\\x29\\x6e\\x81\\x3e\\x18\\x60\\xc4\\x5e\\x4e\\xfa\\xe5\\x53\\x7e\\xe7\\x91\\x1c\\x39\\xcf\\x58\\x9c\\x85\\xe2\\xc6\\xb9\\xa9\\x5b\\x1a\\xdf\\x02\\x21\\xf7\\x30\\x00\\x38\\x95\\xd0\\xcc\\xc9\\xd6\\xcc\\x49\\x6f\\x86\\x96\\x95\\x1f\\x36\\x47\\xfa\\x30\\xfe\\x00\\x23\\x25\\x93\\x0f\\x34\\xcc\\x87\\xde\\x30\\xc0\\x8e\\xa6\\x44\\x2d\\xa0\\x5f\\xc0\\x8d\\x6f\\xdf\\x94\\x33\\xfa\\xf6\\xcd\\x18\\xbe\\x85\\x91\\xc6\\xfe\\x4a\\x78\\x97\\xb8\\x89\\x67\\x52\\xb8\\xce\\x81\\x67\\x28\\x92\\x7a\\xce\\xbd\\x86\\xdd\\x16\\x54\\x8d\\xa4\\xcd\\xd1\\xe4\\x7d\\x64\\x17\\xc4\\xdf\\x8f\\xc4\\x3a\\x76\\x41\\xeb\\xd0\\x6b\\xfd\\xa8\\x69\\xbb\\xd0\\x0f\\x1f\\x5b\\x52\\xf6\\xf8\\x45\\x77\\xbd\\x34\\x74\\x43\\xca\\xf9\\x3f\\xca\\xd2\\x7f\\xc1\\x4a\\x1c\\xe5\\xd3\\x46\\xe9\\xf8\\xe5\\xe4\\xd3\\x94\\xe3\\x1f\\x57\\xef\\xe5\\x0b\\xbd\\x97\\x6c\\xb6\\xca\\x53\\x07\\xeb\\x6c\\x2a\\x61\\xe0\\x0a\\xd0\\xc5\\x69\\x1d\\x9b\\xb4\\x55\\x60\\x44\\x9f\\xdb\\x01\\x50\\x5d\\x8a\\x53\\xd9\\xc8\\x24\\xff\\x63\\xd5\\x8e\\x1e\\xf6\\xb4\\x11\\x11\\x32\\xb1\\xbf\\xa1\\x3b\\xd2\\x6b\\xfb\\x1d\\xad\\xe4\\x4b\\xeb\\x37\\x69\\xf1\\x5e\\x4e\\x7e\\x07\\x8b\\x86\\xe5\\x7f\\xf0\\xdf\\xec\\x22\\x5f\\x95\\xe6\\xdc\\x62\\x9f\\x49\\x15\\x4f\\x56\\x2b\\xef\\xd6\\x6c\\x36\\x62\\xfc\\x59\\xa9\\x5f\\xda\\x53\\xf2\\x56\\x08\\xbf\\xd0\\xae\\x7c\\xe1\\x7f\\xe8\\xed\\x40\\x8b\\xf2\\xc5\\x96\\x34\\x81\\xda\\x3c\\x03\\xd1\\x00\\x8d\\x9f\\x7c\\x51\\xeb\\xd0\\xaa\\xdf\\x14\\xc0\\xc4\\x76\\xb1\\xa4\\x51\\x55\\x11\\x3b\\x06\\x1b\\xda\\x19\\xe2\\x54\\x72\\x76\\x9f\\xef\\xe6\\xc0\\x78\\x9f\\x04\\x2e\\x69\\xa7\\x68\\x98\\xcf\\x3c\\x28\\x2a\\xc0\\x1f\\x3c\\x15\\x40\\xaf\\x30\\xf7\\xa1\\x80\\xfc\\xcc\\x5b\\x62\\xef\\x97\\x86\\xb7\\xb8\\x9f\\x3b\\x08\\x19\\xb1\\x3b\\xe5\\xdf\\x61\\x30\\x67\\xd7\\x0c\\x35\\xa3\\xf5\\x38\\x93\\xfd\\x69\\x8d\\x03\\x64\\xbd\\x81\\xf9\\x7e\\xdd\\x59\\xc7\\x0b\\x60\\xc5\\xce\\xf9\\xc1\\x12\\x7f\\xb1\\xd5\\xde\\x6b\\xd9\\xea\\x96\\x6c\\xac\\xa2\\xa9\\xf9\\x87\\xd5\\xb4\\x64\\x20\\xb7\\x51\\xd6\\xa6\\xdb\\x14\\x36\\x83\\x59\\x75\\xca\\x3f\\xd7\\x75\\x57\\x1b\\xbe\\xed\\xd6\\x08\\xda\\x0d\\xdf\\xe7\\xd2\\xb7\\xa5\\xe0\\xd3\\x50\\xe4\\x61\\x4b\\xbf\\x4d\\xd1\\xc3\\x0d\\x9f\\x56\\xd5\\x53\\xe5\\xe6\\xc6\\xbe\\x0f\\x4b\\x09\\x60\\xe1\\xbe\\xaf\\x04\\x28\\xce\\x4a\\xe0\\x08\\x60\\x82\\x13\\x50\\x7f\\x8b\\x3d\\x1d\\x72\\xa8\\xda\\x07\\xdb\\x5f\\x94\\x22\\x74\\xb1\\x5d\\x4a\\x0e\\xef\\xe8\\xf1\\xe4\\xcf\\xaf\\x47\\xd3\\xea\\xeb\\x93\\xaf\\xc5\\xcf\\x93\\x3f\\x1f\\x4f\\x8f\\xe6\\x56\\x55\\x21\\x0c\\x50\\xf4\\x38\\x1a\\x68\\xf9\\x12\\x18\\x40\\x4f\\x55\\x71\\x8c\\xb4\\x0c\\x87\\x53\\x18\\xd9\\x42\\x25\\xdf\\x3b\\xf9\\x47\\x2d\\x6f\\xad\\xf2\\xc1\\xc1\\x77\\xd2\\x12\\xe5\\x26\\xbe\\x33\\x32\\xc9\\xd2\\xe7\\x35\\x52\\x1f\\xf8\\x24\\xf6\\x81\\xaf\\xf5\\x42\\x4b\\xbf\\x1c\\x27\\xf0\\xed\\xa5\\x07\\x58\\xa6\\xc4\\x9d\\xc1\\x01\\x89\\xd9\\xef\\x66\\x66\\xe0\\x5b\\x8f\\x47\\xe8\\x02\\x27\\x81\\x3f\\x65\\x64\\xed\\x41\\x13\\x35\\x35\\x8d\\xeb\\x40\\xe7\\xa7\\x3d\\x4f\\xe3\\x9b\\x1a\\x4f\\xf8\\xbd\\xae\\x35\\x1c\\x53\\x76\\xe8\\xe0\\x00\\xfd\\xe2\\xab\\x76\\x95\\x02\\xd1\\x33\\x9b\\xe1\\x5f\\x18\\x1d\\xe1\\xef\\x58\\x6e\\xdb\\xdc\\xe7\\xf2\\xdd\\xde\\x87\\xb8\\x60\\x1e\\x67\\x1e\\xa0\\x0f\\x59\\xc2\\x22\\x9f\\x83\\x46\\xcd\\x66\\x00\\x2c\\x04\\xa0\\xf6\\x70\\xe5\\x5d\\xdb\\xe0\\x94\\x41\\xe1\\xe6\\xb7\\x26\\xe0\\x91\\x94\\x9a\\x15\\xae\\xfa\\x6d\\x16\\x35\\xf7\\x2d\\xe7\\xf0\\x98\\xc5\\x3e\\x8f\\xfc\\x27\\x87\\xc7\\x50\\x0f\\x8e\\xb6\\x5c\\xe5\\x49\\x22\\x10\\x07\\xfa\\x53\\x07\\x0c\\x8b\\x99\\x74\\x4a\\xab\\xea\\xbd\\xc5\\x3e\\x21\\xdd\\x89\\xb6\\xa8\\x49\\xc7\\x64\\xa2\\xc9\\xe5\\x23\\x80\\x69\\x7e\\x55\\xa5\\x38\\x6f\\x67\\xbc\\x8d\\xd7\\x86\\x88\\xd8\\xb7\\x70\\x6e\\xb9\\x14\\x7c\\x73\\x24\\x48\\x5f\\x26\\x5e\\x20\\xa2\\x3c\\x09\\xc5\\xca\\xa8\\xd9\\x8f\\xa1\\xd3\\x27\\x74\\x63\\x92\\x0e\\x90\\x4f\\xf5\\x44\\x20\\xa4\\x43\\x1d\\xff\\x64\\xc1\\x52\\xed\\x3c\\x5b\\x67\\x49\\xee\\x01\\x60\\xf2\\x7c\\x69\\x55\\xef\\x5a\\xb2\\x9c\\xd8\\x67\\x91\\x97\\x85\\xf2\\xb1\\x69\\x0b\\x03\\x09\\xd5\\x18\\x78\\x06\\xdb\\x23\\x9f\\x63\\x25\\xa5\\x89\\xc4\\x3d\\x33\\x2d\\xc7\\xdb\\x91\\xc3\\xb3\\x3c\\x5d\\xe6\\x19\\xc8\\xd5\\xa0\\x14\\x29\\xac\\xac\\x04\\x58\\x05\\x7a\\x33\\x50\\x2b\\xf0\\x06\\x57\\xf1\\xaa\\x5c\\x7b\\xc9\\x40\\x1b\\x88\\x41\\x96\\x97\\x03\\x0f\\x6a\\xd0\\xaa\\x33\\x15\\x44\\xb0\\x81\\x28\\x03\\xdb\\x40\\xb9\\xdb\\xb5\\xd6\\xb4\\x29\\x4d\\xdb\\x52\\xf2\\x16\\x0b\\x9f\\xbf\\xf3\\x17\\x10\\xad\\x20\\x1f\\x0a\\xdd\\xc9\\x62\\x97\\x3e\\x5f\\x68\\xa2\\x9f\\x98\\x06\\x54\\x62\\xf0\\xa4\\xaa\\xdd\\x63\\x67\\x44\\xc8\\xd3\\xa4\\xf5\\xa1\\x93\\x87\\x9f\\xaa\\x82\\x1e\\xe4\\x79\\x2c\\x89\\x9c\\x21\\x54\\xea\\x8e\\xad\\xa6\\xb6\\xfa\\x6d\\x50\\x54\\x75\\xdc\\x82\\x03\\xe9\\xe7\\xb6\\x9c\\xfc\\x7d\\xda\\xbe\\x40\\xb4\\x07\\x36\\xe2\\x3e\\x89\\x36\\xf7\\x48\\x98\\x66\\xf1\\xfc\\x19\\xec\\x9d\\xb8\\x01\\xb3\\xb4\\x51\\x60\\x4b\\x81\\x01\\x23\\x06\\xa1\\x0b\\x0c\\xf6\\x63\\xfd\\xe8\\x75\\xdd\\x2a\\x50\\x63\\x81\\xec\\x81\\xe1\\x23\\x15\\x97\\x16\\x51\\xeb\\x7c\\x03\\x8c\\x71\\x0f\\x36\\x86\\x2a\\x6f\\x97\\x22\\x9f\\x0d\\x36\\x47\\xd4\\x92\\x05\\x63\\xfe\\xba\\x3d\\x9f\\xae\\x35\\xd5\\x80\\x5a\\x69\\x2c\\x4b\\xdb\\x89\\x58\\xda\\xb1\\x18\\xed\\x58\\x57\\x69\\x95\\x35\\x53\\xb3\\x76\\x44\\x58\\x4e\\xd4\\x29\\x30\\xef\\x96\\x2b\\x71\\x05\\xb2\\xf6\\x5c\\xcc\\xbc\\x75\\x52\\x3a\\xef\\x6b\\xab\\x13\\x05\\xd3\\x9e\\x53\\x18\\x2c\\x65\\x74\\xac\\xac\\x67\\xe2\\xa3\\x82\\xf3\\x3e\\x0b\\x24\\x18\\x94\\x7b\\x77\\x93\\x26\\x59\\xe1\\xfe\\xcd\\x7b\\xef\\x8e\\x51\\x5c\\xcd\\xa5\\xf2\\xc2\\xb0\\x50\\x6b\\xa8\\x4c\\xc8\\xf5\\xf5\\xb5\\x7d\\xfd\\xc8\\xce\\x57\\xf3\\xa3\\x87\\xa3\\xd1\\xe8\\x08\\x9b\\x39\\x06\\x38\\x92\\xa8\\x69\\x0d\\x0c\\xdf\\xd9\\xfe\\xf8\\xdf\\xff\\xfe\\xdf\\xa3\\x33\\x68\\x49\\x7f\\xce\\xde\\x18\\xa0\\xed\\x3e\\xa1\\x98\\xc0\\x6f\\x66\\x8f\\x91\\x14\\x70\\x64\\xee\\x26\\x04\\xa1\\xa1\\x59\\xdb\\xcc\\x72\\x36\\x5a\\xbc\\xfd\\x68\\xfe\\xcd\\xb6\\x5b\\xfd\\x60\\xb4\\x1f\\x0c\\x01\\xfb\\x28\\x73\\x0f\\x72\\x40\\x89\\x4d\\x2e\\x7d\\x37\\x32\\x91\\xa5\\xdd\\x49\\x18\\xc4\\x24\\x7f\\x5b\\x8e\\x7e\\xd3\\xc1\\xb5\\xa3\\x1c\\x46\\x13\\x6d\\xa3\\xe1\\xd5\\xcf\\x4d\\x68\\xeb\\xce\\xda\\xf1\\x02\\xf8\\xaf\\x6d\\x82\\x72\\xa4\\x1f\\x21\\x5e\\x19\\x35\\x6b\\x42\\xe1\\x01\\x52\\x45\\x18\\x97\\x9e\\x9f\\x08\\x37\\xf0\\x1d\\x89\\x00\\x9c\\x4e\\x67\\x05\\x95\\xc0\\xf5\\xd5\\xac\\xb5\\x72\\x77\\xca\\x9f\\x70\\xe1\\xf7\\xc5\\x94\\xcf\\xfc\\xf1\\xb6\\xa0\\xce\\xfc\\x0e\\xf0\\xef\\x19\\xe2\\xce\\x0b\\x78\\xb7\\x24\\x44\\xe4\\xd9\\x91\\xdc\\xcd\\x6a\\x88\\x52\\xfd\\x5e\\x27\\xe9\\x21\\x53\\xbf\\xdb\\x72\\xdc\\x1d\\xe1\\x3d\\xdb\\x1c\\x83\\xa7\\x7e\\x5d\\xa7\\x1d\\x6e\\xee\\xb5\\x2f\\x3a\\xde\\x35\\x37\\x8b\\xc0\\x29\\x5b\\x4c\\x65\\x81\\x3a\\xe2\\x69\\x5c\\x79\\xc9\\x5a\\x74\\x2c\\xe7\\xc1\\x41\\x67\\x5f\\xef\\xa8\\x56\\x6f\\xa8\\x4d\\x6f\\xb5\\xdc\\xe5\\x4d\\x94\\x0b\\x7d\\x7a\\xc0\\x30\\xd7\\x90\\x50\\xc2\\x86\\x0e\\x68\\x19\\x4d\\xc1\\x76\\xf7\\xa6\\xd1\\x02\\xa3\\x4c\\x28\\x8e\\xde\\x92\\xcf\\xff\\x33\\xb9\\x38\\xfe\\x4f\\xe4\\x42\\xa3\\x19\\x85\\x07\\x31\\xfa\\x6d\\x44\\x82\\x78\\x76\\xaf\\x4c\\x58\\x8c\\x4c\\xe8\\x48\\x23\\xe5\\xc0\\xdf\\x42\\xc8\\xf7\\x72\\x00\\x2d\\x8c\\x32\\x6a\\x1d\\x0a\\xc1\\x64\\xa2\\x5d\\x93\\xfb\\x9f\\x29\\x5b\\xd8\\xda\\xd1\\xcd\\xf7\\xaa\\x02\\xb6\\xe7\\x7e\\x93\\x3d\\x45\\x18\\x6c\\xdd\\x29\\x1f\\xdc\\x14\\x36\\x25\\x5e\\x6f\\x22\\x05\\x2b\\xb1\\x4b\\x5d\\x8f\\x57\\x12\\x01\\xe4\\xbe\\x99\\x30\\xd0\\x0b\\xb6\\x97\\xf8\\x2c\\x83\\x25\\x4f\\x2d\\xab\\x05\\x79\\x9a\\xe0\\x3d\\x4d\\xe2\\xf7\\xf1\\xb6\\xed\\x74\\xc1\\x78\\x34\\x28\\xfa\\x3b\\xbf\\x84\\x19\\x00\\x97\\x5b\\x8e\\xf9\\x9d\\x4f\\xb4\\x3d\\xb9\\x00\\xe2\\x91\\x21\\x66\\x62\\x4d\\x81\\x41\\xd8\\x1d\\x33\\x9a\\x0a\\x70\\xbf\\xb3\\x30\\x29\\xdb\\xe3\\xe3\\x77\\x94\\x90\\xdd\\x9c\\x44\\x53\\x64\\x48\\x3c\\x31\\xc8\\xd6\\xa9\\x2f\\x20\\x24\\xc8\\xf3\\x44\\x78\\x99\\xd1\\x60\\x32\\x4d\\x38\\x21\\xb3\\xad\\x3c\\x0f\\x50\\xe1\\x24\\x2d\\xa8\\xb5\\x20\\xea\\x25\\xa9\\x86\\x8e\\x98\\xc5\\x4d\\xda\\x37\\x98\\x92\\x76\\xdc\\x85\\xc5\\xe8\\xdc\\xd1\\xf2\\xe0\\x60\\x09\\x85\\xcf\\x29\\xbc\\xba\\xd2\\xa6\\x92\\xa0\\x4c\\x1b\\x4c\\xc4\\x08\\xdf\\x2d\\xd6\\xb2\\xc3\\x72\\x0c\\xdc\\x41\\xc0\\xe6\\x1e\\x6a\\x9e\\xef\\x7a\\x72\\x16\\x9e\\x38\\x4b\\x77\\x09\\x84\\x67\\x62\\xf5\\xea\\xe2\\xec\\x0d\\xbc\\x9b\\x26\\x26\\x22\\x91\\x03\\x34\\xe3\\x05\\xac\\xa5\\xaa\\xbe\\x6b\\x1b\\x49\\x0e\\xbc\\x9b\\xc9\\x62\\xf7\\xf0\\x79\\x4b\\x3b\\x7f\\xc0\\x53\\xd6\\xcc\\xf6\\x9b\\x24\\x8a\\xb8\\xbc\\x8b\\x71\\x7d\\xb6\\x6d\\x28\\x52\\xad\\x01\\x6d\\x9b\\x86\\x9c\\xf7\\x64\\xd4\\x53\\x31\\xe9\\xa1\\xaf\\x1e\\xe4\\xc6\\xc3\\xa6\\x41\\x09\\xfd\\xb6\\x3d\\x23\\x0a\\xf2\\x02\\x16\\x32\\xd1\\x86\\x17\\x33\\x4c\\x27\\x04\\x2a\\xa2\\xe0\\xc1\\x64\\x36\\x65\\x11\\x0f\\xe1\\x07\\xf5\\x8b\\x2a\\xc1\\xf8\\x62\\xd2\\x6c\\x6e\\x29\\xab\\x06\\xcf\\x33\\x30\\x71\\x71\\xb6\\x5c\\x93\\xcd\\x23\\x9d\\xa5\\xaa\\x3d\\x3e\\xa7\\xb8\\x58\\xee\\xc3\\x5c\\xa6\\x9a\\xef\\x70\\x30\\x3e\\x1f\\x63\\x96\\x14\\x33\\x9e\\x52\\x77\\x68\\x14\\x00\\x61\\x08\\x30\\xe1\\xc9\\x42\\xbb\\x10\\x67\\x6b\\xd1\\xd1\\xea\\xb9\\x04\\x28\\xa8\\x1f\\xb3\\x46\\x0e\\x8d\\x3c\\x33\\x2c\\xcb\\xc3\\x21\\x13\\x13\\xdc\\x66\\x27\\x9d\\x5d\\x94\\xb7\\x89\\xa6\\x4e\\x9a\\x93\\x79\\x93\\x73\\x9e\\x5b\\xfd\\xa0\\x2a\\xc6\\x85\\xcd\\x2d\\x95\\x42\\x8d\\xaa\\x2a\\x9a\\xc4\\x18\\xbb\\xcf\\xe1\\xc7\\xa2\\x35\\xd0\\x68\\xf0\\x26\\x8b\\xc6\\xbd\\x8e\\x91\\x25\\xfb\\x83\\x88\\x76\\x1a\\x62\\x82\\x97\\x88\\x91\\x93\\x0b\\xd7\\x88\\x56\\x62\\x46\\x04\\xb9\\x74\\x42\\x72\\x02\\xb6\\x23\\xf6\\xd7\\xa5\\x00\\x14\\xb0\\x1b\\xbd\\xfc\\xfb\\xe8\\x26\\x89\\xb3\\x4b\\x83\\xc9\\xae\\x0c\\x00\\x44\\xe7\\xb4\\x62\\xc7\\x48\\xa6\\x3a\\xd4\\xc0\\x96\\x1b\\x35\\x33\\x2c\\xa3\\x0d\\xf4\\x60\\xb7\\x92\\xb8\\x28\\x31\\x5d\\x8e\\x3b\\x27\\x19\\xa5\\x5e\\x60\\x61\\xa9\\x7e\\x46\\xc6\\xeb\\xe7\\xeb\\x38\\x04\\xc4\\xa5\\x5e\\x22\\x11\\xcf\\x23\\xd9\\xdf\\x35\\xd5\\xce\\xc3\\x0b\\xc4\\x74\\xb8\\x13\\xc8\\x37\\x62\\x1a\\x6d\\xf4\\x4e\\x42\\x54\\xe6\\x7b\\x41\\x60\\x6c\\x61\\xa7\\xa2\\x28\\xbc\\xb9\\x68\\x77\\xf5\\x75\\x06\\x32\\x13\\x87\\x03\\x7d\\x32\\x64\\x40\\x6c\\xad\\x62\\xa6\\x45\\x5d\\x6b\\x2d\\x08\\x5b\\x59\\x8e\\xa5\\x16\\x34\\x41\\x3c\\x1e\\x69\\x91\\x3a\\x1f\\x1e\\x8f\\x83\\x27\\xf8\\xe7\\xf0\\x10\\x51\\x85\\x37\\x09\\xe8\\x14\\x25\\x98\\x76\\xc2\\x78\\x99\\xb2\\xdf\\x28\\x04\\x48\\x9f\\xe6\\x57\\xe2\\x19\\x2a\\x33\\x75\\xd3\\x44\\x03\\x98\\xa8\\xe9\\x04\\x4b\\xe6\\x9c\\x4d\\xf0\\x5a\\x3e\\x8d\\xba\\x30\\x7d\\x6a\\x36\\xda\\x6b\\x66\\x27\\xd1\\x51\\xd1\\xfe\\xc8\\x6a\\xc9\\x5d\\xe0\\x21\\x1c\\x92\\x73\\x4f\\x30\\xe0\\xfd\\x30\\x18\\xd8\\xec\\xd6\\x8d\\x06\\xee\\xed\\x29\\xcd\\x90\\xd7\\x0b\\x16\\x34\\xbb\\xc0\\x0a\\x00\\x02\\xf3\\x79\\xaf\\x16\\xd6\\x32\\x0e\\xda\\x48\\x61\\x33\\x50\\xf8\\xe7\\x38\\xc1\\x6b\\x80\\x83\\xd5\\x46\\x0d\\x9d\\x42\\xca\\xf7\\x6b\\x12\\x42\\x22\\x21\\xe4\\x6d\\xbd\\x9e\\x7f\\x01\\x1c\\x97\\x5a\\xdd\\xd6\\x49\\x58\\xb5\\xe8\\x8e\\xd6\\x32\\xf7\\x52\\xda\\x35\\x69\\xc3\\x9a\\x11\\xa5\\x41\\xf6\\xc9\\x8e\\x29\\x3c\\x28\\xf8\\xf1\\x1e\\x0f\\x1b\\x1f\\xc0\\x66\\xdb\\x69\\xc8\\x62\\x09\\x5e\\x0f\\xa6\\x77\\xcd\\x0d\\x5b\\x3f\\x63\\xa1\\x36\\xed\\x33\\x55\\x73\\x12\\x2e\\xbc\\x00\\x7a\\xa1\\x97\\x31\\x0d\\x9f\\xda\\xf9\\x62\\x1e\\x67\\x06\\x10\\xc3\\xbc\\x9e\\x40\\xcd\\xc0\\x5f\\x85\\xff\\x49\\xbf\\x5a\\xad\\xfc\\xfe\\xa6\\x22\\x0b\\xb1\\x61\\x63\\x92\\xe8\\xb0\\x72\\x63\\xd1\\x78\\x30\\x36\\x6e\\x8e\\xfd\\xfa\\x75\\x20\\xbe\\xc3\\x61\\x73\\x08\\xd6\\xb2\\x31\\xd9\\x0d\\x7e\\x80\\xaf\\x01\\x0f\\xaa\\x8a\\x76\\x9c\\x6d\\x47\\xcb\\x32\\x8e\\xb6\\xa0\\xa6\\x00\\x67\\x5c\\x62\\x5e\\x63\\x5d\\x7a\\x12\\x37\\x91\\xd1\\x6f\\x3c\\x95\\x4c\\xf1\\xe1\\x1a\\x67\\x98\\xac\\x4a\\x6e\\xef\\x84\\x6f\\x02\\x38\\x6a\\x49\\x48\\x51\\x4d\\x48\\x40\\xf9\\xc7\\xc6\\x38\\x78\\xcd\\x89\\xdd\\xe8\\x89\\xef\\x7e\\x54\\x6b\\xb2\\x0e\\x8f\\x1d\\xbf\\xed\\x99\\xb5\\x3d\\x77\\xc0\\x36\\x7d\\xde\\xdc\\xd1\\x52\\xde\\x14\\x62\\x1e\\x92\\x79\\xb5\\x9e\\xc4\\xb7\\xcb\\xfc\\x97\\x8f\\xef\\xde\\xee\\x1a\\xa7\\x66\\x9d\\x29\\x73\\xc9\\x2f\\x69\\x7e\\xb6\\x1a\\x9b\\xde\\x46\\x92\\x4c\\xa1\\xc5\\x32\\x8a\\x0b\\xe8\\x56\\x55\\xf8\\x50\\xb3\\x90\\x77\\x19\\x7d\\x0f\\xbd\\x4f\\x8e\\x31\\xeb\\xca\\x7d\\x6d\\x81\\xee\\x39\\x4d\\xc7\\x64\\x3b\\xca\\x1d\\xe5\\x04\\x1b\\x6c\\xea\\xa2\\x99\\x6b\\x4c\\x97\\x43\\x16\\x6b\\x1c\\xb6\\x39\\x43\\x2e\\x3b\\x8c\\xa5\\x82\\x74\\x33\\x5f\\x01\\xc3\\x0a\\x27\\x6c\\x59\\x03\\xac\\xd2\\xbe\\x15\\x9f\\xd5\\x71\\x91\\xd0\\xb9\\x25\\xcc\\xac\\xeb\\x72\\x4c\\x90\\xb5\\xbc\\x5a\\x02\\x5f\\xf6\\xa1\\xe9\\x3e\\x58\\xac\\x7d\\x69\\x9a\\x1a\\xf9\\xc5\\xfb\\x01\\xa3\\xb1\\xc7\\x7f\\x43\\x65\\xf5\\x65\\x30\\xf8\\x07\\xca\\xa9\\x62\\xed\\xef\\xf0\\xdc\\xe1\\xe5\\xc1\\xc1\\x46\\x81\\xbd\\xbf\\x0f\\x2c\\x28\\xdc\\x09\\x76\\x6a\\x96\\xba\\xbb\\x11\\xac\\x9f\\x5a\\x8d\\x51\\x8e\\x41\\xbe\\x56\\xc0\\x21\\x6a\\x89\\x2b\\x75\\x9b\\x27\\x9a\\x1f\\x04\\xd5\\x41\\x9f\\xfe\\x0d\\xe8\\xfe\\x06\\x74\\x7f\\x53\\x26\\xf5\\x33\\xfd\\xb2\\x2f\\x84\\xe6\\x9e\\x83\\x12\\xdc\\xaf\\x14\\x2d\\x03\\xfe\\x46\\xf9\\x6c\\x34\\x41\\x9e\\xbc\\x44\\xfe\\x04\\x7a\\xe6\\xe0\\x23\\xed\\x14\\x74\\x73\\xaa\\xa3\\xe8\\xb6\\xd7\\x4a\\x5b\\xb6\\x99\\xcf\\xef\\xea\\xb1\\xb4\\x6f\\x41\\xeb\\x36\\x5d\\x30\\x55\\x87\\xc7\\xa8\\xec\\x78\\x84\\xed\\xf3\\x2b\\x33\\xc0\\x54\\x28\\x90\\x61\\x86\\xc3\\x63\\x16\\xe8\\x11\\xf1\\x9e\\x45\\x53\\x33\\x62\\xa1\\x25\\x93\\x80\\xb3\\x5e\\x9e\\x0e\\xfc\\xda\\xbc\\x83\\xb4\\x02\\xb2\\xe9\\x34\\xfa\\x5c\\xe7\\x55\\x91\\xd0\\x35\\x98\\x49\\xa0\\x6a\\x32\\x9b\\xcc\\xa7\\xa0\\x38\\x7b\\xa3\\x66\\x23\\x23\\x04\\x1b\\x32\\xdf\\x82\\x80\\x31\\xd8\\xd5\\x2b\\x92\\x5d\\xe4\\xc5\\x01\\x64\\xe0\\xb9\\x98\\x9f\\xde\\x2c\\x4d\\xe3\\x4f\\x63\\x18\\x01\\x1b\\x29\\xc7\\x6b\\x1e\\x39\\x74\\x60\\x30\\x74\\xbf\\xda\\x77\\x8f\\xea\\xa3\\x39\\x33\\x4c\\xfb\\x67\\xd7\\x32\\xac\\xad\\x16\\x54\\x07\\x8f\\xf8\\x0c\\xf5\\x43\\xe3\\xc8\\xdd\\x37\\x88\\xf2\\xd8\\x2e\\x45\\x51\\xc2\\x32\\x34\\x19\\x41\\xd3\\x39\\x66\\x1d\\x75\\x6d\\x21\\x44\\xa4\\x8f\\x2b\\x9a\\xb1\\xf1\\x94\\x62\\x0a\\x3a\\x7a\\xaf\\xc2\\xb1\\xc3\\x87\\xe0\\x0f\\xf8\\x08\\x38\\xa7\\x99\\x3d\\x9e\\x3f\\x99\\x8d\\x67\\x20\\xc6\\x33\\x40\\x07\\x80\\x88\\x3a\\x24\\x57\\x5f\\x6d\\xa4\\xd7\\xb0\\xa6\\x3c\\x14\\x01\\x6c\\xf9\\xa7\\xf3\\xd7\\x4d\\x1e\\xd8\\x44\\x9c\\x0c\\x9e\\xa7\\xcf\\xac\\x1a\\xd9\\xd5\\xb1\\x90\\x85\\x06\\x12\\xdc\\xd3\\x26\\x79\\x0f\\x2c\\x4d\\xb9\\x4a\\x7e\\x45\\x5d\\x84\\xe7\\x54\\x94\\x1e\\x3d\\x3f\\x84\\x9d\\xf3\\xec\\xeb\\x28\\x0e\\x22\\xeb\\xce\\xb3\\xfb\\x3e\\xdb\\xdd\\x2c\\x30\\x11\\xb7\\x49\\x4e\\xc9\\x88\\x65\\xef\\xb8\\xd9\\x58\\x02\\x0a\\xeb\\x15\\x22\\xa5\\x0b\\x58\\xbc\\x28\\xe9\\xca\\xcf\\x2a\\x50\\x5e\\x13\\x84\\xcb\\x58\\x7a\\x65\\x94\\x29\\x90\\xda\\x15\\x6a\\xc4\\x0d\\x85\\xf0\\x56\\x41\\xe4\\x5e\\x99\\xfa\\x51\\xc9\\x3f\\x98\\x2b\\x07\\xa4\\x1a\\xe2\\x07\\xe3\\x04\\xe0\\xa4\\xdf\\x46\\xb1\\x65\\xfe\\x69\\xb9\\x14\\xab\\x67\\x5e\\x81\\xe7\\x93\\x16\\x9a\\xbe\\x16\\xa8\\x8d\\xd5\\xf8\\xe6\\xa6\\xfa\\xfc\\x58\\xab\\xd0\\xef\\xb4\\x7c\\x84\\xf5\\xde\\x19\\x91\\x57\\x20\\xc4\\xed\\xd3\\x7b\\x8a\\xd7\\x4f\\x22\\x57\\xfe\\x70\\xf9\\xe3\\x00\\xe5\\x01\\x1a\\x92\\x8b\\x1c\\xd4\\xa7\\x0b\\xec\\xd6\\xad\\x13\\x08\\x39\\x5d\\x39\\xea\\x1c\\xd5\\x4a\\xf4\\xad\\x63\\x2b\\xdf\\xf5\\x87\\xc6\\xc4\\x18\\xce\\x86\\xc6\\xd4\\x70\\x66\\x10\\x66\\x21\\x60\\x66\\xb1\\xbe\\xd4\\x01\\x24\\x2e\\xb8\\x0c\\x48\\x78\\xe4\\x8a\\x6c\\x4b\\x40\\x00\\x5a\\xc7\\x18\\xc6\\xb8\\x6b\\x33\\x62\\xea\\xe5\\xb5\\x8b\\x5a\\x13\\xae\\x61\\xe1\\x3b\\x73\\x18\\x21\\x68\\x29\\x84\\x29\\xf8\\x43\\x27\\x02\\xf8\\x00\\xb6\\xcd\\xf5\\x1c\\x53\\x3d\\x62\\xba\\xc6\\xd3\\x56\\x73\\xe7\\xac\\x43\\x83\\x1b\\xc3\\x1d\\x35\\x3e\\xb8\\x9b\\x9a\\x4d\\xa6\\x2a\\xa5\\x6f\\x1c\\x18\\x96\\xf3\\x5f\\x0d\\x10\\x59\\xe3\\x48\\x9e\\x29\\x0a\\xe9\\xd5\\x17\\x56\\xdd\\xd8\\x8c\\x66\\xcc\\x96\\xd9\\x57\\x28\\xfc\\x60\\xf4\\xf0\\xda\\x12\\x60\\x1a\\x6f\\x75\\x52\\x9a\\x23\\x4b\\x7a\\x73\\x65\\xdd\\xf0\\xc2\\x0d\\xc8\\x55\\x4f\\x74\\xf1\\x24\\xb8\\xa4\\xa1\\x40\\x52\\xef\\xd0\\xe7\\x8e\\x60\\x9f\\x74\\x86\\x6a\\x2c\\x9e\\x84\\xe3\\x50\\x9f\\x85\\xce\\xc0\\xb1\\x85\\x53\\xdd\\x85\\x1b\\x68\\x13\\x77\\xe8\\xea\\x8c\\x40\\x43\\xc4\\x1f\\x62\\x6c\\xaa\\xb2\\x36\\x3b\\x9b\\x1d\\x4f\\x2d\\x4a\\xd4\\x8e\\x55\\x82\\x0b\\x78\\xee\\x6a\\x68\\x8c\\x2f\\x98\\x1e\\xc1\\x3b\\x2d\\xf8\\xcc\\x27\\x81\\xb4\\xa9\\xf8\\x23\\x19\\x02\\xa6\\xdb\\xa1\\xaa\\x48\\x33\\x26\\x68\\xd9\\x71\\xdd\\x62\\x1e\\x04\\x4e\\xe3\\xb8\\x87\\xf4\\xd8\\x05\\x61\\x3d\\xfc\\xcb\\x3b\\x9d\\x6e\\xba\\xa8\\x05\\xd8\\xbe\\xca\\x97\\xb0\\x91\\xe3\\xc6\\x35\\x95\\x91\\x40\\x28\\x02\\xbe\\x03\\x9f\\x3a\\xe8\\x04\\xbc\\x86\\x16\\x2a\\x18\\x43\\xb5\\x83\\x42\\xcc\\x7e\\xb1\\xce\\x04\\xb7\\x2a\\x32\\xd3\\xef\\x01\\x52\\x99\\xa0\\xb9\\x5a\\xb0\\x0c\\x2c\\xec\\xb2\\x23\\xa8\\x58\\xc1\\x79\\x8c\\x09\\x84\\x95\\x28\\xf2\\xe4\\x4a\\x98\\x29\\xa5\\xae\\x56\\x02\\xfd\\x12\\xbc\\xd4\\x9d\\xed\\x0f\\x75\\xfe\\x82\\x2c\\xa0\\xbe\\xeb\\xd4\\xc4\\xf8\\x29\\xc5\\xf8\\x00\\xac\\xd4\\xf9\\x0a\\xe5\\x01\\xdb\\x08\\x8b\\x5e\\x11\\x8f\\xca\\x6d\\x1e\\x8d\\x15\\x20\\x4d\\x59\\x97\\x1e\\x30\\xdc\\x78\\x5a\\xc6\\x61\\x26\\x13\\xa5\\x7b\\x77\\x5d\\x80\\x75\\x3a\\x3e\\x9c\\x5b\\x77\\xc2\\x0e\\xc5\\x4c\\x80\\x81\\x0c\\x21\\x48\\x12\\x74\\xc0\\x47\\x09\\xfe\\x39\\xb6\\x94\\x88\\x1e\\x62\\xb5\\xee\\x55\\x32\\xb9\\x03\\x0b\\x02\\xc8\\x0b\\x4e\\x27\\xa3\\xc8\\x51\\x35\\x64\\xd6\\xb0\\x7a\\xc7\\xc8\\x19\\x65\\x92\\x58\\xc2\\x23\\x06\\xe3\\xd4\\xa1\\xb9\\xe8\\xba\\xb3\\x04\\x26\\xc5\\xe2\\x7e\\x59\\xb4\\x55\\x86\\x13\\x23\\xf3\\xe7\\x7d\\x0e\\xb9\\xb0\\x3c\\xe0\\xa4\\x43\\x46\\x08\\xd3\\x03\\xaa\\x07\\xe8\\x9c\\x8e\\x0b\\xe9\\x3a\\x97\\x8f\\xf7\\xd1\\x60\\x2e\\xcd\\x84\\xd9\\x8f\\x28\\x9e\\x21\\xc5\\x33\\xe2\\x05\\xee\\xca\\xa5\\x0b\\x03\\x60\\x00\\x26\\x8f\\x42\\x2d\\x62\\xa7\\xb3\\xb1\\x8e\\xc0\\x8c\\x51\\xae\\xfa\\x45\\x8a\\xe0\\x18\\x99\\x2f\\x6f\\x1f\\xce\\xf9\\x31\\xaa\\x21\\x58\\xd1\\x47\\x60\\x3d\\xff\\x87\\x5d\\x72\\x02\\xd8\\x09\\xa8\\x78\\x0a\\xff\\x67\\x68\\x8e\\x2f\\x51\\xca\\xd3\\xb8\\x10\\xa8\\xfc\\x97\\x5a\\xd2\\x78\\x77\\x6b\\x15\\xed\\x89\\xda\\x5f\\xc5\\x44\\x8b\\x49\\x90\\x7e\\xa9\\xe4\\xf1\\xc7\\x5d\\xa2\\x7e\\x17\\x35\\xe7\\x86\\x1a\\x75\\x94\\x0f\\xd1\\x8f\\x54\\x16\\xad\\x7d\\xa4\\x0c\\x6e\\xd0\\xd1\\x05\\xda\\x87\\x05\\x15\\x29\\x85\\x70\\x32\\x69\\x19\\x48\\x45\\xd5\\x1c\\x1d\\xbf\\xf6\\xbd\\x8b\\x33\\xdb\\xe2\\x13\\x05\\x1b\\x00\\x1f\\x84\\x5e\\xe9\\xc9\\x0c\\xa8\\xb1\\x28\\xf2\\x6c\\x69\\x10\\x4c\\xd0\\xa5\\xe0\\x7a\\xdf\\xe4\\xd7\\xda\\xf5\\x6a\\xc7\\x86\\xa4\\xfa\\xf6\\x1f\\x67\\x6f\\x5e\\x95\\xe5\\xf2\\x5c\\x5e\\x02\\xa6\\xb8\\xda\\xce\\x97\\x02\\x43\\x1d\\x00\\x1d\\x51\\x1e\\x82\\x1f\\x59\\xaf\\x12\\x46\\x0e\\x65\\x0d\\xe1\\x2b\\xfc\\x2c\\xbd\\xa2\\xb8\\xce\\x57\\x78\\x42\\x03\\xe2\\x00\\xb1\\x76\\x78\\x0b\\x61\\x62\\x29\\xc0\\x7a\\x67\\x73\\xd1\\x0d\\x9b\\xfe\\x07\\x56\\x1a\\xda\\xd4\\xe2\\x23\\xb6\\x00\\x31\\x0b\\x31\\xa4\\x2c\\xd7\\xc5\\x13\\xfe\\x70\\x34\\xc2\\xeb\\x8c\\xf2\\xf5\\xf1\\xa3\\xd1\\x08\\xf0\\x4b\\xae\\x92\\x11\\x28\\x97\\x8e\\x81\\xcf\\x06\\x2b\\x09\\x9e\\x40\\xc8\\x82\\x68\\x46\\x8b\\x9f\\x6a\\x41\\x2f\\xdd\\x26\\x20\\x5f\\x98\\xaa\\x5a\\xc5\\x5e\\x12\\x7f\\x17\\x30\\x3d\\x86\\x7d\\xb6\\x74\\x22\\xf1\\xec\\x16\\xad\\x12\\xb2\\x05\\xb4\\xe0\\xe5\\xe9\\x85\\x64\\x93\\x5c\\x27\\x91\\x22\\x4a\\xc5\\x88\\x57\\x40\\xb2\\xa0\\x13\\x7d\\x3a\\x1f\\x39\\x44\\x36\\x1a\\xcc\\xc0\\x00\\x2c\\x96\\x97\\xac\\x8f\\x90\\xd1\\xe3\\x01\\x7a\\x2c\\xe8\\xc6\\xd7\\xe5\\xec\\xf0\\x7f\\x0d\\x8c\\xd4\\xc0\\x4c\\x6f\\x4e\\xbf\\xc4\\x36\\xbb\\x27\\x38\\x09\\x02\\xb1\\x2c\\x77\\x0c\\xcd\\x06\\x98\\xfa\\x39\\xfa\\x19\\xc6\\xdc\\xc8\\x27\\xb5\\x67\\x21\\x82\\xeb\\x32\\x33\\xc4\\xb4\\xa9\\x4a\\x52\\x22\\x97\\xb9\\x90\\xba\\x34\\xe3\\xdb\\x0b\\x95\\x2c\\x70\\xe5\\x0f\\x84\\x43\\x94\\x15\\x6e\\x4c\\xee\\x0c\\x8f\\x83\\x0f\\x0e\\x66\\xdd\\x94\\x36\\x02\\xb9\\x17\\xf9\\x2a\\x85\\xc8\\xc8\\x93\\x29\\x3c\\x43\\xad\\x63\\x80\\x63\\x74\\x6e\\x42\\x8b\\x18\\x74\\x63\\xd5\\xbd\\x13\\x3d\\xc8\\x57\\x03\\xdd\\xd7\\x1e\\x3c\\x8b\\x44\\x70\\x39\\x80\\x36\\x83\\xbf\\x1a\\x36\\xfd\\x35\\xc8\\x97\\x32\\x01\\x98\\x0d\\xfe\\x4a\\xf5\\x85\\xf4\\xbf\\x0c\\xad\\x42\\xc8\\xb7\\x0c\\xd3\\x2d\\x2c\\x54\\xf6\\xc1\\xd0\\x77\\x17\\x91\\x62\\xdf\\x0b\\x2e\\xbf\\x19\\x43\\x53\\x87\\x6e\\x96\\x3d\\x97\\x37\\xd7\\x4d\\x00\\x29\\x50\\x81\\xe7\\xc6\\x88\\x06\\x61\\x88\\x63\\x71\\xfc\\xaf\\x9f\\xe5\\xbb\\x97\\x85\\x79\\x0a\\xda\\xd0\\xde\\xe9\\x7d\\xf4\\x2f\\xf4\\xfe\\xdb\\xd9\\xa3\\x60\\x15\\xc3\\x0e\\x59\\x63\\x1f\\x7d\\x76\\x23\\xdc\\xe0\\xb0\\xa2\\xfb\\x32\\x8d\\x11\\xca\\xc1\\x0f\\x44\\x19\\x94\\xb9\\x00\\x34\\x51\\xd0\\x49\\x04\\x48\\x6d\\x8d\\xd9\\xc7\\x39\\xba\\x74\\x16\\x69\\x09\\xdf\\x91\\xaa\\xf8\\xa7\\xf9\\x7e\\xa0\\x19\\x77\\x52\\xcb\\x9c\\xff\\x3f\\x1a\\xb1\\xde\\xe4\\x7d\\xf5\\x30\\xef\\xa8\\x9b\\x63\\x90\\x15\\x1f\\xa4\\xde\\x25\\x6e\\x20\\x99\\x94\\x81\\xda\\x16\\x03\\x8c\\x74\\x43\\x2f\\xdb\\x3b\\x96\\x24\\x53\\x4a\\x71\\x8b\\x62\\x59\\x0b\\x41\\x05\\x27\\x23\\x32\\x34\\xe9\\xa7\\x17\\xea\\x3e\\x19\\xb9\\x00\\xe2\\x1c\\x7c\\xc4\\x6a\\xbd\\x9f\\x10\\xec\\xb8\\xbd\\x37\\xc7\\xd0\\x2f\\x86\\x84\\x9e\\xf3\\x21\\xf4\\x1b\\x02\\x54\\x27\\x29\\xc6\\x33\\x3f\\x8b\\x3d\\xb7\\xfd\\x3c\\xbc\\xc5\\x34\\x09\\xc8\\x8b\\x66\\x4d\\x6b\\x30\\x9f\\xea\\xc8\\x1b\\x4f\\x16\\x50\\x2b\\x78\\x57\\x2b\\x1a\\xcb\\xd9\\x1a\\xce\\x36\\xfb\\xb8\\x49\\xf6\\x63\\x20\\xdb\\x05\\xb2\\x0f\\x0c\\x40\\x9d\\x6b\\x04\\x5b\\xd4\\x46\\xaf\\x53\\xb8\\xe1\\x50\\x38\\xcd\\xe1\\x81\\x1c\\x91\\x07\\x5d\\x50\\xd6\\x92\\xf5\\xac\\xeb\\x40\\xbc\\x36\\x5e\\xf5\\x0e\\xbf\\x4f\\xbf\\x5e\\x43\\xc4\\x1a\\x53\\xec\\x0b\\x88\\xda\\x6f\\x33\\xad\\x98\\x67\\x7d\\xdc\\x84\\xa7\\x0d\\xd4\\x15\\x80\\x46\\xc3\\x69\\x13\\x8b\\x8d\\x3d\\xfa\\xc0\\x43\\xc6\\xaa\\x58\\x03\\xfb\\x26\\xf0\\x83\\x0a\\x91\\x88\\x52\\x0c\\xf0\\xa5\\x6e\\x08\\xc2\\xfe\\xcf\\xd9\\x29\\x7b\\xc1\\x5e\\xb2\\x57\\xdc\\x98\\xe4\\x94\\x47\\x18\\xc8\\x74\\xc2\\xd4\\x60\\xaf\\xdb\\x32\\xba\\x85\\x0a\\x45\\xbf\\xb4\\x45\\x52\\x89\\xa0\\xec\\x57\\xde\\x02\\x0c\\xf6\\x06\\xdc\\x73\\xa3\\x61\\xec\\x8c\\x1f\\x99\\xae\\x63\\xfe\\x59\\xfd\\x04\\x51\\xb3\\x05\\x21\\xfe\\x4f\\x5f\\xed\\xaf\\x93\\xaf\\x53\\x08\\xf3\\xad\\xca\\xfc\\x3a\\xb1\\x87\\xee\\xd7\\xa9\\x05\\xe1\\xf4\\x5b\\x7e\\xf4\\x75\\x62\\xc2\\xab\\x05\\xed\\xb9\\x69\\x54\\xff\\xaf\\xb2\\x28\\x5b\\xf0\\xf5\\xa1\\x05\\x4d\\x8e\\xd8\\x3b\\x7e\\xf4\\xa7\\x79\\x72\\x7e\\x7a\\x52\\x3d\\x3d\\xf9\\x78\\x5a\\x3d\\x3d\\xaf\\x9e\\xbd\\x7b\\x03\\xff\\x9f\\x9d\\x9d\\xbc\\x7d\\x5e\\x9d\\x9e\\x3d\\x3d\\x7d\\x5e\\xbd\\x3a\\xaf\\x5e\\x9f\\xbd\\xac\\x5e\\xbf\\x7d\\xff\\xe9\\xa2\\xfa\\xf5\\xf4\\xf3\\xcb\\xd3\\xb7\\xd5\\x9b\\xd7\\x6f\\x7f\\xad\\xce\\x4e\\x2f\\x4e\\xaa\\xf7\\x27\\xe7\\x27\\x67\\xd5\\xc7\\x77\\x9f\\xce\\x9f\\x9d\\x56\\x17\\xe7\\x27\\xcf\\x7e\\xad\\x7e\\x7f\\x7a\\x6e\\xed\\x1f\\xb1\\xf7\\x5d\\x41\\xae\\xc7\\x21\\xee\\x1a\\xdd\\xc0\\x66\\xe7\\xfc\\xae\\x23\\x5b\\x4e\\x17\\x39\\x7c\\xe0\\xf2\\x1e\\xe5\\x87\\x6d\\x03\\x12\\x95\\x69\\x82\\x9f\\x1d\\x3c\\x6f\\xbe\\xd6\\x39\\xd5\\x37\\x47\\xb7\\x8a\\xd0\\x4e\\xbb\\xcf\\xf5\\x96\\xa9\\x73\\x8b\\xed\\x9e\\x78\\x07\\xa5\\x2b\\xe5\\x9e\\x84\\x28\\x9d\\x48\\x01\\xc9\\x68\\x5e\\x6a\\xd6\\x4d\\x7b\\xf7\\xe8\\xa6\\x6e\\xfd\\xa1\\x6a\\xd6\\xf6\\x74\\x26\\xd3\\x9a\\x7d\\xc4\\xcb\\x8a\\x17\\x98\\xac\\xd2\\x19\\xb6\\x1e\\xf6\\x61\\x4d\\x26\\x5e\\x7e\\x60\\xb3\\xe7\\x6d\\xdf\\x8c\\x3b\\xcd\\x8a\\xf5\\x4a\\x90\\xdd\\x7f\\xfe\\xee\\x4c\\xdf\\x7f\\x03\\x37\\x81\\xf6\\x05\\xf1\\x84\\x08\\x07\\x65\\x3e\\x48\\x65\\xd4\\x7e\\x94\\xca\\x84\\xc9\\x51\\xaa\\xe6\\x1b\\xc4\\x05\\x5d\\x95\\x03\\x1b\\x2e\\x66\\x71\\x06\\x30\\xd4\\x90\\x7b\\x32\\xa7\\x28\\x09\\xc3\\x6e\\x3c\\x6c\\x06\\xb4\\x18\\x41\\xa4\\x41\\xe7\\xce\\x1b\\x1c\\x73\\xcf\\x1d\\x6f\\x8c\\xe0\\x97\\x76\\x03\\xfd\\x99\\xbc\\x73\\xe4\\xab\\x8f\\x85\\xa8\\xb8\\xf9\\x5a\\xa8\\xbd\\x90\\xe3\\xd7\\x18\\x6e\\x81\\xad\\xa3\\xed\\x8d\\xcd\\x45\\x87\\xad\\xf8\\x61\\x92\\xbc\\xe9\\x80\\x51\\x9b\\x6c\\x36\\x03\\xc4\\x4b\\xa9\\x44\\xbc\\x80\\xe1\\x53\\x99\\xbc\\x71\\xa1\\x0a\\x45\\x1b\\xc6\\x5e\\x02\\x96\\x4d\\x20\\x5c\\x53\\x3a\\x9c\\x3c\\xb9\\x1c\\x5f\\x82\\x1e\\x8b\\xc9\\xe5\\x14\\x71\\x3d\\xc0\\x36\\x3c\\x27\\xdf\\x85\\x4f\\x3d\\x02\\x6f\\xca\\x6d\\x79\\x68\\xfc\\xf5\\x99\\x3a\\x05\\xfe\\xd8\\x17\\x63\\xc0\\x1d\\x5d\\x55\\x80\\xe5\\x35\\xde\\xde\\xeb\\x07\\x58\\xde\\x46\\x80\\x25\\x91\\x2e\\xc6\\x10\\x10\\x1f\\x02\\x4e\\x45\\xf1\\x20\\xc6\\x7f\\x62\\x78\\x81\\x9d\\xfd\\x8e\\x7f\\xfe\\xc0\\x3f\\x4d\\x06\\x75\\xa4\\x92\\xc1\\x2a\\xb7\\xca\\x3c\\xba\\xeb\\xea\\xfb\\xfc\\xf8\\x5f\\x20\\x3f\\x81\\x8e\\xa3\\x77\\xad\\x0b\\xb3\\xef\\x3f\\xc8\\x83\\xe3\\xba\\x48\\x2e\\x38\\xe5\\x75\\xd6\\x89\\xd8\\xc0\\xe0\\xf7\\x08\\xdf\\xfb\\x44\\x00\\xf2\\x1d\\x88\\xdd\\x32\\x28\\x6e\\xe2\\xa2\\x2c\\x06\\xf2\\x1c\\x66\\x20\\xe5\\x0d\\xa5\\xd2\\x6b\\x2f\\x71\\xc6\\x19\\xc8\\x66\\x5c\\x6a\\xa1\\x0b\\xf8\\x6f\\xdd\\x83\\x8c\\xd1\\x13\\x54\\x7c\\x2c\\xdc\\xfc\\x4a\\x25\\x64\\x33\\xfc\\xee\\x64\\xce\\x37\\x0f\\xd7\\xba\\xa9\\x4a\\xdc\\xb2\\x7d\\x2e\\x99\\x55\\x83\\xbf\\x94\\x27\\x68\\x98\\x28\\x1c\\x47\\x20\\x0e\\xf8\\xe5\\x14\\xdd\\x54\\x95\\x0c\\x09\\x3b\\xf9\\x6f\\x36\\x47\\x04\\xde\\xc9\\x87\\xf7\\xce\\x09\\x09\\xd5\\x75\\x8e\\xe6\\xb6\\x07\\xde\\xd5\\xb3\\x99\\x4e\\x9d\\xd6\\xf9\\x4a\\xa9\\xff\\xa0\\xd3\\x51\\x25\\x16\\xf8\\xb2\\x71\\x92\\xd8\\x2b\\xc2\\x40\\x79\\x6f\\x86\\x21\\xf4\\x56\\x0e\\x1d\\x6f\\x7b\\xee\\x3e\\x57\\x62\\xbf\\xc1\\x10\\x10\\x74\\x6d\\x1d\\x94\\x3c\\x24\\x35\\x2d\\xd6\\x7e\\xd0\\x66\\xa9\\xee\\x15\\x93\\x87\\x96\\xca\\x83\\xc7\\xfc\\x13\\xf7\\xf1\\x34\\xbb\\x7b\\xfa\\xd1\\x35\\xec\\x35\\x58\\x0b\\xbf\\x7f\\x9e\\x03\\x91\\x26\\x8a\\xcd\\x42\\x3b\\x69\\x4c\\xc6\\xe1\\xa5\\x63\\x5c\\x1c\\xbf\\x64\\xbf\\xe3\\x8f\\x8f\\x97\\x84\\x81\\x5a\\x2c\\xab\\x6b\\x75\\x5f\\x12\\x13\\xab\\x7a\\xb1\\x3d\\xc1\\x0e\\x80\\x00\\xbc\\xa8\\x08\\x7b\\xfc\\x19\\x80\\xf7\\x9e\\xbc\\x26\\xf3\\x02\\x6f\\x58\\xdc\\xf7\\xe1\\xa5\\x86\\xb1\\x87\\x5f\\x9e\\xf8\\x3e\\x26\\xc2\\x3e\\xe3\\xc7\\x6c\\x2f\\xcd\\xcf\\x78\\x4a\\xf1\\xc2\\x5c\\x82\\x2a\\x41\\x64\\x6d\\x2e\\x4d\\xf9\\xde\\x59\\x92\\x54\\xc1\\x9a\\x1a\\x30\\x22\\x8a\\x54\\x66\\x63\\x0f\\x74\\x82\\x48\\xb2\\x29\\xc4\\x73\\x9a\\xed\\xed\\xe8\\xba\\xc0\\xd0\\x1f\\x0e\\x71\\x1c\\x74\\x11\\xf7\\xb5\\xe0\\x04\\xaa\\x53\\xef\\xc6\\x0c\\xfd\\x43\\x30\\x77\\x16\\xc3\\x2b\\x1e\\x78\\x81\\x4f\\xcf\\x6f\\x2a\\xc3\\x21\\x7a\\x87\\x79\\x46\\x06\\x1b\\xba\\xfb\\xc2\\xae\\x8b\\x43\\x1d\\xde\\x7f\\x0e\\x63\\x39\\x9b\\x24\\xe1\\x14\\xc2\\xbe\\x86\\xd0\\x00\\x2f\\x2a\\xfc\\xc3\\xfd\\xaf\\xde\\x11\\x68\\x73\\x0a\\xb3\\x91\\x11\\x47\\xef\\x38\\xf6\\x4d\\x8f\\xae\\xcc\\xb8\\xe1\\xc4\\x9b\\x3a\\x21\\x46\\x17\\xed\\x45\\x08\\x0f\\x6f\\x82\\xc9\\x83\\x17\\x9f\\xcd\\x7d\\xbc\\xa4\\x7f\\xa7\\xf3\\xe6\\x00\\x00\\x19\\x65\\x9a\\x8d\\x9f\\x0c\\x26\\xb3\\xe4\\x08\\x74\\x6b\\xbc\\x8a\\xff\\x9e\\x2d\\x48\\x6a\\x9a\\x04\\x0b\\x39\\xbe\\x2e\\x6b\\x40\\xe9\\x90\\x87\\x9b\\xea\\xa0\\x4f\\x3e\\xe6\\x3e\\xaa\\xe5\\xa3\\x1d\\x2d\\x5a\\xdb\\xde\\x9c\\x86\\x1e\\xd3\\x77\\x76\\xbf\\xa8\\x6f\\x77\\x7b\\xc7\\xa4\\x2c\\xe0\\xdd\\x76\\xe0\\xd2\\xda\\xd7\\x87\\x53\\xba\\xd1\\xa9\\x69\\xf2\\x75\\x3a\\x75\\xee\\xf3\\xbf\\x11\\x15\\xa1\\xbd\\xc5\\xe3\\x2c\\xb0\\x73\\x96\\xbc\\x05\\xe2\\xff\\xd0\\xf5\\x87\\xd2\\xfc\\x0d\\x68\\xad\\x03\\x02\\xba\\xa2\\x18\\x80\\x04\\x0c\\xc0\\xa8\\x60\\x03\\xaa\\x28\\x06\\xca\\xc9\\xd3\\x07\\xb8\\x92\\x31\\x60\\x79\\x17\\xa4\\x45\\xfa\\x9c\\x00\\x42\\x0f\\x10\\x32\\xe2\\xa1\\xe6\\x3f\\x97\\xb9\\xff\\x8d\\xc3\\x0a\\xd7\\xc8\\x33\\x2c\\x97\\xc9\\x09\\x80\\xec\\x00\\xf2\\xf3\\x25\\xe5\\x2b\\x0c\\x08\\xe9\\x66\\xd3\\x2e\\xcf\\x25\\x7b\\x4e\\xfb\\x87\\x0d\\xe3\\x1f\\x1c\\x84\\x98\\xde\\x90\\x9f\\xaa\\x13\\x10\\x0b\\xf6\\x7f\\x8f\\xe3\\xa1\\x20\\x5e\\x5b\\x25\\x20\\xb5\\xcf\\x4b\\x3c\\x55\\x9b\\xea\\x84\\x21\\x1e\\xf2\\x74\\x78\\x6f\\x7b\\x61\\x78\\x8a\\xf2\\xf7\\x06\\x5c\\x90\\xc8\\xd0\\x06\\xf5\\xab\\xcb\\xd2\\x0b\\x22\\x6a\\xa1\\x0f\\x1c\\x7a\\x5b\\x17\\xf1\\xde\\x1e\\xb3\\xee\\xce\\x75\\x5e\\xf0\\xb3\\xdf\\xb9\\x8d\\xb7\\x8f\\x00\\x4a\\x37\\x6b\\xd9\\xdb\\xe0\\xd3\\xa9\\xdd\\x91\\x5b\\x6b\\xb8\\x79\\xe4\\x32\\x8c\\xd4\\x3d\\x49\\x1c\\x87\\xcd\\xb7\\x48\\xc7\\xef\\x75\\x65\\x4c\\xda\\x2b\\xc6\\xcb\\x4c\\x31\\x04\\x6d\\x0c\\xd0\\xd2\\x76\\xa7\\x4e\\x2d\\x98\\xb4\\xb9\\x1d\\x8a\\x66\\xc1\\x78\\x2b\\xac\\xd7\\xb5\\xdc\\x5d\\xd5\\x72\\x76\\x4b\\xea\\x47\\x5d\\xa9\\x8f\\x41\\x6a\\xc7\\x20\\xb8\\xdd\\x6a\\xf9\\xd5\\x44\\x4f\\xfe\\xe9\\xf2\\xe8\\x25\\xb4\\xed\\x85\\x7b\\x80\\xd3\\x2e\\xf1\\x92\\xe4\\x95\\x39\\xd7\\x1f\\x46\\x5f\\x0e\\xd5\\x51\\x97\\xf6\\xb0\\x29\\x8a\\xeb\\xc2\\x4a\\x26\\xe9\\x94\\x2f\\xe0\\x0f\\x0d\\x9e\\x41\\x70\\x98\\x58\\x2c\\x97\\xdd\\x9b\\xce\\x23\\x76\\x69\\x39\\x40\\x4f\\x06\\x12\\x04\\x34\\xe5\\x43\\xf3\\x10\\x6f\\x33\\xe6\\xbd\\x49\\x75\\x84\\x69\\x0d\\x33\\x69\\xab\\x97\\x7c\\xa7\\xbe\\xbb\\xdd\\x6d\\x77\\x36\\x95\\x7e\\x6f\\x54\\x55\\x71\\xb7\\x17\\xae\\xdb\\xb7\\xc1\\xb0\\x95\\xf9\\xea\\x96\\xf2\\x8e\\x94\\x9a\\x73\\x4d\\x14\\xd6\\x6f\\x5d\\x6d\\x68\\x5a\\x4d\\x96\\xae\\xa1\\x42\\x12\\x6a\\x0b\\x64\\x35\\xfd\\x8c\\x29\\x61\\x4a\\x88\\x51\\xca\\xb8\\x4c\\x04\\xdb\\x92\\x9b\\x39\\x9e\\x25\\x80\\x3e\\xec\\xaa\\x80\\x4d\\xdf\\x50\\x36\\xe0\\xfc\\xbd\\x8d\\xeb\\x5a\\xab\\x3f\\x26\\x42\\xbc\\xb4\\xe7\\x69\\xd1\\x16\\xcd\\x76\\x98\\x9f\\xcf\\xf9\\x5a\\x7e\\x84\\x83\\xc2\\xa1\\xcd\\x89\\xd9\\x7c\\x80\\xa3\\x4c\\xd2\\x39\\x96\\x32\\x65\\x7f\\x2c\\x0d\\x06\\xb1\\x0b\\x42\\xc1\\xb4\\x3b\\xab\\x69\\x19\\x4d\\x14\\x3f\\xf3\\xc1\\x25\\xb4\\x54\\x21\\xa9\\xdc\\x90\\xd6\\xc0\\x68\\x4a\\xfd\\x35\\x04\\x0c\\x1f\\xd6\\x62\\x75\\x2b\\x11\\x3b\\x5f\\x77\\x97\\x51\\x88\\x6e\\xd5\\x15\\x6b\\x53\\xed\\xdb\\x86\\x89\\xb2\\xcb\\xed\\xb1\\x8e\\xce\\x80\\xe3\\xd1\\x8d\\x7a\\xb6\\x24\\xfa\\xdf\\xcc\\xd6\\x6f\\x72\\xaa\\x89\\xda\\x89\\x49\\x53\\xb4\\x6b\\x4d\\x3c\\x40\\x07\\xce\\x9d\\xdc\\x5f\\xe7\\xa3\\x77\\x9d\\x9b\\x90\\xdd\\x8e\\x2c\\xc5\\x6d\\x9a\\xb2\\xb8\\xcd\\x82\\xde\\x34\\x4d\\x7e\\xc3\\xdf\\xed\\x80\\x45\\x53\\x34\\x07\\x26\\x72\\xc1\\x08\\x2a\\x71\\x43\\x66\\xc5\\x0d\\x89\\x20\\x0e\\x0f\\x67\\x94\\x33\\x56\\xcb\\x43\\x60\\x19\\x02\\xf0\\x82\\x5f\\xbc\\x8a\\x52\\x4b\\x34\\x6e\\xa8\\xdc\\xba\\x01\\xce\\xab\\x5d\\xbb\\x89\\x87\\xf8\\xfa\\xe2\\x1e\\x60\\xf0\\xf6\\xeb\\xd9\\x99\\xba\\xd9\\xa6\\xbf\\xa7\\x68\\x40\\x32\\x42\\xe4\\xe8\\xb1\\xae\\x20\\x94\\xec\\x01\\x5c\\x96\\xe7\\x62\\x20\\x94\\xe4\\x73\\xe8\\x17\\x8f\\x23\\xe5\\x11\\x50\\x93\\xd8\\x9f\\xb4\\xff\\x0a\\x41\\x43\\xaf\\x84\\x5f\\x04\\xf3\\x7a\\xbc\\xf1\\x6c\\xcc\\x64\\xcd\\x29\\x29\\xb9\\x27\\x43\\xc8\\x9d\\x57\\xad\\xe4\\x41\\x20\\x6d\\x3b\\xfa\\xe9\\x26\\x31\\xd5\\x64\\xab\\xf8\\xfd\\x79\\x7e\\xf4\\xe4\\x9d\\x4c\\x78\\xe0\\x7e\\x77\\x3a\\xef\\x55\\xd5\\xcf\\xfc\\x11\\xaf\\xba\\xa9\\x6b\\xd9\\xbe\\x53\\xa2\\x7a\\x90\\xc8\\xe2\\xd5\\x08\\x77\\x57\\x60\\x6a\\x77\\x93\\x8b\\x35\\x0c\\x00\\x3f\\x2b\\xfa\\x9e\\x74\\x47\\x6b\\x82\\x37\\xbd\\x1e\\x0d\\x82\\x99\\xf5\\x52\\xe7\\x2e\\x5a\\x18\\x67\\x63\\xf0\\x56\\x0f\\x64\\x06\\x8f\\x37\\x47\\x16\\x55\\x45\\xd9\\x3d\\xab\\x7f\\xe5\\x40\\x1e\\x64\\xf0\\x67\\x32\\x09\\xc9\\x24\\xdb\\xa0\\x94\\x63\\x5a\\x50\\xbe\\xe1\\xc9\\xa7\\x4e\\xdc\\x72\\x6f\\x5b\\x79\\x02\\x79\\xc4\\xb6\\x85\\x1b\\x4d\\x99\\xde\\xc5\\x1c\\x81\\x8d\\x21\\x92\\x0b\\x53\\x64\\xd7\\x2b\\x6f\\xf9\\x71\\x1d\\x04\\xa2\\x28\\x1c\\xfd\\x4e\\x7a\\x63\\x55\\xd5\\x77\\xbc\\x8f\\x6d\\xce\\xcc\\xb9\\x09\\x1d\\x08\\x6b\\x32\\xcf\\xa2\\xf3\\x59\\x7a\\x21\\xf9\\xdc\\x18\\xb3\\x73\\xfd\\x32\\x52\\xff\\x68\\x82\\x27\\x2b\\x9a\\x6b\\xcc\\xf8\\x01\\xce\\xe3\\xa8\\xf9\\x58\\x0b\\xa4\\x17\\x6f\\x40\\x93\\xf8\\xc8\\xa6\\x66\\x44\\xf7\\x9e\\x55\\x4e\\xb2\\x24\\x41\\x32\\xa3\\x5e\\x03\\x0b\\xf3\\xdc\\x9b\\xcb\\x69\\x14\\xcc\\xd1\\xda\\x39\\xc5\\xc4\\xaa\\x3c\\x25\\x0c\\x76\\x1e\\x95\\x06\\xa0\\x28\\xfa\\x80\\x2b\\xb0\\xea\\x9d\\x02\\xbf\\x85\\xde\\x19\\x1e\\x69\\x41\\xbf\\xd6\\xb0\\x35\\xcf\\x74\\x4d\\x3f\\x2e\\x41\\x14\\xe9\\x26\\x4b\\xa7\\x95\\xb4\\x77\\xcb\\x62\\x57\\x42\\x21\\x84\\xc0\\xd1\\xab\\x2a\\xbc\\xdd\\xab\\x9b\\xd9\\x33\\x0f\\xad\\xda\\x2d\\x44\\x9a\\xa2\\x36\\x8d\\x26\\xa3\\x04\\x78\\x48\\x45\\xb7\\xd7\\xe0\\x84\\xf3\\x6b\\x57\\xfe\\x38\\xf8\\x71\\xe5\\xae\\x56\\x32\\x01\\xd1\\x7c\\x0e\\xae\\x5f\\xe5\\x2f\\x88\\xfd\\x32\\x5f\\x95\\x85\\xdb\\x7f\\xe5\\xa9\\xb3\\xe3\\xf0\\x55\\x0e\\x7d\\x70\\x20\\x7f\\x6d\\x2f\\x0d\\xf5\\xb3\\xb9\\x7d\\x06\\x90\\x02\\x39\\x0f\\x8e\\x8e\\x7e\\x1a\\x14\\xf9\\x7a\\x15\\x88\\x33\\x6f\\xb9\\x04\\x05\\xfe\\x74\\xfe\\x86\\xeb\\x7f\\x5b\\x28\\x8d\\x33\\x7b\\x51\\xe0\\xa1\\xfc\\x83\\xff\\x0b\\x00\\x00\\xff\\xff\\x5e\\x87\\x38\\xfe\\x9a\\x48\\x00\\x00\")\n\nfunc uiJsLibsMithriljs020MithrilMinJsBytes() ([]byte, error) {\n return bindataRead(\n _uiJsLibsMithriljs020MithrilMinJs,\n \"ui/js/libs/mithriljs/0.2.0/mithril.min.js\",\n )\n}\n\nfunc uiJsLibsMithriljs020MithrilMinJs() (*asset, error) {\n bytes, err := uiJsLibsMithriljs020MithrilMinJsBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/js/libs/mithriljs/0.2.0/mithril.min.js\", size: 18586, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiJsLibsMithriljs020MithrilMinJsMap = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\xac\\xbc\\x5b\\x53\\xea\\x4e\\xdb\\x27\\xfc\\x5d\\x56\\xdd\\x67\\x5a\\x8f\\xa2\\xe2\\xe6\\x7e\\x8f\\x92\\x4e\\x08\\x31\\x46\\x84\\x88\\xc8\\x7a\\x6b\\x6a\\x0a\\x21\\x42\\xd8\\x04\\x0c\\x01\\xd1\\xa9\\xf9\\xee\\xd3\\xd7\\xef\\xd7\\x21\\x41\\x5d\\xff\\x7b\\x3d\\x53\\xb3\\x0e\\x96\\x49\\x77\\xa7\\x37\\xd7\\x7e\\xd7\\xfc\\xaf\\x5f\\xdb\\x38\\x5b\\x27\\xcb\\xf4\\xd7\\xbf\\xcf\\x8f\\x7f\\xbd\\x26\\xf3\\xf8\\xd7\\xbf\\x7f\\x2d\\x92\\x7c\\x92\\x25\\xf3\\xff\\x5a\\x24\\xe9\\x7f\\x4d\\xd7\\xbf\\x8e\\x7f\\xad\\x97\\x9b\\x6c\\x18\\xaf\\x7f\\xfd\\xfb\\xff\\xdf\\xf7\\xe9\\xf6\\xff\\x71\\xfc\\x2b\\x1d\\x2c\\x4c\\xb3\\x1e\\x35\\x58\\xad\\xf4\\xff\\xef\\x49\\x3a\\x5a\\xbe\\xeb\\x87\\x4d\\x3a\\x8a\\x5f\\x93\\x34\\x1e\\xe9\\xe7\\x24\\x4d\\xf2\\x64\\x30\\x4f\\x3e\\x63\\xfd\\xf2\\xaf\\xd1\\x72\\xb8\\x59\\xc4\\x69\\xae\\x9f\\x2b\\x8f\\xff\\x9a\\x2f\\x87\\x83\\x5c\\xb6\\x72\\xfc\\xab\\xf2\\xf8\\xaf\\xe1\\x20\\x1d\\xc6\\x73\\x2b\\x4d\\x16\\x68\\x6a\\x64\\x7a\\x4d\\xdd\\xfe\\xa7\\xe6\\x79\\x3c\\xc8\\x1e\\x93\\x45\\xbc\\xdc\\x60\\xd2\\x2c\\x7e\\xdb\\xc4\\xeb\\xfc\\xdb\\xb8\\x3f\\xb5\\xaf\\xe3\\xbc\\xfc\\x5a\\x77\\x0d\\x27\\x72\\xb2\\x6c\\x0c\\x30\\xcc\\x93\\x21\\x97\\x9e\\xcf\\xd9\\x8a\\xbd\\x4b\\xd7\\x64\\xb0\\xb6\\xf2\\x3c\\x93\\xc7\\xfc\\x63\\x25\\x83\\x5a\\xf6\\xad\\xab\\x1e\\x65\\x98\\x69\\x1f\\xce\\x07\\x6b\\x0c\\xba\\x37\\x3b\\x8d\\x31\\x4b\\x3e\\x18\\x17\\x9d\\xb1\\x0c\\x8b\\x1e\\x3b\\xfe\\xbd\\xa7\\x1f\\xdc\\x2c\\x5b\\x66\\xfa\\xef\\x6a\\x90\\xad\\x63\\x79\\x88\\x77\\xf1\\x50\\x60\\x29\\x00\\x5d\\x6d\\xd6\\x13\\xf4\\x25\\x99\\x59\\xe2\\xa1\\x18\\x36\\x9c\\x24\\xf3\\x51\\x16\\x03\\x8c\\x71\\x3a\\xce\\x65\\x9c\\xd5\\xe9\\x58\\x7d\\x33\\xd0\\x2c\\xaf\\x77\\xdc\\x7a\\x4f\\x1f\\xb2\\xe5\\x2a\\xce\\xf2\\x0f\\xdd\\x30\\x5d\\x26\\xf2\\xcd\\xcb\\x46\\x7f\\xce\\x65\\xf5\\xd9\\xdc\\x79\\x6c\\xd0\\xc3\\xf7\\x47\\xec\\x96\\xcf\\x6a\\x30\\x9c\\xc4\\xfb\\x37\\x5f\\xa3\\x7b\\x27\\x18\\x1d\\xe4\\x03\\xc0\\x48\\x77\\xca\\x3c\\xeb\\xc9\\x72\\x33\\x1f\\x75\\x62\\xbd\\xf4\\x00\\xc0\\x4c\\xcc\\xc0\\x78\\x94\\xe4\\x83\\x97\\xb9\\xcc\\x00\\x32\\x5a\\x0d\\x08\\xdc\\x65\\xfa\\x9a\\x00\\xdc\\xf9\\x32\\xca\\xb3\\x24\\x95\\x05\\x81\\x99\\xcd\\x4b\\x9e\\xc5\\xf1\\x7e\\xee\\x47\\xc2\\x59\\xd6\\x33\\x8f\\xe9\\x72\\x04\\x10\\x2e\\x5f\\x5f\\x35\\x1a\\xe5\\xb3\\x74\\x54\\x90\\x04\\x67\\x5e\\xe7\\xd9\\x66\\x98\\x03\\xac\\x09\\xe1\\xc3\\x76\\x4d\\x6d\\x24\\xe0\\xf9\\x07\\x76\\xa8\\xb7\\x9a\\x73\\x49\\x2b\\xcb\\x06\\x1f\\x6a\\xb9\\x01\\x0c\\x1c\\xf7\\xce\\x7d\\xf4\\x5b\\xf7\\xfa\\xd1\\xbf\\x8f\\xdc\\x8e\\x79\\x0e\\x5b\\x4f\\x2e\\xf0\\x93\\xac\\x73\\xee\\x97\\x87\\x0e\\x07\\x32\\x53\\x92\\xfa\\x23\\x0d\\x1f\\xcd\\x00\\xd8\\xdc\\x2c\\x96\\x25\\xf4\\xfc\\x24\\xef\\xf1\\x06\\xf8\\x9c\\xb2\\x67\\xed\\x24\\xaf\\xaf\\xc4\\x22\\xce\\xa8\\x48\\x23\\x72\\x46\\xf3\\xf8\\x9a\\x2d\\x85\\xd7\\xe2\\x3d\\x5e\\x86\\x99\\x06\\x6d\\x5c\\xe2\\x89\\x33\\xcb\\x4a\\x2b\\x8d\\x5b\\xd0\\xc3\\x20\\x1d\\xc7\\x64\\xe3\\x2c\\x37\\x7f\\xd4\\xbe\\x31\\x8d\\xdf\\x55\\x81\\x2b\\x1c\\x76\\xff\\x89\\x0c\\x5d\\x19\\x92\\x1f\\x6d\\x16\\x0b\\x82\\x46\\x13\\x59\\x6e\\xc7\\xaf\\xcb\\x2c\\x2e\\x68\\xed\\xde\\x80\\x1d\\x5b\\x2e\\x40\\x95\\xe4\\xb1\\xec\\xf3\\x5f\\x1a\\xe0\\xeb\\x1c\\x93\\x0b\\x76\\xf6\\xd4\\x72\\xcf\\x17\\xd0\\x42\\xeb\\x55\\x3f\\x6d\\x93\\xf8\\x7d\\x4d\\x64\\xe4\\xd9\\x72\\x3e\\x8f\\xc1\\x33\\xd2\\x2a\\xb3\\x2c\\xb3\\x64\\x9c\\xa4\\x83\\xf9\\xc1\\x80\\x82\\xe2\\xb2\\x78\\x94\\x0d\\x64\\x98\\xc6\\xae\\x06\\xc5\\xf8\\xe3\\x60\\x14\\x56\\x06\\x20\\x56\\x9a\\x1c\\x34\\x7a\\x3a\\xe4\\x7c\\x10\\x4a\\xba\\x49\\xe7\\xcb\\xc1\\x08\\xd2\\x4a\\x1e\\xb8\\xaa\\x3e\\xfd\\x88\\x5f\\x0a\\xe0\\x85\\x65\\x03\\x8d\\x1a\\xe1\\xe9\\x97\\x69\\x0c\\xc2\\x98\\xf1\\x5d\\xf3\\x90\\xe9\\x21\\xd5\\x2a\\xbd\\x6a\\xbc\\xcb\\xb1\\x27\\x41\\xbc\\x7e\\x68\\x74\\xef\\x95\\x21\\x93\\x55\\x16\\x6f\\xf5\\xd1\\x9d\\xf8\\x75\\xb0\\x99\\x03\\x46\\xeb\\x7b\\x1c\\x6f\\xb7\\x98\\x03\\x61\\xc9\\xfa\\x2b\\x3e\\xef\\x23\\x8a\\x24\\xd9\\x43\\xf2\\xb2\\xc9\\xe3\\x02\\x44\\xba\\xaf\\xc2\\x3f\\xff\\x5a\\x82\\x65\\xb7\\x83\\xf9\\x26\\x2e\\x06\\x60\\x1b\\x22\\xa9\\x5e\\x06\\xc3\\x19\\x40\\x2d\\x7b\\x6f\\x3e\\x86\\x77\\xfb\\x45\\x1e\\xf5\\x20\\x83\\x08\\x41\\x8e\\x11\\x0c\\xdb\\x65\\x32\\x32\\xcb\\xaf\\x8b\\x49\\x81\\x22\\xa1\\xac\\x6d\\x85\\xd2\\x92\\x34\\x8d\\x33\\x33\\xa1\\x7c\\x5f\\xe1\\xc2\\x27\\xb3\\x13\\x91\\x04\\x2f\\x15\\x38\\xee\\xc9\\x64\\x54\\xbc\\x15\\x3d\\x07\\x1d\\xf2\\xe5\\x46\\xb3\\x69\\x81\\xd8\\x6c\\x83\\x63\\xae\\xf3\\x8f\\x79\\xfc\\x05\\x20\\xdf\\x20\\xa4\\x5f\\xb5\\x30\\x59\\x0f\\xc6\\x94\\xf2\\x8b\\xe5\\x36\\x56\\x13\\x8a\\xb4\\x3d\\xb2\\x87\\xa6\\x21\\xd5\\x00\\x88\\x92\\x97\\x39\\x99\\x36\\x59\\x57\\xa4\\xdd\\x5c\\x4b\\xa3\\x89\\x06\\x2b\\xc8\\x80\\x54\\x6f\\x8d\\xa6\\xba\\x31\\x2d\\x60\\xb8\\x2c\\x88\\x01\\x58\\xc5\\xf6\\x06\\x9a\\xb1\\x96\\x8b\\xd5\\x26\\x2f\\x94\\x97\\xa6\\xb8\\x46\\x92\\xad\\xbf\\xb4\\x8e\\xe3\\x5c\\xb8\\x19\\x6c\\x17\\x40\\x1c\\x08\\xcc\\x0a\\x71\\xaa\\x7b\\x73\\x4d\\x87\\xf8\\x1f\\xb3\\x92\\xd5\\xf2\\xe5\\x6d\\x44\\x32\\x1a\\x88\\xaa\\xd2\\x9d\\xd4\\xa6\\x43\\x3d\\xf5\\x32\\xe5\\x0e\\xf2\\x09\\x49\\x28\\xcf\\x84\\x53\\xb4\\x0e\\x5b\\x41\\x8d\\x0d\\xb1\\x7a\\xfc\\x90\\xc5\\x1d\\x40\\xb4\\xb9\\x5c\\x0a\\x45\\x64\\xcb\\x65\\x6e\\xfe\\xac\\xab\\x13\\xc9\\xcb\\xbf\\xfe\\x65\\x74\\x9e\\x66\\x56\\xc2\\xa0\\x98\\x64\\xb9\\xce\\x0f\\x66\\xd1\\x8a\\xcb\\x34\\xf8\\xa3\\x83\\x57\\xa5\\x69\\x4f\\x54\\xa9\\xc8\\xcd\\x41\\x4e\\xca\\xc8\\x16\\x30\\x02\\x3a\\x4b\\x22\\x2a\\x33\\x7f\\x17\\x46\\x82\\x2c\\x48\\x8c\\x68\\xb6\\x3f\\x0a\\x22\\xc2\\x2b\\x35\\x21\\x94\\x19\\xde\\x1f\\x04\\x0a\\xf2\\x8d\\x66\\xe6\\xec\\x23\\x12\\xd0\\xff\\x32\\xba\\xb2\\xcd\\x16\\xa3\\x3a\\xb4\\x0c\\x5f\\x83\\xa2\\x16\\x46\\x32\\x41\\xa9\\x63\\xbe\\x4e\\x3c\\x76\\x77\\x2b\\x1c\\x12\\xf8\\x16\\x08\\x6a\\xc9\\x50\\x10\\x3d\\xc8\\x33\\x1e\\xea\\x3d\\x75\\x3b\\xbe\\xaa\\x80\\x19\\x1b\\xe8\\xa6\\xcb\\x17\\x11\\x6e\\x9a\\x25\\x0c\\xc8\\x89\\x4a\\x8d\\x9a\\x01\\x9f\\xde\\x27\\x09\\x14\\x9e\\x96\\x05\\x9b\\x2c\\x2d\\x4e\\x33\\xdc\\x64\\x54\\xa4\\xd9\\x18\\x3a\\x6a\\x9d\\x0d\\x4b\\xb2\\x5b\\x6b\\x4d\\x85\\x6f\\xf2\\x65\\x77\\xa5\\x15\\xb3\\x1a\\xac\\x0d\\xc1\\x47\\x43\\x11\\x67\\x94\\x39\\x32\\x60\\x8d\\xf7\\xc7\\xe5\\x2f\\xa3\\xb1\\x0f\\x0f\\xad\\x45\\xcd\\x6b\\x02\\x6d\\xbc\\x11\\x09\\x3e\\xa0\\xe0\\x20\\x1c\\x70\\x36\\xc3\\xab\\x71\\xfa\\xd3\\xf1\\xe2\\xd1\\x66\\x48\\x3e\\x5a\\x2c\\xc1\\x2d\\x83\\xcc\\xca\\xf7\\xa0\\x34\\x2b\\x68\\xcb\\x03\\x73\\xea\\xf9\\xf3\\x82\\x2a\\x49\\x30\\xd4\\xbd\\xc3\\x92\\xba\\x87\\x05\\xb1\\xff\\xa2\\x52\\x4a\\x5e\\x3f\\xf8\\xb4\\x48\\xd6\\xd4\\x02\\xb0\\x0e\\x0b\\x08\\xe5\\x13\\xa8\\x65\\x3d\\xd1\\x72\\xbe\\x25\\x17\\x1b\\x4e\\xd3\\xa2\\x33\\xd6\\xd0\\x83\\x59\\xb1\\x19\\x6a\\x8b\\x74\\xad\\x4a\\x01\\xf7\\x3a\\x48\\xe6\\x9b\\x2c\\xae\\xb6\\xe8\\x89\\x09\\xac\\x9c\\x04\\xd8\\x71\\xc5\\x26\\x73\\x1d\\xc3\\xfa\\x20\\x86\\x15\\xb0\\xbc\\x9f\\xb7\\xe3\\x46\\xad\\xbb\\x27\\x0c\\x31\\x1b\\xac\\x6e\\x2b\\x2d\\x0c\\x96\\x65\\xfe\\x58\\xbc\\x56\\x16\\x1c\\x1a\\x12\\xd3\\x90\\x34\\xc6\\xdb\\x6b\\x92\\x95\\x0b\\xd3\\xae\\xe3\\x0a\\x7c\\x5e\\xc7\\x73\\x91\\xac\\x82\\x8d\\xc2\\xdc\\x4b\\x68\\x2c\\xc0\\x48\\x98\\x0e\\x04\\x87\\xcb\\x55\\xa1\\xd1\\xf3\\xe5\\xdd\\xf2\\x7d\\x4f\\x15\\xbb\\x89\\x8c\\x7f\\x0e\\xef\\x9a\\x79\\xbe\\x32\\x5a\\x0d\\xc3\\x01\\x3e\\x4d\\x87\\x93\\x25\\xa4\\x1e\\x84\\xc1\\x66\\x6d\\x58\\x68\\xbd\\x7e\\x5f\\x66\\x23\\x6c\\x52\\x2b\\x81\\xd1\\x07\\x60\\xb3\\x57\\xf8\\x68\\x8a\\x0c\\xb8\\xa4\\x6b\\x43\\x3d\\x69\\x04\\x67\\xbe\\xa7\\x5a\\x2d\\x7e\\x0a\\x7b\\xde\\xc8\\x25\\x92\\x06\\x71\\xab\\x49\\xc0\\x6c\\xa8\\x19\\x0f\\x28\\x3f\\x34\\x87\\x57\\xbe\\x01\\xa3\\xfe\\x2a\\xf4\\x26\\x10\\xf1\\xf1\\x12\\x3f\\xe3\\x44\\x0d\\x2d\\x26\\x1c\\x5a\\x91\\x6b\\x63\\xc1\\x19\\x10\\x93\\x9c\\xc6\\x34\\xd1\\xf5\\x53\\xb8\\x17\\x08\\x18\\x96\\x69\\xbd\\x0d\\xeb\\x48\\x33\\x47\\xb2\\x22\\x29\\xaf\\x57\\xe6\\x8f\\x86\\x20\\x14\\x9e\\x50\\xbd\\x01\\xb5\\x66\\x3d\\x61\\x9f\\xe5\\x08\\xc0\\x5e\\x89\\x7d\\x50\\xa8\\x8a\\x17\\x6d\\x99\\x98\\x3d\\x68\\x30\\xb7\\xf6\\x18\\x80\\xb4\\xa9\\x30\\x41\\x29\\x8a\\xbb\\x00\\x73\\xbe\\x9c\\xc5\\x18\\x38\\xc9\\x17\\xb0\\xdc\\x8c\\x7f\\x63\\xd4\\x6c\\xf1\\x5a\\x72\\xbc\\x11\\x3d\\xc5\\xba\\xda\\xae\\x1a\\x6a\\x29\\x0d\\xfd\\x4c\\x65\\x91\\xac\\x1d\\xf3\\x51\\x87\\xf2\\x1a\\x16\\x95\\xfe\\xbb\\x67\\xf6\\x7c\\xb9\\xaa\\xb2\\x6f\\xa3\\x63\\x85\\xee\\xff\\xb4\\xbb\\x8e\\xe7\\x3e\\x52\\xa6\\x52\\x7b\\x16\\x16\\x0e\\xe6\\x7c\\xa0\\x2d\\x62\\x58\\xe9\\xa5\\xaa\\x44\\x8c\\x80\\xfa\\x22\\x11\\xb4\\x40\\xe7\\x6a\\xd8\\x21\\x44\\xc7\\xe8\\x50\\xab\\x2d\\x40\\xac\\xef\\xda\\x3f\\x34\\x2a\\xbc\\x78\\xac\\x30\\xc8\\xf8\\x50\\x51\\x9b\\xa5\\x0a\\x75\\x20\\xf2\\x3d\\x2d\\xdc\\xb3\\x91\\xe6\\x9c\\x21\\xad\\x24\\x63\\x31\\x15\\xc3\\x46\\x87\\xaf\\x74\\x4e\\xf5\\xc3\\x5c\\x9b\\xdf\\x71\\x8a\\x03\\x0e\\x46\\x23\\x57\\xce\\x77\\x57\\x69\\x82\\xff\\xe1\\x1a\\x5d\\xbd\\x25\\xa1\\x4c\\xb4\\x9c\\xfc\\x55\\x98\\x09\\x5f\\xbf\\x18\\xc5\\xd5\\x2f\\xb4\\x2d\\x50\\xac\\x08\\x22\\x28\\xac\\x4f\\x73\\x86\\x07\\x92\\x62\\xe1\\xed\\x00\\xa9\\xcd\\x44\\x94\\xf7\\x87\\xab\\x4d\\x51\\xa1\\xb0\\x09\\x5f\\x7f\\xd1\\x7b\\x2b\\x98\\x4c\\xf3\\xfa\\x3c\\x2e\\x68\\x49\\x66\\xf8\\x48\\x87\\xe6\\xcf\\x24\\x5b\\xa6\\x9a\\xb2\\xc0\\xb7\\xcb\\x75\\x29\\x12\\x47\\x7c\\xd4\\x30\\x00\\x73\\x6e\\x72\\xcd\\xa8\\x30\\x6d\\x7f\\xed\\xfd\\x5a\\x21\\x61\\x0d\\xf2\\x71\\xc1\\x1a\\xc9\\x5a\\xb8\\xf4\\x41\\xf0\\xb6\\xd3\\x56\\x32\\x00\\x3b\\x5d\\x2f\\xd3\\x15\\x08\\xe3\\x3d\\x1b\\x94\\x0f\\x11\\x25\\xeb\\xfe\\xbd\\x10\\x4c\\x05\\x13\\x01\\x32\\x2b\\xaa\\x6b\\x23\\x78\\x87\\xe6\\x5c\\xf1\\x6e\\xa5\\x7d\\x0b\\xea\\x4d\\x71\\xfd\\x05\\xec\\x8b\\x91\\x04\\x0a\\xb4\\x9c\\x5d\\xe9\\x0d\\xae\\x7f\\xfd\\xfb\\xd7\\xff\\x87\\x7f\\x96\\xfe\\x77\\xec\\x59\\x96\\xcf\\xff\\x8f\\xdb\\x96\\xd5\\x55\\x78\\x54\\xc7\\xae\\x65\\xb5\\xe5\\xb9\\x77\\x65\\x4b\\x7b\\x84\\xf6\\x5e\\x43\\xff\\xaf\\x52\\xdb\\x93\\xee\\x7e\\x53\\xfe\\x6f\\xf9\\xc7\\x91\\x34\\xe1\\x8b\\xfe\\x1d\\x9a\\xc2\\x4a\\xd3\\xbb\\xfd\\x80\\xb6\\xf6\\xf1\\xda\\x96\\xb7\\x0e\\xde\\xa2\\xe3\\x81\\xa5\\x6e\\x1c\\x8c\\xf8\\xb0\\x9f\\xd0\\xd6\\x3b\\xde\\xd8\\xf2\\xf6\\x8c\\xb7\\xfe\\x71\\xcf\\x5a\\xd8\\x53\\x17\\x8b\\x8f\\x8e\\x03\\x4b\\x75\\xf4\\xda\\x81\\x1f\\xeb\\xff\\xef\\x2c\\xa5\\x1b\\x64\\xaf\\xa1\\x65\\x85\\x78\\x0e\\x94\\x1e\\xaf\\x32\\xbd\\xa6\\x6f\\x59\\x6b\\x5b\\x3a\\x9e\\x6f\\x65\\xa2\\x40\\x1a\\x86\\x01\\x1e\\x9b\\x18\\xd9\\x60\\xb3\\x1e\\xd1\\x0e\\xe5\\x50\\xfd\\xe3\\x96\\x5e\\xe2\\x5e\\x1e\\x31\\x38\\x04\\x1c\\xac\\xfd\\x7b\\xa4\\x67\\xb6\\x06\\xfb\\x77\\x75\\xd2\\x6c\\x01\\x3a\\x38\\x7e\\xef\\xb6\\x98\\x4d\\xed\\xec\\xb6\\x3c\\x8f\\x6d\\x7d\\x7a\\xab\\xe7\\xc8\\xf8\\x36\\xa6\\x3a\\xee\\x5b\\xea\\x4a\\xb9\\x68\\xc0\\xfe\\xb0\\x78\\xab\\x79\\xdc\\xb5\\xd4\\x8b\\x2f\\x53\\x3e\\x4b\\xab\\x7f\\xff\\x7d\\x93\\x01\\x20\\x21\\xab\\xc9\\x63\\x88\\x61\\x4a\\xf6\\x1b\\x1e\\x5f\\x3b\\x96\\x9a\\x3b\\x98\\x69\\x84\\x11\\x31\\xe0\\x46\\x68\\xbc\\x16\\x9f\\xab\\x13\\x5b\\xd6\\x4d\\x6c\\x69\\x7e\\x71\\xa4\\x19\\xb3\\xe8\\xf3\\xe0\\x51\\x90\\xdd\\xc5\\x60\\xec\\x2c\\x7c\\x66\\x73\\x4b\\x76\\x2c\\x0d\\x09\\x40\\xf9\\x52\\x8e\\xee\\x73\\x74\\x03\\xa0\\x8f\\x00\\x94\\xa9\\xbd\\xff\\xa8\\xfe\\x87\\x8f\\x78\\x86\\x10\\x7b\\x9b\\x9b\\xe1\\x6d\\x4b\\x7d\\x62\\xf8\\x12\\xc3\\x27\\x76\\x39\\xde\\x23\\x5e\\x94\\xde\\x05\\xb6\\xef\\x2f\\xf0\\xa7\\xa5\\x0c\\xc8\\x65\\x9a\\x89\\x5d\\x0c\\x57\\x53\\xd5\\xc5\\x46\\xb8\\xa9\\xde\\x1e\\xed\\xa1\\x55\\x42\\xd1\\x3c\\x16\\x48\\xf5\\xf5\\x93\\x3f\\x07\\x92\\x7c\\x60\\x66\\x6d\\xaf\\x6c\\x03\\x07\\x6c\\x06\\x24\\xbe\\xb6\\x0d\\x46\\x5d\\xcb\\x5d\\x39\\xfc\\xba\\xa7\\xd1\\xeb\\xcc\\x6c\\x99\\x64\\xc5\\x2d\\x6b\\xde\\x68\\xcb\\x28\\xee\\xc8\\x20\\x70\\x86\\x97\\x08\\x64\\xe6\\xea\\x47\\xb5\\x55\\x0d\\xb6\\x78\\x96\\xf7\\x68\\xe9\\xb3\\x79\\x53\\x20\\x05\\xb3\\xfa\\x9e\\x3c\\xf6\\x27\\x72\\x4c\\x55\\x40\\x42\\x83\\x31\\xb6\\xac\\xd8\\x11\\x34\\xca\\x52\\x82\\xb6\\x57\\x19\\xbd\\xc4\\x1e\\x53\\x9b\\xe8\\x1c\\x63\\x2f\\x1f\\x40\\xfc\\xca\\x6c\\x82\\x8d\\x6a\\xee\\xfe\\xae\\x00\\xfe\\xa9\\xd2\\x93\\xda\\xa3\\x0a\\x1e\\xc7\\x36\\x01\\xee\\x5b\\xee\\x8f\\x1d\\xe5\\xa4\\x9a\\x05\\x57\\x42\\x80\\x0d\\xff\\x37\\xe8\\xb9\\x0b\\xe6\\x91\\x0d\\x78\\xbf\\x2b\\xdf\\x29\\x12\\x1d\\x80\\xd8\\x1e\\xf2\\x98\\xa1\\xe5\\xd6\\x1c\\xcc\\xe4\\x76\\xc0\\xd5\\x09\\x26\\x0f\\x81\\xd4\\x98\\xa8\\xc5\\xff\\x83\\xca\\xff\\x61\\x21\\x89\\x80\\x07\\x65\\x48\\xdc\\x05\\xf3\\xf3\\x03\\xcf\\x3a\\xb3\\xeb\\x80\\x39\\xc9\\xae\\x03\\x4e\\x5e\\x18\\x10\\x11\\xed\\xad\\xe3\\xa1\\x90\\x19\\x25\\x51\\xc9\\x81\\x6d\\x80\\x9e\\x12\\x09\\x80\\x17\\xf1\\x66\\xbd\\xd9\\xc2\\xf0\\x53\\xf3\\x69\\x24\\x5b\\xa5\\x40\\x69\\xc9\\x48\\x95\\x83\\x66\\x7d\\x90\\xfe\\x60\\xa5\\x2a\\x28\\xbf\\xc6\\x79\\x22\\x30\\x48\\x2f\\xab\\xf6\\x5c\\xca\\xa9\\xd5\\xa7\\x03\\x59\\x24\\x53\\x3d\\x01\\x40\\x33\\x1b\\x90\\xe3\\xd9\\xbb\\x42\\xee\\x37\\x68\\xe7\\x10\\x41\\x97\\x6a\\x62\\x8b\\xf8\\x3f\\xc6\\x86\\xfa\\xe8\\x6c\\xc9\\xe0\\xac\\x90\\xd5\\xb2\\x2a\\x90\\xdb\\x16\\x69\\xa4\\xa6\\x36\\x44\\x41\\x08\\xea\\xee\\x36\\x40\\x37\\x24\\xee\\x76\\x54\\x02\\x50\\xcb\\x5b\\x8d\\xba\\x56\\x2e\\x47\\xd3\\xa2\\xf8\\x83\\xc8\\x20\\x2f\\x73\\x91\\xb0\\x46\\x01\\x7b\\x56\\x6a\\x03\\x2b\\x24\\x29\\xf4\\xeb\\xf6\\x61\\x57\\xdb\\x72\\x6f\\x9c\\x17\\x30\\x29\\xe7\\x05\\xea\\xc3\\x91\\x59\\x49\\xb6\\x2c\\xa2\\xc5\\xad\\x2b\\x08\\x52\\x40\\xcf\\xc7\\x06\\x03\\x4d\\x55\\x5a\\x40\\x8e\\x20\\xb2\\xb8\\x1d\\x2b\\x00\\xc0\\x0b\\x46\\x68\\x09\\xcb\\x79\\x1d\\xf3\\x49\\x79\\x1a\\x01\\x82\\xbb\\xb5\\x89\\x4f\\xe9\\x3c\\xa5\\xb0\\x90\\x3e\\x8f\\xd4\\x43\\x59\\xa3\\x29\\x5f\\x6f\\xa9\\x7f\\x81\\x97\\x5b\\x70\\x4d\\x24\\xec\\xa4\\x79\\xf2\\xfc\\x1b\\x9a\\xac\\x80\\x74\\xd4\\xae\\x81\\x51\\x6a\\x36\\x61\\x46\\x6a\\xd0\\x72\\xa8\\x05\\x00\\x6a\\x11\\xdf\\x5d\\x81\\x5b\\xaf\\xec\\x04\\x03\\xad\\x6f\\x2b\\x0e\\x5e\\x0a\\xfe\\x7e\\x74\\x48\\x41\\x7d\\xcc\\x15\\x99\\xed\\x3f\\x43\\x51\\x74\\xcb\\x1d\\xb6\\xc7\\x6a\\x2f\\x6f\\x5a\\x2b\\x97\\x14\\x5e\\x9e\\x06\\x42\\x94\\xaa\\x59\\x34\\x90\\xc6\\x3f\\x78\\x3e\\x06\\x62\\xce\\x6c\\x36\\x81\\x0e\\x08\\x02\\x6c\\xd9\\x9f\\x14\\x8b\\xc9\\x02\\x67\\xd8\\xea\\x8d\\x91\\x12\\x2d\\x8a\\x8e\\xb0\\x7c\\x13\\xd9\\xfb\\x09\\x05\\x33\\x06\\xee\\xb7\\xf6\\xc7\\xd7\\x3e\\x41\\xfb\\x52\\xf4\\x8e\\x4a\\x1d\\xa7\\x5c\\xf9\\x9c\\xd2\\x28\\xfa\\xfc\\xe3\\x78\\x21\\x13\\xd9\\x03\\xd4\\x9c\\x00\\x4f\\x88\\x62\\x28\\x12\\xa5\\xee\\x14\\x80\\x72\\x9c\\x01\\x68\\x48\\x66\\x6c\\xbc\\x94\\x47\\xf9\\x2b\\x6c\\x9e\\x93\\x1f\\xa6\\x7b\\x2c\\xfa\\x7b\\x82\\x0e\\x92\\xea\\xd9\\xae\\xb1\\x76\\x66\\xbf\\x7f\\xed\\x33\\x7b\\x15\\x12\\x13\\x06\\xab\\x39\\x25\\x6d\\x79\\x25\\x69\\xbd\\xfc\\x71\\x33\\x83\\x2a\\x69\\x9d\\x70\\xc0\\x11\\xf7\\x51\\xbe\\xc9\\x5a\\x5b\\xe7\\x87\\x7d\\x94\\x7d\\x25\\xcc\\x06\\xf5\\x3f\\xf4\\xc1\\x50\\x19\\x0a\\xb1\\xb8\\x22\\xb6\\x27\\x9e\\x9e\\xd0\\x6f\\x18\\x69\\xa1\\xbf\\xd0\\xbc\\x50\\xaa\\xcf\\x60\\x7f\\xa4\\x29\\x76\\xe3\\x4f\\x94\\xd9\\xbc\\xd8\\x27\\xbd\\x0a\\x81\\x9c\\x02\\x86\\x03\\x41\\x6f\\x4d\\xed\\xd5\\x13\\xc4\\xac\\xd5\\xc7\\x47\\xa9\\x4d\\x90\\x02\\x16\\x1f\\x36\\x88\\xd5\\x1a\\x70\\x42\\x83\\x76\\x3f\\x41\\x63\\x6f\\xae\\x2a\\xf0\\xf5\\x01\\x96\\x9c\\x5b\\xe4\\x57\\xbd\\x4f\\x80\\x21\\x3a\\x25\\x12\\x6b\\x7c\\xfb\\x70\\x8a\\x3e\\x73\\xd4\\x00\\x26\\xa5\\x19\\x51\\x1e\\x3f\\x80\\x0c\\x6c\\xf8\\xdc\\xb0\\x7e\\x7e\\x29\\x41\\x40\\x51\\x29\\x8d\\xaf\\x25\\x0a\\x5f\\xff\\x9b\\xd2\\xe1\\x6f\\xe9\\x49\\x79\\x7f\\x47\\x4e\\x37\\x76\\x69\\x6c\\x87\\xf5\\x3f\\x0c\\xf6\\x44\\x05\\xe3\\x10\\x91\\xd8\\x25\\xce\\x23\\xad\\x06\\x20\\xf9\\x85\\x0c\\x04\\x21\\xdf\\xc9\\x0b\\x06\\xd2\\x2f\\x0f\\x33\\x98\\x12\\xe1\\xa3\\x19\\x2b\\x62\\xf5\\x13\\x22\\x74\\x65\\x27\\xb0\\x4e\\xa2\\x54\\x95\\xa2\\x38\\x1c\\x1e\\x8e\\x13\\x22\\xb8\\xa2\\x12\\x3a\\x72\\x85\\xa8\\x86\\x5a\\x32\\xdd\\xcd\\xb5\\xc5\\x2d\\xcb\\xdd\\x51\\x9f\\x95\\xfc\\xda\\x9d\\xe3\\x4b\\xff\\x4d\\x16\\x55\\xb7\\xa5\\x11\\x03\\x82\\x69\\x43\\x0b\\x74\\x69\\xf1\\xad\\xc8\\xd9\\xef\\x98\\x3c\\x1a\\xc0\\x58\\x73\\x8c\\x15\\x4b\\xe5\\x24\\xa3\\x3c\\x63\\xc1\\xeb\\xde\\xad\\x71\\x24\\xcc\\x7c\\x62\\xe9\\x52\\x44\\x83\\x3e\\xb5\\xa5\\xf7\\x46\\xad\\x76\\x42\\x19\\xfd\\x5c\\x39\\x54\\x4d\\x86\\xbb\\x27\\xa5\\x51\\xd5\\x3b\\xc3\\x3e\\x1f\\xea\\x25\\xbd\\xf6\\x88\\xe5\\x08\\x67\\x6a\\x6f\\x4b\\xc2\\x04\\x35\\x05\\x53\\x99\\xfc\\xd6\\xe7\\xa0\\xd6\\x84\\x96\\xfc\\xbd\\xd0\\x42\\x46\\xc7\\xc5\\x28\\xb4\\x0b\\x6e\\x09\\x2b\\x8a\\x33\\x53\\xa8\\xb7\\x6a\\x8f\\x36\\x6f\\x27\\x0e\\x0f\\xde\\xf5\\x30\\xce\\x29\\xba\\x42\\x5a\\x21\\x6e\\xdd\\x3e\\x55\\xd5\\x95\\x08\\x69\\x21\\x95\\x09\\x49\\x6f\\x83\\x0d\\xb6\\x3f\\x1b\\x07\\xb8\\x11\\xb4\\xd2\\xe2\\x0d\\x53\\x12\\xa5\\x21\\xa6\\xcb\\x83\\x6d\\x9d\\xdb\\x25\\x01\\x6a\\xc5\\x40\\x0e\\x1d\\xea\\xd7\\x81\\xa6\\x47\\xee\\x25\\xc5\\x9f\\xa1\\x86\\x69\\xaf\\x70\\x65\\xb8\\x75\\x6d\\x8d\\xe8\\x55\\xea\\xee\\x3f\\xec\\x5f\\xf6\\x77\\x0e\\x75\\xd8\\x36\\xfc\\xf8\\x1f\\x76\\x11\\x50\\xd3\\xc8\\x07\\x0b\\xa1\\x14\\xb5\\x6d\\x60\\x45\\x83\\xcb\\x30\\xa9\\x7e\\x17\\x01\\x90\\xde\\x95\\xdd\\xa8\\x02\\xe8\\x56\\x8e\\x32\\xb5\\xaf\\xec\\x1f\\xb7\\x2d\\x23\\x0c\\x40\\x1f\\xe5\\xe5\\x1a\\x8b\\xa5\\x46\\x81\\x4b\\x93\\xda\\xba\\xbb\\x03\\x30\\x34\\x4d\\x97\\x70\\x88\\xe9\\xf9\\x03\\x30\\xdc\\xbc\\x61\\x80\\xe1\\x56\\xb7\\xd9\\xa8\\x62\\xfd\\x09\\x6e\\xa0\\x6a\\xff\\xf9\\x54\\x95\\xed\\x69\\x9e\\x27\\x4f\\x46\\x90\\xb9\\xc1\\x73\\x29\\xa8\\x6a\\x15\\x3b\\x86\\xdf\\x43\\xb1\\x78\\x93\\xbf\\x11\\x5b\\xa0\\x64\\x77\\x42\\x16\\x9d\\xc1\\x58\\x6d\\xed\\xe8\\x29\\x54\\x2d\\x6d\\xcc\\xde\\xe6\\x59\\x9a\\x55\\x31\\x6d\\x8c\\x81\\x04\\x7c\\x36\\x98\\xe0\\x4b\\x63\\x79\\xb7\\x17\\xc6\\x99\\x84\\x78\\x8d\\xb9\\x8f\\x6e\\x69\\xb9\\xab\\x89\\x20\\x5f\\x9f\\x3a\\x3a\\x11\\xab\\x53\\x75\\x8e\\x20\\xc8\\x82\\xad\\x32\\xde\\xa2\\x46\\x4a\\x7b\\x6f\\xff\\x05\\x13\\x25\\x07\\xbf\\xf5\\x2e\\x31\\xab\\xe6\\xff\\xae\\xf6\\x45\\x69\\x13\\xa6\\x74\\x23\\x4c\\x44\\x00\\x02\\x63\\x2d\\xd8\\x74\\x35\\x1d\\x57\\xbd\\xac\\x31\\xc6\\x75\\xeb\\xd8\\x65\\xfb\\x82\\x1f\\x5f\\x51\\x8f\\x60\\x43\\x6e\\xaf\\x38\\x4d\\xc0\\x63\\x68\\xb6\\xdb\\xd1\\x64\\xbc\\xa1\\x49\\xac\\xa1\\xa5\\x7d\\x99\\x3d\\xec\\x6f\\xff\\x9b\\x4a\\xa2\\x46\\x5f\\xf7\\xc0\\xa0\\x62\\x18\\x24\\xac\\x51\\x14\\xcd\\x78\\xfa\\x8e\\x91\\x62\\xa5\\x9a\\xf4\\xee\\x74\\x87\\x5f\\x73\\x4a\\x81\\xf5\\x01\\x74\\x3d\\xd0\\xab\\xc0\\x26\\xa2\\x25\\x24\\x41\\x6b\\xe5\\x54\\x24\\x5d\\x50\\xd1\\xa7\\x36\\xfd\\x1c\\x0e\\xd3\\x30\\xec\\x8b\\xb7\\x52\\xe3\\xd6\\xcf\\x40\\xbd\\x6d\\x78\\x00\\xf0\\x75\\xbc\\x9c\\xb3\\xad\\x29\\xa9\\xcd\\xa4\\xd8\\xb4\\x7b\\xee\\x4e\\x89\\x07\\x9c\\x34\\x2a\\x8c\\x02\\x41\\x59\\xc5\\x40\\x88\\xba\\x7b\\xc3\\x41\\xe5\\x4e\\xaf\\xdc\\x94\\xc6\\x6b\\x4b\\x7c\\x40\\x39\\x3e\\xdc\\x30\\xf8\\x87\\x63\\xbb\\x47\\x83\\x5d\\x15\\xb0\\x76\\x11\\x57\\x70\\x18\\x71\\x4a\\x1a\\x80\\xaa\\x00\\x48\\x3d\\x7e\\x62\\x37\\xc1\\x29\\x75\\xbc\\x31\\x56\\xf6\\xf2\\xb9\\x55\\xdb\\x77\\x17\\xe1\\x1e\\x6b\\x70\\x5e\\x69\\xd3\\xdc\\x04\\x9a\\xff\\xc0\\xa1\\xb7\\xf6\\x39\\x3c\\x10\\xf7\\xc2\\x33\\x16\\x7b\\x5f\\xa2\\x4f\\x57\\x3c\\xf1\\x86\\xf6\\xe8\\xb6\\xfa\\xa6\\xdd\\xa5\\x36\\x74\\x91\\x01\\x96\\x3a\\x69\\x00\\xce\\x83\\x26\\x5d\\x35\\xc0\\x86\\x0b\\xb6\\xde\\x1d\\x99\\xae\\x8f\\xb1\\x0b\\x52\\x13\\x49\\x30\\x38\\x42\\xcf\\x10\\xba\\x6c\\xee\\xf1\\xd8\\x22\\x9e\\x3d\\x40\\x48\\x46\\xec\\x20\\x95\\x22\\x63\\x2c\\xec\\xec\\x8a\\xe2\\x3f\\x27\\x68\\x28\\x47\\xe9\\xcc\\xa4\\x76\\xe2\\xc2\\xbd\\xb7\\xc9\\xd1\\x5d\\xab\\xd8\\x80\\x16\\x5f\\xf1\\xee\\x60\\x3b\\x0d\\x1c\\xa0\\x4d\\x27\\x53\\xb4\\xc3\\xc9\\x01\\xc8\\x10\\x07\\x89\\x57\\x0d\\xd2\\x7a\\xac\\x25\\x55\\x93\\x8e\\xee\\x1b\\xb7\\xf2\\xcd\\xd3\\x9d\\xab\\x33\\x68\\x78\\xb7\\xbe\\xdf\\x6b\\x5b\\x56\\xdb\\xbf\\x75\\x85\\xfe\\xbe\\x1d\\x84\\x81\\x17\\x7d\\x9c\\xd1\\x82\\x41\\x43\\x4f\\x0f\\x34\\x81\\xc5\\xee\\x94\\x8c\\x7d\\xe9\\xca\\xd2\\x7d\\x50\\x41\\x3f\\x80\\xf8\\xbd\\x33\\x63\\x25\\x8c\\xd7\\x78\\xc2\\xfe\\x73\\x97\\xd6\\x83\\x8b\\x18\\x19\\x98\\xbb\\xbf\\x65\\xdb\\x25\\x0c\\xa2\\x39\\x61\\x6f\\xce\\x99\\x81\\xdf\\x5a\\xd7\\x00\\x54\\x3f\\x75\\xa1\\x6a\\xca\\xb8\\x59\\x87\\x71\\xb3\\x23\\x11\\x0b\\x8e\\xc1\\xe7\\x4f\\x47\\x9a\\x16\\x3e\\x0f\\x2d\\xa3\\x56\\xf9\\x16\\x59\\x6e\\x8d\\xc2\\xe8\\xb2\\x61\\x1c\\xf7\\xd6\\x3e\\xe4\\xb6\\x75\\x4b\\xf4\\x6a\\x65\\x3b\\x86\\xc3\\xd0\\x05\\xf1\\x0c\\x4e\\x5c\\xaa\\x11\\x32\\x90\\xb7\\x07\\x57\\xbb\\xe0\\x73\\xf7\\x04\\x38\\xf2\\xcd\\x46\\xcc\\x49\\x18\\x7e\\x12\\x9f\\x58\\xde\\x4e\\x21\\x4c\\xc5\\x21\\x90\\x45\\x4f\\xa8\\x99\\x2e\\xdc\\xca\\x16\\x72\\xb7\\xd8\\xa9\\xb4\\x25\\x6e\\x75\\x60\\x58\\xc5\\x12\\xc2\\x0e\\xe1\\x78\\x7f\\xb0\\xb2\\x2d\\xfe\\x82\\xcc\\x80\\x2a\\xbc\\x32\\x8e\\x8d\\x47\\x58\\x43\\x73\\x99\\x7b\\xc8\\x65\\x43\\x21\\x55\\xc3\\x65\\x1a\\x6f\\xb1\\x68\\x8b\\x9d\\x5b\\xbc\\x0e\\xc1\\x1a\\x5d\\x31\\x72\\xf4\\x62\\x33\\xc3\\xa9\\x9f\\xcd\\x3f\\x73\\xea\\x3f\\xce\\xa1\\x69\\xf3\\xbc\\xf7\\xe9\\x56\\x24\\x63\\x0e\\x94\\xb5\\x89\\xb2\\x7d\\xf4\\xa1\\x25\\xb4\\xfc\\x5c\\x4c\\xf0\\x86\\x38\\xf4\\x0e\\x54\\x52\\x4c\\xf8\\x00\\x71\\x82\\xa8\\x44\\xb7\\x76\\xb0\\x94\\xf4\\xa8\\x89\\x37\\x75\\x4b\\xbe\\xd3\\x3e\\x76\\xa1\\x2e\\x7a\\x20\\xad\\x87\\x9b\\x52\\x60\\xc7\\xd7\\xf4\\xa0\\x6e\\x0e\\x58\\x73\\xa7\\x8c\\x24\\xd3\\xf4\\xb5\\x72\\xae\\x21\\xe6\\x41\\xeb\\xc5\\xa2\\xbf\\x2b\\x9c\\xd2\\x95\\x23\\x8f\\x6d\\x69\\xf2\\x33\\x10\\x9a\\x5f\\x6b\\x54\\x94\\xde\\xe5\\x9e\\x48\\x8a\\xe0\\xa2\\x26\\x24\\x6d\\xa1\\xa4\\x8c\\x4c\\x81\\x5d\\xac\\xf0\\x1d\\x14\\x3e\\x46\\xdb\\xce\\xae\\x7f\\x81\\x52\\xa8\\xb9\\x46\\x48\\xf9\\xd6\\x44\\x7f\\x0d\\xc6\\xd7\\x70\\x65\\x5a\\x84\\x29\\xd5\\xd8\\x41\\x97\\xb6\\xcf\\x05\\xc0\\x2f\\x37\\x6e\\xb1\\x05\\x61\\x83\\x53\\xc6\\x84\\x8e\\x2f\\x6d\\x09\\x2c\\x8a\\xca\\x78\\xb9\\xab\\x6c\\x71\\x6c\\x17\\x03\\xd6\\x5a\\xfe\\xe7\\xea\\x9d\\xa0\\xd7\\x12\\xbe\\x2f\\x7c\\xfe\\xbc\\xb0\\x77\\xd8\\xeb\\x6b\\xe6\\x54\\x17\\xdc\\x80\\x83\\x7a\\x35\\x1c\\x67\\x38\\x45\\x5f\\x1f\\xeb\\x16\\x96\\xb0\\x89\\xb1\\x71\\x17\\xc1\\x9b\\xfd\\xe5\\x6b\\x81\\x02\\x69\\xab\\x7b\\xda\\x3c\\x1e\\xdb\\xb2\\x13\\xd2\\x6b\\xef\\xee\\x3f\\x7c\\xa8\\xb2\\xdb\\xbf\\x5a\\x57\\xd8\\x23\\xb3\\xff\\x79\\x09\\x89\\xde\\x36\\xd7\\x88\\x15\\x89\\xba\\xae\\xac\\x88\\xf5\\xdd\\xa7\\x26\\x60\\x6e\\x04\\x06\\x8c\\xd5\\x21\\x35\\x46\\x98\\x39\\x3f\\xef\\x53\\x2c\\x5d\\x5a\\x4d\\x83\\x0a\\x8e\\xd4\\xb4\\x31\\x90\\xae\\x33\\x1c\\x64\\x6a\\x33\\x10\\xfe\\x2c\\x34\\xb5\\xdc\\xbf\\x44\\x88\\x57\\x17\\xf6\\xd1\\xa7\\x83\\xcc\\x48\\x78\\xea\\xfc\\xb0\\xde\\x96\\x4e\\x3a\\x34\\x4e\\x8f\\x26\\x2e\\x27\\xa0\\x73\\xd7\\xfa\\x0d\\x6a\\xc5\\xf7\\xb0\\x97\\x7a\\x55\\x30\\x9e\\x7a\\x00\\xc7\\xcc\\x66\\x08\\xa2\\x45\\x38\\x56\\xa2\\xb6\\xea\\xc6\\x24\\x3c\\x64\\x4a\\x75\\xbf\\xa1\\x67\\x80\\x30\\xb6\\x7b\\xe7\\x1f\\x88\\x70\\x25\\x74\\xd7\\xab\\x6a\\x6e\\x51\\x1c\\xea\\x75\\x5b\\xe5\\xb1\\xa1\\xec\\x53\\x65\\x15\\xf7\\xef\\x8f\\xbc\\x89\\x08\\x71\\xc9\\x93\\x62\\x12\\xca\\xf9\\x1d\\xff\\xba\\xa2\\xb0\\xfa\\x4d\\xf3\\x1c\\x31\\x54\\x2d\\xca\\x03\\x11\\x3f\\xd3\\xd6\\xfb\\xd2\\xaf\\xe1\\x7f\\xde\\xa0\\x42\\x5a\\xd0\\x81\\x67\\x1f\\xe2\\xba\\xe7\\xe5\\x5a\\xe5\\x87\\x6d\\xb1\\x1e\\x9b\\x46\\x14\\x44\\xc8\\xae\\x49\\x7c\\xd9\\x76\\x0e\\x27\\x16\\x1a\\x43\\xd8\\x26\\xa8\\xd9\\x46\\x0c\\xfd\\x86\\xe4\\x28\\xb0\\x20\\xe3\\x36\\xd4\\x55\\xcf\\x87\\x4d\\x5d\\xcb\\xbd\\x81\\xa5\\xf4\\xf2\\xbb\\x42\\xb1\\x4b\\x12\\xd0\\xdb\\x5e\\x05\\x8a\\xd8\\xfd\\xf0\\x7e\\x26\\x3c\\x51\\x9f\\x1f\\x94\\x0a\\xab\\x46\\x15\\xc1\\x17\\x84\\xd2\\x89\\x0b\\xa7\\xbe\\x89\\xd0\\x43\\xe1\\x56\\x01\\xfe\\xe1\\xe7\\x81\\x77\\x79\\x03\\x49\\xd4\\xd5\\x1f\\x79\\x2b\\x77\\x06\\x33\\xe1\\xd0\\xaa\\x3d\\x46\\xea\\xe3\\x02\\x3d\\xd1\\x5f\\xb1\\x41\\x78\\xa0\\x9d\\xe5\\x0d\\x4c\\xa1\\x32\\xf7\\xb6\\x84\\x43\\x2f\\xfc\\x7f\\x41\\xe1\\xad\\xff\\x1b\\x0a\\x9f\\x06\\x77\\x95\\xf3\\xc1\\xbe\\x02\\xd7\\xcd\\x8d\\xb9\\x2e\\x04\\xae\\x69\\xff\\xf5\\x2f\\x48\\x1b\\xc6\\xce\\x16\\xaa\\x97\\x4e\\xd8\\x98\\xc9\\x8e\\x05\\x73\\x0a\\x06\\xd4\\x7f\\x01\\xfe\\xc0\\xf2\\xe6\\x4d\\xa8\\xcf\\x66\\xc5\\x10\\x91\\x80\\x8f\\x15\\x2e\\x40\\x03\\x20\\xd8\\x2b\\x12\\x6c\\x17\\x1f\\x11\\xf1\\x46\\x23\\x8e\\x2b\\xba\\x78\\x66\\x5b\\xde\\x4e\\x21\\x64\\xdb\\x03\\xcd\\xe5\\x18\\x19\\x9e\\x98\\xc8\\x38\\x23\\x05\\x7d\\xcd\\xde\\x78\\x3a\\xb2\\x0f\\x96\\x6c\\x89\\xd2\\xa7\\x73\\xc4\\x88\\x78\\x08\\x95\\xe4\\xd5\\xd4\\x1b\\x56\\x6f\\xaf\\xc8\\xcc\\x4b\\x48\\xc6\\x88\\xa1\\xc3\\xd6\\x1b\\x49\\x87\\xea\\x8d\\x29\\x9c\\x48\\x6f\\x50\\x93\\x95\\x46\\x40\\x17\\x99\\x57\\xb1\\xe0\\xcf\\xdc\\xe2\\x2c\\xee\\x94\\x67\\x81\\x95\\xa8\\xde\\x31\\xe7\\xce\\x7e\\xfe\\x6a\\x35\\xa8\\xdf\\xd4\\x84\\x1a\\x86\\x1a\\x27\\x1d\\x46\\x03\\xcc\\x34\\xbd\\x73\\x9c\\x2b\\x06\\x15\\xb4\\x84\\x65\\xb5\\xf7\\xde\\xe7\\xae\\x88\\xf5\\x99\\x8f\\x5c\\xdd\\x0e\\x7e\\xef\\x95\\x0d\\xfa\\x1b\\x6a\\x2b\\x51\\x80\\xf2\\xd9\\x24\\xbd\\x80\\xd5\\xe3\\x9b\\x46\\x15\\x55\\xc6\\x43\\xa8\\x78\\xde\\x5f\\x11\\xa6\\x9d\\xde\\x5a\\xd3\\xa4\\x0e\\xdf\\x61\\xba\\xac\\x1d\\xc1\\x43\\xbc\\x75\\xf6\\x7e\\x5d\\xe1\\x10\\xca\\x23\\xd2\\x29\\x26\\x95\\x48\\x9f\\x43\\xd5\\x1a\\x95\\xe0\\x1f\\x08\\xcc\\x7d\\xe0\\xf9\\xb5\\x4d\\x29\\xf4\\xc5\\xe3\\x05\\x67\\x0d\\xc8\\x95\\xcf\\xc6\\x9e\\xcc\\xd4\\xdc\\x05\\x54\\x2a\\x81\\x36\\xf5\\x84\\x4c\\x4c\\x9f\\xf9\\x48\\x4a\\xd7\\xee\\xda\\x17\\x5e\\xd0\\x2e\\x58\\xbd\\x51\\x00\\x51\\x5b\\x3a\\x1d\\x2a\\xca\\x90\\x51\\x96\\x67\\x99\\xef\\xa5\\xf7\\x8f\\x60\\x15\\x8e\\xd4\\x60\\x19\\x99\\x10\\x36\\x29\\xf8\\x1d\\x3e\\x43\\x1b\\x54\\xa8\\x25\\x29\\x44\\x39\\xfd\\xa0\\xe8\\xa3\\x01\\x21\\x74\\xd5\\x40\\x78\\x54\\x76\\x94\\xdb\\xfd\\x3d\\x44\\xbd\\x19\\xba\\x67\\xf6\\x9c\\x64\\x99\\xd3\\xf5\\x12\\x8d\\x7c\\xa5\\xbe\\xd8\\x88\\x61\\xb1\\xc3\\x95\\xd6\\x34\\x3f\\x22\\x36\\x10\\x0b\\xeb\\xf6\\xbf\\x87\\x3c\\x89\\x07\\xb9\\x51\\xb9\\xa1\\x05\\xf7\\x8b\\xf0\\x88\\xbf\\x63\\x54\\xe5\\x5b\\x2e\\xac\\xc8\\x03\\xdf\\xd8\\xdf\\xd0\\xf6\\xfc\\xfc\\x93\\x40\\xf1\\x98\\x8d\\x6b\\x41\\x3d\\x99\\xe4\\xea\\x07\\x25\\xcc\\x1a\\xa7\\xf0\\xc8\\x01\\x18\\x84\\x85\\x5c\\xaa\\xd6\\x68\\x49\\xf3\\x7d\\x45\\xff\\x64\\xc1\\xb7\\x2b\\xc2\\xfb\\x1a\\x40\\x73\\x6f\\xe4\\x4d\\xe5\\x2c\\xc4\\xa0\\x6f\\x35\\xa4\\x43\\x18\\xd2\\x52\\x0e\\x36\\x4d\\x23\\xf2\\x5c\\x21\\x08\\x94\\x88\\x7c\\x56\\x32\\x27\\xc8\\x82\\xf5\\x4f\\x69\\xcd\\x89\\x6c\\x61\\x49\\x02\\xd3\\xee\\x3d\\x86\\x36\\x6b\\x1e\\xe4\\xb6\\x7d\\x09\\x09\\x34\\x40\\x63\\x1f\\x1e\\xbc\\x48\\x11\\x7a\\x94\\x12\\x59\\x38\\x83\\x55\\x97\\x20\\xe7\\x21\\x99\\x71\\xd7\\xda\\xa8\\xba\\xe8\\x39\\xeb\\xa5\\xee\\x19\\x7b\\x57\\xbf\\x74\\x10\\x83\\x5e\\xd8\\xa7\\xdc\\x20\\x9d\\x95\\x88\\x99\\xef\\xa9\\x7b\\xa2\\x8a\\x56\\x39\\xe6\\x58\\x3a\\x77\\xea\\x48\\xc9\\xd6\\xea\\x8e\\x53\\x2c\\x2d\\xd0\\xd3\\x3a\\x4e\\x49\\x61\\x87\\xe0\\xde\\xa4\\xb4\\xa1\\x4d\\xb9\\xd6\\x1b\\xec\\xa8\\xdf\\xa0\\xc4\\x85\\x88\\x10\\x71\\xe0\\x45\\x02\\x5d\\x20\\xa0\\x3d\\xf8\\xc4\\x39\\x37\\x20\\x85\\x73\\x3b\\x25\\x0f\\x1f\\x31\\xcc\\x20\\x30\\xfd\\x74\\xc8\\x2c\\x57\\xf4\\x6c\\xaf\\x71\\x76\\x03\\x90\\x13\\x99\\xdb\\x9b\\x17\\xe5\\x14\\x72\\x40\\x0e\\x63\\xee\\xff\\xf7\\x05\\x76\\xb0\\xb4\\x6f\\x18\\xbb\\xa3\\x63\\x90\\xf8\\xf2\\x67\\x78\\x85\\x36\\x98\\x4d\\x85\\xb7\\x2f\\xf0\\x1e\\xa3\\xb7\\x2d\\x6c\\xa6\\x5c\\x99\\x64\\x84\\x23\\xad\\x19\\xcd\\xeb\\xc1\\xaf\\xee\\xe2\\xd3\\x88\\xfa\\x7e\\x4e\\x5d\\xb9\\x28\\xc2\\x23\\x5e\\x51\\xf4\\x12\\xc9\\xe2\\x6e\\xbd\\x51\\x46\\xfe\\x2d\\x4c\\x0d\\xd4\\x3f\\x01\\x37\\x6d\\xec\\xa8\\x67\\x40\\x7d\\x30\\x85\\x3e\\xbf\\x4f\\xa3\\xe3\\x65\\x0e\\x0c\\x23\\x2e\\xf8\\x82\\xac\\xda\\x9b\\x7d\\xe9\\x14\\x02\\x44\\xd8\\xee\\xf8\\xc8\\x06\\x4e\\x99\\x87\\x90\\xa0\\x0c\\x64\\x9f\\x20\\x00\\x02\\xc2\\x8c\\x7e\\x23\\x3f\\x82\\x44\\xef\\x49\\x7f\\x66\\x65\\xd3\\x33\\xa7\\x1b\\x00\\xa8\\x05\\x9f\\x76\\x1d\\x64\\xd4\\xbf\\x04\\x95\\x6e\\xe8\\xb1\\xec\\xc1\\xdb\\x45\\xe9\\x0a\\xf1\\x1b\\x15\\xcf\\xcb\\xc3\\xe7\\xea\\x98\\x9e\\x79\\x76\\xb7\\xfe\\x0f\\xb4\\x77\\x05\\x9d\\x3d\\x24\\x49\\x74\\xcd\\xae\\x0c\\xc6\\xb1\\x1d\\x77\\x4f\\x90\\x3f\\xec\\xd5\\x9d\\x33\\xda\\x5e\\x17\\xd0\\xba\\xf7\\x06\\xd6\\xc2\\x96\\x0b\\x0f\\x74\\xb4\\x32\\xe4\\xb4\\xb4\\x8b\\x6a\\x15\\x2c\\x14\\x9e\\x88\\x1d\\xdd\\xde\\xb1\\x3e\\xe8\\xac\\x51\\xca\\x85\\x15\\xb4\\x68\\x55\\x24\\x67\\x95\\x0c\\xba\\xc9\\xdf\\xdd\\x1d\\x88\\x4b\\x99\\xf4\\xcc\\xe4\\x50\\xca\\xc0\\xa3\\xaa\\x8c\\x64\\xb5\\x4d\\xf1\\x2c\\x82\\x8e\\x70\\x41\\x06\\x6e\\xc5\\x9a\\x27\\x13\\x93\\xac\\x76\\xf7\\xd6\\xf4\\x8e\\x27\\xde\\x7e\\x16\\xb1\\x94\\x43\\x44\\xc8\\xf5\\xf3\\xc3\\x03\\x44\\xc7\\x8c\\x16\\xea\\x1c\\x42\\xf1\\x95\\x01\\x30\\x06\\x5a\\xfd\\x0b\\x5a\\x26\\x24\\x07\\x36\\x7a\\x72\\x28\\x6b\\x62\\xef\\xcf\\xa0\\xf1\\x36\\x20\\x68\\xf6\\x27\\x12\\x64\\x31\\x2d\\xb6\\x81\\x15\\xd4\\x02\\x43\\x07\\x92\\x20\\xbc\\xf5\\xad\\xc2\\xba\\xf9\\xa7\\x40\\x81\\xde\\xdd\\xca\\xfd\\x21\\x52\\x90\\x15\\x26\\xfa\\xbe\\x51\\x4c\\x50\\xf1\\xce\\xaf\\xec\\x32\\x86\\xd0\\xff\\x12\\x43\\xf0\\xbe\\xfb\\x29\\xee\\x7f\\x8e\\x21\\x78\\xdf\\x62\\x08\\xee\\x4f\\x31\\x04\\x8f\\x42\\x80\\xf6\\x0f\\x8d\\x62\\x85\\xf8\\x9a\\xff\\x5a\\x91\\x1d\\xd7\\xb6\\xe9\\x15\\x7b\\x00\\x05\\x4b\\x73\\x55\\x6e\\x91\\x60\\x7a\\xb8\\x6a\\xec\\xf7\\xd8\\xbd\\x64\\xee\\xee\\xca\\xdb\\xcf\\x6a\\x45\\x17\\xd5\\x84\\x9a\\xc1\\x0d\\xb2\\x72\\x5b\\xe7\\x0a\\x02\\xcb\\x8c\\x7b\\x62\\x60\\xdc\\xaf\\x22\\x4f\\x6c\\x6d\\xef\\x86\\x58\\x99\\x51\\x59\\x7c\\x31\\x0f\\x3c\\x14\\x8c\\xc9\\x02\\x47\\xe8\\x1f\\xa6\\xcd\\x2f\\x3a\\x17\\xf6\\x01\\x09\\x83\\x8a\\x04\\xb9\\x34\\x6e\\x4a\\x19\\xd6\\xf5\\xc4\\xfa\\xa3\\x94\\x9f\\x0a\\x71\\x68\\xf1\\xbe\\xa0\\xee\\x3e\\x67\\x3a\\xaa\\x48\\xb3\\xb5\\x84\\xc8\\xcf\\x10\\x7b\\x6c\\xae\\x9a\\x55\\xbd\\x9f\\xb8\\x46\\x4b\\x79\\x22\\xa2\\x24\\x2a\\xe2\\x30\\x60\\xa2\\x8e\\x17\\x36\\x74\\x81\\xd8\\x67\\x73\\xec\\xf8\\xc6\\x98\\x0c\\xe3\\x26\\x90\\x28\\x34\\xee\\xe6\\xcc\\x6a\\xf5\\xbd\\x2f\\xc3\\x25\\x7d\\xa9\\x90\\x80\\x18\\xae\\x9b\\x45\\x5f\\xbf\\x10\\x09\\x6e\\x2a\\xa2\\xc4\\x44\\xce\\x25\\xc6\\xae\\xbc\\x6f\\x46\\x47\\x40\\xed\\xe3\\x49\\xf6\\x3e\\x25\\x57\\x99\\x2c\\x44\\xf7\\x9b\\x79\\xa2\\x19\\x13\\x62\\xcb\\x31\\x49\\xcc\\xbd\\x88\\x60\\xa0\\xb1\\xc7\\xc9\\xbb\\x97\\x07\\xb6\\xbc\\xa6\\xad\\x08\\xca\\xd1\\x30\\xa2\\x31\\x3a\\x2f\\x10\\x1c\\x7a\\x4c\\x11\\x4d\\x28\\x23\\x79\\x82\\x6b\\x31\\xad\\xe7\\x36\\xc9\\xc4\\x5d\\x06\\xe2\\x33\\xa8\\x46\\x51\\x11\\x66\\xb5\\x68\\x0c\\x44\\xa9\\xc9\\xe7\\x00\\x58\\x6d\\xae\\x30\\x47\\x12\\x55\\x5d\\xcb\\x6c\\x89\\x6a\\x96\\x65\\xa8\\x63\\x51\\xa6\\x1e\\x14\\xb3\\xc0\\x82\\xf6\\x7d\\xfb\\x8d\\x72\\x93\\x25\\xa3\\xed\\x14\\x55\\x29\\x37\\x60\\x78\\xa9\\x19\\xb5\\x3a\\x53\\x66\\x96\\xcd\\xb0\\xdc\\x27\\x0d\\xd2\\xd9\\xc6\\x51\\x30\\x20\\x9a\\x43\\xa2\\x46\\x6b\\x46\\x6e\\x95\\x91\\x90\\xb2\\x4e\\x4a\\x07\\x44\\x43\\xd0\\x95\\x4c\\x9f\\xe3\\xa7\\x88\\x62\\x77\\x67\\x90\\x31\\xed\\x25\\x53\\x6a\\xf9\\x2d\\x9d\\x46\\x31\\x35\\xd4\\x5a\\xce\\xd3\\x92\\xc8\\xf3\\xad\\xc5\\xcf\\x83\\x65\\x83\\x32\\xa8\\x27\\x05\\x0b\\x34\\xc8\\xb4\\xd0\\x72\\x60\\x1e\\x0c\\x89\\x80\\xb7\\x86\\x59\\x5b\\xf8\\xb9\\x2e\\x04\\x51\\x24\\x84\\xaf\\xd9\\x83\\x98\\x24\\x03\\x26\\xd7\\x34\\x53\\x6f\\xca\\xbc\\x83\\x15\\xd6\\x55\\xe1\\xa0\\x8a\\x2a\\xb8\\xba\\x85\\x47\\x7d\\x79\\x2b\\x52\\x68\\xe7\\xac\\x28\\x85\\x80\\x9b\\x37\\x91\\x6d\\x6e\\x6a\\xe3\\x34\\x9a\\xfc\\xcd\\x69\\xf6\\x25\\x7d\\x0c\\x6d\\x99\\xda\\xa7\\x19\\xdc\\xab\\xee\\x94\\xba\\xbc\\xa8\\xba\\x2d\\x02\\xb1\\x27\\xce\\x07\\xd9\\x27\\x65\\x80\\x3e\\xe7\\x1e\\x18\\x56\\xe0\\x21\\xf4\\x66\\x6f\\xb9\\x3f\\xd2\\xc7\\x9c\\xae\\xfe\\xf5\\x2d\\x78\\xc2\\xcd\\x58\\x8f\\x80\\x29\\xfb\\x33\\xb7\\x98\\x4c\\x74\\x82\\xc9\\x00\\xc2\\xb2\\x10\\x04\\x33\\x77\\xe0\\x22\\x44\\x19\\x58\\xac\\xf3\\x74\\xeb\\x22\\x69\\x1c\\xff\\x93\\x60\\x96\\xa1\\x6f\\x20\\xda\\xd7\\xb2\\xf4\\xd3\\x3b\\x63\\x51\\xcd\\x92\\x22\\x67\\x77\\x4b\\x23\\x98\\xc6\\xaa\\x49\\x26\\x95\\xe3\\x54\\xcd\\xc1\\xc0\\x85\\xe1\\x0b\\x9c\\x4c\\xdd\\x2e\\x29\\x12\\xa0\\x05\\x2d\\xcc\\xbd\\x81\\x81\\xb8\\xb3\\xbf\\xd4\\xcb\\x3c\\x4c\\x9b\\x7b\\x71\\x19\\x25\\x4d\\x23\\x0d\\x85\\x27\\xe7\\xcd\\x6f\\x8a\\x94\\xc9\\xe5\\x42\\xc8\\x8b\\xdc\\x4a\\x4d\\x3e\\x16\\x14\\xda\\x5a\\x80\\xb5\\x7a\\x29\\xbe\\xf4\\xae\\x11\\x25\\x1f\\xbe\\xb9\\x5f\\x1a\\xa1\\x54\\x69\\xcc\\x33\\xe2\\x2b\\x13\\xfa\\x30\\xb6\\x91\\x12\\x68\\xfe\\x3c\\x5e\\x74\\x54\\x39\\x5e\\x22\\x17\\xb7\\x4c\\x37\\xb9\\x6f\\x77\\xf8\\x10\\xa8\\x0d\\x0f\\x56\\x63\\xc1\\x69\\xeb\\xf4\\x87\\xc6\\xc0\\xa9\\x9e\\x65\\x62\\xcc\\x3e\\xed\\xf1\\x5c\\xb9\\xeb\\xe0\\x2b\\xf0\\xde\\x05\\x49\\xee\\x27\\x7d\\x9d\\x58\\x20\\xfc\\xaa\\x68\\x0a\\x1a\\xb1\\x2d\\x96\\xb2\\xfd\\x79\\xf7\\xa3\\x64\\x59\\x7b\\x29\\xcb\\xd3\\x2f\\xb1\\xdd\\xd8\\xd4\\x90\\x80\\xaf\\x58\\x67\\x53\\x83\\x98\\x09\\xcf\\x18\\x13\\xa9\\x73\\x9a\\xb3\\x3b\\x34\\xc2\\x0a\\x0e\\x35\\x15\\x68\\xd3\\x7d\\x47\\xcd\\xf3\\x01\\x0a\\x1d\\xb0\\xc4\\x0b\\x65\\x32\\xa8\\x7b\\xd4\\x9e\\x2d\\x02\\x93\\xd0\\x6c\\x54\\x25\\x74\\x52\\x82\\x1a\\xb3\\x6e\\xc8\\x50\\x81\\xda\\x2e\\x10\\x02\\x68\\xe2\\xd0\\x50\\xa4\\xda\\x7e\\xa7\\x91\\xee\\x63\\xef\\x0d\\x2a\\x26\\x31\\xaa\\x38\\x83\\xe6\\xbb\\x48\\x32\\xd5\\x67\\xb7\\x15\\x66\\xe3\\x58\\x33\\xca\\x83\\x5f\\x2c\\x2b\\xd7\\x69\\x8c\\x38\\x95\\xa4\\xcf\\x07\\x02\\x70\\xa9\\x7d\\x45\\xf1\\x43\\x8f\\x4e\\xaa\\xa3\\x65\\x5b\\xa7\\xf0\\x99\\x3f\\xf1\\xf1\\x40\\x86\\x3f\\xdd\\x20\\xdd\\x24\\x3e\\x9d\\x63\\xb1\\xfe\\xd9\\x7d\\x0b\\xab\\x31\\x18\\x1c\\xda\\x64\\x00\\xc2\\x95\\xcb\\x22\\x22\\x29\\x57\\xee\\x94\\xe6\\xfe\\x07\\x84\\x67\\xe4\\x13\\xb1\\x0a\\x2b\\x78\\x48\\x9e\\x0b\\x83\\x0a\\xa5\\xba\\x2f\\x58\\x61\\x12\\xfe\\x71\\x05\\xa9\\x1b\\x52\\x23\\x4e\\x2c\\x47\\x83\\xd7\\xdd\\x35\\x38\\x97\\x58\\x26\\x6c\\x4a\\xd8\\x34\\xe1\\x80\\x30\\x4e\\x10\\x6e\\x03\\xee\\x2d\\xb6\\xc0\\xc6\\x1c\\x50\\x0b\\xbb\\xe7\\xb0\\xea\\xfd\\x6a\\x4d\\xd1\\xa3\\x9e\\x4f\\x8a\\x47\\x42\\xeb\\x9e\\x57\\x1d\\x82\\xb6\\x49\\x89\\xbb\\x94\\xc1\\x5e\\x69\\xfd\\x36\\x9c\\x89\\x89\\x30\\xf1\\xec\\x75\\x52\\x0e\\x03\\x1b\\xf6\\x19\\x24\\x4d\\xff\\xf3\\xee\\xbb\\xf4\\x83\\xd1\\xed\\x8b\\x8c\\xbe\\x2c\\x6d\\x38\\x53\\x3d\\xf0\\x46\\xa1\\x32\\x6d\\xfc\\xa9\\x58\\x23\\x61\\xa8\\x9b\\x49\\x83\\x20\\x07\\x46\\xbc\\x77\\x9f\\xc7\\x6b\\x33\\x5a\\x21\\xd5\\xb4\\xb4\\x06\\x4c\\x09\\x8e\\x0f\\x32\\x6f\\x16\\x3c\\xfa\\x23\\x74\\xb5\\x31\\x21\\xf6\\xac\\xff\\x54\\xa9\\xb5\\x4e\\xec\\x4c\\xe8\\xdb\\x05\\xba\\x1c\\xeb\\x8b\\x06\\xd7\\x06\\xcf\\x1d\\x8d\\x31\\x77\\x0d\\x25\\xd6\\xcb\\x41\\x92\\xee\\x46\\x28\\x54\\xa4\\x9c\\xde\\xf0\\xef\\x2d\\xdb\\xde\\x45\\x9d\\x58\\x13\\x78\\xcd\\xfe\\x8e\\x6d\\x4b\\x97\\x56\\x27\\x55\\x8c\\xbc\\x26\\x80\\x9d\\x79\\xd7\\xbc\\x35\\x10\\xc3\\x4a\\x01\\xea\\x81\\xd5\\xb0\\x4a\\xc3\\x6c\\x6c\\xd7\\x38\\xc7\\xe9\\x2d\\x13\\x7e\\xe6\\xf5\\xec\\x16\\x56\\xb5\\x9a\\x87\\x46\\x56\\x0c\\x24\\xb3\\x41\\xd3\\xe4\\x80\\x8d\\x37\\xf6\\x92\\xc6\\x10\\x03\\x1b\\x1c\\x91\\xd8\\xc3\\xb2\\xad\\x35\\x27\\x9c\\x60\\xd8\\x79\\x63\\x50\\xe6\\x07\\xbc\\xb3\\x9d\\x02\\x24\\x86\\x9f\\x2e\\xad\\x58\\x1c\\x63\\x4d\\xae\\x1d\\xd3\\x3d\\x1e\\xd6\\xc5\\xae\\xd6\\x36\\x55\\x06\\xd3\\xb3\\x58\\x9a\\x7e\\xc5\\x70\\x7a\\xff\\x5d\\xac\\xd4\\xff\\x4e\\xf0\\x58\\x11\\xb3\\x40\\x3b\\x06\\x58\\xde\\xa4\\x54\\x5f\\xf5\\xe5\\x79\\x62\\x67\\xdf\\xa7\\x9d\\xd9\\xf9\\x1d\\xad\\xd4\\x90\\x7e\\x5e\\x58\\x79\\x6b\\x55\\xdf\\xb4\\x7f\\xb2\\xc2\\xf7\\xad\\xb7\\x7b\\x8a\\x4b\\x97\\x17\\x2b\\xdc\\xcf\\xca\\x8d\\x9e\\xc4\\x66\\x9c\\xab\\xbd\\x71\\x20\\xf7\\x55\\x29\\x74\\x2d\\x18\\x89\\x95\\xf2\\xbe\\x8c\\x01\\x84\\x0b\\x77\\xcf\\xf6\\xc6\\x00\\xdb\\xd2\\xa7\\xbc\\xf6\\x0d\\x5d\\xbb\\xc6\\x7e\\x08\\x53\\x5a\\xf8\\x26\\x80\\x03\\xeb\\x9c\\x2c\\xd2\\x3e\\xa2\\x65\\x01\\x79\\xa6\\x5e\\xd7\\x18\\xd7\\xdf\\x32\\x49\\x6d\\x82\\x19\\x30\\x9f\\x73\\x7b\\x0a\\x8a\\xa4\\x55\\xf2\\x94\\x98\\x17\\x2d\\xd7\\xc8\\x10\\x73\\x5a\\x47\\x4e\\x02\\xd1\\x33\\xcc\\x59\\x27\\x3a\\x0b\\x89\\xfd\\x8c\\x2e\\x08\\xb2\\x3b\\xea\\x44\\x15\\x83\\x58\\xfd\\x47\\x07\\x26\\x3c\\x6b\\x50\\xd4\\x32\\x31\\x26\\x2d\\x57\\xb2\\xb2\\x0b\\x3b\\xc7\\x09\\xde\\x99\\xad\\x39\\xc1\\xd9\\xc3\\x23\\x56\\x11\\x9e\\xf8\\xb8\\xec\\x62\\x97\\xaf\\xc2\\x42\\xa8\\xd6\\xf3\\x47\\x97\\xf2\\x45\\xf3\\xfe\\xee\\x4b\\x97\\xcf\\x74\\xbf\\x9a\\xda\\x97\\x54\\x07\\x57\\xb0\\x3e\\x5a\\x9a\\xc2\\x2b\\x47\\x31\\xc0\\x9a\\x15\\x8d\\xe7\\x4d\\x44\\xb6\\xdd\\x4f\\x53\\x25\\xa4\\xf1\\xfa\\x7b\\x79\\xf7\\x4f\\x5f\\x20\\x55\\xac\\x21\\x82\\x90\\x4c\\x77\\x82\\xf5\\x7b\\xef\\xa0\\x04\\xbf\\x76\\xb7\\xaf\\xb4\\x94\\x6c\\x31\\xf2\\x27\\xa8\\xbb\\xf0\\xe7\\x77\\xc5\\xfc\\x52\\x06\\x04\\x2f\\xe0\\x96\\xf4\\x81\\x40\\xbb\\x42\\x08\\x7b\\x4e\\x5e\\xf0\\x03\\x42\\x2c\\xd8\\x57\\x3a\\xb1\\x39\\xa4\\xe1\\xab\\x3d\\xce\\x13\\x55\\x16\\x74\\xd3\\x38\\xc7\\xd5\\x0b\\xbf\\x4d\\x06\\x0c\\x8c\\x04\\x15\\xd1\\x10\\x7c\\x95\\x98\\x09\\x33\\x92\\x57\\x77\\xff\\x50\\xde\\xa6\\xa6\\xbc\\xb9\\xc3\\x8a\\xda\\xd6\\x98\\x29\\x9e\\x39\\x6d\\xb7\\x45\\x50\\xac\\xa2\\xa9\\x87\\x92\\x29\\x1c\\xfb\\x06\\x3a\\x9f\\xbc\\x09\\x76\\x8c\\x2a\\x78\\x52\\x13\\x8b\\x2c\\x5f\\x49\\x67\\x01\\x0c\\x8c\\xa1\\x36\\x53\\xbe\\x8e\\x47\\x15\\x89\\x62\\x1d\\xdf\\x2b\\x09\\xac\\xf5\\x89\\x82\\xc4\\x7b\\xb2\\x50\\x71\\xf1\\xe7\\xbe\\xe8\\x92\\xca\\xb4\\x8c\\x05\\x78\\xd7\\x77\\xe5\\x78\\xab\\x4d\\x4b\\x59\\xde\\x02\\x09\\x39\\x96\\xaf\\x1e\\xe3\\x24\\x98\\xc6\\x43\\x48\\x9b\\x5b\\x34\\x7d\\x12\\x09\\x90\\x9b\\x48\\xb4\\x6f\\x12\\xc4\\x2c\\x3a\\x25\\x2f\\x87\\x2b\\xd0\\xf9\\x08\\xa0\\x61\\x9d\\x6c\\x6f\\xe2\\x52\\x88\\x89\\x96\\x52\\x27\\x36\\xcd\\xb4\\x70\\xd1\\x2c\\xb4\\x92\\x28\\xd0\\x0d\\x1d\\x7a\\x87\\x2e\\x8b\\x32\\x2f\\xa2\\x95\\x52\\xb1\\x40\\xda\\xcc\\xf9\\x47\\x6f\\xa8\\xf9\\xe4\\x55\\x1c\\x2c\\x58\\x68\\xfd\\x15\\x37\\xc7\\xdc\\x8f\\xbb\\xa6\\x73\\xb7\\x94\\x43\\xc9\\x5d\\x2f\\x71\\x7d\\x68\\x01\\xd2\\x31\\x80\\x06\\x52\\xbc\\x1c\\x16\\xbc\\x41\\xbc\\x54\\x98\\x8f\\x13\\x1b\\x6f\\xf3\\xae\\x5c\\xd0\\x7c\\x5c\\x8e\\xb1\\xa2\\x26\\xc4\\xa6\\x5a\\xc9\\x42\\x21\\xc1\\xf0\\x8e\\x9d\\x70\\xa6\\xc4\\x96\\x61\\xef\\xf4\\x22\\xcd\\x37\\xad\\x3a\\xa2\\x83\\xaf\\x97\\xc0\\x51\\xfb\\xea\\x9e\\x5e\\xc9\\x3d\\x38\\x86\\x16\\x28\\xef\\xc1\\xf9\\x66\\x47\\x22\\x12\\xed\\xc2\\xaa\\x11\\x88\\x90\\x10\\xa1\\x53\\xdb\\x7d\\x06\\x67\\x69\\x4b\\x3c\\x82\\x27\\xc4\\x15\\xf2\\x6b\\x6e\\xb9\\x62\\x17\\xf9\\x85\\xd0\\x2f\\x76\\x84\\x3f\\xc2\\x23\\xe6\\x72\\xc1\\xda\\xdc\\x7d\\x83\\x04\\x7d\\xb7\\x01\\xf0\\x82\\x92\\xd6\\x60\\xb1\\x99\\x3d\\x07\\x7c\\x66\\xf6\\x0c\\xef\\x89\\xc4\\x7c\\x91\\xd2\\x4f\\x30\\x2c\\x82\\x97\\xa1\\x3e\\x01\\x0e\\x8a\\xef\\xa4\\x34\\xcc\\x7e\\x33\\xfa\\x11\\x7c\\xde\\x17\\x53\\xba\\x26\\xdb\\x17\\x65\\x10\\xb0\\x75\\xfb\\x5d\\x78\\x5b\\xdd\\x82\\x24\\xe2\\x0c\\x93\\xbd\\xd2\\x9f\\x87\\x3a\\xec\\x22\\x36\\xa6\\x3a\\x3f\\x0d\\xbb\\x14\\x6e\\xf1\\x1a\\xac\\x19\\x41\\x7c\\xf6\\x9e\\x89\\x4b\\x77\\x8d\\xc0\\x57\\x84\\xbb\\x94\\xed\\x2c\\xa4\\x89\\x9a\\x80\\x6b\\xe2\\x69\\x88\\x8f\\xb5\\xe4\\x69\\x6b\\xc7\\x57\\x52\\x92\\x3e\\x8c\\xe8\\x48\\x6c\\x36\\x97\\xf7\\x7c\\x50\\x75\\x09\\xe5\\xa3\\xa8\\x9c\\x5b\\x03\\x9a\\x09\\x78\\xc1\\xcd\\x1a\\x37\\xa3\\x04\\x5b\\xc9\\xc2\\xbe\\x64\\x18\\x9b\\xd6\\x96\\x16\\xed\\x5f\\xac\\x7e\\x46\\x25\\x20\\xc9\\x22\\xe5\\x08\\x2a\\xdc\\x0e\\xfd\\x57\\x22\\x4c\\xac\\x8e\\x57\\xde\\xf3\\x14\\x5b\\x5d\\x75\\x1a\\xa8\\x84\\x93\\xe6\\xc6\\x73\\xf9\\x65\\xc7\\x29\\x9b\\x85\\x7d\\x58\\xc5\\xdb\\x45\\x19\\xc6\\x52\\xcc\\x14\\xa4\\xdb\\x09\\xad\\xcc\\xb9\\x26\\xf0\\x1e\\xc9\\x92\\x0c\\x43\\xda\\xf7\\xf8\\x02\\xc9\\x44\\xed\\x03\\xce\\x6c\\xb9\\xc4\\x87\\xfb\\xae\\x39\\x0b\\x89\\xe3\\x0e\\x87\\xb3\\x26\\xd1\\xbe\\x37\\x7b\\xd2\\x52\\xf6\\x09\\xc7\\xdf\\xc9\\xf1\\x3c\\x39\\x7e\\xe3\\xef\\x8f\\xdf\\x39\\xbd\\x93\\xa8\\xc3\\x6d\\x8b\\x24\\x8c\\xb9\\x57\\x2c\\x71\\x8f\\x23\\x09\\x4f\\xbe\\x62\\xef\\x1e\\x2b\\xd4\\xaa\\x30\\xa1\\xe0\\x83\\x2c\\xbc\\xe3\\x5e\\xa4\\xf9\\x89\\x38\\x52\\xe6\\xf4\\xe2\\x1e\\x49\\xd0\\x63\\xda\\x9c\\x93\\x22\\x91\\xa5\\x44\\x62\\xce\\xa3\\x6f\\x88\\x47\\x28\\x05\\xda\\xcf\\xb7\\xc5\\xa3\\xda\\x3a\\x70\\x8e\\x5a\\x29\\xe4\\x48\\xf8\\x66\\xea\\x9b\\x64\\x10\\x4f\\x60\\xc6\\xfb\\x52\\xdb\\x00\\xb0\\x0d\\x25\\x22\\x33\\xa2\\x99\\x26\\x47\\x26\\xf3\\x42\\x8b\\xb7\\x50\\x9e\\x7b\\x1f\\x1c\\x79\\x70\\xdd\\xc3\\x2a\\xf1\\x1e\\x79\\x7b\\xf4\\xba\\x40\\xaf\\x1b\\x4e\\x84\\x94\\xbd\\xce\\xc2\\xf8\\x68\\xad\\xc3\\xb9\\x3e\\xff\\xe3\\x5c\\x7d\\xcc\\xe5\\x7c\\x9f\\x2b\\xa0\\x0c\\xc5\\x4d\\x48\\xdf\\x20\\x67\\x2f\\xa3\\x14\\x3d\\x64\\x1f\\x16\\x29\\xdc\\x20\\xbf\\x73\\x28\\xc7\\x5c\\xdc\\xcf\\x68\\x59\\x8f\\x3e\\xb3\\x34\\xa2\\x94\\xd4\\xcb\\xa1\\x2c\\xd2\\xc4\\xf4\\x48\\x5a\\x42\\x1c\\x74\\xce\\xcb\\x97\\x7b\\xb9\\xa4\\x69\\x64\\xc2\\xb4\\x74\\x90\\x52\\x16\\xbc\\x89\\xf4\\x73\\x6f\\x69\\xae\\xbd\\xe8\\x4d\\x25\\xcd\\x39\\x25\\x3d\\xef\\x02\\x46\\x27\\x4d\\x8a\\x91\\xc2\\x99\\x96\\x44\\xba\\x74\\x8f\\x69\\xd3\\x60\\xeb\\xc8\\xb9\\x32\\x64\\xde\\xae\\xc1\\x00\\x38\\x82\\x57\\x94\\xaa\\xd3\\xb0\\x68\\x94\\xe3\\x9e\\xc9\\x65\\xa5\\x0f\\xc9\\x05\\x28\\x8b\\x21\\x4e\\xda\\xfd\\x4c\\x9e\\xae\\xda\\x74\\xbc\\xda\\x7a\\xd0\\x10\\xf6\\xf0\\x8b\\x85\\xd3\\xf1\\xbc\\x01\\xa3\\x82\\x41\\x79\\x1d\\xc5\\xdc\\x68\\x05\\x59\\x92\\x0a\\x21\\x1b\\x43\\x50\\x54\\xbb\\x2d\\xa6\\xfa\\xdc\\xa5\\xcd\\xd3\\x82\\x26\\xc7\\xa5\\x4e\\x05\\x91\\x9b\\xda\\x85\\x31\\x32\\xd0\\x76\\x0d\\x68\\xde\\x8f\\x58\\x9f\\x19\\x20\\xf3\\xc0\\x86\\x22\\x08\\x16\\x14\\xec\\x2e\\x60\\x3e\\x7f\\x60\\x3d\\xa9\\x6c\\xe4\\xe2\\x01\\x7f\\x84\\xe3\\x55\\xdd\\xa5\\xd7\\xd9\\xc1\\x61\\xb7\\xdc\\x0c\\x80\\xb5\\x1f\\xa5\\x89\\xe1\\x9c\\x57\\x80\\xdb\\x43\\x13\\xab\\x2b\\x0b\\x99\\xe9\\xae\\xb4\\x33\\xd4\\x49\\x9c\\x01\\x0b\\xa9\\xfd\\x76\\x6f\\x8e\\xdd\\xd6\\xfc\\xeb\\x32\\x96\\x14\\xc3\\x09\\xe6\\xcd\\xe0\\xb1\\x7d\\xbc\\x50\\x92\\x22\\xe2\\x9d\\xa4\\xf6\\xcc\\x66\\x7d\\x06\\xb5\\x87\\xcf\\x3a\\x54\\x73\\x59\\x6b\\xff\\x1d\\x2a\\x92\\x66\\xfa\\xb3\\xcc\\x66\\x79\\x75\\xdb\\x94\\x03\\xdd\\x50\\xfc\\xa1\\xd8\\xca\\x44\\xd9\\x81\\xa7\\x1e\\x83\\x80\\x32\\xcc\\x64\\x61\\x84\\x86\\x60\\x64\\xa6\\x68\\xfa\\xfd\\x06\\xe3\\x76\\x66\\xa7\\x74\\x40\\x51\\x38\\xe0\\x99\\x9b\\x67\\x35\\x18\\x0d\\xa7\\xdf\\x4f\\xa4\\x31\\x72\\x57\\x9c\\x59\\x0c\\x49\\xd3\\xc5\\xb7\\x17\\x0a\\x02\\x43\\x5b\\x42\\x8b\\xb5\\x6a\\xd5\\xff\\x25\\x16\\x8c\\x18\\x20\\xeb\\x32\\x7a\\x2f\\xa9\\x73\\x09\\x04\\x14\\x75\\xa3\\x82\\x09\\xed\\x02\\x11\\x11\\x4b\\x4f\\x84\\x4d\\x4b\\xbb\\xbc\\xac\\xe0\\xe2\\xd5\\x25\\x2b\\xa8\\xe3\\xda\\x6f\\x63\\x23\\x6b\\x4f\\xdd\\x07\\x74\\xa1\\x52\\x4f\\x73\\xea\\x1b\\x33\\x6a\\x08\\xfc\\x32\\xea\\xb4\\x64\\xc5\\x13\\x0c\\xba\\x02\\x79\\x21\\x06\\x05\\xa2\\xc2\\x69\\xa1\\xbb\\xac\\x38\\xa8\\xd1\\xa6\\x41\\x35\\x88\\x77\\x06\\x45\\x12\\xd5\\x41\\x6b\\x95\\x2b\\x56\\x5a\\x83\\xcd\\x19\\x72\\x38\\x05\\xc3\\xc7\\x46\\x32\\x20\\xf7\\xcf\\x73\\x68\\xbf\\xb1\\x92\\x28\\x5b\\xfb\\xec\\xe3\\x05\\x18\\xd0\\xa4\\x7a\\x28\\x69\\x52\\xdd\\x6b\\x6a\\x93\\x90\\xf9\\x0c\\xb0\\x18\\xca\\x8e\\x34\\xd7\\x4f\\x78\\x01\\xc6\\xac\\xf1\\x29\\x7f\\xbc\\xad\\x7d\\xcd\\x0b\\x09\\x99\\xb9\\xe1\\xd2\\x43\\xd5\\x41\\x68\\x3d\\x5b\\x6f\\xc6\\x54\\xfa\\xbe\\xb2\\xbb\\x5f\\x19\\xd0\\x7d\\x28\\xe9\\x7c\\xbf\\x72\\x83\\x15\\x7b\\x72\\xf9\\x63\\xc9\\x4d\\x50\\x09\\x92\\xce\\x7b\\x63\\x93\\x46\\xd0\\x04\\xe8\\x6d\\xd5\\xfc\\xfb\\xc6\\x10\\xb3\\xf0\\x3a\\x66\\x73\\x53\\x7b\\x1f\\x2b\\x7f\\xa5\\xcf\\x21\\x9d\\xbc\\x5d\\xd8\\xf2\\x61\\x94\\x33\\xaa\\x0f\\x79\\xa0\\x69\\xfd\\xde\\xbc\\x08\\xe1\\xac\\x02\\x06\\x51\\x02\\x13\\x48\\xe3\\x78\\x31\\x62\\x32\\x75\\x4d\\x89\\xf2\\x8e\\xf4\\xca\\x70\\x67\\x57\\xdf\\xf8\\x73\\x0d\\xa5\\xcf\\x0a\\xa1\\x1a\\xae\\x4c\\x28\\x8f\\x55\\x62\\x42\\xa7\\x22\\x63\\x14\\xb3\\x9a\\xdd\\x24\\x32\\x87\\x14\\x58\\x89\\x5c\\xbd\\xb6\\xcd\\xef\\x66\\xb4\\x4a\\x49\\xde\\xaf\\x3d\\x90\\x41\\x40\\x75\\xa9\\x2a\\x39\\x23\\xb7\\x37\\xac\\x44\\x9b\\x00\\x1b\\x67\\x88\\x6f\\x6e\\x6d\\x5e\\x07\\xee\\x9d\\x80\\x96\\xde\\x70\\xa1\\xd3\\x5c\\xbd\\x23\\x6b\\x46\\xe3\\x06\\x07\\xd8\\xff\\x74\\x60\\xb1\\xea\\x9d\\x25\\xa4\\xf1\\x90\\x85\\x30\\x09\\xdd\\x1a\\xbd\\x85\\xd3\\x07\\x7a\\xb7\\xac\\xb1\\xa0\\x53\\xde\\xe3\\x15\\xba\\x16\\x57\\x1f\\x4e\\x69\\xdf\\x26\\x8d\\x42\\xbf\\xba\\x2b\\x97\\xbe\\x45\\x0d\\x84\\xd7\\x5a\\x60\\xb1\\x2e\\x4c\\x57\\x09\\x20\\x08\\x9e\\x30\\xaf\\x09\\x9b\\xbb\\x34\\xdc\\x88\\xa8\\xe0\\xfc\\xde\\x18\\xf8\\x72\\x8c\\x4b\\x2c\\x1f\\xf1\\x9e\\xa8\\xaf\\x09\\x19\\x8e\\xdb\\x10\\x21\\x5c\\x94\\xd9\\x83\\x32\\xba\\x57\\x0f\\xd0\\x77\\x65\\x9a\\x3a\\xa9\\x5c\\x90\\xa2\\xef\\x79\\xc1\\x24\\xe1\\xb6\\x5d\\x5e\\x73\\xa6\\xa7\\x68\\x64\\x19\\xd4\\x6a\\x98\\x70\\x14\\xd8\\x1e\\x5e\\x6a\\xc8\\xda\\x55\\x55\\xb3\\x3f\\xb0\\x15\\xe3\\xc9\\xce\\x99\\x43\\x32\\x69\\x02\\x0e\\x2f\\xee\\x81\\x5e\\xe0\\x92\\xc0\\xb9\\xcd\\xda\\xc4\\x00\\x29\\x4f\\x6f\\xc4\\xfa\\x36\\xb1\\x44\\xe7\\x73\\xfc\\x52\\x49\\xcb\\xcf\\xa0\\xd4\\x7a\\x8c\\x8f\\x43\\x55\\xbd\\x23\\xa4\\xf4\\x70\\xa3\\x78\\x4f\\x18\\xc6\\xde\\xc2\\xdc\\xa0\\x2d\\xa2\\x9b\\x4f\\xd5\\x2e\\x96\\xe0\\xf4\\x84\\xfe\\xaf\\x1a\\x19\\x4b\\x08\\x12\\x85\\x04\\x2e\\x69\\x36\\x3a\\xde\\x28\\xb1\\x1b\\x03\\x1a\\x2c\\x47\\xb6\\x5c\\xe5\\x5f\\x7b\\xb4\\x93\\x4e\\x1b\\x9a\\x6d\\x6a\\xe6\\xaa\\x7c\\xdf\\x1a\\x3c\\xb3\\xaa\\x05\\x15\\x26\\xeb\\x11\\x7f\\x73\\xe4\\x4c\\xac\\x50\\x09\\xf5\\x88\\x8f\\xff\\x80\\x64\\x23\\x84\\x50\\xca\\x1f\\xd6\\xb0\\x3f\\xc0\\x4b\\x51\\x0d\\xaa\\xb0\\x77\\x4a\\x86\\xdd\\x45\\x5f\\x04\\x99\\x4a\\x9d\\x13\\x26\\x6c\\xf4\\x88\\x84\\x61\\x88\\xa8\\x78\\x97\\xa3\\x2c\\xed\\x73\\xc0\\xf9\\xc6\\x39\\x61\\x7d\\xcb\\x59\\x84\\x4c\\x6a\\x9d\\x9e\\xbb\\x69\\xe4\\xc7\\x6e\\xaa\\xcc\\xc7\\xb3\\x08\\xfc\\xc4\\xbd\\x9c\\xdb\\x1f\\x34\\x06\\xae\\x5c\\xde\\xfd\\x31\\x13\\x49\\x05\\x9b\\x7b\\x65\\x3b\\x8c\\x2d\\xca\\xde\\x85\\x46\\xb4\\xeb\\x6f\\x86\\x9f\\x36\\x8b\\x49\\x50\\x43\\x29\\xe1\\x45\\xd7\\xdb\\xa0\\x6f\\x6c\\x8f\\x91\\xcb\\x59\\xd9\\x5b\\xa0\\xd8\\x64\\x3b\\x50\\x8f\\x12\\x31\\x70\\x60\\xe2\\x07\\xef\\x1d\\x5a\\xdf\\x20\\x84\\xfa\\xc3\\xf1\\xfe\\xde\\xeb\\x05\\xd4\\x32\\x43\\x1a\\x64\\xc2\\x5b\\x5e\\x33\\x59\\x36\\xf6\\x79\\x2b\\x40\\x3d\\x60\\x8c\\x6b\\x8c\\xea\\x32\\x95\\xd9\\x89\\x71\\x09\\xa7\\xe0\\xd2\\xa8\\x1e\\x90\\x0c\\x8f\\x18\\xb1\\xba\\x86\\x5d\\x34\\x3b\\xe8\\x05\\x7c\\x58\\x71\\x0a\\xdd\\x10\\x6b\\xab\\x54\\x2a\\x35\\xdd\\x04\\x83\\xae\\x21\\x49\\x7e\\x7f\\x42\\x72\\x52\\x33\\xc5\\x8e\\x71\\xa0\\xc1\\x0c\\x2d\\x54\\xe5\\x88\\xaa\\x07\\x8a\\xbb\\x30\\x5c\\x26\\x8d\\x6b\\xc6\\x0c\\xb7\\x38\\x43\\x9b\\x8c\\xd9\\x3b\\xe3\\x85\\xc1\\x35\\x79\\xf6\\x56\\x44\\xe2\\x4e\\x25\\xf7\\x74\\x67\\xc0\\x28\\x75\\x93\\x20\\x40\\xc8\\x61\\xa5\\x58\\x67\\x26\\xb3\\x48\\x27\\x8b\\xc2\\x4f\\x9d\\x12\\x36\\x8c\\xae\\x98\\x4a\\x5b\\x53\\x8d\\x51\\xae\\xec\\x1b\\x5b\\x8e\\x09\\x0f\\x66\\x2d\\x29\\x8b\\x66\\x28\\xda\\xdc\\x79\\x65\\x14\\xb2\\x57\\xb2\\x3e\\x03\\x46\\xfc\\x89\\x13\\xa6\\x43\\x7f\\x8a\\x17\\xd1\\x7e\\x93\\x1a\\x8c\\xd6\\x95\\xc3\\x78\\x88\\xbb\\x78\\x44\\xed\\x17\\x10\\x3d\\x11\\xae\\xf5\\xe6\\x36\\x3c\\x28\\x8b\\x26\\x2f\\x84\\xcc\\x1d\\xd2\\x10\\xd3\\x3b\\xfa\\x4f\\xfc\\x4d\\x96\\xc9\\x3e\\xe6\\xaf\\x9e\\xc6\\xc2\\x35\\x63\\xbb\\xc3\\x28\\xa7\\x09\\x7c\\x40\\x56\\x77\\x17\\xa8\\xb8\\x99\\x9b\\xec\\xb3\\x5e\\xea\\x11\\x13\\x27\\xf6\\xea\\xb6\\x62\\xc7\\x6c\\x40\\x43\\xbd\\xf4\\x96\\xfe\\xfd\\xe2\\xb6\\xa8\\x11\\x82\\x7b\\x7f\\x44\\x03\\x79\\xc6\\x80\\x36\\xbd\\xfc\\xd4\\x63\\x95\\x58\\xfb\\x44\\xe0\\xee\\x3d\\xe2\\x9c\\x48\\x52\\x9b\\x44\\xc6\\x75\\x70\\x01\\xeb\\xbc\\x16\\xa4\\x88\\x58\\xf6\\x15\\x63\\x06\\xe7\\x2e\\x63\\x09\\x47\\x2e\\x65\\x03\\x43\\x70\\x2e\\xd4\\x8a\\x80\\x12\\x54\\xb3\\x61\\xb9\\x77\\x11\\x6a\\x0f\\xa4\\x78\\x8d\\x19\\xa0\\xdd\\xdd\\x32\\xa4\\x85\\xe2\\x5a\\xc3\\xd4\\xce\\x1f\\xc1\\x2e\\x17\\x01\\x0d\\x22\\x26\\x64\\xbc\\xe2\\x36\\x22\\x4b\\x0c\\x07\\x58\\x59\\x8a\\x2a\\x7e\\x48\\x17\\xbb\\x9f\\x0e\\xad\\x45\\x93\\xbc\\x10\\x2f\\x55\\xde\\x36\\x8f\\x25\\x03\\xe6\\x00\\x6b\\x78\\x67\\x94\\xa5\\xa0\\x32\\xf8\\x03\\xb3\\x5d\\xb8\\x7b\\x66\\x63\\xda\\xb0\\x3d\\xe6\\xc7\\x75\\x0a\\x72\\x94\\x9b\\x32\\x30\\xd6\\x39\\x61\\xc5\\x3d\\x5d\\x16\\x33\\xec\\x4a\\x8c\\xe5\\xd6\\x55\\x25\\x81\\xbb\\x10\\x86\\xbf\\xfb\\x6d\\x7e\\x8e\\x45\\x3e\\xce\\xa9\\x72\\x77\\xca\\x98\\xde\\x3d\\x89\\x9d\\x5c\\xdf\\x95\\x03\\x3e\\x7d\\xc2\\xb0\\x00\\x9f\\x94\\xbd\\xa8\\xbc\\x4c\\x01\\x0f\\xde\\xe9\\xef\\xe6\\x80\\x64\\xd7\\xfc\\xf8\\x10\\x32\\xa1\\x73\\x87\\x7d\\x51\\x46\\x9f\\x7d\\x4a\\x7a\\x5f\\xf3\\xe7\\x42\\x6a\\x21\\xc2\\x74\\x88\\xe8\\xa9\\x73\\xf5\\x76\\x5b\\x69\\x35\\x37\\x07\\x44\\xb6\\x4d\\xcc\\xf5\\x1f\\x08\\xda\\x66\\x59\\xbb\\x83\\x75\\x1e\\x76\\x0f\\x7f\\xb1\\x11\\x2b\\x30\\xfb\\x38\\x98\\x7c\\x13\\x16\\x7b\\xeb\\x4b\\xd5\\x9f\\xc4\\xc5\\x43\\x09\\x1f\\xdc\\xfa\\x50\\x56\\xfd\\x1c\\x85\\x01\\x89\\xd4\\x25\\x7b\\x7c\\x15\\xfb\\xf1\\xc8\\xd9\\x97\\x26\\xa9\\x89\\x4b\\xb7\\xa1\\xd2\\x27\\x18\\xc6\\x2d\\x00\\x6f\\x67\\xa3\\x4a\\xa2\\xf8\\x7d\\x8a\\x4f\\x38\\x60\\x5f\\x32\\xbd\\xad\\xc3\\x1a\\x92\\x85\\xd4\\x90\\x0c\\xc9\\x90\\x20\\xf7\\xe8\\x08\\xec\\xf1\\x7c\\xc3\\xe2\\x8b\\x6a\\x0d\\x03\\xa3\\x9b\\xfd\\x6b\\x1f\\x0a\\xe7\\xc6\\xff\\x23\\x55\\xca\\x8f\\x76\\xb0\\x52\\xea\\x1d\\xf5\\x54\\x0b\\x5a\\x93\\x31\\xf1\\xca\\x7a\\xe7\\xe1\\x8d\\xc3\\x9c\\xe3\\x50\\x0a\\x7b\\x59\\xb7\\x37\\x64\\xd1\\x6a\\x59\\x82\\x81\\x1f\\x09\\x22\\x67\\x02\\xb2\\x18\\xd6\\xce\\x64\\x4f\\x77\\xfe\\x05\\x8c\\xa6\\x37\\x84\\x7d\\xd4\\xce\\xbe\\x0a\\x2b\\x70\\x89\\x2e\\x20\\xed\\x32\\xdb\\xe4\\xf5\\xa7\\x3c\\xdb\\x29\\xf2\\x11\\x99\\x0d\\xb5\\xd3\\xa2\\x83\\x23\\x5f\\xf8\\x05\\xd3\\xfb\\xa7\\x30\\xfa\\xfa\\xac\\x76\\xaa\\x1b\\xe6\\xf4\\x4a\\x56\\x4a\\x18\\xf6\\x44\\xb0\\xea\\x96\\x95\\xb4\\x7a\\x12\\xaf\\x93\\xf9\\xb4\\xcd\\xd6\\x80\\x0a\\x42\\xf7\\x9f\\xf6\\x54\\x6a\\xef\\xb4\\x13\\x7a\\xf8\\xab\\x6c\\x38\\xc9\\x45\\x60\\xf8\\x1b\\x82\\xe3\\x1a\\x11\\xc1\\x5a\\xe3\\x84\\x61\\x2d\\xd8\\x54\\x37\\x60\\xd1\\xb5\\x7d\\x0d\\x25\\x5c\\x67\\xec\\x2e\\x3e\\x0f\\xc8\\x1a\\x63\\x0a\\xaf\\x53\\xe1\\x79\\x0d\\x96\\x1a\\x8c\\x53\\x8b\\xc5\\xe0\\xfb\\x41\\x00\\xf0\\x59\\xc0\\x39\\x61\\x56\\x35\\x21\\x31\\xdc\\x90\\x1b\\x97\\xb0\\x78\\xfd\\x3b\\x91\\xf4\\x0c\\x79\\xac\\x25\\xee\\xb2\\xb6\\x73\\x03\\x19\\xe3\\x9b\\x0a\\x68\\x72\\x7b\\x82\\x88\\x86\\x50\\x10\\x8d\\x14\\x2c\\xb5\\x42\\xad\\xc7\\x54\\x4d\\x78\\x0d\\xf1\\xfa\\x91\\x09\\x48\\x61\\xf0\\xb9\\x7d\\x63\\x14\\xf1\\x75\\xc0\\xa4\\x14\\x79\\xec\\xc4\\xb4\\x52\\x5d\\xb1\\x12\\xc9\\xe7\\xef\\x81\\xa1\\xa0\\x74\\xb2\\xbf\\xd1\\x18\\x89\\xd3\\x84\\x6f\\x3e\\x8a\\x78\\x6f\\x4f\\x02\\x86\\xb8\\xf8\\x98\\x7d\\x29\\x97\\xd2\\x5a\\xf6\\x37\\x82\\x4b\\xd6\\xa4\\xf9\\x03\\x13\\xe8\\xb9\\x46\\xe6\\x90\\x7a\\x93\\xfa\\x04\\x5e\\xe7\\x86\\xb8\\x1e\\x77\\x29\\x05\\x64\\x58\\x0d\\x4a\\x34\\x3c\\x6b\\xd1\\x68\\x2a\\xcb\\xb6\\x6a\\x88\\xf2\\x7d\\x2d\\xdb\\xd2\\xab\\x01\\xdf\\xe6\\xee\\xd3\\xb7\\x3c\\x2c\\xaa\\x37\\xb5\\x15\\xbd\\x34\\xe9\\xa0\\x73\\x84\\x0c\\xdb\\x67\\xcd\\xe3\\x32\\x1c\\x3b\\x3c\\x67\\xa4\\xe8\\x8c\\x55\\x72\\x49\\x93\\xb6\\x9d\\x78\\x87\\x41\\x1d\\x71\\xd1\\x37\\x9b\\x95\\xdb\\x83\\x99\\x50\\x9c\\x73\\x63\\x6f\\x69\\xd8\\xbc\\xfb\\x0c\\x48\\x08\\x71\\xdd\\x78\\x7b\\xc1\\x1e\\x34\\x8b\\xbb\\xbb\\xda\\xc1\\x9a\\x31\\x03\\x97\\x83\\x1b\\x13\\xb5\\xb9\\x67\\xcc\\x52\\x63\\x74\\x1c\\x4f\\x45\\x39\\x9e\\x8c\\xac\\x1c\\x53\\x98\\x4c\\xa9\\x44\\x24\\x5d\\x00\\x86\\x3f\\x1d\\x90\\xd9\\xbb\\xa0\\x22\\x16\\xf8\\x03\\x5a\\xd7\\x1d\\x3a\\xb4\\x32\\xa0\\x18\\x36\\x79\\x2c\\x86\\x7d\\xff\\x3d\\x37\\xc5\\xe4\\x96\\x4c\\x0f\\xa9\\x8c\\xe8\\x7a\\x6e\\x7e\\x08\\x85\\x09\\x10\\x23\\x7c\\xd0\\xb4\\x04\\x81\\xc6\\xab\\xc7\\xb2\\xe9\\x02\\xd8\\x16\\x5b\\xce\\x5c\\x2a\\x52\\x9f\\xee\\x0c\\xb0\\x27\\xe2\\x3c\\xda\\x19\\x18\\xbb\\x03\\x63\\xb6\\x16\\x3e\\x3d\\x63\\x53\\x15\\xea\\xe3\\x23\\x0a\\xad\\x1a\\x45\\xf9\\xd7\\x42\\x15\\xfe\\x32\\x98\\xa9\\x29\\x5a\\x1b\\xf6\\x2e\\x15\\xe6\\x67\\x44\\x85\\xf9\\xee\\x8a\\xd1\\xf6\\x11\\xd1\\x38\\x38\\x46\\x5a\\x32\\x87\\xd5\\x56\\x64\\x9b\\x69\\x46\\x0c\\xa9\\xd5\\x1d\\x03\\x72\\x2d\\x1f\\xd2\\x8a\\x4d\\x7b\\x81\\xc8\\x91\\x16\\xd9\\x07\\x5f\\x1a\\x4b\\xc3\\x70\\x51\\x5f\\x32\\x1d\\xe7\\x50\\x93\\xad\\x0d\\x00\\xd1\\x27\\x67\\x61\\x87\\x9f\\x3c\\x27\\xab\\x7b\\xba\\x0f\\x5f\\xa7\\xd1\\x9e\\xd4\\x50\\x16\\xb8\\xfa\\x92\\x3d\\x6f\\x89\\xf8\\xc1\\x16\\xda\\xe6\\xd3\\x0b\\x44\\x21\\x4e\\xd4\\x18\\x8a\\x6f\\x6c\\x1b\\x90\\x41\\xc0\\xcc\\xd5\\x1b\\x05\\x69\\x26\\x44\\xe7\\x3d\\x13\\xaf\\x1b\\xfb\\x0d\\xa2\\x7a\\x6b\\xa7\\xcc\\xd8\\x6d\\x84\\x89\\x3c\\x7c\\xef\\xe7\\x25\\xde\\x3c\\x6d\\x93\\xd0\\x85\\xd9\\x56\\x1a\\xdf\\x1f\\xe9\\x2b\\x49\\x9d\\x16\\x89\\x60\\x07\\x07\\xb2\\x3b\\x71\\xf7\\x59\\xd0\\x95\\xfd\\x21\\x54\\xd8\\x18\\x8b\\x4e\\x33\\x8d\\xf8\\x4d\\xb3\\xe2\\xf9\\xa5\\x7c\\xcc\\xc4\\x15\\x91\\xf3\\x9c\\xc2\\x09\\xfe\\x30\\x85\\x0e\\x57\\xdf\\x21\\xbb\\x2e\\x2a\\x00\\x2e\\x1f\\x0b\\xd5\\xaf\\xdd\\x14\\x9f\\x46\\xf9\\xf7\\x2a\\x83\\x36\\x73\\xd4\\x41\\xf6\\xc8\\x82\\x85\\x47\\xa4\\x16\\x3c\\x86\\x22\\xda\\x9b\\x07\\xd4\\x63\\x3e\\x6f\\xf9\\x7a\\xf6\\x80\\x42\\xf2\\x25\\x43\\x17\\x73\\x44\\x9b\\x32\\xc5\\x3b\\xb4\\x32\\xd6\\xc4\\x10\\xa5\\xf3\\x46\\xd8\\xc2\\x9b\\x17\\x9d\\x17\\xf0\\x1d\\xfb\\xd0\\xa4\\xa9\\x4f\\x67\\xc9\\x74\\xbd\\x57\\xba\\x4e\\xa4\\x8a\\xd3\\xaf\\x93\\x86\\xb6\\x77\\xff\\x89\\xbf\\xea\\xaa\\x60\\x26\\x91\\x00\\x88\\x0a\\xbe\\x42\\xc4\\xc6\\x86\\x55\\x8f\\xf7\\xd5\\x4d\\xfc\\x8d\\xbc\\x16\\xab\\x9f\\xc5\\x5e\\x98\\xda\\xd7\\xe0\\xc1\\x01\\xcc\\xbe\\xc1\\xd5\\x7d\\x11\\x1c\\xd1\\xf4\\xc0\\x44\\x4c\\x64\\x6e\\x9b\\x40\\x14\\xde\\x18\\x7f\\x8c\\xc1\\xed\\xc1\\x9c\\xe0\\x1a\\x77\\x39\\x22\\xc4\\x8f\\x03\\xee\\x7d\\x90\\x29\\x6b\\xa1\\x18\\xb7\\x0f\\x97\\xa4\\x9f\\x15\\x7f\\x1f\\x92\\xbf\\x98\\x12\\x8c\\xa9\\xca\\xa9\\x2f\\x4e\\xe1\\x5e\\xee\\xa3\\x2f\\x7d\\xc2\\x87\\xa6\\xfc\\xb0\\xb4\\x14\\x82\\x51\\x75\\x6d\\x28\\x97\\x31\\xc8\\x6d\\x28\\x09\\x18\\x6d\\x8a\\x7f\\x82\\x95\\x07\\xd4\\xc6\\x31\\x34\\xee\\x05\\xc4\\xc1\\x15\\x05\\x71\\x5f\\xcb\\xdc\\x22\\x04\\x34\\x64\\xf4\\x47\\x5c\\x12\\x04\\x7f\\xe4\\x22\\x0f\\xf4\\x10\\xb6\\xc4\\x0b\\x98\\x5a\\xe4\\x75\\x2b\\x92\\x51\\x7e\\xd1\\xa5\\xa0\\xf0\\xc0\\x2a\\x20\\x49\\x77\\xa8\\x7d\\x09\\x51\\x35\\xb8\\xda\\x03\\xde\\xcd\\x9b\\x8c\\x20\\xb7\\x66\\xcc\\x41\\x28\\x32\\x76\\x16\\x1c\\xb2\\x17\\x7f\\xf9\\xec\\x1d\\x8a\\x6f\\x6b\\xaf\\x98\\x09\\x37\\x9f\\xe0\\xec\\x17\\x85\\xac\\x18\\x98\\x22\\xb5\\xf0\\x06\\x60\\xef\\x26\\xcc\\x70\\xd5\\x6e\\xff\\x48\\xdc\\x30\\x5c\\xdc\\x6d\\x13\\xbc\\x13\\x7d\\xfe\\x99\\x0b\\xd6\\x72\\xf9\\xc9\\x3b\\xb1\\x69\\x38\\x7c\\x95\\x34\\x66\\x84\\x64\\x65\\xed\\xbf\\x99\\xaa\\x65\\xf9\\x73\\x95\\x1e\\xca\\xcb\\xdb\\xd2\\xa3\\xac\\xb7\\x4b\\x9b\\x20\\x30\\x85\\xc4\\x15\\xa7\\x25\\xa0\\x0c\\x5e\\x37\\x50\\xe2\\x8c\\xc8\\x32\\x0a\\x0c\\xfa\\x39\\x72\\xb8\\xab\\xe2\\x47\\x15\\xaa\\x5c\\x2f\\x6e\\xe5\\x65\\xe3\\xf5\\x50\\x10\\x5e\\xda\\xc6\\x8e\\x61\\x6d\\x8d\\xbd\\x3b\\xa8\\x17\\x6a\\x57\\x3a\\xdb\\xe7\\x76\\x4a\\x0f\\x6b\\x6d\\x6e\\x24\\x68\\x64\\xfc\\x36\\x76\\xbf\\x57\\x66\\x9d\\x5c\\x54\\x03\\x4b\\xa0\\x9c\\x17\\x2b\\x5f\\x10\\x1c\\x66\\x85\\x10\\x7f\\x34\\x4c\\x12\\x45\\xea\\xca\\x16\\x7a\\x5d\\xfb\\x9d\\xfc\\xa1\\x32\\x29\\x13\\x8e\\x5d\\x26\\x97\\x11\\xb3\\x61\\x34\\x41\\xbb\\x64\\x92\\x82\\x99\\xda\\xf3\\xea\\x8f\\x2d\\xbe\\x81\\x70\\x2f\\x48\\xb8\\x6e\\x1b\\x32\\xe2\\x11\\x5e\\x87\\xf9\\xb9\\xa0\\xc2\\x57\\xb4\\xc2\\x77\\x21\\x59\\xef\\xbc\\x61\\x72\\xcb\\xef\\x4f\\x65\\xd1\\xc0\\x4e\\x88\\xb5\\x28\\x59\\xf9\\xe8\\x1a\\xc7\\xd3\\x2d\\xd2\\x53\\xb5\\x8a\\xfd\\xb3\\x13\\x23\\xb8\\xf5\\x8a\\x5a\\xc0\\x0f\\x66\\xfe\\x19\\x7c\\xdf\\x22\\xff\\xff\\xf4\\xce\\xec\\xd9\\xdc\\xd4\\x06\\x76\\x25\\xa5\\x8b\\xdc\\xfc\\x12\\x26\\xcc\\xdd\\xd6\\x33\\x00\\x10\\xc2\\x5d\\x20\\x79\\xae\\x95\\x26\\x1b\\x79\\x27\\xb7\\xbd\\xc0\\x3d\\xc4\\xe7\\x4f\\x99\\xfd\\xf1\\xb1\\xa2\\x83\\x65\\xba\\xc1\\x23\\x5d\\xde\\x5e\\x09\\x34\\xa9\\x01\\xdf\\x50\\x0a\\x50\\xd2\\xcb\\xe5\\xe6\\x96\\x58\\x01\\x1b\\xd2\\x29\\xa5\\x0d\\x82\\x9a\\xe1\\x0c\\xe5\\x43\\xa4\\x2a\\xbf\\x3a\\x9c\\x97\\x8a\\xa7\\x95\\x6b\\x3c\\x67\\xdf\\xe2\\xa3\\x46\\x2a\\x71\\xbc\\xf9\\x19\\xc8\\x89\\x2a\\x65\\x95\\xe8\\xb4\\x33\\xda\\xb8\\x14\\x4b\\x03\\x84\\xe3\\xf9\\x4b\\xbc\\xad\\x8f\\xce\\x41\\x53\\x5b\\xee\\xda\\xae\\xa1\\xd3\\xa3\\x27\\x24\\x5f\\x41\\xc5\\x5d\\x43\\x32\\x91\\x75\\xd4\\xd0\\x46\\x41\\x8b\\x96\\xea\\x53\\x85\\x28\\x9c\\xe3\\xf2\\xe7\\x6d\\x7b\\xe6\\x1a\\x2b\\xf8\\xec\\x04\\xce\\x46\\x71\\x3d\\xc0\\xfc\\xc4\\xea\\xac\\x51\\x25\\x4d\\xb1\\x5d\\x67\\xac\\xdd\\x27\\x1d\\x48\\x5c\\xbc\\x0b\\x49\\xa6\\xff\\xcf\\xd5\\x51\\xab\\x68\\xdc\\xe7\\x1b\\x55\\xc6\\x5c\\x72\\xdf\\x44\\xd7\\xb7\\x10\\x6f\\xfd\\x6b\\x86\\x2a\\x79\\x11\\xb7\\xb7\\x51\\x45\\x5f\\xaf\\x08\\x5a\\x40\\x19\\xa9\\xac\\x81\\x71\\x43\\xe6\\x97\\x7a\\x29\\xb3\\x03\\xa7\\x3f\\x7d\\x9c\\x32\\xf7\\x54\\x24\\xde\\xf0\\x53\\x00\\x66\\x20\\xe3\\x62\\xd8\\x93\\xa9\\x9b\\x2b\\x6b\\x93\\x79\\x99\\x6d\\xcc\\x88\\x41\\xef\\xdd\\x29\\x8d\\xf8\\x73\\xdc\\x6f\\x58\\xe1\\x1e\\x1e\\x7e\\x2c\\xcd\\xaa\\x9b\\xda\\xab\\x4b\\x8a\\xc9\\x9b\\x07\\xda\\xa8\\xc9\\x03\\xed\\x9d\\x72\\x69\\x93\\x00\\x30\\x79\\x3f\\x0c\\x3f\\xb5\\x51\\x7f\\xba\\xb3\\x99\\x6e\\x35\\x59\\x86\\xae\\x49\\x2f\\x98\\x37\\xa0\\x30\\x93\\x1d\\xa9\\xa9\\xf3\\x56\\x4d\\x2c\\x98\\xdf\\x30\\x1b\\xdb\\xd5\\xc6\\xc0\\x24\\x0b\\x6a\\x62\\xaf\\xa8\\xba\\x73\\x0a\\xa2\\xe6\\xef\\xca\\x99\\x74\\x87\\x55\\x0c\\x08\\xca\\xa4\\x87\\x63\\x50\\xc1\\xdf\\xa8\\x89\\x78\\x09\\xb7\\x77\\xa5\\xbe\\x4a\\x0e\\xfc\\x4a\\xa0\\x29\\xfd\\xf8\\xc1\\x59\\x19\\x43\\x94\\xbe\\xc1\\xfe\\x7c\\xae\\xc3\\x60\\x90\\xab\\x72\\x30\\x3c\\x97\\x20\\x56\\x09\\x61\\x02\\xb8\\x2c\\xeb\\xef\\x5d\\x98\\x57\\xdc\\x8a\\x51\\xab\\x06\\x63\\xfb\\x3d\\x56\\xe5\\x5f\\xb1\\xf6\\x9d\\x8e\\x68\\x9b\\xd1\\x67\\xf7\\xf4\\x1e\\xbc\\xf2\\x8e\\xe3\\x0e\\xe7\\x0f\\x65\\xa3\\x04\\xc5\\x7c\\x93\\xae\\x7b\\xae\\xdd\\x97\\xab\\xab\\x3b\\x23\\x52\\x4b\\x31\\xb7\\x84\\xb0\\x1a\\x4e\\xc8\\x1c\\x0b\\x14\\x32\\xf4\\x56\\x62\\x3f\\x68\\x6b\\xb5\\xc2\\xb1\\xea\\x2b\\xc7\\x9a\\xe0\\xcf\\xb4\\x5b\\xcd\\x68\\x98\\xc6\\x9c\\x3f\\xbc\\x8d\\x4f\\x3e\\x60\\x5b\\x70\\x4a\\xed\\xa0\\x3e\\x15\\x03\\xda\\x96\\x7b\\xe5\\x96\\x9d\\x22\\x41\\xd8\\x49\\x86\\xe2\\x15\\xc4\\xca\\x67\\x1e\\x7e\\x9e\\x19\\xca\\x8a\\x19\\xe1\\xe7\\x93\\xbb\\x03\\xb8\\x32\\xd6\\xd7\\xa5\\x5e\\xf6\\xe4\\x07\\xb1\\x41\\xca\\x27\\x88\\xf0\\xfc\\x63\\xdd\\xcf\\x11\\x26\\x32\\xa5\\x08\\xb9\\xc0\\xc8\\x7d\\x99\\x3d\\xfc\\x49\\x08\\x5c\\xc3\\xde\\x76\\xb7\\xca\\x5c\\xc8\\x58\\x43\\x92\\xdf\\xf1\\xb7\\x0a\\x7f\\xd4\\x48\\x28\\x4a\\x60\\xc8\\xe4\\xc4\\x10\\x70\\x7f\\xaf\\xac\\xfc\\xbd\\x28\\xda\\xf4\\x8e\\x2b\\xc5\\x66\\x54\\x1b\\x52\\xa4\\xbe\\x02\\x44\\x78\\xf1\\x36\\x5a\\xe3\\xa5\\x9d\\x9b\\x30\\xbd\\x90\\x9e\\xd7\\x69\\x54\\xbe\\x0f\\x78\\xbd\\x62\\x27\\x31\\x60\\xf7\\x09\\x12\\xad\\x0f\\xfd\\xf6\\x84\\x8e\\x77\\xd8\\xf7\\xee\\x0b\\x0c\\xe9\\xa7\\x37\\xd8\\xe8\\x4b\\x68\\xf9\\x67\\xd4\\xac\\x8b\\x3e\\x16\\x30\\x2c\\x78\\xcd\\x28\\x75\\x2a\\x6f\\xdd\\x1a\\x02\\xcb\\x1a\\x35\\xe2\\x70\\x3c\\x9f\\x41\\x16\\x7c\\x98\\x0f\\x8a\\x9b\\x15\\x48\\x83\\xf6\\xcc\\xaf\\xac\\xb5\\xce\\x7b\\xbf\\xfe\\xf7\\xff\\x09\\x00\\x00\\xff\\xff\\x2a\\x55\\x00\\x86\\x40\\x70\\x00\\x00\")\n\nfunc uiJsLibsMithriljs020MithrilMinJsMapBytes() ([]byte, error) {\n return bindataRead(\n _uiJsLibsMithriljs020MithrilMinJsMap,\n \"ui/js/libs/mithriljs/0.2.0/mithril.min.js.map\",\n )\n}\n\nfunc uiJsLibsMithriljs020MithrilMinJsMap() (*asset, error) {\n bytes, err := uiJsLibsMithriljs020MithrilMinJsMapBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/js/libs/mithriljs/0.2.0/mithril.min.js.map\", size: 28736, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiJsLibsNvd3171NvD3MinJs = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\xec\\xbd\\xf7\\x76\\xe3\\x48\\x92\\x2f\\xfc\\xff\\x3e\\x85\\xc4\\x99\\xd5\\x02\\xc5\\x24\\x8b\\x54\\x55\\xf5\\xcc\\x90\\x0d\\xf1\\xc8\\x95\\x77\\xd3\\xd5\\x76\\x74\\x74\\xfa\\x02\\x20\\xe8\\x49\\x50\\xf4\\x54\\x89\\x0f\\xf5\\xbd\\xc2\\xf7\\x64\\x37\\x22\\x0d\\x90\\x09\\x64\\x02\\xa0\\x4a\\xea\\xde\\xdd\\x3b\\xa7\\x4f\\x97\\x88\\x44\\x7a\\xa4\\x09\\xf3\\x8b\\x88\\xa7\\x4f\\x0e\\x26\\xab\\xf6\\xb3\\x83\\x55\\x30\\x9b\\xf7\\xc3\\xc9\\x41\\xbd\\xfa\\xf7\\x6a\\xfd\\xc0\\xea\\x2d\\x16\\xd3\\x79\\xe3\\xe9\\xd3\\x6e\\x7f\\xd1\\x5b\\x7a\\x55\\x3f\\x1c\\x3f\\x9d\\x84\\xab\\xe5\\xfc\\x29\\x66\\xb6\\x0f\\x8e\\x6b\\xf5\\x17\\x95\\xda\\xb3\\xca\\xf1\\xb3\\x83\\x27\\x4f\\xff\\xe3\\xb0\\xb3\\x9c\\xf8\\x0b\\x28\\x6d\\xd9\\x5f\\x57\\xee\\xec\\xc0\\x75\\xbe\\xee\\x9a\\x6e\\xb5\\x1d\\xac\\x9c\\xc3\\x3a\\x71\\xab\\x8b\\x30\\x1c\\x2d\\xfa\\x53\\x27\\xfa\\x75\\x77\\xf7\\x75\\x07\\xe9\\xcb\\x45\\x7f\\x34\\x77\\xf8\\x5f\\x9e\\x36\\x0e\\xdb\\x01\\x4d\\x64\\x3f\\x78\\xaa\\xdf\\x73\\x67\\x8b\\xb9\\x43\\x7f\\x77\\x67\\xee\\xb4\\x37\\x77\\xae\\xae\\xe1\\xf7\\x28\\xec\\xf2\\xd4\\x76\\x38\\xe6\\x3f\\xfa\\xf3\\xa9\\xbb\\xf0\\x7b\\x4e\\xfb\\x59\\xf4\\xdb\\x2a\\xcd\\x82\\x49\\x3b\\x98\\xfd\\x3e\\x5f\\x40\\x3d\\x25\\x22\\x1e\\xe1\\xdf\\x92\\x4d\\x5e\\xf2\\xde\\x57\\xa7\\xb3\\x70\\x11\\x2e\\xb6\\xd3\\xa0\\xea\\xf5\\x27\\xed\\xbb\\x3b\\xcb\\xf0\\xc6\\x89\\xc6\\xeb\\xda\\x5f\\xfb\\x1d\\xab\\x24\\x9e\\x4b\\x87\\x0e\\x66\\x0a\\x3b\\x07\\x8b\\x5e\\x7f\\x6e\\x2f\\x7a\\xb3\\x70\\x7d\\x30\\x09\\xd6\\x07\\x3f\\x42\\xea\\xe5\\x6c\\x16\\xce\\xac\\x92\\xa1\\xce\\x83\\xca\\xc1\\xba\\xe7\\x2e\\x0e\\xfa\\xf3\\x83\\xc5\\x6c\\xdb\\x9f\\x74\\x0f\\x16\\xe1\\x81\\x17\\x1c\\x78\\xe1\\x12\\x5e\\x42\\xea\\x24\\x5c\\x1c\\xf8\\xee\\x68\\xe4\\x7a\\xa3\\xa0\\x64\\x37\\x71\\x9e\\x3d\\xe7\\x74\\x36\\x73\\xb7\\x52\\x4d\\xf3\\x51\\xdf\\x0f\\xaa\\x98\\xcd\\x72\\x67\\xdd\\xe5\\x38\\x98\\x2c\\xe6\\xa4\\x6e\\x13\\xdf\\xc1\\x0e\\x11\\xa9\\xe7\\x36\\x4c\\x56\\x20\\x3f\\xce\\x82\\xc5\\x72\\x36\\x39\\xf0\\xab\\xee\\x74\\x3a\\xda\\x5a\\x98\\xff\\xa0\\x3f\\x81\\x09\\x9b\\xf8\\x38\\xa0\\xf6\\xd1\\x91\\xdb\\xc2\\xc4\\x86\\x4b\\x70\\x3d\\x4c\\x7c\\x77\\x61\\x15\\x69\\xde\\xb6\\xed\\x5d\\x93\\x57\\xde\\x8e\\xf3\\xd2\\x0e\\xc5\\x8f\\x24\\x90\\x5e\\xe1\\x8c\\xb5\\x49\\xb0\\xb3\\x09\\x5d\\x44\\x47\\x47\\x56\\xfc\\x59\\xab\\xd0\\xd9\\xc4\\xd7\\x94\\x06\\xc1\\x56\\x44\\x95\\xbe\\xf8\\xb1\\x3f\\x0e\\x9c\\x32\\xd6\\x75\\xe1\\x2e\\x78\\x65\\x9a\\x4a\\x70\\x0d\\x68\\xaa\\x80\\x64\\xb5\\x02\\xbe\\xda\\x60\\x09\\x2f\\xdc\\x11\\x7d\\xa5\\xe6\\xac\\x24\\xdb\\x66\\x05\\xac\\x12\\x2d\\x50\\x4a\\x15\\xb7\\x77\\xb6\\xcd\\x12\\xe5\\xaf\\x00\\xab\\x89\\x8f\\x79\\x0d\\x8b\\x22\\x5c\\xe3\\x4c\\xcf\\xc3\\x51\\x70\\x74\\xc4\\x7f\\x60\\x01\\xe5\\x81\\x7d\\x2f\\x3b\\x95\\x62\\xf1\\x14\\x12\\x7f\\x89\\x26\\x6c\\xa8\\xe0\\xc0\\xdc\\x44\\xbc\\x8e\\x1d\\xb1\\x8e\\x95\\x56\\x0d\\x4b\\x97\\x6d\\x7a\\xcf\\x31\\xbc\\x66\\xeb\\x41\\xaa\\x88\\xf0\\xdf\\x76\\xd3\\x33\\x76\\x75\\xc7\\x57\\x4c\\x94\\x72\\x15\\xfd\\xaa\\x8e\\x82\\x49\\x77\\xd1\\xab\\xd4\\xaf\\xe9\\x76\\x0f\\xa6\\xb3\\x00\\xd6\\x62\\x20\\xef\\x4a\\xe2\\xd9\\x5f\\x53\\x13\\xb7\\x76\\x67\\x13\\xf5\\xc9\\x2a\\xd1\\xa3\\x0f\\x7f\\xc2\\x86\\x6b\\x1c\\xfc\\x9f\\x52\\xd9\\x2d\\x97\\xfe\\xcf\\x41\\xcf\\x9d\\xc3\\xd6\\x0b\\x60\\xbd\\x46\\x95\\x57\\x0f\\x4a\\xc4\\xbb\\xbb\\x2b\\x95\\x6c\\x6c\\x94\\x2d\\x9d\\xb8\\x41\\x68\\xce\\x73\\xe0\\x75\\x3d\\x7a\\x57\\x75\\xe1\\xcd\\x2a\\x70\\x0e\\x6b\\xf2\\xb2\\x93\\xd7\\xad\\xc5\\xf6\\xb0\\x2f\\x7f\\xfd\\x0e\\x1c\\x10\\x98\\x08\\x8b\\x9f\\x74\\x9c\\x5a\\xd3\\x3b\\xe9\\xc0\\xe2\\xc7\\x95\\xc6\\x6b\\xbd\\x59\\x06\\xcb\\xe0\\xaa\\x73\\x6d\\x37\\x3b\\xe5\\xb2\\xdd\\x76\\x82\\x6a\\x37\\x98\\x04\\x33\\xe8\\xa1\\x65\\x13\\xfe\\xc9\\xd8\\x06\\xf4\\x5c\\x7f\\x18\\x7d\\x45\\xf1\\x65\\x8e\\x8e\\xe2\\x97\\x56\\xdb\\x8e\\x0e\\xd3\\xea\\x74\\x39\\xef\\x41\\x42\\x53\\x6d\\xa8\\x3a\\x9f\\xe2\\x86\\xb6\\x6a\\xa4\\x63\\x93\\xc4\\x2b\\xf6\\x11\\x5a\\xf3\\x80\\xae\\xf5\\x70\\xb9\\xb0\\x7c\\xbb\\x61\\xa5\\xc7\\x0a\\xff\\x5a\\x76\\x7a\\x5a\\xea\\x70\\x28\\x28\\x65\\x77\\x9a\\x3c\\x89\\x36\\xd9\\x91\\xef\\xb6\\xdb\\xaf\\xb0\\xd3\\xca\\xec\\xf3\\x71\\xc6\\xab\\xa5\\x76\\xad\\x19\\xbc\\xe5\\x39\\x5f\\xc5\\x7c\\x35\\xe4\\xbc\\x44\\x4c\\x8a\\x94\\x0a\\xcb\\x2b\\x35\\x68\\x3a\\x4d\\x5e\\x6a\\x38\\x77\\x77\\x22\\xc1\\x82\\x71\\x94\\xe0\\xc0\\x0e\\x3a\\xfd\\x49\\xd0\\x8e\\xaf\\x03\\xb8\\xcc\\x96\\x74\\x87\\x69\\xde\\x05\\x9b\\x69\\x08\\x97\\x1b\\x74\\x8f\\xe5\\xaa\\xf2\\x04\\xc7\\xb5\\xb5\\x75\\xb1\\x5d\\x0b\\xd9\\xf9\\xf6\\x9d\\xac\\x30\\x27\\xbd\\x01\\xab\\xeb\\x59\\x7f\\x11\\x28\\xd7\\x13\\xdf\\x47\\xab\\xb0\\xdf\\x3e\\xa8\\x1d\\x3a\\x0e\\x2f\\xd4\\x71\\xe7\\x0b\\x28\\xd0\\xe2\\x7f\\x59\\x41\\xc8\\xdf\\x70\\x2d\\x9b\\x5f\\xa7\\x30\\x24\\xb7\\x7d\\x9f\\xba\\xb0\\x9c\\x54\\x55\\x7f\\xb2\\x80\\x19\\xa7\\x13\\xf5\\x6a\\xd9\\x87\\x4b\\x1d\\x86\\x23\\x2f\\xfa\\xd2\\x12\\x0e\\xa5\\xf9\\x62\\xd6\\xf7\\x17\\xa5\\xa6\\x48\\x3f\\xf0\\xac\\x91\\xfd\\x75\\x54\\x0d\\x5c\\xb8\\xbd\\xa3\\xcc\\x90\\x14\\x65\\x18\\x47\\xc4\\x06\\x5c\\xf4\\xe3\\x10\\x2a\\xa1\\x77\\x96\\x0d\\x97\\x9c\\x8b\\x9f\\x14\\x76\\x0d\\x7c\\x43\\xd2\\xc7\\x2d\\x38\\x80\\xc5\\xd4\\x84\\x73\\x6f\\x08\\xb3\\xd6\\xc6\\xfc\\xc1\\x0a\\xbe\\x71\\x35\\xec\\x74\\x60\\x0d\\xfe\\x0a\\x59\\x13\\x49\\xbf\\x91\\xd2\\x7c\\xd5\\x85\\x29\\x8f\\x5f\\xc0\\x96\\xed\\x06\\xf8\\xa7\\xfb\\xd1\\x1d\\xc3\\x97\\xb4\\xfa\\xb8\\x88\\x49\\xf2\\xbd\\x3f\\x72\\xe7\\x73\\xcc\\x51\\xf5\\xdc\\x79\\xf0\\xb3\\x3b\\xaa\\x8e\\x19\\x01\\x32\\x59\\x55\\x46\\x41\\x97\\x12\\x1c\\x50\\x18\\x3a\\x54\\x83\\xe3\\xbf\\x8f\\xfd\\xa9\\x38\\x1d\\xd8\\x4d\\x9d\\x05\\x09\\xf0\\xd7\\x22\\x9c\\xda\\xa4\\x76\\x02\\xd4\\x47\\xed\\x04\\x16\\x56\\xfb\\x24\\xbc\\xbb\\x0b\\x4e\\x80\\x62\\x8a\\x5a\\x9a\\x05\\x23\\x3c\\x91\\x7e\\xa4\\x0d\\x1e\\x1d\\xb1\\xaf\\xe1\\x48\\x5d\\x55\\x32\\x54\\xc3\\x35\\x2c\\xf8\\x2f\\x3f\\xbf\\xba\\x1c\\x05\\xb8\\xb0\\xef\\xee\\x06\\xf4\\x96\\x81\\xa9\\x78\\xa0\\x1a\\x61\\x0c\\x79\\x25\\xa2\\x59\\x31\\x0d\\x43\\x9a\\x37\\x36\\x5f\\x3e\\x2c\\xeb\\xcf\\x21\\x5d\\x3a\\x97\\x98\\x7d\\x7e\\x8e\\x19\\x80\\x96\\x60\\x6b\\x50\\x10\\x14\\xbd\\x6a\\xc0\\x3a\\xf1\\x01\\x17\\x00\\x9e\\x24\\x5f\\xe9\\x52\\xf8\\xb5\\xd1\\x26\\xf4\\xc7\\x6f\\x0d\\xbc\\xf9\\x3d\\xbe\\x3d\\xe9\\xfa\\x7b\\x0f\\xeb\\xcf\\x9a\\x2c\\x47\\x23\\x9b\\xd0\\x7e\\xfb\\xd5\\x5e\\xbf\\xdd\\x0e\\x26\\x16\\x7c\\x92\\x5d\\xfc\\x50\\x67\\xe7\\xf3\\xc8\\xe9\\xc2\\x0a\\x06\\xea\\x78\\x81\\xe7\\xa3\\xda\\xde\\x38\\x5c\\x05\\x9a\\x06\\xc9\\x14\\x3b\\xfe\\x2b\\x7c\\xfc\\x65\\xd0\\x18\\x41\\xf3\\xa5\\xb6\\x37\\xf2\\xe1\\x24\\x1d\\x96\\xe4\\x29\\xc2\\xed\\x7c\\x74\\x14\\xd5\\x78\\xc1\\xf3\\x14\\xaa\\x30\\xb7\\xb6\\xf3\\x82\\x55\\xed\\x70\\x8c\\x13\\xac\\x66\\x0e\\x25\\xfd\\x05\\xdf\\x43\\xa1\\x03\\x0b\\xf0\\x1f\\xdf\\xd5\\xc8\\xd4\\x81\\x6f\\xf6\\xbc\\x56\\x23\\x37\\xce\\x84\\x67\\x39\\x85\\xdb\\xbc\\xd4\\x85\\xef\\x53\\x59\\xc3\\x39\\x8c\\x7f\\xa5\\x1d\\x8e\\x93\\xfb\\xde\\xdd\\x06\\xb3\\x92\\x5d\\x6d\\xbb\\x0b\\xd7\\xba\\x1a\\x5d\\xdb\\x64\\xe6\\xdc\\x00\\x99\\xb4\\xc0\\xf3\\x11\\x6f\\x7c\\xbc\\x13\\x4a\\x5d\\xc8\\xe1\\x2e\\x16\\x40\\x11\\xd3\\x6f\\x0f\\x44\\xf9\\x01\\xaf\\xf2\\xc0\\x58\\x65\\x73\\x96\\x51\\x5c\\x2d\\x15\\x7d\\x6a\\x20\\xf0\\x07\\xb8\\xe3\\x28\\xcd\\xb7\\x08\\x97\\x7e\\x0f\\x3f\\x5b\\x89\\x8c\\x6d\\x9a\\x32\\x16\\x1f\\x12\\x52\\x08\\xac\\x80\\x38\\x11\\x56\\x93\\x9c\\x16\\x7d\\x43\\x51\\x32\\x7a\\x82\\xe5\\xd5\\x15\\xad\\x39\\xb8\\xb0\\xd2\\xeb\\x2d\\x3e\\xef\\x7c\\xd8\\x7d\\x78\\x13\\xc5\\x45\\x8e\\x8e\\xa4\\x07\\x3e\\xa6\\x4d\\xbd\\x64\\xc3\\xd7\\xf5\\xf1\\x66\\x89\\x8f\\xe7\\x04\\x9b\\xe5\\xc1\\xac\\xf2\\xaf\\x56\\xaa\\x1a\\x47\\x2f\\x7f\\xb5\\x11\\x4b\\xa1\\x1f\\x06\\x3b\\x7a\\xe8\\xf8\\xad\\x2b\\xce\\x7f\\x55\\x3f\\xba\\x1f\\x17\\xe1\\xbf\\x82\\x59\\x08\\x7d\\xbc\\x6e\\xc0\\x5d\\xfb\\x05\\xce\\xe4\\x49\\x17\\xa9\\xb4\\xe4\\xb7\\xe3\\xf5\\xa4\\xe6\\xbf\\x2b\\xce\\xf7\\xe8\\x25\\x0c\\x84\\x68\\xae\\x10\\x77\\x17\\x65\\x38\\xce\\xc9\\xb0\\x85\\x1a\\xa6\\xd1\\x03\\xe4\\xae\\xe1\\x84\\x07\\x9b\\x3e\\x50\\x50\\x30\\xcd\\x74\\x0f\\x22\\x2d\\xbd\\xb3\\xf9\\x6a\\xf6\\x23\\xe6\\x51\\xb0\\x9b\\x40\\x6a\\xf9\\xd5\\xf6\\x12\\xae\\x7d\\x6c\\x04\\xbe\\x27\\xec\\xf1\\xe0\\x02\\xce\\x9f\\x2d\\x3e\\xfc\\xde\\x9f\\xbf\\x91\\x56\\x1b\\xae\\x34\\x3c\\x0a\\x92\\x07\\x41\\x9b\\x7d\\x5a\\xfe\\x85\\x3b\\xce\\x57\\x3c\\xb3\\x1b\\x35\\x02\\x07\\x76\\xa3\\xb6\\x23\\x5d\\xba\\x87\\x80\\x8e\\x00\\xd2\\x08\\x26\\xc0\\x85\\xe9\\x22\\x09\\x1e\\x34\\x79\\x74\\xc0\\x9c\\x25\\x4e\\xaf\\x38\\xe5\\x9c\\x2d\\xae\\x52\\xe2\\x70\\x80\\xc5\\xcc\\x2f\\x34\\xda\\x8b\\xa1\\x53\\x3a\\xa5\\xbd\\xfe\\xf5\\x93\\x37\\x80\\x8f\\x5c\\xea\\x4f\\x38\\x79\\x20\\x0e\\x48\\x2f\\xe6\\x87\\x7b\\x30\\x6d\\x82\\x13\\xf7\\xe1\\xf7\\x18\\x4e\\xde\\xfe\\x44\\x77\\xc1\\x27\\x49\\xed\\x96\\x45\\xef\\x25\\x47\\x47\\x8d\\x20\\x4f\\x3f\\x6d\\xd1\\x7f\\x1b\\x34\\x17\\x61\\xb7\\x99\\x21\\x33\\xbe\\x6a\\xb1\\x3f\\x0d\\x7e\\xed\\x79\\x76\\xa3\\xb3\\x83\\xfe\\xac\\xfb\\xed\\x45\\xaf\\x58\\x77\\xe0\\x8a\\xc7\\x62\\x6d\\x2c\\xd6\\x0b\\xfa\\xdd\\xde\\xa2\\x58\\xb9\\x80\\x95\\x0b\\xb0\\xdc\\xe6\\x0b\\x7e\\xac\\x62\\xe5\\xba\\xac\\x5c\\x17\\xcb\\xcd\\x7b\\xe1\\x5a\\xb3\\xaf\\xb3\\x8a\\xf7\\x59\\xf1\\x3e\\x2d\\xbe\\xea\\x9e\\x87\\x93\\x85\\x0b\\x85\\x67\\xc5\\x4a\\x0f\\x58\\xe9\\x01\\x94\\x4e\\x90\\x53\\x67\\xfd\\x39\\x7c\\x74\\x85\\xef\\x21\\x7e\\x82\\xa0\\x82\\xab\\xfe\\xd0\\x72\\x65\\x4e\\x9e\\x32\\xed\\xe2\\x22\\x3d\\xc0\\x75\\xc4\\xd6\\x77\\xb3\\xed\\x68\\x04\\x19\\x7e\\x4b\\xd7\\xc9\\xea\\x66\\xd7\\xf0\\x69\\xb1\\x20\\xc1\\x76\\x09\\x4e\\x1f\\x72\\x57\\xa0\\xbf\\x1d\\xdc\\x02\\x1e\\xed\\x27\\xf0\\x36\\x81\\xcd\\x3e\\x39\\xdd\\x2c\\x63\\x77\\x63\\x5d\\x01\\x6b\\x41\\xcb\\x01\\x37\\x47\\xf7\\x8b\\xe5\\x5e\\x75\\x81\\xbb\\x41\\xa1\\x4a\\xbc\\x7e\\x22\\x52\\xbe\\x07\\x27\\x67\\xcf\\xe9\\x62\\x4e\\xc7\\xf1\\xc4\\x10\\xba\\xb4\\x23\\x7d\\x5a\\x67\\x7f\\x62\\x5d\\x75\\xcb\\xc8\\x39\\x44\\x5c\\x22\\x9c\\xff\\xb4\\xde\\x3e\\xd4\\xcb\\x4a\\xe8\\xaa\\xa6\\x77\\x84\\xd3\\xb7\\xc9\\x07\\x77\\xd1\\xab\\xba\\xde\\xdc\\x1a\\x54\\x3c\\xfb\\xc4\\x89\\x1e\\x7b\\xf0\\xd8\\xea\\xe2\\x47\\x74\\xab\\xb8\\xbf\\x83\\xf9\\x82\\xde\\xa2\\x6f\\xa0\\xae\\x4d\\xf6\\x37\\x60\\xc7\\x47\\xfd\\x69\\x8d\\x9f\\x1e\\xcd\\x68\\x1a\\x81\\xe1\\xbb\\x54\\x28\\x5c\\x17\\x58\\x2d\\x7a\\xb8\\x77\\xe3\\x96\\xbd\\x8a\\x6b\\x37\\xdb\\x27\\x0e\\xf2\\xfd\\x27\\x5d\\x4a\\xc2\\x76\\x51\\x76\\x03\\x07\\x1e\\x81\\xa5\\x6c\\x22\\xa5\\x93\\xa7\\xa0\\xc2\\x68\\xc6\\x64\\x36\\xa3\\x06\\x25\\x5a\\x9a\\x5f\\x29\\x43\\xbb\\x29\\x88\\x60\\x18\\x30\\xd4\\x04\\xc7\\x6d\\x4c\\xfd\\xba\\x90\\x28\\xee\\x1e\\xcc\\x65\\x0b\\x89\\x94\\xc8\\x0b\\x9b\\x9c\\x1d\\xd9\\xab\\x7e\\xb0\\x3e\\x0b\\x37\\x25\\xbb\\x41\\x87\\x0e\\x8d\\x31\\x6e\\x99\\x32\\x97\\x50\\xfa\\xa0\\x24\\x18\\xe1\\xa9\\x3b\\x9b\\xc3\\x74\\x2e\\x80\\x8b\\x9c\\x2f\\xb6\\xa3\\xc0\\x2a\\xd1\\x23\\x01\\xce\\xbc\\x7a\\xcd\\x7e\\xea\\x5d\\x1d\\x5f\\x37\\xa7\\xec\\x6c\\x61\\x7f\\x9e\\xf8\\x64\\x4a\\xcf\\x25\\xfa\\xef\\x13\\x7f\\xb7\\xdb\\x45\\xe3\\xf2\\xd9\\xb8\\x0e\\x27\\x7c\\x60\\x4d\\xd7\\x19\\xb6\\x86\\x8d\\x76\\xe8\\xd3\\xdd\\x55\\xf5\\xc2\\xf6\\x96\\xc8\\x74\\x8f\\x1b\\xdf\\x6e\\xed\\xfe\\x4a\\x73\\xb9\\xf1\\x59\\x3c\\x28\\x95\\xad\\x41\\x6b\\xd0\\x28\\x6d\\xb6\\x15\\x9e\\x04\\x83\\xe7\\xb9\\xfb\\xed\\x12\\x59\\xd9\\x64\\x22\\xfa\\x0f\\xdd\\xc2\\xfb\\x4a\\x3c\\x62\\xa7\\xe9\\xfd\\x15\\x65\\x08\\xa7\\xae\\xdf\\x5f\\x6c\\x45\\x62\\x7c\\x53\\x43\\x1f\\xc8\\xc1\\x02\\x65\\x7d\\xf0\\xa7\\x0d\\xff\\x23\\x41\\x45\\x3b\\x13\\xb4\\xad\\x35\\x12\\x25\\x90\\x5f\\x7d\\x0e\\x81\\x42\\x63\\x73\\x2f\\xcd\\x43\\x9b\\xcd\\xc3\\xec\\xe8\\xe8\\x0c\\x76\\x1f\\x4c\\x3c\\x17\\x3b\\x74\\xf8\\x1c\\xc2\\x56\\x64\\x84\\x80\\xd3\\x6f\\xf5\\x1b\\x74\\x22\\xe3\\xd5\\xa9\\xa5\\x3c\\x7c\\x2b\\x12\\x3e\\x5a\\x28\\xc2\\x81\\xc5\\x10\\xc2\\xa1\\x04\\xc7\\xd9\\xeb\\x1f\\x3f\\xbc\\x87\\x5d\\x49\\x80\\xb5\\x58\\xb6\\x62\\x16\\x32\\x49\\xb6\\xc0\\x97\\xa8\\x02\\xc9\\xcf\\xb9\\x87\\xf9\\xd9\\xf6\\x47\\xb6\\xaa\\xf8\\x42\\x42\\xde\\xcd\\x4b\\xdc\\xae\\xb8\\x6a\\x5c\\x56\\x1a\\x6f\\x77\\x28\\x7d\\x86\\x62\\x51\\xa0\\x4e\\xe0\\x9e\\x84\\x4a\\x7e\\xc0\\x2f\\x88\\x9c\\xdf\\xd0\\xf8\\x2e\\x70\\x7c\\x3a\\x38\\xa8\\x09\\x18\\x2b\\x56\\x57\\xdf\\x9c\\xbf\\x19\\xc4\\xfb\\x2f\\xb0\\x4f\\xfa\\xfc\\x9a\\x69\\xd5\\xe0\\xf2\\xf0\\xe8\\xa2\\x8b\\x5f\\x57\\xda\\x8c\\x6b\\xf3\\xd8\\xe2\\x8c\\x5e\\xf8\\xf4\\x19\\xde\\xe2\\x1f\\x7b\\xd7\\x29\\x43\\x73\\x8c\\xbf\\x7c\\x0f\\x09\\x65\\x96\\xbd\\x72\\xfc\\x64\\x08\\x74\\xc3\\x2c\\x1c\\x8d\\xde\\xd3\\xef\\x11\\xe7\\xfa\\x31\\x9c\\x96\\x69\\x5b\\x52\\x1e\\x48\\x23\\x70\\x0a\\xf6\\x4e\\x6a\\x30\\xef\\xfc\\x8c\\xe8\\x8c\\x42\\x38\\x5b\\xbb\\x4f\\x7b\\xf6\\x93\\x9e\\x4d\\xce\\xad\\xab\\x0e\\x81\\x33\\x74\\x67\\x37\\xe2\\x9f\\xa4\\xbd\\xdb\\xb1\\xd3\\x9a\\x53\\x2f\\xa5\\x75\\x09\\x3e\\xfd\\xf1\\x0b\\x38\\x49\\x6b\\x40\\x52\\xd0\\xd4\\x88\\xa8\\xa0\\x7f\\x46\\x48\\x67\\x8c\\x1d\\xa4\\xfd\\x27\\x2c\\x25\\x64\\x7f\\xa6\\xfc\\xe3\\xd0\\x07\\xfc\\x3e\\xf8\\x63\\x07\\x0c\\x42\\x82\\x22\\x9a\\x61\\x05\\x73\\xa7\\x0e\\x15\\x2c\\xf0\\xe7\\x12\\x25\\x3a\\x2b\\x27\\xde\\x4a\\x95\\x52\\x59\\xea\\x7f\\x3d\\x78\\xf1\\x84\\x3e\\xce\\x5c\\x20\\x60\\x80\\xbb\\xb7\\xc9\\x1a\\x33\\x57\\xa6\\x8c\\x0d\\xac\\x50\\x3e\\x67\\x5e\\x99\\x84\\x40\\x5e\\x92\\x8d\\xf6\\xee\\xdc\\x91\\xad\\x21\\xfd\\xd6\\x90\\x7e\\x9a\\x94\\xe5\\xe3\\x60\\xe0\\x72\\x71\\xf9\\xe5\\x52\\x2a\\xf1\\xc5\\x1e\\x9f\\x14\\xd1\\x19\\xe2\\xc3\\xea\\x5e\\x04\\x7c\\x1d\\xc3\\x66\\x67\\x92\\x79\\x7a\\x79\\x2d\\xc4\\x62\\xf5\\xe4\\x4d\\xbd\\xe8\\xc1\\x76\\x88\\x18\\x23\\xf7\\xda\\x4e\\x11\\xd6\\x3c\\x47\\xd3\\x8f\\x53\\x70\\xe3\\x47\\x0f\\xed\\xf8\\x60\\x0a\\x47\\x40\\xd7\\x4d\\x4a\\xe4\\x59\\xfc\\x1a\\x4e\\xfe\\x70\\xd2\\x95\\x0e\\x8a\\xd2\\xa6\\xb2\\xc2\\x3b\\xaa\\x44\\xb9\\x98\\xde\\x62\\x3c\\xb2\\xb6\\x70\\xba\\xd2\\x34\\x9b\\x51\\xcb\\xed\\x44\\x17\\xf1\\x60\\xcc\\xee\\x22\\xcb\\x81\\x42\\x13\\xa5\\x60\\xc4\\xf1\\x69\\xe9\\x85\\x79\\x30\\xeb\\x07\\xf3\\x9d\\xa6\\x3a\\xf9\\x60\\x2b\\xf5\\x60\\x93\\x8d\\x70\\xa3\\xe9\\x99\\x82\\x6a\\xf4\\x7e\\x07\\x3b\\x54\\x9d\\x96\\xa8\\x0e\\x26\\x66\\xa9\\xc0\\x04\\x85\\x33\\xc6\\x91\\xb0\\xe1\\xab\\xc7\\x3b\\x3f\\x80\\x51\\xe8\\xd7\\x9d\\xe1\\x01\\xc0\\x0a\\x18\\xda\\xa5\\xef\\xf0\\xba\\x35\\xb4\\x39\\x0c\\xb6\\xd2\\x1c\\x6b\\x29\\xa2\\x5b\\x98\\x78\\xc8\\x06\\x29\\x19\\xf5\\x24\\xbf\\x96\\xb6\\xa6\\x8d\\xf8\\x84\\xa2\\x2e\\xf9\\x33\\x60\\x75\\xaa\\xd0\\xcc\\xe5\\x5a\\x85\\x68\\xee\\x04\\xf7\\x98\\x62\\x58\\xf0\\xc8\\x76\\x91\\x82\\xaa\\x11\\x20\\x9b\\x70\\x23\\x76\\x03\\xeb\\xaa\\xf4\\x97\\x4e\\xa7\\x83\\xfa\\x0b\\x3a\\x09\\xd7\\xa8\\x4c\\xaa\\x7e\\xd7\\x4c\\x48\\x0c\\xa2\\xf9\\x0c\\x67\\xc0\\xf7\\x56\\xbc\\x70\\xb1\\x08\\xc7\\x62\\x4a\\x3d\\xe0\\x28\\x93\\x39\\xf0\\x58\\x93\\x5f\\xef\\x76\\xe2\\x62\\xf2\\x04\\xb5\\x01\\x0c\\x11\\xbb\\x54\\x9a\\x49\\xc1\\x23\\x12\\x4e\\x21\\xbc\\x84\\x33\\x10\\x4e\\xd5\\xd2\\xf7\\xf0\\x49\\x0f\\xe8\\x1c\\x3a\\xff\\xc5\\x5e\\xfc\\xd7\\x49\\xa9\\x2c\\x32\\x95\\x4b\\xdf\\x3f\\x85\\x0c\\x27\\xb0\\x66\\x81\\xcf\\x38\\x4b\\x6e\\x78\\xf7\\xe8\\x48\\x2c\\x4f\\x3e\\x51\\xec\\x21\\x4d\\x32\\xb3\\x5e\\x1c\\x1e\\x8a\\x1c\\x9c\\xc4\\x6c\\x1a\\x0a\\x31\\x96\\xcc\\x4e\\x6c\\x01\\xe7\\x4a\\xfc\\xba\\x86\\xcf\\xcc\\xd5\\x1c\\x87\\xf5\\x1d\\x39\\x57\\x04\\xda\\x21\\xf6\\xca\\x74\\x83\\xfa\\xa4\\x0d\\xdb\\x2f\\x22\\x97\\x42\\x7e\\x5f\\xbc\\xa6\\x57\\x14\\x12\\x4b\\x70\\xaa\\xa7\\xde\\xfe\\x82\\xb4\\x14\\x7d\\xd9\\x17\\x2a\\xd7\\x2a\\xe3\\x15\\xbf\\xf4\\x6f\\x71\\xba\\x29\\xb1\\x05\\x97\\x80\\xf6\\x25\\xbb\\xfe\\xe0\\x6e\\xe0\\x32\\xdf\\xa9\\xdb\\x0d\\x7e\\xfb\\x44\\x2b\\x86\\x0b\\x41\\x4a\\xfc\\x95\\x25\\x36\\x07\\x22\\x91\\x92\\x06\\xb4\\xf1\\x13\\x47\\x21\\xbf\\xf8\\x8d\\x46\\x5f\\x01\\x41\\x35\\xa8\\xd4\\xbf\\x83\\xae\\xc9\\xa5\\xd8\\x80\\xf4\\xc5\\xd8\\x3b\\xa0\\x59\\xfa\\x50\\x8e\\xae\\x9c\\x19\\x59\\xc0\\x1d\\x23\\x7f\\x5d\\xbe\\xcc\\x9b\\xed\\xf0\\xa0\\x3f\\xff\\xe8\\x7e\\x84\\xcf\\x14\\xdd\\xac\\xf6\\xdd\\x9d\\xe5\\x95\\x1d\\x39\\x85\\xb8\\xd1\\xe3\\x67\\xa0\\xef\\x27\\x8b\\xe6\\xba\\xd7\\x1f\\xa1\\x54\\x3c\\xe2\\xa6\\x77\\x70\\x81\\xa5\\x5b\\xf0\\xd3\\x2d\\xe0\\x5d\\x9e\\x68\\x82\\x26\\x15\\x69\\xa3\\x39\\x5f\\xf7\\x51\\x60\\x00\\x9c\\x80\\xef\\xce\\x83\\x52\\x50\\x6a\\xc0\\x45\\x02\\x74\\x51\\xa5\\x57\\xe9\\x02\\x91\\xe3\\x5d\\xd5\\xaf\\x2b\\xc1\\xd3\\x63\\xb8\\x61\\x57\\x56\\x68\\xc3\\xed\\xba\\xc4\\x3f\\xd3\\x13\\xdc\\x0f\\x2c\\x67\\xb9\\x7b\\x32\\x6d\\xb1\\x1f\\x8d\\x69\\x65\\x56\\xf6\\x81\\x2a\\x3b\\x59\\x50\\xd6\\x61\\x58\\x59\\x94\\xdb\\x50\\xa8\\x1c\\x9c\\x0c\\xcb\\x03\\x96\\x54\\x1e\\x60\\x62\\x05\\xc9\\x39\\x58\\x6f\\xc3\\x26\\x6d\\x76\\x2d\\x9a\\x2d\\x67\\x34\\x3a\\x2b\\xf7\\x4e\\xfa\\x51\\xb3\\xd8\\x41\\xa9\\xa5\\xf2\\x8b\\x22\\xed\\x4c\\xe2\\xe1\\x3d\\x3d\\xae\\xbc\\xe0\\x6d\\x41\\xa3\\xfa\\xe1\\x4d\\xb1\\xd6\\xb8\\x59\\x1f\\x4b\\x15\\x6b\\x68\\x2e\\x37\\x14\\x0d\\xa9\\xb2\\x6f\\x43\\xd1\\xf0\\xd4\\x51\\x20\\x59\\xc2\\xeb\\x17\\x75\\x27\\x6a\\xde\\xf9\\x15\\xe7\\x86\\x51\\xdd\\x6d\\xfc\\x85\\xe4\\x28\\x2e\\xa0\\xb5\\x13\\x1a\\xc9\\x56\\xdd\\x86\\xbb\\xbb\\x8b\\x36\\x84\\xf8\\xc1\\x89\\x10\\x89\\x48\\xd4\\x6d\\xca\\xdc\\x82\\x94\\x02\\xdd\\x38\\x70\\x29\\xbb\\x93\\x39\\x8a\\xe7\\x2d\\xe0\\x76\\xd6\\xb4\\xcb\\xe5\\xa9\\x5d\\x2e\\x4d\\x37\\xe4\\x80\\xa6\\x40\\xd7\\xcb\\x43\\x9a\\x60\\x97\\x80\\xe6\\x52\\x0a\\xf8\\x22\\x5f\\x9b\\xbf\\xbf\\xc5\\x9b\\x86\\xd2\\x70\\xd3\\x10\\xf3\\x30\\xb9\\xa2\\xb5\\x21\\x5b\\x1b\\xe8\\xaf\\x14\\x2f\\x64\\x7f\\x5f\\xad\\x37\\x47\\xad\\x49\\x95\\x56\\xda\\x67\\xe7\\x5e\\xb5\\x4d\\xc5\\x75\\x63\\x5b\\x91\\xe3\\xa5\\xb9\\xa8\\xc6\\x84\\xb5\\x34\\x5b\\x4e\\x51\\x3e\\xa8\\x56\\x21\\x4a\\x9e\\x02\\x19\\x2f\\xae\\xac\\x1f\\xd7\\x41\\x80\\x82\\x61\\xcc\\x08\\xdc\\xf8\\x58\\xc1\\x02\\x88\\xab\\x7b\\x47\\x4a\\xfd\\x31\\x2a\\xe5\\xdc\\xc9\\x22\\xa6\\x1d\\x2a\\xeb\\xc0\\x1b\\xf6\\x17\\x15\\xa9\\xec\\x36\\xdd\\xa7\\x3a\\xca\\x25\\x63\\x00\\x84\\x4e\\xad\\xe1\\xac\\x49\\xbb\\x1a\\x4e\\xb1\\xd1\\x08\\x0e\\x23\\x9e\\x51\\x7b\\x49\\xd5\\xe8\\xa8\\xaf\\x6d\\x57\\x7f\\x17\\xd9\\xd8\\xed\\xc2\\x69\\x50\\xeb\\xeb\\x8e\\x7c\\x15\\xc3\\x6b\\x7c\\x85\\xc5\\xd4\\x48\\x8f\\x62\\xbe\\x23\\x73\\xf9\\x05\\x1c\\x5f\\xd0\\xda\\x6e\\x47\\xba\\x33\\x77\\x05\\x5d\\x35\\x95\\xeb\\xa4\\xcb\\x75\\x68\\xb9\\x76\\x9f\\xdd\\x75\\xa6\\x82\\xdd\\x74\\xc1\\x2e\\x2d\\x38\\x9f\\xb8\\xd3\\x8b\\x9c\\xc2\\xbd\\x74\\xe1\\x1e\\x2d\\xcc\\x68\\xa5\\xb9\\xa9\\xdc\\x20\\x5d\\x6e\\xc0\\xca\\x21\\x84\\x28\\x12\\xbd\\x99\\x8a\\x0f\\xd3\\xc5\\x87\\xb4\\x78\\xa7\\xbf\\x09\\xda\\xb0\\xb1\\x4c\\x05\\xfb\\xe9\\x82\\x7d\\x5a\\x30\\x98\\x20\\x5f\\xd0\\x36\\x95\\x9b\\xa5\\xcb\\xcd\\x68\\xb9\\x48\\x46\\x6d\\x2a\\x39\\x4e\\x97\\x1c\\xb3\\x91\\xc2\\x20\\x61\\x6d\\xbd\\x62\\x9a\\xee\\xd0\\x38\\xd6\\xd3\\x74\\x05\\xa7\\xb4\\x02\\x4a\\x5c\\xbe\\x84\\x05\\x0d\\xac\\x86\\x79\\xaa\\x36\\xe9\\xe2\\x1b\\xd6\\x73\\x20\\x59\\x82\\x59\\x6e\\xf9\\x6d\\xba\\xfc\\x96\\x96\\x07\\x2a\\x39\\xb7\\xf0\\x6d\\xba\\xf0\\xad\\xd4\\xf8\\x65\\xf6\\xa4\\x2f\\xd2\\xa5\\x17\\xb4\\xb4\\x46\\x17\\x60\\xaa\\x63\\x99\\xae\\x03\\x38\\xdc\\x43\\xac\\x65\\x1a\\xb2\\x33\\xc7\\x54\\x74\\x9a\\x2e\\xca\\x05\\x5b\\x12\\x85\\x2b\\x4b\\xca\\xb9\\xac\\x86\\x49\\xbb\\xa4\\x3c\\xb1\\xe8\\x9d\\xbe\\x82\\xa6\\x19\\x69\\x61\\x6a\\xf8\\x26\\xdd\\xf0\\x4d\\x66\\xc3\\xfc\\xba\\xba\\x31\\x37\\x7c\\xc3\\x1b\\x66\\xda\\x12\\x53\\xc3\\xa3\\x74\\xc3\\xa3\\x43\\x07\\x48\\x6f\\x6b\\x84\\x73\\x46\\xda\\x16\\x72\\x00\\x04\\xf9\\x47\\x53\\x15\\x41\\xba\\x0a\\xb7\\x4a\\x65\\x03\\x14\\x1f\\x46\\xd7\\xac\\xc3\\x53\\xaa\\x1b\\x12\\xd1\\xdb\\xe2\\x07\\x47\\x12\\x72\\xd2\\x5d\\xcd\\xbe\\x8d\\x5f\\x50\\x9e\\x24\\x7a\\x41\\x9f\\x50\\x09\\x27\\xbf\\x45\\xde\\x17\\x3f\\x33\\x17\\x63\\xe0\\x15\\x6a\\xea\\x74\\x98\\xe8\\xb4\\xfd\\x15\\xca\\xf5\\x8d\\xeb\\x72\\xa5\\xc9\\x4e\\x51\\x28\\xec\\x4a\\xe8\\x4f\\xfa\\x8b\\x4f\\xec\\xfc\\xa7\\xb7\\xc1\\x6e\\x67\\xc5\\x2f\\x63\\x72\\xdd\\x49\\xc3\\x31\\x29\\x6d\\xdf\\xf8\\xee\\x79\\x8d\\x30\\x42\\xbe\\xf1\\xfc\\xef\\xb5\\xe8\\x52\\x4a\\x11\\xea\\x11\\x32\\x4c\\xa2\\xc2\\x5b\\x30\\xc7\\x4c\\x43\\x93\\xca\\x0e\\x5d\\xe0\\x4a\\x98\\x74\\x31\\xe2\\xda\\x8d\\xd2\\xf9\\x97\\x2f\\xf5\\xf3\\x70\\x3c\\x75\\x17\\x25\\x27\\x26\\xe6\\x7d\\x9a\\xf2\\x01\\x78\\xbd\\xa3\\x23\\x13\\x5d\\x62\\x7e\\x23\\x73\\x35\\x71\\xdf\\x8a\\xe4\\x8e\\xbb\\x9b\\x93\\x3b\\x1e\\x81\\xc2\\x80\\x48\\x7d\\xa2\\xfc\\x48\\x76\\x47\\x92\\x59\\x34\\xad\\x4b\\x59\\xe2\\x26\\xdd\\x5d\\xe2\\xcb\\xfe\\x10\\xcc\\x95\\x6f\\x1b\\xcb\\x03\\xf8\\xac\\xbb\\xed\\x36\\xa5\\x29\\xde\\xc3\\xcd\\x8a\\x47\\x7f\\xcb\\x90\\x8e\\xc8\\x47\\xac\\xaa\\x84\\x5a\\x25\\x8e\\x51\\xbc\\xfc\\xe1\\x87\\x4f\\x3f\\x34\\x0e\\x5e\\xba\\xc0\\x8b\\xb4\\x29\\xf2\\x14\\x21\\xa9\\xf0\\x97\\xd7\\xc1\\x4a\\xc0\\x13\\xac\\x22\\x44\\xc2\\xd9\\xe4\\x6b\\x04\\x99\\xf2\\xe0\\x4a\\x0e\\xdc\\x99\\xbc\\x6a\\xa3\\x52\\xa8\\xe6\\x34\\x36\\x0e\\x6b\\x3b\\x1a\\x23\\xec\\x87\\x73\\xba\\xf3\\xe4\\xf1\\x01\\x63\\x1d\\x21\\x4b\\xbc\\x98\\x91\\x66\\x25\\xda\\x41\\xc7\\x5d\\x8e\\x58\\x29\\x8b\\x0a\\xdd\\x18\\x1a\\xb5\\x3f\\xa7\\x7f\\xa1\\xbc\\x90\\xc1\\x45\\x72\\x8e\\x70\\x06\\xf4\\xb5\\x3b\\xb2\\x84\\x68\\xc3\\x8b\\x98\\x2e\\x55\\xce\\xc2\\xe4\\x62\\x71\\xd3\\x2d\\xb7\\xe1\\x35\\x55\\x59\\xd0\\xdd\\x9d\\x0f\\x5b\\x70\\xb7\\x8b\\x19\\x43\\x5d\\xbf\\x34\\xf8\\xda\\xe4\\x80\\xad\\xa8\\x77\\x88\\x33\\xec\\x86\\xb3\\xed\\x71\\x2d\\xea\\xa0\\x6d\\xc7\\xf5\\xfa\\xcb\\xf9\\x22\\x1c\\xff\\xd8\\x83\\x15\\x9a\\xd2\\x36\\x51\\xf0\\xa1\\x56\\x70\\x05\\x77\\x29\\x10\\x04\\x08\\x24\\xc8\\x6c\\x87\\xab\\xa8\\x7c\\x21\\xd2\\x48\\x4e\\x0b\\x17\\x98\\x77\\x1c\\x0f\\x65\\xfe\\x5c\\x34\\x9a\\x46\\x8b\\xba\\x57\\x9d\\xeb\\x16\\xfe\\x63\\xd9\\x8d\\xf8\\xb6\\x10\\x89\\x0d\\x0b\\x31\\xd5\\x71\\x2b\\x36\\xb2\\x41\\x75\\xe2\\x5f\\xb5\\xaf\\x6d\\x69\\x29\\x4c\\x07\\xae\\x24\\xdd\\xa5\\xe3\\x63\\xbd\\x8b\\xd2\\xda\\xf6\\x57\\x18\\x0d\\x15\\x90\\xb5\\x89\\x9c\\xca\\x44\\xdc\\xb1\\x68\\xca\\xb7\\xb9\\x2c\\xa9\\x19\\x00\\x1f\\x84\\xec\\xf6\\x47\\x78\\x84\\x75\\x39\\x1d\\xb9\\x7e\\x70\\x0e\\x9c\\x77\\xdb\\x92\\x04\\xbb\\x76\\xaa\\x1c\\x09\\x6c\\xa5\\x5f\\xb4\\x3b\\x48\\xcf\\x47\\xa5\\x50\\xea\\xe6\\x29\\x80\\x10\\xe9\\x9b\\xf7\\x60\\xd5\\xc3\\x4c\\x53\\xdc\\xe0\\x97\\x05\\x12\\xea\\x14\\xf5\\xdc\\x9b\\x05\\x1d\\x42\\x7f\\x2d\\x82\\x0d\\xa5\\x49\\xa1\\x67\\x24\\x7a\\x05\\xf3\\x62\\xc9\\x0f\\x02\\xe2\\x33\\x9d\\xd1\\xbf\\x17\\x6c\\x81\\x59\\x54\\xac\\x1f\\x75\\x9e\\x6d\\x39\\xd6\\x91\\x69\\x38\\x9d\\x63\\x6b\\x4a\\x5f\\xa2\\x6a\\xe8\\x2b\\x38\\xc4\\x2c\\x35\\x05\\x87\\x15\\x2f\\x36\\x77\\xe4\\x9f\\x4e\\xa7\\xb3\\x70\\xf3\\x23\\xf4\\xf0\\x97\\x94\\x66\\x5e\\x01\\xbd\\xc7\\x9f\\x9f\\x31\\x3f\\x5a\\x20\\xb1\\x4b\\xc7\\x2a\\x24\\x26\\x69\\x55\\x5f\\x07\\x66\\xa1\\x42\\x4f\\x06\\x5b\\x7c\\x1f\\x18\\xc8\\xa6\\x44\\x4a\\x4c\\xff\\x47\\x50\\xf1\\x83\\x55\\x58\\x76\\x62\\x91\\xfa\\x4f\\xbc\\x27\\xd5\\x17\\x62\\x27\\xd6\\xe2\\x41\\x44\\x80\\x16\\x8d\\xec\\xbf\\x34\\x59\\x8e\\xbd\\x60\\x26\\x41\\x13\\xee\\xee\\xb8\\x04\\xc7\\xbe\\xbb\\x13\\x4a\\x80\\xbb\\xbb\\xfa\\xd3\\x1a\\xfb\\xe1\\xc2\\x9f\\x0a\\x3c\\x01\\xeb\\x08\\x47\\x73\\x34\\xef\\x2a\\xdc\\x79\\x8d\\x40\\x8b\\x1f\\x23\\x9e\\x53\\x23\\x2a\\xba\\xc2\\x0f\\x7b\\x2d\\xf0\\xf3\\x57\\xd7\\x26\\xc4\\xbe\\x1d\\x9f\\x37\\x31\\x0f\\xcb\\xd1\\xd2\\x78\\x46\\xc5\\xa3\\x64\\x48\\xa3\\x5f\\x28\\xc4\\x43\\xdd\\x35\\x54\\xf5\\x9f\\xc4\\xf1\\x6b\\x8a\\xc5\\x58\\x80\\x60\\xad\\x7b\\x4f\\x6b\\x6b\\xca\\x87\\x22\\xec\\x6a\\xbf\\xe5\\x37\\x8e\\x5f\\xa0\\x46\\xfb\\xea\\x9a\\x74\\x28\\x9a\\xbf\\x49\\x17\\x2d\\x37\\xe0\\xd0\\x9d\\x46\\x8e\\x69\\xbc\\x35\\xdc\\x65\\x69\\x5d\\x38\\x52\\x78\\xbf\\xff\\xce\\x7a\\x12\\xb4\\x51\\x7d\\xa4\\xbe\\xd3\\xc0\\xf9\\x2f\\x53\\x68\\x7e\\xb9\\x82\\x1a\\xe9\\x54\\xa3\\x7c\\x08\\xf3\\x82\\xae\\x96\\x70\\xe1\\x43\\x7d\\x24\\x00\\xba\\xa5\\x1d\\x6c\\x3e\\xa1\\xaa\\xf1\\xfb\\x1a\\x42\\xa5\\x29\\xdc\\xd7\\xc5\\x7d\\x86\\x23\\xdb\\xb1\\x1d\\x0a\\xf7\\x57\\xa0\\xc2\\x4d\\xe2\\x93\\x8e\\xca\\x85\\xb0\\x2a\\x18\\x29\\xcf\\xbe\\xd0\\xad\\x06\\x22\\xbe\\x8f\\xe7\\x24\\xf1\\x1e\\x27\\xf5\\x96\\x79\\x55\\x20\\x2a\\x0b\\x75\\x4a\\x51\\x56\\x0f\\xe8\\xd4\\xa9\\x7c\\xd8\\xb6\\x5b\\x6d\\xfa\\x59\\x92\\x13\\x67\\x1c\\x1c\\xc1\\xf5\\xed\\xc7\\x97\\xab\\x3a\\x5d\\x2e\\x93\\xbb\\x68\\xee\\x31\\x36\\x23\\x6e\\x24\\x54\\x31\\x67\\x69\\x2a\\x95\\xd2\\xed\\x24\\xb0\\x2d\\x87\\xb0\\x99\\xf0\\x0c\\x9a\\x6d\\x35\\x5a\\xa3\\x43\\x91\\x6d\\x67\\x63\\xc6\\xc3\\x7a\\x93\\xe1\\x22\\x6a\\xba\\xad\\x21\\x8b\\x77\\xfc\\xa4\\x06\\xc4\\xfe\\x5a\\x2e\\x77\\x77\\x3c\\xb5\\x94\\x34\\xf8\\xc0\\x1e\\x55\\x2a\\x5d\\xca\\x45\\x18\\x17\\x8b\\x64\\x15\\x03\\xbb\\x8f\\x9e\\x95\\x7c\\x35\\xf0\\x0c\\xf2\\xf8\\x03\\xe3\\x98\\x94\\x09\\xde\\x21\\x12\\x38\\x28\\xb2\\xee\\x25\\x08\\x6b\\xa2\\x2f\\x92\\x99\\xcd\\x4e\\xa6\\x41\\x82\\xe9\\xe5\\x06\\x6e\\x95\\xb6\\x42\\x4f\\x71\\xfd\\xf9\\x9e\\x2b\\xae\\xe9\\xa7\\xbb\\xe8\\x4b\\xb6\\x0a\\x70\\xba\\x1c\\xf8\\xe2\\xee\\xf5\\xe0\\x32\\x4f\\x2a\\x4e\\x50\\xdd\\x1c\\x32\\x7c\\x5a\\x74\\x1d\\x60\\x3e\\xd2\\x4d\\xa7\\x23\\x31\\xd0\\xec\\x1c\\x1d\\x1d\\xc2\\x2d\\xd2\\x6d\\xa5\\xc7\\x63\\xd1\\x82\\x94\\x64\\x68\\xe0\\x4f\\x07\\x7f\\xee\\xe4\\xab\\x8b\\x5e\\x66\\x09\\x93\\x1a\\xf3\\x31\\xc8\\xae\\x3e\\xdd\\x01\\x48\\xdf\\x70\\xe5\\xef\\x57\\xa4\\xa1\\x64\\xae\\x4c\\xb5\\xa4\\x62\\xa5\\x91\\xb5\\x8b\\xf4\\xeb\\x14\\xeb\\x42\\x57\\x88\\xde\\x1e\\xcd\\xef\\x21\\xe1\\x05\\xb7\\x1b\\x1c\\x26\\x25\\x76\\xbe\\xa8\\xc7\\x19\\xa6\\x2b\\xc7\\x9d\\x0f\\xc7\\x06\\x22\\x94\\x79\\x66\\xa0\\x1f\\x17\\x7a\\x04\\x19\\x82\\xe3\\xa4\\xf3\\x6a\\x9e\\xcc\\x28\\x69\\x12\\x3d\\xd4\\x50\\x28\\x03\\xb3\\xe5\\x81\\xfa\\x04\\x68\\x2a\\x17\\x3e\\x36\\x69\\x1f\\x1d\\x79\\x16\\x5f\\xf3\\xbc\\x5e\\x64\\x46\\x95\\xd5\\x15\\x20\\x54\\xf8\\xab\\x6e\\x11\\x5a\\x54\\x53\\xc9\\xb7\\x6f\\x8a\\x39\\x6d\\x33\\xea\\xfd\\xed\\x97\\x4f\\x1f\\xab\\x73\\x2a\\x1a\\xee\\x77\\xe0\\x92\\x43\\xfc\\x6b\\x22\\xcd\\x13\\x1f\\x0a\\xce\\x02\\xb1\\xfc\\x7c\\x5c\\x7e\\xae\\x1d\\x13\\xeb\\x57\\xfe\\x35\\xe2\\x6b\\xe1\\x8f\\x83\\xc3\\xa1\\x3f\\x5c\\xf8\\x07\\x3e\\xca\\xa1\\x38\\x3a\\x0e\\x81\\xf9\\xa5\\x83\\x58\\x4e\\xdb\\x89\\xd5\\x82\\xe0\\x26\\x1f\\x3a\\x8c\\xe0\\x7e\\xf6\\x35\\x6d\\xd2\\x65\\xfb\\x82\\x2a\\x3a\\x8f\\x8e\\xd4\\x6f\\xc5\\x3e\\xa4\\xe5\\xc9\\xdb\\x4f\\x12\\xdd\\x6a\\xef\\x41\\x0a\\xbd\\x1f\\xbb\\x53\\x04\\x1d\\x69\\x10\\x60\\x30\\x97\\x1a\\x02\\x0a\\x9b\\xbd\\x72\\xaf\\x59\\xfb\\xf0\\x03\\x9b\\x64\\x82\\x61\\xda\\x2f\\x71\\x47\\xc9\\x14\\xdc\\x8f\\x40\\x8f\\xce\\x7f\\xd5\\xd2\\xd2\\x70\\x23\\xc0\\x41\\x8a\\x93\\x18\\x34\\x83\\xef\\x23\\xba\\x3f\\x28\\x3b\\x75\\x41\\xea\\xfb\\x57\\x01\\xb4\\x86\\xff\\x32\\x69\\xc9\\xbc\\x25\\xfd\\xe6\\x05\\x1a\\xb5\\x26\\xec\\x84\\x93\\x76\\xab\\xd3\\x68\\x47\\x26\\x5b\\x8c\\xa5\\xfc\\x21\\xb8\\x81\\x7c\\x0b\\x60\\x27\\x19\\xa9\\x75\\x80\\x63\\xc0\\x0e\\x71\\x06\\x92\\x67\\x3b\\x87\\x7e\\x2e\\xa9\\x25\\xc0\\xc1\\xd8\\xdd\\x1c\\xb0\\xda\\x99\\xed\\x23\\x66\\x6c\\xc3\\x17\\x74\\x3c\\x68\\xc0\\x73\\xda\\x95\\x3a\\xf0\\x9a\\x9e\\x53\\x3f\\xf1\\x5a\\xec\\x97\\x84\\x1e\\x49\\x57\\x48\\x4d\\x28\\xa1\\xbd\\x03\\x3f\\x5c\\x4e\\x16\\x07\\xae\\x68\\xd7\\xd3\\xcc\\xd1\\x6f\\x89\\x39\\x4a\\xf0\\x6a\\xf1\\x5c\\x32\\xfa\\x5f\\x23\\x90\\x49\\xec\\x2f\\xf7\\xca\\x83\\x55\\x57\\xfd\\x1d\\xd7\\xcd\\x1c\\x55\\xb9\\xec\\x17\\xa4\\xb6\\xa4\\xdf\\x0d\\xf9\\x3c\\x35\\xe2\\x3f\\xdd\\x48\\xe8\\x8f\\x95\\xfa\\x54\\x38\\x20\\x27\\xed\\x74\\xfd\\x99\\x6b\\x0e\\x7e\\xae\\x32\\x80\\x93\\xe3\\xd3\\x7a\\xf2\\x79\\x16\\x4e\\x83\\xd9\\x62\\x8b\\xc8\\xab\\xb9\\xe5\\x45\\x15\\xe2\\x16\\x46\\x24\\x55\\x76\\x66\\x3a\\x02\\x9a\\xb5\\x09\\xcc\\xa5\\x20\\x67\\xdb\\x76\\xb4\\x2d\\x03\\x76\\x2b\\xa4\\x3b\\x86\\x33\\x08\\xcb\\x48\\x99\\xc4\\x5e\\x30\\x8b\\xfa\\x7d\\xf1\\x2c\\x45\\x27\\xc1\\x68\\xdb\\xcf\\x84\\xde\\x23\\x6a\\x4c\\x4e\\xbd\\xbb\\xbb\\x42\\x5c\\x42\\x75\\x39\\x99\\xf7\\xfa\\x9d\\x05\\xae\\x86\\xf8\\xc1\\xa5\\x6c\\xd2\\x2c\\xa0\\xb6\\x88\\xd2\\xd5\\x29\\x7f\\x48\\x17\\xef\\xa9\\x9f\\x26\\x7d\\x58\\xb2\\xda\\x1d\\x5b\\x9d\\x87\\x68\\xb1\\x57\\xed\\xf4\\x47\\x08\\x5f\\xd1\\xad\\x96\\x43\\xe0\\xb1\\xbd\\x43\\x3c\\x6a\\xd0\\x32\\x51\\xbe\\x90\\xb6\\x63\\x2f\\x1c\\x7d\\x70\\xa7\\x0e\\xdf\\xf5\\x76\\xe2\\x95\\x01\\x98\\xe9\\x91\\x88\\xeb\\xf6\\xe3\\x03\\x88\\x60\\x32\\x02\\x68\\x13\\x49\\xfc\\x64\\xab\\xd4\\x99\\xd1\\xd2\\x7c\\xd5\\xe5\\xb5\\xa3\\xe9\\xf1\\x3c\\xa2\\xfe\\x3a\\x76\\x4b\\x79\\x8b\\x3a\\x32\\xc8\\x00\\xe9\\x55\\x64\\xbe\\xac\\xae\\x6d\\xe1\\xf2\\x4a\\xf4\\x1c\\x97\\x01\\x64\\x81\\xb7\\x3b\\x8e\\x3f\\x70\\xbe\\x7b\\x1e\\x43\\xcc\\xa9\\xd1\\xae\\x6e\\xda\\x52\\x6b\\x99\\x0a\\x63\\x68\\x4e\\x58\\x27\\xf0\\x61\\x3c\\xbb\\xe1\\x53\\x54\\xb4\\x22\\xda\\xca\\x86\\x7e\\xa7\\x6a\\x68\\xef\\xe4\\x4d\\xad\\x2e\\x27\\xed\\xe1\\x97\\xb1\\xb6\\xfd\\xc4\\x46\\x08\\x72\\x32\\xc7\\x1b\\x81\\xe0\\x67\\xfa\\x9d\\xb7\\x1e\\xb4\\x71\\x49\\xc2\\x67\\xf2\\x13\\xab\\x14\\x31\\xce\\x62\\x05\\x07\\xb6\\xf8\\xd5\\x89\\x7e\\x75\\xd1\\xc6\\x48\\xac\\x5c\\xb8\\x78\\x7b\\xf2\\x9a\\xd6\\x2e\\xe3\\x1e\\xd2\\x86\\x71\\xbb\\x8e\\x66\\x49\\x5b\\x99\\x4d\\xb6\\xa3\\x5f\\x5e\\xa2\\xff\\x36\\xad\\x3a\\xde\\x7b\\xba\\xaa\\xbb\\x52\\x61\\x75\\x3f\\x26\\xce\\xc9\\x2f\\x3f\\xbf\\x72\\x54\\x12\\x57\\xa0\\x9e\\xbe\\x52\\x33\\xdc\\x0a\\xa2\\x3f\\x1b\\x70\\x33\\xcb\\x5b\\xc7\\x85\\x82\\xb0\\x34\\x5e\\x27\\x31\\xfe\\x12\\x0d\\x03\\xbc\\x79\\x24\\x4d\\xf0\\x84\\x34\\x81\\x89\\x58\\x4b\\xb6\\x4d\\x8d\\x97\\xd2\\x15\\x26\\x25\\x1a\\x79\\xf5\\x71\\x20\\xb2\\x4d\\x8d\\xa2\\xa4\\x63\\x63\\xe5\\xf6\\xa9\\x41\\x7e\\xb2\\x83\\xb0\\xd8\\x90\\x76\\x4a\\xdc\\x23\\xea\\x70\\xe8\\x8a\\x64\\xd8\\x51\\xf8\\x97\\x21\\xa6\\x34\\x55\\x27\\xba\\x9a\\x5d\\x33\\xcd\\x2c\\x2a\\xe6\\xe8\\xd3\\x19\\xc5\\xcb\\x45\\x15\\x4f\\xc2\\x0b\\x77\\xe1\\x6a\\xf7\\x85\\x27\\x28\\x17\\x8b\\xc1\\xfb\\x98\\x85\\x88\\x85\\x4b\\xbb\\xcd\\xcb\\x59\\x36\\x47\\x0c\\x3b\\x4e\\xa7\\x75\\x55\\xfa\\x18\\xa2\\x6d\\xbc\\x7b\\x70\\x2a\\x7a\\x5b\\x2d\\x5d\\x37\\xae\\x3a\\xb8\\xcc\\x0d\\x73\\x04\\x6b\\x91\\x7d\\x1c\\xa8\\xc9\\xc7\\xa3\\xac\\x9f\\xce\\xc9\\x46\\xd1\\x66\\xa2\\x74\\x91\\x6f\\xe0\\x04\\x0c\\x88\\xd0\\x7f\\x7a\\x4c\\x86\\xf0\\x80\\x18\\x84\\xde\\xd3\\x63\\x60\\x4f\\x64\\xbb\\xb4\\x52\\x6c\\x14\\xc4\\xed\\xf7\\x94\\xf7\\x68\\x27\\xc5\\x46\\x22\\xe0\\x8a\\xb0\\xe3\\x46\\x69\\x54\\x62\\xb0\\x59\\x68\\x30\\xe0\\xed\\x67\\x07\\x72\\x79\\xf6\\xba\\xbd\\x85\\x77\\x95\\xea\\xdf\\x82\\x71\\x0c\\x0d\\xc0\\xf2\\x15\\x60\\x35\\x7a\\x88\\x6f\\x2b\\x8d\\xfb\\xed\\x36\\x42\\x43\\xc9\\x48\\x18\\x3d\\x95\\xc8\\x20\\x32\\x69\\x2a\\x91\\xa1\\xcd\\x24\\x5b\\xba\\x03\\x90\\x6d\\x07\\x8e\\xe4\\x77\\x37\\xfd\\x79\\x11\\xd3\\xd9\\x6e\\xac\\xf4\\x67\\xf2\\x0a\\xfc\\x6c\\x09\\xa6\\xd8\\x13\\x76\\x06\\x09\\x24\\x5f\\x33\\xb1\\x69\\x71\\x82\\x30\\xe3\\xd4\\xe9\\x1a\\x0d\\x00\\xb1\\x5f\\x11\\x68\\xd4\\x83\\xab\\xf8\\xc6\\x99\\x16\\x30\\xf8\\x13\\x13\\x2a\\x8c\\xfe\\x58\\x35\\x64\\xe1\\x58\\x37\\x72\\x29\\x32\\x8d\\x4c\\x0d\\xa8\\xa1\\x01\\x07\\xac\\x4f\\x5a\\x7e\\x95\\x12\\x94\\xd6\\xc4\\x6e\\x30\\xac\\xbd\\x03\\x1f\\x3b\\x9c\\x21\\x7c\\xc6\\x82\\xad\\x5a\\x62\\x7b\\x4a\\x49\\x05\\xfa\\x5d\\x94\\x8a\\x70\\xda\\x6d\\x21\\x05\\x47\\xcc\\x4e\\xfc\\x50\\xbb\\xb6\\x9f\\xd6\\x6b\\x35\\xe8\\x4f\\x52\\xae\\x67\\xcd\\x49\\x89\\x0f\\x99\\xf9\\x36\\x40\\x0b\\x47\\x54\\x09\\x30\\x09\\x3b\\x5f\\x79\\x4b\\x87\\xb5\\xc4\\x74\\xd9\\x16\\xeb\\xb7\\xe3\\x2c\\x81\\xc1\\x58\\x3a\\x33\\xe5\\x15\\x2b\\xb0\\x72\\x16\\x0a\\x94\\x13\\x96\\x84\\x98\\x5c\\xd8\\x16\\x28\\xa9\\xe2\\x33\\xdc\\x63\\x12\\xca\\x6b\\x28\\x96\\x34\\x84\\x63\\x80\\x22\\xb2\\x21\\x5b\\x81\\x22\\x93\\xc6\\xce\\xe0\\x64\\x38\\x51\\x8d\\x55\\xd1\\x25\\x2f\\x37\\x4f\\xb6\\x4e\\x34\\x3d\\xfc\\x42\\xfe\\xfe\\xb8\\x55\\x6b\\x1c\\xa3\\x21\\x6a\\xe2\\x45\\x4b\\x9e\\xd5\\x46\\xfc\\x90\\xcc\\x07\\xc4\\x52\\x39\\xe3\\x0b\\x90\\x15\\xef\\x91\\x7e\\x47\\xc5\\x7b\\xa8\\x66\\xc7\\x7b\\x6b\\xfb\\xf4\\x98\\xd9\\x56\\x6f\\x9c\\x69\\x6a\\xcd\\xe2\\x78\\x3e\\xb8\\x9b\\x0f\\xfd\\x89\\x98\\xcf\\xb6\\xc0\\xbd\\xc2\\x7d\\xb7\\x29\\xb4\\x6c\\xd5\\x4a\\xd4\\x19\\xc4\\x2a\\xd4\\x6f\\x02\\x29\\x7c\\x0c\\x1a\\x90\\x51\\x74\\xf1\\x28\\x18\\xaa\\xb4\\x4d\\x66\\x1b\\xb9\\xdf\\x32\\x8e\\xb3\\xb4\\x8b\\xf4\\x14\\xea\\x47\\x63\\x07\\x51\\xad\\xfa\\x82\\x9e\\x44\\xd1\\xcc\\x54\\xd8\\x32\\xfc\\xec\\xb6\\x11\\x5d\\x66\\x45\\xc6\\x2a\\x86\\x19\\x4d\\x9d\\x44\\x4c\\x04\\xb2\\x8c\\x21\\x8a\\x56\\xa9\\x54\\xf6\\x6c\\x61\\xd8\\x0e\\x5d\\x2c\\xd9\\xad\\x52\\xa9\\xe1\\xed\\x70\\xa4\\x9a\\xad\\x32\\xee\\x4f\\x2a\\xc8\\xdb\\xe1\\xc2\\xb3\\xb3\\xa6\\x22\\x26\\xa6\\xf3\\x26\\x23\\x5a\\x22\\xfe\\x75\\x34\\x29\\x0a\\x1c\\x8f\\x6f\\xfd\\xc6\\xda\\x09\\xcb\\xcf\\x18\\x3e\\xf4\\xd6\\x79\\x56\\x23\\xa7\\x4e\\x8d\\x9c\\xa9\\xfb\\xac\\x5b\\x4a\\xce\\x27\\x39\\x77\\x4a\\xd4\\x72\\x6e\\xf0\\x9f\\xcf\\xbe\\xab\\xd9\\x5f\\xcf\\x52\\xf2\\x44\\x26\\xb9\\x10\\x82\\x18\\x2d\\x72\\x0f\\x4d\\xa1\\xe8\\x05\\xd6\\x3c\\x75\\x84\\xce\\x97\\x78\\x27\\xb7\\xb0\\x2c\\x6f\\x1d\\x0a\\xdc\\x86\\x56\\x66\\xe1\\x82\\x8d\\x71\\x50\\x2e\\x1d\\xd4\\x48\\xa9\\x6c\\x9d\\x3e\\x3d\\x2e\\x27\\x3f\\x58\\xb9\\x64\\x33\\x33\\x84\\x8b\\xd8\\xb8\\x84\\xfe\\x98\\xc3\\xa2\\x1d\\x30\\xab\\x89\\xcf\\x6f\\x9e\\xd6\\xff\\x5e\\x83\\x49\\x58\\x3b\\xd6\\x45\\xeb\\xe2\\xc9\\x6d\\xe3\\xd6\\x2e\\xc3\\x80\\xcf\\xd2\\x13\\x7e\\xae\\xbf\\xa6\\xe8\\x60\\x4f\\x6a\\xad\\x12\\x73\\xab\\xd3\\xa0\\x82\\x52\\x20\\xf8\\xff\\xb7\\x9d\\x14\\xeb\\xfb\\x9f\\x14\\x57\\xf1\\x51\\x41\\x61\\x9e\\xf1\\x53\\xfc\\x33\\xee\\xed\\xf5\\x7f\\xf3\\xe3\\xa4\\x6c\\x8d\\xc5\\xdc\\x9f\\xb9\\xe8\\xa6\\xe5\\xe9\\x71\\xa3\\x56\\xe8\\x90\\xa9\\xfe\\xad\\xae\\x9e\\x31\\xa6\\x23\\x26\\x7f\\xd1\\xb5\\xb4\\xcb\\xae\\xf1\\x47\\x9c\\x47\\xfc\\x8c\\xc8\\x3c\\x92\\x1e\\x6e\\x3a\\x81\\xfa\\x3b\\x3a\\xd2\\xec\\x46\\x1d\\x13\\x22\\xb5\\x46\\x0f\\x05\\xef\\x3f\\x61\\xe3\\xc0\\x14\\xd5\\x60\\x62\\xea\\xc7\\x25\\x7a\\x20\\xec\\x94\\xf3\\x8e\\x12\\xf9\\xf7\\xbd\\xd6\\x57\\xda\\x4f\\x33\\x6c\\x89\\x8f\\xd0\\x28\\x79\\x41\\x97\\xad\\xcd\\x64\\xef\\x21\\x13\\x3f\\xc3\\xfe\\x01\\xa3\\x6c\\x94\\xe4\\x45\\x31\\x6c\\x55\\xe8\\xd1\\x84\\x86\\xbe\\x01\\x63\\x43\\x48\\xc7\\x2e\\xd7\\x8f\\x1b\\x95\\xba\\x7c\\x5d\\x0f\\x5b\\xdc\\x1a\\x38\\xda\\xcf\\x38\\x75\\xc9\\x25\\xf5\\xa7\\x5d\\xe8\\x3a\\x5b\\xcd\\x6f\\xdf\\x94\\xf8\\x5d\\x8d\\xb7\\x7c\\xde\\xf6\\x7b\\x76\\xac\\x6e\\x3f\\x79\\x36\\x53\\x5b\\x51\\xcb\\x92\\xb0\\xcd\\xf6\\x98\\xbb\\x8b\\xad\\xc8\\xfd\\xef\\x7b\\xc3\\xc4\\xa8\\x37\\xbe\\x6e\\x82\\xd2\\xc0\\x6b\\x65\\x87\\x50\\xe3\\xdb\\x47\\xdb\\x20\\xf4\\xae\\xcc\\xda\\x1e\\x95\\xbc\\xfd\\x41\\x81\\x96\\xb0\\x3d\\x8e\\x5f\\x54\\xac\\xf0\\xee\\xae\\x66\\xa7\\x76\\x49\\x45\\xb7\\x4d\\x52\\xd4\\xdd\\xff\\x13\\xfb\\x64\\xf6\\xed\\xfb\\xa4\\x18\\x59\\xcc\\xbe\\xeb\\xff\\xee\\x5d\\xb2\\x43\\x9c\\x5d\\x96\\x04\\x82\\x1c\\xf6\\x81\\x9b\\xa6\\x1b\\xe8\\x50\\x66\\xa6\\x8f\\x8e\\xf8\\xbd\\x73\\xa8\\x32\\xde\\x56\\x8a\\xbe\\x4e\\x59\\x24\\xa6\\xcc\\x07\\x75\\x1f\\x51\\xea\\x24\\xb1\\xd0\\xa3\\xc4\\xf7\\x32\\xf9\\x57\\xae\\xd7\\xee\\xee\\x30\\xf5\\x44\\xa6\\x03\\x71\\xd3\\xc0\\x06\\xb0\\xdc\\x93\\x7a\\x50\\xc1\\x1c\\x15\\xfa\\xf7\\xc4\\xb5\\xa9\\xd6\\x4d\\x69\\x34\\xd1\\x4a\\x4d\\xc6\\x53\\x15\\xe9\\x56\\xcd\\xa6\\x18\\x2c\\x99\\x26\\x44\\xf2\\x36\\x7a\\xac\\x5f\\x1f\\x1d\\xd5\\x94\\x94\\x1a\\xa4\\xe4\\xec\\xcc\\xe4\\x07\\xd2\\x2b\\x6e\\x81\\x96\\xae\\xef\\xf8\\x66\\xe7\\xa2\\x0f\\x83\\xec\\x43\\x16\\x7e\\xb0\\x85\\x7b\\xe9\\x5c\\xa1\\x27\\x85\\xcc\\x5e\\x04\\x69\\x9d\\xe4\\x62\\xb6\\xfd\\x7a\\xc9\\x5d\\xe0\\xb5\\xa8\\x7f\\x8f\\x2c\\xfe\\x87\\xf1\\x3e\\x95\\xe7\\x0d\\xcc\\x59\\xce\\xcf\\x59\\x7e\\x6e\\xef\\x7c\\xe6\\xfa\\xcb\\x4e\\x34\\xc3\\xeb\\x78\\x8e\\x36\\xa2\\x24\\x7f\\x69\\xb1\\x95\\x72\\x09\\x73\\xcd\\x97\\xc7\\x25\\x7c\\x08\\x5c\\x13\\xa9\\x25\\xd1\\x4a\\x7e\\x6e\\x71\\x4a\\x35\\x72\\xd6\\x81\\xc8\\x87\\x38\\x10\\xa5\\x43\\xf4\\x48\\x29\\xa5\\xf5\\x44\\x31\\xa8\\x85\\xca\\x96\\x5f\\x8e\\x42\\x77\\xc1\\x58\\x38\\x6a\\x7b\\x4c\\x8d\\xdf\\x5d\\xfb\\x69\\x3d\\xf8\\xce\\x16\\xfe\\xd7\\x10\\x4f\\xb4\\x93\\x4c\\x83\\x6f\\x61\\x83\\x53\\xcb\\x60\\x32\\xa3\\x2a\\x84\\xe9\\x96\\x22\\x00\\xe7\\x32\\xa0\\x09\\x3f\\xe1\\x41\\x7f\\x3c\\x0e\\xda\\x7d\\x84\\xff\\xa1\\xb2\\x33\\x86\\xc0\\xae\\xba\\x54\\x7e\\x48\\xfd\\x24\\xa4\\x7d\\x15\\x05\\xce\\x57\\x6a\\xb7\\x4f\\xe8\\x8e\\x86\\xbf\\x6c\\x01\\xc1\\x0f\\x66\\xd5\\x8f\\xae\\x5c\\xfe\\xf6\\x82\\x74\\x9d\\xef\\x6a\\xa4\\xc7\\x50\\x0e\\xdc\\x13\\x51\\x8d\\x0c\\xf1\\xc7\\x08\\x61\\x46\\x63\\xfc\\x27\\x72\\x17\\x80\\xee\\xc3\\x10\\x8c\\x74\\xa3\\xf3\\xc5\\x8b\\x48\\x2d\\x34\\x74\\x67\\x22\\xb3\\xb6\\x2d\\x56\\x69\\x29\\x22\\xcb\\x25\\x09\\x99\\xfe\\x5c\\xe2\\x66\\x9f\\xb1\\x62\\x42\\x06\\xad\\xdd\\x90\\x69\\x6c\\x53\\xc9\\x24\\xa7\\xe8\\xf5\\x28\\x82\\x63\\xdc\\x10\\x2f\\xdf\\xe6\\xca\\xa3\\x1a\\x10\\xb3\\xcd\\x15\\x56\\xfb\\x1e\\x89\\x84\\x3c\\x73\\xa6\\xa4\\x21\\x00\\x8c\\x23\\x64\\xb6\\x50\\x0b\\xb7\\xdb\\x0d\\x66\\xb4\\x12\\xa3\\x51\\x93\\xce\\x7c\\x82\\x96\\x66\\xc4\\x45\\x76\\x61\\xa3\\x45\\x14\\x2b\\xfc\\x1b\\x2d\\xbd\\xb7\\x3d\\x14\\xba\\x41\\x62\\xa7\\xc5\\xde\\x16\\x51\\xd1\\xa4\\xed\\x6d\\xfb\\xc5\\x8d\\x17\\xf6\\xb5\\x37\\x63\\xb0\\x03\\x43\\xa9\\x49\\xba\\xd4\\x84\\x96\\x62\\x36\\x13\\xfb\\x1a\\xc5\\x31\\x9d\\xc9\\x1e\\x46\\x2c\\x81\\xd9\\xb6\\x86\\xbe\\x22\\x9c\\x75\\x92\\xb3\\xd0\\x84\\x16\\xff\\xdb\\x10\\xbc\\x55\\xc0\\x95\\x48\\x72\\x4e\\x96\\xd2\\x12\\x3f\\x1a\\x22\\x0f\\x09\\x32\\xed\\x7e\\xd8\\x5b\\xb4\\xc8\\xc9\\x31\\x2a\\xd4\\x99\\x32\\x39\\x2e\\x11\\x6a\\x87\\x29\\xc2\\x62\\xe8\\x0e\\x37\\x55\\xd0\\x4e\\x54\\x10\\x00\\x6d\\xe0\\x04\\x24\\x3e\\x17\\xe0\\x4c\\xd1\\xa0\\x61\\x24\\x46\\x7b\\x6e\\x44\\x12\\x00\\xed\\xd4\\x26\\x57\\x25\\x76\\xfb\\xa2\\xd7\\x6f\\x8e\\xb9\\x8a\\x8a\\xca\\xbf\\xe7\\x25\\x44\\xa1\\x1b\\xac\\x6d\\x3c\\x3b\\xab\\x11\\x1f\\x1a\\x61\\xa7\\x17\\x54\\x88\\x8b\\x8d\\x3a\\x86\\x9a\\xf3\\x87\\x2f\\x4b\\xaf\\xdd\\x5f\\x51\\x37\\x14\\xec\\x99\\x9a\\x3f\\x94\\x24\\xe2\\x93\\x3f\\xb1\\xb3\\x0e\\xba\\xf1\\x70\\x03\\x62\\x8a\\x71\\xae\\x3d\\xf2\\xe0\\x54\\x96\\xa1\\xab\\x66\\xfd\\x51\\xac\\x60\\x6c\\x27\\xb5\\x46\\x84\\xc3\\xec\\x43\\x67\\x5c\\xe1\\x0e\\x6e\\x7c\\xbe\\xfe\\x66\\xce\\xa4\\x42\\x9d\\xec\\xc0\\xbf\\x7c\\x95\\xcd\\x73\\xb5\\x4b\\x90\\x44\\xeb\\x83\\x7e\\x29\\x88\\x06\\x04\\xe3\\x53\\xe7\\xc3\\x36\\xc3\\x5e\\xe0\\x0d\\x12\\xcc\\xfd\\x80\\x92\\x0f\\x36\\x59\\x3a\\xdd\\x7d\\xb2\\xaf\\x9c\\xde\\x3e\\xd9\\xd7\\x4e\\xdf\\x90\\x9d\\x6c\\x9c\\x81\\xe9\\xd5\\xd6\\x19\\x9a\\x5e\\xdd\\x9a\\x9d\\x6d\\x20\\x0a\\x1f\\x51\\x72\\xb4\\x13\\xe3\\x60\\x86\\x2e\\x37\\x46\\x64\\x71\\x0d\\xd4\\x1a\\x27\\x6b\\x83\\xd6\\x55\\x48\\x6a\\xd7\\x8d\\xab\\x1a\\x09\\xaf\\x6d\\x06\\x5c\\xfb\\xfd\\x77\\x6a\\xcf\\xfa\\xfb\\xef\\x92\\x61\\x87\\xce\\x8d\\xc7\\xd3\\x5a\\xe4\\xc8\\xe3\\x36\\x36\\x2a\\x51\\xab\\x70\\x6e\\xe9\\x45\\x7a\\x2a\\x1c\\xa8\\x2d\\x6c\\x72\\x26\\x1c\\xb4\\x2d\\x50\\x4c\\xbd\\x40\\x47\\xba\\x17\\xce\\xdc\\xa8\\xff\\x63\\x2b\\x4b\\xd1\\x00\\x5e\\x3a\\x17\\xf7\\xd0\\x00\\x8a\\x8a\\xc8\\x4b\\xe7\\x52\\x51\\x01\\xbe\\x82\\xea\\x24\\x25\\x60\\xf3\\x65\\xf4\\x76\\x86\\xf8\\x51\\x0d\\xa7\\x4a\\x07\\x7b\\x20\\x7e\\xc0\\x55\\x85\\xb5\\xee\\x59\\xea\\x14\\x1d\\x52\\xed\\x5d\\x8a\\x52\\xd0\\x05\\x4a\\x8d\\x03\\x77\\xbe\\x9c\\x05\\x4a\\x5e\\xa0\\x4d\\x7a\\xda\\xbc\\xee\\x6c\\x18\\xcc\\x7e\\x9c\\xf5\\xa1\\x01\\xaa\\x4a\\xbe\\x48\\xb3\\x8c\\xaa\\x15\\x3e\\x53\\x96\\x43\\x6a\\x99\\xee\\x49\\xe4\\x06\\x19\\xc1\\xf4\\x5a\\x07\\xb4\\x89\\xf4\\x0a\\xb7\\x48\\x71\\xdf\\x5a\\xc8\\xda\\x90\\x37\\xba\\x9c\\xf0\\x0e\\x28\\x67\\xb7\\x51\\xb3\\x77\\xcd\\x57\\xd1\\x37\\xc1\\x31\\x56\\x95\\xc9\\xe6\\xfd\\xe3\\x48\\x0c\\x32\\x13\\x09\\x0c\\x4a\\x41\\x5e\\x5b\\x67\\x27\\xb5\\xd6\\x59\\xe3\\xd4\\x96\\x78\\xf2\\x37\\x52\\x22\\x2c\\xa5\\xe5\\x38\\x7a\\x26\\x86\\xa6\\xe8\\x17\\xca\\x6d\\xea\\x5c\\x6d\\xe4\\x3c\\xaa\\xfe\\xdc\\x58\\xf1\\x07\\x49\\xde\\x99\\x31\\x86\\x44\\xef\\x6d\\xed\\x28\\x4f\\x1b\\xc9\\x7c\\x51\\x62\\x3c\\x4a\\x7c\\xd6\\x74\\x26\\x5a\\x24\\x91\\xa1\\x4c\\x7f\\x34\\x92\\x3c\\xa2\\x46\\x7d\\x7b\\xfa\\x4c\\x12\\x74\\x48\\x4f\\xbc\\x27\\xb5\\x93\\x55\\x0b\\x3f\\x2b\\x7c\\xdb\\x15\\xaa\\x4b\\x1a\\xfc\\x2f\\xfb\\xd6\\x72\\xe7\\x56\\xb6\\xec\\x04\\x77\\x15\\xcc\\x14\\xb4\\xfc\\x8d\\xea\\x71\\x19\\x5e\\x5b\\x5f\\x29\\x68\\xb3\\x81\\xd5\\x11\\x2a\\x31\\x6b\\x6c\\x29\\xf3\\x55\\x3a\\x5f\\xce\\x66\\xf4\\x52\\xa4\\x26\\x73\\x69\\xa6\\x4a\\x1a\\x10\\x75\\xdf\\x9a\\x74\\xc8\\x6b\\x6c\\x96\\x39\\x5e\\x7e\\xf8\\x66\\xa9\\x0b\\x56\\xf3\\x60\\xd1\\xbd\\xf4\\x43\\x35\\x4a\\xb7\\xe2\\x5b\\x67\\xf6\\xf4\\xbb\\xe6\\x12\\x6a\\x68\\xbd\\x92\\x0f\\x57\\x3c\\x05\\xaa\\x9a\\x5d\\x9f\\x21\\x26\\xd2\\x2a\\x2a\\x6e\\x2d\\xac\\xdb\\xa6\\xa7\\xc0\\xec\\xe9\\x31\\x97\\x08\\x71\\x09\\x19\\x24\\x7e\\x40\\x31\\xd2\\xdb\\x72\\xe9\\x3d\\xfd\\x17\\x7e\\x57\\xe0\\xcf\\x01\\xfb\\xc3\\x9f\\xfe\\x55\\xba\\xdf\\x6a\\x58\\xc6\\x33\\xb4\\x61\\x33\\xf4\\x79\\x16\\xac\\xfa\\x90\\xed\\x8f\\x5e\\x0e\\xdf\\xd0\\x6e\\xe1\\xf5\\xf0\\x00\\xa3\\x6d\\x14\\x5b\\x01\\x91\\x20\\xf5\\x22\\x09\\x6b\\x62\\xc4\\xa0\\xf9\\x6b\\x45\\xa6\\xad\\xbe\\xb3\\x86\\x2b\\x1a\\xa1\\xff\\xad\\x3a\\x5a\\xb7\\x96\\x3e\\x04\\xee\\xa4\\xd4\\x28\\xc1\\x91\\xd7\\x1f\\x2f\\xc7\\xf8\\x0b\\x58\\x34\\xfc\\x65\\x37\\xcd\\x1f\\xd8\\xe5\\xe3\\xf5\\xff\\xa7\\x7e\\xce\\x87\\x98\\x8f\\x78\\x05\\xec\\x3d\\x1d\\xbb\\x58\\x3a\\x93\\x27\\x79\\x69\\x3b\\xdc\\x75\\x28\\x0d\\x8a\\xd1\\xd1\\x23\\x94\\xe9\\xe7\\x9f\\xa3\\x23\\x6a\\xed\\x6b\\xb6\\x90\\xe6\\xad\\xe8\\x17\\x90\\x93\\xd7\\xc0\\x51\\x1b\\x72\\xb3\\x5b\\x07\\xaa\\xeb\\x67\\xb4\\xc6\\xe4\\x0e\\x2d\\xe5\\xa9\\x81\\x96\\x6f\\x83\\xac\\x3e\\x44\\xa5\\xe4\\x47\\x5a\\x6c\\x98\\xd9\\x99\\xb8\\x9c\\xfc\\x4c\\x0b\\x8e\\x1c\\x5c\\x26\\x63\\xe7\\xd9\\xdf\\xd1\\x59\\xe5\\xb3\\x5a\\xec\\xaa\\x32\\x65\\x6e\\x7d\\x55\\xfa\\x4b\\xbd\\xf3\\xb7\\xbf\\x79\\xcf\\x4b\\x14\\xa6\\x66\\x74\\xd0\\xcd\\x36\\x8f\\xd9\\x41\\x77\\xec\\xc5\\xdb\\xd6\\xf8\\xda\\x7e\\x10\\xe1\\x12\\xfb\\xa2\\xf7\\x91\\x40\\xd0\\xef\\xbb\\xaf\\x94\\x44\\x7c\\xf3\\xbd\\xa5\\x32\\x70\\x13\\xf9\\xc1\\xaf\\x7b\\xcb\\xae\\x32\\xe5\\x2b\\x46\\xe7\\x36\\xd9\\x22\\x20\\xa3\\x30\\x27\\xe6\\xaf\\xf7\\x96\\xd0\\x65\\x4b\\x74\\xfc\\x74\\x31\\xdf\\x2c\\xd1\\xa1\\xaf\\x88\\x9f\\x27\\xd1\\x11\\x1c\\xb5\\x5f\\x40\\xa2\\x13\\xf1\\xda\\x7e\\xa6\\x44\\xc7\\x17\\x12\\x1d\\x26\\xa8\\x28\\x2a\\x8e\\x41\\x55\\x8d\\xe3\\xc2\\xc1\\xc3\\x35\\x3d\\x0e\\x06\\x86\\x88\\x95\\x0b\\x6d\\xea\\x6e\\x68\\x64\\xf6\\x31\\x94\\x94\\x0f\\x79\\x54\\x3e\\x94\\xdc\\x94\\x5e\\xa6\\xe4\\x25\\x2d\\xc3\\x38\\x47\\xc6\\xf5\\xdb\\x04\\x19\\x01\\x99\\x08\\x41\\x46\\x9e\\x88\\x22\\x14\\x00\\x58\\x03\\x50\\x79\\x48\\x42\\xd2\\xc5\\xc3\\x64\\x54\\xe9\\x52\\xf1\\x47\\x97\\x7f\\x12\\xea\\xec\\x5a\\x63\\x63\\x86\\xfd\\xda\\xb1\\x28\\x6a\\xdc\\x11\\x3c\\x95\\x18\\x1c\\x06\\x77\\x77\\x87\\xb2\\x9c\\x02\\xfb\\x98\\x74\\x7b\\xc1\\x61\\xd8\\x1e\\x09\\x61\\x62\\x9a\\xa1\\x11\\xdb\\xac\\x00\\x42\\x67\\x4e\\xb2\\xda\\x4c\\xf1\\xc7\\x5c\\x11\\x7f\\xe4\\x66\\x5f\\x28\\x22\\x91\\xdc\\xec\\x4b\\x27\\xcc\\x11\\x24\\xd0\\xcf\\x1b\\x49\\x13\\x02\\xc4\\x76\\x39\\xcb\\x7b\\x4b\\x13\\x78\\x6d\\x64\\xed\\xac\\x14\\x91\\xc2\\x06\\xea\\x94\\x45\\x0a\\xeb\\x6c\\xcd\\x37\\xab\\xec\\x17\\xa8\\x1a\\xeb\\xca\\xce\\xbb\\xe8\\x2f\\x46\\x01\\x42\\x99\\x97\\x39\\x5c\\x7a\\x37\\xe6\\xd2\\xbb\\x2a\\x97\\xbe\\xcd\\x74\\xcf\\x1a\\xe1\\x06\\x66\\x78\\xf1\\xd1\\x10\\x56\\x0b\\xa4\\xf4\\x23\\x61\\x4f\\xa7\\x75\\x35\\xe5\\x32\\xa3\\xe9\\x35\\xca\\x9f\\xee\\x2b\\x35\\xda\\x46\\x52\\xa3\\x84\\xe0\\xc9\\xd9\\x72\\xa9\\xd1\\x5a\\x09\\x42\\x22\\x86\\xae\\x99\\x20\\x9d\\x66\\x3d\\x6b\\x7a\\x2a\\xdf\\x21\\xf6\\x29\\xb9\\xa9\\x6c\\xc6\\xc7\\xd8\\xcd\\xd3\\x5c\\x08\\x07\\xed\\x8b\\x4e\\x7d\\x1f\\x1b\\x90\\x63\\x0e\\x38\\x79\\xf2\\xeb\\x9a\\x2f\\x3d\\x51\\x9d\\x84\\x30\\x60\\x30\\x38\\x73\\xfd\\xa2\\x14\\xda\\xd5\\x72\\x73\\x86\\xa9\\x70\\xa6\\x6a\\xdd\\xb0\\x2f\\x7d\\xe6\\x6c\\x94\\x19\\x94\\x17\\x1a\\xfa\\x19\\x91\\x8c\\xdc\\xcf\\x22\\xc0\\x39\\x2d\\x79\\xee\\x8c\\xef\\xee\\xb6\\xb2\\x9e\\x6c\\xca\\x10\\xeb\\x17\\x51\\x95\\xf1\\x16\\xe3\\x9a\\x49\\xba\\xa7\\xb6\\x1c\\x02\\x3f\\x7d\\xfa\\x02\\x72\\x6b\\x7a\\x9e\\x74\\x4e\\x72\\x77\\x77\\xce\\x1c\\x21\\x14\\x15\\xeb\\x89\\xe6\\x32\\xe0\\x6e\\x06\\x8e\\xd5\\x95\\x00\\x88\\x49\\xac\\x42\\x50\\xf9\\xce\\x6e\\x5e\\xea\\xc3\\xd0\\x60\\x9c\\x98\\x1b\\x39\\x4e\\xcc\\xdf\\x9e\\xdc\\x3c\\xfd\\x0e\\x7a\\xac\\xff\\xb4\\x99\\x28\\x51\\xe9\\xdb\\x46\\x22\\x15\\x56\\x1d\\xfb\\xd6\\xe7\\x6c\\xfe\\x5f\\x3a\\xea\\xe7\\xb9\\xd8\\x7f\\xbc\\xdb\\xcc\\xf1\\xa2\\x9c\\x53\\x2c\\x8d\\x42\\x83\\x7d\\xa9\\x47\\x2c\\x44\\xdd\\x27\\x89\\x0e\\x73\\x78\\xce\\x43\\xf7\\x1b\\xbf\\x93\\x14\\x9b\\x87\\xb6\\xda\\x1f\\x07\\xb3\\x6a\\x67\\x84\\x7a\\xfd\\x98\\xf3\\x49\\xdc\\xeb\\x54\\x37\\x9d\\x8e\\xde\\x83\\xe4\\x07\\x63\\x80\\x3a\\xc8\\x00\\x75\\x19\\xc3\\xf4\\x82\\x33\\x4c\\xcf\\x23\\x8e\\xe9\\x98\\xb3\\x4c\\xf5\\xe3\\x9a\\x91\\xb3\\x11\\x6c\\x92\\x81\\xaf\\x31\\xb0\\x49\\x26\\x86\\x26\\x62\\x93\\x22\\xa7\\xf9\\x2f\\x5e\\x00\\x1f\\x42\\x7f\\x47\\x6a\\x70\\x85\\xc7\\xe0\\x83\\xfa\\xd2\\x0b\\xd7\\x78\\xd8\\xb1\\xa7\\xd7\\xa8\\x1d\\xb2\\x63\\x27\\xa1\\x4a\\xac\\x22\\xd9\\xa1\\x21\\x46\\x23\\x82\\x93\\x44\\xf1\\x14\\x90\\xe4\\x5a\\xc4\\xbc\\x95\\x12\\xde\\x52\\xb8\\x3f\\xbc\\xaf\\xc3\\x60\\x8b\\x6e\\xbf\\x90\\x7b\\x22\\x9c\\x77\\xe5\\xee\\xc4\\x19\\x25\\x27\\xbc\\x9d\\x23\\xb0\\x05\\x0f\\x0b\\x57\\x0e\\x85\\xb4\\xcb\\x6e\\x7e\\xb9\\xd0\\xb4\\x0e\\x24\\xa4\\x1c\\x62\\x2d\\xb3\\x06\\x5c\\x32\\x86\\x2a\\x84\\x57\\x45\\x8b\\x7e\\xfd\\xd8\\x2b\\x12\\x3a\\xc6\\x65\\xdf\\x5d\\x49\\xfb\\x75\\x67\\xd3\\xb5\\xe7\\x09\\xbd\\x97\\xa2\\xfd\\x0f\\xa5\\x60\\x48\\xed\\xc7\\x67\\xd6\\x8c\\xbc\\x53\\x0e\\xb3\\x66\\xd4\\xa1\\xe7\\x31\\x6b\\x46\\xa5\\x7f\\x26\\xd7\\x65\\xd4\\xf6\\x67\\x73\\x5d\\x46\\x16\\x2f\\x9f\\xeb\\x32\\xf2\\x79\\x8c\\x90\\xdd\\x9f\\xcf\\x63\\xdf\\xd4\\x38\\x2f\\xc0\\x06\\xf0\\x9d\\x64\\xa7\\x39\\x13\\x39\\x9a\\x6c\\xb4\\x53\\xf1\\x3e\\x43\\xee\\x82\\x92\\x3d\\x62\\xcd\\xc4\\xb5\\x50\\xa7\\x22\\x34\\x68\\x03\\x89\\xeb\\x3e\\x3c\\xa4\\xfe\\x20\\x78\\x66\\x7e\\x87\\x9a\\xbb\\x94\\x74\\xd8\\x5a\\xb8\\x6f\\xbc\\x66\\x6d\\x0f\\xd3\\x95\\x2a\\x5d\\x4d\\xbd\\xa6\\x3d\\xce\\xe6\\x75\\x75\\xa2\\x03\\x33\\xaf\\x4b\\x5f\\x91\\x6e\\x1e\\xaf\\xcb\\x33\\x90\\x6e\\x01\\x5e\\x57\\xe4\\x21\\xdd\\x4c\\x5e\\xb7\\x5b\\x8c\\xd7\\xd5\\x81\\x31\\x80\\xd7\\xed\\xc4\\xbc\\x6e\\x20\\xf3\\xba\\x41\\x82\\x47\\x95\\x55\\xf3\\x14\\xa5\\x69\\xe4\\x5f\\xff\\x43\\x62\\x60\\xfd\\xe5\\x98\\x7a\\xa7\\x60\\x71\\x0d\\x0b\\x33\\xb2\\xa3\\xa8\\xd7\\xaf\\x23\\x8b\\xce\\xd7\\xbc\\x4e\\xab\\x63\\x93\\xd9\\xd1\\x51\\xf4\\x88\\x1c\\x9c\\xf4\\xd8\\x43\\xbb\\x53\\x73\\x1c\\xd5\\x53\\x4b\\x46\\x63\\x4a\\x4c\\x69\\x74\\xaf\\xfb\\xcb\\xd9\\x9c\\x91\\xec\\xeb\\x0a\\xf7\\xde\\x68\\xc7\\x11\\x86\\x2e\\xa1\\xfc\\xab\\xea\\x26\\x8e\\x44\\xb9\\x21\\xaf\\xaa\\x7d\\x47\\x02\\xb7\\xbd\\x14\\x01\\x34\\x21\\x9b\\x6d\\x93\\x77\\x96\\x54\\xfa\\x75\\xf1\\xd6\\xdd\\xe5\\x22\\x44\\xcb\\x22\\xe6\\xcb\\xc0\\x81\\x46\\xc8\\x39\\xf3\\xd2\\x73\\xce\\x7c\\xb0\\x6c\\xa5\\x7a\\xdf\\x21\\x9b\\xed\\x71\\x0e\\xf2\\xd5\\x35\\xa3\\xd7\\x5c\\xc7\\x8b\\xaf\\x56\\x8c\\x6b\\x28\\xdd\\xb3\\x44\\x30\\xea\\x48\\x9d\\xc4\\x2f\\x5c\\xe6\\xf1\\xe0\\x7d\\xae\\x90\\xe0\\xbd\\x4d\\xde\\xc7\\x60\\x3d\\x20\\x80\\xe9\\x6e\\xac\\x94\\xca\\x1b\\xc4\\xec\\xd1\\xe6\\x3f\\x30\\x36\\xff\\xa3\\x49\\x8e\\x10\\x92\\xf7\\x18\\x4d\\xf2\\x93\\xd1\\x74\\x7a\\x4a\\x33\\x98\\xa4\\x0a\\xe8\\xfd\\xe6\\xa2\\xf5\\x9e\\x71\\x08\\x9e\\xdd\\x78\\x6f\\x70\\x8f\\x75\\x61\\x8b\\x2c\\x1a\\x19\\xc4\\x96\\xfb\\x0b\\xb2\\xde\\xc2\\x22\\x89\\xe6\\xc4\\xe6\\xee\\x86\\xac\\x37\\x90\\x6a\\xc7\\x13\\xb5\\xc5\\x0b\\x95\\x1e\\x79\\xce\\x88\\xba\\xb6\\xd0\\x00\\x1e\\x0f\\xdd\\x28\\x13\\x22\\x89\\x6f\\x99\\xd4\\xe5\\x73\\xf3\\xd6\\xf9\\xba\\xa3\\xee\\x42\\x3e\\xa3\\xab\\x90\\xad\\x7d\\x7b\\xf5\\xf9\\xda\\xd9\\xc2\\x3f\\x49\\xf7\\x51\\x2d\\x4c\\xe4\\x12\\x85\\x9a\\xdd\\xc0\\x27\\xfa\\x4d\\xfe\\x49\\x43\\xcb\\x05\\x3d\\x77\\xd5\\x0f\\x67\\xd5\\xf6\\xcc\\xed\\x5a\\x3c\\x52\\x27\\xfc\\xe4\\xa1\\xe1\\x4f\\xe3\\x94\\x12\\xb9\\x8c\\x1f\\xa8\\x0f\\xb0\\xd7\\x36\\x8b\\x8e\\x37\\x3a\\x3a\\x1a\\x71\\xab\\x2d\\xfc\\x65\\xc4\\x6e\\x1e\\xb8\\xaa\\xf3\\x9b\\x9d\\xb0\\xf5\\x32\\x0b\\x69\\xde\\xa3\\x90\\x06\\x1a\\x79\\x9f\\x2b\\xa7\\x41\\x8f\\x52\\x3c\\x26\\x21\\x25\\x78\\x3b\\xd5\\xad\\x78\\x58\\xdb\\xf0\\x70\\xc1\\xb8\\x73\\xea\\x90\\x88\\xc6\\x71\\xa7\\xd3\\xf8\\x83\\x93\\xd1\\x5f\\x65\\xe6\\x53\\x9f\\x27\\x8a\\x01\\xc3\\xd1\\x27\\x62\\x70\\x04\\x1a\\xb3\\x62\\xff\\x83\\x18\\xcf\\xe0\\xfb\\x4a\\xf5\\x1f\\x2f\\xa8\\x53\\xa5\\xda\\xb5\\x83\\xbf\\x6d\\x72\\x45\\x1f\\x2a\\x18\\xe6\\xc0\\x7e\\x6a\\xd5\\xcb\\xf4\\x07\\xb1\\x68\\xd8\\x03\\x8f\\x9a\\x4e\\xd3\\x44\\x14\\x49\\xc0\\x57\\xff\\xe2\\x5c\\x71\\x6c\\xc9\\x0f\\xda\\xf8\\x3a\\x48\\x63\\x53\\x2e\\x01\\x45\\x1a\\x86\\x2c\\xe8\\x54\\xe5\\xba\\x19\\xcf\\xc4\\x17\\x7b\\xf7\\x52\\x92\\x59\\x8c\\xa0\\x0e\\xf5\\xf3\\x54\\xa4\\x18\\x36\\x35\\xf2\\xf1\\x9a\\x62\\x69\\xc7\\x53\\x4b\\x6c\\xc7\\x91\\xe3\\x5b\\x78\\x88\\xc0\\x3a\\xff\\xd1\\x59\\xb5\\x78\\x04\\x87\\x92\\x8b\\xea\\xf5\\x9f\\x9c\\xf7\\x46\\x19\\x95\\x7a\\x82\\x2b\\x71\\x6e\\x7f\\x76\\x7e\\xba\\x87\\x98\\x2a\\x55\\xa1\\x2c\\xa5\\xfa\\x05\\xaa\\x94\\xa5\\x54\\xb0\\x98\\x7e\\x2e\\x1c\\x04\\x17\\xca\\xe7\\x64\\xde\\xc4\\x76\\xf7\\xe2\\xc0\\x55\\xe3\\x6d\\x61\\xb6\\x70\\x52\\xa0\\xa6\\xad\\x64\\xc1\\x9f\\x93\\x35\\x0e\\xba\\x94\\x9f\\x17\\xd9\\xde\\x39\\x13\\x86\\x98\\x3a\\xf8\\x63\\x6e\\x25\\xee\\xaa\\xfb\\x3e\\xbf\\x9e\\x82\\x03\\x65\\xf1\\xa5\\xb8\\x20\\x30\\x27\\x2f\\x9e\\xae\\xb3\\x70\\xc4\\x1b\\x26\\x37\\x18\\x37\\x9c\\xcb\\x81\\x3e\\xc2\\xb7\\x55\\xe4\\x3e\\x72\\xbd\\x1c\\x17\\x32\\xe2\\x47\\x75\\xdf\\x26\\x63\\xa4\\xa6\\x0e\\x9d\\x7e\\xe4\\x3d\\x03\\xe3\\xc5\\x53\\xe2\\x2b\\x4e\\xca\\xbd\\x3a\\x32\\x9b\\xcc\\x12\\xc5\\x21\\x4e\\xa0\\x32\\x8e\\x24\\x94\\x36\\x59\\xb2\\x03\\xe4\\x57\\xe7\\x8a\\xf2\\x93\\xa5\\x1f\\x82\\x0a\\x15\\x27\\x1e\\x6c\\xd9\\x1a\\x20\\xe2\\xe4\\x69\\x1c\\xae\\x77\\xd7\\xcd\\x01\\x1f\\x74\\xfd\\x79\\xcd\\x66\\xec\\x25\\x2a\\xe2\\x9e\\x3f\\x7f\\x0e\\xad\\xc8\\x7f\\x70\\xc7\\x62\\x7f\\x4f\\x47\\xfd\\x2e\\xe5\\x37\\x85\\x0f\\x12\\x85\\xe3\\x8f\\x18\\xfe\\x17\\x8c\\xef\\x03\\x76\\x3f\\x39\\x32\\x75\\xe2\\xf9\\x74\\xfe\\xba\\xd7\\x20\\xd9\\xd4\\x0f\\xec\\xdd\\x4f\\x39\\x42\\xdc\\x71\\x2c\\xc4\\x8d\\x4b\\x93\\xc5\\xd1\\x91\\xda\\xa5\\xad\\xe4\\x29\\x23\\xbb\\xc2\\x8f\\x4c\\xb2\\xc2\\x8e\\xa9\\xdf\\xb2\\x8e\\x78\\xea\\x56\\x77\\x8c\\xc1\\x34\\xf8\\x31\\xdf\\x8c\\x4f\\x0b\\xe5\\x8d\\x7c\\xd3\\xfc\\x16\\x5d\\x76\\x3f\\x65\\x8b\\x3d\\x13\\x15\\x44\\x18\\xa1\\x8f\\x4f\\x8f\\x25\\xc9\\x12\\xfa\\x3e\\xa9\\x9b\\x9d\\x9f\\x48\\x16\\x54\\xbf\\x19\\x68\\x04\\xee\\xa7\\xda\\xae\\x0e\\x60\\x47\\x5a\\x25\\x72\\x80\\x16\\xae\\xc2\\x15\\x9c\\xef\\x4e\\x26\\xe1\\xe2\\xc0\\x03\\xfe\\x26\\x76\\x15\\x07\\x93\\x46\\x65\\x94\\x07\\x28\\x56\\x3a\\x98\\x02\\x25\\x1e\\xb6\\xab\\x68\\xa8\\x07\\xbb\\x62\\x18\\x6d\\x30\\xb1\\x31\\x3e\\xc5\\xcb\\x88\\xae\\x17\\xf6\\xc1\\x68\\x9c\\x42\\xfa\\xc1\\x50\\x84\\x25\\x85\\xe5\\x05\\x5a\\x4e\\xdc\\xc4\\x6d\\x9b\\xfc\\x64\\x8a\\xb1\\x2d\\x56\\xc8\\xd0\\xc6\\x63\\x40\\x91\\xe0\\x4a\\xe7\\x5b\\x02\\x05\\x98\\x58\\xa6\\x71\\xce\\x03\\x05\\x25\\xc8\\x41\\x5b\\x1f\\x93\\x28\\xaf\\x4f\\x36\\xbd\\x9e\\xb5\\x53\\x88\\xb2\\x8d\\x91\\xbb\\xad\\xe2\\x44\\x6a\\x66\\x80\\xed\\xba\\x24\\x99\\x26\\x3b\\x3e\\x12\\x9e\\xcd\\x59\\xf2\\x4e\\x63\\xc5\\x12\\xe7\\x3e\\x1c\\x5d\\x79\\xd7\\x11\\x79\\x71\\x74\\xc4\\x9e\\xd5\\xb5\\xc8\\xd6\\xef\\xbf\\x9c\\xc4\\x99\\x23\\x1d\\xc4\\xfc\\x94\\x2b\\x44\\xc2\\x40\\x1b\\xc9\\xc5\\x6e\\x37\\xff\\xc5\\x3e\\x41\\x07\\x59\\x1c\\xbd\\x27\\x45\\x21\\xf7\\x62\\x61\\x7a\\x3d\\x0e\\xbc\\xfa\\x6b\\x41\\xba\\x09\\x1a\\x3d\\x3c\\x63\\x92\\xef\\xdf\\x13\\xe3\\x48\\xde\\x29\\xfa\\x28\\xeb\\x7f\\xd5\\xc7\\x13\\xa4\\xcb\\x9d\\xb8\\x9e\\xc6\\x43\\x74\\x60\\x61\\x83\\x11\\xfd\\x55\\x3b\\x41\\x5b\\x2f\\xef\\xe4\\x53\\xeb\\x53\\xc3\\xdb\\x35\\x7f\\x37\\xc5\\x62\\xe7\\x7b\\x0f\\x43\\x40\\x0e\\x83\\x0a\\x5f\\x3f\\xc7\\xc9\\xf4\\xb6\\x3b\\xef\\x51\\xef\\x5d\\x28\\xdf\\xae\\x91\\x7a\\x2d\\x59\\x52\\x1b\\xff\\xb0\\xc3\\x17\\x8f\\x0d\\x53\\xaa\\xcc\\xa7\\x1d\\x87\\x71\\xaf\\xcb\\xd6\\x95\\xc7\\xd2\\xd2\\x45\\x51\\xb5\\xeb\\xc9\\xb2\\x6a\\x78\\x22\\xbf\\x27\\x3a\\xa6\\x31\\x77\\x33\\x4f\\xc8\\xdd\\x1d\\xce\\x07\\xb5\\x80\\xbb\\x77\\xf3\\x3a\\xbf\\x39\\x9e\\xe7\\xfc\\x2b\\x49\\xa8\\x53\\x66\\x53\\x21\\xf4\\x90\\x9b\\xf4\\xd2\\x31\\xf1\\x4d\\x28\\x5f\\xb9\\x02\\x65\\x73\\x3f\\x93\\x8d\\x51\\xa3\\x03\\x95\\xc1\\x3b\\xa1\\xb6\\xf8\\xc4\\xc5\\xa4\\x78\\x82\\xaa\\x2f\\xcc\\x04\\x0c\\xd2\\xae\\xfc\\x54\\xfa\\x27\\x70\\x1e\\xde\\xde\\x62\\xfd\\x97\\xc0\\x06\\xf4\\x63\\xc1\\x7e\\xea\\xf0\\xc1\\xc8\\x68\\xdd\\xd8\\x64\\x8b\\x69\\x91\\xba\\xfc\\xaf\\xdd\\x8a\\x7e\\x35\\x34\\xae\\x33\\x3f\\x3e\\xfd\\x1b\\x90\\xe9\\x36\\x2b\\x45\\xc3\\x0a\\x56\\x3e\\xa1\\xcd\\xa5\\xba\\xad\\x36\\x05\\x6f\\x49\\xbc\\xac\\x03\\xc9\\xee\\x93\\x5d\\xba\\xe6\\xba\\xe8\\xa4\\x74\\x6d\\x2a\\x1a\\xb1\\x7a\\x7c\\x08\\x81\\x18\\x42\\x2f\\x1a\\x42\\xcf\\x3c\\x84\\xdf\\xac\\x4f\\x4f\\x9f\\x7d\\x97\\x18\\xc2\\xc7\\xf4\\x10\\xb6\\xc9\\x66\\x7b\\x29\\xc2\\x2b\\x7d\\xee\\x87\\xda\\x00\\x02\\x5c\\xb0\\x42\\xd1\\x6b\\x4c\\xf0\\x80\\xaa\\xde\\x6c\\xf9\\x4a\\x96\\x80\\x84\\x0a\\x5f\\xf0\\x0e\\xd1\\x09\\xe0\\xcf\\x13\\xcd\\xbb\\xd8\\x7e\\x5f\\xc4\\xc2\\xa1\\x1b\\x9e\\x60\\x87\\x5e\\x22\\xdb\\x54\\xa8\\x9d\\x81\\xda\\x0e\\x23\\x37\\x35\\xcd\\xc4\\x07\\xae\\x23\\x1d\\xbe\\x64\\xad\\x3c\\x6d\\x51\\xf0\\x85\\x9f\\xed\\x37\\x67\\x9d\\x6e\\x30\\x16\\xdf\\x40\\xbb\\xfd\\x84\\x2f\\xe5\\x38\\xab\\xda\\x6e\\xc2\\x89\\xf0\\x56\\xf8\\x0a\\x6e\\x66\\x57\\x3f\\xcc\\xd6\\x5f\\x48\\x6d\\xa0\\x9f\\xec\\x2a\\x0d\\x8f\\xf2\\x5a\\x44\\x5f\\x9d\\x8b\\x68\\x1b\\x24\\x20\\x7d\\x32\\x40\\x5b\\x5c\\xe0\\xe9\\x34\\xd7\\x91\\x72\\x35\\x2b\\x97\\x18\\x51\\x39\\xfb\\xd4\\xc5\\xd7\\x25\\x3d\\x2a\\xca\\xac\\x4a\\xd4\\xca\\x19\\x8d\\xc1\\x0f\\x7b\\x95\\x73\\xf9\\x3e\\xfb\\xaa\\xbf\\xfe\\xcc\\x02\\xc9\\x56\\x37\\xe8\\x04\\xa0\\x13\\x07\\x89\\xa5\\x51\\xea\\xac\\x1e\\x74\\x52\\xf0\\xcb\\x43\\x47\\x14\\xbe\\x0a\\xae\\x9b\\x52\\x0c\\xfd\\x28\\x86\\xc2\\x10\\x8d\\x91\\x35\\xb1\\xf5\\xdb\\x3c\\x5e\\x22\\xd1\\xbd\\x44\\x0b\\xe6\\xbe\\xe3\\x45\\xb2\\x0f\\x8b\\xf6\\xc5\\x1a\\x92\\xc0\\xb6\\x71\\x05\\x51\\x4b\\x60\\xca\\x64\\x74\\x69\\xfc\\x5c\\xa6\\xb2\\xf2\\x50\\x48\\x41\\x33\\x71\\xad\\x15\\x8e\\xba\\x9b\\xb8\\x9b\\xd8\\x12\\xe4\\x5e\\xce\\x8f\\x05\\xdc\\xc7\\x8b\\x24\\x2b\\x62\\xdf\\xf8\\x6c\\x83\\xfd\\x66\\x13\\x29\\xac\\xb7\\x94\\x4d\\x32\\xdf\\xae\\xe8\\x92\\xeb\\x14\\x4a\\x58\\xad\\x3d\\x7b\\x32\\x25\\x18\\x3b\\x0a\\x01\\x15\\xc1\\x7c\\x41\\xa7\\x96\\xf6\\xc5\\x1a\\x98\\x29\\x5f\\x3a\\x1e\\xe8\\x68\\x48\\x6e\\x22\\xd7\\x76\\x78\\xcc\\x0e\\xae\\x66\\xd7\\xf1\\xe7\\x70\\x50\\x73\\x86\\xfd\\x9f\\x3b\\x5d\\xc5\\x75\\x1c\\x9f\\xae\\x36\\xce\\x44\\x60\\x37\\x87\\x91\\xfc\\x3f\\x56\\x97\\x51\\x9a\\xb7\\x5f\\x96\\xa8\\x5e\\x31\\xe0\\xb2\\x20\\x7f\\xd5\\xe0\\x78\\xd6\\x07\\x29\\x5a\\x8a\\x5d\\x55\\xc3\\xc1\\xe9\\x46\\xd1\\x53\\xbb\\x84\\xf4\\x12\\xbb\\x2c\\x39\\x38\\x76\\x4e\\xd8\\x87\\x69\\x0c\\x50\\x29\\x07\\xfb\\x87\\x19\\xea\\xbe\\xc2\\xe0\\xcc\\x78\\x35\\x02\\x83\\x9b\\xbd\\xad\\x92\\x40\\x6c\\xcd\\xa6\\x42\\x87\\x5a\\xec\\x14\\xa5\\x9b\\xf6\\x4b\\x22\\x00\\x8a\\x8b\\xb2\\xf5\\xf4\\x92\\x95\\x49\\x3d\\x4b\\x43\\x43\\xb2\\xf0\\x3a\\xf1\\xf1\\x14\\xe7\\x87\\x63\\x62\\xa7\\x48\\x40\\xe3\\x57\\xca\\x42\\x97\\x9a\\xa2\\xe7\\x25\\xb4\\xc3\\x4e\\xd5\\xbe\\xe9\\x40\\x15\\xaf\\x64\\xf9\\xb5\\xa9\\x4a\\x71\\x24\\x42\\xad\\x6b\\x27\\x7e\\x54\\x0f\\xac\\x1d\\xea\\x0a\\x24\\x33\\x71\\x8d\\x0e\\x22\\x61\\x35\\x1e\\xc9\\xd1\\x7d\\xe5\\x1c\\x7a\\x77\\x77\\x67\\xbd\\x73\\x98\\x80\\x10\\x5a\\x50\\xd6\\x34\\x8b\\xd7\\x74\\xe8\\xf1\\x33\\x42\\x88\\x44\\xbd\\xa6\\x08\\x84\\xce\\xcf\\x0e\\x97\\x9e\\x77\\xcc\\x17\\xa2\\xaf\\xe6\\x6a\\x3b\\xef\\x2c\\xf4\\x6f\\x2d\\x7c\\x19\\x57\\xff\\xf1\\xe2\\x04\\x49\\xf0\\xcb\\x16\\xac\\x72\\x99\\xf4\\x47\\x7b\\x73\\xcf\\x6e\\xa4\\x52\\xeb\\x44\\x34\\x13\\xb5\\x97\\xc5\\xef\\x70\\x8e\\xc9\\xf9\\xba\\x6d\\x58\\xef\\xe8\\xbb\\x4a\\x9b\\x0a\\x2e\\x11\\x9e\\x87\\x7e\\x2f\\x90\\x0b\\xda\\x89\\xc3\\xba\\x13\\x23\\x13\\x90\\xe6\\xa6\\x9e\\x50\\x15\\xcf\\x9c\\x96\\x4d\\xdd\\x9e\\xaa\\x29\\x7d\\xa9\\x14\\xbd\\xfe\\x2c\\x9b\\xc6\\x58\\x4e\\xa6\\x0d\\xd5\\xe3\\x9a\\x6e\\x0d\\xde\\xcc\\x48\\x07\\x89\\x18\\x33\\x10\\xc4\\x33\\x01\\x1b\\x7f\\x16\\x0b\\x45\\x38\\x0a\\x02\\x1d\\xd5\\x4e\\x1c\\x7d\\xb8\\xac\\x18\\x20\\x4d\\xff\\xdc\\xe0\\x84\\xf2\\x78\\xfd\\x87\\x34\\x5c\\x7f\\x1d\\xc3\\xf5\\xd7\\xc8\\x0a\\x7f\\xad\\xf1\\xd7\\x06\\x3e\\x7b\\xbf\\x4d\\xad\\x1c\\x95\\x08\\x09\\xd4\\xb8\\x91\\x56\\x72\\xca\\xfe\\x9c\\xe9\\xa1\\x12\\x2e\\x9c\\xb4\\x6e\\x37\\xc0\\x38\\xd7\\x0a\\x1e\\x42\\xb9\\x9b\\xd5\\xbd\\x2b\\x3b\\x0a\\x20\\x17\\xd4\\x93\\xc0\\x25\\xf4\\xa7\\x29\\xf6\\x49\\x4d\\x25\\x09\\xba\\x7a\\x0f\\x02\\xc2\\xc1\\xcb\\xdf\\xd0\\x99\\x32\\xcf\\xb1\\x68\\x09\\x87\\x59\\x0c\\x57\\x82\\xec\\xa3\\xf1\\x94\\x93\\x96\\x4c\\xf2\\x9c\\x63\\x6c\\x72\\x22\\xde\\xa5\\xbe\\x68\\x57\\x57\\x14\\x6e\\x27\\xb6\\x4b\\x59\\x70\\xa8\\xc3\\xba\\x84\\x2b\\x4a\\xf8\\x67\\x78\\xe5\\x7c\\xed\\x37\\xe0\\x33\\xa0\\x3d\\xc0\\x6b\\xad\\xc3\\x83\\x73\\x72\\x61\\xeb\\x4d\\xf6\\x52\\xaa\\xcf\\xaf\\x6c\\x91\\x35\\x5c\\x93\\xd2\\x46\\xd1\\xd9\\xd0\\xd9\\x6e\\x20\\x99\\x27\\x66\\xbb\\xb1\\xc6\\xd8\\x6d\\x6f\\x33\\xdb\\xf2\\xa4\\xc0\\x38\\x9e\\x72\\xf4\\xf1\\x27\\x9b\\x48\\xef\\x95\\x73\\xcc\\x93\\xce\\x31\\x29\\x0f\\xeb\\x34\\x7a\\xd3\\xd7\\xb0\\xfa\\xbe\\x4a\\x45\\x8a\\xdc\\xf4\\x94\\xde\\xed\\x9a\\x7a\\x8a\\x37\\x07\\x33\\xc3\\xad\\x33\\x36\\x0d\\x76\\xc7\\x72\\x42\\x18\\xb6\\x00\\x27\\x3f\\xa2\\x04\\x01\\x9c\\x91\\x82\\x46\\xee\\x9a\\xfc\\xd1\\xf1\\x61\\x71\\x09\\x20\\x4d\\x74\\x29\\xe3\\xcb\\x79\\x02\\x58\\x93\\xd5\\x47\\x03\\xb0\\x66\\xa4\\x00\\x6b\\xe8\\xe2\\x79\\xc7\\x62\\x8f\\xa4\\x6d\\x12\\xce\\xe1\\x70\\xa4\\xc2\\x17\\xa7\\x83\\xbf\\xe8\\xc1\\xe3\\xf4\\xb9\\x0a\\x10\\x65\\xa5\\xce\\x00\\xe9\\xc0\\x53\\xf4\\x94\\xd1\\x85\\x5f\\x5b\\xfa\\xab\\x47\\x3c\\xf9\\x5c\\xa2\\x21\\x51\\x9d\\x21\\xba\\x6c\\xa7\\x71\\x56\\xb6\\x12\\x8e\\x66\\xf4\\x10\\x38\\x9a\\x4c\\x7c\\x8a\\x11\\xa3\\x9f\\x8d\\x4f\\xd1\\x3b\\x29\\x40\\x0f\\x18\\x62\\x3d\\x1b\\x0a\\xae\\xd3\\x05\\xd7\\x91\\xf7\\x8b\\x73\\x3e\\x6d\\x7b\\x05\\x88\\x15\\x85\\xdf\\xd3\\xe9\\xdf\\x27\\x4e\\x2b\\x73\\x9d\\xc1\\x4e\\x51\\x53\\xb9\\xb3\\x74\\xb9\\x33\\x16\\xaa\\x99\\x9d\\xfe\\xf4\\x98\\xd9\\x3b\\xa4\\x6e\\x36\\x14\\xc7\\x18\\x45\\x18\\x87\\xf9\\x2b\\xae\\xa1\\xbd\\x43\\x1f\\x63\\xc9\\xdf\\xb2\\x4a\\x1a\\x43\\x59\\x4f\\xc2\\xcb\\xd9\\x2c\\x9c\\x9d\\xf7\\x02\\x7f\\x68\\x2a\\x7c\\x99\\x2e\\x7c\\x59\\x08\\x3b\\x34\\x7a\\x44\\xec\\xd0\\xe8\\x7e\\xd8\\xa1\\xd1\\x9f\\x80\\x1d\\xd2\\xb4\\x59\\x00\\x3b\\xa4\\x03\\x7a\\x99\\xb1\\x43\\xf4\\x15\\x19\\xe7\\x61\\x87\\x78\\x06\\xc8\\x98\\x8f\\x1d\\x12\\x79\\xc8\\x38\\x13\\x3b\\x34\\x16\\xd8\\xa1\\x4c\\xb3\\x96\\x24\\xfe\\xcc\\xa3\\xf8\\xb3\\xb4\\x59\\x0b\\xe9\\x73\\xd1\\xe9\\x04\\x67\\x68\\x49\\xa3\\x0a\\xa4\\x48\\xbc\\xa2\\xd1\\x80\\xf1\\x46\\x72\\x5c\\x82\\x91\\x08\\x0f\\x6b\\xa8\\x8e\\x97\\x0f\\x66\\x8a\\x0c\\x05\\xa2\\x7f\\x1e\\xfc\\x1c\\xce\\xc2\\x49\\xd8\\xc7\\x04\\x6c\\x34\\xd6\\xa7\\x65\\x6e\\x29\\x7d\\x48\\xec\\x98\\x64\\x72\\x93\\x24\\x53\\x01\\xe7\\x30\\x17\\xe9\\x3a\\x2f\\x10\\x60\\x25\\x63\\x51\\x80\\x6c\\x93\\x9f\\x7a\\xca\\x93\\xc0\\x3a\\x5d\\x24\\xed\\x83\\x12\\xd8\\xab\\x4e\\x21\\xdb\\x21\\xb8\\x09\\xe1\\xa2\\x59\\x04\\x67\\xee\\x6c\\x3f\\xc8\\xd5\\x26\\x82\\x5c\\x25\\x81\\x54\\xdc\\x82\\x74\\xe4\\x0c\\x2a\\x7d\\xe6\\x0c\\xa5\\xcf\\x97\\xe4\\xda\\x19\\xc2\\x6f\\x34\\x5c\\xe8\\x8b\\x85\\xb7\\xcd\\x05\\x11\\x51\\x41\\x93\\x49\\x8f\\xc1\\xf9\\x19\\x7d\\xb8\\x38\\x0e\\xee\\xf5\\x22\\xd3\\xf2\\x5b\\xc7\\x3f\\x3a\\x6a\\xb7\\xae\\xae\\x1b\\x5e\\x8e\\xec\\xc1\\xcc\\x22\\x01\\xe5\\x13\\xd2\\x67\\xa0\\x78\\xa6\\xfc\\x07\\x46\\xec\\xdb\\xd6\\x76\\xb4\\x9d\\xb1\\x10\\x81\\xb0\\xf0\\xb2\\xcc\\x79\\xc9\\x6d\\x1a\\x6a\\x12\\xb5\\xb7\\xd9\\x09\\xa7\\x26\\xd4\\x41\\x8d\\x15\\xdc\\xdd\\x21\\x74\\xe3\\x9a\\x54\\x61\\xf1\\x4e\\x22\\x8f\\x28\\xb4\\xb6\\xa4\\x53\\x94\\xac\\x7a\\x51\\xe5\\xc5\\xc3\\x90\\xdc\\xa0\\xd4\\x68\\xc2\\x05\\xc3\\xf3\\x56\\x07\\x5a\\x58\\x57\\xac\\x89\\x2c\\xc3\\xf9\\xbe\\xd6\\xaa\\xa3\\x6b\\x5e\\x32\\x91\\x45\\x38\\x27\\x2c\\xf5\\xba\\x41\\x8b\\x10\\xf4\\x28\\xdd\\x75\\xba\\x77\\x77\\x63\\x60\\xea\\xd0\\xe1\\x3e\\x77\\xb9\\x26\\x10\\x25\\x14\\x33\\x86\\xff\\x5c\\x73\\x07\\x36\\xa7\\xce\\xd6\\x08\\x19\\x11\\x2b\\xcf\\x73\\x67\\x8a\\x93\\x94\\x33\\xe7\\xf4\\x1e\\x78\\x11\\xa5\\x36\\xe0\\xa7\\xce\\xe4\\xb2\\xcd\\x53\\x19\\x2e\\xb2\\x3b\\xcf\\xc6\\x27\\xa0\\x0c\\x7a\\x8a\\x88\\x8d\\xd3\\x1c\\x95\\x74\\x3f\\xd6\\x71\\xf7\\x55\\x43\\xa5\\x0b\\xe7\\x54\\x11\\x6d\\x8b\\x2a\\x93\\x8a\\x14\\x9a\\x2e\\x46\\xaf\\xfb\\x8a\\xbb\\x0c\\x55\\x59\\x53\\x6f\\x75\\x62\\xd0\\x21\\x31\\xfb\\x03\\xc9\\xe2\\x3a\\xf1\\x8a\\x08\\xbb\\x87\\x94\\x67\\xce\\x0d\\x29\\x49\\xa7\\x44\\xe3\\x00\\xb3\\x1d\\xc4\\x23\\xba\\x5f\\x73\\xb2\\xcd\\xbe\\xf2\\x05\\x74\\x7b\\x2e\\xfa\\x2a\\xf8\\xa5\\xd9\\xae\\xae\\x94\\xca\\x9e\\xec\\x09\\xb0\\x97\\x34\\xec\\x97\\x66\\x8b\\xbe\\xdb\\x61\\x4b\\x79\\x43\\xcb\\x1d\\x95\\x61\\x48\\xd5\\xbf\\xbd\\x60\\x1f\\xfe\\xd2\\xb9\\x48\\x2d\\x78\\x69\\x81\\x67\\x1c\\x38\\x3b\\x34\\xe2\\xd1\\x29\\xe0\\xd0\\xeb\\x8f\\x79\\x3f\\x14\\x77\\x9a\\x5d\\x2a\\x5b\\x63\\x8b\\x1d\\x5d\\x76\\xb9\\x5a\\x7b\\xf1\\x64\\x2c\\xfb\\xe5\\x46\\xfd\\xd6\\x41\\xa9\\x8c\\x9b\\x97\\x7b\\xc4\\x08\\xb3\\x5c\\x26\\x24\\x2d\\xf9\\x93\\xdf\\x01\\x5d\\x32\\x2e\\x35\\x6e\\x12\\x70\\x16\\x1a\\x2e\\xe7\\x9e\\xbd\\x07\\xf1\\x56\\x90\\xdb\\x95\\x7a\\xaa\\x2b\\xe8\\xa1\\xe0\\x5b\\x7b\\x92\\x50\\x6a\\xd0\\xae\\x2c\\x35\\x2e\\x1b\\xbe\\xa1\\x9d\\xa4\\xea\\x4b\\x6d\\x83\\xaa\\x8c\\xee\\x57\\x3f\\x91\\xa2\\x5c\\x87\\x53\\x8c\\xdf\\xe5\\x76\\x39\\x00\\x98\\x37\\xdd\\xf6\\x46\\xd9\\xad\\x5f\\x78\\xa3\\xc7\\xea\\x80\\xc9\\x8f\\x95\\x50\\xb9\\xd6\\x12\\x3a\\xe3\\xea\\x3f\\xd4\\xa5\\xfc\\xd4\\x8b\\x62\\xa9\\xcf\\x5b\\xd6\\xcb\\x7d\\x4c\\xdd\\xc8\\x65\\xd2\\x56\\x2c\\x61\\xc6\\x28\\x09\\xaf\\x16\\x16\\xbb\\xfe\\x71\\xca\\xf2\\xce\\x15\\x38\\x02\\xe6\\x07\\x4a\\xfb\\x1b\\x4d\\xbf\\x65\\x00\\x91\\xb6\\x49\\xd6\\x20\\x5c\\xd5\\x13\\xd1\\x76\\x85\\x6e\\x58\\xf4\\x1e\\xff\\x1c\\xc8\\x88\\xc6\\x65\\x32\\x56\\x8e\\x0c\\x71\\xba\\xcc\\x3f\\x68\\xe3\\x16\\x18\\x24\\x71\\x76\\x30\\x09\\xba\\x54\\x28\\x0e\\x24\\x2e\\x4f\\x61\\xe2\\x1a\\x48\\xd9\\x25\\xdc\\x2f\\x65\\x03\\x68\\x66\\x42\\x32\\x68\\x84\\x56\\x64\\x97\\x92\\x5c\\x40\\x25\\x2f\\xed\\x55\\xc1\\x0f\\xa0\\x43\\x13\\x65\\x2c\\x9e\\xcb\\x42\\xb5\\xe6\\x9f\\xc4\\x4c\\x62\\x96\\x71\\xf6\\x92\\xb6\\x23\\x7d\\xd9\\x9a\\xdd\\xc0\\x7f\\x2a\\xd1\\x37\\xfe\\xbe\\x4e\\x53\\x2b\\xf5\\x46\\x94\\xd4\\xd4\\x9c\\xee\\x3e\\x3b\\xc1\\xdb\\x09\\x17\\xd7\\xda\\x2d\\xa4\\x9d\\xf4\\xc8\\x7e\\x3a\\x52\\xf7\\xc9\\xcb\\xac\\x0d\\x94\\x33\\x75\\x36\\x53\\xc3\\x88\\x6f\\x54\\x36\\xd7\\x75\\xc6\\x9c\\x00\\x44\\xef\\xb7\\xb1\\xfb\\xdd\\x8d\\xac\\x57\\x91\\x26\\x4c\\xe7\\x85\\x97\\x50\\x2d\\x02\\xe9\\x92\\x1e\\xe9\\xe7\\xfa\\x7c\\x19\\x38\\xff\\xf8\\x0e\\x3d\\xeb\\xbe\\xa8\\xa1\\x6b\\x5d\\x29\\xd2\\x69\\x3d\\x78\\xce\\x22\\xbe\\xc0\\x7c\\x00\\xf9\\x8a\\x9a\\x98\\x71\\x2c\\x2f\\x0e\\x67\\xed\\xfe\\xc4\\x1d\\x41\\x37\\x27\\x1a\\x21\\xb2\\x2e\\x12\\x3e\\x25\\xcb\\xc9\\x54\\xff\\x66\\xbb\\x23\\x37\\xd4\\xb7\\xca\\xcc\\xa4\\x48\\x98\\xa3\\x86\\x60\\x41\\x83\\x32\\x32\\xd9\\x36\\xac\\xb3\\xe3\\x0e\\x9a\\xbe\\xa7\\x02\\x1e\\xcf\\x04\\xc2\\x20\\x01\\x38\\x28\\x25\\xce\\xd9\\xa4\\xdb\\x95\\xc2\\x9e\\x58\\x54\\x8d\\xc1\\xca\\x91\\x3f\\x48\\x09\\x38\\x32\\xd4\\x20\\x6c\\xb4\\xb2\\xf3\\x25\\x59\\xeb\\xdc\\xb8\\x2c\\x1f\\x5d\\xa2\\x69\\xb4\\xd3\\xcb\\x96\\x68\\x1a\\x0d\\xf5\\xa8\\x2f\\x16\\xa3\\x3c\\xd3\\x28\\x57\\x44\\x89\\x1b\\x73\\x5a\\xba\\xb7\\xc8\\x6d\\xb3\\xb7\\xb0\\x76\\xbb\\xb7\\x9c\\x96\\x61\\x03\\xf6\\xb6\\x21\\xdc\\x66\\x16\\x33\\xda\\x10\\x6e\\x98\\x85\\xc1\\x3e\\x1e\\x5f\\x58\\x73\\xd9\\xe5\\xf4\\xae\\x55\\xb0\\xbd\\x1f\\xf0\\x7c\\xdc\\xcf\\x4a\\x0d\\x9b\\xcb\\x2c\\x66\\x74\\x0f\\x24\\xe9\\xb9\\xf6\\x93\\x05\\x41\\xd9\\xbe\\x51\\x62\\x6d\\xf6\\x50\\x0d\\xbb\\xe1\\x1c\\xef\\xae\\xfd\\xa4\\x5c\\xb9\\xf2\\x44\\x9d\\x65\\xac\\x59\\x9e\\x48\\x5f\\x91\\x7e\\x9e\\x3c\\x51\\x08\\x6f\\xfa\\x05\\xe4\\x89\\x91\\x58\\xa7\\x9f\\x29\\x4f\\xec\\x17\\x92\\x27\\x26\\x45\\xe1\\x1e\\x15\\x85\\xeb\\xdc\\xe4\\xe4\\x0a\\xdd\\xf4\\x3a\\x0b\\x22\\x64\\x58\\xeb\\xc2\\xae\\x76\\xa4\\xc3\\xb3\\xb0\\x99\\x62\\x2f\\x5e\\x43\\x91\\xcc\\x6c\\x21\\x0c\\x11\\x03\\xb8\\xa9\\x8e\\x8e\\x16\\x92\\xd5\\xe2\\x44\\x7a\\xec\\xa2\\xf0\\x4f\\x95\\xae\\xf5\\x84\\x74\\x2d\\x4f\\x6e\\x36\\x62\\xec\\xe3\\x8d\\xc9\\xb2\\x6e\\x40\\x46\\xa4\\x8f\\x8e\\x6a\\x4c\\xe6\\x11\\x43\\x9a\\xc1\\x64\\x59\\x37\\xab\\x7a\\x01\\x1c\\xac\\xc1\\x4f\\xc2\\xee\\x6d\\x64\\x30\\xad\\x9b\\x67\\x99\\xd6\\x1d\\x5a\\xbd\\xa3\\xa3\\x5e\\x84\\xbd\\xef\\x3d\\xa8\\xa1\\x19\\x1a\\xeb\\x35\\x47\\xf9\\x56\\x66\\xbe\\x13\\xc4\\x56\\x66\\x6d\\x78\\x88\\xd0\\x4c\\xaa\\x71\\xd4\\xd2\\x19\\xe5\\x4a\\xb3\\x60\\x61\\xfc\\xd2\\x5f\\xf4\\x4e\\x37\\x41\\x1c\\xfc\\xb3\\x77\\x6f\\x67\\x3d\\xfa\\x5a\\x65\\x53\\x28\\xd9\\x81\\x0f\\x50\\x21\\x73\\x8d\\x0f\\x9f\\x55\\x61\\x6b\\x27\\x92\\x93\\x55\\x32\\x67\\xca\\xce\\x88\\x71\\x19\\x12\\x76\\x5b\\x0c\\x92\\x9d\\xd7\\x02\\x52\\xd4\\xdc\\x2e\\x48\\x13\\x14\\x27\\x5f\\xfa\\x46\\xc2\\xa3\\xa3\\xcd\\x3d\\x2d\\x4c\\x6e\\xb8\\x85\\x09\\x09\\xb8\\xa9\\xc0\\x4d\\x64\\x2a\\xb0\\x10\\xfe\\x87\\x12\\x5e\\x69\\xa2\\xde\\x72\\xd4\\x7e\\xc6\\xfa\\x55\\xe0\\x03\\x74\\x57\\x6d\\xd5\\x0d\\x43\\x37\\x49\\x20\\xbb\\x51\\x02\\x0e\\x7c\\xfa\\x59\\xf6\\x7d\\xdc\\x6f\\xf3\\x4f\\x56\\xa1\\x9e\\x2a\\x2a\\x98\\xa1\\x82\\x90\\x5f\\x04\\xa1\\xa4\\xac\\x2a\\xe2\\xbe\\xfe\\xc5\\x54\\xa6\\x5c\\xd2\\x32\\x45\\xbe\\xcc\\x9d\\x3c\\xb1\\xa6\\xad\\xe3\\x46\\xdd\\x4e\\xf2\\x10\\xf5\\xef\\xd4\\xc0\\x41\\x32\\x13\\x05\\x45\\xea\\x8d\\x63\\xa4\\xc2\\x11\\x96\\xc6\\x70\\xc5\\xbe\\xc0\\x15\\x77\\x22\\x5c\\x71\\x27\\x0b\\x1a\\x7d\\x83\\x6e\\x7b\\x48\\x4f\\x01\\x16\\x2f\\x58\\xfc\\xa4\\xfb\\x62\\xa3\\x2d\\x39\\x28\\x4e\\xd9\\x0a\\xaa\\x31\\x89\\x87\\xb6\\x63\\xed\\xa4\\x40\\xfc\\x3b\\x16\\xab\\xce\\x2e\\x65\\x35\\xca\\x8d\\x2d\\xb8\\x82\\xc1\\x9c\\x4f\\x0d\\xd1\\xd2\\x9c\\x1e\\x1d\\xdd\\x6a\\xb8\\xf5\\x4c\\x5e\\xd2\\x18\\xf5\\xc8\\xf2\\x79\\x30\\xbc\\x17\\x18\\x0c\\xef\\x6f\\x22\\x18\\xde\\x6e\\x72\\x6f\\x68\\xfa\\x6f\\xd6\\x02\\x71\\xdd\\xea\\xf4\\xdf\\xa4\\xa7\\x3f\\x85\\xeb\\xee\\xda\\xc9\\x2c\\xe2\\x30\\x38\\x50\\xbc\\xf5\\xa4\\xac\\x13\\x6e\\x64\\xeb\\x84\\xb6\\xe4\\x80\\x19\\xed\\x13\\xe8\\x33\\x8d\\x74\\x63\\x60\\x2d\\x7d\\x0d\\x60\\x2f\\x62\\x30\\x1d\\xdd\\xfd\\x4d\\x43\\x78\\x27\\x91\\x69\\x99\\xe8\\xb5\\x18\\x68\\xc6\\x59\\xd5\\xba\\x30\\xbe\\xab\\x6b\\x81\\x66\\x03\\x06\\xfe\\x8a\\xdc\\xe0\\xa4\\x68\\x17\\xe4\\x52\\x0f\\xd1\\x3b\\xe7\\x21\\x7a\\xe7\\x04\\x9e\\x71\\x8a\\xff\\xdc\\xb0\\xfc\\x33\\x95\\x57\\x94\\x6f\\xdb\\x04\\x53\\x37\\x47\\x26\\xae\\xd9\\x49\\x43\\xbd\\xe2\\x78\\x24\\xd4\\x6c\\x30\\x37\\x76\\x4c\\x0c\\x17\\x0b\\x93\\x9a\\x4d\\xb9\\xb0\\xc2\\xd7\\xd6\\x3b\\x68\\xfa\\xd8\\xcb\\x76\\xcf\\x53\\x08\\x48\\xa6\\x45\\x83\\xa1\\xaa\\x23\\xa7\\x5c\\x47\\x57\\xae\\xc9\\xe2\\x27\\xe8\\xf8\\xda\\x19\\x99\\x47\\x7c\\x6d\\xf0\\xed\\x6e\\x83\\x04\\x0e\\x0a\\xef\\x7a\\x5b\\x41\\x62\\x8b\\xb4\\x84\\x0b\\xa1\\x9e\\xde\\x85\\x50\\x56\\x57\\x0c\\x48\\xa7\\x9e\\xea\\x42\\x28\\xa3\\x06\\xa3\\x0b\\xa1\\xde\\xfd\\x5d\\x08\\x45\\x12\\x81\\x19\\x7b\\x10\\xfa\\x37\\x27\\x88\\x20\\x53\\x9d\\x08\\x32\\xd5\\x95\\x30\\x51\\xbd\\xff\\x71\\x12\\x84\\x42\\x01\\x89\\x8c\\x9c\\x7a\\x2e\\xe8\\xc7\\xc8\\xac\\xe7\\x82\\x7e\\x8c\\xfc\\x7a\\x36\\x3e\\xc9\\x28\\xf3\\xc8\\x83\\xfb\\xf4\\x1e\\x11\\xee\\xd3\\xbb\\x1f\\xdc\\xa7\\xf7\\x27\\xc0\\x7d\\x34\\x6d\\x16\\x80\\xfb\\xfc\\x8f\\x63\\xcf\\xf3\\xd8\\x6a\\xbd\\xfc\\x8b\\x08\\x36\\x77\\x4e\\x8f\\xa4\\x98\\x0f\\x94\\x41\\x2e\\x73\\x05\\xe4\\x32\\xb7\\xf3\\x84\\x01\\x49\\x59\\x8a\\x47\\x65\\x29\\x1a\\x70\\x51\\x20\\x8c\\x7a\\xf7\\xc0\\xf9\\xe8\\xa5\\x72\\xf1\\x6d\\xa8\\xc1\\xf9\\x64\\x21\\x6f\\x82\\xa2\\xa2\\x84\\xc5\\xac\\xef\\x2d\\xf1\\x65\\x11\\x31\\xc2\\x30\\x3e\\x2e\\x22\\x31\\xc2\\x50\\x0f\\xbd\\x19\\x3a\\x56\\x50\\x41\\xba\\xdc\\x71\\x9c\\x6e\\xab\\xcd\\x18\\xa5\\x36\\x5f\\x30\\x6d\\xca\\x2c\\xb5\\x85\\xe7\\x50\\x42\\xb3\\x75\\x5b\\xa5\\x2d\\x8c\\x0e\\xe3\\xc1\\x14\\x91\\x2c\\x00\\xcb\\xec\\xdf\\xdd\\x0d\\xe8\\x25\\x3b\\xd1\\x70\\xc5\\xf2\\xd8\\x14\\x70\\x47\\xe8\\x4c\\xf6\\x60\\x83\\xd5\\x6a\\x80\\x3a\\xb2\\x42\\x85\\xf9\\x9d\\xc8\\x7c\\xae\\xdd\\x9c\\xe4\\x30\\x78\\xed\\x98\\x63\\x6c\\xab\\x78\\x8d\\x1b\\x4d\\x68\\x58\\x6c\\xfc\\xde\\xd0\\x8c\\x1b\\xdd\\x28\\xc9\\x4d\\x31\\xa8\\x03\\xb6\\x9c\\x42\\x3a\\x14\\x51\\x9b\\xf5\\x65\\xe2\\x67\\xe6\\xdc\\x24\\x0d\\xb0\\xa3\\x61\\x95\\xbb\\x85\\x00\\x09\\x33\\x93\\x61\\x35\\x1d\\x46\\xb7\\x5c\\xaa\\x1b\\x3a\\xe2\\x5b\\xbd\\x48\\x37\\x2a\\xf2\\x1e\\xe7\\xe7\\x45\\x87\\x1e\\x31\\x4b\\x7c\\x23\\xe0\\x10\\x19\\xa3\\xa0\\x0a\\xb9\\x05\\x85\\xa4\\x14\\xe8\\xd6\\x60\\x8f\\x6e\\xc9\\x79\\x0d\\x68\\x90\\x9a\\x24\\x43\\x9a\\x15\\xff\\xb4\\xd0\\x6f\\xe0\\xbb\\xe5\\x07\\xfe\\x89\\x69\\x0d\\x43\\xda\\xfd\\x5a\\xfc\\x84\\x1d\\x4c\\xcc\\xcc\\x8c\\x0d\\xfb\\xf1\\x46\\x0c\\xfb\\x7b\\x10\\xeb\\xf3\\xc6\\x09\\xa6\\x2b\\xda\\x93\\x7a\\x7e\\x2b\\x57\\x8d\\x17\\x38\\xcf\\x81\\xb3\\xef\\x38\\x7f\\x07\\x76\\x0b\\x85\\x07\\x7a\\xaf\\xa4\\x57\\xdd\\xeb\\x1d\\xb5\\x14\\xd2\\xaa\\xd8\\x06\\x1a\\x4d\\xde\\x90\\x2a\\xb3\\x46\\xc6\\xc0\\x9a\\xc0\\x6d\\xe9\\xf8\\x01\\xe0\\xd0\\x24\\x3d\\x57\\x31\\xc2\\x34\\xa2\\x7d\\x47\\xd4\\xe4\\x0b\\x6f\\x7d\\xed\\x20\\x66\\xdd\\x25\\xd2\\xe0\\x42\\x68\\xd9\\xb2\\xe8\\xc1\\xe3\\xe8\\xed\\xd6\\xe2\\xbb\\x9f\\xe6\\x22\\xfc\\xc4\\x36\\xe4\\x56\\xc9\\x00\\x9e\\x97\\x88\\x73\\xdd\\x50\\x28\\x49\\x11\\x88\\xec\\x84\\x9d\\x8d\\x86\\x52\\x32\\x71\\xc0\\x32\\xa2\\xa5\\x59\\x1b\\xe5\\xb9\\x94\\x0c\\x2f\\x36\\x74\\xf4\\x23\\x08\\xc5\\x02\\x2c\\x46\\x43\\x8f\\x16\\x2a\\xd5\\x65\\xa5\\xba\\x58\\x0a\\xdd\\xec\\x15\\x2b\\xd5\\x61\\xa5\\x3a\\x58\\x0a\\xee\\x7c\\xa4\\x85\\x8b\\x15\\xec\\x51\\xad\\x2d\\xe6\\x84\\x65\\xe6\\xa2\\xb5\\x5b\\xa3\\x47\\x9b\\xc6\\xa5\\x56\\xac\\x8a\\x01\\x6b\\x7b\\xc0\\xc4\\xdd\\xb0\\x5c\\xe3\\x62\\x7e\\x46\\xb1\\x7e\\x9a\\x9c\\xf1\\x69\\xfb\\xfd\\x9d\\xe4\\x7c\\xaf\\x58\\x17\\x80\\x6b\\x21\\x82\\x4a\\x18\\xd2\\x4a\\x80\\xb5\\x91\\x89\\x0f\\xb8\\xd7\\x61\\x80\\x7d\\x18\\x54\\x41\\xe0\\xef\\x3a\\xd6\\xa5\\x68\\x68\\x0e\\x41\\x90\\xd0\\x8b\\x67\\x9d\\x24\\x20\\x24\\xfd\\x72\\x42\\x07\\xd1\\x23\\x6b\\x8c\\x12\\xb0\\x35\\xea\\x20\\xfa\\x34\\x43\\x8a\\x02\\x59\\x53\\xc3\\x58\\x19\\x67\\xcb\\x91\\xb1\\x9e\\xe4\\xf1\\x0c\\x91\\xb1\\xe3\\x08\\x03\\x1b\\x22\\x06\\x76\\xc8\\xe5\\x7f\\x37\\x2d\\x44\\xd9\\x56\\x5f\\x3c\\xd9\\x3c\\xf5\\x52\\x3e\\xd2\\xc8\\xe6\\x89\\x95\\x4e\\xad\\x54\\x5f\\xd8\\x9a\\xcc\\xd7\\x0d\\x86\\xd7\\xdd\\x5c\\xa3\\x06\\x44\\x07\\xd6\\x4d\\x76\\x69\\x12\\x75\\x69\\x1a\\x87\\x33\\x44\\x7c\\xed\\x96\\xe2\\x6b\\x87\\x6a\\xe4\\x6c\\x67\\xa8\\x86\\xce\\x8e\\x1e\\x95\\x7c\\xad\\x2b\\xe5\\xb1\\x52\\xad\\xd5\\x9f\\x28\\x29\\x44\\xa9\\xa6\\x9c\\x78\\x5f\\xbf\\xbe\\x6e\\x5c\\x55\\xea\\xa4\\x2e\\x0f\\x82\\xb7\\x3f\\x52\\xdb\\x8f\\x1e\\x47\\x6a\\xfb\\xca\\x23\\xad\\x5f\\x49\\x21\\x4a\\x35\\x95\\xc4\\x7b\\xa9\\x7d\\x2e\\x46\\x5d\\x1b\\x15\\x2d\\xca\\xca\\x85\\x8b\\x73\\x10\\x91\\x97\\xf1\\x3c\\xc3\\x30\\x4e\\x9d\\xdb\\x7b\\xe8\\x5b\\xd2\\x95\\x53\\x38\\x72\\x42\\xc1\\x72\\x2e\\x25\\x75\\xa9\\x19\\xe6\\xad\\xa2\\x70\\xc9\\xc1\\x17\\x33\\xd4\\x10\\xb9\\xbd\\x4f\\x18\\x04\\xb2\\x36\\x23\\x03\\x17\\xd5\\x18\\x4f\\x92\\x82\\xe5\\x4d\\xc3\\x79\\x24\\xc7\\x41\\x95\\xf5\\x80\\x5a\\x40\\x9f\\xe5\\xeb\\x1a\\x98\\xcb\\x4e\\xaa\\x35\\xc0\\xf8\\x5b\\x6c\\xc6\\x13\\x9a\\x86\\x5b\\x45\\xd3\\xa0\\x29\\x61\\xd0\\x33\\x6c\\x92\\x3a\\x85\\xad\\x0c\\x07\\xe6\\xe5\\x4b\\x64\\xd6\\x2a\\x2d\\x67\\x23\\xcb\\x58\\xb7\\x0d\\x9c\\x4b\\x49\\xe0\\x6f\\x6f\\x53\\x1a\\x9a\\x34\\xec\\x3a\\x07\\x91\\xbb\\xd3\\xd3\\x47\\x63\\x41\\x5d\\xa7\\x70\\xba\\x24\\x8d\\xd0\\x55\\x86\\xbb\\x91\\x44\\xdd\\x32\\xb6\\x4f\\x12\\xe8\\x47\\xda\\xcb\\x8f\\xee\\xc7\\x45\\xf8\\xaf\\x60\\x16\\x5a\\x23\\x2b\\x42\\x64\\xd5\\x08\\xcb\\x6c\\xc7\\x84\\x5c\\x1a\\xcb\\x95\\x5d\\x5b\\x04\\xea\\x1a\\x59\\xbc\\xae\\xca\\x08\\x85\\xea\\x71\\x85\\x7a\\xa5\\x83\\x4e\\xe5\\x50\\x2a\\x5b\\x43\\x6b\\x4c\\x5f\\xda\\x15\\xdd\\x11\\xfa\\xa4\\xfa\\xfc\\x45\\xec\\x31\\x27\\xcc\\x42\\x12\\x2f\\xd1\\x0f\\x46\\x01\\x34\\xf1\\xe2\\x81\\xd0\\xc4\\x79\\x70\\xe2\\x42\\xfd\\xa9\\xa7\\xfa\\x73\\x5f\\x48\\x71\\x3e\\xa6\\x18\\xe1\\x00\\x7f\\x00\\xac\\x18\\x86\\xbd\\x78\\x5c\\x68\\x71\\x2e\\xb6\\x58\\xee\\xc2\\xa3\\xe1\\x8b\\x69\\xc0\\x0e\\xc5\\xaf\\x94\\x76\\xb3\\xcf\\x85\\xfe\\xc1\\xc8\\xd6\\xc5\\x3b\\xc3\\x9a\\xec\\x81\\x9a\\xb5\\x19\\xef\\xe7\\xd1\\xfb\\xc5\\x8f\\x78\\xbf\\x24\\xd4\\x74\\x45\\x4a\\x05\\xd0\\xa5\\x0f\\xb0\\x39\\xd5\\x03\\x59\\x9b\\xfd\\x1f\\x3a\\x2c\\x6c\\xb2\\x83\\xa9\\x73\\x8d\\x39\\xaf\\x60\\x0f\\x30\\x35\\x78\\xd8\\x34\\xf0\\x9f\\x4a\\x74\\x00\\x7d\\x5f\\xa7\\xa9\\x95\\x7a\\x23\\x4a\\x6a\\x1a\\xcf\\xaf\\xf6\\xb7\\x9d\\x7c\\x0a\\xae\\x35\\x71\\x04\\x12\\x34\\x0a\\xc4\\x75\\xb1\\x92\\x19\\x5d\\x85\\x16\\xc8\\x82\\xae\\xe6\\xf2\\xbb\\x3d\\xa6\\xd0\\xeb\\xb3\\x3f\\x83\\x1c\\xe0\\xea\\x50\\xc3\\xd9\\x8e\\x34\\x69\\x63\\x23\\x6e\\x55\\xcf\\x24\\x20\\x6e\\x35\\x74\\xae\\xae\\xc9\\x94\\x82\\x57\\x6f\\x50\\xd5\\xc8\\xdd\\x5b\\x18\\x78\\xec\\xc5\\x9f\\x8d\\x56\\xe5\\xee\\x36\\x74\\x4c\\x3b\\x22\\x01\\x62\\xa6\\x5d\\xf5\\xd0\\xe4\\xa8\\x3b\\x3a\\x3e\\x2b\\x4a\\x06\\x02\\x32\\x49\\x31\\x1c\\xf0\\x1f\\x95\\x1a\\xbc\\x77\\xd3\\xe7\\x3f\\x87\\x32\\xa9\\xde\\x76\\x64\\x2e\\xea\\xfe\\x4d\\x32\\x63\\xa5\\x92\\xf6\\xce\\xd9\\xc9\\x82\\x87\\xc5\\xa3\\x2b\\xd1\\x8c\\xf1\\x39\\xb2\\x95\\x68\\xc6\\xf0\\x1c\\xd9\\x21\\x11\\x8d\\xc8\\xd8\\x6c\\xf4\\xae\\x51\\xe9\\x36\\x75\\xdb\\xf7\\xd2\\x80\\x19\\xa1\\xbb\\x66\\x44\\xed\\xfe\\x60\\xda\\x4c\\x0c\\xae\\x51\\x0b\\x99\\x0d\\xdd\\x35\\xa2\\x4d\\xff\\x77\\x43\\x77\\x91\\x17\\xb8\\x6c\\x9b\\x0b\\x1a\\x1d\\x2a\\x98\\x71\\xbb\\x46\\xed\\xb1\\x64\\x5a\\xbe\\xb7\\x83\\x8b\\xff\\x65\\x51\\x44\\x32\\x95\\x75\\x49\\xbd\\xa0\\x47\\xf5\\x82\\xf7\\x0f\\x70\\xa9\\x9c\\x9f\\x09\\xdc\\xad\\x67\\x92\\x59\\xf9\\x56\\x4c\\xcd\\x79\\x09\\x99\\xd5\\xd0\\xfe\\x7a\\x1b\\x29\\xd1\\x6e\\x25\\xf0\\xed\\x0d\\xa2\\xb2\\x62\\xf0\\xed\\x4c\\x7a\\xec\\x99\\xa4\\x5b\\xa7\\x14\\xca\\xaa\\x91\\x51\\xf1\\x48\\x76\\x06\\xd9\\xd7\\x84\\xac\\x11\\xa1\\x7a\\x6e\\x94\\x7d\\x85\\x34\\x03\\x22\\x05\\x7d\\x0d\\xfe\\x76\\x6d\\x80\\xdb\\x6e\\xa3\\x70\\x78\\xf0\\x91\\x92\\x70\\xdb\\x65\\xec\\x0d\\x68\\x58\\x30\\x36\\xc5\\x8a\\x51\\x72\\x17\\xcd\\x95\\x88\\x4d\\x71\\x81\\x8e\\x21\\x97\\xf6\\xea\\xea\\xe2\\xda\\x59\\xc2\\x3f\\xa9\\xd8\\x14\\x98\\x18\\xc7\\xa6\\xc0\\xa7\\x1d\\x8d\\x29\\x31\\x44\\xf1\\x95\\x80\\xfa\\x0e\\x1f\\x10\\xea\\xeb\\x93\\xb5\\x4d\\xfc\\xe6\\xfa\\x1b\\x02\\x4a\\x70\\xe9\\x41\\x41\\xb9\\x93\\x1a\\x8c\\x73\\x78\\x6d\\x93\\x6c\\x2b\\xdd\\x42\\xf2\\x26\\x51\\xa9\\x2c\\x5a\\x7a\\xe5\\x5c\\x2a\\xa2\\xa5\\x97\\xc5\\xb1\\xbc\\x39\\x59\\xb7\\xc5\\xb3\\x4a\\xa0\\xdc\\x9c\\x9c\\x4a\\x18\\x80\\x9c\\xbc\\x6a\\x48\\x86\\xa9\\x14\\x05\\xe0\\x0c\\xc6\\x9d\\x17\\x05\\x60\\x18\\x47\\x01\\x18\\x69\\xa2\\x00\\x8c\\x92\\x51\\x00\\xf2\\xb6\\x99\\x6c\\xfa\\xb9\\x7f\\x14\\x80\\x91\\x14\\x05\\xe0\\x32\\x47\\xae\\x37\\x8a\\xe5\\x7a\\x71\\x31\\xf4\\xc0\\xfb\\xea\\x9e\\xb8\\xe5\\x33\\x81\\x5b\\x5e\\xa0\\x87\\xcc\\x68\\x0e\\xc5\\xd8\\xcf\\x13\\x8e\\xde\\x47\\xb1\\xcb\\xcb\\x91\\xce\\xd1\\xfb\\x5a\\x76\\xf4\\x7e\\x99\\xe7\\xe8\\x7d\\x40\\x3d\\xa4\\x6a\\xda\\x64\\x28\\x8c\\xe4\\x29\\xa3\\xb3\\xf1\\x1c\\x17\\x71\\xad\\x3e\\x94\\x5d\\xab\\x0b\\x37\\xea\\xaf\\x9d\\x57\\xd9\\x78\\xec\\x8c\\x43\\x26\\x81\\xc7\\x7e\\xad\\x01\\x63\\xb3\\xfb\\xe0\\xde\\xbe\\x9d\\xcf\\x28\\x80\\x79\\xa8\\x20\\x68\\xcf\\x11\\x41\\xfb\\xea\\x01\\x9d\\x3b\\x9b\\xeb\\x4a\\x8f\\x07\\xa1\\xb9\\xb3\\x6f\\xf0\\xf4\\x7c\\x8e\\x88\\x60\\x75\\x3c\\x67\\xe9\\xf1\\x6c\\x33\\xfb\\xd0\\xb3\\x53\\x1e\\x90\\x33\\x5c\\x05\\x7b\\x79\\xae\\x82\\x27\\xe8\\x2a\\x58\\xf3\\x95\\xbf\\xc1\\x4f\\x70\\xae\\x97\\x60\\x4f\\xf1\\x12\\xec\\x1b\\xbc\\x04\\xc7\\x3e\\x82\\x7b\\x8a\\x8f\\xe0\\x88\\xb0\\x82\\x3b\\xd0\\x62\\x0f\\x8e\\xe3\\x30\\x6f\\xc0\\x3d\\xe1\\xda\\x0f\\x52\\x98\\x0b\\x60\\x3f\\x76\\x01\\x4c\\x1b\\x42\\xe7\\xc3\\xcc\\x99\\x8b\\xde\\x05\\xb0\\x4f\\x81\\xa7\\xbd\\xd8\\x05\\xf0\\x38\\xe5\\x02\\x98\\x50\\x81\\x9a\\xd4\\x25\\x2a\\x84\\x6c\\x32\\x3f\\xc0\\x09\\x0c\\xae\\x1f\\xf9\\xd1\\xb5\\x9b\\x03\\xb3\\x17\\x5d\\xe9\\x48\\xf1\\x84\\x17\\xdd\\x91\\xde\\x8b\\xee\\xe9\\x03\\x7b\\xd1\\x0d\\x85\\x17\\xdd\\x09\\xf5\\xa2\\x3b\\xd0\\x7b\\xd1\\xcd\\x58\\x71\\x49\\x2f\\xba\\x9b\\xaa\\x14\\x7f\\x14\\x31\\xe2\\x5a\\xaf\\xba\\xfd\\x6f\\x73\\xe2\\x5d\\xf4\\x5c\\xe2\\x74\\xcf\\xdd\\x9d\\x89\\x5a\\x3b\\x90\\x1b\\xa8\\x93\\xcb\\x24\\x05\\xc4\\x26\\x47\\x16\\x27\\x88\\xec\\x4c\\x8a\\x8d\\xa0\\xef\\xfd\\x89\\xc2\\x8d\\xe2\\x09\\x7c\\x89\\x42\\x86\\xf4\\x4e\\xf7\\x8d\\xf3\\x74\\xa1\\x11\\x00\\x03\\x8f\\x6b\\xf0\\xe2\\x14\\x8f\\xaf\\x46\\xb9\\x05\\x79\\xbc\\x0f\\xd0\\x75\\x5f\\x76\\x62\\xbe\\xf9\\x46\\x67\\xc9\\x9a\\x31\\xe4\\x39\\x4b\\x5e\\xea\\x9d\\x25\\xfb\\xaa\\xab\\xe2\\x5b\\xa3\\x64\\x32\\xed\\xa9\\xd8\\x97\\xbc\\xf3\\x7a\\x77\\x77\\x7a\\x2e\\xea\\x1b\\x3d\\xf5\\x1a\\xbc\\xf2\\x0e\\x75\\xc6\\x12\\xa3\\x84\\x57\\xde\\x7f\\xa4\\x8c\\x25\\xfe\\x51\\xdb\\x49\\xd8\\x9c\\x84\\x14\\x32\\x0a\\x19\\xcc\\x9d\\xf3\\x52\\x0b\\x09\\xc9\\x35\\x6f\\x5d\\xb8\\xe6\\xfd\\xba\\x23\\x2b\\x96\\x69\\xcd\\xfe\\x6c\\xee\\xe7\\x55\\x77\\x4b\\xcd\\x29\\xf6\\xf0\\x9c\\x3b\\x4f\\x79\\xce\\x1d\\x3e\\x80\\x39\\xc4\\x43\\xfb\\xd5\\xe5\\x9a\\x75\\x9d\\x30\\x75\\x23\\x09\\x53\\xef\\xe5\\x14\\x56\\xb5\\x88\\xf0\\x35\\x16\\x11\\x7e\\x96\\x45\\xc4\\x50\\x6f\\x11\\x71\\x0f\\xdf\\xaf\\x43\\xd5\\x22\\x22\\xa3\\x06\\xa3\\x45\\xc4\\xf0\\xbe\\x16\\x11\\x71\\x04\\x67\\x67\\x03\\x0f\\x48\\x8c\\x3a\\x1d\\xf8\\x11\\x79\\x95\\xf5\\x23\\x47\\xb2\\x7e\\xe4\\x48\\xd6\\x4f\\x3b\\x92\\x1d\\x40\\xa2\\x30\\x95\\x18\\xc2\\xef\\x5c\\x29\\xaf\\x8f\\x6d\\xdf\\x57\\xca\\x6b\\x14\\x52\\x66\\x4b\\x79\\x8d\\xe2\\xda\\x7c\\x47\\xae\\xf7\\xb7\\x93\\xc8\\x74\\xd5\\x90\\x89\\xf0\\x36\\x4a\\x01\\x8b\\x38\\x81\\x35\\x5a\\xe3\\x67\\x1b\\x59\\x18\\x1d\\xe5\\xe6\\x19\\x59\\x0c\\x1f\\xd1\\xc8\\x62\\x78\\x3f\\x23\\x8b\\xe1\\x9f\\x60\\x64\\xa1\\x69\\xb3\\x80\\x91\\x85\\x4e\\x0c\\x6e\\x96\\xa4\\xd2\\x57\\x64\\x94\\x27\\x49\\xe5\\x19\\x20\\x63\\xbe\\x24\\x55\\xe4\\x21\\xa3\\x4c\\x49\\xea\\xa8\\x90\\x24\\x35\\xa9\\x74\\xf0\\xa8\\xd2\\x21\\xc3\\xa7\\xea\\x98\\x52\\xac\\xfc\\x67\\x01\\x13\\x8e\\x6d\\x7a\\xba\\xb6\\x8e\\x4b\\x84\\x74\\x74\\xab\\x98\\xf6\\x6d\\x15\\xa3\\x8d\\xed\\x1e\\x16\\x16\\x06\\x4b\\x91\\x4c\\x4f\\xaa\\x7b\\x7a\\x86\\x35\\x38\\x6b\\x15\\x9e\\x61\\xfd\\xa4\\x63\\xd8\\x2c\\x1b\\x0e\\xdf\\xe4\\x3d\\x15\\x8f\\x5a\\x49\\x30\\x1d\\xf6\\x46\\xbe\\xce\\x15\\x04\\x0b\\xd2\\x95\\x21\\xbf\\xb6\\x92\\x55\\xc8\\xd1\\x65\\xab\\x86\\x91\\xe3\\xa5\\xa6\\xf1\\x3c\\x6e\\xde\\x4d\\xca\\x89\\x45\\xbd\\x50\\x89\\x8b\\x1a\\xb5\\xfc\\x78\\xe7\\x92\\xb6\\x83\\x17\\x4c\\x30\\xf9\\xde\\x07\\x16\\x21\\x9c\\x07\\xad\\xd2\\xb1\\xef\\xd6\\x8e\\x7d\\xf8\\x10\\xed\\xef\\x8e\\xff\\x76\\xfc\\xf7\\x12\\xef\\xd6\\x7f\\x7d\\xdf\\x7b\\x76\\x40\\x61\\x16\\x4e\\x89\\x2d\\xd9\\x83\\xbf\\xfc\\x57\\xb9\\x5d\\xfe\\xaf\\xd2\\xc9\\x7f\\x95\\xb9\\xc0\\xb6\\x5c\\xfa\\xfe\\x69\\xef\\xd9\\xc9\\xf7\\x0b\\x3c\\x61\\xe0\\xcf\\x0c\\xfe\\x6f\\x9f\\x60\\xf5\\x8d\\xef\\x9f\\xc2\\x2f\\x7c\\x2a\\x95\\xb9\\x49\\x60\\x92\\xd3\\xc4\\x6c\\x36\\xd6\\x80\\x19\\x9f\\xd2\\xb2\\xac\\x3c\\xed\\x57\\x81\\x0a\\x68\\x3e\\x6d\\x0d\\xc8\\x9a\\xe7\\x97\\xc7\\x5c\\xda\\xe2\\xa3\\x70\\x5d\\xa0\\x79\\xc8\\xa5\\x96\\x7e\\xca\\xa6\\xa1\\xb4\\x53\\x95\\x19\\x9c\\x1c\\x30\\x61\\x6e\\xff\\x43\\x02\\xdd\\x4e\\xe2\\x5b\\x5a\\x6f\\xe8\\x33\\x71\\xda\\x15\\x9f\\xf9\\xd8\\xf5\\xf9\\x11\\x15\\xe6\\x9a\\xef\\x84\\x8c\\x14\\x9c\\x3a\\x61\\x4a\\xd8\\xcd\\xfa\\xa6\\x58\\xec\\xdc\\x38\\xd6\\x74\\x0f\\xc9\\x76\\x54\\x83\\x2c\\xc5\\x9e\\xaa\\x76\\x3a\\xd3\\x1c\\x81\\xa6\\x1f\\x4b\\x48\\x7d\\xd5\\x4e\\x27\\x61\\xd3\\xa2\\x70\\xb8\\x66\\x38\\x1f\\x5a\\x48\\xa7\\x4d\\x59\\xb4\\x42\\x69\\x51\\x1b\\x6a\\x5d\\xe6\\x31\\x38\\xb2\\x3f\\xf3\\x47\\x59\\x01\\x05\\x0d\\x82\\xf0\\xca\\x7c\\x3b\\xf6\\xc2\\x51\\xd4\\xd0\\xac\\x44\\x5e\\x40\\x67\\x8a\\x78\\x24\\x64\\xb1\\xba\\xcd\\x35\\x2b\\x45\\xdb\\x18\\xba\\xb0\\xfa\\xec\\x98\\x06\\x1c\\xe5\\x49\\x1b\\x48\\xfa\\x7b\\x09\\x0d\\x53\\xc2\\x2c\\xf8\\xdd\\x98\\xaf\\xc7\\x18\\x55\\xc7\\x19\\x8d\\x30\\x03\\x23\\xa7\\x16\\x5a\\x2e\\xe4\\x32\\x5a\\x68\\x97\\x28\\xc0\\x20\\x5d\\x98\\xc4\\x23\\xe0\\xcc\\xd8\\x67\\xb3\\x9b\\x18\\x26\\x6b\\xd4\\x82\\x6d\\xb4\\xb7\\x10\\xc0\\x6e\\x58\\x06\\x29\\x8b\\x8f\\x44\\xfa\\xcc\\x1c\\x19\\x94\\xcb\\x04\\xf0\\x6e\\xc8\\x6b\\xb5\\xbe\\x43\\x67\\x16\\x8a\\xec\\xe0\\x6b\\x14\\xcd\\xd7\\x2f\\x24\\x7a\\xd8\\xe5\\x02\\xe0\\x60\\xcd\\x89\\x89\\x12\\x22\\x12\\xe6\\x60\\x7a\\x28\\x8e\\xef\\x68\\xba\\xee\\x31\\x4f\\xdf\\xdc\\x7d\\xbc\\x2f\\x67\\xb1\\x20\\x89\\x19\\x30\\x71\\x59\\x52\\xce\\x14\\x43\\xb9\\x24\\x64\\x76\\x16\\x9d\\x09\\xc9\\xdd\\x55\\xc4\\x9b\\x64\\xf7\\x5e\\xde\\x24\\x45\\x29\\xa9\\x71\\xc5\\xcd\\xa7\\x4d\\xb8\\x77\\xa5\\x05\\x8a\\x95\\x67\\x89\\x33\\x97\\x5f\\xeb\\xc4\\x4f\\x9e\\xb0\\x89\\xca\\x9a\\x8b\\xd9\\x16\\xbf\\xa5\\x07\\x57\\xeb\\x24\\x44\\x21\\x22\\xa3\\xd4\\xc6\\xd3\\x25\\xd0\\xc5\\x3f\\x42\\x9e\\xf7\\x54\\xaa\\x07\\x93\\x50\\x3b\\x71\\x3c\\x7b\\xd1\\x9b\\x85\\xeb\\x03\\x1a\\xa3\\x01\\x88\\x6a\\x9f\\x72\\xe4\\x6d\\xfb\\xab\\xe7\\xc8\\x22\\xf8\\xd3\\xe9\\x74\\x16\\x6e\\xb0\\x30\\xd3\\x1e\\xfb\\xf6\\x6e\\xc1\\x64\\xc0\\x5e\\x19\\x45\\x9c\\x4d\\x11\\xb6\\x6f\\xe9\\x20\\x64\\xaa\\x46\\xd6\\x38\\x84\\xc9\\xc9\\xea\\xe8\\x68\\xf9\\xfd\\x82\\xcb\\x11\\x9b\\xf6\\xfa\\x6a\\x79\\xed\\x2c\\xe0\\x1f\\xb2\\x2a\\xe3\\xdf\\x72\\xf9\\x9a\\x96\\x44\\x89\\x33\\xe2\\x2f\\x97\\x0e\\x86\\xdb\\x39\\x99\\x40\\xa9\\x93\\x7a\\x13\\x19\\x96\\xab\\x6b\\xb2\\xac\\x54\\xa2\\xea\\x37\\x4e\\xad\\xb9\\x89\\x2b\\xdc\\x94\\xcb\\xf6\\xe2\\x6a\\x73\\x7d\\x62\\xad\\xaf\\x36\\xff\\xb9\\xa4\\xee\\x21\\x31\\x5c\\x0d\\x7d\\x70\\xf0\\x0d\\x54\\xe7\\xac\\xe1\\xb3\\xb7\\x97\\x7e\\x60\\x10\\xd0\\x23\\x00\\x72\\x27\\x1a\\xd8\\x62\\x8b\\xb7\\x30\\x80\\x53\\x68\\x69\\x79\\x72\\xdb\\xbc\\x85\\x26\\xb6\\x57\\xb7\\xd7\\xce\\x29\\x39\\x2d\\x3b\\x6b\\xf8\\xd5\\x9c\\xdd\\xc3\\xf9\\xf1\\xf6\\xca\\x83\\x2e\\xd1\\x4b\\xc5\\x7a\\x51\\x3e\\xae\\x3d\\x91\\x50\\x78\\xde\\xd3\\xa5\\xcd\\x5d\\xa6\\x90\\x41\\xeb\\x26\\xe7\\x7a\\xb2\\xda\\xe2\\xb2\\xad\\xac\\xec\\xc4\\x2d\\xd5\\xc8\\x2e\\x5c\\x53\\x32\\x93\\xc0\\x61\\x0f\\x3e\\x67\\x19\\xa2\\x6e\\xf9\\x41\\x7f\\x64\\x89\\x49\\x86\\xce\\xed\\x80\\x70\\x08\\xe8\\xf2\\x3b\\x23\\xe7\\xce\\x0b\\x72\\x01\\xff\\x5f\\xc2\\xfc\\x64\\x4d\\x04\\x5b\\xae\\x6e\\xce\\x62\\xcd\\x59\\xa1\\xe5\\xbe\\xa0\\x4a\\xcf\\x9c\\x0b\\xd2\\xfe\\x9e\\x5f\\xcd\\x7c\\xfc\\xe5\\xb3\\xb2\\x0b\\x5f\\xfb\\xc2\\x39\\x83\\xfe\\x9c\\x97\\x9d\\x63\\xa0\\x4f\\x2f\\xca\\x40\\x74\\x5f\\x9c\\x5c\\x42\\xfa\\xa5\\x73\\x61\\xa7\\x55\\x95\\xa5\\xf2\\x39\\x9f\\xea\\x3d\\x26\\xfa\\x32\\x39\\xd1\\xe9\\xb9\\x3b\\x2f\\xd7\\x5f\\xec\\x76\\x11\\x3a\\xd3\\xc9\\x8c\\x8e\\x5e\\x03\\xce\\x88\\x5a\\x21\\x06\\xd0\\x69\\xd2\\xd1\\x03\\x26\\xd1\\x94\\x97\\x4a\\x49\\xb5\\x72\\xc9\\x1e\\xca\\x1f\\xfb\\xce\\xf1\\xdf\\xc9\\x00\\x7f\\x0d\\xf1\\x9f\\x11\\x3d\\x67\\x55\\xb1\\xa3\\xa2\\x1b\\x48\\x49\\xc0\\x4b\\x89\\xeb\\x37\\x91\\x42\\x51\\x92\\xb2\\xe0\\x52\\xe7\\x91\\x73\\xfc\\xe8\\x50\\x40\\x23\\xd6\\x2b\\x5b\\x48\\x64\\xc4\\x7a\\xa1\\x94\\x70\\x5f\\xa0\\x97\\x8b\\x4c\\xe6\\xde\\x58\\xc5\\x98\\x3f\\xdd\\x1b\\xed\\x35\\x65\\xa2\\xde\\xbd\\x71\\x8e\\x52\\xf4\\xb2\\xbd\\x21\\x7e\\x33\\xb7\\xdd\\x0f\\xcf\\x96\\xb0\\x54\\x27\\x1f\\x60\\x63\\xee\\x8d\\xf5\\xcb\\x96\\x8d\\xe8\\xa0\\x7e\\x66\\xd9\\x08\\x7d\\x45\\xfc\\x3c\\xd9\\x88\\x60\\x3c\\xfc\\x02\\xb2\\x11\\x91\\x87\\xf8\\x99\\xb2\\x11\\xbf\\x90\\x6c\\x24\\x89\\x99\\x83\\x73\\xbf\\xfb\\x2d\\x28\\x33\\x64\\xb1\\x8b\\x98\\x42\\xde\\xc4\\x60\\xbf\\x08\\x43\\xb6\\x94\\xfc\\x39\\xde\\xe8\\x79\\xb5\\x1b\\xa7\\x5b\\xe9\\x30\\x5e\\xad\\xc3\\xa7\\x6c\\xe6\\xf4\\xe0\\x37\\xc6\\x43\\xe9\\x88\\x89\\x59\\xe5\\xb2\\x6f\\xab\\x0c\\x87\\x85\\xc0\\xe8\\xcc\\xef\\xee\\x7c\\xb2\\x70\\x16\\x77\\x77\\x6d\\x8e\\x57\\x5b\\x19\\x31\\x4d\\x72\\x50\\x76\\xca\\xec\\x6d\\xe0\\xaa\\xde\\x1f\\xc5\\xc4\\x5d\\xfb\\xa1\\x77\\xbc\\x84\\xa5\\xdc\\xad\\x94\\x84\\x8c\\xe0\\x69\\x04\\xb0\\x62\\x70\\xa6\\xdb\\x82\\x91\\x38\\x72\\xf2\\xcd\\x7d\\xaa\\x0c\\xe1\\xb8\\xa3\\x75\\xce\\xb5\\xd2\\x89\\xd9\\xcb\\x8e\\x74\\x9f\\xa4\\x9c\\xfe\\xcd\\x04\\x80\\x6f\\xad\\xe0\\x1b\\x94\\xc6\\x9a\\x67\\x91\\xdf\\xbe\\x6d\\xbe\\x2d\\x5d\\xd0\\xee\\x06\\x39\\x4e\\xfb\\xd6\\x8a\\x29\\x5d\\xba\\x80\\xc1\\x92\\xee\\x26\\x69\\x1b\\x31\\x3b\\xa9\\xb5\\x66\\x18\\xcf\\xe5\\x34\\x6d\\x4f\\x17\\xc6\\xf6\\x74\\xba\\x06\\x98\\x39\\x1d\\xda\\x06\\xde\\xab\\x20\\x9d\\xb4\\xf3\\xc4\\xa4\\x3d\\x4e\\x00\\x94\\xf3\\x7b\\x07\\x40\\x51\\x39\\x78\\x6d\\x13\\x2c\\x0b\\xa5\\xb6\\xef\\xee\\xfa\\xbb\\xcc\\xd8\\x29\\xe7\\x29\\xf6\\xe6\\x3c\\xdf\\x1f\\x04\\xb0\\xad\\x9c\\x99\\xba\\xbb\\x2b\\x09\\xbb\\xa0\\x6f\\x0f\\x73\\x52\\x80\\x8d\\x1a\\xec\\xc3\\x3d\\x89\\xcc\\x30\\xa4\\xa4\\x0d\\xd0\\x92\\x50\\x87\\x1c\\xf7\\x8f\\x9b\\xa2\\x1d\\x07\\x66\\xf9\\xc4\\x72\\xdc\\xdd\\x55\\x5f\\xec\\x44\\x48\\x9d\\x73\\x79\\xf1\\xe0\\x82\\xa4\\x40\\x23\\xa0\\x60\\x32\\xd6\\x0f\\xfe\\x6e\\x5d\\xb9\\xd7\\x8d\\xab\\x6b\\x6d\\xc0\\x9c\\xa9\\xbc\\x4d\\xa5\\x13\\x85\\x57\\xcb\\x65\\x29\\x2a\\x22\\x49\\xd0\\x44\\xcf\\x10\\x37\\x57\\xc5\\x9c\\x34\\x6a\\x36\\x54\\x3c\\x0d\\xe9\\x11\\x33\\xb5\\xab\\x1c\\x26\\x80\\xf6\\xe7\\x9b\\x04\\x16\\xc0\\x68\\xa7\\x34\\xb7\\x86\\xdc\\xc8\\x13\\xbe\\xcc\\xb6\\x56\\xb4\\xd8\\xc2\\x1a\\x49\\xc5\\xea\\x96\\x46\\x32\\x6e\\xa9\\x9e\\x2d\\x9d\\x5a\\xab\\xad\\x44\\x79\\x82\\x84\\x5a\\x43\\x49\\x6a\\x28\\x25\\xa8\\xe9\\xd5\\x74\\x3a\\xda\\xd2\\x2b\\x89\\x5c\\x79\\x91\\x9d\\xf5\\x4e\\x5a\\xfb\\xe6\\xaf\\x23\\xc5\\xfa\\x31\\x2e\\x21\\xcc\\x8a\\x87\\xe6\\xfc\\x31\\xa6\\xbd\\x9d\\x31\\x7f\\x3e\\x9d\\xf6\\xf6\\xbe\\xd3\\xde\\xce\\x9d\\xf6\\xf6\\x63\\x4e\\x3b\\xc7\\x2b\\x6b\\xf7\\x84\\x7c\\xad\\xa7\\xf7\\xc4\\x95\\x40\\x57\\x5f\\x33\\x53\\xe6\\x82\\x3b\\x42\\x71\\xde\\x09\\x9f\\x86\\x7f\\x07\\x06\\xfc\\x78\\xf8\\xe5\\x7f\\x9f\\xd5\\xaf\\x33\\x53\\x8c\\xd6\\x17\\xfe\\x9b\\x5a\\x5f\\xf7\\x1a\\x44\\xf1\\xc5\\x74\\x9f\\xb5\\x84\\x34\\x9c\\x2f\\xc2\\x6a\\x2c\\x9c\\x76\\xec\\x86\\x67\\x29\\x63\\x80\\xb0\\xcb\\xf9\\xee\\x4e\\x39\\xad\\x42\\x5d\\x9d\\xe6\\x59\\x29\\x76\\x69\\x70\\x8d\\x1e\\x0d\\xae\\xd1\\x77\\xea\\xd5\\x17\\x14\\xe8\\xa3\\x65\\x7d\\x87\\x46\\xd3\\xc3\\x91\\xd1\\xf4\\x70\\xec\\x68\\x71\\xbd\\xfd\\x39\\x4c\\x03\\x0c\\x9f\\x3a\\x1e\\x3a\\x3a\\xe2\\xb1\\xfe\\xd9\\xb3\\xd1\\x92\\x11\\x37\\xff\\x4e\\x78\\x4c\\x2d\\x31\\x8b\\x48\\xa0\\x81\\xa8\\xfb\\x9f\\x84\\xdb\\x54\\xbd\\x9d\\x62\\xb6\\x55\\xa2\\x04\\x06\\x6a\\x06\\x0c\\xec\\x49\\xd1\\xae\\xe8\\xf1\\x98\\x3e\\x31\\xc3\\x28\\xeb\\xaa\\xfe\\x1d\\x39\\x7e\\xf1\\x1d\\x77\\x5a\\x31\\x27\\x0b\\xb2\\x34\\x38\\x1c\\xbd\\xd1\\xb1\\xed\\x33\\xe6\\x56\\x06\\x3f\\x90\\x13\\x18\\x9c\\x77\\x26\\x21\\x85\\x30\\x09\\x8a\\x91\\xb6\\x7c\\x3e\\x44\\x6e\\x60\\xf2\\xbc\\x89\\xaa\\x24\\x84\\x54\\x65\\x8c\\xf2\\xb9\\x4f\\xb5\\x09\\x20\\xe5\\x2c\\x69\\x20\\x6f\\xac\\xf4\\xb1\\xa5\\x17\\x3a\\xe3\\xaa\\x02\\xd2\\x0b\\xa3\\x4c\\x81\\x1f\\x0c\\x7b\\x1b\\x0a\\x4a\\xe7\\xcb\\xde\\xd8\\x98\\x3c\\x33\\x37\\x23\\x1e\\x27\\x5b\\x22\\xa0\\x93\\xb6\\x98\\x25\\x02\\xf4\\x15\\xe9\\xe4\\x49\\x04\\x04\\x7b\\xdb\\x29\\x20\\x11\\x88\\x18\\xdf\\x4e\\xa6\\x44\\xa0\\x53\\xd4\\x25\\xa5\\x1e\\x22\\x44\\x04\\xa7\\x7e\\xa3\\xb8\\xa4\\xbc\\x41\\x98\\x41\\x7f\\x7e\\x0a\\xeb\\x68\\x2f\\x78\\x94\\xe2\\x22\\x2a\\xcb\\x66\\x54\\x2f\\xe7\\x81\\x2e\\x6c\\x58\\x41\\xa3\\x14\\x4c\\x2f\\xe0\\x81\\x82\\x5b\\x56\\x30\\x53\\x30\\x92\\x94\\x68\\x79\\x54\\xa2\\x95\\xe1\\x2b\\x73\\xf0\\x20\\x0e\\x2d\\xf1\\x1c\\x2e\\x1c\\x14\\x63\\x10\\x23\\x50\\x22\\x21\\xca\\x56\\x12\\xa2\\x4c\\x8f\\x8e\\xb6\\xaa\\x5d\\xde\\x56\\xb2\\xcb\\x1b\\x24\\x44\\x2c\\x03\\x26\\x62\\x49\\x09\\x4f\\xc8\\x56\\x6f\\x9b\\xb7\\xca\\xb1\\xcd\\x1b\\x93\\x15\\x19\\x66\\x19\\x0d\\x4d\\x68\\x06\\x53\\x6c\\x0c\\xd4\\xa6\\x6c\\x5a\\x2b\\x11\\xf7\\xa2\\xb1\\x32\\xd8\\xea\\x6d\\xb2\\x42\\x63\\x2c\\x60\\x24\\xf4\\xf2\\x3e\\x85\\xe1\\x11\\xd1\\x0c\\x95\\xd4\\x63\\xea\\x2d\\x9a\\xde\\x44\\x20\\x61\\xc8\\x1d\\xa9\\xfa\\x06\\x05\\x2d\\xfb\\x96\\xc2\\xb2\\x6f\\xa9\\x58\\xf6\\x2d\\x6c\\xb4\\xd8\\x73\\x16\\x3a\\xcb\\xbe\\x85\\x62\\xd9\\xb7\\x88\\x2c\\xfb\\x06\\x47\\x47\\x83\\xc8\\xb2\\x6f\\xf0\\xa0\\x41\\x3c\\x56\\x18\\xc4\\x63\\xf5\\x0d\\x41\\x3c\\x38\\xa5\\x9c\\x2d\\x05\\x53\\x0d\\xfa\\x06\\xf7\\x36\\xe8\\x93\\xeb\\x2a\\x66\\xc7\\xc7\\xa5\\x39\\x9c\\x3d\\x96\\x7c\\x4b\\xe6\\xd9\\xcf\\x3d\\x8e\\xad\\x1f\\x0e\\xe0\\xd1\\x8d\\xfd\\x5e\\xe9\\xa3\\xd3\\x71\\x69\\xcc\\x59\\x52\\x96\\x75\\x7e\\x52\\x6b\\x9d\\xa3\\x2c\\x2b\\xa4\\xc6\\x4b\\xc5\\x8d\\x04\\x07\\x91\\xd1\\x11\\x19\\x32\\x23\\xc1\\x9e\\x6c\\x24\\x48\\xd3\\xa4\\xa4\\xdc\\xfd\\xfe\\x6d\\x46\\x82\\xc3\\x3d\\x8c\\x04\\x87\\xb1\\x8c\\x32\\x2e\\x86\\xc6\\x5b\\xdf\\x6c\\x24\\x38\\x57\\x0c\\x2d\\x4d\\x46\\x82\\xc3\\xd8\\xa2\\x67\\xa8\\x33\\x12\\x5c\\x45\\x46\\x82\\x7e\\x01\\x23\\xc1\\xbe\\x1d\\xcb\\x57\\x35\\x46\\x82\\xc9\\x03\\x4b\\xa7\\xba\\x1f\\x15\\x31\\x12\\x1c\\x14\\x31\\x12\\x94\\x56\\xb8\\x58\\x26\\x7b\\x58\\x09\\x0a\\x69\\x2f\\xda\\xab\\xde\\x37\\xb2\\x09\\x33\\x0c\\x1c\\x3c\\xa4\\x61\\x60\\x7b\\x0f\\xc3\\x40\\x6e\\xdb\\xf8\\x2d\\xc6\\x8d\\xdc\\x16\\x70\\xb0\\x8f\\x2d\\x60\\x64\\x82\\xd8\\x53\\x79\\x08\\xc5\\x2c\\x43\\x21\\x44\\x39\\x22\\xc0\\xc7\\x5b\\xc9\\xb5\\x17\\x57\\xfe\\xb5\\xe3\\xc2\\x3f\\x68\\xe7\\x2d\\x01\\x59\\x16\\xf1\\xe5\\xa8\\x33\\xcd\\xca\\xb0\\x2e\\x04\\x96\\x3c\\x30\\x5a\\x17\\xf6\\xc8\\x98\\x59\\x17\\xc2\\x05\\xa7\\x59\\x20\\xf7\\x37\\x30\\xec\\x90\\x2e\\x65\\x24\\x34\\x26\\x86\\x1d\\x61\\x62\\xe8\\x2b\\x26\\x86\\x1e\\x33\\x31\\x0c\\x92\\x26\\x86\\x18\\x34\\x53\\x18\\x19\\xf6\\x1d\\x51\\xf8\\xaa\\x27\\x19\\x19\\xf6\\xd3\\x46\\x86\\x7d\\xc9\\xc8\\x70\\x0c\\x29\\x63\\xc7\\x8b\\x8d\\x0c\\x59\\x30\\x8b\\x3e\\xc6\\x7d\\x51\\x8d\\x0c\\x3b\\x92\\x91\\x21\\x8b\\x6e\\x81\\x99\\x38\\x1d\\x0a\\xcb\\x09\\xe8\\x77\\xd9\\xc8\\x90\\x82\\x9d\\xa0\\x02\\x76\\xbb\\x9f\\x1c\\x33\\x52\\x23\\x84\\xa6\\xa2\\xd8\\x5a\\xfd\\x09\\x30\\x9a\\x0b\\xcb\\xe7\\x06\\x83\\xe8\\xde\\x3b\\x72\\xd0\\x24\\x65\\x93\\xdd\\x5a\\xea\\x92\\xeb\\x14\\xa3\\x58\\xad\\x3d\\x7b\\x32\\xa5\\x01\\x39\\x51\\x16\\x10\\xcc\\x17\\x74\\xe6\\x68\\x5f\\xac\\x49\\x4e\\xac\\x7f\\xe8\\x68\\x88\\x1c\\x3a\\x97\\x3d\\xa0\\x85\\xec\\xe4\\x6a\\x76\\x1d\\xcf\\xb6\\x83\\xc6\\x24\\x94\\xc5\\x77\\x12\\xb1\\x46\\x3c\\x6e\\x1f\\xd9\\xc3\\x88\\x4e\\x26\\xfb\\x48\\x3e\\xc2\\x5f\\xcb\\xd2\\xa1\\x2a\\x46\\x5d\\x1e\\xea\\xcd\\x24\\xb7\\x7b\\x9a\\x49\\x26\\x2d\\x7e\\x92\\x66\\x92\\x73\\xd5\\x4c\\xb2\\x9f\\x32\\x93\\x1c\\x9b\\xb7\\x4e\\x52\\x06\\x21\\x7c\\x7b\\x91\\x0e\\x6e\\x8f\\x07\\xdd\\x1b\\x01\\xab\\xba\\xab\\xdd\\x1d\\x41\\xe6\\xee\\xe8\\x39\\xe2\\xfd\\x55\\x97\\x6e\\x5a\\x9d\\xb1\\x5e\\x4f\\xb1\\xe1\\x73\\x44\\x32\\xdb\\x18\\xa9\\x6d\\xd0\\x83\\x9d\\x6a\\x8b\\xed\\x15\\xaf\\x3d\\xcb\\xe3\\x46\\xb6\\xf0\\xb6\\xd9\\xe1\\x7b\\x84\\xf6\\xa8\\xd1\\x23\\xf4\\x2f\\x1d\\x6d\\xa3\\x4b\\x9d\\x6e\\x5e\\xb5\\x49\\xff\\x9a\\x48\\xb3\\xd0\\x08\\xe4\\x39\\x11\\xdf\\x25\\x60\\xf8\\x3a\\x49\\xbe\\xa2\\xf8\\xe2\\xeb\\xe4\\x9c\\x6c\\x49\\xe1\\x8b\\xe6\\x5c\\xdb\\x45\\xce\\x43\\xef\\x6b\\xde\\x28\\x48\\x7c\\xc7\\x91\\x4c\\x15\\x23\\xb2\\x1f\\x4f\\xc9\\x7d\\x8d\\x1f\\x17\\x7a\\xe3\\x47\\x4f\\x35\\x7e\\xdc\\x26\\x05\\x9f\\x69\\x9b\\x47\\xad\\xf4\\x93\\x1b\\x25\\xee\\x19\\xe5\\x29\\xb2\\x73\\xec\\x9b\\xed\\x1c\\x07\\x3a\\x3b\\xc7\\x61\\xc2\\xce\\xf1\\x58\\x1b\\x14\\x6a\\x64\\x12\\xaa\\x8e\\x99\\xd1\\x62\\x64\\xee\\x78\\x58\\x43\\x63\\xc7\\x5a\\x64\\xec\\x58\\x17\\xc6\\x8e\\xa2\\x3c\\xbd\\x04\\x11\\x7b\\xc0\\x4a\\x44\\xb6\\x8f\\x8a\\xfc\\x93\\x77\\xef\\x4b\\x2f\\x5c\\x23\\xd1\\x10\\x9b\\x36\\x27\\x70\\x45\\x59\\x06\\x91\\x1b\\x53\\x7c\\xa9\\x84\\x41\\x64\\x64\\x32\\x39\\x4b\\x19\\x44\\x0e\\xbe\\x21\\x02\\x54\\x21\\x93\\x47\\x73\\x10\\xa8\\xad\\x56\\x26\\xbb\\x26\\x1b\\x84\\x27\\x68\\x8e\\xd2\\x94\\x3c\\xe5\\x2b\\xf7\\xf8\\xe4\\x9a\\xf8\\x6a\\x05\\x26\\xbb\\xdb\\x91\\xd3\\xcc\\x6a\\x11\\x0e\\x22\\xae\\x67\\xaf\\xca\\xea\\x3e\\x3a\\x72\\x35\\x80\\x5e\\xdc\\x3c\\x32\\x84\\x57\\xe4\\xa6\\x7b\\x67\\xb7\\x13\\x22\\xe5\\x7b\\xc5\\xb0\\x1a\\x44\\x26\\x97\\xd1\\x6d\\xe5\\xe2\\xcf\\x6f\\x0f\\x4a\\x35\\x50\\x4d\\x30\\x25\\x81\\xf7\\x1a\\x1e\\x28\\xf5\\x4d\\x23\\x44\\x71\\x3b\\x88\\x9e\\x21\\x58\\x54\\xca\\x2c\\xb2\\x2f\\x45\\x90\\x1a\\x24\\xab\\x7d\\x5c\\x01\\xb2\\x51\\xa2\\x9b\\x2d\\x40\\x36\\x9a\\x56\\xe6\\xdb\\x48\\x66\\x9a\\x57\\x66\\xda\\x48\\x66\\x5a\\x57\\x66\\xda\\x68\\x19\\xad\\x2b\\x8b\\xd8\\x48\\x1a\\xfd\\x9e\\x65\\xdb\\x48\\x1a\\x4d\\x2b\\xf3\\x6c\\x24\\x07\\x8f\\x68\\x23\\x39\\xb8\\x9f\\x8d\\xe4\\xe0\\x4f\\xb0\\x91\\xd4\\xb4\\x59\\xc0\\x46\\x52\\x27\\x96\\x36\\x4b\\xfd\\xe9\\x2b\\x74\\x9d\\x9f\\x2d\\xf5\\xe7\\x19\\x20\\x63\\xbe\\xd4\\x5f\\xe4\\x21\\xc3\\x4c\\xa9\\xff\\xb0\\xa8\\xd4\\x7f\\x93\\x1e\\xd0\\xc6\\x71\\x89\\x10\\x2d\\x6f\\x14\\xa9\\xff\\x46\\x09\\x44\\xb5\\x51\\x6c\\x1a\\x37\\x0f\\x17\\x88\\xaa\\x17\\x05\\xa2\\xba\\x57\\x4c\\x2a\\xbd\\xc5\\x72\\xc6\\x1d\\xbb\\xbf\\xc5\\xa4\\xc1\\x28\\x13\\x25\\x44\\x41\\xd2\\x5a\\x12\\xc6\\x00\\xb5\\xff\\x1c\\xce\\xc2\\x49\\xd8\\xc7\\x84\\x07\\x53\\x19\\x7c\\x1e\\x2d\\xe7\\xfb\\x84\\xd3\\x5e\\xc5\\x87\\x47\\x42\\x0b\\x00\\x6f\\xa2\\x7c\\x6f\\x85\\xcd\\xa3\\xe7\\x94\\xe1\\xde\\x02\\x5a\\x1f\\xdd\\x0e\\x38\\x5e\\xab\\xde\\xa8\\xd4\\x49\\xdb\\xf9\\xf5\\xe9\\x33\\x7e\\x7f\\x96\\x3e\\x94\\xca\\xd5\\x17\\x4f\\x7c\\x16\\x17\\xaa\\x5c\\x3a\\xfd\\x8e\\x7c\\x77\\x50\\x83\\xff\\x4a\\x65\\xaf\\x5c\\x82\\x7f\\xbf\\x8b\\xde\\x5a\\xed\\xf2\\x77\\x76\\xb9\\xf4\\x33\\xfc\\x3a\\x7e\\xd2\\xae\\xe0\\xef\\x54\\xee\\x28\\x33\\xe4\\x28\\x97\\xfe\\x05\\x95\\x1f\\xcb\\xe5\\xff\\x2e\\x95\\xc7\\xdf\\xf0\\xfe\\xb9\\xf9\\xfd\\x2e\\x1a\\xcf\\x17\\x98\\x91\\x65\\x35\\x18\\x4f\\x17\\xc0\\x7b\\xdc\\xdd\\x2d\\x45\\x74\\x89\\x37\\x40\\x77\\x7a\\x5c\\x6c\\x1d\\xbd\\x6f\\x05\\x11\\x7f\\xdc\\x78\\x73\\x6d\\x27\\xa6\\x29\\x9a\\x98\\xc0\\x72\\x11\\x65\\x52\\x91\\xbd\\x4a\\x51\\x39\\xba\\x78\\xac\\x5f\\x57\\x30\\x0f\\x86\\x65\\x30\\x59\\x11\\x54\\x79\\x78\\x50\\x45\\x82\\x5b\\x3b\\xf1\\x5a\\xb5\\x86\\x47\\xdd\\x70\\xeb\\x4b\\xb1\\xa5\\x2b\\xf9\\xc7\\xe7\\xed\\xa4\\x2a\\xf2\\xa1\\x22\\xf4\\x24\\x13\\xcf\\xc4\\x8f\\x30\\x13\\x6f\\x9c\\x78\\xac\\x48\\xf5\\x36\\xa2\\xf9\\xc0\\x8f\\xac\\x9d\\x07\\x29\\xc7\\xbb\\xaa\\x37\\xa3\\x4c\\x1b\\x4b\\x69\\xf8\\x84\\x3e\\x37\\x96\\xb0\\xa0\\xbf\\xd0\\x48\\xe6\\x4c\\x54\\xf9\\x73\\x24\\xaa\\xfc\\x45\\x88\\x2a\\x57\\x05\\x44\\x95\\xe7\\x45\\x44\\x95\\x2b\\x59\\x54\\x79\\x74\\x44\\x1f\\x3d\\x77\\xb6\\xa3\\xee\\xb1\\xfe\\xf0\\xe6\\x0f\\xa5\\xf6\\x9b\\x6c\\x71\\xb4\\x3d\\x45\\x92\\xd7\\x09\\xfd\\x65\\xe4\\xa4\\x58\\x15\\x9f\\xfe\\x4b\\x84\\x9d\\xf9\\x97\\x81\\x40\\xa6\\x02\\x24\\x37\\x16\\x20\\xcd\\x1b\\x91\\x1a\\x28\\x4b\\x76\\x30\\x62\\x6e\\x44\\x20\\xe5\\xc4\\xf1\\x61\\x69\\x62\\xf0\\x11\\x91\\xf2\\x3d\\xa4\\xd4\\x29\\x15\\x6c\\x37\\xae\\xbe\\xf2\\x5a\\xaf\\xae\\x77\\xd7\\xc8\\xca\\x19\\xbb\\x9e\\x16\\xfd\\xfe\\x95\\x1a\\x42\\xf3\\x79\\x68\\x29\\x35\\x35\\xfe\\x6a\\x1a\\x0e\\xc2\\x4f\\x1a\\x0c\\x85\\x42\\x24\\xb0\\x62\\x43\\x81\\x2e\\x92\\xfb\\x0d\\x7a\\x90\\x1a\\xf4\\x40\\x37\\x68\\xd8\\x90\\x4e\\x34\\xef\\xa3\\x48\\x70\\xd1\\x18\\xc4\\x3a\\xb0\\x49\\x52\\xb2\\x3b\\x89\\x24\\xbb\\x93\\x2c\\xe9\\xf4\\xcf\\x54\\x3a\\xbd\\x52\\x44\\xbb\\xbf\\xa0\\x68\\x77\\x22\\x36\\xd3\\x55\\x6c\\xa3\\x84\\x5d\\xb4\\x89\\x64\\x4a\\x85\\x3d\\xb4\\x21\\x29\\xf1\\x0d\\x8c\\x8e\\xe9\\xa2\\x9b\\xf7\\x3d\\x97\\x10\\x4f\\x52\\xde\\xa4\\x52\\x59\\x46\\x78\\xb9\\x66\\x67\\x19\\xa4\\x7a\\x10\\xaf\\x82\\x7d\\xe4\\xea\\x9d\\x94\\x5c\\x7d\\xca\\xa7\\xb5\\x23\\xa6\\x75\\x1a\\x4d\\xeb\\x34\\x4b\\x60\\xfe\\x0b\\x0a\\xcc\\xd5\\x59\\xfd\\x19\\x67\\xf5\\x86\\xd7\\xd7\\x15\\xf5\\xdd\\x44\\xf5\\xdd\\xec\\x57\\x5f\\xb4\\x1e\\x6a\\x0d\\x56\\xb5\\x71\\x06\\xb6\\x75\\x39\\x2e\\x79\\x42\\xf3\\x18\\x55\\x53\\x6f\\x64\\xd6\\x71\\x9c\\x51\\xc7\\x5f\\x23\\xa9\\xd0\\xa1\\xba\\xc3\\xb0\\xce\\xdc\\x28\\x8d\\xf1\\xf5\\x23\\x94\\x56\\xc5\\x46\\x92\\xbd\\x24\\xa6\\x45\\x07\\x93\\x5d\\xcd\\x0d\\x13\\x05\\xff\\x94\\x6b\\xa7\\xf1\\x13\\x3b\\x49\\x7f\\x36\\x61\\x0c\\xb6\\xe4\\x27\\x74\\x5b\\xfb\\x8b\\x51\\xe7\\x78\\x4b\\x33\\x54\\xac\\xcb\\xd6\\x6b\\xfc\\x12\\xbf\\x3a\\xaf\\x2b\\x1b\\x6a\\x2c\\xb2\\xe1\\xd4\\xb3\\x09\\x7e\\xf0\\x53\\xce\\x10\\xb4\\x70\\x83\\x0f\\x02\\x6e\\xf0\\x03\\x5a\\x98\\xa4\\xe0\\x06\\xff\\xb4\\x56\\x32\\xdc\\xe0\\x43\\x2c\\x96\\x48\\xde\\x49\\x26\\xb8\\xc1\\x47\\x46\\x76\\xfc\\xd6\\xfc\\x28\\xe0\\x06\\xbf\\xa1\\x62\\xe7\\x83\\xfd\\xf1\\xea\\xb7\\x6b\\xe7\\x03\\xfc\\x93\\x82\\x1b\\x60\\x62\\x0c\\x37\\xc0\\x27\\x06\\x37\\x58\\xc1\\x85\\x19\\xad\\xb0\\xd5\\x83\\xc2\\x0d\\x7e\\x42\\xb8\\xc1\\x4f\\xb9\\x70\\x03\\xfa\\x69\\xff\\xe5\\x64\\xb4\\x7d\\x28\\x4b\\x4e\\x5d\\x76\\xb7\\x92\\xbf\\xe6\\x94\\xa0\\xb9\\xe0\\x68\\x1f\\xc9\\x4e\\x8a\\x43\\x7e\\x42\\xa0\\x24\\x73\\x14\\x9b\\xfa\\x74\\x9d\\x41\\xfc\\xd0\\x73\\xc6\\xf1\\x43\\xdf\\x19\\xaa\\xe8\\x87\\xdf\\xf7\\xed\\x68\\x8e\\xc6\\x64\\x6e\\x24\\x43\\xbe\\x6e\\x1a\\xa7\\xcc\\x66\\x7d\\xdb\\x38\\x63\\x84\\x08\\x15\\xe1\\xba\\x5e\\xe1\\x2e\\x1c\\x3e\\x52\\x1f\\x9a\\xe2\\x60\\xb9\\xaa\\x91\\x9f\\xaf\\x29\\x47\\xc8\\xa3\\xb5\\x45\\xa1\\xda\\xe0\\xd7\\x38\\x98\\x41\\x96\\xdf\\x45\\x88\\x36\\xd7\\x43\\xdf\\x9e\\x7a\\xb0\\x6b\\x14\\xbc\\x8d\\x55\\xc8\\xe8\\x26\\xcf\\xf9\\x29\\x13\\x68\\xc2\\xb9\\x9d\\x08\\x6a\\xb2\\x82\\x9e\\xf8\\x9e\\xe3\\x79\\xf7\\x04\\x9b\\xc4\\xf5\\xc9\\x70\\x93\\x36\\xad\\x51\\x06\\x9c\\xf8\\x5e\\x71\\x30\\x07\\x1d\\x49\\xe0\\x39\\x79\\x65\\xe8\\xf9\\x89\\x18\\xd9\\x9c\\x7c\\x32\\x52\\x25\\x2f\\xef\\xb6\\xbe\\x4f\\xe6\\xe3\\x3d\\x32\\x4b\\x5e\\xac\\xf3\\xb2\\x4a\\x74\\x22\\x9d\\x8b\\x4e\\xfe\\x5c\\x50\\x31\\x0c\\xb5\\xfe\\x87\\x13\\xaa\\xb3\\xc7\\x84\\xe4\\xe5\\x55\\x26\\x24\\x37\\xf3\\xf1\\x1e\\x99\\xa5\\x09\\xc9\\xcb\\x2a\\xa3\\x82\\x72\\xab\\x45\\x5e\\xea\\xcc\\xf5\\x87\\x68\\x14\\x44\\xf5\\x07\\x85\\xa6\\x83\\x16\\xc3\\x60\\x7a\\x5c\\x05\\xe8\\x39\\x8b\\x2a\\x35\\xf9\\x05\\x42\\xe8\\xe7\\xa7\\xc7\\x8d\\x9f\\x49\\x4f\\x4e\\xea\\x7a\\x8d\\x5a\\x73\\xc1\\x39\\xa5\\xae\\x97\\xba\\xdb\\x35\\x68\\x20\\xd3\\x45\\x05\\x9b\\x39\\x04\\x7e\\xb4\\x3f\\x71\\x47\\xef\\x82\\xad\\x13\\x29\\xc7\\x95\\xe4\\x16\\x25\\xe5\\x1b\\x4a\\x1a\\xa1\\x69\\x6a\\xbe\\xb2\\x45\\x8f\\xaf\\xd6\\xa7\\xc6\\x67\\xea\\x5d\\x95\\x5f\\xb9\\x0b\\x54\\xbe\\x51\\x04\\xd2\\x42\\x46\\x20\\xd1\\x34\\x29\\x29\\x9f\\x1a\\x78\\x9d\\x3d\\xd2\\x6c\\xd2\\xaa\\xe7\\x51\\x31\\x43\\x65\\x1d\\x41\\x8a\\x76\\x70\\x4c\\x64\\x97\\x59\\xc7\\x48\\xa4\\xb8\\x58\\xb2\\x0f\\xd1\\xea\\x17\\x94\\x20\\x0a\\xe7\\x47\\x2e\\x50\\x82\\x97\\xad\\x12\\x12\\x44\\x7d\\x77\\x84\\xb1\\xb0\\x42\\x6a\\x28\\x3a\\x4e\\x31\\xb8\\xbf\\xfe\\x91\\xfc\\xf5\\xf0\\x8f\\x6f\\x3e\\xc5\\x5f\\xf7\\x53\\x0c\\x36\\x9f\\xc2\\x3c\\x16\\x3b\\xc9\\xed\\x0e\\x32\\x2b\\xda\\x93\\xe1\\x85\\x3b\\xd2\\xf4\\x5d\\xf3\\x18\\x25\\xeb\\x17\\x58\\x1e\\xdc\\x13\\x03\\xa5\\x52\\x6d\\xb6\\x50\\xfa\\x3a\\xd7\\xc0\\x63\\xec\\xb7\\x26\\x7d\\x68\\x93\\x57\\xb0\\x2b\\x42\\xce\\xf7\\x84\\x11\\x27\\x14\\xee\\xcb\\xb0\\xfe\\xaa\\xe1\\x7f\\xe4\\x89\\xd9\\x87\\x07\\xec\\xa5\\x78\\xc0\\x82\\x15\\xa7\\x07\\x18\\xc2\\xf2\\x7b\\x09\\x23\\x9c\\x71\\x92\\xae\\x27\\x98\\xbe\\x59\\x34\\xd4\\xe8\\x57\\xe3\\x57\\xe0\\xf0\\x52\\xec\\xe2\\x9c\\x97\\xec\\x8b\\x92\\xf3\\xa8\\xe4\\xdc\\x54\\x32\\x8f\\x31\\x94\\xfb\\xbf\\x7d\\x56\\x94\\x35\\xbc\\x87\\xb3\\xfa\\xac\\x76\\x8b\\xb0\\x93\\x45\\xd8\\xc7\\x20\\x9f\\x7d\\x54\\xda\\x35\\x32\\x90\\xf4\\x83\\xcd\\x8a\\x77\\x3a\\x5d\\x78\\x6e\\xa3\\xd1\\xd6\\x06\\xfd\\xec\\xa3\\xf2\\x94\\xdd\\x70\\xe4\\x47\\x9b\\xbc\\x39\\x3a\\x92\\x04\\xb8\\xf4\\x40\\x18\\xa6\\xf6\\x71\\xea\\x1e\\x55\\xe8\\xca\\x88\\x80\\x7c\\x23\\x09\\x83\\x51\\xf0\\x32\\xf2\\x9c\\xa1\\x96\\x98\\x6c\\x8e\\x3c\\x7d\\x74\\x52\\x71\\x13\\x2b\\x92\\xdc\\x44\\xc8\\xd2\\x5a\\x12\\x93\\xfb\\x2b\\xb6\\x94\\x5d\\x5f\\x4a\\xc6\\x9b\\x53\\x21\\x9d\\x87\\x71\\x6a\\x1e\\x36\\xd5\\x98\\x3a\\x60\\xf3\\xba\\xb4\\x9b\\x63\\x4f\\x9e\\x0d\\xa5\\x79\\xa9\\x87\\x6a\\x2e\\x54\\x06\\xc1\\x76\\x28\\x19\\x6c\\x1d\\xdb\\x25\\xf2\\x96\\x23\\x52\\xf6\\x07\\x27\\x7e\\x88\\xc0\\x89\\xef\\x14\\x70\\xe2\\x87\\x04\\x38\\xf1\\xdd\\x37\\x3a\\x18\\x5f\\xed\\x8f\\xb1\\xf9\\x90\\x8f\\xb1\\x21\\x3f\\xd2\\x7f\\x13\\x71\\x0d\\x49\\x8f\\xf4\\x65\\xa4\\x4b\\xda\\xc7\\x37\\x4f\\x19\\x19\\x3c\\x5d\\x5a\\x2c\\xe2\\xbe\\xe1\\xd5\\x24\\x05\\xc2\\x09\\x53\\x29\\xd3\\x54\\xca\\x4d\\x2a\\x65\\x96\\x4a\\x99\\xa7\\x52\\x16\\x1a\\x78\\xcf\\xd2\\xe1\\xd6\\x9f\\x4c\\x19\\x60\\xd3\\x40\\x83\\x29\\x50\\xcf\\x3a\\x01\\xea\\x79\\x16\\x81\\x7a\\x9e\\x49\\xa0\\x9e\\x8d\\x6a\\x5d\\x19\\x67\\x3a\\x96\\x32\\x6d\\x19\\x40\\xe7\\x96\\xfd\\xd1\\x82\\x44\\xa8\\x0d\\xe5\\x99\\xd1\\x86\\xf2\\xdc\\x84\\x1d\\xba\\x40\\x8c\\xd0\\x25\\xfe\\xf3\\x12\\x31\\x42\\xaf\\xf0\\xd7\\x6b\\xe7\\x45\\x8d\\xbc\\x61\\x8d\\xbd\\x65\\x7f\\xde\\xa9\\xd8\\x20\\x7e\\x20\\x65\\xe0\\x80\\x6c\\xf2\\xde\\xa9\\x91\\x0f\\x29\\xc8\\xd1\\x47\\x56\\xdf\\x27\\xa7\\x74\\x60\\xe1\\xf8\\x0e\\x70\\x9e\\xed\\x12\\xf9\\x8c\\x09\\x74\\x0e\\x78\\x4a\\x73\\x50\\x15\\x96\\x6b\\xd4\\x7b\\xe9\\x30\\xa5\\x57\\x9c\\x64\\xc3\\x8a\\x5e\\xa0\\xc4\\x55\\xe4\\xe0\\x60\\xa2\\x9b\\x28\\x81\\x1f\\x31\\x24\\xcc\\xad\\x64\\x96\\xac\\x64\\x9e\\xaa\\x64\\x95\\x74\\xd4\\x5e\\x2b\\x88\\x3d\\x9a\\x18\\xb1\\x47\\xff\\x7c\\x1c\\x80\\xd1\\x0f\\x7f\\x2c\\xc0\\x28\\x2b\\x7a\\x86\\x11\\x60\\xb4\\x8a\\xe5\\x8e\\x40\\x9e\\x15\\x73\\x79\\x7f\\xa3\\xc5\\x7f\\x15\\x02\\x2a\\x65\\x47\\xf8\\xd0\\x02\\x95\\x56\\x2a\\x50\\x69\\x74\\x3f\\xc7\\xf7\\x74\\x5c\\x8e\\xa7\\xb8\\xbc\\x8f\\xdd\\xe1\\xcb\\x80\\x69\\x83\\xf3\\xfb\\x95\\x12\\x2b\\xa0\\xc8\\x34\\x4d\\x33\\xa7\\x49\\x99\\x96\\xac\\x41\\x7d\\xf3\\xb4\\x18\\x5d\\xe8\\xaf\\xee\\xeb\\x42\\x5f\\x42\\x75\\xbd\\x8b\\x21\\x62\\x8b\\x08\\x37\\x36\\x10\\xbf\\x8e\\x9d\\x21\\xfc\\xa4\\x2e\\xf6\\x47\\xfc\\xc7\\x31\\xf5\\x83\\xc6\\xa0\\x64\\x13\\xfc\\x75\\x4c\\x7f\\x86\\x88\\x2a\\xab\\xd3\\x9f\\x53\\xfc\\xc9\\x52\\x6f\\xf0\\xe7\\x33\\xfa\\x13\\xcd\\xb0\\xb7\\xcf\\xe9\\xcf\\xb9\\x04\\x31\\x5b\\x3d\\x3a\\xaa\\x4c\\xef\\x7a\\x3b\\x17\\x55\\x76\\x9b\\x2e\\x76\\x5b\\x10\\x55\\x76\\x91\\x2e\\x7a\\x41\\x8b\\xd2\\x9b\\xe0\\x72\\x93\\x85\\x6e\\x7a\\x93\\x2e\\xfb\\xa6\\x00\\xc0\\xeb\\x6d\\xba\\xd8\\x5b\\x1e\\xd6\\xd5\\x5f\\xce\\xd9\\x51\\x6b\\x2a\\x7b\\x99\\x2e\\x7b\\x19\\x97\\x7d\\x9d\\x39\\x4b\\xaf\\xd3\\x65\\x5f\\xc7\\x65\\x11\\x0e\\x8b\\x5f\\xdc\\x18\\x8d\\xf6\\x55\\xba\\xf8\\xab\\x74\\x71\\x63\\x54\\xda\\x97\\xe9\\xe2\\x2f\\x69\\x71\\xb6\\xa2\\xdf\\xc3\\x06\\xc0\\xf2\\xaf\\xfb\\xe6\\xf9\\xfe\\x94\\xae\\xe2\\x93\\x54\\xc5\\x0f\\x14\\x45\\x94\\x53\\xc7\\xe7\\x74\\x1d\\x9f\\x0b\\xa1\\xeb\\x56\\x8f\\x88\\xae\\x5b\\xdd\\x0f\\x5d\\xb7\\xfa\\x13\\xd0\\x75\\x9a\\x36\\x0b\\xa0\\xeb\\x74\\x71\\x1f\\xcc\\xe8\\x3a\\xfa\\x8a\\xac\\xf3\\xd0\\x75\\x3c\\x03\\x59\\x17\\x40\\xd7\\x89\\x3c\\x64\\x9d\\x89\\xae\\x5b\\x17\\x45\\xd7\\xbd\\x4f\\x0f\\xe8\\x3d\\x73\\x4a\\x90\\x05\\x94\\x3b\\x4f\\x7f\\x9d\\x73\\x2d\\x50\\x6e\\xc1\\x85\\x6f\\xe7\\x99\\xa6\\xf4\\xa7\\xe9\\x4e\\x9c\\x3a\\x2e\\x19\\x50\\x53\\x7a\\xa0\\x2b\\xe9\\x9f\\x11\\xfb\\x33\\xce\\xb5\\xaf\\x3f\\x4b\\xd7\\x76\\x46\\x6b\\xdb\\xb2\\xda\\xb6\\xac\\xb6\\x2d\\xab\\x8d\\x19\\xdd\\x67\\xc1\\xdd\\x06\\x85\\xe1\\x6e\\xbf\\xf4\\x17\\xbd\\x97\\x78\\x88\\x14\\x06\\xbc\\x85\\x31\\x2a\\x38\\x81\\xe4\\x0a\\x25\\xc0\\xdb\\x26\\x07\\xf0\\xf6\\xf6\\x7f\\x18\\xe0\\xed\\x12\\x66\\x64\\x12\\x03\\xde\\x26\\x42\\xc6\\xb1\\xb6\\xc9\\x0f\\x5c\\xf4\\x31\\xd1\\xe1\\xbc\\xd6\\xf9\\x78\\x37\\x5f\\xc6\\xbb\\xb5\\x9d\\xd7\\x7f\\x3a\\xc8\\xad\\x8d\\x7e\\xa0\\x14\\x90\\xdb\\x4b\\x8c\\xf0\\xeb\\x4c\\x54\\x90\\x5b\\x34\\x07\\x8c\\xb9\\x70\\x1d\\xed\\x04\\x48\\xb9\\xa8\\xb2\\x3c\\x32\\xaa\\xc3\\xc1\\x57\\x68\\x07\\xbe\\x77\\xea\\x36\\x10\\x1b\\x09\\x18\\x9c\\xcb\\x61\\x70\\x13\\x58\\xe8\\x97\\x96\\xc0\\x81\\x7d\\x2c\\x8c\\xa5\\x0a\\x8b\\x06\\xb5\\x53\\xb8\\x1c\\x4f\\x41\\x89\\x79\\x14\\x30\\x45\\x01\\x56\\x1e\\x03\\x58\\x71\\x01\\xb5\\x67\\x02\\x4f\\xc9\\x9e\\x95\\xba\\x94\\x0a\\xc7\\x94\\x13\\xc7\\xa5\\xe0\\xa9\\x38\\xe5\\x7b\\xc7\\x8d\\xc1\\x53\\x26\\x84\\xd1\\x6d\\x64\\xa6\\x4a\\x4c\\xe3\\xce\\x47\\x32\\xdd\\xc6\\xa1\\x69\\x4d\\x95\\x18\\x63\\x64\\xa6\\x2a\\x41\\xd7\\x1c\\xf8\\x21\\x5e\\xe5\\xe2\\x4d\\x5e\\x09\\x73\\x67\\x03\\xde\\x64\\x4e\\x5e\\x91\\xa9\\x4d\\xde\\x18\\x35\\x4c\\x0b\\x9a\\xa1\\xb2\\x24\\x6f\\x9d\\x65\\xe5\\x86\\x22\\x4d\\x6e\\x72\\x90\\x26\\xaf\\x72\\x7a\\xaf\\x45\\x9a\\x9c\\x0a\\xa4\\xc9\\x05\\x1c\\x60\\x69\\xa4\\xc9\\x39\\x4a\\xc9\\x63\\xa4\\xc9\\x69\\xcc\\x9f\\x86\\x05\\x91\\x26\\x67\\x6c\\xc3\\xbf\\x6b\\x9e\\x09\\xa4\\xc9\\x3b\\x94\\xd2\\x9d\\xda\\x67\\x57\\xef\\xae\\x9d\\x53\\xf8\\x27\\x85\\x34\\xc1\\xc4\\x18\\x69\\x82\\x4f\\x0c\\x69\\x12\\x1e\\x1d\\x85\\x11\\xd2\\x24\\x63\\x81\\xdf\\x03\\x69\\xf2\\x0a\\x91\\x26\\xaf\\x8a\\x38\\xb6\\xe8\\xca\\x8e\\x2d\\xba\\x31\\xce\\x23\\x70\\x7a\\xf1\\x9b\\x0e\\x3c\\x28\\xa0\\x8f\\xf7\\xce\\xab\\x4c\\x24\\x82\\x7a\\x11\\x45\\xf2\\xe4\\x10\\xf1\\x7c\\xce\\xfb\\x7b\\xc2\\x11\\x52\\x95\\xca\\xa8\\x84\\x8f\\x50\\xad\\x8c\\x49\\xf8\\xb0\\x27\\x24\\xe1\\x93\\x93\\x53\\x42\\x00\\x12\\x3e\\x15\\x57\\xbf\\xe7\\x64\\xdd\\x16\\xcf\\x9a\\x04\\x0d\\x7c\\xce\\xeb\\x6d\\x0c\\x19\\xf8\\x5c\\xbc\\xbf\\x39\\x59\\xb7\\xc5\\xb3\\xca\\x3a\\xfd\\x9c\\xac\\x69\\x95\\x7e\\x91\\x1e\\x0b\\x8d\\xfe\\x0a\\x8d\\xcc\\xb9\\xce\\xf5\\x75\\xf2\\x4c\\xd4\\xe8\\xe9\\xc3\\x58\\x4b\\x38\\x65\\x3a\\xf3\\xb1\\xac\\x33\\xa7\\x69\\x52\\x52\\x81\\x13\\x2d\\xb3\\xd1\\x5c\\xbf\\x1d\\x53\\xc9\\x6f\\xc7\\xfb\\x1c\\xed\\xd3\\x34\\xd6\\x96\\xc7\\xc5\\x48\\x37\\x1a\\xbd\\xe8\\xf5\\x1b\\xa1\\x71\\x4e\\x9e\\x69\\x3a\\x8d\\xf3\\xac\\x88\\xc6\\x39\\x4c\\xf8\\xbe\\x40\\x37\\x0b\\xdc\\x81\\x61\\x37\\xfa\\x05\\x07\\x6b\\xb2\\x27\\x6f\\x1f\\xbf\\x27\\x1f\\xef\\xab\\x53\\x7e\\x03\\x93\\xc8\\x75\\xca\\x37\\xb1\\x4e\\x99\\x4b\\x56\\xb5\\xb5\\x7e\\x23\\x69\\x42\\x49\\x40\\xe9\\x4a\\xfb\\x67\\xec\\x40\\xa6\\x9f\\x74\\xf6\\xd1\\x8f\\x14\\xaf\\xfd\\x2c\\xed\\xf4\\x6b\\xaa\\x9d\\x0e\\x15\\xed\\xf4\\x1b\\x54\\xc2\\x0e\\x92\\xf8\\xec\\x41\\x54\\xe1\\x20\\x0b\\xf8\\xfb\\x06\\x81\\xbf\\x6a\\x7d\\xaf\\xb1\\xbe\\x22\\x04\\x4b\\xde\\x8c\\xbf\\x61\\xeb\\x75\\x92\\x52\\x5a\\x4a\\x77\\xfe\\x4b\\x66\\x4a\\x7e\\x74\\x24\\x91\\xe4\\xf4\\x93\\xfc\\x90\\xf8\\x24\\x05\\x15\\x98\\x6b\\x89\\xb8\\x47\\x05\\xe6\\x17\\xe7\\x07\\xad\\xfa\\xf2\\xcb\\x03\\x6a\\x2f\\xdf\\x42\\x33\\x0f\\xa9\\xbc\\x7c\\xcb\\x66\\xe0\\xc7\\xc4\\x0c\\xa4\\x55\\x97\\x13\\xbb\\xf9\\x63\\xae\\xe6\\x12\\x7a\\xf7\\xe3\\x7e\\x8a\\xcb\\x8d\\x4d\\x5e\\xa2\\x6a\\x2e\\x19\\xd8\\x7d\\x18\\x2d\\xa9\\xe1\\xbe\\x6b\\xf4\\x6d\\x7a\\x4d\\xdd\\x17\\x40\\x91\\x06\\xd1\\xab\\xbb\\xac\\x50\\x2b\\x31\\x44\\x64\\x94\\x44\\xe0\\x8f\\xa2\\x51\\x8e\\xb2\\x36\\xce\\x5b\\xc3\\xc6\\x29\\xda\\x99\\x6d\\xaa\\x33\\xa3\\xc7\\x9b\\xa1\\xf1\\xfd\\xf4\\xd0\\xa7\\x91\\x1e\\x7a\\xab\\xe8\\xa1\\x4f\\x13\\x0a\\xdf\\xed\\xb7\\xe9\\xa1\\xc3\\xfd\\xd5\\xd0\\x09\\x9f\\x0e\\x09\\x5d\\x73\\x4a\\xa7\\xdc\\x4b\\xa5\\xf4\\x53\\x5a\\xdd\\x41\\x2a\\x65\\x98\\x4a\\x19\\xa5\\x52\\xc6\\x1a\\x5d\\xf0\\x24\\xa9\\x0b\\x0e\\x75\\xba\\xe0\\x69\\x21\\x5d\\xf0\\x4d\\x11\\x5d\\xf0\\xcc\\xa4\\xc9\\x9d\\x33\\xcd\\xea\\x82\\xfd\\x59\\xa2\\x0e\\x77\\x85\\xda\\xdc\\x28\\xa4\\x35\\xfd\\xb3\\xdd\\x5f\\x91\\x7b\\x4b\\xbd\\xe3\\x9e\\xa6\\x54\\xb9\\x67\\xb4\\xc6\\x66\\x57\\xd1\\xd3\\xca\\x2a\\x29\\x20\\x24\\x92\\x3a\\xdb\\x7e\\xae\\xba\\x75\\x90\\x54\\xb7\\x0e\\x73\\x8b\\x8c\\x92\\x45\\xc2\\x42\\xca\\xb0\\xc1\\xfd\\x7d\\x46\\xf4\\x8d\\x7a\\xdb\\xf3\\xc7\\xd1\\xdb\\x5e\\xfc\\xb1\\x7a\\xdb\\xee\\x7d\\x34\\x9a\\x61\\x31\\x7d\\x6b\\x56\\xdd\\x06\\xc5\\x62\\x68\\x74\\x0c\\xb1\\x8d\\x75\\x7d\\xe3\\x48\\xd7\\xd7\\x8d\\x75\\x7d\\xb1\\x8f\\x88\\x7e\\xe4\\x23\\x62\\x10\\xab\\xf8\\x86\\xb1\\x5e\\x6f\\x24\\x69\\xf0\\xc2\\x47\\xd7\\xe0\\xe9\\x0d\\xa8\\x73\\x35\\x78\\xfa\\x48\\xb5\\xc5\\xf4\\x5a\\x46\\x3f\\x0b\\xf9\\xda\\x3f\\xa3\\xaf\\x85\\x02\\xda\\x3f\\x63\\x2c\\xeb\\x22\\xbe\\x21\\xf4\\xc2\\xf6\\x5c\\xd5\\xa1\\xde\\xa8\\xbf\\x80\\xf6\\x2a\\x7c\\x44\\xed\\x55\\x78\\x3f\\xed\\x55\\xf8\\x27\\x68\\xaf\\x34\\x6d\\x16\\xd0\\x5e\\xe9\\xfc\\x87\\x98\\xb5\\x57\\xf4\\x15\\xb0\\xe9\\x39\\xda\\x2b\\x9e\\x81\\x4c\\x0b\\x68\\xaf\\x44\\x1e\\x32\\xcd\\xd4\\x5e\\x4d\\x0b\\xc5\\x88\\x4a\\x7a\\x51\\xf0\\xa8\\x17\\x05\\x8d\\x12\\x6a\\xcc\\xb9\\xe0\\x99\\x5d\\xcc\\x51\\x77\\x57\\x89\\x16\\x90\\xfc\\x96\\xe8\\x61\\x5c\\xc9\\xe0\\x46\\xd7\\x68\\x94\\x80\\xca\\xae\\x1f\\xa3\\xfb\\xc7\\x18\\x65\\xac\\x2a\\x65\\xd2\\xb5\\xa3\\x66\\x60\\xaa\\x30\\x25\\x01\\xd5\\x60\\xf9\\xed\\x0c\\xaa\\xdb\\xec\\x76\\xd4\\x0c\\x4c\\x3b\\x96\\x6c\\x27\\x4f\\x91\\xa8\\x87\\x2e\\x20\\x76\\x27\\x16\\x1c\\xa3\\x97\\xb3\\xf8\\x29\\x4b\\x23\\x48\\x65\\xfb\\xba\\x89\\xdf\\xb0\\xe9\\xce\\xd3\\x01\\x76\\x11\\x95\\xa3\\x2b\\xbf\\x65\\xe5\\xf3\\xb5\\x7e\\xdd\\x42\\x5a\\xbf\\x31\\x9c\\x8f\\xfd\\x33\\x77\\x56\\x44\\xd7\\x77\\x11\\x1f\\x9a\\x91\\x5b\\xec\\x0b\\x7d\\x3c\\xb1\\x0b\\x67\\x58\\x19\\xb0\\x78\\x62\\x03\\xbe\\xbd\\x2e\\x9d\\x11\\xfc\\x46\\xc1\\xfd\\x40\\x6c\\xa2\\x97\\xb9\\x7a\\x83\\x97\\x76\\x13\\x98\\x79\\x2f\\xf6\\xe3\\xb6\\x76\\x22\\xb3\\x00\\x0f\\xad\\x05\\xb4\\xe6\\x76\\x92\\xb1\\x9d\\x5b\\xdd\\xc0\\x24\\xd7\\x84\\x27\\x3b\\x01\\x7e\\x22\\xc8\\xb3\\x36\\xaa\\xb5\\x3a\\x5a\\xdf\\x01\\x5f\\xbf\\x80\\xaa\\x3d\\xec\\xcd\\xc8\\xdd\\x22\\x89\\x00\\x04\\xa8\\x3f\\x04\\x1e\\x3f\\xec\\x74\\x70\\x9c\\x4b\\x8e\\x7d\\x9a\\x67\\x49\\xd7\\x69\\x50\\x8d\\x1b\\xdb\\x3a\\x8c\\xbb\\xbb\\x6e\\xad\\x1b\\x68\\xa4\\xe7\\xe9\\xe8\\x24\\x2f\\x42\\x68\\xcd\\xd3\\xaf\\x7d\\x8c\\x7e\\xc7\\x81\\x5a\\xc0\\xbd\\x70\\x5b\\x1e\\x1a\\x59\\x6a\\x47\\xbb\\x6b\\x1e\\x3d\\x11\\x3e\\x10\\x1d\\x8c\\x20\\x59\\x6b\\x7a\\xa9\\xd9\\x11\\x11\\xe0\\xb9\\x4b\\x42\\x60\\xc8\\xbc\\x2a\\x4e\\x88\\xe2\\xe3\\x12\\x7b\\xbd\\xfd\\xbe\\xd6\\xc2\\xdf\\x75\\x8c\\x01\\x51\\x71\\x58\\x2e\\xbb\\xc1\\x92\\xd8\\x53\\xb9\\x4d\\xda\\x65\\xf1\\x66\\x27\\x68\\xd4\\x57\\xe8\\xcf\\x33\\x68\\x5d\\x5d\\x37\\xd2\\xad\\xef\\x61\\x2a\\x39\\x15\\xa6\\x92\\x37\\xfc\\x47\\x0d\\xbe\\xe0\\xb6\\x46\\xb6\\x75\\xfc\\x5b\\x67\\xa6\\x93\\xe3\\xc8\\x56\\xf2\\xee\\x2e\\x32\\x92\\x7c\\x95\\x61\\xa2\\x19\\x5b\\x47\\x9e\\xb9\\x93\\x36\\x7c\\xd3\\xbb\\xbb\\xab\\x1a\\xb9\\xb8\\x26\\xb7\\x92\\x1f\\x81\\x80\\x56\\x96\\xb4\\xbd\\x34\\x57\\x8b\\x67\\xff\\xf6\\xa4\\x86\\xff\\xb2\\xce\\x95\\xe1\\x1f\\xfc\\xf1\\x1f\\xe8\\x40\\x93\\x19\\x6c\\xce\\xec\\xc8\\x2c\\xb3\\x0b\\x6d\\x5e\\x12\\xf4\\x4f\\x30\\x96\\xbd\\x88\\xa2\\xdb\\x53\\xd9\\x7d\\xe8\\xd1\\x51\\xf4\\xa8\\xe4\\x6b\\x5d\\x29\\x8f\\x15\\x58\\xc9\\x4f\\x94\\x14\\xa2\\x54\\x53\\x4e\\xbc\\xaf\\x5f\\x5f\\x37\\xae\\x2a\\x75\\x82\\xfe\\x49\\x27\\x89\\xf6\\x27\\x6a\\xfb\\xd1\\xe3\\x44\\x6d\\x5f\\x79\\xa4\\xf5\\x2b\\x29\\x44\\xa9\\xa6\\x92\\x78\\x2f\\xb7\\xdf\\x73\\x7a\\x77\\x77\\x63\\xe0\\xa0\\xfb\\x77\\x77\\x13\\xae\\x25\\x7c\\x69\\x54\\x0e\\xd1\\xf3\\xca\\x93\\x6c\\x54\\x31\\x32\\xe0\\x1b\\xe7\\xf5\\x3d\\x54\\x42\\x71\\x55\\xe4\\xad\\xf3\\x26\\x19\\x1d\\xf0\\x9d\\x94\\xd4\\xa5\\x58\\xe3\\xd7\\x8a\\x7e\\xe8\\x5d\\xc1\\xe8\\x80\\xaf\\x73\\x84\\xf2\\x83\\x58\\x28\\x3f\\x88\\x85\\xf2\\x6f\\xf7\\x8b\\xd7\\x17\\xa6\\x42\\xf5\\xbd\\x36\\x86\\xea\\x0b\\x0d\\x51\\xfa\\x2e\\x92\\x92\\xbe\\xcb\\x58\\xa3\\x20\\x85\\xd9\\x9b\\xeb\\xc3\\xec\\x85\\x4a\\x84\\xbd\\x0f\\xd2\\x64\\x3d\\x58\\x84\\x3d\\x89\\x39\\xf6\\x76\\xa8\\xa0\\xbb\\x6f\\x7c\\x3d\\x4d\\x90\\x3c\\xda\\xeb\\x8f\\xce\\x99\\x2c\\x6c\\xfb\\xa0\\x89\\x1d\\x86\\x13\\xc7\\x8d\\xe0\\x60\\x92\\x4b\\x62\\x09\\x5d\\x42\\xc6\\x12\\xf3\\x34\\x32\\xee\\x53\\x4c\\x31\\xd9\\xda\\x92\\x4c\\x56\\x33\\xb4\\xbe\\x45\\x4f\\x8c\\x5a\\xa3\\x66\\xdf\\xdd\\xd5\\x76\\xc9\\xc9\\xaf\\x49\\xe6\\xfc\\x1f\\x81\\xf2\\x86\\x7b\\xe9\\xe8\\x88\\xff\\x48\\x9c\\x96\\x2c\\xa2\\xb0\\xf7\\xc4\\xda\\x3e\\xb5\\xce\\xcb\\x75\\xdb\\xae\\x78\\x82\\xc9\\xf6\\xa9\\x89\\x45\\x6e\\xb0\\xbf\\x68\\xc1\\x3e\\x76\\x6c\\xbf\\xd5\\x3e\\xb1\\xfd\\x44\\x66\\xf4\\xfe\\xb0\\x5f\\xe4\\xbe\\xea\\xdf\\x5e\\xc4\\x4a\\x59\\xd3\\xd7\\x33\\x2e\\x3a\\x20\\x38\\xa2\\x2b\\xbc\\xb5\\xae\\x26\\x1c\\xe4\\xec\\x50\\x83\\x9b\\x08\\xa8\\x88\\x29\\x89\\xb5\\xa8\\x93\\xdb\\x6b\\x47\\xc9\\x6e\\x36\\xb8\\x67\\xb9\\xd5\\xf3\\xc1\\x24\\xe8\\xba\\xd4\\x3f\\x7d\\x43\\xa4\\x30\\x59\\x07\\xa4\\xec\\x24\\x91\\xbf\\x7c\\xdf\\x4b\\x51\\xbf\\x16\\x88\\xd6\\x81\\xa3\\x3e\\xba\\xde\\x2c\\xfb\\xa9\\x17\\xeb\\xfd\\xbf\\x6d\\x45\\x2a\\xe7\\x85\\xda\\x06\\x94\\xad\\x37\\xbc\\x08\\x57\\x70\\x8f\\x18\\xe8\\x63\\x8b\\xdd\\xf6\\x36\\x33\\x8c\\xa3\\xf3\\x6c\\x5c\\x51\\x12\\xae\\x66\\x45\\x67\\x20\\x6f\\x55\\xe9\\x0b\\xa0\\x74\\x68\\xac\\x09\\x3b\\x45\\xfb\\x98\\x84\\x4e\\x25\\xf7\\xc2\\x21\\x0d\\x60\\x9a\\x14\\x5c\\x59\\x5f\\x71\\x5d\\x35\\x5c\\xe0\\xd3\\xd0\\x9f\\xb2\\xc7\\x59\\xc0\\x14\\x0e\\x4b\\x1a\\x19\\x25\\x9b\\xa4\\xbe\\x28\\xee\\x92\\x8b\\x75\\xa5\\x9e\\xea\\xca\\x72\\xf1\\xed\\x3d\\x49\\xb8\\xa4\\xa7\\x5d\\x51\\x9b\\xa1\\xeb\\xff\\x5b\\xda\\xf1\\x13\\xfe\\xbb\\xd5\\x36\\x98\\x7f\\xe9\\x7b\\xd5\\x4f\\x22\\x0c\\xff\\x1c\\x6e\\xd5\\xcf\\x33\\x38\\x1c\\xba\\x8c\\x71\\x13\\x4d\\xb7\\xa3\\x38\\xe7\\x86\\xd6\\x2f\\xbc\\xd1\\x63\\x75\\x00\\xf1\\x1a\\x8f\\x73\\x34\\x7c\\xd3\\x96\\x23\\x1b\\xe0\\x83\\xfc\\xbb\\x3b\\x0b\\xee\\x13\\x95\\xd0\\x8d\\xc4\\xc6\\x35\\x54\\x9a\\x67\\xed\\xcc\\xf8\\x2c\\x82\\x09\\x98\\x75\\x3d\\x6b\\xc3\\xda\\x80\\xf3\\x76\\x36\\x84\\xfd\\xe1\\x9b\\x55\\xf9\\x5e\\x8e\\xf2\\xde\\x07\\x6a\\x6f\\x67\\x5f\\xb5\\xaf\\x6d\\xa0\\x94\\xbe\\x00\\x83\\x3a\\xe9\\x5a\\x79\\xfb\\xfe\\x8f\\xef\\x8e\\x40\\xd8\\x7c\\x4a\\xc5\\x7b\\x3c\\x8b\\x29\\x06\\x89\\x5a\\x40\\xd5\\x07\\x52\\x0b\\xa9\\xbb\\x3d\\x3e\\xb2\\xfc\\x27\\xdb\\xa7\\x32\\xc3\\x27\\xce\\xf3\\xe6\\xa2\\xf5\\x39\\xf3\\x4c\\x47\\xf9\\xf8\\xb6\\x6e\\xa7\\x0e\\x73\\x4d\\x56\\xd6\\x1f\\x77\\x13\\x63\\x32\\x69\\x61\\x64\\x63\\x6a\\x76\\x85\\xfe\\xae\\xc1\\xa7\\x97\\x2a\\xdb\\xa8\\x21\\xf5\\x58\\x35\\xf1\\xc5\\xa1\\xbb\\x27\\xec\\xc6\\x67\\xdd\\x15\\x26\\x11\\x13\\x8c\\xfc\\xc8\\xbb\\xc1\\xb4\\x77\\x50\\x74\\xfd\\xe8\\xa6\\x44\\xb7\\xaf\\x50\\x83\\xd4\\xc0\\x7f\\x60\\x78\\x2c\\xd1\\xfe\\xbe\\x4e\\x53\\x2b\\xf5\\x46\\x94\\xa4\\xbb\\x0c\\xb5\\xf5\\xea\\x66\\x90\\xd7\\x51\\xc1\\x4a\\x71\\xf2\\x68\\x65\\xd4\\x23\\x12\\x8f\\xa2\\xd9\\x07\\x86\\x8b\\xff\\xf4\\x28\\x2a\\x54\\xfa\\xce\\xb0\\x19\\xcf\\x9d\\xf4\\x77\\xc7\\xf3\\xe3\\x4c\\x76\\x3b\\x2f\\x16\\x95\\xc9\\xeb\\xbc\\x64\\x30\\x9b\\x17\\x68\\x73\\x48\\x03\\x6d\\x8e\\x68\\xa0\\xcd\\x31\\x15\\xcf\\xa0\\x3a\\xbb\\x1a\\xce\\xda\\xe8\\x43\\x24\\xd2\\x46\\xd2\\x44\\x16\\xdb\\x92\\x2a\\x24\\x25\\x27\\x7b\\xf5\\xe0\\xf9\\x13\\xfa\\x08\\x9f\\x06\\x18\\x3e\\x0c\\x7f\\x30\\x35\\x9a\\x93\\xde\\x18\\xcd\\x49\\x67\\x0e\\x72\\x91\\x73\\x54\\x2f\\x2e\\xd0\\x6c\\x74\\xe9\\x94\\x6e\\x83\\x59\\x58\\xa2\\x96\\xb0\\x5a\\xed\\xe4\\x1a\\xb3\\x45\\x3a\\x48\\x1c\\xc0\\xad\\x53\\xad\\x93\\x53\\x55\\x1d\\xc9\\x62\\x59\\xa8\\x11\\x37\\x13\\x8f\\xe2\\xdc\\x2f\\x1a\\x92\\x33\\x1d\\xc5\\x45\\xf1\\x50\\x7f\\xa6\\xf5\\xf1\\x7e\\x0a\\x7b\\x9e\\x9c\\x3b\\x35\\x41\\xaa\\x4b\\x1a\\xa7\\xd3\\x47\\xd7\\x0d\\xe9\\x43\\xff\\xe5\\xea\\x86\\xf4\\x81\\xff\\xb2\\xc4\\xa0\\x46\\x87\\xdf\\x46\\xc1\\xa7\\xd1\\xd1\\x37\\x03\\x93\\xee\\xed\\x05\\x7d\\x9b\\x59\\xcc\\xe8\\x05\\x7d\\xc3\\xc2\\xa8\\x9a\\xca\\xb5\\xd3\\xe5\\xda\\xac\\xb9\\xec\\x72\\x41\\xba\\x5c\\xc0\\xda\\xfb\\x01\\x0f\\xb2\\x7d\\x22\\x61\\xb2\\xe6\\x32\\x8b\\x19\\x63\\x8b\\x02\\x7d\\xe0\\x07\\x46\\x03\\x31\\xbd\\x77\\x67\\x54\\xe3\\xa1\\x54\\xd4\\x1c\\x5b\\xd4\\xa8\\x3a\\xa4\\xe5\\x3e\\x51\\x51\\xea\\xde\\xaa\\xc3\\xbc\\xd8\\xa2\\x46\\x35\\xa7\\xd0\\x40\\x9b\\x0a\\xfa\\xe9\\x82\\x3e\\x8b\\x84\\xba\\xbf\\xe3\\xfb\\x5e\\xbf\\x1d\\x64\\x19\\x0b\\x1a\\x35\\x94\\x94\\xeb\\xfe\\x82\\x7c\\xeb\\xa4\\xbb\\xb7\\x4d\\x65\\xb6\\xae\\x2c\\x19\\x68\\x93\\xaa\\x49\\x8c\\xba\\x32\\xfa\\x8a\\x0c\\xf2\\x74\\x65\\x42\\x98\\x3f\\x28\\xa0\\x2b\\x8b\\xc4\\xfc\\x83\\x4c\\x5d\\xd9\\xa0\\xa8\\xa5\\x97\\xde\\x24\\x95\\x08\\x5d\\xc4\\x36\\xd7\\x3b\\x7a\\x52\\xc7\\xec\\x51\\x1d\\x73\\x5a\\xdf\\x86\\x5a\\x67\\x77\\x76\\x9e\\x55\\x55\\x52\\xfd\\xeb\\xa1\\xfa\\xd7\\x6b\\x69\\x2a\\x6b\\xe0\\x7d\\x94\\xd0\\xd4\\xe4\\x6a\\x63\\xee\\x11\\xa9\\xf4\\x42\\x52\\xc9\\xc4\\x91\\x4a\\x67\\x47\\x47\\x17\\x52\\xa4\\xd2\\xb9\\xf4\\x68\\x8e\\x54\\x7a\\x9b\\xab\\x96\\xb9\\x65\\x34\\xee\\x85\\xc9\\x9c\\x63\\x44\\x6e\\x31\\x44\\xa9\\xc6\\xdc\\x83\\x83\\x9f\\xc7\\x34\\x43\\x56\\x88\\xd2\\xf3\\xd6\\x6d\\x14\\xa2\\xf4\\xd6\\x60\\xc9\\x71\\x9e\\x65\\xc9\\xb1\\x11\\x96\\x1c\\xaf\\xb4\\x21\\x4a\\x5f\\xaa\\x21\\x4a\\x37\\xfb\\x87\\x28\\xdd\\xb2\\xd9\\x7a\\xd3\\xdc\\x0a\\x4b\\x8e\\x37\\x88\\x73\\xdb\\xd8\\xdb\\xab\\x37\\xd7\\xce\\x06\\xfe\\x49\\x59\\x72\\x60\\x62\\x6c\\xc9\\x81\\x4f\\x8f\\x1e\\xa2\\xf4\\x16\\x2d\\x39\\x6e\\xbf\\x35\\x44\\xe9\\x5b\\xe7\\x36\\x5b\\x24\\x0f\\x8b\\x16\\xcd\\x2b\\x18\\xc8\\x43\\x89\\x55\\xfa\\xce\\x79\\x7b\\x5f\\xe1\\x7c\\xb2\\x52\\x55\\x1e\\xff\\x56\\x91\\xc7\\xc3\\x3c\\xe6\\x88\\xe4\\x65\\x4b\\x85\\x9c\\xac\\xdb\\xe2\\x59\\x25\\x47\\x85\\x39\\x39\\x95\\x90\\xa4\\x39\\x79\\x71\\x2d\\xcf\\xc2\\x91\\xa8\\xf9\\x46\\x8a\\x2d\\x7a\\x51\\x39\\xb3\\x28\\xd8\\xff\\x81\\xe3\\x8b\\xe6\\x6d\\xd6\\xcc\\x26\\x73\\xe2\\x7b\\x5a\\x36\\xf3\\xed\\x27\\x47\\x19\\x0d\\xd9\\xf6\\xf9\\xe0\\x5c\\x51\\xe3\\xba\\x69\\x95\\xde\\x85\\x41\\xfb\\xee\\xae\\xf4\\x8a\\xfd\\x2a\\xc5\\x77\\x78\\x50\\xe5\\xb4\\x07\\x2a\\xc5\\x79\\x7e\\x9e\\x02\\xf9\\xbf\\xb0\\x5f\\x52\\xfe\\x43\\xb9\\xc0\\x75\\x33\\x8a\\x29\\x8a\\x46\\x06\\x0c\\x4b\\x71\\x55\\xfa\\xcb\\xf3\\xe7\\xcf\\xa1\\x57\\xf2\\x9f\\xeb\\xe4\\x20\\xd5\\xef\\xc0\\x67\\xf6\\xc3\\x5e\\xf1\\x54\\x85\\xbd\\xdd\\xee\\xed\\xbd\\xc2\\xaa\\x2e\\x8e\\x8e\\xde\\xdf\\x33\\xac\\xea\\x85\\x70\\x31\\x16\\x44\\xe7\\x56\\x2a\\x9c\\xa9\\x74\\xb2\\x48\\x96\\x06\\x62\\xa9\\x45\\x86\\x18\\xaf\\xf7\\x09\\x87\\x3a\\xb9\\x77\\x38\\x54\\xd9\\x08\\x4b\\xeb\\x6b\\xb0\\x78\\x34\\x54\\x38\\x0f\\x3e\\x46\\x01\\x51\\x67\\x18\\x39\\xfe\\x7e\\xf1\\x50\\x2f\\x34\\xf1\\x50\\x29\\x32\\xfb\\xfd\\x03\\xc6\\x43\\x35\\xd7\\xc5\\xe3\\xa1\\x72\\x6d\\x86\\x21\\xdf\\xc1\\xc9\\x41\\x37\\x65\\xc1\\x80\\x33\\xf0\\x49\\x4e\\x43\\x76\\x9d\\x1c\\xa8\\xae\\x30\\x25\\x55\\x0a\\x59\\xb1\\x0d\\xf9\\xd9\\xc9\\x95\\x1b\\xba\\x74\\x91\\x7a\\xd8\\xf7\\x1d\\xf9\\xa7\\xf3\\x82\\xfc\\xe0\\xd4\\xff\\xd6\\x54\\x1a\\x33\\x59\\xd1\\x18\\x64\\xf2\\x9f\\x61\\x62\\xfc\\xff\\x3c\\x76\\x9c\\x5a\\xeb\\x9f\\x8d\\x1f\\x04\\x8a\\xe0\\x4b\\x4c\\x88\\x44\\x37\\x57\\x3c\\x68\\x71\\x07\\x1d\\x74\\xe1\\x3f\\xd6\\x1e\\x8a\\x4a\\xd8\\x85\\xd8\\x7c\\x9f\\x5d\\x10\\x7f\\x7c\\x70\\x37\\x1f\\x30\\xa6\\x78\\x81\\xae\\x2a\\x1d\\x45\\xf2\\xc4\\xbb\\xbb\\xfb\\xf2\\x9f\\xc7\\x87\\xd8\\xe1\\x1f\\x1a\\xff\\x44\\x79\\xf6\\xf2\\xe8\\xe8\\x53\\x66\\xf4\\x04\\xef\\x3f\\xe3\\xd0\\x04\\x83\\x94\\x50\\xe7\\x29\\x5b\\x69\\xb6\\x8d\\x75\\xee\\xec\\xe4\\x5c\\x92\\x03\\xfc\\x7c\\x9a\\x0f\\x57\\xa3\\xe6\\x2e\\xca\\xdc\\xd3\\x95\\x6a\\x1c\\x56\\x69\\x16\\x2e\\xb8\\xf7\\xd4\\x72\\xe9\\xa0\\x46\\x4f\\x08\\x51\\x2b\\x96\\xa9\\x00\\xc5\\xd2\\x0b\\x67\\x25\\xb2\\x3e\\xa9\\xb5\\x10\\xb5\\x3d\\xc3\\x30\\x3e\\xf4\\x02\\xce\\x58\\xa7\\x49\\xe2\\x20\\x3d\\xbf\\xe9\\x15\\xb7\\x9b\\x7f\\x43\\x8c\\xdf\\xd7\\xe9\\x18\\xbf\\x17\\xe9\\x6d\\xf9\\x90\\x31\\x7e\\x37\\x91\\xf9\\xc2\\xa9\\x62\\xbe\\xb0\\xc9\\x8e\\xf1\\xcb\\xee\\xc9\\x64\\x9c\\x52\\x04\\xc7\\x75\\x2c\\xc9\\xe7\\xdd\\xd7\\xf9\\xba\\x8f\\x72\\xa1\\x0f\\xce\\x87\\xfc\\x23\\x1a\\xa5\\x62\\x2e\\x65\\x29\\xe2\\x94\\x3a\\xf3\\xf8\\x0b\\x5c\\xac\\x3b\\x0f\\xa2\\x2b\\xb4\\x81\\x4f\\x07\\xd1\\xe5\\x2a\\x5d\\xa4\\x87\\x75\\xbb\\xe9\\xcd\\x02\\x77\\xd8\\xa4\\x05\\xc4\\x1d\\x2a\\x0a\\x08\\x5e\\x5f\\x2a\\x50\\xb3\\x77\\x1b\\xf1\\xe4\\x48\\x17\\x2c\\xc9\\x9a\\x8f\\x1d\\xbe\\x0e\\xbf\\xc9\\xaf\\xe0\\x3d\\x62\\x77\\x6e\\xf4\\x7e\\x05\\xf5\\x4d\\xf1\\x81\\xd0\\xc8\\x52\\x62\\x50\\x51\\x2a\\xd6\\x25\\xc6\\x1c\\x25\\x92\\x4b\\x47\\xca\\x90\\xb0\\x1e\\xb9\\xd0\\x89\\x66\\xfd\\x62\\x51\\x41\\x05\\xd9\\xfb\\x8d\\x91\\x41\\x93\\x69\\xdf\\x14\\x12\\x94\\x0a\\x54\\xa3\\x00\\xa0\\x06\\xe1\\x2b\\x0f\\x09\\xfa\\x75\\x17\\x85\\x04\\xad\\x29\\xc2\\xdb\\x43\\x6a\\x2a\\x52\\x27\\x6b\\xa7\\x46\\x36\\x29\\x3b\\x8f\\xa4\\xf7\\x41\\x45\\x62\\x5b\\x34\\x12\\xe8\\x99\\xa3\\x91\\xd8\\xb4\\xea\\x7f\\xaf\\xa1\\x5c\\xfb\\x9c\\x86\\x09\\x8d\\x3f\\x25\\x74\\x45\\xd9\\x0a\\x24\\x37\\x82\\x68\\x15\\x41\\xec\\xec\\x48\\xc3\\x02\\xb2\\x79\\x86\\x16\\xb9\\x22\\x85\\x1c\\x5d\\x24\\xc3\\xa1\\xc9\\x85\\x61\\xac\\x1d\\xf6\\xab\\x44\\xaa\\xf5\\x4e\\x89\\x06\\x59\\xda\\xd7\\xeb\\xda\\x43\\x07\\x27\\x85\\x43\\x8c\\xad\\x69\\x3a\\xd1\\xf4\\xac\\x50\\x19\\x7e\\x45\\x94\\x6d\\xa3\\x7b\\xc7\\x3a\\x79\\xf9\\xf0\\x86\\x29\\x91\\xc8\\xf1\\x12\\x4d\\x54\\x5e\\xed\\x61\\xa2\\x12\\x6f\\xea\\xcb\\xf8\\x49\\x44\\x17\\xff\\x53\\xa3\\x9b\\xe6\\xb9\\xe5\\x63\\xae\\xdc\\x31\\x35\\x15\\xd6\\xdc\\xe0\\xa5\\x6f\\xa0\\xf7\\xaf\\xf7\\xed\\xf1\\x51\\x33\\x6a\\x30\\xfa\\xd7\\x1b\\x3c\\x80\\x7f\\x3d\\xd4\\x80\\x88\\x93\\x33\\x19\\x8f\\x55\\xb0\\x64\\xd4\\xdc\\x46\\x17\\x9c\\x95\\x9e\\x17\\xce\\x26\\x11\\x91\\xf5\\x71\\x15\\x2a\\x46\\xcd\\x48\\xb6\\x42\\xc5\\xa8\\xb5\\xc8\\x37\\x98\\x31\\xea\\x49\\xb0\\xe8\\x39\\x9f\\xa3\\xbd\\x05\\xd9\\x7c\\x72\\xdf\\xbb\\x5e\\x60\\x2e\\x9d\\x19\\xc5\\x35\\x33\\xfe\\xab\\x59\\xb3\\x90\\x17\\xff\\xd5\\x2c\\xe6\\x2f\\x60\\xe3\\x63\\x74\\x66\\x98\\x6d\\xe3\\x63\\x14\\xbc\\xcf\\x82\\xf6\\xd2\\x0f\\x7e\\xa5\\x94\\xe8\\xde\\x0a\\x0d\\x46\\x7e\\x67\\xcf\\xb0\\x51\\x5f\\x00\\x6b\\xbb\\xdb\\x0d\\x66\\xd9\\xa5\\xff\\x1d\\xb7\\xf6\\xdf\\x71\\x6b\\x1f\\x20\\x6e\\x6d\\xd2\\x47\\x9e\\x4b\\x7d\\xe4\\xc9\\xc1\\x6a\\xcf\\x95\\x60\\xb5\\xe7\\x4a\\xb0\\xda\\x73\\x46\\x08\\xa3\\x4a\\xe2\\x3c\\x57\\x33\\x93\\x54\\xc3\\x7a\\x54\\x0d\\x9b\\x11\\xb7\\x76\\xb2\\x47\\xb0\\x5a\\xbd\\x5a\\x32\\x83\\x3a\\x2b\\xa0\\xff\\x09\\xaa\\x22\\x87\\x46\\xa1\\x1b\\xbd\\x63\\xa6\\x3a\\xac\\xc7\\x5a\\xda\\x8b\\x43\\x92\\x4a\\x7f\\xf1\\x7d\\xbf\\x14\\x41\\x92\\xea\\xd5\\x17\\x4f\\x3c\\x15\\x53\\xf4\\x10\\xf1\\x6c\\x05\\x6f\\xf1\\x1a\\xc6\\x7d\\x8b\\xba\\x92\\x51\\x11\\x0d\\xd3\\x58\\xa3\\x61\\x1a\\xeb\\x8d\\x7e\\xc6\\x69\\xa3\\x9f\\xb3\\xb4\\xd1\\xcf\\x65\\xae\\x76\\xe9\\x92\\xb9\\xe5\\xc9\\xb0\\xc7\\x61\\x50\\x90\\x7d\\x8c\\x72\\x1e\\xc3\\x0a\\x67\\xf5\\xc7\\x5b\\xe1\\x54\\x58\\x96\\xb4\\x31\\x8e\\xd6\\x0a\\xe7\\xe5\\x1f\\x68\\x85\\x33\\xd1\\x59\\xe1\\xbc\\xdc\\xdb\\x0a\\xe7\\x8c\\x5a\\xe1\\x84\\xd9\\x56\\x38\\xe6\\x6a\\x57\\x92\\x15\\x8e\\x30\\xc0\\xa1\\xbd\\x8c\\x8d\\x70\\xe6\\x36\\x2a\\x1f\\xb8\\x08\\x16\\xb1\\xde\\xab\\x16\\x1a\\xe3\\x84\\xb2\\xf5\\x0a\\x4c\\x38\\x1a\\x8d\\x8d\\x2b\\x56\\x28\\x1b\\xad\\x9c\\xd0\\x64\\xfb\\xba\\xd1\\xa5\\x7d\\x1d\\x0b\\xeb\\x95\\x09\\xb3\\x5e\\x49\\x01\\xa3\\x44\\xd9\\xb8\\x92\\x28\\x2a\\x5b\\x88\\xce\\x0b\\xf0\\x9f\\x6b\\xbb\\xf9\\x55\\xeb\\x43\\x2f\\xd7\\x04\\x26\\xde\\xc7\\x8a\\x31\\xcc\\x6b\\xe7\\xd5\\x37\\x18\\xc3\\xc8\\x95\\x92\\x37\\x8e\\xf5\\x3a\\x69\\x17\\xf3\\x5a\\xae\\xd4\\x8e\\x7c\\xc4\\xd1\\xc7\\xdd\\x9b\\x82\\x46\\x31\\xaf\\xee\\x63\\x14\\xc3\\x15\\x91\\xaf\\x1e\\xdd\\xb2\\x44\\xaf\\xaf\\xbc\\xa7\\x65\\x09\\x79\\x2b\\xac\\x05\\x92\\x68\\xd0\\x8b\\x18\\x0d\\xda\\x8b\\x66\\xbd\\x71\\x80\\xb9\\x0f\\xe2\\x61\\xdd\\xaf\\xd5\\x58\\xaf\\xfb\\xf6\\xbf\\x91\\xf9\\xc7\\x62\\x1f\\xf3\\x0f\\x91\\x19\\x46\\x50\\x70\\xe6\\x72\\x27\\x2d\\xcf\\x5c\\xe4\\x5d\\xa4\\x53\\x8e\\x77\\x5d\\xb6\\xad\\x88\\x64\\x15\\xf2\\x2e\\x65\\x15\\xc2\\x1c\\x1d\\xbe\\xcb\\xd8\\x8d\\x7a\\x6d\\x83\\x64\\xcf\\xa1\\xec\\x8a\\xbe\\xb5\\x12\\x06\\x1a\\xcc\\x41\\xed\\x8a\\x1a\\x7b\\x4c\\xb4\\x20\\xd8\\xf2\\x84\\x82\\xbb\\x7d\\xdb\\xa6\\x8e\\xc9\\xa0\\x83\\xef\\xf5\\xc6\\x29\\xc2\\xd1\\x6b\\x12\\xe2\\xaa\\x56\\x0b\\x6d\\xc9\\xf6\\x1d\\x3c\\x56\\xcc\\x37\\xd9\\x4e\\x9c\\xff\\xf7\\xb1\\x9d\\x38\\x7f\\x78\\xdb\\x09\\x4d\\x4f\\x1e\\xa1\\x15\\x9d\\x85\\xc6\\xf9\\x1f\\x60\\xa1\\x71\\xfe\\xa7\\x5a\\x68\\x9c\\xff\\x11\\x16\\x1a\\xc0\\x6f\\x20\\x02\\xb9\\x86\\x60\\x89\\x78\\xeb\\x4c\\xc3\\xd1\\x96\\x69\\xe2\\x60\\x0b\\x88\\x8b\\x28\\x4e\\xe4\\x7b\\x88\\x9d\\x81\\x3c\\xa4\\x20\\x4f\\x9b\\x86\\xfd\\xc9\\x42\\x3d\\x81\\x23\\x12\\x71\\x46\\x1f\\x80\\x4e\\xac\\xfe\\x3d\\xb1\\x9d\\xad\\xe3\\x27\\x89\\xad\\xd7\\x6c\\x3b\\x6d\\x61\\x9d\\xd6\\x6e\\x5c\\x55\\x22\\x6a\\xb1\\xcd\\x63\\x9d\\xb3\\xdf\\xe8\\x3c\\xba\\x6d\\x22\\x93\\x42\\xf8\\x5d\\x41\\xea\\x83\\x13\\x8a\\x1d\\xe7\\xea\\xaa\\x8d\\xa3\\xad\\x04\\xd7\\x84\\xfd\\x8a\\x7e\\xd4\\xe8\\x8f\\xba\\xf4\\x83\\x67\\xaa\\x63\\xa6\\xeb\\x66\\x24\\x46\\x36\\x52\\x7a\\x03\\x18\\xb9\\x05\\xd3\\x81\\x9f\\x95\\xfd\\x3e\\x28\\xd9\\x39\\x06\\x2b\\xd1\\xd4\\xe4\\x4e\\x87\\xe6\\xa0\\xa4\\xa8\\x7b\\x1f\\x11\\xfe\\xb5\\x46\\xc8\\x1f\\xd8\\x78\\xf1\\xe0\\x3c\\xa0\\x8e\\xc5\\xf1\\x48\\xa4\\x06\\xae\\xfc\\xc3\\x32\\x2d\\x25\\x61\\x04\\xa1\\x15\\x7f\\x5b\\x55\\x8d\\x2a\\xeb\\x47\\xb5\\xb7\\x56\\x6c\\xb3\\x83\\x1a\\xd3\\x06\\xd7\\x9f\\xca\\x96\\x77\\xa9\\x01\\xa5\\xac\\xe6\\xda\\x90\\xab\\x54\\x7d\\x76\\x1c\\x50\\x25\\x04\\x34\\xa9\\x35\\xf8\\x3c\\x15\\xb6\\x05\\x84\\xad\\x1f\\x4f\\x4c\\xc5\\x41\\x14\\x24\\xb4\\xdd\\xf2\\x1b\\xd1\\x5a\\xf1\\xcb\\x25\\xf8\\xef\\x34\\x36\\x4e\\x68\\x53\\x77\\xdf\\xe5\\x52\\x25\\x91\\x5a\\x83\\xd4\\x06\\xe4\\xfe\\xff\\xff\\x3f\\xf5\\x85\\xcd\\x62\\x84\\x15\\xbc\\x8c\\x11\\xba\\x51\\xb2\\xf5\\xd3\\xb8\\xc9\\x9b\\xbc\\xca\\x73\\xfe\\xdd\\x3c\\xfe\\xdd\\xca\\xcf\\xe1\\x6b\\x35\\xde\\x69\\x10\\x06\\x74\\x7e\\x4a\\x25\\x6a\\xba\\x84\\x5f\\x2e\\xf9\\x45\\xe3\\xf3\\x9e\\x5d\\xe6\\x95\\x11\\xca\\xce\\xd8\\x0d\\xa4\\x7e\\xe5\\xaa\\x92\\xe1\\x3e\\x9f\\x5c\\x56\\x96\\x3f\\xec\\x27\\x17\\x92\\x57\\x41\\x13\\x7d\\xcb\\x67\\xd0\\x8f\\x33\\xf7\\x9b\\xe0\\x67\\xa8\\x44\\x5f\\xa5\\xfc\\xbc\\x51\\xd1\\x7f\\x93\\x64\\xf5\\xd1\\x07\\x7a\\xf7\\xe0\\x26\\x6f\\x64\\x59\\xcc\\x5c\\xed\\xdd\\x3e\\xe6\\x6a\\xcb\\xff\\x5e\\xe6\\x6a\\x8f\\xde\\x1d\\x9b\\xac\\x5a\\xfb\\x2e\\xa7\\xfd\\x4d\\x0d\\x43\\x66\\x88\\x46\\xe9\\xd6\\x49\\x6c\\x76\\x88\\xa7\\x70\\xb4\\x38\\x75\\x64\\xa9\\x76\\xa4\\xd1\\x99\\x24\\x96\\x23\\x37\\x52\\x0b\\xb9\\x91\\x5a\\xca\\x5c\\x6b\\xa2\\xda\\xa0\\x3d\\xe4\\x70\\x7d\\xc3\\x70\\xa3\\x2b\\x88\\xfd\\x88\\x68\\xf6\\xc8\\xc2\\xad\\x20\\xd9\\xae\\x9f\\x1d\\x3d\\x91\\x9e\\x34\\x80\\xcb\\x9d\\x43\\xc5\\x58\\x4d\\x3d\\x71\\x99\\xa5\\x1f\\xe9\\xc5\\xe6\\x69\\x7d\\x27\\xe4\\x3f\\x4d\\x20\\x87\\x58\\x78\\xf0\\xe0\\x96\\x68\\xd9\\x06\\x66\\x13\\x9d\\xa5\\x5a\\xa8\\xb1\\x54\\xbb\\x9f\\x25\\x9a\\xfe\\xcd\\xe5\\x0c\\x85\\xbf\\xd4\\x4c\\x6d\\x61\\x82\\x45\\x2c\\x19\\xa2\\x81\\x43\\x1f\\xa8\\x7d\\x1a\\xfc\\xb3\\x75\\xbe\\x93\\x8d\\xd3\\x62\\xf5\\xff\\x71\\x87\\xe2\\x18\\xd0\\x22\\xf4\\xfc\\xcf\\x36\\x5b\\xd3\\xeb\\xfa\\xcf\\xc9\\x99\\xad\\x31\\x59\\x3b\\xff\\xb7\\xc9\\x9a\\x46\\x15\\x8b\\x4b\\x64\\x6f\\x55\\x68\\xb6\\x9d\\x9b\\xd1\\x60\\x2d\\xdb\\xce\\xcd\\xa8\\xf0\\xfd\\x7f\\xd9\\xce\\xcd\\xa8\\x53\\xce\\xb1\\x73\\x33\\xea\\x57\\x51\\x8b\\xfd\\x33\\x73\\x17\\xb2\\xb7\\xab\\xca\\x87\\xb7\\x56\\x33\\x82\\x0b\\x24\\x40\\xd1\\x7e\\x01\\xad\\x44\\x59\\x0e\\x8a\\xda\\x5b\\xdd\\xfe\\x6f\\x6b\\xb7\\xe2\\xd6\\x6e\\x86\\x20\\x60\\x42\\x09\\x77\\x96\\xab\\x53\\x4d\\xaa\\x3d\\x3d\\xaa\\xf6\\xbc\\x97\\xb5\\x5b\\x12\\xcb\\xe0\\x21\\x96\\xe1\\xe1\\xac\\xdd\\x62\\xb2\\xe1\\x1e\\x76\\x6f\\xe7\\x91\\x56\\xf2\\x5c\\xb5\\x7b\\x3b\\x57\\xed\\xde\\xce\\xf3\\xed\\xde\\xd6\\xb9\\x9a\\xc9\\xb5\\xf0\\xc0\\x6c\\xb4\\x7b\\x5b\\xa3\\xdd\\x9b\\xc6\\x2e\\x2e\\x32\\xa5\\x59\\x67\\xd8\\xbd\\xad\\xef\\x13\\xb1\\x68\\xa1\\x40\\x71\\x97\\xc2\\xea\\xed\\x4c\\x6b\\xf5\\x76\\xaa\\x5a\\xbd\\x2d\\xf7\\xb7\\x7a\\xe3\\x56\\x02\\x97\\xcd\\x95\\xb0\\x7a\\xbb\\x44\\x78\\xf4\\xd2\\x5e\\x5d\\x5d\\x5e\\x3b\\x4b\\xf8\\x27\\x65\\xf5\\x86\\x89\\xb1\\xd5\\x1b\\x3e\\x3d\\xba\\xd5\\xdb\\x1a\\xad\\xde\\xd6\\xdf\\x6a\\xf5\\xf6\\xd2\\x59\\xe7\\x5a\\xbd\\x25\\x16\\xaf\\x62\\xfa\\xf6\\xca\\x79\\xf9\\x0d\\xa6\\x6f\\xe9\\x9a\\x65\\xfb\\xb7\\xd8\\x49\\x5e\\x64\\xed\\xf1\\xaa\\xb8\\xfd\\x5b\\x4e\\x56\\xc9\\xfe\\x2d\\x3b\\x23\\xea\\xe1\\xdf\\x73\\xc9\\x27\\xcf\\xc7\\xa5\\xa3\\x39\\x2d\\x48\\x66\\x73\\x39\\x39\\x15\\xb3\\xb9\\x9c\\xbc\\x19\\x66\\x73\\xe7\\x95\\x2d\\x72\\x0a\\xaf\\x1f\\xda\\x6c\\x2e\\x6f\\xaf\\x67\\x36\\x99\\xad\\x05\\xdd\\x66\\x98\\xcd\\xbd\\xf9\\x23\\xcd\\xe6\\xb6\\xf9\\x66\\x73\\xaf\\xf3\\xcd\\xe6\\xde\\xdc\\xcf\\x6c\\xee\\xe5\\xbd\\xcc\\xe6\\xee\\x6b\\xf2\\x76\\x1e\\x99\\xbc\\x5d\\xfc\\x31\\x26\\x6f\\x6f\\x13\\xae\\x12\\xbf\\xcd\\xe4\\xed\\xad\\x7a\\x83\\x7c\\xb3\\xfd\\xdb\\x6f\\xd6\\xc5\\xd3\\xe3\\xe7\\x09\\x3b\\x9b\\x73\\xb4\\xb3\\x79\\x5d\\xc8\\x64\\xed\\x9d\\x63\\xce\\x97\\x30\\x57\\x7b\\x67\\xb2\\x55\\xfb\\x06\\x33\\xa1\\x5f\\xad\\x73\\x8d\\xf9\\xde\\x45\\xba\\xff\\x45\\x8d\\x2a\\x71\\x91\\x5e\\xb0\\x15\\x66\\xae\\x20\\x32\\x34\\x52\\xb3\\x88\\xb3\\xf2\\x40\\x51\\x15\\x6d\\xea\\xb0\\xff\\x50\\xde\\x22\\x9e\\x8f\\xd5\\xe7\\x6d\\x5d\\x0e\\xef\\x03\\x2f\\x2b\\x17\\xf7\\xb6\\x60\\x5a\\x46\\x16\\x4c\\x1b\\xc5\\x62\\x67\\xf9\\xa0\\x16\\x4c\\x6f\\x9c\\x37\\x0f\\x6a\\xc1\\x94\\x6f\\xb2\\xa4\\xda\\x28\\x2d\\xb5\\x36\\x4a\\xa9\\x11\\xab\\x74\\x93\\x6a\\xb1\\xb4\\xf9\\xe3\\x2d\\x96\\x96\\x0f\\x68\\xb1\\xb4\\xd4\\x58\\x2c\\x2d\\x32\\x2c\\x96\\xce\\xb5\\xce\\xa4\\x62\\x41\\xe8\\xc1\\x9e\\xd6\\x4b\\x31\\xe5\\x72\\x7f\\x3b\\x26\\x71\\x0c\\x3f\\xab\\x69\\x4d\\x9a\\xe4\\xd7\\x7f\\xbe\\x75\\x53\\xd2\\x9e\\x69\\xc5\\xea\\x8b\\xe2\\xe2\\xdc\\xcb\\x9e\\x69\\x9b\\x65\\xcf\\x44\\x23\\xe6\\x34\\x97\\x7a\\x7b\\xa6\\x85\\x6c\\xce\\x24\\x59\\x1c\\xc5\\x01\\x6d\\xbe\\xc1\\x98\\x49\\xb5\\x8f\\xfa\\x1f\\x68\\xc4\\x74\\xfa\\x88\\x66\\x4a\\x0b\\x34\\x53\\x3a\\xbb\\x97\\x99\\xd2\\xe2\\xe1\\xcd\\x94\\xc8\\xb9\\x56\\x86\\xbb\\x21\\xb7\\xf6\\xbf\\x2d\\x98\\x1e\\xd7\\x82\\x69\\xf3\\xed\\x16\\x4c\\xcb\\x7f\\x5b\\x30\\xfd\\xdb\\x82\\x29\\x4f\\xe4\\x9c\\x6d\\xc1\\x64\\x14\\x37\\xff\\xdb\\x12\\xe8\\xdf\\x96\\x40\\xc5\\x2d\\x81\\x0c\\xa1\\x71\\x84\\xe8\\xf5\\xd6\\x96\\x8d\\x82\\x6e\\x15\\xa3\\xa0\\x5b\\xc5\\x28\\xe8\\xf6\\x91\\x2c\\x81\\xfe\\xd7\\x9a\\xeb\\xdc\\x43\\x20\\xae\\x11\\x6e\\x47\\xf9\\x86\\xb1\\xdd\\xc9\\xb1\\xe3\\x38\\x83\\x2b\\x71\\x67\\xbf\\x41\\xdc\\xe4\\x35\\xbb\\x82\\x5a\\xb7\\x8d\\x6d\\x53\\x5c\\xf1\\x18\\x5e\\xaf\\x0f\\xd7\\xdc\\x46\\xba\\xde\\xd9\\x7d\\x2e\\xde\\x6c\\xa3\\xbb\\x9c\\x3d\\xf3\\x1b\\xfd\\x2c\\xfe\\xea\\xe8\\xd6\\x24\\x83\\x00\\x8c\\xbd\\xc0\\x78\\x49\\x2a\\xce\\x47\\x02\\xb0\\x40\\xc8\\xbf\\x68\\x80\\xa3\\x3d\\x06\\xc8\\x07\\xe6\\xac\\x38\\x15\\x43\\x9f\\xf1\\xd3\\xf0\\x71\\xc1\\x8b\\xad\\xfc\\xe2\\xcf\\x19\\xd1\\x24\\x3d\\x22\\x4a\\x58\\xb1\\x61\\xe9\\x3e\\xd9\\xc2\\x40\\x95\\xb1\\xcf\\xb6\\xc8\\x22\\xc3\\xce\\x0a\\xd2\\xec\\x45\\x07\\x28\\x0d\\x88\\xe9\\x4d\\xf2\\x14\\x2c\\xe7\\x31\\x6f\\x2a\\xaf\\xfa\\x73\\x8d\\x58\\x4b\\xa7\\x0c\\xc9\\xf6\\x4a\\xd8\\x25\\xe7\\xb8\\xf7\\x2e\\x8d\\x12\\xdb\\x1e\\xcb\\xf0\\xd2\\xc9\\x90\\xb9\\x31\\xf9\\x36\\x3d\\xc2\\x81\\x1b\\x3f\\x3a\\xaa\\xe3\\x4f\\xfa\\x11\\x76\\x28\\xf0\\xdf\\xa3\\xe4\\xb1\\x5c\\xf2\\x75\\x66\\x49\\x34\\x42\\x30\\x34\\xf9\\x66\\x8f\\x82\\x4a\\x8b\\x6f\\x33\\x0b\\xba\\x40\\x36\\x9a\\x9a\\x7c\\xb7\\x4f\\x49\\xb9\\xcd\\xe6\\x63\\xab\\x7d\\x70\\xf9\\x34\\xcf\\x73\\xd5\\x3e\\xdc\\x32\\xa3\\x98\\x64\\x55\\x1d\\xfc\\x9e\\x76\\x74\\x92\\x15\\x1d\\x8b\\x44\\x86\\x88\\x22\\x2a\\x73\\xf9\\x50\\xb8\\xf9\\xe3\\x47\\x68\\xbe\\x19\\x99\\xa4\\x69\\xcc\\xeb\\xde\\x0b\\x53\\xb9\\x0f\\xc0\\xc6\\x6b\\x1b\\x8b\\x6d\\xf7\\x2c\\x1a\\x39\\x4b\\x78\\x6f\\x3b\\x57\\xd5\\x65\\x54\\x57\\x16\\xdf\\x63\\x8a\\x6e\\xec\\x93\\xf3\\xb1\\x80\\x6e\\x8c\\xeb\\xc4\\xda\\xcf\\x0e\\x94\\x6a\\xe4\\xd0\\xeb\\x9f\\x8a\\x6b\\xbd\\x72\\xb2\\x6e\\xeb\\x7b\\xe4\\x3d\\x2e\\x98\\x97\\x46\\x89\\xad\\x73\\x85\\x54\\x6e\\xc6\\xe3\\x02\\x19\\x51\\x43\\x50\\xa4\\x42\\xcc\\x57\\xa4\\x3e\\x2a\\x74\\x28\\x52\\x21\\xcd\\x58\\xa4\\x46\\x59\\xc7\\xc5\\x83\\x21\\x7c\\x94\\x95\\x95\\xe4\\x9f\\x29\\x75\\xb3\\x1c\\x34\\x19\\xd5\\x24\\x5c\\xaf\\xd2\\xe1\\xa2\\x1c\\x3c\\x39\\xfa\\xec\\x1e\\xfc\\xc1\\x39\\xad\\xba\\x68\\xf4\\x6d\\xd9\\xad\\x8b\\xa7\\xc7\\x8d\\x0b\\xf2\\x45\\x4a\\xf9\\xa1\\x51\\x6b\\x9e\\x72\\x5d\\xce\\x0f\\xe8\\x7a\\x8a\\x91\\x73\\xff\\xb4\\xc9\\xe7\\x58\\x18\\xaf\\x53\\xfb\\x99\\x77\\x56\\x08\\x84\\x37\\x42\\x0a\\xdf\\x05\\x5b\\x27\\x82\\xd6\\x2b\\xc9\\x2d\\x2a\\xe7\\x68\\x28\\x69\\x4c\\x96\\xad\\xe6\\x2b\\x5b\\xf1\\x51\\xd2\\x2a\\x95\\x1a\\xa5\\x03\\x8b\\x12\\xf5\\x07\\xb8\\x8e\\x50\\xa7\\xe0\\xee\\x44\\xf4\\xf6\\x53\\xa4\\xa9\\xa9\\xfa\\xf1\\x54\\x56\\x3f\\xd2\\x34\\x29\\x29\\xf7\\x32\\x33\\x8f\\x3b\\x5b\\xab\\xf6\\x85\\x69\\x1e\\x83\\x48\\xa3\\xb6\\x9b\\xa5\\x9c\\x42\\x5e\\xda\\x4a\\xd4\\xd0\\xb1\\x50\\x98\\xfd\\xb3\\xb8\\x16\\x8c\\x1e\\xae\\x34\\x85\\x4e\\xca\\xd1\\x91\\xb8\\x24\\x69\\x1a\\xde\\x20\\x08\\x50\\x9e\\x3f\\x4e\\xd3\\xc7\\x05\\x9a\\x5e\\xe8\\x9a\\x7e\\x80\\x61\\xb2\\x8b\\x59\\x69\\x6a\\xf9\\x40\\x4d\\x25\\x87\\xa5\\x69\\x6a\\xf5\\x48\\xa3\\xe2\\x77\\xbf\\xd2\\xd6\\xfa\\x91\\x86\\xa5\\x6b\\xeb\\x73\\xce\\xaa\\x0e\\x62\\x5d\\x71\\xa0\\xda\\x15\\xff\\xe8\\xc8\\xfb\\x44\\x3a\\xb3\\xf9\\xf9\\xf0\\xb2\\xa8\\x16\\x96\\xfc\\x24\\xd7\\x24\\x9d\\xd5\\xbc\\xa2\\xd7\\x85\\x2b\\xfa\\x59\\xae\\x48\\x3e\\xa4\\x79\\x4d\\x6f\\x0b\\xd7\\xf4\\x4b\\x6a\\x70\\xc7\\x4a\\x4d\\xaf\\x0a\\xd7\\xf4\\x6b\\x72\\x70\\x6a\\x45\\x6f\\x0a\\x57\\xf4\\x5b\\x6a\\x70\\x6a\\x4d\\xef\\x0a\\xd7\\xf4\\x2f\\xe7\\xad\\x30\\x71\\x7a\\x9b\\x47\\x1e\\xed\\x90\\x06\\x44\\xdf\\x3d\\x26\\x75\\x7e\\xda\\x87\\x43\\x9a\\x80\\x2a\\x7b\\x57\\xfe\\x35\\xa7\\xa3\\x04\\xa5\\x74\\x05\\x19\\x6a\\x18\\x68\\x76\\x77\\x6d\\x37\\xae\\xae\\xc9\\x5f\\x9d\\x77\\xa2\\x53\\xef\\xfe\\xbb\\x74\\xaa\\x39\\x15\\x34\\x9f\\xaf\\xf5\\xaa\\xf0\\x3e\\x2a\\xf8\\x2f\\x03\\xd9\\xb7\\x55\\xc8\\xbe\\x4b\\xa0\\xe2\\x6e\\x54\\xaf\\x0f\\xc9\\x2a\\x3f\\x44\\x55\\xfe\\xb5\\x70\\x95\\xb3\\x2a\\xc7\\x16\\x5b\\xd3\\xd8\\x6d\\x02\\x9c\\xc3\\xba\\xd4\\x95\\x36\\x75\\x1e\\xa5\\xde\\x48\\xa9\\x4b\\x6d\\xea\\x5a\\x9b\\xfa\\x36\\xe2\\x4f\\x60\\x28\\x12\\xeb\\xf9\\x33\\xbf\\x9d\\x57\\x68\\x53\\xa4\\xcf\\xf2\\x1b\\xcf\\xb2\\x46\\xf5\\xbf\\x3e\\xcb\\x4f\\x3c\\xcb\\x02\\xb8\\x37\\x43\\x96\\x5f\\x79\\x96\\x25\\x70\\xa3\\x86\\x2c\\x3f\\xf2\\x2c\\x33\\x44\\x45\\xe9\\xb3\\xfc\\xc2\\xb3\\xcc\\x51\\xa3\\xcd\\x40\\x12\\x05\\x3d\\x1c\\x5f\\x22\\x44\\xe2\\xf3\\xbd\\x3d\\x1c\\x5f\\x32\\x88\\x84\\xda\\x1b\\x63\\x75\\xbc\\x97\\x1b\\x9b\\x6c\\x4d\\xbd\\xfc\\xcd\\xba\\x34\\xf8\\x7b\\xcd\\x6a\\x63\\x5b\\x4f\\x35\\xb2\\xb5\\xc9\\xed\\x03\\x37\\x72\\x9c\\x6a\\xe4\\x36\\x39\\x77\\x72\\x47\\x14\\x83\\x44\\x71\\x90\\x95\\xc8\\x7b\\x71\\x5e\\x1c\\xd6\\x1b\\x87\\xb5\\x3c\\xf2\\x2c\\x54\\x5c\\x48\\x33\\x2f\\xdf\\xe6\\x6e\\x19\\x9a\\xfc\\x70\\xcf\\x26\\xeb\\x51\\x93\\xa7\\x45\\x70\\x28\\x08\\x7b\\x90\\xc0\\x25\\xb3\\xa2\\x1a\\xc7\\x21\\xee\\xe4\\xe2\\x79\\xb3\\xea\\x35\\xe8\\x0a\\xcf\\x54\\x5d\\x61\\x56\\x6b\\xc5\\x6a\\x58\\x15\\xed\\xef\\x08\\x4f\\x9e\\xe2\\x79\\xb3\\xea\\x2d\\xd6\\xb3\\xac\\xd6\\x8a\\xd5\\xb0\\x28\\xda\\xdf\\x09\\x07\\xb3\\x14\\xcc\\x9b\\x55\\x6f\\xb1\\x9e\\x65\\xb5\\xf6\\xcd\\x63\\x33\\x6a\\x89\\xcf\\xee\\xab\\x25\\xce\\xe8\\xee\\x83\\x37\\xb6\\x53\\x91\\x3a\\x45\\x20\\x31\\x1d\\x13\\x08\\xa6\\xcb\\xd0\\x2c\\x3d\\xf6\\xa7\\x8f\\xf0\\x97\\x01\\xfb\\x3d\\x34\\x5a\\xd5\\x8d\\x0c\\xb6\\x73\\xff\\xb1\\x23\\x63\\xa7\\x34\\x0e\\x27\\xe1\\x02\\x7d\\x24\\x90\\x09\\xd6\\xa6\\x37\\xd8\\x4b\\xa7\\xdd\\x68\\xd2\\x66\\x12\\x44\\x08\\xd2\\x2c\\x5b\\x20\\xb9\\xa7\\xb0\\xaf\\x4d\\xef\\x6e\\x6c\\x0a\\x8b\\x4a\\xf9\\x5e\\x96\\x01\\x67\\x52\\x3d\\xcb\\xa2\\x79\\x6f\\x6c\\x1a\\xa5\\x8e\\xe7\\xe5\\x19\\x4e\\x81\\x5f\\x51\\xba\\xb5\\xce\\xc9\\x02\\xb5\\x6c\\x92\\x48\\x29\\x8e\\x82\\x0c\\xed\\x6c\\x6f\\xc5\\x2f\\x10\\x3d\\xa4\\x2f\\x3a\\xb5\\x13\\xc8\\x20\\x72\\x6b\\xc8\\x79\\x13\\xe7\\x64\\xfe\\xf1\\xe0\\xbc\\xcf\\x06\\x62\\x9d\\xe9\\x80\\x58\\xaa\\x21\\xa3\\xc9\\x78\\x90\\xb1\\x5c\\xce\\x4c\\xfc\\x3c\\x76\\xe6\\xf0\\x93\\xb2\\x4f\\xce\\x82\\xff\\x3a\\xa6\\x90\\x08\\xc6\\x09\\x39\\x2b\\xf1\\xf3\\xd8\\x59\\x47\\x30\\x8a\\x8d\\x80\\x51\\xd4\\x9d\\xad\\xf8\\x79\\xec\\xdc\\x4a\\x40\\x8a\\xb3\\x47\\x07\\x52\\x18\\x8d\\xd1\\xb2\\x81\\x14\\xbd\\x74\\xb1\\x5e\\x41\\x20\\x45\\x3f\\x5d\\xb4\\x2f\\x1b\\xe9\\xd5\\xf7\\x36\\x2a\\xe3\\x05\\x8f\\xf7\\x36\\x0b\\xcc\\x86\\x23\\xe8\\x8c\\xb4\\x98\\x11\\x5b\\x2c\\xcb\\xd9\\x1b\\x68\\x92\\x07\\x65\\x38\\x7b\\x44\\x28\\xc3\\xd9\\xfd\\xa0\\x0c\\x67\\x7f\\x02\\x94\\x41\\xd3\\x66\\x01\\x28\\x83\\xce\\x8e\\xd3\\x0c\\x65\\xa0\\xaf\\x48\\x90\\x07\\x65\\xe0\\x19\\x20\\x63\\x3e\\x94\\x41\\xe4\\x21\\x41\\x26\\x94\\x21\\x10\\x50\\x86\\x4c\\x70\\x41\\xd2\\xbc\\xd4\\xa3\\xe6\\xa5\\x5a\\x93\\x38\\xa3\\x79\\xb0\\xde\\x0e\\x19\\xa8\\xcf\\x0d\\xc2\\x07\\xe6\\xec\\xcf\\x82\\xfd\\x59\\xb2\\x3f\\x2b\\xf6\\x67\\x4d\\xff\\x64\\x19\\x12\\xeb\\x31\\x58\\xc8\\x11\\xb3\\xba\\xb7\\xac\\xb6\\x2d\\xab\\x6d\\xcb\\x5a\\xda\\xb2\\x96\\xb6\\xac\\x6e\\x58\\x15\\x3f\\x87\\x33\\xb8\\x57\\xfb\\xfb\\x59\\x10\\x43\\x23\\x71\\x51\\xd6\\x9a\\xfa\\xbc\\x4a\\x3c\\xaf\\xd5\\xe7\\xa2\\x36\\x7f\\x61\\x6f\\xe4\\xc3\\xbd\\x59\\x04\\xd2\\xb0\\x89\\xba\\xbc\\xd1\\xfb\\x1b\\xdd\\x24\\xd5\\xc9\\xf4\\x2a\\xd3\\xaa\\x7e\\x7b\\x64\\x43\\xba\\xec\\xfe\\xd2\\x4b\\xcb\\xfb\\x34\\x43\\x4a\\x1f\\xbd\\x41\\x2b\\x20\\x9d\\xd4\\x24\\xe9\\xf8\\x73\\xac\\xfa\\x97\\x1c\\x72\\x66\\x69\\xd9\\x0a\\xee\\xee\\xae\\xaa\\x2f\\x9e\\xdc\\x6a\\xe2\\x37\\x93\\xdb\\x27\\x56\\x3a\\xb5\\x52\\x7d\\x61\\x6b\\x32\\x5f\\x37\\x02\\xea\\x74\\xf2\\xf6\\xda\\x26\\x23\\x49\\xea\\x72\\x85\\xc2\\x16\\xf8\\x99\\xec\\xd0\\x2c\\xea\\xd0\\xc2\\xa6\\x0c\\x2c\\xfa\\x7a\\x48\\x66\\xba\\x91\\x33\\x5d\\x0b\\x41\\x0c\\x7a\\xe2\\x3c\\x25\\xb5\\x6b\\x69\\xec\\xc8\\x67\\x3a\\x8e\\x33\\x94\\xbd\\x61\\x1e\\x1d\\x45\\x8f\\x4a\\xbe\\xd6\\x95\\xf2\\x58\\xa9\\xd6\\xea\\x4f\\x94\\x14\\xa2\\x54\\x53\\x4e\\xbc\\xaf\\x5f\\x5f\\x37\\xae\\x2a\\x75\\x52\\x97\\x07\\xca\\xdb\\x1f\\xa9\\xed\\x47\\x8f\\x23\\xb5\\x7d\\xe5\\x91\\xd6\\xaf\\xa4\\x10\\xa5\\x9a\\x4a\\xe2\\xbd\\xd4\\x3e\\x95\\x0c\\x9f\\x15\\x76\\xcc\\xc9\\xd7\\x76\\xec\\x8d\\x33\\x9e\\xed\\x6b\\xa4\\x83\\xce\\xee\\x61\\x0c\\x18\\xd5\\x49\\x2e\\x9c\\xf3\\xa4\\x2f\\xce\\x4b\\x29\\x09\\xd5\\x6a\\x2f\\xa1\\x09\\xd9\\x26\\xf0\\x32\\x5b\\x87\\x49\\xc5\\x20\\xf4\\x6a\\xc8\\xe6\\xfc\\xbb\\xb1\\xd4\\xbc\\x1b\\x5b\\x58\\x6d\\xcc\\xde\\xe1\\xb6\\xd5\\xd8\\x5d\\x45\\xca\\x35\\x1b\\x30\\x32\\x11\\xab\\x82\\xd6\\xeb\\x03\\x1e\\x34\\x45\\x74\\x15\\x03\\xbe\\x7e\\x76\\x17\\xbd\\xa8\\xc7\\xfd\\x36\\x37\\xee\\xc3\\x3a\\x2b\\xf8\\xba\\x02\\x74\\x63\\xaf\\x52\\x2a\\x0f\\xec\\x84\\x4b\\x43\\x12\\x8f\\xff\\x2f\\xfa\\x12\\xe5\\xd2\\x81\\xce\\xcd\\xcc\\x6d\\xd2\\xb1\\xca\\x29\\x0a\\xde\\xc4\\x8c\\xf1\\xf2\\x25\\xb2\\x6a\\x95\\x96\\xb3\\x91\\x65\\xac\\xfb\\xff\\x92\\xf7\\xa5\\xdd\\x6d\\xdb\\x5a\\xbb\\xdf\\xef\\xaf\\xb0\\x75\\xfa\\x7a\\x91\\x31\\xe4\\x48\\x6e\\xd3\\xd3\\x4a\\x65\\xbc\\x1c\\xcf\\x89\\x9d\\xa4\\x49\\xda\\x93\\xd4\\x4b\\x2b\\x4b\\x03\\x25\\x51\\xa2\\x06\\x6b\\xb0\\x25\\xc7\\xfa\\xef\\x17\\x7b\\x63\\x20\\x40\\x02\\x24\\x25\\x3b\\xed\\x7d\\xcf\\xfd\\x60\\x4b\\x22\\x01\\x10\\x04\\x41\\x60\\x8f\\xcf\\xe3\\x16\\x2a\\x05\\xee\\x50\\x38\\x53\\x9e\\xc5\\x5e\\x34\\xd8\\xf1\\xd8\\x04\\x38\\x9c\\x0a\\x53\\x0a\\x10\\xab\\x31\\x60\\x49\\x92\\x04\\x78\\x1d\\xab\\x03\\x66\\x00\\x58\\x8a\\x8c\\xc6\\xce\\x08\\x9f\\xd1\\x4b\\x06\\xc1\\x73\\x20\\xe6\\x41\\x0c\\x68\\x09\\x0f\\x49\\xa4\\x25\\x97\\x8e\\x1a\\x3f\\x48\\xef\\xb3\\x89\\x90\\x61\\x0d\\x09\\xb2\\xd3\\x32\\x03\\xb7\\x99\\x56\\xbc\\x67\\x7b\\xbf\\x72\\xf9\\xbf\\x30\\x28\\x91\\x52\\x08\\xb6\\x42\\x27\\xc4\\x2e\\x01\\x42\\x5b\\x28\\xb0\\xda\\xe8\\x05\\xc3\\xc2\\x6e\\xb1\\xf5\\x7c\\x1f\\x2c\\x4d\\xf4\\xab\\xf8\\xc6\\x2b\\x4c\\x64\\x85\\x51\\x54\\x81\\x9f\\x1b\\xcb\\x73\\x13\\xb5\\xb1\\xa8\\x2d\\xd1\\xec\\x7d\\x21\\x03\\x83\\xce\\x8c\\x64\\xd4\\x77\\x06\\x02\\xbd\\x88\\x5e\\x30\\x94\\x80\\x58\\x0c\\xad\\x47\\xc5\\xff\\x33\\xc4\\xe3\\xd2\\x11\\x91\\x85\\x12\\xf8\\x4f\\xe6\\x62\\x0b\\x35\\xff\\xcb\\x02\\xe6\\x13\\x3a\\x12\\xce\\xa7\\x44\\xd8\\x29\\x03\\x0a\\x92\\xb1\\xaa\\x84\\xff\\x09\\x1d\\x5e\\x91\\x8e\\x1c\\x62\\x28\\x49\\x94\\xde\\xbf\\x6b\\x3e\\xc5\\xcc\\xac\\x67\\xdf\\xeb\\xe9\\xfc\\x6f\\x9e\\xb0\\xab\\x04\\x9c\\x52\\x26\\x90\\x92\\x34\\xd8\\xe0\\x47\\x2f\\x03\\x4a\\xa9\\x6f\\x30\\xae\\x84\\x86\\x63\\x03\\xab\\xcd\\x67\\x68\\x45\\x52\\x1a\\x99\\xcf\\x8c\\xe8\\x1a\\xb6\\xb2\\x41\\x33\\x35\\xc3\\xd1\\xd4\\xb7\\xc2\\x33\\x75\\xe9\\x4d\\x5b\\x11\\x9a\\xc2\\xd1\\x1d\\x02\\x34\\x01\\x3e\\x13\\xfd\\x37\\x87\\x24\\xa9\\x5b\\x30\\x34\\xdd\\xd9\\x4c\\x5c\\x1c\\x9d\\x49\\x4b\\xd7\\xe2\\xda\\xd5\\x47\\xaa\\x86\\xc3\\xbe\\xc8\\x7e\\x9d\\x07\\x2d\\x9f\\x45\\xc4\\xe4\\x48\\xe5\\x22\\x7f\\x0b\\x7a\\x93\\x62\\x59\\x81\\x51\\x09\\x61\\x3a\\xbc\\x87\\xc8\\x55\\x4f\\x9f\\xec\\x0d\\x3a\\xa4\\xf4\\x11\\x9e\\x8b\\x32\\x90\\x7f\\x17\\x49\\x38\\x05\\x45\\x90\\xd9\\x12\\x1b\\x54\\xb1\\x44\\x5f\\xd0\\x7a\\x12\\x3a\\xb7\\xc9\\x42\\x30\\xf5\\xe6\\x54\\xd1\\x3e\\xa3\\x5d\\x06\\x1d\\x5d\\x30\\x62\\xf2\\xae\\xd4\\x6c\\x9a\\xe5\\x77\\xb7\\xda\\x58\\xcd\\x2f\\xe9\\x56\\x1b\\xab\\xe9\\x25\\x1d\\xc5\\xc9\\x0a\\x66\\x95\\x8e\\xe2\\x64\\x07\\xb3\\x4a\\x47\\x63\\xca\\xb2\\xf3\\xac\\x6d\\xe6\\x49\\x47\\x71\\xb2\\x82\\x3f\\xa5\\xa3\\x38\\x59\\xc1\\x9f\\x10\\xc5\\xe9\\xf3\\xda\\x79\\x35\\xe9\\xe0\\x4f\\x66\\x56\\x10\\x5a\\x6d\\x5c\\x6f\\xa5\\xd9\\xb0\\xac\\xbc\\x3e\\x20\\x0a\\x9e\\xb4\\xec\\xb7\\x67\\x4d\\xe1\\xb1\\x23\\x38\\xa5\\xdb\\xcb\\x78\\x82\\x62\\x4e\\x86\\xfa\\x3a\\x30\\xd4\\xa7\\x02\\x9f\\x59\\x2d\\x6c\\x56\\x7b\\x85\\x15\\x8c\\x0c\\x56\\x74\\x6b\\xe6\\x56\\xc2\\xd6\\x15\\xe5\\x6e\\xc1\\x5a\\x6f\\xcd\\xd9\\x32\\xd5\\x63\\x59\\x5b\\xb0\\xde\\xad\\x9d\\x65\\x46\\x77\\x87\\xb5\\x93\\xbc\\xd2\\x8d\\x65\\x26\\xcb\\xaf\\x66\\x2c\\x53\\x6d\\x65\\x78\\x86\\x74\\x62\\xb6\\xb2\\xb8\\xa9\\x8c\\x9f\\xa7\\xe5\\x62\\xa6\\xb2\\xa4\\xa5\\x4c\\x14\\x21\\x1d\\xdd\\x52\\xa6\\x1b\\xca\\x3a\\xb9\\x0c\\x65\\xf1\\xbc\\xb1\\x06\\xe6\\x8d\\x99\\x0c\\x65\\xf9\\xac\\x3e\\xe3\\xfa\\xa4\\x1e\\x86\\x7e\\x78\\x34\\x62\\xf0\\x8c\\x33\\x7f\\x9a\\xc7\\x02\\x34\\x8e\\x1e\\x7e\\xd2\\x02\\x24\\xcb\\x8d\\x95\\x4d\\xff\\xd4\\xe9\\xea\\xe1\\x32\\x0d\\x44\\x29\\x08\\xa6\\x6f\\xeb\\x6f\\x9d\\x3a\\xf0\\x63\\x3c\\x3c\\xb0\\x1f\\xb4\\x4b\\x53\\xff\\x34\\x1c\\xd5\\x67\\xec\\xb8\\x2b\\x70\\x95\\x3b\\x18\\x76\\xc6\\xad\\x01\\xa4\\xc5\\x7e\\x73\\xd7\\x37\\xf1\\xbd\\x26\\x98\\x34\\x9c\\x26\\x18\\x0e\\xe0\\xab\\xfb\\xfc\\x57\\x86\\xbb\\x81\\xea\\xed\\xbb\\xb6\\x03\\xe8\\xb5\\xac\\xa9\\x6e\\x52\\x6a\\x12\\xed\\x5e\\xfb\\x04\\x5a\\x90\\x16\\x97\\xeb\\x45\\xb1\\xbc\\x4f\\x5a\\x78\\xa8\\x8a\\x17\\x6c\\x4c\\xe6\\xd3\\xee\\xde\\x12\\x60\\x68\\x5e\\xef\\x8d\\xe9\\x77\\x18\\x6d\\x76\\x93\\xd7\\x70\\x11\\x02\\xa5\\x1c\\xdf\\xad\\xf1\\x83\\x5b\\x22\\x64\\xe5\\x65\\xe9\\xc0\\x39\\x16\\x10\\xb3\\xb0\\x81\\x86\\x75\\xc0\\x16\\x0e\\x86\\x1c\\x97\\xe7\\xc4\\x7e\\xce\\xad\\x98\\x6a\\x32\\x10\\x73\\x53\\x3d\\x76\\xc6\\x25\\x4a\\x87\\x70\\x28\\xa9\\xee\\xa2\\x24\\xb0\\xdc\\x38\\x6c\\x38\\xea\\x5e\\x37\\x25\\xa6\\xab\\x73\\x5d\\x17\\x37\\xed\\x0f\\xc6\\x33\\x06\\x32\\x0a\\xec\\x38\\x96\\xe0\\x29\\xb5\\x3c\\xb3\\xc8\\x41\\x94\\x70\\x1f\\xe4\\x3c\\x5b\\xa2\\x74\\x1f\\xd0\\x2f\\xbe\\xb5\\x02\\x2a\\x36\\x4d\\xe9\\xc1\\x4a\\x9d\\xb0\\x9a\\x15\\x08\\x9d\\x82\\x89\\x1c\\x42\\xed\\xab\\xc4\\x7d\\xca\\x56\\xa4\\xa6\\x50\\x07\\xeb\\xc5\\x64\\xa9\\xb6\\x1f\\xe1\\xf6\\xb2\\xe9\\xd5\\xa4\\xfd\\x73\\x81\\x1f\\xa8\\x55\\x43\\xd3\\x95\\xd2\\xdf\\x65\\x34\\x0f\\xd0\\x5c\\xb5\\x5d\\xaa\\xf0\\x62\\xbf\\x79\\x50\\x6d\\x67\\x07\\xfe\\xff\\xe6\\xe1\\xc1\\x32\\x1d\\x4c\\x21\\xd8\\xb5\\xc0\\xe2\\x85\\x73\\xa1\\x49\\x27\\xe6\\x01\\x88\\xf3\\x15\\xf6\\x10\\x56\\xc0\\x68\\x83\\xad\\x3b\\xdf\\xd8\\x18\\x4f\\x2b\\x7d\\xc2\\x37\\x88\\x70\\xa5\\x3c\\x8d\\x09\\x2e\\xeb\\xb4\\x7d\\xcc\\x97\\x81\\x17\\x93\\x8e\\xc0\\x5b\\xfa\\x96\\xee\\x7d\\xfd\\xca\\x22\\x95\\xbf\\x7e\\xf5\\xda\\x60\\xe0\\xbd\\xe4\\xda\\xd2\\x6d\\x30\\x0d\\x1a\\x41\\x88\\x4c\\x19\\x05\\xe6\\x35\\x2f\\x28\\x0d\\x4e\\x65\\x83\\x4c\\x05\\xa5\\x77\\x75\\x47\\x14\\x6d\\xd4\\x7e\\x99\\x5d\\x4f\\x7a\\xac\\x17\\x74\\x16\\x5d\\x45\\xda\\xd9\\x18\\xf2\\xf0\\xa6\\xa3\\x89\\x05\\x05\\x7b\\x4e\\x2f\\x59\\x9c\\x3b\\x98\\xe2\\xdf\\x16\\x43\\x49\\x5f\\x94\\xb7\\x69\\xfa\\xa2\\x51\\x5b\\x84\\x96\\x98\\x6a\\x18\\xdd\\xd0\\x0c\\xc5\\x1c\\x2a\\xb5\\xce\\xfc\\x2d\\x7b\\xe7\\x09\\x2f\\x01\\x77\\x4e\\x74\\x03\\xa1\\x52\\x21\\x2b\\xa6\\xa6\\xcd\\xaf\\x1f\\xbf\\xfb\\x4b\\xf5\\x97\\xe1\\x39\\xc0\\xa3\\x57\\xba\\x3c\\x8f\\x72\\xc4\\xa0\\x3f\\x62\\xbe\\x40\\x29\\xcf\\x6b\\x1c\\xc0\\x55\\x2a\\x4c\\x6b\\xbc\\x4d\\x98\\xcc\\xef\\x6c\\x26\\xf3\\x16\\xb9\\x05\\x4e\\x82\\x85\\xd5\\x64\\xee\\x63\\x81\\x84\\xc9\\xfc\\x16\\x5e\\xa4\\x06\\x7d\\x30\\xb8\\xb4\\xa1\\x06\\x32\\x85\\xd8\\xbe\\xbb\\x1a\\x10\\xb0\\xc8\\xa7\\x85\\x46\\xb2\\x25\\x60\\xc8\\x75\\x0d\\xef\\xab\\x58\\x8c\\x15\\x83\\x3b\\x51\\xd7\\x74\\x76\\x87\\xbb\\x0d\\x7a\\xb7\\xd1\\xfb\\xb1\\x84\\x59\\x08\\x3a\\x9e\\x08\\xd2\\x87\\x05\\x7a\\x67\\xc7\\x61\\xc7\\x4b\\x04\\x7e\\x7a\\x25\\x5c\\x79\\xbd\\x92\\xcb\\x7e\\x42\\x21\\x30\\x25\\x3b\\xf8\\x0b\\x17\\xf7\\x32\\x2b\\x01\\xff\\x76\\xcb\\xb0\\xae\\xd1\\xda\\xd6\\x95\\xbc\\x29\\x97\\xf0\\xbd\\x5f\\x9f\\x39\\xb0\\x8c\\xbb\\x68\\x39\\x8f\\xde\\x77\\xac\\x7b\\xdb\\xe1\\xaf\\x27\\xd0\\x91\\xc1\\x39\\x46\\x70\\x81\\xc7\\x0a\\xe4\\xc6\\xa5\\x8b\\x69\\x7d\\xe0\\x17\\xe8\\x6e\\xcd\\x19\\x19\\xee\\xbd\\x5b\\xab\\x9d\\xd9\\xb0\\x9b\\x6a\\x0c\\x50\\x87\\xde\\xfd\\x06\\x96\\x66\\x63\\xab\\xe4\\x15\\xe4\\x56\\x28\\x26\\xe6\\x23\\xda\\xb6\\x6a\\x62\\x7e\\x95\\x6e\\x62\\x36\\x34\\xba\\xd5\\xa8\\x37\\xfb\\x00\\x5a\\xc6\\x48\\x9b\\xd7\\xaf\\x4f\\x67\\x8b\\xff\\x98\\xfa\\x83\\x60\\x3a\\x0d\\x86\\x1d\\x06\\xd4\\xca\\x77\\xc5\\xfb\\x8c\\x17\\xb5\\x19\\x99\\xc0\\x9b\\x7a\\xe0\\xf8\\x31\\x39\\x21\\xa7\\xe2\\x19\\xf3\\xf0\\x12\\x35\\x35\\xa1\\xd0\\xac\\x33\\x44\\x6a\\x84\\xc2\\xc7\\x9d\\xc7\\x19\\x42\\xa6\\x20\\xaf\\xc2\\x43\\x2e\\x62\\x31\\x19\\xe7\\x70\\xba\\xe1\\x77\\xeb\\xb7\\xc1\\x68\\xb2\\xd7\\x9a\\xd4\\x3b\\x0e\\xa7\\x44\\xa1\\x5f\\x19\\xcd\\x00\\x99\\x44\\x47\\x0a\\x64\\x1a\\xfd\\x00\\xf6\\x01\\x02\\xb1\\xa5\\x5e\\x5b\\x09\\xd9\\x2b\\xb6\\x95\\x90\\x41\\xf2\\x1a\\xb6\\xba\\x37\\xde\\x75\\x69\\xf7\\xe2\\xf9\\x3e\\x41\\xe9\\xe3\\xae\\x28\\xbe\\xd6\\xaa\\xc7\\xca\\x53\\xde\\x33\\x8c\\x57\\x1c\\xaa\\x4b\\x4e\\xbf\\x37\\x35\\x30\\xe5\\xc7\\x27\\x1f\\x1f\\xe4\\xe3\\x84\\x21\\xfb\\x58\\x01\\xc1\\x32\\x99\\x70\\x54\\x3b\\xe8\\xd2\\x56\\xa6\\xac\\xd8\\x4a\\xf7\\x2d\\x65\\xf6\\x95\\x76\\x6c\\x65\\x7e\\x04\\x18\\xa6\\x93\\x35\\xee\\x9c\\x13\\x4c\\xb0\\x3b\\x8f\\x80\\x9a\\xb6\\x98\\x05\\x11\\x50\\xf1\\x4e\\xe2\\x64\\x14\\xa9\\x65\\xe3\\xc3\\xc6\\x29\\x49\\x4e\\x12\\xc3\\x76\\x12\\x99\\x83\\x17\\x8a\\x99\\xf8\\xae\\xf8\\xeb\\x3e\\x3c\\xc4\\x04\\x83\\x84\\xe6\\x4e\\x60\\xb9\\x8f\\xf7\\x6a\\x18\\x7f\\xf4\\x3e\\xaa\\xb7\\xc7\\x7d\\x0a\\xd8\\xe5\\x06\\xd0\\x47\\x99\\x9d\\x0e\\x74\\xb3\\x8a\\xf7\\x4f\\xdb\\xbe\\xf0\\x82\\x57\\xea\\x05\\xd5\\x17\\x38\\xe5\\x82\\x57\\xb6\\x0b\\x5e\\x25\\x2e\\x78\\x65\\xd8\\x2f\\x85\\x79\\xbd\\x07\\xa7\\x47\\x8f\\x25\\xab\\x1a\\x19\\xc8\\xaa\\x90\\xe1\\xa2\\x52\\xdf\\x83\\xa5\\x9b\\x30\\x2f\\x17\\x76\\x5e\\x73\\x75\\xa1\\x7f\\x16\\xea\\x24\\x64\\x03\\x78\\x0f\\xed\\x27\\xa9\\x2a\\xc0\\xf2\\x44\\x1f\\x4d\\x6e\\x35\\x4a\\xd2\\x4e\\x65\\xf5\\x5c\\x32\\x48\\xc6\\x52\\x3a\\xf7\\xa4\\xf4\\x2c\\x9e\\x53\\x37\\x6f\\x26\\xa7\\x65\\x31\\x56\\x1a\\xcc\\xca\\xe4\\x34\\x55\\xcf\\x9d\\xaf\\x69\\xa8\\x5c\\x64\\xbb\\xaf\\x5a\\x55\\x63\\xa9\\xc9\\xbe\\x34\\xa7\\x38\\xd9\\x40\\xf0\\x64\\x82\\x1f\\x04\\x51\\xaf\\xa0\\x7a\\x7c\\x3e\\xbf\\xd5\\x21\\x43\\x39\\x93\\x0a\\x57\\x4c\\x9a\\xf3\\xc9\\x14\\xc8\\x68\\x0a\\xcc\\xec\\xab\\x32\\xc8\\x14\\xcb\\x48\\x20\\x63\\x60\\xae\\x29\\x0c\\xa8\\xe4\\x1e\\xfa\\x82\\x8f\\x85\\x41\\x55\\xb8\\xf6\\xf7\\xc2\\xfd\\x66\\x9a\\xf1\\xf4\\x69\\x51\\xb5\\x29\\x75\\x5a\\xe7\\x9d\\xe1\\xa6\\xc9\\x6e\\x9d\\xea\\x89\\xde\\x20\\x77\\x1a\\x74\\x86\\xe5\\xbb\\x40\\xd0\\xfd\\x79\\x7c\\xd8\\x78\\xec\\xbb\\x9f\\x24\\x7c\\x4d\\xbc\\x35\\x50\\xff\\x8c\\x87\\x3d\\x32\\xe9\\xcc\\x88\\x6d\\x16\\x30\\x43\\xc1\\x2a\\x7e\\xa5\\x94\\xc9\\x15\\xbf\\xbc\\xe5\\xe2\\x91\\xb8\\xe8\\xae\\xb4\\x35\\x51\\x73\\x56\\xd3\\x35\\xbe\\xf8\\x4b\\xcc\\x73\\x5d\\xfe\\x59\\xf1\\x09\\xc5\\x02\\x7c\\xa5\\x33\\xa8\\x1c\\x79\\x83\\x5a\\xcc\\x0d\\xe4\\xb3\\x8f\\xb6\\x89\\x38\\xa3\\x03\\x40\\x77\\x5d\\x90\\x10\\x02\\xf8\\xd7\\xb3\\x79\\x4b\\x50\\xdb\\x46\\xa5\\x79\\x00\\xff\\x86\\x5e\\x99\\x85\\xf0\\x46\\xbe\\x13\\x2e\\xdf\\xe6\\xf1\\x68\\x98\\x02\\x43\\x47\\xdf\\xdd\\xec\\x6f\\xb5\\x70\\xa7\\x9b\\xfd\\xad\\x16\\x6e\\xb9\\x9c\\xbd\\xa5\\x2b\\xab\\x35\\x24\\xd1\\xea\\x6c\\x90\\xd5\\xd9\\xd4\\xb3\\x36\\x60\\x75\\x3b\\x80\\x90\\xf2\\x89\\xdb\\x37\\xd6\\x35\\xda\\xca\\x8b\\xe7\\xee\\x77\\x22\\x48\\x31\\x6a\\x82\\x07\\x28\\xea\\xe3\\xa1\\x84\\x23\\x76\\xbd\\x46\\xa6\\x3d\\xd5\\xe4\\xb6\\xb0\\x07\\x1f\\xe2\\x29\\xd2\\xcc\\x0a\\x3e\\xe4\\x05\\x68\\xc1\\xec\\xe0\\x43\\x51\\x86\\x34\\x53\\x83\\x0f\\x9b\\xb9\\x6c\\xaa\\x71\\x63\\x7e\\x03\\x8d\\xf9\\x8f\\xb0\\xa9\\x06\\x7e\\x1e\\x1b\\xea\\xb1\\xec\\x40\\x84\\x94\\x7f\\x9c\\x62\\x4d\\x3d\\x16\\x9c\\xd8\\x74\\x43\\x3c\\x1c\\x76\\x42\\xdf\\xe3\\xc6\\x53\\x79\\xc0\\x3d\\x00\\xfe\\x67\\xf1\\x8b\\x20\\xac\\xe8\\x64\\xa6\\x97\\x8d\\x0e\\xb1\\xd2\\xd1\\x6f\\x32\\x7a\\x78\\xa0\\x05\\x82\\xe1\\xd0\\x9f\\x7c\\xa8\\xb7\\x82\\xf9\\x94\\xea\\xe2\\x55\\xa9\\xed\\xab\\xaa\\x13\\xee\\x18\\x5f\\xe9\\x76\\x07\\x1b\\x05\\xa9\\xcb\\x15\\x42\\x3b\\xee\\x35\\x81\\x49\\xd9\\x20\\xeb\\x1e\\x82\\x3d\\xb2\\x49\\x0f\\xd0\\x11\\x45\\xc4\\x7a\\xaf\\x55\\x64\\x4f\\xaa\\x28\\xe6\\xc0\\xa9\\xe7\\x17\\x71\\xda\\x14\\xe5\\x93\\x3e\\x8b\\xcc\\x58\\x54\\xaf\\x73\\xa9\\x46\\x74\\x0e\\x6b\\xdb\\x05\\xfc\\x7b\\x9d\\x80\\xaf\\x09\\xda\\x0e\\xd8\\x19\\x96\\x02\\x98\\x44\\xe0\\xed\\xbe\\xf1\\xce\\x8a\\x67\\xcf\\x5f\\x90\\x4b\\x6f\\xf1\\xec\\x8c\\x5c\\x79\\xa5\\xea\\xd5\\x6f\\x18\\x5c\\xc0\\xca\\x55\\xaf\\x76\\x77\\xdd\\x73\\x66\\xca\\x7b\\x03\\x49\\x80\\xf8\\xed\\xd2\\xad\\xd2\\xe7\\xea\\x6f\\x9d\\xd3\\xf6\\xcc\\x56\\x4f\\x3a\\x6e\\x74\\xa9\\xf4\\x27\\x45\\xfe\\xf9\\xfc\\x85\\xfb\\xec\\x0c\\x31\\x60\\x52\\x6a\\xe0\\x48\\x17\\xf9\\xa7\\xa8\\x81\\xa1\\x93\\x70\\x93\\xb6\\x8a\\x5b\\x89\\x8a\\x80\\x30\\x1d\\xb7\\xf5\\xbc\\x16\\x52\\xe2\\xeb\\x78\\x5c\\x93\\xb4\\x55\\x04\\x7e\\x24\\xd2\\xe7\\x16\\x15\\x63\\x96\\x89\\xc0\\xdf\\x92\\x11\\x57\\x85\\x5d\\x2a\\x72\\xbe\\xf7\\x34\\x71\\x8f\\xfc\\x1e\\xc3\\x97\\xf8\\xe0\\xbd\\xcf\\x10\\x07\\xa1\\x5b\\xd5\\xec\\x42\\x0c\\x46\\xd0\\x2c\\xe2\\x65\\x1b\\x08\\xc8\\xef\\xba\\x98\\x10\\xf8\\x99\\xb8\\x0b\\x27\\x18\\xea\\x51\\xd8\\x3d\\x85\\x4f\\x63\\x13\\xa2\\x4b\\xeb\\x36\\xf4\\xda\\x1e\\xaf\\x77\\xbf\\x4e\\xbc\\x5e\\x17\\xd5\\x92\\x43\\x78\\x21\\x5e\\xd1\\x7f\\x55\\x31\\xe7\\xcd\\xb3\\x1c\\xed\\x78\\x1f\\xa5\\xb1\\x63\\xd2\\x04\\x3b\\x06\\xcc\\x5d\\xf6\\xee\\x3b\\xe7\\xd7\\x57\\x54\\xf7\\xfd\\x94\\x5e\\x60\\xf7\\x85\\x5b\\x9d\\xd1\\x65\\x77\\xbb\\xbc\\xb3\\xe3\\x7c\\x54\\x16\\x13\\x48\\xa1\\xfd\\xa4\\xff\\x76\\xc9\\x6d\\x54\\x52\\x2c\\x52\\x60\\x94\\xfc\\xa4\\xfe\\xa2\\x5a\\x11\\x16\\x50\\x96\\x21\\xe7\\x82\\x75\\x25\\x79\\xcc\\x25\\x1f\\xf7\\x9a\\xa3\\x89\\x3c\\xba\\xb3\\x73\\x87\\x95\\xd5\\x63\\x90\\xef\\xfb\\x29\\x7e\\x04\\x12\\x24\\xf1\\xd5\\xfe\\x08\\x86\\x2a\\xfc\\xf6\\x89\\x21\\x61\\xfd\\x01\\x37\\x1c\\xd6\\x97\\x90\\x9f\\x46\\x9f\\x29\\xe4\\xdc\\x80\\xb9\\x1b\\xed\\xba\\x2c\\x02\\x29\\x1d\\x3e\\x9b\\x2e\\xaa\\x1d\\x88\\xba\\x76\\xab\\x7f\\x50\\x41\\x9a\\xdd\\xd6\\xce\\xce\\x7c\\x67\\x27\\xfa\\x09\\xb9\\xc3\\xf4\\x26\\xc7\\xb4\\xab\\x1f\\xb2\\x15\\x9c\\xc0\\x2f\\xce\\x82\\x19\\x28\\x08\\x71\\xd9\\x36\\x3a\\x23\\x14\\x90\\x34\\xc5\\xc2\\xe0\\xb7\\x55\\xa8\\xc1\\x47\\xc3\\x59\\x71\\x1a\\xdc\\x53\\xad\\x5c\\x5b\\x65\\x9f\\x2d\\x9e\\xed\\x3f\\x77\\xc6\\x82\\x02\\x6f\\x9f\\xaa\\x46\\xe3\\x85\\xae\\xd9\\x94\\xf6\\x7e\\x7c\\xa1\\xea\\x36\\x06\\x4d\\xcb\\xa0\\x68\\x95\\x80\\xec\\x75\\xc2\\xc9\\x5e\\x71\\xa9\\xfa\\xd3\\x4b\\xdc\\x5e\\x32\\x28\\x13\\xb9\\x4a\\xc4\\xb2\\xf5\\x07\\xe0\\x27\\x24\\x2a\\xc9\\xb7\\x30\\x56\\x55\\xe8\\x6a\\xbc\\x6a\\xf5\\xcf\\x84\\x6e\\xf7\\x1f\\x23\\x4f\\xf8\\x67\\xef\\x4f\\xd3\\xca\\x58\\xfd\\x9c\\x7c\\x56\\xbc\\x77\\xe4\\xf3\\xe3\\xad\\x1a\\x37\\x98\\x31\\x6e\\x08\\x6e\\x96\\xc6\\x18\\x33\\x21\\xcd\\xbf\\x4b\\x4a\\x2c\\xdd\\x2b\\x34\\x3a\\xdf\\x5b\\xd9\\xbc\\x75\\x9b\\x48\\x4e\\xea\\x69\\xed\\xee\\x36\\xb3\\x7b\\x6c\\x7a\\x73\\x2f\\xd4\\x9b\\x3b\\x34\\xdd\\x5c\\xc4\\xdc\\x9d\\xb0\\x9a\\xa8\\xfd\\x36\\x91\\x73\\xdf\\x5b\\xc9\\xb9\\x6d\\x4d\\x59\\x56\\x6c\\xdf\\xc0\\xbf\\xfd\\x98\\x91\\xb6\\x71\\x6d\\xdf\\xdb\\xb8\\xb6\\x37\\xbb\\xd8\\x9f\\xe6\\x08\\x59\\xd5\\xbd\\x17\\x70\\x74\\x42\\x86\\xe1\\xfd\\xa7\\x2d\\x5a\\xd6\\x5a\\x05\\xde\\x19\\x3d\\x2c\\x3a\\xa1\\x83\\xeb\\x12\\x64\\x9d\\xe1\\x4b\\xfd\\x99\\x3a\\x3d\\x4c\\xa1\\xa3\\x0d\\x5d\\xd8\\xac\\x8b\\x90\\xdb\\x4f\\x77\\xbe\\x3f\\xc4\\xc2\\xc7\\x54\\x4b\\x8e\\x68\\x18\\xbe\\xa0\\x83\\xd9\\xb8\\x4f\\x7e\\x61\\xdb\\x83\\xb6\\x0d\\xaa\\x1b\\x11\\x10\\x72\\x86\\x74\\x29\\x1f\\x1d\\x38\\x5f\\xe8\\x9e\\x64\\xdf\\x2f\\x0f\\xe9\\x59\\xed\\x00\\x80\\x67\\xf0\\x1d\\x11\\x6a\\xc6\\x76\\xcf\\x5b\\xf5\\x94\\xba\\x41\\x56\\xf0\\x32\\xd0\\x9a\\x5b\\xfd\\x8f\\x51\\x68\\x53\\x41\\x05\\x22\\x52\\xe5\\xe4\\x60\\x33\\xc7\\x64\\x5c\\x74\\x6e\\x64\\x05\\xf7\\xd2\\x27\\x32\\x05\\x3d\\x44\\xb9\\x17\\xef\\x9c\\x0e\\xf3\\x6e\\xb9\\x44\\x74\\xfd\\x81\\x1d\\x7d\\xc1\\x95\\x08\\x4d\\xfb\\xd8\\x55\\xd4\\x96\\xe7\\xfb\\xcf\\x9c\\xf2\\x2f\\xa5\\xe7\\xb8\\xf5\\xbc\\xbf\\x10\\xea\\x44\\x4a\\xf9\\xdf\\x78\\xd1\\x83\\x66\\xd1\\xfb\\xb5\\x54\\x69\\xee\\xd2\\xff\\xba\\x94\\xf5\\x05\\xb1\\xca\\x7c\\x80\\x9c\\x0e\\x5a\\xcc\\x99\\xbb\\x35\\x19\\xcd\\xb8\\x4c\\x88\\x1b\\x4f\\x14\\xe6\\xaa\\xdc\\xc8\\x59\\xf2\\x2e\\xe8\\xa1\\x17\\x99\\x8d\\x17\\x10\\x65\\x5c\\x4f\\x7a\\x88\\xf3\\x09\\x17\\xfe\\xd5\\x6e\\xb7\\x0b\\xfa\\xcb\\x27\\x0f\\xb2\\x41\\x9f\\x2c\\x0a\\xe4\\x47\\xf9\\x63\\x09\\x3f\\x94\\x66\\xb9\\x90\\x60\\xda\\xed\\xa7\\x07\\x79\\x86\\x4b\\x23\\xc2\\xae\\x44\\x12\\x42\\xac\\x47\\xa5\\x52\\xa9\\x20\\x0c\\xcd\\x7f\\x81\\xcd\\xe9\\x07\\xaf\\xfc\\x13\\xf9\\x4a\\xff\\xd1\\xb1\\x69\\x98\\x62\\x7a\\x95\\xd0\\x65\\xf0\\x0d\\x3d\\xff\\xea\\x3e\\xfb\\x8a\\x52\\xae\\x76\\xa2\\x5c\\x7b\\xfe\\x83\\xfb\\xec\\x87\\x15\\x9d\\xb7\\x71\\x9e\\xdf\\x23\\x52\\x00\\x6d\\x22\\xb4\\xca\\xd0\\xff\\x9d\\x73\\x30\\xd7\\xe4\\xab\\xb2\\xe0\\x96\\x78\\x73\\x55\\x64\\x79\\x41\\x99\\x94\\xbd\\xcb\\xbe\\x57\\x6f\\x38\\x2d\\xb7\\xfa\\xd7\\xb5\\x0f\\x8e\\x73\\x88\\x5a\\x2a\\x7a\\x3f\\xb8\\xe4\\xaf\\x6b\\x3c\\x0e\\xae\\xf6\\x95\\xc1\\xe4\\xcd\\x39\\xf7\\xa9\\xfc\\x93\\xb0\\x6d\\x6f\\xa5\\xcc\\x38\\xc3\\x2c\\x78\\xcc\\x24\\x5c\\x19\\x9c\\x63\\x6c\\x81\\x52\\x2c\\x1c\\x45\\xcd\\x80\\x01\\x84\\xed\\xe2\\x79\\x91\\xa6\\x57\\x28\\x20\\x8c\\x29\\x1f\\x92\\x87\\x87\\xe1\\xcb\\x06\\xc7\\x23\\xa5\\x67\\x38\\x05\\xce\\x80\\x73\\xd8\\xf4\\xfd\\x65\\xa1\\xd2\\xf4\\xda\\x02\\x6f\\x57\\x65\\xaf\\xc1\\xea\\x70\\xb6\\xe7\\x74\\xc4\\x79\\xad\\xc0\\xd8\\x9f\\xc0\\x63\\x60\\x45\\x64\\xf4\\xd7\\x56\\x73\\x85\\x14\\x35\\x1a\\x67\\x0b\\xcc\\x69\\x03\\x3b\\x4b\\x66\\x6a\\x40\\x0b\\xd9\\x95\\x7d\\xfc\\xdf\\xb6\\x06\\xf4\\x77\\xac\\x01\\xfd\\xdd\\x8c\\x64\\x82\\xc0\\x66\\x3a\\xee\\x19\\x78\\x8f\\xfb\\x10\\xa3\\x11\\x42\\x00\\xc7\\xc0\\xc3\\x91\\x23\\x43\\x6f\\xaf\\xb4\\x0f\\xe4\\x2b\\x65\\x32\\x86\\x7f\\x9c\\x7c\\x05\\xb9\\x57\\xca\\x82\\x7b\\x85\\x05\\xf5\\x03\\xbd\\x72\\x89\\x2c\\xbc\\xbd\\x17\\x64\\x09\\xbb\\xec\\xfd\\x3f\\x4d\\x9f\\x2c\\x15\\x64\\x0b\\x09\\xc7\\xbd\\xc9\\xe0\\x7d\\xff\\x14\\x06\\x6f\\x2a\\x13\\x4c\\xd9\\x6b\\xbd\\x36\\x41\\xeb\\xdf\\x6a\\x2b\\x47\\x60\\x83\\x54\\x9a\\x06\\x6b\\x98\\x3c\\x2a\\xa4\\x6b\\x93\\x3b\\x60\\xad\\x77\\xed\\x36\\x9c\\x5d\\x37\\xf2\\x17\\xd7\\xa9\\x4f\\xdd\\x89\\x4f\\x7b\\x1d\\x5a\\x03\\xb6\\xad\\xb6\\xf5\\x1c\\x94\\xbb\\xd6\\x60\\x6f\\x6b\\xc0\\xb6\\x35\\x60\\xde\\x1e\\x51\\x6e\\xf5\\x3c\\x88\\xa5\\x6f\\x7d\\xce\\x63\\xb9\\x50\\x6e\\x12\\x69\\x9f\\x5a\\xd1\\x1e\\x6a\\xaf\\x98\\x59\\xd6\\x67\\x5a\\x1e\\x0d\\xe7\\xb3\\x0f\\xa0\\xea\\xad\\x1d\\x3a\\xcf\\xc4\\x86\\x77\\xf3\\xd9\\x34\\x68\\xad\\x9f\\xa4\\x81\\xb5\\x3f\\xce\\x87\\x0d\\xbf\\x3e\\xb8\\x44\\xd3\\xcf\\xfa\\x54\\x21\\xd0\\xf7\\xb5\\x29\\x51\\x3a\\x93\\xd1\\xdd\\xbb\\xe1\\x39\\xac\\x64\\x6b\\x47\\xc9\\x4b\\x53\\xc7\\x9a\\x77\\xdd\\x80\\xbb\\x6e\\x10\\xdd\\x3d\\x14\\x6f\\x8c\\x3b\\x89\\xb4\\x61\\x8d\\x7c\\x44\\xe2\\x7e\\x9f\\xee\\xfa\\xc9\\xe6\\x32\\x7b\\x80\\x67\\xd6\\x7b\\x71\\xd1\\xb1\\x13\\xbf\\xb4\\xd2\\x0e\\xbf\\xa6\\xb2\\x24\\x68\\x57\\xdc\\xd0\\x27\\x66\\x26\\x8a\\xb3\\xb9\\xc7\\xcc\\xa5\\x33\\x3c\\x65\\xe6\\x4a\\x59\\x4e\\x33\\x73\\x2d\\xa3\\xff\\xcc\\x9a\\x68\\x62\\xc4\\xd4\\x01\\x09\\x02\\x0e\\x20\\x71\\x47\\x96\\xf7\\x2d\\xee\\x31\\x6d\\xa0\\xc7\\xd4\\x08\\xfd\\xc1\\x96\\x7a\\xda\\xd1\\xf5\\x12\\x65\\x1e\\x1e\\x50\\x68\\x59\\xc3\\x7d\\x97\\x9b\\xdc\\xc3\\x8f\\xde\\x53\\xe9\\xc3\\xbb\\x11\\x7c\\xd6\\x4d\\x40\\x8a\\xd6\\x95\\x6e\\x2e\\xa8\\xf7\\x33\\xe9\\x16\\xfa\\x4c\\xf9\\x1a\\xda\\x19\\x13\\xfa\\xa4\\x0d\\xf4\\x77\\x76\\x90\\x69\\x28\\x60\\xe3\\xb3\\xee\\xe7\\xa4\\x6d\\x20\\xa1\\x60\\xad\\x46\\xf2\\xee\\x04\\x6b\\xf5\\x84\\x1e\\x55\\x58\\xab\\xc3\\x88\\xf1\\xcc\\xcf\\xc9\\x5a\\x3d\\x60\\x23\\x72\\x53\\x1d\\x08\\xd6\\xea\\x1b\\xa0\\xc4\\x0c\\xdd\\xc1\\xf5\\x4d\\xcd\\x0b\\xe9\\xbf\\x04\\x6b\\x35\\x1c\\x8c\\x58\\xab\\xe1\\x17\\xb2\\x56\\x53\\x89\\x7f\\xdb\\x17\\xfe\\x3e\\x29\\x0b\\xc7\\x78\\x08\\xfa\\xc0\\x43\\xd0\\xcf\\xc7\\x43\\x30\\xf3\\xfa\\xf6\\x48\\x5f\\x3e\\x49\\x64\\xe4\\xa0\\x5f\\x03\\x18\\xb2\\xd9\\x66\\x4e\\x34\\x13\\x8d\\xf4\\x2d\\x6d\\x4c\\x8d\\xe7\\x9d\\x67\\xba\\xc4\\x38\\xfe\\x7b\\x46\\x41\\x8d\\xb5\\x39\\xa0\\x6a\\x62\\x81\\x2e\\x3f\\x05\\x20\\x30\\x39\\x70\\x5a\\x1c\\x11\\x7a\\xe8\\x02\\x44\\xba\\xd3\\x04\\xbe\\x12\\x40\\xb2\\xc9\\x60\\x66\\xf6\\xf9\\x0c\\x6a\\x41\\xd4\\x3f\\x42\\xa3\\xb7\\x54\\x68\\x74\\x3c\\xa6\\x1c\\xca\\x9c\\xb5\\xa9\\x97\\xcc\\x64\\x2a\\x6e\\x47\\x9c\\xcc\\x15\\x8e\\x8f\\x06\\x77\\x07\\x0a\\xb1\\xe8\\xc2\\x48\\xbb\\xbf\\x36\\x5b\\x4e\\xa1\\xd7\\xec\\xf6\\x5d\\x2c\\xcb\\xbf\\xbf\\x1c\\x3e\\xdf\\x57\\x7e\\xd3\\x5f\\x2e\\x19\\x16\\xa3\\xb2\\xb2\\xbe\\x7a\\x68\\x8d\\x21\\xcb\\xf0\\x16\\x0e\\x39\\xa2\\x27\\x36\\x9a\\x91\\xb3\\x10\\x79\\x3a\\xa3\\x31\\xa0\\x8b\\xbd\\x7c\\xa6\\xf2\\xee\\xab\\x8c\\x54\\xff\\x36\\xee\\x3b\\xd1\\xba\\x08\\x53\\xba\\xaa\\x27\\xfe\\xdf\\xf1\\x5e\\x43\\x96\\xcb\\x66\\x44\\xb7\\xa1\\x24\\xba\\x1d\\x6b\\xb4\\xaf\\x61\\x8c\\xe8\\x76\\xfc\\x48\\x9e\\x57\\x7f\\x7d\\x9e\\xd7\\xd0\\xcc\\xf3\\x1a\\x63\\x64\\xbd\\x89\\x69\\xf7\\x47\\x36\\x02\\x56\\x4f\\xdd\\x50\\x30\\x5f\\x2d\\x81\\xd0\\xa7\\x32\\xb4\\x46\\xb0\\x7c\\x6d\\x2b\\x18\\xe4\\x3e\\xb7\\x0f\\xec\\x97\\x56\\x66\\xcc\\x47\\x7c\\x95\\xa9\\xba\\x6e\\xd1\\xed\\xc3\\x04\\x1d\\xaa\\xa4\\x57\\xc5\\x8f\\x11\\x50\\x97\\x32\\x60\\xc7\\xa7\\xcc\\xb2\\x77\\xab\\x3e\\xe7\\x0a\\x3d\\x11\\x98\\x6c\\x65\\x77\\x6d\\x0e\\xd2\\xa6\\x5a\\x4a\\x32\\x89\\xe2\\x4c\\xbe\\x31\\xea\\xf1\\x63\\xd7\\x0c\\x3f\\x90\\x10\\x1b\\xd6\\x22\\x14\\x05\\x1a\\xd1\\xe9\\x1a\\x34\\xa2\\x8f\\x20\\x09\\xad\\xca\\x3b\\xdf\\x88\\x09\\x54\\xe5\\xfc\\xd4\\xf9\\x40\\x73\\xd0\\x7e\\xfa\\x66\\xda\\xcf\\xb4\\xae\\x58\\x00\\x5d\\x7d\\x1d\\xd0\\x35\\xa5\\x05\\x2b\\xc6\\xaa\\xbf\\x39\\xed\\x27\\x27\\xf7\\x6c\\xa9\\x98\\x05\\x63\\xfa\\x03\\x62\\xb4\\x9a\\x0a\\xfa\\xa4\\xff\\x14\\xf6\\x9d\\x74\\x8c\\x45\\xab\\x09\\xe2\\x11\\x38\\x92\\xec\\xf6\\xde\\xf3\\xd1\\x59\\xdb\\x80\\x91\\x87\\xe0\\x72\\x63\\x78\\x47\\xff\\x3b\\xc2\\x3b\\xfa\\x9b\\xc1\\x3b\\xfa\\xff\\x00\\xbc\\xa3\\xe1\\x9a\\x8d\\x4c\\xa5\\xc8\\x82\\x65\\xd8\\xe2\\xf4\\x1c\\x7d\\x78\\x8f\\xc4\\xd7\\x1c\\x34\\x91\\x66\\x03\\x04\\x11\\x3a\\xcb\\x28\\x5b\\xbb\\x35\\x59\\xb4\\xec\\x11\\x9f\\x78\\x4a\\xca\\x45\\xd6\\x88\\x4f\\x5e\\x80\\x16\\xcc\\x8e\\xf8\\x14\\x65\\x48\\x3b\\x35\\xe2\\xb3\\xcd\\x35\\xd6\\x34\\x96\\xc7\\x66\\x2e\\x35\\x70\\xda\\xc4\\xcd\\x28\\x8f\\x16\\x78\\x25\\x87\\xe9\\x9d\\xd4\\x02\\xaf\\x52\\x22\\x39\\xaf\\x1c\\x74\\x60\\xbd\\x05\\xe3\\xf8\\xf6\\x2d\\xd7\\x55\\xb6\\xcb\\x55\\x96\\x8c\\x2d\\x39\\x1a\\x1a\\x76\\x26\\x26\\x0b\\xab\\x58\\x04\\x99\\xc4\\xc0\\x8c\\xa8\\x80\\xc1\\x30\\x8c\\xf8\\x56\\x72\\x0d\\x02\\xe7\\x6e\\xd9\\x2f\\xc6\\xfc\\x01\\x04\\x04\\x52\\xd3\\x71\\x3a\\x58\\x04\\x12\\x39\\xd3\\xe8\\x60\\xb6\\xee\\x9c\\xfa\\xf5\\x4f\\x35\\xdc\\x8e\\x21\\x98\\x87\\xde\\xd9\\x25\\x15\\xb8\\xe9\\x72\\xff\\x8d\\x45\\x61\\xd6\\x75\\xa5\\x8c\\xde\\xa8\\x38\\xf2\\xdb\\x8f\\x54\\x54\\xab\\x33\\x07\\xfb\\x75\\xa8\\xa4\\xc1\\x15\\xa9\\xa8\\x33\\x88\\xfd\\x66\\x92\\x0a\\xfd\\x57\\x43\\x2a\\xc8\\x58\\x9d\\x72\\x6d\\x57\\xab\\xc3\\x7e\\xa7\\xd7\\x49\\x5e\\x27\\xbb\\x4e\\xf2\\x3a\\xb1\\xbe\\x29\\x21\\xb3\\x1d\\x7f\\x34\\xa0\\x5b\\x57\\xb8\\xec\\xd0\\x11\\xbb\\xbe\\x2e\\x96\\x4b\\x84\\xfe\\xd5\\x08\\x7e\\x0b\\x76\\xf1\\x6b\\x77\\x37\\xf6\\x1d\\x4a\\xd4\\x40\\x5c\\x14\\x0d\\xdc\\x4a\\x28\\xcf\\x18\\x80\\x42\\x94\\xda\\xce\\x02\\x3f\\xe8\\x92\\x10\\x52\\x09\\x92\\xce\\x63\\xb6\\xf5\\x57\\xea\\x90\\xa7\\xbe\\x5f\\x23\\x48\\x93\\xc9\\x7e\\xfd\\x08\\xf9\\xf4\\xd5\\x3f\\x74\\xc1\\x1f\\x4e\\x23\\x56\\xde\\xd4\\x98\\xf6\\xa5\\x29\\xc5\\xbe\\xb7\\x5e\\x65\\x14\\x23\\x40\\x31\\xf4\\xfc\\x84\\x6e\\x3c\\xbd\\xed\\x54\\x34\\x7c\\xbc\\x96\\x39\\x01\\x10\\xa4\\x27\\x68\\x67\\x67\\x87\\xbd\\xf0\\x48\\xb3\\xc9\\x19\\x12\\x0a\\x57\\x85\\x5d\\x7e\\xa4\\x47\\xbb\\xe2\\xd0\\x05\\xda\\xdd\\x2d\\xfc\\x55\\xa8\\x14\\xae\\xb6\\x4a\\x5b\\xa5\\x08\\x5b\\x2c\\xb0\\x44\\x88\\xb0\\x2c\\x22\\xc4\\x09\\x8c\\x90\\xf3\\x14\\x64\\x41\\x63\\x1d\\x89\\x35\\x08\\xe5\\x68\\x45\\xe6\\x41\\x85\\xa9\\xff\\x6a\\x67\\xa7\\xad\\xbb\\xd3\\x39\\x37\\xed\\x3e\\x15\\xe8\\xf9\\x9f\\xab\\x39\\xdc\\x8b\\xa3\\x71\\xbd\\x89\\xc9\\xe3\\x7b\\x3f\\xc5\\x42\\x06\\xa2\\x53\\xe5\\x44\\x30\\x81\\x68\\xb6\\x44\\x9b\\x64\\x7f\\x10\\xd5\\xe8\\x7e\\xfb\\x43\\x03\\x5a\\x64\\x8f\\x07\\xba\\x39\\x8d\\x3f\\xc9\\x3e\\x7d\\x92\\xea\\x93\\xe8\\x24\\x70\\x1d\\xb5\\xca\\xba\\xd5\\x44\\xc1\\x82\\x14\\x82\\xa2\\xe9\\xe9\\x1a\\x21\\x23\\x6d\\x4f\\x41\\x0c\\xe6\\x2a\\xd6\\x46\\x30\\x69\\x86\\x51\\x7c\\x6e\\x73\\x91\\x9d\\x91\\xda\\x5c\\x66\\x67\\xa4\\x4e\\x0a\\xe4\\x88\\x85\\x7c\\x0e\\x63\\x38\\x5c\\xb0\\x34\\x0b\\x03\\x52\\x89\\xfb\\xde\\x1b\\x92\\xaf\\xb6\\x06\\x4f\\x59\\xee\\x3e\\x2d\\xe1\\x79\\x6f\\xf1\\x15\\xf9\\x9a\\xb3\\xd2\\xd6\\xaa\\x3e\\xdb\\xa1\\xbd\\x9e\\xd3\\x92\\x5c\\xaf\\x20\\x0e\\x2c\\xe8\\xe2\\xec\\xc3\\x97\\x25\\x5d\\x9c\\x7d\\xf6\\x2c\\xda\\xde\\xef\\x7b\\x43\\xba\\xef\\x38\\x68\\x59\\x7b\\x05\\x19\\x98\\xc1\\xb0\\x73\\x14\\x42\\xea\\xf1\\x07\\x78\\x98\\x90\\x97\\x71\\x47\\x65\\xd0\\xd1\\x1d\\x13\\x7a\\x99\\xb3\\xec\\xe1\\xa1\\x35\\x6a\\xce\\x41\\x80\\xde\\x13\\x5f\\x4e\\x98\\x40\\x4d\\xb7\\xaf\\xc9\\x28\\x0c\\x3f\\xd1\\x6d\\x38\\x50\\x2b\\x7e\\xce\\x59\\xf1\\x92\\xee\\xa2\\x54\\x91\\xfc\\x86\\x9b\\x2a\\x60\\xe3\\xf9\\x82\\x7e\\xd7\\x75\\x85\\xa1\\x21\\x10\\xf8\\xa3\\x74\\xd5\\x82\\x5d\\x7f\\xe0\\x8c\\x63\\xc5\\xc0\\x08\\xd1\\xe5\\xd0\\xa4\\xe5\\xd2\\xaa\\xda\\x74\\xbe\\xb1\\xb5\\xc8\\x17\\x4b\\x54\\x0b\\xa3\\x98\\xfb\\x44\\xe1\\x02\\xae\\x88\\xc1\\x62\\xeb\\x96\\x38\\x86\\x3f\\x50\\x2d\\xf2\\xcd\\xd1\\x77\\x54\\x9c\\xa6\\xcf\\xef\\x8d\\x16\\x7f\\x27\\x52\\xd7\\x4c\\x31\\x74\\xb1\\xf2\\xc2\\xcb\\xac\\x67\\xbb\\x25\\x92\\xef\\xb4\\x3a\\x52\\x07\\x4b\\x4f\\x91\\x33\\xd4\\x99\\xcf\\x60\\xb7\\xc4\\xac\\x02\\x7d\\x3d\\x85\\xf4\\xdb\\xb1\\x21\\x7c\\x15\\x8f\\x27\\x0f\\xe3\\xa8\\x14\\x5c\\x4b\\x3c\\x22\\x9f\\xcc\\x0f\\x0f\\xdb\\xca\\xfc\\x4d\\x99\\xda\\x44\\x99\\xc7\\xcd\\x5a\\xf5\\x4d\\x2c\\x96\\xd1\\xf8\\xec\\xae\\xd9\\xec\\x68\\xd2\\x07\\xce\\xa6\\x03\\x61\\xf3\\x80\\x1d\\xa0\\x4f\\xbe\\x96\\xf9\\x70\\x9b\\xab\\xb4\\xe7\\xf4\\x64\\x77\\x11\\xc5\\x49\\x7e\\xff\\x1b\\x31\\x07\\xff\\x3e\\xd5\\x9d\\x28\\x91\\xbc\\xdf\\xed\\x56\\xb8\\x82\\xd2\\xe3\\xcc\\xd1\\x29\\x13\\xfc\\x89\\x6f\\x0b\\x62\\x78\\x13\\x77\\xb5\\x7e\\x77\\x71\\x69\\xff\\x3d\\x81\\xaa\\xf2\\xc1\\x0e\\x44\\xfe\\x3b\\x00\\x91\\x7f\\x4c\\x01\\x22\\xff\\xdd\\x04\\x44\\xfe\\x3b\\x18\\x05\\x0c\\xb6\\x1d\\x54\\x24\\xb9\\x94\\x6e\\x82\\x51\\x91\\x06\\x9a\\x28\\xa7\\xfb\\x93\\x77\\xbc\\xb3\\x73\\xb2\\xb3\\x73\\x7e\\x70\\x5d\\xab\\x58\\xd5\\x80\\x4c\\x25\\x40\\x6e\\xaa\\xdf\\x16\\x15\\x86\\x01\\x4b\\x96\\x15\\x86\\x02\\x4b\\x20\\xc6\\xbf\\xc2\\xa0\\x57\\x57\\x4c\\x5c\\x97\\x00\\xdb\\xc7\\x2a\\x8a\\xfa\\x27\\xfb\\x45\\x17\\x2b\\x1d\\x51\\x5d\\xc8\\xc6\\x0b\\x00\\x55\\x2a\\xd5\\x0e\\x4e\\x1f\\x1e\\xae\\x9d\\x0f\\xcf\\x96\\xbb\\x1f\\x30\\x40\\x2b\\x09\\xdd\\x4a\\x1f\\x42\\xf1\\xc3\\x33\\xa7\\xbc\\xbb\\xb4\\x15\\xa8\\x55\\x4e\\x11\\x52\\xfd\\x03\\x15\\x84\\x07\\xa2\\x7f\\x27\\x39\\xfb\\xb7\\x5c\\xa9\\xd8\\xe9\\x02\\x05\\xe6\\x8c\\x36\\xf8\\x11\\x01\\x60\\x86\\xa2\\xc1\\xf3\\x9c\\x0d\\xc2\\x98\\x45\\x6d\\xce\\xa3\\x36\\x2f\\x1e\\x1e\\xde\\x03\\x5d\\x77\\x2a\\x18\\xfa\\xc3\\xc3\\x20\\x76\\x7a\\xa0\\x9e\\x7e\\x12\\x24\\xf5\\x38\\x52\\x7a\\x1c\\x49\\x3d\\x8e\\xb4\\xae\\x22\\xb9\\xa7\\xf6\\x6e\\x67\\x47\\xfe\\x1c\\xe8\\xd7\\x1f\\x24\\xae\\xaf\\x1d\\x21\\x83\\xc4\\xf5\\x07\\xe6\\xeb\\xb3\\xc4\\x44\\xad\\xf3\\xae\\x72\\xdb\\x7a\\xb1\\x41\\xac\\xd8\\x20\\x5e\\xac\\xe9\\x35\\x1f\\x1e\\x42\\xd0\\x9e\\xe8\\xb8\\xd3\\x75\\x06\\xc2\\x00\\xab\\x2c\\xaf\\xe7\\x77\\xab\\x33\\x8f\\xab\\xfa\\x1a\\x54\\xcf\\x9f\\x54\\x3a\\x5e\\xdf\\x97\\xc7\\x5b\\x52\\x93\\xe2\\xfa\\x90\\xa5\\xf2\\x67\\x1c\\x20\\xfe\\xb3\\x72\\x08\\xbc\\x7d\\x5f\\x14\\xb5\\x0a\\xbc\\x7d\\x7f\\x68\\x41\\xdc\\x80\\x75\\x12\\xfa\\x7c\\xb3\\x27\\xaf\\x21\\x33\\x20\\xd5\\xc7\\x27\\x84\\x88\\xac\\x72\\x9a\\xf2\\x46\\xfe\\xd8\\x08\\x6d\\xfe\\x3f\\xd9\\xf8\\xf0\\x7e\\xab\\xe3\\x0b\\xe9\\xbe\\x9f\\x40\\x86\\xd7\\x15\\x16\\xad\\xac\\x05\\x13\\xfe\\x43\\x1c\\x3f\\xfb\\xe3\\xcb\\xd2\\xc1\\xc7\\x4a\\x89\\x0e\\x63\\x52\\x7f\\xbb\\x8f\\x90\\xe1\\x63\\x6d\\x33\\x4c\\x78\\xf2\\xd6\\xdb\\x2e\\xf1\\x48\\xe7\\xf5\\x44\\x31\\x3b\\x34\\xbc\\x99\\x51\\xb3\\xef\\xd3\\xa5\\xa9\\xfa\\x97\\x71\\x5a\\xd9\\xd4\\x3e\\xbf\\xf8\\xb3\\x45\\x59\\xc4\\x53\\xe4\\xaf\\x44\\x16\\xd3\\x5f\\x76\\x6c\\x70\\x55\\xd9\\xc2\\x9b\\xc0\\x29\\x8b\\xbb\\x10\\xd7\\xbb\\xe2\\xd9\\x3a\\xc6\\xfb\\xc0\\x73\\x2b\\xb8\\x52\\x3c\\x88\\xfb\\x1d\\x29\\xf0\\x37\\xa0\\xb2\\x15\\x8d\\x9e\\xaa\\x0c\\x1b\\x0d\\x48\\x3d\\xee\\xcc\\x89\\xab\\xb8\\x6b\\x14\\x36\\x69\\xca\\x31\\xe5\\xfa\\x05\\xdb\\x64\\x7f\\xf0\\xfe\\x8a\\x9b\\x29\\x54\\x41\\xda\\xfa\\x50\\xb3\\x36\\xdb\\x6b\\xfa\\x3d\\x8f\\xa5\\xac\\x24\\x2c\\x65\\xd5\\x1f\\x6c\\x64\\x01\\x96\\x11\\x53\\xfa\\xc2\\xbc\\x34\\x29\\x03\\x66\\x28\\xbb\\x2e\\x12\\x4a\\x13\\x10\\xd1\\xa1\\xbb\\xa0\\x36\\x73\\xd8\\xf6\\x16\\x60\\xa2\\xab\\xc7\\x74\\xf0\\x76\\xe9\\x5e\\x5c\\x0e\\x1a\\xa3\\x90\\xde\\x18\\xb8\\x66\\x4d\\xa3\\xc9\\xb2\\x04\\xf0\\x29\\x02\\x97\\xa7\\xa1\\xc4\\x10\\x00\\xdc\\xa3\\x2b\\x01\\x9f\\xf0\\x0f\\x86\\xb9\\xce\\x8f\\xa4\\x3c\\x50\\xfb\\x1c\\xdd\\x82\\xca\\xe9\\xa9\\x06\\xc6\\x81\\x09\\x0d\\x03\\x33\\x30\\x0e\\x8c\\xec\\xe8\\x0f\\x39\\xd0\\x46\\x94\\xf5\\x9e\\x2f\\xf4\\x90\\xb4\\x93\\x38\\x0c\\x80\\xdf\\x20\\x37\\xc4\\x4f\\x0e\\x47\\x43\\x05\\x7c\\xb8\\x00\\x86\\x65\\x23\\x7a\\x37\\x74\\x26\\x65\\x4c\\xf0\\x1a\\x19\\x09\\x18\\x8f\\x1c\\x95\\xbf\\x69\\xba\\x20\\xfa\\xf9\\xa7\\x60\\x80\\x1a\\x45\\x1b\\x2c\\x90\\x53\\x7f\\x26\\x7e\\x5f\\x91\\x1f\\x4b\\x80\\x34\\x48\\xc5\\xad\\xe6\\x68\\xbc\\x44\\xff\\xfc\\x40\\x7c\\xf5\\xbd\\x21\\xff\\xba\\x02\\x0c\\x22\\xc5\\xe1\\x2f\\x46\\xc9\\xe0\\xef\\xdf\\x18\\xf5\\xdf\\x8a\\xe1\\xa2\\x45\\xf0\\xbf\\x88\\x47\\xf0\\x9b\\xa1\\xff\\x93\\xc7\\x86\\x86\\x63\\x16\\xb8\\xff\\x85\\x15\\xeb\\x7f\\x69\\xc5\\xf9\\x87\\x07\\xf2\\xf0\\x50\\xb6\\x42\\xfd\\x4f\\xbb\\xf5\\x31\\x2d\\x50\\xe0\\x56\\x3c\\x1d\\xf6\\x9f\\xfe\\xe3\\xb0\\xff\\x46\\xaf\\xfb\\x70\\x34\\x3b\\xc4\\xd9\\xbc\\x12\\xf8\\xff\\x7b\\x65\\x72\\x0f\\xdf\\x0e\\xa1\\xd6\\x2b\\xf8\\x76\\xe4\\x25\\x9d\\x55\\xfb\\x2f\\x56\\xe4\\x98\\x0d\\xef\\x09\\xfb\\x38\\x65\\x1f\\x67\\xec\\xe3\\x9c\\x7d\\x5c\\xb0\\x8f\\xd7\\xd0\\xcc\\x1b\\x3d\\xe8\\xe1\\x69\\x12\\x11\\xd4\\xac\\x83\\x4b\\xe8\\xf1\\x15\\x06\\x58\\xa0\\xdf\\xe7\\x9d\\x31\\x66\\xe1\\x0d\\xb9\\x02\\x0c\\x85\\xeb\\xf2\\xcf\\x64\\xff\\xc5\\xcf\\x35\\x43\\x22\\xc2\\x9b\\xfc\\x8e\\x6a\\x08\\xd5\\x99\\x7a\\x43\\xff\\x4e\\x0d\\x79\\xc0\\x04\\xcb\\x14\\x62\\x80\\x28\\xa1\\x7d\\x34\\xd8\\xbb\\x9b\\x04\\x33\\x5f\\xcd\\x1c\\x97\\x8b\\x96\\x14\\x86\\xa4\\x98\\x4b\\x65\\x35\\xb9\\xec\\xa6\\xd2\\x07\\xb8\\xe8\\x28\\x59\\x31\\xfc\\x59\\x1b\\x21\\x02\\x38\\x9e\\x5a\\xe8\\x8a\\x35\\x75\\x83\\x3b\\xca\\x84\\x09\\xf3\\x66\\xee\\x4f\\x96\\x1f\\xb1\\x5f\\xf4\\x5d\\x31\\x76\\x2b\\x92\\x72\\xd4\\x7e\\x02\\xc7\\x09\\xc6\\x38\\xf1\\x95\\xd8\\xc0\\xa4\\xd0\\x82\\xbd\\x7a\\x45\\xde\\x98\\x43\\x2f\\xf8\\x42\\xad\\xce\\xde\\x5b\\xaa\\x06\\xf3\\xb1\\x8f\\xdd\\x9d\\x23\\x54\\x7e\\x34\\x59\\x08\\x43\\x29\\xfb\\xc1\\x82\\x23\\x0c\\x57\\x01\\x18\\x82\\x27\\xbb\\x48\\x99\\x05\\x45\\xfc\\xef\\xa0\\x62\\xb0\\x86\\xeb\\xa7\\x53\\x31\\x58\\xe3\\x15\\x70\\x20\\x52\\xab\\x5a\\x23\\x34\\x32\\x58\\x1c\\x8e\\x93\\xf5\\x8e\\xf3\\xb0\\x38\\x9c\\x24\\xeb\\x9d\\x44\\x5d\\x4d\\xaf\\x7b\\x9e\\xac\\x7b\\x9e\\x83\\x01\\xe2\\x34\\x59\\xed\\x34\\x07\\x03\\xc4\\x59\\xb2\\xda\\x59\\xd4\\xd3\\xd4\\xaa\\x17\\xc9\\xaa\\x17\\xff\\x00\\x79\\x04\\x56\\xc3\\x37\\x64\\xed\\xa4\\x96\\x1c\\x9c\\x0e\\xd6\\x24\\x1c\\x1c\\x9f\\xc3\\xd4\\xba\\xd6\\x7c\\x18\\xce\\x77\\xf1\\x0e\\x12\\x44\\xd7\\x4e\\x18\\xcb\\x20\\xcb\\xb0\\x66\\xd2\\x64\\x91\\x65\\xdc\\x27\\x2b\\xde\\xcb\\x8a\\x19\\x04\\x97\\x87\\xc9\\xba\\x87\\xb2\\x6e\\x7a\\xd2\\xd0\\x51\\xb2\\xea\\x91\\x0c\\x9e\\xca\\xb8\\xec\\xab\\x64\\xdd\\x57\\x19\\xd9\\x58\\xd6\\xfc\\x36\\x6b\\xca\\x97\\x31\\xc4\\x26\\x9e\\x08\\x61\\x4d\\xa3\\x30\\x66\\xc6\\xc5\\x6b\\xb3\\x05\\x0c\\x0c\\xb8\\xeb\\xe4\\x0a\\x99\\x5b\\x01\\xa9\\x6c\\xad\\x54\\xbb\\x78\\x33\\x8f\\x24\\xdc\\xc8\\xc1\\xb8\\x91\\x9f\\x72\\x63\\x0d\\xce\\x0d\\x1b\\xe9\\x46\\x56\\x04\\xd5\\xd5\\xff\\x49\\xde\\xd1\\x95\\x57\\x27\\x22\\xe0\\xe7\\x2a\\x33\\xa4\\x2b\\x3f\\xca\\x5c\\x0e\\xaa\\xd8\\xcb\\x64\\x6f\\x2e\\x69\\x6f\\x30\\xee\\x06\\x00\\x96\\xa8\\x7c\\x5c\\xce\\x8d\\x57\\xc7\\x95\\x9a\\xdc\\x49\\x2f\\xcb\\xe8\\xad\\x94\\xe1\\x4e\\x47\\x4a\\xd2\\xcb\\x74\\x67\\x47\\xfe\\x6c\\xb9\\x64\\xa6\\xfc\\xf4\\x5d\\x32\\x56\\x7e\\x76\\x10\\x0b\\x46\\xfe\\xec\\xba\\x64\\x19\\x53\\x94\\x97\\x4c\\xd8\\x3b\\xcd\\x4c\\x98\\x39\\x15\\xe4\\x8e\\x16\\xf7\\x4e\\x9f\\x9c\\x02\\xe0\\xf0\\xb9\\xd5\\xbd\\x13\\x62\\x01\\x5b\\xc2\\x0c\\x80\\xc9\\xdd\\x1f\\x9c\\x8a\\x4c\\x99\\xca\\xa9\\x05\\xa2\\xe6\\x3e\\x2d\\x99\\xe6\\x56\\x24\\xd3\\x9c\\xd0\\xfb\\x4a\\x26\\xd3\\x1c\\xd3\\xa3\\x4a\\x32\\xcd\\x6d\\x14\\x19\\x6c\\xc3\\x82\\x8b\\x27\\xd3\\xdc\\xb1\\xd1\\xba\\xa8\\xde\\x89\\x64\\x9a\\x0b\\x08\\xbb\\xbf\\x75\\xef\\xae\\x2f\\x6a\\xde\\x2d\\xfd\\x97\\x48\\xa6\\x81\\x83\\x51\\x32\\x0d\\xfc\\xc2\\x64\\x1a\\x67\\xb9\\xb3\\x23\\xc0\\xf3\\xe0\\x9b\\x95\\x1f\\x24\\x32\\x8c\\xb1\\xc2\\x54\\x47\\xe7\\x4e\\x1c\\x6b\\x0e\\xce\\x69\\x2c\\x47\\xde\\xa8\\x54\\x57\\x4f\\x33\\x93\\x74\\xa8\\x6a\\xdb\\xdc\\x63\\x32\\x24\\xea\\xb4\\x4d\\xc1\\xcf\\xcf\\xa6\\xc2\\x6b\\xef\\x34\\xcb\\xe2\\xaf\\xa7\\xf0\\x2c\\x6b\\x54\\x02\\xf7\\x5e\\x6f\\x6e\\xf6\\x67\\xb9\\x00\\x8a\\xf6\\xd1\\xdc\\x0b\\x5a\\xa0\\xab\\x5f\\x7a\\x6f\\x34\\x6b\\xff\\x95\\x84\\xe5\\x63\\xd6\\x7e\\x08\\x99\\x8b\\x63\\x87\\x98\\xaf\\xa8\\x43\\x82\\x33\\xeb\\x1f\\xae\\xe8\\xfe\\xa4\\x88\\xf1\\xcf\\xd3\\x88\\x18\\xe6\\x32\\xdd\\xf8\\xbf\\x50\\x30\\x9a\\x33\\x8a\\x2e\\xf3\\x17\\xe5\\x43\\xc1\\xf3\\x8b\\x32\\x0a\\x03\\xda\\xb8\\x3f\\x05\\x14\\xd2\\x4b\\xfa\\x96\\x4c\\xf3\\x55\\xa2\\x13\\x7e\\x96\\xaf\\xa4\\x96\\xea\\x34\\xdf\\xd9\\xb9\\xd2\\xcc\\xfb\\x4b\\x05\\x8a\\x38\\xdd\\xf1\\x71\\xc6\\x73\\x70\\xc8\\x84\\xbd\\x5f\\x6f\\xbd\\xb3\\x6a\\x9b\\xa7\\xd5\\xbc\\x05\\xfc\\xbe\\x8c\\x64\\x9f\\x25\\x5f\\x14\\xda\\x2e\\xe9\\xb1\\xfc\\xa8\\xb6\\x9a\\x1f\\x85\\xc7\\x94\\x43\\x99\\x8b\\x54\\xea\\x25\\x33\\xf3\\xa3\\x7a\\xd2\\x77\\xb3\\x7a\\x9d\\x71\\xe3\\xbd\\xc8\\xe3\\xd3\\x4b\\x66\\x14\\x9d\\xc9\\x8c\\xa2\\x73\\x97\\x47\\x23\\xc7\\x17\\x2a\\x2d\\x64\\x15\\x8b\\x3c\\x3c\\x0c\\x84\\x01\\x3f\\xc5\\x52\\xbe\\xbd\\x44\\xae\\x27\\xb9\\xb4\\xc5\\xef\\x58\\x9b\\x65\\x62\\x94\\x53\\x48\\x8c\\xd4\\x65\\x32\\xca\\x61\\xd2\\xdb\\x34\\x4e\\xc6\\xa4\\x3f\\xc9\\xe8\\x4d\\x62\\x2f\\x7a\\xc4\\x3d\\xf1\\xce\\xcb\\xd3\\x76\\x6c\\x81\\xa3\\x85\\xf0\\x6c\\x06\\xeb\\xf0\\xbb\\x7c\\x98\\xee\\x51\\x6b\\xd8\\x23\\x00\\xe6\\x34\\x5f\\xcf\\x7e\\x39\\xc6\\xe1\\xf2\\xde\\xc2\\x1a\\x61\\xbd\\xa4\\xdd\\x9d\\x55\\x72\\xc9\\xfb\\xd4\\xad\\x04\\x17\\xb2\\xa6\\x3f\\x9e\\x41\\xc8\\xe7\\x34\\x1c\\x8d\\xc1\\xf1\\x6e\\x80\\x0a\\xe2\\xcf\\xff\\x7d\\x38\\x9f\\xc2\\x15\\x71\\xe1\\xad\\x6c\\xd1\\xeb\\x6b\\x5d\\x03\\xf2\\x8a\\xa1\\x12\\xdd\\xab\\x92\\x51\\x0c\\x95\\x08\\xde\\x0c\\x22\\x8b\\x91\\x33\\x54\\xdd\\xce\\xcf\\x78\\xcf\\x76\\x95\\xee\\xba\\x59\\x24\\x16\\x5a\\x1b\\x65\\x6b\\x1b\\x29\\x0e\\xb0\\x88\\xd8\\x77\\x6b\\xc0\\x83\\x5c\\x6c\\xc3\\x6c\\x1c\\x5a\\xf1\\x02\\x3c\\x3c\\x28\\xc9\\x73\\x5e\\x94\\x3c\\x87\\xfd\\xb1\\x9d\\x94\\x9d\\x3c\\x28\\x55\\xca\\x2b\\x14\\xf1\\x9c\\x16\\x87\\x65\\x1f\\x32\\x4c\\x76\\x2a\\xeb\\xf1\\x4f\\xf7\\x40\\x7e\\xab\\x88\\x85\\x8c\\x96\\x6c\\x7e\\x82\\x63\\x9f\\x9d\\xb3\\xe7\\xe5\\x52\\x89\\x80\\xa8\\x03\\x85\\x40\\x9f\\x71\\x8a\\xe7\\x30\\x35\\xf4\\xe5\\x79\\x91\\x73\\x79\\x86\\x35\\x6d\\xa4\\x86\\x70\\xc3\\x4b\\x28\\x92\\x2b\\x51\\xfa\\x74\\x7c\\xde\\xd3\\x91\\xe8\\xa9\\x2f\\x7b\\xea\\xdb\\x7b\\xfa\\xc5\\x39\\x7f\\xfe\\xe3\\xcf\\xb1\\x8e\\x9e\\x25\\x3b\\xaa\\xee\\x23\\x78\\x59\\xdf\\x45\\x29\\xd7\\xe9\\x80\\x60\\x87\\x32\\x0f\\x4b\\x34\\x8d\\xc6\\x4b\\xae\\x9f\\xdf\\x7b\\xd5\\xbc\\xd4\\x7a\\x1a\\xed\\x9c\\xd9\\x3b\\xec\\x24\\x68\\xcc\\xa1\\xfd\\xcf\\x85\\xf8\\xfd\\xc6\\xce\\x6e\\xf0\\x70\\x36\\x5a\\xaf\\x3b\\x2e\\x2a\\x0b\\x4e\\x57\\x19\\xd5\\x65\\x34\\xaa\\x23\\x31\\xaa\\x7f\\xc3\\x5e\\xf4\\xf8\\x51\\xfd\\x92\\x3a\\xaa\\x5f\\x32\\x25\\x12\\x67\\x7e\\x70\\x56\\x29\\x76\\x99\\x3b\\xcc\\xe5\\x84\\x15\\x1b\\x0e\\x6c\\x17\\x53\\x98\\x37\\xca\\xe6\\xbd\\x95\\xd9\\xbc\\x0b\\x2d\\x9b\\xf7\\x36\\x96\\xcd\\xbb\\x78\\x64\\x36\\xef\\x72\\xfd\\x6c\\xde\\xdb\\xec\\x6c\\xde\\xf5\\xb3\\x19\\xc1\\x72\\xad\\xa4\\x33\\xc6\\xd9\\x99\\x75\\xb1\\x3f\\xee\\x79\\xd0\\x0c\\xf3\\xfc\\x24\\x3c\\xf5\\x05\\x9e\\x8b\\xcc\\xf4\\xea\\x6e\\xf4\\x54\\xd7\\x58\\x5a\\xae\\x01\\x3b\\xa1\\x9c\\x45\\x19\\x23\\x62\\x4d\\x35\\xfd\\xee\\xa3\\x00\\xc7\\xa7\\x88\\x06\\x7f\\xce\\xa4\\xd7\\xbf\\x61\\x54\\xd8\\x35\\x51\\xfc\\xed\\xf0\\x01\\x2a\\x32\\x71\\xd8\\x25\\x41\\x94\\x8f\\x8a\\xc5\\x5c\\x73\\xb2\\xec\\xa1\\x74\\x23\\x93\\x57\\xde\\x28\\xf2\\x28\\x1b\\x95\\xdf\\xbb\\x60\\xd6\\xdd\\x02\\xe9\\x25\\x3d\\x97\\x9c\\x17\\xd7\\xf3\\xc9\\x19\\x53\\x99\\x9a\\x4d\\xce\\x8f\\xb4\\x0d\\x39\\xe7\\x9d\\xe8\\x98\\xba\\xe6\\x60\\x86\\x81\\xed\\x4c\\x60\\xca\\x53\\xef\\x59\\xf3\\xd4\\x5f\\x70\\x67\\xf7\\xbf\\x5f\\xac\\x48\\x9f\\x39\\x59\\x43\\xf6\\x31\\xb0\\x79\\xbb\\xad\\xaa\\xbc\\xc4\\x97\\x2b\\x93\\x09\\xb8\\x50\\xa7\\xf0\\x6f\\x06\\xff\\x38\\xc0\\x5c\\x3c\\xa5\\xfd\\x8e\\x5d\\x69\\xa1\\x3b\\x74\\x73\\x66\\xaa\\x93\\x25\\xab\\x7d\\x0f\\x8e\\xda\\xaa\\xec\\x12\\xdd\\xb2\\x79\\x7f\\x46\\x80\\x7c\\x20\\x28\\xe1\\xd8\\xed\\x16\\x98\\x7c\\xf0\\xbe\\xde\\x82\\x9c\\x0d\\xa7\\x5c\\x82\\xdc\\x0e\\x5e\\x64\\x7e\\xc0\\x11\\x28\\x2a\\x9c\\x3f\\x2e\\x51\\x94\\xf3\\xcc\\x15\\x16\\x40\\xbd\\xc1\\xbf\\x2f\\x01\\x99\\x83\\xa7\\xcc\\x67\\x64\\xc5\\xb7\\x54\\x3e\\x1c\\x91\\x14\\x9f\\x2b\\x9f\\xde\\x37\\xd5\\x44\\x55\\xe1\\x90\\xbc\\xb2\\x40\\xe3\\x2d\\xc8\\xbd\\x4b\\x8e\\xbf\\x4f\\x52\\xfd\\xc9\\xdf\\x9b\\x54\\xaf\\xb8\\xd4\\x17\\x74\\x57\\x10\\xd9\\x9e\\xcd\\x28\\x67\\xbc\\x4d\\xbf\\x2e\\x0e\\xe9\\x03\\xc1\\xec\\xf1\\x25\\x7e\\xf3\\x59\\x1e\\xf9\\xec\\xb3\\xd7\\xe1\\xdf\\xbe\\x78\\x5d\\x25\\x8d\\x3c\\xf8\\xee\\xbc\\x38\\x56\\xcf\\x44\\xba\\x0f\\xd6\\xea\\x4c\\x05\\xff\\xc9\\x31\\xdc\\xd1\\xda\\xa0\\x7d\\xa2\\xa6\\xd5\\x17\\x67\\x85\\x2e\\xcb\\x4e\\x78\\xb7\\xa2\\xfd\\x41\\xd5\\xcf\\xf0\\x28\\xd6\\xf6\\x1b\\x42\\xcd\\x2f\\x69\\x35\\xad\\xae\\xc3\\x3c\\x59\\xf2\\x56\\x27\\x5e\\x3a\\x26\\x80\\xd5\\x7d\\x97\\xe5\\x8f\\xb0\\xba\\xe1\\xb2\\xb2\\xf2\\x83\\xef\\x98\\x95\\x1f\\x6c\\x96\\x95\\x1f\\xfc\\x03\\x59\\xf9\\x86\\x6b\\xaa\\x3d\\xfe\\xfc\\xf8\\x2e\\x67\\xf6\\xf8\\x53\\x37\\x98\\x6e\\xb1\\x55\\x60\\x8b\\x7e\\x63\\x56\\xed\\x16\\xd9\\x1a\\xcf\\x67\\x9c\\x7c\\x92\\xf6\\x77\\x36\\xda\\x02\\xa3\\xc1\\x96\\xb8\\xa9\\x82\\xd2\\xc9\\x2f\\xff\\x4f\\x77\\x32\\xdd\\x41\\x68\\x82\\xa4\\xb0\\x3b\\x08\\xf1\\x14\\xe9\\x65\\x39\\x08\\x79\\x01\\x5a\\x30\\xdb\\x41\\x28\\xca\\x90\\x5e\\xaa\\x83\\xb0\\x27\\x1c\\x84\\xd8\\xf2\\x61\\x18\\x74\\x86\\xa9\\x8b\\x88\\x39\\x88\\x20\\x12\\x08\\xea\\x71\\x81\\x20\\xcb\\x6d\\x18\\x0f\\x67\\x69\\x60\\x38\\x4b\\xd2\\x6d\\x48\\x55\\x38\\xa6\\xf6\\x0e\\x40\\xa6\\x90\\x5f\\xbb\\xf2\\xeb\\x93\\x60\\x22\\x8c\\xeb\\x93\\x3e\\x08\\xa9\\x79\\xdc\\x84\\xbd\\xe8\\x61\\x27\\xb1\\x10\\x40\\xce\\xe8\\x79\\xdd\\x22\\x73\\xc0\\x16\\x85\\x6b\\x97\\xee\\xa0\\x45\\xf4\\x06\\x17\\xa5\\x03\\xf7\\x26\\xd3\\xf5\\x77\\xe3\\x92\\xbe\\x64\\x7d\\x56\\x73\\x7a\\x1a\\x64\\x20\\x73\\x75\\x7c\\x4c\\x28\\xea\\xd5\\xdc\\x28\\x33\\xa6\\xa5\\x97\\x1d\\xca\\xb2\\x6d\\x5a\\x76\\x0c\\xb9\\x42\\x55\\xec\\xe7\\xc4\\xbb\\xb1\\x3b\\x92\\xc4\\x88\\x68\\xc9\\x23\\x53\\x6f\\xb2\\x89\\x17\\x29\\x6a\\xab\\x3a\\xd5\\xfc\\x45\\x13\\xd5\\x5b\\xb4\\x9a\\x6c\\x92\\xa7\\xc1\\x11\\xed\\x26\\xb6\\x14\\x7d\\x9b\\xf5\\x37\\x89\\x68\\xc7\\xb9\\x5e\\x67\\x89\\x68\\xec\\x59\\xae\\xf8\\x7d\\x69\\x7b\\x19\\x09\\x69\\x55\\xc6\\x03\\xeb\\x5c\\xcd\\x0b\\xb3\\xdc\\xda\\x77\\x98\\xd1\\x06\\x6a\\x2e\\xcd\\x45\\x42\\x67\\x28\\x8a\\xb0\\xfb\\x9e\\xeb\\xf7\\xcd\\x62\\x51\\x53\\xa3\\xfe\\x95\\x79\\xcc\\xd0\\xe6\\x8b\\xe5\\x6d\\xaf\\x21\\xc8\\xcf\\xeb\\xf4\\x29\\x0b\\x41\\xb2\\xa9\\x28\\x90\\x1e\\x7d\\x91\\x04\\x1a\\x38\\x06\\x39\\x4a\\xed\\xcd\\x66\\x89\\x1a\\xf2\\x41\\xa0\\xea\\x5c\\xc3\\x69\\xee\\xd1\\x99\\xc1\\x5a\\x7a\\xd7\\x76\\xb4\\x7c\\x2d\\x17\\xd4\\x3b\\x28\\x11\\x24\\xcf\\x96\\xe0\\x6c\\x9b\\xd5\\x47\\xd7\\x6b\\xb1\\x2c\\x01\\x3f\\x7c\\xd2\\x22\\xed\\x5a\\x8a\\xcd\\x1d\\xba\\x89\\xe4\\xe6\\x2b\\x80\\x18\\x8c\\x3f\\x6b\\x91\\x7b\\x4f\\xe6\\x89\\xa7\\x3d\\x4f\\xcf\\xc7\\x67\\x8f\\x49\\xd3\\xae\\xdd\\xac\\xfc\\x7c\\xf6\\xdc\\x2c\\x75\\x26\\x05\\xb2\\xef\\xda\\x72\\x5b\\x34\\xd3\\xb8\\xd6\\x80\\xe7\\xf5\\xd5\\x71\\x3c\\x90\\x71\\xf4\\xe8\\xa7\\x65\\x3c\\x23\\x7f\\x32\\xc0\\xf7\\xc4\\xc5\\x3d\\x3d\\xb3\\x4f\\xaf\\x3b\\x08\\x86\\xbc\\x9e\\x7e\\xb8\\xbe\\x60\\x87\\x57\\x0a\\xfb\\xa7\\x1e\\x1b\\xbe\\x1f\\x8f\\x0d\\xdf\\x57\\x62\\xc3\\x7f\\x2a\\x95\\xa8\\xba\\xfd\\xe3\\x3e\\x55\\xaf\\xa9\\x8e\\xdb\\x37\\x04\\x6f\\x9b\\x03\\xbf\\x8d\\x36\\xff\\x05\\x95\\x3f\\xad\\x01\\xdd\\xa3\\xe4\\x36\\x72\\xcd\\xa8\\x1f\\x6a\\x0a\\x02\\xfa\\xf7\\xd5\\x66\\x9e\\x3c\\xa2\\x34\\x3d\\x68\\xd2\\x84\\xd1\\x9b\\x27\\x50\\xd3\\x0a\\xb0\\x9e\\x1e\\x6c\\x69\\x05\\x58\\x4f\\x0f\\xb6\\xb4\\xa2\\x87\\xa7\\xc7\\xcb\\x5a\\x35\\xc3\\xf4\\x78\\x59\\xab\\x66\\x58\\x1f\\x06\\x83\\x14\\x8d\\x67\\x7d\\x54\\x74\\x63\\x64\\x6e\\xee\\x10\\x39\\x63\\x70\\xee\\x7f\\x79\\x54\\x5a\\xaa\\x64\\x18\\x8f\\x38\\x6c\\x20\\xa8\\xd7\\xe6\\xb4\\xa5\\x52\\xfc\\x00\\xaf\\x6a\\x1e\\x01\\x6f\\x1c\\xd9\\x08\\x62\\x02\\xde\\x8d\\xb2\\x81\\x4e\\x18\\xd8\\xd5\\x76\\x4f\\x84\\xed\\x1f\\xc6\\xfd\\xd0\\x18\\x69\\xcf\\x16\\x4d\\xbe\\x13\\x07\\xb4\\x67\\x5e\\x3d\\x9f\\x9f\\x5b\\xab\\x6d\\xf5\\x3b\\x9b\\x73\\x02\\x4b\\x20\\x4c\\xf2\\x8d\\xcd\\x1c\\xcf\\xb5\\xff\\xa2\\xb4\\x41\\xab\\xd1\\x2e\\x59\\xdf\\x20\\xed\\xce\\x47\\xb0\\xc6\\x1b\\x2a\\x7f\\x91\\xba\\x2b\\xc9\\xc8\\x37\\xe8\\xa0\\x2d\\x15\\xb2\\x0c\\xfa\\xaf\\x88\\xed\\x72\\x1a\\x66\\xbf\\xfe\\x02\\xdd\\x0f\\x8a\\x15\\x9e\\x01\\xeb\\xaa\\x36\\xf2\\x92\\xea\\xf4\\xbe\\x35\\x10\\x15\\x25\\x63\\x8e\\xc4\\x83\\x8a\\x68\\xb3\\x7f\\x96\\x8d\\xc4\\x2f\\xa1\\xb3\\x19\\xfa\\x18\\xf2\\xa4\\x10\\x0f\\xee\\xfd\\x0a\\xb4\\x83\\xe4\\x50\\x73\\x04\\x44\\xb3\\x01\\xad\\xfc\\xf2\\x7a\\x48\\x2d\\xd3\\x97\\x43\\x1b\\xd0\\xed\\xbc\\x46\\x02\\x14\\x9d\\xf2\\xf4\\x7b\\x99\\xe8\\x77\\xde\\x6e\\x33\\xae\\x9b\\xb5\\x3b\\xbe\\xd4\\x3a\\x1e\\xd2\\x8e\\x2f\\x93\\x1d\\xa7\\xaf\\xb6\\x7c\\xcd\\xa6\\x8e\\xf2\\xce\\xd5\\x99\\x8c\\x29\\xbd\\x75\\x2c\\x95\\xac\\xde\\x98\\xf2\\x01\\xc0\\x4c\\xb9\\x92\\x5b\\x6c\\x80\\xdc\\x09\\x04\\x33\\xa5\\x6a\\xfb\\x37\\x01\\xa9\\x55\\x6d\\xef\\xee\\xba\\x89\\x0a\\xed\\x1a\\x69\\x43\\x85\\xdf\\x9a\\x74\\xca\\x18\\x1a\\x14\\xe7\\x69\\x83\\x6d\\x29\\x3e\\xb4\\x56\\xca\\x9b\\x8f\\x4c\\x63\\x11\\xe3\\x3c\\xe2\\x06\\x30\\x24\\xa1\\x6a\\xe0\\x5d\\xd7\\x9d\\x1b\\x46\\x3d\\x89\\xc1\\x6d\\x28\\xe8\\xd2\\x01\\xa1\\x7a\\x19\\xbd\\xcd\\x1a\\x01\\xcb\\xc5\\x8a\\x69\\x30\\x59\\xda\\xe0\\x4c\\x88\\xfc\\x56\\xe4\\xf4\\x19\\x20\\xa7\\xdf\\xa6\\x60\\x50\\xcf\\x52\\x90\\xd3\\x61\\xd9\\x33\\x84\\x76\\x6e\\xdf\\x3c\\x3c\\x6c\\xdf\\x64\\xa1\\x8f\\xcf\\x20\\xb0\\x71\\x96\\x0f\\x7d\\xfc\\xce\\x13\\xcf\\xfc\\x46\\x8a\\xf5\\x35\\x72\\xa3\\x88\\xf8\\x4d\\x5a\\x42\\xfa\\x4c\\x00\\x71\\x5d\\x0b\\x7f\\x5c\\x78\\xb3\\x6c\\xad\\x75\\x4c\\x97\\x7a\\xa9\\xb9\\xde\\xd4\\xc0\\xff\\xb1\\x78\\x8c\\xe6\\xca\\xda\\x23\\xf7\\xde\\x52\\xd3\\x5f\\x0f\\x69\\xab\\x6a\\xbc\\xe3\\x7d\\x46\\x0c\\xa1\\x68\\x8e\\x87\\xee\\x65\\x14\\x47\\x3b\\x54\\xbe\\xa2\\xf8\\x96\\x1d\\x52\\xe1\\xb4\\x00\\x4e\\xe9\\x0d\\xe0\\xb4\\x71\\x68\\x5f\\x79\\xfa\\xbb\\x1b\\xeb\\x2f\\x4c\\x1d\\x9f\\x47\\x23\\xcc\\x65\\x8c\\xdc\\x2d\\x30\\xcd\\xf2\\xf8\\x10\\xc2\\x51\\xef\\x8f\\x62\\x0d\\xa9\\x77\\x72\\xec\\x1d\\x25\\x72\\xed\\x54\\x75\\x45\\x3c\\xb5\\x3b\\x2a\\xad\\x1f\\x27\\x9e\\x99\\x6d\\x21\\x8b\\x35\\xc1\\x57\\x25\\xba\\x9e\\x8d\\x0e\\x8a\\xbf\\x54\\x7e\\x31\\xac\\x53\\x46\\xee\\xaf\\xd1\\x01\\x27\\xef\\xe2\\xcb\\x1b\\x39\\x8e\\x56\\xc6\\xf9\\xae\\x33\\x3a\\xe0\\xd0\\x9e\\x15\\xc0\\xba\\x93\\xeb\\xe4\\xf0\\xc0\\xa0\\x8b\\x00\\x93\\xd9\\xaa\\x52\\x8a\\x65\\xbd\\x73\\xf0\\xb4\\xb4\\xf9\\x2f\\xd7\\xc6\\x3b\\xba\\x10\\xde\\x27\\x17\\x53\\xf6\\x98\\xe3\\x61\\xb5\\x23\\x9d\\x03\\x74\\x6a\\x86\\xce\\x02\\x59\\x76\\xbb\\x67\\xc7\\x3c\\x02\\x7d\\xe3\\x9a\\x2d\\x4b\\xc6\\x85\\x1c\\xae\\xad\\x43\\x57\\xe4\\xe4\\xc5\\x45\\xfc\\x7a\\x39\\xef\\x22\\x2c\\xfb\\x55\\x0c\\x02\\x63\\x2e\\xa6\\x27\\x1f\\xe8\\x38\\x22\\xc6\\x2d\\x9b\\xb3\\x31\\x1d\\xd4\\x4b\\x0a\\x7b\\x11\\xe0\\x78\\xf9\\x05\\xd7\\x4b\\x21\\x3c\\x8b\\x0b\\xac\\x65\\xee\\xc9\\x7d\\x61\\x40\\x1c\\xa7\\xf7\\xdf\\x03\\x17\\x6c\\x5f\\x63\\x0c\\x9b\\x14\\xb8\\x86\\x1a\\xe3\\x10\\x1b\\x80\\x3a\\x3b\\x84\\x7f\\x9c\\x35\\x0c\\x5a\\x89\\xd4\\xcc\\xc8\\xb2\\xf8\\x24\\x48\\xcc\\xa9\\x4a\\xa7\\x91\\xb3\\x24\\x5b\\xe9\\xb4\\xea\\xaa\\x8b\\x4f\\xd2\\x91\\xba\\xbe\\x6e\\x96\\x5d\\x37\\xd5\\x75\\x77\\x59\\x9f\\xb2\\x97\\x79\\xed\\x74\\xc8\\x3a\\xd8\\xb2\\x53\\xab\\x5a\\xd3\\x21\\x23\\x5b\\x78\\x6a\\x7d\\x2b\\xed\\x51\\xba\\x4f\\xcc\\xea\\x70\\xfc\\xff\\x07\\xa1\\xd8\\xcf\\xa7\\xb0\\xcd\\xea\\xcd\\xbe\\xdf\\x82\\xb5\\x26\\x8f\\xba\\x16\\x46\\x9e\\x4e\\x99\\xb6\\x33\\x13\\xa9\\x37\\x37\\x60\\x17\\xd7\\x95\\xb8\\xd0\\xe5\\xd6\\xef\\x76\\xd1\\x67\\x56\\x7a\\x9f\\x8f\\xc6\\xdc\\xeb\\x14\\x7d\\xb4\\xd2\\xfb\\xe2\\x9e\\x6f\\x33\\xe5\\xb2\\x5b\\x40\\x5b\\xb8\\x51\\x05\\x96\\x1b\\x5d\\x60\\xb9\\xf3\\xc2\\x6a\\x68\\x45\\x52\\x53\\x22\\x78\\x90\\xc2\\x89\\x39\\x9f\\xbc\\x14\\x20\\x64\\x25\\xa8\\x18\\x2a\\x35\\x49\\xa2\\x11\\x09\\xbc\\xb6\\xf0\\xc2\\x9c\\x31\\x73\\xd5\\x50\\xe1\\x87\\xc7\\x07\\x00\\x2c\\xbf\\x93\\x16\\xad\\x39\\xa4\\x5f\\x10\\x5c\\xd3\\x19\\xf0\\x08\\x8c\\x69\\x5a\\xbe\\xcc\\x0a\\x2c\\xdc\\x3d\\xb0\\x61\\xf7\\x91\\x27\\x58\\xbb\\xe3\\x08\\xc8\\x19\\x12\\x8f\\xfa\\xb4\\xfa\\x41\\xa9\\xd2\\xac\\x62\\x4f\\xc6\\xf4\\xea\\xde\\xb7\\x65\\xa5\\x45\\x96\\xa5\\x4a\\x83\\xce\\x23\\x67\\xc1\\xee\\x62\\x29\\x09\\x3d\\x0c\\x12\\x1f\\x9b\\x2b\\x75\\xb6\\x27\\x32\\xc9\\x01\\x00\\x8e\\x41\\x52\\xdb\\x40\\xde\\x53\\x5b\\xa3\\xd2\\xdd\\x7d\\x1c\\xde\\xea\\x95\\xa7\\x09\\x62\\xe4\\x88\\x5e\\x46\\x15\\x00\\x5f\\xa5\\x8b\\x69\\xd0\\x30\\x17\\x83\\x32\\x4a\\xea\\xe9\\x26\\xcb\\x0c\\x91\\xce\\x8f\\xb6\\x56\\x3f\\xca\\x67\\xb8\\xe1\\xb2\\xda\\x44\\xca\\x6a\\x73\\xf9\\x6c\\x8c\\x0f\\x90\\x3f\\x84\\xbd\\xe5\\xae\\xf2\\xbd\\x04\\x51\\xa4\\x98\\x9b\\xec\\x60\\xa8\\x39\\x93\\x5f\\x42\\x3b\\xac\\x1c\\x77\\x83\\x74\\xd1\\xea\\xac\\xcc\\x4c\\xe9\\xb5\\x88\\x24\\x40\\x7b\\xd2\\x43\\x08\\xc2\\x1f\\x4a\\x95\\x37\\x20\\x88\\xac\\x05\\xc5\\x15\\x24\\xa0\\xb8\\x96\\x56\\x28\\xae\\xc0\\x02\\xc5\\x35\\x89\\x0b\\x1e\\x73\\x88\\x6f\\x4b\\x24\\x4d\\x8c\\xcd\\x20\\x5c\\x81\\x00\\xe1\\xc2\\xfb\\x3d\\x89\\xb8\\xb3\\xfd\\xba\\xdd\\x01\\xd4\\x74\\x7a\\x91\\x03\\xa8\\x64\\x1a\\xdb\\x96\\xa3\\x3e\\x17\\x2c\\x57\\xce\\x2c\\xb7\\x1b\\xaf\\x83\\x31\\xef\\xe3\\x11\\x4e\\x9d\\x91\\x4b\\x4e\\xff\\xd1\\xde\\x21\\x3c\\xc4\\x59\\x6c\\x42\\x44\\xaf\\x89\\x09\\x00\\x49\\x7d\\xd7\\x4d\\x13\\x90\\x2e\\x66\\x67\\x36\\x04\\xaa\\x5c\\x10\\x62\\x70\\x81\\x2d\\xfe\\xa9\\xa1\\x67\\x9b\\x61\\xbc\\x4f\\x05\\x59\\xf1\\x34\\x31\\xdf\\xd3\\x00\\x77\\xad\\x38\\x49\\x02\\x52\\xa4\\xe4\\x92\\x29\\x3e\\x94\\x04\\x2a\\x6a\\x5d\\x02\\xa1\\x03\\xf6\\x1a\\x43\\x46\\xd5\\x79\\x42\\x88\\x4e\\x25\\x62\\x86\\x45\\xc5\\x5f\\xa9\\x08\\xa8\\x39\\x7a\\x59\\xd6\\x7b\\x19\\x81\\x9c\\x7e\\x97\\x4e\\x1a\\xc0\\x8e\\xf3\\xf7\\x50\\x03\\xc9\\x7d\\xea\\xee\\x91\\xb3\\x84\\x27\\xf1\\x2c\\x2f\\xe0\\x99\\x79\\xb1\\xcc\\x0f\\x82\\x66\\xae\\x4f\\xaf\\x1f\\xcf\\x30\\x9a\\xa1\\xdd\\x4e\\x08\\x57\\x5b\\x76\\x8c\\x7a\\xe5\\xc5\\x3f\\x89\\xa6\\x77\\x83\\x11\\x45\\xa5\\x87\\x52\\xe3\\xeb\\xa9\\x75\\xf6\\xc8\\x18\\xd2\\x1c\\xf0\\x80\\x65\\xfe\\x96\\xe9\\xbd\\x37\\xbd\\x0d\\x19\\xd7\\xa6\\x72\\xcb\\x77\\xba\\x34\\x47\\x97\\x69\\xfd\\xf8\\x95\\x0f\\x1e\\xc3\\x1a\\x67\\xbf\\xde\\x33\\xce\\x6c\\xcd\\x1b\\x89\\x56\\x41\\x22\\x34\\x53\\xa6\\xd8\\x43\\xcc\\x32\\x00\\xc2\\xf2\\x5f\\x1d\\xaf\\xfc\\xdc\\xa7\\x3a\\xe7\\x75\\x0d\\xd3\\x99\\x9b\\x60\\xa9\\x7c\\xd9\\xac\\xee\\xee\\x36\\x99\\x79\\xb3\\xe1\\x95\\xc0\\x84\\x59\\x6d\\xfc\\x76\\x27\\xcc\\x97\\x8d\\xdd\\x5d\\xb7\\xb5\\x4b\\x85\\xa6\\x3b\\xc8\\xdb\\x90\\x30\\xc3\\x68\\x96\\x69\\xb9\\xbc\\x52\\xd5\\x7f\\xd9\\xc0\\x92\\xe0\\xca\\xa7\\x67\\x81\\x9a\\xde\\x6b\\x55\\x11\\x90\\xdb\\x5e\\xc4\\xeb\\xac\\xe2\\xbd\\xe8\\x42\\x0a\\x44\\xa9\\x2a\\x75\\xc4\\x15\\x08\\xd5\\x6a\\x7c\\xb7\\x32\\x8f\\x2c\\xa8\\x61\\x99\\x88\\x61\\x6d\\xef\\xd7\\x9f\\x4b\\x74\\x28\\x80\\x0c\\xbc\\x6b\\x8b\\xa0\\x0e\\x32\\xf0\\xc2\\x7a\\x56\\x17\\x71\\xdf\\xea\\x22\\x0e\\x3d\\xd6\\xff\\x02\\x10\\x7f\\xdf\\xfb\\x93\\x11\\x30\\x7f\\x17\\xf8\\x85\\x0b\\x54\\x93\\x2f\\x30\\x0f\\x74\\x41\\x44\\x69\\x1b\\xe2\\xd4\\x27\\x88\\x79\\x35\\xd5\\xc3\\xb1\\xe5\\x32\\x43\\xa5\\x12\\x6d\\xe9\\xd6\\x7e\\xc7\\x40\\xb4\\x6c\\xfc\\xe0\\x69\\x20\\x5c\\x6e\\xf5\\x66\\x4f\\xe2\\x66\\x38\\xfb\\x7b\\xfb\\xee\\x9e\\x02\\xae\\xe3\\x5c\\xd3\\x23\\x84\\xfe\\xd5\\x44\\x7c\\x8c\\x29\\xea\\x79\\x4a\\xa5\\x1c\\x43\\xd8\\xf0\\x54\\x09\\x1b\\xbe\\xb1\\xbc\\x72\\x47\\x09\\xbb\\xd2\\x54\\xc3\\x54\\x87\\x7d\\x37\\x5c\\xe2\\x8a\\x4c\\xa8\\x76\\x8b\\x70\\x56\\xd3\\x1c\\xab\\x87\\xb9\\x49\\x65\\x71\\xd9\\xa0\\xd9\\x98\\x81\\x6b\\x1a\\x47\\xe5\\xb6\\x36\\xda\\x50\\x45\\x25\\xe3\\x5c\\x12\\xa5\\x05\\x69\\x87\\x03\\xec\\x43\\x0d\\xb7\\x32\\x02\\x4b\\xba\\x70\\x65\\xe5\\xab\\x39\\xa1\\x35\\x85\\xfe\\x3a\\xc1\\x1b\\x12\\x9e\\x30\\xfa\\x8b\\x36\\x39\\x59\\x11\\xeb\\x33\\xfa\\xde\\x86\\x25\\xab\\xe3\\x3e\\xdd\\xb0\\x64\\xb5\\x47\\x65\\x61\\xf1\\x58\\x2d\\x25\\xa3\\x54\\x2a\\x75\\xab\\x49\\x08\\xf5\\xd8\\xb5\\xad\\x41\\xca\\xc3\\x5f\\xdb\\x12\\x64\\x8d\\x15\\x30\\x46\\x17\\xe4\\x8e\\x15\\x30\\x9a\\xdb\\xd6\\x8b\\x15\\x30\\xc5\\x6e\\xd8\\xcd\\x49\\x78\\x8a\\xf8\\x59\\xe6\\x24\\x61\\x40\\xf1\\x73\\x98\\x93\\xa4\\x69\\xc5\\x4f\\x35\\x27\\xf9\\xb9\\x62\\x05\\xe2\\xb6\\xcb\\x06\\xda\\x2e\\x8d\\xe0\\x33\\x28\\x4d\\xad\\x61\\x8b\\x9c\\xde\\x05\\xb0\\x48\\x86\\x1e\\x04\\xd3\\xd4\\xa7\\x3e\\xdf\\x31\\x2a\\x0d\\x61\\x0d\\x61\\x1b\\x07\\xbc\\x57\\xcc\\x4e\\x22\\xf7\\x0f\\xb7\\xda\\xa0\\x2f\\x56\\xbf\\xca\\x6b\\xd1\\xef\\x03\\xb5\\xda\\x5d\\xd0\\xe9\\x60\\xec\\x99\\xac\\x18\\x0c\\x81\\x05\\xbc\\xc8\\xd6\\xf5\\x44\\xdd\\x62\\x13\\x95\\x19\\xb5\\x89\\x69\\x10\\x76\\x47\\x73\\x40\\x57\\xc9\\xd3\\x8c\\xbf\\x18\\xd7\\xc1\\xa9\\x11\\xd5\\xe7\\x47\\xb2\\xfb\\x4e\\xef\\xf8\\xeb\\x98\\x49\\x38\\x4a\\xfd\\x0c\\x59\\xc8\\xd4\\xec\\x2a\\x47\\xec\\xbf\\x39\\x39\\xc2\\xba\\x2a\\xa6\\x9b\\x1a\\x6f\\xd6\\x35\\x35\\xe6\\x86\\x09\\xea\\x47\\xa2\\xb1\\xb4\\x37\\x9e\\x28\\x40\\x40\\x93\\x9d\\x1d\\xf9\\xb3\\x8d\\x29\\xe5\\x27\\x0a\\x2e\\x50\\x3f\\x66\\x8d\\xec\\x33\\x71\\x71\\x91\\x20\\x74\\x38\\x41\\x07\\x6c\\xc2\\xdc\\xc8\\x6d\\x62\\x17\\x36\\x37\\xf0\\x80\\x2c\\x48\\x08\\xe0\\xfd\\x36\\x37\\xf0\\x10\\x0b\\xd8\\xdc\\xc0\\x0b\\x4b\\x38\\xc6\\x51\\x2e\\xfc\\x9f\\x73\\x60\\xf0\\x4b\\xe0\\xff\\x00\\xeb\\xb7\\x19\\xff\\xa7\\xbf\\x1e\\xfe\\xcf\\x9b\\x08\\xff\\xe7\\x8d\\xc0\\xff\\x79\\x03\\xf8\\x3f\\x6f\\x4c\\xf8\\x3f\\x6f\\x34\\xfc\\x9f\\x37\\x1c\\xff\\xa7\\xbf\\xb3\\xd3\\x97\\x31\\x22\\xfd\\x27\\xc5\\xff\\x59\\x80\\x17\\x7c\\x91\\x0d\\xef\\x93\\xee\\xdf\\xbe\\xf4\\x16\\x59\\xd6\\x4e\\x39\\x5d\\xa5\\xc9\\xb3\\x5f\\x03\\xf0\\x9d\\xcb\\xcd\\x4d\\x9e\\x6a\\x93\\xaa\\x81\\xf3\\xad\\x77\\x19\\x47\\xf4\\xb9\\x8a\\xbb\\x1e\\xb9\\x9e\\xaa\\xa2\\x61\\x5c\\xe5\\x87\\xe8\\xc9\\x28\\xba\\xcc\\x5f\\x94\\xdf\\x0a\\xb7\\x99\\x66\\x14\\xd6\\x30\\x74\\x32\\xca\\xc2\\x74\\x9f\\x8c\\xc2\\x69\\xbe\\xd2\\x2a\\x5a\\x35\\x1d\\x40\\x39\\x7c\\x26\\x33\\xe3\\x45\\xdc\\xcc\\xf8\\x9a\\x2e\\x72\\x6c\\xb2\\xbf\\xf3\\xc6\\x07\\x17\\xc5\\xfb\\xca\\x45\\xb5\\xcb\\xed\\xb8\\xef\\xd4\\xd6\\x2c\\x90\\x3c\\x7d\\x99\\xfc\\x4e\\x42\\x06\\xc9\\xd3\\x55\\x21\\x79\\xf0\\x98\\x72\\x28\\x73\\x9d\\x48\\xbd\\x64\\x46\\x2e\\xff\\x45\\xf1\\x1d\\x83\\xcb\\x2e\\x86\\x11\\x34\\x0f\\x9d\\x40\\x63\\x76\\x83\\xef\\xbd\\x6b\\xe4\\xf0\\x7d\\x25\\x56\\xe1\\x87\\x87\\xc2\\x47\\xf6\\x8d\\xea\\x65\\xfe\\xac\\xfe\\x86\\x9e\\x8c\\x8e\\x88\\xf5\\xa0\\xc2\\x37\\xe2\\x6d\\xfa\\xe2\\xb0\\x99\\xe7\\xf2\\xbd\\x9d\\x9f\\xa0\\xd2\\xac\\x68\\x16\\xb6\\x4f\\x6c\\x15\\xf7\\x60\\xb5\\x51\\x76\\x40\\x6d\\x13\\x8f\\x18\\x1b\\xc5\\x33\\xb2\\x55\\xb6\\x77\\x62\\x6f\\x4f\\xf8\\x57\\xa5\\xe5\\xe8\\x50\\xd4\\x36\\xdf\\x6d\\x0d\\x6d\\xf3\\x33\\x4a\\x8f\\x95\\x0d\\x57\\x0c\\xc7\\xd6\\xff\\xc4\\x87\\xe3\\x2b\\xdf\\x68\\x13\\x83\\x22\\xf7\\x6a\\xdb\\xe0\\xc8\\x02\\xab\\x5a\\xf5\\xde\\x3b\\xe4\\x4b\\xda\\xf3\\x1f\\x9f\\xed\\x53\\x45\\xfc\\xbd\\x97\\x02\\x62\\x03\\x79\\x02\\xb4\\x82\\x08\\xd3\\xa7\\x3b\\x28\\xeb\\x12\\x28\\x4a\\x01\\x9f\\xa0\\xf7\\xc2\\x3b\\x70\\x5d\\xf8\\xd7\\x4f\\x3f\\xfd\\x44\\x1f\\xbd\\xfa\\x51\\x8b\\xcf\\x25\\xfd\\xb5\\xe2\\x13\\xf8\\x3d\\x9f\\xc0\\x81\\x9c\\xc0\\xa8\\xef\\x0f\\xea\\x0b\\x27\\x88\\xa6\\x6d\\x34\\x83\\xa3\\x59\\x9d\\x51\\x6e\\xed\\xa9\\x1e\\xeb\\x5e\\x26\\xfe\\x94\\x32\\xc9\\x2f\\x33\\x5e\\x8d\\x30\\xf2\\xd7\\x44\\xb5\\x00\\xd2\\xe5\\xed\\x86\\x48\\x5e\\x17\\x02\\xc9\\x6b\\x8e\\xb8\\x5b\\xec\\x71\\x5c\\x48\\xbf\\xcf\\x6b\\xa0\\xd8\\x04\\xad\\xc0\\xe1\\xc4\\x77\\x8c\\x3c\\x0b\\x24\\x7c\\xbc\\x3e\\x18\\x1b\\x6f\\x3b\\x47\\x62\\x57\\xa7\\x42\\x86\\xd8\\xa0\\x9a\\x71\\x54\\x10\\x6d\\x75\\x63\\x8f\\x0a\\x80\\xbb\\x7c\\xc3\\x35\\xab\\x8c\\xa9\\x4a\\xbf\\x27\\x6d\\x91\\x96\\x8b\\x16\\xec\\x2b\\xbf\\xeb\\xa2\\x87\\x08\\x29\\xa2\\xe2\\x94\\xd3\\xe6\\x60\\x28\\x4d\\x01\\x74\\xd3\\x96\\x40\\x37\\xed\\x34\\x48\\x9e\\x0b\\x84\\xe4\\xe9\\x6b\\x48\\x37\\xaf\\x61\\x7f\\x7a\\xbb\\x31\\x24\\xcf\\x6b\\xf6\\xac\\xec\\x0d\\x98\\xe5\\xa7\\x92\\x84\\x4a\\xa3\\x2f\\x24\\x5b\\xff\\x3e\\x54\\x3f\\x78\\x42\\x19\\xf0\\x3c\\xfa\\xc2\\x72\\xe9\\x1a\\x5c\\xa2\\x1d\\x79\\x7f\\x9d\\x34\\x20\\x9f\\xd7\\x00\\xe4\\xd3\\x87\\xc4\\x38\\x36\\x3e\\x2d\\x31\\x3e\\x1f\\xd4\\x3b\\xbe\\x80\\x3b\\x16\\x6b\\x0d\\x5e\\x89\\x2f\\x0d\\x74\\x85\\xd1\\x57\\x05\\xf5\\xe4\\x81\\x73\\xec\\x75\\xb4\\x5c\\x7a\\xa2\\xfd\\x54\\x42\\x61\\xfe\\xa7\\xe0\\xba\\x6e\\xe5\\x78\\x67\\x47\\x2b\\x70\\x1c\\x1f\\xa5\\x65\\xee\\x51\\xea\\xb8\\x2b\\x5f\\xb7\\xe8\\x48\\xc3\\x1a\\x9d\\xae\\x38\\x62\\x9a\\x99\\xb7\\x2f\\xdd\\xeb\\x65\\x70\\x2b\\xe7\\xf4\\x79\\x0b\\xdb\\x8b\\x5a\\x4c\\xcd\\xb0\\x2f\\xaf\\x14\\xc5\\x32\\x06\\xcb\\xd2\\xdc\\xf6\\x62\\x2e\\x80\\x0d\\xe4\\xda\\x65\\x2a\\xb8\\x4c\\xf7\\xb1\\xd8\\x35\\xe9\\xcd\\x07\\x7a\\xf3\\x6c\\x63\\x8f\\xdb\\xf5\\xb4\\x11\\xa1\\x2f\\x22\\x6c\\x11\\x56\\xc7\\x6f\\x34\\x72\\x25\\x88\\x41\\x20\\xda\\x58\\x12\\x31\\xb1\\xea\\xec\\x13\\xc6\\x0b\\xbf\\x28\\x3b\\x55\\x4a\\x87\\xa1\\xc7\\xbd\\x74\\x8a\\x7d\\xa5\\xdb\\x4d\\x30\\x6a\\xc4\\xc8\\x00\\xb8\\x78\\xdd\\x22\\x5d\\x12\\x90\\x01\\x18\\xde\\xe9\\x9a\\x63\\x98\\x2a\\x5a\\x4a\\x9f\\x1e\\x58\\xa1\\xcf\\x9e\\x44\\x44\\x47\\x9b\\x74\\x98\\xf9\\x41\\x59\\x23\\x5f\\x05\\x53\\x98\\xff\\x6d\\xe1\\x42\\xe1\\x59\\x75\\x9f\\x31\\xc0\\x08\\x80\\x18\\x1c\\x5c\\x3c\\x63\\x58\\xf7\\x1d\\xda\\xc9\\xed\\x12\\xeb\\x70\\xcf\\x13\\x95\\xaf\\xbb\\xd8\\x67\\x13\\xaa\\x50\\x4f\\x03\\x1b\\x92\\x00\\x67\\xf0\\xc8\\x5a\\x5e\\x8f\\xbe\\xfd\\x86\\x93\\x01\\x3d\\x19\\x78\\x0d\\xa9\\x8a\\x38\\xd8\\x1b\\xa7\\x47\\xa8\\x8a\\x23\\x98\\x74\\xa3\\x55\\x23\\x5a\\x17\\x7a\\x91\\xf7\\xb6\\xd2\\xc0\\x50\\x5e\\xa8\\x52\\x1d\\x30\\x4a\\x69\\x94\\x64\\xda\\xe8\\x53\\xc3\\x5e\\x57\\xfa\\xdc\\x82\\x33\\xa2\\xe3\\xd3\\xd6\\x3c\\x2d\\x84\\xef\\x05\\x2c\\xd8\\x4a\\x36\\x0b\\x68\\x16\\x40\\xdf\\x36\\xf1\\x6f\\xfd\\xc9\\x14\\xe6\\xc5\\x80\\xbf\\xa9\\x2f\\xf7\\xd9\\xca\\x39\\xa4\\xbd\\x16\\x3a\\x93\\x88\\xa7\\x6e\\xb2\\x10\\xec\\x2f\\xae\\x08\\xc1\\x1b\\x58\\x42\\x6e\\x86\\x51\\x8c\\xf7\\x50\\x70\\x5a\\xcb\\x23\\xf5\\x3d\\xb5\\x4f\\xe0\\x9e\\xa6\\x0a\\x9a\\xf5\\xac\\xb4\\x9e\\x0f\\x5f\\x7a\\xcd\\x9d\\x9d\\xd6\\x6e\\xf3\\xa5\\x37\\x3c\\x00\\x83\\x96\\x33\\xf6\\x1a\\x54\\xeb\\x44\\xd3\\x16\\x27\\x86\\xd8\\xf6\\x00\\x3b\\x6d\\x70\\x3d\\xae\\x45\\x4f\\x1b\\xc8\\xc4\\xd1\\x5f\\x72\\xe3\\xb5\\x75\\xd8\\x12\\xf6\\x2c\\x5a\\xf0\\x2c\\xc8\\xc4\\xf8\\x18\\x4c\\x9e\\xf5\\x68\\x49\\xde\\x2b\\xd3\\x45\\x19\\x23\\x50\\x0d\\xe5\\x3a\\x31\\x88\\x14\\x77\\x55\\xed\\x49\\x78\\x01\\x09\\x01\\xc4\\x44\\x85\\x60\\x57\\x11\\x16\\xc4\\x20\\xef\\x0a\\xa9\\x01\\x3d\\x6a\\x91\\xdc\\x70\\xb2\\x37\\xae\\x43\\x18\\xee\\xdb\\x51\\xcb\\x4f\\xa0\\xb5\\x4c\\xb8\\xb2\\xfa\\x8d\\xcd\\x8b\\x1b\\xe1\\x80\\x1d\\xac\\x5c\\x40\\xdd\\xe1\\xae\\x89\\xb3\\x79\\xd0\\xf2\\x01\\xfb\\x90\\x4a\\x80\\xe9\\xef\\x7c\\xdc\\xb0\\x6f\\x78\\xe3\\x71\\x8d\\x1d\\x3d\\x06\\xa2\\x4b\\xd8\\x0a\\x3c\\x4f\\x81\\xdb\\x8a\\x72\\x4c\\xfa\\x4f\\x06\\xe0\\x65\\xee\\x08\\x3e\\x6c\\x86\\xf4\\xa7\\x2f\\x9e\\xa7\\x9e\\xfc\\xaa\\xae\\xea\\x2b\\x30\\x45\\x25\\xbd\\x74\\x5b\\xe8\\xa6\\xc3\\x87\\x65\\x75\\xd6\\x99\\x6c\\x62\\x3a\\xd4\\x12\\x07\\x5f\\xea\\x24\\x8e\\x74\\x0d\\x70\\x4c\\x81\\xe1\\x58\\x4f\\x5f\\x1b\\xf1\\x51\\xf3\\x58\\xdd\\xbe\\x09\\x89\\x29\\x8c\\x23\\x31\\xbd\\x88\\x23\\x31\\xfd\\x5c\\x5a\\xd1\\xb5\\x9c\\xb1\\xd4\\xb3\\x8f\\x91\\xcd\\x8f\\x38\\x86\\x6d\\xe9\\x06\\xfe\\x69\\x78\\x4b\\xe5\\x4c\\xbc\\x25\\xfc\\x58\\x6e\\x06\\xbb\\x84\\x78\\x4b\\xe4\\xd0\\xbb\\x8e\\xf4\\x58\\xa9\\x7c\\x46\\xba\\x62\\x8d\\xbc\\xf2\\xbe\\xad\\xc8\\x11\\x82\\x33\\x25\\xb7\\xc5\\x76\\x3a\\x30\\xd3\\xbf\\x41\\x30\\xe3\\x25\\x66\\x71\\x18\\x06\\xd2\\xcf\\x87\\xb7\\xd4\\xde\\x18\\x6f\\x29\\xbe\\x98\\x44\\x78\\x4b\\x8c\\xaa\\xa8\\x1a\\xf0\\xf9\\x89\\xe3\\x03\\x10\\x62\\x3c\\x28\\xca\\xe4\\x92\\x5c\\xc2\\xcc\\x8e\\xee\\xfc\\xec\\xe9\\x21\\x99\\xb8\\x3a\\x2c\\xaf\\x01\\x86\\xe9\\xf3\\x35\\x20\\x9a\\xc4\\x1b\\x79\\x2a\\xbe\\xd3\\x37\\xfa\\x49\\x01\\x9c\\xfc\\x4d\\xa0\\xea\\x78\\x7a\\xf7\\xde\\xc2\\xe3\\x79\\x4b\\x9c\\xac\\x5c\\xe4\\x7d\\xef\\x2d\\x79\\xd6\\x8d\\x3c\\xd1\\x97\\xd8\\x6e\\x71\\xcc\\x37\\x0d\\xeb\\x2d\\xad\\x37\\x46\\x28\\x41\\x10\\xc6\\x23\\x24\\x41\\x16\\x38\\x21\\xbc\\x96\\x4b\\xf0\\x5a\\xb2\\xf7\\x00\\xc3\\xe1\\x39\\x20\\x55\\x97\\x5b\\x94\\x41\\xd9\\x46\\xa4\\x29\\x86\\x4e\\xd5\\x96\\xe8\\x54\\x1d\\xe1\\x8a\\x65\\x03\\x76\\x59\\x5f\\xfa\\x13\\xaf\\xa7\\xc0\\x53\\xf5\\xe3\\x57\\xf9\\xbe\\xfe\\x50\\xab\\xa3\\x31\\xdd\\x1f\\x6a\\xf5\\x34\\x66\\xe3\\x46\\xa5\\x42\\x4e\\xa5\\xe2\\x46\\xa5\\x22\\x4e\\xa5\\x42\\xbe\\x58\\x11\\xa7\\xbe\\x23\\x6e\\x94\\x95\\xbe\\x05\\x7a\\x7b\\xc4\\xe7\\xc8\\xda\\x6e\\x63\\x3e\\xb9\\x2e\\xeb\\x0d\\xdf\\x5e\\xdb\\xca\\xa6\\x92\\x85\\x3c\\xd5\\xff\\x8e\\xc8\\x53\\xfd\\xcd\\x90\\xa7\\xfa\\xff\\x00\\xf2\\x94\\xe1\\x9a\\x8d\\x6c\\x77\\xb4\\x29\\x09\\xc4\\xee\\x8e\\xc6\\x53\\x40\\xcc\\x9d\\xee\\x8e\\xe6\\x05\\x68\\xc1\\x6c\\x77\\xb4\\x28\\x43\\xc2\\x54\\x77\\x74\\x98\\x97\\x50\\xc5\\x4c\\xe8\\x43\\x84\\xab\\xf0\\x08\\x97\\xd4\\xc8\\xab\\x06\\x08\\xb5\\xca\\xaf\\x8e\\xfa\\xeb\\xa9\\x12\\xe5\\x25\\x58\\xd2\\xc8\\x95\\xf9\\x67\\x23\\x37\\x3f\\xf6\\x93\\x19\\x40\\x2e\\x45\\xe8\\x60\\x54\\x2f\\x17\\x06\\x49\\x6f\\x2d\\x78\\xa9\\xed\\xed\\xba\\xbe\\xf0\\x3b\\xdb\\x75\\x14\\x77\\x25\\x8d\\x0c\\x1e\\xf0\\x45\\x24\\x4c\\xbc\\xe8\\x93\\xe4\\xa2\\xcc\\x87\\x8d\\xf9\\x64\\x9a\\xcb\\x31\\x1c\\xe1\\x06\\x8c\\xa4\\x63\\x38\\x8e\\x20\\xd0\\x50\\xb2\\x99\\x47\\x6c\\xe7\\x5e\\x94\\xe8\\x43\\x03\\x46\\xbb\\x16\\x7e\\x6b\\x2d\\xa2\\xe4\\xe7\\xb1\\x8c\\x26\\x04\\xf1\\x53\\x0d\\xdc\\x8e\\xc0\\x5f\\xc8\\x35\\xab\\xbd\\x80\\x40\\xef\\x05\\x52\\x85\\xc7\\xca\\x86\\x5a\\xd9\\x25\\xf2\\x89\\xb7\\x92\\x85\\x38\\x9a\\x35\\x96\\x39\\xd8\\x2f\\x55\\x4a\\x64\\x1e\\x01\\xa6\\x28\\x62\\x8c\\x1f\\xc5\\x92\\x1c\\x18\\x36\\x39\\x5d\\xe9\\xf4\\x95\\x35\\x89\\xf7\\xa2\\x81\\x40\\xe2\\xb2\\x53\\x4d\\xf8\\xc9\\x2f\\xde\\xc2\\x53\\xd8\\x04\\x4b\\x8b\\xbe\\x21\\x93\\x84\\x63\\x7c\\x6a\\x73\\x7d\\xfb\\x64\\x42\\x80\\x97\\xc7\\x6a\\xe7\\x6f\\xb3\\x02\\x73\\xee\\x2a\\xa0\\x17\\x9f\\x92\\x99\\xfb\\x7c\\x3f\\xe1\\x64\\x9f\\x30\\x19\\xf5\\x56\\x87\\x57\\xd2\\x3c\\xb1\\x7c\\x5e\\x08\\x0f\\x6c\\x03\\x14\\x86\\xdb\\x4d\\xfc\\xaf\\xbc\\x21\\x95\\x5e\\xa5\\xe3\\x52\\xb5\\xe3\\x4e\\xbd\\xb4\\x76\\x45\\xaa\\x22\\xa4\\x7b\\x03\\xa6\\xcf\\xf7\\xd1\\xb7\\x30\\x83\\x4f\\xe4\\xf7\\x30\\x07\\x4f\\x83\\x14\\xdf\\xe3\\x3a\\x3c\\x8b\\x8d\\x86\\x7b\\xa9\\xd4\\x09\\x7a\\x79\\x2a\\x0d\\x8c\\x8a\\x16\\x51\\xd0\\xc0\\x2a\\xd6\\x41\\x0d\\x53\\x4c\\x95\\x6b\\x9c\\x21\\x8c\\x9a\\xbe\\x41\\x55\\xab\\x05\\x1b\\x8a\\xc1\\xde\\x90\\xbe\\x3b\\x54\\x90\\x4c\\x8d\\xc1\\xa7\\x9a\\xd0\\x30\\x9b\\x11\\xba\\xeb\\x50\\xa9\\xb4\\xd9\\x0d\\xc2\\x16\\xd5\\x12\\x0e\\x68\\xd7\\xb8\\x81\\xc1\\xdd\\x1b\\xd6\\x07\\xbe\\x21\\x48\\xba\\xf0\\xaf\\xd3\\xd3\\xd3\\x82\\x35\\x58\\xbc\\x49\\xd7\\xad\\x1b\\x8b\\xf1\\x39\\x60\\x5d\\xfb\\x74\\xe7\\x53\\xd9\\x15\\xfa\\x07\\x6f\\x1f\\x5c\\x02\\xdf\\xe0\\xd1\\x63\\x83\\xf9\\x13\\x6e\\xf2\\xbd\\x5f\\xc0\\xbc\\x11\\x97\\xef\\xe5\\x33\\x60\\x4b\\x7f\\xbc\\x61\\x75\\xc0\\xdc\\xc7\\xc7\\xee\\x27\\x3a\\x55\\x4e\\xf4\\x09\\x22\\xfa\\x59\\x97\\xf4\\xcb\\xc5\\x4c\\xae\\x08\\x74\\x18\\x37\\xc9\\xaa\\x35\\xe9\\xc4\\x19\\x69\\xa6\\x09\\x31\\xf1\\x8d\\x06\\x89\\xcc\\xd8\\x61\\x9f\\xe9\\xe5\\x6d\\xf6\\xd1\\xd1\\x83\\x84\\x7f\\x8a\\x07\\x09\\xa7\\x44\\x17\\x43\\xf0\\x71\\x4f\\xd7\\xee\\xa3\\x37\\xc2\\x1a\\x9b\\x6b\\xa1\\xcc\\x65\\x83\\xb2\\x3e\\x8b\\xae\\x01\\x0f\\x2b\\x7a\\xc9\\xf6\\xd9\\xdd\\xbc\\xbf\\xa8\\x69\\x20\\x59\\xd3\\x9b\\xc9\\x4c\\x70\\x23\\xf3\\xc4\\x3d\\xfa\\x72\\xcc\\xc4\\xbc\\x9e\\x8e\\xe8\\x69\\x18\\x1c\\xae\\xc6\\x3b\\xc9\\xb5\\x1a\\x18\\x2f\\x86\\x51\\xfa\\x4f\\x13\\x6a\\x41\\xde\\xfb\\xe1\\xb0\\x13\\x1a\\xd9\\xa8\\xa5\\x8b\\xb5\\x44\\xe4\\x12\\x2a\\x7b\\x47\\xfa\\xf4\\x5d\\x5d\\xb8\\xec\\x95\\x19\\xb6\\x1e\\xd3\\x08\\x6e\\x65\\xac\\xa5\\x60\\x48\\xa5\\x49\\xc6\\xa1\\x98\\xd1\\x58\\x48\\x6b\\x2e\\xb1\\xce\\x08\\x98\\x25\\xf3\\xd7\\x81\\xab\\x61\\x45\\xc5\\x78\\xa4\\x1a\\x25\\x7a\\xa6\\x28\\xe9\\xde\\x77\\xd7\\x32\\xad\\x28\\x5b\\xe9\\x5a\\xa6\\x35\\x58\\xd7\\xce\\x0a\\x69\\x0d\\xd4\\xcd\\x12\\x76\\xad\\x78\\x65\\xe9\\x42\\xbf\\x09\\x76\\x4c\\x13\\xfa\\x55\\x99\\x1f\\xcf\\x90\\x56\\x4c\\xe6\\x8f\\x8b\\xfc\\xfc\\x3c\\x2d\\x17\\x13\\xf9\\x93\\x12\\xbf\\x28\\x42\\x5a\\xba\\xc4\\xaf\\x0b\\xfc\\xad\\x27\\x8e\\x3f\\xcd\\x89\\x55\\xc5\\x17\\xc5\\xdc\\xc1\\x88\\xad\\xc8\\x28\\x21\\x65\\xce\\x81\\xc2\\x59\\xd8\\x8a\\xc9\\x9f\\x2d\\x26\\x4f\\x76\\x33\\xd3\\x9a\\xbb\\x4c\\x04\\x0a\\x6c\\xc2\\x56\\x9b\\x74\\x41\\x84\\xee\\x59\\x85\\xad\\x0e\\x16\\x48\\xe3\\x1d\\xec\\x1f\\x74\\x25\\xef\\x60\\xd7\\xb2\\x29\\xf7\\xd3\\xe2\\x0e\\xb7\\x5b\\x0f\\x0f\\xdb\\xad\\x2c\\x70\\x9a\\x2e\\x84\\xe5\\x75\\xf3\\x81\\xd3\\x84\\x5e\\xd7\\x1e\\x7c\\xa7\\x3e\\x1b\\x21\\xf7\\xb5\\x60\\x01\\x0e\\x1f\\x21\\xf7\\x99\\x82\\xee\\x86\\xb4\\x45\\x35\\xe8\\x6e\\x90\\x11\\xf7\\xc6\\x9b\\xe2\\xe1\\x69\\xe1\\x46\\xc9\\xc2\\x82\\xfc\\x2c\\x90\\x01\\x1c\\x3d\\x36\\x24\\x23\\x6f\\xa8\\x07\\x70\\x68\\x57\\xe3\\x11\\x1c\\x2d\\x64\\x1b\\x57\\x1e\\xe1\\x48\\xb2\\x91\\x71\\x5f\\x5e\\x62\\xdf\\x3f\\xb2\\x79\\x23\\xbc\\xc4\\xdb\\xa0\\xb3\\x42\\x44\\xfe\\x01\\xdf\\xca\\xd4\\xb0\\xcf\\x05\\x85\\x7d\\xcc\\x32\\xe2\\x22\\x02\\x87\\xf9\\xb0\\x4a\\x02\\x8e\\x82\\xd3\\x64\\x48\\x34\\xc2\\xbd\\x94\\x4e\\x78\\x6c\\xa6\\x8f\\x86\\xfd\\x50\\x97\\x1b\\x78\\xcf\\x3e\\x76\\x47\\x77\\x30\\xe6\\xec\\xd7\\x39\\x55\\x7d\\x19\\x5e\\x56\\x2e\\x8f\\xc1\\xc0\\xb8\\x05\\x85\\x11\\xf4\\x14\\xb7\\xe7\\x9f\\x08\\xbb\\x50\\x59\\x8f\\x9f\\xb0\\x9a\\xec\\xd5\\x04\\xd9\\xcd\\xf8\\x50\\x84\\x3b\\xdc\\x43\\x1f\\x6f\\x1d\\x5f\\x00\\x94\\xc3\\xb9\\xa7\\x97\\x1f\\x01\\x52\\x11\\xbe\\x6a\\xf2\\xfc\\x44\\xba\\x91\\x98\\x99\\x44\\xd6\\x26\\xaa\\x81\\x8d\\x42\\xb3\\x2e\\xa7\\xb4\\x00\\xaf\\xb5\\xa5\\x89\\xc8\\xc7\\x89\\x3b\\x8c\\x96\\xe7\\xc9\\x26\\x8e\\x9e\\x0a\\x0a\\x1e\\x4a\\xdd\\x94\\x1d\\x82\\x29\\x5b\\xd8\\x06\\x9a\\x4f\\x21\\x0b\\xa4\\x1b\\x46\\xad\\xa8\\x94\\x79\\x8c\\xb1\\xd6\\x6d\\x7a\\xad\\xbd\\x8d\\xe1\\xc2\\xd0\\x11\\x67\\x16\\xa4\\xae\\x9b\\x43\\x40\\x30\\xe3\\xc3\\x10\\xb1\\x57\\xf5\\xff\\xfb\\xf2\\x55\\x1e\\x01\\x46\\x0e\\xe1\\x0e\\xf4\\x80\\x57\\x28\\xef\\xfd\\xb2\\x57\\x2e\\xac\\xe8\\x9e\\xf4\\x7f\\x03\\x00\\x00\\xff\\xff\\xdc\\x02\\x04\\xb3\\x7b\\xeb\\x02\\x00\")\n\nfunc uiJsLibsNvd3171NvD3MinJsBytes() ([]byte, error) {\n return bindataRead(\n _uiJsLibsNvd3171NvD3MinJs,\n \"ui/js/libs/nvd3/1.7.1/nv.d3.min.js\",\n )\n}\n\nfunc uiJsLibsNvd3171NvD3MinJs() (*asset, error) {\n bytes, err := uiJsLibsNvd3171NvD3MinJsBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/js/libs/nvd3/1.7.1/nv.d3.min.js\", size: 191355, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiTsAppTs = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\x94\\x92\\xcf\\x6e\\xe2\\x30\\x10\\xc6\\xef\\x79\\x8a\\x91\\x4f\\x41\\x62\\xe3\\x7b\\x58\\x56\\x0b\\x12\\x42\\x7b\\xd8\\xaa\\x6a\\xa5\\x5e\\x91\\x89\\xa7\\x89\\x2b\\x6c\\x47\\x63\\xa7\\x14\\x55\\x7d\\xf7\\x1a\\x43\\xda\\xa4\\x29\\x28\\xcd\\xc1\\xff\\xf2\\xfb\\x3c\\x9e\\x6f\\x86\\x73\\x70\\xb6\\xa1\\x02\\x73\\x10\\x75\\x9d\\x79\\x97\\xf0\\x70\\xf4\\x9b\\xf0\\x11\\x09\\x4d\\x81\\x50\\x0b\\x5f\\xcd\\x99\\x3f\\xd4\\xca\\x94\\x8e\\x6b\\xe5\\x2b\\x52\\xbb\\xa7\\x8f\\x55\\x26\\x83\\x86\\x01\\xff\\x93\\x7c\\x2f\\xac\\x45\\x89\\x8e\\x97\\x24\\xea\\xaa\\x05\\xaf\\x70\\xda\\x1a\\xe5\\x2d\\x8d\\x20\\x8d\\x95\\xe8\\x46\\x70\\x84\\xce\\x6f\\xf0\\xa5\\xde\\x59\\xc2\\x31\\xf7\\xba\\x10\\xfe\\xf3\\xe2\\x40\\xc2\\xa2\\xf1\\x95\\xa5\\x1c\\x16\\x46\\x12\\xee\\x61\\x69\\xcd\\x33\\x1a\\x4f\\x08\\xa9\\x30\\xf2\\xb0\\xb5\\xc6\\xfd\\x2d\\xb5\\x08\\x4e\\x14\\x56\\x4f\\xba\\x82\\x25\\x09\\x0d\\x6b\\x6a\\x0c\\x2a\\x82\\x74\\x1b\\x76\\xe5\\x69\\xd3\\xe5\\x13\\x9d\\x91\\x6d\\x3c\\x66\\x3a\\x24\\x04\\x73\\x60\\x95\\x70\\x15\\x9b\\xb5\\xc7\\xa9\\xb4\\x45\\xa3\\x43\\xbc\\xac\\x44\\xbf\\xda\\xe1\\x71\\xb9\\x3c\\xfc\\x93\\x29\\x23\\x6b\\x3d\\x9b\\x4c\\x81\\xc5\\x14\\x7f\\xb5\\x29\\xb2\\x29\\xbc\\x26\\x10\\x3e\\x76\\x32\\x9d\\x85\\x87\\x4b\\xad\\xcc\\x83\\xc2\\xbd\\xcb\\xd6\\xb1\\x0e\\xb7\\x21\\xd3\\xe9\\x19\\x3a\\x3b\\xde\\xc7\\xfe\\x9f\\xcb\\xd0\\x05\\x8f\\x86\\xf7\\xa9\\x9b\\x58\\x82\\x38\\x7e\\x05\\xdd\\x68\\x92\\xe7\\xc7\\x71\\xa3\\xe4\\x25\\xc5\\xe0\\xea\\x1f\\x29\\xfa\\xde\\xf4\\x04\\x77\\xe1\\xd7\\xaa\\x6d\\x8c\\xae\\x26\\xb6\\x40\\x9f\\xbd\\x3f\\x75\\x45\\x9c\\x06\\xa8\\xbb\\xcc\\xba\\x01\\xcc\\xf3\\x38\\x0d\\x9e\\x7f\\x3d\\xc2\\x58\\x55\\xf2\\x36\\x99\\x25\\xef\\x01\\x00\\x00\\xff\\xff\\x27\\x3f\\x35\\x45\\xd3\\x03\\x00\\x00\")\n\nfunc uiTsAppTsBytes() ([]byte, error) {\n return bindataRead(\n _uiTsAppTs,\n \"ui/ts/app.ts\",\n )\n}\n\nfunc uiTsAppTs() (*asset, error) {\n bytes, err := uiTsAppTsBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/ts/app.ts\", size: 979, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiTsComponentsMetricsTs = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\xa4\\x58\\x6b\\x8f\\xdb\\xb8\\x15\\xfd\\xee\\x5f\\xc1\\x1a\\x08\\x56\\x0e\\x66\\xe9\\x09\\x06\\xed\\x07\\xa5\\x93\\xb6\\x48\\xb6\\x8b\\x00\\x3b\\xbb\\x68\\x53\\xa4\\x2d\\x8a\\xa2\\xa0\\x25\\xda\\x66\\x86\\x12\\x55\\x92\\xf2\\xa3\\x03\\xff\\xf7\\x9e\\x4b\\x4a\\xf2\\x43\\xb2\\x3c\\x45\\x89\\x20\\x63\\x49\\x97\\xe7\\x92\\xf7\\x79\\xc8\\xf9\\x9c\\x39\\x53\\xdb\\x4c\\xa6\\x2c\\x33\\x45\\x65\\x4a\\x59\\x7a\\x37\\x2f\\xa4\\xb7\\x2a\\x73\\xdc\\xbb\\xc9\\x1c\\x12\\xbf\\xb5\\x72\\x29\\xad\\x2c\\x33\\xc9\\x2a\\xe1\\xd7\\x8f\\x53\\xce\\xe7\\x7e\\x5f\\xa9\\x72\\x05\\x51\\xe5\\xd7\\x56\\xe9\\x6f\\xdd\\x2f\\x9e\\x63\\xda\\x94\\xcd\\x3f\\xdc\\x9c\\x9a\\x3f\\xe0\\xdf\\x6d\\xf1\\xc2\\xe4\\x52\\xbb\\xb9\\x57\\x85\\x74\\xd2\\x2a\\xe9\\xda\\x09\\x93\\xc9\\xfc\\xed\\x5b\\x36\\x61\\x6f\\xd9\\xc7\\x6e\\xe9\\x2c\\x97\\x4b\\x55\\x4a\\xc7\\xac\\xac\\x9d\\x58\\x68\\x79\\xb2\\x2d\\xb6\\x5d\\xab\\x6c\\xcd\\x0a\\xb1\\x67\\x0b\\xc9\\x6a\\x27\\x73\\x66\\x4a\\x56\\xd4\\xda\\xab\\x4a\\x93\\xc2\\x95\\x74\\x77\\x04\\x67\\xec\\xf1\\x6d\\x50\\x4b\\x72\\x7e\\x2d\\x99\\x13\\x45\\x94\\xe3\\x10\\x9b\\x4f\\xb0\\xb2\\x1a\\x22\\x27\\xda\\x5f\\x26\\x0c\\x03\\xcb\\x0a\\x7f\\x01\\x55\\x6e\\x58\\xb6\\x16\\x16\\x9f\\x1a\\xe1\\xdc\\x00\\xae\\x34\\x9e\\x65\\xb5\\xc5\\x46\\xbd\\xde\\xb3\\xb5\\xd8\\x48\\x26\\x18\\xcc\\x22\\x5d\\x66\\x55\\xe5\\xe3\\x26\\x94\\x57\\xa6\\xe4\\x0d\\xd0\\x3c\\xfc\\xcd\\x65\\xa6\\x85\\x95\\x6c\\x23\\x2c\\x90\\x53\\x51\\xee\\xdf\\x4f\\x2e\\x35\\x3e\\x45\\xdf\\x61\\xdf\\xa5\\x17\\xaa\\x74\\xa7\\x06\\x08\\x7b\\xf6\\x86\\xe5\\xca\\x55\\x1a\\x66\\x68\\xfc\\xcc\\x72\\xe1\\xc5\\xb9\\x26\\xb9\\xab\\x8c\\xf5\\xed\\xa2\\x5b\\xcc\\xb8\\xbd\\x33\\x85\\x51\\xe9\\x4f\\xb0\\xf9\\x8f\\x56\\x54\\xeb\\x16\\xda\\x61\\x43\\x1a\\x2f\\xd9\\x2a\\xbc\\x35\\xcb\\x60\\x3f\\xd2\\x03\\xcf\\xf8\\xda\\x96\\x58\\xc8\\xd2\\x9a\\x82\\xf6\\x0d\\x0b\\x9f\\x62\\x45\\x27\\xb3\\x7f\\xd7\\xd2\\xee\\xf9\\xc9\\x87\\x79\\xf7\\xfb\\x7c\\x71\\x47\\xdd\\xc7\\xe5\\xf5\\x96\\x18\\xa1\\xbf\\x2a\\xb9\\x7d\\xa2\\x70\\x62\\xca\\x85\\x05\\x85\\xd8\\x62\\x4b\\x38\\x5c\\x30\\x57\\xc9\\x4c\\x2d\\x55\\x76\\x02\\xf8\\x3d\\x53\\x25\\x13\\x79\\x1e\\x5c\\x01\\xc3\\x5d\\xe2\\x11\\xc4\\x42\\x64\\xcf\\x08\\x67\\xf6\\x27\\x5a\\x2f\\x33\\x8b\\x6f\\x32\\xf3\\x77\\x4c\\x79\\x26\\xb4\\x33\\x08\\x36\\xd5\\xb8\\xc1\\x40\\xd8\\xb2\\x4a\\xda\\xef\\x3b\\x87\\x5c\\xc2\\xb5\\x6e\\x31\\x15\\xe9\\x73\\xfc\\xe2\\xfb\\xfc\\xec\\x19\\xb8\\xd2\\x2e\\x05\\x32\\xe5\\xb8\\xab\\x73\\x03\\xd0\\x08\\x56\\x4c\\xc3\\x57\\xc7\\x1b\\x37\\xf2\\xb0\\xd4\\x27\\x51\\x22\\x90\\xed\\xfb\\xde\\x14\\x2d\\x9c\\xff\\xa1\\x32\\xd9\\x3a\\x2d\\xeb\\x62\\x31\\x24\\xf1\\x2c\\xf7\\xbf\\x1b\\xfc\\x78\\x98\\xdc\\xf2\\xc0\\x47\\x44\\xa5\\x35\\x5a\\xc3\\x14\\x5d\\x80\\x06\\x2b\\xd6\\xfa\\x99\\xa2\\x64\\x59\\x97\\x19\\x6d\\x5e\\x68\\xe5\\xf7\\xac\\x94\\x32\\x8f\\x11\\x8b\\x54\\xc9\\x31\\x47\\x5c\\xe2\\x75\\xbe\\x1a\\x37\\x16\\xd2\\xc6\\xb9\\x53\\xe5\\x7d\\x4b\\xa1\\xfa\\x94\\x9b\\xfc\\x21\\xa6\\x2b\\xef\\x7d\\x0e\\xaf\\xd9\\x23\\x64\\x78\\x2c\\x48\\x9c\\xc2\\xfb\\x23\\xbd\\x4d\\x66\\x3d\\x69\\x1a\\x7c\\x97\\x24\\xf9\\x8c\\x3d\\x7e\\xc0\\x36\\xb6\\xec\\x93\\xf0\\x32\\x41\\xad\\xa3\\x72\\xe2\\x45\\x51\\xfd\\xab\\x14\\xa5\\x71\\xf3\\x77\\xfc\\x5e\\xfe\\x66\\x76\\x05\\x60\\xdf\\x02\\xe4\\x7c\\x23\\x74\\x2d\\x87\\xc5\\xe6\\x73\\x1e\\x62\\x41\\xc0\\x70\\x1b\\x99\\x78\\x7b\\x4d\\x90\\x23\\xfd\\x3f\\x1f\\x25\\x7f\\xac\\x15\\xf6\\x81\\x4d\\xc4\\x29\\x6c\\x78\\x8e\\x5b\\x9b\\xed\\x4f\\x72\\x05\\xf3\\x8f\\x21\\x93\\xd4\\xdf\\xff\\xb0\\x53\\xee\\x96\\xd0\\xdf\\x6e\\x09\\xed\\xbe\\x64\\x42\\xc3\\x52\\x0f\\xc1\\x54\\xdc\\x85\\xa7\\xd9\\xec\\xfd\\xa4\\x27\\x0e\\x33\\x7a\\x64\\x6b\\x66\\xb4\\xb1\\x0e\\x9e\\xc1\\x94\\x20\\xcd\\x33\\x98\\x7a\\x65\\xec\\xfe\\xdd\\x7d\\x32\\x34\\x0f\\x71\\xe7\\xb0\\x80\\xcc\\x1b\\x9b\\x54\\xf5\\x42\\x03\\x63\\x53\\xa4\\x5d\\x12\\xcd\\x06\\x62\\x83\\x06\\xe2\\xe3\\x8b\\xf4\\x6c\\x47\\x1b\\x40\\xcd\\xca\\x9e\\x1d\\xc5\\x65\\x65\\x0d\\x52\\x1a\\x45\\x1c\\x35\\xa4\\x10\\x03\\x71\\x43\\xc3\\xaf\\x95\\xe3\\x31\\xae\\xc2\\xf4\\x41\\xa1\\xb0\\x7b\\xc2\\xfd\\x63\\x40\\xea\\x2c\\x10\\x81\\x93\\xef\\xde\\x7c\\x4e\\xdf\\x3c\\xa5\\x6f\\xbe\\x7c\\x77\\x25\\x5a\\x3a\\x13\\x3f\\x89\\xdd\\x93\\x2a\\x93\\x25\\xea\\x8f\\x9c\\xf5\\x93\\xf7\\xd0\\xb7\\x48\\x2f\\x4f\\x69\\xa0\\x10\\xaf\\x4d\\xad\\xf3\\x3f\\x87\\xcc\\xfb\\x74\\xac\\xdc\\xd8\\x37\\xdc\\xc7\\x54\\x28\\xe9\\x68\\x46\\x30\\x07\\x05\\x78\\xa8\\xed\\x5d\\xa6\\x0e\\x18\\xe2\\x22\\x25\\x69\\x5c\\x6a\\x48\\x66\\xe9\\xc2\\x18\\x2d\\x45\\x79\\xc5\\x09\\xd4\\xf8\\x24\\xd5\\x26\\xf8\\x3b\\x58\\x75\\x53\\xf0\\xd8\\x28\\xc2\\xdb\\x2b\\x99\\x88\\xa5\\x26\\x71\\xd6\\x87\\x6e\\x56\\x57\\xe5\\xae\\xf9\\x9b\\x46\\x4f\\x18\\x6a\\x03\\xd0\\xd5\\x19\\xd1\\x44\\xc1\\x42\\x7d\\xd3\\xd3\\x38\\x0c\\xbe\\x6d\\xa6\\x05\\x9f\\xbd\\xd6\\x65\\x03\\x09\\xfb\\x16\\x5c\\xc2\\x0d\\xba\\x2a\\xb6\\xe1\\xe0\\x23\\xf8\\x4b\\x6c\\x84\\xd2\\x81\\x1d\\xfd\\x8f\\x0e\\x6b\\xe0\\x6f\\xfa\\xa9\\x35\\xc3\\x90\\x8b\\xe0\\x84\\xfb\\xff\\x67\\x8b\\xb9\\x15\\xdb\\xd8\\x9e\\x57\\x92\\x08\\x9f\\xb2\\xe8\\xb8\\x4c\\x64\\x99\\x74\\x21\\x25\\x03\\x51\\xdb\\xac\\x98\\xd4\\xb2\\x40\\x93\\x6d\\xb9\\x47\\xb0\\xc0\\x10\\x9e\\x58\\xa2\\x24\\x52\\xc3\\x26\\xc3\\xe4\\x4d\\xbf\\xf9\\xf4\\xcb\\x13\\x67\\x7f\\x0d\\x2c\\x91\\xfd\\xfc\\xf5\\xd3\\x43\\x60\\x4d\\x50\\x7c\\xa4\\x31\\xc4\\x5e\\x86\\xe0\\x48\\xe0\\x92\\xbb\\x8c\\x58\\xf4\\xb8\\x9b\\x47\\x04\\x69\\x5c\\x72\\xfa\\x43\\xfc\\x0b\\x1a\\xe1\\x3e\\x13\\x0f\\x44\\x37\\xfc\\x8f\\xcc\\x5b\\x9b\\xdf\\x85\\xd6\\x29\\x77\\x9e\\x08\\x60\\xe8\\x0f\\xc3\\x4e\\xa0\\xb0\\xff\\xd5\\x19\\xc2\\x58\\xac\\xa3\\xb1\\x61\\xf7\\x61\\x29\\xc9\\xb1\\x60\\x0d\\x14\\x10\\x1a\\x07\\xd6\\xf7\\x57\\xab\\x32\\x4c\\xee\\x67\\xf6\\x98\\x6e\\x4a\\xeb\\x58\\xe7\\xbc\\xcc\\x43\\xfc\\x3e\\xb2\\x7f\\xfc\\xf3\\xaa\\x38\\x4a\\xf1\\x5f\\x60\\x65\\x2b\\x1d\\x58\\x3a\\x02\\x2a\\x16\\x61\\xf0\\x85\\xad\\xd2\\x9a\\xb8\\xbd\\x2c\\x2a\\x3c\\x61\\x31\\x08\\x50\\x69\\xad\\xb1\\x63\\x50\\x26\\x03\\x15\\x97\\x39\\x67\\x28\\xbc\\x60\\xe6\\xdb\\x3b\\xb6\\x95\\x11\\xe9\\x5b\\xed\\x7c\\x47\\xca\\xc8\\xaf\\xd3\\x9f\\x0d\\x35\\x72\\x31\\x1d\\xc3\\x43\\x83\\x77\\x60\\x56\\xac\\x2e\\xbd\\xd2\\x84\\x05\\xd6\\xae\\xf2\\x78\\xd8\\x20\\x90\\xb8\\x5a\\xb6\\x25\\xcc\\x8e\\x8a\\x8f\\x01\\x86\\x1d\\xb4\\xb0\\x97\\xac\\xf0\\x64\\x74\\xc6\\xef\\x32\\xae\\xb5\\xd0\\x98\\xed\\x69\\x5c\\xda\\x7e\\x18\\xa5\\xf9\\xe1\\x78\\x21\\xaa\\x96\\x99\\x8c\\xe3\\xd2\\x68\\x4a\\xc1\\x6d\\x41\\x1a\\x81\\xe6\\xb8\\x14\\x84\\x87\\x72\\xac\\x32\\x20\\x36\\x74\\x24\\x7b\\xc5\\x00\\x27\\xa5\\x69\\x25\\x4e\\x68\\xaf\\x9b\\x10\\x78\\x43\\x7a\\xc2\\x09\\x79\\x64\\x12\\x49\\x04\\x99\\xbd\\x0e\\x05\\xa7\\x31\\x91\\x52\\x91\\x7d\\x9d\\xf8\\x12\\x61\\xf5\\x4b\\x25\\x32\\x90\\xdb\\x94\\xbf\\xbb\\x3d\\xe7\\x30\\x9c\\x7e\\xdd\\xe7\\x2b\\xe9\\x19\\xbe\\x5d\\xfd\\x42\\x44\\x09\\x95\\x26\\xf3\\x6d\\xbd\\xb9\\x4e\\x28\\x68\\x90\\x2b\\xea\\x22\\x39\\x8b\\x91\\x11\\x0a\\xe2\\xad\\x28\\x5d\\x38\\x30\\x21\\x62\\xf2\\xda\\x8a\\xf0\\xf3\\xd7\\xf7\\xf7\\x37\\xb4\\x80\\xba\\xe9\\x57\\x14\\x9e\\x81\\xce\\x71\\xfe\\x74\\xf6\\xd8\\x9c\\x14\\xdb\\x53\\x45\\x28\\x9c\\xd1\\xdb\\x49\\x60\\xf1\\xe3\\xb4\\xaf\\x09\\x5d\\x62\\x37\\x1f\\x2f\\x26\\xce\\x46\\x0f\\x3e\\x97\\x6a\\x37\\xd0\\x92\\x64\\xde\\xea\\xf4\\x88\\x33\\xa4\\x90\\x32\\x98\\xc4\\x78\\xd7\\x67\\xaf\\x65\\x6e\\xb3\\xb4\\x22\\x99\\x86\\x73\\x48\\x68\\x6e\\xd3\\xbb\\x61\\x0e\\xdf\\x8e\\x17\\xe7\\xf7\\x5a\\xa6\\xd3\\xad\\xca\\xfd\\x3a\\x85\\x47\\xaa\\xdd\\xfb\\xb5\\x54\\xab\\xb5\\x4f\\x1f\\xc2\\xc3\\xf4\\x30\\x1e\\x91\\xd0\\x86\\xc6\\xca\\x5b\\x65\\x2f\\xb0\\xe6\\x52\\xad\\x52\\x16\\x96\\xdc\\x35\\xb2\\xc3\\xb8\\xa3\\x87\\x28\\x29\\x7a\\x35\\xfa\\xec\\xad\\x9d\\x42\\xe5\\x54\\x1b\\x91\\xe3\\xb4\\xcd\\x39\\x9f\\x0e\\x72\\xdb\\xf3\\xa7\\x5b\\xa7\\xd1\\x0c\\xd9\\xeb\\xc1\\x8f\\x70\\x20\\x10\\xa8\\xd6\\xf8\\x4d\\xf7\\x16\\x0e\\x0a\\x74\\xfb\\x16\\xe7\\xeb\\x86\\x40\\x1c\\xaf\\x05\\xae\\x1e\\xe0\\xe3\\x05\\x53\\x77\\x05\\xd2\\xf1\\x84\\xc8\\x49\\xea\\xaa\\xd2\\x0a\\x7d\\xe0\\xec\\x18\\xde\\xdc\\x18\\x5c\\x1e\\x5f\\x2f\\x91\\x7f\\x5f\\x09\\x2b\\x0a\\xaa\\x72\\xa1\\xf5\\xd1\\xdf\\xf8\\x46\\x35\\xb7\\x3a\\x8b\\x3d\\x6b\\x2e\\xe0\\x02\\x07\\xc2\\x19\\xef\\xb9\\x81\\x76\\x74\\x89\\xa1\\x95\\xeb\\x2e\\xc0\\x32\\x74\\xc5\\x05\\xb5\\x4f\\x61\\x91\\xab\\x2b\\xb4\\xbe\\xd1\\xb3\\x73\\x2f\\x87\\x82\\xd1\\x92\\x9b\\x37\\x0b\\x77\\xa7\\xf7\\x04\\xb3\\xbe\\x73\\xa9\\xe9\\x9f\\x1e\\xbc\\xd0\\x77\\x5e\\x8e\\x77\\x0f\\xf7\\x77\\xcd\\xdd\\x45\\xf8\\xbf\\x9f\\xf6\\x94\\x2a\\xc0\\xbf\\x96\\x1f\\x68\\x5e\\x64\\xa3\\x47\\x5a\\xc3\\xad\\x38\\xa1\\xd1\\x46\\x19\\xef\\x7c\\x9b\\x74\\xfe\\xbe\\x03\\xda\\x6c\\x32\\x3c\\x3f\\xfe\\x3a\\x4c\\x0e\\x93\\xff\\x06\\x00\\x00\\xff\\xff\\x8c\\xe7\\x71\\x33\\x4a\\x15\\x00\\x00\")\n\nfunc uiTsComponentsMetricsTsBytes() ([]byte, error) {\n return bindataRead(\n _uiTsComponentsMetricsTs,\n \"ui/ts/components/metrics.ts\",\n )\n}\n\nfunc uiTsComponentsMetricsTs() (*asset, error) {\n bytes, err := uiTsComponentsMetricsTsBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/ts/components/metrics.ts\", size: 5450, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiTsHeaderTs = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\x6c\\x53\\x41\\x6f\\x9b\\x4c\\x10\\x3d\\xc7\\xbf\\x62\\x3e\\x5f\\xe2\\x48\\xfe\\x20\\x8d\\xd4\\x4b\\xa2\\x4a\\x21\\xb1\\x9b\\xa2\\xa6\\x58\\x32\\xa4\\x51\\x8e\\xcb\\x32\\x86\\x6d\\x61\\x97\\xce\\x2e\\x21\\xfc\\xfb\\xce\\x02\\x4e\\x13\\xb5\\x3e\\x79\\x66\\xdf\\xbc\\x79\\x6f\\x66\\x08\\x43\\xb8\\x43\\x8d\\x24\\x1c\\x16\\x90\\x0f\\xe0\\xac\\x0c\\x16\\x9c\\xb4\\xa6\\x23\\x89\\x97\\x20\\x8d\\xfc\\x49\\x46\\xc8\\x2a\\x24\\x9c\\x72\\x61\\x67\\x43\\x67\\xc3\\x20\\x18\\x71\\x9b\\x1d\\x24\\xbb\\x0c\\xb6\\x9b\\x38\\xfb\\x8f\\x63\\x9f\\xba\\x35\\xed\\x40\\xaa\\xac\\x1c\\x5c\\x9c\\x7f\\xf8\\x08\\x59\\x85\\x9c\\x9a\\x59\\x20\\xea\\x5c\\x65\\xc8\\x06\\x33\\xf6\\x5e\\x49\\xd4\\x96\\x5b\\x77\\xba\\x40\\x02\\xc7\\xd8\\xa8\\x65\\x1c\\x1e\\x5f\\xd6\\xf0\\x1d\\xc9\\x2a\\xa3\\xe1\\x22\\x38\\x87\\x95\\x07\\x2c\\xe7\\xa7\\xe5\\xd9\\x95\\xa7\\x18\\x4c\\x07\\x8d\\x18\\x40\\x1b\\x07\\x9d\\x45\\xe6\\x50\\x16\\x0e\\xaa\\x46\\xc0\\x17\\x89\\xad\\x03\\xa5\\xd9\\x45\\xd3\\xd6\\x4a\\x68\\x89\\xd0\\x2b\\x57\\x8d\\x7d\\x66\\x96\\xd1\\xc5\\xd3\\xcc\\x61\\x72\\x27\\x18\\x2e\\xb8\\xa0\\xe5\\xe8\\xf0\\x16\\x08\\xc2\\xcd\\xa2\\xfd\\xaf\\x72\\xae\\xbd\\x0c\\xc3\\xbe\\xef\\x03\\x31\\x0a\\x0e\\x0c\\x95\\x61\\x3d\\x41\\x6d\\x78\\x1f\\xdf\\x6e\\x93\\x74\\xfb\\x3f\\x8b\\x9e\\x8b\\x1e\\x74\\x8d\\xd6\\x02\\xe1\\xaf\\x4e\\xd1\\x34\\x6b\\xd1\\xb2\\x28\\x29\\x72\\x96\\x5a\\x8b\\x1e\\x0c\\x81\\x28\\x09\\xf9\\xcd\\x19\\x2f\\xba\\x27\\xe5\\x94\\x2e\\xd7\\xbc\\x8b\\x83\\xeb\\x05\\xa1\\xa7\\x29\\x94\\x75\\xa4\\xf2\\xce\\xbd\\x9b\\xd9\\x51\\x22\\x3b\\x7f\\x0b\\xe0\\xa9\\x09\\x0d\\xcb\\x28\\x85\\x38\\x5d\\xc2\\x4d\\x94\\xc6\\xe9\\xda\\x93\\x3c\\xc6\\xd9\\x97\\xdd\\x43\\x06\\x8f\\xd1\\x7e\\x1f\\x25\\x59\\xbc\\x4d\\x61\\xb7\\x87\\xdb\\x5d\\xc2\\x5b\\x8c\\x77\\x09\\x47\\x9f\\x21\\x4a\\x9e\\xe0\\x6b\\x9c\\x6c\\xd6\\x80\\x3c\\x31\\xee\\x83\\x2f\\x2d\\x79\\x07\\x86\\x3c\\x85\\xf2\\x03\\xc5\\x22\\x80\\x14\\xf1\\x9d\\x84\\x83\\x99\\x24\\xd9\\x16\\xa5\\x3a\\x28\\xc9\\xd6\\x74\\xd9\\x89\\x12\\xa1\\x34\\xcf\\x48\\x9a\\x1d\\xf9\\xfa\\x16\\xa9\\x51\\xd6\\x2f\\xd6\\xb2\\xc6\\x02\\x6a\\xd5\\x28\\x27\\xdc\\x18\\xff\\xe5\\xeb\\x4f\\x97\\xe8\\x81\\x95\\xef\\xd3\\x71\\xbf\\x9e\\xc6\\x77\\xd3\\xa2\\x41\\xeb\\x97\\x25\\x8d\\x9e\\xac\\xbf\\x39\\xb0\\xf9\\xde\\x2e\\xe1\\x86\\x44\\x03\\x77\\xd4\\x69\\x54\\x04\\xab\\x9c\\xa3\\xa0\\x9c\\xa2\\xeb\\xb2\\x11\\xaa\\x0e\\xf8\\x46\\xce\\xb8\\xe2\\xe4\\xc4\\xaf\\x37\\xd2\\x05\\x61\\x0f\\x37\\x46\\x3f\\x23\\x93\\x22\\xac\\x58\\xe4\\x90\\xb3\\xba\\x7f\\xa1\\xbf\\x09\\xe7\\x20\\x23\\x21\\x07\\x58\\x35\\xfc\\xff\\xfa\\xf5\\xab\\xa9\\x45\\x6e\\x8f\\xd8\\xc5\\xe2\\x59\\x10\\x54\\x28\\xd8\\xdd\\x06\\xad\\x24\\xd5\\x7a\\xbf\\xf0\\x09\\x4e\\xb3\\xd7\\x9b\\xf5\\x1b\\x44\\xab\\x4a\\x3d\\x9d\\x81\\x28\\x8a\\xd1\\xf7\\x54\\xe5\\x33\\x3e\\x72\\xa6\\x3d\\x1e\\x27\\x73\\xe7\\xca\\x83\\x7f\\x4c\\x04\\xc1\\xe9\\xd5\\xe2\\x77\\x00\\x00\\x00\\xff\\xff\\x05\\xd5\\x4c\\x27\\xd4\\x03\\x00\\x00\")\n\nfunc uiTsHeaderTsBytes() ([]byte, error) {\n return bindataRead(\n _uiTsHeaderTs,\n \"ui/ts/header.ts\",\n )\n}\n\nfunc uiTsHeaderTs() (*asset, error) {\n bytes, err := uiTsHeaderTsBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/ts/header.ts\", size: 980, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiTsModelsNode_statusTs = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\xdc\\x19\\xe9\\x6e\\xdb\\x36\\xf8\\x7f\\x9e\\x82\\x10\\x60\\x40\\xca\\x12\\x39\\xd9\\x80\\x01\\x53\\x8e\\xad\\x6b\\xd2\\x0b\\x39\\xba\\xb8\\x2b\\x3a\\x18\\x46\\xc0\\x58\\x74\\xcc\\x4d\\xa2\\x34\\x92\\x72\\xeb\\xa5\\x7e\\xf7\\x7d\\xa4\\x28\\x4b\\x96\\x68\\xc9\\x0a\\x36\\x60\\x18\\x7f\\xd4\\x0a\\xf9\\xdd\\x37\\xd9\\xe1\\x10\\x89\\x24\\xe3\\x53\\x12\\xa0\\x38\\x09\\x49\\x24\\x86\\x0c\\x7e\\xee\\x85\\xc4\\x32\\x13\\xbe\\x14\\x7b\\x43\\x80\\x38\\xe5\\x64\\x46\\x38\\x61\\x53\\x82\\x52\\x2c\\xe7\\x67\\x8e\\xef\\x0f\\xe5\\x32\\xa5\\xec\\x51\\x0c\\x63\\x2a\\xe7\\x9c\\x46\\xbf\\xaf\\xbf\\xfc\\x10\\xd0\\x1c\\x34\\x3c\\xb7\\xa3\\x2a\\xca\\xa2\\x84\\x40\\x2f\\x32\\x39\\x4f\\x78\\x80\\x7e\\xe6\\x38\\x46\\xaf\\x79\\xc6\\x08\\xe5\\xc8\\x7d\\x80\\xbf\\xfc\\xc7\\xfc\\xaf\\x9f\\x1e\\x63\\x0c\\x64\\xa7\\x49\\xec\\xed\\xed\\x81\\x90\\x59\\x44\\xd0\\xb5\\x96\\x15\\x3d\\xed\\x21\\x58\\xe4\\x4b\\x9a\\x70\\x89\\xcc\\xd1\\x0d\\x1c\\x8d\\xb4\\xf8\\xe6\\x58\\x2d\\x1a\\x6b\\x90\\x94\\x27\\x31\\x15\\x04\\x9d\\xa1\\xfb\\x42\\xda\\xeb\\xfc\\xf7\\x7d\\x7e\\x72\\xb2\\xb7\\x46\\x31\\x54\\x29\\x93\\x84\\xcf\\x30\\xc8\\xff\\x22\\x0c\\x39\\x11\\x55\\xaa\\x6a\\x31\\x22\\x3f\\x27\\xfc\\x8f\\x00\\x09\\xc9\\xc1\\x20\\x27\\x1b\\x87\\x38\\x47\\x69\\x1e\\xae\\x5a\\xf8\\x28\\x05\\x2e\\x88\\x98\\x72\\x9a\\x4a\\x9a\\xb0\\x3a\\x3f\\xe5\\x1e\\x1a\\x06\\x88\\x65\\xf1\\x03\\xe1\\x5b\\xf8\\x19\\x59\\x6b\\xa7\\x52\\x72\\x38\\xc3\\x6c\\xb9\\xbb\\x20\\x0d\\x4b\\xaa\\x15\\x82\\x74\\x41\\x5d\\xce\\x4d\\x5e\\x42\\x26\\x5c\\xc9\\x29\\x0a\\x41\\xc7\\x93\\x4d\\x00\\x8e\\xd9\\x23\\xb9\\x9f\\x26\\x19\\x93\\x76\\x5d\\x20\\x50\\xb8\\x24\\xe1\\x3d\\xde\\x72\\x9e\\xa5\\x21\\x6e\\x3b\\xd7\\x81\\x16\\x98\\x48\\xf1\\x47\\x3a\\xec\\xae\\x3f\\xbe\\x7c\\xa9\\xbf\\x36\\x41\\x23\\x82\\x43\\xc2\\xef\\x3b\\x45\\xe2\\x24\\x8d\\xe8\\x54\\x73\\xed\\x84\\xc5\\x0b\\x08\\x5a\\xfc\\x10\\x91\\x76\\xd0\\xdd\\xec\\x7f\\x47\\x44\\x9a\\x30\\x41\\x46\\x44\\xd6\\x5d\\x11\\x54\\xc0\\xc6\\x93\\x9e\\x74\\xaf\\xa8\\x90\\xd7\\x38\\xad\\xd1\\x1c\\xab\\x18\\x7b\\xbb\\x0e\\xb1\\xc9\\x33\\x59\\x54\\x62\\x63\\x57\\x1e\\x15\\x94\\x9e\\x9a\\xf4\\xd3\\xa2\\x85\\xf8\\x34\\xc2\\x90\\xe3\\x0a\\xb4\\x1e\\xf5\\x29\\xa7\\x0b\\xf0\\xbd\\x0e\\x2c\\x3a\\x45\\xf7\\x10\\x7e\\xf8\\x8a\\x42\\x1d\\x81\\x72\\x72\\x7c\\xa4\\xd6\\x49\\x27\\xfc\\x7b\\x55\\xd2\\xc2\\x11\\xfd\\x4b\\xd5\\xa0\\x1f\\xb6\\xe3\\x68\\xe0\\xc0\\x56\\xa5\\x52\\xc2\\xe5\\xf2\\xb4\\xe1\\xc2\\x73\\xa0\\x17\\xfb\\x50\\xdf\\x52\\xd7\\x76\\xf8\\xb4\\xf2\\x2a\\xa5\\x4d\\x73\\xca\\x1e\\x20\\x96\\x4d\\x2a\\xb7\\xf2\\xd9\\xf4\\x63\\x9d\\x51\\xfd\\x54\\x73\\xb2\\x30\\xca\\x3b\\x0a\\x11\\x3b\\x29\\xb5\\x55\\xa1\\x2d\\xca\\xfc\\x92\\x11\\xbe\\x74\\x3d\\x2b\\x6d\\x55\\xd6\\x4f\\xad\\xa9\\x74\\x5e\\x73\\xb0\\x5a\\x0b\\xcc\\x51\\xc6\\x23\\x60\\xee\\x0c\\x4d\\x17\\xd4\\x1d\\x51\\x0c\\x9d\\x93\\x06\\x30\\x27\\x32\\xe3\\x0c\\xc4\\xe4\\xe4\\xcf\\x8c\\x08\\xe9\\x3e\\x29\\xdc\\x40\\xfd\\x73\\x80\\x62\\x02\\x8d\\x0d\\xc2\\xcf\\x79\\x7d\\xf9\\xc1\\x39\\x80\\xf0\\x92\\x1c\\x4f\\x55\\x05\\x48\\xd8\\x3b\\x91\\xb0\\x4b\\xce\\x13\\x2e\\xd0\\xca\\x6b\\x50\\x55\\xcb\\x97\\x73\\xc2\\x5c\\x17\\x6a\\x78\\x16\\xa9\\x2a\\x66\\x95\\xdf\\x43\\x67\\x36\\x15\\x4a\\xe9\\x34\\x32\\xf4\\xe3\\x59\\xc2\\x2f\\xf1\\x74\\xee\\xba\\xb9\\x42\\x1d\\x78\\x85\\x19\\xf2\\xfc\\x01\\x4b\\x98\\x61\\x40\\x85\\x8a\\x6f\\xda\\x4f\\xd3\\x16\\xd5\\x45\\x67\\xc8\\x95\\x73\\x2a\\x7c\\x1d\\xc6\\xae\\x67\\x52\\x71\\x82\\xce\\xce\\x20\\x1b\\xa3\\xc8\\xeb\\xe0\\xae\\x96\\x1d\\x1f\\xd5\\xdb\\x48\\x7d\\xad\\x3a\\xd5\\x12\\xeb\\xcc\\x00\\x72\\x36\\x2e\\xdd\\xba\\xb9\\x25\\x0d\\x3f\\x22\\xec\\x51\\xce\\x95\\x66\\x47\\x1e\\xfa\\xfa\\xb5\\x53\\xaf\\x0a\\xee\\xb8\\x49\\xe6\\x10\\x1d\\x4f\\xfc\\xb2\\xb3\\xa1\\xd3\\xc2\\xf8\\xe5\\x9e\\xf7\\x5c\\xeb\\xf9\\x69\\x26\\xe6\\x45\\x08\\xb4\\x2b\\xb9\\x26\\x51\\x64\\xed\\x86\\x0f\\xf2\\xcd\\xe7\\xfa\\xa1\\x5e\\x1f\\x9a\\x62\\xa7\\xaa\\x48\\xde\\x46\\xe1\\x25\\x83\\xa9\\x49\\xf1\\xee\\x42\\xc8\\x8d\\x53\\xa9\\x44\\xad\\x38\\x26\\x6b\\x4d\\x7a\\xd8\\xe1\\xea\\x42\\xae\\xf6\\xec\\x65\\xda\\xc6\\x39\\x40\\x8b\\x84\\x86\\x16\\x27\\x69\\x61\\x55\\x16\\xed\\x58\\x39\\xd5\\x2a\\x13\\xd1\\x3e\\x61\\xaa\\x05\\xe9\\x8d\\x5c\\x93\\xad\\x94\\x6d\\xf8\\x7e\\x5b\\xac\\x94\\xa2\\x54\\x1d\\x6b\\x8b\\x9a\\xb1\\x35\\x94\\xaa\\xe1\\xaa\\xc8\\x34\\x85\\x5a\\xed\\x64\\xbf\\x86\\xab\\xb7\\x1a\\xef\\x5f\\x32\\x44\\x59\\x11\\x7a\\x55\\x03\\x55\\x05\\x4c\\x66\\x1a\\x53\\x9c\\xe7\\x33\\x83\\x5f\\x8e\\x05\\x6d\\x79\\xba\\x66\\x69\\x88\\x88\\x29\\xf4\\x48\\x52\\x23\\x79\\x58\\x25\\x59\\x4e\\x0e\\x07\\x75\\xa8\\x63\\x7b\\x0f\\x69\\xa6\\x60\\xab\\x4f\\xe0\\x2e\\xf6\\xe1\\xf6\\xe2\\xd6\\x55\\x17\\x31\\x4f\\xcd\\xcd\\x0b\\x82\\x64\\x82\\x32\\x49\\x23\\x2a\\x97\\xf9\\x5c\\xe4\\xdb\\xbd\\x68\\x66\\x5d\\x0d\\xe8\\x6e\\x3a\\xc9\\x2b\\x3e\\x5a\\x5c\\x5a\\x58\\xbe\\x59\\x6c\\x9a\\xc6\\x57\\x86\\x57\\x87\\x7e\\x73\\x66\\x37\\x35\\xd8\\x6e\\x74\\x93\\xf4\\x0e\\x0c\\x6a\\x03\\x4b\\x27\\x6f\\xda\\xca\\x20\\xe4\\xcc\\xac\\xc3\\x3c\\x1a\\xa2\\x6d\\x92\\xec\\xab\\x81\\xd0\\xf3\\x65\\x32\\xd2\\xba\\xbb\\x1e\\xfa\\x06\\x39\\x75\\xbe\\xff\\x9c\\xfd\\xcb\\x7b\\xc9\\xff\\xd2\\xfa\\xf6\\x6b\\xd7\\x7f\\xc6\\xfc\\x95\\xf9\\x9e\\x48\\x1a\\x93\\x57\\x09\\x8f\\xe1\\x93\\x83\\x61\\xc3\\xef\\x7c\\xb5\\xa3\\x06\\x30\\xd8\\x72\\x9d\\xc1\\x6f\\x87\\x83\\xf8\\x70\\x10\\xa2\\xc1\\x9b\\x60\\x70\\x1d\\x0c\\x46\\x8e\\xd7\\x4a\\x32\\xc7\\xbb\\x80\\x2d\\x97\\x61\\x96\\xac\\x2f\\xd3\\x5d\\x7e\\x2d\\x44\\x01\\x11\\x18\\xf9\\x8c\\x4a\\x02\\x60\\xb4\\x63\\xff\\x88\\x7c\\x6f\\xe9\\x34\\xc6\\xe4\\x65\\xc9\\xd9\\x50\\xc6\\x2d\\x36\\x3a\\x1a\\x63\\x3e\\xec\\x5f\\x10\\x09\\x09\\x23\\x9a\\xd1\\x58\\x9f\\xcf\\x3f\\x52\\x2e\\x33\\x1c\\x5d\\x46\\x24\\x26\\xac\\x7e\\xb7\\x2d\\xb4\\x79\\x6e\\x94\\x76\\x8d\\x9b\\xc5\\xf8\\xee\\x3a\\x21\\x5d\\xc0\\x88\\xee\\xdc\\x24\\xca\\x72\\x18\\xdc\\x40\\x84\\x12\\x67\\x49\\xa4\\xef\\x34\\x8b\\x6b\\x4d\\x67\\x1b\\xa9\\xb1\\x95\\x21\\x1c\\x4b\\x55\\x45\\xb6\\x02\\x14\\x40\\x5c\\x41\\xa8\\x8f\\x50\\x89\\x35\\x52\\x6f\\x29\\x02\\xb9\\x0e\\x84\\xb1\\x0e\\xf9\\xf5\\xe3\\x4a\\xd1\\x03\\x20\\xbc\\xbd\\xc0\\xf1\\x0e\\x5a\\x47\\xb2\\x82\\xde\\xb8\\x46\\x23\\xc6\\xa9\\x3b\\xcb\\xd8\\x54\\x0d\\x22\\xae\\xde\\x7e\\x1b\\xee\\x32\\x63\\xee\\xa6\\xb3\\x45\\x0a\\x3c\\x9e\\x73\\x32\\x3b\\x1b\\x6a\\x5e\\x70\\xb1\\x02\\xf1\\x0d\\x5b\\xa5\\xc8\\x04\\x48\\x3d\\xa1\\x69\\xc2\\x66\\xf4\\x31\\x50\\x77\\xab\\x24\\x83\\x8c\\x58\\x1d\\x14\\x30\\x1d\\x5a\\x16\\xcb\\x01\\x4a\\x1d\\x53\\xee\\xca\\x9b\\xd8\\x3b\\xa7\\x5a\\x93\\x16\\x3e\\x4d\\x17\\xdd\\x98\\x57\\x40\\xf0\\xc1\\xda\\xce\\xda\\xcc\\xfa\\xd2\\x64\\x9e\\xe5\\x7c\\xf3\\x56\\xe8\\xf5\\xa3\\x6d\\xde\\xf2\\x3a\\x68\\x9b\\xdf\\x9e\\xb4\\x47\\xf9\\x23\\x1b\\xc2\\x72\\x83\\xbc\\x29\\x02\\xd5\\xf2\\x93\\xc7\\x4c\\xf1\\x24\\xe7\\xf5\\xe4\\xf3\\x6b\\x7e\\x7d\\xd9\\x91\\x4f\\xf5\\xb2\\xd3\\x8f\\xcf\\x9d\\xea\\x02\\x16\\x53\\x55\\xba\\x43\\x4f\\x8a\\x57\\xba\\xbd\\xa0\\x6d\\x84\\x9b\\xdd\\xa7\\xaf\\x77\\x8b\\xd1\\x62\\x2b\\x0b\\xeb\\xf0\\xf1\\x4c\\x2e\\xba\\x99\\x6d\\xb0\\xc8\\x67\\x5e\\xcb\\x04\\xd7\\xdb\\xc5\\x0c\\x0c\\x71\\x78\\xb7\\xee\\xd5\\x3d\\x4c\\x06\\x33\\x6c\\x4b\\xa3\\xef\\x29\\xc7\\x2b\\xa8\\xf8\\x4b\\x54\\xca\\x61\\xd1\\xb6\\x31\\x2f\\x79\\xdb\\x2a\\x81\\x65\\xbb\\x5e\\x55\\x56\\xb6\\xc7\\xc4\\xe1\\xfe\\x7e\\x09\\xb4\\x5f\\x7b\\xf3\\x21\\x4c\\x64\\xaa\\xa0\\xcb\\x39\\xdc\\xf0\\x89\\xda\\x43\\x31\\xa4\\x2e\\x06\\x6b\\x99\\xa2\\x0a\\xd6\\x9b\\xf1\\x24\\x06\\x08\\x98\\x05\\x08\\x5f\\x10\\x5e\\xa5\\x86\\xb9\\xfa\\xcf\\x14\\x2e\\x88\\x0e\\x1b\\x2c\\xd0\\xbb\\xd1\\xed\\x8d\\xe9\\xb1\\xd5\\x19\\x65\\x7f\\xb8\\xfe\\x2e\\xea\\xfb\\xa6\\x24\\xee\\x97\\x39\\x0f\\xd0\\xa7\\xeb\\xab\\x37\\x52\\xa6\\x77\\xf9\\x1b\\xd6\\x01\\x4a\\x52\\x69\\x79\\xa5\\xfb\\xf4\\xe6\\xee\\x36\\xbf\\xe1\\x6e\\x1b\\x3e\\x4c\\x3f\\x00\\x9a\\xa6\\x4b\\xc3\\x9d\\xe8\\xdb\\xa3\\x23\\xf4\\xa3\\x96\\xcf\\xcf\\x71\\xe8\\x6c\\xa9\\xb8\\x82\\xab\\xf3\\x67\\xac\\x0f\\xe4\\x0b\\x5c\\x94\\x02\\x54\\xdf\\xab\\xbe\\x90\\xe7\\xff\\xae\\xf6\\xfe\\x0e\\x00\\x00\\xff\\xff\\x68\\xfa\\x72\\xbe\\xac\\x1a\\x00\\x00\")\n\nfunc uiTsModelsNode_statusTsBytes() ([]byte, error) {\n return bindataRead(\n _uiTsModelsNode_statusTs,\n \"ui/ts/models/node_status.ts\",\n )\n}\n\nfunc uiTsModelsNode_statusTs() (*asset, error) {\n bytes, err := uiTsModelsNode_statusTsBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/ts/models/node_status.ts\", size: 6828, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiTsModelsStatsTs = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\x84\\x92\\x3f\\x4f\\xc3\\x30\\x10\\xc5\\x77\\x7f\\x8a\\x53\\x27\\xe8\\x10\\xef\\xe5\\x8f\\x80\\x0e\\x4c\\x9d\\x90\\x58\\xab\\xab\\x73\\x4d\\x42\\xfd\\x27\\x3a\\x9f\\x2b\\x22\\xd4\\xef\\x8e\\xd3\\x06\\x04\\xa8\\x35\\x37\\x58\\x3e\\xfd\\xde\\xf3\\xbb\\x93\\xac\\x35\\xc4\\x90\\xd8\\xd0\\x02\\x5c\\xa8\\xc9\\x46\\x1d\\x05\\x25\\x56\\x12\\x95\\xce\\xec\\x96\\x69\\x4b\\x4c\\xde\\x10\\xf4\\x28\\xed\\xdd\\xac\\xaa\\xb4\\x0c\\x7d\\xe7\\x9b\\xa8\\x5d\\x27\\x2d\\x77\\xf6\\xed\\xfb\\x56\\xd5\\xd9\\x36\\x03\\x7d\\x9f\\xad\\xf0\\x98\\xa4\\x0d\\xbc\\x80\\x27\\x46\\x07\\xcf\\x9c\\x3c\\x75\\x0c\\x57\\x9b\\xdc\\x55\\xcd\\xa9\\x7b\\x68\\x1c\\x66\\x93\\x09\\xee\\x5a\\x29\\x3d\\x9f\\x2b\\x98\\xc3\\xea\\x38\\x03\\x98\\xe0\\x05\\x3b\\x1f\\xa1\\x46\\xc1\\x69\\x30\\xe8\\x93\\xb5\\x54\\xc3\\x96\\x83\\xcb\\x02\\xb3\\xe3\\x80\\xa6\\xad\\xb2\\x4b\\xab\\xac\\x48\\x96\\xbe\\xdc\\x1f\\x0a\\x72\\xd1\\x7b\\x1f\\x58\\x60\\x42\\x2f\\xe3\\x56\\x13\\xf9\\x41\\x3b\\x2f\\xc4\\x5b\\xcc\\xeb\\xad\\x5e\\x97\\xcb\\xbf\\xa2\\xb1\\x6c\\xb7\\xa7\\xf5\\x66\\x10\\x8a\\x0b\\xf0\\xc9\\x6d\\x88\\x6f\\x7e\\xf1\\x1d\\x0d\\x25\\xbc\\x47\\x5b\\xc2\\x63\\xbe\\x97\\x92\\xe2\\x98\\x6f\\x42\\xf2\\x72\\x39\\xbf\\x80\\xc7\\xfc\\x02\\x9e\\xf2\\xff\\x57\\x60\\x43\\xe7\\x79\\x63\\x4e\\xd3\\x5f\\x56\\xc4\\x21\\x96\\x16\\x1c\\x71\\x21\\xdf\\x62\\x94\\x75\\xea\\xf3\\x47\\xa0\\xb5\\x47\\x1f\\xce\\xbc\\x72\\x50\\xa7\\xf3\\xa0\\x3e\\x03\\x00\\x00\\xff\\xff\\xf7\\xb6\\xa5\\x6d\\xce\\x02\\x00\\x00\")\n\nfunc uiTsModelsStatsTsBytes() ([]byte, error) {\n return bindataRead(\n _uiTsModelsStatsTs,\n \"ui/ts/models/stats.ts\",\n )\n}\n\nfunc uiTsModelsStatsTs() (*asset, error) {\n bytes, err := uiTsModelsStatsTsBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/ts/models/stats.ts\", size: 718, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiTsModelsStore_statusTs = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\xdc\\x19\\x69\\x6f\\xdb\\x36\\xfb\\xbb\\x7f\\x05\\x21\\xc0\\x80\\x94\\xd7\\x91\\x93\\xb7\\xc0\\x80\\x29\\xc7\\xd6\\x25\\x69\\xbb\\x22\\x47\\x17\\x77\\x45\\x07\\xc3\\x08\\x18\\x89\\xb6\\xb5\\xe9\\x1a\\x49\\xb9\\xf1\\x52\\xff\\xf7\\x3d\\x3c\\x64\\x5d\\x94\\x8f\\x6c\\x03\\x86\\x09\\x85\\xa5\\x92\\xcf\\x7d\\x93\\x19\\x0e\\x11\\x4b\\x73\\xea\\x13\\x0f\\xc5\\x69\\x40\\x22\\x36\\x64\\x3c\\xa5\\xe4\\x81\\x71\\xcc\\x73\\xe6\\x72\\xd6\\x1b\\x02\\xc8\\x29\\x25\\x53\\x42\\x49\\xe2\\x13\\x94\\x61\\x3e\\x3f\\xb3\\x5c\\x77\\xc8\\x97\\x59\\x98\\xcc\\xd8\\x30\\x0e\\xf9\\x9c\\x86\\xd1\\xaf\\xeb\\x2f\\x37\\x00\\x34\\x0b\\x0d\\xcf\\xb7\\xa2\\x06\\xaf\\xe0\\xdf\\x16\\xf0\\x04\\xa4\\x2a\\xa5\\xe9\\x86\\x13\\x20\\x15\\x08\\xf4\\x3a\\xe7\\xf3\\x94\\x7a\\xe8\\x07\\x8a\\x63\\xf4\\x96\\xe6\\x09\\x09\\x29\\xb2\\x1f\\xe1\\x7f\\xee\\x4c\\xfd\\xef\\xfb\\x59\\x8c\\x41\\x5a\\x3f\\x8d\\x9d\\x5e\\x0f\\x94\\xcf\\x23\\x82\\x6e\\xa4\\x0d\\xd0\\x73\\x0f\\xc1\\x43\\x9e\\xb2\\x94\\x72\\xa4\\xb7\\x46\\xc2\\x2e\\x23\\x29\\x88\\xde\\x17\\x4f\\x18\\x4b\\x98\\x8c\\xa6\\x71\\xc8\\x08\\x3a\\x43\\x0f\\x85\\x15\\x6e\\xd4\\xfb\\x83\\xda\\x39\\xe9\\xad\\x51\\x34\\xd9\\x30\\xe1\\x84\\x4e\\xb1\\xaf\\x29\\x5f\\x12\\xe6\\xd3\\x30\\xe3\\x61\\x9a\\x54\\xc8\\x8b\\x47\\x39\\x24\\x0c\\x3c\\x94\\xe4\\xf1\\x23\\xa1\\x27\\xb5\\x5d\\x61\\x1f\\x4f\\xcb\\xed\\xde\\xc2\\x4b\\x89\\x28\\x3f\\x2b\\x34\\xeb\\x48\\x98\\x73\\xca\\x3c\\x84\\x93\\x65\\xb9\\xbe\\xda\\x20\\xe1\\x05\\xce\\xb0\\x1f\\xf2\\x65\\x43\\xb2\\x62\\xd9\\x2c\\xd9\\xeb\\x05\\x98\\x17\\x3f\\x46\\xc4\\xbc\\x7d\\x8f\\x93\\x19\\xb9\\x48\\xf3\\x84\\xb7\\xf7\\x37\\xc9\\x62\\xf6\\x83\\x78\\x02\\x50\\xd7\\x6b\\x59\\xb3\\xce\\x95\\x0a\\xae\\x0f\\xbe\\x99\\xad\\xb2\\x36\\xa6\\x9c\\x04\\x0f\\xb8\\x63\\x3f\\xcf\\x02\\xbc\\x69\\x5f\\xc6\\xe1\\xda\\x21\\x23\\x19\\x95\\x37\\x9f\\x2e\\x2e\\xe4\\x57\\x1d\\x34\\x22\\x38\\x20\\xf4\\x61\\xab\\x48\\x94\\x64\\x51\\xe8\\x4b\\xae\\x5b\\x61\\x71\\x61\\xf4\\xcd\\xa0\\x3b\\x1a\\xf8\\x9e\\xb0\\x2c\\x4d\\x18\\x19\\x11\\xde\\xb4\\xb5\\x57\\x85\\x1b\\x4f\\xf6\\xa5\\x7c\\x1d\\x32\\x7e\\x83\\xb3\\x06\\xd5\\xb1\\x8c\\xf5\\x1f\\xd7\\xa1\\x3e\\x79\\x31\\x97\\x4a\\x00\\xec\\xce\\xa6\\x82\\xb4\\xaf\\x3e\\xfb\\xea\\xb2\\x81\\xbe\\x1f\\x61\\xc6\\x14\\x6c\\x33\\xc2\\x33\\x1a\\x2e\\x20\\x0e\\x64\\x90\\x85\\x3e\\x7a\\x80\\x50\\xc4\\xd7\\x21\\x54\\x1c\\x28\\x3c\\xc7\\x47\\xe2\\x39\\xd9\\x0a\\xff\\x41\\x54\\xbf\\x60\\x14\\xfe\\x21\\xaa\\xd5\\xb7\\xdd\\x38\\x12\\xd8\\x33\\xd5\\xb3\\x8c\\x50\\xbe\\x3c\\x6d\\x3b\\xf3\\x1c\\x08\\xc6\\x2e\\x94\\xc2\\xcc\\x36\\xee\\x3e\\xaf\\x9c\\x4a\\x19\\x94\\xbc\\xf2\\x47\\x88\\x6c\\x9d\\xb8\\x9b\\x39\\xd5\\x1d\\xda\\x62\\xd5\\xdc\\x96\\xbc\\x0c\\xac\\x54\\x27\\x21\\x6c\\x37\\xc5\\xba\\x95\\xea\\x50\\xe8\\xa7\\x9c\\xd0\\xa5\\xed\\x18\\xa9\\x8b\\x36\\x70\\x6a\\x4e\\xae\\xf3\\x86\\x9f\\xc5\\xb3\\xc0\\x14\\xe5\\x34\\x02\\xf6\\xd6\\x50\\x37\\x40\\xd5\\x9b\\xd9\\xd0\\x3a\\x69\\x41\\x53\\xc2\\x73\\x9a\\x80\\xa4\\x94\\xfc\\x9e\\x13\\xc6\\xed\\x67\\x81\\xec\\x89\\x9f\\x01\\x8a\\x09\\xf4\\x42\\x08\\x44\\xeb\\xed\\xd5\\x47\\x6b\\x00\\x71\\xc6\\x29\\xf6\\x45\\x55\\x48\\x93\\xf7\\x2c\\x4d\\xae\\x28\\x4d\\x29\\x43\\x2b\\xa7\\x45\\x55\\x3c\\x2e\\x9f\\x93\\xc4\\xb6\\x81\\x6f\\x1e\\x89\\xca\\x66\\xd6\\xc0\\x41\\x67\\x26\\x25\\x4a\\xf1\\x24\\x36\\xf4\\xfa\\x69\\x4a\\xaf\\xb0\\x3f\\xb7\\x6d\\xa5\\xd2\\x16\\xbc\\xc2\\x10\\x3a\\x97\\xc0\\x18\\x7a\\x14\\x10\\x21\\xe3\\x16\\x9d\\xb1\\x6d\\x8e\\xea\\x13\\x4e\\x91\\xcd\\xe7\\x21\\x73\\x65\\x44\\xdb\\x4e\\x91\\x98\\x13\\x74\\x76\\x06\\xb9\\x19\\x45\\xce\\x16\\x01\\xc4\\xd3\\x41\\x00\\x8d\\x27\\x9b\\x99\\xaf\\x76\\x50\\xad\\x48\\x12\\x20\\x67\\x64\\xb3\\x5d\\x3d\\xbb\\x24\\xe2\\x46\\x24\\x99\\xf1\\xb9\\xd0\\xed\\xc8\\x41\\x5f\\xbf\\x6e\\xd5\\xac\\x82\\x3b\\x6e\\x93\\x39\\x44\\xc7\\x13\\xb7\\xec\\x79\\xe8\\xb4\\x70\\x40\\xb9\\xe6\\xbc\\xd8\\x7e\\x6e\\x96\\xb3\\x79\\x11\\x08\\x9b\\xb5\\x5c\\xd3\\x28\\x12\\xb8\\xee\\x06\\xb5\\xfa\\x52\\x57\\x34\\x6b\\x45\\x5b\\xf0\\x4c\\x14\\xcd\\xbb\\x28\\xb8\\x4a\\x38\\x0d\\x05\\xf3\\x6d\\x08\\xca\\x3c\\x95\\xaa\\xb4\\x11\\x47\\x67\\xaf\\xce\\x12\\x33\\x5c\\x53\\xc8\\x55\\xcf\\x5c\\xb6\\x4d\\x9c\\x3d\\xb4\\x48\\xc3\\xc0\\xe0\\x26\\x29\\xac\\xc8\\xa5\\x5d\\xcb\\xa8\\x78\\x44\\xd4\\x8a\\xb1\\x53\\xf4\\x36\\x06\\xf6\\x48\\x66\\x6d\\x18\\x48\\x73\\x64\\x2b\\x20\\x68\\x98\\x35\\xf7\\x77\\x85\\x4b\\x29\\x8b\\x33\\x56\\x98\\x93\\x66\\x46\\xe8\\xe5\\xb1\\x69\\xb1\\x16\\xb1\\x82\\x4c\\x5b\\xa8\\xd5\\x4e\\x06\\x6c\\xf9\\xba\\xd3\\x7a\\xff\\x90\\x21\\xca\\xaa\\xd0\\xa1\\xbf\\x39\\x40\\x44\\x21\\xd0\\xc9\\xa9\\x4d\\x71\\xae\\xa7\\x08\\xb7\\x1c\\x14\\x36\\xe5\\xea\\x9a\\xa7\\xa6\\xc2\\x7c\\xe8\\x98\\xa4\\x41\\xf3\\xb0\\x46\\xb3\\x1c\\x26\\x06\\xa8\\x09\\x77\\x6c\\xee\\x27\\xed\\x34\\xdc\\xe8\\x16\\x38\\xca\\x7d\\xbc\\xbb\\xbc\\xb3\\xc5\\x39\\xce\\x11\\x73\\xf5\\x82\\x20\\x9e\\xa2\\x9c\\x87\\x91\\x38\\x90\\xc8\\x61\\xc9\\x35\\x3b\\x52\\xcf\\xc2\\x12\\xd0\\x2e\\xa6\\x31\\xe5\\x27\\x47\\xbf\\x3b\\x9c\\x2a\\x81\\x0b\\xe3\\x1b\\x2a\\x4e\\xdb\\x01\\xca\\xf8\\xb0\\xeb\\xb6\\xa7\\x7a\\x5d\\x8b\\xcd\\x86\\xd7\\xa9\\x6f\\xc1\\xf8\\xd6\\x37\\xf4\\xf5\\xb6\\xb5\\x34\\x82\\xe6\\x66\\x9c\\xf7\\xd1\\x10\\x75\\xca\\x72\\x20\\x06\\x45\\xc7\\xe5\\xe9\\x48\\x1a\\xc0\\x76\\xd0\\xff\\x90\\xd5\\xe4\\xfc\\xf7\\xf9\\xa0\\x3c\\xbb\\xac\\x3d\\x80\\x0a\\x17\\xa0\\xff\\x88\\x0f\\xcc\\xe7\\xb3\\x7f\\x8f\\x13\\x2a\\xd3\\x3f\\xe1\\x61\\x4c\\xde\\xa4\\x34\\x86\\x4f\\x0a\\xc6\\x0d\\x5e\\xb9\\x62\\x45\\x4c\\x65\\xb0\\x64\\x5b\\xfd\\x5f\\x0e\\xfb\\xf1\\x61\\x3f\\x40\\xfd\\x77\\x5e\\xff\\xc6\\xeb\\x8f\\x2c\\x67\\x23\\x49\\x85\\x77\\x09\\x4b\\x76\\x82\\x93\\x94\\x15\\x87\\x9d\\x6d\\xce\\x2d\\x44\\x01\\x11\\x12\\xf2\\x05\\x95\\x04\\xc0\\x6a\\xc7\\xee\\x11\\xf9\\xc6\\xd0\\x76\\xb4\\xd1\\x2b\\xe5\\xa7\\xa6\\x8d\\x5d\\x2c\\x6c\\xe9\\x93\\xea\\x1c\\x70\\x49\\x38\\x24\\x0e\\x6b\\x95\\x85\\xe6\\xdc\\xfe\\x29\\xa4\\x3c\\xc7\\xd1\\x55\\x44\\x62\\x92\\x34\\x0f\\xc1\\x85\\x36\\x7f\\x21\\x54\\xb7\\xcd\\xa0\\xc5\\x5c\\x6f\\x5b\\x41\\xb8\\x80\\xd9\\xdd\\xba\\x4d\\x85\\xf1\\x30\\x78\\x82\\x30\\x21\\xd1\\x92\\x70\\xd7\\x6a\\x57\\xda\\xce\\x98\\x2d\\x28\\x8d\\x8d\\xec\\x60\\x97\\x8b\\x6a\\x02\\x9c\\xcc\\x00\\x0a\\x84\\x8a\\x7d\\xf1\\x11\\x28\\x91\\x02\\x82\\xc0\\x86\\x96\\x33\\x40\\xc5\\x22\\xbc\\xf1\\x78\\x4e\\xc9\\xf4\\x6c\\x28\\x9a\\x16\\x9c\\x59\\x20\\xc4\\x55\\x3e\\xc8\\xd1\\x5d\\x2c\\xca\\x1f\\x18\\xdf\\x45\\xf0\\x4f\\x00\\xe7\\x19\\xf9\\x69\\x32\\x0d\\x67\\x9e\\x38\\xc6\\xa4\\x39\\x84\\xd9\\x6a\\xd0\\x85\\xe3\\x38\\x13\\x67\\xb0\\x9f\\x84\\xb7\\x84\\x7f\\x49\\xe9\\x6f\\x35\\x31\\x9b\\xd4\\x71\\x10\\x80\\x5d\\x99\\x9b\\x28\\xd8\\xfd\\x99\\xbc\\x56\\x04\\x76\\x62\\xa2\\xdf\\x7b\\x31\\x19\\xa9\\xeb\\x29\\x84\\x79\\x8d\\x45\\x91\\x14\\x95\\x7c\\x54\\x5c\\xcb\\xeb\\xac\\xfd\\x2c\\xf6\\xb3\\x1a\\xef\\x77\\xe6\\x53\\x3d\\x0e\\xec\\xc3\\x47\\xde\\x02\\x9a\\xcc\\x55\\x29\\x97\\x7b\\x11\\xbc\\x96\\xd5\\x16\\x75\\xd2\\x6d\\x57\\xe3\\xbd\\xc8\\xaf\\x2f\\x35\\xbb\\x39\\x18\\x5b\\xf2\\x8b\\x98\\xc8\\xca\\x5e\\xe3\\xa0\\xa6\\x41\\xd3\\x60\\xb3\\xa7\\x7b\\x13\\x30\\xc2\\xe1\\xfd\\xba\\x71\\xed\\x63\\x2f\\x18\\xed\\x36\\xf5\\xbd\\xbd\\xe4\\x78\\x03\\xa5\\x6f\\x89\\x4a\\x39\\x0c\\xca\\xb6\\x27\\x08\\xa1\\xaa\\x91\\x83\\x61\\x79\\xd2\\xea\\x06\\xe5\\xd7\\xfa\\x73\\x78\\x70\\x50\\x02\\x1d\\x34\\xae\\x45\\x48\\xc2\\x72\\x71\\x13\\xc7\\xe7\\x70\\xfc\\x25\\x62\\x0d\\xc5\\x90\\xb5\\x18\\xcc\\xa5\\x6b\\x2a\\x98\\x6f\\x4a\\xd3\\x18\\x20\\xa0\\x31\\x12\\xba\\x20\\xb4\\x4a\\x0d\\x53\\xf1\\x27\\x0a\\xca\\x88\\x8c\\x1a\\xcc\\xd0\\xfb\\xd1\\xdd\\xad\\xee\\x8e\\xd5\\x86\\x7d\\x30\\x5c\\x7f\\x4f\\xf3\\xc4\\x97\\x7f\\x08\\xa8\\x49\\x62\\x3f\\xcd\\xa9\\x87\\x3e\\xdf\\x5c\\xbf\\xe3\\x3c\\xbb\\x57\\xd7\\x3c\\x03\\x94\\x66\\xdc\\x70\\x99\\xf5\\xf9\\xdd\\xfd\\x9d\\x3a\\xfc\\x75\\x75\\x62\\xdd\\x0e\\x80\\xa6\\xee\\x58\\x70\\x5a\\xf8\\xff\\xd1\\x11\\xfa\\x4e\\xca\\xe7\\x2a\\x9c\\x70\\xba\\x14\\x5c\\xc1\\xd3\\xea\\xa2\\xe7\\x23\\x79\\x82\\x13\\x84\\x87\\x9a\\x6b\\xd5\\x8b\\x65\\xf5\\xbb\\xea\\xfd\\x19\\x00\\x00\\xff\\xff\\xdb\\xd1\\xe8\\xc5\\x5a\\x1a\\x00\\x00\")\n\nfunc uiTsModelsStore_statusTsBytes() ([]byte, error) {\n return bindataRead(\n _uiTsModelsStore_statusTs,\n \"ui/ts/models/store_status.ts\",\n )\n}\n\nfunc uiTsModelsStore_statusTs() (*asset, error) {\n bytes, err := uiTsModelsStore_statusTsBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/ts/models/store_status.ts\", size: 6746, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiTsModelsTimeseriesTs = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\xc4\\x59\\xdf\\x6f\\xdc\\xb8\\x11\\x7e\\xf7\\x5f\\xc1\\xf3\\x93\\x94\\xdb\\x68\\x93\\x7b\\xe8\\x83\\x1c\\xa7\\x0d\\xee\\x82\\x1e\\x0e\\x75\\x93\\x3a\\x46\\x7b\\x40\\x10\\x18\\x5c\\x89\\xbb\\xab\\x46\\xa2\\x14\\x92\\xb2\\xb3\\xbd\\xdb\\xff\\xbd\\xdf\\x90\\xd4\\x6f\\x69\\xb3\\x06\\x0e\\x38\\x01\\x71\\x64\\x89\\x1c\\xce\\x7c\\xf3\\xf1\\x9b\\xa1\\xbc\\x5e\\x33\\x5d\\xd6\\x2a\\x11\\x31\\x2b\\xca\\x54\\xe4\\x7a\\x6d\\xb2\\x42\\x68\\xa1\\x32\\xa1\\x23\\xa3\\x2f\\xd6\\x18\\xf0\\x4a\\x89\\xad\\x50\\x42\\x26\\x82\\x55\\xdc\\xec\\xaf\\x2f\\xa3\\x68\\x6d\\x0e\\x55\\x26\\x77\\x7a\\x5d\\x64\\x66\\xaf\\xb2\\xfc\\xbf\\xed\\x5d\\x94\\x62\\xda\\x25\\x5b\\xbf\\xc6\\x54\\xf6\\xa6\\x36\\xfb\\x52\\xc5\\xec\\x86\\x1b\\xc3\\xee\\x14\\x4f\\x0e\\x2c\\x28\\x70\\xff\\xb7\\xa4\\x4c\\x3e\\xab\\x92\\x27\\xfb\\x9c\\x6f\\x74\\x94\\x94\\x45\\x78\\x71\\xb1\\x7e\\xf6\\xec\\x82\\x3d\\x63\\x37\\xd6\\x0d\\x96\\x94\\xd2\\xf0\\x4c\\x6a\\x96\\x72\\xc3\\xbd\\x6f\\xac\\xaa\\xf3\\x5c\\xa4\\x6c\\xab\\xca\\x82\\xb5\\x26\\x22\\xcc\\x5a\\x5f\\x60\\x44\\x9d\\x8b\\x66\\xf6\\x6f\\x17\\x0c\\x97\\xf8\\x5a\\x95\\xca\\xb0\\xe6\\x95\\x30\\x2a\\x4b\\x9a\\x77\\x74\\x65\\x85\\x7d\\x5f\\xc1\\x5c\\xa6\\x05\\xbb\\x66\\xf7\\x4d\\x10\\x37\\xee\\xff\\xf7\\xee\\xcd\\xd5\\x45\\x3b\\x05\\x4e\\xb2\\xf6\\x17\\x78\\xfb\\xaf\\x5a\\xa8\\xc3\\x9b\\xdd\\x4e\\x89\\x1d\\x37\\xa5\\x62\\x99\\x66\\x5c\\x32\\x21\\xeb\\x42\\x28\\x6e\\xb2\\x52\\xb2\\x72\\xcb\\xcc\\x5e\\x30\\xfe\\xc0\\x33\\x04\\x0b\\x3f\\x78\\x3b\\xba\\x6f\\x68\\x5b\\xcb\\x84\\xc6\\x6b\\xb6\\x85\\x19\\x4a\\x02\\x73\\x59\\x60\\x5f\\x6a\\x97\\x0d\\x76\\xb7\\x87\\x75\\x29\\x44\\xaa\\x99\\x29\\xd9\\x46\\xb0\\xcf\\xa2\\x32\\x2c\\x93\\x4c\\x1f\\x64\\xc2\\x1e\\xe1\\x72\\xdf\\x20\\x2d\\x7a\\x07\\x33\\x1f\\xec\\xec\\xb1\\x9f\\x03\\x0f\\xa5\\x1d\\x8c\\xe5\\x1e\\x84\\x8a\\xfa\\x36\\x82\\x35\\xb0\\x31\\xe5\\x80\\x14\\xf6\\x49\\xd8\\x1b\\xb5\\x6e\\xef\\x3d\\xde\\x64\\x7b\\x02\\x4c\\x87\\x3a\\x5d\\x6f\\xfe\\xfd\\x77\\xc0\\xfd\\x72\\x35\\x7e\\x78\\x7f\\xfb\\xe6\\xee\\x2d\\xde\\xfc\\xd0\\xbd\\x39\\x0e\\xc0\\xef\\x7b\\xf7\\x13\\x98\\x51\\x95\\x99\\x34\\x16\\x75\\xa6\\x41\\x48\\xc0\\x9b\\x76\\x4f\\x25\\x9e\\x12\\x7a\\x07\\xa6\\x84\\xae\\x80\\xad\\x98\\x82\\xd8\\x37\\x38\\xc1\\x73\\x04\\x62\\xb7\\xa0\\x05\\x61\\x53\\x6f\\xb1\\x2f\\x18\\x90\\xd1\\x7c\\x27\\x3c\\x8c\\x7d\\x7b\\x1e\\xd1\\x13\\x30\\x46\\xa7\\x70\\xc4\\x42\\x42\\x6d\\x39\\xb6\\x5d\\xb7\\xf0\\x10\\x46\\x6b\\xcf\\xf0\\xa2\\xba\\x97\\x5c\\x96\\x3a\\x66\\x40\\x7e\\x23\\xd4\\xd5\\x60\\xd0\\x03\\xcf\\x6b\\x31\\x7d\\xb5\\x8c\\xab\\x4d\\xdd\\xad\\xd0\\x75\\x3e\\x44\\xb6\\x85\\x12\\x2f\\xbe\\xc1\\xc6\\xbe\\xb9\\x19\\x20\\x7b\\x2b\\x44\\xf6\\xfe\\x04\\xa0\\x4f\\xe3\\xe5\\x99\\x80\\xf6\\x43\\x1c\\x42\\x2a\\x79\\x21\\x62\\x0d\\xa5\\x90\\xbb\\x21\\x8c\\x2d\\xaf\\x00\\x73\\x9b\\x8f\\x8f\\x9f\\x9e\\x86\\xe7\\x07\\x01\\x39\\xe2\\x26\\xd9\\x63\\x5f\\xdb\\xd8\\xea\\x24\\x41\\xb4\\xdb\\x3a\\x67\\x65\\x6d\\xaa\\xda\\x34\\x72\\xb1\\x36\\x7a\\x6d\\xf1\\xee\\x1b\\x12\\x32\\xb5\\xab\\x9e\\x23\\x05\\x63\\x2e\\xce\\x82\\xff\\x27\\xc2\\x4e\\x48\\x0c\\x91\\x77\\xc4\\x02\\xba\\xbd\\x51\\x1f\\x3f\\x9d\\x4d\\x58\\x47\\x55\\x94\\x92\\x02\\x01\\x74\\x4b\\x42\\xe3\\x73\\x51\\x08\\xfc\\x9e\\xb2\\xcd\\xc1\\x46\\xe6\\x78\\x8c\\x0a\\x86\\x24\\x00\\x32\\x92\\x4a\\xcc\\x75\\x55\\xe2\\x29\\x81\\x8c\\xfc\\xb7\\x66\\xe3\\x20\\xbc\\x7e\\xed\\x0b\\xca\\xab\\x61\\xb8\\xaf\\xcf\\x0f\\x25\\xcd\\x74\\xe5\\x59\\xd2\\xee\\xbe\\x71\\x49\\x38\\x50\\xe6\\xe7\\x13\\xd5\\x39\\xde\\x54\\x15\\x37\\x23\\x80\\x56\\x28\\x13\\x83\\xbd\\x62\\x45\\x64\\xf2\\x77\\x28\\x48\\xf1\\x48\\xae\\x57\\x7e\\x25\\xbf\\x13\\x3e\\x7e\\x0a\\xe3\\x85\\xa0\\x46\\x20\\x3c\\x70\\xc5\\x6a\\x95\\x43\\xc2\\x2f\\x5b\\x0a\\x5f\\x8e\\xf5\\x48\\xb9\\xa2\\x7e\\x3d\\x9a\\x4b\\x97\\xf5\\xb0\\x51\\x33\\xfb\\x4b\\xb4\\x13\\x86\\xc8\\x1b\\x84\\x80\\xe7\\x65\\xf4\\x42\\xfc\\x65\\x35\\x99\\x85\\x58\\x9a\\x39\\xb8\\x3d\\x67\\x86\\x2f\\xaa\\xb1\\x8f\\x33\\x2a\\x78\\x15\\x04\\x2a\\x64\\xd7\\x08\\x48\\x09\\x53\\x2b\\x39\\xe3\\x1c\\x5d\\x56\\x1f\\x98\\x9a\\x5a\\xa4\\xab\\x2b\\xed\\x31\\xdd\\x4f\\x07\\x1d\\xaf\\x8e\\xe1\\xf0\\xe9\\xb1\\xfd\\x6d\\xb4\\x19\\xac\\x0f\\x45\\xa4\\x04\\x5c\\xd5\\x26\\xf8\\x0d\\xa8\\xc6\\xf8\\xb7\\xc2\\x3e\\x45\\x53\\x95\\xc6\\x97\\xef\\xdf\\x7d\\xb8\\xbb\\x44\\x1e\\xbf\\x1a\\x34\\x56\\x26\\x96\\xa5\\xfc\\x45\\x97\\xf2\\xad\\x52\\xa5\\xd2\\x2b\\x8b\\x70\\x4c\\x3f\\x8e\\xe1\\xc4\\x8b\\x08\\xb4\\x91\\x41\\x90\\xc6\\xc3\\x5c\\xba\\xe8\\x67\\x03\\x43\\x2f\\xf7\\xbe\\x44\\xf7\\x05\\xbe\\x30\\xb0\\x80\\x28\\x89\\xad\\x86\\x66\\xcc\\xb1\\x6b\\x9b\\x89\\x1c\\x52\\x64\\x75\\x47\\x14\\x95\\x39\\x30\\xae\\x14\\x3f\\xe8\\x68\\xd6\\x58\\xb6\\x65\\xc1\\x77\\x69\\xe4\\xf7\\x7b\\xb8\\xb0\\x24\\x5d\\xed\\x20\\x70\\xa5\\x2f\\x05\\xf3\\x00\\xce\\xce\\x8c\\xd0\\x4e\\xbd\\x45\\x97\\xd8\\x66\\x77\\x71\\x31\\xeb\\x96\\x8a\\x3a\\x9d\\x3f\\xe5\\x19\\x5d\\xfd\\xb1\\xd6\\xc1\\xc5\\xd1\\xf3\\x3e\\x1e\\xc3\\xf9\\x88\\x7c\\xee\\xd3\\xe9\\xdb\\xfe\\x8c\\xe3\\x72\\x53\\x7a\\x2b\\x12\\x08\\x5e\\x4f\\x15\\x9d\\x5e\\x3c\\xee\\xb3\\x64\\x0f\\x9d\\x93\\x19\\x08\\x4a\\x8f\\xd3\\xba\\xeb\\x51\\xd1\\x6f\\x63\\xbb\\xa1\\xc3\\xd0\\xd9\\xff\\x06\\x85\\x03\\xfc\\xc2\\x9e\\xa2\\x84\\x6f\\x78\\xf2\\xf9\\x91\\x2b\\x24\\xda\\x36\\xe0\\xa4\\x3d\\x49\\xad\\x70\\x30\\x30\\x56\\x9c\\x22\\xf6\\x1f\\xd0\\x0a\\xde\\x6f\\x01\\xfd\\x5e\\xa4\\xab\\x4e\\x6c\\x87\\xed\\x40\\x9e\\x53\\xc5\\x52\\xe2\\x39\\x88\\x54\\x43\\x96\\xa1\\x63\\x6e\\x91\\x46\\xd1\\x06\\x56\\x4f\\x09\\x72\\x92\\x73\\xad\\x07\\xe1\\x0e\\x33\\x56\\xa9\\xec\\x81\\x28\\x7b\\x3f\\x52\\xb3\\x21\\xb2\\x36\\x74\\x55\\x27\\x40\\x25\\xa8\\xea\\x4d\\x9e\\x51\\x05\\x95\\x69\\xf9\\xf8\\x93\\xc7\\x27\\x76\\xbd\\xd3\\xaa\\xb3\\x37\\x2b\\x99\\x51\\x14\\x8d\\x55\\x73\\x86\\x41\\x54\\x6c\\x22\\xef\\x10\\x58\\xe3\\x6e\\xae\\x46\\x9a\\x30\\x2d\\x2c\\xc1\\xb9\\x0a\\x4c\\x17\\x49\\x2c\\xf0\\x24\\x11\\xc4\\x12\\x52\\x3c\\x52\\xc7\\x02\\x3d\\x9c\\x32\\x8a\\x46\\x5a\\x99\\x1d\\x8f\\xf5\\xd3\\x7b\\x5a\\xfa\\xdc\\xb9\\x3e\\x84\\x66\\xc6\\xa4\\xa7\\x6f\\xaf\\xe2\\x90\\x81\\x55\\xe3\\xd0\\xca\\x23\\x40\\xfa\\x38\\x00\\x23\\x1c\\x83\\x30\\x03\\xc7\\x5c\\xb5\\xbc\\xe1\\x12\\x6d\\x0b\\xc2\\xa8\\x2b\\x22\\x85\\x6f\\xac\\xf6\\x9c\\x52\\x40\\xcc\\xee\\xb7\\xad\\xae\\xf0\\x6c\\x84\\x79\\x14\\x42\\xf6\\x2d\\x15\\x78\\x99\\xa1\\x53\\xa0\\x06\\x02\\x27\\x05\\xf0\\x49\\x9f\\xc1\\xbc\\xc1\\xfa\\x0b\\xd4\\x73\\x0b\\x8f\\xa4\\x96\\x90\\xc6\\x59\\xf6\\x6a\\x7e\\x8a\\x20\\x0d\\x8f\\xad\\x92\\x9f\\x1e\\xe8\\x6c\\xbf\\xad\\xca\\x64\\xef\\x39\\x8a\\xf1\\x2f\\xae\\x86\\xf4\\x81\\x76\\xdb\\x76\\xd1\\x71\\xbc\\x56\\xa2\\xdd\\x82\\x28\\x19\\xcf\\xc9\\x3a\\x94\\x41\\x74\\x67\\xa5\\x8c\\xba\\xa2\\xe7\\xdb\\x3c\\xdb\\xed\\xcd\\x8a\\xc1\\x85\\x3d\\xd7\\x63\\x83\\x84\\x52\\x2e\\x6c\\x4f\\x85\\x9e\\x55\\x96\\x06\\xe6\\x60\\x02\\x0c\\xa5\\x76\\x56\\xa4\\x5e\\x0b\\xb8\\xec\\x4c\\x8d\\x95\\x60\\x68\\x08\\x15\\xab\\x94\\xf9\\x01\\x3f\\x84\\x6f\\x81\\x71\\x20\\x6f\\xcb\\x0a\\x5c\\xf4\\xdf\\x03\\xe0\\xa5\\x3d\\xcf\\x44\\xf3\\x80\\xa0\\x89\\x26\\x15\\x23\\xb9\\x8a\\xa7\\xdb\\xc2\\xa7\\xe2\\x9b\\xed\\x59\\x9b\\x6b\\x9b\\x87\\x99\\x8f\\x02\\x95\\x50\\xe6\\xf0\\xca\\x26\\x68\\x34\\xed\\xe8\\x13\\x36\\x4a\\x41\\x9f\\xb6\\x74\\x3d\\x63\\x3f\\x36\\xa2\\x83\\x88\\x68\\xd3\\x0d\\xa8\\xe4\\x94\\xba\\xdc\\xb8\\x2f\\x20\\x4d\\x0d\\x6c\\x54\\x77\\x6c\\x8a\\x88\\x9f\\x67\\xc8\\x85\\x45\\x78\\x54\\x73\\x7b\\xd4\\xa5\\x6b\\xa0\\x75\\x0d\\x6a\\xae\\x73\\xb5\\x1e\\x40\\xb1\\x46\\xea\\xd3\\x8c\\xf2\\xb9\\x7d\\xd7\\x21\\x1c\\x84\\x53\\x88\\xa9\\x88\\xba\\x4d\\xdd\\x4b\\xc5\\x52\\x21\\x25\\xf1\\xe9\\x98\\x74\\xcd\\x16\\xeb\\xe7\\xd4\\x64\\x64\\x73\\x03\\x55\\xfa\\xce\\xe1\\xcd\\x7e\\xff\\x9d\\x4d\\x07\\x39\\xe4\\xba\\x51\\xe1\\x68\\x6b\\xf4\\xbd\\x6e\\x1d\\x39\\x55\\xf6\\xdd\\x12\\x5e\\x4b\\xae\\x4f\\xac\\x38\\x5f\\xd9\\x3b\\x13\\xc2\\x6f\\xee\\xc5\\xc0\\xbe\\x65\\xa0\\x37\\xa5\\xa1\\xdc\\x39\\x4e\\x5b\\xad\\xf8\\xfe\\xfb\\x73\\x5b\\xa9\\xe3\\xa9\\xba\\x34\\xc3\\x6a\\x2d\\x7c\\x1d\\x4e\\xf6\\x5c\\xee\\xfc\\x21\\xd7\\xc9\\x4a\\x2d\\x53\\xa1\\xf2\\x03\\xf9\\xeb\\xce\\x5b\\x8e\\xeb\\xa7\\xe9\\xda\\xd8\\x0b\\xbe\\x78\\x7a\\x2e\\xd5\\x53\\xb7\\xc6\\x35\\xfb\\x72\\xb2\\x92\\xce\\x78\\xec\\x73\\xe9\\x8a\\x96\\xf3\\xb7\\x28\\x35\\x3d\\xa0\\xa6\\xa2\\x79\\xed\\x4f\\xe5\\x76\\x95\\x15\\xd1\\x85\\x4b\\x12\\xca\\xb1\\xb1\\x0a\\xc3\\x31\\xeb\\x74\\x4c\\x0d\\x45\\xc6\\x25\\x61\\x21\\xb4\\xb9\\x7d\\xb7\\x58\\x74\\xfb\\xa9\\x7e\\x2a\\x12\\x82\\xa8\\x31\\x00\\xc2\\x3d\\xf1\\xb1\\x37\\x4d\\x59\\xbf\\x9c\\x5e\\xb9\\x54\\x52\\x8f\\x39\\xb6\\x86\\x36\\xb3\\x34\\x68\\x35\\x13\\x9e\\x43\\xd6\\x33\\x99\\x28\\xc1\\xfd\\xb1\\xa1\\xa6\\x63\\xb4\\xd7\\x38\\x5b\\x6c\\xf0\\xce\\x9f\\xd0\\xdd\\x09\\x02\\xed\\xfa\\xd8\\x9c\\x5b\\x35\\x40\\xa1\\x82\\x2f\\x6a\\xf0\\xdd\\x44\\x51\\xfd\\x09\\xe9\\x9b\\x08\\x55\\x0c\\xa5\\x87\\x2e\\x52\\xf5\\x42\\xb6\\xe6\\x83\\x45\\x68\\x2f\\x4f\\x27\\xcb\\x8e\\x43\\xae\\x7c\\x75\\xfd\\xa3\\x73\\x64\\xb7\\xe3\\x93\\x13\\x65\\xb5\\x63\\x90\\x28\\xff\\x84\\x4c\\x12\\xc6\\x6d\\x7f\\xde\\xa7\\x32\\x65\\x02\\x1d\\xf6\\x74\\x03\\xd8\\x7e\\x3d\\x08\\x5b\\x5e\\x97\\x09\\x72\\x8d\\x1a\\x7e\\x1a\\x18\\x27\\x53\\xbe\\x4b\\xf9\\xe3\\x70\\xb1\\x76\\x4f\\x22\\xd2\\x3a\\xfc\\x84\\x86\\x18\\x9d\\xc6\\x8f\\xb9\\x40\\xb9\\xe9\\xcb\\xa6\\x3f\\x5a\\x53\\xd8\\x99\\xe7\\x49\\x0e\\x96\\xa6\\x07\\xef\\xd1\\x04\\x82\\x26\\xac\\x65\\x91\\xb7\\x67\\xc8\\xb3\\xeb\\xdf\\x9c\\x92\\x2f\\xd7\\x1e\\xdf\\xbd\\xf4\\xf4\\x2e\\xf2\\x27\\x83\\xf9\\x8f\\x11\\x74\\xb9\\x0e\\xa6\\xa0\\x44\\x54\\x81\\x6f\\x58\\x5c\\x25\\x5c\\xcd\\x57\\xdb\\xf9\\x93\\xea\\x52\\x9d\\x73\\x1f\\x12\\xc8\\xde\\x6a\\xa9\\x92\\xcd\\x80\\x34\\x5d\\x63\\xc0\\x80\\xe9\\x32\\x4f\\x3f\\x18\\x0c\\x3e\\x86\\xe0\\xe4\\xa1\\x41\\x68\\xda\\x2a\\xdc\\xf8\\xbd\\xe2\\x3f\\x76\\xea\\x36\\xd5\\xdd\\x9e\\x71\\xdf\\xd3\\xfa\\xd6\\xb8\\xa2\\xbf\\x7c\\x29\\x2d\\xdc\\xdf\\x6f\\x34\\xfb\\xe5\\xc3\\xbb\\x7f\\x32\\x77\\xc8\\x5b\\x38\\x26\\xb4\\x1f\\xde\\x06\\x9e\\x04\\x5f\\xf7\\x2a\\x66\\xbf\\xde\\xfc\\xe3\\x67\\x63\\xaa\\x5b\\x47\\x3f\\x34\\xbe\\x15\\x7d\\xf5\\x1c\\xb7\\x99\\xbf\\xfe\\x7c\\xfb\\xae\\xb2\\x7f\\x11\\x0a\\xfd\\x79\\x72\\xf2\\xbd\\xd4\\x82\\x06\\x93\\x11\\xf0\\x32\\xb5\\x66\\xaf\\xd9\\x0f\\x2f\\x5e\\xb0\\xbf\\x5a\\xf7\\x22\\x37\\x27\\xdb\\x1e\\x68\\xd1\\xa8\\xf9\\x03\\xc8\\x1d\\x4e\\xda\\x21\\x8b\\xd9\\xf8\\x59\\xff\\xbb\\x82\\xfb\\x79\\xbc\\xf8\\x7f\\x00\\x00\\x00\\xff\\xff\\x24\\x88\\x6a\\xd1\\x1c\\x1c\\x00\\x00\")\n\nfunc uiTsModelsTimeseriesTsBytes() ([]byte, error) {\n return bindataRead(\n _uiTsModelsTimeseriesTs,\n \"ui/ts/models/timeseries.ts\",\n )\n}\n\nfunc uiTsModelsTimeseriesTs() (*asset, error) {\n bytes, err := uiTsModelsTimeseriesTsBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/ts/models/timeseries.ts\", size: 7196, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiTsPagesGraphTs = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\xb4\\x56\\x51\\x8f\\xe2\\x36\\x10\\x7e\\xe7\\x57\\x4c\\xf3\\x14\\x4e\\xc8\\x61\\x75\\x52\\x1f\\xb8\\x72\\x3a\\xba\\xad\\xb6\\x95\\x8a\\xd4\\x6e\\x57\\xf7\\x72\\x3a\\x9d\\x8c\\x19\\x12\\xf7\\x1c\\x9b\\xda\\x0e\\x1c\\xaa\\xf8\\xef\\x1d\\x3b\\x21\\x1b\\x42\\x58\\xaa\\x95\\x6a\\x21\\x48\\xf0\\xcc\\x37\\x9f\\xe7\\x1b\\x8f\\x9d\\x65\\xe0\\x4c\\x65\\x05\\xce\\x60\\xcb\\x73\\x74\\x59\\x6e\\xf9\\xb6\\x60\\xde\\x8d\\x32\\x9a\\xfa\\xc1\\xe2\\x06\\x2d\\x6a\\x81\\x34\\xeb\\x8b\\x79\\xc2\\x58\\xe6\\x0f\\x5b\\xa9\\x73\\x97\\x95\\xd2\\x17\\x56\\xaa\\xbf\\xda\\x27\\xb6\\x26\\xb7\\x04\\xb2\\xf7\\x37\\x5d\\xd7\\x6f\\xe9\\x73\\xdb\\xbc\\x34\\x6b\\x54\\x2e\\xf3\\xb2\\x44\\x87\\x56\\xa2\\xbb\\xe5\\x20\\x4c\\xb9\\x35\\x1a\\xb5\\x27\\x4e\\xe8\\xad\\x14\\xad\\x07\\xb9\\xc0\\xa2\\xf2\\x85\\xb1\\x33\\xf8\\xd1\\xf2\\x12\\x1e\\x6c\\xa5\\x51\\x5a\\x48\\x57\\xf4\\xc6\\xf2\\xfa\\xed\\x43\\x5e\\x72\\x5a\\x07\\xc1\\x8c\\xbb\\x0e\\x4b\\xee\\x3d\\x3c\\x59\\x2e\\x0e\\x90\\x96\\xf4\\xfc\\x41\\x18\\xf1\\xd5\\x1a\\x2e\\x0a\\xc5\\x57\\xae\\x36\\x1f\\x65\\x6f\\xde\\x8c\\xe0\\x0d\\x2c\\xd6\\xa5\\xd4\\x1f\\x25\\xee\\x1d\\x48\\x07\\xbe\\x20\\x76\\x56\\x96\\xdc\\x1e\\x80\\x56\\x53\\x29\\x84\\x8d\\xb1\\x70\\x7f\\xf2\\x47\\x07\\x3c\\x38\\x48\\xe7\\x2d\\xf7\\x72\\x87\\xb0\\xc7\\x55\\x80\\x91\\xda\\xa3\\xdd\\x70\\x81\\x8c\\xde\\xb2\\x51\\xe3\\xdb\\x01\\xff\\x67\\x04\\x10\\x43\\x02\\x59\\x3f\\x04\\xcd\\x42\\x3c\\x4e\\xd1\\x8c\\xd9\\x00\\x7d\\x84\\xa1\\xd4\\x6c\\x7d\\x8c\\x17\\x32\\x08\\x75\\x0a\\x21\\xea\\xeb\\x58\\x74\\xcc\\xe8\\x1b\\xbf\\x6d\\x8d\\xf5\\x27\\x76\\x35\\x52\\x00\\x0f\\xa3\\x09\\x00\\x31\\xc8\\x02\\x5c\\xc9\\x95\\x82\\x35\\x96\\x46\\xd7\\x7c\\x8d\\x0e\\x91\\x38\\x88\\x82\\x5b\\x3f\\x81\\x7d\\x21\\x45\\x01\\x6b\\xe9\\xb6\\x8a\\x1f\\x02\\x19\\xbf\\x37\\xf5\\x9c\\x7b\\x86\\x69\\xa6\\xa9\\x0e\\x62\\x76\\x1c\\x27\\x6a\\x6b\\xee\\x39\\xf1\\xf3\\xc0\\x1d\\xd8\\x20\\x1c\\xee\\x70\\x0d\\xab\\x03\\x41\\xfc\\x51\\xa1\\x3d\\x2c\\xb9\\xa6\\xda\\xb4\\xac\\x45\\xc9\\x9a\\xa7\\x73\\xf2\\xbf\\x93\\x51\\xcb\\x3d\\x0c\\xa1\\xb8\\x73\\x94\\x6d\\xed\\xad\\x51\\x0a\\x2d\\xc8\\x72\\xab\\xb0\\x0c\\x05\\x02\\x5f\\x4e\\x55\\xbb\\xac\\x7f\\x3b\\x56\\x5d\\x88\\x30\\xca\\x3a\\xfc\\x6c\\x19\\xeb\\x91\\x2d\\x9b\\xd2\\xea\\x52\\x7b\\xd7\\x73\\x71\\x85\\xd9\\x3f\\x72\\x8f\\x6e\\xb6\\x32\\x46\\x21\\xd7\\x7d\\x83\\x28\\xf0\\x8e\\xab\\x99\\xae\\xca\\x55\\xf0\\xef\\x03\\x54\\xe5\\xdf\\x01\\x1f\\xe6\\xa0\\x71\\x0f\\xbd\\xd0\\x8f\\x28\\x68\\x11\\x91\\x40\\x7a\\x37\\xa5\\xac\\x7e\\x1f\\xbe\\xee\\xa6\\xd3\\xe9\\x04\\x7a\\x40\\xf5\\x18\\xa2\\xbe\\xc8\\x73\\x8b\\x39\\xf7\\xc6\\xb2\\xc5\\xc7\\x87\\x09\\x24\\xc2\\x32\\x4d\\x76\\x4c\\x90\\xcc\\x8e\\xb9\\x4a\\x08\\x74\\x8e\\xdd\\x25\\xe3\\x3e\\x79\\xd2\\x1e\\x5f\\xc7\\x6e\\x80\\xdc\\x6d\\x6a\\x5f\\x1e\\x17\\x4f\\x3f\\xbf\\xcc\\xaf\\x87\\x2b\\x62\\x85\\x56\\x82\\x00\\xd2\\x71\\x5f\\xce\\x30\\x7c\\x21\\x1d\\x6b\\x74\\x1d\\x5e\\x44\\x57\\xdd\\x34\\x9a\\x9f\\x24\\xb9\\x48\\x47\\x1f\\x90\\x51\\x6b\\xb2\\xe8\\x8a\\xf4\\xba\\xe5\\x49\\x7e\\x8a\\x4d\\x75\\xff\\x6b\\xf3\\x96\\xa6\\x63\\x98\\xbf\\xbf\\x82\\x35\\x89\\x19\\x9c\\x5e\\x60\\x1e\\xfb\\x8b\\x37\\xba\\xd2\\xca\\xf0\\x35\\x81\\x0d\\x2d\\x5d\\x50\\x39\\xda\\x36\\xe2\\x19\\x9b\\xdb\\xd8\\xde\\xe4\\xb9\\xc2\\xba\\x4b\\xcc\\xa1\\xa6\\x7b\\x35\\xbf\\xed\\x26\\x20\\xd3\\xef\\xce\\xff\\x19\\x4a\\x8c\\xdc\\x40\\x7a\\x6e\\x35\\xbc\\x80\\x16\\xff\\x94\\x22\\xca\\x60\\x5d\\x6c\\xf1\\xdf\\xb6\\x38\\x07\\xb3\\x7f\\x04\\x12\\x19\\x5f\\x83\\xfb\\xa2\\xfc\\xc7\\x57\\x97\\x44\\xd7\\xf3\\x2c\\xdd\\x4d\\x6f\\xdb\\x54\\x5a\\xc4\\x4e\\x2b\\xda\\x06\\x95\\x8e\\x67\\x2f\\x74\\x2b\\x6a\\xa0\\x95\\xd5\\xb1\\xa4\\xef\\x3b\\x2e\\xef\\xfe\\x6b\\x9c\\x1d\\x9d\\x2f\\xa9\\xf0\\x56\\x75\\x82\\x5c\\x0a\\xb1\\xe3\\x16\\x56\\x95\\xf7\\x46\\x3f\\xe1\\x37\\x3f\\xa3\\xdd\\x46\\x1d\\xfd\\xa2\\xc9\\x91\\xa2\\x01\\xe9\\x96\\xa2\\xcf\\x40\\x54\\x29\\xc9\\x9f\\x64\\x0c\\x4f\\xc6\\x73\\xe5\\x92\\x8b\\x6c\\x5d\\x97\\x6f\\x00\\x24\\x86\\xbc\\xc4\\x18\\x4e\\x58\\x99\\x26\\x2c\\x1e\\x8e\\xe1\\x18\\x49\\x26\\xf0\\xe9\\x4a\\x89\\x90\\xdd\\x2f\\x6f\\x69\\x3e\\xa9\\x77\\xc1\\x4f\\x74\\x1c\\x26\\xe3\\xa1\\xc6\\x16\\xc6\\x7d\\x7b\\x23\\x69\\x1b\\xcb\\x6f\\x52\\xd7\\x1b\\x88\\x09\\x8b\\x44\\xb0\\xce\\x50\\x53\\x27\\xff\\x3f\\x10\\xd1\\x4f\\xae\\x1c\\x12\\xad\\x81\\xd4\\xdb\\xca\\x7f\\xa2\\xdb\\x1a\\xce\\xeb\\xac\\x7e\\x26\\x97\\x6b\\x5b\\xe6\\x34\\xa8\\x7f\\x54\\x74\\x8b\\x7c\\x96\\xe1\\x1a\\x83\\xd3\\xa0\\x0b\\x8a\\x92\\xe2\\xeb\\x0c\\x22\\xef\\x4e\\x67\\x79\\xc9\\xf1\\x38\\xbe\\x58\\xd9\\xe7\\x5e\\x6d\\x3f\\xff\\x1e\\x47\\xc7\\xd1\\xbf\\x01\\x00\\x00\\xff\\xff\\x47\\xd6\\x5d\\x9c\\xe1\\x0a\\x00\\x00\")\n\nfunc uiTsPagesGraphTsBytes() ([]byte, error) {\n return bindataRead(\n _uiTsPagesGraphTs,\n \"ui/ts/pages/graph.ts\",\n )\n}\n\nfunc uiTsPagesGraphTs() (*asset, error) {\n bytes, err := uiTsPagesGraphTsBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/ts/pages/graph.ts\", size: 2785, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiTsPagesMonitorTs = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\x7c\\x91\\xbb\\xce\\xdb\\x30\\x0c\\x85\\x77\\x3d\\x05\\xe1\\xc9\\x09\\x0a\\x6b\\xe8\\x96\\x5e\\x90\\xb4\\x43\\xa7\\x00\\x19\\x8a\\xee\\x8a\\x4c\\xdb\\x6a\\x75\\x09\\x28\\x2a\\x69\\x10\\xe4\\xdd\\x4b\\x25\\x75\\xe0\\x7f\\xf9\\x35\\xd8\\x22\\xce\\xf9\\x0e\\x09\\x4a\\x6b\\xc8\\xa9\\x90\\xc5\\x0d\\x9c\\xcc\\x88\\x59\\x87\\x14\\x1d\\x27\\xea\\x38\\x2b\\x2d\\xe2\\x67\\xc2\\x01\\x09\\xa3\\x45\\xd1\\x79\\xfa\\xd2\\x74\\x9d\\xe6\\xeb\\xc9\\xc5\\x51\\xac\\x8e\\x27\\x72\\xfe\\xf7\\xeb\\xd6\\xf5\\x82\\x35\\xa0\\xbf\\x2a\\x61\\x61\\x57\\x78\\x4a\\xb4\\x81\\x6f\\x64\\x02\\xfc\\xa0\\x12\\xd1\\x11\\xb4\\x47\\xa9\\xba\\xf1\\x59\\x6d\\xc7\\x60\\x84\\xb2\\x29\\xac\\x96\\xc0\\xde\\x30\\xc3\\x4f\\x32\\xf6\\x0a\\x6d\\x90\\xfb\\xd6\\x26\\xfb\\x87\\x92\\xb1\\x93\\x37\\xc7\\xfc\\xb4\\x2b\\xbd\\x5e\\x2b\\x58\\xc3\\xae\\x0f\\x2e\\xfe\\x72\\x78\\xc9\\xe0\\x32\\xf0\\x24\\x63\\x92\\x0b\\x86\\xae\\x10\\x52\\x5f\\x3c\\xc2\\x90\\x08\\xbe\\xcf\\x3c\\x66\\x30\\x15\\x70\\x99\\xc9\\xb0\\x3b\\x23\\x5c\\xf0\\x58\\x63\\x5c\\x64\\xa4\\xc1\\x58\\xec\\xa4\\xd2\\xea\\x3f\\xbb\\x08\\xbf\\x29\\x80\\x47\\x4b\\x10\\xf7\\xfe\\xb9\\xa3\\xb9\\xe3\\x59\\x1c\\x8f\\x3e\\xf8\\xf7\\xe4\\x13\\xc9\\x6e\\xc0\\xfa\\x92\\x25\\x11\\x32\\x1b\\x2e\\xb9\\x7b\\x60\\x5a\\xbe\\xe2\\x48\\xc4\\xf3\\x6c\\x73\\x4e\\x0d\\xaf\\xe7\\xad\\x7a\\x90\\xf7\\x78\\x49\\x0b\\x79\\x28\\xd1\\xb2\\x4b\\x11\\x6c\\x8a\\x4c\\xc9\\x7b\\xa4\\x76\\x05\\xb7\\xfb\\x3b\\xce\\x3a\\x61\\xf5\\x2c\\x2c\\xf5\\x10\\x72\\xa1\\x08\\xa1\\x6d\\xa6\\x8f\\xcd\\x07\\x68\\xe6\\x79\\x0e\\x5e\\x36\\x31\\x25\\xdf\\x23\\x35\\xab\\x4f\\x0b\\x68\\xee\\x51\\xff\\x77\\x75\\x57\\xff\\x02\\x00\\x00\\xff\\xff\\xd6\\xb1\\x96\\xcc\\x3e\\x02\\x00\\x00\")\n\nfunc uiTsPagesMonitorTsBytes() ([]byte, error) {\n return bindataRead(\n _uiTsPagesMonitorTs,\n \"ui/ts/pages/monitor.ts\",\n )\n}\n\nfunc uiTsPagesMonitorTs() (*asset, error) {\n bytes, err := uiTsPagesMonitorTsBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/ts/pages/monitor.ts\", size: 574, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiTsPagesNodesTs = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\xc4\\x55\\x5d\\x6f\\xa3\\x38\\x14\\x7d\\xcf\\xaf\\xb8\\xe2\\xa1\\x82\\x36\\x6b\\xf6\\xe3\\x8d\\x6c\\xaa\\xed\\x76\\x57\\xab\\x4a\\xdb\\xce\\x8c\\x2a\\xcd\\x4b\\x15\\x45\\x06\\x9c\\xe0\\xd6\\xd8\\x19\\xdb\\x90\\x89\\xaa\\xfc\\xf7\\xb9\\xc6\\x40\\x20\\x49\\x67\\xfa\\x36\\x48\\x0d\\xd8\\xd7\\xe7\\xdc\\xaf\\x73\\xdd\\x38\\x06\\xa3\\x2a\\x9d\\xb1\\x04\\x36\\x74\\xcd\\x4c\\x2c\\x55\\xce\\x0c\\xb1\\x66\\x12\\xa3\\xe9\\x4f\\xcd\\x56\\x4c\\x33\\x99\\x31\\xb4\\xda\\x62\\x1e\\x10\\x12\\xdb\\xdd\\x86\\xcb\\xb5\\x89\\x4b\\x6e\\x0b\\xcd\\xc5\\x73\\xff\\x45\\x72\\x84\\x05\\x10\\x5f\\xbf\\x09\\x2d\\x91\\x5b\\x78\\x17\\x4b\\x63\\xa9\\xad\\x4c\\x87\\x40\\x08\\xdc\\x54\\xb6\\x50\\x3a\\x81\\xbf\\x35\\x2d\\xe1\\x3f\\x5d\\x49\\xc6\\x35\\x84\\x29\\xae\\xc8\\xda\\xaf\\xfe\\x5a\\x97\\x14\\xfd\\x64\\xaa\\x8c\\x10\\x71\\x79\\x39\\x81\\x4b\\xb8\\xc9\\x4b\\x2e\\x3f\\x73\\xb6\\x35\\xc0\\x0d\\xd8\\x02\\xdd\\x69\\x5e\\x52\\xbd\\x03\\xf4\\x56\\x09\\x06\\x2b\\xa5\\xe1\\x56\\x65\\x2f\\x5a\\xd1\\xac\\x60\\x06\\xa8\\x03\\x70\\x63\\x35\\xb5\\xbc\\x66\\xb0\\x65\\xa9\\xa3\\xe1\\xd2\\x32\\xbd\\xa2\\x19\\x23\\xb8\\x8a\\x27\\x2d\\x76\\x40\\xfe\\x3a\\x01\\x68\\x5c\\x02\\x9e\\x7e\\x70\\x45\\xea\\xfc\\xd5\\x68\\x6f\\xbc\\xb0\\xaf\\x1b\\xa1\\x34\\x16\\xa7\\xd9\\xf6\\x09\\x82\\x5a\\x01\\x15\\x02\\x7c\\x59\\x1b\\x74\\x8c\\xbf\\x78\\x54\\x69\\xdb\\x85\\xe8\\xe9\\x9c\\x87\\xde\\x52\\x53\\xdd\\x60\\x1e\\x1b\\x16\\x66\\x12\\xb8\\x6f\\x8a\\x47\\x1e\\xfa\\x4d\\xe2\\x61\\x73\\x90\\xe8\\xff\\x0d\\x6b\\x18\\xcd\\x86\\xac\\x99\\xa0\\xc6\\x60\\x35\\xa4\\xd5\\x4a\\x08\\xa6\\x81\\x97\\x1b\\xc1\\x4a\\x26\\xad\\x81\\x65\\xd7\\xc6\\x7b\\xff\\x1e\\x9c\\xf2\\x91\\x81\\xab\\x6c\\x4d\\xad\\x4f\\x8d\\x67\\xb0\\xfc\\x52\\x31\\xbd\\xfb\\xb7\\xc6\\x9f\\xfb\\x47\\x8c\\xe3\\xb7\\x5f\\xf1\\x99\\x1d\\x9d\\x5d\\x36\\x95\\xad\\xa9\\x48\\x40\\x56\\x65\\xca\\xf4\\x6c\\xd2\\x9d\\xa8\\x52\\x81\\x2c\\x99\\x92\\xd8\\x8c\\x2a\\xb3\\x4a\\x87\\x51\\xef\\x0a\\x46\\xd9\\x93\\x4f\\xce\\x53\\x97\\x8c\\x7b\\x6c\\xc1\\x0d\\xe9\\xb9\\xd1\\xb9\\x61\\xf6\\xae\\x5d\\x85\\xc8\\x33\\xbf\\x3e\\x4b\\x30\\x1d\\x24\\x4f\\x46\\xf1\\xf7\\xdc\\xfb\\xa3\\xf8\\x94\\xac\\xa4\\x50\\x34\\x1f\\x05\\x97\\x09\\x46\\x75\\xef\\x6f\\x1c\\xcc\\x80\\x69\\xc0\\xd7\\x6a\\xa7\\x57\\xcf\\x47\\x9c\\x36\\x30\\x85\\xda\\x02\\x05\\x81\\x72\\xec\\x84\\xe2\\xa4\\x43\\x6b\\x94\\x39\\x4d\\x51\\x19\\x07\\xd9\\xb4\\xc2\\x39\\x2b\\x9d\\x86\\xab\\x0b\\xae\\xb5\\xaf\\x2a\\x99\\x59\\xae\\xa4\\xab\\x6f\\x9b\\xf0\\x28\\x03\\xcd\\x6c\\xa5\\x65\\xa3\\x9d\\xdb\\xc1\\x89\\x71\\xec\\xa7\\x6c\\x4e\\xec\\xe7\\x78\\xca\\x30\\xc8\\x79\\x1d\\x4c\\xe1\\xa9\\xb7\\x80\\xdb\\x2c\\x7e\\xc7\\xbd\\xc0\\x2b\\xf5\\x7f\\x4c\\x33\\x88\\xa6\\xe3\\x03\\x95\\x38\\x02\\x01\\x7c\\x48\\x9f\\x59\\x66\\xc9\\x0b\\xdb\\x99\\x70\\xd4\\x44\\x24\\xc9\\xc2\\x28\\x22\\x06\\x43\\x0a\\x23\\x52\\xd2\\x4d\\xd8\\x05\\xd6\\x1c\\xbc\\xcb\\x87\\x91\\xf9\\xc7\\x0d\\x92\\xc3\\xb9\\x39\\x39\\xe5\\x7a\\xf2\\xb0\\xc5\\xec\\x08\\x75\\xc8\\x4a\\x70\\x8c\\xef\\x15\\x30\\x98\\xa4\\xe1\\x21\\xcd\\xed\\xc5\\x73\\xd8\\x4f\\x8f\\x30\\x70\\xbe\\x08\\xbd\\x91\\xa0\\xca\\x8d\\x0d\\x83\\x0b\\x99\\x9a\\xcd\\xec\\x22\\xad\\x84\\x98\\xf9\\xef\\x71\\x51\\x06\\x6c\\xf4\\xa9\\xc0\\x6b\\x74\\xee\\x2f\\xe5\\x38\\x80\\xab\\x71\\x08\\x57\\x10\\x2c\\x9a\\xe8\\xb0\\xc7\\x2b\\xbe\\x4e\\xd0\\x87\\x56\\x15\\x0e\\xdd\\xbe\\xad\\x79\\x72\\x0c\\x39\\xeb\\x28\\x80\\x2d\\x8e\\x3c\\x5e\\x76\\xb9\\x66\\xc6\\x1c\\x30\\xd4\\x6f\\x10\\xc9\\xec\\x56\\xe9\\x17\\xe7\\xee\\x97\\x13\\x63\\xfb\\x3e\\xa1\\x5d\\x44\\xd1\\xb8\\xa8\\xfb\\x91\\xef\\xc5\\x60\\xb5\\x78\\xd7\\xc4\\x1c\\x06\\xc6\\x8d\\x48\\xce\\x2c\\xce\\x88\\xbf\\x5e\\xc1\\xe0\\x9d\\xdb\\x0e\\xcb\\x8f\\x66\\xe5\\x67\\x8e\\x4a\\x77\\xa7\\xdf\\xe5\\x28\\xc6\\xb6\\x55\\x64\\x43\\xf1\\x1f\\x5c\\x18\\xb4\\xfd\\x09\\x06\\x45\\x7b\\xf7\\x64\\x81\\x17\\xf5\\xc9\\x68\\x9d\\xd3\\xa2\\x03\\xfe\\xd1\\x01\\x13\\x70\\xed\\x6c\\x27\\x67\\xac\\x8c\\xd1\\xac\\xfc\\xe3\\x8b\\xdd\\xcd\\xd8\\xa8\\x8d\\xdf\\xe9\\xa2\\xfb\\xdb\\x4f\\xbe\\x05\\x00\\x00\\xff\\xff\\xec\\xae\\xf6\\xff\\x62\\x08\\x00\\x00\")\n\nfunc uiTsPagesNodesTsBytes() ([]byte, error) {\n return bindataRead(\n _uiTsPagesNodesTs,\n \"ui/ts/pages/nodes.ts\",\n )\n}\n\nfunc uiTsPagesNodesTs() (*asset, error) {\n bytes, err := uiTsPagesNodesTsBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/ts/pages/nodes.ts\", size: 2146, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiTsPagesRest_explorerTs = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\xec\\x5a\\x5f\\x6f\\xdb\\x38\\x12\\x7f\\xcf\\xa7\\x98\\xd5\\xc3\\x46\\xea\\x26\\xf2\\x02\\xf7\\x72\\x70\\xea\\xec\\xf5\\xd2\\x74\\x7b\\xb7\\xed\\x35\\x48\\xbd\\xc5\\x02\\x41\\xb0\\xa0\\x25\\xda\\x52\\x23\\x8b\\x3a\\x92\\xb2\\xeb\\x2b\\xf2\\xdd\\x6f\\x86\\xa4\\x24\\x4a\\x76\\xfe\\x15\\x49\\x6f\\xb1\\xd7\\x87\\x36\\x92\\x38\\xff\\x38\\xfc\\xcd\\x6f\\x48\\x26\\xa3\\x11\\x28\\x51\\xcb\\x84\\x8f\\xa1\\x62\\x0b\\xae\\x46\\x92\\x2b\\xfd\\x3b\\xff\\x54\\x15\\x42\\x72\\x19\\x6b\\xb5\\x37\\x42\\x91\\xe7\\x92\\xcf\\xb9\\xe4\\x65\\xc2\\x51\\x4a\\x67\\x93\\x20\\x8e\\x47\\x7a\\x53\\xe5\\xe5\\x42\\x8d\\x96\\xb9\\xce\\x64\\x5e\\x7c\\x6c\\x9f\\xe2\\x14\\xd5\\x02\\x18\\x1d\\xef\\xa1\\x2e\\xbc\\xa8\\x75\\x26\\xe4\\x18\\xde\\x32\\xad\\x61\\x2a\\x59\\xb2\\x81\\x70\\x89\\xcf\\x7f\\x4b\\x44\\x72\\x25\\x05\\x4b\\xb2\\x82\\xcd\\x54\\x9c\\x88\\x65\\x84\\xf2\\xcf\\x9e\\xed\\xc1\\x33\\x78\\x91\\x2e\\xf3\\xf2\\x43\\xce\\xd7\\x0a\\x72\\x05\\x3a\\x43\\xaf\\x32\\x5f\\x32\\xb9\\x81\\xa5\\x48\\xeb\\x82\\xc3\\x5c\\x48\\x38\\x69\\xf4\\xb9\\x02\\x46\\x0a\\xb9\\xd2\\x92\\xe9\\x7c\\xc5\\x61\\xcd\\x67\\x64\\x26\\x2f\\x35\\x97\\x73\\x96\\xf0\\x18\\xdf\\x46\\x7b\\x4e\\xd7\\x33\\xfe\\x79\\x0f\\xc0\\xb8\\x04\\x94\\x3e\\xc7\\x89\\x9f\\xba\\x79\\x93\\x5b\\x06\\x2b\\x8e\\x1e\\x55\\xbe\\xac\\x50\\xab\\xb5\\x65\\x7c\\xdb\\xfc\\xe0\\xf4\\x81\\xd2\\x05\\x2b\\x56\\xd4\\x5c\\xc5\\x30\\xcd\\x72\\x8a\\xd8\\xda\\x63\\xa8\\x5a\\x2e\\x0a\\xae\\x45\\x09\\x67\\xac\\xe4\\x45\\x6c\\xbe\\x8f\\xf0\\x7f\\x54\\x17\\x52\\x37\\x93\\xe9\\x39\\xa6\\x90\\xda\\xa0\\xc8\\xcc\\x5b\\x91\\xf2\\x02\\x12\\x51\\x6a\\x96\\x97\\x36\\x19\\x4a\\xe3\\x34\\x13\\x52\\xc7\\x11\\x0a\\x87\\x3e\\xf6\\xac\\x54\\xad\\x3f\\xe7\\x11\\x1a\\x67\\xd6\\x9c\\xf5\\xe2\\xf9\\x21\\x4f\\x67\\x52\\x54\\x5c\\xea\\x1c\\xf3\\xd9\\x18\\x35\\x2e\\xe2\\x56\\x64\\xe4\\x9e\\x5c\\xfc\\x2b\\x26\\xdd\\x1c\\x7f\\xe1\\x1b\\x98\\xc0\\x32\\xae\\xd0\\x44\\x18\\x04\\xd1\\xd1\\x4d\\x82\\x1f\\x28\\x53\\xf7\\x13\\x3d\\x11\\x35\\xe5\\xbc\\x13\\xfe\\x71\\x97\\xac\\x64\\xe5\\x82\\xbf\\xd7\\x0c\\x5f\\xef\\xb0\\x6a\\x24\\x4f\\xcb\\xf4\\x4e\\x39\\xae\\x2a\\x51\\x2a\\xfe\\x46\\x2c\\x3a\\xd1\\x8b\\x4b\\x14\\xdd\\x95\\xb4\\x42\\x2c\\xce\\x9d\\x82\\x05\\x0d\\x86\\x8c\\x8f\\xf3\\xba\\x4c\\x74\\x8e\\x2b\\xbf\\xce\\xf2\\x24\\x83\\x94\\x27\\x98\\x49\\xbb\\x7a\\x8d\\x7d\\xd0\\x02\\x58\\xd9\\x59\\xfa\\xed\\xed\\x9b\\xd7\\x5a\\x57\\xe7\\xfc\\xdf\\x35\\x61\\x8a\\x61\\xa4\\x0b\\x5e\\x72\\x84\\x34\\x01\\x9c\\x1c\\xc1\\x92\\x2b\\x85\\x45\\x9a\\x6e\\xaf\\x48\\xeb\\xcf\\x8b\\x27\\xfc\\x94\\x61\\xdd\\xf5\\xcd\\x1e\\x80\\xa8\\xb4\\x1a\\xc3\\xef\\x4d\\xad\\xbe\\xb5\\x3f\\x7f\\x7b\\x7d\\xfe\\xae\\x22\\x03\\x2a\\x1a\\x63\\x19\\x11\\xb2\\x1b\\x8c\\x80\\xc9\\x4a\\xca\\x34\\x73\\x23\\x47\\xed\\x40\\x3e\\x07\\x72\\x12\\x37\\x53\\x9a\\x6e\\x2a\\x5c\\xdc\\xc9\\x04\\x82\\x8f\\x4a\\x94\\x41\\xe4\\xd9\\x00\\x63\\x01\\x13\\xfa\\xcf\\xf7\\xef\\xfe\\x15\\x5b\\x43\\xf9\\x7c\\xd3\\x53\\x8f\\x3a\\xcb\\xd7\\xc0\\x0b\\x4c\\xd1\\x0e\\xfd\\x9e\\x3f\\xfe\\x49\\x7b\\x3a\\x7b\\x03\\x51\\xfa\\x11\\x17\\xbc\\x5c\\xe8\\x0c\\x8e\\xe1\\x47\\xf8\\xc9\\x0e\\x8c\\x21\\x08\\x4b\\xd1\\xad\\xc3\\x4c\\xa4\\x9b\\x28\\x38\\x1a\\x6a\\x5f\\xec\\x5f\\xec\\xdb\\x74\\xc5\\x4b\\x8e\\x1c\\x96\\x1e\\xc0\\xfe\\x25\\xe0\\x27\\x8a\\x80\\x4a\\xb0\\x56\\xf8\\x05\\x1a\\x99\\x5a\\x16\\xf8\\x3a\\xa6\\x77\\x32\\x70\\x19\\x7f\\x14\\x79\\x19\\xee\\xef\\x7b\\x93\\xf2\\x90\\x15\\x46\\x71\\x55\\xab\\x2c\\x24\\xd1\\xc8\\x13\\xd0\\xb5\\x2c\\x87\\x29\\xf2\\x65\\xae\\x77\\x82\\x50\\x25\\xac\\x84\\x34\\x57\\xc8\\xcd\\x96\\x0e\\xed\\x17\\xe9\\xa0\\x84\\x40\\x33\\xb4\\xc1\\x25\\x32\\x1a\\xcc\\x98\\xe2\\x29\\x20\\x54\\xe8\\x5b\\x52\\x4b\\xa4\\x75\\xdd\\x99\\xb2\\x54\\x06\\x62\\xee\\x57\\x16\\x61\\xb1\\x29\\x1f\\x62\\x39\\xde\\x9a\\x5e\\xe7\\x45\\x01\\x35\\x81\\x99\\x1c\\xd4\\x55\\x55\\xe4\\x3c\\xed\\xac\\x65\\x88\\x3c\\xb0\\xd9\\x6b\\xf4\\x5c\\xd2\\x8d\\xe2\\x8c\\x13\\x5e\\x11\\xd0\\x4d\\x88\\xed\\x30\\x7e\\xbe\\x91\\x76\\x5a\\xac\\xd3\\x24\\x43\\x6b\\x7d\\x0c\\x36\\x5f\\xd1\\x78\\x88\\x6c\\x64\\xb5\\x65\\xae\\xf8\\x73\\x56\\x6e\\x8e\\x07\\x98\\xe6\\x65\\x5a\\xe1\\x22\\x11\\x73\\x04\\xa3\\xab\\x95\\x69\\x7d\\x23\\x33\\xcf\\x9f\\x14\\xcd\\x7b\\x12\\xc0\\x0f\\x28\\x44\\xa5\\xfb\\xeb\\xf9\\x3f\\x4e\\xc4\\x12\\x63\\xc3\\x64\\x85\\x5d\\x66\\xc2\\x28\\xea\\x57\\xc3\\x77\\xdf\\x35\\x79\\xc2\\xa1\\x1e\\x7c\\x5b\\x67\\x3f\\x4c\\x60\\xff\\x7b\\x7c\\x9b\\xec\\xdf\\x62\\xdd\\x1a\\xd8\\x85\\x6d\\x87\\x91\\x65\\xec\\x96\\x20\\xf4\\x9d\\x34\\xc9\\x70\\x80\\xf5\\x46\\x10\\x9e\\xe3\\x36\\x06\\x7f\\x00\\x4b\\x08\\x9b\\xb2\\x1e\\xfb\\xcc\\xd1\\x8d\\x5f\\xb7\\x31\\xec\\x46\\x1e\\x06\\x8c\\x3d\\xb2\\x07\\xbd\\x16\\x75\\x4c\\x2e\\xb8\\x26\\x26\\x69\\x3a\\xa1\\x93\\xee\\xc1\\xf1\\xc0\\xe2\\xb1\\xb3\\xd8\\x07\\xa6\\x87\\xc7\\xae\\xd3\\x10\\x1c\\xbd\\x76\\xb2\\x8d\\xc8\\xce\\xda\\x10\\x9a\\x0f\\x45\\x64\\x67\\xe9\\x61\\xd0\\x34\\x33\\x7d\\x74\\x6c\\x1a\\xab\\x23\\x42\\x65\\x9b\\x8c\\xd0\\x03\\x89\\xed\\x5e\\x26\\x0d\\x5b\\xae\\x3a\\x82\\x47\\x8b\\x4f\\x0a\\x19\\xa0\\x95\\xcd\\x59\\x91\\xff\\x07\\xf7\\x94\\x4d\\x42\\x2c\\x89\\xc1\\xe7\\x06\\xbe\\x86\\x63\\xaf\\x3d\\x9c\\xf5\\xcb\\xc8\\x06\\x63\\x5b\\xc9\\xd9\\xbb\\xf7\\xd3\\x41\\x2b\\x71\\x93\\xc4\\x4d\\x63\\x39\\xcf\\xa9\\x4b\\xb7\\x6e\\x90\\x9b\\x2d\\x1f\\xf7\\x15\\xc0\\x92\\x36\\xd7\\xae\\x0d\\xbe\\xe6\\x2c\\xe5\\x32\\x0c\\x4e\\x70\\x5b\\x85\\x49\\x3d\\xa4\\xc6\\x15\\x1c\\x40\\xa0\\x71\\x6a\\xa3\\xaa\\xc0\\x9d\\xd6\\x11\\x24\\x19\\xc3\\x4e\\xae\\x27\\xbf\\x4e\\x5f\\x1d\\xfe\\x15\\x03\\x38\\xea\\xd9\\x73\\xf3\\x40\\xb3\\xfe\\xf7\\xeb\\x1d\\x41\\xba\\x76\\xe2\\x01\\x36\\xec\\x15\\xf6\\xcd\\x95\\xed\\x7e\\xde\\x51\\x82\\x89\\xdb\\x27\\xfd\\xcf\\x8a\\xd0\\x6d\\xd4\\xfe\\x88\\x65\\xe8\\x72\\xf3\\xe8\\x85\\xe8\\xec\\x7e\\x2b\\xc5\\xa7\\x2b\\x45\\x46\\x48\\x49\\x18\\x99\\x1a\\x7d\\x3a\\x5c\\xaf\\xd7\\x87\\x78\\x28\\x59\\x1e\\x62\\x26\\x6c\\xcf\\x4c\\x9f\\xa8\\x42\\x1d\\x9a\\x1f\\xb9\\x46\\x0b\\xce\\x24\\x1d\\x28\\xcc\\x83\\xfa\\x82\\xbd\\x4e\\x63\\x21\\xf4\\xb3\\xe9\\x6f\\x28\\xcd\\x09\\xa5\\x5d\\xc1\\x3d\\x2f\\x16\\xef\\x30\\x39\\xab\\x35\\x1d\\x47\\xcd\\x41\\x25\\xe3\\x05\\x1e\\xf7\\x3a\\x0f\\x3a\\x63\\xba\\x77\\xe2\\x48\\x30\\xff\\x57\\x6c\\x86\\x94\\xe1\\xd4\\xdc\\xa9\\xb0\\x31\\x36\\x38\\x71\\x2e\\x78\\xff\\xc0\\xd9\\x1a\\xb6\\xda\\x21\\x71\\xab\\x3b\\x41\\x20\\x2e\\x4a\\x63\\x7d\\x1c\\x46\\x93\\x63\\x2c\\xba\\x03\\x62\\x2f\\x72\\x95\\x9a\\x2f\\x33\\x21\\x70\\xba\\x65\\x37\\xd5\\x26\\xed\\x61\\x90\\x97\\x55\\xad\\x2f\\x34\\x82\\x64\\x62\\xed\\x5e\\x22\\x58\\xfc\\x8a\\x45\\xa6\\x1a\\x03\\xf9\\xea\\x10\\xdd\\xda\\x6e\\x9f\\xc2\\xa8\\x1b\\x6d\\x42\\x69\\x1e\\x9a\\x91\\x66\\xeb\\xb3\\x9d\\x45\\x3b\\x89\\x57\\x39\\x2f\\xd2\\xfb\\xa5\\x12\\x33\\x4e\\x61\\xc3\\xdc\\xa8\\x7c\\x61\\x1a\\x8d\\xf2\\xf3\\xe9\\x71\\x3f\\x91\\x76\\xc2\\x94\\xb4\\xe9\\x17\\x25\\x91\\x8c\\xf5\\x53\\x88\\xed\\x2f\\xe1\\x99\\x28\\xb0\\x2a\\x1f\\x96\\x48\\x97\\xfb\\x95\\x6d\\x71\\xbd\\x04\\x67\\xb4\\xa7\\x45\\x62\\x8b\\xd7\\x48\\x81\\x2f\\xb4\\xc6\\x7a\\x37\\x62\\x81\\x9b\\x40\\x74\\x43\\xd2\\xdd\\xa5\\xc5\\x29\\xb5\\xac\\x76\\x87\\xdc\\xc6\\x9a\\x14\\x4c\\x29\\x20\\xe2\\x90\\xa2\\x28\\xda\\xcb\\x13\\xb3\\x5a\\x23\\xef\\x3a\\x23\\xde\\x2a\\x98\\x33\\xe4\\x52\\x6a\\x8a\\xed\\xf9\\x7e\\xce\\x8a\\xde\\xf9\\xf3\\xca\\x5c\\x68\\x98\\xcb\\x92\\xb8\\x25\\x78\\x9f\\xde\\x8b\\xc1\\xb0\\x69\\xec\\x47\\x7b\\x7e\\x00\\xaf\\xdc\\xca\\xf5\\xfc\\x5b\\xd6\\x70\\x4c\\xef\\xda\\x51\\x8f\\x1f\\x75\\x96\\xab\\x78\\x10\\x67\\xa8\\x65\\xed\\x47\\x07\\xce\\xb5\\xbf\\xcb\\x8c\\x62\\xc4\\x14\\x56\\x19\\xa9\\x27\\x82\\xee\\xac\\x34\\x3f\\x80\\xde\\xeb\\x6e\\x4a\\xc3\\x48\\xff\\x8e\\x9c\\x97\\xb6\\x48\\x53\\xee\\xd2\\x82\\x49\\x4e\\x8d\\x1b\\x31\\x8e\\xf4\\xc3\\x8a\\x62\\xc6\\x92\\x2b\\x6f\\x2e\\x95\\xcc\\x57\\x08\\x6f\\x68\\xac\\x63\\x42\\x90\\x9c\\x26\\xc7\\xbb\\x67\\x30\\x4c\\x30\\xee\\x4a\\x86\\x0a\\x36\\x35\\xc1\\xcf\\xa7\\xd3\\xc0\\x13\\xac\\x84\\xba\\x49\\xd2\\xb6\\xa3\\x4e\\x34\\xc3\\x56\\x72\\x83\\xe8\\xeb\\xd3\\x17\\x2f\\x7d\\x51\\xcc\\xde\\x8e\\x90\\x9d\\xf0\\xcb\\xd3\\x37\\xa7\\xd3\\xd3\\x60\\x9b\\xd3\\xb7\\xb7\\x17\\x0d\\xf4\\xc2\\x68\\xbc\\x13\\x87\\xae\\xe6\\x4a\\xbe\\xf6\\x70\\x1a\\xde\\x6d\\x79\\x95\\xf3\\x75\\x98\\x68\\x6c\\xfb\\x9d\\x5a\\xb4\\x6d\\x17\\x6b\\x59\\x71\\xa3\\x41\\x09\\x6f\\x69\\xc4\\xe9\\xa8\\x43\\x17\\x20\\x96\\xd9\\x45\\xaf\\x37\\xa2\\x5e\\xf6\\x17\\xea\\xb2\\xbf\\x8c\\x3e\\xc0\\x19\\xcb\\x65\\x10\\x1d\\x0c\\x05\\xa8\\xdd\\x6e\\x29\\x82\\xa5\\xa1\\x30\\xc0\\x72\\xc0\\x41\\x8a\\x30\\xc6\\x5a\\x71\\x4f\\x83\\x45\\x1f\\xd8\\x44\\xab\\x31\\x02\\x99\\x32\\xfc\\xbd\\x64\\x52\\x1e\\x0d\\x9d\\xb6\\xc6\\x3f\\x38\\x6e\\x30\\x46\\xb1\\xd6\\xee\\x69\\xde\\x35\\x9a\\xe0\\x67\\xae\\x1b\\x65\\x84\\xd9\\x03\\x95\\x69\\x3f\\xd2\\x68\\x13\\xa0\\x1e\\xa8\\x7e\\x56\\xb7\\xbe\\x09\\xb9\\x0f\\xd4\\x7e\\x69\\x60\\xd9\\x18\\xb0\\x20\\xbd\\x97\\x89\\xcb\\xee\\x12\\xc9\\xdb\\x07\\xec\\xa0\\xd2\\x73\\x62\\xe2\\xaf\\x4a\\xa5\\xbd\\x1b\\x5a\\xcb\\x5b\\xdd\\xa7\\x81\\x98\\xbd\\x9e\\xf5\\x84\\xf0\\xc3\\xd7\\x26\\x55\\xef\\x56\\xe9\\xcf\\xca\\xa9\\xdf\\xd8\\xcf\\xb2\\x9f\\x29\\x86\\x07\\x53\\x9f\\x01\\x6e\\x53\\xa3\\x1d\\x94\\x1f\\x99\\x03\\x11\\xf9\\x3d\\x1f\\xf8\\xfe\\x35\\x69\\xf0\\xe9\\x99\\xc8\\x1d\\xb4\\xfe\\xd8\\xdb\\x3a\\x17\\xe4\\x9d\\x1c\\xd4\\x14\\xee\\x23\\x73\\x51\\xff\\xfe\\xe2\\xcf\\x4a\\x47\\xdf\\xb6\\x78\\x4f\\x49\\x72\\x0e\\xc2\\xdf\\x76\\x78\\xff\\x27\\x3b\\xbc\\x37\\x62\\xb1\\xcd\\xa9\\xdd\\x9f\\x2f\\xec\\xc4\\x70\\x21\\x16\\xdb\\xbf\\x13\\x76\\x4c\\xbb\\x79\\x6e\\x59\\xec\\xe2\\xf2\\xb8\\x2b\\x2e\\x73\\x1d\\x35\\x06\\xba\\x67\\x58\\x89\\x3c\\x7d\\xbc\\x32\\xf2\\x99\\xd2\\x44\\xe5\\x36\\x83\\xdd\\x4d\\x97\\x9f\\x16\\x17\\x86\\x23\\x4b\\x77\\x45\\xe6\\x5d\\x65\\x3e\\x5e\\x0d\\xf6\\x8a\\x0f\\x9d\\xdc\\x56\\x6f\\xa5\\x12\\xc5\\xd6\\xb6\\xa2\\x01\\xc0\\x09\\x45\\xd9\\xac\\xbf\\x09\\xf9\\xc0\\x31\\x94\\xe5\\xcf\\xbe\\x96\\x91\\x2a\\xcc\\xef\\x8b\\x97\\x0c\\xfb\\x59\\x13\\x78\\x88\\x6b\\x32\\xbc\\x57\\xf5\\xc3\\x45\\x07\\x24\\xd1\\x1b\\xbf\\xf6\\x11\\xb4\\x0b\\x40\\xfd\\x3f\\x4b\\x39\\x63\\x8b\\xee\\x17\\xf0\\xb7\\xad\\x27\\x7c\\xbe\\xbe\\x2d\\xbd\\xf7\\xc8\\xe7\\xae\\x64\\xee\\x64\\xbb\\x1d\\x6c\\xd5\\xbf\\x1b\\x1a\\x96\\x5d\\xff\\xb8\\x33\\x1c\\x1d\\x6e\\x41\\x86\\x15\\xd7\\x7f\\xf7\\x0b\\xeb\\xe0\\x96\\x62\\xa4\\x7f\\xd7\\x7b\\xff\\x0d\\x00\\x00\\xff\\xff\\x29\\xf7\\x5b\\xb6\\x59\\x25\\x00\\x00\")\n\nfunc uiTsPagesRest_explorerTsBytes() ([]byte, error) {\n return bindataRead(\n _uiTsPagesRest_explorerTs,\n \"ui/ts/pages/rest_explorer.ts\",\n )\n}\n\nfunc uiTsPagesRest_explorerTs() (*asset, error) {\n bytes, err := uiTsPagesRest_explorerTsBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/ts/pages/rest_explorer.ts\", size: 9561, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiTsPagesStoresTs = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\xc4\\x55\\x4b\\x6f\\xdb\\x38\\x10\\xbe\\xfb\\x57\\x0c\\x74\\x08\\xa4\\xac\\x97\\xda\\xc7\\x4d\\x5e\\x07\\x9b\\xa6\\x45\\x11\\xa0\\xe9\\x03\\x06\\x7a\\x09\\x0c\\x83\\x96\\x68\\x8b\\x09\\x45\\xba\\x24\\x65\\xd7\\x08\\xfc\\xdf\\x3b\\xa4\\x1e\\x96\\x1c\\x39\\xc9\\xad\\x02\\x2c\\x8b\\xe4\\x7c\\xdf\\x7c\\x33\\x9c\\x21\\xe3\\x18\\x8c\\x2a\\x75\\xca\\x12\\xd8\\xd0\\x35\\x33\\xb1\\xb1\\x4a\\x33\\x43\\xac\\x19\\xc5\\xb8\\xf6\\x9f\\x66\\x2b\\xa6\\x99\\x4c\\x19\\x2e\\xdb\\x7c\\x1a\\x10\\x12\\xdb\\xfd\\x86\\xcb\\xb5\\x89\\x0b\\x6e\\x73\\xcd\\xc5\\x43\\xfb\\x45\\x32\\x84\\x05\\x10\\x5f\\x9d\\x85\\x16\\x2a\\x63\\xa2\\xf6\\xb1\\x30\\x96\\xda\\xd2\\x34\\x10\\xc4\\xc0\\x75\\x69\\x73\\xa5\\x13\\x78\\xa7\\x69\\x01\\x1f\\x75\\x29\\x19\\xd7\\x10\\x2e\\x71\\x44\\xd6\\xd5\\xe8\\xff\\x75\\x41\\xd1\\x51\\xaa\\x8a\\x08\\x11\\x97\\x97\\x23\\xb8\\x84\\xeb\\xac\\xe0\\xf2\\x3b\\x67\\x3b\\x03\\xdc\\x80\\xcd\\xd1\\x9f\\xe6\\x05\\xd5\\x7b\\x40\\x77\\xa5\\x60\\xb0\\x52\\x1a\\x6e\\x54\\xfa\\xa8\\x15\\x4d\\x73\\x66\\x80\\x3a\\x00\\x37\\x56\\x53\\xcb\\xb7\\x0c\\x76\\x6c\\xe9\\x68\\xb8\\xb4\\x4c\\xaf\\x68\\xca\\x08\\x8e\\xe2\\x51\\x8d\\xed\\x90\\x3f\\x8d\\x00\\xbc\\x4b\\x40\\xeb\\x99\\x4f\\x53\\xe3\\x70\\x8b\\x06\\xde\\x0d\\xfb\\xb9\\x11\\x4a\\x63\\x7a\\xfc\\x74\\x15\\x21\\xa8\\x15\\x50\\x21\\x6a\\x08\\xf1\\xf8\\x18\\xdf\\x68\\xab\\xb4\\x6d\\x44\\xd6\\x84\\xce\\x49\\xbb\\xb4\\xa5\\x1a\\x7c\\xae\\x66\\x9e\\x88\\x99\\x04\\xee\\x7c\\x06\\xc9\\xec\\x38\\x4b\\x6a\\xe4\\x14\\x24\\x8a\\x38\\xbb\\x1e\\x46\\x93\\x2e\\x75\\x2a\\xa8\\x31\\x98\\x15\\x69\\xb5\\x12\\x82\\x69\\xe0\\xc5\\x46\\xb0\\x82\\x49\\x6b\\x60\\xd1\\xec\\xe7\\x5d\\xf5\\xdf\\xb1\\xaa\\xe4\\x81\\xcb\\xf0\\x96\\xda\\x2a\\x42\\x9e\\xc2\\xe2\\x47\\xc9\\xf4\\xfe\\xc3\\x16\\x5f\\x77\\x33\\x54\\xf2\\xf7\\x5f\\xf8\\x4c\\x4e\\x6c\\x17\\x3e\\xc3\\x5b\\x2a\\x12\\x90\\x65\\xb1\\x64\\x7a\\x32\\x6a\\x2c\\xca\\xa5\\x40\\x96\\x54\\x49\\xdc\\x94\\x32\\x45\\xbd\\x61\\xd4\\xba\\x82\\x7e\\x0a\\xc8\\x37\\xe7\\xaa\\x89\\xc6\\x3d\\x36\\xe7\\x86\\xb4\\xe4\\xe8\\xdd\\x30\\x7b\\x5b\\x8f\\x42\\x24\\x9a\\x5e\\x0d\\x33\\x8c\\x3b\\xe1\\x93\\x5e\\x04\\x2d\\xf9\\xe1\\x44\\xa1\\x92\\xa5\\x14\\x8a\\x66\\x3d\\x79\\xa9\\x60\\x54\\xb7\\x0e\\xfb\\x6a\\x3a\\x4c\\x1d\\xbe\\xba\\x8a\\x8e\\x75\\xf4\\x15\\x5b\\x0f\\x4c\\xae\\x76\\x40\\x41\\x60\\x65\\x36\\x25\\x43\\x53\\x5f\\xa1\\xe6\\x58\\x39\\x75\\xed\\x0c\\x57\\x8f\\xa7\\x69\\x84\\xd5\\x06\\xab\\x52\\x22\\x89\\x92\\x2e\\xbb\\x75\\xb0\\x3d\\xf5\\x9a\\xd9\\x52\\x4b\\x5f\\x3b\\x37\\x1d\\x8b\\xbe\\xee\\xe7\\x6c\\xae\\xe2\\x87\\x78\\x8a\\x30\\xc8\\xf8\\x36\\x18\\xc3\\x7d\\xbb\\x02\\x6e\\x32\\xff\\x07\\xe7\\x82\\xba\\x54\\x3f\\x61\\x88\\x41\\x34\\xee\\x5b\\x94\\xe2\\x04\\x05\\xf0\\x65\\xf9\\xc0\\x52\\x4b\\x1e\\xd9\\xde\\x84\\xfd\\x2d\\xcc\\x98\\x49\\xc3\\x28\\x22\\x06\\x45\\x85\\x11\\x29\\xe8\\x26\\x6c\\xa4\\x55\\x96\\xb7\\x59\\x57\\x5c\\xf5\\xb8\\x76\\x72\\x40\\x57\\x22\\x03\\x6c\\xf7\\x35\\x70\\x3e\\x39\\xc1\\x1d\\x43\\x13\\x1c\\x35\\x3e\\x01\\x0a\\x4a\\x3c\\x13\\xa9\\x4e\\x32\\x9e\\xc1\\x61\\x7c\\x02\\x82\\xe1\\x54\\xb4\\x8b\\x04\\x2b\\xdd\\xd8\\x30\\xb8\\x90\\x4b\\xb3\\x99\\x5c\\x2c\\x4b\\x21\\x26\\xd5\\x77\\x3f\\x33\\x1d\\x36\\x7a\\x9f\\xe3\\x99\\x3a\\xad\\x8f\\xe8\\x38\\x80\\x3f\\xa0\\x96\\x8c\\x5f\\xc1\\xdc\\x4b\\xc3\\x5d\\x5e\\xf1\\x75\\x82\\xfc\\x5a\\x95\\xd8\\x74\\x87\\x26\\xeb\\x49\\xc7\\x7c\\xd0\\x41\\x80\\xd5\\x0d\\xc1\\x2b\\xae\\x25\\x1e\\x2f\\x95\\x67\\x1f\\xbe\\x1b\\xfa\\x97\\x4b\\xc1\\x0b\\x1a\\x82\\xcf\\x68\\x93\\x0c\\xc2\\xce\\x68\\xd9\\xe1\\xd1\\x83\\x87\\x6f\\x86\\x81\\x9a\\x13\\x20\\xad\\x66\\x89\\x64\\x76\\xa7\\xf4\\xa3\\xf3\\xfb\\xe7\\xb0\\x45\\xfd\\xff\\xcc\\xc1\\x3c\\x8a\\xfa\\x7b\\x7c\\xe8\\xa9\\x98\\x77\\x46\\xf3\\xb7\\x75\\xf0\\xb1\\x81\\xdd\\xb9\\x9f\\x31\\x8b\\xb7\\x54\\x75\\xf0\\x83\\xc1\\xdb\\x00\\x3b\\xd4\\x0b\\x7b\\xad\\x83\\x7f\\x67\\x03\\xb7\\x97\\x0d\\x96\\xd3\\xb4\\xd9\\x3b\\xb2\\xa1\\x78\\xfb\\x86\\x41\\x53\\xe7\\x41\\x27\\x71\\x6f\\xef\\x78\\xa8\\x3a\\xed\\x59\\xcb\\x0f\\xb5\\x87\\x43\\xfe\\xdb\\x22\\x13\\x38\\x5f\\xb6\\xfd\\x1e\\x7e\\x5f\\xe5\\xbc\\xed\\xfe\\xde\\x7e\\xbe\\xb0\\x9d\\xee\\x77\\x18\\xfd\\x0a\\x00\\x00\\xff\\xff\\x2a\\xcc\\x4b\\x96\\x07\\x09\\x00\\x00\")\n\nfunc uiTsPagesStoresTsBytes() ([]byte, error) {\n return bindataRead(\n _uiTsPagesStoresTs,\n \"ui/ts/pages/stores.ts\",\n )\n}\n\nfunc uiTsPagesStoresTs() (*asset, error) {\n bytes, err := uiTsPagesStoresTsBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/ts/pages/stores.ts\", size: 2311, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiTsTsconfigJson = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\x84\\x92\\x41\\x4b\\x3b\\x31\\x10\\xc5\\xef\\xfd\\x14\\x65\\xcf\\x7f\\x12\\x0a\\x7f\\x2f\\xde\\x44\\x7a\\x10\\x94\\x7e\\x00\\x91\\x12\\xb7\\xd3\\x36\\x25\\xc9\\x84\\x99\\x49\\x51\\xa4\\xdf\\xdd\\x49\\x5a\\xb1\\x75\\xbb\\xba\\x97\\x85\\xfc\\xde\\x7b\\x93\\x79\\xbb\\x1f\\x93\\xa9\\x3e\\xdd\\x1e\\x88\\x3d\\xa6\\xee\\x76\\xda\\xcd\\xcc\\x7f\\x33\\xeb\\xfe\\x1d\\xcf\\x7b\\x8c\\xd9\\x07\\xa0\\x45\\x16\\xc5\\xac\\xfc\\x68\\x68\\x50\\x1c\\x6d\\x40\\xaa\\x07\\xf8\\xe6\\xe4\\x68\\x20\\xe2\\xaa\\x04\\xa8\\x40\\xfd\\x11\\xd3\\x8e\\xcf\\xe9\\x0a\\xfa\\xe0\\xc8\\xc9\\x71\\xde\\xda\\x05\\x86\\x33\\x9a\\xf0\\x21\\xe6\\xe0\\x7b\\x2f\\x77\\xe9\\xfd\\x2a\\x9f\\x47\\x2f\\x8b\\x34\\x27\\x42\\x52\\x2e\\x54\\xce\\x31\\x41\\xc4\\x3d\\xdc\\xeb\\x58\\x48\\xc2\\x43\\x9e\\xf0\\xd1\\xbf\\x5e\\x89\\xc5\\xd2\\x16\\x31\\xb6\\x78\\xbb\\x63\\xeb\\x72\\x36\\x97\\xb7\\x66\\x2c\\xd4\\xc3\\x93\\xcb\\x5f\\xe6\\x86\\x0e\\xa7\\x9e\\xd6\\x5a\\x52\\x9d\\xf6\\xfc\\x6d\\x30\\x76\\x0b\\x6e\\x05\\x64\\xe4\\x22\\xc7\\xb4\\xec\\x9f\\x67\\xda\\x18\\x04\\xb6\\x49\\x5f\\x4b\\x16\\x27\\x85\\xc7\\x24\\x95\\xfe\\x02\\x91\\xfe\\x0a\\x10\\x1f\\x81\\x81\\x3c\\x0c\\x15\\xf5\\x6b\\x63\\xaa\\xc5\\xd9\\x08\\x42\\xbe\\x1f\\x4a\\xb2\\xdb\\x00\\xdb\\x0d\\xb9\\xbc\\x1d\\x61\\x75\\x87\\x31\\x5f\\xbb\\xdf\\x18\\xd4\\x1f\\xc5\\x2b\\x1f\\xa1\\xea\\x93\\x25\\xbc\\xe5\\xa0\\x09\\x4d\\xd3\\x24\\x2f\\x93\\xc3\\xe4\\x33\\x00\\x00\\xff\\xff\\x2f\\x17\\x33\\x4e\\xc3\\x02\\x00\\x00\")\n\nfunc uiTsTsconfigJsonBytes() ([]byte, error) {\n return bindataRead(\n _uiTsTsconfigJson,\n \"ui/ts/tsconfig.json\",\n )\n}\n\nfunc uiTsTsconfigJson() (*asset, error) {\n bytes, err := uiTsTsconfigJsonBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/ts/tsconfig.json\", size: 707, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiTsTypingsD3D3DTs = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\xec\\xbd\\xeb\\x72\\xdc\\xb6\\xb2\\x28\\xfc\\x3f\\x4f\\xc1\\x4a\\x55\\x6a\\x8d\\x52\\xb2\\x9c\\x4b\\x7d\\x5f\\x9d\\x92\\xb3\\xa3\\xe3\\xf8\\x96\\xec\\x6d\\x27\\xde\\x1e\\x39\\x95\\xac\\xd4\\xaa\\x55\\x18\\x12\\x33\\xc3\\x98\\x43\\x4e\\x40\\x52\\xd2\\x24\\xdb\\x0f\\x74\\x9e\\xe3\\xbc\\xd8\\x41\\x37\\x00\\x12\\x04\\x01\\x10\\xe4\\x8c\\x2c\\x59\\x91\\xaa\\x6c\\xcd\\x08\\x40\\xdf\\x70\\xeb\\x6e\\x34\\x1a\\x0f\\x1f\\x46\\xe7\\xbb\\x2d\\x8d\\x12\\xba\\x4c\\xf3\\xb4\\x4a\\x8b\\xbc\\x8c\\x96\\x05\\x8b\\x92\\xaf\\xff\\x73\\xfe\\x09\\x2f\\x7c\\xcd\\x8a\\xdf\\x69\\x5c\\x9d\\x46\\xeb\\xaa\\xda\\x9e\\x3e\\x7c\\x98\\x7c\\xfd\\x7b\\x79\\x52\\xb0\\xd5\\x43\\x28\\x7c\\xaa\\x35\\x5a\\xec\\x4e\\xa3\\xef\\x0a\\x96\\x96\\xd1\\xaf\\x24\\x7f\\x57\\x5c\\x44\\xdf\\x40\\x8b\\x92\\x37\\x59\\xa5\\xd5\\xba\\x5e\\x9c\\xc4\\xc5\\xe6\\xe1\\x02\\x2a\\xec\\xb0\\xfc\\x5b\\x03\\x80\\xc0\\xe0\\xae\\xff\\x50\\xd6\\xa5\\xd9\\x0e\\x08\\x4e\\x3e\\xf9\\x24\\xa1\\x71\\x46\\x18\\x8d\\x36\\x45\\x52\\x67\\x34\\x7a\\xfa\\x75\\xf4\\xd7\\x27\\x11\\xff\\xa1\\x57\\xdb\\x82\\x55\\x51\\x9a\\x57\\x94\\x2d\\x49\\x4c\\xa3\\x39\\xcd\\x38\\x0b\\x05\\x2b\\x65\\x05\\xf8\\x79\\xf8\\xf9\\xe7\\xcd\\xe7\\xcf\\x65\\x8d\\x88\\xe4\\x11\\xff\\xb0\\xa1\\x79\\x15\\x2d\\x59\\xb1\\x89\\xaa\\x35\\x8d\\xe2\\x9a\\x31\\xf8\\x43\\x52\\xc4\\x35\\x94\\xb4\\xad\\x1e\\x36\\x1f\\x4b\\x6c\\x7e\\xaa\\x81\\x37\\x51\\x08\\x34\\x6f\\x68\\x55\\x33\\x2e\\x2b\\x80\\x4b\\x37\\xdb\\x6a\\x27\\x5b\\x72\\xfe\\xbb\\x35\\x1f\\x76\\xbe\\xce\\x8e\\x4e\\xa3\\x7f\\xcf\\x55\\xcd\\x6f\\x48\\xbe\\xfb\\xf6\\xd1\\x00\\x26\\x51\\x5b\\x60\\x5a\\xa6\\xac\\xac\\x1a\\xc6\\xaa\\x35\\xa9\\xa2\\x0d\\xa9\\xe2\\x35\\x15\\xc5\\xe5\\x96\\xc6\\xe9\\x32\\xa5\\x89\\x24\\x86\\x77\\x7e\\x59\\xb1\\x34\\x5f\\x75\\x41\\x1a\\x08\\xfe\\xf7\\x96\\x30\\xb2\\x69\\x9b\\x34\\xe4\\x45\\x73\\x6c\\x1c\\x55\\x85\\xc0\\xe2\\x65\\x4c\\x35\\x3f\\x95\\x28\\xf7\\x63\\xb4\\xe5\\x24\\x2f\\x12\\x1a\\x42\\xbe\\x12\\xca\\x8f\\xbc\\x7e\\x2b\\xa1\\x42\\xb2\\xe5\\x25\\x5d\\xd6\\x3e\\x8d\\x9e\\x5d\\xf0\\x5f\\xe7\\x84\\xad\\x68\\xe5\\x23\\xff\\xfd\\xa3\\x4f\\xfc\\x83\\x6f\\x53\\x67\\x55\\xba\\xcd\\x1a\\x3a\\xca\\x29\\x63\\xf0\\x71\\x96\\x0d\\x0f\\x43\\x25\\x33\\x92\\x65\\x2d\\xb2\\x76\\x5c\\x38\\x46\\xc5\\x47\\x3c\\x1c\\x08\\x63\\x64\\x17\\x15\\xcb\\x86\\xdb\\x11\\x63\\xa3\\x8c\\x1e\\xab\\xd6\\xb9\\x36\\x4a\\xca\\x71\\xc3\\xa4\\xec\\x8c\\x93\\xdf\\xfe\\x35\\x30\\x52\\xf0\\xd7\\x27\\xf6\\xd5\\xec\\xe9\\xd7\\x08\\x89\\x17\\x54\\x34\\x4f\\x4a\\x01\\x57\\xeb\\xf3\\xe4\\xea\\x34\\xca\\xeb\\xcd\\x82\\xb2\\x16\\x64\\xb2\\xeb\\xff\\x2d\\xce\\x52\\xde\\xf0\\x17\\x57\\xc1\\xaf\\xfd\\x82\\x8a\\x91\\xbc\\xcc\\x48\\x45\\x55\\xd1\\x6f\\xff\\x6a\\x0b\\xcb\\x98\\x64\\xb4\\xdf\\xa6\\x2c\\x6a\\x16\\x53\\xa4\\xf1\\x54\\x91\\xde\\x96\\x5a\\x48\\xb5\\x50\\xfa\\x8e\\xee\\x9e\\x70\\xd1\\xf7\\x0b\\x48\\x56\\xfd\\x17\\xdd\\x9d\\x9d\\x46\\x8b\\xa2\\xc8\\x28\\xc9\\x35\\x1e\\x2a\\x96\\x39\\x8a\\x36\\xb4\\x22\\x8e\\xa2\\x72\\x9d\\x2e\\x5d\\x10\\x2b\\xbe\\xe9\\xa8\\x71\\xe9\\xef\\xa0\\xef\\x48\\x49\\x9b\\xde\\x19\\xde\\x7b\\x9e\\x30\\xca\\x45\\x1a\\x91\\x68\\x41\\xd7\\xe4\\x22\\xd5\\x26\\x9a\\x36\\x96\\x54\\x19\\xdf\\x63\\xe5\\xa7\\x13\\xf5\\xe1\\x91\\x03\\xee\\xe3\\x38\\xa6\\x65\\xd9\\x59\\x3f\\xea\\x92\\xb2\\x88\\xe2\\x78\\x81\\x3d\\x1e\\x49\\x26\\xdd\\xed\\x47\\xc3\\x49\\x8d\\x4e\\x73\\xd1\\x5f\\x6c\\xb6\\xb0\\x0d\\x57\\x97\\x45\\x74\\x41\\xb2\\x9a\\x0a\\x05\\xa2\\xe4\\x42\\xe1\\xa2\\x3a\\xd1\\x6a\\xaa\\xed\\xef\\xc1\\x97\\x51\\xba\\xe4\\x0c\\x73\\x5d\\x21\\x13\\x24\\xf2\\x8d\\x77\\x71\\x1c\\xf1\\x56\\x6d\\xc9\\x0a\\xc5\\xc2\\xf4\\xc2\\x2f\\x5a\\x58\\x1a\\x54\\x39\\x5d\\x49\\xf4\\x1c\\xf7\\x39\\x24\\xa1\\x5f\\xbc\\xe0\\x3d\\x11\\x17\\x79\\x62\\x96\\xb7\\xec\\x92\\x32\\xe6\\x3d\\xc6\\x49\\xfe\\xe6\\xfc\\xdb\\x19\\x39\\x8d\\xce\\x8f\\xa3\\x05\\xff\\xff\\xa8\\x3f\\xec\\x0e\\xc8\\xbf\\x85\\x4b\\xb7\\x70\\xae\\x97\\xff\\x84\\x4e\\x14\\xc0\\xf3\\x94\\x83\\x85\\x61\\xb6\\xe1\\xfa\\xd9\\xa6\\xde\\x08\\x14\\x7c\\x74\\x81\\x3e\\x85\\x4b\\xaf\\x97\\x6e\\xc6\\xe4\\x0a\\x8b\\x0b\\x2a\\x61\\xda\\x1e\\xd1\\x54\\xda\\x90\\x2d\\x8c\\xe7\\x92\\x0b\\x84\\xcb\\x61\\x59\\xe7\\xce\\x41\\xcb\\x69\\xf8\\x86\\x13\\xfe\\x96\\x73\\xc0\\xf8\\x6c\\x39\\xff\\xed\\x5f\\xc7\\xd0\\xfa\\x34\\x9a\\x5d\\x9c\\x21\\x4b\\xe9\\x99\\xe2\\xe7\\x28\\xfa\\x8f\\x6f\\xa3\\xb7\\x9c\\xbd\\xb7\\x37\\xc0\\x99\\x41\\x71\\x4b\\x2e\\xa7\\xe7\\x7c\\x98\\x1e\\x72\\x75\\xf3\\x92\\x26\\x57\\xd7\\x21\\xe9\\x83\\x73\\x66\\x50\\x3c\\x56\\xd2\\xb2\\xe7\\x09\\xff\\x7e\\x1b\\xa4\\x8e\\xfb\\x4a\\xe5\\x12\\x3c\\x4c\\xd7\\x46\\xd6\\xfa\\xee\\x7c\\x23\\xdc\\xf5\\xa9\\xee\\x0a\\xdf\\x4d\\x20\\xac\\xa9\\x35\\xdf\\x14\\x51\\x8d\\xe3\\x34\\x71\\xe5\\x4b\\x51\\x83\\x8a\\x18\\x8e\\xaa\\xf2\\x03\\x8a\\x9d\\x13\\xa1\\x53\\xdf\\x13\\xb8\\x1c\\xe7\\x21\\x7b\\xc5\\x35\\xf2\\xd5\\xa1\\x57\\x10\\xab\\x14\\xb5\\x51\\xa4\\x11\\xc6\\x4d\\x70\\xae\\x27\\xa5\\x31\\xd7\\x96\\x38\\x81\\x37\\x2e\\x7e\\xa0\\xe2\\xd0\\xf2\\xbf\\x66\\x26\\xbb\\xc4\\xef\\xd1\\x19\\x1b\\x9a\\xa4\\x4e\\xf2\\xa2\\x19\\x54\\xf9\\xe2\\xe4\\xff\\x7b\\xf0\\x47\\x4d\\xf2\\x2a\\xcd\\xe8\\xd1\\xc9\\x07\\xed\\x17\\xa0\\xed\\xd0\\x3d\\xf3\\xe1\\x38\\x36\\x39\\x99\\xd8\\x4d\\x24\\x52\\xb4\\xa0\\xea\\x47\\x50\\xf9\\xd3\\xed\\x4e\\x49\\xfb\\xfe\\x5d\\xb3\\x8d\\xce\\x39\\xf7\\x0d\\x36\\x5e\\x93\\xa1\\x52\\x69\\x63\\x49\\xd5\\xe2\\xbd\\xd1\\x61\\xeb\\x38\\xda\\x76\\x36\\x66\\x3f\\x8f\\x2f\\x8b\\x98\\xc8\\x7e\\x49\\x73\\x6e\\x3f\\xa0\\x51\\xbf\\x2d\\x52\\x69\\x43\\x5c\\xe1\\x4e\\xa1\\xc8\\xde\\x10\\xfe\\x77\\xfe\\x4f\\x09\\xa0\\x60\\x09\\x65\\x7b\\x33\\x7d\\x15\\xfd\\x8c\\x7b\\x52\\x53\\x45\\x5a\\x2f\\x1d\\x6a\\xfa\\xcd\\xb2\\xe2\\x32\\x7a\\xd5\\x51\\xdc\\x60\\x44\\x21\\xb2\\xb2\\x5e\\x94\\xd4\\xd2\\x64\\x9d\\xae\\x57\\xd1\\xab\\xce\\x46\\xe8\\x6c\\xa3\\x19\\x67\\x69\\xc9\\x6d\\xbc\\xee\\x2c\\xb8\\x42\\x15\\x88\\x93\\xd0\\x28\\x41\\xc7\\x1c\\xfa\\x6a\\xdd\\xea\\x44\\x43\\x83\\xeb\\xb6\\x09\\xfe\\x7a\\xe5\\xbe\\x5a\\x4f\\x95\\xfb\\x4b\\xba\\xbc\\x97\\xfd\\x0d\\xc9\\xfe\\x0d\\x6f\\x7b\\x70\\xe1\\x7f\\x87\\xa0\\xa3\\xba\\x04\\xbf\\x21\\xec\\x00\\xe8\\xc8\\x28\\x98\\x7f\\xf5\\x94\\x95\\xa4\\xdb\\x63\\x60\\xdf\\x12\\xd4\\x17\\x6c\\xa6\\x9a\\xf1\\x35\\x32\\x21\\x15\\x37\\x7a\\x49\\xbe\\xe3\\x96\\x4b\\x9e\\xd0\\xab\\xce\\x1a\\xc9\\xff\\x7c\\x84\\x85\\x2e\\xa2\\xdf\\x70\\x15\\xba\\xd8\\xa4\\x7f\\x8a\\x41\\x83\\x43\\x40\\xdf\\xc0\\xc2\\x57\\x7e\\xa6\\x00\\x59\\xd5\\xba\\x75\\xbd\\x5c\\x66\\x34\\x5c\\x91\\x7e\\x43\\x05\\x29\\xfa\\x46\\xda\\x78\\x30\\x39\\xf3\\xbc\\x54\\x7a\\x67\\xf5\\x1a\\xc8\\x3f\\x0d\\xd7\\x7d\\x18\\x35\\xc6\\xbc\\xaa\\x25\\x01\\xc9\\x9a\\x71\\x81\\xf3\\x04\\x11\\x36\\x42\\xc2\\xb3\\x10\\x45\\x51\\xb9\\x2e\\xea\\x2c\\x89\\x16\\x54\\x6e\\x6b\\x7c\\x36\\xa5\\xd6\\x0e\\xdc\\x52\\xb6\\xe1\\x3b\\xaf\\x90\\x02\\xef\\x16\\x18\\x79\\x12\\x99\\xfc\\x7e\\x24\\x7f\\xbb\\x24\\x73\\x0e\\xce\\xcc\\x6d\\x51\\xc2\\xee\\x7d\\xc1\\x75\\x41\\xb2\\xe0\\xfb\\xa9\\xe8\\xf1\\x66\\xfc\\x0f\\x6e\\xd8\\x92\\x33\\x74\\x06\\x57\\x0a\\xa0\\x8d\\xde\\x3f\\xd3\\xed\\xec\\xe4\\xe4\\x04\\x9a\\x04\\xd2\\xf7\\x9a\\xb0\\x52\\x0c\\xa6\\x55\\x7a\\x41\\xf3\\xe8\\xab\\xa7\\x11\\x59\\x2e\\xd3\\x9c\\x0a\\x44\\x7c\\x35\\xd8\\x48\\x6f\\xe4\\x71\\x44\\x4a\\x71\\x7e\\xc7\\xc5\\xb5\\xd8\\x45\\xf3\\x9f\\x5f\\xfc\\xa3\\xd4\\x6a\\x91\\x8a\\x57\\x5b\\x70\\x69\\x79\\xb9\\x69\\x0f\\x00\\x3d\\xa8\\x6c\\xac\\x35\\x75\\x66\\x2d\\x08\\xcd\\x81\\xef\\x99\\x33\\x5a\\x17\\x68\\x83\\x2f\\x40\\xf2\\x1b\\xc2\\xa1\\x5f\\x45\\xe7\\x97\\x45\\x94\\xa4\\x7c\\xe4\\x94\\x1c\\x25\\xc9\\xda\\x15\\xd9\\xdb\\x15\\x4d\\xe1\\x4c\\x80\\x09\\xec\\x0f\\xe1\\xa6\\x2d\\x5b\\x52\\xf5\\xd1\\x5c\\x6f\\x33\\x5e\\x04\\xc4\\x27\\xbf\\x93\\x18\\xfc\\xab\\x5b\\x92\\x06\\x18\\x0f\\x16\\x58\\xbc\\x31\\x4b\\x29\\x8e\\x28\\x80\\xa1\\x37\\x64\\xd2\\x7f\\x88\\x74\\xfe\\xf6\\xaf\\xb6\\x39\\x47\\xfc\\xd5\\x83\\xe6\\xf8\\x4a\\x10\\x03\\xdb\\x05\\x25\\x7c\\xdf\\xe8\\x42\\xd1\\xa6\\x10\\x50\\xa8\\x4d\\x20\\x25\\x00\\xb7\\x08\\x5e\\xa6\\x65\\x85\\x23\\xf2\\x1d\\xdd\\x95\\x6a\\x75\\xe3\\xab\\x67\\x9c\\x92\\x8a\\x8f\\xd1\\x80\\x95\\x0e\\x2d\\x0b\\x45\\x72\\xb1\\xf8\\x5d\\x9c\\xd5\\x14\\xd1\\x8a\\x36\\x80\\x1b\\x1f\\x2a\\x2b\\x36\\x36\\xb2\\x01\\xf7\\x0c\\x6d\\x0c\\xb1\\x26\\x8b\\x81\\x16\\x40\\xb4\\x84\\x7b\\x1d\\x64\\x0f\\x90\\x2c\\x8a\\x75\\xa2\\xbd\\x23\\x4d\\x17\\xf3\\x03\\xb1\\x21\\xab\\x41\\x71\\x4d\\x32\\x97\\x58\\x70\\x44\\x38\\xb9\\x90\\x34\\x04\\xb3\\xb1\\xa1\\x6c\\x45\\xdb\\x53\\x4d\\x31\\xad\\xe1\\xcc\\xa1\\x88\\x8a\\x9c\\x0e\\xbb\\x96\\x1a\\xba\\x91\\x5a\\x84\\x66\\x37\\xdc\\x78\\x01\\xac\\xad\\x8a\\xae\\xe1\\xa9\\xfc\\x82\\xe6\\x94\\x89\\x33\\x17\\xbe\\x16\\xac\\xa8\\xb4\\xd0\\x28\\x4b\\x63\\xd9\\x57\\x27\\x36\\x4c\\x58\\x77\\xf8\\x74\\x75\\x18\\xba\\x38\\xd8\\xfd\\xe2\\xa4\\xdb\\xd0\\x00\\xa3\\x4e\\x54\\xab\\x62\\xdb\\x6a\\x82\\x2b\\x05\\x1b\\x3a\\x4e\\x40\\xaf\\x0a\\x57\\x43\\xba\\x8d\\xe6\\xf0\\xdf\\x82\\x56\\x97\\x94\\xef\\x20\\xb8\\x1a\\x74\\xdd\\xff\\x06\\x87\\xf0\\x33\\x03\\x8c\\xad\\xea\\x06\\x60\\xfa\\xaa\\x9b\\x2e\\xdb\\xa9\\x52\\x08\\x64\\x9f\\xb0\\x4a\\xd3\\x84\\xe1\\xeb\\xed\\x11\\x14\\x27\\x46\\x97\\x54\\xb1\\x3d\\x1b\\x23\\xb8\\xf7\\xfe\\xad\\x26\\xca\\xe9\\x25\\xff\\xc7\\xd7\\x82\\x62\\x0b\\xbc\\xd8\\x0f\\x06\\xa1\\x02\\xc4\\x87\\xfc\\xc8\\x7f\\xbb\\x95\\xc0\\x3f\\x6a\\x80\\xc3\\xbb\\x82\\x8a\\xf3\\x58\\xa9\\x5c\\xff\\xf2\\xea\\xe5\\xf7\\x55\\xb5\\x95\\xe5\\xd6\\x41\\x7f\\xb5\\x66\\xc3\\x43\\x5e\\xdf\\x1b\\xcb\\x5d\\x1e\\xaf\\x59\\x91\\x17\\x75\\xc9\\xd1\\x09\\xc4\\x78\\x1e\\xd6\\x9c\\xc6\\xd7\\x2c\\x0b\\xe9\\x7a\\x5e\\x2d\\x7a\\xcb\\xff\\xa1\\x7e\\x89\\x70\\xec\\xf5\\x62\\x92\\x65\\x0b\\x12\\xbf\\x8b\\x9e\\x4b\\x85\\x1f\\x5a\\xa4\\xf9\\x45\\xf1\\x8e\\x46\\x97\\x6b\\xde\\x9d\\x0d\\xd3\\x70\\xa4\\x56\\x90\\x04\\x4d\\x34\\x31\\x30\\x14\\x7d\\x24\\xcd\\x4a\\x6f\\x5f\\x73\\x62\\x4e\\x1b\\x75\\x4b\\x61\\xe4\\xdd\\x3b\\x43\\xf9\\x74\\xe5\\x88\\x06\\xc3\\x45\\x91\\x26\\xbc\\x5b\\x7e\\x59\\xb3\\xa1\\x99\\x72\\xa3\\xc2\\xdb\\x70\\xf5\\x29\\x7a\\xf5\\xc3\\xab\\x67\\x78\\xbe\\x7d\\x0b\\x65\\x0d\\x04\\xee\\x2f\\x79\\xe7\\x54\\x6b\\xa7\\x46\\x45\\xaf\\x38\\x71\\x69\\x66\\xd7\\x19\\x79\\x61\\x48\\x78\\x97\\x1b\\xd8\\x01\\xfa\\xea\\x66\\x07\\x3a\\x07\\xbe\\x2d\\xf2\\xb2\\xe9\\x8c\\x91\\xa3\\xfc\\x9a\\x65\\xf3\\x11\\x8f\\xe3\\x60\\xc1\\x06\\x0c\\xe2\\xff\\x9c\\xff\\xf4\\x63\\xb4\\xc8\\x8a\\x85\\x4f\\xb1\\xf2\\xc8\\xf4\\xfa\\x04\\xa4\\x09\\xe7\\xf7\\x12\\x0c\\x44\\xf7\\x48\\xa3\\x8c\\x15\\x4c\\x7a\\x62\\x1a\\xa7\\x4c\\x2b\\x15\\xf8\\xd0\\x91\\x8b\\x43\\x18\\x79\\xf4\\xfd\\xf9\\xab\\x97\\x4d\\xcc\\x1c\\x57\\xba\\xc8\\x0a\\x3e\\xd8\\xb7\\xb9\\x4d\\x40\\xdc\\xdc\\x08\\xd0\\x5d\\xd1\\x87\\x8a\\xff\\x7a\\xbb\\xc0\\x60\\x19\\x7e\\x42\\xa6\\xfb\\x53\\xc9\\xe5\\xd4\\x09\\xff\\x41\\x84\\x75\\x27\\xe6\\xff\\xa0\\xa4\\x87\\x57\\x80\\x1c\\x76\\x44\\xef\\x98\\xbf\\x7d\\xeb\\xc1\\xba\\x82\\xc9\\x37\\x66\\x28\\x3e\\x97\\x6c\\x8d\\x5f\\x14\\xa2\\xb8\\xd8\\x6c\\xc8\\x83\\x92\\x02\\x5b\\xe0\\xac\\x97\\x16\\xd9\\xec\\xc9\\xfc\\xe7\\x23\\xdc\\x95\\xac\\xcb\\x43\\x5c\\x5e\\x70\\xec\\xe5\\x85\\x33\\x08\\x4e\\xeb\\x00\\xc2\\x16\\x69\\xc5\\x08\\xdb\\x45\\xf1\\x9a\\xb0\\x3e\\x2a\\x40\\xc2\\x4d\\x6d\\x56\\x82\\x95\\x90\\xa5\\x5c\\x80\\x25\\xdd\\xa4\\x71\\x91\\x71\\xa1\\x72\\x91\\x5d\\x42\\x1c\\x2e\\xbd\\xa0\\x56\\x6d\\x3f\\x09\\xa6\\x23\\xaa\\xc8\\xc2\\xc2\\xe6\\xb9\\x62\\xd3\\xaa\\xe5\\x34\\xd0\\xed\\xc0\\xcf\\x61\\x92\\xa9\\x01\\x60\\xed\\xca\\x0a\\x47\\x39\\xd4\\x3b\\x81\\xff\\x5c\\x80\\xe6\\x10\\x2b\\x6a\\x05\\x20\\xa3\\x48\\xb1\\xc2\\x09\\xfe\\x0f\\xd1\\x94\\x3a\\x1c\\x0d\\xcc\\x0f\\x10\\xbf\\xb8\\x2d\\x32\\xb4\\xf3\\x9a\\xe8\\x3b\\x1b\\xd8\\xb4\\xad\\x79\\x2a\\xdc\\x8e\\xe8\\xa6\\x3c\\x01\\xe0\\x1a\\x94\\x40\\x3c\\xbd\\xd0\\x00\\x2b\\xa2\\x1f\\xb1\\xd6\\x01\\xd0\\x01\\xcc\\xd5\\x30\\xbe\\x37\\x45\\x9d\\x27\\x07\\x40\\x27\\xa6\\xe0\\x10\\x36\\x11\\xd6\\x7d\\x00\\x74\\x6f\\x5e\\x7c\\x17\\xc1\\xe0\\x1f\\xe6\\x6f\\xb5\\x38\\x00\\xba\\xef\\xe7\\x2f\\xc3\\xd0\\x7d\\x5f\\x66\\x87\\x40\\xf7\\x24\\x14\\x5d\\x7c\\x08\\x74\\x2f\\x3f\\x27\\x9f\\x2f\\x3e\\x0f\\xc3\\xf8\\x92\\x1c\\x42\\x9e\\xd2\\xad\\x57\\x2c\\xc3\\x66\\x1f\\x3a\\xf4\\x0e\\x82\\x96\\x2f\\xb2\\xb0\\xc6\\x4a\\x87\\xe6\\x00\\xda\\x9f\\x16\\xe2\\x12\\xd3\\xde\\x78\\xbf\\x7a\\xaa\\x0e\\x1f\\x9a\\x63\\x8f\\x21\\xdc\\xe7\\xaa\\xe2\\x04\\xf4\\xe7\\x6b\\xda\\xba\\xf8\\x17\\x75\\x9a\\x55\\x0f\\xd2\\x5c\\x03\\x0e\\xc7\\x9c\\x04\\x0e\\x32\\xd3\\x21\\xc9\\x17\\x70\\xf0\\xa4\\xe1\\xd7\\x70\\x3f\\x47\\x08\\x3e\\x87\\x34\\xd9\\x15\\xb5\\x5d\\xc6\\x19\\x16\\x9d\\xca\\x2a\\x27\\xe2\\x97\\x73\\xd9\\xbf\\x58\\xfd\\xc3\\xbe\\xea\\x5f\\xf0\\x95\\x84\\x97\\x9e\\xf0\\x7f\\xfe\\x03\\x56\\x75\\x42\\x27\\xfd\\x7b\\x8e\\x51\\x2e\\xce\\x50\\x4f\\x65\\x9b\\x01\\x37\\x1b\\x69\\x4e\\x8a\\x41\\xa7\\x81\\x8e\\x22\\xb0\\x7f\\x4a\\x44\\xa4\\x84\\x70\\x1e\\xe3\\xf0\\xab\\xaf\\x1f\\x29\\x07\\x0d\\xc3\\x2e\\x93\\x40\\xda\\x3f\\x72\\xc0\\xb5\\xfd\\x34\\x4a\\x54\\x9d\\x35\\x55\\xb5\\x93\\xb3\\x19\\xce\\xa8\\xce\\x31\\xb4\\x7e\\xfd\\xc0\\x22\\x22\\xed\\x7a\\xd9\\xfc\\x87\\x68\\xcb\\xe8\\x92\\x0f\\xd4\\xa5\\xd4\\xc3\\x5a\\x1f\\x92\\xf0\\xf6\\x93\\xca\\xf8\\x33\\xaf\\x1f\\xa7\\xa5\\xe3\\xc4\\x5c\\xd0\\xf9\\x1a\\x41\\x76\\x09\\x3b\\x6e\\x1b\\xea\\xfe\\xce\\x57\\x94\\xd3\\x1a\\x8b\\x06\\x4e\\x85\\x02\\xce\\x4e\\xf8\\xce\\x06\\xb2\\xe7\\x03\\x1c\\xc8\\x49\\xbe\\xe6\\x3a\\xd1\\x02\\xd4\\x27\\x1b\\x15\\xb2\\xf2\\xe9\\x08\\x41\\xb0\\xa2\\xa8\\x2c\\xd7\\xec\\x7a\\x37\\xa7\\x78\\xa1\\xf7\\x9e\\x1d\\xdc\\x50\\x1c\\x32\\x10\\xcf\\x31\\x80\\x79\\x0b\\xbc\\x30\\xba\\x4a\\x4b\\x3e\\xc5\\xe0\\x32\\x1a\\xd9\\x70\\x0d\\x16\\x6e\\x86\\x88\\x1e\\xa1\\x5e\\xb3\\x41\\xd4\\x31\\x71\\x21\\x9d\\x30\\x4b\\x4c\\xc6\\xd5\\xcf\\x95\\xd0\\xa2\\x9d\\xc5\\x59\\x9a\\xbf\\xf3\\x14\\x7b\\xdb\\x6e\\x32\\x60\\xde\\x56\\xfc\\x7e\\xc8\\x0a\\xfc\\xef\\x9a\\x64\\x30\\xba\\x7a\\x17\\xf4\\xb8\\x4c\\x7c\\x52\\xf8\\x03\\xdb\\xed\\x66\\x50\\x4f\\x9b\\x12\\x7f\\x45\\x28\\xc8\\x86\\x18\\x6e\\x6a\\x70\\x1d\\xb1\\xfd\\xfa\\x3e\\xc8\\x56\\x92\\xa7\\xa8\\xed\\x82\\x4a\\x09\\xba\\xc3\\x9b\\x75\\x40\\x8e\\xc5\\x96\\x5c\\x30\\x2a\\x6d\\x43\\x87\\x37\\x84\\xf0\\x3a\\xfd\\x6e\\xd0\\x71\\x64\\x9c\\xf3\\xc3\\xbc\\x7d\\xfa\\xf5\\x89\\xb6\\xf6\\xb6\\x1f\\xdd\\x81\\x85\\x39\\x87\\x56\\xe3\\x25\\x3d\\x3c\\x07\\x68\\xb4\\x24\\xfb\\xc9\\x14\\xa8\\x46\\x83\\x4e\\x7a\\x27\\xcc\\xe8\\x32\\xad\\xcc\\x5b\\x7f\\x7c\\x5a\\xaf\\x30\\x2c\\x7c\\x01\\x66\\x4c\\x9e\\xd3\\xcc\\xdc\\xe0\\x2d\\xbd\\x36\\x63\\xed\\xa2\\xb0\\x6a\\x3f\\x2e\\xb4\\x65\\x81\\x4b\\xe2\\x09\\xf2\\xc1\\xb1\\xe3\\x87\\x41\\xf7\\xb8\\x9b\\xec\\xc5\\x0e\\xed\\x28\\x15\\x4f\\xd2\\x12\\x2f\\x8a\\x6d\\xb7\\x58\\x0d\\x7a\\xb1\\xa2\\x36\\xbe\\x3c\\xd4\\xb9\\x4f\\x6b\\x4c\\x02\\x1b\\x9d\\xcf\\xda\\x57\\xeb\\x38\\xc0\\xd3\\x14\\x02\\xd3\\xc6\\xcf\\xba\\x15\\x7a\\xdc\\x7e\\xcc\\x34\\xf9\\x0b\\xf6\\x38\\xb8\\x69\\xc2\\x6f\\xe8\\xb8\\x06\\xe1\\xbb\\x48\\x1b\\x21\\xf9\\xb9\\x57\\xf2\\xe5\\x24\\xc9\\x2b\\x98\\xb6\\x59\\xb2\\xe6\\xfb\\xe8\\xfa\\x38\\x2a\\x09\\x5f\\x52\\x08\\x2e\\x1d\\x25\\x4e\\x9a\\x0c\\xe2\\xe2\\x72\\xb8\\xbe\\x95\\x85\\xf6\\x57\\xe9\\xed\\xaf\\xf9\\xd4\\xfe\\x9a\\x5f\\x7b\\x7f\\xf5\\x48\\x0b\\xef\\x2f\\xff\\xaa\\x96\\x91\\x29\\xab\\xda\\xcb\\xc7\\x3d\\x98\\x36\\x66\\xb2\\x56\\xdc\\xc4\\xbe\\x52\\x09\\xf6\\x38\\xb8\\x69\\x92\\x6f\\xe8\\xb8\\x36\\xc9\\xf7\\x49\\xd3\\x24\\xbf\\xa2\\xc5\\x69\\xf4\\x82\\x16\\x27\\xfc\\x5f\\xe7\\xaf\\x1b\\xfc\\xf3\\x06\\xfe\\xee\\xd4\\x8c\\x57\\x54\\x5e\\xa1\\xde\\x14\\x5c\\x6d\\x8d\\xb6\\x85\\xd8\\xad\\xb8\\x52\\x93\\x89\\xa8\\x13\\x88\\x17\\xec\\x30\\x82\\xe1\\x4b\\xd4\\xde\\x8f\\x08\\x64\\xd6\\xd4\\x51\\xc1\\x23\\xfd\\x03\\x71\\x07\\x11\\x55\\x51\\x43\\x18\\x93\\x24\\xa2\\x9c\\x48\\x05\\x42\\xa1\\xa5\\x9b\\x0e\\xa0\\xc4\\x41\\xca\\x0f\\xa6\\x3e\\x20\\xef\\x48\\x95\\x9a\\xf1\\x70\\x1c\\x31\\x4d\\xeb\\x34\\xaa\\xea\\xb7\\x40\\x7f\\xe2\\xe5\\xec\\x32\\x2d\\x69\\xdb\\x42\\x37\\x41\\xc0\\xfd\\x17\\x06\\x49\\x53\\xce\\xa1\\x75\\xc1\\xbe\\x79\\x73\\x1c\\x9d\\x7f\\xab\\xb4\\xf3\\xd9\\x96\\x1b\\x40\\xa8\\x7d\\xc0\\x15\\x4e\\xed\\xdb\\xa3\\x5e\\xbb\\xb6\\x91\\xaa\\xaa\\x4e\\x5c\\xce\\x35\\x99\\x60\\x80\\x4d\\x77\\x3e\\x82\\xc6\\xfc\\x8a\\x6c\\x2d\\x57\\xf3\\x01\\x66\\x21\\xad\\xee\\xbf\\xa2\\xdf\\xde\\xd1\\x9d\\x1a\\xbf\\xff\\x82\\x6b\\x77\\xd1\\x7b\\xd9\\xf2\\xdc\\xd2\\x0e\\x11\\x89\\x42\\x4f\\x2d\\x22\\x5d\\x09\\x18\\xef\\x33\\x5c\\xe9\\x18\\x02\\x9d\\x9e\\xc3\\xc1\\x93\\x22\\xeb\\x5c\\x86\\x8c\\x9e\\x59\\x4c\\x2c\\x0b\\x48\\x6d\\x72\\x95\\xb4\\x77\\x1a\\x0c\\x92\\x98\\xd3\\xca\\x21\\x89\\x0e\\xad\\x50\\xcd\\x01\\x38\\x49\\xb9\\x7e\\x5b\\xc5\\x6b\\x88\\x67\\x02\\xa5\\xb2\\x6c\\xe3\\xdb\\x40\\x3b\\x91\\xa5\\x6d\\x7d\\x46\\x17\\x9c\\x85\\x59\\x85\\x59\\x05\\xe4\\x91\\x99\\xf0\\xc3\\xcb\\x2f\\x1c\\x0e\\x9a\\x1f\\x9d\\xc8\\x28\\xbd\\xfd\\x1f\\x75\\x51\\xd1\\x19\\x47\\xa2\\x2d\\x2f\\xa6\\xa6\\x0f\\x5e\\xdd\\x5e\\x14\\xc8\\x0c\\x07\\x0f\\x17\\x27\\x4a\\x4d\\x5e\\x97\\x3f\\x8e\\x12\\x3e\\x39\\x77\\x5a\\x18\\xcc\\x86\\xb0\\x77\\xba\\x59\\x08\\xde\\xfa\\xae\\x7c\\x96\\x59\\x5d\\xae\\x67\\xbd\\xa2\\xf7\\x2d\\xfa\\x46\\x5d\\x86\\x5a\\x0e\\x3d\\xba\\x65\\x09\\xdc\\xa0\\xb3\\xab\\x96\\x82\\xdc\\x11\\x78\\xee\\xcc\\xaf\\x20\\xa5\\xac\\xf1\\xfb\\x9b\\xbc\\x0a\\xdf\\x0c\\xe0\\x8e\\x10\\xc1\\x1e\\x35\\x64\\xa3\\x1b\\x04\\xa6\\xcc\\x7b\\x15\\xe0\\x14\\x80\\x9b\\x8a\\xda\\x92\\xd4\\xa9\\xff\\xde\\x4b\\xad\\x6e\\x66\\x3b\\x53\\x0c\\xe0\\x3a\\x02\\xce\\x74\\x6d\\xb5\\x02\\xb7\\x00\\x5f\\x0b\\x2f\\x28\\x5e\\x53\\x6f\\x6e\\x57\\x41\\xf4\\x2c\\x38\\x9d\\xb6\\x5b\\x56\\x6c\\x59\\x0a\\x0e\\x12\\x69\\xb5\\x26\\x02\\x84\\x75\\x01\\x92\\x6e\\xfb\\x59\\x32\\xe2\\x62\\x11\\xa0\\x91\\x2e\\x8a\\x72\\xb7\\x59\\x14\\x99\\x15\\x30\\x96\\x84\\xe5\\x5d\\xf8\\x65\\xcd\\x9c\\x12\\x78\\x41\\x2b\\x38\\x5c\\xe1\\x13\\xb7\\x39\\x8f\\x5a\\x53\\x92\\xd8\\x4f\\x59\\x44\\x49\\x48\\xa4\\x9f\\x16\\xfe\\x09\\x46\\xa3\\x66\\x3e\\xd9\\x91\\x60\\x3b\\x03\\x8a\\xf4\\x20\\xc1\\x34\\x8d\\x7e\\x84\\xff\\x38\\x20\\xd1\\xac\\x17\\x62\\x0a\\x9d\\xe6\\x55\\x14\\x0c\\x73\\xd9\\x66\\xb2\\xdb\\x72\\xa6\\x5c\\x3f\\x1b\\xa5\\x9f\\x0d\\xd5\\x5a\\x14\\x6b\\x17\\x5f\\x44\\xab\\x06\\x4e\\x30\\xf3\\xc7\\x91\\xdc\\xd0\\x1a\\x59\\x84\\x1d\\xa4\\x6a\\xe3\\x04\\x4f\\x93\\xcf\\x1d\\x86\\x3f\\x1c\\xe7\\x9e\\xe3\\x1c\\x0e\\x1d\\x24\\x2a\\x07\\x47\\x1f\\xac\\x8d\\x97\\xd1\\x9d\\xd7\\x80\\x6d\\xfc\\x7d\\xd6\\x03\\x70\\xbb\\xd8\\xf1\\xcc\\xfc\\x7c\\xad\\x9f\\xa0\\x7b\\xa1\\x3c\\xf4\\xae\\x76\\x6e\\x49\\xf7\\x05\\xad\\xc8\\x6f\\xf4\\x1f\\xae\\x2a\\x26\\xe2\\x52\\xd5\\x56\\xe2\\x17\\x87\\xbf\\xcd\\xc2\\x24\\x63\\x9f\\x79\\x2d\\x88\\x0d\\x71\\xa7\\xb3\\x68\\x4f\\x8d\\x43\\x7a\\xe8\\x40\\xf8\\x6d\\xd2\\x39\\xf2\\xc4\\xaa\\xf5\\x36\\x06\\x7b\\x07\\x1f\\x92\\x3a\\xdf\\xc4\\x3b\\x0f\\xed\\x09\\x12\\xca\\xbc\\xd2\\x45\\x3d\\x02\\x08\\x9e\\x9b\\x3f\\x94\\x65\\x4d\\x3b\\x21\\x05\\x75\\x63\\x54\\xbd\\x78\\x76\\x0e\\x89\\x7d\\xd6\\x45\\xf2\\x49\\x9f\\xd3\\xa0\\x28\\x06\\xfe\\x25\\x2e\\x36\\xdb\\x8c\\x2a\\x0f\\x60\\x2f\\x16\\xe2\\xa1\\x66\\x46\\x55\\xb3\\xa9\\xa1\\x88\\xe1\\x3c\\xbd\\xfe\\x69\\xde\\x67\\x4a\\xbb\\xbf\\x51\\x94\\x01\\x31\\x89\\x63\\x11\\x78\\xc6\\xc8\\x5e\\xd2\\xb3\\x0d\\x8e\\xc3\\xc6\\xd1\\x1e\\x90\\x53\\x1c\\xdc\\x4f\\xe1\\x3f\\xb8\\x85\\xc3\\xe5\\x1c\\x21\\xdf\\x69\\xee\\x5e\\x12\\xaf\\x4d\\x48\\xda\\xb5\\xc4\\x83\\x47\\xbf\\xa2\\xc8\\xc0\\xcc\\x4c\\x4b\\x8b\\xd0\\x5a\\x35\\xc0\\x3d\\x08\\x4b\\x0a\\x31\\x07\\x41\\x83\\x70\\x3c\\x1e\\x4f\\x0f\\x89\\x9a\\xa0\\xfd\\xc2\\x2f\\x71\\xbc\\x26\\x16\\xab\\x77\\xf4\\x06\\x3a\\x49\\x90\\x73\\x5d\\x11\\xe2\\xb7\\x4d\\x7c\\xb7\\x69\\x7a\\x98\\x92\\xbf\\xce\\xe9\\xf2\\x78\\xc1\\x0d\\x8e\\x6e\\x3f\\x1c\\x43\\xb2\\xae\\xb4\\x02\\x57\\x90\\x54\\xf0\\xb2\\x1d\\xe7\\xe7\\xc1\\x12\\x3d\\xc0\\xb6\\x19\\x43\\x00\\xc8\\xcc\\xbf\\x2b\\xbc\\x91\\x87\\x87\\xe0\\x19\\x52\\xb6\\xa1\\x08\\xcf\\x8b\\x29\\x38\\xbe\\xd0\\x1c\\xf5\\xde\\x2e\\x44\\x1d\\xee\\x59\\x0e\\x0a\\x27\\x6a\\xe4\\xb0\\x67\\x57\\x15\\x91\\xc9\\x1d\\x35\\x98\\xfd\\xa6\\x4d\\xa1\\xde\\x45\\xaa\\x71\\x21\\x70\\xdb\\x18\\xc3\\xa0\\x5e\\x97\\x5d\\xdb\\xbb\\x5d\\x7d\\xd6\\xbb\\x5e\\xdd\\x09\\xe1\\x73\\x1a\\xe7\\xe5\\x85\\xd3\\xc6\\x6b\\x63\\xdf\\x12\\x9a\\xa5\\x9b\\xd4\\x88\\xb9\\xf3\\x89\\xeb\\xa6\\x43\\x20\\xc3\\x82\\xa1\\x5b\\x95\\xb6\\x3d\\x59\\x1c\\x56\\x31\\x1e\\x37\\xf1\\x88\\x4f\\xa5\\x58\\x58\\x79\\xaa\\x95\\xf7\\x3c\\xd7\\x22\\x36\\xb1\\xb1\\x00\\xc4\\xf5\\x63\\x25\\x52\\x26\\x72\\x45\\x41\\x24\\x20\\xf4\\xf5\\x49\\xf4\\x1c\\xee\\x99\\x5e\\x11\\x98\\xb7\\xc7\\xe2\\xd2\\x2a\\xdc\\x5b\\x96\\x72\\x6f\\x03\\x10\\x17\\xbb\\xe8\\xd3\\xff\\xf9\\xf4\\x58\\x18\\x81\\xe0\\x73\\xe0\\x4c\\xf2\\x65\\x83\\x61\\x90\\x24\\x89\\x2b\\xf0\\xd4\\xf0\\x45\\x48\\x27\\xec\\x82\\x97\\x26\\xbc\\xbf\\xff\\x23\\x4a\\xbe\\x3e\\xe1\\x1f\\x66\\x08\\xe0\\x53\\xb8\\x3f\\xf0\\x70\\x9b\\x91\\x34\\xff\\xf4\\xe8\\x91\\xb5\\x53\\x75\\xf7\\x69\\xcb\\x90\\xaf\\xff\\x25\\x9d\\x68\\xf9\\xc9\\xcb\\x56\\x2d\\x61\\x96\\xa1\\x50\\xe4\\x90\\xcf\\xca\\x65\\x1c\\xce\\x1a\\x70\\x5a\\x9f\\xb6\\x4d\\xf4\\x10\\x8f\\xfd\\xfa\\x7d\\x20\\xea\\x55\\x5c\\x21\\xd7\\xa7\\x83\\xc0\\x24\\x2f\\x61\\xca\\xab\\xa0\\xed\\x4e\\x22\\xcd\\x6c\\x56\\x5c\\x7a\\xe3\\x85\\x25\\x90\\x16\\xaa\\x88\\x0d\\xd1\\xe0\\xab\\x61\\xd0\\x6f\\xdb\\xa4\\x69\\x80\\xcd\\xa6\\x48\\xd2\\xe5\\x2e\\x02\\x47\\x13\\x0c\\x08\\x71\\xbd\\x15\\xef\\xde\\x71\\x0a\\xac\\x1a\\x2f\\xc0\\x9c\\x95\\x32\\xf2\\xb0\\xb9\\xfc\\x2e\\x41\\x62\\xa8\\x70\\x71\\xe9\\x5f\\x64\\x82\\x2e\\xdd\\xbb\\x24\\x26\\x6e\\x56\\x73\\xd8\\xab\\xbc\\x60\\x1f\\x40\\x68\\x06\\xe7\\x6f\\x8a\\xcb\\xd2\\xc9\\xbd\\xc6\\x7c\\x93\\x0b\\x61\\x5c\\x06\\x8b\\xe7\\x32\\xf2\\x49\\xbb\\x54\\x2e\\xaf\\x92\\x23\\xf3\\x7d\\xa1\\x78\\xf9\\xe5\\xc4\\x94\\x6d\\x82\\x08\\xe9\\x68\\x8c\\xac\\x70\\x6c\\x0c\\xcb\\xb0\\x28\\x80\\xd2\\xba\\xae\\x43\\x9c\\x80\\x5a\\xfc\\xce\\xf9\\xb7\\xfd\\x2c\\xac\\xc7\\x82\\x26\\x74\\xd3\\x6b\\x1b\\x09\\xa4\\x48\\xe8\\x39\\x71\\x03\\x9c\\x69\\x76\\x9f\\x93\\x10\\x75\\x87\\x92\\xe1\\x66\\x6a\\x57\\x69\\xf6\\xca\\x73\\x77\\x2f\\xfa\\x40\\x03\\x2b\\xe8\\x40\\x7b\\x05\\xa7\\x28\\x22\\xf0\\xd1\\xdd\\x44\\xcf\\x4a\\x1d\\x67\\xa4\\xe4\\x36\\xff\\x90\\x1c\\x7a\\x99\\x71\\x6f\\xa9\\x20\\x90\\x9d\\x69\\x92\\x28\\xab\\x5d\\xd6\\x73\\x1c\\xed\\x35\\x1e\\x20\\x48\\x2e\\xe5\\x8b\\x46\\x05\\x67\\x23\\xb6\\xe4\\xd6\\x07\\x95\\xcc\\x78\\x6c\\xc8\\xf1\\x34\\x61\\xc9\\xf5\\x7b\\x37\\x24\\xaf\\xfe\\xc9\\xcf\\x2d\\x1c\\x34\\x8a\\x99\\x69\\xa2\\xb0\\x5d\\x13\\x75\\xb9\\x72\\x67\\xc1\\xec\\x1e\\x8a\\x41\\x9d\\x52\\x11\\x2d\\xf8\\x31\\x50\\x4a\\xb6\\x5b\\x8b\\x8f\\xc1\\x1c\\x5c\\x3e\\xaa\\x64\\x62\\x94\\x43\\xd0\\xd5\\x92\\x25\\x32\\x71\\x79\\xc9\\x3a\\x8e\\x16\\x94\\xef\\x63\\xa1\\x64\\x0a\\x88\\xcf\\x46\\x12\\x3b\\x12\\x89\\x8d\\xbe\\xb1\\x28\\xaf\\x95\\x8f\\xc3\\x11\\xa3\\x75\\x16\\xa3\\x9b\\xe2\\x82\\xaa\\xb3\\x6a\\x47\\x7d\\x7c\\x90\\xc3\\x38\\xcf\\xd6\\xc6\\xa1\\x20\\xa3\\xdb\\xdd\\xdf\\xbc\\x95\\x81\\x13\\x65\\x8f\\x4e\\x23\\xf7\\xb1\\x8c\\x3f\\x38\\x6b\\xea\\xbd\\xf5\\xa8\\xa8\\xff\\x7e\\xbb\\x4d\\xe0\\x8a\\x4d\\x43\\xe6\\x5b\\x33\\xa4\\x40\\xc3\\x7b\\x60\\xd0\\x33\\x33\\x9f\\xd8\\xfb\\xae\\x0c\\xea\\xcd\\x90\\xbb\\x4f\\x9c\\x59\\x94\\x7a\\x62\\xaf\\x7f\\x94\\x5c\\xa0\\x75\\x2e\\x0f\\x25\\xe4\\x59\\x85\\xb0\\xd2\\xda\\x53\\xc7\\xae\\x2f\\xab\\x39\\x86\\xa0\\x50\\x01\\x4c\\x48\\x13\\x49\\x93\\xe0\\x48\\xc4\\x6f\\xf3\\x36\\x12\\xdb\\x89\\x59\\xf3\\x6d\\x8e\\xd7\\xec\\x00\\xc1\\xd3\\xaf\\x4f\\x1a\\xde\\x4f\\x90\\x1a\\xe1\\x40\\x3a\\x16\\x5e\\x1d\\xe9\\x17\\x4b\\x0a\\xae\\xf5\\xe6\\x45\\x85\\xfe\\x28\\x91\\xe0\\xf3\\xf7\\x22\\xcd\\xb9\\x72\\x85\\x79\\x93\\xeb\\xd2\\xc4\\xd0\\x6b\\x40\\x73\\x65\\x2a\\xd3\\xab\\x54\\x8b\\x3f\\x2f\\x8f\\x7a\\xd4\\xe9\\x27\\x30\\x65\\xf7\\x08\\x86\\x4b\\x6a\\x41\\x5b\\x09\\xb8\\x59\\x86\\xd9\\x03\\x36\\xc4\\x16\\x35\\x38\\xe0\\xd4\\xc4\\xb2\\x65\\xf4\\x22\\x85\\xb4\\x12\\xd8\\x87\\x51\\x12\\x11\\x99\\x02\\x5a\\x9d\\x4b\\xe2\\x90\\x89\\xd2\\xe3\\x36\\xcc\\x11\\x25\\x82\\x76\\xeb\\x55\\x05\\xf7\\x20\\xf4\\xda\\x4f\\x7f\\x7a\\x65\\x62\\x50\\xd2\\xef\\xb2\\x90\\x62\\xbb\\xf6\\x34\\x09\\x4e\\x56\\x91\\x85\\x76\\x68\\x40\\x37\\x9c\\x44\\x8f\\xf9\\x60\\xcd\\x64\\x90\\x31\\xa7\\x21\\xcb\\x7a\\x32\\xe6\\x2d\\x64\\x42\\x97\\x76\\x30\\x01\\x36\\x8e\\x42\\x65\\x48\\x89\\xd6\\x04\\xfa\\x21\\xa2\\xcb\\x25\\xa4\\x10\\x2c\\x72\\x99\\xc2\\x91\\xb3\\x66\\xca\\xfd\\xe1\\xd0\\x4c\\x7e\\xeb\\x59\\x71\\x86\\x66\\xd1\\xd4\\x39\\x61\\x46\\x98\\x71\\x06\\xe0\\x91\\x16\\xb3\\xbb\\xcb\\x8f\\x7e\\x88\\x97\\xe0\\x94\\x54\\x9c\\x2f\\x94\\x93\\x09\\xcc\\x43\\xed\\x4d\\x9a\\xf0\\x2e\\x7b\\x3b\\xb1\\x53\\xf4\\x8b\\x22\\x4d\\x6f\\xf0\\xe9\\xa1\\x7c\\x5f\\xe2\\xe9\\xa4\\xbc\\xc8\\x1f\\xe0\\xe0\\x54\\x29\\xd6\\xa4\\xa7\\xbb\\x61\\xb9\\xc7\\x30\\x0e\\x4a\\x78\\xde\\x01\\xaf\\x29\\x65\\xd9\\x0e\\xc6\\xff\\xb2\\xce\\x78\\x87\\x82\\x7f\\x78\\x19\\xed\\x8a\\x3a\\x7a\\x97\\x17\\x97\\x5d\\x38\\x2a\\x84\\xb1\\x04\\x8f\\x5a\\x0c\\xae\\x64\\xc8\\x94\\xe5\\x58\\xd6\\xfa\\xc7\\xcc\\xe7\\xf6\\x55\\x7b\\x99\\x66\\x95\\x2d\\x7e\\x4b\\xfe\\xd9\\xb7\\xc1\\x36\\x61\\x5d\\x30\\x74\\x1e\\xb3\\xd5\\xd9\\xa9\\x6b\\x06\\xf4\\xd4\\x00\\x05\\xbe\\x55\\x4b\\x7c\\x4d\\x3a\\x76\\x28\\x17\\x58\\x73\\x36\\x78\\xaa\\x5e\\x05\\x42\\x65\\xa0\\xb3\\x75\\xcb\\x9b\\x16\\xab\\xd2\\xf4\\x8b\\xf5\\x0a\\x9c\\x3a\\x02\\xac\\x44\\x33\\xf8\\xef\\x00\\xfa\\xc6\\x70\\x18\\xd8\\x60\\x8a\\xd1\\xc0\\x20\\xb1\\x41\\x38\\xe0\\x4a\\xdc\\xf2\\x91\\x4d\\xdb\\x87\\x6c\\xc2\\x94\\x6d\\xf7\\x35\\xaa\\xaa\\xa8\\x48\\xa6\\xe5\\xc7\\x6c\\x52\\x76\\xca\\xb9\\xa0\\x36\\x06\\xcb\\x9c\\xd0\\x8f\\x0b\\xd3\\x3f\\xe9\\x4c\\x8b\\xc3\\x73\\x20\\x9e\\x43\\x66\\x2d\\x70\\x47\\xb7\\xa1\\x7f\\xcd\\x94\\xec\\x23\\xd2\\x42\\x02\\x4b\\xf1\\x50\\x0e\\xa4\\x9d\\xe3\\x5b\\x8c\\xbc\\x5c\\xaf\\xd6\\xa5\\x63\\x0d\\x03\\xbd\\x8a\\xe9\\xb6\\xcd\\xac\\x05\\x51\\xfb\\xe9\\x06\\x82\\xdd\\xca\\x4d\\x51\\x54\\x6b\\x98\\x79\\x17\\x70\\x3e\\x02\\x7e\\x6e\\x5e\\x63\\xad\\x9e\\x68\\xe1\\xd6\\x48\\xb6\\x13\\x0e\\xc1\\xb2\\x22\\x7c\\xb2\\xe6\\x94\\x6f\\xaa\\xd9\\xce\\x1e\\x72\\x3c\\x2a\\x70\\xd1\\x10\\x81\\x3c\\x6a\\xa2\\xc3\\x92\\xee\\xe6\\x71\\x35\\x43\\xcc\\x37\\xd2\\x15\\xad\\xc1\\x56\\x9b\\xb3\\xd7\\x81\\xd7\\xb6\\x14\\x59\\x13\\xf8\\x97\\xb4\\x84\\x7e\\x68\\x22\\x08\\x2f\\xd7\\x29\\x17\\x32\\x6c\\xd5\\xb0\\x82\\x2b\\xd5\\x03\\x72\\x72\\xc2\\xba\\xde\\x66\\x99\\x15\\xd7\\x88\\x34\\x0c\\xe8\\x10\\xc4\\x47\\x73\\x8e\\xb1\\x4c\\x66\\x7d\\x95\\x0a\\x21\\x4d\\x51\\xdc\\x70\\x16\\xb1\\xc2\\x38\\xef\\x63\\x19\\xfb\\x0d\\x9f\\x38\\x35\\x7f\\x52\\x26\\xaf\\xfa\\x8b\\x03\\x98\\x24\\x85\\x5c\\xcd\\x3a\\xf8\\x35\\x4d\\x59\\x1b\\x25\\x8e\\x69\\x66\\xed\\xa3\\x11\\x4e\\xe2\\x5a\\x3e\\x41\\x83\\xd6\\x9e\\xbd\\xe9\\x24\\xaf\\x37\\xe6\\x8e\\x73\\xc2\\x3c\\x10\\xd6\\x4f\\xa9\\xf7\\x9a\\xec\\x94\\x26\\x29\\x47\\x59\\xe3\\x31\\x9c\\xbc\\x7f\\xd9\\xfc\\x59\\xa4\\xc3\\xed\\xbc\\xcc\\xd7\\xbf\\xb5\\x28\\xb9\\x69\\x36\\x18\\xfa\\x47\\x9d\\x72\\x59\\xc8\\x67\\xeb\\x60\\xd1\\x84\\x61\\x80\\x8c\\x1d\\xc1\\x3e\\x83\\x18\\xa0\\x3b\\x20\\x56\\x3d\\x63\\x94\\x24\\x3b\\x99\\xa6\\x9a\\x73\\x59\\x57\\x38\\x4f\\xf4\\x91\\x41\\xe0\\xd8\\xd1\\x2a\\x2c\\x44\\xec\\x30\\xa1\\x02\\xd6\\x0f\\xff\\x4e\\x6a\\x99\\xd4\\x2a\\xe6\\xbe\\x19\\xe5\\xc0\\x2d\\x98\\x68\\xfa\\x34\\x56\\x27\\x3d\\x00\\xd3\\x4a\\x75\\x8e\\xef\\x86\\x7d\\xf3\\xac\\x7d\\x2d\\x4d\\x20\\xfe\\x56\\xf0\\xf1\\xcc\\xef\\x4c\\x6e\\x5f\\xb1\\x53\\xcd\\x8d\\xeb\\xa1\\xd1\\x5f\\x6e\\x47\\xf4\\x33\\xf8\\xd8\\xf1\\x46\\xff\\x75\\x87\\x9c\\x1a\\xa1\\x8e\\xc5\\xfd\\xbc\\x01\\xd3\\x9c\\xa5\\x56\\x4f\\xc2\\xd9\\xad\\xf2\\x6b\\xec\\x43\\x8d\\xd6\\x61\\xea\\xe1\\xd1\\xfe\\xcb\\x89\\xa3\\x1d\\x1d\\xdd\\x19\\x23\\xa7\\x87\\x20\\xfa\\x51\\x47\\x35\\x3b\\x8d\\x5c\\xca\\x59\\x6f\\xc4\\x77\\x4f\\x2a\\xfb\\xe5\\x8f\\x3a\\x8a\\x81\\xc2\\x1a\\x12\\xa4\\xdf\\x05\\xd5\\x4e\\x4f\\x03\\xc5\\xd0\\x1c\\xed\\xab\\xa4\\xb6\\x99\\xde\\x99\\xba\\x68\\xf6\\x34\\xeb\\xa0\\x87\\xa5\\x1a\\x61\\x0f\\x39\\x9d\\xb8\\xe9\\xe4\\xa9\\xe2\\x22\\xdc\\xa0\\xbb\\x25\\xda\\x64\\x68\\x40\\x00\\x90\\x35\\xf4\\xbf\\xa8\\xf0\\x76\\x6b\\x3c\\x6a\\xb7\\x75\\x5a\\x52\\x95\\xad\\xd5\\xe8\\xa9\\x3e\\xa0\\x5d\\x60\\x33\\xb8\\x7a\\x63\\xce\\x18\\x87\\xfa\\xda\\xcc\\xf7\\x6e\\x46\\x53\\xd8\\xb4\\xfe\\x0b\\x52\\x3f\\xb7\\xfb\\x35\\x40\\xfa\\x52\\xe5\\x89\\xfb\\xaa\\xbd\\xb3\\xd4\\x6c\\xda\\x7d\\x08\\x3f\\x8b\\x4c\\xcc\\x93\\x61\\xb0\\x22\\xcb\\xea\\xed\\x4c\\xfc\\x0a\\xe5\\x48\\x4c\\xe6\\x2e\\xa0\\x0d\\xd9\\xce\\x34\\x81\\xca\\x77\\x73\\x20\\x3a\\xe0\\xcc\\x7a\\x09\\x44\\x25\\x5f\\xee\\xb4\\x91\\x50\\x55\\x07\\x2a\\xaf\\x9d\\xf3\\xaa\\x08\\xd9\\xaa\\xaa\\xdd\\x21\\xed\\xee\\xee\\xc6\\xa6\\xf4\\xc0\\xec\\xc2\\x5a\\x93\\x72\\xa6\\xc1\\xb3\\x9d\\x17\\x42\\xf4\\x6c\\xb7\\x8a\\x66\\xb8\\x96\\xdd\\xc2\\xe6\\x54\\xe8\\xbc\\x5b\\x4d\\x78\\x74\\x87\\x30\\x61\\xae\\x70\\x6b\\x8e\\x70\\x99\\x92\\xdb\\x74\\x76\\x2a\\x31\\x8b\\xeb\\x5f\\x9a\\xb4\\xf4\\x4a\\x7c\\x39\\x7f\\x06\\x76\\x23\\x68\\xc2\\xbc\\xef\\xed\\xd4\\x6a\\xb1\\x39\\xdd\\x83\\x2f\\x5c\\x7d\\x67\\x36\\x6a\\x4d\\xe3\\xc8\\x27\\x77\\x71\\x87\\xcc\\x90\\xbb\\x26\\xaa\\x1e\\x70\\x92\\x24\\x33\\xaf\\x28\\x7d\\x8d\\x5b\\x69\\xf5\\x25\\x69\\x48\\xa3\\x7b\\xed\\xe2\\x9a\\xa5\\x20\\x73\\xc2\\xb8\\x03\\xc2\\x7a\\xd7\\x2b\\xc1\\x8a\\x94\\xb9\\x63\\x40\\x51\\x66\\x7a\\x52\\x99\\x52\\xb8\\x3e\\xb9\\xe1\\x01\\xc1\\x07\\x19\\x5c\\xc6\\x13\\x0f\\x27\\x74\\x34\\xf0\\xbe\\xa5\\x84\\xaf\\x87\\x81\\x53\\x8b\\xd3\\x27\\xdc\\x74\\x1d\\x9f\\xb6\\x4a\\x45\\x9d\\x44\\xdb\\x92\\xd6\\x49\\xd1\\xc5\\xd9\\x07\\x97\\xd0\\x8b\\x54\\xdc\\x25\\x3f\\x6f\\xa2\\xaf\\xc0\\xd6\\x4c\\x08\\x4b\\xda\\x42\\xbb\\xb2\\x0b\\x74\\xcf\\x80\\x1e\\xed\\x06\\x5e\\xd3\\x44\\xbf\\x86\\xd7\\xdf\\x69\\x0f\\x27\\xbe\\xac\\x58\\x3d\\xf8\\x58\\x45\\xc8\\x69\\xff\\xf1\\x56\\x48\\x31\\x8f\\x7e\\x60\\x97\\x69\\xfe\\xe0\\x7b\\x70\\x88\\x86\\x8a\\x31\\x2e\\x6a\\x6e\\x44\\x01\\xcf\\xad\\xa3\\x06\\xf6\\x23\\x30\\x36\\xc0\\xbc\\x52\\xef\\x9c\\xd8\\x73\\x45\\x01\\xbe\\xef\\xd1\\xf7\\x06\\x60\\xbc\\x6c\\xca\\x09\\xf9\\xf0\\xa1\\xee\\x7b\\xd1\\xe7\\xa8\\x7c\\x93\\xbf\\x2d\\xd5\\x35\\x28\\x73\\x1a\\x5b\\x6b\\xc1\\x4f\\x22\\xb3\\x2a\\xd8\\xb2\\xe1\\xcc\\xda\\xc2\\x86\\x50\\x5b\\x62\\x15\\x4b\\xfd\\x90\\xed\\xda\\x05\\xca\\xc8\\x78\\x83\\xd7\\x5d\\xed\\xe4\\x89\\x92\\x40\\xda\\x44\\xe5\\x03\\x12\\x66\\x8b\\x68\\x42\\x54\\x01\\x51\\x2c\\xbd\\x7a\\x46\\x6c\\x86\\x97\\x95\\x90\\xe0\\x8c\\x49\\x0c\\x22\\xf4\\x6e\\x74\\xd3\\x28\\x89\\x58\\x83\\x7a\\x0e\\x22\\x12\\x7b\\xb8\\xcd\\x35\\x4a\\x69\\x1c\\x42\\x43\\x0e\\xa6\\x7b\\xbd\\xf5\\x52\\xea\\x20\\xc6\\x38\\xd7\\x5d\\x88\\x5d\\xcf\\xf3\\xc3\\xea\\xa6\\x1c\\x40\\xf8\\x14\\x86\\xee\\x02\\x52\\xfe\\xb0\\x6e\\xcb\\xee\\x61\\x87\\x32\\x7b\\xfb\\x7d\\xd9\\x3b\\xe3\\xd1\\xd0\\xea\\x8e\\xa8\\xe6\\xb1\\x1c\\x70\\xc3\\x75\\x7c\\x6e\\x8d\\xeb\\x54\\x99\\xd4\\xb6\\x04\\x1d\\x08\\xd6\\x82\\xa8\\x09\\x27\\x96\\x4d\\x5b\\x0b\\x6d\\xde\\x04\\x79\\x22\\xb6\\x7e\\xdb\\x87\\xfd\\x41\\xd2\\x33\\xea\\xfd\\x83\\x6a\\x98\\x77\\x2d\\xff\\x16\\xb7\\xf2\\xc7\\x70\\xa4\\xe4\\xf5\\x23\\x6f\\xd7\\x0a\\xaf\\x90\\x9c\\x06\\x71\\x23\\x5b\\x9d\\x46\\xf8\\x9c\\xfc\\x39\\xa6\\x2c\\xf0\\x8f\\xda\\xb0\\xc1\\xd4\\xbc\\x30\\xd3\\xb8\\x5c\\xf7\\x18\\x53\\x8f\\xb3\\x5e\\x58\\x94\\x0d\\xb9\\x4e\\x40\\xd9\\x39\\xb3\\xd4\\x46\\x94\\x63\\x3c\\xdd\\xad\\x81\\xd4\\x7b\\x55\\x6e\\xc2\\xa8\\x2a\\xdb\\xf7\\x89\\x72\\x6d\\x7c\\x95\\xd3\\x06\\x58\\xd9\\x19\\x61\\xde\\x05\\xea\\x7d\\xe7\\x1b\\x9c\\x03\\x86\\x76\\x3e\\xdc\\xca\\xda\\xe0\\x9b\\xb1\\x15\\xc5\\x1b\\x3f\\x70\\x0d\\xc4\\x94\\x4d\\x47\\xe1\\xd3\\x83\\x1e\\x0c\\xb7\\xb7\\x0d\\x7a\\xa5\\xad\\xc4\\x70\\xb4\\x22\\xce\\x9c\\xba\\xa3\\x1a\\x8f\\xaa\\xe1\\x00\\x05\\x37\\x09\\x47\\xe4\\x86\\x0d\\xb8\\x54\\xab\\xb5\\x60\\x8e\\x36\\x7a\\x63\\x9e\\x6e\\xd2\\x8c\\x60\\x80\\x7e\\x27\\x92\\x00\\xe8\\x3f\\xb1\\x00\\xb3\\xc1\\x57\\xdd\\xab\\x1d\\xac\\xda\\x02\\x5b\\x84\\xd4\\x12\\x97\\x78\\x6c\\x90\\x15\\xc9\\x7b\\x8b\\xc7\\x0a\\x5c\\xc6\\xba\\x78\\xc4\\x63\\x69\\x66\\x1b\\x89\\xb6\\x13\\xe5\\xc9\\x4a\\x8f\\x63\\xfc\\x3d\\x4e\\x92\\xce\\xfd\\x30\\x3c\\x20\\x6d\\x35\\x69\\x71\\x47\\xec\\x38\\x2a\\xeb\\x2d\\xa8\\xdb\\x20\\xa0\\x4f\\xf1\\xc5\\x22\\xb8\\x43\\xc3\\xed\\x81\\x4f\\x41\\x34\\x36\\xb8\\x9f\\xa2\\x62\\xce\\xea\\x6d\\xf5\\xa9\\x04\\x22\\x42\\x7a\\x1a\\x44\\xea\\xc4\\xaf\\xd7\\x7d\\x70\\x16\\x77\\x91\\x26\\x35\\xc9\\x6c\\x70\\x8d\\xb1\\xdf\\x92\\x3a\\x72\\x54\\x89\\x64\\x05\\xf0\\x1f\\xf4\\x93\\xc1\\x30\\x1f\\xbf\\x82\\xdf\\xf6\\xee\\x17\\x61\\xd4\\xe0\\xdc\\x06\\x1c\\xc6\\x89\\xc6\\xb9\\x8d\\xa6\\xde\\x05\\xb9\\xf3\\xee\\x55\\xba\\x01\\x99\\x68\\x02\\xb0\\x4e\\xf8\\x41\\x99\\x58\\x06\\xda\\xe4\\x08\\x81\\xe0\\x45\\x51\\xd7\\x0e\\x85\\x1d\\xe8\\x6a\\x27\\x73\\x61\\x76\\x1c\\x40\\xd6\\x64\\x98\\x2e\\x00\\xa0\\xdb\\x9f\\xc3\\x03\\x5c\\x86\\x76\\x8c\\x8f\\x72\\x89\\xe4\\x32\\x82\\xa1\\x4e\\xea\\x36\\xe5\\xb1\\x35\\x12\\x2a\\x7b\\x18\\x44\\x43\\xe0\\x60\\x88\\xc6\\xe9\\xe2\\xb6\\x08\\x71\\xd1\\x93\\x58\\x10\\x66\\x3c\\x88\\xba\\x7d\\x32\\xbb\\xfe\\xf3\\xc0\\xfe\\xb5\\xc8\\x41\\xa4\\x94\\xe6\\xf6\\x68\\x3f\\x49\\xb4\\x07\\xae\\x3d\\xcc\\x08\\x09\\x1e\\xa9\\x7f\\x68\\xf5\\xfd\\x03\\xb9\\x8d\\x6d\\x09\\xb4\\x7d\\xa4\\xaf\\xd3\\xd1\\x40\\x3b\\x58\\xeb\\xf9\\x28\\xfa\\xa2\\x30\\x4f\\x49\\xc9\\x99\\xa4\\x73\\xd1\\xb8\\xf0\\x9d\\x49\\xbe\\x7d\\x98\\x8c\\x46\\x3d\\x34\\x3d\\x2c\\x46\\xb6\\xa8\\x20\\x1e\\x7a\\x91\\x4a\\xc3\\xa9\\xa7\\x1e\\x3e\\x84\\x27\\x1d\\x6c\\x4e\\x1e\\x08\\x92\\xf1\\xb9\\x77\\xba\\xe5\\xf0\\x53\\x52\\xbe\\xd7\\x26\\x72\\x80\\xf1\\x15\\xa3\\xdb\\x4b\\x9b\\x34\\xaf\\xe1\\xe4\\xcc\\x5e\\xba\\x2e\\x6a\\xe6\\x2a\\x4b\\xc8\\xce\\x55\\xc4\\xc7\\xf9\\x3b\\x57\\x59\\x59\\xe7\\x9e\\x96\\x9b\\xc2\\x57\\x5a\\xf1\\x3d\\xc6\\x8b\\x36\\xc9\\xbd\\x15\\xaa\\x75\\xcd\\x7c\\xe5\\x4b\\x96\\x7a\\x4a\\x31\\xf3\\xa8\\x9f\\xf6\\x6a\\xed\\x2a\\xdc\\x51\\xd2\\x91\\xa4\\xa5\\x8b\\x4a\\x4c\\xa2\\xbe\\xa2\\xb6\\x0e\\xb2\\x97\\x41\\xf7\\xd8\\x4b\\x38\\x99\\xf6\\x02\\xe8\\x1a\\x07\\x22\\x20\\xdf\\x5e\\x04\\xc4\\xb7\\x25\\x96\\xee\\x74\\x42\\x74\\x96\\xc9\\xae\\x74\\x11\\x29\\x3b\\xd2\\xd1\\x56\\x76\\xa3\\xbd\\x54\\x74\\xa2\\xbd\\x4c\\x75\\xa1\\xa3\\x25\\x5e\\x84\\x1c\\x61\\x96\\xf4\\xae\\x73\\x63\\x8a\\x6c\\x11\\xc9\\xa6\\xee\\x9c\\x32\\xed\\xd2\\xaf\\xf4\\x8e\\xab\\xfc\\xf3\\x81\\x8a\\x87\\x2d\\x5f\\x3d\\xcc\\x73\\x71\\x89\\x34\\x58\\x87\\x6d\\x9d\\xe3\\x40\\x29\\x5a\\xf2\\x0f\\xe0\\x1a\\x7d\\x56\\x0b\\x33\\xa1\\x25\\x5a\\x45\\x08\\xdb\\x8d\\xcf\\x2d\\xa3\\x22\\x0c\\x4c\\xdd\\xab\\x35\\x63\\x87\\x1d\\x7c\\x20\\x46\\xbe\\xcb\\xc8\\x46\\xcd\\x0b\\xc8\\x42\\x4f\\xd1\\xf8\\xe9\\xb5\\xac\\xab\\xd8\\xd6\\x29\\x4e\\x5e\\x05\\xbf\\x87\\xef\\x1c\\x07\\x63\\xf0\\x33\\xba\\x93\\x06\\x88\\x1f\\xe8\\xac\\xb7\\xe7\\x4f\\x0e\\xdc\\x61\\x1e\\xde\\x82\\x3b\\xce\\x6c\\x68\\xba\\x95\\x9c\\x3c\\x7f\\x2e\\x2d\\x56\\x6e\\xeb\\xfc\\x30\\xff\\x29\\xfa\\x5f\\xff\\xff\\x17\\x5f\\x9a\\x2c\\x9e\\x46\\x9f\\x7e\\xf6\\xeb\\x83\\xcf\\x36\\x0f\\x3e\\x4b\\xce\\x3f\\xfb\\xfe\\xf4\\xb3\\x57\\xa7\\x9f\\xcd\\x4f\\x3e\\x7b\\xf9\\x4f\\xab\\xf5\\xd0\\xe7\\x23\\x2d\\x0b\\x77\\x7f\\x98\\x74\\xca\\x0c\\x8b\\xa1\\xae\\xa9\\xde\\x40\\x43\\xb2\\x45\\x0e\\xc8\\xc6\\x0e\\x4e\\xe8\\x92\\x70\\x39\\x46\\x49\\xb1\\x21\\xdc\\x2a\\x03\\x13\\x88\\xf5\\x57\\x20\\x01\\x10\\xcd\\x93\\x34\\x7e\\x27\\xf2\\x5b\\xc3\\xa7\\xe6\\xa9\\x0c\\x6e\\x5f\\xf1\\xad\\x62\\x99\\xae\\x6a\\x26\\x2d\\x9f\\x76\\x54\\xf7\\x25\\x61\\x5b\\x4d\\x8e\\xd4\\x8b\\x4f\\x20\\x0d\\xfc\\x14\\xea\\x94\\xba\\x59\\x3e\\xd5\\x78\\x08\\xe2\\x92\\xaf\\x18\\x83\\x8c\\xbe\\x0f\\x53\\xe4\\x70\\x9f\\x30\\x55\\x38\\xf9\\x1c\\xf1\\x53\\xb4\\x49\\x30\\xba\\x50\\x7c\\x34\\x1f\\x22\\x86\\xbf\\x76\\x2e\\x78\\x0d\\x69\\x8c\\x5c\\x37\\x30\\x71\\x89\\xc8\\xa6\\xa7\\xc2\\xce\\x7a\\xda\\x51\\x6d\\xe1\\x67\\x99\\x15\\x4a\\x79\\x57\\xd5\\xf0\\x15\\x84\\x5e\\x45\\x26\\xde\\xac\\x1a\\xae\\x18\\xd3\\x34\\x0b\\x02\\x28\\xde\\xe8\\xb6\\x6c\\xa4\\xc5\\x72\\x89\\x69\\x7b\\x35\\x18\\x42\\x36\\x1d\\x8b\\xa2\\x0f\\x91\\x77\\xdb\\x99\\x4d\\x81\\xf2\\x89\\xad\\x9d\\xd4\\x5e\\xc1\\xd9\\x0e\\x9a\\x30\\xd3\\x03\\xc4\\xd5\\x75\\xf2\\x3c\\x58\\x68\\x33\\x74\\x73\\xf9\\x02\\x8f\\x45\\x3d\\x17\\x05\\x3e\\x05\\xbd\\x57\\x03\\x41\\xba\\x1f\\x2a\\xc6\\x89\\x36\\xaf\\x20\\x17\\x4e\\xd6\\x62\\x6d\\x2a\\x1a\\x7e\\x75\\xa8\\x87\\x03\\x1f\\x3e\\x98\\x0f\\x04\\x85\\x60\\xda\\xa6\\x34\\x00\\x0f\\xaf\\x05\\x58\\x5e\\xa7\\x74\\x0a\\x0e\\x3e\\x9b\\xe3\\x10\\x2c\\x58\\x0f\\xf0\\x3c\\x87\\x0f\\x53\\x30\\x55\\x8c\\x86\\x20\\x82\\x6a\\xc2\\x4e\\xa5\\x56\\x34\\x0b\\x3e\\x71\\x32\\xac\\xf1\\x1d\\x7e\\xb2\\xd5\\x89\\xd7\\x05\\x4b\\xa0\\xca\\x13\\xf8\\x60\\xad\\x91\\xd5\\x10\\xf0\\x8d\\x75\\xc4\\x47\\x5b\\xad\\x35\\x57\\x21\\x08\\x8b\\xd7\\x18\\xb0\\xf3\\xbd\\xfa\\x62\\xaf\\x59\\x56\\xc5\\x8a\\x91\\x8d\\xa8\\x29\\xbf\\xd8\\x6a\\x6e\\xe5\\xa8\\x78\\xed\\x18\\x14\\x7c\\x1e\\x54\\xcd\\xd5\\x89\\xd7\\xea\\x8b\\xad\\x26\\x48\\x0a\\xc2\\xe9\\xa4\\xb0\\x5e\\x91\\xad\\x59\\xcb\\x37\\x55\\xb5\\x51\\x69\\x5e\\xee\\x3d\\xff\\x76\\xc6\\xfb\\x89\\xe2\\xc3\\x59\\x4d\\x4e\\x15\\x7d\\x25\\x3d\\x37\\x9f\\xc1\\x97\\x71\\x52\\x7a\\x46\\x9a\\xa4\\x75\\x1c\\x09\\x03\\xdb\\x39\\x0d\\xc4\\x02\\x35\\x53\\xeb\\x54\\xa3\\xb1\\x39\\x1b\\x5c\\xcd\\xb4\\xe4\\x2f\\x76\\x67\\xd0\\x00\\xca\\xdd\\xde\\x10\\xf8\\x1f\\x66\\x9c\\x5c\\x79\\x91\\x4c\\x42\\xd8\\x7d\\xd1\\x3a\\xce\\x76\\x1d\\x68\\x32\\x16\\xcc\\x0a\\xce\\xbb\\xa0\\x36\\xb3\\x20\\x24\\x9b\\x6b\\x29\\x53\\xf8\\xca\\xf3\\x18\\x00\\x25\\x2e\\x57\\x40\\x6e\\xe3\\x74\\x81\\x57\\x24\\xe0\\xa0\\xa9\\x6c\\x2e\\x15\\x89\\xf9\\x68\\x4d\\xaa\\xa7\\xdd\\x83\\x51\\xc7\\x17\\xde\\xe5\\xae\\xe8\\x07\\xd0\\xdb\\x08\\xd5\\x88\\x35\\x88\\xd4\\x5f\\x21\\xf2\\x51\\x1b\\xaa\\x59\\xf9\\x02\\x5c\\xc3\\xcf\\xfe\\x3e\\x8c\\x30\\x5d\\x6c\\x8c\\x08\\xd8\\x75\\x2d\\x98\\x83\\x4f\\x55\\xf5\\x07\\x4e\\x4b\\xf6\\x3a\\xcd\\x12\\x46\\xf3\\x36\\x7d\\x55\\xc8\\x50\\x50\\xad\\x26\\x0c\\x87\\x40\\x84\\x2e\\x71\\x1d\\xf5\\x16\\x9e\\xf1\\x1d\\x3d\\x96\\x79\\x17\\x2d\\xad\\x14\\xfa\\x6b\\xe1\\xe4\\xbe\\x7a\\x53\\xab\\x6b\\x89\\x61\\xbb\\x29\\x0e\\xd0\\x19\\x3c\\x05\\x77\\x1a\\xbd\\x60\\x64\\xbb\\x86\\x38\\x86\\x23\\xed\\xb3\\xb9\\x92\\x5b\\x86\\x87\\xcf\\x9c\\x45\\xf8\\xc7\\xe2\\x66\\x17\\xde\\x94\\x2f\\x4a\\x95\\xe0\\x40\\xe4\\xbe\\x93\\x15\\x9a\\x07\\x3f\\xb4\\x24\\x5b\\x2a\\x0f\\x1b\\xa3\\xdc\\x28\\x2e\\x69\\x5e\\xa9\\x69\\x03\\x4f\\xb6\\xc9\\x60\\x06\\xb8\\x2b\\x27\\xaf\\x78\\x81\\x38\\xdb\\xe3\\xa5\\x5e\\x1c\\x87\\xc1\\x38\\xc2\\x98\\x21\\xf6\\x0e\\xb7\\x8a\\xf7\\x97\\xbc\\x7c\\x98\\xf7\\x1f\\x96\\x2a\\x43\\x9e\\xbc\\x88\\xd5\\x88\\x00\\x93\\xf6\\x39\\xcf\\xbd\\xe5\\x45\\x3f\\xb8\\x2d\\xae\\xb5\\x5f\\x50\\x3c\\x74\\xe0\\xda\\x50\\xba\\x5a\\x2f\\x44\\x26\\x35\\xa4\\xf0\\xa4\\x8f\\x08\\x2e\\x9c\\x6b\\xc8\\xf4\\xcc\\x7e\\xed\\x9d\\xb1\\xa6\\x41\\xd0\\x02\\xdd\\x54\\x9f\\x32\\x2f\\x03\\x71\\x5a\\xf0\\xc2\\x0f\\x4e\\x4c\\xa2\\x75\\x04\\x5e\\x35\\x6c\\x07\\xe4\\x3e\\x0b\\xf3\\xde\\xd2\\x0f\\x62\\x40\\x97\\x5e\\x18\\x27\\x07\\x5d\\x92\\xc9\\x05\\x49\\x33\\x88\\x60\\x55\\x9b\\x0c\\x44\\x8b\\x7b\\x7b\\x1b\\xef\\x15\\x8d\\xee\\xe7\\x61\\x3c\\x2e\\x01\\x1d\\xd9\\x1e\\x36\\xf2\\x63\\x9d\\xef\\x8f\\x55\\xb0\\xa9\\x10\\x5f\\x93\\xc8\\x31\\x36\\x67\\x48\\xe0\\x50\\x69\\xbe\\xaf\\xd0\\xed\\x98\\x5c\\xcc\\x1f\\x46\\xe4\\xe3\\x70\\x4e\\x11\\xb8\\x4f\\xc1\\x6d\\xcc\\x56\\xd3\\x61\\x60\\x5c\\x12\\xea\\xd9\\x20\\x8f\\x59\\xfc\\x94\\x96\\x31\\x4b\\xb7\\x5c\\x39\\xb2\\xda\\x23\\xd6\\x13\\xd9\\x23\\x5d\\xe1\\xef\\x9d\\xab\\xba\\xd6\\x20\\xab\\xb9\\xe0\\x68\\xed\\xb6\\xc5\\xcd\\xb8\\x5c\\x87\\xc6\\x3c\\x5e\\x77\\x1d\\xa3\\x26\\x06\\xd2\\x06\\x3e\\xb5\\xc7\\xf9\\xca\\x11\\x38\\x6c\\x5c\\x53\\xe9\\x8a\\x4a\\xb4\\x1a\\x42\\xa8\\xd7\\x9d\\x05\\x91\\xd8\\x69\\x91\\x84\\xb3\\x66\\x69\\x67\\x1a\\x7b\\x23\\xa5\\x43\\xf3\\xe4\\xa3\\x95\\xcd\\x35\\x8b\\x66\\x4b\\xee\\x45\\x63\\x11\\x8d\\x6f\\x09\\xec\\xac\\x64\\x86\\xd8\\xda\\x58\\x7b\\xf3\\x48\\x59\\x46\\x87\\xb8\\xa7\\xad\\x4d\\xd2\\xed\\xc0\\xb5\\x95\\x76\\x56\\xb4\\x30\\xda\\x1b\\xc5\\xc7\\xa0\\x3b\\x4d\\xce\\x3c\\x38\\x1c\\x65\\x10\\x8c\\x73\\xe6\\xf0\\x0e\\xbb\\xda\\x6c\\x77\\x8e\\x02\\xd8\\xa8\\x1c\\x45\\x97\\xa0\\x01\\x56\\x8e\\x42\\x17\\x22\\x27\\x9e\\x7a\\xe1\\xe3\\xa9\\xed\\x11\\x47\\x05\\xd5\\x25\\x8e\\x62\\x1c\\x00\\x8e\\x32\\x7c\\x9c\\xec\\xcc\\x91\\x98\\x56\\x99\\x9f\\x67\\x1e\\x63\\xef\\xdf\\x21\\x95\\x84\\x09\\xa6\\xd7\\x30\\x86\\x22\\xdd\\x56\\x6b\\x0b\\x85\\x83\\xc3\\x06\\x4c\\x30\\x33\\x3c\\x46\\x3e\\xe1\\xe7\\x40\\xa5\\x9e\\xfb\\xb3\\x14\\x07\\x0d\\x52\\xf4\\x5d\\x9b\\x23\\xd5\\xd3\\x79\\x63\\xc7\\xc2\\xf8\\x51\\xea\\xed\\x42\\xe7\\x38\\x0d\\x12\\xad\\x8d\\xd9\\x9e\\x7c\\xb1\\xd2\\x80\\x90\\x8d\\x3a\\x3e\\xe4\\xda\\xe1\\x80\\x25\\xc7\\xaa\\xf3\\xe8\\xc0\\x65\\xac\\xf8\\x35\\xdc\\xd9\\x66\\xd7\\xd3\\x46\\x9d\\x28\\x8c\\x6d\\x0a\\xdc\\x03\\x4f\\x53\\xb8\\x1a\\x19\\x8f\\xdf\\xaa\\x44\\x81\\xb6\\x57\\x39\\xb1\\x62\\xf5\\x71\\xba\\xe3\\x18\\x0e\\xe6\\x15\\x9f\\x9a\\xab\\x6a\\x7d\\xda\\x29\\xf9\\x18\\xb9\\x59\\xb2\\x54\\x04\\x8d\\x7f\\xf4\\x9c\\x90\\x6c\\xbb\\xee\\xe5\\x4b\\xfd\\x38\\x48\\x87\\x87\\x1f\\x56\\x1f\\xe9\\x74\\xb0\\xe4\\x38\\xfc\\x61\\x89\\xf7\\x87\\x61\\x8a\\x1b\\xae\\xbb\\xc6\\xc6\\xdf\\x90\\xab\\x74\\x03\\x59\\x41\\x55\\x3d\\x4c\\x7e\\x86\\xf9\\xbd\\x4c\\x68\\x42\\x38\\xe2\\x1c\\x54\\xc4\\xd6\\x43\\x4a\\x34\\x0e\\xee\\xc4\\x44\\x64\\x77\\xdd\\x99\\xf0\\x74\\xaf\\x9a\\x22\\x43\\xe2\\x50\\xc0\\x54\\xa6\\x31\\x19\\xc6\\x51\\x8a\\xb4\\x5f\\xcb\\x34\\x4f\\xab\\x5d\\x2f\\xf3\\xe2\\x1c\\x31\\x62\\x8a\\x36\\x12\\x61\\x1d\\x6a\\xc2\\x8b\\xd2\\xcd\\x96\\x71\\x0e\\x05\\xef\\x5b\\xbe\\x66\\xc3\\x51\\x3d\\xb2\\xbd\\xb4\\x91\\xa7\\x9f\\x0d\\x63\\x54\\x08\\x6f\\x9d\\xd4\\xc8\\x7e\\xb4\\x29\\xb8\\x04\\x30\\xdc\\x85\\x2f\\xc1\\x89\\xac\\xf4\\xc8\\x84\\xa2\\x30\\x3f\\x50\\x0f\\x1f\\xf4\\xa5\\x48\\x51\\x54\\x7a\\xaa\\x48\\xf3\\x9a\\x00\\xde\\x4f\\xf9\\x5d\\x39\\xf7\\x30\\xb8\\x25\\xae\\xcb\\xaa\\xd8\\x44\\x2b\\x46\\x2e\\x2c\\xb2\\x30\\x4f\\x23\\x00\\xe5\\xe4\\xc5\\x3e\\x69\\x1a\\xde\\xe8\\xf8\\xe6\\xfd\\xd1\\x4f\\xc3\\x3c\\x48\\xfc\\x8d\\x4d\\xcd\\xce\\x77\\xd9\\x4d\\x1f\\x29\\xf5\\x78\\x92\\xe0\\xa2\\xbd\\xab\\x6d\\x59\\xb5\\x14\\xc2\\x5e\\x0a\\x08\\x66\\x5d\\x93\\x08\\x5f\\xf7\\x8b\\x83\\x8c\\x80\\xcd\\xb1\\xab\\xb5\\x39\\x08\\xfa\\xd1\\x38\\x16\\x99\\x40\\x10\\xda\\x35\\x5e\\xa5\\x8e\\xd1\\xb2\\xde\\xf8\\x43\\x46\\xf8\\x24\\xde\\x7a\\x2b\\x40\\x18\\x9a\\xb7\\x42\\x91\\xbb\\xaf\\x02\\xe9\\x07\\xef\\x4e\\x00\\x09\\x23\\x2b\\x27\\x06\\xef\\x6d\\x05\\x2d\\xfa\\xc4\\xd4\\x75\\x33\\xa3\\xc3\\xdb\\x63\\x27\\x61\\x60\\x85\\x46\\xa1\\x69\\xe1\\x2b\\x06\\x8a\\x0d\\xe1\\xfc\\x5e\\x0d\\xe9\\xcc\\x76\\xad\\x59\\x36\\x6d\\x2b\\xf9\\x02\\x65\\xde\\x1b\\xb6\\x60\\x92\\x60\\x74\\xd6\\xc8\\x99\\xdc\\xb4\\x6b\\xa6\\x5f\\x20\\x42\\xf0\\x91\\xbe\\x60\\x45\\xbd\\x75\\xce\\x40\\x38\\x8c\\x51\\x31\\x17\\x8b\\x30\\x67\\x6e\\xc7\\x5b\\x3a\\xd0\\x7c\\x1c\\xa9\\xf3\\x7a\\xb1\\xfa\\x78\\xa8\\xc5\\xaa\\xb7\\x9f\\x54\\x8c\\xe6\\x2a\\x67\\xbe\\x93\\x5b\\x21\\xf4\\x99\\xef\\x58\\xc0\\x3b\\xcf\\xf4\\x10\\xb0\\x9e\\xc9\\xec\\xf1\\xd2\\x4f\\x3c\\xd2\\xec\\x09\\x2a\\xe8\\x34\\xd1\\x13\\xa8\\x66\\x0a\\xcc\\x1d\\x7f\\xd1\\x3d\\x00\\xe9\\xbe\\x94\\xe0\\x74\\x01\\x09\\x9a\\xcd\\x78\\x06\\x5f\\xfb\\x31\\xe4\\x8e\\x8e\\x51\\x98\\x72\\xb6\\xef\\x3f\\xfd\\xde\\xab\\x33\\x27\\x1d\\x0d\\x07\\x4b\\x67\\xa2\\x6f\\xa4\\xe7\\x19\\x09\\x46\\xe8\\x3f\\x3b\\x13\\x59\\x32\\x03\\x25\\xa3\\x1e\\xc1\\x76\\x37\\x0a\\x25\\xcc\\x37\\x7b\\x8d\\xc0\\xcc\\x5b\\x3b\\x7f\\xbd\\x01\\xa4\\xb7\\x71\\x06\\x8f\\x20\\xf8\\x83\\xcc\\xe1\\x0f\\x3d\\x32\\x47\\xf0\\xcf\\xc4\\x1b\\x62\\x16\\x09\\x38\\x81\\x78\\x95\\xcb\\xb4\\x4d\\x6d\\x6a\\x7d\\xb7\\x0f\\x7e\\x2c\\x47\\x35\\xf0\\x93\\x38\\xfe\\xbe\\x1b\\xe7\\x47\\x36\\x82\\x98\\xc7\\x1e\\xcf\\x73\\x0e\\xc6\\x75\\x9f\\x96\\x68\\xcb\\x19\\xba\\xa7\\x9b\\x78\\xfd\\xfa\\xfd\\xc8\\x6b\\x5f\\x87\\x89\\xfb\\x12\\x83\\xc4\\xb8\\x6d\\x48\\xeb\\x14\\x93\\x60\\x03\\x01\\x0c\\xc5\\x8a\\xeb\\x20\\x43\\xdb\\x74\\xd9\\x5c\\xa4\\xb9\\x5b\\xc1\\x93\\x90\\x89\\xeb\\xe5\\x4c\\x0f\\x9f\\x02\\x6e\\x30\\x84\\x20\\x46\\x05\\x4c\\x6d\\xf6\\x8d\\x69\\x30\\x56\\x30\\x4b\\x7c\\x9a\\x38\\x8f\\x9d\\x5e\\x09\\xeb\\x89\\x0c\\x16\\x6a\\x4d\\xdb\\x7b\\xf8\\x81\\xa8\\xbd\\xa1\\x30\\xae\\x80\\xfc\\xdb\\xb3\\x85\\xb9\\x2e\\x2d\\xdc\\xc6\\xdd\\x2b\\x8c\\xd6\\x3b\\xb9\\x71\\x85\\xb1\\x7e\\x28\\xcd\\x32\\x0c\\xdb\\xe1\\x5c\\x07\\xc3\\xf8\\xfc\\xb3\\xac\\x73\\xa5\\xe6\\x7e\\xaa\\xdd\\x4f\\xb5\\xbb\\x34\\xd5\\x86\\x2e\\x13\\x35\\xb7\\xc4\\x6e\\xed\\xc0\\x77\\xdc\\x65\\xeb\\x0b\\xf5\\x76\\x8c\\xfd\\x60\\x72\\xef\\xe4\\xf0\\x0f\\xe6\\xfe\\x50\\x33\\x20\\x18\\xe1\\xe1\\xf6\\x9b\\x60\\x94\\xf2\\x52\\xf7\\x58\\x7d\\x52\\x36\\xd3\\x73\\x3a\\x85\\x0a\\x15\\xce\\x47\\x26\\x68\\xb0\\xaa\\xdd\\x04\\x94\\x1b\\x1c\\x0d\\x76\\x84\\xce\\xfc\\xc1\\xa2\\x91\\x96\\x02\\x2b\\x00\\x99\\x79\\xcd\\xfb\\x49\\x91\\xc9\\x14\\xa2\\xdd\\x5b\\xde\\xf8\\x77\\xdf\\x25\\x6f\\xb3\\x02\\xc2\\xeb\\x85\\xff\\xa7\\x79\\xcc\\x20\\x91\\x1b\\x9f\\x75\\xab\\x75\\x95\\x73\\x2b\\x13\\x6e\\x2f\\x95\\xc5\\x06\\x53\\xb3\\x17\\x39\\x5c\\x4f\\x22\\x99\\xcc\\x10\\x16\\xcd\\x56\\x64\\xb3\\x21\\x47\\x5d\\x18\\xdd\\x63\\xe7\\x05\\x03\\x40\\x94\\xcd\\xde\\xe9\\x66\\x31\\x12\\xf3\\x68\\x80\\x96\\x84\\x1e\\x98\\x96\\x84\\xb0\\x77\\x93\\x28\\x89\\x8b\\xfc\\x82\\x32\\xf1\\x5e\\x57\\x8c\\x72\\x84\\x97\\x2a\\x65\\x4f\\x9e\\xf8\\x50\\x56\\x85\\xc8\\xd7\\x6a\\x1b\\x17\\xde\\x0c\\x0f\\x2f\\xbe\\x13\\x1d\\xa6\\xdc\\x1f\\x61\\xdd\\x27\\xde\\xd5\\x4d\\x24\\x91\\xf1\\x9a\\xe4\\x39\\xcd\\xbc\\x04\\x32\\xfb\\x1a\\x60\\x07\\xbd\\x62\\x70\\x73\\x28\\x1c\\xf8\\x6a\\x0c\\xf0\\x05\\x24\\xfc\\x0f\\x87\\xbd\\x08\\x85\\xad\\x3a\\x0f\\x2f\\xd2\\x71\\xb9\\x42\\xdf\\x7d\\x3f\\x7f\\xe9\\x05\\xbe\\x2e\\x33\\xbc\\xc1\\x3e\\x7f\\x69\\x8c\\x0f\\xaf\\xab\\x48\\xd6\\x1e\\xd9\\x67\\xeb\\xda\\x7b\\xa1\\x66\\x1d\\xca\\x27\\xe6\\x91\\x22\\x83\\xd7\\xdf\\x42\\xc1\\x35\\x93\\xce\\x07\\x2d\\x9b\\xd4\\x09\\x5c\\x50\\xd0\\x09\\xbc\\x2f\\xfc\\x43\\x73\\xb5\\x80\\x4e\\x50\\x53\\x21\\xac\\x13\\x5e\\x3e\\x9e\\x34\\x71\\x0e\\xcb\\x2d\\x79\\x90\\xa4\\x1b\\x9a\\x97\\x03\\x7d\\x41\\x42\\xe1\\x2d\\xc2\\xe0\\x4d\\x9b\\x12\\x5c\\x62\\xd7\\xd6\\x1b\\xdf\\x3f\\xb9\\xd1\\x29\\x11\\xaf\\x39\\x83\\xc4\\x07\\x2a\\x0e\\x9e\\x0e\\xf5\\x26\\xcd\\x21\\x00\\xea\\x1a\\xa6\\xc3\\x93\\x7d\\xa7\\x83\\xf8\\x5f\\xa9\\x08\\xf3\\x9f\\x5f\\x58\\x14\\x84\\xf9\\xc5\\xca\\xa7\\x1e\\x74\\x8b\\xed\\x54\\x8b\\x44\\x26\\x32\\x8f\\x49\\xb9\\xdb\\x2c\\x8a\\x4c\\xbd\\x63\\x62\\xa4\\x35\\x37\\x17\\x1d\\xac\\x8b\\x49\\x60\\xf0\\xd3\\x90\\x78\\x3a\\x88\\xc8\\x55\\xf3\\x90\\xf2\\x00\\x1a\\xa8\\x89\\x87\\xdf\\xfc\\xf7\\x38\\x14\\x2c\\x0e\\xc4\\xc0\\x62\\x79\\xba\\x3e\\x0a\\x3e\\x37\\x61\\x68\\x18\\x02\\xa8\\xe9\\xd2\\x2b\\xb9\\xa1\\x63\\x49\\x59\\xc5\\x48\\xc2\\xb5\\x20\\x55\\xfe\\x06\\xbf\\xf9\\x34\\xd7\\x41\\x51\\x50\\x12\\x2a\\x0b\\xea\\x8c\\xc4\\x7b\\xcc\\xcb\\x7c\\xa4\\x42\\xf9\\xde\\xa4\\x2e\\x58\\x5d\\xae\\xc3\\x68\\xc5\\xaa\\x98\\x2c\\x07\\x3e\\x8c\\xea\\x3b\\x0c\\xbb\\x08\\xc3\\xd2\\xcd\\xb7\\x33\\x0a\\x0b\\x17\\xc5\\xaa\\xc8\\x49\\xe0\\x7c\\x52\\xb5\\x5d\\xe2\\x7f\\x2a\\xcb\\x7d\\x5d\\x60\\xaf\\x33\\xd4\\x01\\x90\\x13\\xaf\\xc9\\x5c\\x50\\x36\\xa9\\xb6\\xe5\\x62\\x00\\x31\\x68\\xa5\\x77\\x11\\x13\\x15\\x21\\x7b\\x77\\x69\\x7b\\x4c\\xcc\\x9b\\xa9\\x47\\xe0\\xe8\\x72\\x2c\\xa2\\xde\\x66\\x2d\\x58\\x05\\x35\\xfa\\x9f\\x68\\x36\\xc3\\x14\\xf0\\x43\\x2f\\x0d\\xe2\\x67\\xdb\\xba\\x24\\xdf\\xa4\\xd4\\x6d\\xef\\x00\\xa8\\xf2\\xa3\\x13\\xaa\\x68\\x7e\\xa6\\xb7\\xd7\\xed\\x91\\x31\\x46\\x02\\x0e\\xe6\\xc1\\x55\\xfb\\x29\\x23\\x97\\x78\\xa5\\x9b\\x1b\\x06\\xf8\\x11\\x5f\\x07\\x10\\x93\\xa7\\x79\\x9c\\xd8\\x7c\\xa6\\x42\\xe6\\x9f\\xb1\\x3e\\xea\\x60\\xbe\\x3c\\x6f\\x7f\\x9f\\x1d\\x4e\\x6a\\x8f\\xcc\\x67\\xdf\\xec\\x14\\xf6\\xee\\x9c\\x5f\\x3d\\x10\\x19\\xfc\\x48\\x59\\x16\\x71\\x8a\\x59\\x22\\x9b\\x64\\x7e\\x48\\xb8\\x8f\\x1e\\x6b\\x38\\xa0\\xe7\\xea\\xf9\\x04\\x8c\\x16\\xac\\x28\\x09\\x98\\x56\\x5f\\x9f\\x88\\x0c\\x7f\\xa3\\xd2\\x18\\xce\\xa7\\x71\\x8e\\x8d\\x2d\\xe0\\x64\\xa2\\xfa\\x26\\x61\\x0b\\xbe\\x08\\x06\\x39\\xdb\\x00\\x76\\x10\\x27\\x32\\xdd\\x64\\x97\\x1b\\xfb\\xfa\\x39\\x3e\\xa5\\xc0\\x5e\\xdd\\x6b\\xf5\\xf3\\xdc\\x77\\xef\\x2d\\xea\\x5e\\x75\\x9d\\x43\\x2c\\x31\\xa8\\xf9\\x7b\\x93\\xf3\\x88\\x1a\\x7b\\x64\\x63\\x71\\x22\\x72\\xb1\\x7f\\x24\\xcf\\xea\\x47\\xf7\\xdf\\x64\\x8c\\xe6\\xbb\\xad\\x53\\x04\\xfd\\x24\\x83\\x94\\xd7\\x48\\x87\\xc0\\x0c\\x6f\\xc6\\xbe\\x53\\xd9\\x82\\x74\\x92\\xc4\\xf3\\x9a\\xde\\x8d\\x38\\x06\\x60\\xc1\\x1a\\x51\\xf3\\x92\\x3b\\xab\\x29\\x3c\\x2b\\x0f\\xb7\\x60\\x8a\\x1c\\x1e\\xbe\\x59\\xf6\\x91\\xab\\x87\\xda\\xbd\\x7d\\xee\\x7c\\xff\\xd3\\x4e\\x40\\x6f\\x90\\x75\\x9f\\x3d\\xe9\\xec\\x60\\xf8\\x10\\x08\\x6a\\x06\\x3e\\x0a\\x26\\xe5\\xff\\x19\\x8f\\xd5\\x82\\x19\\x7e\\x3a\\xe1\\xfa\\x47\\x01\\x0f\\x76\\x8c\\x1e\\xaa\\xd7\\x43\\xea\\xa8\\x47\\x46\\x8e\\xa3\\x98\\x6c\\xf9\\xc0\\xa1\\x67\\xba\\x8f\\xdd\\x3f\\xf4\\xbd\\x19\\x02\\xc0\\x12\\xfc\\x6b\\x2f\\xe5\\xc3\\xf1\\xda\\xdd\\x49\\xfb\\xb1\\x69\\xd6\\xd5\\x05\\x5d\\xe9\\x97\\xe5\\x5a\\x62\\x3b\\x5d\\x10\\x4d\\x44\\x44\\x56\\xdf\\x24\\x35\\xef\\xd7\\x14\\x2c\\x75\\xac\\x82\\xde\\x33\\x05\\xd1\\x4c\\x86\\xdd\\x36\\xc3\\x69\\x18\\x1d\\xe6\\x38\\xf6\\x30\\x64\\x3d\\x86\\x12\\x2f\\xff\\xd5\\xf2\\x95\\x2d\\xb5\\x96\\x85\\x21\\x7b\\x7d\\xb0\\x83\\xa8\\x30\\x7c\\x3f\\xcb\\x15\\x77\\x1c\\x87\\xe6\\x3a\\x6d\\xc5\\x65\\xa2\\x9a\\xd7\\x0b\\x7c\\xe4\\x87\\xf6\\x5e\\x4e\\xed\\x37\\xc7\\xfa\\x83\\x87\\x80\\x16\\xca\\xd2\\x3c\\x6f\\x2f\\x81\\x1d\\x43\\xe2\\x4d\\xca\\xce\\xfc\\x52\\xe9\\x7c\\xc3\\xf6\\xe7\\x53\\xb1\\xcb\\x53\\xd0\\x60\\x6c\\x48\\xde\\x07\\xc3\\x06\\x42\\x15\\xf9\\x96\\x67\\x4d\\x16\\x7d\\x5b\\xf4\\xe1\\x99\\xcd\\xfe\\xb3\\x81\\xcf\\xd3\\x58\\x76\\xa6\\x5b\\xc4\\x03\\xb9\\x4c\\x06\\xed\\xb2\\x37\\x5a\\x2e\\xbb\\x2d\\xe1\\x4a\\x20\\x2c\\xa7\\xb6\\xc7\\x26\\xcd\\x86\\xea\\x91\\x63\\xa8\\xde\\x3c\\x9c\\x87\\xdf\\xec\\xe6\\x9a\\x6a\\x80\\x22\\x88\\x7e\\xda\\xc2\\x5a\\x41\\x32\\xf1\\xd5\\x6b\\xd8\\x99\\xeb\\xbb\\xcf\\x4e\\x85\\x1f\\x1c\\x62\\xe0\\xd6\\xa9\\xdd\\xc1\\x96\\x6e\\x98\\xde\\x53\\x78\\x26\\xa1\\xb6\\x7d\\x61\\xba\\xe0\\x3a\\xd5\\x8c\\x94\\x38\\x03\\x95\\x1b\\x9a\\xa6\\xb5\\xf2\\xde\\xaf\\xec\\x01\\x31\\xd6\\x0f\\x9c\\x28\\xf7\\x32\\x1b\\x25\\xb3\\xe1\\xac\\x5c\\x53\\x45\\x66\\x66\\x5f\\xb2\\xb3\\x63\\xcf\\xbb\\xe4\\xaf\\x3b\\x4a\\x5e\\xbd\\x46\\x7b\\x89\\x6b\\x28\\x4d\\xd7\\xbd\\xb0\\xb4\\x9f\\x98\\xaf\\x9f\\x8c\\xeb\\x7f\\xde\\xc5\\xaf\\x1f\\xa9\\xe3\\x3d\\x92\\x04\\xef\\xff\\x1d\\xda\\x0d\\xac\\x17\\x1d\\x6c\\xfb\\x81\\xd5\\x8c\\x93\\x56\\x9c\\x74\\x87\\xc4\\x45\\xc1\\xb8\\x7a\\x87\\x8e\\x70\\xe9\\xce\\xf0\\x9a\\xad\\xe3\\x9c\\x7b\\xa1\\x48\\x2c\\x88\\x90\\xe5\\xe9\\x93\\xc3\\x69\\x9c\\x8d\\x22\\xc9\\x02\\xc2\\xe5\\xfb\\x99\\x96\\x9c\\x59\\xcf\\x15\\x60\\x9f\\x73\\xf6\\x43\\x27\\x6b\\x43\\xef\\xbc\\xb3\\xc3\\xf1\\x8b\\xa9\\x2b\\x27\\x0c\\xb9\\x89\\xe1\\xbd\\x17\\x62\\x7b\\x88\\xd5\\x23\\xac\\x98\\xb7\\x69\\x04\\xa5\\x20\\x88\\x18\\xc1\\xb0\\x71\\x00\\x00\\x4e\\x7d\\xbc\\x84\\x38\\xc9\\xf4\\x81\\xbf\\x1b\\x3d\\xf0\\xc7\\xb9\\x3d\\x43\\x91\\xb8\\x18\\xbe\\xae\\x81\\x1f\\x4a\\xd2\\xdf\\x7d\\xe0\\xef\\xee\\xea\\xc0\\x4f\\x9b\\x27\\x28\\xe1\\x84\\x09\\x02\\x22\\xbd\\xa3\\xbe\\xad\\x3e\\x2e\\xa1\\xb0\\x05\\xd7\\xe8\\x09\\xa0\\x9d\\x23\\x6e\\x8b\\x14\\x3d\\x1e\\x6a\\xdf\\x97\\xef\\x8c\\x49\\x03\\x72\\x6c\\xef\\x06\\xd3\\xe5\\xee\\x58\\x4d\\x2e\\xd8\\xbf\\x7d\\xb1\\x06\\x71\\xd9\\x11\\x6f\\x30\\xbf\\x07\\x19\\x08\\x31\\xc1\\xe1\\x9d\\x45\\xe5\\x16\\xa3\\x23\\x2a\\x11\\xde\\xe4\\x0f\\xa6\\x14\\x75\\xc6\\x8f\\x04\\x13\\xd9\\xe8\\xb1\\x30\\x6d\\xb5\\x1b\\x81\\xd6\\xdd\\xd5\\x92\\x69\\xec\\xe6\\x27\\x06\\xc0\\x6e\\xb7\\x57\\x96\\x08\\x31\\x17\\x4f\\x8d\\x28\\xf7\\x99\\xdb\\x4f\\x0a\\xd0\\x95\\xb3\\xe8\\x72\\x4d\\x39\\xbb\\x4c\\x3d\\x5a\\x80\\xd9\\xbf\\x12\\xba\\x4c\\xe1\\xed\\x03\\x78\\x38\\x4d\\x3e\\x05\\x88\\xa3\\xca\\xdb\\xc1\\xb2\\xd1\\xf8\\x0e\\xee\\x6d\\x02\\xfc\\xaf\\x1c\\x73\\x2c\\x08\\x2c\\x81\\x42\\x46\\x6d\\xf4\\x1d\\x6a\\x3b\\x74\\x06\\x99\\xfb\\x47\\x48\\x38\\xdd\\x18\\x97\\xe3\\xa5\\xdb\\x3d\\x84\\x54\\x5f\\xec\\xb7\\x65\\x36\\x9d\\x13\\x26\\x8a\\xa1\\x21\\x35\\x64\\x31\\x89\\xf0\\xa0\\x7b\\xbb\\x29\\xba\\xb7\\x9b\\x3e\\x56\\xbb\\xc9\\x16\\xe1\\xe6\\x6c\\x3e\\xa8\\x44\\x2a\\x68\\x77\\xc8\\x88\\xb2\\x86\\x00\\xde\\x9b\\x52\\x5e\\x92\\x3e\\x52\\x53\\xea\\x7a\\xe6\\xc2\\x38\\x91\\xdd\\x66\\xb3\\xea\\x10\\x53\\xe1\\xa3\\x33\\xae\\xee\\x94\\xe5\\x74\\xc0\\x8e\\xbc\\x37\\x8e\\x3a\\x6d\\x6e\\x87\\x71\\x34\\xa9\\x63\\xff\\x9e\\x26\\xd2\\x84\\xa0\\xa5\\xbb\\x60\\x0e\\x69\\x19\\x98\\x02\\x07\\x0c\\x1b\\x38\\xf8\\xb5\\xdf\\xbc\\x0f\\x3f\\xf1\\xf5\\xee\\xbc\\xed\\xa9\\xec\\xd8\\x3d\\xdb\\x68\\xe9\\x7c\\x10\\x26\\xec\\x46\\x0a\\xf1\\x1f\\x4e\\x6a\\x32\\x18\\x7c\\x00\\xca\\x3c\\x92\\xf4\\x6b\\x1e\\x9e\\xc7\\x70\\x46\\x34\\x44\\xee\\x83\\x01\\x84\\xa5\\xa8\\x80\\xfb\\x31\\x01\\x2f\\xdd\\xe2\\x55\\x11\\xb8\\x42\\xb2\\x4d\\x69\\x4c\\x2f\\xd3\\x52\\x4c\\x5e\\xc2\\x70\\x7e\\x1c\\xc3\\x53\\x94\\xf8\\xde\\xbd\\x98\\x2e\\x90\\x01\\xdc\\xbf\\xb8\\xdc\\xdb\\xaa\\x7f\\x4b\\x5b\\xd5\\x7e\\x5b\\x6b\\xbc\\x66\\x6e\\x87\\xf3\\x71\\x9a\\xa7\\x7d\\x5e\\xc6\\x2a\\x71\\x57\\x5f\\xe8\\x9c\\xcd\\x16\\xa4\\xa4\\x30\\x39\\x8f\\x02\\x27\\xc1\\x17\\xe3\\x67\\xc1\\x58\\x94\\x2e\\x51\\x5c\\xd7\\x94\\x98\\x44\\xdf\\xdf\\x7e\\x7e\\xb8\\x64\\x76\\xa7\\xe6\\xca\\x97\\x1d\\x26\\xab\\x62\\x3b\\x66\\xaa\\x7c\\x39\\x65\\xaa\\x8c\\xc2\\xe8\\x12\\xc4\\xf5\\xcd\\x94\\xf1\\xe4\\xfd\\xed\\x27\\x8a\\x43\\x64\\x77\\x69\\x9e\\xdc\\x3b\\x3b\\xef\\x95\\xa9\\x50\\x31\\x1d\\x60\\xdc\\x77\\xc7\\xfc\\x0d\\x0d\\xf9\\xbd\\xd4\\xa8\\xdd\\x04\\x35\\x6a\\x24\\x46\\x97\\x24\\xae\\x6d\\x2e\\xdc\\x2b\\x51\\x07\\x13\\xd9\\x5d\\x99\\x23\\xfb\\xa8\\x4f\\xbb\\x09\\xea\\xd3\\x38\\x84\\x2e\\x39\\x5c\\xdb\\x0c\\xb9\\x57\\x9e\\xf6\\x93\\xd8\\x9d\\x9b\\x20\\x1f\\xdd\\xc9\\xd8\\x7d\\xd8\\xa1\\x2d\\xec\\x70\\xff\\x81\\x70\\x7f\\xb2\\xd6\\x69\\xe3\\xee\\xea\\x0f\\x75\\xb2\\x36\\xa1\\x4b\\x6d\\x67\\x6a\\xc6\\x79\\xd0\\xad\\x3b\\x53\\x1b\\x3e\\xaf\\x9a\\xb4\\x3f\\xfe\\xfd\\xce\\xd8\\x5c\\x62\\x18\\x1a\\x4a\\x43\\xa7\\x2d\\x81\\xe1\\x86\\xf7\\x67\\x2e\\xf7\\x67\\x2e\\x01\\x0c\\x86\\x69\\x7b\\x87\\x8b\\x89\\xf2\\x41\\xfb\\x78\\xcf\\x5f\\x0e\\x11\\x4a\\x73\\x7f\\x0a\\xa3\\xe8\\xbb\\x0b\\xa7\\x30\\xb7\\x63\\xc6\\x7c\\x71\\xc7\\xa7\\xcc\\xfd\\x61\\x4c\\x74\\x47\\x0e\\x63\\x6e\\xc7\\x7c\\xf9\\xf2\\x6e\\xcf\\x97\\xfb\\x43\\x99\\x7b\\x6d\\x6b\\x8a\\xc8\\xee\\xe0\\x4c\\xb8\\x3f\\xab\\x11\\xe4\\xdd\\x81\\xb3\\x9a\\xdb\\x30\\x5d\\x0c\\xf9\\xdd\\xc1\\x09\\x73\\x7f\\x70\\x73\\x37\\x0e\\x6e\\x6e\\xc7\\x6c\\xb9\\xe3\\x8a\\xd6\\x47\\x77\\x8a\\x73\\xa7\\x8e\\x68\\x0e\\xd8\\x91\\xf7\\xa7\\x30\\x9d\\x36\\xee\\xde\\xfc\\x90\\xa7\\x30\\x07\\xbb\\xdf\\x74\\xf7\\xcf\\x62\\xfe\\xa6\\x67\\x2f\\xc6\\x59\\xcb\\xde\\xf7\\x9b\\xc2\\xef\\x31\\x79\\xb7\\x58\\x67\\x02\\xcb\\x90\\x36\\x53\\xf6\\xf4\\xd1\\xe9\\x2c\\x83\\x64\\x15\\x90\\x3d\\xf5\\x5e\\x60\\xfa\\xd7\\x80\\xd4\\xa9\\xf7\\x02\\xd3\\xbf\\x7a\\x2f\\xda\\x05\\xdf\\xa9\\xf3\\xab\\xbb\\x8e\\x6c\\x9f\\x01\\x4d\\x26\\x69\\xd7\\x23\\x73\\x7f\\x06\\x89\\x69\\x38\\xbd\\xec\\xbd\\xac\\xd4\\xcf\\x50\\x6e\\xd9\\x7b\\x49\\xe1\\x47\\x4f\\xf0\\x01\\xbe\\x15\\x66\\xbe\\x6a\\xd0\\x7b\\x62\\x6a\\x28\\x24\\xe0\\x50\\x1b\\xad\\xe5\\xe5\\xb2\\x4e\\x45\\xa3\\x0b\\x2c\\xd5\\xaf\\x6f\\x32\\xb9\\x68\\xb3\\x8f\\x8e\\x61\\xd2\\x0e\\x36\\x76\\x0f\\x4d\\x58\\x59\\xd4\\x2c\\x1e\\xf9\\xda\\x84\\xc4\\x25\\xb4\\xb3\\x21\\x82\\x1c\\xf7\\xca\\x9d\\x8d\\xcd\\x37\\x0f\\x08\\x5b\\x51\\xe7\\x53\\x15\\x37\\x4b\\x9f\\x6f\\xaa\\xa9\\x27\\xef\\xf6\\x9e\\x6d\\x5b\\x56\\xfc\\xae\\x5e\\x1d\\xb1\\x0b\\xc1\\x07\\xb3\\x1d\\x0d\\xd6\\x27\\x28\\x00\\x78\\x07\\x40\\xa7\\xc1\\x91\\xef\\x75\\xbf\\x7e\\x5b\\xf7\\xca\\xe5\\x01\\x35\\x6a\\x38\\x0e\\x71\\xea\\x78\\x1c\\x85\\xc5\\x7d\\x1e\\x45\\xff\\x7a\\xd8\\x33\\x5b\\x39\\xde\\x9d\\x09\\x00\\xe2\\xab\\x35\\x6a\\xb4\\x4f\\x63\\x5f\\xc1\\xd4\\x73\\x0f\\x0c\\x12\\x6e\\x34\\x32\\xb3\\x2e\\x04\\xb7\\x0f\\xe4\\xbd\\xf7\\xac\\x2c\\xbc\\x67\\x23\\x92\\xe2\\x19\\x2f\\xcb\\xe2\\x93\\x66\\x7f\\xb9\\xe7\\x1d\\x56\\xf8\\x0e\\x5e\\x72\\xff\\x6b\\xd8\\x9d\\xc0\\xe7\\x5b\\x1d\\x83\\xc7\\x40\\x46\\xd5\\xfd\\x51\\x93\\xbc\\x4a\\xe1\\x85\\x9b\\x0b\\x2a\\x9e\\xe1\\xf1\\xfa\\x0f\\x44\\x2b\\xf5\\x1c\\x2a\\x61\\x96\\x77\\xda\\x1e\\x7a\\xb0\\xe6\\x51\\xa1\\xbc\\x2c\\x83\\xa8\\x64\\x4d\\xc0\\xf5\\x93\\xf8\\x68\\x45\\x36\\x89\\x47\\xf1\\x2c\\x1c\\x89\\x92\\xb4\\x8c\\x19\\xad\\x28\\x18\\x3b\\xdb\\xba\\xe2\\xfb\\x7c\\xbe\\xf2\\x53\\x25\\x60\\xfd\\x49\\x81\\xac\\xff\\x96\\x9f\\xf7\\x13\\x82\\x7c\\xa2\\x0e\\x5e\\x7e\\x27\\x15\\x5d\\x15\\x2c\\xe5\\x7f\\x15\\x2f\\xb5\\xfb\\x1f\\xfb\\x94\\xd5\\x77\\x5f\\x7e\\x31\\x24\\xa3\\xb1\\xb4\\x5c\\xd2\\xbc\\xda\\x59\\xc8\\x09\\xa1\\xe6\\xab\\x5b\\x46\\xcd\\xe2\\x76\\x91\\x13\\x4f\\x27\\x47\\x0d\\xe7\\x34\\xa1\\x30\\x9c\\x77\\x01\\x73\\x48\\x55\\x05\\xa4\\x3f\\xc8\\xcf\\x63\\xb1\\x3a\\x67\\x4f\\x1e\\x65\\xc5\\x8a\\x30\\xfe\\x79\\x93\\xc6\\x11\\xbe\\xfc\\x05\\xcf\\x03\\xf9\\xd7\\x8f\\x62\\x85\\x8b\\x47\\xb1\\x3a\\x20\\x19\\xb0\\x22\\xe6\\xc0\\x1c\\xef\\x8b\\x30\\x32\\xb6\\xc5\\x25\\x90\\xf1\\xba\\xb8\\x3c\\x00\\x19\\x1b\\xb2\\xdd\\xe2\\x33\\x81\\x85\\x2c\\xcd\\x06\\x5e\\xe9\\x55\\xb5\\xda\\x35\\x24\\x1b\\xbb\\x86\\x78\\xd6\\xb4\\x92\\x17\\x31\\x1a\\xb1\\xa2\\xa8\\x02\\xa5\\x51\\xfe\\xc1\\x2a\\x7c\\x3d\\x9c\\xff\\x1e\\x4b\\x47\\xb5\\x66\\xb4\\x5c\\x17\\x59\\xb2\\xef\\xc2\\xda\\x00\\x02\\x4a\\xce\\xd5\\x17\\x83\\x1c\\x9f\\xfa\\x89\\xb1\\xe3\\x69\\x8c\\x2d\\xbe\\x99\\x7f\\x6b\\x6a\\xa1\\xed\\x6b\\x55\\x36\\x25\\x3a\\x29\\x36\\x24\\xb5\\xab\\x9b\\xe6\\x9b\\x65\\x73\\xcb\\xde\\x7f\\x64\\x7d\\xf2\\xac\\xe7\\xad\\xe5\\x32\\xb8\\x5e\\x14\\x29\\xbe\\x7b\\xff\\x0c\\x1f\\x8a\\x3c\\x9b\\xed\\x34\\x76\\xcd\\x86\\x71\\xb1\\xc5\\x55\\x61\\x1e\\x26\\x5c\\xa1\\x84\\xe0\\x0b\\x94\\x49\\x69\\x88\\x1a\\xfe\\xe7\\xe2\\x0e\\xe9\\x9c\\xff\\xd6\\x46\\x6d\\xd3\\x51\\x76\\xa8\\x66\\x07\\xda\\x4f\\xbd\\xc0\\x99\\x8f\\x72\\x15\\xe7\\xa7\\x9c\\x2d\\xc6\\x47\\x0e\\x5f\\x0e\\x12\\x39\\x23\\xd5\\xd1\\x88\\xe8\\x60\\xdb\\x29\\xab\\x09\\x56\\xba\\xf9\\x05\\xbc\\xa7\\xa2\\xd9\\xcf\\xbd\\xbb\\x75\\xe6\\x35\\x03\\xf3\\x4d\\x35\\x9b\\x75\\xeb\\x66\\x41\\xa7\\xce\\xcd\\x83\\xc6\\xe8\\x08\\x16\\xde\\x60\\xab\\x41\\x0e\\xc4\\xd0\\x99\\xc8\\x87\\x3a\\x81\\xc1\\x35\\xe0\\x1f\\x65\\x67\\xd6\\x1f\\x47\\xf0\\x9c\\x29\\xcd\\xc9\\x22\\x83\\x55\\xa9\\x46\\xb6\\x46\\xd0\\x0f\\xe7\\x2c\\xc1\\xab\\x08\\xd6\\x78\\x03\\x48\\x4e\\xcd\\x69\\x85\\x2f\\x86\\x0f\\x31\\xb2\\xea\\x9e\\xa4\\x1a\\xfc\\xb4\\x67\\x82\\x03\\xb1\\x23\\x03\\x67\\xe3\\xf2\\xa9\\x63\\xed\\x81\\xcc\\x1f\\xda\\x06\\x96\\xb9\\xcf\\xa7\\x10\\xc7\\xb8\\xf3\\x34\\xea\\x2f\\x1a\\x83\\x67\\x8b\\xb2\\x47\\x38\\xb7\\x7c\\xb1\\xc6\\x8f\\x71\\x46\\x36\\xb8\\x93\\x15\\xe2\\xd9\\x59\\x8f\\xd4\\xed\\x1d\\x86\\x00\\xa2\\x67\\x26\\x60\\xaf\\x66\\x04\\x4d\\x5c\\x32\\x72\\xa6\\x7d\\x9f\\xc9\\x66\\x6d\\x32\\x74\\x93\\xfb\\x21\\xe6\\x71\\xcd\\x69\\xfb\\x58\\xcd\\x40\\x3e\\xdb\\xe0\\x71\\x42\\x31\\x4e\\xe5\\xe0\\x37\\x37\\x73\\x07\\xef\\xf0\\x9c\\x61\\x9b\\xb8\\x5c\\x34\\x45\\x49\\xc2\\x53\\xa0\\x00\\x98\\x5e\\xf1\\x6e\\xcc\\x76\\xd1\\x32\\xd5\\x27\\xbd\\x4f\\x38\\xf6\\x77\\x12\\x83\\x06\\x31\\xa3\\x5b\\xbe\\x88\\x88\\xb7\\x4b\\x2f\\xe4\\xa2\\x51\\x46\\x4b\\x56\\x6c\\x64\\x28\\x04\\xf4\\xac\\xa0\\x60\\x04\\x7b\\x8f\\xb7\\xac\\xb8\\x4a\\x37\\x10\\xfd\\x60\\x47\\xc0\\xd9\\x64\\x98\\x32\\xde\\xbf\\xd7\\x83\\x48\\x7a\\xaf\\x79\\x5a\\x76\\x29\\x3b\\x6f\\x24\\x6a\\x9e\\xa1\\xc4\\xe7\\x77\\xf9\\x30\\xdb\\x66\\x64\\x87\\xab\\x25\\x87\\x2c\\x69\\xb9\\x0e\\xae\\x86\\x98\\x92\\xaf\\x64\\x76\\x38\\x3b\\x96\\xd4\\x9e\\xe9\\xef\\x11\\xe7\\x1d\\xdf\\x82\\xe9\\x04\\xf3\\xed\\xa4\\xbd\\x2d\\xd4\\xdc\\x3f\\xfb\\x7b\\x6c\\xef\\x2f\\x43\\xbb\\xb5\\x66\\xdb\\x0f\\x43\\xd7\\x2a\\x0f\\xc1\\xed\\x98\\x20\\xf6\\x7d\\xbf\\x53\\xe5\\x5e\\x07\\xf8\\x88\\x74\\x80\\xfb\\x55\\xe7\\x36\\xad\\x3a\\xfb\\x2d\\x32\\x8d\\x25\\x38\\x3c\\xfd\\x9b\\xaa\\x43\\x93\\x5f\\x19\\xdb\\xc3\\x20\\x55\\xcd\\xc1\\x65\\x4a\\x7a\\x11\\x02\\xd6\\x28\\x59\\x73\\x08\\xa2\\xee\\x98\\xb1\\xaf\\x4f\\x7a\\x0d\\x73\\x79\\xc2\\xb9\\xf9\\x1a\\xb3\\x2c\\x88\\x08\\x3f\\xde\\x91\\xcd\\xd5\\x63\\xf9\\xd0\\xb6\\xbe\\x91\\xbb\\xdd\\x40\\x08\\xe9\\x3b\\xae\\x37\\x07\\x00\\x92\\x8f\\x55\\xbf\\x1e\\x0d\\x1f\\xd5\\xe4\\xeb\\x46\\x02\\xf0\\x5d\\xa7\\x7d\\x58\\x41\\x18\\xab\\x16\\xf3\\x76\\x78\\x13\\xfc\\xd3\\xbe\\x01\\xea\\x9b\\xde\\x9f\\x61\\x1b\\x5e\\xd7\\xdf\\x60\\x07\\xd8\\xad\\x33\\x04\\xb1\\xe3\\xd7\\xf1\\x51\\x98\\x51\\xeb\\x58\\x6a\\x3c\\x49\\x23\\x25\\x73\\x9e\\x6e\\x7c\\x38\\x9b\\x62\\x97\\x7f\\xe4\\xa9\\x30\\x26\\x6c\\xdd\\xe5\\xd8\\x1d\\x9e\\xf6\\x6c\\x96\\x01\\x23\\xac\\xa1\\xc1\\x04\\xff\\x81\\x6d\\xa6\\xe7\\xa2\\x06\\xb8\\x9b\\xec\\x14\\x99\\x6f\\xd7\\x82\\xcd\\xd1\\xb7\\x3c\\x1c\\x8d\\x71\\xb7\\xb1\\x32\\x12\\xb0\\x03\\x61\\x3d\\xe9\\x2f\\x02\\xfa\\x39\\x8a\\x93\\x37\\xc2\\x98\\x0e\\x68\\x6d\\x79\\x43\\x7f\\xda\\x16\\x01\\x3f\\x76\\x1b\\xc4\\xc2\\xb4\\x79\\xa0\\xf5\\x1d\\x5d\\x93\\x8b\\xb4\\xa8\\x19\\xfe\\xa1\\x7b\\xa6\\x25\\xcb\\x98\\xef\\x58\\xcb\\x52\\x07\\x21\\xbb\\x4f\\x7c\\x4a\\xbe\\x47\\x43\\x44\\x66\\xc2\\xc8\\x2a\\x5a\\x74\\xd0\\x37\\xb5\\x8d\\x70\\x58\\x5e\\x13\\x07\\x16\\xff\\x1d\\x7c\\xb0\\xa4\\xd0\\xfc\\x59\\x70\\xb5\\x26\\x08\\x0d\\xd4\\x04\\x34\\xff\\xe4\\xbf\\xc3\\xa6\\x31\\xd4\\x1c\\x64\\xfc\\xf1\\x76\\x9b\\xa5\\x54\\x3c\\xce\\xa5\\x13\\xc3\\x40\\x75\\x40\\xd3\\x76\\x4b\\xe3\\x74\\x99\\xd2\\x24\\x2a\\x69\\x26\\x4e\\xd4\\x8f\\x0d\\x18\\x8c\\xae\\xd2\\x92\\x63\\x45\\x35\\x06\\x23\\x5a\\x21\\x9a\\x95\\xb0\\x5d\\x44\\xb9\\xba\\x59\\x45\\x19\\x94\\xf2\\x05\\x04\\xd5\\x91\\xb2\\xde\\x02\\x9d\\x06\\x88\\x2d\\xc9\\x73\\x68\\x0e\\x6e\\x1e\\x20\\xa3\\xef\\xde\\x31\\xf4\\xe4\\x86\\x98\\xd3\\xe8\\xdf\\x73\\xf5\\xf9\\x1b\\x3e\\x90\\xbf\\xe5\\x32\\xba\\x28\\xd2\\xc4\\x78\\x85\\xc9\\xf6\\x2c\\x99\\xa0\\xba\\xc4\\x53\\x11\\x41\\xa1\\xd0\\x97\\x62\\x0a\\x1a\\x14\\xd2\\x1e\\xa4\\x8b\\x55\\xbb\\x2d\\x8d\\x9e\\xc1\\xe9\\x41\\x94\\x93\\x8d\\xb8\\xd6\\x51\\x55\\x24\\x5e\\xcb\\xb7\\x1a\\x1a\\xd8\\xf6\\xe6\\x4d\\x85\\xe7\\x4d\\xc8\\x71\\x0b\\xa0\\x10\\x74\\xf8\\x64\\x01\\x32\\x98\\x01\\x0d\\xca\\x38\\x3c\\x6e\\x40\\x06\\xa5\\x65\\x81\\xdf\\x62\\x54\\x0d\\x5b\\x19\\x65\\xe7\\x8e\\x40\\xcd\\x0d\\x0c\\xce\\x34\\x8e\\x1b\\x74\\x81\\xf8\\xc8\\xc4\\x0a\\x13\\xee\\x06\\x48\\x24\\x03\\xc8\\x2c\\x08\\xe1\\x67\\x8f\\xcb\\x01\\x23\\xf0\\x5a\\xc0\\xc8\\xbe\\x2d\\x58\\xba\\xe2\\x06\\xd9\\x3f\\xc7\\x11\\x2d\\x45\\xd5\\xac\\x94\\xdd\\x39\\x0f\\x3f\\xef\\xf7\\xeb\\x2c\\x3c\\xd3\\x91\\xd7\\x12\\x2e\\x28\\x6c\\x61\\x5e\\xfb\\x40\\xd6\\xde\\xa3\\xf7\\x42\\xb0\\xba\\xa4\\x71\\x74\\xea\\x89\\xc5\\x09\\xeb\\xc4\\x60\\xf4\\xee\\x9e\\x6c\\x84\\x10\\x81\\x26\\x30\\x9e\\x0b\\x4d\\x88\\x5a\\x74\\xcf\\x21\\x7a\\x96\\x64\\x59\\x71\\x49\\xd5\\xe1\\x19\\xee\\xf8\\x83\\xf3\\x50\\x68\\xcc\\xd3\\xfb\\x53\\xe1\\x44\\xc1\\xf6\\x51\\xba\\x84\\xb0\\x47\\x57\\x22\\x46\\x74\\x0a\\xfb\\x70\\xba\\xfb\\x0f\\x55\\x59\\x6e\\x31\\x4f\\x23\\x9c\\x4a\\x79\\x1d\\xb8\\xeb\\x7e\\x79\\x20\\xf4\\x6c\\xbc\\x63\\xc2\\x0d\\x83\\x3a\\x4b\\xf8\\x06\\x1c\\x91\\xe4\\xf7\\x9a\\x2f\\xe0\\x09\\xdc\\x36\\xc9\\xd5\\x7e\\xe8\\xeb\\xd3\\x09\\xb9\\xa1\\x24\\xea\\xd0\\x6e\\xe3\\x1a\\x24\\xd6\\x3f\\xb1\\xa8\\xa9\\x6e\\x64\\x73\\x93\\xcf\\x42\\x67\\x6f\\x4c\\xf7\\x5d\\xe1\\x19\\xce\\x2f\\x51\\x38\\xd1\\x57\\x26\\xd1\\x4d\\x9f\\xed\\xd9\\x69\\xbf\\x1e\\xa8\\xd3\\x26\\xa4\\x98\\xf8\\xf5\\x43\\x76\\xda\\xaf\\x7b\\x77\\xda\\x0e\\x3b\\xed\\xd7\\x11\\x9d\\xb6\\x73\\x76\\x9a\\x5e\\x2d\\x34\\x98\\x14\\x74\\xf8\\x21\\x05\\xf8\\xd9\\x15\\x8d\\x6b\\xbe\\xaa\\xa3\\xc2\\xbf\\xa1\\xd5\\xba\\x48\\xbc\\x8a\\xa7\\x3a\\xf9\\xbf\\xd7\\x2e\\xc3\\xb5\\x4b\\x61\\x1a\\x4d\\x54\\x58\\xa4\\x0a\\xe5\\xbf\\x22\\xd7\\x8b\\xfb\\x83\\x36\\xd3\\xb7\\xb7\\x20\\x9c\\x16\\xbc\\xf0\\xe3\\x0c\\xb0\\xf6\\xcf\\xb6\\x70\\x94\\x83\\xda\\xe6\\xe3\\x49\\x64\\x8b\\xc6\\x67\\x4d\\xf0\\x69\\xcf\\x9c\\xf5\\x04\\x9e\\xbe\\xa0\\xc5\\x8a\\x91\\xed\\x7a\\x87\\x7f\\xe8\\xda\\xe9\\xbc\\xcc\\x67\\xa2\\x77\\x8b\\x6d\\x72\\xfa\\x3c\\x8a\\x19\\x15\\x09\\x1d\\xc1\\x64\\x5e\\x49\\x5c\\x69\\x2c\\x5e\\x93\\x5e\\x89\\x7c\\x8f\\x7e\\x15\\x16\\x6a\\x62\\xb4\\x16\\xff\\x3d\\x64\\xa4\\x37\\xd8\\xe2\\x94\\xc5\\x9c\\x81\\x06\\x81\\x3f\\x92\\x12\\x2b\\x03\\x8e\\x27\\xf8\\x69\\x10\\x4b\\xb1\\xd9\\xc2\\xba\\x23\\x6c\\xec\\x35\\x15\\x61\\x80\\x78\\xa9\\xb4\\x58\\x36\\x47\\x35\\x4b\\x4e\\x4a\\xcd\\xfc\\xf1\\x0a\\xd0\\x66\\x26\\x2b\\xaa\\xde\\x0b\\x3b\\x6e\\xd1\\x69\\x00\\x8d\\xb6\\xaa\\x13\\xfa\\x20\\x2b\\xf2\\x15\\x7e\\x8a\\x16\\x32\\xd0\\x82\\x7f\\xb8\\xc2\\xe3\\x8a\\x31\\x54\\x61\\xe3\\xd2\\x4e\\x17\\xe4\\x0d\\x9e\\x26\\x9f\\x98\\xc2\\x3d\\xdc\\x34\\x19\\x2b\\x23\\xd5\\xce\\x45\\xcf\\x18\\x6a\\x56\\x30\\x3e\\x1e\\x10\\x16\\xc3\\xf1\\x4d\\x45\\x72\\x3e\\x88\\x17\\xb4\\xba\\xa4\\x9c\\x94\\xea\\xb2\\x10\\x17\\xa8\\xfd\\xc1\\x7b\\xaa\\xdd\\x8c\\xb4\\x14\\x1c\\x47\\x8b\\x8e\\x7a\\x19\\xd6\\x83\\x7a\\x2e\\x81\\x3e\\x11\\x5c\\x69\\x2e\\xc0\\xa9\\x22\\x48\\xe6\\x03\\x25\\x0e\\x8d\\x38\\xf1\\x51\\x36\\xab\\x02\\xee\\x49\\x0c\\x0c\\x36\\x9a\\xaf\\xf8\\xd4\\xc5\\x4e\\xc4\\x9b\\xf2\\x32\\xc5\\x74\\x21\\xae\\xa7\\xc3\\x5c\\xaa\\x37\\x4b\\xca\\xd7\\x62\\x2e\\x5c\\xac\\xc5\\xc9\\xda\\xad\\x06\\xf2\\x0f\\x08\\xa8\\x13\\xa7\\x82\\x9a\\xf4\\xd0\\x33\\x09\\x61\\x89\\x76\\x83\\x44\\x1c\\x3e\\x12\\x6e\\x2e\\x5c\\x6a\\x7f\\xf5\\x07\\x87\\x36\\xd5\\x66\\xbc\\xd5\\x69\\xf4\\x86\\x5c\\xbe\\x6e\\xfe\\x04\\xeb\\x50\\xf3\\xe5\\x10\\x84\\x6d\\xea\\x4a\\x44\\x46\\x4d\\x21\\xf0\\x15\\x6f\\xcc\\x17\\x37\\xa0\\xf3\\xb9\\xf2\\x77\\xbb\\xc9\\x95\\xb5\\x87\\xa8\\x86\\x5e\\x7c\\x9c\\x41\\xe0\\x4b\\x44\\xff\\xa8\\x49\\xf6\\x40\\xa4\\xda\\x2d\\x72\\x58\\xb5\\xc3\\x28\\x24\\xd8\\x7c\\x36\\x4a\\x58\\x04\\x47\\x59\\x51\\xa6\\x55\\x83\\x5e\\x97\\x96\\x1c\\x5e\\x6f\\xf3\\x14\\xf4\\xf4\\x39\\xe7\\x64\\x20\\xca\\x56\\xd0\\xf0\\xb6\\x24\\xe3\\xc8\\x40\\x7b\\xf5\\xcf\\x94\\x77\\xcb\\x9a\\xaf\\x59\\x9a\\x00\\x42\\x59\\x57\\x6d\\x9f\\x41\\x53\\xb8\\xbd\\xe8\\x3a\\xcd\\x70\\xd1\\x04\\x3f\\xfd\\x81\\x37\\x2e\\xbe\\xa9\\xc7\\x45\\x2a\\xd6\\xad\\x6a\\x0a\\x1b\\xaa\\xed\\x4d\\x31\\x22\\x86\\x1e\\xff\\x1f\\x0f\\xe0\\xb3\\x50\\x16\\xb0\\xd9\\x13\\xd5\\x6a\\x22\\xf1\\x33\\xae\\xac\\x7c\\xd9\\x9e\\x82\\xf2\\x6f\\x5f\\x69\\xce\\xbd\\x83\\x30\\x36\\xa1\\x77\\xb0\\xe1\\xfe\\x3d\\xf3\\x61\\x98\\x53\\x13\\x68\\x46\\x4e\\xde\\x9d\\x90\\x13\\x39\\xb9\\x8f\\xc6\\xf2\\xba\\xd7\\x64\\xba\\x56\\x4e\\xa1\\x03\\xb9\\x6d\\xc8\\x3b\\x62\\x55\\x67\\x84\\x45\\xb3\\x2d\\xee\\xe9\\x31\\xe1\\x06\\xc9\\xff\\xfd\\x3f\\xc1\\x8c\\x1a\\x60\\x6e\\x6a\\xb6\\xad\\xf2\\x62\\x33\\x66\\xad\\x57\\xf5\\x6f\\x8a\\xde\\x56\\xc1\\x7c\\x45\\x59\\x0c\\x1b\\x5c\\x28\\xe5\\x1b\\x59\\xff\\xe6\\x17\\x68\\x6e\\x56\\xad\\x5b\\xcb\\x28\\x8c\\x7a\\xbd\\xcd\\xcd\\x73\\x00\\xfe\\x12\\x3a\\x96\\x85\\x4e\\xa3\\x9b\\xe2\\x01\\x9d\\xfb\\x17\\x7c\\x45\\xa2\\xa3\\x07\\x50\\xdb\\xf4\\xd5\\x0d\\x0e\\x25\\xbe\\x40\\x42\\x60\\x06\\x57\\xa0\\xb8\\x3d\\xfe\\x9f\\xf3\\x9f\\x7e\\x8c\\x8a\\x05\\x00\\x92\\x61\\x83\\xb4\\xd8\\xd0\\x8a\\xed\\x40\\x4d\\xa7\\x64\\xe0\\x22\\x10\\x56\\x99\\x89\\xe6\\xa7\\x0a\\x9c\\xee\\x34\\x9a\\x63\\x8d\\xe6\\x98\\xd6\\x4b\\x98\\x77\\xd1\\xe0\\x46\\x79\\x1a\\xd7\\xc2\\xe8\\x7e\\xa1\\xbe\\xec\\x05\\x90\\xab\\xda\\x8f\\x59\\x2c\\xe0\\x89\\xcf\\x7b\\x80\\x63\\x45\\x45\\x84\\x05\\x20\\x3f\\x74\\xac\\xa8\\x37\\xf2\\x8f\\x61\\xae\\x4c\\xf0\\x5b\\x0c\\xba\\x49\\xde\\x60\\xa4\\x9f\\x38\\xcb\\x47\\xd7\\x08\\x78\\xe7\\x94\\x69\\xa5\\x94\\xdf\\x8e\\xcd\\xec\\x23\\xbf\\x63\\x47\\xb5\\xee\\x3d\\x61\\x54\\x85\\xbd\\x79\\x61\\xdc\\x84\\x58\\x8d\\x9e\\xdc\\xfe\\x5b\\xfc\\x76\\x87\\xda\\x2a\\x1c\\x9b\\x05\\x23\\x72\\x3e\\x30\\xd9\\xec\\x78\\x47\\x70\\xe9\\xc2\\xab\\xb3\\xdb\\xb5\\xbf\\x7a\\x6e\\xab\\xa1\\x09\\x6d\\x88\\x9e\\x5b\\xd2\\x09\\x65\\x98\\xc6\\x8c\\x5e\\xf9\\xd3\\xbb\\xc9\\x3a\\xe1\\x02\\x17\\x01\\xa6\\x70\\x89\\x72\\xfe\\xf3\\x0b\\x31\\xf0\\xe4\\x98\\x4b\\xf3\\x8b\\xe2\\x1d\\xb7\\xb4\\x30\\x8b\\x1a\\xf5\\xb9\\x6b\\x5c\\x12\\x71\\x0c\\x35\\x37\\x31\\x25\\x78\\x91\\xfb\\x1c\\x63\\x60\\x09\\x33\\xe7\\x87\\xdd\\x75\\xe8\\xa2\\xa5\\x11\\xcc\\x13\\xf1\\x61\\x52\\xbf\\x3c\\x11\\x5e\\x10\\x49\\x84\\xe8\\x63\\x48\\xc0\\xc7\\x97\\x1b\\xaf\\x29\\x65\\xf1\\xf1\\xf5\\x9c\\xcc\\xc1\\xd8\\x94\\x37\\xcc\\x3b\\x0c\\x1c\\x1e\\xb3\\xe9\\x58\\x75\\x77\\xa2\\x0f\\xb3\\xdd\\x73\\x18\\x80\\xd7\\x1c\\xf3\\x98\\x10\\x07\\x76\\x30\\x19\\x66\\x2d\\xbc\\x62\\x6a\\x00\\xfa\\x2d\\x7f\\xac\\xea\\xce\\x5c\\xe6\\x9b\\x09\\x65\\xe7\\x28\\x41\\x50\\x11\\x3a\\xd8\\xc7\\xc5\\xaa\\xb4\\x83\\x5d\\xb0\\x5a\\x97\\x5c\\xcc\\x1a\\xbf\\x18\\x47\\x8c\\x43\\xff\\x55\\x9d\\x55\\xe9\\xeb\\x0e\\xfb\\xfd\\x00\\x2f\\x81\\x3c\\x88\\xd4\\x5e\\x56\\xa2\\xfe\\x4c\\xb8\\xcd\\x64\\xdb\\xf6\\x36\\x7b\\xea\\x28\\xdf\\x0c\\xf7\\xe6\\x8c\\x92\\xeb\\x4e\\x77\\xe8\\x2c\\xe8\\x2a\\xcd\\x5f\\xcb\\xb3\\x88\\xde\\x88\\xde\\x14\\x17\\xf4\\xbc\\x98\\x5d\\xb5\\x36\\xe6\\xae\\x1b\\xa4\\xd9\\xad\\x0e\\x8e\\xd3\\x11\\xd5\\x09\\x57\\x6c\\x6c\\x75\\x8f\\xa3\\x6e\\x67\\x1e\\x77\\x12\\x42\\xa9\\xbf\\xb5\\x99\\x98\\xdc\\x18\\xe2\\xac\\x28\\xa9\\x95\\x3b\\xaf\\xa4\\xc4\\x29\\x8b\\x11\\x4a\\x7c\\x72\\x72\\x42\\xd8\\x4a\\xbb\\xcf\\x2c\\x15\\xc9\\x47\\x86\\xfd\\xe2\\x3a\\xe7\\xf3\\x87\\x9a\\xcc\\x54\\x43\\x4d\\x21\\xb3\\x1d\\xdb\\x74\\xea\\x9a\\x34\\x19\\x89\\x7a\\x6c\\xed\\xbb\\xbb\\xc1\\x61\\x92\\xfb\\x0d\\xe3\\xd9\\x32\\x3e\\x35\\x5c\\x99\\x78\\xbd\\xb8\\xb4\\x96\\x81\\xf8\\xbc\\x17\\xb6\\x95\\x4e\\x6e\\x76\\xae\\xab\\x3b\\x61\\x44\\x97\\x5a\\xa9\\xd9\\x75\\x45\\x5d\\x41\\x15\\x67\\x7b\\xea\\x8c\\x6a\\x9a\\x79\\xce\\x9e\\xb0\\xdc\\x0c\\xf0\\x11\\x63\\xce\\x6e\\x54\\x74\\xa5\\xbd\\x49\\xf3\\x82\\xb9\\xe3\\xa9\\xae\\x13\\x33\\xf9\\xfd\\x86\\x30\\x73\\x53\\xce\\x79\\xe1\\xf6\\x3a\\xc5\\x3c\\xbf\\x01\\xbc\\x20\\xe4\\x1b\\xc0\\x7b\\xd8\\x49\\x3c\\x88\\xd2\\x3f\\x8f\\x85\\x2d\\x1c\\x3a\\x8d\\x9b\\xe3\\x4d\\x07\\x95\\x53\\x92\\xe7\\xa9\\x36\\x42\\x19\\xb4\\x5b\\xe7\\x5d\\x01\\x4e\\x49\\x81\\xd7\\xcd\\xbf\\x15\\x82\\xe5\\xd0\\xdd\\xe4\\xc7\\xe8\\x4f\\x8f\\x21\\x1c\\x37\\x7f\\x19\\xd6\\x9c\\x7a\\x6d\\xa0\\x74\\x0f\\x55\\x3d\\xbc\\x27\\x6c\\xd3\\xee\\xb8\\x9a\\xcc\\x71\\x91\\x91\\xcd\\x22\\x21\\x1d\\x4f\\x79\\xef\\x26\\xa8\\x49\\x82\\xb8\\x18\\x74\\xe6\\xd2\\x66\\xfa\\x8d\\xbc\\xde\\x12\\x27\\x69\\x56\\x71\\x0c\\x12\\x85\\xc6\\x40\\x40\\x7d\\x74\\xf4\\x0c\\xec\\xf0\\xf6\\x6b\\x3a\\x36\\x0f\\x91\\xd3\\x97\\xf7\\xa8\\x67\\xa8\\x51\\xa7\\xd3\\xd0\\x83\\x34\\x2b\\xe2\\xc9\\x48\\x21\\xde\\x28\\xcb\\x68\\x36\\x90\\xcf\\xf4\\xe0\\x78\\xbd\\xa1\\xe8\\x03\\x78\\xfb\\xbd\\x18\\x88\\xd4\\x79\\x73\\xc1\\x3b\\xbf\\xcd\\x20\\xfe\\xd0\\xee\\xcc\\xd2\\xed\\x61\\x72\\x9e\\x8e\\x40\\x78\\x68\\x25\\x22\\x74\\x14\\x1d\\x74\\xf1\\x0c\\xed\\x4d\\xe1\\xa0\\x56\\xfe\\xe8\\x33\\xcd\\x21\\x2d\\x3e\\x84\\xad\\x31\\xa2\\xae\\x41\\x37\\x0e\\x31\\x87\\x95\\xf5\\xa7\\x7e\\xf7\\xad\\xef\\xfa\\x06\\xc5\\x76\\x0e\\x86\\xd7\\xcc\\x59\\xfc\\x4c\\x5c\\x83\\xed\\x17\\xca\\xe0\\x18\\x4f\\x73\\x59\\xc3\\x09\\x01\\x0f\\xc0\\x68\\xbf\\xcc\\xbb\\x07\\xc8\\x45\\xab\\xb9\\x25\\xfa\\x98\\x31\\xb2\\xc3\\x3b\\x58\\xbd\\x1d\\xc1\\x36\\xe5\\xfb\\x1e\\x70\\xf8\\x91\\x37\\x44\\x03\\x5b\\x84\\xed\\x02\\x32\\x68\\x65\\xdc\\x3e\\x65\\x1b\\x4e\\x96\\xb8\\x47\\x3c\\x18\\xf9\\x44\\x23\\xa0\\x0d\\x7b\\xdc\\x0c\\xc4\\x3d\\x9a\\xa3\\xe7\\xa2\\x60\\x45\\x5e\\xa4\\xdf\\x9c\\x7f\\x0b\\x1d\\xf1\\x73\\xf3\\x6d\\xc8\\xef\\xa5\\x47\\x56\\xc9\\x56\\x5c\\x07\\x23\\x2b\\x08\\x09\\x55\\x6e\\xff\\xd6\\x5d\\x12\\x10\\x9f\\x26\\x09\\x99\\x41\\x4f\\xa4\\x31\\x6c\\x95\\x3f\\x8b\\x4f\\x62\\x72\\x8b\\xb1\\x34\\x2e\\xe2\\xeb\\x29\\xcd\\x48\\x9d\\x93\\x1d\\x5f\\xc1\\x53\\x71\\x38\\xdd\\x09\\xc9\\x19\\x45\\x5e\\x22\\x61\\x35\\xf4\\x9d\\x4d\\x26\\x50\\xbb\\x8e\\xf9\\x47\\x4d\\x12\\x3e\\xa7\\xa9\\x88\\x74\\x84\\xc7\\xc1\\xf9\\x68\\x86\\xe0\\xb3\\x00\\x8a\\x54\\x5b\\x99\\x8d\\x0f\\x3f\\xcb\\x60\\xaa\\x61\\x67\\xa9\\x71\\x25\\xb4\\x43\\x47\\x57\\x36\\x93\\x48\\x12\\x75\\x4f\\x85\\x57\\x0d\\xa2\\xf9\\xae\\xb4\\x20\\x86\\x9d\\xf6\\xf9\\xea\\x2b\\xed\\xef\\x7a\\x68\\x83\\xe2\\xe8\\xf6\\xb1\\x72\\x99\\x26\\xd5\\xba\\xa5\\x7a\\x4d\\xd3\\xd5\\xba\\x9a\\x40\\xb9\\x7e\\x72\\x26\\x12\\x8c\\x34\\xf4\\xa9\\x31\\x26\\xb3\\x12\\x26\\x49\\x2a\\xb3\\x33\\x89\\xbb\\x02\\xa5\\x8c\\xa5\\xa7\\x5e\\x67\\xba\\x5c\\x7e\\xfd\\x13\\x6a\\x70\\xb4\\x62\\x24\\xa0\\x92\\xed\\xba\\xce\\xb2\\x28\\x23\\xbb\\x82\\x13\\x2b\\x92\\x8a\\x42\\xfe\\x17\\xba\\x24\\x75\\x56\\x81\\x87\\xb5\\xe2\\xba\\xbc\\x5f\\xac\\x00\\x01\\x06\\xec\\xf7\\xfc\\xb7\\x11\\x9d\\x8f\\x45\\x76\\x62\\x9b\\xcf\\x61\\x8b\\xb0\\xac\\x6e\\xec\\x11\\xa2\\x83\\x86\\x53\\xf3\\xe8\\xfd\\x82\\xea\\x8d\\x4a\\x2b\\x26\\x69\\xf3\\xb1\\x87\\xf5\\xcf\\xfa\\x3a\\x84\\x3f\\xbf\\x08\\xf6\\x84\\x41\\xad\\xe4\\x61\\x1c\\xb9\\x65\\xba\\xca\\xe5\\xc1\\x8e\\x20\\x3a\\x2d\\xd5\\x30\\xf0\\x52\\x0d\\x07\\x3d\\xc1\\x51\\xab\\x0a\\x21\\x81\\xa0\\xdf\\x07\\x34\\xa3\\x1b\\xbc\\x9c\\x87\\x63\\xb7\\x49\\x08\\xa3\\xae\\x65\\xeb\\xb1\\xd3\\x3a\\x39\\x61\\x81\\xd3\\x23\\x82\\xa5\\x9f\\x70\\x8d\\x52\\x0a\\xa1\\x16\\x51\\x04\\x12\\x53\\x44\\x56\\x24\\x85\\x97\\xeb\\x42\\xa5\\x01\\xba\\xe9\\x4c\\x02\\x69\\xe6\\x89\\x6d\\xc6\\x0c\\xa4\\xd1\\xd0\\x17\\xe4\\xf1\\xb9\\x00\\x0e\\xb4\\x8c\\xcd\\x6e\\xc1\\x52\\x7a\\x07\\x76\\x83\\x7d\\x76\\x81\\x0e\\x20\\xeb\\xa5\\x49\\x91\\x30\\x7e\\xe0\\x09\\x31\\xf1\\x64\\xa4\\x78\\x31\\xd2\\xcc\\x0e\\xdf\\xdb\\xfe\\xbb\\xb6\\x48\\xe7\\x9b\\xf5\\x06\\xe0\\x07\\xa5\\xa0\\x94\\x69\\xc8\\xed\\x53\\x1b\\x4b\\xe1\\xbf\\x8e\\x16\\xee\\x55\\x70\\x68\\x93\\x8a\\xc7\\x65\\x35\\xca\\x1a\\xaa\\x17\\x3b\\x76\\xa3\\x13\\x74\\xc8\\xfc\\x1e\\xce\\x75\\x91\\x24\\x6a\\x2c\\x8a\\x93\\x60\\x79\\x94\\xa8\\x06\\xa6\\x3f\\x98\\x39\\x49\\x94\\x07\\x01\\x07\\x9e\\xd5\\x8c\\xba\\xe0\\x36\\x69\\x35\\xe3\\x86\\x7f\\xb6\\x20\\xf1\\x3b\\xe5\\x47\\x0c\\x37\\xa9\\xc4\\x51\\xe7\\x5f\\xe6\\x30\\xb5\\x6d\\x06\\xbb\\x71\\x3b\\x5b\\x6b\\x4d\\x04\\xac\\x7f\\x63\\xcc\\x09\\x88\\x31\\xf2\\xcf\\x57\\x71\\x47\\xf0\\x7c\\x9c\\x6a\\xfe\\xa4\\x73\\xe1\\x86\\x6c\\xd7\\x60\\x01\\xbf\\x2b\\x1b\\x02\\x0e\\x40\\x18\\x02\\xec\\x50\\xf7\\x12\\xd5\\xa9\\x93\\x17\\x80\\xef\\x25\\x2f\\x1d\\x47\\xa6\\xb0\\x6c\\x32\\x7a\\x50\\x22\\x1b\\xa0\\x1d\\x42\\x5d\\x73\\x6b\\xc2\\x3d\\xf0\\xab\\x43\\xbc\\x5a\\x7f\\xee\\x7d\\x61\\x38\\x90\\xa2\\xf9\\x48\\x8a\\x2c\\x20\\xae\\xf9\\x5d\\xe1\\x73\\x6f\\xa8\\x80\\x6e\\xb0\\xef\\xc3\\xf2\\x1e\\xaf\\x02\\xab\\x87\\x80\\xf7\\x7a\\x19\\x58\\xb6\\x39\\xb5\\x73\\xa6\\xd7\\x0d\\xd8\\xcd\\x06\\xde\\xba\\xbe\\x75\\x83\\x2f\\x94\\xa2\\x3b\\x34\\xf8\\x76\\x77\\x61\\xf0\\xf9\\xbd\\xd8\\x03\\xb7\\xbe\\x79\\x5b\\xa9\\x96\\x8c\\x7c\\x71\\xd8\\xee\\x13\\x1f\\xc8\\x49\\xe3\\xc5\\xe6\\x96\\xaf\\x4c\\x60\\xd2\\x48\\x77\\x2c\\xd1\\x56\\x47\\x7d\\x98\\x70\\x85\\x0a\\x38\\x56\\xac\\xd0\\x6a\\xb4\\x3c\\xc7\\x4a\\x13\\x90\\x1c\\xe3\\xb5\\x17\\x3e\\xca\\x68\\x2e\\x03\\xd6\\x35\\xe1\\x88\\x68\\x26\\x8c\\x80\\x86\\xcb\\x92\\xb3\\x2f\\x8e\\xbf\\x38\\x1a\\x25\\x77\\xc0\\xd0\\x48\\x3d\\x9c\\xa7\\x9e\\xda\\x3c\\x2c\\x6a\\x9f\\xfe\\x06\\x4e\\x9a\\x5e\\xba\\xc5\\x50\\x07\\x0d\\xfc\\x5c\\x8f\\xb5\\xd3\\x6b\\xf0\\x21\\x0c\\x1c\\x0f\\x52\\xe5\\xa0\\xe7\\xa2\\x4c\\x68\\x9c\\xc1\\x23\\x26\\x17\\x84\\x45\\xc9\\xd7\\x98\\x57\\x04\\x1e\\xb8\\x7a\\xd4\\x96\\x48\\x4f\\xfd\\xa7\\xc9\\xd7\\x9f\\x4a\\x32\\xa5\\xd8\\xff\\x83\\x37\\x78\\xc4\\x61\\xfc\\xbf\\x00\\x00\\x00\\xff\\xff\\x4e\\xc4\\xb8\\x78\\x7a\\xc5\\x01\\x00\")\n\nfunc uiTsTypingsD3D3DTsBytes() ([]byte, error) {\n return bindataRead(\n _uiTsTypingsD3D3DTs,\n \"ui/ts/typings/d3/d3.d.ts\",\n )\n}\n\nfunc uiTsTypingsD3D3DTs() (*asset, error) {\n bytes, err := uiTsTypingsD3D3DTsBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/ts/typings/d3/d3.d.ts\", size: 116090, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiTsTypingsJqueryJqueryDTs = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\xec\\xbd\\x6b\\x73\\xdc\\xc6\\xb1\\x30\\xfc\\x5d\\xbf\\x02\\xc5\\x4a\\x95\\x96\\x7e\\x96\\x54\\x7c\\xce\\x79\\xea\\xe4\\x50\\x8e\\xf5\\xd0\\x14\\x6d\\x33\\x91\\x44\\x1d\\x91\\x8a\\x9d\\x72\\xb9\\xde\\x02\\x17\\xb3\\x24\\x2c\\x2c\\xb0\\x01\\xb0\\xa4\\x18\\xdb\\xff\\xfd\\xed\\xdb\\xdc\\x70\\x5b\\xec\\x95\\x5c\\x59\\xf9\\x10\\x53\\x0b\\x60\\xa6\\x6f\\xd3\\xd3\\xdd\\xd3\\xd3\\xfd\\xec\\x59\\x70\\x79\\x3f\\x55\\x41\\xa4\\xc6\\x71\\x1a\\x97\\x71\\x96\\x16\\xc1\\x38\\xcb\\x83\\x5f\\xfe\\x77\\xa6\\xf2\\xfb\\xe0\\xcb\\xc3\\x2f\\xff\\x7c\\xf8\\x31\\x78\\x16\\xfc\\xc7\\x21\\xfc\\xf7\\x09\\xbc\\xfd\\x36\\xcf\\x7e\\x51\\xa3\\xf2\\x28\\xb8\\x29\\xcb\\xe9\\xd1\\xb3\\x67\\xbf\\xfc\\x0b\\x5f\\x3c\\x1c\\x65\\x93\\x67\\xf8\\xf8\\xa5\\x33\\xce\\xd5\\xfd\\x51\\xf0\\x4d\\x96\\xc7\\x45\\xf0\\xcf\\x30\\xfd\\x90\\xdd\\x06\\x5f\\xe1\\x37\\x05\\x7c\\x74\\x1d\\x97\\x37\\xb3\\x2b\\xfa\\xe8\\x0a\\x5f\\xb8\\xa7\\xe7\\xcf\\xbe\\x1e\\x06\\x27\\x37\\xf0\\xcf\\x32\\x0e\\xd3\\xe0\\xfb\\x6c\\x3c\\x9e\\x28\\xf8\\x87\\xca\\x1b\\x3f\\x1c\\xdd\\xd8\\x17\\xe0\\xc3\\x8b\\x52\\xdd\\xaa\\xe0\\x5b\\x95\\x96\\x59\\xda\\xf8\\x3e\\xbd\\x70\\xc0\\x2f\\xc0\\xfb\\x2f\\xe3\\x59\\x92\\xa8\\x38\\xf8\\x2e\\x9b\\xa8\\xa2\\xf1\\x03\\x79\\x03\\xde\\xbd\\x0c\\x8b\\x22\\x38\\x4b\\xe2\\x6c\\x9a\\xcd\\x92\\xac\\xf9\\xed\\x32\\x2c\\xb2\\x38\\xc1\\xb7\\xff\\x06\\x7f\\xa5\\xc1\\xc5\\x9d\\x0a\\xf3\\x38\\xbd\\x56\\xcd\\xd0\\xfc\\x82\\x2f\\x15\\x07\\x69\\x76\\x1b\\x26\\x2a\\x1c\\x23\\x02\\x0a\\x91\\x8e\\x93\\xa4\\xf1\\xfd\\x02\\x9e\\x16\\x1f\\x70\\xf8\\xef\\x66\\xb3\\x02\\xa0\\xce\\x8a\\x42\\xa5\\xcd\\xa0\\xc0\\x1b\\xff\\x86\\x17\\xff\\xae\\x92\\xe4\\x3e\\xb8\\x98\\x4d\\x26\\x2a\\x4f\\xe2\\x66\\x30\\x3e\\x14\\xfa\\x31\\x7c\\xf0\\x4d\\x58\\x84\\x79\\x58\\x06\\xc7\\x49\\x1c\\x5c\\xdc\\xab\\xa8\\x99\\x5f\\xfc\\x12\\xbc\\xfe\\x26\\x06\\x16\\x24\\x61\\x11\\xfc\\x90\\x25\\xb7\\x2a\\x2f\\x5a\\xe8\\x9e\\xde\\xe9\\xc7\\x48\\x75\\x95\\xab\\x0f\\xc1\\x49\\x3c\\x52\\x79\\x96\\xaa\\xc6\\xf7\\x23\\x7c\\x65\\x24\\x6f\\xc0\\x27\\xc7\\x69\\x94\\xab\\xbb\\xe0\\xbb\\xb0\\x98\\x86\\xcd\\x92\\xc0\\x6f\\xf0\\x0b\\x44\\x7f\\xe4\\xe8\\xf7\\x61\\x0e\\x92\\x04\\x30\\x7d\\x1b\\x17\\x37\\x2d\\x22\\xf4\\x0b\\xbe\\x79\\x33\\xa6\\x17\\x88\\x03\\xf1\\x07\\xc0\\x29\\x0e\\xfe\\x9e\\xa5\\x51\\xd6\\xc2\\x06\\x7e\\x05\\xa9\\xa5\\x52\\xf8\\x1e\\xe8\\xfa\\xb7\\x70\\xf4\\x61\\x12\\x36\\x23\\x7f\\x25\\x2f\\xfd\\xc2\\xef\\xc0\\x67\\x6f\\x41\\x84\\x82\\x8b\\x2c\\x07\\xe6\\xb5\\x88\\x46\\xf1\\xe7\\xff\\xf9\\xcf\\xff\\xf8\\x9f\\xff\\x42\\x4c\\xb2\\xe2\\x06\\x04\\x3b\\xcf\\xae\\x9a\\x85\\x02\\x9f\\xf3\\x63\\x7a\\xf9\\x26\\x0d\\xde\\xa9\\x18\\x99\\xde\\x88\\x2c\\x3c\\x4f\\xef\\x73\\x7a\\xe1\\x19\\x2d\\x80\\xd1\\x87\\xe0\\x16\\xe0\\x8e\\x00\\x8e\\x6f\\x40\\x54\\x3f\\xb4\\xac\\x82\\xd1\\x87\\xdb\\x88\\x9e\\x7f\\x5d\\x59\\xe0\\xac\\x03\\x3a\\xd6\\xb3\\xbc\\xab\\x92\\x7b\\xd4\\x31\\xd1\\x93\\x27\\xcf\\xbe\\x08\\xbe\\x58\\xe7\\xff\\x9e\\x9c\\x64\\xd3\\xfb\\x3c\\xbe\\xbe\\x29\\x83\\xc1\\x68\\x3f\\x78\\x1d\\x8f\\xf2\\xac\\xc8\\xc6\\x65\\x70\\x92\\xe5\\xd3\\x0c\\xc4\\x14\\xc0\\x3c\\x04\\x79\\x4e\\x02\\x7a\\xa9\\x08\\x72\\x55\\xa8\\xfc\\x56\\x45\\x87\\x4f\\x5e\\x81\\x84\\x01\\x0b\\xa2\\x60\\x96\\x82\\xc4\\x05\\xe5\\x8d\\x0a\\x8e\\xa7\\xe1\\x08\\xfe\\x23\\x4f\\x86\\xc1\\x3f\\x40\\x6a\\x61\\x00\\xd4\\x7d\\xc1\\x00\\x5f\\xd8\\x93\\x47\\x7b\\xfb\\xcf\\x83\\xfb\\x6c\\x16\\x4c\\xc2\\xfb\\x20\\xcd\\xca\\x60\\x56\\xa8\\x27\\xe5\\x0d\\xe8\\xb9\\x71\\x9c\\xa8\\x40\\x7d\\x1c\\xa9\\x69\\x19\\x80\\x64\\x00\\x3d\\xa6\\x09\\xe8\\xb2\\x91\\x0a\\xee\\x80\\x42\\x34\\x89\\x0c\\x71\\x18\\xfc\\x53\\x06\\xc8\\xae\\xca\\x10\\xde\\x0d\\xe1\\xed\\x29\\xfc\\x6b\\x8c\\x6f\\x69\\xe8\\x02\\x58\\x8d\\xa2\\x67\\xef\\xee\\xee\\x0e\\x43\\x02\\xf0\\x30\\xcb\\xaf\\x9f\\x25\\xfc\\x42\\xf1\\xec\\xd5\\xd9\\xc9\\xe9\\x9b\\x8b\\xd3\\x03\\x00\\xf2\\xc9\\x93\\xcb\\xef\\xcf\\x2e\\x82\\x93\\xf3\\x97\\xa7\\x01\\xfc\\xf7\\xed\\xbb\\xf3\\x7f\\x9c\\xbd\\x3c\\x7d\\x19\\x7c\\x71\\x7c\\x01\\xff\\xfe\\x22\\xf8\\xe6\\xf8\\xe2\\xec\\x62\\x18\\xfc\\x70\\x76\\xf9\\xfd\\xf9\\xfb\\xcb\\xe0\\x87\\xe3\\x77\\xef\\x8e\\xdf\\x5c\\x9e\\x9d\\x5e\\x04\\xe7\\xef\\xe0\\xab\\x37\\x2f\\xcf\\x2e\\xcf\\xce\\xdf\\xc0\\xbf\\xbe\\x0d\\x8e\\xdf\\xfc\\xf3\\xc9\\xdf\\xcf\\xde\\xbc\\x1c\\x06\\xa7\\xf0\\xf6\\xe9\\xbb\\xe0\\xf4\\xc7\\xb7\\xef\\x4e\\x2f\\xe8\\xcd\\xb3\\xd7\\x6f\\x5f\\x9d\\x9d\\xc2\\xa3\\xb3\\x37\\x27\\xaf\\xde\\xbf\\x3c\\x7b\\xf3\\x9d\\x19\\xf2\\xd5\\xd9\\xeb\\xb3\\xcb\\x63\\x1c\\x05\\x47\\xd0\\x6f\\x3e\\xe9\\x9a\\xe9\\xf2\\xec\\xf2\\xd5\\xe9\\x30\\xf8\\xf6\\xec\\xf2\\x0d\\x8e\\xff\\x2d\\xbc\\x70\\x1c\\xbc\\x3d\\x7e\\x77\\x79\\x76\\xf2\\xfe\\xd5\\xf1\\xbb\\xe0\\xed\\xfb\\x77\\x6f\\xcf\\x2f\\x4e\\x87\\x4f\\x5e\\x9f\\xbe\\x3b\\xf9\\x1e\\x46\\x39\\xfe\\xe6\\xd5\\xd9\\xe5\\x3f\\x71\\xa0\\x37\\xe7\\x6f\\x0e\\xce\\xde\\x7c\\xfb\\x0e\\x20\\x38\\x7d\\x7d\\xfa\\xe6\\xf2\\xf0\\xc9\\x93\\x0b\\xa5\\x5c\\x56\\xba\\x1c\\xd4\\x24\\xc5\\xdd\\xad\\x98\\xaa\\x51\\x3c\\x8e\\x47\\x41\\x12\\xa6\\xd7\\xb3\\xf0\\x5a\\x05\\xd7\\x19\\xe8\\xa8\\x14\\xf4\\x75\\x30\\x55\\xf9\\x24\\x2e\\xf0\\xb3\\xe2\\x49\\x98\\x46\\x41\\x12\\x4f\\xe2\\x32\\xe4\\x1d\\xcd\\xca\\x8a\\x66\\xe3\\x93\\xb5\\xca\\x73\\xf0\\xc5\\xb3\\x27\\xb8\\x4a\\xbe\\x78\\x12\\x7c\\x11\\x9c\\xa5\\xb0\\xb3\\x8d\\xc3\\x11\\x83\\x4c\\x58\\xfd\\xed\\xf8\\xc7\\xa0\\x50\\x65\\x89\\x70\\x96\\x37\\x20\\x1c\\x77\\xb8\\x5f\\x8c\\xb2\\x74\\x1c\\x5f\\xcf\\x72\\x65\\x5f\\xca\\x15\\x6c\\xcb\\x45\\xf9\\x04\\x07\\x8c\\xcd\\x38\\x7f\\xa3\\x4d\\xfd\\xf8\\x97\\xf0\\xe3\\x05\\x0f\\x52\\x04\\xbf\\x3e\\x09\\xe0\\x7f\\x34\\x23\\xfe\\xef\\x8b\\xe0\\x12\\x86\\x80\\x01\\x4b\\xd8\\x27\\x83\\x12\\x2d\\x83\\x02\\xff\\x02\\x01\\xc5\\xb1\\x65\\xd8\\xe0\\x46\\x85\\x4c\\x08\\x00\\x01\\x96\\x77\\x52\\xd0\\x53\\x5a\\x5a\\x79\\x70\\x87\\xbf\\x7e\\x88\\x81\\x74\\x20\\xcc\\xb0\\xe0\\xa6\\x19\\x92\\x3d\\x16\\x60\\xc3\\x91\\x5e\\x1d\\xb9\\x2a\\x67\\x39\\x2c\\xcf\\x33\\x12\\x79\\x79\\x50\\x18\\xfc\\x52\\xa5\\xa2\\x22\\x98\\x64\\x11\\x32\\x8a\\xe8\\x3f\\xc4\\x41\\x62\\x5c\\xc4\\xb0\\xb0\\x26\\x0a\\x78\\x11\\x05\\x65\\x16\\x80\\xaa\\x2e\\xb2\\x20\\xc3\\x55\\x26\\x60\\xfe\\xe9\\x30\\x64\\x1c\\x67\\xd3\\xc1\\x7e\\x30\\x51\\xe5\\x4d\\x06\\x2b\\x9e\\x11\\x7c\\x46\\xff\\x95\\xc9\\x5e\\x1c\\x05\\x61\\x7a\\xff\\xbc\\x4a\\x83\\x6f\\xee\\xd1\\x1e\\x0a\\x67\\x49\\x39\\x0c\\x42\\x54\\x1e\\x8c\\x76\\x11\\x84\\xb9\\xd0\\x23\\x2c\\xee\\xd3\\xd1\\x0d\\xec\\x50\\xd9\\xac\\x00\\x7d\\x3b\\x88\\x0f\\x61\\x45\\x93\\x0a\\x88\\x09\\x03\\x84\\xab\\xcc\\x67\\x0a\\x6c\\x20\\x3d\\xd4\\x3e\\x61\\x8a\\x6a\\x03\\x31\\x0b\\x9c\\x01\\xcc\\xf8\\x43\\xfe\\x14\\x87\\xc9\\xa6\\x88\\x31\\x0e\\x33\\x0e\\x13\\x54\\x17\\x27\\xa0\\xd9\\x8a\\x83\\x28\\x9b\\x84\\x44\\x3a\\x0d\\x10\\x50\\x39\\x0a\\xcb\\x10\\xf5\\xeb\\x51\\xb0\\xf7\\x0b\\x6c\\x78\\xd3\\x3d\\xfb\\x18\\x48\\x83\\xfa\\xa9\\x98\\x4d\\x41\\x1b\\x96\\xde\\x9c\\x19\\xc8\\xb9\\xe8\\xc7\\x37\\x59\\xa9\\x98\\x97\\x4d\\x40\\x91\\x92\\x2a\\xd5\\x04\\xf5\\x69\\x1e\\x03\\xb2\\x49\\x06\\x1b\\x07\\x92\\xf9\\x2a\\xcf\\xee\\x80\\xe7\\xc3\\x20\\x8a\\x8b\\xf0\\x2a\\x41\\xa6\\x01\\x35\\x81\\xb6\\xbc\\x58\\xee\\x6e\\x50\\x1b\\xba\\x62\\x03\\x78\\xe1\\xc3\\x5b\\x40\\xe7\\xb8\\x40\\xe9\\x30\\x56\\xe6\\x5f\\x86\\xf4\\x22\\x28\\x52\\xfc\\x99\\xa8\\x7b\\xc4\\x98\\xb3\\xe6\\xfc\\xe5\\x5f\\x3f\\x7e\\xff\\x2e\\x18\\xfc\\xe9\\x10\\xb6\\x14\\x95\\xe7\\x2a\\xda\\xc7\\xc1\\x22\\x35\\x05\\x59\\x08\\x4b\\x15\\x89\\x3e\\x9e\\x15\\xa4\\x8c\\x59\\x1a\\x67\\xc0\\xe3\\xa2\\x78\\x06\\xaf\\x67\\xf9\\x33\\x52\\xc5\\x0a\\xf0\\x1c\\x01\\x43\\xaf\\x60\\x37\\x16\\x0a\\x03\\xc3\\x52\\xb0\\x20\\xc3\\x48\\x34\\x2f\\xc8\\x7e\\xce\\x32\\x1b\\x21\\x3e\\x2c\\x3b\\x85\\x7e\\xc8\\x60\\x64\\x57\\x68\\x01\\xe3\\x04\\x37\\x00\\x2a\\xff\\x78\\x18\\x81\\xb5\\x02\\xc2\\x26\\x2b\\xd5\\x42\\x26\\x8f\\x05\\x9a\\xc1\\x7e\\x45\\x0e\\x11\\x53\\x90\\xc2\\xab\\x2c\\x03\\x33\\x30\\xad\\x49\\xe2\\x71\\x00\\xe3\\x1c\\x68\\xfa\\x19\\xd8\\xc7\\xb3\\x74\\xc4\\xf2\\x81\\x5c\\x1b\\xc1\\x26\\x7e\\x45\\xc4\\xa3\\xf5\\x40\\x4b\\xe6\\xde\\x81\\x77\\x00\\x12\\x63\\x28\\xfd\\x5f\\x87\\x1f\\x87\\xc1\\x8f\\xaf\\x5f\\x7d\\x7f\\x79\\xf9\\xf6\\x1d\\x8f\\xbb\\xaf\\x31\\xba\\x52\\xa0\\x69\\x94\\xac\\x32\\x94\\xf3\\xc3\\xe0\\x3d\\x51\\x13\\xfe\\x09\\x03\\xa3\\x70\\x8e\\x80\\xc4\\xd9\\x44\\x14\\x00\\x08\\xac\\x2a\\x47\\x87\\xa4\\x33\\x78\\x2a\\x94\\xc7\\x42\\xeb\\x16\\x1e\\x95\\x57\\xcd\\x14\\x4c\\x68\\x00\\x2f\\xc4\\x7f\\x5d\\xcf\\x60\\xf1\\x96\\x05\\x7e\\xc7\\x0b\\x06\\xe0\\x47\\xa5\\x14\\x9c\\xde\\xd2\\x9c\\xef\\x48\\x31\\x20\\xf9\\x59\\x02\\x64\\x55\\x33\\x74\\x17\\xb0\\xee\\x2d\\xfe\\xac\\xff\\x70\\x87\\x4d\\x5c\\x49\\xab\\xc9\\xd7\\xff\\x1d\\x56\\x87\\x90\\x05\\x46\\x03\\x5c\\xb1\\x58\\x00\\x7c\\xb9\\xba\\x0e\\xf3\\x28\\x01\\x4e\\x69\\x96\\x93\\x0e\\x24\\x45\\xc6\\x23\\x7b\\xec\\xb3\\xe3\\xbd\\x08\\x06\\x44\\x81\\x23\\x51\\xb2\\xf0\\xe7\\xd0\\x50\\xe2\\xa8\\x41\\xf3\\xee\\x37\\xab\\x1e\\x50\\x11\\xa2\\x3e\\x08\\xf7\\xa1\\xd1\\x9b\\x30\\xd1\\xc8\\xe0\\x07\\x90\\x4e\\x61\\xd7\\x2a\\x68\\x75\\xc3\\xbb\\x84\\x00\\x6c\\x78\\x11\\xea\\x1b\\x67\\x69\\xf2\\xda\\x3e\\x0a\\x64\\x52\\x7e\\xc9\\x0c\\xce\\x03\\x67\\x29\\xac\\xe9\\xbb\\x2c\\xff\\xc0\\xa2\\x3f\\x2a\\xf1\\x9f\\xb8\\xe6\\xbe\\x3f\\x3d\\x7e\\x49\\x0c\\xfd\\xee\\xf4\\xd2\\x68\\x03\\x50\\x62\\x25\\xbd\\x8d\\xee\\x5d\\x10\\x4e\\xa7\\x8a\\x17\\xca\\xde\\xff\\xf7\\xd7\\x5f\\xcb\\x18\\xcc\\xe9\\x32\\x9c\\x4c\\x7f\\xdf\\x23\\xfd\\x07\\x53\\xe1\\xa7\\x60\\x95\\x83\\x9d\\x0d\\x7b\\x50\\xc1\\x92\\x62\\xfe\\x8d\\xac\\x47\\x04\\x50\\x1f\\x02\\xe8\\xb8\\xcb\\x65\\x25\\xda\\xea\\x48\\xf3\\xc2\\x21\\x3a\\xca\\x99\\x31\\xaa\\xce\\x4e\\xff\\x02\\xaa\\x45\\xa1\\xc5\\x04\\x86\\xc1\\x25\\x0e\\x32\\x01\\x61\\xc4\\x19\\xc3\\xe0\\xfd\\xbb\\x57\\xbc\\x26\\x6e\\x50\\xd2\\x92\\x1c\\xc4\\xf4\\x1e\\xa8\\xa3\\x52\\x87\\x72\\x08\\x37\\x02\\xe6\\xb3\\x92\\x48\\xd3\\xb9\\x12\\xed\\xa2\\xcb\\x1c\\x89\\x21\\x50\\x5c\\x25\\x87\\x26\\x2f\\x38\\x14\\x45\\x30\\x08\\xc7\\x88\\xa4\\xac\\x7c\\xa2\\x24\\xe9\\x22\\xb3\\x8c\\x79\\x65\\xa8\\x8f\\x6a\\x34\\x03\\xb8\\xf6\\x99\\x3a\\x66\\x96\\x6b\\x05\\x4b\\x47\\x96\\x4d\\x79\\x97\\xd9\\x75\\x73\\xe4\\xac\\xb7\\xde\\x4b\\x1b\\x67\\x0f\\x83\\xa2\\xcc\\x59\\x0c\\x4a\\x75\\x0d\\x76\\xfa\\xbf\\xd9\\x8e\\x00\\x5d\\x09\\x06\\xce\\xcc\\x88\\xbc\\xc6\\x64\\xb0\\x27\\xb0\\xef\\x0d\\x83\\x3d\\x60\\x14\\xef\\xc5\\x2a\\xc2\\x7f\\x12\\x26\\xf8\\x07\\x32\\x3d\\x9b\\x95\\xf8\\x67\\x08\\xb6\\x3f\\xfe\\x01\\x28\\xee\\x01\\x93\\x41\\xfe\\xf8\\xad\\xfd\\xb6\\xe5\\x68\\x94\\x72\\x61\\xe4\\x33\\xd5\\x06\\x02\\xfe\\x95\\xe7\\x21\\x59\\xc4\\x9a\\x26\\x20\\x40\\xa7\\xc0\\xa6\\xca\\xf2\\xb7\\xbc\\x40\\x45\\x41\\x26\\x45\\xb3\\x62\\xf1\\xf9\\x2d\\x73\\x37\\x2e\\xdc\\x52\\x7d\\x2c\\x2f\\x88\\x26\\x47\\x42\\xb3\\x96\\xe5\\x7a\\x9c\\x6a\\x02\\x03\\x98\\xfc\\xe6\\x33\\xd0\\x21\\xb3\\x24\\xcc\\x0f\\xd4\\x47\\xd0\\xdd\\x64\\x48\\x02\\x1b\\xe3\\xbc\\x60\\xc1\\x8c\\x50\\xf2\\xc1\\x23\\x54\\xc1\\x4d\\x76\\xa7\\x29\\x42\\x78\\x10\\xc9\\x84\\x01\\x6c\\x34\\x0d\\x83\\x6b\\xd8\\x2c\\x53\\xd0\\x01\\x85\\x67\\x93\\x1d\\x06\\x83\\x5b\\xb1\\x6c\\xc3\\x08\\x96\\xce\\x11\\x92\\x74\\xbf\\x82\\x1e\\xbd\\x8e\\x16\\xce\\xaf\\xc1\\x4f\\x1f\\xd4\\xbd\\x46\\xe4\\x67\\x46\\x24\\xf8\\x5d\\x70\\x79\\x76\\x3c\\x82\\x75\\x4f\\x6b\\x18\\xe4\\x9a\\xe1\\x21\\xf3\\x09\\x8c\\xaa\\x19\\xaa\\x9c\\x51\\x16\\x01\\x20\\xf8\\xcb\\x53\\x63\\x96\\xc0\\x2e\\x3e\\x0b\\xd1\\xd1\\x84\\xff\\x03\\x45\\xa3\\x67\\xa3\\x48\\x92\\x6c\\x14\\xf0\\x9f\\x3d\\xd2\\x32\\x7b\\x32\\xcf\\x82\\xce\\xe2\\x33\\xb0\\xc1\\x41\\x0a\\x9f\\xfd\\xf7\\x7f\\xfd\\x47\\x95\\xe8\\x3f\\xe0\\x92\\x2b\\x44\\xf1\\xa0\\xf5\\xa3\\xb5\\x0d\\x1b\\xa0\\x43\\x31\\x01\\xe2\\x2a\\xd1\\x5e\\xb2\\x21\\x86\\x82\\xb1\\x07\\x9a\\x2b\\x11\\xb3\\xf2\\xd9\\xc7\\x03\\x70\\xae\\x0e\\x40\\xfd\\x4c\\x0e\\x66\\x79\\xa2\\x52\\xc4\\x18\\x2c\\x8a\\xd1\\x0d\\x32\\xa4\\xfc\\xeb\\xfb\\xcb\\x6f\\x0f\\xfe\\x02\\x62\\x0d\\xf6\\x0c\\xc8\\x1e\\x79\\x79\\x29\\xdb\\xe4\\x93\\x8c\\x36\\x65\\x70\\xc3\\x8c\\x6d\\x07\\x4c\\x87\\x71\\x63\\x54\\xa2\\xb8\\x76\\x03\\xf1\\xec\\x08\\x8c\\x83\\x52\\xe8\\xc3\\xf6\\xe9\\x60\\x9f\\x56\\x41\\x2a\\xfb\\x6d\\x98\\xdc\\x85\\xf7\\xbc\\xed\\xfa\\xf8\\x04\\x03\\x45\\x42\\x30\\x06\\x65\\xc9\\xe8\\xca\\xee\\x2c\\x1a\\xe3\\x87\\xff\\x3c\\xa1\\x55\\x0f\\xe4\\x95\\x55\\x6f\\xfc\\x1b\\xc2\\x0f\\xcc\\xb3\\x11\\xc8\\xb2\\x12\\x01\\xa4\\x85\\xc7\\xa8\\x39\\xd3\\x12\\x92\\xcf\\xe5\\xc3\\x7b\\x36\\xe5\\x58\\x19\\xeb\\x77\\x49\\x46\\x51\\x5d\\xf3\\x4e\\xe4\\xec\\x32\\x08\\x2e\\xbc\\x95\\x5e\\xf3\\xaf\\x44\\x40\\x18\\xa1\\xba\\xde\\x8c\\x88\\xb4\\x58\\xdd\\xb4\\x68\\x65\\x35\\xe9\\x85\\xcd\\x9a\\x5d\\xbb\\x24\\x1f\\x69\\x99\\xa1\\x45\\x8e\\xab\\x1a\\xcc\\xa2\\x84\\x2c\\x2c\\xa3\\x4f\\x0f\\x3d\\xcb\\xdd\\xfd\\x8c\\x75\\x81\\x0c\\x4e\\x64\\xc8\\xd1\\x42\\x43\\x2a\\xb2\\xef\\xc2\\x12\\xaf\\x2d\\x17\\x32\\xa5\\xc4\\xec\\xc0\\xd1\\xd1\\xf2\\x0c\\x5d\\xb7\\x69\\xa2\\xf2\\x6b\\x54\\xfe\\xda\\xab\\x37\\x5f\\x6a\\x85\\xad\\x99\\xbc\\xdf\\x40\\x85\\x8f\\x65\\x0b\\x05\\xac\\x36\\xc1\\xf7\\xc0\\xd0\\xd7\\x02\\x8e\\x54\\x3b\\x28\\xb3\\x03\\xfd\\x37\\x3e\\x07\\xc9\\xe0\\x3d\\x95\\x54\\xa2\\xf9\\x01\\x16\\xe9\\x6d\\x98\\x80\\xe7\\x81\\x28\\x57\\x0c\\x45\\xf6\\xb8\\x18\\xe1\\x32\\x0f\\xd3\\x02\\x65\\x1e\\xa0\\xe5\\x0f\\x8c\\xf6\\x67\\xe5\\xd3\\x4f\\xc9\\x08\\x14\\x73\\xd5\\x8c\\x67\\xe1\\xe0\\x42\\xb9\\x83\\x4d\\x92\\x2c\\x11\\x92\\x26\\x58\\x23\\xe8\\xdf\\xbc\\xf4\\xdc\\x9b\\x60\\xa0\\x4d\\xec\\xbf\\x5d\\x9c\\xbf\\x79\\x0b\\x7b\\x19\\x73\\xa4\\x00\\xf3\\x21\\x60\\x4f\\x48\\x7b\\x4c\\xca\\xe2\\xe0\\x0e\\x24\\x5e\\x98\\x6c\\x08\\xac\\xac\\x86\\xb4\\x74\\xd5\\xc7\\x10\\xf5\\xff\\x50\\xd6\\xd8\\x41\\x11\\x47\\x88\\x7a\\x14\\xa3\\x05\\x24\\x9b\\xbc\\x5e\\x01\\x3c\\x55\\x1f\\x7a\\xd8\\xa9\\x3b\\x2c\\x89\\x97\\xa2\\xb1\\xae\\x54\\xc3\\x62\\x27\\xfb\\x8a\\x35\\x17\\x91\\x36\\x62\\xbb\\x86\\x82\\xec\\x42\\xda\\x21\\xab\\x82\\xd2\\xd8\\x37\\x7a\\x5f\\xc7\\x6f\\x81\\xfd\\x6c\\x94\\xf1\\x97\\xe4\\x54\\xe5\\x64\\x3d\\xa2\\xc9\\x73\\x60\\xcd\\x38\\x8c\\x94\\x4c\\xf3\\x0c\\xb7\\x77\\x02\\xc8\\x3a\\x9c\\xb0\\x2e\\x6e\\x09\\x2e\\xa2\\xd9\\x0c\\xcc\\x7d\\x50\\x23\\x23\\xfd\\x32\\xcd\\x73\\xce\\x52\\x4a\\xfe\\x16\\xa0\\xf1\\x77\\x75\\xff\\xec\\x1f\\x44\\x7f\\xda\\xe8\\x48\\x19\\x5a\\x21\\x84\\x3d\\x18\\x37\\xf2\\xa1\\xde\\xec\\x00\\xd1\\x38\\x4c\\xe2\\x7f\\x83\\x42\\x9a\\xc0\\x42\\x8d\\x81\\x0d\\xfc\\x76\\xc1\\xeb\\x89\\xd8\\x0b\\xa2\\x14\\x5c\\x85\\xb8\\x94\\x84\\xe9\\x9e\\x8c\\x82\\xf0\\x46\\x14\\x83\\x0c\\x13\\x63\\x3b\\x0c\\x22\\x55\\x8c\\xf2\\xf8\\x0a\\x2d\\x3c\\x05\\x8c\\xae\\xac\\x3c\\x5c\\x3a\\x6d\\xcb\\xae\\x6a\\xda\\x69\\x4f\\x0a\\x74\\x5a\\xa4\\x5d\\xd8\\xf0\\xce\\xc6\\x32\\x48\\x09\\x03\\x28\\xbe\\xd6\\x3d\\x34\\x56\\x07\\x39\\x6d\\xe3\\x38\\x81\\x95\\x41\\x5e\\x8c\\x33\\x7a\\x11\\x62\\xf0\\xf4\\xdf\\xaa\\xb2\\xd4\\x30\\x18\\x58\\xdc\\x64\\xb3\\x24\\x92\\x45\\x2a\\x82\\xce\\x2f\\xb3\\x8f\\x5f\\xb1\\x0f\\x75\\xbc\\xa4\\xc1\\x36\\x44\\x60\\x09\\x46\\x1e\\x0b\\x6d\\xeb\\x1c\\x9c\\x36\\x67\\x4b\\x41\\x73\\x10\\xff\\xf9\\x54\\x6b\\x94\\xa7\\xd6\\x2c\\xaf\\xd3\\xed\\x5b\\x42\\x05\\x2c\\x25\\xfc\\x07\\xd1\\x10\\xb4\\xeb\\x3d\\xfd\\xd1\\x62\\x17\\x5d\\x3a\\x9e\\x13\\xef\\xd0\\xa8\\x7f\\x60\\xdd\\x3f\\x25\\x8b\\x77\\x8a\\x8b\\x0c\\x28\\xc3\\xce\\xac\\x0f\\x1b\\x49\\x4f\\x8a\\xa7\\x03\\xb8\\xcd\\xf1\\x46\\xa6\\xa2\\xa1\\x67\\x2a\\x95\\xf0\\x07\\x10\\x33\\x4e\\xc7\\xe8\\x45\\x94\\xbe\\xa4\\xbc\\x3e\\x7b\\x7d\\x6a\\x26\\x77\\xc9\\x0c\\x16\\x79\\x8a\\x3c\\x73\\xde\\xa0\\xd1\\xee\\x63\\x05\\x74\\x87\\x07\\x43\\xd4\\xf9\\x60\\x47\\x93\\xbe\\x71\\x9f\\x85\\xc1\\xdf\\xc2\\xdb\\xf0\\x02\\xc4\\x0b\\x2c\\x53\\x56\\xd1\\xe6\\xdd\\x82\\x7f\\xa5\\xb7\\xc5\\x96\\x67\\x6c\\xe8\\xf7\\x21\\x5b\\xde\\xe9\\x3d\\xac\\x26\\x40\\x58\\x19\\xb7\\xeb\\x4a\\x59\\xee\\xa0\\xaf\\xa2\\xed\\xcc\\xc3\\xa0\\x46\\x7e\\xd9\\x33\\xf9\\x85\\xde\\x8e\\x49\\xec\\x1b\\xf3\\xe3\\x30\\x4e\\x8a\\x8a\\x08\\x81\\xae\\x53\\x60\\x60\\xe2\\x86\\x90\\x83\\x3a\\x58\\xc0\\xc3\\xb0\\x52\\xbf\\x6f\\xe8\\x61\\xdc\\x0b\\x59\\x88\\xda\\xb9\\xd0\\xac\\x60\\xe7\\x87\\x04\\x21\\x1b\\x8d\\x66\\x18\\xc5\\x11\\xe2\\x88\\xf2\\x09\\x13\\x71\\xf3\\x10\\x36\\x43\\xe5\\x71\\x80\\xb2\\xa0\\xbf\\x38\\x0c\\xde\\x82\\x8e\\x8d\\xaf\\xac\\xce\\xd0\\xc1\\xd1\\x42\\x81\\xce\\x8c\\x0c\\x12\\xc1\\xe0\\x4a\\xa1\\x52\\x07\\x17\\x73\\x96\\x24\\xfb\\xe4\\x6a\\xb9\\xce\\x8a\\x71\\x60\\xb4\\xd7\\x82\\xa0\\x78\\x6e\\xcb\\x21\\x1b\\x9a\\x78\\x2a\\x07\\x0e\\x95\\x80\\x4f\\x70\\xa0\\x3f\\x8a\\xff\\xba\\xbc\\x01\\x03\\xc8\\x23\\xa3\\x22\\xd7\\x01\\x6c\\xe3\\x00\\x03\\x6e\\x84\\x07\\xb3\\x81\\x86\\x60\\x37\\x6b\\x68\\x22\\x47\\x7b\\xe0\\x9d\\x07\\xdf\\x66\\xb3\\x34\\xda\\x23\\xa7\\x89\\x22\\xbe\\x48\\x86\\x0b\\x5e\\xa5\\xa7\\x38\\xc9\\xe1\\x5e\\x8b\\xf7\\xc4\\x00\\xad\\xdb\\x75\\xe2\\x80\\x01\\xa9\\x32\\x56\\x7f\\xc6\\x4d\\x97\\x37\\x91\\xde\\x23\\x37\\x18\\x29\\x0b\\x00\\xe9\\xe7\\xfd\\x4e\\x9b\\xb6\\x13\\x38\\xe8\\xe1\\x94\\x11\\x4a\\x3d\\x3d\\x32\\x8f\\x07\\x73\\xdc\\x34\\x60\\x24\\x07\\x16\\xd0\\x1e\\x88\\xaf\\xaf\\xe1\\xcf\\xeb\\x24\\xbb\\x0a\\xd9\\x90\\x0c\\x78\\xbf\\x13\\x74\\xb5\\x44\\xc5\\x85\\x8d\\x26\\x5d\\x52\\x48\\xcf\\x78\\x0f\\x6c\\x53\\x5c\\x38\\x71\\x1a\\x7f\\xdf\\x54\\x7a\\x74\\x33\\x64\\x12\\x7f\\x60\\x1b\\x13\\x70\\xc8\\x4b\\x64\\x36\\xff\\x23\\x9b\\xb2\\xfa\\xbb\\x52\\xb4\\x5a\\x18\\x36\\x94\\x72\\x22\\x56\\x25\\xb0\\x87\\x46\\x61\\x9e\\x25\\x20\\xf8\\x79\\x8c\\x11\\x5a\\x4b\\xc5\\xc2\\x27\\x23\\xcf\\xde\\x15\\xcc\\x70\\xdd\\x56\\xb0\\x66\\xf4\\x5e\\x2a\\x71\\x7d\\xd8\\x7c\\x9f\\xdd\\xda\\xfd\\x9c\\x5d\\x3a\\x5c\\x5b\\x49\\x06\\x50\\xd2\\x26\\x6d\\xa2\\xc3\\xb3\\x42\\xaf\\xf3\\x8a\\x0f\\x42\\x06\\x26\\xae\\x02\\x26\\x9f\\x0c\\xfd\\xe3\\xc1\\x3b\\x1d\\x88\\x39\\xf8\\x01\\x06\\x3a\\xaa\\x7e\\x66\\x5d\\x12\\xb2\\xb2\\x86\\xc1\\xd5\\xac\\x24\\x07\\x58\\xd3\\xbf\\xf2\\x3e\\xc3\\x29\\x94\\x62\\x2f\\x24\\x82\\xc9\\x72\\x60\\xd0\\x3f\\x58\\x41\\x88\\x1d\\x2f\\x21\\x4b\\x7f\\xc1\\x24\\x05\\xa9\\x4c\\x3c\\xfc\\xb9\\xcb\\xe3\\x12\\x3c\\x14\\xe6\\x07\\xe2\\xd8\\x1e\\x76\\xec\\x61\\x0a\\xca\\x6c\\x0b\\xd8\\xc5\\xc7\\x68\\x9d\\x7a\\x2a\\x5b\\x6c\\x44\\x8e\\xc1\\x8c\\x67\\x12\\xaa\\x8b\\x2b\\x9b\\x1a\\x46\\xba\\x34\\xde\\xc0\\x0b\\x71\\xcd\\x92\\xb0\\x28\\x5d\\xf9\\xe5\\xa5\\x87\\x41\\x6a\\x8c\\x7f\\x8d\\x6e\\xd4\\xe8\\x83\\xe6\\xdb\\x2b\\x78\\xf5\\xe0\\xb5\\xc4\\x76\\x04\\x70\\xeb\\x2c\\x1b\\x3b\\x4e\\xc7\\x23\\xaf\\xd3\\x2c\\xd7\\x9f\\xea\\x97\\xcf\\xdc\\x3d\\x42\\xe2\\xc5\\x6a\\x74\\x93\\xc6\\x30\\x3f\\x13\\x99\\x66\\x64\\x0d\\xf9\\x54\\x95\\xe1\\xf5\\x53\\xbb\\xb5\\xeb\\x98\\xa5\\x98\\x26\\x28\\xe8\\x61\\x09\\xaa\\x6a\\x96\\xea\\x80\\x13\\x9b\\x3f\\x1e\\x7d\\xe3\\xb1\\x86\\xb8\\x4b\\xcc\\x0d\\x49\\x69\\xf3\\x80\\xb5\\xa9\\xd2\\xdb\\x38\\xcf\\xd2\\x89\\xd8\\xdd\\xb4\\x09\\x8f\\xb2\\xeb\\x94\\x8c\\x2c\\xd4\\xc8\\x49\\x06\\x6a\\x6e\\xb8\\x07\\x3e\\xf7\\xe1\\xf5\\x21\\x7d\\x8a\\x67\\xba\\xc5\\x3d\\x08\\xec\\x04\\xfc\\x75\\xed\\x89\\x0b\\xb6\\x51\\x26\\x31\\x58\\x33\\x0a\\x5a\\x23\\x30\\x0e\\x69\\x78\\x7b\\xf6\\x23\\xfb\\x6e\\x86\\xf0\\xd0\\x19\\x63\\x9e\\x95\\xd9\\x28\\x4b\\x38\\x02\\x28\\xc0\\x01\\x6f\\x7d\\x60\\x08\\x96\\x23\\x02\\x60\\x18\\x7c\\x71\\x00\\x1a\\x50\\xa5\\x05\\x9d\\x83\\xa1\\xae\\xbd\\x8b\\xa3\\x6b\\x55\\x9a\\xe3\\xb3\\xb8\\x78\\x85\\xaf\\x6f\\xec\\xf8\\xac\\x49\\xe4\\x0f\\xbf\\xf4\\x85\\x5e\\x60\\xe8\\xe0\\xc8\\x39\\x0c\\x92\\xc7\\xda\\xa7\\xaf\\x1d\\x67\\xa4\\x68\\xfa\\x53\\xc8\\x84\\x4e\\xb2\\x2a\\x02\\xcc\\xa2\\xa8\\x37\\x2e\\xf1\\xd1\\xcd\\xe1\\xcd\\x53\\x3d\\xdc\\x53\\x8d\\x87\\xf9\\xe5\\xaf\\x2f\\xc8\\xbc\\x2d\\xf5\\x66\\xec\\x7a\\x53\\xfa\\x65\\xf0\\x92\\x40\\xa5\\x67\\xc1\\xaf\\x34\\xf3\\xd1\\xd3\\x2c\\xa5\\xfd\\xeb\\x55\\x16\\x46\\x4f\\x7f\\x0f\\xee\\xc4\\x34\\x2f\\x68\\x07\\x48\\x03\\xf7\\x31\\x8f\\xae\\xdd\\x7e\\xd7\\x90\\xad\\xef\\xdb\\xf6\\xf0\\x56\\x09\\x8a\\x95\\x83\\x3e\\xbd\\x8b\\x14\\xfa\\x33\\x52\\x47\\xa8\\xa2\\xe5\\xab\\xbd\\x17\\x1a\\xab\\x3d\\x8d\\x81\\xcc\\x8a\\xb1\\x6f\\xdc\\x58\\x4a\\x3c\\xac\\x2b\\xe5\\x01\\x86\\xc2\\xf6\\xfe\\xfa\\x62\\x8f\\x37\\x35\\xed\\xf3\\xcb\\xc1\\xdf\\x59\\x2a\\x61\\xb2\\x10\\x57\\xf6\\xbd\\xf5\\x41\\x68\\xc9\\x3a\\xa1\\x2c\\xed\\x64\\x13\\xc8\\x27\\x9a\\x6d\\x82\\xcc\\x21\\x98\\x30\\x8e\\x43\\xfd\\x2b\\xbf\\x75\\xa4\\x15\\x86\\xf7\\xcd\\x51\\xb0\\xa7\\xc1\\x7f\\x03\\xbc\\xde\\x0b\\x7e\\xf7\\x04\\x88\\xde\\x6d\\xf1\\xd2\\x2e\\x38\\x34\\xd5\\x25\\x39\\x88\\x63\\xe8\\xdb\\x1d\\xbd\\x44\\x87\\x1d\\xbc\\x14\\xec\\x16\\x1e\\xc7\\x38\\xbd\\x14\\xe3\\xbc\\x56\\x29\\x1e\\x95\\xb2\\xa2\\x92\\x00\\xa9\\x78\\xe9\\xc0\\x2c\\xf0\\x40\\x42\\xb4\\x46\\x81\\xd6\\x09\\x50\\x49\\xb8\\xa6\\xbf\\x01\\x70\\x66\\xac\\x05\\x79\\x60\\xd0\\xc2\\xe5\\x53\\x00\\x62\\x12\\x7e\\x20\\x55\\xa1\\xc2\\x22\\x66\\x9d\\x37\\x09\\xd3\\xf0\\xda\\x3b\\x2e\\xe5\\x23\\x03\\x50\\x15\\xb7\\xb8\\x60\\x9c\\x43\\x03\\x73\\x90\\x40\\xe6\\x05\\x71\\x40\\x27\\x93\\xdc\\x85\\xac\\xd8\\x8a\\x26\\x62\\xd1\\x51\\x05\\xc5\\x5e\\xe4\\x2d\\x95\\x12\\xe8\\x57\\xc0\\x47\\x00\\x42\\x47\\xf3\\xf0\\x24\\x04\\xa5\\x07\\x08\\xe3\\x9f\\xfc\\xd4\\xc5\\x19\\x07\\x33\\xfb\\x28\\x8a\\x9a\\x13\\x71\\x32\\x56\\x94\\x88\\x09\\x39\\x4c\\x1c\\x43\\x45\\x79\\xf3\\x9d\\x7a\\x5f\\xb0\\x9c\\x33\\xf4\\x1b\\xed\\x26\\xb9\\x01\\x00\\xf0\\x20\\xcc\\x56\\x5c\\x97\\x1f\\x3d\\x4c\\xab\\xb7\\x3f\\x01\\x2f\\x20\\xd0\\xb1\\xd8\\xcc\\xd5\\x48\\xe8\\xf0\\x98\\xa7\\xbd\\x54\\x1e\\xbe\\x3d\\xcf\\x3f\\x43\\xe5\\x70\\x97\\xe5\\x91\\x1b\\x5d\\x20\\x23\\xaa\\x6a\\xfa\\xa4\\x76\\x57\\xa7\\xf0\\x13\\x7b\\x0d\\xa1\\x9c\\x1f\\xcd\\x30\\x58\\x5c\\xea\\xa0\\x6e\\xe3\\x79\\xa4\\x9e\\xa9\\x1d\\x1a\\x37\\x40\\x4a\\x8e\\xb9\\x68\\x2e\\x09\\x96\\xdd\\xe8\\xe0\\x86\\xc4\\xf9\\xdd\\xb0\\xe9\\x80\\xb7\\x74\\x5a\\x14\\x43\\xeb\\xd2\\xca\\x91\\xdd\\x0d\\x8a\\x81\\xb6\\xc2\\xcd\\x4a\\x93\\xa0\\x91\\x78\\x7a\\x6e\\xcc\\x31\\x4e\\x1b\\x02\\x5b\\xe3\\xb8\\x2c\\x1d\\x8d\\xa6\\x4d\\x3e\\x2f\\x7e\\x3e\\x3f\\x74\\xbf\\x67\\xa2\\xf1\\x66\\x39\\x90\\xf5\\x1a\\xbc\\x3c\\x7f\\xfd\\x32\\x1b\\x91\\x7b\\x48\\xa7\\x54\\x0c\\x7a\\x9a\\xa5\\x07\\x16\\x4e\\x44\\xbf\\x23\\x0f\\xc3\\x27\\xb7\\x8d\\x9f\\x75\\xed\\x79\\x68\\xb5\\x11\\xd0\\x18\\xe1\\xd2\\xc7\\x85\\x7b\\xec\\x36\\xed\\x59\\x3b\\x19\\xc5\\x9e\\x64\\x83\\x6c\\x8f\\xa1\\xef\\x4c\\x19\\x9d\\x40\\x82\\xa3\\x13\\x3d\\xd0\\x69\\xd4\\xe3\\x98\\xd8\\x30\\x39\\xb2\\xb0\\x72\\xf7\\x48\\x8a\\xf7\\xc9\\x51\\x29\\xbc\\xb0\\x3f\\x6c\\x11\\xe0\\x9f\\x63\\xa0\\x42\\x47\\x54\\xd9\\x85\\x03\\xbb\\xcc\\x0b\\x7d\\x1b\\x1d\\xfa\\xbe\\x70\\x4f\\x3a\\x71\\x98\\x70\\x44\\x67\\x9b\\x30\\x98\\x0c\\x41\\xc6\\x0a\\x9d\\x4a\\x6b\\x7f\\xd1\\x84\\x6a\\x43\\x9e\\x9d\\xdc\\x78\\x3d\\xf0\\x04\\x73\\x4e\\x78\\x5a\\x9f\\xa6\\xfc\\xdb\\x09\\x43\\xda\\xb1\\xaa\\x5c\\x0f\\x26\\x05\\x96\\xe6\\xf1\\x88\\x97\\x0b\\x8a\\x00\\x2b\\x49\\xe3\\xfb\\xb6\\x9e\\xd8\\x3a\\x26\\x74\\x3d\\xf7\\x03\\x07\\x3a\\x0c\\xc6\\xd5\\x0c\\x16\\x6b\\x8f\\x0f\\xdd\\xb3\\x53\\x7c\\xdb\\x9d\\x11\\x15\\xbc\\xa1\\x80\\x3d\\x02\\xd7\\xc4\\xd0\\xa7\\xc2\\x5a\\x39\\x3f\\x47\\xab\\x32\\x2e\\xc5\\xc4\\xe0\\x73\\xa3\\x54\\xd4\\xfc\\x00\\xac\\xfa\\x64\\x46\\x30\\xfd\\xe7\\xc7\\x8f\\x26\\x4a\\xcd\\xc7\\x47\\xf7\\x73\\xa7\\xf2\\x0f\\x9d\\x7b\\xf8\\x2e\\x8c\\xd1\\x09\\x20\\xb4\\x88\\xfb\\xd2\\x2f\\x0c\\x45\\x78\\x83\\x65\\xda\\x75\\xd8\\xdd\\x14\\x8c\\xea\\x0c\\x67\\x52\\x48\\x7f\\x82\\x86\\x4f\\x84\\xda\\xd2\\x1e\\x67\\x6a\\x7d\\x46\\xeb\\xc2\\x50\\xe6\\x79\\x6b\\xa8\\x8a\\x31\\x7f\\x6e\\xc2\\xa3\\x8b\\x85\\xc0\\xda\\x8e\\xb9\\x35\\xaf\\x1f\\xe0\\x94\\x5b\\xa6\\xae\\x84\\x6e\\x1b\\x62\\x29\\xd5\\x88\\x4b\\x4b\\x20\\x05\\x63\\x1e\\x61\\x20\\x61\\x34\\x22\\xcc\\x04\\x80\\x8b\\x39\\xf6\\x56\\xec\\x9b\\x60\\x9c\\x6f\\x7d\\x71\\x9e\\x89\\xde\\x68\\x31\\x47\\x4c\\xe2\\x23\\x7a\\x20\\x3e\\x5f\\x04\\xc5\\xe6\\xb9\\x1e\\x2c\\x23\\xfa\\x9d\\x29\\x2c\\xf1\\x2c\\x42\\x16\\xe5\\x68\\x1a\\xb1\\x7e\\x99\\x66\\xb1\\x44\\x5c\\xf8\\x4b\\x3e\\xad\\x93\\x94\\x10\\x5a\\x53\\x05\\x98\\xd3\\x39\\x4c\\xc5\\xba\\xde\\xcb\\xe4\\x03\\xe8\\x41\\x83\\x5f\\xe7\\x3a\\x3b\\xc3\\x3d\\xd2\\x44\\x95\\x90\\x52\\xc8\\x25\\x55\\xb2\\xa4\\xc3\\xdb\\x30\\x4e\\xd0\\x60\\xd2\\x8e\\xd4\\x54\\x47\\x22\\xd9\\xee\\x74\\xdc\\x76\\x84\\x39\\x40\\xa0\\x6d\\x46\\x95\\x44\\x28\\x38\\xab\\xea\\xcc\\x17\\x28\\x9a\\x9d\\x0e\\x2d\\x86\\x4d\\x91\\x94\\xca\\x99\\x28\\xab\\x86\\x38\\x05\\x83\\x28\\x26\\x7a\\x80\\x26\\xad\\xac\\x32\\xca\\xc4\\x41\\x00\\x9e\\x8b\\xf5\\xa0\\x73\\xf3\\x64\\xa8\\x89\\x9a\\x5c\\xa1\\x86\\xa0\\xd4\\x3e\\x0c\\xa0\\x91\\xb2\\xd1\\xb1\\x57\\x82\\xef\\x5b\\xd0\\x31\\xe3\\xec\\x63\\xf0\\x9f\\x87\\x7f\\xfe\\x3f\\x14\\x78\\x18\\xba\\x81\\x3e\\x3f\\xb6\\x87\\xc8\\xa1\\xc6\\x27\\x19\\xc5\\x5c\\xac\\x44\\xa7\\xd9\\x08\\xf3\\x9e\\xbb\\xbb\\x0c\\xe1\\x91\\xcf\\x52\\xe3\\x4c\\xa3\\xcb\\x0c\\xa2\\x81\\x11\\x54\\x4e\\x99\\x29\\x6b\\x6c\\xf7\\xa5\\x5a\\x9e\\x81\\x76\\x02\\xcd\\x0f\\x88\\x34\\x8a\\xa9\\xce\\x5a\\xa3\\x34\\xcc\\xd8\\x3f\\x74\\xd4\\x39\\x82\\xde\\x39\\x52\\x79\\x9f\\x90\\x7d\\x49\\x7a\\xc2\\x9c\\x52\\x85\\x75\\x2b\\xd3\\xf9\\xaa\\x63\\xdb\\xbf\\xac\\x27\\x8f\\xb1\\x9d\\x0f\\xda\\x7a\\xb0\\x87\\xa9\\x4b\\xbc\\x7f\\xe3\\x4e\\x0d\\xaa\\xdc\\x09\\x2f\\xd2\\x4f\\x3a\\x12\\x7b\\x4e\\x72\\x4b\\x3b\\x9b\\x1e\\x45\\x92\\x12\\x6d\\x1c\\xf9\\xed\\xfb\\x4b\\xe2\\xca\\xcb\\xd3\\x57\\xa7\\x97\\xa7\\x43\\x2f\\xb4\\x45\\xfb\\x39\\xc6\\xc3\\x38\\x92\\x46\\x3b\\x06\\x0a\\xbf\\x93\\x17\\x2a\\xcc\\x42\\xe9\\x62\\xe9\\xaf\\x84\\x13\\xcb\\x39\\xf6\\xad\\xce\\x2a\\xb2\\x67\\xd6\\xda\\x1d\\x05\\x7c\\xd9\\xe2\\xaf\\xee\\xa1\\x35\\x45\\x05\\xd6\\x5b\\xd7\\x14\\x80\\x45\\x4e\\x1e\\xd4\\xc6\\x4d\\x68\\x3d\\x53\\x3b\\x34\\xc6\\x4d\\xe1\\x48\\xb8\\x0a\\xcb\\x96\\x08\\xa8\\xde\\x15\\x24\\x94\\x56\\xe8\\x1d\\xe9\\x98\\x72\\x60\\x7f\\x94\\x43\\x54\\xce\\x65\\xd3\\xba\\x25\\x18\\x9c\\x9d\\xee\\x37\\x6b\\x01\\x14\\x04\\x10\\x60\\xb0\\x49\\x6c\\x14\\x25\\x33\\xfe\\x21\\x88\\x37\\x18\\xb4\\x77\\xb0\\xa0\\xd0\\x0d\\xc7\\x9d\\x33\\x34\\x6e\\x58\\x75\\x24\\xf0\\xd6\\xd3\\x1b\\x5c\\xa8\\x13\\xce\\x7f\\x60\\xb0\\xc6\\x60\\xd3\\x65\\xe0\\xdb\\x7a\\xe4\\xf8\\x78\\x93\\xcf\\x4d\\x56\\xc0\\xbd\\x0b\\x8f\\xc9\\xd0\\xa3\\x3f\\xa0\\xbf\\xfe\\x51\\x0d\\x1e\\x1b\\x33\\x31\\x0d\\x11\\xf7\\xc0\\xa6\\xd1\\x56\\xa2\\x07\\xda\\xa3\\x9c\\x71\\xca\\xb8\\x7c\\x8c\\xac\\x3e\\x01\\xbb\\x07\\x99\\x17\\x26\\x76\\x59\\xd7\\xce\\x22\\x8c\\x46\\xc2\\x23\\x72\\x4a\\x2b\\xf4\\x95\\xad\\xec\\xc8\\xd5\\xf1\\x80\\x88\\xa0\\x67\\x4a\\xf4\\x9f\\xd9\\x76\\xc5\\x1f\\xc2\\xeb\\xb0\\xb4\\x31\\x1d\\x07\\x70\\xde\\x2b\\xc0\\xe6\\x3b\\x39\\x7f\\x77\\x61\\xa7\\xc4\\x3f\\x62\\x0e\\x29\\x95\\x12\\x30\\xa2\\x60\\xa9\\xe4\\x22\\x8d\\x93\\x50\\x42\\x25\\x72\\xb6\\x80\\x37\\xc0\\x86\\xc1\\x9d\\xb2\\x01\\x39\\x09\\xa6\\x5b\\x68\\x0f\\xbf\\xfc\\x3f\\x3a\\x24\\x83\\x84\\xe1\\x19\\x58\\x75\\x49\\xaa\\x74\\x5c\\xf6\\x72\\x53\\x81\\x8d\\xdf\\x22\\x63\\x3a\\x03\\xd2\\xbf\\x77\\x5c\\x3d\\x70\\x33\\x9f\\x1b\\x6f\\x15\\xe0\\x63\\x8a\\x50\\x46\\x45\\x45\\xde\\x86\\xf2\\xc6\\x5b\\x30\\xda\\x40\\x7c\\xbf\\x82\\xe9\\xbe\\x6e\\xbe\\x77\\x70\\xa8\\x6d\\x84\\xd7\\xe2\\x55\\x9b\\xf0\\x23\\xed\\x54\\x36\\x72\\x53\\x09\\xcc\\xc3\\x6b\\xb5\\x88\\x50\\x25\\xcd\\xc3\\xcf\\x8b\\x36\\x3a\\xc2\\xf3\\x2c\\x75\\x34\\xbb\\x6a\\xc5\\x1d\\x7e\\x39\\xac\\xd1\\x40\\xa2\\xda\\xac\\xf2\\xc4\\xbf\\x69\\x05\\x7e\\x80\\x02\\x11\\x3a\\x16\\x44\\x50\\xb3\\x28\\xe1\\xe9\\x1d\\xec\\x9b\\xac\\xa4\\xf1\\x5d\\x37\\xe3\\x1e\\xdd\\xa5\\x5b\\x46\\xdc\\x42\\x55\\x3d\\x29\\xae\\x4d\\xaf\\x43\\x13\\x73\\xce\\xc6\\x4e\\x1a\\xb2\\xa7\\xe5\\x99\\x7e\\xe5\\xff\\xc9\\x96\\x48\\x36\\xe3\\x25\\xe6\\x53\\x19\\xa5\\x6f\\xf3\\xba\\xf5\\xe1\\x27\\x5b\\x96\\x4e\\x96\\xaf\\x16\\x21\\x3a\\x7c\\xb0\\x6e\\x88\\x77\\xc0\\x40\\x71\\x41\\x84\\x03\\xbc\\x77\\x0f\\x2b\\x3a\\x9d\\x1d\\xd8\\x99\\x5f\\x38\\xd8\\xdc\\x66\\x71\\x54\\x4f\\x2f\\x4a\\x47\\x72\\xf7\\x4b\\x0e\\x64\\xb5\\x40\\xc0\\x66\\x5e\\xea\\xfb\\x55\\x81\\x4e\\xd7\\xc7\\xa5\\x7c\\x88\\x47\\xe3\\x86\\x59\\xc5\\x90\\xf3\\x84\\x28\\xa5\\x24\\xac\\xdc\\x52\\xd8\\xe7\\xa5\\x87\\xb7\\x80\\x12\\x4a\\x92\\x13\\x99\\x96\\x6d\\x69\\x12\\xa6\\xf1\\x74\\x46\\x49\\x69\\x98\\xc5\\x3e\\xe6\\xc8\\x5e\\x24\\x57\\x16\\x0e\\x71\\xf3\\x19\\xb0\\x8d\\x5c\\x51\\xd2\\x91\\x2a\\xe9\\x78\\xde\\xdf\\x76\\xf1\\x75\\x84\\xd3\\x06\\x4f\\x17\\xb6\\xe2\\x83\\xbf\\x7e\\x4d\\x64\\x1a\\xd2\\xf9\\xbf\\x13\\x19\\x5b\\xe6\\x88\\x15\\xd3\\x3d\\xf4\\x80\\xfb\\x47\\x0d\\xab\\xba\\xc6\\x8c\\xb7\\x5a\\xaf\\x56\\x6c\\x03\\x3a\\x66\\x8f\\x9c\\xcb\\x41\\x95\\x33\\xad\\x13\\x59\\x96\\xe4\\xb7\\x81\\xb2\\xc4\\x70\\x87\\x47\\x1b\\xfd\\x26\\xda\\xa1\\x7a\\x7f\\xea\\x52\\x5f\\x0c\\xab\\x91\\xbe\\x46\\x0d\\x66\\xf6\\xf5\\x9a\\x6e\\x3a\\x8e\\x30\\x7a\\x64\\x6f\\x8e\\xe4\\x94\\xd3\\x09\\x56\\xee\\x48\\x1f\\xf1\\xdb\\xe8\\x2c\\x45\\xb5\\xcc\\xab\\xe0\\x1a\\x19\\xfb\\x22\\xa8\\x2c\\x27\\xfb\\xcd\\xb1\\xa3\\xb5\\x70\\xf0\\x9a\\x47\\x38\\xe4\\xa0\\x27\\xda\\x6d\\x2c\\x69\\xa4\\xe9\\xf5\\xd6\\xd4\\x38\\x9b\\x2c\\x9f\\x28\\x1a\\x98\\x79\\x8e\\x82\\x6f\\x65\\x40\\xc3\\x3d\\x8d\\x73\\x7d\\x77\\xff\\xd4\\x50\\xfe\\xe9\\xe7\\x06\\xa4\\x6b\\xa9\\x79\\x74\\x91\\x49\\x55\\xd1\\xe1\\x78\\x43\\x94\\x89\\x17\\xc5\\x71\\xcf\\x09\\x6c\\x3e\\x95\\x54\\x29\\xfe\\x7a\\xd0\\x67\\x22\\x93\\x05\\x2e\\xa2\\x6f\\x29\\x43\\x13\\xa2\\xfb\\x49\\xd7\\x16\\x64\\xcc\\xa8\\x71\\xa6\\x08\\xa7\\x32\\xfe\\x47\\x75\\x8e\\x77\\xb4\\x6b\\x90\\x5d\\x9f\\x55\\x27\\xe1\\x53\\xa5\\x06\\xea\\xe1\\xd1\\xd1\\x7d\\x1f\\x0c\\xf0\\x49\\xf3\\xd8\\x26\\x29\\x96\\x93\\xd7\\x4d\\x20\\xa7\\x45\\x26\\xcc\\x73\\x32\\x01\\x4c\\xfa\\x0e\\x08\\x05\\x51\\x02\\x13\\x14\\xcc\\x1b\\x68\\xef\\x62\\x56\\x35\\x71\\x66\\xbe\\x28\\x8c\\xc1\\x58\\x1a\\x1c\\x1e\\x1e\\x3a\\xb1\\x24\\x60\\x5f\\x3f\\x49\\x68\\x67\\xd0\\x4d\\x48\\x54\\x75\\xee\\x96\\x48\\x60\\x06\\xc4\\x15\\x38\\x81\\x30\\xc3\\x4e\\x56\\x87\\xa4\\x9b\\x5b\\x86\\x9e\\x76\\x22\\x3a\\x08\\x25\\x22\\x54\\x48\\xaa\\xb3\\x9a\\x43\\x27\\xdf\\xa9\\x68\\x5d\\x73\\xf2\\xf2\\x71\\x40\\x87\\x55\\x8a\\x32\\x04\\x84\\x74\\x3a\\x3b\\x3a\\x75\\xdc\\x34\\x6f\\x7e\\x8a\\xec\\x22\\x04\\x62\\x85\\x5e\\x29\\x46\\xe5\\xb0\\x95\\x89\\xc7\\x96\\xe3\\xfe\\xca\\x36\\xaf\\x0c\\x0d\\x1b\\x2b\\x1c\\xf4\\x66\\xac\\xd3\\x0f\\xd3\\x45\\x06\\x5e\\x02\\xf5\\x30\\x60\\xe6\\x2e\\xc5\\xd7\\x3b\\xc9\\x09\\x0a\\xc9\\x0d\\x4e\\x62\\x27\\x91\\x1c\\xb7\\x1c\\x43\\xfc\\x39\\xaa\\x8c\\x2f\\xcc\\xea\\x7f\\x90\\xbf\\x12\\xe6\\x18\\xbd\\xcb\\x2a\\x89\\x94\\xb0\\xa4\\x8d\\x5e\\xf2\\x34\\x71\\xab\\x48\\xbc\\xc2\\x8b\\x96\\x55\\x55\\x14\\xcb\\x75\\x10\\x49\\x68\\xa0\\xf0\\x8f\\x3f\\x11\\xde\\xcf\\x5c\\xab\\x0e\\xc2\\x01\\xab\\x1a\\x88\\x7f\\xeb\\xa5\\x7f\\x7a\\xee\\x22\\xa2\\x92\\x36\\xbe\\x8f\\x68\\x63\\xda\\xc4\\x90\\x3b\\x14\\x08\\xbf\\xbb\\xdc\\x0e\\xfa\\x49\\xa3\\xdf\\xb8\\xd6\\xac\\x01\\x76\\xcc\\xd7\\x82\\xc4\\x70\\x16\\x13\\xb1\\xe0\\x94\\x5d\\x10\\xba\\x6c\\xca\\x1a\\x0d\\x4f\\xde\\xe4\\x9d\\xa9\\xbc\\xd3\\x68\\x99\\x7d\\x87\\xa7\\xe9\\xf1\\x48\\x9b\\x9a\\x97\\x0d\\xee\\x23\\xda\\x2b\\x26\\xdb\\xae\\xf9\\xb8\\x47\\x5f\\x1d\\xd6\\x1e\\x1c\\x39\\xe1\\x05\\x16\\x27\\x01\\xf3\\x38\\x57\\xf8\\x1b\\xfe\\x85\\x39\\x95\\x25\\x86\\x28\\x9d\\xf0\\x70\\x1b\\x23\\xd0\\x3a\\xe7\\xe4\\x68\\xef\\xfc\\x03\\x29\\x1e\\x17\\xed\\x00\\x38\\x33\\x57\\x15\\x29\\x9a\\xe9\\x7a\\x44\\x27\\x2f\\x76\\xc1\\xb1\\x19\\x97\\xba\\x3b\\xf1\\xd5\\xfb\\xaf\\x07\\x16\\x66\\xf0\\x02\\xc8\\xf9\\x02\\x65\\x7a\\x49\\xaa\\x94\\x33\\x6a\\xb5\\x32\\x45\\x53\\xff\\xfd\\x6f\\xbe\\x95\\xff\\xfe\\xeb\\xa1\\x03\\x22\\xfa\\x11\\xf0\\x19\\x87\\x32\\xbc\\xef\\x48\\x39\\x6b\\xea\\x79\\x2f\\xeb\\x1f\\x01\\x99\\xca\\x07\\x35\\x97\\xe2\\xfd\\xd7\\x75\\xa5\\xf2\\x99\\xcf\\x7d\\xf8\\xbc\\x18\\x93\\xad\\x83\\xb8\\x15\\xb6\\xe2\\x74\\x5f\\xf7\\x72\\xd7\\x44\\x29\\x3c\\xd3\\x1e\\xb4\\x55\\x7c\\x8d\\x6a\\x42\\x26\\xd0\\x0a\\xc9\\xea\\x89\\x0a\\x05\\x7c\\x8b\\x81\\xa3\\x08\\x00\\x4d\\xcb\\x70\\xe7\\x54\\x28\\x21\\xcb\\xbf\\x82\\x8f\\xdf\\x9b\\x11\\x35\\x24\\x5f\\x1e\\xb5\\x4e\\xfe\\x5b\\xdb\\x83\\x9f\\x7e\\x26\\x30\\x0c\\x32\\x6f\\x8e\\xf8\\x86\\xcc\\x57\\xcd\\x1f\\xa0\\x67\\xdd\\x32\\x16\\x3e\\xfa\\xe9\\xe7\\xaf\\x1b\\x57\\x4e\\x7f\\xfa\\x0e\\x4d\\x72\\x5c\\x2f\\xfa\\x22\\x5d\\x75\\xa4\\xaf\\xb7\\x7e\\xb6\\xc6\\x86\\x9b\\x8e\\xc9\\x87\\x57\\x68\\x1c\\x56\\x57\\x6d\\xe5\\x18\\x13\\xdf\\x43\\x63\\xa3\\xed\\x80\\x60\\x29\\xad\\xa0\\x62\\x39\\x13\\xe4\\x25\\x8a\\x1a\\xa1\\xba\\xa4\\x6a\\xce\\x0a\\xa5\\x26\\x6b\\xfa\\x17\\x5f\\xf6\\xde\\x80\\x7b\\xaa\\x89\\x46\\x18\\x9a\\xe7\\xfe\\x8f\\xe0\\x5c\\x6b\\x0d\\x27\\x83\\xdb\\x99\\x57\\x83\\x53\\xb4\\x19\\x04\\xcb\\x02\\x24\\x7e\\x36\\x81\\x33\\xf0\\xa1\\xfa\\xf2\\x45\\xdb\\x7a\\x98\\x2b\\xc5\\xbc\\x34\\x7d\\x1c\\xd7\\xbf\\x32\\x2e\\xeb\\x41\\xaa\\xd5\\xb6\\x94\\xae\\x2d\\x63\\x09\\x39\\xe9\\xcb\\x97\\xaa\\x70\\x78\\xd3\\x6d\\x47\\x34\\x2a\\x21\\x09\\x0c\\xa8\\xba\\x50\\xb4\\x8b\\xc2\\x7c\\xd5\\xe8\\x8e\\x33\\x47\\x06\\x3a\\x07\\xdb\\x28\\xff\\xbb\\x35\\x85\\x1b\\x6f\\x5d\\x2b\\xff\\x9b\\x95\\x83\\x37\\xdd\\xa6\\xf9\\xdf\\xa4\\x0e\\x28\\x88\\xee\\x42\\xb1\\xaa\\x2a\\xf0\\x30\\x7a\\xac\\x8a\\x40\\xe7\\xf9\\x16\\x36\\x93\\x24\\xcd\\x4a\\x93\\x72\\xdf\\x6a\\x50\\xea\\xb7\\x4f\\x16\\xf2\\xe4\\xba\\x41\\xea\\x0b\\x8b\\xc9\\x5d\\xa4\\x77\\x06\\x55\\x50\\x56\\xe5\\x5b\\x75\\xbc\\xcd\\xb0\\x8e\\x79\\x87\\xe5\\x08\\x4d\\xa1\\xa5\\x03\\x89\\x8e\\xa5\\x19\\x66\\x2c\\xe0\\x6d\\x7c\\x46\\x34\\x9e\\x2a\\xc7\\x1e\\x46\\x7b\\xf5\\xa3\\x3d\\xcb\\x20\\x8b\\xd6\\x37\\x7d\\xab\\x4f\\xeb\\xf6\\xae\\xff\\x46\\xcb\\x51\\x48\\x0f\\xfb\\x4b\\xdb\\xb5\\x7d\\x0d\\x30\\xcd\\xea\\xcf\\x16\\xd8\\x67\\x0b\\x6c\\xe7\\x2c\\x30\\x47\\x78\\x3f\\x9b\\x60\\x7f\\x44\\x13\\x6c\\x13\\x02\\xf0\\xd9\\x06\\xdb\\x45\\x1b\\x6c\\xcd\\x92\\xf0\\xd9\\x08\\xdb\\xa2\\x11\\xe6\\xf1\\xae\\xf1\\x10\\x93\\x12\\x3c\\x6a\\xa4\\xc5\\xf4\\xb4\\x1a\\xe7\\xea\\x47\\xc5\\xad\\xcc\\xc2\\x67\\xce\\x92\\xb2\\x47\\xc2\\x7a\\xb9\\xf8\\x57\\x30\\x6b\\x00\\xf8\\x84\\x27\\x9e\\xdc\\x9b\\xb8\\x60\\xd7\\x59\\xe2\\x26\\x11\\xae\\x1c\\xe4\\xce\\x3d\\xc3\\x3d\\x91\\xff\\xce\\xc1\\xd5\\xa4\\x63\\xd9\\x8a\\x5a\\x0d\\x07\\xb6\\x6b\\x27\\xa7\\x7b\\x40\\x2b\\x34\\x5d\\x99\\xc0\\xef\\x14\\x67\\xdb\\xd5\\x28\\x49\\xe5\\x26\\x90\\xfa\\x98\\xd6\\xee\\xe9\\xa9\\x0d\\x4a\\x95\\x37\\x4f\\xf5\\xac\\x0c\\xc1\\x5a\\x5c\\xa2\\xd6\\x8f\\xef\\x7a\\x84\\xca\\x9f\\xa2\\xa7\\x40\\xb9\\x47\\x19\\xf5\\x83\\xff\\xa5\\xa9\\xba\\x19\\xc1\\x22\\x13\\x6a\\x1e\\xa5\\x3d\\xa3\\x6e\\x11\\xc9\\xe2\\xeb\\xaa\\xdf\\xc6\\x79\\x51\\xda\\xa4\\x16\\x8b\\xb7\\x37\\x6e\\xf7\\xe2\\x2c\\x66\\x57\\x05\\x26\\x66\\xa6\\xe5\\x7c\\x52\\x36\\x0e\\x6b\\x52\\xe6\\x10\\xe1\\xce\\xb3\\x90\\x2d\\xd1\\x6d\\x3d\\x12\\xea\\x4f\\xb1\\x51\\x09\\x9d\\x4f\\xd6\\x0e\\x11\\x5d\\x9a\\xd0\\x74\\xed\\xd9\\xd2\\xf9\\x69\\x61\\xd2\\x4d\\x2b\\x08\\x56\\x10\\x2d\\x61\\x2e\\x55\\xea\\x22\\x6d\\x59\\xea\\xdd\\xc2\\x90\\x33\\x1f\\x53\\xd9\\x9a\\xb2\\x99\\x24\\xc3\\xae\\x2c\\xa9\\x88\\x70\\xd5\\x44\\xc1\\xf7\\x07\\x3c\\xe8\\x8b\\xa3\\xc6\\x88\\xc7\\xee\\x46\\x64\\x24\\x7b\\x4d\\x02\\x32\\xa6\\xc4\\x86\\xfe\\x1d\\x6b\\x6b\\x72\\x55\\x9f\\xc6\\xd4\\xf7\\x6f\\xc2\\x42\\xf1\\xa7\\x74\\xf7\\x4e\\x28\\xae\\x43\\x33\\xf4\\x9b\\x04\\x62\\x4c\\xe2\\x2e\\x6b\\xfc\\x48\\x25\\x0a\\xaf\\x17\\x5c\\x12\\x55\\x8f\\x82\\x53\\xce\\x06\\xe6\\x87\\x71\\x21\\xb9\\xd1\\x6f\\xb9\\x16\\x44\\x25\\xcf\\x86\\x5f\\x39\\x9b\\x4c\\x54\\x14\\xc3\\x10\\x6f\\xe5\\xaa\\x02\\x40\\x8d\\xf5\\x84\\xa6\\x8d\\x6f\\xf7\\x78\\x09\\x2f\\xbd\\x14\\x53\\xc0\\xca\\x8f\\xf1\\x64\\x79\\x7c\\x1d\\xc3\\x6a\\x21\\x64\\x8e\\x18\\xa7\\xe7\\x22\\x19\\x04\\x9d\\xc0\\x3a\\x70\\xd3\\xcb\\xa5\\x32\\x67\\x23\\x76\\x7c\\xc3\\xd5\\x79\\xb9\\x00\\x80\\x9a\\xb0\\x19\\x78\\x29\\xde\\xf8\\x56\\xeb\\xc3\\xb2\\x69\\x22\\xbc\\x8b\\xfc\\xa3\\x7f\\x45\\x0c\\x7f\\xfa\\xa7\\xff\\x13\\xad\\x0c\\xff\\x27\\x58\\x1a\\xe1\\xdf\\xf1\\x86\\x84\\xa1\\x4f\\xc3\\xe9\\xf0\\x59\\x3a\\x9d\\x95\\x4d\\x5c\\x6f\\x96\\x89\\x5f\\x25\\x62\\x53\\xfa\\x03\\xe3\\x8f\\xa3\\x32\\x4f\\xea\\xbf\\xd6\\x81\\x20\\x2a\\xdc\\xc4\\xe3\\x72\\x2e\\x6c\\xaf\\xb3\\x59\\xa1\\x9a\\x60\\x6b\\x01\\x9d\\x81\\xbb\\x9a\\x95\\x25\\x9e\\xde\\xbb\\xa4\\x18\\x25\\x31\\xbc\\xf6\\x63\\xd3\\x8f\\x15\\x3a\\x66\\xe3\\x71\\xa1\\xaa\\x6f\\xf2\\x8f\\xff\\xac\\x33\\x61\\x3e\\x5f\\x8a\\x51\\xae\\x54\\xfa\\x63\\xd3\\x8f\\xce\\x9b\\x0d\\xc8\\x03\\x75\\x16\\x46\\x1d\\x6f\\xb4\\x3b\\x12\\x89\\xff\\xc4\\xeb\\xcf\\xfe\\xe4\\x74\\x69\\xc6\\xbc\\x03\\xff\\xf2\\x5f\\x69\\x00\\xa5\\xb7\\x78\\x0c\\x5b\\xc0\\x1b\\xb6\\x30\\x74\\xd8\\x88\\xeb\\xaf\\xac\\xe1\\x08\\xbc\\x13\\x2f\\xcd\\x4c\\xee\\x37\\xc5\\xca\\xd4\\xf8\\xd6\\xf1\\x5f\\xb9\\xf1\\xf7\\x04\\x1b\\x8f\\x54\\xc1\\xbf\\x90\\xb6\\x11\\x22\\xbb\\xbf\\x84\\x1f\\xab\\xd7\\x1d\\xaf\\xb2\\x8f\\xaf\\x81\\x08\\xb5\\x6b\\x90\\x5c\\x8f\\xea\\x9b\\xd9\\xd5\\x55\\xa2\\x8a\\xfa\\x43\\x35\\xfa\\x70\\x92\\x80\\xfe\\x6f\\x7c\\x72\\x5e\\xab\\x9d\\x3a\\xca\\xf2\\xfa\\x20\\xa0\\xfd\\x93\\x2c\\x2c\\xab\\xbf\\xdf\\xe4\\x6a\\xfc\\x06\\x2f\\x83\\x63\\x81\\xd1\\x5a\\x6d\\xa8\\x9b\\x72\\x92\\x5c\\xe8\\xf2\\xa3\\xd5\\x87\\xf0\\x17\\xde\\x1b\\xff\\xe1\\x26\\x2e\\x59\\x11\\x56\\x5f\\x48\\x33\\x82\\xfa\\x04\\xa1\\xac\\x8f\\x2d\\x4f\\x89\\x1f\\xd5\\x67\\xa0\\xb6\\x46\\x71\\x79\\x5f\\xff\\xb9\\x94\\x8c\\xf3\\xda\\x68\\xf0\\xe8\\x42\\x25\\x14\\xe3\\xa9\\x3e\\xe2\\x6b\\xb4\\xa7\\x60\\x5e\\xbc\\x08\\x6a\\x5a\\x9c\\x6e\\xb1\\xd6\\xbe\\x98\\x5d\\x4d\\xe2\\xb2\\x85\\x1d\\xe5\\x55\\x16\\x79\\x90\\x35\\xa5\\xc2\\x90\\x5d\\x51\\x3b\\x52\\x38\\xc1\\xcb\\x8f\\x68\\x0a\\x9a\\x92\\xae\\x91\\xad\\xab\\x1c\\x6a\\xe1\\xb3\\x77\\xdc\\x73\\x53\\xd5\\xb1\\x98\\xc5\\x65\\xa8\\xaf\\x4e\\xcf\\x0a\\x29\\xfa\\x84\\x57\\x46\\xff\\xe5\\xd6\\x66\\x82\\x87\\x74\\xb3\\xbd\\x72\\x53\\xb3\\x6a\\xf0\\xc0\\xa8\\x9c\\x77\\xec\\xcd\\xc2\\xc9\\xb8\\x02\\x98\\x6f\\xb4\\x0d\\xe0\\x0d\\x6d\\xc9\\xe8\\xcd\\xee\\x13\\x40\\xce\\x18\\x80\\xce\\xb5\\xe6\\xe3\\xe0\\x1b\\x66\\x2c\\x40\\x11\\x51\\x14\\x0a\\x4b\\xf8\\xd9\\x7a\\x88\\xa0\\x17\\xb0\\x78\\x02\\xde\\xd5\\x76\\xbe\\xda\\x2b\\x6e\\x42\\xcc\\xe1\\xdc\\xeb\\xba\\x07\\x6d\\xa8\\x38\\x74\\xbf\\x35\\x92\\xe4\\xd0\\xd6\\x5a\\x5e\\x98\\x2d\\x6d\\xa5\\xcb\\xa9\\x6c\\x08\\xaf\\xce\\x46\\xa6\\x7e\\x92\\xd4\\xc0\\x1a\\x48\\x51\\x00\\x5a\\x54\\xfb\\x52\\x75\\x09\\x87\\xa1\\x76\\x85\\x58\\xf0\\x4e\\x21\\xc6\\x58\\x34\\xde\\xad\\xe7\\x14\\xa7\\x09\\xa5\\x35\\xa7\\x5a\\x91\\x95\\x54\\xc1\\x18\\xef\\xa9\\x20\\x52\\x38\\x80\\xdc\\x96\\xd3\\x17\\x92\\x0c\\x00\\x74\\x65\\xd6\\x16\\x5e\\xc0\\x72\\xc4\\xba\\x57\\x14\\x23\\x43\\xd3\\xe7\\xa6\\x43\\x89\\x79\\xea\\x5a\\x89\\xe8\\x22\\x34\\x1c\\xdf\\x11\\x16\\x27\\x7a\\x26\\x60\\xa5\\xe4\\x92\\xa1\\xe5\\xe5\\x5c\\xb9\\xc2\\xb7\\xde\\x1a\\x85\\x5d\\xb1\\xb8\\x1d\\x75\\x2f\\x6a\\x47\\xdd\\xad\\x30\\xc2\\x3c\\xc6\\xe8\\x3a\\x52\\xa3\\x8c\\x8a\\x6a\\x60\\x60\\xb3\\x19\\xb7\\x13\\xfb\\x82\\xa0\\x95\\xa8\\x71\\xe9\\x6f\\xa0\\x60\\xc1\\x79\\xdb\\xa5\\xcc\\x2c\\x46\\x9b\\xc9\\xfe\\x67\\x49\\x37\\xb5\\x3e\\xae\\x9c\\x8a\\xd1\\x14\\xc3\\x1c\\xec\\x37\\x42\\x70\\xe1\\xbd\\x24\\x83\\x0a\\x2c\\x2e\\x7d\\x18\\x16\\xb9\\x75\\xe8\\x08\\x68\\xad\\x4d\\x56\\x1a\\x73\\x9d\\xb4\\x73\\x69\\x14\\xf4\\x6b\\x50\\x8b\\x55\\x3b\\x4b\\x99\\xf1\\x32\\xed\\x1d\\xf0\\x57\\x6c\\xf0\\x40\\x15\\x33\\x09\\x2b\\x3d\\x9c\\xa9\\x7f\\x50\\x39\\xbc\\x99\\x71\\x3b\\x26\\xb9\\xcd\\xd6\\x3e\\x97\\xb7\\x8c\\xd1\\xab\\xc3\\x1a\\x62\\x95\\x2a\\xd3\\xb3\\xc2\\x9e\\x35\\x53\\x7d\\xa1\\xb8\\xbe\\x7a\\xf9\\x33\\x7b\\xcd\\xbd\\x61\\x46\\x77\\x48\\xf2\\xec\\x33\\x5d\\x5e\\xd2\\x62\\x43\\xb5\\xca\\xb9\\x95\\x46\\x4b\\x83\\x0d\\x9b\\x35\\x3e\\x6f\\x0e\\x1b\\x58\\xa7\\xbb\\xbb\\x58\\x04\\x85\\x27\\x52\\x91\\xbd\\xa2\\x8d\\x95\\x84\\xbd\\x27\\x8a\\x59\\x2d\\xb5\\x46\\xcc\\x78\\x72\\x31\\x9e\\x2b\\x58\\x91\\x21\\x33\\x4b\\xf1\\x06\\xa8\\x7f\\x13\\xf8\\xf2\\x0e\\x6f\\x38\\x58\\x9d\\xea\\xf4\\x31\\xf0\\x2a\\x8e\\x9b\\xe9\\x2b\\x3d\\x92\\x6a\\xc7\\xe4\\x0a\\xeb\\xd7\\x0d\\xd2\\xec\\x4e\\x8b\\x3a\\x28\\x47\\x9c\\xc3\\x73\\x50\\xfb\\x13\\x82\\x0b\\x62\\x10\\xc2\\x38\\xb6\\x06\\xc7\\xd0\\x7f\\xc8\\x45\\x41\\x89\\x31\\x53\\x2a\\xec\\xed\\x53\\xa5\\xa1\\xa3\\x91\\x48\\x2a\\x6d\\x5e\\x3e\\x71\\x63\\x6c\\x64\\x51\\xbf\\x4d\\xfe\\x97\\xfd\\x6a\\x44\\x80\\xbc\\x6f\\xc4\\xd3\\xc0\\xd1\\xe4\\x71\\x5b\\x47\\xdd\\xd2\\x22\\x57\\x13\\xbe\\x07\\xfa\\xda\\xfc\\xd8\\x97\\x28\\x24\\x81\\xe6\\xc4\\xc5\\x4a\\xe0\\x95\\x02\\x07\\xb5\\x0f\\xe0\\x54\\x3a\\x66\\x2e\\xd4\\x8b\\xf3\\xa8\\x01\\x26\\x2d\\xfc\\x05\\xde\\xfd\\xae\\xc6\\x6d\\xdc\\x13\\xdc\\xfd\\x1e\\x70\\x47\\x6c\\x2a\\xcf\\x23\\xf6\\x2f\\xb3\\x09\\xf8\\xf5\\x97\\xd9\\x69\\x1a\\xd9\\x3d\\x78\\x1d\\xc8\\x50\\xe9\\x70\\xde\\xa6\\xa5\\x5f\\x4f\\x2b\\x52\\x7c\\x2a\\xd9\\x07\\x29\\x1c\\xf4\\x21\\x91\\xb2\\x1c\\xa2\\x8b\\x00\\xd9\\x94\\xa3\\x94\\x58\\x72\\x46\\x1e\\xd1\\x0d\\xf0\\x66\\x44\\x3b\\xf2\\x56\\xfa\\xe0\\xce\\x39\\x16\\x1b\\xc0\\x7e\\x8e\\xa9\\x97\\x84\\x75\\xf5\\xcd\\x74\\x51\\xe3\\x31\\xb5\\x6a\\x03\\x4b\\x14\\x4b\\x5b\\x9f\\x8d\\x75\\xf5\\xce\\x86\\xad\\x8b\\xd6\\x5b\\x10\\xeb\\x88\\x4d\\x72\\x5f\\xab\\x98\\xf0\\xdf\\xfc\\x1d\\x0d\\xa6\\x2b\\xe8\\x99\\x9a\\x34\\xba\\xf2\\x95\\xed\\x66\\x51\\x2b\\x0b\\xe9\\xed\\x2e\\xde\\xbd\\x5f\\x1e\\xd2\\x98\\xe1\\x4a\\x8a\\x07\\x63\\xeb\\x42\\x69\\x81\\xc1\\x35\\xdb\\x75\\x9f\\x3a\\x7e\\x9f\\xcb\\xca\\x4a\\x75\\x3d\\x7f\\x02\\x53\\xc1\\xd7\\xaf\\xf9\\x49\\xaa\\xc2\\x69\\x2a\\x48\\xba\\xe7\\x30\\x52\\x34\\xde\\x60\\x8f\\xfe\\x83\\xa3\\xee\\xed\\x93\\x95\\x44\\x45\\xbd\\xe3\\xca\\x5e\\x40\\x2f\\xb5\\x6f\\xe7\\x93\\x90\\xb4\\x39\\x55\\xc5\\xcb\\xe9\\x36\\xb1\\x56\\xd0\\x27\\x17\\x17\\xae\\xc7\\xae\\x6d\\x5d\\x29\\x93\\xec\\x3c\\x31\\xe7\\x0a\\x52\\xbd\\x2a\\xce\\x2b\\x25\\xec\\x2a\\xa6\\x41\\xa3\\x92\\xfc\\xaf\\x8a\\x92\\x44\\x8b\\x2f\\x4c\\x4e\\xb5\\x75\\x50\\xb7\\x14\\xc5\\x9a\\xd6\\x35\\xa4\\x2c\\xe3\\x07\\xb0\\x7c\\x0a\\xaa\\xf1\\xf7\\x27\\x82\\x48\\x7e\\x06\\xc0\\x26\\x85\\x82\\x75\\x52\\xb4\\x18\\x6e\\x3c\\xde\\xaf\\x35\\x0f\\xec\\xad\\x76\\x4d\\x52\\xaf\\xdf\\x26\\x97\\xf4\\x19\\xa0\\xef\\xb4\\x5f\\x75\\x9e\\x2a\\x8e\\x90\\x69\\xcb\\x73\\xcc\\x35\\x68\\xc6\\xf5\\xd2\\xe6\\xd4\\x40\\xd1\\x6f\\xa0\\xea\\x3a\\x65\\xd4\\x3c\\xd8\\x0c\\x83\\x27\\x03\\xfa\\xf8\\x00\\x1e\\xd9\\x02\\x95\\xba\\xb8\\x57\\xc9\\xb5\\xc0\\xb0\\xd2\\xd6\\xd4\\xba\\x10\\x7e\\x55\\x33\\x5f\\x15\\x60\\x23\\xa8\\x39\\x7d\\x02\\x4d\\x8d\\x86\\x7a\\x7d\\x85\\x95\\x29\\x84\\xcd\\x61\\x56\\xad\\xe0\\xb4\\x63\\xd4\\x06\\x94\\xad\\xaf\\xa4\\x27\\x7b\\x31\\x9f\\xf6\\x55\\xe2\\x7f\\xcf\\xdd\\x61\\x44\\xd3\\x10\\x1e\\xba\\xa7\\x28\\x2d\\x68\\xb2\\x31\\xd5\\x47\\x6c\\x67\\x8f\\x2e\\x82\\x3c\\x12\\xfb\\x91\\x2c\\xba\\x0a\\x3d\\xa5\\x0c\\xdc\\x98\\x4b\\x06\\x49\\x9d\\x2e\\x5b\\x99\\x14\\xd6\\xbf\\x6e\\x1c\\xd6\\xc2\\x4c\\x5d\\xea\\xd0\\x3f\\xe6\\xaa\\x33\\xd7\\xd5\\x39\\x14\\xe9\\x3a\\xd0\\x7e\\xb4\\xed\\x26\\x5b\\x54\\xc6\\xd6\\xcd\\x20\\x8e\\xcd\\x5f\\x52\\x9b\\x29\\x72\\xeb\\xb8\\x70\\xf3\\x84\\xf1\\xac\\x44\\xf6\\xba\\xac\\x2d\\xea\\x8c\\x78\\x9b\\x2b\\xee\\x91\\x33\\x30\\x73\\x5a\\xbe\\xc8\\x24\\xb0\\x45\\x02\\x1e\\x85\\x44\\x19\\xf4\\x59\\xc4\\x39\\xfd\\x54\\xe7\\x57\\x4b\\x01\\x14\\xf6\\x7e\\x1b\\xab\\xc5\\x3c\\x3e\\x1e\\x6e\\x92\\xce\\x9b\\x22\\xaa\\x99\\xea\\xa2\\x43\\x91\\xc9\\x6b\\x96\\xfa\\x01\\xd7\\xe9\\xeb\\x8b\\x57\\x70\\x46\\xdd\\x26\\x4c\\x79\\x59\\xa7\\x8c\\xfd\\xa1\\x1e\\xd0\\x0c\\xac\\x63\\x67\\xc2\\xb0\\x45\\x14\\x92\\x86\\xa7\\xae\\x98\\xf4\\x68\\x9e\\x5e\\xd2\\x53\\x3e\\x73\\x89\\x00\\x9a\\x47\\x5e\\x6e\\x51\\x2b\\x0e\\xdd\\xbc\\x0b\\xff\\x21\\x2f\\xc0\\x5a\\xbf\\x26\\x2e\\x0c\\x16\\xb2\\x62\\x77\\xaa\\x72\\x6f\\x43\\xab\\x4b\\xf5\\xd2\\xe3\\xb6\\xf6\\xc3\\x68\\x0f\\x4b\\x0f\\xd3\\xd6\\x6a\\xaf\\x2d\\x8a\\xaa\\xde\\x27\\x8a\\x7b\\x43\\xd5\\x4b\\xbc\\x9a\\x7a\\x51\\x47\\x74\\x78\\x9b\\x24\\xf1\\x35\\xae\\xb6\\xef\\x66\\x08\\xda\\xe0\\xe3\\x24\\xe1\\x42\\xf3\\x43\\xd3\\x76\\x09\\xcb\\xa3\\x97\\x93\\xa4\\xb2\\x01\\x5c\\xab\\xb2\\xa2\\xff\\xa5\\x40\\xea\\x92\\xb5\\x95\\xe8\\xed\\x5a\\x8f\\xa6\\xce\\x3d\\xfb\\x51\\x32\\x99\\xe0\\x39\\x46\\x0f\\x21\\xb6\\x65\\xfd\\x72\\xd3\\x60\\x40\\xd8\\xdc\\xd0\\x9b\\xd2\\x64\\x76\\x54\\xa3\\xd8\\x7f\\x08\\xe9\\x91\\xa6\\x72\\x6c\\x23\\xff\\xf6\\xc0\\x32\\x85\\xb5\\xb0\\x0e\\xa4\\x04\\x7a\\xb7\\x80\\xa1\\x6c\\xb9\\x15\\x45\\x77\\x4c\\x8b\\x18\\x66\\x20\\xc6\\xeb\\x5e\\xce\\x3b\\x4e\\xe7\\x9d\\x58\\xc8\\x1d\\x0c\\xdc\\xd4\\x8a\\x9a\\xcf\\x56\\xaf\\xc7\\x1f\\xf6\\xdc\\xe9\\xcd\\x56\\x69\\xe3\\xab\\x9b\\xff\\xc5\\x3b\\xbb\\x9e\\x18\\xf9\\xd6\\x15\\xc5\\xca\\xd1\\x3e\\x5a\\x9e\\xfe\\x55\\x06\\x3c\\xd4\\x59\\xab\\xee\\x9a\\x01\\x14\\x3d\\x72\\x8f\\xba\\x97\\x36\\xcd\\xa8\\x23\\xfd\\x8e\\x69\\xd5\\xe0\\x1d\\x97\\x95\\xa5\\x37\\xcc\\xde\\x4a\\xdd\\x6d\\xe8\\x04\\x45\\x7a\\xb0\\x89\\xd7\\x8d\\xdd\\x14\\x39\\x6a\\x18\\x72\\xef\\xeb\\x07\\xd8\\x9d\\x51\\xf0\\x86\\x4d\\x1b\\xf4\\x34\\x2b\\x76\\xc5\\xbe\\xdb\\xb2\\xa4\\x3c\\xee\\x7d\\xe1\\x93\\x16\\xc1\\x07\\x33\\x12\\x1b\\x62\\xce\\xd8\\x6f\\xf9\\x60\\x3a\\xcb\\xa7\\x18\\xa8\\x35\\x97\\x8d\\xa5\\xd2\\xa2\\xd3\\x1d\\xdd\\x1e\\x9e\\x02\\x42\\x77\\x2a\\xc7\\xee\\x83\\x77\\xe1\\xbd\\xd3\\xa8\\xca\\x70\\x1b\\xbf\\x2d\\x5a\\x24\\x18\\x6b\\x5e\\xfb\\xc1\\x28\\x5d\\xd3\\xb1\\x1a\\x76\\xe2\\x37\\x99\\xa3\\x7c\\x04\\x7b\\xa3\\x5b\\xf7\\xb9\\x13\\x01\\xfb\\x31\\x61\\xb9\\xb2\\x75\\x99\\xd4\\xec\\x01\\x0d\\x53\\x27\\x87\\x7e\\xa1\\x21\\x88\\x97\\x25\\x51\\xc1\\xe7\\x37\\x58\\xbb\\x51\\x6a\\x06\\xb3\\xc0\\xca\\xb6\\xc3\\x61\\xec\\xa7\\x54\\xb2\\x3b\\x92\\xd4\\x94\\xb6\\xe0\\x0d\\x8c\\x06\\x02\\x44\\x87\\x2f\\xdc\\xec\\x87\\xcf\\x5e\\x48\\xe6\\xf1\\x63\\x7a\\x21\\x2e\\xa4\\xdf\\x67\\xae\\x5b\\x61\\x3a\\x00\\xf8\\xd9\\xd7\\xf8\\xfe\\x3b\\xfc\\x72\\x80\\x7f\\xb9\\xa9\\x35\\xcd\\x11\\x84\\x63\\x69\\x0a\\x1d\\x36\\xa8\\x8d\\x90\\x0e\\x16\\x0a\\xca\\x2a\\x83\\xf9\\x58\\x75\\xc4\\x05\\x1b\\x2f\\x3a\\xe1\\x63\\x42\\xad\\x17\\x43\\x1d\\x2f\\x91\\x53\\xe4\\x36\\xfe\\x9a\\xc1\\x9a\\xd4\\x54\\x68\\x1f\\xc3\\xb2\\x93\\xe2\\x50\\x95\\x01\\x6c\\x71\\xca\\x97\\xe7\\xaf\\x75\\x26\\xc8\\x30\\xf0\\xba\\x34\\xe9\\x63\\x04\\xe9\\x30\\x56\\xe8\\x8f\\x3c\\x42\\x0d\\xf4\\x5c\\x76\\xdd\\xd8\\x52\\x91\\x32\\xae\\xdc\\x70\\x33\\x52\\xf1\\xe0\\xe4\\xd3\\x67\\xf4\\x8c\\xbd\\xfe\\x17\\xaa\\xf5\\x3c\\x9c\\x4a\\x1f\\x44\\x46\\xbe\\xe9\\x4a\\xfe\\x40\\x3e\\x30\\xf8\\x3d\\x3a\\xc4\\x28\\x13\\xc7\\x26\\xaf\\x55\\x64\\x83\\x06\\x72\\x10\\x2f\\x16\\xc6\\x9c\\xc6\\x37\\xe8\\x3b\\x17\\x2b\\xea\\x04\\xf8\\x26\\xc6\\xe4\\xdb\\xb0\\x7a\\x3e\\x6c\\x76\\x26\\x7b\\x93\\x13\\x00\\xc2\\xca\\x97\\x63\\x00\\xb4\\xb8\\x81\\x27\\x49\\x46\\x69\\xa1\\x2d\\x98\\x1a\\xed\\xe4\\x1f\\x3d\\x6b\\x5f\\xc0\\xf6\\x33\\xc1\\x71\\x63\\xd1\\x21\\x15\\x6c\\xf4\\x18\\x58\\x95\\x9b\\x83\\x85\\x49\\x1c\\xda\\x13\\x09\\x3e\\x1f\\xab\\x19\\xd2\\x0f\\xce\\x64\\xd9\\x2f\\x2a\\x46\\x45\\x6f\\x1e\\xf2\\x8f\\x47\\xc1\\xaf\\xbf\\x3f\\x3e\\x94\\x52\\x1b\\xf3\\xf7\\x50\\xa0\\x24\\x08\\xcc\\xf2\\x6d\\xc1\\x65\\xae\\x82\\xd1\\x4d\\x2c\\xc3\\x46\\x69\\xf1\\x84\\x90\\x72\\x99\\xf0\\x2c\\x1a\\x05\\xb0\\x7a\\xd3\\x7b\\xd0\\x31\\x07\\x3b\\x53\\x85\\xbf\\xb4\\xa4\\xfd\\xc6\\x38\\xb9\\xb7\\xa6\\x8f\\x36\\xae\\x8c\\x93\\x34\\x0e\\xf2\\xf0\\x0e\\xcc\\xd3\\xd7\\xaf\\xda\\xf6\\x37\\xb0\\x77\\x9c\\xac\\xb7\\x31\\xbd\\x4b\\x44\\x61\\x07\\xce\\xce\\xc2\\xed\\x6b\\x78\\x43\\xa7\\x3b\\x59\\x54\\xf2\\xbd\\xa0\\x0f\\x86\\x14\\xbf\\xff\\xd1\\xce\\x62\\xc8\\x7f\\x97\\xaa\\x5c\\xeb\\x7e\\x3c\\xf0\\xd3\\x7f\\x7a\\x05\\x8a\\x31\\xe3\\xd1\\xe0\\x65\\x7a\\x63\\x11\\x00\\x55\\x2a\\x21\\xbc\\x76\\x43\\xf0\\x86\\x87\\xe5\\xa5\\xff\\x7c\\x0c\\xb4\\xa4\\x43\\x7e\\xd1\\x8c\\xf0\\x1f\\x6c\\x59\\x51\\x94\\x61\\x1a\\x61\\xcb\\x6d\\xf8\\x9b\\xe8\\xac\\x37\\x08\\xee\\x4d\\xfc\\x55\\x14\\xdf\\x3e\\xfb\\x1a\\x37\\x48\\xfc\\xeb\\xeb\\xaf\\x9e\\xe1\\xff\\xef\\xd7\\x2e\\xbd\\xe9\\x56\\x7f\\x45\\xa5\\xe9\\xb7\\xf9\\x5d\\xf2\\x45\\x0b\\xee\\x2a\\xac\\xaf\\x85\\xd9\\x8c\\x3f\\x4d\\xf3\\xe4\\xfe\\x40\\x88\\x6c\\x32\\xee\\xba\\x88\\x6d\\x27\\xd0\\xa6\\x6f\\x07\\x99\\xdf\\xa9\\x24\\x4e\\xc1\\x03\\x28\\x6e\\xac\\xb5\\xa5\\xbb\\x9d\\x4b\\x52\\xc4\\x9f\\xa8\\xed\\x39\\xba\\xfa\\x2d\\xf4\\xe4\\x62\\xb5\\x78\\x4e\\x33\\x2f\\x0f\\x26\\xb7\\x85\\xd1\\x65\\x75\\xeb\\xa1\\x0b\\xcb\\x50\\xe9\\x50\\x56\\x8c\\xb2\\xa9\\x72\\x3b\\xf0\\xc9\\x17\\x71\\x09\\x8a\\x67\\xbc\\x5f\\xbd\\x06\\x7d\\x92\\xa5\\xe3\\x24\\x1e\\x95\\x03\\x03\\xcd\\x0b\\xd7\\x68\\xd3\\xc9\\x14\\x55\\xfc\\xdf\\x5a\\x73\\x5b\\xac\\x6c\\xad\\x12\\x6a\\x4e\\x15\\x16\\x3f\\x47\\xdd\\x86\\xb6\\xa9\\x9b\\x3a\\xc2\\x89\\xc7\\x43\\x50\\x7c\\x33\\xca\\x60\\xa9\\xdc\\xce\\x14\\xdb\\xda\\x04\\x55\\xfc\\x7c\\x01\\x75\\xdb\\xa1\\x14\\x75\\x95\\xa2\\x22\\x38\\x77\\x26\\xac\\x8e\\x4f\\xa6\\x1a\\xef\\x04\\x4e\\x1c\\xcd\\xe6\\x43\\x3b\\x64\\x42\\x35\\xf7\\xd5\\xe5\\xd7\\x58\\x36\\xd4\\x8c\\xad\\xeb\\x13\\x5c\\xfe\\x56\\xbd\\x59\\xf8\\xec\\x0b\\xb4\\xf9\\xea\\x05\\x90\\xbe\\x78\\xd6\\x55\\x19\\xca\\xb5\\xf0\\xb3\\x0f\\x01\\x77\\x4c\\xa4\\x2c\\x71\\x20\\xae\\xb5\\x28\\x4d\\x53\\x3a\\xf4\\x36\\xb0\\x08\\x53\\x3c\\x9a\\x25\\x61\\x5e\\x4d\\xc1\\xc1\\x13\\xbf\\x5c\\x81\\x40\\x2b\\xc9\\xf6\\x82\\xed\\x04\\xb5\\x98\\xdc\\x33\\x71\\x5f\\xbf\\xc7\\x6c\\x23\\x56\\x37\\xb9\\x56\\x8b\\x72\\xbc\\xec\\x64\\x59\\x7a\\xf4\\x18\\x15\\x05\\x02\\x59\\xcc\\x69\\xb6\\x08\\xaf\\xbd\\xa1\\x84\\x49\\xb9\\x85\\x54\\xdb\\x5b\\x4a\\xe4\\x4b\\x98\\x5f\\xc5\\x65\\x1e\\x62\\x75\\x29\\x74\\x78\\xc3\\xa2\\xc8\\x46\\x31\\xad\\x5a\\xe3\\xc9\\xdb\\xce\\xeb\\x26\\x75\\x96\\x2f\\x9b\\x16\\x4e\\xde\\x2b\\x89\\x0b\\x36\\xa2\\x71\\x72\\x5c\\x5b\\xcc\\xd7\\x4b\\xd9\\xb1\\x1c\\x03\\xd6\\x4c\\x6b\\x67\\x75\\x7b\\xb8\\xeb\\x11\\x00\\x59\\xab\\x02\\x99\\x6e\\xac\\x4d\\x63\\x35\\xb2\\x4e\\x3b\\x1f\\x80\\x57\\xbf\\x65\\x30\\x2f\\x65\\x43\\xa0\\x17\\xe9\\xa7\\x4a\\x5a\\x35\\xfc\\x8e\\xb2\\x56\\xb5\\x95\\x87\\x81\\x43\\xe8\\xa1\\x4e\\x07\\xbf\\x04\\x89\\xba\\x6c\\xb8\\x93\\xcf\\xc4\\xe1\\x19\\x81\\x2c\\x98\\xf9\\x25\\x31\\x9e\\x82\\x88\\xae\\x73\\xad\\x95\\x1e\\x9c\\xe9\\xe6\\x34\\x8c\\xc6\\x97\\x07\\xe6\\x31\\x0e\\x20\\x93\\xee\\x93\\xa0\\xd0\\x7e\\x82\\x61\\x8d\\xf6\\x41\\x1f\\x15\\x13\\x2c\\x71\\xbb\\x29\\xdb\\xd2\\x73\\xe8\\x13\\xa5\\x68\\x07\\x55\\xf6\\x5b\\x16\\xed\\xa9\\xe8\\x79\\xde\\x64\\x3f\\xda\\xc6\\xd6\\x7a\\xe7\\xe5\\x0c\\x46\\x0d\\x39\\x99\\xb3\\xf5\\x1d\\xb8\\x97\\x5f\\x49\\x5b\\x9b\\x98\\x51\\x76\\x13\\xc4\\x66\\xe2\\xda\\x59\\xe1\\xc9\\xa2\\x5a\\x73\\x6d\\x3d\\x2e\\x3d\\xc6\\x2e\\x6f\\xad\\x61\\x49\\xca\\xb4\\xb4\\x5d\\xf6\\x31\\x97\\xd4\\xed\\x7e\\x37\\xfe\\x68\\x7a\\xe6\\x82\\x69\\x93\\x47\\x95\\xbc\\x53\\x9f\\x8c\\x92\\x6c\\x59\\x97\\x2f\\x03\\x46\\xbd\\x19\\x54\\x95\\xbc\\x0d\\xed\\x1e\\x52\\x43\\x90\\x1b\\x6a\\x6f\\xad\\x05\\xaa\\x59\\x5f\\xb6\\x1e\\xe6\\xb4\\xfa\\xee\\x68\\x8c\\xf2\\x0d\\x41\\xe2\\x5a\\x5d\\x3e\\x60\\xda\\x97\\x2d\\x22\\xd2\\xda\\x4b\\xe1\\x42\\x47\\xc3\\x24\\xa7\\x76\\x5c\\x6b\\x6e\\x6c\\x3c\\x59\\x91\\x9b\\x55\\x24\\x85\\xea\\xf4\\xe3\\x2e\\xa1\\x13\\xec\\x4c\\x69\\x00\\x9f\\x51\\x0f\\x22\\x17\\x0b\\x49\\x05\\xd5\\x5b\\xa8\\xa9\\x9f\\xd7\\xa6\\x4f\\xd7\\xf6\\x68\\x7a\\x87\\x3d\\x38\\x39\\xf9\\x58\\x97\\x9d\\xa8\\xac\\x36\\xee\\xe5\\x2b\\x84\\x7e\\x20\\x12\\xeb\\xe9\\x60\\x4b\\xfd\\x5f\\xa2\\xca\\x71\\x53\\x83\\x62\\xd6\\x1f\\x36\\x9d\\x5c\\x5f\\x26\\x66\\x42\\x4a\\x4f\\xbd\\x62\\x41\\xb6\\xd9\\xcd\\x58\\x4f\\xde\\xd8\\x6e\\xe2\\x51\\x30\\x33\\x4b\\xad\\x22\\x0d\\xa9\\x53\\xd6\\xe3\\xd0\\x9c\\x8d\\xcd\\x69\\xd0\\x3c\\x72\\xa3\\x0d\\x08\\xb0\\x9b\\x4e\\xbf\\x34\\x9f\\x6c\\xdc\\xaa\\xd6\\x15\\xa5\\xa3\\x1b\\x0c\\x96\\x8d\\x88\\xc1\\xe9\\x00\\x7f\\x92\\x76\\xe5\\xc8\\x37\\x34\\x56\\xdf\\xd2\\x9a\\x6c\\x9c\\xd4\\x23\\x7d\\x97\\x91\\xc3\\x83\\x54\\x6b\\xbc\\xe0\\x6f\\x8d\\x4a\\x9b\\x2d\\x8f\\xfa\\x89\\x43\\xd3\\xe9\\xcb\\xc8\\xb9\\xfa\\xe9\\x9f\\x91\\xe5\\x62\\x0f\\x85\\x78\\xf8\\x11\\xa7\\x74\\xa0\\x3d\\x2b\\x63\\xee\\x58\\xe8\\x54\\x0e\\x73\\xbc\\xf3\\x5c\\x5d\\xc7\\x05\\x06\\x17\\xe9\\x4c\\x67\\x9a\\xf8\\x6d\\x94\\xc4\\x7d\\x27\\x19\\x20\\xce\\x15\\x78\\xcf\\xe2\\x36\\xfb\\xa0\\xea\\xbf\\xa3\\x09\\x80\\x05\\x3b\\xf8\\x7a\\x81\\x3e\\xcf\\x43\\x18\\xc3\\x38\\xc1\\xac\\x48\\x5b\\x23\\x16\\x36\\x4b\\xd7\\x6d\\xc4\\xbd\\xc1\\xfd\\x77\\x55\\xfa\\x2b\\x4c\\x90\\x86\\x9d\\x74\\x59\\xa2\\xbd\\x8d\\xc6\\x2f\\xb3\\xa2\\x74\\x32\\x68\\x3d\\xaa\\x09\\x9d\\x7c\\xee\\x38\\x4e\\xe1\\xc0\\x99\\x82\\x4e\\xd6\\xe4\\x51\\x43\\xc1\\x9d\\x5a\\x3c\\xb5\\xb3\\x18\\xcf\\x29\\xaf\\x36\\x6f\\xde\\xf1\\xc7\\x23\\xb9\\x5e\\x8a\\xff\\x03\\xcf\\x11\\x03\\xb8\\xa6\\xa1\\xc6\\x73\\xf3\\xc4\\x26\\xbc\\xd2\\x50\\xb8\\x24\\xf1\\xcc\\xab\\xa1\\x7b\\x3a\\x7a\\x5c\\x24\\xcc\\xe6\\x7e\\x4a\\x41\\x9d\\xaf\\x0e\\x9d\\xef\\x9f\\x99\\xbf\\xe9\\x1e\\xc5\\x2d\\x5e\\xb8\\x76\\x2f\\xd9\\xe2\\xff\\x0a\\xba\\x69\\xdb\\x04\\x0b\\x6c\\xea\\xe4\\x6c\\xff\\x1a\\x14\\x89\\xbd\\xa2\\xf8\\x1c\\x58\\x5d\\xd8\\xcb\\xba\\xda\\xe1\\x6c\\x00\\xfe\\x3b\\x8a\\x8a\\x80\\x1f\\x1d\\xe9\\x4e\\x79\\x54\\xef\\x49\\x43\\xdb\\x0c\\x68\\x36\\x1e\\x57\\x6a\\x0e\\x30\\x90\\x6a\\xea\\x78\\x07\\xbf\\xd7\\x89\\x7e\\x19\\x7e\\x50\\x5e\\xcc\\x9e\\x25\\x55\\x2f\\x15\\xd4\\x6b\\x59\\xaa\\x3d\\xd5\\x98\\xda\\xa7\\xe1\\xbd\\x2a\\x69\\xd0\\xe6\\xba\\xf3\\x72\\x14\\xd4\\x76\\x4a\\x29\\xc3\\x5f\\xde\\x28\\xe7\\xee\\x37\\xdd\\x65\\xd1\\xe7\\x53\\x26\\xcc\\x48\\x67\\x93\\xb5\\xdd\\x59\\xbf\\x86\\x23\\x38\\x71\\x70\\xdb\\x53\\x4d\\x9e\\x0f\\x30\\x14\\xba\\xaf\\xd5\\xbc\\x99\\xcb\\x36\\x57\\x6b\\xf0\\x73\\x6d\\xf5\\xd0\\x63\\xa7\\xc9\\xda\\xbd\\x7b\\x8d\\xd3\\xed\\x8f\\x77\\x55\\xab\\xae\\xa6\\x67\\x31\\xed\\xdf\\x4c\\x07\\x5d\\x4b\\x58\\x19\\xa1\\x72\\x94\\x9d\\x67\\x1f\\xef\\x07\\x42\\x1d\\x6e\\xf3\\xe2\\x56\\xb1\\x32\\xc7\\xd0\\xa6\\xec\\x95\\x2e\\x4e\\x82\\x2f\\xd6\\xa1\\xb6\\xd5\\xaf\\x9a\\x5c\\xc2\\x6d\\x31\\x7b\\x93\\xac\\xa2\\x5d\\xe6\\xb2\\xb2\\x99\\xf7\\x93\\xa8\\x60\\x60\\x47\\x0e\\xbd\\xcb\\xce\\x2e\\x50\\x0c\\x70\\x3d\\xc8\\xbb\\x2e\\x11\\x61\\x37\\x3c\\x4e\\xad\\x45\\xd2\\x25\\x19\\x35\\xbe\\xfb\\x65\\x08\\x7a\\x49\\x01\\x0d\\x27\\xb5\\xa5\\x9a\\xab\\x24\\xb4\\xeb\\x05\\xd9\\xcd\\xf9\\xf2\\x1b\\xd6\\xb1\\x21\\xe7\\xee\\x23\\x9e\\x18\\xf1\\x0d\\x4f\\x63\\x60\\xb5\\x7a\\x71\\x13\\xd8\\xea\\x30\\x9b\\x01\\x99\\xa6\\xff\\xa6\\x48\\x07\\x8c\\x99\\xcd\\xaa\\xbd\\x31\\xb1\\x19\\xee\\x40\\x5e\\x3b\\x6a\\x3a\\x8c\\xc3\\x73\\x6e\\x47\\xbc\\xc7\\xa9\\x44\\xf0\\x82\\x67\\xcf\\x2e\\xcf\\x5f\\x9e\\x1f\\xc1\\x5e\\x35\\xd2\\xd1\\xc6\\x3b\\xf0\\x49\\x43\\x49\\xb7\\xc1\\x14\\x15\\x94\\x37\\x1e\\x25\\x2e\\xe8\\xc8\\xbf\\xe6\\x0e\\x3e\\x0b\\x6c\\x51\\x07\\xfa\\x45\\xfa\\xf7\\x1f\\xf9\\xf5\\x7a\\x1a\\x4e\\x31\\xd0\\x1f\\x65\\xbc\\xa8\\xd9\\x5f\\xe8\\x19\\x51\\xe8\\x75\\x80\\xb7\\x5d\\x8c\\x00\\x69\\x04\\x88\\x36\\x7a\\xea\\x36\\xef\\xbe\\xd6\\x55\\xa3\\x0f\\xa8\\x0c\\x2f\\xd7\\xe2\\x25\\xb8\\x54\\x27\\xf6\\xdc\\x97\\x84\\x8a\\xc7\\xad\\x8e\\x59\\x19\\x2b\\x6a\\x1f\\xeb\\x4a\\x39\\x6f\\x5d\\xdd\\x07\\x83\\x0a\\xe8\\xfb\\xed\\xb3\\xe8\\xb2\\x04\\xdc\\xb2\\x7b\\x60\\x00\\x77\\x6c\\x39\\x33\\x74\\x2f\\xa7\\xfc\\x98\\xab\\xfd\\xc6\\x23\\x90\\x2f\\xee\\x11\\xe5\\x94\\x0f\\xd6\\x57\\x5a\\x53\\xd3\\xb6\\x9c\\x7b\\x43\\x4e\\xf0\\x2a\\x3e\\x06\\xa2\\xe9\\x13\\xee\\x1a\\x0e\\x53\\x80\\x71\\xa7\\x03\\xf5\\x5c\\x15\\x11\\x2b\\x43\\x1f\\x72\\x50\\xdc\\xf9\\xe9\\x20\\x89\\x3f\\x98\\x60\\x3f\\xdb\\x84\\x61\\x90\\xa8\\xf4\\x1a\\xfe\\x30\\x4a\\x63\\x00\\x36\\xdc\\x0d\\x06\\xcc\\xac\\x36\\x7d\\x5a\\x38\\x2a\\x40\\xb4\\x08\\x45\\xb5\\x05\\x0c\\xa2\\x25\\xa8\\x0b\\xc6\\x26\\x8d\\x14\\xb8\\x1b\\x64\\x5c\\xff\\x19\\xc1\\xe6\\x09\\x0e\\xbe\\x3c\\x0c\\xce\\x89\\xb0\\x06\\x52\\x77\\x80\\xdb\\x38\\x44\\xda\\xc7\\xb9\\x68\\x91\\x7a\\xb4\\xbb\\x2e\\x3a\\xa6\\x46\\x95\\xa3\\x8d\\x4d\\xdd\\x65\\x8c\\x42\\x38\\x44\\xea\\xf4\\x71\\x7c\\x63\\x52\\xeb\\x56\\xd7\\xe5\\x53\\xb7\\x6d\\x27\\xd1\\x78\\x8d\\x0b\\x6d\\x47\\x63\\x99\\x58\\xb8\\x8e\\x82\\xcb\\x9f\\x7e\\x1e\\xda\\x07\\xf6\\xa0\\x9e\\x68\\x74\\x96\\x4a\\x06\\x82\\xae\\x6e\\x40\\xf1\\xc7\\xf3\\xf1\\xa9\\x76\\x12\\x2e\\xf5\\x26\\x69\\x86\\x68\\x8b\\x03\\x7e\\x96\\xa5\\x4f\\x46\\x96\\x9a\\x05\\x09\\x2d\\xa5\\xf9\\x82\\x64\\x0b\\x87\\x3a\\x52\\xe4\\x14\\x0e\\x99\\x2b\\x47\\xaf\\x55\\x7e\\xad\\xac\\xcd\\x40\\x2c\\x02\\x1b\\xe2\\x2e\\xab\\x9e\\x14\\x02\\x49\\xae\\x39\\x22\\x4a\\xde\\x22\\x99\\x01\\x54\\xac\\xd6\\x47\\xab\\x42\\x28\\x29\\x2d\\x6a\\x8f\\x92\\x2d\\x8d\\x72\\x70\\xa4\\xe3\\x5b\\x65\\x8e\\xe8\\x9d\\xe3\\x33\\xdc\\x72\\x6c\\x0d\\x7c\\x97\\xe3\\x62\\x87\\x60\\xfa\\x48\\xee\\x8c\\xc5\\xc5\\xf2\\x68\\x28\\x09\\xce\\x9a\\xea\\x94\\x38\\x18\\x17\\x5f\\x21\\x6f\\x35\\x4b\\xea\\x36\\x8a\\x9f\\xcd\\xf1\\xa5\\x03\\xad\\x9b\\x3d\\x62\\x01\\x72\\x20\\xc5\\x8c\\x11\\xa2\\x60\\x5c\\x0b\\xe1\\xf0\\x10\\x6f\\xb0\\x40\\x7d\\x15\\x13\\x67\\xd8\\xee\\xb1\\x44\\x48\\x08\\xbb\\x81\\x2e\\x5a\\xc9\\xb7\\x30\\x19\\x56\\xa7\\xa2\\xb1\\xcc\\xd7\\x6d\\x35\\x6f\\x98\\xdd\\x91\\x52\\x53\\x2c\\x06\\x01\\xa6\\x98\\xd4\\x82\\x60\\x8c\\xae\\xf0\\xee\\xa5\\xc2\\x6c\\xa6\\xd1\\x2c\\x2f\\x90\\xeb\\x83\\xf0\\x43\\x78\\xc8\\xef\\x8f\\xb2\\xe9\\x7d\\xcd\\x44\\x15\\xc1\\xf1\\xad\\x6e\\x26\\x04\\x95\\xf5\\x9a\\x23\\x42\\x3b\\xc6\\x5a\\xa4\\x83\\x31\\x1c\\x86\\xc1\\x52\\x9c\\xae\\x85\\x20\\xe4\\x94\\xa6\\x00\\xca\\xbb\\x47\\xec\\x78\\x0f\\x49\\xb2\\x15\\x92\\xfb\\x56\\xa7\\x27\\x62\\x1b\\xb7\\xfa\\x9d\\xcd\\x34\\xa8\\x5c\\x06\\xa1\\xf1\\xb0\\xc6\\xe0\\x60\\x44\\x55\\x2e\\xfd\\xe3\\xbc\\x2a\\x6c\\xdf\\x52\\x76\\x9d\\x73\\xb4\\x56\\x78\\xf7\\x35\\x78\\xff\\x2a\\xc2\\x32\\x2e\\x38\\xf7\\x89\\x1b\\x9f\\x9a\\x70\\x11\\x8b\\x85\\xdc\\x43\\x96\\x6f\\xe4\\x96\\x6f\\x48\\x81\\x17\\xeb\\x71\\x57\\x3d\\x1f\\x7a\\xf7\\xd2\\x44\\xd5\\x6d\\xff\\x6d\\xf4\\x08\\x66\\xd7\\x37\\x55\\x56\\xe3\\x9c\\x15\\x2d\\x9f\\xe9\\xfb\\xd9\\x7c\\xa1\\x1b\\xf6\\x09\\x18\\xf7\\x1a\\x6d\\xc4\\x92\\x21\\x1b\\xfb\\x45\\xbc\\xab\\x4e\\x93\\xa8\\x22\\xfc\\x6e\\xa8\\x2b\\x71\\x04\\x1c\\xd3\\xb1\\x1f\\xe9\\x97\\x50\\xdb\\x1f\\xfa\\x00\\x88\\xe3\\x97\\xeb\\x7a\\xcf\\x3a\\x79\\x85\\x4f\\xb3\\x03\\x4e\\x9f\\xd2\\xdb\\x90\\x93\\x9a\\x72\\x07\\x83\\x81\\x1f\\xd1\\x5c\\xec\\x3a\\x4e\\x61\\x8f\\x2a\\x71\\xed\\xee\\xf1\\x9f\\x7b\\x94\\x50\\xc6\\x45\\x5d\\xb0\\x5c\\x59\\x56\\x3a\\xc9\\xf5\\xa5\\x4e\\x3c\\x73\\x82\\x05\\xe2\\x79\\x3b\\xc9\\x9b\\x85\\xbe\\x06\\x3f\\xa6\\xb0\\x8f\\x61\\xf5\\xd8\\x64\\xdf\\xed\\xe9\\x8d\\x6d\\xcf\\x0c\\x80\\xaa\\xe3\\xb0\\x0a\\x87\\xd1\\x27\\x9b\\x9a\\x95\\x10\\xad\\x88\\x74\\xae\\xa6\\x68\\xe6\\x85\\xbc\\xd3\\xa2\\x61\\x47\\x13\\x1f\\x99\\x74\\xd2\\xf3\\xb1\\xec\\xc2\\x97\\xc3\\xa0\\xc9\\xbe\\xa3\\x4d\\xd8\\x2c\\x6a\\x46\\xc7\\x4b\\xef\\xb9\\xc4\\xb3\\xa6\\xea\\xda\\xb8\\x30\\xfd\\xe0\\xd1\\x65\\x35\\xa9\\x17\\x7c\\xf4\\x8d\\x56\\x17\\x66\\x4a\\x6a\\x7c\\x6d\\xd0\\x83\\xba\\xbc\\x13\\x14\\xc1\\x00\\x3e\\x3d\\xf8\\x12\\x37\\x3e\\xe4\\xda\\x38\\x9b\\xa5\\x51\\x5b\\xf5\\x00\\x9b\\x14\\x21\\x59\\x1c\\x4d\\xfd\\xe8\\xfd\\xc5\\x63\\x4e\\x78\\x64\\xc5\\xd8\\x78\\x3a\\x7f\\x59\\x5b\\x41\\x60\\xca\\x9d\\x11\\x5c\\x5a\\x9e\\x4d\\x51\\x32\\x46\\xa1\\xb4\\x23\\x70\\xa9\\x20\\x5e\\x0f\\x34\\x16\\x81\\xa6\\x6f\\xd8\\x83\\x20\\xfc\\x59\\x1b\\xb7\\x24\\xdf\\x66\\xe9\\xe2\\x71\\x2d\\xef\\xec\\x30\\xa2\\xcf\\xc6\\x38\\x95\\x44\\xa1\\xaf\\x07\\x3a\\x69\\x63\\x18\\x78\\x3c\\xd5\\xf0\\xbd\\x30\\x7c\\xb3\\x11\\xd2\\x2a\\x73\\xea\\xe7\\xc3\\x8c\\x88\\x5d\\xb5\\x9a\\x35\\xed\\x19\\xa3\\xba\\xd0\\x3a\\xea\\x05\\xbc\\xd5\\xa2\\x47\\x92\\x55\\x16\\x37\\x0e\\x23\\xc8\\x14\\x5c\\xd1\\xd0\\x29\\x47\\xea\\xc5\\x49\\xbb\\x7c\\xf8\\xd4\\xad\\x47\\x35\\x99\\xa2\\xad\\xae\\x7d\\x5b\\x2c\\xb8\\xae\\xc8\\x02\\xa7\\x18\\xad\\xdd\\xb8\\xda\\xc4\\x06\\xb1\\x70\\xb7\\x66\\xd7\\xf0\\xd5\\x87\\xd9\\x76\\xea\\xb8\\x7c\\x2a\\x53\\x56\\xb1\\x39\\xc5\\x1f\\x99\\x1c\\x7d\\x70\\xb2\\xd4\\x8f\\xc7\\x3e\\xe1\\xb5\\x5d\\x58\\xc8\\xb5\\xcc\\x42\\xae\\x65\\x9a\\xe4\\x88\\x2e\\xab\\xa5\\x37\\x4f\\x6a\\x07\\x16\\x1a\\x0f\\x7d\\x9e\\xb5\\x10\\x12\\xf6\\xbe\\x47\\x5c\\x16\\xbe\\x0c\\x89\\xfc\\xcd\\xa1\\xbe\\x59\\xb2\\xa8\\xe7\\xe9\\x5e\\x48\\x15\\xae\\x37\\xec\\x55\\x69\\xc9\\x5f\\x41\\x62\\x42\\x3f\\x6b\\x7b\\xa0\\x53\\x3b\\xf9\\x8e\\xda\\xde\\xaf\\xbf\\xef\\x21\\xad\\xf6\\xd0\\x0a\\x63\\x52\\xee\\xad\\x51\\x76\\xfc\\xc9\\xab\\x48\\xbe\\xc5\\x67\\xcb\\x08\\x51\\xeb\\x12\\x96\\xad\\x72\\x65\\x71\\xf1\\x87\\xd1\\xf0\\xfe\\x40\\xbf\\x2e\\xb5\\x86\\x29\\xc6\\x95\\xa2\\x21\\x16\\x17\\xce\\x5e\\xf0\\xe3\\xeb\\x57\\x36\\xf7\\x19\\xb5\\x3f\\x2b\\x10\\xf7\\xe7\\x36\\x6e\\xd0\\x60\\x12\\x3c\\xa3\\xbf\\xfb\\xf0\\xa3\\x3e\\x6b\\x15\\x47\\x78\\xf6\\x32\\x1b\\x0d\\x52\\xb2\\x05\\xdf\\xc0\\xff\\x77\\xc5\\xc5\\x4e\\x32\\x36\\x3e\\xb4\\xce\\x73\\x03\\x0d\\xec\\x7e\\x84\\x64\\x01\\xb8\\xd6\\xa8\\xa7\\x1c\\x9b\\x4b\\x20\\xbb\\x49\\xf8\\xbc\\x43\\xf2\\x50\\x29\\xd8\\x95\\xe0\\x34\\x1c\\xd7\\xd5\\xeb\\x24\\xfc\\xa0\\x6a\\x0a\\x56\\x52\\x42\\x6a\\x41\\x65\\x2c\\x93\\x4a\\x59\\x04\\x68\\x65\\xa0\\x31\\xa7\\xe9\\xd2\\x50\\x79\\x19\\x97\\x85\\x49\\x8b\\xa0\\x77\\xdb\\x40\\xb7\\x06\\xea\\xb1\\x36\\x50\\x4b\\x3d\\x53\\xcf\\x28\\xc4\\x9a\\xec\\x53\\x31\\xab\\xc9\\x4a\\x9d\\x67\\xa1\\x12\\xe6\\x06\\x72\\x33\\x12\\x46\\xa0\\xb4\\x99\\x9a\\xde\\x6b\\x03\\xf5\\x07\\x96\\x5b\\x77\\xce\\x21\\x1b\\xad\\x74\\xe2\\x54\\x68\\x80\\xc4\\x6c\\x1d\\xf0\\x2a\\xda\\x6f\\x5c\\xfd\\x93\\x70\\xca\\x7d\\xf6\\x3d\\x33\\xcd\\x09\\x97\\x2c\\x62\\xaa\\xbd\\x07\\x6e\\xbf\\x6f\\x48\\xff\\xd9\\x24\\xab\\xcf\\x73\\x51\\x25\\x96\\xe5\\x30\\x9c\\xa3\\x5e\\x1e\\x86\\xf9\\xc4\\xaa\\xe7\\xf3\\xf9\\x0e\\xb0\\x62\\x3a\\xa8\\x67\\xd0\\x59\\x72\\xe8\\xa8\\xe0\\xe1\\x7c\\xb1\\xa8\\x24\\x9a\\xf0\\xf2\\x0e\\x8e\\x6d\\x59\\x67\\xf1\\x0c\\x45\\x31\\x8d\\x81\\x24\\xe0\\x39\\x53\\x28\\x48\\x3e\\xe1\\x3e\\x21\\xe4\\xcf\\xf3\\xc7\\x6b\\x96\\xb3\\x81\\xc7\\x2f\\xf1\\xc6\\x1d\\x49\\xb3\\x7b\\xac\\x88\\xd8\\x79\\xfe\\x77\\xe9\\x00\\xe1\\xe4\\x0e\\x2c\\x18\\x84\\x93\\x8e\\x8f\\x6d\\xc1\\x98\\x4e\\x2d\\xc8\\xaf\\x5c\\xfa\\x2f\\x9b\\x50\\xc4\\xb0\\xe6\\x7e\\x6b\\x46\\x47\\x51\\xfd\\xc0\\x5a\\x9e\\x5d\\xba\\xf2\\xe0\\x8e\\x56\\x01\\x6c\\x18\\xcc\\xc0\\x33\\x87\\x7d\\xb6\\x6a\\x92\\xd0\\xcb\\x68\\x8b\\xd3\\x6b\\xb2\\x5c\\x79\\x44\\xfa\\x47\\x9b\\x53\\x84\\x37\\xac\\xc8\\x66\\x6d\\xb6\\xc0\\xd2\\x2c\\x9b\\x0e\\xda\\xa8\\x6b\\x1a\\x23\\xc9\\xf1\\xa6\\xb9\\xd3\\xa0\\x73\\x7a\\x74\\x3a\\x5a\\x19\\x4f\\x54\\x75\\xdc\\xbb\\x41\\x87\\x37\\xa0\\x0f\\x16\\xef\\x54\\x92\\x1c\\x60\\x61\\x45\\xc5\\xd5\\x5e\\xdc\\x93\\xc6\\xdc\\xc9\\x94\\xb7\\x22\\x5a\\xbb\\xf2\\xd0\\xc6\\x44\\xbc\\x45\\xce\\x91\\x18\\x67\\x5c\\x5c\\xe5\\x78\\x3d\\xaa\\x72\\xc8\\x8a\\x3f\\x51\\x85\\x14\\xfc\\x68\\x5e\\x08\\xe6\\x2d\\xdf\\xaf\\x0a\\x6d\\x99\\x70\\x5c\\x81\\xcd\\xbb\\x7a\\x35\\xca\\x47\\x89\\xaf\\x1e\\xd6\\xf8\\x95\\x05\\x8e\\x0e\\x8c\\xf3\\xea\\xdd\\x64\\xfa\\x09\\x5e\\x94\\xfb\\xeb\\x06\\x3c\\xb6\\x15\\x66\\xdc\\x88\\xa7\\xce\\x3c\\xca\\xd1\\x62\\x17\\x4f\\x37\\xda\\xb0\\xb7\\x6e\\xc8\\x61\\x4c\\x35\\xad\\xe9\\x14\\x76\\x6c\\x70\\x6a\\xa3\\x29\\x3c\\x5d\\xcb\\xb8\\x8c\\x16\\xfc\\x34\\x19\\xc0\\x03\\x07\\xa3\\xb6\\x16\\x11\\x7e\\x4b\\x6d\\xca\\xc7\\xc1\\x00\\x96\\x23\\x0c\\x3f\\xfd\\x74\\x92\\x80\\x2b\\xf3\\xf3\\xcf\\x12\\x0f\\xeb\\x16\\x0e\\xdf\\x12\\xc5\\x78\\x69\\x9f\\x71\\x2b\\xe0\\xdf\\x4f\\x55\\x9f\\xf6\\x16\\x17\\x59\\x5e\\x3a\\x81\\x96\\xca\\x55\\x5c\\xaa\\xca\\x4b\\x09\\x9e\\x43\\x27\\xd5\\x7d\\x36\\x4d\\xe4\\x66\\x3b\\x67\\xc4\\x45\\xb5\\x5b\\x7e\\x54\\x8c\\xfc\\x2e\\xcb\\xa5\\xff\\xa5\\xe9\\x6f\\xeb\\x8f\\x8d\\x36\\xb5\\x74\\x53\\xb0\\xa5\\xf3\\x7b\\x9b\\x50\\x95\\xe1\\x7c\\xf4\\x67\\x69\\xfc\\xaf\\x99\\xd2\\xd6\\x83\\x7b\\x33\\xd8\\xfc\\xdd\\x7f\\xed\\x78\\xa4\\x41\\xdb\\xb7\\xf5\\x8a\\x14\\xae\\x20\\xba\\xa3\\xd7\\xbe\\x68\\xaa\\x09\\x28\\x95\\x84\\x6b\\xaa\\x43\\xa1\\xbb\\xd8\\xe9\\x77\\xbc\\x7b\\x8f\\x34\\xfe\\x38\\x0f\\xaf\\x39\\x9f\\xd8\\xbf\\xf8\\x58\\x99\\xe4\\x83\\x52\\x53\\x16\\x95\\x62\\xee\\x75\\x38\\xbe\\xdb\\xa6\\xa4\\xb4\\x45\\xe1\\x9c\\xc9\\x98\\x59\\x19\\xab\\xfa\\xea\\xc7\\x87\\xde\\xf2\\x77\\x6f\\xdd\\xe3\\x43\\xe7\\x4e\\x88\\x01\\xc8\\x0b\\x99\\xb5\\x58\\xe3\\x9f\\x39\\xb2\\x09\\x8e\\xd8\\xb2\\x0a\\x73\\xd8\\xe1\\xb7\\x05\\xd1\\x57\\x1e\\x53\\x4c\\x3e\\x1e\\x29\\x5d\\xf9\\xb9\\xb1\\x98\\x73\\xbd\\x49\\xd0\\x3b\\x9d\\xa8\\x1a\\xba\\x15\\x4d\\x2b\\xb5\\xd9\\xbd\\x52\\x9f\\xb6\\xa1\\x04\\xb7\\x74\\x60\\xef\\x17\\x5f\\x39\\xed\\xaa\\xbd\\x21\\x83\\x57\\xed\\xe7\\x2b\\x25\\x99\\xaf\\xd5\\xee\\xf9\\x30\\xde\\x89\\x4c\\xe4\\x54\\x46\\x55\\xb5\\x5c\\x24\\x9d\\xdd\\x04\\xfb\\xda\\xf7\\x65\\x39\\x7d\\xc7\\x50\\x1e\\x55\\xfe\\x3d\\xa4\\x01\\xcf\\x75\\xd5\\xcf\\xa6\\x6e\\x84\\x0d\\xd7\\xa0\\x96\\x26\\x8d\\x9c\\xd7\\xa7\\x9c\\x94\\x54\\x23\\x54\\xb0\\x6e\\x4a\\x9d\\x52\\xee\\x53\\x1f\\x32\\x55\\xcb\\xd5\\x0c\\xe7\\x56\\x86\\x1d\\x72\\xfa\\x56\\x4a\\x73\\xf4\\x24\\xdd\\x31\\xdd\\x93\\xe8\\x28\\xe8\\x20\\x19\\xc4\\xa1\\x4f\\x40\\x53\\x1e\\x69\\xe3\\x04\\xbb\\xc0\\x73\\xc0\\xe5\\xe9\\x75\\xde\\x51\\x3e\\x76\\x3d\\x72\\x65\\xbd\\x0e\\x8f\\x40\\xba\\x9b\\xc6\\xc6\\xe9\\x83\\x39\\xda\\x0e\\x81\\xd6\\x84\\x15\\x7a\\xf4\\xfe\\x8a\\xa1\\x04\\x51\\xbd\\x6c\\xa2\\x6d\\x20\\x06\\xbe\\xcb\\x22\\x78\\xcd\\x15\\x65\\x44\\x0c\\x53\\x4e\\x6a\\xc2\\x6c\\x7b\\x58\\x48\\xd6\\x3e\\x15\\x8c\\xd8\\x02\\x8a\\x3c\\xdb\\xfa\\xb5\\x66\\x2f\\x61\\xaf\\xd2\\xaf\\xbd\\xe0\\x1a\\xda\\xfa\\xf6\\x96\\x92\\x09\\x3d\\xd0\\x06\\x6a\\x1c\\xdc\\x7e\\xf7\\x80\\x76\\xa2\\x16\\x9b\\xd9\\x1c\\x7a\\x15\\x63\\x33\\x5a\\xa0\\x26\\x4e\\x3e\\xc7\\xb1\\xfe\\x48\\x63\\x45\\x33\\xfe\\xe7\\x6f\\x9a\\xd3\\x4e\\xc3\\xa7\\x01\\xf7\\xa0\\x28\\xd4\\x25\\xe5\\x07\\x77\\x15\\x8c\\xec\\x96\\x8f\\x1e\\xec\\x3f\\xa5\\x4a\\xac\\xb6\\xc4\\x0b\\x35\\x44\\x30\\x71\\x90\\xd0\\x31\\x22\\xf1\\x08\\x96\\x5a\\x21\\x52\\x25\\x2a\\x1f\\x49\\x53\\x78\\x72\\xb0\\xef\\x37\\x0a\\x5b\\x68\\x26\\xc7\\x40\\xa5\\x84\\x25\\x92\\x40\\x2e\\x6c\\xde\\x32\\x9d\\x74\\x34\\x3b\\xea\\x6a\\x62\\xd6\\x18\\x40\\x89\\x24\\xe1\\xc2\\x9e\\x28\\x8f\\xd0\\x23\\x1c\\xa8\\x82\\x5a\\x92\\x50\\xb4\\x50\\xc2\\x78\\x02\\x6e\\x45\\xd0\\xdb\\x2c\\x67\\x1a\\x86\\xae\\xaa\\x9d\\x77\\xb4\\x09\\xa0\\xb7\\x94\\x4e\\x27\\xf7\\x7a\\xb4\\xd0\\x23\\x5b\\xff\\xc3\\x34\\xec\\x6a\\x59\\x68\\xa2\\x56\\xa2\\x88\\x3c\\xda\\x81\\x99\\xbe\\xe1\\x4a\\xd5\\xd6\\x68\\x60\\x16\\xcd\\x71\\x35\\x37\\x21\\x9e\\xd3\\x3e\\x81\\x91\\x67\\xe6\\x37\\xd0\\xc6\\x94\\x15\\xb2\\xef\\x0d\\x8a\\x7d\\xac\\xbf\\x40\\x99\\x4f\\x6e\\x28\\x76\\x9a\\x71\\xd7\\x36\\x8d\\x81\\x49\\xd7\\x4e\\x0d\\x42\\x3a\\xd9\\xa4\\x79\\x54\\x92\\x48\\x9d\\xa8\\xd9\\x3f\\x7c\\xaa\\xa3\\x67\\xf5\\xf9\\x5a\\x38\\x26\\x49\\x14\\x04\\xb5\\x4d\\x85\\xad\\xf3\\x11\\x97\\xf2\\xfc\\x5b\\x72\\x11\\xa3\\xa4\\x6f\\x09\\x56\\x0b\\x37\\xe9\\xdb\\x9b\\xe0\\x8a\\xf0\\x51\\x9a\\x0b\\x32\\x55\\xe5\\xd0\\xa5\\x06\\xb1\\x3a\\x4f\\xcc\\x31\\x4b\\x4c\\x48\\xb5\\xd5\\xe8\\x6a\\x68\\x7c\\x03\\x43\\x99\\xfa\\x71\\x7d\\xae\\xf2\\x7d\\x27\\x91\\x19\\xd3\\x21\\x8e\\x6f\\x48\\x8b\\xbc\\xeb\\xbb\\xfa\\x6c\\x5c\\x35\\xb0\\xad\\xbf\\x1c\\x9a\\x41\\xdf\\x34\\xdd\\x2c\\xb1\\x53\\x72\\xb4\\xa8\\x82\\x18\\x3c\\x1d\\x78\\x03\\x34\\x44\\xb4\\x2a\\x88\\x61\\x3f\\x06\\x57\\xba\\x9d\\xea\\x41\\x1a\\xab\\x8d\\x21\\xd0\\x5a\\xe2\\xe3\\xd8\\xcd\\x65\\x29\\x0d\\x20\\xe6\\xe3\\xbe\\x68\\x0f\\xfd\\xa6\\x8f\\xbf\\x99\\xe4\\x90\\x16\\xf5\\xf2\\xc8\\x88\\x41\\x99\\x6b\\x8d\\xfa\\xa8\\xf4\\xd3\\x7d\\xc0\\xb9\\x29\\xc5\\x00\\x6c\\x58\\xcf\\xab\\xea\\x1a\\x2c\\x60\\x69\\x41\\x95\\x02\\x1e\\xae\\xa2\\xe9\\xcd\\x8d\\x66\\xbd\\x81\\x2f\\x37\\xa8\\x8c\\x07\\xe4\\x56\\x5b\\xe5\\xac\\x03\\xaf\\x91\\x48\\x43\\x79\\x14\\x1f\\xf9\\xa6\\x3a\\x58\\xf8\\x56\\x7b\\x50\\xd9\\x96\\xac\\x30\\x27\\x72\\x55\\xd8\\x29\\x89\\x1a\\x14\\x6d\\x7c\\x9d\\x4a\\x6b\\xb3\\x6b\\x60\\x6d\\xca\\xda\\x77\\xee\\x06\\x7f\\x69\\x76\\x6b\\x12\\xc4\\xc6\\x64\\x31\\x53\\xb3\\xa2\\x7d\\x7b\\x6e\\x4d\\x04\\xd0\\x7a\\x92\\x0c\\x6e\\xef\\x28\\x6c\\x49\\xf5\\x28\\xc0\\x94\\x93\\xa4\\xc3\\x4c\\xbb\\x68\\x9b\\x95\\xec\\x81\\x95\\xf4\\x31\\xf5\\x0f\\x67\\x63\\xb2\\xa9\\x0a\\x1e\\xad\\x93\\xc2\\x3d\\xf8\\xeb\\x67\\xfc\\x10\\x42\\x76\\xec\\xf9\\x96\\xcf\\x06\\x51\\xec\\x56\\x33\\xee\\x84\\x46\\xdb\\xac\\xae\\x50\\x68\\xd8\\x06\\x5d\\x62\\xda\\x41\\x4f\\xa6\\x9c\\x77\\xed\\x0c\\x25\\x01\\x1e\\x74\\x74\\x34\\x74\\x63\\xd3\\x67\\x76\\x26\\x9d\\x04\\x61\\x70\\xaa\\xb3\\xe7\\x9e\\x8f\\x9b\\x7b\\xb0\\xbe\\xa1\\x21\\x58\\xad\\xdf\\x50\\x22\\xee\\x36\\x2b\\x3b\\x01\\xaf\\xdb\\x44\\xfa\\xcc\\xfb\\xdd\\xe4\\xfd\\x7c\\xab\\xd1\\x5e\\xb3\\x5a\\xa3\\xcd\\xa8\\xc7\\x6c\\x34\\x32\\xcc\\x84\\x4d\\x16\\x23\\x3e\\x1c\\xb8\\x9f\\xcf\\xa9\\xe2\\x55\\xdd\\x72\\x9d\\x0b\\x12\\xcb\\x6d\\xb9\\xbd\\x41\\x5f\\xd4\\x56\\x34\\x89\\x2b\\xfd\\xf0\\x6d\\xb6\\x14\\x7f\\xb3\\xc7\\x24\\x3d\\x6d\\x90\\x75\\x11\\x24\\xae\\xda\\x20\\x1a\\xe8\\xb9\\x26\\x88\\x8b\\x62\\xdc\\x6a\\x82\\x3c\\x56\\x9e\\x2e\\x62\\xf2\\xae\\xae\\x88\\x0c\\x30\\x4d\\xca\\xa8\\x45\\x31\\x28\\x4c\\x97\\xba\\xcb\\xf2\\xa8\\x87\\x92\\xe8\\x2d\\x7c\\xad\\x7b\\x85\\x5c\\xff\\xbe\\xff\\x87\\x4d\\xff\\x9d\\x1f\\x1f\\xd3\\x85\\x77\\x3c\\x17\\x15\\x03\\xa5\\xab\\xef\\x17\\xbe\\x43\\x73\\x9c\\xfa\\x3e\\x0c\\xe7\\x08\\x3c\\x47\\x42\\xc2\\x90\\xba\\xef\\x2c\\x75\\x07\\x8e\\x4d\\x2f\\x87\\xb0\\x16\\x41\\xd1\\x1d\\x02\\xac\\xe1\\xec\\x13\\x4e\\x2a\\xab\\x76\\x79\\xb7\\x73\\x6b\\x10\\x71\\x89\\x5d\\xb6\\x7d\\x87\\x4e\\x05\\x1d\\x0e\\x6a\\xd1\\x05\\x19\\x3c\\x48\\xd0\\x41\\xae\\x35\\x91\\x6b\\x99\\xc8\\x9a\\x24\\x5a\\xd8\\xd0\\xf6\\x52\\xd1\\x35\\x1e\\xa5\\x62\\xc1\\x37\\x45\\x3a\\x1e\\x17\\xc1\\xd6\\x19\\x86\\x33\\x19\\x2b\\xab\\x2b\\x0a\\x1e\\x7c\\x9e\\xeb\\xeb\\xd2\\x7c\\xad\\x21\\x32\\xa7\\x92\\x56\\xc5\\x7a\\xd8\\x90\\x66\\x6e\\x2f\\x89\\xf5\\xb6\\xc3\\x62\\xe8\\x8a\\xf0\\x51\\x29\\x27\\xc2\\xc2\\x65\\xe2\\xb2\\xd2\\x33\\x0c\\x22\\x35\\x55\\xdc\\xf1\\x1a\\x6f\\x67\\x73\\x73\\x76\\xb3\\x58\\x9e\\x62\\x1b\\x19\\x4c\\x10\\x1c\\x29\\x5d\\x18\\xd4\\x98\\x60\\x34\\xea\\x5d\\x4c\\x35\\xe2\\x2b\\xb7\\x88\\x7b\\x2d\\x5e\\x57\\xce\\x06\\x56\\xfc\\xae\\xee\\x59\\x22\\x39\\x0e\\x8d\\xd7\\x39\\xb2\\xeb\\xeb\\x44\\x2a\\x42\\x36\\x61\\xa6\\x51\\x6a\\xd8\\x04\\x8b\\x3b\\x84\\xce\\xa6\\x8c\\x0c\\x30\\x7b\\x8a\\x8a\\x64\\x95\\xf9\\xac\\xbc\\xb9\\x7f\\x86\\x77\\xdd\\x60\\x23\\x30\\xdb\\x61\\xd4\\x78\\x21\\x82\\x21\\x75\\x8a\\xcc\\x50\\x58\\xda\\x30\\xa2\\x72\\xca\\xc7\\xf0\\xb6\\xb8\\xfc\\x43\\x86\\xc9\\x4b\\x1c\\x69\\x0f\\xd1\\xef\\x22\\xb3\\x35\\xcd\\xaf\\xdc\\xab\\x98\\x9b\\xa0\\xed\\xa7\\x4e\\xc8\\xaa\\x05\\xe7\\x55\\xbb\\xab\\x2b\\x69\\xbd\\x4c\\x04\\xf2\\xb6\\xbd\\xae\\x63\\xf1\\x2c\\xa7\\xde\\x87\\x4d\\xba\\xdd\\xb9\\xcc\\x2b\\xb8\\x36\\xe8\\xfa\\xad\\x4b\\x4c\\xcf\\xad\\x44\\xd6\\xa8\\x95\\x2c\\xbb\\xb5\\x74\\x2d\\xdf\\x36\\x9f\\x55\\x9b\\xb2\\x9e\\x08\\x2c\\x1f\\xc1\\xc3\\x7b\\xe5\\x1d\\x4e\\xa5\\x27\\x6c\\xab\\x9b\\x11\\xda\\x35\\xb4\\x01\\x3b\\x2e\\xa6\\x95\\x7b\\x07\\xb6\\x3a\\x21\\x75\\x94\\xe5\\x7c\\x7a\\x1d\\x49\\xda\\x60\\x1d\\x9a\\xca\\xbc\\x4e\\xe8\\x8f\\x4f\\x91\\x54\\xf4\\x4c\\x6e\\x5a\\xd5\\xd1\\xf6\\x3d\\x4b\\xfe\\x4f\\x57\\x79\\xd3\\x0d\\xd0\\xe3\\x11\\x9d\\x24\\xcc\\x33\\xa2\\x90\\x62\\xcd\\x12\\xef\\xd1\\xb1\\xc5\\x70\\x9a\\x1b\\x81\\x29\\xca\\xfb\\xa4\\xd1\\xc7\\x5d\\x77\\x1c\\xe6\\xd8\\x6b\\x11\\xe0\\xe3\\x38\\x82\\x55\\xdd\\x62\\x43\\xf5\\x3c\\xa6\\xab\\x74\\x2b\\x58\\x83\\x39\\x78\\x5c\\x6b\\x69\\x50\\xbb\\xb0\\xb4\\x44\\xc0\\xa5\\x0d\\xd3\\x55\\x4f\\xe6\\x1e\\x14\\xff\\x5d\\x58\\x46\\x73\\x09\\xdf\\x77\\x75\\x3d\\x28\\x6b\\x96\\x0f\\x83\\x39\\xf8\\x37\\x47\\xc1\\xe6\\xed\\x7b\\x98\\xdb\\x44\\x49\\x53\\x37\\x2a\\xbe\\xbe\\x29\\x57\\xd2\\x13\\x72\\x2a\\x40\\x03\\xb9\\xb7\\x91\\x5a\\x14\\x3f\\x52\\x50\\x66\\x45\\xed\\x4f\\xa5\\xa7\\xfa\\xe5\\xac\\x89\\x84\\xd2\\x45\\x59\\x75\\xdd\\x74\\x53\\xca\\x16\\x88\\x9c\\xc6\\x1f\\x55\\x22\\x8e\\xbc\\xfd\\x40\\x27\\x19\\x9b\\xf6\\x8d\\xb3\\x34\\x66\\xdc\\x54\\x58\\x60\\x69\\xe0\\x70\\x8a\\x26\\x24\\x96\\xaf\\x74\\x12\\xad\\xf6\\x1b\\x31\\x15\\x91\\x92\\x58\\x6a\\xdf\\x53\\x8e\\xe5\\xb1\\xef\\xde\\xe5\\x64\\xcc\\xf5\\x45\\x0f\\x65\\xc0\\xcd\\xe6\\xdc\\x08\\x29\\x9b\\x77\\x44\\x7e\\xe8\\xdd\\x80\\x6d\\x23\\xf6\\x36\\xc4\\x7d\\x18\\xd8\\xa6\\x49\\x53\\x2c\\xc9\\x04\\xff\\xc5\\x26\\xae\\xe8\\xbe\\x5e\\x65\\x79\\xa4\\xf2\\x6a\\x61\\x8f\\x54\\xe5\\xdf\\xd7\\x56\\x45\\x83\\x60\\x68\\x2e\\x61\\xd1\\x49\\x2d\\x1b\\xa9\\x3d\\x12\\x5f\\x17\\x58\\x6b\\x5f\\x4d\\xd8\\xcb\\xeb\\x7a\\x3d\\x6b\\xca\\x25\\x96\\xcf\\xf7\\xe6\\x95\\xd5\\x9b\\xe1\\x77\\x71\\x54\\xde\\x6c\\x8f\\xdf\\x3f\\xe0\\x74\\x0b\\xb0\\x9b\\xc1\\xfb\\x43\\x72\\x9b\\x49\\x45\\x04\\x58\\x95\\xd7\\x80\\x78\\x9c\\xd2\\x3d\\xbe\\x25\\x3c\\xb9\\x21\\x15\\x8b\\xa7\\x92\\x0b\\xa2\\xbd\\x9a\\x8b\\x46\\x64\\xe3\\x31\\x8c\\x60\\x53\\x5b\\x4f\\xec\\xb4\\xf5\\xe8\\x46\\x53\\x19\\x37\\xc7\\x8e\\xe4\\x9a\\x6b\\x53\\x52\\xb8\\x89\\x1a\\x97\\xba\\x6a\\x10\\x15\\x8d\\x64\\x7a\\x17\\xee\\x5d\\x2a\\xe2\\x8f\\xba\\xf3\\xbe\\xf1\\xf0\\xae\\x74\\x02\\x6a\\x8d\\xd8\\x3b\\x9f\\x3c\\x1a\\x18\\x3d\\xf2\\x3a\\x1f\\x34\\x10\\xba\\x23\\x9e\\xf4\\x58\\xb0\\x99\\x17\\x30\\xca\\x74\\x69\\x01\\x12\\x61\\x67\\xc0\\x8e\\xad\\xbb\\x79\\xc7\\x76\\x4a\\x84\\x4a\\x92\\x4e\\xa5\\x76\\x82\\xde\\xce\\x9b\\x16\\x8a\\x7c\\x51\\x29\\x9e\\xd0\\x5d\\xc9\\x2d\\xf5\\x7a\\x37\\x34\\x52\\xa8\\xad\\x25\\x9c\\x70\\xb7\\x25\\xd8\\x83\\x70\\x35\\xb2\\x1b\\xf7\\xfc\\x2e\\x21\\x78\\xa0\\x7d\\x7f\\x28\\xba\\x96\\x23\\x6a\\x4e\\x82\\xee\\x04\\x08\\x19\\xa7\\xb6\\xfd\\x9c\\xa3\\x3e\\x07\\x48\\xb4\\x0c\\x54\\xf5\\xde\\xf4\\xe3\\xde\\xbe\\x55\\xbf\\xa1\\x6b\\x93\\x89\\x23\\x9f\\x4b\\x4b\\xf8\\xb1\\xbe\\x0a\\x44\\xe5\\xe3\\xa5\\xc2\\x40\\xbf\\xce\\xaf\\x72\\xe5\\xf2\\x35\\x01\\xd4\\xfb\\x82\\xa6\\x23\\x65\\x4f\\x0b\\xc1\\xc6\\x88\\x5b\\x98\\x60\\x3d\\xfa\\x7a\\x71\\x03\\x40\\xca\\xec\\xdd\\xde\\xb4\\x5e\\x44\\x6e\\xee\\x86\\x48\\xc3\\xac\\xc7\\xfe\\x41\\xae\\xec\\xce\\x6e\\xe8\\xd2\\x6f\\x9e\\xed\\xf3\\x40\\x76\\xcf\\x5c\\x82\\x6e\\x5b\\xdc\\xd8\\x78\\x58\\x59\\xda\\xd6\\x61\\x7e\\xed\\xa0\\xb0\\xf5\\x32\\xbd\\xb6\\x6e\\x76\\xf1\\x1e\\x81\\xd7\\xbe\\xeb\\xc9\\x25\\xe2\\xbb\\xb6\\x58\\x5f\\xf3\\x40\\xbd\\xc9\\xf2\\xf8\\xdf\\x68\\x16\\x24\\x35\\x2f\\xb8\\x18\\xe5\\x19\\x5e\\x73\\x0f\\xf3\\xa5\\x16\\x8b\\xf4\\x4e\\x65\\x17\\xbc\\xf7\\x2c\\x9d\\x6e\\xbf\\x5c\\xa8\\xa2\\x2f\\x5e\\xc1\\x9e\\xda\\x23\\xa4\\xb2\\x38\\x9e\\xcb\\x5f\\x25\\xaa\\x49\\x73\\x83\\xd1\\x64\\x26\\x97\\x28\\x6a\\x05\\x80\\x32\\x6b\\xc5\\xd5\\x0b\\xaa\\x2c\\x72\\x8e\\x83\\x46\\xc7\\x68\\xb3\\xfc\\xed\\x3b\\x47\\x6f\\xee\\x5e\\x72\\x51\\xa0\\x9e\\xcc\\xed\\x3d\\xfd\\xe3\\x63\\x2d\\x22\\xba\\x2c\\x67\\xd7\\xb0\\xa3\\xf9\\x20\\xdd\\x55\\x5d\\xf4\\x16\\xba\\x63\\xa4\\x4e\\xf6\\x87\\x35\\x1e\\xda\\x3d\\x8e\\x5d\\x80\\x69\\xb0\\x7c\\x04\\x73\\x8d\\x74\\xe9\\x0e\\x6b\\xf2\\x44\\xeb\\x8b\\x6a\\xf2\\x78\\x9b\\x0d\\x6a\\x32\\x71\\x9b\\x5d\\x1d\\x6f\\xcf\\x5d\\x28\\xa4\\x29\\x59\\x52\\x26\\x6f\\x8e\\xfb\\x42\\xda\\x82\\x7f\\x94\\x89\\x40\\xb5\\x01\\x30\\x16\\x74\\x8f\\xad\\x85\\x95\\x02\\x72\\xce\\xda\\xba\\xd7\\x6d\\xb5\\xc9\\xe9\\x08\\xec\\xb2\\x9c\\x9a\\x60\\x0e\\x1a\\xfb\\x9a\\xb6\\x61\\xdd\\xbb\\x07\\x78\\x4f\\x69\\xdb\\x44\\x83\\xee\\xe7\\x6e\\xfa\\x67\\x7a\\xef\\xd6\\xf7\\xa5\\x46\\x48\\xd6\\x64\\xac\\xd4\\x4f\\xf4\\x49\\x44\\x6d\\x96\\x9b\\x9a\\x78\\x77\\x16\\x5b\\x58\\x37\\x81\\xb8\\x34\\xa9\\x73\\x26\\x05\\x10\\x79\\xc7\\x51\\x0e\\x8d\\x66\\xd3\\x28\\xac\\x5e\\x57\\x24\\x2c\\xa8\\x5c\\x57\\x4b\\xef\\xf7\\xae\\xe4\\x4c\\x13\\x17\\x31\\x7d\\xb4\\xb5\\x18\\x36\\xf6\\xd2\\x6e\\xdc\\x03\\xe4\\x96\\x85\\x0d\\x8e\\xb8\\xad\\xb6\\x09\\x3a\\xb7\\xb5\\x36\\x32\\x03\\x2f\\xd3\\xa6\\x74\\x6d\\xe3\\xff\\xd2\\x0b\\x07\\x5f\\xd4\\xef\\x62\\x36\\x88\\xd1\\x1b\\x67\\x75\\x58\\xe0\\xa2\\x6e\\xa6\\x76\\xf6\\x0f\\x7f\\x9c\\xa8\\x3b\\x88\\x6c\\xa6\\xe9\\x77\\x9b\\x28\\x6e\\x55\\x41\\xe9\\xee\\xdc\\x0b\\x69\\xa7\\x15\\x7b\\xc0\\xf6\\x6f\\xe2\\x1a\\x29\\x2a\\x83\\x81\\xc6\\x68\\x25\\x31\\xb8\\xe5\\xe3\\xa2\\xfe\\x75\\x53\\xbe\\xeb\\x4b\\x2d\\x14\\x0b\\xa4\\x4e\\x2f\\x87\\x2b\\x65\\xc1\\x1f\\x37\\xa4\\x27\\xad\\x02\\x39\\x0e\\xaa\\x21\\xf7\\x72\\x8e\\x5a\\xd6\\x57\\x88\\x0d\\xe7\\x26\\x71\\xe1\\xf6\\x6c\\xc9\\xae\\xb8\\x2e\\x9a\\xa9\\xb6\\x13\\x4a\\x97\\x65\\xba\\xd0\\x34\\x02\\xa3\\x9b\\x5a\\xbd\\xa1\\x22\\xbf\\xc2\\x4e\\x05\\xc6\\x1a\\x70\\x56\\x99\\x34\\x4b\\xe6\\xea\\xda\\x43\\xde\\x85\\xc7\\x20\\xa6\\xc5\\x4d\\x6b\\xa3\\x0f\\x1a\\x10\\xf7\\x12\\xfa\\x23\\x93\\xe6\\xd9\\xbc\\x8b\\xa7\\xd8\\xd3\\x54\\x32\\x08\\x05\\xbc\\xe8\\x90\\x9a\\xbf\\xa2\\x68\\x1f\\x81\\x5c\\xef\\x57\\x47\\xe3\\x6e\\x34\\x52\\x6b\\x31\\x4b\\xbd\\xea\\x2d\\x53\\xc1\\x59\\x37\\xdb\\x25\\xf0\\xa4\\x96\\x83\\x74\\xe7\\xf6\\x9d\\x6d\\x7e\\x7f\\x80\\x90\\xbd\\x70\\x8a\\x9d\\xd0\\x1c\\x2f\\x6a\\xc9\\x06\\x42\\xd2\\xaf\\x40\\x33\\x34\\x34\\x9a\\x7d\\xab\\x72\\x2a\\x2b\\x02\\xa4\\x9c\\x81\\xb8\\xc0\\x1f\\xba\\xb9\\x2a\\x13\\x58\\x8c\\x45\\x3f\\xad\\x62\\xc1\\xb4\\x89\\x4a\\x4e\\x86\\xad\\x51\\x12\\x48\\x21\\x47\\xe5\\xcc\\x4a\\x55\\xed\\xb8\\xb6\\x66\\x76\\x07\\x4a\\xa1\\x56\\xcc\\x66\\x96\\x87\\x92\\xa3\\xaf\\xf3\\xeb\\x74\\x45\\x47\\x93\\xfb\\x88\\xbf\\x62\\xcb\\x43\\x32\\xc8\\x1b\\x86\\x77\\x8c\\xae\\x86\\x52\\x36\\xee\\x59\\x00\\xc6\\x77\\x81\\x5f\\x72\\x7f\\xcf\\x0e\\x13\\x3b\\x45\\xe3\\x3c\\xe6\\xf0\\x2b\\xaa\\x21\\xfb\\x63\\x68\\x40\\x7f\\x51\\x49\\x3c\\xf2\\x4a\\xd9\\x34\\xb4\\xb6\\xfe\\xcc\\xb2\\x46\\x96\\x81\\x3f\\xe5\\x5d\\x8c\\xf6\\x62\\x99\\xb8\\xb8\\xe4\\x05\\x97\\x9f\\x78\\x57\\x53\\x6f\\x73\\x54\\x1a\\x3b\\xe6\\x86\\x40\\x76\\xf1\\x16\\x77\\xa8\\x66\\x1f\\x95\\x74\\x30\\x1e\\x2f\\xdc\\x0a\\x8b\\x9f\\xb2\\xb8\\xb0\\xe7\\x8c\\x55\\x2b\\x27\\xe1\\x94\\x60\\x74\\xda\\x64\\xc9\\x33\\xaa\\x60\\x5c\\x18\\xd7\\x8f\\x55\\x67\\x7f\\x5a\\x67\\x95\\x02\\x60\\x1a\\x36\\x29\\x0c\\xd6\\xe5\\xf0\\xa0\\xc3\\x4a\\x95\\x9e\\x73\\xd9\\x00\\x61\\xbb\\xe4\\x12\\x57\\x42\\xd1\\x62\\x06\\x5b\\x02\\xec\\x16\\x68\\xf7\\xe9\\x52\\xef\\xd6\\x00\\x6a\\xa6\\xab\\x5d\\x21\\xed\\xc1\\x1d\\x13\\x7d\\x70\\x7b\\x78\\xb7\\xc0\\x60\\x0c\\x3d\\xaa\\xdf\\xde\\x04\\xc0\\x03\\x19\\x71\\x00\\xe9\\x40\\x23\\x6b\\xbd\\xee\\x85\\x8c\\xba\\x97\\x71\\x31\\xd5\\xcd\\xe3\\x6b\\xe1\\x40\\x30\\x98\\xc7\\x61\\x24\\xa0\\x4f\\xc8\\x7e\\x98\\x86\\xff\\xea\\x41\\xf7\\x47\\xb9\\x99\\x00\\x2a\\xea\\x2c\\x1d\\x38\\x9a\\xc1\\x8b\\x46\\x2c\\xa8\\x08\\x76\\x80\\x70\\x6b\\x54\\xe9\\x0f\\xc5\\x92\\xd5\\x94\\xf5\\x3a\\x79\\xb4\\x26\\x3d\\x2a\\x18\\x2f\\xaf\\x32\\xbf\\x8f\\xe5\\x28\\xb1\\x07\\x42\\xc4\\x40\\xff\\x84\\x69\\xf7\\x96\\xec\\xf9\\xac\\x5c\\xd7\\x9a\\xdd\\x09\\xda\\xed\\xc6\\xaa\\xed\\xe6\\xca\\x6a\\xcb\\x76\\xbd\\x6c\\x5a\\xe3\\xc2\\x45\\xa4\\x97\\x5f\\xb9\\xc7\\x11\\xdf\\xfb\\xc4\\xe0\\xfc\\x34\\x1c\\xc5\\x65\\x6b\\x5d\\xa8\\xed\\x0a\\x9c\\x06\\xe6\\x58\\x8f\\x75\\xa5\\xca\\x3b\\x8c\\xa6\\xff\\x99\\x4c\\xcf\\x2f\\x61\\x6c\\x70\\xf4\\xb5\\x01\\x23\\xce\\xb7\\x7c\\xb4\\x49\\x11\\xbb\\xcc\\x1c\\xe3\\xa6\\x62\\xc4\\xcb\\xf4\\x6e\\x56\\xd5\\x02\\x02\\xf6\\x47\\xe0\\xc4\\x6e\\xa8\\x91\\x85\\x78\\xbc\\xa0\\x56\\x69\\xb3\\x06\\x00\\xc1\\x9b\\x2e\\x0d\\x23\\xa0\\x33\\x95\\xe3\\xbc\\x4a\\xe0\\xdd\\xdb\\x41\\x2f\\xe9\\x02\\xea\\xba\\x0d\\xdf\\x9d\\x20\\xe3\\xae\\xac\\x82\\x39\\x0c\\x5a\\x8f\\x19\\xbc\\x5e\\x8e\\xad\\x71\\x5f\\x15\\xfc\\x57\\x88\\x23\\x60\\x5a\\xae\\x73\\x6a\\x9d\\xdc\\x1f\\x80\\x30\\x48\\xc7\\x20\\x19\\x65\\xa8\\xaf\\xdf\\x23\\x87\\x24\\x86\\x6d\\x1e\\x16\\x9c\\xdc\\x6a\\x98\\x4a\\xa1\\x71\\xf3\\x70\\xa9\\xb3\\x9c\\x5a\\x51\\x0e\\xfe\\xd5\\xb6\\x20\\xc9\\xf0\\x94\\x6b\\xea\\x4c\\x53\\x21\\x0c\\x85\\xd4\\xf9\\x88\\xa6\\x8f\\x27\\xdf\\x6a\\x35\\xed\\xa6\\xe2\\x42\\x49\\xdd\\xb8\\xdd\\xff\\x59\\x19\\x2d\\x44\\xf4\\x0d\\x99\\xf5\\x9b\\x55\\x30\\x84\\xd3\\xf2\\xaa\\xa5\\x2b\\x86\\xb0\\x9b\\x2b\\xab\\x80\\x79\\xb7\\x11\\x05\\xfb\\xbc\\xb8\\x16\\xa2\\xfb\\xe6\\x42\\x5d\\x9b\\x5d\\x5f\\x84\\xd6\\x66\\xd6\\x97\\xa4\\xff\\x05\\x45\\x12\\x93\\xd3\\x3f\\xc9\\x5c\\xfe\\xec\\xd8\\xaa\\x03\\x1c\\xd4\\xcb\\xec\\x6e\\x3b\\x01\\xe8\\x47\\x40\\xb8\\x1d\\x58\\x90\\x3d\\x58\\xb2\\xc1\\x00\\xf4\\x22\\x3c\\x5a\\xd7\\x5a\\x35\\x18\\xaf\\xbe\\x60\\x3b\\xbd\\x89\\x47\\x20\\x7f\\x6b\\x95\\x92\\x07\\x70\\xa1\\x1f\\x01\\x09\\x77\\x64\\x09\\x3f\\x06\\xf7\\xf9\\xa1\\x16\\xf3\\xca\\xae\\x73\\x7b\\xb0\\xfd\\x11\\x08\\xe0\\x5a\\xc5\\xe4\\xfd\\x74\\xf3\\xe7\\x48\\x8f\\x80\\x66\\x3b\\xb2\\x68\\x3b\\xb9\\xb1\\xa9\\xf3\\xa3\\x87\\x5a\\xa5\\x80\\xec\\x66\\x83\\x5b\\x3a\\xf5\\xb8\\xa7\\xe9\\x6f\\x2f\\x28\\xcc\\xbd\\xbd\\x2a\\x41\\xb3\\x6a\\xc0\\x0c\\x73\\xad\\xb1\\xe5\\x78\\x25\\x7d\\x25\\x4c\\x8a\\x5a\\x52\\xcc\\x2f\\xb3\\xc9\\xf4\\x32\\x3b\\x4d\\xa3\\xb9\\x73\\x19\\x01\\x73\\xb0\\x75\\x05\\x6a\\x32\\x51\\x11\\x26\\xfa\\x63\\x97\\xc4\\xd6\\x69\\x85\\xec\\xd8\\xc7\\xd1\\xa2\\x69\\xaf\\xcb\\x0e\\x2d\\x3c\\x7d\\x2a\\x77\\x6e\\x80\\xf8\\x2b\\x46\\x07\\xff\\x60\\x3c\\xf4\\xe3\\x9f\\xc3\\x60\\x19\\x9e\\x2e\\xb3\\xa3\\xef\\xe6\\x46\\x57\\x6e\\xdd\\x4e\\xfd\\xbc\\xb9\\x2d\\xc8\\x81\\xcd\\x1b\\xa3\\x9b\\xdd\\xd0\\xca\\x45\\x2d\\xce\\xf5\\x61\\x80\\xa1\\xa6\\xf3\\x9c\\xb6\\xf7\\x79\\x6a\\x08\\x5f\\xf5\\xa6\\x68\\xbe\\x1e\\x2b\\xc8\\xd8\\x81\\xfb\\xa8\\x0f\\xd3\\xf2\\xd7\\x69\\x64\\x8c\\x05\\x4b\\xb0\\x71\\x6e\\x6b\\xa5\\x9c\\xa0\\x2a\\xc9\\xf8\\xf6\\x25\\x5e\\x87\\x68\\x4a\\x15\\x75\\x8b\\x30\\x52\\x63\\x7b\\x1a\\x1b\\xef\\x28\\x14\\x43\\x6c\\x17\\x4c\\xb7\\x3a\\xf7\\x46\\x49\\x3c\\xfa\\xb0\\x87\\x2f\\xee\\x51\\x67\\xd4\\x72\\x48\\xff\\x90\\xcc\\x64\\xfe\\x86\\x0a\\x34\\xd7\\x96\\x11\\x3e\\x7a\\x49\\x8d\\x6c\\x9b\\x2a\\x09\\xf1\\x85\\x14\\xcc\\x35\\xd6\\x5d\\xf1\\xa5\\x87\\xbd\\x88\\x05\\x8f\\x2c\\xd8\\x57\\xc7\\xd6\\x44\\xf1\\xd7\\x91\\xf4\\xad\\xe5\\x2b\\xb4\\x98\\xf0\\xeb\\x0c\\x84\\x95\\x35\\xf3\\xf8\\xfa\\x5a\\xd5\\x2e\\x94\\x5d\\x01\\x73\\x07\\x86\\x52\\x76\\xc9\\x18\\xf8\\xe9\\x8a\\xd6\\x30\\xa8\\xb4\\x32\\xe6\\xc4\\xe4\\x86\\x86\\xc6\\x0b\\xb4\\x73\\xde\\x59\\xde\\x6e\\x83\\xfe\\x9f\\xe9\\xbd\\x9d\\xb5\\x84\\xb7\\xcf\\xe0\\xf1\\x37\\xb3\\xab\\xab\\x44\\x61\\xb6\\xbc\\x4d\\xfe\\xb9\\x89\\xf3\\xc8\\x6b\\x8e\\x45\\x06\\x14\\x4f\\x12\\xd6\\x7b\\x92\\x23\\x00\\x32\\x1a\\x5f\\x28\\x97\\x2b\\x1a\\x72\\x01\\x8c\\x6f\\x5a\\x67\\x23\\x34\\xd8\\xd8\\xb6\\x8d\\xc8\\xfc\\x2a\\x1c\\x18\\xe9\\x95\\x2b\\x04\\x05\\xde\\xe0\\xda\\x59\\x7a\\x10\\x92\\xa0\\x6a\\x7e\\x7a\\xdf\\xc5\\xeb\\x21\\xd9\\xa7\\x98\\xfe\\xce\\x8b\\xcc\\x27\\xc9\\xd6\\x87\\x63\\x63\\x4b\\x75\\xbf\\x0e\\x26\\x12\\x21\\x34\\x15\\x0b\\x57\\x3f\\xca\\xc4\\x93\\x36\\x9c\\x8b\\xea\\x0d\\xf5\\x2a\\x5a\\x97\\xac\\x49\\x09\\xfa\\xbd\\xab\\x64\\x96\\xef\\xc9\\xc4\\x19\\x57\\x35\\x63\\x84\\xfc\\xd1\\xe1\\xad\\x41\\x3b\\xa1\\xbe\\x89\\xb1\\x66\\x5d\\xea\\x6b\\x0a\\xad\\x3e\\x64\\x0a\\xbc\\x85\\x7f\\xc1\\xb7\\xf0\\xe9\\xb5\\x66\\xfb\\x69\\xad\\x5b\\x03\\x02\\xbd\\xbe\\x7d\\x60\\x7d\\x48\\xee\\x8c\\x6d\\x83\\x04\\x34\\xc0\\xbe\\xf0\\x2d\\x99\\x17\\xcb\\x90\\xb4\\x53\\x14\\x47\\x30\\xf2\\xb5\\x6a\\x14\\x46\\x1f\\x2e\\x7e\\x71\\x69\\x79\\xd4\\xf3\\x6c\\x5f\\x22\\x05\\xf0\\x6d\\xc9\\xe4\\x62\\x88\\xee\\x8a\\x54\\x0a\\x11\\xb7\\x28\\x97\\xbc\\x89\\xce\\x17\\x4b\\x7c\\x6f\\x79\\xa9\\xe4\\x59\\x1e\\x8e\\x57\\x2e\\x12\\x5b\\x93\\xd0\\x87\\x46\\x7a\\x23\\x02\\x4a\\x24\\xdc\\x9e\\x7c\\x46\\x57\\x49\\x5f\\x11\\xd5\\xaf\\x2e\\x2d\\xa5\\x76\\xae\\xed\\x6b\\x4f\\x03\\xfc\\xb6\\xa4\\x73\\x51\\x64\\x77\\x45\\x40\\x0d\\x21\\xd7\\x2f\\xa3\\x58\\x20\\xe4\\x1a\\x6f\\x61\\x73\\xa3\\xa2\\x2c\\x97\\x81\\xd7\\xef\\xa1\\x2f\\x30\\xd3\\x1a\\x63\\x31\\x9d\\x0b\\x71\\x9c\\x81\\x63\\xd5\\x63\\x15\\xd2\\x7b\\x4b\\x2f\\x41\\x99\\x65\\xfb\\xeb\\x8f\\xc1\\xde\\xd6\\xe2\\x5b\\x08\\xcd\\x5d\\x59\\x79\\x4c\\xc2\\x8d\\x6e\\x0d\\x3d\\xa8\\x1a\\xa7\\x0f\\x26\\x3e\\x71\\xba\\x5d\\x01\\xea\\x8f\\xea\\x4e\\x89\\x10\\x90\\xd1\\x51\\x6a\\xba\\xca\\xc5\\x1a\\xf5\\x5a\\x0f\\xd2\\x66\\xb3\\xf2\\xc1\\xc4\\x08\\xe6\\xde\\xae\\x1c\\x2d\\x80\\xec\\x4e\\x09\\x12\\x12\\x72\\x0b\\x92\\x54\\xde\\x65\\x7a\\x4c\\x7b\\x72\\x57\\x2b\\x40\\xcd\\x35\\xb0\\x04\\x9b\\x88\\x2b\\x80\\xd1\\x9b\\x19\\x1e\\x90\\x4e\\x33\\xac\\x94\\x92\\x07\\x0a\\xff\\x9f\\xe3\\x63\\x89\\x0a\\x75\\xf5\\xd1\\x39\\xe7\\x72\\x32\\xf9\\x59\\xda\\x42\\xba\\xee\\xb9\\x9c\\x09\\x5a\\x38\\x72\\x3e\\x2b\\x17\\x1b\\xb9\\x0e\\x7a\\xe5\\x4e\\x48\\x76\\xab\\x4c\\xf4\\xea\\x2c\\xed\\xcd\\x89\\xa1\\x03\\xd1\\xda\\x96\\x86\\x6e\\xcf\\x5d\\x59\\x1a\\x2b\\x72\\x30\\x6b\\xa2\\xc2\\x5c\\x06\\x2e\\x4c\\xe9\\xae\\xd9\\x3a\\x69\\xbe\\x24\\x05\\x3b\\x4d\\xc4\\x0f\\xea\\x3e\\xca\\xee\\xd2\\x1e\\x46\\xa2\\xbc\\xb9\\xb4\\x99\\x68\\x66\\xda\\xbe\\x8a\\xd6\\xa0\\x77\\x6a\\x91\\xbf\\xab\\x75\\x2a\\xe9\\x05\\xb1\\xdd\\x15\\x1d\\xad\\x29\\xb9\\xa0\\xc5\\x38\\x97\\xb6\\xf3\\x64\\x14\\x2b\\x61\\xf7\\xf1\\x64\\xf4\\xab\\xab\\x48\\xa9\\xcc\\xf5\\x20\\x62\\xca\\xc0\\x6f\\x57\\x4e\\x17\\xc2\\x77\\x87\\x04\\x95\\x69\\xb9\\x6d\\x49\\x9d\\x4d\\xfb\\x89\\xe9\\x6c\\xba\\x8a\\x8c\\xe2\\x2c\\x0f\\x22\\xa0\\x00\\xf6\\x76\\xa5\\xb3\\x3f\\xa6\\x3b\\x24\\x9a\\x40\\xc5\\x4d\\xcb\\x65\\x37\\x61\\x93\\x2c\\x8c\\xea\\x74\\xed\\x36\\x75\\xe6\\x59\\x39\\xf3\\xf0\\xc6\\x39\\xb7\\xe6\\x24\\x2d\\x84\\xe0\\xc3\\x49\\xce\\x62\\xc4\\xdb\\x5e\\x08\\x9f\\x2c\\xd6\\x9e\\x86\\xa1\\x79\\x77\\x69\\x85\\xe6\\xcc\\xb6\\x5d\\x91\\xb4\\xa0\\x77\\xca\\xe5\\x6b\\x7c\\x6d\\x8d\\xc2\\xb9\\x38\\xbe\\x3b\\x20\\xa1\\x96\\x96\\x8b\\xfa\\xef\\x3d\\xc8\\x3b\\x5f\\x58\\xc9\\xab\\xea\\x2b\\xad\\xf4\\xf2\\x32\\xe2\\x7a\\x45\\x95\\xf5\\xeb\\x9e\\xa4\\x89\\x01\\xcc\\xe9\\xd1\\xbc\\x4e\\x5a\\x33\\x12\\xdb\\x12\\xdc\\x55\\x31\\xdf\\x15\\x09\\x66\\xaa\\x3e\\x88\\x08\\x53\\x38\\xa0\\xaf\\x08\\xd3\\xcb\\xeb\\x14\\x61\\x09\\x46\\x6c\\x55\\x84\\x19\\x89\\x87\\x16\\xe1\\xbe\\x98\\xef\\x8a\\x08\\x33\\x55\\x1f\\x44\\x84\\xf1\\xd2\\x54\\x5f\\x09\\xc6\\x77\\x57\\x33\\x19\\x78\\xb6\\x07\\x30\\x19\\x08\\xf4\\xed\\x9b\\x0c\\x0b\\xe1\\xbb\\x2b\\xd2\\x4a\\xb4\\x7c\\x10\\x61\\xa5\\x33\\x94\\x7e\\xb2\\x8a\\xc7\\x12\\x2b\\xb1\\xae\\xf1\\xbc\\x66\\x0b\\x92\\x3a\\xf7\\x60\\x6a\\x23\\x82\\xba\\x08\\xb6\\xbb\\x22\\xa7\\xcb\\x9c\\x4c\\xad\\x47\\x4c\\x6f\\xfb\\x1b\\xb6\\x74\\x60\\xb0\\x1a\\xeb\\x68\\xb6\\x87\\x90\\xd4\\xdb\\x2d\\x5a\\xb3\\x4b\\xe2\\xbb\\x33\\xb2\\x7a\\xfb\\x50\\x36\\x6c\\xaf\\xf0\\xa7\\xbc\\xb9\\x9a\\xa0\\x36\\x05\\x06\\xb7\\x20\\xa6\\xf3\\x02\\xa0\\x1b\\x11\\xd2\\x05\\x70\\xdd\\x15\\x11\\x75\\x43\\xa0\\x9b\\x13\\x50\\xdd\\x94\\x2c\\x6d\\x46\\x4c\\x5a\\x5e\\x8f\\xc7\\x1d\\xa2\\x38\\x67\\x88\\x26\\xf2\\x17\\xc1\\xb9\\x73\\x91\\xa6\\xda\\x91\\x8d\\x87\\xb1\\x97\\x6a\\x4c\\xa3\\x56\\xba\\xf8\\x84\\x2f\\x73\\x67\\x57\\x2a\\xb8\\xed\\xfe\\x56\\xb9\\x45\\x35\\x34\\xa7\\x8c\\x87\\x93\\xfb\\xb7\\xc9\\xec\\x3a\\x4e\\xf7\\xe8\\xc3\\x3d\\xfb\\xef\\x2a\\x07\\x75\\x6e\\x22\\x5e\\xe1\\xd2\\x7f\\xf2\\x2d\\xf0\\xe2\\x26\\x9b\\x25\\x11\\x1f\\xa1\\x13\\x17\\xf9\\x2e\\x50\\x0c\\xa3\\x84\\x49\\x72\\xef\\x88\\xc9\\x21\\xb6\\xd9\\x96\\x76\\x68\\x74\\x21\\x09\\xe5\\xca\\xa3\\x4d\\xc7\\x05\\x4b\\xfd\\x97\\x11\\x20\\xdb\\x2d\\xce\\x34\\x1b\\xb3\\x57\\x99\\x70\\xd0\\x41\\xb1\\x4f\\x58\\xe1\\x0f\\xc5\\x54\\x8d\\x62\\xa0\\x14\\xf7\\x40\\x6c\\xa8\\x7f\\x80\\xac\\x64\\x16\\xd8\\x6c\\x4b\\x8d\\xe8\\x8b\\x5a\\xaa\\xe7\\x52\\x71\\xd3\\x4f\\x59\\x3c\\x1e\\x94\\x4f\\xeb\\x3b\\x1a\\x58\\x8a\\x27\\x56\\x5d\\x82\\x68\\xe7\\x7c\\x94\\x23\\xd7\\x1c\\x81\\x8e\\x85\\x6d\\xc7\\xec\\xdd\\x92\\x5b\\x8a\\x7b\\xa1\\x34\\x1c\\x96\\x16\\x55\\x76\\xe4\\x2a\\xd5\\x8b\\x5e\\x64\\x7f\\xe0\\x45\\x5e\\xe7\\x68\\x4b\\x67\\xd7\\x86\\xa5\\xd8\\xa3\\x64\\x40\\x75\\x63\\x34\\x12\\x89\\x64\\x70\\x59\\x21\\x7c\\x94\\x8d\\x8c\\xa7\\x9a\\x5f\\x20\\x61\\x5d\\x2b\\xb2\\xe9\\x8a\\x6b\\x6d\\xfd\\xad\\x6f\\x43\\xa5\\x4b\\xa7\\xce\\xf2\\xc2\\xa7\\xf0\\xdf\\x0c\\xcb\\x70\\x67\\x77\\x58\\xb2\\x86\\x7a\\x7b\\xdf\\x64\\x79\\x89\\x93\\x10\\xb1\\xaa\\xb7\\x60\\x8b\\x78\\x32\\x05\\xa6\\x47\\x19\\xc9\\x20\\x35\\xc0\\xe4\\xa5\\x0a\\x0b\\x08\\x74\\x0b\\x81\\x88\\x75\\x47\\xf0\\x72\\x6d\\x81\\x13\\x10\\xc5\\x35\\xf2\\xe6\\x71\\xe1\\x88\\xcd\\x2f\\xc4\\xcc\\x43\\x81\\x73\\xb0\\x7f\\x18\\xbc\\xc9\\x4a\\xe9\\x5a\\x89\\x98\\x84\\xa3\\x72\\xe6\\x7f\\x9b\\xa5\\x75\\xbb\\xc3\\xc2\\x39\\x41\\x25\\x77\\x85\\x99\\x5d\\xf9\\x07\\x46\\xca\\xcc\\x3f\\x78\\x11\\x14\\xf7\\x60\\xd7\\x7c\\xac\\xb4\\x2e\\xcf\\xd2\\xa5\\x35\\xcb\\x30\\x38\\x3c\\x3c\\x44\\x64\\x49\\x62\\x7f\\xfa\\xb9\\xff\\x5d\\xfc\\x4f\\x59\\x48\\xc9\\x64\\x7c\\x29\\x0d\\x57\\x6b\\x06\\xa3\\xc6\\x38\\x16\\x12\\x1c\\xd2\\xeb\\xac\\x38\\xd2\\x0e\\x53\\xf0\\x91\\x2f\\x81\\x27\\xdd\\x12\\x45\\x48\\x2e\\x78\\x7b\\xe3\\xb3\\x74\\xf5\\xb5\\x48\\x65\\xdb\\xc5\\xab\\xfc\\x71\\x52\\x8a\\x7f\\x19\\xa9\\x62\\xa4\\xd2\\x28\\x44\\x50\\xa5\\x00\\x58\\x0d\\x41\\x51\\x34\\x8e\\x57\\xca\\x32\\x19\\x9c\\xb9\\x1f\\xc0\\x0c\\x20\\x2a\\xe9\\x0c\\xcb\\x14\\x01\\xfd\\x26\\x71\\x09\\x63\\x0c\\x7d\\x31\\x0b\\x93\\xbb\\xf0\\xde\\x91\\x36\\x96\\xc4\\xb8\\x04\\x29\\xc1\\x4d\\xb8\\x68\\x9c\\x7f\\x97\\x64\\xbb\\x43\\xb8\\xed\\x05\\xa6\\xa5\\x14\\xa8\\xe3\\xd6\\x7d\\x96\\xf3\\x3f\\x84\\x9c\\xff\\x71\\x77\\x88\\x85\\x56\\x51\\xb4\\xf8\\x8d\\xbf\\x9d\\x58\\x50\\xd6\\x73\\xb2\\xb5\\x18\\x1f\\xc0\\x79\\x0a\\xeb\\x68\\xb2\\x38\\x62\\x41\\xba\\x25\\xdd\\xa6\\x15\\x57\\x28\\xc5\\xd8\\xa8\\x1e\\x9e\\xb3\\x10\\xfa\\xaf\\x52\\xb3\\x72\\xcc\\x3a\\x15\\x54\\x1e\\x66\\x91\\x52\\x51\\x9c\\xaa\\xdb\\x97\\x2e\\xe1\\xf5\\xf1\\x52\\x78\\x51\\xad\\x0b\\xf3\\x59\\x88\\x57\\x17\\xe2\\x87\\xe3\\x72\\x23\\x4b\\xdb\\x78\\xea\\x86\\xb9\\xdb\\x2b\\x18\\x91\\xfe\\x76\\x16\\x81\\xb9\\xc7\\x03\\x4b\\x6b\\x92\\x15\\x25\\x57\\x99\\x9c\\xe2\\x9d\\x1a\\xfe\\x84\\xff\\x36\\x0c\\x98\\xc3\\xf1\\x39\\x55\\xac\\xaa\\x01\\xf7\\x6d\\xd5\\x9b\\x13\\x57\\xb9\\x77\\x3e\\x31\\xc0\\xbc\\xc1\\x58\\xda\\x67\\x8e\\x99\\x65\\xb5\\xed\\x03\\x95\\x75\\x08\\x42\\xb4\\xa9\\x6b\\x94\\x8f\\x49\\x2e\\x3e\\x5b\\xf4\\x7f\\x4c\\xcf\\xb5\\x2e\\xee\\xcb\\xbb\\xae\\xbb\\xa5\\x09\\x3f\\x4b\\xfc\\x67\\x1f\\xf6\\x61\\xd6\\xd3\\x12\\x4e\\xec\\x8e\\xed\\x26\\x9f\\x88\\x27\\xf0\\xd9\\x9d\\x5d\\xca\\xd1\\x51\\xeb\\xf3\\x67\\x3f\\x0b\\xf9\\xce\\xba\\xbb\\x3d\\xa4\\xa0\\x99\\xe5\\x55\\x9e\\x5f\\x60\\x26\\xc4\\xf8\\xde\\x53\\xc9\\x0d\\x8a\\x1f\\x8b\\xed\\xe2\\x01\\xeb\\x0c\\x4f\\xe1\\xf1\\xae\\x9f\\xdd\\x42\\x16\\x73\\x19\\xc6\\x7a\\x55\\xcb\\x88\\xb0\\xa4\\xa2\\x7b\\x1f\\x3b\\xfa\\xc9\\x49\\x62\\xe3\\x33\\xdb\\xe3\\x24\\x0e\\x8b\\x17\\x1a\\x93\\x8b\\x32\\x2c\\xe3\\xd1\\xa2\\x19\\x80\\xc0\\xd4\\xf8\\xdf\\x7d\\xf2\\xff\\xf9\\xc5\\xa5\\xf3\\xff\\xf4\\x3c\\x6b\\x49\\xff\\x5b\\xec\\xf2\\xae\\x40\\xbe\\xad\\x6b\\xac\\x0b\\x62\\x6a\\x22\\xc5\\x8f\\xfc\\x0a\\xb4\\x50\\xd1\\x09\\x6c\\x6f\\xc0\\x43\\xf5\\x44\\xb3\\x18\\xe5\\x59\\x92\\xf4\\x10\\x4d\\x7e\\x71\\x69\\xd1\\xd4\\xf3\\x3c\\x80\\x68\\x0a\\xe4\\xdb\\x12\\xcd\\x05\\x31\\xdd\\x15\\xd1\\x14\\x2a\\x6e\\x53\\x34\\xc9\\x9c\\xe8\\x23\\x9a\\xf4\\xe2\\xf2\\xa2\\x29\\xf3\\x3c\\x84\\x68\\x32\\xe4\\x5b\\x13\\xcd\\xc5\\x30\\xdd\\x19\\xd1\\x64\\x2a\\x6e\\x53\\x34\\x29\\x48\\xda\\x47\\x34\\xe9\\xc5\\xe5\\x45\\x53\\xe6\\xd9\\x7e\\x49\\x13\\x01\\x7c\\x6b\\x92\\xb9\\x10\\xa2\\x3b\\x23\\x98\\x4c\\x44\\x03\\xee\\x26\\xca\\x53\\x9c\\x6a\\x0b\\x17\\x30\\xd5\\x19\\xa8\\xe4\\x57\\x5c\\xa9\\x9b\\xf0\\x36\\xce\\xf0\\x5f\\x3a\\x41\\xb6\\xa5\\x1c\\x9c\\xf1\\x26\\xae\\x63\\x98\\xba\\xc1\\x55\\x5a\\xac\\xe3\\x49\\xd8\\x7c\\xde\\x60\\x63\\x6b\\x14\\x5a\\x43\\xc7\\x89\\xe9\\x53\\xe5\\x80\\xfa\\x58\\xe6\\xe1\\x5b\\x9b\\x09\\x79\\x6c\\x7b\\x8b\\x39\\xf9\\x91\\xa5\\xb4\\x17\\x0b\\xb9\\xe5\\xdb\\xdc\\x7a\\xe9\\x3a\\xf5\\xd2\\xc0\\xee\\x94\\x1d\\xf6\\x27\\x7c\\x21\\xe9\\x04\\xbf\\x09\\x0f\\x5a\\x45\\xfa\\xc1\\x48\\x0f\\x64\\x97\\x84\\xd2\\x53\\x56\\x40\\x04\\xe8\\x03\\xd0\\xb1\\x31\\x33\\xa3\\x37\\x39\\xfb\\xd1\\xd3\\xa1\\xa0\\xd5\\xb2\\x1c\\xce\\x4b\\xfd\\xed\\xeb\\x81\\xc5\\x14\\x76\\x81\\x3c\\xc7\\x6e\\x74\\x5e\\x3b\\xbc\\xd5\\x49\\xfd\\x3d\\x3f\\x6b\\x92\\x5c\\x4c\\x82\\xf1\\xc1\\xd0\\xa9\\x30\\x7a\\x0f\\x6c\\xbf\\xfa\\xe3\\xa4\\xd0\\x1f\\x18\\x22\\xfb\\xda\\x99\\xfa\\xf9\\x78\\xc1\\x97\\x07\\xa1\\xb4\\x06\\x07\\x03\\x3f\\x7e\\x00\\x37\\x2e\\x24\\xbe\\x91\\x66\\xd4\\xfa\\x11\\x03\\x3d\\x12\\x0e\\xf2\\x49\\x39\\x4b\\xfd\\x5e\\x43\\x9b\\xbd\\xf3\\xb2\\x3b\\xa4\\x1d\\x27\\x45\\xf0\\x9e\\x68\\xc3\\xd1\\xc5\\x51\\x96\\x83\\x0f\\x3a\\xcd\\x52\\x6a\\x6a\\xfc\\xd4\\x0d\\x8a\\x3f\\xad\\xd0\\xfe\\x0e\\x46\\xbf\\xca\\x66\\xa0\\xee\\x66\\xd4\\x27\\xf3\\x90\\x28\\x6c\\xe1\\x1d\\x4a\\x5c\\x7e\\xbf\\x9b\\x13\\x96\\x11\\x00\\x4b\\x8f\\x5e\\x4f\\x9b\\xa1\\x31\\xaa\\xd4\\x1a\\x25\\xc5\\xb2\\x08\\xdd\\x44\\xfe\\xee\\x1b\\x73\\x06\\xb9\\x72\\x5e\\xcc\\xd3\\xa0\\x51\\x07\\xd6\\x84\\x3d\\x51\\x0f\\x9a\\x8d\\x82\\x63\\x91\\xf6\\x86\\x8a\\xee\\x87\\xab\\x83\\xae\\xc3\\xe0\\x2a\\x44\\x18\\x67\\x53\\x34\\x47\\xf9\\xa6\\xd1\\x38\\x1e\\xc1\\xf3\\x12\\x35\\x52\\x9e\\x65\\x65\\x4b\\xe3\\x4a\\x60\\xa1\\x2e\\xd1\\xdf\\x83\\xec\\x0f\\x09\\x6f\\x95\\x6f\\xed\\x17\\x7a\\xb4\\xe1\\x37\\x13\\xb6\\x39\\x61\\x7d\\x86\\x17\\xa4\\x1c\\xdb\\x05\\xd7\\x94\\xfa\\x6a\\xab\\xad\\xe1\\xd4\\x70\\x6f\\xb1\\x38\\xe5\\x82\\xa9\\x0d\\x0e\\xef\\xea\\x47\\x52\\x0d\\x6b\\x6c\\x13\\xca\\xee\\x0f\\x20\\x11\\xee\\xb9\\x00\\x80\\x52\\x4b\\xae\\x73\\xe2\\xfc\\xce\\xc5\\x34\\xd6\\x8e\\x5e\\x6f\\x38\\x56\\x10\\x86\\x54\\x93\\x45\\xb9\\x59\\xe8\\x7d\\x7d\\xc7\\xf8\\x62\\x0e\\x3d\\x5a\\xd6\\x95\\x7d\\x6e\\x89\\x44\\x40\\x32\\xf5\\x11\\x85\\x56\\x52\\x99\\x6f\\x7b\\x5c\\x9e\\xeb\\xf6\\x42\\x67\\x69\\x4b\\x79\\xc4\\x60\\xf0\\xf2\\xf4\\xed\\xbb\\xd3\\x93\\xe3\\xcb\\xd3\\x97\\x4c\\xcf\\xdb\\x2f\\x0f\\xff\\xb2\\xdf\\x82\\xec\\x9a\\xae\\x83\\x33\\x34\\x5b\\x73\\xc1\\xd7\\x84\\xbc\\xe3\\x9b\\x07\\xd3\\x04\\x18\\xec\\xac\\x9b\\xc7\\x70\\xc9\\x5e\\xa8\\xba\\x51\\x9f\\xfc\\x52\\xce\\x99\\xd2\\x2c\\x52\\x24\\xe7\\x60\\xa4\\x37\\x5f\\x27\\x65\\x37\\x6e\\xb0\\xff\\x3c\\x88\\xc7\\xf0\\x3a\\xe8\\x95\\x3b\\xc7\\xdc\\x40\\x9c\\xf4\\xe7\\x44\\xb1\\x24\\xfe\\xa0\\x50\\xb1\\xf0\\xe6\\x10\\x65\\x23\\xea\\xed\\xd9\\xcc\\xa1\\x2f\\xff\\xbc\\xef\\x21\\x2e\\x03\\x1d\\x05\\xa7\\xbc\\x56\\x05\\xec\\x5f\\xfe\\x85\\x10\\xe8\\xa5\\xb3\\xe8\\x8a\\x51\\x79\\x9e\\x35\\x95\\x09\\x79\\x90\\x05\\x43\\xc0\\x6c\\x6d\\xbd\\xac\\x07\\xf5\\xc7\\xbe\\x5c\\x98\\xa6\\x4e\\x68\\x75\\xed\\x19\\x2e\\x11\\xf6\\x2d\\x18\\x65\\x09\\x6e\\x36\\x08\\x25\\x20\\x4e\\x2d\\x56\\xf5\\xf6\\x04\\x62\\xcb\\xe8\\xf2\\x5a\\x01\\x41\\x0d\\x47\\x1f\\x5a\\x2d\\x79\\xfd\\x95\\xeb\\x8d\\xdb\\x64\\x0d\\x70\\xc0\\x67\\xc5\\x8d\\x1d\\x92\\xc6\\xa2\\x6d\\x7b\\x12\\x7e\\x50\\x41\\x8c\\xbf\\xc3\\x66\\xa4\\xee\\xf4\\x64\\x7e\\x64\\x85\\x49\\x82\\x43\\x5c\\xe0\\x87\\x03\\x3d\\xb0\\x75\\xba\\xdb\\x52\\xe4\\x76\\x08\\x49\\x77\\xcb\\x26\\x4d\\x46\\x7f\\x60\\x50\\x43\\xbf\\xcf\\xad\\xfc\\x59\\x32\\xaf\\x55\\xaa\\x38\\xe1\\x01\\xa7\\xaa\\x41\\x53\\x1d\\x54\\xb7\\x23\\x2e\\x68\\x64\\xfb\\x2f\\x96\\x72\\x2c\\x2f\\x20\\x22\\x1e\\xa7\\x81\\x4f\\x11\\x99\\x74\\x80\\xe6\\x4b\\xa1\\xf2\\x38\\x4c\\xe2\\x7f\\x87\\x48\\xcb\\xfd\\x9e\\xdc\\x19\\x12\\x22\\xd6\\x9e\\x32\\x93\\xd7\\xb9\\x57\\x65\\xdf\\x59\\x0a\\x33\\x72\\x88\\x19\\x3e\\x18\\x6a\\x13\\x08\\xc0\\xbc\\xba\\x27\\x18\\x4d\\x90\\x67\\x28\\x99\\x06\\x14\\x27\\xd6\\xb1\\xaa\\x38\\x95\\xcc\\x1d\\x5a\\xd5\\xd5\\x10\\x60\\x8d\\xcb\\x4c\\x29\\x99\\xec\\xcb\\xe0\\xfb\\xcb\\xd7\\xaf\\x0c\\xd0\\x8e\\xd0\\x0c\\xeb\\xd4\\xe6\\xfa\\x17\\x2e\\x53\\x91\\x88\\x31\\x43\\xbf\\x3c\\x60\\x1e\\x40\\xff\\xe1\\xe5\\x58\\x3a\\x81\\x2e\\x57\\x9e\\x05\\xb6\\xc2\\x07\\xce\\xc1\\xa4\\x01\\xd4\\x62\\x1d\\xb0\\xb2\\x0c\\xd0\\xe7\\x03\\x4d\\x41\\xcd\\xd7\\xdf\\x38\\x0c\\x29\\xdb\\xdf\\x6f\\x97\\xb0\\x19\\xfe\\xe6\\x04\\xd2\\x34\\x7e\\x73\\x17\\xf3\\x43\\x48\\x03\\xea\\x70\\x4f\\x95\\xe3\\x7a\\xe1\\xe8\\x0c\\x15\\xe8\\x6c\\x13\\x12\\x5d\\x7c\\x64\\x7d\\x42\\x01\\xfe\\xc5\\x48\\xc5\\xba\\x3d\\x0b\\xec\\x90\\xea\\x63\\x30\\xcd\\x8a\\x58\\xab\\x35\\x27\\xde\\xe2\\x0e\\x15\\x12\\x98\\x7a\\xcd\\x1d\\x06\\x3f\\xc4\\xe5\\x8d\\x3c\\xd6\\x48\\x61\\x32\\x1c\\x65\\xe6\\x8c\\x9d\\xe6\\x43\\xda\\x19\\xa9\\x0f\\xd9\\xc4\\x72\\x1c\\x0a\\x36\\x25\\x82\\xea\\x28\\x48\\x67\\x93\\x2b\\x64\\xc2\\x4d\\x39\\x49\\x8c\\x6f\\x80\\x3b\\x12\\xff\\x69\\x24\\x81\\xf9\\xbc\\xa6\\xf5\\xaf\\xf7\\x66\\x4c\\xf9\\x1a\\xaf\\x53\\x0f\\xcc\\x5b\\xfa\\x9e\\x08\\x74\\xb1\\xbc\\x5c\\x15\\xc0\\x07\\xd0\\x07\\xab\\xc2\\x2c\\x42\\x32\\x9d\\xc2\\x10\\x8f\\x42\\x31\\xac\\x5b\\x4c\\x36\\xa6\\x20\\x96\\xa6\\xfc\\xb2\\x8a\\x42\\x52\\x22\\xb3\\x24\\x62\\xa0\\x39\\xc7\\xbb\\xf2\\x01\\xaa\\x13\\xbd\\x7f\\x6f\\x40\\x99\\xb0\\x9c\\x6c\\x56\\x9b\\x80\\xe5\\x0c\\x04\\xef\\x47\\xcc\\x8a\\xb8\\x50\\x88\\x10\\xf0\\x57\\xad\\x47\\x5f\\xfc\\xd4\\x89\\x82\\x0d\\xad\\xee\\xf0\\x44\\xa1\\x87\\x0d\\xf1\\xdc\\x3b\\xb9\\x14\\x08\\x6d\\xf4\\x48\\x5c\\x13\\x96\\x17\\x4e\\xc3\\xad\\x80\\x6a\\x45\\xad\\xba\\x24\\xe2\\xc2\\xae\\x89\\x26\\x16\\x5c\\x66\\x03\\xc6\\xa4\\x65\\xa9\\xce\\x8d\\xf7\\x2c\\xb2\\x24\\xaf\\xd4\\x98\\x02\\x7a\\x8f\\xcf\\x74\\x5b\\x01\\xb2\\xed\\xeb\\xea\\xe5\\x81\\x65\\xce\\xf3\\xf7\\x8f\\x42\\x49\\xaf\\x4d\\x22\\x36\\xa5\\x9d\\x97\\x00\\xf0\\x91\\xda\\x6f\\xc2\\xf5\\x0d\\xa9\\xdc\\x93\\x5c\\x85\\x78\\xba\\x12\\x44\\x4a\\x4d\\x81\\xf7\\xd3\\x7b\\x7b\\xa3\\x63\\x11\\x3e\\xde\\x01\\xd6\\x18\\x06\\x39\\x4e\\xa3\\x53\\x39\\x17\\x08\\xbe\\xe1\\x13\\x4b\\x24\\x65\\x3c\\x02\\x8f\\x34\\xbd\\xc6\\xe8\\x0a\\x8c\\x9d\\xfb\\x01\\x1a\\x3e\\x1e\\xa0\\x98\\x8e\\x94\\x9b\\xc3\\x74\\xfe\\x6c\\x8a\\xa2\\xc7\\x19\\x01\\x38\\xba\\x7f\\x5e\\x49\\x5e\\x72\\xa4\\xc6\\xe1\\x2c\\x29\\x65\\x23\\xc4\\x6c\\x78\\xf7\\x8e\\x92\\x40\\x86\\x88\\xfd\\xb0\\x1e\\xe8\\xf4\\x01\\xc1\\xe8\\x26\\x4e\\x22\\x60\\x9e\\x26\\xd5\\x08\\x80\\xb4\\x24\\xaa\\x21\\x71\\x18\\x7c\\x73\\x6f\\x60\\x8d\\x61\\x72\\x86\\x97\\x29\\xcb\\xd2\\x36\\x8e\\xf3\\xa2\\x34\\x42\\xf4\\x54\\xbf\\x32\\xe0\\x13\\x08\\xf9\\x96\\x44\\x87\\x50\\xac\\x78\\xf6\\x34\\xff\\xa0\\xc6\\x82\\x17\\xe6\\xd0\\x78\\xd8\\x4c\\x85\\x17\\x4d\\xa7\\xca\\x2d\\xa7\\x26\\x5d\\x7b\\xb0\\x39\\x47\\x81\\x05\\xda\\x22\\x1f\\x4d\\xc7\\x4f\\xea\\x23\\x35\\x5c\\x33\\xcb\\x9e\\x0f\\x9e\\x8a\\x79\\xdb\\x3d\\xd0\\x35\\x27\\x98\\xaa\\x3d\\xe1\\x15\\x9e\\x75\\x0f\\x16\\xa9\\x18\\xa8\\x4f\\x84\\x34\\x4f\\x29\\x2e\\x5d\\xcc\\x59\\x01\\x8d\\xe8\\x4a\\x4c\\x70\\x32\\x2d\\xef\\x07\\x6b\\xb6\\x70\\xec\\x0d\\x8d\\x16\\xcb\\x66\\xbe\\x61\\xb3\\xa8\\x53\\xb4\\xa8\\x61\\x63\\x20\\x5c\\xc6\\xa0\\xe1\\x61\\x8e\\xc9\\x4d\\xed\\xb4\\x69\\x9c\\x9d\\x6d\\xcd\\x24\\x96\\xdd\\xe2\\x31\\xd3\\xd8\\x01\\x71\\x79\\x22\\x7f\\xc3\\x7b\\xc9\\xfa\\xa8\\xbc\\x88\\x47\\x77\\xa5\\xae\\xe3\\x94\\x2b\\x30\\x3c\\x66\\xf7\\x7f\\x65\\x30\\x1f\\x2c\\x08\\xb0\\x2a\\xe4\\x12\\x26\\xce\\xd5\\x63\\x8b\\x05\\xac\\x59\\x72\\x36\\x1c\\x11\\x58\\x1a\\xda\\x1d\\x8e\\x0b\\x68\\xa1\\x79\\x7c\\x81\\x01\\x8f\\x1b\\xbb\\x10\\x1e\\xa8\\x01\\xbc\\x8c\\xba\\x17\\x7e\\xac\\x1c\\x25\\x58\\xd5\\xf8\\xeb\\x48\\x3e\\x5a\\xb3\\xf5\\xc7\\x3f\\x2e\\x68\\xfd\\x4d\\x13\\x4c\\xac\\xe1\\xab\\x0b\\xcc\\x78\\x2d\\x5c\\xc6\\xe3\\xe8\\xab\\x5a\\xda\\xe4\\xc7\\x08\\x8c\\x27\\x1a\\x95\\xa0\\x07\\xfa\\x15\\xb5\\xe3\\x4a\\xcf\\x31\\x89\\xad\\x1a\\x41\\x41\\x00\\x42\\xe4\\x0c\\x7d\\x95\\x0a\\xf4\\xe3\\x71\\x92\\xac\\xcc\\x78\\x87\\x36\\x3d\\x57\\x9c\\xa1\\xd9\\x34\\xcf\\x6e\\xe3\\x08\\x1e\\xe1\\x51\\xaa\\x28\\x7a\\x52\\x53\\x92\\x35\\xeb\\x0c\\x62\\x59\\xab\\x33\\x67\\x2b\\xdc\\xad\\xe8\\x6e\\x18\\xf1\\x44\\x06\\x44\\x0f\\x50\\x0f\\x6e\\x94\\xf0\\x61\\xf0\\x3a\\xa4\\x34\\x90\\x0e\\x3d\\xee\\x2c\\x5e\\x7f\\x17\\xae\\x2e\\xe0\\x46\\xda\\xa2\\xea\\x1c\\x58\\x30\\x16\\xb2\\xa2\\x76\\x84\\xc8\\x9d\\x1b\\xa4\\x9e\\x8a\\x00\\x91\\x3a\\x00\\x46\\x1a\\xfb\\x9b\\x19\\x2e\\x35\\x65\\xd7\\xa0\\xad\\xa1\\xf7\\x9e\\xf0\\x9d\\x62\\x7d\\x39\\xca\\x26\\x57\\x31\\xba\\xdf\\x94\\x0c\\x24\\xd0\\x15\\x0b\\xee\\xbd\\x43\\x78\\x3e\\x4a\\x66\\x94\\xdb\\x0d\\xaf\\xc5\\xb9\\x5b\\xe3\\xa2\\x72\\xf7\\x00\\xa6\\x41\\x17\\x4f\\xa7\\x05\\x55\\xc0\\xba\\x30\\x60\\x31\\x99\\x16\\x83\\xc3\\x94\\x22\\x34\\x8a\\x1e\\xa7\\x6b\\x55\\x36\\x88\\x31\\x2e\\x03\\xfa\\x03\\x3e\\x95\\x78\\x54\\xd3\\xfc\\x95\\x99\\xc0\\x04\\xc0\\x44\\x97\\x37\\xb4\\x43\\xa3\\xe0\\x9b\\x70\\x48\\x11\\x14\\xb3\\xe9\\x34\\x89\\xb1\\x06\\x47\\x6c\\x13\\x6c\\x60\\xbc\\x5b\\xde\\xa7\\x28\\x49\\xe2\\x82\\x53\\x15\\x4d\\x5d\\x06\\x4a\\x38\\x68\\x20\\x14\\x27\\x56\\xc9\\x7e\\xcf\\xf6\\xc0\\x6f\\x73\\x33\\xd9\\xb7\\x49\\xc3\\xaa\\xac\\xb3\\x98\\x8b\\x1c\\x78\\x32\\x25\\x04\\x5e\\x87\\x99\\x46\\xc3\\xb2\\x99\\xe6\\xd9\\x65\\x75\\xfa\\x35\\x1b\\x54\\x2e\\x55\\x1d\\x83\\xaa\\x53\\x9f\\xc3\\x1b\\x4a\\x62\\x1d\\x6e\\x24\\x4d\\x67\\x9b\\x4a\\x66\\x89\\x4d\\x2b\\x01\\x98\\x87\\x26\\xb8\\x09\\xea\\xb2\\x02\\x5c\\x76\\x8c\\x3f\\xe2\\x42\\x20\\xc5\\xd7\\x69\\x3a\\x00\\xa5\\x95\\x57\\x2b\\x66\\xbe\\x25\\x31\\xa4\\x1e\\x9b\\x9a\\x0d\\xb5\\x57\\x19\\x54\\x58\\xa6\\x0d\\x7b\\xe0\\x2c\\xbd\\xcb\\xc3\\x69\\x57\\x14\\xe6\\x07\\x78\\xee\\x6e\\x10\\xb3\\x11\\xf0\\x1c\\x93\\x6e\\x28\\x2d\\x79\\x15\\x07\\x43\\x84\\x0a\\x01\\x98\\x02\\xf0\\xa2\\xcc\\x7a\\x98\\x93\\x35\\xb7\\x82\\xa5\\xf7\\x5e\\x53\\xc0\\x42\\x09\\x52\\x78\\x47\\xf0\\x33\\xb4\\x4d\\xe4\\xf1\\xe9\\x41\\xd4\\xa8\\x40\\x64\\x76\\xad\\x56\\x83\\x60\\xdb\\x24\\x93\\x75\\x88\\x55\\x5c\\xae\\x30\\x2b\\xab\\x65\\x41\\xd2\\xfc\\x46\\x2f\\x34\\xf8\\x62\\x73\\x69\\xf3\\x48\\xc3\\xfc\\xc4\\xa5\\xa6\\xd5\\xee\\x3a\\x4c\\x73\\x37\\xc5\\x6e\\x36\\x79\\xc9\\xed\\x9f\\x88\\x64\\xa3\\xa9\\xbb\\x94\\x70\\xeb\\x8f\\xe7\\xd0\\x7c\\x69\\x62\\x2f\\xbf\\x81\\xf5\\xa6\\xbd\\x9e\\x3a\\x8d\\xa7\\x53\\xd4\\xd6\\x0d\\xbe\\x55\\xcd\\xef\\x80\\xa7\\x8e\\xd1\\xbb\\x10\\x33\\x1c\\x6c\\xfa\\xf1\\xe6\\x2c\\x4d\\x55\\xbe\\x61\\xd5\\xb3\\x7e\\x32\\xb7\\x6a\\x22\\x36\\x76\\x75\\x5e\\x27\\x15\\xd1\\x5b\\x85\\x5c\\x8f\\x58\\x11\\x31\\xe3\\x96\\x5f\\x19\\x67\\x25\\x91\\x28\\xc0\\xae\\x92\\x36\\x3b\\x36\\x33\\xd7\\xa0\\x31\\xd5\\x9a\\xaf\\xb7\\x78\\xa5\\xb9\\x1b\\x0d\\xd5\\x9e\\x76\\x9b\\x93\\xc2\\x3d\\x6f\\x28\\x39\\xab\\xc1\\xc3\\xa2\\x66\\xf3\\x0a\\xdf\\x37\\xb7\\x01\\x7a\\xf5\\x0c\\x14\\xe3\\x8a\\xae\\x3f\\x8d\\x7d\\xfb\\x4a\\x03\\x21\\xd1\\xcd\\xe6\\xcc\\xe2\\x0a\\x72\\x2c\\x0c\\xc7\\xc1\\xbf\\x55\\x9e\\x1d\\xf0\\x1d\\xa3\\x18\\x84\\xe9\\x9a\\x2a\\x93\\x35\\x47\\x05\\xd8\\x09\\x63\\x38\\x7c\\x44\\xaf\\x55\\x59\\xe1\\xe1\\x11\\xad\\x25\\xc1\\xaf\\xc1\\x2b\\x15\\x6c\\x16\\x46\\xc3\\xce\\xd7\\x6e\\x16\\x5e\\xa8\\x30\\x07\\xa8\\xb9\\xe8\\xa4\\xdc\\xed\\x17\\x0c\\xc8\\xfe\\x0b\\x27\\x59\\x8b\\xd1\\x57\\x3d\\xd0\\x00\\x8c\\x70\\x1e\\xc6\\xa9\\xc1\\x87\\x58\\x75\\x9e\\x3e\\x41\\x2c\\xe3\\xff\\xb0\\x34\\x0b\\x55\\x9c\\x74\\x76\\x5b\\x2b\\x0f\\xef\\x61\\x67\\x1f\\xcc\\xf5\\xfc\\x26\\x91\\x64\\x9c\\xaa\\x17\\xdc\\x7e\\xf3\\xf5\\xa5\\x83\\x72\\x15\\x67\\x74\\x05\\x53\\xf1\\xe8\\xc6\\xb5\\x9d\\xbe\\x83\\x65\\x89\\x4a\\xaf\\xcb\\x9b\\x56\\x5a\\xb6\\x21\\x6c\\x7e\\xad\\x5f\\xdb\\x19\\xe2\\xb5\\x1d\\xba\\x11\\x41\\x17\\x2a\\x46\\x98\\x66\\xa0\\x37\\x19\\x7d\\xdf\\xc7\\xd5\\x3d\\x01\\x68\\x0a\\x8a\\x05\\x46\\x38\\xc1\\x08\\xf3\\xe6\\x8f\\x82\\x2f\\x0f\\xff\\x7b\\xa8\\x43\\x15\\xf8\\xaf\\xff\\xf1\\x80\\xae\\xd2\\x89\\xc1\\xfe\\x49\\x44\\xdd\\xab\\xbe\\xe7\\x3d\\x61\\x24\\x7f\\xae\\x2c\\x82\\x1a\\xce\\x51\\x83\\x47\\xb9\\xd8\\x46\\xe2\\x0a\\x4c\\xc5\\x5d\\x66\\x71\\x69\\x8c\\x85\\xe2\\x05\\x4c\\xb4\\xd5\\xec\\x51\\x91\\x0b\\x06\\xfc\\xdc\\x17\\x9a\\xff\\xe7\\x1c\\x44\\x49\\x9c\\x60\\x9a\\xc5\\x56\\xf3\\xeb\\x4b\\x52\\x18\\x78\\x76\\xea\\x39\\x9a\\xb8\\xa5\\xce\\x62\\x00\\x5e\\xf1\\x24\\x48\\x63\\xac\\x0c\\x1b\\x27\\xa1\\xb9\\xec\\xa3\\x47\\xd7\\xfb\\x91\\x56\\x7f\\x7f\\x1a\\x58\\xbb\\x50\\xde\\xd9\\x97\\x9b\\x0a\\x95\\x74\\xb6\\x28\\x6a\\xb8\\xd2\\x29\\x9f\\xbc\\xb0\\x5a\\xb8\\xf3\\x06\\xc9\\x8a\\x8c\\x32\\x9f\\xbb\\x67\\x75\\xcb\\x51\\xdd\\x22\\x85\\x15\\x28\\xe4\\xa1\\xc1\\x62\\xde\\x4d\\x98\\x15\\xf1\\xc0\\x73\\x16\\x63\\x15\\x8e\\xf3\\xf0\\x5a\\x6f\\x0c\\xcb\\xc0\\xef\\x1d\\xda\\x6c\\x12\\x6a\\x50\\x48\\x08\\xb4\\xfa\\x18\\x17\\xb4\\x2e\\x6a\\x2e\\xdd\\x32\\xd0\\xc3\\xd7\\x1a\\xe6\\x3e\\x31\\x44\\x27\\xa1\\x67\\xa1\\xa8\\xa1\\xae\\x5d\\x9a\\xdc\\xcb\\xf9\\x05\\xef\\x90\\x76\\x69\\xf7\\xd7\\x0d\\xde\\xad\\xdf\\x16\\xcd\\xc0\\x57\\x91\\x0d\\xbd\\xc3\\x6b\\xf8\\xa0\\xa8\\xe8\\x72\\x8d\\xcb\\x42\\x47\\x21\\xdf\\x66\\xad\\x77\\x1d\\x86\\xb8\\xa1\\xb3\\x79\\x49\\x49\\x4a\\xc6\\xde\\xc0\\xa0\\xb0\\x9b\\xc3\\x64\\x60\\x46\\x13\\x41\\x15\\x46\\xdd\\x9b\\x21\\x4b\\x78\\x63\\xcc\\x71\\xb0\\x3c\\x24\\x7d\\x0f\\x6f\\xcc\\xa6\\xf0\\x12\\x18\\xcd\\xd7\\x37\\x94\\x1a\\x15\\xa6\\x23\\xf8\\x14\\x0b\\x04\\xc5\\xb6\\xce\\x69\\x99\\xab\\xd6\\xb2\\x3f\\x1b\\x24\\x64\\x92\\x15\\x00\\x4b\\x4d\\x3b\\xb5\\x2f\\x86\\xcf\\x54\\x74\\xa9\\x58\\xdd\\x80\\x8e\\x3d\\xc7\\xf3\\x8e\\xdd\\x16\\xde\\x78\\x42\\xb3\\xc1\\x98\\xe7\\x13\\x3e\\xc6\\x19\\xa3\\x3b\\x45\\x05\\xa3\\xd3\\xcc\\x8c\\x14\\x17\\xee\\x65\\x38\\x7d\\x61\\xd3\\x5c\\x27\\x1e\\x57\\xc2\\x98\\x7e\\x85\\x03\\x04\\x51\\x85\\x51\\x3f\\x5e\\x2f\\xb4\\x13\\xed\\x2e\\xfb\\x49\\x05\\xd7\\x15\\xef\\x22\\xab\\xa4\\x59\\xe1\\x7e\\x32\\x14\\x52\\x36\\xe6\\xe2\\x38\\x5c\\x8b\\x10\\x48\\xe9\\xf0\\x47\\x5d\\x8e\\x9a\\xb6\\xa5\\xd0\\x2d\\x9a\\x55\\x8d\\xd9\\x23\\x72\\x9a\\x0e\\xd6\\x35\\x93\\xe9\\x1b\\xbd\\x7d\\x07\\xff\\x45\\xf4\\x81\\x7b\\x93\\x36\\x5f\\x5d\\x35\\x04\\x83\\x11\\xe2\\x85\\xcd\\x08\\xf0\\x88\\xd6\\x97\\xb8\\x5a\\xa9\\xee\\x5d\\x54\\x1c\\x85\\xdc\\x03\\x6f\\x52\\x1b\\x2d\\x1e\\xf1\\xca\\x46\\x88\\x73\\x74\\x49\\xa6\\x38\\x08\\xc7\\x28\\x9b\\xd0\\xa7\\x94\\xcf\\x5a\\x81\\x58\\x4e\\x48\\xbb\\x0e\\x48\\x4e\\x75\\xf8\\x15\\xab\\xc6\\x83\\x3b\\x46\\x5e\\x33\\xd9\\x37\\x94\\x97\\x32\\xc5\\xe8\\x8e\\x78\\xb7\\xae\\xb0\\x8d\\x6e\\xf0\\x9a\\x7e\\xf3\\x19\\x74\\xd3\\x29\\x1d\\xae\\x44\\x5d\\x15\\x06\\x2f\\x63\\x97\\x95\\xc8\\x05\\x66\\x14\\x75\\x86\\x5d\\xa2\\x59\\xf7\\x91\\xb3\\x36\\x1b\\x31\\x2e\\x23\\xe9\\x35\\xf6\\x54\\x90\\xdc\\xc1\\x39\\x11\\x98\\xb4\\x29\\xee\\x82\\xc3\\xfc\\x59\\xc2\\x32\\x2d\\x01\\xbb\\xc3\\xe0\\xfc\\x5d\\xc7\\xd7\\x2d\\x5f\\xa1\\xd8\\xcc\\xd8\\x39\\xc4\\xc8\\xe3\\x5d\\x98\\x47\\xce\\xa9\\x58\\x12\\x16\\x5d\\xd1\\xbb\\x20\\xf0\\x69\\xf7\\xaf\\x5a\\xd0\\x67\\x55\\x3a\\x82\\xa4\\x3b\\xea\\xd8\\x57\\xc6\\x12\\x04\\xf0\\xc2\\x90\\x4f\\x0b\\x52\\xd0\\x9b\\xb0\\x39\\x5c\\xa9\\xab\\x26\\x39\\x34\\x6a\\x61\\x96\\xde\\x05\\x6c\\xb9\\x07\\x22\\x4a\\x35\\xac\\x49\\x9a\\x87\\x1a\\xb6\\xe0\\x57\\x36\\xb4\\xd9\\x20\\x07\\x1c\\xf4\\x8d\\x0b\\x8f\\x38\\x8e\\xe6\\x6c\\x24\\x48\\x7b\\x00\\xd4\\xdb\\xab\\x7a\\xd4\\xbc\\x7a\\x10\\x72\\x75\\x6d\\xcb\\xcb\\xca\\x48\\xc7\\x46\\xfd\\x38\\x90\\x9e\\xeb\\x30\\xaf\\x86\\xff\\x62\\xae\\x73\\xa5\\x17\\x4c\\x93\\x70\\x56\\x80\\xa8\\x6f\\x60\\xcd\\xae\\x73\\xd3\\xd1\\xd5\\x9c\\x43\\x81\\xcd\\x39\\x83\\x18\\x93\\x5b\\x40\\x7b\\x3c\\x4a\\xea\\x2c\\x6f\\xc3\\x12\\xf6\\xfd\\xd7\\xc5\\xa3\\xc4\\x7e\\x05\\x1f\\x87\\xd0\\xef\\xb7\\x2c\\xfa\\xdb\\x24\\xec\\xe6\\xb4\\x9d\\xc2\\xd1\\xd3\\x75\\x18\\x3f\\x46\\xf7\\xdc\\x84\\xb7\\x7c\\xcf\\x4f\\xf3\\xa4\\xc3\\xb5\\xf2\\x0f\\x89\\xb7\\xbf\\xda\\x6e\\xc2\\x62\\x93\\x5b\\xf5\\xfa\\x49\\x61\\x93\\xa8\\x7c\\x67\\x65\\x01\\x7c\\xcd\\x10\\x7d\\x3c\\xc4\\x93\\x1b\\x35\\xfa\\xe0\\x2d\\xa0\\xb6\\x34\\x73\\xed\\x79\\x85\\x4d\\x89\\x1a\\xb5\\xdc\\x0c\\xd7\\x76\\xcf\\xf1\\x4e\\xe5\\x18\\xed\\xe6\\x44\\x85\\x45\\xe9\\x1c\\x6e\\x16\\xb5\\x73\\x41\\x26\\x1a\\x1f\\xb3\\xd5\\xd2\\xd9\\xb6\\x27\\x37\\x71\\xa3\\xd8\\x48\\xbe\\x61\\x4d\\x6e\\x76\\x9a\\x88\\x3d\\x0c\\x45\\x67\\x41\\x98\\x40\\x79\\x70\\x06\\xf0\\x8d\\x46\\x6a\\x4a\\xa5\\xb5\\x6c\\xa1\\xa9\\x21\\x7b\\x3c\\x43\\xf1\\xab\\xc5\\x8a\\x94\\xcf\\x9e\\x16\\xe2\\x0f\\xf9\\x27\\x89\\xf6\\x98\\xf3\\x70\\xd1\\x24\\x84\\x56\\xb3\\x14\\x38\\xb8\\x80\\x49\\x6a\\x33\\x49\\x3f\\x49\\x1e\\x6f\\xca\\xd0\\x03\\x22\\xfb\\xbb\\xd9\\x27\\x49\\x3d\\x35\\xef\\x54\\x6f\\x79\\xea\\x29\\x73\\xb0\\xc7\\x4e\\x91\\xa1\\xdf\\x2a\\xe6\\x00\\x1e\\xf5\\x22\\xf2\\x6d\\x26\\x01\\xfa\\xff\\x5d\\x16\\xc1\\x5b\\x74\\x23\\xba\\x6c\\x2c\\x97\\x77\\x3a\\x18\\x18\\x3a\\xeb\\x75\\x9a\\x67\\x00\\x2d\\x2b\\xe1\\x5a\\x11\\x3c\\x57\\x47\\xe3\\xa0\\xc2\\x3e\\xee\\xcf\\xd7\\xba\\x2d\\xea\\x1c\\x2a\\x47\\x51\\x69\\xe9\\x75\\xab\\x37\\xc6\\xe9\\x6d\\xf6\\x41\\x45\\xad\\xee\\xad\\xc3\\x1f\\x9f\\x26\\x93\\x70\\x3a\\xd0\\x93\\xd4\\x75\\x46\\x94\\x4d\\x4e\\xe7\\x7b\\xb2\\x6d\\xd6\\x6b\\x3c\\x99\\xa8\\x28\\x0e\\x4b\\xac\\x2b\\x3a\\xce\\xb0\\x77\\x2a\\xe5\\x3c\\xc4\\x57\\xc9\\x32\\x77\\xfb\\xce\\xc6\\xee\\xd6\\x86\\x81\\x48\\xb9\\xbf\\x31\\xe4\\x3e\\x96\\x9c\\x73\\xc3\\x02\\x9e\\x62\\x18\\xcf\\x4c\\x94\\xc2\\xfc\\xb0\\x40\\x62\\xd7\\x40\\x09\\xcb\\x07\\x3c\\x61\\x44\\xf0\\x16\\x3a\\x5d\\xa4\\x78\\x36\\x70\\xba\\x46\\xc5\\xc5\\xaf\\x69\\x3c\\xc2\\x03\\x57\\x24\\x07\\x26\\x92\\x6e\\x88\\x22\\x18\\xb9\\xcf\\x82\\xab\\x19\\x06\\x73\\x4b\\xff\\x9a\\x8a\\x13\\xf3\\xf6\\x92\\xb3\\xac\\x0a\\xd6\\xb5\\x76\\x1b\\x74\\x30\\x07\\xc2\\xd7\\x4b\\x2e\\x09\\x73\\x52\\x15\\x55\\x4e\\x8a\\x2c\\xca\\x6c\\x6a\\x63\\xf4\\xf5\\x65\\xa4\\xaa\\xc9\\x01\\xda\\xbc\\xe1\\x22\\xe4\\x1b\\x61\\xd6\\xfb\\xb4\\x8c\\x1b\\xd8\\xa5\\x7d\\xcd\\x26\\xfe\\xed\\x1a\\xfb\\x8c\\xab\\x6f\\xab\\x2d\\xd7\\x46\\xf0\\x0b\\x9f\\x3c\\x76\\x76\\xc9\\x7b\\xf6\\x40\\xe5\\x53\\x62\\x17\\xc7\\x26\\x3e\\x15\\x56\\x01\\xd0\\xa6\\x2d\\x6c\\x17\\x97\\xea\\xc6\\x12\\xdd\\x18\\x32\\xd3\\x98\\x93\\x8f\\x95\\xf3\\xee\\xd6\\x86\\x63\\xb6\\x48\\x3a\\xc8\\xba\\xf0\\xd9\\xda\\x99\\x00\\xa2\\xb7\\x94\\xf7\\xb5\\x61\\x02\\x34\\x5a\\xf2\\x5e\\x95\\x68\\x4a\\x7e\\xa6\\xc9\\xcc\\x1c\\x8e\\xb5\\x5b\\xc7\\x72\\xd1\\xe4\\xbc\\x75\\x61\\xb2\\x29\\x8f\\x0e\\x71\\x5a\\x30\\xe5\\x8d\\x0f\\xae\\x4d\\x26\\x84\\x9f\\x70\\x81\\xf6\\xa9\\x9c\\x51\\x56\\x2f\\xda\\x67\\xe3\\x31\\x80\\xf4\\x96\\xae\\xf4\\x75\\xb9\\x23\\x7a\\x22\\xbe\\xfc\\xb7\\x74\\xfc\\xf7\\x11\\x1a\\x7c\\x8c\\xd1\\xc2\\xf6\\x1e\\xa2\\x6b\\xf3\\x4e\\x3e\\x39\\x7a\\x14\\x0f\\x44\\x90\\x0d\\xed\\xd8\\xdb\\x35\\x8c\\xab\\xab\\x70\\x6b\\xbb\\xb6\\xf0\\x6e\\x3d\\x26\\xf1\\x4e\\x32\\x74\\x3d\\xa6\\xf2\\xe3\\x60\\xe0\\xaa\\x46\\xf2\\x4e\\x32\\x70\\x75\\xe3\\xf9\\x71\\x30\\x6f\\x59\\xb3\\xb9\\x29\\x5e\\x85\\x77\\x68\\x54\\xb4\\x7c\\xbc\\xea\\x71\\xee\\x33\\xb9\\xba\\x5d\\x2a\\xca\\x52\\xa3\\xc6\\x27\\x11\\x77\\x42\\x72\\x2c\\x1b\\x77\\xea\\x41\\x91\\x4f\\x62\\x5f\\xad\\xaf\\x83\\xad\\x2f\\x71\\xe0\\xd2\\xfa\\x02\\x4e\\x8f\\x8f\\x6f\\xeb\\xd9\\x3e\\x1f\\x13\\x9f\\xd6\\x11\\x69\\x7a\\x7c\\x7c\\x5a\\x7d\\x97\\x7c\\x4c\\x3c\\x5a\\x75\\xaf\\xfc\\x94\\xf6\\x01\\x8d\\xcb\\x82\\xb5\\xef\\xfa\\x1c\\x4c\\x86\\xd8\\x1c\\x19\\x9f\\x7b\\x85\\x07\\xc3\\x20\\x0f\\xd3\\x6b\\x3a\\xa5\\x25\\xa9\\x69\\x3f\\xff\\x2b\\xca\\x30\\x2f\\x17\\xc9\\xa2\\xf6\\xae\\xa2\\x1a\\x48\\xf8\\x0e\\x2a\\x17\\xff\\x63\\x24\\x95\\xa4\\xf6\\x63\\x9f\\xcb\\xf8\\x56\\xd1\\x19\\x9a\\xde\\x0b\\xa8\\x3e\\x02\\x47\\x29\\x9c\\x0e\\x9f\\xb6\\xe9\\x82\\x9b\\x33\\xad\\x95\\x18\\x3c\\x5d\\x19\\x4a\\x5a\\x2d\\x57\\x8a\\x16\\xc8\\x5a\\x80\\xc4\\x8f\\xb3\\x49\\x5c\\x96\\x78\\x48\\x48\\x67\\xae\\x44\\x76\\x94\\x9b\\x38\\x9d\\xc1\\x10\\x98\\x2b\\x9e\\x74\\xa0\\x27\\xf2\\x91\\x00\\x8b\\x06\\xc4\\x0a\\x27\\xa0\\x97\\x46\\x2f\\x7a\\xa4\\x86\\x5f\\xdc\\x64\\x77\\x34\\xea\\xbf\\x66\\x8a\\x6b\\x8a\\x7a\\x4d\\x5b\\x81\\x1f\\xba\\xab\\x78\\x90\\xa5\\x5e\\xd8\\x6d\\x5e\\x24\\x8c\\x06\\x7c\\x83\\x0d\\xd4\\x9a\\x16\\x04\\x9d\\x82\\x4a\\x77\\x35\\x33\\xfd\\x61\\xf0\\xd2\\x2d\\x84\\xfe\\x91\\x89\\x02\\x88\\xa5\\x51\\x98\\xc3\\x8c\\xe3\\xb1\\xc2\\xba\\xb8\\xfc\\xae\\x47\\x02\\xfa\\x69\\x60\\xa6\\x74\\x17\\x88\\x5c\\xca\\xa8\\xe0\\xfd\\x3a\\x4c\\xe3\\xe9\\x2c\\x41\\xcb\\xa2\\x17\\xf6\\xa0\\x18\\xc0\\x87\\x58\\xb8\\x88\\x45\\xaa\\xee\\xfe\\x97\\x86\\x76\\xfb\\xd5\\x79\\x73\\xb8\\x75\\xf5\\xb4\\xe3\\xc5\\xd0\\xe8\\x7b\\x1c\\x4d\\x98\\xea\\x71\\x8f\\x82\\x6f\\x65\\xb0\\xae\\xe0\\xe6\\x96\\x90\\x35\\xc9\\x00\\x97\\x74\\xc4\\x7d\\xe7\\xd5\\xee\\x70\\xee\\xf8\\xd2\\xfc\\x43\\xae\\x2f\\x18\\x7a\\x2f\\x8d\\xf8\\x22\\x94\\x4e\\x1c\\x88\\x14\\x83\\x6a\\x8e\\xcc\\xe3\\xb2\\xda\\x37\\x98\\xc9\\x61\\x33\\x04\\x34\\x39\\x1e\\x9c\\x18\\x5b\\x12\\xff\\x4d\\x0b\\x9a\\x41\\xc3\\xda\\xb4\\x8f\\x52\\xf6\\xb6\\x4c\\xee\\x87\\x13\\xf5\\x06\\x86\\x74\\x4a\\xff\\xef\\x4f\\x22\\x35\\x4a\\xc2\\x1c\\xef\\x7a\\x45\\xb3\\x44\\x05\\x7b\\xdc\\xf6\\x76\\x2f\\xf8\\x95\\x46\\x05\\x73\\x24\\x83\\x2d\\xfc\\xaf\\xc1\\x9f\\xdc\\x77\\x6f\\x43\\x6d\\x3e\\xea\\x91\\x2e\\xb0\\x02\\xe4\\xe8\\xb9\\xf7\\xc6\\x9f\\xaa\\x0f\\xff\\xff\\x00\\x00\\x00\\xff\\xff\\xa3\\x3d\\x8d\\x7a\\x4a\\x45\\x02\\x00\")\n\nfunc uiTsTypingsJqueryJqueryDTsBytes() ([]byte, error) {\n return bindataRead(\n _uiTsTypingsJqueryJqueryDTs,\n \"ui/ts/typings/jquery/jquery.d.ts\",\n )\n}\n\nfunc uiTsTypingsJqueryJqueryDTs() (*asset, error) {\n bytes, err := uiTsTypingsJqueryJqueryDTsBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/ts/typings/jquery/jquery.d.ts\", size: 148810, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\nvar _uiTsTypingsMithriljsMithrilDTs = []byte(\"\\x1f\\x8b\\x08\\x00\\x00\\x09\\x6e\\x88\\x00\\xff\\xb4\\x58\\x5b\\x4f\\xdb\\xc8\\x17\\x7f\\x0e\\x9f\\x62\\xd4\\x27\\x47\\x8a\\x42\\xf5\\x7f\\x74\\xda\\x44\\x55\\xa1\\xe2\\xbf\\x2a\\xd0\\x25\\x09\\x5b\\x09\\xa1\\xd5\\xc4\\x3e\\x49\\xbc\\xd8\\x1e\\xef\\xcc\\x38\\x21\\x5b\\xf8\\xee\\x7b\\xe6\\xe6\\x4b\\x6c\\x07\\xc2\\x0a\\x04\\xd8\\x9e\\x99\\x73\\xbf\\xfd\\xec\\xd3\\xd3\\xcb\\x48\\xae\\x79\\x14\\x93\\x8f\\xc3\\xff\\x0d\\x3f\\x12\\xb9\\xcb\\x80\\x84\\xb0\\x8c\\xd2\\x48\\x46\\x2c\\x15\\x64\\xc9\\x38\\x99\\xe1\\xa2\\x08\\x78\\x94\\xc9\\x93\\x10\\x82\\x98\\x72\\x20\\x09\\x0b\\xf3\\x18\\xc8\\x9f\\x89\\xa5\\xfe\\x75\\xd2\\x8b\\x52\\x09\\x7c\\x49\\x03\\x20\\x96\\xe5\\x54\\x52\\x19\\x05\\xb8\\x75\\xd2\\xeb\\x7d\\x9a\\x11\\x78\\x94\\x90\\x86\\xc2\\xed\\x7e\\x65\\xa9\\xe4\\x2c\\x8e\\x81\\x8f\\x3d\\x01\\x31\\x04\\x92\\x71\\x9f\\x08\\xc9\\xa3\\x74\\x35\\x20\\x54\\xe2\\xcd\\x22\\x97\\x20\\x7c\\x47\\xf0\\xa5\\x58\\x1a\\x90\\xe1\\x70\\x18\\xac\\xa3\\x38\\xe4\\x90\\xfa\\xe4\\x0b\\xe7\\x74\\xf7\\xc9\\x50\\x3e\\xd9\\xc3\\xb7\\x11\\x97\\x39\\x8d\\xcf\\x63\\x48\\x20\\x95\\x4f\\x85\\xcc\\x24\\x63\\x29\\x2e\\x7c\\x9a\\x8d\\xc7\\xfd\\x82\\x73\\xfd\\xf0\\xe8\\x0d\\xea\\xbe\\xaf\\x3e\\xa8\\x50\\xc6\\x59\\x86\\x87\\x3c\\xbc\\x26\\x91\\x80\\xe2\\xe8\\x0f\\xf3\\x8c\\x5b\\x7d\\xb2\\xbf\\x88\\x97\\x0c\\xb8\\xdc\\xe1\\xe6\\xa8\\xc2\\x62\\x43\\xe3\\x1c\\x19\\xcc\\xfa\\xd5\\xf3\\xfb\\x07\\xbd\\x96\\xdd\\xeb\\xc5\\x5f\\x68\\xf6\\x78\\x44\\x4e\\x4f\\x49\\x12\\xad\\xd6\\x92\\x2c\\x80\\xc8\\x35\\x95\\xf8\\x2f\\x12\\x44\\xac\\x59\\x1e\\x87\\x6a\\xad\\xa0\\xa0\\xe9\\x6e\\xac\\xb4\\xdf\\x22\\x27\\x15\\x3e\\xa5\\xbe\\xde\\x29\\x3d\\x17\\xd0\\x38\\x5e\\xd0\\xe0\\xc1\\x27\\x4e\\x31\\x24\\xea\\x93\\xcf\\x63\\xb2\\x61\\x51\\x88\\x5a\\x78\\xa5\\xb1\\xe7\\x1b\\x74\\x87\\xde\\xc3\\x33\\xda\\x2d\\x26\\x0d\\x0f\\x47\\x8b\\x33\\x26\\xad\\x2b\\x7d\\x72\\xc5\\x42\\x40\\xa1\\xce\\xef\\x3e\\x69\\x89\\x04\\x0a\\x9d\\x8d\\xde\\xca\\xbc\\x24\\xce\\x15\\xb3\\x77\\x52\\xec\\x78\\xde\\x86\\x16\\x89\\x83\\x92\\x61\\x37\\x83\\x01\\x99\\x51\\xbe\\x1a\\x7b\\x15\\x7d\\x7e\\x50\\x4e\\x13\\xc0\\x12\\x8f\\xfe\\x81\\xb0\\xa9\\x9c\\xa5\\x18\\x90\\xc7\\x89\\xaf\\xee\\xfa\\xad\\x16\\xa0\\x7c\\xfc\\x95\\x3c\\x17\\xd2\\x5b\\xcb\\x24\\x76\\x79\\xd0\\x77\\x37\\x5a\\x45\\xac\\xa2\\x10\\x78\\xdd\\x06\\x57\\x39\\x17\\xb3\\xcb\\xef\\x67\\x2c\\xc8\\xd5\\x03\\x52\\xa9\\x24\\x19\\x1d\\x41\\x82\\x2e\\x2e\\xea\\xb4\\xb5\\xda\\x06\\xaa\\xe3\\x05\\x70\\x03\\x01\\x07\\xaa\\x5a\\xe0\\xc4\\x27\\x0b\\xc6\\x62\\xa0\\xe9\\x7b\\x88\\xbb\\xbb\\x7f\\x8d\\x40\\x2d\\x31\\xe4\\x74\\xeb\\xab\\x46\\xdb\\xeb\\x79\\x9a\\xa4\\x55\\xb3\\x1e\\xfa\\x91\\x4a\\x58\\xed\\x9a\\xf5\\x6b\\x3c\\xac\\x4b\\xfc\\x59\\xb3\\x64\\xd8\\x4c\\x2d\\xc7\\x23\\xb2\\xa9\\x6e\\x1f\\xce\\x0a\\x9a\\xc7\\xf2\\xc6\\xf0\\x72\\x55\\xad\\x59\\x97\\xad\\x5b\\xef\\x0a\\x93\\xc1\\x85\\xa2\\x47\\x88\\x2c\\x62\\xf3\\x46\\x69\\xda\\x67\\xd0\\xe0\\x16\\x89\\xff\\xab\\x31\\x47\\x63\\x95\\xd2\\x85\\x33\\x55\\x15\\xe2\\x28\\x7b\\xc4\\x93\\xa6\\xe3\\x0d\\xc8\\x26\\x64\\x89\\x7b\\xaa\\x9a\\xe0\\x65\\x54\\xae\\x4b\\x3d\\x32\\x55\\x22\\x62\\xa2\\x5b\\xd8\\xc0\\xf6\\xc3\\x1b\\xc8\\x62\\x9c\\x89\\x17\\x91\\xc0\\x81\\xb1\\x6b\\x0f\\x99\\x57\\x4f\\xff\\x9e\\xe6\\xe3\\x3d\\xc0\\xae\\xa5\\x3c\\x7a\\xba\\x2f\\x41\\x6d\\x61\\x91\\x63\\x8e\\xfd\\x9e\\x03\\xdf\\x4d\\xf5\\xa2\\x17\\x52\\x49\\x2b\\xfa\\x9a\\x55\\xcb\\x59\\x40\\xf3\\xe4\\xd4\\x49\\x31\\x24\\x45\\x82\\xc0\\xdf\\x39\\x08\\x55\\xb7\\x1e\\xcb\\x34\\x1c\\x28\\x7c\\xfc\\xf3\\xe2\\xe6\\xda\\x2c\\xf5\\x5b\\x66\\x91\\x36\\x03\\x63\\x05\\x9c\\x2b\\xc7\\xea\\x0c\\xc3\\x16\\xc0\\x39\\xe3\\xaa\\x9d\\x9f\\xab\\x9b\\x7a\\x2a\\x8c\\x2b\\x03\\xe7\\xcc\\x12\\xda\\x71\\xa4\\x55\\x11\\xbb\\x34\\xa8\\xcc\\x3f\\xd1\\x22\\xf4\\xee\\xbe\\x45\\x95\\xbb\\x7b\\xa3\\x8c\\x90\\x94\\x4b\\xd5\\x89\\x72\\xa9\\x8b\\xcc\\xab\\x88\\xc7\\x14\\x6c\\xdd\\xc1\\x2d\\x9c\\x74\\xdf\\x10\\x00\\x61\\x3a\\x49\\x22\\xf2\\x48\\x82\\xb6\\x2b\\x13\\xae\\x0e\\x13\\x16\\x3c\\xfc\\x11\\xa5\\x21\\xc3\\xca\\x34\\xd7\\xbe\\xbb\\xd1\\x86\\x21\\x1c\\x52\\x61\\x77\\x8e\\x75\\xe6\\xa8\\xbf\\x06\\x5c\\xaa\\x37\\x06\\x2d\\x00\\x53\\x00\\x33\\x26\\xcd\\x93\\x05\\x70\\x45\\x2b\\xe9\\x6a\\x52\\x8d\\xbc\\x42\\x49\\x2a\\xdf\\x1a\\x08\\x49\\x6d\\xba\\xce\\x63\\xf2\\xf1\\xee\\x7e\\x64\\xe4\\xa2\\x49\\x58\\x67\\xcb\\x68\\x95\\x73\\x6d\\x2f\\x59\\xe6\\x69\\x60\\x6e\\xd0\\x52\\x9a\\x12\\x5b\\x27\\x2d\\x1a\\x5a\\xd5\\x0c\\xb9\\x56\\xf0\\xf8\\xa2\\x72\\xd5\\xa1\\x4a\\x6a\\xd2\\xd1\\x14\\xcb\\xd8\\x58\\x85\\x4b\\xc3\\x08\\xea\\x49\\xc9\\xc6\\x1c\\x3f\\xa0\\x6a\\x85\\x42\\xe9\\x29\\x23\\x19\\x43\\xcd\\x75\\x08\\x63\\x85\\xb8\\xc2\\x89\\xd6\\x5c\\xad\\xaf\\x68\\x63\\x4b\\x4d\\x6b\\x3e\\x28\\x35\\x3c\\x53\\x90\\x19\\x85\\xc9\\x35\\x60\\xa2\\x2c\\x04\\x48\\xc2\\x96\\x44\\x03\\x16\\x03\\x91\\x1c\\xcc\\x4e\\x01\\x42\\xd1\\xe6\\xdb\\x8d\\x0b\\x7a\\x90\\x63\\xf2\\xa7\\x52\\x0d\\x51\\x28\\x1d\\x3b\\xea\\xc8\\x9a\\xb2\\x67\\x6a\\x62\\x96\\xe6\\x69\\xcc\\x68\\x38\\xf1\\x60\\xa3\\x88\\x37\\xc6\\x9d\\x1a\\x2f\\xbd\\xc4\\xe0\\x9b\\x4b\\x84\\xce\\xb6\\x6c\\x62\\x7e\\x98\\xdf\\x6d\\x04\\xdb\\x83\\xad\\xdd\\x30\\x09\\x24\\x8f\\x0d\\x08\\x3d\\x04\\x94\\xbb\\x95\\x7e\\x05\\x88\\x31\\x92\\x82\\xe2\\xd9\\xef\\x36\\xf9\\xe9\\x17\\x06\\x66\\xab\\x2c\\x9b\\x91\\x67\\x15\\xf6\\x0d\\x5a\\xe1\\xd7\\x4d\\x1a\\x37\\x94\\x79\\x01\\x12\\xbd\\x08\\xaf\\x50\\x3f\\x62\\x7f\\xaa\\x5a\\x7a\\x0e\\x42\\x7d\\x1e\\xcf\\x5e\\xab\\x4a\\x13\\xc9\\x17\\xb1\\xd2\\x90\\xb1\\x8a\\xfa\\xf5\\x82\\x64\\xbf\\x4d\\xaf\\xaf\\xdc\\x7e\\x17\\xb3\\xbd\\xd7\\x88\\x7d\\x8b\\xca\\xe6\\xfb\\xdf\\xa5\\xb9\\xa9\\xfd\\x52\\x3c\\xef\\x2a\\x73\\xf1\\xbe\\x15\\x64\\x1a\\x09\\x2d\\x22\\x2a\\x83\\x45\\xb3\\xe2\\x20\\x58\\xbc\\x01\\xa3\\xed\\xc4\\xa8\\x5b\\x22\\x3c\\xd5\\xb0\\x8b\\x2d\\xf5\\x52\\x52\\x6e\\x76\\xbf\\x85\\x75\\x59\\x37\\xcd\\x83\\x00\\x84\\xf8\\x6a\\xdf\\x76\\x14\\x5e\\x9e\\x5b\\xa7\\x55\\x7c\\x35\\xdf\\x77\\xde\\x1e\\xff\\x79\\x27\\x7f\\x3d\\x52\\x0b\\xee\\x7b\\xac\\xdd\\xbc\\xad\\xb1\\x2f\\x90\\xc5\\xfc\\x85\\xf8\\xbf\\x22\\xba\\x6b\\x48\\x51\\xa6\\x27\\x8c\\x91\\xe5\\xab\\xdc\\x4c\\xbf\\xac\\xcd\\x3b\\x0c\\x79\\x2f\\xba\\x06\\xcd\\x41\\x3e\\xb7\\x25\\x1f\\x15\\xde\\x01\\xd1\\x30\\xa5\\xe4\\x69\\x9c\\xa7\\xf8\\xde\\xb6\\x43\\x1d\\xa7\\xcf\\xe0\\xb6\\xdb\\x92\\xe3\\xb8\\xce\\x5f\\xc7\\xb5\\x41\\xf5\\x06\\x29\\xcf\\x2d\\x71\\x2f\\xb1\\x9d\\x8e\\x3b\\x76\\xb8\\x35\\x0b\\x6b\\x43\\x31\\xe7\\x71\\xed\\x51\\x00\\xaf\\xed\\x67\\x38\\x45\\xb7\\x8c\\xd7\\x89\\x14\\xd4\\x9c\\xb8\\xd1\\xd1\\x53\\x79\\xba\\x42\\xe0\\x9e\\x86\\x25\\x26\\xd6\\xbc\\xd2\\x2d\\xa7\\x99\\x2d\\x97\\x89\\xc5\\xa7\\xa6\\xfa\\x2c\\xa5\\x39\\xa1\\x4d\\x6b\\xdd\\x47\\x65\\x0c\\xfa\\x30\\xbb\\x33\\x36\\x75\\x0b\\xee\\x60\\x45\\x27\\x68\\x9c\\x3e\\x2b\\x97\\x2a\\x45\\x62\\x79\\x63\\x6f\\xe2\\x08\\xe9\\x26\\xde\\xe3\\x1a\\xdd\\xfc\\xf3\\xf2\\xfb\\x85\\x94\\xd9\\x8d\\x81\\xc9\\x03\\x72\\x10\\x24\\x97\\x42\\xd5\\x37\\xb6\\xc9\\x3e\\x46\\x77\\xad\\xc5\\xe2\\x8d\\x37\\x08\\xa8\\x1f\\x76\\x1e\\x57\\xdf\\xee\\xaa\\x61\\x78\\x3e\\xc1\\x5a\\x77\\x5f\\xf1\\x36\\x94\\x3b\\x56\\x7e\\xf1\\x2d\\x6f\\x58\\xfb\\x7c\\x37\\xaa\\x1d\\x4e\\xba\\x8f\\xed\\x7f\\x1a\\xfc\\x60\\xcf\\x7d\\xb0\\x53\\x0e\\x1e\\x33\\xc6\\x25\\xf9\\x4c\\x92\\x11\\xaa\\xf0\\x6f\\x00\\x00\\x00\\xff\\xff\\x3a\\xb5\\x30\\x94\\x78\\x14\\x00\\x00\")\n\nfunc uiTsTypingsMithriljsMithrilDTsBytes() ([]byte, error) {\n return bindataRead(\n _uiTsTypingsMithriljsMithrilDTs,\n \"ui/ts/typings/mithriljs/mithril.d.ts\",\n )\n}\n\nfunc uiTsTypingsMithriljsMithrilDTs() (*asset, error) {\n bytes, err := uiTsTypingsMithriljsMithrilDTsBytes()\n if err != nil {\n return nil, err\n }\n\n info := bindataFileInfo{name: \"ui/ts/typings/mithriljs/mithril.d.ts\", size: 5240, mode: os.FileMode(420), modTime: time.Unix(1400000000, 0)}\n a := &asset{bytes: bytes, info: info}\n return a, nil\n}\n\n// Asset loads and returns the asset for the given name.\n// It returns an error if the asset could not be found or\n// could not be loaded.\nfunc Asset(name string) ([]byte, error) {\n cannonicalName := strings.Replace(name, \"\\\\\", \"/\", -1)\n if f, ok := _bindata[cannonicalName]; ok {\n a, err := f()\n if err != nil {\n return nil, fmt.Errorf(\"Asset %s can't read by error: %v\", name, err)\n }\n return a.bytes, nil\n }\n return nil, fmt.Errorf(\"Asset %s not found\", name)\n}\n\n// MustAsset is like Asset but panics when Asset would return an error.\n// It simplifies safe initialization of global variables.\nfunc MustAsset(name string) []byte {\n a, err := Asset(name)\n if err != nil {\n panic(\"asset: Asset(\" + name + \"): \" + err.Error())\n }\n\n return a\n}\n\n// AssetInfo loads and returns the asset info for the given name.\n// It returns an error if the asset could not be found or\n// could not be loaded.\nfunc AssetInfo(name string) (os.FileInfo, error) {\n cannonicalName := strings.Replace(name, \"\\\\\", \"/\", -1)\n if f, ok := _bindata[cannonicalName]; ok {\n a, err := f()\n if err != nil {\n return nil, fmt.Errorf(\"AssetInfo %s can't read by error: %v\", name, err)\n }\n return a.info, nil\n }\n return nil, fmt.Errorf(\"AssetInfo %s not found\", name)\n}\n\n// AssetNames returns the names of the assets.\nfunc AssetNames() []string {\n names := make([]string, 0, len(_bindata))\n for name := range _bindata {\n names = append(names, name)\n }\n return names\n}\n\n// _bindata is a table, holding each asset generator, mapped to its name.\nvar _bindata = map[string]func() (*asset, error){\n \"ui/css/app.css\": uiCssAppCss,\n \"ui/css/graph.css\": uiCssGraphCss,\n \"ui/css/libs/nvd3/1.7.1/nv.d3.min.css\": uiCssLibsNvd3171NvD3MinCss,\n \"ui/css/rest_explorer.css\": uiCssRest_explorerCss,\n \"ui/index.html\": uiIndexHtml,\n \"ui/js/app.js\": uiJsAppJs,\n \"ui/js/libs/d3/3.3.5/d3.min.js\": uiJsLibsD3335D3MinJs,\n \"ui/js/libs/mithriljs/0.2.0/mithril.min.js\": uiJsLibsMithriljs020MithrilMinJs,\n \"ui/js/libs/mithriljs/0.2.0/mithril.min.js.map\": uiJsLibsMithriljs020MithrilMinJsMap,\n \"ui/js/libs/nvd3/1.7.1/nv.d3.min.js\": uiJsLibsNvd3171NvD3MinJs,\n \"ui/ts/app.ts\": uiTsAppTs,\n \"ui/ts/components/metrics.ts\": uiTsComponentsMetricsTs,\n \"ui/ts/header.ts\": uiTsHeaderTs,\n \"ui/ts/models/node_status.ts\": uiTsModelsNode_statusTs,\n \"ui/ts/models/stats.ts\": uiTsModelsStatsTs,\n \"ui/ts/models/store_status.ts\": uiTsModelsStore_statusTs,\n \"ui/ts/models/timeseries.ts\": uiTsModelsTimeseriesTs,\n \"ui/ts/pages/graph.ts\": uiTsPagesGraphTs,\n \"ui/ts/pages/monitor.ts\": uiTsPagesMonitorTs,\n \"ui/ts/pages/nodes.ts\": uiTsPagesNodesTs,\n \"ui/ts/pages/rest_explorer.ts\": uiTsPagesRest_explorerTs,\n \"ui/ts/pages/stores.ts\": uiTsPagesStoresTs,\n \"ui/ts/tsconfig.json\": uiTsTsconfigJson,\n \"ui/ts/typings/d3/d3.d.ts\": uiTsTypingsD3D3DTs,\n \"ui/ts/typings/jquery/jquery.d.ts\": uiTsTypingsJqueryJqueryDTs,\n \"ui/ts/typings/mithriljs/mithril.d.ts\": uiTsTypingsMithriljsMithrilDTs,\n}\n\n// AssetDir returns the file names below a certain\n// directory embedded in the file by go-bindata.\n// For example if you run go-bindata on data/... and data contains the\n// following hierarchy:\n// data/\n// foo.txt\n// img/\n// a.png\n// b.png\n// then AssetDir(\"data\") would return []string{\"foo.txt\", \"img\"}\n// AssetDir(\"data/img\") would return []string{\"a.png\", \"b.png\"}\n// AssetDir(\"foo.txt\") and AssetDir(\"notexist\") would return an error\n// AssetDir(\"\") will return []string{\"data\"}.\nfunc AssetDir(name string) ([]string, error) {\n node := _bintree\n if len(name) != 0 {\n cannonicalName := strings.Replace(name, \"\\\\\", \"/\", -1)\n pathList := strings.Split(cannonicalName, \"/\")\n for _, p := range pathList {\n node = node.Children[p]\n if node == nil {\n return nil, fmt.Errorf(\"Asset %s not found\", name)\n }\n }\n }\n if node.Func != nil {\n return nil, fmt.Errorf(\"Asset %s not found\", name)\n }\n rv := make([]string, 0, len(node.Children))\n for childName := range node.Children {\n rv = append(rv, childName)\n }\n return rv, nil\n}\n\ntype bintree struct {\n Func func() (*asset, error)\n Children map[string]*bintree\n}\n\nvar _bintree = &bintree{nil, map[string]*bintree{\n \"ui\": {nil, map[string]*bintree{\n \"css\": {nil, map[string]*bintree{\n \"app.css\": {uiCssAppCss, map[string]*bintree{}},\n \"graph.css\": {uiCssGraphCss, map[string]*bintree{}},\n \"libs\": {nil, map[string]*bintree{\n \"nvd3\": {nil, map[string]*bintree{\n \"1.7.1\": {nil, map[string]*bintree{\n \"nv.d3.min.css\": {uiCssLibsNvd3171NvD3MinCss, map[string]*bintree{}},\n }},\n }},\n }},\n \"rest_explorer.css\": {uiCssRest_explorerCss, map[string]*bintree{}},\n }},\n \"index.html\": {uiIndexHtml, map[string]*bintree{}},\n \"js\": {nil, map[string]*bintree{\n \"app.js\": {uiJsAppJs, map[string]*bintree{}},\n \"libs\": {nil, map[string]*bintree{\n \"d3\": {nil, map[string]*bintree{\n \"3.3.5\": {nil, map[string]*bintree{\n \"d3.min.js\": {uiJsLibsD3335D3MinJs, map[string]*bintree{}},\n }},\n }},\n \"mithriljs\": {nil, map[string]*bintree{\n \"0.2.0\": {nil, map[string]*bintree{\n \"mithril.min.js\": {uiJsLibsMithriljs020MithrilMinJs, map[string]*bintree{}},\n \"mithril.min.js.map\": {uiJsLibsMithriljs020MithrilMinJsMap, map[string]*bintree{}},\n }},\n }},\n \"nvd3\": {nil, map[string]*bintree{\n \"1.7.1\": {nil, map[string]*bintree{\n \"nv.d3.min.js\": {uiJsLibsNvd3171NvD3MinJs, map[string]*bintree{}},\n }},\n }},\n }},\n }},\n \"ts\": {nil, map[string]*bintree{\n \"app.ts\": {uiTsAppTs, map[string]*bintree{}},\n \"components\": {nil, map[string]*bintree{\n \"metrics.ts\": {uiTsComponentsMetricsTs, map[string]*bintree{}},\n }},\n \"header.ts\": {uiTsHeaderTs, map[string]*bintree{}},\n \"models\": {nil, map[string]*bintree{\n \"node_status.ts\": {uiTsModelsNode_statusTs, map[string]*bintree{}},\n \"stats.ts\": {uiTsModelsStatsTs, map[string]*bintree{}},\n \"store_status.ts\": {uiTsModelsStore_statusTs, map[string]*bintree{}},\n \"timeseries.ts\": {uiTsModelsTimeseriesTs, map[string]*bintree{}},\n }},\n \"pages\": {nil, map[string]*bintree{\n \"graph.ts\": {uiTsPagesGraphTs, map[string]*bintree{}},\n \"monitor.ts\": {uiTsPagesMonitorTs, map[string]*bintree{}},\n \"nodes.ts\": {uiTsPagesNodesTs, map[string]*bintree{}},\n \"rest_explorer.ts\": {uiTsPagesRest_explorerTs, map[string]*bintree{}},\n \"stores.ts\": {uiTsPagesStoresTs, map[string]*bintree{}},\n }},\n \"tsconfig.json\": {uiTsTsconfigJson, map[string]*bintree{}},\n \"typings\": {nil, map[string]*bintree{\n \"d3\": {nil, map[string]*bintree{\n \"d3.d.ts\": {uiTsTypingsD3D3DTs, map[string]*bintree{}},\n }},\n \"jquery\": {nil, map[string]*bintree{\n \"jquery.d.ts\": {uiTsTypingsJqueryJqueryDTs, map[string]*bintree{}},\n }},\n \"mithriljs\": {nil, map[string]*bintree{\n \"mithril.d.ts\": {uiTsTypingsMithriljsMithrilDTs, map[string]*bintree{}},\n }},\n }},\n }},\n }},\n}}\n\n// RestoreAsset restores an asset under the given directory\nfunc RestoreAsset(dir, name string) error {\n data, err := Asset(name)\n if err != nil {\n return err\n }\n info, err := AssetInfo(name)\n if err != nil {\n return err\n }\n err = os.MkdirAll(_filePath(dir, path.Dir(name)), os.FileMode(0755))\n if err != nil {\n return err\n }\n err = ioutil.WriteFile(_filePath(dir, name), data, info.Mode())\n if err != nil {\n return err\n }\n err = os.Chtimes(_filePath(dir, name), info.ModTime(), info.ModTime())\n if err != nil {\n return err\n }\n return nil\n}\n\n// RestoreAssets restores an asset under the given directory recursively\nfunc RestoreAssets(dir, name string) error {\n children, err := AssetDir(name)\n // File\n if err != nil {\n return RestoreAsset(dir, name)\n }\n // Dir\n for _, child := range children {\n err = RestoreAssets(dir, path.Join(name, child))\n if err != nil {\n return err\n }\n }\n return nil\n}\n\nfunc _filePath(dir, name string) string {\n cannonicalName := strings.Replace(name, \"\\\\\", \"/\", -1)\n return filepath.Join(append([]string{dir}, strings.Split(cannonicalName, \"/\")...)...)\n}\n" }, { "path": "src/test/resources/samples/langs/Go/gen-go-linguist-thrift.go", "content": "// Autogenerated by Thrift Compiler (1.0.0-dev)\n// DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n\npackage linguist\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"git.apache.org/thrift.git/lib/go/thrift\"\n)\n\n// (needed to ensure safety because of naive import list construction.)\nvar _ = thrift.ZERO\nvar _ = fmt.Printf\nvar _ = bytes.Equal\n\nfunc init() {\n}\n" }, { "path": "src/test/resources/samples/langs/Golo/adapters.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule samples.Adapters\n\nlocal function list_sample = |fabric| {\n println(\">>> list_sample()\")\n let carbonCopy = list[]\n let conf = map[\n [\"extends\", \"java.util.ArrayList\"],\n [\"overrides\", map[\n [\"*\", |super, name, args| {\n if name == \"add\" {\n if args: length() == 2 {\n carbonCopy: add(args: get(1))\n } else {\n carbonCopy: add(args: get(1), args: get(2))\n }\n }\n return super: invokeWithArguments(args)\n }\n ]]\n ]]\n let list = fabric: maker(conf): newInstance()\n list: add(\"bar\")\n list: add(0, \"foo\")\n list: add(\"baz\")\n println(\" list: \" + list + \" \" + list: getClass())\n println(\"carbonCopy: \" + carbonCopy + \" \" + carbonCopy: getClass())\n}\n\nlocal function runnable_sample = |fabric| {\n println(\">>> runnable_sample\")\n let result = array[1, 2, 3]\n let conf = map[\n [\"interfaces\", [\"java.io.Serializable\", \"java.lang.Runnable\"]],\n [\"implements\", map[\n [\"run\", |this| {\n for (var i = 0, i < result: length(), i = i + 1) {\n result: set(i, result: get(i) + 10)\n }\n }]\n ]]\n ]\n let runner = fabric: maker(conf): newInstance()\n runner: run()\n println(\" result: \" + result: toString())\n println(\"serializable? \" + (runner oftype java.io.Serializable.class))\n println(\" runnable? \" + (runner oftype java.lang.Runnable.class))\n}\n\nfunction main = |args| {\n let fabric = AdapterFabric()\n list_sample(fabric)\n runnable_sample(fabric)\n}\n" }, { "path": "src/test/resources/samples/langs/Golo/async.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule samples.AsyncHelpers\n\nimport gololang.Async\nimport java.util.concurrent.TimeUnit\nimport java.util.concurrent.Executors\n\nlocal function fib = |n| {\n if n <= 1 {\n return n\n } else {\n return fib(n - 1) + fib(n - 2)\n }\n}\n\nfunction main = |args| {\n\n let executor = newCachedThreadPool()\n println(\"Let's do some useless asynchronous operations...\")\n\n var f = executor: enqueue({\n Thread.sleep(1000_L)\n return 666\n })\n f:\n onSet(|v| -> println(\">>> #slow -> \" + v)): \n onFail(|e| -> println(\">>> #fail -> \" + e))\n f:\n cancel(true)\n\n f = executor: enqueue({\n Thread.sleep(1000_L)\n return 666\n })\n f:\n onSet(|v| -> println(\">>> #ok -> \" + v)): \n onFail(|e| -> println(\">>> #wtf? -> \" + e))\n\n let fib_10 = promise()\n let fib_20 = promise()\n let fib_30 = promise()\n let fib_40 = promise()\n\n let futures = [\n fib_10: future(), fib_20: future(), \n fib_30: future(), fib_40: future()\n ]\n\n executor: submit(-> fib_10: set(fib(10)))\n executor: submit(-> fib_20: set(fib(20)))\n executor: submit(-> fib_30: set(fib(30)))\n executor: submit(-> fib_40: set(fib(40)))\n\n all(futures): onSet(|results| -> println(\">>> Fibs: \" + results))\n\n let truth = promise()\n truth: \n future(): \n map(|v| -> \"truth=\" + v): \n onSet(|v| -> executor: submit(-> println(\">>> (another thread) \" + v))):\n onSet(|v| -> println(\">>> (same thread) \" + v))\n executor: submit({\n Thread.sleep(500_L)\n truth: set(42)\n })\n \n Thread.sleep(1000_L)\n executor: shutdown()\n executor: awaitTermination(2_L, SECONDS())\n println(\"Bye!\")\n}\n" }, { "path": "src/test/resources/samples/langs/Golo/augmentations.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule samples.Augmentations\n\nimport java.util.LinkedList\n\naugment java.util.List {\n function with = |this, value| {\n this: add(value)\n return this\n }\n}\n\naugment java.util.Collection {\n function doToEach = |this, func| {\n foreach (element in this) {\n func(element)\n }\n }\n}\n\nfunction main = |args| {\n let list = LinkedList(): with(\"foo\"): with(\"bar\"): with(\"baz\")\n list: doToEach(|value| -> println(\">>> \" + value))\n}\n" }, { "path": "src/test/resources/samples/langs/Golo/closures.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule Closures\n\nlocal function sayHello = |who| -> \"Hello \" + who + \"!\"\n\nfunction main = |args| {\n let adder = |a, b| -> a + b\n println(adder: invokeWithArguments(1, 2))\n println(adder(1, 2))\n\n let addToTen = adder: bindTo(10)\n println(addToTen: invokeWithArguments(2))\n println(addToTen(2))\n\n let adding = |x| -> |y| -> adder(x, y)\n let addingTen = adding(10)\n println(addingTen(4))\n println(adding(2)(4))\n\n println(sayHello(\"Julien\"))\n\n let list = java.util.LinkedList()\n let pump_it = {\n list: add(\"I heard you say\")\n list: add(\"Hey!\")\n list: add(\"Hey!\")\n }\n pump_it()\n println(list)\n}\n" }, { "path": "src/test/resources/samples/langs/Golo/coin-change.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule CoinChange\n\nimport java.util.LinkedList\n\nfunction change = |money, coins| -> match {\n when money == 0 then 1\n when (money < 0) or (coins: isEmpty()) then 0\n otherwise change(money - coins: head(), coins) + change(money, coins: tail())\n}\n\nfunction main = |args| {\n let coins = LinkedList(): append(1, 2, 5, 10, 20)\n println(\"Coins: \" + coins)\n println(\"0: \" + change(0, coins))\n println(\"1: \" + change(1, coins))\n println(\"2: \" + change(2, coins))\n println(\"10: \" + change(10, coins))\n println(\"12: \" + change(12, coins))\n println(\"6: \" + change(6, coins))\n}\n" }, { "path": "src/test/resources/samples/langs/Golo/collection-literals.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule samples.CollectionLiterals\n\nlocal function play_with_tuples = {\n let hello = [\"Hello\", \"world\", \"!\"]\n foreach str in hello {\n print(str + \" \")\n }\n println(\"\")\n\n println(hello: get(0) + \"-\" + hello: get(1) + \"-\" + hello: get(2))\n\n println(hello: join(\"/\"))\n}\n\nlocal function play_with_literals = {\n let data = [\n [1, 2, 3],\n tuple[1, 2, 3],\n array[1, 2, 3],\n set[1, 2, 3, 3, 1],\n map[\n [\"a\", 10],\n [\"b\", 20]\n ],\n vector[1, 2, 3],\n list[1, 2, 3]\n ]\n\n data: each(|element| {\n println(element: toString())\n println(\" type: \" + element: getClass())\n })\n}\n\nfunction main = |args| {\n println(\">>> Literals\")\n play_with_literals()\n println(\"\\n>>> Tuples\")\n play_with_tuples()\n}\n\n" }, { "path": "src/test/resources/samples/langs/Golo/context-decorator.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule samples.ContextDecorator\n\nimport gololang.Decorators\n\nlet myContext = defaultContext():\n count(0):\n define(\"entry\", |this, args| {\n this: count(this: count() + 1)\n println(\"hello:\" + this: count())\n return args\n }):\n define(\"exit\", |this, result| {\n require(result >= 3, \"wrong value\")\n println(\"goobye\")\n return result\n }):\n define(\"catcher\", |this, e| {\n println(\"Caught \" + e)\n throw e\n }):\n define(\"finallizer\", |this| {println(\"do some cleanup\")})\n\n\n@withContext(myContext)\nfunction foo = |a, b| {\n println(\"Hard computation\")\n return a + b\n}\n\nfunction main = |args| {\n println(foo(1,2))\n println(\"====\")\n println(withContext(myContext)(|a| -> 2*a)(3))\n println(\"====\")\n try {\n println(foo(1, 1))\n } catch (e) { }\n}\n\n" }, { "path": "src/test/resources/samples/langs/Golo/decorators.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule samples.Decorators\n\nimport java.util.LinkedList\n\nfunction simple_decorator = |func| {\n return |a,b| -> func(a+1,b+1)\n}\n\n@simple_decorator\nfunction simple_adder = |x,y| -> x + y\n\nfunction decorator_with_params = |param1, param2|{\n return |func| {\n return |a,b| -> func(a+param1,b+param2)\n }\n}\n\n@decorator_with_params(10,2)\nfunction parametrized_adder = |x,y| -> x + y\n\nfunction generic_decorator = |func| {\n return |args...| {\n println(\"number of params : \"+args: length())\n return func: invokeWithArguments(args)\n }\n}\n\n@generic_decorator\nfunction generic_adder0 = -> 42\n\n@generic_decorator\nfunction generic_adder1 = |x| -> x\n\n@generic_decorator\nfunction generic_adder2 = |x,y| -> x + y\n\n@generic_decorator\nfunction generic_adder3 = |x,y,z| -> x + y + z\n\nfunction list_sum_decorator = |func| {\n return |this| -> func(this) - 8\n}\n\naugment java.util.List {\n\n @list_sum_decorator\n function sum = |this| {\n var acc = 0\n foreach elem in this {\n acc = acc + elem\n }\n return acc\n }\n}\n\nfunction main = |args| {\n println(simple_adder(10,30))\n println(parametrized_adder(10,20))\n println(generic_adder0())\n println(generic_adder1(42))\n println(generic_adder2(20,22))\n println(generic_adder3(10,12,20))\n let list = LinkedList()\n list: add(5)\n list: add(10)\n list: add(15)\n list: add(20)\n println(list: sum())\n}" }, { "path": "src/test/resources/samples/langs/Golo/dynamic-evaluation.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule samples.DynamicEvaluation\n\nimport gololang.EvaluationEnvironment\n\nlocal function test_asModule = |env| {\n let code =\n\"\"\"\nmodule foo\n\nfunction a = -> \"a!\"\nfunction b = -> \"b!\"\n\"\"\"\n let mod = env: asModule(code)\n let a = fun(\"a\", mod)\n let b = fun(\"b\", mod)\n println(\">>> asModule()\")\n println(a())\n println(b())\n}\n\nlocal function test_anonymousModule = |env| {\n let code =\n\"\"\"\nfunction a = -> \"a.\"\nfunction b = -> \"b.\"\n\"\"\"\n let mod = env: anonymousModule(code)\n let a = fun(\"a\", mod)\n let b = fun(\"b\", mod)\n println(\">>> anonymousModule()\")\n println(a())\n println(b())\n}\n\nlocal function test_asFunction = |env| {\n let code = \"return (a + b) * 2\"\n let f = env: asFunction(code, \"a\", \"b\")\n println(\">>> asFunction\")\n println(f(10, 20))\n}\n\nlocal function test_def = |env| {\n let code = \"|a, b| -> (a + b) * 2\"\n let f = env: def(code)\n println(\">>> def\")\n println(f(10, 20))\n}\n\nlocal function test_run = |env| {\n let code = \"\"\"println(\">>> run\")\n foreach (i in range(0, 3)) {\n println(\"w00t\")\n }\"\"\"\n env: run(code)\n}\n\nlocal function test_run_map = |env| {\n let code = \"\"\"println(\">>> run_map\")\n println(a)\n println(b)\n \"\"\"\n let values = java.util.TreeMap(): add(\"a\", 1): add(\"b\", 2)\n env: run(code, values)\n}\n\nfunction main = |args| {\n let env = EvaluationEnvironment()\n test_asModule(env)\n test_anonymousModule(env)\n test_asFunction(env)\n test_def(env)\n test_run(env)\n test_run_map(env)\n}\n" }, { "path": "src/test/resources/samples/langs/Golo/dynamic-object-person.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule samples.DynamicObjectPerson\n\nlocal function mrbean = -> DynamicObject():\n name(\"Mr Bean\"):\n email(\"mrbean@gmail.com\"):\n define(\"toString\", |this| -> this: name() + \" <\" + this: email() + \">\")\n\nfunction main = |args| {\n\n let bean = mrbean()\n println(bean: toString())\n\n bean: email(\"mrbean@outlook.com\")\n println(bean: toString())\n}\n" }, { "path": "src/test/resources/samples/langs/Golo/echo-args.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule EchoArgs\n\nfunction main = |args| {\n \n println(\"With a for loop and an index:\")\n for (var i = 0, i < args: length(), i = i + 1) {\n println(\" #\" + i + \" -> \" + args: get(i))\n }\n\n println(\"With a foreach loop:\")\n foreach arg in args {\n println(\" \" + arg)\n }\n\n println(\"With a foreach over a range:\")\n foreach i in range(0, args: length()) {\n println(\" #\" + i + \" -> \" + args: get(i))\n }\n}\n\n" }, { "path": "src/test/resources/samples/langs/Golo/enums-thread-state.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule sample.EnumsThreadState\n\nimport java.lang.Thread$State\n\nfunction main = |args| {\n\n # Call the enum entry like a function\n let new = Thread$State.NEW()\n println(\"name=\" + new: name() + \", ordinal=\" + new: ordinal())\n println(\"-----------\")\n\n # Walk through all enum entries\n foreach element in Thread$State.values() {\n println(\"name=\" + element: name() + \", ordinal=\" + element: ordinal())\n }\n}\n\n" }, { "path": "src/test/resources/samples/langs/Golo/fibonacci.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule samples.Fibonacci\n\nimport java.lang.System\n\nfunction fib = |n| {\n if n <= 1 {\n return n\n } else {\n return fib(n - 1) + fib(n - 2)\n }\n}\n\nlocal function run = {\n let start = System.currentTimeMillis()\n let result = fib(40)\n let duration = System.currentTimeMillis() - start\n println(\">>> \" + result + \" (took \" + duration + \"ms)\")\n}\n\nfunction main = |args| {\n while true {\n run()\n }\n}\n\n" }, { "path": "src/test/resources/samples/langs/Golo/helloworld.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule hello.World\n\nfunction main = |args| {\n println(\"Hello world!\")\n}\n\n" }, { "path": "src/test/resources/samples/langs/Golo/http-server.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule samples.WebServer\n\nimport java.lang\nimport java.net.InetSocketAddress\nimport com.sun.net.httpserver\nimport com.sun.net.httpserver.HttpServer\n\nfunction main = |args| {\n\n let server = HttpServer.create(InetSocketAddress(\"localhost\", 8081), 0)\n \n server: createContext(\"/\", |exchange| {\n let headers = exchange: getResponseHeaders()\n let response = StringBuilder():\n append(\"Requested URI: \"):\n append(exchange: getRequestURI()):\n append(\"\\n\"):\n append(\"Current time: \"):\n append(java.util.Date()):\n append(\"\\n\"):\n toString()\n headers: set(\"Content-Type\", \"text/plain\")\n exchange: sendResponseHeaders(200, response: length())\n exchange: getResponseBody(): write(response: getBytes())\n exchange: close()\n })\n\n server: createContext(\"/shutdown\", |exchange| {\n let response = \"Ok, thanks, bye!\"\n exchange: getResponseHeaders(): set(\"Content-Type\", \"text/plain\")\n exchange: sendResponseHeaders(200, response: length())\n exchange: getResponseBody(): write(response: getBytes())\n exchange: close()\n server: stop(5)\n })\n\n server: start()\n println(\">>> http://localhost:8081/\")\n}\n" }, { "path": "src/test/resources/samples/langs/Golo/logdeco.golo", "content": "\nmodule samples.LogDeco\n\nfunction log1 = |msg| {\n return |fun| {\n return |args...| {\n println(msg)\n return fun: invokeWithArguments(args)\n }\n }\n}\n\n@log1(\"calling foo\")\nfunction foo = |a| {\n println(\"foo got a \" + a)\n}\n\n@log1(\"I'am a bar\")\nfunction bar = |a| -> 2*a\n\nlet sayHello = log1(\"Hello\")\n\n@sayHello\nfunction baz = -> \"Goodbye\"\n\nfunction log2 = |msgBefore| -> |msgAfter| -> |func| -> |args...| {\n println(msgBefore)\n let res = func: invokeWithArguments(args)\n println(msgAfter)\n return res\n}\n\n@log2(\"enter foo\")(\"exit foo\")\nfunction spam = |a| {\n println(\"foo: \" + a)\n}\n\nfunction logEnterExit = |name| -> log2(\"# enter \" + name)(\"# exit \" + name)\n\n@logEnterExit(\"bar\")\nfunction egg = { println(\"doing something...\") }\n\nfunction main = |args| {\n\n foo(\"bar\")\n \n println(\"---\")\n println(bar(21))\n \n println(\"---\")\n println(baz())\n\n println(\"---\")\n spam(\"bar\")\n\n println(\"---\")\n egg()\n\n println(\"---\")\n let strange_use = log2(\"hello\")(\"goodbye\")({println(\":p\")})\n strange_use()\n\n println(\"---\")\n log2(\"another\")(\"use\")(|a|{println(a)})(\"strange\")\n}\n" }, { "path": "src/test/resources/samples/langs/Golo/matching-operator.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule Matching\n\nimport java.util.LinkedList\n\nlocal function data = {\n let list = LinkedList()\n list: add(\"foo@bar.com\")\n list: add(\"+33.6.11.22.33\")\n list: add(\"http://golo-lang.org/\")\n list: add(\"def foo = bar(_._) with :> T\")\n return list\n}\n\nlocal function what_it_could_be = |item| -> match {\n when item: contains(\"@\") then \"an email?\"\n when item: startsWith(\"+33\") then \"a French phone number?\"\n when item: startsWith(\"http://\") then \"a website URL?\"\n otherwise \"I have no clue, mate!\"\n}\n\nfunction main = |args| {\n foreach item in data() {\n println(item + \" => \" + what_it_could_be(item))\n }\n}\n\n" }, { "path": "src/test/resources/samples/langs/Golo/max-int.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule samples.MaxInt\n\nlocal function max_int = {\n return java.lang.Integer.MAX_VALUE()\n}\n\nfunction main = |args| {\n println(max_int())\n}\n\n" }, { "path": "src/test/resources/samples/langs/Golo/memoize.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule samples.MemoizeDecorator\n\nimport gololang.Decorators\n\nimport java.lang.System\n\nlet memo = memoizer()\n\n@memo\nfunction fib = |n| {\n if n <= 1 {\n return n\n } else {\n return fib(n - 1) + fib(n - 2)\n }\n}\n\n@memo\nfunction foo = |n| -> n\n\nlocal function run = {\n let start = System.currentTimeMillis()\n let result = fib(40)\n let duration = System.currentTimeMillis() - start\n println(\">>> fib(40) = \" + result + \" (took \" + duration + \"ms)\")\n}\n\nlocal function run2 = {\n let start = System.currentTimeMillis()\n let result = foo(40)\n let duration = System.currentTimeMillis() - start\n println(\">>> foo(40) = \" + result + \" (took \" + duration + \"ms)\")\n}\n\nfunction main = |args| {\n foreach i in range(0, 5) {\n println(\"run \" + i)\n run()\n run2()\n }\n}\n" }, { "path": "src/test/resources/samples/langs/Golo/null-safety.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule DealingWithNull\n\nimport java.util\n\nfunction main = |args| {\n\n # Data model\n let contacts = map[\n [\"mrbean\", map[\n [\"email\", \"bean@gmail.com\"],\n [\"url\", \"http://mrbean.com\"]\n ]],\n [\"larry\", map[\n [\"email\", \"larry@iamricherthanyou.com\"]\n ]]\n ]\n\n # MrBean and Larry\n let mrbean = contacts: get(\"mrbean\")\n let larry = contacts: get(\"larry\")\n \n # Illustrates orIfNull\n println(mrbean: get(\"url\") orIfNull \"n/a\")\n println(larry: get(\"url\") orIfNull \"n/a\")\n\n # Querying a non-existent data model because there is no 'address' entry\n println(mrbean: get(\"address\")?: street()?: number() orIfNull \"n/a\")\n}\n\n" }, { "path": "src/test/resources/samples/langs/Golo/prepost-decorators.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule samples.PrepostDecorator\n\nimport gololang.Decorators\n\nlet isInteger = isOfType(Integer.class)\n\n@checkResult(isString(): andThen(lengthIs(2)))\n@checkArguments(isInteger: andThen(isPositive()), isString())\nfunction foo = |a, b| {\n return b + a\n}\n\nlet myCheck = checkArguments(isInteger: andThen(isPositive()))\n\n@myCheck\nfunction inv = |v| -> 1.0 / v\n\nlet isPositiveInt = isInteger: andThen(isPositive())\n\n@checkArguments(isPositiveInt)\nfunction mul = |v| -> 10 * v\n\n@checkArguments(isNumber())\nfunction num = |v| -> \"ok\"\n\n@checkArguments(isNotNull())\nfunction notnull = |v| -> \"ok\"\n\nfunction main = |args| {\n try { println(foo(1, \"b\")) } catch (e) { println(e) }\n try { println(foo(-1, \"b\")) } catch (e) { println(e) }\n try { println(foo(\"a\", 2)) } catch (e) { println(e) }\n try { println(foo(1, 2)) } catch (e) { println(e) }\n try { println(foo(10, \"ab\")) } catch (e) { println(e) }\n\n try { println(inv(10)) } catch (e) { println(e) }\n try { println(inv(0)) } catch (e) { println(e) }\n\n try { println(mul(5)) } catch (e) { println(e) }\n try { println(mul(0)) } catch (e) { println(e) }\n\n try { println(num(1)) } catch (e) { println(e) }\n try { println(num(1_L)) } catch (e) { println(e) }\n try { println(num(1.5)) } catch (e) { println(e) }\n try { println(num(1.5_F)) } catch (e) { println(e) }\n try { println(num(\"a\")) } catch (e) { println(e) }\n try { println(num('a')) } catch (e) { println(e) }\n\n try { println(notnull('1')) } catch (e) { println(e) }\n try { println(notnull(null)) } catch (e) { println(e) }\n}\n" }, { "path": "src/test/resources/samples/langs/Golo/structs.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule StructDemo\n\nstruct Point = { x, y }\n\naugment StructDemo.types.Point {\n\n function move = |this, offsetX, offsetY| {\n this: x(this: x() + offsetX)\n this: y(this: y() + offsetY)\n return this\n }\n\n function relative = |this, offsetX, offsetY| -> Point(this: x() + offsetX, this: y() + offsetY)\n}\n\nfunction main = |args| {\n \n let p1 = Point(1, 2)\n let p2 = Point(): x(1): y(2)\n let p3 = p1: frozenCopy()\n let p4 = p1: frozenCopy()\n\n println(p1)\n println(\"x = \" + p1: x())\n println(\"y = \" + p1: y())\n\n println(\"p1 == p2 \" + (p1 == p2))\n println(\"p1 == p3 \" + (p1 == p3))\n println(\"p3 == p4 \" + (p3 == p4))\n\n println(\"#p1 \" + p1: hashCode())\n println(\"#p2 \" + p2: hashCode())\n println(\"#p3 \" + p3: hashCode())\n println(\"#p4 \" + p4: hashCode())\n\n println(\"p1: members() \" + p1: members())\n println(\"p1: values() \" + p1: values())\n foreach item in p1 {\n println(item: get(0) + \" -> \" + item: get(1))\n }\n\n println(\"p1: set(\\\"x\\\", 10) \" + p1: set(\"x\", 10))\n println(\"p1: move(10, 5) \" + p1: move(10, 5))\n println(\"p1: relative(11, 6) \" + p1: relative(11, 6))\n\n let p5 = ImmutablePoint(10, 20)\n println(\"p5: \" + p5)\n try {\n p5: x(100)\n } catch (expected) {\n println(\"p5 is immutable, so... \" + expected: getMessage())\n }\n}\n\n\n" }, { "path": "src/test/resources/samples/langs/Golo/swing-actionlistener.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule samples.SwingActionListener\n\nimport java.awt.event\nimport javax.swing\nimport javax.swing.WindowConstants\n\nlocal function listener = |handler| -> asInterfaceInstance(ActionListener.class, handler)\n\nfunction main = |args| {\n\n let frame = JFrame(\"Action listeners\")\n frame: setDefaultCloseOperation(EXIT_ON_CLOSE())\n\n let button = JButton(\"Click me!\")\n button: setFont(button: getFont(): deriveFont(96.0_F))\n\n # Using a helper function\n button: addActionListener(listener(|event| -> println(\"Clicked!\")))\n\n # Using a standard augmentation: MethodHandle::to(Class)\n button: addActionListener((|event| -> println(\"[click]\")): to(ActionListener.class))\n\n # Straight closure passing\n button: addActionListener(|event| -> println(\"( )\"))\n\n frame: getContentPane(): add(button)\n frame: pack()\n frame: setVisible(true)\n}\n" }, { "path": "src/test/resources/samples/langs/Golo/swing-helloworld.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule samples.SwingHelloWorld\n\nimport javax.swing\nimport javax.swing.WindowConstants\n\nfunction main = |args| {\n\n let frame = JFrame(\"Hello world\")\n frame: setDefaultCloseOperation(EXIT_ON_CLOSE())\n\n let label = JLabel(\"Hello world\")\n label: setFont(label: getFont(): deriveFont(128.0_F))\n\n frame: getContentPane(): add(label)\n frame: pack()\n frame: setVisible(true)\n}\n" }, { "path": "src/test/resources/samples/langs/Golo/templates-chat-webapp.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule samples.TemplatesChatWebapp\n\nimport java.lang\nimport java.io\nimport java.net.InetSocketAddress\nimport com.sun.net.httpserver\nimport com.sun.net.httpserver.HttpServer\n\nlocal function redirect = |exchange, to| {\n exchange: getResponseHeaders(): set(\"Location\", to)\n exchange: sendResponseHeaders(303, 0)\n exchange: close()\n}\n\nlocal function respond = |exchange, body| {\n exchange: getResponseHeaders(): set(\"Content-Type\", \"text/html\")\n exchange: sendResponseHeaders(200, body: length())\n exchange: getResponseBody(): write(body: getBytes())\n exchange: close()\n}\n\n# This is leaky and works with just 1 POST parameter...\nlocal function extract_post = |exchange, posts| {\n let reader = BufferedReader(InputStreamReader(exchange: getRequestBody()))\n var line = reader: readLine()\n while line isnt null {\n if line: startsWith(\"msg=\") {\n posts: add(java.net.URLDecoder.decode(line: substring(4), \"UTF-8\"))\n }\n line = reader: readLine()\n }\n reader: close()\n}\n\n\nlocal function index = |posts, template, exchange| {\n if exchange: getRequestMethod() == \"POST\" {\n extract_post(exchange, posts)\n redirect(exchange, \"/\")\n } else {\n respond(exchange, template(posts))\n }\n}\n\nlocal function index_template = -> \"\"\"\n<%@params posts %>\n\n\n \n Golo Chat\n \n \n

\n \n \n \n
\n

Last posts

\n <% foreach post in posts { %>\n
\n <%= post %>\n
\n <% } %>\n
\n \n\n\"\"\"\n\nfunction main = |args| {\n let index_tpl = gololang.TemplateEngine(): compile(index_template())\n let posts = java.util.concurrent.ConcurrentLinkedDeque()\n let server = HttpServer.create(InetSocketAddress(\"localhost\", 8081), 0)\n server: createContext(\"/\", ^index: bindTo(posts): bindTo(index_tpl))\n server: start()\n println(\">>> http://localhost:8081/\")\n}\n" }, { "path": "src/test/resources/samples/langs/Golo/util-containers.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule MoreCoolContainers\n\nfunction main = |args| {\n \n println(\">>> DynamicVariable\")\n\n let dyn = DynamicVariable(\"Foo\")\n println(dyn: value())\n \n let t1 = Thread({\n dyn: withValue(666, {\n println(dyn: value())\n })\n })\n \n let t2 = Thread({\n dyn: withValue(69, {\n println(dyn: value())\n })\n })\n\n t1: start()\n t2: start()\n t1: join()\n t2: join()\n println(dyn: value())\n\n println(\">>> Observable\")\n\n let foo = Observable(\"Foo\")\n foo: onChange(|v| -> println(\"foo = \" + v))\n\n let mapped = foo: map(|v| -> v + \"!\")\n mapped: onChange(|v| -> println(\"mapped = \" + v))\n \n foo: set(\"69\")\n}\n" }, { "path": "src/test/resources/samples/langs/Golo/workers.golo", "content": "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon)\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\nmodule Workers\n\nimport java.lang.Thread\nimport java.util.concurrent\nimport gololang.concurrent.workers.WorkerEnvironment\n\nlocal function pusher = |queue, message| -> queue: offer(message)\n\nlocal function generator = |port, message| {\n foreach i in range(0, 100) {\n port: send(message)\n }\n}\n\nfunction main = |args| {\n\n let env = WorkerEnvironment.builder(): withFixedThreadPool()\n let queue = ConcurrentLinkedQueue()\n\n let pusherPort = env: spawn(^pusher: bindTo(queue))\n let generatorPort = env: spawn(^generator: bindTo(pusherPort))\n\n let finishPort = env: spawn(|any| -> env: shutdown())\n\n foreach i in range(0, 10) {\n generatorPort: send(\"[\" + i + \"]\")\n }\n Thread.sleep(2000_L)\n finishPort: send(\"Die!\")\n\n env: awaitTermination(2000)\n println(queue: reduce(\"\", |acc, next| -> acc + \" \" + next))\n}\n\n" }, { "path": "src/test/resources/samples/langs/Gosu/Hello.gst", "content": "<%!-- defined in Hello.gst --%>\n\n<%@ params( users : Collection ) %>\n\n<% for( user in users ) { %>\n\n${user.LastName}, ${user.FirstName}, ${user.Department} <% } %>" }, { "path": "src/test/resources/samples/langs/Gosu/Hello.gsx", "content": "package example\n\nenhancement Hello : String {\n\n function toPerson() : Person {\n var vals = this.split(\",\")\n return new Person( vals[0], vals[1] as int, Relationship.valueOf( vals[2] ) ) )\n }\n}" }, { "path": "src/test/resources/samples/langs/Gosu/Person.gs", "content": "package example\n\nuses java.util.*\n\nuses java.io.File\n\nclass Person extends Contact implements IEmailable {\n\n var _name : String\n var _age : Integer as Age \n var _relationship : Relationship as readonly RelationshipOfPerson\n\n delegate _emailHelper represents IEmailable\n\n enum Relationship {\n FRIEND,\n FAMILY,\n BUSINESS_CONTACT\n }\n\n // Map of names to people\n static var ALL_PEOPLE = new HashMap()\n\n /* Constructs a new Person */\n construct( name : String, age : Integer, relationship : Relationship ) {\n _name = name\n _age = age\n _relationship = relationship\n _emailHelper = new EmailHelper( this )\n }\n\n property get Name():String{\n return _name\n }\n\n property set Name(name : String){\n _name = name\n }\n\n /* Implement IEmailable#getEmailName() */\n override function getEmailName():String{\n return Name\n }\n\n function incrementAge() {\n _age++\n }\n\n @Deprecated\n function printPersonInfo() {\n print( \"Person { Name : ${Name}, Age : ${Age}, Relationship : ${RelationshipOfPerson} }\" )\n }\n\n static function addPerson(p : Person){\n if(ALL_PEOPLE.containsKey(p?.Name)) {\n throw new IllegalArgumentException( \"There is already someone named '${p.Name}'.\" )\n }\n ALL_PEOPLE[p.Name] = p\n }\n\n static function addAllPeople( contacts : List ) {\n for( contact in contacts ) {\n if( contact typeis Person and not ALL_PEOPLE.containsKey( contact.Name )) {\n addPerson( contact )\n }\n }\n }\n\n static function getAllPeopleOlderThanNOrderedByName( age : int ) {\n var allPeople = ALL_PEOPLE.Values\n\n return allPeople.where( \\ p -> p.Age > age ).orderBy( \\ p -> p.Name )\n }\n\n static function loadPersonFromDB( id : Integer ) {\n using( var conn = DBConnectionManager.getConnection(),\n var stmt = conn.prepareStatement( \"SELECT name, age, relationship FROM PEOPLE WHERE ID=?\") ){\n\n stmt.setInt( 0, 0 )\n var result = stmt.executeQuery()\n if( result.next() ) {\n addPerson( new Person( result.getString( \"name\" ),\n result.getInt( \"age\" ),\n Relationship.valueOf( result.getString( \"relationship\" ) ) ) )\n\n }\n }\n }\n\n /* Loads in people from a CSV */\n static function loadFromFile( file : File ) {\n file.eachLine( \\ line -> {\n if( line.HasContent ) {\n addPerson( line.toPerson() )\n }\n })\n }\n\n /* Save people to a CSV */\n static function saveToFile( file : File ) {\n using( var writer = new FileWriter( file ) ) {\n print( PersonCSVTemplate.renderToString( ALL_PEOPLE.Values ) )\n PersonCSVTemplate.render( writer, ALL_PEOPLE.Values )\n }\n }\n}" }, { "path": "src/test/resources/samples/langs/Gosu/Ronin.gs", "content": "/**\n * Licensed under the Apache License, Version 2.0 (the \"License\"); you may not use this file except in compliance with the License. You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.\n */\n\npackage ronin\n\nuses gw.util.concurrent.LockingLazyVar\nuses gw.lang.reflect.*\nuses java.lang.*\nuses java.io.*\nuses ronin.config.*\nuses org.slf4j.*\n\n/**\n * The central location for Ronin utility methods. Controllers and templates should generally access the\n * methods and properties they inherit from {@link ronin.IRoninUtils} instead of using the methods and\n * properties here.\n */\nclass Ronin {\n\n // One static field to rule the all...\n static var _CONFIG : IRoninConfig as Config\n\n // And one thread local to bind them\n static var _CURRENT_REQUEST = new ThreadLocal();\n\n // That's inconstructable\n private construct() {}\n\n internal static function init(servlet : RoninServlet, m : ApplicationMode, src : File) {\n if(_CONFIG != null) {\n throw \"Cannot initialize a Ronin application multiple times!\"\n }\n var cfg = TypeSystem.getByFullNameIfValid(\"config.RoninConfig\")\n var defaultWarning = false\n if(cfg != null) {\n var ctor = cfg.TypeInfo.getConstructor({ronin.config.ApplicationMode, ronin.RoninServlet})\n if(ctor == null) {\n throw \"config.RoninConfig must have a constructor with the same signature as ronin.config.RoninConfig\"\n }\n _CONFIG = ctor.Constructor.newInstance({m, servlet}) as IRoninConfig\n } else {\n _CONFIG = new DefaultRoninConfig(m, servlet)\n defaultWarning = true\n }\n var roninLogger = TypeSystem.getByFullNameIfValid(\"ronin.RoninLoggerFactory\")\n if(roninLogger != null) {\n roninLogger.TypeInfo.getMethod(\"init\", {ronin.config.LogLevel}).CallHandler.handleCall(null, {LogLevel})\n }\n if(defaultWarning) {\n log(\"No configuration was found at config.RoninConfig, using the default configuration...\", :level=WARN)\n }\n Quartz.maybeStart()\n ReloadManager.setSourceRoot(src)\n }\n\n internal static property set CurrentRequest(req : RoninRequest) {\n _CURRENT_REQUEST.set(req)\n }\n\n //============================================\n // Public API\n //============================================\n\n /**\n * The trace handler for the current request.\n */\n static property get CurrentTrace() : Trace {\n return CurrentRequest?.Trace\n }\n\n /**\n * Ronin's representation of the current request.\n */\n static property get CurrentRequest() : RoninRequest {\n return _CURRENT_REQUEST.get()\n }\n\n /**\n * The mode in which this application is running.\n */\n static property get Mode() : ApplicationMode {\n return _CONFIG?.Mode ?: TESTING\n }\n\n /**\n * The log level at and above which log messages should be displayed.\n */\n static property get LogLevel() : LogLevel {\n return _CONFIG?.LogLevel ?: DEBUG\n }\n\n /**\n * Whether or not to display detailed trace information on each request.\n */\n static property get TraceEnabled() : boolean {\n return _CONFIG != null ? _CONFIG.TraceEnabled : true\n }\n\n /**\n * The default controller method to call when no method name is present in the request URL.\n */\n static property get DefaultAction() : String {\n return _CONFIG?.DefaultAction\n }\n\n /**\n * The default controller to call when no controller name is present in the request URL.\n */\n static property get DefaultController() : Type {\n return _CONFIG?.DefaultController\n }\n\n /**\n * The servlet responsible for handling Ronin requests.\n */\n static property get RoninServlet() : RoninServlet {\n return _CONFIG?.RoninServlet\n }\n\n /**\n * The handler for request processing errors.\n */\n static property get ErrorHandler() : IErrorHandler {\n return _CONFIG?.ErrorHandler\n }\n\n /**\n * The custom handler for logging messages.\n */\n static property get LogHandler() : ILogHandler {\n return _CONFIG?.LogHandler\n }\n\n /**\n * Logs a message using the configured log handler.\n * @param msg The text of the message to log, or a block which returns said text.\n * @param level (Optional) The level at which to log the message.\n * @param component (Optional) The logical component from whence the message originated.\n * @param exception (Optional) An exception to associate with the message.\n */\n static function log(msg : Object, level : LogLevel = null, component : String = null, exception : java.lang.Throwable = null) {\n if(level == null) {\n level = INFO\n }\n if(LogLevel <= level) {\n var msgStr : String\n if(msg typeis block():String) {\n msgStr = (msg as block():String)()\n } else {\n msgStr = msg as String\n }\n if(_CONFIG?.LogHandler != null) {\n _CONFIG.LogHandler.log(msgStr, level, component, exception)\n } else {\n switch(level) {\n case TRACE:\n LoggerFactory.getLogger(component?:Logger.ROOT_LOGGER_NAME).trace(msgStr, exception)\n break\n case DEBUG:\n LoggerFactory.getLogger(component?:Logger.ROOT_LOGGER_NAME).debug(msgStr, exception)\n break\n case INFO:\n LoggerFactory.getLogger(component?:Logger.ROOT_LOGGER_NAME).info(msgStr, exception)\n break\n case WARN:\n LoggerFactory.getLogger(component?:Logger.ROOT_LOGGER_NAME).warn(msgStr, exception)\n break\n case ERROR:\n case FATAL:\n LoggerFactory.getLogger(component?:Logger.ROOT_LOGGER_NAME).error(msgStr, exception)\n break\n }\n }\n }\n }\n\n /**\n * The caches known to Ronin.\n */\n static enum CacheStore {\n REQUEST,\n SESSION,\n APPLICATION\n }\n\n /**\n * Retrieves a value from a cache, or computes and stores it if it is not in the cache.\n * @param value A block which will compute the desired value.\n * @param name (Optional) A unique identifier for the value. Default is null, which means one will be\n * generated from the type of the value.\n * @param store (Optional) The cache store used to retrieve or store the value. Default is the request cache.\n * @return The retrieved or computed value.\n */\n static function cache(value : block():T, name : String = null, store : CacheStore = null) : T {\n if(store == null or store == REQUEST) {\n return _CONFIG.RequestCache.getValue(value, name)\n } else if (store == SESSION) {\n return _CONFIG.SessionCache.getValue(value, name)\n } else if (store == APPLICATION) {\n return _CONFIG.ApplicationCache.getValue(value, name)\n } else {\n throw \"Don't know about CacheStore ${store}\"\n }\n }\n\n /**\n * Invalidates a cached value in a cache.\n * @param name The unique identifier for the value.\n * @param store The cache store in which to invalidate the value.\n */\n static function invalidate(name : String, store : CacheStore) {\n if(store == null or store == REQUEST) {\n _CONFIG.RequestCache.invalidate(name)\n } else if (store == SESSION) {\n _CONFIG.SessionCache.invalidate(name)\n } else if (store == APPLICATION) {\n _CONFIG.ApplicationCache.invalidate(name)\n } else {\n throw \"Don't know about CacheStore ${store}\"\n }\n }\n\n\n /**\n * Detects changes made to resources in the Ronin application and\n * reloads them. This function should only be called when Ronin is\n * in development mode.\n */\n static function loadChanges() {\n ReloadManager.detectAndReloadChangedResources() \n }\n\n}\n" }, { "path": "src/test/resources/samples/langs/Gosu/hello.vark", "content": "function hello() {\n print(\"hello\")\n}" }, { "path": "src/test/resources/samples/langs/Grace/ackerman_function.grace", "content": "method ack (m : Number, n : Number) -> Number {\n print \"ack {m} {n}\"\n if (m < = 0) then {n + 1}\n elseif {n <= 0} then {ack((m -1), 1)}\n else {ack(m -1, ack(m, n-1))}\n}" }, { "path": "src/test/resources/samples/langs/Grace/grace_IDE.grace", "content": "import \"gtk\" as gtk\nimport \"io\" as io\nimport \"mgcollections\" as collections\nimport \"button_factory\" as button_factory\nimport \"dialog_factory\" as dialog_factory\nimport \"syntax_highlighter\" as highlighter\nimport \"auto_completer\" as aComp\n\n//TODO\n\n// Autocomplete typing\n\n// FileChooser\n// Themes\n\n// Details for the Top Level Window\ndef window = gtk.window(gtk.GTK_WINDOW_TOPLEVEL)\nwindow.title := \"Grace\"\nwindow.set_default_size(700, 700)\n// -------------\n\n// Placeholder for the console window that can be popped out\n// of the main window\nvar popped := gtk.window(gtk.GTK_WINDOW_TOPLEVEL)\n\n// Initialise the Boxes\ndef mBox = gtk.box(gtk.GTK_ORIENTATION_VERTICAL, 2)\ndef buttonBox = gtk.box(gtk.GTK_ORIENTATION_HORIZONTAL, 2)\nvar consoleButtons := gtk.box(gtk.GTK_ORIENTATION_HORIZONTAL, 3)\nvar consoleBox := gtk.box(gtk.GTK_ORIENTATION_VERTICAL, 2)\nvar editorBox := gtk.box(gtk.GTK_ORIENTATION_VERTICAL, 2)\nvar splitPane := gtk.paned(gtk.GTK_ORIENTATION_VERTICAL, 2)\ndef menuBox = gtk.box(gtk.GTK_ORIENTATION_HORIZONTAL, 4)\n// -------------\n\n// Initialise the buttons\ndef runButton = button_factory.make(\"run\")\nvar clearButton := button_factory.make(\"clear\")\nvar outButton := button_factory.make(\"out\")\nvar errorButton := button_factory.make(\"error\")\nvar popButton := button_factory.make(\"pop\")\ndef newButton = button_factory.make(\"new\")\ndef openButton = button_factory.make(\"open\")\ndef saveButton = button_factory.make(\"save\")\ndef saveAsButton = button_factory.make(\"saveAs\")\ndef closeButton = button_factory.make(\"close\")\n// -------------\n\n// Details for the default text editor and scrolled window\nvar tEdit := gtk.text_view\ntEdit.set_size_request(700, 400)\n\nvar scrolled_main := gtk.scrolled_window\nscrolled_main.set_size_request(700, 400)\nscrolled_main.add(tEdit)\n// -------------\n\n// Widget that allows multiple files to be edited (tabs)\nvar notebook := gtk.notebook\nnotebook.scrollable := true\n// -------------\n\n// Maps for holding the text_views and scrolled_windows\nvar editor_map := collections.map.new\neditor_map.put(0, tEdit)\nvar scrolled_map := collections.map.new\nscrolled_map.put(0, scrolled_main)\n\n// -------------\n\n// Class that manages the syntax highlighting (This needs to be passed around otherwise\n// the text_tag table gets confused, ie there can only be one)\ndef lighter = highlighter.Syntax_Highlighter.new(notebook, editor_map)\ntEdit.buffer.on \"changed\" do {\n lighter.highlightLine\n}\n\n// Class that manages any auto completion that is required\ndef completer = aComp.Auto_Completer.new(window, notebook, editor_map)\n\n// Utility methods\n// -------------\n\nmethod deleteCompileFiles(page_num : Number) {\n def cur_scrolled = scrolled_map.get(page_num)\n var filename := notebook.get_tab_label_text(cur_scrolled)\n filename := filename.substringFrom(0)to(filename.size - 7) //Removes .grace extension\n\n io.system(\"rm -f files/\" ++ filename)\n io.system(\"rm -f files/\" ++ filename ++ \".c\")\n io.system(\"rm -f files/\" ++ filename ++ \".gcn\")\n io.system(\"rm -f files/\" ++ filename ++ \".gct\")\n}\n\n// -------------\n\n\n\nvar currentConsole := \"output\" // Which console is being shown\nvar out := false\n\n\nvar outText := \"\"\nvar errorText := \"\"\n\n\n\n// Give actions to the buttons\n// -------------\n\nrunButton.on \"clicked\" do {\n clearConsoles()\n\n // Get the details for the current page selected\n def cur_page_num = notebook.current_page\n def cur_page = editor_map.get(cur_page_num)\n def cur_scrolled = scrolled_map.get(cur_page_num)\n def cur_page_label = notebook.get_tab_label_text(cur_scrolled)\n\n // Initialise text iterators\n def sIter = gtk.text_iter\n def eIter = gtk.text_iter\n\n // Set one at the beggining and one at the end of the text\n cur_page.buffer.get_iter_at_offset(sIter, 0)\n cur_page.buffer.get_iter_at_offset(eIter, -1)\n\n // Get the text between the text iterators\n def text = cur_page.buffer.get_text(sIter, eIter, true)\n\n // Save the text to the file (in case the user hasn't already saved it)\n def file = io.open(\"files/\" ++ cur_page_label, \"w\")\n file.write(text)\n file.close\n\n // Run the program and pipe the output and errors into files to be read\n io.system(\"../minigrace/minigrace \" ++ \"files/\" ++ cur_page_label ++ \" > output.txt 2> error.txt\")\n def outputFile = io.open(\"output.txt\", \"r\")\n def errorFile = io.open(\"error.txt\", \"r\")\n outText := outputFile.read\n errorText := errorFile.read\n\n io.system(\"rm -f output.txt error.txt\")\n\n var switched := false\n\n // Change the console to output if there is output text\n if((outText.size > 0) && (currentConsole != \"output\")) then {\n switch_to_output()\n switched := true\n }\n // Change the console to errors if there were errors\n if((errorText.size > 0) && (currentConsole != \"errors\")) then {\n switch_to_errors()\n switched := true\n }\n\n // Remember to populate the console if it wasn't switched\n if(!switched) then {\n populateConsoles\n }\n}\n\nclearButton.on \"clicked\" do {\n clearConsoles()\n}\n\noutButton.on \"clicked\" do {\n switch_to_output()\n}\n\nerrorButton.on \"clicked\" do {\n switch_to_errors()\n}\n\npopButton.on \"clicked\" do {\n if(out) then {\n popIn()\n } else {\n popOut()\n }\n}\n\n// Gives a dialog to let the user create a new file to edit\nnewButton.on \"clicked\" do {\n def new_window_class = dialog_factory.new.new(notebook, editor_map, scrolled_map, lighter)\n\n def new_window = new_window_class.window()\n new_window.show_all\n}\n\n// Gives a dialog that lets the user open a file to edit\nopenButton.on \"clicked\" do {\n def open_window_class = dialog_factory.open.new(notebook, editor_map, scrolled_map, lighter)\n\n def open_window = open_window_class.window()\n open_window.show_all\n}\n\n// Saves the current file (if the name is Untitled.grace it will ask for a new name)\nsaveButton.on \"clicked\" do {\n def cur_page_num = notebook.current_page\n def cur_page = editor_map.get(cur_page_num)\n def cur_scrolled = scrolled_map.get(cur_page_num)\n def cur_page_label = notebook.get_tab_label_text(cur_scrolled)\n\n if(cur_page_label == \"Untitled.grace\") then {\n def saveAs_window_class = dialog_factory.save.new(notebook, editor_map, scrolled_map, true)\n\n def saveAs_window = saveAs_window_class.window()\n saveAs_window.show_all\n } else {\n // Initialise text iterators\n def sIter = gtk.text_iter\n def eIter = gtk.text_iter\n\n // Set one at the beggining and one at the end of the text\n cur_page.buffer.get_iter_at_offset(sIter, 0)\n cur_page.buffer.get_iter_at_offset(eIter, -1)\n\n // Get the text between the text iterators\n def text = cur_page.buffer.get_text(sIter, eIter, true)\n\n // Save the file\n def file = io.open(\"files/\" ++ cur_page_label, \"w\")\n file.write(text)\n file.close\n }\n\n}\n\n// Gives a dialog that lets the user save the file with a new name\nsaveAsButton.on \"clicked\" do {\n def saveAs_window_class = dialog_factory.save.new(notebook, editor_map, scrolled_map, false)\n\n def saveAs_window = saveAs_window_class.window()\n saveAs_window.show_all\n}\n\n// This will close a tab on the notebook\n// It also \"removes\" the page from the map,\n// by creating a new temporary map and putting all but\n// the removed page in.\ncloseButton.on \"clicked\" do {\n def page_num = notebook.current_page\n def num_pages = notebook.n_pages\n\n if(num_pages > 1) then {\n deleteCompileFiles(page_num)\n\n def e_map = collections.map.new\n def s_map = collections.map.new\n\n // Copy every page up to the current page into the new maps\n var x := 0\n while {x < page_num} do {\n var eValue := editor_map.get(x)\n var sValue := scrolled_map.get(x)\n e_map.put(x, eValue)\n s_map.put(x, sValue)\n\n x := x + 1\n }\n\n // Copy every page after the current page into the new map (shifted one down)\n x := page_num + 1\n while {x < num_pages} do {\n var eValue := editor_map.get(x)\n var sValue := scrolled_map.get(x)\n e_map.put((x - 1), eValue)\n s_map.put((x - 1), sValue)\n\n x := x + 1\n }\n\n editor_map := e_map\n scrolled_map := s_map\n notebook.remove_page(page_num)\n\n notebook.show_all\n }\n\n}\n// -------------\n\n\n\n\n\n\n// Consoles:\n// -------------\n\nvar outConsole := gtk.text_view\nvar outScroll := gtk.scrolled_window\nvar errorConsole := gtk.text_view\nvar errorScroll := gtk.scrolled_window\nvar errorTag := errorConsole.buffer.create_tag(\"fixed\", \"foreground\", \"red\")\n\n\n// Creates a new output console\nmethod createOut {\n outConsole := gtk.text_view\n outScroll := gtk.scrolled_window\n outScroll.add(outConsole)\n if(out) then {\n outConsole.set_size_request(400, 400)\n outScroll.set_size_request(400, 400)\n } else {\n outConsole.set_size_request(700, 200)\n outScroll.set_size_request(700, 200)\n }\n outConsole.editable := false\n outConsole.buffer.set_text(\"[Output]:\", -1)\n}\ncreateOut()\n\n// Creates a new error console\nmethod createError {\n errorConsole := gtk.text_view\n errorScroll := gtk.scrolled_window\n errorScroll.add(errorConsole)\n if(out) then {\n errorConsole.set_size_request(400, 400)\n errorScroll.set_size_request(400, 400)\n } else {\n errorConsole.set_size_request(700, 200)\n errorScroll.set_size_request(700, 200)\n }\n errorConsole.editable := false\n errorConsole.buffer.set_text(\"[Errors]:\", -1)\n errorTag := errorConsole.buffer.create_tag(\"fixed\", \"foreground\", \"red\")\n}\ncreateError()\n\n// Switches the console being shown to be output. This requires\n// the output console to be remade as it would have been destroyed when\n// it was switched previously\nmethod switch_to_output {\n if(currentConsole != \"output\") then {\n currentConsole := \"output\"\n consoleBox.remove(errorScroll) // This destroys the errorConsole\n\n createOut()\n\n consoleBox.add(outScroll)\n\n populateConsoles()\n if(out) then {\n popped.show_all\n } else {\n window.show_all\n }\n }\n}\n\n// Switches the console being shown to be errors. This requires\n// the error console to be remade as it would have been destroyed when\n// it was switched previously\nmethod switch_to_errors {\n if(currentConsole != \"errors\") then {\n currentConsole := \"errors\"\n consoleBox.remove(outScroll) // This destroys the outConsole\n\n createError()\n\n consoleBox.add(errorScroll)\n\n populateConsoles()\n if(out) then {\n popped.show_all\n } else {\n window.show_all\n }\n }\n}\n\n// If there is text to be put into the consoles this will add it\nmethod populateConsoles {\n if((outText.size > 0) && (currentConsole == \"output\")) then {\n outConsole.buffer.set_text(outText, -1)\n }\n if((errorText.size > 0) && (currentConsole == \"errors\")) then {\n def sIter = gtk.text_iter\n def eIter = gtk.text_iter\n\n errorConsole.buffer.set_text(errorText, -1)\n errorConsole.buffer.get_iter_at_offset(sIter, 0)\n errorConsole.buffer.get_iter_at_offset(eIter, -1)\n errorConsole.buffer.apply_tag(errorTag, sIter, eIter)\n }\n}\n\nmethod clearConsoles {\n if(currentConsole == \"output\") then {\n outConsole.buffer.set_text(\"[Output]:\", -1)\n outText := \"\"\n }\n if(currentConsole == \"errors\") then {\n errorConsole.buffer.set_text(\"[Errors]:\", -1)\n errorText := \"\"\n }\n}\n\n\n// Identical as the popIn method, but can be connected to the window's destroy button\ndef popInBlock = {\n consoleBox.reparent(splitPane)\n popButton.label := \"Pop Out\"\n\n if(currentConsole == \"output\") then {\n outConsole.set_size_request(700, 200)\n outScroll.set_size_request(700, 200)\n }\n if(currentConsole == \"errors\") then {\n errorConsole.set_size_request(700, 200)\n errorScroll.set_size_request(700, 200)\n }\n\n def cur_page_num = notebook.current_page\n def cur_scrolled = scrolled_map.get(cur_page_num)\n def cur_page = editor_map.get(cur_page_num)\n\n cur_page.set_size_request(700, 400)\n cur_scrolled.set_size_request(700, 400)\n\n out := false\n popped.visible := false\n}\n\n\n// This pops the console out into a separate window\nmethod popOut {\n popped := gtk.window(gtk.GTK_WINDOW_TOPLEVEL)\n\n consoleBox.reparent(popped)\n popButton.label := \"Pop In\"\n\n if(currentConsole == \"output\") then {\n outConsole.set_size_request(400, 400)\n outScroll.set_size_request(400, 400)\n }\n if(currentConsole == \"errors\") then {\n errorConsole.set_size_request(400, 400)\n errorScroll.set_size_request(400, 400)\n }\n\n def cur_page_num = notebook.current_page\n def cur_scrolled = scrolled_map.get(cur_page_num)\n def cur_page = editor_map.get(cur_page_num)\n\n cur_page.set_size_request(700, 580)\n cur_scrolled.set_size_request(700, 580)\n\n out := true\n popped.visible := true\n popped.connect(\"destroy\", popInBlock)\n popped.show_all\n\n}\n\n// Puts the console back into the main window\nmethod popIn {\n consoleBox.reparent(splitPane)\n popButton.label := \"Pop Out\"\n\n if(currentConsole == \"output\") then {\n outConsole.set_size_request(700, 200)\n outScroll.set_size_request(700, 200)\n }\n if(currentConsole == \"errors\") then {\n errorConsole.set_size_request(700, 200)\n errorScroll.set_size_request(700, 200)\n }\n\n def cur_page_num = notebook.current_page\n def cur_scrolled = scrolled_map.get(cur_page_num)\n def cur_page = editor_map.get(cur_page_num)\n\n cur_page.set_size_request(700, 400)\n cur_scrolled.set_size_request(700, 400)\n\n out := false\n popped.visible := false\n}\n\nclearConsoles()\n// -------------\n\n\n\n\n\n\n// Patch everything together\n\nvar hSeparator1 := gtk.separator(gtk.GTK_ORIENTATION_HORIZONTAL)\nvar hSeparator2 := gtk.separator(gtk.GTK_ORIENTATION_HORIZONTAL)\n\nmenuBox.add(newButton)\nmenuBox.add(openButton)\nmenuBox.add(saveButton)\nmenuBox.add(saveAsButton)\nbuttonBox.add(runButton)\nbuttonBox.add(closeButton)\n\nconsoleButtons.add(outButton)\nconsoleButtons.add(errorButton)\nconsoleButtons.add(clearButton)\nconsoleButtons.add(popButton)\n\nconsoleBox.add(hSeparator1)\nconsoleBox.add(consoleButtons)\nconsoleBox.add(outScroll)\n\neditorBox.add(hSeparator2)\nnotebook.add(scrolled_main)\nnotebook.set_tab_label_text(scrolled_main, \"Untitled.grace\")\neditorBox.add(notebook)\n\nsplitPane.add1(editorBox)\nsplitPane.add2(consoleBox)\n\nmBox.add(menuBox)\nmBox.add(buttonBox)\nmBox.add(splitPane)\n\nwindow.add(mBox)\n\ndef exit = {\n var x := 0\n while {x < notebook.n_pages} do {\n deleteCompileFiles(x)\n\n x := x + 1\n }\n\n // Delete the compile files of the IDE\n io.system(\"rm -f Grace_IDE.gct Grace_IDE.c Grace_IDE.gcn\")\n io.system(\"rm -f scanner.gct scanner.c scanner.gcn\")\n io.system(\"rm -f syntax_highlighter.gct syntax_highlighter.c syntax_highlighter.gcn\")\n io.system(\"rm -f syntax_colors.gct syntax_colors.c syntax_colors.gcn\")\n io.system(\"rm -f button_factory.gct button_factory.c button_factory.gcn\")\n io.system(\"rm -f dialog_factory.gct dialog_factory.c dialog_factory.gcn\")\n io.system(\"rm -f auto_completer.gct auto_completer.c auto_completer.gcn\")\n\n print \"Grace IDE Closed Successfully\"\n gtk.main_quit\n}\n\nwindow.connect(\"destroy\", exit)\nwindow.show_all\n\ngtk.main" }, { "path": "src/test/resources/samples/langs/Gradle/build.gradle", "content": "apply plugin: GreetingPlugin\n\ngreeting.message = 'Hi from Gradle'\n\nclass GreetingPlugin implements Plugin {\n void apply(Project project) {\n // Add the 'greeting' extension object\n project.extensions.create(\"greeting\", GreetingPluginExtension)\n // Add a task that uses the configuration\n project.task('hello') << {\n println project.greeting.message\n }\n }\n}\n\nclass GreetingPluginExtension {\n def String message = 'Hello from GreetingPlugin'\n}\n" }, { "path": "src/test/resources/samples/langs/Gradle/builder.gradle", "content": "apply plugin: GreetingPlugin\n\ngreeting {\n message = 'Hi'\n greeter = 'Gradle'\n}\n\nclass GreetingPlugin implements Plugin {\n void apply(Project project) {\n project.extensions.create(\"greeting\", GreetingPluginExtension)\n project.task('hello') << {\n println \"${project.greeting.message} from ${project.greeting.greeter}\"\n }\n }\n}\n\nclass GreetingPluginExtension {\n String message\n String greeter\n}\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/Foods.gf", "content": "-- (c) 2009 Aarne Ranta under LGPL\n\nabstract Foods = {\n flags startcat = Comment ;\n cat\n Comment ; Item ; Kind ; Quality ;\n fun\n Pred : Item -> Quality -> Comment ;\n This, That, These, Those : Kind -> Item ;\n Mod : Quality -> Kind -> Kind ;\n Wine, Cheese, Fish, Pizza : Kind ;\n Very : Quality -> Quality ;\n Fresh, Warm, Italian, \n Expensive, Delicious, Boring : Quality ;\n}\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsAfr.gf", "content": "-- (c) 2009 Laurette Pretorius Sr & Jr and Ansu Berg under LGPL\n\nconcrete FoodsAfr of Foods = open Prelude, Predef in{\n\n\tflags coding=utf8;\n\n\tlincat\n\t\tComment = {s: Str} ;\n\t\tKind = {s: Number => Str} ;\n\t\tItem = {s: Str ; n: Number} ;\n\t\tQuality = {s: AdjAP => Str} ;\n\n\tlin\n\t\tPred item quality = {s = item.s ++ \"is\" ++ (quality.s ! Predic)};\n\t\tThis kind = {s = \"hierdie\" ++ (kind.s ! Sg); n = Sg};\n\t\tThat kind = {s = \"daardie\" ++ (kind.s ! Sg); n = Sg};\n\t\tThese kind = {s = \"hierdie\" ++ (kind.s ! Pl); n = Pl};\n\t\tThose kind = {s = \"daardie\" ++ (kind.s ! Pl); n = Pl};\n\t\tMod quality kind = {s = table{n => (quality.s ! Attr) ++ (kind.s!n)}};\n\n\t\tWine = declNoun_e \"wyn\";\n\t\tCheese = declNoun_aa \"kaas\";\n\t\tFish = declNoun_ss \"vis\";\n\t\tPizza = declNoun_s \"pizza\";\n\n\t\tVery quality = veryAdj quality;\n\n\t\tFresh = regAdj \"vars\";\n\t\tWarm = regAdj \"warm\";\n\t\tItalian = smartAdj_e \"Italiaans\";\n\t\tExpensive = regAdj \"duur\";\n\t\tDelicious = smartAdj_e \"heerlik\";\n\t\tBoring = smartAdj_e \"vervelig\";\n\n\tparam\n\t\tAdjAP = Attr | Predic ;\n\t\tNumber = Sg | Pl ;\n\n\toper\n\t\t--Noun operations (wyn, kaas, vis, pizza)\n\n\t\tdeclNoun_aa: Str -> {s: Number => Str} = \\x ->\n\t\tlet v = tk 2 x\n\t\tin\n\t\t{s = table{Sg => x ; Pl => v + (last x) +\"e\"}};\n\n\t\tdeclNoun_e: Str -> {s: Number => Str} = \\x -> {s = table{Sg => x ; Pl => x + \"e\"}} ;\n\t\tdeclNoun_s: Str -> {s: Number => Str} = \\x -> {s = table{Sg => x ; Pl => x + \"s\"}} ;\n\n\t\tdeclNoun_ss: Str -> {s: Number => Str} = \\x -> {s = table{Sg => x ; Pl => x + (last x) + \"e\"}} ;\n\n\n\t\t--Adjective operations\n\n\t\tmkAdj : Str -> Str -> {s: AdjAP => Str} = \\x,y -> {s = table{Attr => x; Predic => y}};\n\n\t\tdeclAdj_e : Str -> {s : AdjAP=> Str} = \\x -> mkAdj (x + \"e\") x;\n\t\tdeclAdj_g : Str -> {s : AdjAP=> Str} = \\w ->\n\t\t\tlet v = init w\n\t\t\tin mkAdj (v + \"ë\") w ;\n\n\t\tdeclAdj_oog : Str -> {s : AdjAP=> Str} = \\w ->\n\t\t\tlet v = init w\n\t\t\tin\n\t\t\t\tlet i = init v\n\t\t\t\tin mkAdj (i + \"ë\") w ;\n\n\t\tregAdj : Str -> {s : AdjAP=> Str} = \\x -> mkAdj x x;\n\n\t\tveryAdj : {s: AdjAP => Str} -> {s : AdjAP=> Str} = \\x -> {s = table{a => \"baie\" ++ (x.s!a)}};\n\n\n\t\tsmartAdj_e : Str -> {s : AdjAP=> Str} = \\a -> case a of\n\t\t{\n\t\t\t_ + \"oog\" \t\t\t \t\t=> declAdj_oog a ;\n\t\t\t_ + (\"e\" | \"ie\" | \"o\" | \"oe\") + \"g\" \t=> declAdj_g a ;\n\t\t\t_\t\t\t\t\t \t=> declAdj_e a\n\t\t};\n}\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsAmh.gf", "content": "concrete FoodsAmh of Foods ={\n flags coding = utf8;\n lincat\n Comment,Item,Kind,Quality = Str;\n lin\n Pred item quality = item ++ quality++ \"ነው::\" ;\n This kind = \"ይህ\" ++ kind;\n That kind = \"ያ\" ++ kind;\n Mod quality kind = quality ++ kind;\n Wine = \"ወይን\";\n Cheese = \"አይብ\";\n Fish = \"ዓሳ\";\n Very quality = \"በጣም\" ++ quality;\n Fresh = \"አዲስ\";\n Warm = \"ትኩስ\";\n Italian = \"የጥልያን\";\n Expensive = \"ውድ\";\n Delicious = \"ጣፋጭ\";\n Boring = \"አስቀያሚ\";\n \n} " }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsBul.gf", "content": "-- (c) 2009 Krasimir Angelov under LGPL\n\nconcrete FoodsBul of Foods = {\n \n flags\n coding = utf8;\n\n param\n Gender = Masc | Fem | Neutr;\n Number = Sg | Pl;\n Agr = ASg Gender | APl ;\n\n lincat\n Comment = Str ;\n Quality = {s : Agr => Str} ;\n Item = {s : Str; a : Agr} ;\n Kind = {s : Number => Str; g : Gender} ;\n\n lin\n Pred item qual = item.s ++ case item.a of {ASg _ => \"е\"; APl => \"са\"} ++ qual.s ! item.a ;\n \n This kind = {s=case kind.g of {Masc=>\"този\"; Fem=>\"тази\"; Neutr=>\"това\" } ++ kind.s ! Sg; a=ASg kind.g} ;\n That kind = {s=case kind.g of {Masc=>\"онзи\"; Fem=>\"онази\"; Neutr=>\"онова\"} ++ kind.s ! Sg; a=ASg kind.g} ;\n These kind = {s=\"тези\" ++ kind.s ! Pl; a=APl} ;\n Those kind = {s=\"онези\" ++ kind.s ! Pl; a=APl} ;\n \n Mod qual kind = {s=\\\\n => qual.s ! (case n of {Sg => ASg kind.g; Pl => APl}) ++ kind.s ! n; g=kind.g} ;\n\n Wine = {s = table {Sg => \"вино\"; Pl => \"вина\"}; g = Neutr};\n Cheese = {s = table {Sg => \"сирене\"; Pl => \"сирена\"}; g = Neutr};\n Fish = {s = table {Sg => \"риба\"; Pl => \"риби\"}; g = Fem};\n Pizza = {s = table {Sg => \"пица\"; Pl => \"пици\"}; g = Fem};\n\n Very qual = {s = \\\\g => \"много\" ++ qual.s ! g};\n\n Fresh = {s = table {ASg Masc => \"свеж\"; ASg Fem => \"свежа\"; ASg Neutr => \"свежо\"; APl => \"свежи\"}};\n Warm = {s = table {ASg Masc => \"горещ\"; ASg Fem => \"гореща\"; ASg Neutr => \"горещо\"; APl => \"горещи\"}};\n Italian = {s = table {ASg Masc => \"италиански\"; ASg Fem => \"италианска\"; ASg Neutr => \"италианско\"; APl => \"италиански\"}}; \n Expensive = {s = table {ASg Masc => \"скъп\"; ASg Fem => \"скъпа\"; ASg Neutr => \"скъпо\"; APl => \"скъпи\"}};\n Delicious = {s = table {ASg Masc => \"превъзходен\"; ASg Fem => \"превъзходна\"; ASg Neutr => \"превъзходно\"; APl => \"превъзходни\"}};\n Boring = {s = table {ASg Masc => \"еднообразен\"; ASg Fem => \"еднообразна\"; ASg Neutr => \"еднообразно\"; APl => \"еднообразни\"}};\n \n}\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsCat.gf", "content": "--# -path=.:present\n\n-- (c) 2009 Jordi Saludes under LGPL\n\nconcrete FoodsCat of Foods = FoodsI with \n (Syntax = SyntaxCat),\n (LexFoods = LexFoodsCat) ;\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsChi.gf", "content": "concrete FoodsChi of Foods = {\nflags coding = utf8 ;\nlincat\n Comment, Item = Str ;\n Kind = {s,c : Str} ; \n Quality = {s,p : Str} ;\nlin\n Pred item quality = item ++ \"是\" ++ quality.s ++ quality.p ;\n This kind = \"这\" ++ kind.c ++ kind.s ;\n That kind = \"那\" ++ kind.c ++ kind.s ;\n These kind = \"这\" ++ \"些\" ++ kind.s ;\n Those kind = \"那\" ++ \"些\" ++ kind.s ;\n Mod quality kind = {\n s = quality.s ++ quality.p ++ kind.s ;\n c = kind.c\n } ;\n Wine = geKind \"酒\" ;\n Pizza = geKind \"比 萨 饼\" ;\n Cheese = geKind \"奶 酪\" ;\n Fish = geKind \"鱼\" ;\n Very quality = longQuality (\"非 常\" ++ quality.s) ;\n Fresh = longQuality \"新 鲜\" ;\n Warm = longQuality \"温 热\" ;\n Italian = longQuality \"意 大 利 式\" ;\n Expensive = longQuality \"昂 贵\" ;\n Delicious = longQuality \"美 味\" ;\n Boring = longQuality \"难 吃\" ;\noper\n mkKind : Str -> Str -> {s,c : Str} = \\s,c ->\n {s = s ; c = c} ;\n geKind : Str -> {s,c : Str} = \\s ->\n mkKind s \"个\" ;\n longQuality : Str -> {s,p : Str} = \\s ->\n {s = s ; p = \"的\"} ;\n}\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsCze.gf", "content": "-- (c) 2011 Katerina Bohmova under LGPL\n\nconcrete FoodsCze of Foods = open ResCze in {\n flags \n coding = utf8 ;\n lincat\n Comment = {s : Str} ; \n Quality = Adjective ; \n Kind = Noun ; \n Item = NounPhrase ;\n lin\n Pred item quality = \n {s = item.s ++ copula ! item.n ++ \n quality.s ! item.g ! item.n} ;\n This = det Sg \"tento\" \"tato\" \"toto\" ;\n That = det Sg \"tamten\" \"tamta\" \"tamto\" ;\n These = det Pl \"tyto\" \"tyto\" \"tato\" ;\n Those = det Pl \"tamty\" \"tamty\" \"tamta\" ;\n Mod quality kind = {\n s = \\\\n => quality.s ! kind.g ! n ++ kind.s ! n ;\n g = kind.g\n } ;\n Wine = noun \"víno\" \"vína\" Neutr ;\n Cheese = noun \"sýr\" \"sýry\" Masc ;\n Fish = noun \"ryba\" \"ryby\" Fem ;\n Pizza = noun \"pizza\" \"pizzy\" Fem ;\n Very qual = {s = \\\\g,n => \"velmi\" ++ qual.s ! g ! n} ;\n Fresh = regAdj \"čerstv\" ;\n Warm = regAdj \"tepl\" ;\n Italian = regAdj \"italsk\" ;\n Expensive = regAdj \"drah\" ;\n Delicious = regnfAdj \"vynikající\" ;\n Boring = regAdj \"nudn\" ;\n}\n\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsDut.gf", "content": "-- (c) 2009 Femke Johansson under LGPL\n\nconcrete FoodsDut of Foods = {\n\n\tlincat\n\t\tComment = {s : Str};\n\t\tQuality = {s : AForm => Str};\n\t\tKind = { s : Number => Str};\n\t\tItem = {s : Str ; n : Number};\n\t\n\tlin\n\t\tPred item quality = \n\t\t\t{s = item.s ++ copula ! item.n ++ quality.s ! APred};\n\t\tThis = det Sg \"deze\";\n\t\tThese = det Pl \"deze\";\n\t\tThat = det Sg \"die\";\n\t\tThose = det Pl \"die\";\n\t\t\n\t\tMod quality kind =\n\t\t\t{s = \\\\n => quality.s ! AAttr ++ kind.s ! n};\n\t\t\tWine = regNoun \"wijn\";\n\t\t\tCheese = noun \"kaas\" \"kazen\";\n\t\t\tFish = noun \"vis\" \"vissen\";\n\t\t\tPizza = noun \"pizza\" \"pizza's\";\n\t\t\t\n\t\t\tVery a = {s = \\\\f => \"erg\" ++ a.s ! f};\n\t\t\t\n\t\t\tFresh = regadj \"vers\";\n\t\t\tWarm = regadj \"warm\";\n\t\t\tItalian = regadj \"Italiaans\";\n\t\t\tExpensive = adj \"duur\" \"dure\";\n\t\t\tDelicious = regadj \"lekker\";\n\t\t\tBoring = regadj \"saai\";\n\t\t\n\t\tparam\n\t\t\tNumber = Sg | Pl;\n\t\t\tAForm = APred | AAttr;\n\t\t\n\t\toper\n\t\t\tdet : Number -> Str ->\n\t\t\t\t{s : Number => Str} -> {s : Str ; n: Number} =\n\t\t\t\t\\n,det,noun -> {s = det ++ noun.s ! n ; n=n};\n\t\t\t\t\n\t\t\tnoun : Str -> Str -> {s : Number => Str} = \n\t\t\t\t\\man,men -> {s = table {Sg => man; Pl => men}};\n\t\t\t\t\n\t\t\tregNoun : Str -> {s : Number => Str} =\n\t\t\t\t\\wijn -> noun wijn (wijn + \"en\");\n\t\t\t\t\n\t\t\tregadj : Str -> {s : AForm => Str} =\n\t\t\t\t\\koud -> adj koud (koud+\"e\");\n\t\t\t\n\t\t\tadj : Str -> Str -> {s : AForm => Str} =\n\t\t\t\t\\duur, dure -> {s = table {APred => duur; AAttr => dure}};\n\t\t\t\t\n\t\t\tcopula : Number => Str =\n\t\t\t\ttable {Sg => \"is\" ; Pl => \"zijn\"};\n}\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsEng.gf", "content": "-- (c) 2009 Aarne Ranta under LGPL\n\nconcrete FoodsEng of Foods = {\n flags language = en_US;\n lincat\n Comment, Quality = {s : Str} ; \n Kind = {s : Number => Str} ; \n Item = {s : Str ; n : Number} ; \n lin\n Pred item quality = \n {s = item.s ++ copula ! item.n ++ quality.s} ;\n This = det Sg \"this\" ;\n That = det Sg \"that\" ;\n These = det Pl \"these\" ;\n Those = det Pl \"those\" ;\n Mod quality kind = \n {s = \\\\n => quality.s ++ kind.s ! n} ;\n Wine = regNoun \"wine\" ;\n Cheese = regNoun \"cheese\" ;\n Fish = noun \"fish\" \"fish\" ;\n Pizza = regNoun \"pizza\" ;\n Very a = {s = \"very\" ++ a.s} ;\n Fresh = adj \"fresh\" ;\n Warm = adj \"warm\" ;\n Italian = adj \"Italian\" ;\n Expensive = adj \"expensive\" ;\n Delicious = adj \"delicious\" ;\n Boring = adj \"boring\" ;\n param\n Number = Sg | Pl ;\n oper\n det : Number -> Str -> \n {s : Number => Str} -> {s : Str ; n : Number} = \n \\n,det,noun -> {s = det ++ noun.s ! n ; n = n} ;\n noun : Str -> Str -> {s : Number => Str} = \n \\man,men -> {s = table {Sg => man ; Pl => men}} ;\n regNoun : Str -> {s : Number => Str} = \n \\car -> noun car (car + \"s\") ;\n adj : Str -> {s : Str} = \n \\cold -> {s = cold} ;\n copula : Number => Str = \n table {Sg => \"is\" ; Pl => \"are\"} ;\n}\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsEpo.gf", "content": "-- (c) 2009 Julia Hammar under LGPL\n\nconcrete FoodsEpo of Foods = open Prelude in {\n\n flags coding =utf8 ;\n\n lincat\n Comment = SS ; \n Kind, Quality = {s : Number => Str} ; \n Item = {s : Str ; n : Number} ; \n\n lin\n Pred item quality = ss (item.s ++ copula ! item.n ++ quality.s ! item.n) ;\n This = det Sg \"ĉi tiu\" ;\n That = det Sg \"tiu\" ;\n These = det Pl \"ĉi tiuj\" ;\n Those = det Pl \"tiuj\" ;\n Mod quality kind = {s = \\\\n => quality.s ! n ++ kind.s ! n} ;\n Wine = regNoun \"vino\" ;\n Cheese = regNoun \"fromaĝo\" ;\n Fish = regNoun \"fiŝo\" ;\n Pizza = regNoun \"pico\" ;\n Very quality = {s = \\\\n => \"tre\" ++ quality.s ! n} ;\n Fresh = regAdj \"freŝa\" ;\n Warm = regAdj \"varma\" ;\n Italian = regAdj \"itala\" ;\n Expensive = regAdj \"altekosta\" ;\n Delicious = regAdj \"bongusta\" ;\n Boring = regAdj \"enuiga\" ;\n\n param\n Number = Sg | Pl ;\n\n oper\n det : Number -> Str -> {s : Number => Str} -> {s : Str ; n : Number} = \n \\n,d,cn -> {\n s = d ++ cn.s ! n ;\n n = n\n } ;\n regNoun : Str -> {s : Number => Str} = \n \\vino -> {s = table {Sg => vino ; Pl => vino + \"j\"}\n\t} ;\n regAdj : Str -> {s : Number => Str} =\n \\nova -> {s = table {Sg => nova ; Pl => nova + \"j\"}\n } ;\n copula : Number => Str = \\\\_ => \"estas\" ;\n}\n \n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsFin.gf", "content": "--# -path=.:present\n\n-- (c) 2009 Aarne Ranta under LGPL\n\nconcrete FoodsFin of Foods = FoodsI with \n (Syntax = SyntaxFin),\n (LexFoods = LexFoodsFin) ;\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsFre.gf", "content": "--# -path=.:../foods:present\n\nconcrete FoodsFre of Foods = open SyntaxFre, ParadigmsFre in {\n\n\tflags coding = utf8 ;\n\t\n\tlincat\n\t\tComment = Utt ;\n\t\tItem = NP ;\n\t\tKind = CN ;\n\t\tQuality = AP ;\n\t\n\tlin\n\t\tPred item quality = mkUtt (mkCl item quality) ;\n\t\tThis kind = mkNP this_QuantSg kind ;\n\t\tThat kind = mkNP that_QuantSg kind ;\n\t\tThese kind = mkNP these_QuantPl kind ;\n\t\tThose kind = mkNP those_QuantPl kind ;\n\t\tMod quality kind = mkCN quality kind ;\n\t\tVery quality = mkAP very_AdA quality ;\n\t\t\n\t\tWine = mkCN (mkN \"vin\" masculine) ;\n\t\tPizza = mkCN (mkN \"pizza\" feminine) ;\n\t\tCheese = mkCN (mkN \"fromage\" masculine) ;\n\t\tFish = mkCN (mkN \"poisson\" masculine) ;\n\t\tFresh = mkAP (mkA \"frais\" \"fraîche\" \"frais\" \"fraîchement\") ;\n\t\tWarm = mkAP (mkA \"chaud\") ;\n\t\tItalian = mkAP (mkA \"italien\") ;\n\t\tExpensive = mkAP (mkA \"cher\") ;\n\t\tDelicious = mkAP (mkA \"délicieux\") ;\n\t\tBoring = mkAP (mkA \"ennuyeux\") ;\n\t}" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsGer.gf", "content": "--# -path=.:present\n\n-- (c) 2009 Aarne Ranta under LGPL\n\nconcrete FoodsGer of Foods = FoodsI with \n (Syntax = SyntaxGer),\n (LexFoods = LexFoodsGer) ;\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsHeb.gf", "content": "--# -path=alltenses\n\n--(c) 2009 Dana Dannells\n-- Licensed under LGPL\n\nconcrete FoodsHeb of Foods = open Prelude in {\n \n flags coding=utf8 ;\n\n lincat\n Comment = SS ;\n Quality = {s: Number => Species => Gender => Str} ; \n Kind = {s : Number => Species => Str ; g : Gender ; mod : Modified} ; \n Item = {s : Str ; g : Gender ; n : Number ; sp : Species ; mod : Modified} ; \n \n \n lin\n Pred item quality = ss (item.s ++ quality.s ! item.n ! Indef ! item.g ) ; \n This = det Sg Def \"הזה\" \"הזאת\"; \n That = det Sg Def \"ההוא\" \"ההיא\" ; \n These = det Pl Def \"האלה\" \"האלה\" ; \n Those = det Pl Def \"ההם\" \"ההן\" ; \n Mod quality kind = {\n\ts = \\\\n,sp => kind.s ! n ! sp ++ quality.s ! n ! sp ! kind.g;\n\tg = kind.g ;\n\tmod = T\n\t} ; \n Wine = regNoun \"יין\" \"יינות\" Masc ; \n Cheese = regNoun \"גבינה\" \"גבינות\" Fem ; \n Fish = regNoun \"דג\" \"דגים\" Masc ; \n Pizza = regNoun \"פיצה\" \"פיצות\" Fem ; \n Very qual = {s = \\\\g,n,sp => \"מאוד\" ++ qual.s ! g ! n ! sp} ;\n Fresh = regAdj \"טרי\" ; \n Warm = regAdj \"חם\" ;\n Italian = regAdj2 \"איטלקי\" ;\n Expensive = regAdj \"יקר\" ; \n Delicious = regAdj \"טעים\" ; \n Boring = regAdj2 \"משעמם\"; \n\n param \n Number = Sg | Pl ;\n Gender = Masc | Fem ;\n Species = Def | Indef ; \n Modified = T | F ;\n\n oper\n\tNoun : Type = {s : Number => Species => Str ; g : Gender ; mod : Modified } ;\n \tAdj : Type = {s : Number => Species => Gender => Str} ;\n\n det : Number -> Species -> Str -> Str -> Noun -> \n\t{s : Str ; g :Gender ; n : Number ; sp : Species ; mod : Modified} = \n \\n,sp,m,f,cn -> {\n\t s = case cn.mod of { _ => cn.s ! n ! sp ++ case cn.g of {Masc => m ; Fem => f} };\n\t g = cn.g ; \n n = n ;\n\t sp = sp ;\n\t mod = cn.mod\n } ;\n \n\tnoun : (gvina,hagvina,gvinot,hagvinot : Str) -> Gender -> Noun = \n \t\t\\gvina,hagvina,gvinot,hagvinot,g -> {\n \ts = table {\n \t\tSg => table {\n \t\t\tIndef => gvina ;\n \t\t\tDef => hagvina \n \t\t} ;\n \t\tPl => table {\n \t\t\tIndef => gvinot ;\n \t\t\tDef => hagvinot \n \t\t} \n \t \t} ;\n \tg = g ;\n\t\tmod = F \n } ;\n\n\tregNoun : Str -> Str -> Gender -> Noun = \n\t \\gvina,gvinot, g -> \n\t\tnoun gvina (defH gvina) gvinot (defH gvinot) g ; \n\n defH : Str -> Str = \\cn ->\n\tcase cn of {_ => \"ה\" + cn};\t\n\n replaceLastLetter : Str -> Str = \\c ->\n\t case c of {\"ף\" => \"פ\" ; \"ם\" => \"מ\" ; \"ן\" => \"נ\" ; \"ץ\" => \"צ\" ; \"ך\" => \"כ\"; _ => c} ;\n\t \n adjective : (_,_,_,_ : Str) -> Adj = \n \\tov,tova,tovim,tovot -> {\n s = table {\n Sg => table { \n\t\t\tIndef => table { Masc => tov ; Fem => tova } ; \n\t\t\tDef => table { Masc => defH tov ; Fem => defH tova } \n \t\t} ; \n Pl => table { \n\t\t\tIndef => table {Masc => tovim ; Fem => tovot } ; \n\t\t\tDef => table { Masc => defH tovim ; Fem => defH tovot } \n \t\t}\n\t}\n } ;\n \n regAdj : Str -> Adj = \\tov ->\n\tcase tov of { to + c@? =>\n\tadjective tov (to + replaceLastLetter (c) + \"ה\" ) (to + replaceLastLetter (c) +\"ים\" ) (to + replaceLastLetter (c) + \"ות\" )};\t \n \n regAdj2 : Str -> Adj = \\italki ->\n \tcase italki of { italk+ c@? => \n adjective italki (italk + replaceLastLetter (c) +\"ת\" ) (italk + replaceLastLetter (c)+ \"ים\" ) (italk + replaceLastLetter (c) + \"ות\" )};\n\n} -- FoodsHeb \n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsHin.gf", "content": "-- (c) 2010 Vikash Rauniyar under LGPL\n\nconcrete FoodsHin of Foods = {\n\n flags coding=utf8 ;\n\n param\n Gender = Masc | Fem ;\n Number = Sg | Pl ;\n lincat\n Comment = {s : Str} ;\n Item = {s : Str ; g : Gender ; n : Number} ;\n Kind = {s : Number => Str ; g : Gender} ;\n Quality = {s : Gender => Number => Str} ;\n lin\n Pred item quality = {\n s = item.s ++ quality.s ! item.g ! item.n ++ copula item.n\n } ;\n This kind = {s = \"यह\" ++ kind.s ! Sg ; g = kind.g ; n = Sg} ;\n That kind = {s = \"वह\" ++ kind.s ! Sg ; g = kind.g ; n = Sg} ;\n These kind = {s = \"ये\" ++ kind.s ! Pl ; g = kind.g ; n = Pl} ;\n Those kind = {s = \"वे\" ++ kind.s ! Pl ; g = kind.g ; n = Pl} ;\n Mod quality kind = {\n s = \\\\n => quality.s ! kind.g ! n ++ kind.s ! n ; \n g = kind.g\n } ;\n Wine = regN \"मदिरा\" ;\n Cheese = regN \"पनीर\" ;\n Fish = regN \"मछली\" ;\n Pizza = regN \"पिज़्ज़ा\" ;\n Very quality = {s = \\\\g,n => \"अति\" ++ quality.s ! g ! n} ;\n Fresh = regAdj \"ताज़ा\" ;\n Warm = regAdj \"गरम\" ;\n Italian = regAdj \"इटली\" ; \n Expensive = regAdj \"बहुमूल्य\" ;\n Delicious = regAdj \"स्वादिष्ट\" ;\n Boring = regAdj \"अरुचिकर\" ;\n\n oper\n mkN : Str -> Str -> Gender -> {s : Number => Str ; g : Gender} = \n \\s,p,g -> {\n s = table {\n Sg => s ;\n Pl => p\n } ;\n g = g\n } ;\n\n regN : Str -> {s : Number => Str ; g : Gender} = \\s -> case s of {\n lark + \"ा\" => mkN s (lark + \"े\") Masc ;\n lark + \"ी\" => mkN s (lark + \"ीयँा\") Fem ;\n _ => mkN s s Masc \n } ;\n\n mkAdj : Str -> Str -> Str -> {s : Gender => Number => Str} = \\ms,mp,f -> {\n s = table {\n Masc => table {\n Sg => ms ;\n Pl => mp\n } ;\n Fem => \\\\_ => f\n }\n } ;\n\n regAdj : Str -> {s : Gender => Number => Str} = \\a -> case a of {\n acch + \"ा\" => mkAdj a (acch + \"े\") (acch + \"ी\") ;\n _ => mkAdj a a a\n } ;\n\n copula : Number -> Str = \\n -> case n of {\n Sg => \"है\" ;\n Pl => \"हैं\"\n } ;\n\n }\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsI.gf", "content": "-- (c) 2009 Aarne Ranta under LGPL\n\nincomplete concrete FoodsI of Foods = \n open Syntax, LexFoods in {\n lincat\n Comment = Utt ; \n Item = NP ;\n Kind = CN ;\n Quality = AP ;\n lin\n Pred item quality = mkUtt (mkCl item quality) ;\n This kind = mkNP this_Det kind ;\n That kind = mkNP that_Det kind ;\n These kind = mkNP these_Det kind ;\n Those kind = mkNP those_Det kind ;\n Mod quality kind = mkCN quality kind ;\n Very quality = mkAP very_AdA quality ;\n\n Wine = mkCN wine_N ;\n Pizza = mkCN pizza_N ;\n Cheese = mkCN cheese_N ;\n Fish = mkCN fish_N ;\n Fresh = mkAP fresh_A ;\n Warm = mkAP warm_A ;\n Italian = mkAP italian_A ;\n Expensive = mkAP expensive_A ;\n Delicious = mkAP delicious_A ;\n Boring = mkAP boring_A ;\n}\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsIce.gf", "content": "--# -path=.:prelude\n\n-- (c) 2009 Martha Dis Brandt under LGPL\n\nconcrete FoodsIce of Foods = open Prelude in {\n\n flags coding=utf8;\n\n lincat\n Comment = SS ;\n Quality = {s : Gender => Number => Defin => Str} ;\n Kind = {s : Number => Str ; g : Gender} ;\n Item = {s : Str ; g : Gender ; n : Number} ;\n\n lin\n Pred item quality = ss (item.s ++ copula item.n ++ quality.s ! item.g ! item.n ! Ind) ;\n This, That = det Sg \"þessi\" \"þessi\" \"þetta\" ;\n These, Those = det Pl \"þessir\" \"þessar\" \"þessi\" ;\n Mod quality kind = { s = \\\\n => quality.s ! kind.g ! n ! Def ++ kind.s ! n ; g = kind.g } ;\n Wine = noun \"vín\" \"vín\" Neutr ;\n Cheese = noun \"ostur\" \"ostar\" Masc ;\n Fish = noun \"fiskur\" \"fiskar\" Masc ;\n -- the word \"pizza\" is more commonly used in Iceland, but \"flatbaka\" is the Icelandic word for it\n Pizza = noun \"flatbaka\" \"flatbökur\" Fem ;\n Very qual = {s = \\\\g,n,defOrInd => \"mjög\" ++ qual.s ! g ! n ! defOrInd } ;\n Fresh = regAdj \"ferskur\" ;\n Warm = regAdj \"heitur\" ;\n Boring = regAdj \"leiðinlegur\" ;\n -- the order of the given adj forms is: mSg fSg nSg mPl fPl nPl mSgDef f/nSgDef _PlDef\n Italian = adjective \"ítalskur\" \"ítölsk\" \"ítalskt\" \"ítalskir\" \"ítalskar\" \"ítölsk\" \"ítalski\" \"ítalska\" \"ítalsku\" ;\n Expensive = adjective \"dýr\" \"dýr\" \"dýrt\" \"dýrir\" \"dýrar\" \"dýr\" \"dýri\" \"dýra\" \"dýru\" ;\n Delicious = adjective \"ljúffengur\" \"ljúffeng\" \"ljúffengt\" \"ljúffengir\" \"ljúffengar\" \"ljúffeng\" \"ljúffengi\" \"ljúffenga\" \"ljúffengu\" ;\n\n param\n Number = Sg | Pl ;\n Gender = Masc | Fem | Neutr ;\n Defin = Ind | Def ;\n\n oper\n det : Number -> Str -> Str -> Str -> {s : Number => Str ; g : Gender} ->\n {s : Str ; g : Gender ; n : Number} =\n \\n,masc,fem,neutr,cn -> {\n s = case cn.g of {Masc => masc ; Fem => fem; Neutr => neutr } ++ cn.s ! n ;\n g = cn.g ;\n n = n\n } ;\n\n noun : Str -> Str -> Gender -> {s : Number => Str ; g : Gender} =\n \\man,men,g -> {\n s = table {\n Sg => man ;\n Pl => men\n } ;\n g = g\n } ;\n\n adjective : (x1,_,_,_,_,_,_,_,x9 : Str) -> {s : Gender => Number => Defin => Str} =\n \\ferskur,fersk,ferskt,ferskir,ferskar,fersk_pl,ferski,ferska,fersku -> {\n s = \\\\g,n,t => case of {\n < Masc, Sg, Ind > => ferskur ;\n < Masc, Pl, Ind > => ferskir ;\n < Fem, Sg, Ind > => fersk ;\n < Fem, Pl, Ind > => ferskar ;\n < Neutr, Sg, Ind > => ferskt ;\n < Neutr, Pl, Ind > => fersk_pl;\n < Masc, Sg, Def > => ferski ;\n < Fem, Sg, Def > | < Neutr, Sg, Def > => ferska ;\n < _ , Pl, Def > => fersku\n }\n } ;\n\n regAdj : Str -> {s : Gender => Number => Defin => Str} = \\ferskur ->\n let fersk = Predef.tk 2 ferskur\n in adjective\n ferskur fersk (fersk + \"t\")\n (fersk + \"ir\") (fersk + \"ar\") fersk\n (fersk + \"i\") (fersk + \"a\") (fersk + \"u\") ;\n\n copula : Number -> Str =\n \\n -> case n of {\n Sg => \"er\" ;\n Pl => \"eru\"\n } ;\n}\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsIta.gf", "content": "--# -path=.:present\n\n-- (c) 2009 Aarne Ranta under LGPL\n\nconcrete FoodsIta of Foods = FoodsI with \n (Syntax = SyntaxIta),\n (LexFoods = LexFoodsIta) ;\n\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsJpn.gf", "content": "--# -path=.:../lib/src/prelude\n\n-- (c) 2009 Zofia Stankiewicz under LGPL\n\nconcrete FoodsJpn of Foods = open Prelude in {\n\nflags coding=utf8 ;\n\n lincat\n Comment = {s: Style => Str};\n Quality = {s: AdjUse => Str ; t: AdjType} ;\n Kind = {s : Number => Str} ; \n Item = {s : Str ; n : Number} ; \n\n lin\n Pred item quality = {s = case quality.t of {\n IAdj => table {Plain => item.s ++ quality.s ! APred ; Polite => item.s ++ quality.s ! APred ++ copula ! Polite ! item.n } ;\n NaAdj => \\\\p => item.s ++ quality.s ! APred ++ copula ! p ! item.n } \n } ;\n This = det Sg \"この\" ;\n That = det Sg \"その\" ;\n These = det Pl \"この\" ;\n Those = det Pl \"その\" ;\n Mod quality kind = {s = \\\\n => quality.s ! Attr ++ kind.s ! n} ;\n Wine = regNoun \"ワインは\" ;\n Cheese = regNoun \"チーズは\" ;\n Fish = regNoun \"魚は\" ;\n Pizza = regNoun \"ピザは\" ;\n Very quality = {s = \\\\a => \"とても\" ++ quality.s ! a ; t = quality.t } ;\n Fresh = adj \"新鮮な\" \"新鮮\";\n Warm = regAdj \"あたたかい\" ;\n Italian = adj \"イタリアの\" \"イタリアのもの\";\n Expensive = regAdj \"たかい\" ;\n Delicious = regAdj \"おいしい\" ;\n Boring = regAdj \"つまらない\" ;\n\n param\n Number = Sg | Pl ;\n AdjUse = Attr | APred ; -- na-adjectives have different forms as noun attributes and predicates\n Style = Plain | Polite ; -- for phrase types\n AdjType = IAdj | NaAdj ; -- IAdj can form predicates without the copula, NaAdj cannot\n\n oper\n det : Number -> Str -> {s : Number => Str} -> {s : Str ; n : Number} = \n \\n,d,cn -> {\n s = d ++ cn.s ! n ;\n n = n\n } ;\n noun : Str -> Str -> {s : Number => Str} = \n \\sakana,sakana -> {s = \\\\_ => sakana } ;\n\n regNoun : Str -> {s : Number => Str} = \n \\sakana -> noun sakana sakana ;\n\n adj : Str -> Str -> {s : AdjUse => Str ; t : AdjType} =\n \\chosenna, chosen -> {\n s = table { \n Attr => chosenna ;\n APred => chosen\n } ;\n t = NaAdj \n } ;\n \n regAdj : Str -> {s: AdjUse => Str ; t : AdjType} =\\akai -> {\n s = \\\\_ => akai ; t = IAdj} ;\n\n copula : Style => Number => Str = \n table { \n Plain => \\\\_ => \"だ\" ;\n Polite => \\\\_ => \"です\" } ;\n\n} \n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsLav.gf", "content": "--# -path=.:prelude\n\n-- (c) 2009 Inese Bernsone under LGPL\n\nconcrete FoodsLav of Foods = open Prelude in {\n\n flags\n coding=utf8 ;\n \n lincat\n Comment = SS ; \n Quality = {s : Q => Gender => Number => Defin => Str } ; \n Kind = {s : Number => Str ; g : Gender} ; \n Item = {s : Str ; g : Gender ; n : Number } ; \n\n lin\n Pred item quality = ss (item.s ++ {- copula item.n -} \"ir\" ++ quality.s ! Q1 ! item.g ! item.n ! Ind ) ;\n This = det Sg \"šis\" \"šī\" ;\n That = det Sg \"tas\" \"tā\" ;\n These = det Pl \"šie\" \"šīs\" ;\n Those = det Pl \"tie\" \"tās\" ;\n Mod quality kind = {s = \\\\n => quality.s ! Q1 ! kind.g ! n ! Def ++ kind.s ! n ; g = kind.g } ;\n Wine = noun \"vīns\" \"vīni\" Masc ;\n Cheese = noun \"siers\" \"sieri\" Masc ;\n Fish = noun \"zivs\" \"zivis\" Fem ;\n Pizza = noun \"pica\" \"picas\" Fem ;\n Very qual = {s = \\\\q,g,n,spec => \"ļoti\" ++ qual.s ! Q2 ! g ! n ! spec }; \n \n Fresh = adjective \"svaigs\" \"svaiga\" \"svaigi\" \"svaigas\" \"svaigais\" \"svaigā\" \"svaigie\" \"svaigās\" ;\n Warm = regAdj \"silts\" ;\n Italian = specAdj \"itāļu\" (regAdj \"itālisks\") ;\n Expensive = regAdj \"dārgs\" ;\n Delicious = regAdj \"garšīgs\" ;\n Boring = regAdj \"garlaicīgs\" ;\n\n param\n Number = Sg | Pl ;\n Gender = Masc | Fem ;\n Defin = Ind | Def ;\n Q = Q1 | Q2 ;\n\n oper\n det : Number -> Str -> Str -> {s : Number => Str ; g : Gender} -> \n {s : Str ; g : Gender ; n : Number} = \n \\n,m,f,cn -> {\n s = case cn.g of {Masc => m ; Fem => f} ++ cn.s ! n ;\n g = cn.g ;\n n = n\n } ;\n noun : Str -> Str -> Gender -> {s : Number => Str ; g : Gender} = \n \\man,men,g -> {\n s = table {\n Sg => man ;\n Pl => men \n } ;\n g = g\n } ;\n adjective : (_,_,_,_,_,_,_,_ : Str) -> {s : Q => Gender => Number => Defin => Str} = \n \\skaists,skaista,skaisti,skaistas,skaistais,skaistaa,skaistie,skaistaas -> {\n s = table {\n\t\t _ => table {\n Masc => table {\n Sg => table {Ind => skaists ; Def => skaistais} ;\n Pl => table {Ind => skaisti ; Def => skaistie}\n } ; \n Fem => table {\n Sg => table {Ind => skaista ; Def => skaistaa} ;\n Pl => table {Ind => skaistas ; Def => skaistaas} \n }\n } \n\t\t }\n } ;\n \n {- irregAdj : Str -> {s : Gender => Number => Defin => Str} = \\itaalju ->\n let itaalju = itaalju\n in adjective itaalju (itaalju) (itaalju) (itaalju) (itaalju) (itaalju) (itaalju) (itaalju) ; -}\n \n regAdj : Str -> {s : Q => Gender => Number => Defin => Str} = \\skaists ->\n let skaist = init skaists \n in adjective skaists (skaist + \"a\") (skaist + \"i\") (skaist + \"as\") (skaist + \"ais\") (skaist + \"ā\") (skaist + \"ie\") (skaist + \"ās\");\n\n Adjective : Type = {s : Q => Gender => Number => Defin => Str} ;\n\n\tspecAdj : Str -> Adjective -> Adjective = \\s,a -> {\n s = table {\n Q2 => a.s ! Q1 ;\n Q1 => \\\\_,_,_ => s\n }\t\t\n\t } ;\n\t\n\t}\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsMlt.gf", "content": "-- (c) 2013 John J. Camilleri under LGPL\n\nconcrete FoodsMlt of Foods = open Prelude in {\n flags coding=utf8 ;\n\n lincat\n Comment = SS ;\n Quality = {s : Gender => Number => Str} ;\n Kind = {s : Number => Str ; g : Gender} ;\n Item = {s : Str ; g : Gender ; n : Number} ;\n\n lin\n -- Pred item quality = ss (item.s ++ copula item.n item.g ++ quality.s ! item.g ! item.n) ;\n Pred item quality = ss (item.s ++ quality.s ! item.g ! item.n) ;\n\n This kind = det Sg \"dan\" \"din\" kind ;\n That kind = det Sg \"dak\" \"dik\" kind ;\n These kind = det Pl \"dawn\" \"\" kind ;\n Those kind = det Pl \"dawk\" \"\" kind ;\n\n Mod quality kind = {\n s = \\\\n => kind.s ! n ++ quality.s ! kind.g ! n ;\n g = kind.g\n } ;\n\n Wine = noun \"inbid\" \"inbejjed\" Masc ;\n Cheese = noun \"ġobon\" \"ġobniet\" Masc ;\n Fish = noun \"ħuta\" \"ħut\" Fem ;\n Pizza = noun \"pizza\" \"pizzez\" Fem ;\n\n Very qual = {s = \\\\g,n => qual.s ! g ! n ++ \"ħafna\"} ;\n\n Warm = adjective \"sħun\" \"sħuna\" \"sħan\" ;\n Expensive = adjective \"għali\" \"għalja\" \"għaljin\" ;\n Delicious = adjective \"tajjeb\" \"tajba\" \"tajbin\" ;\n Boring = uniAdj \"tad-dwejjaq\" ;\n Fresh = regAdj \"frisk\" ;\n Italian = regAdj \"Taljan\" ;\n\n param\n Number = Sg | Pl ;\n Gender = Masc | Fem ;\n\n oper\n --Create an adjective (full function)\n --Params: Sing Masc, Sing Fem, Plural\n adjective : (_,_,_ : Str) -> {s : Gender => Number => Str} = \\iswed,sewda,suwed -> {\n s = table {\n\tMasc => table {\n\t Sg => iswed ;\n\t Pl => suwed\n\t } ;\n\tFem => table {\n\t Sg => sewda ;\n\t Pl => suwed\n\t }\n\t}\n } ;\n\n --Create a regular adjective\n --Param: Sing Masc\n regAdj : Str -> {s : Gender => Number => Str} = \\frisk ->\n adjective frisk (frisk + \"a\") (frisk + \"i\") ;\n\n --Create a \"uni-adjective\" eg tal-buzz\n --Param: Sing Masc\n uniAdj : Str -> {s : Gender => Number => Str} = \\uni ->\n adjective uni uni uni ;\n\n --Create a noun\n --Params: Singular, Plural, Gender (inherent)\n noun : Str -> Str -> Gender -> {s : Number => Str ; g : Gender} = \\ktieb,kotba,g -> {\n s = table {\n\tSg => ktieb ;\n\tPl => kotba\n\t} ;\n g = g\n } ;\n\n --Copula is a linking verb\n --Params: Number, Gender\n -- copula : Number -> Gender -> Str = \\n,g -> case n of {\n -- Sg => case g of { Masc => \"huwa\" ; Fem => \"hija\" } ;\n -- Pl => \"huma\"\n -- } ;\n\n --Create an article, taking into account first letter of next word\n article = pre {\n \"a\"|\"e\"|\"i\"|\"o\"|\"u\" => \"l-\" ;\n --cons@(\"ċ\"|\"d\"|\"n\"|\"r\"|\"s\"|\"t\"|\"x\"|\"ż\") => \"i\" + cons + \"-\" ;\n _ => \"il-\"\n } ;\n\n --Create a determinant\n --Params: Sg/Pl, Masc, Fem\n det : Number -> Str -> Str -> {s : Number => Str ; g : Gender} -> {s : Str ; g : Gender ; n : Number} = \\n,m,f,cn -> {\n s = case n of {\n\tSg => case cn.g of {Masc => m ; Fem => f}; --string\n\tPl => m --default to masc\n\t} ++ article ++ cn.s ! n ;\n g = cn.g ; --gender\n n = n --number\n } ;\n\n}\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsMon.gf", "content": "--# -path=.:/GF/lib/src/prelude\n\n-- (c) 2009 Nyamsuren Erdenebadrakh under LGPL\n\nconcrete FoodsMon of Foods = open Prelude in {\n flags coding=utf8;\n\n lincat\n Comment, Quality = SS ; \n\tKind = {s : Number => Str} ; \n Item = {s : Str ; n : Number} ; \n\n lin\n\tPred item quality = ss (item.s ++ \"бол\" ++ quality.s) ;\n\tThis = det Sg \"энэ\" ;\n\tThat = det Sg \"тэр\" ;\n\tThese = det Pl \"эдгээр\" ;\n\tThose = det Pl \"тэдгээр\" ;\n\tMod quality kind = {s = \\\\n => quality.s ++ kind.s ! n} ;\n\tWine = regNoun \"дарс\" ;\n\tCheese = regNoun \"бяслаг\" ;\n\tFish = regNoun \"загас\" ;\n\tPizza = regNoun \"пицца\" ;\n\tVery = prefixSS \"маш\" ;\n\tFresh = ss \"шинэ\" ;\n\tWarm = ss \"халуун\" ;\n\tItalian = ss \"итали\" ;\n\tExpensive = ss \"үнэтэй\" ;\n\tDelicious = ss \"амттай\" ;\n\tBoring = ss \"амтгүй\" ;\n\n param\n Number = Sg | Pl ;\n\n oper\n\tdet : Number -> Str -> {s : Number => Str} -> {s : Str ; n : Number} = \n\t\\n,d,cn -> {\n\t\ts = d ++ cn.s ! n ;\n\t\tn = n\n\t} ;\n \t\n\tregNoun : Str -> {s : Number => Str} = \n\t\\x -> {s = table {\n\t\tSg => x ; \n\t\tPl => x + \"нууд\"}\n\t\t} ;\n\t}\n\t \n \n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsNep.gf", "content": "-- (c) 2011 Dinesh Simkhada under LGPL\n\nconcrete FoodsNep of Foods = {\n\n flags coding = utf8 ;\n\n lincat\n Comment, Quality = {s : Str} ; \n Kind = {s : Number => Str} ; \n Item = {s : Str ; n : Number} ; \n \n lin\n Pred item quality = \n {s = item.s ++ quality.s ++ copula ! item.n} ;\n \n This = det Sg \"यो\" ;\n That = det Sg \"त्यो\" ;\n These = det Pl \"यी\" ;\n Those = det Pl \"ती\" ;\n Mod quality kind = \n {s = \\\\n => quality.s ++ kind.s ! n} ;\n \n Wine = regNoun \"रक्सी\" ;\n Cheese = regNoun \"चिज\" ;\n Fish = regNoun \"माछा\" ;\n Pizza = regNoun \"पिज्जा\" ;\n Very a = {s = \"धेरै\" ++ a.s} ;\n Fresh = adj \"ताजा\" ;\n Warm = adj \"तातो\" ;\n Italian = adj \"इटालियन\" ;\n Expensive = adj \"महँगो\" | adj \"बहुमूल्य\" ;\n Delicious = adj \"स्वादिष्ट\" | adj \"मीठो\" ;\n Boring = adjPl \"नमिठो\" ;\n \n param\n Number = Sg | Pl ;\n \n oper\n det : Number -> Str -> \n {s : Number => Str} -> {s : Str ; n : Number} = \n \\n,det,noun -> {s = det ++ noun.s ! n ; n = n} ;\n \n noun : Str -> Str -> {s : Number => Str} = \n \\man,men -> {s = table {Sg => man ; Pl => men}} ;\n \n regNoun : Str -> {s : Number => Str} = \n \\car -> noun car (car + \"हरु\") ;\n \n adjPl : Str -> {s : Str} = \\a -> case a of {\n bor + \"ठो\" => adj (bor + \"ठा\") ;\n _ => adj a\n } ;\n \n adj : Str -> {s : Str} = \n \\cold -> {s = cold} ;\n \n copula : Number => Str = \n table {Sg => \"छ\" ; Pl => \"छन्\"} ;\n}\n\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsOri.gf", "content": "concrete FoodsOri of Foods = {\r\n\r\nflags coding = utf8 ;\r\n\r\nlincat\r\n Comment = Str;\r\n Item = Str;\r\n Kind = Str;\r\n Quality = Str;\r\n\r\nlin\r\n Pred item quality = item ++ quality ++ \"ଅଟେ\";\r\n This kind = \"ଏଇ\" ++ kind;\r\n That kind = \"ସେଇ\" ++ kind;\r\n These kind = \"ଏଇ\" ++ kind ++ \"ଗୁଡିକ\" ;\r\n Those kind = \"ସେଇ\" ++ kind ++ \"ଗୁଡିକ\" ;\r\n Mod quality kind = quality ++ kind;\r\n Wine = \"ମଦ\";\r\n Cheese = \"ଛେନା\";\r\n Fish = \"ମାଛ\";\r\n Pizza = \"ପିଜଜ଼ା\" ;\r\n Very quality = \"ଅତି\" ++ quality;\r\n Fresh = \"ତାଜା\";\r\n Warm = \"ଗରମ\";\r\n Italian = \"ଇଟାଲି\";\r\n Expensive = \"ମୁଲ୍ୟବାନ୍\";\r\n Delicious = \"ସ୍ଵାଦିସ୍ଟ \";\r\n Boring = \"ଅରୁଚିକର\";\r\n\r\n}\r\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsPes.gf", "content": "concrete FoodsPes of Foods = {\r\n\r\n flags optimize=noexpand ; coding=utf8 ;\r\n\t \r\n lincat\r\n Comment = {s : Str} ;\r\n\t\tQuality = {s : Add => Str; prep : Str} ;\r\n Kind = {s : Add => Number => Str ; prep : Str};\r\n Item = {s : Str ; n : Number};\r\n lin\r\n Pred item quality = {s = item.s ++ quality.s ! Indep ++ copula ! item.n} ;\r\n This = det Sg \"این\" ;\r\n That = det Sg \"آن\" ;\r\n These = det Pl \"این\" ;\r\n Those = det Pl \"آن\" ;\r\n \r\n Mod quality kind = {s = \\\\a,n => kind.s ! Attr ! n ++ kind.prep ++ quality.s ! a ; \r\n prep = quality.prep \r\n };\r\n Wine = regN \"شراب\" ; \r\n Cheese = regN \"پنیر\" ;\r\n Fish = regN \"ماهى\" ;\r\n Pizza = regN \"پیتزا\" ;\r\n Very a = {s = \\\\at => \"خیلی\" ++ a.s ! at ; prep = a.prep} ;\r\n Fresh = adj \"تازه\" ;\r\n Warm = adj \"گرم\" ;\r\n Italian = adj \"ایتالیایی\" ;\r\n Expensive = adj \"گران\" ;\r\n Delicious = adj \"لذىذ\" ;\r\n Boring = adj \"ملال آور\" ; -- it must be written as ملال آور. \r\n \r\n param\r\n Number = Sg | Pl ;\r\n\t\tAdd = Indep | Attr ;\r\n oper\r\n det : Number -> Str -> {s: Add => Number => Str ; prep : Str} -> {s : Str ; n: Number} =\r\n \\n,det,noun -> {s = det ++ noun.s ! Indep ! n ; n = n };\r\n \r\n noun : (x1,_,_,x4 : Str) -> {s : Add => Number => Str ; prep : Str} = \\pytzA, pytzAy, pytzAhA,pr -> \r\n {s = \\\\a,n => case of\r\n\t\t { => pytzA ; => pytzAhA ;\r\n \t\t\t\t =>pytzA ; => pytzAhA + \"ى\" };\r\n\t\t prep = pr\r\n\t\t };\t\t \r\n \r\n regN : Str -> {s: Add => Number => Str ; prep : Str} = \\mrd -> \r\n\t\tcase mrd of \r\n\t\t{ _ + (\"ا\"|\"ه\"|\"ى\"|\"و\"|\"\") => noun mrd (mrd+\"ى\") (mrd + \"ها\") \"\";\r\n\t\t _ => noun mrd mrd (mrd + \"ها\") \"e\"\r\n\t\t};\r\n \r\n adj : Str -> {s : Add => Str; prep : Str} = \\tAzh -> \r\n\t\tcase tAzh of \r\n\t\t{ _ + (\"ا\"|\"ه\"|\"ى\"|\"و\"|\"\") => mkAdj tAzh (tAzh ++ \"ى\") \"\" ;\r\n\t\t _ => mkAdj tAzh tAzh \"ه\"\r\n };\r\n\t\t\r\n\t\tmkAdj : Str -> Str -> Str -> {s : Add => Str; prep : Str} = \\tAzh, tAzhy, pr ->\r\n\t\t{s = table {Indep => tAzh;\r\n\t\t Attr => tAzhy};\r\n\t\t prep = pr \t\t\t\r\n\t\t};\r\n copula : Number => Str = table {Sg => \"است\"; Pl => \"هستند\"};\r\n \r\n}" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsPor.gf", "content": "-- (c) 2009 Rami Shashati under LGPL\n\nconcrete FoodsPor of Foods = open Prelude in {\n flags coding=utf8;\n\n\tlincat\n\t Comment = {s : Str} ;\n\t Quality = {s : Gender => Number => Str} ;\n\t Kind = {s : Number => Str ; g : Gender} ;\n\t Item = {s : Str ; n : Number ; g : Gender } ;\n\n\tlin\n\t Pred item quality =\n\t {s = item.s ++ copula ! item.n ++ quality.s ! item.g ! item.n } ;\n\t This = det Sg (table {Masc => \"este\" ; Fem => \"esta\"}) ;\n\t That = det Sg (table {Masc => \"esse\" ; Fem => \"essa\"}) ;\n\t These = det Pl (table {Masc => \"estes\" ; Fem => \"estas\"}) ;\n\t Those = det Pl (table {Masc => \"esses\" ; Fem => \"essas\"}) ;\n\n\t Mod quality kind = { s = \\\\n => kind.s ! n ++ quality.s ! kind.g ! n ; g = kind.g } ;\n\n\t Wine = regNoun \"vinho\" Masc ;\n\t Cheese = regNoun \"queijo\" Masc ;\n\t Fish = regNoun \"peixe\" Masc ;\n\t Pizza = regNoun \"pizza\" Fem ;\n\n Very a = { s = \\\\g,n => \"muito\" ++ a.s ! g ! n } ;\n\n Fresh = mkAdjReg \"fresco\" ;\n Warm = mkAdjReg \"quente\" ;\n Italian = mkAdjReg \"Italiano\" ;\n Expensive = mkAdjReg \"caro\" ;\n Delicious = mkAdjReg \"delicioso\" ;\n Boring = mkAdjReg \"chato\" ;\n\n\tparam\n\t Number = Sg | Pl ;\n\t Gender = Masc | Fem ;\n\n\toper\n\t QualityT : Type = {s : Gender => Number => Str} ;\n\n\t mkAdj : (_,_,_,_ : Str) -> QualityT = \\bonito,bonita,bonitos,bonitas -> {\n\t \ts = table {\n\t \t\tMasc => table { Sg => bonito ; Pl => bonitos } ;\n\t \t\tFem => table { Sg => bonita ; Pl => bonitas }\n\t } ;\n\t } ;\n\n\t -- regular pattern\n\t adjSozinho : Str -> QualityT = \\sozinho ->\n let sozinh = Predef.tk 1 sozinho\n in mkAdj sozinho (sozinh + \"a\") (sozinh + \"os\") (sozinh + \"as\") ;\n\n -- for gender-independent adjectives\n adjUtil : Str -> Str -> QualityT = \\util,uteis ->\n mkAdj util util uteis uteis ;\n\n -- smart paradigm for adjcetives\n mkAdjReg : Str -> QualityT = \\a -> case last a of {\n \t\"o\" => adjSozinho a ;\n \"e\" => adjUtil a (a + \"s\")\n } ;\n\n ItemT : Type = {s : Str ; n : Number ; g : Gender } ;\n\n det : Number -> (Gender => Str) -> KindT -> ItemT =\n \\num,det,noun -> {s = det ! noun.g ++ noun.s ! num ; n = num ; g = noun.g } ;\n\n\t KindT : Type = {s : Number => Str ; g : Gender} ;\n\n\t noun : Str -> Str -> Gender -> KindT =\n\t \\animal,animais,gen -> {s = table {Sg => animal ; Pl => animais} ; g = gen } ;\n\n\t regNoun : Str -> Gender -> KindT =\n\t \\carro,gen -> noun carro (carro + \"s\") gen ;\n\n\t copula : Number => Str = table {Sg => \"é\" ; Pl => \"são\"} ;\n}\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsRon.gf", "content": "-- (c) 2009 Ramona Enache under LGPL\r\n\r\nconcrete FoodsRon of Foods = \r\n{\r\nflags coding=utf8 ;\r\n\r\nparam Number = Sg | Pl ;\r\n Gender = Masc | Fem ;\r\n NGender = NMasc | NFem | NNeut ;\r\nlincat \r\nComment = {s : Str};\r\nQuality = {s : Number => Gender => Str};\r\nKind = {s : Number => Str; g : NGender};\r\nItem = {s : Str ; n : Number; g : Gender};\r\n\r\nlin\r\n\r\nThis = det Sg (mkTab \"acest\" \"această\");\r\nThat = det Sg (mkTab \"acel\" \"acea\");\r\nThese = det Pl (mkTab \"acești\" \"aceste\");\r\nThose = det Pl (mkTab \"acei\" \"acele\");\r\n\r\nWine = mkNoun \"vin\" \"vinuri\" NNeut ;\r\nCheese = mkNoun \"brânză\" \"brânzeturi\" NFem ;\r\nFish = mkNoun \"peşte\" \"peşti\" NMasc ;\r\nPizza = mkNoun \"pizza\" \"pizze\" NFem;\r\n\r\nVery a = {s = \\\\n,g => \"foarte\" ++ a.s ! n ! g};\r\n\r\nFresh = mkAdj \"proaspăt\" \"proaspătă\" \"proaspeţi\" \"proaspete\" ;\r\nWarm = mkAdj \"cald\" \"caldă\" \"calzi\" \"calde\" ;\r\nItalian = mkAdj \"italian\" \"italiană\" \"italieni\" \"italiene\" ;\r\nExpensive = mkAdj \"scump\" \"scumpă\" \"scumpi\" \"scumpe\" ;\r\nDelicious = mkAdj \"delicios\" \"delcioasă\" \"delicioşi\" \"delicioase\" ;\r\nBoring = mkAdj \"plictisitor\" \"plictisitoare\" \"plictisitori\" \"plictisitoare\" ;\r\n\r\nPred item quality = {s = item.s ++ copula ! item.n ++ quality.s ! item.n ! item.g} ;\r\n\r\nMod quality kind = {s = \\\\n => kind.s ! n ++ quality.s ! n ! (getAgrGender kind.g n) ; g = kind.g};\r\n\r\noper \r\n\r\nmkTab : Str -> Str -> {s : Gender => Str} = \\acesta, aceasta ->\r\n{s = table{Masc => acesta;\r\n Fem => aceasta}};\r\n\r\ndet : Number -> {s : Gender => Str} -> {s : Number => Str ; g : NGender} -> {s : Str; n : Number; g : Gender} =\r\n\\n,det,noun -> let gg = getAgrGender noun.g n \r\n in\r\n {s = det.s ! gg ++ noun.s ! n ; n = n ; g = gg};\r\n\r\nmkNoun : Str -> Str -> NGender -> {s : Number => Str; g : NGender} = \\peste, pesti,g ->\r\n{s = table {Sg => peste;\r\n Pl => pesti};\r\n g = g\r\n};\r\n\r\noper mkAdj : (x1,_,_,x4 : Str) -> {s : Number => Gender => Str} = \\scump, scumpa, scumpi, scumpe ->\r\n{s = \\\\n,g => case of\r\n{ => scump ; => scumpa;\r\n => scumpi ; => scumpe\r\n}};\r\n\r\ncopula : Number => Str = table {Sg => \"este\" ; Pl => \"sunt\"};\r\n\r\ngetAgrGender : NGender -> Number -> Gender = \\ng,n ->\r\ncase of\r\n{ => Masc ; => Fem;\r\n => Masc ; => Fem\r\n};\r\n\r\n}\r\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsSpa.gf", "content": "--# -path=.:present\r\n\r\nconcrete FoodsSpa of Foods = open SyntaxSpa, StructuralSpa, ParadigmsSpa in {\r\n\r\n\tlincat\r\n\t\tComment = Utt ;\r\n\t\tItem = NP ;\r\n\t\tKind = CN ;\r\n\t\tQuality = AP ;\r\n\r\n\tlin\r\n\t\tPred item quality = mkUtt (mkCl item quality) ;\r\n\t\tThis kind = mkNP this_QuantSg kind ;\r\n\t\tThat kind = mkNP that_QuantSg kind ;\r\n\t\tThese kind = mkNP these_QuantPl kind ;\r\n\t\tThose kind = mkNP those_QuantPl kind ;\r\n\t\tMod quality kind = mkCN quality kind ;\r\n\t\tVery quality = mkAP very_AdA quality ;\r\n\t\tWine = mkCN (mkN \"vino\") ;\r\n Pizza = mkCN (mkN \"pizza\") ;\r\n Cheese = mkCN (mkN \"queso\") ;\r\n Fish = mkCN (mkN \"pescado\") ;\r\n Fresh = mkAP (mkA \"fresco\") ;\r\n Warm = mkAP (mkA \"caliente\") ;\r\n Italian = mkAP (mkA \"italiano\") ;\r\n Expensive = mkAP (mkA \"caro\") ;\r\n Delicious = mkAP (mkA \"delicioso\") ;\r\n Boring = mkAP (mkA \"aburrido\") ;\r\n\r\n}\r\n\r\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsSwe.gf", "content": "--# -path=.:present\n\n-- (c) 2009 Aarne Ranta under LGPL\n\nconcrete FoodsSwe of Foods = FoodsI with \n (Syntax = SyntaxSwe),\n (LexFoods = LexFoodsSwe) ** {flags language = sv_SE;} ;\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsTha.gf", "content": "--# -path=.:alltenses\r\n\r\nconcrete FoodsTha of Foods = open SyntaxTha, LexiconTha,\r\n ParadigmsTha, (R=ResTha) in {\r\n\r\n flags coding = utf8 ;\r\n\r\n\tlincat\r\n\t\tComment = Utt ;\r\n\t\tItem = NP ;\r\n\t\tKind = CN ;\r\n\t\tQuality = AP ;\r\n\r\n\tlin\r\n\t\tPred item quality = mkUtt (mkCl item quality) ;\r\n\t\tThis kind = mkNP this_Det kind ;\r\n\t\tThat kind = mkNP that_Det kind ;\r\n\t\tThese kind = mkNP these_Det kind ;\r\n\t\tThose kind = mkNP those_Det kind ;\r\n\t\tMod quality kind = mkCN quality kind ;\r\n\t\tVery quality = mkAP very_AdA quality ;\r\n\t\tWine = mkCN (mkN (R.thword \"เหล้าอ\" \"งุ่น\") \"ขวด\") ;\r\n Pizza = mkCN (mkN (R.thword \"พิซ\" \"ซา\") \"ถาด\") ;\r\n Cheese = mkCN (mkN (R.thword \"เนย\" \"แข็ง\") \"ก้อน\") ;\r\n Fish = mkCN fish_N ;\r\n Fresh = mkAP (mkA \"สด\") ;\r\n Warm = mkAP warm_A ;\r\n Italian = mkAP (mkA \" อิตาลี\") ;\r\n Expensive = mkAP (mkA \"แพง\") ;\r\n Delicious = mkAP (mkA \"อร่อย\") ;\r\n Boring = mkAP (mkA (R.thword \"น่า\" \"เบิ่อ\")) ;\r\n\r\n}\r\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsTsn.gf", "content": "--# -path=alltenses\n\n-- (c) 2009 Laurette Pretorius Sr & Jr and Ansu Berg under LGPL\n\nconcrete FoodsTsn of Foods = open Prelude, Predef in {\n\tflags coding = utf8;\n\tlincat\n\t\tComment = {s:Str};\n\t\tItem = {s:Str; c:NounClass; n:Number};\n\t\tKind = {w: Number => Str; r: Str; c: NounClass; q: Number => Str; b: Bool};\n\t\tQuality = {s: NounClass => Number => Str; p_form: Str; t: TType};\n\tlin\t\n\t\tPred item quality = {s = item.s ++ ((mkPredDescrCop quality.t) ! item.c ! item.n) ++ quality.p_form};\n\n\t\tThis kind = {s = (kind.w ! Sg) ++ (mkDemPron1 ! kind.c ! Sg) ++ (kind.q ! Sg); c = kind.c; n = Sg};\n\t\tThat kind = {s = (kind.w ! Sg) ++ (mkDemPron2 ! kind.c ! Sg) ++ (kind.q ! Sg); c = kind.c; n = Sg};\n\t\tThese kind = {s = (kind.w ! Pl) ++ (mkDemPron1 ! kind.c ! Pl) ++ (kind.q ! Pl); c = kind.c; n = Pl};\n\t\tThose kind = {s = (kind.w ! Pl) ++ (mkDemPron2 ! kind.c ! Pl) ++ (kind.q ! Pl); c = kind.c; n = Pl};\t\n\t\t\n\t\tMod quality kind = mkMod quality kind;\n\n\t-- Lexicon\n\t\tWine = mkNounNC14_6 \"jalwa\";\n\t\tCheese = mkNounNC9_10 \"kase\";\n\t\tFish = mkNounNC9_10 \"thlapi\";\n\t\tPizza = mkNounNC9_10 \"pizza\";\n\t\tVery quality = smartVery quality; \n\t\tFresh = mkVarAdj \"ntsha\";\n\t\tWarm = mkOrdAdj \"bothitho\";\n\t\tItalian = mkPerAdj \"Itali\";\n\t\tExpensive = mkVerbRel \"tura\"; \n\t\tDelicious = mkOrdAdj \"monate\";\n\t\tBoring = mkOrdAdj \"bosula\";\n\t\t\n\tparam\n\t\tNounClass = NC9_10 | NC14_6;\n\t\tNumber = Sg | Pl;\n\t\tTType = P | V | ModV | R ;\t\t\t\t\n\toper\n\t\tmkMod : {s: NounClass => Number => Str; p_form: Str; t: TType} -> {w: Number => Str; r: Str; c: NounClass; q: Number => Str; b: Bool} -> {w: Number => Str; r: Str; c: NounClass; q: Number => Str; \n\t\tb: Bool} = \\x,y -> case y.b of\n\t\t{\n\t\t\tTrue => {w = y.w; r = y.r; c = y.c; \n\t\t\t\tq = table {\n\t\t\t\tSg => ((y.q ! Sg) ++ \"le\" ++ ((smartQualRelPart (x.t)) ! y.c ! Sg) ++ ((smartDescrCop (x.t)) ! \t\t\t\t\ty.c ! Sg) ++ (x.s ! y.c ! Sg)); \n\t\t\t\tPl => ((y.q ! Pl) ++ \"le\" ++ ((smartQualRelPart (x.t))! y.c ! Pl) ++ ((smartDescrCop (x.t)) ! \t\t\t\t\ty.c ! Pl) ++(x.s ! y.c ! Pl))\n\t\t\t\t }; b = True\n\t\t\t\t};\n\t\t\tFalse => {w = y.w; r = y.r; c = y.c; \n\t\t\t\tq = table {\n\t\t\t\tSg => ((y.q ! Sg) ++ ((smartQualRelPart (x.t)) ! y.c ! Sg) ++ ((smartDescrCop (x.t)) ! y.c ! Sg) \t\t\t\t\t++ (x.s ! y.c ! Sg)); \n\t\t\t\tPl => ((y.q ! Pl) ++ ((smartQualRelPart (x.t)) ! y.c ! Pl) ++ ((smartDescrCop (x.t)) ! y.c ! Pl) \t\t\t\t\t++(x.s ! y.c ! Pl))\n\t\t\t\t }; b = True\n\t\t\t\t}\n\t\t};\n\n\t\tmkNounNC14_6 : Str -> {w: Number => Str; r: Str; c: NounClass; q: Number => Str; b: Bool} = \\x -> {w = table {Sg => \"bo\" + x; Pl => \"ma\" + x}; r = x; c = NC14_6; \n\t\tq = table {Sg => \"\"; Pl => \"\"}; b = False};\n\t\t\n\t\tmkNounNC9_10 : Str -> {w: Number => Str; r: Str; c: NounClass; q: Number => Str; b: Bool} = \\x -> {w = table {Sg => \"\" + x; Pl => \"di\" + x}; r = x; c = NC9_10; \n\t\tq = table {Sg => \"\"; Pl => \"\"}; b = False};\n\n\t\tmkVarAdj : Str -> {s: NounClass => Number => Str; p_form: Str; t: TType} = \\x -> \n\t\t{\n\t\t\ts = table {\n\t\t\t\tNC9_10 => table {Sg => \"\" + x; Pl => \"di\" + x};\n\t\t\t\tNC14_6 => table {Sg => \"bo\" + x; Pl => \"ma\" + x}\n\t\t\t\t};\n\t\t\tp_form = x;\n\t\t\tt = R;\n\t\t};\n\n\t\tmkOrdAdj : Str -> {s: NounClass => Number => Str; p_form: Str; t: TType} = \\x -> \n\t\t{\n\t\t\ts = table {\n\t\t\t\tNC9_10 => table {Sg => \"\" + x; Pl => \"\" + x};\n\t\t\t\tNC14_6 => table {Sg => \"\" + x; Pl => \"\" + x}\n\t\t\t\t};\n\t\t\tp_form = x;\n\t\t\tt = R;\n\t\t};\n\n\t\tmkVerbRel : Str -> {s: NounClass => Number => Str; p_form: Str; t: TType} = \\x -> \n\t\t{\n\t\t\ts = table {\n\t\t\t\tNC9_10 => table {Sg => x + \"ng\"; Pl => x + \"ng\"};\n\t\t\t\tNC14_6 => table {Sg => x + \"ng\"; Pl => x + \"ng\"}\n\t\t\t\t};\n\t\t\tp_form = x;\n\t\t\tt = V;\n\t\t};\n\n\t\tmkPerAdj : Str -> {s: NounClass => Number => Str; p_form: Str; t: TType} = \\x -> \n\t\t{\n\t\t\ts = table {\n\t\t\t\tNC9_10 => table {Sg => \"\" + x; Pl => \"\" + x};\n\t\t\t\tNC14_6 => table {Sg => \"\" + x; Pl => \"\" + x}\n\t\t\t\t};\n\t\t\tp_form = \"mo\" ++ x;\n\t\t\tt = P;\n\t\t};\n\n\t\tmkVeryAdj : {s: NounClass => Number => Str; p_form: Str; t: TType} -> {s: NounClass => Number => Str; p_form: Str; t: TType} = \\x ->\n\t\t{\n\t\t\ts = table{c => table{n => (x.s!c!n) ++ \"thata\"}}; p_form = x.p_form ++ \"thata\"; t = x.t\n\t\t};\n\n\t\tmkVeryVerb : {s: NounClass => Number => Str; p_form: Str; t: TType} -> {s: NounClass => Number => Str; p_form: Str; t: TType} = \\x ->\n\t\t{\n\t\t\ts = table{c => table{n => (x.s!c!n) ++ \"thata\"}}; p_form = x.p_form ++ \"thata\"; t = ModV\n\t\t};\n\n\t\tsmartVery : {s: NounClass => Number => Str; p_form: Str; t: TType} -> {s: NounClass => Number => Str; p_form: Str; t: TType} = \n\\x -> case x.t of --(x.s!c!n)\n\t\t{\n\t\t\t(V | ModV)\t=>\tmkVeryVerb x;\n\t\t\t--ModV\t=>\tmkVeryVerb x;\n\t\t\t_\t=>\tmkVeryAdj x\n\t\t};\n\n\t\tmkDemPron1 : NounClass => Number => Str = table\n\t\t\t{\n\t\t\t\tNC9_10 => table {Sg => \"e\"; Pl => \"tse\"};\n\t\t\t\tNC14_6 => table {Sg => \"bo\"; Pl => \"a\"}\n\t\t\t};\n\t\t\n\t\tmkDemPron2 : NounClass => Number => Str = table\n\t\t\t{\n\t\t\t\tNC9_10 => table {Sg => \"eo\"; Pl => \"tseo\"};\n\t\t\t\tNC14_6 => table {Sg => \"boo\"; Pl => \"ao\"}\n\t\t\t};\n\n\t\tsmartQualRelPart : TType -> (NounClass => Number => Str) = \\x -> case x of \n\t\t{\n\t\t\tP\t=> mkQualRelPart_PName;\n\t\t\t_\t=> mkQualRelPart\n\t\t};\n\n\t\tmkQualRelPart : NounClass => Number => Str = table\n\t\t\t{\n\t\t\t\tNC9_10 => table {Sg => \"e\"; Pl => \"tse\"};\n\t\t\t\tNC14_6 => table {Sg => \"bo\"; Pl => \"a\"}\n\t\t\t};\n\n\t\tmkQualRelPart_PName : NounClass => Number => Str = table\n\t\t\t{\n\t\t\t\tNC9_10 => table {Sg => \"ya\"; Pl => \"tsa\"};\n\t\t\t\tNC14_6 => table {Sg => \"ba\"; Pl => \"a\"}\n\t\t\t};\n\n\t\tsmartDescrCop : TType -> (NounClass => Number => Str) = \\x -> case x of\n\t\t{\n\t\t\tP\t=> mkDescrCop_PName;\n\t\t\t_\t=> mkDescrCop\n\t\t};\n\n\t\tmkDescrCop : NounClass => Number => Str = table\n\t\t\t{\n\t\t\t\tNC9_10 => table {Sg => \"e\"; Pl => \"di\"};\n\t\t\t\tNC14_6 => table {Sg => \"bo\"; Pl => \"a\"}\n\t\t\t};\n\n\t\tmkDescrCop_PName : NounClass => Number => Str = table\n\t\t\t{\n\t\t\t\tNC9_10 => table {Sg => \"ga\"; Pl => \"ga\"};\n\t\t\t\tNC14_6 => table {Sg => \"ga\"; Pl => \"ga\"}\n\t\t\t};\n\n\t\tmkPredDescrCop : TType -> (NounClass => Number => Str) = \\x -> case x of\n\t\t\t{\n\t\t\t\tV => table \t{NC9_10 => table {Sg => \"e\" ++ \"a\"; Pl => \"di\" ++ \"a\"};\n\t\t\t\t\t\tNC14_6 => table {Sg => \"bo\" ++ \"a\"; Pl => \"a\" ++ \"a\"}};\n\n\t\t\t\t_ => table\t{NC9_10 => table {Sg => \"e\"; Pl => \"di\"};\n\t\t\t\t\t\tNC14_6 => table {Sg => \"bo\"; Pl => \"a\"}}\n\t\t\t};\n\n}\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsTur.gf", "content": "{-\n File : FoodsTur.gf\n Author : Server Çimen\n Version : 1.0\n Created on: August 26, 2009\n\n This file contains concrete grammar of Foods abstract grammar for Turkish Language.\n This grammar is to be used for Fridge demo and developed in the scope of GF Resource\n Grammar Summer School.\n\n-}\n\nconcrete FoodsTur of Foods = open Predef in {\n flags\n coding=utf8 ;\n lincat\n Comment = {s : Str} ;\n Quality = {s : Str ; c : Case; softness : Softness; h : Harmony} ;\n Kind = {s : Case => Number => Str} ;\n Item = {s : Str; n : Number} ;\n lin\n This = det Sg \"bu\" ;\n That = det Sg \"şu\" ;\n These = det Pl \"bu\" ;\n Those = det Pl \"şu\" ;\n -- Reason for excluding plural form of copula: In Turkish if subject is not a human being,\n -- then singular form of copula is used regardless of the number of subject. Since all\n -- possible subjects are non human, copula do not need to have plural form.\n Pred item quality = {s = item.s ++ quality.s ++ \"&+\" ++ copula ! quality.softness ! quality.h} ;--! item.n} ;\n Mod quality kind = {s = case quality.c of {\n Nom => \\\\t,n => quality.s ++ kind.s ! t ! n ;\n Gen => \\\\t,n => quality.s ++ kind.s ! Gen ! n\n }\n } ;\n Wine = mkN \"şarap\" \"şaraplar\" \"şarabı\" \"şarapları\" ;\n Cheese = mkN \"peynir\" \"peynirler\" \"peyniri\" \"peynirleri\" ;\n Fish = mkN \"balık\" \"balıklar\" \"balığı\" \"balıkları\" ;\n Pizza = mkN \"pizza\" \"pizzalar\" \"pizzası\" \"pizzaları\" ;\n Very a = {s = \"çok\" ++ a.s ; c = a.c; softness = a.softness; h = a.h} ;\n Fresh = adj \"taze\" Nom;\n Warm = adj \"ılık\" Nom;\n Italian = adj \"İtalyan\" Gen ;\n Expensive = adj \"pahalı\" Nom;\n Delicious = adj \"lezzetli\" Nom;\n Boring = adj \"sıkıcı\" Nom;\n param\n Number = Sg | Pl ;\n Case = Nom | Gen ;\n Harmony = I_Har | Ih_Har | U_Har | Uh_Har ; --Ih = İ; Uh = Ü\n Softness = Soft | Hard ;\n oper\n det : Number -> Str -> {s : Case => Number => Str} -> {s : Str; n : Number} =\n \\num,det,noun -> {s = det ++ noun.s ! Nom ! num; n = num} ;\n mkN = overload {\n mkN : Str -> Str -> {s : Case => Number => Str} = regNoun ;\n mkn : Str -> Str -> Str -> Str-> {s : Case => Number => Str} = noun ;\n } ;\n regNoun : Str -> Str -> {s : Case => Number => Str} =\n \\peynir,peynirler -> noun peynir peynirler [] [] ;\n noun : Str -> Str -> Str -> Str-> {s : Case => Number => Str} = \n \\sarap,saraplar,sarabi,saraplari -> {\n s = table {\n\t Nom => table {\n\t\t\tSg => sarap ;\n\t\t\tPl => saraplar\n\t } ;\n Gen => table {\n Sg => sarabi ;\n\t\t\tPl => saraplari\n\t }\n }\n };\n {-\n Since there is a bug in overloading, this overload is useless.\n\n mkA = overload {\n mkA : Str -> {s : Str; c : Case; softness : Softness; h : Harmony} = \\base -> adj base Nom ;\n mkA : Str -> Case -> {s : Str; c : Case; softness : Softness; h : Harmony} = adj ;\n } ;\n -}\n adj : Str -> Case -> {s : Str; c : Case; softness : Softness; h : Harmony} =\n \\italyan,ca -> {s = italyan ; c = ca; softness = (getSoftness italyan); h = (getHarmony italyan)} ;\n -- See the comment at lines 26 and 27 for excluded plural form of copula.\n copula : Softness => Harmony {-=> Number-} => Str =\n table {\n Soft => table {\n I_Har => \"dır\" ;--table {\n\t\t\t -- Sg => \"dır\" ;\n\t\t\t -- Pl => \"dırlar\"\n\t\t --} ;\n\t\t Ih_Har => \"dir\" ;--table {\n\t\t\t --Sg => \"dir\" ;\n\t\t\t --Pl => \"dirler\"\n\t\t --} ;\n\t\t U_Har => \"dur\" ;--table {\n\t\t\t -- Sg => \"dur\" ;\n\t\t\t -- Pl => \"durlar\"\n\t\t --} ;\n\t\t Uh_Har => \"dür\" --table {\n\t\t\t --Sg => \"dür\" ;\n\t\t\t --Pl => \"dürler\"\n\t\t --}\n } ;\n Hard => table {\n I_Har => \"tır\" ;--table {\n\t\t\t --Sg => \"tır\" ;\n\t\t\t --Pl => \"tırlar\"\n\t\t --} ;\n\t\t Ih_Har => \"tir\" ;--table {\n\t\t\t --Sg => \"tir\" ;\n\t\t\t --Pl => \"tirler\"\n\t\t --} ;\n\t\t U_Har => \"tur\" ;--table {\n\t\t\t -- Sg => \"tur\" ;\n\t\t\t -- Pl => \"turlar\"\n\t\t --} ;\n\t\t Uh_Har => \"tür\"--table {\n\t\t\t --Sg => \"tür\" ;\n\t\t\t --Pl => \"türler\"\n\t\t --}\n }\n } ;\n\n getHarmony : Str -> Harmony\n = \\base -> case base of {\n _+c@(\"ı\"|\"a\"|\"i\"|\"e\"|\"u\"|\"o\"|\"ü\"|\"ö\")+\n (\"b\"|\"v\"|\"d\"|\"z\"|\"j\"|\"c\"|\"g\"|\"ğ\"|\"l\"|\"r\"|\"m\"|\"n\"|\"y\"|\"p\"|\"f\"|\"t\"|\"s\"|\"ş\"|\"ç\"|\"k\"|\"h\")* =>\n case c of {\n (\"ı\"|\"a\") => I_Har ;\n (\"i\"|\"e\") => Ih_Har ;\n (\"u\"|\"o\") => U_Har ;\n (\"ü\"|\"ö\") => Uh_Har\n }\n } ;\n getSoftness : Str -> Softness\n = \\base -> case base of {\n\t\t _+(\"f\"|\"s\"|\"t\"|\"k\"|\"ç\"|\"ş\"|\"h\"|\"p\") => Hard ;\n\t\t _ => Soft\n\t\t } ;\n}" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/FoodsUrd.gf", "content": "-- (c) 2009 Shafqat Virk under LGPL\r\n\r\nconcrete FoodsUrd of Foods = {\r\n\r\n flags coding=utf8 ;\r\n\r\n \r\n\t param Number = Sg | Pl ;\r\n param Gender = Masc | Fem;\r\n\t \r\n\t oper coupla : Number -> Str =\\n -> case n of {Sg => \"ہے\" ; Pl => \"ہیں\"};\r\n\t \r\n\t \t \r\n lincat\r\n Comment = {s : Str} ; \r\n\t Item = {s: Str ; n: Number ; g:Gender};\r\n\t Kind = {s: Number => Str ; g:Gender};\r\n Quality = {s: Gender => Number => Str};\r\n \r\n lin\r\n Pred item quality = {s = item.s ++ quality.s ! item.g ! item.n ++ coupla item.n} ;\r\n\tThis kind = {s = \"یھ\" ++ kind.s ! Sg; n= Sg ; g = kind.g } ;\r\n\tThese kind = {s = \"یھ\" ++ kind.s ! Pl; n = Pl ; g = kind.g} ;\r\n That kind = {s = \"وہ\" ++ kind.s ! Sg; n= Sg ; g = kind.g} ;\r\n\tThose kind = {s = \"وہ\" ++ kind.s ! Pl; n=Pl ; g = kind.g} ;\r\n Mod quality kind = {s = \\\\n => quality.s ! kind.g ! n ++ kind.s ! n ; g = kind.g};\r\n\tWine = {s = table { Sg => \"شراب\" ; Pl => \"شرابیں\"} ; g = Fem};\r\n Cheese = {s = table { Sg => \"پنیر\" ; Pl => \"پنیریں\"} ; g = Fem};\r\n Fish = {s = table { Sg => \"مچھلی\" ; Pl => \"مچھلیاں\"} ; g = Fem};\r\n Pizza = {s = table { Sg => \"پیزہ\" ; Pl => \"پیزے\"} ; g = Masc};\r\n\tVery quality = {s = \\\\g,n => \"بہت\" ++ quality.s ! g ! n} ;\r\n Fresh = regAdj \"تازہ\" ;\r\n Warm = regAdj \"گرم\" ;\r\n Italian = regAdj \"اٹا لوی\" ;\r\n Expensive = regAdj \"مہنگا\" ;\r\n Delicious = regAdj \"مزیدار\" ;\r\n Boring = regAdj \"فضول\" ;\r\n \r\n oper\r\n regAdj : Str -> {s: Gender => Number => Str} = \\a -> case a of {\r\n x + \"ا\" => mkAdj a (x+\"ے\") (x+\"ی\");\r\n _ => mkAdj a a a\r\n };\r\n mkAdj : Str -> Str -> Str -> {s: Gender => Number => Str} = \\s,p,f -> {\r\n s = table {\r\n Masc => table {\r\n Sg => s;\r\n Pl => p\r\n };\r\n Fem => \\\\_ => f\r\n }\r\n };\r\n\t} " }, { "path": "src/test/resources/samples/langs/Grammatical Framework/LexFoods.gf", "content": "-- (c) 2009 Aarne Ranta under LGPL\n\ninterface LexFoods = open Syntax in {\n oper\n wine_N : N ;\n pizza_N : N ;\n cheese_N : N ;\n fish_N : N ;\n fresh_A : A ;\n warm_A : A ;\n italian_A : A ;\n expensive_A : A ;\n delicious_A : A ;\n boring_A : A ;\n}\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/LexFoodsCat.gf", "content": "-- (c) 2009 Jordi Saludes under LGPL\n\ninstance LexFoodsCat of LexFoods = \n open SyntaxCat, ParadigmsCat, (M = MorphoCat) in {\n flags\n\tcoding = utf8 ;\n oper\n wine_N = mkN \"vi\" \"vins\" M.Masc ;\n pizza_N = mkN \"pizza\" ;\n cheese_N = mkN \"formatge\" ;\n fish_N = mkN \"peix\" \"peixos\" M.Masc;\n fresh_A = mkA \"fresc\" \"fresca\" \"frescos\" \"fresques\" \"frescament\";\n warm_A = mkA \"calent\" ;\n italian_A = mkA \"italià\" \"italiana\" \"italians\" \"italianes\" \"italianament\" ;\n expensive_A = mkA \"car\" ;\n delicious_A = mkA \"deliciós\" \"deliciosa\" \"deliciosos\" \"delicioses\" \"deliciosament\";\n boring_A = mkA \"aburrit\" \"aburrida\" \"aburrits\" \"aburrides\" \"aburridament\" ;\n}\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/LexFoodsFin.gf", "content": "-- (c) 2009 Aarne Ranta under LGPL\n\ninstance LexFoodsFin of LexFoods =\n open SyntaxFin, ParadigmsFin in {\n flags coding=utf8;\n oper\n wine_N = mkN \"viini\" ;\n pizza_N = mkN \"pizza\" ;\n cheese_N = mkN \"juusto\" ;\n fish_N = mkN \"kala\" ;\n fresh_A = mkA \"tuore\" ;\n warm_A = mkA\n (mkN \"lämmin\" \"lämpimän\" \"lämmintä\" \"lämpimänä\" \"lämpimään\"\n \"lämpiminä\" \"lämpimiä\" \"lämpimien\" \"lämpimissä\" \"lämpimiin\"\n\t )\n \"lämpimämpi\" \"lämpimin\" ;\n italian_A = mkA \"italialainen\" ;\n expensive_A = mkA \"kallis\" ;\n delicious_A = mkA \"herkullinen\" ;\n boring_A = mkA \"tylsä\" ;\n}\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/LexFoodsGer.gf", "content": "-- (c) 2009 Aarne Ranta under LGPL\n\ninstance LexFoodsGer of LexFoods =\n open SyntaxGer, ParadigmsGer in {\n flags coding=utf8;\n oper\n wine_N = mkN \"Wein\" ;\n pizza_N = mkN \"Pizza\" \"Pizzen\" feminine ;\n cheese_N = mkN \"Käse\" \"Käse\" masculine ;\n fish_N = mkN \"Fisch\" ;\n fresh_A = mkA \"frisch\" ;\n warm_A = mkA \"warm\" \"wärmer\" \"wärmste\" ;\n italian_A = mkA \"italienisch\" ;\n expensive_A = mkA \"teuer\" ;\n delicious_A = mkA \"köstlich\" ;\n boring_A = mkA \"langweilig\" ;\n}\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/LexFoodsIta.gf", "content": "-- (c) 2009 Aarne Ranta under LGPL\n\ninstance LexFoodsIta of LexFoods = \n open SyntaxIta, ParadigmsIta in {\n oper\n wine_N = mkN \"vino\" ;\n pizza_N = mkN \"pizza\" ;\n cheese_N = mkN \"formaggio\" ;\n fish_N = mkN \"pesce\" ;\n fresh_A = mkA \"fresco\" ;\n warm_A = mkA \"caldo\" ;\n italian_A = mkA \"italiano\" ;\n expensive_A = mkA \"caro\" ;\n delicious_A = mkA \"delizioso\" ;\n boring_A = mkA \"noioso\" ;\n}\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/LexFoodsSwe.gf", "content": "-- (c) 2009 Aarne Ranta under LGPL\n\ninstance LexFoodsSwe of LexFoods =\n open SyntaxSwe, ParadigmsSwe in {\n flags coding=utf8;\n oper\n wine_N = mkN \"vin\" \"vinet\" \"viner\" \"vinerna\" ;\n pizza_N = mkN \"pizza\" ;\n cheese_N = mkN \"ost\" ;\n fish_N = mkN \"fisk\" ;\n fresh_A = mkA \"färsk\" ;\n warm_A = mkA \"varm\" ;\n italian_A = mkA \"italiensk\" ;\n expensive_A = mkA \"dyr\" ;\n delicious_A = mkA \"läcker\" ;\n boring_A = mkA \"tråkig\" ;\n}\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/ResCze.gf", "content": "-- (c) 2011 Katerina Bohmova under LGPL\n\nresource ResCze = open Prelude in {\n flags \n coding = utf8 ;\n param\n Number = Sg | Pl ;\n Gender = Masc | Fem | Neutr;\n oper\n NounPhrase : Type = \n {s : Str ; g : Gender ; n : Number} ; \n Noun : Type = {s : Number => Str ; g : Gender} ;\n Adjective : Type = {s : Gender => Number => Str} ;\n\n det : Number -> Str -> Str -> Str -> Noun -> NounPhrase =\n \\n,m,f,ne,cn -> {\n s = table {Masc => m ; Fem => f; Neutr => ne} ! cn.g ++ \n cn.s ! n ;\n g = cn.g ;\n n = n\n } ;\n noun : Str -> Str -> Gender -> Noun =\n \\muz,muzi,g -> {\n s = table {Sg => muz ; Pl => muzi} ;\n g = g\n } ;\n adjective : (msg,fsg,nsg,mpl,fpl,npl : Str) -> Adjective =\n \\msg,fsg,nsg,mpl,fpl,npl -> {\n s = table {\n Masc => table {Sg => msg ; Pl => mpl} ; \n Fem => table {Sg => fsg ; Pl => fpl} ;\n Neutr => table {Sg => nsg ; Pl => npl}\n }\n } ;\n regAdj : Str -> Adjective = \n \\mlad ->\n adjective (mlad+\"ý\") (mlad+\"á\") (mlad+\"é\")\n\t\t (mlad+\"é\") (mlad+\"é\") (mlad+\"á\") ;\n regnfAdj : Str -> Adjective = \n \\vynikajici ->\n adjective vynikajici vynikajici vynikajici \n\t\tvynikajici vynikajici vynikajici;\n copula : Number => Str = \n table {Sg => \"je\" ; Pl => \"jsou\"} ;\n}\n\n" }, { "path": "src/test/resources/samples/langs/Grammatical Framework/transFoodsHin.gf", "content": "-- (c) 2009 Aarne Ranta under LGPL\n\nconcrete FoodsHin of Foods = {\n\n flags coding=utf8 ;\n\n param\n Gender = Masc | Fem ;\n Number = Sg | Pl ;\n lincat\n Comment = {s : Str} ;\n Item = {s : Str ; g : Gender ; n : Number} ;\n Kind = {s : Number => Str ; g : Gender} ;\n Quality = {s : Gender => Number => Str} ;\n lin\n Pred item quality = {\n s = item.s ++ quality.s ! item.g ! item.n ++ copula item.n\n } ;\n This kind = {s = \"yah\" ++ kind.s ! Sg ; g = kind.g ; n = Sg} ;\n That kind = {s = \"vah\" ++ kind.s ! Sg ; g = kind.g ; n = Sg} ;\n These kind = {s = \"ye\" ++ kind.s ! Pl ; g = kind.g ; n = Pl} ;\n Those kind = {s = \"ve\" ++ kind.s ! Pl ; g = kind.g ; n = Pl} ;\n Mod quality kind = {\n s = \\\\n => quality.s ! kind.g ! n ++ kind.s ! n ; \n g = kind.g\n } ;\n Wine = regN \"madirA\" ;\n Cheese = regN \"panIr\" ;\n Fish = regN \"maClI\" ;\n Pizza = regN \"pijjA\" ;\n Very quality = {s = \\\\g,n => \"bahut\" ++ quality.s ! g ! n} ;\n Fresh = regAdj \"tAzA\" ;\n Warm = regAdj \"garam\" ;\n Italian = regAdj \"i-t.alI\" ; \n Expensive = regAdj \"mahaNgA\" ;\n Delicious = regAdj \"rucikar\" ;\n Boring = regAdj \"pEriyA\" ;\n\n oper\n mkN : Str -> Str -> Gender -> {s : Number => Str ; g : Gender} = \n \\s,p,g -> {\n s = table {\n Sg => s ;\n Pl => p\n } ;\n g = g\n } ;\n\n regN : Str -> {s : Number => Str ; g : Gender} = \\s -> case s of {\n lark + \"A\" => mkN s (lark + \"e\") Masc ;\n lark + \"I\" => mkN s (lark + \"iyaM\") Fem ;\n _ => mkN s s Masc \n } ;\n\n mkAdj : Str -> Str -> Str -> {s : Gender => Number => Str} = \\ms,mp,f -> {\n s = table {\n Masc => table {\n Sg => ms ;\n Pl => mp\n } ;\n Fem => \\\\_ => f\n }\n } ;\n\n regAdj : Str -> {s : Gender => Number => Str} = \\a -> case a of {\n acch + \"A\" => mkAdj a (acch + \"e\") (acch + \"I\") ;\n _ => mkAdj a a a\n } ;\n\n copula : Number -> Str = \\n -> case n of {\n Sg => \"hE\" ;\n Pl => \"hEN\"\n } ;\n\n }\n" }, { "path": "src/test/resources/samples/langs/Graph Modeling Language/sample.gml", "content": "graph\n[\n directed 0\n node\n [\n id 0\n label \"Node 1\"\n value 100\n ]\n node\n [\n id 1\n label \"Node 2\"\n value 200\n ]\n edge\n [\n source 1\n target 0\n ]\n]\n" }, { "path": "src/test/resources/samples/langs/GraphQL/kitchen-sink.graphql", "content": "# Copyright (c) 2015, Facebook, Inc.\n# All rights reserved.\n#\n# This source code is licensed under the BSD-style license found in the\n# LICENSE file in the root directory of this source tree. An additional grant\n# of patent rights can be found in the PATENTS file in the same directory.\n\nquery queryName($foo: ComplexType, $site: Site = MOBILE) {\n whoever123is: node(id: [123, 456]) {\n id ,\n ... on User @defer {\n field2 {\n id ,\n alias: field1(first:10, after:$foo,) @include(if: $foo) {\n id,\n ...frag\n }\n }\n }\n ... @skip(unless: $foo) {\n id\n }\n ... {\n id\n }\n }\n}\n\nmutation likeStory {\n like(story: 123) @defer {\n story {\n id\n }\n }\n}\n\nsubscription StoryLikeSubscription($input: StoryLikeSubscribeInput) {\n storyLikeSubscribe(input: $input) {\n story {\n likers {\n count\n }\n likeSentence {\n text\n }\n }\n }\n}\n\nfragment frag on Friend {\n foo(size: $size, bar: $b, obj: {key: \"value\"})\n}\n\n{\n unnamed(truthy: true, falsey: false),\n query\n}\n" }, { "path": "src/test/resources/samples/langs/GraphQL/schema-kitchen-sink.graphql", "content": "# Copyright (c) 2015, Facebook, Inc.\n# All rights reserved.\n#\n# This source code is licensed under the BSD-style license found in the\n# LICENSE file in the root directory of this source tree. An additional grant\n# of patent rights can be found in the PATENTS file in the same directory.\n\nschema {\n query: QueryType\n mutation: MutationType\n}\n\ntype Foo implements Bar {\n one: Type\n two(argument: InputType!): Type\n three(argument: InputType, other: String): Int\n four(argument: String = \"string\"): String\n five(argument: [String] = [\"string\", \"string\"]): String\n six(argument: InputType = {key: \"value\"}): Type\n}\n\ninterface Bar {\n one: Type\n four(argument: String = \"string\"): String\n}\n\nunion Feed = Story | Article | Advert\n\nscalar CustomScalar\n\nenum Site {\n DESKTOP\n MOBILE\n}\n\ninput InputType {\n key: String!\n answer: Int = 42\n}\n\nextend type Foo {\n seven(argument: [String]): Type\n}\n\ndirective @skip(if: Boolean!) on FIELD | FRAGMENT_SPREAD | INLINE_FRAGMENT\n\ndirective @include(if: Boolean!)\n on FIELD\n | FRAGMENT_SPREAD\n | INLINE_FRAGMENT\n" }, { "path": "src/test/resources/samples/langs/Graphviz (DOT)/annoying.DOT", "content": "/* \n Huffman Tree DOT graph.\n\n DOT Reference : http://www.graphviz.org/doc/info/lang.html\n http://en.wikipedia.org/wiki/DOT_language\n Timestamp : 1415989074 \n Phrase : 'OH GOD WHY IS LINGUIST SO ANAL ABOUT THIS STUFF'\n\n Generated on http://huffman.ooz.ie/\n*/\n\ndigraph G {\n edge [label=0];\n graph [ranksep=0];\n T [shape=record, label=\"{{T|4}|000}\"];\n S [shape=record, label=\"{{S|5}|001}\"];\n SPACE [shape=record, label=\"{{SPACE|9}|01}\"];\n A [shape=record, label=\"{{A|3}|1000}\"];\n H [shape=record, label=\"{{H|3}|1001}\"];\n U [shape=record, label=\"{{U|3}|1010}\"];\n L [shape=record, label=\"{{L|2}|10110}\"];\n N [shape=record, label=\"{{N|2}|10111}\"];\n I [shape=record, label=\"{{I|4}|1100}\"];\n O [shape=record, label=\"{{O|4}|1101}\"];\n G [shape=record, label=\"{{G|2}|11100}\"];\n F [shape=record, label=\"{{F|2}|11101}\"];\n GF [label=4];\n W [shape=record, label=\"{{W|1}|111100}\"];\n Y [shape=record, label=\"{{Y|1}|111101}\"];\n B [shape=record, label=\"{{B|1}|111110}\"];\n D [shape=record, label=\"{{D|1}|111111}\"];\n BD [label=2];\n WYBD [label=4];\n GFWYBD [label=8];\n 47 -> 18 -> 9 -> T;\n 29 -> 13 -> 6 -> A;\n 7 -> U;\n 4 -> L;\n 16 -> 8 -> I;\n GFWYBD -> GF -> G;\n WYBD -> 2 -> W;\n BD -> B;9 -> S [label=1];\n 18 -> SPACE [label=1];\n 6 -> H [label=1];\n 13 -> 7 -> 4 -> N [label=1];\n 8 -> O [label=1];\n GF -> F [label=1];\n 2 -> Y [label=1];\n 47 -> 29 -> 16 -> GFWYBD -> WYBD -> BD -> D [label=1];\n}" }, { "path": "src/test/resources/samples/langs/Graphviz (DOT)/sample.dot", "content": "/* \n Huffman Tree DOT graph.\n\n DOT Reference : http://www.graphviz.org/doc/info/lang.html\n http://en.wikipedia.org/wiki/DOT_language\n Timestamp : 1415988139 \n Phrase : 'SERIAL KILLER AND SEX OFFENDER ANGUS SINCLAIR IS JAILED FOR A MINIMUM OF 37 YEARS FOR THE 1977 WORLDS END MURDERS OF HELEN SCOTT AND CHRISTINE EADIE.'\n\n Generated on http://huffman.ooz.ie/\n*/\n\ndigraph G {\n edge [label=0];\n graph [ranksep=0];\n node [shape=record];\n U [label=\"{{U|3}|00000}\"];\n G [label=\"{{G|1}|0000100}\"];\n K [label=\"{{K|1}|0000101}\"];\n _3 [label=\"{{3|1}|0000110}\"];\n _9 [label=\"{{9|1}|0000111}\"];\n _39 [label=2];\n L [label=\"{{L|7}|0001}\"];\n O [label=\"{{O|7}|0010}\"];\n Y [label=\"{{Y|1}|0011000}\"];\n X [label=\"{{X|1}|0011001}\"];\n YX [label=2];\n J [label=\"{{J|1}|0011010}\"];\n W [label=\"{{W|1}|0011011}\"];\n JW [label=2];\n YXJW [label=4];\n M [label=\"{{M|4}|00111}\"];\n E [label=\"{{E|15}|010}\"];\n D [label=\"{{D|8}|0110}\"];\n T [label=\"{{T|4}|01110}\"];\n DOT [label=\"{{DOT|1}|0111100}\"];\n _1 [label=\"{{1|1}|0111101}\"];\n DOT1 [label=2];\n _7 [label=\"{{7|3}|011111}\"];\n A [label=\"{{A|9}|1000}\"];\n N [label=\"{{N|9}|1001}\"];\n S [label=\"{{S|10}|1010}\"];\n I [label=\"{{I|11}|1011}\"];\n R [label=\"{{R|11}|1100}\"];\n C [label=\"{{C|3}|110100}\"];\n H [label=\"{{H|3}|110101}\"];\n F [label=\"{{F|6}|11011}\"];\n SPACE [label=\"{{SPACE|26}|111}\"];\n 149 -> 61 -> 29 -> 14 -> 7 -> U;\n 4 -> 2 -> G;\n _39 -> _3;\n 15 -> O;\n 8 -> YXJW -> YX -> Y;\n JW -> J;\n 32 -> E;\n 17 -> D;\n 9 -> T;\n 5 -> DOT1 -> DOT;\n 88 -> 39 -> 18 -> A;\n 21 -> S;\n 49 -> 23 -> R;\n 12 -> 6 -> C;2 -> K [label=1];\n 7 -> 4 -> _39 -> _9 [label=1];\n 14 -> L [label=1];\n YX -> X [label=1];\n YXJW -> JW -> W [label=1];\n 29 -> 15 -> 8 -> M [label=1];\n DOT1 -> _1 [label=1];\n 61 -> 32 -> 17 -> 9 -> 5 -> _7 [label=1];\n 18 -> N [label=1];\n 39 -> 21 -> I [label=1];\n 6 -> H [label=1];\n 23 -> 12 -> F [label=1];\n 149 -> 88 -> 49 -> SPACE [label=1];\n}" }, { "path": "src/test/resources/samples/langs/Groovy/build.gvy", "content": "task echoDirListViaAntBuilder() {\n description = 'Uses the built-in AntBuilder instance to echo and list files'\n //Docs: http://ant.apache.org/manual/Types/fileset.html\n \n //Echo the Gradle project name via the ant echo plugin\n ant.echo(message: project.name)\n ant.echo(path)\n ant.echo(\"${projectDir}/samples\")\n \n //Gather list of files in a subdirectory\n ant.fileScanner{\n fileset(dir:\"samples\")\n }.each{\n //Print each file to screen with the CWD (projectDir) path removed.\n println it.toString() - \"${projectDir}\"\n }\n}\n" }, { "path": "src/test/resources/samples/langs/Groovy/filenames/Jenkinsfile", "content": "jettyUrl = 'http://localhost:8081/'\n\ndef servers\n\nstage 'Dev'\nnode {\n checkout scm\n servers = load 'servers.groovy'\n mvn '-o clean package'\n dir('target') {stash name: 'war', includes: 'x.war'}\n}\n\nstage 'QA'\nparallel(longerTests: {\n runTests(servers, 30)\n}, quickerTests: {\n runTests(servers, 20)\n})\n\nstage name: 'Staging', concurrency: 1\nnode {\n servers.deploy 'staging'\n}\n\ninput message: \"Does ${jettyUrl}staging/ look good?\"\n\nstage name: 'Production', concurrency: 1\nnode {\n sh \"wget -O - -S ${jettyUrl}staging/\"\n echo 'Production server looks to be alive'\n servers.deploy 'production'\n echo \"Deployed to ${jettyUrl}production/\"\n}\n\ndef mvn(args) {\n sh \"${tool 'Maven 3.x'}/bin/mvn ${args}\"\n}\n\ndef runTests(servers, duration) {\n node {\n checkout scm\n servers.runWithServer {id ->\n mvn \"-o -f sometests test -Durl=${jettyUrl}${id}/ -Dduration=${duration}\"\n }\n }\n}\n" }, { "path": "src/test/resources/samples/langs/Groovy/groovy", "content": "#!/usr/bin/env groovy\nprintln \"Groovy!\"\n" }, { "path": "src/test/resources/samples/langs/Groovy/script.gvy", "content": "#!/usr/bin/env groovy\nprintln \"Hello World\"\n" }, { "path": "src/test/resources/samples/langs/Groovy/template.grt", "content": "html {\n head {\n component \"bootstrap\"\n title \"Bootstrap Template\"\n }\n \n html {\n }\n}\n" }, { "path": "src/test/resources/samples/langs/Groovy/template.gtpl", "content": "html {\n head {\n title \"Example Template\"\n }\n \n body {\n p \"This is a quick template example\"\n }\n}\n" }, { "path": "src/test/resources/samples/langs/Groovy Server Pages/bar.gsp", "content": "\n\n \n Testing with SiteMesh and Resources\n \n \n\n\n\n\n" }, { "path": "src/test/resources/samples/langs/Groovy Server Pages/hello-pagedirective.gsp", "content": "<%@ page contentType=\"text/html;charset=UTF-8\" %>\n\n\n \n Using page directive tag\n \n \n \n
\n Print\n
\n \n\n\n" }, { "path": "src/test/resources/samples/langs/Groovy Server Pages/hello-resources.gsp", "content": "\n\n \n Testing with Resources\n \n\n\n\n\n" }, { "path": "src/test/resources/samples/langs/Groovy Server Pages/hello-var.gsp", "content": "\n\n \n Testing with SiteMesh and ${example}\n\n\n\n\n\n" }, { "path": "src/test/resources/samples/langs/HCL/example.hcl", "content": "consul = \"1.2.3.4\"\n\n// This is a comment\ntemplate \"foo\" {\n bar = \"zip\"\n}\n" }, { "path": "src/test/resources/samples/langs/HCL/example.tf", "content": "resource \"aws_instance\" \"web\" {\n // Copies the myapp.conf file to /etc/myapp.conf\n provisioner \"file\" {\n source = \"conf/myapp.conf\"\n destination = \"/etc/myapp.conf\"\n }\n\n // Copies the configs.d folder to /etc/configs.d\n provisioner \"file\" {\n source = \"conf/configs.d\"\n destination = \"/etc\"\n }\n}\n" }, { "path": "src/test/resources/samples/langs/HCL/main.tf", "content": "resource \"aws_security_group\" \"elb_sec_group\" {\n description = \"Allow traffic from the internet to ELB port 80\"\n vpc_id = \"${var.vpc_id}\"\n\n ingress {\n from_port = 80\n to_port = 80\n protocol = \"tcp\"\n cidr_blocks = [\"${split(\",\", var.allowed_cidr_blocks)}\"]\n }\n\n egress {\n from_port = 0\n to_port = 0\n protocol = \"-1\"\n cidr_blocks = [\"0.0.0.0/0\"]\n }\n}\n\nresource \"aws_security_group\" \"dokku_allow_ssh_from_internal\" {\n description = \"Allow git access over ssh from the private subnet\"\n vpc_id = \"${var.vpc_id}\"\n\n ingress {\n from_port = 22\n to_port = 22\n protocol = \"tcp\"\n cidr_blocks = [\"${var.private_subnet_cidr}\"]\n }\n\n egress {\n from_port = 0\n to_port = 0\n protocol = \"-1\"\n cidr_blocks = [\"0.0.0.0/0\"]\n }\n}\n\nresource \"aws_security_group\" \"allow_from_elb_to_instance\" {\n description = \"Allow traffic from the ELB to the private instance\"\n vpc_id = \"${var.vpc_id}\"\n\n ingress {\n security_groups = [\"${aws_security_group.elb_sec_group.id}\"]\n from_port = 80\n to_port = 80\n protocol = \"tcp\"\n }\n\n egress {\n from_port = 0\n to_port = 0\n protocol = \"-1\"\n cidr_blocks = [\"0.0.0.0/0\"]\n }\n}\n\nresource \"aws_instance\" \"dokku\" {\n ami = \"ami-47a23a30\"\n instance_type = \"${var.instance_type}\"\n associate_public_ip_address = false\n key_name = \"${var.key_name}\"\n subnet_id = \"${var.private_subnet_id}\"\n vpc_security_group_ids = [\n \"${var.bastion_sec_group_id}\",\n \"${aws_security_group.allow_from_elb_to_instance.id}\",\n \"${aws_security_group.dokku_allow_ssh_from_internal.id}\"\n ]\n tags {\n Name = \"${var.name}\"\n }\n connection {\n user = \"ubuntu\"\n private_key = \"${var.private_key}\"\n bastion_host = \"${var.bastion_host}\"\n bastion_port = \"${var.bastion_port}\"\n bastion_user = \"${var.bastion_user}\"\n bastion_private_key = \"${var.bastion_private_key}\"\n }\n provisioner \"file\" {\n source = \"${path.module}/../scripts/install-dokku.sh\"\n destination = \"/home/ubuntu/install-dokku.sh\"\n }\n provisioner \"remote-exec\" {\n inline = [\n \"chmod +x /home/ubuntu/install-dokku.sh\",\n \"HOSTNAME=${var.hostname} /home/ubuntu/install-dokku.sh\"\n ]\n }\n}\n\nresource \"aws_elb\" \"elb_dokku\" {\n name = \"elb-dokku-${var.name}\"\n subnets = [\"${var.public_subnet_id}\"]\n security_groups = [\"${aws_security_group.elb_sec_group.id}\"]\n\n listener {\n instance_port = 80\n instance_protocol = \"http\"\n lb_port = 80\n lb_protocol = \"http\"\n }\n\n health_check {\n healthy_threshold = 2\n unhealthy_threshold = 2\n timeout = 3\n target = \"HTTP:80/\"\n interval = 30\n }\n\n instances = [\"${aws_instance.dokku.id}\"]\n cross_zone_load_balancing = false\n idle_timeout = 400\n\n tags {\n Name = \"elb-dokku-${var.name}\"\n }\n}\n\nresource \"aws_route53_record\" \"dokku-deploy\" {\n zone_id = \"${var.zone_id}\"\n name = \"deploy.${var.hostname}\"\n type = \"A\"\n ttl = \"300\"\n records = [\"${aws_instance.dokku.private_ip}\"]\n}\n\nresource \"aws_route53_record\" \"dokku-wildcard\" {\n zone_id = \"${var.zone_id}\"\n name = \"*.${var.hostname}\"\n type = \"CNAME\"\n ttl = \"300\"\n records = [\"${aws_elb.elb_dokku.dns_name}\"]\n}" }, { "path": "src/test/resources/samples/langs/HCL/terraform.tfvars", "content": "# Terragrunt is a thin wrapper for Terraform that provides extra tools for working with multiple Terraform modules,\n# remote state, and locking: https://github.com/gruntwork-io/terragrunt\nterragrunt = {\n # Configure Terragrunt to automatically store tfstate files in an S3 bucket\n remote_state {\n backend = \"s3\"\n config {\n encrypt = true\n bucket = \"acme-main-terraform-state\"\n key = \"${path_relative_to_include()}/terraform.tfstate\"\n region = \"us-east-1\"\n dynamodb_table = \"terraform-locks\"\n }\n }\n\n # Configure Terragrunt to use common var files to help you keep often-repeated variables (e.g., account ID) DRY.\n # Note that even though Terraform automatically pulls in terraform.tfvars, we include it explicitly at the end of the\n # list to make sure its variables override anything in the common var files.\n terraform {\n extra_arguments \"common_vars\" {\n commands = [\"${get_terraform_commands_that_need_vars()}\"]\n\n optional_var_files = [\n \"${get_tfvars_dir()}/${find_in_parent_folders(\"account.tfvars\", \"skip-account-if-does-not-exist\")}\",\n \"${get_tfvars_dir()}/${find_in_parent_folders(\"region.tfvars\", \"skip-region-if-does-not-exist\")}\",\n \"${get_tfvars_dir()}/${find_in_parent_folders(\"env.tfvars\", \"skip-env-if-does-not-exist\")}\",\n \"${get_tfvars_dir()}/terraform.tfvars\"\n ]\n }\n }\n}\n\nkey1 = \"val1\"\nkey2 = 0\nkey3 = 1\nkey4 = true\n\n# Sample comments\nkey5 = false\n\nkey6 = [\"hello\", \"from\", \"gruntwork.io\"]\n\nkey7 = {\n key1 = \"hello\"\n key2 = \"from\"\n key3 = \"gruntwork.io\"\n}\n\nkey8 = [\n {\n keyA = \"hello\"\n keyB = \"there\"\n },\n {\n keyA = \"hello\"\n keyB = \"there\"\n }\n]" }, { "path": "src/test/resources/samples/langs/HLSL/accelerated_surface_win.hlsl", "content": "// Copyright (c) 2012 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\n// To compile these two shaders:\n// fxc /E pixelMain /T ps_2_0 accelerated_surface_win.hlsl\n// fxc /E vertexMain /T vs_2_0 accelerated_surface_win.hlsl\n//\n// fxc is in the DirectX SDK.\n\nstruct Vertex {\n float4 position : POSITION;\n float2 texCoord : TEXCOORD0;\n};\n\ntexture t;\nsampler s;\n\n// Passes a position and texture coordinate to the pixel shader.\nVertex vertexMain(Vertex input) {\n return input;\n};\n\n// Samples a texture at the given texture coordinate and returns the result.\nfloat4 pixelMain(float2 texCoord : TEXCOORD0) : COLOR0 {\n return tex2D(s, texCoord);\n};\n" }, { "path": "src/test/resources/samples/langs/HLSL/bloom.cginc", "content": "// From https://github.com/Unity-Technologies/PostProcessing/blob/master/PostProcessing/Resources/Shaders/Bloom.cginc\n// Licensed under the MIT license\n\n#ifndef __BLOOM__\n#define __BLOOM__\n\n#include \"Common.cginc\"\n\n// Brightness function\nhalf Brightness(half3 c)\n{\n return Max3(c);\n}\n\n// 3-tap median filter\nhalf3 Median(half3 a, half3 b, half3 c)\n{\n return a + b + c - min(min(a, b), c) - max(max(a, b), c);\n}\n\n// Downsample with a 4x4 box filter\nhalf3 DownsampleFilter(sampler2D tex, float2 uv, float2 texelSize)\n{\n float4 d = texelSize.xyxy * float4(-1.0, -1.0, 1.0, 1.0);\n\n half3 s;\n s = DecodeHDR(tex2D(tex, uv + d.xy));\n s += DecodeHDR(tex2D(tex, uv + d.zy));\n s += DecodeHDR(tex2D(tex, uv + d.xw));\n s += DecodeHDR(tex2D(tex, uv + d.zw));\n\n return s * (1.0 / 4.0);\n}\n\n// Downsample with a 4x4 box filter + anti-flicker filter\nhalf3 DownsampleAntiFlickerFilter(sampler2D tex, float2 uv, float2 texelSize)\n{\n float4 d = texelSize.xyxy * float4(-1.0, -1.0, 1.0, 1.0);\n\n half3 s1 = DecodeHDR(tex2D(tex, uv + d.xy));\n half3 s2 = DecodeHDR(tex2D(tex, uv + d.zy));\n half3 s3 = DecodeHDR(tex2D(tex, uv + d.xw));\n half3 s4 = DecodeHDR(tex2D(tex, uv + d.zw));\n\n // Karis's luma weighted average (using brightness instead of luma)\n half s1w = 1.0 / (Brightness(s1) + 1.0);\n half s2w = 1.0 / (Brightness(s2) + 1.0);\n half s3w = 1.0 / (Brightness(s3) + 1.0);\n half s4w = 1.0 / (Brightness(s4) + 1.0);\n half one_div_wsum = 1.0 / (s1w + s2w + s3w + s4w);\n\n return (s1 * s1w + s2 * s2w + s3 * s3w + s4 * s4w) * one_div_wsum;\n}\n\nhalf3 UpsampleFilter(sampler2D tex, float2 uv, float2 texelSize, float sampleScale)\n{\n#if MOBILE_OR_CONSOLE\n // 4-tap bilinear upsampler\n float4 d = texelSize.xyxy * float4(-1.0, -1.0, 1.0, 1.0) * (sampleScale * 0.5);\n\n half3 s;\n s = DecodeHDR(tex2D(tex, uv + d.xy));\n s += DecodeHDR(tex2D(tex, uv + d.zy));\n s += DecodeHDR(tex2D(tex, uv + d.xw));\n s += DecodeHDR(tex2D(tex, uv + d.zw));\n\n return s * (1.0 / 4.0);\n#else\n // 9-tap bilinear upsampler (tent filter)\n float4 d = texelSize.xyxy * float4(1.0, 1.0, -1.0, 0.0) * sampleScale;\n\n half3 s;\n s = DecodeHDR(tex2D(tex, uv - d.xy));\n s += DecodeHDR(tex2D(tex, uv - d.wy)) * 2.0;\n s += DecodeHDR(tex2D(tex, uv - d.zy));\n\n s += DecodeHDR(tex2D(tex, uv + d.zw)) * 2.0;\n s += DecodeHDR(tex2D(tex, uv)) * 4.0;\n s += DecodeHDR(tex2D(tex, uv + d.xw)) * 2.0;\n\n s += DecodeHDR(tex2D(tex, uv + d.zy));\n s += DecodeHDR(tex2D(tex, uv + d.wy)) * 2.0;\n s += DecodeHDR(tex2D(tex, uv + d.xy));\n\n return s * (1.0 / 16.0);\n#endif\n}\n\n#endif // __BLOOM__" }, { "path": "src/test/resources/samples/langs/HLSL/corridor.fx", "content": "float4x4 matWorldView : WORLDVIEW;\nfloat4x4 matWorldViewProjection : WORLDVIEWPROJECTION;\n\nstruct VS_INPUT {\n\tfloat4 Position : POSITION0;\n\tfloat3 Normal : NORMAL;\n\tfloat3 Tangent : TANGENT;\n\tfloat3 Binormal : BINORMAL;\n\tfloat2 TexCoord0 : TEXCOORD0;\n\tfloat2 TexCoord1 : TEXCOORD1;\n};\n\nstruct VS_OUTPUT {\n\tfloat4 Position : POSITION0;\n\tfloat2 TexCoord0 : TEXCOORD0;\n\tfloat2 TexCoord1 : TEXCOORD1;\n\tfloat3x3 TangentToView : TEXCOORD2;\n};\n\nVS_OUTPUT vs_main(VS_INPUT input)\n{\n\tVS_OUTPUT output;\n\toutput.Position = mul(input.Position, matWorldViewProjection);\n\toutput.TexCoord0 = input.TexCoord0 * 5;\n\toutput.TexCoord1 = input.TexCoord1;\n\toutput.TangentToView[0] = mul(float4(input.Tangent, 0), matWorldView).xyz;\n\toutput.TangentToView[1] = mul(float4(input.Binormal, 0), matWorldView).xyz;\n\toutput.TangentToView[2] = mul(float4(input.Normal, 0), matWorldView).xyz;\n\treturn output;\n}\n\nstruct PS_OUTPUT {\n\tfloat4 gbuffer0 : COLOR0;\n\tfloat4 gbuffer1 : COLOR1;\n};\n\ntexture albedo_tex;\nsampler albedo_samp = sampler_state {\n\tTexture = (albedo_tex);\n\tMipFilter = Linear;\n\tMinFilter = Linear;\n\tMagFilter = Linear;\n\tAddressU = Wrap;\n\tAddressV = Wrap;\n\tsRGBTexture = True;\n};\n\ntexture normal_tex;\nsampler normal_samp = sampler_state {\n\tTexture = (normal_tex);\n\tMipFilter = Linear;\n\tMinFilter = Linear;\n\tMagFilter = Linear;\n\tAddressU = Wrap;\n\tAddressV = Wrap;\n\tsRGBTexture = False;\n};\n\ntexture specular_tex;\nsampler specular_samp = sampler_state {\n\tTexture = (specular_tex);\n\tMipFilter = Linear;\n\tMinFilter = Linear;\n\tMagFilter = Linear;\n\tAddressU = Wrap;\n\tAddressV = Wrap;\n\tsRGBTexture = True;\n};\n\ntexture ao_tex;\nsampler ao_samp = sampler_state {\n\tTexture = (ao_tex);\n\tMipFilter = Linear;\n\tMinFilter = Linear;\n\tMagFilter = Linear;\n\tAddressU = Wrap;\n\tAddressV = Wrap;\n\tsRGBTexture = True;\n};\n\nPS_OUTPUT ps_main(VS_OUTPUT Input)\n{\n\tPS_OUTPUT o;\n\n\tfloat3 tangentNormal = normalize(tex2D(normal_samp, Input.TexCoord0).xyz * 2 - 1);\n\tfloat3 eyeNormal = normalize(mul(tangentNormal, Input.TangentToView));\n\n\tfloat3 albedo = tex2D(albedo_samp, Input.TexCoord0).rgb;\n\tfloat ao = tex2D(ao_samp, Input.TexCoord1).r * 0.75;\n\tfloat spec = tex2D(specular_samp, Input.TexCoord0).r;\n\n\to.gbuffer0 = float4(eyeNormal, spec * ao);\n\to.gbuffer1 = float4(albedo, 1 - ao);\n\treturn o;\n}\n\ntechnique mesh {\n\tpass Geometry {\n\t\tVertexShader = compile vs_3_0 vs_main();\n\t\tPixelShader = compile ps_3_0 ps_main();\n\n\t\tAlphaBlendEnable = False;\n\t\tZWriteEnable = True;\n\t}\n}\n" }, { "path": "src/test/resources/samples/langs/HLSL/jellyfish.fx", "content": "float4x4 matWorldViewProjection : WORLDVIEWPROJECTION;\nfloat4x4 matWorldView : WORLDVIEW;\nfloat4x4 matWorld : WORLD;\nfloat4x4 matView : VIEW;\n\nuniform float4 vViewPosition;\n\nstruct VS_INPUT \n{\n\tfloat3 Pos: POSITION;\n\tfloat3 Normal: NORMAL;\n\tfloat3 Tangent: TANGENT;\n\tfloat3 Binormal: BINORMAL;\n};\n\nstruct VS_OUTPUT \n{\n\tfloat4 Pos : POSITION;\n\tfloat3 reflection : TEXCOORD1; \n\tfloat3 refraction : TEXCOORD2; \n\tfloat fresnel : TEXCOORD3;\n};\n\nuniform float3 amt;\nuniform float3 scale;\nuniform float3 phase;\n\nfloat3 deform(float3 p)\n{\n\tfloat s = 3;\n\tfloat3 p2 = p * scale + phase;\n\ts += sin(p2.x) * amt.x;\n\ts += sin(p2.y) * amt.y;\n\ts += sin(p2.z) * amt.z;\n\treturn p * s / 3;\n}\n\nVS_OUTPUT vs_main( VS_INPUT In )\n{\n\tVS_OUTPUT Out;\n\n\tfloat3 pos = In.Pos;\n\tfloat3 norm = In.Normal;\n\n\tfloat3 p1 = pos + In.Tangent * 0.05;\n\tfloat3 p2 = pos + In.Binormal * 0.05;\n\tpos = deform(pos);\n\tp1 = deform(p1);\n\tp2 = deform(p2);\n\n\tp1 -= pos;\n\tp2 -= pos;\n\tnorm = normalize(cross(p1, p2));\n\n\tfloat3 view = normalize(pos - vViewPosition.xyz);\n\n\tOut.Pos = mul(float4(pos, 1.0), matWorldViewProjection);\n\tOut.reflection = reflect(view, norm);\n\tOut.refraction = reflect(view, norm * 0.4f); /* fake, but who cares? */\n\tOut.fresnel = dot(view, norm);\n\tnorm = mul(float4(norm, 0.0), matWorldViewProjection);\n\n\treturn Out;\n}\n\n#define PS_INPUT VS_OUTPUT\n\n#if 0\ntextureCUBE reflectionMap;\nsamplerCUBE reflectionMapSampler = sampler_state\n{\n\tTexture = (reflectionMap);\n\tMipFilter = LINEAR;\n\tMinFilter = LINEAR;\n\tMagFilter = LINEAR;\n};\n#else\n// textures\ntexture reflectionMap \n< \n string type = \"CUBE\";\n string name = \"test_cube.dds\";\n>;\n\nsamplerCUBE reflectionMapSampler = sampler_state\n{\n\tTexture = (reflectionMap);\n\tMipFilter = LINEAR;\n\tMinFilter = LINEAR;\n\tMagFilter = LINEAR;\n};\n#endif\n\nstruct PS_OUTPUT \n{\n float4 color : COLOR0;\n};\n\nPS_OUTPUT ps_main( PS_INPUT In )\n{\n\tPS_OUTPUT Out;\n\t\n\tfloat4 reflection = texCUBE(reflectionMapSampler, normalize(In.reflection)) * 1.5;\n\tfloat4 refraction = texCUBE(reflectionMapSampler, normalize(In.refraction));\n\tfloat fresnel = In.fresnel;\n//\tfloat fresnel = abs(normalize(In.normal).z);\n\tOut.color = lerp(reflection, refraction, fresnel) * pow(1.0 - fresnel * 0.75, 1.0);\n\n\treturn Out;\n}\n\ntechnique blur_ps_vs_2_0\n{\n\tpass P0\n\t{\n\t\tVertexShader = compile vs_2_0 vs_main();\n\t\tPixelShader = compile ps_2_0 ps_main();\n\t}\n}\n" }, { "path": "src/test/resources/samples/langs/HLSL/noise.fx", "content": "float alpha = 1.f;\n\ntexture tex;\nsampler tex_sampler = sampler_state\n{\n\tTexture = (tex);\n\tMipFilter = LINEAR;\n\tMinFilter = LINEAR;\n\tMagFilter = LINEAR;\n\t\n\tAddressU = WRAP;\n\tAddressV = WRAP;\n};\n\nstruct VS_OUTPUT\n{\n\tfloat4 pos : POSITION;\n\tfloat2 tex : TEXCOORD1;\n};\n\nVS_OUTPUT vertex(float4 ipos : POSITION, float2 tex : TEXCOORD0)\n{\n\tVS_OUTPUT Out;\n\tOut.pos = ipos;\n\tOut.tex = tex * 2;\n\treturn Out;\n}\n\nfloat4 pixel(VS_OUTPUT In) : COLOR\n{\n\treturn tex2D(tex_sampler, In.tex) * alpha;\n}\n\ntechnique blur_ps_vs_2_0\n{\n\tpass P0\n\t{\n\t\tVertexShader = compile vs_2_0 vertex();\n\t\tPixelShader = compile ps_2_0 pixel();\n\t}\n}\n" }, { "path": "src/test/resources/samples/langs/HTML/ApiOverviewPage.st", "content": "\n\n\n$Common_meta()$\n\nAndroid API Differences Report\n\n\n
\n\n$Header()$\n\n\n
\n

Android API Differences Report

\n

This document details the changes in the Android framework API. It shows \nadditions, modifications, and removals for packages, classes, methods, and \nfields. Each reference to an API change includes a brief description of the \nAPI and an explanation of the change and suggested workaround, where available.

\n\n

The differences described in this report are based a comparison of the APIs \nwhose versions are specified in the upper-right corner of this page. It compares a \nnewer \"to\" API to an older \"from\" version, noting any changes relative to the \nolder API. So, for example, indicated API removals are no longer present in the \"to\" \nAPI.

\n

For more information about the Android framework API and SDK, \nsee the Android product site.

\n\n$if(no_delta)$\n

Congratulation!

\nNo differences were detected between the two provided APIs.\n$endif$\n\n\n$if(removed_packages)$\n$Table(name=\"Removed Packages\", rows=removed_packages:{$it.from:ModelElementRow()$})$\n
\n$endif$\n\n\n$if(added_packages)$\n$Table(name=\"Added Packages\", rows=added_packages:{$it.to:PackageAddedLink()$}:SimpleTableRow())$\n
\n$endif$\n\n$if(changed_packages)$\n$Table(name=\"Changed Packages\", rows=changed_packages:{$it.to:PackageChangedLink()$}:SimpleTableRow())$\n
\n$endif$\n
\n\n\n
\n\n\n\n\n\n\n\n" }, { "path": "src/test/resources/samples/langs/HTML/example.xht", "content": "\n\n \n This is a XHTML sample file\n \n \n \n
\n Just a simple XHTML test page.\n
\n \n\n\n" }, { "path": "src/test/resources/samples/langs/HTML/index.html.hl", "content": "\n\n\n \n \n \n \n \n
\n

Example 1

\n \n \n \n \n \n
\n \n \n
\n \n

~{x}

\n \n
\n
\n
\n\n \n
\n

Example 2

\n \n \n \n \n \n
\n \n \n
\n \n

~{x}

\n \n
\n
\n
\n \n \n
\n

Example 3

\n \n \n \n \n \n
\n \n \n \n
\n \n

~{x}

\n \n
\n
\n
\n\n \n
\n

Example 4

\n \n \n \n \n \n
\n \n \n
\n
\n
\n\n \n
\n

Example 5

\n \n \n \n \n \n
\n \n \n
\n
\n
\n\n \n
\n

Example 6

\n \n \n \n \n \n
\n \n \n
\n
\n \n

~{x}

\n \n
\n
\n
\n
\n\n \n
\n

Example 7

\n \n \n \n \n \n
\n \n \n
\n
\n \n

~{x}

\n \n
\n
\n
\n
\n\n \n
\n

Example 8

\n \n \n \n \n \n
\n \n \n
\n
\n \n

~{x}

\n \n
\n
\n
\n
\n\n \n
\n

Example 9

\n \n \n \n \n \n
\n \n \n
\n
\n\n \n
\n

Example 10

\n \n \n \n \n \n
\n \n \n \n
\n
\n \n\n" }, { "path": "src/test/resources/samples/langs/HTML/pages.html", "content": "\n\n\n\nRelated Pages\n\n\n\n
\nMain Page ·\nClass Overview ·\nHierarchy ·\nAll Classes\n
\n\n\n
\n
\n
Related Pages
\n
\n
\n
Here is a list of all related documentation pages:
\n\n\n\n
\"o\"Class Overview
\"\\\"The Layout System
\n
\n
\n
Generated with Doxygen 1.8.1.2
\n\n\n" }, { "path": "src/test/resources/samples/langs/HTML/rpanel.inc", "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

+7-902-7-800-807

\n
\n

Регионы:

\n 		\n

+7-902-7-800-807

\n
\n\n" }, { "path": "src/test/resources/samples/langs/HTML/tailDel.inc", "content": "\n

Supported Targets

\n\n\n\n" }, { "path": "src/test/resources/samples/langs/HTML+Django/_worker.jinja2", "content": "

Workers

\n\n\n \n \n \n \n \n \n \n\n{% for server_info in server_infos %}\n \n \n \n \n \n \n \n \n \n {% if not server_info['failed'] %}\n {% for worker in server_info['workers'] %}\n \n \n \n \n \n \n \n {% endfor %}\n {% endif %}\n{% endfor %}\n
Job serverIPFile descriptorClient IDFunctions
{{ server_info['hostport'][0] }}:{{ server_info['hostport'][1] }}\n {%- if server_info['failed'] -%} Not responding! {%- endif -%}\n
{{ worker['ip'] }}{{ worker['file_descriptor'] }}{{ worker['client_id'] }}\n {{ worker['tasks']|join(', ') }}\n
\n" }, { "path": "src/test/resources/samples/langs/HTML+Django/nunjucks.njk", "content": "{% from \"forms.html\" import label as description %}\n\n\n{% macro field(name, value='', type='text') %}\n
\n \n
\n{% endmacro %}\n\n\n\n {% extends \"head.html\" %}\n\n\n{% if horse %}\n Chuck Norris once kicked a horse in the chin. Its descendants are known today as Giraffes.\n{% elif optimus %}\n Chuck Norris once urinated in a semi truck's gas tank as a joke....that truck is now known as Optimus Prime.\n{% else %}\n Chuck Norris threw a grenade and killed 50 people, then the grenade exploded.\n{% endif %}\n\n{% block left %}\n This is the left side!\n{% endblock %}\n\n{% block right %}\n This is the right side!\n{% endblock %}\n\n{{ description('Username') }}\n{{ field('user') }}\n{{ field('pass', type='password') }}\n\n

Posts

\n
    \n {% for item in items %}\n
  • {{ item.title }}
    • \n {% else %}\n
  • This would display if the 'item' collection were empty
    • \n {% endfor %}\n
\n\n{# Don't escape foo #}\n{{ foo | safe }}\n\n\n" }, { "path": "src/test/resources/samples/langs/HTML+ECR/greeting.ecr", "content": "<% if @name %>\n Greeting, <%= @name %>!\n<% else %>\n Greeting!\n<% end %>\n" }, { "path": "src/test/resources/samples/langs/HTML+EEX/index.html.eex", "content": "

Listing Books

\n \n\n \n \n \n \n \n \n \n\n<%= for book <- @books do %>\n \n <%# comment %>\n \n \n \n \n \n \n<% end %>\n
TitleSummary
<%= book.title %><%= book.content %><%= link \"Show\", to: book_path(@conn, :show, book) %><%= link \"Edit\", to: book_path(@conn, :edit, book) %><%= link \"Delete\", to: book_path(@conn, :delete, book), method: :delete, data: [confirm: \"Are you sure?\"] %>
\n \n
\n \n<%= link \"New book\", to: book_path(@conn, :new) %>\n" }, { "path": "src/test/resources/samples/langs/HTML+ERB/fishbowl.html.erb.deface", "content": "\n<% if Spree::Config[:enable_fishbowl] %>\n
\n
\n
\n <%= t(:fishbowl_settings)%>\n <% @fishbowl_options.each do |key| %>\n
\n <%= label_tag(key, t(key.to_s.gsub('fishbowl_', '').to_sym) + ': ') + tag(:br) %>\n <%= text_field_tag('preferences[' + key.to_s + ']', Spree::Config[key], { :size => 10, :class => 'fullwidth' }) %>\n
\n <% end %>\n
\n <%= hidden_field_tag 'preferences[fishbowl_always_fetch_current_inventory]', '0' %>\n <%= check_box_tag('preferences[fishbowl_always_fetch_current_inventory]', \"1\", Spree::Config[:fishbowl_always_fetch_current_inventory]) %>\n <%= t(:always_fetch_current_inventory) %>\n
\n <% if !@location_groups.empty? %>\n
\n <%= label_tag(:fishbowl_location_group, t(:location_group) + ': ') + tag(:br) %>\n <%= select('preferences', 'fishbowl_location_group', @location_groups, { :selected => Spree::Config[:fishbowl_location_group]}, { :class => ['select2', 'fullwidth'] }) %>\n
\n <% end %>\n
\n
\n
\n\n\n<% end %>" }, { "path": "src/test/resources/samples/langs/HTML+ERB/index.html.erb", "content": "<% provide(:title, @header) %>\n<% present @users do |user_presenter| %>\n\t
\n\t\t

<%= @header %>

\n\t
\n\n\t
\n\t\t
\n\t\t\t<%= will_paginate %>\n\t\t
\n\t
\n\t
\n\t\t
\n\t\t\t
\n\t\t\t\t
Name
\n\t\t\t\t
Email
\n\t\t\t\t
Chords
\n\t\t\t\t
Keys
\n\t\t\t\t
Tunings
\n\t\t\t\t
Credits
\n\t\t\t\t
Prem?
\n\t\t\t\t
Since?
\n\t\t\t
\n\n\t\t\t<% if @users == [] %>\n\t\t\t\t
\n\t\t\t\t\t
No Users
\n\t\t\t\t
\n\t\t\t<% else %>\n\t\t\t\t<%= render @users %>\n\t\t\t<% end %>\n\t\t
\n\t
\n\t
\n\t\t
\n\t\t\t<%= will_paginate %>\n\t\t
\n\t
\n<% end %>" }, { "path": "src/test/resources/samples/langs/HXML/checkstyle.hxml", "content": "buildGlobal.hxml\n-lib mcover:2.1.1\n-D unittest\n-x TestMain\n--macro mcover.MCover.coverage(['checkstyle'], ['src'], ['checkstyle.reporter', 'checkstyle.Main'])\n\n--next\n-cmd neko run -s src -s test -p resources/static-analysis.txt\n-cmd neko run --default-config resources/default-config.json\n-cmd neko run -c resources/default-config.json\n" }, { "path": "src/test/resources/samples/langs/HXML/vshaxe.hxml", "content": "# This file is generated with vshaxe-build - DO NOT EDIT MANUALLY!\n-cp vscode-extern/src\n-cp src-api\n-cp src\n-cp server/src\n-cp server/protocol/src\n-cp server/formatter/src\n-cp server/test\n-cp server/formatter/test\n-cp syntaxes/src\n-D analyzer-optimize\n-D js_unflatten\n-D hxnodejs-no-version-warning\n-D JSTACK_MAIN=vshaxe.Main.main\n-D JSTACK_ASYNC_ENTRY\n-D JSTACK_FORMAT=vscode\n-lib hxnodejs\n-lib jstack\n-lib haxe-hxparser\n-lib compiletime\n-lib mockatoo\n-lib mconsole\n-lib hx3compat\n-lib hxargs\n-lib json2object\n-lib yaml\n-lib plist\n-debug\n-js bin/build.js\n--no-inline\n-main Build\n" }, { "path": "src/test/resources/samples/langs/Hack/Assert.hh", "content": "(\n (function(mixed): T) $fn,\n mixed $x,\n ): array {\n if (is_array($x)) {\n return array_map($fn, $x);\n }\n throw new AssertException('Expected an array');\n }\n}\n" }, { "path": "src/test/resources/samples/langs/Hack/AssertRecipe.hh", "content": ">\n protected function getDescription(): ?string {\n return 'When you have values with unknown types, it is useful to make '.\n 'some runtime assertions and have the type checker understand. This '.\n 'recipe demonstrates one approach.';\n }\n\n protected function getFilenames(): Vector {\n return Vector {\n 'Assert.php',\n };\n }\n\n protected function getDocs(): Vector<(string, string)> {\n return Vector{\n tuple ('Mixed Types', 'hack.annotations.mixedtypes'),\n tuple ('Type Inference', 'hack.otherrulesandfeatures.typeinference'),\n };\n }\n\n public function getDemoFilename(): string {\n return 'demo.php';\n }\n\n public function getDemoResult(): string {\n return assert_main();\n }\n\n public function getDemoXHP(): ?:xhp {\n return null;\n }\n}\n" }, { "path": "src/test/resources/samples/langs/Hack/Controller.hh", "content": ";\n abstract protected function getJS(): Set;\n abstract protected function getTitle(): string;\n abstract protected function render(): :xhp;\n\n final protected function getHead(): :xhp {\n $css = $this->getCSS()->toVector()->map(\n ($css) ==> \n );\n $js = $this->getJS()->toVector()->map(\n ($js) ==> \n\n\n\n
\n
" }, { "path": "src/test/resources/samples/langs/JavaScript/basic.vue", "content": "\n\n\n\n\n" }, { "path": "src/test/resources/samples/langs/JavaScript/bootstrap-modal.js", "content": "/* =========================================================\n * bootstrap-modal.js v2.0.4\n * http://twitter.github.com/bootstrap/javascript.html#modals\n * =========================================================\n * Copyright 2012 Twitter, Inc.\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\n\n!function ($) {\n\n \"use strict\"; // jshint ;_;\n\n\n /* MODAL CLASS DEFINITION\n * ====================== */\n\n var Modal = function (content, options) {\n this.options = options\n this.$element = $(content)\n .delegate('[data-dismiss=\"modal\"]', 'click.dismiss.modal', $.proxy(this.hide, this))\n }\n\n Modal.prototype = {\n\n constructor: Modal\n\n , toggle: function () {\n return this[!this.isShown ? 'show' : 'hide']()\n }\n\n , show: function () {\n var that = this\n , e = $.Event('show')\n\n this.$element.trigger(e)\n\n if (this.isShown || e.isDefaultPrevented()) return\n\n $('body').addClass('modal-open')\n\n this.isShown = true\n\n escape.call(this)\n backdrop.call(this, function () {\n var transition = $.support.transition && that.$element.hasClass('fade')\n\n if (!that.$element.parent().length) {\n that.$element.appendTo(document.body) //don't move modals dom position\n }\n\n that.$element\n .show()\n\n if (transition) {\n that.$element[0].offsetWidth // force reflow\n }\n\n that.$element.addClass('in')\n\n transition ?\n that.$element.one($.support.transition.end, function () { that.$element.trigger('shown') }) :\n that.$element.trigger('shown')\n\n })\n }\n\n , hide: function (e) {\n e && e.preventDefault()\n\n var that = this\n\n e = $.Event('hide')\n\n this.$element.trigger(e)\n\n if (!this.isShown || e.isDefaultPrevented()) return\n\n this.isShown = false\n\n $('body').removeClass('modal-open')\n\n escape.call(this)\n\n this.$element.removeClass('in')\n\n $.support.transition && this.$element.hasClass('fade') ?\n hideWithTransition.call(this) :\n hideModal.call(this)\n }\n\n }\n\n\n /* MODAL PRIVATE METHODS\n * ===================== */\n\n function hideWithTransition() {\n var that = this\n , timeout = setTimeout(function () {\n that.$element.off($.support.transition.end)\n hideModal.call(that)\n }, 500)\n\n this.$element.one($.support.transition.end, function () {\n clearTimeout(timeout)\n hideModal.call(that)\n })\n }\n\n function hideModal(that) {\n this.$element\n .hide()\n .trigger('hidden')\n\n backdrop.call(this)\n }\n\n function backdrop(callback) {\n var that = this\n , animate = this.$element.hasClass('fade') ? 'fade' : ''\n\n if (this.isShown && this.options.backdrop) {\n var doAnimate = $.support.transition && animate\n\n this.$backdrop = $('
')\n .appendTo(document.body)\n\n if (this.options.backdrop != 'static') {\n this.$backdrop.click($.proxy(this.hide, this))\n }\n\n if (doAnimate) this.$backdrop[0].offsetWidth // force reflow\n\n this.$backdrop.addClass('in')\n\n doAnimate ?\n this.$backdrop.one($.support.transition.end, callback) :\n callback()\n\n } else if (!this.isShown && this.$backdrop) {\n this.$backdrop.removeClass('in')\n\n $.support.transition && this.$element.hasClass('fade')?\n this.$backdrop.one($.support.transition.end, $.proxy(removeBackdrop, this)) :\n removeBackdrop.call(this)\n\n } else if (callback) {\n callback()\n }\n }\n\n function removeBackdrop() {\n this.$backdrop.remove()\n this.$backdrop = null\n }\n\n function escape() {\n var that = this\n if (this.isShown && this.options.keyboard) {\n $(document).on('keyup.dismiss.modal', function ( e ) {\n e.which == 27 && that.hide()\n })\n } else if (!this.isShown) {\n $(document).off('keyup.dismiss.modal')\n }\n }\n\n\n /* MODAL PLUGIN DEFINITION\n * ======================= */\n\n $.fn.modal = function (option) {\n return this.each(function () {\n var $this = $(this)\n , data = $this.data('modal')\n , options = $.extend({}, $.fn.modal.defaults, $this.data(), typeof option == 'object' && option)\n if (!data) $this.data('modal', (data = new Modal(this, options)))\n if (typeof option == 'string') data[option]()\n else if (options.show) data.show()\n })\n }\n\n $.fn.modal.defaults = {\n backdrop: true\n , keyboard: true\n , show: true\n }\n\n $.fn.modal.Constructor = Modal\n\n\n /* MODAL DATA-API\n * ============== */\n\n $(function () {\n $('body').on('click.modal.data-api', '[data-toggle=\"modal\"]', function ( e ) {\n var $this = $(this), href\n , $target = $($this.attr('data-target') || (href = $this.attr('href')) && href.replace(/.*(?=#[^\\s]+$)/, '')) //strip for ie7\n , option = $target.data('modal') ? 'toggle' : $.extend({}, $target.data(), $this.data())\n\n e.preventDefault()\n $target.modal(option)\n })\n })\n\n}(window.jQuery);" }, { "path": "src/test/resources/samples/langs/JavaScript/ccalc-lex.js", "content": "/* generated by jison-lex 0.3.4-159 */\nvar ccalcLex = (function () {\n// See also:\n// http://stackoverflow.com/questions/1382107/whats-a-good-way-to-extend-error-in-javascript/#35881508\n// but we keep the prototype.constructor and prototype.name assignment lines too for compatibility\n// with userland code which might access the derived class in a 'classic' way.\nfunction JisonLexerError(msg, hash) {\n Object.defineProperty(this, 'name', {\n enumerable: false,\n writable: false,\n value: 'JisonLexerError'\n });\n\n if (msg == null) msg = '???';\n\n Object.defineProperty(this, 'message', {\n enumerable: false,\n writable: true,\n value: msg\n });\n\n this.hash = hash;\n\n var stacktrace;\n if (hash && hash.exception instanceof Error) {\n var ex2 = hash.exception;\n this.message = ex2.message || msg;\n stacktrace = ex2.stack;\n }\n if (!stacktrace) {\n if (Error.hasOwnProperty('captureStackTrace')) { // V8\n Error.captureStackTrace(this, this.constructor);\n } else {\n stacktrace = (new Error(msg)).stack;\n }\n }\n if (stacktrace) {\n Object.defineProperty(this, 'stack', {\n enumerable: false,\n writable: false,\n value: stacktrace\n });\n }\n}\n\nif (typeof Object.setPrototypeOf === 'function') {\n Object.setPrototypeOf(JisonLexerError.prototype, Error.prototype);\n} else {\n JisonLexerError.prototype = Object.create(Error.prototype);\n}\nJisonLexerError.prototype.constructor = JisonLexerError;\nJisonLexerError.prototype.name = 'JisonLexerError';\n\n\nvar lexer = {\n EOF: 1,\n ERROR: 2,\n\n // JisonLexerError: JisonLexerError, // <-- injected by the code generator\n\n // options: {}, // <-- injected by the code generator\n\n // yy: ..., // <-- injected by setInput()\n\n __currentRuleSet__: null, // <-- internal rule set cache for the current lexer state\n\n __error_infos: [], // INTERNAL USE ONLY: the set of lexErrorInfo objects created since the last cleanup\n\n __decompressed: false, // INTERNAL USE ONLY: mark whether the lexer instance has been 'unfolded' completely and is now ready for use\n\n done: false, // INTERNAL USE ONLY\n _backtrack: false, // INTERNAL USE ONLY\n _input: '', // INTERNAL USE ONLY\n _more: false, // INTERNAL USE ONLY\n _signaled_error_token: false, // INTERNAL USE ONLY\n\n conditionStack: [], // INTERNAL USE ONLY; managed via `pushState()`, `popState()`, `topState()` and `stateStackSize()`\n\n match: '', // READ-ONLY EXTERNAL ACCESS - ADVANCED USE ONLY: tracks input which has been matched so far for the lexer token under construction. `match` is identical to `yytext` except that this one still contains the matched input string after `lexer.performAction()` has been invoked, where userland code MAY have changed/replaced the `yytext` value entirely!\n matched: '', // READ-ONLY EXTERNAL ACCESS - ADVANCED USE ONLY: tracks entire input which has been matched so far\n matches: false, // READ-ONLY EXTERNAL ACCESS - ADVANCED USE ONLY: tracks RE match result for last (successful) match attempt\n yytext: '', // ADVANCED USE ONLY: tracks input which has been matched so far for the lexer token under construction; this value is transferred to the parser as the 'token value' when the parser consumes the lexer token produced through a call to the `lex()` API.\n offset: 0, // READ-ONLY EXTERNAL ACCESS - ADVANCED USE ONLY: tracks the 'cursor position' in the input string, i.e. the number of characters matched so far\n yyleng: 0, // READ-ONLY EXTERNAL ACCESS - ADVANCED USE ONLY: length of matched input for the token under construction (`yytext`)\n yylineno: 0, // READ-ONLY EXTERNAL ACCESS - ADVANCED USE ONLY: 'line number' at which the token under construction is located\n yylloc: null, // READ-ONLY EXTERNAL ACCESS - ADVANCED USE ONLY: tracks location info (lines + columns) for the token under construction\n\n // INTERNAL USE: construct a suitable error info hash object instance for `parseError`.\n constructLexErrorInfo: function lexer_constructLexErrorInfo(msg, recoverable) {\n var pei = {\n errStr: msg,\n recoverable: !!recoverable,\n text: this.match, // This one MAY be empty; userland code should use the `upcomingInput` API to obtain more text which follows the 'lexer cursor position'...\n token: null,\n line: this.yylineno,\n loc: this.yylloc,\n yy: this.yy,\n lexer: this,\n\n // and make sure the error info doesn't stay due to potential\n // ref cycle via userland code manipulations.\n // These would otherwise all be memory leak opportunities!\n //\n // Note that only array and object references are nuked as those\n // constitute the set of elements which can produce a cyclic ref.\n // The rest of the members is kept intact as they are harmless.\n destroy: function destructLexErrorInfo() {\n // remove cyclic references added to error info:\n // info.yy = null;\n // info.lexer = null;\n // ...\n var rec = !!this.recoverable;\n for (var key in this) {\n if (this.hasOwnProperty(key) && typeof key === 'object') {\n this[key] = undefined;\n }\n }\n this.recoverable = rec;\n }\n };\n // track this instance so we can `destroy()` it once we deem it superfluous and ready for garbage collection!\n this.__error_infos.push(pei);\n return pei;\n },\n\n parseError: function lexer_parseError(str, hash) {\n if (this.yy.parser && typeof this.yy.parser.parseError === 'function') {\n return this.yy.parser.parseError(str, hash) || this.ERROR;\n } else if (typeof this.yy.parseError === 'function') {\n return this.yy.parseError.call(this, str, hash) || this.ERROR;\n } else {\n throw new this.JisonLexerError(str);\n }\n },\n\n // final cleanup function for when we have completed lexing the input; \n // make it an API so that external code can use this one once userland\n // code has decided it's time to destroy any lingering lexer error\n // hash object instances and the like: this function helps to clean\n // up these constructs, which *may* carry cyclic references which would\n // otherwise prevent the instances from being properly and timely\n // garbage-collected, i.e. this function helps prevent memory leaks!\n cleanupAfterLex: function lexer_cleanupAfterLex(do_not_nuke_errorinfos) {\n var rv;\n\n // prevent lingering circular references from causing memory leaks:\n this.setInput('', {});\n\n // nuke the error hash info instances created during this run.\n // Userland code must COPY any data/references\n // in the error hash instance(s) it is more permanently interested in.\n if (!do_not_nuke_errorinfos) {\n for (var i = this.__error_infos.length - 1; i >= 0; i--) {\n var el = this.__error_infos[i];\n if (el && typeof el.destroy === 'function') {\n el.destroy();\n }\n }\n this.__error_infos.length = 0;\n }\n\n return this;\n },\n\n // clear the lexer token context; intended for internal use only\n clear: function lexer_clear() {\n this.yytext = '';\n this.yyleng = 0;\n this.match = '';\n this.matches = false;\n this._more = false;\n this._backtrack = false;\n },\n\n // resets the lexer, sets new input\n setInput: function lexer_setInput(input, yy) {\n this.yy = yy || this.yy || {};\n\n // also check if we've fully initialized the lexer instance,\n // including expansion work to be done to go from a loaded\n // lexer to a usable lexer:\n if (!this.__decompressed) {\n // step 1: decompress the regex list:\n var rules = this.rules;\n for (var i = 0, len = rules.length; i < len; i++) {\n var rule_re = rules[i];\n\n // compression: is the RE an xref to another RE slot in the rules[] table?\n if (typeof rule_re === 'number') {\n rules[i] = rules[rule_re];\n }\n }\n\n // step 2: unfold the conditions[] set to make these ready for use:\n var conditions = this.conditions;\n for (var k in conditions) {\n var spec = conditions[k];\n\n var rule_ids = spec.rules;\n\n var len = rule_ids.length;\n var rule_regexes = new Array(len + 1); // slot 0 is unused; we use a 1-based index approach here to keep the hottest code in `lexer_next()` fast and simple!\n var rule_new_ids = new Array(len + 1);\n\n if (this.rules_prefix1) {\n var rule_prefixes = new Array(65536);\n var first_catch_all_index = 0;\n\n for (var i = 0; i < len; i++) {\n var idx = rule_ids[i];\n var rule_re = rules[idx];\n rule_regexes[i + 1] = rule_re;\n rule_new_ids[i + 1] = idx;\n\n var prefix = this.rules_prefix1[idx];\n // compression: is the PREFIX-STRING an xref to another PREFIX-STRING slot in the rules_prefix1[] table?\n if (typeof prefix === 'number') {\n prefix = this.rules_prefix1[prefix];\n }\n // init the prefix lookup table: first come, first serve...\n if (!prefix) {\n if (!first_catch_all_index) {\n first_catch_all_index = i + 1;\n }\n } else {\n for (var j = 0, pfxlen = prefix.length; j < pfxlen; j++) {\n var pfxch = prefix.charCodeAt(j);\n // first come, first serve:\n if (!rule_prefixes[pfxch]) {\n rule_prefixes[pfxch] = i + 1;\n } \n }\n }\n }\n\n // if no catch-all prefix has been encountered yet, it means all\n // rules have limited prefix sets and it MAY be that particular\n // input characters won't be recognized by any rule in this \n // condition state.\n // \n // To speed up their discovery at run-time while keeping the\n // remainder of the lexer kernel code very simple (and fast),\n // we point these to an 'illegal' rule set index *beyond*\n // the end of the rule set.\n if (!first_catch_all_index) {\n first_catch_all_index = len + 1;\n }\n\n for (var i = 0; i < 65536; i++) {\n if (!rule_prefixes[i]) {\n rule_prefixes[i] = first_catch_all_index; \n }\n }\n\n spec.__dispatch_lut = rule_prefixes;\n } else {\n for (var i = 0; i < len; i++) {\n var idx = rule_ids[i];\n var rule_re = rules[idx];\n rule_regexes[i + 1] = rule_re;\n rule_new_ids[i + 1] = idx;\n }\n }\n\n spec.rules = rule_new_ids;\n spec.__rule_regexes = rule_regexes;\n spec.__rule_count = len;\n }\n\n this.__decompressed = true;\n }\n\n this._input = input || '';\n this.clear();\n this._signaled_error_token = false;\n this.done = false;\n this.yylineno = 0;\n this.matched = '';\n this.conditionStack = ['INITIAL'];\n this.__currentRuleSet__ = null;\n this.yylloc = {\n first_line: 1,\n first_column: 0,\n last_line: 1,\n last_column: 0\n };\n if (this.options.ranges) {\n this.yylloc.range = [0, 0];\n }\n this.offset = 0;\n return this;\n },\n\n // consumes and returns one char from the input\n input: function lexer_input() {\n if (!this._input) {\n this.done = true;\n return null;\n }\n var ch = this._input[0];\n this.yytext += ch;\n this.yyleng++;\n this.offset++;\n this.match += ch;\n this.matched += ch;\n // Count the linenumber up when we hit the LF (or a stand-alone CR).\n // On CRLF, the linenumber is incremented when you fetch the CR or the CRLF combo\n // and we advance immediately past the LF as well, returning both together as if\n // it was all a single 'character' only.\n var slice_len = 1;\n var lines = false;\n if (ch === '\\n') {\n lines = true;\n } else if (ch === '\\r') {\n lines = true;\n var ch2 = this._input[1];\n if (ch2 === '\\n') {\n slice_len++;\n ch += ch2;\n this.yytext += ch2;\n this.yyleng++;\n this.offset++;\n this.match += ch2;\n this.matched += ch2;\n if (this.options.ranges) {\n this.yylloc.range[1]++;\n }\n }\n }\n if (lines) {\n this.yylineno++;\n this.yylloc.last_line++;\n } else {\n this.yylloc.last_column++;\n }\n if (this.options.ranges) {\n this.yylloc.range[1]++;\n }\n\n this._input = this._input.slice(slice_len);\n return ch;\n },\n\n // unshifts one char (or a string) into the input\n unput: function lexer_unput(ch) {\n var len = ch.length;\n var lines = ch.split(/(?:\\r\\n?|\\n)/g);\n\n this._input = ch + this._input;\n this.yytext = this.yytext.substr(0, this.yytext.length - len);\n //this.yyleng -= len;\n this.offset -= len;\n var oldLines = this.match.split(/(?:\\r\\n?|\\n)/g);\n this.match = this.match.substr(0, this.match.length - len);\n this.matched = this.matched.substr(0, this.matched.length - len);\n\n if (lines.length - 1) {\n this.yylineno -= lines.length - 1;\n }\n\n this.yylloc.last_line = this.yylineno + 1;\n this.yylloc.last_column = (lines ?\n (lines.length === oldLines.length ? this.yylloc.first_column : 0)\n + oldLines[oldLines.length - lines.length].length - lines[0].length :\n this.yylloc.first_column - len);\n\n if (this.options.ranges) {\n this.yylloc.range[1] = this.yylloc.range[0] + this.yyleng - len;\n }\n this.yyleng = this.yytext.length;\n this.done = false;\n return this;\n },\n\n // When called from action, caches matched text and appends it on next action\n more: function lexer_more() {\n this._more = true;\n return this;\n },\n\n // When called from action, signals the lexer that this rule fails to match the input, so the next matching rule (regex) should be tested instead.\n reject: function lexer_reject() {\n if (this.options.backtrack_lexer) {\n this._backtrack = true;\n } else {\n // when the parseError() call returns, we MUST ensure that the error is registered.\n // We accomplish this by signaling an 'error' token to be produced for the current\n // .lex() run.\n var p = this.constructLexErrorInfo('Lexical error on line ' + (this.yylineno + 1) + '. You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\\n' + this.showPosition(), false);\n this._signaled_error_token = (this.parseError(p.errStr, p) || this.ERROR);\n }\n return this;\n },\n\n // retain first n characters of the match\n less: function lexer_less(n) {\n return this.unput(this.match.slice(n));\n },\n\n // return (part of the) already matched input, i.e. for error messages.\n // Limit the returned string length to `maxSize` (default: 20).\n // Limit the returned string to the `maxLines` number of lines of input (default: 1).\n // Negative limit values equal *unlimited*.\n pastInput: function lexer_pastInput(maxSize, maxLines) {\n var past = this.matched.substring(0, this.matched.length - this.match.length);\n if (maxSize < 0)\n maxSize = past.length;\n else if (!maxSize)\n maxSize = 20;\n if (maxLines < 0)\n maxLines = past.length; // can't ever have more input lines than this!\n else if (!maxLines)\n maxLines = 1;\n // `substr` anticipation: treat \\r\\n as a single character and take a little\n // more than necessary so that we can still properly check against maxSize\n // after we've transformed and limited the newLines in here:\n past = past.substr(-maxSize * 2 - 2);\n // now that we have a significantly reduced string to process, transform the newlines\n // and chop them, then limit them:\n var a = past.replace(/\\r\\n|\\r/g, '\\n').split('\\n');\n a = a.slice(-maxLines);\n past = a.join('\\n');\n // When, after limiting to maxLines, we still have too much to return, \n // do add an ellipsis prefix...\n if (past.length > maxSize) {\n past = '...' + past.substr(-maxSize);\n }\n return past;\n },\n\n // return (part of the) upcoming input, i.e. for error messages.\n // Limit the returned string length to `maxSize` (default: 20).\n // Limit the returned string to the `maxLines` number of lines of input (default: 1).\n // Negative limit values equal *unlimited*.\n upcomingInput: function lexer_upcomingInput(maxSize, maxLines) {\n var next = this.match;\n if (maxSize < 0)\n maxSize = next.length + this._input.length;\n else if (!maxSize)\n maxSize = 20;\n if (maxLines < 0)\n maxLines = maxSize; // can't ever have more input lines than this!\n else if (!maxLines)\n maxLines = 1;\n // `substring` anticipation: treat \\r\\n as a single character and take a little\n // more than necessary so that we can still properly check against maxSize\n // after we've transformed and limited the newLines in here:\n if (next.length < maxSize * 2 + 2) {\n next += this._input.substring(0, maxSize * 2 + 2); // substring is faster on Chrome/V8\n }\n // now that we have a significantly reduced string to process, transform the newlines\n // and chop them, then limit them:\n var a = next.replace(/\\r\\n|\\r/g, '\\n').split('\\n');\n a = a.slice(0, maxLines);\n next = a.join('\\n');\n // When, after limiting to maxLines, we still have too much to return, \n // do add an ellipsis postfix...\n if (next.length > maxSize) {\n next = next.substring(0, maxSize) + '...';\n }\n return next;\n },\n\n // return a string which displays the character position where the lexing error occurred, i.e. for error messages\n showPosition: function lexer_showPosition(maxPrefix, maxPostfix) {\n var pre = this.pastInput(maxPrefix).replace(/\\s/g, ' ');\n var c = new Array(pre.length + 1).join('-');\n return pre + this.upcomingInput(maxPostfix).replace(/\\s/g, ' ') + '\\n' + c + '^';\n },\n\n // helper function, used to produce a human readable description as a string, given\n // the input `yylloc` location object. \n // Set `display_range_too` to TRUE to include the string character index position(s)\n // in the description if the `yylloc.range` is available. \n describeYYLLOC: function lexer_describe_yylloc(yylloc, display_range_too) {\n var l1 = yylloc.first_line;\n var l2 = yylloc.last_line;\n var o1 = yylloc.first_column;\n var o2 = yylloc.last_column - 1;\n var dl = l2 - l1;\n var d_o = (dl === 0 ? o2 - o1 : 1000);\n var rv;\n if (dl === 0) {\n rv = 'line ' + l1 + ', ';\n if (d_o === 0) {\n rv += 'column ' + o1;\n } else {\n rv += 'columns ' + o1 + ' .. ' + o2;\n }\n } else {\n rv = 'lines ' + l1 + '(column ' + o1 + ') .. ' + l2 + '(column ' + o2 + ')';\n }\n if (yylloc.range && display_range_too) {\n var r1 = yylloc.range[0];\n var r2 = yylloc.range[1] - 1;\n if (r2 === r1) {\n rv += ' {String Offset: ' + r1 + '}';\n } else {\n rv += ' {String Offset range: ' + r1 + ' .. ' + r2 + '}';\n }\n }\n return rv;\n // return JSON.stringify(yylloc);\n },\n\n // test the lexed token: return FALSE when not a match, otherwise return token.\n //\n // `match` is supposed to be an array coming out of a regex match, i.e. `match[0]`\n // contains the actually matched text string.\n //\n // Also move the input cursor forward and update the match collectors:\n // - yytext\n // - yyleng\n // - match\n // - matches\n // - yylloc\n // - offset\n test_match: function lexer_test_match(match, indexed_rule) {\n var token,\n lines,\n backup,\n match_str;\n\n if (this.options.backtrack_lexer) {\n // save context\n backup = {\n yylineno: this.yylineno,\n yylloc: {\n first_line: this.yylloc.first_line,\n last_line: this.last_line,\n first_column: this.yylloc.first_column,\n last_column: this.yylloc.last_column\n },\n yytext: this.yytext,\n match: this.match,\n matches: this.matches,\n matched: this.matched,\n yyleng: this.yyleng,\n offset: this.offset,\n _more: this._more,\n _input: this._input,\n yy: this.yy,\n conditionStack: this.conditionStack.slice(0),\n done: this.done\n };\n if (this.options.ranges) {\n backup.yylloc.range = this.yylloc.range.slice(0);\n }\n }\n\n match_str = match[0];\n lines = match_str.match(/(?:\\r\\n?|\\n).*/g);\n if (lines) {\n this.yylineno += lines.length;\n }\n this.yylloc = {\n first_line: this.yylloc.last_line,\n last_line: this.yylineno + 1,\n first_column: this.yylloc.last_column,\n last_column: lines ?\n lines[lines.length - 1].length - lines[lines.length - 1].match(/\\r?\\n?/)[0].length :\n this.yylloc.last_column + match_str.length\n };\n this.yytext += match_str;\n this.match += match_str;\n this.matches = match;\n this.yyleng = this.yytext.length;\n if (this.options.ranges) {\n this.yylloc.range = [this.offset, this.offset + this.yyleng];\n }\n // previous lex rules MAY have invoked the `more()` API rather than producing a token:\n // those rules will already have moved this `offset` forward matching their match lengths,\n // hence we must only add our own match length now:\n this.offset += match_str.length;\n this._more = false;\n this._backtrack = false;\n this._input = this._input.slice(match_str.length);\n this.matched += match_str;\n\n // calling this method: \n //\n // function lexer__performAction(yy, yy_, $avoiding_name_collisions, YY_START) {...}\n token = this.performAction.call(this, this.yy, this, indexed_rule, this.conditionStack[this.conditionStack.length - 1] /* = YY_START */);\n // otherwise, when the action codes are all simple return token statements:\n //token = this.simpleCaseActionClusters[indexed_rule];\n\n if (this.done && this._input) {\n this.done = false;\n }\n if (token) {\n return token;\n } else if (this._backtrack) {\n // recover context\n for (var k in backup) {\n this[k] = backup[k];\n }\n this.__currentRuleSet__ = null;\n return false; // rule action called reject() implying the next rule should be tested instead.\n } else if (this._signaled_error_token) {\n // produce one 'error' token as .parseError() in reject() did not guarantee a failure signal by throwing an exception!\n token = this._signaled_error_token;\n this._signaled_error_token = false;\n return token;\n }\n return false;\n },\n\n // return next match in input\n next: function lexer_next() {\n if (this.done) {\n this.clear();\n return this.EOF;\n }\n if (!this._input) {\n this.done = true;\n }\n\n var token,\n match,\n tempMatch,\n index;\n if (!this._more) {\n this.clear();\n }\n var spec = this.__currentRuleSet__;\n if (!spec) {\n // Update the ruleset cache as we apparently encountered a state change or just started lexing.\n // The cache is set up for fast lookup -- we assume a lexer will switch states much less often than it will\n // invoke the `lex()` token-producing API and related APIs, hence caching the set for direct access helps\n // speed up those activities a tiny bit.\n spec = this.__currentRuleSet__ = this._currentRules();\n }\n\n var rule_ids = spec.rules;\n// var dispatch = spec.__dispatch_lut;\n var regexes = spec.__rule_regexes;\n var len = spec.__rule_count;\n\n// var c0 = this._input[0];\n\n // Note: the arrays are 1-based, while `len` itself is a valid index, \n // hence the non-standard less-or-equal check in the next loop condition!\n // \n // `dispatch` is a lookup table which lists the *first* rule which matches the 1-char *prefix* of the rule-to-match.\n // By using that array as a jumpstart, we can cut down on the otherwise O(n*m) behaviour of this lexer, down to\n // O(n) ideally, where:\n // \n // - N is the number of input particles -- which is not precisely characters \n // as we progress on a per-regex-match basis rather than on a per-character basis\n // \n // - M is the number of rules (regexes) to test in the active condition state.\n // \n for (var i = 1 /* (dispatch[c0] || 1) */ ; i <= len; i++) {\n tempMatch = this._input.match(regexes[i]);\n if (tempMatch && (!match || tempMatch[0].length > match[0].length)) {\n match = tempMatch;\n index = i;\n if (this.options.backtrack_lexer) {\n token = this.test_match(tempMatch, rule_ids[i]);\n if (token !== false) {\n return token;\n } else if (this._backtrack) {\n match = undefined;\n continue; // rule action called reject() implying a rule MISmatch.\n } else {\n // else: this is a lexer rule which consumes input without producing a token (e.g. whitespace)\n return false;\n }\n } else if (!this.options.flex) {\n break;\n }\n }\n }\n if (match) {\n token = this.test_match(match, rule_ids[index]);\n if (token !== false) {\n return token;\n }\n // else: this is a lexer rule which consumes input without producing a token (e.g. whitespace)\n return false;\n }\n if (this._input === '') {\n this.done = true;\n return this.EOF;\n } else {\n var p = this.constructLexErrorInfo('Lexical error on line ' + (this.yylineno + 1) + '. Unrecognized text.\\n' + this.showPosition(), this.options.lexer_errors_are_recoverable);\n token = (this.parseError(p.errStr, p) || this.ERROR);\n if (token === this.ERROR) {\n // we can try to recover from a lexer error that parseError() did not 'recover' for us, by moving forward at least one character at a time:\n if (!this.match.length) {\n this.input();\n }\n }\n return token;\n }\n },\n\n // return next match that has a token\n lex: function lexer_lex() {\n var r;\n // allow the PRE/POST handlers set/modify the return token for maximum flexibility of the generated lexer:\n if (typeof this.options.pre_lex === 'function') {\n r = this.options.pre_lex.call(this);\n }\n while (!r) {\n r = this.next();\n }\n if (typeof this.options.post_lex === 'function') {\n // (also account for a userdef function which does not return any value: keep the token as is)\n r = this.options.post_lex.call(this, r) || r;\n }\n return r;\n },\n\n // backwards compatible alias for `pushState()`;\n // the latter is symmetrical with `popState()` and we advise to use\n // those APIs in any modern lexer code, rather than `begin()`.\n begin: function lexer_begin(condition) {\n return this.pushState(condition);\n },\n\n // activates a new lexer condition state (pushes the new lexer condition state onto the condition stack)\n pushState: function lexer_pushState(condition) {\n this.conditionStack.push(condition);\n this.__currentRuleSet__ = null;\n return this;\n },\n\n // pop the previously active lexer condition state off the condition stack\n popState: function lexer_popState() {\n var n = this.conditionStack.length - 1;\n if (n > 0) {\n this.__currentRuleSet__ = null;\n return this.conditionStack.pop();\n } else {\n return this.conditionStack[0];\n }\n },\n\n // return the currently active lexer condition state; when an index argument is provided it produces the N-th previous condition state, if available\n topState: function lexer_topState(n) {\n n = this.conditionStack.length - 1 - Math.abs(n || 0);\n if (n >= 0) {\n return this.conditionStack[n];\n } else {\n return 'INITIAL';\n }\n },\n\n // (internal) determine the lexer rule set which is active for the currently active lexer condition state\n _currentRules: function lexer__currentRules() {\n if (this.conditionStack.length && this.conditionStack[this.conditionStack.length - 1]) {\n return this.conditions[this.conditionStack[this.conditionStack.length - 1]];\n } else {\n return this.conditions['INITIAL'];\n }\n },\n\n // return the number of states currently on the stack\n stateStackSize: function lexer_stateStackSize() {\n return this.conditionStack.length;\n },\noptions: {},\nJisonLexerError: JisonLexerError,\nperformAction: function lexer__performAction(yy, yy_, $avoiding_name_collisions, YY_START) {\n\nvar YYSTATE = YY_START;\nswitch($avoiding_name_collisions) {\ncase 0 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: [ \\t\\r\\n]+ */ \n \n /* eat up whitespace */\n BeginToken(yy_.yytext); \n \nbreak;\ncase 1 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: {DIGIT}+ */ \n \n BeginToken(yy_.yytext); \n yylval.value = atof(yy_.yytext);\n return VALUE;\n \nbreak;\ncase 2 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: {DIGIT}+\\.{DIGIT}* */ \n \n BeginToken(yy_.yytext);\n yylval.value = atof(yy_.yytext);\n return VALUE;\n \nbreak;\ncase 3 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: {DIGIT}+[eE][\"+\"\"-\"]?{DIGIT}* */ \n \n BeginToken(yy_.yytext);\n yylval.value = atof(yy_.yytext);\n return VALUE;\n \nbreak;\ncase 4 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: {DIGIT}+\\.{DIGIT}*[eE][\"+\"\"-\"]?{DIGIT}* */ \n \n BeginToken(yy_.yytext);\n yylval.value = atof(yy_.yytext);\n return VALUE;\n \nbreak;\ncase 5 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: {ID} */ \n \n BeginToken(yy_.yytext);\n yylval.string = malloc(strlen(yy_.yytext)+1);\n strcpy(yylval.string, yy_.yytext);\n return IDENTIFIER;\n \nbreak;\ncase 6 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: \\+ */ \n BeginToken(yy_.yytext); return ADD; \nbreak;\ncase 7 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: - */ \n BeginToken(yy_.yytext); return SUB; \nbreak;\ncase 8 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: \\* */ \n BeginToken(yy_.yytext); return MULT; \nbreak;\ncase 9 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: \\/ */ \n BeginToken(yy_.yytext); return DIV; \nbreak;\ncase 10 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: \\( */ \n BeginToken(yy_.yytext); return LBRACE; \nbreak;\ncase 11 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: \\) */ \n BeginToken(yy_.yytext); return RBRACE; \nbreak;\ncase 12 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: ; */ \n BeginToken(yy_.yytext); return SEMICOLON; \nbreak;\ncase 13 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: = */ \n BeginToken(yy_.yytext); return ASSIGN; \nbreak;\ncase 14 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: . */ \n \n BeginToken(yy_.yytext);\n return yy_.yytext[0];\n \nbreak;\ndefault:\n return this.simpleCaseActionClusters[$avoiding_name_collisions];\n}\n},\nsimpleCaseActionClusters: {\n\n},\nrules: [\n/^(?:[ \\t\\r\\n]+)/,\n/^(?:(\\d)+)/,\n/^(?:(\\d)+\\.(\\d)*)/,\n/^(?:(\\d)+[Ee][\"+]?(\\d)*)/,\n/^(?:(\\d)+\\.(\\d)*[Ee][\"+]?(\\d)*)/,\n/^(?:([^\\W\\d]\\w*))/,\n/^(?:\\+)/,\n/^(?:-)/,\n/^(?:\\*)/,\n/^(?:\\/)/,\n/^(?:\\()/,\n/^(?:\\))/,\n/^(?:;)/,\n/^(?:=)/,\n/^(?:.)/\n],\nconditions: {\n \"INITIAL\": {\n rules: [\n 0,\n 1,\n 2,\n 3,\n 4,\n 5,\n 6,\n 7,\n 8,\n 9,\n 10,\n 11,\n 12,\n 13,\n 14\n ],\n inclusive: true\n }\n}\n};\n\n/*--------------------------------------------------------------------\n * lex.l\n *------------------------------------------------------------------*/;\nreturn lexer;\n})();" }, { "path": "src/test/resources/samples/langs/JavaScript/ccalc-parse.js", "content": "/* parser generated by jison 0.4.17-144 */\n/*\n * Returns a Parser object of the following structure:\n *\n * Parser: {\n * yy: {} The so-called \"shared state\" or rather the *source* of it;\n * the real \"shared state\" `yy` passed around to\n * the rule actions, etc. is a derivative/copy of this one,\n * not a direct reference!\n * }\n *\n * Parser.prototype: {\n * yy: {},\n * EOF: 1,\n * TERROR: 2,\n *\n * trace: function(errorMessage, ...),\n *\n * JisonParserError: function(msg, hash),\n *\n * quoteName: function(name),\n * Helper function which can be overridden by user code later on: put suitable\n * quotes around literal IDs in a description string.\n *\n * originalQuoteName: function(name),\n * The basic quoteName handler provided by JISON.\n * `cleanupAfterParse()` will clean up and reset `quoteName()` to reference this function\n * at the end of the `parse()`.\n *\n * describeSymbol: function(symbol),\n * Return a more-or-less human-readable description of the given symbol, when\n * available, or the symbol itself, serving as its own 'description' for lack\n * of something better to serve up.\n *\n * Return NULL when the symbol is unknown to the parser.\n *\n * symbols_: {associative list: name ==> number},\n * terminals_: {associative list: number ==> name},\n * nonterminals: {associative list: rule-name ==> {associative list: number ==> rule-alt}},\n * terminal_descriptions_: (if there are any) {associative list: number ==> description},\n * productions_: [...],\n *\n * performAction: function parser__performAction(yytext, yyleng, yylineno, yyloc, yy, yystate, $0, $$, _$, yystack, yysstack, ...),\n * where `...` denotes the (optional) additional arguments the user passed to\n * `parser.parse(str, ...)`\n *\n * table: [...],\n * State transition table\n * ----------------------\n *\n * index levels are:\n * - `state` --> hash table\n * - `symbol` --> action (number or array)\n *\n * If the `action` is an array, these are the elements' meaning:\n * - index [0]: 1 = shift, 2 = reduce, 3 = accept\n * - index [1]: GOTO `state`\n *\n * If the `action` is a number, it is the GOTO `state`\n *\n * defaultActions: {...},\n *\n * parseError: function(str, hash),\n * yyErrOk: function(),\n * yyClearIn: function(),\n *\n * constructParseErrorInfo: function(error_message, exception_object, expected_token_set, is_recoverable),\n * Helper function **which will be set up during the first invocation of the `parse()` method**.\n * Produces a new errorInfo 'hash object' which can be passed into `parseError()`.\n * See it's use in this parser kernel in many places; example usage:\n *\n * var infoObj = parser.constructParseErrorInfo('fail!', null,\n * parser.collect_expected_token_set(state), true);\n * var retVal = parser.parseError(infoObj.errStr, infoObj);\n *\n * originalParseError: function(str, hash),\n * The basic parseError handler provided by JISON.\n * `cleanupAfterParse()` will clean up and reset `parseError()` to reference this function\n * at the end of the `parse()`.\n *\n * options: { ... parser %options ... },\n *\n * parse: function(input[, args...]),\n * Parse the given `input` and return the parsed value (or `true` when none was provided by\n * the root action, in which case the parser is acting as a *matcher*).\n * You MAY use the additional `args...` parameters as per `%parse-param` spec of this grammar:\n * these extra `args...` are passed verbatim to the grammar rules' action code.\n *\n * cleanupAfterParse: function(resultValue, invoke_post_methods),\n * Helper function **which will be set up during the first invocation of the `parse()` method**.\n * This helper API is invoked at the end of the `parse()` call, unless an exception was thrown\n * and `%options no-try-catch` has been defined for this grammar: in that case this helper MAY\n * be invoked by calling user code to ensure the `post_parse` callbacks are invoked and\n * the internal parser gets properly garbage collected under these particular circumstances.\n *\n * lexer: {\n * yy: {...}, A reference to the so-called \"shared state\" `yy` once\n * received via a call to the `.setInput(input, yy)` lexer API.\n * EOF: 1,\n * ERROR: 2,\n * JisonLexerError: function(msg, hash),\n * parseError: function(str, hash),\n * setInput: function(input, [yy]),\n * input: function(),\n * unput: function(str),\n * more: function(),\n * reject: function(),\n * less: function(n),\n * pastInput: function(n),\n * upcomingInput: function(n),\n * showPosition: function(),\n * test_match: function(regex_match_array, rule_index),\n * next: function(),\n * lex: function(),\n * begin: function(condition),\n * pushState: function(condition),\n * popState: function(),\n * topState: function(),\n * _currentRules: function(),\n * stateStackSize: function(),\n *\n * options: { ... lexer %options ... },\n *\n * performAction: function(yy, yy_, $avoiding_name_collisions, YY_START),\n * rules: [...],\n * conditions: {associative list: name ==> set},\n * }\n * }\n *\n *\n * token location info (@$, _$, etc.): {\n * first_line: n,\n * last_line: n,\n * first_column: n,\n * last_column: n,\n * range: [start_number, end_number]\n * (where the numbers are indexes into the input string, zero-based)\n * }\n *\n * ---\n *\n * The parseError function receives a 'hash' object with these members for lexer and\n * parser errors:\n *\n * {\n * text: (matched text)\n * token: (the produced terminal token, if any)\n * token_id: (the produced terminal token numeric ID, if any)\n * line: (yylineno)\n * loc: (yylloc)\n * }\n *\n * parser (grammar) errors will also provide these additional members:\n *\n * {\n * expected: (array describing the set of expected tokens;\n * may be UNDEFINED when we cannot easily produce such a set)\n * state: (integer (or array when the table includes grammar collisions);\n * represents the current internal state of the parser kernel.\n * can, for example, be used to pass to the `collect_expected_token_set()`\n * API to obtain the expected token set)\n * action: (integer; represents the current internal action which will be executed)\n * new_state: (integer; represents the next/planned internal state, once the current\n * action has executed)\n * recoverable: (boolean: TRUE when the parser MAY have an error recovery rule\n * available for this particular error)\n * state_stack: (array: the current parser LALR/LR internal state stack; this can be used,\n * for instance, for advanced error analysis and reporting)\n * value_stack: (array: the current parser LALR/LR internal `$$` value stack; this can be used,\n * for instance, for advanced error analysis and reporting)\n * location_stack: (array: the current parser LALR/LR internal location stack; this can be used,\n * for instance, for advanced error analysis and reporting)\n * yy: (object: the current parser internal \"shared state\" `yy`\n * as is also available in the rule actions; this can be used,\n * for instance, for advanced error analysis and reporting)\n * lexer: (reference to the current lexer instance used by the parser)\n * }\n *\n * while `this` will reference the current parser instance.\n *\n * When `parseError` is invoked by the lexer, `this` will still reference the related *parser*\n * instance, while these additional `hash` fields will also be provided:\n *\n * {\n * lexer: (reference to the current lexer instance which reported the error)\n * }\n *\n * When `parseError` is invoked by the parser due to a **JavaScript exception** being fired\n * from either the parser or lexer, `this` will still reference the related *parser*\n * instance, while these additional `hash` fields will also be provided:\n *\n * {\n * exception: (reference to the exception thrown)\n * }\n *\n * Please do note that in the latter situation, the `expected` field will be omitted as\n * type of failure is assumed not to be due to *parse errors* but rather due to user\n * action code in either parser or lexer failing unexpectedly.\n *\n * ---\n *\n * You can specify parser options by setting / modifying the `.yy` object of your Parser instance.\n * These options are available:\n *\n * ### options which are global for all parser instances\n *\n * Parser.pre_parse: function(yy [, optional parse() args])\n * optional: you can specify a pre_parse() function in the chunk following\n * the grammar, i.e. after the last `%%`.\n * Parser.post_parse: function(yy, retval [, optional parse() args]) { return retval; }\n * optional: you can specify a post_parse() function in the chunk following\n * the grammar, i.e. after the last `%%`. When it does not return any value,\n * the parser will return the original `retval`.\n *\n * ### options which can be set up per parser instance\n * \n * yy: {\n * pre_parse: function(yy [, optional parse() args])\n * optional: is invoked before the parse cycle starts (and before the first\n * invocation of `lex()`) but immediately after the invocation of\n * `parser.pre_parse()`).\n * post_parse: function(yy, retval [, optional parse() args]) { return retval; }\n * optional: is invoked when the parse terminates due to success ('accept')\n * or failure (even when exceptions are thrown).\n * `retval` contains the return value to be produced by `Parser.parse()`;\n * this function can override the return value by returning another. \n * When it does not return any value, the parser will return the original\n * `retval`. \n * This function is invoked immediately before `Parser.post_parse()`.\n *\n * parseError: function(str, hash)\n * optional: overrides the default `parseError` function.\n * quoteName: function(name),\n * optional: overrides the default `quoteName` function.\n * }\n *\n * parser.lexer.options: {\n * pre_lex: function()\n * optional: is invoked before the lexer is invoked to produce another token.\n * `this` refers to the Lexer object.\n * post_lex: function(token) { return token; }\n * optional: is invoked when the lexer has produced a token `token`;\n * this function can override the returned token value by returning another.\n * When it does not return any (truthy) value, the lexer will return\n * the original `token`.\n * `this` refers to the Lexer object.\n *\n * ranges: boolean\n * optional: `true` ==> token location info will include a .range[] member.\n * flex: boolean\n * optional: `true` ==> flex-like lexing behaviour where the rules are tested\n * exhaustively to find the longest match.\n * backtrack_lexer: boolean\n * optional: `true` ==> lexer regexes are tested in order and for invoked;\n * the lexer terminates the scan when a token is returned by the action code.\n * xregexp: boolean\n * optional: `true` ==> lexer rule regexes are \"extended regex format\" requiring the\n * `XRegExp` library. When this %option has not been specified at compile time, all lexer\n * rule regexes have been written as standard JavaScript RegExp expressions.\n * }\n */\nvar ccalcParse = (function () {\n\n// See also:\n// http://stackoverflow.com/questions/1382107/whats-a-good-way-to-extend-error-in-javascript/#35881508\n// but we keep the prototype.constructor and prototype.name assignment lines too for compatibility\n// with userland code which might access the derived class in a 'classic' way.\nfunction JisonParserError(msg, hash) {\n Object.defineProperty(this, 'name', {\n enumerable: false,\n writable: false,\n value: 'JisonParserError'\n });\n\n if (msg == null) msg = '???';\n\n Object.defineProperty(this, 'message', {\n enumerable: false,\n writable: true,\n value: msg\n });\n\n this.hash = hash;\n\n var stacktrace;\n if (hash && hash.exception instanceof Error) {\n var ex2 = hash.exception;\n this.message = ex2.message || msg;\n stacktrace = ex2.stack;\n }\n if (!stacktrace) {\n if (Error.hasOwnProperty('captureStackTrace')) { // V8\n Error.captureStackTrace(this, this.constructor);\n } else {\n stacktrace = (new Error(msg)).stack;\n }\n }\n if (stacktrace) {\n Object.defineProperty(this, 'stack', {\n enumerable: false,\n writable: false,\n value: stacktrace\n });\n }\n}\n\nif (typeof Object.setPrototypeOf === 'function') {\n Object.setPrototypeOf(JisonParserError.prototype, Error.prototype);\n} else {\n JisonParserError.prototype = Object.create(Error.prototype);\n}\nJisonParserError.prototype.constructor = JisonParserError;\nJisonParserError.prototype.name = 'JisonParserError';\n\n\n\n// helper: reconstruct the productions[] table\nfunction bp(s) {\n var rv = [];\n var p = s.pop;\n var r = s.rule;\n for (var i = 0, l = p.length; i < l; i++) {\n rv.push([\n p[i],\n r[i]\n ]);\n }\n return rv;\n}\n\n\n\n// helper: reconstruct the 'goto' table\nfunction bt(s) {\n var rv = [];\n var d = s.len;\n var y = s.symbol;\n var t = s.type;\n var a = s.state;\n var m = s.mode;\n var g = s.goto;\n for (var i = 0, l = d.length; i < l; i++) {\n var n = d[i];\n var q = {};\n for (var j = 0; j < n; j++) {\n var z = y.shift();\n switch (t.shift()) {\n case 2:\n q[z] = [\n m.shift(),\n g.shift()\n ];\n break;\n\n case 0:\n q[z] = a.shift();\n break;\n\n default:\n // type === 1: accept\n q[z] = [\n 3\n ];\n }\n }\n rv.push(q);\n }\n return rv;\n}\n\n// helper: runlength encoding with increment step: code, length: step (default step = 0)\n// `this` references an array\nfunction s(c, l, a) {\n a = a || 0;\n for (var i = 0; i < l; i++) {\n this.push(c);\n c += a;\n }\n}\n\n// helper: duplicate sequence from *relative* offset and length.\n// `this` references an array\nfunction c(i, l) {\n i = this.length - i;\n for (l += i; i < l; i++) {\n this.push(this[i]);\n }\n}\n\n// helper: unpack an array using helpers and data, all passed in an array argument 'a'.\nfunction u(a) {\n var rv = [];\n for (var i = 0, l = a.length; i < l; i++) {\n var e = a[i];\n // Is this entry a helper function?\n if (typeof e === 'function') {\n i++;\n e.apply(rv, a[i]);\n } else {\n rv.push(e);\n }\n }\n return rv;\n}\n\nvar parser = {\ntrace: function no_op_trace() { },\nJisonParserError: JisonParserError,\nyy: {},\noptions: {\n type: \"lalr\",\n errorRecoveryTokenDiscardCount: 3\n},\nsymbols_: {\n \"$accept\": 0,\n \"$end\": 1,\n \"ADD\": 12,\n \"ASSIGN\": 7,\n \"DIV\": 14,\n \"EOF\": 1,\n \"IDENTIFIER\": 6,\n \"LBRACE\": 9,\n \"MULT\": 13,\n \"RBRACE\": 10,\n \"SEMICOLON\": 5,\n \"SUB\": 11,\n \"VALUE\": 15,\n \"error\": 2,\n \"expression\": 8,\n \"program\": 3,\n \"statement\": 4\n},\nterminals_: {\n 1: \"EOF\",\n 2: \"error\",\n 5: \"SEMICOLON\",\n 6: \"IDENTIFIER\",\n 7: \"ASSIGN\",\n 9: \"LBRACE\",\n 10: \"RBRACE\",\n 11: \"SUB\",\n 12: \"ADD\",\n 13: \"MULT\",\n 14: \"DIV\",\n 15: \"VALUE\"\n},\nTERROR: 2,\nEOF: 1,\n\n// internals: defined here so the object *structure* doesn't get modified by parse() et al,\n// thus helping JIT compilers like Chrome V8.\noriginalQuoteName: null,\noriginalParseError: null,\ncleanupAfterParse: null,\nconstructParseErrorInfo: null,\n\n__reentrant_call_depth: 0, // INTERNAL USE ONLY\n\n// APIs which will be set up depending on user action code analysis:\n//yyErrOk: 0,\n//yyClearIn: 0,\n\n// Helper APIs\n// -----------\n\n// Helper function which can be overridden by user code later on: put suitable quotes around\n// literal IDs in a description string.\nquoteName: function parser_quoteName(id_str) {\n return '\"' + id_str + '\"';\n},\n\n// Return a more-or-less human-readable description of the given symbol, when available,\n// or the symbol itself, serving as its own 'description' for lack of something better to serve up.\n//\n// Return NULL when the symbol is unknown to the parser.\ndescribeSymbol: function parser_describeSymbol(symbol) {\n if (symbol !== this.EOF && this.terminal_descriptions_ && this.terminal_descriptions_[symbol]) {\n return this.terminal_descriptions_[symbol];\n }\n else if (symbol === this.EOF) {\n return 'end of input';\n }\n else if (this.terminals_[symbol]) {\n return this.quoteName(this.terminals_[symbol]);\n }\n // Otherwise... this might refer to a RULE token i.e. a non-terminal: see if we can dig that one up.\n //\n // An example of this may be where a rule's action code contains a call like this:\n //\n // parser.describeSymbol(#$)\n //\n // to obtain a human-readable description or name of the current grammar rule. This comes handy in\n // error handling action code blocks, for example.\n var s = this.symbols_;\n for (var key in s) {\n if (s[key] === symbol) {\n return key;\n }\n }\n return null;\n},\n\n// Produce a (more or less) human-readable list of expected tokens at the point of failure.\n//\n// The produced list may contain token or token set descriptions instead of the tokens\n// themselves to help turning this output into something that easier to read by humans\n// unless `do_not_describe` parameter is set, in which case a list of the raw, *numeric*,\n// expected terminals and nonterminals is produced.\n//\n// The returned list (array) will not contain any duplicate entries.\ncollect_expected_token_set: function parser_collect_expected_token_set(state, do_not_describe) {\n var TERROR = this.TERROR;\n var tokenset = [];\n var check = {};\n // Has this (error?) state been outfitted with a custom expectations description text for human consumption?\n // If so, use that one instead of the less palatable token set.\n if (!do_not_describe && this.state_descriptions_ && this.state_descriptions_[state]) {\n return [\n this.state_descriptions_[state]\n ];\n }\n for (var p in this.table[state]) {\n p = +p;\n if (p !== TERROR) {\n var d = do_not_describe ? p : this.describeSymbol(p);\n if (d && !check[d]) {\n tokenset.push(d);\n check[d] = true; // Mark this token description as already mentioned to prevent outputting duplicate entries.\n }\n }\n }\n return tokenset;\n},\nproductions_: bp({\n pop: u([\n s,\n [3, 3],\n 4,\n 4,\n s,\n [8, 8]\n]),\n rule: u([\n 3,\n 2,\n 4,\n 3,\n 1,\n 3,\n 2,\n s,\n [3, 4],\n 1,\n 1\n])\n}),\nperformAction: function parser__PerformAction(yytext, yyloc, yy, yystate /* action[1] */, $0, $$ /* vstack */, _$ /* lstack */) {\n/* this == yyval */\n\nswitch (yystate) {\ncase 3:\n /*! Production:: program : statement error SEMICOLON program */\n yy.parser.yyErrOk();\n break;\n\ncase 4:\n /*! Production:: statement : IDENTIFIER ASSIGN expression */\n VarSetValue(var, $$[$0]);\n break;\n\ncase 6:\n /*! Production:: expression : LBRACE expression RBRACE */\n this.$ = $$[$0 - 1];\n break;\n\ncase 7:\n /*! Production:: expression : SUB expression */\n this.$ = - $$[$0];\n break;\n\ncase 8:\n /*! Production:: expression : expression ADD expression */\n this.$ = ReduceAdd($$[$0 - 2], $$[$0], &_$[$0]);\n if ( debug )\n printf(\"reduce %lf + %lf => %lf\\n\", $$[$0 - 2], $$[$0], this.$);\n break;\n\ncase 9:\n /*! Production:: expression : expression SUB expression */\n this.$ = ReduceSub($$[$0 - 2], $$[$0], &_$[$0]);\n if ( debug )\n printf(\"reduce %lf - %lf => %lf\\n\", $$[$0 - 2], $$[$0], this.$);\n break;\n\ncase 10:\n /*! Production:: expression : expression MULT expression */\n this.$ = ReduceMult($$[$0 - 2], $$[$0], &_$[$0]);\n if ( debug )\n printf(\"reduce %lf * %lf => %lf\\n\", $$[$0 - 2], $$[$0], this.$);\n break;\n\ncase 11:\n /*! Production:: expression : expression DIV expression */\n this.$ = ReduceDiv($$[$0 - 2], $$[$0], &_$[$0]);\n if ( debug )\n printf(\"reduce %lf / %lf => %lf\\n\", $$[$0 - 2], $$[$0], this.$);\n break;\n\ncase 12:\n /*! Production:: expression : VALUE */\n this.$ = $$[$0];\n break;\n\ncase 13:\n /*! Production:: expression : IDENTIFIER */\n this.$ = VarGetValue($$[$0], &_$[$0]);\n if ( debug )\n printf(\"identifier %s => %lf\\n\", $$[$0], this.$);\n break;\n\n}\n},\ntable: bt({\n len: u([\n 7,\n 1,\n 2,\n 7,\n 6,\n 5,\n 5,\n 7,\n 8,\n 1,\n s,\n [5, 6],\n 7,\n 7,\n 1,\n 7,\n 6,\n s,\n [7, 5],\n 1\n]),\n symbol: u([\n 3,\n 4,\n 6,\n 8,\n 9,\n 11,\n 15,\n 1,\n 2,\n 5,\n 2,\n 5,\n 7,\n s,\n [11, 4, 1],\n 2,\n 5,\n c,\n [6, 4],\n c,\n [21, 5],\n c,\n [5, 5],\n 2,\n 5,\n s,\n [10, 5, 1],\n 1,\n c,\n [41, 7],\n 5,\n c,\n [26, 10],\n c,\n [5, 15],\n c,\n [39, 5],\n c,\n [46, 7],\n c,\n [53, 15],\n c,\n [84, 6],\n c,\n [28, 14],\n c,\n [7, 21],\n 1\n]),\n type: u([\n 0,\n 0,\n 2,\n 0,\n s,\n [2, 3],\n 1,\n s,\n [2, 16],\n c,\n [21, 4],\n c,\n [5, 6],\n c,\n [17, 8],\n c,\n [41, 6],\n c,\n [26, 12],\n c,\n [5, 15],\n s,\n [2, 19],\n c,\n [53, 9],\n s,\n [2, 40]\n]),\n state: u([\n 1,\n 2,\n 4,\n 15,\n 17,\n 18,\n 2,\n 4,\n s,\n [20, 5, 1],\n 26,\n 2,\n 4\n]),\n mode: u([\n s,\n [1, 6],\n 2,\n 2,\n c,\n [3, 3],\n s,\n [2, 4],\n s,\n [1, 12],\n s,\n [2, 8],\n s,\n [1, 30],\n s,\n [2, 15],\n c,\n [78, 7],\n c,\n [25, 8],\n c,\n [7, 14],\n s,\n [2, 17]\n]),\n goto: u([\n 3,\n 5,\n 6,\n 7,\n 9,\n 8,\n 13,\n 13,\n 10,\n s,\n [13, 4],\n 5,\n 5,\n 12,\n 11,\n 13,\n 14,\n 16,\n c,\n [19, 3],\n c,\n [4, 4],\n s,\n [12, 7],\n 2,\n c,\n [35, 4],\n 19,\n c,\n [21, 8],\n c,\n [4, 12],\n 25,\n c,\n [46, 4],\n s,\n [13, 7],\n s,\n [7, 7],\n 1,\n c,\n [45, 4],\n 4,\n 4,\n c,\n [25, 4],\n s,\n [8, 5],\n 13,\n 14,\n s,\n [9, 5],\n 13,\n 14,\n s,\n [10, 7],\n s,\n [11, 7],\n s,\n [6, 7],\n 3\n])\n}),\ndefaultActions: {\n 18: 1,\n 26: 3\n},\nparseError: function parseError(str, hash) {\n if (hash.recoverable) {\n this.trace(str);\n hash.destroy(); // destroy... well, *almost*!\n // assert('recoverable' in hash);\n } else {\n throw new this.JisonParserError(str, hash);\n }\n},\nparse: function parse(input) {\n var self = this,\n stack = new Array(128), // token stack: stores token which leads to state at the same index (column storage)\n sstack = new Array(128), // state stack: stores states\n\n vstack = new Array(128), // semantic value stack\n lstack = new Array(128), // location stack\n table = this.table,\n sp = 0; // 'stack pointer': index into the stacks\n\n var recovering = 0; // (only used when the grammar contains error recovery rules)\n var TERROR = this.TERROR,\n EOF = this.EOF,\n ERROR_RECOVERY_TOKEN_DISCARD_COUNT = (this.options.errorRecoveryTokenDiscardCount | 0) || 3;\n var NO_ACTION = [0, table.length /* ensures that anyone using this new state will fail dramatically! */];\n\n //this.reductionCount = this.shiftCount = 0;\n\n var lexer;\n if (this.__lexer__) {\n lexer = this.__lexer__;\n } else {\n lexer = this.__lexer__ = Object.create(this.lexer);\n }\n\n var sharedState = {\n yy: {\n parseError: null,\n quoteName: null,\n lexer: null,\n parser: null,\n pre_parse: null,\n post_parse: null\n }\n };\n // copy state\n for (var k in this.yy) {\n if (Object.prototype.hasOwnProperty.call(this.yy, k)) {\n sharedState.yy[k] = this.yy[k];\n }\n }\n\n sharedState.yy.lexer = lexer;\n sharedState.yy.parser = this;\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n if (this.yyErrOk === 1) {\n this.yyErrOk = function yyErrOk() {\n recovering = 0;\n };\n }\n\n\n\n\n\n\n lexer.setInput(input, sharedState.yy);\n\n if (typeof lexer.yylloc === 'undefined') {\n lexer.yylloc = {};\n }\n var yyloc = lexer.yylloc;\n lstack[sp] = yyloc;\n vstack[sp] = null;\n sstack[sp] = 0;\n stack[sp] = 0;\n ++sp;\n\n if (typeof lexer.yytext === 'undefined') {\n lexer.yytext = '';\n }\n var yytext = lexer.yytext;\n if (typeof lexer.yylineno === 'undefined') {\n lexer.yylineno = 0;\n }\n\n\n\n\n var ranges = lexer.options && lexer.options.ranges;\n\n // Does the shared state override the default `parseError` that already comes with this instance?\n if (typeof sharedState.yy.parseError === 'function') {\n this.parseError = sharedState.yy.parseError;\n } else {\n this.parseError = this.originalParseError;\n }\n\n // Does the shared state override the default `quoteName` that already comes with this instance?\n if (typeof sharedState.yy.quoteName === 'function') {\n this.quoteName = sharedState.yy.quoteName;\n } else {\n this.quoteName = this.originalQuoteName;\n }\n\n // set up the cleanup function; make it an API so that external code can re-use this one in case of\n // calamities or when the `%options no-try-catch` option has been specified for the grammar, in which\n // case this parse() API method doesn't come with a `finally { ... }` block any more!\n //\n // NOTE: as this API uses parse() as a closure, it MUST be set again on every parse() invocation,\n // or else your `sharedState`, etc. references will be *wrong*!\n //\n // The function resets itself to the previous set up one to support reentrant parsers.\n this.cleanupAfterParse = function parser_cleanupAfterParse(resultValue, invoke_post_methods) {\n var rv;\n\n if (invoke_post_methods) {\n if (sharedState.yy.post_parse) {\n rv = sharedState.yy.post_parse.call(this, sharedState.yy, resultValue);\n if (typeof rv !== 'undefined') resultValue = rv;\n }\n if (this.post_parse) {\n rv = this.post_parse.call(this, sharedState.yy, resultValue);\n if (typeof rv !== 'undefined') resultValue = rv;\n }\n }\n\n if (this.__reentrant_call_depth > 1) return resultValue; // do not (yet) kill the sharedState when this is a reentrant run.\n\n // prevent lingering circular references from causing memory leaks:\n if (sharedState.yy) {\n sharedState.yy.parseError = undefined;\n sharedState.yy.quoteName = undefined;\n sharedState.yy.lexer = undefined;\n sharedState.yy.parser = undefined;\n if (lexer.yy === sharedState.yy) {\n lexer.yy = undefined;\n }\n }\n sharedState.yy = undefined;\n this.parseError = this.originalParseError;\n this.quoteName = this.originalQuoteName;\n\n // nuke the vstack[] array at least as that one will still reference obsoleted user values.\n // To be safe, we nuke the other internal stack columns as well...\n stack.length = 0; // fastest way to nuke an array without overly bothering the GC\n sstack.length = 0;\n lstack.length = 0;\n vstack.length = 0;\n stack_pointer = 0;\n\n return resultValue;\n };\n\n // NOTE: as this API uses parse() as a closure, it MUST be set again on every parse() invocation,\n // or else your `lexer`, `sharedState`, etc. references will be *wrong*!\n this.constructParseErrorInfo = function parser_constructParseErrorInfo(msg, ex, expected, recoverable) {\n return {\n errStr: msg,\n exception: ex,\n text: lexer.match,\n value: lexer.yytext,\n token: this.describeSymbol(symbol) || symbol,\n token_id: symbol,\n line: lexer.yylineno,\n loc: lexer.yylloc,\n expected: expected,\n recoverable: recoverable,\n state: state,\n action: action,\n new_state: newState,\n symbol_stack: stack,\n state_stack: sstack,\n value_stack: vstack,\n location_stack: lstack,\n stack_pointer: sp,\n yy: sharedState.yy,\n lexer: lexer,\n\n // and make sure the error info doesn't stay due to potential ref cycle via userland code manipulations (memory leak opportunity!):\n destroy: function destructParseErrorInfo() {\n // remove cyclic references added to error info:\n // info.yy = null;\n // info.lexer = null;\n // info.value = null;\n // info.value_stack = null;\n // ...\n var rec = !!this.recoverable;\n for (var key in this) {\n if (this.hasOwnProperty(key) && typeof key !== 'function') {\n this[key] = undefined;\n }\n }\n this.recoverable = rec;\n }\n };\n };\n\n\n function lex() {\n var token = lexer.lex();\n // if token isn't its numeric value, convert\n if (typeof token !== 'number') {\n token = self.symbols_[token] || token;\n }\n return token || EOF;\n }\n\n\n var symbol = 0;\n var preErrorSymbol = 0;\n var state, action, r, t;\n var yyval = {};\n var p, len, this_production;\n var lstack_begin, lstack_end;\n var newState;\n var retval = false;\n\n\n // Return the rule stack depth where the nearest error rule can be found.\n // Return -1 when no error recovery rule was found.\n function locateNearestErrorRecoveryRule(state) {\n var stack_probe = sp - 1;\n var depth = 0;\n\n // try to recover from error\n for (;;) {\n // check for error recovery rule in this state\n var t = table[state][TERROR] || NO_ACTION;\n if (t[0]) {\n return depth;\n }\n if (state === 0 /* $accept rule */ || stack_probe < 1) {\n return -1; // No suitable error recovery rule available.\n }\n --stack_probe; // popStack(1): [symbol, action]\n state = sstack[stack_probe];\n ++depth;\n }\n }\n\n try {\n this.__reentrant_call_depth++;\n\n if (this.pre_parse) {\n this.pre_parse.call(this, sharedState.yy);\n }\n if (sharedState.yy.pre_parse) {\n sharedState.yy.pre_parse.call(this, sharedState.yy);\n }\n\n newState = sstack[sp - 1];\n for (;;) {\n // retrieve state number from top of stack\n state = newState; // sstack[sp - 1];\n\n // use default actions if available\n if (this.defaultActions[state]) {\n action = 2;\n newState = this.defaultActions[state];\n } else {\n // The single `==` condition below covers both these `===` comparisons in a single\n // operation:\n //\n // if (symbol === null || typeof symbol === 'undefined') ...\n if (!symbol) {\n symbol = lex();\n }\n // read action for current state and first input\n t = (table[state] && table[state][symbol]) || NO_ACTION;\n newState = t[1];\n action = t[0];\n\n\n\n\n // handle parse error\n if (!action) {\n // first see if there's any chance at hitting an error recovery rule:\n var error_rule_depth = locateNearestErrorRecoveryRule(state);\n var errStr = null;\n var errSymbolDescr = (this.describeSymbol(symbol) || symbol);\n var expected = this.collect_expected_token_set(state);\n\n if (!recovering) {\n // Report error\n if (lexer.showPosition) {\n errStr = 'Parse error on line ' + (lexer.yylineno + 1) + ':\\n' + lexer.showPosition(79 - 10, 10) + '\\n';\n } else {\n errStr = 'Parse error on line ' + (lexer.yylineno + 1) + ': ';\n }\n if (expected.length) {\n errStr += 'Expecting ' + expected.join(', ') + ', got unexpected ' + errSymbolDescr;\n } else {\n errStr += 'Unexpected ' + errSymbolDescr;\n }\n p = this.constructParseErrorInfo(errStr, null, expected, (error_rule_depth >= 0));\n r = this.parseError(p.errStr, p);\n\n\n if (!p.recoverable) {\n retval = r;\n break;\n } else {\n // TODO: allow parseError callback to edit symbol and or state tat the start of the error recovery process...\n }\n }\n\n\n\n // just recovered from another error\n if (recovering === ERROR_RECOVERY_TOKEN_DISCARD_COUNT && error_rule_depth >= 0) {\n // only barf a fatal hairball when we're out of look-ahead symbols and none hit a match;\n // this DOES discard look-ahead while recovering from an error when said look-ahead doesn't\n // suit the error recovery rules... The error HAS been reported already so we're fine with\n // throwing away a few items if that is what it takes to match the nearest recovery rule!\n if (symbol === EOF || preErrorSymbol === EOF) {\n p = this.constructParseErrorInfo((errStr || 'Parsing halted while starting to recover from another error.'), null, expected, false);\n retval = this.parseError(p.errStr, p);\n break;\n }\n\n // discard current lookahead and grab another\n\n yytext = lexer.yytext;\n\n yyloc = lexer.yylloc;\n\n symbol = lex();\n\n\n }\n\n // try to recover from error\n if (error_rule_depth < 0) {\n p = this.constructParseErrorInfo((errStr || 'Parsing halted. No suitable error recovery rule available.'), null, expected, false);\n retval = this.parseError(p.errStr, p);\n break;\n }\n sp -= error_rule_depth;\n\n preErrorSymbol = (symbol === TERROR ? 0 : symbol); // save the lookahead token\n symbol = TERROR; // insert generic error symbol as new lookahead\n // allow N (default: 3) real symbols to be shifted before reporting a new error\n recovering = ERROR_RECOVERY_TOKEN_DISCARD_COUNT;\n\n newState = sstack[sp - 1];\n\n\n\n continue;\n }\n }\n\n\n switch (action) {\n // catch misc. parse failures:\n default:\n // this shouldn't happen, unless resolve defaults are off\n if (action instanceof Array) {\n p = this.constructParseErrorInfo(('Parse Error: multiple actions possible at state: ' + state + ', token: ' + symbol), null, null, false);\n retval = this.parseError(p.errStr, p);\n break;\n }\n // Another case of better safe than sorry: in case state transitions come out of another error recovery process\n // or a buggy LUT (LookUp Table):\n p = this.constructParseErrorInfo('Parsing halted. No viable error recovery approach available due to internal system failure.', null, null, false);\n retval = this.parseError(p.errStr, p);\n break;\n\n // shift:\n case 1:\n //this.shiftCount++;\n stack[sp] = symbol;\n vstack[sp] = lexer.yytext;\n lstack[sp] = lexer.yylloc;\n sstack[sp] = newState; // push state\n ++sp;\n symbol = 0;\n if (!preErrorSymbol) { // normal execution / no error\n // Pick up the lexer details for the current symbol as that one is not 'look-ahead' any more:\n\n yytext = lexer.yytext;\n\n yyloc = lexer.yylloc;\n\n if (recovering > 0) {\n recovering--;\n\n }\n } else {\n // error just occurred, resume old lookahead f/ before error, *unless* that drops us straight back into error mode:\n symbol = preErrorSymbol;\n preErrorSymbol = 0;\n\n // read action for current state and first input\n t = (table[newState] && table[newState][symbol]) || NO_ACTION;\n if (!t[0]) {\n // forget about that symbol and move forward: this wasn't an 'forgot to insert' error type where\n // (simple) stuff might have been missing before the token which caused the error we're\n // recovering from now...\n\n symbol = 0;\n }\n }\n\n continue;\n\n // reduce:\n case 2:\n //this.reductionCount++;\n this_production = this.productions_[newState - 1]; // `this.productions_[]` is zero-based indexed while states start from 1 upwards...\n len = this_production[1];\n lstack_end = sp;\n lstack_begin = lstack_end - (len || 1);\n lstack_end--;\n\n\n\n // Make sure subsequent `$$ = $1` default action doesn't fail\n // for rules where len==0 as then there's no $1 (you're reducing an epsilon rule then!)\n //\n // Also do this to prevent nasty action block codes to *read* `$0` or `$$`\n // and *not* get `undefined` as a result for their efforts!\n vstack[sp] = undefined;\n\n // perform semantic action\n yyval.$ = vstack[sp - len]; // default to $$ = $1; result must produce `undefined` when len == 0, as then there's no $1\n\n // default location, uses first token for firsts, last for lasts\n yyval._$ = {\n first_line: lstack[lstack_begin].first_line,\n last_line: lstack[lstack_end].last_line,\n first_column: lstack[lstack_begin].first_column,\n last_column: lstack[lstack_end].last_column\n };\n if (ranges) {\n yyval._$.range = [lstack[lstack_begin].range[0], lstack[lstack_end].range[1]];\n }\n\n r = this.performAction.call(yyval, yytext, yyloc, sharedState.yy, newState, sp - 1, vstack, lstack);\n\n if (typeof r !== 'undefined') {\n retval = r;\n break;\n }\n\n // pop off stack\n sp -= len;\n\n // don't overwrite the `symbol` variable: use a local var to speed things up:\n var ntsymbol = this_production[0]; // push nonterminal (reduce)\n stack[sp] = ntsymbol;\n vstack[sp] = yyval.$;\n lstack[sp] = yyval._$;\n // goto new state = table[STATE][NONTERMINAL]\n newState = table[sstack[sp - 1]][ntsymbol];\n sstack[sp] = newState;\n ++sp;\n\n continue;\n\n // accept:\n case 3:\n retval = true;\n // Return the `$accept` rule's `$$` result, if available.\n //\n // Also note that JISON always adds this top-most `$accept` rule (with implicit,\n // default, action):\n //\n // $accept: $end\n // %{ $$ = $1; @$ = @1; %}\n //\n // which, combined with the parse kernel's `$accept` state behaviour coded below,\n // will produce the `$$` value output of the rule as the parse result,\n // IFF that result is *not* `undefined`. (See also the parser kernel code.)\n //\n // In code:\n //\n // %{\n // @$ = @1; // if location tracking support is included\n // if (typeof $1 !== 'undefined')\n // return $1;\n // else\n // return true; // the default parse result if the rule actions don't produce anything\n // %}\n if (typeof yyval.$ !== 'undefined') {\n retval = yyval.$;\n }\n break;\n }\n\n // break out of loop: we accept or fail with error\n break;\n }\n } catch (ex) {\n // report exceptions through the parseError callback too:\n p = this.constructParseErrorInfo('Parsing aborted due to exception.', ex, null, false);\n retval = this.parseError(p.errStr, p);\n } finally {\n retval = this.cleanupAfterParse(retval, true);\n this.__reentrant_call_depth--;\n }\n\n return retval;\n},\nyyErrOk: 1\n};\nparser.originalParseError = parser.parseError;\nparser.originalQuoteName = parser.quoteName;\n/*! @file lex.l\n * @brief Lexical Analysis\n *********************************************************************\n * a simple calculator with variables\n *\n * sample-files for a artikel in developerworks.ibm.com\n * Author: Christian Hagen, chagen@de.ibm.com\n * \n * @par parse.l & parse.c\n * grammar for the parser-generator bison\n * \n *********************************************************************\n */\n\n// #define YYERROR_VERBOSE 1\n// #define YYDEBUG 1\n// int yydebug=0;\n\n/*--------------------------------------------------------------------\n * \n * global variables\n * \n *------------------------------------------------------------------*/\nstatic Variable *var;\n\n\n/*------------------------------------------------------------------------------\n * \n * functions\n * \n *----------------------------------------------------------------------------*/\n//extern\n//void yyerror(char *s) {\n// // simple error-message\n// // printf(\"Error '%s'\\n\", s);\n// // a more sophisticated error-function\n// PrintError(s);\n//}\n\n/*--------------------------------------------------------------------\n * parse.y\n *------------------------------------------------------------------*/\n/* generated by jison-lex 0.3.4-144 */\nvar lexer = (function () {\n// See also:\n// http://stackoverflow.com/questions/1382107/whats-a-good-way-to-extend-error-in-javascript/#35881508\n// but we keep the prototype.constructor and prototype.name assignment lines too for compatibility\n// with userland code which might access the derived class in a 'classic' way.\nfunction JisonLexerError(msg, hash) {\n Object.defineProperty(this, 'name', {\n enumerable: false,\n writable: false,\n value: 'JisonLexerError'\n });\n\n if (msg == null) msg = '???';\n\n Object.defineProperty(this, 'message', {\n enumerable: false,\n writable: true,\n value: msg\n });\n\n this.hash = hash;\n\n var stacktrace;\n if (hash && hash.exception instanceof Error) {\n var ex2 = hash.exception;\n this.message = ex2.message || msg;\n stacktrace = ex2.stack;\n }\n if (!stacktrace) {\n if (Error.hasOwnProperty('captureStackTrace')) { // V8\n Error.captureStackTrace(this, this.constructor);\n } else {\n stacktrace = (new Error(msg)).stack;\n }\n }\n if (stacktrace) {\n Object.defineProperty(this, 'stack', {\n enumerable: false,\n writable: false,\n value: stacktrace\n });\n }\n}\n\n if (typeof Object.setPrototypeOf === 'function') {\n Object.setPrototypeOf(JisonLexerError.prototype, Error.prototype);\n } else {\n JisonLexerError.prototype = Object.create(Error.prototype);\n }\n JisonLexerError.prototype.constructor = JisonLexerError;\n JisonLexerError.prototype.name = 'JisonLexerError';\n\n\nvar lexer = {\n EOF: 1,\n ERROR: 2,\n\n // JisonLexerError: JisonLexerError, // <-- injected by the code generator\n\n // options: {}, // <-- injected by the code generator\n\n // yy: ..., // <-- injected by setInput()\n\n __currentRuleSet__: null, // <-- internal rule set cache for the current lexer state\n\n parseError: function lexer_parseError(str, hash) {\n if (this.yy.parser && typeof this.yy.parser.parseError === 'function') {\n return this.yy.parser.parseError(str, hash) || this.ERROR;\n } else {\n throw new this.JisonLexerError(str);\n }\n },\n\n // clear the lexer token context; intended for internal use only\n clear: function lexer_clear() {\n this.yytext = '';\n this.yyleng = 0;\n this.match = '';\n this.matches = false;\n this._more = false;\n this._backtrack = false;\n },\n\n // resets the lexer, sets new input\n setInput: function lexer_setInput(input, yy) {\n this.yy = yy || this.yy || {};\n this._input = input;\n this.clear();\n this._signaled_error_token = this.done = false;\n this.yylineno = 0;\n this.matched = '';\n this.conditionStack = ['INITIAL'];\n this.__currentRuleSet__ = null;\n this.yylloc = {\n first_line: 1,\n first_column: 0,\n last_line: 1,\n last_column: 0\n };\n if (this.options.ranges) {\n this.yylloc.range = [0, 0];\n }\n this.offset = 0;\n return this;\n },\n\n // consumes and returns one char from the input\n input: function lexer_input() {\n if (!this._input) {\n this.done = true;\n return null;\n }\n var ch = this._input[0];\n this.yytext += ch;\n this.yyleng++;\n this.offset++;\n this.match += ch;\n this.matched += ch;\n // Count the linenumber up when we hit the LF (or a stand-alone CR).\n // On CRLF, the linenumber is incremented when you fetch the CR or the CRLF combo\n // and we advance immediately past the LF as well, returning both together as if\n // it was all a single 'character' only.\n var slice_len = 1;\n var lines = false;\n if (ch === '\\n') {\n lines = true;\n } else if (ch === '\\r') {\n lines = true;\n var ch2 = this._input[1];\n if (ch2 === '\\n') {\n slice_len++;\n ch += ch2;\n this.yytext += ch2;\n this.yyleng++;\n this.offset++;\n this.match += ch2;\n this.matched += ch2;\n if (this.options.ranges) {\n this.yylloc.range[1]++;\n }\n }\n }\n if (lines) {\n this.yylineno++;\n this.yylloc.last_line++;\n } else {\n this.yylloc.last_column++;\n }\n if (this.options.ranges) {\n this.yylloc.range[1]++;\n }\n\n this._input = this._input.slice(slice_len);\n return ch;\n },\n\n // unshifts one char (or a string) into the input\n unput: function lexer_unput(ch) {\n var len = ch.length;\n var lines = ch.split(/(?:\\r\\n?|\\n)/g);\n\n this._input = ch + this._input;\n this.yytext = this.yytext.substr(0, this.yytext.length - len);\n //this.yyleng -= len;\n this.offset -= len;\n var oldLines = this.match.split(/(?:\\r\\n?|\\n)/g);\n this.match = this.match.substr(0, this.match.length - len);\n this.matched = this.matched.substr(0, this.matched.length - len);\n\n if (lines.length - 1) {\n this.yylineno -= lines.length - 1;\n }\n\n this.yylloc.last_line = this.yylineno + 1;\n this.yylloc.last_column = (lines ?\n (lines.length === oldLines.length ? this.yylloc.first_column : 0)\n + oldLines[oldLines.length - lines.length].length - lines[0].length :\n this.yylloc.first_column - len);\n\n if (this.options.ranges) {\n this.yylloc.range[1] = this.yylloc.range[0] + this.yyleng - len;\n }\n this.yyleng = this.yytext.length;\n this.done = false;\n return this;\n },\n\n // When called from action, caches matched text and appends it on next action\n more: function lexer_more() {\n this._more = true;\n return this;\n },\n\n // When called from action, signals the lexer that this rule fails to match the input, so the next matching rule (regex) should be tested instead.\n reject: function lexer_reject() {\n if (this.options.backtrack_lexer) {\n this._backtrack = true;\n } else {\n // when the parseError() call returns, we MUST ensure that the error is registered.\n // We accomplish this by signaling an 'error' token to be produced for the current\n // .lex() run.\n this._signaled_error_token = (this.parseError('Lexical error on line ' + (this.yylineno + 1) + '. You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\\n' + this.showPosition(), {\n text: this.match,\n token: null,\n line: this.yylineno,\n loc: this.yylloc,\n lexer: this\n }) || this.ERROR);\n }\n return this;\n },\n\n // retain first n characters of the match\n less: function lexer_less(n) {\n return this.unput(this.match.slice(n));\n },\n\n // return (part of the) already matched input, i.e. for error messages.\n // Limit the returned string length to `maxSize` (default: 20).\n // Limit the returned string to the `maxLines` number of lines of input (default: 1).\n // Negative limit values equal *unlimited*.\n pastInput: function lexer_pastInput(maxSize, maxLines) {\n var past = this.matched.substring(0, this.matched.length - this.match.length);\n if (maxSize < 0)\n maxSize = past.length;\n else if (!maxSize)\n maxSize = 20;\n if (maxLines < 0)\n maxLines = past.length; // can't ever have more input lines than this!\n else if (!maxLines)\n maxLines = 1;\n // `substr` anticipation: treat \\r\\n as a single character and take a little\n // more than necessary so that we can still properly check against maxSize\n // after we've transformed and limited the newLines in here:\n past = past.substr(-maxSize * 2 - 2);\n // now that we have a significantly reduced string to process, transform the newlines\n // and chop them, then limit them:\n var a = past.replace(/\\r\\n|\\r/g, '\\n').split('\\n');\n a = a.slice(-maxLines);\n past = a.join('\\n');\n // When, after limiting to maxLines, we still have to much to return, \n // do add an ellipsis prefix...\n if (past.length > maxSize) {\n past = '...' + past.substr(-maxSize);\n }\n return past;\n },\n\n // return (part of the) upcoming input, i.e. for error messages.\n // Limit the returned string length to `maxSize` (default: 20).\n // Limit the returned string to the `maxLines` number of lines of input (default: 1).\n // Negative limit values equal *unlimited*.\n upcomingInput: function lexer_upcomingInput(maxSize, maxLines) {\n var next = this.match;\n if (maxSize < 0)\n maxSize = next.length + this._input.length;\n else if (!maxSize)\n maxSize = 20;\n if (maxLines < 0)\n maxLines = maxSize; // can't ever have more input lines than this!\n else if (!maxLines)\n maxLines = 1;\n // `substring` anticipation: treat \\r\\n as a single character and take a little\n // more than necessary so that we can still properly check against maxSize\n // after we've transformed and limited the newLines in here:\n if (next.length < maxSize * 2 + 2) {\n next += this._input.substring(0, maxSize * 2 + 2); // substring is faster on Chrome/V8\n }\n // now that we have a significantly reduced string to process, transform the newlines\n // and chop them, then limit them:\n var a = next.replace(/\\r\\n|\\r/g, '\\n').split('\\n');\n a = a.slice(0, maxLines);\n next = a.join('\\n');\n // When, after limiting to maxLines, we still have to much to return, \n // do add an ellipsis postfix...\n if (next.length > maxSize) {\n next = next.substring(0, maxSize) + '...';\n }\n return next;\n },\n\n // return a string which displays the character position where the lexing error occurred, i.e. for error messages\n showPosition: function lexer_showPosition(maxPrefix, maxPostfix) {\n var pre = this.pastInput(maxPrefix).replace(/\\s/g, ' ');\n var c = new Array(pre.length + 1).join('-');\n return pre + this.upcomingInput(maxPostfix).replace(/\\s/g, ' ') + '\\n' + c + '^';\n },\n\n // helper function, used to produce a human readable description as a string, given\n // the input `yylloc` location object. \n // Set `display_range_too` to TRUE to include the string character inex position(s)\n // in the description if the `yylloc.range` is available. \n describeYYLLOC: function lexer_describe_yylloc(yylloc, display_range_too) {\n var l1 = yylloc.first_line;\n var l2 = yylloc.last_line;\n var o1 = yylloc.first_column;\n var o2 = yylloc.last_column - 1;\n var dl = l2 - l1;\n var d_o = (dl === 0 ? o2 - o1 : 1000);\n var rv;\n if (dl === 0) {\n rv = 'line ' + l1 + ', ';\n if (d_o === 0) {\n rv += 'column ' + o1;\n } else {\n rv += 'columns ' + o1 + ' .. ' + o2;\n }\n } else {\n rv = 'lines ' + l1 + '(column ' + o1 + ') .. ' + l2 + '(column ' + o2 + ')';\n }\n if (yylloc.range && display_range_too) {\n var r1 = yylloc.range[0];\n var r2 = yylloc.range[1] - 1;\n if (r2 === r1) {\n rv += ' {String Offset: ' + r1 + '}';\n } else {\n rv += ' {String Offset range: ' + r1 + ' .. ' + r2 + '}';\n }\n }\n return rv;\n // return JSON.stringify(yylloc);\n },\n\n // test the lexed token: return FALSE when not a match, otherwise return token.\n //\n // `match` is supposed to be an array coming out of a regex match, i.e. `match[0]`\n // contains the actually matched text string.\n //\n // Also move the input cursor forward and update the match collectors:\n // - yytext\n // - yyleng\n // - match\n // - matches\n // - yylloc\n // - offset\n test_match: function lexer_test_match(match, indexed_rule) {\n var token,\n lines,\n backup,\n match_str;\n\n if (this.options.backtrack_lexer) {\n // save context\n backup = {\n yylineno: this.yylineno,\n yylloc: {\n first_line: this.yylloc.first_line,\n last_line: this.last_line,\n first_column: this.yylloc.first_column,\n last_column: this.yylloc.last_column\n },\n yytext: this.yytext,\n match: this.match,\n matches: this.matches,\n matched: this.matched,\n yyleng: this.yyleng,\n offset: this.offset,\n _more: this._more,\n _input: this._input,\n yy: this.yy,\n conditionStack: this.conditionStack.slice(0),\n done: this.done\n };\n if (this.options.ranges) {\n backup.yylloc.range = this.yylloc.range.slice(0);\n }\n }\n\n match_str = match[0];\n lines = match_str.match(/(?:\\r\\n?|\\n).*/g);\n if (lines) {\n this.yylineno += lines.length;\n }\n this.yylloc = {\n first_line: this.yylloc.last_line,\n last_line: this.yylineno + 1,\n first_column: this.yylloc.last_column,\n last_column: lines ?\n lines[lines.length - 1].length - lines[lines.length - 1].match(/\\r?\\n?/)[0].length :\n this.yylloc.last_column + match_str.length\n };\n this.yytext += match_str;\n this.match += match_str;\n this.matches = match;\n this.yyleng = this.yytext.length;\n if (this.options.ranges) {\n this.yylloc.range = [this.offset, this.offset + this.yyleng];\n }\n // previous lex rules MAY have invoked the `more()` API rather than producing a token:\n // those rules will already have moved this `offset` forward matching their match lengths,\n // hence we must only add our own match length now:\n this.offset += match_str.length;\n this._more = false;\n this._backtrack = false;\n this._input = this._input.slice(match_str.length);\n this.matched += match_str;\n token = this.performAction.call(this, this.yy, this, indexed_rule, this.conditionStack[this.conditionStack.length - 1]);\n if (this.done && this._input) {\n this.done = false;\n }\n if (token) {\n return token;\n } else if (this._backtrack) {\n // recover context\n for (var k in backup) {\n this[k] = backup[k];\n }\n this.__currentRuleSet__ = null;\n return false; // rule action called reject() implying the next rule should be tested instead.\n } else if (this._signaled_error_token) {\n // produce one 'error' token as .parseError() in reject() did not guarantee a failure signal by throwing an exception!\n token = this._signaled_error_token;\n this._signaled_error_token = false;\n return token;\n }\n return false;\n },\n\n // return next match in input\n next: function lexer_next() {\n if (this.done) {\n this.clear();\n return this.EOF;\n }\n if (!this._input) {\n this.done = true;\n }\n\n var token,\n match,\n tempMatch,\n index;\n if (!this._more) {\n this.clear();\n }\n var rules = this.__currentRuleSet__;\n if (!rules) {\n // Update the ruleset cache as we apparently encountered a state change or just started lexing.\n // The cache is set up for fast lookup -- we assume a lexer will switch states much less often than it will\n // invoke the `lex()` token-producing API and related APIs, hence caching the set for direct access helps\n // speed up those activities a tiny bit.\n rules = this.__currentRuleSet__ = this._currentRules();\n }\n for (var i = 0, len = rules.length; i < len; i++) {\n tempMatch = this._input.match(this.rules[rules[i]]);\n if (tempMatch && (!match || tempMatch[0].length > match[0].length)) {\n match = tempMatch;\n index = i;\n if (this.options.backtrack_lexer) {\n token = this.test_match(tempMatch, rules[i]);\n if (token !== false) {\n return token;\n } else if (this._backtrack) {\n match = undefined;\n continue; // rule action called reject() implying a rule MISmatch.\n } else {\n // else: this is a lexer rule which consumes input without producing a token (e.g. whitespace)\n return false;\n }\n } else if (!this.options.flex) {\n break;\n }\n }\n }\n if (match) {\n token = this.test_match(match, rules[index]);\n if (token !== false) {\n return token;\n }\n // else: this is a lexer rule which consumes input without producing a token (e.g. whitespace)\n return false;\n }\n if (this._input === '') {\n this.clear();\n this.done = true;\n return this.EOF;\n } else {\n token = this.parseError('Lexical error on line ' + (this.yylineno + 1) + '. Unrecognized text.\\n' + this.showPosition(), {\n text: this.match + this._input,\n token: null,\n line: this.yylineno,\n loc: this.yylloc,\n lexer: this\n }) || this.ERROR;\n if (token === this.ERROR) {\n // we can try to recover from a lexer error that parseError() did not 'recover' for us, by moving forward at least one character at a time:\n if (!this.match.length) {\n this.input();\n }\n }\n return token;\n }\n },\n\n // return next match that has a token\n lex: function lexer_lex() {\n var r;\n // allow the PRE/POST handlers set/modify the return token for maximum flexibility of the generated lexer:\n if (typeof this.options.pre_lex === 'function') {\n r = this.options.pre_lex.call(this);\n }\n while (!r) {\n r = this.next();\n }\n if (typeof this.options.post_lex === 'function') {\n // (also account for a userdef function which does not return any value: keep the token as is)\n r = this.options.post_lex.call(this, r) || r;\n }\n return r;\n },\n\n // backwards compatible alias for `pushState()`;\n // the latter is symmetrical with `popState()` and we advise to use\n // those APIs in any modern lexer code, rather than `begin()`.\n begin: function lexer_begin(condition) {\n return this.pushState(condition);\n },\n\n // activates a new lexer condition state (pushes the new lexer condition state onto the condition stack)\n pushState: function lexer_pushState(condition) {\n this.conditionStack.push(condition);\n this.__currentRuleSet__ = null;\n return this;\n },\n\n // pop the previously active lexer condition state off the condition stack\n popState: function lexer_popState() {\n var n = this.conditionStack.length - 1;\n if (n > 0) {\n this.__currentRuleSet__ = null;\n return this.conditionStack.pop();\n } else {\n return this.conditionStack[0];\n }\n },\n\n // return the currently active lexer condition state; when an index argument is provided it produces the N-th previous condition state, if available\n topState: function lexer_topState(n) {\n n = this.conditionStack.length - 1 - Math.abs(n || 0);\n if (n >= 0) {\n return this.conditionStack[n];\n } else {\n return 'INITIAL';\n }\n },\n\n // (internal) determine the lexer rule set which is active for the currently active lexer condition state\n _currentRules: function lexer__currentRules() {\n if (this.conditionStack.length && this.conditionStack[this.conditionStack.length - 1]) {\n return this.conditions[this.conditionStack[this.conditionStack.length - 1]].rules;\n } else {\n return this.conditions['INITIAL'].rules;\n }\n },\n\n // return the number of states currently on the stack\n stateStackSize: function lexer_stateStackSize() {\n return this.conditionStack.length;\n },\noptions: {},\nJisonLexerError: JisonLexerError,\nperformAction: function lexer__performAction(yy, yy_, $avoiding_name_collisions, YY_START) {\n\nvar YYSTATE = YY_START;\nswitch($avoiding_name_collisions) {\ncase 0 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: [ \\t\\r\\n]+ */ \n \n /* eat up whitespace */\n BeginToken(yy_.yytext); \n \nbreak;\ncase 1 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: {DIGIT}+ */ \n \n BeginToken(yy_.yytext); \n yylval.value = atof(yy_.yytext);\n return VALUE;\n \nbreak;\ncase 2 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: {DIGIT}+\\.{DIGIT}* */ \n \n BeginToken(yy_.yytext);\n yylval.value = atof(yy_.yytext);\n return VALUE;\n \nbreak;\ncase 3 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: {DIGIT}+[eE][\"+\"\"-\"]?{DIGIT}* */ \n \n BeginToken(yy_.yytext);\n yylval.value = atof(yy_.yytext);\n return VALUE;\n \nbreak;\ncase 4 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: {DIGIT}+\\.{DIGIT}*[eE][\"+\"\"-\"]?{DIGIT}* */ \n \n BeginToken(yy_.yytext);\n yylval.value = atof(yy_.yytext);\n return VALUE;\n \nbreak;\ncase 5 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: {ID} */ \n \n BeginToken(yy_.yytext);\n yylval.string = malloc(strlen(yy_.yytext)+1);\n strcpy(yylval.string, yy_.yytext);\n return IDENTIFIER;\n \nbreak;\ncase 6 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: \\+ */ \n BeginToken(yy_.yytext); return ADD; \nbreak;\ncase 7 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: - */ \n BeginToken(yy_.yytext); return SUB; \nbreak;\ncase 8 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: \\* */ \n BeginToken(yy_.yytext); return MULT; \nbreak;\ncase 9 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: \\/ */ \n BeginToken(yy_.yytext); return DIV; \nbreak;\ncase 10 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: \\( */ \n BeginToken(yy_.yytext); return LBRACE; \nbreak;\ncase 11 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: \\) */ \n BeginToken(yy_.yytext); return RBRACE; \nbreak;\ncase 12 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: ; */ \n BeginToken(yy_.yytext); return SEMICOLON; \nbreak;\ncase 13 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: = */ \n BeginToken(yy_.yytext); return ASSIGN; \nbreak;\ncase 14 : \n/*! Conditions:: INITIAL */ \n/*! Rule:: . */ \n \n BeginToken(yy_.yytext);\n return yy_.yytext[0];\n \nbreak;\ndefault:\n return this.simpleCaseActionClusters[$avoiding_name_collisions];\n}\n},\nsimpleCaseActionClusters: {\n\n},\nrules: [\n/^(?:[ \\t\\r\\n]+)/,\n/^(?:([0-9])+)/,\n/^(?:([0-9])+\\.([0-9])*)/,\n/^(?:([0-9])+[Ee][\"+]?([0-9])*)/,\n/^(?:([0-9])+\\.([0-9])*[Ee][\"+]?([0-9])*)/,\n/^(?:([A-Z_a-z][0-9A-Z_a-z]*))/,\n/^(?:\\+)/,\n/^(?:-)/,\n/^(?:\\*)/,\n/^(?:\\/)/,\n/^(?:\\()/,\n/^(?:\\))/,\n/^(?:;)/,\n/^(?:=)/,\n/^(?:.)/\n],\nconditions: {\n \"INITIAL\": {\n rules: [\n 0,\n 1,\n 2,\n 3,\n 4,\n 5,\n 6,\n 7,\n 8,\n 9,\n 10,\n 11,\n 12,\n 13,\n 14\n ],\n inclusive: true\n }\n}\n};\n\n/*--------------------------------------------------------------------\n * lex.l\n *------------------------------------------------------------------*/;\nreturn lexer;\n})();\nparser.lexer = lexer;\n\nfunction Parser() {\n this.yy = {};\n}\nParser.prototype = parser;\nparser.Parser = Parser;\n\nreturn new Parser();\n})();\n\n\n\n\nif (typeof require !== 'undefined' && typeof exports !== 'undefined') {\n exports.parser = ccalcParse;\n exports.Parser = ccalcParse.Parser;\n exports.parse = function () {\n return ccalcParse.parse.apply(ccalcParse, arguments);\n };\n\n}\n" }, { "path": "src/test/resources/samples/langs/JavaScript/chart_composers.gs", "content": "/*\nLicense\nCopyright [2013] [Farruco Sanjurjo Arcay]\n\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use this file except in compliance with the License. You may obtain a copy of the License at\n\nhttp://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.\n*/\n\nvar TagsTotalPerMonth;\n\nTagsTotalPerMonth = (function(){\n function TagsTotalPerMonth(){};\n \n TagsTotalPerMonth.getDatasource = function (category, months, values){\n return new CategoryMonthlyExpenseBarChartDataSource(category, months, values);\n };\n \n TagsTotalPerMonth.getType = function (){ return Charts.ChartType.COLUMN};\n \n return TagsTotalPerMonth;\n})();\n\n\nvar TagsTotalPerMonthWithMean;\n\nTagsTotalPerMonthWithMean = (function(){\n function TagsTotalPerMonthWithMean(){};\n \n TagsTotalPerMonthWithMean.getDatasource = function (category, months, values){\n return new CategoryMonthlyWithMeanExpenseDataSource(category, months, values);\n };\n \n TagsTotalPerMonthWithMean.getType = function (){ return Charts.ChartType.LINE};\n \n return TagsTotalPerMonthWithMean;\n})();\n\n\nvar TagsAccumulatedPerMonth;\n\nTagsAccumulatedPerMonth = (function(){\n function TagsAccumulatedPerMonth(){};\n \n TagsAccumulatedPerMonth.getDatasource = function (category, months, values){\n return new CategoryMonthlyAccumulated(category, months, values);\n };\n \n TagsAccumulatedPerMonth.getType = function (){ return Charts.ChartType.AREA};\n \n return TagsAccumulatedPerMonth;\n})();\n\nvar MonthTotalsPerTags;\n\nMonthTotalsPerTags = (function(){\n function MonthTotalsPerTags(){};\n\n MonthTotalsPerTags.getDatasource = function (month, tags, values){\n return new CategoryExpenseDataSource(tags, month, values); \n };\n \n MonthTotalsPerTags.getType = function (){ return Charts.ChartType.PIE; };\n \n return MonthTotalsPerTags;\n})();\n\nvar SavingsFlowChartComposer = (function(){\n function SavingsFlowChartComposer(){};\n \n SavingsFlowChartComposer.getDatasource = function(months, values){\n return new SavingsFlowDataSource(months, values);\n };\n \n SavingsFlowChartComposer.getType = function(){ return Charts.ChartType.COLUMN; };\n \n return SavingsFlowChartComposer;\n})();\n" }, { "path": "src/test/resources/samples/langs/JavaScript/classes-old.js", "content": "(function() {\n var Animal, Horse, Snake, sam, tom;\n var __hasProp = Object.prototype.hasOwnProperty, __extends = function(child, parent) {\n for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; }\n function ctor() { this.constructor = child; }\n ctor.prototype = parent.prototype;\n child.prototype = new ctor;\n child.__super__ = parent.prototype;\n return child;\n };\n Animal = (function() {\n function Animal(name) {\n this.name = name;\n }\n Animal.prototype.move = function(meters) {\n return alert(this.name + \" moved \" + meters + \"m.\");\n };\n return Animal;\n })();\n Snake = (function() {\n __extends(Snake, Animal);\n function Snake() {\n Snake.__super__.constructor.apply(this, arguments);\n }\n Snake.prototype.move = function() {\n alert(\"Slithering...\");\n return Snake.__super__.move.call(this, 5);\n };\n return Snake;\n })();\n Horse = (function() {\n __extends(Horse, Animal);\n function Horse() {\n Horse.__super__.constructor.apply(this, arguments);\n }\n Horse.prototype.move = function() {\n alert(\"Galloping...\");\n return Horse.__super__.move.call(this, 45);\n };\n return Horse;\n })();\n sam = new Snake(\"Sammy the Python\");\n tom = new Horse(\"Tommy the Palomino\");\n sam.move();\n tom.move();\n}).call(this);\n" }, { "path": "src/test/resources/samples/langs/JavaScript/classes.js", "content": "// Generated by CoffeeScript 1.2.1\n(function() {\n var Animal, Horse, Snake, sam, tom,\n __hasProp = {}.hasOwnProperty,\n __extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor; child.__super__ = parent.prototype; return child; };\n\n Animal = (function() {\n\n Animal.name = 'Animal';\n\n function Animal(name) {\n this.name = name;\n }\n\n Animal.prototype.move = function(meters) {\n return alert(this.name + \" moved \" + meters + \"m.\");\n };\n\n return Animal;\n\n })();\n\n Snake = (function(_super) {\n\n __extends(Snake, _super);\n\n Snake.name = 'Snake';\n\n function Snake() {\n return Snake.__super__.constructor.apply(this, arguments);\n }\n\n Snake.prototype.move = function() {\n alert(\"Slithering...\");\n return Snake.__super__.move.call(this, 5);\n };\n\n return Snake;\n\n })(Animal);\n\n Horse = (function(_super) {\n\n __extends(Horse, _super);\n\n Horse.name = 'Horse';\n\n function Horse() {\n return Horse.__super__.constructor.apply(this, arguments);\n }\n\n Horse.prototype.move = function() {\n alert(\"Galloping...\");\n return Horse.__super__.move.call(this, 45);\n };\n\n return Horse;\n\n })(Animal);\n\n sam = new Snake(\"Sammy the Python\");\n\n tom = new Horse(\"Tommy the Palomino\");\n\n sam.move();\n\n tom.move();\n\n}).call(this);\n" }, { "path": "src/test/resources/samples/langs/JavaScript/constant_fold.mjs", "content": "// consumes and performs constant folding\n// echo '\"use strict\";\"_\"[0],1+2;' | node constant_fold.js\nimport _NodePath from '../NodePath';\nconst {NodePath} = _NodePath;\nimport _WalkCombinator from '../WalkCombinator';\nconst {WalkCombinator} = _WalkCombinator;\n\nconst $CONSTEXPR = Symbol.for('$CONSTEXTR');\nconst $CONSTVALUE = Symbol.for('$CONSTVALUE');\nconst IS_EMPTY = path => {\n return (path.node.type === 'BlockStatement' && path.node.body.length === 0) ||\n path.node.type === 'EmptyStatement';\n};\nconst IN_PRAGMA_POS = path => {\n if (path.parent && Array.isArray(path.parent.node)) {\n const siblings = path.parent.node;\n for (let i = 0; i < path.key; i++) {\n // preceded by non-pragma\n if (\n siblings[i].type !== 'ExpressionStatement' ||\n !IS_CONSTEXPR(siblings[i].expression) ||\n typeof CONSTVALUE(siblings[i].expression) !== 'string'\n ) {\n return false;\n }\n }\n }\n return true;\n};\nconst IS_PRAGMA = path => {\n if (path.parent && Array.isArray(path.parent.node)) {\n const siblings = path.parent.node;\n for (let i = 0; i < path.key + 1; i++) {\n // preceded by non-pragma\n if (\n siblings[i].type !== 'ExpressionStatement' ||\n !IS_CONSTEXPR(siblings[i].expression) ||\n typeof CONSTVALUE(siblings[i].expression) !== 'string'\n ) {\n return false;\n }\n }\n }\n return true;\n};\n// worst case is the completion value\nconst IS_NOT_COMPLETION = path => {\n while (true) {\n if (!path.parent) {\n return true;\n }\n if (\n Array.isArray(path.parent.node) &&\n path.key !== path.parent.node.length - 1\n ) {\n return true;\n }\n path = path.parent;\n while (Array.isArray(path.node)) {\n path = path.parent;\n }\n if (/Function/.test(path.node.type)) {\n return true;\n } else if (path.node.type === 'Program') {\n return false;\n }\n }\n};\nconst REMOVE_IF_EMPTY = path => {\n if (IS_EMPTY(path)) REMOVE(path);\n return null;\n};\nconst REPLACE_IF_EMPTY = (path, folded) => {\n if (IS_EMPTY(path)) return REPLACE(path, folded);\n return path;\n};\nconst REMOVE = path => {\n if (Array.isArray(path.parent.node)) {\n path.parent.node.splice(path.key, 1);\n } else {\n path.parent.node[path.key] = null;\n }\n return null;\n};\nconst REPLACE = (path, folded) => {\n const replacement = new NodePath(path.parent, folded, path.key);\n path.parent.node[path.key] = folded;\n return replacement;\n};\n// no mutation, this is an atomic value\nconst NEG_ZERO = Object.freeze({\n [$CONSTEXPR]: true,\n type: 'UnaryExpression',\n operator: '-',\n argument: Object.freeze({\n [$CONSTEXPR]: true,\n type: 'Literal',\n value: 0,\n }),\n});\nconst INFINITY = Object.freeze({\n [$CONSTEXPR]: true,\n type: 'BinaryExpression',\n operator: '/',\n left: Object.freeze({\n [$CONSTEXPR]: true,\n type: 'Literal',\n value: 1,\n }),\n right: Object.freeze({\n [$CONSTEXPR]: true,\n type: 'Literal',\n value: 0,\n }),\n});\nconst NEG_INFINITY = Object.freeze({\n [$CONSTEXPR]: true,\n type: 'BinaryExpression',\n operator: '/',\n left: Object.freeze({\n [$CONSTEXPR]: true,\n type: 'Literal',\n value: 1,\n }),\n right: NEG_ZERO,\n});\nconst EMPTY = Object.freeze({\n [$CONSTEXPR]: true,\n type: 'EmptyStatement',\n});\nconst NULL = Object.freeze({\n [$CONSTEXPR]: true,\n type: 'Literal',\n value: null,\n});\nconst NAN = Object.freeze({\n [$CONSTEXPR]: true,\n type: 'BinaryExpression',\n operator: '/',\n left: Object.freeze({\n [$CONSTEXPR]: true,\n type: 'Literal',\n value: 0,\n }),\n right: Object.freeze({\n [$CONSTEXPR]: true,\n type: 'Literal',\n value: 0,\n }),\n});\nconst UNDEFINED = Object.freeze({\n [$CONSTEXPR]: true,\n type: 'UnaryExpression',\n operator: 'void',\n argument: Object.freeze({\n [$CONSTEXPR]: true,\n type: 'Literal',\n value: 0,\n }),\n});\n// ESTree doesn't like negative numeric literals\n// this also preserves -0\nconst IS_UNARY_NEGATIVE = node => {\n if (\n node.type === 'UnaryExpression' &&\n node.operator === '-' &&\n typeof node.argument.value === 'number' &&\n node.argument.value === node.argument.value &&\n node.argument.type === 'Literal'\n ) {\n return true;\n }\n return false;\n};\nconst IS_CONSTEXPR = node => {\n if (typeof node !== 'object' || node === null) {\n return false;\n }\n // DONT CALCULATE THINGS MULTIPLE TIMES!!@!@#\n if (node[$CONSTEXPR]) return true;\n if (node.type === 'ArrayExpression') {\n for (let i = 0; i < node.elements.length; i++) {\n const element = node.elements[i];\n // hole == null\n if (element !== null && !IS_CONSTEXPR(element)) {\n return false;\n }\n }\n return true;\n }\n if (node.type === 'ObjectExpression') {\n for (let i = 0; i < node.properties.length; i++) {\n const element = node.properties[i];\n if (element.kind !== 'init') return false;\n if (element.method) return false;\n let key;\n if (element.computed) {\n // be sure {[\"y\"]:1} works\n if (!IS_CONSTEXPR(element.key)) {\n return false;\n }\n }\n if (!IS_CONSTEXPR(element.value)) return false;\n }\n return true;\n }\n if (node.type === 'Literal' || IS_UNDEFINED(node) || IS_NAN(node)) {\n return true;\n }\n if (IS_UNARY_NEGATIVE(node)) {\n return true;\n }\n return false;\n};\nconst IS_NAN = node => {\n return node === NAN;\n};\nconst IS_UNDEFINED = node => {\n return node === UNDEFINED;\n};\nconst CONSTVALUE = node => {\n if (node[$CONSTVALUE]) {\n return node[$CONSTVALUE];\n }\n if (IS_UNDEFINED(node)) return void 0;\n if (IS_NAN(node)) return +'_';\n if (!IS_CONSTEXPR(node)) throw new Error('Not a CONSTEXPR');\n if (node.type === 'ArrayExpression') {\n let ret = [];\n ret.length = node.elements.length;\n for (let i = 0; i < node.elements.length; i++) {\n if (node.elements[i] !== null) {\n ret[i] = CONSTVALUE(node.elements[i]);\n }\n }\n return ret;\n }\n if (node.type === 'ObjectExpression') {\n let ret = Object.create(null);\n for (let i = 0; i < node.properties.length; i++) {\n const element = node.properties[i];\n let key;\n if (element.computed) {\n key = `${CONSTVALUE(element.key)}`;\n }\n else {\n key = element.key.name;\n }\n Object.defineProperty(ret, key, {\n // duplicate keys...\n configurable: true,\n writable: true,\n value: CONSTVALUE(element.value),\n enumerable: true\n });\n }\n Object.freeze(ret);\n return ret;\n }\n if (IS_UNARY_NEGATIVE(node)) {\n return -node.argument.value;\n }\n if (node.regex !== void 0) {\n return new RegExp(node.regex.pattern, node.regex.flags);\n }\n return node.value;\n};\nconst CONSTEXPRS = new Map();\nCONSTEXPRS.set(void 0, UNDEFINED);\nCONSTEXPRS.set(+'_', NAN);\nCONSTEXPRS.set(null, NULL);\nconst TO_CONSTEXPR = value => {\n if (value === -Infinity) {\n return NEG_INFINITY;\n }\n if (value === Infinity) {\n return INFINITY;\n }\n let is_neg_zero = 1 / value === -Infinity;\n if (is_neg_zero) return NEG_ZERO;\n if (CONSTEXPRS.has(value)) {\n return CONSTEXPRS.get(value);\n }\n if (typeof value === 'number') {\n if (value < 0) {\n const CONSTEXPR = Object.freeze({\n [$CONSTEXPR]: true,\n [$CONSTVALUE]: value,\n type: 'UnaryExpression',\n operator: '-',\n argument: Object.freeze({ type: 'Literal', value: -value }),\n });\n CONSTEXPRS.set(value, CONSTEXPR);\n return CONSTEXPR;\n }\n }\n if (\n value === null ||\n typeof value === 'number' ||\n typeof value === 'boolean' ||\n typeof value === 'string'\n ) {\n const CONSTEXPR = Object.freeze({\n [$CONSTEXPR]: true,\n [$CONSTVALUE]: value,\n type: 'Literal',\n value,\n });\n CONSTEXPRS.set(value, CONSTEXPR);\n return CONSTEXPR;\n }\n // have to generate new one every time :-/\n if (Array.isArray(value)) {\n return Object.freeze({\n [$CONSTEXPR]: true,\n type: 'ArrayExpression',\n elements: Object.freeze(value.map(TO_CONSTEXPR)),\n });\n }\n if (typeof value === 'object' && Object.getPrototypeOf(value) === Object.getPrototypeOf({}) && [...Object.getOwnPropertySymbols(value)].length === 0) {\n return Object.freeze({\n [$CONSTEXPR]: true,\n type: 'ObjectExpression',\n properties: Object.freeze(\n [...Object.getOwnPropertyKeys(value)].map(key => {\n if (!('value' in Object.getOwnProperty(value, key))) {\n throw Error('Not a CONSTVALUE (found a setter or getter?)');\n }\n return {\n type: 'Property',\n kind: 'init',\n method: false,\n shorthand: false,\n computed: true,\n key: {\n type: 'Literal',\n value: key\n },\n value: TO_CONSTEXPR(value[key])\n }\n })),\n });\n }\n throw Error('Not a CONSTVALUE (did you pass a RegExp?)');\n};\n\n// THIS DOES NOT HANDLE NODE SPECIFIC CASES LIKE IfStatement\nconst FOLD_EMPTY = function*(path) {\n if (\n path &&\n path.node &&\n path.parent &&\n Array.isArray(path.parent.node) &&\n IS_EMPTY(path)\n ) {\n REMOVE(path);\n return yield;\n }\n return yield path;\n};\n\n// THIS DOES NOT HANDLE NODE SPECIFIC CASES LIKE IfStatement\nconst FOLD_TEMPLATE = function*(path) {\n if (\n path &&\n path.node &&\n path.type === 'TemplateLiteral'\n ) {\n let updated = false;\n for (let i = 0; i < path.node.exressions.length; i++) {\n if (IS_CONSTEXPR(path.node.expressions[i])) {\n //let \n }\n }\n }\n return yield path;\n};\nconst FOLD_EXPR_STMT = function*(path) {\n // TODO: enforce completion value checking\n if (path && path.node && path.node.type === 'ExpressionStatement') {\n // merge all the adjacent expression statements into sequences\n if (Array.isArray(path.parent.node)) {\n // could have nodes after it\n const siblings = path.parent.node;\n if (!IS_PRAGMA(path)) {\n if (path.key < siblings.length - 1) {\n const mergeable = [path.node];\n for (let needle = path.key + 1; needle < siblings.length; needle++) {\n if (siblings[needle].type !== 'ExpressionStatement') {\n break;\n }\n mergeable.push(siblings[needle]);\n }\n if (mergeable.length > 1) {\n siblings.splice(path.key, mergeable.length, {\n type: 'ExpressionStatement',\n expression: {\n type: 'SequenceExpression',\n expressions: mergeable.reduce(\n (acc, es) => {\n if (es.expression.type == 'SequenceExpression') {\n return [...acc, ...es.expression.expressions];\n } else {\n return [...acc, es.expression];\n }\n },\n []\n ),\n },\n });\n return path;\n }\n }\n }\n }\n if (IS_NOT_COMPLETION(path) && IS_CONSTEXPR(path.node.expression)) {\n return REPLACE(path, EMPTY);\n }\n }\n return yield path;\n};\nconst FOLD_WHILE = function*(path) {\n if (path && path.node) {\n if (path.node.type === 'DoWhileStatement') {\n console.error('FOLD_DOWHILE');\n REPLACE_IF_EMPTY(path.get(['body']), EMPTY);\n }\n if (path.node.type === 'WhileStatement') {\n console.error('FOLD_WHILE');\n let { test, consequent, alternate } = path.node;\n if (IS_CONSTEXPR(test)) {\n test = CONSTVALUE(test);\n if (!test) {\n return REPLACE(path, EMPTY);\n }\n }\n REPLACE_IF_EMPTY(path.get(['body']), EMPTY);\n }\n if (path.node.type === 'ForStatement') {\n console.error('FOLD_FOR');\n REPLACE_IF_EMPTY(path.get(['body']), EMPTY);\n let { init, test, update } = path.node;\n let updated = false;\n if (init && IS_CONSTEXPR(init)) {\n updated = true;\n REPLACE(path.get(['init']), null);\n }\n if (test && IS_CONSTEXPR(test)) {\n let current = CONSTVALUE(test);\n let coerced = Boolean(current);\n // remove the test if it is always true\n if (coerced === true) {\n updated = true;\n REPLACE(path.get(['test']), null);\n } else if (coerced !== current) {\n updated = true;\n REPLACE(path.get(['test']), TO_CONSTEXPR(coerced));\n }\n }\n if (update && IS_CONSTEXPR(update)) {\n updated = true;\n REPLACE(path.get(['update']), null);\n }\n if (updated) {\n return path;\n }\n }\n }\n return yield path;\n};\nconst FOLD_IF = function*(path) {\n if (path && path.node && path.node.type === 'IfStatement') {\n let { test, consequent, alternate } = path.node;\n const is_not_completion = IS_NOT_COMPLETION(path);\n if (is_not_completion && !alternate) {\n if (IS_EMPTY(path.get(['consequent']))) {\n console.error('FOLD_IF_EMPTY_CONSEQUENT');\n REPLACE(path, {\n type: 'ExpressionStatement',\n expression: test,\n });\n return path.parent;\n }\n }\n if (alternate) {\n if (alternate.type === consequent.type) {\n if (consequent.type === 'ExpressionStatement') {\n console.error('FOLD_IF_BOTH_EXPRSTMT');\n REPLACE(path, {\n type: 'ExpressionStatement', expression:\n {\n type: 'ConditionalExpression',\n test: test,\n consequent: consequent.expression,\n alternate: alternate.expression,\n }});\n return path.parent;\n }\n else if (consequent.type === 'ReturnStatement' ||\n consequent.type === 'ThrowStatement') {\n console.error('FOLD_IF_BOTH_COMPLETIONS');\n REPLACE(path, {\n type: 'ExpressionStatement', expression:{\n type: consequent.type,\n argument: {\n type: 'ConditionalExpression',\n test: test,\n consequent: consequent.argument,\n alternate: alternate.argument,\n }}\n });\n return path.parent;\n }\n }\n }\n else if (is_not_completion && consequent.type === 'ExpressionStatement') {\n console.error('FOLD_IF_NON_COMPLETION_TO_&&');\n REPLACE(path, {\n type: 'ExpressionStatement',\n expression: {\n type: 'BinaryExpression',\n operator: '&&',\n left: test,\n right: consequent.expression,\n }\n });\n return path.parent;\n }\n if (IS_CONSTEXPR(test)) {\n test = CONSTVALUE(test);\n if (test) {\n return REPLACE(path, consequent);\n }\n if (alternate) {\n return REPLACE(path, alternate);\n }\n return REPLACE(path, EMPTY);\n }\n consequent = path.get(['consequent']);\n let updated;\n if (consequent.node !== EMPTY) {\n REPLACE_IF_EMPTY(consequent, EMPTY);\n if (consequent.parent.node[consequent.key] === EMPTY) {\n updated = true;\n }\n }\n if (alternate) {\n alternate = path.get(['alternate']);\n REMOVE_IF_EMPTY(alternate);\n if (path.node.alternate === null) {\n updated = true;\n }\n }\n if (updated) {\n return path;\n }\n }\n return yield path;\n};\nconst FOLD_SEQUENCE = function*(path) {\n if (path && path.node && path.node.type === 'SequenceExpression') {\n console.error('FOLD_SEQUENCE');\n // never delete the last value\n for (let i = 0; i < path.node.expressions.length - 1; i++) {\n if (IS_CONSTEXPR(path.node.expressions[i])) {\n path.node.expressions.splice(i, 1);\n i--;\n }\n }\n if (path.node.expressions.length === 1) {\n return REPLACE(path, path.node.expressions[0]);\n }\n }\n return yield path;\n};\nconst FOLD_LOGICAL = function*(path) {\n if (path && path.node && path.node.type === 'LogicalExpression') {\n console.error('FOLD_LOGICAL');\n let { left, right, operator } = path.node;\n if (IS_CONSTEXPR(left)) {\n left = CONSTVALUE(left);\n if (operator === '||') {\n if (left) {\n return REPLACE(path, TO_CONSTEXPR(left));\n }\n return REPLACE(path, right);\n } else if (operator === '&&') {\n if (!left) {\n return REPLACE(path, TO_CONSTEXPR(left));\n }\n return REPLACE(path, right);\n }\n }\n }\n return yield path;\n};\nconst FOLD_SWITCH = function*(path) {\n if (path && path.node && path.node.type === 'SwitchStatement') {\n let { discriminant, cases } = path.node;\n // if there are no cases, just become an expression\n if (cases.length === 0 && IS_NOT_COMPLETION(path)) {\n return REPLACE(path, {\n type: 'ExpressionStatement',\n expression: discriminant\n });\n }\n // if the discriminant is static\n // remove any preceding non-matching static cases\n // fold any trailing cases into the matching case\n if (cases.length > 1 && IS_CONSTEXPR(discriminant)) {\n const discriminant_value = CONSTVALUE(discriminant);\n for (var i = 0; i < cases.length; i++) {\n const test = cases[i].test;\n if (IS_CONSTEXPR(test)) {\n let test_value = CONSTVALUE(test);\n if (discriminant_value === test_value) {\n let new_consequent = cases[i].consequent;\n if (i < cases.length - 1) {\n for (let fallthrough of cases.slice(i+1)) {\n new_consequent.push(...fallthrough.consequent);\n }\n }\n cases[i].consequent = new_consequent;\n REPLACE(path.get(['cases']), [cases[i]]);\n return path;\n }\n }\n else {\n // we had a dynamic case need to bail\n break;\n }\n }\n }\n }\n return yield path;\n};\nconst FOLD_UNREACHABLE = function*(path) {\n if (path && path.node && path.parent && Array.isArray(path.parent.node)) {\n if (path.node.type === 'ReturnStatement' ||\n path.node.type === 'ContinueStatement' ||\n path.node.type === 'BreakStatement' ||\n path.node.type === 'ThrowStatement') {\n const next_key = path.key + 1;\n path.parent.node.splice(next_key, path.parent.node.length - next_key);\n }\n }\n return yield path;\n}\nconst FOLD_CONDITIONAL = function*(path) {\n if (path && path.node && path.node.type === 'ConditionalExpression') {\n console.error('FOLD_CONDITIONAL');\n let { test, consequent, alternate } = path.node;\n if (IS_CONSTEXPR(test)) {\n test = CONSTVALUE(test);\n if (test) {\n return REPLACE(path, consequent);\n }\n return REPLACE(path, alternate);\n }\n }\n return yield path;\n};\nconst FOLD_BINARY = function*(path) {\n if (\n path &&\n path.node &&\n path.node.type === 'BinaryExpression' &&\n !IS_NAN(path.node)\n ) {\n console.error('FOLD_BINARY');\n let { left, right, operator } = path.node;\n if (operator === '==' || operator === '!=') {\n let updated = false;\n if (IS_UNDEFINED(left)) {\n updated = true;\n REPLACE(path.get(['left']), NULL);\n }\n if (IS_UNDEFINED(right)) {\n updated = true;\n REPLACE(path.get(['right']), NULL);\n }\n if (updated) {\n return path;\n }\n }\n if (path.node !== INFINITY && path.node !== NEG_INFINITY && IS_CONSTEXPR(left) && IS_CONSTEXPR(right)) {\n left = CONSTVALUE(left);\n right = CONSTVALUE(right);\n let value;\n if ((!left || typeof left !== 'object') && (!right || typeof right !== 'object')) {\n if (operator === '+') {\n value = left + right;\n } else if (operator === '-') {\n value = left - right;\n } else if (operator === '*') {\n value = left * right;\n } else if (operator === '/') {\n value = left / right;\n } else if (operator === '%') {\n value = left % right;\n } else if (operator === '==') {\n value = left == right;\n } else if (operator === '!=') {\n value = left != right;\n } else if (operator === '===') {\n value = left === right;\n } else if (operator === '!==') {\n value = left !== right;\n } else if (operator === '<') {\n value = left < right;\n } else if (operator === '<=') {\n value = left <= right;\n } else if (operator === '>') {\n value = left > right;\n } else if (operator === '>=') {\n value = left >= right;\n } else if (operator === '<<') {\n value = left << right;\n } else if (operator === '>>') {\n value = left >> right;\n } else if (operator === '>>>') {\n value = left >>> right;\n } else if (operator === '|') {\n value = left | right;\n } else if (operator === '&') {\n value = left & right;\n } else if (operator === '^') {\n value = left ^ right;\n }\n }\n else {\n if (operator === '==') value = false;\n if (operator === '===') value = false;\n if (operator === '!=') value = true;\n if (operator === '!==') value = true;\n if (operator === 'in' && typeof right === 'object' && right) {\n value = Boolean(Object.getOwnPropertyDescriptor(right, left));\n }\n }\n if (value !== void 0) {\n if (typeof value === 'string' || typeof value === 'boolean' || value === null) {\n return REPLACE(path, TO_CONSTEXPR(value));\n }\n if (typeof value === 'number') {\n return REPLACE(path, TO_CONSTEXPR(value));\n }\n }\n }\n }\n return yield path;\n};\nconst FOLD_UNARY = function*(path) {\n if (path && path.node && path.node.type === 'UnaryExpression') {\n console.error('FOLD_UNARY');\n if (IS_CONSTEXPR(path.node)) {\n return yield path;\n }\n let { argument, operator } = path.node;\n if (IS_CONSTEXPR(argument)) {\n if (operator === 'void') {\n return REPLACE(path, UNDEFINED);\n }\n let value = CONSTVALUE(argument);\n if (operator === '-') {\n value = -value;\n } else if (operator === '+') {\n value = +value;\n } else if (operator === '~') {\n value = ~value;\n } else if (operator === '!') {\n value = !value;\n } else if (operator === 'typeof') {\n value = typeof value;\n } else if (operator === 'delete') {\n value = true;\n }\n return REPLACE(path, TO_CONSTEXPR(value));\n }\n }\n return yield path;\n};\nconst FOLD_EVAL = function*(path) {\n if (path && path.node && path.node.type === 'CallExpression' &&\n path.node.callee.type === 'Identifier' && path.node.callee.name === 'eval') {\n console.error('FOLD_EVAL');\n if (path.node.arguments.length === 1 && path.node.arguments[0].type === 'Literal') {\n let result = esprima.parse(`${\n CONSTVALUE(path.node.arguments[0])\n }`);\n if (result.body.length === 1 && result.body[0].type === 'ExpressionStatement') {\n return REPLACE(path, result.body[0].expression);\n }\n }\n }\n return yield path;\n}\nconst FOLD_MEMBER = function*(path) {\n if (path && path.node && path.node.type === 'MemberExpression') {\n console.error('FOLD_MEMBER');\n if (path.node.computed && path.node.property.type === 'Literal') {\n const current = `${CONSTVALUE(path.node.property)}`;\n if (typeof current === 'string' && /^[$_a-z][$_a-z\\d]*$/i.test(current)) {\n path.node.computed = false;\n path.node.property = {\n type: 'Identifier',\n name: current,\n };\n return path;\n }\n }\n if (IS_CONSTEXPR(path.node.object)) {\n const value = CONSTVALUE(path.node.object);\n if (typeof value === 'string' || Array.isArray(value) || (value && typeof value === 'object')) {\n let key;\n if (IS_CONSTEXPR(path.node.property)) {\n key = `${CONSTVALUE(path.node.property)}`;\n }\n else if (!path.node.computed) {\n key = path.node.property.name;\n }\n if (key !== void 0) {\n const desc = Object.getOwnPropertyDescriptor(value, key);\n if (desc) {\n const folded = value[key];\n console.error('FOLDING', JSON.stringify(folded));\n if (IN_PRAGMA_POS(path) && typeof folded === 'string') {\n if (value.length > 1) {\n REPLACE(\n path.get(['object']),\n TO_CONSTEXPR(value.slice(key, key + 1))\n );\n REPLACE(path.get(['property']), TO_CONSTEXPR(0));\n return path;\n }\n } else {\n return REPLACE(path, TO_CONSTEXPR(value[key]));\n }\n }\n }\n }\n }\n }\n return yield path;\n};\n\nconst $MIN = Symbol();\nconst MIN_TRUE = Object.freeze({\n [$MIN]: true,\n type: 'UnaryExpression',\n operator: '!',\n argument: Object.freeze({\n [$MIN]: true,\n type: 'Literal',\n value: 0\n })\n});\nconst MIN_FALSE = Object.freeze({\n [$MIN]: true,\n type: 'UnaryExpression',\n operator: '!',\n argument: Object.freeze({\n [$MIN]: true,\n type: 'Literal',\n value: 1\n })\n});\nconst MIN_REPLACEMENTS = new Map;\nMIN_REPLACEMENTS.set(true, MIN_TRUE);\nMIN_REPLACEMENTS.set(false, MIN_FALSE);\nconst MIN_VALUES = function*(path) {\n if (path && path.node && !path.node[$MIN] && IS_CONSTEXPR(path.node)) {\n let value = CONSTVALUE(path.node);\n if (MIN_REPLACEMENTS.has(value)) {\n console.error('MIN_VALUE', value)\n return REPLACE(path, MIN_REPLACEMENTS.get(value));\n }\n }\n return yield path;\n}\n\nimport esprima from 'esprima';\nimport util from 'util';\nimport escodegen from 'escodegen';\nconst optimize = (src) => {\n const ROOT = new NodePath(\n null,\n esprima.parse(\n src,\n {\n // loc: true,\n // source: '',\n }\n ),\n null\n );\n // all of these are things that could affect completion value positions\n const walk_expressions = WalkCombinator.pipe(\n ...[\n WalkCombinator.DEPTH_FIRST,\n {\n // We never work on Arrays\n *inputs(path) {\n if (Array.isArray(path)) return;\n return yield path;\n },\n },\n { inputs: FOLD_UNREACHABLE },\n { inputs: FOLD_IF },\n { inputs: FOLD_SWITCH },\n { inputs: FOLD_EXPR_STMT },\n { inputs: FOLD_CONDITIONAL },\n { inputs: FOLD_LOGICAL },\n { inputs: FOLD_BINARY },\n { inputs: FOLD_UNARY },\n { inputs: FOLD_SEQUENCE },\n { inputs: FOLD_MEMBER },\n { inputs: FOLD_EMPTY },\n { inputs: FOLD_WHILE },\n { inputs: FOLD_EVAL },\n ]\n ).walk(ROOT);\n for (const _ of walk_expressions) {\n }\n const minify = WalkCombinator.pipe(\n ...[\n WalkCombinator.DEPTH_FIRST,\n {\n // We never work on Arrays\n *inputs(path) {\n if (Array.isArray(path)) return;\n return yield path;\n },\n },\n { inputs: MIN_VALUES },\n ]\n ).walk(ROOT);\n for (const _ of minify) {\n }\n return ROOT;\n}\nimport mississippi from 'mississippi';\nprocess.stdin.pipe(\n mississippi.concat(buff => {\n const ROOT = optimize(`${buff}`)\n console.error(\n '%s',\n util.inspect(ROOT.node, {\n depth: null,\n colors: true,\n })\n );\n const out = escodegen.generate(ROOT.node);\n console.log(out);\n })\n);\n" }, { "path": "src/test/resources/samples/langs/JavaScript/dude.js", "content": "alert(\"dude!\")\n" }, { "path": "src/test/resources/samples/langs/JavaScript/entry.mjs", "content": "import bar from './module.mjs';\nfunction foo() {\n return \"I am foo\";\n}\nexport {foo};\nconsole.log(bar);\n" }, { "path": "src/test/resources/samples/langs/JavaScript/gen-js-linguist-thrift.js", "content": "//\n// Autogenerated by Thrift Compiler (1.0.0-dev)\n//\n// DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n//\n\n\nPullRequest = function(args) {\n this.title = null;\n if (args) {\n if (args.title !== undefined) {\n this.title = args.title;\n }\n }\n};\nPullRequest.prototype = {};\nPullRequest.prototype.read = function(input) {\n input.readStructBegin();\n while (true)\n {\n var ret = input.readFieldBegin();\n var fname = ret.fname;\n var ftype = ret.ftype;\n var fid = ret.fid;\n if (ftype == Thrift.Type.STOP) {\n break;\n }\n switch (fid)\n {\n case 1:\n if (ftype == Thrift.Type.STRING) {\n this.title = input.readString().value;\n } else {\n input.skip(ftype);\n }\n break;\n case 0:\n input.skip(ftype);\n break;\n default:\n input.skip(ftype);\n }\n input.readFieldEnd();\n }\n input.readStructEnd();\n return;\n};\n\nPullRequest.prototype.write = function(output) {\n output.writeStructBegin('PullRequest');\n if (this.title !== null && this.title !== undefined) {\n output.writeFieldBegin('title', Thrift.Type.STRING, 1);\n output.writeString(this.title);\n output.writeFieldEnd();\n }\n output.writeFieldStop();\n output.writeStructEnd();\n return;\n};\n\n" }, { "path": "src/test/resources/samples/langs/JavaScript/hello.js", "content": "(function() {\n console.log(\"Hello, World!\");\n}).call(this);\n" }, { "path": "src/test/resources/samples/langs/JavaScript/helloHanaEndpoint.xsjs", "content": "/*\n invoke endpoint by calling in a browser:\n http://:////helloHanaMath.xsjslib?x=4&y=2\n e.g.:\n http://192.168.178.20:8000/geekflyer/linguist/helloHanaEndpoint.xsjs?x=4&y=2\n */\n\nvar hanaMath = $.import(\"./helloHanaMath.xsjslib\");\n\nvar x = parseFloat($.request.parameters.get(\"x\"));\nvar y = parseFloat($.request.parameters.get(\"y\"));\n\n\nvar result = hanaMath.multiply(x, y);\n\nvar output = {\n title: \"Hello HANA XS - do some simple math\",\n input: {x: x, y: y},\n result: result\n};\n\n$.response.contentType = \"application/json\";\n$.response.statusCode = $.net.http.OK;\n$.response.setBody(JSON.stringify(output));" }, { "path": "src/test/resources/samples/langs/JavaScript/helloHanaMath.xsjslib", "content": "/* simple hana xs demo library, which can be used by multiple endpoints */\n\nfunction multiply(x, y) {\n return x * y;\n}\n\nfunction add(x, y) {\n return x + y;\n}" }, { "path": "src/test/resources/samples/langs/JavaScript/http.js", "content": "// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\nvar util = require('util');\nvar net = require('net');\nvar stream = require('stream');\nvar url = require('url');\nvar EventEmitter = require('events').EventEmitter;\nvar FreeList = require('freelist').FreeList;\nvar HTTPParser = process.binding('http_parser').HTTPParser;\nvar assert = require('assert').ok;\nvar END_OF_FILE = {};\n\n\nvar debug;\nif (process.env.NODE_DEBUG && /http/.test(process.env.NODE_DEBUG)) {\n debug = function(x) { console.error('HTTP: %s', x); };\n} else {\n debug = function() { };\n}\n\n// Only called in the slow case where slow means\n// that the request headers were either fragmented\n// across multiple TCP packets or too large to be\n// processed in a single run. This method is also\n// called to process trailing HTTP headers.\nfunction parserOnHeaders(headers, url) {\n // Once we exceeded headers limit - stop collecting them\n if (this.maxHeaderPairs <= 0 ||\n this._headers.length < this.maxHeaderPairs) {\n this._headers = this._headers.concat(headers);\n }\n this._url += url;\n}\n\n// info.headers and info.url are set only if .onHeaders()\n// has not been called for this request.\n//\n// info.url is not set for response parsers but that's not\n// applicable here since all our parsers are request parsers.\nfunction parserOnHeadersComplete(info) {\n var parser = this;\n var headers = info.headers;\n var url = info.url;\n\n if (!headers) {\n headers = parser._headers;\n parser._headers = [];\n }\n\n if (!url) {\n url = parser._url;\n parser._url = '';\n }\n\n parser.incoming = new IncomingMessage(parser.socket);\n parser.incoming.httpVersionMajor = info.versionMajor;\n parser.incoming.httpVersionMinor = info.versionMinor;\n parser.incoming.httpVersion = info.versionMajor + '.' + info.versionMinor;\n parser.incoming.url = url;\n\n var n = headers.length;\n\n // If parser.maxHeaderPairs <= 0 - assume that there're no limit\n if (parser.maxHeaderPairs > 0) {\n n = Math.min(n, parser.maxHeaderPairs);\n }\n\n for (var i = 0; i < n; i += 2) {\n var k = headers[i];\n var v = headers[i + 1];\n parser.incoming._addHeaderLine(k, v);\n }\n\n\n if (info.method) {\n // server only\n parser.incoming.method = info.method;\n } else {\n // client only\n parser.incoming.statusCode = info.statusCode;\n // CHECKME dead code? we're always a request parser\n }\n\n parser.incoming.upgrade = info.upgrade;\n\n var skipBody = false; // response to HEAD or CONNECT\n\n if (!info.upgrade) {\n // For upgraded connections and CONNECT method request,\n // we'll emit this after parser.execute\n // so that we can capture the first part of the new protocol\n skipBody = parser.onIncoming(parser.incoming, info.shouldKeepAlive);\n }\n\n return skipBody;\n}\n\nfunction parserOnBody(b, start, len) {\n var parser = this;\n var slice = b.slice(start, start + len);\n if (parser.incoming._paused || parser.incoming._pendings.length) {\n parser.incoming._pendings.push(slice);\n } else {\n parser.incoming._emitData(slice);\n }\n}\n\nfunction parserOnMessageComplete() {\n var parser = this;\n parser.incoming.complete = true;\n\n // Emit any trailing headers.\n var headers = parser._headers;\n if (headers) {\n for (var i = 0, n = headers.length; i < n; i += 2) {\n var k = headers[i];\n var v = headers[i + 1];\n parser.incoming._addHeaderLine(k, v);\n }\n parser._headers = [];\n parser._url = '';\n }\n\n if (!parser.incoming.upgrade) {\n // For upgraded connections, also emit this after parser.execute\n if (parser.incoming._paused || parser.incoming._pendings.length) {\n parser.incoming._pendings.push(END_OF_FILE);\n } else {\n parser.incoming.readable = false;\n parser.incoming._emitEnd();\n }\n }\n\n if (parser.socket.readable) {\n // force to read the next incoming message\n parser.socket.resume();\n }\n}\n\n\nvar parsers = new FreeList('parsers', 1000, function() {\n var parser = new HTTPParser(HTTPParser.REQUEST);\n\n parser._headers = [];\n parser._url = '';\n\n // Only called in the slow case where slow means\n // that the request headers were either fragmented\n // across multiple TCP packets or too large to be\n // processed in a single run. This method is also\n // called to process trailing HTTP headers.\n parser.onHeaders = parserOnHeaders;\n parser.onHeadersComplete = parserOnHeadersComplete;\n parser.onBody = parserOnBody;\n parser.onMessageComplete = parserOnMessageComplete;\n\n return parser;\n});\nexports.parsers = parsers;\n\n\nvar CRLF = '\\r\\n';\nvar STATUS_CODES = exports.STATUS_CODES = {\n 100 : 'Continue',\n 101 : 'Switching Protocols',\n 102 : 'Processing', // RFC 2518, obsoleted by RFC 4918\n 200 : 'OK',\n 201 : 'Created',\n 202 : 'Accepted',\n 203 : 'Non-Authoritative Information',\n 204 : 'No Content',\n 205 : 'Reset Content',\n 206 : 'Partial Content',\n 207 : 'Multi-Status', // RFC 4918\n 300 : 'Multiple Choices',\n 301 : 'Moved Permanently',\n 302 : 'Moved Temporarily',\n 303 : 'See Other',\n 304 : 'Not Modified',\n 305 : 'Use Proxy',\n 307 : 'Temporary Redirect',\n 400 : 'Bad Request',\n 401 : 'Unauthorized',\n 402 : 'Payment Required',\n 403 : 'Forbidden',\n 404 : 'Not Found',\n 405 : 'Method Not Allowed',\n 406 : 'Not Acceptable',\n 407 : 'Proxy Authentication Required',\n 408 : 'Request Time-out',\n 409 : 'Conflict',\n 410 : 'Gone',\n 411 : 'Length Required',\n 412 : 'Precondition Failed',\n 413 : 'Request Entity Too Large',\n 414 : 'Request-URI Too Large',\n 415 : 'Unsupported Media Type',\n 416 : 'Requested Range Not Satisfiable',\n 417 : 'Expectation Failed',\n 418 : 'I\\'m a teapot', // RFC 2324\n 422 : 'Unprocessable Entity', // RFC 4918\n 423 : 'Locked', // RFC 4918\n 424 : 'Failed Dependency', // RFC 4918\n 425 : 'Unordered Collection', // RFC 4918\n 426 : 'Upgrade Required', // RFC 2817\n 428 : 'Precondition Required', // RFC 6585\n 429 : 'Too Many Requests', // RFC 6585\n 431 : 'Request Header Fields Too Large',// RFC 6585\n 500 : 'Internal Server Error',\n 501 : 'Not Implemented',\n 502 : 'Bad Gateway',\n 503 : 'Service Unavailable',\n 504 : 'Gateway Time-out',\n 505 : 'HTTP Version not supported',\n 506 : 'Variant Also Negotiates', // RFC 2295\n 507 : 'Insufficient Storage', // RFC 4918\n 509 : 'Bandwidth Limit Exceeded',\n 510 : 'Not Extended', // RFC 2774\n 511 : 'Network Authentication Required' // RFC 6585\n};\n\n\nvar connectionExpression = /Connection/i;\nvar transferEncodingExpression = /Transfer-Encoding/i;\nvar closeExpression = /close/i;\nvar chunkExpression = /chunk/i;\nvar contentLengthExpression = /Content-Length/i;\nvar dateExpression = /Date/i;\nvar expectExpression = /Expect/i;\nvar continueExpression = /100-continue/i;\n\nvar dateCache;\nfunction utcDate() {\n if (!dateCache) {\n var d = new Date();\n dateCache = d.toUTCString();\n setTimeout(function() {\n dateCache = undefined;\n }, 1000 - d.getMilliseconds());\n }\n return dateCache;\n}\n\n\n/* Abstract base class for ServerRequest and ClientResponse. */\nfunction IncomingMessage(socket) {\n stream.Stream.call(this);\n\n // TODO Remove one of these eventually.\n this.socket = socket;\n this.connection = socket;\n\n this.httpVersion = null;\n this.complete = false;\n this.headers = {};\n this.trailers = {};\n\n this.readable = true;\n\n this._paused = false;\n this._pendings = [];\n\n this._endEmitted = false;\n\n // request (server) only\n this.url = '';\n\n this.method = null;\n\n // response (client) only\n this.statusCode = null;\n this.client = this.socket;\n}\nutil.inherits(IncomingMessage, stream.Stream);\n\n\nexports.IncomingMessage = IncomingMessage;\n\n\nIncomingMessage.prototype.destroy = function(error) {\n this.socket.destroy(error);\n};\n\n\nIncomingMessage.prototype.setEncoding = function(encoding) {\n var StringDecoder = require('string_decoder').StringDecoder; // lazy load\n this._decoder = new StringDecoder(encoding);\n};\n\n\nIncomingMessage.prototype.pause = function() {\n this._paused = true;\n this.socket.pause();\n};\n\n\nIncomingMessage.prototype.resume = function() {\n this._paused = false;\n if (this.socket) {\n this.socket.resume();\n }\n\n this._emitPending();\n};\n\n\nIncomingMessage.prototype._emitPending = function(callback) {\n if (this._pendings.length) {\n var self = this;\n process.nextTick(function() {\n while (!self._paused && self._pendings.length) {\n var chunk = self._pendings.shift();\n if (chunk !== END_OF_FILE) {\n assert(Buffer.isBuffer(chunk));\n self._emitData(chunk);\n } else {\n assert(self._pendings.length === 0);\n self.readable = false;\n self._emitEnd();\n }\n }\n\n if (callback) {\n callback();\n }\n });\n } else if (callback) {\n callback();\n }\n};\n\n\nIncomingMessage.prototype._emitData = function(d) {\n if (this._decoder) {\n var string = this._decoder.write(d);\n if (string.length) {\n this.emit('data', string);\n }\n } else {\n this.emit('data', d);\n }\n};\n\n\nIncomingMessage.prototype._emitEnd = function() {\n if (!this._endEmitted) {\n this.emit('end');\n }\n\n this._endEmitted = true;\n};\n\n\n// Add the given (field, value) pair to the message\n//\n// Per RFC2616, section 4.2 it is acceptable to join multiple instances of the\n// same header with a ', ' if the header in question supports specification of\n// multiple values this way. If not, we declare the first instance the winner\n// and drop the second. Extended header fields (those beginning with 'x-') are\n// always joined.\nIncomingMessage.prototype._addHeaderLine = function(field, value) {\n var dest = this.complete ? this.trailers : this.headers;\n\n field = field.toLowerCase();\n switch (field) {\n // Array headers:\n case 'set-cookie':\n if (field in dest) {\n dest[field].push(value);\n } else {\n dest[field] = [value];\n }\n break;\n\n // Comma separate. Maybe make these arrays?\n case 'accept':\n case 'accept-charset':\n case 'accept-encoding':\n case 'accept-language':\n case 'connection':\n case 'cookie':\n case 'pragma':\n case 'link':\n case 'www-authenticate':\n case 'sec-websocket-extensions':\n case 'sec-websocket-protocol':\n if (field in dest) {\n dest[field] += ', ' + value;\n } else {\n dest[field] = value;\n }\n break;\n\n\n default:\n if (field.slice(0, 2) == 'x-') {\n // except for x-\n if (field in dest) {\n dest[field] += ', ' + value;\n } else {\n dest[field] = value;\n }\n } else {\n // drop duplicates\n if (!(field in dest)) dest[field] = value;\n }\n break;\n }\n};\n\n\nfunction OutgoingMessage() {\n stream.Stream.call(this);\n\n this.output = [];\n this.outputEncodings = [];\n\n this.writable = true;\n\n this._last = false;\n this.chunkedEncoding = false;\n this.shouldKeepAlive = true;\n this.useChunkedEncodingByDefault = true;\n this.sendDate = false;\n\n this._hasBody = true;\n this._trailer = '';\n\n this.finished = false;\n}\nutil.inherits(OutgoingMessage, stream.Stream);\n\n\nexports.OutgoingMessage = OutgoingMessage;\n\n\nOutgoingMessage.prototype.destroy = function(error) {\n this.socket.destroy(error);\n};\n\n\n// This abstract either writing directly to the socket or buffering it.\nOutgoingMessage.prototype._send = function(data, encoding) {\n // This is a shameful hack to get the headers and first body chunk onto\n // the same packet. Future versions of Node are going to take care of\n // this at a lower level and in a more general way.\n if (!this._headerSent) {\n if (typeof data === 'string') {\n data = this._header + data;\n } else {\n this.output.unshift(this._header);\n this.outputEncodings.unshift('ascii');\n }\n this._headerSent = true;\n }\n return this._writeRaw(data, encoding);\n};\n\n\nOutgoingMessage.prototype._writeRaw = function(data, encoding) {\n if (data.length === 0) {\n return true;\n }\n\n if (this.connection &&\n this.connection._httpMessage === this &&\n this.connection.writable) {\n // There might be pending data in the this.output buffer.\n while (this.output.length) {\n if (!this.connection.writable) {\n this._buffer(data, encoding);\n return false;\n }\n var c = this.output.shift();\n var e = this.outputEncodings.shift();\n this.connection.write(c, e);\n }\n\n // Directly write to socket.\n return this.connection.write(data, encoding);\n } else {\n this._buffer(data, encoding);\n return false;\n }\n};\n\n\nOutgoingMessage.prototype._buffer = function(data, encoding) {\n if (data.length === 0) return;\n\n var length = this.output.length;\n\n if (length === 0 || typeof data != 'string') {\n this.output.push(data);\n this.outputEncodings.push(encoding);\n return false;\n }\n\n var lastEncoding = this.outputEncodings[length - 1];\n var lastData = this.output[length - 1];\n\n if ((encoding && lastEncoding === encoding) ||\n (!encoding && data.constructor === lastData.constructor)) {\n this.output[length - 1] = lastData + data;\n return false;\n }\n\n this.output.push(data);\n this.outputEncodings.push(encoding);\n\n return false;\n};\n\n\nOutgoingMessage.prototype._storeHeader = function(firstLine, headers) {\n var sentConnectionHeader = false;\n var sentContentLengthHeader = false;\n var sentTransferEncodingHeader = false;\n var sentDateHeader = false;\n var sentExpect = false;\n\n // firstLine in the case of request is: 'GET /index.html HTTP/1.1\\r\\n'\n // in the case of response it is: 'HTTP/1.1 200 OK\\r\\n'\n var messageHeader = firstLine;\n var field, value;\n var self = this;\n\n function store(field, value) {\n messageHeader += field + ': ' + value + CRLF;\n\n if (connectionExpression.test(field)) {\n sentConnectionHeader = true;\n if (closeExpression.test(value)) {\n self._last = true;\n } else {\n self.shouldKeepAlive = true;\n }\n\n } else if (transferEncodingExpression.test(field)) {\n sentTransferEncodingHeader = true;\n if (chunkExpression.test(value)) self.chunkedEncoding = true;\n\n } else if (contentLengthExpression.test(field)) {\n sentContentLengthHeader = true;\n } else if (dateExpression.test(field)) {\n sentDateHeader = true;\n } else if (expectExpression.test(field)) {\n sentExpect = true;\n }\n }\n\n if (headers) {\n var keys = Object.keys(headers);\n var isArray = (Array.isArray(headers));\n var field, value;\n\n for (var i = 0, l = keys.length; i < l; i++) {\n var key = keys[i];\n if (isArray) {\n field = headers[key][0];\n value = headers[key][1];\n } else {\n field = key;\n value = headers[key];\n }\n\n if (Array.isArray(value)) {\n for (var j = 0; j < value.length; j++) {\n store(field, value[j]);\n }\n } else {\n store(field, value);\n }\n }\n }\n\n // Date header\n if (this.sendDate == true && sentDateHeader == false) {\n messageHeader += 'Date: ' + utcDate() + CRLF;\n }\n\n // keep-alive logic\n if (sentConnectionHeader === false) {\n var shouldSendKeepAlive = this.shouldKeepAlive &&\n (sentContentLengthHeader ||\n this.useChunkedEncodingByDefault ||\n this.agent);\n if (shouldSendKeepAlive) {\n messageHeader += 'Connection: keep-alive\\r\\n';\n } else {\n this._last = true;\n messageHeader += 'Connection: close\\r\\n';\n }\n }\n\n if (sentContentLengthHeader == false && sentTransferEncodingHeader == false) {\n if (this._hasBody) {\n if (this.useChunkedEncodingByDefault) {\n messageHeader += 'Transfer-Encoding: chunked\\r\\n';\n this.chunkedEncoding = true;\n } else {\n this._last = true;\n }\n } else {\n // Make sure we don't end the 0\\r\\n\\r\\n at the end of the message.\n this.chunkedEncoding = false;\n }\n }\n\n this._header = messageHeader + CRLF;\n this._headerSent = false;\n\n // wait until the first body chunk, or close(), is sent to flush,\n // UNLESS we're sending Expect: 100-continue.\n if (sentExpect) this._send('');\n};\n\n\nOutgoingMessage.prototype.setHeader = function(name, value) {\n if (arguments.length < 2) {\n throw new Error('`name` and `value` are required for setHeader().');\n }\n\n if (this._header) {\n throw new Error('Can\\'t set headers after they are sent.');\n }\n\n var key = name.toLowerCase();\n this._headers = this._headers || {};\n this._headerNames = this._headerNames || {};\n this._headers[key] = value;\n this._headerNames[key] = name;\n};\n\n\nOutgoingMessage.prototype.getHeader = function(name) {\n if (arguments.length < 1) {\n throw new Error('`name` is required for getHeader().');\n }\n\n if (!this._headers) return;\n\n var key = name.toLowerCase();\n return this._headers[key];\n};\n\n\nOutgoingMessage.prototype.removeHeader = function(name) {\n if (arguments.length < 1) {\n throw new Error('`name` is required for removeHeader().');\n }\n\n if (this._header) {\n throw new Error('Can\\'t remove headers after they are sent.');\n }\n\n if (!this._headers) return;\n\n var key = name.toLowerCase();\n delete this._headers[key];\n delete this._headerNames[key];\n};\n\n\nOutgoingMessage.prototype._renderHeaders = function() {\n if (this._header) {\n throw new Error('Can\\'t render headers after they are sent to the client.');\n }\n\n if (!this._headers) return {};\n\n var headers = {};\n var keys = Object.keys(this._headers);\n for (var i = 0, l = keys.length; i < l; i++) {\n var key = keys[i];\n headers[this._headerNames[key]] = this._headers[key];\n }\n return headers;\n};\n\n\n\nOutgoingMessage.prototype.write = function(chunk, encoding) {\n if (!this._header) {\n this._implicitHeader();\n }\n\n if (!this._hasBody) {\n console.error('This type of response MUST NOT have a body. ' +\n 'Ignoring write() calls.');\n return true;\n }\n\n if (typeof chunk !== 'string' && !Buffer.isBuffer(chunk)) {\n throw new TypeError('first argument must be a string or Buffer');\n }\n\n if (chunk.length === 0) return false;\n\n var len, ret;\n if (this.chunkedEncoding) {\n if (typeof(chunk) === 'string') {\n len = Buffer.byteLength(chunk, encoding);\n chunk = len.toString(16) + CRLF + chunk + CRLF;\n ret = this._send(chunk, encoding);\n } else {\n // buffer\n len = chunk.length;\n this._send(len.toString(16) + CRLF);\n this._send(chunk);\n ret = this._send(CRLF);\n }\n } else {\n ret = this._send(chunk, encoding);\n }\n\n debug('write ret = ' + ret);\n return ret;\n};\n\n\nOutgoingMessage.prototype.addTrailers = function(headers) {\n this._trailer = '';\n var keys = Object.keys(headers);\n var isArray = (Array.isArray(headers));\n var field, value;\n for (var i = 0, l = keys.length; i < l; i++) {\n var key = keys[i];\n if (isArray) {\n field = headers[key][0];\n value = headers[key][1];\n } else {\n field = key;\n value = headers[key];\n }\n\n this._trailer += field + ': ' + value + CRLF;\n }\n};\n\n\nOutgoingMessage.prototype.end = function(data, encoding) {\n if (this.finished) {\n return false;\n }\n if (!this._header) {\n this._implicitHeader();\n }\n\n if (data && !this._hasBody) {\n console.error('This type of response MUST NOT have a body. ' +\n 'Ignoring data passed to end().');\n data = false;\n }\n\n var ret;\n\n var hot = this._headerSent === false &&\n typeof(data) === 'string' &&\n data.length > 0 &&\n this.output.length === 0 &&\n this.connection &&\n this.connection.writable &&\n this.connection._httpMessage === this;\n\n if (hot) {\n // Hot path. They're doing\n // res.writeHead();\n // res.end(blah);\n // HACKY.\n\n if (this.chunkedEncoding) {\n var l = Buffer.byteLength(data, encoding).toString(16);\n ret = this.connection.write(this._header + l + CRLF +\n data + '\\r\\n0\\r\\n' +\n this._trailer + '\\r\\n', encoding);\n } else {\n ret = this.connection.write(this._header + data, encoding);\n }\n this._headerSent = true;\n\n } else if (data) {\n // Normal body write.\n ret = this.write(data, encoding);\n }\n\n if (!hot) {\n if (this.chunkedEncoding) {\n ret = this._send('0\\r\\n' + this._trailer + '\\r\\n'); // Last chunk.\n } else {\n // Force a flush, HACK.\n ret = this._send('');\n }\n }\n\n this.finished = true;\n\n // There is the first message on the outgoing queue, and we've sent\n // everything to the socket.\n debug('outgoing message end.');\n if (this.output.length === 0 && this.connection._httpMessage === this) {\n this._finish();\n }\n\n return ret;\n};\n\n\nOutgoingMessage.prototype._finish = function() {\n assert(this.connection);\n if (this instanceof ServerResponse) {\n DTRACE_HTTP_SERVER_RESPONSE(this.connection);\n } else {\n assert(this instanceof ClientRequest);\n DTRACE_HTTP_CLIENT_REQUEST(this, this.connection);\n }\n this.emit('finish');\n};\n\n\nOutgoingMessage.prototype._flush = function() {\n // This logic is probably a bit confusing. Let me explain a bit:\n //\n // In both HTTP servers and clients it is possible to queue up several\n // outgoing messages. This is easiest to imagine in the case of a client.\n // Take the following situation:\n //\n // req1 = client.request('GET', '/');\n // req2 = client.request('POST', '/');\n //\n // When the user does\n //\n // req2.write('hello world\\n');\n //\n // it's possible that the first request has not been completely flushed to\n // the socket yet. Thus the outgoing messages need to be prepared to queue\n // up data internally before sending it on further to the socket's queue.\n //\n // This function, outgoingFlush(), is called by both the Server and Client\n // to attempt to flush any pending messages out to the socket.\n\n if (!this.socket) return;\n\n var ret;\n while (this.output.length) {\n\n if (!this.socket.writable) return; // XXX Necessary?\n\n var data = this.output.shift();\n var encoding = this.outputEncodings.shift();\n\n ret = this.socket.write(data, encoding);\n }\n\n if (this.finished) {\n // This is a queue to the server or client to bring in the next this.\n this._finish();\n } else if (ret) {\n // This is necessary to prevent https from breaking\n this.emit('drain');\n }\n};\n\n\n\n\nfunction ServerResponse(req) {\n OutgoingMessage.call(this);\n\n if (req.method === 'HEAD') this._hasBody = false;\n\n this.sendDate = true;\n\n if (req.httpVersionMajor < 1 || req.httpVersionMinor < 1) {\n this.useChunkedEncodingByDefault = false;\n this.shouldKeepAlive = false;\n }\n}\nutil.inherits(ServerResponse, OutgoingMessage);\n\n\nexports.ServerResponse = ServerResponse;\n\nServerResponse.prototype.statusCode = 200;\n\nfunction onServerResponseClose() {\n this._httpMessage.emit('close');\n}\n\nServerResponse.prototype.assignSocket = function(socket) {\n assert(!socket._httpMessage);\n socket._httpMessage = this;\n socket.on('close', onServerResponseClose);\n this.socket = socket;\n this.connection = socket;\n this._flush();\n};\n\nServerResponse.prototype.detachSocket = function(socket) {\n assert(socket._httpMessage == this);\n socket.removeListener('close', onServerResponseClose);\n socket._httpMessage = null;\n this.socket = this.connection = null;\n};\n\nServerResponse.prototype.writeContinue = function() {\n this._writeRaw('HTTP/1.1 100 Continue' + CRLF + CRLF, 'ascii');\n this._sent100 = true;\n};\n\nServerResponse.prototype._implicitHeader = function() {\n this.writeHead(this.statusCode);\n};\n\nServerResponse.prototype.writeHead = function(statusCode) {\n var reasonPhrase, headers, headerIndex;\n\n if (typeof arguments[1] == 'string') {\n reasonPhrase = arguments[1];\n headerIndex = 2;\n } else {\n reasonPhrase = STATUS_CODES[statusCode] || 'unknown';\n headerIndex = 1;\n }\n this.statusCode = statusCode;\n\n var obj = arguments[headerIndex];\n\n if (obj && this._headers) {\n // Slow-case: when progressive API and header fields are passed.\n headers = this._renderHeaders();\n\n if (Array.isArray(obj)) {\n // handle array case\n // TODO: remove when array is no longer accepted\n var field;\n for (var i = 0, len = obj.length; i < len; ++i) {\n field = obj[i][0];\n if (field in headers) {\n obj.push([field, headers[field]]);\n }\n }\n headers = obj;\n\n } else {\n // handle object case\n var keys = Object.keys(obj);\n for (var i = 0; i < keys.length; i++) {\n var k = keys[i];\n if (k) headers[k] = obj[k];\n }\n }\n } else if (this._headers) {\n // only progressive api is used\n headers = this._renderHeaders();\n } else {\n // only writeHead() called\n headers = obj;\n }\n\n var statusLine = 'HTTP/1.1 ' + statusCode.toString() + ' ' +\n reasonPhrase + CRLF;\n\n if (statusCode === 204 || statusCode === 304 ||\n (100 <= statusCode && statusCode <= 199)) {\n // RFC 2616, 10.2.5:\n // The 204 response MUST NOT include a message-body, and thus is always\n // terminated by the first empty line after the header fields.\n // RFC 2616, 10.3.5:\n // The 304 response MUST NOT contain a message-body, and thus is always\n // terminated by the first empty line after the header fields.\n // RFC 2616, 10.1 Informational 1xx:\n // This class of status code indicates a provisional response,\n // consisting only of the Status-Line and optional headers, and is\n // terminated by an empty line.\n this._hasBody = false;\n }\n\n // don't keep alive connections where the client expects 100 Continue\n // but we sent a final status; they may put extra bytes on the wire.\n if (this._expect_continue && ! this._sent100) {\n this.shouldKeepAlive = false;\n }\n\n this._storeHeader(statusLine, headers);\n};\n\nServerResponse.prototype.writeHeader = function() {\n this.writeHead.apply(this, arguments);\n};\n\n\n// New Agent code.\n\n// The largest departure from the previous implementation is that\n// an Agent instance holds connections for a variable number of host:ports.\n// Surprisingly, this is still API compatible as far as third parties are\n// concerned. The only code that really notices the difference is the\n// request object.\n\n// Another departure is that all code related to HTTP parsing is in\n// ClientRequest.onSocket(). The Agent is now *strictly*\n// concerned with managing a connection pool.\n\nfunction Agent(options) {\n var self = this;\n self.options = options || {};\n self.requests = {};\n self.sockets = {};\n self.maxSockets = self.options.maxSockets || Agent.defaultMaxSockets;\n self.on('free', function(socket, host, port, localAddress) {\n var name = host + ':' + port;\n if (localAddress) {\n name += ':' + localAddress;\n }\n\n if (self.requests[name] && self.requests[name].length) {\n self.requests[name].shift().onSocket(socket);\n if (self.requests[name].length === 0) {\n // don't leak\n delete self.requests[name];\n }\n } else {\n // If there are no pending requests just destroy the\n // socket and it will get removed from the pool. This\n // gets us out of timeout issues and allows us to\n // default to Connection:keep-alive.\n socket.destroy();\n }\n });\n self.createConnection = net.createConnection;\n}\nutil.inherits(Agent, EventEmitter);\nexports.Agent = Agent;\n\nAgent.defaultMaxSockets = 5;\n\nAgent.prototype.defaultPort = 80;\nAgent.prototype.addRequest = function(req, host, port, localAddress) {\n var name = host + ':' + port;\n if (localAddress) {\n name += ':' + localAddress;\n }\n if (!this.sockets[name]) {\n this.sockets[name] = [];\n }\n if (this.sockets[name].length < this.maxSockets) {\n // If we are under maxSockets create a new one.\n req.onSocket(this.createSocket(name, host, port, localAddress));\n } else {\n // We are over limit so we'll add it to the queue.\n if (!this.requests[name]) {\n this.requests[name] = [];\n }\n this.requests[name].push(req);\n }\n};\nAgent.prototype.createSocket = function(name, host, port, localAddress) {\n var self = this;\n var options = util._extend({}, self.options);\n options.port = port;\n options.host = host;\n options.localAddress = localAddress;\n var s = self.createConnection(options);\n if (!self.sockets[name]) {\n self.sockets[name] = [];\n }\n this.sockets[name].push(s);\n var onFree = function() {\n self.emit('free', s, host, port, localAddress);\n }\n s.on('free', onFree);\n var onClose = function(err) {\n // This is the only place where sockets get removed from the Agent.\n // If you want to remove a socket from the pool, just close it.\n // All socket errors end in a close event anyway.\n self.removeSocket(s, name, host, port, localAddress);\n }\n s.on('close', onClose);\n var onRemove = function() {\n // We need this function for cases like HTTP 'upgrade'\n // (defined by WebSockets) where we need to remove a socket from the pool\n // because it'll be locked up indefinitely\n self.removeSocket(s, name, host, port, localAddress);\n s.removeListener('close', onClose);\n s.removeListener('free', onFree);\n s.removeListener('agentRemove', onRemove);\n }\n s.on('agentRemove', onRemove);\n return s;\n};\nAgent.prototype.removeSocket = function(s, name, host, port, localAddress) {\n if (this.sockets[name]) {\n var index = this.sockets[name].indexOf(s);\n if (index !== -1) {\n this.sockets[name].splice(index, 1);\n if (this.sockets[name].length === 0) {\n // don't leak\n delete this.sockets[name];\n }\n }\n }\n if (this.requests[name] && this.requests[name].length) {\n // If we have pending requests and a socket gets closed a new one\n this.createSocket(name, host, port, localAddress).emit('free');\n }\n};\n\nvar globalAgent = new Agent();\nexports.globalAgent = globalAgent;\n\n\nfunction ClientRequest(options, cb) {\n var self = this;\n OutgoingMessage.call(self);\n\n self.agent = options.agent === undefined ? globalAgent : options.agent;\n\n var defaultPort = options.defaultPort || 80;\n\n var port = options.port || defaultPort;\n var host = options.hostname || options.host || 'localhost';\n\n if (options.setHost === undefined) {\n var setHost = true;\n }\n\n self.socketPath = options.socketPath;\n\n var method = self.method = (options.method || 'GET').toUpperCase();\n self.path = options.path || '/';\n if (cb) {\n self.once('response', cb);\n }\n\n if (!Array.isArray(options.headers)) {\n if (options.headers) {\n var keys = Object.keys(options.headers);\n for (var i = 0, l = keys.length; i < l; i++) {\n var key = keys[i];\n self.setHeader(key, options.headers[key]);\n }\n }\n if (host && !this.getHeader('host') && setHost) {\n var hostHeader = host;\n if (port && +port !== defaultPort) {\n hostHeader += ':' + port;\n }\n this.setHeader('Host', hostHeader);\n }\n }\n\n if (options.auth && !this.getHeader('Authorization')) {\n //basic auth\n this.setHeader('Authorization', 'Basic ' +\n new Buffer(options.auth).toString('base64'));\n }\n\n if (method === 'GET' || method === 'HEAD' || method === 'CONNECT') {\n self.useChunkedEncodingByDefault = false;\n } else {\n self.useChunkedEncodingByDefault = true;\n }\n\n if (Array.isArray(options.headers)) {\n self._storeHeader(self.method + ' ' + self.path + ' HTTP/1.1\\r\\n',\n options.headers);\n } else if (self.getHeader('expect')) {\n self._storeHeader(self.method + ' ' + self.path + ' HTTP/1.1\\r\\n',\n self._renderHeaders());\n }\n if (self.socketPath) {\n self._last = true;\n self.shouldKeepAlive = false;\n if (options.createConnection) {\n self.onSocket(options.createConnection(self.socketPath));\n } else {\n self.onSocket(net.createConnection(self.socketPath));\n }\n } else if (self.agent) {\n // If there is an agent we should default to Connection:keep-alive.\n self._last = false;\n self.shouldKeepAlive = true;\n self.agent.addRequest(self, host, port, options.localAddress);\n } else {\n // No agent, default to Connection:close.\n self._last = true;\n self.shouldKeepAlive = false;\n if (options.createConnection) {\n options.port = port;\n options.host = host;\n var conn = options.createConnection(options);\n } else {\n var conn = net.createConnection({\n port: port,\n host: host,\n localAddress: options.localAddress\n });\n }\n self.onSocket(conn);\n }\n\n self._deferToConnect(null, null, function() {\n self._flush();\n self = null;\n });\n\n}\nutil.inherits(ClientRequest, OutgoingMessage);\n\nexports.ClientRequest = ClientRequest;\n\nClientRequest.prototype._implicitHeader = function() {\n this._storeHeader(this.method + ' ' + this.path + ' HTTP/1.1\\r\\n',\n this._renderHeaders());\n};\n\nClientRequest.prototype.abort = function() {\n if (this.socket) {\n // in-progress\n this.socket.destroy();\n } else {\n // haven't been assigned a socket yet.\n // this could be more efficient, it could\n // remove itself from the pending requests\n this._deferToConnect('destroy', []);\n }\n};\n\n\nfunction createHangUpError() {\n var error = new Error('socket hang up');\n error.code = 'ECONNRESET';\n return error;\n}\n\n// Free the parser and also break any links that it\n// might have to any other things.\n// TODO: All parser data should be attached to a\n// single object, so that it can be easily cleaned\n// up by doing `parser.data = {}`, which should\n// be done in FreeList.free. `parsers.free(parser)`\n// should be all that is needed.\nfunction freeParser(parser, req) {\n if (parser) {\n parser._headers = [];\n parser.onIncoming = null;\n if (parser.socket) {\n parser.socket.onend = null;\n parser.socket.ondata = null;\n parser.socket.parser = null;\n }\n parser.socket = null;\n parser.incoming = null;\n parsers.free(parser);\n parser = null;\n }\n if (req) {\n req.parser = null;\n }\n}\n\n\nfunction socketCloseListener() {\n var socket = this;\n var parser = socket.parser;\n var req = socket._httpMessage;\n debug('HTTP socket close');\n req.emit('close');\n if (req.res && req.res.readable) {\n // Socket closed before we emitted 'end' below.\n req.res.emit('aborted');\n var res = req.res;\n req.res._emitPending(function() {\n res._emitEnd();\n res.emit('close');\n res = null;\n });\n } else if (!req.res && !req._hadError) {\n // This socket error fired before we started to\n // receive a response. The error needs to\n // fire on the request.\n req.emit('error', createHangUpError());\n }\n\n if (parser) {\n parser.finish();\n freeParser(parser, req);\n }\n}\n\nfunction socketErrorListener(err) {\n var socket = this;\n var parser = socket.parser;\n var req = socket._httpMessage;\n debug('HTTP SOCKET ERROR: ' + err.message + '\\n' + err.stack);\n\n if (req) {\n req.emit('error', err);\n // For Safety. Some additional errors might fire later on\n // and we need to make sure we don't double-fire the error event.\n req._hadError = true;\n }\n\n if (parser) {\n parser.finish();\n freeParser(parser, req);\n }\n socket.destroy();\n}\n\nfunction socketOnEnd() {\n var socket = this;\n var req = this._httpMessage;\n var parser = this.parser;\n\n if (!req.res) {\n // If we don't have a response then we know that the socket\n // ended prematurely and we need to emit an error on the request.\n req.emit('error', createHangUpError());\n req._hadError = true;\n }\n if (parser) {\n parser.finish();\n freeParser(parser, req);\n }\n socket.destroy();\n}\n\nfunction socketOnData(d, start, end) {\n var socket = this;\n var req = this._httpMessage;\n var parser = this.parser;\n\n var ret = parser.execute(d, start, end - start);\n if (ret instanceof Error) {\n debug('parse error');\n freeParser(parser, req);\n socket.destroy(ret);\n } else if (parser.incoming && parser.incoming.upgrade) {\n // Upgrade or CONNECT\n var bytesParsed = ret;\n var res = parser.incoming;\n req.res = res;\n\n socket.ondata = null;\n socket.onend = null;\n parser.finish();\n\n // This is start + byteParsed\n var bodyHead = d.slice(start + bytesParsed, end);\n\n var eventName = req.method === 'CONNECT' ? 'connect' : 'upgrade';\n if (req.listeners(eventName).length) {\n req.upgradeOrConnect = true;\n\n // detach the socket\n socket.emit('agentRemove');\n socket.removeListener('close', socketCloseListener);\n socket.removeListener('error', socketErrorListener);\n\n req.emit(eventName, res, socket, bodyHead);\n req.emit('close');\n } else {\n // Got Upgrade header or CONNECT method, but have no handler.\n socket.destroy();\n }\n freeParser(parser, req);\n } else if (parser.incoming && parser.incoming.complete &&\n // When the status code is 100 (Continue), the server will\n // send a final response after this client sends a request\n // body. So, we must not free the parser.\n parser.incoming.statusCode !== 100) {\n freeParser(parser, req);\n }\n}\n\n\nfunction parserOnIncomingClient(res, shouldKeepAlive) {\n var parser = this;\n var socket = this.socket;\n var req = socket._httpMessage;\n\n debug('AGENT incoming response!');\n\n if (req.res) {\n // We already have a response object, this means the server\n // sent a double response.\n socket.destroy();\n return;\n }\n req.res = res;\n\n // Responses to CONNECT request is handled as Upgrade.\n if (req.method === 'CONNECT') {\n res.upgrade = true;\n return true; // skip body\n }\n\n // Responses to HEAD requests are crazy.\n // HEAD responses aren't allowed to have an entity-body\n // but *can* have a content-length which actually corresponds\n // to the content-length of the entity-body had the request\n // been a GET.\n var isHeadResponse = req.method == 'HEAD';\n debug('AGENT isHeadResponse ' + isHeadResponse);\n\n if (res.statusCode == 100) {\n // restart the parser, as this is a continue message.\n delete req.res; // Clear res so that we don't hit double-responses.\n req.emit('continue');\n return true;\n }\n\n if (req.shouldKeepAlive && !shouldKeepAlive && !req.upgradeOrConnect) {\n // Server MUST respond with Connection:keep-alive for us to enable it.\n // If we've been upgraded (via WebSockets) we also shouldn't try to\n // keep the connection open.\n req.shouldKeepAlive = false;\n }\n\n\n DTRACE_HTTP_CLIENT_RESPONSE(socket, req);\n req.emit('response', res);\n req.res = res;\n res.req = req;\n\n res.on('end', responseOnEnd);\n\n return isHeadResponse;\n}\n\nfunction responseOnEnd() {\n var res = this;\n var req = res.req;\n var socket = req.socket;\n\n if (!req.shouldKeepAlive) {\n if (socket.writable) {\n debug('AGENT socket.destroySoon()');\n socket.destroySoon();\n }\n assert(!socket.writable);\n } else {\n debug('AGENT socket keep-alive');\n socket.removeListener('close', socketCloseListener);\n socket.removeListener('error', socketErrorListener);\n socket.emit('free');\n }\n}\n\nClientRequest.prototype.onSocket = function(socket) {\n var req = this;\n\n process.nextTick(function() {\n var parser = parsers.alloc();\n req.socket = socket;\n req.connection = socket;\n parser.reinitialize(HTTPParser.RESPONSE);\n parser.socket = socket;\n parser.incoming = null;\n req.parser = parser;\n\n parser.socket = socket;\n socket.parser = parser;\n parser.incoming = null;\n socket._httpMessage = req;\n\n // Setup \"drain\" propogation.\n httpSocketSetup(socket);\n\n // Propagate headers limit from request object to parser\n if (typeof req.maxHeadersCount === 'number') {\n parser.maxHeaderPairs = req.maxHeadersCount << 1;\n } else {\n // Set default value because parser may be reused from FreeList\n parser.maxHeaderPairs = 2000;\n }\n\n socket.on('error', socketErrorListener);\n socket.ondata = socketOnData;\n socket.onend = socketOnEnd;\n socket.on('close', socketCloseListener);\n parser.onIncoming = parserOnIncomingClient;\n req.emit('socket', socket);\n });\n\n};\n\nClientRequest.prototype._deferToConnect = function(method, arguments_, cb) {\n // This function is for calls that need to happen once the socket is\n // connected and writable. It's an important promisy thing for all the socket\n // calls that happen either now (when a socket is assigned) or\n // in the future (when a socket gets assigned out of the pool and is\n // eventually writable).\n var self = this;\n var onSocket = function() {\n if (self.socket.writable) {\n if (method) {\n self.socket[method].apply(self.socket, arguments_);\n }\n if (cb) { cb(); }\n } else {\n self.socket.once('connect', function() {\n if (method) {\n self.socket[method].apply(self.socket, arguments_);\n }\n if (cb) { cb(); }\n });\n }\n }\n if (!self.socket) {\n self.once('socket', onSocket);\n } else {\n onSocket();\n }\n};\n\nClientRequest.prototype.setTimeout = function(msecs, callback) {\n if (callback) this.once('timeout', callback);\n\n var self = this;\n function emitTimeout() {\n self.emit('timeout');\n }\n\n if (this.socket && this.socket.writable) {\n this.socket.setTimeout(msecs, emitTimeout);\n return;\n }\n\n if (this.socket) {\n this.socket.once('connect', function() {\n this.setTimeout(msecs, emitTimeout);\n });\n return;\n }\n\n this.once('socket', function(sock) {\n this.setTimeout(msecs, emitTimeout);\n });\n};\n\nClientRequest.prototype.setNoDelay = function() {\n this._deferToConnect('setNoDelay', arguments);\n};\nClientRequest.prototype.setSocketKeepAlive = function() {\n this._deferToConnect('setKeepAlive', arguments);\n};\n\nClientRequest.prototype.clearTimeout = function(cb) {\n this.setTimeout(0, cb);\n};\n\nexports.request = function(options, cb) {\n if (typeof options === 'string') {\n options = url.parse(options);\n }\n\n if (options.protocol && options.protocol !== 'http:') {\n throw new Error('Protocol:' + options.protocol + ' not supported.');\n }\n\n return new ClientRequest(options, cb);\n};\n\nexports.get = function(options, cb) {\n var req = exports.request(options, cb);\n req.end();\n return req;\n};\n\n\nfunction ondrain() {\n if (this._httpMessage) this._httpMessage.emit('drain');\n}\n\n\nfunction httpSocketSetup(socket) {\n socket.removeListener('drain', ondrain);\n socket.on('drain', ondrain);\n}\n\n\nfunction Server(requestListener) {\n if (!(this instanceof Server)) return new Server(requestListener);\n net.Server.call(this, { allowHalfOpen: true });\n\n if (requestListener) {\n this.addListener('request', requestListener);\n }\n\n // Similar option to this. Too lazy to write my own docs.\n // http://www.squid-cache.org/Doc/config/half_closed_clients/\n // http://wiki.squid-cache.org/SquidFaq/InnerWorkings#What_is_a_half-closed_filedescriptor.3F\n this.httpAllowHalfOpen = false;\n\n this.addListener('connection', connectionListener);\n}\nutil.inherits(Server, net.Server);\n\n\nexports.Server = Server;\n\n\nexports.createServer = function(requestListener) {\n return new Server(requestListener);\n};\n\n\nfunction connectionListener(socket) {\n var self = this;\n var outgoing = [];\n var incoming = [];\n\n function abortIncoming() {\n while (incoming.length) {\n var req = incoming.shift();\n req.emit('aborted');\n req.emit('close');\n }\n // abort socket._httpMessage ?\n }\n\n function serverSocketCloseListener() {\n debug('server socket close');\n // mark this parser as reusable\n freeParser(parser);\n\n abortIncoming();\n }\n\n debug('SERVER new http connection');\n\n httpSocketSetup(socket);\n\n socket.setTimeout(2 * 60 * 1000); // 2 minute timeout\n socket.once('timeout', function() {\n socket.destroy();\n });\n\n var parser = parsers.alloc();\n parser.reinitialize(HTTPParser.REQUEST);\n parser.socket = socket;\n socket.parser = parser;\n parser.incoming = null;\n\n // Propagate headers limit from server instance to parser\n if (typeof this.maxHeadersCount === 'number') {\n parser.maxHeaderPairs = this.maxHeadersCount << 1;\n } else {\n // Set default value because parser may be reused from FreeList\n parser.maxHeaderPairs = 2000;\n }\n\n socket.addListener('error', function(e) {\n self.emit('clientError', e);\n });\n\n socket.ondata = function(d, start, end) {\n var ret = parser.execute(d, start, end - start);\n if (ret instanceof Error) {\n debug('parse error');\n socket.destroy(ret);\n } else if (parser.incoming && parser.incoming.upgrade) {\n // Upgrade or CONNECT\n var bytesParsed = ret;\n var req = parser.incoming;\n\n socket.ondata = null;\n socket.onend = null;\n socket.removeListener('close', serverSocketCloseListener);\n parser.finish();\n freeParser(parser, req);\n\n // This is start + byteParsed\n var bodyHead = d.slice(start + bytesParsed, end);\n\n var eventName = req.method === 'CONNECT' ? 'connect' : 'upgrade';\n if (self.listeners(eventName).length) {\n self.emit(eventName, req, req.socket, bodyHead);\n } else {\n // Got upgrade header or CONNECT method, but have no handler.\n socket.destroy();\n }\n }\n };\n\n socket.onend = function() {\n var ret = parser.finish();\n\n if (ret instanceof Error) {\n debug('parse error');\n socket.destroy(ret);\n return;\n }\n\n if (!self.httpAllowHalfOpen) {\n abortIncoming();\n if (socket.writable) socket.end();\n } else if (outgoing.length) {\n outgoing[outgoing.length - 1]._last = true;\n } else if (socket._httpMessage) {\n socket._httpMessage._last = true;\n } else {\n if (socket.writable) socket.end();\n }\n };\n\n socket.addListener('close', serverSocketCloseListener);\n\n // The following callback is issued after the headers have been read on a\n // new message. In this callback we setup the response object and pass it\n // to the user.\n parser.onIncoming = function(req, shouldKeepAlive) {\n incoming.push(req);\n\n var res = new ServerResponse(req);\n debug('server response shouldKeepAlive: ' + shouldKeepAlive);\n res.shouldKeepAlive = shouldKeepAlive;\n DTRACE_HTTP_SERVER_REQUEST(req, socket);\n\n if (socket._httpMessage) {\n // There are already pending outgoing res, append.\n outgoing.push(res);\n } else {\n res.assignSocket(socket);\n }\n\n // When we're finished writing the response, check if this is the last\n // respose, if so destroy the socket.\n res.on('finish', function() {\n // Usually the first incoming element should be our request. it may\n // be that in the case abortIncoming() was called that the incoming\n // array will be empty.\n assert(incoming.length == 0 || incoming[0] === req);\n\n incoming.shift();\n\n res.detachSocket(socket);\n\n if (res._last) {\n socket.destroySoon();\n } else {\n // start sending the next message\n var m = outgoing.shift();\n if (m) {\n m.assignSocket(socket);\n }\n }\n });\n\n if ('expect' in req.headers &&\n (req.httpVersionMajor == 1 && req.httpVersionMinor == 1) &&\n continueExpression.test(req.headers['expect'])) {\n res._expect_continue = true;\n if (self.listeners('checkContinue').length) {\n self.emit('checkContinue', req, res);\n } else {\n res.writeContinue();\n self.emit('request', req, res);\n }\n } else {\n self.emit('request', req, res);\n }\n return false; // Not a HEAD response. (Not even a response!)\n };\n}\nexports._connectionListener = connectionListener;\n\n// Legacy Interface\n\nfunction Client(port, host) {\n if (!(this instanceof Client)) return new Client(port, host);\n host = host || 'localhost';\n port = port || 80;\n this.host = host;\n this.port = port;\n this.agent = new Agent({ host: host, port: port, maxSockets: 1 });\n}\nutil.inherits(Client, EventEmitter);\nClient.prototype.request = function(method, path, headers) {\n var self = this;\n var options = {};\n options.host = self.host;\n options.port = self.port;\n if (method[0] === '/') {\n headers = path;\n path = method;\n method = 'GET';\n }\n options.method = method;\n options.path = path;\n options.headers = headers;\n options.agent = self.agent;\n var c = new ClientRequest(options);\n c.on('error', function(e) {\n self.emit('error', e);\n });\n // The old Client interface emitted 'end' on socket end.\n // This doesn't map to how we want things to operate in the future\n // but it will get removed when we remove this legacy interface.\n c.on('socket', function(s) {\n s.on('end', function() {\n self.emit('end');\n });\n });\n return c;\n};\n\nexports.Client = Client;\n\n// TODO http.Client can be removed in v0.9. Until then leave this message.\nmodule.deprecate('Client', 'It will be removed soon. Do not use it.');\n\nexports.createClient = function(port, host) {\n return new Client(port, host);\n};\nmodule.deprecate('createClient', 'Use `http.request` instead.');\n" }, { "path": "src/test/resources/samples/langs/JavaScript/index.es", "content": "import config from \"../webpack.config\";\nimport webpackDevMiddleware from \"webpack-dev-middleware\";\nimport webpackHot from \"webpack-hot-middleware\";\nimport webpack from \"webpack\";\nimport express from \"express\";\n\napp.use(webpackDevMiddleware(compiler, {\n\tnoInfo: false,\n\tquiet: false,\n\tpublicPath: config.output.publicPath,\n\thot: true,\n\thistoryApiFallback: true\n}));\n\t\napp.get(\"/(:root).json\", (req, resp) => {\n\tresp.send(indexer.index(req.params.root));\n});\n\nexport default function(){\n\tconst server = http.createServer(app);\n\t\n\tserver.listen(3000);\n\t\n\tconst wss = new WebSocketServer({server});\n\t\n\tlet id = 1;\n\twss.on(\"connection\", (ws) => {\n\t\tconsole.log(\"Hello\", \" world\");\n\t\tlet wsId = id++;\n\t\tsessions[wsId] = ws;\n\t\tws.on(\"close\", () => {\n\t\t\tdelete sessions[wsId]\n\t\t});\n\t});\n};\n" }, { "path": "src/test/resources/samples/langs/JavaScript/intro-old.js", "content": "(function() {\n var cubes, list, math, num, number, opposite, race, square;\n var __slice = Array.prototype.slice;\n number = 42;\n opposite = true;\n if (opposite) {\n number = -42;\n }\n square = function(x) {\n return x * x;\n };\n list = [1, 2, 3, 4, 5];\n math = {\n root: Math.sqrt,\n square: square,\n cube: function(x) {\n return x * square(x);\n }\n };\n race = function() {\n var runners, winner;\n winner = arguments[0], runners = 2 <= arguments.length ? __slice.call(arguments, 1) : [];\n return print(winner, runners);\n };\n if (typeof elvis !== \"undefined\" && elvis !== null) {\n alert(\"I knew it!\");\n }\n cubes = (function() {\n var _i, _len, _results;\n _results = [];\n for (_i = 0, _len = list.length; _i < _len; _i++) {\n num = list[_i];\n _results.push(math.cube(num));\n }\n return _results;\n })();\n}).call(this);\n" }, { "path": "src/test/resources/samples/langs/JavaScript/intro.js", "content": "// Generated by CoffeeScript 1.2.1\n(function() {\n var cubes, list, math, num, number, opposite, race, square,\n __slice = [].slice;\n\n number = 42;\n\n opposite = true;\n\n if (opposite) number = -42;\n\n square = function(x) {\n return x * x;\n };\n\n list = [1, 2, 3, 4, 5];\n\n math = {\n root: Math.sqrt,\n square: square,\n cube: function(x) {\n return x * square(x);\n }\n };\n\n race = function() {\n var runners, winner;\n winner = arguments[0], runners = 2 <= arguments.length ? __slice.call(arguments, 1) : [];\n return print(winner, runners);\n };\n\n if (typeof elvis !== \"undefined\" && elvis !== null) alert(\"I knew it!\");\n\n cubes = (function() {\n var _i, _len, _results;\n _results = [];\n for (_i = 0, _len = list.length; _i < _len; _i++) {\n num = list[_i];\n _results.push(math.cube(num));\n }\n return _results;\n })();\n\n}).call(this);\n" }, { "path": "src/test/resources/samples/langs/JavaScript/intro.js.frag", "content": "(function(window, angular) {\n\nArray.prototype.last = function() {\n return this[this.length-1];\n};\n\nvar app = angular.module('ConwayGameOfLife', []);\n" }, { "path": "src/test/resources/samples/langs/JavaScript/itau.gs", "content": "/*\nThe MIT License (MIT)\n\nCopyright (c) 2014 Thiago Brandão Damasceno\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// based on http://ctrlq.org/code/19053-send-to-google-drive\nfunction sendToGoogleDrive() {\n\n var gmailLabels = 'inbox';\n var driveFolder = 'Itaú Notifications';\n var spreadsheetName = 'itau';\n var archiveLabel = 'itau.processed';\n var itauNotificationEmail = 'comunicacaodigital@itau-unibanco.com.br';\n var filter = \"from: \" +\n itauNotificationEmail +\n \" -label:\" +\n archiveLabel +\n \" label:\" +\n gmailLabels;\n\n // Create label for 'itau.processed' if it doesn't exist\n var moveToLabel = GmailApp.getUserLabelByName(archiveLabel);\n\n if (!moveToLabel) {\n moveToLabel = GmailApp.createLabel(archiveLabel);\n }\n\n // Create folder 'Itaú Notifications' if it doesn't exist\n var folders = DriveApp.getFoldersByName(driveFolder);\n var folder;\n\n if (folders.hasNext()) {\n folder = folders.next();\n } else {\n folder = DriveApp.createFolder(driveFolder);\n }\n\n // Create spreadsheet file 'itau' if it doesn't exist\n var files = folder.getFilesByName(spreadsheetName);\n\n // File is in DriveApp\n // Doc is in SpreadsheetApp\n // They are not interchangeable\n var file, doc;\n\n // Confusing :\\\n // As per: https://code.google.com/p/google-apps-script-issues/issues/detail?id=3578\n if (files.hasNext()){\n file = files.next();\n doc = SpreadsheetApp.openById(file.getId());\n } else {\n doc = SpreadsheetApp.create(spreadsheetName);\n file = DriveApp.getFileById(doc.getId());\n folder.addFile(file);\n DriveApp.removeFile(file);\n }\n\n var sheet = doc.getSheets()[0];\n\n // Append header if first line\n if(sheet.getLastRow() == 0){\n sheet.appendRow(['Conta', 'Operação', 'Valor', 'Data', 'Hora', 'Email ID']);\n }\n\n var message, messages, account, operation, value, date, hour, emailID, plainBody;\n var accountRegex = /Conta: (XXX[0-9\\-]+)/;\n var operationRegex = /Tipo de operação: ([A-Z]+)/;\n var paymentRegex = /Pagamento de ([0-9A-Za-z\\-]+)\\ ?([0-9]+)?/;\n var valueRegex = /Valor: R\\$ ([0-9\\,\\.]+)/;\n var dateRegex = /Data: ([0-9\\/]+)/;\n var hourRegex = /Hora: ([0-9\\:]+)/;\n var emailIDRegex = /E-mail nº ([0-9]+)/;\n\n var threads = GmailApp.search(filter, 0, 100);\n\n for (var x = 0; x < threads.length; x++) {\n messages = threads[x].getMessages();\n\n for (var i = 0; i < messages.length; i++) {\n account, operation, value, date, hour, emailID = [];\n\n message = messages[i];\n\n plainBody = message.getPlainBody();\n\n if(accountRegex.test(plainBody)) {\n account = RegExp.$1;\n }\n\n if(operationRegex.test(plainBody)) {\n operation = RegExp.$1;\n }\n\n if(valueRegex.test(plainBody)) {\n value = RegExp.$1;\n }\n\n if(dateRegex.test(plainBody)) {\n date = RegExp.$1;\n }\n\n if(hourRegex.test(plainBody)) {\n hour = RegExp.$1;\n }\n\n if(emailIDRegex.test(plainBody)){\n emailID = RegExp.$1;\n }\n\n if(paymentRegex.test(plainBody)){\n operation = RegExp.$1;\n if(RegExp.$2){\n operation += ' ' + RegExp.$2\n }\n date = hour = ' - ';\n }\n\n if(account && operation && value && date && hour){\n sheet.appendRow([account, operation, value, date, hour, emailID]);\n }\n\n // Logger.log(account);\n // Logger.log(operation);\n // Logger.log(value);\n // Logger.log(date);\n // Logger.log(hour);\n }\n\n threads[x].addLabel(moveToLabel);\n }\n}\n" }, { "path": "src/test/resources/samples/langs/JavaScript/jquery-1.6.1.js", "content": "/*!\n * jQuery JavaScript Library v1.6.1\n * http://jquery.com/\n *\n * Copyright 2011, John Resig\n * Dual licensed under the MIT or GPL Version 2 licenses.\n * http://jquery.org/license\n *\n * Includes Sizzle.js\n * http://sizzlejs.com/\n * Copyright 2011, The Dojo Foundation\n * Released under the MIT, BSD, and GPL Licenses.\n *\n * Date: Thu May 12 15:04:36 2011 -0400\n */\n(function( window, undefined ) {\n\n// Use the correct document accordingly with window argument (sandbox)\nvar document = window.document,\n\tnavigator = window.navigator,\n\tlocation = window.location;\nvar jQuery = (function() {\n\n// Define a local copy of jQuery\nvar jQuery = function( selector, context ) {\n\t\t// The jQuery object is actually just the init constructor 'enhanced'\n\t\treturn new jQuery.fn.init( selector, context, rootjQuery );\n\t},\n\n\t// Map over jQuery in case of overwrite\n\t_jQuery = window.jQuery,\n\n\t// Map over the $ in case of overwrite\n\t_$ = window.$,\n\n\t// A central reference to the root jQuery(document)\n\trootjQuery,\n\n\t// A simple way to check for HTML strings or ID strings\n\t// (both of which we optimize for)\n\tquickExpr = /^(?:[^<]*(<[\\w\\W]+>)[^>]*$|#([\\w\\-]*)$)/,\n\n\t// Check if a string has a non-whitespace character in it\n\trnotwhite = /\\S/,\n\n\t// Used for trimming whitespace\n\ttrimLeft = /^\\s+/,\n\ttrimRight = /\\s+$/,\n\n\t// Check for digits\n\trdigit = /\\d/,\n\n\t// Match a standalone tag\n\trsingleTag = /^<(\\w+)\\s*\\/?>(?:<\\/\\1>)?$/,\n\n\t// JSON RegExp\n\trvalidchars = /^[\\],:{}\\s]*$/,\n\trvalidescape = /\\\\(?:[\"\\\\\\/bfnrt]|u[0-9a-fA-F]{4})/g,\n\trvalidtokens = /\"[^\"\\\\\\n\\r]*\"|true|false|null|-?\\d+(?:\\.\\d*)?(?:[eE][+\\-]?\\d+)?/g,\n\trvalidbraces = /(?:^|:|,)(?:\\s*\\[)+/g,\n\n\t// Useragent RegExp\n\trwebkit = /(webkit)[ \\/]([\\w.]+)/,\n\tropera = /(opera)(?:.*version)?[ \\/]([\\w.]+)/,\n\trmsie = /(msie) ([\\w.]+)/,\n\trmozilla = /(mozilla)(?:.*? rv:([\\w.]+))?/,\n\n\t// Keep a UserAgent string for use with jQuery.browser\n\tuserAgent = navigator.userAgent,\n\n\t// For matching the engine and version of the browser\n\tbrowserMatch,\n\n\t// The deferred used on DOM ready\n\treadyList,\n\n\t// The ready event handler\n\tDOMContentLoaded,\n\n\t// Save a reference to some core methods\n\ttoString = Object.prototype.toString,\n\thasOwn = Object.prototype.hasOwnProperty,\n\tpush = Array.prototype.push,\n\tslice = Array.prototype.slice,\n\ttrim = String.prototype.trim,\n\tindexOf = Array.prototype.indexOf,\n\n\t// [[Class]] -> type pairs\n\tclass2type = {};\n\njQuery.fn = jQuery.prototype = {\n\tconstructor: jQuery,\n\tinit: function( selector, context, rootjQuery ) {\n\t\tvar match, elem, ret, doc;\n\n\t\t// Handle $(\"\"), $(null), or $(undefined)\n\t\tif ( !selector ) {\n\t\t\treturn this;\n\t\t}\n\n\t\t// Handle $(DOMElement)\n\t\tif ( selector.nodeType ) {\n\t\t\tthis.context = this[0] = selector;\n\t\t\tthis.length = 1;\n\t\t\treturn this;\n\t\t}\n\n\t\t// The body element only exists once, optimize finding it\n\t\tif ( selector === \"body\" && !context && document.body ) {\n\t\t\tthis.context = document;\n\t\t\tthis[0] = document.body;\n\t\t\tthis.selector = selector;\n\t\t\tthis.length = 1;\n\t\t\treturn this;\n\t\t}\n\n\t\t// Handle HTML strings\n\t\tif ( typeof selector === \"string\" ) {\n\t\t\t// Are we dealing with HTML string or an ID?\n\t\t\tif ( selector.charAt(0) === \"<\" && selector.charAt( selector.length - 1 ) === \">\" && selector.length >= 3 ) {\n\t\t\t\t// Assume that strings that start and end with <> are HTML and skip the regex check\n\t\t\t\tmatch = [ null, selector, null ];\n\n\t\t\t} else {\n\t\t\t\tmatch = quickExpr.exec( selector );\n\t\t\t}\n\n\t\t\t// Verify a match, and that no context was specified for #id\n\t\t\tif ( match && (match[1] || !context) ) {\n\n\t\t\t\t// HANDLE: $(html) -> $(array)\n\t\t\t\tif ( match[1] ) {\n\t\t\t\t\tcontext = context instanceof jQuery ? context[0] : context;\n\t\t\t\t\tdoc = (context ? context.ownerDocument || context : document);\n\n\t\t\t\t\t// If a single string is passed in and it's a single tag\n\t\t\t\t\t// just do a createElement and skip the rest\n\t\t\t\t\tret = rsingleTag.exec( selector );\n\n\t\t\t\t\tif ( ret ) {\n\t\t\t\t\t\tif ( jQuery.isPlainObject( context ) ) {\n\t\t\t\t\t\t\tselector = [ document.createElement( ret[1] ) ];\n\t\t\t\t\t\t\tjQuery.fn.attr.call( selector, context, true );\n\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tselector = [ doc.createElement( ret[1] ) ];\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} else {\n\t\t\t\t\t\tret = jQuery.buildFragment( [ match[1] ], [ doc ] );\n\t\t\t\t\t\tselector = (ret.cacheable ? jQuery.clone(ret.fragment) : ret.fragment).childNodes;\n\t\t\t\t\t}\n\n\t\t\t\t\treturn jQuery.merge( this, selector );\n\n\t\t\t\t// HANDLE: $(\"#id\")\n\t\t\t\t} else {\n\t\t\t\t\telem = document.getElementById( match[2] );\n\n\t\t\t\t\t// Check parentNode to catch when Blackberry 4.6 returns\n\t\t\t\t\t// nodes that are no longer in the document #6963\n\t\t\t\t\tif ( elem && elem.parentNode ) {\n\t\t\t\t\t\t// Handle the case where IE and Opera return items\n\t\t\t\t\t\t// by name instead of ID\n\t\t\t\t\t\tif ( elem.id !== match[2] ) {\n\t\t\t\t\t\t\treturn rootjQuery.find( selector );\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Otherwise, we inject the element directly into the jQuery object\n\t\t\t\t\t\tthis.length = 1;\n\t\t\t\t\t\tthis[0] = elem;\n\t\t\t\t\t}\n\n\t\t\t\t\tthis.context = document;\n\t\t\t\t\tthis.selector = selector;\n\t\t\t\t\treturn this;\n\t\t\t\t}\n\n\t\t\t// HANDLE: $(expr, $(...))\n\t\t\t} else if ( !context || context.jquery ) {\n\t\t\t\treturn (context || rootjQuery).find( selector );\n\n\t\t\t// HANDLE: $(expr, context)\n\t\t\t// (which is just equivalent to: $(context).find(expr)\n\t\t\t} else {\n\t\t\t\treturn this.constructor( context ).find( selector );\n\t\t\t}\n\n\t\t// HANDLE: $(function)\n\t\t// Shortcut for document ready\n\t\t} else if ( jQuery.isFunction( selector ) ) {\n\t\t\treturn rootjQuery.ready( selector );\n\t\t}\n\n\t\tif (selector.selector !== undefined) {\n\t\t\tthis.selector = selector.selector;\n\t\t\tthis.context = selector.context;\n\t\t}\n\n\t\treturn jQuery.makeArray( selector, this );\n\t},\n\n\t// Start with an empty selector\n\tselector: \"\",\n\n\t// The current version of jQuery being used\n\tjquery: \"1.6.1\",\n\n\t// The default length of a jQuery object is 0\n\tlength: 0,\n\n\t// The number of elements contained in the matched element set\n\tsize: function() {\n\t\treturn this.length;\n\t},\n\n\ttoArray: function() {\n\t\treturn slice.call( this, 0 );\n\t},\n\n\t// Get the Nth element in the matched element set OR\n\t// Get the whole matched element set as a clean array\n\tget: function( num ) {\n\t\treturn num == null ?\n\n\t\t\t// Return a 'clean' array\n\t\t\tthis.toArray() :\n\n\t\t\t// Return just the object\n\t\t\t( num < 0 ? this[ this.length + num ] : this[ num ] );\n\t},\n\n\t// Take an array of elements and push it onto the stack\n\t// (returning the new matched element set)\n\tpushStack: function( elems, name, selector ) {\n\t\t// Build a new jQuery matched element set\n\t\tvar ret = this.constructor();\n\n\t\tif ( jQuery.isArray( elems ) ) {\n\t\t\tpush.apply( ret, elems );\n\n\t\t} else {\n\t\t\tjQuery.merge( ret, elems );\n\t\t}\n\n\t\t// Add the old object onto the stack (as a reference)\n\t\tret.prevObject = this;\n\n\t\tret.context = this.context;\n\n\t\tif ( name === \"find\" ) {\n\t\t\tret.selector = this.selector + (this.selector ? \" \" : \"\") + selector;\n\t\t} else if ( name ) {\n\t\t\tret.selector = this.selector + \".\" + name + \"(\" + selector + \")\";\n\t\t}\n\n\t\t// Return the newly-formed element set\n\t\treturn ret;\n\t},\n\n\t// Execute a callback for every element in the matched set.\n\t// (You can seed the arguments with an array of args, but this is\n\t// only used internally.)\n\teach: function( callback, args ) {\n\t\treturn jQuery.each( this, callback, args );\n\t},\n\n\tready: function( fn ) {\n\t\t// Attach the listeners\n\t\tjQuery.bindReady();\n\n\t\t// Add the callback\n\t\treadyList.done( fn );\n\n\t\treturn this;\n\t},\n\n\teq: function( i ) {\n\t\treturn i === -1 ?\n\t\t\tthis.slice( i ) :\n\t\t\tthis.slice( i, +i + 1 );\n\t},\n\n\tfirst: function() {\n\t\treturn this.eq( 0 );\n\t},\n\n\tlast: function() {\n\t\treturn this.eq( -1 );\n\t},\n\n\tslice: function() {\n\t\treturn this.pushStack( slice.apply( this, arguments ),\n\t\t\t\"slice\", slice.call(arguments).join(\",\") );\n\t},\n\n\tmap: function( callback ) {\n\t\treturn this.pushStack( jQuery.map(this, function( elem, i ) {\n\t\t\treturn callback.call( elem, i, elem );\n\t\t}));\n\t},\n\n\tend: function() {\n\t\treturn this.prevObject || this.constructor(null);\n\t},\n\n\t// For internal use only.\n\t// Behaves like an Array's method, not like a jQuery method.\n\tpush: push,\n\tsort: [].sort,\n\tsplice: [].splice\n};\n\n// Give the init function the jQuery prototype for later instantiation\njQuery.fn.init.prototype = jQuery.fn;\n\njQuery.extend = jQuery.fn.extend = function() {\n\tvar options, name, src, copy, copyIsArray, clone,\n\t\ttarget = arguments[0] || {},\n\t\ti = 1,\n\t\tlength = arguments.length,\n\t\tdeep = false;\n\n\t// Handle a deep copy situation\n\tif ( typeof target === \"boolean\" ) {\n\t\tdeep = target;\n\t\ttarget = arguments[1] || {};\n\t\t// skip the boolean and the target\n\t\ti = 2;\n\t}\n\n\t// Handle case when target is a string or something (possible in deep copy)\n\tif ( typeof target !== \"object\" && !jQuery.isFunction(target) ) {\n\t\ttarget = {};\n\t}\n\n\t// extend jQuery itself if only one argument is passed\n\tif ( length === i ) {\n\t\ttarget = this;\n\t\t--i;\n\t}\n\n\tfor ( ; i < length; i++ ) {\n\t\t// Only deal with non-null/undefined values\n\t\tif ( (options = arguments[ i ]) != null ) {\n\t\t\t// Extend the base object\n\t\t\tfor ( name in options ) {\n\t\t\t\tsrc = target[ name ];\n\t\t\t\tcopy = options[ name ];\n\n\t\t\t\t// Prevent never-ending loop\n\t\t\t\tif ( target === copy ) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\t// Recurse if we're merging plain objects or arrays\n\t\t\t\tif ( deep && copy && ( jQuery.isPlainObject(copy) || (copyIsArray = jQuery.isArray(copy)) ) ) {\n\t\t\t\t\tif ( copyIsArray ) {\n\t\t\t\t\t\tcopyIsArray = false;\n\t\t\t\t\t\tclone = src && jQuery.isArray(src) ? src : [];\n\n\t\t\t\t\t} else {\n\t\t\t\t\t\tclone = src && jQuery.isPlainObject(src) ? src : {};\n\t\t\t\t\t}\n\n\t\t\t\t\t// Never move original objects, clone them\n\t\t\t\t\ttarget[ name ] = jQuery.extend( deep, clone, copy );\n\n\t\t\t\t// Don't bring in undefined values\n\t\t\t\t} else if ( copy !== undefined ) {\n\t\t\t\t\ttarget[ name ] = copy;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Return the modified object\n\treturn target;\n};\n\njQuery.extend({\n\tnoConflict: function( deep ) {\n\t\tif ( window.$ === jQuery ) {\n\t\t\twindow.$ = _$;\n\t\t}\n\n\t\tif ( deep && window.jQuery === jQuery ) {\n\t\t\twindow.jQuery = _jQuery;\n\t\t}\n\n\t\treturn jQuery;\n\t},\n\n\t// Is the DOM ready to be used? Set to true once it occurs.\n\tisReady: false,\n\n\t// A counter to track how many items to wait for before\n\t// the ready event fires. See #6781\n\treadyWait: 1,\n\n\t// Hold (or release) the ready event\n\tholdReady: function( hold ) {\n\t\tif ( hold ) {\n\t\t\tjQuery.readyWait++;\n\t\t} else {\n\t\t\tjQuery.ready( true );\n\t\t}\n\t},\n\n\t// Handle when the DOM is ready\n\tready: function( wait ) {\n\t\t// Either a released hold or an DOMready/load event and not yet ready\n\t\tif ( (wait === true && !--jQuery.readyWait) || (wait !== true && !jQuery.isReady) ) {\n\t\t\t// Make sure body exists, at least, in case IE gets a little overzealous (ticket #5443).\n\t\t\tif ( !document.body ) {\n\t\t\t\treturn setTimeout( jQuery.ready, 1 );\n\t\t\t}\n\n\t\t\t// Remember that the DOM is ready\n\t\t\tjQuery.isReady = true;\n\n\t\t\t// If a normal DOM Ready event fired, decrement, and wait if need be\n\t\t\tif ( wait !== true && --jQuery.readyWait > 0 ) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t// If there are functions bound, to execute\n\t\t\treadyList.resolveWith( document, [ jQuery ] );\n\n\t\t\t// Trigger any bound ready events\n\t\t\tif ( jQuery.fn.trigger ) {\n\t\t\t\tjQuery( document ).trigger( \"ready\" ).unbind( \"ready\" );\n\t\t\t}\n\t\t}\n\t},\n\n\tbindReady: function() {\n\t\tif ( readyList ) {\n\t\t\treturn;\n\t\t}\n\n\t\treadyList = jQuery._Deferred();\n\n\t\t// Catch cases where $(document).ready() is called after the\n\t\t// browser event has already occurred.\n\t\tif ( document.readyState === \"complete\" ) {\n\t\t\t// Handle it asynchronously to allow scripts the opportunity to delay ready\n\t\t\treturn setTimeout( jQuery.ready, 1 );\n\t\t}\n\n\t\t// Mozilla, Opera and webkit nightlies currently support this event\n\t\tif ( document.addEventListener ) {\n\t\t\t// Use the handy event callback\n\t\t\tdocument.addEventListener( \"DOMContentLoaded\", DOMContentLoaded, false );\n\n\t\t\t// A fallback to window.onload, that will always work\n\t\t\twindow.addEventListener( \"load\", jQuery.ready, false );\n\n\t\t// If IE event model is used\n\t\t} else if ( document.attachEvent ) {\n\t\t\t// ensure firing before onload,\n\t\t\t// maybe late but safe also for iframes\n\t\t\tdocument.attachEvent( \"onreadystatechange\", DOMContentLoaded );\n\n\t\t\t// A fallback to window.onload, that will always work\n\t\t\twindow.attachEvent( \"onload\", jQuery.ready );\n\n\t\t\t// If IE and not a frame\n\t\t\t// continually check to see if the document is ready\n\t\t\tvar toplevel = false;\n\n\t\t\ttry {\n\t\t\t\ttoplevel = window.frameElement == null;\n\t\t\t} catch(e) {}\n\n\t\t\tif ( document.documentElement.doScroll && toplevel ) {\n\t\t\t\tdoScrollCheck();\n\t\t\t}\n\t\t}\n\t},\n\n\t// See test/unit/core.js for details concerning isFunction.\n\t// Since version 1.3, DOM methods and functions like alert\n\t// aren't supported. They return false on IE (#2968).\n\tisFunction: function( obj ) {\n\t\treturn jQuery.type(obj) === \"function\";\n\t},\n\n\tisArray: Array.isArray || function( obj ) {\n\t\treturn jQuery.type(obj) === \"array\";\n\t},\n\n\t// A crude way of determining if an object is a window\n\tisWindow: function( obj ) {\n\t\treturn obj && typeof obj === \"object\" && \"setInterval\" in obj;\n\t},\n\n\tisNaN: function( obj ) {\n\t\treturn obj == null || !rdigit.test( obj ) || isNaN( obj );\n\t},\n\n\ttype: function( obj ) {\n\t\treturn obj == null ?\n\t\t\tString( obj ) :\n\t\t\tclass2type[ toString.call(obj) ] || \"object\";\n\t},\n\n\tisPlainObject: function( obj ) {\n\t\t// Must be an Object.\n\t\t// Because of IE, we also have to check the presence of the constructor property.\n\t\t// Make sure that DOM nodes and window objects don't pass through, as well\n\t\tif ( !obj || jQuery.type(obj) !== \"object\" || obj.nodeType || jQuery.isWindow( obj ) ) {\n\t\t\treturn false;\n\t\t}\n\n\t\t// Not own constructor property must be Object\n\t\tif ( obj.constructor &&\n\t\t\t!hasOwn.call(obj, \"constructor\") &&\n\t\t\t!hasOwn.call(obj.constructor.prototype, \"isPrototypeOf\") ) {\n\t\t\treturn false;\n\t\t}\n\n\t\t// Own properties are enumerated firstly, so to speed up,\n\t\t// if last one is own, then all properties are own.\n\n\t\tvar key;\n\t\tfor ( key in obj ) {}\n\n\t\treturn key === undefined || hasOwn.call( obj, key );\n\t},\n\n\tisEmptyObject: function( obj ) {\n\t\tfor ( var name in obj ) {\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t},\n\n\terror: function( msg ) {\n\t\tthrow msg;\n\t},\n\n\tparseJSON: function( data ) {\n\t\tif ( typeof data !== \"string\" || !data ) {\n\t\t\treturn null;\n\t\t}\n\n\t\t// Make sure leading/trailing whitespace is removed (IE can't handle it)\n\t\tdata = jQuery.trim( data );\n\n\t\t// Attempt to parse using the native JSON parser first\n\t\tif ( window.JSON && window.JSON.parse ) {\n\t\t\treturn window.JSON.parse( data );\n\t\t}\n\n\t\t// Make sure the incoming data is actual JSON\n\t\t// Logic borrowed from http://json.org/json2.js\n\t\tif ( rvalidchars.test( data.replace( rvalidescape, \"@\" )\n\t\t\t.replace( rvalidtokens, \"]\" )\n\t\t\t.replace( rvalidbraces, \"\")) ) {\n\n\t\t\treturn (new Function( \"return \" + data ))();\n\n\t\t}\n\t\tjQuery.error( \"Invalid JSON: \" + data );\n\t},\n\n\t// Cross-browser xml parsing\n\t// (xml & tmp used internally)\n\tparseXML: function( data , xml , tmp ) {\n\n\t\tif ( window.DOMParser ) { // Standard\n\t\t\ttmp = new DOMParser();\n\t\t\txml = tmp.parseFromString( data , \"text/xml\" );\n\t\t} else { // IE\n\t\t\txml = new ActiveXObject( \"Microsoft.XMLDOM\" );\n\t\t\txml.async = \"false\";\n\t\t\txml.loadXML( data );\n\t\t}\n\n\t\ttmp = xml.documentElement;\n\n\t\tif ( ! tmp || ! tmp.nodeName || tmp.nodeName === \"parsererror\" ) {\n\t\t\tjQuery.error( \"Invalid XML: \" + data );\n\t\t}\n\n\t\treturn xml;\n\t},\n\n\tnoop: function() {},\n\n\t// Evaluates a script in a global context\n\t// Workarounds based on findings by Jim Driscoll\n\t// http://weblogs.java.net/blog/driscoll/archive/2009/09/08/eval-javascript-global-context\n\tglobalEval: function( data ) {\n\t\tif ( data && rnotwhite.test( data ) ) {\n\t\t\t// We use execScript on Internet Explorer\n\t\t\t// We use an anonymous function so that context is window\n\t\t\t// rather than jQuery in Firefox\n\t\t\t( window.execScript || function( data ) {\n\t\t\t\twindow[ \"eval\" ].call( window, data );\n\t\t\t} )( data );\n\t\t}\n\t},\n\n\tnodeName: function( elem, name ) {\n\t\treturn elem.nodeName && elem.nodeName.toUpperCase() === name.toUpperCase();\n\t},\n\n\t// args is for internal usage only\n\teach: function( object, callback, args ) {\n\t\tvar name, i = 0,\n\t\t\tlength = object.length,\n\t\t\tisObj = length === undefined || jQuery.isFunction( object );\n\n\t\tif ( args ) {\n\t\t\tif ( isObj ) {\n\t\t\t\tfor ( name in object ) {\n\t\t\t\t\tif ( callback.apply( object[ name ], args ) === false ) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tfor ( ; i < length; ) {\n\t\t\t\t\tif ( callback.apply( object[ i++ ], args ) === false ) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t// A special, fast, case for the most common use of each\n\t\t} else {\n\t\t\tif ( isObj ) {\n\t\t\t\tfor ( name in object ) {\n\t\t\t\t\tif ( callback.call( object[ name ], name, object[ name ] ) === false ) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tfor ( ; i < length; ) {\n\t\t\t\t\tif ( callback.call( object[ i ], i, object[ i++ ] ) === false ) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn object;\n\t},\n\n\t// Use native String.trim function wherever possible\n\ttrim: trim ?\n\t\tfunction( text ) {\n\t\t\treturn text == null ?\n\t\t\t\t\"\" :\n\t\t\t\ttrim.call( text );\n\t\t} :\n\n\t\t// Otherwise use our own trimming functionality\n\t\tfunction( text ) {\n\t\t\treturn text == null ?\n\t\t\t\t\"\" :\n\t\t\t\ttext.toString().replace( trimLeft, \"\" ).replace( trimRight, \"\" );\n\t\t},\n\n\t// results is for internal usage only\n\tmakeArray: function( array, results ) {\n\t\tvar ret = results || [];\n\n\t\tif ( array != null ) {\n\t\t\t// The window, strings (and functions) also have 'length'\n\t\t\t// The extra typeof function check is to prevent crashes\n\t\t\t// in Safari 2 (See: #3039)\n\t\t\t// Tweaked logic slightly to handle Blackberry 4.7 RegExp issues #6930\n\t\t\tvar type = jQuery.type( array );\n\n\t\t\tif ( array.length == null || type === \"string\" || type === \"function\" || type === \"regexp\" || jQuery.isWindow( array ) ) {\n\t\t\t\tpush.call( ret, array );\n\t\t\t} else {\n\t\t\t\tjQuery.merge( ret, array );\n\t\t\t}\n\t\t}\n\n\t\treturn ret;\n\t},\n\n\tinArray: function( elem, array ) {\n\n\t\tif ( indexOf ) {\n\t\t\treturn indexOf.call( array, elem );\n\t\t}\n\n\t\tfor ( var i = 0, length = array.length; i < length; i++ ) {\n\t\t\tif ( array[ i ] === elem ) {\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\n\t\treturn -1;\n\t},\n\n\tmerge: function( first, second ) {\n\t\tvar i = first.length,\n\t\t\tj = 0;\n\n\t\tif ( typeof second.length === \"number\" ) {\n\t\t\tfor ( var l = second.length; j < l; j++ ) {\n\t\t\t\tfirst[ i++ ] = second[ j ];\n\t\t\t}\n\n\t\t} else {\n\t\t\twhile ( second[j] !== undefined ) {\n\t\t\t\tfirst[ i++ ] = second[ j++ ];\n\t\t\t}\n\t\t}\n\n\t\tfirst.length = i;\n\n\t\treturn first;\n\t},\n\n\tgrep: function( elems, callback, inv ) {\n\t\tvar ret = [], retVal;\n\t\tinv = !!inv;\n\n\t\t// Go through the array, only saving the items\n\t\t// that pass the validator function\n\t\tfor ( var i = 0, length = elems.length; i < length; i++ ) {\n\t\t\tretVal = !!callback( elems[ i ], i );\n\t\t\tif ( inv !== retVal ) {\n\t\t\t\tret.push( elems[ i ] );\n\t\t\t}\n\t\t}\n\n\t\treturn ret;\n\t},\n\n\t// arg is for internal usage only\n\tmap: function( elems, callback, arg ) {\n\t\tvar value, key, ret = [],\n\t\t\ti = 0,\n\t\t\tlength = elems.length,\n\t\t\t// jquery objects are treated as arrays\n\t\t\tisArray = elems instanceof jQuery || length !== undefined && typeof length === \"number\" && ( ( length > 0 && elems[ 0 ] && elems[ length -1 ] ) || length === 0 || jQuery.isArray( elems ) ) ;\n\n\t\t// Go through the array, translating each of the items to their\n\t\tif ( isArray ) {\n\t\t\tfor ( ; i < length; i++ ) {\n\t\t\t\tvalue = callback( elems[ i ], i, arg );\n\n\t\t\t\tif ( value != null ) {\n\t\t\t\t\tret[ ret.length ] = value;\n\t\t\t\t}\n\t\t\t}\n\n\t\t// Go through every key on the object,\n\t\t} else {\n\t\t\tfor ( key in elems ) {\n\t\t\t\tvalue = callback( elems[ key ], key, arg );\n\n\t\t\t\tif ( value != null ) {\n\t\t\t\t\tret[ ret.length ] = value;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Flatten any nested arrays\n\t\treturn ret.concat.apply( [], ret );\n\t},\n\n\t// A global GUID counter for objects\n\tguid: 1,\n\n\t// Bind a function to a context, optionally partially applying any\n\t// arguments.\n\tproxy: function( fn, context ) {\n\t\tif ( typeof context === \"string\" ) {\n\t\t\tvar tmp = fn[ context ];\n\t\t\tcontext = fn;\n\t\t\tfn = tmp;\n\t\t}\n\n\t\t// Quick check to determine if target is callable, in the spec\n\t\t// this throws a TypeError, but we will just return undefined.\n\t\tif ( !jQuery.isFunction( fn ) ) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\t// Simulated bind\n\t\tvar args = slice.call( arguments, 2 ),\n\t\t\tproxy = function() {\n\t\t\t\treturn fn.apply( context, args.concat( slice.call( arguments ) ) );\n\t\t\t};\n\n\t\t// Set the guid of unique handler to the same of original handler, so it can be removed\n\t\tproxy.guid = fn.guid = fn.guid || proxy.guid || jQuery.guid++;\n\n\t\treturn proxy;\n\t},\n\n\t// Mutifunctional method to get and set values to a collection\n\t// The value/s can be optionally by executed if its a function\n\taccess: function( elems, key, value, exec, fn, pass ) {\n\t\tvar length = elems.length;\n\n\t\t// Setting many attributes\n\t\tif ( typeof key === \"object\" ) {\n\t\t\tfor ( var k in key ) {\n\t\t\t\tjQuery.access( elems, k, key[k], exec, fn, value );\n\t\t\t}\n\t\t\treturn elems;\n\t\t}\n\n\t\t// Setting one attribute\n\t\tif ( value !== undefined ) {\n\t\t\t// Optionally, function values get executed if exec is true\n\t\t\texec = !pass && exec && jQuery.isFunction(value);\n\n\t\t\tfor ( var i = 0; i < length; i++ ) {\n\t\t\t\tfn( elems[i], key, exec ? value.call( elems[i], i, fn( elems[i], key ) ) : value, pass );\n\t\t\t}\n\n\t\t\treturn elems;\n\t\t}\n\n\t\t// Getting an attribute\n\t\treturn length ? fn( elems[0], key ) : undefined;\n\t},\n\n\tnow: function() {\n\t\treturn (new Date()).getTime();\n\t},\n\n\t// Use of jQuery.browser is frowned upon.\n\t// More details: http://docs.jquery.com/Utilities/jQuery.browser\n\tuaMatch: function( ua ) {\n\t\tua = ua.toLowerCase();\n\n\t\tvar match = rwebkit.exec( ua ) ||\n\t\t\tropera.exec( ua ) ||\n\t\t\trmsie.exec( ua ) ||\n\t\t\tua.indexOf(\"compatible\") < 0 && rmozilla.exec( ua ) ||\n\t\t\t[];\n\n\t\treturn { browser: match[1] || \"\", version: match[2] || \"0\" };\n\t},\n\n\tsub: function() {\n\t\tfunction jQuerySub( selector, context ) {\n\t\t\treturn new jQuerySub.fn.init( selector, context );\n\t\t}\n\t\tjQuery.extend( true, jQuerySub, this );\n\t\tjQuerySub.superclass = this;\n\t\tjQuerySub.fn = jQuerySub.prototype = this();\n\t\tjQuerySub.fn.constructor = jQuerySub;\n\t\tjQuerySub.sub = this.sub;\n\t\tjQuerySub.fn.init = function init( selector, context ) {\n\t\t\tif ( context && context instanceof jQuery && !(context instanceof jQuerySub) ) {\n\t\t\t\tcontext = jQuerySub( context );\n\t\t\t}\n\n\t\t\treturn jQuery.fn.init.call( this, selector, context, rootjQuerySub );\n\t\t};\n\t\tjQuerySub.fn.init.prototype = jQuerySub.fn;\n\t\tvar rootjQuerySub = jQuerySub(document);\n\t\treturn jQuerySub;\n\t},\n\n\tbrowser: {}\n});\n\n// Populate the class2type map\njQuery.each(\"Boolean Number String Function Array Date RegExp Object\".split(\" \"), function(i, name) {\n\tclass2type[ \"[object \" + name + \"]\" ] = name.toLowerCase();\n});\n\nbrowserMatch = jQuery.uaMatch( userAgent );\nif ( browserMatch.browser ) {\n\tjQuery.browser[ browserMatch.browser ] = true;\n\tjQuery.browser.version = browserMatch.version;\n}\n\n// Deprecated, use jQuery.browser.webkit instead\nif ( jQuery.browser.webkit ) {\n\tjQuery.browser.safari = true;\n}\n\n// IE doesn't match non-breaking spaces with \\s\nif ( rnotwhite.test( \"\\xA0\" ) ) {\n\ttrimLeft = /^[\\s\\xA0]+/;\n\ttrimRight = /[\\s\\xA0]+$/;\n}\n\n// All jQuery objects should point back to these\nrootjQuery = jQuery(document);\n\n// Cleanup functions for the document ready method\nif ( document.addEventListener ) {\n\tDOMContentLoaded = function() {\n\t\tdocument.removeEventListener( \"DOMContentLoaded\", DOMContentLoaded, false );\n\t\tjQuery.ready();\n\t};\n\n} else if ( document.attachEvent ) {\n\tDOMContentLoaded = function() {\n\t\t// Make sure body exists, at least, in case IE gets a little overzealous (ticket #5443).\n\t\tif ( document.readyState === \"complete\" ) {\n\t\t\tdocument.detachEvent( \"onreadystatechange\", DOMContentLoaded );\n\t\t\tjQuery.ready();\n\t\t}\n\t};\n}\n\n// The DOM ready check for Internet Explorer\nfunction doScrollCheck() {\n\tif ( jQuery.isReady ) {\n\t\treturn;\n\t}\n\n\ttry {\n\t\t// If IE is used, use the trick by Diego Perini\n\t\t// http://javascript.nwbox.com/IEContentLoaded/\n\t\tdocument.documentElement.doScroll(\"left\");\n\t} catch(e) {\n\t\tsetTimeout( doScrollCheck, 1 );\n\t\treturn;\n\t}\n\n\t// and execute any waiting functions\n\tjQuery.ready();\n}\n\n// Expose jQuery to the global object\nreturn jQuery;\n\n})();\n\n\nvar // Promise methods\n\tpromiseMethods = \"done fail isResolved isRejected promise then always pipe\".split( \" \" ),\n\t// Static reference to slice\n\tsliceDeferred = [].slice;\n\njQuery.extend({\n\t// Create a simple deferred (one callbacks list)\n\t_Deferred: function() {\n\t\tvar // callbacks list\n\t\t\tcallbacks = [],\n\t\t\t// stored [ context , args ]\n\t\t\tfired,\n\t\t\t// to avoid firing when already doing so\n\t\t\tfiring,\n\t\t\t// flag to know if the deferred has been cancelled\n\t\t\tcancelled,\n\t\t\t// the deferred itself\n\t\t\tdeferred = {\n\n\t\t\t\t// done( f1, f2, ...)\n\t\t\t\tdone: function() {\n\t\t\t\t\tif ( !cancelled ) {\n\t\t\t\t\t\tvar args = arguments,\n\t\t\t\t\t\t\ti,\n\t\t\t\t\t\t\tlength,\n\t\t\t\t\t\t\telem,\n\t\t\t\t\t\t\ttype,\n\t\t\t\t\t\t\t_fired;\n\t\t\t\t\t\tif ( fired ) {\n\t\t\t\t\t\t\t_fired = fired;\n\t\t\t\t\t\t\tfired = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor ( i = 0, length = args.length; i < length; i++ ) {\n\t\t\t\t\t\t\telem = args[ i ];\n\t\t\t\t\t\t\ttype = jQuery.type( elem );\n\t\t\t\t\t\t\tif ( type === \"array\" ) {\n\t\t\t\t\t\t\t\tdeferred.done.apply( deferred, elem );\n\t\t\t\t\t\t\t} else if ( type === \"function\" ) {\n\t\t\t\t\t\t\t\tcallbacks.push( elem );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif ( _fired ) {\n\t\t\t\t\t\t\tdeferred.resolveWith( _fired[ 0 ], _fired[ 1 ] );\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\treturn this;\n\t\t\t\t},\n\n\t\t\t\t// resolve with given context and args\n\t\t\t\tresolveWith: function( context, args ) {\n\t\t\t\t\tif ( !cancelled && !fired && !firing ) {\n\t\t\t\t\t\t// make sure args are available (#8421)\n\t\t\t\t\t\targs = args || [];\n\t\t\t\t\t\tfiring = 1;\n\t\t\t\t\t\ttry {\n\t\t\t\t\t\t\twhile( callbacks[ 0 ] ) {\n\t\t\t\t\t\t\t\tcallbacks.shift().apply( context, args );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfinally {\n\t\t\t\t\t\t\tfired = [ context, args ];\n\t\t\t\t\t\t\tfiring = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\treturn this;\n\t\t\t\t},\n\n\t\t\t\t// resolve with this as context and given arguments\n\t\t\t\tresolve: function() {\n\t\t\t\t\tdeferred.resolveWith( this, arguments );\n\t\t\t\t\treturn this;\n\t\t\t\t},\n\n\t\t\t\t// Has this deferred been resolved?\n\t\t\t\tisResolved: function() {\n\t\t\t\t\treturn !!( firing || fired );\n\t\t\t\t},\n\n\t\t\t\t// Cancel\n\t\t\t\tcancel: function() {\n\t\t\t\t\tcancelled = 1;\n\t\t\t\t\tcallbacks = [];\n\t\t\t\t\treturn this;\n\t\t\t\t}\n\t\t\t};\n\n\t\treturn deferred;\n\t},\n\n\t// Full fledged deferred (two callbacks list)\n\tDeferred: function( func ) {\n\t\tvar deferred = jQuery._Deferred(),\n\t\t\tfailDeferred = jQuery._Deferred(),\n\t\t\tpromise;\n\t\t// Add errorDeferred methods, then and promise\n\t\tjQuery.extend( deferred, {\n\t\t\tthen: function( doneCallbacks, failCallbacks ) {\n\t\t\t\tdeferred.done( doneCallbacks ).fail( failCallbacks );\n\t\t\t\treturn this;\n\t\t\t},\n\t\t\talways: function() {\n\t\t\t\treturn deferred.done.apply( deferred, arguments ).fail.apply( this, arguments );\n\t\t\t},\n\t\t\tfail: failDeferred.done,\n\t\t\trejectWith: failDeferred.resolveWith,\n\t\t\treject: failDeferred.resolve,\n\t\t\tisRejected: failDeferred.isResolved,\n\t\t\tpipe: function( fnDone, fnFail ) {\n\t\t\t\treturn jQuery.Deferred(function( newDefer ) {\n\t\t\t\t\tjQuery.each( {\n\t\t\t\t\t\tdone: [ fnDone, \"resolve\" ],\n\t\t\t\t\t\tfail: [ fnFail, \"reject\" ]\n\t\t\t\t\t}, function( handler, data ) {\n\t\t\t\t\t\tvar fn = data[ 0 ],\n\t\t\t\t\t\t\taction = data[ 1 ],\n\t\t\t\t\t\t\treturned;\n\t\t\t\t\t\tif ( jQuery.isFunction( fn ) ) {\n\t\t\t\t\t\t\tdeferred[ handler ](function() {\n\t\t\t\t\t\t\t\treturned = fn.apply( this, arguments );\n\t\t\t\t\t\t\t\tif ( returned && jQuery.isFunction( returned.promise ) ) {\n\t\t\t\t\t\t\t\t\treturned.promise().then( newDefer.resolve, newDefer.reject );\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\tnewDefer[ action ]( returned );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t});\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tdeferred[ handler ]( newDefer[ action ] );\n\t\t\t\t\t\t}\n\t\t\t\t\t});\n\t\t\t\t}).promise();\n\t\t\t},\n\t\t\t// Get a promise for this deferred\n\t\t\t// If obj is provided, the promise aspect is added to the object\n\t\t\tpromise: function( obj ) {\n\t\t\t\tif ( obj == null ) {\n\t\t\t\t\tif ( promise ) {\n\t\t\t\t\t\treturn promise;\n\t\t\t\t\t}\n\t\t\t\t\tpromise = obj = {};\n\t\t\t\t}\n\t\t\t\tvar i = promiseMethods.length;\n\t\t\t\twhile( i-- ) {\n\t\t\t\t\tobj[ promiseMethods[i] ] = deferred[ promiseMethods[i] ];\n\t\t\t\t}\n\t\t\t\treturn obj;\n\t\t\t}\n\t\t});\n\t\t// Make sure only one callback list will be used\n\t\tdeferred.done( failDeferred.cancel ).fail( deferred.cancel );\n\t\t// Unexpose cancel\n\t\tdelete deferred.cancel;\n\t\t// Call given func if any\n\t\tif ( func ) {\n\t\t\tfunc.call( deferred, deferred );\n\t\t}\n\t\treturn deferred;\n\t},\n\n\t// Deferred helper\n\twhen: function( firstParam ) {\n\t\tvar args = arguments,\n\t\t\ti = 0,\n\t\t\tlength = args.length,\n\t\t\tcount = length,\n\t\t\tdeferred = length <= 1 && firstParam && jQuery.isFunction( firstParam.promise ) ?\n\t\t\t\tfirstParam :\n\t\t\t\tjQuery.Deferred();\n\t\tfunction resolveFunc( i ) {\n\t\t\treturn function( value ) {\n\t\t\t\targs[ i ] = arguments.length > 1 ? sliceDeferred.call( arguments, 0 ) : value;\n\t\t\t\tif ( !( --count ) ) {\n\t\t\t\t\t// Strange bug in FF4:\n\t\t\t\t\t// Values changed onto the arguments object sometimes end up as undefined values\n\t\t\t\t\t// outside the $.when method. Cloning the object into a fresh array solves the issue\n\t\t\t\t\tdeferred.resolveWith( deferred, sliceDeferred.call( args, 0 ) );\n\t\t\t\t}\n\t\t\t};\n\t\t}\n\t\tif ( length > 1 ) {\n\t\t\tfor( ; i < length; i++ ) {\n\t\t\t\tif ( args[ i ] && jQuery.isFunction( args[ i ].promise ) ) {\n\t\t\t\t\targs[ i ].promise().then( resolveFunc(i), deferred.reject );\n\t\t\t\t} else {\n\t\t\t\t\t--count;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( !count ) {\n\t\t\t\tdeferred.resolveWith( deferred, args );\n\t\t\t}\n\t\t} else if ( deferred !== firstParam ) {\n\t\t\tdeferred.resolveWith( deferred, length ? [ firstParam ] : [] );\n\t\t}\n\t\treturn deferred.promise();\n\t}\n});\n\n\n\njQuery.support = (function() {\n\n\tvar div = document.createElement( \"div\" ),\n\t\tdocumentElement = document.documentElement,\n\t\tall,\n\t\ta,\n\t\tselect,\n\t\topt,\n\t\tinput,\n\t\tmarginDiv,\n\t\tsupport,\n\t\tfragment,\n\t\tbody,\n\t\tbodyStyle,\n\t\ttds,\n\t\tevents,\n\t\teventName,\n\t\ti,\n\t\tisSupported;\n\n\t// Preliminary tests\n\tdiv.setAttribute(\"className\", \"t\");\n\tdiv.innerHTML = \"
a\";\n\n\tall = div.getElementsByTagName( \"*\" );\n\ta = div.getElementsByTagName( \"a\" )[ 0 ];\n\n\t// Can't get basic test support\n\tif ( !all || !all.length || !a ) {\n\t\treturn {};\n\t}\n\n\t// First batch of supports tests\n\tselect = document.createElement( \"select\" );\n\topt = select.appendChild( document.createElement(\"option\") );\n\tinput = div.getElementsByTagName( \"input\" )[ 0 ];\n\n\tsupport = {\n\t\t// IE strips leading whitespace when .innerHTML is used\n\t\tleadingWhitespace: ( div.firstChild.nodeType === 3 ),\n\n\t\t// Make sure that tbody elements aren't automatically inserted\n\t\t// IE will insert them into empty tables\n\t\ttbody: !div.getElementsByTagName( \"tbody\" ).length,\n\n\t\t// Make sure that link elements get serialized correctly by innerHTML\n\t\t// This requires a wrapper element in IE\n\t\thtmlSerialize: !!div.getElementsByTagName( \"link\" ).length,\n\n\t\t// Get the style information from getAttribute\n\t\t// (IE uses .cssText instead)\n\t\tstyle: /top/.test( a.getAttribute(\"style\") ),\n\n\t\t// Make sure that URLs aren't manipulated\n\t\t// (IE normalizes it by default)\n\t\threfNormalized: ( a.getAttribute( \"href\" ) === \"/a\" ),\n\n\t\t// Make sure that element opacity exists\n\t\t// (IE uses filter instead)\n\t\t// Use a regex to work around a WebKit issue. See #5145\n\t\topacity: /^0.55$/.test( a.style.opacity ),\n\n\t\t// Verify style float existence\n\t\t// (IE uses styleFloat instead of cssFloat)\n\t\tcssFloat: !!a.style.cssFloat,\n\n\t\t// Make sure that if no value is specified for a checkbox\n\t\t// that it defaults to \"on\".\n\t\t// (WebKit defaults to \"\" instead)\n\t\tcheckOn: ( input.value === \"on\" ),\n\n\t\t// Make sure that a selected-by-default option has a working selected property.\n\t\t// (WebKit defaults to false instead of true, IE too, if it's in an optgroup)\n\t\toptSelected: opt.selected,\n\n\t\t// Test setAttribute on camelCase class. If it works, we need attrFixes when doing get/setAttribute (ie6/7)\n\t\tgetSetAttribute: div.className !== \"t\",\n\n\t\t// Will be defined later\n\t\tsubmitBubbles: true,\n\t\tchangeBubbles: true,\n\t\tfocusinBubbles: false,\n\t\tdeleteExpando: true,\n\t\tnoCloneEvent: true,\n\t\tinlineBlockNeedsLayout: false,\n\t\tshrinkWrapBlocks: false,\n\t\treliableMarginRight: true\n\t};\n\n\t// Make sure checked status is properly cloned\n\tinput.checked = true;\n\tsupport.noCloneChecked = input.cloneNode( true ).checked;\n\n\t// Make sure that the options inside disabled selects aren't marked as disabled\n\t// (WebKit marks them as disabled)\n\tselect.disabled = true;\n\tsupport.optDisabled = !opt.disabled;\n\n\t// Test to see if it's possible to delete an expando from an element\n\t// Fails in Internet Explorer\n\ttry {\n\t\tdelete div.test;\n\t} catch( e ) {\n\t\tsupport.deleteExpando = false;\n\t}\n\n\tif ( !div.addEventListener && div.attachEvent && div.fireEvent ) {\n\t\tdiv.attachEvent( \"onclick\", function click() {\n\t\t\t// Cloning a node shouldn't copy over any\n\t\t\t// bound event handlers (IE does this)\n\t\t\tsupport.noCloneEvent = false;\n\t\t\tdiv.detachEvent( \"onclick\", click );\n\t\t});\n\t\tdiv.cloneNode( true ).fireEvent( \"onclick\" );\n\t}\n\n\t// Check if a radio maintains it's value\n\t// after being appended to the DOM\n\tinput = document.createElement(\"input\");\n\tinput.value = \"t\";\n\tinput.setAttribute(\"type\", \"radio\");\n\tsupport.radioValue = input.value === \"t\";\n\n\tinput.setAttribute(\"checked\", \"checked\");\n\tdiv.appendChild( input );\n\tfragment = document.createDocumentFragment();\n\tfragment.appendChild( div.firstChild );\n\n\t// WebKit doesn't clone checked state correctly in fragments\n\tsupport.checkClone = fragment.cloneNode( true ).cloneNode( true ).lastChild.checked;\n\n\tdiv.innerHTML = \"\";\n\n\t// Figure out if the W3C box model works as expected\n\tdiv.style.width = div.style.paddingLeft = \"1px\";\n\n\t// We use our own, invisible, body\n\tbody = document.createElement( \"body\" );\n\tbodyStyle = {\n\t\tvisibility: \"hidden\",\n\t\twidth: 0,\n\t\theight: 0,\n\t\tborder: 0,\n\t\tmargin: 0,\n\t\t// Set background to avoid IE crashes when removing (#9028)\n\t\tbackground: \"none\"\n\t};\n\tfor ( i in bodyStyle ) {\n\t\tbody.style[ i ] = bodyStyle[ i ];\n\t}\n\tbody.appendChild( div );\n\tdocumentElement.insertBefore( body, documentElement.firstChild );\n\n\t// Check if a disconnected checkbox will retain its checked\n\t// value of true after appended to the DOM (IE6/7)\n\tsupport.appendChecked = input.checked;\n\n\tsupport.boxModel = div.offsetWidth === 2;\n\n\tif ( \"zoom\" in div.style ) {\n\t\t// Check if natively block-level elements act like inline-block\n\t\t// elements when setting their display to 'inline' and giving\n\t\t// them layout\n\t\t// (IE < 8 does this)\n\t\tdiv.style.display = \"inline\";\n\t\tdiv.style.zoom = 1;\n\t\tsupport.inlineBlockNeedsLayout = ( div.offsetWidth === 2 );\n\n\t\t// Check if elements with layout shrink-wrap their children\n\t\t// (IE 6 does this)\n\t\tdiv.style.display = \"\";\n\t\tdiv.innerHTML = \"
\";\n\t\tsupport.shrinkWrapBlocks = ( div.offsetWidth !== 2 );\n\t}\n\n\tdiv.innerHTML = \"
t
\";\n\ttds = div.getElementsByTagName( \"td\" );\n\n\t// Check if table cells still have offsetWidth/Height when they are set\n\t// to display:none and there are still other visible table cells in a\n\t// table row; if so, offsetWidth/Height are not reliable for use when\n\t// determining if an element has been hidden directly using\n\t// display:none (it is still safe to use offsets if a parent element is\n\t// hidden; don safety goggles and see bug #4512 for more information).\n\t// (only IE 8 fails this test)\n\tisSupported = ( tds[ 0 ].offsetHeight === 0 );\n\n\ttds[ 0 ].style.display = \"\";\n\ttds[ 1 ].style.display = \"none\";\n\n\t// Check if empty table cells still have offsetWidth/Height\n\t// (IE < 8 fail this test)\n\tsupport.reliableHiddenOffsets = isSupported && ( tds[ 0 ].offsetHeight === 0 );\n\tdiv.innerHTML = \"\";\n\n\t// Check if div with explicit width and no margin-right incorrectly\n\t// gets computed margin-right based on width of container. For more\n\t// info see bug #3333\n\t// Fails in WebKit before Feb 2011 nightlies\n\t// WebKit Bug 13343 - getComputedStyle returns wrong value for margin-right\n\tif ( document.defaultView && document.defaultView.getComputedStyle ) {\n\t\tmarginDiv = document.createElement( \"div\" );\n\t\tmarginDiv.style.width = \"0\";\n\t\tmarginDiv.style.marginRight = \"0\";\n\t\tdiv.appendChild( marginDiv );\n\t\tsupport.reliableMarginRight =\n\t\t\t( parseInt( ( document.defaultView.getComputedStyle( marginDiv, null ) || { marginRight: 0 } ).marginRight, 10 ) || 0 ) === 0;\n\t}\n\n\t// Remove the body element we added\n\tbody.innerHTML = \"\";\n\tdocumentElement.removeChild( body );\n\n\t// Technique from Juriy Zaytsev\n\t// http://thinkweb2.com/projects/prototype/detecting-event-support-without-browser-sniffing/\n\t// We only care about the case where non-standard event systems\n\t// are used, namely in IE. Short-circuiting here helps us to\n\t// avoid an eval call (in setAttribute) which can cause CSP\n\t// to go haywire. See: https://developer.mozilla.org/en/Security/CSP\n\tif ( div.attachEvent ) {\n\t\tfor( i in {\n\t\t\tsubmit: 1,\n\t\t\tchange: 1,\n\t\t\tfocusin: 1\n\t\t} ) {\n\t\t\teventName = \"on\" + i;\n\t\t\tisSupported = ( eventName in div );\n\t\t\tif ( !isSupported ) {\n\t\t\t\tdiv.setAttribute( eventName, \"return;\" );\n\t\t\t\tisSupported = ( typeof div[ eventName ] === \"function\" );\n\t\t\t}\n\t\t\tsupport[ i + \"Bubbles\" ] = isSupported;\n\t\t}\n\t}\n\n\treturn support;\n})();\n\n// Keep track of boxModel\njQuery.boxModel = jQuery.support.boxModel;\n\n\n\n\nvar rbrace = /^(?:\\{.*\\}|\\[.*\\])$/,\n\trmultiDash = /([a-z])([A-Z])/g;\n\njQuery.extend({\n\tcache: {},\n\n\t// Please use with caution\n\tuuid: 0,\n\n\t// Unique for each copy of jQuery on the page\n\t// Non-digits removed to match rinlinejQuery\n\texpando: \"jQuery\" + ( jQuery.fn.jquery + Math.random() ).replace( /\\D/g, \"\" ),\n\n\t// The following elements throw uncatchable exceptions if you\n\t// attempt to add expando properties to them.\n\tnoData: {\n\t\t\"embed\": true,\n\t\t// Ban all objects except for Flash (which handle expandos)\n\t\t\"object\": \"clsid:D27CDB6E-AE6D-11cf-96B8-444553540000\",\n\t\t\"applet\": true\n\t},\n\n\thasData: function( elem ) {\n\t\telem = elem.nodeType ? jQuery.cache[ elem[jQuery.expando] ] : elem[ jQuery.expando ];\n\n\t\treturn !!elem && !isEmptyDataObject( elem );\n\t},\n\n\tdata: function( elem, name, data, pvt /* Internal Use Only */ ) {\n\t\tif ( !jQuery.acceptData( elem ) ) {\n\t\t\treturn;\n\t\t}\n\n\t\tvar internalKey = jQuery.expando, getByName = typeof name === \"string\", thisCache,\n\n\t\t\t// We have to handle DOM nodes and JS objects differently because IE6-7\n\t\t\t// can't GC object references properly across the DOM-JS boundary\n\t\t\tisNode = elem.nodeType,\n\n\t\t\t// Only DOM nodes need the global jQuery cache; JS object data is\n\t\t\t// attached directly to the object so GC can occur automatically\n\t\t\tcache = isNode ? jQuery.cache : elem,\n\n\t\t\t// Only defining an ID for JS objects if its cache already exists allows\n\t\t\t// the code to shortcut on the same path as a DOM node with no cache\n\t\t\tid = isNode ? elem[ jQuery.expando ] : elem[ jQuery.expando ] && jQuery.expando;\n\n\t\t// Avoid doing any more work than we need to when trying to get data on an\n\t\t// object that has no data at all\n\t\tif ( (!id || (pvt && id && !cache[ id ][ internalKey ])) && getByName && data === undefined ) {\n\t\t\treturn;\n\t\t}\n\n\t\tif ( !id ) {\n\t\t\t// Only DOM nodes need a new unique ID for each element since their data\n\t\t\t// ends up in the global cache\n\t\t\tif ( isNode ) {\n\t\t\t\telem[ jQuery.expando ] = id = ++jQuery.uuid;\n\t\t\t} else {\n\t\t\t\tid = jQuery.expando;\n\t\t\t}\n\t\t}\n\n\t\tif ( !cache[ id ] ) {\n\t\t\tcache[ id ] = {};\n\n\t\t\t// TODO: This is a hack for 1.5 ONLY. Avoids exposing jQuery\n\t\t\t// metadata on plain JS objects when the object is serialized using\n\t\t\t// JSON.stringify\n\t\t\tif ( !isNode ) {\n\t\t\t\tcache[ id ].toJSON = jQuery.noop;\n\t\t\t}\n\t\t}\n\n\t\t// An object can be passed to jQuery.data instead of a key/value pair; this gets\n\t\t// shallow copied over onto the existing cache\n\t\tif ( typeof name === \"object\" || typeof name === \"function\" ) {\n\t\t\tif ( pvt ) {\n\t\t\t\tcache[ id ][ internalKey ] = jQuery.extend(cache[ id ][ internalKey ], name);\n\t\t\t} else {\n\t\t\t\tcache[ id ] = jQuery.extend(cache[ id ], name);\n\t\t\t}\n\t\t}\n\n\t\tthisCache = cache[ id ];\n\n\t\t// Internal jQuery data is stored in a separate object inside the object's data\n\t\t// cache in order to avoid key collisions between internal data and user-defined\n\t\t// data\n\t\tif ( pvt ) {\n\t\t\tif ( !thisCache[ internalKey ] ) {\n\t\t\t\tthisCache[ internalKey ] = {};\n\t\t\t}\n\n\t\t\tthisCache = thisCache[ internalKey ];\n\t\t}\n\n\t\tif ( data !== undefined ) {\n\t\t\tthisCache[ jQuery.camelCase( name ) ] = data;\n\t\t}\n\n\t\t// TODO: This is a hack for 1.5 ONLY. It will be removed in 1.6. Users should\n\t\t// not attempt to inspect the internal events object using jQuery.data, as this\n\t\t// internal data object is undocumented and subject to change.\n\t\tif ( name === \"events\" && !thisCache[name] ) {\n\t\t\treturn thisCache[ internalKey ] && thisCache[ internalKey ].events;\n\t\t}\n\n\t\treturn getByName ? thisCache[ jQuery.camelCase( name ) ] : thisCache;\n\t},\n\n\tremoveData: function( elem, name, pvt /* Internal Use Only */ ) {\n\t\tif ( !jQuery.acceptData( elem ) ) {\n\t\t\treturn;\n\t\t}\n\n\t\tvar internalKey = jQuery.expando, isNode = elem.nodeType,\n\n\t\t\t// See jQuery.data for more information\n\t\t\tcache = isNode ? jQuery.cache : elem,\n\n\t\t\t// See jQuery.data for more information\n\t\t\tid = isNode ? elem[ jQuery.expando ] : jQuery.expando;\n\n\t\t// If there is already no cache entry for this object, there is no\n\t\t// purpose in continuing\n\t\tif ( !cache[ id ] ) {\n\t\t\treturn;\n\t\t}\n\n\t\tif ( name ) {\n\t\t\tvar thisCache = pvt ? cache[ id ][ internalKey ] : cache[ id ];\n\n\t\t\tif ( thisCache ) {\n\t\t\t\tdelete thisCache[ name ];\n\n\t\t\t\t// If there is no data left in the cache, we want to continue\n\t\t\t\t// and let the cache object itself get destroyed\n\t\t\t\tif ( !isEmptyDataObject(thisCache) ) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// See jQuery.data for more information\n\t\tif ( pvt ) {\n\t\t\tdelete cache[ id ][ internalKey ];\n\n\t\t\t// Don't destroy the parent cache unless the internal data object\n\t\t\t// had been the only thing left in it\n\t\t\tif ( !isEmptyDataObject(cache[ id ]) ) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\n\t\tvar internalCache = cache[ id ][ internalKey ];\n\n\t\t// Browsers that fail expando deletion also refuse to delete expandos on\n\t\t// the window, but it will allow it on all other JS objects; other browsers\n\t\t// don't care\n\t\tif ( jQuery.support.deleteExpando || cache != window ) {\n\t\t\tdelete cache[ id ];\n\t\t} else {\n\t\t\tcache[ id ] = null;\n\t\t}\n\n\t\t// We destroyed the entire user cache at once because it's faster than\n\t\t// iterating through each key, but we need to continue to persist internal\n\t\t// data if it existed\n\t\tif ( internalCache ) {\n\t\t\tcache[ id ] = {};\n\t\t\t// TODO: This is a hack for 1.5 ONLY. Avoids exposing jQuery\n\t\t\t// metadata on plain JS objects when the object is serialized using\n\t\t\t// JSON.stringify\n\t\t\tif ( !isNode ) {\n\t\t\t\tcache[ id ].toJSON = jQuery.noop;\n\t\t\t}\n\n\t\t\tcache[ id ][ internalKey ] = internalCache;\n\n\t\t// Otherwise, we need to eliminate the expando on the node to avoid\n\t\t// false lookups in the cache for entries that no longer exist\n\t\t} else if ( isNode ) {\n\t\t\t// IE does not allow us to delete expando properties from nodes,\n\t\t\t// nor does it have a removeAttribute function on Document nodes;\n\t\t\t// we must handle all of these cases\n\t\t\tif ( jQuery.support.deleteExpando ) {\n\t\t\t\tdelete elem[ jQuery.expando ];\n\t\t\t} else if ( elem.removeAttribute ) {\n\t\t\t\telem.removeAttribute( jQuery.expando );\n\t\t\t} else {\n\t\t\t\telem[ jQuery.expando ] = null;\n\t\t\t}\n\t\t}\n\t},\n\n\t// For internal use only.\n\t_data: function( elem, name, data ) {\n\t\treturn jQuery.data( elem, name, data, true );\n\t},\n\n\t// A method for determining if a DOM node can handle the data expando\n\tacceptData: function( elem ) {\n\t\tif ( elem.nodeName ) {\n\t\t\tvar match = jQuery.noData[ elem.nodeName.toLowerCase() ];\n\n\t\t\tif ( match ) {\n\t\t\t\treturn !(match === true || elem.getAttribute(\"classid\") !== match);\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}\n});\n\njQuery.fn.extend({\n\tdata: function( key, value ) {\n\t\tvar data = null;\n\n\t\tif ( typeof key === \"undefined\" ) {\n\t\t\tif ( this.length ) {\n\t\t\t\tdata = jQuery.data( this[0] );\n\n\t\t\t\tif ( this[0].nodeType === 1 ) {\n\t\t\t var attr = this[0].attributes, name;\n\t\t\t\t\tfor ( var i = 0, l = attr.length; i < l; i++ ) {\n\t\t\t\t\t\tname = attr[i].name;\n\n\t\t\t\t\t\tif ( name.indexOf( \"data-\" ) === 0 ) {\n\t\t\t\t\t\t\tname = jQuery.camelCase( name.substring(5) );\n\n\t\t\t\t\t\t\tdataAttr( this[0], name, data[ name ] );\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn data;\n\n\t\t} else if ( typeof key === \"object\" ) {\n\t\t\treturn this.each(function() {\n\t\t\t\tjQuery.data( this, key );\n\t\t\t});\n\t\t}\n\n\t\tvar parts = key.split(\".\");\n\t\tparts[1] = parts[1] ? \".\" + parts[1] : \"\";\n\n\t\tif ( value === undefined ) {\n\t\t\tdata = this.triggerHandler(\"getData\" + parts[1] + \"!\", [parts[0]]);\n\n\t\t\t// Try to fetch any internally stored data first\n\t\t\tif ( data === undefined && this.length ) {\n\t\t\t\tdata = jQuery.data( this[0], key );\n\t\t\t\tdata = dataAttr( this[0], key, data );\n\t\t\t}\n\n\t\t\treturn data === undefined && parts[1] ?\n\t\t\t\tthis.data( parts[0] ) :\n\t\t\t\tdata;\n\n\t\t} else {\n\t\t\treturn this.each(function() {\n\t\t\t\tvar $this = jQuery( this ),\n\t\t\t\t\targs = [ parts[0], value ];\n\n\t\t\t\t$this.triggerHandler( \"setData\" + parts[1] + \"!\", args );\n\t\t\t\tjQuery.data( this, key, value );\n\t\t\t\t$this.triggerHandler( \"changeData\" + parts[1] + \"!\", args );\n\t\t\t});\n\t\t}\n\t},\n\n\tremoveData: function( key ) {\n\t\treturn this.each(function() {\n\t\t\tjQuery.removeData( this, key );\n\t\t});\n\t}\n});\n\nfunction dataAttr( elem, key, data ) {\n\t// If nothing was found internally, try to fetch any\n\t// data from the HTML5 data-* attribute\n\tif ( data === undefined && elem.nodeType === 1 ) {\n\t\tvar name = \"data-\" + key.replace( rmultiDash, \"$1-$2\" ).toLowerCase();\n\n\t\tdata = elem.getAttribute( name );\n\n\t\tif ( typeof data === \"string\" ) {\n\t\t\ttry {\n\t\t\t\tdata = data === \"true\" ? true :\n\t\t\t\tdata === \"false\" ? false :\n\t\t\t\tdata === \"null\" ? null :\n\t\t\t\t!jQuery.isNaN( data ) ? parseFloat( data ) :\n\t\t\t\t\trbrace.test( data ) ? jQuery.parseJSON( data ) :\n\t\t\t\t\tdata;\n\t\t\t} catch( e ) {}\n\n\t\t\t// Make sure we set the data so it isn't changed later\n\t\t\tjQuery.data( elem, key, data );\n\n\t\t} else {\n\t\t\tdata = undefined;\n\t\t}\n\t}\n\n\treturn data;\n}\n\n// TODO: This is a hack for 1.5 ONLY to allow objects with a single toJSON\n// property to be considered empty objects; this property always exists in\n// order to make sure JSON.stringify does not expose internal metadata\nfunction isEmptyDataObject( obj ) {\n\tfor ( var name in obj ) {\n\t\tif ( name !== \"toJSON\" ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\n\n\n\nfunction handleQueueMarkDefer( elem, type, src ) {\n\tvar deferDataKey = type + \"defer\",\n\t\tqueueDataKey = type + \"queue\",\n\t\tmarkDataKey = type + \"mark\",\n\t\tdefer = jQuery.data( elem, deferDataKey, undefined, true );\n\tif ( defer &&\n\t\t( src === \"queue\" || !jQuery.data( elem, queueDataKey, undefined, true ) ) &&\n\t\t( src === \"mark\" || !jQuery.data( elem, markDataKey, undefined, true ) ) ) {\n\t\t// Give room for hard-coded callbacks to fire first\n\t\t// and eventually mark/queue something else on the element\n\t\tsetTimeout( function() {\n\t\t\tif ( !jQuery.data( elem, queueDataKey, undefined, true ) &&\n\t\t\t\t!jQuery.data( elem, markDataKey, undefined, true ) ) {\n\t\t\t\tjQuery.removeData( elem, deferDataKey, true );\n\t\t\t\tdefer.resolve();\n\t\t\t}\n\t\t}, 0 );\n\t}\n}\n\njQuery.extend({\n\n\t_mark: function( elem, type ) {\n\t\tif ( elem ) {\n\t\t\ttype = (type || \"fx\") + \"mark\";\n\t\t\tjQuery.data( elem, type, (jQuery.data(elem,type,undefined,true) || 0) + 1, true );\n\t\t}\n\t},\n\n\t_unmark: function( force, elem, type ) {\n\t\tif ( force !== true ) {\n\t\t\ttype = elem;\n\t\t\telem = force;\n\t\t\tforce = false;\n\t\t}\n\t\tif ( elem ) {\n\t\t\ttype = type || \"fx\";\n\t\t\tvar key = type + \"mark\",\n\t\t\t\tcount = force ? 0 : ( (jQuery.data( elem, key, undefined, true) || 1 ) - 1 );\n\t\t\tif ( count ) {\n\t\t\t\tjQuery.data( elem, key, count, true );\n\t\t\t} else {\n\t\t\t\tjQuery.removeData( elem, key, true );\n\t\t\t\thandleQueueMarkDefer( elem, type, \"mark\" );\n\t\t\t}\n\t\t}\n\t},\n\n\tqueue: function( elem, type, data ) {\n\t\tif ( elem ) {\n\t\t\ttype = (type || \"fx\") + \"queue\";\n\t\t\tvar q = jQuery.data( elem, type, undefined, true );\n\t\t\t// Speed up dequeue by getting out quickly if this is just a lookup\n\t\t\tif ( data ) {\n\t\t\t\tif ( !q || jQuery.isArray(data) ) {\n\t\t\t\t\tq = jQuery.data( elem, type, jQuery.makeArray(data), true );\n\t\t\t\t} else {\n\t\t\t\t\tq.push( data );\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn q || [];\n\t\t}\n\t},\n\n\tdequeue: function( elem, type ) {\n\t\ttype = type || \"fx\";\n\n\t\tvar queue = jQuery.queue( elem, type ),\n\t\t\tfn = queue.shift(),\n\t\t\tdefer;\n\n\t\t// If the fx queue is dequeued, always remove the progress sentinel\n\t\tif ( fn === \"inprogress\" ) {\n\t\t\tfn = queue.shift();\n\t\t}\n\n\t\tif ( fn ) {\n\t\t\t// Add a progress sentinel to prevent the fx queue from being\n\t\t\t// automatically dequeued\n\t\t\tif ( type === \"fx\" ) {\n\t\t\t\tqueue.unshift(\"inprogress\");\n\t\t\t}\n\n\t\t\tfn.call(elem, function() {\n\t\t\t\tjQuery.dequeue(elem, type);\n\t\t\t});\n\t\t}\n\n\t\tif ( !queue.length ) {\n\t\t\tjQuery.removeData( elem, type + \"queue\", true );\n\t\t\thandleQueueMarkDefer( elem, type, \"queue\" );\n\t\t}\n\t}\n});\n\njQuery.fn.extend({\n\tqueue: function( type, data ) {\n\t\tif ( typeof type !== \"string\" ) {\n\t\t\tdata = type;\n\t\t\ttype = \"fx\";\n\t\t}\n\n\t\tif ( data === undefined ) {\n\t\t\treturn jQuery.queue( this[0], type );\n\t\t}\n\t\treturn this.each(function() {\n\t\t\tvar queue = jQuery.queue( this, type, data );\n\n\t\t\tif ( type === \"fx\" && queue[0] !== \"inprogress\" ) {\n\t\t\t\tjQuery.dequeue( this, type );\n\t\t\t}\n\t\t});\n\t},\n\tdequeue: function( type ) {\n\t\treturn this.each(function() {\n\t\t\tjQuery.dequeue( this, type );\n\t\t});\n\t},\n\t// Based off of the plugin by Clint Helfers, with permission.\n\t// http://blindsignals.com/index.php/2009/07/jquery-delay/\n\tdelay: function( time, type ) {\n\t\ttime = jQuery.fx ? jQuery.fx.speeds[time] || time : time;\n\t\ttype = type || \"fx\";\n\n\t\treturn this.queue( type, function() {\n\t\t\tvar elem = this;\n\t\t\tsetTimeout(function() {\n\t\t\t\tjQuery.dequeue( elem, type );\n\t\t\t}, time );\n\t\t});\n\t},\n\tclearQueue: function( type ) {\n\t\treturn this.queue( type || \"fx\", [] );\n\t},\n\t// Get a promise resolved when queues of a certain type\n\t// are emptied (fx is the type by default)\n\tpromise: function( type, object ) {\n\t\tif ( typeof type !== \"string\" ) {\n\t\t\tobject = type;\n\t\t\ttype = undefined;\n\t\t}\n\t\ttype = type || \"fx\";\n\t\tvar defer = jQuery.Deferred(),\n\t\t\telements = this,\n\t\t\ti = elements.length,\n\t\t\tcount = 1,\n\t\t\tdeferDataKey = type + \"defer\",\n\t\t\tqueueDataKey = type + \"queue\",\n\t\t\tmarkDataKey = type + \"mark\",\n\t\t\ttmp;\n\t\tfunction resolve() {\n\t\t\tif ( !( --count ) ) {\n\t\t\t\tdefer.resolveWith( elements, [ elements ] );\n\t\t\t}\n\t\t}\n\t\twhile( i-- ) {\n\t\t\tif (( tmp = jQuery.data( elements[ i ], deferDataKey, undefined, true ) ||\n\t\t\t\t\t( jQuery.data( elements[ i ], queueDataKey, undefined, true ) ||\n\t\t\t\t\t\tjQuery.data( elements[ i ], markDataKey, undefined, true ) ) &&\n\t\t\t\t\tjQuery.data( elements[ i ], deferDataKey, jQuery._Deferred(), true ) )) {\n\t\t\t\tcount++;\n\t\t\t\ttmp.done( resolve );\n\t\t\t}\n\t\t}\n\t\tresolve();\n\t\treturn defer.promise();\n\t}\n});\n\n\n\n\nvar rclass = /[\\n\\t\\r]/g,\n\trspace = /\\s+/,\n\trreturn = /\\r/g,\n\trtype = /^(?:button|input)$/i,\n\trfocusable = /^(?:button|input|object|select|textarea)$/i,\n\trclickable = /^a(?:rea)?$/i,\n\trboolean = /^(?:autofocus|autoplay|async|checked|controls|defer|disabled|hidden|loop|multiple|open|readonly|required|scoped|selected)$/i,\n\trinvalidChar = /\\:/,\n\tformHook, boolHook;\n\njQuery.fn.extend({\n\tattr: function( name, value ) {\n\t\treturn jQuery.access( this, name, value, true, jQuery.attr );\n\t},\n\n\tremoveAttr: function( name ) {\n\t\treturn this.each(function() {\n\t\t\tjQuery.removeAttr( this, name );\n\t\t});\n\t},\n\t\n\tprop: function( name, value ) {\n\t\treturn jQuery.access( this, name, value, true, jQuery.prop );\n\t},\n\t\n\tremoveProp: function( name ) {\n\t\tname = jQuery.propFix[ name ] || name;\n\t\treturn this.each(function() {\n\t\t\t// try/catch handles cases where IE balks (such as removing a property on window)\n\t\t\ttry {\n\t\t\t\tthis[ name ] = undefined;\n\t\t\t\tdelete this[ name ];\n\t\t\t} catch( e ) {}\n\t\t});\n\t},\n\n\taddClass: function( value ) {\n\t\tif ( jQuery.isFunction( value ) ) {\n\t\t\treturn this.each(function(i) {\n\t\t\t\tvar self = jQuery(this);\n\t\t\t\tself.addClass( value.call(this, i, self.attr(\"class\") || \"\") );\n\t\t\t});\n\t\t}\n\n\t\tif ( value && typeof value === \"string\" ) {\n\t\t\tvar classNames = (value || \"\").split( rspace );\n\n\t\t\tfor ( var i = 0, l = this.length; i < l; i++ ) {\n\t\t\t\tvar elem = this[i];\n\n\t\t\t\tif ( elem.nodeType === 1 ) {\n\t\t\t\t\tif ( !elem.className ) {\n\t\t\t\t\t\telem.className = value;\n\n\t\t\t\t\t} else {\n\t\t\t\t\t\tvar className = \" \" + elem.className + \" \",\n\t\t\t\t\t\t\tsetClass = elem.className;\n\n\t\t\t\t\t\tfor ( var c = 0, cl = classNames.length; c < cl; c++ ) {\n\t\t\t\t\t\t\tif ( className.indexOf( \" \" + classNames[c] + \" \" ) < 0 ) {\n\t\t\t\t\t\t\t\tsetClass += \" \" + classNames[c];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telem.className = jQuery.trim( setClass );\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn this;\n\t},\n\n\tremoveClass: function( value ) {\n\t\tif ( jQuery.isFunction(value) ) {\n\t\t\treturn this.each(function(i) {\n\t\t\t\tvar self = jQuery(this);\n\t\t\t\tself.removeClass( value.call(this, i, self.attr(\"class\")) );\n\t\t\t});\n\t\t}\n\n\t\tif ( (value && typeof value === \"string\") || value === undefined ) {\n\t\t\tvar classNames = (value || \"\").split( rspace );\n\n\t\t\tfor ( var i = 0, l = this.length; i < l; i++ ) {\n\t\t\t\tvar elem = this[i];\n\n\t\t\t\tif ( elem.nodeType === 1 && elem.className ) {\n\t\t\t\t\tif ( value ) {\n\t\t\t\t\t\tvar className = (\" \" + elem.className + \" \").replace(rclass, \" \");\n\t\t\t\t\t\tfor ( var c = 0, cl = classNames.length; c < cl; c++ ) {\n\t\t\t\t\t\t\tclassName = className.replace(\" \" + classNames[c] + \" \", \" \");\n\t\t\t\t\t\t}\n\t\t\t\t\t\telem.className = jQuery.trim( className );\n\n\t\t\t\t\t} else {\n\t\t\t\t\t\telem.className = \"\";\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn this;\n\t},\n\n\ttoggleClass: function( value, stateVal ) {\n\t\tvar type = typeof value,\n\t\t\tisBool = typeof stateVal === \"boolean\";\n\n\t\tif ( jQuery.isFunction( value ) ) {\n\t\t\treturn this.each(function(i) {\n\t\t\t\tvar self = jQuery(this);\n\t\t\t\tself.toggleClass( value.call(this, i, self.attr(\"class\"), stateVal), stateVal );\n\t\t\t});\n\t\t}\n\n\t\treturn this.each(function() {\n\t\t\tif ( type === \"string\" ) {\n\t\t\t\t// toggle individual class names\n\t\t\t\tvar className,\n\t\t\t\t\ti = 0,\n\t\t\t\t\tself = jQuery( this ),\n\t\t\t\t\tstate = stateVal,\n\t\t\t\t\tclassNames = value.split( rspace );\n\n\t\t\t\twhile ( (className = classNames[ i++ ]) ) {\n\t\t\t\t\t// check each className given, space seperated list\n\t\t\t\t\tstate = isBool ? state : !self.hasClass( className );\n\t\t\t\t\tself[ state ? \"addClass\" : \"removeClass\" ]( className );\n\t\t\t\t}\n\n\t\t\t} else if ( type === \"undefined\" || type === \"boolean\" ) {\n\t\t\t\tif ( this.className ) {\n\t\t\t\t\t// store className if set\n\t\t\t\t\tjQuery._data( this, \"__className__\", this.className );\n\t\t\t\t}\n\n\t\t\t\t// toggle whole className\n\t\t\t\tthis.className = this.className || value === false ? \"\" : jQuery._data( this, \"__className__\" ) || \"\";\n\t\t\t}\n\t\t});\n\t},\n\n\thasClass: function( selector ) {\n\t\tvar className = \" \" + selector + \" \";\n\t\tfor ( var i = 0, l = this.length; i < l; i++ ) {\n\t\t\tif ( (\" \" + this[i].className + \" \").replace(rclass, \" \").indexOf( className ) > -1 ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\treturn false;\n\t},\n\n\tval: function( value ) {\n\t\tvar hooks, ret,\n\t\t\telem = this[0];\n\t\t\n\t\tif ( !arguments.length ) {\n\t\t\tif ( elem ) {\n\t\t\t\thooks = jQuery.valHooks[ elem.nodeName.toLowerCase() ] || jQuery.valHooks[ elem.type ];\n\n\t\t\t\tif ( hooks && \"get\" in hooks && (ret = hooks.get( elem, \"value\" )) !== undefined ) {\n\t\t\t\t\treturn ret;\n\t\t\t\t}\n\n\t\t\t\treturn (elem.value || \"\").replace(rreturn, \"\");\n\t\t\t}\n\n\t\t\treturn undefined;\n\t\t}\n\n\t\tvar isFunction = jQuery.isFunction( value );\n\n\t\treturn this.each(function( i ) {\n\t\t\tvar self = jQuery(this), val;\n\n\t\t\tif ( this.nodeType !== 1 ) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif ( isFunction ) {\n\t\t\t\tval = value.call( this, i, self.val() );\n\t\t\t} else {\n\t\t\t\tval = value;\n\t\t\t}\n\n\t\t\t// Treat null/undefined as \"\"; convert numbers to string\n\t\t\tif ( val == null ) {\n\t\t\t\tval = \"\";\n\t\t\t} else if ( typeof val === \"number\" ) {\n\t\t\t\tval += \"\";\n\t\t\t} else if ( jQuery.isArray( val ) ) {\n\t\t\t\tval = jQuery.map(val, function ( value ) {\n\t\t\t\t\treturn value == null ? \"\" : value + \"\";\n\t\t\t\t});\n\t\t\t}\n\n\t\t\thooks = jQuery.valHooks[ this.nodeName.toLowerCase() ] || jQuery.valHooks[ this.type ];\n\n\t\t\t// If set returns undefined, fall back to normal setting\n\t\t\tif ( !hooks || !(\"set\" in hooks) || hooks.set( this, val, \"value\" ) === undefined ) {\n\t\t\t\tthis.value = val;\n\t\t\t}\n\t\t});\n\t}\n});\n\njQuery.extend({\n\tvalHooks: {\n\t\toption: {\n\t\t\tget: function( elem ) {\n\t\t\t\t// attributes.value is undefined in Blackberry 4.7 but\n\t\t\t\t// uses .value. See #6932\n\t\t\t\tvar val = elem.attributes.value;\n\t\t\t\treturn !val || val.specified ? elem.value : elem.text;\n\t\t\t}\n\t\t},\n\t\tselect: {\n\t\t\tget: function( elem ) {\n\t\t\t\tvar value,\n\t\t\t\t\tindex = elem.selectedIndex,\n\t\t\t\t\tvalues = [],\n\t\t\t\t\toptions = elem.options,\n\t\t\t\t\tone = elem.type === \"select-one\";\n\n\t\t\t\t// Nothing was selected\n\t\t\t\tif ( index < 0 ) {\n\t\t\t\t\treturn null;\n\t\t\t\t}\n\n\t\t\t\t// Loop through all the selected options\n\t\t\t\tfor ( var i = one ? index : 0, max = one ? index + 1 : options.length; i < max; i++ ) {\n\t\t\t\t\tvar option = options[ i ];\n\n\t\t\t\t\t// Don't return options that are disabled or in a disabled optgroup\n\t\t\t\t\tif ( option.selected && (jQuery.support.optDisabled ? !option.disabled : option.getAttribute(\"disabled\") === null) &&\n\t\t\t\t\t\t\t(!option.parentNode.disabled || !jQuery.nodeName( option.parentNode, \"optgroup\" )) ) {\n\n\t\t\t\t\t\t// Get the specific value for the option\n\t\t\t\t\t\tvalue = jQuery( option ).val();\n\n\t\t\t\t\t\t// We don't need an array for one selects\n\t\t\t\t\t\tif ( one ) {\n\t\t\t\t\t\t\treturn value;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Multi-Selects return an array\n\t\t\t\t\t\tvalues.push( value );\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// Fixes Bug #2551 -- select.val() broken in IE after form.reset()\n\t\t\t\tif ( one && !values.length && options.length ) {\n\t\t\t\t\treturn jQuery( options[ index ] ).val();\n\t\t\t\t}\n\n\t\t\t\treturn values;\n\t\t\t},\n\n\t\t\tset: function( elem, value ) {\n\t\t\t\tvar values = jQuery.makeArray( value );\n\n\t\t\t\tjQuery(elem).find(\"option\").each(function() {\n\t\t\t\t\tthis.selected = jQuery.inArray( jQuery(this).val(), values ) >= 0;\n\t\t\t\t});\n\n\t\t\t\tif ( !values.length ) {\n\t\t\t\t\telem.selectedIndex = -1;\n\t\t\t\t}\n\t\t\t\treturn values;\n\t\t\t}\n\t\t}\n\t},\n\n\tattrFn: {\n\t\tval: true,\n\t\tcss: true,\n\t\thtml: true,\n\t\ttext: true,\n\t\tdata: true,\n\t\twidth: true,\n\t\theight: true,\n\t\toffset: true\n\t},\n\t\n\tattrFix: {\n\t\t// Always normalize to ensure hook usage\n\t\ttabindex: \"tabIndex\"\n\t},\n\t\n\tattr: function( elem, name, value, pass ) {\n\t\tvar nType = elem.nodeType;\n\t\t\n\t\t// don't get/set attributes on text, comment and attribute nodes\n\t\tif ( !elem || nType === 3 || nType === 8 || nType === 2 ) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\tif ( pass && name in jQuery.attrFn ) {\n\t\t\treturn jQuery( elem )[ name ]( value );\n\t\t}\n\n\t\t// Fallback to prop when attributes are not supported\n\t\tif ( !(\"getAttribute\" in elem) ) {\n\t\t\treturn jQuery.prop( elem, name, value );\n\t\t}\n\n\t\tvar ret, hooks,\n\t\t\tnotxml = nType !== 1 || !jQuery.isXMLDoc( elem );\n\n\t\t// Normalize the name if needed\n\t\tname = notxml && jQuery.attrFix[ name ] || name;\n\n\t\thooks = jQuery.attrHooks[ name ];\n\n\t\tif ( !hooks ) {\n\t\t\t// Use boolHook for boolean attributes\n\t\t\tif ( rboolean.test( name ) &&\n\t\t\t\t(typeof value === \"boolean\" || value === undefined || value.toLowerCase() === name.toLowerCase()) ) {\n\n\t\t\t\thooks = boolHook;\n\n\t\t\t// Use formHook for forms and if the name contains certain characters\n\t\t\t} else if ( formHook && (jQuery.nodeName( elem, \"form\" ) || rinvalidChar.test( name )) ) {\n\t\t\t\thooks = formHook;\n\t\t\t}\n\t\t}\n\n\t\tif ( value !== undefined ) {\n\n\t\t\tif ( value === null ) {\n\t\t\t\tjQuery.removeAttr( elem, name );\n\t\t\t\treturn undefined;\n\n\t\t\t} else if ( hooks && \"set\" in hooks && notxml && (ret = hooks.set( elem, value, name )) !== undefined ) {\n\t\t\t\treturn ret;\n\n\t\t\t} else {\n\t\t\t\telem.setAttribute( name, \"\" + value );\n\t\t\t\treturn value;\n\t\t\t}\n\n\t\t} else if ( hooks && \"get\" in hooks && notxml ) {\n\t\t\treturn hooks.get( elem, name );\n\n\t\t} else {\n\n\t\t\tret = elem.getAttribute( name );\n\n\t\t\t// Non-existent attributes return null, we normalize to undefined\n\t\t\treturn ret === null ?\n\t\t\t\tundefined :\n\t\t\t\tret;\n\t\t}\n\t},\n\n\tremoveAttr: function( elem, name ) {\n\t\tvar propName;\n\t\tif ( elem.nodeType === 1 ) {\n\t\t\tname = jQuery.attrFix[ name ] || name;\n\t\t\n\t\t\tif ( jQuery.support.getSetAttribute ) {\n\t\t\t\t// Use removeAttribute in browsers that support it\n\t\t\t\telem.removeAttribute( name );\n\t\t\t} else {\n\t\t\t\tjQuery.attr( elem, name, \"\" );\n\t\t\t\telem.removeAttributeNode( elem.getAttributeNode( name ) );\n\t\t\t}\n\n\t\t\t// Set corresponding property to false for boolean attributes\n\t\t\tif ( rboolean.test( name ) && (propName = jQuery.propFix[ name ] || name) in elem ) {\n\t\t\t\telem[ propName ] = false;\n\t\t\t}\n\t\t}\n\t},\n\n\tattrHooks: {\n\t\ttype: {\n\t\t\tset: function( elem, value ) {\n\t\t\t\t// We can't allow the type property to be changed (since it causes problems in IE)\n\t\t\t\tif ( rtype.test( elem.nodeName ) && elem.parentNode ) {\n\t\t\t\t\tjQuery.error( \"type property can't be changed\" );\n\t\t\t\t} else if ( !jQuery.support.radioValue && value === \"radio\" && jQuery.nodeName(elem, \"input\") ) {\n\t\t\t\t\t// Setting the type on a radio button after the value resets the value in IE6-9\n\t\t\t\t\t// Reset value to it's default in case type is set after value\n\t\t\t\t\t// This is for element creation\n\t\t\t\t\tvar val = elem.value;\n\t\t\t\t\telem.setAttribute( \"type\", value );\n\t\t\t\t\tif ( val ) {\n\t\t\t\t\t\telem.value = val;\n\t\t\t\t\t}\n\t\t\t\t\treturn value;\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\ttabIndex: {\n\t\t\tget: function( elem ) {\n\t\t\t\t// elem.tabIndex doesn't always return the correct value when it hasn't been explicitly set\n\t\t\t\t// http://fluidproject.org/blog/2008/01/09/getting-setting-and-removing-tabindex-values-with-javascript/\n\t\t\t\tvar attributeNode = elem.getAttributeNode(\"tabIndex\");\n\n\t\t\t\treturn attributeNode && attributeNode.specified ?\n\t\t\t\t\tparseInt( attributeNode.value, 10 ) :\n\t\t\t\t\trfocusable.test( elem.nodeName ) || rclickable.test( elem.nodeName ) && elem.href ?\n\t\t\t\t\t\t0 :\n\t\t\t\t\t\tundefined;\n\t\t\t}\n\t\t}\n\t},\n\n\tpropFix: {\n\t\ttabindex: \"tabIndex\",\n\t\treadonly: \"readOnly\",\n\t\t\"for\": \"htmlFor\",\n\t\t\"class\": \"className\",\n\t\tmaxlength: \"maxLength\",\n\t\tcellspacing: \"cellSpacing\",\n\t\tcellpadding: \"cellPadding\",\n\t\trowspan: \"rowSpan\",\n\t\tcolspan: \"colSpan\",\n\t\tusemap: \"useMap\",\n\t\tframeborder: \"frameBorder\",\n\t\tcontenteditable: \"contentEditable\"\n\t},\n\t\n\tprop: function( elem, name, value ) {\n\t\tvar nType = elem.nodeType;\n\n\t\t// don't get/set properties on text, comment and attribute nodes\n\t\tif ( !elem || nType === 3 || nType === 8 || nType === 2 ) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\tvar ret, hooks,\n\t\t\tnotxml = nType !== 1 || !jQuery.isXMLDoc( elem );\n\n\t\t// Try to normalize/fix the name\n\t\tname = notxml && jQuery.propFix[ name ] || name;\n\t\t\n\t\thooks = jQuery.propHooks[ name ];\n\n\t\tif ( value !== undefined ) {\n\t\t\tif ( hooks && \"set\" in hooks && (ret = hooks.set( elem, value, name )) !== undefined ) {\n\t\t\t\treturn ret;\n\n\t\t\t} else {\n\t\t\t\treturn (elem[ name ] = value);\n\t\t\t}\n\n\t\t} else {\n\t\t\tif ( hooks && \"get\" in hooks && (ret = hooks.get( elem, name )) !== undefined ) {\n\t\t\t\treturn ret;\n\n\t\t\t} else {\n\t\t\t\treturn elem[ name ];\n\t\t\t}\n\t\t}\n\t},\n\t\n\tpropHooks: {}\n});\n\n// Hook for boolean attributes\nboolHook = {\n\tget: function( elem, name ) {\n\t\t// Align boolean attributes with corresponding properties\n\t\treturn elem[ jQuery.propFix[ name ] || name ] ?\n\t\t\tname.toLowerCase() :\n\t\t\tundefined;\n\t},\n\tset: function( elem, value, name ) {\n\t\tvar propName;\n\t\tif ( value === false ) {\n\t\t\t// Remove boolean attributes when set to false\n\t\t\tjQuery.removeAttr( elem, name );\n\t\t} else {\n\t\t\t// value is true since we know at this point it's type boolean and not false\n\t\t\t// Set boolean attributes to the same name and set the DOM property\n\t\t\tpropName = jQuery.propFix[ name ] || name;\n\t\t\tif ( propName in elem ) {\n\t\t\t\t// Only set the IDL specifically if it already exists on the element\n\t\t\t\telem[ propName ] = value;\n\t\t\t}\n\n\t\t\telem.setAttribute( name, name.toLowerCase() );\n\t\t}\n\t\treturn name;\n\t}\n};\n\n// Use the value property for back compat\n// Use the formHook for button elements in IE6/7 (#1954)\njQuery.attrHooks.value = {\n\tget: function( elem, name ) {\n\t\tif ( formHook && jQuery.nodeName( elem, \"button\" ) ) {\n\t\t\treturn formHook.get( elem, name );\n\t\t}\n\t\treturn elem.value;\n\t},\n\tset: function( elem, value, name ) {\n\t\tif ( formHook && jQuery.nodeName( elem, \"button\" ) ) {\n\t\t\treturn formHook.set( elem, value, name );\n\t\t}\n\t\t// Does not return so that setAttribute is also used\n\t\telem.value = value;\n\t}\n};\n\n// IE6/7 do not support getting/setting some attributes with get/setAttribute\nif ( !jQuery.support.getSetAttribute ) {\n\n\t// propFix is more comprehensive and contains all fixes\n\tjQuery.attrFix = jQuery.propFix;\n\t\n\t// Use this for any attribute on a form in IE6/7\n\tformHook = jQuery.attrHooks.name = jQuery.valHooks.button = {\n\t\tget: function( elem, name ) {\n\t\t\tvar ret;\n\t\t\tret = elem.getAttributeNode( name );\n\t\t\t// Return undefined if nodeValue is empty string\n\t\t\treturn ret && ret.nodeValue !== \"\" ?\n\t\t\t\tret.nodeValue :\n\t\t\t\tundefined;\n\t\t},\n\t\tset: function( elem, value, name ) {\n\t\t\t// Check form objects in IE (multiple bugs related)\n\t\t\t// Only use nodeValue if the attribute node exists on the form\n\t\t\tvar ret = elem.getAttributeNode( name );\n\t\t\tif ( ret ) {\n\t\t\t\tret.nodeValue = value;\n\t\t\t\treturn value;\n\t\t\t}\n\t\t}\n\t};\n\n\t// Set width and height to auto instead of 0 on empty string( Bug #8150 )\n\t// This is for removals\n\tjQuery.each([ \"width\", \"height\" ], function( i, name ) {\n\t\tjQuery.attrHooks[ name ] = jQuery.extend( jQuery.attrHooks[ name ], {\n\t\t\tset: function( elem, value ) {\n\t\t\t\tif ( value === \"\" ) {\n\t\t\t\t\telem.setAttribute( name, \"auto\" );\n\t\t\t\t\treturn value;\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t});\n}\n\n\n// Some attributes require a special call on IE\nif ( !jQuery.support.hrefNormalized ) {\n\tjQuery.each([ \"href\", \"src\", \"width\", \"height\" ], function( i, name ) {\n\t\tjQuery.attrHooks[ name ] = jQuery.extend( jQuery.attrHooks[ name ], {\n\t\t\tget: function( elem ) {\n\t\t\t\tvar ret = elem.getAttribute( name, 2 );\n\t\t\t\treturn ret === null ? undefined : ret;\n\t\t\t}\n\t\t});\n\t});\n}\n\nif ( !jQuery.support.style ) {\n\tjQuery.attrHooks.style = {\n\t\tget: function( elem ) {\n\t\t\t// Return undefined in the case of empty string\n\t\t\t// Normalize to lowercase since IE uppercases css property names\n\t\t\treturn elem.style.cssText.toLowerCase() || undefined;\n\t\t},\n\t\tset: function( elem, value ) {\n\t\t\treturn (elem.style.cssText = \"\" + value);\n\t\t}\n\t};\n}\n\n// Safari mis-reports the default selected property of an option\n// Accessing the parent's selectedIndex property fixes it\nif ( !jQuery.support.optSelected ) {\n\tjQuery.propHooks.selected = jQuery.extend( jQuery.propHooks.selected, {\n\t\tget: function( elem ) {\n\t\t\tvar parent = elem.parentNode;\n\n\t\t\tif ( parent ) {\n\t\t\t\tparent.selectedIndex;\n\n\t\t\t\t// Make sure that it also works with optgroups, see #5701\n\t\t\t\tif ( parent.parentNode ) {\n\t\t\t\t\tparent.parentNode.selectedIndex;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t});\n}\n\n// Radios and checkboxes getter/setter\nif ( !jQuery.support.checkOn ) {\n\tjQuery.each([ \"radio\", \"checkbox\" ], function() {\n\t\tjQuery.valHooks[ this ] = {\n\t\t\tget: function( elem ) {\n\t\t\t\t// Handle the case where in Webkit \"\" is returned instead of \"on\" if a value isn't specified\n\t\t\t\treturn elem.getAttribute(\"value\") === null ? \"on\" : elem.value;\n\t\t\t}\n\t\t};\n\t});\n}\njQuery.each([ \"radio\", \"checkbox\" ], function() {\n\tjQuery.valHooks[ this ] = jQuery.extend( jQuery.valHooks[ this ], {\n\t\tset: function( elem, value ) {\n\t\t\tif ( jQuery.isArray( value ) ) {\n\t\t\t\treturn (elem.checked = jQuery.inArray( jQuery(elem).val(), value ) >= 0);\n\t\t\t}\n\t\t}\n\t});\n});\n\n\n\n\nvar hasOwn = Object.prototype.hasOwnProperty,\n\trnamespaces = /\\.(.*)$/,\n\trformElems = /^(?:textarea|input|select)$/i,\n\trperiod = /\\./g,\n\trspaces = / /g,\n\trescape = /[^\\w\\s.|`]/g,\n\tfcleanup = function( nm ) {\n\t\treturn nm.replace(rescape, \"\\\\$&\");\n\t};\n\n/*\n * A number of helper functions used for managing events.\n * Many of the ideas behind this code originated from\n * Dean Edwards' addEvent library.\n */\njQuery.event = {\n\n\t// Bind an event to an element\n\t// Original by Dean Edwards\n\tadd: function( elem, types, handler, data ) {\n\t\tif ( elem.nodeType === 3 || elem.nodeType === 8 ) {\n\t\t\treturn;\n\t\t}\n\n\t\tif ( handler === false ) {\n\t\t\thandler = returnFalse;\n\t\t} else if ( !handler ) {\n\t\t\t// Fixes bug #7229. Fix recommended by jdalton\n\t\t\treturn;\n\t\t}\n\n\t\tvar handleObjIn, handleObj;\n\n\t\tif ( handler.handler ) {\n\t\t\thandleObjIn = handler;\n\t\t\thandler = handleObjIn.handler;\n\t\t}\n\n\t\t// Make sure that the function being executed has a unique ID\n\t\tif ( !handler.guid ) {\n\t\t\thandler.guid = jQuery.guid++;\n\t\t}\n\n\t\t// Init the element's event structure\n\t\tvar elemData = jQuery._data( elem );\n\n\t\t// If no elemData is found then we must be trying to bind to one of the\n\t\t// banned noData elements\n\t\tif ( !elemData ) {\n\t\t\treturn;\n\t\t}\n\n\t\tvar events = elemData.events,\n\t\t\teventHandle = elemData.handle;\n\n\t\tif ( !events ) {\n\t\t\telemData.events = events = {};\n\t\t}\n\n\t\tif ( !eventHandle ) {\n\t\t\telemData.handle = eventHandle = function( e ) {\n\t\t\t\t// Discard the second event of a jQuery.event.trigger() and\n\t\t\t\t// when an event is called after a page has unloaded\n\t\t\t\treturn typeof jQuery !== \"undefined\" && (!e || jQuery.event.triggered !== e.type) ?\n\t\t\t\t\tjQuery.event.handle.apply( eventHandle.elem, arguments ) :\n\t\t\t\t\tundefined;\n\t\t\t};\n\t\t}\n\n\t\t// Add elem as a property of the handle function\n\t\t// This is to prevent a memory leak with non-native events in IE.\n\t\teventHandle.elem = elem;\n\n\t\t// Handle multiple events separated by a space\n\t\t// jQuery(...).bind(\"mouseover mouseout\", fn);\n\t\ttypes = types.split(\" \");\n\n\t\tvar type, i = 0, namespaces;\n\n\t\twhile ( (type = types[ i++ ]) ) {\n\t\t\thandleObj = handleObjIn ?\n\t\t\t\tjQuery.extend({}, handleObjIn) :\n\t\t\t\t{ handler: handler, data: data };\n\n\t\t\t// Namespaced event handlers\n\t\t\tif ( type.indexOf(\".\") > -1 ) {\n\t\t\t\tnamespaces = type.split(\".\");\n\t\t\t\ttype = namespaces.shift();\n\t\t\t\thandleObj.namespace = namespaces.slice(0).sort().join(\".\");\n\n\t\t\t} else {\n\t\t\t\tnamespaces = [];\n\t\t\t\thandleObj.namespace = \"\";\n\t\t\t}\n\n\t\t\thandleObj.type = type;\n\t\t\tif ( !handleObj.guid ) {\n\t\t\t\thandleObj.guid = handler.guid;\n\t\t\t}\n\n\t\t\t// Get the current list of functions bound to this event\n\t\t\tvar handlers = events[ type ],\n\t\t\t\tspecial = jQuery.event.special[ type ] || {};\n\n\t\t\t// Init the event handler queue\n\t\t\tif ( !handlers ) {\n\t\t\t\thandlers = events[ type ] = [];\n\n\t\t\t\t// Check for a special event handler\n\t\t\t\t// Only use addEventListener/attachEvent if the special\n\t\t\t\t// events handler returns false\n\t\t\t\tif ( !special.setup || special.setup.call( elem, data, namespaces, eventHandle ) === false ) {\n\t\t\t\t\t// Bind the global event handler to the element\n\t\t\t\t\tif ( elem.addEventListener ) {\n\t\t\t\t\t\telem.addEventListener( type, eventHandle, false );\n\n\t\t\t\t\t} else if ( elem.attachEvent ) {\n\t\t\t\t\t\telem.attachEvent( \"on\" + type, eventHandle );\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif ( special.add ) {\n\t\t\t\tspecial.add.call( elem, handleObj );\n\n\t\t\t\tif ( !handleObj.handler.guid ) {\n\t\t\t\t\thandleObj.handler.guid = handler.guid;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Add the function to the element's handler list\n\t\t\thandlers.push( handleObj );\n\n\t\t\t// Keep track of which events have been used, for event optimization\n\t\t\tjQuery.event.global[ type ] = true;\n\t\t}\n\n\t\t// Nullify elem to prevent memory leaks in IE\n\t\telem = null;\n\t},\n\n\tglobal: {},\n\n\t// Detach an event or set of events from an element\n\tremove: function( elem, types, handler, pos ) {\n\t\t// don't do events on text and comment nodes\n\t\tif ( elem.nodeType === 3 || elem.nodeType === 8 ) {\n\t\t\treturn;\n\t\t}\n\n\t\tif ( handler === false ) {\n\t\t\thandler = returnFalse;\n\t\t}\n\n\t\tvar ret, type, fn, j, i = 0, all, namespaces, namespace, special, eventType, handleObj, origType,\n\t\t\telemData = jQuery.hasData( elem ) && jQuery._data( elem ),\n\t\t\tevents = elemData && elemData.events;\n\n\t\tif ( !elemData || !events ) {\n\t\t\treturn;\n\t\t}\n\n\t\t// types is actually an event object here\n\t\tif ( types && types.type ) {\n\t\t\thandler = types.handler;\n\t\t\ttypes = types.type;\n\t\t}\n\n\t\t// Unbind all events for the element\n\t\tif ( !types || typeof types === \"string\" && types.charAt(0) === \".\" ) {\n\t\t\ttypes = types || \"\";\n\n\t\t\tfor ( type in events ) {\n\t\t\t\tjQuery.event.remove( elem, type + types );\n\t\t\t}\n\n\t\t\treturn;\n\t\t}\n\n\t\t// Handle multiple events separated by a space\n\t\t// jQuery(...).unbind(\"mouseover mouseout\", fn);\n\t\ttypes = types.split(\" \");\n\n\t\twhile ( (type = types[ i++ ]) ) {\n\t\t\torigType = type;\n\t\t\thandleObj = null;\n\t\t\tall = type.indexOf(\".\") < 0;\n\t\t\tnamespaces = [];\n\n\t\t\tif ( !all ) {\n\t\t\t\t// Namespaced event handlers\n\t\t\t\tnamespaces = type.split(\".\");\n\t\t\t\ttype = namespaces.shift();\n\n\t\t\t\tnamespace = new RegExp(\"(^|\\\\.)\" +\n\t\t\t\t\tjQuery.map( namespaces.slice(0).sort(), fcleanup ).join(\"\\\\.(?:.*\\\\.)?\") + \"(\\\\.|$)\");\n\t\t\t}\n\n\t\t\teventType = events[ type ];\n\n\t\t\tif ( !eventType ) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif ( !handler ) {\n\t\t\t\tfor ( j = 0; j < eventType.length; j++ ) {\n\t\t\t\t\thandleObj = eventType[ j ];\n\n\t\t\t\t\tif ( all || namespace.test( handleObj.namespace ) ) {\n\t\t\t\t\t\tjQuery.event.remove( elem, origType, handleObj.handler, j );\n\t\t\t\t\t\teventType.splice( j--, 1 );\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tspecial = jQuery.event.special[ type ] || {};\n\n\t\t\tfor ( j = pos || 0; j < eventType.length; j++ ) {\n\t\t\t\thandleObj = eventType[ j ];\n\n\t\t\t\tif ( handler.guid === handleObj.guid ) {\n\t\t\t\t\t// remove the given handler for the given type\n\t\t\t\t\tif ( all || namespace.test( handleObj.namespace ) ) {\n\t\t\t\t\t\tif ( pos == null ) {\n\t\t\t\t\t\t\teventType.splice( j--, 1 );\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif ( special.remove ) {\n\t\t\t\t\t\t\tspecial.remove.call( elem, handleObj );\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif ( pos != null ) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// remove generic event handler if no more handlers exist\n\t\t\tif ( eventType.length === 0 || pos != null && eventType.length === 1 ) {\n\t\t\t\tif ( !special.teardown || special.teardown.call( elem, namespaces ) === false ) {\n\t\t\t\t\tjQuery.removeEvent( elem, type, elemData.handle );\n\t\t\t\t}\n\n\t\t\t\tret = null;\n\t\t\t\tdelete events[ type ];\n\t\t\t}\n\t\t}\n\n\t\t// Remove the expando if it's no longer used\n\t\tif ( jQuery.isEmptyObject( events ) ) {\n\t\t\tvar handle = elemData.handle;\n\t\t\tif ( handle ) {\n\t\t\t\thandle.elem = null;\n\t\t\t}\n\n\t\t\tdelete elemData.events;\n\t\t\tdelete elemData.handle;\n\n\t\t\tif ( jQuery.isEmptyObject( elemData ) ) {\n\t\t\t\tjQuery.removeData( elem, undefined, true );\n\t\t\t}\n\t\t}\n\t},\n\t\n\t// Events that are safe to short-circuit if no handlers are attached.\n\t// Native DOM events should not be added, they may have inline handlers.\n\tcustomEvent: {\n\t\t\"getData\": true,\n\t\t\"setData\": true,\n\t\t\"changeData\": true\n\t},\n\n\ttrigger: function( event, data, elem, onlyHandlers ) {\n\t\t// Event object or event type\n\t\tvar type = event.type || event,\n\t\t\tnamespaces = [],\n\t\t\texclusive;\n\n\t\tif ( type.indexOf(\"!\") >= 0 ) {\n\t\t\t// Exclusive events trigger only for the exact event (no namespaces)\n\t\t\ttype = type.slice(0, -1);\n\t\t\texclusive = true;\n\t\t}\n\n\t\tif ( type.indexOf(\".\") >= 0 ) {\n\t\t\t// Namespaced trigger; create a regexp to match event type in handle()\n\t\t\tnamespaces = type.split(\".\");\n\t\t\ttype = namespaces.shift();\n\t\t\tnamespaces.sort();\n\t\t}\n\n\t\tif ( (!elem || jQuery.event.customEvent[ type ]) && !jQuery.event.global[ type ] ) {\n\t\t\t// No jQuery handlers for this event type, and it can't have inline handlers\n\t\t\treturn;\n\t\t}\n\n\t\t// Caller can pass in an Event, Object, or just an event type string\n\t\tevent = typeof event === \"object\" ?\n\t\t\t// jQuery.Event object\n\t\t\tevent[ jQuery.expando ] ? event :\n\t\t\t// Object literal\n\t\t\tnew jQuery.Event( type, event ) :\n\t\t\t// Just the event type (string)\n\t\t\tnew jQuery.Event( type );\n\n\t\tevent.type = type;\n\t\tevent.exclusive = exclusive;\n\t\tevent.namespace = namespaces.join(\".\");\n\t\tevent.namespace_re = new RegExp(\"(^|\\\\.)\" + namespaces.join(\"\\\\.(?:.*\\\\.)?\") + \"(\\\\.|$)\");\n\t\t\n\t\t// triggerHandler() and global events don't bubble or run the default action\n\t\tif ( onlyHandlers || !elem ) {\n\t\t\tevent.preventDefault();\n\t\t\tevent.stopPropagation();\n\t\t}\n\n\t\t// Handle a global trigger\n\t\tif ( !elem ) {\n\t\t\t// TODO: Stop taunting the data cache; remove global events and always attach to document\n\t\t\tjQuery.each( jQuery.cache, function() {\n\t\t\t\t// internalKey variable is just used to make it easier to find\n\t\t\t\t// and potentially change this stuff later; currently it just\n\t\t\t\t// points to jQuery.expando\n\t\t\t\tvar internalKey = jQuery.expando,\n\t\t\t\t\tinternalCache = this[ internalKey ];\n\t\t\t\tif ( internalCache && internalCache.events && internalCache.events[ type ] ) {\n\t\t\t\t\tjQuery.event.trigger( event, data, internalCache.handle.elem );\n\t\t\t\t}\n\t\t\t});\n\t\t\treturn;\n\t\t}\n\n\t\t// Don't do events on text and comment nodes\n\t\tif ( elem.nodeType === 3 || elem.nodeType === 8 ) {\n\t\t\treturn;\n\t\t}\n\n\t\t// Clean up the event in case it is being reused\n\t\tevent.result = undefined;\n\t\tevent.target = elem;\n\n\t\t// Clone any incoming data and prepend the event, creating the handler arg list\n\t\tdata = data ? jQuery.makeArray( data ) : [];\n\t\tdata.unshift( event );\n\n\t\tvar cur = elem,\n\t\t\t// IE doesn't like method names with a colon (#3533, #8272)\n\t\t\tontype = type.indexOf(\":\") < 0 ? \"on\" + type : \"\";\n\n\t\t// Fire event on the current element, then bubble up the DOM tree\n\t\tdo {\n\t\t\tvar handle = jQuery._data( cur, \"handle\" );\n\n\t\t\tevent.currentTarget = cur;\n\t\t\tif ( handle ) {\n\t\t\t\thandle.apply( cur, data );\n\t\t\t}\n\n\t\t\t// Trigger an inline bound script\n\t\t\tif ( ontype && jQuery.acceptData( cur ) && cur[ ontype ] && cur[ ontype ].apply( cur, data ) === false ) {\n\t\t\t\tevent.result = false;\n\t\t\t\tevent.preventDefault();\n\t\t\t}\n\n\t\t\t// Bubble up to document, then to window\n\t\t\tcur = cur.parentNode || cur.ownerDocument || cur === event.target.ownerDocument && window;\n\t\t} while ( cur && !event.isPropagationStopped() );\n\n\t\t// If nobody prevented the default action, do it now\n\t\tif ( !event.isDefaultPrevented() ) {\n\t\t\tvar old,\n\t\t\t\tspecial = jQuery.event.special[ type ] || {};\n\n\t\t\tif ( (!special._default || special._default.call( elem.ownerDocument, event ) === false) &&\n\t\t\t\t!(type === \"click\" && jQuery.nodeName( elem, \"a\" )) && jQuery.acceptData( elem ) ) {\n\n\t\t\t\t// Call a native DOM method on the target with the same name name as the event.\n\t\t\t\t// Can't use an .isFunction)() check here because IE6/7 fails that test.\n\t\t\t\t// IE<9 dies on focus to hidden element (#1486), may want to revisit a try/catch.\n\t\t\t\ttry {\n\t\t\t\t\tif ( ontype && elem[ type ] ) {\n\t\t\t\t\t\t// Don't re-trigger an onFOO event when we call its FOO() method\n\t\t\t\t\t\told = elem[ ontype ];\n\n\t\t\t\t\t\tif ( old ) {\n\t\t\t\t\t\t\telem[ ontype ] = null;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tjQuery.event.triggered = type;\n\t\t\t\t\t\telem[ type ]();\n\t\t\t\t\t}\n\t\t\t\t} catch ( ieError ) {}\n\n\t\t\t\tif ( old ) {\n\t\t\t\t\telem[ ontype ] = old;\n\t\t\t\t}\n\n\t\t\t\tjQuery.event.triggered = undefined;\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn event.result;\n\t},\n\n\thandle: function( event ) {\n\t\tevent = jQuery.event.fix( event || window.event );\n\t\t// Snapshot the handlers list since a called handler may add/remove events.\n\t\tvar handlers = ((jQuery._data( this, \"events\" ) || {})[ event.type ] || []).slice(0),\n\t\t\trun_all = !event.exclusive && !event.namespace,\n\t\t\targs = Array.prototype.slice.call( arguments, 0 );\n\n\t\t// Use the fix-ed Event rather than the (read-only) native event\n\t\targs[0] = event;\n\t\tevent.currentTarget = this;\n\n\t\tfor ( var j = 0, l = handlers.length; j < l; j++ ) {\n\t\t\tvar handleObj = handlers[ j ];\n\n\t\t\t// Triggered event must 1) be non-exclusive and have no namespace, or\n\t\t\t// 2) have namespace(s) a subset or equal to those in the bound event.\n\t\t\tif ( run_all || event.namespace_re.test( handleObj.namespace ) ) {\n\t\t\t\t// Pass in a reference to the handler function itself\n\t\t\t\t// So that we can later remove it\n\t\t\t\tevent.handler = handleObj.handler;\n\t\t\t\tevent.data = handleObj.data;\n\t\t\t\tevent.handleObj = handleObj;\n\n\t\t\t\tvar ret = handleObj.handler.apply( this, args );\n\n\t\t\t\tif ( ret !== undefined ) {\n\t\t\t\t\tevent.result = ret;\n\t\t\t\t\tif ( ret === false ) {\n\t\t\t\t\t\tevent.preventDefault();\n\t\t\t\t\t\tevent.stopPropagation();\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif ( event.isImmediatePropagationStopped() ) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn event.result;\n\t},\n\n\tprops: \"altKey attrChange attrName bubbles button cancelable charCode clientX clientY ctrlKey currentTarget data detail eventPhase fromElement handler keyCode layerX layerY metaKey newValue offsetX offsetY pageX pageY prevValue relatedNode relatedTarget screenX screenY shiftKey srcElement target toElement view wheelDelta which\".split(\" \"),\n\n\tfix: function( event ) {\n\t\tif ( event[ jQuery.expando ] ) {\n\t\t\treturn event;\n\t\t}\n\n\t\t// store a copy of the original event object\n\t\t// and \"clone\" to set read-only properties\n\t\tvar originalEvent = event;\n\t\tevent = jQuery.Event( originalEvent );\n\n\t\tfor ( var i = this.props.length, prop; i; ) {\n\t\t\tprop = this.props[ --i ];\n\t\t\tevent[ prop ] = originalEvent[ prop ];\n\t\t}\n\n\t\t// Fix target property, if necessary\n\t\tif ( !event.target ) {\n\t\t\t// Fixes #1925 where srcElement might not be defined either\n\t\t\tevent.target = event.srcElement || document;\n\t\t}\n\n\t\t// check if target is a textnode (safari)\n\t\tif ( event.target.nodeType === 3 ) {\n\t\t\tevent.target = event.target.parentNode;\n\t\t}\n\n\t\t// Add relatedTarget, if necessary\n\t\tif ( !event.relatedTarget && event.fromElement ) {\n\t\t\tevent.relatedTarget = event.fromElement === event.target ? event.toElement : event.fromElement;\n\t\t}\n\n\t\t// Calculate pageX/Y if missing and clientX/Y available\n\t\tif ( event.pageX == null && event.clientX != null ) {\n\t\t\tvar eventDocument = event.target.ownerDocument || document,\n\t\t\t\tdoc = eventDocument.documentElement,\n\t\t\t\tbody = eventDocument.body;\n\n\t\t\tevent.pageX = event.clientX + (doc && doc.scrollLeft || body && body.scrollLeft || 0) - (doc && doc.clientLeft || body && body.clientLeft || 0);\n\t\t\tevent.pageY = event.clientY + (doc && doc.scrollTop || body && body.scrollTop || 0) - (doc && doc.clientTop || body && body.clientTop || 0);\n\t\t}\n\n\t\t// Add which for key events\n\t\tif ( event.which == null && (event.charCode != null || event.keyCode != null) ) {\n\t\t\tevent.which = event.charCode != null ? event.charCode : event.keyCode;\n\t\t}\n\n\t\t// Add metaKey to non-Mac browsers (use ctrl for PC's and Meta for Macs)\n\t\tif ( !event.metaKey && event.ctrlKey ) {\n\t\t\tevent.metaKey = event.ctrlKey;\n\t\t}\n\n\t\t// Add which for click: 1 === left; 2 === middle; 3 === right\n\t\t// Note: button is not normalized, so don't use it\n\t\tif ( !event.which && event.button !== undefined ) {\n\t\t\tevent.which = (event.button & 1 ? 1 : ( event.button & 2 ? 3 : ( event.button & 4 ? 2 : 0 ) ));\n\t\t}\n\n\t\treturn event;\n\t},\n\n\t// Deprecated, use jQuery.guid instead\n\tguid: 1E8,\n\n\t// Deprecated, use jQuery.proxy instead\n\tproxy: jQuery.proxy,\n\n\tspecial: {\n\t\tready: {\n\t\t\t// Make sure the ready event is setup\n\t\t\tsetup: jQuery.bindReady,\n\t\t\tteardown: jQuery.noop\n\t\t},\n\n\t\tlive: {\n\t\t\tadd: function( handleObj ) {\n\t\t\t\tjQuery.event.add( this,\n\t\t\t\t\tliveConvert( handleObj.origType, handleObj.selector ),\n\t\t\t\t\tjQuery.extend({}, handleObj, {handler: liveHandler, guid: handleObj.handler.guid}) );\n\t\t\t},\n\n\t\t\tremove: function( handleObj ) {\n\t\t\t\tjQuery.event.remove( this, liveConvert( handleObj.origType, handleObj.selector ), handleObj );\n\t\t\t}\n\t\t},\n\n\t\tbeforeunload: {\n\t\t\tsetup: function( data, namespaces, eventHandle ) {\n\t\t\t\t// We only want to do this special case on windows\n\t\t\t\tif ( jQuery.isWindow( this ) ) {\n\t\t\t\t\tthis.onbeforeunload = eventHandle;\n\t\t\t\t}\n\t\t\t},\n\n\t\t\tteardown: function( namespaces, eventHandle ) {\n\t\t\t\tif ( this.onbeforeunload === eventHandle ) {\n\t\t\t\t\tthis.onbeforeunload = null;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n};\n\njQuery.removeEvent = document.removeEventListener ?\n\tfunction( elem, type, handle ) {\n\t\tif ( elem.removeEventListener ) {\n\t\t\telem.removeEventListener( type, handle, false );\n\t\t}\n\t} :\n\tfunction( elem, type, handle ) {\n\t\tif ( elem.detachEvent ) {\n\t\t\telem.detachEvent( \"on\" + type, handle );\n\t\t}\n\t};\n\njQuery.Event = function( src, props ) {\n\t// Allow instantiation without the 'new' keyword\n\tif ( !this.preventDefault ) {\n\t\treturn new jQuery.Event( src, props );\n\t}\n\n\t// Event object\n\tif ( src && src.type ) {\n\t\tthis.originalEvent = src;\n\t\tthis.type = src.type;\n\n\t\t// Events bubbling up the document may have been marked as prevented\n\t\t// by a handler lower down the tree; reflect the correct value.\n\t\tthis.isDefaultPrevented = (src.defaultPrevented || src.returnValue === false ||\n\t\t\tsrc.getPreventDefault && src.getPreventDefault()) ? returnTrue : returnFalse;\n\n\t// Event type\n\t} else {\n\t\tthis.type = src;\n\t}\n\n\t// Put explicitly provided properties onto the event object\n\tif ( props ) {\n\t\tjQuery.extend( this, props );\n\t}\n\n\t// timeStamp is buggy for some events on Firefox(#3843)\n\t// So we won't rely on the native value\n\tthis.timeStamp = jQuery.now();\n\n\t// Mark it as fixed\n\tthis[ jQuery.expando ] = true;\n};\n\nfunction returnFalse() {\n\treturn false;\n}\nfunction returnTrue() {\n\treturn true;\n}\n\n// jQuery.Event is based on DOM3 Events as specified by the ECMAScript Language Binding\n// http://www.w3.org/TR/2003/WD-DOM-Level-3-Events-20030331/ecma-script-binding.html\njQuery.Event.prototype = {\n\tpreventDefault: function() {\n\t\tthis.isDefaultPrevented = returnTrue;\n\n\t\tvar e = this.originalEvent;\n\t\tif ( !e ) {\n\t\t\treturn;\n\t\t}\n\n\t\t// if preventDefault exists run it on the original event\n\t\tif ( e.preventDefault ) {\n\t\t\te.preventDefault();\n\n\t\t// otherwise set the returnValue property of the original event to false (IE)\n\t\t} else {\n\t\t\te.returnValue = false;\n\t\t}\n\t},\n\tstopPropagation: function() {\n\t\tthis.isPropagationStopped = returnTrue;\n\n\t\tvar e = this.originalEvent;\n\t\tif ( !e ) {\n\t\t\treturn;\n\t\t}\n\t\t// if stopPropagation exists run it on the original event\n\t\tif ( e.stopPropagation ) {\n\t\t\te.stopPropagation();\n\t\t}\n\t\t// otherwise set the cancelBubble property of the original event to true (IE)\n\t\te.cancelBubble = true;\n\t},\n\tstopImmediatePropagation: function() {\n\t\tthis.isImmediatePropagationStopped = returnTrue;\n\t\tthis.stopPropagation();\n\t},\n\tisDefaultPrevented: returnFalse,\n\tisPropagationStopped: returnFalse,\n\tisImmediatePropagationStopped: returnFalse\n};\n\n// Checks if an event happened on an element within another element\n// Used in jQuery.event.special.mouseenter and mouseleave handlers\nvar withinElement = function( event ) {\n\t// Check if mouse(over|out) are still within the same parent element\n\tvar parent = event.relatedTarget;\n\n\t// set the correct event type\n\tevent.type = event.data;\n\n\t// Firefox sometimes assigns relatedTarget a XUL element\n\t// which we cannot access the parentNode property of\n\ttry {\n\n\t\t// Chrome does something similar, the parentNode property\n\t\t// can be accessed but is null.\n\t\tif ( parent && parent !== document && !parent.parentNode ) {\n\t\t\treturn;\n\t\t}\n\n\t\t// Traverse up the tree\n\t\twhile ( parent && parent !== this ) {\n\t\t\tparent = parent.parentNode;\n\t\t}\n\n\t\tif ( parent !== this ) {\n\t\t\t// handle event if we actually just moused on to a non sub-element\n\t\t\tjQuery.event.handle.apply( this, arguments );\n\t\t}\n\n\t// assuming we've left the element since we most likely mousedover a xul element\n\t} catch(e) { }\n},\n\n// In case of event delegation, we only need to rename the event.type,\n// liveHandler will take care of the rest.\ndelegate = function( event ) {\n\tevent.type = event.data;\n\tjQuery.event.handle.apply( this, arguments );\n};\n\n// Create mouseenter and mouseleave events\njQuery.each({\n\tmouseenter: \"mouseover\",\n\tmouseleave: \"mouseout\"\n}, function( orig, fix ) {\n\tjQuery.event.special[ orig ] = {\n\t\tsetup: function( data ) {\n\t\t\tjQuery.event.add( this, fix, data && data.selector ? delegate : withinElement, orig );\n\t\t},\n\t\tteardown: function( data ) {\n\t\t\tjQuery.event.remove( this, fix, data && data.selector ? delegate : withinElement );\n\t\t}\n\t};\n});\n\n// submit delegation\nif ( !jQuery.support.submitBubbles ) {\n\n\tjQuery.event.special.submit = {\n\t\tsetup: function( data, namespaces ) {\n\t\t\tif ( !jQuery.nodeName( this, \"form\" ) ) {\n\t\t\t\tjQuery.event.add(this, \"click.specialSubmit\", function( e ) {\n\t\t\t\t\tvar elem = e.target,\n\t\t\t\t\t\ttype = elem.type;\n\n\t\t\t\t\tif ( (type === \"submit\" || type === \"image\") && jQuery( elem ).closest(\"form\").length ) {\n\t\t\t\t\t\ttrigger( \"submit\", this, arguments );\n\t\t\t\t\t}\n\t\t\t\t});\n\n\t\t\t\tjQuery.event.add(this, \"keypress.specialSubmit\", function( e ) {\n\t\t\t\t\tvar elem = e.target,\n\t\t\t\t\t\ttype = elem.type;\n\n\t\t\t\t\tif ( (type === \"text\" || type === \"password\") && jQuery( elem ).closest(\"form\").length && e.keyCode === 13 ) {\n\t\t\t\t\t\ttrigger( \"submit\", this, arguments );\n\t\t\t\t\t}\n\t\t\t\t});\n\n\t\t\t} else {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t},\n\n\t\tteardown: function( namespaces ) {\n\t\t\tjQuery.event.remove( this, \".specialSubmit\" );\n\t\t}\n\t};\n\n}\n\n// change delegation, happens here so we have bind.\nif ( !jQuery.support.changeBubbles ) {\n\n\tvar changeFilters,\n\n\tgetVal = function( elem ) {\n\t\tvar type = elem.type, val = elem.value;\n\n\t\tif ( type === \"radio\" || type === \"checkbox\" ) {\n\t\t\tval = elem.checked;\n\n\t\t} else if ( type === \"select-multiple\" ) {\n\t\t\tval = elem.selectedIndex > -1 ?\n\t\t\t\tjQuery.map( elem.options, function( elem ) {\n\t\t\t\t\treturn elem.selected;\n\t\t\t\t}).join(\"-\") :\n\t\t\t\t\"\";\n\n\t\t} else if ( jQuery.nodeName( elem, \"select\" ) ) {\n\t\t\tval = elem.selectedIndex;\n\t\t}\n\n\t\treturn val;\n\t},\n\n\ttestChange = function testChange( e ) {\n\t\tvar elem = e.target, data, val;\n\n\t\tif ( !rformElems.test( elem.nodeName ) || elem.readOnly ) {\n\t\t\treturn;\n\t\t}\n\n\t\tdata = jQuery._data( elem, \"_change_data\" );\n\t\tval = getVal(elem);\n\n\t\t// the current data will be also retrieved by beforeactivate\n\t\tif ( e.type !== \"focusout\" || elem.type !== \"radio\" ) {\n\t\t\tjQuery._data( elem, \"_change_data\", val );\n\t\t}\n\n\t\tif ( data === undefined || val === data ) {\n\t\t\treturn;\n\t\t}\n\n\t\tif ( data != null || val ) {\n\t\t\te.type = \"change\";\n\t\t\te.liveFired = undefined;\n\t\t\tjQuery.event.trigger( e, arguments[1], elem );\n\t\t}\n\t};\n\n\tjQuery.event.special.change = {\n\t\tfilters: {\n\t\t\tfocusout: testChange,\n\n\t\t\tbeforedeactivate: testChange,\n\n\t\t\tclick: function( e ) {\n\t\t\t\tvar elem = e.target, type = jQuery.nodeName( elem, \"input\" ) ? elem.type : \"\";\n\n\t\t\t\tif ( type === \"radio\" || type === \"checkbox\" || jQuery.nodeName( elem, \"select\" ) ) {\n\t\t\t\t\ttestChange.call( this, e );\n\t\t\t\t}\n\t\t\t},\n\n\t\t\t// Change has to be called before submit\n\t\t\t// Keydown will be called before keypress, which is used in submit-event delegation\n\t\t\tkeydown: function( e ) {\n\t\t\t\tvar elem = e.target, type = jQuery.nodeName( elem, \"input\" ) ? elem.type : \"\";\n\n\t\t\t\tif ( (e.keyCode === 13 && !jQuery.nodeName( elem, \"textarea\" ) ) ||\n\t\t\t\t\t(e.keyCode === 32 && (type === \"checkbox\" || type === \"radio\")) ||\n\t\t\t\t\ttype === \"select-multiple\" ) {\n\t\t\t\t\ttestChange.call( this, e );\n\t\t\t\t}\n\t\t\t},\n\n\t\t\t// Beforeactivate happens also before the previous element is blurred\n\t\t\t// with this event you can't trigger a change event, but you can store\n\t\t\t// information\n\t\t\tbeforeactivate: function( e ) {\n\t\t\t\tvar elem = e.target;\n\t\t\t\tjQuery._data( elem, \"_change_data\", getVal(elem) );\n\t\t\t}\n\t\t},\n\n\t\tsetup: function( data, namespaces ) {\n\t\t\tif ( this.type === \"file\" ) {\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tfor ( var type in changeFilters ) {\n\t\t\t\tjQuery.event.add( this, type + \".specialChange\", changeFilters[type] );\n\t\t\t}\n\n\t\t\treturn rformElems.test( this.nodeName );\n\t\t},\n\n\t\tteardown: function( namespaces ) {\n\t\t\tjQuery.event.remove( this, \".specialChange\" );\n\n\t\t\treturn rformElems.test( this.nodeName );\n\t\t}\n\t};\n\n\tchangeFilters = jQuery.event.special.change.filters;\n\n\t// Handle when the input is .focus()'d\n\tchangeFilters.focus = changeFilters.beforeactivate;\n}\n\nfunction trigger( type, elem, args ) {\n\t// Piggyback on a donor event to simulate a different one.\n\t// Fake originalEvent to avoid donor's stopPropagation, but if the\n\t// simulated event prevents default then we do the same on the donor.\n\t// Don't pass args or remember liveFired; they apply to the donor event.\n\tvar event = jQuery.extend( {}, args[ 0 ] );\n\tevent.type = type;\n\tevent.originalEvent = {};\n\tevent.liveFired = undefined;\n\tjQuery.event.handle.call( elem, event );\n\tif ( event.isDefaultPrevented() ) {\n\t\targs[ 0 ].preventDefault();\n\t}\n}\n\n// Create \"bubbling\" focus and blur events\nif ( !jQuery.support.focusinBubbles ) {\n\tjQuery.each({ focus: \"focusin\", blur: \"focusout\" }, function( orig, fix ) {\n\n\t\t// Attach a single capturing handler while someone wants focusin/focusout\n\t\tvar attaches = 0;\n\n\t\tjQuery.event.special[ fix ] = {\n\t\t\tsetup: function() {\n\t\t\t\tif ( attaches++ === 0 ) {\n\t\t\t\t\tdocument.addEventListener( orig, handler, true );\n\t\t\t\t}\n\t\t\t},\n\t\t\tteardown: function() {\n\t\t\t\tif ( --attaches === 0 ) {\n\t\t\t\t\tdocument.removeEventListener( orig, handler, true );\n\t\t\t\t}\n\t\t\t}\n\t\t};\n\n\t\tfunction handler( donor ) {\n\t\t\t// Donor event is always a native one; fix it and switch its type.\n\t\t\t// Let focusin/out handler cancel the donor focus/blur event.\n\t\t\tvar e = jQuery.event.fix( donor );\n\t\t\te.type = fix;\n\t\t\te.originalEvent = {};\n\t\t\tjQuery.event.trigger( e, null, e.target );\n\t\t\tif ( e.isDefaultPrevented() ) {\n\t\t\t\tdonor.preventDefault();\n\t\t\t}\n\t\t}\n\t});\n}\n\njQuery.each([\"bind\", \"one\"], function( i, name ) {\n\tjQuery.fn[ name ] = function( type, data, fn ) {\n\t\tvar handler;\n\n\t\t// Handle object literals\n\t\tif ( typeof type === \"object\" ) {\n\t\t\tfor ( var key in type ) {\n\t\t\t\tthis[ name ](key, data, type[key], fn);\n\t\t\t}\n\t\t\treturn this;\n\t\t}\n\n\t\tif ( arguments.length === 2 || data === false ) {\n\t\t\tfn = data;\n\t\t\tdata = undefined;\n\t\t}\n\n\t\tif ( name === \"one\" ) {\n\t\t\thandler = function( event ) {\n\t\t\t\tjQuery( this ).unbind( event, handler );\n\t\t\t\treturn fn.apply( this, arguments );\n\t\t\t};\n\t\t\thandler.guid = fn.guid || jQuery.guid++;\n\t\t} else {\n\t\t\thandler = fn;\n\t\t}\n\n\t\tif ( type === \"unload\" && name !== \"one\" ) {\n\t\t\tthis.one( type, data, fn );\n\n\t\t} else {\n\t\t\tfor ( var i = 0, l = this.length; i < l; i++ ) {\n\t\t\t\tjQuery.event.add( this[i], type, handler, data );\n\t\t\t}\n\t\t}\n\n\t\treturn this;\n\t};\n});\n\njQuery.fn.extend({\n\tunbind: function( type, fn ) {\n\t\t// Handle object literals\n\t\tif ( typeof type === \"object\" && !type.preventDefault ) {\n\t\t\tfor ( var key in type ) {\n\t\t\t\tthis.unbind(key, type[key]);\n\t\t\t}\n\n\t\t} else {\n\t\t\tfor ( var i = 0, l = this.length; i < l; i++ ) {\n\t\t\t\tjQuery.event.remove( this[i], type, fn );\n\t\t\t}\n\t\t}\n\n\t\treturn this;\n\t},\n\n\tdelegate: function( selector, types, data, fn ) {\n\t\treturn this.live( types, data, fn, selector );\n\t},\n\n\tundelegate: function( selector, types, fn ) {\n\t\tif ( arguments.length === 0 ) {\n\t\t\treturn this.unbind( \"live\" );\n\n\t\t} else {\n\t\t\treturn this.die( types, null, fn, selector );\n\t\t}\n\t},\n\n\ttrigger: function( type, data ) {\n\t\treturn this.each(function() {\n\t\t\tjQuery.event.trigger( type, data, this );\n\t\t});\n\t},\n\n\ttriggerHandler: function( type, data ) {\n\t\tif ( this[0] ) {\n\t\t\treturn jQuery.event.trigger( type, data, this[0], true );\n\t\t}\n\t},\n\n\ttoggle: function( fn ) {\n\t\t// Save reference to arguments for access in closure\n\t\tvar args = arguments,\n\t\t\tguid = fn.guid || jQuery.guid++,\n\t\t\ti = 0,\n\t\t\ttoggler = function( event ) {\n\t\t\t\t// Figure out which function to execute\n\t\t\t\tvar lastToggle = ( jQuery.data( this, \"lastToggle\" + fn.guid ) || 0 ) % i;\n\t\t\t\tjQuery.data( this, \"lastToggle\" + fn.guid, lastToggle + 1 );\n\n\t\t\t\t// Make sure that clicks stop\n\t\t\t\tevent.preventDefault();\n\n\t\t\t\t// and execute the function\n\t\t\t\treturn args[ lastToggle ].apply( this, arguments ) || false;\n\t\t\t};\n\n\t\t// link all the functions, so any of them can unbind this click handler\n\t\ttoggler.guid = guid;\n\t\twhile ( i < args.length ) {\n\t\t\targs[ i++ ].guid = guid;\n\t\t}\n\n\t\treturn this.click( toggler );\n\t},\n\n\thover: function( fnOver, fnOut ) {\n\t\treturn this.mouseenter( fnOver ).mouseleave( fnOut || fnOver );\n\t}\n});\n\nvar liveMap = {\n\tfocus: \"focusin\",\n\tblur: \"focusout\",\n\tmouseenter: \"mouseover\",\n\tmouseleave: \"mouseout\"\n};\n\njQuery.each([\"live\", \"die\"], function( i, name ) {\n\tjQuery.fn[ name ] = function( types, data, fn, origSelector /* Internal Use Only */ ) {\n\t\tvar type, i = 0, match, namespaces, preType,\n\t\t\tselector = origSelector || this.selector,\n\t\t\tcontext = origSelector ? this : jQuery( this.context );\n\n\t\tif ( typeof types === \"object\" && !types.preventDefault ) {\n\t\t\tfor ( var key in types ) {\n\t\t\t\tcontext[ name ]( key, data, types[key], selector );\n\t\t\t}\n\n\t\t\treturn this;\n\t\t}\n\n\t\tif ( name === \"die\" && !types &&\n\t\t\t\t\torigSelector && origSelector.charAt(0) === \".\" ) {\n\n\t\t\tcontext.unbind( origSelector );\n\n\t\t\treturn this;\n\t\t}\n\n\t\tif ( data === false || jQuery.isFunction( data ) ) {\n\t\t\tfn = data || returnFalse;\n\t\t\tdata = undefined;\n\t\t}\n\n\t\ttypes = (types || \"\").split(\" \");\n\n\t\twhile ( (type = types[ i++ ]) != null ) {\n\t\t\tmatch = rnamespaces.exec( type );\n\t\t\tnamespaces = \"\";\n\n\t\t\tif ( match ) {\n\t\t\t\tnamespaces = match[0];\n\t\t\t\ttype = type.replace( rnamespaces, \"\" );\n\t\t\t}\n\n\t\t\tif ( type === \"hover\" ) {\n\t\t\t\ttypes.push( \"mouseenter\" + namespaces, \"mouseleave\" + namespaces );\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tpreType = type;\n\n\t\t\tif ( liveMap[ type ] ) {\n\t\t\t\ttypes.push( liveMap[ type ] + namespaces );\n\t\t\t\ttype = type + namespaces;\n\n\t\t\t} else {\n\t\t\t\ttype = (liveMap[ type ] || type) + namespaces;\n\t\t\t}\n\n\t\t\tif ( name === \"live\" ) {\n\t\t\t\t// bind live handler\n\t\t\t\tfor ( var j = 0, l = context.length; j < l; j++ ) {\n\t\t\t\t\tjQuery.event.add( context[j], \"live.\" + liveConvert( type, selector ),\n\t\t\t\t\t\t{ data: data, selector: selector, handler: fn, origType: type, origHandler: fn, preType: preType } );\n\t\t\t\t}\n\n\t\t\t} else {\n\t\t\t\t// unbind live handler\n\t\t\t\tcontext.unbind( \"live.\" + liveConvert( type, selector ), fn );\n\t\t\t}\n\t\t}\n\n\t\treturn this;\n\t};\n});\n\nfunction liveHandler( event ) {\n\tvar stop, maxLevel, related, match, handleObj, elem, j, i, l, data, close, namespace, ret,\n\t\telems = [],\n\t\tselectors = [],\n\t\tevents = jQuery._data( this, \"events\" );\n\n\t// Make sure we avoid non-left-click bubbling in Firefox (#3861) and disabled elements in IE (#6911)\n\tif ( event.liveFired === this || !events || !events.live || event.target.disabled || event.button && event.type === \"click\" ) {\n\t\treturn;\n\t}\n\n\tif ( event.namespace ) {\n\t\tnamespace = new RegExp(\"(^|\\\\.)\" + event.namespace.split(\".\").join(\"\\\\.(?:.*\\\\.)?\") + \"(\\\\.|$)\");\n\t}\n\n\tevent.liveFired = this;\n\n\tvar live = events.live.slice(0);\n\n\tfor ( j = 0; j < live.length; j++ ) {\n\t\thandleObj = live[j];\n\n\t\tif ( handleObj.origType.replace( rnamespaces, \"\" ) === event.type ) {\n\t\t\tselectors.push( handleObj.selector );\n\n\t\t} else {\n\t\t\tlive.splice( j--, 1 );\n\t\t}\n\t}\n\n\tmatch = jQuery( event.target ).closest( selectors, event.currentTarget );\n\n\tfor ( i = 0, l = match.length; i < l; i++ ) {\n\t\tclose = match[i];\n\n\t\tfor ( j = 0; j < live.length; j++ ) {\n\t\t\thandleObj = live[j];\n\n\t\t\tif ( close.selector === handleObj.selector && (!namespace || namespace.test( handleObj.namespace )) && !close.elem.disabled ) {\n\t\t\t\telem = close.elem;\n\t\t\t\trelated = null;\n\n\t\t\t\t// Those two events require additional checking\n\t\t\t\tif ( handleObj.preType === \"mouseenter\" || handleObj.preType === \"mouseleave\" ) {\n\t\t\t\t\tevent.type = handleObj.preType;\n\t\t\t\t\trelated = jQuery( event.relatedTarget ).closest( handleObj.selector )[0];\n\n\t\t\t\t\t// Make sure not to accidentally match a child element with the same selector\n\t\t\t\t\tif ( related && jQuery.contains( elem, related ) ) {\n\t\t\t\t\t\trelated = elem;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif ( !related || related !== elem ) {\n\t\t\t\t\telems.push({ elem: elem, handleObj: handleObj, level: close.level });\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor ( i = 0, l = elems.length; i < l; i++ ) {\n\t\tmatch = elems[i];\n\n\t\tif ( maxLevel && match.level > maxLevel ) {\n\t\t\tbreak;\n\t\t}\n\n\t\tevent.currentTarget = match.elem;\n\t\tevent.data = match.handleObj.data;\n\t\tevent.handleObj = match.handleObj;\n\n\t\tret = match.handleObj.origHandler.apply( match.elem, arguments );\n\n\t\tif ( ret === false || event.isPropagationStopped() ) {\n\t\t\tmaxLevel = match.level;\n\n\t\t\tif ( ret === false ) {\n\t\t\t\tstop = false;\n\t\t\t}\n\t\t\tif ( event.isImmediatePropagationStopped() ) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn stop;\n}\n\nfunction liveConvert( type, selector ) {\n\treturn (type && type !== \"*\" ? type + \".\" : \"\") + selector.replace(rperiod, \"`\").replace(rspaces, \"&\");\n}\n\njQuery.each( (\"blur focus focusin focusout load resize scroll unload click dblclick \" +\n\t\"mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave \" +\n\t\"change select submit keydown keypress keyup error\").split(\" \"), function( i, name ) {\n\n\t// Handle event binding\n\tjQuery.fn[ name ] = function( data, fn ) {\n\t\tif ( fn == null ) {\n\t\t\tfn = data;\n\t\t\tdata = null;\n\t\t}\n\n\t\treturn arguments.length > 0 ?\n\t\t\tthis.bind( name, data, fn ) :\n\t\t\tthis.trigger( name );\n\t};\n\n\tif ( jQuery.attrFn ) {\n\t\tjQuery.attrFn[ name ] = true;\n\t}\n});\n\n\n\n/*!\n * Sizzle CSS Selector Engine\n * Copyright 2011, The Dojo Foundation\n * Released under the MIT, BSD, and GPL Licenses.\n * More information: http://sizzlejs.com/\n */\n(function(){\n\nvar chunker = /((?:\\((?:\\([^()]+\\)|[^()]+)+\\)|\\[(?:\\[[^\\[\\]]*\\]|['\"][^'\"]*['\"]|[^\\[\\]'\"]+)+\\]|\\\\.|[^ >+~,(\\[\\\\]+)+|[>+~])(\\s*,\\s*)?((?:.|\\r|\\n)*)/g,\n\tdone = 0,\n\ttoString = Object.prototype.toString,\n\thasDuplicate = false,\n\tbaseHasDuplicate = true,\n\trBackslash = /\\\\/g,\n\trNonWord = /\\W/;\n\n// Here we check if the JavaScript engine is using some sort of\n// optimization where it does not always call our comparision\n// function. If that is the case, discard the hasDuplicate value.\n// Thus far that includes Google Chrome.\n[0, 0].sort(function() {\n\tbaseHasDuplicate = false;\n\treturn 0;\n});\n\nvar Sizzle = function( selector, context, results, seed ) {\n\tresults = results || [];\n\tcontext = context || document;\n\n\tvar origContext = context;\n\n\tif ( context.nodeType !== 1 && context.nodeType !== 9 ) {\n\t\treturn [];\n\t}\n\t\n\tif ( !selector || typeof selector !== \"string\" ) {\n\t\treturn results;\n\t}\n\n\tvar m, set, checkSet, extra, ret, cur, pop, i,\n\t\tprune = true,\n\t\tcontextXML = Sizzle.isXML( context ),\n\t\tparts = [],\n\t\tsoFar = selector;\n\t\n\t// Reset the position of the chunker regexp (start from head)\n\tdo {\n\t\tchunker.exec( \"\" );\n\t\tm = chunker.exec( soFar );\n\n\t\tif ( m ) {\n\t\t\tsoFar = m[3];\n\t\t\n\t\t\tparts.push( m[1] );\n\t\t\n\t\t\tif ( m[2] ) {\n\t\t\t\textra = m[3];\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t} while ( m );\n\n\tif ( parts.length > 1 && origPOS.exec( selector ) ) {\n\n\t\tif ( parts.length === 2 && Expr.relative[ parts[0] ] ) {\n\t\t\tset = posProcess( parts[0] + parts[1], context );\n\n\t\t} else {\n\t\t\tset = Expr.relative[ parts[0] ] ?\n\t\t\t\t[ context ] :\n\t\t\t\tSizzle( parts.shift(), context );\n\n\t\t\twhile ( parts.length ) {\n\t\t\t\tselector = parts.shift();\n\n\t\t\t\tif ( Expr.relative[ selector ] ) {\n\t\t\t\t\tselector += parts.shift();\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tset = posProcess( selector, set );\n\t\t\t}\n\t\t}\n\n\t} else {\n\t\t// Take a shortcut and set the context if the root selector is an ID\n\t\t// (but not if it'll be faster if the inner selector is an ID)\n\t\tif ( !seed && parts.length > 1 && context.nodeType === 9 && !contextXML &&\n\t\t\t\tExpr.match.ID.test(parts[0]) && !Expr.match.ID.test(parts[parts.length - 1]) ) {\n\n\t\t\tret = Sizzle.find( parts.shift(), context, contextXML );\n\t\t\tcontext = ret.expr ?\n\t\t\t\tSizzle.filter( ret.expr, ret.set )[0] :\n\t\t\t\tret.set[0];\n\t\t}\n\n\t\tif ( context ) {\n\t\t\tret = seed ?\n\t\t\t\t{ expr: parts.pop(), set: makeArray(seed) } :\n\t\t\t\tSizzle.find( parts.pop(), parts.length === 1 && (parts[0] === \"~\" || parts[0] === \"+\") && context.parentNode ? context.parentNode : context, contextXML );\n\n\t\t\tset = ret.expr ?\n\t\t\t\tSizzle.filter( ret.expr, ret.set ) :\n\t\t\t\tret.set;\n\n\t\t\tif ( parts.length > 0 ) {\n\t\t\t\tcheckSet = makeArray( set );\n\n\t\t\t} else {\n\t\t\t\tprune = false;\n\t\t\t}\n\n\t\t\twhile ( parts.length ) {\n\t\t\t\tcur = parts.pop();\n\t\t\t\tpop = cur;\n\n\t\t\t\tif ( !Expr.relative[ cur ] ) {\n\t\t\t\t\tcur = \"\";\n\t\t\t\t} else {\n\t\t\t\t\tpop = parts.pop();\n\t\t\t\t}\n\n\t\t\t\tif ( pop == null ) {\n\t\t\t\t\tpop = context;\n\t\t\t\t}\n\n\t\t\t\tExpr.relative[ cur ]( checkSet, pop, contextXML );\n\t\t\t}\n\n\t\t} else {\n\t\t\tcheckSet = parts = [];\n\t\t}\n\t}\n\n\tif ( !checkSet ) {\n\t\tcheckSet = set;\n\t}\n\n\tif ( !checkSet ) {\n\t\tSizzle.error( cur || selector );\n\t}\n\n\tif ( toString.call(checkSet) === \"[object Array]\" ) {\n\t\tif ( !prune ) {\n\t\t\tresults.push.apply( results, checkSet );\n\n\t\t} else if ( context && context.nodeType === 1 ) {\n\t\t\tfor ( i = 0; checkSet[i] != null; i++ ) {\n\t\t\t\tif ( checkSet[i] && (checkSet[i] === true || checkSet[i].nodeType === 1 && Sizzle.contains(context, checkSet[i])) ) {\n\t\t\t\t\tresults.push( set[i] );\n\t\t\t\t}\n\t\t\t}\n\n\t\t} else {\n\t\t\tfor ( i = 0; checkSet[i] != null; i++ ) {\n\t\t\t\tif ( checkSet[i] && checkSet[i].nodeType === 1 ) {\n\t\t\t\t\tresults.push( set[i] );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t} else {\n\t\tmakeArray( checkSet, results );\n\t}\n\n\tif ( extra ) {\n\t\tSizzle( extra, origContext, results, seed );\n\t\tSizzle.uniqueSort( results );\n\t}\n\n\treturn results;\n};\n\nSizzle.uniqueSort = function( results ) {\n\tif ( sortOrder ) {\n\t\thasDuplicate = baseHasDuplicate;\n\t\tresults.sort( sortOrder );\n\n\t\tif ( hasDuplicate ) {\n\t\t\tfor ( var i = 1; i < results.length; i++ ) {\n\t\t\t\tif ( results[i] === results[ i - 1 ] ) {\n\t\t\t\t\tresults.splice( i--, 1 );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn results;\n};\n\nSizzle.matches = function( expr, set ) {\n\treturn Sizzle( expr, null, null, set );\n};\n\nSizzle.matchesSelector = function( node, expr ) {\n\treturn Sizzle( expr, null, null, [node] ).length > 0;\n};\n\nSizzle.find = function( expr, context, isXML ) {\n\tvar set;\n\n\tif ( !expr ) {\n\t\treturn [];\n\t}\n\n\tfor ( var i = 0, l = Expr.order.length; i < l; i++ ) {\n\t\tvar match,\n\t\t\ttype = Expr.order[i];\n\t\t\n\t\tif ( (match = Expr.leftMatch[ type ].exec( expr )) ) {\n\t\t\tvar left = match[1];\n\t\t\tmatch.splice( 1, 1 );\n\n\t\t\tif ( left.substr( left.length - 1 ) !== \"\\\\\" ) {\n\t\t\t\tmatch[1] = (match[1] || \"\").replace( rBackslash, \"\" );\n\t\t\t\tset = Expr.find[ type ]( match, context, isXML );\n\n\t\t\t\tif ( set != null ) {\n\t\t\t\t\texpr = expr.replace( Expr.match[ type ], \"\" );\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif ( !set ) {\n\t\tset = typeof context.getElementsByTagName !== \"undefined\" ?\n\t\t\tcontext.getElementsByTagName( \"*\" ) :\n\t\t\t[];\n\t}\n\n\treturn { set: set, expr: expr };\n};\n\nSizzle.filter = function( expr, set, inplace, not ) {\n\tvar match, anyFound,\n\t\told = expr,\n\t\tresult = [],\n\t\tcurLoop = set,\n\t\tisXMLFilter = set && set[0] && Sizzle.isXML( set[0] );\n\n\twhile ( expr && set.length ) {\n\t\tfor ( var type in Expr.filter ) {\n\t\t\tif ( (match = Expr.leftMatch[ type ].exec( expr )) != null && match[2] ) {\n\t\t\t\tvar found, item,\n\t\t\t\t\tfilter = Expr.filter[ type ],\n\t\t\t\t\tleft = match[1];\n\n\t\t\t\tanyFound = false;\n\n\t\t\t\tmatch.splice(1,1);\n\n\t\t\t\tif ( left.substr( left.length - 1 ) === \"\\\\\" ) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tif ( curLoop === result ) {\n\t\t\t\t\tresult = [];\n\t\t\t\t}\n\n\t\t\t\tif ( Expr.preFilter[ type ] ) {\n\t\t\t\t\tmatch = Expr.preFilter[ type ]( match, curLoop, inplace, result, not, isXMLFilter );\n\n\t\t\t\t\tif ( !match ) {\n\t\t\t\t\t\tanyFound = found = true;\n\n\t\t\t\t\t} else if ( match === true ) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif ( match ) {\n\t\t\t\t\tfor ( var i = 0; (item = curLoop[i]) != null; i++ ) {\n\t\t\t\t\t\tif ( item ) {\n\t\t\t\t\t\t\tfound = filter( item, match, i, curLoop );\n\t\t\t\t\t\t\tvar pass = not ^ !!found;\n\n\t\t\t\t\t\t\tif ( inplace && found != null ) {\n\t\t\t\t\t\t\t\tif ( pass ) {\n\t\t\t\t\t\t\t\t\tanyFound = true;\n\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\tcurLoop[i] = false;\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t} else if ( pass ) {\n\t\t\t\t\t\t\t\tresult.push( item );\n\t\t\t\t\t\t\t\tanyFound = true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif ( found !== undefined ) {\n\t\t\t\t\tif ( !inplace ) {\n\t\t\t\t\t\tcurLoop = result;\n\t\t\t\t\t}\n\n\t\t\t\t\texpr = expr.replace( Expr.match[ type ], \"\" );\n\n\t\t\t\t\tif ( !anyFound ) {\n\t\t\t\t\t\treturn [];\n\t\t\t\t\t}\n\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Improper expression\n\t\tif ( expr === old ) {\n\t\t\tif ( anyFound == null ) {\n\t\t\t\tSizzle.error( expr );\n\n\t\t\t} else {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\told = expr;\n\t}\n\n\treturn curLoop;\n};\n\nSizzle.error = function( msg ) {\n\tthrow \"Syntax error, unrecognized expression: \" + msg;\n};\n\nvar Expr = Sizzle.selectors = {\n\torder: [ \"ID\", \"NAME\", \"TAG\" ],\n\n\tmatch: {\n\t\tID: /#((?:[\\w\\u00c0-\\uFFFF\\-]|\\\\.)+)/,\n\t\tCLASS: /\\.((?:[\\w\\u00c0-\\uFFFF\\-]|\\\\.)+)/,\n\t\tNAME: /\\[name=['\"]*((?:[\\w\\u00c0-\\uFFFF\\-]|\\\\.)+)['\"]*\\]/,\n\t\tATTR: /\\[\\s*((?:[\\w\\u00c0-\\uFFFF\\-]|\\\\.)+)\\s*(?:(\\S?=)\\s*(?:(['\"])(.*?)\\3|(#?(?:[\\w\\u00c0-\\uFFFF\\-]|\\\\.)*)|)|)\\s*\\]/,\n\t\tTAG: /^((?:[\\w\\u00c0-\\uFFFF\\*\\-]|\\\\.)+)/,\n\t\tCHILD: /:(only|nth|last|first)-child(?:\\(\\s*(even|odd|(?:[+\\-]?\\d+|(?:[+\\-]?\\d*)?n\\s*(?:[+\\-]\\s*\\d+)?))\\s*\\))?/,\n\t\tPOS: /:(nth|eq|gt|lt|first|last|even|odd)(?:\\((\\d*)\\))?(?=[^\\-]|$)/,\n\t\tPSEUDO: /:((?:[\\w\\u00c0-\\uFFFF\\-]|\\\\.)+)(?:\\((['\"]?)((?:\\([^\\)]+\\)|[^\\(\\)]*)+)\\2\\))?/\n\t},\n\n\tleftMatch: {},\n\n\tattrMap: {\n\t\t\"class\": \"className\",\n\t\t\"for\": \"htmlFor\"\n\t},\n\n\tattrHandle: {\n\t\thref: function( elem ) {\n\t\t\treturn elem.getAttribute( \"href\" );\n\t\t},\n\t\ttype: function( elem ) {\n\t\t\treturn elem.getAttribute( \"type\" );\n\t\t}\n\t},\n\n\trelative: {\n\t\t\"+\": function(checkSet, part){\n\t\t\tvar isPartStr = typeof part === \"string\",\n\t\t\t\tisTag = isPartStr && !rNonWord.test( part ),\n\t\t\t\tisPartStrNotTag = isPartStr && !isTag;\n\n\t\t\tif ( isTag ) {\n\t\t\t\tpart = part.toLowerCase();\n\t\t\t}\n\n\t\t\tfor ( var i = 0, l = checkSet.length, elem; i < l; i++ ) {\n\t\t\t\tif ( (elem = checkSet[i]) ) {\n\t\t\t\t\twhile ( (elem = elem.previousSibling) && elem.nodeType !== 1 ) {}\n\n\t\t\t\t\tcheckSet[i] = isPartStrNotTag || elem && elem.nodeName.toLowerCase() === part ?\n\t\t\t\t\t\telem || false :\n\t\t\t\t\t\telem === part;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif ( isPartStrNotTag ) {\n\t\t\t\tSizzle.filter( part, checkSet, true );\n\t\t\t}\n\t\t},\n\n\t\t\">\": function( checkSet, part ) {\n\t\t\tvar elem,\n\t\t\t\tisPartStr = typeof part === \"string\",\n\t\t\t\ti = 0,\n\t\t\t\tl = checkSet.length;\n\n\t\t\tif ( isPartStr && !rNonWord.test( part ) ) {\n\t\t\t\tpart = part.toLowerCase();\n\n\t\t\t\tfor ( ; i < l; i++ ) {\n\t\t\t\t\telem = checkSet[i];\n\n\t\t\t\t\tif ( elem ) {\n\t\t\t\t\t\tvar parent = elem.parentNode;\n\t\t\t\t\t\tcheckSet[i] = parent.nodeName.toLowerCase() === part ? parent : false;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t} else {\n\t\t\t\tfor ( ; i < l; i++ ) {\n\t\t\t\t\telem = checkSet[i];\n\n\t\t\t\t\tif ( elem ) {\n\t\t\t\t\t\tcheckSet[i] = isPartStr ?\n\t\t\t\t\t\t\telem.parentNode :\n\t\t\t\t\t\t\telem.parentNode === part;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif ( isPartStr ) {\n\t\t\t\t\tSizzle.filter( part, checkSet, true );\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\n\t\t\"\": function(checkSet, part, isXML){\n\t\t\tvar nodeCheck,\n\t\t\t\tdoneName = done++,\n\t\t\t\tcheckFn = dirCheck;\n\n\t\t\tif ( typeof part === \"string\" && !rNonWord.test( part ) ) {\n\t\t\t\tpart = part.toLowerCase();\n\t\t\t\tnodeCheck = part;\n\t\t\t\tcheckFn = dirNodeCheck;\n\t\t\t}\n\n\t\t\tcheckFn( \"parentNode\", part, doneName, checkSet, nodeCheck, isXML );\n\t\t},\n\n\t\t\"~\": function( checkSet, part, isXML ) {\n\t\t\tvar nodeCheck,\n\t\t\t\tdoneName = done++,\n\t\t\t\tcheckFn = dirCheck;\n\n\t\t\tif ( typeof part === \"string\" && !rNonWord.test( part ) ) {\n\t\t\t\tpart = part.toLowerCase();\n\t\t\t\tnodeCheck = part;\n\t\t\t\tcheckFn = dirNodeCheck;\n\t\t\t}\n\n\t\t\tcheckFn( \"previousSibling\", part, doneName, checkSet, nodeCheck, isXML );\n\t\t}\n\t},\n\n\tfind: {\n\t\tID: function( match, context, isXML ) {\n\t\t\tif ( typeof context.getElementById !== \"undefined\" && !isXML ) {\n\t\t\t\tvar m = context.getElementById(match[1]);\n\t\t\t\t// Check parentNode to catch when Blackberry 4.6 returns\n\t\t\t\t// nodes that are no longer in the document #6963\n\t\t\t\treturn m && m.parentNode ? [m] : [];\n\t\t\t}\n\t\t},\n\n\t\tNAME: function( match, context ) {\n\t\t\tif ( typeof context.getElementsByName !== \"undefined\" ) {\n\t\t\t\tvar ret = [],\n\t\t\t\t\tresults = context.getElementsByName( match[1] );\n\n\t\t\t\tfor ( var i = 0, l = results.length; i < l; i++ ) {\n\t\t\t\t\tif ( results[i].getAttribute(\"name\") === match[1] ) {\n\t\t\t\t\t\tret.push( results[i] );\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\treturn ret.length === 0 ? null : ret;\n\t\t\t}\n\t\t},\n\n\t\tTAG: function( match, context ) {\n\t\t\tif ( typeof context.getElementsByTagName !== \"undefined\" ) {\n\t\t\t\treturn context.getElementsByTagName( match[1] );\n\t\t\t}\n\t\t}\n\t},\n\tpreFilter: {\n\t\tCLASS: function( match, curLoop, inplace, result, not, isXML ) {\n\t\t\tmatch = \" \" + match[1].replace( rBackslash, \"\" ) + \" \";\n\n\t\t\tif ( isXML ) {\n\t\t\t\treturn match;\n\t\t\t}\n\n\t\t\tfor ( var i = 0, elem; (elem = curLoop[i]) != null; i++ ) {\n\t\t\t\tif ( elem ) {\n\t\t\t\t\tif ( not ^ (elem.className && (\" \" + elem.className + \" \").replace(/[\\t\\n\\r]/g, \" \").indexOf(match) >= 0) ) {\n\t\t\t\t\t\tif ( !inplace ) {\n\t\t\t\t\t\t\tresult.push( elem );\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} else if ( inplace ) {\n\t\t\t\t\t\tcurLoop[i] = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn false;\n\t\t},\n\n\t\tID: function( match ) {\n\t\t\treturn match[1].replace( rBackslash, \"\" );\n\t\t},\n\n\t\tTAG: function( match, curLoop ) {\n\t\t\treturn match[1].replace( rBackslash, \"\" ).toLowerCase();\n\t\t},\n\n\t\tCHILD: function( match ) {\n\t\t\tif ( match[1] === \"nth\" ) {\n\t\t\t\tif ( !match[2] ) {\n\t\t\t\t\tSizzle.error( match[0] );\n\t\t\t\t}\n\n\t\t\t\tmatch[2] = match[2].replace(/^\\+|\\s*/g, '');\n\n\t\t\t\t// parse equations like 'even', 'odd', '5', '2n', '3n+2', '4n-1', '-n+6'\n\t\t\t\tvar test = /(-?)(\\d*)(?:n([+\\-]?\\d*))?/.exec(\n\t\t\t\t\tmatch[2] === \"even\" && \"2n\" || match[2] === \"odd\" && \"2n+1\" ||\n\t\t\t\t\t!/\\D/.test( match[2] ) && \"0n+\" + match[2] || match[2]);\n\n\t\t\t\t// calculate the numbers (first)n+(last) including if they are negative\n\t\t\t\tmatch[2] = (test[1] + (test[2] || 1)) - 0;\n\t\t\t\tmatch[3] = test[3] - 0;\n\t\t\t}\n\t\t\telse if ( match[2] ) {\n\t\t\t\tSizzle.error( match[0] );\n\t\t\t}\n\n\t\t\t// TODO: Move to normal caching system\n\t\t\tmatch[0] = done++;\n\n\t\t\treturn match;\n\t\t},\n\n\t\tATTR: function( match, curLoop, inplace, result, not, isXML ) {\n\t\t\tvar name = match[1] = match[1].replace( rBackslash, \"\" );\n\t\t\t\n\t\t\tif ( !isXML && Expr.attrMap[name] ) {\n\t\t\t\tmatch[1] = Expr.attrMap[name];\n\t\t\t}\n\n\t\t\t// Handle if an un-quoted value was used\n\t\t\tmatch[4] = ( match[4] || match[5] || \"\" ).replace( rBackslash, \"\" );\n\n\t\t\tif ( match[2] === \"~=\" ) {\n\t\t\t\tmatch[4] = \" \" + match[4] + \" \";\n\t\t\t}\n\n\t\t\treturn match;\n\t\t},\n\n\t\tPSEUDO: function( match, curLoop, inplace, result, not ) {\n\t\t\tif ( match[1] === \"not\" ) {\n\t\t\t\t// If we're dealing with a complex expression, or a simple one\n\t\t\t\tif ( ( chunker.exec(match[3]) || \"\" ).length > 1 || /^\\w/.test(match[3]) ) {\n\t\t\t\t\tmatch[3] = Sizzle(match[3], null, null, curLoop);\n\n\t\t\t\t} else {\n\t\t\t\t\tvar ret = Sizzle.filter(match[3], curLoop, inplace, true ^ not);\n\n\t\t\t\t\tif ( !inplace ) {\n\t\t\t\t\t\tresult.push.apply( result, ret );\n\t\t\t\t\t}\n\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t} else if ( Expr.match.POS.test( match[0] ) || Expr.match.CHILD.test( match[0] ) ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t\n\t\t\treturn match;\n\t\t},\n\n\t\tPOS: function( match ) {\n\t\t\tmatch.unshift( true );\n\n\t\t\treturn match;\n\t\t}\n\t},\n\t\n\tfilters: {\n\t\tenabled: function( elem ) {\n\t\t\treturn elem.disabled === false && elem.type !== \"hidden\";\n\t\t},\n\n\t\tdisabled: function( elem ) {\n\t\t\treturn elem.disabled === true;\n\t\t},\n\n\t\tchecked: function( elem ) {\n\t\t\treturn elem.checked === true;\n\t\t},\n\t\t\n\t\tselected: function( elem ) {\n\t\t\t// Accessing this property makes selected-by-default\n\t\t\t// options in Safari work properly\n\t\t\tif ( elem.parentNode ) {\n\t\t\t\telem.parentNode.selectedIndex;\n\t\t\t}\n\t\t\t\n\t\t\treturn elem.selected === true;\n\t\t},\n\n\t\tparent: function( elem ) {\n\t\t\treturn !!elem.firstChild;\n\t\t},\n\n\t\tempty: function( elem ) {\n\t\t\treturn !elem.firstChild;\n\t\t},\n\n\t\thas: function( elem, i, match ) {\n\t\t\treturn !!Sizzle( match[3], elem ).length;\n\t\t},\n\n\t\theader: function( elem ) {\n\t\t\treturn (/h\\d/i).test( elem.nodeName );\n\t\t},\n\n\t\ttext: function( elem ) {\n\t\t\tvar attr = elem.getAttribute( \"type\" ), type = elem.type;\n\t\t\t// IE6 and 7 will map elem.type to 'text' for new HTML5 types (search, etc) \n\t\t\t// use getAttribute instead to test this case\n\t\t\treturn elem.nodeName.toLowerCase() === \"input\" && \"text\" === type && ( attr === type || attr === null );\n\t\t},\n\n\t\tradio: function( elem ) {\n\t\t\treturn elem.nodeName.toLowerCase() === \"input\" && \"radio\" === elem.type;\n\t\t},\n\n\t\tcheckbox: function( elem ) {\n\t\t\treturn elem.nodeName.toLowerCase() === \"input\" && \"checkbox\" === elem.type;\n\t\t},\n\n\t\tfile: function( elem ) {\n\t\t\treturn elem.nodeName.toLowerCase() === \"input\" && \"file\" === elem.type;\n\t\t},\n\n\t\tpassword: function( elem ) {\n\t\t\treturn elem.nodeName.toLowerCase() === \"input\" && \"password\" === elem.type;\n\t\t},\n\n\t\tsubmit: function( elem ) {\n\t\t\tvar name = elem.nodeName.toLowerCase();\n\t\t\treturn (name === \"input\" || name === \"button\") && \"submit\" === elem.type;\n\t\t},\n\n\t\timage: function( elem ) {\n\t\t\treturn elem.nodeName.toLowerCase() === \"input\" && \"image\" === elem.type;\n\t\t},\n\n\t\treset: function( elem ) {\n\t\t\tvar name = elem.nodeName.toLowerCase();\n\t\t\treturn (name === \"input\" || name === \"button\") && \"reset\" === elem.type;\n\t\t},\n\n\t\tbutton: function( elem ) {\n\t\t\tvar name = elem.nodeName.toLowerCase();\n\t\t\treturn name === \"input\" && \"button\" === elem.type || name === \"button\";\n\t\t},\n\n\t\tinput: function( elem ) {\n\t\t\treturn (/input|select|textarea|button/i).test( elem.nodeName );\n\t\t},\n\n\t\tfocus: function( elem ) {\n\t\t\treturn elem === elem.ownerDocument.activeElement;\n\t\t}\n\t},\n\tsetFilters: {\n\t\tfirst: function( elem, i ) {\n\t\t\treturn i === 0;\n\t\t},\n\n\t\tlast: function( elem, i, match, array ) {\n\t\t\treturn i === array.length - 1;\n\t\t},\n\n\t\teven: function( elem, i ) {\n\t\t\treturn i % 2 === 0;\n\t\t},\n\n\t\todd: function( elem, i ) {\n\t\t\treturn i % 2 === 1;\n\t\t},\n\n\t\tlt: function( elem, i, match ) {\n\t\t\treturn i < match[3] - 0;\n\t\t},\n\n\t\tgt: function( elem, i, match ) {\n\t\t\treturn i > match[3] - 0;\n\t\t},\n\n\t\tnth: function( elem, i, match ) {\n\t\t\treturn match[3] - 0 === i;\n\t\t},\n\n\t\teq: function( elem, i, match ) {\n\t\t\treturn match[3] - 0 === i;\n\t\t}\n\t},\n\tfilter: {\n\t\tPSEUDO: function( elem, match, i, array ) {\n\t\t\tvar name = match[1],\n\t\t\t\tfilter = Expr.filters[ name ];\n\n\t\t\tif ( filter ) {\n\t\t\t\treturn filter( elem, i, match, array );\n\n\t\t\t} else if ( name === \"contains\" ) {\n\t\t\t\treturn (elem.textContent || elem.innerText || Sizzle.getText([ elem ]) || \"\").indexOf(match[3]) >= 0;\n\n\t\t\t} else if ( name === \"not\" ) {\n\t\t\t\tvar not = match[3];\n\n\t\t\t\tfor ( var j = 0, l = not.length; j < l; j++ ) {\n\t\t\t\t\tif ( not[j] === elem ) {\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\treturn true;\n\n\t\t\t} else {\n\t\t\t\tSizzle.error( name );\n\t\t\t}\n\t\t},\n\n\t\tCHILD: function( elem, match ) {\n\t\t\tvar type = match[1],\n\t\t\t\tnode = elem;\n\n\t\t\tswitch ( type ) {\n\t\t\t\tcase \"only\":\n\t\t\t\tcase \"first\":\n\t\t\t\t\twhile ( (node = node.previousSibling) )\t {\n\t\t\t\t\t\tif ( node.nodeType === 1 ) { \n\t\t\t\t\t\t\treturn false; \n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif ( type === \"first\" ) { \n\t\t\t\t\t\treturn true; \n\t\t\t\t\t}\n\n\t\t\t\t\tnode = elem;\n\n\t\t\t\tcase \"last\":\n\t\t\t\t\twhile ( (node = node.nextSibling) )\t {\n\t\t\t\t\t\tif ( node.nodeType === 1 ) { \n\t\t\t\t\t\t\treturn false; \n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\treturn true;\n\n\t\t\t\tcase \"nth\":\n\t\t\t\t\tvar first = match[2],\n\t\t\t\t\t\tlast = match[3];\n\n\t\t\t\t\tif ( first === 1 && last === 0 ) {\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tvar doneName = match[0],\n\t\t\t\t\t\tparent = elem.parentNode;\n\t\n\t\t\t\t\tif ( parent && (parent.sizcache !== doneName || !elem.nodeIndex) ) {\n\t\t\t\t\t\tvar count = 0;\n\t\t\t\t\t\t\n\t\t\t\t\t\tfor ( node = parent.firstChild; node; node = node.nextSibling ) {\n\t\t\t\t\t\t\tif ( node.nodeType === 1 ) {\n\t\t\t\t\t\t\t\tnode.nodeIndex = ++count;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} \n\n\t\t\t\t\t\tparent.sizcache = doneName;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tvar diff = elem.nodeIndex - last;\n\n\t\t\t\t\tif ( first === 0 ) {\n\t\t\t\t\t\treturn diff === 0;\n\n\t\t\t\t\t} else {\n\t\t\t\t\t\treturn ( diff % first === 0 && diff / first >= 0 );\n\t\t\t\t\t}\n\t\t\t}\n\t\t},\n\n\t\tID: function( elem, match ) {\n\t\t\treturn elem.nodeType === 1 && elem.getAttribute(\"id\") === match;\n\t\t},\n\n\t\tTAG: function( elem, match ) {\n\t\t\treturn (match === \"*\" && elem.nodeType === 1) || elem.nodeName.toLowerCase() === match;\n\t\t},\n\t\t\n\t\tCLASS: function( elem, match ) {\n\t\t\treturn (\" \" + (elem.className || elem.getAttribute(\"class\")) + \" \")\n\t\t\t\t.indexOf( match ) > -1;\n\t\t},\n\n\t\tATTR: function( elem, match ) {\n\t\t\tvar name = match[1],\n\t\t\t\tresult = Expr.attrHandle[ name ] ?\n\t\t\t\t\tExpr.attrHandle[ name ]( elem ) :\n\t\t\t\t\telem[ name ] != null ?\n\t\t\t\t\t\telem[ name ] :\n\t\t\t\t\t\telem.getAttribute( name ),\n\t\t\t\tvalue = result + \"\",\n\t\t\t\ttype = match[2],\n\t\t\t\tcheck = match[4];\n\n\t\t\treturn result == null ?\n\t\t\t\ttype === \"!=\" :\n\t\t\t\ttype === \"=\" ?\n\t\t\t\tvalue === check :\n\t\t\t\ttype === \"*=\" ?\n\t\t\t\tvalue.indexOf(check) >= 0 :\n\t\t\t\ttype === \"~=\" ?\n\t\t\t\t(\" \" + value + \" \").indexOf(check) >= 0 :\n\t\t\t\t!check ?\n\t\t\t\tvalue && result !== false :\n\t\t\t\ttype === \"!=\" ?\n\t\t\t\tvalue !== check :\n\t\t\t\ttype === \"^=\" ?\n\t\t\t\tvalue.indexOf(check) === 0 :\n\t\t\t\ttype === \"$=\" ?\n\t\t\t\tvalue.substr(value.length - check.length) === check :\n\t\t\t\ttype === \"|=\" ?\n\t\t\t\tvalue === check || value.substr(0, check.length + 1) === check + \"-\" :\n\t\t\t\tfalse;\n\t\t},\n\n\t\tPOS: function( elem, match, i, array ) {\n\t\t\tvar name = match[2],\n\t\t\t\tfilter = Expr.setFilters[ name ];\n\n\t\t\tif ( filter ) {\n\t\t\t\treturn filter( elem, i, match, array );\n\t\t\t}\n\t\t}\n\t}\n};\n\nvar origPOS = Expr.match.POS,\n\tfescape = function(all, num){\n\t\treturn \"\\\\\" + (num - 0 + 1);\n\t};\n\nfor ( var type in Expr.match ) {\n\tExpr.match[ type ] = new RegExp( Expr.match[ type ].source + (/(?![^\\[]*\\])(?![^\\(]*\\))/.source) );\n\tExpr.leftMatch[ type ] = new RegExp( /(^(?:.|\\r|\\n)*?)/.source + Expr.match[ type ].source.replace(/\\\\(\\d+)/g, fescape) );\n}\n\nvar makeArray = function( array, results ) {\n\tarray = Array.prototype.slice.call( array, 0 );\n\n\tif ( results ) {\n\t\tresults.push.apply( results, array );\n\t\treturn results;\n\t}\n\t\n\treturn array;\n};\n\n// Perform a simple check to determine if the browser is capable of\n// converting a NodeList to an array using builtin methods.\n// Also verifies that the returned array holds DOM nodes\n// (which is not the case in the Blackberry browser)\ntry {\n\tArray.prototype.slice.call( document.documentElement.childNodes, 0 )[0].nodeType;\n\n// Provide a fallback method if it does not work\n} catch( e ) {\n\tmakeArray = function( array, results ) {\n\t\tvar i = 0,\n\t\t\tret = results || [];\n\n\t\tif ( toString.call(array) === \"[object Array]\" ) {\n\t\t\tArray.prototype.push.apply( ret, array );\n\n\t\t} else {\n\t\t\tif ( typeof array.length === \"number\" ) {\n\t\t\t\tfor ( var l = array.length; i < l; i++ ) {\n\t\t\t\t\tret.push( array[i] );\n\t\t\t\t}\n\n\t\t\t} else {\n\t\t\t\tfor ( ; array[i]; i++ ) {\n\t\t\t\t\tret.push( array[i] );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn ret;\n\t};\n}\n\nvar sortOrder, siblingCheck;\n\nif ( document.documentElement.compareDocumentPosition ) {\n\tsortOrder = function( a, b ) {\n\t\tif ( a === b ) {\n\t\t\thasDuplicate = true;\n\t\t\treturn 0;\n\t\t}\n\n\t\tif ( !a.compareDocumentPosition || !b.compareDocumentPosition ) {\n\t\t\treturn a.compareDocumentPosition ? -1 : 1;\n\t\t}\n\n\t\treturn a.compareDocumentPosition(b) & 4 ? -1 : 1;\n\t};\n\n} else {\n\tsortOrder = function( a, b ) {\n\t\t// The nodes are identical, we can exit early\n\t\tif ( a === b ) {\n\t\t\thasDuplicate = true;\n\t\t\treturn 0;\n\n\t\t// Fallback to using sourceIndex (in IE) if it's available on both nodes\n\t\t} else if ( a.sourceIndex && b.sourceIndex ) {\n\t\t\treturn a.sourceIndex - b.sourceIndex;\n\t\t}\n\n\t\tvar al, bl,\n\t\t\tap = [],\n\t\t\tbp = [],\n\t\t\taup = a.parentNode,\n\t\t\tbup = b.parentNode,\n\t\t\tcur = aup;\n\n\t\t// If the nodes are siblings (or identical) we can do a quick check\n\t\tif ( aup === bup ) {\n\t\t\treturn siblingCheck( a, b );\n\n\t\t// If no parents were found then the nodes are disconnected\n\t\t} else if ( !aup ) {\n\t\t\treturn -1;\n\n\t\t} else if ( !bup ) {\n\t\t\treturn 1;\n\t\t}\n\n\t\t// Otherwise they're somewhere else in the tree so we need\n\t\t// to build up a full list of the parentNodes for comparison\n\t\twhile ( cur ) {\n\t\t\tap.unshift( cur );\n\t\t\tcur = cur.parentNode;\n\t\t}\n\n\t\tcur = bup;\n\n\t\twhile ( cur ) {\n\t\t\tbp.unshift( cur );\n\t\t\tcur = cur.parentNode;\n\t\t}\n\n\t\tal = ap.length;\n\t\tbl = bp.length;\n\n\t\t// Start walking down the tree looking for a discrepancy\n\t\tfor ( var i = 0; i < al && i < bl; i++ ) {\n\t\t\tif ( ap[i] !== bp[i] ) {\n\t\t\t\treturn siblingCheck( ap[i], bp[i] );\n\t\t\t}\n\t\t}\n\n\t\t// We ended someplace up the tree so do a sibling check\n\t\treturn i === al ?\n\t\t\tsiblingCheck( a, bp[i], -1 ) :\n\t\t\tsiblingCheck( ap[i], b, 1 );\n\t};\n\n\tsiblingCheck = function( a, b, ret ) {\n\t\tif ( a === b ) {\n\t\t\treturn ret;\n\t\t}\n\n\t\tvar cur = a.nextSibling;\n\n\t\twhile ( cur ) {\n\t\t\tif ( cur === b ) {\n\t\t\t\treturn -1;\n\t\t\t}\n\n\t\t\tcur = cur.nextSibling;\n\t\t}\n\n\t\treturn 1;\n\t};\n}\n\n// Utility function for retreiving the text value of an array of DOM nodes\nSizzle.getText = function( elems ) {\n\tvar ret = \"\", elem;\n\n\tfor ( var i = 0; elems[i]; i++ ) {\n\t\telem = elems[i];\n\n\t\t// Get the text from text nodes and CDATA nodes\n\t\tif ( elem.nodeType === 3 || elem.nodeType === 4 ) {\n\t\t\tret += elem.nodeValue;\n\n\t\t// Traverse everything else, except comment nodes\n\t\t} else if ( elem.nodeType !== 8 ) {\n\t\t\tret += Sizzle.getText( elem.childNodes );\n\t\t}\n\t}\n\n\treturn ret;\n};\n\n// Check to see if the browser returns elements by name when\n// querying by getElementById (and provide a workaround)\n(function(){\n\t// We're going to inject a fake input element with a specified name\n\tvar form = document.createElement(\"div\"),\n\t\tid = \"script\" + (new Date()).getTime(),\n\t\troot = document.documentElement;\n\n\tform.innerHTML = \"\";\n\n\t// Inject it into the root element, check its status, and remove it quickly\n\troot.insertBefore( form, root.firstChild );\n\n\t// The workaround has to do additional checks after a getElementById\n\t// Which slows things down for other browsers (hence the branching)\n\tif ( document.getElementById( id ) ) {\n\t\tExpr.find.ID = function( match, context, isXML ) {\n\t\t\tif ( typeof context.getElementById !== \"undefined\" && !isXML ) {\n\t\t\t\tvar m = context.getElementById(match[1]);\n\n\t\t\t\treturn m ?\n\t\t\t\t\tm.id === match[1] || typeof m.getAttributeNode !== \"undefined\" && m.getAttributeNode(\"id\").nodeValue === match[1] ?\n\t\t\t\t\t\t[m] :\n\t\t\t\t\t\tundefined :\n\t\t\t\t\t[];\n\t\t\t}\n\t\t};\n\n\t\tExpr.filter.ID = function( elem, match ) {\n\t\t\tvar node = typeof elem.getAttributeNode !== \"undefined\" && elem.getAttributeNode(\"id\");\n\n\t\t\treturn elem.nodeType === 1 && node && node.nodeValue === match;\n\t\t};\n\t}\n\n\troot.removeChild( form );\n\n\t// release memory in IE\n\troot = form = null;\n})();\n\n(function(){\n\t// Check to see if the browser returns only elements\n\t// when doing getElementsByTagName(\"*\")\n\n\t// Create a fake element\n\tvar div = document.createElement(\"div\");\n\tdiv.appendChild( document.createComment(\"\") );\n\n\t// Make sure no comments are found\n\tif ( div.getElementsByTagName(\"*\").length > 0 ) {\n\t\tExpr.find.TAG = function( match, context ) {\n\t\t\tvar results = context.getElementsByTagName( match[1] );\n\n\t\t\t// Filter out possible comments\n\t\t\tif ( match[1] === \"*\" ) {\n\t\t\t\tvar tmp = [];\n\n\t\t\t\tfor ( var i = 0; results[i]; i++ ) {\n\t\t\t\t\tif ( results[i].nodeType === 1 ) {\n\t\t\t\t\t\ttmp.push( results[i] );\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tresults = tmp;\n\t\t\t}\n\n\t\t\treturn results;\n\t\t};\n\t}\n\n\t// Check to see if an attribute returns normalized href attributes\n\tdiv.innerHTML = \"\";\n\n\tif ( div.firstChild && typeof div.firstChild.getAttribute !== \"undefined\" &&\n\t\t\tdiv.firstChild.getAttribute(\"href\") !== \"#\" ) {\n\n\t\tExpr.attrHandle.href = function( elem ) {\n\t\t\treturn elem.getAttribute( \"href\", 2 );\n\t\t};\n\t}\n\n\t// release memory in IE\n\tdiv = null;\n})();\n\nif ( document.querySelectorAll ) {\n\t(function(){\n\t\tvar oldSizzle = Sizzle,\n\t\t\tdiv = document.createElement(\"div\"),\n\t\t\tid = \"__sizzle__\";\n\n\t\tdiv.innerHTML = \"

\";\n\n\t\t// Safari can't handle uppercase or unicode characters when\n\t\t// in quirks mode.\n\t\tif ( div.querySelectorAll && div.querySelectorAll(\".TEST\").length === 0 ) {\n\t\t\treturn;\n\t\t}\n\t\n\t\tSizzle = function( query, context, extra, seed ) {\n\t\t\tcontext = context || document;\n\n\t\t\t// Only use querySelectorAll on non-XML documents\n\t\t\t// (ID selectors don't work in non-HTML documents)\n\t\t\tif ( !seed && !Sizzle.isXML(context) ) {\n\t\t\t\t// See if we find a selector to speed up\n\t\t\t\tvar match = /^(\\w+$)|^\\.([\\w\\-]+$)|^#([\\w\\-]+$)/.exec( query );\n\t\t\t\t\n\t\t\t\tif ( match && (context.nodeType === 1 || context.nodeType === 9) ) {\n\t\t\t\t\t// Speed-up: Sizzle(\"TAG\")\n\t\t\t\t\tif ( match[1] ) {\n\t\t\t\t\t\treturn makeArray( context.getElementsByTagName( query ), extra );\n\t\t\t\t\t\n\t\t\t\t\t// Speed-up: Sizzle(\".CLASS\")\n\t\t\t\t\t} else if ( match[2] && Expr.find.CLASS && context.getElementsByClassName ) {\n\t\t\t\t\t\treturn makeArray( context.getElementsByClassName( match[2] ), extra );\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif ( context.nodeType === 9 ) {\n\t\t\t\t\t// Speed-up: Sizzle(\"body\")\n\t\t\t\t\t// The body element only exists once, optimize finding it\n\t\t\t\t\tif ( query === \"body\" && context.body ) {\n\t\t\t\t\t\treturn makeArray( [ context.body ], extra );\n\t\t\t\t\t\t\n\t\t\t\t\t// Speed-up: Sizzle(\"#ID\")\n\t\t\t\t\t} else if ( match && match[3] ) {\n\t\t\t\t\t\tvar elem = context.getElementById( match[3] );\n\n\t\t\t\t\t\t// Check parentNode to catch when Blackberry 4.6 returns\n\t\t\t\t\t\t// nodes that are no longer in the document #6963\n\t\t\t\t\t\tif ( elem && elem.parentNode ) {\n\t\t\t\t\t\t\t// Handle the case where IE and Opera return items\n\t\t\t\t\t\t\t// by name instead of ID\n\t\t\t\t\t\t\tif ( elem.id === match[3] ) {\n\t\t\t\t\t\t\t\treturn makeArray( [ elem ], extra );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\treturn makeArray( [], extra );\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\ttry {\n\t\t\t\t\t\treturn makeArray( context.querySelectorAll(query), extra );\n\t\t\t\t\t} catch(qsaError) {}\n\n\t\t\t\t// qSA works strangely on Element-rooted queries\n\t\t\t\t// We can work around this by specifying an extra ID on the root\n\t\t\t\t// and working up from there (Thanks to Andrew Dupont for the technique)\n\t\t\t\t// IE 8 doesn't work on object elements\n\t\t\t\t} else if ( context.nodeType === 1 && context.nodeName.toLowerCase() !== \"object\" ) {\n\t\t\t\t\tvar oldContext = context,\n\t\t\t\t\t\told = context.getAttribute( \"id\" ),\n\t\t\t\t\t\tnid = old || id,\n\t\t\t\t\t\thasParent = context.parentNode,\n\t\t\t\t\t\trelativeHierarchySelector = /^\\s*[+~]/.test( query );\n\n\t\t\t\t\tif ( !old ) {\n\t\t\t\t\t\tcontext.setAttribute( \"id\", nid );\n\t\t\t\t\t} else {\n\t\t\t\t\t\tnid = nid.replace( /'/g, \"\\\\$&\" );\n\t\t\t\t\t}\n\t\t\t\t\tif ( relativeHierarchySelector && hasParent ) {\n\t\t\t\t\t\tcontext = context.parentNode;\n\t\t\t\t\t}\n\n\t\t\t\t\ttry {\n\t\t\t\t\t\tif ( !relativeHierarchySelector || hasParent ) {\n\t\t\t\t\t\t\treturn makeArray( context.querySelectorAll( \"[id='\" + nid + \"'] \" + query ), extra );\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} catch(pseudoError) {\n\t\t\t\t\t} finally {\n\t\t\t\t\t\tif ( !old ) {\n\t\t\t\t\t\t\toldContext.removeAttribute( \"id\" );\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\n\t\t\treturn oldSizzle(query, context, extra, seed);\n\t\t};\n\n\t\tfor ( var prop in oldSizzle ) {\n\t\t\tSizzle[ prop ] = oldSizzle[ prop ];\n\t\t}\n\n\t\t// release memory in IE\n\t\tdiv = null;\n\t})();\n}\n\n(function(){\n\tvar html = document.documentElement,\n\t\tmatches = html.matchesSelector || html.mozMatchesSelector || html.webkitMatchesSelector || html.msMatchesSelector;\n\n\tif ( matches ) {\n\t\t// Check to see if it's possible to do matchesSelector\n\t\t// on a disconnected node (IE 9 fails this)\n\t\tvar disconnectedMatch = !matches.call( document.createElement( \"div\" ), \"div\" ),\n\t\t\tpseudoWorks = false;\n\n\t\ttry {\n\t\t\t// This should fail with an exception\n\t\t\t// Gecko does not error, returns false instead\n\t\t\tmatches.call( document.documentElement, \"[test!='']:sizzle\" );\n\t\n\t\t} catch( pseudoError ) {\n\t\t\tpseudoWorks = true;\n\t\t}\n\n\t\tSizzle.matchesSelector = function( node, expr ) {\n\t\t\t// Make sure that attribute selectors are quoted\n\t\t\texpr = expr.replace(/\\=\\s*([^'\"\\]]*)\\s*\\]/g, \"='$1']\");\n\n\t\t\tif ( !Sizzle.isXML( node ) ) {\n\t\t\t\ttry { \n\t\t\t\t\tif ( pseudoWorks || !Expr.match.PSEUDO.test( expr ) && !/!=/.test( expr ) ) {\n\t\t\t\t\t\tvar ret = matches.call( node, expr );\n\n\t\t\t\t\t\t// IE 9's matchesSelector returns false on disconnected nodes\n\t\t\t\t\t\tif ( ret || !disconnectedMatch ||\n\t\t\t\t\t\t\t\t// As well, disconnected nodes are said to be in a document\n\t\t\t\t\t\t\t\t// fragment in IE 9, so check for that\n\t\t\t\t\t\t\t\tnode.document && node.document.nodeType !== 11 ) {\n\t\t\t\t\t\t\treturn ret;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} catch(e) {}\n\t\t\t}\n\n\t\t\treturn Sizzle(expr, null, null, [node]).length > 0;\n\t\t};\n\t}\n})();\n\n(function(){\n\tvar div = document.createElement(\"div\");\n\n\tdiv.innerHTML = \"
\";\n\n\t// Opera can't find a second classname (in 9.6)\n\t// Also, make sure that getElementsByClassName actually exists\n\tif ( !div.getElementsByClassName || div.getElementsByClassName(\"e\").length === 0 ) {\n\t\treturn;\n\t}\n\n\t// Safari caches class attributes, doesn't catch changes (in 3.2)\n\tdiv.lastChild.className = \"e\";\n\n\tif ( div.getElementsByClassName(\"e\").length === 1 ) {\n\t\treturn;\n\t}\n\t\n\tExpr.order.splice(1, 0, \"CLASS\");\n\tExpr.find.CLASS = function( match, context, isXML ) {\n\t\tif ( typeof context.getElementsByClassName !== \"undefined\" && !isXML ) {\n\t\t\treturn context.getElementsByClassName(match[1]);\n\t\t}\n\t};\n\n\t// release memory in IE\n\tdiv = null;\n})();\n\nfunction dirNodeCheck( dir, cur, doneName, checkSet, nodeCheck, isXML ) {\n\tfor ( var i = 0, l = checkSet.length; i < l; i++ ) {\n\t\tvar elem = checkSet[i];\n\n\t\tif ( elem ) {\n\t\t\tvar match = false;\n\n\t\t\telem = elem[dir];\n\n\t\t\twhile ( elem ) {\n\t\t\t\tif ( elem.sizcache === doneName ) {\n\t\t\t\t\tmatch = checkSet[elem.sizset];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif ( elem.nodeType === 1 && !isXML ){\n\t\t\t\t\telem.sizcache = doneName;\n\t\t\t\t\telem.sizset = i;\n\t\t\t\t}\n\n\t\t\t\tif ( elem.nodeName.toLowerCase() === cur ) {\n\t\t\t\t\tmatch = elem;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\telem = elem[dir];\n\t\t\t}\n\n\t\t\tcheckSet[i] = match;\n\t\t}\n\t}\n}\n\nfunction dirCheck( dir, cur, doneName, checkSet, nodeCheck, isXML ) {\n\tfor ( var i = 0, l = checkSet.length; i < l; i++ ) {\n\t\tvar elem = checkSet[i];\n\n\t\tif ( elem ) {\n\t\t\tvar match = false;\n\t\t\t\n\t\t\telem = elem[dir];\n\n\t\t\twhile ( elem ) {\n\t\t\t\tif ( elem.sizcache === doneName ) {\n\t\t\t\t\tmatch = checkSet[elem.sizset];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif ( elem.nodeType === 1 ) {\n\t\t\t\t\tif ( !isXML ) {\n\t\t\t\t\t\telem.sizcache = doneName;\n\t\t\t\t\t\telem.sizset = i;\n\t\t\t\t\t}\n\n\t\t\t\t\tif ( typeof cur !== \"string\" ) {\n\t\t\t\t\t\tif ( elem === cur ) {\n\t\t\t\t\t\t\tmatch = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} else if ( Sizzle.filter( cur, [elem] ).length > 0 ) {\n\t\t\t\t\t\tmatch = elem;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\telem = elem[dir];\n\t\t\t}\n\n\t\t\tcheckSet[i] = match;\n\t\t}\n\t}\n}\n\nif ( document.documentElement.contains ) {\n\tSizzle.contains = function( a, b ) {\n\t\treturn a !== b && (a.contains ? a.contains(b) : true);\n\t};\n\n} else if ( document.documentElement.compareDocumentPosition ) {\n\tSizzle.contains = function( a, b ) {\n\t\treturn !!(a.compareDocumentPosition(b) & 16);\n\t};\n\n} else {\n\tSizzle.contains = function() {\n\t\treturn false;\n\t};\n}\n\nSizzle.isXML = function( elem ) {\n\t// documentElement is verified for cases where it doesn't yet exist\n\t// (such as loading iframes in IE - #4833) \n\tvar documentElement = (elem ? elem.ownerDocument || elem : 0).documentElement;\n\n\treturn documentElement ? documentElement.nodeName !== \"HTML\" : false;\n};\n\nvar posProcess = function( selector, context ) {\n\tvar match,\n\t\ttmpSet = [],\n\t\tlater = \"\",\n\t\troot = context.nodeType ? [context] : context;\n\n\t// Position selectors must be done after the filter\n\t// And so must :not(positional) so we move all PSEUDOs to the end\n\twhile ( (match = Expr.match.PSEUDO.exec( selector )) ) {\n\t\tlater += match[0];\n\t\tselector = selector.replace( Expr.match.PSEUDO, \"\" );\n\t}\n\n\tselector = Expr.relative[selector] ? selector + \"*\" : selector;\n\n\tfor ( var i = 0, l = root.length; i < l; i++ ) {\n\t\tSizzle( selector, root[i], tmpSet );\n\t}\n\n\treturn Sizzle.filter( later, tmpSet );\n};\n\n// EXPOSE\njQuery.find = Sizzle;\njQuery.expr = Sizzle.selectors;\njQuery.expr[\":\"] = jQuery.expr.filters;\njQuery.unique = Sizzle.uniqueSort;\njQuery.text = Sizzle.getText;\njQuery.isXMLDoc = Sizzle.isXML;\njQuery.contains = Sizzle.contains;\n\n\n})();\n\n\nvar runtil = /Until$/,\n\trparentsprev = /^(?:parents|prevUntil|prevAll)/,\n\t// Note: This RegExp should be improved, or likely pulled from Sizzle\n\trmultiselector = /,/,\n\tisSimple = /^.[^:#\\[\\.,]*$/,\n\tslice = Array.prototype.slice,\n\tPOS = jQuery.expr.match.POS,\n\t// methods guaranteed to produce a unique set when starting from a unique set\n\tguaranteedUnique = {\n\t\tchildren: true,\n\t\tcontents: true,\n\t\tnext: true,\n\t\tprev: true\n\t};\n\njQuery.fn.extend({\n\tfind: function( selector ) {\n\t\tvar self = this,\n\t\t\ti, l;\n\n\t\tif ( typeof selector !== \"string\" ) {\n\t\t\treturn jQuery( selector ).filter(function() {\n\t\t\t\tfor ( i = 0, l = self.length; i < l; i++ ) {\n\t\t\t\t\tif ( jQuery.contains( self[ i ], this ) ) {\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\n\t\tvar ret = this.pushStack( \"\", \"find\", selector ),\n\t\t\tlength, n, r;\n\n\t\tfor ( i = 0, l = this.length; i < l; i++ ) {\n\t\t\tlength = ret.length;\n\t\t\tjQuery.find( selector, this[i], ret );\n\n\t\t\tif ( i > 0 ) {\n\t\t\t\t// Make sure that the results are unique\n\t\t\t\tfor ( n = length; n < ret.length; n++ ) {\n\t\t\t\t\tfor ( r = 0; r < length; r++ ) {\n\t\t\t\t\t\tif ( ret[r] === ret[n] ) {\n\t\t\t\t\t\t\tret.splice(n--, 1);\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn ret;\n\t},\n\n\thas: function( target ) {\n\t\tvar targets = jQuery( target );\n\t\treturn this.filter(function() {\n\t\t\tfor ( var i = 0, l = targets.length; i < l; i++ ) {\n\t\t\t\tif ( jQuery.contains( this, targets[i] ) ) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t},\n\n\tnot: function( selector ) {\n\t\treturn this.pushStack( winnow(this, selector, false), \"not\", selector);\n\t},\n\n\tfilter: function( selector ) {\n\t\treturn this.pushStack( winnow(this, selector, true), \"filter\", selector );\n\t},\n\n\tis: function( selector ) {\n\t\treturn !!selector && ( typeof selector === \"string\" ?\n\t\t\tjQuery.filter( selector, this ).length > 0 :\n\t\t\tthis.filter( selector ).length > 0 );\n\t},\n\n\tclosest: function( selectors, context ) {\n\t\tvar ret = [], i, l, cur = this[0];\n\t\t\n\t\t// Array\n\t\tif ( jQuery.isArray( selectors ) ) {\n\t\t\tvar match, selector,\n\t\t\t\tmatches = {},\n\t\t\t\tlevel = 1;\n\n\t\t\tif ( cur && selectors.length ) {\n\t\t\t\tfor ( i = 0, l = selectors.length; i < l; i++ ) {\n\t\t\t\t\tselector = selectors[i];\n\n\t\t\t\t\tif ( !matches[ selector ] ) {\n\t\t\t\t\t\tmatches[ selector ] = POS.test( selector ) ?\n\t\t\t\t\t\t\tjQuery( selector, context || this.context ) :\n\t\t\t\t\t\t\tselector;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\twhile ( cur && cur.ownerDocument && cur !== context ) {\n\t\t\t\t\tfor ( selector in matches ) {\n\t\t\t\t\t\tmatch = matches[ selector ];\n\n\t\t\t\t\t\tif ( match.jquery ? match.index( cur ) > -1 : jQuery( cur ).is( match ) ) {\n\t\t\t\t\t\t\tret.push({ selector: selector, elem: cur, level: level });\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tcur = cur.parentNode;\n\t\t\t\t\tlevel++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn ret;\n\t\t}\n\n\t\t// String\n\t\tvar pos = POS.test( selectors ) || typeof selectors !== \"string\" ?\n\t\t\t\tjQuery( selectors, context || this.context ) :\n\t\t\t\t0;\n\n\t\tfor ( i = 0, l = this.length; i < l; i++ ) {\n\t\t\tcur = this[i];\n\n\t\t\twhile ( cur ) {\n\t\t\t\tif ( pos ? pos.index(cur) > -1 : jQuery.find.matchesSelector(cur, selectors) ) {\n\t\t\t\t\tret.push( cur );\n\t\t\t\t\tbreak;\n\n\t\t\t\t} else {\n\t\t\t\t\tcur = cur.parentNode;\n\t\t\t\t\tif ( !cur || !cur.ownerDocument || cur === context || cur.nodeType === 11 ) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tret = ret.length > 1 ? jQuery.unique( ret ) : ret;\n\n\t\treturn this.pushStack( ret, \"closest\", selectors );\n\t},\n\n\t// Determine the position of an element within\n\t// the matched set of elements\n\tindex: function( elem ) {\n\t\tif ( !elem || typeof elem === \"string\" ) {\n\t\t\treturn jQuery.inArray( this[0],\n\t\t\t\t// If it receives a string, the selector is used\n\t\t\t\t// If it receives nothing, the siblings are used\n\t\t\t\telem ? jQuery( elem ) : this.parent().children() );\n\t\t}\n\t\t// Locate the position of the desired element\n\t\treturn jQuery.inArray(\n\t\t\t// If it receives a jQuery object, the first element is used\n\t\t\telem.jquery ? elem[0] : elem, this );\n\t},\n\n\tadd: function( selector, context ) {\n\t\tvar set = typeof selector === \"string\" ?\n\t\t\t\tjQuery( selector, context ) :\n\t\t\t\tjQuery.makeArray( selector && selector.nodeType ? [ selector ] : selector ),\n\t\t\tall = jQuery.merge( this.get(), set );\n\n\t\treturn this.pushStack( isDisconnected( set[0] ) || isDisconnected( all[0] ) ?\n\t\t\tall :\n\t\t\tjQuery.unique( all ) );\n\t},\n\n\tandSelf: function() {\n\t\treturn this.add( this.prevObject );\n\t}\n});\n\n// A painfully simple check to see if an element is disconnected\n// from a document (should be improved, where feasible).\nfunction isDisconnected( node ) {\n\treturn !node || !node.parentNode || node.parentNode.nodeType === 11;\n}\n\njQuery.each({\n\tparent: function( elem ) {\n\t\tvar parent = elem.parentNode;\n\t\treturn parent && parent.nodeType !== 11 ? parent : null;\n\t},\n\tparents: function( elem ) {\n\t\treturn jQuery.dir( elem, \"parentNode\" );\n\t},\n\tparentsUntil: function( elem, i, until ) {\n\t\treturn jQuery.dir( elem, \"parentNode\", until );\n\t},\n\tnext: function( elem ) {\n\t\treturn jQuery.nth( elem, 2, \"nextSibling\" );\n\t},\n\tprev: function( elem ) {\n\t\treturn jQuery.nth( elem, 2, \"previousSibling\" );\n\t},\n\tnextAll: function( elem ) {\n\t\treturn jQuery.dir( elem, \"nextSibling\" );\n\t},\n\tprevAll: function( elem ) {\n\t\treturn jQuery.dir( elem, \"previousSibling\" );\n\t},\n\tnextUntil: function( elem, i, until ) {\n\t\treturn jQuery.dir( elem, \"nextSibling\", until );\n\t},\n\tprevUntil: function( elem, i, until ) {\n\t\treturn jQuery.dir( elem, \"previousSibling\", until );\n\t},\n\tsiblings: function( elem ) {\n\t\treturn jQuery.sibling( elem.parentNode.firstChild, elem );\n\t},\n\tchildren: function( elem ) {\n\t\treturn jQuery.sibling( elem.firstChild );\n\t},\n\tcontents: function( elem ) {\n\t\treturn jQuery.nodeName( elem, \"iframe\" ) ?\n\t\t\telem.contentDocument || elem.contentWindow.document :\n\t\t\tjQuery.makeArray( elem.childNodes );\n\t}\n}, function( name, fn ) {\n\tjQuery.fn[ name ] = function( until, selector ) {\n\t\tvar ret = jQuery.map( this, fn, until ),\n\t\t\t// The variable 'args' was introduced in\n\t\t\t// https://github.com/jquery/jquery/commit/52a0238\n\t\t\t// to work around a bug in Chrome 10 (Dev) and should be removed when the bug is fixed.\n\t\t\t// http://code.google.com/p/v8/issues/detail?id=1050\n\t\t\targs = slice.call(arguments);\n\n\t\tif ( !runtil.test( name ) ) {\n\t\t\tselector = until;\n\t\t}\n\n\t\tif ( selector && typeof selector === \"string\" ) {\n\t\t\tret = jQuery.filter( selector, ret );\n\t\t}\n\n\t\tret = this.length > 1 && !guaranteedUnique[ name ] ? jQuery.unique( ret ) : ret;\n\n\t\tif ( (this.length > 1 || rmultiselector.test( selector )) && rparentsprev.test( name ) ) {\n\t\t\tret = ret.reverse();\n\t\t}\n\n\t\treturn this.pushStack( ret, name, args.join(\",\") );\n\t};\n});\n\njQuery.extend({\n\tfilter: function( expr, elems, not ) {\n\t\tif ( not ) {\n\t\t\texpr = \":not(\" + expr + \")\";\n\t\t}\n\n\t\treturn elems.length === 1 ?\n\t\t\tjQuery.find.matchesSelector(elems[0], expr) ? [ elems[0] ] : [] :\n\t\t\tjQuery.find.matches(expr, elems);\n\t},\n\n\tdir: function( elem, dir, until ) {\n\t\tvar matched = [],\n\t\t\tcur = elem[ dir ];\n\n\t\twhile ( cur && cur.nodeType !== 9 && (until === undefined || cur.nodeType !== 1 || !jQuery( cur ).is( until )) ) {\n\t\t\tif ( cur.nodeType === 1 ) {\n\t\t\t\tmatched.push( cur );\n\t\t\t}\n\t\t\tcur = cur[dir];\n\t\t}\n\t\treturn matched;\n\t},\n\n\tnth: function( cur, result, dir, elem ) {\n\t\tresult = result || 1;\n\t\tvar num = 0;\n\n\t\tfor ( ; cur; cur = cur[dir] ) {\n\t\t\tif ( cur.nodeType === 1 && ++num === result ) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\treturn cur;\n\t},\n\n\tsibling: function( n, elem ) {\n\t\tvar r = [];\n\n\t\tfor ( ; n; n = n.nextSibling ) {\n\t\t\tif ( n.nodeType === 1 && n !== elem ) {\n\t\t\t\tr.push( n );\n\t\t\t}\n\t\t}\n\n\t\treturn r;\n\t}\n});\n\n// Implement the identical functionality for filter and not\nfunction winnow( elements, qualifier, keep ) {\n\n\t// Can't pass null or undefined to indexOf in Firefox 4\n\t// Set to 0 to skip string check\n\tqualifier = qualifier || 0;\n\n\tif ( jQuery.isFunction( qualifier ) ) {\n\t\treturn jQuery.grep(elements, function( elem, i ) {\n\t\t\tvar retVal = !!qualifier.call( elem, i, elem );\n\t\t\treturn retVal === keep;\n\t\t});\n\n\t} else if ( qualifier.nodeType ) {\n\t\treturn jQuery.grep(elements, function( elem, i ) {\n\t\t\treturn (elem === qualifier) === keep;\n\t\t});\n\n\t} else if ( typeof qualifier === \"string\" ) {\n\t\tvar filtered = jQuery.grep(elements, function( elem ) {\n\t\t\treturn elem.nodeType === 1;\n\t\t});\n\n\t\tif ( isSimple.test( qualifier ) ) {\n\t\t\treturn jQuery.filter(qualifier, filtered, !keep);\n\t\t} else {\n\t\t\tqualifier = jQuery.filter( qualifier, filtered );\n\t\t}\n\t}\n\n\treturn jQuery.grep(elements, function( elem, i ) {\n\t\treturn (jQuery.inArray( elem, qualifier ) >= 0) === keep;\n\t});\n}\n\n\n\n\nvar rinlinejQuery = / jQuery\\d+=\"(?:\\d+|null)\"/g,\n\trleadingWhitespace = /^\\s+/,\n\trxhtmlTag = /<(?!area|br|col|embed|hr|img|input|link|meta|param)(([\\w:]+)[^>]*)\\/>/ig,\n\trtagName = /<([\\w:]+)/,\n\trtbody = /\", \"\" ],\n\t\tlegend: [ 1, \"
\", \"
\" ],\n\t\tthead: [ 1, \"\", \"
\" ],\n\t\ttr: [ 2, \"\", \"
\" ],\n\t\ttd: [ 3, \"\", \"
\" ],\n\t\tcol: [ 2, \"\", \"
\" ],\n\t\tarea: [ 1, \"\", \"\" ],\n\t\t_default: [ 0, \"\", \"\" ]\n\t};\n\nwrapMap.optgroup = wrapMap.option;\nwrapMap.tbody = wrapMap.tfoot = wrapMap.colgroup = wrapMap.caption = wrapMap.thead;\nwrapMap.th = wrapMap.td;\n\n// IE can't serialize and \n" }, { "path": "src/test/resources/samples/langs/JavaScript/proto.js", "content": "/**\n * @fileoverview\n * @enhanceable\n * @public\n */\n// GENERATED CODE -- DO NOT EDIT!\n\ngoog.provide('proto.google.protobuf.Timestamp');\n\ngoog.require('jspb.Message');\n\n/**\n * Generated by JsPbCodeGenerator.\n * @param {Array=} opt_data Optional initial data array, typically from a\n * server response, or constructed directly in Javascript. The array is used\n * in place and becomes part of the constructed object. It is not cloned.\n * If no data is provided, the constructed object will be empty, but still\n * valid.\n * @extends {jspb.Message}\n * @constructor\n */\nproto.google.protobuf.Timestamp = function(opt_data) {\n jspb.Message.initialize(this, opt_data, 0, -1, null, null);\n};\ngoog.inherits(proto.google.protobuf.Timestamp, jspb.Message);\nif (goog.DEBUG && !COMPILED) {\n proto.google.protobuf.Timestamp.displayName = 'proto.google.protobuf.Timestamp';\n}\n\n\n// Remainder elided" }, { "path": "src/test/resources/samples/langs/JavaScript/steelseries-min.js", "content": "/*!\n * Name : steelseries.js\n * Authors : Gerrit Grunwald, Mark Crossley\n * Last modified : 09.05.2012\n * Revision : 0.11.3\n *\n * Copyright (c) 2011, Gerrit Grunwald, Mark Crossley\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without modification, are permitted\n * provided that the following conditions are met:\n *\n * # Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n * # Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following\n * disclaimer in the documentation and/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING,\n * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT\n * SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE\n * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\nvar steelseries=function(){function f(n,t){var i=\"#\"===n.charAt(0)?n.substring(1,7):n,f=parseInt(i.substring(0,2),16),u=parseInt(i.substring(2,4),16),r=parseInt(i.substring(4,6),16);return this.color=\"rgba(\"+f+\",\"+u+\",\"+r+\",\"+t+\")\",this}function ui(t,i,r,u){var f=1/255,y=t.getRed(),v=t.getGreen(),a=t.getBlue(),b=t.getAlpha(),w=i.getRed()-t.getRed(),p=i.getGreen()-t.getGreen(),s=i.getBlue()-t.getBlue(),o=i.getAlpha()*f-t.getAlpha()*f,e=w/r,l=p/r,c=s/r,h=o/r;return new n((y+e*u).toFixed(0),(v+l*u).toFixed(0),(a+c*u).toFixed(0),b+h*u)}function vr(n,t,i){return{start:n,stop:t,color:i}}function c(n,t){var u=Math.floor(Math.log10(n)),r=n/Math.pow(10,u),i;return i=t?1.5>r?1:3>r?2:7>r?5:10:1.5?u/(2-r-e):u/(r+e);switch(r){case n:f=(t-i)/u+(tt?t:n}function si(t,i){var f=Math.floor(t.getRed()*(1-i)),u=Math.floor(t.getGreen()*(1-i)),r=Math.floor(t.getBlue()*(1-i));return f=k(f,255),u=k(u,255),r=k(r,255),new n(f,u,r,t.getAlpha())}function ti(t,i){var f=Math.round(t.getRed()*(1+i)),u=Math.round(t.getGreen()*(1+i)),r=Math.round(t.getBlue()*(1+i));return f=k(f,255),u=k(u,255),r=k(r,255),new n(f,u,r,t.getAlpha())}function or(n,t,i){var r,u;if(i<=t)throw\"Rotary bounds are of negative or zero size\";return r=i-t,u=Math.floor((n-t)/r),n-u*r}function ni(n,t){return or(t-n,-180,180)}var r=document,tt=\"LCDMono2Ultra,sans-serif\",ei=function(n,i){i=i||{};var ot=undefined===i.gaugeType?steelseries.GaugeType.TYPE4:i.gaugeType,f=undefined===i.size?200:i.size,h=undefined===i.minValue?0:i.minValue,b=undefined===i.maxValue?h+100:i.maxValue,bf=undefined===i.niceScale?!0:i.niceScale,ti=undefined===i.threshold?(b-h)/2:i.threshold,ii=undefined===i.section?null:i.section,ui=undefined===i.area?null:i.area,lu=undefined===i.titleString?\"\":i.titleString,au=undefined===i.unitString?\"\":i.unitString,hu=undefined===i.frameDesign?steelseries.FrameDesign.METAL:i.frameDesign,wu=undefined===i.frameVisible?!0:i.frameVisible,bt=undefined===i.backgroundColor?steelseries.BackgroundColor.DARK_GRAY:i.backgroundColor,bu=undefined===i.backgroundVisible?!0:i.backgroundVisible,pt=undefined===i.pointerType?steelseries.PointerType.TYPE1:i.pointerType,ar=undefined===i.pointerColor?steelseries.ColorDef.RED:i.pointerColor,ee=undefined===i.knobType?steelseries.KnobType.STANDARD_KNOB:i.knobType,fi=undefined===i.knobStyle?steelseries.KnobStyle.SILVER:i.knobStyle,ei=undefined===i.lcdColor?steelseries.LcdColor.STANDARD:i.lcdColor,vr=undefined===i.lcdVisible?!0:i.lcdVisible,eu=undefined===i.lcdDecimals?2:i.lcdDecimals,ye=undefined===i.digitalFont?!1:i.digitalFont,pe=undefined===i.fractionalScaleDecimals?1:i.fractionalScaleDecimals,br=undefined===i.ledColor?steelseries.LedColor.RED_LED:i.ledColor,ru=undefined===i.ledVisible?!0:i.ledVisible,vf=undefined===i.thresholdVisible?!0:i.thresholdVisible,kr=undefined===i.minMeasuredValueVisible?!1:i.minMeasuredValueVisible,dr=undefined===i.maxMeasuredValueVisible?!1:i.maxMeasuredValueVisible,cf=undefined===i.foregroundType?steelseries.ForegroundType.TYPE1:i.foregroundType,af=undefined===i.foregroundVisible?!0:i.foregroundVisible,oe=undefined===i.labelNumberFormat?steelseries.LabelNumberFormat.STANDARD:i.labelNumberFormat,yr=undefined===i.playAlarm?!1:i.playAlarm,uf=undefined===i.alarmSound?!1:i.alarmSound,fe=undefined===i.customLayer?null:i.customLayer,le=undefined===i.tickLabelOrientation?ot===steelseries.GaugeType.TYPE1?steelseries.TickLabelOrientation.TANGENT:steelseries.TickLabelOrientation.NORMAL:i.tickLabelOrientation,wr=undefined===i.trendVisible?!1:i.trendVisible,hr=undefined===i.trendColors?[steelseries.LedColor.RED_LED,steelseries.LedColor.GREEN_LED,steelseries.LedColor.CYAN_LED]:i.trendColors,sr=undefined===i.useOdometer?!1:i.useOdometer,wt=undefined===i.odometerParams?{}:i.odometerParams,wf=undefined===i.odometerUseValue?!1:i.odometerUseValue,ki;yr&&uf!==!1&&(ki=r.createElement(\"audio\"),ki.setAttribute(\"src\",uf),ki.setAttribute(\"preload\",\"auto\"));var l=h,or=h,yf=this,ri=b,ni=h,ht=!1,ef=0,we,of=steelseries.TrendState.OFF,lr=f*.06,cr=f*.29,er=f*.36,ci,et,gi,at,lt,rr=et+(l-h)*lt,u=r.getElementById(n).getContext(\"2d\");u.save(),u.clearRect(0,0,u.canvas.width,u.canvas.height),u.canvas.width=f,u.canvas.height=f;var s=f,k=f,g=s/2,it=k/2,pf=.6*s,ne=.4*k,pr=Math.floor(s/10),ce=pr+\"px sans-serif\",ae=pr+\"px \"+tt,hf=k*.13,bi=s*.4,sf=(s-bi)/2,rf=k*.57,tf,ve=k*.61,st=Math.PI/2,ue=Math.PI/180,ff=!1,ir=h,nr=b,ai=b-h,yt=nr-ir,fr=0,vt=0,oi=10,lf=10,re=function(){bf?(ai=c(b-h,!1),vt=c(ai/(lf-1),!0),ir=Math.floor(h/vt)*vt,nr=Math.ceil(b/vt)*vt,fr=c(vt/(oi-1),!0),h=ir,b=nr,yt=b-h):(ai=b-h,ir=h,nr=b,yt=ai,vt=c(ai/(lf-1),!0),fr=c(vt/(oi-1),!0));switch(ot.type){case\"type1\":ci=0,et=Math.PI,gi=st,at=st,lt=at/yt;break;case\"type2\":ci=0,et=Math.PI,gi=st,at=Math.PI,lt=at/yt;break;case\"type3\":ci=0,et=st,gi=0,at=1.5*Math.PI,lt=at/yt;break;case\"type4\":default:ci=60*ue,et=st+ci/2,gi=0,at=2*Math.PI-ci,lt=at/yt}rr=et+(l-h)*lt},wi=t(f,f),nf=wi.getContext(\"2d\"),di=t(f,f),ut=di.getContext(\"2d\"),fu,hi=t(f*.093457,f*.093457),uu=hi.getContext(\"2d\"),gt=t(f*.093457,f*.093457),nu=gt.getContext(\"2d\"),si=gt,iu=t(Math.ceil(f*.028037),Math.ceil(f*.028037)),se=iu.getContext(\"2d\"),gr=t(Math.ceil(f*.028037),Math.ceil(f*.028037)),he=gr.getContext(\"2d\"),vi=t(f,f),tu=vi.getContext(\"2d\"),yi=t(f,f),ou=yi.getContext(\"2d\"),pi=t(f,f),kt=pi.getContext(\"2d\"),li=t(f,f),pu=li.getContext(\"2d\"),gu,du,ku,yu,cu,tr,su;sr&&vr&&(tr=t(10,10),su=tr.getContext(\"2d\"));var kf=function(n){u.save(),u.textAlign=\"right\",u.strokeStyle=ei.textColor,u.fillStyle=ei.textColor,(ei===steelseries.LcdColor.STANDARD||ei===steelseries.LcdColor.STANDARD_GREEN)&&(u.shadowColor=\"gray\",u.shadowOffsetX=s*.007,u.shadowOffsetY=s*.007,u.shadowBlur=s*.007),u.font=ye?ae:ce,u.fillText(n.toFixed(eu),sf+bi-bi*.05,rf+hf*.5+pr*.38,bi*.9),u.restore()},te=function(n){n.save(),\"type1\"===ot.type&&n.drawImage(e(Math.ceil(k*.037383),steelseries.KnobType.STANDARD_KNOB,fi),s*.523364,k*.130841),(\"type1\"===ot.type||\"type2\"===ot.type)&&n.drawImage(e(Math.ceil(k*.037383),steelseries.KnobType.STANDARD_KNOB,fi),s*.130841,k*.514018),(\"type2\"===ot.type||\"type3\"===ot.type)&&n.drawImage(e(Math.ceil(k*.037383),steelseries.KnobType.STANDARD_KNOB,fi),s*.831775,k*.514018),\"type3\"===ot.type&&n.drawImage(e(Math.ceil(k*.037383),steelseries.KnobType.STANDARD_KNOB,fi),s*.523364,k*.831775),\"type4\"===ot.type&&(n.drawImage(e(Math.ceil(k*.037383),steelseries.KnobType.STANDARD_KNOB,fi),s*.336448,k*.803738),n.drawImage(e(Math.ceil(k*.037383),steelseries.KnobType.STANDARD_KNOB,fi),s*.626168,k*.803738)),n.restore()},ie=function(){var t=r.createElement(\"canvas\"),n,i;return t.width=Math.ceil(f*.046728),t.height=Math.ceil(t.width*.9),n=t.getContext(\"2d\"),n.save(),i=n.createLinearGradient(0,.1,0,t.height*.9),i.addColorStop(0,\"#520000\"),i.addColorStop(.3,\"#fc1d00\"),i.addColorStop(.59,\"#fc1d00\"),i.addColorStop(1,\"#520000\"),n.fillStyle=i,n.beginPath(),n.moveTo(t.width*.5,.1),n.lineTo(t.width*.9,t.height*.9),n.lineTo(t.width*.1,t.height*.9),n.lineTo(t.width*.5,.1),n.closePath(),n.fill(),n.strokeStyle=\"#FFFFFF\",n.stroke(),n.restore(),t},vu=function(n,t,i,r,u){tb&&(t=b),ib&&(i=b);if(t>=i)return;n.save(),n.strokeStyle=r,n.fillStyle=r,n.lineWidth=s*.035;var f=at/yt*t-at/yt*h,e=f+(i-t)/(yt/at);n.translate(g,it),n.rotate(et),n.beginPath(),u?(n.moveTo(0,0),n.arc(0,0,s*.365-n.lineWidth/2,f,e,!1)):n.arc(0,0,s*.365,f,e,!1),u?(n.moveTo(0,0),n.fill()):n.stroke(),n.translate(-g,-it),n.restore()},df=function(n,t){var y,v,a,c;bt.labelColor.setAlpha(1),n.save(),n.textAlign=\"center\",n.textBaseline=\"middle\",y=Math.ceil(s*.04),n.font=y+\"px sans-serif\",n.strokeStyle=bt.labelColor.getRgbaColor(),n.fillStyle=bt.labelColor.getRgbaColor(),n.translate(g,it),n.rotate(et);var o=et,i=lt*fr,r,e=h,u=oi-1,l=s*.38,w=s*.35,d=s*.355,k=s*.36,p=s*.3,f=s*.1;for((ot.type===\"type1\"||ot.type===\"type2\")&&(f=s*.035),v=oi/2,a=parseFloat(b.toFixed(2)),c=h;parseFloat(c.toFixed(2))<=a;c+=fr){r=i+st,u++;if(u===oi){n.lineWidth=1.5,n.beginPath(),n.moveTo(l,0),n.lineTo(w,0),n.closePath(),n.stroke(),n.save(),n.translate(p,0);switch(le.type){case\"horizontal\":r=-o;break;case\"tangent\":r=o<=st+Math.PI?Math.PI:0;break;case\"normal\":default:r=st}n.rotate(r);switch(t.format){case\"fractional\":n.fillText(e.toFixed(pe),0,0,f);break;case\"scientific\":n.fillText(e.toPrecision(2),0,0,f);break;case\"standard\":default:n.fillText(e.toFixed(0),0,0,f)}n.translate(-p,0),n.restore(),e+=vt,u=0,n.rotate(i),o+=i;continue}0==oi%2&&u===v?(n.lineWidth=1,n.beginPath(),n.moveTo(l,0),n.lineTo(d,0),n.closePath(),n.stroke()):(n.lineWidth=.5,n.beginPath(),n.moveTo(l,0),n.lineTo(k,0),n.closePath(),n.stroke()),n.rotate(i),o+=i}n.translate(-g,-it),n.restore()},ft=function(n){var t,i,u;n=n||{};var c=undefined===n.frame?!1:n.frame,r=undefined===n.background?!1:n.background,e=undefined===n.led?!1:n.led,tt=undefined===n.pointer?!1:n.pointer,b=undefined===n.foreground?!1:n.foreground,ft=undefined===n.trend?!1:n.trend,ht=undefined===n.odo?!1:n.odo;ff=!0,re(),c&&wu&&v(nf,hu,g,it,s,k),r&&bu&&(w(ut,bt,g,it,s,k),rt(ut,fe,g,it,s,k)),e&&(uu.drawImage(o(Math.ceil(f*.093457),1,br),0,0),nu.drawImage(o(Math.ceil(f*.093457),0,br),0,0)),kr&&se.drawImage(a(Math.ceil(f*.028037),steelseries.ColorDef.BLUE.dark.getRgbaColor(),!0,!0),0,0),dr&&he.drawImage(a(Math.ceil(f*.028037),steelseries.ColorDef.RED.medium.getRgbaColor(),!0),0,0);if(r&&bu){te(ut);if(null!==ii&&0b?b:n;l!==t&&(l=t,l>ni&&(ni=l),lb?b:n,t,i;l!==r&&(undefined!==t&&t.playing&&t.stop(),t=new Tween({},\"\",Tween.regularEaseInOut,l,r,1),i=this,t.onMotionChanged=function(n){l=n.target._pos,lni&&(ni=l),lb?b:n;ni=t,this.repaint()},this.setMinMeasuredValue=function(n){var t=nb?b:n;ri=t,this.repaint()},this.setTitleString=function(n){lu=n,ft({background:!0}),this.repaint()},this.setUnitString=function(n){au=n,ft({background:!0}),this.repaint()},this.setMinValue=function(n){h=n,ft({frame:!0,background:!0}),this.repaint()},this.getMinValue=function(){return h},this.setMaxValue=function(n){b=n,ft({frame:!0,background:!0}),this.repaint()},this.getMaxValue=function(){return b},this.setThreshold=function(n){var t=nb?b:n;ti=t,ft({background:!0}),this.repaint()},this.setArea=function(n){ui=n,dt({foreground:!0}),ft({background:!0,foreground:!0}),this.repaint()},this.setSection=function(n){ii=n,dt({foreground:!0}),ft({background:!0,foreground:!0}),this.repaint()},this.setThresholdVisible=function(n){vf=n,this.repaint()},this.setLcdDecimals=function(n){eu=n,this.repaint()},this.setFrameDesign=function(n){dt({frame:!0}),hu=n,ft({frame:!0}),this.repaint()},this.setBackgroundColor=function(n){dt({background:!0,pointer:pt.type===\"type2\"||pt.type===\"type13\"?!0:!1}),bt=n,ft({background:!0,pointer:pt.type===\"type2\"||pt.type===\"type13\"?!0:!1}),this.repaint()},this.setForegroundType=function(n){dt({foreground:!0}),cf=n,ft({foreground:!0}),this.repaint()},this.setPointerType=function(n){dt({pointer:!0,foreground:!0}),pt=n,ft({pointer:!0,foreground:!0}),this.repaint()},this.setPointerColor=function(n){dt({pointer:!0}),ar=n,ft({pointer:!0}),this.repaint()},this.setLedColor=function(n){dt({led:!0}),br=n,ft({led:!0}),this.repaint()},this.setLcdColor=function(n){ei=n,ft({background:!0}),this.repaint()},this.setTrend=function(n){of=n,this.repaint()},this.setTrendVisible=function(n){wr=n,this.repaint()},this.repaint=function(){ff||ft({frame:!0,background:!0,led:!0,pointer:!0,trend:!0,foreground:!0,odo:!0}),u.clearRect(0,0,u.canvas.width,u.canvas.height),wu&&u.drawImage(wi,0,0),u.drawImage(di,0,0),vr&&(sr?(cu.setValue(wf?l:or),u.drawImage(tr,tf,ve)):kf(l)),ru&&(lh?h:n;it!==t&&(it=t,ith?h:n,t;it!==i&&(undefined!==ti&&ti.playing&&ti.stop(),ti=new Tween({},\"\",Tween.regularEaseInOut,it,i,1),t=this,ti.onMotionChanged=function(n){it=n.target._pos,ith?h:n;fi=t,a({background:!0}),this.repaint()},this.setTitleString=function(n){su=n,a({background:!0}),this.repaint()},this.setUnitString=function(n){lu=n,a({background:!0}),this.repaint()},this.setTrend=function(n){pu=n,this.repaint()},this.setTrendVisible=function(n){ar=n,this.repaint()},this.repaint=function(){var o,i,e,n,t;for(nu||a({frame:!0,background:!0,led:!0,value:!0,trend:!0,foreground:!0}),u.clearRect(0,0,u.canvas.width,u.canvas.height),yu&&u.drawImage(hi,0,0),u.drawImage(ai,0,0),o=(it+Math.abs(f))/(h-f)*lt,e=ur,n=0;n<=o;n+=5){i=ur;if(lr){var s=f+n/lt*(h-f),c=vi.getEnd()-vi.getStart(),r=s/c;r=Math.max(Math.min(r,1),0),i=wt(vi.getColorAt(r).getRgbaColor())}else if(wi)for(t=0;t=ii[t].start&&nd?d:n;b!==t&&(b=t,b>wt&&(wt=b),bd?d:n,t;b!==i&&(undefined!==dt&&dt.playing&&dt.stop(),dt=new Tween({},\"\",Tween.regularEaseInOut,b,i,1),t=this,dt.onMotionChanged=function(n){b=n.target._pos,bwt&&(wt=b),bs?s:n;v!==t&&(v=t,v>ft&&(ft=v),vs?s:n,t;v!==i&&(undefined!==yt&&yt.playing&&yt.stop(),yt=new Tween({},\"\",Tween.regularEaseInOut,v,i,1),t=this,yt.onMotionChanged=function(n){t.setValue(n.target._pos)},yt.start())},this.resetMinMeasuredValue=function(){at=v,this.repaint()},this.resetMaxMeasuredValue=function(){ft=v,this.repaint()},this.setMinMeasuredValueVisible=function(n){tr=n,this.repaint()},this.setMaxMeasuredValueVisible=function(n){di=n,this.repaint()},this.setThresholdVisible=function(n){ar=n,this.repaint()},this.setLcdDecimals=function(n){fr=n,this.repaint()},this.setFrameDesign=function(n){st({frame:!0}),sr=n,g({frame:!0}),this.repaint()},this.setBackgroundColor=function(n){st({background:!0}),w=n,g({background:!0}),this.repaint()},this.setValueColor=function(n){st({foreground:!0}),wt=n,g({foreground:!0}),this.repaint()},this.setLedColor=function(n){st({led:!0}),ti=n,g({led:!0}),this.repaint()},this.setLcdColor=function(n){st({background:!0}),lt=n,g({background:!0}),this.repaint()},this.setMaxMeasuredValue=function(n){var t=ns?s:n;ft=t,this.repaint()},this.setMinMeasuredValue=function(n){var t=ns?s:n;at=t,this.repaint()},this.setTitleString=function(n){gi=n,g({background:!0}),this.repaint()},this.setUnitString=function(n){wi=n,g({background:!0}),this.repaint()},this.setMinValue=function(n){st({background:!0}),e=n,mminMeasuredValues&&(ft=s),v>s&&(v=s),g({background:!0}),this.repaint()},this.getMaxValue=function(){return s},this.setThreshold=function(n){var t=ns?s:n;bt=t,g({background:!0}),this.repaint()},this.repaint=function(){pr||g({frame:!0,background:!0,led:!0,foreground:!0}),y.clearRect(0,0,y.canvas.width,y.canvas.height),or&&y.drawImage(ii,0,0),y.drawImage(ri,0,0),hi&&cu(y,v,h),er&&(v=ft[c].start&&o=ft[c].start&&es?s:n;l!==t&&(l=t,l>lt&&(lt=l),ls?s:n,t;l!==i&&(undefined!==dt&&dt.playing&&dt.stop(),dt=new Tween({},\"\",Tween.regularEaseInOut,l,i,1),t=this,dt.onMotionChanged=function(n){l=n.target._pos,llt&&(lt=l),ls?s:n;lt!==t&&(lt=t,this.repaint())},this.setMinMeasuredValue=function(n){var t=ns?s:n;at!==t&&(at=t,this.repaint())},this.setTitleString=function(n){ar=n,b({background:!0}),this.repaint()},this.setUnitString=function(n){rr=n,b({background:!0}),this.repaint()},this.setMinValue=function(n){u=n,b({background:!0,foreground:!0,pointer:!0}),this.repaint()},this.getMinValue=function(){return u},this.setMaxValue=function(n){s!==n&&(s=n,b({background:!0,foreground:!0,pointer:!0}),this.repaint())},this.getMaxValue=function(){return s},this.setThreshold=function(n){var t=ns?s:n;st!==t&&(st=t,b({background:!0}),this.repaint())},this.repaint=function(){tu||b({frame:!0,background:!0,led:!0,pointer:!0,foreground:!0,bargraphled:!0}),v.clearRect(0,0,v.canvas.width,v.canvas.height),kr&&v.drawImage(fi,0,0),or&&v.drawImage(hi,0,0),gi&&nf(v,l,h),br&&(lo-4?c||(e=o-l-o*.2,c=!0,clearTimeout(g),g=setTimeout(d,200)):ct&&l<=o-4&&(e=0,c=!1),u.fillText(n,o-2-e,h*.5+v*.38)),u.restore()},dt=function(n,i,r,u){var it=t(n,i),f=it.getContext(\"2d\");f.save();var pt=0,d=0,kt=n,et=i,rt=Math.min(n,i)*.095,h=f.createLinearGradient(0,d,0,d+et);h.addColorStop(0,\"#4c4c4c\"),h.addColorStop(.08,\"#666666\"),h.addColorStop(.92,\"#666666\"),h.addColorStop(1,\"#e6e6e6\"),f.fillStyle=h,s(f,pt,d,kt,et,rt),f.fill(),f.restore(),f.save();var nt=ft(r),e=st(nt[0],nt[1],nt[2]),g=ft(u.gradientStartColor),ht=st(g[0],g[1],g[2]),tt=ft(u.gradientFraction1Color),lt=st(tt[0],tt[1],tt[2]),a=ft(u.gradientFraction2Color),ct=st(a[0],a[1],a[2]),v=ft(u.gradientFraction3Color),wt=st(v[0],v[1],v[2]),c=ft(u.gradientStopColor),yt=st(c[0],c[1],c[2]),l=vt(e[0],e[1],ht[2]-.31),y=vt(e[0],e[1],lt[2]-.31),k=vt(e[0],e[1],ct[2]-.31),p=vt(e[0],e[1],wt[2]-.31),w=vt(e[0],e[1],yt[2]-.31),bt=1,b=1,ot=n-2,ut=i-2,at=rt-1,o=f.createLinearGradient(0,b,0,b+ut);return o.addColorStop(0,\"rgb(\"+l[0]+\", \"+l[1]+\", \"+l[2]+\")\"),o.addColorStop(.03,\"rgb(\"+y[0]+\",\"+y[1]+\",\"+y[2]+\")\"),o.addColorStop(.49,\"rgb(\"+k[0]+\",\"+k[1]+\",\"+k[2]+\")\"),o.addColorStop(.5,\"rgb(\"+p[0]+\",\"+p[1]+\",\"+p[2]+\")\"),o.addColorStop(1,\"rgb(\"+w[0]+\",\"+w[1]+\",\"+w[2]+\")\"),f.fillStyle=o,s(f,bt,b,ot,ut,at),f.fill(),f.restore(),it},yt=function(n){var i=ft(n),r=st(i[0],i[1],i[2]),t=vt(r[0],.57,.83);return\"rgb(\"+t[0]+\", \"+t[1]+\", \"+t[2]+\")\"},d=function(){c?(e>o&&(e=-l),e+=2,g=setTimeout(d,60)):e=0,wt.repaint()},k=function(){var n;nt=!0,rt=p(b,y,w);if(null!==f&&0=f[n].start&&a<=f[n].stop){t=et[n],i=ut[n];break}u.drawImage(t,0,0),kt(a,i)},this.repaint(),this},wr=function(n,t){t=t||{};var h=undefined===t.width?128:t.width,c=undefined===t.height?64:t.height,f=undefined===t.lcdColor?steelseries.LcdColor.STANDARD:t.lcdColor,k=undefined===t.lcdDecimals?2:t.lcdDecimals,d=undefined===t.unitString?\"\":t.unitString,b=undefined===t.unitStringVisible?!1:t.unitStringVisible,w=undefined===t.digitalFont?!1:t.digitalFont,ut=undefined===t.valuesNumeric?!0:t.valuesNumeric,o=undefined===t.value?0:t.value,s=0,i=r.getElementById(n).getContext(\"2d\");i.save(),i.clearRect(0,0,i.canvas.width,i.canvas.height),i.canvas.width=h,i.canvas.height=c;var e=h,u=c,g=Math.floor(u/1.875)+\"px sans-serif\",it=Math.floor(u/1.875)+\"px \"+tt,y=Math.floor(u/3.5)+\"px sans-serif\",rt=Math.floor(u/3.5)+\"px \"+tt,v=!1,l,nt=function(n){var t,o,r;i.save(),i.textAlign=\"right\",i.textBaseline=\"middle\",i.strokeStyle=f.textColor,i.fillStyle=f.textColor,(f===steelseries.LcdColor.STANDARD||f===steelseries.LcdColor.STANDARD_GREEN)&&(i.shadowColor=\"gray\",i.shadowOffsetX=u*.05,i.shadowOffsetY=u*.05,i.shadowBlur=u*.06),ut?(i.font=Math.floor(u/2.5)+\"px sans-serif\",t=0,b&&(i.font=Math.floor(u/2.5)+\"px sans-serif\",t=i.measureText(d).width),i.font=w?it:g,o=n.toFixed(k),i.fillText(o,e-t-4,u*.38),b&&(i.font=Math.floor(u/3)+\"px sans-serif\",i.fillText(d,e-2,u*.46)),r=s.toFixed(k),i.font=w?rt:y,i.textAlign=\"center\",i.fillText(r,e/2,u*.8)):(i.font=Math.floor(u/2.5)+\"px sans-serif\",i.fillText(n,e-2,u*.38),i.font=y,i.textAlign=\"center\",i.fillText(s,e/2,u*.8)),i.restore()},a=function(){v=!0,l=p(h,c,f)};return this.setValue=function(n){(o!==n||s!==n)&&(s=o,o=n,this.repaint())},this.setLcdColor=function(n){f=n,a(),this.repaint()},this.repaint=function(){v||a(),i.clearRect(0,0,i.canvas.width,i.canvas.height),i.drawImage(l,0,0),nt(o)},this.repaint(),this},br=function(n,u){u=u||{};var c=undefined===u.size?200:u.size,st=undefined===u.decimalsVisible?!1:u.decimalsVisible,gt=undefined===u.textOrientationFixed?!1:u.textOrientationFixed,bt=undefined===u.frameDesign?steelseries.FrameDesign.METAL:u.frameDesign,at=undefined===u.frameVisible?!0:u.frameVisible,p=undefined===u.backgroundColor?steelseries.BackgroundColor.DARK_GRAY:u.backgroundColor,vt=undefined===u.backgroundVisible?!0:u.backgroundVisible,b=undefined===u.pointerColor?steelseries.ColorDef.RED:u.pointerColor,lt=undefined===u.foregroundType?steelseries.ForegroundType.TYPE1:u.foregroundType,yt=undefined===u.foregroundVisible?!0:u.foregroundVisible,d,e=0,k=0,h=0,kt=Math.PI/180,ot=this.value,wt=st?1:0,s=r.getElementById(n).getContext(\"2d\");s.save(),s.clearRect(0,0,s.canvas.width,s.canvas.height),s.canvas.width=c,s.canvas.height=c;var f=c,o=c,l=f/2,a=o/2,pt=!1,g=t(c,c),ut=g.getContext(\"2d\"),nt=t(c,c),et=nt.getContext(\"2d\"),rt=t(c,c),ht=rt.getContext(\"2d\"),tt=t(c,c),ct=tt.getContext(\"2d\"),ni=function(n){n.textAlign=\"center\",n.textBaseline=\"middle\",n.save(),n.strokeStyle=p.labelColor.getRgbaColor(),n.fillStyle=p.labelColor.getRgbaColor(),n.translate(l,a);var r,t;for(i=0;360>i;i++){n.strokeStyle=p.labelColor.getRgbaColor(),n.lineWidth=.5,n.beginPath(),n.moveTo(f*.38,0),n.lineTo(f*.37,0),n.closePath(),n.stroke(),0==i%5&&(n.strokeStyle=p.labelColor.getRgbaColor(),n.lineWidth=1,n.beginPath(),n.moveTo(f*.38,0),n.lineTo(f*.36,0),n.closePath(),n.stroke()),0==i%45&&(n.strokeStyle=p.labelColor.getRgbaColor(),n.lineWidth=1,n.beginPath(),n.moveTo(f*.38,0),n.lineTo(f*.34,0),n.closePath(),n.stroke()),300n?360+n:n,t=359.9=e&&(h=90-e),90=e&&(h=e-90),180=e&&(h=270-e),270=e&&(h=e-270),0>e&&e>=-90&&(h=90-Math.abs(e)),e<-90&&e>=-180&&(h=Math.abs(e)-90),e<-180&&e>=-270&&(h=270-Math.abs(e)),e<-270&&e>=-360&&(h=Math.abs(e)-270),this.repaint())},this.getValue=function(){return e},this.setValueAnimated=function(n){360-n+e=e&&(h=90-e),90=e&&(h=e-90),180=e&&(h=270-e),270=e&&(h=e-270),0>e&&e>=-90&&(h=90-Math.abs(e)),e<-90&&e>=-180&&(h=Math.abs(e)-90),e<-180&&e>=-270&&(h=270-Math.abs(e)),e<-270&&e>=-360&&(h=Math.abs(e)-270),t.repaint()},d.start()}},this.setFrameDesign=function(n){ft(),bt=n,it(),this.repaint()},this.setBackgroundColor=function(n){ft(),p=n,it(),this.repaint()},this.setForegroundType=function(n){ft(),lt=n,it(),this.repaint()},this.setPointerColor=function(n){ft(),b=n,it(),this.repaint()},this.repaint=function(){pt||it(),s.save(),s.clearRect(0,0,s.canvas.width,s.canvas.height),(at||vt)&&s.drawImage(g,0,0),ot=Math.PI/2+e*kt-Math.PI/2,s.save(),s.translate(l,a),s.rotate(ot),s.translate(-l,-a),s.drawImage(nt,0,0),s.fillStyle=p.labelColor.getRgbaColor(),s.textAlign=\"center\",s.textBaseline=\"middle\",gt?(s.restore(),s.font=st?f*.1+\"px sans-serif\":f*.15+\"px sans-serif\",s.fillText(h.toFixed(wt)+\"\\u00b0\",l,a,f*.35)):(s.font=st?f*.15+\"px sans-serif\":f*.2+\"px sans-serif\",s.fillText(h.toFixed(wt)+\"\\u00b0\",l,a,f*.35),s.restore()),s.translate(l,a),s.rotate(ot+k*Math.PI/180),s.translate(-l,-a),s.drawImage(rt,0,0),s.restore(),yt&&s.drawImage(tt,0,0),s.restore()},this.repaint(),this},gr=function(n,u){u=u||{};var o=undefined===u.size?200:u.size,pt=undefined===u.frameDesign?steelseries.FrameDesign.METAL:u.frameDesign,ct=undefined===u.frameVisible?!0:u.frameVisible,tt=undefined===u.backgroundColor?steelseries.BackgroundColor.DARK_GRAY:u.backgroundColor,dt=undefined===u.backgroundVisible?!0:u.backgroundVisible,bt=undefined===u.pointerType?steelseries.PointerType.TYPE2:u.pointerType,h=undefined===u.pointerColor?steelseries.ColorDef.RED:u.pointerColor,ei=undefined===u.knobType?steelseries.KnobType.STANDARD_KNOB:u.knobType,ui=undefined===u.knobStyle?steelseries.KnobStyle.SILVER:u.knobStyle,gt=undefined===u.foregroundType?steelseries.ForegroundType.TYPE1:u.foregroundType,at=undefined===u.foregroundVisible?!0:u.foregroundVisible,c=undefined===u.pointSymbols?[\"N\",\"NE\",\"E\",\"SE\",\"S\",\"SW\",\"W\",\"NW\"]:u.pointSymbols,fi=undefined===u.customLayer?null:u.customLayer,ii=undefined===u.degreeScale?!1:u.degreeScale,yt=undefined===u.roseVisible?!0:u.roseVisible,d,p=0,st=Math.PI/180,ht=this.value,s=r.getElementById(n).getContext(\"2d\");s.save(),s.clearRect(0,0,s.canvas.width,s.canvas.height),s.canvas.width=o,s.canvas.height=o;var f=o,e=o,a=f/2,l=e/2,kt=!1,ft=t(o,o),g=ft.getContext(\"2d\"),ut=t(o,o),ti=ut.getContext(\"2d\"),it=t(o,o),lt=it.getContext(\"2d\"),ot=t(o,o),b=ot.getContext(\"2d\"),et=t(o,o),vt=et.getContext(\"2d\"),ri=function(n){var t,r,u;n.textAlign=\"center\",n.textBaseline=\"middle\",n.save(),n.strokeStyle=tt.labelColor.getRgbaColor(),n.fillStyle=tt.labelColor.getRgbaColor(),n.translate(a,l);if(ii)for(t=.08*f+\"px serif\",r=f*.033+\"px serif\",n.rotate(st*10),i=10;360>=i;i+=10){n.save();switch(i){case 360:n.translate(f*.35,0),n.rotate(Math.PI/2),n.font=t,n.fillText(c[2],0,0,f),n.translate(-f*.35,0);break;case 90:n.translate(f*.35,0),n.rotate(Math.PI/2),n.font=t,n.fillText(c[4],0,0,f),n.translate(-f*.35,0);break;case 180:n.translate(f*.35,0),n.rotate(Math.PI/2),n.font=t,n.fillText(c[6],0,0,f),n.translate(-f*.35,0);break;case 270:n.translate(f*.35,0),n.rotate(Math.PI/2),n.font=t,n.fillText(c[0],0,0,f),n.translate(-f*.35,0);break;default:u=(i+90)%360,n.translate(f*.37,0),n.rotate(Math.PI/2),n.font=r,n.fillText(\"0\".substring(u>=100)+u,0,0,f),n.translate(-f*.37,0)}n.restore(),n.rotate(st*10)}else for(t=.12*f+\"px serif\",r=.06*f+\"px serif\",i=0;360>i;i+=2.5){0==i%5&&(n.lineWidth=1,n.beginPath(),n.moveTo(f*.38,0),n.lineTo(f*.36,0),n.closePath(),n.stroke()),n.save();switch(i){case 0:n.translate(f*.35,0),n.rotate(Math.PI/2),n.font=t,n.fillText(c[2],0,0,f),n.translate(-f*.35,0);break;case 45:n.translate(f*.29,0),n.rotate(Math.PI/2),n.font=r,n.fillText(c[3],0,0,f),n.translate(-f*.29,0);break;case 90:n.translate(f*.35,0),n.rotate(Math.PI/2),n.font=t,n.fillText(c[4],0,0,f),n.translate(-f*.35,0);break;case 135:n.translate(f*.29,0),n.rotate(Math.PI/2),n.font=r,n.fillText(c[5],0,0,f),n.translate(-f*.29,0);break;case 180:n.translate(f*.35,0),n.rotate(Math.PI/2),n.font=t,n.fillText(c[6],0,0,f),n.translate(-f*.35,0);break;case 225:n.translate(f*.29,0),n.rotate(Math.PI/2),n.font=r,n.fillText(c[7],0,0,f),n.translate(-f*.29,0);break;case 270:n.translate(f*.35,0),n.rotate(Math.PI/2),n.font=t,n.fillText(c[0],0,0,f),n.translate(-f*.35,0);break;case 315:n.translate(f*.29,0),n.rotate(Math.PI/2),n.font=r,n.fillText(c[1],0,0,f),n.translate(-f*.29,0)}n.restore(),yt&&(0===i||22.5===i||45===i||67.5===i||90===i||112.5===i||135===i||157.5===i||180===i||202.5===i||225===i||247.5===i||270===i||292.5===i||315===i||337.5===i||360===i)&&(n.save(),n.beginPath(),i%45?n.moveTo(f*.29,0):n.moveTo(f*.38,0),n.lineTo(f*.1,0),n.closePath(),n.restore(),n.lineWidth=1,n.strokeStyle=tt.symbolColor.getRgbaColor(),n.stroke()),n.rotate(st*2.5)}n.translate(-a,-l),n.restore()},wt=function(n,t){var o,s,l,i,r,u,c;n.save(),t&&(n.fillStyle=\"rgba(0, 0, 0, 0.5)\",n.strokeStyle=\"rgba(0, 0, 0, 0.5)\");switch(bt.type){case\"type2\":n.beginPath(),n.moveTo(f*.53271,e*.453271),n.bezierCurveTo(f*.53271,e*.453271,f*.5,e*.149532,f*.5,e*.149532),n.bezierCurveTo(f*.5,e*.149532,f*.467289,e*.453271,f*.467289,e*.453271),n.bezierCurveTo(f*.453271,e*.462616,f*.443925,e*.481308,f*.443925,e*.5),n.bezierCurveTo(f*.443925,e*.5,f*.556074,e*.5,f*.556074,e*.5),n.bezierCurveTo(f*.556074,e*.481308,f*.546728,e*.462616,f*.53271,e*.453271),n.closePath(),t||(o=n.createLinearGradient(.471962*f,0,.528036*f,0),o.addColorStop(0,h.light.getRgbaColor()),o.addColorStop(.46,h.light.getRgbaColor()),o.addColorStop(.47,h.medium.getRgbaColor()),o.addColorStop(1,h.medium.getRgbaColor()),n.fillStyle=o,n.strokeStyle=h.dark.getRgbaColor()),n.lineWidth=1,n.lineCap=\"square\",n.lineJoin=\"miter\",n.fill(),n.stroke(),n.beginPath(),n.moveTo(f*.467289,e*.546728),n.bezierCurveTo(f*.467289,e*.546728,f*.5,e*.850467,f*.5,e*.850467),n.bezierCurveTo(f*.5,e*.850467,f*.53271,e*.546728,f*.53271,e*.546728),n.bezierCurveTo(f*.546728,e*.537383,f*.556074,e*.518691,f*.556074,e*.5),n.bezierCurveTo(f*.556074,e*.5,f*.443925,e*.5,f*.443925,e*.5),n.bezierCurveTo(f*.443925,e*.518691,f*.453271,e*.537383,f*.467289,e*.546728),n.closePath(),t||(s=n.createLinearGradient(.471962*f,0,.528036*f,0),s.addColorStop(0,\"#e3e5e8\"),s.addColorStop(.48,\"#e3e5e8\"),s.addColorStop(.48,\"#abb1b8\"),s.addColorStop(1,\"#abb1b8\"),n.fillStyle=s,l=\"#abb1b8\",n.strokeStyle=l),n.lineWidth=1,n.lineCap=\"square\",n.lineJoin=\"miter\",n.fill(),n.stroke();break;case\"type3\":n.beginPath(),n.moveTo(f*.5,e*.149532),n.bezierCurveTo(f*.5,e*.149532,f*.443925,e*.490654,f*.443925,e*.5),n.bezierCurveTo(f*.443925,e*.53271,f*.467289,e*.556074,f*.5,e*.556074),n.bezierCurveTo(f*.53271,e*.556074,f*.556074,e*.53271,f*.556074,e*.5),n.bezierCurveTo(f*.556074,e*.490654,f*.5,e*.149532,f*.5,e*.149532),n.closePath(),t||(i=n.createLinearGradient(.471962*f,0,.528036*f,0),i.addColorStop(0,h.light.getRgbaColor()),i.addColorStop(.46,h.light.getRgbaColor()),i.addColorStop(.47,h.medium.getRgbaColor()),i.addColorStop(1,h.medium.getRgbaColor()),n.fillStyle=i,n.strokeStyle=h.dark.getRgbaColor()),n.lineWidth=1,n.lineCap=\"square\",n.lineJoin=\"miter\",n.fill(),n.stroke();break;case\"type1:\":default:n.beginPath(),n.moveTo(f*.5,e*.495327),n.lineTo(f*.528037,e*.495327),n.lineTo(f*.5,e*.149532),n.lineTo(f*.471962,e*.495327),n.lineTo(f*.5,e*.495327),n.closePath(),t||(r=n.createLinearGradient(.471962*f,0,.528036*f,0),r.addColorStop(0,h.light.getRgbaColor()),r.addColorStop(.46,h.light.getRgbaColor()),r.addColorStop(.47,h.medium.getRgbaColor()),r.addColorStop(1,h.medium.getRgbaColor()),n.fillStyle=r,n.strokeStyle=h.dark.getRgbaColor()),n.lineWidth=1,n.lineCap=\"square\",n.lineJoin=\"miter\",n.fill(),n.stroke(),n.beginPath(),n.moveTo(f*.5,e*.504672),n.lineTo(f*.471962,e*.504672),n.lineTo(f*.5,e*.850467),n.lineTo(f*.528037,e*.504672),n.lineTo(f*.5,e*.504672),n.closePath(),t||(u=n.createLinearGradient(.471962*f,0,.528036*f,0),u.addColorStop(0,\"#e3e5e8\"),u.addColorStop(.48,\"#e3e5e8\"),u.addColorStop(.480099,\"#abb1b8\"),u.addColorStop(1,\"#abb1b8\"),n.fillStyle=u,c=\"#abb1b8\",n.strokeStyle=c),n.lineWidth=1,n.lineCap=\"square\",n.lineJoin=\"miter\",n.fill(),n.stroke()}t&&blur(n,f,e,Math.floor(f*.006)),n.restore()},k=function(){kt=!0,ct&&v(g,pt,a,l,f,e),dt&&(w(g,tt,a,l,f,e),rt(g,fi,a,l,f,e),yt&&hi(g,a,l,f,e,tt),ri(g)),wt(ti,!1),wt(lt,!0),at&&y(vt,gt,f,e,!0,ei,ui)},nt=function(){ft.width=o,ft.height=o,g=ft.getContext(\"2d\"),ut.width=o,ut.height=o,ti=ut.getContext(\"2d\"),it.width=o,it.height=o,lt=it.getContext(\"2d\"),ot.width=o,ot.height=o,b=ot.getContext(\"2d\"),et.width=o,et.height=o,vt=et.getContext(\"2d\")};return this.setValue=function(n){n=n%360,p!==n&&(p=n,this.repaint())},this.getValue=function(){return p},this.setValueAnimated=function(n){var i=n%360,r=this,t;p!==i&&(undefined!==d&&d.playing&&d.stop(),t=ni(p,i),d=new Tween({},\"\",Tween.elasticEaseOut,p,p+t,2),d.onMotionChanged=function(n){p=n.target._pos%360,r.repaint()},d.start())},this.setFrameDesign=function(n){nt(),pt=n,k(),this.repaint()},this.setBackgroundColor=function(n){nt(),tt=n,k(),this.repaint()},this.setForegroundType=function(n){nt(),gt=n,k(),this.repaint()},this.setPointerColor=function(n){nt(),h=n,k(),this.repaint()},this.setPointerType=function(n){nt(),bt=n,k(),this.repaint()},this.setPointSymbols=function(n){nt(),c=n,k(),this.repaint()},this.repaint=function(){kt||k(),s.clearRect(0,0,s.canvas.width,s.canvas.height),(ct||dt)&&s.drawImage(ft,0,0),ht=Math.PI/2+p*st-Math.PI/2;var n=f*.006;b.clearRect(0,0,f,e),b.save(),b.translate(a,l),b.rotate(ht),b.translate(-a,-l),b.drawImage(it,0,0),b.restore(),s.drawImage(ot,0,0,f,e,n,n,f+n,e+n),s.save(),s.translate(a,l),s.rotate(ht),s.translate(-a,-l),s.drawImage(ut,0,0),s.restore(),at&&s.drawImage(et,0,0),s.restore()},this.repaint(),this},iu=function(n,u){u=u||{};var o=undefined===u.size?200:u.size,pi=undefined===u.frameDesign?steelseries.FrameDesign.METAL:u.frameDesign,di=undefined===u.frameVisible?!0:u.frameVisible,k=undefined===u.backgroundColor?steelseries.BackgroundColor.DARK_GRAY:u.backgroundColor,gi=undefined===u.backgroundVisible?!0:u.backgroundVisible,dt=undefined===u.pointerTypeLatest?steelseries.PointerType.TYPE1:u.pointerTypeLatest,ri=undefined===u.pointerTypeAverage?steelseries.PointerType.TYPE8:u.pointerTypeAverage,kt=undefined===u.pointerColor?steelseries.ColorDef.RED:u.pointerColor,ii=undefined===u.pointerColorAverage?steelseries.ColorDef.BLUE:u.pointerColorAverage,kr=undefined===u.knobType?steelseries.KnobType.STANDARD_KNOB:u.knobType,dr=undefined===u.knobStyle?steelseries.KnobStyle.SILVER:u.knobStyle,si=undefined===u.foregroundType?steelseries.ForegroundType.TYPE1:u.foregroundType,ir=undefined===u.foregroundVisible?!0:u.foregroundVisible,a=undefined===u.pointSymbols?[\"N\",\"NE\",\"E\",\"SE\",\"S\",\"SW\",\"W\",\"NW\"]:u.pointSymbols,vr=undefined===u.customLayer?null:u.customLayer,wr=undefined===u.degreeScale?!0:u.degreeScale,nr=undefined===u.roseVisible?!1:u.roseVisible,ht=undefined===u.lcdColor?steelseries.LcdColor.STANDARD:u.lcdColor,fr=undefined===u.lcdVisible?!0:u.lcdVisible,pr=undefined===u.digitalFont?!1:u.digitalFont,et=undefined===u.section?null:u.section,ft=undefined===u.area?null:u.area,ti=undefined===u.lcdTitleStrings?[\"Latest\",\"Average\"]:u.lcdTitleStrings,rr=undefined===u.titleString?\"\":u.titleString,tr=undefined===u.useColorLabels?!1:u.useColorLabels,ut,st,it=0,g=0,ct=Math.PI/180,ei=this.valueLatest,fi=this.valueAverage,ar=-Math.PI/2,bi=Math.PI*2,ur=360,e=r.getElementById(n).getContext(\"2d\");e.save(),e.clearRect(0,0,e.canvas.width,e.canvas.height),e.canvas.width=o,e.canvas.height=o;var f=o,s=o,c=f/2,h=s/2,ui=Math.floor(f/10),br=ui+\"px sans-serif\",gr=ui+\"px \"+tt,gt=f*.3,er=s*.12,hr=(f-gt)/2,or=s*.32,cr=s*.565,sr=!1,bt=t(o,o),d=bt.getContext(\"2d\"),oi,at=t(o,o),ci=at.getContext(\"2d\"),vt=t(o,o),li=vt.getContext(\"2d\"),yt=t(o,o),ai=yt.getContext(\"2d\"),lt=t(o,o),ki=lt.getContext(\"2d\"),ot=t(o,o),l=ot.getContext(\"2d\"),wt=t(o,o),yi=wt.getContext(\"2d\"),vi=function(n,t){e.save(),e.textAlign=\"center\",e.strokeStyle=ht.textColor,e.fillStyle=ht.textColor,n<0&&(n+=360),n=\"00\"+Math.round(n),n=n.substring(n.length,n.length-3),(ht===steelseries.LcdColor.STANDARD||ht===steelseries.LcdColor.STANDARD_GREEN)&&(e.shadowColor=\"gray\",e.shadowOffsetX=f*.007,e.shadowOffsetY=f*.007,e.shadowBlur=f*.007),e.font=pr?gr:br,e.fillText(n+\"\\u00b0\",f/2+gt*.05,(t?or:cr)+er*.5+ui*.38,gt*.9),e.restore()},wi=function(n,t,i,r,u){n.save(),n.strokeStyle=r,n.fillStyle=r,n.lineWidth=f*.035;var e=bi/ur*t,o=e+(i-t)/(ur/bi);n.translate(c,h),n.rotate(ar),n.beginPath(),u?(n.moveTo(0,0),n.arc(0,0,f*.365-n.lineWidth/2,e,o,!1)):n.arc(0,0,f*.365,e,o,!1),u?(n.moveTo(0,0),n.fill()):n.stroke(),n.translate(-c,-h),n.restore()},lr=function(n){var l,o;n.textAlign=\"center\",n.textBaseline=\"middle\";var s=f*.38,v=f*.35,w=f*.355,p=f*.36,e=f*.1,y=f*.31,r=f*.36,t,u;n.save(),n.strokeStyle=k.labelColor.getRgbaColor(),n.fillStyle=k.labelColor.getRgbaColor(),n.translate(c,h);if(wr)for(t=Math.floor(.1*f)+\"px serif bold\",u=Math.floor(f*.04)+\"px sans-serif\",n.rotate(ct*5),i=5;360>=i;i+=5){n.save();switch(i){case 360:n.translate(r,0),n.rotate(Math.PI/2),n.font=t,n.fillText(a[2],0,0,e),n.translate(-r,0);break;case 90:n.translate(r,0),n.rotate(Math.PI/2),n.font=t,n.fillText(a[4],0,0,e),n.translate(-r,0);break;case 180:n.translate(r,0),n.rotate(Math.PI/2),n.font=t,n.fillText(a[6],0,0,e),n.translate(-r,0);break;case 270:n.translate(r,0),n.rotate(Math.PI/2),n.font=t,n.fillText(a[0],0,0,e),n.translate(-r,0);break;case 5:case 85:case 95:case 175:case 185:case 265:case 275:case 355:break;default:(i+90)%20?(n.lineWidth=(i+90)%5?1.5:1,n.beginPath(),n.moveTo(s,0),l=(i+90)%10?p:v,n.lineTo(l,0),n.closePath(),n.stroke()):(n.lineWidth=1.5,n.beginPath(),n.moveTo(s,0),n.lineTo(v,0),n.closePath(),n.stroke(),o=(i+90)%360,n.translate(y,0),n.rotate(Math.PI/2),n.font=u,n.fillText(\"0\".substring(o>=100)+o,0,0,e),n.translate(-y,0))}n.restore(),n.rotate(ct*5)}else for(t=.12*f+\"px serif\",u=.06*f+\"px serif\",n.lineWidth=1,n.strokeStyle=k.symbolColor.getRgbaColor(),i=0;360>i;i+=2.5){0==i%5&&(n.beginPath(),n.moveTo(f*.38,0),n.lineTo(f*.36,0),n.closePath(),n.stroke()),n.save();switch(i){case 0:n.translate(f*.35,0),n.rotate(Math.PI/2),n.font=t,n.fillText(a[2],0,0),n.translate(-f*.35,0);break;case 45:n.translate(f*.29,0),n.rotate(Math.PI/2),n.font=u,n.fillText(a[3],0,0),n.translate(-f*.29,0);break;case 90:n.translate(f*.35,0),n.rotate(Math.PI/2),n.font=t,n.fillText(a[4],0,0),n.translate(-f*.35,0);break;case 135:n.translate(f*.29,0),n.rotate(Math.PI/2),n.font=u,n.fillText(a[5],0,0),n.translate(-f*.29,0);break;case 180:n.translate(f*.35,0),n.rotate(Math.PI/2),n.font=t,n.fillText(a[6],0,0),n.translate(-f*.35,0);break;case 225:n.translate(f*.29,0),n.rotate(Math.PI/2),n.font=u,n.fillText(a[7],0,0),n.translate(-f*.29,0);break;case 270:n.translate(f*.35,0),n.rotate(Math.PI/2),n.font=t,n.fillText(a[0],0,0),n.translate(-f*.35,0);break;case 315:n.translate(f*.29,0),n.rotate(Math.PI/2),n.font=u,n.fillText(a[1],0,0),n.translate(-f*.29,0)}n.restore(),nr&&(0===i||22.5===i||45===i||67.5===i||90===i||112.5===i||135===i||157.5===i||180===i||202.5===i||225===i||247.5===i||270===i||292.5===i||315===i||337.5===i||360===i)&&(n.save(),n.beginPath(),i%45?n.moveTo(f*.29,0):n.moveTo(f*.38,0),n.lineTo(f*.1,0),n.closePath(),n.restore(),n.stroke()),n.rotate(ct*2.5)}n.translate(-c,-h),n.restore()},yr=function(n){ti.length>0&&(n.save(),n.textAlign=\"center\",n.textBaseline=\"middle\",n.fillStyle=tr?kt.medium.getRgbaColor():k.labelColor.getRgbaColor(),n.font=.04*f+\"px sans-serif\",n.fillText(ti[0],f/2,s*.29,f*.3),n.fillStyle=tr?ii.medium.getRgbaColor():k.labelColor.getRgbaColor(),n.fillText(ti[1],f/2,s*.71,f*.3),rr.length>0&&(n.fillStyle=k.labelColor.getRgbaColor(),n.font=.0467*f+\"px sans-serif\",n.fillText(rr,f/2,s*.5,f*.3)))},b=function(n){var t,i,u;n=n||{};var o=undefined===n.frame?!1:n.frame,r=undefined===n.background?!1:n.background,e=undefined===n.pointer?!1:n.pointer,l=undefined===n.foreground?!1:n.foreground;sr=!0,o&&di&&v(d,pi,c,h,f,s);if(r&&gi){w(d,k,c,h,f,s),rt(d,vr,c,h,f,s);if(null!==et&&00;i-=s)r>90||(e?(n.fillText(r,(t-t*.2)/2-8,i,t*.375),n.fillText(r,t-(t-t*.2)/2+8,i,t*.375),n.beginPath(),n.moveTo((t-t*.2)/2,i),n.lineTo(t-(t-t*.2)/2,i),n.closePath(),r+=10):(n.beginPath(),n.moveTo((t-t*.1)/2,i),n.lineTo(t-(t-t*.1)/2,i),n.closePath()),n.stroke()),e^=!0;for(e=!1,r=10,n.strokeStyle=\"#FFFFFF\",n.lineWidth=1.5,n.beginPath(),n.moveTo(0,u/2),n.lineTo(t,u/2),n.closePath(),n.stroke(),n.fillStyle=\"#FFFFFF\",n.lineWidth=1,i=u/2+s;i<=u;i+=s)r>90||(e?(n.fillText(-r,(t-t*.2)/2-8,i,t*.375),n.fillText(-r,t-(t-t*.2)/2+8,i,t*.375),n.beginPath(),n.moveTo((t-t*.2)/2,i),n.lineTo(t-(t-t*.2)/2,i),n.closePath(),r+=10):(n.beginPath(),n.moveTo((t-t*.1)/2,i),n.lineTo(t-(t-t*.1)/2,i),n.closePath()),n.stroke()),e^=!0;n.restore()},wt=function(n){var i,r,t;for(n.save(),n.fillStyle=nt.light.getRgbaColor(),n.beginPath(),n.moveTo(u*.476635,f*.5),n.bezierCurveTo(u*.476635,f*.514018,u*.485981,f*.523364,u*.5,f*.523364),n.bezierCurveTo(u*.514018,f*.523364,u*.523364,f*.514018,u*.523364,f*.5),n.bezierCurveTo(u*.523364,f*.485981,u*.514018,f*.476635,u*.5,f*.476635),n.bezierCurveTo(u*.485981,f*.476635,u*.476635,f*.485981,u*.476635,f*.5),n.closePath(),n.moveTo(u*.415887,f*.504672),n.lineTo(u*.415887,f*.495327),n.bezierCurveTo(u*.415887,f*.495327,u*.467289,f*.495327,u*.467289,f*.495327),n.bezierCurveTo(u*.471962,f*.481308,u*.481308,f*.471962,u*.495327,f*.467289),n.bezierCurveTo(u*.495327,f*.467289,u*.495327,f*.415887,u*.495327,f*.415887),n.lineTo(u*.504672,f*.415887),n.bezierCurveTo(u*.504672,f*.415887,u*.504672,f*.467289,u*.504672,f*.467289),n.bezierCurveTo(u*.518691,f*.471962,u*.528037,f*.481308,u*.53271,f*.495327),n.bezierCurveTo(u*.53271,f*.495327,u*.584112,f*.495327,u*.584112,f*.495327),n.lineTo(u*.584112,f*.504672),n.bezierCurveTo(u*.584112,f*.504672,u*.53271,f*.504672,u*.53271,f*.504672),n.bezierCurveTo(u*.528037,f*.518691,u*.518691,f*.53271,u*.5,f*.53271),n.bezierCurveTo(u*.481308,f*.53271,u*.471962,f*.518691,u*.467289,f*.504672),n.bezierCurveTo(u*.467289,f*.504672,u*.415887,f*.504672,u*.415887,f*.504672),n.closePath(),n.fill(),i=5,r=Math.PI/36,n.translate(l,c),n.rotate(-Math.PI/2),n.translate(-l,-c),t=-90;t<=90;t+=i)t%45==0||t===0?(n.strokeStyle=nt.medium.getRgbaColor(),n.lineWidth=2,n.beginPath(),n.moveTo(u*.5,f*.088785),n.lineTo(u*.5,f*.113),n.closePath(),n.stroke()):t%15==0?(n.strokeStyle=\"#FFFFFF\",n.lineWidth=1,n.beginPath(),n.moveTo(u*.5,f*.088785),n.lineTo(u*.5,f*.103785),n.closePath(),n.stroke()):(n.strokeStyle=\"#FFFFFF\",n.lineWidth=.5,n.beginPath(),n.moveTo(u*.5,f*.088785),n.lineTo(u*.5,f*.093785),n.closePath(),n.stroke()),n.translate(l,c),n.rotate(r,l,c),n.translate(-l,-c);n.restore()},at=function(n){n.save();var i=u*.037383,t=f*.056074;n.beginPath(),n.moveTo(i*.5,0),n.lineTo(0,t),n.lineTo(i,t),n.closePath(),n.fillStyle=nt.light.getRgbaColor(),n.fill(),n.strokeStyle=nt.medium.getRgbaColor(),n.stroke(),n.restore()},it=function(){ct=!0,vt&&v(ht,lt,l,c,u,f),pt(ft),at(ut),wt(tt),yt&&y(tt,st,u,f,!0,fi,oi,ai)},rt=function(){k.width=o,k.height=o,ht=k.getContext(\"2d\"),p.width=o,p.height=o*Math.PI,ft=p.getContext(\"2d\"),a.width=o*.037383,a.height=o*.056074,ut=a.getContext(\"2d\"),d.width=o,d.height=o,tt=d.getContext(\"2d\")};return this.setRoll=function(n){n=n%360,h!==n&&(h=n,this.repaint())},this.getRoll=function(){return h},this.setRollAnimated=function(n){n=n%360;if(h!==n){var t=this;undefined!==w&&w.playing&&w.stop(),w=new Tween({},\"\",Tween.regularEaseInOut,h,n,1),w.onMotionChanged=function(n){h=n.target._pos,t.repaint()},w.start()}},this.setPitch=function(n){n=(n+180-et)%360-180,s!==n&&(s=n,s>90?(s=180-s,g||this.setRoll(h-180),g=!0):s<-90?(s=-180-s,g||this.setRoll(h+180),g=!0):g=!1,this.repaint())},this.getPitch=function(){return s},this.setPitchAnimated=function(n){if(s!==n){undefined!==b&&b.playing&&b.stop();var t=this;b=new Tween({},\"\",Tween.regularEaseInOut,s,n,1),b.onMotionChanged=function(n){t.setPitch(n.target._pos)},b.start()}},this.setPitchOffset=function(n){et=n,this.repaint()},this.setFrameDesign=function(n){rt(),lt=n,it(),this.repaint()},this.setForegroundType=function(n){rt(),st=n,it(),this.repaint()},this.repaint=function(){ct||it(),e.save(),e.clearRect(0,0,e.canvas.width,e.canvas.height),e.drawImage(k,0,0),e.save(),e.beginPath(),e.arc(l,c,u*.831775/2,0,Math.PI*2,!0),e.closePath(),e.clip(),e.translate(l,c),e.rotate(-(h*Math.PI/180)),e.translate(-l,0),e.translate(0,s*ot),e.drawImage(p,0,-p.height/2),e.translate(0,-(s*ot)-c),e.drawImage(a,u*.5-a.width/2,u*.107476),e.restore(),e.drawImage(d,0,0),e.restore()},this.repaint(),this},nu=function(n,t){var a,e,h,f,c;t=t||{};var u=undefined===t.size?32:t.size,y=undefined===t.ledColor?steelseries.LedColor.RED_LED:t.ledColor,v=!1,p=0,i=r.getElementById(n).getContext(\"2d\");i.save(),i.clearRect(0,0,i.canvas.width,i.canvas.height),i.canvas.width=u,i.canvas.height=u,a=!1,e=r.createElement(\"canvas\"),e.width=u,e.height=u,h=e.getContext(\"2d\"),f=r.createElement(\"canvas\"),f.width=u,f.height=u;var l=f.getContext(\"2d\"),s=f,w=function(){a=!0,h.clearRect(0,0,h.canvas.width,h.canvas.height),h.drawImage(o(u,1,y),0,0),l.clearRect(0,0,l.canvas.width,l.canvas.height),l.drawImage(o(u,0,y),0,0)};return this.toggleLed=function(){s=s===e?f:e,c()},this.setLedColor=function(n){y=n,a=!1,c()},this.setLedOnOff=function(n){s=!0===n?e:f,c()},this.blink=function(n){n?v||(p=setInterval(this.toggleLed,1e3),v=!0):v&&(clearInterval(p),v=!1)},c=function(){a||w(),i.save(),i.clearRect(0,0,i.canvas.width,i.canvas.height),i.drawImage(s,0,0),i.restore()},c(),this},tu=function(n,i){i=i||{};var f=undefined===i.size?200:i.size,di=undefined===i.frameDesign?steelseries.FrameDesign.METAL:i.frameDesign,ki=undefined===i.frameVisible?!0:i.frameVisible,p=undefined===i.pointerType?steelseries.PointerType.TYPE1:i.pointerType,b=undefined===i.pointerColor?p===steelseries.PointerType.TYPE1?steelseries.ColorDef.GRAY:steelseries.ColorDef.BLACK:i.pointerColor,ut=undefined===i.backgroundColor?p===steelseries.PointerType.TYPE1?steelseries.BackgroundColor.ANTHRACITE:steelseries.BackgroundColor.LIGHT_GRAY:i.backgroundColor,yi=undefined===i.backgroundVisible?!0:i.backgroundVisible,bi=undefined===i.foregroundType?steelseries.ForegroundType.TYPE1:i.foregroundType,si=undefined===i.foregroundVisible?!0:i.foregroundVisible,or=undefined===i.customLayer?null:i.customLayer,nt=undefined===i.isAutomatic?!0:i.isAutomatic,l=undefined===i.hour?11:i.hour,a=undefined===i.minute?5:i.minute,d=undefined===i.second?0:i.second,kt=undefined===i.secondMovesContinuous?!1:i.secondMovesContinuous,dt=undefined===i.timeZoneOffsetHour?0:i.timeZoneOffsetHour,wt=undefined===i.timeZoneOffsetMinute?0:i.timeZoneOffsetMinute,bt=undefined===i.secondPointerVisible?!0:i.secondPointerVisible,k=new Date,ui,ri,ii,nr,it=kt?100:1e3;it=bt?it:100;var sr=this,hr=Math.PI/2,gt=Math.PI*2,tt=Math.PI/180,fi=6,o=r.getElementById(n).getContext(\"2d\");o.save(),o.clearRect(0,0,o.canvas.width,o.canvas.height),o.canvas.width=f,o.canvas.height=f;var u=f,e=f,s=u/2,h=e/2,pi=!1,st=t(f,f),wi=st.getContext(\"2d\"),et=t(f,f),ti=et.getContext(\"2d\"),ot=t(f,f),gi=ot.getContext(\"2d\"),pt=t(f,f),tr=pt.getContext(\"2d\"),vt=t(f,f),rr=vt.getContext(\"2d\"),lt=t(f,f),ir=lt.getContext(\"2d\"),ht=t(f,f),hi=ht.getContext(\"2d\"),yt=t(f,f),ai=yt.getContext(\"2d\"),g=t(f,f),c=g.getContext(\"2d\"),at=t(f,f),oi=at.getContext(\"2d\"),fr=function(n,t){var i,e,o,r,f;r=u*.405,n.save(),n.translate(s,h);switch(t.type){case\"type1\":for(e=u*.074766,f=r-e,n.strokeStyle=ut.labelColor.getRgbaColor(),n.lineWidth=u*.014018,i=0;i<360;i+=30)n.beginPath(),n.moveTo(r,0),n.lineTo(f,0),n.closePath(),n.stroke(),n.rotate(30*tt);for(o=u*.126168,f=r-o,n.lineWidth=u*.03271,i=0;i<360;i+=90)n.beginPath(),n.moveTo(r,0),n.lineTo(f,0),n.closePath(),n.stroke(),n.rotate(90*tt);break;case\"type2\":default:for(e=u*.037383,f=r-e,n.strokeStyle=ut.labelColor.getRgbaColor(),n.lineWidth=u*.009345,i=0;i<360;i+=6)n.beginPath(),n.moveTo(r,0),n.lineTo(f,0),n.closePath(),n.stroke(),n.rotate(6*tt);for(o=u*.084112,f=r-o,n.lineWidth=u*.028037,i=0;i<360;i+=30)n.beginPath(),n.moveTo(r,0),n.lineTo(f,0),n.closePath(),n.stroke(),n.rotate(30*tt)}n.translate(-s,-h),n.restore()},vi=function(n,t,i){n.save();var r;i&&(n.fillStyle=\"rgba(0, 0, 0, 0.5)\",n.strokeStyle=\"rgba(0, 0, 0, 0.5)\");switch(t.type){case\"type2\":n.beginPath(),n.lineWidth=u*.046728,n.moveTo(s,u*.289719),n.lineTo(s,u*.289719+u*.224299),i||(n.strokeStyle=b.medium.getRgbaColor()),n.closePath(),n.stroke();break;case\"type1\":default:n.beginPath(),n.moveTo(u*.471962,e*.560747),n.lineTo(u*.471962,e*.214953),n.lineTo(u*.5,e*.182242),n.lineTo(u*.528037,e*.214953),n.lineTo(u*.528037,e*.560747),n.lineTo(u*.471962,e*.560747),n.closePath(),i||(r=n.createLinearGradient(u*.471962,e*.560747,u*.528037,e*.214953),r.addColorStop(1,b.veryLight.getRgbaColor()),r.addColorStop(0,b.light.getRgbaColor()),n.fillStyle=r,n.strokeStyle=b.light.getRgbaColor()),n.fill(),n.stroke()}i&&blur(n,u,e,Math.floor(u*.006)),n.restore()},li=function(n,t,i){n.save();var r;i&&(n.fillStyle=\"rgba(0, 0, 0, 0.4)\",n.strokeStyle=\"rgba(0, 0, 0, 0.4)\");switch(t.type){case\"type2\":n.beginPath(),n.lineWidth=u*.03271,n.moveTo(s,u*.116822),n.lineTo(s,u*.116822+u*.38785),i||(n.strokeStyle=b.medium.getRgbaColor()),n.closePath(),n.stroke();break;case\"type1\":default:n.beginPath(),n.moveTo(u*.518691,e*.574766),n.lineTo(u*.523364,e*.135514),n.lineTo(u*.5,e*.107476),n.lineTo(u*.476635,e*.140186),n.lineTo(u*.476635,e*.574766),n.lineTo(u*.518691,e*.574766),n.closePath(),i||(r=n.createLinearGradient(u*.518691,e*.574766,u*.476635,e*.140186),r.addColorStop(1,b.veryLight.getRgbaColor()),r.addColorStop(0,b.light.getRgbaColor()),n.fillStyle=r,n.strokeStyle=b.light.getRgbaColor()),n.fill(),n.stroke()}i&&blur(n,u,e,Math.floor(u*.006)),n.restore()},ci=function(n,t,i){n.save();var r;i?(n.fillStyle=\"rgba(0, 0, 0, 0.5)\",n.strokeStyle=\"rgba(0, 0, 0, 0.5)\"):(n.fillStyle=steelseries.ColorDef.RED.medium.getRgbaColor(),n.strokeStyle=steelseries.ColorDef.RED.medium.getRgbaColor());switch(t.type){case\"type2\":n.lineWidth=u*.009345,n.beginPath(),n.moveTo(s,u*.09813),n.lineTo(s,u*.09813+u*.126168),n.closePath(),n.stroke(),n.lineWidth=u*.018691,n.beginPath(),n.moveTo(s,u*.308411),n.lineTo(s,u*.308411+u*.191588),n.closePath(),n.stroke(),n.lineWidth=u*.016,n.beginPath(),n.arc(s,u*.26,u*.085/2,0,gt),n.closePath(),n.stroke();break;case\"type1\":default:n.beginPath(),n.moveTo(u*.509345,e*.116822),n.lineTo(u*.509345,e*.574766),n.lineTo(u*.490654,e*.574766),n.lineTo(u*.490654,e*.116822),n.lineTo(u*.509345,e*.116822),n.closePath(),i||(r=n.createLinearGradient(u*.509345,e*.116822,u*.490654,e*.574766),r.addColorStop(0,steelseries.ColorDef.RED.light.getRgbaColor()),r.addColorStop(.47,steelseries.ColorDef.RED.medium.getRgbaColor()),r.addColorStop(1,steelseries.ColorDef.RED.dark.getRgbaColor()),n.fillStyle=r,n.strokeStyle=steelseries.ColorDef.RED.dark.getRgbaColor()),n.fill(),n.stroke()}i&&blur(n,u,e,Math.floor(u*.006)),n.restore()},er=function(n){var i=u*.006,t;n.beginPath(),n.arc(s,h,u*.045,0,gt),n.closePath(),t=n.createLinearGradient(s-u*.045/2,h-u*.045/2,s+u*.045/2,h+u*.045/2),t.addColorStop(0,\"#eef0f2\"),t.addColorStop(1,\"#65696d\"),n.fillStyle=t,n.fill()},ur=function(n,t){var r=u*.006,i;n.save();switch(t.type){case\"type2\":n.fillStyle=\"#000000\",n.beginPath(),n.arc(s,h,u*.088785/2,0,gt),n.closePath(),n.fill();break;case\"type1\":default:i=n.createLinearGradient(s-u*.027/2,h-u*.027/2,s+u*.027/2,h+u*.027/2),i.addColorStop(0,\"#f3f4f7\"),i.addColorStop(.11,\"#f3f5f7\"),i.addColorStop(.12,\"#f1f3f5\"),i.addColorStop(.2,\"#c0c5cb\"),i.addColorStop(.2,\"#bec3c9\"),i.addColorStop(1,\"#bec3c9\"),n.fillStyle=i,n.beginPath(),n.arc(s,h,u*.027,0,gt),n.closePath(),n.fill()}n.restore()},ni=function(n,t,i){ii=i*fi*tt,ui=t*fi*tt,ri=(n+t/60)*fi*5*tt},ei=function(){nt?k=new Date:(k.setHours(l),k.setMinutes(a),k.setSeconds(d)),d=k.getSeconds()+(kt?k.getMilliseconds()/1e3:0),l=dt!==0&&wt!==0?k.getUTCHours()+dt:k.getHours(),l=l%12,a=dt!==0&&wt!==0?k.getUTCMinutes()+wt:k.getMinutes(),a>60&&(a-=60,l++),a<0&&(a+=60,l--),l=l%12,ni(l,a,d),nt&&(nr=setTimeout(ei,it)),sr.repaint()},ft=function(n){n=n||{};var r=undefined===n.frame?!1:n.frame,f=undefined===n.background?!1:n.background,t=undefined===n.pointers?!1:n.pointers,i=undefined===n.foreground?!1:n.foreground;pi=!0,r&&ki&&v(wi,di,s,h,u,e),f&&yi&&(w(ti,ut,s,h,u,e),rt(ti,or,s,h,u,e),fr(ti,p)),t&&(vi(gi,p,!1),vi(tr,p,!0),li(rr,p,!1),li(ir,p,!0),ci(hi,p,!1),ci(ai,p,!0)),i&&si&&(ur(oi,p),y(oi,bi,u,e,!1))},ct=function(n){n=n||{};var r=undefined===n.frame?!1:n.frame,u=undefined===n.background?!1:n.background,t=undefined===n.pointers?!1:n.pointers,i=undefined===n.foreground?!1:n.foreground;r&&(st.width=f,st.height=f,wi=st.getContext(\"2d\")),u&&(et.width=f,et.height=f,ti=et.getContext(\"2d\")),t&&(ot.width=f,ot.height=f,gi=ot.getContext(\"2d\"),pt.width=f,pt.height=f,tr=pt.getContext(\"2d\"),vt.width=f,vt.height=f,rr=vt.getContext(\"2d\"),lt.width=f,lt.height=f,ir=lt.getContext(\"2d\"),ht.width=f,ht.height=f,hi=ht.getContext(\"2d\"),yt.width=f,yt.height=f,ai=yt.getContext(\"2d\"),g.width=f,g.height=f,c=g.getContext(\"2d\")),i&&(at.width=f,at.height=f,oi=at.getContext(\"2d\"))};return this.getAutomatic=function(){return nt},this.setAutomatic=function(n){nt&&!n?(clearTimer(nr),nt=n):!nt&&n&&(nt=n,ei())},this.getHour=function(){return l},this.setHour=function(n){n=n%12,l!==n&&(l=n,ni(l,a,d),this.repaint())},this.getMinute=function(){return a},this.setMinute=function(n){n=n%60,a!==n&&(a=n,ni(l,a,d),this.repaint())},this.getSecond=function(){return d},this.setSecond=function(n){d=n%60,d!==n&&(d=n,ni(l,a,d),this.repaint())},this.getTimeZoneOffsetHour=function(){return dt},this.setTimeZoneOffsetHour=function(n){dt=n,this.repaint()},this.getTimeZoneOffsetMinute=function(){return wt},this.setTimeZoneOffsetMinute=function(n){wt=n,this.repaint()},this.getSecondPointerVisible=function(){return bt},this.setSecondPointerVisible=function(n){bt=n,this.repaint()},this.getSecondMovesContinuous=function(){return kt},this.setSecondMovesContinuous=function(n){kt=n,it=kt?100:1e3,it=bt?it:100},this.setFrameDesign=function(n){ct({frame:!0}),di=n,ft({frame:!0}),this.repaint()},this.setBackgroundColor=function(n){ct({frame:!0,background:!0}),ut=n,ft({frame:!0,background:!0}),this.repaint()},this.setForegroundType=function(n){ct({foreground:!0}),bi=n,ft({foreground:!0}),this.repaint()},this.setPointerType=function(n){ct({foreground:!0,pointers:!0}),p=n,p.type===\"type1\"?(b=steelseries.ColorDef.GRAY,ut=steelseries.BackgroundColor.ANTHRACITE):(b=steelseries.ColorDef.BLACK,ut=steelseries.BackgroundColor.LIGHT_GRAY),ft({background:!0,foreground:!0,pointers:!0}),this.repaint()},this.setPointerColor=function(n){ct({pointers:!0}),b=n,ft({pointers:!0}),this.repaint()},this.repaint=function(){pi||ft({frame:!0,background:!0,pointers:!0,foreground:!0}),o.clearRect(0,0,o.canvas.width,o.canvas.height),ki&&o.drawImage(st,0,0),yi&&o.drawImage(et,0,0);var n=u*.006;c.clearRect(0,0,u,e),c.save(),c.translate(s,h),c.rotate(ri),c.translate(-s,-h),c.drawImage(pt,0,0),c.restore(),o.drawImage(g,0,0,u,e,n,n,u+n,e+n),o.save(),o.translate(s,h),o.rotate(ri),o.translate(-s,-h),o.drawImage(ot,0,0),o.restore(),c.clearRect(0,0,u,e),c.save(),c.translate(s,h),c.rotate(ui),c.translate(-s,-h),c.drawImage(lt,0,0),c.restore(),o.drawImage(g,0,0,u,e,n,n,u+n,e+n),o.save(),o.translate(s,h),o.rotate(ui),o.translate(-s,-h),o.drawImage(vt,0,0),o.restore(),p.type===\"type1\"&&er(o),bt&&(c.clearRect(0,0,u,e),c.save(),c.translate(s,h),c.rotate(ii),c.translate(-s,-h),c.drawImage(yt,0,0),c.restore(),o.drawImage(g,0,0,u,e,n,n,u+n,e+n),o.save(),o.translate(s,h),o.rotate(ii),o.translate(-s,-h),o.drawImage(ht,0,0),o.restore()),si&&o.drawImage(at,0,0)},ei(),this},hr=function(t,i){var s;i=i||{};var o=undefined===i.size?50:i.size,f=undefined===i.value?50:i.value,e=o,h=Math.ceil(o*.45),u=r.getElementById(t).getContext(\"2d\");return u.save(),u.clearRect(0,0,u.canvas.width,u.canvas.height),u.canvas.width=e,u.canvas.height=e,s=function(t,i,r,u){var f,e;t.beginPath(),t.moveTo(i*.025,r*.055555),t.lineTo(i*.9,r*.055555),t.lineTo(i*.9,r*.944444),t.lineTo(i*.025,r*.944444),t.lineTo(i*.025,r*.055555),t.closePath(),t.beginPath(),t.moveTo(i*.925,0),t.lineTo(0,0),t.lineTo(0,r),t.lineTo(i*.925,r),t.lineTo(i*.925,r*.722222),t.bezierCurveTo(i*.925,r*.722222,i*.975,r*.722222,i*.975,r*.722222),t.bezierCurveTo(i,r*.722222,i,r*.666666,i,r*.666666),t.bezierCurveTo(i,r*.666666,i,r*.333333,i,r*.333333),t.bezierCurveTo(i,r*.333333,i,r*.277777,i*.975,r*.277777),t.bezierCurveTo(i*.975,r*.277777,i*.925,r*.277777,i*.925,r*.277777),t.lineTo(i*.925,0),t.closePath(),f=t.createLinearGradient(0,0,0,r),f.addColorStop(0,\"#ffffff\"),f.addColorStop(1,\"#7e7e7e\"),t.fillStyle=f,t.fill(),t.beginPath(),e=Math.max(i*.875*(u/100),Math.ceil(i*.01)),t.rect(i*.025,i*.025,e,r*.888888),t.closePath();var a=[0,.4,1],l=[new n(177,25,2,1),new n(219,167,21,1),new n(121,162,75,1)],y=new kt(0,100,a,l);t.fillStyle=y.getColorAt(u/100).getRgbColor(),t.fill(),t.beginPath(),e=Math.max(e-i*.05,0),t.rect(i*.05,i*.05,e,r*.777777),t.closePath();var v=[new n(198,39,5,1),new n(228,189,32,1),new n(163,216,102,1)],h=[new n(246,121,48,1),new n(246,244,157,1),new n(223,233,86,1)],o=[0,.4,1],s=new kt(0,100,o,v),c=new kt(0,100,o,h);f=t.createLinearGradient(i*.05,0,i*.875,0),f.addColorStop(0,s.getColorAt(u/100).getRgbColor()),f.addColorStop(.5,c.getColorAt(u/100).getRgbColor()),f.addColorStop(1,s.getColorAt(u/100).getRgbColor()),t.fillStyle=f,t.fill(),t.beginPath(),t.rect(i*.025,i*.025,i*.875,r*.444444),t.closePath(),f=t.createLinearGradient(i*.025,i*.025,i*.875,r*.444444),f.addColorStop(0,\"rgba(255, 255, 255, 0)\"),f.addColorStop(1,\"rgba(255, 255, 255, 0.8)\"),t.fillStyle=f,t.fill()},this.setValue=function(n){n=n<0?0:n>100?100:n,f!==n&&(f=n,this.repaint())},this.getValue=function(){return f},this.repaint=function(){u.clearRect(0,0,u.canvas.width,u.canvas.height),s(u,e,h,f)},this.repaint(),this},cr=function(n,i){i=i||{};var f=undefined===i.size?200:i.size,li=undefined===i.frameDesign?steelseries.FrameDesign.METAL:i.frameDesign,oi=undefined===i.frameVisible?!0:i.frameVisible,h=undefined===i.pointerColor?steelseries.ColorDef.BLACK:i.pointerColor,lt=undefined===i.backgroundColor?steelseries.BackgroundColor.LIGHT_GRAY:i.backgroundColor,gt=undefined===i.backgroundVisible?!0:i.backgroundVisible,fi=undefined===i.foregroundType?steelseries.ForegroundType.TYPE1:i.foregroundType,vi=undefined===i.foregroundVisible?!0:i.foregroundVisible,gi=undefined===i.customLayer?null:i.customLayer,bt=0,at=0,kt,di=6,ct=Math.PI*2,pt=Math.PI/180,ki=this,yt=0,d=0,yi=0,pi=0,si=0,a=!1,k=!1,e=r.getElementById(n).getContext(\"2d\"),u=f,c=f,o=u/2,l=c/2,p=.285*u,bi=o-p/2,b=.17*u,ci=!1,ht=t(f,f),hi=ht.getContext(\"2d\"),nt=t(f,f),it=nt.getContext(\"2d\"),tt=t(f,f),wi=tt.getContext(\"2d\"),ut=t(f,f),ai=ut.getContext(\"2d\"),st=t(f,f),ni=st.getContext(\"2d\"),ft=t(f,f),ti=ft.getContext(\"2d\"),g=t(f,f),s=g.getContext(\"2d\"),et=t(f,f),ei=et.getContext(\"2d\"),ui=function(n,t,i,r,u,f,e){var vt,ut=r*t,rt=ut+\"px sans-serif\",ot=t*.15,at=.5,g=1,ht=1.5,tt=u*t,d=Math.round(.025*t),nt=Math.round(.035*t),it=Math.round(.045*t),st=lt.labelColor.getRgbaColor(),k=lt.labelColor.getRgbaColor(),s=t/2,o=t*.4,h,a,w,y=0,b=0,ct=0,v,c=0,l=0,p,et=-Math.PI,ft=2*Math.PI/i;for(n.width=n.height=t,n.save(),n.textAlign=\"center\",n.textBaseline=\"middle\",n.font=rt,p=et,v=0;v<=i+1;p-=ft*.1,v+=.1)n.lineWidth=at,c=Math.sin(p),l=Math.cos(p),y%2==0&&(h=[s+(o-d)*c+f,s+(o-d)*l+e],a=[s+o*c+f,s+o*l+e],n.strokeStyle=k,n.beginPath(),n.moveTo(h[0],h[1]),n.lineTo(a[0],a[1]),n.closePath(),n.stroke()),(y===10||y===0)&&(n.fillStyle=st,n.lineWidth=g,a=[s+o*c+f,s+o*l+e],w=[s+(o-tt)*c+f,s+(o-tt)*l+e],b===5?(v!==i&&Math.round(v)!==60&&n.fillText(Math.round(v),w[0],w[1],ot),n.lineWidth=ht,h=[s+(o-it)*c+f,s+(o-it)*l+e],b=0):(n.lineWidth=g,h=[s+(o-nt)*c+f,s+(o-nt)*l+e]),n.strokeStyle=k,n.beginPath(),n.moveTo(h[0],h[1]),n.lineTo(a[0],a[1]),n.closePath(),n.stroke(),y=0,ct++,b++),y++;n.restore()},ii=function(n,t){var i,r;n.save(),n.beginPath(),n.moveTo(u*.509345,u*.457943),n.lineTo(u*.5,u*.102803),n.lineTo(u*.490654,u*.457943),n.bezierCurveTo(u*.490654,u*.457943,u*.490654,u*.457943,u*.490654,u*.457943),n.bezierCurveTo(u*.471962,u*.462616,u*.457943,u*.481308,u*.457943,u*.5),n.bezierCurveTo(u*.457943,u*.518691,u*.471962,u*.537383,u*.490654,u*.542056),n.bezierCurveTo(u*.490654,u*.542056,u*.490654,u*.542056,u*.490654,u*.542056),n.lineTo(u*.490654,u*.621495),n.lineTo(u*.509345,u*.621495),n.lineTo(u*.509345,u*.542056),n.bezierCurveTo(u*.509345,u*.542056,u*.509345,u*.542056,u*.509345,u*.542056),n.bezierCurveTo(u*.528037,u*.537383,u*.542056,u*.518691,u*.542056,u*.5),n.bezierCurveTo(u*.542056,u*.481308,u*.528037,u*.462616,u*.509345,u*.457943),n.bezierCurveTo(u*.509345,u*.457943,u*.509345,u*.457943,u*.509345,u*.457943),n.closePath(),t?(n.fillStyle=\"rgba(0, 0, 0, 0.5)\",n.strokeStyle=\"rgba(0, 0, 0, 0.5)\",n.fill()):(i=n.createLinearGradient(0,0,0,u*.621495),i.addColorStop(0,h.medium.getRgbaColor()),i.addColorStop(.388888,h.medium.getRgbaColor()),i.addColorStop(.5,h.light.getRgbaColor()),i.addColorStop(.611111,h.medium.getRgbaColor()),i.addColorStop(1,h.medium.getRgbaColor()),n.fillStyle=i,n.strokeStyle=h.dark.getRgbaColor(),n.fill(),n.stroke()),t?blur(n,u,c,Math.floor(u*.006)):(n.beginPath(),r=u*.06542/2,n.arc(o,l,r,0,ct),i=n.createLinearGradient(o-r,o+r,0,o+r),i.addColorStop(0,\"#e6b35c\"),i.addColorStop(.01,\"#e6b35c\"),i.addColorStop(.99,\"#c48200\"),i.addColorStop(1,\"#c48200\"),n.fillStyle=i,n.closePath(),n.fill(),n.beginPath(),r=u*.046728/2,n.arc(o,l,r,0,ct),i=n.createRadialGradient(o,o,0,o,o,r),i.addColorStop(0,\"#c5c5c5\"),i.addColorStop(.19,\"#c5c5c5\"),i.addColorStop(.22,\"#000000\"),i.addColorStop(.8,\"#000000\"),i.addColorStop(.99,\"#707070\"),i.addColorStop(1,\"#707070\"),n.fillStyle=i,n.closePath(),n.fill()),n.restore()},ri=function(n,t){var i,r;n.save(),n.beginPath(),n.moveTo(u*.476635,u*.313084),n.bezierCurveTo(u*.476635,u*.322429,u*.485981,u*.331775,u*.495327,u*.336448),n.bezierCurveTo(u*.495327,u*.336448,u*.495327,u*.350467,u*.495327,u*.350467),n.lineTo(u*.504672,u*.350467),n.bezierCurveTo(u*.504672,u*.350467,u*.504672,u*.336448,u*.504672,u*.336448),n.bezierCurveTo(u*.514018,u*.331775,u*.523364,u*.322429,u*.523364,u*.313084),n.bezierCurveTo(u*.523364,u*.303738,u*.514018,u*.294392,u*.504672,u*.289719),n.bezierCurveTo(u*.504672,u*.289719,u*.5,u*.200934,u*.5,u*.200934),n.bezierCurveTo(u*.5,u*.200934,u*.495327,u*.289719,u*.495327,u*.289719),n.bezierCurveTo(u*.485981,u*.294392,u*.476635,u*.303738,u*.476635,u*.313084),n.closePath(),t?(n.fillStyle=\"rgba(0, 0, 0, 0.5)\",n.strokeStyle=\"rgba(0, 0, 0, 0.5)\",n.fill()):(i=n.createLinearGradient(0,0,u,0),i.addColorStop(0,h.medium.getRgbaColor()),i.addColorStop(.388888,h.medium.getRgbaColor()),i.addColorStop(.5,h.light.getRgbaColor()),i.addColorStop(.611111,h.medium.getRgbaColor()),i.addColorStop(1,h.medium.getRgbaColor()),n.fillStyle=i,n.strokeStyle=h.dark.getRgbaColor(),n.fill(),n.stroke()),t?blur(n,u,c,Math.floor(u*.006)):(n.beginPath(),r=u*.037383/2,n.arc(o,b+p/2,r,0,ct),n.fillStyle=\"#C48200\",n.closePath(),n.fill(),n.beginPath(),r=u*.028037/2,n.arc(o,b+p/2,r,0,ct),n.fillStyle=\"#999999\",n.closePath(),n.fill(),n.beginPath(),r=u*.018691/2,n.arc(o,b+p/2,r,0,ct),n.fillStyle=\"#000000\",n.closePath(),n.fill()),n.restore()},wt=function(){d=+new Date-yt,at=d*di/1e3,bt=at%10800/30,yi=d/6e4%30,pi=d/1e3%60,si=d%1e3},ot=function(n){n=n||{};var r=undefined===n.frame?!1:n.frame,f=undefined===n.background?!1:n.background,t=undefined===n.pointers?!1:n.pointers,i=undefined===n.foreground?!1:n.foreground;ci=!0,r&&oi&&v(hi,li,o,l,u,c),f&>&&(w(it,lt,o,l,u,c),rt(it,gi,o,l,u,c),ui(it,u,60,.075,.1,0,0),ui(it,p,30,.095,.13,bi,b)),t&&(ii(ni,!1),ii(ti,!0),ri(wi,!1),ri(ai,!0)),i&&vi&&y(ei,fi,u,c,!1)},vt=function(n){n=n||{};var r=undefined===n.frame?!1:n.frame,u=undefined===n.background?!1:n.background,t=undefined===n.pointers?!1:n.pointers,i=undefined===n.foreground?!1:n.foreground;r&&(ht.width=f,ht.height=f,hi=ht.getContext(\"2d\")),u&&(nt.width=f,nt.height=f,it=nt.getContext(\"2d\")),t&&(tt.width=f,tt.height=f,wi=tt.getContext(\"2d\"),ut.width=f,ut.height=f,ai=ut.getContext(\"2d\"),st.width=f,st.height=f,ni=st.getContext(\"2d\"),ft.width=f,ft.height=f,ti=ft.getContext(\"2d\"),g.width=f,g.height=f,s=g.getContext(\"2d\")),i&&(et.width=f,et.height=f,ei=et.getContext(\"2d\"))},dt=function(){k||(wt(),ki.repaint()),a&&(kt=setTimeout(dt,200))};return this.isRunning=function(){return a},this.start=function(){a||(a=!0,yt=+new Date-d,dt())},this.stop=function(){a&&(a=!1,clearTimeout(kt)),k&&(k=!1,wt(),this.repaint())},this.reset=function(){a&&(a=!1,k=!1,clearTimeout(kt)),yt=+new Date,wt(),this.repaint()},this.lap=function(){a&&!k?k=!0:k&&(k=!1)},this.getMeasuredTime=function(){return yi+\":\"+pi+\":\"+si},this.setFrameDesign=function(n){vt({frame:!0}),li=n,ot({frame:!0}),this.repaint()},this.setBackgroundColor=function(n){vt({background:!0}),lt=n,ot({background:!0}),this.repaint()},this.setForegroundType=function(n){vt({foreground:!0}),fi=n,ot({foreground:!0}),this.repaint()},this.setPointerColor=function(n){vt({pointers:!0}),h=n,ot({pointers:!0}),this.repaint()},this.repaint=function(){ci||ot({frame:!0,background:!0,pointers:!0,foreground:!0}),e.clearRect(0,0,e.canvas.width,e.canvas.height),oi&&e.drawImage(ht,0,0),gt&&e.drawImage(nt,0,0);var n=u*.006,t=(bt+2*Math.sin(bt*pt))*pt;s.clearRect(0,0,u,c),s.save(),s.translate(o,b+p/2),s.rotate(t),s.translate(-o,-(b+p/2)),s.drawImage(ut,0,0),s.restore(),e.drawImage(g,0,0,u,c,n/2,n/2,u+n/2,c+n/2),e.save(),e.translate(o,b+p/2),e.rotate(t),e.translate(-o,-(b+p/2)),e.drawImage(tt,0,0),e.restore(),t=(at+2*Math.sin(at*pt))*pt,s.clearRect(0,0,u,c),s.save(),s.translate(o,l),s.rotate(t),s.translate(-o,-l),s.drawImage(ft,0,0),s.restore(),e.drawImage(g,0,0,u,c,n,n,u+n,c+n),e.save(),e.translate(o,l),e.rotate(t),e.translate(-o,-l),e.drawImage(st,0,0),e.restore(),vi&&e.drawImage(et,0,0)},e.save(),e.clearRect(0,0,e.canvas.width,e.canvas.height),e.canvas.width=f,e.canvas.height=f,yt=+new Date,dt(),this},sr=function(n,i){function gi(){nt=2*Math.PI/(li-a),ht=nt/10,pt=ht/10}function nr(){yt=l%1e3/100,kt=l%1e4/100,wt=l%1e5/100}var o,bt,at,ut,ui,ri,fi,k,vt,vi,ct,lt,ai,a=0,li=10,l=a,yt=0,kt=0,wt=0,nt,ht,pt,rr=1,g,u,f,c,h,hi,e=r.getElementById(n).getContext(\"2d\"),hr=Math.PI/2,cr=Math.PI/180,ur=Math.PI,ci=!1,ot=t(o,o),bi=ot.getContext(\"2d\"),et=t(o,o),it=et.getContext(\"2d\"),yi,pi=t(o,o),tr=pi.getContext(\"2d\"),ti=t(o,o),ir=ti.getContext(\"2d\"),ni=t(o,o),or=ni.getContext(\"2d\"),ii=t(o,o),sr=ii.getContext(\"2d\"),ei=t(o,o),fr=ei.getContext(\"2d\"),oi=t(o,o),er=oi.getContext(\"2d\"),b=t(o,o),s=b.getContext(\"2d\"),ft=t(o,o),si=ft.getContext(\"2d\"),d,st;i=i||{},o=undefined===i.size?200:i.size,bt=undefined===i.frameDesign?steelseries.FrameDesign.METAL:i.frameDesign,at=undefined===i.frameVisible?!0:i.frameVisible,ut=undefined===i.backgroundColor?steelseries.BackgroundColor.DARK_GRAY:i.backgroundColor,ui=undefined===i.backgroundVisible?!0:i.backgroundVisible,ri=undefined===i.knobType?steelseries.KnobType.METAL_KNOB:i.knobType,fi=undefined===i.knobStyle?steelseries.KnobStyle.BLACK:i.knobStyle,k=undefined===i.lcdColor?steelseries.LcdColor.BLACK:i.lcdColor,vt=undefined===i.lcdVisible?!0:i.lcdVisible,vi=undefined===i.digitalFont?!1:i.digitalFont,ct=undefined===i.foregroundType?steelseries.ForegroundType.TYPE1:i.foregroundType,lt=undefined===i.foregroundVisible?!0:i.foregroundVisible,ai=undefined===i.customLayer?null:i.customLayer,e.save(),e.clearRect(0,0,e.canvas.width,e.canvas.height),e.canvas.width=o,e.canvas.height=o,u=o,f=o,c=u/2,h=f/2,hi=Math.floor(u*.09)+\"px sans-serif\";var di=function(n){e.save(),e.textAlign=\"right\",e.textBaseline=\"middle\",e.strokeStyle=k.textColor,e.fillStyle=k.textColor,(k===steelseries.LcdColor.STANDARD||k===steelseries.LcdColor.STANDARD_GREEN)&&(e.shadowColor=\"gray\",e.shadowOffsetX=u*.007,e.shadowOffsetY=u*.007,e.shadowBlur=u*.009),e.font=vi?Math.floor(u*.075)+\"px \"+tt:Math.floor(u*.075)+\"px sans-serif\",e.fillText(Math.round(n),(u+u*.4)/2-4,u*.607,u*.4),e.restore()},ki=function(n,t,i,r,f,e){var it=Math.max(u*.012,2),rt=Math.max(u*.007,1.5),d=u*.13,g=u*.05,nt=u*.07,v=u*.4,b=0,ft=0,p=0,y=0,k,w,tt=-i-t/2;for(n.save(),n.textAlign=\"center\",n.textBaseline=\"middle\",n.font=hi,n.strokeStyle=ut.labelColor.getRgbaColor(),n.fillStyle=ut.labelColor.getRgbaColor(),k=tt,w=0;w<=10;k-=e*.1,w+=.1)p=Math.sin(k),y=Math.cos(k),b%2==0&&(n.lineWidth=rt,n.beginPath(),n.moveTo(c+(v-g)*p,h+(v-g)*y),n.lineTo(c+v*p,h+v*y),n.closePath(),n.stroke()),(b===10||b===0)&&(n.lineWidth=it,t===0&&Math.round(w)!==li&&n.fillText(Math.round(w).toString(),c+(v-d)*p,h+(v-d)*y),b=0,ft++,n.beginPath(),n.moveTo(c+(v-nt)*p,h+(v-nt)*y),n.lineTo(c+v*p,h+v*y),n.closePath(),n.stroke()),b++;n.restore()},dt=function(n,t){var i;t?(n.fillStyle=\"rgba(0, 0, 0, 0.5)\",n.strokeStyle=\"rgba(0, 0, 0, 0.5)\"):(i=n.createLinearGradient(0,f*.168224,0,f*.626168),i.addColorStop(0,\"#ffffff\"),i.addColorStop(.31,\"#ffffff\"),i.addColorStop(.3101,\"#ffffff\"),i.addColorStop(.32,\"#202020\"),i.addColorStop(1,\"#202020\"),n.fillStyle=i),n.save(),n.beginPath(),n.moveTo(u*.518691,f*.471962),n.bezierCurveTo(u*.514018,f*.471962,u*.509345,f*.467289,u*.509345,f*.467289),n.lineTo(u*.509345,f*.200934),n.lineTo(u*.5,f*.168224),n.lineTo(u*.490654,f*.200934),n.lineTo(u*.490654,f*.467289),n.bezierCurveTo(u*.490654,f*.467289,u*.481308,f*.471962,u*.481308,f*.471962),n.bezierCurveTo(u*.471962,f*.481308,u*.467289,f*.490654,u*.467289,f*.5),n.bezierCurveTo(u*.467289,f*.514018,u*.476635,f*.528037,u*.490654,f*.53271),n.bezierCurveTo(u*.490654,f*.53271,u*.490654,f*.579439,u*.490654,f*.588785),n.bezierCurveTo(u*.485981,f*.593457,u*.481308,f*.59813,u*.481308,f*.607476),n.bezierCurveTo(u*.481308,f*.616822,u*.490654,f*.626168,u*.5,f*.626168),n.bezierCurveTo(u*.509345,f*.626168,u*.518691,f*.616822,u*.518691,f*.607476),n.bezierCurveTo(u*.518691,f*.59813,u*.514018,f*.593457,u*.504672,f*.588785),n.bezierCurveTo(u*.504672,f*.579439,u*.504672,f*.53271,u*.509345,f*.53271),n.bezierCurveTo(u*.523364,f*.528037,u*.53271,f*.514018,u*.53271,f*.5),n.bezierCurveTo(u*.53271,f*.490654,u*.528037,f*.481308,u*.518691,f*.471962),n.closePath(),n.fill(),t&&blur(n,u,f,Math.floor(u*.006)),n.restore()},gt=function(n,t){var i;t?(n.fillStyle=\"rgba(0, 0, 0, 0.5)\",n.strokeStyle=\"rgba(0, 0, 0, 0.5)\"):(i=n.createLinearGradient(0,f*.401869,0,f*.616822),i.addColorStop(0,\"#ffffff\"),i.addColorStop(.51,\"#ffffff\"),i.addColorStop(.52,\"#ffffff\"),i.addColorStop(.5201,\"#202020\"),i.addColorStop(.53,\"#202020\"),i.addColorStop(1,\"#202020\"),n.fillStyle=i),n.beginPath(),n.moveTo(u*.518691,f*.471962),n.bezierCurveTo(u*.514018,f*.462616,u*.528037,f*.401869,u*.528037,f*.401869),n.lineTo(u*.5,f*.331775),n.lineTo(u*.471962,f*.401869),n.bezierCurveTo(u*.471962,f*.401869,u*.485981,f*.462616,u*.481308,f*.471962),n.bezierCurveTo(u*.471962,f*.481308,u*.467289,f*.490654,u*.467289,f*.5),n.bezierCurveTo(u*.467289,f*.514018,u*.476635,f*.528037,u*.490654,f*.53271),n.bezierCurveTo(u*.490654,f*.53271,u*.462616,f*.574766,u*.462616,f*.593457),n.bezierCurveTo(u*.467289,f*.616822,u*.5,f*.612149,u*.5,f*.612149),n.bezierCurveTo(u*.5,f*.612149,u*.53271,f*.616822,u*.537383,f*.593457),n.bezierCurveTo(u*.537383,f*.574766,u*.509345,f*.53271,u*.509345,f*.53271),n.bezierCurveTo(u*.523364,f*.528037,u*.53271,f*.514018,u*.53271,f*.5),n.bezierCurveTo(u*.53271,f*.490654,u*.528037,f*.481308,u*.518691,f*.471962),n.closePath(),n.fill(),t&&blur(n,u,f,Math.floor(u*.006)),n.restore()},wi=function(n,t){t?(n.fillStyle=\"rgba(0, 0, 0, 0.5)\",n.strokeStyle=\"rgba(0, 0, 0, 0.5)\"):n.fillStyle=\"#ffffff\",n.beginPath(),n.moveTo(u*.518691,f*.471962),n.bezierCurveTo(u*.514018,f*.471962,u*.514018,f*.467289,u*.514018,f*.467289),n.lineTo(u*.514018,f*.317757),n.lineTo(u*.504672,f*.303738),n.lineTo(u*.504672,f*.182242),n.lineTo(u*.53271,f*.116822),n.lineTo(u*.462616,f*.116822),n.lineTo(u*.495327,f*.182242),n.lineTo(u*.495327,f*.299065),n.lineTo(u*.485981,f*.317757),n.lineTo(u*.485981,f*.467289),n.bezierCurveTo(u*.485981,f*.467289,u*.485981,f*.471962,u*.481308,f*.471962),n.bezierCurveTo(u*.471962,f*.481308,u*.467289,f*.490654,u*.467289,f*.5),n.bezierCurveTo(u*.467289,f*.518691,u*.481308,f*.53271,u*.5,f*.53271),n.bezierCurveTo(u*.518691,f*.53271,u*.53271,f*.518691,u*.53271,f*.5),n.bezierCurveTo(u*.53271,f*.490654,u*.528037,f*.481308,u*.518691,f*.471962),n.closePath(),n.fill(),t&&blur(n,u,f,Math.floor(u*.006))};return d=function(n){var e,t,r,i;n=n||{},e=undefined===n.frame?!1:n.frame,t=undefined===n.background?!1:n.background,r=undefined===n.pointers?!1:n.pointers,i=undefined===n.foreground?!1:n.foreground,ci=!0,gi(),e&&at&&v(bi,bt,c,h,u,f),t&&ui&&(w(it,ut,c,h,u,f),rt(it,ai,c,h,u,f),ki(it,0,ur,0,10,nt,rr,0,!0,!0,null)),t&&vt&&(yi=p(u*.4,f*.09,k),it.drawImage(yi,(u-u*.4)/2,f*.56)),r&&(dt(fr,!1),dt(er,!0),gt(or,!1),gt(sr,!0),wi(tr,!1),wi(ir,!0)),i&<&&y(si,ct,u,f,!0,ri,fi)},st=function(n){var r,u,t,i;n=n||{},r=undefined===n.frame?!1:n.frame,u=undefined===n.background?!1:n.background,t=undefined===n.pointers?!1:n.pointers,i=undefined===n.foreground?!1:n.foreground,r&&(ot.width=o,ot.height=o,bi=ot.getContext(\"2d\")),u&&(et.width=o,et.height=o,it=et.getContext(\"2d\")),t&&(pointer100ftBuffer.width=o,pointer100ftBuffer.height=o,pointer100ftContext=pointer100ftBuffer.getContext(\"2d\"),pointer100ftShadowBuffer.width=o,pointer100ftShadowBuffer.height=o,pointer100ftShadowContext=pointer100ftShadowBuffer.getContext(\"2d\"),pointer1000ftBuffer.width=o,pointer1000ftBuffer.height=o,pointer1000ftContext=pointer1000ftBuffer.getContext(\"2d\"),pointer1000ftShadowBuffer.width=o,pointer1000ftShadowBuffer.height=o,pointer1000ftShadowContext=pointer1000ftShadowBuffer.getContext(\"2d\"),pointer10000ftBuffer.width=o,pointer10000ftBuffer.height=o,pointer10000ftContext=pointer10000ftBuffer.getContext(\"2d\"),pointer10000ftShadowBuffer.width=o,pointer10000ftShadowBuffer.height=o,pointer10000ftShadowContext=pointer10000ftShadowBuffer.getContext(\"2d\"),b.width=o,b.height=o,s=b.getContext(\"2d\")),i&&(ft.width=o,ft.height=o,si=ft.getContext(\"2d\"))},this.setValue=function(n){l=n,this.repaint()},this.getValue=function(){return l},this.setValueAnimated=function(n){var t=n0)for(u.rect(0,0,f,s*1.1),u.fillStyle=ot,u.fill(),u.strokeStyle=\"#f0f0f0\",u.lineWidth=\"1px\",u.moveTo(0,0),u.lineTo(0,s*1.1),u.stroke(),u.strokeStyle=\"#202020\",u.moveTo(f,0),u.lineTo(f,s*1.1),u.stroke(),u.textAlign=\"center\",u.textBaseline=\"middle\",u.font=ut,u.fillStyle=et,n=9;n<21;n++)u.fillText(n%10,f*.5,h*(n-9)+h/2);for(n=0;n=e;e+=90)n.beginPath(),n.moveTo(r*.560747,u*.584112),n.lineTo(r*.640186,u*.644859),n.lineTo(r*.584112,u*.560747),n.lineTo(r*.560747,u*.584112),n.closePath(),n.fillStyle=s,n.fill(),n.stroke(),n.beginPath(),n.moveTo(r*.523364,u*.397196),n.lineTo(r*.5,u*.196261),n.lineTo(r*.471962,u*.397196),n.lineTo(r*.523364,u*.397196),n.closePath(),o=n.createLinearGradient(.476635*r,0,.518691*r,0),o.addColorStop(0,\"rgb(222, 223, 218)\"),o.addColorStop(.48,\"rgb(222, 223, 218)\"),o.addColorStop(.49,s),o.addColorStop(1,s),n.fillStyle=o,n.fill(),n.stroke(),n.translate(t,i),n.rotate(e*Math.PI/180),n.translate(-t,-i);n.beginPath(),n.translate(t,i),n.arc(0,0,r*.1,0,Math.PI*2,!1),n.lineWidth=r*.022,n.stroke(),n.translate(-t,-i),n.restore()},nt=function(n,i,r,u,f,e){var l,o,s,h,c=i.toString()+r.type+u.light.getHexColor()+u.medium.getHexColor()+e;if(!nt.cache[c]){l=t(i,i),o=l.getContext(\"2d\"),e&&(o.fillStyle=\"rgba(0, 0, 0, 1)\",o.strokeStyle=\"rgba(0, 0, 0, 1)\",o.shadowBlur=3,o.globalAlpha=.5);switch(r.type){case\"type2\":e||(s=o.createLinearGradient(0,i*.471962,0,i*.130841),s.addColorStop(0,f.getRgbaColor()),s.addColorStop(.36,f.getRgbaColor()),s.addColorStop(.361,u.light.getRgbaColor()),s.addColorStop(1,u.light.getRgbaColor()),o.fillStyle=s),o.beginPath(),o.moveTo(i*.518691,i*.471962),o.lineTo(i*.509345,i*.462616),o.lineTo(i*.509345,i*.341121),o.lineTo(i*.504672,i*.130841),o.lineTo(i*.495327,i*.130841),o.lineTo(i*.490654,i*.341121),o.lineTo(i*.490654,i*.462616),o.lineTo(i*.481308,i*.471962),o.closePath(),o.fill();break;case\"type3\":o.beginPath(),o.rect(i*.495327,i*.130841,i*.009345,i*.373831),o.closePath(),e||(o.fillStyle=u.light.getRgbaColor()),o.fill();break;case\"type4\":e||(s=o.createLinearGradient(.467289*i,0,.528036*i,0),s.addColorStop(0,u.dark.getRgbaColor()),s.addColorStop(.51,u.dark.getRgbaColor()),s.addColorStop(.52,u.light.getRgbaColor()),s.addColorStop(1,u.light.getRgbaColor()),o.fillStyle=s),o.beginPath(),o.moveTo(i*.5,i*.126168),o.lineTo(i*.514018,i*.135514),o.lineTo(i*.53271,i*.5),o.lineTo(i*.523364,i*.602803),o.lineTo(i*.476635,i*.602803),o.lineTo(i*.467289,i*.5),o.lineTo(i*.485981,i*.135514),o.lineTo(i*.5,i*.126168),o.closePath(),o.fill();break;case\"type5\":e||(s=o.createLinearGradient(.471962*i,0,.528036*i,0),s.addColorStop(0,u.light.getRgbaColor()),s.addColorStop(.5,u.light.getRgbaColor()),s.addColorStop(.5,u.medium.getRgbaColor()),s.addColorStop(1,u.medium.getRgbaColor()),o.fillStyle=s),o.beginPath(),o.moveTo(i*.5,i*.495327),o.lineTo(i*.528037,i*.495327),o.lineTo(i*.5,i*.149532),o.lineTo(i*.471962,i*.495327),o.lineTo(i*.5,i*.495327),o.closePath(),o.fill(),o.lineWidth=1,o.lineCap=\"square\",o.lineJoin=\"miter\",e||(o.strokeStyle=u.dark.getRgbaColor()),o.stroke();break;case\"type6\":e||(o.fillStyle=u.medium.getRgbaColor()),o.beginPath(),o.moveTo(i*.481308,i*.485981),o.lineTo(i*.481308,i*.392523),o.lineTo(i*.485981,i*.317757),o.lineTo(i*.495327,i*.130841),o.lineTo(i*.504672,i*.130841),o.lineTo(i*.514018,i*.317757),o.lineTo(i*.518691,i*.38785),o.lineTo(i*.518691,i*.485981),o.lineTo(i*.504672,i*.485981),o.lineTo(i*.504672,i*.38785),o.lineTo(i*.5,i*.317757),o.lineTo(i*.495327,i*.392523),o.lineTo(i*.495327,i*.485981),o.lineTo(i*.481308,i*.485981),o.closePath(),o.fill();break;case\"type7\":e||(s=o.createLinearGradient(.481308*i,0,.518691*i,0),s.addColorStop(0,u.dark.getRgbaColor()),s.addColorStop(1,u.medium.getRgbaColor()),o.fillStyle=s),o.beginPath(),o.moveTo(i*.490654,i*.130841),o.lineTo(i*.481308,i*.5),o.lineTo(i*.518691,i*.5),o.lineTo(i*.504672,i*.130841),o.lineTo(i*.490654,i*.130841),o.closePath(),o.fill();break;case\"type8\":e||(s=o.createLinearGradient(.471962*i,0,.528036*i,0),s.addColorStop(0,u.light.getRgbaColor()),s.addColorStop(.5,u.light.getRgbaColor()),s.addColorStop(.5,u.medium.getRgbaColor()),s.addColorStop(1,u.medium.getRgbaColor()),o.fillStyle=s,o.strokeStyle=u.dark.getRgbaColor()),o.beginPath(),o.moveTo(i*.5,i*.53271),o.lineTo(i*.53271,i*.5),o.bezierCurveTo(i*.53271,i*.5,i*.509345,i*.457943,i*.5,i*.149532),o.bezierCurveTo(i*.490654,i*.457943,i*.467289,i*.5,i*.467289,i*.5),o.lineTo(i*.5,i*.53271),o.closePath(),o.fill(),o.stroke();break;case\"type9\":e||(s=o.createLinearGradient(.471962*i,0,.528036*i,0),s.addColorStop(0,\"rgb(50, 50, 50)\"),s.addColorStop(.5,\"#666666\"),s.addColorStop(1,\"rgb(50, 50, 50)\"),o.fillStyle=s,o.strokeStyle=\"#2E2E2E\"),o.beginPath(),o.moveTo(i*.495327,i*.233644),o.lineTo(i*.504672,i*.233644),o.lineTo(i*.514018,i*.439252),o.lineTo(i*.485981,i*.439252),o.lineTo(i*.495327,i*.233644),o.closePath(),o.moveTo(i*.490654,i*.130841),o.lineTo(i*.471962,i*.471962),o.lineTo(i*.471962,i*.528037),o.bezierCurveTo(i*.471962,i*.528037,i*.476635,i*.602803,i*.476635,i*.602803),o.bezierCurveTo(i*.476635,i*.607476,i*.481308,i*.607476,i*.5,i*.607476),o.bezierCurveTo(i*.518691,i*.607476,i*.523364,i*.607476,i*.523364,i*.602803),o.bezierCurveTo(i*.523364,i*.602803,i*.528037,i*.528037,i*.528037,i*.528037),o.lineTo(i*.528037,i*.471962),o.lineTo(i*.509345,i*.130841),o.lineTo(i*.490654,i*.130841),o.closePath(),o.fill(),o.beginPath(),o.moveTo(i*.495327,i*.219626),o.lineTo(i*.504672,i*.219626),o.lineTo(i*.504672,i*.135514),o.lineTo(i*.495327,i*.135514),o.lineTo(i*.495327,i*.219626),o.closePath(),e||(o.fillStyle=u.medium.getRgbaColor()),o.fill();break;case\"type10\":o.beginPath(),o.moveTo(i*.5,i*.149532),o.bezierCurveTo(i*.5,i*.149532,i*.443925,i*.490654,i*.443925,i*.5),o.bezierCurveTo(i*.443925,i*.53271,i*.467289,i*.556074,i*.5,i*.556074),o.bezierCurveTo(i*.53271,i*.556074,i*.556074,i*.53271,i*.556074,i*.5),o.bezierCurveTo(i*.556074,i*.490654,i*.5,i*.149532,i*.5,i*.149532),o.closePath(),e||(s=o.createLinearGradient(.471962*i,0,.528036*i,0),s.addColorStop(0,u.light.getRgbaColor()),s.addColorStop(.5,u.light.getRgbaColor()),s.addColorStop(.5,u.medium.getRgbaColor()),s.addColorStop(1,u.medium.getRgbaColor()),o.fillStyle=s,o.strokeStyle=u.medium.getRgbaColor()),o.lineWidth=1,o.lineCap=\"square\",o.lineJoin=\"miter\",o.fill(),o.stroke();break;case\"type11\":o.beginPath(),o.moveTo(.5*i,.168224*i),o.lineTo(.485981*i,.5*i),o.bezierCurveTo(.485981*i,.5*i,.481308*i,.584112*i,.5*i,.584112*i),o.bezierCurveTo(.514018*i,.584112*i,.509345*i,.5*i,.509345*i,.5*i),o.lineTo(.5*i,.168224*i),o.closePath(),e||(s=o.createLinearGradient(0,.168224*i,0,.584112*i),s.addColorStop(0,u.medium.getRgbaColor()),s.addColorStop(1,u.dark.getRgbaColor()),o.fillStyle=s,o.strokeStyle=u.dark.getRgbaColor()),o.fill(),o.stroke();break;case\"type12\":o.beginPath(),o.moveTo(.5*i,.168224*i),o.lineTo(.485981*i,.5*i),o.lineTo(.5*i,.504672*i),o.lineTo(.509345*i,.5*i),o.lineTo(.5*i,.168224*i),o.closePath(),e||(s=o.createLinearGradient(0,.168224*i,0,.504672*i),s.addColorStop(0,u.medium.getRgbaColor()),s.addColorStop(1,u.dark.getRgbaColor()),o.fillStyle=s,o.strokeStyle=u.dark.getRgbaColor()),o.fill(),o.stroke();break;case\"type13\":case\"type14\":o.beginPath(),o.moveTo(.485981*i,.168224*i),o.lineTo(.5*i,.130841*i),o.lineTo(.509345*i,.168224*i),o.lineTo(.509345*i,.509345*i),o.lineTo(.485981*i,.509345*i),o.lineTo(.485981*i,.168224*i),o.closePath(),e||(r.type===\"type13\"?(s=o.createLinearGradient(0,.5*i,0,.130841*i),s.addColorStop(0,f.getRgbaColor()),s.addColorStop(.85,f.getRgbaColor()),s.addColorStop(.85,u.medium.getRgbaColor()),s.addColorStop(1,u.medium.getRgbaColor()),o.fillStyle=s):(s=o.createLinearGradient(.485981*i,0,.509345*i,0),s.addColorStop(0,u.veryDark.getRgbaColor()),s.addColorStop(.5,u.light.getRgbaColor()),s.addColorStop(1,u.veryDark.getRgbaColor()),o.fillStyle=s)),o.fill();break;case\"type15\":case\"type16\":o.beginPath(),o.moveTo(i*.509345,i*.457943),o.lineTo(i*.5015,i*.13),o.lineTo(i*.4985,i*.13),o.lineTo(i*.490654,i*.457943),o.bezierCurveTo(i*.490654,i*.457943,i*.490654,i*.457943,i*.490654,i*.457943),o.bezierCurveTo(i*.471962,i*.462616,i*.457943,i*.481308,i*.457943,i*.5),o.bezierCurveTo(i*.457943,i*.518691,i*.471962,i*.537383,i*.490654,i*.542056),o.bezierCurveTo(i*.490654,i*.542056,i*.490654,i*.542056,i*.490654,i*.542056),r.type===\"type15\"?(o.lineTo(i*.490654,i*.57),o.bezierCurveTo(i*.46,i*.58,i*.46,i*.62,i*.490654,i*.63),o.bezierCurveTo(i*.47,i*.62,i*.48,i*.59,i*.5,i*.59),o.bezierCurveTo(i*.53,i*.59,i*.52,i*.62,i*.509345,i*.63),o.bezierCurveTo(i*.54,i*.62,i*.54,i*.58,i*.509345,i*.57),o.lineTo(i*.509345,i*.57)):(o.lineTo(i*.490654,i*.621495),o.lineTo(i*.509345,i*.621495)),o.lineTo(i*.509345,i*.542056),o.bezierCurveTo(i*.509345,i*.542056,i*.509345,i*.542056,i*.509345,i*.542056),o.bezierCurveTo(i*.528037,i*.537383,i*.542056,i*.518691,i*.542056,i*.5),o.bezierCurveTo(i*.542056,i*.481308,i*.528037,i*.462616,i*.509345,i*.457943),o.bezierCurveTo(i*.509345,i*.457943,i*.509345,i*.457943,i*.509345,i*.457943),o.closePath(),e?o.fill():(s=r.type===\"type15\"?o.createLinearGradient(0,0,0,i*.63):o.createLinearGradient(0,0,0,i*.621495),s.addColorStop(0,u.medium.getRgbaColor()),s.addColorStop(.388888,u.medium.getRgbaColor()),s.addColorStop(.5,u.light.getRgbaColor()),s.addColorStop(.611111,u.medium.getRgbaColor()),s.addColorStop(1,u.medium.getRgbaColor()),o.fillStyle=s,o.strokeStyle=u.dark.getRgbaColor(),o.fill(),o.stroke()),e||(o.beginPath(),h=i*.06542/2,o.arc(i*.5,i*.5,h,0,Math.PI*2),s=o.createLinearGradient(i*.5-h,i*.5+h,0,i*.5+h),s.addColorStop(0,\"#e6b35c\"),s.addColorStop(.01,\"#e6b35c\"),s.addColorStop(.99,\"#c48200\"),s.addColorStop(1,\"#c48200\"),o.fillStyle=s,o.closePath(),o.fill(),o.beginPath(),h=i*.046728/2,o.arc(i*.5,i*.5,h,0,Math.PI*2),s=o.createRadialGradient(i*.5,i*.5,0,i*.5,i*.5,h),s.addColorStop(0,\"#c5c5c5\"),s.addColorStop(.19,\"#c5c5c5\"),s.addColorStop(.22,\"#000000\"),s.addColorStop(.8,\"#000000\"),s.addColorStop(.99,\"#707070\"),s.addColorStop(1,\"#707070\"),o.fillStyle=s,o.closePath(),o.fill());break;case\"type1\":default:e||(s=o.createLinearGradient(0,i*.471962,0,i*.130841),s.addColorStop(0,u.veryDark.getRgbaColor()),s.addColorStop(.3,u.medium.getRgbaColor()),s.addColorStop(.59,u.medium.getRgbaColor()),s.addColorStop(1,u.veryDark.getRgbaColor()),o.fillStyle=s),o.beginPath(),o.moveTo(i*.518691,i*.471962),o.bezierCurveTo(i*.514018,i*.457943,i*.509345,i*.415887,i*.509345,i*.401869),o.bezierCurveTo(i*.504672,i*.383177,i*.5,i*.130841,i*.5,i*.130841),o.bezierCurveTo(i*.5,i*.130841,i*.490654,i*.383177,i*.490654,i*.397196),o.bezierCurveTo(i*.490654,i*.415887,i*.485981,i*.457943,i*.481308,i*.471962),o.bezierCurveTo(i*.471962,i*.481308,i*.467289,i*.490654,i*.467289,i*.5),o.bezierCurveTo(i*.467289,i*.518691,i*.481308,i*.53271,i*.5,i*.53271),o.bezierCurveTo(i*.518691,i*.53271,i*.53271,i*.518691,i*.53271,i*.5),o.bezierCurveTo(i*.53271,i*.490654,i*.528037,i*.481308,i*.518691,i*.471962),o.closePath(),o.fill()}nt.cache[c]=l}return n.drawImage(nt.cache[c],0,0),this},v,ht,w,rt,ot,y,et,e,o,p,a,d,h,u,b,ut,at,pt,ri,dt,g,l,lt,gt,bt,yt;nt.cache={},v=function(i,r,u,f,e,o){var w,s,h,y,c,l,a,p=e.toString()+o+r.design;if(!v.cache[p]){w=t(e,o),s=w.getContext(\"2d\"),s.fillStyle=\"#848484\",s.strokeStyle=\"rgba(132, 132, 132, 0.5)\",s.beginPath(),s.arc(u,f,e/2,0,Math.PI*2,!0),s.closePath(),s.fill(),s.stroke(),s.beginPath(),s.arc(u,f,e*.990654/2,0,Math.PI*2,!0),s.closePath();switch(r.design){case\"metal\":h=s.createLinearGradient(0,e*.004672,0,o*.990654),h.addColorStop(0,\"#fefefe\"),h.addColorStop(.07,\"rgb(210, 210, 210)\"),h.addColorStop(.12,\"rgb(179, 179, 179)\"),h.addColorStop(1,\"rgb(213, 213, 213)\"),s.fillStyle=h,s.fill();break;case\"brass\":h=s.createLinearGradient(0,e*.004672,0,o*.990654),h.addColorStop(0,\"rgb(249, 243, 155)\"),h.addColorStop(.05,\"rgb(246, 226, 101)\"),h.addColorStop(.1,\"rgb(240, 225, 132)\"),h.addColorStop(.5,\"rgb(90, 57, 22)\"),h.addColorStop(.9,\"rgb(249, 237, 139)\"),h.addColorStop(.95,\"rgb(243, 226, 108)\"),h.addColorStop(1,\"rgb(202, 182, 113)\"),s.fillStyle=h,s.fill();break;case\"steel\":h=s.createLinearGradient(0,e*.004672,0,o*.990654),h.addColorStop(0,\"rgb(231, 237, 237)\"),h.addColorStop(.05,\"rgb(189, 199, 198)\"),h.addColorStop(.1,\"rgb(192, 201, 200)\"),h.addColorStop(.5,\"rgb(23, 31, 33)\"),h.addColorStop(.9,\"rgb(196, 205, 204)\"),h.addColorStop(.95,\"rgb(194, 204, 203)\"),h.addColorStop(1,\"rgb(189, 201, 199)\"),s.fillStyle=h,s.fill();break;case\"gold\":h=s.createLinearGradient(0,e*.004672,0,o*.990654),h.addColorStop(0,\"rgb(255, 255, 207)\"),h.addColorStop(.15,\"rgb(255, 237, 96)\"),h.addColorStop(.22,\"rgb(254, 199, 57)\"),h.addColorStop(.3,\"rgb(255, 249, 203)\"),h.addColorStop(.38,\"rgb(255, 199, 64)\"),h.addColorStop(.44,\"rgb(252, 194, 60)\"),h.addColorStop(.51,\"rgb(255, 204, 59)\"),h.addColorStop(.6,\"rgb(213, 134, 29)\"),h.addColorStop(.68,\"rgb(255, 201, 56)\"),h.addColorStop(.75,\"rgb(212, 135, 29)\"),h.addColorStop(1,\"rgb(247, 238, 101)\"),s.fillStyle=h,s.fill();break;case\"anthracite\":h=s.createLinearGradient(0,.004672*o,0,.995326*o),h.addColorStop(0,\"rgb(118, 117, 135)\"),h.addColorStop(.06,\"rgb(74, 74, 82)\"),h.addColorStop(.12,\"rgb(50, 50, 54)\"),h.addColorStop(1,\"rgb(79, 79, 87)\"),s.fillStyle=h,s.fill();break;case\"tiltedGray\":h=s.createLinearGradient(.233644*e,.084112*o,.81258*e,.910919*o),h.addColorStop(0,\"#ffffff\"),h.addColorStop(.07,\"rgb(210, 210, 210)\"),h.addColorStop(.16,\"rgb(179, 179, 179)\"),h.addColorStop(.33,\"#ffffff\"),h.addColorStop(.55,\"#c5c5c5\"),h.addColorStop(.79,\"#ffffff\"),h.addColorStop(1,\"#666666\"),s.fillStyle=h,s.fill();break;case\"tiltedBlack\":h=s.createLinearGradient(.228971*e,.079439*o,.802547*e,.898591*o),h.addColorStop(0,\"#666666\"),h.addColorStop(.21,\"#000000\"),h.addColorStop(.47,\"#666666\"),h.addColorStop(.99,\"#000000\"),h.addColorStop(1,\"#000000\"),s.fillStyle=h,s.fill();break;case\"glossyMetal\":h=s.createRadialGradient(.5*e,.5*o,0,.5*e,.5*e,.5*e),h.addColorStop(0,\"rgb(207, 207, 207)\"),h.addColorStop(.96,\"rgb(205, 204, 205)\"),h.addColorStop(1,\"rgb(244, 244, 244)\"),s.fillStyle=h,s.fill(),s.beginPath(),s.arc(.5*e,.5*o,.973962*e/2,0,Math.PI*2),s.closePath(),h=s.createLinearGradient(0,o-.971962*o,0,.971962*o),h.addColorStop(0,\"rgb(249, 249, 249)\"),h.addColorStop(.23,\"rgb(200, 195, 191)\"),h.addColorStop(.36,\"#ffffff\"),h.addColorStop(.59,\"rgb(29, 29, 29)\"),h.addColorStop(.76,\"rgb(200, 194, 192)\"),h.addColorStop(1,\"rgb(209, 209, 209)\"),s.fillStyle=h,s.fill(),s.beginPath(),s.arc(.5*e,.5*o,.869158*e/2,0,Math.PI*2),s.closePath(),s.fillStyle=\"#f6f6f6\",s.fill(),s.beginPath(),s.arc(.5*e,.5*o,.85*e/2,0,Math.PI*2),s.closePath(),s.fillStyle=\"#333333\",s.fill();break;case\"blackMetal\":l=[0,.125,.347222,.5,.680555,.875,1],a=[new n(254,254,254,1),new n(0,0,0,1),new n(153,153,153,1),new n(0,0,0,1),new n(153,153,153,1),new n(0,0,0,1),new n(254,254,254,1)],s.save(),s.clip(s.arc(u,f,e*.990654/2,0,Math.PI*2,!0)),y=e*.495327,c=e*.42056,h=new it(l,a,-Math.PI/2),h.fill(s,u,f,c,y),s.strokeStyle=\"#848484\",s.strokeStyle=\"rgba(132, 132, 132, 0.8)\",s.beginPath(),s.lineWidth=e/90,s.arc(u,f,e/2,0,Math.PI*2,!0),s.closePath(),s.stroke(),s.restore();break;case\"shinyMetal\":l=[0,.125,.25,.347222,.5,.652777,.75,.875,1],a=[new n(254,254,254,1),new n(210,210,210,1),new n(179,179,179,1),new n(238,238,238,1),new n(160,160,160,1),new n(238,238,238,1),new n(179,179,179,1),new n(210,210,210,1),new n(254,254,254,1)],s.save(),s.clip(s.arc(u,f,e*.990654/2,0,Math.PI*2,!0)),y=e*.495327,c=e*.42056,h=new it(l,a,-Math.PI/2),h.fill(s,u,f,c,y),s.strokeStyle=\"#848484\",s.strokeStyle=\"rgba(132, 132, 132, 0.8)\",s.beginPath(),s.lineWidth=e/90,s.arc(u,f,e/2,0,Math.PI*2,!0),s.closePath(),s.stroke(),s.restore();break;case\"chrome\":l=[0,.09,.12,.16,.25,.29,.33,.38,.48,.52,.63,.68,.8,.83,.87,.97,1],a=[new n(255,255,255,1),new n(255,255,255,1),new n(136,136,138,1),new n(164,185,190,1),new n(158,179,182,1),new n(112,112,112,1),new n(221,227,227,1),new n(155,176,179,1),new n(156,176,177,1),new n(254,255,255,1),new n(255,255,255,1),new n(156,180,180,1),new n(198,209,211,1),new n(246,248,247,1),new n(204,216,216,1),new n(164,188,190,1),new n(255,255,255,1)],s.save(),s.clip(s.arc(u,f,e*.990654/2,0,Math.PI*2,!0)),y=e*.495327,c=e*.42056,h=new it(l,a,-Math.PI/2),h.fill(s,u,f,c,y),s.strokeStyle=\"#848484\",s.strokeStyle=\"rgba(132, 132, 132, 0.8)\",s.beginPath(),s.lineWidth=e/90,s.arc(u,f,e/2,0,Math.PI*2,!0),s.closePath(),s.stroke(),s.restore()}s.fillStyle=\"rgb(191, 191, 191)\",s.beginPath(),s.arc(u,f,e*.841121/2,0,Math.PI*2,!0),s.closePath(),s.fill(),s.globalCompositeOperation=\"destination-out\",s.beginPath(),s.arc(u,f,e*.831775/2,0,Math.PI*2,!0),s.closePath(),s.fill(),v.cache[p]=w}return i.drawImage(v.cache[p],0,0),this},v.cache={},ht=function(i,r,u,f,e){var c,k,h,l,d,w,o,p=[],v=[],y,a,b=u.toString()+f+r.design+e;if(!ht.cache[b]){c=Math.sqrt(u*u+f*f)*.04,c=Math.min(c,(e?u:f)*.1),k=t(u,f),h=k.getContext(\"2d\"),e?(l=u*.05,d=l-1,w=u*.028571):(l=f*.05,d=l-1,w=f*.028571),s(h,0,0,u,f,l),h.fillStyle=\"#838383\",h.fill(),s(h,1,1,u-2,f-2,d);switch(r.design){case\"metal\":o=h.createLinearGradient(0,u*.004672,0,f*.990654),o.addColorStop(0,\"#fefefe\"),o.addColorStop(.07,\"rgb(210, 210, 210)\"),o.addColorStop(.12,\"rgb(179, 179, 179)\"),o.addColorStop(1,\"rgb(213, 213, 213)\"),h.fillStyle=o,h.fill();break;case\"brass\":o=h.createLinearGradient(0,u*.004672,0,f*.990654),o.addColorStop(0,\"rgb(249, 243, 155)\"),o.addColorStop(.05,\"rgb(246, 226, 101)\"),o.addColorStop(.1,\"rgb(240, 225, 132)\"),o.addColorStop(.5,\"rgb(90, 57, 22)\"),o.addColorStop(.9,\"rgb(249, 237, 139)\"),o.addColorStop(.95,\"rgb(243, 226, 108)\"),o.addColorStop(1,\"rgb(202, 182, 113)\"),h.fillStyle=o,h.fill();break;case\"steel\":o=h.createLinearGradient(0,u*.004672,0,f*.990654),o.addColorStop(0,\"rgb(231, 237, 237)\"),o.addColorStop(.05,\"rgb(189, 199, 198)\"),o.addColorStop(.1,\"rgb(192, 201, 200)\"),o.addColorStop(.5,\"rgb(23, 31, 33)\"),o.addColorStop(.9,\"rgb(196, 205, 204)\"),o.addColorStop(.95,\"rgb(194, 204, 203)\"),o.addColorStop(1,\"rgb(189, 201, 199)\"),h.fillStyle=o,h.fill();break;case\"gold\":o=h.createLinearGradient(0,u*.004672,0,f*.990654),o.addColorStop(0,\"rgb(255, 255, 207)\"),o.addColorStop(.15,\"rgb(255, 237, 96)\"),o.addColorStop(.22,\"rgb(254, 199, 57)\"),o.addColorStop(.3,\"rgb(255, 249, 203)\"),o.addColorStop(.38,\"rgb(255, 199, 64)\"),o.addColorStop(.44,\"rgb(252, 194, 60)\"),o.addColorStop(.51,\"rgb(255, 204, 59)\"),o.addColorStop(.6,\"rgb(213, 134, 29)\"),o.addColorStop(.68,\"rgb(255, 201, 56)\"),o.addColorStop(.75,\"rgb(212, 135, 29)\"),o.addColorStop(1,\"rgb(247, 238, 101)\"),h.fillStyle=o,h.fill();break;case\"anthracite\":o=h.createLinearGradient(0,.004672*f,0,.995326*f),o.addColorStop(0,\"rgb(118, 117, 135)\"),o.addColorStop(.06,\"rgb(74, 74, 82)\"),o.addColorStop(.12,\"rgb(50, 50, 54)\"),o.addColorStop(1,\"rgb(79, 79, 87)\"),h.fillStyle=o,h.fill();break;case\"tiltedGray\":o=h.createLinearGradient(.233644*u,.084112*f,.81258*u,.910919*f),o.addColorStop(0,\"#ffffff\"),o.addColorStop(.07,\"rgb(210, 210, 210)\"),o.addColorStop(.16,\"rgb(179, 179, 179)\"),o.addColorStop(.33,\"#ffffff\"),o.addColorStop(.55,\"#c5c5c5\"),o.addColorStop(.79,\"#ffffff\"),o.addColorStop(1,\"#666666\"),h.fillStyle=o,h.fill();break;case\"tiltedBlack\":o=h.createLinearGradient(.228971*u,.079439*f,.802547*u,.898591*f),o.addColorStop(0,\"#666666\"),o.addColorStop(.21,\"#000000\"),o.addColorStop(.47,\"#666666\"),o.addColorStop(.99,\"#000000\"),o.addColorStop(1,\"#000000\"),h.fillStyle=o,h.fill();break;case\"glossyMetal\":h.clip(s(h,1,1,u-2,f-2,l)),o=h.createLinearGradient(0,1,0,f-2),o.addColorStop(0,\"rgb(249, 249, 249)\"),o.addColorStop(.2,\"rgb(200, 195, 191)\"),o.addColorStop(.3,\"#ffffff\"),o.addColorStop(.6,\"rgb(29, 29, 29)\"),o.addColorStop(.8,\"rgb(200, 194, 192)\"),o.addColorStop(1,\"rgb(209, 209, 209)\"),h.fillStyle=o,h.fill(),h.clip(s(h,c-2,c-2,u-(c-2)*2,f-(c-2)*2,w)),h.fillStyle=\"#f6f6f6\",h.fill(),h.clip(s(h,c-1,c-1,u-(c-1)*2,f-(c-1)*2,w)),h.fillStyle=\"#333333\",h.fill();break;case\"blackMetal\":p=[0,.125,.347222,.5,.680555,.875,1],v=[new n(254,254,254,1),new n(0,0,0,1),new n(153,153,153,1),new n(0,0,0,1),new n(153,153,153,1),new n(0,0,0,1),new n(254,254,254,1)],y=0,a=Math.sqrt(f*f+u*u)/2,h.clip(s(h,1,1,u-2,f-2,l)),o=new it(p,v,-Math.PI/2),o.fill(h,u/2,f/2,y,a);break;case\"shinyMetal\":p=[0,.125,.25,.347222,.5,.652777,.75,.875,1],v=[new n(254,254,254,1),new n(210,210,210,1),new n(179,179,179,1),new n(238,238,238,1),new n(160,160,160,1),new n(238,238,238,1),new n(179,179,179,1),new n(210,210,210,1),new n(254,254,254,1)],y=0,a=Math.sqrt(f*f+u*u)/2,h.clip(s(h,1,1,u-2,f-2,l)),o=new it(p,v,-Math.PI/2),o.fill(h,u/2,f/2,y,a);break;case\"chrome\":p=[0,.09,.12,.16,.25,.29,.33,.38,.48,.52,.63,.68,.8,.83,.87,.97,1],v=[new n(255,255,255,1),new n(255,255,255,1),new n(136,136,138,1),new n(164,185,190,1),new n(158,179,182,1),new n(112,112,112,1),new n(221,227,227,1),new n(155,176,179,1),new n(156,176,177,1),new n(254,255,255,1),new n(255,255,255,1),new n(156,180,180,1),new n(198,209,211,1),new n(246,248,247,1),new n(204,216,216,1),new n(164,188,190,1),new n(255,255,255,1)],y=0,a=Math.sqrt(f*f+u*u)/2,h.clip(s(h,1,1,u-2,f-2,l)),o=new it(p,v,-Math.PI/2),o.fill(h,u/2,f/2,y,a)}s(h,c-1,c-1,u-(c-1)*2,f-(c-1)*2,w-1),h.fillStyle=\"rgb(192, 192, 192)\",h.globalCompositeOperation=\"destination-out\",s(h,c,c,u-c*2,f-c*2,4),h.fill(),ht.cache[b]=k}return i.drawImage(ht.cache[b],0,0),this},ht.cache={},w=function(i,r,u,f,e,o){var p,s,h,k,d,g=e*.831775/2,et,ft,rt,tt,ut,c,v,a,l,nt,y,b=e.toString()+o+r.name;if(!w.cache[b]){p=t(e,o),s=p.getContext(\"2d\"),s.beginPath(),s.arc(u,f,e*.831775/2,0,Math.PI*2,!0),s.closePath();if(r.name===\"CARBON\"||r.name===\"PUNCHED_SHEET\"||r.name===\"BRUSHED_METAL\"||r.name===\"BRUSHED_STAINLESS\")r.name===\"CARBON\"&&(s.fillStyle=s.createPattern(vi,\"repeat\"),s.fill()),r.name===\"PUNCHED_SHEET\"&&(s.fillStyle=s.createPattern(ci,\"repeat\"),s.fill()),h=s.createLinearGradient(g,0,e-g,0),h.addColorStop(0,\"rgba(0, 0, 0, 0.25)\"),h.addColorStop(.5,\"rgba(0, 0, 0, 0)\"),h.addColorStop(1,\"rgba(0, 0, 0, 0.25)\"),s.fillStyle=h,s.beginPath(),s.arc(u,f,e*.831775/2,0,Math.PI*2,!0),s.closePath(),s.fill(),(r.name===\"BRUSHED_METAL\"||r.name===\"BRUSHED_STAINLESS\")&&(et=r.name===\"BRUSHED_METAL\"?!0:!1,ft=parseInt(r.gradientStop.getHexColor().substr(-6),16),rt=li(ft,5,.1,et,.5),s.fillStyle=s.createPattern(rt.fill(0,0,e,o),\"no-repeat\"),s.fill());else if(r.name===\"STAINLESS\"||r.name===\"TURNED\"){k=[0,.03,.1,.14,.24,.33,.38,.5,.62,.67,.76,.81,.85,.97,1],d=[new n(\"#FDFDFD\"),new n(\"#FDFDFD\"),new n(\"#B2B2B4\"),new n(\"#ACACAE\"),new n(\"#FDFDFD\"),new n(\"#6E6E70\"),new n(\"#6E6E70\"),new n(\"#FDFDFD\"),new n(\"#6E6E70\"),new n(\"#6E6E70\"),new n(\"#FDFDFD\"),new n(\"#ACACAE\"),new n(\"#B2B2B4\"),new n(\"#FDFDFD\"),new n(\"#FDFDFD\")],tt=e*.831775/2,ut=0,h=new it(k,d,Math.PI/1.75),h.fill(s,u,f,ut,tt),s.closePath();if(r.name===\"TURNED\"){for(c=Math.PI*2,v=e*.831775/2,a=v*.55,l=c/360*(500/v),s.save(),s.clip(s.arc(u,f,v,0,c)),s.lineWidth=.5,nt=c-l*.3,y=0;y0&&t.width>0&&(n.save(),n.beginPath(),n.arc(i,r,u*.831775/2,0,Math.PI*2,!0),n.clip(),n.drawImage(t,h,s,o,e),n.restore()),this},ot=function(i,r,u,f,e){var l,tt,c,ut,b,h,g,o,k,w,p,v,a,y,ft,rt,nt,d=u.toString()+f+e+r.name;if(!ot.cache[d]){h=Math.sqrt(u*u+f*f)*.04,h=Math.min(h,(e?u:f)*.1),g=t(u,f),o=g.getContext(\"2d\"),linBColor=r,s(o,h,h,u-h*2,f-h*2,4);if(r.name===\"CARBON\"||r.name===\"PUNCHED_SHEET\"||r.name===\"STAINLESS\"||r.name===\"BRUSHED_METAL\"||r.name===\"BRUSHED_STAINLESS\"||r.name===\"TURNED\"){r.name===\"CARBON\"&&(o.fillStyle=o.createPattern(vi,\"repeat\"),o.fill()),r.name===\"PUNCHED_SHEET\"&&(o.fillStyle=o.createPattern(ci,\"repeat\"),o.fill());if(r.name===\"STAINLESS\"||r.name===\"TURNED\"){ut=[0,.03,.1,.14,.24,.33,.38,.5,.62,.67,.76,.81,.85,.97,1],b=[new n(\"#FDFDFD\"),new n(\"#FDFDFD\"),new n(\"#B2B2B4\"),new n(\"#ACACAE\"),new n(\"#FDFDFD\"),new n(\"#6E6E70\"),new n(\"#6E6E70\"),new n(\"#FDFDFD\"),new n(\"#6E6E70\"),new n(\"#6E6E70\"),new n(\"#FDFDFD\"),new n(\"#ACACAE\"),new n(\"#B2B2B4\"),new n(\"#FDFDFD\"),new n(\"#FDFDFD\")],c=new it(ut,b,Math.PI/1.75),o.clip(s(o,h,h,u-h*2,f-h*2,4)),k=Math.sqrt((u-h*2)*(u-h*2)+(f-h*2)*(f-h*2))/2,c.fill(o,u/2,f/2,0,k),c=o.createLinearGradient(0,h,0,f-h*2),c.addColorStop(0,\"rgba(0, 0, 0, 0.25)\"),c.addColorStop(.1,\"rgba(0, 0, 0, 0.05)\"),c.addColorStop(1,\"rgba(0, 0, 0, 0)\"),o.fillStyle=c,s(o,h,h,u-h*2,f-h*2,4),o.fill(),o.restore();if(r.name===\"TURNED\"){for(w=Math.PI*2,p=k*.55,v=u/2,a=f/2,y=w/360*(400/k),o.save(),o.lineWidth=.5,tt=w-y*.3,l=0;l255?255:n}function e(n){return n<0?0:n>255?255:n}function s(n,t,i,r,u,f){var o,v,e,a,s,h,c,l;for(uu&&(e=(s-u-1)*4,h-=n.data[e],c-=n.data[e+1],l-=n.data[e+2]),o+u>16&255,ct=n>>8&255,at=n&255,g=0,nt=255*r,vt,pt,yt,y,rt,it,tt,ft;h=Math.floor(h),c=Math.floor(c),l=Math.ceil(l),a=Math.ceil(a),p=l-h,w=a-c,et=t(p,w),b=et.getContext(\"2d\"),v=b.createImageData(p,w),ot=b.createImageData(p,w);if(f!==0)for(st=[],k=0;k0?(s(v,ot,p,w,i,ht),b.putImageData(ot,h,c)):b.putImageData(v,h,c),et},this},n=function(n,t,i,r){function s(){e=k(n,255),f=k(t,255),u=k(i,255),o=k(r,1)}var e,f,u,o;arguments.length===1?(i=parseInt(n.substr(5,2),16),t=parseInt(n.substr(3,2),16),n=parseInt(n.substr(1,2),16),r=1):arguments.length===3&&(r=1),s(),this.getRed=function(){return e},this.setRed=function(n){e=k(n,255)},this.getGreen=function(){return f},this.setGreen=function(n){f=k(n,255)},this.getBlue=function(){return u},this.setBlue=function(n){u=k(n,255)},this.getAlpha=function(){return o},this.setAlpha=function(n){o=k(n,1)},this.getRgbaColor=function(){return\"rgba(\"+e+\", \"+f+\", \"+u+\", \"+o+\")\"},this.getRgbColor=function(){return\"rgb(\"+e+\", \"+f+\", \"+u+\")\"},this.getHexColor=function(){return\"#\"+e.toString(16)+f.toString(16)+u.toString(16)}},it=function(n,t,i){i=i===undefined?-Math.PI/2:i,this.fill=function(r,u,f,e,o){var h,s,p,v=2*Math.PI,c,a,w,b,y,k=180/Math.PI,d=e+(o-e)*.5,l=v/Math.max(360,o*2.2);for(r.save(),r.lineWidth=1.5,r.translate(u,f),r.rotate(i),r.translate(-u,-f),h=0,p=n.length-1;h0?r.arc(u,f,e,s+l,s,!0):r.moveTo(u,f),r.arc(u,f,o,s,s+l),r.fill(),r.stroke();r.restore()}},kt=function(n,t,i,r){this.getColorAt=function(n){var u=0,e=0,f=1,s=1,h=0,t,o;for(n=n<0?0:n>1?1:n,t=0;tn&&f>=i[t]&&(f=i[t],s=t)}return o=(n-u)/(f-u),ui(r[e],r[s],1,o)},this.getStart=function(){return n},this.getEnd=function(){return t}};Math.log10=function(n){return Math.log(n)/Math.LN10},function(){h=function(n,t,i,r,u,f){this.gradientStart=n,this.gradientFraction=t,this.gradientStop=i,this.labelColor=r,this.symbolColor=u,this.name=f}}(),function(){u=function(n,t,i,r,u,f){this.gradientStartColor=n,this.gradientFraction1Color=t,this.gradientFraction2Color=i,this.gradientFraction3Color=r,this.gradientStopColor=u,this.textColor=f}}(),function(){b=function(n,t,i,r,u,f){this.veryDark=n,this.dark=t,this.medium=i,this.light=r,this.lighter=u,this.veryLight=f}}(),function(){ut=function(n,t,i,r,u,f,e){this.innerColor1_ON=n,this.innerColor2_ON=t,this.outerColor_ON=i,this.coronaColor=r,this.innerColor1_OFF=u,this.innerColor2_OFF=f,this.outerColor_OFF=e}}(),function(){at=function(n){this.type=n}}(),function(){pt=function(n){this.type=n}}(),function(){ri=function(n){this.type=n}}(),function(){dt=function(n){this.style=n}}(),function(){g=function(n){this.design=n}}(),function(){l=function(n){this.type=n}}(),function(){lt=function(n){this.type=n}}(),function(){gt=function(n){this.format=n}}(),function(){bt=function(n){this.type=n}}(),function(){yt=function(n){this.state=n}}();var di={DARK_GRAY:new h(new n(0,0,0,1),new n(51,51,51,1),new n(153,153,153,1),new n(255,255,255,1),new n(180,180,180,1),\"DARK_GRAY\"),SATIN_GRAY:new h(new n(45,57,57,1),new n(45,57,57,1),new n(45,57,57,1),new n(167,184,180,1),new n(137,154,150,1),\"SATIN_GRAY\"),LIGHT_GRAY:new h(new n(130,130,130,1),new n(181,181,181,1),new n(253,253,253,1),new n(0,0,0,1),new n(80,80,80,1),\"LIGHT_GRAY\"),WHITE:new h(new n(255,255,255,1),new n(255,255,255,1),new n(255,255,255,1),new n(0,0,0,1),new n(80,80,80,1),\"WHITE\"),BLACK:new h(new n(0,0,0,1),new n(0,0,0,1),new n(0,0,0,1),new n(255,255,255,1),new n(150,150,150,1),\"BLACK\"),BEIGE:new h(new n(178,172,150,1),new n(204,205,184,1),new n(231,231,214,1),new n(0,0,0,1),new n(80,80,80,1),\"BEIGE\"),BROWN:new h(new n(245,225,193,1),new n(245,225,193,1),new n(255,250,240,1),new n(109,73,47,1),new n(89,53,27,1),\"BROWN\"),RED:new h(new n(198,93,95,1),new n(212,132,134,1),new n(242,218,218,1),new n(0,0,0,1),new n(90,0,0,1),\"RED\"),GREEN:new h(new n(65,120,40,1),new n(129,171,95,1),new n(218,237,202,1),new n(0,0,0,1),new n(0,90,0,1),\"GREEN\"),BLUE:new h(new n(45,83,122,1),new n(115,144,170,1),new n(227,234,238,1),new n(0,0,0,1),new n(0,0,90,1),\"BLUE\"),ANTHRACITE:new h(new n(50,50,54,1),new n(47,47,51,1),new n(69,69,74,1),new n(250,250,250,1),new n(180,180,180,1),\"ANTHRACITE\"),MUD:new h(new n(80,86,82,1),new n(70,76,72,1),new n(57,62,58,1),new n(255,255,240,1),new n(225,225,210,1),\"MUD\"),PUNCHED_SHEET:new h(new n(50,50,54,1),new n(47,47,51,1),new n(69,69,74,1),new n(255,255,255,1),new n(180,180,180,1),\"PUNCHED_SHEET\"),CARBON:new h(new n(50,50,54,1),new n(47,47,51,1),new n(69,69,74,1),new n(255,255,255,1),new n(180,180,180,1),\"CARBON\"),STAINLESS:new h(new n(130,130,130,1),new n(181,181,181,1),new n(253,253,253,1),new n(0,0,0,1),new n(80,80,80,1),\"STAINLESS\"),BRUSHED_METAL:new h(new n(50,50,54,1),new n(47,47,51,1),new n(69,69,74,1),new n(0,0,0,1),new n(80,80,80,1),\"BRUSHED_METAL\"),BRUSHED_STAINLESS:new h(new n(50,50,54,1),new n(47,47,51,1),new n(110,110,112,1),new n(0,0,0,1),new n(80,80,80,1),\"BRUSHED_STAINLESS\"),TURNED:new h(new n(130,130,130,1),new n(181,181,181,1),new n(253,253,253,1),new n(0,0,0,1),new n(80,80,80,1),\"TURNED\")},ki={BEIGE:new u(\"#c8c8b1\",\"rgb(241, 237, 207)\",\"rgb(234, 230, 194)\",\"rgb(225, 220, 183)\",\"rgb(237, 232, 191)\",\"#000000\"),BLUE:new u(\"#ffffff\",\"rgb(231, 246, 255)\",\"rgb(170, 224, 255)\",\"rgb(136, 212, 255)\",\"rgb(192, 232, 255)\",\"#124564\"),ORANGE:new u(\"#ffffff\",\"rgb(255, 245, 225)\",\"rgb(255, 217, 147)\",\"rgb(255, 201, 104)\",\"rgb(255, 227, 173)\",\"#503700\"),RED:new u(\"#ffffff\",\"rgb(255, 225, 225)\",\"rgb(253, 152, 152)\",\"rgb(252, 114, 115)\",\"rgb(254, 178, 178)\",\"#4f0c0e\"),YELLOW:new u(\"#ffffff\",\"rgb(245, 255, 186)\",\"rgb(210, 255, 0)\",\"rgb(158, 205, 0)\",\"rgb(210, 255, 0)\",\"#405300\"),WHITE:new u(\"#ffffff\",\"#ffffff\",\"rgb(241, 246, 242)\",\"rgb(229, 239, 244)\",\"#ffffff\",\"#000000\"),GRAY:new u(\"#414141\",\"rgb(117, 117, 117)\",\"rgb(87, 87, 87)\",\"#414141\",\"rgb(81, 81, 81)\",\"#ffffff\"),BLACK:new u(\"#414141\",\"#666666\",\"#333333\",\"#000000\",\"#333333\",\"#cccccc\"),GREEN:new u(\"rgb(33, 67, 67)\",\"rgb(33, 67, 67)\",\"rgb(29, 58, 58)\",\"rgb(28, 57, 57)\",\"rgb(23, 46, 46)\",\"rgba(0, 185, 165, 255)\"),BLUE2:new u(\"rgb(0, 68, 103)\",\"rgb(8, 109, 165)\",\"rgb(0, 72, 117)\",\"rgb(0, 72, 117)\",\"rgb(0, 68, 103)\",\"rgb(111, 182, 228)\"),BLUE_BLACK:new u(\"rgb(22, 125, 212)\",\"rgb(3, 162, 254)\",\"rgb(3, 162, 254)\",\"rgb(3, 162, 254)\",\"rgb(11, 172, 244)\",\"#000000\"),BLUE_DARKBLUE:new u(\"rgb(18, 33, 88)\",\"rgb(18, 33, 88)\",\"rgb(19, 30, 90)\",\"rgb(17, 31, 94)\",\"rgb(21, 25, 90)\",\"rgb(23, 99, 221)\"),BLUE_GRAY:new u(\"rgb(135, 174, 255)\",\"rgb(101, 159, 255)\",\"rgb(44, 93, 255)\",\"rgb(27, 65, 254)\",\"rgb(12, 50, 255)\",\"#b2b4ed\"),STANDARD:new u(\"rgb(131, 133, 119)\",\"rgb(176, 183, 167)\",\"rgb(165, 174, 153)\",\"rgb(166, 175, 156)\",\"rgb(175, 184, 165)\",\"rgb(35, 42, 52)\"),STANDARD_GREEN:new u(\"#ffffff\",\"rgb(219, 230, 220)\",\"rgb(179, 194, 178)\",\"rgb(153, 176, 151)\",\"rgb(114, 138, 109)\",\"#080C06\"),BLUE_BLUE:new u(\"rgb(100, 168, 253)\",\"rgb(100, 168, 253)\",\"rgb(95, 160, 250)\",\"rgb(80, 144, 252)\",\"rgb(74, 134, 255)\",\"#002cbb\"),RED_DARKRED:new u(\"rgb(72, 36, 50)\",\"rgb(185, 111, 110)\",\"rgb(148, 66, 72)\",\"rgb(83, 19, 20)\",\"rgb(7, 6, 14)\",\"#FE8B92\"),DARKBLUE:new u(\"rgb(14, 24, 31)\",\"rgb(46, 105, 144)\",\"rgb(19, 64, 96)\",\"rgb(6, 20, 29)\",\"rgb(8, 9, 10)\",\"#3DB3FF\"),LILA:new u(\"rgb(175, 164, 255)\",\"rgb(188, 168, 253)\",\"rgb(176, 159, 255)\",\"rgb(174, 147, 252)\",\"rgb(168, 136, 233)\",\"#076148\"),BLACKRED:new u(\"rgb(8, 12, 11)\",\"rgb(10, 11, 13)\",\"rgb(11, 10, 15)\",\"rgb(7, 13, 9)\",\"rgb(9, 13, 14)\",\"#B50026\"),DARKGREEN:new u(\"rgb(25, 85, 0)\",\"rgb(47, 154, 0)\",\"rgb(30, 101, 0)\",\"rgb(30, 101, 0)\",\"rgb(25, 85, 0)\",\"#233123\"),AMBER:new u(\"rgb(182, 71, 0)\",\"rgb(236, 155, 25)\",\"rgb(212, 93, 5)\",\"rgb(212, 93, 5)\",\"rgb(182, 71, 0)\",\"#593A0A\"),LIGHTBLUE:new u(\"rgb(125, 146, 184)\",\"rgb(197, 212, 231)\",\"rgb(138, 155, 194)\",\"rgb(138, 155, 194)\",\"rgb(125, 146, 184)\",\"#090051\"),SECTIONS:new u(\"#b2b2b2\",\"#ffffff\",\"#c4c4c4\",\"#c4c4c4\",\"#b2b2b2\",\"#000000\")},pi={RED:new b(new n(82,0,0,1),new n(158,0,19,1),new n(213,0,25,1),new n(240,82,88,1),new n(255,171,173,1),new n(255,217,218,1)),GREEN:new b(new n(8,54,4,1),new n(0,107,14,1),new n(15,148,0,1),new n(121,186,37,1),new n(190,231,141,1),new n(234,247,218,1)),BLUE:new b(new n(0,11,68,1),new n(0,73,135,1),new n(0,108,201,1),new n(0,141,242,1),new n(122,200,255,1),new n(204,236,255,1)),ORANGE:new b(new n(118,83,30,1),new n(215,67,0,1),new n(240,117,0,1),new n(255,166,0,1),new n(255,255,128,1),new n(255,247,194,1)),YELLOW:new b(new n(41,41,0,1),new n(102,102,0,1),new n(177,165,0,1),new n(255,242,0,1),new n(255,250,153,1),new n(255,252,204,1)),CYAN:new b(new n(15,109,109,1),new n(0,109,144,1),new n(0,144,191,1),new n(0,174,239,1),new n(153,223,249,1),new n(204,239,252,1)),MAGENTA:new b(new n(98,0,114,1),new n(128,24,72,1),new n(191,36,107,1),new n(255,48,143,1),new n(255,172,210,1),new n(255,214,23,1)),WHITE:new b(new n(210,210,210,1),new n(220,220,220,1),new n(235,235,235,1),new n(255,255,255,1),new n(255,255,255,1),new n(255,255,255,1)),GRAY:new b(new n(25,25,25,1),new n(51,51,51,1),new n(76,76,76,1),new n(128,128,128,1),new n(204,204,204,1),new n(243,243,243,1)),BLACK:new b(new n(0,0,0,1),new n(5,5,5,1),new n(10,10,10,1),new n(15,15,15,1),new n(20,20,20,1),new n(25,25,25,1)),RAITH:new b(new n(0,32,65,1),new n(0,65,125,1),new n(0,106,172,1),new n(130,180,214,1),new n(148,203,242,1),new n(191,229,255,1)),GREEN_LCD:new b(new n(0,55,45,1),new n(15,109,93,1),new n(0,185,165,1),new n(48,255,204,1),new n(153,255,227,1),new n(204,255,241,1)),JUG_GREEN:new b(new n(0,56,0,1),new n(32,69,36,1),new n(50,161,0,1),new n(129,206,0,1),new n(190,231,141,1),new n(234,247,218,1))},gi={RED_LED:new ut(\"#FF9A89\",\"#FF9A89\",\"#FF3300\",\"#FF8D70\",\"#7E1C00\",\"#7E1C00\",\"#641B00\"),GREEN_LED:new ut(\"#9AFF89\",\"#9AFF89\",\"#59FF2A\",\"#A5FF00\",\"#1C7E00\",\"#1C7E00\",\"#1B6400\"),BLUE_LED:new ut(\"#899AFF\",\"#899AFF\",\"#0033FF\",\"#708DFF\",\"#001C7E\",\"#001C7E\",\"#001B64\"),ORANGE_LED:new ut(\"#FEA23F\",\"#FEA23F\",\"#FD6C00\",\"#FD6C00\",\"#592800\",\"#592800\",\"#421F00\"),YELLOW_LED:new ut(\"#FFFF62\",\"#FFFF62\",\"#FFFF00\",\"#FFFF00\",\"#6B6D00\",\"#6B6D00\",\"#515300\"),CYAN_LED:new ut(\"#00FFFF\",\"#00FFFF\",\"#1BC3C3\",\"#00FFFF\",\"#083B3B\",\"#083B3B\",\"#052727\"),MAGENTA_LED:new ut(\"#D300FF\",\"#D300FF\",\"#8600CB\",\"#C300FF\",\"#38004B\",\"#38004B\",\"#280035\")},ai={TYPE1:new at(\"type1\"),TYPE2:new at(\"type2\"),TYPE3:new at(\"type3\"),TYPE4:new at(\"type4\"),TYPE5:new at(\"type5\")},ur={NORTH:new pt(\"north\"),SOUTH:new pt(\"south\"),EAST:new pt(\"east\"),WEST:new pt(\"west\")},fi={STANDARD_KNOB:new ri(\"standardKnob\"),METAL_KNOB:new ri(\"metalKnob\")},oi={BLACK:new dt(\"black\"),BRASS:new dt(\"brass\"),SILVER:new dt(\"silver\")},fr={BLACK_METAL:new g(\"blackMetal\"),METAL:new g(\"metal\"),SHINY_METAL:new g(\"shinyMetal\"),BRASS:new g(\"brass\"),STEEL:new g(\"steel\"),CHROME:new g(\"chrome\"),GOLD:new g(\"gold\"),ANTHRACITE:new g(\"anthracite\"),TILTED_GRAY:new g(\"tiltedGray\"),TILTED_BLACK:new g(\"tiltedBlack\"),GLOSSY_METAL:new g(\"glossyMetal\")},er={TYPE1:new l(\"type1\"),TYPE2:new l(\"type2\"),TYPE3:new l(\"type3\"),TYPE4:new l(\"type4\"),TYPE5:new l(\"type5\"),TYPE6:new l(\"type6\"),TYPE7:new l(\"type7\"),TYPE8:new l(\"type8\"),TYPE9:new l(\"type9\"),TYPE10:new l(\"type10\"),TYPE11:new l(\"type11\"),TYPE12:new l(\"type12\"),TYPE13:new l(\"type13\"),TYPE14:new l(\"type14\"),TYPE15:new l(\"type15\"),TYPE16:new l(\"type16\")},rr={TYPE1:new lt(\"type1\"),TYPE2:new lt(\"type2\"),TYPE3:new lt(\"type3\"),TYPE4:new lt(\"type4\"),TYPE5:new lt(\"type5\")},nr={STANDARD:new gt(\"standard\"),FRACTIONAL:new gt(\"fractional\"),SCIENTIFIC:new gt(\"scientific\")},tr={NORMAL:new bt(\"normal\"),HORIZONTAL:new bt(\"horizontal\"),TANGENT:new bt(\"tangent\")},ir={UP:new yt(\"up\"),STEADY:new yt(\"steady\"),DOWN:new yt(\"down\"),OFF:new yt(\"off\")};return{Radial:ei,RadialBargraph:wi,RadialVertical:bi,Linear:yi,LinearBargraph:kr,DisplaySingle:dr,DisplayMulti:wr,Level:br,Compass:gr,WindDirection:iu,Horizon:ru,Led:nu,Clock:tu,Battery:hr,StopWatch:cr,Altimeter:sr,TrafficLight:lr,LightBulb:yr,Odometer:pr,drawFrame:v,drawBackground:w,drawForeground:y,rgbaColor:n,ConicalGradient:it,setAlpha:f,getColorFromFraction:ui,gradientWrapper:kt,BackgroundColor:di,LcdColor:ki,ColorDef:pi,LedColor:gi,GaugeType:ai,Orientation:ur,FrameDesign:fr,PointerType:er,ForegroundType:rr,KnobType:fi,KnobStyle:oi,LabelNumberFormat:nr,TickLabelOrientation:tr,TrendState:ir,Section:vr}}()" }, { "path": "src/test/resources/samples/langs/JavaScript/uglify.js", "content": "/***********************************************************************\n\n A JavaScript tokenizer / parser / beautifier / compressor.\n\n This version is suitable for Node.js. With minimal changes (the\n exports stuff) it should work on any JS platform.\n\n This file contains the tokenizer/parser. It is a port to JavaScript\n of parse-js [1], a JavaScript parser library written in Common Lisp\n by Marijn Haverbeke. Thank you Marijn!\n\n [1] http://marijn.haverbeke.nl/parse-js/\n\n Exported functions:\n\n - tokenizer(code) -- returns a function. Call the returned\n function to fetch the next token.\n\n - parse(code) -- returns an AST of the given JavaScript code.\n\n -------------------------------- (C) ---------------------------------\n\n Author: Mihai Bazon\n \n http://mihai.bazon.net/blog\n\n Distributed under the BSD license:\n\n Copyright 2010 (c) Mihai Bazon \n Based on parse-js (http://marijn.haverbeke.nl/parse-js/).\n\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\n * Redistributions of source code must retain the above\n copyright notice, this list of conditions and the following\n 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\n provided with the distribution.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY\n EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE\n LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,\n OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR\n TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF\n THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n SUCH DAMAGE.\n\n ***********************************************************************/\n\n/* -----[ Tokenizer (constants) ]----- */\n\nvar KEYWORDS = array_to_hash([\n \"break\",\n \"case\",\n \"catch\",\n \"const\",\n \"continue\",\n \"default\",\n \"delete\",\n \"do\",\n \"else\",\n \"finally\",\n \"for\",\n \"function\",\n \"if\",\n \"in\",\n \"instanceof\",\n \"new\",\n \"return\",\n \"switch\",\n \"throw\",\n \"try\",\n \"typeof\",\n \"var\",\n \"void\",\n \"while\",\n \"with\"\n]);\n\nvar RESERVED_WORDS = array_to_hash([\n \"abstract\",\n \"boolean\",\n \"byte\",\n \"char\",\n \"class\",\n \"debugger\",\n \"double\",\n \"enum\",\n \"export\",\n \"extends\",\n \"final\",\n \"float\",\n \"goto\",\n \"implements\",\n \"import\",\n \"int\",\n \"interface\",\n \"long\",\n \"native\",\n \"package\",\n \"private\",\n \"protected\",\n \"public\",\n \"short\",\n \"static\",\n \"super\",\n \"synchronized\",\n \"throws\",\n \"transient\",\n \"volatile\"\n]);\n\nvar KEYWORDS_BEFORE_EXPRESSION = array_to_hash([\n \"return\",\n \"new\",\n \"delete\",\n \"throw\",\n \"else\",\n \"case\"\n]);\n\nvar KEYWORDS_ATOM = array_to_hash([\n \"false\",\n \"null\",\n \"true\",\n \"undefined\"\n]);\n\nvar OPERATOR_CHARS = array_to_hash(characters(\"+-*&%=<>!?|~^\"));\n\nvar RE_HEX_NUMBER = /^0x[0-9a-f]+$/i;\nvar RE_OCT_NUMBER = /^0[0-7]+$/;\nvar RE_DEC_NUMBER = /^\\d*\\.?\\d*(?:e[+-]?\\d*(?:\\d\\.?|\\.?\\d)\\d*)?$/i;\n\nvar OPERATORS = array_to_hash([\n \"in\",\n \"instanceof\",\n \"typeof\",\n \"new\",\n \"void\",\n \"delete\",\n \"++\",\n \"--\",\n \"+\",\n \"-\",\n \"!\",\n \"~\",\n \"&\",\n \"|\",\n \"^\",\n \"*\",\n \"/\",\n \"%\",\n \">>\",\n \"<<\",\n \">>>\",\n \"<\",\n \">\",\n \"<=\",\n \">=\",\n \"==\",\n \"===\",\n \"!=\",\n \"!==\",\n \"?\",\n \"=\",\n \"+=\",\n \"-=\",\n \"/=\",\n \"*=\",\n \"%=\",\n \">>=\",\n \"<<=\",\n \">>>=\",\n \"|=\",\n \"^=\",\n \"&=\",\n \"&&\",\n \"||\"\n]);\n\nvar WHITESPACE_CHARS = array_to_hash(characters(\" \\u00a0\\n\\r\\t\\f\\v\\u200b\"));\n\nvar PUNC_BEFORE_EXPRESSION = array_to_hash(characters(\"[{}(,.;:\"));\n\nvar PUNC_CHARS = array_to_hash(characters(\"[]{}(),;:\"));\n\nvar REGEXP_MODIFIERS = array_to_hash(characters(\"gmsiy\"));\n\n/* -----[ Tokenizer ]----- */\n\n// regexps adapted from http://xregexp.com/plugins/#unicode\nvar UNICODE = {\n letter: new RegExp(\"[\\\\u0041-\\\\u005A\\\\u0061-\\\\u007A\\\\u00AA\\\\u00B5\\\\u00BA\\\\u00C0-\\\\u00D6\\\\u00D8-\\\\u00F6\\\\u00F8-\\\\u02C1\\\\u02C6-\\\\u02D1\\\\u02E0-\\\\u02E4\\\\u02EC\\\\u02EE\\\\u0370-\\\\u0374\\\\u0376\\\\u0377\\\\u037A-\\\\u037D\\\\u0386\\\\u0388-\\\\u038A\\\\u038C\\\\u038E-\\\\u03A1\\\\u03A3-\\\\u03F5\\\\u03F7-\\\\u0481\\\\u048A-\\\\u0523\\\\u0531-\\\\u0556\\\\u0559\\\\u0561-\\\\u0587\\\\u05D0-\\\\u05EA\\\\u05F0-\\\\u05F2\\\\u0621-\\\\u064A\\\\u066E\\\\u066F\\\\u0671-\\\\u06D3\\\\u06D5\\\\u06E5\\\\u06E6\\\\u06EE\\\\u06EF\\\\u06FA-\\\\u06FC\\\\u06FF\\\\u0710\\\\u0712-\\\\u072F\\\\u074D-\\\\u07A5\\\\u07B1\\\\u07CA-\\\\u07EA\\\\u07F4\\\\u07F5\\\\u07FA\\\\u0904-\\\\u0939\\\\u093D\\\\u0950\\\\u0958-\\\\u0961\\\\u0971\\\\u0972\\\\u097B-\\\\u097F\\\\u0985-\\\\u098C\\\\u098F\\\\u0990\\\\u0993-\\\\u09A8\\\\u09AA-\\\\u09B0\\\\u09B2\\\\u09B6-\\\\u09B9\\\\u09BD\\\\u09CE\\\\u09DC\\\\u09DD\\\\u09DF-\\\\u09E1\\\\u09F0\\\\u09F1\\\\u0A05-\\\\u0A0A\\\\u0A0F\\\\u0A10\\\\u0A13-\\\\u0A28\\\\u0A2A-\\\\u0A30\\\\u0A32\\\\u0A33\\\\u0A35\\\\u0A36\\\\u0A38\\\\u0A39\\\\u0A59-\\\\u0A5C\\\\u0A5E\\\\u0A72-\\\\u0A74\\\\u0A85-\\\\u0A8D\\\\u0A8F-\\\\u0A91\\\\u0A93-\\\\u0AA8\\\\u0AAA-\\\\u0AB0\\\\u0AB2\\\\u0AB3\\\\u0AB5-\\\\u0AB9\\\\u0ABD\\\\u0AD0\\\\u0AE0\\\\u0AE1\\\\u0B05-\\\\u0B0C\\\\u0B0F\\\\u0B10\\\\u0B13-\\\\u0B28\\\\u0B2A-\\\\u0B30\\\\u0B32\\\\u0B33\\\\u0B35-\\\\u0B39\\\\u0B3D\\\\u0B5C\\\\u0B5D\\\\u0B5F-\\\\u0B61\\\\u0B71\\\\u0B83\\\\u0B85-\\\\u0B8A\\\\u0B8E-\\\\u0B90\\\\u0B92-\\\\u0B95\\\\u0B99\\\\u0B9A\\\\u0B9C\\\\u0B9E\\\\u0B9F\\\\u0BA3\\\\u0BA4\\\\u0BA8-\\\\u0BAA\\\\u0BAE-\\\\u0BB9\\\\u0BD0\\\\u0C05-\\\\u0C0C\\\\u0C0E-\\\\u0C10\\\\u0C12-\\\\u0C28\\\\u0C2A-\\\\u0C33\\\\u0C35-\\\\u0C39\\\\u0C3D\\\\u0C58\\\\u0C59\\\\u0C60\\\\u0C61\\\\u0C85-\\\\u0C8C\\\\u0C8E-\\\\u0C90\\\\u0C92-\\\\u0CA8\\\\u0CAA-\\\\u0CB3\\\\u0CB5-\\\\u0CB9\\\\u0CBD\\\\u0CDE\\\\u0CE0\\\\u0CE1\\\\u0D05-\\\\u0D0C\\\\u0D0E-\\\\u0D10\\\\u0D12-\\\\u0D28\\\\u0D2A-\\\\u0D39\\\\u0D3D\\\\u0D60\\\\u0D61\\\\u0D7A-\\\\u0D7F\\\\u0D85-\\\\u0D96\\\\u0D9A-\\\\u0DB1\\\\u0DB3-\\\\u0DBB\\\\u0DBD\\\\u0DC0-\\\\u0DC6\\\\u0E01-\\\\u0E30\\\\u0E32\\\\u0E33\\\\u0E40-\\\\u0E46\\\\u0E81\\\\u0E82\\\\u0E84\\\\u0E87\\\\u0E88\\\\u0E8A\\\\u0E8D\\\\u0E94-\\\\u0E97\\\\u0E99-\\\\u0E9F\\\\u0EA1-\\\\u0EA3\\\\u0EA5\\\\u0EA7\\\\u0EAA\\\\u0EAB\\\\u0EAD-\\\\u0EB0\\\\u0EB2\\\\u0EB3\\\\u0EBD\\\\u0EC0-\\\\u0EC4\\\\u0EC6\\\\u0EDC\\\\u0EDD\\\\u0F00\\\\u0F40-\\\\u0F47\\\\u0F49-\\\\u0F6C\\\\u0F88-\\\\u0F8B\\\\u1000-\\\\u102A\\\\u103F\\\\u1050-\\\\u1055\\\\u105A-\\\\u105D\\\\u1061\\\\u1065\\\\u1066\\\\u106E-\\\\u1070\\\\u1075-\\\\u1081\\\\u108E\\\\u10A0-\\\\u10C5\\\\u10D0-\\\\u10FA\\\\u10FC\\\\u1100-\\\\u1159\\\\u115F-\\\\u11A2\\\\u11A8-\\\\u11F9\\\\u1200-\\\\u1248\\\\u124A-\\\\u124D\\\\u1250-\\\\u1256\\\\u1258\\\\u125A-\\\\u125D\\\\u1260-\\\\u1288\\\\u128A-\\\\u128D\\\\u1290-\\\\u12B0\\\\u12B2-\\\\u12B5\\\\u12B8-\\\\u12BE\\\\u12C0\\\\u12C2-\\\\u12C5\\\\u12C8-\\\\u12D6\\\\u12D8-\\\\u1310\\\\u1312-\\\\u1315\\\\u1318-\\\\u135A\\\\u1380-\\\\u138F\\\\u13A0-\\\\u13F4\\\\u1401-\\\\u166C\\\\u166F-\\\\u1676\\\\u1681-\\\\u169A\\\\u16A0-\\\\u16EA\\\\u1700-\\\\u170C\\\\u170E-\\\\u1711\\\\u1720-\\\\u1731\\\\u1740-\\\\u1751\\\\u1760-\\\\u176C\\\\u176E-\\\\u1770\\\\u1780-\\\\u17B3\\\\u17D7\\\\u17DC\\\\u1820-\\\\u1877\\\\u1880-\\\\u18A8\\\\u18AA\\\\u1900-\\\\u191C\\\\u1950-\\\\u196D\\\\u1970-\\\\u1974\\\\u1980-\\\\u19A9\\\\u19C1-\\\\u19C7\\\\u1A00-\\\\u1A16\\\\u1B05-\\\\u1B33\\\\u1B45-\\\\u1B4B\\\\u1B83-\\\\u1BA0\\\\u1BAE\\\\u1BAF\\\\u1C00-\\\\u1C23\\\\u1C4D-\\\\u1C4F\\\\u1C5A-\\\\u1C7D\\\\u1D00-\\\\u1DBF\\\\u1E00-\\\\u1F15\\\\u1F18-\\\\u1F1D\\\\u1F20-\\\\u1F45\\\\u1F48-\\\\u1F4D\\\\u1F50-\\\\u1F57\\\\u1F59\\\\u1F5B\\\\u1F5D\\\\u1F5F-\\\\u1F7D\\\\u1F80-\\\\u1FB4\\\\u1FB6-\\\\u1FBC\\\\u1FBE\\\\u1FC2-\\\\u1FC4\\\\u1FC6-\\\\u1FCC\\\\u1FD0-\\\\u1FD3\\\\u1FD6-\\\\u1FDB\\\\u1FE0-\\\\u1FEC\\\\u1FF2-\\\\u1FF4\\\\u1FF6-\\\\u1FFC\\\\u2071\\\\u207F\\\\u2090-\\\\u2094\\\\u2102\\\\u2107\\\\u210A-\\\\u2113\\\\u2115\\\\u2119-\\\\u211D\\\\u2124\\\\u2126\\\\u2128\\\\u212A-\\\\u212D\\\\u212F-\\\\u2139\\\\u213C-\\\\u213F\\\\u2145-\\\\u2149\\\\u214E\\\\u2183\\\\u2184\\\\u2C00-\\\\u2C2E\\\\u2C30-\\\\u2C5E\\\\u2C60-\\\\u2C6F\\\\u2C71-\\\\u2C7D\\\\u2C80-\\\\u2CE4\\\\u2D00-\\\\u2D25\\\\u2D30-\\\\u2D65\\\\u2D6F\\\\u2D80-\\\\u2D96\\\\u2DA0-\\\\u2DA6\\\\u2DA8-\\\\u2DAE\\\\u2DB0-\\\\u2DB6\\\\u2DB8-\\\\u2DBE\\\\u2DC0-\\\\u2DC6\\\\u2DC8-\\\\u2DCE\\\\u2DD0-\\\\u2DD6\\\\u2DD8-\\\\u2DDE\\\\u2E2F\\\\u3005\\\\u3006\\\\u3031-\\\\u3035\\\\u303B\\\\u303C\\\\u3041-\\\\u3096\\\\u309D-\\\\u309F\\\\u30A1-\\\\u30FA\\\\u30FC-\\\\u30FF\\\\u3105-\\\\u312D\\\\u3131-\\\\u318E\\\\u31A0-\\\\u31B7\\\\u31F0-\\\\u31FF\\\\u3400\\\\u4DB5\\\\u4E00\\\\u9FC3\\\\uA000-\\\\uA48C\\\\uA500-\\\\uA60C\\\\uA610-\\\\uA61F\\\\uA62A\\\\uA62B\\\\uA640-\\\\uA65F\\\\uA662-\\\\uA66E\\\\uA67F-\\\\uA697\\\\uA717-\\\\uA71F\\\\uA722-\\\\uA788\\\\uA78B\\\\uA78C\\\\uA7FB-\\\\uA801\\\\uA803-\\\\uA805\\\\uA807-\\\\uA80A\\\\uA80C-\\\\uA822\\\\uA840-\\\\uA873\\\\uA882-\\\\uA8B3\\\\uA90A-\\\\uA925\\\\uA930-\\\\uA946\\\\uAA00-\\\\uAA28\\\\uAA40-\\\\uAA42\\\\uAA44-\\\\uAA4B\\\\uAC00\\\\uD7A3\\\\uF900-\\\\uFA2D\\\\uFA30-\\\\uFA6A\\\\uFA70-\\\\uFAD9\\\\uFB00-\\\\uFB06\\\\uFB13-\\\\uFB17\\\\uFB1D\\\\uFB1F-\\\\uFB28\\\\uFB2A-\\\\uFB36\\\\uFB38-\\\\uFB3C\\\\uFB3E\\\\uFB40\\\\uFB41\\\\uFB43\\\\uFB44\\\\uFB46-\\\\uFBB1\\\\uFBD3-\\\\uFD3D\\\\uFD50-\\\\uFD8F\\\\uFD92-\\\\uFDC7\\\\uFDF0-\\\\uFDFB\\\\uFE70-\\\\uFE74\\\\uFE76-\\\\uFEFC\\\\uFF21-\\\\uFF3A\\\\uFF41-\\\\uFF5A\\\\uFF66-\\\\uFFBE\\\\uFFC2-\\\\uFFC7\\\\uFFCA-\\\\uFFCF\\\\uFFD2-\\\\uFFD7\\\\uFFDA-\\\\uFFDC]\"),\n non_spacing_mark: new RegExp(\"[\\\\u0300-\\\\u036F\\\\u0483-\\\\u0487\\\\u0591-\\\\u05BD\\\\u05BF\\\\u05C1\\\\u05C2\\\\u05C4\\\\u05C5\\\\u05C7\\\\u0610-\\\\u061A\\\\u064B-\\\\u065E\\\\u0670\\\\u06D6-\\\\u06DC\\\\u06DF-\\\\u06E4\\\\u06E7\\\\u06E8\\\\u06EA-\\\\u06ED\\\\u0711\\\\u0730-\\\\u074A\\\\u07A6-\\\\u07B0\\\\u07EB-\\\\u07F3\\\\u0816-\\\\u0819\\\\u081B-\\\\u0823\\\\u0825-\\\\u0827\\\\u0829-\\\\u082D\\\\u0900-\\\\u0902\\\\u093C\\\\u0941-\\\\u0948\\\\u094D\\\\u0951-\\\\u0955\\\\u0962\\\\u0963\\\\u0981\\\\u09BC\\\\u09C1-\\\\u09C4\\\\u09CD\\\\u09E2\\\\u09E3\\\\u0A01\\\\u0A02\\\\u0A3C\\\\u0A41\\\\u0A42\\\\u0A47\\\\u0A48\\\\u0A4B-\\\\u0A4D\\\\u0A51\\\\u0A70\\\\u0A71\\\\u0A75\\\\u0A81\\\\u0A82\\\\u0ABC\\\\u0AC1-\\\\u0AC5\\\\u0AC7\\\\u0AC8\\\\u0ACD\\\\u0AE2\\\\u0AE3\\\\u0B01\\\\u0B3C\\\\u0B3F\\\\u0B41-\\\\u0B44\\\\u0B4D\\\\u0B56\\\\u0B62\\\\u0B63\\\\u0B82\\\\u0BC0\\\\u0BCD\\\\u0C3E-\\\\u0C40\\\\u0C46-\\\\u0C48\\\\u0C4A-\\\\u0C4D\\\\u0C55\\\\u0C56\\\\u0C62\\\\u0C63\\\\u0CBC\\\\u0CBF\\\\u0CC6\\\\u0CCC\\\\u0CCD\\\\u0CE2\\\\u0CE3\\\\u0D41-\\\\u0D44\\\\u0D4D\\\\u0D62\\\\u0D63\\\\u0DCA\\\\u0DD2-\\\\u0DD4\\\\u0DD6\\\\u0E31\\\\u0E34-\\\\u0E3A\\\\u0E47-\\\\u0E4E\\\\u0EB1\\\\u0EB4-\\\\u0EB9\\\\u0EBB\\\\u0EBC\\\\u0EC8-\\\\u0ECD\\\\u0F18\\\\u0F19\\\\u0F35\\\\u0F37\\\\u0F39\\\\u0F71-\\\\u0F7E\\\\u0F80-\\\\u0F84\\\\u0F86\\\\u0F87\\\\u0F90-\\\\u0F97\\\\u0F99-\\\\u0FBC\\\\u0FC6\\\\u102D-\\\\u1030\\\\u1032-\\\\u1037\\\\u1039\\\\u103A\\\\u103D\\\\u103E\\\\u1058\\\\u1059\\\\u105E-\\\\u1060\\\\u1071-\\\\u1074\\\\u1082\\\\u1085\\\\u1086\\\\u108D\\\\u109D\\\\u135F\\\\u1712-\\\\u1714\\\\u1732-\\\\u1734\\\\u1752\\\\u1753\\\\u1772\\\\u1773\\\\u17B7-\\\\u17BD\\\\u17C6\\\\u17C9-\\\\u17D3\\\\u17DD\\\\u180B-\\\\u180D\\\\u18A9\\\\u1920-\\\\u1922\\\\u1927\\\\u1928\\\\u1932\\\\u1939-\\\\u193B\\\\u1A17\\\\u1A18\\\\u1A56\\\\u1A58-\\\\u1A5E\\\\u1A60\\\\u1A62\\\\u1A65-\\\\u1A6C\\\\u1A73-\\\\u1A7C\\\\u1A7F\\\\u1B00-\\\\u1B03\\\\u1B34\\\\u1B36-\\\\u1B3A\\\\u1B3C\\\\u1B42\\\\u1B6B-\\\\u1B73\\\\u1B80\\\\u1B81\\\\u1BA2-\\\\u1BA5\\\\u1BA8\\\\u1BA9\\\\u1C2C-\\\\u1C33\\\\u1C36\\\\u1C37\\\\u1CD0-\\\\u1CD2\\\\u1CD4-\\\\u1CE0\\\\u1CE2-\\\\u1CE8\\\\u1CED\\\\u1DC0-\\\\u1DE6\\\\u1DFD-\\\\u1DFF\\\\u20D0-\\\\u20DC\\\\u20E1\\\\u20E5-\\\\u20F0\\\\u2CEF-\\\\u2CF1\\\\u2DE0-\\\\u2DFF\\\\u302A-\\\\u302F\\\\u3099\\\\u309A\\\\uA66F\\\\uA67C\\\\uA67D\\\\uA6F0\\\\uA6F1\\\\uA802\\\\uA806\\\\uA80B\\\\uA825\\\\uA826\\\\uA8C4\\\\uA8E0-\\\\uA8F1\\\\uA926-\\\\uA92D\\\\uA947-\\\\uA951\\\\uA980-\\\\uA982\\\\uA9B3\\\\uA9B6-\\\\uA9B9\\\\uA9BC\\\\uAA29-\\\\uAA2E\\\\uAA31\\\\uAA32\\\\uAA35\\\\uAA36\\\\uAA43\\\\uAA4C\\\\uAAB0\\\\uAAB2-\\\\uAAB4\\\\uAAB7\\\\uAAB8\\\\uAABE\\\\uAABF\\\\uAAC1\\\\uABE5\\\\uABE8\\\\uABED\\\\uFB1E\\\\uFE00-\\\\uFE0F\\\\uFE20-\\\\uFE26]\"),\n space_combining_mark: new RegExp(\"[\\\\u0903\\\\u093E-\\\\u0940\\\\u0949-\\\\u094C\\\\u094E\\\\u0982\\\\u0983\\\\u09BE-\\\\u09C0\\\\u09C7\\\\u09C8\\\\u09CB\\\\u09CC\\\\u09D7\\\\u0A03\\\\u0A3E-\\\\u0A40\\\\u0A83\\\\u0ABE-\\\\u0AC0\\\\u0AC9\\\\u0ACB\\\\u0ACC\\\\u0B02\\\\u0B03\\\\u0B3E\\\\u0B40\\\\u0B47\\\\u0B48\\\\u0B4B\\\\u0B4C\\\\u0B57\\\\u0BBE\\\\u0BBF\\\\u0BC1\\\\u0BC2\\\\u0BC6-\\\\u0BC8\\\\u0BCA-\\\\u0BCC\\\\u0BD7\\\\u0C01-\\\\u0C03\\\\u0C41-\\\\u0C44\\\\u0C82\\\\u0C83\\\\u0CBE\\\\u0CC0-\\\\u0CC4\\\\u0CC7\\\\u0CC8\\\\u0CCA\\\\u0CCB\\\\u0CD5\\\\u0CD6\\\\u0D02\\\\u0D03\\\\u0D3E-\\\\u0D40\\\\u0D46-\\\\u0D48\\\\u0D4A-\\\\u0D4C\\\\u0D57\\\\u0D82\\\\u0D83\\\\u0DCF-\\\\u0DD1\\\\u0DD8-\\\\u0DDF\\\\u0DF2\\\\u0DF3\\\\u0F3E\\\\u0F3F\\\\u0F7F\\\\u102B\\\\u102C\\\\u1031\\\\u1038\\\\u103B\\\\u103C\\\\u1056\\\\u1057\\\\u1062-\\\\u1064\\\\u1067-\\\\u106D\\\\u1083\\\\u1084\\\\u1087-\\\\u108C\\\\u108F\\\\u109A-\\\\u109C\\\\u17B6\\\\u17BE-\\\\u17C5\\\\u17C7\\\\u17C8\\\\u1923-\\\\u1926\\\\u1929-\\\\u192B\\\\u1930\\\\u1931\\\\u1933-\\\\u1938\\\\u19B0-\\\\u19C0\\\\u19C8\\\\u19C9\\\\u1A19-\\\\u1A1B\\\\u1A55\\\\u1A57\\\\u1A61\\\\u1A63\\\\u1A64\\\\u1A6D-\\\\u1A72\\\\u1B04\\\\u1B35\\\\u1B3B\\\\u1B3D-\\\\u1B41\\\\u1B43\\\\u1B44\\\\u1B82\\\\u1BA1\\\\u1BA6\\\\u1BA7\\\\u1BAA\\\\u1C24-\\\\u1C2B\\\\u1C34\\\\u1C35\\\\u1CE1\\\\u1CF2\\\\uA823\\\\uA824\\\\uA827\\\\uA880\\\\uA881\\\\uA8B4-\\\\uA8C3\\\\uA952\\\\uA953\\\\uA983\\\\uA9B4\\\\uA9B5\\\\uA9BA\\\\uA9BB\\\\uA9BD-\\\\uA9C0\\\\uAA2F\\\\uAA30\\\\uAA33\\\\uAA34\\\\uAA4D\\\\uAA7B\\\\uABE3\\\\uABE4\\\\uABE6\\\\uABE7\\\\uABE9\\\\uABEA\\\\uABEC]\"),\n connector_punctuation: new RegExp(\"[\\\\u005F\\\\u203F\\\\u2040\\\\u2054\\\\uFE33\\\\uFE34\\\\uFE4D-\\\\uFE4F\\\\uFF3F]\")\n};\n\nfunction is_letter(ch) {\n return UNICODE.letter.test(ch);\n};\n\nfunction is_digit(ch) {\n ch = ch.charCodeAt(0);\n return ch >= 48 && ch <= 57; //XXX: find out if \"UnicodeDigit\" means something else than 0..9\n};\n\nfunction is_alphanumeric_char(ch) {\n return is_digit(ch) || is_letter(ch);\n};\n\nfunction is_unicode_combining_mark(ch) {\n return UNICODE.non_spacing_mark.test(ch) || UNICODE.space_combining_mark.test(ch);\n};\n\nfunction is_unicode_connector_punctuation(ch) {\n return UNICODE.connector_punctuation.test(ch);\n};\n\nfunction is_identifier_start(ch) {\n return ch == \"$\" || ch == \"_\" || is_letter(ch);\n};\n\nfunction is_identifier_char(ch) {\n return is_identifier_start(ch)\n || is_unicode_combining_mark(ch)\n || is_digit(ch)\n || is_unicode_connector_punctuation(ch)\n || ch == \"\\u200c\" // zero-width non-joiner \n || ch == \"\\u200d\" // zero-width joiner (in my ECMA-262 PDF, this is also 200c)\n ;\n};\n\nfunction parse_js_number(num) {\n if (RE_HEX_NUMBER.test(num)) {\n return parseInt(num.substr(2), 16);\n } else if (RE_OCT_NUMBER.test(num)) {\n return parseInt(num.substr(1), 8);\n } else if (RE_DEC_NUMBER.test(num)) {\n return parseFloat(num);\n }\n};\n\nfunction JS_Parse_Error(message, line, col, pos) {\n this.message = message;\n this.line = line;\n this.col = col;\n this.pos = pos;\n try {\n var ex = new Error(message);\n ex.name = 'JS_Parse_Error'\n throw ex\n } catch(ex) {\n this.stack = ex.stack;\n };\n};\n\nJS_Parse_Error.prototype.toString = function() {\n return this.message + \" (line: \" + this.line + \", col: \" + this.col + \", pos: \" + this.pos + \")\" + \"\\n\\n\" + this.stack;\n};\n\nfunction js_error(message, line, col, pos) {\n throw new JS_Parse_Error(message, line, col, pos);\n};\n\nfunction is_token(token, type, val) {\n return token.type == type && (val == null || token.value == val);\n};\n\nvar EX_EOF = {};\n\nfunction tokenizer($TEXT) {\n\n var S = {\n text : $TEXT.replace(/\\r\\n?|[\\n\\u2028\\u2029]/g, \"\\n\").replace(/^\\uFEFF/, ''),\n pos : 0,\n tokpos : 0,\n line : 0,\n tokline : 0,\n col : 0,\n tokcol : 0,\n newline_before : false,\n regex_allowed : false,\n comments_before : []\n };\n\n function peek() { return S.text.charAt(S.pos); };\n\n function next(signal_eof) {\n var ch = S.text.charAt(S.pos++);\n if (signal_eof && !ch)\n throw EX_EOF;\n if (ch == \"\\n\") {\n S.newline_before = true;\n ++S.line;\n S.col = 0;\n } else {\n ++S.col;\n }\n return ch;\n };\n\n function eof() {\n return !S.peek();\n };\n\n function find(what, signal_eof) {\n var pos = S.text.indexOf(what, S.pos);\n if (signal_eof && pos == -1) throw EX_EOF;\n return pos;\n };\n\n function start_token() {\n S.tokline = S.line;\n S.tokcol = S.col;\n S.tokpos = S.pos;\n };\n\n function token(type, value, is_comment) {\n S.regex_allowed = ((type == \"operator\" && !HOP(UNARY_POSTFIX, value)) ||\n (type == \"keyword\" && HOP(KEYWORDS_BEFORE_EXPRESSION, value)) ||\n (type == \"punc\" && HOP(PUNC_BEFORE_EXPRESSION, value)));\n var ret = {\n type : type,\n value : value,\n line : S.tokline,\n col : S.tokcol,\n pos : S.tokpos,\n nlb : S.newline_before\n };\n if (!is_comment) {\n ret.comments_before = S.comments_before;\n S.comments_before = [];\n }\n S.newline_before = false;\n return ret;\n };\n\n function skip_whitespace() {\n while (HOP(WHITESPACE_CHARS, peek()))\n next();\n };\n\n function read_while(pred) {\n var ret = \"\", ch = peek(), i = 0;\n while (ch && pred(ch, i++)) {\n ret += next();\n ch = peek();\n }\n return ret;\n };\n\n function parse_error(err) {\n js_error(err, S.tokline, S.tokcol, S.tokpos);\n };\n\n function read_num(prefix) {\n var has_e = false, after_e = false, has_x = false, has_dot = prefix == \".\";\n var num = read_while(function(ch, i){\n if (ch == \"x\" || ch == \"X\") {\n if (has_x) return false;\n return has_x = true;\n }\n if (!has_x && (ch == \"E\" || ch == \"e\")) {\n if (has_e) return false;\n return has_e = after_e = true;\n }\n if (ch == \"-\") {\n if (after_e || (i == 0 && !prefix)) return true;\n return false;\n }\n if (ch == \"+\") return after_e;\n after_e = false;\n if (ch == \".\") {\n if (!has_dot && !has_x)\n return has_dot = true;\n return false;\n }\n return is_alphanumeric_char(ch);\n });\n if (prefix)\n num = prefix + num;\n var valid = parse_js_number(num);\n if (!isNaN(valid)) {\n return token(\"num\", valid);\n } else {\n parse_error(\"Invalid syntax: \" + num);\n }\n };\n\n function read_escaped_char() {\n var ch = next(true);\n switch (ch) {\n case \"n\" : return \"\\n\";\n case \"r\" : return \"\\r\";\n case \"t\" : return \"\\t\";\n case \"b\" : return \"\\b\";\n case \"v\" : return \"\\v\";\n case \"f\" : return \"\\f\";\n case \"0\" : return \"\\0\";\n case \"x\" : return String.fromCharCode(hex_bytes(2));\n case \"u\" : return String.fromCharCode(hex_bytes(4));\n default : return ch;\n }\n };\n\n function hex_bytes(n) {\n var num = 0;\n for (; n > 0; --n) {\n var digit = parseInt(next(true), 16);\n if (isNaN(digit))\n parse_error(\"Invalid hex-character pattern in string\");\n num = (num << 4) | digit;\n }\n return num;\n };\n\n function read_string() {\n return with_eof_error(\"Unterminated string constant\", function(){\n var quote = next(), ret = \"\";\n for (;;) {\n var ch = next(true);\n if (ch == \"\\\\\") ch = read_escaped_char();\n else if (ch == quote) break;\n ret += ch;\n }\n return token(\"string\", ret);\n });\n };\n\n function read_line_comment() {\n next();\n var i = find(\"\\n\"), ret;\n if (i == -1) {\n ret = S.text.substr(S.pos);\n S.pos = S.text.length;\n } else {\n ret = S.text.substring(S.pos, i);\n S.pos = i;\n }\n return token(\"comment1\", ret, true);\n };\n\n function read_multiline_comment() {\n next();\n return with_eof_error(\"Unterminated multiline comment\", function(){\n var i = find(\"*/\", true),\n text = S.text.substring(S.pos, i),\n tok = token(\"comment2\", text, true);\n S.pos = i + 2;\n S.line += text.split(\"\\n\").length - 1;\n S.newline_before = text.indexOf(\"\\n\") >= 0;\n\n // https://github.com/mishoo/UglifyJS/issues/#issue/100\n if (/^@cc_on/i.test(text)) {\n warn(\"WARNING: at line \" + S.line);\n warn(\"*** Found \\\"conditional comment\\\": \" + text);\n warn(\"*** UglifyJS DISCARDS ALL COMMENTS. This means your code might no longer work properly in Internet Explorer.\");\n }\n\n return tok;\n });\n };\n\n function read_name() {\n var backslash = false, name = \"\", ch;\n while ((ch = peek()) != null) {\n if (!backslash) {\n if (ch == \"\\\\\") backslash = true, next();\n else if (is_identifier_char(ch)) name += next();\n else break;\n }\n else {\n if (ch != \"u\") parse_error(\"Expecting UnicodeEscapeSequence -- uXXXX\");\n ch = read_escaped_char();\n if (!is_identifier_char(ch)) parse_error(\"Unicode char: \" + ch.charCodeAt(0) + \" is not valid in identifier\");\n name += ch;\n backslash = false;\n }\n }\n return name;\n };\n\n function read_regexp() {\n return with_eof_error(\"Unterminated regular expression\", function(){\n var prev_backslash = false, regexp = \"\", ch, in_class = false;\n while ((ch = next(true))) if (prev_backslash) {\n regexp += \"\\\\\" + ch;\n prev_backslash = false;\n } else if (ch == \"[\") {\n in_class = true;\n regexp += ch;\n } else if (ch == \"]\" && in_class) {\n in_class = false;\n regexp += ch;\n } else if (ch == \"/\" && !in_class) {\n break;\n } else if (ch == \"\\\\\") {\n prev_backslash = true;\n } else {\n regexp += ch;\n }\n var mods = read_name();\n return token(\"regexp\", [ regexp, mods ]);\n });\n };\n\n function read_operator(prefix) {\n function grow(op) {\n if (!peek()) return op;\n var bigger = op + peek();\n if (HOP(OPERATORS, bigger)) {\n next();\n return grow(bigger);\n } else {\n return op;\n }\n };\n return token(\"operator\", grow(prefix || next()));\n };\n\n function handle_slash() {\n next();\n var regex_allowed = S.regex_allowed;\n switch (peek()) {\n case \"/\":\n S.comments_before.push(read_line_comment());\n S.regex_allowed = regex_allowed;\n return next_token();\n case \"*\":\n S.comments_before.push(read_multiline_comment());\n S.regex_allowed = regex_allowed;\n return next_token();\n }\n return S.regex_allowed ? read_regexp() : read_operator(\"/\");\n };\n\n function handle_dot() {\n next();\n return is_digit(peek())\n ? read_num(\".\")\n : token(\"punc\", \".\");\n };\n\n function read_word() {\n var word = read_name();\n return !HOP(KEYWORDS, word)\n ? token(\"name\", word)\n : HOP(OPERATORS, word)\n ? token(\"operator\", word)\n : HOP(KEYWORDS_ATOM, word)\n ? token(\"atom\", word)\n : token(\"keyword\", word);\n };\n\n function with_eof_error(eof_error, cont) {\n try {\n return cont();\n } catch(ex) {\n if (ex === EX_EOF) parse_error(eof_error);\n else throw ex;\n }\n };\n\n function next_token(force_regexp) {\n if (force_regexp)\n return read_regexp();\n skip_whitespace();\n start_token();\n var ch = peek();\n if (!ch) return token(\"eof\");\n if (is_digit(ch)) return read_num();\n if (ch == '\"' || ch == \"'\") return read_string();\n if (HOP(PUNC_CHARS, ch)) return token(\"punc\", next());\n if (ch == \".\") return handle_dot();\n if (ch == \"/\") return handle_slash();\n if (HOP(OPERATOR_CHARS, ch)) return read_operator();\n if (ch == \"\\\\\" || is_identifier_start(ch)) return read_word();\n parse_error(\"Unexpected character '\" + ch + \"'\");\n };\n\n next_token.context = function(nc) {\n if (nc) S = nc;\n return S;\n };\n\n return next_token;\n\n};\n\n/* -----[ Parser (constants) ]----- */\n\nvar UNARY_PREFIX = array_to_hash([\n \"typeof\",\n \"void\",\n \"delete\",\n \"--\",\n \"++\",\n \"!\",\n \"~\",\n \"-\",\n \"+\"\n]);\n\nvar UNARY_POSTFIX = array_to_hash([ \"--\", \"++\" ]);\n\nvar ASSIGNMENT = (function(a, ret, i){\n while (i < a.length) {\n ret[a[i]] = a[i].substr(0, a[i].length - 1);\n i++;\n }\n return ret;\n})(\n [\"+=\", \"-=\", \"/=\", \"*=\", \"%=\", \">>=\", \"<<=\", \">>>=\", \"|=\", \"^=\", \"&=\"],\n { \"=\": true },\n 0\n);\n\nvar PRECEDENCE = (function(a, ret){\n for (var i = 0, n = 1; i < a.length; ++i, ++n) {\n var b = a[i];\n for (var j = 0; j < b.length; ++j) {\n ret[b[j]] = n;\n }\n }\n return ret;\n})(\n [\n [\"||\"],\n [\"&&\"],\n [\"|\"],\n [\"^\"],\n [\"&\"],\n [\"==\", \"===\", \"!=\", \"!==\"],\n [\"<\", \">\", \"<=\", \">=\", \"in\", \"instanceof\"],\n [\">>\", \"<<\", \">>>\"],\n [\"+\", \"-\"],\n [\"*\", \"/\", \"%\"]\n ],\n {}\n);\n\nvar STATEMENTS_WITH_LABELS = array_to_hash([ \"for\", \"do\", \"while\", \"switch\" ]);\n\nvar ATOMIC_START_TOKEN = array_to_hash([ \"atom\", \"num\", \"string\", \"regexp\", \"name\" ]);\n\n/* -----[ Parser ]----- */\n\nfunction NodeWithToken(str, start, end) {\n this.name = str;\n this.start = start;\n this.end = end;\n};\n\nNodeWithToken.prototype.toString = function() { return this.name; };\n\nfunction parse($TEXT, exigent_mode, embed_tokens) {\n\n var S = {\n input : typeof $TEXT == \"string\" ? tokenizer($TEXT, true) : $TEXT,\n token : null,\n prev : null,\n peeked : null,\n in_function : 0,\n in_loop : 0,\n labels : []\n };\n\n S.token = next();\n\n function is(type, value) {\n return is_token(S.token, type, value);\n };\n\n function peek() { return S.peeked || (S.peeked = S.input()); };\n\n function next() {\n S.prev = S.token;\n if (S.peeked) {\n S.token = S.peeked;\n S.peeked = null;\n } else {\n S.token = S.input();\n }\n return S.token;\n };\n\n function prev() {\n return S.prev;\n };\n\n function croak(msg, line, col, pos) {\n var ctx = S.input.context();\n js_error(msg,\n line != null ? line : ctx.tokline,\n col != null ? col : ctx.tokcol,\n pos != null ? pos : ctx.tokpos);\n };\n\n function token_error(token, msg) {\n croak(msg, token.line, token.col);\n };\n\n function unexpected(token) {\n if (token == null)\n token = S.token;\n token_error(token, \"Unexpected token: \" + token.type + \" (\" + token.value + \")\");\n };\n\n function expect_token(type, val) {\n if (is(type, val)) {\n return next();\n }\n token_error(S.token, \"Unexpected token \" + S.token.type + \", expected \" + type);\n };\n\n function expect(punc) { return expect_token(\"punc\", punc); };\n\n function can_insert_semicolon() {\n return !exigent_mode && (\n S.token.nlb || is(\"eof\") || is(\"punc\", \"}\")\n );\n };\n\n function semicolon() {\n if (is(\"punc\", \";\")) next();\n else if (!can_insert_semicolon()) unexpected();\n };\n\n function as() {\n return slice(arguments);\n };\n\n function parenthesised() {\n expect(\"(\");\n var ex = expression();\n expect(\")\");\n return ex;\n };\n\n function add_tokens(str, start, end) {\n return str instanceof NodeWithToken ? str : new NodeWithToken(str, start, end);\n };\n\n function maybe_embed_tokens(parser) {\n if (embed_tokens) return function() {\n var start = S.token;\n var ast = parser.apply(this, arguments);\n ast[0] = add_tokens(ast[0], start, prev());\n return ast;\n };\n else return parser;\n };\n\n var statement = maybe_embed_tokens(function() {\n if (is(\"operator\", \"/\")) {\n S.peeked = null;\n S.token = S.input(true); // force regexp\n }\n switch (S.token.type) {\n case \"num\":\n case \"string\":\n case \"regexp\":\n case \"operator\":\n case \"atom\":\n return simple_statement();\n\n case \"name\":\n return is_token(peek(), \"punc\", \":\")\n ? labeled_statement(prog1(S.token.value, next, next))\n : simple_statement();\n\n case \"punc\":\n switch (S.token.value) {\n case \"{\":\n return as(\"block\", block_());\n case \"[\":\n case \"(\":\n return simple_statement();\n case \";\":\n next();\n return as(\"block\");\n default:\n unexpected();\n }\n\n case \"keyword\":\n switch (prog1(S.token.value, next)) {\n case \"break\":\n return break_cont(\"break\");\n\n case \"continue\":\n return break_cont(\"continue\");\n\n case \"debugger\":\n semicolon();\n return as(\"debugger\");\n\n case \"do\":\n return (function(body){\n expect_token(\"keyword\", \"while\");\n return as(\"do\", prog1(parenthesised, semicolon), body);\n })(in_loop(statement));\n\n case \"for\":\n return for_();\n\n case \"function\":\n return function_(true);\n\n case \"if\":\n return if_();\n\n case \"return\":\n if (S.in_function == 0)\n croak(\"'return' outside of function\");\n return as(\"return\",\n is(\"punc\", \";\")\n ? (next(), null)\n : can_insert_semicolon()\n ? null\n : prog1(expression, semicolon));\n\n case \"switch\":\n return as(\"switch\", parenthesised(), switch_block_());\n\n case \"throw\":\n return as(\"throw\", prog1(expression, semicolon));\n\n case \"try\":\n return try_();\n\n case \"var\":\n return prog1(var_, semicolon);\n\n case \"const\":\n return prog1(const_, semicolon);\n\n case \"while\":\n return as(\"while\", parenthesised(), in_loop(statement));\n\n case \"with\":\n return as(\"with\", parenthesised(), statement());\n\n default:\n unexpected();\n }\n }\n });\n\n function labeled_statement(label) {\n S.labels.push(label);\n var start = S.token, stat = statement();\n if (exigent_mode && !HOP(STATEMENTS_WITH_LABELS, stat[0]))\n unexpected(start);\n S.labels.pop();\n return as(\"label\", label, stat);\n };\n\n function simple_statement() {\n return as(\"stat\", prog1(expression, semicolon));\n };\n\n function break_cont(type) {\n var name;\n if (!can_insert_semicolon()) {\n name = is(\"name\") ? S.token.value : null;\n }\n if (name != null) {\n next();\n if (!member(name, S.labels))\n croak(\"Label \" + name + \" without matching loop or statement\");\n }\n else if (S.in_loop == 0)\n croak(type + \" not inside a loop or switch\");\n semicolon();\n return as(type, name);\n };\n\n function for_() {\n expect(\"(\");\n var init = null;\n if (!is(\"punc\", \";\")) {\n init = is(\"keyword\", \"var\")\n ? (next(), var_(true))\n : expression(true, true);\n if (is(\"operator\", \"in\"))\n return for_in(init);\n }\n return regular_for(init);\n };\n\n function regular_for(init) {\n expect(\";\");\n var test = is(\"punc\", \";\") ? null : expression();\n expect(\";\");\n var step = is(\"punc\", \")\") ? null : expression();\n expect(\")\");\n return as(\"for\", init, test, step, in_loop(statement));\n };\n\n function for_in(init) {\n var lhs = init[0] == \"var\" ? as(\"name\", init[1][0]) : init;\n next();\n var obj = expression();\n expect(\")\");\n return as(\"for-in\", init, lhs, obj, in_loop(statement));\n };\n\n var function_ = maybe_embed_tokens(function(in_statement) {\n var name = is(\"name\") ? prog1(S.token.value, next) : null;\n if (in_statement && !name)\n unexpected();\n expect(\"(\");\n return as(in_statement ? \"defun\" : \"function\",\n name,\n // arguments\n (function(first, a){\n while (!is(\"punc\", \")\")) {\n if (first) first = false; else expect(\",\");\n if (!is(\"name\")) unexpected();\n a.push(S.token.value);\n next();\n }\n next();\n return a;\n })(true, []),\n // body\n (function(){\n ++S.in_function;\n var loop = S.in_loop;\n S.in_loop = 0;\n var a = block_();\n --S.in_function;\n S.in_loop = loop;\n return a;\n })());\n });\n\n function if_() {\n var cond = parenthesised(), body = statement(), belse;\n if (is(\"keyword\", \"else\")) {\n next();\n belse = statement();\n }\n return as(\"if\", cond, body, belse);\n };\n\n function block_() {\n expect(\"{\");\n var a = [];\n while (!is(\"punc\", \"}\")) {\n if (is(\"eof\")) unexpected();\n a.push(statement());\n }\n next();\n return a;\n };\n\n var switch_block_ = curry(in_loop, function(){\n expect(\"{\");\n var a = [], cur = null;\n while (!is(\"punc\", \"}\")) {\n if (is(\"eof\")) unexpected();\n if (is(\"keyword\", \"case\")) {\n next();\n cur = [];\n a.push([ expression(), cur ]);\n expect(\":\");\n }\n else if (is(\"keyword\", \"default\")) {\n next();\n expect(\":\");\n cur = [];\n a.push([ null, cur ]);\n }\n else {\n if (!cur) unexpected();\n cur.push(statement());\n }\n }\n next();\n return a;\n });\n\n function try_() {\n var body = block_(), bcatch, bfinally;\n if (is(\"keyword\", \"catch\")) {\n next();\n expect(\"(\");\n if (!is(\"name\"))\n croak(\"Name expected\");\n var name = S.token.value;\n next();\n expect(\")\");\n bcatch = [ name, block_() ];\n }\n if (is(\"keyword\", \"finally\")) {\n next();\n bfinally = block_();\n }\n if (!bcatch && !bfinally)\n croak(\"Missing catch/finally blocks\");\n return as(\"try\", body, bcatch, bfinally);\n };\n\n function vardefs(no_in) {\n var a = [];\n for (;;) {\n if (!is(\"name\"))\n unexpected();\n var name = S.token.value;\n next();\n if (is(\"operator\", \"=\")) {\n next();\n a.push([ name, expression(false, no_in) ]);\n } else {\n a.push([ name ]);\n }\n if (!is(\"punc\", \",\"))\n break;\n next();\n }\n return a;\n };\n\n function var_(no_in) {\n return as(\"var\", vardefs(no_in));\n };\n\n function const_() {\n return as(\"const\", vardefs());\n };\n\n function new_() {\n var newexp = expr_atom(false), args;\n if (is(\"punc\", \"(\")) {\n next();\n args = expr_list(\")\");\n } else {\n args = [];\n }\n return subscripts(as(\"new\", newexp, args), true);\n };\n\n var expr_atom = maybe_embed_tokens(function(allow_calls) {\n if (is(\"operator\", \"new\")) {\n next();\n return new_();\n }\n if (is(\"operator\") && HOP(UNARY_PREFIX, S.token.value)) {\n return make_unary(\"unary-prefix\",\n prog1(S.token.value, next),\n expr_atom(allow_calls));\n }\n if (is(\"punc\")) {\n switch (S.token.value) {\n case \"(\":\n next();\n return subscripts(prog1(expression, curry(expect, \")\")), allow_calls);\n case \"[\":\n next();\n return subscripts(array_(), allow_calls);\n case \"{\":\n next();\n return subscripts(object_(), allow_calls);\n }\n unexpected();\n }\n if (is(\"keyword\", \"function\")) {\n next();\n return subscripts(function_(false), allow_calls);\n }\n if (HOP(ATOMIC_START_TOKEN, S.token.type)) {\n var atom = S.token.type == \"regexp\"\n ? as(\"regexp\", S.token.value[0], S.token.value[1])\n : as(S.token.type, S.token.value);\n return subscripts(prog1(atom, next), allow_calls);\n }\n unexpected();\n });\n\n function expr_list(closing, allow_trailing_comma, allow_empty) {\n var first = true, a = [];\n while (!is(\"punc\", closing)) {\n if (first) first = false; else expect(\",\");\n if (allow_trailing_comma && is(\"punc\", closing)) break;\n if (is(\"punc\", \",\") && allow_empty) {\n a.push([ \"atom\", \"undefined\" ]);\n } else {\n a.push(expression(false));\n }\n }\n next();\n return a;\n };\n\n function array_() {\n return as(\"array\", expr_list(\"]\", !exigent_mode, true));\n };\n\n function object_() {\n var first = true, a = [];\n while (!is(\"punc\", \"}\")) {\n if (first) first = false; else expect(\",\");\n if (!exigent_mode && is(\"punc\", \"}\"))\n // allow trailing comma\n break;\n var type = S.token.type;\n var name = as_property_name();\n if (type == \"name\" && (name == \"get\" || name == \"set\") && !is(\"punc\", \":\")) {\n a.push([ as_name(), function_(false), name ]);\n } else {\n expect(\":\");\n a.push([ name, expression(false) ]);\n }\n }\n next();\n return as(\"object\", a);\n };\n\n function as_property_name() {\n switch (S.token.type) {\n case \"num\":\n case \"string\":\n return prog1(S.token.value, next);\n }\n return as_name();\n };\n\n function as_name() {\n switch (S.token.type) {\n case \"name\":\n case \"operator\":\n case \"keyword\":\n case \"atom\":\n return prog1(S.token.value, next);\n default:\n unexpected();\n }\n };\n\n function subscripts(expr, allow_calls) {\n if (is(\"punc\", \".\")) {\n next();\n return subscripts(as(\"dot\", expr, as_name()), allow_calls);\n }\n if (is(\"punc\", \"[\")) {\n next();\n return subscripts(as(\"sub\", expr, prog1(expression, curry(expect, \"]\"))), allow_calls);\n }\n if (allow_calls && is(\"punc\", \"(\")) {\n next();\n return subscripts(as(\"call\", expr, expr_list(\")\")), true);\n }\n if (allow_calls && is(\"operator\") && HOP(UNARY_POSTFIX, S.token.value)) {\n return prog1(curry(make_unary, \"unary-postfix\", S.token.value, expr),\n next);\n }\n return expr;\n };\n\n function make_unary(tag, op, expr) {\n if ((op == \"++\" || op == \"--\") && !is_assignable(expr))\n croak(\"Invalid use of \" + op + \" operator\");\n return as(tag, op, expr);\n };\n\n function expr_op(left, min_prec, no_in) {\n var op = is(\"operator\") ? S.token.value : null;\n if (op && op == \"in\" && no_in) op = null;\n var prec = op != null ? PRECEDENCE[op] : null;\n if (prec != null && prec > min_prec) {\n next();\n var right = expr_op(expr_atom(true), prec, no_in);\n return expr_op(as(\"binary\", op, left, right), min_prec, no_in);\n }\n return left;\n };\n\n function expr_ops(no_in) {\n return expr_op(expr_atom(true), 0, no_in);\n };\n\n function maybe_conditional(no_in) {\n var expr = expr_ops(no_in);\n if (is(\"operator\", \"?\")) {\n next();\n var yes = expression(false);\n expect(\":\");\n return as(\"conditional\", expr, yes, expression(false, no_in));\n }\n return expr;\n };\n\n function is_assignable(expr) {\n if (!exigent_mode) return true;\n switch (expr[0]) {\n case \"dot\":\n case \"sub\":\n case \"new\":\n case \"call\":\n return true;\n case \"name\":\n return expr[1] != \"this\";\n }\n };\n\n function maybe_assign(no_in) {\n var left = maybe_conditional(no_in), val = S.token.value;\n if (is(\"operator\") && HOP(ASSIGNMENT, val)) {\n if (is_assignable(left)) {\n next();\n return as(\"assign\", ASSIGNMENT[val], left, maybe_assign(no_in));\n }\n croak(\"Invalid assignment\");\n }\n return left;\n };\n\n var expression = maybe_embed_tokens(function(commas, no_in) {\n if (arguments.length == 0)\n commas = true;\n var expr = maybe_assign(no_in);\n if (commas && is(\"punc\", \",\")) {\n next();\n return as(\"seq\", expr, expression(true, no_in));\n }\n return expr;\n });\n\n function in_loop(cont) {\n try {\n ++S.in_loop;\n return cont();\n } finally {\n --S.in_loop;\n }\n };\n\n return as(\"toplevel\", (function(a){\n while (!is(\"eof\"))\n a.push(statement());\n return a;\n })([]));\n\n};\n\n/* -----[ Utilities ]----- */\n\nfunction curry(f) {\n var args = slice(arguments, 1);\n return function() { return f.apply(this, args.concat(slice(arguments))); };\n};\n\nfunction prog1(ret) {\n if (ret instanceof Function)\n ret = ret();\n for (var i = 1, n = arguments.length; --n > 0; ++i)\n arguments[i]();\n return ret;\n};\n\nfunction array_to_hash(a) {\n var ret = {};\n for (var i = 0; i < a.length; ++i)\n ret[a[i]] = true;\n return ret;\n};\n\nfunction slice(a, start) {\n return Array.prototype.slice.call(a, start == null ? 0 : start);\n};\n\nfunction characters(str) {\n return str.split(\"\");\n};\n\nfunction member(name, array) {\n for (var i = array.length; --i >= 0;)\n if (array[i] === name)\n return true;\n return false;\n};\n\nfunction HOP(obj, prop) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n};\n\nvar warn = function() {};\n\n/* -----[ Exports ]----- */\n\nexports.tokenizer = tokenizer;\nexports.parse = parse;\nexports.slice = slice;\nexports.curry = curry;\nexports.member = member;\nexports.array_to_hash = array_to_hash;\nexports.PRECEDENCE = PRECEDENCE;\nexports.KEYWORDS_ATOM = KEYWORDS_ATOM;\nexports.RESERVED_WORDS = RESERVED_WORDS;\nexports.KEYWORDS = KEYWORDS;\nexports.ATOMIC_START_TOKEN = ATOMIC_START_TOKEN;\nexports.OPERATORS = OPERATORS;\nexports.is_alphanumeric_char = is_alphanumeric_char;\nexports.set_logger = function(logger) {\n warn = logger;\n};\n" }, { "path": "src/test/resources/samples/langs/Jison/ansic.jison", "content": "%token IDENTIFIER CONSTANT STRING_LITERAL SIZEOF\n%token PTR_OP INC_OP DEC_OP LEFT_OP RIGHT_OP LE_OP GE_OP EQ_OP NE_OP\n%token AND_OP OR_OP MUL_ASSIGN DIV_ASSIGN MOD_ASSIGN ADD_ASSIGN\n%token SUB_ASSIGN LEFT_ASSIGN RIGHT_ASSIGN AND_ASSIGN\n%token XOR_ASSIGN OR_ASSIGN TYPE_NAME\n\n%token TYPEDEF EXTERN STATIC AUTO REGISTER\n%token CHAR SHORT INT LONG SIGNED UNSIGNED FLOAT DOUBLE CONST VOLATILE VOID\n%token STRUCT UNION ENUM ELLIPSIS\n\n%token CASE DEFAULT IF ELSE SWITCH WHILE DO FOR GOTO CONTINUE BREAK RETURN\n\n%nonassoc IF_WITHOUT_ELSE\n%nonassoc ELSE\n\n%start translation_unit\n%%\n\nprimary_expression\n : IDENTIFIER\n | CONSTANT\n | STRING_LITERAL\n | '(' expression ')'\n ;\n\npostfix_expression\n : primary_expression\n | postfix_expression '[' expression ']'\n | postfix_expression '(' ')'\n | postfix_expression '(' argument_expression_list ')'\n | postfix_expression '.' IDENTIFIER\n | postfix_expression PTR_OP IDENTIFIER\n | postfix_expression INC_OP\n | postfix_expression DEC_OP\n ;\n\nargument_expression_list\n : assignment_expression\n | argument_expression_list ',' assignment_expression\n ;\n\nunary_expression\n : postfix_expression\n | INC_OP unary_expression\n | DEC_OP unary_expression\n | unary_operator cast_expression\n | SIZEOF unary_expression\n | SIZEOF '(' type_name ')'\n ;\n\nunary_operator\n : '&'\n | '*'\n | '+'\n | '-'\n | '~'\n | '!'\n ;\n\ncast_expression\n : unary_expression\n | '(' type_name ')' cast_expression\n ;\n\nmultiplicative_expression\n : cast_expression\n | multiplicative_expression '*' cast_expression\n | multiplicative_expression '/' cast_expression\n | multiplicative_expression '%' cast_expression\n ;\n\nadditive_expression\n : multiplicative_expression\n | additive_expression '+' multiplicative_expression\n | additive_expression '-' multiplicative_expression\n ;\n\nshift_expression\n : additive_expression\n | shift_expression LEFT_OP additive_expression\n | shift_expression RIGHT_OP additive_expression\n ;\n\nrelational_expression\n : shift_expression\n | relational_expression '<' shift_expression\n | relational_expression '>' shift_expression\n | relational_expression LE_OP shift_expression\n | relational_expression GE_OP shift_expression\n ;\n\nequality_expression\n : relational_expression\n | equality_expression EQ_OP relational_expression\n | equality_expression NE_OP relational_expression\n ;\n\nand_expression\n : equality_expression\n | and_expression '&' equality_expression\n ;\n\nexclusive_or_expression\n : and_expression\n | exclusive_or_expression '^' and_expression\n ;\n\ninclusive_or_expression\n : exclusive_or_expression\n | inclusive_or_expression '|' exclusive_or_expression\n ;\n\nlogical_and_expression\n : inclusive_or_expression\n | logical_and_expression AND_OP inclusive_or_expression\n ;\n\nlogical_or_expression\n : logical_and_expression\n | logical_or_expression OR_OP logical_and_expression\n ;\n\nconditional_expression\n : logical_or_expression\n | logical_or_expression '?' expression ':' conditional_expression\n ;\n\nassignment_expression\n : conditional_expression\n | unary_expression assignment_operator assignment_expression\n ;\n\nassignment_operator\n : '='\n | MUL_ASSIGN\n | DIV_ASSIGN\n | MOD_ASSIGN\n | ADD_ASSIGN\n | SUB_ASSIGN\n | LEFT_ASSIGN\n | RIGHT_ASSIGN\n | AND_ASSIGN\n | XOR_ASSIGN\n | OR_ASSIGN\n ;\n\nexpression\n : assignment_expression\n | expression ',' assignment_expression\n ;\n\nconstant_expression\n : conditional_expression\n ;\n\ndeclaration\n : declaration_specifiers ';'\n | declaration_specifiers init_declarator_list ';'\n ;\n\ndeclaration_specifiers\n : storage_class_specifier\n | storage_class_specifier declaration_specifiers\n | type_specifier\n | type_specifier declaration_specifiers\n | type_qualifier\n | type_qualifier declaration_specifiers\n ;\n\ninit_declarator_list\n : init_declarator\n | init_declarator_list ',' init_declarator\n ;\n\ninit_declarator\n : declarator\n | declarator '=' initializer\n ;\n\nstorage_class_specifier\n : TYPEDEF\n | EXTERN\n | STATIC\n | AUTO\n | REGISTER\n ;\n\ntype_specifier\n : VOID\n | CHAR\n | SHORT\n | INT\n | LONG\n | FLOAT\n | DOUBLE\n | SIGNED\n | UNSIGNED\n | struct_or_union_specifier\n | enum_specifier\n | TYPE_NAME\n ;\n\nstruct_or_union_specifier\n : struct_or_union IDENTIFIER '{' struct_declaration_list '}'\n | struct_or_union '{' struct_declaration_list '}'\n | struct_or_union IDENTIFIER\n ;\n\nstruct_or_union\n : STRUCT\n | UNION\n ;\n\nstruct_declaration_list\n : struct_declaration\n | struct_declaration_list struct_declaration\n ;\n\nstruct_declaration\n : specifier_qualifier_list struct_declarator_list ';'\n ;\n\nspecifier_qualifier_list\n : type_specifier specifier_qualifier_list\n | type_specifier\n | type_qualifier specifier_qualifier_list\n | type_qualifier\n ;\n\nstruct_declarator_list\n : struct_declarator\n | struct_declarator_list ',' struct_declarator\n ;\n\nstruct_declarator\n : declarator\n | ':' constant_expression\n | declarator ':' constant_expression\n ;\n\nenum_specifier\n : ENUM '{' enumerator_list '}'\n | ENUM IDENTIFIER '{' enumerator_list '}'\n | ENUM IDENTIFIER\n ;\n\nenumerator_list\n : enumerator\n | enumerator_list ',' enumerator\n ;\n\nenumerator\n : IDENTIFIER\n | IDENTIFIER '=' constant_expression\n ;\n\ntype_qualifier\n : CONST\n | VOLATILE\n ;\n\ndeclarator\n : pointer direct_declarator\n | direct_declarator\n ;\n\ndirect_declarator\n : IDENTIFIER\n | '(' declarator ')'\n | direct_declarator '[' constant_expression ']'\n | direct_declarator '[' ']'\n | direct_declarator '(' parameter_type_list ')'\n | direct_declarator '(' identifier_list ')'\n | direct_declarator '(' ')'\n ;\n\npointer\n : '*'\n | '*' type_qualifier_list\n | '*' pointer\n | '*' type_qualifier_list pointer\n ;\n\ntype_qualifier_list\n : type_qualifier\n | type_qualifier_list type_qualifier\n ;\n\n\nparameter_type_list\n : parameter_list\n | parameter_list ',' ELLIPSIS\n ;\n\nparameter_list\n : parameter_declaration\n | parameter_list ',' parameter_declaration\n ;\n\nparameter_declaration\n : declaration_specifiers declarator\n | declaration_specifiers abstract_declarator\n | declaration_specifiers\n ;\n\nidentifier_list\n : IDENTIFIER\n | identifier_list ',' IDENTIFIER\n ;\n\ntype_name\n : specifier_qualifier_list\n | specifier_qualifier_list abstract_declarator\n ;\n\nabstract_declarator\n : pointer\n | direct_abstract_declarator\n | pointer direct_abstract_declarator\n ;\n\ndirect_abstract_declarator\n : '(' abstract_declarator ')'\n | '[' ']'\n | '[' constant_expression ']'\n | direct_abstract_declarator '[' ']'\n | direct_abstract_declarator '[' constant_expression ']'\n | '(' ')'\n | '(' parameter_type_list ')'\n | direct_abstract_declarator '(' ')'\n | direct_abstract_declarator '(' parameter_type_list ')'\n ;\n\ninitializer\n : assignment_expression\n | '{' initializer_list '}'\n | '{' initializer_list ',' '}'\n ;\n\ninitializer_list\n : initializer\n | initializer_list ',' initializer\n ;\n\nstatement\n : labeled_statement\n | compound_statement\n | expression_statement\n | selection_statement\n | iteration_statement\n | jump_statement\n ;\n\nlabeled_statement\n : IDENTIFIER ':' statement\n | CASE constant_expression ':' statement\n | DEFAULT ':' statement\n ;\n\ncompound_statement\n : '{' '}'\n | '{' statement_list '}'\n | '{' declaration_list '}'\n | '{' declaration_list statement_list '}'\n ;\n\ndeclaration_list\n : declaration\n | declaration_list declaration\n ;\n\nstatement_list\n : statement\n | statement_list statement\n ;\n\nexpression_statement\n : ';'\n | expression ';'\n ;\n\nselection_statement\n : IF '(' expression ')' statement %prec IF_WITHOUT_ELSE\n | IF '(' expression ')' statement ELSE statement\n | SWITCH '(' expression ')' statement\n ;\n\niteration_statement\n : WHILE '(' expression ')' statement\n | DO statement WHILE '(' expression ')' ';'\n | FOR '(' expression_statement expression_statement ')' statement\n | FOR '(' expression_statement expression_statement expression ')' statement\n ;\n\njump_statement\n : GOTO IDENTIFIER ';'\n | CONTINUE ';'\n | BREAK ';'\n | RETURN ';'\n | RETURN expression ';'\n ;\n\ntranslation_unit\n : external_declaration\n | translation_unit external_declaration\n ;\n\nexternal_declaration\n : function_definition\n | declaration\n ;\n\nfunction_definition\n : declaration_specifiers declarator declaration_list compound_statement\n | declaration_specifiers declarator compound_statement\n | declarator declaration_list compound_statement\n | declarator compound_statement\n ;\n" }, { "path": "src/test/resources/samples/langs/Jison/classy.jison", "content": "\n/* description: ClassyLang grammar. Very classy. */\n/*\n To build parser:\n\n $ ./bin/jison examples/classy.jison examples/classy.jisonlex\n\n*/\n\n\n/* author: Zach Carter */\n\n%right ASSIGN\n%left OR\n%nonassoc EQUALITY GREATER\n%left PLUS MINUS\n%left TIMES\n%right NOT\n%left DOT\n\n%%\n\npgm\n : cdl MAIN LBRACE vdl el RBRACE ENDOFFILE\n ;\n\ncdl\n : c cdl\n |\n ;\n\nc\n : CLASS id EXTENDS id LBRACE vdl mdl RBRACE\n ;\n\nvdl\n : VAR t id SEMICOLON vdl\n |\n ;\n\nmdl\n : t id LPAREN t id RPAREN LBRACE vdl el RBRACE mdl\n |\n ;\n\nt\n : NATTYPE\n | id\n ;\n\nid\n : ID\n ;\n\nel\n : e SEMICOLON el\n | e SEMICOLON\n ;\n\ne\n : NATLITERAL\n | NUL\n | id\n | NEW id\n | THIS\n | IF LPAREN e RPAREN LBRACE el RBRACE ELSE LBRACE el RBRACE\n | FOR LPAREN e SEMICOLON e SEMICOLON e RPAREN LBRACE el RBRACE\n | READNAT LPAREN RPAREN\n | PRINTNAT LPAREN e RPAREN\n | e PLUS e\n | e MINUS e\n | e TIMES e\n | e EQUALITY e\n | e GREATER e\n | NOT e\n | e OR e\n | e DOT id\n | id ASSIGN e\n | e DOT id ASSIGN e\n | id LPAREN e RPAREN\n | e DOT id LPAREN e RPAREN\n | LPAREN e RPAREN\n ;\n\n" }, { "path": "src/test/resources/samples/langs/Jison/lex.jison", "content": "\n// `%nonassoc` tells the parser compiler (JISON) that these tokens cannot occur more than once,\n// i.e. input like '//a' (tokens '/', '/' and 'a') is not a legal input while '/a' (tokens '/' and 'a')\n// *is* legal input for this grammar.\n \n%nonassoc '/' '/!'\n\n// Likewise for `%left`: this informs the LALR(1) grammar compiler (JISON) that these tokens\n// *can* occur repeatedly, e.g. 'a?*' and even 'a**' are considered legal inputs given this\n// grammar!\n//\n// Token `RANGE_REGEX` may seem the odd one out here but really isn't: given the `regex_base`\n// choice/rule `regex_base range_regex`, which is recursive, this grammar tells JISON that \n// any input matching a sequence like `regex_base range_regex range_regex` *is* legal.\n// If you do not want that to be legal, you MUST adjust the grammar rule set you match your\n// actual intent.\n\n%left '*' '+' '?' RANGE_REGEX\n\n\n%% \n\nlex \n : definitions include '%%' rules '%%' EOF\n {{ $$ = {macros: $1, rules: $4};\n if ($2) $$.actionInclude = $2;\n return $$; }}\n | definitions include '%%' rules EOF\n {{ $$ = {macros: $1, rules: $4};\n if ($2) $$.actionInclude = $2;\n return $$; }}\n ;\n\ninclude\n : action\n |\n ;\n\ndefinitions\n : definitions definition\n { $$ = $1; $$.concat($2); }\n | definition\n { $$ = [$1]; }\n ;\n\ndefinition\n : name regex\n { $$ = [$1, $2]; }\n ;\n\nname\n : NAME\n { $$ = yytext; }\n ;\n\nrules\n : rules rule\n { $$ = $1; $$.push($2); }\n | rule\n { $$ = [$1]; }\n ;\n\nrule\n : regex action\n { $$ = [$1, $2]; }\n ;\n\naction\n : ACTION \n { $$ = yytext; }\n ;\n\nregex\n : start_caret regex_list end_dollar\n { $$ = $1+$2+$3; }\n ;\n\nstart_caret\n : '^'\n { $$ = '^'; }\n |\n { $$ = ''; }\n ;\n\nend_dollar\n : '$'\n { $$ = '$'; }\n |\n { $$ = ''; }\n ;\n\nregex_list\n : regex_list '|' regex_chain\n { $$ = $1+'|'+$3; }\n | regex_chain\n ;\n\nregex_chain\n : regex_chain regex_base\n { $$ = $1+$2;}\n | regex_base\n { $$ = $1;}\n ;\n\nregex_base\n : '(' regex_list ')'\n { $$ = '('+$2+')'; }\n | regex_base '+'\n { $$ = $1+'+'; }\n | regex_base '*'\n { $$ = $1+'*'; }\n | regex_base '?'\n { $$ = $1+'?'; }\n | '/' regex_base\n { $$ = '(?=' + $regex_base + ')'; }\n | '/!' regex_base\n { $$ = '(?!' + $regex_base + ')'; }\n | name_expansion\n | regex_base range_regex\n { $$ = $1+$2; }\n | any_group_regex\n | '.'\n { $$ = '.'; }\n | string\n ;\n\nname_expansion\n : '{' name '}'\n {{ $$ = '{'+$2+'}'; }}\n ;\n\nany_group_regex\n : ANY_GROUP_REGEX\n { $$ = yytext; }\n ;\n\nrange_regex\n : RANGE_REGEX\n { $$ = yytext; }\n ;\n\nstring\n : STRING_LIT\n { $$ = yy.prepareString(yytext.substr(1, yyleng-2)); }\n ;\n" }, { "path": "src/test/resources/samples/langs/Jison Lex/classy.jisonlex", "content": "digit [0-9]\nid [a-zA-Z][a-zA-Z0-9]*\n\n%%\n\"//\".* /* ignore comment */\n\"main\" return 'MAIN';\n\"class\" return 'CLASS';\n\"extends\" return 'EXTENDS';\n\"nat\" return 'NATTYPE';\n\"if\" return 'IF';\n\"else\" return 'ELSE';\n\"for\" return 'FOR';\n\"printNat\" return 'PRINTNAT';\n\"readNat\" return 'READNAT';\n\"this\" return 'THIS';\n\"new\" return 'NEW';\n\"var\" return 'VAR';\n\"null\" return 'NUL';\n{digit}+ return 'NATLITERAL';\n{id} return 'ID';\n\"==\" return 'EQUALITY';\n\"=\" return 'ASSIGN';\n\"+\" return 'PLUS';\n\"-\" return 'MINUS';\n\"*\" return 'TIMES';\n\">\" return 'GREATER';\n\"||\" return 'OR';\n\"!\" return 'NOT';\n\".\" return 'DOT';\n\"{\" return 'LBRACE';\n\"}\" return 'RBRACE';\n\"(\" return 'LPAREN';\n\")\" return 'RPAREN';\n\";\" return 'SEMICOLON';\n\\s+ /* skip whitespace */\n\".\" throw 'Illegal character';\n<> return 'ENDOFFILE';\n\n\n" }, { "path": "src/test/resources/samples/langs/Jison Lex/lex_grammar.jisonlex", "content": "\n%%\n\\n+ {yy.freshLine = true;}\n\\s+ {yy.freshLine = false;}\n\"y{\"[^}]*\"}\" {yytext = yytext.substr(2, yyleng - 3); return 'ACTION';}\n[a-zA-Z_][a-zA-Z0-9_-]* {return 'NAME';}\n'\"'([^\"]|'\\\"')*'\"' {return 'STRING_LIT';}\n\"'\"([^']|\"\\'\")*\"'\" {return 'STRING_LIT';}\n\"|\" {return '|';}\n\"[\"(\"\\]\"|[^\\]])*\"]\" {return 'ANY_GROUP_REGEX';}\n\"(\" {return '(';}\n\")\" {return ')';}\n\"+\" {return '+';}\n\"*\" {return '*';}\n\"?\" {return '?';}\n\"^\" {return '^';}\n\"/\" {return '/';}\n\"\\\\\"[a-zA-Z0] {return 'ESCAPE_CHAR';}\n\"$\" {return '$';}\n\"<>\" {return '$';}\n\".\" {return '.';}\n\"%%\" {return '%%';}\n\"{\"\\d+(\",\"\\s?\\d+|\",\")?\"}\" {return 'RANGE_REGEX';}\n/\"{\" %{if (yy.freshLine) { this.input('{'); return '{'; } else { this.unput('y'); }%}\n\"}\" %{return '}';%}\n\"%{\"(.|\\n)*?\"}%\" {yytext = yytext.substr(2, yyleng - 4); return 'ACTION';}\n. {/* ignore bad characters */}\n<> {return 'EOF';}\n\n" }, { "path": "src/test/resources/samples/langs/Jolie/common.iol", "content": "include \"types/Binding.iol\"\n\nconstants {\n\tLocation_Exam = \"socket://localhost:8000\"\n}\n\ntype StartExamRequest:void {\n\t.examName:string\n\t.studentName:string\n\t.student:Binding\n}\n\ntype MakeQuestionRequest:void {\n\t.question:string\n\t.examName:string\n\t.studentName:string\n}\n\ntype DecisionMessage:void {\n\t.studentName:string\n\t.examName:string\n}\n\ninterface ExamInterface {\nOneWay:\n\tstartExam(StartExamRequest),\n\tpass(DecisionMessage), fail(DecisionMessage)\nRequestResponse:\n\tmakeQuestion(MakeQuestionRequest)(int)\n}\n\ninterface StudentInterface {\nOneWay:\n\tsendMessage(string)\nRequestResponse:\n\tmakeQuestion(MakeQuestionRequest)(int)\n}" }, { "path": "src/test/resources/samples/langs/Jolie/exam.ol", "content": "include \"common.iol\"\n\ncset {\nstudentName:\n\tStartExamRequest.studentName\n\tDecisionMessage.studentName\n\tMakeQuestionRequest.studentName,\nexamName:\n\tStartExamRequest.examName\n\tDecisionMessage.examName\n\tMakeQuestionRequest.examName\n}\n\nexecution { concurrent }\n\noutputPort Student {\nInterfaces: StudentInterface\n}\n\ninputPort ExamInput {\nLocation: Location_Exam\nProtocol: sodep\nInterfaces: ExamInterface\n}\n\nmain\n{\n\tstartExam( examRequest );\n\tStudent << examRequest.student;\n\tmakeQuestion( question )( answer ) {\n\t\tmakeQuestion@Student( question )( answer )\n\t};\n\t[ pass( message ) ] {\n\t\tsendMessage@Student( \"You passed!\" )\n\t}\n\t[ fail( message ) ] {\n\t\tsendMessage@Student( \"You failed!\" )\n\t}\n}" }, { "path": "src/test/resources/samples/langs/Jolie/examiner.ol", "content": "include \"common.iol\"\ninclude \"ui/swing_ui.iol\"\ninclude \"console.iol\"\n\noutputPort Exam {\nLocation: Location_Exam\nProtocol: sodep\nInterfaces: ExamInterface\n}\n\nmain\n{\n\tquestion.studentName = \"John\";\n\tquestion.examName = \"SPLG\";\n\tquestion.question = \"Random question\";\n\tmakeQuestion@Exam( question )( answer );\n\tshowYesNoQuestionDialog@SwingUI( \"Do you want to accept answer \" + answer + \" ?\" )( decision );\n\n\tmessage.studentName = \"John\";\n\tmessage.examName = \"SPLG\";\n\tif ( decision == 0 ) {\n\t\tpass@Exam( message )\n\t} else {\n\t\tfail@Exam( message )\n\t}\n}\n" }, { "path": "src/test/resources/samples/langs/Jolie/hanoi.ol", "content": "// https://github.com/jolie/website/blob/master/docs/documentation/locations/code/local.ol\n\ninclude \"runtime.iol\"\ninclude \"string_utils.iol\"\n\ntype HanoiRequest: void{\n .src: string\n .aux: string\n .dst: string\n .n: int\n .sid?: string\n}\n\ntype HanoiReponse: void {\n .move?: string\n}\n\ninterface LocalOperations{\n RequestResponse:\n hanoiSolver( HanoiRequest )( HanoiReponse )\n}\n\ninterface ExternalOperations{\n RequestResponse:\n hanoi( HanoiRequest )( string )\n}\n\noutputPort Self{\n Interfaces: LocalOperations\n}\n\ninputPort Self {\n Location: \"local\"\n Interfaces: LocalOperations\n}\n\ninputPort PowerService {\n Location: \"socket://localhost:8000\"\n Protocol: http{\n .format = \"html\"\n }\n Interfaces: ExternalOperations\n}\n\nexecution { concurrent }\n\ninit\n{\n getLocalLocation@Runtime()( Self.location )\n}\n\nmain\n{\n [ hanoi( request )( response ){\n getRandomUUID@StringUtils()(request.sid);\n hanoiSolver@Self( request )( subRes );\n response = subRes.move\n }]{ nullProcess }\n\n [ hanoiSolver( request )( response ){\n if ( request.n > 0 ){\n subReq.n = request.n;\n subReq.n--;\n with( request ){\n subReq.aux = .dst;\n subReq.dst = .aux;\n subReq.src = .src;\n subReq.sid = .sid\n };\n hanoiSolver@Self( subReq )( response );\n response.move += \"
\" + \n ++global.counters.(request.sid) + \n \") Move from \" + request.src +\n \" to \" + request.dst + \";\";\n with ( request ){\n subReq.src = .aux;\n subReq.aux = .src;\n subReq.dst = .dst\n };\n hanoiSolver@Self( subReq )( subRes );\n response.move += subRes.move\n }\n }]{ nullProcess }\n}" }, { "path": "src/test/resources/samples/langs/Jolie/student.ol", "content": "include \"common.iol\"\ninclude \"ui/swing_ui.iol\"\ninclude \"console.iol\"\n\noutputPort Exam {\nLocation: Location_Exam\nProtocol: sodep\nInterfaces: ExamInterface\n}\n\ninputPort StudentInput {\nLocation: \"socket://localhost:8001/\"\nProtocol: sodep\nInterfaces: StudentInterface\n}\n\nmain\n{\n\trequest.studentName = \"John\";\n\trequest.examName = \"SPLG\";\n\trequest.student.location = \"socket://localhost:8001/\";\n\trequest.student.protocol = \"sodep\";\n\tstartExam@Exam( request );\n\tmakeQuestion( question )( answer ) {\n\t\tshowYesNoQuestionDialog@SwingUI( question.question )( answer )\n\t};\n\tsendMessage( message );\n\tprintln@Console( message )()\n}" }, { "path": "src/test/resources/samples/langs/Julia/julia", "content": "#!/usr/bin/env julia\n\n# From https://github.com/JoshCheek/language-sampler-for-fullpath/blob/b766dcdbd249ec63516f491390a75315e78cba95/julia/fullpath\nhelp_screen = \"\"\"\nusage: fullpath *[relative-paths] [-c]\n\n Prints the fullpath of the paths\n If no paths are given as args, it will read them from stdin\n\n If there is only one path, the trailing newline is omitted\n\n The -c flag will copy the results into your pasteboard\n\"\"\"\n\nhelp = false\ncopy = false\ndir = pwd()\npaths = []\n\nfor arg = ARGS\n if arg == \"-h\" || arg == \"--help\"\n help = true\n elseif arg == \"-c\" || arg == \"--copy\"\n copy = true\n elseif arg != \"\"\n push!(paths, arg)\n end\nend\n\nif help\n print(help_screen)\n exit()\nend\n\nfunction notempty(string)\n return !isempty(string)\nend\n\nif length(paths) == 0\n paths = filter(notempty, map(chomp, readlines()))\nend\n\nfunction print_paths(stream, paths)\n if length(paths) == 1\n path = paths[1]\n print(stream, \"$dir/$path\")\n else\n for path = paths\n println(stream, \"$dir/$path\")\n end\n end\nend\n\nif copy\n read, write, process = readandwrite(`pbcopy`)\n print_paths(write, paths)\n close(write)\nend\n\nprint_paths(STDOUT, paths)\n" }, { "path": "src/test/resources/samples/langs/Julia/stockcorr.jl", "content": "## Test case from Issue #445\n\n#STOCKCORR - The original, unoptimised code that simulates two correlated assets\nfunction stockcorr()\n\n ## Correlated asset information\n CurrentPrice = [78. 102.] # Initial Prices of the two stocks\n Corr = [1. 0.4; 0.4 1.] # Correlation Matrix\n T = 500 # Number of days to simulate = 2years = 500days\n n = 100000 # Number of simulations\n dt = 1/250 # Time step (1year = 250days)\n Div=[0.01 0.01] # Dividend\n Vol=[0.2 0.3] # Volatility\n\n ## Market Information\n r = 0.03 # Risk-free rate\n\n ## Define storages\n SimulPriceA = zeros(T,n) # Simulated Price of Asset A\n SimulPriceA[1,:] = CurrentPrice[1]\n SimulPriceB = zeros(T,n) # Simulated Price of Asset B\n SimulPriceB[1,:] = CurrentPrice[2]\n\n ## Generating the paths of stock prices by Geometric Brownian Motion\n UpperTriangle=chol(Corr) # UpperTriangle Matrix by Cholesky decomposition\n\n for i = 1:n\n Wiener = randn(T-1,2)\n CorrWiener = Wiener*UpperTriangle\n for j = 2:T\n SimulPriceA[j,i] = SimulPriceA[j-1,i]*exp((r-Div[1]-Vol[1]^2/2)*dt+Vol[1]*sqrt(dt)*CorrWiener[j-1,1])\n SimulPriceB[j,i] = SimulPriceB[j-1,i]*exp((r-Div[2]-Vol[2]^2/2)*dt+Vol[2]*sqrt(dt)*CorrWiener[j-1,2])\n end\n end\n\n return (SimulPriceA, SimulPriceB)\nend\n" }, { "path": "src/test/resources/samples/langs/KRL/helloworld.krl", "content": "ruleset sample {\n meta {\n name \"Hello World\"\n description <<\nHello world\n>>\n author \"Phil Windley\"\n }\n\n // just one rule\n rule hello {\n select when web pageview\n notify(\"Hello world!\", \"Just a note to say hello\");\n }\n}\n" }, { "path": "src/test/resources/samples/langs/KiCad Layout/C_Disc_D3_P2.5.kicad_mod", "content": "(module footprints:C_Disc_D3_P2.5 (layer F.Cu) (tedit 0)\n (descr \"Capacitor 3mm Disc, Pitch 2.5mm\")\n (tags Capacitor)\n (fp_text reference C1 (at 1.25 -2.5) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value C_100nF (at 1.25 2.5) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -0.9 -1.5) (end 3.4 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 3.4 -1.5) (end 3.4 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 3.4 1.5) (end -0.9 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -0.9 1.5) (end -0.9 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -0.25 -1.25) (end 2.75 -1.25) (layer F.SilkS) (width 0.15))\n (fp_line (start 2.75 1.25) (end -0.25 1.25) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole rect (at 0 0) (size 1.3 1.3) (drill 0.8) (layers *.Cu *.Mask F.SilkS))\n (pad 2 thru_hole circle (at 2.5 0) (size 1.3 1.3) (drill 0.8001) (layers *.Cu *.Mask F.SilkS))\n (model Capacitors_ThroughHole.3dshapes/C_Disc_D3_P2.5.wrl\n (at (xyz 0.0492126 0 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 0))\n )\n)\n" }, { "path": "src/test/resources/samples/langs/KiCad Layout/Conn_Poncho_SinBorde.kicad_mod", "content": "(module Conn_Poncho_SinBorde (layer F.Cu) (tedit 560F0DC0)\n (tags \"CONN Poncho\")\n (fp_text reference XA? (at -0.254 -3.175) (layer F.SilkS)\n (effects (font (size 0.8 0.8) (thickness 0.12)))\n )\n (fp_text value Conn_Poncho_SinBorde (at -1.905 51.181) (layer F.SilkS) hide\n (effects (font (size 1.016 1.016) (thickness 0.2032)))\n )\n (fp_text user GPIO8 (at -64.516 48.26) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GPIO7 (at -64.516 45.72) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GPIO5 (at -64.516 43.18) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GPIO3 (at -64.516 40.64) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GPIO1 (at -64.516 38.1) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user LCD1 (at -65.024 35.56) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user LCD2 (at -65.024 33.02) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user LCD3 (at -65.024 30.48) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user LCD_RS (at -64.008 27.94) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user LCD4 (at -65.024 25.4) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user SPI_SCK (at -63.754 22.86) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user SPI_MISO (at -63.5 20.32) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user TXD1 (at -65.024 17.78) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user TXD0 (at -65.024 15.24) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user MDIO (at -65.024 12.7) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user CRS_DV (at -64.008 10.16) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user MDC (at -65.278 7.62) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user TX_EN (at -64.77 5.08) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user RXD1 (at -65.024 2.54) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user +5V (at -65.532 0) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at -74.168 48.006) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at -74.168 45.72) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GPIO6 (at -74.93 43.18) (layer F.SilkS)\n (effects (font (size 1 0.9) (thickness 0.2)))\n )\n (fp_text user GPIO4 (at -74.93 40.64) (layer F.SilkS)\n (effects (font (size 1 0.9) (thickness 0.2)))\n )\n (fp_text user GPIO2 (at -74.93 38.1) (layer F.SilkS)\n (effects (font (size 1 0.9) (thickness 0.2)))\n )\n (fp_text user GPIO0 (at -74.93 35.56) (layer F.SilkS)\n (effects (font (size 1 0.9) (thickness 0.2)))\n )\n (fp_text user GND (at -74.168 33.02) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at -74.168 30.48) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user LCD_EN (at -74.676 27.686) (layer F.SilkS)\n (effects (font (size 1 0.7) (thickness 0.17)))\n )\n (fp_text user SPI_MOSI (at -74.93 25.146) (layer F.SilkS)\n (effects (font (size 1 0.7) (thickness 0.17)))\n )\n (fp_text user GND (at -74.168 22.86) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at -74.168 20.32) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user REF_CLK (at -74.93 17.78) (layer F.SilkS)\n (effects (font (size 0.9 0.7) (thickness 0.175)))\n )\n (fp_text user GND (at -74.168 15.24) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at -74.168 12.7) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at -74.168 7.62) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user RXD0 (at -74.676 10.16) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at -74.168 5.08) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at -74.168 2.54) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user +3.3V (at -74.93 0) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at 5.588 48.26) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at 5.588 45.72) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user T_F1 (at 5.588 43.18) (layer F.SilkS)\n (effects (font (size 0.9 0.9) (thickness 0.18)))\n )\n (fp_text user T_C2 (at 5.588 40.64) (layer F.SilkS)\n (effects (font (size 0.9 0.9) (thickness 0.18)))\n )\n (fp_text user GND (at 5.588 38.1) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at 5.334 35.56) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at 5.588 33.02) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at 5.588 30.48) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at 5.588 27.94) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at 5.588 25.4) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at 5.588 22.86) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GNDA (at 5.588 20.32) (layer F.SilkS)\n (effects (font (size 0.76 0.76) (thickness 0.19)))\n )\n (fp_text user GNDA (at 5.588 17.78) (layer F.SilkS)\n (effects (font (size 0.76 0.76) (thickness 0.19)))\n )\n (fp_text user GNDA (at 5.588 15.24) (layer F.SilkS)\n (effects (font (size 0.76 0.76) (thickness 0.19)))\n )\n (fp_text user GNDA (at 5.588 12.7) (layer F.SilkS)\n (effects (font (size 0.76 0.76) (thickness 0.19)))\n )\n (fp_text user GNDA (at 5.588 10.16) (layer F.SilkS)\n (effects (font (size 0.76 0.76) (thickness 0.19)))\n )\n (fp_text user GNDA (at 5.588 7.62) (layer F.SilkS)\n (effects (font (size 0.76 0.76) (thickness 0.19)))\n )\n (fp_text user WAKEUP (at 5.588 5.334) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user GND (at 5.588 3.048) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user +5V (at 5.588 0) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user T_COL0 (at -4.064 48.26) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user T_FIL2 (at -3.81 45.72) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user T_FIL3 (at -3.81 43.18) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user T_FIL0 (at -3.81 40.64) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user T_COL1 (at -4.064 38.1) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user CAN_TD (at -4.318 35.56) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user CAN_RD (at -4.318 33.02) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user 232_TX (at -4.318 30.48) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user 232_RX (at -4.318 27.94) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user I2C_SCL (at -4.572 25.4) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user I2C_SDA (at -4.572 22.86) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user VDDA (at -3.302 20.32) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user DAC (at -3.048 17.78) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user CH1 (at -3.048 15.24) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user CH2 (at -3.048 12.7) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user CH3 (at -3.048 10.16) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GNDA (at -3.556 7.62) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user ISP (at -2.794 5.08) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user RESET (at -3.81 2.54) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user CIAA-P2 (at -69.85 -2.032) (layer F.SilkS)\n (effects (font (size 0.8 0.8) (thickness 0.12)))\n )\n (fp_text user CIAA-P1 (at 1.27 -2.032) (layer F.SilkS)\n (effects (font (size 0.8 0.8) (thickness 0.12)))\n )\n (fp_text user +3.3V (at -3.81 0) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_line (start -72.39 0) (end -72.39 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start -72.39 -1.27) (end -67.31 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start -67.31 -1.27) (end -67.31 49.53) (layer F.SilkS) (width 0.15))\n (fp_line (start -67.31 49.53) (end -72.39 49.53) (layer F.SilkS) (width 0.15))\n (fp_line (start -72.39 49.53) (end -72.39 0) (layer F.SilkS) (width 0.15))\n (fp_line (start -1.27 49.53) (end -1.27 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 49.53) (end 3.81 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 49.53) (end -1.27 49.53) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 -1.27) (end -1.27 -1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole rect (at 0 0 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 2 thru_hole oval (at 2.54 0 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 11 thru_hole oval (at 0 12.7 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 4 thru_hole oval (at 2.54 2.54 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 13 thru_hole oval (at 0 15.24 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 6 thru_hole oval (at 2.54 5.08 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 15 thru_hole oval (at 0 17.78 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 8 thru_hole oval (at 2.54 7.62 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 17 thru_hole oval (at 0 20.32 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 10 thru_hole oval (at 2.54 10.16 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 19 thru_hole oval (at 0 22.86 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 12 thru_hole oval (at 2.54 12.7 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 21 thru_hole oval (at 0 25.4 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 14 thru_hole oval (at 2.54 15.24 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 23 thru_hole oval (at 0 27.94 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 16 thru_hole oval (at 2.54 17.78 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 25 thru_hole oval (at 0 30.48 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 18 thru_hole oval (at 2.54 20.32 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 27 thru_hole oval (at 0 33.02 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 20 thru_hole oval (at 2.54 22.86 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 29 thru_hole oval (at 0 35.56 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 22 thru_hole oval (at 2.54 25.4 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 31 thru_hole oval (at 0 38.1 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 24 thru_hole oval (at 2.54 27.94 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 26 thru_hole oval (at 2.54 30.48 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 33 thru_hole oval (at 0 40.64 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 28 thru_hole oval (at 2.54 33.02 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 32 thru_hole oval (at 2.54 38.1 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 34 thru_hole oval (at 2.54 40.64 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 36 thru_hole oval (at 2.54 43.18 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 38 thru_hole oval (at 2.54 45.72 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 35 thru_hole oval (at 0 43.18 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 37 thru_hole oval (at 0 45.72 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 3 thru_hole oval (at 0 2.54 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 5 thru_hole oval (at 0 5.08 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 7 thru_hole oval (at 0 7.62 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 9 thru_hole oval (at 0 10.16 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 39 thru_hole oval (at 0 48.26 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 40 thru_hole oval (at 2.54 48.26 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 30 thru_hole oval (at 2.54 35.56 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 41 thru_hole rect (at -71.12 0 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 42 thru_hole oval (at -68.58 0 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 43 thru_hole oval (at -71.12 2.54 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 44 thru_hole oval (at -68.58 2.54 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 45 thru_hole oval (at -71.12 5.08 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 46 thru_hole oval (at -68.58 5.08 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 47 thru_hole oval (at -71.12 7.62 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 48 thru_hole oval (at -68.58 7.62 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 49 thru_hole oval (at -71.12 10.16 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 50 thru_hole oval (at -68.58 10.16 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 51 thru_hole oval (at -71.12 12.7 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 52 thru_hole oval (at -68.58 12.7 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 53 thru_hole oval (at -71.12 15.24 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 54 thru_hole oval (at -68.58 15.24 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 55 thru_hole oval (at -71.12 17.78 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 56 thru_hole oval (at -68.58 17.78 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 57 thru_hole oval (at -71.12 20.32 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 58 thru_hole oval (at -68.58 20.32 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 59 thru_hole oval (at -71.12 22.86 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 60 thru_hole oval (at -68.58 22.86 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 61 thru_hole oval (at -71.12 25.4 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 62 thru_hole oval (at -68.58 25.4 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 63 thru_hole oval (at -71.12 27.94 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 64 thru_hole oval (at -68.58 27.94 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 65 thru_hole oval (at -71.12 30.48 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 66 thru_hole oval (at -68.58 30.48 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 67 thru_hole oval (at -71.12 33.02 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 68 thru_hole oval (at -68.58 33.02 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 69 thru_hole oval (at -71.12 35.56 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 70 thru_hole oval (at -68.58 35.56 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 71 thru_hole oval (at -71.12 38.1 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 72 thru_hole oval (at -68.58 38.1 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 73 thru_hole oval (at -71.12 40.64 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 74 thru_hole oval (at -68.58 40.64 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 75 thru_hole oval (at -71.12 43.18 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 76 thru_hole oval (at -68.58 43.18 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 77 thru_hole oval (at -71.12 45.72 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 78 thru_hole oval (at -68.58 45.72 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 79 thru_hole oval (at -71.12 48.26 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 80 thru_hole oval (at -68.58 48.26 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n)\n" }, { "path": "src/test/resources/samples/langs/KiCad Layout/Fiducial_1mm.kicad_mod", "content": "(module footprints:Fiducial_1mm (layer F.Cu) (tedit 573E1507)\n (clearance 1.524)\n (fp_text reference F3 (at 0.02 -0.9) (layer F.SilkS) hide\n (effects (font (size 0.7112 0.4572) (thickness 0.1143)))\n )\n (fp_text value FIDUCIAL (at 0 0.99) (layer F.SilkS) hide\n (effects (font (size 0.254 0.254) (thickness 0.00254)))\n )\n (pad 1 smd circle (at 0 0) (size 1 1) (layers F.Cu F.Mask)\n (solder_mask_margin 1.5))\n)\n" }, { "path": "src/test/resources/samples/langs/KiCad Layout/LED-5MM.kicad_mod", "content": "(module footprints:LED-5MM (layer F.Cu) (tedit 5570F7EA)\n (descr \"LED 5mm round vertical\")\n (tags \"LED 5mm round vertical\")\n (fp_text reference D4 (at 1.524 4.064) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value LED (at 1.524 -3.937) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.5 -1.55) (end -1.5 1.55) (layer F.CrtYd) (width 0.05))\n (fp_arc (start 1.3 0) (end -1.5 1.55) (angle -302) (layer F.CrtYd) (width 0.05))\n (fp_arc (start 1.27 0) (end -1.23 -1.5) (angle 297.5) (layer F.SilkS) (width 0.15))\n (fp_line (start -1.23 1.5) (end -1.23 -1.5) (layer F.SilkS) (width 0.15))\n (fp_circle (center 1.27 0) (end 0.97 -2.5) (layer F.SilkS) (width 0.15))\n (fp_text user K (at -1.905 1.905) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (pad 1 thru_hole rect (at 0 0 90) (size 2 1.9) (drill 1.00076) (layers *.Cu *.Mask F.SilkS))\n (pad 2 thru_hole circle (at 2.54 0) (size 1.9 1.9) (drill 1.00076) (layers *.Cu *.Mask F.SilkS))\n (model LEDs.3dshapes/LED-5MM.wrl\n (at (xyz 0.05 0 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 90))\n )\n)\n" }, { "path": "src/test/resources/samples/langs/KiCad Layout/Logo_OSHWA.kicad_mod", "content": "(module footprints:Logo_OSHWA (layer F.Cu) (tedit 560D8B85)\n (fp_text reference G101 (at 0 4.2418) (layer F.SilkS) hide\n (effects (font (size 0.7112 0.4572) (thickness 0.1143)))\n )\n (fp_text value Logo_OSHWA (at 0 -4.2418) (layer F.SilkS) hide\n (effects (font (size 0.36322 0.36322) (thickness 0.07112)))\n )\n (fp_poly (pts (xy -2.42316 3.59156) (xy -2.38252 3.57124) (xy -2.28854 3.51282) (xy -2.15392 3.42392)\n (xy -1.99644 3.31978) (xy -1.83896 3.21056) (xy -1.70942 3.1242) (xy -1.61798 3.06578)\n (xy -1.57988 3.04546) (xy -1.55956 3.05054) (xy -1.48336 3.08864) (xy -1.37414 3.14452)\n (xy -1.31064 3.17754) (xy -1.21158 3.22072) (xy -1.16078 3.23088) (xy -1.15316 3.21564)\n (xy -1.11506 3.13944) (xy -1.05918 3.00736) (xy -0.98298 2.83464) (xy -0.89662 2.63144)\n (xy -0.80264 2.413) (xy -0.7112 2.18948) (xy -0.6223 1.97612) (xy -0.54356 1.78562)\n (xy -0.48006 1.63068) (xy -0.43942 1.52146) (xy -0.42418 1.47574) (xy -0.42926 1.46558)\n (xy -0.48006 1.41732) (xy -0.56642 1.35128) (xy -0.75692 1.19634) (xy -0.94234 0.96266)\n (xy -1.05664 0.6985) (xy -1.09474 0.40386) (xy -1.06172 0.13208) (xy -0.95504 -0.12954)\n (xy -0.77216 -0.36576) (xy -0.55118 -0.54102) (xy -0.2921 -0.65278) (xy 0 -0.68834)\n (xy 0.2794 -0.65786) (xy 0.5461 -0.55118) (xy 0.78232 -0.37084) (xy 0.88138 -0.25654)\n (xy 1.01854 -0.01778) (xy 1.09728 0.23876) (xy 1.1049 0.30226) (xy 1.09474 0.5842)\n (xy 1.01092 0.85344) (xy 0.8636 1.09474) (xy 0.65786 1.29032) (xy 0.62992 1.31064)\n (xy 0.53594 1.38176) (xy 0.47244 1.43002) (xy 0.42164 1.47066) (xy 0.77978 2.33172)\n (xy 0.83566 2.46888) (xy 0.93472 2.7051) (xy 1.02108 2.9083) (xy 1.08966 3.06832)\n (xy 1.13792 3.17754) (xy 1.15824 3.22072) (xy 1.16078 3.22326) (xy 1.19126 3.22834)\n (xy 1.2573 3.20294) (xy 1.37668 3.14452) (xy 1.45796 3.10388) (xy 1.5494 3.0607)\n (xy 1.59004 3.04546) (xy 1.6256 3.06324) (xy 1.71196 3.12166) (xy 1.8415 3.20548)\n (xy 1.9939 3.30962) (xy 2.14122 3.41122) (xy 2.27584 3.50012) (xy 2.3749 3.56108)\n (xy 2.42316 3.58902) (xy 2.43078 3.58902) (xy 2.47142 3.56362) (xy 2.55016 3.50012)\n (xy 2.667 3.38836) (xy 2.8321 3.2258) (xy 2.8575 3.2004) (xy 2.99466 3.0607)\n (xy 3.10642 2.94386) (xy 3.18008 2.86258) (xy 3.20548 2.82448) (xy 3.20548 2.82448)\n (xy 3.18262 2.77622) (xy 3.11912 2.6797) (xy 3.03022 2.54254) (xy 2.921 2.38252)\n (xy 2.63652 1.9685) (xy 2.794 1.57734) (xy 2.84226 1.45796) (xy 2.90322 1.31318)\n (xy 2.9464 1.20904) (xy 2.9718 1.16332) (xy 3.01244 1.14808) (xy 3.12166 1.12268)\n (xy 3.2766 1.08966) (xy 3.45948 1.05664) (xy 3.63728 1.02362) (xy 3.7973 0.99314)\n (xy 3.9116 0.97028) (xy 3.9624 0.96012) (xy 3.9751 0.9525) (xy 3.98526 0.9271)\n (xy 3.99288 0.87376) (xy 3.99542 0.77724) (xy 3.99796 0.62484) (xy 3.99796 0.40386)\n (xy 3.99796 0.381) (xy 3.99542 0.17018) (xy 3.99288 0.00254) (xy 3.9878 -0.10668)\n (xy 3.98018 -0.14986) (xy 3.98018 -0.14986) (xy 3.92938 -0.16256) (xy 3.81762 -0.18542)\n (xy 3.6576 -0.21844) (xy 3.4671 -0.254) (xy 3.45694 -0.25654) (xy 3.26644 -0.2921)\n (xy 3.10896 -0.32512) (xy 2.9972 -0.35052) (xy 2.95148 -0.36576) (xy 2.94132 -0.37846)\n (xy 2.90322 -0.45212) (xy 2.84734 -0.56896) (xy 2.78638 -0.71374) (xy 2.72288 -0.86106)\n (xy 2.66954 -0.99568) (xy 2.63398 -1.09474) (xy 2.62382 -1.14046) (xy 2.62382 -1.14046)\n (xy 2.65176 -1.18618) (xy 2.7178 -1.28524) (xy 2.80924 -1.41986) (xy 2.921 -1.58242)\n (xy 2.92862 -1.59512) (xy 3.03784 -1.75514) (xy 3.12674 -1.88976) (xy 3.18516 -1.98628)\n (xy 3.20548 -2.02946) (xy 3.20548 -2.032) (xy 3.16992 -2.08026) (xy 3.08864 -2.16916)\n (xy 2.9718 -2.29108) (xy 2.8321 -2.43332) (xy 2.78638 -2.4765) (xy 2.63144 -2.6289)\n (xy 2.52476 -2.72796) (xy 2.45618 -2.7813) (xy 2.42316 -2.794) (xy 2.42316 -2.79146)\n (xy 2.3749 -2.76352) (xy 2.2733 -2.69748) (xy 2.13614 -2.6035) (xy 1.97358 -2.49428)\n (xy 1.96342 -2.48666) (xy 1.8034 -2.37744) (xy 1.67132 -2.28854) (xy 1.5748 -2.22504)\n (xy 1.53416 -2.19964) (xy 1.52654 -2.19964) (xy 1.46304 -2.21996) (xy 1.34874 -2.25806)\n (xy 1.20904 -2.31394) (xy 1.06172 -2.37236) (xy 0.9271 -2.42824) (xy 0.8255 -2.4765)\n (xy 0.77724 -2.5019) (xy 0.77724 -2.50444) (xy 0.75946 -2.56286) (xy 0.73152 -2.68224)\n (xy 0.6985 -2.84734) (xy 0.6604 -3.04292) (xy 0.65532 -3.0734) (xy 0.61976 -3.2639)\n (xy 0.58928 -3.42138) (xy 0.56642 -3.5306) (xy 0.55372 -3.57632) (xy 0.52832 -3.5814)\n (xy 0.43434 -3.58902) (xy 0.2921 -3.59156) (xy 0.11938 -3.5941) (xy -0.06096 -3.59156)\n (xy -0.23622 -3.58902) (xy -0.38862 -3.58394) (xy -0.4953 -3.57632) (xy -0.54102 -3.56616)\n (xy -0.54356 -3.56362) (xy -0.5588 -3.5052) (xy -0.5842 -3.38582) (xy -0.61976 -3.22072)\n (xy -0.65786 -3.0226) (xy -0.66294 -2.98958) (xy -0.6985 -2.79908) (xy -0.73152 -2.64414)\n (xy -0.75438 -2.53492) (xy -0.76708 -2.49428) (xy -0.78232 -2.48412) (xy -0.86106 -2.4511)\n (xy -0.98806 -2.39776) (xy -1.14808 -2.33426) (xy -1.51384 -2.1844) (xy -1.96088 -2.49428)\n (xy -2.00406 -2.52222) (xy -2.16408 -2.63144) (xy -2.2987 -2.72034) (xy -2.39014 -2.77876)\n (xy -2.42824 -2.80162) (xy -2.43078 -2.79908) (xy -2.4765 -2.76098) (xy -2.5654 -2.67716)\n (xy -2.68732 -2.55778) (xy -2.82702 -2.41808) (xy -2.93116 -2.31394) (xy -3.05562 -2.18694)\n (xy -3.13436 -2.10312) (xy -3.17754 -2.04724) (xy -3.19278 -2.01422) (xy -3.1877 -1.9939)\n (xy -3.15976 -1.94818) (xy -3.09372 -1.84912) (xy -3.00228 -1.71196) (xy -2.89306 -1.55448)\n (xy -2.80162 -1.41986) (xy -2.7051 -1.27) (xy -2.6416 -1.16332) (xy -2.61874 -1.10998)\n (xy -2.62382 -1.08712) (xy -2.65684 -1.00076) (xy -2.71018 -0.86614) (xy -2.77622 -0.70866)\n (xy -2.9337 -0.35306) (xy -3.16738 -0.30988) (xy -3.30708 -0.28194) (xy -3.5052 -0.24384)\n (xy -3.69316 -0.20828) (xy -3.9878 -0.14986) (xy -3.99796 0.93218) (xy -3.95224 0.9525)\n (xy -3.90906 0.9652) (xy -3.79984 0.98806) (xy -3.6449 1.01854) (xy -3.45948 1.0541)\n (xy -3.30454 1.08458) (xy -3.14452 1.11252) (xy -3.03276 1.13538) (xy -2.98196 1.14554)\n (xy -2.96926 1.16332) (xy -2.92862 1.23952) (xy -2.87274 1.36144) (xy -2.81178 1.50876)\n (xy -2.74828 1.65862) (xy -2.6924 1.79832) (xy -2.65176 1.905) (xy -2.63906 1.96088)\n (xy -2.65938 2.00406) (xy -2.72034 2.0955) (xy -2.8067 2.22758) (xy -2.91338 2.38506)\n (xy -3.0226 2.54254) (xy -3.1115 2.67716) (xy -3.175 2.77368) (xy -3.2004 2.81686)\n (xy -3.1877 2.84734) (xy -3.12674 2.92354) (xy -3.00736 3.04546) (xy -2.8321 3.22072)\n (xy -2.80162 3.24866) (xy -2.66192 3.38328) (xy -2.54254 3.4925) (xy -2.46126 3.56616)\n (xy -2.42316 3.59156)) (layer F.SilkS) (width 0.00254))\n)\n" }, { "path": "src/test/resources/samples/langs/KiCad Layout/Logo_Poncho.kicad_mod", "content": "(module footprints:Logo_Poncho (layer F.Cu) (tedit 560DAFF4)\n (fp_text reference G*** (at 0.127 5.588) (layer F.SilkS) hide\n (effects (font (thickness 0.3)))\n )\n (fp_text value LOGO (at 0.762 7.493) (layer F.SilkS) hide\n (effects (font (thickness 0.3)))\n )\n (fp_poly (pts (xy 4.535714 -0.627021) (xy 4.498746 -0.420109) (xy 4.405012 -0.1352) (xy 4.280272 0.162897)\n (xy 4.150281 0.409374) (xy 4.123376 0.447413) (xy 4.123376 -0.123701) (xy 4.058326 -0.436938)\n (xy 3.869112 -0.644378) (xy 3.564639 -0.737671) (xy 3.463636 -0.742208) (xy 3.129516 -0.681223)\n (xy 2.908248 -0.503835) (xy 2.808734 -0.218392) (xy 2.803896 -0.123701) (xy 2.868946 0.189536)\n (xy 3.058159 0.396975) (xy 3.362633 0.490269) (xy 3.463636 0.494805) (xy 3.797606 0.436492)\n (xy 3.958441 0.32987) (xy 4.092315 0.09203) (xy 4.123376 -0.123701) (xy 4.123376 0.447413)\n (xy 4.089856 0.494805) (xy 4.013749 0.621925) (xy 3.89522 0.861365) (xy 3.753792 1.172585)\n (xy 3.672876 1.360714) (xy 3.421635 1.929272) (xy 3.149718 2.496808) (xy 2.869494 3.041693)\n (xy 2.593334 3.542296) (xy 2.556493 3.603955) (xy 2.556493 -0.123701) (xy 2.552598 -0.439936)\n (xy 2.534834 -0.625484) (xy 2.494089 -0.714524) (xy 2.421247 -0.741238) (xy 2.391558 -0.742208)\n (xy 2.270831 -0.703329) (xy 2.228325 -0.558669) (xy 2.226623 -0.494805) (xy 2.206189 -0.31957)\n (xy 2.109798 -0.254982) (xy 1.97922 -0.247402) (xy 1.803985 -0.267837) (xy 1.739397 -0.364227)\n (xy 1.731818 -0.494805) (xy 1.705898 -0.675896) (xy 1.609459 -0.739655) (xy 1.566883 -0.742208)\n (xy 1.482553 -0.727599) (xy 1.433074 -0.660988) (xy 1.40933 -0.508193) (xy 1.402206 -0.235036)\n (xy 1.401948 -0.123701) (xy 1.405843 0.192533) (xy 1.423606 0.378081) (xy 1.464351 0.467122)\n (xy 1.537193 0.493835) (xy 1.566883 0.494805) (xy 1.680559 0.462518) (xy 1.726426 0.336472)\n (xy 1.731818 0.206169) (xy 1.745609 0.012245) (xy 1.815564 -0.067294) (xy 1.97922 -0.082467)\n (xy 2.145441 -0.066377) (xy 2.213617 0.015237) (xy 2.226623 0.206169) (xy 2.245073 0.405103)\n (xy 2.317099 0.48537) (xy 2.391558 0.494805) (xy 2.475887 0.480197) (xy 2.525367 0.413586)\n (xy 2.549111 0.260791) (xy 2.556234 -0.012366) (xy 2.556493 -0.123701) (xy 2.556493 3.603955)\n (xy 2.33361 3.976986) (xy 2.102692 4.324132) (xy 1.912952 4.562103) (xy 1.781691 4.667512)\n (xy 1.660102 4.654002) (xy 1.438445 4.580892) (xy 1.163465 4.463746) (xy 1.154545 4.459546)\n (xy 1.154545 0.36149) (xy 1.110706 0.268405) (xy 0.956623 0.266159) (xy 0.938776 0.269422)\n (xy 0.717011 0.243945) (xy 0.523128 0.11531) (xy 0.417755 -0.07121) (xy 0.412337 -0.123701)\n (xy 0.484303 -0.318602) (xy 0.658393 -0.472009) (xy 0.871896 -0.536691) (xy 0.949632 -0.528355)\n (xy 1.105982 -0.515384) (xy 1.154279 -0.597467) (xy 1.154545 -0.609566) (xy 1.114247 -0.69528)\n (xy 0.970303 -0.735064) (xy 0.783441 -0.742208) (xy 0.429195 -0.687347) (xy 0.198088 -0.523118)\n (xy 0.090717 -0.250044) (xy 0.082467 -0.123701) (xy 0.144642 0.188869) (xy 0.330769 0.392787)\n (xy 0.640252 0.487526) (xy 0.783441 0.494805) (xy 1.022962 0.480515) (xy 1.134243 0.429291)\n (xy 1.154545 0.36149) (xy 1.154545 4.459546) (xy 1.148315 4.456614) (xy 0.592041 4.256938)\n (xy 0.061238 4.207886) (xy -0.164935 4.249843) (xy -0.164935 -0.123701) (xy -0.168831 -0.439936)\n (xy -0.186594 -0.625484) (xy -0.227339 -0.714524) (xy -0.300181 -0.741238) (xy -0.329871 -0.742208)\n (xy -0.435349 -0.716231) (xy -0.483875 -0.609894) (xy -0.495586 -0.391721) (xy -0.496366 -0.041234)\n (xy -0.706429 -0.391721) (xy -0.874005 -0.625569) (xy -1.029731 -0.729733) (xy -1.117986 -0.742208)\n (xy -1.220495 -0.733937) (xy -1.280586 -0.685976) (xy -1.309571 -0.563603) (xy -1.318762 -0.332094)\n (xy -1.319481 -0.123701) (xy -1.315585 0.192533) (xy -1.297822 0.378081) (xy -1.257077 0.467122)\n (xy -1.184235 0.493835) (xy -1.154546 0.494805) (xy -1.049068 0.468829) (xy -1.000541 0.362492)\n (xy -0.988831 0.144318) (xy -0.98805 -0.206169) (xy -0.777988 0.144318) (xy -0.610412 0.378167)\n (xy -0.454685 0.48233) (xy -0.36643 0.494805) (xy -0.263922 0.486535) (xy -0.203831 0.438574)\n (xy -0.174846 0.3162) (xy -0.165655 0.084692) (xy -0.164935 -0.123701) (xy -0.164935 4.249843)\n (xy -0.48241 4.308738) (xy -0.783442 4.420415) (xy -1.059466 4.535832) (xy -1.285963 4.626797)\n (xy -1.401948 4.669513) (xy -1.518876 4.625399) (xy -1.566884 4.584033) (xy -1.566884 -0.123701)\n (xy -1.631934 -0.436938) (xy -1.821147 -0.644378) (xy -2.12562 -0.737671) (xy -2.226624 -0.742208)\n (xy -2.560743 -0.681223) (xy -2.782012 -0.503835) (xy -2.881525 -0.218392) (xy -2.886364 -0.123701)\n (xy -2.821314 0.189536) (xy -2.6321 0.396975) (xy -2.327627 0.490269) (xy -2.226624 0.494805)\n (xy -1.892653 0.436492) (xy -1.731819 0.32987) (xy -1.597945 0.09203) (xy -1.566884 -0.123701)\n (xy -1.566884 4.584033) (xy -1.717176 4.454536) (xy -1.98582 4.166799) (xy -2.061689 4.078924)\n (xy -2.369861 3.70727) (xy -2.632201 3.363429) (xy -2.870341 3.013116) (xy -2.968832 2.849614)\n (xy -2.968832 -0.32987) (xy -3.007485 -0.54598) (xy -3.140146 -0.67528) (xy -3.391869 -0.734039)\n (xy -3.603832 -0.742208) (xy -4.04091 -0.742208) (xy -4.04091 -0.123701) (xy -4.037014 0.192533)\n (xy -4.019251 0.378081) (xy -3.978506 0.467122) (xy -3.905664 0.493835) (xy -3.875974 0.494805)\n (xy -3.746639 0.446485) (xy -3.711039 0.288637) (xy -3.687673 0.146227) (xy -3.584731 0.090232)\n (xy -3.438897 0.082468) (xy -3.16065 0.034793) (xy -3.008068 -0.114765) (xy -2.968832 -0.32987)\n (xy -2.968832 2.849614) (xy -3.105916 2.622046) (xy -3.360558 2.155935) (xy -3.6559 1.580499)\n (xy -3.724805 1.443182) (xy -3.927446 1.040996) (xy -4.107468 0.68891) (xy -4.250627 0.414385)\n (xy -4.342678 0.24488) (xy -4.366512 0.206169) (xy -4.479713 -0.061738) (xy -4.470402 -0.368299)\n (xy -4.39208 -0.562072) (xy -4.211754 -0.794239) (xy -3.970771 -1.027175) (xy -3.729883 -1.205582)\n (xy -3.628572 -1.257014) (xy -3.515586 -1.328258) (xy -3.31072 -1.481511) (xy -3.047204 -1.691308)\n (xy -2.861153 -1.845142) (xy -2.478394 -2.151727) (xy -2.09396 -2.434151) (xy -1.735885 -2.674156)\n (xy -1.432202 -2.853482) (xy -1.210945 -2.953871) (xy -1.135923 -2.968831) (xy -0.992755 -2.911987)\n (xy -0.868796 -2.807085) (xy -0.798823 -2.718089) (xy -0.768465 -2.621372) (xy -0.779148 -2.476306)\n (xy -0.832302 -2.242261) (xy -0.897248 -1.997411) (xy -1.002077 -1.614541) (xy -1.0637 -1.342913)\n (xy -1.062894 -1.163551) (xy -0.980436 -1.05748) (xy -0.797105 -1.005726) (xy -0.493678 -0.989314)\n (xy -0.050932 -0.989267) (xy 0.123701 -0.98961) (xy 0.616616 -0.993152) (xy 0.963601 -1.004879)\n (xy 1.183529 -1.026446) (xy 1.295275 -1.059505) (xy 1.31948 -1.094352) (xy 1.298521 -1.22034)\n (xy 1.243133 -1.457326) (xy 1.164548 -1.757819) (xy 1.150407 -1.809213) (xy 1.043088 -2.255847)\n (xy 1.008894 -2.569631) (xy 1.048676 -2.765972) (xy 1.163285 -2.860279) (xy 1.208992 -2.870512)\n (xy 1.420553 -2.83991) (xy 1.739874 -2.711189) (xy 2.149801 -2.493929) (xy 2.633175 -2.197713)\n (xy 3.172841 -1.832122) (xy 3.525487 -1.576813) (xy 3.929546 -1.272303) (xy 4.214754 -1.04349)\n (xy 4.398878 -0.873667) (xy 4.499689 -0.746128) (xy 4.534955 -0.644167) (xy 4.535714 -0.627021)\n (xy 4.535714 -0.627021)) (layer F.SilkS) (width 0.1))\n (fp_poly (pts (xy 1.023542 -3.736319) (xy 0.895402 -3.389445) (xy 0.679417 -3.11223) (xy 0.563302 -2.982356)\n (xy 0.508034 -2.869698) (xy 0.506066 -2.720981) (xy 0.549854 -2.48293) (xy 0.574294 -2.370022)\n (xy 0.658312 -1.973188) (xy 0.69611 -1.709422) (xy 0.675383 -1.550382) (xy 0.583822 -1.467723)\n (xy 0.409122 -1.433104) (xy 0.16144 -1.419187) (xy -0.12355 -1.415195) (xy -0.339882 -1.428263)\n (xy -0.43645 -1.453549) (xy -0.490308 -1.618268) (xy -0.466441 -1.923684) (xy -0.365224 -2.365222)\n (xy -0.360015 -2.384058) (xy -0.225225 -2.868872) (xy -0.488808 -3.104404) (xy -0.714353 -3.402585)\n (xy -0.808424 -3.746824) (xy -0.77552 -4.096523) (xy -0.620138 -4.411085) (xy -0.346777 -4.649915)\n (xy -0.31571 -4.666738) (xy 0.033719 -4.763905) (xy 0.380075 -4.71573) (xy 0.68714 -4.538441)\n (xy 0.918691 -4.248265) (xy 0.989692 -4.081895) (xy 1.023542 -3.736319) (xy 1.023542 -3.736319)) (layer F.SilkS) (width 0.1))\n (fp_poly (pts (xy -3.320079 -0.321578) (xy -3.381169 -0.206169) (xy -3.537606 -0.087441) (xy -3.656944 -0.12265)\n (xy -3.710414 -0.301007) (xy -3.711039 -0.32987) (xy -3.666881 -0.523821) (xy -3.553583 -0.57585)\n (xy -3.399915 -0.47517) (xy -3.381169 -0.453571) (xy -3.320079 -0.321578) (xy -3.320079 -0.321578)) (layer F.SilkS) (width 0.1))\n (fp_poly (pts (xy -1.911824 -0.1467) (xy -1.935194 -0.006732) (xy -2.006645 0.114199) (xy -2.128505 0.265484)\n (xy -2.225472 0.329848) (xy -2.226624 0.32987) (xy -2.322643 0.267542) (xy -2.444552 0.117317)\n (xy -2.446603 0.114199) (xy -2.537406 -0.05684) (xy -2.52656 -0.197017) (xy -2.465958 -0.318756)\n (xy -2.343482 -0.473895) (xy -2.226624 -0.536039) (xy -2.106037 -0.47051) (xy -1.987289 -0.318756)\n (xy -1.911824 -0.1467) (xy -1.911824 -0.1467)) (layer F.SilkS) (width 0.1))\n (fp_poly (pts (xy 3.778435 -0.1467) (xy 3.755065 -0.006732) (xy 3.683615 0.114199) (xy 3.561755 0.265484)\n (xy 3.464788 0.329848) (xy 3.463636 0.32987) (xy 3.367616 0.267542) (xy 3.245708 0.117317)\n (xy 3.243657 0.114199) (xy 3.152854 -0.05684) (xy 3.163699 -0.197017) (xy 3.224301 -0.318756)\n (xy 3.346778 -0.473895) (xy 3.463636 -0.536039) (xy 3.584223 -0.47051) (xy 3.702971 -0.318756)\n (xy 3.778435 -0.1467) (xy 3.778435 -0.1467)) (layer F.SilkS) (width 0.1))\n)\n" }, { "path": "src/test/resources/samples/langs/KiCad Layout/MagneticBuzzer_ProSignal_ABT-410-RC.kicad_mod", "content": "(module footprints:MagneticBuzzer_ProSignal_ABT-410-RC (layer F.Cu) (tedit 544E5504)\n (descr \"Buzzer, Elektromagnetic Beeper, Summer, 1,5V-DC,\")\n (tags \"Pro Signal, ABT-410-RC,\")\n (fp_text reference U1 (at 3.175 -8.001) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value BUZZER (at 2.17424 8.001) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start 8.17626 -0.50038) (end 8.17626 0.50038) (layer F.SilkS) (width 0.15))\n (fp_line (start 7.67588 0) (end 8.6741 0) (layer F.SilkS) (width 0.15))\n (fp_circle (center 3.175 0) (end 4.17576 0) (layer F.SilkS) (width 0.15))\n (fp_text user + (at 10.67562 0) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_circle (center 3.175 0) (end 9.37514 0) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 0 0) (size 1.6002 1.6002) (drill 1.00076) (layers *.Cu *.Mask F.SilkS))\n (pad 2 thru_hole circle (at 6.35 0) (size 1.6002 1.6002) (drill 1.00076) (layers *.Cu *.Mask F.SilkS))\n (model Buzzers_Beepers.3dshapes/MagneticBuzzer_ProSignal_ABT-410-RC.wrl\n (at (xyz 0 0 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 0))\n )\n)\n" }, { "path": "src/test/resources/samples/langs/KiCad Layout/Pin_Header_Straight_2x02.kicad_mod", "content": "(module footprints:Pin_Header_Straight_2x02 (layer F.Cu) (tedit 0)\n (descr \"Through hole pin header\")\n (tags \"pin header\")\n (fp_text reference P1 (at 0 -5.1) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value PWR_JUMPER (at 0 -3.1) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.75 -1.75) (end -1.75 4.3) (layer F.CrtYd) (width 0.05))\n (fp_line (start 4.3 -1.75) (end 4.3 4.3) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.75 -1.75) (end 4.3 -1.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.75 4.3) (end 4.3 4.3) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.55 0) (end -1.55 -1.55) (layer F.SilkS) (width 0.15))\n (fp_line (start 0 -1.55) (end -1.55 -1.55) (layer F.SilkS) (width 0.15))\n (fp_line (start -1.27 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 -1.27) (end 3.81 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 -1.27) (end 3.81 3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 3.81) (end -1.27 3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start -1.27 3.81) (end -1.27 1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole rect (at 0 0) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 2 thru_hole oval (at 2.54 0) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 3 thru_hole oval (at 0 2.54) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 4 thru_hole oval (at 2.54 2.54) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (model Pin_Headers.3dshapes/Pin_Header_Straight_2x02.wrl\n (at (xyz 0.05 -0.05 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 90))\n )\n)\n" }, { "path": "src/test/resources/samples/langs/KiCad Layout/Pin_Header_Straight_2x20.kicad_mod", "content": "(module footprints:Pin_Header_Straight_2x20 (layer F.Cu) (tedit 0)\n (descr \"Through hole pin header\")\n (tags \"pin header\")\n (fp_text reference XA2 (at 0 -5.1) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value Conn_Poncho2P_2x_20x2 (at 0 -3.1) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.75 -1.75) (end -1.75 50.05) (layer F.CrtYd) (width 0.05))\n (fp_line (start 4.3 -1.75) (end 4.3 50.05) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.75 -1.75) (end 4.3 -1.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.75 50.05) (end 4.3 50.05) (layer F.CrtYd) (width 0.05))\n (fp_line (start 3.81 49.53) (end 3.81 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start -1.27 1.27) (end -1.27 49.53) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 49.53) (end -1.27 49.53) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 -1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 0 -1.55) (end -1.55 -1.55) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 -1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 1.27) (end -1.27 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start -1.55 -1.55) (end -1.55 0) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole rect (at 0 0) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 2 thru_hole oval (at 2.54 0) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 3 thru_hole oval (at 0 2.54) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 4 thru_hole oval (at 2.54 2.54) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 5 thru_hole oval (at 0 5.08) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 6 thru_hole oval (at 2.54 5.08) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 7 thru_hole oval (at 0 7.62) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 8 thru_hole oval (at 2.54 7.62) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 9 thru_hole oval (at 0 10.16) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 10 thru_hole oval (at 2.54 10.16) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 11 thru_hole oval (at 0 12.7) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 12 thru_hole oval (at 2.54 12.7) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 13 thru_hole oval (at 0 15.24) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 14 thru_hole oval (at 2.54 15.24) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 15 thru_hole oval (at 0 17.78) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 16 thru_hole oval (at 2.54 17.78) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 17 thru_hole oval (at 0 20.32) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 18 thru_hole oval (at 2.54 20.32) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 19 thru_hole oval (at 0 22.86) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 20 thru_hole oval (at 2.54 22.86) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 21 thru_hole oval (at 0 25.4) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 22 thru_hole oval (at 2.54 25.4) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 23 thru_hole oval (at 0 27.94) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 24 thru_hole oval (at 2.54 27.94) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 25 thru_hole oval (at 0 30.48) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 26 thru_hole oval (at 2.54 30.48) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 27 thru_hole oval (at 0 33.02) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 28 thru_hole oval (at 2.54 33.02) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 29 thru_hole oval (at 0 35.56) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 30 thru_hole oval (at 2.54 35.56) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 31 thru_hole oval (at 0 38.1) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 32 thru_hole oval (at 2.54 38.1) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 33 thru_hole oval (at 0 40.64) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 34 thru_hole oval (at 2.54 40.64) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 35 thru_hole oval (at 0 43.18) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 36 thru_hole oval (at 2.54 43.18) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 37 thru_hole oval (at 0 45.72) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 38 thru_hole oval (at 2.54 45.72) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 39 thru_hole oval (at 0 48.26) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (pad 40 thru_hole oval (at 2.54 48.26) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))\n (model Pin_Headers.3dshapes/Pin_Header_Straight_2x20.wrl\n (at (xyz 0.05 -0.95 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 90))\n )\n)\n" }, { "path": "src/test/resources/samples/langs/KiCad Layout/Resistor_Horizontal_RM7mm.kicad_mod", "content": "(module footprints:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 569FCF07)\n (descr \"Resistor, Axial, RM 7.62mm, 1/3W,\")\n (tags \"Resistor Axial RM 7.62mm 1/3W R3\")\n (fp_text reference R18 (at 4.05892 -3.50012) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 680 (at 3.81 3.81) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 0 0) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask))\n (pad 2 thru_hole circle (at 7.62 0) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask))\n)\n" }, { "path": "src/test/resources/samples/langs/KiCad Layout/SW_PUSH_SMALL.kicad_mod", "content": "(module footprints:SW_PUSH_SMALL (layer F.Cu) (tedit 0)\n (fp_text reference SW7 (at 0 -0.762) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value SW_PUSH (at 0 1.016) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_circle (center 0 0) (end 0 -2.54) (layer F.SilkS) (width 0.15))\n (fp_line (start -3.81 -3.81) (end 3.81 -3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 -3.81) (end 3.81 3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start -3.81 -3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 3.81 -2.54) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS))\n (pad 2 thru_hole circle (at 3.81 2.54) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS))\n (pad 1 thru_hole circle (at -3.81 -2.54) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS))\n (pad 2 thru_hole circle (at -3.81 2.54) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS))\n)\n" }, { "path": "src/test/resources/samples/langs/KiCad Layout/TO-92_Molded_Narrow.kicad_mod", "content": "(module footprints:TO-92_Molded_Narrow (layer F.Cu) (tedit 54F242E1)\n (descr \"TO-92 leads molded, narrow, drill 0.6mm (see NXP sot054_po.pdf)\")\n (tags \"to-92 sc-43 sc-43a sot54 PA33 transistor\")\n (fp_text reference Q5 (at 0 -4) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value BC547 (at 0 3) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.4 1.95) (end -1.4 -2.65) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.4 1.95) (end 3.9 1.95) (layer F.CrtYd) (width 0.05))\n (fp_line (start -0.43 1.7) (end 2.97 1.7) (layer F.SilkS) (width 0.15))\n (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle -135) (layer F.SilkS) (width 0.15))\n (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle 135) (layer F.SilkS) (width 0.15))\n (fp_line (start -1.4 -2.65) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))\n (fp_line (start 3.9 1.95) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))\n (pad 2 thru_hole circle (at 1.27 -1.27 90) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS))\n (pad 3 thru_hole circle (at 2.54 0 90) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS))\n (pad 1 thru_hole circle (at 0 0 90) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS))\n (model TO_SOT_Packages_THT.3dshapes/TO-92_Molded_Narrow.wrl\n (at (xyz 0.05 0 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 -90))\n )\n)\n" }, { "path": "src/test/resources/samples/langs/KiCad Layout/filenames/fp-lib-table", "content": "(fp_lib_table\n (lib (name Air_Coils_SML_NEOSID)(type Github)(uri ${KIGITHUB}/Air_Coils_SML_NEOSID.pretty)(options \"\")(descr \"Deprecated - will be removed\"))\n (lib (name Buttons_Switches_SMD)(type Github)(uri ${KIGITHUB}/Buttons_Switches_SMD.pretty)(options \"\")(descr \"Buttons and switches, surface mount\"))\n (lib (name Buttons_Switches_THT)(type Github)(uri ${KIGITHUB}/Buttons_Switches_THT.pretty)(options \"\")(descr \"Buttons and switches, through hole\"))\n (lib (name Buzzers_Beepers)(type Github)(uri ${KIGITHUB}/Buzzers_Beepers.pretty)(options \"\")(descr \"Audio signalling devices\"))\n (lib (name Capacitors_SMD)(type Github)(uri ${KIGITHUB}/Capacitors_SMD.pretty)(options \"\")(descr \"Capacitors, surface mount\"))\n (lib (name Capacitors_Tantalum_SMD)(type Github)(uri ${KIGITHUB}/Capacitors_Tantalum_SMD.pretty)(options \"\")(descr \"Tantalum capacitors, surface mount\"))\n (lib (name Capacitors_THT)(type Github)(uri ${KIGITHUB}/Capacitors_THT.pretty)(options \"\")(descr \"Capacitors, through hole\"))\n (lib (name Choke_Axial_ThroughHole)(type Github)(uri ${KIGITHUB}/Choke_Axial_ThroughHole.pretty)(options \"\")(descr \"Deprecated - will be removed\"))\n (lib (name Choke_Common-Mode_Wurth)(type Github)(uri ${KIGITHUB}/Choke_Common-Mode_Wurth.pretty)(options \"\")(descr \"Deprecated - will be removed\"))\n (lib (name Choke_Radial_ThroughHole)(type Github)(uri ${KIGITHUB}/Choke_Radial_ThroughHole.pretty)(options \"\")(descr \"Deprecated - will be removed\"))\n (lib (name Choke_SMD)(type Github)(uri ${KIGITHUB}/Choke_SMD.pretty)(options \"\")(descr \"Deprecated - will be removed\"))\n (lib (name Choke_Toroid_ThroughHole)(type Github)(uri ${KIGITHUB}/Choke_Toroid_ThroughHole.pretty)(options \"\")(descr \"Deprecated - will be removed\"))\n (lib (name Connectors_Harwin)(type Github)(uri ${KIGITHUB}/Connectors_Harwin.pretty)(options \"\")(descr \"Harwin connector footprints www.harwin.com\"))\n (lib (name Connectors_Hirose)(type Github)(uri ${KIGITHUB}/Connectors_Hirose.pretty)(options \"\")(descr \"Hirose connector footprints www.hirose.com\"))\n (lib (name Connectors_JAE)(type Github)(uri ${KIGITHUB}/Connectors_JAE.pretty)(options \"\")(descr \"JAE connector footprints http://www.jae.com/jccom/en/connectors\"))\n (lib (name Connectors_JST)(type Github)(uri ${KIGITHUB}/Connectors_JST.pretty)(options \"\")(descr \"JST connector footprints www.jst.com\"))\n (lib (name Connectors_Mini-Universal)(type Github)(uri ${KIGITHUB}/Connectors_Mini-Universal.pretty)(options \"\")(descr Mate-N-Lok))\n (lib (name Connectors_Molex)(type Github)(uri ${KIGITHUB}/Connectors_Molex.pretty)(options \"\")(descr \"Molex connector foottprints www.molex.com\"))\n (lib (name Connectors_Multicomp)(type Github)(uri ${KIGITHUB}/Connectors_Multicomp.pretty)(options \"\")(descr \"Multicomp connector footprints\"))\n (lib (name Connectors_Phoenix)(type Github)(uri ${KIGITHUB}/Connectors_Phoenix.pretty)(options \"\")(descr \"Phoenix connector footprints\"))\n (lib (name Connectors_Samtec)(type Github)(uri ${KIGITHUB}/Connectors_Samtec.pretty)(options \"\")(descr \"Samtec connector footprints\"))\n (lib (name Connectors_TE-Connectivity)(type Github)(uri ${KIGITHUB}/Connectors_TE-Connectivity.pretty)(options \"\")(descr \"TE Connectivity connector footprints www.te.com\"))\n (lib (name Connectors_Terminal_Blocks)(type Github)(uri ${KIGITHUB}/Connectors_Terminal_Blocks.pretty)(options \"\")(descr \"Terminal block connectors\"))\n (lib (name Connectors_WAGO)(type Github)(uri ${KIGITHUB}/Connectors_WAGO.pretty)(options \"\")(descr \"WAGO connector footprints www.wago.com\"))\n (lib (name Connectors)(type Github)(uri ${KIGITHUB}/Connectors.pretty)(options \"\")(descr \"Assorted connector footprints\"))\n (lib (name Converters_DCDC_ACDC)(type Github)(uri ${KIGITHUB}/Converters_DCDC_ACDC.pretty)(options \"\")(descr \"DC-DC and AC-DC convertor modules\"))\n (lib (name Crystals)(type Github)(uri ${KIGITHUB}/Crystals.pretty)(options \"\")(descr \"Crystals and oscillators\"))\n (lib (name Diodes_SMD)(type Github)(uri ${KIGITHUB}/Diodes_SMD.pretty)(options \"\")(descr \"Diodes, surface mount\"))\n (lib (name Diodes_THT)(type Github)(uri ${KIGITHUB}/Diodes_THT.pretty)(options \"\")(descr \"Diodes, through hole\"))\n (lib (name Discret)(type Github)(uri ${KIGITHUB}/Discret.pretty)(options \"\")(descr \"Deprecated - will be removed\"))\n (lib (name Displays_7-Segment)(type Github)(uri ${KIGITHUB}/Displays_7-Segment.pretty)(options \"\")(descr \"Seven segment displays\"))\n (lib (name Displays)(type Github)(uri ${KIGITHUB}/Displays.pretty)(options \"\")(descr \"Display modules\"))\n (lib (name Divers)(type Github)(uri ${KIGITHUB}/Divers.pretty)(options \"\")(descr \"Deprecated - will be removed\"))\n (lib (name Enclosures)(type Github)(uri ${KIGITHUB}/Enclosures.pretty)(options \"\")(descr \"Electronics enclosures and housings\"))\n (lib (name EuroBoard_Outline)(type Github)(uri ${KIGITHUB}/EuroBoard_Outline.pretty)(options \"\")(descr \"Deprecated - will be removed\"))\n (lib (name Fiducials)(type Github)(uri ${KIGITHUB}/Fiducials.pretty)(options \"\")(descr \"Fiducial markings\"))\n (lib (name Filters_HF_Coils_NEOSID)(type Github)(uri ${KIGITHUB}/Filters_HF_Coils_NEOSID.pretty)(options \"\")(descr \"Deprecated - will be removed\"))\n (lib (name Fuse_Holders_and_Fuses)(type Github)(uri ${KIGITHUB}/Fuse_Holders_and_Fuses.pretty)(options \"\")(descr \"Fuses and fuse holders\"))\n (lib (name Hall-Effect_Transducers_LEM)(type Github)(uri ${KIGITHUB}/Hall-Effect_Transducers_LEM.pretty)(options \"\")(descr \"LEM hall effect transducers\"))\n (lib (name Heatsinks)(type Github)(uri ${KIGITHUB}/Heatsinks.pretty)(options \"\")(descr \"Heatsinks and thermal products\"))\n (lib (name Housings_BGA)(type Github)(uri ${KIGITHUB}/Housings_BGA.pretty)(options \"\")(descr \"Ball Grid Array (BGA)\"))\n (lib (name Housings_DFN_QFN)(type Github)(uri ${KIGITHUB}/Housings_DFN_QFN.pretty)(options \"\")(descr \"Surface mount IC packages, DFN / LGA / QFN\"))\n (lib (name Housings_DIP)(type Github)(uri ${KIGITHUB}/Housings_DIP.pretty)(options \"\")(descr \"Through hole IC packages, DIP\"))\n (lib (name Housings_LCC)(type Github)(uri ${KIGITHUB}/Housings_LCC.pretty)(options \"\")(descr \"Leaded Chip Carriers (LCC)\"))\n (lib (name Housings_LGA)(type Github)(uri ${KIGITHUB}/Housings_LGA.pretty)(options \"\")(descr \"Land Grid Array (LGA)\"))\n (lib (name Housings_PGA)(type Github)(uri ${KIGITHUB}/Housings_PGA.pretty)(options \"\")(descr \"Pin Grid Array (PGA)\"))\n (lib (name Housings_QFP)(type Github)(uri ${KIGITHUB}/Housings_QFP.pretty)(options \"\")(descr \"Quad Flat Package (QFP)\"))\n (lib (name Housings_SIP)(type Github)(uri ${KIGITHUB}/Housings_SIP.pretty)(options \"\")(descr \"Single Inline Package (SIP)\"))\n (lib (name Housings_SOIC)(type Github)(uri ${KIGITHUB}/Housings_SOIC.pretty)(options \"\")(descr \"Small Outline Integrated Circuits (SOIC)\"))\n (lib (name Housings_SSOP)(type Github)(uri ${KIGITHUB}/Housings_SSOP.pretty)(options \"\")(descr \"SSOP, TSSOP, MSOP, QSOP, VSO packages\"))\n (lib (name Inductors_NEOSID)(type Github)(uri ${KIGITHUB}/Inductors_NEOSID.pretty)(options \"\")(descr \"Deprecated - will be removed\"))\n (lib (name Inductors)(type Github)(uri ${KIGITHUB}/Inductors.pretty)(options \"\")(descr \"Deprecated - will be removed\"))\n (lib (name Inductors_SMD)(type Github)(uri ${KIGITHUB}/Inductors_SMD.pretty)(options \"\")(descr \"Inductors, surface mount\"))\n (lib (name Inductors_THT)(type Github)(uri ${KIGITHUB}/Inductors_THT.pretty)(options \"\")(descr \"Inductors, through hole\"))\n (lib (name IR-DirectFETs)(type Github)(uri ${KIGITHUB}/IR-DirectFETs.pretty)(options \"\")(descr \"DirectFet packets from International Rectifier\"))\n (lib (name Labels)(type Github)(uri ${KIGITHUB}/Labels.pretty)(options \"\")(descr \"Deprecated - will be removed\"))\n (lib (name LEDs)(type Github)(uri ${KIGITHUB}/LEDs.pretty)(options \"\")(descr \"Light emitting diodes (LEDs)\"))\n (lib (name Measurement_Points)(type Github)(uri ${KIGITHUB}/Measurement_Points.pretty)(options \"\")(descr \"Terminals for test equipment\"))\n (lib (name Measurement_Scales)(type Github)(uri ${KIGITHUB}/Measurement_Scales.pretty)(options \"\")(descr \"Measurement scales and gauges\"))\n (lib (name Mechanical_Sockets)(type Github)(uri ${KIGITHUB}/Mechanical_Sockets.pretty)(options \"\")(descr \"Sockets for board to board connection\"))\n (lib (name Microwave)(type Github)(uri ${KIGITHUB}/Microwave.pretty)(options \"\")(descr \"Microwave\"))\n (lib (name Modules)(type Github)(uri ${KIGITHUB}/Modules.pretty)(options \"\")(descr \"Board-level devices integrating system functionality into a single module\"))\n (lib (name Mounting_Holes)(type Github)(uri ${KIGITHUB}/Mounting_Holes.pretty)(options \"\")(descr \"Mechanical fasteners\"))\n (lib (name NF-Transformers_ETAL)(type Github)(uri ${KIGITHUB}/NF-Transformers_ETAL.pretty)(options \"\")(descr \"Deprecated - will be deleted\"))\n (lib (name Oddities)(type Github)(uri ${KIGITHUB}/Oddities.pretty)(options \"\")(descr \"Assorted footprints. Deprecated - will be removed\"))\n (lib (name Opto-Devices)(type Github)(uri ${KIGITHUB}/Opto-Devices.pretty)(options \"\")(descr \"Optocouplers, light sensors, and other optical devices\"))\n (lib (name Oscillators)(type Github)(uri ${KIGITHUB}/Oscillators.pretty)(options \"\")(descr \"Precicision oscillator modules\"))\n (lib (name PFF_PSF_PSS_Leadforms)(type Github)(uri ${KIGITHUB}/PFF_PSF_PSS_Leadforms.pretty)(options \"\")(descr \"Allegro leadform packages\"))\n (lib (name Pin_Headers)(type Github)(uri ${KIGITHUB}/Pin_Headers.pretty)(options \"\")(descr \"Male pin headers\"))\n (lib (name Potentiometers)(type Github)(uri ${KIGITHUB}/Potentiometers.pretty)(options \"\")(descr \"Potentiometers / variable resistors\"))\n (lib (name Power_Integrations)(type Github)(uri ${KIGITHUB}/Power_Integrations.pretty)(options \"\")(descr \"Power Integrations footprints\"))\n (lib (name Relays_THT)(type Github)(uri ${KIGITHUB}/Relays_THT.pretty)(options \"\")(descr \"Through hole relay packages\"))\n (lib (name Resistors_SMD)(type Github)(uri ${KIGITHUB}/Resistors_SMD.pretty)(options \"\")(descr \"Resistors, surface mount\"))\n (lib (name Resistors_THT)(type Github)(uri ${KIGITHUB}/Resistors_THT.pretty)(options \"\")(descr \"Resistors, through hole\"))\n (lib (name Resistors_Universal)(type Github)(uri ${KIGITHUB}/Resistors_Universal.pretty)(options \"\")(descr Experimental))\n (lib (name RF_Modules)(type Github)(uri ${KIGITHUB}/RF_Modules.pretty)(options \"\")(descr \"Radio-frequency / wireless modules\"))\n (lib (name Shielding_Cabinets)(type Github)(uri ${KIGITHUB}/Shielding_Cabinets.pretty)(options \"\")(descr \"RF / EMI shields\"))\n (lib (name SMD_Packages)(type Github)(uri ${KIGITHUB}/SMD_Packages.pretty)(options \"\")(descr \"Various SMD packages. Read only - footprints will be moved to other libraries\"))\n (lib (name Sockets_MOLEX_KK-System)(type Github)(uri ${KIGITHUB}/Sockets_MOLEX_KK-System.pretty)(options \"\")(descr \"Deprecated - will be removed\"))\n (lib (name Socket_Strips)(type Github)(uri ${KIGITHUB}/Socket_Strips.pretty)(options \"\")(descr \"Female socket strips\"))\n (lib (name Sockets)(type Github)(uri ${KIGITHUB}/Sockets.pretty)(options \"\")(descr \"IC sockets\"))\n (lib (name Symbols)(type Github)(uri ${KIGITHUB}/Symbols.pretty)(options \"\")(descr \"PCB symbols\"))\n (lib (name TO_SOT_Packages_SMD)(type Github)(uri ${KIGITHUB}/TO_SOT_Packages_SMD.pretty)(options \"\")(descr \"Surface mount transistor packages\"))\n (lib (name TO_SOT_Packages_THT)(type Github)(uri ${KIGITHUB}/TO_SOT_Packages_THT.pretty)(options \"\")(descr \"Through hole transistor packages\"))\n (lib (name Transformers_CHK)(type Github)(uri ${KIGITHUB}/Transformers_CHK.pretty)(options \"\")(descr \"Deprecated - will be removed\"))\n (lib (name Transformers_SMD)(type Github)(uri ${KIGITHUB}/Transformers_SMD.pretty)(options \"\")(descr \"Surface mount transformers\"))\n (lib (name Transformers_SMPS_ThroughHole)(type Github)(uri ${KIGITHUB}/Transformers_SMPS_ThroughHole.pretty)(options \"\")(descr \"Deprecated - will be removed\"))\n (lib (name Transformers_THT)(type Github)(uri ${KIGITHUB}/Transformers_THT.pretty)(options \"\")(descr \"Through hole transformers\"))\n (lib (name Transistors_OldSowjetAera)(type Github)(uri ${KIGITHUB}/Transistors_OldSowjetAera.pretty)(options \"\")(descr \"Sowjet transistors\"))\n (lib (name Valves)(type Github)(uri ${KIGITHUB}/Valves.pretty)(options \"\")(descr \"Valves\"))\n (lib (name Varistors)(type Github)(uri ${KIGITHUB}/Varistors.pretty)(options \"\")(descr \"Varistors\"))\n (lib (name Wire_Connections_Bridges)(type Github)(uri ${KIGITHUB}/Wire_Connections_Bridges.pretty)(options \"\")(descr \"PCB bridging points\"))\n (lib (name Wire_Pads)(type Github)(uri ${KIGITHUB}/Wire_Pads.pretty)(options \"\")(descr \"Direct wire-to-board connection points\"))\n)\n" }, { "path": "src/test/resources/samples/langs/KiCad Layout/kivicad.kicad_wks", "content": "( page_layout\n ( setup (textsize 1.5 1.5) (linewidth 0.15) (textlinewidth 0.15) )\n ( rect (comment \"rect around the title block\") (linewidth 0.15) (start 110 34) (end 2 2) )\n ( rect (start 0 0 ltcorner) (end 0 0 rbcorner) (repeat 2) (incrx 2) (incry 2) )\n ( line (start 50 2 ltcorner) (end 50 0 ltcorner) (repeat 30) (incrx 50) )\n ( tbtext \"1\" (pos 25 1 ltcorner) (font (size 1.3 1.3))(repeat 100) (incrx 50) )\n ( line (start 50 2 lbcorner) (end 50 0 lbcorner) (repeat 30) (incrx 50) )\n ( tbtext \"1\" (pos 25 1 lbcorner) (font (size 1.3 1.3)) (repeat 100) (incrx 50) )\n ( line (start 0 50 ltcorner) (end 2 50 ltcorner) (repeat 30) (incry 50) )\n ( tbtext \"A\" (pos 1 25 ltcorner) (font (size 1.3 1.3))\n (justify center)(repeat 100) (incry 50) )\n ( line (start 0 50 rtcorner) (end 2 50 rtcorner) (repeat 30) (incry 50) )\n ( tbtext \"A\" (pos 1 25 rtcorner) (font (size 1.3 1.3))\n (justify center) (repeat 100) (incry 50) )\n ( tbtext \"Date: %D\" (pos 87 6.9) )\n ( line (start 110 5.5) (end 2 5.5) )\n ( tbtext \"%K\" (pos 109 4.1) (comment \"Kicad version\" ) )\n ( line (start 110 8.5) (end 2 8.5) )\n ( tbtext \"Rev: %R\" (pos 24 6.9)(font bold)(justify left) )\n ( tbtext \"Size: %Z\" (comment \"Paper format name\")(pos 109 6.9) )\n ( tbtext \"Id: %S/%N\" (comment \"Sheet id\")(pos 24 4.1) )\n ( line (start 110 12.5) (end 2 12.5) )\n ( tbtext \"Title: %T\" (pos 109 10.7)(font bold (size 2 2)) )\n ( tbtext \"File: %F\" (pos 109 14.3) )\n ( line (start 110 18.5) (end 2 18.5) )\n ( tbtext \"Sheet: %P\" (pos 109 17) )\n ( tbtext \"%Y\" (comment \"Company name\") (pos 109 20)(font bold) )\n ( tbtext \"%C0\" (comment \"Comment 0\") (pos 109 23) )\n ( tbtext \"%C1\" (comment \"Comment 1\") (pos 109 26) )\n ( tbtext \"%C2\" (comment \"Comment 2\") (pos 109 29) )\n ( tbtext \"%C3\" (comment \"Comment 3\") (pos 109 32) )\n ( line (start 90 8.5) (end 90 5.5) )\n ( line (start 26 8.5) (end 26 2) )\n)\n" }, { "path": "src/test/resources/samples/langs/KiCad Layout/nrf-bga.kicad_pcb", "content": "(kicad_pcb (version 4) (host pcbnew \"(2014-08-05 BZR 5054)-product\")\n\n (general\n (links 36)\n (no_connects 0)\n (area 146.9984 92.8984 164.465656 112.3572)\n (thickness 1.6)\n (drawings 0)\n (tracks 108)\n (zones 0)\n (modules 12)\n (nets 54)\n )\n\n (page A4)\n (layers\n (0 F.Cu signal)\n (31 B.Cu signal)\n (32 B.Adhes user)\n (33 F.Adhes user)\n (34 B.Paste user)\n (35 F.Paste user)\n (36 B.SilkS user)\n (37 F.SilkS user)\n (38 B.Mask user)\n (39 F.Mask user)\n (40 Dwgs.User user)\n (41 Cmts.User user)\n (42 Eco1.User user)\n (43 Eco2.User user)\n (44 Edge.Cuts user)\n (45 Margin user)\n (46 B.CrtYd user)\n (47 F.CrtYd user)\n (48 B.Fab user)\n (49 F.Fab user)\n )\n\n (setup\n (last_trace_width 0.1016)\n (trace_clearance 0.1016)\n (zone_clearance 0.2032)\n (zone_45_only no)\n (trace_min 0.1016)\n (segment_width 0.2)\n (edge_width 0.1)\n (via_size 0.889)\n (via_drill 0.635)\n (via_min_size 0.889)\n (via_min_drill 0.508)\n (uvia_size 0.508)\n (uvia_drill 0.127)\n (uvias_allowed no)\n (uvia_min_size 0.508)\n (uvia_min_drill 0.127)\n (pcb_text_width 0.3)\n (pcb_text_size 1.5 1.5)\n (mod_edge_width 0.15)\n (mod_text_size 1 1)\n (mod_text_width 0.15)\n (pad_size 0.2 0.2)\n (pad_drill 0)\n (pad_to_mask_clearance 0)\n (aux_axis_origin 0 0)\n (visible_elements FFFCFF7F)\n (pcbplotparams\n (layerselection 0x00000_00000001)\n (usegerberextensions false)\n (excludeedgelayer true)\n (linewidth 0.100000)\n (plotframeref false)\n (viasonmask false)\n (mode 1)\n (useauxorigin false)\n (hpglpennumber 1)\n (hpglpenspeed 20)\n (hpglpendiameter 15)\n (hpglpenoverlay 2)\n (psnegative false)\n (psa4output false)\n (plotreference true)\n (plotvalue true)\n (plotinvisibletext false)\n (padsonsilk false)\n (subtractmaskfromsilk false)\n (outputformat 5)\n (mirror true)\n (drillshape 0)\n (scaleselection 1)\n (outputdirectory pdfs/))\n )\n\n (net 0 \"\")\n (net 1 \"Net-(C1-Pad1)\")\n (net 2 GND)\n (net 3 \"Net-(C2-Pad1)\")\n (net 4 \"Net-(C3-Pad1)\")\n (net 5 \"Net-(C4-Pad2)\")\n (net 6 \"Net-(D1-Pad1)\")\n (net 7 +BATT)\n (net 8 SWDIO)\n (net 9 SWCLK)\n (net 10 LED)\n (net 11 \"Net-(U1-PadC1)\")\n (net 12 \"Net-(U1-PadD1)\")\n (net 13 \"Net-(U1-PadG1)\")\n (net 14 \"Net-(U1-PadE2)\")\n (net 15 \"Net-(U1-PadF2)\")\n (net 16 \"Net-(U1-PadG2)\")\n (net 17 \"Net-(U1-PadE3)\")\n (net 18 \"Net-(U1-PadF3)\")\n (net 19 \"Net-(U1-PadG3)\")\n (net 20 \"Net-(U1-PadH4)\")\n (net 21 \"Net-(U1-PadA5)\")\n (net 22 \"Net-(U1-PadB5)\")\n (net 23 \"Net-(U1-PadC5)\")\n (net 24 \"Net-(U1-PadH5)\")\n (net 25 \"Net-(U1-PadA6)\")\n (net 26 \"Net-(U1-PadB6)\")\n (net 27 \"Net-(U1-PadC6)\")\n (net 28 \"Net-(U1-PadH6)\")\n (net 29 \"Net-(U1-PadA7)\")\n (net 30 \"Net-(U1-PadB7)\")\n (net 31 \"Net-(U1-PadC7)\")\n (net 32 \"Net-(U1-PadE7)\")\n (net 33 \"Net-(U1-PadF7)\")\n (net 34 \"Net-(U1-PadG7)\")\n (net 35 \"Net-(U1-PadH7)\")\n (net 36 \"Net-(U1-PadA8)\")\n (net 37 \"Net-(U1-PadD8)\")\n (net 38 \"Net-(U1-PadE8)\")\n (net 39 \"Net-(U1-PadF8)\")\n (net 40 \"Net-(U1-PadG8)\")\n (net 41 \"Net-(U1-PadH8)\")\n (net 42 \"Net-(U1-PadE9)\")\n (net 43 \"Net-(U1-PadF9)\")\n (net 44 \"Net-(U1-PadH1)\")\n (net 45 \"Net-(U1-PadJ3)\")\n (net 46 \"Net-(U1-PadJ4)\")\n (net 47 \"Net-(U1-PadJ5)\")\n (net 48 \"Net-(U1-PadJ6)\")\n (net 49 \"Net-(U1-PadJ7)\")\n (net 50 \"Net-(U1-PadJ8)\")\n (net 51 \"Net-(U1-PadH9)\")\n (net 52 \"Net-(C5-Pad1)\")\n (net 53 \"Net-(ANT1-Pad2)\")\n\n (net_class Default \"This is the default net class.\"\n (clearance 0.1016)\n (trace_width 0.1016)\n (via_dia 0.889)\n (via_drill 0.635)\n (uvia_dia 0.508)\n (uvia_drill 0.127)\n (add_net +BATT)\n (add_net LED)\n (add_net \"Net-(C1-Pad1)\")\n (add_net \"Net-(C2-Pad1)\")\n (add_net \"Net-(C3-Pad1)\")\n (add_net \"Net-(C4-Pad2)\")\n (add_net \"Net-(C5-Pad1)\")\n (add_net \"Net-(D1-Pad1)\")\n (add_net \"Net-(U1-PadA5)\")\n (add_net \"Net-(U1-PadA6)\")\n (add_net \"Net-(U1-PadA7)\")\n (add_net \"Net-(U1-PadA8)\")\n (add_net \"Net-(U1-PadB5)\")\n (add_net \"Net-(U1-PadB6)\")\n (add_net \"Net-(U1-PadB7)\")\n (add_net \"Net-(U1-PadC1)\")\n (add_net \"Net-(U1-PadC5)\")\n (add_net \"Net-(U1-PadC6)\")\n (add_net \"Net-(U1-PadC7)\")\n (add_net \"Net-(U1-PadD1)\")\n (add_net \"Net-(U1-PadD8)\")\n (add_net \"Net-(U1-PadE2)\")\n (add_net \"Net-(U1-PadE3)\")\n (add_net \"Net-(U1-PadE7)\")\n (add_net \"Net-(U1-PadE8)\")\n (add_net \"Net-(U1-PadE9)\")\n (add_net \"Net-(U1-PadF2)\")\n (add_net \"Net-(U1-PadF3)\")\n (add_net \"Net-(U1-PadF7)\")\n (add_net \"Net-(U1-PadF8)\")\n (add_net \"Net-(U1-PadF9)\")\n (add_net \"Net-(U1-PadG1)\")\n (add_net \"Net-(U1-PadG2)\")\n (add_net \"Net-(U1-PadG3)\")\n (add_net \"Net-(U1-PadG7)\")\n (add_net \"Net-(U1-PadG8)\")\n (add_net \"Net-(U1-PadH1)\")\n (add_net \"Net-(U1-PadH4)\")\n (add_net \"Net-(U1-PadH5)\")\n (add_net \"Net-(U1-PadH6)\")\n (add_net \"Net-(U1-PadH7)\")\n (add_net \"Net-(U1-PadH8)\")\n (add_net \"Net-(U1-PadH9)\")\n (add_net \"Net-(U1-PadJ3)\")\n (add_net \"Net-(U1-PadJ4)\")\n (add_net \"Net-(U1-PadJ5)\")\n (add_net \"Net-(U1-PadJ6)\")\n (add_net \"Net-(U1-PadJ7)\")\n (add_net \"Net-(U1-PadJ8)\")\n (add_net SWCLK)\n (add_net SWDIO)\n )\n\n (net_class ANT \"\"\n (clearance 0.1016)\n (trace_width 0.254)\n (via_dia 0.889)\n (via_drill 0.635)\n (uvia_dia 0.508)\n (uvia_drill 0.127)\n (add_net GND)\n (add_net \"Net-(ANT1-Pad2)\")\n )\n\n (module Capacitors_SMD:C_0402 (layer F.Cu) (tedit 5415D599) (tstamp 54B59067)\n (at 153.75 102.5 270)\n (descr \"Capacitor SMD 0402, reflow soldering, AVX (see smccp.pdf)\")\n (tags \"capacitor 0402\")\n (path /54B59137)\n (attr smd)\n (fp_text reference C1 (at 0 -1.7 270) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 12p (at 0 1.7 270) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.15 -0.6) (end 1.15 -0.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.15 0.6) (end 1.15 0.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.15 -0.6) (end -1.15 0.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.15 -0.6) (end 1.15 0.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start 0.25 -0.475) (end -0.25 -0.475) (layer F.SilkS) (width 0.15))\n (fp_line (start -0.25 0.475) (end 0.25 0.475) (layer F.SilkS) (width 0.15))\n (pad 1 smd rect (at -0.55 0 270) (size 0.6 0.5) (layers F.Cu F.Paste F.Mask)\n (net 1 \"Net-(C1-Pad1)\"))\n (pad 2 smd rect (at 0.55 0 270) (size 0.6 0.5) (layers F.Cu F.Paste F.Mask)\n (net 2 GND))\n (model Capacitors_SMD/C_0402.wrl\n (at (xyz 0 0 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 0))\n )\n )\n\n (module Capacitors_SMD:C_0402 (layer F.Cu) (tedit 5415D599) (tstamp 54B58E0D)\n (at 159.004 100.711)\n (descr \"Capacitor SMD 0402, reflow soldering, AVX (see smccp.pdf)\")\n (tags \"capacitor 0402\")\n (path /54B591B6)\n (attr smd)\n (fp_text reference C2 (at 0 -1.7) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 12p (at 0 1.7) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.15 -0.6) (end 1.15 -0.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.15 0.6) (end 1.15 0.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.15 -0.6) (end -1.15 0.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.15 -0.6) (end 1.15 0.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start 0.25 -0.475) (end -0.25 -0.475) (layer F.SilkS) (width 0.15))\n (fp_line (start -0.25 0.475) (end 0.25 0.475) (layer F.SilkS) (width 0.15))\n (pad 1 smd rect (at -0.55 0) (size 0.6 0.5) (layers F.Cu F.Paste F.Mask)\n (net 3 \"Net-(C2-Pad1)\"))\n (pad 2 smd rect (at 0.55 0) (size 0.6 0.5) (layers F.Cu F.Paste F.Mask)\n (net 2 GND))\n (model Capacitors_SMD/C_0402.wrl\n (at (xyz 0 0 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 0))\n )\n )\n\n (module Capacitors_SMD:C_0402 (layer F.Cu) (tedit 5415D599) (tstamp 54B59E9D)\n (at 159.004 102.1588)\n (descr \"Capacitor SMD 0402, reflow soldering, AVX (see smccp.pdf)\")\n (tags \"capacitor 0402\")\n (path /54B58D67)\n (attr smd)\n (fp_text reference C3 (at 0 -1.7) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 100n (at 0 1.7) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.15 -0.6) (end 1.15 -0.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.15 0.6) (end 1.15 0.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.15 -0.6) (end -1.15 0.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.15 -0.6) (end 1.15 0.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start 0.25 -0.475) (end -0.25 -0.475) (layer F.SilkS) (width 0.15))\n (fp_line (start -0.25 0.475) (end 0.25 0.475) (layer F.SilkS) (width 0.15))\n (pad 1 smd rect (at -0.55 0) (size 0.6 0.5) (layers F.Cu F.Paste F.Mask)\n (net 4 \"Net-(C3-Pad1)\"))\n (pad 2 smd rect (at 0.55 0) (size 0.6 0.5) (layers F.Cu F.Paste F.Mask)\n (net 2 GND))\n (model Capacitors_SMD/C_0402.wrl\n (at (xyz 0 0 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 0))\n )\n )\n\n (module Capacitors_SMD:C_0402 (layer F.Cu) (tedit 5415D599) (tstamp 54B58E25)\n (at 154.15 106.55 90)\n (descr \"Capacitor SMD 0402, reflow soldering, AVX (see smccp.pdf)\")\n (tags \"capacitor 0402\")\n (path /54B58DD5)\n (attr smd)\n (fp_text reference C4 (at 0 -1.7 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 100n (at 0 1.7 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.15 -0.6) (end 1.15 -0.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.15 0.6) (end 1.15 0.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.15 -0.6) (end -1.15 0.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.15 -0.6) (end 1.15 0.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start 0.25 -0.475) (end -0.25 -0.475) (layer F.SilkS) (width 0.15))\n (fp_line (start -0.25 0.475) (end 0.25 0.475) (layer F.SilkS) (width 0.15))\n (pad 1 smd rect (at -0.55 0 90) (size 0.6 0.5) (layers F.Cu F.Paste F.Mask)\n (net 2 GND))\n (pad 2 smd rect (at 0.55 0 90) (size 0.6 0.5) (layers F.Cu F.Paste F.Mask)\n (net 5 \"Net-(C4-Pad2)\"))\n (model Capacitors_SMD/C_0402.wrl\n (at (xyz 0 0 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 0))\n )\n )\n\n (module SMD_Packages:SMD-0805 (layer F.Cu) (tedit 54B58D88) (tstamp 54B58E32)\n (at 162.0266 104.9782 90)\n (path /54B599BA)\n (attr smd)\n (fp_text reference D1 (at 0 -0.3175 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value LED (at 0 0.381 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_circle (center -1.651 0.762) (end -1.651 0.635) (layer F.SilkS) (width 0.15))\n (fp_line (start -0.508 0.762) (end -1.524 0.762) (layer F.SilkS) (width 0.15))\n (fp_line (start -1.524 0.762) (end -1.524 -0.762) (layer F.SilkS) (width 0.15))\n (fp_line (start -1.524 -0.762) (end -0.508 -0.762) (layer F.SilkS) (width 0.15))\n (fp_line (start 0.508 -0.762) (end 1.524 -0.762) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.524 -0.762) (end 1.524 0.762) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.524 0.762) (end 0.508 0.762) (layer F.SilkS) (width 0.15))\n (pad 1 smd rect (at -0.9525 0 90) (size 0.889 1.397) (layers F.Cu F.Paste F.Mask)\n (net 6 \"Net-(D1-Pad1)\"))\n (pad 2 smd rect (at 0.9525 0 90) (size 0.889 1.397) (layers F.Cu F.Paste F.Mask)\n (net 2 GND))\n (model SMD_Packages/SMD-0805.wrl\n (at (xyz 0 0 0))\n (scale (xyz 0.1000000014901161 0.1000000014901161 0.1000000014901161))\n (rotate (xyz 0 0 0))\n )\n )\n\n (module Pin_Headers:Pin_Header_Straight_1x04 (layer F.Cu) (tedit 54B58D8A) (tstamp 54B58E41)\n (at 156.7942 109.1946 180)\n (descr \"Through hole pin header\")\n (tags \"pin header\")\n (path /54B593BB)\n (fp_text reference P1 (at 0 -2.286 180) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value CONN_01X04 (at 0 0 180) (layer F.SilkS) hide\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -2.54 1.27) (end 5.08 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start -2.54 -1.27) (end 5.08 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start -5.08 -1.27) (end -2.54 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 5.08 1.27) (end 5.08 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start -2.54 -1.27) (end -2.54 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start -5.08 -1.27) (end -5.08 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start -5.08 1.27) (end -2.54 1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole rect (at -3.81 0 180) (size 1.7272 2.032) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 2 GND))\n (pad 2 thru_hole oval (at -1.27 0 180) (size 1.7272 2.032) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 7 +BATT))\n (pad 3 thru_hole oval (at 1.27 0 180) (size 1.7272 2.032) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 8 SWDIO))\n (pad 4 thru_hole oval (at 3.81 0 180) (size 1.7272 2.032) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 9 SWCLK))\n (model Pin_Headers/Pin_Header_Straight_1x04.wrl\n (at (xyz 0 0 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 0))\n )\n )\n\n (module Resistors_SMD:R_0603 (layer F.Cu) (tedit 5415CC62) (tstamp 54B59E20)\n (at 160.0454 105.0544 270)\n (descr \"Resistor SMD 0603, reflow soldering, Vishay (see dcrcw.pdf)\")\n (tags \"resistor 0603\")\n (path /54B59A45)\n (attr smd)\n (fp_text reference R1 (at 0 -1.9 270) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value R (at 0 1.9 270) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.3 -0.8) (end 1.3 -0.8) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.3 0.8) (end 1.3 0.8) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.3 -0.8) (end -1.3 0.8) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.3 -0.8) (end 1.3 0.8) (layer F.CrtYd) (width 0.05))\n (fp_line (start 0.5 0.675) (end -0.5 0.675) (layer F.SilkS) (width 0.15))\n (fp_line (start -0.5 -0.675) (end 0.5 -0.675) (layer F.SilkS) (width 0.15))\n (pad 1 smd rect (at -0.75 0 270) (size 0.5 0.9) (layers F.Cu F.Paste F.Mask)\n (net 10 LED))\n (pad 2 smd rect (at 0.75 0 270) (size 0.5 0.9) (layers F.Cu F.Paste F.Mask)\n (net 6 \"Net-(D1-Pad1)\"))\n (model Resistors_SMD/R_0603.wrl\n (at (xyz 0 0 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 0))\n )\n )\n\n (module Crystals_Oscillators_SMD:CX2520DB (layer F.Cu) (tedit 544FEDED) (tstamp 54B58E9A)\n (at 156.1084 101.3714)\n (path /54B5903E)\n (fp_text reference X1 (at 0 -2.25) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value CRYSTAL (at 0 2.5) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.25 1) (end 1.25 1) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.25 1) (end 1.25 -1) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.25 -1) (end -1.25 -1) (layer F.SilkS) (width 0.15))\n (fp_line (start -1.25 -1) (end -1.25 1) (layer F.SilkS) (width 0.15))\n (pad 1 smd rect (at -0.9 0.65) (size 1.2 1) (layers F.Cu F.Paste F.Mask)\n (net 1 \"Net-(C1-Pad1)\"))\n (pad 2 smd rect (at 0.9 -0.65) (size 1.2 1) (layers F.Cu F.Paste F.Mask)\n (net 3 \"Net-(C2-Pad1)\"))\n (pad 3 smd rect (at 0.9 0.65) (size 1.2 1) (layers F.Cu F.Paste F.Mask))\n (pad 4 smd rect (at -0.9 -0.65) (size 1.2 1) (layers F.Cu F.Paste F.Mask))\n )\n\n (module NRF51:WLCSP62 (layer F.Cu) (tedit 54B59368) (tstamp 54B59DAD)\n (at 156.9212 105.1306)\n (path /54B58C30)\n (fp_text reference U1 (at 0 3.2) (layer F.SilkS)\n (effects (font (size 1.2 1.2) (thickness 0.2)))\n )\n (fp_text value nRF51x22-CEAA (at 0 -3.2) (layer F.SilkS)\n (effects (font (size 1.2 1.2) (thickness 0.2)))\n )\n (fp_line (start -1.6 -2) (end -2 -1.6) (layer F.SilkS) (width 0.2))\n (fp_line (start -2 -1.6) (end -2 2) (layer F.SilkS) (width 0.2))\n (fp_line (start -2 2) (end 2 2) (layer F.SilkS) (width 0.2))\n (fp_line (start 2 2) (end 2 -2) (layer F.SilkS) (width 0.2))\n (fp_line (start 2 -2) (end -1.6 -2) (layer F.SilkS) (width 0.2))\n (pad A1 smd circle (at -1.6 -1.6) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 7 +BATT))\n (pad B1 smd circle (at -1.6 -1.2) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 2 GND))\n (pad C1 smd circle (at -1.6 -0.8) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 11 \"Net-(U1-PadC1)\"))\n (pad D1 smd circle (at -1.6 -0.4) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 12 \"Net-(U1-PadD1)\"))\n (pad E1 smd circle (at -1.6 0) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 52 \"Net-(C5-Pad1)\"))\n (pad F1 smd circle (at -1.6 0.4) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 5 \"Net-(C4-Pad2)\"))\n (pad G1 smd circle (at -1.6 0.8) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 13 \"Net-(U1-PadG1)\"))\n (pad H1 smd circle (at -1.6 1.2) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 44 \"Net-(U1-PadH1)\"))\n (pad A2 smd circle (at -1.2 -1.6) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 1 \"Net-(C1-Pad1)\"))\n (pad E2 smd circle (at -1.2 0) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 14 \"Net-(U1-PadE2)\"))\n (pad F2 smd circle (at -1.2 0.4) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 15 \"Net-(U1-PadF2)\"))\n (pad G2 smd circle (at -1.2 0.8) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 16 \"Net-(U1-PadG2)\"))\n (pad H2 smd circle (at -1.2 1.2) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 9 SWCLK))\n (pad J2 smd circle (at -1.2 1.6) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 8 SWDIO))\n (pad A3 smd circle (at -0.8 -1.6) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 3 \"Net-(C2-Pad1)\"))\n (pad E3 smd circle (at -0.8 0) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 17 \"Net-(U1-PadE3)\"))\n (pad F3 smd circle (at -0.8 0.4) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 18 \"Net-(U1-PadF3)\"))\n (pad G3 smd circle (at -0.8 0.8) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 19 \"Net-(U1-PadG3)\"))\n (pad H3 smd circle (at -0.8 1.2) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 2 GND))\n (pad J3 smd circle (at -0.8 1.6) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 45 \"Net-(U1-PadJ3)\"))\n (pad A4 smd circle (at -0.4 -1.6) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 4 \"Net-(C3-Pad1)\"))\n (pad B4 smd circle (at -0.4 -1.2) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 2 GND))\n (pad G4 smd circle (at -0.4 0.8) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 2 GND))\n (pad H4 smd circle (at -0.4 1.2) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 20 \"Net-(U1-PadH4)\"))\n (pad J4 smd circle (at -0.4 1.6) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 46 \"Net-(U1-PadJ4)\"))\n (pad A5 smd circle (at 0 -1.6) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 21 \"Net-(U1-PadA5)\"))\n (pad B5 smd circle (at 0 -1.2) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 22 \"Net-(U1-PadB5)\"))\n (pad C5 smd circle (at 0 -0.8) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 23 \"Net-(U1-PadC5)\"))\n (pad G5 smd circle (at 0 0.8) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 2 GND))\n (pad H5 smd circle (at 0 1.2) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 24 \"Net-(U1-PadH5)\"))\n (pad J5 smd circle (at 0 1.6) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 47 \"Net-(U1-PadJ5)\"))\n (pad A6 smd circle (at 0.4 -1.6) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 25 \"Net-(U1-PadA6)\"))\n (pad B6 smd circle (at 0.4 -1.2) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 26 \"Net-(U1-PadB6)\"))\n (pad C6 smd circle (at 0.4 -0.8) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 27 \"Net-(U1-PadC6)\"))\n (pad G6 smd circle (at 0.4 0.8) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 2 GND))\n (pad H6 smd circle (at 0.4 1.2) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 28 \"Net-(U1-PadH6)\"))\n (pad J6 smd circle (at 0.4 1.6) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 48 \"Net-(U1-PadJ6)\"))\n (pad A7 smd circle (at 0.8 -1.6) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 29 \"Net-(U1-PadA7)\"))\n (pad B7 smd circle (at 0.8 -1.2) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 30 \"Net-(U1-PadB7)\"))\n (pad C7 smd circle (at 0.8 -0.8) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 31 \"Net-(U1-PadC7)\"))\n (pad D7 smd circle (at 0.8 -0.4) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 2 GND))\n (pad E7 smd circle (at 0.8 0) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 32 \"Net-(U1-PadE7)\"))\n (pad F7 smd circle (at 0.8 0.4) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 33 \"Net-(U1-PadF7)\"))\n (pad G7 smd circle (at 0.8 0.8) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 34 \"Net-(U1-PadG7)\"))\n (pad H7 smd circle (at 0.8 1.2) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 35 \"Net-(U1-PadH7)\"))\n (pad J7 smd circle (at 0.8 1.6) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 49 \"Net-(U1-PadJ7)\"))\n (pad A8 smd circle (at 1.2 -1.6) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 36 \"Net-(U1-PadA8)\"))\n (pad B8 smd circle (at 1.2 -1.2) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 7 +BATT))\n (pad C8 smd circle (at 1.2 -0.8) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 2 GND))\n (pad D8 smd circle (at 1.2 -0.4) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 37 \"Net-(U1-PadD8)\"))\n (pad E8 smd circle (at 1.2 0) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 38 \"Net-(U1-PadE8)\"))\n (pad F8 smd circle (at 1.2 0.4) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 39 \"Net-(U1-PadF8)\"))\n (pad G8 smd circle (at 1.2 0.8) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 40 \"Net-(U1-PadG8)\"))\n (pad H8 smd circle (at 1.2 1.2) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 41 \"Net-(U1-PadH8)\"))\n (pad J8 smd circle (at 1.2 1.6) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 50 \"Net-(U1-PadJ8)\"))\n (pad A9 smd circle (at 1.6 -1.6) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask))\n (pad B9 smd circle (at 1.6 -1.2) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 7 +BATT))\n (pad C9 smd circle (at 1.6 -0.8) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 2 GND))\n (pad D9 smd circle (at 1.6 -0.4) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 10 LED))\n (pad E9 smd circle (at 1.6 0) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 42 \"Net-(U1-PadE9)\"))\n (pad F9 smd circle (at 1.6 0.4) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 43 \"Net-(U1-PadF9)\"))\n (pad G9 smd circle (at 1.6 0.8) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 2 GND))\n (pad H9 smd circle (at 1.6 1.2) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 51 \"Net-(U1-PadH9)\"))\n )\n\n (module Capacitors_SMD:C_0402 (layer F.Cu) (tedit 5415D599) (tstamp 55048D3E)\n (at 153 106.55 270)\n (descr \"Capacitor SMD 0402, reflow soldering, AVX (see smccp.pdf)\")\n (tags \"capacitor 0402\")\n (path /550483E1)\n (attr smd)\n (fp_text reference C5 (at 0 -1.7 270) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 2n2 (at 0 1.7 270) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.15 -0.6) (end 1.15 -0.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.15 0.6) (end 1.15 0.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.15 -0.6) (end -1.15 0.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.15 -0.6) (end 1.15 0.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start 0.25 -0.475) (end -0.25 -0.475) (layer F.SilkS) (width 0.15))\n (fp_line (start -0.25 0.475) (end 0.25 0.475) (layer F.SilkS) (width 0.15))\n (pad 1 smd rect (at -0.55 0 270) (size 0.6 0.5) (layers F.Cu F.Paste F.Mask)\n (net 52 \"Net-(C5-Pad1)\"))\n (pad 2 smd rect (at 0.55 0 270) (size 0.6 0.5) (layers F.Cu F.Paste F.Mask)\n (net 2 GND))\n (model Capacitors_SMD.3dshapes/C_0402.wrl\n (at (xyz 0 0 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 0))\n )\n )\n\n (module ANT:ANT-2.4GHz (layer F.Cu) (tedit 54517711) (tstamp 55049531)\n (at 149.35 106.95 90)\n (path /55047C3D)\n (fp_text reference ANT1 (at -2.5 1.5 90) (layer F.SilkS)\n (effects (font (size 0.4 0.4) (thickness 0.04)))\n )\n (fp_text value ANT-2.4GHz (at -2 2 90) (layer F.SilkS)\n (effects (font (size 0.4 0.4) (thickness 0.04)))\n )\n (pad 1 smd rect (at 0 0 90) (size 0.9 4.9) (layers F.Cu)\n (net 2 GND))\n (pad 3 smd rect (at 2.05 -2.7 90) (size 5 0.5) (layers F.Cu))\n (pad 2 smd rect (at 2.1 0 90) (size 0.5 4.9) (layers F.Cu)\n (net 53 \"Net-(ANT1-Pad2)\"))\n (pad 3 smd rect (at 4.3 -1.13 90) (size 0.5 2.64) (layers F.Cu))\n (pad 3 smd rect (at 6.8 -1.13 90) (size 0.5 2.64) (layers F.Cu))\n (pad 3 smd rect (at 5.55 -0.06 90) (size 2 0.5) (layers F.Cu))\n (pad 3 smd rect (at 7.9 -2.7 90) (size 2.7 0.5) (layers F.Cu))\n (pad 3 smd rect (at 12.6 -2.7 90) (size 2.7 0.5) (layers F.Cu))\n (pad 3 smd rect (at 9 -1.13 90) (size 0.5 2.64) (layers F.Cu))\n (pad 3 smd rect (at 11.5 -1.13 90) (size 0.5 2.64) (layers F.Cu))\n (pad 3 smd rect (at 10.25 -0.06 90) (size 2 0.5) (layers F.Cu))\n (pad 3 smd rect (at 13.7 -0.48 90) (size 0.5 3.94) (layers F.Cu))\n )\n\n (module NRF51:BAL-NRF02D3 (layer F.Cu) (tedit 550C7CF1) (tstamp 55048D47)\n (at 153.65 104.55 180)\n (path /550480A2)\n (fp_text reference U2 (at 0 1.95 180) (layer F.SilkS)\n (effects (font (size 1.2 1.2) (thickness 0.2)))\n )\n (fp_text value BAL-NRF02D3 (at 0 -1.95 180) (layer F.SilkS)\n (effects (font (size 1.2 1.2) (thickness 0.2)))\n )\n (fp_circle (center 0.75 -1.25) (end 1 -1.25) (layer F.SilkS) (width 0.15))\n (fp_line (start -1 -0.75) (end -1 0.75) (layer F.SilkS) (width 0.2))\n (fp_line (start -1 0.75) (end 1 0.75) (layer F.SilkS) (width 0.2))\n (fp_line (start 1 0.75) (end 1 -0.75) (layer F.SilkS) (width 0.2))\n (fp_line (start 1 -0.75) (end -1 -0.75) (layer F.SilkS) (width 0.2))\n (pad A3 smd circle (at -0.5 -0.25 180) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 12 \"Net-(U1-PadD1)\"))\n (pad B3 smd circle (at -0.5 0.25 180) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 11 \"Net-(U1-PadC1)\"))\n (pad A2 smd circle (at 0 -0.25 180) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 52 \"Net-(C5-Pad1)\"))\n (pad A1 smd circle (at 0.5 -0.25 180) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 53 \"Net-(ANT1-Pad2)\"))\n (pad B1 smd circle (at 0.5 0.25 180) (size 0.2 0.2) (layers F.Cu F.Paste F.Mask)\n (net 2 GND))\n )\n\n (segment (start 155.7212 102.5342) (end 155.2084 102.0214) (width 0.1016) (layer F.Cu) (net 1))\n (segment (start 155.7212 103.5306) (end 155.7212 102.5342) (width 0.1016) (layer F.Cu) (net 1))\n (segment (start 155.137 101.95) (end 155.2084 102.0214) (width 0.1016) (layer F.Cu) (net 1) (tstamp 55048FFD))\n (segment (start 153.75 101.95) (end 155.137 101.95) (width 0.1016) (layer F.Cu) (net 1))\n (segment (start 156.947646 104.7306) (end 156.7306 104.7306) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 156.7306 104.7306) (end 156.5212 104.5212) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 156.5212 104.5212) (end 156.5212 104.072021) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 156.5212 104.072021) (end 156.5212 103.9306) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 156.1212 106.3306) (end 156.5212 105.9306) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 156.5212 105.9306) (end 156.9212 105.9306) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 157.3212 105.9306) (end 156.9212 105.9306) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 157.7212 104.7306) (end 156.947646 104.7306) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 156.5212 103.9306) (end 155.3212 103.9306) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 156.9212 104.757046) (end 156.9212 105.9306) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 156.947646 104.7306) (end 156.9212 104.757046) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 157.7212 104.7306) (end 158.1212 104.3306) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 158.1212 104.3306) (end 158.5212 104.3306) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 161.2265 103.4796) (end 161.7726 104.0257) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 159.3722 103.4796) (end 161.2265 103.4796) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 161.7726 104.0257) (end 162.0266 104.0257) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 159.554 101.0626) (end 159.554 102.1588) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 159.554 100.711) (end 159.554 101.0626) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 159.3722 102.6922) (end 159.3722 103.4796) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 159.554 102.5104) (end 159.3722 102.6922) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 159.554 102.1588) (end 159.554 102.5104) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 159.3722 103.621021) (end 159.3722 103.4796) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 158.5212 104.3306) (end 158.662621 104.3306) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 158.662621 104.3306) (end 159.3722 103.621021) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 155.0306 103.9306) (end 154.15 103.05) (width 0.1016) (layer F.Cu) (net 2) (tstamp 55048FDD))\n (segment (start 154.15 103.05) (end 153.75 103.05) (width 0.1016) (layer F.Cu) (net 2) (tstamp 55048FEF))\n (segment (start 155.3212 103.9306) (end 155.0306 103.9306) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 154.15 107.1) (end 153 107.1) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 160.6042 108.3542) (end 160.6042 109.1946) (width 0.1016) (layer F.Cu) (net 2) (tstamp 5504935E))\n (segment (start 158.5212 105.9306) (end 159.05 105.9306) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 160.85 105.05) (end 159.4 105.05) (width 0.1016) (layer F.Cu) (net 2) (tstamp 55049373))\n (segment (start 159.4 105.05) (end 159.05 105.4) (width 0.1016) (layer F.Cu) (net 2) (tstamp 55049377))\n (segment (start 159.05 105.4) (end 159.05 105.9306) (width 0.1016) (layer F.Cu) (net 2) (tstamp 55049378))\n (segment (start 161.8743 104.0257) (end 160.85 105.05) (width 0.1016) (layer F.Cu) (net 2) (tstamp 55049366))\n (segment (start 162.0266 104.0257) (end 161.8743 104.0257) (width 0.1016) (layer F.Cu) (net 2))\n (segment (start 149.5 107.1) (end 149.35 106.95) (width 0.1016) (layer F.Cu) (net 2) (tstamp 5504964A) (status 30))\n (segment (start 149.5 107.1) (end 149.35 106.95) (width 0.254) (layer F.Cu) (net 2) (tstamp 5504967F) (status 30))\n (segment (start 153 107.1) (end 149.5 107.1) (width 0.254) (layer F.Cu) (net 2) (status 20))\n (segment (start 158.4436 100.7214) (end 158.454 100.711) (width 0.1016) (layer F.Cu) (net 3))\n (segment (start 157.0084 100.7214) (end 158.4436 100.7214) (width 0.1016) (layer F.Cu) (net 3))\n (segment (start 156.6786 100.7214) (end 157.0084 100.7214) (width 0.1016) (layer F.Cu) (net 3))\n (segment (start 156.1084 101.2916) (end 156.6786 100.7214) (width 0.1016) (layer F.Cu) (net 3))\n (segment (start 156.1084 103.5178) (end 156.1084 101.2916) (width 0.1016) (layer F.Cu) (net 3))\n (segment (start 156.1212 103.5306) (end 156.1084 103.5178) (width 0.1016) (layer F.Cu) (net 3))\n (segment (start 156.5212 103.389179) (end 157.014979 102.8954) (width 0.1016) (layer F.Cu) (net 4))\n (segment (start 156.5212 103.5306) (end 156.5212 103.389179) (width 0.1016) (layer F.Cu) (net 4))\n (segment (start 157.6674 102.8954) (end 158.404 102.1588) (width 0.1016) (layer F.Cu) (net 4))\n (segment (start 158.404 102.1588) (end 158.454 102.1588) (width 0.1016) (layer F.Cu) (net 4))\n (segment (start 157.014979 102.8954) (end 157.6674 102.8954) (width 0.1016) (layer F.Cu) (net 4))\n (segment (start 154.45 106) (end 154.9194 105.5306) (width 0.1016) (layer F.Cu) (net 5) (tstamp 5504901F))\n (segment (start 154.9194 105.5306) (end 155.3212 105.5306) (width 0.1016) (layer F.Cu) (net 5) (tstamp 55049021))\n (segment (start 154.15 106) (end 154.45 106) (width 0.1016) (layer F.Cu) (net 5))\n (segment (start 160.1717 105.9307) (end 160.0454 105.8044) (width 0.1016) (layer F.Cu) (net 6))\n (segment (start 162.0266 105.9307) (end 160.1717 105.9307) (width 0.1016) (layer F.Cu) (net 6))\n (segment (start 159 99.9) (end 159.05 99.9) (width 0.1016) (layer F.Cu) (net 7))\n (segment (start 159.35 99.6) (end 161.2 99.6) (width 0.1016) (layer F.Cu) (net 7))\n (segment (start 158.25 111.15) (end 158.0642 110.9642) (width 0.1016) (layer F.Cu) (net 7))\n (segment (start 159.05 99.9) (end 159.35 99.6) (width 0.1016) (layer F.Cu) (net 7))\n (segment (start 161.2 99.6) (end 163.35 101.75) (width 0.1016) (layer F.Cu) (net 7))\n (segment (start 163.35 101.75) (end 163.35 110.35) (width 0.1016) (layer F.Cu) (net 7))\n (segment (start 163.35 110.35) (end 162.55 111.15) (width 0.1016) (layer F.Cu) (net 7))\n (segment (start 158.0642 110.9642) (end 158.0642 109.1946) (width 0.1016) (layer F.Cu) (net 7))\n (segment (start 162.55 111.15) (end 158.25 111.15) (width 0.1016) (layer F.Cu) (net 7))\n (segment (start 158.5212 103.9306) (end 158.1212 103.9306) (width 0.1016) (layer F.Cu) (net 7))\n (segment (start 158.0642 109.347) (end 158.0642 109.1946) (width 0.1016) (layer F.Cu) (net 7))\n (segment (start 159 99.9) (end 159 103.593221) (width 0.1016) (layer F.Cu) (net 7))\n (segment (start 158.662621 103.9306) (end 158.5212 103.9306) (width 0.1016) (layer F.Cu) (net 7))\n (segment (start 154.1 99.6) (end 158.7 99.6) (width 0.1016) (layer F.Cu) (net 7))\n (segment (start 153 102.3) (end 153 100.7) (width 0.1016) (layer F.Cu) (net 7))\n (segment (start 153.2 102.5) (end 153 102.3) (width 0.1016) (layer F.Cu) (net 7))\n (segment (start 158.7 99.6) (end 159 99.9) (width 0.1016) (layer F.Cu) (net 7))\n (segment (start 154.2906 102.5) (end 153.2 102.5) (width 0.1016) (layer F.Cu) (net 7))\n (segment (start 159 103.593221) (end 158.662621 103.9306) (width 0.1016) (layer F.Cu) (net 7))\n (segment (start 153 100.7) (end 154.1 99.6) (width 0.1016) (layer F.Cu) (net 7))\n (segment (start 155.3212 103.5306) (end 154.2906 102.5) (width 0.1016) (layer F.Cu) (net 7))\n (segment (start 155.7212 108.9976) (end 155.5242 109.1946) (width 0.1016) (layer F.Cu) (net 8))\n (segment (start 155.7212 106.7306) (end 155.7212 108.9976) (width 0.1016) (layer F.Cu) (net 8))\n (segment (start 152.9842 109.0676) (end 152.9842 109.1946) (width 0.1016) (layer F.Cu) (net 9))\n (segment (start 152.9842 109.1946) (end 152.9842 109.0422) (width 0.1016) (layer F.Cu) (net 9))\n (segment (start 155.2018 106.85) (end 155.7212 106.3306) (width 0.1016) (layer F.Cu) (net 9) (tstamp 55049280))\n (segment (start 155.1 106.95) (end 155.2 106.85) (width 0.1016) (layer F.Cu) (net 9))\n (segment (start 155.1 107.35) (end 155.1 106.95) (width 0.1016) (layer F.Cu) (net 9))\n (segment (start 154.55 107.9) (end 155.1 107.35) (width 0.1016) (layer F.Cu) (net 9))\n (segment (start 154.1264 107.9) (end 154.55 107.9) (width 0.1016) (layer F.Cu) (net 9))\n (segment (start 152.9842 109.0422) (end 154.1264 107.9) (width 0.1016) (layer F.Cu) (net 9))\n (segment (start 155.2 106.85) (end 155.2018 106.85) (width 0.1016) (layer F.Cu) (net 9))\n (segment (start 160.0454 104.3044) (end 159.4938 104.3044) (width 0.1016) (layer F.Cu) (net 10))\n (segment (start 158.662621 104.7306) (end 158.5212 104.7306) (width 0.1016) (layer F.Cu) (net 10))\n (segment (start 159.0676 104.7306) (end 158.662621 104.7306) (width 0.1016) (layer F.Cu) (net 10))\n (segment (start 159.4938 104.3044) (end 159.0676 104.7306) (width 0.1016) (layer F.Cu) (net 10))\n (segment (start 154.1806 104.3306) (end 154.15 104.3) (width 0.1016) (layer F.Cu) (net 11) (tstamp 5504938B))\n (segment (start 155.3212 104.3306) (end 154.1806 104.3306) (width 0.1016) (layer F.Cu) (net 11))\n (segment (start 154.2194 104.7306) (end 154.15 104.8) (width 0.1016) (layer F.Cu) (net 12) (tstamp 55049388))\n (segment (start 155.3212 104.7306) (end 154.2194 104.7306) (width 0.1016) (layer F.Cu) (net 12))\n (segment (start 155.3212 105.1306) (end 154.7194 105.1306) (width 0.1016) (layer F.Cu) (net 52))\n (segment (start 154.7194 105.1306) (end 154.6 105.25) (width 0.1016) (layer F.Cu) (net 52))\n (segment (start 154.6 105.25) (end 153.65 105.25) (width 0.1016) (layer F.Cu) (net 52))\n (segment (start 153.65 105.25) (end 153.65 104.8) (width 0.1016) (layer F.Cu) (net 52) (tstamp 5504901A))\n (segment (start 153.6 105.3) (end 153.65 105.25) (width 0.1016) (layer F.Cu) (net 52) (tstamp 55049386))\n (segment (start 153 105.9) (end 153.6 105.3) (width 0.1016) (layer F.Cu) (net 52) (tstamp 55049018))\n (segment (start 153 106) (end 153 105.9) (width 0.1016) (layer F.Cu) (net 52))\n (segment (start 149.4 104.8) (end 149.35 104.85) (width 0.1016) (layer F.Cu) (net 53) (tstamp 55049543) (status 30))\n (segment (start 153.1 104.85) (end 153.15 104.8) (width 0.254) (layer F.Cu) (net 53) (tstamp 550495A4))\n (segment (start 149.35 104.85) (end 153.1 104.85) (width 0.254) (layer F.Cu) (net 53) (status 10))\n\n (zone (net 2) (net_name GND) (layer F.Cu) (tstamp 550C7F83) (hatch edge 0.508)\n (connect_pads (clearance 0.2032))\n (min_thickness 0.1524)\n (fill yes (arc_segments 16) (thermal_gap 0.2032) (thermal_bridge_width 0.15494) (smoothing chamfer) (radius 0.5))\n (polygon\n (pts\n (xy 164 111.85) (xy 151.5 111.85) (xy 151.5 97.15) (xy 164 97.15)\n )\n )\n (filled_polygon\n (pts\n (xy 163.9238 111.318437) (xy 163.468437 111.7738) (xy 152.031563 111.7738) (xy 151.5762 111.318437) (xy 151.5762 107.6794)\n (xy 151.744424 107.6794) (xy 151.855576 107.6794) (xy 151.958267 107.636864) (xy 152.036864 107.558267) (xy 152.0794 107.455576)\n (xy 152.0794 107.02112) (xy 152.00955 106.95127) (xy 151.5762 106.95127) (xy 151.5762 106.94873) (xy 152.00955 106.94873)\n (xy 152.0794 106.87888) (xy 152.0794 106.444424) (xy 152.036864 106.341733) (xy 151.958267 106.263136) (xy 151.855576 106.2206)\n (xy 151.744424 106.2206) (xy 151.5762 106.2206) (xy 151.5762 105.3794) (xy 151.855576 105.3794) (xy 151.958267 105.336864)\n (xy 152.036864 105.258267) (xy 152.037637 105.2564) (xy 153.1 105.2564) (xy 153.195652 105.237373) (xy 153.012426 105.4206)\n (xy 152.694424 105.4206) (xy 152.591733 105.463136) (xy 152.513136 105.541733) (xy 152.4706 105.644424) (xy 152.4706 105.755576)\n (xy 152.4706 106.355576) (xy 152.513136 106.458267) (xy 152.591733 106.536864) (xy 152.623446 106.55) (xy 152.591733 106.563136)\n (xy 152.513136 106.641733) (xy 152.4706 106.744424) (xy 152.4706 107.02888) (xy 152.54045 107.09873) (xy 152.99873 107.09873)\n (xy 152.99873 107.07873) (xy 153.00127 107.07873) (xy 153.00127 107.09873) (xy 153.45955 107.09873) (xy 153.5294 107.02888)\n (xy 153.5294 106.744424) (xy 153.486864 106.641733) (xy 153.408267 106.563136) (xy 153.376553 106.55) (xy 153.408267 106.536864)\n (xy 153.486864 106.458267) (xy 153.5294 106.355576) (xy 153.5294 106.244424) (xy 153.5294 105.837574) (xy 153.6206 105.746374)\n (xy 153.6206 105.755576) (xy 153.6206 106.355576) (xy 153.663136 106.458267) (xy 153.741733 106.536864) (xy 153.773446 106.55)\n (xy 153.741733 106.563136) (xy 153.663136 106.641733) (xy 153.6206 106.744424) (xy 153.6206 107.02888) (xy 153.69045 107.09873)\n (xy 154.14873 107.09873) (xy 154.14873 107.07873) (xy 154.15127 107.07873) (xy 154.15127 107.09873) (xy 154.60955 107.09873)\n (xy 154.6794 107.02888) (xy 154.6794 106.744424) (xy 154.636864 106.641733) (xy 154.558267 106.563136) (xy 154.526553 106.55)\n (xy 154.558267 106.536864) (xy 154.636864 106.458267) (xy 154.6794 106.355576) (xy 154.6794 106.244424) (xy 154.6794 106.236217)\n (xy 154.683487 106.233487) (xy 154.7968 106.120174) (xy 154.7968 106.634168) (xy 154.872829 106.710197) (xy 154.866513 106.716513)\n (xy 154.794935 106.823638) (xy 154.7698 106.95) (xy 154.7698 107.213226) (xy 154.6794 107.303626) (xy 154.6794 107.17112)\n (xy 154.60955 107.10127) (xy 154.15127 107.10127) (xy 154.15127 107.12127) (xy 154.14873 107.12127) (xy 154.14873 107.10127)\n (xy 153.69045 107.10127) (xy 153.6206 107.17112) (xy 153.6206 107.455576) (xy 153.663136 107.558267) (xy 153.741733 107.636864)\n (xy 153.844424 107.6794) (xy 153.880026 107.6794) (xy 153.5294 108.030025) (xy 153.5294 107.455576) (xy 153.5294 107.17112)\n (xy 153.45955 107.10127) (xy 153.00127 107.10127) (xy 153.00127 107.60955) (xy 153.07112 107.6794) (xy 153.194424 107.6794)\n (xy 153.305576 107.6794) (xy 153.408267 107.636864) (xy 153.486864 107.558267) (xy 153.5294 107.455576) (xy 153.5294 108.030025)\n (xy 153.527705 108.03172) (xy 153.421607 107.960828) (xy 152.99873 107.876712) (xy 152.99873 107.60955) (xy 152.99873 107.10127)\n (xy 152.54045 107.10127) (xy 152.4706 107.17112) (xy 152.4706 107.455576) (xy 152.513136 107.558267) (xy 152.591733 107.636864)\n (xy 152.694424 107.6794) (xy 152.805576 107.6794) (xy 152.92888 107.6794) (xy 152.99873 107.60955) (xy 152.99873 107.876712)\n (xy 152.9842 107.873822) (xy 152.546793 107.960828) (xy 152.175977 108.208599) (xy 151.928206 108.579415) (xy 151.8412 109.016822)\n (xy 151.8412 109.372378) (xy 151.928206 109.809785) (xy 152.175977 110.180601) (xy 152.546793 110.428372) (xy 152.9842 110.515378)\n (xy 153.421607 110.428372) (xy 153.792423 110.180601) (xy 154.040194 109.809785) (xy 154.1272 109.372378) (xy 154.1272 109.016822)\n (xy 154.040194 108.579415) (xy 153.989631 108.503742) (xy 154.263173 108.2302) (xy 154.55 108.2302) (xy 154.676362 108.205065)\n (xy 154.783487 108.133487) (xy 155.333483 107.583489) (xy 155.333486 107.583487) (xy 155.333487 107.583487) (xy 155.391 107.497411)\n (xy 155.391 107.900317) (xy 155.086793 107.960828) (xy 154.715977 108.208599) (xy 154.468206 108.579415) (xy 154.3812 109.016822)\n (xy 154.3812 109.372378) (xy 154.468206 109.809785) (xy 154.715977 110.180601) (xy 155.086793 110.428372) (xy 155.5242 110.515378)\n (xy 155.961607 110.428372) (xy 156.332423 110.180601) (xy 156.580194 109.809785) (xy 156.6672 109.372378) (xy 156.6672 109.016822)\n (xy 156.580194 108.579415) (xy 156.332423 108.208599) (xy 156.0514 108.020825) (xy 156.0514 107.2532) (xy 158.434168 107.2532)\n (xy 159.0532 106.634168) (xy 159.0532 105.0608) (xy 159.0676 105.0608) (xy 159.193962 105.035665) (xy 159.301087 104.964087)\n (xy 159.463138 104.802035) (xy 159.539824 104.8338) (xy 159.650976 104.8338) (xy 160.550976 104.8338) (xy 160.653667 104.791264)\n (xy 160.732264 104.712667) (xy 160.7748 104.609976) (xy 160.7748 104.498824) (xy 160.7748 103.998824) (xy 160.732264 103.896133)\n (xy 160.653667 103.817536) (xy 160.550976 103.775) (xy 160.439824 103.775) (xy 160.1334 103.775) (xy 160.1334 102.464376)\n (xy 160.1334 102.353224) (xy 160.1334 102.22992) (xy 160.1334 102.08768) (xy 160.1334 101.964376) (xy 160.1334 101.853224)\n (xy 160.1334 101.016576) (xy 160.1334 100.905424) (xy 160.1334 100.78212) (xy 160.1334 100.63988) (xy 160.1334 100.516576)\n (xy 160.1334 100.405424) (xy 160.090864 100.302733) (xy 160.012267 100.224136) (xy 159.909576 100.1816) (xy 159.62512 100.1816)\n (xy 159.55527 100.25145) (xy 159.55527 100.70973) (xy 160.06355 100.70973) (xy 160.1334 100.63988) (xy 160.1334 100.78212)\n (xy 160.06355 100.71227) (xy 159.55527 100.71227) (xy 159.55527 101.17055) (xy 159.62512 101.2404) (xy 159.909576 101.2404)\n (xy 160.012267 101.197864) (xy 160.090864 101.119267) (xy 160.1334 101.016576) (xy 160.1334 101.853224) (xy 160.090864 101.750533)\n (xy 160.012267 101.671936) (xy 159.909576 101.6294) (xy 159.62512 101.6294) (xy 159.55527 101.69925) (xy 159.55527 102.15753)\n (xy 160.06355 102.15753) (xy 160.1334 102.08768) (xy 160.1334 102.22992) (xy 160.06355 102.16007) (xy 159.55527 102.16007)\n (xy 159.55527 102.61835) (xy 159.62512 102.6882) (xy 159.909576 102.6882) (xy 160.012267 102.645664) (xy 160.090864 102.567067)\n (xy 160.1334 102.464376) (xy 160.1334 103.775) (xy 159.539824 103.775) (xy 159.437133 103.817536) (xy 159.358536 103.896133)\n (xy 159.316 103.998824) (xy 159.316 104.033704) (xy 159.260313 104.070913) (xy 159.0532 104.278026) (xy 159.0532 104.006995)\n (xy 159.233487 103.826708) (xy 159.305065 103.719583) (xy 159.3302 103.593221) (xy 159.330201 103.593221) (xy 159.3302 103.593215)\n (xy 159.3302 102.6882) (xy 159.48288 102.6882) (xy 159.55273 102.61835) (xy 159.55273 102.16007) (xy 159.53273 102.16007)\n (xy 159.53273 102.15753) (xy 159.55273 102.15753) (xy 159.55273 101.69925) (xy 159.48288 101.6294) (xy 159.3302 101.6294)\n (xy 159.3302 101.2404) (xy 159.48288 101.2404) (xy 159.55273 101.17055) (xy 159.55273 100.71227) (xy 159.53273 100.71227)\n (xy 159.53273 100.70973) (xy 159.55273 100.70973) (xy 159.55273 100.25145) (xy 159.48288 100.1816) (xy 159.3302 100.1816)\n (xy 159.3302 100.086774) (xy 159.486774 99.9302) (xy 161.063226 99.9302) (xy 163.0198 101.886774) (xy 163.0198 110.213226)\n (xy 163.0045 110.228526) (xy 163.0045 106.430776) (xy 163.0045 106.319624) (xy 163.0045 105.430624) (xy 163.0045 104.525776)\n (xy 163.0045 104.09682) (xy 163.0045 103.95458) (xy 163.0045 103.525624) (xy 162.961964 103.422933) (xy 162.883367 103.344336)\n (xy 162.780676 103.3018) (xy 162.669524 103.3018) (xy 162.09772 103.3018) (xy 162.02787 103.37165) (xy 162.02787 104.02443)\n (xy 162.93465 104.02443) (xy 163.0045 103.95458) (xy 163.0045 104.09682) (xy 162.93465 104.02697) (xy 162.02787 104.02697)\n (xy 162.02787 104.67975) (xy 162.09772 104.7496) (xy 162.669524 104.7496) (xy 162.780676 104.7496) (xy 162.883367 104.707064)\n (xy 162.961964 104.628467) (xy 163.0045 104.525776) (xy 163.0045 105.430624) (xy 162.961964 105.327933) (xy 162.883367 105.249336)\n (xy 162.780676 105.2068) (xy 162.669524 105.2068) (xy 162.02533 105.2068) (xy 162.02533 104.67975) (xy 162.02533 104.02697)\n (xy 162.02533 104.02443) (xy 162.02533 103.37165) (xy 161.95548 103.3018) (xy 161.383676 103.3018) (xy 161.272524 103.3018)\n (xy 161.169833 103.344336) (xy 161.091236 103.422933) (xy 161.0487 103.525624) (xy 161.0487 103.95458) (xy 161.11855 104.02443)\n (xy 162.02533 104.02443) (xy 162.02533 104.02697) (xy 161.11855 104.02697) (xy 161.0487 104.09682) (xy 161.0487 104.525776)\n (xy 161.091236 104.628467) (xy 161.169833 104.707064) (xy 161.272524 104.7496) (xy 161.383676 104.7496) (xy 161.95548 104.7496)\n (xy 162.02533 104.67975) (xy 162.02533 105.2068) (xy 161.272524 105.2068) (xy 161.169833 105.249336) (xy 161.091236 105.327933)\n (xy 161.0487 105.430624) (xy 161.0487 105.541776) (xy 161.0487 105.6005) (xy 160.7748 105.6005) (xy 160.7748 105.498824)\n (xy 160.732264 105.396133) (xy 160.653667 105.317536) (xy 160.550976 105.275) (xy 160.439824 105.275) (xy 159.539824 105.275)\n (xy 159.437133 105.317536) (xy 159.358536 105.396133) (xy 159.316 105.498824) (xy 159.316 105.609976) (xy 159.316 106.109976)\n (xy 159.358536 106.212667) (xy 159.437133 106.291264) (xy 159.539824 106.3338) (xy 159.650976 106.3338) (xy 160.550976 106.3338)\n (xy 160.653667 106.291264) (xy 160.684031 106.2609) (xy 161.0487 106.2609) (xy 161.0487 106.430776) (xy 161.091236 106.533467)\n (xy 161.169833 106.612064) (xy 161.272524 106.6546) (xy 161.383676 106.6546) (xy 162.780676 106.6546) (xy 162.883367 106.612064)\n (xy 162.961964 106.533467) (xy 163.0045 106.430776) (xy 163.0045 110.228526) (xy 162.413226 110.8198) (xy 161.7472 110.8198)\n (xy 161.7472 110.266176) (xy 161.7472 110.155024) (xy 161.7472 109.26572) (xy 161.7472 109.12348) (xy 161.7472 108.234176)\n (xy 161.7472 108.123024) (xy 161.704664 108.020333) (xy 161.626067 107.941736) (xy 161.523376 107.8992) (xy 160.67532 107.8992)\n (xy 160.60547 107.96905) (xy 160.60547 109.19333) (xy 161.67735 109.19333) (xy 161.7472 109.12348) (xy 161.7472 109.26572)\n (xy 161.67735 109.19587) (xy 160.60547 109.19587) (xy 160.60547 110.42015) (xy 160.67532 110.49) (xy 161.523376 110.49)\n (xy 161.626067 110.447464) (xy 161.704664 110.368867) (xy 161.7472 110.266176) (xy 161.7472 110.8198) (xy 160.60293 110.8198)\n (xy 160.60293 110.42015) (xy 160.60293 109.19587) (xy 160.60293 109.19333) (xy 160.60293 107.96905) (xy 160.53308 107.8992)\n (xy 159.685024 107.8992) (xy 159.582333 107.941736) (xy 159.503736 108.020333) (xy 159.4612 108.123024) (xy 159.4612 108.234176)\n (xy 159.4612 109.12348) (xy 159.53105 109.19333) (xy 160.60293 109.19333) (xy 160.60293 109.19587) (xy 159.53105 109.19587)\n (xy 159.4612 109.26572) (xy 159.4612 110.155024) (xy 159.4612 110.266176) (xy 159.503736 110.368867) (xy 159.582333 110.447464)\n (xy 159.685024 110.49) (xy 160.53308 110.49) (xy 160.60293 110.42015) (xy 160.60293 110.8198) (xy 158.3944 110.8198)\n (xy 158.3944 110.449696) (xy 158.501607 110.428372) (xy 158.872423 110.180601) (xy 159.120194 109.809785) (xy 159.2072 109.372378)\n (xy 159.2072 109.016822) (xy 159.120194 108.579415) (xy 158.872423 108.208599) (xy 158.501607 107.960828) (xy 158.0642 107.873822)\n (xy 157.626793 107.960828) (xy 157.255977 108.208599) (xy 157.008206 108.579415) (xy 156.9212 109.016822) (xy 156.9212 109.372378)\n (xy 157.008206 109.809785) (xy 157.255977 110.180601) (xy 157.626793 110.428372) (xy 157.734 110.449696) (xy 157.734 110.9642)\n (xy 157.759135 111.090562) (xy 157.830713 111.197687) (xy 158.016513 111.383487) (xy 158.123638 111.455065) (xy 158.25 111.480201)\n (xy 158.25 111.4802) (xy 158.250005 111.4802) (xy 162.55 111.4802) (xy 162.676362 111.455065) (xy 162.783487 111.383487)\n (xy 163.583487 110.583487) (xy 163.655065 110.476362) (xy 163.6802 110.35) (xy 163.680201 110.35) (xy 163.6802 110.349994)\n (xy 163.6802 101.75) (xy 163.655065 101.623638) (xy 163.583487 101.516513) (xy 161.433487 99.366513) (xy 161.326362 99.294935)\n (xy 161.2 99.2698) (xy 159.35 99.2698) (xy 159.223638 99.294935) (xy 159.116513 99.366513) (xy 159.025 99.458026)\n (xy 158.933487 99.366513) (xy 158.826362 99.294935) (xy 158.7 99.2698) (xy 154.100005 99.2698) (xy 154.1 99.269799)\n (xy 153.973638 99.294935) (xy 153.866513 99.366513) (xy 152.766513 100.466513) (xy 152.694935 100.573638) (xy 152.6698 100.7)\n (xy 152.6698 102.3) (xy 152.694935 102.426362) (xy 152.766513 102.533487) (xy 152.96651 102.733483) (xy 152.966513 102.733487)\n (xy 152.966514 102.733487) (xy 153.073638 102.805065) (xy 153.2 102.830201) (xy 153.2 102.8302) (xy 153.200005 102.8302)\n (xy 153.2206 102.8302) (xy 153.2206 102.97888) (xy 153.29045 103.04873) (xy 153.74873 103.04873) (xy 153.74873 103.02873)\n (xy 153.75127 103.02873) (xy 153.75127 103.04873) (xy 154.20955 103.04873) (xy 154.2794 102.97888) (xy 154.2794 102.955773)\n (xy 154.868129 103.544502) (xy 154.7968 103.615832) (xy 154.7968 104.0004) (xy 154.387007 104.0004) (xy 154.365194 103.978548)\n (xy 154.2794 103.942923) (xy 154.2794 103.405576) (xy 154.2794 103.12112) (xy 154.20955 103.05127) (xy 153.75127 103.05127)\n (xy 153.75127 103.55955) (xy 153.82112 103.6294) (xy 153.944424 103.6294) (xy 154.055576 103.6294) (xy 154.158267 103.586864)\n (xy 154.236864 103.508267) (xy 154.2794 103.405576) (xy 154.2794 103.942923) (xy 154.225798 103.920666) (xy 154.074864 103.920534)\n (xy 153.935368 103.978173) (xy 153.887912 104.025544) (xy 153.74873 103.886362) (xy 153.74873 103.55955) (xy 153.74873 103.05127)\n (xy 153.29045 103.05127) (xy 153.2206 103.12112) (xy 153.2206 103.405576) (xy 153.263136 103.508267) (xy 153.341733 103.586864)\n (xy 153.444424 103.6294) (xy 153.555576 103.6294) (xy 153.67888 103.6294) (xy 153.74873 103.55955) (xy 153.74873 103.886362)\n (xy 153.675 103.812632) (xy 153.412173 104.075458) (xy 153.376346 104.076713) (xy 153.376346 103.986301) (xy 153.239069 103.92356)\n (xy 153.088231 103.91813) (xy 152.946798 103.970835) (xy 152.923654 103.986301) (xy 152.926759 104.074963) (xy 153.15 104.298204)\n (xy 153.373241 104.074963) (xy 153.376346 103.986301) (xy 153.376346 104.076713) (xy 153.375037 104.076759) (xy 153.151796 104.3)\n (xy 153.165938 104.314142) (xy 153.164142 104.315938) (xy 153.15 104.301796) (xy 153.135857 104.315938) (xy 153.134061 104.314142)\n (xy 153.148204 104.3) (xy 152.924963 104.076759) (xy 152.836301 104.073654) (xy 152.77356 104.210931) (xy 152.76813 104.361769)\n (xy 152.798624 104.4436) (xy 152.037637 104.4436) (xy 152.036864 104.441733) (xy 151.958267 104.363136) (xy 151.855576 104.3206)\n (xy 151.744424 104.3206) (xy 151.5762 104.3206) (xy 151.5762 97.681563) (xy 152.031563 97.2262) (xy 163.468437 97.2262)\n (xy 163.9238 97.681563) (xy 163.9238 111.318437)\n )\n )\n )\n (zone (net 0) (net_name \"\") (layer F.Cu) (tstamp 550C7E3B) (hatch edge 0.508)\n (connect_pads (clearance 0.2032))\n (min_thickness 0.1524)\n (keepout (tracks allowed) (vias allowed) (copperpour not_allowed))\n (fill yes (arc_segments 16) (thermal_gap 0.2032) (thermal_bridge_width 0.15494) (smoothing chamfer) (radius 0.5))\n (polygon\n (pts\n (xy 153.9 104.55) (xy 153.45 104.55) (xy 153.45 104.1) (xy 153.9 104.1)\n )\n )\n )\n (zone (net 0) (net_name \"\") (layer F.Cu) (tstamp 550C7E43) (hatch edge 0.508)\n (connect_pads (clearance 0.2032))\n (min_thickness 0.1524)\n (keepout (tracks allowed) (vias allowed) (copperpour not_allowed))\n (fill yes (arc_segments 16) (thermal_gap 0.2032) (thermal_bridge_width 0.15494) (smoothing chamfer) (radius 0.5))\n (polygon\n (pts\n (xy 158.85 107.05) (xy 155 107.05) (xy 155 103.2) (xy 158.85 103.2)\n )\n )\n )\n)\n" }, { "path": "src/test/resources/samples/langs/KiCad Layout/simonShield.kicad_pcb", "content": "(kicad_pcb (version 4) (host pcbnew 4.0.6-e0-6349~53~ubuntu16.04.1)\n\n (general\n (links 89)\n (no_connects 5)\n (area 66.924999 42.174999 151.204428 107.575001)\n (thickness 1.6)\n (drawings 25)\n (tracks 443)\n (zones 0)\n (modules 46)\n (nets 98)\n )\n\n (page A4 portrait)\n (title_block\n (title \"Poncho Juego Simon EDU-CIAA NXP\")\n (date 2016-07-14)\n (rev 1.0)\n (company \"Proyecto CIAA\")\n (comment 1 \"Juan Agustin Bassi\")\n (comment 2 \"Diseño PCB - CESE\")\n (comment 3 \"Licencia BSD\")\n )\n\n (layers\n (0 F.Cu signal)\n (31 B.Cu signal)\n (32 B.Adhes user hide)\n (33 F.Adhes user hide)\n (34 B.Paste user hide)\n (35 F.Paste user hide)\n (36 B.SilkS user hide)\n (37 F.SilkS user)\n (38 B.Mask user hide)\n (39 F.Mask user hide)\n (40 Dwgs.User user hide)\n (41 Cmts.User user hide)\n (42 Eco1.User user hide)\n (43 Eco2.User user hide)\n (44 Edge.Cuts user)\n (45 Margin user hide)\n (46 B.CrtYd user)\n (47 F.CrtYd user)\n (48 B.Fab user)\n (49 F.Fab user)\n )\n\n (setup\n (last_trace_width 1.2)\n (user_trace_width 0.3)\n (user_trace_width 0.45)\n (user_trace_width 0.6)\n (user_trace_width 0.9)\n (user_trace_width 1.2)\n (user_trace_width 1.5)\n (trace_clearance 0.3)\n (zone_clearance 0.5)\n (zone_45_only yes)\n (trace_min 0.3)\n (segment_width 0.2)\n (edge_width 0.15)\n (via_size 1.27)\n (via_drill 0.7112)\n (via_min_size 1.27)\n (via_min_drill 0.7112)\n (user_via 1.27 0.7112)\n (uvia_size 0.508)\n (uvia_drill 0.254)\n (uvias_allowed no)\n (uvia_min_size 0.508)\n (uvia_min_drill 0.254)\n (pcb_text_width 0.3)\n (pcb_text_size 1.5 1.5)\n (mod_edge_width 0.15)\n (mod_text_size 1 1)\n (mod_text_width 0.15)\n (pad_size 1.524 1.524)\n (pad_drill 0.762)\n (pad_to_mask_clearance 0.2)\n (aux_axis_origin 0 0)\n (visible_elements 7FFDD7EF)\n (pcbplotparams\n (layerselection 0x00020_80000000)\n (usegerberextensions false)\n (excludeedgelayer false)\n (linewidth 0.100000)\n (plotframeref false)\n (viasonmask false)\n (mode 1)\n (useauxorigin false)\n (hpglpennumber 1)\n (hpglpenspeed 20)\n (hpglpendiameter 15)\n (hpglpenoverlay 2)\n (psnegative false)\n (psa4output false)\n (plotreference false)\n (plotvalue false)\n (plotinvisibletext false)\n (padsonsilk true)\n (subtractmaskfromsilk false)\n (outputformat 4)\n (mirror false)\n (drillshape 1)\n (scaleselection 1)\n (outputdirectory \"\"))\n )\n\n (net 0 \"\")\n (net 1 GND)\n (net 2 \"Net-(D1-Pad2)\")\n (net 3 \"Net-(D2-Pad2)\")\n (net 4 \"Net-(D4-Pad2)\")\n (net 5 \"Net-(Q1-Pad2)\")\n (net 6 \"Net-(Q1-Pad3)\")\n (net 7 \"Net-(Q2-Pad2)\")\n (net 8 \"Net-(Q2-Pad1)\")\n (net 9 \"Net-(Q3-Pad2)\")\n (net 10 \"Net-(Q3-Pad1)\")\n (net 11 \"Net-(Q5-Pad2)\")\n (net 12 \"Net-(Q5-Pad1)\")\n (net 13 /buttons/BTN_LED_1)\n (net 14 /buttons/BTN_CFG_1)\n (net 15 /buttons/BTN_LED_2)\n (net 16 /buttons/BTN_CFG_2)\n (net 17 /buttons/BTN_CFG_3)\n (net 18 /buttons/BTN_LED_4)\n (net 19 \"Net-(Q1-Pad1)\")\n (net 20 \"Net-(D3-Pad2)\")\n (net 21 \"Net-(Q4-Pad2)\")\n (net 22 \"Net-(Q4-Pad1)\")\n (net 23 /buttons/BTN_LED_3)\n (net 24 /buttons/BTN_CFG_4)\n (net 25 \"Net-(P1-Pad1)\")\n (net 26 \"Net-(P1-Pad3)\")\n (net 27 /ciaaConector/LED_1)\n (net 28 /ciaaConector/LED_2)\n (net 29 /ciaaConector/LED_3)\n (net 30 /ciaaConector/LED_4)\n (net 31 /ciaaConector/PWM)\n (net 32 VCC)\n (net 33 \"Net-(F1-Pad1)\")\n (net 34 \"Net-(F2-Pad1)\")\n (net 35 \"Net-(F3-Pad1)\")\n (net 36 \"Net-(XA1-Pad1)\")\n (net 37 \"Net-(XA1-Pad2)\")\n (net 38 \"Net-(XA1-Pad11)\")\n (net 39 \"Net-(XA1-Pad4)\")\n (net 40 \"Net-(XA1-Pad13)\")\n (net 41 \"Net-(XA1-Pad6)\")\n (net 42 \"Net-(XA1-Pad15)\")\n (net 43 \"Net-(XA1-Pad8)\")\n (net 44 \"Net-(XA1-Pad17)\")\n (net 45 \"Net-(XA1-Pad10)\")\n (net 46 \"Net-(XA1-Pad19)\")\n (net 47 \"Net-(XA1-Pad12)\")\n (net 48 \"Net-(XA1-Pad21)\")\n (net 49 \"Net-(XA1-Pad14)\")\n (net 50 \"Net-(XA1-Pad23)\")\n (net 51 \"Net-(XA1-Pad16)\")\n (net 52 \"Net-(XA1-Pad25)\")\n (net 53 \"Net-(XA1-Pad18)\")\n (net 54 \"Net-(XA1-Pad27)\")\n (net 55 \"Net-(XA1-Pad20)\")\n (net 56 \"Net-(XA1-Pad29)\")\n (net 57 \"Net-(XA1-Pad22)\")\n (net 58 \"Net-(XA1-Pad31)\")\n (net 59 \"Net-(XA1-Pad24)\")\n (net 60 \"Net-(XA1-Pad26)\")\n (net 61 \"Net-(XA1-Pad33)\")\n (net 62 \"Net-(XA1-Pad28)\")\n (net 63 \"Net-(XA1-Pad32)\")\n (net 64 \"Net-(XA1-Pad34)\")\n (net 65 \"Net-(XA1-Pad36)\")\n (net 66 \"Net-(XA1-Pad38)\")\n (net 67 \"Net-(XA1-Pad35)\")\n (net 68 \"Net-(XA1-Pad37)\")\n (net 69 \"Net-(XA1-Pad3)\")\n (net 70 \"Net-(XA1-Pad5)\")\n (net 71 \"Net-(XA1-Pad7)\")\n (net 72 \"Net-(XA1-Pad9)\")\n (net 73 \"Net-(XA1-Pad39)\")\n (net 74 \"Net-(XA1-Pad40)\")\n (net 75 \"Net-(XA1-Pad30)\")\n (net 76 \"Net-(XA1-Pad44)\")\n (net 77 \"Net-(XA1-Pad45)\")\n (net 78 \"Net-(XA1-Pad46)\")\n (net 79 \"Net-(XA1-Pad47)\")\n (net 80 \"Net-(XA1-Pad48)\")\n (net 81 \"Net-(XA1-Pad50)\")\n (net 82 \"Net-(XA1-Pad51)\")\n (net 83 \"Net-(XA1-Pad52)\")\n (net 84 \"Net-(XA1-Pad53)\")\n (net 85 \"Net-(XA1-Pad54)\")\n (net 86 \"Net-(XA1-Pad55)\")\n (net 87 \"Net-(XA1-Pad56)\")\n (net 88 \"Net-(XA1-Pad57)\")\n (net 89 \"Net-(XA1-Pad59)\")\n (net 90 \"Net-(XA1-Pad61)\")\n (net 91 \"Net-(XA1-Pad63)\")\n (net 92 \"Net-(XA1-Pad65)\")\n (net 93 \"Net-(XA1-Pad67)\")\n (net 94 \"Net-(XA1-Pad69)\")\n (net 95 \"Net-(XA1-Pad70)\")\n (net 96 \"Net-(XA1-Pad71)\")\n (net 97 \"Net-(XA1-Pad72)\")\n\n (net_class Default \"This is the default net class.\"\n (clearance 0.3)\n (trace_width 0.3)\n (via_dia 1.27)\n (via_drill 0.7112)\n (uvia_dia 0.508)\n (uvia_drill 0.254)\n (add_net /buttons/BTN_CFG_1)\n (add_net /buttons/BTN_CFG_2)\n (add_net /buttons/BTN_CFG_3)\n (add_net /buttons/BTN_CFG_4)\n (add_net /buttons/BTN_LED_1)\n (add_net /buttons/BTN_LED_2)\n (add_net /buttons/BTN_LED_3)\n (add_net /buttons/BTN_LED_4)\n (add_net /ciaaConector/LED_1)\n (add_net /ciaaConector/LED_2)\n (add_net /ciaaConector/LED_3)\n (add_net /ciaaConector/LED_4)\n (add_net /ciaaConector/PWM)\n (add_net GND)\n (add_net \"Net-(D1-Pad2)\")\n (add_net \"Net-(D2-Pad2)\")\n (add_net \"Net-(D3-Pad2)\")\n (add_net \"Net-(D4-Pad2)\")\n (add_net \"Net-(F1-Pad1)\")\n (add_net \"Net-(F2-Pad1)\")\n (add_net \"Net-(F3-Pad1)\")\n (add_net \"Net-(P1-Pad1)\")\n (add_net \"Net-(P1-Pad3)\")\n (add_net \"Net-(Q1-Pad1)\")\n (add_net \"Net-(Q1-Pad2)\")\n (add_net \"Net-(Q1-Pad3)\")\n (add_net \"Net-(Q2-Pad1)\")\n (add_net \"Net-(Q2-Pad2)\")\n (add_net \"Net-(Q3-Pad1)\")\n (add_net \"Net-(Q3-Pad2)\")\n (add_net \"Net-(Q4-Pad1)\")\n (add_net \"Net-(Q4-Pad2)\")\n (add_net \"Net-(Q5-Pad1)\")\n (add_net \"Net-(Q5-Pad2)\")\n (add_net \"Net-(XA1-Pad1)\")\n (add_net \"Net-(XA1-Pad10)\")\n (add_net \"Net-(XA1-Pad11)\")\n (add_net \"Net-(XA1-Pad12)\")\n (add_net \"Net-(XA1-Pad13)\")\n (add_net \"Net-(XA1-Pad14)\")\n (add_net \"Net-(XA1-Pad15)\")\n (add_net \"Net-(XA1-Pad16)\")\n (add_net \"Net-(XA1-Pad17)\")\n (add_net \"Net-(XA1-Pad18)\")\n (add_net \"Net-(XA1-Pad19)\")\n (add_net \"Net-(XA1-Pad2)\")\n (add_net \"Net-(XA1-Pad20)\")\n (add_net \"Net-(XA1-Pad21)\")\n (add_net \"Net-(XA1-Pad22)\")\n (add_net \"Net-(XA1-Pad23)\")\n (add_net \"Net-(XA1-Pad24)\")\n (add_net \"Net-(XA1-Pad25)\")\n (add_net \"Net-(XA1-Pad26)\")\n (add_net \"Net-(XA1-Pad27)\")\n (add_net \"Net-(XA1-Pad28)\")\n (add_net \"Net-(XA1-Pad29)\")\n (add_net \"Net-(XA1-Pad3)\")\n (add_net \"Net-(XA1-Pad30)\")\n (add_net \"Net-(XA1-Pad31)\")\n (add_net \"Net-(XA1-Pad32)\")\n (add_net \"Net-(XA1-Pad33)\")\n (add_net \"Net-(XA1-Pad34)\")\n (add_net \"Net-(XA1-Pad35)\")\n (add_net \"Net-(XA1-Pad36)\")\n (add_net \"Net-(XA1-Pad37)\")\n (add_net \"Net-(XA1-Pad38)\")\n (add_net \"Net-(XA1-Pad39)\")\n (add_net \"Net-(XA1-Pad4)\")\n (add_net \"Net-(XA1-Pad40)\")\n (add_net \"Net-(XA1-Pad44)\")\n (add_net \"Net-(XA1-Pad45)\")\n (add_net \"Net-(XA1-Pad46)\")\n (add_net \"Net-(XA1-Pad47)\")\n (add_net \"Net-(XA1-Pad48)\")\n (add_net \"Net-(XA1-Pad5)\")\n (add_net \"Net-(XA1-Pad50)\")\n (add_net \"Net-(XA1-Pad51)\")\n (add_net \"Net-(XA1-Pad52)\")\n (add_net \"Net-(XA1-Pad53)\")\n (add_net \"Net-(XA1-Pad54)\")\n (add_net \"Net-(XA1-Pad55)\")\n (add_net \"Net-(XA1-Pad56)\")\n (add_net \"Net-(XA1-Pad57)\")\n (add_net \"Net-(XA1-Pad59)\")\n (add_net \"Net-(XA1-Pad6)\")\n (add_net \"Net-(XA1-Pad61)\")\n (add_net \"Net-(XA1-Pad63)\")\n (add_net \"Net-(XA1-Pad65)\")\n (add_net \"Net-(XA1-Pad67)\")\n (add_net \"Net-(XA1-Pad69)\")\n (add_net \"Net-(XA1-Pad7)\")\n (add_net \"Net-(XA1-Pad70)\")\n (add_net \"Net-(XA1-Pad71)\")\n (add_net \"Net-(XA1-Pad72)\")\n (add_net \"Net-(XA1-Pad8)\")\n (add_net \"Net-(XA1-Pad9)\")\n (add_net VCC)\n )\n\n (module simonShield:MagneticBuzzer_ProSignal_ABT-410-RC (layer F.Cu) (tedit 544E5504) (tstamp 5957451D)\n (at 111.178971 53.624429 180)\n (descr \"Buzzer, Elektromagnetic Beeper, Summer, 1,5V-DC,\")\n (tags \"Pro Signal, ABT-410-RC,\")\n (path /5797F3F6)\n (fp_text reference U1 (at 3.175 -8.001 180) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value BUZZER (at 2.17424 8.001 180) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start 8.17626 -0.50038) (end 8.17626 0.50038) (layer F.SilkS) (width 0.15))\n (fp_line (start 7.67588 0) (end 8.6741 0) (layer F.SilkS) (width 0.15))\n (fp_circle (center 3.175 0) (end 4.17576 0) (layer F.SilkS) (width 0.15))\n (fp_text user + (at 10.67562 0 180) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_circle (center 3.175 0) (end 9.37514 0) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 0 0 180) (size 1.6002 1.6002) (drill 1.00076) (layers *.Cu *.Mask F.SilkS)\n (net 6 \"Net-(Q1-Pad3)\"))\n (pad 2 thru_hole circle (at 6.35 0 180) (size 1.6002 1.6002) (drill 1.00076) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n (model Buzzers_Beepers.3dshapes/MagneticBuzzer_ProSignal_ABT-410-RC.wrl\n (at (xyz 0 0 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 0))\n )\n )\n\n (module simonShield:SW_PUSH_SMALL (layer F.Cu) (tedit 0) (tstamp 59574511)\n (at 112.877 94.402 270)\n (path /5777D5BA/5777DCA9)\n (fp_text reference SW8 (at 0 -0.762 270) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value SW_PUSH (at 0 1.016 270) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_circle (center 0 0) (end 0 -2.54) (layer F.SilkS) (width 0.15))\n (fp_line (start -3.81 -3.81) (end 3.81 -3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 -3.81) (end 3.81 3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start -3.81 -3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 3.81 -2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 24 /buttons/BTN_CFG_4))\n (pad 2 thru_hole circle (at 3.81 2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n (pad 1 thru_hole circle (at -3.81 -2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 24 /buttons/BTN_CFG_4))\n (pad 2 thru_hole circle (at -3.81 2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n )\n\n (module simonShield:SW_PUSH_SMALL (layer F.Cu) (tedit 0) (tstamp 59574505)\n (at 124.053 94.402 270)\n (path /5777D5BA/5777DC21)\n (fp_text reference SW7 (at 0 -0.762 270) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value SW_PUSH (at 0 1.016 270) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_circle (center 0 0) (end 0 -2.54) (layer F.SilkS) (width 0.15))\n (fp_line (start -3.81 -3.81) (end 3.81 -3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 -3.81) (end 3.81 3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start -3.81 -3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 3.81 -2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 18 /buttons/BTN_LED_4))\n (pad 2 thru_hole circle (at 3.81 2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n (pad 1 thru_hole circle (at -3.81 -2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 18 /buttons/BTN_LED_4))\n (pad 2 thru_hole circle (at -3.81 2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n )\n\n (module simonShield:SW_PUSH_SMALL (layer F.Cu) (tedit 0) (tstamp 595744F9)\n (at 93.827 94.529 90)\n (path /5777D5BA/5777DC87)\n (fp_text reference SW6 (at 0 -0.762 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value SW_PUSH (at 0 1.016 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_circle (center 0 0) (end 0 -2.54) (layer F.SilkS) (width 0.15))\n (fp_line (start -3.81 -3.81) (end 3.81 -3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 -3.81) (end 3.81 3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start -3.81 -3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 3.81 -2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 17 /buttons/BTN_CFG_3))\n (pad 2 thru_hole circle (at 3.81 2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n (pad 1 thru_hole circle (at -3.81 -2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 17 /buttons/BTN_CFG_3))\n (pad 2 thru_hole circle (at -3.81 2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n )\n\n (module simonShield:SW_PUSH_SMALL (layer F.Cu) (tedit 0) (tstamp 595744ED)\n (at 105.003 94.529 90)\n (path /5777D5BA/5777DBFF)\n (fp_text reference SW5 (at 0 -0.762 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value SW_PUSH (at 0 1.016 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_circle (center 0 0) (end 0 -2.54) (layer F.SilkS) (width 0.15))\n (fp_line (start -3.81 -3.81) (end 3.81 -3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 -3.81) (end 3.81 3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start -3.81 -3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 3.81 -2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 23 /buttons/BTN_LED_3))\n (pad 2 thru_hole circle (at 3.81 2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n (pad 1 thru_hole circle (at -3.81 -2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 23 /buttons/BTN_LED_3))\n (pad 2 thru_hole circle (at -3.81 2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n )\n\n (module simonShield:SW_PUSH_SMALL (layer F.Cu) (tedit 0) (tstamp 595744E1)\n (at 112.877 71.034 270)\n (path /5777D5BA/5777DC65)\n (fp_text reference SW4 (at 0 -0.762 270) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value SW_PUSH (at 0 1.016 270) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_circle (center 0 0) (end 0 -2.54) (layer F.SilkS) (width 0.15))\n (fp_line (start -3.81 -3.81) (end 3.81 -3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 -3.81) (end 3.81 3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start -3.81 -3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 3.81 -2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 16 /buttons/BTN_CFG_2))\n (pad 2 thru_hole circle (at 3.81 2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n (pad 1 thru_hole circle (at -3.81 -2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 16 /buttons/BTN_CFG_2))\n (pad 2 thru_hole circle (at -3.81 2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n )\n\n (module simonShield:SW_PUSH_SMALL (layer F.Cu) (tedit 0) (tstamp 595744D5)\n (at 124.053 71.034 270)\n (path /5777D5BA/5777DBDD)\n (fp_text reference SW3 (at 0 -0.762 270) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value SW_PUSH (at 0 1.016 270) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_circle (center 0 0) (end 0 -2.54) (layer F.SilkS) (width 0.15))\n (fp_line (start -3.81 -3.81) (end 3.81 -3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 -3.81) (end 3.81 3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start -3.81 -3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 3.81 -2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 15 /buttons/BTN_LED_2))\n (pad 2 thru_hole circle (at 3.81 2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n (pad 1 thru_hole circle (at -3.81 -2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 15 /buttons/BTN_LED_2))\n (pad 2 thru_hole circle (at -3.81 2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n )\n\n (module simonShield:SW_PUSH_SMALL (layer F.Cu) (tedit 0) (tstamp 595744C9)\n (at 105.003 71.034 90)\n (path /5777D5BA/5777DC43)\n (fp_text reference SW2 (at 0 -0.762 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value SW_PUSH (at 0 1.016 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_circle (center 0 0) (end 0 -2.54) (layer F.SilkS) (width 0.15))\n (fp_line (start -3.81 -3.81) (end 3.81 -3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 -3.81) (end 3.81 3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start -3.81 -3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 3.81 -2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 14 /buttons/BTN_CFG_1))\n (pad 2 thru_hole circle (at 3.81 2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n (pad 1 thru_hole circle (at -3.81 -2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 14 /buttons/BTN_CFG_1))\n (pad 2 thru_hole circle (at -3.81 2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n )\n\n (module simonShield:SW_PUSH_SMALL (layer F.Cu) (tedit 0) (tstamp 595744BD)\n (at 93.827 71.034 90)\n (path /5777D5BA/5777DBBB)\n (fp_text reference SW1 (at 0 -0.762 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value SW_PUSH (at 0 1.016 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_circle (center 0 0) (end 0 -2.54) (layer F.SilkS) (width 0.15))\n (fp_line (start -3.81 -3.81) (end 3.81 -3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 -3.81) (end 3.81 3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start -3.81 -3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 3.81 -2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 13 /buttons/BTN_LED_1))\n (pad 2 thru_hole circle (at 3.81 2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n (pad 1 thru_hole circle (at -3.81 -2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 13 /buttons/BTN_LED_1))\n (pad 2 thru_hole circle (at -3.81 2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n )\n\n (module Resistors_THT:R_Axial_DIN0207_L6.3mm_D2.5mm_P10.16mm_Horizontal (layer F.Cu) (tedit 59573715) (tstamp 595744A8)\n (at 109 88.5 90)\n (descr \"Resistor, Axial_DIN0207 series, Axial, Horizontal, pin pitch=10.16mm, 0.25W = 1/4W, length*diameter=6.3*2.5mm^2, http://cdn-reichelt.de/documents/datenblatt/B400/1_4W%23YAG.pdf\")\n (tags \"Resistor Axial_DIN0207 series Axial Horizontal pin pitch 10.16mm 0.25W = 1/4W length 6.3mm diameter 2.5mm\")\n (path /59572DE1)\n (fp_text reference \"R 0 Ohm\" (at 5.25 3.25 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value R (at 5.08 2.31 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start 1.93 -1.25) (end 1.93 1.25) (layer F.Fab) (width 0.1))\n (fp_line (start 1.93 1.25) (end 8.23 1.25) (layer F.Fab) (width 0.1))\n (fp_line (start 8.23 1.25) (end 8.23 -1.25) (layer F.Fab) (width 0.1))\n (fp_line (start 8.23 -1.25) (end 1.93 -1.25) (layer F.Fab) (width 0.1))\n (fp_line (start 0 0) (end 1.93 0) (layer F.Fab) (width 0.1))\n (fp_line (start 10.16 0) (end 8.23 0) (layer F.Fab) (width 0.1))\n (fp_line (start 1.87 -1.31) (end 1.87 1.31) (layer F.SilkS) (width 0.12))\n (fp_line (start 1.87 1.31) (end 8.29 1.31) (layer F.SilkS) (width 0.12))\n (fp_line (start 8.29 1.31) (end 8.29 -1.31) (layer F.SilkS) (width 0.12))\n (fp_line (start 8.29 -1.31) (end 1.87 -1.31) (layer F.SilkS) (width 0.12))\n (fp_line (start 0.98 0) (end 1.87 0) (layer F.SilkS) (width 0.12))\n (fp_line (start 9.18 0) (end 8.29 0) (layer F.SilkS) (width 0.12))\n (fp_line (start -1.05 -1.6) (end -1.05 1.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.05 1.6) (end 11.25 1.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start 11.25 1.6) (end 11.25 -1.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start 11.25 -1.6) (end -1.05 -1.6) (layer F.CrtYd) (width 0.05))\n (pad 1 thru_hole circle (at 0 0 90) (size 1.6 1.6) (drill 0.8) (layers *.Cu *.Mask)\n (net 1 GND))\n (pad 2 thru_hole oval (at 10.16 0 90) (size 1.6 1.6) (drill 0.8) (layers *.Cu *.Mask)\n (net 1 GND))\n (model Resistors_THT.3dshapes/R_Axial_DIN0207_L6.3mm_D2.5mm_P10.16mm_Horizontal.wrl\n (at (xyz 0 0 0))\n (scale (xyz 0.393701 0.393701 0.393701))\n (rotate (xyz 0 0 0))\n )\n )\n\n (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 5957367C) (tstamp 5957449B)\n (at 137.515 98.085 90)\n (descr \"Resistor, Axial, RM 7.62mm, 1/3W,\")\n (tags \"Resistor Axial RM 7.62mm 1/3W R3\")\n (path /57780685/57797248)\n (fp_text reference R18 (at 3.585 -0.015 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 680 (at 3.81 3.81 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 12 \"Net-(Q5-Pad1)\"))\n (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 32 VCC))\n )\n\n (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 59573680) (tstamp 5957448E)\n (at 133.959 98.085 90)\n (descr \"Resistor, Axial, RM 7.62mm, 1/3W,\")\n (tags \"Resistor Axial RM 7.62mm 1/3W R3\")\n (path /57780685/577970B7)\n (fp_text reference R17 (at 3.585 0.041 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 10K (at 3.81 3.81 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 30 /ciaaConector/LED_4))\n (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 11 \"Net-(Q5-Pad2)\"))\n )\n\n (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 5957362E) (tstamp 59574481)\n (at 80.365 97.958 90)\n (descr \"Resistor, Axial, RM 7.62mm, 1/3W,\")\n (tags \"Resistor Axial RM 7.62mm 1/3W R3\")\n (path /57780685/577971BC)\n (fp_text reference R16 (at 3.958 -0.115 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 680 (at 3.81 3.81 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 22 \"Net-(Q4-Pad1)\"))\n (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 32 VCC))\n )\n\n (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 59573629) (tstamp 59574474)\n (at 83.921 97.958 90)\n (descr \"Resistor, Axial, RM 7.62mm, 1/3W,\")\n (tags \"Resistor Axial RM 7.62mm 1/3W R3\")\n (path /57780685/5779705E)\n (fp_text reference R15 (at 3.458 -0.171 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 10K (at 3.81 3.81 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 29 /ciaaConector/LED_3))\n (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 21 \"Net-(Q4-Pad2)\"))\n )\n\n (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 59573694) (tstamp 59574467)\n (at 137.515 74.717 90)\n (descr \"Resistor, Axial, RM 7.62mm, 1/3W,\")\n (tags \"Resistor Axial RM 7.62mm 1/3W R3\")\n (path /57780685/57797169)\n (fp_text reference R14 (at 3.967 -0.015 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 680 (at 3.81 3.81 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 10 \"Net-(Q3-Pad1)\"))\n (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 32 VCC))\n )\n\n (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 59573698) (tstamp 5957445A)\n (at 134.086 74.717 90)\n (descr \"Resistor, Axial, RM 7.62mm, 1/3W,\")\n (tags \"Resistor Axial RM 7.62mm 1/3W R3\")\n (path /57780685/57796FE6)\n (fp_text reference R13 (at 3.967 0.164 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 10K (at 3.81 3.81 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 28 /ciaaConector/LED_2))\n (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 9 \"Net-(Q3-Pad2)\"))\n )\n\n (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 5957364F) (tstamp 5957444D)\n (at 80.365 74.717 90)\n (descr \"Resistor, Axial, RM 7.62mm, 1/3W,\")\n (tags \"Resistor Axial RM 7.62mm 1/3W R3\")\n (path /57780685/57780BC7)\n (fp_text reference R12 (at 3.967 -0.115 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 680 (at 3.81 3.81 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 8 \"Net-(Q2-Pad1)\"))\n (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 32 VCC))\n )\n\n (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 5957364C) (tstamp 59574440)\n (at 83.921 74.717 90)\n (descr \"Resistor, Axial, RM 7.62mm, 1/3W,\")\n (tags \"Resistor Axial RM 7.62mm 1/3W R3\")\n (path /57780685/57780BCE)\n (fp_text reference R11 (at 3.967 -0.171 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 10K (at 3.81 3.81 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 27 /ciaaConector/LED_1))\n (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 7 \"Net-(Q2-Pad2)\"))\n )\n\n (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 595735F8) (tstamp 59574433)\n (at 123.164 49.063 180)\n (descr \"Resistor, Axial, RM 7.62mm, 1/3W,\")\n (tags \"Resistor Axial RM 7.62mm 1/3W R3\")\n (path /5797F41B)\n (fp_text reference R10 (at 3.914 0.063 180) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 1K (at 3.81 3.81 180) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 0 0 180) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 32 VCC))\n (pad 2 thru_hole circle (at 7.62 0 180) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 19 \"Net-(Q1-Pad1)\"))\n )\n\n (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 595735FE) (tstamp 59574426)\n (at 123.164 52.111 180)\n (descr \"Resistor, Axial, RM 7.62mm, 1/3W,\")\n (tags \"Resistor Axial RM 7.62mm 1/3W R3\")\n (path /5797F406)\n (fp_text reference R9 (at 3.914 0.111 180) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 3K3 (at 3.81 3.81 180) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 0 0 180) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 5 \"Net-(Q1-Pad2)\"))\n (pad 2 thru_hole circle (at 7.62 0 180) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 31 /ciaaConector/PWM))\n )\n\n (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 5957363D) (tstamp 59574419)\n (at 118.465 98.339 90)\n (descr \"Resistor, Axial, RM 7.62mm, 1/3W,\")\n (tags \"Resistor Axial RM 7.62mm 1/3W R3\")\n (path /5777D5BA/57796AEC)\n (fp_text reference R8 (at 3.839 0.035 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 3K3 (at 3.81 3.81 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 24 /buttons/BTN_CFG_4))\n (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 32 VCC))\n )\n\n (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 59573684) (tstamp 5957440C)\n (at 129.641 98.085 90)\n (descr \"Resistor, Axial, RM 7.62mm, 1/3W,\")\n (tags \"Resistor Axial RM 7.62mm 1/3W R3\")\n (path /5777D5BA/577968BC)\n (fp_text reference R7 (at 3.835 0.109 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 3K3 (at 3.81 3.81 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 18 /buttons/BTN_LED_4))\n (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 32 VCC))\n )\n\n (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 59573623) (tstamp 595743FF)\n (at 88.239 97.958 90)\n (descr \"Resistor, Axial, RM 7.62mm, 1/3W,\")\n (tags \"Resistor Axial RM 7.62mm 1/3W R3\")\n (path /5777D5BA/57796A6F)\n (fp_text reference R6 (at 4.208 0.011 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 3K3 (at 3.81 3.81 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 17 /buttons/BTN_CFG_3))\n (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 32 VCC))\n )\n\n (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 59573637) (tstamp 595743F2)\n (at 99.415 98.466 90)\n (descr \"Resistor, Axial, RM 7.62mm, 1/3W,\")\n (tags \"Resistor Axial RM 7.62mm 1/3W R3\")\n (path /5777D5BA/57796847)\n (fp_text reference R5 (at 3.966 0.085 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 3K3 (at 3.81 3.81 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 23 /buttons/BTN_LED_3))\n (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 32 VCC))\n )\n\n (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 5957369C) (tstamp 595743E5)\n (at 129.641 74.717 90)\n (descr \"Resistor, Axial, RM 7.62mm, 1/3W,\")\n (tags \"Resistor Axial RM 7.62mm 1/3W R3\")\n (path /5777D5BA/577967E7)\n (fp_text reference R3 (at 3.717 0.109 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 3K3 (at 3.81 3.81 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 15 /buttons/BTN_LED_2))\n (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 32 VCC))\n )\n\n (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 59573654) (tstamp 595743D8)\n (at 99.415 74.844 90)\n (descr \"Resistor, Axial, RM 7.62mm, 1/3W,\")\n (tags \"Resistor Axial RM 7.62mm 1/3W R3\")\n (path /5777D5BA/5779693E)\n (fp_text reference R2 (at 3.844 0.085 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 3K3 (at 3.81 3.81 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 14 /buttons/BTN_CFG_1))\n (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 32 VCC))\n )\n\n (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 59573648) (tstamp 595743CB)\n (at 88.239 74.844 90)\n (descr \"Resistor, Axial, RM 7.62mm, 1/3W,\")\n (tags \"Resistor Axial RM 7.62mm 1/3W R3\")\n (path /5777D5BA/5777DBC2)\n (fp_text reference R1 (at 4.094 0.261 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 3K3 (at 3.81 3.81 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 13 /buttons/BTN_LED_1))\n (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 32 VCC))\n )\n\n (module simonShield:TO-92_Molded_Narrow (layer F.Cu) (tedit 5957368B) (tstamp 595743BE)\n (at 137.007 85.512 180)\n (descr \"TO-92 leads molded, narrow, drill 0.6mm (see NXP sot054_po.pdf)\")\n (tags \"to-92 sc-43 sc-43a sot54 PA33 transistor\")\n (path /57780685/57780C35)\n (fp_text reference Q5 (at 3.257 3.262 180) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value BC547 (at 0 3 180) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.4 1.95) (end -1.4 -2.65) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.4 1.95) (end 3.9 1.95) (layer F.CrtYd) (width 0.05))\n (fp_line (start -0.43 1.7) (end 2.97 1.7) (layer F.SilkS) (width 0.15))\n (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle -135) (layer F.SilkS) (width 0.15))\n (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle 135) (layer F.SilkS) (width 0.15))\n (fp_line (start -1.4 -2.65) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))\n (fp_line (start 3.9 1.95) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))\n (pad 2 thru_hole circle (at 1.27 -1.27 270) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)\n (net 11 \"Net-(Q5-Pad2)\"))\n (pad 3 thru_hole circle (at 2.54 0 270) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)\n (net 4 \"Net-(D4-Pad2)\"))\n (pad 1 thru_hole circle (at 0 0 270) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)\n (net 12 \"Net-(Q5-Pad1)\"))\n (model TO_SOT_Packages_THT.3dshapes/TO-92_Molded_Narrow.wrl\n (at (xyz 0.05 0 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 -90))\n )\n )\n\n (module simonShield:TO-92_Molded_Narrow (layer F.Cu) (tedit 5957365A) (tstamp 595743B1)\n (at 80.873 85.512)\n (descr \"TO-92 leads molded, narrow, drill 0.6mm (see NXP sot054_po.pdf)\")\n (tags \"to-92 sc-43 sc-43a sot54 PA33 transistor\")\n (path /57780685/57780C0C)\n (fp_text reference Q4 (at 2.377 -4.012) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value BC547 (at 0 3) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.4 1.95) (end -1.4 -2.65) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.4 1.95) (end 3.9 1.95) (layer F.CrtYd) (width 0.05))\n (fp_line (start -0.43 1.7) (end 2.97 1.7) (layer F.SilkS) (width 0.15))\n (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle -135) (layer F.SilkS) (width 0.15))\n (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle 135) (layer F.SilkS) (width 0.15))\n (fp_line (start -1.4 -2.65) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))\n (fp_line (start 3.9 1.95) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))\n (pad 2 thru_hole circle (at 1.27 -1.27 90) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)\n (net 21 \"Net-(Q4-Pad2)\"))\n (pad 3 thru_hole circle (at 2.54 0 90) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)\n (net 20 \"Net-(D3-Pad2)\"))\n (pad 1 thru_hole circle (at 0 0 90) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)\n (net 22 \"Net-(Q4-Pad1)\"))\n (model TO_SOT_Packages_THT.3dshapes/TO-92_Molded_Narrow.wrl\n (at (xyz 0.05 0 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 -90))\n )\n )\n\n (module simonShield:TO-92_Molded_Narrow (layer F.Cu) (tedit 5957360A) (tstamp 595743A4)\n (at 137.007 62.144 180)\n (descr \"TO-92 leads molded, narrow, drill 0.6mm (see NXP sot054_po.pdf)\")\n (tags \"to-92 sc-43 sc-43a sot54 PA33 transistor\")\n (path /57780685/57780BE3)\n (fp_text reference Q3 (at 1.507 3.644 180) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value BC547 (at 0 3 180) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.4 1.95) (end -1.4 -2.65) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.4 1.95) (end 3.9 1.95) (layer F.CrtYd) (width 0.05))\n (fp_line (start -0.43 1.7) (end 2.97 1.7) (layer F.SilkS) (width 0.15))\n (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle -135) (layer F.SilkS) (width 0.15))\n (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle 135) (layer F.SilkS) (width 0.15))\n (fp_line (start -1.4 -2.65) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))\n (fp_line (start 3.9 1.95) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))\n (pad 2 thru_hole circle (at 1.27 -1.27 270) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)\n (net 9 \"Net-(Q3-Pad2)\"))\n (pad 3 thru_hole circle (at 2.54 0 270) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)\n (net 3 \"Net-(D2-Pad2)\"))\n (pad 1 thru_hole circle (at 0 0 270) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)\n (net 10 \"Net-(Q3-Pad1)\"))\n (model TO_SOT_Packages_THT.3dshapes/TO-92_Molded_Narrow.wrl\n (at (xyz 0.05 0 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 -90))\n )\n )\n\n (module simonShield:TO-92_Molded_Narrow (layer F.Cu) (tedit 54F242E1) (tstamp 59574397)\n (at 80.873 62.144)\n (descr \"TO-92 leads molded, narrow, drill 0.6mm (see NXP sot054_po.pdf)\")\n (tags \"to-92 sc-43 sc-43a sot54 PA33 transistor\")\n (path /57780685/57780BC0)\n (fp_text reference Q2 (at 0 -4) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value BC547 (at 0 3) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.4 1.95) (end -1.4 -2.65) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.4 1.95) (end 3.9 1.95) (layer F.CrtYd) (width 0.05))\n (fp_line (start -0.43 1.7) (end 2.97 1.7) (layer F.SilkS) (width 0.15))\n (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle -135) (layer F.SilkS) (width 0.15))\n (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle 135) (layer F.SilkS) (width 0.15))\n (fp_line (start -1.4 -2.65) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))\n (fp_line (start 3.9 1.95) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))\n (pad 2 thru_hole circle (at 1.27 -1.27 90) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)\n (net 7 \"Net-(Q2-Pad2)\"))\n (pad 3 thru_hole circle (at 2.54 0 90) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)\n (net 2 \"Net-(D1-Pad2)\"))\n (pad 1 thru_hole circle (at 0 0 90) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)\n (net 8 \"Net-(Q2-Pad1)\"))\n (model TO_SOT_Packages_THT.3dshapes/TO-92_Molded_Narrow.wrl\n (at (xyz 0.05 0 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 -90))\n )\n )\n\n (module simonShield:TO-92_Molded_Narrow (layer F.Cu) (tedit 54F242E1) (tstamp 5957438A)\n (at 118.973 55.286 270)\n (descr \"TO-92 leads molded, narrow, drill 0.6mm (see NXP sot054_po.pdf)\")\n (tags \"to-92 sc-43 sc-43a sot54 PA33 transistor\")\n (path /5797F3FE)\n (fp_text reference Q1 (at 0 -4 270) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value BC547 (at 0 3 270) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.4 1.95) (end -1.4 -2.65) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.4 1.95) (end 3.9 1.95) (layer F.CrtYd) (width 0.05))\n (fp_line (start -0.43 1.7) (end 2.97 1.7) (layer F.SilkS) (width 0.15))\n (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle -135) (layer F.SilkS) (width 0.15))\n (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle 135) (layer F.SilkS) (width 0.15))\n (fp_line (start -1.4 -2.65) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))\n (fp_line (start 3.9 1.95) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))\n (pad 2 thru_hole circle (at 1.27 -1.27) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)\n (net 5 \"Net-(Q1-Pad2)\"))\n (pad 3 thru_hole circle (at 2.54 0) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)\n (net 6 \"Net-(Q1-Pad3)\"))\n (pad 1 thru_hole circle (at 0 0) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)\n (net 19 \"Net-(Q1-Pad1)\"))\n (model TO_SOT_Packages_THT.3dshapes/TO-92_Molded_Narrow.wrl\n (at (xyz 0.05 0 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 -90))\n )\n )\n\n (module simonShield:Pin_Header_Straight_2x02 (layer F.Cu) (tedit 0) (tstamp 59574377)\n (at 81.0078 51.0427)\n (descr \"Through hole pin header\")\n (tags \"pin header\")\n (path /57781B52/57781CF6)\n (fp_text reference P1 (at 0 -5.1) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value PWR_JUMPER (at 0 -3.1) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.75 -1.75) (end -1.75 4.3) (layer F.CrtYd) (width 0.05))\n (fp_line (start 4.3 -1.75) (end 4.3 4.3) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.75 -1.75) (end 4.3 -1.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.75 4.3) (end 4.3 4.3) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.55 0) (end -1.55 -1.55) (layer F.SilkS) (width 0.15))\n (fp_line (start 0 -1.55) (end -1.55 -1.55) (layer F.SilkS) (width 0.15))\n (fp_line (start -1.27 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 -1.27) (end 3.81 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 -1.27) (end 3.81 3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 3.81) (end -1.27 3.81) (layer F.SilkS) (width 0.15))\n (fp_line (start -1.27 3.81) (end -1.27 1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole rect (at 0 0) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 25 \"Net-(P1-Pad1)\"))\n (pad 2 thru_hole oval (at 2.54 0) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 32 VCC))\n (pad 3 thru_hole oval (at 0 2.54) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 26 \"Net-(P1-Pad3)\"))\n (pad 4 thru_hole oval (at 2.54 2.54) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 32 VCC))\n (model Pin_Headers.3dshapes/Pin_Header_Straight_2x02.wrl\n (at (xyz 0.05 -0.05 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 90))\n )\n )\n\n (module simonShield:Fiducial_1mm (layer F.Cu) (tedit 573E1507) (tstamp 59574373)\n (at 121.25 81.75)\n (path /577D5FF6)\n (clearance 1.524)\n (fp_text reference F3 (at 0.02 -0.9) (layer F.SilkS) hide\n (effects (font (size 0.7112 0.4572) (thickness 0.1143)))\n )\n (fp_text value FIDUCIAL (at 0 0.99) (layer F.SilkS) hide\n (effects (font (size 0.254 0.254) (thickness 0.00254)))\n )\n (pad 1 smd circle (at 0 0) (size 1 1) (layers F.Cu F.Mask)\n (net 35 \"Net-(F3-Pad1)\") (solder_mask_margin 1.5))\n )\n\n (module simonShield:Fiducial_1mm (layer F.Cu) (tedit 573E1507) (tstamp 5957436F)\n (at 114.5 60)\n (path /577D5F36)\n (clearance 1.524)\n (fp_text reference F2 (at 0.02 -0.9) (layer F.SilkS) hide\n (effects (font (size 0.7112 0.4572) (thickness 0.1143)))\n )\n (fp_text value FIDUCIAL (at 0 0.99) (layer F.SilkS) hide\n (effects (font (size 0.254 0.254) (thickness 0.00254)))\n )\n (pad 1 smd circle (at 0 0) (size 1 1) (layers F.Cu F.Mask)\n (net 34 \"Net-(F2-Pad1)\") (solder_mask_margin 1.5))\n )\n\n (module simonShield:Fiducial_1mm (layer F.Cu) (tedit 573E1507) (tstamp 5957436B)\n (at 79.25 101.75)\n (path /577D561F)\n (clearance 1.524)\n (fp_text reference F1 (at 0.02 -0.9) (layer F.SilkS) hide\n (effects (font (size 0.7112 0.4572) (thickness 0.1143)))\n )\n (fp_text value FIDUCIAL (at 0 0.99) (layer F.SilkS) hide\n (effects (font (size 0.254 0.254) (thickness 0.00254)))\n )\n (pad 1 smd circle (at 0 0) (size 1 1) (layers F.Cu F.Mask)\n (net 33 \"Net-(F1-Pad1)\") (solder_mask_margin 1.5))\n )\n\n (module simonShield:LED-5MM (layer F.Cu) (tedit 59573672) (tstamp 59574360)\n (at 127.863 85.512)\n (descr \"LED 5mm round vertical\")\n (tags \"LED 5mm round vertical\")\n (path /57780685/577975B8)\n (fp_text reference D4 (at -3.113 -0.512) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value VERDE (at 1.524 -3.937) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.5 -1.55) (end -1.5 1.55) (layer F.CrtYd) (width 0.05))\n (fp_arc (start 1.3 0) (end -1.5 1.55) (angle -302) (layer F.CrtYd) (width 0.05))\n (fp_arc (start 1.27 0) (end -1.23 -1.5) (angle 297.5) (layer F.SilkS) (width 0.15))\n (fp_line (start -1.23 1.5) (end -1.23 -1.5) (layer F.SilkS) (width 0.15))\n (fp_circle (center 1.27 0) (end 0.97 -2.5) (layer F.SilkS) (width 0.15))\n (fp_text user K (at -3.113 1.238) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (pad 1 thru_hole rect (at 0 0 90) (size 2 1.9) (drill 1.00076) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n (pad 2 thru_hole circle (at 2.54 0) (size 1.9 1.9) (drill 1.00076) (layers *.Cu *.Mask F.SilkS)\n (net 4 \"Net-(D4-Pad2)\"))\n (model LEDs.3dshapes/LED-5MM.wrl\n (at (xyz 0.05 0 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 90))\n )\n )\n\n (module simonShield:LED-5MM (layer F.Cu) (tedit 59573664) (tstamp 59574355)\n (at 90.017 85.639 180)\n (descr \"LED 5mm round vertical\")\n (tags \"LED 5mm round vertical\")\n (path /57780685/5779752F)\n (fp_text reference D3 (at -2.983 -0.111 180) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value ROJO (at 1.524 -3.937 180) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.5 -1.55) (end -1.5 1.55) (layer F.CrtYd) (width 0.05))\n (fp_arc (start 1.3 0) (end -1.5 1.55) (angle -302) (layer F.CrtYd) (width 0.05))\n (fp_arc (start 1.27 0) (end -1.23 -1.5) (angle 297.5) (layer F.SilkS) (width 0.15))\n (fp_line (start -1.23 1.5) (end -1.23 -1.5) (layer F.SilkS) (width 0.15))\n (fp_circle (center 1.27 0) (end 0.97 -2.5) (layer F.SilkS) (width 0.15))\n (fp_text user K (at -1.905 1.905 180) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (pad 1 thru_hole rect (at 0 0 270) (size 2 1.9) (drill 1.00076) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n (pad 2 thru_hole circle (at 2.54 0 180) (size 1.9 1.9) (drill 1.00076) (layers *.Cu *.Mask F.SilkS)\n (net 20 \"Net-(D3-Pad2)\"))\n (model LEDs.3dshapes/LED-5MM.wrl\n (at (xyz 0.05 0 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 90))\n )\n )\n\n (module simonShield:LED-5MM (layer F.Cu) (tedit 595736A9) (tstamp 5957434A)\n (at 127.863 62.144)\n (descr \"LED 5mm round vertical\")\n (tags \"LED 5mm round vertical\")\n (path /57780685/5779749F)\n (fp_text reference D2 (at -2.863 -1.894) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value AZUL (at 1.524 -3.937) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.5 -1.55) (end -1.5 1.55) (layer F.CrtYd) (width 0.05))\n (fp_arc (start 1.3 0) (end -1.5 1.55) (angle -302) (layer F.CrtYd) (width 0.05))\n (fp_arc (start 1.27 0) (end -1.23 -1.5) (angle 297.5) (layer F.SilkS) (width 0.15))\n (fp_line (start -1.23 1.5) (end -1.23 -1.5) (layer F.SilkS) (width 0.15))\n (fp_circle (center 1.27 0) (end 0.97 -2.5) (layer F.SilkS) (width 0.15))\n (fp_text user K (at -3.113 -0.144) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (pad 1 thru_hole rect (at 0 0 90) (size 2 1.9) (drill 1.00076) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n (pad 2 thru_hole circle (at 2.54 0) (size 1.9 1.9) (drill 1.00076) (layers *.Cu *.Mask F.SilkS)\n (net 3 \"Net-(D2-Pad2)\"))\n (model LEDs.3dshapes/LED-5MM.wrl\n (at (xyz 0.05 0 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 90))\n )\n )\n\n (module simonShield:LED-5MM (layer F.Cu) (tedit 59573791) (tstamp 5957433F)\n (at 90.017 62.144 180)\n (descr \"LED 5mm round vertical\")\n (tags \"LED 5mm round vertical\")\n (path /57780685/57780BD5)\n (fp_text reference D1 (at -2.733 -0.106 180) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value AMARILLO (at 1.524 -3.937 180) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.5 -1.55) (end -1.5 1.55) (layer F.CrtYd) (width 0.05))\n (fp_arc (start 1.3 0) (end -1.5 1.55) (angle -302) (layer F.CrtYd) (width 0.05))\n (fp_arc (start 1.27 0) (end -1.23 -1.5) (angle 297.5) (layer F.SilkS) (width 0.15))\n (fp_line (start -1.23 1.5) (end -1.23 -1.5) (layer F.SilkS) (width 0.15))\n (fp_circle (center 1.27 0) (end 0.97 -2.5) (layer F.SilkS) (width 0.15))\n (fp_text user K (at -1.905 1.905 180) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (pad 1 thru_hole rect (at 0 0 270) (size 2 1.9) (drill 1.00076) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n (pad 2 thru_hole circle (at 2.54 0 180) (size 1.9 1.9) (drill 1.00076) (layers *.Cu *.Mask F.SilkS)\n (net 2 \"Net-(D1-Pad2)\"))\n (model LEDs.3dshapes/LED-5MM.wrl\n (at (xyz 0.05 0 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 90))\n )\n )\n\n (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 595736A0) (tstamp 59574332)\n (at 118.465 74.971 90)\n (descr \"Resistor, Axial, RM 7.62mm, 1/3W,\")\n (tags \"Resistor Axial RM 7.62mm 1/3W R3\")\n (path /5777D5BA/577969F3)\n (fp_text reference R4 (at 4.221 0.035 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value 3K3 (at 3.81 3.81 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 16 /buttons/BTN_CFG_2))\n (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)\n (net 32 VCC))\n )\n\n (module simonShield:Logo_Poncho (layer F.Cu) (tedit 59573768) (tstamp 5957432A)\n (at 131 49.5)\n (fp_text reference G*** (at 0.127 5.588 90) (layer F.SilkS) hide\n (effects (font (thickness 0.3)))\n )\n (fp_text value LOGO (at 0.762 7.493) (layer F.SilkS) hide\n (effects (font (thickness 0.3)))\n )\n (fp_poly (pts (xy 4.535714 -0.627021) (xy 4.498746 -0.420109) (xy 4.405012 -0.1352) (xy 4.280272 0.162897)\n (xy 4.150281 0.409374) (xy 4.123376 0.447413) (xy 4.123376 -0.123701) (xy 4.058326 -0.436938)\n (xy 3.869112 -0.644378) (xy 3.564639 -0.737671) (xy 3.463636 -0.742208) (xy 3.129516 -0.681223)\n (xy 2.908248 -0.503835) (xy 2.808734 -0.218392) (xy 2.803896 -0.123701) (xy 2.868946 0.189536)\n (xy 3.058159 0.396975) (xy 3.362633 0.490269) (xy 3.463636 0.494805) (xy 3.797606 0.436492)\n (xy 3.958441 0.32987) (xy 4.092315 0.09203) (xy 4.123376 -0.123701) (xy 4.123376 0.447413)\n (xy 4.089856 0.494805) (xy 4.013749 0.621925) (xy 3.89522 0.861365) (xy 3.753792 1.172585)\n (xy 3.672876 1.360714) (xy 3.421635 1.929272) (xy 3.149718 2.496808) (xy 2.869494 3.041693)\n (xy 2.593334 3.542296) (xy 2.556493 3.603955) (xy 2.556493 -0.123701) (xy 2.552598 -0.439936)\n (xy 2.534834 -0.625484) (xy 2.494089 -0.714524) (xy 2.421247 -0.741238) (xy 2.391558 -0.742208)\n (xy 2.270831 -0.703329) (xy 2.228325 -0.558669) (xy 2.226623 -0.494805) (xy 2.206189 -0.31957)\n (xy 2.109798 -0.254982) (xy 1.97922 -0.247402) (xy 1.803985 -0.267837) (xy 1.739397 -0.364227)\n (xy 1.731818 -0.494805) (xy 1.705898 -0.675896) (xy 1.609459 -0.739655) (xy 1.566883 -0.742208)\n (xy 1.482553 -0.727599) (xy 1.433074 -0.660988) (xy 1.40933 -0.508193) (xy 1.402206 -0.235036)\n (xy 1.401948 -0.123701) (xy 1.405843 0.192533) (xy 1.423606 0.378081) (xy 1.464351 0.467122)\n (xy 1.537193 0.493835) (xy 1.566883 0.494805) (xy 1.680559 0.462518) (xy 1.726426 0.336472)\n (xy 1.731818 0.206169) (xy 1.745609 0.012245) (xy 1.815564 -0.067294) (xy 1.97922 -0.082467)\n (xy 2.145441 -0.066377) (xy 2.213617 0.015237) (xy 2.226623 0.206169) (xy 2.245073 0.405103)\n (xy 2.317099 0.48537) (xy 2.391558 0.494805) (xy 2.475887 0.480197) (xy 2.525367 0.413586)\n (xy 2.549111 0.260791) (xy 2.556234 -0.012366) (xy 2.556493 -0.123701) (xy 2.556493 3.603955)\n (xy 2.33361 3.976986) (xy 2.102692 4.324132) (xy 1.912952 4.562103) (xy 1.781691 4.667512)\n (xy 1.660102 4.654002) (xy 1.438445 4.580892) (xy 1.163465 4.463746) (xy 1.154545 4.459546)\n (xy 1.154545 0.36149) (xy 1.110706 0.268405) (xy 0.956623 0.266159) (xy 0.938776 0.269422)\n (xy 0.717011 0.243945) (xy 0.523128 0.11531) (xy 0.417755 -0.07121) (xy 0.412337 -0.123701)\n (xy 0.484303 -0.318602) (xy 0.658393 -0.472009) (xy 0.871896 -0.536691) (xy 0.949632 -0.528355)\n (xy 1.105982 -0.515384) (xy 1.154279 -0.597467) (xy 1.154545 -0.609566) (xy 1.114247 -0.69528)\n (xy 0.970303 -0.735064) (xy 0.783441 -0.742208) (xy 0.429195 -0.687347) (xy 0.198088 -0.523118)\n (xy 0.090717 -0.250044) (xy 0.082467 -0.123701) (xy 0.144642 0.188869) (xy 0.330769 0.392787)\n (xy 0.640252 0.487526) (xy 0.783441 0.494805) (xy 1.022962 0.480515) (xy 1.134243 0.429291)\n (xy 1.154545 0.36149) (xy 1.154545 4.459546) (xy 1.148315 4.456614) (xy 0.592041 4.256938)\n (xy 0.061238 4.207886) (xy -0.164935 4.249843) (xy -0.164935 -0.123701) (xy -0.168831 -0.439936)\n (xy -0.186594 -0.625484) (xy -0.227339 -0.714524) (xy -0.300181 -0.741238) (xy -0.329871 -0.742208)\n (xy -0.435349 -0.716231) (xy -0.483875 -0.609894) (xy -0.495586 -0.391721) (xy -0.496366 -0.041234)\n (xy -0.706429 -0.391721) (xy -0.874005 -0.625569) (xy -1.029731 -0.729733) (xy -1.117986 -0.742208)\n (xy -1.220495 -0.733937) (xy -1.280586 -0.685976) (xy -1.309571 -0.563603) (xy -1.318762 -0.332094)\n (xy -1.319481 -0.123701) (xy -1.315585 0.192533) (xy -1.297822 0.378081) (xy -1.257077 0.467122)\n (xy -1.184235 0.493835) (xy -1.154546 0.494805) (xy -1.049068 0.468829) (xy -1.000541 0.362492)\n (xy -0.988831 0.144318) (xy -0.98805 -0.206169) (xy -0.777988 0.144318) (xy -0.610412 0.378167)\n (xy -0.454685 0.48233) (xy -0.36643 0.494805) (xy -0.263922 0.486535) (xy -0.203831 0.438574)\n (xy -0.174846 0.3162) (xy -0.165655 0.084692) (xy -0.164935 -0.123701) (xy -0.164935 4.249843)\n (xy -0.48241 4.308738) (xy -0.783442 4.420415) (xy -1.059466 4.535832) (xy -1.285963 4.626797)\n (xy -1.401948 4.669513) (xy -1.518876 4.625399) (xy -1.566884 4.584033) (xy -1.566884 -0.123701)\n (xy -1.631934 -0.436938) (xy -1.821147 -0.644378) (xy -2.12562 -0.737671) (xy -2.226624 -0.742208)\n (xy -2.560743 -0.681223) (xy -2.782012 -0.503835) (xy -2.881525 -0.218392) (xy -2.886364 -0.123701)\n (xy -2.821314 0.189536) (xy -2.6321 0.396975) (xy -2.327627 0.490269) (xy -2.226624 0.494805)\n (xy -1.892653 0.436492) (xy -1.731819 0.32987) (xy -1.597945 0.09203) (xy -1.566884 -0.123701)\n (xy -1.566884 4.584033) (xy -1.717176 4.454536) (xy -1.98582 4.166799) (xy -2.061689 4.078924)\n (xy -2.369861 3.70727) (xy -2.632201 3.363429) (xy -2.870341 3.013116) (xy -2.968832 2.849614)\n (xy -2.968832 -0.32987) (xy -3.007485 -0.54598) (xy -3.140146 -0.67528) (xy -3.391869 -0.734039)\n (xy -3.603832 -0.742208) (xy -4.04091 -0.742208) (xy -4.04091 -0.123701) (xy -4.037014 0.192533)\n (xy -4.019251 0.378081) (xy -3.978506 0.467122) (xy -3.905664 0.493835) (xy -3.875974 0.494805)\n (xy -3.746639 0.446485) (xy -3.711039 0.288637) (xy -3.687673 0.146227) (xy -3.584731 0.090232)\n (xy -3.438897 0.082468) (xy -3.16065 0.034793) (xy -3.008068 -0.114765) (xy -2.968832 -0.32987)\n (xy -2.968832 2.849614) (xy -3.105916 2.622046) (xy -3.360558 2.155935) (xy -3.6559 1.580499)\n (xy -3.724805 1.443182) (xy -3.927446 1.040996) (xy -4.107468 0.68891) (xy -4.250627 0.414385)\n (xy -4.342678 0.24488) (xy -4.366512 0.206169) (xy -4.479713 -0.061738) (xy -4.470402 -0.368299)\n (xy -4.39208 -0.562072) (xy -4.211754 -0.794239) (xy -3.970771 -1.027175) (xy -3.729883 -1.205582)\n (xy -3.628572 -1.257014) (xy -3.515586 -1.328258) (xy -3.31072 -1.481511) (xy -3.047204 -1.691308)\n (xy -2.861153 -1.845142) (xy -2.478394 -2.151727) (xy -2.09396 -2.434151) (xy -1.735885 -2.674156)\n (xy -1.432202 -2.853482) (xy -1.210945 -2.953871) (xy -1.135923 -2.968831) (xy -0.992755 -2.911987)\n (xy -0.868796 -2.807085) (xy -0.798823 -2.718089) (xy -0.768465 -2.621372) (xy -0.779148 -2.476306)\n (xy -0.832302 -2.242261) (xy -0.897248 -1.997411) (xy -1.002077 -1.614541) (xy -1.0637 -1.342913)\n (xy -1.062894 -1.163551) (xy -0.980436 -1.05748) (xy -0.797105 -1.005726) (xy -0.493678 -0.989314)\n (xy -0.050932 -0.989267) (xy 0.123701 -0.98961) (xy 0.616616 -0.993152) (xy 0.963601 -1.004879)\n (xy 1.183529 -1.026446) (xy 1.295275 -1.059505) (xy 1.31948 -1.094352) (xy 1.298521 -1.22034)\n (xy 1.243133 -1.457326) (xy 1.164548 -1.757819) (xy 1.150407 -1.809213) (xy 1.043088 -2.255847)\n (xy 1.008894 -2.569631) (xy 1.048676 -2.765972) (xy 1.163285 -2.860279) (xy 1.208992 -2.870512)\n (xy 1.420553 -2.83991) (xy 1.739874 -2.711189) (xy 2.149801 -2.493929) (xy 2.633175 -2.197713)\n (xy 3.172841 -1.832122) (xy 3.525487 -1.576813) (xy 3.929546 -1.272303) (xy 4.214754 -1.04349)\n (xy 4.398878 -0.873667) (xy 4.499689 -0.746128) (xy 4.534955 -0.644167) (xy 4.535714 -0.627021)\n (xy 4.535714 -0.627021)) (layer F.SilkS) (width 0.1))\n (fp_poly (pts (xy 1.023542 -3.736319) (xy 0.895402 -3.389445) (xy 0.679417 -3.11223) (xy 0.563302 -2.982356)\n (xy 0.508034 -2.869698) (xy 0.506066 -2.720981) (xy 0.549854 -2.48293) (xy 0.574294 -2.370022)\n (xy 0.658312 -1.973188) (xy 0.69611 -1.709422) (xy 0.675383 -1.550382) (xy 0.583822 -1.467723)\n (xy 0.409122 -1.433104) (xy 0.16144 -1.419187) (xy -0.12355 -1.415195) (xy -0.339882 -1.428263)\n (xy -0.43645 -1.453549) (xy -0.490308 -1.618268) (xy -0.466441 -1.923684) (xy -0.365224 -2.365222)\n (xy -0.360015 -2.384058) (xy -0.225225 -2.868872) (xy -0.488808 -3.104404) (xy -0.714353 -3.402585)\n (xy -0.808424 -3.746824) (xy -0.77552 -4.096523) (xy -0.620138 -4.411085) (xy -0.346777 -4.649915)\n (xy -0.31571 -4.666738) (xy 0.033719 -4.763905) (xy 0.380075 -4.71573) (xy 0.68714 -4.538441)\n (xy 0.918691 -4.248265) (xy 0.989692 -4.081895) (xy 1.023542 -3.736319) (xy 1.023542 -3.736319)) (layer F.SilkS) (width 0.1))\n (fp_poly (pts (xy -3.320079 -0.321578) (xy -3.381169 -0.206169) (xy -3.537606 -0.087441) (xy -3.656944 -0.12265)\n (xy -3.710414 -0.301007) (xy -3.711039 -0.32987) (xy -3.666881 -0.523821) (xy -3.553583 -0.57585)\n (xy -3.399915 -0.47517) (xy -3.381169 -0.453571) (xy -3.320079 -0.321578) (xy -3.320079 -0.321578)) (layer F.SilkS) (width 0.1))\n (fp_poly (pts (xy -1.911824 -0.1467) (xy -1.935194 -0.006732) (xy -2.006645 0.114199) (xy -2.128505 0.265484)\n (xy -2.225472 0.329848) (xy -2.226624 0.32987) (xy -2.322643 0.267542) (xy -2.444552 0.117317)\n (xy -2.446603 0.114199) (xy -2.537406 -0.05684) (xy -2.52656 -0.197017) (xy -2.465958 -0.318756)\n (xy -2.343482 -0.473895) (xy -2.226624 -0.536039) (xy -2.106037 -0.47051) (xy -1.987289 -0.318756)\n (xy -1.911824 -0.1467) (xy -1.911824 -0.1467)) (layer F.SilkS) (width 0.1))\n (fp_poly (pts (xy 3.778435 -0.1467) (xy 3.755065 -0.006732) (xy 3.683615 0.114199) (xy 3.561755 0.265484)\n (xy 3.464788 0.329848) (xy 3.463636 0.32987) (xy 3.367616 0.267542) (xy 3.245708 0.117317)\n (xy 3.243657 0.114199) (xy 3.152854 -0.05684) (xy 3.163699 -0.197017) (xy 3.224301 -0.318756)\n (xy 3.346778 -0.473895) (xy 3.463636 -0.536039) (xy 3.584223 -0.47051) (xy 3.702971 -0.318756)\n (xy 3.778435 -0.1467) (xy 3.778435 -0.1467)) (layer F.SilkS) (width 0.1))\n )\n\n (module simonShield:Logo_OSHWA (layer F.Cu) (tedit 560D8B85) (tstamp 59574326)\n (at 101.5 82.5)\n (fp_text reference G101 (at 0 4.2418) (layer F.SilkS) hide\n (effects (font (size 0.7112 0.4572) (thickness 0.1143)))\n )\n (fp_text value Logo_OSHWA (at 0 -4.2418) (layer F.SilkS) hide\n (effects (font (size 0.36322 0.36322) (thickness 0.07112)))\n )\n (fp_poly (pts (xy -2.42316 3.59156) (xy -2.38252 3.57124) (xy -2.28854 3.51282) (xy -2.15392 3.42392)\n (xy -1.99644 3.31978) (xy -1.83896 3.21056) (xy -1.70942 3.1242) (xy -1.61798 3.06578)\n (xy -1.57988 3.04546) (xy -1.55956 3.05054) (xy -1.48336 3.08864) (xy -1.37414 3.14452)\n (xy -1.31064 3.17754) (xy -1.21158 3.22072) (xy -1.16078 3.23088) (xy -1.15316 3.21564)\n (xy -1.11506 3.13944) (xy -1.05918 3.00736) (xy -0.98298 2.83464) (xy -0.89662 2.63144)\n (xy -0.80264 2.413) (xy -0.7112 2.18948) (xy -0.6223 1.97612) (xy -0.54356 1.78562)\n (xy -0.48006 1.63068) (xy -0.43942 1.52146) (xy -0.42418 1.47574) (xy -0.42926 1.46558)\n (xy -0.48006 1.41732) (xy -0.56642 1.35128) (xy -0.75692 1.19634) (xy -0.94234 0.96266)\n (xy -1.05664 0.6985) (xy -1.09474 0.40386) (xy -1.06172 0.13208) (xy -0.95504 -0.12954)\n (xy -0.77216 -0.36576) (xy -0.55118 -0.54102) (xy -0.2921 -0.65278) (xy 0 -0.68834)\n (xy 0.2794 -0.65786) (xy 0.5461 -0.55118) (xy 0.78232 -0.37084) (xy 0.88138 -0.25654)\n (xy 1.01854 -0.01778) (xy 1.09728 0.23876) (xy 1.1049 0.30226) (xy 1.09474 0.5842)\n (xy 1.01092 0.85344) (xy 0.8636 1.09474) (xy 0.65786 1.29032) (xy 0.62992 1.31064)\n (xy 0.53594 1.38176) (xy 0.47244 1.43002) (xy 0.42164 1.47066) (xy 0.77978 2.33172)\n (xy 0.83566 2.46888) (xy 0.93472 2.7051) (xy 1.02108 2.9083) (xy 1.08966 3.06832)\n (xy 1.13792 3.17754) (xy 1.15824 3.22072) (xy 1.16078 3.22326) (xy 1.19126 3.22834)\n (xy 1.2573 3.20294) (xy 1.37668 3.14452) (xy 1.45796 3.10388) (xy 1.5494 3.0607)\n (xy 1.59004 3.04546) (xy 1.6256 3.06324) (xy 1.71196 3.12166) (xy 1.8415 3.20548)\n (xy 1.9939 3.30962) (xy 2.14122 3.41122) (xy 2.27584 3.50012) (xy 2.3749 3.56108)\n (xy 2.42316 3.58902) (xy 2.43078 3.58902) (xy 2.47142 3.56362) (xy 2.55016 3.50012)\n (xy 2.667 3.38836) (xy 2.8321 3.2258) (xy 2.8575 3.2004) (xy 2.99466 3.0607)\n (xy 3.10642 2.94386) (xy 3.18008 2.86258) (xy 3.20548 2.82448) (xy 3.20548 2.82448)\n (xy 3.18262 2.77622) (xy 3.11912 2.6797) (xy 3.03022 2.54254) (xy 2.921 2.38252)\n (xy 2.63652 1.9685) (xy 2.794 1.57734) (xy 2.84226 1.45796) (xy 2.90322 1.31318)\n (xy 2.9464 1.20904) (xy 2.9718 1.16332) (xy 3.01244 1.14808) (xy 3.12166 1.12268)\n (xy 3.2766 1.08966) (xy 3.45948 1.05664) (xy 3.63728 1.02362) (xy 3.7973 0.99314)\n (xy 3.9116 0.97028) (xy 3.9624 0.96012) (xy 3.9751 0.9525) (xy 3.98526 0.9271)\n (xy 3.99288 0.87376) (xy 3.99542 0.77724) (xy 3.99796 0.62484) (xy 3.99796 0.40386)\n (xy 3.99796 0.381) (xy 3.99542 0.17018) (xy 3.99288 0.00254) (xy 3.9878 -0.10668)\n (xy 3.98018 -0.14986) (xy 3.98018 -0.14986) (xy 3.92938 -0.16256) (xy 3.81762 -0.18542)\n (xy 3.6576 -0.21844) (xy 3.4671 -0.254) (xy 3.45694 -0.25654) (xy 3.26644 -0.2921)\n (xy 3.10896 -0.32512) (xy 2.9972 -0.35052) (xy 2.95148 -0.36576) (xy 2.94132 -0.37846)\n (xy 2.90322 -0.45212) (xy 2.84734 -0.56896) (xy 2.78638 -0.71374) (xy 2.72288 -0.86106)\n (xy 2.66954 -0.99568) (xy 2.63398 -1.09474) (xy 2.62382 -1.14046) (xy 2.62382 -1.14046)\n (xy 2.65176 -1.18618) (xy 2.7178 -1.28524) (xy 2.80924 -1.41986) (xy 2.921 -1.58242)\n (xy 2.92862 -1.59512) (xy 3.03784 -1.75514) (xy 3.12674 -1.88976) (xy 3.18516 -1.98628)\n (xy 3.20548 -2.02946) (xy 3.20548 -2.032) (xy 3.16992 -2.08026) (xy 3.08864 -2.16916)\n (xy 2.9718 -2.29108) (xy 2.8321 -2.43332) (xy 2.78638 -2.4765) (xy 2.63144 -2.6289)\n (xy 2.52476 -2.72796) (xy 2.45618 -2.7813) (xy 2.42316 -2.794) (xy 2.42316 -2.79146)\n (xy 2.3749 -2.76352) (xy 2.2733 -2.69748) (xy 2.13614 -2.6035) (xy 1.97358 -2.49428)\n (xy 1.96342 -2.48666) (xy 1.8034 -2.37744) (xy 1.67132 -2.28854) (xy 1.5748 -2.22504)\n (xy 1.53416 -2.19964) (xy 1.52654 -2.19964) (xy 1.46304 -2.21996) (xy 1.34874 -2.25806)\n (xy 1.20904 -2.31394) (xy 1.06172 -2.37236) (xy 0.9271 -2.42824) (xy 0.8255 -2.4765)\n (xy 0.77724 -2.5019) (xy 0.77724 -2.50444) (xy 0.75946 -2.56286) (xy 0.73152 -2.68224)\n (xy 0.6985 -2.84734) (xy 0.6604 -3.04292) (xy 0.65532 -3.0734) (xy 0.61976 -3.2639)\n (xy 0.58928 -3.42138) (xy 0.56642 -3.5306) (xy 0.55372 -3.57632) (xy 0.52832 -3.5814)\n (xy 0.43434 -3.58902) (xy 0.2921 -3.59156) (xy 0.11938 -3.5941) (xy -0.06096 -3.59156)\n (xy -0.23622 -3.58902) (xy -0.38862 -3.58394) (xy -0.4953 -3.57632) (xy -0.54102 -3.56616)\n (xy -0.54356 -3.56362) (xy -0.5588 -3.5052) (xy -0.5842 -3.38582) (xy -0.61976 -3.22072)\n (xy -0.65786 -3.0226) (xy -0.66294 -2.98958) (xy -0.6985 -2.79908) (xy -0.73152 -2.64414)\n (xy -0.75438 -2.53492) (xy -0.76708 -2.49428) (xy -0.78232 -2.48412) (xy -0.86106 -2.4511)\n (xy -0.98806 -2.39776) (xy -1.14808 -2.33426) (xy -1.51384 -2.1844) (xy -1.96088 -2.49428)\n (xy -2.00406 -2.52222) (xy -2.16408 -2.63144) (xy -2.2987 -2.72034) (xy -2.39014 -2.77876)\n (xy -2.42824 -2.80162) (xy -2.43078 -2.79908) (xy -2.4765 -2.76098) (xy -2.5654 -2.67716)\n (xy -2.68732 -2.55778) (xy -2.82702 -2.41808) (xy -2.93116 -2.31394) (xy -3.05562 -2.18694)\n (xy -3.13436 -2.10312) (xy -3.17754 -2.04724) (xy -3.19278 -2.01422) (xy -3.1877 -1.9939)\n (xy -3.15976 -1.94818) (xy -3.09372 -1.84912) (xy -3.00228 -1.71196) (xy -2.89306 -1.55448)\n (xy -2.80162 -1.41986) (xy -2.7051 -1.27) (xy -2.6416 -1.16332) (xy -2.61874 -1.10998)\n (xy -2.62382 -1.08712) (xy -2.65684 -1.00076) (xy -2.71018 -0.86614) (xy -2.77622 -0.70866)\n (xy -2.9337 -0.35306) (xy -3.16738 -0.30988) (xy -3.30708 -0.28194) (xy -3.5052 -0.24384)\n (xy -3.69316 -0.20828) (xy -3.9878 -0.14986) (xy -3.99796 0.93218) (xy -3.95224 0.9525)\n (xy -3.90906 0.9652) (xy -3.79984 0.98806) (xy -3.6449 1.01854) (xy -3.45948 1.0541)\n (xy -3.30454 1.08458) (xy -3.14452 1.11252) (xy -3.03276 1.13538) (xy -2.98196 1.14554)\n (xy -2.96926 1.16332) (xy -2.92862 1.23952) (xy -2.87274 1.36144) (xy -2.81178 1.50876)\n (xy -2.74828 1.65862) (xy -2.6924 1.79832) (xy -2.65176 1.905) (xy -2.63906 1.96088)\n (xy -2.65938 2.00406) (xy -2.72034 2.0955) (xy -2.8067 2.22758) (xy -2.91338 2.38506)\n (xy -3.0226 2.54254) (xy -3.1115 2.67716) (xy -3.175 2.77368) (xy -3.2004 2.81686)\n (xy -3.1877 2.84734) (xy -3.12674 2.92354) (xy -3.00736 3.04546) (xy -2.8321 3.22072)\n (xy -2.80162 3.24866) (xy -2.66192 3.38328) (xy -2.54254 3.4925) (xy -2.46126 3.56616)\n (xy -2.42316 3.59156)) (layer F.SilkS) (width 0.00254))\n )\n\n (module simonShield:C_Disc_D3_P2.5 (layer F.Cu) (tedit 578F6ADD) (tstamp 5957431B)\n (at 89.255 53.508 90)\n (descr \"Capacitor 3mm Disc, Pitch 2.5mm\")\n (tags Capacitor)\n (path /57781B52/57781D10)\n (fp_text reference C1 (at 1.27 2.794 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value C_100nF (at 1.25 2.5 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start -0.9 -1.5) (end 3.4 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 3.4 -1.5) (end 3.4 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 3.4 1.5) (end -0.9 1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -0.9 1.5) (end -0.9 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -0.25 -1.25) (end 2.75 -1.25) (layer F.SilkS) (width 0.15))\n (fp_line (start 2.75 1.25) (end -0.25 1.25) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole rect (at 0 0 90) (size 1.3 1.3) (drill 0.8) (layers *.Cu *.Mask F.SilkS)\n (net 32 VCC))\n (pad 2 thru_hole circle (at 2.5 0 90) (size 1.3 1.3) (drill 0.8001) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n (model ${KIPRJMOD}/simonShield.3dshapes/C_Disc_D3_P2.5.wrl\n (at (xyz 0.049213 0 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 0))\n )\n )\n\n (module simonShield:Conn_Poncho_SinBorde (layer F.Cu) (tedit 5797F70F) (tstamp 5957426D)\n (at 143.23 50.968)\n (tags \"CONN Poncho\")\n (path /57781B52/57781CEF)\n (fp_text reference XA1 (at 1.27 -3.175) (layer F.SilkS)\n (effects (font (size 0.8 0.8) (thickness 0.12)))\n )\n (fp_text value Conn_Poncho2P_2x_20x2 (at -1.905 51.181) (layer F.SilkS) hide\n (effects (font (size 1.016 1.016) (thickness 0.2032)))\n )\n (fp_text user GPIO8 (at -65.913 48.26) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user GPIO7 (at -65.913 45.847) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user GPIO5 (at -65.913 43.18) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user GPIO3 (at -65.913 40.767) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user GPIO1 (at -65.913 38.1) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user LCD1 (at -65.913 35.56) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user LCD2 (at -65.913 33.02) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user LCD3 (at -65.024 30.48) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user LCD_RS (at -64.008 27.94) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user LCD4 (at -65.278 25.654) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user SCK (at -66.04 22.733) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user MISO (at -65.913 20.32) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user TXD1 (at -65.786 17.907) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user TXD0 (at -65.786 15.24) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user MDIO (at -65.786 12.7) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user CRS (at -65.532 10.287) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user MDC (at -66.04 7.62) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user TX_EN (at -64.77 5.207) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user RXD1 (at -65.913 2.667) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user +5V (at -65.532 0) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at -74.168 48.006) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at -74.168 45.72) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GPIO6 (at -74.295 43.18) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user GPIO4 (at -74.295 40.64) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user GPIO2 (at -74.295 38.1) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user GPIO0 (at -74.295 35.56) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user GND (at -74.168 33.02) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at -74.168 30.48) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user LCD_EN (at -74.168 27.94) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user MOSI (at -74.168 25.273) (layer F.SilkS)\n (effects (font (size 1 0.7) (thickness 0.17)))\n )\n (fp_text user GND (at -74.168 22.86) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at -74.168 20.32) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user R_CLK (at -74.168 17.78) (layer F.SilkS)\n (effects (font (size 0.9 0.7) (thickness 0.175)))\n )\n (fp_text user GND (at -74.168 15.24) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at -74.168 12.7) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at -74.168 7.62) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user RXD0 (at -74.041 10.16) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user GND (at -74.168 5.08) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at -74.168 2.54) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user +3.3V (at -74.041 0) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user GND (at 5.461 48.26) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at 5.461 45.72) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user T_F1 (at 5.461 43.18) (layer F.SilkS)\n (effects (font (size 0.9 0.9) (thickness 0.18)))\n )\n (fp_text user T_C2 (at 5.461 40.64) (layer F.SilkS)\n (effects (font (size 0.9 0.9) (thickness 0.18)))\n )\n (fp_text user GND (at 5.461 38.1) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at 5.334 35.56) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at 5.461 33.02) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at 5.461 30.48) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at 5.461 27.94) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at 5.461 25.4) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GND (at 5.461 22.86) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GNDA (at 5.461 20.32) (layer F.SilkS)\n (effects (font (size 0.76 0.76) (thickness 0.19)))\n )\n (fp_text user GNDA (at 5.461 17.78) (layer F.SilkS)\n (effects (font (size 0.76 0.76) (thickness 0.19)))\n )\n (fp_text user GNDA (at 5.461 15.24) (layer F.SilkS)\n (effects (font (size 0.76 0.76) (thickness 0.19)))\n )\n (fp_text user GNDA (at 5.461 12.7) (layer F.SilkS)\n (effects (font (size 0.76 0.76) (thickness 0.19)))\n )\n (fp_text user GNDA (at 5.461 10.16) (layer F.SilkS)\n (effects (font (size 0.76 0.76) (thickness 0.19)))\n )\n (fp_text user GNDA (at 5.461 7.62) (layer F.SilkS)\n (effects (font (size 0.76 0.76) (thickness 0.19)))\n )\n (fp_text user WAKEUP (at 5.461 5.334) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user GND (at 5.461 3.048) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user +5V (at 5.334 0) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user T_C0 (at -2.286 48.133) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user T_F2 (at -2.413 45.72) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user T_F3 (at -2.413 43.18) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user T_F0 (at -2.413 40.64) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user T_C1 (at -2.286 38.1) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user CAN_TD (at -2.921 35.687) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user CAN_RD (at -2.921 33.02) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user 232_TX (at -4.318 30.48) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user 232_RX (at -4.318 27.94) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user SCL (at -2.794 25.4) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user SDA (at -2.794 22.86) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user VDDA (at -2.794 20.32) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user DAC (at -2.794 17.78) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user CH1 (at -2.794 15.24) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user CH2 (at -3.048 12.7) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user CH3 (at -3.048 10.16) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user GNDA (at -2.54 7.62) (layer F.SilkS)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (fp_text user ISP (at -2.794 5.08) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user RESET (at -3.81 2.54) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_text user CIAA-P2 (at -69.85 -2.032) (layer F.SilkS)\n (effects (font (size 0.8 0.8) (thickness 0.12)))\n )\n (fp_text user CIAA-P1 (at 1.27 -2.032) (layer F.SilkS)\n (effects (font (size 0.8 0.8) (thickness 0.12)))\n )\n (fp_text user +3.3V (at -3.81 0) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.2)))\n )\n (fp_line (start -72.39 0) (end -72.39 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start -72.39 -1.27) (end -67.31 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start -67.31 -1.27) (end -67.31 49.53) (layer F.SilkS) (width 0.15))\n (fp_line (start -67.31 49.53) (end -72.39 49.53) (layer F.SilkS) (width 0.15))\n (fp_line (start -72.39 49.53) (end -72.39 0) (layer F.SilkS) (width 0.15))\n (fp_line (start -1.27 49.53) (end -1.27 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 49.53) (end 3.81 -1.27) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 49.53) (end -1.27 49.53) (layer F.SilkS) (width 0.15))\n (fp_line (start 3.81 -1.27) (end -1.27 -1.27) (layer F.SilkS) (width 0.15))\n (pad 1 thru_hole rect (at 0 0 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 36 \"Net-(XA1-Pad1)\"))\n (pad 2 thru_hole oval (at 2.54 0 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 37 \"Net-(XA1-Pad2)\"))\n (pad 11 thru_hole oval (at 0 12.7 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 38 \"Net-(XA1-Pad11)\"))\n (pad 4 thru_hole oval (at 2.54 2.54 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 39 \"Net-(XA1-Pad4)\"))\n (pad 13 thru_hole oval (at 0 15.24 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 40 \"Net-(XA1-Pad13)\"))\n (pad 6 thru_hole oval (at 2.54 5.08 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 41 \"Net-(XA1-Pad6)\"))\n (pad 15 thru_hole oval (at 0 17.78 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 42 \"Net-(XA1-Pad15)\"))\n (pad 8 thru_hole oval (at 2.54 7.62 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 43 \"Net-(XA1-Pad8)\"))\n (pad 17 thru_hole oval (at 0 20.32 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 44 \"Net-(XA1-Pad17)\"))\n (pad 10 thru_hole oval (at 2.54 10.16 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 45 \"Net-(XA1-Pad10)\"))\n (pad 19 thru_hole oval (at 0 22.86 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 46 \"Net-(XA1-Pad19)\"))\n (pad 12 thru_hole oval (at 2.54 12.7 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 47 \"Net-(XA1-Pad12)\"))\n (pad 21 thru_hole oval (at 0 25.4 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 48 \"Net-(XA1-Pad21)\"))\n (pad 14 thru_hole oval (at 2.54 15.24 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 49 \"Net-(XA1-Pad14)\"))\n (pad 23 thru_hole oval (at 0 27.94 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 50 \"Net-(XA1-Pad23)\"))\n (pad 16 thru_hole oval (at 2.54 17.78 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 51 \"Net-(XA1-Pad16)\"))\n (pad 25 thru_hole oval (at 0 30.48 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 52 \"Net-(XA1-Pad25)\"))\n (pad 18 thru_hole oval (at 2.54 20.32 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 53 \"Net-(XA1-Pad18)\"))\n (pad 27 thru_hole oval (at 0 33.02 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 54 \"Net-(XA1-Pad27)\"))\n (pad 20 thru_hole oval (at 2.54 22.86 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 55 \"Net-(XA1-Pad20)\"))\n (pad 29 thru_hole oval (at 0 35.56 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 56 \"Net-(XA1-Pad29)\"))\n (pad 22 thru_hole oval (at 2.54 25.4 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 57 \"Net-(XA1-Pad22)\"))\n (pad 31 thru_hole oval (at 0 38.1 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 58 \"Net-(XA1-Pad31)\"))\n (pad 24 thru_hole oval (at 2.54 27.94 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 59 \"Net-(XA1-Pad24)\"))\n (pad 26 thru_hole oval (at 2.54 30.48 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 60 \"Net-(XA1-Pad26)\"))\n (pad 33 thru_hole oval (at 0 40.64 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 61 \"Net-(XA1-Pad33)\"))\n (pad 28 thru_hole oval (at 2.54 33.02 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 62 \"Net-(XA1-Pad28)\"))\n (pad 32 thru_hole oval (at 2.54 38.1 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 63 \"Net-(XA1-Pad32)\"))\n (pad 34 thru_hole oval (at 2.54 40.64 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 64 \"Net-(XA1-Pad34)\"))\n (pad 36 thru_hole oval (at 2.54 43.18 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 65 \"Net-(XA1-Pad36)\"))\n (pad 38 thru_hole oval (at 2.54 45.72 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 66 \"Net-(XA1-Pad38)\"))\n (pad 35 thru_hole oval (at 0 43.18 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 67 \"Net-(XA1-Pad35)\"))\n (pad 37 thru_hole oval (at 0 45.72 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 68 \"Net-(XA1-Pad37)\"))\n (pad 3 thru_hole oval (at 0 2.54 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 69 \"Net-(XA1-Pad3)\"))\n (pad 5 thru_hole oval (at 0 5.08 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 70 \"Net-(XA1-Pad5)\"))\n (pad 7 thru_hole oval (at 0 7.62 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 71 \"Net-(XA1-Pad7)\"))\n (pad 9 thru_hole oval (at 0 10.16 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 72 \"Net-(XA1-Pad9)\"))\n (pad 39 thru_hole oval (at 0 48.26 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 73 \"Net-(XA1-Pad39)\"))\n (pad 40 thru_hole oval (at 2.54 48.26 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 74 \"Net-(XA1-Pad40)\"))\n (pad 30 thru_hole oval (at 2.54 35.56 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 75 \"Net-(XA1-Pad30)\"))\n (pad 41 thru_hole rect (at -71.12 0 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 25 \"Net-(P1-Pad1)\"))\n (pad 42 thru_hole oval (at -68.58 0 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 26 \"Net-(P1-Pad3)\"))\n (pad 43 thru_hole oval (at -71.12 2.54 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n (pad 44 thru_hole oval (at -68.58 2.54 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 76 \"Net-(XA1-Pad44)\"))\n (pad 45 thru_hole oval (at -71.12 5.08 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 77 \"Net-(XA1-Pad45)\"))\n (pad 46 thru_hole oval (at -68.58 5.08 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 78 \"Net-(XA1-Pad46)\"))\n (pad 47 thru_hole oval (at -71.12 7.62 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 79 \"Net-(XA1-Pad47)\"))\n (pad 48 thru_hole oval (at -68.58 7.62 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 80 \"Net-(XA1-Pad48)\"))\n (pad 49 thru_hole oval (at -71.12 10.16 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 31 /ciaaConector/PWM))\n (pad 50 thru_hole oval (at -68.58 10.16 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 81 \"Net-(XA1-Pad50)\"))\n (pad 51 thru_hole oval (at -71.12 12.7 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 82 \"Net-(XA1-Pad51)\"))\n (pad 52 thru_hole oval (at -68.58 12.7 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 83 \"Net-(XA1-Pad52)\"))\n (pad 53 thru_hole oval (at -71.12 15.24 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 84 \"Net-(XA1-Pad53)\"))\n (pad 54 thru_hole oval (at -68.58 15.24 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 85 \"Net-(XA1-Pad54)\"))\n (pad 55 thru_hole oval (at -71.12 17.78 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 86 \"Net-(XA1-Pad55)\"))\n (pad 56 thru_hole oval (at -68.58 17.78 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 87 \"Net-(XA1-Pad56)\"))\n (pad 57 thru_hole oval (at -71.12 20.32 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 88 \"Net-(XA1-Pad57)\"))\n (pad 58 thru_hole oval (at -68.58 20.32 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 27 /ciaaConector/LED_1))\n (pad 59 thru_hole oval (at -71.12 22.86 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 89 \"Net-(XA1-Pad59)\"))\n (pad 60 thru_hole oval (at -68.58 22.86 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 13 /buttons/BTN_LED_1))\n (pad 61 thru_hole oval (at -71.12 25.4 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 90 \"Net-(XA1-Pad61)\"))\n (pad 62 thru_hole oval (at -68.58 25.4 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 14 /buttons/BTN_CFG_1))\n (pad 63 thru_hole oval (at -71.12 27.94 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 91 \"Net-(XA1-Pad63)\"))\n (pad 64 thru_hole oval (at -68.58 27.94 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 16 /buttons/BTN_CFG_2))\n (pad 65 thru_hole oval (at -71.12 30.48 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 92 \"Net-(XA1-Pad65)\"))\n (pad 66 thru_hole oval (at -68.58 30.48 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 15 /buttons/BTN_LED_2))\n (pad 67 thru_hole oval (at -71.12 33.02 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 93 \"Net-(XA1-Pad67)\"))\n (pad 68 thru_hole oval (at -68.58 33.02 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 28 /ciaaConector/LED_2))\n (pad 69 thru_hole oval (at -71.12 35.56 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 94 \"Net-(XA1-Pad69)\"))\n (pad 70 thru_hole oval (at -68.58 35.56 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 95 \"Net-(XA1-Pad70)\"))\n (pad 71 thru_hole oval (at -71.12 38.1 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 96 \"Net-(XA1-Pad71)\"))\n (pad 72 thru_hole oval (at -68.58 38.1 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 97 \"Net-(XA1-Pad72)\"))\n (pad 73 thru_hole oval (at -71.12 40.64 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 30 /ciaaConector/LED_4))\n (pad 74 thru_hole oval (at -68.58 40.64 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 29 /ciaaConector/LED_3))\n (pad 75 thru_hole oval (at -71.12 43.18 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 18 /buttons/BTN_LED_4))\n (pad 76 thru_hole oval (at -68.58 43.18 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 17 /buttons/BTN_CFG_3))\n (pad 77 thru_hole oval (at -71.12 45.72 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n (pad 78 thru_hole oval (at -68.58 45.72 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 23 /buttons/BTN_LED_3))\n (pad 79 thru_hole oval (at -71.12 48.26 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 1 GND))\n (pad 80 thru_hole oval (at -68.58 48.26 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)\n (net 24 /buttons/BTN_CFG_4))\n )\n\n (module Resistors_THT:R_Axial_DIN0207_L6.3mm_D2.5mm_P10.16mm_Horizontal (layer F.Cu) (tedit 59573707) (tstamp 59574258)\n (at 99.4 58.3 90)\n (descr \"Resistor, Axial_DIN0207 series, Axial, Horizontal, pin pitch=10.16mm, 0.25W = 1/4W, length*diameter=6.3*2.5mm^2, http://cdn-reichelt.de/documents/datenblatt/B400/1_4W%23YAG.pdf\")\n (tags \"Resistor Axial_DIN0207 series Axial Horizontal pin pitch 10.16mm 0.25W = 1/4W length 6.3mm diameter 2.5mm\")\n (path /59572EFC)\n (fp_text reference \"R 0 Ohm\" (at 5.08 -2.31 90) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value R (at 5.08 2.31 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_line (start 1.93 -1.25) (end 1.93 1.25) (layer F.Fab) (width 0.1))\n (fp_line (start 1.93 1.25) (end 8.23 1.25) (layer F.Fab) (width 0.1))\n (fp_line (start 8.23 1.25) (end 8.23 -1.25) (layer F.Fab) (width 0.1))\n (fp_line (start 8.23 -1.25) (end 1.93 -1.25) (layer F.Fab) (width 0.1))\n (fp_line (start 0 0) (end 1.93 0) (layer F.Fab) (width 0.1))\n (fp_line (start 10.16 0) (end 8.23 0) (layer F.Fab) (width 0.1))\n (fp_line (start 1.87 -1.31) (end 1.87 1.31) (layer F.SilkS) (width 0.12))\n (fp_line (start 1.87 1.31) (end 8.29 1.31) (layer F.SilkS) (width 0.12))\n (fp_line (start 8.29 1.31) (end 8.29 -1.31) (layer F.SilkS) (width 0.12))\n (fp_line (start 8.29 -1.31) (end 1.87 -1.31) (layer F.SilkS) (width 0.12))\n (fp_line (start 0.98 0) (end 1.87 0) (layer F.SilkS) (width 0.12))\n (fp_line (start 9.18 0) (end 8.29 0) (layer F.SilkS) (width 0.12))\n (fp_line (start -1.05 -1.6) (end -1.05 1.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.05 1.6) (end 11.25 1.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start 11.25 1.6) (end 11.25 -1.6) (layer F.CrtYd) (width 0.05))\n (fp_line (start 11.25 -1.6) (end -1.05 -1.6) (layer F.CrtYd) (width 0.05))\n (pad 1 thru_hole circle (at 0 0 90) (size 1.6 1.6) (drill 0.8) (layers *.Cu *.Mask)\n (net 1 GND))\n (pad 2 thru_hole oval (at 10.16 0 90) (size 1.6 1.6) (drill 0.8) (layers *.Cu *.Mask)\n (net 1 GND))\n (model Resistors_THT.3dshapes/R_Axial_DIN0207_L6.3mm_D2.5mm_P10.16mm_Horizontal.wrl\n (at (xyz 0 0 0))\n (scale (xyz 0.393701 0.393701 0.393701))\n (rotate (xyz 0 0 0))\n )\n )\n\n (gr_text \"Poncho juego Simon EDU-CIAA NXP\" (at 109 44.5) (layer F.SilkS) (tstamp 595746E3)\n (effects (font (size 1.5 1.5) (thickness 0.3)))\n )\n (gr_text \"Autor: Juan Agustin Bassi git@gitlab.com:abassi/ponchoSimon.git\\n\" (at 108.25 105.25) (layer F.SilkS) (tstamp 595746E2)\n (effects (font (size 1.5 1.5) (thickness 0.3)))\n )\n (gr_text START (at 105 64.5) (layer F.SilkS) (tstamp 595746E1)\n (effects (font (size 1.5 1.5) (thickness 0.3)))\n )\n (gr_text GAME (at 113 64.5) (layer F.SilkS) (tstamp 595746E0)\n (effects (font (size 1.5 1.5) (thickness 0.3)))\n )\n (gr_text SKILL (at 105 101) (layer F.SilkS) (tstamp 595746DF)\n (effects (font (size 1.5 1.5) (thickness 0.3)))\n )\n (gr_text BEST (at 113 101) (layer F.SilkS) (tstamp 595746DE)\n (effects (font (size 1.5 1.5) (thickness 0.3)))\n )\n (gr_text \"TEC 1\" (at 95.5 64.5) (layer F.SilkS) (tstamp 595746DD)\n (effects (font (size 1.5 1.5) (thickness 0.3)))\n )\n (gr_text \"TEC 2\" (at 122.5 64.5) (layer F.SilkS) (tstamp 595746DC)\n (effects (font (size 1.5 1.5) (thickness 0.3)))\n )\n (gr_text \"TEC 4\" (at 124 101) (layer F.SilkS) (tstamp 595746DB)\n (effects (font (size 1.5 1.5) (thickness 0.3)))\n )\n (gr_text \"TEC 3\\n\" (at 94 101) (layer F.SilkS) (tstamp 595746DA)\n (effects (font (size 1.5 1.5) (thickness 0.3)))\n )\n (gr_text JMP_VDD (at 82.524 46.269) (layer F.SilkS) (tstamp 595746D8)\n (effects (font (size 1.5 1.5) (thickness 0.3)))\n )\n (gr_text 3V3 (at 86.207 50.968) (layer F.SilkS) (tstamp 595746D7)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (gr_text 5V (at 85.953 53.762) (layer F.SilkS) (tstamp 595746D6)\n (effects (font (size 1 0.5) (thickness 0.125)))\n )\n (gr_text \"INDUSTRIA\\nARGENTINA\" (at 143.357 44.872) (layer F.SilkS) (tstamp 595746D5)\n (effects (font (size 1.5 1.5) (thickness 0.1875)))\n )\n (gr_text AMARILLO (at 89 57.75) (layer F.SilkS) (tstamp 595746D4)\n (effects (font (size 2 1.5) (thickness 0.1875)))\n )\n (gr_text ROJO (at 88.62 79.924) (layer F.SilkS) (tstamp 595746D3)\n (effects (font (size 2 2) (thickness 0.1875)))\n )\n (gr_text VERDE (at 129.26 79.924) (layer F.SilkS) (tstamp 595746D2)\n (effects (font (size 2 2) (thickness 0.1875)))\n )\n (gr_text AZUL (at 129.25 57.25) (layer F.SilkS) (tstamp 595746D1)\n (effects (font (size 2 2) (thickness 0.1875)))\n )\n (gr_line (start 67 107.5) (end 67 42.25) (angle 90) (layer Edge.Cuts) (width 0.15) (tstamp 595746D0))\n (gr_line (start 67 42.25) (end 150.25 42.25) (angle 90) (layer Edge.Cuts) (width 0.15) (tstamp 595746CF))\n (gr_line (start 150.25 42.25) (end 150.25 107.5) (angle 90) (layer Edge.Cuts) (width 0.15) (tstamp 595746CE))\n (gr_line (start 150.25 107.5) (end 67 107.5) (angle 90) (layer Edge.Cuts) (width 0.15) (tstamp 595746CD))\n (gr_text \"Autor\\nAgustin Bassi\" (at 140.7 103.3) (layer B.Cu)\n (effects (font (size 1.5 1.5) (thickness 0.3)) (justify mirror))\n )\n (gr_text \"EDU-CIAA NXP\" (at 139.25 47.75) (layer B.Cu)\n (effects (font (size 1.5 1.5) (thickness 0.3)) (justify mirror))\n )\n (gr_text \"PONCHO JUEGO SIMON\" (at 134.75 44.75) (layer B.Cu)\n (effects (font (size 1.5 1.5) (thickness 0.3)) (justify mirror))\n )\n\n (segment (start 104.828971 53.624429) (end 102.212542 51.008) (width 1.2) (layer B.Cu) (net 1))\n (segment (start 102.212542 51.008) (end 99.4 51.008) (width 1.2) (layer B.Cu) (net 1) (tstamp 595730B7))\n (segment (start 72.11 99.228) (end 72.11 100.11) (width 0.6) (layer F.Cu) (net 1))\n (segment (start 86 94.5) (end 85.9608 94.5) (width 0.6) (layer B.Cu) (net 1) (tstamp 595A38D3))\n (segment (start 85.9608 94.5392) (end 86 94.5) (width 0.6) (layer B.Cu) (net 1) (tstamp 595A38D2))\n (segment (start 85.9608 96.4608) (end 85.9608 94.5392) (width 0.6) (layer B.Cu) (net 1) (tstamp 595A38D0))\n (segment (start 86 96.5) (end 85.9608 96.4608) (width 0.6) (layer B.Cu) (net 1) (tstamp 595A38CF))\n (via (at 86 96.5) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 1))\n (segment (start 86 102.5) (end 86 96.5) (width 0.6) (layer F.Cu) (net 1) (tstamp 595A38C9))\n (segment (start 84 104.5) (end 86 102.5) (width 0.6) (layer F.Cu) (net 1) (tstamp 595A38C5))\n (segment (start 76.5 104.5) (end 84 104.5) (width 0.6) (layer F.Cu) (net 1) (tstamp 595A38BA))\n (segment (start 72.11 100.11) (end 76.5 104.5) (width 0.6) (layer F.Cu) (net 1) (tstamp 595A38B7))\n (segment (start 72.11 99.228) (end 72.11 96.688) (width 0.9) (layer B.Cu) (net 1))\n (segment (start 109 88.5) (end 109 90.659) (width 1.5) (layer B.Cu) (net 1))\n (segment (start 109 90.659) (end 108.94 90.719) (width 1.5) (layer B.Cu) (net 1) (tstamp 595956B2))\n (segment (start 109 78.34) (end 109 75.1502) (width 1.5) (layer B.Cu) (net 1))\n (segment (start 109 75.1502) (end 108.9478 75.098) (width 1.5) (layer B.Cu) (net 1) (tstamp 595956A4))\n (segment (start 99.4 51.008) (end 99.4 48.14) (width 1.5) (layer B.Cu) (net 1))\n (segment (start 89.255 51.008) (end 96.6 51.008) (width 1.2) (layer B.Cu) (net 1))\n (segment (start 96.6 51.008) (end 99.4 51.008) (width 1.2) (layer B.Cu) (net 1) (tstamp 59570DD3))\n (segment (start 72.11 53.508) (end 70.908002 53.508) (width 0.9) (layer B.Cu) (net 1))\n (segment (start 85.147 46.9) (end 89.255 51.008) (width 1.5) (layer B.Cu) (net 1) (tstamp 59570D7E))\n (segment (start 72.1 46.9) (end 85.147 46.9) (width 1.2) (layer B.Cu) (net 1) (tstamp 59570D78))\n (segment (start 70.100002 48.899998) (end 72.1 46.9) (width 0.9) (layer B.Cu) (net 1) (tstamp 59570D73))\n (segment (start 70.100002 52.7) (end 70.100002 48.899998) (width 0.9) (layer B.Cu) (net 1) (tstamp 59570D6D))\n (segment (start 70.908002 53.508) (end 70.100002 52.7) (width 0.9) (layer B.Cu) (net 1) (tstamp 59570D6A))\n (segment (start 121.513 90.592) (end 121.513 98.212) (width 0.9) (layer B.Cu) (net 1))\n (segment (start 127.8708 63.4887) (end 127.8708 62.2187) (width 0.6) (layer B.Cu) (net 1) (tstamp 57797282))\n (segment (start 128.6328 64.2507) (end 127.8708 63.4887) (width 0.9) (layer B.Cu) (net 1) (tstamp 57797281))\n (segment (start 131.1728 64.2507) (end 128.6328 64.2507) (width 0.9) (layer B.Cu) (net 1) (tstamp 57797280))\n (segment (start 131.9348 65.0127) (end 131.1728 64.2507) (width 0.9) (layer B.Cu) (net 1) (tstamp 5779727F))\n (segment (start 131.9348 70.6007) (end 131.9348 65.0127) (width 0.9) (layer B.Cu) (net 1) (tstamp 5779727E))\n (segment (start 131.4268 71.1087) (end 131.9348 70.6007) (width 0.6) (layer B.Cu) (net 1) (tstamp 5779727D))\n (segment (start 99.4 58.3) (end 99.4 60.3) (width 1.5) (layer B.Cu) (net 1))\n (segment (start 102.8 63.7) (end 107.2 63.7) (width 1.5) (layer B.Cu) (net 1) (tstamp 59570DE6))\n (segment (start 107.2 63.7) (end 108.9478 65.4478) (width 1.5) (layer B.Cu) (net 1) (tstamp 59570DF0))\n (segment (start 108.9478 65.4478) (end 108.9478 67.3588) (width 1.5) (layer B.Cu) (net 1) (tstamp 59570DF1))\n (segment (start 99.4 60.3) (end 102.8 63.7) (width 1.5) (layer B.Cu) (net 1) (tstamp 595730BB))\n (segment (start 96.367 74.844) (end 96.367 71.161) (width 0.9) (layer B.Cu) (net 1))\n (segment (start 96.367 71.161) (end 96.367 71.1087) (width 0.3048) (layer B.Cu) (net 1) (tstamp 578F6457))\n (segment (start 108.9478 75.098) (end 108.9478 67.3588) (width 1.5) (layer B.Cu) (net 1))\n (segment (start 108.9478 74.9187) (end 108.9478 75.098) (width 0.635) (layer B.Cu) (net 1))\n (segment (start 108.9478 67.3588) (end 108.94 67.351) (width 0.635) (layer B.Cu) (net 1) (tstamp 578F644D))\n (segment (start 108.94 67.351) (end 108.94 67.2987) (width 0.635) (layer B.Cu) (net 1) (tstamp 578F6451))\n (segment (start 121.513 74.844) (end 121.513 71.034) (width 0.9) (layer B.Cu) (net 1))\n (segment (start 121.513 71.034) (end 121.5208 71.034) (width 0.3048) (layer B.Cu) (net 1) (tstamp 578F6446))\n (segment (start 107.5508 74.9187) (end 108.9478 74.9187) (width 0.9) (layer B.Cu) (net 1))\n (segment (start 108.9478 74.9187) (end 110.3448 74.9187) (width 0.9) (layer B.Cu) (net 1) (tstamp 5779933B))\n (segment (start 85.9608 70.6007) (end 86.0243 70.6642) (width 0.3048) (layer B.Cu) (net 1))\n (segment (start 86.0243 70.6642) (end 86.4688 71.1087) (width 0.635) (layer B.Cu) (net 1) (tstamp 577991A3))\n (segment (start 85.9608 65.0127) (end 85.9608 70.6007) (width 0.635) (layer B.Cu) (net 1) (tstamp 577861DB))\n (segment (start 86.7228 64.2507) (end 85.9608 65.0127) (width 0.635) (layer B.Cu) (net 1) (tstamp 577861DA))\n (segment (start 89.2628 64.2507) (end 86.7228 64.2507) (width 0.635) (layer B.Cu) (net 1) (tstamp 577861D9))\n (segment (start 90.0248 63.4887) (end 89.2628 64.2507) (width 0.635) (layer B.Cu) (net 1) (tstamp 577861D8))\n (segment (start 90.0248 62.2187) (end 90.0248 63.4887) (width 0.635) (layer B.Cu) (net 1))\n (segment (start 86.4688 71.1087) (end 96.367 71.1087) (width 0.635) (layer B.Cu) (net 1) (tstamp 577861F6))\n (segment (start 96.367 71.1087) (end 96.3748 71.1087) (width 0.3048) (layer B.Cu) (net 1) (tstamp 578F6458))\n (segment (start 121.5208 71.1087) (end 121.5208 71.034) (width 0.3048) (layer B.Cu) (net 1))\n (segment (start 111.1068 71.1087) (end 121.5208 71.1087) (width 0.6) (layer B.Cu) (net 1) (tstamp 5779727C))\n (segment (start 121.5208 71.1087) (end 131.4268 71.1087) (width 0.6) (layer B.Cu) (net 1) (tstamp 57797285))\n (segment (start 107.5508 67.2987) (end 108.94 67.2987) (width 0.635) (layer B.Cu) (net 1))\n (segment (start 108.94 67.2987) (end 110.3448 67.2987) (width 0.635) (layer B.Cu) (net 1) (tstamp 578F6452))\n (segment (start 96.3748 71.1087) (end 106.7888 71.1087) (width 0.635) (layer B.Cu) (net 1))\n (segment (start 106.7888 71.1087) (end 107.5508 70.3467) (width 0.9) (layer B.Cu) (net 1) (tstamp 577861F7))\n (segment (start 107.5508 70.3467) (end 107.5508 67.2987) (width 0.9) (layer B.Cu) (net 1) (tstamp 577861F8))\n (segment (start 110.3448 67.2987) (end 110.3448 70.3467) (width 0.9) (layer B.Cu) (net 1))\n (segment (start 110.3448 70.3467) (end 111.1068 71.1087) (width 0.9) (layer B.Cu) (net 1) (tstamp 5779727B))\n (segment (start 96.3748 67.2987) (end 96.3748 71.1087) (width 0.9) (layer B.Cu) (net 1))\n (segment (start 121.5208 71.034) (end 121.5208 67.2987) (width 0.9) (layer B.Cu) (net 1) (tstamp 578F6447))\n (segment (start 110.337 90.592) (end 110.337 93.537) (width 0.6) (layer B.Cu) (net 1))\n (segment (start 131.1035 94.8) (end 131.9983 93.9052) (width 0.6) (layer B.Cu) (net 1) (tstamp 5957041D))\n (segment (start 111.6 94.8) (end 131.1035 94.8) (width 0.6) (layer B.Cu) (net 1) (tstamp 5957041A))\n (segment (start 110.337 93.537) (end 111.6 94.8) (width 0.6) (layer B.Cu) (net 1) (tstamp 59570418))\n (segment (start 108.94 98.2867) (end 108.94 90.719) (width 1.2) (layer B.Cu) (net 1))\n (segment (start 108.94 90.719) (end 108.94 90.6667) (width 0.635) (layer B.Cu) (net 1) (tstamp 578F6430))\n (segment (start 96.367 98.339) (end 96.367 94.529) (width 1.2) (layer B.Cu) (net 1))\n (segment (start 96.367 94.529) (end 96.367 94.4767) (width 0.3048) (layer B.Cu) (net 1) (tstamp 578F641A))\n (segment (start 107.5508 98.2867) (end 108.94 98.2867) (width 0.635) (layer B.Cu) (net 1))\n (segment (start 108.94 98.2867) (end 110.3448 98.2867) (width 0.635) (layer B.Cu) (net 1) (tstamp 578F642A))\n (segment (start 107.5508 90.6667) (end 108.94 90.6667) (width 0.635) (layer B.Cu) (net 1))\n (segment (start 108.94 90.6667) (end 109.0748 90.6667) (width 0.635) (layer B.Cu) (net 1) (tstamp 578F6431))\n (segment (start 109.0748 90.6667) (end 110.3448 90.6667) (width 0.635) (layer B.Cu) (net 1) (tstamp 57799351))\n (segment (start 128.6328 87.6187) (end 127.8708 86.8567) (width 0.6) (layer B.Cu) (net 1) (tstamp 577972DB))\n (segment (start 127.8708 86.8567) (end 127.8708 85.5867) (width 0.6) (layer B.Cu) (net 1) (tstamp 577972DA))\n (segment (start 86.4688 94.4767) (end 96.367 94.4767) (width 0.6) (layer B.Cu) (net 1) (tstamp 577972ED))\n (segment (start 85.9608 93.9687) (end 86.4688 94.4767) (width 0.6) (layer B.Cu) (net 1) (tstamp 577972E7))\n (segment (start 85.9608 94.5) (end 85.9608 93.9687) (width 1.2) (layer B.Cu) (net 1) (tstamp 595A38D4))\n (segment (start 96.367 94.4767) (end 96.3748 94.4767) (width 0.3048) (layer B.Cu) (net 1) (tstamp 578F641B))\n (segment (start 90.0248 85.5867) (end 90.0248 86.3567) (width 0.3048) (layer B.Cu) (net 1) (tstamp 577972EC))\n (segment (start 85.9608 88.3807) (end 85.9608 94.5) (width 1.2) (layer B.Cu) (net 1) (tstamp 577972EB))\n (segment (start 90.0248 86.3567) (end 88.4628 87.9187) (width 0.6) (layer B.Cu) (net 1) (tstamp 577972E8))\n (segment (start 88.4628 87.9187) (end 86.4228 87.9187) (width 0.6) (layer B.Cu) (net 1) (tstamp 577972E9))\n (segment (start 86.4228 87.9187) (end 85.9608 88.3807) (width 0.6) (layer B.Cu) (net 1) (tstamp 577972EA))\n (segment (start 96.3748 90.6667) (end 96.3748 94.4767) (width 1.2) (layer B.Cu) (net 1) (tstamp 577972E6))\n (segment (start 107.5508 93.7147) (end 107.5508 90.6667) (width 0.9) (layer B.Cu) (net 1) (tstamp 577972E5))\n (segment (start 106.7888 94.4767) (end 107.5508 93.7147) (width 0.9) (layer B.Cu) (net 1) (tstamp 577972E4))\n (segment (start 96.3748 94.4767) (end 106.7888 94.4767) (width 0.6) (layer B.Cu) (net 1) (tstamp 577972E3))\n (segment (start 131.4268 94.4767) (end 131.9983 93.9052) (width 0.3048) (layer B.Cu) (net 1) (tstamp 577972DF))\n (segment (start 131.9983 93.9052) (end 131.9348 93.9687) (width 0.3048) (layer B.Cu) (net 1) (tstamp 57799A41))\n (segment (start 131.9348 93.9687) (end 131.9348 88.3807) (width 0.9) (layer B.Cu) (net 1) (tstamp 577972DE))\n (segment (start 131.9348 88.3807) (end 131.1728 87.6187) (width 0.9) (layer B.Cu) (net 1) (tstamp 577972DD))\n (segment (start 131.1728 87.6187) (end 128.6328 87.6187) (width 0.6) (layer B.Cu) (net 1) (tstamp 577972DC))\n (segment (start 87.4848 62.2187) (end 87.7388 61.9647) (width 0.3048) (layer B.Cu) (net 2) (tstamp 577861A8))\n (segment (start 87.7388 61.9647) (end 87.4848 62.2187) (width 0.3048) (layer B.Cu) (net 2) (tstamp 577861AA))\n (segment (start 83.4208 62.2187) (end 87.4848 62.2187) (width 1.2) (layer B.Cu) (net 2))\n (segment (start 134.4748 62.2187) (end 130.4108 62.2187) (width 0.9) (layer B.Cu) (net 3))\n (segment (start 134.4748 85.5867) (end 130.4108 85.5867) (width 0.9) (layer B.Cu) (net 4) (tstamp 577972EE))\n (segment (start 120.410164 56.516464) (end 120.936536 56.516464) (width 0.3048) (layer B.Cu) (net 5))\n (segment (start 123.2353 54.2177) (end 123.2353 52.0587) (width 0.9) (layer B.Cu) (net 5) (tstamp 57799117))\n (segment (start 120.936536 56.516464) (end 123.2353 54.2177) (width 0.9) (layer B.Cu) (net 5) (tstamp 57799116))\n (segment (start 119.140164 57.786464) (end 117.616164 57.786465) (width 0.9) (layer B.Cu) (net 6))\n (segment (start 113.552164 53.722465) (end 111.266164 53.722465) (width 0.9) (layer B.Cu) (net 6) (tstamp 57796343))\n (segment (start 117.616164 57.786465) (end 113.552164 53.722465) (width 0.9) (layer B.Cu) (net 6) (tstamp 57796341))\n (segment (start 111.266164 53.722465) (end 111.178971 53.624429) (width 0.3048) (layer B.Cu) (net 6) (tstamp 57796346))\n (segment (start 111.262972 53.694429) (end 111.178971 53.624429) (width 0.3048) (layer B.Cu) (net 6) (tstamp 5778582A))\n (segment (start 82.1508 64.5047) (end 82.1508 60.9487) (width 0.45) (layer B.Cu) (net 7) (tstamp 577861A5))\n (segment (start 82.6588 65.0127) (end 82.1508 64.5047) (width 0.635) (layer B.Cu) (net 7) (tstamp 577861A4))\n (segment (start 83.4208 65.0127) (end 82.6588 65.0127) (width 0.635) (layer B.Cu) (net 7) (tstamp 577861A3))\n (segment (start 83.9288 65.5207) (end 83.4208 65.0127) (width 0.635) (layer B.Cu) (net 7) (tstamp 577861A2))\n (segment (start 83.9288 67.0447) (end 83.9288 65.5207) (width 0.635) (layer B.Cu) (net 7))\n (segment (start 81.08405 65.21595) (end 81.08405 65.08405) (width 0.6) (layer B.Cu) (net 8))\n (segment (start 80.873 64.873) (end 80.873 62.144) (width 0.6) (layer B.Cu) (net 8) (tstamp 595730D1))\n (segment (start 81.08405 65.08405) (end 80.873 64.873) (width 0.6) (layer B.Cu) (net 8) (tstamp 595730D0))\n (segment (start 82.1508 66.2827) (end 81.08405 65.21595) (width 0.45) (layer B.Cu) (net 8) (tstamp 5778619C))\n (segment (start 81.08405 65.21595) (end 80.8808 65.0127) (width 0.45) (layer B.Cu) (net 8) (tstamp 595730CE))\n (segment (start 82.1508 69.0767) (end 82.1508 66.2827) (width 0.45) (layer B.Cu) (net 8) (tstamp 5778619A))\n (segment (start 80.3728 70.8547) (end 82.1508 69.0767) (width 0.9) (layer B.Cu) (net 8) (tstamp 57786198))\n (segment (start 80.3728 74.6647) (end 80.3728 70.8547) (width 0.9) (layer B.Cu) (net 8))\n (segment (start 135.7448 63.4887) (end 135.7448 64.5047) (width 0.9) (layer B.Cu) (net 9))\n (segment (start 133.9668 65.5207) (end 133.9668 66.7907) (width 0.9) (layer B.Cu) (net 9) (tstamp 577972C7))\n (segment (start 134.4748 65.0127) (end 133.9668 65.5207) (width 0.9) (layer B.Cu) (net 9) (tstamp 577972C6))\n (segment (start 135.2368 65.0127) (end 134.4748 65.0127) (width 0.9) (layer B.Cu) (net 9) (tstamp 577972C5))\n (segment (start 135.7448 64.5047) (end 135.2368 65.0127) (width 0.9) (layer B.Cu) (net 9) (tstamp 577972C4))\n (segment (start 133.9668 66.7907) (end 134.2208 67.0447) (width 0.3048) (layer B.Cu) (net 9) (tstamp 577972C8))\n (segment (start 137.5228 74.6647) (end 137.5228 70.8547) (width 0.9) (layer B.Cu) (net 10))\n (segment (start 137.0148 65.0127) (end 137.0148 62.2187) (width 0.45) (layer B.Cu) (net 10) (tstamp 577972D0))\n (segment (start 135.7448 66.2827) (end 137.0148 65.0127) (width 0.45) (layer B.Cu) (net 10) (tstamp 577972CF))\n (segment (start 135.7448 69.0767) (end 135.7448 66.2827) (width 0.45) (layer B.Cu) (net 10) (tstamp 577972CE))\n (segment (start 137.5228 70.8547) (end 135.7448 69.0767) (width 0.9) (layer B.Cu) (net 10) (tstamp 577972CD))\n (segment (start 133.9668 90.1587) (end 134.2208 90.4127) (width 0.3048) (layer B.Cu) (net 11) (tstamp 577972F7))\n (segment (start 133.9668 88.8887) (end 133.9668 90.1587) (width 0.6) (layer B.Cu) (net 11) (tstamp 577972F3))\n (segment (start 134.4748 88.3807) (end 133.9668 88.8887) (width 0.6) (layer B.Cu) (net 11) (tstamp 577972F4))\n (segment (start 135.2368 88.3807) (end 134.4748 88.3807) (width 0.6) (layer B.Cu) (net 11) (tstamp 577972F5))\n (segment (start 135.7448 87.8727) (end 135.2368 88.3807) (width 0.6) (layer B.Cu) (net 11) (tstamp 577972F6))\n (segment (start 135.7448 86.8567) (end 135.7448 87.8727) (width 0.6) (layer B.Cu) (net 11) (tstamp 577972F2))\n (segment (start 137.6 86.105) (end 137.007 85.512) (width 0.6) (layer B.Cu) (net 12) (tstamp 595710AD))\n (segment (start 137.6 87.6) (end 137.6 86.105) (width 0.6) (layer B.Cu) (net 12) (tstamp 595710A8))\n (segment (start 135.7 89.5) (end 137.6 87.6) (width 0.6) (layer B.Cu) (net 12) (tstamp 595710A4))\n (segment (start 135.7 93.8) (end 135.7 89.5) (width 0.6) (layer B.Cu) (net 12) (tstamp 5957109D))\n (segment (start 137.515 98.085) (end 137.515 95.615) (width 0.6) (layer B.Cu) (net 12))\n (segment (start 137.515 95.615) (end 135.7 93.8) (width 0.6) (layer B.Cu) (net 12) (tstamp 5957109B))\n (segment (start 74.65 73.828) (end 76.828 73.828) (width 0.9) (layer B.Cu) (net 13))\n (segment (start 81 77.6) (end 85.483 77.6) (width 0.45) (layer B.Cu) (net 13) (tstamp 595715AB))\n (segment (start 85.483 77.6) (end 88.239 74.844) (width 0.45) (layer B.Cu) (net 13) (tstamp 59570BCA))\n (segment (start 79.1 77.6) (end 77.2 75.7) (width 0.45) (layer B.Cu) (net 13) (tstamp 595715AD))\n (segment (start 77.2 75.7) (end 77.2 74.2) (width 0.45) (layer B.Cu) (net 13) (tstamp 595715AF))\n (segment (start 77.2 74.2) (end 76.9 73.9) (width 0.45) (layer B.Cu) (net 13) (tstamp 595715B1))\n (segment (start 81 77.6) (end 79.1 77.6) (width 0.45) (layer B.Cu) (net 13))\n (segment (start 76.828 73.828) (end 76.9 73.9) (width 0.9) (layer B.Cu) (net 13) (tstamp 59572D3C))\n (segment (start 91.287 74.844) (end 91.287 72.939) (width 1.2) (layer B.Cu) (net 13))\n (segment (start 91.287 69.637) (end 91.287 67.224) (width 1.2) (layer B.Cu) (net 13) (tstamp 57980540))\n (via (at 91.287 69.637) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 13))\n (segment (start 91.287 72.939) (end 91.287 69.637) (width 0.3048) (layer F.Cu) (net 13) (tstamp 5798053D))\n (via (at 91.287 72.939) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 13))\n (segment (start 91.0408 74.6647) (end 91.2948 74.9187) (width 0.3048) (layer B.Cu) (net 13) (tstamp 577861FD))\n (segment (start 88.2468 74.6647) (end 91.0408 74.6647) (width 1.2) (layer B.Cu) (net 13))\n (segment (start 74.65 76.368) (end 75.668 76.368) (width 0.9) (layer B.Cu) (net 14))\n (segment (start 77.9 78.6) (end 76.8 77.5) (width 0.45) (layer B.Cu) (net 14) (tstamp 59571D85))\n (segment (start 95.659 78.6) (end 99.415 74.844) (width 0.45) (layer B.Cu) (net 14) (tstamp 59570BB3))\n (segment (start 95.659 78.6) (end 77.9 78.6) (width 0.45) (layer B.Cu) (net 14))\n (segment (start 75.668 76.368) (end 76.8 77.5) (width 0.9) (layer B.Cu) (net 14) (tstamp 59572D3F))\n (segment (start 102.463 74.844) (end 102.463 72.685) (width 0.9) (layer B.Cu) (net 14))\n (segment (start 102.463 69.002) (end 102.463 67.224) (width 0.9) (layer B.Cu) (net 14) (tstamp 57980538))\n (segment (start 102.336 69.129) (end 102.463 69.002) (width 0.3048) (layer B.Cu) (net 14) (tstamp 57980537))\n (via (at 102.336 69.129) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 14))\n (segment (start 102.336 72.558) (end 102.336 69.129) (width 0.3048) (layer F.Cu) (net 14) (tstamp 57980535))\n (segment (start 102.463 72.685) (end 102.336 72.558) (width 0.3048) (layer F.Cu) (net 14) (tstamp 57980534))\n (via (at 102.463 72.685) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 14))\n (segment (start 102.4708 74.9187) (end 99.4228 74.9187) (width 0.9) (layer B.Cu) (net 14))\n (segment (start 74.65 81.448) (end 77.152 81.448) (width 0.9) (layer B.Cu) (net 15))\n (segment (start 95.1 80.8) (end 77.8 80.8) (width 0.45) (layer B.Cu) (net 15) (tstamp 59571DCD))\n (segment (start 77.8 80.8) (end 77.3 81.3) (width 0.45) (layer B.Cu) (net 15) (tstamp 59571DD0))\n (segment (start 119.237 82.2) (end 126.593 74.844) (width 0.9) (layer B.Cu) (net 15) (tstamp 59570AF5))\n (segment (start 96.5 82.2) (end 119.237 82.2) (width 0.9) (layer B.Cu) (net 15) (tstamp 59570AF1))\n (segment (start 96.05 81.75) (end 96.5 82.2) (width 0.45) (layer B.Cu) (net 15) (tstamp 59570AE9))\n (segment (start 96.05 81.75) (end 95.1 80.8) (width 0.45) (layer B.Cu) (net 15))\n (segment (start 77.152 81.448) (end 77.3 81.3) (width 0.9) (layer B.Cu) (net 15) (tstamp 59572D4C))\n (segment (start 129.641 74.717) (end 126.72 74.717) (width 0.9) (layer B.Cu) (net 15))\n (segment (start 126.72 74.717) (end 126.593 74.844) (width 0.9) (layer B.Cu) (net 15) (tstamp 595705D4))\n (segment (start 126.593 74.844) (end 126.593 72.812) (width 0.9) (layer B.Cu) (net 15))\n (segment (start 126.593 69.637) (end 126.593 67.224) (width 0.9) (layer B.Cu) (net 15) (tstamp 57980517))\n (via (at 126.593 69.637) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 15))\n (segment (start 126.593 72.812) (end 126.593 69.637) (width 0.3048) (layer F.Cu) (net 15) (tstamp 57980514))\n (via (at 126.593 72.812) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 15))\n (segment (start 126.6008 74.9187) (end 126.8548 74.6647) (width 0.3048) (layer B.Cu) (net 15))\n (segment (start 74.65 78.908) (end 76.108 78.908) (width 0.9) (layer B.Cu) (net 16))\n (segment (start 76.108 78.908) (end 76.8 79.6) (width 0.9) (layer B.Cu) (net 16) (tstamp 59572D42))\n (segment (start 96.1 79.6) (end 76.8 79.6) (width 0.45) (layer B.Cu) (net 16))\n (segment (start 96.1 79.6) (end 97 80.5) (width 0.45) (layer B.Cu) (net 16) (tstamp 59570B75))\n (segment (start 97 80.5) (end 112.936 80.5) (width 0.9) (layer B.Cu) (net 16) (tstamp 59570B79))\n (segment (start 118.465 74.971) (end 112.936 80.5) (width 0.9) (layer B.Cu) (net 16) (tstamp 59570B82))\n (segment (start 76.8 79.6) (end 76.9 79.7) (width 0.45) (layer B.Cu) (net 16) (tstamp 59571DBF))\n (segment (start 115.417 74.844) (end 115.417 72.939) (width 0.9) (layer B.Cu) (net 16))\n (segment (start 115.417 69.51) (end 115.417 67.224) (width 0.9) (layer B.Cu) (net 16) (tstamp 57980526))\n (via (at 115.417 69.51) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 16))\n (segment (start 115.417 72.939) (end 115.417 69.51) (width 0.3048) (layer F.Cu) (net 16) (tstamp 57980523))\n (via (at 115.417 72.939) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 16))\n (segment (start 115.4248 74.9187) (end 119.2348 74.9187) (width 0.9) (layer B.Cu) (net 16))\n (segment (start 74.65 94.148) (end 76.548 94.148) (width 0.9) (layer B.Cu) (net 17))\n (segment (start 77.5 95.1) (end 76.75 94.35) (width 0.45) (layer B.Cu) (net 17) (tstamp 59571755))\n (segment (start 77.5 99.6) (end 77.5 95.1) (width 0.45) (layer B.Cu) (net 17) (tstamp 59571753))\n (segment (start 78.9 101) (end 77.5 99.6) (width 0.45) (layer B.Cu) (net 17) (tstamp 5957174D))\n (segment (start 85.1 101) (end 78.9 101) (width 0.6) (layer B.Cu) (net 17) (tstamp 59571744))\n (segment (start 85.1 101) (end 88.142 97.958) (width 0.6) (layer B.Cu) (net 17) (tstamp 59571741))\n (segment (start 76.548 94.148) (end 76.75 94.35) (width 0.9) (layer B.Cu) (net 17) (tstamp 59572D5E))\n (segment (start 88.239 97.958) (end 88.142 97.958) (width 0.45) (layer B.Cu) (net 17))\n (segment (start 91.287 98.339) (end 91.287 96.18) (width 0.9) (layer B.Cu) (net 17))\n (segment (start 91.287 93.005) (end 91.287 90.719) (width 0.9) (layer B.Cu) (net 17) (tstamp 579804D1))\n (via (at 91.287 93.005) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 17))\n (segment (start 91.287 96.18) (end 91.287 93.005) (width 0.3048) (layer F.Cu) (net 17) (tstamp 579804CE))\n (via (at 91.287 96.18) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 17))\n (segment (start 91.0408 98.0327) (end 91.2948 98.2867) (width 0.3048) (layer B.Cu) (net 17) (tstamp 57797331))\n (segment (start 88.2468 98.0327) (end 91.0408 98.0327) (width 0.9) (layer B.Cu) (net 17) (tstamp 57797330))\n (segment (start 74.6534 94.1514) (end 74.65 94.148) (width 0.3048) (layer B.Cu) (net 17) (tstamp 578EDAAD))\n (segment (start 70.1 95.2) (end 70.1 94.9) (width 0.9) (layer B.Cu) (net 18))\n (segment (start 129.641 100.059) (end 125.1 104.6) (width 0.6) (layer B.Cu) (net 18) (tstamp 59571839))\n (segment (start 125.1 104.6) (end 73.9 104.6) (width 0.6) (layer B.Cu) (net 18) (tstamp 5957183F))\n (segment (start 73.9 104.6) (end 70.1 100.8) (width 0.6) (layer B.Cu) (net 18) (tstamp 59571844))\n (segment (start 70.1 100.8) (end 70.1 95.2) (width 0.6) (layer B.Cu) (net 18) (tstamp 5957184D))\n (segment (start 129.641 98.085) (end 129.641 100.059) (width 0.6) (layer B.Cu) (net 18))\n (segment (start 70.852 94.148) (end 72.11 94.148) (width 0.9) (layer B.Cu) (net 18) (tstamp 59572D74))\n (segment (start 70.1 94.9) (end 70.852 94.148) (width 0.9) (layer B.Cu) (net 18) (tstamp 59572D71))\n (segment (start 126.593 98.212) (end 126.593 96.434) (width 0.9) (layer B.Cu) (net 18))\n (segment (start 126.593 92.878) (end 126.593 90.592) (width 0.9) (layer B.Cu) (net 18) (tstamp 579804B8))\n (via (at 126.593 92.878) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 18))\n (segment (start 126.593 96.434) (end 126.593 92.878) (width 0.3048) (layer F.Cu) (net 18) (tstamp 579804B1))\n (via (at 126.593 96.434) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 18))\n (segment (start 129.641 98.085) (end 126.72 98.085) (width 0.9) (layer B.Cu) (net 18))\n (segment (start 126.72 98.085) (end 126.593 98.212) (width 0.3048) (layer B.Cu) (net 18) (tstamp 578F69ED))\n (segment (start 118.973 55.286) (end 118.973 51.015307) (width 1.5) (layer B.Cu) (net 19))\n (segment (start 118.7 50.742307) (end 117.108164 49.150464) (width 1.5) (layer B.Cu) (net 19) (tstamp 5779633D))\n (segment (start 117.108164 49.150464) (end 115.584164 49.150465) (width 1.5) (layer B.Cu) (net 19) (tstamp 5779633E))\n (segment (start 118.973 51.015307) (end 118.7 50.742307) (width 1.5) (layer B.Cu) (net 19) (tstamp 59570D1F))\n (segment (start 83.4208 85.5867) (end 87.4848 85.5867) (width 0.9) (layer B.Cu) (net 20) (tstamp 577972EF))\n (segment (start 87.7388 85.3327) (end 87.4848 85.5867) (width 0.3048) (layer B.Cu) (net 20) (tstamp 577972F1))\n (segment (start 87.4848 85.5867) (end 87.7388 85.3327) (width 0.3048) (layer B.Cu) (net 20) (tstamp 577972F0))\n (segment (start 83.9288 88.8887) (end 83.4208 88.3807) (width 0.6) (layer B.Cu) (net 21) (tstamp 577972FC))\n (segment (start 83.4208 88.3807) (end 82.6588 88.3807) (width 0.6) (layer B.Cu) (net 21) (tstamp 577972FB))\n (segment (start 82.6588 88.3807) (end 82.1508 87.8727) (width 0.6) (layer B.Cu) (net 21) (tstamp 577972FA))\n (segment (start 83.9288 90.4127) (end 83.9288 88.8887) (width 0.6) (layer B.Cu) (net 21) (tstamp 577972F8))\n (segment (start 82.1508 87.8727) (end 82.1508 84.3167) (width 0.45) (layer B.Cu) (net 21) (tstamp 577972F9))\n (segment (start 80.3728 94.2227) (end 82.1508 92.4447) (width 1.5) (layer B.Cu) (net 22) (tstamp 57797306))\n (segment (start 82.1508 92.4447) (end 82.1508 89.6507) (width 0.45) (layer B.Cu) (net 22) (tstamp 57797305))\n (segment (start 82.1508 89.6507) (end 80.8808 88.3807) (width 0.45) (layer B.Cu) (net 22) (tstamp 57797304))\n (segment (start 80.3728 98.0327) (end 80.3728 94.2227) (width 1.5) (layer B.Cu) (net 22) (tstamp 57797302))\n (segment (start 80.8808 88.3807) (end 80.8808 85.5867) (width 0.6) (layer B.Cu) (net 22) (tstamp 57797303))\n (segment (start 74.65 96.688) (end 76.488 96.688) (width 0.45) (layer B.Cu) (net 23))\n (segment (start 95.8 102.2) (end 99.415 98.585) (width 0.6) (layer B.Cu) (net 23) (tstamp 5957175E))\n (segment (start 95.8 102.2) (end 78.1 102.2) (width 0.6) (layer B.Cu) (net 23) (tstamp 5957176C))\n (segment (start 78.1 102.2) (end 76.6 100.7) (width 0.45) (layer B.Cu) (net 23) (tstamp 59571774))\n (segment (start 76.6 96.8) (end 76.6 100.7) (width 0.45) (layer B.Cu) (net 23))\n (segment (start 76.488 96.688) (end 76.6 96.8) (width 0.45) (layer B.Cu) (net 23) (tstamp 59572D61))\n (segment (start 99.415 98.466) (end 99.415 98.585) (width 0.9) (layer B.Cu) (net 23))\n (segment (start 102.463 98.339) (end 102.463 96.434) (width 0.9) (layer B.Cu) (net 23))\n (segment (start 102.463 93.005) (end 102.463 90.719) (width 0.9) (layer B.Cu) (net 23) (tstamp 579804C9))\n (via (at 102.463 93.005) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 23))\n (segment (start 102.463 96.434) (end 102.463 93.005) (width 0.3048) (layer F.Cu) (net 23) (tstamp 579804C6))\n (via (at 102.463 96.434) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 23))\n (segment (start 102.4708 98.2867) (end 99.4228 98.2867) (width 0.9) (layer B.Cu) (net 23) (tstamp 5779733C))\n (segment (start 99.4228 98.2867) (end 98.6608 98.2867) (width 0.3048) (layer B.Cu) (net 23) (tstamp 57797337))\n (segment (start 74.65 99.228) (end 74.65 100.85) (width 0.9) (layer B.Cu) (net 24))\n (segment (start 114.3 103.4) (end 77.2 103.4) (width 0.6) (layer B.Cu) (net 24) (tstamp 59571822))\n (segment (start 77.2 103.4) (end 74.9 101.1) (width 0.6) (layer B.Cu) (net 24) (tstamp 5957182E))\n (segment (start 114.3 103.4) (end 118.465 99.235) (width 0.6) (layer B.Cu) (net 24) (tstamp 5957181E))\n (segment (start 74.65 100.85) (end 74.9 101.1) (width 0.9) (layer B.Cu) (net 24) (tstamp 59572D6C))\n (segment (start 118.465 98.339) (end 118.465 99.235) (width 0.45) (layer B.Cu) (net 24))\n (segment (start 115.417 98.212) (end 115.417 96.434) (width 0.9) (layer B.Cu) (net 24))\n (segment (start 115.417 93.259) (end 115.417 90.592) (width 0.9) (layer B.Cu) (net 24) (tstamp 579804A6))\n (via (at 115.417 93.259) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 24))\n (segment (start 115.417 96.434) (end 115.417 93.259) (width 0.3048) (layer F.Cu) (net 24) (tstamp 579804A3))\n (via (at 115.417 96.434) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 24))\n (segment (start 118.465 98.339) (end 115.544 98.339) (width 0.9) (layer B.Cu) (net 24))\n (segment (start 115.544 98.339) (end 115.417 98.212) (width 0.3048) (layer B.Cu) (net 24) (tstamp 578F69DE))\n (segment (start 72.11 50.968) (end 72.11 49.69) (width 1.2) (layer B.Cu) (net 25))\n (segment (start 78.6651 48.7) (end 81.0078 51.0427) (width 1.2) (layer B.Cu) (net 25) (tstamp 59570FF7))\n (segment (start 73.1 48.7) (end 78.6651 48.7) (width 1.2) (layer B.Cu) (net 25) (tstamp 59570FEF))\n (segment (start 72.11 49.69) (end 73.1 48.7) (width 1.2) (layer B.Cu) (net 25) (tstamp 59570FE6))\n (segment (start 74.65 50.968) (end 76.968 50.968) (width 1.2) (layer B.Cu) (net 26))\n (segment (start 78.8827 53.5827) (end 81.0078 53.5827) (width 1.2) (layer B.Cu) (net 26) (tstamp 5957100A))\n (segment (start 78 52.7) (end 78.8827 53.5827) (width 1.2) (layer B.Cu) (net 26) (tstamp 59571009))\n (segment (start 78 52) (end 78 52.7) (width 1.2) (layer B.Cu) (net 26) (tstamp 59571007))\n (segment (start 76.968 50.968) (end 78 52) (width 1.2) (layer B.Cu) (net 26) (tstamp 59571004))\n (segment (start 74.65 71.288) (end 76.488 71.288) (width 0.9) (layer B.Cu) (net 27))\n (segment (start 76.488 71.288) (end 76.6 71.4) (width 0.9) (layer B.Cu) (net 27) (tstamp 59572D38))\n (segment (start 81.4 76.6) (end 79.5 76.6) (width 0.45) (layer B.Cu) (net 27))\n (segment (start 76.6 71.4) (end 76.5 71.4) (width 0.45) (layer B.Cu) (net 27) (tstamp 5957157A))\n (segment (start 78.3 73.1) (end 76.6 71.4) (width 0.45) (layer B.Cu) (net 27) (tstamp 59571577))\n (segment (start 78.3 75.4) (end 78.3 73.1) (width 0.45) (layer B.Cu) (net 27) (tstamp 59571571))\n (segment (start 79.5 76.6) (end 78.3 75.4) (width 0.45) (layer B.Cu) (net 27) (tstamp 5957156D))\n (segment (start 83.921 76.079) (end 83.921 74.717) (width 0.6) (layer B.Cu) (net 27) (tstamp 59570BE3))\n (segment (start 83.4 76.6) (end 83.921 76.079) (width 0.6) (layer B.Cu) (net 27) (tstamp 59570BDE))\n (segment (start 81.4 76.6) (end 83.4 76.6) (width 0.45) (layer B.Cu) (net 27) (tstamp 5957156B))\n (segment (start 134.086 76.714) (end 134.086 74.717) (width 0.9) (layer B.Cu) (net 28))\n (segment (start 133.9668 74.6647) (end 134.2208 74.6647) (width 0.3048) (layer B.Cu) (net 28) (tstamp 577972AC))\n (segment (start 131 79.8) (end 125.1 79.8) (width 0.9) (layer B.Cu) (net 28) (tstamp 59570A95))\n (segment (start 134.086 76.714) (end 131 79.8) (width 0.9) (layer B.Cu) (net 28) (tstamp 59570A93))\n (segment (start 74.65 83.988) (end 77.012 83.988) (width 0.9) (layer B.Cu) (net 28))\n (segment (start 94.5 82.9) (end 93.4 81.8) (width 0.45) (layer B.Cu) (net 28) (tstamp 59571DE6))\n (segment (start 93.4 81.8) (end 79.2 81.8) (width 0.45) (layer B.Cu) (net 28) (tstamp 59571DE8))\n (segment (start 79.2 81.8) (end 77.2 83.8) (width 0.45) (layer B.Cu) (net 28) (tstamp 59571DEB))\n (segment (start 96.7 84.4) (end 95.2 82.9) (width 0.45) (layer B.Cu) (net 28) (tstamp 59570A9E))\n (segment (start 120.5 84.4) (end 96.7 84.4) (width 0.9) (layer B.Cu) (net 28) (tstamp 59570A9C))\n (segment (start 125.1 79.8) (end 120.5 84.4) (width 0.9) (layer B.Cu) (net 28) (tstamp 59570A99))\n (segment (start 95.2 82.9) (end 94.5 82.9) (width 0.45) (layer B.Cu) (net 28))\n (segment (start 77.012 83.988) (end 77.2 83.8) (width 0.9) (layer B.Cu) (net 28) (tstamp 59572D51))\n (segment (start 74.65 91.608) (end 77.408 91.608) (width 0.9) (layer B.Cu) (net 29))\n (segment (start 78.5 92.7) (end 77.25 91.45) (width 0.45) (layer B.Cu) (net 29) (tstamp 59571733))\n (segment (start 78.5 98.8) (end 78.5 92.7) (width 0.45) (layer B.Cu) (net 29) (tstamp 59571730))\n (segment (start 79.6 99.9) (end 78.5 98.8) (width 0.45) (layer B.Cu) (net 29) (tstamp 5957172F))\n (segment (start 81.9 99.9) (end 79.6 99.9) (width 0.45) (layer B.Cu) (net 29) (tstamp 59571729))\n (segment (start 81.9 99.9) (end 83.842 97.958) (width 0.6) (layer B.Cu) (net 29) (tstamp 59571721))\n (segment (start 77.408 91.608) (end 77.25 91.45) (width 0.9) (layer B.Cu) (net 29) (tstamp 59572D5A))\n (segment (start 83.921 97.958) (end 83.842 97.958) (width 0.45) (layer B.Cu) (net 29))\n (segment (start 69.8 92.1) (end 70.3 91.6) (width 0.9) (layer B.Cu) (net 30))\n (segment (start 133.959 100.341) (end 128.4 105.9) (width 0.6) (layer B.Cu) (net 30) (tstamp 59571885))\n (segment (start 128.4 105.9) (end 72.5 105.9) (width 0.6) (layer B.Cu) (net 30) (tstamp 59571887))\n (segment (start 72.5 105.9) (end 68.8 102.2) (width 0.6) (layer B.Cu) (net 30) (tstamp 595718AC))\n (segment (start 68.8 102.2) (end 68.8 93.1) (width 0.6) (layer B.Cu) (net 30) (tstamp 595718B9))\n (segment (start 68.8 93.1) (end 69.8 92.1) (width 0.6) (layer B.Cu) (net 30) (tstamp 595718C4))\n (segment (start 133.959 98.085) (end 133.959 100.341) (width 0.6) (layer B.Cu) (net 30))\n (segment (start 70.3 91.6) (end 72.102 91.6) (width 0.9) (layer B.Cu) (net 30) (tstamp 59572D77))\n (segment (start 72.102 91.6) (end 72.11 91.608) (width 0.9) (layer B.Cu) (net 30) (tstamp 59572D7A))\n (segment (start 72.11 61.128) (end 69.4 61.128) (width 0.9) (layer B.Cu) (net 31))\n (segment (start 68.6 54.2) (end 69.4 55) (width 0.9) (layer B.Cu) (net 31) (tstamp 595718F7))\n (segment (start 69.4 55) (end 69.4 61.3) (width 0.9) (layer B.Cu) (net 31) (tstamp 595718FC))\n (segment (start 113.811 52.111) (end 115.544 52.111) (width 1.5) (layer B.Cu) (net 31) (tstamp 59570D0C))\n (segment (start 111.6 49.9) (end 113.811 52.111) (width 1.5) (layer B.Cu) (net 31) (tstamp 59570D0A))\n (segment (start 111.6 48.167) (end 111.6 49.9) (width 1.5) (layer B.Cu) (net 31) (tstamp 59570CFD))\n (segment (start 107.733 44.3) (end 111.6 48.167) (width 1.5) (layer B.Cu) (net 31) (tstamp 59570CEB))\n (segment (start 71.4 44.3) (end 107.733 44.3) (width 1.5) (layer B.Cu) (net 31) (tstamp 59570CE9))\n (segment (start 68.6 47.1) (end 71.4 44.3) (width 0.9) (layer B.Cu) (net 31) (tstamp 59570CE0))\n (segment (start 68.6 47.1) (end 68.6 54.2) (width 0.9) (layer B.Cu) (net 31))\n (segment (start 69.4 61.128) (end 69.4 61.3) (width 0.9) (layer B.Cu) (net 31) (tstamp 59572D25))\n (segment (start 137.515 67.097) (end 140.3168 67.097) (width 1.5) (layer B.Cu) (net 32))\n (segment (start 140 67) (end 140.3168 67) (width 1.5) (layer B.Cu) (net 32) (tstamp 595A370F))\n (segment (start 140.2198 67) (end 140 67) (width 1.5) (layer B.Cu) (net 32) (tstamp 595A370E))\n (segment (start 140.3168 67.097) (end 140.2198 67) (width 1.5) (layer B.Cu) (net 32) (tstamp 595A370B))\n (segment (start 99.415 86.8) (end 105.2 86.8) (width 1.2) (layer B.Cu) (net 32))\n (segment (start 112.6 86.7) (end 123.2 86.7) (width 1.2) (layer B.Cu) (net 32) (tstamp 595730A7))\n (segment (start 112.2 86.3) (end 112.6 86.7) (width 1.2) (layer B.Cu) (net 32) (tstamp 595730A6))\n (segment (start 105.7 86.3) (end 112.2 86.3) (width 0.9) (layer B.Cu) (net 32) (tstamp 595730A5))\n (segment (start 105.2 86.8) (end 105.7 86.3) (width 0.9) (layer B.Cu) (net 32) (tstamp 595730A4))\n (segment (start 124.9 88.4) (end 123.2 86.7) (width 0.9) (layer B.Cu) (net 32) (tstamp 59570944))\n (segment (start 127.5 88.4) (end 124.9 88.4) (width 0.9) (layer B.Cu) (net 32) (tstamp 59570942))\n (segment (start 129.565 90.465) (end 127.5 88.4) (width 0.9) (layer B.Cu) (net 32) (tstamp 59570940))\n (segment (start 99.415 90.846) (end 99.415 86.8) (width 1.2) (layer B.Cu) (net 32))\n (segment (start 99.415 86.8) (end 99.415 86.7) (width 1.2) (layer B.Cu) (net 32) (tstamp 595730A2))\n (segment (start 129.641 90.465) (end 129.565 90.465) (width 0.9) (layer B.Cu) (net 32))\n (segment (start 92.4 88.4) (end 92.7 88.4) (width 1.2) (layer B.Cu) (net 32))\n (segment (start 90.2 88.4) (end 92.4 88.4) (width 0.9) (layer B.Cu) (net 32) (tstamp 595703A9))\n (segment (start 88.262 90.338) (end 90.2 88.4) (width 0.9) (layer B.Cu) (net 32) (tstamp 595703A3))\n (segment (start 92.7 88.4) (end 94.4 86.7) (width 1.2) (layer B.Cu) (net 32) (tstamp 59570925))\n (segment (start 99.5 87) (end 99.5 86.7) (width 1.2) (layer B.Cu) (net 32) (tstamp 59570922))\n (segment (start 99.5 86.785) (end 99.5 87) (width 1.2) (layer B.Cu) (net 32) (tstamp 59570921))\n (segment (start 99.415 86.7) (end 99.5 86.785) (width 1.2) (layer B.Cu) (net 32) (tstamp 5957091E))\n (segment (start 93.4 84.2) (end 93.4 85.7) (width 1.2) (layer B.Cu) (net 32))\n (segment (start 93.4 85.7) (end 94.4 86.7) (width 1.2) (layer B.Cu) (net 32) (tstamp 595708F3))\n (segment (start 125.7 82.7) (end 137.3 82.7) (width 1.2) (layer B.Cu) (net 32) (tstamp 59570911))\n (segment (start 123.2 86.7) (end 125.1 84.8) (width 1.2) (layer B.Cu) (net 32) (tstamp 59570907))\n (segment (start 125.1 84.8) (end 125.1 83.3) (width 1.2) (layer B.Cu) (net 32) (tstamp 5957090B))\n (segment (start 125.1 83.3) (end 125.7 82.7) (width 1.2) (layer B.Cu) (net 32) (tstamp 5957090C))\n (segment (start 94.4 86.7) (end 99.5 86.7) (width 1.2) (layer B.Cu) (net 32) (tstamp 595708FC))\n (segment (start 137.25 82.65) (end 137.3 82.7) (width 0.9) (layer B.Cu) (net 32) (tstamp 595706E0))\n (segment (start 137.3 82.7) (end 139.9 85.3) (width 1.5) (layer B.Cu) (net 32) (tstamp 59570915))\n (segment (start 137.515 90.465) (end 139.9 88.08) (width 1.5) (layer B.Cu) (net 32) (tstamp 595706F9))\n (segment (start 139.9 85.3) (end 139.9 88.08) (width 1.5) (layer B.Cu) (net 32) (tstamp 595706F4))\n (segment (start 137.7 82.4) (end 140.3168 79.7832) (width 1.5) (layer B.Cu) (net 32) (tstamp 59570701))\n (segment (start 140.3168 79.7832) (end 140.3168 67) (width 1.2) (layer B.Cu) (net 32) (tstamp 59570702))\n (segment (start 140.3168 67) (end 140.3168 64.5047) (width 1.2) (layer B.Cu) (net 32) (tstamp 595A3710))\n (segment (start 139.6183 57.7737) (end 134.0938 57.7737) (width 1.5) (layer B.Cu) (net 32) (tstamp 57798EE3))\n (segment (start 140.3168 58.4722) (end 139.9358 58.0912) (width 1.2) (layer B.Cu) (net 32) (tstamp 57798ED3))\n (segment (start 139.9358 58.0912) (end 139.6183 57.7737) (width 0.635) (layer B.Cu) (net 32) (tstamp 57798F33))\n (segment (start 140.3168 64.5047) (end 140.3168 58.4722) (width 1.2) (layer B.Cu) (net 32) (tstamp 57798EC9))\n (segment (start 88.239 90.338) (end 88.262 90.338) (width 0.6) (layer B.Cu) (net 32))\n (segment (start 80.365 90.338) (end 80.338 90.338) (width 0.6) (layer B.Cu) (net 32))\n (segment (start 80.338 90.338) (end 79 89) (width 0.6) (layer B.Cu) (net 32) (tstamp 59570376))\n (segment (start 79 89) (end 79 84.7) (width 0.6) (layer B.Cu) (net 32) (tstamp 59570379))\n (segment (start 79 84.7) (end 80.7 83) (width 0.6) (layer B.Cu) (net 32) (tstamp 5957037C))\n (segment (start 80.7 83) (end 92.2 83) (width 0.6) (layer B.Cu) (net 32) (tstamp 5957037E))\n (segment (start 92.2 83) (end 93.4 84.2) (width 0.6) (layer B.Cu) (net 32) (tstamp 59570381))\n (segment (start 93.4 84.2) (end 93.2 84) (width 0.9) (layer B.Cu) (net 32) (tstamp 595708F1))\n (segment (start 134.0938 57.7737) (end 125.4578 57.7737) (width 1.5) (layer B.Cu) (net 32) (tstamp 577991FF))\n (segment (start 125.5213 49.1377) (end 125.5213 49.150464) (width 1.5) (layer B.Cu) (net 32) (tstamp 5779937C))\n (segment (start 123.204164 49.150464) (end 125.5213 49.150464) (width 1.2) (layer B.Cu) (net 32))\n (segment (start 125.5213 49.150464) (end 125.534064 49.150464) (width 0.635) (layer B.Cu) (net 32) (tstamp 5779937D))\n (segment (start 125.534064 49.150464) (end 134.0938 57.7102) (width 1.5) (layer B.Cu) (net 32) (tstamp 577991F0))\n (segment (start 134.0938 57.7102) (end 134.0938 57.7737) (width 0.635) (layer B.Cu) (net 32) (tstamp 577991FE))\n (segment (start 99.4228 90.6667) (end 99.4228 90.1587) (width 0.3048) (layer B.Cu) (net 32) (tstamp 5779731D))\n (segment (start 125.4578 57.7737) (end 124.01 57.7737) (width 0.635) (layer B.Cu) (net 32))\n (segment (start 124.5 57.7737) (end 124.01 57.7737) (width 1.2) (layer B.Cu) (net 32) (tstamp 595701ED))\n (segment (start 99.415 67.224) (end 99.415 65.165) (width 1.5) (layer B.Cu) (net 32))\n (segment (start 98 63.75) (end 94.5 63.75) (width 1.5) (layer B.Cu) (net 32) (tstamp 595700F7))\n (segment (start 99.415 65.165) (end 98 63.75) (width 1.5) (layer B.Cu) (net 32) (tstamp 595700F3))\n (segment (start 88.239 67.224) (end 88.239 67.011) (width 0.6) (layer B.Cu) (net 32))\n (segment (start 88.239 67.011) (end 90.5 64.75) (width 0.6) (layer B.Cu) (net 32) (tstamp 595700D8))\n (segment (start 90.5 64.75) (end 93.5 64.75) (width 1.2) (layer B.Cu) (net 32) (tstamp 595700DB))\n (segment (start 93.5 64.75) (end 94.5 63.75) (width 1.2) (layer B.Cu) (net 32) (tstamp 595700E0))\n (segment (start 94.5 63.75) (end 94.5 60.75) (width 1.5) (layer B.Cu) (net 32) (tstamp 595700E4))\n (segment (start 94.5 60.75) (end 91.75 58) (width 1.5) (layer B.Cu) (net 32) (tstamp 595700E8))\n (segment (start 91.75 58) (end 83.25 58) (width 1.5) (layer B.Cu) (net 32) (tstamp 595700E9))\n (segment (start 83.25 58) (end 83.25 58.25) (width 0.9) (layer B.Cu) (net 32) (tstamp 595700ED))\n (segment (start 80.365 67.097) (end 80.347 67.097) (width 0.6) (layer B.Cu) (net 32))\n (segment (start 80.347 67.097) (end 77.2 63.95) (width 1.2) (layer B.Cu) (net 32) (tstamp 59570055))\n (segment (start 77.2 63.95) (end 77.2 62.55) (width 1.2) (layer B.Cu) (net 32) (tstamp 5957005A))\n (segment (start 77.2 62.55) (end 81.5 58.25) (width 1.5) (layer B.Cu) (net 32) (tstamp 5957005D))\n (segment (start 81.5 58.25) (end 83.25 58.25) (width 1.5) (layer B.Cu) (net 32) (tstamp 59570064))\n (segment (start 83.25 58.25) (end 83 58.25) (width 0.9) (layer B.Cu) (net 32) (tstamp 595700EE))\n (segment (start 83 58.25) (end 83.5478 57.7022) (width 0.9) (layer B.Cu) (net 32) (tstamp 59570068))\n (segment (start 83.5478 57.7022) (end 83.5478 53.5827) (width 1.5) (layer B.Cu) (net 32) (tstamp 5957006C))\n (segment (start 83.5478 51.0427) (end 83.5478 53.5827) (width 1.5) (layer B.Cu) (net 32))\n (segment (start 85 53.5827) (end 83.5478 53.5827) (width 1.5) (layer B.Cu) (net 32))\n (segment (start 113.974 57.25) (end 104.322 57.25) (width 1.5) (layer B.Cu) (net 32))\n (segment (start 104.322 57.25) (end 100.642 53.57) (width 1.5) (layer B.Cu) (net 32) (tstamp 577D59DA))\n (segment (start 100.642 53.57) (end 96.07 53.57) (width 1.5) (layer B.Cu) (net 32) (tstamp 577D59DB))\n (segment (start 96.07 53.57) (end 96.07 53.5827) (width 0.635) (layer B.Cu) (net 32) (tstamp 577D59DD))\n (segment (start 124.01 57.7737) (end 122.7263 57.7737) (width 1.5) (layer B.Cu) (net 32))\n (segment (start 117.224 60.5) (end 113.974 57.25) (width 1.5) (layer B.Cu) (net 32) (tstamp 577D56C0))\n (segment (start 120 60.5) (end 117.224 60.5) (width 1.5) (layer B.Cu) (net 32) (tstamp 577D56BF))\n (segment (start 122.7263 57.7737) (end 120 60.5) (width 1.5) (layer B.Cu) (net 32) (tstamp 577D56BE))\n (segment (start 124.01 57.7737) (end 123.8068 57.7737) (width 0.635) (layer B.Cu) (net 32) (tstamp 577D56BC))\n (segment (start 96.4383 53.5827) (end 96.07 53.5827) (width 0.635) (layer B.Cu) (net 32) (tstamp 57799B81))\n (segment (start 96.07 53.5827) (end 85 53.5827) (width 1.5) (layer B.Cu) (net 32) (tstamp 577D59DE))\n (segment (start 85 53.5827) (end 84.8178 53.5827) (width 0.635) (layer B.Cu) (net 32) (tstamp 5786CBA8))\n (segment (start 86.7228 53.5827) (end 84.8178 53.5827) (width 0.635) (layer B.Cu) (net 32) (tstamp 57798F0E))\n (segment (start 124.5 65) (end 124.5 57.7737) (width 1.5) (layer B.Cu) (net 32))\n (segment (start 119.25 65) (end 124.5 65) (width 1.5) (layer B.Cu) (net 32) (tstamp 595701BD))\n (segment (start 124.5 65) (end 125.25 65) (width 0.9) (layer B.Cu) (net 32) (tstamp 595701EB))\n (segment (start 118.465 65.785) (end 119.25 65) (width 1.5) (layer B.Cu) (net 32) (tstamp 595701BA))\n (segment (start 127.544 65) (end 129.641 67.097) (width 0.9) (layer B.Cu) (net 32) (tstamp 595701B7))\n (segment (start 125.25 65) (end 127.544 65) (width 0.9) (layer B.Cu) (net 32) (tstamp 595701B4))\n (segment (start 118.465 67.351) (end 118.465 65.785) (width 1.5) (layer B.Cu) (net 32))\n (segment (start 118.465 87.465) (end 118.4 87.4) (width 1.2) (layer B.Cu) (net 32) (tstamp 59570929))\n (segment (start 118.465 90.719) (end 118.465 87.465) (width 1.2) (layer B.Cu) (net 32))\n\n)\n" }, { "path": "src/test/resources/samples/langs/KiCad Legacy Layout/tc14badge.brd", "content": "PCBNEW-BOARD Version 1 date Fri Oct 19 11:53:05 2012\n\n# Created by Pcbnew(2012-05-21 BZR 3261)-stable\n\n$GENERAL\nencoding utf-8\nLayerCount 2\nLy 1FFF8001\nEnabledLayers 1FFF8001\nLinks 135\nNoConn 11\nDi 41844 16849 73060 58324\nNdraw 54\nNtrack 512\nNzone 0\nBoardThickness 630\nNmodule 51\nNnets 44\n$EndGENERAL\n\n$SHEETDESCR\nSheet A4 11700 8267\nTitle \"\"\nDate \"19 oct 2012\"\nRev \"\"\nComp \"\"\nComment1 \"\"\nComment2 \"\"\nComment3 \"\"\nComment4 \"\"\n$EndSHEETDESCR\n\n$SETUP\nInternalUnit 0.000100 INCH\nLayers 2\nLayer[0] Back signal\nLayer[15] Front signal\nTrackWidth 80\nTrackWidthList 200\nTrackWidthList 500\nTrackWidthList 1000\nTrackClearence 80\nZoneClearence 200\nTrackMinWidth 80\nDrawSegmWidth 80\nEdgeSegmWidth 150\nViaSize 270\nViaDrill 130\nViaMinSize 270\nViaMinDrill 130\nViaSizeList 310 160\nViaSizeList 370 200\nViaSizeList 420 250\nMicroViaSize 200\nMicroViaDrill 50\nMicroViasAllowed 0\nMicroViaMinSize 200\nMicroViaMinDrill 50\nTextPcbWidth 75\nTextPcbSize 300 400\nEdgeModWidth 80\nTextModSize 600 600\nTextModWidth 120\nPadSize 551 551\nPadDrill 150\nPad2MaskClearance 80\nPad2PasteClearanceRatio -0.12\nAuxiliaryAxisOrg 0 0\nPcbPlotParams (pcbplotparams (layerselection 284721153) (usegerberextensions true) (excludeedgelayer false) (linewidth 60) (plotframeref false) (viasonmask false) (mode 1) (useauxorigin false) (hpglpennumber 1) (hpglpenspeed 20) (hpglpendiameter 15) (hpglpenoverlay 0) (pscolor true) (psnegative false) (psa4output false) (plotreference false) (plotvalue false) (plotothertext true) (plotinvisibletext false) (padsonsilk false) (subtractmaskfromsilk false) (outputformat 1) (mirror false) (drillshape 1) (scaleselection 1) (outputdirectory \"\"))\n$EndSETUP\n\n$EQUIPOT\nNa 0 \"\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 1 \"/DC\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 2 \"/DD\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 3 \"/P0_0\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 4 \"/P0_1\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 5 \"/P0_2\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 6 \"/P0_3\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 7 \"/P0_4\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 8 \"/P0_5\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 9 \"/P1_2\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 10 \"/P1_3\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 11 \"/P1_4\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 12 \"/P1_5\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 13 \"/P1_6\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 14 \"/P1_7\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 15 \"/P2_0\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 16 \"/P2_3\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 17 \"/P2_4\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 18 \"/RESET_N\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 19 \"/VBUS\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 20 \"3V3\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 21 \"GND\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 22 \"N-000023\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 23 \"N-000024\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 24 \"N-000026\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 25 \"N-000027\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 26 \"N-000028\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 27 \"N-000029\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 28 \"N-000030\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 29 \"N-000031\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 30 \"N-000032\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 31 \"N-000033\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 32 \"N-000034\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 33 \"N-000035\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 34 \"N-000037\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 35 \"N-000039\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 36 \"N-000041\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 37 \"N-000042\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 38 \"N-000043\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 39 \"N-000044\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 40 \"N-000045\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 41 \"N-000046\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 42 \"N-000047\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 43 \"N-000051\"\nSt ~\n$EndEQUIPOT\n$NCLASS\nName \"Default\"\nDesc \"This is the default net class.\"\nClearance 80\nTrackWidth 80\nViaDia 270\nViaDrill 130\nuViaDia 200\nuViaDrill 50\nAddNet \"\"\nAddNet \"/DC\"\nAddNet \"/DD\"\nAddNet \"/P0_0\"\nAddNet \"/P0_1\"\nAddNet \"/P0_2\"\nAddNet \"/P0_3\"\nAddNet \"/P0_4\"\nAddNet \"/P0_5\"\nAddNet \"/P1_2\"\nAddNet \"/P1_3\"\nAddNet \"/P1_4\"\nAddNet \"/P1_5\"\nAddNet \"/P1_6\"\nAddNet \"/P1_7\"\nAddNet \"/P2_0\"\nAddNet \"/P2_3\"\nAddNet \"/P2_4\"\nAddNet \"/RESET_N\"\nAddNet \"/VBUS\"\nAddNet \"3V3\"\nAddNet \"GND\"\nAddNet \"N-000023\"\nAddNet \"N-000024\"\nAddNet \"N-000026\"\nAddNet \"N-000027\"\nAddNet \"N-000028\"\nAddNet \"N-000029\"\nAddNet \"N-000030\"\nAddNet \"N-000031\"\nAddNet \"N-000032\"\nAddNet \"N-000033\"\nAddNet \"N-000034\"\nAddNet \"N-000035\"\nAddNet \"N-000037\"\nAddNet \"N-000039\"\nAddNet \"N-000041\"\nAddNet \"N-000042\"\nAddNet \"N-000043\"\nAddNet \"N-000044\"\nAddNet \"N-000045\"\nAddNet \"N-000046\"\nAddNet \"N-000047\"\nAddNet \"N-000051\"\n$EndNCLASS\n$MODULE GSG-XTAL-TXC-7A\nPo 61500 45500 1800 15 504D2D98 504D3AA5 ~P\nLi GSG-XTAL-TXC-7A\nSc 504D3AA5\nAR /504D0F4F\nOp 0 0 0\nT0 0 0 600 600 1800 120 N V 21 N \"X1\"\nT1 0 0 600 600 1800 120 N I 21 N \"CRYSTAL\"\nDS 984 -630 984 -551 150 21\nDS -984 -630 -984 -551 150 21\nDS -1024 630 -1024 551 150 21\nDS 984 630 984 551 150 21\nDS -1024 630 984 630 150 21\nDS -984 -630 984 -630 150 21\n$PAD\nSh \"1\" R 669 945 0 0 1800\nDr 0 0 0\nAt SMD N 00888000\nNe 41 \"N-000046\"\nPo 728 0\n$EndPAD\n$PAD\nSh \"2\" R 669 945 0 0 1800\nDr 0 0 0\nAt SMD N 00888000\nNe 39 \"N-000044\"\nPo -728 0\n$EndPAD\n$EndMODULE GSG-XTAL-TXC-7A\n$MODULE GSG-USB-MICROB-FCI-10103594\nPo 46000 40000 0 15 4E482E27 504D3AA6 ~P\nLi GSG-USB-MICROB-FCI-10103594\nSc 504D3AA6\nAR /504CAE21\nOp 0 0 0\nT0 984 0 600 600 0 120 N V 21 N \"J2\"\nT1 984 0 600 600 0 120 N I 21 N \"GSG-USB-MICRO-B\"\n$PAD\nSh \"1\" R 689 157 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 19 \"/VBUS\"\nPo 1781 -512\nLe 45683504\n.SolderMask 40\n.LocalClearance 80\n$EndPAD\n$PAD\nSh \"2\" R 689 157 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 36 \"N-000041\"\nPo 1781 -256\nLe 113\n.SolderMask 40\n.LocalClearance 80\n$EndPAD\n$PAD\nSh \"3\" R 689 157 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 38 \"N-000043\"\nPo 1781 0\nLe 30424768\n.SolderMask 40\n.LocalClearance 80\n$EndPAD\n$PAD\nSh \"4\" R 689 157 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 0 \"\"\nPo 1781 256\nLe 32\n.SolderMask 40\n.LocalClearance 80\n$EndPAD\n$PAD\nSh \"5\" R 689 157 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo 1781 512\nLe 16\n.SolderMask 40\n.LocalClearance 80\n$EndPAD\n$PAD\nSh \"\" R 814 561 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 0 \"\"\nPo 656 -379\nLe 45683504\n$EndPAD\n$PAD\nSh \"\" R 814 561 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 0 \"\"\nPo 656 379\nLe 305\n$EndPAD\n$PAD\nSh \"\" R 571 843 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 0 \"\"\nPo 1840 -1114\nLe 45683504\n$EndPAD\n$PAD\nSh \"\" R 571 843 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 0 \"\"\nPo 1840 1114\nLe 45447072\n$EndPAD\n$PAD\nSh \"\" R 250 719 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 0 \"\"\nPo 1327 -1176\nLe 1341\n$EndPAD\n$PAD\nSh \"\" R 250 719 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 0 \"\"\nPo 1327 1176\nLe 45683504\n$EndPAD\n$PAD\nSh \"\" R 1116 630 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 0 \"\"\nPo 894 -1083\nLe 40068352\n$EndPAD\n$PAD\nSh \"\" R 1116 630 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 0 \"\"\nPo 894 1083\nLe 43410648\n$EndPAD\n$PAD\nSh \"\" C 630 630 0 0 0\nDr 472 0 0\nAt STD N 00C8FFFF\nNe 0 \"\"\nPo 669 -1083\nLe 45683504\n$EndPAD\n$PAD\nSh \"\" C 630 630 0 0 0\nDr 472 0 0\nAt STD N 00C8FFFF\nNe 0 \"\"\nPo 669 1083\nLe 43410648\n$EndPAD\n$PAD\nSh \"\" C 571 571 0 0 0\nDr 413 0 0\nAt STD N 00C8FFFF\nNe 0 \"\"\nPo 1839 -979\nLe 46673664\n$EndPAD\n$PAD\nSh \"\" C 571 571 0 0 0\nDr 413 0 0\nAt STD N 00C8FFFF\nNe 0 \"\"\nPo 1839 979\nLe 113\n$EndPAD\n$EndMODULE GSG-USB-MICROB-FCI-10103594\n$MODULE GSG-TESTPOINT-100MIL\nPo 55154 31500 0 15 4FA2EFE0 504E11D5 ~P\nLi GSG-TESTPOINT-100MIL\nKw CONN\nSc 504E11D5\nAR /504D0B60\nOp 0 0 0\nT0 0 0 400 400 0 80 N V 21 N \"P4\"\nT1 0 0 400 400 0 80 N I 21 N \"DD\"\n$PAD\nSh \"1\" C 1000 1000 0 0 0\nDr 0 0 0\nAt SMD N 00808000\nNe 2 \"/DD\"\nPo 0 0\nLe 33\n$EndPAD\n$EndMODULE GSG-TESTPOINT-100MIL\n$MODULE GSG-TESTPOINT-100MIL\nPo 65193 31500 0 15 4FA2EFE0 504E11D2 ~P\nLi GSG-TESTPOINT-100MIL\nKw CONN\nSc 504E11D2\nAR /504D0B65\nOp 0 0 0\nT0 0 0 400 400 0 80 N V 21 N \"P7\"\nT1 0 0 400 400 0 80 N I 21 N \"GND\"\n$PAD\nSh \"1\" C 1000 1000 0 0 0\nDr 0 0 0\nAt SMD N 00808000\nNe 21 \"GND\"\nPo 0 0\nLe 33\n$EndPAD\n$EndMODULE GSG-TESTPOINT-100MIL\n$MODULE GSG-TESTPOINT-100MIL\nPo 61846 31500 0 15 4FA2EFE0 504E11CF ~P\nLi GSG-TESTPOINT-100MIL\nKw CONN\nSc 504E11CF\nAR /504D0B63\nOp 0 0 0\nT0 0 0 400 400 0 80 N V 21 N \"P6\"\nT1 0 0 400 400 0 80 N I 21 N \"3V3\"\n$PAD\nSh \"1\" C 1000 1000 0 0 0\nDr 0 0 0\nAt SMD N 00808000\nNe 22 \"N-000023\"\nPo 0 0\nLe 33\n$EndPAD\n$EndMODULE GSG-TESTPOINT-100MIL\n$MODULE GSG-TESTPOINT-100MIL\nPo 58500 31500 0 15 4FA2EFE0 504D3AAD ~P\nLi GSG-TESTPOINT-100MIL\nKw CONN\nSc 504D3AAD\nAR /504D0B62\nOp 0 0 0\nT0 0 0 400 400 0 80 N V 21 N \"P5\"\nT1 0 0 400 400 0 80 N I 21 N \"DC\"\n$PAD\nSh \"1\" C 1000 1000 0 0 0\nDr 0 0 0\nAt SMD N 00808000\nNe 1 \"/DC\"\nPo 0 0\nLe 33\n$EndPAD\n$EndMODULE GSG-TESTPOINT-100MIL\n$MODULE GSG-TESTPOINT-100MIL\nPo 51807 31500 0 15 4FA2EFE0 504E11D8 ~P\nLi GSG-TESTPOINT-100MIL\nKw CONN\nSc 504E11D8\nAR /504D0B57\nOp 0 0 0\nT0 0 0 400 400 0 80 N V 21 N \"P3\"\nT1 0 0 400 400 0 80 N I 21 N \"RESET_N\"\n$PAD\nSh \"1\" C 1000 1000 0 0 0\nDr 0 0 0\nAt SMD N 00808000\nNe 18 \"/RESET_N\"\nPo 0 0\nLe 33\n$EndPAD\n$EndMODULE GSG-TESTPOINT-100MIL\n$MODULE GSG-SPST-FSM4JSMATR\nPo 67500 36500 2700 15 4E488E6F 504D3AB0 ~P\nLi GSG-SPST-FSM4JSMATR\nSc 504D3AB0\nAR /504CFDB1\nOp 0 0 0\nT0 0 0 394 394 2700 80 N V 21 N \"SW1\"\nT1 0 0 394 394 2700 80 N I 21 N \"SW_PUSH\"\nDC 0 0 689 0 80 21\nDS -1181 -1181 1181 -1181 80 21\nDS 1181 -1181 1181 1181 80 21\nDS 1181 1181 -1181 1181 80 21\nDS -1181 1181 -1181 -1181 80 21\n$PAD\nSh \"1\" R 551 827 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 9 \"/P1_2\"\nPo 886 -1791\n$EndPAD\n$PAD\nSh \"1\" R 551 827 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 9 \"/P1_2\"\nPo 886 1791\n$EndPAD\n$PAD\nSh \"2\" R 551 827 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo -886 -1791\nLe 83\n$EndPAD\n$PAD\nSh \"2\" R 551 827 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo -886 1791\nLe -1429971160\n$EndPAD\n$EndMODULE GSG-SPST-FSM4JSMATR\n$MODULE GSG-SOT23-3\nPo 54000 38000 900 15 50516083 504D3AB1 ~P\nLi GSG-SOT23-3\nKw CMS SOT\nSc 504D3AB1\nAR /504CAD4C\nOp 0 0 0\nAt SMD \nT0 0 -410 300 300 900 75 N V 21 N \"U2\"\nT1 0 0 300 300 900 75 N I 21 N \"AP7313\"\nDS -600 -150 600 -150 50 21\nDS 600 -150 600 150 50 21\nDS 600 150 -600 150 50 21\nDS -600 150 -600 -150 50 21\n$PAD\nSh \"2\" R 360 360 0 0 900\nDr 0 0 0\nAt SMD N 00888000\nNe 20 \"3V3\"\nPo -350 -400\nLe 3\n$EndPAD\n$PAD\nSh \"1\" R 360 360 0 0 900\nDr 0 0 0\nAt SMD N 00888000\nNe 19 \"/VBUS\"\nPo 350 -400\n$EndPAD\n$PAD\nSh \"3\" R 360 360 0 0 900\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo 0 400\nLe 111\n$EndPAD\n$SHAPE3D\nNa \"smd/cms_sot23.wrl\"\nSc 0.130000 0.150000 0.150000\nOf 0.000000 0.000000 0.000000\nRo 0.000000 0.000000 0.000000\n$EndSHAPE3D\n$EndMODULE GSG-SOT23-3\n$MODULE GSG-SMA-VERTICAL\nPo 67250 46200 0 15 5047A6AD 504D3AB2 ~P\nLi GSG-SMA-VERTICAL\nSc 504D3AB2\nAR /504CFCB0\nOp 0 0 0\nT0 0 0 600 600 0 120 N V 21 N \"P2\"\nT1 0 0 600 600 0 120 N I 21 N \"ANTENNA\"\nDS -1600 -1600 -1600 1600 150 21\nDS -1600 1600 1600 1600 150 21\nDS 1600 1600 1600 -1600 150 21\nDS 1600 -1600 -1600 -1600 150 21\n$PAD\nSh \"1\" C 1000 1000 0 0 0\nDr 600 0 0\nAt STD N 00E0FFFF\nNe 23 \"N-000024\"\nPo 0 0\n$EndPAD\n$PAD\nSh \"2\" C 1000 1000 0 0 0\nDr 670 0 0\nAt STD N 00E0FFFF\nNe 21 \"GND\"\nPo -1000 -1000\n$EndPAD\n$PAD\nSh \"3\" C 1000 1000 0 0 0\nDr 670 0 0\nAt STD N 00E0FFFF\nNe 21 \"GND\"\nPo -1000 1000\n$EndPAD\n$PAD\nSh \"4\" C 1000 1000 0 0 0\nDr 670 0 0\nAt STD N 00E0FFFF\nNe 21 \"GND\"\nPo 1000 1000\n$EndPAD\n$PAD\nSh \"5\" C 1000 1000 0 0 0\nDr 670 0 0\nAt STD N 00E0FFFF\nNe 21 \"GND\"\nPo 1000 -1000\n$EndPAD\n$EndMODULE GSG-SMA-VERTICAL\n$MODULE GSG-HEADER-2x8\nPo 59500 34500 1800 15 4F8A6071 504D3AB4 ~P\nLi GSG-HEADER-2x8\nKw CONN\nSc 504D3AB4\nAR /504CF706\nOp 0 0 0\nT0 0 0 400 400 1800 80 N V 21 N \"P1\"\nT1 0 0 400 400 1800 80 N I 21 N \"EXPANSION\"\nDS -4000 -1000 4000 -1000 150 21\nDS 4000 -1000 4000 1000 150 21\nDS 4000 1000 -4000 1000 150 21\nDS -3000 0 -4250 0 150 21\nDS -4250 0 -4250 1250 150 21\nDS -4250 1250 -3000 1250 150 21\nDS -3000 1250 -3000 0 150 21\nDS -4000 1000 -4000 -1000 150 21\n$PAD\nSh \"1\" R 600 600 0 0 1800\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 21 \"GND\"\nPo -3500 500\nLe 33\n$EndPAD\n$PAD\nSh \"2\" C 600 600 0 0 1800\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 3 \"/P0_0\"\nPo -3500 -500\nLe 34735648\n$EndPAD\n$PAD\nSh \"3\" C 600 600 0 0 1800\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 4 \"/P0_1\"\nPo -2500 500\nLe 24\n$EndPAD\n$PAD\nSh \"4\" C 600 600 0 0 1800\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 5 \"/P0_2\"\nPo -2500 -500\nLe -1563238664\n$EndPAD\n$PAD\nSh \"5\" C 600 600 0 0 1800\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 6 \"/P0_3\"\nPo -1500 500\nLe 48\n$EndPAD\n$PAD\nSh \"6\" C 600 600 0 0 1800\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 7 \"/P0_4\"\nPo -1500 -500\nLe 48\n$EndPAD\n$PAD\nSh \"7\" C 600 600 0 0 1800\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 8 \"/P0_5\"\nPo -500 500\nLe 48\n$EndPAD\n$PAD\nSh \"8\" C 600 600 0 0 1800\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 9 \"/P1_2\"\nPo -500 -500\nLe 33\n$EndPAD\n$PAD\nSh \"9\" C 600 600 0 0 1800\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 10 \"/P1_3\"\nPo 500 500\nLe 30841616\n$EndPAD\n$PAD\nSh \"10\" C 600 600 0 0 1800\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 11 \"/P1_4\"\nPo 500 -500\nLe 97\n$EndPAD\n$PAD\nSh \"11\" C 600 600 0 0 1800\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 12 \"/P1_5\"\nPo 1500 500\nLe 34831136\n$EndPAD\n$PAD\nSh \"12\" C 600 600 0 0 1800\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 13 \"/P1_6\"\nPo 1500 -500\nLe 35604240\n$EndPAD\n$PAD\nSh \"13\" C 600 600 0 0 1800\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 14 \"/P1_7\"\nPo 2500 500\nLe 42\n$EndPAD\n$PAD\nSh \"14\" C 600 600 0 0 1800\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 15 \"/P2_0\"\nPo 2500 -500\nLe 17\n$EndPAD\n$PAD\nSh \"15\" C 600 600 0 0 1800\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 16 \"/P2_3\"\nPo 3500 500\nLe 9\n$EndPAD\n$PAD\nSh \"16\" C 600 600 0 0 1800\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 17 \"/P2_4\"\nPo 3500 -500\nLe 99\n$EndPAD\n$EndMODULE GSG-HEADER-2x8\n$MODULE GSG-HEADER-2x7\nPo 52000 43500 0 15 4F8A6053 504D3AB5 ~P\nLi GSG-HEADER-2x7\nKw CONN\nSc 504D3AB5\nAR /504CF491\nOp 0 0 0\nT0 0 0 400 400 0 80 N V 21 N \"P8\"\nT1 0 0 400 400 0 80 N I 21 N \"GOODFET\"\nDS -2500 0 -3750 0 150 21\nDS -3750 0 -3750 1250 150 21\nDS -3750 1250 -2500 1250 150 21\nDS -2500 1250 -2500 0 150 21\nDS -3500 1000 3500 1000 150 21\nDS 3500 1000 3500 -1000 150 21\nDS 3500 -1000 -3500 -1000 150 21\nDS -3500 1000 -3500 -1000 150 21\n$PAD\nSh \"1\" R 600 600 0 0 0\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 2 \"/DD\"\nPo -3000 500\nLe 33\n$EndPAD\n$PAD\nSh \"2\" C 600 600 0 0 0\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 35 \"N-000039\"\nPo -3000 -500\nLe 34735648\n$EndPAD\n$PAD\nSh \"3\" C 600 600 0 0 0\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 0 \"\"\nPo -2000 500\nLe 24\n$EndPAD\n$PAD\nSh \"4\" C 600 600 0 0 0\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 0 \"\"\nPo -2000 -500\nLe -1563238664\n$EndPAD\n$PAD\nSh \"5\" C 600 600 0 0 0\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 18 \"/RESET_N\"\nPo -1000 500\nLe 48\n$EndPAD\n$PAD\nSh \"6\" C 600 600 0 0 0\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 0 \"\"\nPo -1000 -500\nLe 48\n$EndPAD\n$PAD\nSh \"7\" C 600 600 0 0 0\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 1 \"/DC\"\nPo 0 500\nLe 48\n$EndPAD\n$PAD\nSh \"8\" C 600 600 0 0 0\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 0 \"\"\nPo 0 -500\nLe 33\n$EndPAD\n$PAD\nSh \"9\" C 600 600 0 0 0\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 21 \"GND\"\nPo 1000 500\nLe 30841616\n$EndPAD\n$PAD\nSh \"10\" C 600 600 0 0 0\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 0 \"\"\nPo 1000 -500\nLe 97\n$EndPAD\n$PAD\nSh \"11\" C 600 600 0 0 0\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 0 \"\"\nPo 2000 500\nLe 34831136\n$EndPAD\n$PAD\nSh \"12\" C 600 600 0 0 0\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 0 \"\"\nPo 2000 -500\nLe 35604240\n$EndPAD\n$PAD\nSh \"13\" C 600 600 0 0 0\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 0 \"\"\nPo 3000 500\nLe 42\n$EndPAD\n$PAD\nSh \"14\" C 600 600 0 0 0\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 0 \"\"\nPo 3000 -500\nLe 17\n$EndPAD\n$EndMODULE GSG-HEADER-2x7\n$MODULE GSG-HEADER-2x3\nPo 50000 34500 0 15 4F8A5FD1 504D3AB6 ~P\nLi GSG-HEADER-2x3\nKw CONN\nSc 504D3AB6\nAR /504D258A\nOp 0 0 0\nT0 0 0 400 400 0 80 N V 21 N \"P9\"\nT1 0 0 400 400 0 80 N I 21 N \"PWR\"\nDS -500 0 -1750 0 150 21\nDS -1750 0 -1750 1250 150 21\nDS -1750 1250 -500 1250 150 21\nDS -500 1250 -500 0 150 21\nDS -1500 -1000 1500 -1000 150 21\nDS 1500 -1000 1500 1000 150 21\nDS 1500 1000 -1500 1000 150 21\nDS -1500 1000 -1500 -1000 150 21\n$PAD\nSh \"1\" R 600 600 0 0 0\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 21 \"GND\"\nPo -1000 500\nLe 33\n$EndPAD\n$PAD\nSh \"2\" C 600 600 0 0 0\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 20 \"3V3\"\nPo -1000 -500\nLe 34735648\n$EndPAD\n$PAD\nSh \"3\" C 600 600 0 0 0\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 21 \"GND\"\nPo 0 500\nLe 24\n$EndPAD\n$PAD\nSh \"4\" C 600 600 0 0 0\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 20 \"3V3\"\nPo 0 -500\nLe -1563238664\n$EndPAD\n$PAD\nSh \"5\" C 600 600 0 0 0\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 21 \"GND\"\nPo 1000 500\nLe 48\n$EndPAD\n$PAD\nSh \"6\" C 600 600 0 0 0\nDr 400 0 0\nAt STD N 00E0FFFF\nNe 20 \"3V3\"\nPo 1000 -500\nLe 48\n$EndPAD\n$EndMODULE GSG-HEADER-2x3\n$MODULE GSG-B0310J50100AHF\nPo 63800 46000 2700 15 50516047 504D6841 ~P\nLi GSG-B0310J50100AHF\nSc 504D6841\nAR /504C9FEC\nOp 0 0 0\nT0 0 0 250 250 2700 63 N V 21 N \"T1\"\nT1 0 0 250 250 2700 63 N I 21 N \"BALUN\"\nDS -413 256 413 256 80 21\nDS 413 -256 -413 -256 80 21\nDC 256 0 276 20 80 21\nDS -413 -256 -413 256 80 21\nDS 413 -256 413 256 80 21\n$PAD\nSh \"1\" R 161 130 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 30 \"N-000032\"\nPo 260 -195\nLe 33054512\n$EndPAD\n$PAD\nSh \"2\" R 161 130 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 28 \"N-000030\"\nPo 0 -195\nLe 755437432\n$EndPAD\n$PAD\nSh \"3\" R 161 130 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 27 \"N-000029\"\nPo -260 -195\nLe 32750520\n$EndPAD\n$PAD\nSh \"4\" R 161 130 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 26 \"N-000028\"\nPo -260 195\nLe 6\n$EndPAD\n$PAD\nSh \"5\" R 161 130 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 0 \"\"\nPo 0 195\n$EndPAD\n$PAD\nSh \"6\" R 161 130 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 0 \"\"\nPo 260 195\nLe 32\n$EndPAD\n$EndMODULE GSG-B0310J50100AHF\n$MODULE GSG-900MHZ-INVERTED-F\nPo 64000 48000 1800 15 50516053 504D3AB8 ~P\nLi GSG-900MHZ-INVERTED-F\nSc 504D3AB8\nAR /504C9FF3\nOp 0 0 0\nT0 7087 -2165 600 600 1800 120 N I 21 N \"J1\"\nT1 7087 -984 600 600 1800 120 N I 21 N \"GSG-900MHZ-F-ANTENNA\"\n$PAD\nSh \"1\" R 787 7874 0 0 1800\nDr 0 0 0\nAt SMD N 00008000\nNe 29 \"N-000031\"\nPo 0 -3937\n$EndPAD\n$PAD\nSh \"2\" R 394 7874 0 0 1800\nDr 0 0 0\nAt SMD N 00008000\nNe 21 \"GND\"\nPo -2559 -3937\nLe 72\n$EndPAD\n$PAD\nSh \"\" R 5118 394 0 0 1800\nDr 0 0 0\nAt SMD N 00008000\nNe 0 \"\"\nPo 0 -7677\nLe 32929184\n$EndPAD\n$PAD\nSh \"\" R 394 4724 0 0 1800\nDr 0 0 0\nAt SMD N 00008000\nNe 0 \"\"\nPo 2362 -5512\nLe 33355568\n$EndPAD\n$PAD\nSh \"\" R 2362 394 0 0 1800\nDr 0 0 0\nAt SMD N 00008000\nNe 0 \"\"\nPo 3346 -3346\nLe 31206400\n$EndPAD\n$PAD\nSh \"\" R 2362 394 0 0 1800\nDr 0 0 0\nAt SMD N 00008000\nNe 0 \"\"\nPo 5315 -7677\n$EndPAD\n$PAD\nSh \"\" R 2362 394 0 0 1800\nDr 0 0 0\nAt SMD N 00008000\nNe 0 \"\"\nPo 7283 -3346\n$EndPAD\n$PAD\nSh \"\" R 2362 394 0 0 1800\nDr 0 0 0\nAt SMD N 00008000\nNe 0 \"\"\nPo 9252 -7677\nLe -1642768744\n$EndPAD\n$PAD\nSh \"\" R 2362 394 0 0 1800\nDr 0 0 0\nAt SMD N 00008000\nNe 0 \"\"\nPo 11220 -3346\n$EndPAD\n$PAD\nSh \"\" R 2362 394 0 0 1800\nDr 0 0 0\nAt SMD N 00008000\nNe 0 \"\"\nPo 13189 -7677\n$EndPAD\n$PAD\nSh \"\" R 394 4724 0 0 1800\nDr 0 0 0\nAt SMD N 00008000\nNe 0 \"\"\nPo 4331 -5512\nLe 33355568\n$EndPAD\n$PAD\nSh \"\" R 394 4724 0 0 1800\nDr 0 0 0\nAt SMD N 00008000\nNe 0 \"\"\nPo 6299 -5512\nLe 33355568\n$EndPAD\n$PAD\nSh \"\" R 394 4724 0 0 1800\nDr 0 0 0\nAt SMD N 00008000\nNe 0 \"\"\nPo 8268 -5512\nLe 33355568\n$EndPAD\n$PAD\nSh \"\" R 394 4724 0 0 1800\nDr 0 0 0\nAt SMD N 00008000\nNe 0 \"\"\nPo 10236 -5512\n$EndPAD\n$PAD\nSh \"\" R 394 4724 0 0 1800\nDr 0 0 0\nAt SMD N 00008000\nNe 0 \"\"\nPo 12205 -5512\nLe 32929184\n$EndPAD\n$EndMODULE GSG-900MHZ-INVERTED-F\n$MODULE GSG-0603D\nPo 65000 39000 2700 15 50516070 504D3AB9 ~P\nLi GSG-0603D\nSc 504D3AB9\nAR /504CF0C2\nOp 0 0 0\n.SolderMask 40\nT0 830 0 240 240 2700 60 N V 21 N \"D2\"\nT1 0 0 240 240 2700 60 N I 21 N \"LED1\"\nDS -20 30 -20 -30 80 21\nDS 80 0 -80 -130 80 21\nDS -80 -130 -80 130 80 21\nDS -80 130 80 0 80 21\nDS 540 -240 -540 -240 80 21\nDS -540 -240 -540 240 80 21\nDS -540 240 540 240 80 21\nDS 540 240 540 -240 80 21\n$PAD\nSh \"2\" R 340 340 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo 300 0\nLe 18\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"1\" R 340 340 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 34 \"N-000037\"\nPo -300 0\nLe 33\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$EndMODULE GSG-0603D\n$MODULE GSG-0603D\nPo 56500 45000 1800 15 50516069 504D3ABB ~P\nLi GSG-0603D\nSc 504D3ABB\nAR /504CFE38\nOp 0 0 0\n.SolderMask 40\nT0 830 0 240 240 1800 60 N V 21 N \"D3\"\nT1 0 0 240 240 1800 60 N I 21 N \"LED2\"\nDS -20 30 -20 -30 80 21\nDS 80 0 -80 -130 80 21\nDS -80 -130 -80 130 80 21\nDS -80 130 80 0 80 21\nDS 540 -240 -540 -240 80 21\nDS -540 -240 -540 240 80 21\nDS -540 240 540 240 80 21\nDS 540 240 540 -240 80 21\n$PAD\nSh \"2\" R 340 340 0 0 1800\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo 300 0\nLe 18\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"1\" R 340 340 0 0 1800\nDr 0 0 0\nAt SMD N 00888000\nNe 24 \"N-000026\"\nPo -300 0\nLe 33\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$EndMODULE GSG-0603D\n$MODULE GSG-0603D\nPo 56500 46000 1800 15 50516063 504D3ABD ~P\nLi GSG-0603D\nSc 504D3ABD\nAR /504CFE70\nOp 0 0 0\n.SolderMask 40\nT0 850 10 240 240 1800 60 N V 21 N \"D4\"\nT1 0 0 240 240 1800 60 N I 21 N \"LED3\"\nDS -20 30 -20 -30 80 21\nDS 80 0 -80 -130 80 21\nDS -80 -130 -80 130 80 21\nDS -80 130 80 0 80 21\nDS 540 -240 -540 -240 80 21\nDS -540 -240 -540 240 80 21\nDS -540 240 540 240 80 21\nDS 540 240 540 -240 80 21\n$PAD\nSh \"2\" R 340 340 0 0 1800\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo 300 0\nLe 18\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"1\" R 340 340 0 0 1800\nDr 0 0 0\nAt SMD N 00888000\nNe 25 \"N-000027\"\nPo -300 0\nLe 33\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$EndMODULE GSG-0603D\n$MODULE GSG-0603-SHORT-10MIL\nPo 65000 34000 1800 15 504D2AC6 504D3ABF ~P\nLi GSG-0603-SHORT-10MIL\nSc 504D3ABF\nAR /504D0B94\nOp 0 0 0\n.SolderMask 40\nT0 0 0 240 240 1800 60 N V 21 N \"R13\"\nT1 0 0 240 240 1800 60 N I 21 N \"0\"\nDS 540 -240 -540 -240 80 21\nDS -540 -240 -540 240 80 21\nDS -540 240 540 240 80 21\nDS 540 240 540 -240 80 21\n$PAD\nSh \"2\" R 340 340 0 0 1800\nDr 0 0 0\nAt SMD N 00808000\nNe 22 \"N-000023\"\nPo 300 0\nLe 33\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"1\" R 340 340 0 0 1800\nDr 0 0 0\nAt SMD N 00808000\nNe 20 \"3V3\"\nPo -300 0\nLe 1380141389\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"\" R 280 100 0 0 1800\nDr 0 0 0\nAt SMD N 00808000\nNe 0 \"\"\nPo 0 0\nLe 33\n$EndPAD\n$EndMODULE GSG-0603-SHORT-10MIL\n$MODULE GSG-0603-SHORT-10MIL\nPo 60850 39800 0 15 504D2AC6 504D3AC1 ~P\nLi GSG-0603-SHORT-10MIL\nSc 504D3AC1\nAR /504CB0EB\nOp 0 0 0\n.SolderMask 40\nT0 0 0 240 240 0 60 N V 21 N \"R7\"\nT1 0 0 240 240 0 60 N I 21 N \"0\"\nDS 540 -240 -540 -240 80 21\nDS -540 -240 -540 240 80 21\nDS -540 240 540 240 80 21\nDS 540 240 540 -240 80 21\n$PAD\nSh \"2\" R 340 340 0 0 0\nDr 0 0 0\nAt SMD N 00808000\nNe 32 \"N-000034\"\nPo 300 0\nLe 33\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"1\" R 340 340 0 0 0\nDr 0 0 0\nAt SMD N 00808000\nNe 33 \"N-000035\"\nPo -300 0\nLe 1380141389\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"\" R 280 100 0 0 0\nDr 0 0 0\nAt SMD N 00808000\nNe 0 \"\"\nPo 0 0\nLe 33\n$EndPAD\n$EndMODULE GSG-0603-SHORT-10MIL\n$MODULE GSG-0603-SHORT-10MIL\nPo 50500 41500 0 15 504D2AC6 504D3AC5 ~P\nLi GSG-0603-SHORT-10MIL\nSc 504D3AC5\nAR /504CF505\nOp 0 0 0\n.SolderMask 40\nT0 0 0 240 240 0 60 N V 21 N \"R15\"\nT1 0 0 240 240 0 60 N I 21 N \"0\"\nDS 540 -240 -540 -240 80 21\nDS -540 -240 -540 240 80 21\nDS -540 240 540 240 80 21\nDS 540 240 540 -240 80 21\n$PAD\nSh \"2\" R 340 340 0 0 0\nDr 0 0 0\nAt SMD N 00808000\nNe 20 \"3V3\"\nPo 300 0\nLe 33\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"1\" R 340 340 0 0 0\nDr 0 0 0\nAt SMD N 00808000\nNe 35 \"N-000039\"\nPo -300 0\nLe 1380141389\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"\" R 280 100 0 0 0\nDr 0 0 0\nAt SMD N 00808000\nNe 0 \"\"\nPo 0 0\nLe 33\n$EndPAD\n$EndMODULE GSG-0603-SHORT-10MIL\n$MODULE GSG-0603\nPo 58000 46000 0 15 4CFF2E39 504D3AC6 ~P\nLi GSG-0603\nSc 504D3AC6\nAR /504CFE6F\nOp 0 0 0\n.SolderMask 40\nT0 0 0 240 240 0 60 N V 21 N \"R12\"\nT1 0 0 240 240 0 60 N I 21 N \"330\"\nDS 540 -240 -540 -240 80 21\nDS -540 -240 -540 240 80 21\nDS -540 240 540 240 80 21\nDS 540 240 540 -240 80 21\n$PAD\nSh \"2\" R 340 340 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 17 \"/P2_4\"\nPo 300 0\nLe 226\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"1\" R 340 340 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 25 \"N-000027\"\nPo -300 0\nLe 46661520\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$EndMODULE GSG-0603\n$MODULE GSG-0603\nPo 58000 45000 0 15 4CFF2E39 504D3AC8 ~P\nLi GSG-0603\nSc 504D3AC8\nAR /504CFE39\nOp 0 0 0\n.SolderMask 40\nT0 0 0 240 240 0 60 N V 21 N \"R11\"\nT1 0 0 240 240 0 60 N I 21 N \"330\"\nDS 540 -240 -540 -240 80 21\nDS -540 -240 -540 240 80 21\nDS -540 240 540 240 80 21\nDS 540 240 540 -240 80 21\n$PAD\nSh \"2\" R 340 340 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 16 \"/P2_3\"\nPo 300 0\nLe 226\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"1\" R 340 340 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 24 \"N-000026\"\nPo -300 0\nLe 46661520\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$EndMODULE GSG-0603\n$MODULE GSG-0603\nPo 52000 45500 900 15 4CFF2E39 504D3ACA ~P\nLi GSG-0603\nSc 504D3ACA\nAR /504CF38E\nOp 0 0 0\n.SolderMask 40\nT0 0 0 240 240 900 60 N V 21 N \"R14\"\nT1 0 0 240 240 900 60 N I 21 N \"10k\"\nDS 540 -240 -540 -240 80 21\nDS -540 -240 -540 240 80 21\nDS -540 240 540 240 80 21\nDS 540 240 540 -240 80 21\n$PAD\nSh \"2\" R 340 340 0 0 900\nDr 0 0 0\nAt SMD N 00888000\nNe 1 \"/DC\"\nPo 300 0\nLe 226\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"1\" R 340 340 0 0 900\nDr 0 0 0\nAt SMD N 00888000\nNe 20 \"3V3\"\nPo -300 0\nLe 46661520\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$EndMODULE GSG-0603\n$MODULE GSG-0603\nPo 57950 42300 0 15 4CFF2E39 504D3ACC ~P\nLi GSG-0603\nSc 504D3ACC\nAR /504CAEA4\nOp 0 0 0\n.SolderMask 40\nT0 0 0 240 240 0 60 N V 21 N \"R10\"\nT1 0 0 240 240 0 60 N I 21 N \"33\"\nDS 540 -240 -540 -240 80 21\nDS -540 -240 -540 240 80 21\nDS -540 240 540 240 80 21\nDS 540 240 540 -240 80 21\n$PAD\nSh \"2\" R 340 340 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 43 \"N-000051\"\nPo 300 0\nLe 226\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"1\" R 340 340 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 36 \"N-000041\"\nPo -300 0\nLe 46661520\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$EndMODULE GSG-0603\n$MODULE GSG-0603\nPo 57650 41700 0 15 4CFF2E39 504D3ACE ~P\nLi GSG-0603\nSc 504D3ACE\nAR /504CAE9B\nOp 0 0 0\n.SolderMask 40\nT0 0 0 240 240 0 60 N V 21 N \"R9\"\nT1 0 0 240 240 0 60 N I 21 N \"33\"\nDS 540 -240 -540 -240 80 21\nDS -540 -240 -540 240 80 21\nDS -540 240 540 240 80 21\nDS 540 240 540 -240 80 21\n$PAD\nSh \"2\" R 340 340 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 37 \"N-000042\"\nPo 300 0\nLe 226\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"1\" R 340 340 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 38 \"N-000043\"\nPo -300 0\nLe 46661520\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$EndMODULE GSG-0603\n$MODULE GSG-0603\nPo 57650 41100 0 15 4CFF2E39 504D3AD0 ~P\nLi GSG-0603\nSc 504D3AD0\nAR /504CAF08\nOp 0 0 0\n.SolderMask 40\nT0 0 0 240 240 0 60 N V 21 N \"R8\"\nT1 0 0 240 240 0 60 N I 21 N \"1k5\"\nDS 540 -240 -540 -240 80 21\nDS -540 -240 -540 240 80 21\nDS -540 240 540 240 80 21\nDS 540 240 540 -240 80 21\n$PAD\nSh \"2\" R 340 340 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 33 \"N-000035\"\nPo 300 0\nLe 226\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"1\" R 340 340 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 38 \"N-000043\"\nPo -300 0\nLe 46661520\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$EndMODULE GSG-0603\n$MODULE GSG-0603\nPo 64000 39000 2700 15 4CFF2E39 504D3AD4 ~P\nLi GSG-0603\nSc 504D3AD4\nAR /504CF0D3\nOp 0 0 0\n.SolderMask 40\nT0 0 0 240 240 2700 60 N V 21 N \"R5\"\nT1 0 0 240 240 2700 60 N I 21 N \"330\"\nDS 540 -240 -540 -240 80 21\nDS -540 -240 -540 240 80 21\nDS -540 240 540 240 80 21\nDS 540 240 540 -240 80 21\n$PAD\nSh \"2\" R 340 340 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 42 \"N-000047\"\nPo 300 0\nLe 226\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"1\" R 340 340 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 34 \"N-000037\"\nPo -300 0\nLe 46661520\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$EndMODULE GSG-0603\n$MODULE GSG-0603\nPo 52750 37100 1800 15 4CFF2E39 504D3AE6 ~P\nLi GSG-0603\nSc 504D3AE6\nAR /504CAD71\nOp 0 0 0\n.SolderMask 40\nT0 0 0 240 240 1800 60 N V 21 N \"C15\"\nT1 0 0 240 240 1800 60 N I 21 N \"1uF\"\nDS 540 -240 -540 -240 80 21\nDS -540 -240 -540 240 80 21\nDS -540 240 540 240 80 21\nDS 540 240 540 -240 80 21\n$PAD\nSh \"2\" R 340 340 0 0 1800\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo 300 0\nLe 226\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"1\" R 340 340 0 0 1800\nDr 0 0 0\nAt SMD N 00888000\nNe 19 \"/VBUS\"\nPo -300 0\nLe 46661520\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$EndMODULE GSG-0603\n$MODULE GSG-0603\nPo 52750 38900 1800 15 4CFF2E39 504D3AE8 ~P\nLi GSG-0603\nSc 504D3AE8\nAR /504CAD75\nOp 0 0 0\n.SolderMask 40\nT0 0 0 240 240 1800 60 N V 21 N \"C16\"\nT1 0 0 240 240 1800 60 N I 21 N \"4u7\"\nDS 540 -240 -540 -240 80 21\nDS -540 -240 -540 240 80 21\nDS -540 240 540 240 80 21\nDS 540 240 540 -240 80 21\n$PAD\nSh \"2\" R 340 340 0 0 1800\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo 300 0\nLe 226\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"1\" R 340 340 0 0 1800\nDr 0 0 0\nAt SMD N 00888000\nNe 20 \"3V3\"\nPo -300 0\nLe 46661520\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$EndMODULE GSG-0603\n$MODULE GSG-0603\nPo 64000 47100 2700 15 505160A6 504D64FA ~P\nLi GSG-0603\nSc 504D64FA\nAR /504CA04A\nOp 0 0 0\n.SolderMask 40\nT0 230 -20 240 240 2700 60 N V 21 N \"C6\"\nT1 0 0 240 240 2700 60 N I 21 N \"10nF\"\nDS 540 -240 -540 -240 80 21\nDS -540 -240 -540 240 80 21\nDS -540 240 540 240 80 21\nDS 540 240 540 -240 80 21\n$PAD\nSh \"2\" R 340 340 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 29 \"N-000031\"\nPo 300 0\nLe 226\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"1\" R 340 340 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 30 \"N-000032\"\nPo -300 0\nLe 46661520\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$EndMODULE GSG-0603\n$MODULE GSG-0603\nPo 66250 43750 1800 15 4CFF2E39 504D3AEE ~P\nLi GSG-0603\nSc 504D3AEE\nAR /504CA3D1\nOp 0 0 0\n.SolderMask 40\nT0 0 0 240 240 1800 60 N V 21 N \"C1\"\nT1 0 0 240 240 1800 60 N I 21 N \"1uF\"\nDS 540 -240 -540 -240 80 21\nDS -540 -240 -540 240 80 21\nDS -540 240 540 240 80 21\nDS 540 240 540 -240 80 21\n$PAD\nSh \"2\" R 340 340 0 0 1800\nDr 0 0 0\nAt SMD N 00888000\nNe 31 \"N-000033\"\nPo 300 0\nLe 226\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"1\" R 340 340 0 0 1800\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo -300 0\nLe 46661520\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$EndMODULE GSG-0603\n$MODULE GSG-0603\nPo 51000 45500 2700 15 4CFF2E39 504D3AF6 ~P\nLi GSG-0603\nSc 504D3AF6\nAR /504CEFF7\nOp 0 0 0\n.SolderMask 40\nT0 0 0 240 240 2700 60 N V 21 N \"R2\"\nT1 0 0 240 240 2700 60 N I 21 N \"10k\"\nDS 540 -240 -540 -240 80 21\nDS -540 -240 -540 240 80 21\nDS -540 240 540 240 80 21\nDS 540 240 540 -240 80 21\n$PAD\nSh \"2\" R 340 340 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 20 \"3V3\"\nPo 300 0\nLe 226\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"1\" R 340 340 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 18 \"/RESET_N\"\nPo -300 0\nLe 46661520\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$EndMODULE GSG-0603\n$MODULE GSG-0402\nPo 65100 47100 900 15 4FB6CFE4 504D3AF7 ~P\nLi GSG-0402\nSc 504D3AF7\nAR /504CFCBE\nOp 0 0 0\n.SolderMask 40\nT0 0 20 160 160 900 40 N V 21 N \"D1\"\nT1 0 20 160 160 900 40 N I 21 N \"TVS_DIODE\"\nDS 350 -150 350 150 80 21\nDS 350 150 -350 150 80 21\nDS -350 150 -350 -150 80 21\nDS -350 -150 350 -150 80 21\n$PAD\nSh \"2\" R 200 220 0 0 900\nDr 0 0 0\nAt SMD N 00888000\nNe 23 \"N-000024\"\nPo 210 0\n.SolderMask 40\n$EndPAD\n$PAD\nSh \"1\" R 200 220 0 0 900\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo -210 0\nLe 24791752\n.SolderMask 40\n$EndPAD\n$EndMODULE GSG-0402\n$MODULE GSG-0402\nPo 66050 44250 0 15 4FB6CFE4 504D3AD2 ~~\nLi GSG-0402\nSc 504D3AD2\nAR /504CA8D9\nOp 0 0 0\n.SolderMask 40\nT0 0 20 160 160 0 40 N V 21 N \"C2\"\nT1 0 20 160 160 0 40 N I 21 N \"100nF\"\nDS 350 -150 350 150 80 21\nDS 350 150 -350 150 80 21\nDS -350 150 -350 -150 80 21\nDS -350 -150 350 -150 80 21\n$PAD\nSh \"2\" R 200 220 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo 210 0\n.SolderMask 40\n$EndPAD\n$PAD\nSh \"1\" R 200 220 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 20 \"3V3\"\nPo -210 0\nLe 24791752\n.SolderMask 40\n$EndPAD\n$EndMODULE GSG-0402\n$MODULE GSG-0402\nPo 64800 45400 900 15 4FB6CFE4 504D65ED ~~\nLi GSG-0402\nSc 504D65ED\nAR /504CAA44\nOp 0 0 0\n.SolderMask 40\nT0 0 20 160 160 900 40 N V 21 N \"C3\"\nT1 0 20 160 160 900 40 N I 21 N \"220pF\"\nDS 350 -150 350 150 80 21\nDS 350 150 -350 150 80 21\nDS -350 150 -350 -150 80 21\nDS -350 -150 350 -150 80 21\n$PAD\nSh \"2\" R 200 220 0 0 900\nDr 0 0 0\nAt SMD N 00888000\nNe 20 \"3V3\"\nPo 210 0\n.SolderMask 40\n$EndPAD\n$PAD\nSh \"1\" R 200 220 0 0 900\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo -210 0\nLe 24791752\n.SolderMask 40\n$EndPAD\n$EndMODULE GSG-0402\n$MODULE GSG-0402\nPo 64350 40850 2700 15 50515FE5 504D3AF2 ~~\nLi GSG-0402\nSc 504D3AF2\nAR /504CA908\nOp 0 0 0\n.SolderMask 40\nT0 0 -20 160 160 2700 40 N V 21 N \"C4\"\nT1 0 20 160 160 2700 40 N I 21 N \"100nF\"\nDS 350 -150 350 150 80 21\nDS 350 150 -350 150 80 21\nDS -350 150 -350 -150 80 21\nDS -350 -150 350 -150 80 21\n$PAD\nSh \"2\" R 200 220 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 20 \"3V3\"\nPo 210 0\n.SolderMask 40\n$EndPAD\n$PAD\nSh \"1\" R 200 220 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo -210 0\nLe 24791752\n.SolderMask 40\n$EndPAD\n$EndMODULE GSG-0402\n$MODULE GSG-0402\nPo 64400 45400 900 15 4FB6CFE4 504D683B ~~\nLi GSG-0402\nSc 504D683B\nAR /504CAA22\nOp 0 0 0\n.SolderMask 40\nT0 0 20 160 160 900 40 N V 21 N \"C5\"\nT1 0 20 160 160 900 40 N I 21 N \"10nF\"\nDS 350 -150 350 150 80 21\nDS 350 150 -350 150 80 21\nDS -350 150 -350 -150 80 21\nDS -350 -150 350 -150 80 21\n$PAD\nSh \"2\" R 200 220 0 0 900\nDr 0 0 0\nAt SMD N 00888000\nNe 20 \"3V3\"\nPo 210 0\n.SolderMask 40\n$EndPAD\n$PAD\nSh \"1\" R 200 220 0 0 900\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo -210 0\nLe 24791752\n.SolderMask 40\n$EndPAD\n$EndMODULE GSG-0402\n$MODULE GSG-0402\nPo 64700 46300 0 15 4FB6CFE4 504D683E ~~\nLi GSG-0402\nSc 504D683E\nAR /504CA01F\nOp 0 0 0\n.SolderMask 40\nT0 0 20 160 160 0 40 N V 21 N \"C7\"\nT1 0 20 160 160 0 40 N I 21 N \"10nF\"\nDS 350 -150 350 150 80 21\nDS 350 150 -350 150 80 21\nDS -350 150 -350 -150 80 21\nDS -350 -150 350 -150 80 21\n$PAD\nSh \"2\" R 200 220 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo 210 0\n.SolderMask 40\n$EndPAD\n$PAD\nSh \"1\" R 200 220 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 28 \"N-000030\"\nPo -210 0\nLe 24791752\n.SolderMask 40\n$EndPAD\n$EndMODULE GSG-0402\n$MODULE GSG-0402\nPo 61550 44350 0 15 4FB6CFE4 504D3AF4 ~~\nLi GSG-0402\nSc 504D3AF4\nAR /504CA977\nOp 0 0 0\n.SolderMask 40\nT0 0 20 160 160 0 40 N V 21 N \"C8\"\nT1 0 20 160 160 0 40 N I 21 N \"10nF\"\nDS 350 -150 350 150 80 21\nDS 350 150 -350 150 80 21\nDS -350 150 -350 -150 80 21\nDS -350 -150 350 -150 80 21\n$PAD\nSh \"2\" R 200 220 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 20 \"3V3\"\nPo 210 0\n.SolderMask 40\n$EndPAD\n$PAD\nSh \"1\" R 200 220 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo -210 0\nLe 24791752\n.SolderMask 40\n$EndPAD\n$EndMODULE GSG-0402\n$MODULE GSG-0402\nPo 63250 45450 900 15 4FB6CFE4 504D3ADA ~~\nLi GSG-0402\nSc 504D3ADA\nAR /504CA9AD\nOp 0 0 0\n.SolderMask 40\nT0 0 20 160 160 900 40 N V 21 N \"C9\"\nT1 0 20 160 160 900 40 N I 21 N \"2p2\"\nDS 350 -150 350 150 80 21\nDS 350 150 -350 150 80 21\nDS -350 150 -350 -150 80 21\nDS -350 -150 350 -150 80 21\n$PAD\nSh \"2\" R 200 220 0 0 900\nDr 0 0 0\nAt SMD N 00888000\nNe 20 \"3V3\"\nPo 210 0\n.SolderMask 40\n$EndPAD\n$PAD\nSh \"1\" R 200 220 0 0 900\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo -210 0\nLe 24791752\n.SolderMask 40\n$EndPAD\n$EndMODULE GSG-0402\n$MODULE GSG-0402\nPo 60150 45500 900 15 4FB6CFE4 504D3ADC ~~\nLi GSG-0402\nSc 504D3ADC\nAR /504CA2F0\nOp 0 0 0\n.SolderMask 40\nT0 0 20 160 160 900 40 N V 21 N \"C10\"\nT1 0 20 160 160 900 40 N I 21 N \"22pF\"\nDS 350 -150 350 150 80 21\nDS 350 150 -350 150 80 21\nDS -350 150 -350 -150 80 21\nDS -350 -150 350 -150 80 21\n$PAD\nSh \"2\" R 200 220 0 0 900\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo 210 0\n.SolderMask 40\n$EndPAD\n$PAD\nSh \"1\" R 200 220 0 0 900\nDr 0 0 0\nAt SMD N 00888000\nNe 41 \"N-000046\"\nPo -210 0\nLe 24791752\n.SolderMask 40\n$EndPAD\n$EndMODULE GSG-0402\n$MODULE GSG-0402\nPo 62850 45450 2700 15 50515FB0 504D3ADE ~~\nLi GSG-0402\nSc 504D3ADE\nAR /504CA2F3\nOp 0 0 0\n.SolderMask 40\nT0 0 -20 160 160 2700 40 N V 21 N \"C11\"\nT1 0 20 160 160 2700 40 N I 21 N \"22pF\"\nDS 350 -150 350 150 80 21\nDS 350 150 -350 150 80 21\nDS -350 150 -350 -150 80 21\nDS -350 -150 350 -150 80 21\n$PAD\nSh \"2\" R 200 220 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo 210 0\n.SolderMask 40\n$EndPAD\n$PAD\nSh \"1\" R 200 220 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 39 \"N-000044\"\nPo -210 0\nLe 24791752\n.SolderMask 40\n$EndPAD\n$EndMODULE GSG-0402\n$MODULE GSG-0402\nPo 61350 42700 0 15 4FB6CFE4 504D3AE4 ~~\nLi GSG-0402\nSc 504D3AE4\nAR /504CA934\nOp 0 0 0\n.SolderMask 40\nT0 0 20 160 160 0 40 N V 21 N \"C14\"\nT1 0 20 160 160 0 40 N I 21 N \"100nF\"\nDS 350 -150 350 150 80 21\nDS 350 150 -350 150 80 21\nDS -350 150 -350 -150 80 21\nDS -350 -150 350 -150 80 21\n$PAD\nSh \"2\" R 200 220 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 20 \"3V3\"\nPo 210 0\n.SolderMask 40\n$EndPAD\n$PAD\nSh \"1\" R 200 220 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo -210 0\nLe 24791752\n.SolderMask 40\n$EndPAD\n$EndMODULE GSG-0402\n$MODULE GSG-0603\nPo 64300 46800 1800 15 50515FC0 504D4803 ~~\nLi GSG-0603\nSc 504D4803\nAR /504D4718\nOp 0 0 0\n.SolderMask 40\nT0 -140 0 240 240 1800 60 N V 21 N \"C17\"\nT1 0 0 240 240 1800 60 N I 21 N \"10nF\"\nDS 540 -240 -540 -240 80 21\nDS -540 -240 -540 240 80 21\nDS -540 240 540 240 80 21\nDS 540 240 540 -240 80 21\n$PAD\nSh \"2\" R 340 340 0 0 1800\nDr 0 0 0\nAt SMD N 00888000\nNe 30 \"N-000032\"\nPo 300 0\nLe 226\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"1\" R 340 340 0 0 1800\nDr 0 0 0\nAt SMD N 00888000\nNe 23 \"N-000024\"\nPo -300 0\nLe 46661520\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$EndMODULE GSG-0603\n$MODULE GSG-0402\nPo 65200 45400 2700 15 50515FB8 504D3AD8 ~~\nLi GSG-0402\nSc 504D3AD8\nAR /504CA84D\nOp 0 0 0\n.SolderMask 40\nT0 0 -20 160 160 2700 40 N V 21 N \"R4\"\nT1 0 20 160 160 2700 40 N I 21 N \"56k\"\nDS 350 -150 350 150 80 21\nDS 350 150 -350 150 80 21\nDS -350 150 -350 -150 80 21\nDS -350 -150 350 -150 80 21\n$PAD\nSh \"2\" R 200 220 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo 210 0\n.SolderMask 40\n$EndPAD\n$PAD\nSh \"1\" R 200 220 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 40 \"N-000045\"\nPo -210 0\nLe 24791752\n.SolderMask 40\n$EndPAD\n$EndMODULE GSG-0402\n$MODULE GSG-0603\nPo 59200 41400 2700 15 4CFF2E39 504D3AE0 ~~\nLi GSG-0603\nSc 504D3AE0\nAR /504CAEAF\nOp 0 0 0\n.SolderMask 40\nT0 0 0 240 240 2700 60 N V 21 N \"C12\"\nT1 0 0 240 240 2700 60 N I 21 N \"47pF\"\nDS 540 -240 -540 -240 80 21\nDS -540 -240 -540 240 80 21\nDS -540 240 540 240 80 21\nDS 540 240 540 -240 80 21\n$PAD\nSh \"2\" R 340 340 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 37 \"N-000042\"\nPo 300 0\nLe 226\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"1\" R 340 340 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo -300 0\nLe 46661520\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$EndMODULE GSG-0603\n$MODULE GSG-0603\nPo 59200 42600 900 15 4CFF2E39 504D3AE2 ~~\nLi GSG-0603\nSc 504D3AE2\nAR /504CAECB\nOp 0 0 0\n.SolderMask 40\nT0 0 0 240 240 900 60 N V 21 N \"C13\"\nT1 0 0 240 240 900 60 N I 21 N \"47pF\"\nDS 540 -240 -540 -240 80 21\nDS -540 -240 -540 240 80 21\nDS -540 240 540 240 80 21\nDS 540 240 540 -240 80 21\n$PAD\nSh \"2\" R 340 340 0 0 900\nDr 0 0 0\nAt SMD N 00888000\nNe 43 \"N-000051\"\nPo 300 0\nLe 226\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"1\" R 340 340 0 0 900\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo -300 0\nLe 46661520\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$EndMODULE GSG-0603\n$MODULE GSG-0603\nPo 59800 39450 900 15 4CFF2E39 504D3AC3 ~~\nLi GSG-0603\nSc 504D3AC3\nAR /504CAF13\nOp 0 0 0\n.SolderMask 40\nT0 0 0 240 240 900 60 N V 21 N \"R6\"\nT1 0 0 240 240 900 60 N I 21 N \"0\"\nDS 540 -240 -540 -240 80 21\nDS -540 -240 -540 240 80 21\nDS -540 240 540 240 80 21\nDS 540 240 540 -240 80 21\n$PAD\nSh \"2\" R 340 340 0 0 900\nDr 0 0 0\nAt SMD N 00888000\nNe 20 \"3V3\"\nPo 300 0\nLe 226\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$PAD\nSh \"1\" R 340 340 0 0 900\nDr 0 0 0\nAt SMD N 00888000\nNe 33 \"N-000035\"\nPo -300 0\nLe 46661520\n.SolderMask 40\n.LocalClearance 70\n$EndPAD\n$EndMODULE GSG-0603\n$MODULE GSG-HOLE260MIL\nPo 58500 19000 0 15 5051616D 504D7CF3 ~~\nLi GSG-HOLE260MIL\nSc 504D7CF3\nAR GSG-HOLE260MIL\nOp 0 0 0\nT0 0 0 394 394 0 80 N I 21 N \"HOLE260MIL\"\nT1 0 0 394 394 0 80 N I 21 N \"VAL**\"\n$PAD\nSh \"\" C 2600 2600 0 0 0\nDr 2600 0 0\nAt STD N 00C0FFFF\nNe 0 \"\"\nPo 0 0\nLe 235021312\n$EndPAD\n$EndMODULE GSG-HOLE260MIL\n$MODULE GSG-QFN36\nPo 63700 43100 2700 15 504E2458 504D65EA ~~\nLi GSG-QFN36\nSc 504D65EA\nAR /504D0F40\nOp 0 0 0\nT0 0 0 600 600 2700 120 N V 21 N \"U1\"\nT1 0 0 600 600 2700 120 N I 21 N \"CC1111\"\nDS 1181 -906 1181 -1181 80 21\nDS 1181 -1181 906 -1181 80 21\nDS 906 1181 1181 1181 80 21\nDS 1181 1181 1181 906 80 21\nDS -1181 906 -1181 1181 80 21\nDS -1181 1181 -906 1181 80 21\nDS -1181 -906 -1181 -984 80 21\nDS -1181 -984 -984 -1181 80 21\nDS -984 -1181 -906 -1181 80 21\n$PAD\nSh \"1\" O 394 110 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 9 \"/P1_2\"\nPo -1142 -787\n$EndPAD\n$PAD\nSh \"2\" O 394 110 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 20 \"3V3\"\nPo -1142 -591\n$EndPAD\n$PAD\nSh \"3\" O 394 110 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 42 \"N-000047\"\nPo -1142 -394\n$EndPAD\n$PAD\nSh \"4\" O 394 110 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 32 \"N-000034\"\nPo -1142 -197\n$EndPAD\n$PAD\nSh \"5\" O 394 110 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 3 \"/P0_0\"\nPo -1142 0\n$EndPAD\n$PAD\nSh \"6\" O 394 110 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 4 \"/P0_1\"\nPo -1142 197\n$EndPAD\n$PAD\nSh \"7\" O 394 110 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 5 \"/P0_2\"\nPo -1142 394\n$EndPAD\n$PAD\nSh \"8\" O 394 110 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 6 \"/P0_3\"\nPo -1142 591\n$EndPAD\n$PAD\nSh \"9\" O 394 110 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 7 \"/P0_4\"\nPo -1142 787\n$EndPAD\n$PAD\nSh \"10\" O 394 110 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 37 \"N-000042\"\nPo -787 1142\n$EndPAD\n$PAD\nSh \"11\" O 394 110 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 43 \"N-000051\"\nPo -591 1142\n$EndPAD\n$PAD\nSh \"12\" O 394 110 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 20 \"3V3\"\nPo -394 1142\n$EndPAD\n$PAD\nSh \"13\" O 394 110 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 8 \"/P0_5\"\nPo -197 1142\n$EndPAD\n$PAD\nSh \"14\" O 394 110 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 15 \"/P2_0\"\nPo 0 1142\n$EndPAD\n$PAD\nSh \"15\" O 394 110 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 2 \"/DD\"\nPo 197 1142\n$EndPAD\n$PAD\nSh \"16\" O 394 110 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 1 \"/DC\"\nPo 394 1142\n$EndPAD\n$PAD\nSh \"17\" O 394 110 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 16 \"/P2_3\"\nPo 591 1142\n$EndPAD\n$PAD\nSh \"18\" O 394 110 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 17 \"/P2_4\"\nPo 787 1142\n$EndPAD\n$PAD\nSh \"19\" O 394 110 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 20 \"3V3\"\nPo 1142 787\n$EndPAD\n$PAD\nSh \"20\" O 394 110 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 41 \"N-000046\"\nPo 1142 591\n$EndPAD\n$PAD\nSh \"21\" O 394 110 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 39 \"N-000044\"\nPo 1142 394\n$EndPAD\n$PAD\nSh \"22\" O 394 110 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 20 \"3V3\"\nPo 1142 197\n$EndPAD\n$PAD\nSh \"23\" O 394 110 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 26 \"N-000028\"\nPo 1142 0\n$EndPAD\n$PAD\nSh \"24\" O 394 110 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 27 \"N-000029\"\nPo 1142 -197\n$EndPAD\n$PAD\nSh \"25\" O 394 110 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 20 \"3V3\"\nPo 1142 -394\n$EndPAD\n$PAD\nSh \"26\" O 394 110 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 20 \"3V3\"\nPo 1142 -591\n$EndPAD\n$PAD\nSh \"27\" O 394 110 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 40 \"N-000045\"\nPo 1142 -787\n$EndPAD\n$PAD\nSh \"28\" O 394 110 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 20 \"3V3\"\nPo 787 -1142\n$EndPAD\n$PAD\nSh \"29\" O 394 110 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 20 \"3V3\"\nPo 591 -1142\n$EndPAD\n$PAD\nSh \"30\" O 394 110 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 31 \"N-000033\"\nPo 394 -1142\n$EndPAD\n$PAD\nSh \"31\" O 394 110 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 18 \"/RESET_N\"\nPo 197 -1142\n$EndPAD\n$PAD\nSh \"32\" O 394 110 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 14 \"/P1_7\"\nPo 0 -1142\n$EndPAD\n$PAD\nSh \"33\" O 394 110 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 13 \"/P1_6\"\nPo -197 -1142\n$EndPAD\n$PAD\nSh \"34\" O 394 110 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 12 \"/P1_5\"\nPo -394 -1142\n$EndPAD\n$PAD\nSh \"35\" O 394 110 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 11 \"/P1_4\"\nPo -591 -1142\n$EndPAD\n$PAD\nSh \"36\" O 394 110 0 0 0\nDr 0 0 0\nAt SMD N 00888000\nNe 10 \"/P1_3\"\nPo -787 -1142\n$EndPAD\n$PAD\nSh \"0\" R 579 579 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo 0 0\n$EndPAD\n$PAD\nSh \"0\" R 579 579 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo 575 0\n$EndPAD\n$PAD\nSh \"0\" R 579 579 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo -575 0\n$EndPAD\n$PAD\nSh \"0\" R 579 579 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo 0 -575\n$EndPAD\n$PAD\nSh \"0\" R 579 579 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo 0 575\n$EndPAD\n$PAD\nSh \"0\" R 579 579 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo 575 -575\n$EndPAD\n$PAD\nSh \"0\" R 579 579 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo -575 -575\n$EndPAD\n$PAD\nSh \"0\" R 579 579 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo -575 575\n$EndPAD\n$PAD\nSh \"0\" R 579 579 0 0 2700\nDr 0 0 0\nAt SMD N 00888000\nNe 21 \"GND\"\nPo 575 575\n$EndPAD\n$PAD\nSh \"0\" C 551 551 0 0 2700\nDr 150 0 0\nAt STD N 00C0FFFF\nNe 21 \"GND\"\nPo 575 -575\n$EndPAD\n$PAD\nSh \"0\" C 551 551 0 0 2700\nDr 150 0 0\nAt STD N 00C0FFFF\nNe 21 \"GND\"\nPo 0 -575\n$EndPAD\n$PAD\nSh \"0\" C 551 551 0 0 2700\nDr 150 0 0\nAt STD N 00C0FFFF\nNe 21 \"GND\"\nPo -575 -575\n$EndPAD\n$PAD\nSh \"0\" C 551 551 0 0 2700\nDr 150 0 0\nAt STD N 00C0FFFF\nNe 21 \"GND\"\nPo -575 0\n$EndPAD\n$PAD\nSh \"0\" C 551 551 0 0 2700\nDr 150 0 0\nAt STD N 00C0FFFF\nNe 21 \"GND\"\nPo 0 0\n$EndPAD\n$PAD\nSh \"0\" C 551 551 0 0 2700\nDr 150 0 0\nAt STD N 00C0FFFF\nNe 21 \"GND\"\nPo 575 0\n$EndPAD\n$PAD\nSh \"0\" C 551 551 0 0 2700\nDr 150 0 0\nAt STD N 00C0FFFF\nNe 21 \"GND\"\nPo -575 575\n$EndPAD\n$PAD\nSh \"0\" C 551 551 0 0 2700\nDr 150 0 0\nAt STD N 00C0FFFF\nNe 21 \"GND\"\nPo 0 575\n$EndPAD\n$PAD\nSh \"0\" C 551 551 0 0 2700\nDr 150 0 0\nAt STD N 00C0FFFF\nNe 21 \"GND\"\nPo 575 575\n$EndPAD\n$EndMODULE GSG-QFN36\n$TEXTPCB\nTe \"P2_2\"\nPo 58500 33000 300 400 75 0\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$TEXTPCB\nTe \"P2_1\"\nPo 55150 33000 300 400 75 0\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$TEXTPCB\nTe \"1\"\nPo 50800 31500 400 500 100 0\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$DRAWSEGMENT\nPo 0 56350 45500 56100 45500 80\nDe 21 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 0 56600 45500 56850 45500 80\nDe 21 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 0 65550 39150 65550 39400 80\nDe 21 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 0 65550 38900 65550 38650 80\nDe 21 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 0 63400 46450 64200 46450 80\nDe 21 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 0 64200 46500 64200 46200 80\nDe 21 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 0 63400 46500 64200 46500 80\nDe 21 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 0 63400 46200 63400 46500 80\nDe 21 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 3 65050 41750 65150 41850 80\nDe 21 0 900 0 0\n$EndDRAWSEGMENT\n$TEXTPCB\nTe \"14\"\nPo 58500 49500 3500 5000 875 0\nDe 20 0 0 Normal C\n$EndTEXTPCB\n$TEXTPCB\nTe \"D1\"\nPo 65100 47850 300 400 75 0\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$TEXTPCB\nTe \"C6/C17\"\nPo 61500 47050 300 400 75 0\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$TEXTPCB\nTe \"R6\"\nPo 59150 39500 300 400 75 0\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$TEXTPCB\nTe \"R7\"\nPo 60850 39250 300 400 75 0\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$TEXTPCB\nTe \"R13\"\nPo 65000 33450 300 400 75 0\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$TEXTPCB\nTe \"R15\"\nPo 50500 42100 300 400 75 0\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$TEXTPCB\nTe \"GND\"\nPo 65200 32450 300 400 75 0\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$TEXTPCB\nTe \"3V3\"\nPo 61850 32450 300 400 75 0\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$TEXTPCB\nTe \"DC\"\nPo 58500 32450 300 400 75 0\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$TEXTPCB\nTe \"DD\"\nPo 55150 32450 300 400 75 0\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$TEXTPCB\nTe \"RESET_N\"\nPo 51800 32450 300 400 75 0\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$TEXTPCB\nTe \"GND\"\nPo 52200 35000 300 400 75 0\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$TEXTPCB\nTe \"3V3\"\nPo 52200 34000 300 400 75 0\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$TEXTPCB\nTe \"SW1\"\nPo 67500 34500 600 800 120 0\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$TEXTPCB\nTe \"P1 EXPANSION\"\nPo 59500 36500 600 800 120 0\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$TEXTPCB\nTe \"P9\"\nPo 50000 36500 600 800 120 0\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$DRAWSEGMENT\nPo 0 65400 39150 65700 39150 80\nDe 21 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 0 65700 38900 65550 39100 80\nDe 21 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 0 65400 38900 65700 38900 80\nDe 21 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 0 65550 39100 65400 38900 80\nDe 21 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 0 56600 45650 56400 45500 80\nDe 21 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 0 56600 45350 56600 45650 80\nDe 21 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 0 56400 45500 56600 45350 80\nDe 21 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 0 56350 45650 56350 45350 80\nDe 21 0 900 0 0\n$EndDRAWSEGMENT\n$TEXTPCB\nTe \"LED1\"\nPo 64500 38000 400 500 100 0\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$TEXTPCB\nTe \"LED3\"\nPo 56500 46750 400 500 100 0\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$TEXTPCB\nTe \"LED2\"\nPo 56500 44250 400 500 100 0\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$DRAWSEGMENT\nPo 0 63500 47000 62500 47000 150\nDe 21 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 0 63500 47000 63250 47250 150\nDe 21 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 0 63500 47000 63250 46750 150\nDe 21 0 900 0 0\n$EndDRAWSEGMENT\n$TEXTPCB\nTe \"P2 ANTENNA\"\nPo 70000 45000 600 800 120 900\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$TEXTPCB\nTe \"P8 GoodFET\"\nPo 52000 47000 600 800 120 0\nDe 21 1 0 Normal C\n$EndTEXTPCB\n$TEXTPCB\nTe \"http://greatscottgadgets.com/tc14badge/\"\nPo 58500 54000 700 1000 150 0\nDe 20 0 0 Normal C\n$EndTEXTPCB\n$DRAWSEGMENT\nPo 0 67000 17000 50000 17000 150\nDe 28 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 0 46000 21000 46000 53000 150\nDe 28 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 0 71000 53000 71000 21000 150\nDe 28 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 0 50000 57000 67000 57000 150\nDe 28 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 2 67000 21000 67000 17000 150\nDe 28 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 2 50000 21000 46000 21000 150\nDe 28 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 2 50000 53000 50000 57000 150\nDe 28 0 900 0 0\n$EndDRAWSEGMENT\n$DRAWSEGMENT\nPo 2 67000 53000 71000 53000 150\nDe 28 0 900 0 0\n$EndDRAWSEGMENT\n$TRACK\nPo 0 62219 43494 62150 43563 80 -1\nDe 15 0 1 0 0\nPo 0 52000 44000 52000 45200 80 -1\nDe 15 0 1 0 C00000\nPo 0 56218 43782 60448 43782 80 -1\nDe 15 0 1 0 0\nPo 0 56990 31500 56128 30638 80 -1\nDe 15 0 1 0 0\nPo 0 54800 45200 52000 45200 80 -1\nDe 15 0 1 0 800000\nPo 0 60667 43563 60448 43782 80 -1\nDe 15 0 1 0 0\nPo 0 48800 44700 51300 44700 80 -1\nDe 0 0 1 0 0\nPo 0 48500 42500 48500 44400 80 -1\nDe 0 0 1 0 0\nPo 0 62558 43494 62219 43494 80 -1\nDe 15 0 1 0 400000\nPo 0 48500 44400 48800 44700 80 -1\nDe 0 0 1 0 0\nPo 0 52000 44000 51300 44700 80 -1\nDe 0 0 1 0 400000\nPo 0 49338 38838 49338 41662 80 -1\nDe 0 0 1 0 0\nPo 0 48080 37580 49338 38838 80 -1\nDe 0 0 1 0 0\nPo 3 48080 37580 48080 37580 310 160\nDe 15 1 1 0 0\nPo 0 48232 30638 47538 31332 80 -1\nDe 15 0 1 0 0\nPo 0 47538 31332 47538 37038 80 -1\nDe 15 0 1 0 0\nPo 0 56128 30638 48232 30638 80 -1\nDe 15 0 1 0 0\nPo 0 54800 45200 56218 43782 80 -1\nDe 15 0 1 0 0\nPo 0 56990 31500 58500 31500 80 -1\nDe 15 0 1 0 800000\nPo 0 49338 41662 48500 42500 80 -1\nDe 0 0 1 0 0\nPo 0 62150 43563 60667 43563 80 -1\nDe 15 0 1 0 0\nPo 0 47538 37038 48080 37580 80 -1\nDe 15 0 1 0 0\nPo 0 49000 44000 49500 43500 80 -1\nDe 15 0 2 0 400000\nPo 0 49500 38770 49500 43500 80 -1\nDe 0 0 2 0 0\nPo 0 62184 43297 62080 43401 80 -1\nDe 15 0 2 0 0\nPo 0 56200 43500 56320 43620 80 -1\nDe 15 0 2 0 0\nPo 0 49000 44000 49500 43500 80 -1\nDe 0 0 2 0 400000\nPo 0 56320 43620 60380 43620 80 -1\nDe 15 0 2 0 0\nPo 0 62184 43297 62558 43297 80 -1\nDe 15 0 2 0 800000\nPo 0 54454 30800 55154 31500 80 -1\nDe 15 0 2 0 800000\nPo 0 49500 43500 56200 43500 80 -1\nDe 15 0 2 0 0\nPo 0 62080 43401 60599 43401 80 -1\nDe 15 0 2 0 0\nPo 0 48380 37650 49500 38770 80 -1\nDe 0 0 2 0 0\nPo 0 48300 30800 54454 30800 80 -1\nDe 15 0 2 0 0\nPo 0 47700 31400 48300 30800 80 -1\nDe 15 0 2 0 0\nPo 0 47700 36800 48080 37180 80 -1\nDe 15 0 2 0 0\nPo 0 60380 43620 60599 43401 80 -1\nDe 15 0 2 0 0\nPo 3 48080 37180 48080 37180 310 160\nDe 15 1 2 0 0\nPo 0 47700 31400 47700 36800 80 -1\nDe 15 0 2 0 0\nPo 0 48380 37480 48380 37650 80 -1\nDe 0 0 2 0 0\nPo 0 48080 37180 48380 37480 80 -1\nDe 0 0 2 0 0\nPo 0 63700 41958 63700 41690 80 -1\nDe 15 0 3 0 400000\nPo 0 63676 41056 63000 40380 80 -1\nDe 15 0 3 0 0\nPo 0 63700 41690 63676 41666 80 -1\nDe 15 0 3 0 0\nPo 0 63000 40380 63000 35000 80 -1\nDe 15 0 3 0 800000\nPo 0 63676 41666 63676 41056 80 -1\nDe 15 0 3 0 0\nPo 0 62838 40448 62838 35818 80 -1\nDe 15 0 4 0 0\nPo 0 63503 41113 62838 40448 80 -1\nDe 15 0 4 0 0\nPo 0 62838 35818 62510 35490 80 -1\nDe 15 0 4 0 0\nPo 0 62510 35490 62510 34510 80 -1\nDe 15 0 4 0 0\nPo 0 63503 41958 63503 41113 80 -1\nDe 15 0 4 0 400000\nPo 0 62510 34510 62000 34000 80 -1\nDe 15 0 4 0 800000\nPo 0 62000 35210 62000 35000 80 -1\nDe 15 0 5 0 800000\nPo 0 62676 35886 62000 35210 80 -1\nDe 15 0 5 0 0\nPo 0 63306 41146 62676 40516 80 -1\nDe 15 0 5 0 0\nPo 0 63306 41958 63306 41146 80 -1\nDe 15 0 5 0 400000\nPo 0 62676 40516 62676 35886 80 -1\nDe 15 0 5 0 0\nPo 0 63109 41958 63109 41179 80 -1\nDe 15 0 6 0 400000\nPo 0 61500 34500 61000 34000 80 -1\nDe 15 0 6 0 800000\nPo 0 61500 35500 61500 34500 80 -1\nDe 15 0 6 0 0\nPo 0 63109 41179 62514 40584 80 -1\nDe 15 0 6 0 0\nPo 0 62514 40584 62514 36514 80 -1\nDe 15 0 6 0 0\nPo 0 62514 36514 61500 35500 80 -1\nDe 15 0 6 0 0\nPo 0 62352 40652 62352 36582 80 -1\nDe 15 0 7 0 0\nPo 0 62913 41958 62913 41213 80 -1\nDe 15 0 7 0 400000\nPo 0 61000 35230 61000 35000 80 -1\nDe 15 0 7 0 800000\nPo 0 62352 36582 61000 35230 80 -1\nDe 15 0 7 0 0\nPo 0 62913 41213 62352 40652 80 -1\nDe 15 0 7 0 0\nPo 0 56000 40920 56172 40748 80 -1\nDe 0 0 8 0 0\nPo 0 61943 43077 60461 43077 80 -1\nDe 15 0 8 0 0\nPo 3 56000 40920 56000 40920 310 160\nDe 15 1 8 0 0\nPo 0 62117 42903 61943 43077 80 -1\nDe 15 0 8 0 0\nPo 0 62558 42903 62117 42903 80 -1\nDe 15 0 8 0 400000\nPo 0 59500 34500 60000 34000 80 -1\nDe 15 0 8 0 800000\nPo 0 55841 42299 55832 42290 80 -1\nDe 15 0 8 0 0\nPo 0 55841 42299 55841 41079 80 -1\nDe 15 0 8 0 0\nPo 0 56350 38600 56680 38600 80 -1\nDe 0 0 8 0 0\nPo 0 56172 40748 56172 38778 80 -1\nDe 0 0 8 0 0\nPo 0 60242 43296 56838 43296 80 -1\nDe 15 0 8 0 0\nPo 0 60461 43077 60242 43296 80 -1\nDe 15 0 8 0 0\nPo 0 56838 43296 55841 42299 80 -1\nDe 15 0 8 0 0\nPo 0 56172 38778 56350 38600 80 -1\nDe 0 0 8 0 0\nPo 0 55841 41079 56000 40920 80 -1\nDe 15 0 8 0 0\nPo 3 56680 38600 56680 38600 310 160\nDe 15 1 8 0 0\nPo 0 56680 38600 59500 35780 80 -1\nDe 15 0 8 0 0\nPo 0 59500 35780 59500 34500 80 -1\nDe 15 0 8 0 0\nPo 0 64487 41958 64487 41683 80 -1\nDe 15 0 9 0 400000\nPo 0 60850 33500 60500 33850 80 -1\nDe 15 0 9 0 0\nPo 0 60500 34500 60000 35000 80 -1\nDe 15 0 9 0 800000\nPo 0 63650 33500 60850 33500 80 -1\nDe 15 0 9 0 0\nPo 0 64487 41683 65709 40461 80 -1\nDe 15 0 9 0 0\nPo 0 64100 33950 63650 33500 80 -1\nDe 15 0 9 0 0\nPo 0 64646 37386 64100 36840 80 -1\nDe 15 0 9 0 0\nPo 0 65709 37386 64646 37386 80 -1\nDe 15 0 9 0 400000\nPo 0 60500 33850 60500 34500 80 -1\nDe 15 0 9 0 0\nPo 0 65709 40461 65709 37386 80 -1\nDe 15 0 9 0 800000\nPo 0 64100 36840 64100 33950 80 -1\nDe 15 0 9 0 0\nPo 0 65709 37386 69291 37386 80 -1\nDe 15 0 9 0 C00000\nPo 0 67150 41200 67150 38280 80 -1\nDe 15 0 10 0 0\nPo 0 64370 34270 63600 33500 80 -1\nDe 0 0 10 0 0\nPo 0 63600 33500 59500 33500 80 -1\nDe 0 0 10 0 0\nPo 0 67150 38280 64370 35500 80 -1\nDe 0 0 10 0 0\nPo 0 66037 42313 67150 41200 80 -1\nDe 15 0 10 0 0\nPo 3 67150 38280 67150 38280 310 160\nDe 15 1 10 0 0\nPo 0 64842 42313 66037 42313 80 -1\nDe 15 0 10 0 400000\nPo 0 64370 35500 64370 34270 80 -1\nDe 0 0 10 0 0\nPo 0 59500 33500 59000 34000 80 -1\nDe 0 0 10 0 800000\nPo 0 67312 38688 67440 38560 80 -1\nDe 15 0 11 0 0\nPo 0 67440 38560 67440 38080 80 -1\nDe 0 0 11 0 0\nPo 0 65146 42509 65180 42475 80 -1\nDe 15 0 11 0 0\nPo 0 63668 33338 58902 33338 80 -1\nDe 0 0 11 0 0\nPo 0 67360 38000 67100 38000 80 -1\nDe 0 0 11 0 0\nPo 0 64842 42509 65146 42509 80 -1\nDe 15 0 11 0 400000\nPo 0 67440 38080 67360 38000 80 -1\nDe 0 0 11 0 0\nPo 0 58500 33740 58500 34500 80 -1\nDe 0 0 11 0 0\nPo 0 65180 42475 66105 42475 80 -1\nDe 15 0 11 0 0\nPo 0 67312 41268 67312 38688 80 -1\nDe 15 0 11 0 0\nPo 0 66105 42475 67312 41268 80 -1\nDe 15 0 11 0 0\nPo 0 67100 38000 64532 35432 80 -1\nDe 0 0 11 0 0\nPo 0 64532 34202 63668 33338 80 -1\nDe 0 0 11 0 0\nPo 0 58500 34500 59000 35000 80 -1\nDe 0 0 11 0 800000\nPo 0 58902 33338 58500 33740 80 -1\nDe 0 0 11 0 0\nPo 3 67440 38560 67440 38560 310 160\nDe 15 1 11 0 0\nPo 0 64532 35432 64532 34202 80 -1\nDe 0 0 11 0 0\nPo 0 58824 33176 58000 34000 80 -1\nDe 0 0 12 0 800000\nPo 0 64694 34134 63736 33176 80 -1\nDe 0 0 12 0 0\nPo 0 63736 33176 58824 33176 80 -1\nDe 0 0 12 0 0\nPo 0 67740 38150 67428 37838 80 -1\nDe 0 0 12 0 0\nPo 0 65174 42706 65243 42637 80 -1\nDe 15 0 12 0 0\nPo 3 67600 38920 67600 38920 310 160\nDe 15 1 12 0 0\nPo 0 67474 39046 67600 38920 80 -1\nDe 15 0 12 0 0\nPo 0 67740 38780 67740 38150 80 -1\nDe 0 0 12 0 0\nPo 0 64694 35364 64694 34134 80 -1\nDe 0 0 12 0 0\nPo 0 65243 42637 66173 42637 80 -1\nDe 15 0 12 0 0\nPo 0 67474 41336 67474 39046 80 -1\nDe 15 0 12 0 0\nPo 0 67600 38920 67740 38780 80 -1\nDe 0 0 12 0 0\nPo 0 66173 42637 67474 41336 80 -1\nDe 15 0 12 0 0\nPo 0 64842 42706 65174 42706 80 -1\nDe 15 0 12 0 400000\nPo 0 67168 37838 64694 35364 80 -1\nDe 0 0 12 0 0\nPo 0 67428 37838 67168 37838 80 -1\nDe 0 0 12 0 0\nPo 0 57500 34500 58000 35000 80 -1\nDe 0 0 13 0 800000\nPo 3 67760 39280 67760 39280 310 160\nDe 15 1 13 0 0\nPo 0 67236 37676 64856 35296 80 -1\nDe 0 0 13 0 0\nPo 0 67902 39138 67902 38082 80 -1\nDe 0 0 13 0 0\nPo 0 67636 39404 67760 39280 80 -1\nDe 15 0 13 0 0\nPo 0 64856 35296 64856 34066 80 -1\nDe 0 0 13 0 0\nPo 0 66241 42799 67636 41404 80 -1\nDe 15 0 13 0 0\nPo 0 63804 33014 58156 33014 80 -1\nDe 0 0 13 0 0\nPo 0 65207 42903 65311 42799 80 -1\nDe 15 0 13 0 0\nPo 0 67636 41404 67636 39404 80 -1\nDe 15 0 13 0 0\nPo 0 64842 42903 65207 42903 80 -1\nDe 15 0 13 0 400000\nPo 0 67902 38082 67496 37676 80 -1\nDe 0 0 13 0 0\nPo 0 58156 33014 57500 33670 80 -1\nDe 0 0 13 0 0\nPo 0 67496 37676 67236 37676 80 -1\nDe 0 0 13 0 0\nPo 0 67760 39280 67902 39138 80 -1\nDe 0 0 13 0 0\nPo 0 65311 42799 66241 42799 80 -1\nDe 15 0 13 0 0\nPo 0 57500 33670 57500 34500 80 -1\nDe 0 0 13 0 0\nPo 0 64856 34066 63804 33014 80 -1\nDe 0 0 13 0 0\nPo 0 66309 42961 67798 41472 80 -1\nDe 15 0 14 0 0\nPo 0 65240 43100 65379 42961 80 -1\nDe 15 0 14 0 0\nPo 0 65018 35228 65018 33998 80 -1\nDe 0 0 14 0 0\nPo 0 67798 39762 67920 39640 80 -1\nDe 15 0 14 0 0\nPo 0 68064 39496 68064 38014 80 -1\nDe 0 0 14 0 0\nPo 0 57000 33940 57000 34000 80 -1\nDe 0 0 14 0 800000\nPo 0 67564 37514 67304 37514 80 -1\nDe 0 0 14 0 0\nPo 0 65379 42961 66309 42961 80 -1\nDe 15 0 14 0 0\nPo 0 65018 33998 63872 32852 80 -1\nDe 0 0 14 0 0\nPo 3 67920 39640 67920 39640 310 160\nDe 15 1 14 0 0\nPo 0 63872 32852 58088 32852 80 -1\nDe 0 0 14 0 0\nPo 0 67920 39640 68064 39496 80 -1\nDe 0 0 14 0 0\nPo 0 68064 38014 67564 37514 80 -1\nDe 0 0 14 0 0\nPo 0 58088 32852 57000 33940 80 -1\nDe 0 0 14 0 0\nPo 0 67304 37514 65018 35228 80 -1\nDe 0 0 14 0 0\nPo 0 64842 43100 65240 43100 80 -1\nDe 15 0 14 0 400000\nPo 0 67798 41472 67798 39762 80 -1\nDe 15 0 14 0 0\nPo 0 55670 40650 55700 40620 80 -1\nDe 15 0 15 0 0\nPo 0 60310 43458 60529 43239 80 -1\nDe 15 0 15 0 0\nPo 0 57000 37720 57000 35000 80 -1\nDe 15 0 15 0 800000\nPo 0 55670 42358 55670 40650 80 -1\nDe 15 0 15 0 0\nPo 3 56440 38280 56440 38280 310 160\nDe 15 1 15 0 0\nPo 0 62010 43239 60529 43239 80 -1\nDe 15 0 15 0 0\nPo 0 56010 38710 56440 38280 80 -1\nDe 0 0 15 0 0\nPo 0 55700 40620 56010 40310 80 -1\nDe 0 0 15 0 0\nPo 0 56440 38280 57000 37720 80 -1\nDe 15 0 15 0 0\nPo 3 55700 40620 55700 40620 310 160\nDe 15 1 15 0 0\nPo 0 62558 43100 62149 43100 80 -1\nDe 15 0 15 0 400000\nPo 0 62149 43100 62010 43239 80 -1\nDe 15 0 15 0 0\nPo 0 56770 43458 60310 43458 80 -1\nDe 15 0 15 0 0\nPo 0 56010 40310 56010 38710 80 -1\nDe 0 0 15 0 0\nPo 0 55670 42358 56770 43458 80 -1\nDe 15 0 15 0 0\nPo 0 60735 43725 62225 43725 80 -1\nDe 15 0 16 0 0\nPo 0 58926 43944 58300 44570 80 -1\nDe 15 0 16 0 0\nPo 0 55410 40740 55410 40500 80 -1\nDe 0 0 16 0 0\nPo 0 55808 38382 55808 35488 80 -1\nDe 15 0 16 0 0\nPo 0 55848 38598 55720 38470 80 -1\nDe 0 0 16 0 0\nPo 0 58300 44570 58300 45000 80 -1\nDe 15 0 16 0 800000\nPo 0 58926 43944 60516 43944 80 -1\nDe 15 0 16 0 0\nPo 0 55720 38470 55808 38382 80 -1\nDe 15 0 16 0 0\nPo 0 55500 35180 55500 34500 80 -1\nDe 15 0 16 0 0\nPo 0 56000 34000 55500 34500 80 -1\nDe 15 0 16 0 400000\nPo 0 58140 44410 58140 43470 80 -1\nDe 0 0 16 0 0\nPo 0 62259 43691 62558 43691 80 -1\nDe 15 0 16 0 800000\nPo 0 55410 40500 55848 40062 80 -1\nDe 0 0 16 0 0\nPo 0 62225 43725 62259 43691 80 -1\nDe 15 0 16 0 0\nPo 0 58140 43470 55410 40740 80 -1\nDe 0 0 16 0 0\nPo 0 55808 35488 55500 35180 80 -1\nDe 15 0 16 0 0\nPo 0 60516 43944 60735 43725 80 -1\nDe 15 0 16 0 0\nPo 0 58140 44410 58300 44570 80 -1\nDe 0 0 16 0 0\nPo 0 55848 40062 55848 38598 80 -1\nDe 0 0 16 0 0\nPo 3 55720 38470 55720 38470 310 160\nDe 15 1 16 0 0\nPo 3 58300 44570 58300 44570 310 160\nDe 15 1 16 0 0\nPo 0 56334 41434 56334 39066 80 -1\nDe 0 0 17 0 0\nPo 0 56460 38940 56000 38480 80 -1\nDe 15 0 17 0 0\nPo 0 58810 44720 58810 45490 80 -1\nDe 15 0 17 0 0\nPo 0 58302 44152 58302 43402 80 -1\nDe 0 0 17 0 0\nPo 0 60803 43887 60584 44106 80 -1\nDe 15 0 17 0 0\nPo 0 58810 44660 58302 44152 80 -1\nDe 0 0 17 0 0\nPo 0 59424 44106 59215 44315 80 -1\nDe 15 0 17 0 0\nPo 0 60584 44106 59424 44106 80 -1\nDe 15 0 17 0 0\nPo 0 58810 45490 58300 46000 80 -1\nDe 15 0 17 0 800000\nPo 0 56000 38480 56000 35000 80 -1\nDe 15 0 17 0 800000\nPo 0 58810 44720 58810 44660 80 -1\nDe 0 0 17 0 0\nPo 3 58810 44720 58810 44720 310 160\nDe 15 1 17 0 0\nPo 0 59215 44315 58810 44720 80 -1\nDe 15 0 17 0 0\nPo 3 56460 38940 56460 38940 310 160\nDe 15 1 17 0 0\nPo 0 62558 43887 60803 43887 80 -1\nDe 15 0 17 0 400000\nPo 0 56334 39066 56460 38940 80 -1\nDe 0 0 17 0 0\nPo 0 58302 43402 56334 41434 80 -1\nDe 0 0 17 0 0\nPo 0 50500 42800 49662 41962 80 -1\nDe 0 0 18 0 0\nPo 3 57640 32880 57640 32880 310 160\nDe 15 1 18 0 0\nPo 0 51000 44000 50500 43500 80 -1\nDe 0 0 18 0 400000\nPo 0 48542 37582 49662 38702 80 -1\nDe 0 0 18 0 0\nPo 0 50500 43500 50500 42800 80 -1\nDe 0 0 18 0 0\nPo 0 51807 31499 51270 30962 80 -1\nDe 15 0 18 0 0\nPo 0 51807 31499 51807 31500 80 -1\nDe 15 0 18 0 800000\nPo 0 67632 37352 67372 37352 80 -1\nDe 0 0 18 0 0\nPo 0 49662 38702 49662 41962 80 -1\nDe 0 0 18 0 0\nPo 0 65105 43297 64842 43297 80 -1\nDe 15 0 18 0 800000\nPo 0 51000 44000 51000 45200 80 -1\nDe 15 0 18 0 C00000\nPo 0 67960 40120 68080 40000 80 -1\nDe 15 0 18 0 0\nPo 0 66377 43123 67960 41540 80 -1\nDe 15 0 18 0 0\nPo 0 63940 32690 57830 32690 80 -1\nDe 0 0 18 0 0\nPo 0 65308 43262 65447 43123 80 -1\nDe 15 0 18 0 0\nPo 0 65140 43262 65308 43262 80 -1\nDe 15 0 18 0 0\nPo 0 65105 43297 65140 43262 80 -1\nDe 15 0 18 0 0\nPo 0 67960 41540 67960 40120 80 -1\nDe 15 0 18 0 0\nPo 0 57830 32690 57640 32880 80 -1\nDe 0 0 18 0 0\nPo 0 47900 31430 47900 36560 80 -1\nDe 15 0 18 0 0\nPo 0 51270 30962 48368 30962 80 -1\nDe 15 0 18 0 0\nPo 0 48480 37140 48542 37202 80 -1\nDe 0 0 18 0 0\nPo 0 68226 39854 68226 37946 80 -1\nDe 0 0 18 0 0\nPo 3 48480 37140 48480 37140 310 160\nDe 15 1 18 0 0\nPo 0 47900 36560 48480 37140 80 -1\nDe 15 0 18 0 0\nPo 0 67372 37352 65180 35160 80 -1\nDe 0 0 18 0 0\nPo 3 68080 40000 68080 40000 310 160\nDe 15 1 18 0 0\nPo 0 68226 37946 67632 37352 80 -1\nDe 0 0 18 0 0\nPo 0 48368 30962 47900 31430 80 -1\nDe 15 0 18 0 0\nPo 0 48542 37202 48542 37582 80 -1\nDe 0 0 18 0 0\nPo 0 68080 40000 68226 39854 80 -1\nDe 0 0 18 0 0\nPo 0 65180 33930 63940 32690 80 -1\nDe 0 0 18 0 0\nPo 0 65447 43123 66377 43123 80 -1\nDe 15 0 18 0 0\nPo 0 51807 31500 53367 33060 80 -1\nDe 15 0 18 0 400000\nPo 0 65180 35160 65180 33930 80 -1\nDe 0 0 18 0 0\nPo 0 57460 33060 53367 33060 80 -1\nDe 15 0 18 0 0\nPo 0 57640 32880 57460 33060 80 -1\nDe 15 0 18 0 0\nPo 0 53050 37210 52610 37650 200 -1\nDe 15 0 19 0 0\nPo 0 53050 37100 53600 37650 200 -1\nDe 15 0 19 0 C00000\nPo 0 53050 37210 53050 37100 200 -1\nDe 15 0 19 0 800000\nPo 0 50210 37650 48500 39360 500 -1\nDe 15 0 19 0 0\nPo 0 48372 39488 48500 39360 80 -1\nDe 15 0 19 0 0\nPo 0 48500 39360 48490 39360 200 -1\nDe 15 0 19 0 0\nPo 0 47781 39488 48372 39488 80 -1\nDe 15 0 19 0 400000\nPo 0 52610 37650 50210 37650 500 -1\nDe 15 0 19 0 0\nPo 0 60200 40550 60200 40300 200 -1\nDe 15 0 20 0 0\nPo 3 64340 41430 64340 41430 310 160\nDe 15 1 20 0 0\nPo 3 53050 38350 53050 38350 420 250\nDe 15 1 20 0 0\nPo 0 61690 44350 61260 44780 200 -1\nDe 0 0 20 0 0\nPo 0 65300 34000 65750 34000 200 -1\nDe 15 0 20 0 400000\nPo 0 65500 44250 65330 44080 200 -1\nDe 15 0 20 0 0\nPo 0 62690 44350 62850 44350 80 -1\nDe 15 0 20 0 0\nPo 0 61926 42706 61920 42700 80 -1\nDe 15 0 20 0 0\nPo 0 64291 44242 64291 44451 80 -1\nDe 15 0 20 0 400000\nPo 0 66000 43000 67500 43000 200 -1\nDe 0 0 20 0 0\nPo 0 53050 38900 53050 38350 200 -1\nDe 15 0 20 0 400000\nPo 0 62558 42706 61926 42706 80 -1\nDe 15 0 20 0 400000\nPo 0 60200 40300 59800 39900 200 -1\nDe 0 0 20 0 0\nPo 3 65500 41600 65500 41600 420 250\nDe 15 1 20 0 0\nPo 0 64291 44451 64460 44620 80 -1\nDe 15 0 20 0 0\nPo 0 61450 42230 61920 42700 200 -1\nDe 0 0 20 0 0\nPo 0 64460 44620 64660 44620 80 -1\nDe 15 0 20 0 0\nPo 0 64800 44760 64660 44620 200 -1\nDe 15 0 20 0 0\nPo 0 60350 44590 59730 44590 200 -1\nDe 0 0 20 0 0\nPo 0 65840 44250 65500 44250 200 -1\nDe 15 0 20 0 400000\nPo 0 64660 44620 64790 44620 200 -1\nDe 0 0 20 0 0\nPo 0 53100 38400 53100 40500 200 -1\nDe 0 0 20 0 0\nPo 0 62280 44350 62690 44350 200 -1\nDe 15 0 20 0 0\nPo 0 65170 43920 65170 43800 200 -1\nDe 15 0 20 0 0\nPo 3 59800 38550 59800 38550 420 250\nDe 15 1 20 0 0\nPo 3 64660 44620 64660 44620 310 160\nDe 15 1 20 0 0\nPo 3 59730 44590 59730 44590 420 250\nDe 15 1 20 0 0\nPo 0 64291 41479 64340 41430 80 -1\nDe 15 0 20 0 0\nPo 0 64340 41430 65330 41430 200 -1\nDe 0 0 20 0 0\nPo 0 62913 44242 62913 44287 80 -1\nDe 15 0 20 0 400000\nPo 0 64400 44880 64660 44620 200 -1\nDe 0 0 20 0 0\nPo 0 63250 44940 62870 44940 200 -1\nDe 0 0 20 0 0\nPo 0 61920 42700 61560 42700 200 -1\nDe 15 0 20 0 800000\nPo 3 61450 41800 61450 41800 420 250\nDe 15 1 20 0 0\nPo 0 63250 44940 63250 44854 200 -1\nDe 15 0 20 0 0\nPo 0 63503 44601 63347 44757 80 -1\nDe 15 0 20 0 0\nPo 0 65330 41430 65500 41600 200 -1\nDe 0 0 20 0 0\nPo 0 62850 44350 62913 44287 80 -1\nDe 15 0 20 0 0\nPo 0 59800 38550 59800 39900 200 -1\nDe 0 0 20 0 0\nPo 0 65083 43887 65170 43800 80 -1\nDe 15 0 20 0 0\nPo 0 61450 41800 61450 42230 200 -1\nDe 0 0 20 0 0\nPo 3 65750 34000 65750 34000 420 250\nDe 15 1 20 0 0\nPo 0 63250 44854 63347 44757 200 -1\nDe 15 0 20 0 0\nPo 0 65170 43920 65330 44080 200 -1\nDe 15 0 20 0 0\nPo 0 62280 44350 61760 44350 200 -1\nDe 15 0 20 0 800000\nPo 3 63250 44940 63250 44940 310 160\nDe 15 1 20 0 0\nPo 0 53050 38900 53600 38350 200 -1\nDe 15 0 20 0 C00000\nPo 3 65330 44080 65330 44080 310 160\nDe 15 1 20 0 0\nPo 0 50800 41500 51250 41500 200 -1\nDe 15 0 20 0 400000\nPo 0 63250 44940 63250 45240 200 -1\nDe 15 0 20 0 800000\nPo 3 60200 40300 60200 40300 420 250\nDe 15 1 20 0 0\nPo 0 64400 44900 64400 44880 200 -1\nDe 0 0 20 0 0\nPo 0 64842 43691 65061 43691 80 -1\nDe 15 0 20 0 400000\nPo 3 53100 40500 53100 40500 420 250\nDe 15 1 20 0 0\nPo 3 64400 44900 64400 44900 310 160\nDe 15 1 20 0 0\nPo 3 51250 41500 51250 41500 420 250\nDe 15 1 20 0 0\nPo 0 61260 44780 60540 44780 200 -1\nDe 0 0 20 0 0\nPo 0 65330 44080 65330 43670 200 -1\nDe 0 0 20 0 0\nPo 0 64350 41420 64340 41430 200 -1\nDe 15 0 20 0 0\nPo 0 65330 43670 66000 43000 200 -1\nDe 0 0 20 0 0\nPo 0 64842 43887 65083 43887 80 -1\nDe 15 0 20 0 400000\nPo 0 65061 43691 65170 43800 80 -1\nDe 15 0 20 0 0\nPo 0 63503 44242 63503 44601 80 -1\nDe 15 0 20 0 400000\nPo 0 62280 44350 61690 44350 200 -1\nDe 0 0 20 0 0\nPo 0 62870 44940 62280 44350 200 -1\nDe 0 0 20 0 0\nPo 0 60540 44780 60350 44590 200 -1\nDe 0 0 20 0 0\nPo 0 64094 44614 64160 44680 80 -1\nDe 15 0 20 0 0\nPo 3 67500 43000 67500 43000 420 250\nDe 15 1 20 0 0\nPo 0 64400 44900 64380 44900 200 -1\nDe 15 0 20 0 0\nPo 0 64291 41479 64291 41958 80 -1\nDe 15 0 20 0 800000\nPo 0 64380 44900 64160 44680 200 -1\nDe 15 0 20 0 0\nPo 0 64400 44900 64400 45190 200 -1\nDe 15 0 20 0 800000\nPo 0 53050 38350 53100 38400 200 -1\nDe 0 0 20 0 0\nPo 0 61450 41800 60200 40550 200 -1\nDe 15 0 20 0 0\nPo 0 64790 44620 65330 44080 200 -1\nDe 0 0 20 0 0\nPo 0 64094 44242 64094 44614 80 -1\nDe 15 0 20 0 400000\nPo 3 62280 44350 62280 44350 310 160\nDe 15 1 20 0 0\nPo 0 64800 44760 64800 45190 200 -1\nDe 15 0 20 0 800000\nPo 3 61920 42700 61920 42700 310 160\nDe 15 1 20 0 0\nPo 0 64350 41060 64350 41420 200 -1\nDe 15 0 20 0 400000\nPo 0 63125 42525 64275 42525 1000 -1\nDe 0 0 21 0 C00000\nPo 0 64400 45610 64400 45780 200 -1\nDe 15 0 21 0 400000\nPo 3 65280 45860 65280 45860 310 160\nDe 15 1 21 0 0\nPo 0 55760 45000 55750 44990 200 -1\nDe 15 0 21 0 0\nPo 0 65200 45780 65280 45860 200 -1\nDe 15 0 21 0 0\nPo 0 65200 45610 65200 45780 200 -1\nDe 15 0 21 0 400000\nPo 3 64480 45860 64480 45860 310 160\nDe 15 1 21 0 0\nPo 0 64800 45780 64880 45860 200 -1\nDe 15 0 21 0 0\nPo 0 59200 42900 59650 42900 200 -1\nDe 15 0 21 0 400000\nPo 0 64800 45610 64800 45780 200 -1\nDe 15 0 21 0 400000\nPo 3 64880 45860 64880 45860 310 160\nDe 15 1 21 0 0\nPo 0 65709 35614 65709 35041 200 -1\nDe 15 0 21 0 400000\nPo 0 63125 42525 64275 43675 500 -1\nDe 0 0 21 0 C00000\nPo 0 64275 42525 64275 43675 1000 -1\nDe 0 0 21 0 C00000\nPo 3 64350 40190 64350 40190 420 250\nDe 15 1 21 0 0\nPo 0 65100 47310 64900 47310 200 -1\nDe 15 0 21 0 400000\nPo 0 56200 46000 55750 46000 200 -1\nDe 15 0 21 0 400000\nPo 0 54400 38000 54850 38000 200 -1\nDe 15 0 21 0 400000\nPo 3 66560 44250 66560 44250 310 160\nDe 15 1 21 0 0\nPo 3 65000 39750 65000 39750 420 250\nDe 15 1 21 0 0\nPo 3 60150 44990 60150 44990 310 160\nDe 15 1 21 0 0\nPo 0 48420 40510 50290 40510 500 -1\nDe 15 0 21 0 0\nPo 0 61340 44350 60940 44350 200 -1\nDe 15 0 21 0 400000\nPo 0 69291 35614 69291 35049 200 -1\nDe 15 0 21 0 400000\nPo 0 66559 51937 66559 47509 200 -1\nDe 15 0 21 0 400000\nPo 3 59650 41100 59650 41100 420 250\nDe 15 1 21 0 0\nPo 0 56200 45000 55760 45000 200 -1\nDe 15 0 21 0 400000\nPo 0 48418 40512 48420 40510 80 -1\nDe 15 0 21 0 0\nPo 3 65210 46300 65210 46300 310 160\nDe 15 1 21 0 0\nPo 0 64910 46300 65210 46300 200 -1\nDe 15 0 21 0 400000\nPo 0 65193 31500 65200 31500 200 -1\nDe 15 0 21 0 400000\nPo 3 62850 45960 62850 45960 310 160\nDe 15 1 21 0 0\nPo 0 63250 45660 63250 45960 200 -1\nDe 15 0 21 0 400000\nPo 0 64275 43675 63125 43675 1000 -1\nDe 0 0 21 0 C00000\nPo 0 65200 31500 65900 32200 200 -1\nDe 15 0 21 0 0\nPo 0 69291 35049 69300 35040 200 -1\nDe 15 0 21 0 0\nPo 3 50300 40500 50300 40500 420 250\nDe 15 1 21 0 0\nPo 3 54850 38000 54850 38000 420 250\nDe 15 1 21 0 0\nPo 3 60690 42710 60690 42710 420 250\nDe 15 1 21 0 0\nPo 3 65900 32200 65900 32200 420 250\nDe 15 1 21 0 0\nPo 3 60940 44350 60940 44350 420 250\nDe 15 1 21 0 0\nPo 0 64400 45780 64480 45860 200 -1\nDe 15 0 21 0 0\nPo 3 64800 47410 64800 47410 310 160\nDe 15 1 21 0 0\nPo 0 65000 39300 65000 39750 200 -1\nDe 15 0 21 0 400000\nPo 0 66260 44250 66560 44250 80 -1\nDe 15 0 21 0 400000\nPo 0 60150 45290 60150 44990 200 -1\nDe 15 0 21 0 400000\nPo 0 60700 42700 60690 42710 200 -1\nDe 15 0 21 0 0\nPo 3 69300 35040 69300 35040 420 250\nDe 15 1 21 0 0\nPo 0 63125 43675 64275 42525 500 -1\nDe 0 0 21 0 C00000\nPo 3 55750 46000 55750 46000 420 250\nDe 15 1 21 0 0\nPo 3 65710 35040 65710 35040 420 250\nDe 15 1 21 0 0\nPo 0 50290 40510 50300 40500 500 -1\nDe 15 0 21 0 0\nPo 3 55750 44990 55750 44990 420 250\nDe 15 1 21 0 0\nPo 0 63125 43675 63125 42525 1000 -1\nDe 0 0 21 0 C00000\nPo 0 65709 35041 65710 35040 200 -1\nDe 15 0 21 0 0\nPo 3 59650 42900 59650 42900 420 250\nDe 15 1 21 0 0\nPo 3 52000 38900 52000 38900 420 250\nDe 15 1 21 0 0\nPo 0 66550 43750 67000 43750 200 -1\nDe 15 0 21 0 400000\nPo 0 52450 38900 52000 38900 200 -1\nDe 15 0 21 0 400000\nPo 3 67000 43750 67000 43750 420 250\nDe 15 1 21 0 0\nPo 0 47781 40512 48418 40512 80 -1\nDe 15 0 21 0 400000\nPo 0 61140 42700 60700 42700 200 -1\nDe 15 0 21 0 400000\nPo 0 64900 47310 64800 47410 200 -1\nDe 15 0 21 0 0\nPo 3 52450 36650 52450 36650 420 250\nDe 15 1 21 0 0\nPo 3 48420 40510 48420 40510 420 250\nDe 15 1 21 0 0\nPo 0 52450 37100 52450 36650 200 -1\nDe 15 0 21 0 400000\nPo 0 59200 41100 59650 41100 200 -1\nDe 15 0 21 0 400000\nPo 0 62850 45660 62850 45960 200 -1\nDe 15 0 21 0 400000\nPo 0 66559 47509 66250 47200 200 -1\nDe 15 0 21 0 800000\nPo 3 63250 45960 63250 45960 310 160\nDe 15 1 21 0 0\nPo 0 64350 40640 64350 40190 200 -1\nDe 15 0 21 0 400000\nPo 0 61846 31500 62200 31500 80 -1\nDe 15 0 22 0 400000\nPo 0 62200 31500 64700 34000 80 -1\nDe 15 0 22 0 800000\nPo 0 64600 46800 65450 46800 500 -1\nDe 15 0 23 0 400000\nPo 0 66050 46200 67250 46200 500 -1\nDe 15 0 23 0 800000\nPo 0 65450 46800 66050 46200 500 -1\nDe 15 0 23 0 0\nPo 0 64690 46890 64600 46800 80 -1\nDe 15 0 23 0 800000\nPo 0 65100 46890 64690 46890 80 -1\nDe 15 0 23 0 400000\nPo 0 57700 45000 56800 45000 80 -1\nDe 15 0 24 0 C00000\nPo 0 56800 46000 57700 46000 80 -1\nDe 15 0 25 0 C00000\nPo 0 63605 45575 63605 44915 200 -1\nDe 15 0 26 0 0\nPo 0 63605 45740 63605 45575 80 -1\nDe 15 0 26 0 400000\nPo 0 63700 44820 63605 44915 80 -1\nDe 15 0 26 0 0\nPo 0 63700 44242 63700 44820 80 -1\nDe 15 0 26 0 400000\nPo 0 63995 45575 63995 44925 200 -1\nDe 15 0 27 0 0\nPo 0 63897 44242 63897 44827 80 -1\nDe 15 0 27 0 400000\nPo 0 63897 44827 63995 44925 80 -1\nDe 15 0 27 0 0\nPo 0 63995 45740 63995 45575 80 -1\nDe 15 0 27 0 400000\nPo 0 64140 46000 64160 46020 80 -1\nDe 15 0 28 0 0\nPo 0 64440 46300 64490 46300 200 -1\nDe 15 0 28 0 800000\nPo 0 63995 46000 64140 46000 80 -1\nDe 15 0 28 0 400000\nPo 0 64440 46300 64160 46020 200 -1\nDe 15 0 28 0 0\nPo 0 64000 47400 64000 51937 500 -1\nDe 15 0 29 0 C00000\nPo 0 64000 46265 63995 46260 80 -1\nDe 15 0 30 0 800000\nPo 0 64000 46800 64000 46550 500 -1\nDe 15 0 30 0 400000\nPo 0 64000 46550 64000 46265 80 -1\nDe 15 0 30 0 0\nPo 0 64842 43494 65204 43494 80 -1\nDe 15 0 31 0 400000\nPo 0 65280 43500 65210 43500 200 -1\nDe 15 0 31 0 0\nPo 0 65530 43750 65280 43500 200 -1\nDe 15 0 31 0 0\nPo 0 65530 43750 65950 43750 200 -1\nDe 15 0 31 0 800000\nPo 0 65204 43494 65210 43500 80 -1\nDe 15 0 31 0 0\nPo 0 63897 41958 63897 41639 80 -1\nDe 15 0 32 0 400000\nPo 0 61620 39800 61150 39800 80 -1\nDe 15 0 32 0 800000\nPo 0 62060 40240 61620 39800 80 -1\nDe 15 0 32 0 0\nPo 3 62060 40240 62060 40240 310 160\nDe 15 1 32 0 0\nPo 0 63260 40240 62060 40240 80 -1\nDe 0 0 32 0 0\nPo 0 63280 40260 63260 40240 80 -1\nDe 0 0 32 0 0\nPo 3 63280 40260 63280 40260 310 160\nDe 15 1 32 0 0\nPo 0 63280 40430 63280 40260 80 -1\nDe 15 0 32 0 0\nPo 0 63838 40988 63280 40430 80 -1\nDe 15 0 32 0 0\nPo 0 63838 41580 63838 40988 80 -1\nDe 15 0 32 0 0\nPo 0 63897 41639 63838 41580 80 -1\nDe 15 0 32 0 0\nPo 0 57950 41100 57950 40700 80 -1\nDe 15 0 33 0 400000\nPo 0 58900 39750 59800 39750 80 -1\nDe 15 0 33 0 800000\nPo 0 57950 40700 58900 39750 80 -1\nDe 15 0 33 0 0\nPo 0 59850 39800 59800 39750 80 -1\nDe 15 0 33 0 800000\nPo 0 60550 39800 59850 39800 80 -1\nDe 15 0 33 0 400000\nPo 0 64000 38700 65000 38700 80 -1\nDe 15 0 34 0 C00000\nPo 0 49000 42260 49760 41500 200 -1\nDe 15 0 35 0 0\nPo 0 49000 43000 49000 42260 200 -1\nDe 15 0 35 0 400000\nPo 0 49760 41500 50200 41500 200 -1\nDe 15 0 35 0 800000\nPo 0 47781 39744 56644 39744 80 -1\nDe 15 0 36 0 400000\nPo 0 57650 40750 57650 42300 80 -1\nDe 15 0 36 0 800000\nPo 0 56644 39744 57650 40750 80 -1\nDe 15 0 36 0 0\nPo 0 57950 41700 59200 41700 80 -1\nDe 15 0 37 0 C00000\nPo 0 62558 42313 62293 42313 80 -1\nDe 15 0 37 0 400000\nPo 0 59638 42138 59200 41700 80 -1\nDe 15 0 37 0 800000\nPo 0 62293 42313 62118 42138 80 -1\nDe 15 0 37 0 0\nPo 0 62118 42138 59638 42138 80 -1\nDe 15 0 37 0 0\nPo 0 48356 40000 48450 39906 80 -1\nDe 15 0 38 0 0\nPo 0 56576 39906 57350 40680 80 -1\nDe 15 0 38 0 0\nPo 0 47781 40000 48356 40000 80 -1\nDe 15 0 38 0 400000\nPo 0 57350 41100 57350 41700 80 -1\nDe 15 0 38 0 C00000\nPo 0 48450 39906 56576 39906 80 -1\nDe 15 0 38 0 0\nPo 0 57350 40680 57350 41100 80 -1\nDe 15 0 38 0 800000\nPo 0 62850 44940 62850 45240 80 -1\nDe 15 0 39 0 800000\nPo 0 62488 45240 62228 45500 80 -1\nDe 15 0 39 0 800000\nPo 0 62850 45240 62488 45240 80 -1\nDe 15 0 39 0 400000\nPo 0 63306 44242 63306 44484 80 -1\nDe 15 0 39 0 400000\nPo 0 63306 44484 62850 44940 80 -1\nDe 15 0 39 0 0\nPo 0 65200 44680 64790 44270 200 -1\nDe 15 0 40 0 0\nPo 0 64700 44270 64515 44270 80 -1\nDe 15 0 40 0 0\nPo 0 64790 44270 64700 44270 200 -1\nDe 15 0 40 0 0\nPo 0 65200 45190 65200 44680 200 -1\nDe 15 0 40 0 400000\nPo 0 64515 44270 64487 44242 80 -1\nDe 15 0 40 0 800000\nPo 0 60772 45368 60772 45500 80 -1\nDe 15 0 41 0 800000\nPo 0 63109 44451 62780 44780 80 -1\nDe 15 0 41 0 0\nPo 0 63109 44242 63109 44451 80 -1\nDe 15 0 41 0 400000\nPo 0 62780 44780 61360 44780 80 -1\nDe 15 0 41 0 0\nPo 0 60150 45710 60562 45710 80 -1\nDe 15 0 41 0 400000\nPo 0 61360 44780 60772 45368 80 -1\nDe 15 0 41 0 0\nPo 0 60562 45710 60772 45500 80 -1\nDe 15 0 41 0 800000\nPo 0 64000 39300 64000 41490 80 -1\nDe 15 0 42 0 400000\nPo 0 64094 41584 64094 41958 80 -1\nDe 15 0 42 0 800000\nPo 0 64000 41490 64094 41584 80 -1\nDe 15 0 42 0 0\nPo 0 58250 42300 59200 42300 80 -1\nDe 15 0 43 0 C00000\nPo 0 62558 42509 62259 42509 80 -1\nDe 15 0 43 0 400000\nPo 0 62050 42300 59200 42300 80 -1\nDe 15 0 43 0 800000\nPo 0 62259 42509 62050 42300 80 -1\nDe 15 0 43 0 0\n$EndTRACK\n$ZONE\n$EndZONE\n$CZONE_OUTLINE\nZInfo 504D73B4 21 \"GND\"\nZLayer 0\nZAux 4 E\nZClearance 200 T\nZMinThickness 100\nZOptions 0 16 F 120 200\nZSmoothing 0 0\nZCorner 70500 48000 0\nZCorner 70500 21500 0\nZCorner 46500 21500 0\nZCorner 46500 48000 1\n$POLYSCORNERS\n63771 43100 0 0\n63700 43171 0 0\n63629 43100 0 0\n63700 43029 0 0\n63771 43100 1 0\n70450 47950 0 0\n68911 47950 0 0\n68911 47307 0 0\n68911 45307 0 0\n68902 45046 0 0\n68820 44848 0 0\n68728 44793 0 0\n68657 44864 0 0\n68657 44722 0 0\n68602 44630 0 0\n68516 44598 0 0\n68516 39854 0 0\n68516 37946 0 0\n68494 37835 0 0\n68431 37741 0 0\n67837 37147 0 0\n67743 37084 0 0\n67632 37062 0 0\n67492 37062 0 0\n65470 35040 0 0\n65470 34370 0 0\n65489 34390 0 0\n65658 34460 0 0\n65841 34460 0 0\n66010 34390 0 0\n66140 34261 0 0\n66210 34092 0 0\n66210 33909 0 0\n66140 33740 0 0\n66011 33610 0 0\n65842 33540 0 0\n65659 33540 0 0\n65490 33610 0 0\n65380 33719 0 0\n64145 32485 0 0\n64051 32422 0 0\n63940 32400 0 0\n57830 32400 0 0\n57719 32422 0 0\n57687 32443 0 0\n57637 32476 0 0\n57560 32476 0 0\n57411 32537 0 0\n57298 32651 0 0\n57236 32799 0 0\n57236 32960 0 0\n57297 33109 0 0\n57359 33170 0 0\n57078 33451 0 0\n56891 33451 0 0\n56689 33535 0 0\n56535 33689 0 0\n56500 33773 0 0\n56465 33689 0 0\n56311 33535 0 0\n56109 33451 0 0\n55891 33451 0 0\n55689 33535 0 0\n55535 33689 0 0\n55451 33891 0 0\n55451 34109 0 0\n55535 34311 0 0\n55689 34465 0 0\n55773 34500 0 0\n55689 34535 0 0\n55535 34689 0 0\n55451 34891 0 0\n55451 35109 0 0\n55535 35311 0 0\n55689 35465 0 0\n55891 35549 0 0\n56109 35549 0 0\n56311 35465 0 0\n56465 35311 0 0\n56500 35226 0 0\n56535 35311 0 0\n56689 35465 0 0\n56891 35549 0 0\n57109 35549 0 0\n57311 35465 0 0\n57465 35311 0 0\n57500 35226 0 0\n57535 35311 0 0\n57689 35465 0 0\n57891 35549 0 0\n58109 35549 0 0\n58311 35465 0 0\n58465 35311 0 0\n58500 35226 0 0\n58535 35311 0 0\n58689 35465 0 0\n58891 35549 0 0\n59109 35549 0 0\n59311 35465 0 0\n59465 35311 0 0\n59500 35226 0 0\n59535 35311 0 0\n59689 35465 0 0\n59891 35549 0 0\n60109 35549 0 0\n60311 35465 0 0\n60465 35311 0 0\n60500 35226 0 0\n60535 35311 0 0\n60689 35465 0 0\n60891 35549 0 0\n61109 35549 0 0\n61311 35465 0 0\n61465 35311 0 0\n61500 35226 0 0\n61535 35311 0 0\n61689 35465 0 0\n61891 35549 0 0\n62109 35549 0 0\n62311 35465 0 0\n62465 35311 0 0\n62500 35226 0 0\n62535 35311 0 0\n62689 35465 0 0\n62891 35549 0 0\n63109 35549 0 0\n63311 35465 0 0\n63465 35311 0 0\n63549 35109 0 0\n63549 34891 0 0\n63465 34689 0 0\n63311 34535 0 0\n63154 34470 0 0\n63334 34470 0 0\n63396 34444 0 0\n63444 34396 0 0\n63470 34334 0 0\n63470 34266 0 0\n63470 34092 0 0\n63428 34050 0 0\n63100 34050 0 0\n63050 34050 0 0\n62950 34050 0 0\n62950 33950 0 0\n63050 33950 0 0\n63100 33950 0 0\n63428 33950 0 0\n63470 33908 0 0\n63470 33790 0 0\n63480 33790 0 0\n64080 34390 0 0\n64080 35500 0 0\n64102 35611 0 0\n64165 35705 0 0\n66746 38286 0 0\n66746 38360 0 0\n66807 38509 0 0\n66921 38622 0 0\n67050 38676 0 0\n67097 38789 0 0\n67196 38887 0 0\n67196 39000 0 0\n67257 39149 0 0\n67356 39247 0 0\n67356 39360 0 0\n67417 39509 0 0\n67516 39607 0 0\n67516 39720 0 0\n67577 39869 0 0\n67676 39967 0 0\n67676 40080 0 0\n67737 40229 0 0\n67851 40342 0 0\n67999 40404 0 0\n68160 40404 0 0\n68309 40343 0 0\n68422 40229 0 0\n68484 40081 0 0\n68484 39979 0 0\n68494 39965 0 0\n68516 39854 0 0\n68516 44598 0 0\n68357 44539 0 0\n68096 44548 0 0\n67960 44604 0 0\n67960 43092 0 0\n67960 42909 0 0\n67890 42740 0 0\n67761 42610 0 0\n67592 42540 0 0\n67409 42540 0 0\n67240 42610 0 0\n67199 42650 0 0\n66000 42650 0 0\n65960 42658 0 0\n65960 41692 0 0\n65960 41509 0 0\n65890 41340 0 0\n65761 41210 0 0\n65592 41140 0 0\n65513 41140 0 0\n65464 41107 0 0\n65330 41080 0 0\n64549 41080 0 0\n64421 41026 0 0\n64260 41026 0 0\n64111 41087 0 0\n63998 41201 0 0\n63936 41349 0 0\n63936 41510 0 0\n63997 41659 0 0\n64111 41772 0 0\n64259 41834 0 0\n64420 41834 0 0\n64551 41780 0 0\n65076 41780 0 0\n65110 41860 0 0\n65239 41990 0 0\n65408 42060 0 0\n65591 42060 0 0\n65760 41990 0 0\n65890 41861 0 0\n65960 41692 0 0\n65960 42658 0 0\n65866 42677 0 0\n65752 42753 0 0\n65083 43423 0 0\n65007 43536 0 0\n64980 43670 0 0\n64980 43870 0 0\n64933 43982 0 0\n64717 44198 0 0\n64717 43729 0 0\n64717 43154 0 0\n64717 42579 0 0\n64704 42406 0 0\n64662 42306 0 0\n64592 42278 0 0\n64522 42348 0 0\n64522 42208 0 0\n64494 42138 0 0\n64329 42083 0 0\n64156 42096 0 0\n64056 42138 0 0\n64028 42208 0 0\n64275 42454 0 0\n64522 42208 0 0\n64522 42348 0 0\n64346 42525 0 0\n64592 42772 0 0\n64662 42744 0 0\n64717 42579 0 0\n64717 43154 0 0\n64704 42981 0 0\n64662 42881 0 0\n64592 42853 0 0\n64346 43100 0 0\n64592 43347 0 0\n64662 43319 0 0\n64717 43154 0 0\n64717 43729 0 0\n64704 43556 0 0\n64662 43456 0 0\n64592 43428 0 0\n64522 43498 0 0\n64522 43417 0 0\n64492 43387 0 0\n64522 43358 0 0\n64494 43288 0 0\n64341 43237 0 0\n64310 43206 0 0\n64275 43171 0 0\n64204 43100 0 0\n64275 43029 0 0\n64310 42994 0 0\n64309 42993 0 0\n64346 42957 0 0\n64394 42954 0 0\n64494 42912 0 0\n64522 42842 0 0\n64492 42812 0 0\n64522 42783 0 0\n64494 42713 0 0\n64341 42662 0 0\n64310 42631 0 0\n64275 42596 0 0\n64204 42525 0 0\n64169 42490 0 0\n64132 42453 0 0\n64129 42406 0 0\n64087 42306 0 0\n64017 42278 0 0\n63987 42307 0 0\n63958 42278 0 0\n63947 42282 0 0\n63947 42208 0 0\n63919 42138 0 0\n63754 42083 0 0\n63684 42088 0 0\n63684 40341 0 0\n63684 40180 0 0\n63623 40031 0 0\n63509 39918 0 0\n63361 39856 0 0\n63200 39856 0 0\n63051 39917 0 0\n63018 39950 0 0\n62341 39950 0 0\n62289 39898 0 0\n62141 39836 0 0\n61980 39836 0 0\n61831 39897 0 0\n61718 40011 0 0\n61656 40159 0 0\n61656 40320 0 0\n61717 40469 0 0\n61831 40582 0 0\n61979 40644 0 0\n62140 40644 0 0\n62289 40583 0 0\n62341 40530 0 0\n62978 40530 0 0\n63051 40602 0 0\n63199 40664 0 0\n63360 40664 0 0\n63509 40603 0 0\n63622 40489 0 0\n63684 40341 0 0\n63684 42088 0 0\n63581 42096 0 0\n63481 42138 0 0\n63453 42208 0 0\n63700 42454 0 0\n63947 42208 0 0\n63947 42282 0 0\n63888 42306 0 0\n63837 42458 0 0\n63771 42525 0 0\n63700 42596 0 0\n63629 42525 0 0\n63594 42490 0 0\n63557 42453 0 0\n63554 42406 0 0\n63512 42306 0 0\n63442 42278 0 0\n63412 42307 0 0\n63383 42278 0 0\n63372 42282 0 0\n63372 42208 0 0\n63344 42138 0 0\n63179 42083 0 0\n63006 42096 0 0\n62906 42138 0 0\n62878 42208 0 0\n63125 42454 0 0\n63372 42208 0 0\n63372 42282 0 0\n63313 42306 0 0\n63262 42458 0 0\n63196 42525 0 0\n63125 42596 0 0\n63054 42666 0 0\n63054 42525 0 0\n62808 42278 0 0\n62738 42306 0 0\n62683 42471 0 0\n62696 42644 0 0\n62738 42744 0 0\n62808 42772 0 0\n63054 42525 0 0\n63054 42666 0 0\n63053 42667 0 0\n63006 42671 0 0\n62906 42713 0 0\n62878 42783 0 0\n62907 42812 0 0\n62878 42842 0 0\n62906 42912 0 0\n63058 42962 0 0\n63090 42994 0 0\n63125 43029 0 0\n63196 43100 0 0\n63125 43171 0 0\n63054 43241 0 0\n63054 43100 0 0\n62808 42853 0 0\n62738 42881 0 0\n62683 43046 0 0\n62696 43219 0 0\n62738 43319 0 0\n62808 43347 0 0\n63054 43100 0 0\n63054 43241 0 0\n63053 43242 0 0\n63006 43246 0 0\n62906 43288 0 0\n62878 43358 0 0\n62907 43387 0 0\n62878 43417 0 0\n62906 43487 0 0\n63058 43537 0 0\n63090 43569 0 0\n63125 43604 0 0\n63196 43675 0 0\n63231 43710 0 0\n63267 43746 0 0\n63271 43794 0 0\n63313 43894 0 0\n63383 43922 0 0\n63412 43892 0 0\n63442 43922 0 0\n63512 43894 0 0\n63562 43741 0 0\n63593 43709 0 0\n63594 43710 0 0\n63629 43675 0 0\n63700 43604 0 0\n63771 43675 0 0\n63806 43710 0 0\n63842 43746 0 0\n63846 43794 0 0\n63888 43894 0 0\n63958 43922 0 0\n63987 43892 0 0\n64017 43922 0 0\n64087 43894 0 0\n64137 43741 0 0\n64168 43709 0 0\n64169 43710 0 0\n64204 43675 0 0\n64275 43604 0 0\n64310 43569 0 0\n64309 43568 0 0\n64346 43532 0 0\n64394 43529 0 0\n64494 43487 0 0\n64522 43417 0 0\n64522 43498 0 0\n64346 43675 0 0\n64592 43922 0 0\n64662 43894 0 0\n64717 43729 0 0\n64717 44198 0 0\n64699 44216 0 0\n64580 44216 0 0\n64522 44239 0 0\n64522 43992 0 0\n64275 43746 0 0\n64028 43992 0 0\n64056 44062 0 0\n64221 44117 0 0\n64394 44104 0 0\n64494 44062 0 0\n64522 43992 0 0\n64522 44239 0 0\n64431 44277 0 0\n64318 44391 0 0\n64264 44518 0 0\n64171 44557 0 0\n64058 44671 0 0\n63996 44819 0 0\n63996 44980 0 0\n64057 45129 0 0\n64171 45242 0 0\n64319 45304 0 0\n64480 45304 0 0\n64629 45243 0 0\n64742 45129 0 0\n64795 45001 0 0\n64889 44963 0 0\n64905 44946 0 0\n64924 44943 0 0\n65037 44867 0 0\n65428 44476 0 0\n65559 44423 0 0\n65672 44309 0 0\n65734 44161 0 0\n65734 44000 0 0\n65680 43868 0 0\n65680 43814 0 0\n66144 43350 0 0\n67199 43350 0 0\n67239 43390 0 0\n67408 43460 0 0\n67591 43460 0 0\n67760 43390 0 0\n67890 43261 0 0\n67960 43092 0 0\n67960 44604 0 0\n67898 44630 0 0\n67843 44722 0 0\n68250 45129 0 0\n68657 44722 0 0\n68657 44864 0 0\n68321 45200 0 0\n68728 45607 0 0\n68820 45552 0 0\n68911 45307 0 0\n68911 47307 0 0\n68902 47046 0 0\n68820 46848 0 0\n68728 46793 0 0\n68657 46864 0 0\n68657 46722 0 0\n68602 46630 0 0\n68357 46539 0 0\n68096 46548 0 0\n67999 46588 0 0\n67898 46630 0 0\n67869 46678 0 0\n67849 46658 0 0\n67884 46625 0 0\n67999 46350 0 0\n67999 46052 0 0\n67885 45777 0 0\n67849 45741 0 0\n67869 45721 0 0\n67898 45770 0 0\n68143 45861 0 0\n68404 45852 0 0\n68602 45770 0 0\n68657 45678 0 0\n68285 45306 0 0\n68250 45271 0 0\n68179 45200 0 0\n68144 45165 0 0\n67772 44793 0 0\n67680 44848 0 0\n67589 45093 0 0\n67598 45354 0 0\n67680 45552 0 0\n67728 45580 0 0\n67708 45600 0 0\n67675 45566 0 0\n67400 45451 0 0\n67102 45451 0 0\n66911 45530 0 0\n66827 45565 0 0\n66791 45600 0 0\n66771 45580 0 0\n66820 45552 0 0\n66911 45307 0 0\n66902 45046 0 0\n66820 44848 0 0\n66728 44793 0 0\n66657 44864 0 0\n66657 44722 0 0\n66602 44630 0 0\n66357 44539 0 0\n66096 44548 0 0\n65898 44630 0 0\n65843 44722 0 0\n66250 45129 0 0\n66657 44722 0 0\n66657 44864 0 0\n66356 45165 0 0\n66321 45200 0 0\n66250 45271 0 0\n66215 45306 0 0\n66179 45342 0 0\n66179 45200 0 0\n65772 44793 0 0\n65680 44848 0 0\n65589 45093 0 0\n65598 45354 0 0\n65680 45552 0 0\n65772 45607 0 0\n66179 45200 0 0\n66179 45342 0 0\n65843 45678 0 0\n65898 45770 0 0\n66143 45861 0 0\n66404 45852 0 0\n66602 45770 0 0\n66630 45721 0 0\n66650 45741 0 0\n66616 45775 0 0\n66501 46050 0 0\n66501 46348 0 0\n66615 46623 0 0\n66650 46658 0 0\n66630 46678 0 0\n66602 46630 0 0\n66357 46539 0 0\n66096 46548 0 0\n65898 46630 0 0\n65843 46722 0 0\n66215 47094 0 0\n66250 47129 0 0\n66321 47200 0 0\n66356 47235 0 0\n66728 47607 0 0\n66820 47552 0 0\n66911 47307 0 0\n66902 47046 0 0\n66820 46848 0 0\n66771 46819 0 0\n66791 46799 0 0\n66825 46834 0 0\n67100 46949 0 0\n67398 46949 0 0\n67673 46835 0 0\n67708 46799 0 0\n67728 46819 0 0\n67680 46848 0 0\n67589 47093 0 0\n67598 47354 0 0\n67680 47552 0 0\n67772 47607 0 0\n68144 47235 0 0\n68179 47200 0 0\n68250 47129 0 0\n68285 47094 0 0\n68657 46722 0 0\n68657 46864 0 0\n68321 47200 0 0\n68728 47607 0 0\n68820 47552 0 0\n68911 47307 0 0\n68911 47950 0 0\n68657 47950 0 0\n68657 47678 0 0\n68250 47271 0 0\n68179 47342 0 0\n67843 47678 0 0\n67898 47770 0 0\n68143 47861 0 0\n68404 47852 0 0\n68602 47770 0 0\n68657 47678 0 0\n68657 47950 0 0\n66911 47950 0 0\n66657 47950 0 0\n66657 47678 0 0\n66250 47271 0 0\n66179 47342 0 0\n66179 47200 0 0\n65772 46793 0 0\n65680 46848 0 0\n65589 47093 0 0\n65598 47354 0 0\n65680 47552 0 0\n65772 47607 0 0\n66179 47200 0 0\n66179 47342 0 0\n65843 47678 0 0\n65898 47770 0 0\n66143 47861 0 0\n66404 47852 0 0\n66602 47770 0 0\n66657 47678 0 0\n66657 47950 0 0\n63947 47950 0 0\n63947 43992 0 0\n63700 43746 0 0\n63453 43992 0 0\n63481 44062 0 0\n63646 44117 0 0\n63819 44104 0 0\n63919 44062 0 0\n63947 43992 0 0\n63947 47950 0 0\n63654 47950 0 0\n63654 45021 0 0\n63654 44860 0 0\n63593 44711 0 0\n63479 44598 0 0\n63372 44553 0 0\n63372 43992 0 0\n63125 43746 0 0\n63054 43816 0 0\n63054 43675 0 0\n62808 43428 0 0\n62738 43456 0 0\n62683 43621 0 0\n62696 43794 0 0\n62738 43894 0 0\n62808 43922 0 0\n63054 43675 0 0\n63054 43816 0 0\n62878 43992 0 0\n62906 44062 0 0\n63071 44117 0 0\n63244 44104 0 0\n63344 44062 0 0\n63372 43992 0 0\n63372 44553 0 0\n63331 44536 0 0\n63170 44536 0 0\n63038 44590 0 0\n63014 44590 0 0\n62676 44252 0 0\n62623 44121 0 0\n62509 44008 0 0\n62361 43946 0 0\n62324 43946 0 0\n62324 42781 0 0\n62324 42620 0 0\n62263 42471 0 0\n62149 42358 0 0\n62017 42302 0 0\n61807 42093 0 0\n61840 42061 0 0\n61910 41892 0 0\n61910 41709 0 0\n61840 41540 0 0\n61711 41410 0 0\n61542 41340 0 0\n61359 41340 0 0\n61190 41410 0 0\n61060 41539 0 0\n60990 41708 0 0\n60990 41891 0 0\n61060 42060 0 0\n61100 42100 0 0\n61100 42230 0 0\n61127 42364 0 0\n61203 42477 0 0\n61523 42798 0 0\n61577 42929 0 0\n61691 43042 0 0\n61839 43104 0 0\n62000 43104 0 0\n62149 43043 0 0\n62262 42929 0 0\n62324 42781 0 0\n62324 43946 0 0\n62200 43946 0 0\n62068 44000 0 0\n61690 44000 0 0\n61556 44027 0 0\n61442 44103 0 0\n61115 44430 0 0\n60684 44430 0 0\n60660 44406 0 0\n60660 40392 0 0\n60660 40209 0 0\n60590 40040 0 0\n60461 39910 0 0\n60292 39840 0 0\n60234 39840 0 0\n60150 39755 0 0\n60150 38850 0 0\n60190 38811 0 0\n60260 38642 0 0\n60260 38459 0 0\n60190 38290 0 0\n60061 38160 0 0\n59892 38090 0 0\n59709 38090 0 0\n59540 38160 0 0\n59410 38289 0 0\n59340 38458 0 0\n59340 38641 0 0\n59410 38810 0 0\n59450 38850 0 0\n59450 39900 0 0\n59477 40034 0 0\n59553 40147 0 0\n59740 40334 0 0\n59740 40391 0 0\n59810 40560 0 0\n59939 40690 0 0\n60108 40760 0 0\n60291 40760 0 0\n60460 40690 0 0\n60590 40561 0 0\n60660 40392 0 0\n60660 44406 0 0\n60597 44343 0 0\n60484 44267 0 0\n60350 44240 0 0\n60030 44240 0 0\n59991 44200 0 0\n59822 44130 0 0\n59639 44130 0 0\n59470 44200 0 0\n59340 44329 0 0\n59270 44498 0 0\n59270 44681 0 0\n59340 44850 0 0\n59469 44980 0 0\n59638 45050 0 0\n59821 45050 0 0\n59990 44980 0 0\n60030 44940 0 0\n60205 44940 0 0\n60292 45027 0 0\n60293 45027 0 0\n60406 45103 0 0\n60540 45130 0 0\n61260 45130 0 0\n61260 45129 0 0\n61394 45103 0 0\n61507 45027 0 0\n61834 44700 0 0\n62070 44700 0 0\n62183 44747 0 0\n62622 45187 0 0\n62623 45187 0 0\n62736 45263 0 0\n62870 45290 0 0\n63040 45290 0 0\n63169 45344 0 0\n63330 45344 0 0\n63479 45283 0 0\n63592 45169 0 0\n63654 45021 0 0\n63654 47950 0 0\n59214 47950 0 0\n59214 44801 0 0\n59214 44640 0 0\n59153 44491 0 0\n59039 44378 0 0\n58891 44316 0 0\n58876 44316 0 0\n58592 44032 0 0\n58592 43402 0 0\n58570 43291 0 0\n58507 43197 0 0\n56624 41314 0 0\n56624 39309 0 0\n56689 39283 0 0\n56802 39169 0 0\n56864 39021 0 0\n56864 38961 0 0\n56909 38943 0 0\n57022 38829 0 0\n57084 38681 0 0\n57084 38520 0 0\n57023 38371 0 0\n56909 38258 0 0\n56844 38230 0 0\n56844 38200 0 0\n56783 38051 0 0\n56669 37938 0 0\n56521 37876 0 0\n56360 37876 0 0\n56211 37937 0 0\n56098 38051 0 0\n56036 38199 0 0\n56036 38214 0 0\n55949 38128 0 0\n55801 38066 0 0\n55640 38066 0 0\n55491 38127 0 0\n55378 38241 0 0\n55316 38389 0 0\n55316 38550 0 0\n55377 38699 0 0\n55491 38812 0 0\n55558 38840 0 0\n55558 39942 0 0\n55205 40295 0 0\n55142 40389 0 0\n55120 40500 0 0\n55120 40740 0 0\n55142 40851 0 0\n55205 40945 0 0\n57850 43590 0 0\n57850 44410 0 0\n57872 44521 0 0\n57896 44556 0 0\n57896 44650 0 0\n57957 44799 0 0\n58071 44912 0 0\n58219 44974 0 0\n58380 44974 0 0\n58463 44939 0 0\n58467 44949 0 0\n58581 45062 0 0\n58729 45124 0 0\n58890 45124 0 0\n59039 45063 0 0\n59152 44949 0 0\n59214 44801 0 0\n59214 47950 0 0\n55549 47950 0 0\n55549 44109 0 0\n55549 43891 0 0\n55465 43689 0 0\n55311 43535 0 0\n55226 43500 0 0\n55311 43465 0 0\n55465 43311 0 0\n55549 43109 0 0\n55549 42891 0 0\n55465 42689 0 0\n55311 42535 0 0\n55109 42451 0 0\n54891 42451 0 0\n54689 42535 0 0\n54535 42689 0 0\n54500 42773 0 0\n54465 42689 0 0\n54311 42535 0 0\n54109 42451 0 0\n53891 42451 0 0\n53689 42535 0 0\n53560 42664 0 0\n53560 40592 0 0\n53560 40409 0 0\n53490 40240 0 0\n53450 40199 0 0\n53450 38586 0 0\n53510 38442 0 0\n53510 38259 0 0\n53440 38090 0 0\n53311 37960 0 0\n53142 37890 0 0\n52959 37890 0 0\n52790 37960 0 0\n52660 38089 0 0\n52590 38258 0 0\n52590 38441 0 0\n52660 38610 0 0\n52750 38700 0 0\n52750 40199 0 0\n52710 40239 0 0\n52640 40408 0 0\n52640 40591 0 0\n52710 40760 0 0\n52839 40890 0 0\n53008 40960 0 0\n53191 40960 0 0\n53360 40890 0 0\n53490 40761 0 0\n53560 40592 0 0\n53560 42664 0 0\n53535 42689 0 0\n53500 42773 0 0\n53465 42689 0 0\n53311 42535 0 0\n53109 42451 0 0\n52891 42451 0 0\n52689 42535 0 0\n52535 42689 0 0\n52500 42773 0 0\n52465 42689 0 0\n52311 42535 0 0\n52109 42451 0 0\n51891 42451 0 0\n51710 42526 0 0\n51710 41592 0 0\n51710 41409 0 0\n51640 41240 0 0\n51549 41148 0 0\n51549 34109 0 0\n51549 33891 0 0\n51465 33689 0 0\n51311 33535 0 0\n51109 33451 0 0\n50891 33451 0 0\n50689 33535 0 0\n50535 33689 0 0\n50500 33773 0 0\n50465 33689 0 0\n50311 33535 0 0\n50109 33451 0 0\n49891 33451 0 0\n49689 33535 0 0\n49535 33689 0 0\n49500 33773 0 0\n49465 33689 0 0\n49311 33535 0 0\n49109 33451 0 0\n48891 33451 0 0\n48689 33535 0 0\n48535 33689 0 0\n48451 33891 0 0\n48451 34109 0 0\n48535 34311 0 0\n48689 34465 0 0\n48845 34530 0 0\n48666 34530 0 0\n48604 34556 0 0\n48556 34604 0 0\n48530 34666 0 0\n48530 34734 0 0\n48530 34908 0 0\n48572 34950 0 0\n48900 34950 0 0\n48950 34950 0 0\n49050 34950 0 0\n49100 34950 0 0\n49428 34950 0 0\n49470 34908 0 0\n49470 34734 0 0\n49470 34666 0 0\n49444 34604 0 0\n49396 34556 0 0\n49334 34530 0 0\n49154 34530 0 0\n49311 34465 0 0\n49465 34311 0 0\n49500 34226 0 0\n49535 34311 0 0\n49689 34465 0 0\n49885 34546 0 0\n49878 34547 0 0\n49766 34593 0 0\n49735 34664 0 0\n50000 34929 0 0\n50265 34664 0 0\n50234 34593 0 0\n50102 34549 0 0\n50109 34549 0 0\n50311 34465 0 0\n50465 34311 0 0\n50500 34226 0 0\n50535 34311 0 0\n50689 34465 0 0\n50885 34546 0 0\n50878 34547 0 0\n50766 34593 0 0\n50735 34664 0 0\n51000 34929 0 0\n51265 34664 0 0\n51234 34593 0 0\n51102 34549 0 0\n51109 34549 0 0\n51311 34465 0 0\n51465 34311 0 0\n51549 34109 0 0\n51549 41148 0 0\n51511 41110 0 0\n51465 41090 0 0\n51465 35061 0 0\n51453 34878 0 0\n51407 34766 0 0\n51336 34735 0 0\n51071 35000 0 0\n51336 35265 0 0\n51407 35234 0 0\n51465 35061 0 0\n51465 41090 0 0\n51342 41040 0 0\n51265 41040 0 0\n51265 35336 0 0\n51000 35071 0 0\n50929 35142 0 0\n50929 35000 0 0\n50664 34735 0 0\n50593 34766 0 0\n50535 34939 0 0\n50547 35122 0 0\n50593 35234 0 0\n50664 35265 0 0\n50929 35000 0 0\n50929 35142 0 0\n50735 35336 0 0\n50766 35407 0 0\n50939 35465 0 0\n51122 35453 0 0\n51234 35407 0 0\n51265 35336 0 0\n51265 41040 0 0\n51159 41040 0 0\n50990 41110 0 0\n50860 41239 0 0\n50790 41408 0 0\n50790 41591 0 0\n50860 41760 0 0\n50989 41890 0 0\n51158 41960 0 0\n51341 41960 0 0\n51510 41890 0 0\n51640 41761 0 0\n51710 41592 0 0\n51710 42526 0 0\n51689 42535 0 0\n51535 42689 0 0\n51500 42773 0 0\n51465 42689 0 0\n51311 42535 0 0\n51109 42451 0 0\n50891 42451 0 0\n50689 42535 0 0\n50667 42557 0 0\n50465 42355 0 0\n50465 35061 0 0\n50453 34878 0 0\n50407 34766 0 0\n50336 34735 0 0\n50071 35000 0 0\n50336 35265 0 0\n50407 35234 0 0\n50465 35061 0 0\n50465 42355 0 0\n50265 42155 0 0\n50265 35336 0 0\n50000 35071 0 0\n49929 35142 0 0\n49929 35000 0 0\n49664 34735 0 0\n49593 34766 0 0\n49535 34939 0 0\n49547 35122 0 0\n49593 35234 0 0\n49664 35265 0 0\n49929 35000 0 0\n49929 35142 0 0\n49735 35336 0 0\n49766 35407 0 0\n49939 35465 0 0\n50122 35453 0 0\n50234 35407 0 0\n50265 35336 0 0\n50265 42155 0 0\n49952 41842 0 0\n49952 38702 0 0\n49951 38701 0 0\n49930 38591 0 0\n49929 38590 0 0\n49867 38497 0 0\n49866 38496 0 0\n49470 38100 0 0\n49470 35334 0 0\n49470 35266 0 0\n49470 35092 0 0\n49428 35050 0 0\n49050 35050 0 0\n49050 35428 0 0\n49092 35470 0 0\n49334 35470 0 0\n49396 35444 0 0\n49444 35396 0 0\n49470 35334 0 0\n49470 38100 0 0\n48950 37580 0 0\n48950 35428 0 0\n48950 35050 0 0\n48572 35050 0 0\n48530 35092 0 0\n48530 35266 0 0\n48530 35334 0 0\n48556 35396 0 0\n48604 35444 0 0\n48666 35470 0 0\n48908 35470 0 0\n48950 35428 0 0\n48950 37580 0 0\n48832 37462 0 0\n48832 37345 0 0\n48884 37221 0 0\n48884 37060 0 0\n48823 36911 0 0\n48709 36798 0 0\n48561 36736 0 0\n48400 36736 0 0\n48251 36797 0 0\n48239 36808 0 0\n48161 36776 0 0\n48000 36776 0 0\n47851 36837 0 0\n47738 36951 0 0\n47676 37099 0 0\n47676 37260 0 0\n47725 37380 0 0\n47676 37499 0 0\n47676 37660 0 0\n47737 37809 0 0\n47851 37922 0 0\n47999 37984 0 0\n48074 37984 0 0\n49048 38958 0 0\n49048 41542 0 0\n48374 42216 0 0\n48374 41086 0 0\n48374 40873 0 0\n48374 39128 0 0\n48374 38915 0 0\n48293 38718 0 0\n48142 38568 0 0\n47946 38486 0 0\n47733 38486 0 0\n47536 38567 0 0\n47386 38718 0 0\n47304 38914 0 0\n47304 39127 0 0\n47385 39324 0 0\n47536 39474 0 0\n47732 39556 0 0\n47945 39556 0 0\n48142 39475 0 0\n48292 39324 0 0\n48374 39128 0 0\n48374 40873 0 0\n48293 40676 0 0\n48142 40526 0 0\n47946 40444 0 0\n47733 40444 0 0\n47536 40525 0 0\n47386 40676 0 0\n47304 40872 0 0\n47304 41085 0 0\n47385 41282 0 0\n47536 41432 0 0\n47732 41514 0 0\n47945 41514 0 0\n48142 41433 0 0\n48292 41282 0 0\n48374 41086 0 0\n48374 42216 0 0\n48295 42295 0 0\n48232 42389 0 0\n48210 42500 0 0\n48210 44400 0 0\n48232 44511 0 0\n48295 44605 0 0\n48595 44905 0 0\n48689 44968 0 0\n48800 44990 0 0\n51300 44990 0 0\n51411 44968 0 0\n51505 44905 0 0\n51869 44540 0 0\n51891 44549 0 0\n52109 44549 0 0\n52311 44465 0 0\n52465 44311 0 0\n52546 44114 0 0\n52547 44122 0 0\n52593 44234 0 0\n52664 44265 0 0\n52929 44000 0 0\n52664 43735 0 0\n52593 43766 0 0\n52549 43897 0 0\n52549 43891 0 0\n52465 43689 0 0\n52311 43535 0 0\n52226 43500 0 0\n52311 43465 0 0\n52465 43311 0 0\n52500 43226 0 0\n52535 43311 0 0\n52689 43465 0 0\n52885 43546 0 0\n52878 43547 0 0\n52766 43593 0 0\n52735 43664 0 0\n53000 43929 0 0\n53265 43664 0 0\n53234 43593 0 0\n53102 43549 0 0\n53109 43549 0 0\n53311 43465 0 0\n53465 43311 0 0\n53500 43226 0 0\n53535 43311 0 0\n53689 43465 0 0\n53773 43500 0 0\n53689 43535 0 0\n53535 43689 0 0\n53453 43885 0 0\n53453 43878 0 0\n53407 43766 0 0\n53336 43735 0 0\n53071 44000 0 0\n53336 44265 0 0\n53407 44234 0 0\n53451 44102 0 0\n53451 44109 0 0\n53535 44311 0 0\n53689 44465 0 0\n53891 44549 0 0\n54109 44549 0 0\n54311 44465 0 0\n54465 44311 0 0\n54500 44226 0 0\n54535 44311 0 0\n54689 44465 0 0\n54891 44549 0 0\n55109 44549 0 0\n55311 44465 0 0\n55465 44311 0 0\n55549 44109 0 0\n55549 47950 0 0\n53265 47950 0 0\n53265 44336 0 0\n53000 44071 0 0\n52735 44336 0 0\n52766 44407 0 0\n52939 44465 0 0\n53122 44453 0 0\n53234 44407 0 0\n53265 44336 0 0\n53265 47950 0 0\n46550 47950 0 0\n46550 41645 0 0\n46556 41648 0 0\n46781 41648 0 0\n46989 41562 0 0\n47148 41403 0 0\n47234 41196 0 0\n47234 40971 0 0\n47148 40763 0 0\n46989 40604 0 0\n46782 40518 0 0\n46557 40518 0 0\n46550 40520 0 0\n46550 39479 0 0\n46556 39482 0 0\n46781 39482 0 0\n46989 39396 0 0\n47148 39237 0 0\n47234 39030 0 0\n47234 38805 0 0\n47148 38597 0 0\n46989 38438 0 0\n46782 38352 0 0\n46557 38352 0 0\n46550 38354 0 0\n46550 21550 0 0\n70450 21550 0 0\n70450 47950 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 504D73CA 20 \"3V3\"\nZLayer 15\nZAux 6 E\nZClearance 200 T\nZMinThickness 100\nZOptions 0 16 F 120 200\nZSmoothing 0 0\nZCorner 60100 48000 0\nZCorner 60100 44800 0\nZCorner 70500 44800 0\nZCorner 70500 21500 0\nZCorner 46500 21500 0\nZCorner 46500 48000 1\n$POLYSCORNERS\n60703 44750 0 0\n60481 44750 0 0\n60379 44648 0 0\n60231 44586 0 0\n60070 44586 0 0\n59921 44647 0 0\n59808 44761 0 0\n59746 44909 0 0\n59746 45070 0 0\n59791 45179 0 0\n59791 45239 0 0\n59791 45439 0 0\n59816 45499 0 0\n59791 45560 0 0\n59791 45659 0 0\n59791 45859 0 0\n59829 45951 0 0\n59899 46021 0 0\n59990 46059 0 0\n60050 46059 0 0\n60050 47950 0 0\n52340 47950 0 0\n52340 46004 0 0\n52340 45892 0 0\n52298 45850 0 0\n52050 45850 0 0\n52050 46098 0 0\n52092 46140 0 0\n52136 46140 0 0\n52204 46140 0 0\n52266 46114 0 0\n52314 46066 0 0\n52340 46004 0 0\n52340 47950 0 0\n51950 47950 0 0\n51950 46098 0 0\n51950 45850 0 0\n51702 45850 0 0\n51660 45892 0 0\n51660 46004 0 0\n51686 46066 0 0\n51734 46114 0 0\n51796 46140 0 0\n51864 46140 0 0\n51908 46140 0 0\n51950 46098 0 0\n51950 47950 0 0\n51340 47950 0 0\n51340 46004 0 0\n51340 45892 0 0\n51298 45850 0 0\n51050 45850 0 0\n51050 46098 0 0\n51092 46140 0 0\n51136 46140 0 0\n51204 46140 0 0\n51266 46114 0 0\n51314 46066 0 0\n51340 46004 0 0\n51340 47950 0 0\n50950 47950 0 0\n50950 46098 0 0\n50950 45850 0 0\n50702 45850 0 0\n50660 45892 0 0\n50660 46004 0 0\n50686 46066 0 0\n50734 46114 0 0\n50796 46140 0 0\n50864 46140 0 0\n50908 46140 0 0\n50950 46098 0 0\n50950 47950 0 0\n46550 47950 0 0\n46550 41647 0 0\n46553 41647 0 0\n46556 41648 0 0\n46781 41648 0 0\n46783 41647 0 0\n46979 41647 0 0\n46991 41676 0 0\n47061 41746 0 0\n47152 41784 0 0\n47251 41784 0 0\n47501 41784 0 0\n47503 41783 0 0\n47505 41784 0 0\n47604 41784 0 0\n48174 41784 0 0\n48266 41746 0 0\n48336 41676 0 0\n48374 41585 0 0\n48374 41486 0 0\n48374 41086 0 0\n48374 41000 0 0\n48420 41010 0 0\n50285 41010 0 0\n50290 41011 0 0\n50290 41010 0 0\n50481 40972 0 0\n50482 40972 0 0\n50644 40864 0 0\n50653 40854 0 0\n50762 40692 0 0\n50801 40500 0 0\n50762 40308 0 0\n50686 40196 0 0\n56456 40196 0 0\n57009 40749 0 0\n56969 40789 0 0\n56931 40880 0 0\n56931 40979 0 0\n56931 41319 0 0\n56964 41399 0 0\n56931 41480 0 0\n56931 41579 0 0\n56931 41919 0 0\n56969 42011 0 0\n57039 42081 0 0\n57130 42119 0 0\n57229 42119 0 0\n57231 42119 0 0\n57231 42179 0 0\n57231 42519 0 0\n57269 42611 0 0\n57339 42681 0 0\n57430 42719 0 0\n57529 42719 0 0\n57869 42719 0 0\n57949 42685 0 0\n58030 42719 0 0\n58129 42719 0 0\n58469 42719 0 0\n58561 42681 0 0\n58631 42611 0 0\n58639 42590 0 0\n58810 42590 0 0\n58814 42599 0 0\n58781 42680 0 0\n58781 42779 0 0\n58781 43006 0 0\n56958 43006 0 0\n56131 42179 0 0\n56131 41303 0 0\n56229 41263 0 0\n56342 41149 0 0\n56404 41001 0 0\n56404 40840 0 0\n56343 40691 0 0\n56229 40578 0 0\n56096 40522 0 0\n56043 40391 0 0\n55929 40278 0 0\n55781 40216 0 0\n55620 40216 0 0\n55471 40277 0 0\n55358 40391 0 0\n55296 40539 0 0\n55296 40700 0 0\n55357 40849 0 0\n55380 40871 0 0\n55380 42358 0 0\n55402 42469 0 0\n55465 42563 0 0\n56111 43210 0 0\n55507 43210 0 0\n55549 43109 0 0\n55549 42891 0 0\n55465 42689 0 0\n55311 42535 0 0\n55109 42451 0 0\n54891 42451 0 0\n54689 42535 0 0\n54535 42689 0 0\n54500 42773 0 0\n54465 42689 0 0\n54311 42535 0 0\n54109 42451 0 0\n53891 42451 0 0\n53689 42535 0 0\n53535 42689 0 0\n53500 42773 0 0\n53465 42689 0 0\n53311 42535 0 0\n53109 42451 0 0\n52891 42451 0 0\n52689 42535 0 0\n52535 42689 0 0\n52500 42773 0 0\n52465 42689 0 0\n52311 42535 0 0\n52109 42451 0 0\n51891 42451 0 0\n51689 42535 0 0\n51535 42689 0 0\n51500 42773 0 0\n51465 42689 0 0\n51311 42535 0 0\n51109 42451 0 0\n50891 42451 0 0\n50689 42535 0 0\n50535 42689 0 0\n50500 42773 0 0\n50465 42689 0 0\n50311 42535 0 0\n50109 42451 0 0\n49891 42451 0 0\n49689 42535 0 0\n49535 42689 0 0\n49500 42773 0 0\n49465 42689 0 0\n49350 42574 0 0\n49350 42404 0 0\n49881 41873 0 0\n49889 41881 0 0\n49980 41919 0 0\n50079 41919 0 0\n50419 41919 0 0\n50511 41881 0 0\n50565 41827 0 0\n50596 41840 0 0\n50708 41840 0 0\n50750 41798 0 0\n50750 41773 0 0\n50781 41761 0 0\n50850 41692 0 0\n50850 41798 0 0\n50892 41840 0 0\n51004 41840 0 0\n51066 41814 0 0\n51114 41766 0 0\n51140 41704 0 0\n51140 41636 0 0\n51140 41592 0 0\n51098 41550 0 0\n50889 41550 0 0\n50889 41501 0 0\n50889 41450 0 0\n51098 41450 0 0\n51140 41408 0 0\n51140 41364 0 0\n51140 41296 0 0\n51114 41234 0 0\n51066 41186 0 0\n51004 41160 0 0\n50892 41160 0 0\n50850 41202 0 0\n50850 41308 0 0\n50781 41239 0 0\n50750 41226 0 0\n50750 41202 0 0\n50708 41160 0 0\n50596 41160 0 0\n50565 41173 0 0\n50511 41119 0 0\n50420 41081 0 0\n50321 41081 0 0\n49981 41081 0 0\n49889 41119 0 0\n49858 41150 0 0\n49760 41150 0 0\n49626 41177 0 0\n49512 41253 0 0\n48753 42013 0 0\n48677 42126 0 0\n48650 42260 0 0\n48650 42574 0 0\n48535 42689 0 0\n48451 42891 0 0\n48451 43109 0 0\n48535 43311 0 0\n48675 43451 0 0\n48651 43451 0 0\n48559 43489 0 0\n48489 43559 0 0\n48451 43650 0 0\n48451 43749 0 0\n48451 44349 0 0\n48489 44441 0 0\n48559 44511 0 0\n48650 44549 0 0\n48749 44549 0 0\n49349 44549 0 0\n49441 44511 0 0\n49511 44441 0 0\n49549 44350 0 0\n49549 44325 0 0\n49689 44465 0 0\n49891 44549 0 0\n50109 44549 0 0\n50311 44465 0 0\n50465 44311 0 0\n50500 44226 0 0\n50535 44311 0 0\n50689 44465 0 0\n50710 44473 0 0\n50710 44810 0 0\n50689 44819 0 0\n50619 44889 0 0\n50581 44980 0 0\n50581 45079 0 0\n50581 45419 0 0\n50619 45511 0 0\n50673 45565 0 0\n50660 45596 0 0\n50660 45708 0 0\n50702 45750 0 0\n50900 45750 0 0\n50950 45750 0 0\n51050 45750 0 0\n51100 45750 0 0\n51298 45750 0 0\n51340 45708 0 0\n51340 45596 0 0\n51327 45565 0 0\n51381 45511 0 0\n51419 45420 0 0\n51419 45321 0 0\n51419 44981 0 0\n51381 44889 0 0\n51311 44819 0 0\n51290 44810 0 0\n51290 44473 0 0\n51311 44465 0 0\n51465 44311 0 0\n51500 44226 0 0\n51535 44311 0 0\n51689 44465 0 0\n51710 44473 0 0\n51710 44810 0 0\n51689 44819 0 0\n51619 44889 0 0\n51581 44980 0 0\n51581 45079 0 0\n51581 45419 0 0\n51619 45511 0 0\n51673 45565 0 0\n51660 45596 0 0\n51660 45708 0 0\n51702 45750 0 0\n51900 45750 0 0\n51950 45750 0 0\n52050 45750 0 0\n52100 45750 0 0\n52298 45750 0 0\n52340 45708 0 0\n52340 45596 0 0\n52327 45565 0 0\n52381 45511 0 0\n52389 45490 0 0\n54800 45490 0 0\n54911 45468 0 0\n55005 45405 0 0\n55301 45108 0 0\n55360 45250 0 0\n55489 45380 0 0\n55658 45450 0 0\n55841 45450 0 0\n55948 45405 0 0\n55980 45419 0 0\n56079 45419 0 0\n56419 45419 0 0\n56499 45385 0 0\n56580 45419 0 0\n56679 45419 0 0\n57019 45419 0 0\n57111 45381 0 0\n57181 45311 0 0\n57189 45290 0 0\n57310 45290 0 0\n57319 45311 0 0\n57389 45381 0 0\n57480 45419 0 0\n57579 45419 0 0\n57919 45419 0 0\n57999 45385 0 0\n58080 45419 0 0\n58179 45419 0 0\n58471 45419 0 0\n58309 45581 0 0\n58081 45581 0 0\n58000 45614 0 0\n57920 45581 0 0\n57821 45581 0 0\n57481 45581 0 0\n57389 45619 0 0\n57319 45689 0 0\n57310 45710 0 0\n57189 45710 0 0\n57181 45689 0 0\n57111 45619 0 0\n57020 45581 0 0\n56921 45581 0 0\n56581 45581 0 0\n56500 45614 0 0\n56420 45581 0 0\n56321 45581 0 0\n55981 45581 0 0\n55960 45589 0 0\n55842 45540 0 0\n55659 45540 0 0\n55490 45610 0 0\n55360 45739 0 0\n55290 45908 0 0\n55290 46091 0 0\n55360 46260 0 0\n55489 46390 0 0\n55658 46460 0 0\n55841 46460 0 0\n55960 46410 0 0\n55980 46419 0 0\n56079 46419 0 0\n56419 46419 0 0\n56499 46385 0 0\n56580 46419 0 0\n56679 46419 0 0\n57019 46419 0 0\n57111 46381 0 0\n57181 46311 0 0\n57189 46290 0 0\n57310 46290 0 0\n57319 46311 0 0\n57389 46381 0 0\n57480 46419 0 0\n57579 46419 0 0\n57919 46419 0 0\n57999 46385 0 0\n58080 46419 0 0\n58179 46419 0 0\n58519 46419 0 0\n58611 46381 0 0\n58681 46311 0 0\n58719 46220 0 0\n58719 46121 0 0\n58719 45991 0 0\n59015 45695 0 0\n59078 45601 0 0\n59100 45490 0 0\n59100 45001 0 0\n59152 44949 0 0\n59214 44801 0 0\n59214 44726 0 0\n59420 44521 0 0\n59420 44520 0 0\n59421 44518 0 0\n59544 44396 0 0\n60480 44396 0 0\n60480 44441 0 0\n60550 44610 0 0\n60679 44740 0 0\n60703 44750 1 0\n61987 42647 0 0\n61912 42698 0 0\n61830 42780 0 0\n61824 42786 0 0\n61788 42750 0 0\n61660 42750 0 0\n61610 42750 0 0\n61510 42750 0 0\n61510 42650 0 0\n61610 42650 0 0\n61660 42650 0 0\n61788 42650 0 0\n61830 42608 0 0\n61830 42590 0 0\n61930 42590 0 0\n61987 42647 1 0\n62623 41726 0 0\n62614 41748 0 0\n62614 41867 0 0\n62614 42014 0 0\n62404 42014 0 0\n62323 41933 0 0\n62229 41870 0 0\n62118 41848 0 0\n59758 41848 0 0\n59619 41709 0 0\n59619 41560 0 0\n59741 41560 0 0\n59910 41490 0 0\n60040 41361 0 0\n60110 41192 0 0\n60110 41009 0 0\n60040 40840 0 0\n59911 40710 0 0\n59742 40640 0 0\n59559 40640 0 0\n59439 40689 0 0\n59420 40681 0 0\n59321 40681 0 0\n58981 40681 0 0\n58889 40719 0 0\n58819 40789 0 0\n58781 40880 0 0\n58781 40979 0 0\n58781 41319 0 0\n58814 41399 0 0\n58810 41410 0 0\n58339 41410 0 0\n58335 41400 0 0\n58369 41320 0 0\n58369 41221 0 0\n58369 40881 0 0\n58331 40789 0 0\n58301 40759 0 0\n59020 40040 0 0\n59410 40040 0 0\n59419 40061 0 0\n59489 40131 0 0\n59580 40169 0 0\n59679 40169 0 0\n60019 40169 0 0\n60111 40131 0 0\n60152 40090 0 0\n60160 40090 0 0\n60169 40111 0 0\n60239 40181 0 0\n60330 40219 0 0\n60429 40219 0 0\n60769 40219 0 0\n60849 40185 0 0\n60930 40219 0 0\n61029 40219 0 0\n61369 40219 0 0\n61461 40181 0 0\n61526 40116 0 0\n61656 40246 0 0\n61656 40320 0 0\n61717 40469 0 0\n61831 40582 0 0\n61979 40644 0 0\n62062 40644 0 0\n62062 40652 0 0\n62084 40763 0 0\n62147 40857 0 0\n62623 41333 0 0\n62623 41726 1 0\n62810 44292 0 0\n62688 44292 0 0\n62688 44405 0 0\n62700 44449 0 0\n62660 44490 0 0\n62030 44490 0 0\n62030 44442 0 0\n61988 44400 0 0\n61860 44400 0 0\n61810 44400 0 0\n61710 44400 0 0\n61710 44300 0 0\n61810 44300 0 0\n61860 44300 0 0\n61988 44300 0 0\n62030 44258 0 0\n62030 44206 0 0\n62017 44177 0 0\n62326 44177 0 0\n62348 44186 0 0\n62467 44186 0 0\n62688 44186 0 0\n62688 44192 0 0\n62735 44192 0 0\n62786 44213 0 0\n62810 44213 0 0\n62810 44292 1 0\n64892 43937 0 0\n64877 43937 0 0\n64813 43924 0 0\n64813 43915 0 0\n64813 43837 0 0\n64892 43837 0 0\n64892 43860 0 0\n64892 43914 0 0\n64892 43916 0 0\n64892 43937 1 0\n65419 40341 0 0\n64619 41141 0 0\n64588 41110 0 0\n64400 41110 0 0\n64400 41288 0 0\n64436 41324 0 0\n64430 41330 0 0\n64331 41428 0 0\n64299 41379 0 0\n64298 41378 0 0\n64290 41370 0 0\n64290 41298 0 0\n64300 41288 0 0\n64300 41160 0 0\n64300 41110 0 0\n64300 41010 0 0\n64400 41010 0 0\n64450 41010 0 0\n64588 41010 0 0\n64630 40968 0 0\n64630 40926 0 0\n64628 40923 0 0\n64671 40881 0 0\n64709 40790 0 0\n64709 40691 0 0\n64709 40491 0 0\n64706 40484 0 0\n64740 40451 0 0\n64810 40282 0 0\n64810 40169 0 0\n64908 40210 0 0\n65091 40210 0 0\n65260 40140 0 0\n65390 40011 0 0\n65419 39940 0 0\n65419 40341 1 0\n65925 44523 0 0\n65827 44565 0 0\n65790 44601 0 0\n65790 44488 0 0\n65790 44300 0 0\n65612 44300 0 0\n65570 44342 0 0\n65570 44394 0 0\n65596 44456 0 0\n65644 44504 0 0\n65706 44530 0 0\n65748 44530 0 0\n65790 44488 0 0\n65790 44601 0 0\n65641 44750 0 0\n65550 44750 0 0\n65550 44680 0 0\n65549 44679 0 0\n65523 44546 0 0\n65447 44433 0 0\n65447 44432 0 0\n65096 44081 0 0\n65158 44031 0 0\n65180 43987 0 0\n65209 43987 0 0\n65209 43924 0 0\n65282 43997 0 0\n65283 43997 0 0\n65396 44073 0 0\n65530 44100 0 0\n65572 44100 0 0\n65570 44106 0 0\n65570 44158 0 0\n65612 44200 0 0\n65740 44200 0 0\n65790 44200 0 0\n65890 44200 0 0\n65890 44300 0 0\n65890 44350 0 0\n65890 44488 0 0\n65925 44523 1 0\n70450 44750 0 0\n68858 44750 0 0\n68675 44566 0 0\n68400 44451 0 0\n68102 44451 0 0\n67827 44565 0 0\n67641 44750 0 0\n66858 44750 0 0\n66727 44618 0 0\n66789 44593 0 0\n66902 44479 0 0\n66964 44331 0 0\n66964 44210 0 0\n67091 44210 0 0\n67260 44140 0 0\n67390 44011 0 0\n67460 43842 0 0\n67460 43659 0 0\n67390 43490 0 0\n67261 43360 0 0\n67092 43290 0 0\n66909 43290 0 0\n66789 43339 0 0\n66770 43331 0 0\n66671 43331 0 0\n66577 43331 0 0\n66582 43328 0 0\n68165 41746 0 0\n68165 41745 0 0\n68206 41683 0 0\n68227 41652 0 0\n68228 41651 0 0\n68249 41540 0 0\n68250 41540 0 0\n68250 40367 0 0\n68309 40343 0 0\n68422 40229 0 0\n68484 40081 0 0\n68484 39920 0 0\n68423 39771 0 0\n68324 39672 0 0\n68324 39560 0 0\n68263 39411 0 0\n68164 39312 0 0\n68164 39200 0 0\n68103 39051 0 0\n68004 38952 0 0\n68004 38840 0 0\n67943 38691 0 0\n67844 38592 0 0\n67844 38480 0 0\n67783 38331 0 0\n67669 38218 0 0\n67539 38163 0 0\n67493 38051 0 0\n67379 37938 0 0\n67231 37876 0 0\n67070 37876 0 0\n66921 37937 0 0\n66808 38051 0 0\n66746 38199 0 0\n66746 38360 0 0\n66807 38509 0 0\n66860 38561 0 0\n66860 41080 0 0\n65917 42023 0 0\n65073 42023 0 0\n65052 42014 0 0\n64933 42014 0 0\n64786 42014 0 0\n64786 41794 0 0\n65914 40666 0 0\n65977 40572 0 0\n65999 40461 0 0\n65999 37910 0 0\n66171 37910 0 0\n66263 37872 0 0\n66333 37802 0 0\n66371 37711 0 0\n66371 37676 0 0\n68629 37676 0 0\n68629 37710 0 0\n68667 37802 0 0\n68737 37872 0 0\n68828 37910 0 0\n68927 37910 0 0\n69753 37910 0 0\n69845 37872 0 0\n69915 37802 0 0\n69953 37711 0 0\n69953 37612 0 0\n69953 37062 0 0\n69953 35939 0 0\n69953 35840 0 0\n69953 35290 0 0\n69915 35198 0 0\n69845 35128 0 0\n69760 35092 0 0\n69760 34949 0 0\n69690 34780 0 0\n69561 34650 0 0\n69392 34580 0 0\n69209 34580 0 0\n69040 34650 0 0\n68910 34779 0 0\n68840 34948 0 0\n68840 35090 0 0\n68829 35090 0 0\n68737 35128 0 0\n68667 35198 0 0\n68629 35289 0 0\n68629 35388 0 0\n68629 35938 0 0\n68667 36030 0 0\n68737 36100 0 0\n68828 36138 0 0\n68927 36138 0 0\n69753 36138 0 0\n69845 36100 0 0\n69915 36030 0 0\n69953 35939 0 0\n69953 37062 0 0\n69915 36970 0 0\n69845 36900 0 0\n69754 36862 0 0\n69655 36862 0 0\n68829 36862 0 0\n68737 36900 0 0\n68667 36970 0 0\n68629 37061 0 0\n68629 37096 0 0\n66371 37096 0 0\n66371 37062 0 0\n66371 35939 0 0\n66371 35840 0 0\n66371 35290 0 0\n66360 35263 0 0\n66360 32292 0 0\n66360 32109 0 0\n66290 31940 0 0\n66161 31810 0 0\n65992 31740 0 0\n65934 31740 0 0\n65913 31718 0 0\n65942 31650 0 0\n65942 31352 0 0\n65828 31077 0 0\n65618 30866 0 0\n65343 30751 0 0\n65045 30751 0 0\n64770 30865 0 0\n64559 31075 0 0\n64444 31350 0 0\n64444 31648 0 0\n64558 31923 0 0\n64768 32134 0 0\n65043 32249 0 0\n65341 32249 0 0\n65421 32215 0 0\n65440 32234 0 0\n65440 32291 0 0\n65510 32460 0 0\n65639 32590 0 0\n65808 32660 0 0\n65991 32660 0 0\n66160 32590 0 0\n66290 32461 0 0\n66360 32292 0 0\n66360 35263 0 0\n66333 35198 0 0\n66263 35128 0 0\n66172 35090 0 0\n66170 35090 0 0\n66170 34949 0 0\n66100 34780 0 0\n65971 34650 0 0\n65802 34580 0 0\n65619 34580 0 0\n65450 34650 0 0\n65320 34779 0 0\n65250 34948 0 0\n65250 35090 0 0\n65247 35090 0 0\n65155 35128 0 0\n65085 35198 0 0\n65047 35289 0 0\n65047 35388 0 0\n65047 35938 0 0\n65085 36030 0 0\n65155 36100 0 0\n65246 36138 0 0\n65345 36138 0 0\n66171 36138 0 0\n66263 36100 0 0\n66333 36030 0 0\n66371 35939 0 0\n66371 37062 0 0\n66333 36970 0 0\n66263 36900 0 0\n66172 36862 0 0\n66073 36862 0 0\n65247 36862 0 0\n65155 36900 0 0\n65085 36970 0 0\n65047 37061 0 0\n65047 37096 0 0\n64766 37096 0 0\n64390 36720 0 0\n64390 34381 0 0\n64480 34419 0 0\n64579 34419 0 0\n64919 34419 0 0\n65011 34381 0 0\n65065 34327 0 0\n65096 34340 0 0\n65208 34340 0 0\n65250 34298 0 0\n65250 34273 0 0\n65281 34261 0 0\n65350 34192 0 0\n65350 34298 0 0\n65392 34340 0 0\n65504 34340 0 0\n65566 34314 0 0\n65614 34266 0 0\n65640 34204 0 0\n65640 34136 0 0\n65640 34092 0 0\n65598 34050 0 0\n65389 34050 0 0\n65389 34001 0 0\n65389 33950 0 0\n65598 33950 0 0\n65640 33908 0 0\n65640 33864 0 0\n65640 33796 0 0\n65614 33734 0 0\n65566 33686 0 0\n65504 33660 0 0\n65392 33660 0 0\n65350 33702 0 0\n65350 33808 0 0\n65281 33739 0 0\n65250 33726 0 0\n65250 33702 0 0\n65208 33660 0 0\n65096 33660 0 0\n65065 33673 0 0\n65011 33619 0 0\n64920 33581 0 0\n64821 33581 0 0\n64691 33581 0 0\n62595 31485 0 0\n62595 31352 0 0\n62481 31077 0 0\n62271 30866 0 0\n61996 30751 0 0\n61698 30751 0 0\n61423 30865 0 0\n61212 31075 0 0\n61097 31350 0 0\n61097 31648 0 0\n61211 31923 0 0\n61421 32134 0 0\n61696 32249 0 0\n61994 32249 0 0\n62269 32135 0 0\n62347 32057 0 0\n63500 33210 0 0\n60850 33210 0 0\n60739 33232 0 0\n60645 33295 0 0\n60644 33295 0 0\n60644 33296 0 0\n60358 33582 0 0\n60311 33535 0 0\n60109 33451 0 0\n59891 33451 0 0\n59689 33535 0 0\n59535 33689 0 0\n59500 33773 0 0\n59465 33689 0 0\n59311 33535 0 0\n59249 33509 0 0\n59249 31650 0 0\n59249 31352 0 0\n59135 31077 0 0\n58925 30866 0 0\n58650 30751 0 0\n58352 30751 0 0\n58077 30865 0 0\n57866 31075 0 0\n57809 31210 0 0\n57110 31210 0 0\n56333 30433 0 0\n56239 30370 0 0\n56128 30348 0 0\n48232 30348 0 0\n48121 30370 0 0\n48027 30433 0 0\n47333 31127 0 0\n47270 31221 0 0\n47248 31332 0 0\n47248 37038 0 0\n47270 37149 0 0\n47333 37243 0 0\n47676 37586 0 0\n47676 37660 0 0\n47737 37809 0 0\n47851 37922 0 0\n47999 37984 0 0\n48160 37984 0 0\n48309 37923 0 0\n48422 37809 0 0\n48484 37661 0 0\n48484 37544 0 0\n48560 37544 0 0\n48709 37483 0 0\n48822 37369 0 0\n48884 37221 0 0\n48884 37060 0 0\n48823 36911 0 0\n48709 36798 0 0\n48561 36736 0 0\n48486 36736 0 0\n48190 36440 0 0\n48190 31550 0 0\n48488 31252 0 0\n51098 31252 0 0\n51058 31350 0 0\n51058 31648 0 0\n51172 31923 0 0\n51382 32134 0 0\n51657 32249 0 0\n51955 32249 0 0\n52090 32193 0 0\n53162 33265 0 0\n53256 33328 0 0\n53367 33350 0 0\n57460 33350 0 0\n57571 33328 0 0\n57636 33284 0 0\n57720 33284 0 0\n57869 33223 0 0\n57982 33109 0 0\n58044 32961 0 0\n58044 32800 0 0\n57983 32651 0 0\n57869 32538 0 0\n57721 32476 0 0\n57560 32476 0 0\n57411 32537 0 0\n57298 32651 0 0\n57248 32770 0 0\n53487 32770 0 0\n52500 31783 0 0\n52556 31650 0 0\n52556 31352 0 0\n52447 31090 0 0\n54334 31090 0 0\n54460 31216 0 0\n54405 31350 0 0\n54405 31648 0 0\n54519 31923 0 0\n54729 32134 0 0\n55004 32249 0 0\n55302 32249 0 0\n55577 32135 0 0\n55788 31925 0 0\n55903 31650 0 0\n55903 31352 0 0\n55789 31077 0 0\n55640 30928 0 0\n56008 30928 0 0\n56785 31705 0 0\n56879 31768 0 0\n56990 31790 0 0\n57809 31790 0 0\n57865 31923 0 0\n58075 32134 0 0\n58350 32249 0 0\n58648 32249 0 0\n58923 32135 0 0\n59134 31925 0 0\n59249 31650 0 0\n59249 33509 0 0\n59109 33451 0 0\n58891 33451 0 0\n58689 33535 0 0\n58535 33689 0 0\n58500 33773 0 0\n58465 33689 0 0\n58311 33535 0 0\n58109 33451 0 0\n57891 33451 0 0\n57689 33535 0 0\n57535 33689 0 0\n57500 33773 0 0\n57465 33689 0 0\n57311 33535 0 0\n57109 33451 0 0\n56891 33451 0 0\n56689 33535 0 0\n56535 33689 0 0\n56500 33773 0 0\n56465 33689 0 0\n56311 33535 0 0\n56109 33451 0 0\n55891 33451 0 0\n55689 33535 0 0\n55535 33689 0 0\n55451 33891 0 0\n55451 34109 0 0\n55459 34130 0 0\n55295 34295 0 0\n55232 34389 0 0\n55210 34500 0 0\n55210 35180 0 0\n55232 35291 0 0\n55295 35385 0 0\n55518 35608 0 0\n55518 38115 0 0\n55491 38127 0 0\n55378 38241 0 0\n55316 38389 0 0\n55316 38550 0 0\n55377 38699 0 0\n55491 38812 0 0\n55639 38874 0 0\n55800 38874 0 0\n55930 38820 0 0\n56056 38946 0 0\n56056 39020 0 0\n56117 39169 0 0\n56231 39282 0 0\n56379 39344 0 0\n56540 39344 0 0\n56689 39283 0 0\n56802 39169 0 0\n56864 39021 0 0\n56864 38961 0 0\n56909 38943 0 0\n57022 38829 0 0\n57084 38681 0 0\n57084 38606 0 0\n59705 35985 0 0\n59768 35891 0 0\n59790 35780 0 0\n59790 35507 0 0\n59891 35549 0 0\n60109 35549 0 0\n60311 35465 0 0\n60465 35311 0 0\n60500 35226 0 0\n60535 35311 0 0\n60689 35465 0 0\n60891 35549 0 0\n60909 35549 0 0\n62062 36702 0 0\n62062 39832 0 0\n61825 39595 0 0\n61731 39532 0 0\n61620 39510 0 0\n61539 39510 0 0\n61531 39489 0 0\n61461 39419 0 0\n61370 39381 0 0\n61271 39381 0 0\n60931 39381 0 0\n60850 39414 0 0\n60770 39381 0 0\n60671 39381 0 0\n60331 39381 0 0\n60239 39419 0 0\n60192 39465 0 0\n60181 39439 0 0\n60127 39385 0 0\n60140 39354 0 0\n60140 39242 0 0\n60140 39058 0 0\n60140 38946 0 0\n60114 38884 0 0\n60066 38836 0 0\n60004 38810 0 0\n59936 38810 0 0\n59892 38810 0 0\n59850 38852 0 0\n59850 39100 0 0\n60098 39100 0 0\n60140 39058 0 0\n60140 39242 0 0\n60098 39200 0 0\n59900 39200 0 0\n59850 39200 0 0\n59750 39200 0 0\n59750 39100 0 0\n59750 38852 0 0\n59708 38810 0 0\n59664 38810 0 0\n59596 38810 0 0\n59534 38836 0 0\n59486 38884 0 0\n59460 38946 0 0\n59460 39058 0 0\n59502 39100 0 0\n59750 39100 0 0\n59750 39200 0 0\n59700 39200 0 0\n59502 39200 0 0\n59460 39242 0 0\n59460 39354 0 0\n59473 39385 0 0\n59419 39439 0 0\n59410 39460 0 0\n58900 39460 0 0\n58789 39482 0 0\n58695 39545 0 0\n57775 40464 0 0\n56849 39539 0 0\n56755 39476 0 0\n56644 39454 0 0\n53950 39454 0 0\n53950 38564 0 0\n53950 38442 0 0\n53908 38400 0 0\n53650 38400 0 0\n53650 38658 0 0\n53692 38700 0 0\n53746 38700 0 0\n53814 38700 0 0\n53876 38674 0 0\n53924 38626 0 0\n53950 38564 0 0\n53950 39454 0 0\n53550 39454 0 0\n53550 38658 0 0\n53550 38400 0 0\n53292 38400 0 0\n53250 38442 0 0\n53250 38560 0 0\n53142 38560 0 0\n53100 38602 0 0\n53100 38850 0 0\n53348 38850 0 0\n53390 38808 0 0\n53390 38764 0 0\n53390 38700 0 0\n53454 38700 0 0\n53508 38700 0 0\n53550 38658 0 0\n53550 39454 0 0\n53390 39454 0 0\n53390 39104 0 0\n53390 39036 0 0\n53390 38992 0 0\n53348 38950 0 0\n53100 38950 0 0\n53100 39198 0 0\n53142 39240 0 0\n53254 39240 0 0\n53316 39214 0 0\n53364 39166 0 0\n53390 39104 0 0\n53390 39454 0 0\n53000 39454 0 0\n53000 39198 0 0\n53000 39000 0 0\n53000 38950 0 0\n53000 38850 0 0\n53000 38800 0 0\n53000 38602 0 0\n52958 38560 0 0\n52846 38560 0 0\n52815 38573 0 0\n52761 38519 0 0\n52670 38481 0 0\n52571 38481 0 0\n52231 38481 0 0\n52210 38489 0 0\n52092 38440 0 0\n51909 38440 0 0\n51740 38510 0 0\n51610 38639 0 0\n51540 38808 0 0\n51540 38991 0 0\n51610 39160 0 0\n51739 39290 0 0\n51908 39360 0 0\n52091 39360 0 0\n52210 39310 0 0\n52230 39319 0 0\n52329 39319 0 0\n52669 39319 0 0\n52761 39281 0 0\n52815 39227 0 0\n52846 39240 0 0\n52958 39240 0 0\n53000 39198 0 0\n53000 39454 0 0\n49113 39454 0 0\n50417 38150 0 0\n52610 38150 0 0\n52801 38112 0 0\n52964 38004 0 0\n53072 37841 0 0\n53109 37653 0 0\n53171 37715 0 0\n53171 37879 0 0\n53209 37971 0 0\n53279 38041 0 0\n53300 38049 0 0\n53276 38074 0 0\n53250 38136 0 0\n53250 38258 0 0\n53292 38300 0 0\n53500 38300 0 0\n53550 38300 0 0\n53650 38300 0 0\n53700 38300 0 0\n53908 38300 0 0\n53950 38258 0 0\n53950 38136 0 0\n53924 38074 0 0\n53899 38049 0 0\n53921 38041 0 0\n53971 37991 0 0\n53971 38229 0 0\n54009 38321 0 0\n54079 38391 0 0\n54170 38429 0 0\n54269 38429 0 0\n54629 38429 0 0\n54656 38417 0 0\n54758 38460 0 0\n54941 38460 0 0\n55110 38390 0 0\n55240 38261 0 0\n55310 38092 0 0\n55310 37909 0 0\n55240 37740 0 0\n55111 37610 0 0\n54942 37540 0 0\n54759 37540 0 0\n54656 37582 0 0\n54630 37571 0 0\n54531 37571 0 0\n54171 37571 0 0\n54079 37609 0 0\n54029 37659 0 0\n54029 37421 0 0\n53991 37329 0 0\n53921 37259 0 0\n53830 37221 0 0\n53731 37221 0 0\n53665 37221 0 0\n53469 37024 0 0\n53469 36881 0 0\n53431 36789 0 0\n53361 36719 0 0\n53270 36681 0 0\n53171 36681 0 0\n52910 36681 0 0\n52910 36559 0 0\n52840 36390 0 0\n52711 36260 0 0\n52542 36190 0 0\n52359 36190 0 0\n52190 36260 0 0\n52060 36389 0 0\n51990 36558 0 0\n51990 36741 0 0\n52039 36860 0 0\n52031 36880 0 0\n52031 36979 0 0\n52031 37150 0 0\n51549 37150 0 0\n51549 35109 0 0\n51549 34891 0 0\n51465 34689 0 0\n51465 34061 0 0\n51453 33878 0 0\n51407 33766 0 0\n51336 33735 0 0\n51265 33806 0 0\n51265 33664 0 0\n51234 33593 0 0\n51061 33535 0 0\n50878 33547 0 0\n50766 33593 0 0\n50735 33664 0 0\n51000 33929 0 0\n51265 33664 0 0\n51265 33806 0 0\n51071 34000 0 0\n51336 34265 0 0\n51407 34234 0 0\n51465 34061 0 0\n51465 34689 0 0\n51311 34535 0 0\n51114 34453 0 0\n51122 34453 0 0\n51234 34407 0 0\n51265 34336 0 0\n51000 34071 0 0\n50929 34142 0 0\n50929 34000 0 0\n50664 33735 0 0\n50593 33766 0 0\n50535 33939 0 0\n50547 34122 0 0\n50593 34234 0 0\n50664 34265 0 0\n50929 34000 0 0\n50929 34142 0 0\n50735 34336 0 0\n50766 34407 0 0\n50897 34451 0 0\n50891 34451 0 0\n50689 34535 0 0\n50535 34689 0 0\n50500 34773 0 0\n50465 34689 0 0\n50465 34061 0 0\n50453 33878 0 0\n50407 33766 0 0\n50336 33735 0 0\n50265 33806 0 0\n50265 33664 0 0\n50234 33593 0 0\n50061 33535 0 0\n49878 33547 0 0\n49766 33593 0 0\n49735 33664 0 0\n50000 33929 0 0\n50265 33664 0 0\n50265 33806 0 0\n50071 34000 0 0\n50336 34265 0 0\n50407 34234 0 0\n50465 34061 0 0\n50465 34689 0 0\n50311 34535 0 0\n50114 34453 0 0\n50122 34453 0 0\n50234 34407 0 0\n50265 34336 0 0\n50000 34071 0 0\n49929 34142 0 0\n49929 34000 0 0\n49664 33735 0 0\n49593 33766 0 0\n49535 33939 0 0\n49547 34122 0 0\n49593 34234 0 0\n49664 34265 0 0\n49929 34000 0 0\n49929 34142 0 0\n49735 34336 0 0\n49766 34407 0 0\n49897 34451 0 0\n49891 34451 0 0\n49689 34535 0 0\n49549 34675 0 0\n49549 34651 0 0\n49511 34559 0 0\n49465 34513 0 0\n49465 34061 0 0\n49453 33878 0 0\n49407 33766 0 0\n49336 33735 0 0\n49265 33806 0 0\n49265 33664 0 0\n49234 33593 0 0\n49061 33535 0 0\n48878 33547 0 0\n48766 33593 0 0\n48735 33664 0 0\n49000 33929 0 0\n49265 33664 0 0\n49265 33806 0 0\n49071 34000 0 0\n49336 34265 0 0\n49407 34234 0 0\n49465 34061 0 0\n49465 34513 0 0\n49441 34489 0 0\n49350 34451 0 0\n49251 34451 0 0\n49126 34451 0 0\n49234 34407 0 0\n49265 34336 0 0\n49000 34071 0 0\n48929 34142 0 0\n48929 34000 0 0\n48664 33735 0 0\n48593 33766 0 0\n48535 33939 0 0\n48547 34122 0 0\n48593 34234 0 0\n48664 34265 0 0\n48929 34000 0 0\n48929 34142 0 0\n48735 34336 0 0\n48766 34407 0 0\n48897 34451 0 0\n48651 34451 0 0\n48559 34489 0 0\n48489 34559 0 0\n48451 34650 0 0\n48451 34749 0 0\n48451 35349 0 0\n48489 35441 0 0\n48559 35511 0 0\n48650 35549 0 0\n48749 35549 0 0\n49349 35549 0 0\n49441 35511 0 0\n49511 35441 0 0\n49549 35350 0 0\n49549 35325 0 0\n49689 35465 0 0\n49891 35549 0 0\n50109 35549 0 0\n50311 35465 0 0\n50465 35311 0 0\n50500 35226 0 0\n50535 35311 0 0\n50689 35465 0 0\n50891 35549 0 0\n51109 35549 0 0\n51311 35465 0 0\n51465 35311 0 0\n51549 35109 0 0\n51549 37150 0 0\n50210 37150 0 0\n50018 37188 0 0\n49953 37231 0 0\n49856 37296 0 0\n49854 37298 0 0\n48374 38778 0 0\n48374 38416 0 0\n48336 38324 0 0\n48266 38254 0 0\n48175 38216 0 0\n48076 38216 0 0\n47506 38216 0 0\n47503 38216 0 0\n47502 38216 0 0\n47403 38216 0 0\n47153 38216 0 0\n47061 38254 0 0\n46991 38324 0 0\n46978 38353 0 0\n46784 38353 0 0\n46782 38352 0 0\n46557 38352 0 0\n46554 38353 0 0\n46550 38353 0 0\n46550 21550 0 0\n70450 21550 0 0\n70450 44750 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660000 0 \"\"\nZLayer 20\nZAux 1822 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 53880 25026 0\nZCorner 53881 24994 0\nZCorner 53882 24962 0\nZCorner 53883 24929 0\nZCorner 53884 24897 0\nZCorner 53888 24888 0\nZCorner 53892 24880 0\nZCorner 53896 24871 0\nZCorner 53900 24862 0\nZCorner 53902 24858 0\nZCorner 53905 24854 0\nZCorner 53908 24850 0\nZCorner 53911 24846 0\nZCorner 53575 24846 0\nZCorner 53239 24846 0\nZCorner 52904 24846 0\nZCorner 52568 24846 0\nZCorner 52511 24915 0\nZCorner 52470 24957 0\nZCorner 52443 24971 0\nZCorner 52431 24956 0\nZCorner 51693 24956 0\nZCorner 50955 24956 0\nZCorner 50217 24956 0\nZCorner 49479 24956 0\nZCorner 49476 24977 0\nZCorner 49454 24953 0\nZCorner 49414 24885 0\nZCorner 49354 24772 0\nZCorner 50503 24772 0\nZCorner 51652 24772 0\nZCorner 52801 24772 0\nZCorner 53950 24772 0\nZCorner 54025 24660 0\nZCorner 54102 24581 0\nZCorner 54182 24536 0\nZCorner 54263 24522 0\nZCorner 54587 24523 0\nZCorner 54911 24524 0\nZCorner 55235 24525 0\nZCorner 55559 24526 0\nZCorner 55573 24531 0\nZCorner 55587 24536 0\nZCorner 55600 24541 0\nZCorner 55614 24546 0\nZCorner 55619 24552 0\nZCorner 55624 24558 0\nZCorner 55629 24563 0\nZCorner 55634 24569 0\nZCorner 55638 24575 0\nZCorner 55641 24581 0\nZCorner 55645 24587 0\nZCorner 55649 24593 0\nZCorner 55651 24601 0\nZCorner 55653 24610 0\nZCorner 55655 24619 0\nZCorner 55657 24628 0\nZCorner 55667 24624 0\nZCorner 55677 24620 0\nZCorner 55686 24616 0\nZCorner 55696 24612 0\nZCorner 55746 24592 0\nZCorner 55796 24571 0\nZCorner 55846 24551 0\nZCorner 55895 24530 0\nZCorner 55983 24522 0\nZCorner 56071 24514 0\nZCorner 56159 24507 0\nZCorner 56247 24499 0\nZCorner 56180 24449 0\nZCorner 56112 24399 0\nZCorner 56045 24349 0\nZCorner 55977 24300 0\nZCorner 56010 24244 0\nZCorner 56042 24188 0\nZCorner 56074 24133 0\nZCorner 56106 24077 0\nZCorner 56212 24129 0\nZCorner 56317 24180 0\nZCorner 56423 24232 0\nZCorner 56528 24284 0\nZCorner 56527 24285 0\nZCorner 56526 24286 0\nZCorner 56525 24287 0\nZCorner 56524 24288 0\nZCorner 56526 24287 0\nZCorner 56528 24286 0\nZCorner 56530 24285 0\nZCorner 56532 24284 0\nZCorner 56567 24237 0\nZCorner 56602 24190 0\nZCorner 56637 24143 0\nZCorner 56672 24096 0\nZCorner 56598 24007 0\nZCorner 56524 23917 0\nZCorner 56450 23827 0\nZCorner 56376 23737 0\nZCorner 56422 23692 0\nZCorner 56467 23647 0\nZCorner 56513 23602 0\nZCorner 56559 23557 0\nZCorner 56649 23632 0\nZCorner 56739 23706 0\nZCorner 56829 23780 0\nZCorner 56918 23854 0\nZCorner 56964 23819 0\nZCorner 57010 23784 0\nZCorner 57056 23749 0\nZCorner 57102 23714 0\nZCorner 57052 23609 0\nZCorner 57003 23505 0\nZCorner 56953 23400 0\nZCorner 56903 23296 0\nZCorner 56957 23262 0\nZCorner 57010 23227 0\nZCorner 57064 23193 0\nZCorner 57118 23159 0\nZCorner 57188 23252 0\nZCorner 57258 23345 0\nZCorner 57328 23437 0\nZCorner 57399 23530 0\nZCorner 57451 23508 0\nZCorner 57504 23485 0\nZCorner 57557 23463 0\nZCorner 57610 23440 0\nZCorner 57585 23326 0\nZCorner 57561 23212 0\nZCorner 57537 23098 0\nZCorner 57512 22983 0\nZCorner 57575 22964 0\nZCorner 57637 22944 0\nZCorner 57700 22925 0\nZCorner 57762 22905 0\nZCorner 57807 23013 0\nZCorner 57852 23120 0\nZCorner 57897 23227 0\nZCorner 57942 23335 0\nZCorner 57999 23325 0\nZCorner 58055 23315 0\nZCorner 58112 23305 0\nZCorner 58168 23296 0\nZCorner 58171 23179 0\nZCorner 58174 23061 0\nZCorner 58177 22944 0\nZCorner 58180 22827 0\nZCorner 58246 22823 0\nZCorner 58313 22819 0\nZCorner 58379 22815 0\nZCorner 58445 22811 0\nZCorner 58463 22928 0\nZCorner 58481 23044 0\nZCorner 58498 23160 0\nZCorner 58516 23276 0\nZCorner 58573 23278 0\nZCorner 58631 23280 0\nZCorner 58689 23282 0\nZCorner 58746 23284 0\nZCorner 58777 23177 0\nZCorner 58807 23069 0\nZCorner 58837 22962 0\nZCorner 58878 22839 0\nZCorner 58972 22853 0\nZCorner 59125 22882 0\nZCorner 59115 22999 0\nZCorner 59105 23116 0\nZCorner 59096 23233 0\nZCorner 59086 23350 0\nZCorner 59141 23367 0\nZCorner 59195 23383 0\nZCorner 59250 23400 0\nZCorner 59305 23417 0\nZCorner 59306 23418 0\nZCorner 59306 23419 0\nZCorner 59307 23420 0\nZCorner 59308 23421 0\nZCorner 59308 23420 0\nZCorner 59308 23419 0\nZCorner 59308 23418 0\nZCorner 59308 23417 0\nZCorner 59365 23315 0\nZCorner 59422 23214 0\nZCorner 59478 23112 0\nZCorner 59535 23010 0\nZCorner 59595 23037 0\nZCorner 59654 23063 0\nZCorner 59714 23090 0\nZCorner 59773 23116 0\nZCorner 59735 23227 0\nZCorner 59697 23338 0\nZCorner 59659 23450 0\nZCorner 59621 23561 0\nZCorner 59671 23590 0\nZCorner 59720 23620 0\nZCorner 59770 23649 0\nZCorner 59820 23678 0\nZCorner 59899 23594 0\nZCorner 59978 23510 0\nZCorner 60057 23426 0\nZCorner 60136 23342 0\nZCorner 60188 23381 0\nZCorner 60240 23420 0\nZCorner 60292 23460 0\nZCorner 60343 23499 0\nZCorner 60281 23597 0\nZCorner 60218 23696 0\nZCorner 60156 23794 0\nZCorner 60093 23893 0\nZCorner 60133 23934 0\nZCorner 60174 23975 0\nZCorner 60214 24016 0\nZCorner 60254 24057 0\nZCorner 60353 23994 0\nZCorner 60453 23930 0\nZCorner 60552 23867 0\nZCorner 60652 23803 0\nZCorner 60692 23853 0\nZCorner 60732 23903 0\nZCorner 60772 23953 0\nZCorner 60812 24003 0\nZCorner 60726 24084 0\nZCorner 60640 24165 0\nZCorner 60554 24246 0\nZCorner 60468 24327 0\nZCorner 60499 24376 0\nZCorner 60529 24426 0\nZCorner 60559 24476 0\nZCorner 60589 24526 0\nZCorner 60589 24529 0\nZCorner 60589 24532 0\nZCorner 60589 24535 0\nZCorner 60589 24538 0\nZCorner 60590 24538 0\nZCorner 60591 24538 0\nZCorner 60592 24538 0\nZCorner 60593 24538 0\nZCorner 60592 24535 0\nZCorner 60591 24532 0\nZCorner 60590 24529 0\nZCorner 60589 24526 0\nZCorner 60699 24488 0\nZCorner 60808 24450 0\nZCorner 60917 24412 0\nZCorner 61039 24379 0\nZCorner 61062 24431 0\nZCorner 61097 24514 0\nZCorner 61418 24495 0\nZCorner 61666 24497 0\nZCorner 61841 24519 0\nZCorner 61945 24561 0\nZCorner 61962 24569 0\nZCorner 61980 24577 0\nZCorner 61997 24584 0\nZCorner 62015 24592 0\nZCorner 62016 24564 0\nZCorner 62017 24536 0\nZCorner 62018 24507 0\nZCorner 62019 24479 0\nZCorner 62020 24466 0\nZCorner 62021 24454 0\nZCorner 62022 24441 0\nZCorner 62023 24428 0\nZCorner 62026 24416 0\nZCorner 62028 24405 0\nZCorner 62031 24393 0\nZCorner 62034 24381 0\nZCorner 62039 24373 0\nZCorner 62044 24364 0\nZCorner 62049 24355 0\nZCorner 62054 24346 0\nZCorner 62064 24337 0\nZCorner 62073 24329 0\nZCorner 62083 24320 0\nZCorner 62093 24311 0\nZCorner 62099 24308 0\nZCorner 62105 24305 0\nZCorner 62110 24302 0\nZCorner 62116 24299 0\nZCorner 62120 24296 0\nZCorner 62124 24294 0\nZCorner 62128 24291 0\nZCorner 62132 24288 0\nZCorner 62199 24278 0\nZCorner 62366 24274 0\nZCorner 62633 24276 0\nZCorner 62999 24284 0\nZCorner 63047 24298 0\nZCorner 63082 24356 0\nZCorner 63102 24458 0\nZCorner 63108 24604 0\nZCorner 63108 24609 0\nZCorner 63108 24614 0\nZCorner 63108 24619 0\nZCorner 63108 24623 0\nZCorner 63121 24629 0\nZCorner 63134 24635 0\nZCorner 63146 24641 0\nZCorner 63159 24647 0\nZCorner 63167 24655 0\nZCorner 63175 24663 0\nZCorner 63183 24670 0\nZCorner 63190 24678 0\nZCorner 63199 24702 0\nZCorner 63208 24725 0\nZCorner 63217 24748 0\nZCorner 63225 24772 0\nZCorner 64322 24772 0\nZCorner 65418 24772 0\nZCorner 66515 24772 0\nZCorner 67611 24772 0\nZCorner 67554 24885 0\nZCorner 67515 24953 0\nZCorner 67495 24977 0\nZCorner 67494 24955 0\nZCorner 67421 24967 0\nZCorner 67348 24974 0\nZCorner 67276 24976 0\nZCorner 67205 24975 0\nZCorner 66500 24975 0\nZCorner 65794 24975 0\nZCorner 65088 24975 0\nZCorner 64382 24975 0\nZCorner 64356 24947 0\nZCorner 64331 24918 0\nZCorner 64306 24890 0\nZCorner 64280 24862 0\nZCorner 64020 24862 0\nZCorner 63759 24862 0\nZCorner 63498 24862 0\nZCorner 63237 24862 0\nZCorner 63238 24888 0\nZCorner 63239 24914 0\nZCorner 63240 24941 0\nZCorner 63241 24967 0\nZCorner 63238 24982 0\nZCorner 63235 24997 0\nZCorner 63233 25011 0\nZCorner 63230 25026 0\nZCorner 64353 25026 0\nZCorner 65477 25026 0\nZCorner 66601 25026 0\nZCorner 67725 25026 0\nZCorner 67756 25022 0\nZCorner 67732 25070 0\nZCorner 67653 25170 0\nZCorner 67522 25323 0\nZCorner 67516 25341 0\nZCorner 67510 25360 0\nZCorner 67504 25378 0\nZCorner 67498 25397 0\nZCorner 66476 25398 0\nZCorner 65454 25399 0\nZCorner 64432 25400 0\nZCorner 63409 25401 0\nZCorner 63333 25400 0\nZCorner 63257 25399 0\nZCorner 63181 25398 0\nZCorner 63105 25397 0\nZCorner 63105 25399 0\nZCorner 63105 25401 0\nZCorner 63105 25403 0\nZCorner 63105 25405 0\nZCorner 63105 25447 0\nZCorner 63105 25490 0\nZCorner 63105 25533 0\nZCorner 63105 25576 0\nZCorner 64187 25576 0\nZCorner 65270 25576 0\nZCorner 66353 25576 0\nZCorner 67436 25576 0\nZCorner 67372 25652 0\nZCorner 67309 25727 0\nZCorner 67245 25802 0\nZCorner 67182 25877 0\nZCorner 67175 25949 0\nZCorner 67161 26012 0\nZCorner 67140 26068 0\nZCorner 67111 26115 0\nZCorner 67090 26139 0\nZCorner 67067 26157 0\nZCorner 67042 26170 0\nZCorner 67014 26178 0\nZCorner 66981 26180 0\nZCorner 66948 26182 0\nZCorner 66914 26184 0\nZCorner 66881 26185 0\nZCorner 66873 26185 0\nZCorner 66865 26184 0\nZCorner 66858 26183 0\nZCorner 66850 26182 0\nZCorner 66837 26178 0\nZCorner 66824 26174 0\nZCorner 66812 26170 0\nZCorner 66799 26166 0\nZCorner 66791 26160 0\nZCorner 66784 26154 0\nZCorner 66776 26148 0\nZCorner 66768 26143 0\nZCorner 66761 26137 0\nZCorner 66754 26131 0\nZCorner 66747 26125 0\nZCorner 66741 26119 0\nZCorner 66732 26114 0\nZCorner 66723 26109 0\nZCorner 66714 26105 0\nZCorner 66705 26100 0\nZCorner 66692 26095 0\nZCorner 66678 26090 0\nZCorner 66664 26085 0\nZCorner 66651 26080 0\nZCorner 66627 26080 0\nZCorner 66604 26080 0\nZCorner 66580 26080 0\nZCorner 66557 26080 0\nZCorner 66548 26081 0\nZCorner 66539 26082 0\nZCorner 66531 26083 0\nZCorner 66522 26084 0\nZCorner 66508 26088 0\nZCorner 66495 26092 0\nZCorner 66481 26096 0\nZCorner 66467 26100 0\nZCorner 66455 26109 0\nZCorner 66442 26119 0\nZCorner 66429 26129 0\nZCorner 66416 26139 0\nZCorner 66373 26195 0\nZCorner 66329 26252 0\nZCorner 66285 26309 0\nZCorner 66241 26365 0\nZCorner 66222 26384 0\nZCorner 66193 26400 0\nZCorner 66156 26412 0\nZCorner 66108 26420 0\nZCorner 66103 26419 0\nZCorner 66098 26418 0\nZCorner 66093 26417 0\nZCorner 66088 26416 0\nZCorner 66087 26416 0\nZCorner 66086 26416 0\nZCorner 66085 26416 0\nZCorner 66084 26416 0\nZCorner 66073 26413 0\nZCorner 66061 26410 0\nZCorner 66049 26407 0\nZCorner 66038 26404 0\nZCorner 66024 26395 0\nZCorner 66010 26385 0\nZCorner 65997 26375 0\nZCorner 65983 26365 0\nZCorner 65968 26351 0\nZCorner 65954 26336 0\nZCorner 65939 26321 0\nZCorner 65924 26307 0\nZCorner 65912 26292 0\nZCorner 65899 26277 0\nZCorner 65886 26263 0\nZCorner 65874 26248 0\nZCorner 65860 26234 0\nZCorner 65846 26221 0\nZCorner 65833 26207 0\nZCorner 65819 26193 0\nZCorner 65816 26192 0\nZCorner 65813 26191 0\nZCorner 65810 26190 0\nZCorner 65807 26189 0\nZCorner 65792 26180 0\nZCorner 65776 26170 0\nZCorner 65760 26160 0\nZCorner 65745 26150 0\nZCorner 65738 26150 0\nZCorner 65731 26150 0\nZCorner 65724 26150 0\nZCorner 65717 26150 0\nZCorner 65705 26147 0\nZCorner 65692 26144 0\nZCorner 65679 26142 0\nZCorner 65667 26139 0\nZCorner 65653 26141 0\nZCorner 65639 26143 0\nZCorner 65626 26145 0\nZCorner 65612 26146 0\nZCorner 65609 26146 0\nZCorner 65606 26146 0\nZCorner 65603 26146 0\nZCorner 65600 26146 0\nZCorner 65577 26151 0\nZCorner 65553 26156 0\nZCorner 65530 26161 0\nZCorner 65507 26166 0\nZCorner 65493 26174 0\nZCorner 65479 26182 0\nZCorner 65465 26189 0\nZCorner 65452 26197 0\nZCorner 65429 26220 0\nZCorner 65407 26242 0\nZCorner 65384 26265 0\nZCorner 65362 26287 0\nZCorner 65304 26395 0\nZCorner 65254 26475 0\nZCorner 65212 26526 0\nZCorner 65178 26549 0\nZCorner 65135 26550 0\nZCorner 65092 26551 0\nZCorner 65049 26552 0\nZCorner 65006 26553 0\nZCorner 65000 26550 0\nZCorner 64993 26547 0\nZCorner 64986 26544 0\nZCorner 64979 26541 0\nZCorner 64968 26535 0\nZCorner 64958 26528 0\nZCorner 64947 26521 0\nZCorner 64936 26514 0\nZCorner 64926 26501 0\nZCorner 64917 26489 0\nZCorner 64907 26476 0\nZCorner 64897 26463 0\nZCorner 64884 26444 0\nZCorner 64872 26424 0\nZCorner 64859 26405 0\nZCorner 64846 26385 0\nZCorner 64832 26366 0\nZCorner 64817 26346 0\nZCorner 64802 26327 0\nZCorner 64788 26307 0\nZCorner 64774 26292 0\nZCorner 64760 26276 0\nZCorner 64747 26260 0\nZCorner 64733 26245 0\nZCorner 64716 26234 0\nZCorner 64700 26223 0\nZCorner 64683 26212 0\nZCorner 64667 26202 0\nZCorner 64665 26200 0\nZCorner 64663 26198 0\nZCorner 64661 26196 0\nZCorner 64659 26194 0\nZCorner 64640 26188 0\nZCorner 64622 26182 0\nZCorner 64603 26176 0\nZCorner 64585 26170 0\nZCorner 64567 26168 0\nZCorner 64550 26165 0\nZCorner 64532 26162 0\nZCorner 64514 26159 0\nZCorner 64512 26158 0\nZCorner 64509 26157 0\nZCorner 64506 26156 0\nZCorner 64503 26155 0\nZCorner 64496 26155 0\nZCorner 64489 26155 0\nZCorner 64482 26155 0\nZCorner 64475 26155 0\nZCorner 64450 26153 0\nZCorner 64425 26151 0\nZCorner 64399 26149 0\nZCorner 64374 26147 0\nZCorner 64341 26148 0\nZCorner 64307 26149 0\nZCorner 64274 26150 0\nZCorner 64241 26151 0\nZCorner 64133 26182 0\nZCorner 64048 26227 0\nZCorner 63988 26286 0\nZCorner 63952 26358 0\nZCorner 63738 26358 0\nZCorner 63524 26358 0\nZCorner 63311 26358 0\nZCorner 63097 26358 0\nZCorner 63097 26370 0\nZCorner 63097 26381 0\nZCorner 63097 26393 0\nZCorner 63097 26405 0\nZCorner 63097 26407 0\nZCorner 63097 26409 0\nZCorner 63097 26411 0\nZCorner 63097 26413 0\nZCorner 63287 26413 0\nZCorner 63477 26413 0\nZCorner 63668 26413 0\nZCorner 63858 26413 0\nZCorner 63890 26405 0\nZCorner 63888 26442 0\nZCorner 63851 26522 0\nZCorner 63780 26647 0\nZCorner 63600 26647 0\nZCorner 63421 26647 0\nZCorner 63241 26647 0\nZCorner 63061 26647 0\nZCorner 62985 26755 0\nZCorner 62900 26838 0\nZCorner 62809 26897 0\nZCorner 62710 26932 0\nZCorner 62684 26941 0\nZCorner 62623 26949 0\nZCorner 62527 26955 0\nZCorner 62398 26959 0\nZCorner 62294 26957 0\nZCorner 62191 26955 0\nZCorner 62087 26953 0\nZCorner 61984 26951 0\nZCorner 61984 26924 0\nZCorner 61984 26897 0\nZCorner 61984 26869 0\nZCorner 61984 26842 0\nZCorner 61966 26851 0\nZCorner 61949 26860 0\nZCorner 61931 26868 0\nZCorner 61913 26877 0\nZCorner 61857 26900 0\nZCorner 61789 26920 0\nZCorner 61710 26938 0\nZCorner 61621 26951 0\nZCorner 61540 26954 0\nZCorner 61458 26957 0\nZCorner 61377 26960 0\nZCorner 61296 26963 0\nZCorner 61242 26956 0\nZCorner 61187 26950 0\nZCorner 61132 26943 0\nZCorner 61078 26936 0\nZCorner 60958 26885 0\nZCorner 60866 26856 0\nZCorner 60804 26848 0\nZCorner 60769 26862 0\nZCorner 60826 26903 0\nZCorner 60883 26944 0\nZCorner 60939 26985 0\nZCorner 60996 27026 0\nZCorner 60964 27081 0\nZCorner 60931 27137 0\nZCorner 60899 27192 0\nZCorner 60867 27248 0\nZCorner 60760 27197 0\nZCorner 60654 27147 0\nZCorner 60548 27096 0\nZCorner 60441 27045 0\nZCorner 60406 27092 0\nZCorner 60371 27139 0\nZCorner 60336 27186 0\nZCorner 60301 27232 0\nZCorner 60375 27323 0\nZCorner 60449 27414 0\nZCorner 60523 27505 0\nZCorner 60597 27596 0\nZCorner 60551 27640 0\nZCorner 60506 27685 0\nZCorner 60460 27730 0\nZCorner 60414 27775 0\nZCorner 60323 27700 0\nZCorner 60232 27625 0\nZCorner 60141 27550 0\nZCorner 60050 27475 0\nZCorner 60006 27511 0\nZCorner 59961 27547 0\nZCorner 59916 27583 0\nZCorner 59871 27619 0\nZCorner 59922 27724 0\nZCorner 59972 27830 0\nZCorner 60023 27935 0\nZCorner 60074 28041 0\nZCorner 60017 28074 0\nZCorner 59961 28107 0\nZCorner 59904 28140 0\nZCorner 59847 28174 0\nZCorner 59781 28082 0\nZCorner 59715 27990 0\nZCorner 59648 27898 0\nZCorner 59582 27806 0\nZCorner 59580 27805 0\nZCorner 59578 27803 0\nZCorner 59576 27801 0\nZCorner 59574 27799 0\nZCorner 59521 27822 0\nZCorner 59469 27846 0\nZCorner 59416 27869 0\nZCorner 59363 27892 0\nZCorner 59387 28007 0\nZCorner 59410 28121 0\nZCorner 59434 28235 0\nZCorner 59457 28349 0\nZCorner 59394 28369 0\nZCorner 59332 28388 0\nZCorner 59270 28408 0\nZCorner 59207 28427 0\nZCorner 59164 28320 0\nZCorner 59121 28213 0\nZCorner 59078 28105 0\nZCorner 59035 27998 0\nZCorner 58978 28008 0\nZCorner 58920 28019 0\nZCorner 58862 28030 0\nZCorner 58805 28041 0\nZCorner 58801 28157 0\nZCorner 58797 28273 0\nZCorner 58793 28389 0\nZCorner 58789 28506 0\nZCorner 58723 28509 0\nZCorner 58656 28513 0\nZCorner 58590 28517 0\nZCorner 58524 28521 0\nZCorner 58507 28405 0\nZCorner 58490 28289 0\nZCorner 58474 28172 0\nZCorner 58457 28056 0\nZCorner 58400 28053 0\nZCorner 58342 28050 0\nZCorner 58284 28048 0\nZCorner 58227 28045 0\nZCorner 58195 28157 0\nZCorner 58162 28269 0\nZCorner 58130 28382 0\nZCorner 58098 28494 0\nZCorner 58034 28483 0\nZCorner 57969 28472 0\nZCorner 57905 28461 0\nZCorner 57840 28451 0\nZCorner 57851 28334 0\nZCorner 57862 28216 0\nZCorner 57872 28099 0\nZCorner 57883 27982 0\nZCorner 57828 27965 0\nZCorner 57774 27947 0\nZCorner 57719 27929 0\nZCorner 57664 27912 0\nZCorner 57608 28012 0\nZCorner 57551 28113 0\nZCorner 57494 28214 0\nZCorner 57438 28314 0\nZCorner 57437 28322 0\nZCorner 57416 28317 0\nZCorner 57374 28299 0\nZCorner 57309 28267 0\nZCorner 57279 28257 0\nZCorner 57248 28246 0\nZCorner 57218 28235 0\nZCorner 57188 28224 0\nZCorner 57209 28159 0\nZCorner 57243 28062 0\nZCorner 57288 27933 0\nZCorner 57344 27771 0\nZCorner 57295 27742 0\nZCorner 57247 27713 0\nZCorner 57198 27684 0\nZCorner 57149 27654 0\nZCorner 57070 27736 0\nZCorner 56991 27818 0\nZCorner 56912 27900 0\nZCorner 56833 27982 0\nZCorner 56793 27962 0\nZCorner 56745 27930 0\nZCorner 56688 27887 0\nZCorner 56622 27834 0\nZCorner 56685 27736 0\nZCorner 56749 27639 0\nZCorner 56812 27541 0\nZCorner 56876 27443 0\nZCorner 56878 27444 0\nZCorner 56880 27445 0\nZCorner 56882 27446 0\nZCorner 56884 27447 0\nZCorner 56883 27446 0\nZCorner 56882 27445 0\nZCorner 56880 27444 0\nZCorner 56879 27443 0\nZCorner 56837 27400 0\nZCorner 56794 27358 0\nZCorner 56751 27315 0\nZCorner 56708 27272 0\nZCorner 56610 27337 0\nZCorner 56513 27402 0\nZCorner 56415 27468 0\nZCorner 56317 27533 0\nZCorner 56294 27503 0\nZCorner 56260 27459 0\nZCorner 56215 27399 0\nZCorner 56161 27322 0\nZCorner 56245 27244 0\nZCorner 56329 27166 0\nZCorner 56413 27088 0\nZCorner 56497 27010 0\nZCorner 56487 26991 0\nZCorner 56477 26973 0\nZCorner 56468 26954 0\nZCorner 56458 26936 0\nZCorner 56326 26939 0\nZCorner 56194 26942 0\nZCorner 56063 26945 0\nZCorner 55931 26947 0\nZCorner 55905 26944 0\nZCorner 55880 26940 0\nZCorner 55855 26936 0\nZCorner 55829 26932 0\nZCorner 55819 26926 0\nZCorner 55810 26920 0\nZCorner 55800 26914 0\nZCorner 55790 26908 0\nZCorner 55769 26884 0\nZCorner 55747 26860 0\nZCorner 55726 26835 0\nZCorner 55704 26811 0\nZCorner 55684 26799 0\nZCorner 55663 26787 0\nZCorner 55643 26776 0\nZCorner 55622 26764 0\nZCorner 55618 26778 0\nZCorner 55614 26791 0\nZCorner 55611 26805 0\nZCorner 55607 26819 0\nZCorner 55601 26830 0\nZCorner 55595 26842 0\nZCorner 55589 26854 0\nZCorner 55583 26865 0\nZCorner 55577 26872 0\nZCorner 55571 26879 0\nZCorner 55566 26886 0\nZCorner 55560 26893 0\nZCorner 55555 26897 0\nZCorner 55550 26901 0\nZCorner 55545 26905 0\nZCorner 55540 26908 0\nZCorner 55545 26918 0\nZCorner 55507 26924 0\nZCorner 55425 26925 0\nZCorner 55298 26924 0\nZCorner 54989 26923 0\nZCorner 54679 26922 0\nZCorner 54369 26921 0\nZCorner 54060 26920 0\nZCorner 53960 26863 0\nZCorner 53895 26798 0\nZCorner 53863 26726 0\nZCorner 53865 26647 0\nZCorner 53696 26647 0\nZCorner 53527 26647 0\nZCorner 53358 26647 0\nZCorner 53189 26647 0\nZCorner 53123 26536 0\nZCorner 53089 26459 0\nZCorner 53085 26418 0\nZCorner 53111 26413 0\nZCorner 53300 26413 0\nZCorner 53490 26413 0\nZCorner 53679 26413 0\nZCorner 53869 26413 0\nZCorner 53869 26411 0\nZCorner 53869 26409 0\nZCorner 53869 26407 0\nZCorner 53869 26405 0\nZCorner 53869 26393 0\nZCorner 53869 26381 0\nZCorner 53869 26370 0\nZCorner 53869 26358 0\nZCorner 53654 26358 0\nZCorner 53439 26358 0\nZCorner 53224 26358 0\nZCorner 53010 26358 0\nZCorner 52953 26259 0\nZCorner 52866 26191 0\nZCorner 52747 26154 0\nZCorner 52596 26147 0\nZCorner 52570 26149 0\nZCorner 52545 26151 0\nZCorner 52519 26153 0\nZCorner 52494 26155 0\nZCorner 52487 26155 0\nZCorner 52480 26155 0\nZCorner 52474 26155 0\nZCorner 52467 26155 0\nZCorner 52464 26156 0\nZCorner 52461 26157 0\nZCorner 52458 26158 0\nZCorner 52455 26159 0\nZCorner 52437 26162 0\nZCorner 52420 26165 0\nZCorner 52402 26168 0\nZCorner 52385 26170 0\nZCorner 52367 26176 0\nZCorner 52350 26182 0\nZCorner 52332 26188 0\nZCorner 52315 26194 0\nZCorner 52313 26196 0\nZCorner 52310 26198 0\nZCorner 52308 26200 0\nZCorner 52306 26202 0\nZCorner 52290 26212 0\nZCorner 52273 26223 0\nZCorner 52257 26234 0\nZCorner 52240 26245 0\nZCorner 52227 26260 0\nZCorner 52213 26276 0\nZCorner 52199 26292 0\nZCorner 52185 26307 0\nZCorner 52172 26327 0\nZCorner 52158 26346 0\nZCorner 52144 26366 0\nZCorner 52131 26385 0\nZCorner 52117 26405 0\nZCorner 52103 26424 0\nZCorner 52090 26444 0\nZCorner 52076 26463 0\nZCorner 52065 26476 0\nZCorner 52054 26489 0\nZCorner 52044 26502 0\nZCorner 52033 26514 0\nZCorner 52022 26521 0\nZCorner 52011 26528 0\nZCorner 52000 26535 0\nZCorner 51990 26542 0\nZCorner 51983 26544 0\nZCorner 51976 26547 0\nZCorner 51969 26550 0\nZCorner 51963 26553 0\nZCorner 51924 26553 0\nZCorner 51885 26553 0\nZCorner 51846 26553 0\nZCorner 51807 26553 0\nZCorner 51797 26547 0\nZCorner 51787 26542 0\nZCorner 51777 26536 0\nZCorner 51767 26530 0\nZCorner 51748 26505 0\nZCorner 51728 26481 0\nZCorner 51709 26457 0\nZCorner 51689 26432 0\nZCorner 51641 26344 0\nZCorner 51601 26280 0\nZCorner 51569 26239 0\nZCorner 51545 26221 0\nZCorner 51524 26208 0\nZCorner 51504 26194 0\nZCorner 51483 26180 0\nZCorner 51463 26167 0\nZCorner 51439 26162 0\nZCorner 51416 26157 0\nZCorner 51392 26152 0\nZCorner 51369 26147 0\nZCorner 51366 26147 0\nZCorner 51363 26147 0\nZCorner 51360 26147 0\nZCorner 51357 26147 0\nZCorner 51341 26145 0\nZCorner 51326 26143 0\nZCorner 51310 26141 0\nZCorner 51295 26139 0\nZCorner 51284 26142 0\nZCorner 51273 26145 0\nZCorner 51262 26148 0\nZCorner 51252 26151 0\nZCorner 51245 26151 0\nZCorner 51238 26151 0\nZCorner 51231 26151 0\nZCorner 51224 26151 0\nZCorner 51209 26161 0\nZCorner 51193 26171 0\nZCorner 51178 26180 0\nZCorner 51162 26190 0\nZCorner 51160 26191 0\nZCorner 51158 26192 0\nZCorner 51156 26193 0\nZCorner 51154 26194 0\nZCorner 51141 26207 0\nZCorner 51129 26219 0\nZCorner 51116 26232 0\nZCorner 51103 26245 0\nZCorner 51090 26261 0\nZCorner 51076 26276 0\nZCorner 51062 26292 0\nZCorner 51049 26307 0\nZCorner 51034 26322 0\nZCorner 51019 26337 0\nZCorner 51005 26351 0\nZCorner 50990 26366 0\nZCorner 50975 26376 0\nZCorner 50961 26385 0\nZCorner 50946 26395 0\nZCorner 50931 26405 0\nZCorner 50920 26408 0\nZCorner 50908 26411 0\nZCorner 50896 26414 0\nZCorner 50885 26417 0\nZCorner 50884 26417 0\nZCorner 50883 26417 0\nZCorner 50882 26417 0\nZCorner 50881 26417 0\nZCorner 50876 26418 0\nZCorner 50871 26419 0\nZCorner 50866 26420 0\nZCorner 50861 26421 0\nZCorner 50838 26415 0\nZCorner 50814 26409 0\nZCorner 50791 26403 0\nZCorner 50767 26397 0\nZCorner 50763 26393 0\nZCorner 50760 26389 0\nZCorner 50756 26386 0\nZCorner 50752 26382 0\nZCorner 50638 26234 0\nZCorner 50550 26135 0\nZCorner 50487 26086 0\nZCorner 50451 26085 0\nZCorner 50441 26084 0\nZCorner 50431 26083 0\nZCorner 50422 26082 0\nZCorner 50412 26081 0\nZCorner 50390 26081 0\nZCorner 50367 26081 0\nZCorner 50345 26081 0\nZCorner 50322 26081 0\nZCorner 50308 26086 0\nZCorner 50295 26091 0\nZCorner 50281 26096 0\nZCorner 50268 26100 0\nZCorner 50259 26105 0\nZCorner 50250 26110 0\nZCorner 50241 26115 0\nZCorner 50232 26120 0\nZCorner 50224 26126 0\nZCorner 50217 26132 0\nZCorner 50209 26138 0\nZCorner 50201 26143 0\nZCorner 50193 26149 0\nZCorner 50185 26155 0\nZCorner 50177 26161 0\nZCorner 50170 26167 0\nZCorner 50158 26171 0\nZCorner 50146 26175 0\nZCorner 50135 26179 0\nZCorner 50123 26182 0\nZCorner 50114 26183 0\nZCorner 50105 26184 0\nZCorner 50096 26185 0\nZCorner 50087 26186 0\nZCorner 50059 26185 0\nZCorner 50031 26184 0\nZCorner 50003 26183 0\nZCorner 49974 26182 0\nZCorner 49934 26172 0\nZCorner 49902 26158 0\nZCorner 49879 26141 0\nZCorner 49865 26124 0\nZCorner 49832 26071 0\nZCorner 49808 26013 0\nZCorner 49793 25948 0\nZCorner 49787 25878 0\nZCorner 49724 25803 0\nZCorner 49662 25727 0\nZCorner 49599 25652 0\nZCorner 49537 25577 0\nZCorner 50622 25577 0\nZCorner 51706 25577 0\nZCorner 52791 25577 0\nZCorner 53876 25577 0\nZCorner 53876 25534 0\nZCorner 53876 25491 0\nZCorner 53876 25448 0\nZCorner 53876 25405 0\nZCorner 53876 25403 0\nZCorner 53876 25401 0\nZCorner 53876 25399 0\nZCorner 53876 25397 0\nZCorner 53800 25398 0\nZCorner 53724 25399 0\nZCorner 53647 25400 0\nZCorner 53571 25401 0\nZCorner 52551 25400 0\nZCorner 51531 25399 0\nZCorner 50510 25398 0\nZCorner 49490 25397 0\nZCorner 49490 25397 0\nZCorner 49490 25395 0\nZCorner 49488 25392 0\nZCorner 49486 25390 0\nZCorner 49462 25350 0\nZCorner 49413 25284 0\nZCorner 49339 25192 0\nZCorner 49240 25073 0\nZCorner 49240 25062 0\nZCorner 49240 25050 0\nZCorner 49240 25038 0\nZCorner 49240 25026 0\nZCorner 50400 25026 0\nZCorner 51560 25026 0\nZCorner 52720 25026 0\nZCorner 53880 25026 1\nZCorner 63105 26030 0\nZCorner 63605 26030 0\nZCorner 64104 26030 0\nZCorner 64604 26030 0\nZCorner 65104 26030 0\nZCorner 65137 26029 0\nZCorner 65171 26028 0\nZCorner 65204 26027 0\nZCorner 65237 26026 0\nZCorner 65198 25987 0\nZCorner 65159 25948 0\nZCorner 65120 25909 0\nZCorner 65081 25870 0\nZCorner 65047 25870 0\nZCorner 65012 25870 0\nZCorner 64978 25870 0\nZCorner 64944 25870 0\nZCorner 64484 25870 0\nZCorner 64024 25870 0\nZCorner 63564 25870 0\nZCorner 63105 25870 0\nZCorner 63105 25910 0\nZCorner 63105 25950 0\nZCorner 63105 25990 0\nZCorner 63105 26030 1\nZCorner 62183 26604 0\nZCorner 62269 26604 0\nZCorner 62355 26604 0\nZCorner 62441 26604 0\nZCorner 62527 26604 0\nZCorner 62606 26598 0\nZCorner 62664 26592 0\nZCorner 62699 26585 0\nZCorner 62710 26577 0\nZCorner 62813 26518 0\nZCorner 62880 26435 0\nZCorner 62912 26327 0\nZCorner 62909 26194 0\nZCorner 62909 25925 0\nZCorner 62909 25657 0\nZCorner 62909 25388 0\nZCorner 62909 25120 0\nZCorner 62922 25120 0\nZCorner 62935 25120 0\nZCorner 62948 25120 0\nZCorner 62960 25120 0\nZCorner 62974 25118 0\nZCorner 62988 25116 0\nZCorner 63001 25114 0\nZCorner 63015 25112 0\nZCorner 63019 25111 0\nZCorner 63023 25110 0\nZCorner 63027 25109 0\nZCorner 63030 25108 0\nZCorner 63030 25088 0\nZCorner 63030 25067 0\nZCorner 63030 25047 0\nZCorner 63030 25026 0\nZCorner 63030 24981 0\nZCorner 63030 24936 0\nZCorner 63030 24891 0\nZCorner 63030 24846 0\nZCorner 63030 24841 0\nZCorner 63030 24835 0\nZCorner 63030 24829 0\nZCorner 63030 24823 0\nZCorner 63013 24823 0\nZCorner 62995 24823 0\nZCorner 62978 24823 0\nZCorner 62960 24823 0\nZCorner 62948 24822 0\nZCorner 62935 24821 0\nZCorner 62922 24820 0\nZCorner 62909 24819 0\nZCorner 62909 24750 0\nZCorner 62909 24680 0\nZCorner 62909 24611 0\nZCorner 62909 24542 0\nZCorner 62771 24542 0\nZCorner 62632 24542 0\nZCorner 62493 24542 0\nZCorner 62355 24542 0\nZCorner 62344 24546 0\nZCorner 62333 24550 0\nZCorner 62323 24553 0\nZCorner 62312 24557 0\nZCorner 62313 24624 0\nZCorner 62314 24690 0\nZCorner 62315 24757 0\nZCorner 62316 24823 0\nZCorner 62286 24824 0\nZCorner 62257 24825 0\nZCorner 62228 24826 0\nZCorner 62199 24827 0\nZCorner 62192 24828 0\nZCorner 62185 24829 0\nZCorner 62178 24830 0\nZCorner 62171 24831 0\nZCorner 62169 24834 0\nZCorner 62167 24837 0\nZCorner 62165 24840 0\nZCorner 62163 24842 0\nZCorner 62163 24910 0\nZCorner 62163 24977 0\nZCorner 62163 25045 0\nZCorner 62163 25112 0\nZCorner 62166 25114 0\nZCorner 62169 25116 0\nZCorner 62172 25118 0\nZCorner 62175 25120 0\nZCorner 62210 25120 0\nZCorner 62245 25120 0\nZCorner 62281 25120 0\nZCorner 62316 25120 0\nZCorner 62315 25388 0\nZCorner 62314 25657 0\nZCorner 62313 25925 0\nZCorner 62312 26194 0\nZCorner 62318 26246 0\nZCorner 62302 26283 0\nZCorner 62264 26305 0\nZCorner 62202 26311 0\nZCorner 62190 26310 0\nZCorner 62177 26309 0\nZCorner 62164 26308 0\nZCorner 62152 26307 0\nZCorner 62150 26379 0\nZCorner 62148 26452 0\nZCorner 62146 26524 0\nZCorner 62144 26596 0\nZCorner 62154 26598 0\nZCorner 62163 26600 0\nZCorner 62173 26602 0\nZCorner 62183 26604 1\nZCorner 60804 26010 0\nZCorner 60808 26056 0\nZCorner 60812 26102 0\nZCorner 60816 26148 0\nZCorner 60820 26194 0\nZCorner 60850 26310 0\nZCorner 60911 26412 0\nZCorner 61004 26500 0\nZCorner 61128 26577 0\nZCorner 61129 26577 0\nZCorner 61130 26577 0\nZCorner 61131 26577 0\nZCorner 61132 26577 0\nZCorner 61133 26578 0\nZCorner 61134 26579 0\nZCorner 61135 26580 0\nZCorner 61136 26581 0\nZCorner 61139 26581 0\nZCorner 61142 26582 0\nZCorner 61145 26583 0\nZCorner 61148 26584 0\nZCorner 61366 26623 0\nZCorner 61551 26635 0\nZCorner 61703 26619 0\nZCorner 61820 26577 0\nZCorner 61917 26529 0\nZCorner 61993 26450 0\nZCorner 62049 26338 0\nZCorner 62085 26194 0\nZCorner 62089 26159 0\nZCorner 62093 26124 0\nZCorner 62097 26088 0\nZCorner 62101 26053 0\nZCorner 62101 25898 0\nZCorner 62101 25743 0\nZCorner 62101 25587 0\nZCorner 62101 25432 0\nZCorner 62097 25379 0\nZCorner 62093 25325 0\nZCorner 62089 25271 0\nZCorner 62085 25217 0\nZCorner 62073 25175 0\nZCorner 62062 25133 0\nZCorner 62050 25091 0\nZCorner 62038 25049 0\nZCorner 61890 24863 0\nZCorner 61678 24768 0\nZCorner 61403 24764 0\nZCorner 61066 24850 0\nZCorner 61063 24851 0\nZCorner 61060 24852 0\nZCorner 61057 24853 0\nZCorner 61054 24854 0\nZCorner 61052 24856 0\nZCorner 61050 24858 0\nZCorner 61048 24860 0\nZCorner 61046 24862 0\nZCorner 61026 24869 0\nZCorner 61002 24883 0\nZCorner 60974 24905 0\nZCorner 60941 24936 0\nZCorner 60921 24964 0\nZCorner 60902 24993 0\nZCorner 60882 25021 0\nZCorner 60863 25049 0\nZCorner 60852 25080 0\nZCorner 60841 25110 0\nZCorner 60830 25140 0\nZCorner 60820 25170 0\nZCorner 60815 25236 0\nZCorner 60810 25301 0\nZCorner 60805 25367 0\nZCorner 60800 25432 0\nZCorner 60801 25577 0\nZCorner 60802 25721 0\nZCorner 60803 25866 0\nZCorner 60804 26010 1\nZCorner 59391 25260 0\nZCorner 59391 25267 0\nZCorner 59391 25274 0\nZCorner 59391 25281 0\nZCorner 59391 25288 0\nZCorner 59391 25491 0\nZCorner 59391 25694 0\nZCorner 59391 25897 0\nZCorner 59391 26100 0\nZCorner 59392 26106 0\nZCorner 59392 26112 0\nZCorner 59393 26118 0\nZCorner 59394 26124 0\nZCorner 59394 26127 0\nZCorner 59394 26129 0\nZCorner 59394 26132 0\nZCorner 59394 26135 0\nZCorner 59395 26141 0\nZCorner 59396 26147 0\nZCorner 59397 26153 0\nZCorner 59398 26159 0\nZCorner 59398 26161 0\nZCorner 59398 26163 0\nZCorner 59398 26165 0\nZCorner 59398 26167 0\nZCorner 59399 26172 0\nZCorner 59400 26176 0\nZCorner 59401 26181 0\nZCorner 59402 26186 0\nZCorner 59402 26189 0\nZCorner 59402 26192 0\nZCorner 59402 26195 0\nZCorner 59402 26198 0\nZCorner 59403 26201 0\nZCorner 59404 26204 0\nZCorner 59405 26207 0\nZCorner 59406 26209 0\nZCorner 59406 26210 0\nZCorner 59406 26211 0\nZCorner 59406 26212 0\nZCorner 59406 26213 0\nZCorner 59407 26217 0\nZCorner 59408 26221 0\nZCorner 59409 26225 0\nZCorner 59410 26229 0\nZCorner 59410 26230 0\nZCorner 59410 26231 0\nZCorner 59410 26232 0\nZCorner 59410 26233 0\nZCorner 59411 26235 0\nZCorner 59412 26237 0\nZCorner 59413 26239 0\nZCorner 59414 26241 0\nZCorner 59414 26242 0\nZCorner 59414 26243 0\nZCorner 59414 26244 0\nZCorner 59414 26245 0\nZCorner 59419 26258 0\nZCorner 59424 26272 0\nZCorner 59429 26286 0\nZCorner 59433 26299 0\nZCorner 59470 26383 0\nZCorner 59527 26457 0\nZCorner 59605 26522 0\nZCorner 59703 26577 0\nZCorner 59926 26620 0\nZCorner 60113 26635 0\nZCorner 60265 26620 0\nZCorner 60382 26577 0\nZCorner 60491 26509 0\nZCorner 60573 26423 0\nZCorner 60626 26318 0\nZCorner 60652 26194 0\nZCorner 60656 26098 0\nZCorner 60660 26002 0\nZCorner 60664 25907 0\nZCorner 60667 25811 0\nZCorner 60663 25660 0\nZCorner 60658 25508 0\nZCorner 60653 25357 0\nZCorner 60648 25206 0\nZCorner 60637 25167 0\nZCorner 60626 25128 0\nZCorner 60616 25089 0\nZCorner 60605 25049 0\nZCorner 60506 24906 0\nZCorner 60367 24808 0\nZCorner 60188 24756 0\nZCorner 59968 24749 0\nZCorner 59780 24787 0\nZCorner 59630 24849 0\nZCorner 59519 24937 0\nZCorner 59449 25049 0\nZCorner 59438 25075 0\nZCorner 59427 25100 0\nZCorner 59417 25126 0\nZCorner 59406 25151 0\nZCorner 59405 25157 0\nZCorner 59404 25163 0\nZCorner 59403 25169 0\nZCorner 59402 25175 0\nZCorner 59401 25177 0\nZCorner 59400 25180 0\nZCorner 59399 25183 0\nZCorner 59398 25186 0\nZCorner 59398 25189 0\nZCorner 59398 25192 0\nZCorner 59398 25195 0\nZCorner 59398 25198 0\nZCorner 59397 25202 0\nZCorner 59396 25206 0\nZCorner 59395 25210 0\nZCorner 59394 25214 0\nZCorner 59394 25216 0\nZCorner 59394 25219 0\nZCorner 59394 25222 0\nZCorner 59394 25225 0\nZCorner 59393 25229 0\nZCorner 59392 25233 0\nZCorner 59391 25237 0\nZCorner 59390 25241 0\nZCorner 59390 25246 0\nZCorner 59390 25251 0\nZCorner 59390 25256 0\nZCorner 59391 25260 1\nZCorner 58930 26604 0\nZCorner 58930 26406 0\nZCorner 58930 26208 0\nZCorner 58930 26009 0\nZCorner 58930 25811 0\nZCorner 58934 25638 0\nZCorner 58952 25516 0\nZCorner 58984 25448 0\nZCorner 59027 25432 0\nZCorner 59051 25425 0\nZCorner 59074 25417 0\nZCorner 59098 25409 0\nZCorner 59121 25401 0\nZCorner 59122 25401 0\nZCorner 59123 25401 0\nZCorner 59124 25401 0\nZCorner 59125 25401 0\nZCorner 59156 25398 0\nZCorner 59187 25395 0\nZCorner 59219 25392 0\nZCorner 59250 25389 0\nZCorner 59251 25229 0\nZCorner 59252 25069 0\nZCorner 59253 24909 0\nZCorner 59254 24749 0\nZCorner 59249 24749 0\nZCorner 59244 24749 0\nZCorner 59239 24749 0\nZCorner 59234 24749 0\nZCorner 59149 24766 0\nZCorner 59066 24812 0\nZCorner 58987 24888 0\nZCorner 58910 24995 0\nZCorner 58914 24942 0\nZCorner 58918 24889 0\nZCorner 58922 24837 0\nZCorner 58926 24784 0\nZCorner 58787 24784 0\nZCorner 58648 24784 0\nZCorner 58510 24784 0\nZCorner 58371 24784 0\nZCorner 58371 25232 0\nZCorner 58371 25680 0\nZCorner 58371 26128 0\nZCorner 58371 26577 0\nZCorner 58345 26585 0\nZCorner 58429 26592 0\nZCorner 58624 26598 0\nZCorner 58930 26604 1\nZCorner 57555 25085 0\nZCorner 57574 25085 0\nZCorner 57592 25085 0\nZCorner 57611 25085 0\nZCorner 57629 25085 0\nZCorner 57636 25092 0\nZCorner 57643 25098 0\nZCorner 57650 25105 0\nZCorner 57657 25112 0\nZCorner 57658 25131 0\nZCorner 57660 25149 0\nZCorner 57662 25168 0\nZCorner 57664 25186 0\nZCorner 57664 25438 0\nZCorner 57664 25690 0\nZCorner 57664 25942 0\nZCorner 57664 26194 0\nZCorner 57658 26213 0\nZCorner 57653 26233 0\nZCorner 57647 26252 0\nZCorner 57641 26272 0\nZCorner 57630 26281 0\nZCorner 57619 26289 0\nZCorner 57609 26298 0\nZCorner 57598 26307 0\nZCorner 57579 26304 0\nZCorner 57561 26301 0\nZCorner 57542 26298 0\nZCorner 57524 26295 0\nZCorner 57522 26293 0\nZCorner 57520 26291 0\nZCorner 57518 26289 0\nZCorner 57516 26288 0\nZCorner 57512 26280 0\nZCorner 57508 26272 0\nZCorner 57504 26264 0\nZCorner 57500 26256 0\nZCorner 57498 26250 0\nZCorner 57496 26245 0\nZCorner 57494 26239 0\nZCorner 57492 26233 0\nZCorner 57491 26216 0\nZCorner 57491 26200 0\nZCorner 57490 26183 0\nZCorner 57489 26166 0\nZCorner 57490 26164 0\nZCorner 57491 26162 0\nZCorner 57491 26160 0\nZCorner 57492 26158 0\nZCorner 57491 26158 0\nZCorner 57491 26158 0\nZCorner 57490 26158 0\nZCorner 57489 26158 0\nZCorner 57487 26144 0\nZCorner 57485 26129 0\nZCorner 57483 26115 0\nZCorner 57481 26100 0\nZCorner 57483 26098 0\nZCorner 57485 26096 0\nZCorner 57487 26094 0\nZCorner 57489 26092 0\nZCorner 57487 26092 0\nZCorner 57485 26092 0\nZCorner 57483 26092 0\nZCorner 57481 26092 0\nZCorner 57481 26073 0\nZCorner 57481 26053 0\nZCorner 57481 26033 0\nZCorner 57481 26014 0\nZCorner 57483 26010 0\nZCorner 57485 26006 0\nZCorner 57487 26002 0\nZCorner 57489 25998 0\nZCorner 57487 25997 0\nZCorner 57485 25996 0\nZCorner 57483 25995 0\nZCorner 57481 25994 0\nZCorner 57481 25959 0\nZCorner 57481 25924 0\nZCorner 57481 25889 0\nZCorner 57481 25854 0\nZCorner 57355 25854 0\nZCorner 57229 25854 0\nZCorner 57103 25854 0\nZCorner 56977 25854 0\nZCorner 56982 25939 0\nZCorner 56987 26024 0\nZCorner 56991 26109 0\nZCorner 56996 26194 0\nZCorner 57028 26309 0\nZCorner 57087 26411 0\nZCorner 57174 26500 0\nZCorner 57289 26576 0\nZCorner 57503 26620 0\nZCorner 57681 26635 0\nZCorner 57824 26620 0\nZCorner 57930 26576 0\nZCorner 58037 26513 0\nZCorner 58118 26427 0\nZCorner 58173 26321 0\nZCorner 58203 26194 0\nZCorner 58209 26154 0\nZCorner 58215 26115 0\nZCorner 58221 26076 0\nZCorner 58227 26037 0\nZCorner 58224 25822 0\nZCorner 58221 25608 0\nZCorner 58218 25393 0\nZCorner 58215 25178 0\nZCorner 58205 25146 0\nZCorner 58195 25114 0\nZCorner 58186 25081 0\nZCorner 58176 25049 0\nZCorner 58070 24909 0\nZCorner 57929 24812 0\nZCorner 57752 24759 0\nZCorner 57539 24748 0\nZCorner 57372 24778 0\nZCorner 57232 24837 0\nZCorner 57122 24928 0\nZCorner 57040 25049 0\nZCorner 57030 25080 0\nZCorner 57020 25112 0\nZCorner 57010 25143 0\nZCorner 57001 25174 0\nZCorner 56995 25239 0\nZCorner 56989 25303 0\nZCorner 56983 25367 0\nZCorner 56977 25432 0\nZCorner 56979 25441 0\nZCorner 56981 25449 0\nZCorner 56983 25458 0\nZCorner 56985 25467 0\nZCorner 57117 25467 0\nZCorner 57249 25467 0\nZCorner 57380 25467 0\nZCorner 57512 25467 0\nZCorner 57513 25392 0\nZCorner 57514 25317 0\nZCorner 57515 25242 0\nZCorner 57516 25166 0\nZCorner 57516 25161 0\nZCorner 57516 25157 0\nZCorner 57516 25152 0\nZCorner 57516 25147 0\nZCorner 57516 25145 0\nZCorner 57516 25143 0\nZCorner 57516 25141 0\nZCorner 57516 25139 0\nZCorner 57526 25125 0\nZCorner 57536 25112 0\nZCorner 57545 25098 0\nZCorner 57555 25085 1\nZCorner 55559 25967 0\nZCorner 55563 26024 0\nZCorner 55567 26081 0\nZCorner 55571 26137 0\nZCorner 55575 26194 0\nZCorner 55596 26297 0\nZCorner 55652 26394 0\nZCorner 55744 26487 0\nZCorner 55872 26577 0\nZCorner 56097 26621 0\nZCorner 56285 26635 0\nZCorner 56438 26621 0\nZCorner 56555 26577 0\nZCorner 56577 26566 0\nZCorner 56598 26555 0\nZCorner 56620 26544 0\nZCorner 56641 26534 0\nZCorner 56646 26529 0\nZCorner 56651 26524 0\nZCorner 56656 26519 0\nZCorner 56661 26514 0\nZCorner 56667 26510 0\nZCorner 56674 26506 0\nZCorner 56681 26502 0\nZCorner 56688 26498 0\nZCorner 56692 26493 0\nZCorner 56696 26487 0\nZCorner 56700 26481 0\nZCorner 56704 26475 0\nZCorner 56723 26463 0\nZCorner 56744 26438 0\nZCorner 56766 26403 0\nZCorner 56790 26358 0\nZCorner 56800 26317 0\nZCorner 56811 26276 0\nZCorner 56822 26235 0\nZCorner 56832 26194 0\nZCorner 56837 26138 0\nZCorner 56842 26083 0\nZCorner 56847 26027 0\nZCorner 56852 25971 0\nZCorner 56851 25836 0\nZCorner 56850 25702 0\nZCorner 56849 25567 0\nZCorner 56848 25432 0\nZCorner 56844 25380 0\nZCorner 56840 25329 0\nZCorner 56837 25277 0\nZCorner 56833 25225 0\nZCorner 56823 25161 0\nZCorner 56812 25111 0\nZCorner 56800 25074 0\nZCorner 56786 25049 0\nZCorner 56779 25036 0\nZCorner 56772 25022 0\nZCorner 56765 25008 0\nZCorner 56758 24995 0\nZCorner 56756 24995 0\nZCorner 56753 24995 0\nZCorner 56750 24995 0\nZCorner 56747 24995 0\nZCorner 56737 24980 0\nZCorner 56727 24966 0\nZCorner 56718 24951 0\nZCorner 56708 24936 0\nZCorner 56705 24934 0\nZCorner 56702 24932 0\nZCorner 56699 24930 0\nZCorner 56696 24928 0\nZCorner 56597 24838 0\nZCorner 56459 24780 0\nZCorner 56283 24752 0\nZCorner 56067 24757 0\nZCorner 55916 24795 0\nZCorner 55790 24856 0\nZCorner 55691 24941 0\nZCorner 55618 25050 0\nZCorner 55608 25079 0\nZCorner 55597 25108 0\nZCorner 55586 25138 0\nZCorner 55575 25167 0\nZCorner 55571 25233 0\nZCorner 55567 25300 0\nZCorner 55564 25366 0\nZCorner 55560 25432 0\nZCorner 55560 25566 0\nZCorner 55560 25700 0\nZCorner 55560 25834 0\nZCorner 55559 25967 1\nZCorner 54657 26604 0\nZCorner 54666 26602 0\nZCorner 54675 26600 0\nZCorner 54684 26598 0\nZCorner 54692 26596 0\nZCorner 54695 26231 0\nZCorner 54698 25866 0\nZCorner 54701 25501 0\nZCorner 54704 25135 0\nZCorner 54705 25128 0\nZCorner 54706 25120 0\nZCorner 54707 25112 0\nZCorner 54708 25104 0\nZCorner 54713 25099 0\nZCorner 54718 25094 0\nZCorner 54722 25090 0\nZCorner 54727 25085 0\nZCorner 54739 25084 0\nZCorner 54751 25083 0\nZCorner 54763 25082 0\nZCorner 54774 25081 0\nZCorner 54781 25086 0\nZCorner 54788 25091 0\nZCorner 54795 25095 0\nZCorner 54802 25100 0\nZCorner 54805 25117 0\nZCorner 54809 25134 0\nZCorner 54813 25150 0\nZCorner 54817 25167 0\nZCorner 54818 25526 0\nZCorner 54819 25885 0\nZCorner 54820 26245 0\nZCorner 54821 26604 0\nZCorner 54961 26604 0\nZCorner 55100 26604 0\nZCorner 55240 26604 0\nZCorner 55379 26604 0\nZCorner 55386 26602 0\nZCorner 55393 26600 0\nZCorner 55400 26598 0\nZCorner 55407 26596 0\nZCorner 55408 26146 0\nZCorner 55409 25696 0\nZCorner 55410 25246 0\nZCorner 55411 24796 0\nZCorner 55404 24793 0\nZCorner 55397 24790 0\nZCorner 55390 24787 0\nZCorner 55383 24784 0\nZCorner 55241 24784 0\nZCorner 55098 24784 0\nZCorner 54956 24784 0\nZCorner 54813 24784 0\nZCorner 54815 24812 0\nZCorner 54817 24841 0\nZCorner 54819 24869 0\nZCorner 54821 24897 0\nZCorner 54801 24880 0\nZCorner 54782 24862 0\nZCorner 54762 24845 0\nZCorner 54743 24827 0\nZCorner 54730 24821 0\nZCorner 54717 24815 0\nZCorner 54705 24809 0\nZCorner 54692 24804 0\nZCorner 54681 24799 0\nZCorner 54671 24794 0\nZCorner 54660 24789 0\nZCorner 54649 24784 0\nZCorner 54459 24746 0\nZCorner 54307 24778 0\nZCorner 54191 24879 0\nZCorner 54114 25050 0\nZCorner 54110 25438 0\nZCorner 54106 25827 0\nZCorner 54102 26215 0\nZCorner 54098 26604 0\nZCorner 54238 26604 0\nZCorner 54378 26604 0\nZCorner 54517 26604 0\nZCorner 54657 26604 0\nZCorner 54657 26604 0\nZCorner 54657 26604 0\nZCorner 54657 26604 0\nZCorner 54657 26604 1\nZCorner 53872 25870 0\nZCorner 53410 25870 0\nZCorner 52949 25870 0\nZCorner 52487 25870 0\nZCorner 52025 25870 0\nZCorner 51991 25872 0\nZCorner 51957 25874 0\nZCorner 51922 25875 0\nZCorner 51888 25877 0\nZCorner 51850 25915 0\nZCorner 51812 25952 0\nZCorner 51774 25989 0\nZCorner 51736 26026 0\nZCorner 51768 26027 0\nZCorner 51800 26028 0\nZCorner 51833 26029 0\nZCorner 51865 26030 0\nZCorner 52367 26030 0\nZCorner 52869 26030 0\nZCorner 53370 26030 0\nZCorner 53872 26030 0\nZCorner 53872 25990 0\nZCorner 53872 25950 0\nZCorner 53872 25910 0\nZCorner 53872 25870 1\n$POLYSCORNERS\n58524 28521 0 0\n58656 28513 0 0\n58723 28509 0 0\n58789 28506 0 0\n58793 28389 0 0\n58805 28041 0 0\n58862 28030 0 0\n58930 28017 0 0\n58930 26604 0 0\n58624 26598 0 0\n58429 26592 0 0\n58345 26585 0 0\n58371 26577 0 0\n58371 24784 0 0\n58926 24784 0 0\n58922 24837 0 0\n58918 24889 0 0\n58910 24995 0 0\n58987 24888 0 0\n59066 24812 0 0\n59149 24766 0 0\n59234 24749 0 0\n59254 24749 0 0\n59250 25389 0 0\n59219 25392 0 0\n59187 25395 0 0\n59125 25401 0 0\n59121 25401 0 0\n59098 25409 0 0\n59074 25417 0 0\n59051 25425 0 0\n59027 25432 0 0\n58984 25448 0 0\n58952 25516 0 0\n58934 25638 0 0\n58930 25811 0 0\n58930 26604 0 0\n58930 28017 0 0\n58978 28008 0 0\n59035 27998 0 0\n59078 28105 0 0\n59121 28213 0 0\n59207 28427 0 0\n59270 28408 0 0\n59332 28388 0 0\n59394 28369 0 0\n59457 28349 0 0\n59434 28235 0 0\n59410 28121 0 0\n59387 28007 0 0\n59363 27892 0 0\n59469 27846 0 0\n59521 27822 0 0\n59574 27799 0 0\n59580 27805 0 0\n59582 27806 0 0\n59648 27898 0 0\n59715 27990 0 0\n59847 28174 0 0\n59904 28140 0 0\n59961 28107 0 0\n60017 28074 0 0\n60074 28041 0 0\n60023 27935 0 0\n59972 27830 0 0\n59922 27724 0 0\n59871 27619 0 0\n60006 27511 0 0\n60050 27475 0 0\n60113 27526 0 0\n60113 26635 0 0\n59926 26620 0 0\n59703 26577 0 0\n59605 26522 0 0\n59527 26457 0 0\n59470 26383 0 0\n59433 26299 0 0\n59429 26286 0 0\n59419 26258 0 0\n59414 26245 0 0\n59414 26241 0 0\n59410 26233 0 0\n59410 26229 0 0\n59406 26213 0 0\n59406 26209 0 0\n59405 26207 0 0\n59402 26198 0 0\n59402 26186 0 0\n59400 26176 0 0\n59399 26172 0 0\n59398 26167 0 0\n59398 26159 0 0\n59394 26135 0 0\n59394 26124 0 0\n59392 26112 0 0\n59392 26106 0 0\n59391 26100 0 0\n59391 25260 0 0\n59390 25256 0 0\n59390 25241 0 0\n59394 25225 0 0\n59394 25214 0 0\n59398 25198 0 0\n59398 25186 0 0\n59401 25177 0 0\n59402 25175 0 0\n59406 25151 0 0\n59417 25126 0 0\n59427 25100 0 0\n59438 25075 0 0\n59449 25049 0 0\n59519 24937 0 0\n59630 24849 0 0\n59780 24787 0 0\n59968 24749 0 0\n60188 24756 0 0\n60367 24808 0 0\n60506 24906 0 0\n60589 25025 0 0\n60589 24538 0 0\n60589 24526 0 0\n60593 24538 0 0\n60589 24538 0 0\n60589 25025 0 0\n60605 25049 0 0\n60616 25089 0 0\n60626 25128 0 0\n60648 25206 0 0\n60658 25508 0 0\n60663 25660 0 0\n60667 25811 0 0\n60664 25907 0 0\n60660 26002 0 0\n60652 26194 0 0\n60626 26318 0 0\n60589 26391 0 0\n60573 26423 0 0\n60491 26509 0 0\n60382 26577 0 0\n60265 26620 0 0\n60113 26635 0 0\n60113 27526 0 0\n60414 27775 0 0\n60506 27685 0 0\n60551 27640 0 0\n60597 27596 0 0\n60301 27232 0 0\n60336 27186 0 0\n60441 27045 0 0\n60548 27096 0 0\n60589 27115 0 0\n60654 27147 0 0\n60760 27197 0 0\n60867 27248 0 0\n60899 27192 0 0\n60931 27137 0 0\n60964 27081 0 0\n60996 27026 0 0\n60939 26985 0 0\n60883 26944 0 0\n60769 26862 0 0\n60804 26848 0 0\n60866 26856 0 0\n60958 26885 0 0\n61078 26936 0 0\n61132 26943 0 0\n61187 26950 0 0\n61242 26956 0 0\n61296 26963 0 0\n61458 26957 0 0\n61540 26954 0 0\n61551 26953 0 0\n61551 26635 0 0\n61366 26623 0 0\n61148 26584 0 0\n61139 26581 0 0\n61136 26581 0 0\n61132 26577 0 0\n61128 26577 0 0\n61004 26500 0 0\n60911 26412 0 0\n60850 26310 0 0\n60820 26194 0 0\n60804 26010 0 0\n60803 25866 0 0\n60802 25721 0 0\n60801 25577 0 0\n60800 25432 0 0\n60805 25367 0 0\n60810 25301 0 0\n60815 25236 0 0\n60820 25170 0 0\n60830 25140 0 0\n60852 25080 0 0\n60863 25049 0 0\n60882 25021 0 0\n60902 24993 0 0\n60921 24964 0 0\n60941 24936 0 0\n60974 24905 0 0\n61002 24883 0 0\n61026 24869 0 0\n61046 24862 0 0\n61054 24854 0 0\n61066 24850 0 0\n61403 24764 0 0\n61678 24768 0 0\n61890 24863 0 0\n62038 25049 0 0\n62062 25133 0 0\n62073 25175 0 0\n62085 25217 0 0\n62097 25379 0 0\n62101 25432 0 0\n62101 26053 0 0\n62097 26088 0 0\n62093 26124 0 0\n62085 26194 0 0\n62049 26338 0 0\n61993 26450 0 0\n61917 26529 0 0\n61820 26577 0 0\n61703 26619 0 0\n61551 26635 0 0\n61551 26953 0 0\n61621 26951 0 0\n61710 26938 0 0\n61789 26920 0 0\n61857 26900 0 0\n61913 26877 0 0\n61931 26868 0 0\n61949 26860 0 0\n61966 26851 0 0\n61984 26842 0 0\n61984 26951 0 0\n62087 26953 0 0\n62183 26954 0 0\n62183 26604 0 0\n62163 26600 0 0\n62154 26598 0 0\n62144 26596 0 0\n62148 26452 0 0\n62150 26379 0 0\n62152 26307 0 0\n62164 26308 0 0\n62190 26310 0 0\n62202 26311 0 0\n62264 26305 0 0\n62302 26283 0 0\n62318 26246 0 0\n62312 26194 0 0\n62313 25925 0 0\n62314 25657 0 0\n62315 25388 0 0\n62316 25120 0 0\n62175 25120 0 0\n62163 25112 0 0\n62163 24842 0 0\n62165 24840 0 0\n62171 24831 0 0\n62199 24827 0 0\n62286 24824 0 0\n62316 24823 0 0\n62315 24757 0 0\n62314 24690 0 0\n62313 24624 0 0\n62312 24557 0 0\n62323 24553 0 0\n62333 24550 0 0\n62355 24542 0 0\n62909 24542 0 0\n62909 24819 0 0\n62948 24822 0 0\n62960 24823 0 0\n63030 24823 0 0\n63030 25108 0 0\n63027 25109 0 0\n63015 25112 0 0\n63001 25114 0 0\n62988 25116 0 0\n62960 25120 0 0\n62909 25120 0 0\n62909 26194 0 0\n62912 26327 0 0\n62880 26435 0 0\n62813 26518 0 0\n62710 26577 0 0\n62699 26585 0 0\n62664 26592 0 0\n62606 26598 0 0\n62527 26604 0 0\n62183 26604 0 0\n62183 26954 0 0\n62191 26955 0 0\n62294 26957 0 0\n62398 26959 0 0\n62527 26955 0 0\n62623 26949 0 0\n62684 26941 0 0\n62710 26932 0 0\n62809 26897 0 0\n62900 26838 0 0\n62985 26755 0 0\n63061 26647 0 0\n63780 26647 0 0\n63851 26522 0 0\n63888 26442 0 0\n63890 26405 0 0\n63858 26413 0 0\n63097 26413 0 0\n63097 26358 0 0\n63105 26358 0 0\n63105 26030 0 0\n63105 25870 0 0\n65081 25870 0 0\n65237 26026 0 0\n65171 26028 0 0\n65137 26029 0 0\n65104 26030 0 0\n63105 26030 0 0\n63105 26358 0 0\n63952 26358 0 0\n63988 26286 0 0\n64048 26227 0 0\n64133 26182 0 0\n64241 26151 0 0\n64307 26149 0 0\n64341 26148 0 0\n64374 26147 0 0\n64399 26149 0 0\n64425 26151 0 0\n64475 26155 0 0\n64503 26155 0 0\n64512 26158 0 0\n64514 26159 0 0\n64550 26165 0 0\n64567 26168 0 0\n64585 26170 0 0\n64603 26176 0 0\n64622 26182 0 0\n64640 26188 0 0\n64659 26194 0 0\n64667 26202 0 0\n64683 26212 0 0\n64700 26223 0 0\n64716 26234 0 0\n64733 26245 0 0\n64747 26260 0 0\n64760 26276 0 0\n64774 26292 0 0\n64788 26307 0 0\n64802 26327 0 0\n64817 26346 0 0\n64832 26366 0 0\n64846 26385 0 0\n64859 26405 0 0\n64872 26424 0 0\n64884 26444 0 0\n64897 26463 0 0\n64917 26489 0 0\n64926 26501 0 0\n64936 26514 0 0\n64958 26528 0 0\n64968 26535 0 0\n64979 26541 0 0\n65000 26550 0 0\n65006 26553 0 0\n65178 26549 0 0\n65212 26526 0 0\n65254 26475 0 0\n65304 26395 0 0\n65362 26287 0 0\n65452 26197 0 0\n65465 26189 0 0\n65479 26182 0 0\n65507 26166 0 0\n65553 26156 0 0\n65577 26151 0 0\n65600 26146 0 0\n65612 26146 0 0\n65626 26145 0 0\n65639 26143 0 0\n65667 26139 0 0\n65679 26142 0 0\n65692 26144 0 0\n65705 26147 0 0\n65717 26150 0 0\n65745 26150 0 0\n65760 26160 0 0\n65792 26180 0 0\n65807 26189 0 0\n65819 26193 0 0\n65833 26207 0 0\n65846 26221 0 0\n65860 26234 0 0\n65874 26248 0 0\n65886 26263 0 0\n65899 26277 0 0\n65912 26292 0 0\n65924 26307 0 0\n65939 26321 0 0\n65954 26336 0 0\n65968 26351 0 0\n65983 26365 0 0\n65997 26375 0 0\n66010 26385 0 0\n66024 26395 0 0\n66038 26404 0 0\n66049 26407 0 0\n66073 26413 0 0\n66084 26416 0 0\n66088 26416 0 0\n66108 26420 0 0\n66156 26412 0 0\n66193 26400 0 0\n66222 26384 0 0\n66241 26365 0 0\n66285 26309 0 0\n66373 26195 0 0\n66416 26139 0 0\n66455 26109 0 0\n66467 26100 0 0\n66495 26092 0 0\n66508 26088 0 0\n66522 26084 0 0\n66531 26083 0 0\n66539 26082 0 0\n66557 26080 0 0\n66651 26080 0 0\n66664 26085 0 0\n66692 26095 0 0\n66705 26100 0 0\n66714 26105 0 0\n66723 26109 0 0\n66741 26119 0 0\n66747 26125 0 0\n66768 26143 0 0\n66776 26148 0 0\n66784 26154 0 0\n66791 26160 0 0\n66799 26166 0 0\n66812 26170 0 0\n66824 26174 0 0\n66850 26182 0 0\n66858 26183 0 0\n66865 26184 0 0\n66873 26185 0 0\n66881 26185 0 0\n66914 26184 0 0\n66948 26182 0 0\n67014 26178 0 0\n67042 26170 0 0\n67067 26157 0 0\n67090 26139 0 0\n67111 26115 0 0\n67140 26068 0 0\n67161 26012 0 0\n67175 25949 0 0\n67182 25877 0 0\n67245 25802 0 0\n67309 25727 0 0\n67372 25652 0 0\n67436 25576 0 0\n63105 25576 0 0\n63105 25397 0 0\n63409 25401 0 0\n67498 25397 0 0\n67504 25378 0 0\n67510 25360 0 0\n67516 25341 0 0\n67522 25323 0 0\n67653 25170 0 0\n67732 25070 0 0\n67756 25022 0 0\n67725 25026 0 0\n63230 25026 0 0\n63233 25011 0 0\n63235 24997 0 0\n63241 24967 0 0\n63240 24941 0 0\n63239 24914 0 0\n63237 24862 0 0\n64280 24862 0 0\n64306 24890 0 0\n64331 24918 0 0\n64356 24947 0 0\n64382 24975 0 0\n67205 24975 0 0\n67276 24976 0 0\n67348 24974 0 0\n67421 24967 0 0\n67494 24955 0 0\n67495 24977 0 0\n67515 24953 0 0\n67554 24885 0 0\n67611 24772 0 0\n63225 24772 0 0\n63217 24748 0 0\n63199 24702 0 0\n63190 24678 0 0\n63183 24670 0 0\n63175 24663 0 0\n63159 24647 0 0\n63146 24641 0 0\n63134 24635 0 0\n63108 24623 0 0\n63108 24604 0 0\n63102 24458 0 0\n63082 24356 0 0\n63047 24298 0 0\n62999 24284 0 0\n62633 24276 0 0\n62366 24274 0 0\n62199 24278 0 0\n62132 24288 0 0\n62124 24294 0 0\n62120 24296 0 0\n62116 24299 0 0\n62110 24302 0 0\n62105 24305 0 0\n62093 24311 0 0\n62073 24329 0 0\n62064 24337 0 0\n62054 24346 0 0\n62039 24373 0 0\n62034 24381 0 0\n62028 24405 0 0\n62026 24416 0 0\n62023 24428 0 0\n62021 24454 0 0\n62020 24466 0 0\n62019 24479 0 0\n62018 24507 0 0\n62017 24536 0 0\n62015 24592 0 0\n61997 24584 0 0\n61980 24577 0 0\n61962 24569 0 0\n61945 24561 0 0\n61841 24519 0 0\n61666 24497 0 0\n61418 24495 0 0\n61097 24514 0 0\n61062 24431 0 0\n61039 24379 0 0\n60917 24412 0 0\n60699 24488 0 0\n60589 24526 0 0\n60499 24376 0 0\n60468 24327 0 0\n60812 24003 0 0\n60652 23803 0 0\n60552 23867 0 0\n60453 23930 0 0\n60353 23994 0 0\n60254 24057 0 0\n60174 23975 0 0\n60133 23934 0 0\n60093 23893 0 0\n60156 23794 0 0\n60218 23696 0 0\n60281 23597 0 0\n60343 23499 0 0\n60292 23460 0 0\n60240 23420 0 0\n60136 23342 0 0\n59820 23678 0 0\n59720 23620 0 0\n59671 23590 0 0\n59621 23561 0 0\n59659 23450 0 0\n59697 23338 0 0\n59773 23116 0 0\n59714 23090 0 0\n59654 23063 0 0\n59595 23037 0 0\n59535 23010 0 0\n59478 23112 0 0\n59422 23214 0 0\n59365 23315 0 0\n59308 23417 0 0\n59308 23421 0 0\n59306 23419 0 0\n59306 23418 0 0\n59305 23417 0 0\n59195 23383 0 0\n59141 23367 0 0\n59086 23350 0 0\n59096 23233 0 0\n59105 23116 0 0\n59125 22882 0 0\n58972 22853 0 0\n58878 22839 0 0\n58837 22962 0 0\n58807 23069 0 0\n58777 23177 0 0\n58746 23284 0 0\n58689 23282 0 0\n58573 23278 0 0\n58516 23276 0 0\n58498 23160 0 0\n58481 23044 0 0\n58463 22928 0 0\n58445 22811 0 0\n58313 22819 0 0\n58246 22823 0 0\n58180 22827 0 0\n58174 23061 0 0\n58171 23179 0 0\n58168 23296 0 0\n58112 23305 0 0\n58055 23315 0 0\n57999 23325 0 0\n57942 23335 0 0\n57897 23227 0 0\n57807 23013 0 0\n57762 22905 0 0\n57700 22925 0 0\n57637 22944 0 0\n57575 22964 0 0\n57512 22983 0 0\n57537 23098 0 0\n57585 23326 0 0\n57610 23440 0 0\n57557 23463 0 0\n57504 23485 0 0\n57451 23508 0 0\n57399 23530 0 0\n57328 23437 0 0\n57258 23345 0 0\n57118 23159 0 0\n57010 23227 0 0\n56957 23262 0 0\n56903 23296 0 0\n56953 23400 0 0\n57003 23505 0 0\n57052 23609 0 0\n57102 23714 0 0\n56918 23854 0 0\n56829 23780 0 0\n56649 23632 0 0\n56559 23557 0 0\n56467 23647 0 0\n56422 23692 0 0\n56376 23737 0 0\n56598 24007 0 0\n56672 24096 0 0\n56532 24284 0 0\n56524 24288 0 0\n56528 24284 0 0\n56423 24232 0 0\n56317 24180 0 0\n56212 24129 0 0\n56106 24077 0 0\n56074 24133 0 0\n56042 24188 0 0\n56010 24244 0 0\n55977 24300 0 0\n56045 24349 0 0\n56112 24399 0 0\n56180 24449 0 0\n56247 24499 0 0\n56159 24507 0 0\n56071 24514 0 0\n55895 24530 0 0\n55846 24551 0 0\n55796 24571 0 0\n55746 24592 0 0\n55686 24616 0 0\n55677 24620 0 0\n55657 24628 0 0\n55651 24601 0 0\n55649 24593 0 0\n55641 24581 0 0\n55638 24575 0 0\n55634 24569 0 0\n55629 24563 0 0\n55624 24558 0 0\n55614 24546 0 0\n55600 24541 0 0\n55587 24536 0 0\n55559 24526 0 0\n54263 24522 0 0\n54182 24536 0 0\n54102 24581 0 0\n54025 24660 0 0\n53950 24772 0 0\n49354 24772 0 0\n49414 24885 0 0\n49454 24953 0 0\n49476 24977 0 0\n49479 24956 0 0\n52431 24956 0 0\n52443 24971 0 0\n52470 24957 0 0\n52511 24915 0 0\n52568 24846 0 0\n53911 24846 0 0\n53902 24858 0 0\n53900 24862 0 0\n53892 24880 0 0\n53888 24888 0 0\n53884 24897 0 0\n53883 24929 0 0\n53882 24962 0 0\n53880 25026 0 0\n49240 25026 0 0\n49240 25073 0 0\n49339 25192 0 0\n49413 25284 0 0\n49462 25350 0 0\n49486 25390 0 0\n49488 25392 0 0\n49490 25395 0 0\n49490 25397 0 0\n53571 25401 0 0\n53647 25400 0 0\n53724 25399 0 0\n53876 25397 0 0\n53876 25577 0 0\n49537 25577 0 0\n49599 25652 0 0\n49662 25727 0 0\n49724 25803 0 0\n49787 25878 0 0\n49793 25948 0 0\n49808 26013 0 0\n49832 26071 0 0\n49865 26124 0 0\n49879 26141 0 0\n49902 26158 0 0\n49934 26172 0 0\n49974 26182 0 0\n50003 26183 0 0\n50087 26186 0 0\n50123 26182 0 0\n50135 26179 0 0\n50146 26175 0 0\n50170 26167 0 0\n50177 26161 0 0\n50201 26143 0 0\n50209 26138 0 0\n50217 26132 0 0\n50224 26126 0 0\n50232 26120 0 0\n50268 26100 0 0\n50281 26096 0 0\n50295 26091 0 0\n50308 26086 0 0\n50322 26081 0 0\n50412 26081 0 0\n50422 26082 0 0\n50431 26083 0 0\n50451 26085 0 0\n50487 26086 0 0\n50550 26135 0 0\n50638 26234 0 0\n50752 26382 0 0\n50756 26386 0 0\n50760 26389 0 0\n50763 26393 0 0\n50767 26397 0 0\n50791 26403 0 0\n50814 26409 0 0\n50838 26415 0 0\n50861 26421 0 0\n50881 26417 0 0\n50885 26417 0 0\n50896 26414 0 0\n50920 26408 0 0\n50931 26405 0 0\n50961 26385 0 0\n50975 26376 0 0\n50990 26366 0 0\n51049 26307 0 0\n51062 26292 0 0\n51076 26276 0 0\n51090 26261 0 0\n51103 26245 0 0\n51154 26194 0 0\n51162 26190 0 0\n51178 26180 0 0\n51193 26171 0 0\n51209 26161 0 0\n51224 26151 0 0\n51252 26151 0 0\n51262 26148 0 0\n51295 26139 0 0\n51310 26141 0 0\n51326 26143 0 0\n51341 26145 0 0\n51357 26147 0 0\n51369 26147 0 0\n51392 26152 0 0\n51416 26157 0 0\n51439 26162 0 0\n51463 26167 0 0\n51483 26180 0 0\n51504 26194 0 0\n51524 26208 0 0\n51545 26221 0 0\n51569 26239 0 0\n51601 26280 0 0\n51641 26344 0 0\n51689 26432 0 0\n51709 26457 0 0\n51728 26481 0 0\n51748 26505 0 0\n51767 26530 0 0\n51787 26542 0 0\n51797 26547 0 0\n51807 26553 0 0\n51865 26553 0 0\n51865 26030 0 0\n51833 26029 0 0\n51800 26028 0 0\n51736 26026 0 0\n51850 25915 0 0\n51888 25877 0 0\n51922 25875 0 0\n51957 25874 0 0\n52025 25870 0 0\n53872 25870 0 0\n53872 26030 0 0\n51865 26030 0 0\n51865 26553 0 0\n51963 26553 0 0\n51969 26550 0 0\n51983 26544 0 0\n51990 26542 0 0\n52000 26535 0 0\n52033 26514 0 0\n52044 26502 0 0\n52054 26489 0 0\n52076 26463 0 0\n52090 26444 0 0\n52103 26424 0 0\n52117 26405 0 0\n52131 26385 0 0\n52144 26366 0 0\n52158 26346 0 0\n52172 26327 0 0\n52185 26307 0 0\n52199 26292 0 0\n52227 26260 0 0\n52240 26245 0 0\n52257 26234 0 0\n52273 26223 0 0\n52290 26212 0 0\n52306 26202 0 0\n52310 26198 0 0\n52313 26196 0 0\n52315 26194 0 0\n52332 26188 0 0\n52350 26182 0 0\n52367 26176 0 0\n52385 26170 0 0\n52402 26168 0 0\n52420 26165 0 0\n52437 26162 0 0\n52455 26159 0 0\n52467 26155 0 0\n52494 26155 0 0\n52519 26153 0 0\n52545 26151 0 0\n52570 26149 0 0\n52596 26147 0 0\n52747 26154 0 0\n52866 26191 0 0\n52953 26259 0 0\n53010 26358 0 0\n53869 26358 0 0\n53869 26413 0 0\n53111 26413 0 0\n53085 26418 0 0\n53089 26459 0 0\n53123 26536 0 0\n53189 26647 0 0\n53865 26647 0 0\n53863 26726 0 0\n53895 26798 0 0\n53960 26863 0 0\n54060 26920 0 0\n54369 26921 0 0\n54821 26922 0 0\n54821 26604 0 0\n54820 26245 0 0\n54819 25885 0 0\n54817 25167 0 0\n54813 25150 0 0\n54809 25134 0 0\n54805 25117 0 0\n54802 25100 0 0\n54795 25095 0 0\n54788 25091 0 0\n54774 25081 0 0\n54763 25082 0 0\n54727 25085 0 0\n54708 25104 0 0\n54705 25128 0 0\n54704 25135 0 0\n54701 25501 0 0\n54692 26596 0 0\n54684 26598 0 0\n54657 26604 0 0\n54098 26604 0 0\n54102 26215 0 0\n54106 25827 0 0\n54110 25438 0 0\n54114 25050 0 0\n54191 24879 0 0\n54307 24778 0 0\n54459 24746 0 0\n54649 24784 0 0\n54671 24794 0 0\n54681 24799 0 0\n54692 24804 0 0\n54705 24809 0 0\n54717 24815 0 0\n54743 24827 0 0\n54762 24845 0 0\n54782 24862 0 0\n54801 24880 0 0\n54821 24897 0 0\n54817 24841 0 0\n54815 24812 0 0\n54813 24784 0 0\n55383 24784 0 0\n55411 24796 0 0\n55407 26596 0 0\n55379 26604 0 0\n54821 26604 0 0\n54821 26922 0 0\n54989 26923 0 0\n55298 26924 0 0\n55425 26925 0 0\n55507 26924 0 0\n55545 26918 0 0\n55540 26908 0 0\n55545 26905 0 0\n55560 26893 0 0\n55566 26886 0 0\n55571 26879 0 0\n55583 26865 0 0\n55589 26854 0 0\n55601 26830 0 0\n55607 26819 0 0\n55611 26805 0 0\n55614 26791 0 0\n55618 26778 0 0\n55622 26764 0 0\n55643 26776 0 0\n55663 26787 0 0\n55684 26799 0 0\n55704 26811 0 0\n55726 26835 0 0\n55747 26860 0 0\n55769 26884 0 0\n55790 26908 0 0\n55810 26920 0 0\n55819 26926 0 0\n55829 26932 0 0\n55855 26936 0 0\n55905 26944 0 0\n55931 26947 0 0\n56063 26945 0 0\n56194 26942 0 0\n56285 26939 0 0\n56285 26635 0 0\n56097 26621 0 0\n55872 26577 0 0\n55744 26487 0 0\n55652 26394 0 0\n55596 26297 0 0\n55575 26194 0 0\n55571 26137 0 0\n55567 26081 0 0\n55559 25967 0 0\n55560 25834 0 0\n55560 25432 0 0\n55564 25366 0 0\n55567 25300 0 0\n55571 25233 0 0\n55575 25167 0 0\n55586 25138 0 0\n55597 25108 0 0\n55608 25079 0 0\n55618 25050 0 0\n55691 24941 0 0\n55790 24856 0 0\n55916 24795 0 0\n56067 24757 0 0\n56283 24752 0 0\n56459 24780 0 0\n56597 24838 0 0\n56696 24928 0 0\n56708 24936 0 0\n56718 24951 0 0\n56727 24966 0 0\n56737 24980 0 0\n56747 24995 0 0\n56758 24995 0 0\n56765 25008 0 0\n56779 25036 0 0\n56786 25049 0 0\n56800 25074 0 0\n56812 25111 0 0\n56823 25161 0 0\n56833 25225 0 0\n56837 25277 0 0\n56840 25329 0 0\n56844 25380 0 0\n56848 25432 0 0\n56850 25702 0 0\n56851 25836 0 0\n56852 25971 0 0\n56842 26083 0 0\n56837 26138 0 0\n56832 26194 0 0\n56822 26235 0 0\n56800 26317 0 0\n56790 26358 0 0\n56766 26403 0 0\n56744 26438 0 0\n56723 26463 0 0\n56704 26475 0 0\n56692 26493 0 0\n56688 26498 0 0\n56667 26510 0 0\n56661 26514 0 0\n56641 26534 0 0\n56620 26544 0 0\n56598 26555 0 0\n56577 26566 0 0\n56555 26577 0 0\n56438 26621 0 0\n56285 26635 0 0\n56285 26939 0 0\n56458 26936 0 0\n56468 26954 0 0\n56477 26973 0 0\n56487 26991 0 0\n56497 27010 0 0\n56161 27322 0 0\n56215 27399 0 0\n56260 27459 0 0\n56294 27503 0 0\n56317 27533 0 0\n56415 27468 0 0\n56513 27402 0 0\n56610 27337 0 0\n56708 27272 0 0\n56794 27358 0 0\n56837 27400 0 0\n56879 27443 0 0\n56880 27444 0 0\n56882 27445 0 0\n56884 27447 0 0\n56876 27443 0 0\n56812 27541 0 0\n56749 27639 0 0\n56685 27736 0 0\n56622 27834 0 0\n56688 27887 0 0\n56745 27930 0 0\n56793 27962 0 0\n56833 27982 0 0\n57149 27654 0 0\n57198 27684 0 0\n57247 27713 0 0\n57295 27742 0 0\n57344 27771 0 0\n57288 27933 0 0\n57243 28062 0 0\n57209 28159 0 0\n57188 28224 0 0\n57248 28246 0 0\n57279 28257 0 0\n57309 28267 0 0\n57374 28299 0 0\n57416 28317 0 0\n57437 28322 0 0\n57438 28314 0 0\n57494 28214 0 0\n57608 28012 0 0\n57664 27912 0 0\n57681 27917 0 0\n57681 26635 0 0\n57503 26620 0 0\n57289 26576 0 0\n57174 26500 0 0\n57087 26411 0 0\n57028 26309 0 0\n56996 26194 0 0\n56991 26109 0 0\n56987 26024 0 0\n56977 25854 0 0\n57481 25854 0 0\n57481 25994 0 0\n57489 25998 0 0\n57481 26014 0 0\n57481 26092 0 0\n57489 26092 0 0\n57481 26100 0 0\n57483 26115 0 0\n57485 26129 0 0\n57487 26144 0 0\n57489 26158 0 0\n57492 26158 0 0\n57491 26160 0 0\n57491 26162 0 0\n57489 26166 0 0\n57491 26200 0 0\n57491 26216 0 0\n57492 26233 0 0\n57496 26245 0 0\n57498 26250 0 0\n57500 26256 0 0\n57516 26288 0 0\n57518 26289 0 0\n57524 26295 0 0\n57542 26298 0 0\n57561 26301 0 0\n57579 26304 0 0\n57598 26307 0 0\n57609 26298 0 0\n57619 26289 0 0\n57630 26281 0 0\n57641 26272 0 0\n57647 26252 0 0\n57653 26233 0 0\n57658 26213 0 0\n57664 26194 0 0\n57664 25186 0 0\n57662 25168 0 0\n57660 25149 0 0\n57658 25131 0 0\n57657 25112 0 0\n57643 25098 0 0\n57636 25092 0 0\n57629 25085 0 0\n57555 25085 0 0\n57545 25098 0 0\n57536 25112 0 0\n57526 25125 0 0\n57516 25139 0 0\n57516 25166 0 0\n57515 25242 0 0\n57512 25467 0 0\n56985 25467 0 0\n56981 25449 0 0\n56979 25441 0 0\n56977 25432 0 0\n56983 25367 0 0\n56995 25239 0 0\n57001 25174 0 0\n57010 25143 0 0\n57020 25112 0 0\n57030 25080 0 0\n57040 25049 0 0\n57122 24928 0 0\n57232 24837 0 0\n57372 24778 0 0\n57539 24748 0 0\n57752 24759 0 0\n57929 24812 0 0\n58070 24909 0 0\n58176 25049 0 0\n58186 25081 0 0\n58195 25114 0 0\n58215 25178 0 0\n58221 25608 0 0\n58224 25822 0 0\n58227 26037 0 0\n58209 26154 0 0\n58203 26194 0 0\n58173 26321 0 0\n58118 26427 0 0\n58037 26513 0 0\n57930 26576 0 0\n57824 26620 0 0\n57681 26635 0 0\n57681 27917 0 0\n57719 27929 0 0\n57774 27947 0 0\n57828 27965 0 0\n57883 27982 0 0\n57872 28099 0 0\n57862 28216 0 0\n57851 28334 0 0\n57840 28451 0 0\n57905 28461 0 0\n57969 28472 0 0\n58034 28483 0 0\n58098 28494 0 0\n58130 28382 0 0\n58162 28269 0 0\n58195 28157 0 0\n58227 28045 0 0\n58284 28048 0 0\n58342 28050 0 0\n58400 28053 0 0\n58457 28056 0 0\n58474 28172 0 0\n58490 28289 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660001 0 \"\"\nZLayer 20\nZAux 45 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 56180 25085 0\nZCorner 56192 25084 0\nZCorner 56204 25083 0\nZCorner 56216 25082 0\nZCorner 56227 25081 0\nZCorner 56235 25085 0\nZCorner 56243 25089 0\nZCorner 56251 25093 0\nZCorner 56259 25096 0\nZCorner 56262 25109 0\nZCorner 56264 25122 0\nZCorner 56267 25135 0\nZCorner 56270 25147 0\nZCorner 56271 25409 0\nZCorner 56272 25671 0\nZCorner 56273 25932 0\nZCorner 56274 26194 0\nZCorner 56270 26215 0\nZCorner 56267 26237 0\nZCorner 56263 26258 0\nZCorner 56259 26280 0\nZCorner 56249 26287 0\nZCorner 56239 26294 0\nZCorner 56229 26300 0\nZCorner 56220 26307 0\nZCorner 56210 26305 0\nZCorner 56200 26303 0\nZCorner 56190 26301 0\nZCorner 56181 26299 0\nZCorner 56174 26294 0\nZCorner 56167 26288 0\nZCorner 56160 26282 0\nZCorner 56153 26276 0\nZCorner 56150 26255 0\nZCorner 56148 26235 0\nZCorner 56145 26214 0\nZCorner 56142 26194 0\nZCorner 56143 25927 0\nZCorner 56144 25661 0\nZCorner 56145 25394 0\nZCorner 56145 25128 0\nZCorner 56154 25117 0\nZCorner 56163 25106 0\nZCorner 56172 25096 0\nZCorner 56180 25085 1\n$POLYSCORNERS\n56220 26307 0 0\n56229 26300 0 0\n56239 26294 0 0\n56259 26280 0 0\n56263 26258 0 0\n56267 26237 0 0\n56270 26215 0 0\n56274 26194 0 0\n56273 25932 0 0\n56272 25671 0 0\n56270 25147 0 0\n56267 25135 0 0\n56264 25122 0 0\n56262 25109 0 0\n56259 25096 0 0\n56251 25093 0 0\n56227 25081 0 0\n56216 25082 0 0\n56180 25085 0 0\n56172 25096 0 0\n56163 25106 0 0\n56145 25128 0 0\n56145 25394 0 0\n56144 25661 0 0\n56143 25927 0 0\n56142 26194 0 0\n56145 26214 0 0\n56148 26235 0 0\n56150 26255 0 0\n56153 26276 0 0\n56174 26294 0 0\n56181 26299 0 0\n56190 26301 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660002 0 \"\"\nZLayer 20\nZAux 53 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 61386 25174 0\nZCorner 61389 25158 0\nZCorner 61392 25141 0\nZCorner 61395 25125 0\nZCorner 61398 25108 0\nZCorner 61405 25101 0\nZCorner 61412 25094 0\nZCorner 61418 25088 0\nZCorner 61425 25081 0\nZCorner 61439 25084 0\nZCorner 61453 25087 0\nZCorner 61466 25090 0\nZCorner 61480 25093 0\nZCorner 61486 25105 0\nZCorner 61492 25118 0\nZCorner 61497 25131 0\nZCorner 61503 25143 0\nZCorner 61504 25406 0\nZCorner 61505 25669 0\nZCorner 61506 25931 0\nZCorner 61507 26194 0\nZCorner 61504 26212 0\nZCorner 61501 26231 0\nZCorner 61498 26249 0\nZCorner 61495 26268 0\nZCorner 61491 26276 0\nZCorner 61486 26284 0\nZCorner 61481 26292 0\nZCorner 61476 26299 0\nZCorner 61467 26301 0\nZCorner 61458 26303 0\nZCorner 61449 26305 0\nZCorner 61441 26307 0\nZCorner 61433 26304 0\nZCorner 61425 26301 0\nZCorner 61417 26298 0\nZCorner 61409 26295 0\nZCorner 61406 26290 0\nZCorner 61404 26284 0\nZCorner 61401 26278 0\nZCorner 61398 26272 0\nZCorner 61395 26253 0\nZCorner 61392 26233 0\nZCorner 61389 26213 0\nZCorner 61386 26194 0\nZCorner 61386 25939 0\nZCorner 61386 25684 0\nZCorner 61386 25429 0\nZCorner 61386 25174 0\nZCorner 61386 25174 0\nZCorner 61386 25174 0\nZCorner 61386 25174 0\nZCorner 61386 25174 1\n$POLYSCORNERS\n61441 26307 0 0\n61449 26305 0 0\n61476 26299 0 0\n61481 26292 0 0\n61491 26276 0 0\n61495 26268 0 0\n61498 26249 0 0\n61501 26231 0 0\n61504 26212 0 0\n61507 26194 0 0\n61506 25931 0 0\n61505 25669 0 0\n61503 25143 0 0\n61497 25131 0 0\n61492 25118 0 0\n61486 25105 0 0\n61480 25093 0 0\n61466 25090 0 0\n61453 25087 0 0\n61425 25081 0 0\n61398 25108 0 0\n61395 25125 0 0\n61392 25141 0 0\n61389 25158 0 0\n61386 25174 0 0\n61386 26194 0 0\n61389 26213 0 0\n61395 26253 0 0\n61398 26272 0 0\n61404 26284 0 0\n61406 26290 0 0\n61409 26295 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660003 0 \"\"\nZLayer 20\nZAux 49 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 59953 25159 0\nZCorner 59957 25143 0\nZCorner 59961 25128 0\nZCorner 59965 25112 0\nZCorner 59969 25096 0\nZCorner 59974 25092 0\nZCorner 59980 25088 0\nZCorner 59986 25085 0\nZCorner 59992 25081 0\nZCorner 60044 25070 0\nZCorner 60077 25125 0\nZCorner 60093 25245 0\nZCorner 60090 25432 0\nZCorner 60090 25622 0\nZCorner 60090 25813 0\nZCorner 60090 26003 0\nZCorner 60090 26194 0\nZCorner 60086 26213 0\nZCorner 60082 26233 0\nZCorner 60078 26252 0\nZCorner 60074 26272 0\nZCorner 60069 26278 0\nZCorner 60064 26285 0\nZCorner 60059 26292 0\nZCorner 60054 26299 0\nZCorner 60042 26301 0\nZCorner 60029 26303 0\nZCorner 60016 26305 0\nZCorner 60004 26307 0\nZCorner 59999 26307 0\nZCorner 59994 26307 0\nZCorner 59989 26307 0\nZCorner 59984 26307 0\nZCorner 59978 26300 0\nZCorner 59972 26293 0\nZCorner 59967 26286 0\nZCorner 59961 26280 0\nZCorner 59959 26258 0\nZCorner 59957 26237 0\nZCorner 59955 26215 0\nZCorner 59953 26194 0\nZCorner 59953 25935 0\nZCorner 59953 25676 0\nZCorner 59953 25418 0\nZCorner 59953 25159 0\nZCorner 59953 25159 0\nZCorner 59953 25159 0\nZCorner 59953 25159 0\nZCorner 59953 25159 1\n$POLYSCORNERS\n60004 26307 0 0\n60016 26305 0 0\n60042 26301 0 0\n60054 26299 0 0\n60069 26278 0 0\n60074 26272 0 0\n60078 26252 0 0\n60082 26233 0 0\n60086 26213 0 0\n60090 26194 0 0\n60090 25432 0 0\n60093 25245 0 0\n60077 25125 0 0\n60044 25070 0 0\n59992 25081 0 0\n59986 25085 0 0\n59980 25088 0 0\n59974 25092 0 0\n59969 25096 0 0\n59961 25128 0 0\n59957 25143 0 0\n59953 25159 0 0\n59953 26194 0 0\n59955 26215 0 0\n59957 26237 0 0\n59959 26258 0 0\n59961 26280 0 0\n59967 26286 0 0\n59972 26293 0 0\n59984 26307 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660004 0 \"\"\nZLayer 20\nZAux 41 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 56606 22603 0\nZCorner 56612 22598 0\nZCorner 56618 22593 0\nZCorner 56624 22589 0\nZCorner 56630 22584 0\nZCorner 56670 22596 0\nZCorner 56708 22604 0\nZCorner 56746 22606 0\nZCorner 56786 22603 0\nZCorner 56789 22603 0\nZCorner 56792 22603 0\nZCorner 56795 22603 0\nZCorner 56798 22603 0\nZCorner 56802 22613 0\nZCorner 56806 22623 0\nZCorner 56809 22632 0\nZCorner 56813 22642 0\nZCorner 56786 22643 0\nZCorner 56759 22644 0\nZCorner 56731 22645 0\nZCorner 56704 22646 0\nZCorner 56708 22652 0\nZCorner 56712 22658 0\nZCorner 56716 22664 0\nZCorner 56720 22670 0\nZCorner 56720 22671 0\nZCorner 56720 22672 0\nZCorner 56720 22673 0\nZCorner 56720 22673 0\nZCorner 56755 22731 0\nZCorner 56790 22789 0\nZCorner 56825 22846 0\nZCorner 56860 22904 0\nZCorner 56851 22910 0\nZCorner 56841 22916 0\nZCorner 56831 22921 0\nZCorner 56821 22927 0\nZCorner 56768 22846 0\nZCorner 56714 22765 0\nZCorner 56660 22684 0\nZCorner 56606 22603 1\n$POLYSCORNERS\n56821 22927 0 0\n56831 22921 0 0\n56841 22916 0 0\n56851 22910 0 0\n56860 22904 0 0\n56825 22846 0 0\n56790 22789 0 0\n56720 22673 0 0\n56720 22670 0 0\n56704 22646 0 0\n56731 22645 0 0\n56759 22644 0 0\n56813 22642 0 0\n56809 22632 0 0\n56806 22623 0 0\n56798 22603 0 0\n56786 22603 0 0\n56746 22606 0 0\n56708 22604 0 0\n56670 22596 0 0\n56630 22584 0 0\n56624 22589 0 0\n56618 22593 0 0\n56606 22603 0 0\n56768 22846 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660005 0 \"\"\nZLayer 20\nZAux 50 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 56665 22931 0\nZCorner 56665 22932 0\nZCorner 56665 22933 0\nZCorner 56665 22934 0\nZCorner 56665 22935 0\nZCorner 56667 22940 0\nZCorner 56669 22945 0\nZCorner 56671 22950 0\nZCorner 56673 22955 0\nZCorner 56642 23043 0\nZCorner 56594 23090 0\nZCorner 56530 23095 0\nZCorner 56450 23060 0\nZCorner 56373 22972 0\nZCorner 56334 22893 0\nZCorner 56333 22825 0\nZCorner 56372 22767 0\nZCorner 56452 22734 0\nZCorner 56527 22750 0\nZCorner 56599 22816 0\nZCorner 56665 22931 1\nZCorner 56384 22826 0\nZCorner 56384 22837 0\nZCorner 56384 22847 0\nZCorner 56384 22858 0\nZCorner 56384 22869 0\nZCorner 56387 22875 0\nZCorner 56390 22880 0\nZCorner 56393 22886 0\nZCorner 56395 22892 0\nZCorner 56450 22976 0\nZCorner 56500 23030 0\nZCorner 56548 23052 0\nZCorner 56591 23044 0\nZCorner 56618 23000 0\nZCorner 56617 22948 0\nZCorner 56587 22888 0\nZCorner 56528 22822 0\nZCorner 56515 22811 0\nZCorner 56501 22800 0\nZCorner 56487 22790 0\nZCorner 56473 22779 0\nZCorner 56460 22780 0\nZCorner 56446 22781 0\nZCorner 56433 22782 0\nZCorner 56419 22783 0\nZCorner 56410 22794 0\nZCorner 56401 22804 0\nZCorner 56393 22815 0\nZCorner 56384 22826 1\n$POLYSCORNERS\n56530 23095 0 0\n56548 23093 0 0\n56548 23052 0 0\n56500 23030 0 0\n56450 22976 0 0\n56395 22892 0 0\n56393 22886 0 0\n56390 22880 0 0\n56387 22875 0 0\n56384 22869 0 0\n56384 22826 0 0\n56393 22815 0 0\n56401 22804 0 0\n56410 22794 0 0\n56419 22783 0 0\n56433 22782 0 0\n56446 22781 0 0\n56460 22780 0 0\n56473 22779 0 0\n56487 22790 0 0\n56501 22800 0 0\n56515 22811 0 0\n56528 22822 0 0\n56587 22888 0 0\n56617 22948 0 0\n56618 23000 0 0\n56591 23044 0 0\n56548 23052 0 0\n56548 23093 0 0\n56594 23090 0 0\n56642 23043 0 0\n56673 22955 0 0\n56665 22935 0 0\n56665 22931 0 0\n56599 22816 0 0\n56527 22750 0 0\n56452 22734 0 0\n56372 22767 0 0\n56333 22825 0 0\n56334 22893 0 0\n56373 22972 0 0\n56450 23060 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660006 0 \"\"\nZLayer 20\nZAux 70 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 56966 22720 0\nZCorner 56898 22599 0\nZCorner 56878 22504 0\nZCorner 56904 22436 0\nZCorner 56977 22396 0\nZCorner 57057 22404 0\nZCorner 57119 22452 0\nZCorner 57165 22539 0\nZCorner 57196 22666 0\nZCorner 57191 22678 0\nZCorner 57186 22689 0\nZCorner 57181 22701 0\nZCorner 57177 22713 0\nZCorner 57171 22720 0\nZCorner 57165 22728 0\nZCorner 57159 22736 0\nZCorner 57153 22744 0\nZCorner 57140 22750 0\nZCorner 57128 22756 0\nZCorner 57115 22761 0\nZCorner 57102 22767 0\nZCorner 57088 22767 0\nZCorner 57073 22767 0\nZCorner 57058 22767 0\nZCorner 57044 22767 0\nZCorner 57037 22765 0\nZCorner 57030 22763 0\nZCorner 57023 22761 0\nZCorner 57017 22759 0\nZCorner 57004 22750 0\nZCorner 56991 22740 0\nZCorner 56979 22730 0\nZCorner 56966 22720 1\nZCorner 56935 22486 0\nZCorner 56936 22498 0\nZCorner 56937 22510 0\nZCorner 56937 22521 0\nZCorner 56938 22533 0\nZCorner 56973 22629 0\nZCorner 57011 22694 0\nZCorner 57052 22727 0\nZCorner 57095 22728 0\nZCorner 57105 22719 0\nZCorner 57116 22711 0\nZCorner 57127 22702 0\nZCorner 57138 22693 0\nZCorner 57139 22678 0\nZCorner 57139 22662 0\nZCorner 57140 22646 0\nZCorner 57141 22631 0\nZCorner 57127 22597 0\nZCorner 57112 22564 0\nZCorner 57098 22531 0\nZCorner 57083 22498 0\nZCorner 57074 22486 0\nZCorner 57065 22474 0\nZCorner 57057 22463 0\nZCorner 57048 22451 0\nZCorner 57035 22446 0\nZCorner 57022 22441 0\nZCorner 57010 22436 0\nZCorner 56997 22431 0\nZCorner 56986 22437 0\nZCorner 56976 22443 0\nZCorner 56965 22449 0\nZCorner 56954 22455 0\nZCorner 56949 22463 0\nZCorner 56944 22470 0\nZCorner 56939 22478 0\nZCorner 56935 22486 1\n$POLYSCORNERS\n57102 22767 0 0\n57115 22761 0 0\n57128 22756 0 0\n57140 22750 0 0\n57153 22744 0 0\n57171 22720 0 0\n57177 22713 0 0\n57181 22701 0 0\n57186 22689 0 0\n57191 22678 0 0\n57196 22666 0 0\n57165 22539 0 0\n57119 22452 0 0\n57057 22404 0 0\n56977 22396 0 0\n56904 22436 0 0\n56878 22504 0 0\n56898 22599 0 0\n56966 22720 0 0\n56979 22730 0 0\n56991 22740 0 0\n57004 22750 0 0\n57017 22759 0 0\n57023 22761 0 0\n57044 22767 0 0\n57095 22767 0 0\n57095 22728 0 0\n57052 22727 0 0\n57011 22694 0 0\n56973 22629 0 0\n56938 22533 0 0\n56937 22521 0 0\n56937 22510 0 0\n56935 22486 0 0\n56939 22478 0 0\n56944 22470 0 0\n56949 22463 0 0\n56954 22455 0 0\n56976 22443 0 0\n56986 22437 0 0\n56997 22431 0 0\n57010 22436 0 0\n57022 22441 0 0\n57048 22451 0 0\n57057 22463 0 0\n57065 22474 0 0\n57083 22498 0 0\n57098 22531 0 0\n57112 22564 0 0\n57127 22597 0 0\n57141 22631 0 0\n57140 22646 0 0\n57139 22662 0 0\n57139 22678 0 0\n57138 22693 0 0\n57116 22711 0 0\n57105 22719 0 0\n57095 22728 0 0\n57095 22767 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660007 0 \"\"\nZLayer 20\nZAux 66 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 56431 23134 0\nZCorner 56431 23138 0\nZCorner 56431 23142 0\nZCorner 56431 23146 0\nZCorner 56431 23150 0\nZCorner 56406 23238 0\nZCorner 56361 23285 0\nZCorner 56298 23292 0\nZCorner 56216 23259 0\nZCorner 56128 23177 0\nZCorner 56087 23098 0\nZCorner 56093 23024 0\nZCorner 56145 22955 0\nZCorner 56213 22933 0\nZCorner 56282 22955 0\nZCorner 56354 23022 0\nZCorner 56431 23134 1\nZCorner 56247 22998 0\nZCorner 56237 22994 0\nZCorner 56228 22990 0\nZCorner 56218 22986 0\nZCorner 56208 22982 0\nZCorner 56196 22985 0\nZCorner 56185 22988 0\nZCorner 56173 22991 0\nZCorner 56161 22994 0\nZCorner 56154 23005 0\nZCorner 56148 23015 0\nZCorner 56141 23026 0\nZCorner 56134 23037 0\nZCorner 56135 23049 0\nZCorner 56136 23062 0\nZCorner 56137 23075 0\nZCorner 56138 23087 0\nZCorner 56143 23092 0\nZCorner 56148 23097 0\nZCorner 56153 23102 0\nZCorner 56157 23107 0\nZCorner 56162 23116 0\nZCorner 56167 23125 0\nZCorner 56172 23133 0\nZCorner 56177 23142 0\nZCorner 56178 23144 0\nZCorner 56179 23146 0\nZCorner 56180 23148 0\nZCorner 56181 23150 0\nZCorner 56243 23211 0\nZCorner 56296 23243 0\nZCorner 56340 23245 0\nZCorner 56376 23216 0\nZCorner 56378 23204 0\nZCorner 56380 23191 0\nZCorner 56382 23178 0\nZCorner 56384 23166 0\nZCorner 56381 23157 0\nZCorner 56378 23148 0\nZCorner 56375 23139 0\nZCorner 56372 23131 0\nZCorner 56351 23105 0\nZCorner 56329 23080 0\nZCorner 56308 23054 0\nZCorner 56286 23029 0\nZCorner 56276 23021 0\nZCorner 56267 23013 0\nZCorner 56257 23006 0\nZCorner 56247 22998 1\n$POLYSCORNERS\n56298 23292 0 0\n56340 23287 0 0\n56340 23245 0 0\n56296 23243 0 0\n56243 23211 0 0\n56181 23150 0 0\n56177 23142 0 0\n56172 23133 0 0\n56167 23125 0 0\n56157 23107 0 0\n56153 23102 0 0\n56138 23087 0 0\n56137 23075 0 0\n56135 23049 0 0\n56134 23037 0 0\n56148 23015 0 0\n56154 23005 0 0\n56161 22994 0 0\n56185 22988 0 0\n56196 22985 0 0\n56208 22982 0 0\n56228 22990 0 0\n56237 22994 0 0\n56247 22998 0 0\n56257 23006 0 0\n56267 23013 0 0\n56276 23021 0 0\n56286 23029 0 0\n56308 23054 0 0\n56329 23080 0 0\n56351 23105 0 0\n56372 23131 0 0\n56375 23139 0 0\n56384 23166 0 0\n56382 23178 0 0\n56378 23204 0 0\n56376 23216 0 0\n56340 23245 0 0\n56340 23287 0 0\n56361 23285 0 0\n56406 23238 0 0\n56431 23150 0 0\n56431 23134 0 0\n56354 23022 0 0\n56282 22955 0 0\n56213 22933 0 0\n56145 22955 0 0\n56093 23024 0 0\n56087 23098 0 0\n56128 23177 0 0\n56216 23259 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660008 0 \"\"\nZLayer 20\nZAux 98 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 56411 28203 0\nZCorner 56408 28206 0\nZCorner 56405 28209 0\nZCorner 56403 28212 0\nZCorner 56400 28215 0\nZCorner 56399 28216 0\nZCorner 56398 28217 0\nZCorner 56397 28218 0\nZCorner 56396 28219 0\nZCorner 56320 28309 0\nZCorner 56247 28356 0\nZCorner 56176 28359 0\nZCorner 56107 28317 0\nZCorner 56083 28242 0\nZCorner 56093 28170 0\nZCorner 56139 28101 0\nZCorner 56220 28036 0\nZCorner 56222 28034 0\nZCorner 56224 28032 0\nZCorner 56226 28030 0\nZCorner 56228 28028 0\nZCorner 56295 28004 0\nZCorner 56351 28010 0\nZCorner 56397 28044 0\nZCorner 56431 28106 0\nZCorner 56429 28122 0\nZCorner 56427 28139 0\nZCorner 56425 28156 0\nZCorner 56423 28172 0\nZCorner 56422 28174 0\nZCorner 56421 28176 0\nZCorner 56420 28178 0\nZCorner 56419 28180 0\nZCorner 56419 28180 0\nZCorner 56419 28180 0\nZCorner 56419 28180 0\nZCorner 56419 28180 0\nZCorner 56417 28186 0\nZCorner 56415 28192 0\nZCorner 56413 28198 0\nZCorner 56411 28203 1\nZCorner 56177 28157 0\nZCorner 56175 28158 0\nZCorner 56173 28159 0\nZCorner 56171 28160 0\nZCorner 56169 28161 0\nZCorner 56169 28163 0\nZCorner 56169 28165 0\nZCorner 56169 28167 0\nZCorner 56169 28169 0\nZCorner 56167 28170 0\nZCorner 56165 28172 0\nZCorner 56163 28174 0\nZCorner 56161 28176 0\nZCorner 56159 28179 0\nZCorner 56157 28182 0\nZCorner 56155 28185 0\nZCorner 56153 28188 0\nZCorner 56146 28199 0\nZCorner 56140 28209 0\nZCorner 56133 28220 0\nZCorner 56126 28231 0\nZCorner 56126 28237 0\nZCorner 56126 28243 0\nZCorner 56126 28249 0\nZCorner 56126 28254 0\nZCorner 56132 28265 0\nZCorner 56138 28276 0\nZCorner 56144 28287 0\nZCorner 56150 28297 0\nZCorner 56164 28302 0\nZCorner 56179 28307 0\nZCorner 56193 28312 0\nZCorner 56208 28317 0\nZCorner 56214 28316 0\nZCorner 56220 28315 0\nZCorner 56226 28314 0\nZCorner 56231 28313 0\nZCorner 56244 28302 0\nZCorner 56257 28292 0\nZCorner 56269 28281 0\nZCorner 56282 28270 0\nZCorner 56356 28184 0\nZCorner 56383 28118 0\nZCorner 56365 28072 0\nZCorner 56302 28048 0\nZCorner 56291 28052 0\nZCorner 56280 28057 0\nZCorner 56270 28062 0\nZCorner 56259 28067 0\nZCorner 56248 28077 0\nZCorner 56237 28087 0\nZCorner 56227 28096 0\nZCorner 56216 28106 0\nZCorner 56206 28119 0\nZCorner 56196 28132 0\nZCorner 56187 28144 0\nZCorner 56177 28157 1\n$POLYSCORNERS\n56176 28359 0 0\n56208 28357 0 0\n56208 28317 0 0\n56193 28312 0 0\n56179 28307 0 0\n56164 28302 0 0\n56150 28297 0 0\n56144 28287 0 0\n56126 28254 0 0\n56126 28231 0 0\n56140 28209 0 0\n56146 28199 0 0\n56153 28188 0 0\n56161 28176 0 0\n56167 28170 0 0\n56169 28169 0 0\n56169 28161 0 0\n56177 28157 0 0\n56187 28144 0 0\n56196 28132 0 0\n56216 28106 0 0\n56227 28096 0 0\n56237 28087 0 0\n56259 28067 0 0\n56270 28062 0 0\n56280 28057 0 0\n56291 28052 0 0\n56302 28048 0 0\n56365 28072 0 0\n56383 28118 0 0\n56356 28184 0 0\n56282 28270 0 0\n56269 28281 0 0\n56257 28292 0 0\n56244 28302 0 0\n56231 28313 0 0\n56226 28314 0 0\n56208 28317 0 0\n56208 28357 0 0\n56247 28356 0 0\n56320 28309 0 0\n56396 28219 0 0\n56403 28212 0 0\n56405 28209 0 0\n56411 28203 0 0\n56413 28198 0 0\n56419 28180 0 0\n56423 28172 0 0\n56425 28156 0 0\n56429 28122 0 0\n56431 28106 0 0\n56397 28044 0 0\n56351 28010 0 0\n56295 28004 0 0\n56228 28028 0 0\n56220 28036 0 0\n56139 28101 0 0\n56093 28170 0 0\n56083 28242 0 0\n56107 28317 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660009 0 \"\"\nZLayer 20\nZAux 37 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 56442 28461 0\nZCorner 56444 28457 0\nZCorner 56446 28454 0\nZCorner 56448 28450 0\nZCorner 56450 28446 0\nZCorner 56491 28393 0\nZCorner 56532 28340 0\nZCorner 56573 28288 0\nZCorner 56614 28235 0\nZCorner 56625 28242 0\nZCorner 56636 28249 0\nZCorner 56646 28255 0\nZCorner 56657 28262 0\nZCorner 56601 28340 0\nZCorner 56544 28418 0\nZCorner 56488 28497 0\nZCorner 56431 28575 0\nZCorner 56422 28570 0\nZCorner 56413 28565 0\nZCorner 56404 28560 0\nZCorner 56396 28555 0\nZCorner 56396 28513 0\nZCorner 56390 28474 0\nZCorner 56378 28438 0\nZCorner 56360 28407 0\nZCorner 56368 28397 0\nZCorner 56376 28387 0\nZCorner 56384 28377 0\nZCorner 56392 28368 0\nZCorner 56402 28390 0\nZCorner 56411 28413 0\nZCorner 56421 28435 0\nZCorner 56431 28457 0\nZCorner 56434 28458 0\nZCorner 56437 28459 0\nZCorner 56439 28460 0\nZCorner 56442 28461 1\n$POLYSCORNERS\n56431 28575 0 0\n56488 28497 0 0\n56544 28418 0 0\n56601 28340 0 0\n56657 28262 0 0\n56646 28255 0 0\n56636 28249 0 0\n56614 28235 0 0\n56573 28288 0 0\n56532 28340 0 0\n56450 28446 0 0\n56446 28454 0 0\n56444 28457 0 0\n56442 28461 0 0\n56439 28460 0 0\n56437 28459 0 0\n56431 28457 0 0\n56411 28413 0 0\n56402 28390 0 0\n56392 28368 0 0\n56384 28377 0 0\n56360 28407 0 0\n56378 28438 0 0\n56390 28474 0 0\n56396 28513 0 0\n56396 28555 0 0\n56404 28560 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E66000A 0 \"\"\nZLayer 20\nZAux 49 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 56860 28403 0\nZCorner 56871 28409 0\nZCorner 56882 28415 0\nZCorner 56893 28420 0\nZCorner 56903 28426 0\nZCorner 56855 28507 0\nZCorner 56808 28588 0\nZCorner 56760 28669 0\nZCorner 56712 28750 0\nZCorner 56710 28752 0\nZCorner 56708 28754 0\nZCorner 56706 28756 0\nZCorner 56704 28758 0\nZCorner 56696 28755 0\nZCorner 56689 28752 0\nZCorner 56681 28749 0\nZCorner 56673 28747 0\nZCorner 56671 28729 0\nZCorner 56669 28711 0\nZCorner 56667 28694 0\nZCorner 56665 28676 0\nZCorner 56655 28658 0\nZCorner 56646 28639 0\nZCorner 56636 28621 0\nZCorner 56626 28602 0\nZCorner 56632 28591 0\nZCorner 56638 28581 0\nZCorner 56644 28570 0\nZCorner 56649 28559 0\nZCorner 56655 28567 0\nZCorner 56661 28575 0\nZCorner 56667 28583 0\nZCorner 56673 28590 0\nZCorner 56681 28605 0\nZCorner 56689 28620 0\nZCorner 56696 28634 0\nZCorner 56704 28649 0\nZCorner 56705 28650 0\nZCorner 56706 28651 0\nZCorner 56707 28652 0\nZCorner 56708 28653 0\nZCorner 56711 28647 0\nZCorner 56714 28641 0\nZCorner 56717 28635 0\nZCorner 56720 28630 0\nZCorner 56755 28573 0\nZCorner 56790 28516 0\nZCorner 56825 28460 0\nZCorner 56860 28403 1\n$POLYSCORNERS\n56704 28758 0 0\n56712 28750 0 0\n56808 28588 0 0\n56855 28507 0 0\n56903 28426 0 0\n56893 28420 0 0\n56882 28415 0 0\n56860 28403 0 0\n56825 28460 0 0\n56790 28516 0 0\n56720 28630 0 0\n56717 28635 0 0\n56708 28653 0 0\n56704 28649 0 0\n56696 28634 0 0\n56689 28620 0 0\n56673 28590 0 0\n56667 28583 0 0\n56649 28559 0 0\n56644 28570 0 0\n56638 28581 0 0\n56632 28591 0 0\n56626 28602 0 0\n56636 28621 0 0\n56646 28639 0 0\n56655 28658 0 0\n56665 28676 0 0\n56667 28694 0 0\n56669 28711 0 0\n56673 28747 0 0\n56681 28749 0 0\n56689 28752 0 0\n56696 28755 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E66000B 0 \"\"\nZLayer 20\nZAux 37 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 56958 28848 0\nZCorner 56943 28828 0\nZCorner 56929 28807 0\nZCorner 56914 28786 0\nZCorner 56900 28766 0\nZCorner 56906 28755 0\nZCorner 56913 28744 0\nZCorner 56920 28734 0\nZCorner 56927 28723 0\nZCorner 56941 28745 0\nZCorner 56956 28766 0\nZCorner 56971 28788 0\nZCorner 56985 28809 0\nZCorner 56990 28803 0\nZCorner 56995 28797 0\nZCorner 57000 28791 0\nZCorner 57005 28786 0\nZCorner 57034 28727 0\nZCorner 57064 28668 0\nZCorner 57093 28610 0\nZCorner 57122 28551 0\nZCorner 57134 28556 0\nZCorner 57146 28561 0\nZCorner 57157 28566 0\nZCorner 57169 28571 0\nZCorner 57127 28658 0\nZCorner 57085 28745 0\nZCorner 57043 28831 0\nZCorner 57001 28918 0\nZCorner 56992 28915 0\nZCorner 56983 28912 0\nZCorner 56975 28910 0\nZCorner 56966 28907 0\nZCorner 56964 28892 0\nZCorner 56962 28877 0\nZCorner 56960 28863 0\nZCorner 56958 28848 1\n$POLYSCORNERS\n57001 28918 0 0\n57043 28831 0 0\n57085 28745 0 0\n57169 28571 0 0\n57157 28566 0 0\n57146 28561 0 0\n57122 28551 0 0\n57093 28610 0 0\n57064 28668 0 0\n57034 28727 0 0\n57005 28786 0 0\n57000 28791 0 0\n56985 28809 0 0\n56971 28788 0 0\n56956 28766 0 0\n56941 28745 0 0\n56927 28723 0 0\n56920 28734 0 0\n56913 28744 0 0\n56906 28755 0 0\n56900 28766 0 0\n56914 28786 0 0\n56929 28807 0 0\n56943 28828 0 0\n56958 28848 0 0\n56960 28863 0 0\n56962 28877 0 0\n56966 28907 0 0\n56975 28910 0 0\n56983 28912 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E66000C 0 \"\"\nZLayer 20\nZAux 37 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 58707 22057 0\nZCorner 58717 22057 0\nZCorner 58727 22057 0\nZCorner 58737 22057 0\nZCorner 58747 22057 0\nZCorner 58766 22087 0\nZCorner 58790 22114 0\nZCorner 58817 22137 0\nZCorner 58848 22154 0\nZCorner 58851 22156 0\nZCorner 58854 22158 0\nZCorner 58857 22160 0\nZCorner 58860 22162 0\nZCorner 58859 22174 0\nZCorner 58858 22185 0\nZCorner 58857 22197 0\nZCorner 58856 22209 0\nZCorner 58841 22205 0\nZCorner 58821 22194 0\nZCorner 58794 22176 0\nZCorner 58762 22150 0\nZCorner 58762 22158 0\nZCorner 58762 22166 0\nZCorner 58762 22174 0\nZCorner 58762 22181 0\nZCorner 58756 22246 0\nZCorner 58751 22310 0\nZCorner 58745 22375 0\nZCorner 58739 22439 0\nZCorner 58726 22439 0\nZCorner 58713 22439 0\nZCorner 58701 22439 0\nZCorner 58688 22439 0\nZCorner 58693 22344 0\nZCorner 58698 22248 0\nZCorner 58703 22152 0\nZCorner 58707 22057 1\n$POLYSCORNERS\n58739 22439 0 0\n58745 22375 0 0\n58751 22310 0 0\n58756 22246 0 0\n58762 22181 0 0\n58762 22150 0 0\n58794 22176 0 0\n58821 22194 0 0\n58841 22205 0 0\n58856 22209 0 0\n58858 22185 0 0\n58859 22174 0 0\n58860 22162 0 0\n58848 22154 0 0\n58817 22137 0 0\n58790 22114 0 0\n58766 22087 0 0\n58747 22057 0 0\n58707 22057 0 0\n58703 22152 0 0\n58693 22344 0 0\n58688 22439 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E66000D 0 \"\"\nZLayer 20\nZAux 33 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 59036 22092 0\nZCorner 59045 22092 0\nZCorner 59055 22092 0\nZCorner 59065 22092 0\nZCorner 59075 22092 0\nZCorner 59094 22128 0\nZCorner 59119 22159 0\nZCorner 59147 22186 0\nZCorner 59180 22209 0\nZCorner 59178 22220 0\nZCorner 59176 22232 0\nZCorner 59174 22244 0\nZCorner 59172 22256 0\nZCorner 59152 22247 0\nZCorner 59131 22233 0\nZCorner 59109 22213 0\nZCorner 59086 22189 0\nZCorner 59084 22196 0\nZCorner 59082 22203 0\nZCorner 59080 22210 0\nZCorner 59078 22217 0\nZCorner 59067 22282 0\nZCorner 59055 22347 0\nZCorner 59043 22413 0\nZCorner 59032 22478 0\nZCorner 59019 22476 0\nZCorner 59006 22474 0\nZCorner 58994 22472 0\nZCorner 58981 22471 0\nZCorner 58995 22376 0\nZCorner 59008 22281 0\nZCorner 59022 22186 0\nZCorner 59036 22092 1\n$POLYSCORNERS\n59032 22478 0 0\n59043 22413 0 0\n59055 22347 0 0\n59067 22282 0 0\n59078 22217 0 0\n59086 22189 0 0\n59109 22213 0 0\n59131 22233 0 0\n59152 22247 0 0\n59172 22256 0 0\n59178 22220 0 0\n59180 22209 0 0\n59147 22186 0 0\n59119 22159 0 0\n59094 22128 0 0\n59075 22092 0 0\n59036 22092 0 0\n59022 22186 0 0\n59008 22281 0 0\n58995 22376 0 0\n58981 22471 0 0\n58994 22472 0 0\n59006 22474 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E66000E 0 \"\"\nZLayer 20\nZAux 74 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 59231 22424 0\nZCorner 59232 22414 0\nZCorner 59233 22404 0\nZCorner 59234 22394 0\nZCorner 59235 22385 0\nZCorner 59254 22275 0\nZCorner 59296 22203 0\nZCorner 59358 22169 0\nZCorner 59442 22174 0\nZCorner 59500 22229 0\nZCorner 59524 22300 0\nZCorner 59512 22387 0\nZCorner 59465 22490 0\nZCorner 59382 22543 0\nZCorner 59316 22549 0\nZCorner 59265 22509 0\nZCorner 59231 22424 1\nZCorner 59340 22232 0\nZCorner 59335 22245 0\nZCorner 59330 22258 0\nZCorner 59326 22270 0\nZCorner 59321 22283 0\nZCorner 59321 22283 0\nZCorner 59321 22283 0\nZCorner 59321 22283 0\nZCorner 59321 22283 0\nZCorner 59320 22285 0\nZCorner 59319 22287 0\nZCorner 59318 22289 0\nZCorner 59317 22291 0\nZCorner 59317 22293 0\nZCorner 59317 22295 0\nZCorner 59317 22297 0\nZCorner 59317 22299 0\nZCorner 59316 22299 0\nZCorner 59315 22299 0\nZCorner 59314 22299 0\nZCorner 59313 22299 0\nZCorner 59287 22395 0\nZCorner 59286 22463 0\nZCorner 59307 22502 0\nZCorner 59352 22513 0\nZCorner 59362 22509 0\nZCorner 59371 22506 0\nZCorner 59381 22502 0\nZCorner 59391 22498 0\nZCorner 59400 22486 0\nZCorner 59408 22474 0\nZCorner 59417 22463 0\nZCorner 59426 22451 0\nZCorner 59436 22418 0\nZCorner 59446 22384 0\nZCorner 59455 22351 0\nZCorner 59465 22318 0\nZCorner 59467 22305 0\nZCorner 59469 22293 0\nZCorner 59471 22280 0\nZCorner 59473 22267 0\nZCorner 59469 22259 0\nZCorner 59465 22252 0\nZCorner 59461 22244 0\nZCorner 59457 22236 0\nZCorner 59445 22229 0\nZCorner 59432 22222 0\nZCorner 59419 22215 0\nZCorner 59407 22209 0\nZCorner 59394 22211 0\nZCorner 59381 22213 0\nZCorner 59368 22214 0\nZCorner 59356 22216 0\nZCorner 59352 22220 0\nZCorner 59348 22224 0\nZCorner 59344 22228 0\nZCorner 59340 22232 1\n$POLYSCORNERS\n59316 22549 0 0\n59352 22545 0 0\n59352 22513 0 0\n59307 22502 0 0\n59286 22463 0 0\n59287 22395 0 0\n59313 22299 0 0\n59317 22299 0 0\n59317 22291 0 0\n59321 22283 0 0\n59326 22270 0 0\n59330 22258 0 0\n59340 22232 0 0\n59356 22216 0 0\n59368 22214 0 0\n59381 22213 0 0\n59407 22209 0 0\n59419 22215 0 0\n59445 22229 0 0\n59457 22236 0 0\n59465 22252 0 0\n59469 22259 0 0\n59473 22267 0 0\n59469 22293 0 0\n59467 22305 0 0\n59465 22318 0 0\n59455 22351 0 0\n59446 22384 0 0\n59436 22418 0 0\n59426 22451 0 0\n59417 22463 0 0\n59408 22474 0 0\n59400 22486 0 0\n59391 22498 0 0\n59371 22506 0 0\n59362 22509 0 0\n59352 22513 0 0\n59352 22545 0 0\n59382 22543 0 0\n59465 22490 0 0\n59512 22387 0 0\n59524 22300 0 0\n59500 22229 0 0\n59442 22174 0 0\n59358 22169 0 0\n59296 22203 0 0\n59254 22275 0 0\n59235 22385 0 0\n59234 22394 0 0\n59231 22424 0 0\n59265 22509 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E66000F 0 \"\"\nZLayer 20\nZAux 41 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 59993 22385 0\nZCorner 60002 22387 0\nZCorner 60012 22390 0\nZCorner 60022 22393 0\nZCorner 60032 22396 0\nZCorner 60031 22416 0\nZCorner 60041 22446 0\nZCorner 60063 22486 0\nZCorner 60098 22537 0\nZCorner 60092 22548 0\nZCorner 60086 22558 0\nZCorner 60081 22569 0\nZCorner 60075 22580 0\nZCorner 60066 22570 0\nZCorner 60057 22560 0\nZCorner 60048 22551 0\nZCorner 60040 22541 0\nZCorner 60033 22529 0\nZCorner 60026 22517 0\nZCorner 60019 22506 0\nZCorner 60012 22494 0\nZCorner 60009 22495 0\nZCorner 60006 22496 0\nZCorner 60003 22497 0\nZCorner 60001 22498 0\nZCorner 60000 22503 0\nZCorner 59999 22508 0\nZCorner 59998 22512 0\nZCorner 59997 22517 0\nZCorner 59967 22576 0\nZCorner 59938 22635 0\nZCorner 59909 22693 0\nZCorner 59879 22752 0\nZCorner 59869 22747 0\nZCorner 59858 22742 0\nZCorner 59847 22737 0\nZCorner 59836 22732 0\nZCorner 59875 22645 0\nZCorner 59914 22558 0\nZCorner 59954 22471 0\nZCorner 59993 22385 1\n$POLYSCORNERS\n59879 22752 0 0\n59909 22693 0 0\n59938 22635 0 0\n59967 22576 0 0\n59997 22517 0 0\n59998 22512 0 0\n59999 22508 0 0\n60001 22498 0 0\n60003 22497 0 0\n60012 22494 0 0\n60019 22506 0 0\n60026 22517 0 0\n60040 22541 0 0\n60048 22551 0 0\n60057 22560 0 0\n60075 22580 0 0\n60081 22569 0 0\n60086 22558 0 0\n60092 22548 0 0\n60098 22537 0 0\n60063 22486 0 0\n60041 22446 0 0\n60031 22416 0 0\n60032 22396 0 0\n60002 22387 0 0\n59993 22385 0 0\n59954 22471 0 0\n59914 22558 0 0\n59836 22732 0 0\n59869 22747 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660010 0 \"\"\nZLayer 20\nZAux 33 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 60137 22892 0\nZCorner 60126 22886 0\nZCorner 60116 22881 0\nZCorner 60105 22875 0\nZCorner 60094 22869 0\nZCorner 60143 22787 0\nZCorner 60192 22705 0\nZCorner 60240 22623 0\nZCorner 60289 22541 0\nZCorner 60298 22545 0\nZCorner 60307 22549 0\nZCorner 60316 22553 0\nZCorner 60324 22556 0\nZCorner 60323 22579 0\nZCorner 60331 22611 0\nZCorner 60348 22652 0\nZCorner 60375 22701 0\nZCorner 60369 22711 0\nZCorner 60363 22720 0\nZCorner 60358 22730 0\nZCorner 60352 22740 0\nZCorner 60346 22741 0\nZCorner 60334 22725 0\nZCorner 60317 22694 0\nZCorner 60293 22646 0\nZCorner 60289 22653 0\nZCorner 60285 22660 0\nZCorner 60281 22667 0\nZCorner 60278 22674 0\nZCorner 60242 22728 0\nZCorner 60207 22783 0\nZCorner 60172 22838 0\nZCorner 60137 22892 1\n$POLYSCORNERS\n60137 22892 0 0\n60172 22838 0 0\n60242 22728 0 0\n60278 22674 0 0\n60281 22667 0 0\n60293 22646 0 0\n60317 22694 0 0\n60334 22725 0 0\n60346 22741 0 0\n60352 22740 0 0\n60358 22730 0 0\n60363 22720 0 0\n60369 22711 0 0\n60375 22701 0 0\n60348 22652 0 0\n60331 22611 0 0\n60323 22579 0 0\n60324 22556 0 0\n60316 22553 0 0\n60289 22541 0 0\n60240 22623 0 0\n60192 22705 0 0\n60094 22869 0 0\n60116 22881 0 0\n60126 22886 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660011 0 \"\"\nZLayer 20\nZAux 46 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 57181 22455 0\nZCorner 57180 22437 0\nZCorner 57179 22420 0\nZCorner 57178 22402 0\nZCorner 57177 22385 0\nZCorner 57197 22325 0\nZCorner 57233 22286 0\nZCorner 57286 22269 0\nZCorner 57356 22275 0\nZCorner 57408 22323 0\nZCorner 57445 22385 0\nZCorner 57468 22461 0\nZCorner 57477 22548 0\nZCorner 57434 22622 0\nZCorner 57379 22649 0\nZCorner 57312 22631 0\nZCorner 57231 22568 0\nZCorner 57219 22540 0\nZCorner 57206 22511 0\nZCorner 57193 22483 0\nZCorner 57181 22455 1\nZCorner 57376 22369 0\nZCorner 57325 22321 0\nZCorner 57283 22308 0\nZCorner 57250 22329 0\nZCorner 57228 22385 0\nZCorner 57230 22390 0\nZCorner 57232 22396 0\nZCorner 57234 22402 0\nZCorner 57236 22408 0\nZCorner 57237 22423 0\nZCorner 57239 22437 0\nZCorner 57241 22452 0\nZCorner 57243 22466 0\nZCorner 57245 22467 0\nZCorner 57247 22468 0\nZCorner 57249 22469 0\nZCorner 57251 22470 0\nZCorner 57276 22540 0\nZCorner 57309 22584 0\nZCorner 57349 22603 0\nZCorner 57396 22595 0\nZCorner 57422 22572 0\nZCorner 57427 22526 0\nZCorner 57411 22458 0\nZCorner 57376 22369 1\n$POLYSCORNERS\n57379 22649 0 0\n57434 22622 0 0\n57477 22548 0 0\n57468 22461 0 0\n57445 22385 0 0\n57408 22323 0 0\n57356 22275 0 0\n57286 22269 0 0\n57233 22286 0 0\n57197 22325 0 0\n57177 22385 0 0\n57178 22402 0 0\n57179 22420 0 0\n57180 22437 0 0\n57181 22455 0 0\n57193 22483 0 0\n57206 22511 0 0\n57219 22540 0 0\n57231 22568 0 0\n57312 22631 0 0\n57349 22640 0 0\n57349 22603 0 0\n57309 22584 0 0\n57276 22540 0 0\n57251 22470 0 0\n57243 22466 0 0\n57241 22452 0 0\n57239 22437 0 0\n57237 22423 0 0\n57236 22408 0 0\n57230 22390 0 0\n57228 22385 0 0\n57250 22329 0 0\n57283 22308 0 0\n57325 22321 0 0\n57376 22369 0 0\n57411 22458 0 0\n57427 22526 0 0\n57422 22572 0 0\n57396 22595 0 0\n57349 22603 0 0\n57349 22640 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660012 0 \"\"\nZLayer 20\nZAux 33 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 57548 22178 0\nZCorner 57579 22201 0\nZCorner 57615 22219 0\nZCorner 57655 22232 0\nZCorner 57700 22240 0\nZCorner 57702 22251 0\nZCorner 57704 22261 0\nZCorner 57706 22272 0\nZCorner 57708 22283 0\nZCorner 57680 22277 0\nZCorner 57653 22271 0\nZCorner 57626 22265 0\nZCorner 57599 22259 0\nZCorner 57601 22267 0\nZCorner 57603 22275 0\nZCorner 57604 22283 0\nZCorner 57606 22291 0\nZCorner 57623 22354 0\nZCorner 57640 22418 0\nZCorner 57656 22481 0\nZCorner 57673 22545 0\nZCorner 57662 22547 0\nZCorner 57651 22550 0\nZCorner 57641 22553 0\nZCorner 57630 22556 0\nZCorner 57603 22463 0\nZCorner 57575 22371 0\nZCorner 57548 22278 0\nZCorner 57521 22185 0\nZCorner 57527 22183 0\nZCorner 57534 22181 0\nZCorner 57541 22179 0\nZCorner 57548 22178 1\n$POLYSCORNERS\n57630 22556 0 0\n57641 22553 0 0\n57651 22550 0 0\n57662 22547 0 0\n57673 22545 0 0\n57656 22481 0 0\n57640 22418 0 0\n57623 22354 0 0\n57606 22291 0 0\n57604 22283 0 0\n57603 22275 0 0\n57599 22259 0 0\n57680 22277 0 0\n57708 22283 0 0\n57704 22261 0 0\n57702 22251 0 0\n57700 22240 0 0\n57655 22232 0 0\n57615 22219 0 0\n57579 22201 0 0\n57548 22178 0 0\n57541 22179 0 0\n57527 22183 0 0\n57521 22185 0 0\n57575 22371 0 0\n57603 22463 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660013 0 \"\"\nZLayer 20\nZAux 33 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 57845 22115 0\nZCorner 57853 22112 0\nZCorner 57862 22109 0\nZCorner 57871 22106 0\nZCorner 57880 22103 0\nZCorner 57905 22128 0\nZCorner 57935 22147 0\nZCorner 57970 22163 0\nZCorner 58009 22174 0\nZCorner 58012 22186 0\nZCorner 58016 22199 0\nZCorner 58020 22212 0\nZCorner 58024 22225 0\nZCorner 57998 22216 0\nZCorner 57971 22207 0\nZCorner 57945 22198 0\nZCorner 57919 22189 0\nZCorner 57919 22196 0\nZCorner 57919 22203 0\nZCorner 57919 22210 0\nZCorner 57919 22217 0\nZCorner 57929 22282 0\nZCorner 57940 22348 0\nZCorner 57951 22413 0\nZCorner 57962 22479 0\nZCorner 57951 22480 0\nZCorner 57940 22482 0\nZCorner 57929 22484 0\nZCorner 57919 22486 0\nZCorner 57900 22394 0\nZCorner 57882 22301 0\nZCorner 57863 22208 0\nZCorner 57845 22115 1\n$POLYSCORNERS\n57919 22486 0 0\n57929 22484 0 0\n57951 22480 0 0\n57962 22479 0 0\n57951 22413 0 0\n57940 22348 0 0\n57929 22282 0 0\n57919 22217 0 0\n57919 22189 0 0\n57971 22207 0 0\n57998 22216 0 0\n58024 22225 0 0\n58012 22186 0 0\n58009 22174 0 0\n57970 22163 0 0\n57935 22147 0 0\n57905 22128 0 0\n57880 22103 0 0\n57853 22112 0 0\n57845 22115 0 0\n57863 22208 0 0\n57882 22301 0 0\n57900 22394 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660014 0 \"\"\nZLayer 20\nZAux 54 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 58149 22385 0\nZCorner 58146 22381 0\nZCorner 58143 22377 0\nZCorner 58140 22373 0\nZCorner 58138 22369 0\nZCorner 58108 22248 0\nZCorner 58116 22156 0\nZCorner 58160 22092 0\nZCorner 58243 22057 0\nZCorner 58315 22071 0\nZCorner 58361 22126 0\nZCorner 58381 22222 0\nZCorner 58376 22357 0\nZCorner 58372 22364 0\nZCorner 58368 22371 0\nZCorner 58364 22378 0\nZCorner 58360 22385 0\nZCorner 58320 22433 0\nZCorner 58272 22449 0\nZCorner 58215 22433 0\nZCorner 58149 22385 1\nZCorner 58259 22096 0\nZCorner 58246 22098 0\nZCorner 58233 22099 0\nZCorner 58221 22101 0\nZCorner 58208 22103 0\nZCorner 58202 22109 0\nZCorner 58196 22115 0\nZCorner 58190 22121 0\nZCorner 58184 22127 0\nZCorner 58182 22140 0\nZCorner 58179 22154 0\nZCorner 58176 22168 0\nZCorner 58173 22181 0\nZCorner 58170 22272 0\nZCorner 58181 22340 0\nZCorner 58206 22385 0\nZCorner 58243 22408 0\nZCorner 58292 22391 0\nZCorner 58322 22351 0\nZCorner 58333 22288 0\nZCorner 58325 22201 0\nZCorner 58323 22190 0\nZCorner 58321 22179 0\nZCorner 58319 22169 0\nZCorner 58317 22158 0\nZCorner 58313 22150 0\nZCorner 58309 22142 0\nZCorner 58305 22135 0\nZCorner 58302 22127 0\nZCorner 58291 22119 0\nZCorner 58280 22111 0\nZCorner 58269 22103 0\nZCorner 58259 22096 1\n$POLYSCORNERS\n58272 22449 0 0\n58320 22433 0 0\n58360 22385 0 0\n58376 22357 0 0\n58381 22222 0 0\n58361 22126 0 0\n58315 22071 0 0\n58243 22057 0 0\n58160 22092 0 0\n58116 22156 0 0\n58108 22248 0 0\n58138 22369 0 0\n58140 22373 0 0\n58149 22385 0 0\n58215 22433 0 0\n58243 22440 0 0\n58243 22408 0 0\n58206 22385 0 0\n58181 22340 0 0\n58170 22272 0 0\n58173 22181 0 0\n58176 22168 0 0\n58182 22140 0 0\n58184 22127 0 0\n58208 22103 0 0\n58221 22101 0 0\n58233 22099 0 0\n58246 22098 0 0\n58259 22096 0 0\n58269 22103 0 0\n58302 22127 0 0\n58305 22135 0 0\n58309 22142 0 0\n58317 22158 0 0\n58319 22169 0 0\n58321 22179 0 0\n58325 22201 0 0\n58333 22288 0 0\n58322 22351 0 0\n58292 22391 0 0\n58243 22408 0 0\n58243 22440 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660015 0 \"\"\nZLayer 20\nZAux 41 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 60567 22728 0\nZCorner 60575 22732 0\nZCorner 60584 22736 0\nZCorner 60593 22740 0\nZCorner 60602 22744 0\nZCorner 60599 22779 0\nZCorner 60605 22815 0\nZCorner 60617 22853 0\nZCorner 60637 22892 0\nZCorner 60631 22902 0\nZCorner 60625 22912 0\nZCorner 60619 22922 0\nZCorner 60613 22931 0\nZCorner 60604 22917 0\nZCorner 60594 22902 0\nZCorner 60584 22887 0\nZCorner 60574 22873 0\nZCorner 60571 22863 0\nZCorner 60568 22853 0\nZCorner 60566 22843 0\nZCorner 60563 22834 0\nZCorner 60559 22839 0\nZCorner 60555 22845 0\nZCorner 60551 22851 0\nZCorner 60547 22857 0\nZCorner 60546 22858 0\nZCorner 60545 22859 0\nZCorner 60544 22860 0\nZCorner 60543 22861 0\nZCorner 60503 22912 0\nZCorner 60463 22963 0\nZCorner 60423 23013 0\nZCorner 60383 23064 0\nZCorner 60372 23057 0\nZCorner 60361 23050 0\nZCorner 60351 23044 0\nZCorner 60340 23037 0\nZCorner 60397 22960 0\nZCorner 60453 22882 0\nZCorner 60510 22805 0\nZCorner 60567 22728 1\n$POLYSCORNERS\n60383 23064 0 0\n60423 23013 0 0\n60463 22963 0 0\n60543 22861 0 0\n60547 22857 0 0\n60559 22839 0 0\n60563 22834 0 0\n60566 22843 0 0\n60568 22853 0 0\n60574 22873 0 0\n60584 22887 0 0\n60604 22917 0 0\n60613 22931 0 0\n60619 22922 0 0\n60637 22892 0 0\n60617 22853 0 0\n60605 22815 0 0\n60599 22779 0 0\n60602 22744 0 0\n60575 22732 0 0\n60567 22728 0 0\n60453 22882 0 0\n60397 22960 0 0\n60340 23037 0 0\n60351 23044 0 0\n60361 23050 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660016 0 \"\"\nZLayer 20\nZAux 58 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 60574 23150 0\nZCorner 60577 23140 0\nZCorner 60580 23131 0\nZCorner 60583 23121 0\nZCorner 60586 23111 0\nZCorner 60653 23015 0\nZCorner 60720 22956 0\nZCorner 60785 22935 0\nZCorner 60848 22951 0\nZCorner 60905 23006 0\nZCorner 60919 23071 0\nZCorner 60891 23146 0\nZCorner 60820 23232 0\nZCorner 60813 23237 0\nZCorner 60807 23242 0\nZCorner 60800 23247 0\nZCorner 60793 23252 0\nZCorner 60696 23285 0\nZCorner 60627 23278 0\nZCorner 60586 23233 0\nZCorner 60574 23150 1\nZCorner 60719 23029 0\nZCorner 60715 23034 0\nZCorner 60711 23039 0\nZCorner 60707 23044 0\nZCorner 60703 23048 0\nZCorner 60645 23113 0\nZCorner 60615 23166 0\nZCorner 60615 23208 0\nZCorner 60645 23240 0\nZCorner 60696 23241 0\nZCorner 60745 23222 0\nZCorner 60791 23183 0\nZCorner 60836 23123 0\nZCorner 60842 23117 0\nZCorner 60848 23111 0\nZCorner 60854 23105 0\nZCorner 60860 23099 0\nZCorner 60863 23088 0\nZCorner 60867 23076 0\nZCorner 60871 23064 0\nZCorner 60875 23052 0\nZCorner 60865 23038 0\nZCorner 60856 23023 0\nZCorner 60846 23009 0\nZCorner 60836 22994 0\nZCorner 60827 22991 0\nZCorner 60818 22988 0\nZCorner 60810 22985 0\nZCorner 60801 22982 0\nZCorner 60791 22984 0\nZCorner 60781 22986 0\nZCorner 60772 22988 0\nZCorner 60762 22990 0\nZCorner 60751 23000 0\nZCorner 60740 23009 0\nZCorner 60730 23019 0\nZCorner 60719 23029 1\n$POLYSCORNERS\n60696 23241 0 0\n60696 23285 0 0\n60793 23252 0 0\n60807 23242 0 0\n60813 23237 0 0\n60820 23232 0 0\n60891 23146 0 0\n60919 23071 0 0\n60905 23006 0 0\n60848 22951 0 0\n60785 22935 0 0\n60720 22956 0 0\n60653 23015 0 0\n60586 23111 0 0\n60580 23131 0 0\n60577 23140 0 0\n60574 23150 0 0\n60586 23233 0 0\n60627 23278 0 0\n60696 23285 0 0\n60696 23241 0 0\n60645 23240 0 0\n60615 23208 0 0\n60615 23166 0 0\n60645 23113 0 0\n60703 23048 0 0\n60707 23044 0 0\n60719 23029 0 0\n60730 23019 0 0\n60740 23009 0 0\n60751 23000 0 0\n60762 22990 0 0\n60772 22988 0 0\n60781 22986 0 0\n60801 22982 0 0\n60810 22985 0 0\n60818 22988 0 0\n60836 22994 0 0\n60846 23009 0 0\n60856 23023 0 0\n60865 23038 0 0\n60875 23052 0 0\n60863 23088 0 0\n60860 23099 0 0\n60836 23123 0 0\n60791 23183 0 0\n60745 23222 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660017 0 \"\"\nZLayer 20\nZAux 54 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 57473 28774 0\nZCorner 57450 28898 0\nZCorner 57409 28982 0\nZCorner 57350 29028 0\nZCorner 57274 29036 0\nZCorner 57202 29003 0\nZCorner 57172 28939 0\nZCorner 57184 28844 0\nZCorner 57239 28719 0\nZCorner 57318 28663 0\nZCorner 57383 28653 0\nZCorner 57435 28690 0\nZCorner 57473 28774 1\nZCorner 57235 28871 0\nZCorner 57234 28878 0\nZCorner 57233 28885 0\nZCorner 57232 28892 0\nZCorner 57231 28899 0\nZCorner 57229 28908 0\nZCorner 57227 28916 0\nZCorner 57226 28925 0\nZCorner 57224 28934 0\nZCorner 57226 28942 0\nZCorner 57229 28950 0\nZCorner 57232 28957 0\nZCorner 57235 28965 0\nZCorner 57246 28972 0\nZCorner 57257 28979 0\nZCorner 57267 28986 0\nZCorner 57278 28992 0\nZCorner 57288 28992 0\nZCorner 57298 28992 0\nZCorner 57307 28992 0\nZCorner 57317 28992 0\nZCorner 57326 28988 0\nZCorner 57335 28983 0\nZCorner 57344 28978 0\nZCorner 57352 28973 0\nZCorner 57360 28959 0\nZCorner 57368 28946 0\nZCorner 57376 28932 0\nZCorner 57384 28918 0\nZCorner 57414 28822 0\nZCorner 57422 28752 0\nZCorner 57408 28708 0\nZCorner 57372 28692 0\nZCorner 57324 28705 0\nZCorner 57286 28739 0\nZCorner 57258 28793 0\nZCorner 57239 28868 0\nZCorner 57238 28869 0\nZCorner 57237 28869 0\nZCorner 57236 28870 0\nZCorner 57235 28871 1\n$POLYSCORNERS\n57274 29036 0 0\n57278 29035 0 0\n57278 28992 0 0\n57267 28986 0 0\n57257 28979 0 0\n57235 28965 0 0\n57232 28957 0 0\n57229 28950 0 0\n57226 28942 0 0\n57224 28934 0 0\n57226 28925 0 0\n57227 28916 0 0\n57229 28908 0 0\n57231 28899 0 0\n57235 28871 0 0\n57237 28869 0 0\n57238 28869 0 0\n57239 28868 0 0\n57258 28793 0 0\n57286 28739 0 0\n57324 28705 0 0\n57372 28692 0 0\n57408 28708 0 0\n57422 28752 0 0\n57414 28822 0 0\n57384 28918 0 0\n57368 28946 0 0\n57360 28959 0 0\n57352 28973 0 0\n57344 28978 0 0\n57326 28988 0 0\n57317 28992 0 0\n57278 28992 0 0\n57278 29035 0 0\n57350 29028 0 0\n57409 28982 0 0\n57450 28898 0 0\n57473 28774 0 0\n57435 28690 0 0\n57383 28653 0 0\n57318 28663 0 0\n57239 28719 0 0\n57184 28844 0 0\n57172 28939 0 0\n57202 29003 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660018 0 \"\"\nZLayer 20\nZAux 33 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 57970 28824 0\nZCorner 57982 28826 0\nZCorner 57995 28828 0\nZCorner 58007 28830 0\nZCorner 58020 28832 0\nZCorner 58006 28927 0\nZCorner 57991 29022 0\nZCorner 57976 29117 0\nZCorner 57962 29211 0\nZCorner 57952 29210 0\nZCorner 57942 29209 0\nZCorner 57932 29208 0\nZCorner 57923 29207 0\nZCorner 57896 29165 0\nZCorner 57870 29132 0\nZCorner 57845 29108 0\nZCorner 57821 29094 0\nZCorner 57823 29083 0\nZCorner 57825 29071 0\nZCorner 57827 29059 0\nZCorner 57829 29047 0\nZCorner 57848 29054 0\nZCorner 57869 29067 0\nZCorner 57890 29087 0\nZCorner 57911 29114 0\nZCorner 57914 29107 0\nZCorner 57917 29100 0\nZCorner 57920 29093 0\nZCorner 57923 29086 0\nZCorner 57935 29021 0\nZCorner 57946 28955 0\nZCorner 57958 28890 0\nZCorner 57970 28824 1\n$POLYSCORNERS\n57962 29211 0 0\n57976 29117 0 0\n58006 28927 0 0\n58020 28832 0 0\n58007 28830 0 0\n57995 28828 0 0\n57982 28826 0 0\n57970 28824 0 0\n57958 28890 0 0\n57946 28955 0 0\n57935 29021 0 0\n57923 29086 0 0\n57911 29114 0 0\n57890 29087 0 0\n57869 29067 0 0\n57848 29054 0 0\n57829 29047 0 0\n57823 29083 0 0\n57821 29094 0 0\n57845 29108 0 0\n57870 29132 0 0\n57896 29165 0 0\n57923 29207 0 0\n57932 29208 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660019 0 \"\"\nZLayer 20\nZAux 37 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 58149 29145 0\nZCorner 58148 29132 0\nZCorner 58147 29120 0\nZCorner 58146 29107 0\nZCorner 58146 29094 0\nZCorner 58168 29109 0\nZCorner 58190 29123 0\nZCorner 58213 29138 0\nZCorner 58235 29153 0\nZCorner 58237 29152 0\nZCorner 58239 29151 0\nZCorner 58241 29150 0\nZCorner 58243 29149 0\nZCorner 58243 29143 0\nZCorner 58243 29137 0\nZCorner 58243 29131 0\nZCorner 58243 29125 0\nZCorner 58248 29059 0\nZCorner 58253 28993 0\nZCorner 58258 28926 0\nZCorner 58263 28860 0\nZCorner 58276 28861 0\nZCorner 58290 28862 0\nZCorner 58304 28863 0\nZCorner 58318 28864 0\nZCorner 58312 28960 0\nZCorner 58306 29057 0\nZCorner 58300 29154 0\nZCorner 58294 29250 0\nZCorner 58285 29250 0\nZCorner 58277 29250 0\nZCorner 58268 29250 0\nZCorner 58259 29250 0\nZCorner 58232 29213 0\nZCorner 58204 29183 0\nZCorner 58176 29161 0\nZCorner 58149 29145 1\n$POLYSCORNERS\n58294 29250 0 0\n58300 29154 0 0\n58312 28960 0 0\n58318 28864 0 0\n58276 28861 0 0\n58263 28860 0 0\n58258 28926 0 0\n58253 28993 0 0\n58243 29125 0 0\n58243 29149 0 0\n58235 29153 0 0\n58213 29138 0 0\n58190 29123 0 0\n58168 29109 0 0\n58146 29094 0 0\n58146 29107 0 0\n58147 29120 0 0\n58148 29132 0 0\n58149 29145 0 0\n58176 29161 0 0\n58204 29183 0 0\n58232 29213 0 0\n58259 29250 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E66001A 0 \"\"\nZLayer 20\nZAux 66 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 57766 28844 0\nZCorner 57767 28848 0\nZCorner 57768 28852 0\nZCorner 57769 28856 0\nZCorner 57770 28860 0\nZCorner 57754 28986 0\nZCorner 57718 29074 0\nZCorner 57662 29123 0\nZCorner 57587 29133 0\nZCorner 57519 29112 0\nZCorner 57487 29055 0\nZCorner 57490 28961 0\nZCorner 57528 28832 0\nZCorner 57590 28765 0\nZCorner 57650 28744 0\nZCorner 57710 28769 0\nZCorner 57767 28840 0\nZCorner 57767 28841 0\nZCorner 57767 28842 0\nZCorner 57767 28843 0\nZCorner 57766 28844 1\nZCorner 57563 28871 0\nZCorner 57560 28881 0\nZCorner 57558 28891 0\nZCorner 57555 28901 0\nZCorner 57552 28910 0\nZCorner 57551 28911 0\nZCorner 57550 28912 0\nZCorner 57549 28913 0\nZCorner 57548 28914 0\nZCorner 57547 28929 0\nZCorner 57546 28944 0\nZCorner 57545 28958 0\nZCorner 57544 28973 0\nZCorner 57543 28973 0\nZCorner 57542 28973 0\nZCorner 57541 28973 0\nZCorner 57540 28973 0\nZCorner 57540 28979 0\nZCorner 57540 28985 0\nZCorner 57540 28990 0\nZCorner 57540 28996 0\nZCorner 57535 29035 0\nZCorner 57544 29065 0\nZCorner 57567 29086 0\nZCorner 57606 29098 0\nZCorner 57618 29093 0\nZCorner 57630 29088 0\nZCorner 57641 29083 0\nZCorner 57653 29078 0\nZCorner 57658 29072 0\nZCorner 57663 29065 0\nZCorner 57668 29058 0\nZCorner 57673 29051 0\nZCorner 57675 29044 0\nZCorner 57677 29037 0\nZCorner 57679 29031 0\nZCorner 57681 29024 0\nZCorner 57706 28954 0\nZCorner 57716 28894 0\nZCorner 57711 28844 0\nZCorner 57692 28805 0\nZCorner 57653 28787 0\nZCorner 57619 28793 0\nZCorner 57589 28821 0\nZCorner 57563 28871 1\n$POLYSCORNERS\n57587 29133 0 0\n57606 29130 0 0\n57606 29098 0 0\n57567 29086 0 0\n57544 29065 0 0\n57535 29035 0 0\n57540 28996 0 0\n57540 28973 0 0\n57544 28973 0 0\n57545 28958 0 0\n57546 28944 0 0\n57548 28914 0 0\n57552 28910 0 0\n57555 28901 0 0\n57558 28891 0 0\n57560 28881 0 0\n57563 28871 0 0\n57589 28821 0 0\n57619 28793 0 0\n57653 28787 0 0\n57692 28805 0 0\n57711 28844 0 0\n57716 28894 0 0\n57706 28954 0 0\n57681 29024 0 0\n57679 29031 0 0\n57677 29037 0 0\n57673 29051 0 0\n57658 29072 0 0\n57653 29078 0 0\n57641 29083 0 0\n57630 29088 0 0\n57606 29098 0 0\n57606 29130 0 0\n57662 29123 0 0\n57718 29074 0 0\n57754 28986 0 0\n57770 28860 0 0\n57766 28844 0 0\n57767 28843 0 0\n57767 28840 0 0\n57710 28769 0 0\n57650 28744 0 0\n57590 28765 0 0\n57528 28832 0 0\n57490 28961 0 0\n57487 29055 0 0\n57519 29112 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E66001B 0 \"\"\nZLayer 20\nZAux 54 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 59817 28684 0\nZCorner 59823 28601 0\nZCorner 59861 28553 0\nZCorner 59929 28540 0\nZCorner 60028 28563 0\nZCorner 60096 28673 0\nZCorner 60127 28763 0\nZCorner 60118 28834 0\nZCorner 60071 28887 0\nZCorner 59975 28897 0\nZCorner 59902 28868 0\nZCorner 59850 28802 0\nZCorner 59821 28700 0\nZCorner 59820 28698 0\nZCorner 59819 28696 0\nZCorner 59818 28694 0\nZCorner 59817 28692 0\nZCorner 59817 28690 0\nZCorner 59817 28688 0\nZCorner 59817 28686 0\nZCorner 59817 28684 1\nZCorner 60059 28735 0\nZCorner 60019 28646 0\nZCorner 59978 28591 0\nZCorner 59935 28568 0\nZCorner 59891 28579 0\nZCorner 59871 28633 0\nZCorner 59871 28690 0\nZCorner 59892 28752 0\nZCorner 59934 28817 0\nZCorner 59939 28824 0\nZCorner 59944 28830 0\nZCorner 59949 28837 0\nZCorner 59953 28844 0\nZCorner 59962 28849 0\nZCorner 59971 28854 0\nZCorner 59980 28859 0\nZCorner 59989 28864 0\nZCorner 60002 28862 0\nZCorner 60016 28860 0\nZCorner 60030 28858 0\nZCorner 60043 28856 0\nZCorner 60052 28844 0\nZCorner 60061 28832 0\nZCorner 60070 28821 0\nZCorner 60078 28809 0\nZCorner 60076 28792 0\nZCorner 60074 28776 0\nZCorner 60073 28759 0\nZCorner 60071 28743 0\nZCorner 60068 28741 0\nZCorner 60065 28739 0\nZCorner 60062 28737 0\nZCorner 60059 28735 1\n$POLYSCORNERS\n59975 28897 0 0\n59989 28895 0 0\n59989 28864 0 0\n59953 28844 0 0\n59949 28837 0 0\n59944 28830 0 0\n59939 28824 0 0\n59934 28817 0 0\n59892 28752 0 0\n59871 28690 0 0\n59871 28633 0 0\n59891 28579 0 0\n59935 28568 0 0\n59978 28591 0 0\n60019 28646 0 0\n60059 28735 0 0\n60071 28743 0 0\n60073 28759 0 0\n60074 28776 0 0\n60076 28792 0 0\n60078 28809 0 0\n60070 28821 0 0\n60061 28832 0 0\n60043 28856 0 0\n60030 28858 0 0\n60002 28862 0 0\n59989 28864 0 0\n59989 28895 0 0\n60071 28887 0 0\n60118 28834 0 0\n60127 28763 0 0\n60096 28673 0 0\n60028 28563 0 0\n59929 28540 0 0\n59861 28553 0 0\n59823 28601 0 0\n59817 28684 0 0\n59817 28692 0 0\n59821 28700 0 0\n59850 28802 0 0\n59902 28868 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E66001C 0 \"\"\nZLayer 20\nZAux 66 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 59743 28684 0\nZCorner 59743 28686 0\nZCorner 59743 28688 0\nZCorner 59743 28690 0\nZCorner 59743 28692 0\nZCorner 59746 28694 0\nZCorner 59748 28696 0\nZCorner 59751 28698 0\nZCorner 59754 28700 0\nZCorner 59811 28834 0\nZCorner 59830 28934 0\nZCorner 59811 28998 0\nZCorner 59754 29028 0\nZCorner 59661 29022 0\nZCorner 59593 28982 0\nZCorner 59550 28908 0\nZCorner 59532 28801 0\nZCorner 59551 28713 0\nZCorner 59593 28663 0\nZCorner 59657 28654 0\nZCorner 59743 28684 1\nZCorner 59688 28704 0\nZCorner 59680 28701 0\nZCorner 59672 28698 0\nZCorner 59665 28695 0\nZCorner 59657 28692 0\nZCorner 59608 28707 0\nZCorner 59583 28742 0\nZCorner 59583 28797 0\nZCorner 59606 28872 0\nZCorner 59613 28888 0\nZCorner 59620 28905 0\nZCorner 59627 28922 0\nZCorner 59633 28938 0\nZCorner 59639 28947 0\nZCorner 59645 28956 0\nZCorner 59651 28964 0\nZCorner 59657 28973 0\nZCorner 59665 28978 0\nZCorner 59672 28983 0\nZCorner 59680 28988 0\nZCorner 59688 28993 0\nZCorner 59701 28992 0\nZCorner 59713 28991 0\nZCorner 59726 28990 0\nZCorner 59739 28989 0\nZCorner 59749 28979 0\nZCorner 59758 28969 0\nZCorner 59768 28959 0\nZCorner 59778 28950 0\nZCorner 59779 28937 0\nZCorner 59780 28924 0\nZCorner 59781 28912 0\nZCorner 59782 28899 0\nZCorner 59779 28894 0\nZCorner 59776 28889 0\nZCorner 59773 28884 0\nZCorner 59770 28879 0\nZCorner 59756 28844 0\nZCorner 59743 28809 0\nZCorner 59729 28774 0\nZCorner 59715 28739 0\nZCorner 59708 28730 0\nZCorner 59702 28721 0\nZCorner 59695 28712 0\nZCorner 59688 28704 1\n$POLYSCORNERS\n59754 29028 0 0\n59811 28998 0 0\n59830 28934 0 0\n59811 28834 0 0\n59754 28700 0 0\n59748 28696 0 0\n59746 28694 0 0\n59743 28692 0 0\n59743 28684 0 0\n59657 28654 0 0\n59593 28663 0 0\n59551 28713 0 0\n59532 28801 0 0\n59550 28908 0 0\n59593 28982 0 0\n59661 29022 0 0\n59688 29023 0 0\n59688 28993 0 0\n59672 28983 0 0\n59665 28978 0 0\n59657 28973 0 0\n59651 28964 0 0\n59645 28956 0 0\n59633 28938 0 0\n59627 28922 0 0\n59613 28888 0 0\n59606 28872 0 0\n59583 28797 0 0\n59583 28742 0 0\n59608 28707 0 0\n59657 28692 0 0\n59665 28695 0 0\n59672 28698 0 0\n59688 28704 0 0\n59695 28712 0 0\n59702 28721 0 0\n59708 28730 0 0\n59715 28739 0 0\n59743 28809 0 0\n59756 28844 0 0\n59770 28879 0 0\n59782 28899 0 0\n59781 28912 0 0\n59780 28924 0 0\n59778 28950 0 0\n59768 28959 0 0\n59758 28969 0 0\n59749 28979 0 0\n59739 28989 0 0\n59713 28991 0 0\n59701 28992 0 0\n59688 28993 0 0\n59688 29023 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E66001D 0 \"\"\nZLayer 20\nZAux 37 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 59379 28747 0\nZCorner 59406 28838 0\nZCorner 59432 28930 0\nZCorner 59458 29022 0\nZCorner 59485 29114 0\nZCorner 59476 29116 0\nZCorner 59467 29118 0\nZCorner 59459 29120 0\nZCorner 59450 29122 0\nZCorner 59428 29105 0\nZCorner 59397 29089 0\nZCorner 59357 29075 0\nZCorner 59309 29063 0\nZCorner 59307 29052 0\nZCorner 59305 29041 0\nZCorner 59303 29031 0\nZCorner 59301 29020 0\nZCorner 59328 29027 0\nZCorner 59354 29034 0\nZCorner 59380 29040 0\nZCorner 59407 29047 0\nZCorner 59408 29047 0\nZCorner 59409 29047 0\nZCorner 59410 29047 0\nZCorner 59411 29047 0\nZCorner 59410 29040 0\nZCorner 59409 29034 0\nZCorner 59408 29027 0\nZCorner 59407 29020 0\nZCorner 59388 28954 0\nZCorner 59370 28889 0\nZCorner 59351 28824 0\nZCorner 59332 28758 0\nZCorner 59344 28755 0\nZCorner 59356 28752 0\nZCorner 59368 28749 0\nZCorner 59379 28747 1\n$POLYSCORNERS\n59450 29122 0 0\n59459 29120 0 0\n59467 29118 0 0\n59485 29114 0 0\n59458 29022 0 0\n59406 28838 0 0\n59379 28747 0 0\n59368 28749 0 0\n59332 28758 0 0\n59351 28824 0 0\n59370 28889 0 0\n59388 28954 0 0\n59407 29020 0 0\n59409 29034 0 0\n59410 29040 0 0\n59411 29047 0 0\n59407 29047 0 0\n59380 29040 0 0\n59354 29034 0 0\n59328 29027 0 0\n59301 29020 0 0\n59303 29031 0 0\n59305 29041 0 0\n59309 29063 0 0\n59357 29075 0 0\n59397 29089 0 0\n59428 29105 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E66001E 0 \"\"\nZLayer 20\nZAux 33 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 59043 28824 0\nZCorner 59055 28823 0\nZCorner 59067 28821 0\nZCorner 59079 28819 0\nZCorner 59090 28817 0\nZCorner 59108 28911 0\nZCorner 59125 29006 0\nZCorner 59143 29101 0\nZCorner 59160 29196 0\nZCorner 59151 29197 0\nZCorner 59141 29197 0\nZCorner 59131 29198 0\nZCorner 59121 29199 0\nZCorner 59100 29175 0\nZCorner 59071 29155 0\nZCorner 59034 29138 0\nZCorner 58989 29125 0\nZCorner 58987 29113 0\nZCorner 58985 29102 0\nZCorner 58983 29090 0\nZCorner 58981 29078 0\nZCorner 59007 29087 0\nZCorner 59033 29096 0\nZCorner 59060 29105 0\nZCorner 59086 29113 0\nZCorner 59087 29108 0\nZCorner 59088 29102 0\nZCorner 59089 29096 0\nZCorner 59090 29090 0\nZCorner 59078 29024 0\nZCorner 59067 28957 0\nZCorner 59055 28891 0\nZCorner 59043 28824 1\n$POLYSCORNERS\n59121 29199 0 0\n59141 29197 0 0\n59151 29197 0 0\n59160 29196 0 0\n59143 29101 0 0\n59125 29006 0 0\n59108 28911 0 0\n59090 28817 0 0\n59079 28819 0 0\n59055 28823 0 0\n59043 28824 0 0\n59055 28891 0 0\n59067 28957 0 0\n59078 29024 0 0\n59090 29090 0 0\n59087 29108 0 0\n59086 29113 0 0\n59060 29105 0 0\n59033 29096 0 0\n58981 29078 0 0\n58985 29102 0 0\n58987 29113 0 0\n58989 29125 0 0\n59034 29138 0 0\n59071 29155 0 0\n59100 29175 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E66001F 0 \"\"\nZLayer 20\nZAux 62 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 60356 28395 0\nZCorner 60345 28298 0\nZCorner 60371 28238 0\nZCorner 60436 28214 0\nZCorner 60539 28227 0\nZCorner 60632 28328 0\nZCorner 60675 28416 0\nZCorner 60670 28490 0\nZCorner 60617 28551 0\nZCorner 60544 28570 0\nZCorner 60476 28551 0\nZCorner 60414 28493 0\nZCorner 60356 28395 1\nZCorner 60617 28489 0\nZCorner 60620 28477 0\nZCorner 60623 28465 0\nZCorner 60626 28454 0\nZCorner 60629 28442 0\nZCorner 60623 28430 0\nZCorner 60617 28419 0\nZCorner 60612 28407 0\nZCorner 60606 28395 0\nZCorner 60553 28318 0\nZCorner 60505 28268 0\nZCorner 60462 28245 0\nZCorner 60422 28247 0\nZCorner 60415 28254 0\nZCorner 60408 28260 0\nZCorner 60402 28267 0\nZCorner 60395 28274 0\nZCorner 60393 28280 0\nZCorner 60391 28286 0\nZCorner 60389 28292 0\nZCorner 60387 28297 0\nZCorner 60387 28307 0\nZCorner 60387 28317 0\nZCorner 60387 28327 0\nZCorner 60387 28336 0\nZCorner 60404 28365 0\nZCorner 60420 28393 0\nZCorner 60437 28421 0\nZCorner 60453 28450 0\nZCorner 60461 28458 0\nZCorner 60469 28467 0\nZCorner 60477 28476 0\nZCorner 60485 28485 0\nZCorner 60486 28486 0\nZCorner 60487 28487 0\nZCorner 60487 28488 0\nZCorner 60488 28489 0\nZCorner 60498 28496 0\nZCorner 60508 28504 0\nZCorner 60518 28512 0\nZCorner 60527 28520 0\nZCorner 60540 28521 0\nZCorner 60553 28522 0\nZCorner 60566 28523 0\nZCorner 60578 28524 0\nZCorner 60588 28515 0\nZCorner 60598 28506 0\nZCorner 60608 28497 0\nZCorner 60617 28489 1\n$POLYSCORNERS\n60544 28570 0 0\n60578 28561 0 0\n60578 28524 0 0\n60566 28523 0 0\n60527 28520 0 0\n60518 28512 0 0\n60498 28496 0 0\n60488 28489 0 0\n60487 28488 0 0\n60487 28487 0 0\n60485 28485 0 0\n60461 28458 0 0\n60453 28450 0 0\n60437 28421 0 0\n60420 28393 0 0\n60404 28365 0 0\n60387 28336 0 0\n60387 28297 0 0\n60389 28292 0 0\n60395 28274 0 0\n60402 28267 0 0\n60408 28260 0 0\n60415 28254 0 0\n60422 28247 0 0\n60462 28245 0 0\n60505 28268 0 0\n60553 28318 0 0\n60606 28395 0 0\n60612 28407 0 0\n60617 28419 0 0\n60623 28430 0 0\n60629 28442 0 0\n60626 28454 0 0\n60623 28465 0 0\n60617 28489 0 0\n60608 28497 0 0\n60578 28524 0 0\n60578 28561 0 0\n60617 28551 0 0\n60670 28490 0 0\n60675 28416 0 0\n60632 28328 0 0\n60539 28227 0 0\n60436 28214 0 0\n60371 28238 0 0\n60345 28298 0 0\n60356 28395 0 0\n60414 28493 0 0\n60476 28551 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660020 0 \"\"\nZLayer 20\nZAux 78 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 60750 28016 0\nZCorner 60754 28019 0\nZCorner 60758 28020 0\nZCorner 60764 28022 0\nZCorner 60770 28024 0\nZCorner 60802 28055 0\nZCorner 60834 28087 0\nZCorner 60866 28118 0\nZCorner 60899 28149 0\nZCorner 60916 28178 0\nZCorner 60923 28213 0\nZCorner 60918 28253 0\nZCorner 60902 28297 0\nZCorner 60847 28354 0\nZCorner 60779 28361 0\nZCorner 60700 28318 0\nZCorner 60609 28223 0\nZCorner 60599 28206 0\nZCorner 60589 28188 0\nZCorner 60581 28169 0\nZCorner 60574 28149 0\nZCorner 60573 28138 0\nZCorner 60572 28128 0\nZCorner 60571 28117 0\nZCorner 60570 28106 0\nZCorner 60597 28052 0\nZCorner 60635 28019 0\nZCorner 60686 28007 0\nZCorner 60750 28016 1\nZCorner 60879 28231 0\nZCorner 60872 28217 0\nZCorner 60865 28204 0\nZCorner 60858 28190 0\nZCorner 60852 28176 0\nZCorner 60850 28175 0\nZCorner 60848 28174 0\nZCorner 60846 28173 0\nZCorner 60844 28172 0\nZCorner 60844 28172 0\nZCorner 60844 28171 0\nZCorner 60844 28170 0\nZCorner 60844 28169 0\nZCorner 60840 28165 0\nZCorner 60836 28161 0\nZCorner 60832 28157 0\nZCorner 60828 28153 0\nZCorner 60759 28080 0\nZCorner 60701 28049 0\nZCorner 60656 28058 0\nZCorner 60621 28106 0\nZCorner 60623 28120 0\nZCorner 60625 28134 0\nZCorner 60627 28147 0\nZCorner 60629 28161 0\nZCorner 60648 28184 0\nZCorner 60666 28208 0\nZCorner 60685 28231 0\nZCorner 60703 28255 0\nZCorner 60713 28263 0\nZCorner 60723 28270 0\nZCorner 60732 28278 0\nZCorner 60742 28286 0\nZCorner 60755 28294 0\nZCorner 60768 28302 0\nZCorner 60780 28310 0\nZCorner 60793 28317 0\nZCorner 60804 28316 0\nZCorner 60814 28315 0\nZCorner 60825 28314 0\nZCorner 60836 28313 0\nZCorner 60843 28308 0\nZCorner 60850 28302 0\nZCorner 60856 28296 0\nZCorner 60863 28290 0\nZCorner 60867 28275 0\nZCorner 60871 28261 0\nZCorner 60875 28246 0\nZCorner 60879 28231 1\n$POLYSCORNERS\n60779 28361 0 0\n60793 28359 0 0\n60793 28317 0 0\n60780 28310 0 0\n60768 28302 0 0\n60742 28286 0 0\n60732 28278 0 0\n60723 28270 0 0\n60713 28263 0 0\n60703 28255 0 0\n60685 28231 0 0\n60666 28208 0 0\n60648 28184 0 0\n60629 28161 0 0\n60627 28147 0 0\n60625 28134 0 0\n60621 28106 0 0\n60656 28058 0 0\n60701 28049 0 0\n60759 28080 0 0\n60828 28153 0 0\n60844 28169 0 0\n60844 28172 0 0\n60852 28176 0 0\n60858 28190 0 0\n60865 28204 0 0\n60872 28217 0 0\n60879 28231 0 0\n60871 28261 0 0\n60867 28275 0 0\n60863 28290 0 0\n60856 28296 0 0\n60850 28302 0 0\n60843 28308 0 0\n60836 28313 0 0\n60814 28315 0 0\n60804 28316 0 0\n60793 28317 0 0\n60793 28359 0 0\n60847 28354 0 0\n60902 28297 0 0\n60918 28253 0 0\n60923 28213 0 0\n60916 28178 0 0\n60899 28149 0 0\n60866 28118 0 0\n60834 28087 0 0\n60802 28055 0 0\n60770 28024 0 0\n60758 28020 0 0\n60754 28019 0 0\n60750 28016 0 0\n60686 28007 0 0\n60635 28019 0 0\n60597 28052 0 0\n60570 28106 0 0\n60572 28128 0 0\n60573 28138 0 0\n60574 28149 0 0\n60581 28169 0 0\n60589 28188 0 0\n60599 28206 0 0\n60609 28223 0 0\n60700 28318 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660021 0 \"\"\nZLayer 20\nZAux 33 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 60149 28403 0\nZCorner 60159 28397 0\nZCorner 60170 28391 0\nZCorner 60181 28385 0\nZCorner 60192 28379 0\nZCorner 60243 28458 0\nZCorner 60295 28536 0\nZCorner 60347 28614 0\nZCorner 60399 28692 0\nZCorner 60393 28698 0\nZCorner 60387 28704 0\nZCorner 60381 28709 0\nZCorner 60375 28715 0\nZCorner 60337 28703 0\nZCorner 60298 28697 0\nZCorner 60258 28694 0\nZCorner 60215 28696 0\nZCorner 60209 28687 0\nZCorner 60204 28678 0\nZCorner 60198 28669 0\nZCorner 60192 28661 0\nZCorner 60219 28659 0\nZCorner 60247 28657 0\nZCorner 60274 28655 0\nZCorner 60301 28653 0\nZCorner 60298 28647 0\nZCorner 60295 28641 0\nZCorner 60292 28635 0\nZCorner 60290 28629 0\nZCorner 60254 28573 0\nZCorner 60219 28516 0\nZCorner 60184 28459 0\nZCorner 60149 28403 1\n$POLYSCORNERS\n60375 28715 0 0\n60381 28709 0 0\n60387 28704 0 0\n60399 28692 0 0\n60243 28458 0 0\n60192 28379 0 0\n60159 28397 0 0\n60149 28403 0 0\n60184 28459 0 0\n60254 28573 0 0\n60290 28629 0 0\n60292 28635 0 0\n60301 28653 0 0\n60247 28657 0 0\n60219 28659 0 0\n60192 28661 0 0\n60198 28669 0 0\n60204 28678 0 0\n60209 28687 0 0\n60215 28696 0 0\n60258 28694 0 0\n60298 28697 0 0\n60337 28703 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660022 0 \"\"\nZLayer 20\nZAux 82 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 58665 28887 0\nZCorner 58668 28883 0\nZCorner 58672 28879 0\nZCorner 58676 28875 0\nZCorner 58680 28871 0\nZCorner 58694 28867 0\nZCorner 58708 28862 0\nZCorner 58721 28857 0\nZCorner 58735 28852 0\nZCorner 58744 28852 0\nZCorner 58753 28852 0\nZCorner 58761 28852 0\nZCorner 58770 28852 0\nZCorner 58782 28857 0\nZCorner 58794 28862 0\nZCorner 58805 28867 0\nZCorner 58817 28871 0\nZCorner 58828 28883 0\nZCorner 58839 28895 0\nZCorner 58849 28907 0\nZCorner 58860 28918 0\nZCorner 58887 29050 0\nZCorner 58886 29148 0\nZCorner 58858 29212 0\nZCorner 58801 29242 0\nZCorner 58709 29237 0\nZCorner 58649 29190 0\nZCorner 58620 29102 0\nZCorner 58622 28973 0\nZCorner 58623 28970 0\nZCorner 58624 28967 0\nZCorner 58625 28964 0\nZCorner 58626 28961 0\nZCorner 58626 28960 0\nZCorner 58626 28959 0\nZCorner 58626 28958 0\nZCorner 58626 28957 0\nZCorner 58636 28940 0\nZCorner 58645 28922 0\nZCorner 58655 28905 0\nZCorner 58665 28887 1\nZCorner 58786 29207 0\nZCorner 58794 29201 0\nZCorner 58803 29194 0\nZCorner 58812 29187 0\nZCorner 58821 29180 0\nZCorner 58823 29175 0\nZCorner 58825 29170 0\nZCorner 58827 29165 0\nZCorner 58829 29161 0\nZCorner 58830 29149 0\nZCorner 58831 29137 0\nZCorner 58832 29125 0\nZCorner 58833 29114 0\nZCorner 58833 29112 0\nZCorner 58833 29110 0\nZCorner 58833 29108 0\nZCorner 58833 29106 0\nZCorner 58833 29103 0\nZCorner 58834 29100 0\nZCorner 58835 29097 0\nZCorner 58836 29094 0\nZCorner 58825 28987 0\nZCorner 58801 28919 0\nZCorner 58766 28889 0\nZCorner 58719 28899 0\nZCorner 58689 28931 0\nZCorner 58674 28981 0\nZCorner 58674 29048 0\nZCorner 58688 29133 0\nZCorner 58694 29147 0\nZCorner 58700 29161 0\nZCorner 58706 29174 0\nZCorner 58711 29188 0\nZCorner 58715 29190 0\nZCorner 58719 29192 0\nZCorner 58723 29194 0\nZCorner 58727 29196 0\nZCorner 58742 29199 0\nZCorner 58756 29202 0\nZCorner 58771 29204 0\nZCorner 58786 29207 1\n$POLYSCORNERS\n58801 29242 0 0\n58858 29212 0 0\n58886 29148 0 0\n58887 29050 0 0\n58860 28918 0 0\n58849 28907 0 0\n58839 28895 0 0\n58817 28871 0 0\n58805 28867 0 0\n58794 28862 0 0\n58770 28852 0 0\n58735 28852 0 0\n58721 28857 0 0\n58708 28862 0 0\n58694 28867 0 0\n58680 28871 0 0\n58668 28883 0 0\n58665 28887 0 0\n58655 28905 0 0\n58645 28922 0 0\n58636 28940 0 0\n58626 28957 0 0\n58626 28961 0 0\n58622 28973 0 0\n58620 29102 0 0\n58649 29190 0 0\n58709 29237 0 0\n58786 29241 0 0\n58786 29207 0 0\n58771 29204 0 0\n58756 29202 0 0\n58742 29199 0 0\n58727 29196 0 0\n58711 29188 0 0\n58706 29174 0 0\n58700 29161 0 0\n58688 29133 0 0\n58674 29048 0 0\n58674 28981 0 0\n58689 28931 0 0\n58719 28899 0 0\n58766 28889 0 0\n58801 28919 0 0\n58825 28987 0 0\n58836 29094 0 0\n58833 29103 0 0\n58833 29114 0 0\n58832 29125 0 0\n58829 29161 0 0\n58827 29165 0 0\n58821 29180 0 0\n58794 29201 0 0\n58786 29207 0 0\n58786 29241 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E660023 0 \"\"\nZLayer 20\nZAux 62 E\nZClearance 80 T\nZMinThickness 60\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 59524 22541 0\nZCorner 59524 22540 0\nZCorner 59524 22539 0\nZCorner 59524 22538 0\nZCorner 59524 22537 0\nZCorner 59525 22529 0\nZCorner 59526 22521 0\nZCorner 59527 22513 0\nZCorner 59528 22506 0\nZCorner 59534 22475 0\nZCorner 59541 22445 0\nZCorner 59548 22415 0\nZCorner 59555 22385 0\nZCorner 59606 22305 0\nZCorner 59664 22267 0\nZCorner 59730 22270 0\nZCorner 59805 22314 0\nZCorner 59826 22360 0\nZCorner 59825 22422 0\nZCorner 59801 22499 0\nZCorner 59754 22592 0\nZCorner 59676 22638 0\nZCorner 59611 22645 0\nZCorner 59560 22612 0\nZCorner 59524 22541 1\nZCorner 59621 22385 0\nZCorner 59621 22385 0\nZCorner 59621 22386 0\nZCorner 59621 22387 0\nZCorner 59621 22388 0\nZCorner 59588 22465 0\nZCorner 59575 22527 0\nZCorner 59583 22572 0\nZCorner 59614 22603 0\nZCorner 59660 22607 0\nZCorner 59702 22577 0\nZCorner 59738 22513 0\nZCorner 59770 22416 0\nZCorner 59771 22408 0\nZCorner 59772 22400 0\nZCorner 59773 22392 0\nZCorner 59774 22385 0\nZCorner 59745 22329 0\nZCorner 59712 22308 0\nZCorner 59673 22321 0\nZCorner 59629 22369 0\nZCorner 59628 22370 0\nZCorner 59627 22371 0\nZCorner 59626 22372 0\nZCorner 59625 22373 0\nZCorner 59624 22375 0\nZCorner 59623 22377 0\nZCorner 59622 22379 0\nZCorner 59621 22381 0\nZCorner 59621 22382 0\nZCorner 59621 22383 0\nZCorner 59621 22384 0\nZCorner 59621 22385 0\nZCorner 59621 22385 0\nZCorner 59621 22385 0\nZCorner 59621 22385 0\nZCorner 59621 22385 1\n$POLYSCORNERS\n59611 22645 0 0\n59660 22639 0 0\n59660 22607 0 0\n59614 22603 0 0\n59583 22572 0 0\n59575 22527 0 0\n59588 22465 0 0\n59621 22388 0 0\n59621 22381 0 0\n59625 22373 0 0\n59629 22369 0 0\n59673 22321 0 0\n59712 22308 0 0\n59745 22329 0 0\n59774 22385 0 0\n59773 22392 0 0\n59770 22416 0 0\n59738 22513 0 0\n59702 22577 0 0\n59660 22607 0 0\n59660 22639 0 0\n59676 22638 0 0\n59754 22592 0 0\n59801 22499 0 0\n59825 22422 0 0\n59826 22360 0 0\n59805 22314 0 0\n59730 22270 0 0\n59664 22267 0 0\n59606 22305 0 0\n59555 22385 0 0\n59534 22475 0 0\n59528 22506 0 0\n59527 22513 0 0\n59524 22537 0 0\n59524 22541 0 0\n59560 22612 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E63E176 0 \"\"\nZLayer 21\nZAux 26 E\nZClearance 100 T\nZMinThickness 100\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 48804 23098 0\nZCorner 48804 23838 0\nZCorner 49190 23838 0\nZCorner 49190 24582 0\nZCorner 48804 24582 0\nZCorner 48804 27097 0\nZCorner 48816 27458 0\nZCorner 48851 27614 0\nZCorner 48975 27654 0\nZCorner 49250 27667 0\nZCorner 49250 28425 0\nZCorner 48673 28425 0\nZCorner 48254 28415 0\nZCorner 47975 28384 0\nZCorner 47778 28317 0\nZCorner 47607 28196 0\nZCorner 47477 28039 0\nZCorner 47408 27860 0\nZCorner 47379 27542 0\nZCorner 47369 26969 0\nZCorner 47369 24582 0\nZCorner 47061 24582 0\nZCorner 47061 23838 0\nZCorner 47369 23838 0\nZCorner 47369 23098 0\nZCorner 48804 23098 1\n$POLYSCORNERS\n49250 28425 0 0\n49250 27667 0 0\n48975 27654 0 0\n48851 27614 0 0\n48816 27458 0 0\n48804 27097 0 0\n48804 24582 0 0\n49190 24582 0 0\n49190 23838 0 0\n48804 23838 0 0\n48804 23098 0 0\n47369 23098 0 0\n47369 23838 0 0\n47061 23838 0 0\n47061 24582 0 0\n47369 24582 0 0\n47369 26969 0 0\n47379 27542 0 0\n47408 27860 0 0\n47477 28039 0 0\n47607 28196 0 0\n47778 28317 0 0\n47975 28384 0 0\n48254 28415 0 0\n48673 28425 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E63E177 0 \"\"\nZLayer 21\nZAux 58 E\nZClearance 100 T\nZMinThickness 100\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 52624 25376 0\nZCorner 52624 25951 0\nZCorner 52624 26526 0\nZCorner 52608 27076 0\nZCorner 52560 27456 0\nZCorner 52460 27742 0\nZCorner 52288 28009 0\nZCorner 52049 28232 0\nZCorner 51751 28387 0\nZCorner 51399 28479 0\nZCorner 50999 28510 0\nZCorner 50561 28484 0\nZCorner 50195 28405 0\nZCorner 49902 28274 0\nZCorner 49683 28090 0\nZCorner 49527 27857 0\nZCorner 49423 27580 0\nZCorner 49364 27206 0\nZCorner 49345 26682 0\nZCorner 49345 26080 0\nZCorner 49345 25478 0\nZCorner 49380 24895 0\nZCorner 49486 24455 0\nZCorner 49685 24123 0\nZCorner 49996 23864 0\nZCorner 50416 23696 0\nZCorner 50938 23640 0\nZCorner 51386 23676 0\nZCorner 51765 23784 0\nZCorner 52071 23949 0\nZCorner 52298 24157 0\nZCorner 52457 24391 0\nZCorner 52555 24632 0\nZCorner 52607 24940 0\nZCorner 52624 25376 1\nZCorner 51193 25021 0\nZCorner 51184 24727 0\nZCorner 51155 24566 0\nZCorner 51094 24496 0\nZCorner 50988 24472 0\nZCorner 50882 24496 0\nZCorner 50818 24566 0\nZCorner 50786 24727 0\nZCorner 50776 25021 0\nZCorner 50776 26082 0\nZCorner 50776 27143 0\nZCorner 50786 27418 0\nZCorner 50818 27576 0\nZCorner 50881 27652 0\nZCorner 50985 27677 0\nZCorner 51090 27654 0\nZCorner 51153 27585 0\nZCorner 51183 27440 0\nZCorner 51194 27189 0\nZCorner 51194 26105 0\nZCorner 51194 25021 0\nZCorner 51194 25021 0\nZCorner 51193 25021 1\n$POLYSCORNERS\n50999 28510 0 0\n51399 28479 0 0\n51751 28387 0 0\n52049 28232 0 0\n52288 28009 0 0\n52460 27742 0 0\n52560 27456 0 0\n52608 27076 0 0\n52624 26526 0 0\n52624 25376 0 0\n52607 24940 0 0\n52555 24632 0 0\n52457 24391 0 0\n52298 24157 0 0\n52071 23949 0 0\n51765 23784 0 0\n51386 23676 0 0\n50938 23640 0 0\n50416 23696 0 0\n49996 23864 0 0\n49685 24123 0 0\n49486 24455 0 0\n49380 24895 0 0\n49345 25478 0 0\n49345 26682 0 0\n49364 27206 0 0\n49423 27580 0 0\n49527 27857 0 0\n49683 28090 0 0\n49902 28274 0 0\n50195 28405 0 0\n50561 28484 0 0\n50985 28509 0 0\n50985 27677 0 0\n50881 27652 0 0\n50818 27576 0 0\n50786 27418 0 0\n50776 27143 0 0\n50776 25021 0 0\n50786 24727 0 0\n50818 24566 0 0\n50882 24496 0 0\n50988 24472 0 0\n51094 24496 0 0\n51155 24566 0 0\n51184 24727 0 0\n51193 25021 0 0\n51194 25021 0 0\n51194 27189 0 0\n51183 27440 0 0\n51153 27585 0 0\n51090 27654 0 0\n50985 27677 0 0\n50985 28509 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E63E178 0 \"\"\nZLayer 21\nZAux 56 E\nZClearance 100 T\nZMinThickness 100\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 56332 25376 0\nZCorner 56332 25951 0\nZCorner 56332 26526 0\nZCorner 56316 27076 0\nZCorner 56268 27456 0\nZCorner 56168 27742 0\nZCorner 55996 28009 0\nZCorner 55757 28232 0\nZCorner 55459 28387 0\nZCorner 55107 28479 0\nZCorner 54707 28510 0\nZCorner 54268 28484 0\nZCorner 53903 28405 0\nZCorner 53610 28274 0\nZCorner 53391 28090 0\nZCorner 53235 27857 0\nZCorner 53131 27580 0\nZCorner 53072 27206 0\nZCorner 53053 26682 0\nZCorner 53053 26080 0\nZCorner 53053 25478 0\nZCorner 53088 24895 0\nZCorner 53194 24455 0\nZCorner 53393 24123 0\nZCorner 53704 23864 0\nZCorner 54124 23696 0\nZCorner 54646 23640 0\nZCorner 55094 23676 0\nZCorner 55473 23784 0\nZCorner 55779 23949 0\nZCorner 56006 24157 0\nZCorner 56164 24391 0\nZCorner 56263 24632 0\nZCorner 56315 24940 0\nZCorner 56332 25376 1\nZCorner 54901 25021 0\nZCorner 54892 24727 0\nZCorner 54862 24566 0\nZCorner 54801 24496 0\nZCorner 54696 24472 0\nZCorner 54590 24496 0\nZCorner 54526 24566 0\nZCorner 54494 24727 0\nZCorner 54483 25021 0\nZCorner 54483 26082 0\nZCorner 54483 27143 0\nZCorner 54494 27418 0\nZCorner 54526 27576 0\nZCorner 54589 27652 0\nZCorner 54692 27677 0\nZCorner 54798 27654 0\nZCorner 54861 27585 0\nZCorner 54891 27440 0\nZCorner 54901 27189 0\nZCorner 54901 26105 0\nZCorner 54901 25021 1\n$POLYSCORNERS\n54707 28510 0 0\n55107 28479 0 0\n55459 28387 0 0\n55757 28232 0 0\n55996 28009 0 0\n56168 27742 0 0\n56268 27456 0 0\n56316 27076 0 0\n56332 26526 0 0\n56332 25376 0 0\n56315 24940 0 0\n56263 24632 0 0\n56164 24391 0 0\n56006 24157 0 0\n55779 23949 0 0\n55473 23784 0 0\n55094 23676 0 0\n54646 23640 0 0\n54124 23696 0 0\n53704 23864 0 0\n53393 24123 0 0\n53194 24455 0 0\n53088 24895 0 0\n53053 25478 0 0\n53053 26682 0 0\n53072 27206 0 0\n53131 27580 0 0\n53235 27857 0 0\n53391 28090 0 0\n53610 28274 0 0\n53903 28405 0 0\n54268 28484 0 0\n54692 28509 0 0\n54692 27677 0 0\n54589 27652 0 0\n54526 27576 0 0\n54494 27418 0 0\n54483 27143 0 0\n54483 25021 0 0\n54494 24727 0 0\n54526 24566 0 0\n54590 24496 0 0\n54696 24472 0 0\n54801 24496 0 0\n54862 24566 0 0\n54892 24727 0 0\n54901 25021 0 0\n54901 27189 0 0\n54891 27440 0 0\n54861 27585 0 0\n54798 27654 0 0\n54692 27677 0 0\n54692 28509 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E63E179 0 \"\"\nZLayer 21\nZAux 17 E\nZClearance 100 T\nZMinThickness 100\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 58984 23725 0\nZCorner 58984 28425 0\nZCorner 57553 28425 0\nZCorner 57553 26569 0\nZCorner 57511 25696 0\nZCorner 57432 25527 0\nZCorner 57284 25400 0\nZCorner 57048 25321 0\nZCorner 56707 25294 0\nZCorner 56707 23640 0\nZCorner 56985 23699 0\nZCorner 57228 23836 0\nZCorner 57436 24050 0\nZCorner 57610 24343 0\nZCorner 57553 23725 0\nZCorner 58984 23725 0\nZCorner 58984 23725 1\n$POLYSCORNERS\n58984 28425 0 0\n58984 23725 0 0\n57553 23725 0 0\n57610 24343 0 0\n57436 24050 0 0\n57228 23836 0 0\n56985 23699 0 0\n56707 23640 0 0\n56707 25294 0 0\n57048 25321 0 0\n57284 25400 0 0\n57432 25527 0 0\n57511 25696 0 0\n57553 26569 0 0\n57553 28425 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E63E17A 0 \"\"\nZLayer 21\nZAux 49 E\nZClearance 100 T\nZMinThickness 100\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 62562 25499 0\nZCorner 61212 25499 0\nZCorner 61212 24958 0\nZCorner 61201 24720 0\nZCorner 61166 24573 0\nZCorner 61101 24498 0\nZCorner 60996 24472 0\nZCorner 60893 24495 0\nZCorner 60830 24561 0\nZCorner 60798 24705 0\nZCorner 60787 24958 0\nZCorner 60787 27174 0\nZCorner 60803 27395 0\nZCorner 60851 27552 0\nZCorner 60930 27646 0\nZCorner 61038 27677 0\nZCorner 61160 27645 0\nZCorner 61235 27546 0\nZCorner 61274 27357 0\nZCorner 61286 27051 0\nZCorner 61286 26491 0\nZCorner 62561 26491 0\nZCorner 62549 26984 0\nZCorner 62520 27336 0\nZCorner 62443 27621 0\nZCorner 62283 27913 0\nZCorner 62053 28172 0\nZCorner 61761 28359 0\nZCorner 61401 28472 0\nZCorner 60964 28509 0\nZCorner 60422 28458 0\nZCorner 60005 28302 0\nZCorner 59702 28054 0\nZCorner 59503 27721 0\nZCorner 59393 27270 0\nZCorner 59356 26661 0\nZCorner 59356 25326 0\nZCorner 59386 24801 0\nZCorner 59477 24423 0\nZCorner 59665 24135 0\nZCorner 59990 23879 0\nZCorner 60426 23700 0\nZCorner 60946 23640 0\nZCorner 61465 23699 0\nZCorner 61902 23877 0\nZCorner 62233 24146 0\nZCorner 62430 24476 0\nZCorner 62529 24912 0\nZCorner 62562 25499 1\n$POLYSCORNERS\n60964 28509 0 0\n61401 28472 0 0\n61761 28359 0 0\n62053 28172 0 0\n62283 27913 0 0\n62443 27621 0 0\n62520 27336 0 0\n62549 26984 0 0\n62561 26491 0 0\n61286 26491 0 0\n61286 27051 0 0\n61274 27357 0 0\n61235 27546 0 0\n61160 27645 0 0\n61038 27677 0 0\n60930 27646 0 0\n60851 27552 0 0\n60803 27395 0 0\n60787 27174 0 0\n60787 24958 0 0\n60798 24705 0 0\n60830 24561 0 0\n60893 24495 0 0\n60996 24472 0 0\n61101 24498 0 0\n61166 24573 0 0\n61201 24720 0 0\n61212 24958 0 0\n61212 25499 0 0\n62562 25499 0 0\n62529 24912 0 0\n62430 24476 0 0\n62233 24146 0 0\n61902 23877 0 0\n61465 23699 0 0\n60946 23640 0 0\n60426 23700 0 0\n59990 23879 0 0\n59665 24135 0 0\n59477 24423 0 0\n59386 24801 0 0\n59356 25326 0 0\n59356 26661 0 0\n59393 27270 0 0\n59503 27721 0 0\n59702 28054 0 0\n60005 28302 0 0\n60422 28458 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E63E17B 0 \"\"\nZLayer 21\nZAux 56 E\nZClearance 100 T\nZMinThickness 100\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 66106 25376 0\nZCorner 66106 25951 0\nZCorner 66106 26526 0\nZCorner 66090 27076 0\nZCorner 66042 27456 0\nZCorner 65942 27742 0\nZCorner 65770 28009 0\nZCorner 65531 28232 0\nZCorner 65233 28387 0\nZCorner 64881 28479 0\nZCorner 64480 28510 0\nZCorner 64042 28484 0\nZCorner 63676 28405 0\nZCorner 63384 28274 0\nZCorner 63165 28090 0\nZCorner 63008 27857 0\nZCorner 62904 27580 0\nZCorner 62846 27206 0\nZCorner 62826 26682 0\nZCorner 62826 26080 0\nZCorner 62826 25478 0\nZCorner 62862 24895 0\nZCorner 62968 24455 0\nZCorner 63166 24123 0\nZCorner 63478 23864 0\nZCorner 63898 23696 0\nZCorner 64420 23640 0\nZCorner 64868 23676 0\nZCorner 65247 23784 0\nZCorner 65553 23949 0\nZCorner 65780 24157 0\nZCorner 65938 24391 0\nZCorner 66036 24632 0\nZCorner 66088 24940 0\nZCorner 66106 25376 1\nZCorner 64675 25021 0\nZCorner 64666 24727 0\nZCorner 64636 24566 0\nZCorner 64575 24496 0\nZCorner 64469 24472 0\nZCorner 64364 24496 0\nZCorner 64299 24566 0\nZCorner 64268 24727 0\nZCorner 64257 25021 0\nZCorner 64257 26082 0\nZCorner 64257 27143 0\nZCorner 64268 27418 0\nZCorner 64299 27576 0\nZCorner 64363 27652 0\nZCorner 64466 27677 0\nZCorner 64572 27654 0\nZCorner 64634 27585 0\nZCorner 64665 27440 0\nZCorner 64675 27189 0\nZCorner 64675 26105 0\nZCorner 64675 25021 1\n$POLYSCORNERS\n64480 28510 0 0\n64881 28479 0 0\n65233 28387 0 0\n65531 28232 0 0\n65770 28009 0 0\n65942 27742 0 0\n66042 27456 0 0\n66090 27076 0 0\n66106 26526 0 0\n66106 25376 0 0\n66088 24940 0 0\n66036 24632 0 0\n65938 24391 0 0\n65780 24157 0 0\n65553 23949 0 0\n65247 23784 0 0\n64868 23676 0 0\n64420 23640 0 0\n63898 23696 0 0\n63478 23864 0 0\n63166 24123 0 0\n62968 24455 0 0\n62862 24895 0 0\n62826 25478 0 0\n62826 26682 0 0\n62846 27206 0 0\n62904 27580 0 0\n63008 27857 0 0\n63165 28090 0 0\n63384 28274 0 0\n63676 28405 0 0\n64042 28484 0 0\n64466 28509 0 0\n64466 27677 0 0\n64363 27652 0 0\n64299 27576 0 0\n64268 27418 0 0\n64257 27143 0 0\n64257 25021 0 0\n64268 24727 0 0\n64299 24566 0 0\n64364 24496 0 0\n64469 24472 0 0\n64575 24496 0 0\n64636 24566 0 0\n64666 24727 0 0\n64675 25021 0 0\n64675 27189 0 0\n64665 27440 0 0\n64634 27585 0 0\n64572 27654 0 0\n64466 27677 0 0\n64466 28509 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$CZONE_OUTLINE\nZInfo 4E63E17C 0 \"\"\nZLayer 21\nZAux 27 E\nZClearance 100 T\nZMinThickness 100\nZOptions 0 16 F 200 200\nZSmoothing 0 0\nZCorner 68032 23725 0\nZCorner 68008 24158 0\nZCorner 68181 23932 0\nZCorner 68388 23770 0\nZCorner 68630 23673 0\nZCorner 68907 23640 0\nZCorner 69242 23684 0\nZCorner 69509 23814 0\nZCorner 69701 24010 0\nZCorner 69810 24251 0\nZCorner 69861 24603 0\nZCorner 69877 25131 0\nZCorner 69877 28425 0\nZCorner 68447 28425 0\nZCorner 68447 25170 0\nZCorner 68439 24780 0\nZCorner 68415 24579 0\nZCorner 68355 24499 0\nZCorner 68238 24472 0\nZCorner 68114 24503 0\nZCorner 68047 24595 0\nZCorner 68017 24819 0\nZCorner 68008 25248 0\nZCorner 68008 28425 0\nZCorner 66577 28425 0\nZCorner 66577 23725 0\nZCorner 68032 23725 1\n$POLYSCORNERS\n69877 28425 0 0\n69877 25131 0 0\n69861 24603 0 0\n69810 24251 0 0\n69701 24010 0 0\n69509 23814 0 0\n69242 23684 0 0\n68907 23640 0 0\n68630 23673 0 0\n68388 23770 0 0\n68181 23932 0 0\n68008 24158 0 0\n68032 23725 0 0\n66577 23725 0 0\n66577 28425 0 0\n68008 28425 0 0\n68008 25248 0 0\n68017 24819 0 0\n68047 24595 0 0\n68114 24503 0 0\n68238 24472 0 0\n68355 24499 0 0\n68415 24579 0 0\n68439 24780 0 0\n68447 25170 0 0\n68447 28425 1 0\n$endPOLYSCORNERS\n$endCZONE_OUTLINE\n$EndBOARD\n" }, { "path": "src/test/resources/samples/langs/KiCad Schematic/Volume.sch", "content": "EESchema Schematic File Version 2\nLIBS:mfk_alps\nLIBS:mfk_connector\nLIBS:mfk_interface\nLIBS:power\nLIBS:device\nLIBS:transistors\nLIBS:conn\nLIBS:linear\nLIBS:regul\nLIBS:74xx\nLIBS:cmos4000\nLIBS:adc-dac\nLIBS:memory\nLIBS:xilinx\nLIBS:special\nLIBS:microcontrollers\nLIBS:dsp\nLIBS:microchip\nLIBS:analog_switches\nLIBS:motorola\nLIBS:texas\nLIBS:intel\nLIBS:audio\nLIBS:interface\nLIBS:digital-audio\nLIBS:philips\nLIBS:display\nLIBS:cypress\nLIBS:siliconi\nLIBS:opto\nLIBS:atmel\nLIBS:contrib\nLIBS:valves\nLIBS:Volume-AlpsRK16814MG-cache\nEELAYER 27 0\nEELAYER END\n$Descr A 11000 8500\nencoding utf-8\nSheet 1 1\nTitle \"ALPS RK16816MG with H-bridge\"\nDate \"4 apr 2015\"\nRev \"\"\nComp \"Mithat Konar\"\nComment1 \"Copyright (C) 2015 Mithat Konar\"\nComment2 \"CERN Open Hardware Licence v1.2\"\nComment3 \"\"\nComment4 \"\"\n$EndDescr\n$Comp\nL SN754410 U1\nU 1 1 550CA683\nP 7600 4650\nF 0 \"U1\" H 7600 5350 60 0000 C CNN\nF 1 \"SN754410\" H 7600 4000 60 0000 C CNN\nF 2 \"mfk-DIP-16_AriesC84_e\" H 7600 4650 60 0001 C CNN\nF 3 \"~\" H 7600 4650 60 0000 C CNN\n\t1 7600 4650\n\t1 0 0 -1 \n$EndComp\n$Comp\nL DGND #PWR01\nU 1 1 550CA83D\nP 8450 5500\nF 0 \"#PWR01\" H 8450 5500 40 0001 C CNN\nF 1 \"DGND\" H 8450 5430 40 0000 C CNN\nF 2 \"\" H 8450 5500 60 0000 C CNN\nF 3 \"\" H 8450 5500 60 0000 C CNN\n\t1 8450 5500\n\t1 0 0 -1 \n$EndComp\n$Comp\nL DGND #PWR02\nU 1 1 550CA86E\nP 6600 5300\nF 0 \"#PWR02\" H 6600 5300 40 0001 C CNN\nF 1 \"DGND\" H 6600 5230 40 0000 C CNN\nF 2 \"\" H 6600 5300 60 0000 C CNN\nF 3 \"\" H 6600 5300 60 0000 C CNN\n\t1 6600 5300\n\t1 0 0 -1 \n$EndComp\nWire Wire Line\n\t6900 4550 6600 4550\nWire Wire Line\n\t6600 4550 6600 5300\nWire Wire Line\n\t6900 4700 6600 4700\nConnection ~ 6600 4700\nWire Wire Line\n\t8300 4550 8450 4550\nWire Wire Line\n\t8450 4250 8450 5500\nWire Wire Line\n\t8300 4700 8450 4700\nConnection ~ 8450 4700\nWire Wire Line\n\t3900 4450 4600 4450\nWire Wire Line\n\t4400 4450 4400 4400\nWire Wire Line\n\t4600 4450 4600 4400\nWire Wire Line\n\t4400 5250 4400 5500\nWire Wire Line\n\t4600 5400 4600 5250\nWire Wire Line\n\t5700 4200 5700 4150\nWire Wire Line\n\t5700 4150 6150 4150\nWire Wire Line\n\t6150 4400 6900 4400\nWire Wire Line\n\t5700 4850 6900 4850\nWire Wire Line\n\t5700 4800 5700 4850\nWire Wire Line\n\t8300 4250 8450 4250\nConnection ~ 8450 4550\nWire Wire Line\n\t6400 4250 6900 4250\nWire Wire Line\n\t6400 3250 6400 4250\nWire Wire Line\n\t6750 3750 8450 3750\nWire Wire Line\n\t8300 5000 8450 5000\nWire Wire Line\n\t8300 4100 8700 4100\nWire Wire Line\n\t6750 5150 6900 5150\n$Comp\nL C C1\nU 1 1 550CAD46\nP 8700 4350\nF 0 \"C1\" H 8700 4450 40 0000 L CNN\nF 1 \"100n\" H 8706 4265 40 0000 L CNN\nF 2 \"mfk-C_4.0_2.5_2.5_0.5\" H 8738 4200 30 0001 C CNN\nF 3 \"~\" H 8700 4350 60 0000 C CNN\n\t1 8700 4350\n\t1 0 0 -1 \n$EndComp\nWire Wire Line\n\t8700 4100 8700 4150\n$Comp\nL DGND #PWR03\nU 1 1 550CADFB\nP 8700 4700\nF 0 \"#PWR03\" H 8700 4700 40 0001 C CNN\nF 1 \"DGND\" H 8700 4630 40 0000 C CNN\nF 2 \"\" H 8700 4700 60 0000 C CNN\nF 3 \"\" H 8700 4700 60 0000 C CNN\n\t1 8700 4700\n\t1 0 0 -1 \n$EndComp\nWire Wire Line\n\t8700 4700 8700 4550\nText Label 6400 3250 3 50 ~ 0\nVOL_UP\nText Label 6400 6150 1 50 ~ 0\nVOL_DOWN\n$Comp\nL DGND #PWR04\nU 1 1 550CB0E4\nP 3150 2100\nF 0 \"#PWR04\" H 3150 2100 40 0001 C CNN\nF 1 \"DGND\" H 3150 2030 40 0000 C CNN\nF 2 \"\" H 3150 2100 60 0000 C CNN\nF 3 \"\" H 3150 2100 60 0000 C CNN\n\t1 3150 2100\n\t-1 0 0 -1 \n$EndComp\nWire Wire Line\n\t3650 1350 3650 1800\nWire Wire Line\n\t3100 2450 3850 2450\nText Label 3850 2450 2 50 ~ 0\nVOL_UP\nWire Wire Line\n\t3100 2650 3850 2650\nText Label 3850 2650 2 50 ~ 0\nVOL_DOWN\n$Comp\nL PWR_FLAG #FLG05\nU 1 1 550CB3B3\nP 3400 2000\nF 0 \"#FLG05\" H 3400 2095 30 0001 C CNN\nF 1 \"PWR_FLAG\" H 3400 2180 30 0000 C CNN\nF 2 \"\" H 3400 2000 60 0000 C CNN\nF 3 \"\" H 3400 2000 60 0000 C CNN\n\t1 3400 2000\n\t-1 0 0 1 \n$EndComp\n$Comp\nL PWR_FLAG #FLG06\nU 1 1 550CB3CC\nP 3900 1650\nF 0 \"#FLG06\" H 3900 1745 30 0001 C CNN\nF 1 \"PWR_FLAG\" H 3900 1830 30 0000 C CNN\nF 2 \"\" H 3900 1650 60 0000 C CNN\nF 3 \"\" H 3900 1650 60 0000 C CNN\n\t1 3900 1650\n\t-1 0 0 -1 \n$EndComp\nWire Wire Line\n\t3150 1900 3100 1900\nWire Wire Line\n\t3150 1900 3150 2100\nWire Wire Line\n\t3900 1650 3650 1650\nConnection ~ 3650 1650\nWire Wire Line\n\t3400 2000 3150 2000\nConnection ~ 3150 2000\n$Comp\nL CONN_2 P4\nU 1 1 550CCCA8\nP 2750 2550\nF 0 \"P4\" V 2700 2550 50 0000 C CNN\nF 1 \"CTRL\" V 2800 2550 50 0000 C CNN\nF 2 \"mfk-TE_282834-2\" H 2750 2550 60 0001 C CNN\nF 3 \"\" H 2750 2550 60 0000 C CNN\n\t1 2750 2550\n\t-1 0 0 -1 \n$EndComp\nWire Wire Line\n\t4150 3250 4150 3850\n$Comp\nL CONN_5 P1\nU 1 1 550CCE69\nP 2750 3450\nF 0 \"P1\" V 2700 3450 50 0000 C CNN\nF 1 \"AB I/O\" V 2800 3450 50 0000 C CNN\nF 2 \"mfk-TE_282834-5\" H 2750 3450 60 0001 C CNN\nF 3 \"\" H 2750 3450 60 0000 C CNN\n\t1 2750 3450\n\t-1 0 0 -1 \n$EndComp\nWire Wire Line\n\t3150 3250 4150 3250\nWire Wire Line\n\t4300 4100 4350 4100\nWire Wire Line\n\t4350 4100 4350 3350\nWire Wire Line\n\t4350 3350 3150 3350\nText Label 3150 3250 0 50 ~ 0\nA_TOP\nText Label 3150 3350 0 50 ~ 0\nA_WIPER\nText Label 3150 3550 0 50 ~ 0\nB_TOP\nText Label 3150 3650 0 50 ~ 0\nB_WIPER\n$Comp\nL CONN_5 P2\nU 1 1 550CCF9F\nP 2800 4800\nF 0 \"P2\" V 2750 4800 50 0000 C CNN\nF 1 \"CD I/O\" V 2850 4800 50 0000 C CNN\nF 2 \"mfk-TE_282834-5\" H 2800 4800 60 0001 C CNN\nF 3 \"\" H 2800 4800 60 0000 C CNN\n\t1 2800 4800\n\t-1 0 0 -1 \n$EndComp\nWire Wire Line\n\t3200 4600 4150 4600\nWire Wire Line\n\t3200 4700 3900 4700\nWire Wire Line\n\t3200 4900 3700 4900\nWire Wire Line\n\t5100 4950 5100 5700\nWire Wire Line\n\t5100 4950 4950 4950\nWire Wire Line\n\t3200 4800 3800 4800\nWire Wire Line\n\t5000 4600 5000 5600\nWire Wire Line\n\t5000 4600 4800 4600\nWire Wire Line\n\t4800 4600 4800 4700\nWire Wire Line\n\t4300 5400 4300 4950\nText Label 3200 4600 0 50 ~ 0\nC_TOP\nWire Wire Line\n\t3900 5400 4300 5400\nWire Wire Line\n\t4400 5400 4600 5400\nWire Wire Line\n\t3900 4700 3900 5400\n$Comp\nL RK16814MG RV1\nU 1 1 550CA765\nP 4500 4500\nF 0 \"RV1\" H 5850 5250 50 0000 C CNN\nF 1 \"RK16814MG\" H 5700 3600 50 0000 C CNN\nF 2 \"mfk-ALPS_RK16814MG\" V 4800 4900 60 0001 C CNN\nF 3 \"~\" V 4800 4900 60 0000 C CNN\n\t1 4500 4500\n\t1 0 0 -1 \n$EndComp\nWire Wire Line\n\t4150 4600 4150 4700\nText Label 3200 4700 0 50 ~ 0\nC_WIPER\nText Label 3200 4900 0 50 ~ 0\nD_TOP\nText Label 3200 5000 0 50 ~ 0\nD_WIPER\nWire Wire Line\n\t3900 3450 3900 4450\nConnection ~ 4400 4450\nConnection ~ 4400 5400\nText Label 3150 3450 0 50 ~ 0\nAB_COMMON\nWire Wire Line\n\t3600 5000 3200 5000\nText Label 3200 4800 0 50 ~ 0\nCD_COMMON\n$Comp\nL +5VD #PWR07\nU 1 1 550CE6FC\nP 7600 3650\nF 0 \"#PWR07\" H 7600 3600 20 0001 C CNN\nF 1 \"+5VD\" H 7600 3750 50 0000 C CNN\nF 2 \"\" H 7600 3650 60 0000 C CNN\nF 3 \"\" H 7600 3650 60 0000 C CNN\n\t1 7600 3650\n\t1 0 0 -1 \n$EndComp\n$Comp\nL +5VD #PWR08\nU 1 1 550CE733\nP 3650 1350\nF 0 \"#PWR08\" H 3650 1300 20 0001 C CNN\nF 1 \"+5VD\" H 3650 1450 50 0000 C CNN\nF 2 \"\" H 3650 1350 60 0000 C CNN\nF 3 \"\" H 3650 1350 60 0000 C CNN\n\t1 3650 1350\n\t-1 0 0 -1 \n$EndComp\nWire Wire Line\n\t3900 3450 3150 3450\nWire Wire Line\n\t4800 3850 4800 3550\nWire Wire Line\n\t4800 3550 3150 3550\nWire Wire Line\n\t4950 4100 5000 4100\nWire Wire Line\n\t5000 4100 5000 3650\nWire Wire Line\n\t5000 3650 3150 3650\nWire Wire Line\n\t3600 5000 3600 5700\nWire Wire Line\n\t3700 4900 3700 5600\nWire Wire Line\n\t3800 4800 3800 5500\nWire Wire Line\n\t3800 5500 4400 5500\nWire Wire Line\n\t3700 5600 5000 5600\nWire Wire Line\n\t3600 5700 5100 5700\n$Bitmap\nPos 10300 6850\nScale 1.000000\nData\n89 50 4E 47 0D 0A 1A 0A 00 00 00 0D 49 48 44 52 00 00 00 5F 00 00 00 64 08 06 00 00 00 E0 F1 EC \n9B 00 00 00 04 73 42 49 54 08 08 08 08 7C 08 64 88 00 00 00 09 70 48 59 73 00 00 07 6C 00 00 07 \n6C 01 9C F3 D5 25 00 00 13 B3 49 44 41 54 78 9C ED 9D 7B 7C 54 D5 B5 C7 BF EB CC 04 C2 43 1E 5A \n45 D0 2A F6 FA 82 52 A0 6A D5 D6 5A B1 3E 69 21 27 40 A3 F6 E1 55 51 4E 78 5C B5 B4 DA 56 3F 7E \n8A 69 BD D4 6A 6F 6F AB AD 90 13 90 48 3F B7 B6 E6 16 66 22 8A F6 65 44 AD AD A2 45 B4 A5 D6 17 \n88 12 15 5A 0C F2 CA 64 E6 AC FB C7 3E 93 49 86 10 66 92 7D 48 E8 E5 F7 F9 E4 33 AF BD D7 59 FB \n77 76 F6 D9 7B ED B5 D6 16 55 E5 40 80 F8 C9 7B 80 59 05 14 5D A0 9E 3B 3B 6A 7D 6C C0 E9 69 05 \n8A C0 85 96 CB F5 38 E4 40 E8 F9 E2 27 0F 01 9A 00 29 A0 B8 02 83 D5 73 3F 88 56 AB EE E3 40 E9 \nF9 63 29 8C 78 C2 72 63 23 D4 C5 1A 0E 14 F2 C7 45 5C BE 47 70 A0 90 3F 3E E2 F2 3D 82 83 E4 F7 \n20 22 27 5F FC E4 67 C5 4F 5E DE 8D FA 31 60 4C 91 D5 C6 84 F5 BA 7A CD CB C5 4F 7E B6 AB F5 0B \n45 A4 E4 8B 9F 2C 03 56 02 4B C5 4F AE 14 3F 39 A2 0B 62 4E 04 FA 15 59 A7 5F 58 AF 28 88 9F 1C \n21 7E 72 25 B0 14 58 19 EA 1F 19 22 23 3F 54 BC 0E E8 13 7E 75 31 F0 92 F8 C9 CB 8A 14 75 4A 17 \n55 38 B5 98 C2 A1 5E 2F 61 F4 04 A3 77 5D 94 37 20 92 79 7E 07 C4 E7 E3 01 60 B6 7A EE 3F 3A 91 \n31 00 B8 0C A8 02 8E EA 82 1A 8D C0 AD C0 CF D5 73 B7 77 72 9D C3 80 7B 80 4B F6 52 24 05 54 A8 \nE7 D6 77 41 87 4E 61 9D FC 02 88 CF A2 11 98 A1 9E FB 50 5E FD 31 40 25 70 39 30 D8 82 4A 1F 00 \n3F 03 16 AA E7 BE 98 77 AD CF 03 35 C0 F0 7D C8 88 E4 06 58 25 BF 08 E2 DB 62 11 70 3B F0 49 60 \n26 70 96 35 85 F6 C4 53 C0 42 E0 69 E0 5B C0 35 45 D4 B5 7E 03 AC 91 DF 45 E2 0F 34 58 BD 01 36 \n1F B8 35 FC 6B 13 0F A6 7D 35 B6 84 D9 24 FF 4E 8B B2 7A 33 AC B5 D3 26 F9 3F 04 9E B4 28 AF 37 \nE2 49 4C 3B AD C0 F6 03 F7 23 C0 0B C0 40 6B 42 7B 0F B6 03 E3 D4 73 5F B7 25 D0 EA 22 2B 54 EC \n06 9B 32 7B 11 6E B0 49 3C 44 B7 C8 5A 49 6E A5 F8 AF 80 47 D4 73 27 DA 16 1A 95 79 E1 6A 60 6B \n44 B2 F7 37 B6 62 DA 63 1D 91 90 AF 9E BB 09 98 13 85 EC 1E C0 9C B0 3D D6 11 E9 1E AE F8 C9 06 \nE0 9C C8 2E 10 3D 1E 57 CF 9D 10 95 F0 A8 ED F9 F1 88 E5 47 8D 48 F5 8F AC E7 8B 9F 1C 07 AC 89 \n44 F8 FE C5 78 F5 DC 17 A2 10 1C 65 CF BF 2E 42 D9 FB 13 91 B5 23 AA A9 E6 61 C0 5B 40 A9 75 E1 \n39 BC 05 BC 0C 9C 04 1C 1D E1 75 76 03 47 77 B6 F7 D0 55 44 35 A6 CD C0 3E F1 29 E0 2E E0 31 E0 \n39 F5 DC 77 B3 3F 88 9F 1C 86 D9 B9 3A 17 D3 53 6D 1A F8 4A 31 ED B9 DD A2 4C 20 9A CD 94 18 F0 \n06 F0 61 8B 62 D7 00 57 A8 E7 AE 2D E0 FA 63 81 FB B0 EB C1 B0 11 38 4E 3D 37 63 51 66 24 63 FE \n97 B1 4B FC 7C E0 F4 42 88 07 08 CB 9D 1E D6 B3 85 0F 63 DA 65 15 DD EA F9 E2 27 FB 03 1F C3 F4 \nB2 F1 18 4F B1 D3 81 2E BB 6D E4 A1 4E 3D 77 6F 7B AB FB 84 F8 C9 07 80 0A 4B BA 64 80 67 30 86 \nC3 35 E1 DF 8B EA B9 3B BB 2A B0 60 F2 C5 4F 96 00 E7 63 08 CE 92 7D 02 D1 CD 98 36 03 1F 55 CF \nDD DC 55 01 E2 27 0F 07 FE 02 1C 6E 4D AB F6 08 80 57 C8 DD 8C 17 80 DF AA E7 B6 14 52 B9 98 07 \nEE 95 80 5F AC 76 DD C0 9C EE 10 0F A0 9E BB 59 FC E4 1C 8C B7 44 14 70 30 B3 AD 93 80 4B C3 EF \n3C 0A DC ED 2A A6 D7 0E 28 4E AF 6E A1 51 3D B7 CE 86 A0 50 4E A3 0D 59 05 A2 60 9E 7A AB AF E6 \nEA 5E 2E CF 0A 7A 2B F9 CF F5 72 79 56 D0 5B C9 3F D8 F3 7B 10 7B 75 EF EB 25 F2 AC A0 B7 92 7F \n5C 2F 97 67 05 BD 95 FC 13 7A B9 3C 2B E8 AD E4 5F 22 7E B2 D0 00 B8 4E 11 CA E9 F2 2A 39 4A 14 \n43 FE FE 0C AD 3C 1E B3 9A B6 81 F3 43 79 FB 0B 05 F3 54 CC 0A B7 16 78 8D 9C 0D 67 1C 30 1A E8 \n5B 8C 66 45 60 BE F8 C9 86 42 97 EA 1D 21 34 89 D8 34 B0 E5 A3 19 F8 2B C6 AC 90 B5 F9 3C 51 68 \nE5 82 C9 0F CD A9 0D E1 1F 00 E2 27 E3 C0 C9 E4 6E C6 29 C0 79 85 CA DC 07 4E C3 10 77 63 37 64 \nCC 0F E5 D8 C2 EF 80 E7 C9 91 FD 37 F5 DC 74 57 85 45 61 CF FF 09 F6 DC 46 14 F8 86 7A EE 0F BA \nA0 C7 0D C0 1D 14 1E 3C BD 2F FC 54 3D F7 3F 2C C9 02 A2 21 7F 14 E6 5F D1 26 EE C5 84 11 35 17 \n70 FD BE 98 30 9F E9 96 75 18 AD 9E BB CE A6 C0 A8 F6 70 57 01 67 5B 16 FB 22 50 DE 99 BF 64 E8 \nA8 9B C0 EC 31 D8 C4 13 EA B9 9F B1 2C 33 B2 A9 66 14 A6 E7 8F 01 1F DD 47 99 8F 62 9F 78 88 C8 \n94 1E 15 F9 FF 8B 7D 5F CD B7 31 31 BD 9D 61 65 58 CE 26 B6 62 DA 63 1D 51 F9 6A EE C6 04 12 DB \n84 BF AF 99 45 F8 BB ED 5E BA 34 6C 8F 75 44 B9 C2 B5 16 BB 04 A4 8B 90 57 13 96 B7 05 9B ED 68 \n87 C8 C8 57 CF FD 0B F6 86 9E 84 7A 6E 41 BB 51 61 B9 84 A5 EB 6E 0D DB 11 09 A2 0C FF BF 1C 18 \n6A 49 DC 3D 11 97 DF 1B 86 76 27 69 C7 BE 10 D5 54 F3 68 4C 1E 03 1B 11 E4 7F 53 CF 1D D5 05 1D \nD6 61 56 DF DD 45 13 30 46 3D F7 2D 0B B2 DA C1 7A CF 0F AD 88 4B B0 43 3C C0 82 FD 5C 2F 1F 83 \n81 25 B6 AC AC 6D 11 C5 B0 33 1B 7B 16 C9 1D 18 D7 BF AE E0 BE B0 BE 0D 9C 8F 69 97 55 58 25 5F \nFC E4 09 18 7B 8A 2D FC 5C 3D B7 A9 2B 15 C3 7A 3F B7 A8 CB 1D 61 FB AC C1 1A F9 A1 83 EC 52 A0 \nBF 2D 99 74 FF C1 69 EB C1 0B A6 5D 4B BB 93 C1 2A 1F 36 7B FE 37 80 33 2D CA FB A3 7A 6E B7 22 \n5B C2 FA 7F B4 A4 0F 98 F6 7D C3 96 30 9B E4 7F D5 A2 2C B0 D7 6B 6D F6 7E B0 D8 4E 9B E4 5F 81 \nD9 D9 B1 81 2D D8 F3 AF 7C 20 94 67 03 CD 98 76 5A 81 35 F2 D5 73 1F 01 CA 29 EE 06 28 F0 3F C0 \n43 79 DF DF 5B 88 ED BE 40 BD 9A 31 FB 01 6D F1 50 78 DD 62 16 39 CD 18 93 F6 23 36 F4 02 FB B9 \n17 8A B9 01 6F 02 E7 A9 E7 7E 45 3D 77 12 26 C3 D4 2A 8C DB 75 B5 4D BD 42 79 41 28 FF 2C F5 DC \n49 EA B9 5F C1 6C 79 BE 59 40 7D EB C4 43 74 2B DC 8B 31 F6 95 BD 6D AE D7 02 D7 AB E7 6E EB A0 \nEE D1 51 AC 26 F7 26 57 FC E4 20 E0 C7 18 17 F8 8E 10 09 F1 10 6D 1C 6E 47 37 E0 3D C0 53 CF 4D \n46 72 D1 6E 40 FC A4 8B 31 47 1F D1 E6 EB C8 88 87 68 AD 9A F9 43 50 02 63 23 E9 75 C4 03 84 7A \n8D 21 67 11 8D 94 78 D8 0F F9 F3 C5 4F 7E 1A 18 6E 2B D8 61 7F 40 FC 64 05 26 40 23 D2 CC 59 07 \nC4 E1 05 FF AA E8 AD BE 9A FF 2F 70 90 FC 1E C4 41 F2 7B 10 07 C9 EF 41 1C 24 BF 07 71 90 FC 1E \n44 1C 40 FC 15 FD 91 CC 6C 94 B3 50 FA 01 7F 42 32 0B D5 9B DA 08 20 8B 96 1D 4D 26 B6 08 61 23 \nE2 FC 08 74 2E AA 27 80 AE 25 16 FC 40 AF 9E BA 21 2B 50 40 A8 4E 4C C7 61 32 EA 0C 41 83 35 68 \nFC 4E 9D 39 A9 D5 93 4C AA 93 8F 20 A4 08 62 B3 88 65 6E 41 39 09 E1 61 E2 A9 FB F4 AA 8A 4E A3 \nCE A5 BA FE 34 24 98 08 72 2E E8 56 90 75 A4 A9 D6 D9 EE C6 D6 32 FE 8A 0F 41 7A 16 22 67 A2 64 \n10 79 9A DD 25 3F D5 6B 27 6E 33 ED A9 1F 4B 46 EF 40 58 AD 9E 7B 4B 6B BD 9A E5 E7 10 38 37 21 \n34 A8 E7 DE DE AE DD 8E DC 8D EA D7 51 8E 02 EA 29 49 DD AF 57 55 6C 96 EA E5 E3 10 67 16 30 0A \n65 23 8E 3C CE A6 41 4B 74 DE 84 34 80 DC 5B 7F 08 69 FD 26 AA 9F 44 64 17 C8 E3 34 97 DC A5 D7 \n4E 6C 16 EE 7A 78 10 7D 53 7F 04 F2 3D 04 DE 45 63 67 6B E5 A4 57 C4 5F 71 32 64 D6 61 F6 44 1D \nDA 1F A3 F1 0E 64 4E 69 BD 51 7E F2 7E CC A1 03 6D B1 0D 71 CE D7 19 93 9F 0D CB 28 C6 D0 B5 85 \nF6 CB F9 9D 88 73 BA CE 98 DC A1 AF 8C F8 89 AF 83 74 E4 2E BE 03 63 A4 FB 93 2C 4C 8C C4 91 A7 \n80 FC 23 42 5E 25 96 3A 43 AF AE F8 A7 2C 4C 4C C0 91 C7 50 1E D5 4A B7 35 FF A7 D4 D4 5F 86 EA \nFD C0 2F D5 73 2F 6B D3 EE ED 61 BB C3 5D 3A D9 4C 26 7D 26 F1 F8 79 A8 2E 20 3F D1 87 EA EF E9 \nCB 34 00 52 F2 67 60 64 9E 2E 6B E9 D7 EF 53 0E A5 A9 9B 31 C4 6F 04 AE 47 F5 4B 18 8F E0 61 38 \nE9 FC A4 CD 03 80 DF A3 72 0E A2 97 62 6C 35 47 42 7C 96 51 3E 31 11 43 FC 1B 88 7C 11 62 A7 A2 \nF2 00 30 08 0D F2 DD 07 1D 60 13 C8 25 28 D3 41 5E 07 FA A3 C1 BC 0E C8 CD D2 73 63 D8 B8 EB 88 \n65 46 12 E8 19 20 FF 85 92 C0 73 9F 31 52 E5 76 0C F1 EB 40 AE 44 65 16 B0 1E 38 9E 74 C9 B7 F7 \n2E BB 53 0C 04 9E 04 BD 08 F8 1A 9A 71 D1 58 0B AA 3F 0C DB 51 8F 52 16 72 F2 32 48 23 A9 F7 76 \n90 92 2A 60 24 CA A3 08 67 A1 94 61 B8 1D CB AE 5D F3 E2 A8 5C 0C 0A AA DF D4 CA F2 FB 01 A4 7A \nF9 5F 11 67 8D F9 2D 0F E9 92 6B 74 F6 E7 DE 01 90 9A E4 31 28 77 82 8E 36 A4 38 E5 A1 AC FF 56 \nCF FD 05 80 D4 26 2A 49 89 0B 9C 2C 0B 13 23 75 66 F9 FA 36 64 7E 4D BD B2 C7 CC 35 93 20 DC 0B \nD2 E1 59 27 52 57 17 83 3E 31 20 4D 89 F3 2B 9D 5E BE 09 D8 80 49 C3 D2 16 46 67 0D AE D6 CA 29 \n4F 1B D9 0F 36 22 41 02 E9 A0 3D 85 41 09 B4 32 D4 FD D7 A6 ED F5 D7 A3 3A 10 58 AD 9E EB B6 EA \n79 4F DD C3 CC AE D8 A1 A0 E2 27 CB 01 08 32 B3 B5 72 EA EB 21 67 71 94 65 C0 E7 E2 A0 E6 3C 12 \n47 73 21 F2 87 A6 5F 62 6B 9F 9D 40 7F F9 E9 F2 C3 28 29 C9 FE B2 2D 4B 7C 88 D7 C2 D7 21 A1 8E \nC6 49 49 E4 02 F1 13 6D 49 FC 00 E8 4B 4C 8E C7 F4 42 80 16 1A FF FC 38 84 E7 C1 C4 32 BF 21 88 \n01 DA 61 E2 08 AD A8 C8 88 9F 5C 02 DC 48 5A D7 8B 9F 5C 0B F2 1E 12 AC 03 7E A6 33 CA D7 C8 CF \n7E 3D 00 E3 67 93 61 67 3A B7 FF 2B 2D CF 84 23 43 57 CE 5E 01 F4 D5 F6 9D 06 50 0D 87 69 6D B7 \n11 A4 B3 2B B6 43 F8 1C 35 49 92 76 10 73 BE 2D 7E 68 AF 13 A7 4F B8 87 73 72 9C 6C C6 6F 4D B7 \nE6 2C 0B 1B BA 19 38 96 52 1D 48 2E B9 55 7B 37 0E 71 9A D0 00 90 AC D9 F8 D0 F0 75 72 87 D1 38 \n81 B4 8D 01 0B 74 DE BC A0 F5 53 AA 34 4D 7C 1F B1 6F 2D C1 F7 29 71 52 98 A8 93 53 CD 7F 99 4C \n04 E6 C8 E2 FA 31 68 6B 24 E0 07 3A B7 62 57 AE E2 96 2D 30 2C 0D F4 97 AA 2A 87 61 C5 9E DE 27 \nC1 9E 5F 71 98 E1 D0 79 A3 C3 2A 01 43 71 10 60 00 48 6E EB 31 67 4B 8B C5 31 E9 50 8E 43 E2 E3 \n81 C7 01 4C 6F 77 8E 05 60 67 BF 77 E8 9B C9 46 70 1F 25 BE 5F A2 9E D7 12 0A 1A 19 4A 0C 6F 8A \nFE 1D 64 0C 4A 99 56 BA 0F 16 D9 C2 7D 42 E7 4C F9 07 70 8B 54 55 7D 9B C3 3F 71 04 B1 F4 D1 88 \n7E 0B 98 46 9A CB 78 E7 CF F3 19 3E 3E 03 0C 91 C5 CB 8E 6D 9D 85 39 47 8C 25 20 0E 34 EA BC 79 \n81 D4 2C 57 54 40 F2 D2 91 69 11 E9 C9 94 97 C3 37 17 D2 91 63 D7 CC 49 9B F0 93 3B 00 A5 5F BF \n23 F5 F2 0B F7 70 E0 72 00 13 66 A3 CE 54 F1 FD 12 01 A1 24 F6 C5 F0 F7 B7 F5 DA 89 CD ED CB 1F \n99 3B 6F 56 35 FB FE 9F E1 6B F6 34 9E AB A4 AA CA 01 90 BB 57 0E 92 9A FA 2F 4B 5D 5D B7 32 FE \n49 5D 5D 4C FC E4 0F C5 AF 3F 57 E7 CD 0B 74 F6 E7 DE D1 CA B2 D5 48 E8 1A 22 3A 3E FC 4F 5A 0F \n40 10 AB 90 AA 2A 47 AA 1A E2 04 8E 09 82 96 B0 AD 69 CD 4E 4B 47 8B BF FC D3 90 1D 26 F4 2B 85 \n2B D4 9A C9 E4 62 59 58 FF F1 D6 AF 6B 12 57 4A F5 F2 71 6A C6 96 97 80 81 EC DA D9 9A 9F 4D 16 \nD7 1F 2F 7E FD E7 01 E2 A8 7E 0F 91 F3 80 EB 60 D8 17 F0 93 4D E4 A6 9D DF DB F3 AA FA 2B F1 93 \n7F 00 8E 6C 2D A7 84 B6 FA F8 4F 20 98 8D E8 14 86 8F 7F 53 AA EB 9F A2 AF 4E 44 39 84 F7 4B AE \n10 B8 48 8B DB B4 CE 61 6B 89 07 CC 05 FD AA F8 C9 E7 50 5E 02 86 23 61 AE 66 D5 95 E1 EB F7 10 \n59 84 72 27 C3 C7 57 42 53 1F E0 18 F3 9B 98 F6 CC 9A FA 06 7E F2 AF C0 68 70 56 89 9F CC 4E B5 \n87 14 AC CF 0C 37 41 75 F2 09 84 B3 71 F4 79 F1 13 CF 83 F4 03 19 85 C8 56 59 52 77 12 D2 67 1E \nCA 23 20 D5 E2 27 2A C1 79 37 9C 31 39 E2 27 6E 70 B4 B2 FC 77 66 AA C7 36 CC 14 6D 14 D0 02 F2 \n5D 1A D7 E4 3B 9B 6E 40 B9 1F 93 BF 32 7B 83 6E CF 0E 31 EA 4D DA 82 F2 05 4C B2 D1 A3 10 BD 04 \n38 04 78 0D 8D 7F AB CB C4 03 EA 95 2F 08 A7 72 1B 81 D3 10 AE 44 B8 08 78 15 B8 49 2B CB 17 03 \n50 59 7E 2F 22 37 63 76 A2 8E C7 10 BF 13 74 B6 7A 65 0F 81 79 52 40 6C 1A C8 4A F3 91 4F 82 B4 \n80 14 1C D5 A2 A0 48 E6 52 44 C3 9D 39 39 25 E4 64 13 2A 97 EA 55 15 9B 75 86 FB 28 AA D7 01 4D \nE6 77 9D 08 38 A8 AC 20 D6 B2 A4 75 33 45 AA 1A E2 1C B9 6D 3C 4E 66 00 DB D3 CF B4 7D 60 B5 59 \n6C BC AC 9E 7B B2 F8 2B 8E 41 83 D1 68 E6 79 9D 39 E5 BD 7C C5 A4 AA 21 CE 51 EF 8F 23 23 23 70 \n82 97 99 31 E5 95 B6 C4 CB A2 07 CF 24 9D 09 74 66 F9 33 B9 6B F8 25 38 C3 4F 25 90 94 7A 93 9E \nEF AC E1 66 E5 19 1F 43 09 6B 75 7A 59 87 E9 D5 E5 EE 95 7D 29 69 39 8D B8 64 08 1A 9F 6B 7D 4E \nE5 97 5B 98 18 49 4C 8F A5 74 C0 6A B6 ED 28 A5 6F FC 04 44 B7 E8 D5 65 AF 4A 6D 43 29 E9 0F C6 \n93 49 EF D2 CA 29 7B CD A7 6C 64 30 8A 40 36 68 A5 BB 47 18 AC F8 75 83 71 FA 8C 25 23 03 C8 C4 \nD7 B4 4E D5 0B D9 C9 CA 27 7F 9F 15 22 80 D4 26 86 90 6A 51 F5 2A BA E4 38 DB 1B 71 40 A4 58 97 \nDA 86 52 52 B2 15 FA 34 13 6D 7E E6 FD 8A 83 56 CD 1E C4 41 F2 7B 10 5D 22 5F AA AA 1C 59 52 D7 \n69 96 56 A9 4D 0C 91 BB 57 0E EA F0 37 DF 2F 91 DA 86 D2 D6 B5 C0 E2 BA 43 F3 D7 01 02 22 F7 3C \n7C 64 87 F5 EF 5E D9 57 6A 1B 4A 25 6F 19 2D BE 5F D2 D1 7A 42 6A 1B 4A A5 B6 A1 B4 7D D9 BA C1 \nE2 D7 75 18 BA D4 AA 5F 5D 5D 0C 40 16 3C 34 54 EE 5E B9 87 F7 9D DC 53 37 50 16 D5 0F EB 48 46 \n21 28 F6 81 FB 77 4C 00 C4 CD 40 7F 84 06 54 7F AC 5E 79 22 57 36 F9 25 CC FA E0 18 4C FE E1 35 \nC0 2A 88 CD 57 6F D2 96 B0 CC 2F 80 4B 41 6F 00 F9 22 26 FD FA 3F 81 85 78 EE 2D F8 89 5B 40 E6 \n62 A2 19 DF 46 E4 86 D0 D4 DB AC 9E 5B 2A 7E 72 35 70 2A 2A 17 6A 65 D9 6F DA 5C FB 15 60 10 8D \n6B 86 67 4D 17 C6 FE AF CF 02 6F E1 B9 C7 50 9D 9C 86 70 27 C6 CC 1B 00 2F A0 BA 8A 4C 9F DB 5B \n67 21 7E A2 D6 98 04 E4 D6 70 7A 78 06 F0 3E 48 AD 7A 65 73 A5 66 F9 89 E0 54 A3 9C 83 E9 00 9B \n40 6E 56 AF AC A8 10 A6 62 7B FE 89 C0 6D 21 A9 01 CA 04 90 5F 49 75 FD 67 20 34 4B A0 B7 62 0E \n13 58 0B FA 3C 66 EE 3B 17 49 77 10 A2 23 3F C0 E4 E8 69 02 06 A3 D2 80 9F 98 09 F2 1D 0C F1 DB \n81 41 21 F1 6D B1 DC BC B4 AE B0 91 EA E5 E3 30 F3 FA 23 18 31 36 97 74 C3 E1 82 B0 6C 02 BF 6E \n10 C2 77 30 1D E3 45 E0 59 E0 44 44 AE 27 D6 D2 81 4B BA DE 8A 21 BE C9 E8 21 0D E2 AF E8 8F 3A \nBF 35 6D 67 1B C6 B8 38 02 B4 56 6A EA 8B CA 74 52 FC B0 23 7A 1B 3B 52 C3 08 F4 DF 30 C9 42 1D \n24 B8 02 B2 B6 97 96 4F A0 72 AE 7A EE 38 F5 CA 4F 87 D8 28 20 85 CA 67 43 AB 63 5B AC 27 93 39 \n1E DE 3D 1C 47 4E 09 7B F1 55 E1 85 16 30 34 35 84 C6 C1 87 62 CE CC 6D A3 75 B0 CC 14 E1 A2 9C \n5E B1 69 6D 0A B4 79 9F BD 41 CE 32 F5 2A 9A 48 A7 4E 07 39 5F 3D 77 AC 7A EE 99 94 A4 8E 03 76 \n21 9C 2D B5 89 FC 15 EE 26 34 76 22 8D 83 3F 84 06 A7 68 E5 E4 24 9A B9 16 63 AD 4C 40 6C 04 9E \n7B 02 E6 1C 5F 50 BD 23 7F 28 EC 0C C5 92 BF 8B 98 73 87 CE AD D8 A5 33 CB D7 87 BB 38 80 B4 CE \nFD D5 AB 68 D2 CA B2 55 B9 CF 93 DE C4 1C 66 10 63 FB EE FC E3 35 6A 74 D6 D4 D7 D5 F3 5A F4 9A \nB2 30 3F BE 7C C8 68 26 4B B5 A2 22 A3 F3 26 A4 D1 A0 9D 7F BD 5E 33 65 1D F0 37 E0 63 E2 2F 0B \n4F 71 D6 69 98 5E F8 07 94 29 02 62 7A 29 9F 02 FE C1 D0 E6 55 60 4C BE D9 3D 04 00 B3 6D 29 7F \n07 A0 59 8F CD D3 6F A9 56 4E 7A 45 E7 4D 48 B7 59 64 9D 11 D6 5C A0 DE A4 9D 66 F1 F8 EE BD 98 \n5D B9 C3 A8 5E 51 70 3E B7 62 E7 F9 6F EA F4 B2 5C 02 B7 58 EC 2F 04 01 B4 D9 46 93 EA FA 99 88 \n7A 98 21 2A 2B DF 3C 04 63 4E 5E AF D0 0E 92 22 C9 40 50 48 A7 73 79 75 94 D7 F6 E8 4F AA CB 11 \nB9 09 8D 5D 20 FE 8A 67 80 D1 20 3F 42 78 0F D5 F9 2C 7A F0 0C 24 33 14 95 3E 40 BD 56 54 64 00 \nA4 A6 7E 3A 1A CC 01 39 11 C8 6E 54 18 FD 1C 69 7F 15 D1 97 F7 54 2F 1B 58 2D F5 E2 67 7D 7E 87 \nB5 91 D1 32 02 93 D6 7D 9F B0 BA C8 92 85 F5 67 E1 E8 02 60 37 CA B3 38 6A AC 9D 2A E7 51 F0 49 \nA1 6A 6C E7 71 CD CD 5A E2 DA 87 3D 2C EA CE 32 D0 9B CC D0 93 31 A6 60 47 1E 24 9D 7E 0F C7 99 \n4F 26 98 86 88 E9 14 62 86 29 59 94 38 15 95 C5 20 CD 08 AB 41 B7 84 FA 9D 0B 74 38 33 EB A0 95 \nA9 D0 52 F2 24 A2 7B 66 AA CD 50 F0 C1 36 76 57 B8 4E 30 03 04 54 2E 6A 3B F4 88 9F DC 44 E1 C7 \nB4 6E 07 86 41 EC 38 CC 89 40 90 89 7F 04 69 3F 2B D3 CA B2 D5 E2 27 37 62 02 94 47 03 EF F3 F6 \n21 AB 74 DE 84 B4 F8 C9 0D 88 4C 05 DD 0D 6C 67 77 A9 99 11 05 32 23 AC 5D A6 33 CA 7F DD 46 BF \n37 28 98 7C 5D 07 8C 43 F5 7E F5 42 63 5E 17 61 79 91 E5 1C 11 4A FD B8 D4 D5 F5 11 90 70 53 7D \n78 11 42 8C 8B 49 C0 8D E2 AF 38 46 16 2F 3B 16 D1 9B C2 DF F2 E7 C5 CB 31 DE 0F E3 81 47 B2 EE \n1A C0 0A D0 8F 00 A3 51 79 B8 75 4F 42 B3 9E 12 72 5A 76 9D 20 7E FD B9 EC E9 5D D0 09 E4 29 F3 \n22 D7 C9 A2 07 CF 94 AA 86 B8 D4 D4 5F 26 7E B2 5E 16 D4 9F 54 44 3B 2D 93 AF 7A 5F F8 FA 23 B6 \nF6 79 1F 3F B9 1D 95 87 8B 93 21 3F 0E DF 4D 86 CC 06 32 B1 F5 E4 D2 09 B4 1F 93 03 5D DE E6 53 \n6E E7 4C 65 45 EB 7B 87 5C 19 D1 AC 07 C5 7F 92 6A DA 8A 9F FC 00 F4 F7 45 E9 37 B4 79 01 E8 B3 \nC0 58 82 E0 69 86 37 6D 0B A7 C2 93 89 E9 5D C5 88 2A 90 FC 74 0B B0 01 D5 F6 29 B4 D2 DA 8C F1 \n20 68 04 D0 4A F7 97 88 FE 3B B0 16 D3 4B DF 45 F4 36 CC D9 56 1B 42 39 80 6E 0E EB ED 71 D8 8B \n56 96 2D 0B ED F6 7F C2 CC A3 57 85 CF 8C 0D E1 5F 0E 87 B5 3C 11 5E EB 0D 32 F1 5C 0A B0 54 C9 \n63 98 05 E1 6B C4 72 91 8E EA 95 27 8C 4B 0B 6B 30 6B 95 2D 08 DF 47 79 14 D8 40 20 A9 90 96 2D \nE1 E7 3D C6 74 F3 E0 6E B9 00 E4 0E CC EC 2A 00 9E 03 F9 2E 43 53 93 3B E7 B1 3D FE 0F E4 2C B5 \nB8 3A B8 3B 5D 00 00 00 00 49 45 4E 44 AE 42 60 82 AC $EndBitmap\nEndData\n$EndBitmap\nWire Wire Line\n\t5350 4600 5250 4600\nWire Wire Line\n\t5350 4400 5250 4400\n$Comp\nL GND #PWR09\nU 1 1 550CF9FF\nP 5350 4700\nF 0 \"#PWR09\" H 5350 4700 30 0001 C CNN\nF 1 \"GND\" H 5350 4630 30 0001 C CNN\nF 2 \"\" H 5350 4700 60 0000 C CNN\nF 3 \"\" H 5350 4700 60 0000 C CNN\n\t1 5350 4700\n\t1 0 0 -1 \n$EndComp\nWire Wire Line\n\t5350 4400 5350 4700\nConnection ~ 5350 4600\nText Notes 5050 4800 0 40 ~ 0\nchassis ground\n$Comp\nL GND #PWR010\nU 1 1 550CFBE5\nP 5350 6250\nF 0 \"#PWR010\" H 5350 6250 30 0001 C CNN\nF 1 \"GND\" H 5350 6180 30 0001 C CNN\nF 2 \"\" H 5350 6250 60 0000 C CNN\nF 3 \"\" H 5350 6250 60 0000 C CNN\n\t1 5350 6250\n\t1 0 0 -1 \n$EndComp\nText Notes 5150 6400 0 40 ~ 0\nchassis ground\n$Comp\nL PWR_FLAG #FLG011\nU 1 1 550CFBF4\nP 5350 6150\nF 0 \"#FLG011\" H 5350 6245 30 0001 C CNN\nF 1 \"PWR_FLAG\" H 5350 6330 30 0000 C CNN\nF 2 \"\" H 5350 6150 60 0000 C CNN\nF 3 \"\" H 5350 6150 60 0000 C CNN\n\t1 5350 6150\n\t1 0 0 -1 \n$EndComp\nWire Wire Line\n\t5350 6150 5350 6250\n$Comp\nL CONN_1 P5\nU 1 1 550D1AD1\nP 5000 6150\nF 0 \"P5\" H 5080 6150 40 0000 L CNN\nF 1 \"GND\" H 5000 6205 30 0001 C CNN\nF 2 \"mfk-AVA-20ga\" H 5000 6150 60 0001 C CNN\nF 3 \"\" H 5000 6150 60 0000 C CNN\n\t1 5000 6150\n\t-1 0 0 1 \n$EndComp\nWire Wire Line\n\t5150 6150 5350 6150\n$Comp\nL C C2\nU 1 1 550D2A54\nP 6900 5500\nF 0 \"C2\" H 6900 5600 40 0000 L CNN\nF 1 \"1u\" H 6906 5415 40 0000 L CNN\nF 2 \"mfk-C_4.0_2.5_2.5_0.5\" H 6938 5350 30 0001 C CNN\nF 3 \"TDK FK18X5R1A105K\" H 6900 5500 60 0001 C CNN\n\t1 6900 5500\n\t1 0 0 -1 \n$EndComp\nWire Wire Line\n\t6900 5150 6900 5300\n$Comp\nL DGND #PWR012\nU 1 1 550D2ACA\nP 6900 5800\nF 0 \"#PWR012\" H 6900 5800 40 0001 C CNN\nF 1 \"DGND\" H 6900 5730 40 0000 C CNN\nF 2 \"\" H 6900 5800 60 0000 C CNN\nF 3 \"\" H 6900 5800 60 0000 C CNN\n\t1 6900 5800\n\t1 0 0 -1 \n$EndComp\nWire Wire Line\n\t6900 5800 6900 5700\nNoConn ~ 8300 4400\nNoConn ~ 8300 4850\nConnection ~ 8450 5000\nWire Wire Line\n\t8450 3750 8450 4100\nWire Wire Line\n\t7600 3650 7600 3750\nConnection ~ 7600 3750\nWire Wire Line\n\t6900 4100 6750 4100\nWire Wire Line\n\t6150 4150 6150 4400\nConnection ~ 8450 4100\nWire Wire Line\n\t8300 5150 8450 5150\nConnection ~ 8450 5150\nWire Wire Line\n\t6900 5000 6400 5000\nWire Wire Line\n\t6400 5000 6400 6150\n$Comp\nL CONN_3 P3\nU 1 1 551F2247\nP 2750 1800\nF 0 \"P3\" V 2700 1800 50 0000 C CNN\nF 1 \"PWR\" V 2800 1800 40 0000 C CNN\nF 2 \"mfk-TE_282834-3\" H 2750 1800 60 0001 C CNN\nF 3 \"\" H 2750 1800 60 0000 C CNN\n\t1 2750 1800\n\t-1 0 0 -1 \n$EndComp\nWire Wire Line\n\t3650 1800 3100 1800\nWire Wire Line\n\t3100 1700 3350 1700\nWire Wire Line\n\t3150 1250 3150 1700\nText Label 3150 1250 3 60 ~ 0\nV_MOT\nWire Wire Line\n\t6750 4100 6750 3750\nWire Wire Line\n\t6750 5150 6750 6150\nText Label 6750 6150 1 60 ~ 0\nV_MOT\n$Comp\nL PWR_FLAG #FLG013\nU 1 1 551F243F\nP 3350 1650\nF 0 \"#FLG013\" H 3350 1745 30 0001 C CNN\nF 1 \"PWR_FLAG\" H 3350 1830 30 0000 C CNN\nF 2 \"\" H 3350 1650 60 0000 C CNN\nF 3 \"\" H 3350 1650 60 0000 C CNN\n\t1 3350 1650\n\t-1 0 0 -1 \n$EndComp\nConnection ~ 3150 1700\nWire Wire Line\n\t3350 1700 3350 1650\n$Comp\nL JUMPER J1\nU 1 1 552023B1\nP 4750 1800\nF 0 \"J1\" H 4750 1950 60 0000 C CNN\nF 1 \"PWR_BR\" H 4750 1720 40 0000 C CNN\nF 2 \"mfk-SIL-2\" H 4750 1800 60 0001 C CNN\nF 3 \"~\" H 4750 1800 60 0000 C CNN\n\t1 4750 1800\n\t1 0 0 -1 \n$EndComp\n$Comp\nL +5VD #PWR014\nU 1 1 552023F3\nP 4400 1450\nF 0 \"#PWR014\" H 4400 1400 20 0001 C CNN\nF 1 \"+5VD\" H 4400 1550 50 0000 C CNN\nF 2 \"\" H 4400 1450 60 0000 C CNN\nF 3 \"\" H 4400 1450 60 0000 C CNN\n\t1 4400 1450\n\t-1 0 0 -1 \n$EndComp\nWire Wire Line\n\t4450 1800 4400 1800\nWire Wire Line\n\t4400 1800 4400 1450\nText Label 5100 1350 3 60 ~ 0\nV_MOT\nWire Wire Line\n\t5050 1800 5100 1800\nWire Wire Line\n\t5100 1800 5100 1350\nText Notes 4000 2000 0 60 ~ 0\nUse jumper to power motor from +5VD.\n$EndSCHEMATC\n" }, { "path": "src/test/resources/samples/langs/KiCad Schematic/buttons.sch", "content": "EESchema Schematic File Version 2\nLIBS:simonLib\nLIBS:power\nLIBS:simonShield-cache\nEELAYER 25 0\nEELAYER END\n$Descr A4 11693 8268\nencoding utf-8\nSheet 2 4\nTitle \"Poncho Simon EDU-CIAA\"\nDate \"2016-07-26\"\nRev \"1.0\"\nComp \"Proyecto CIAA\"\nComment1 \"Juan Agustin Bassi\"\nComment2 \"CESE - Diseño PCB\"\nComment3 \"Licencia BSD\"\nComment4 \"\"\n$EndDescr\n$Comp\nL SW_PUSH SW1\nU 1 1 5777DBBB\nP 3500 3000\nF 0 \"SW1\" H 3650 3110 50 0000 C CNN\nF 1 \"SW_PUSH\" H 3500 2920 50 0000 C CNN\nF 2 \"simonShield:SW_PUSH_SMALL\" H 3500 3000 50 0001 C CNN\nF 3 \"\" H 3500 3000 50 0000 C CNN\nF 4 \"450-1804-ND\" H 3500 3000 60 0001 C CNN \"Digikey#\"\n\t1 3500 3000\n\t1 0 0 -1 \n$EndComp\n$Comp\nL R R1\nU 1 1 5777DBC2\nP 3150 2750\nF 0 \"R1\" V 3230 2750 50 0000 C CNN\nF 1 \"3K3\" V 3150 2750 50 0000 C CNN\nF 2 \"simonShield:Resistor_Horizontal_RM7mm\" V 3080 2750 50 0001 C CNN\nF 3 \"\" H 3150 2750 50 0000 C CNN\nF 4 \"680EBK-ND\" H 3150 2750 60 0001 C CNN \"Digikey#\"\n\t1 3150 2750\n\t-1 0 0 1 \n$EndComp\n$Comp\nL GND #PWR05\nU 1 1 5777DBC9\nP 3900 3100\nF 0 \"#PWR05\" H 3900 2850 50 0001 C CNN\nF 1 \"GND\" H 3900 2950 50 0000 C CNN\nF 2 \"\" H 3900 3100 50 0000 C CNN\nF 3 \"\" H 3900 3100 50 0000 C CNN\n\t1 3900 3100\n\t1 0 0 -1 \n$EndComp\nWire Wire Line\n\t3150 2450 3150 2600\nWire Wire Line\n\t3150 2900 3150 3000\nWire Wire Line\n\t3800 3000 3900 3000\nWire Wire Line\n\t3900 3000 3900 3100\nConnection ~ 3150 3000\n$Comp\nL SW_PUSH SW3\nU 1 1 5777DBDD\nP 5050 3000\nF 0 \"SW3\" H 5200 3110 50 0000 C CNN\nF 1 \"SW_PUSH\" H 5050 2920 50 0000 C CNN\nF 2 \"simonShield:SW_PUSH_SMALL\" H 5050 3000 50 0001 C CNN\nF 3 \"\" H 5050 3000 50 0000 C CNN\nF 4 \"450-1804-ND\" H 5050 3000 60 0001 C CNN \"Digikey#\"\n\t1 5050 3000\n\t1 0 0 -1 \n$EndComp\n$Comp\nL GND #PWR06\nU 1 1 5777DBEB\nP 5450 3100\nF 0 \"#PWR06\" H 5450 2850 50 0001 C CNN\nF 1 \"GND\" H 5450 2950 50 0000 C CNN\nF 2 \"\" H 5450 3100 50 0000 C CNN\nF 3 \"\" H 5450 3100 50 0000 C CNN\n\t1 5450 3100\n\t1 0 0 -1 \n$EndComp\nWire Wire Line\n\t4700 2450 4700 2600\nWire Wire Line\n\t4700 2900 4700 3000\nWire Wire Line\n\t5350 3000 5450 3000\nWire Wire Line\n\t5450 3000 5450 3100\nConnection ~ 4700 3000\n$Comp\nL SW_PUSH SW5\nU 1 1 5777DBFF\nP 6600 3000\nF 0 \"SW5\" H 6750 3110 50 0000 C CNN\nF 1 \"SW_PUSH\" H 6600 2920 50 0000 C CNN\nF 2 \"simonShield:SW_PUSH_SMALL\" H 6600 3000 50 0001 C CNN\nF 3 \"\" H 6600 3000 50 0000 C CNN\nF 4 \"450-1804-ND\" H 6600 3000 60 0001 C CNN \"Digikey#\"\n\t1 6600 3000\n\t1 0 0 -1 \n$EndComp\n$Comp\nL GND #PWR07\nU 1 1 5777DC0D\nP 7000 3100\nF 0 \"#PWR07\" H 7000 2850 50 0001 C CNN\nF 1 \"GND\" H 7000 2950 50 0000 C CNN\nF 2 \"\" H 7000 3100 50 0000 C CNN\nF 3 \"\" H 7000 3100 50 0000 C CNN\n\t1 7000 3100\n\t1 0 0 -1 \n$EndComp\nWire Wire Line\n\t6250 2450 6250 2600\nWire Wire Line\n\t6250 2900 6250 3000\nWire Wire Line\n\t6900 3000 7000 3000\nWire Wire Line\n\t7000 3000 7000 3100\nConnection ~ 6250 3000\n$Comp\nL SW_PUSH SW7\nU 1 1 5777DC21\nP 8150 3000\nF 0 \"SW7\" H 8300 3110 50 0000 C CNN\nF 1 \"SW_PUSH\" H 8150 2920 50 0000 C CNN\nF 2 \"simonShield:SW_PUSH_SMALL\" H 8150 3000 50 0001 C CNN\nF 3 \"\" H 8150 3000 50 0000 C CNN\nF 4 \"450-1804-ND\" H 8150 3000 60 0001 C CNN \"Digikey#\"\n\t1 8150 3000\n\t1 0 0 -1 \n$EndComp\n$Comp\nL GND #PWR08\nU 1 1 5777DC2F\nP 8550 3100\nF 0 \"#PWR08\" H 8550 2850 50 0001 C CNN\nF 1 \"GND\" H 8550 2950 50 0000 C CNN\nF 2 \"\" H 8550 3100 50 0000 C CNN\nF 3 \"\" H 8550 3100 50 0000 C CNN\n\t1 8550 3100\n\t1 0 0 -1 \n$EndComp\nWire Wire Line\n\t7800 2450 7800 2600\nWire Wire Line\n\t7800 2900 7800 3000\nWire Wire Line\n\t8450 3000 8550 3000\nWire Wire Line\n\t8550 3000 8550 3100\nConnection ~ 7800 3000\n$Comp\nL SW_PUSH SW2\nU 1 1 5777DC43\nP 3550 4350\nF 0 \"SW2\" H 3700 4460 50 0000 C CNN\nF 1 \"SW_PUSH\" H 3550 4270 50 0000 C CNN\nF 2 \"simonShield:SW_PUSH_SMALL\" H 3550 4350 50 0001 C CNN\nF 3 \"\" H 3550 4350 50 0000 C CNN\nF 4 \"450-1804-ND\" H 3550 4350 60 0001 C CNN \"Digikey#\"\n\t1 3550 4350\n\t1 0 0 -1 \n$EndComp\n$Comp\nL GND #PWR09\nU 1 1 5777DC51\nP 3950 4450\nF 0 \"#PWR09\" H 3950 4200 50 0001 C CNN\nF 1 \"GND\" H 3950 4300 50 0000 C CNN\nF 2 \"\" H 3950 4450 50 0000 C CNN\nF 3 \"\" H 3950 4450 50 0000 C CNN\n\t1 3950 4450\n\t1 0 0 -1 \n$EndComp\nWire Wire Line\n\t3200 3800 3200 3950\nWire Wire Line\n\t3200 4250 3200 4350\nWire Wire Line\n\t3850 4350 3950 4350\nWire Wire Line\n\t3950 4350 3950 4450\nConnection ~ 3200 4350\n$Comp\nL SW_PUSH SW4\nU 1 1 5777DC65\nP 5100 4350\nF 0 \"SW4\" H 5250 4460 50 0000 C CNN\nF 1 \"SW_PUSH\" H 5100 4270 50 0000 C CNN\nF 2 \"simonShield:SW_PUSH_SMALL\" H 5100 4350 50 0001 C CNN\nF 3 \"\" H 5100 4350 50 0000 C CNN\nF 4 \"450-1804-ND\" H 5100 4350 60 0001 C CNN \"Digikey#\"\n\t1 5100 4350\n\t1 0 0 -1 \n$EndComp\n$Comp\nL GND #PWR010\nU 1 1 5777DC73\nP 5500 4450\nF 0 \"#PWR010\" H 5500 4200 50 0001 C CNN\nF 1 \"GND\" H 5500 4300 50 0000 C CNN\nF 2 \"\" H 5500 4450 50 0000 C CNN\nF 3 \"\" H 5500 4450 50 0000 C CNN\n\t1 5500 4450\n\t1 0 0 -1 \n$EndComp\nWire Wire Line\n\t4750 4250 4750 4350\nWire Wire Line\n\t5400 4350 5500 4350\nWire Wire Line\n\t5500 4350 5500 4450\nConnection ~ 4750 4350\n$Comp\nL SW_PUSH SW6\nU 1 1 5777DC87\nP 6650 4350\nF 0 \"SW6\" H 6800 4460 50 0000 C CNN\nF 1 \"SW_PUSH\" H 6650 4270 50 0000 C CNN\nF 2 \"simonShield:SW_PUSH_SMALL\" H 6650 4350 50 0001 C CNN\nF 3 \"\" H 6650 4350 50 0000 C CNN\nF 4 \"450-1804-ND\" H 6650 4350 60 0001 C CNN \"Digikey#\"\n\t1 6650 4350\n\t1 0 0 -1 \n$EndComp\n$Comp\nL GND #PWR011\nU 1 1 5777DC95\nP 7050 4450\nF 0 \"#PWR011\" H 7050 4200 50 0001 C CNN\nF 1 \"GND\" H 7050 4300 50 0000 C CNN\nF 2 \"\" H 7050 4450 50 0000 C CNN\nF 3 \"\" H 7050 4450 50 0000 C CNN\n\t1 7050 4450\n\t1 0 0 -1 \n$EndComp\nWire Wire Line\n\t6300 3800 6300 3950\nWire Wire Line\n\t6300 4250 6300 4350\nWire Wire Line\n\t6950 4350 7050 4350\nWire Wire Line\n\t7050 4350 7050 4450\nConnection ~ 6300 4350\n$Comp\nL SW_PUSH SW8\nU 1 1 5777DCA9\nP 8200 4350\nF 0 \"SW8\" H 8350 4460 50 0000 C CNN\nF 1 \"SW_PUSH\" H 8200 4270 50 0000 C CNN\nF 2 \"simonShield:SW_PUSH_SMALL\" H 8200 4350 50 0001 C CNN\nF 3 \"\" H 8200 4350 50 0000 C CNN\nF 4 \"450-1804-ND\" H 8200 4350 60 0001 C CNN \"Digikey#\"\n\t1 8200 4350\n\t1 0 0 -1 \n$EndComp\n$Comp\nL GND #PWR012\nU 1 1 5777DCB7\nP 8600 4450\nF 0 \"#PWR012\" H 8600 4200 50 0001 C CNN\nF 1 \"GND\" H 8600 4300 50 0000 C CNN\nF 2 \"\" H 8600 4450 50 0000 C CNN\nF 3 \"\" H 8600 4450 50 0000 C CNN\n\t1 8600 4450\n\t1 0 0 -1 \n$EndComp\nWire Wire Line\n\t7850 3800 7850 3950\nWire Wire Line\n\t7850 4250 7850 4350\nWire Wire Line\n\t8500 4350 8600 4350\nWire Wire Line\n\t8600 4350 8600 4450\nConnection ~ 7850 4350\nWire Notes Line\n\t2400 1850 2400 4700\nWire Notes Line\n\t2400 4700 8800 4700\nWire Notes Line\n\t8800 4700 8800 1850\nWire Notes Line\n\t8800 2150 2400 2150\nText HLabel 2950 2800 0 60 Input ~ 0\nBTN_LED_1\nWire Wire Line\n\t2950 3000 3200 3000\nWire Wire Line\n\t2950 3000 2950 2800\nText HLabel 4500 2800 0 60 Input ~ 0\nBTN_LED_2\nText HLabel 6050 2800 0 60 Input ~ 0\nBTN_LED_3\nText HLabel 7600 2800 0 60 Input ~ 0\nBTN_LED_4\nWire Wire Line\n\t4500 3000 4750 3000\nWire Wire Line\n\t4500 3000 4500 2800\nWire Wire Line\n\t6050 3000 6300 3000\nWire Wire Line\n\t6050 3000 6050 2800\nWire Wire Line\n\t7600 3000 7850 3000\nWire Wire Line\n\t7600 3000 7600 2800\nText HLabel 3000 4150 0 60 Input ~ 0\nBTN_CFG_1\nWire Wire Line\n\t3000 4350 3250 4350\nWire Wire Line\n\t3000 4350 3000 4150\nText HLabel 4550 4150 0 60 Input ~ 0\nBTN_CFG_2\nText HLabel 6100 4150 0 60 Input ~ 0\nBTN_CFG_3\nText HLabel 7650 4150 0 60 Input ~ 0\nBTN_CFG_4\nWire Wire Line\n\t4550 4150 4550 4350\nWire Wire Line\n\t4550 4350 4800 4350\nWire Wire Line\n\t6100 4150 6100 4350\nWire Wire Line\n\t6100 4350 6350 4350\nWire Wire Line\n\t7650 4150 7650 4350\nWire Wire Line\n\t7650 4350 7900 4350\n$Comp\nL R R3\nU 1 1 577967E7\nP 4700 2750\nF 0 \"R3\" V 4780 2750 50 0000 C CNN\nF 1 \"3K3\" V 4700 2750 50 0000 C CNN\nF 2 \"simonShield:Resistor_Horizontal_RM7mm\" V 4630 2750 50 0001 C CNN\nF 3 \"\" H 4700 2750 50 0000 C CNN\nF 4 \"680EBK-ND\" H 4700 2750 60 0001 C CNN \"Digikey#\"\n\t1 4700 2750\n\t-1 0 0 1 \n$EndComp\n$Comp\nL R R5\nU 1 1 57796847\nP 6250 2750\nF 0 \"R5\" V 6330 2750 50 0000 C CNN\nF 1 \"3K3\" V 6250 2750 50 0000 C CNN\nF 2 \"simonShield:Resistor_Horizontal_RM7mm\" V 6180 2750 50 0001 C CNN\nF 3 \"\" H 6250 2750 50 0000 C CNN\nF 4 \"680EBK-ND\" H 6250 2750 60 0001 C CNN \"Digikey#\"\n\t1 6250 2750\n\t-1 0 0 1 \n$EndComp\n$Comp\nL R R7\nU 1 1 577968BC\nP 7800 2750\nF 0 \"R7\" V 7880 2750 50 0000 C CNN\nF 1 \"3K3\" V 7800 2750 50 0000 C CNN\nF 2 \"simonShield:Resistor_Horizontal_RM7mm\" V 7730 2750 50 0001 C CNN\nF 3 \"\" H 7800 2750 50 0000 C CNN\nF 4 \"680EBK-ND\" H 7800 2750 60 0001 C CNN \"Digikey#\"\n\t1 7800 2750\n\t-1 0 0 1 \n$EndComp\n$Comp\nL R R2\nU 1 1 5779693E\nP 3200 4100\nF 0 \"R2\" V 3280 4100 50 0000 C CNN\nF 1 \"3K3\" V 3200 4100 50 0000 C CNN\nF 2 \"simonShield:Resistor_Horizontal_RM7mm\" V 3130 4100 50 0001 C CNN\nF 3 \"\" H 3200 4100 50 0000 C CNN\nF 4 \"680EBK-ND\" H 3200 4100 60 0001 C CNN \"Digikey#\"\n\t1 3200 4100\n\t-1 0 0 1 \n$EndComp\n$Comp\nL R R4\nU 1 1 577969F3\nP 4750 4100\nF 0 \"R4\" V 4830 4100 50 0000 C CNN\nF 1 \"3K3\" V 4750 4100 50 0000 C CNN\nF 2 \"simonShield:Resistor_Horizontal_RM7mm\" V 4680 4100 50 0001 C CNN\nF 3 \"\" H 4750 4100 50 0000 C CNN\nF 4 \"680EBK-ND\" H 4750 4100 60 0001 C CNN \"Digikey#\"\n\t1 4750 4100\n\t-1 0 0 1 \n$EndComp\n$Comp\nL R R6\nU 1 1 57796A6F\nP 6300 4100\nF 0 \"R6\" V 6380 4100 50 0000 C CNN\nF 1 \"3K3\" V 6300 4100 50 0000 C CNN\nF 2 \"simonShield:Resistor_Horizontal_RM7mm\" V 6230 4100 50 0001 C CNN\nF 3 \"\" H 6300 4100 50 0000 C CNN\nF 4 \"680EBK-ND\" H 6300 4100 60 0001 C CNN \"Digikey#\"\n\t1 6300 4100\n\t-1 0 0 1 \n$EndComp\n$Comp\nL R R8\nU 1 1 57796AEC\nP 7850 4100\nF 0 \"R8\" V 7930 4100 50 0000 C CNN\nF 1 \"3K3\" V 7850 4100 50 0000 C CNN\nF 2 \"simonShield:Resistor_Horizontal_RM7mm\" V 7780 4100 50 0001 C CNN\nF 3 \"\" H 7850 4100 50 0000 C CNN\nF 4 \"680EBK-ND\" H 7850 4100 60 0001 C CNN \"Digikey#\"\n\t1 7850 4100\n\t-1 0 0 1 \n$EndComp\nText Notes 5400 2050 0 60 ~ 12\nBUTTONS\\n\nWire Notes Line\n\t8800 1850 2400 1850\nWire Wire Line\n\t4750 3950 4750 3800\n$Comp\nL VCC #PWR013\nU 1 1 5798AF98\nP 4750 3800\nF 0 \"#PWR013\" H 4750 3650 50 0001 C CNN\nF 1 \"VCC\" H 4750 3950 50 0000 C CNN\nF 2 \"\" H 4750 3800 50 0000 C CNN\nF 3 \"\" H 4750 3800 50 0000 C CNN\n\t1 4750 3800\n\t1 0 0 -1 \n$EndComp\n$Comp\nL VCC #PWR014\nU 1 1 5798B8B6\nP 3200 3800\nF 0 \"#PWR014\" H 3200 3650 50 0001 C CNN\nF 1 \"VCC\" H 3200 3950 50 0000 C CNN\nF 2 \"\" H 3200 3800 50 0000 C CNN\nF 3 \"\" H 3200 3800 50 0000 C CNN\n\t1 3200 3800\n\t1 0 0 -1 \n$EndComp\n$Comp\nL VCC #PWR015\nU 1 1 5798B8F1\nP 6300 3800\nF 0 \"#PWR015\" H 6300 3650 50 0001 C CNN\nF 1 \"VCC\" H 6300 3950 50 0000 C CNN\nF 2 \"\" H 6300 3800 50 0000 C CNN\nF 3 \"\" H 6300 3800 50 0000 C CNN\n\t1 6300 3800\n\t1 0 0 -1 \n$EndComp\n$Comp\nL VCC #PWR016\nU 1 1 5798B9EC\nP 7850 3800\nF 0 \"#PWR016\" H 7850 3650 50 0001 C CNN\nF 1 \"VCC\" H 7850 3950 50 0000 C CNN\nF 2 \"\" H 7850 3800 50 0000 C CNN\nF 3 \"\" H 7850 3800 50 0000 C CNN\n\t1 7850 3800\n\t1 0 0 -1 \n$EndComp\n$Comp\nL VCC #PWR017\nU 1 1 5798BB07\nP 7800 2450\nF 0 \"#PWR017\" H 7800 2300 50 0001 C CNN\nF 1 \"VCC\" H 7800 2600 50 0000 C CNN\nF 2 \"\" H 7800 2450 50 0000 C CNN\nF 3 \"\" H 7800 2450 50 0000 C CNN\n\t1 7800 2450\n\t1 0 0 -1 \n$EndComp\n$Comp\nL VCC #PWR018\nU 1 1 5798BB42\nP 6250 2450\nF 0 \"#PWR018\" H 6250 2300 50 0001 C CNN\nF 1 \"VCC\" H 6250 2600 50 0000 C CNN\nF 2 \"\" H 6250 2450 50 0000 C CNN\nF 3 \"\" H 6250 2450 50 0000 C CNN\n\t1 6250 2450\n\t1 0 0 -1 \n$EndComp\n$Comp\nL VCC #PWR019\nU 1 1 5798BB7D\nP 4700 2450\nF 0 \"#PWR019\" H 4700 2300 50 0001 C CNN\nF 1 \"VCC\" H 4700 2600 50 0000 C CNN\nF 2 \"\" H 4700 2450 50 0000 C CNN\nF 3 \"\" H 4700 2450 50 0000 C CNN\n\t1 4700 2450\n\t1 0 0 -1 \n$EndComp\n$Comp\nL VCC #PWR020\nU 1 1 5798BBB8\nP 3150 2450\nF 0 \"#PWR020\" H 3150 2300 50 0001 C CNN\nF 1 \"VCC\" H 3150 2600 50 0000 C CNN\nF 2 \"\" H 3150 2450 50 0000 C CNN\nF 3 \"\" H 3150 2450 50 0000 C CNN\n\t1 3150 2450\n\t1 0 0 -1 \n$EndComp\n$EndSCHEMATC\n" }, { "path": "src/test/resources/samples/langs/KiCad Schematic/buzzer.sch", "content": "EESchema Schematic File Version 2\nLIBS:simonShield-rescue\nLIBS:simonLib\nLIBS:74xgxx\nLIBS:74xx\nLIBS:ac-dc\nLIBS:actel\nLIBS:adc-dac\nLIBS:Altera\nLIBS:analog_devices\nLIBS:analog_switches\nLIBS:atmel\nLIBS:audio\nLIBS:brooktre\nLIBS:cmos4000\nLIBS:cmos_ieee\nLIBS:conn\nLIBS:contrib\nLIBS:cypress\nLIBS:dc-dc\nLIBS:device\nLIBS:digital-audio\nLIBS:diode\nLIBS:display\nLIBS:dsp\nLIBS:elec-unifil\nLIBS:ESD_Protection\nLIBS:ftdi\nLIBS:gennum\nLIBS:graphic\nLIBS:hc11\nLIBS:intel\nLIBS:interface\nLIBS:ir\nLIBS:Lattice\nLIBS:linear\nLIBS:logo\nLIBS:maxim\nLIBS:memory\nLIBS:microchip\nLIBS:microchip_dspic33dsc\nLIBS:microchip_pic10mcu\nLIBS:microchip_pic12mcu\nLIBS:microchip_pic16mcu\nLIBS:microchip_pic18mcu\nLIBS:microchip_pic32mcu\nLIBS:microcontrollers\nLIBS:motor_drivers\nLIBS:motorola\nLIBS:msp430\nLIBS:nordicsemi\nLIBS:nxp_armmcu\nLIBS:onsemi\nLIBS:opto\nLIBS:Oscillators\nLIBS:philips\nLIBS:power\nLIBS:powerint\nLIBS:Power_Management\nLIBS:pspice\nLIBS:references\nLIBS:regul\nLIBS:relays\nLIBS:rfcom\nLIBS:sensors\nLIBS:silabs\nLIBS:siliconi\nLIBS:stm8\nLIBS:stm32\nLIBS:supertex\nLIBS:switches\nLIBS:texas\nLIBS:transf\nLIBS:transistors\nLIBS:ttl_ieee\nLIBS:valves\nLIBS:video\nLIBS:Worldsemi\nLIBS:Xicor\nLIBS:xilinx\nLIBS:Zilog\nLIBS:simonShield-cache\nEELAYER 25 0\nEELAYER END\n$Descr A4 11693 8268\nencoding utf-8\nSheet 3 5\nTitle \"Poncho Simon EDU-CIAA\"\nDate \"2016-07-26\"\nRev \"1.0\"\nComp \"Proyecto CIAA\"\nComment1 \"Juan Agustin Bassi\"\nComment2 \"CESE - Diseño PCB\"\nComment3 \"Licencia BSD\"\nComment4 \"\"\n$EndDescr\n$Comp\nL BUZZER U1\nU 1 1 5777FCBE\nP 5600 4150\nF 0 \"U1\" H 5600 4150 60 0000 C CNN\nF 1 \"BUZZER\" H 5600 4150 60 0000 C CNN\nF 2 \"footprints:MagneticBuzzer_ProSignal_ABT-410-RC\" H 5600 4150 60 0001 C CNN\nF 3 \"\" H 5600 4150 60 0000 C CNN\nF 4 \"445-2525-1-ND\" H 5600 4150 60 0001 C CNN \"Digikey#\"\n\t1 5600 4150\n\t0 1 1 0 \n$EndComp\n$Comp\nL BC547 Q1\nU 1 1 5777FCC6\nP 5500 3350\nF 0 \"Q1\" H 5700 3425 50 0000 L CNN\nF 1 \"BC547\" H 5700 3350 50 0000 L CNN\nF 2 \"simonShield:TO-92_Molded_Narrow\" H 5700 3275 50 0000 L CIN\nF 3 \"\" H 5500 3350 50 0000 L CNN\nF 4 \"BC33725TACT-ND\" H 5500 3350 60 0001 C CNN \"Digikey#\"\n\t1 5500 3350\n\t1 0 0 -1 \n$EndComp\n$Comp\nL R R9\nU 1 1 5777FCCD\nP 5050 3350\nF 0 \"R9\" V 5130 3350 50 0000 C CNN\nF 1 \"3K3\" V 5050 3350 50 0000 C CNN\nF 2 \"footprints:Resistor_Horizontal_RM7mm\" V 4980 3350 50 0001 C CNN\nF 3 \"\" H 5050 3350 50 0000 C CNN\nF 4 \"680EBK-ND\" H 5050 3350 60 0001 C CNN \"Digikey#\"\n\t1 5050 3350\n\t0 1 1 0 \n$EndComp\n$Comp\nL GND #PWR017\nU 1 1 5777FCDA\nP 5600 4850\nF 0 \"#PWR017\" H 5600 4600 50 0001 C CNN\nF 1 \"GND\" H 5600 4700 50 0000 C CNN\nF 2 \"\" H 5600 4850 50 0000 C CNN\nF 3 \"\" H 5600 4850 50 0000 C CNN\n\t1 5600 4850\n\t1 0 0 -1 \n$EndComp\nWire Wire Line\n\t5600 2600 5600 3150\nWire Wire Line\n\t5600 3550 5600 3700\nWire Wire Line\n\t5600 4700 5600 4850\nWire Wire Line\n\t5200 3350 5300 3350\nText HLabel 4700 3050 0 60 Input ~ 0\nPWM\nWire Wire Line\n\t4700 3050 4700 3350\nWire Wire Line\n\t4700 3350 4900 3350\n$Comp\nL R R10\nU 1 1 577960FD\nP 5600 2450\nF 0 \"R10\" V 5680 2450 50 0000 C CNN\nF 1 \"1K\" H 5600 2450 50 0000 C CNN\nF 2 \"footprints:Resistor_Horizontal_RM7mm\" V 5530 2450 50 0001 C CNN\nF 3 \"\" H 5600 2450 50 0000 C CNN\nF 4 \"680EBK-ND\" H 5600 2450 60 0001 C CNN \"Digikey#\"\n\t1 5600 2450\n\t1 0 0 -1 \n$EndComp\nWire Wire Line\n\t5600 2100 5600 2300\nWire Notes Line\n\t3800 1000 3800 5450\nWire Notes Line\n\t3800 5450 7650 5450\nWire Notes Line\n\t7650 5450 7650 1000\nWire Notes Line\n\t7650 1350 3800 1350\nWire Notes Line\n\t7650 1000 3800 1000\nText Notes 5350 1250 0 60 ~ 12\nBUZZER CIRCUIT\n$Comp\nL VDD-RESCUE-simonShield #PWR018\nU 1 1 5777FCD4\nP 5600 2100\nF 0 \"#PWR018\" H 5600 1950 50 0001 C CNN\nF 1 \"VDD\" H 5600 2250 50 0000 C CNN\nF 2 \"\" H 5600 2100 50 0000 C CNN\nF 3 \"\" H 5600 2100 50 0000 C CNN\n\t1 5600 2100\n\t1 0 0 -1 \n$EndComp\n$EndSCHEMATC\n" }, { "path": "src/test/resources/samples/langs/KiCad Schematic/ciaaConector.sch", "content": "EESchema Schematic File Version 2\nLIBS:simonLib\nLIBS:power\nLIBS:simonShield-cache\nEELAYER 25 0\nEELAYER END\n$Descr A4 11693 8268\nencoding utf-8\nSheet 4 4\nTitle \"Poncho Simon EDU-CIAA\"\nDate \"2016-07-26\"\nRev \"1.0\"\nComp \"Proyecto CIAA\"\nComment1 \"Juan Agustin Bassi\"\nComment2 \"CESE - Diseño PCB\"\nComment3 \"Licencia BSD\"\nComment4 \"\"\n$EndDescr\n$Comp\nL GND #PWR029\nU 1 1 57781CE9\nP 3200 3000\nF 0 \"#PWR029\" H 3200 2750 50 0001 C CNN\nF 1 \"GND\" H 3200 2850 50 0000 C CNN\nF 2 \"\" H 3200 3000 50 0000 C CNN\nF 3 \"\" H 3200 3000 50 0000 C CNN\n\t1 3200 3000\n\t1 0 0 -1 \n$EndComp\n$Comp\nL Conn_Poncho2P_2x_20x2 XA?\nU 2 1 57781CEF\nP 3900 3050\nAR Path=\"/57781CEF\" Ref=\"XA?\" Part=\"2\" \nAR Path=\"/57781B52/57781CEF\" Ref=\"XA1\" Part=\"2\" \nF 0 \"XA1\" H 4200 3450 60 0000 C CNN\nF 1 \"Conn_Poncho2P_2x_20x2\" H 4250 1350 60 0000 C CNN\nF 2 \"simonShield:Conn_Poncho_SinBorde\" H 3900 3050 60 0001 C CNN\nF 3 \"\" H 3900 3050 60 0000 C CNN\nF 4 \"952-2121-ND\" H 3900 3050 60 0001 C CNN \"Digikey#\"\n\t2 3900 3050\n\t1 0 0 -1 \n$EndComp\n$Comp\nL PWR_JUMPER P1\nU 1 1 57781CF6\nP 4250 2250\nF 0 \"P1\" H 4250 2400 50 0000 C CNN\nF 1 \"PWR_JUMPER\" H 4250 2100 50 0000 C CNN\nF 2 \"simonShield:Pin_Header_Straight_2x02\" H 4250 1050 50 0001 C CNN\nF 3 \"\" H 4250 1050 50 0000 C CNN\nF 4 \"952-2121-ND\" H 4250 2250 60 0001 C CNN \"Digikey#\"\n\t1 4250 2250\n\t1 0 0 -1 \n$EndComp\nNoConn ~ 4850 2850\nNoConn ~ 4850 2950\nNoConn ~ 4850 3050\nNoConn ~ 4850 3150\nNoConn ~ 4850 3250\nNoConn ~ 4850 3350\nNoConn ~ 4850 3450\nNoConn ~ 3650 4050\nNoConn ~ 3650 3950\nNoConn ~ 3650 3850\nNoConn ~ 3650 3750\nNoConn ~ 3650 3650\nNoConn ~ 3650 3550\nNoConn ~ 3650 3450\nNoConn ~ 3650 3350\nNoConn ~ 3650 3250\nNoConn ~ 3650 3050\nNoConn ~ 3650 2950\nText HLabel 4850 3750 2 60 Input ~ 0\nBTN_CFG_1\nText HLabel 4850 3850 2 60 Input ~ 0\nBTN_CFG_2\nText HLabel 4850 4450 2 60 Input ~ 0\nBTN_CFG_3\nText HLabel 4850 4650 2 60 Input ~ 0\nBTN_CFG_4\nText HLabel 3650 4350 0 60 Input ~ 0\nLED_4\nText HLabel 4850 4350 2 60 Input ~ 0\nLED_3\nText HLabel 4850 4050 2 60 Input ~ 0\nLED_2\nText HLabel 4850 3550 2 60 Input ~ 0\nLED_1\nText HLabel 3650 4450 0 60 Input ~ 0\nBTN_LED_4\nText HLabel 4850 4550 2 60 Input ~ 0\nBTN_LED_3\nText HLabel 4850 3950 2 60 Input ~ 0\nBTN_LED_2\nText HLabel 4850 3650 2 60 Input ~ 0\nBTN_LED_1\nText HLabel 3650 3150 0 60 Input ~ 0\nPWM\n$Comp\nL Conn_Poncho2P_2x_20x2 XA1\nU 1 1 577946F6\nP 7400 3000\nF 0 \"XA1\" H 7700 3400 60 0000 C CNN\nF 1 \"Conn_Poncho2P_2x_20x2\" H 7750 1300 60 0000 C CNN\nF 2 \"simonShield:Conn_Poncho_SinBorde\" H 7400 3000 60 0001 C CNN\nF 3 \"\" H 7400 3000 60 0000 C CNN\nF 4 \"952-2121-ND\" H 7400 3000 60 0001 C CNN \"Digikey#\"\n\t1 7400 3000\n\t1 0 0 -1 \n$EndComp\nNoConn ~ 7150 2700\nNoConn ~ 7150 2800\nNoConn ~ 7150 2900\nNoConn ~ 7150 3000\nNoConn ~ 7150 3100\nNoConn ~ 7150 3200\nNoConn ~ 7150 3300\nNoConn ~ 7150 3400\nNoConn ~ 7150 3500\nNoConn ~ 7150 3600\nNoConn ~ 7150 3700\nNoConn ~ 7150 3800\nNoConn ~ 7150 3900\nNoConn ~ 7150 4000\nNoConn ~ 7150 4100\nNoConn ~ 7150 4200\nNoConn ~ 7150 4300\nNoConn ~ 7150 4400\nNoConn ~ 7150 4500\nNoConn ~ 7150 4600\nNoConn ~ 8350 4600\nNoConn ~ 8350 4500\nNoConn ~ 8350 4400\nNoConn ~ 8350 4300\nNoConn ~ 8350 4200\nNoConn ~ 8350 4100\nNoConn ~ 8350 4000\nNoConn ~ 8350 3900\nNoConn ~ 8350 3800\nNoConn ~ 8350 3700\nNoConn ~ 8350 3600\nNoConn ~ 8350 3500\nNoConn ~ 8350 3400\nNoConn ~ 8350 3300\nNoConn ~ 8350 3200\nNoConn ~ 8350 3100\nNoConn ~ 8350 3000\nNoConn ~ 8350 2900\nNoConn ~ 8350 2800\nNoConn ~ 8350 2700\nText Notes 5450 1150 0 60 ~ 12\nEDU-CIAA NXP CONNECTORS\nText Notes 4100 1300 0 60 ~ 12\nP2\nText Notes 7700 1300 0 60 ~ 12\nP1\n$Comp\nL GND #PWR030\nU 1 1 578F601E\nP 3400 4750\nF 0 \"#PWR030\" H 3400 4500 50 0001 C CNN\nF 1 \"GND\" H 3400 4600 50 0000 C CNN\nF 2 \"\" H 3400 4750 50 0000 C CNN\nF 3 \"\" H 3400 4750 50 0000 C CNN\n\t1 3400 4750\n\t1 0 0 -1 \n$EndComp\n$Comp\nL GND #PWR031\nU 1 1 57781D17\nP 5150 2900\nF 0 \"#PWR031\" H 5150 2650 50 0001 C CNN\nF 1 \"GND\" H 5150 2750 50 0000 C CNN\nF 2 \"\" H 5150 2900 50 0000 C CNN\nF 3 \"\" H 5150 2900 50 0000 C CNN\n\t1 5150 2900\n\t1 0 0 -1 \n$EndComp\n$Comp\nL C_100nF C1\nU 1 1 57781D10\nP 5150 2550\nF 0 \"C1\" H 5150 2650 40 0000 L CNN\nF 1 \"C_100nF\" H 5156 2465 40 0000 L CNN\nF 2 \"simonShield:C_Disc_D3_P2.5\" H 5188 2400 30 0001 C CNN\nF 3 \"\" H 5150 2550 60 0000 C CNN\nF 4 \"BC1160TR­ND\" H 5150 2550 60 0001 C CNN \"Digikey#\"\n\t1 5150 2550\n\t1 0 0 -1 \n$EndComp\n$Comp\nL VCC #PWR032\nU 1 1 5798B140\nP 4800 2050\nF 0 \"#PWR032\" H 4800 1900 50 0001 C CNN\nF 1 \"VCC\" H 4800 2200 50 0000 C CNN\nF 2 \"\" H 4800 2050 50 0000 C CNN\nF 3 \"\" H 4800 2050 50 0000 C CNN\n\t1 4800 2050\n\t1 0 0 -1 \n$EndComp\nWire Wire Line\n\t4850 2750 4900 2750\nWire Wire Line\n\t4900 2750 4900 2500\nWire Wire Line\n\t4900 2500 3800 2500\nWire Wire Line\n\t3800 2500 3800 2300\nWire Wire Line\n\t3800 2300 4000 2300\nWire Wire Line\n\t3650 2750 3600 2750\nWire Wire Line\n\t3600 2750 3600 2200\nWire Wire Line\n\t3600 2200 4000 2200\nWire Wire Line\n\t3200 2850 3200 3000\nWire Wire Line\n\t3650 2850 3200 2850\nWire Notes Line\n\t1950 1050 1950 5450\nWire Notes Line\n\t1950 5450 9850 5450\nWire Notes Line\n\t9850 5450 9850 1050\nWire Notes Line\n\t9850 1050 1950 1050\nWire Notes Line\n\t1950 1200 9850 1200\nWire Notes Line\n\t9850 1350 1950 1350\nWire Notes Line\n\t6050 1200 6050 5450\nWire Wire Line\n\t3650 4650 3400 4650\nWire Wire Line\n\t3400 4550 3400 4750\nWire Wire Line\n\t3650 4550 3400 4550\nConnection ~ 3400 4650\nWire Wire Line\n\t5150 2750 5150 2900\nWire Wire Line\n\t4500 2200 4800 2200\nWire Wire Line\n\t4800 2300 4800 2050\nWire Wire Line\n\t4500 2300 5150 2300\nConnection ~ 4800 2200\nWire Wire Line\n\t5150 2300 5150 2350\nConnection ~ 4800 2300\nNoConn ~ 3650 4250\nNoConn ~ 3650 4150\nNoConn ~ 4850 4150\nNoConn ~ 4850 4250\n$EndSCHEMATC\n" }, { "path": "src/test/resources/samples/langs/KiCad Schematic/gedda-junk.sch", "content": "v 20080706 2\nT 10000 20000 9 10 1 0 0 0 1\n_0_0_ 0.sym\nT 10000 19800 9 10 1 0 0 0 1\n_1_1_ 1.sym\nT 10000 19600 9 10 1 0 0 0 1\n_2_2_ 2.sym\nT 10000 19400 9 10 1 0 0 0 1\n_3_3_ 3.sym\nT 10000 19200 9 10 1 0 0 0 1\n_4_4_ 4.sym\nT 10000 19000 9 10 1 0 0 0 1\n_5_5_ 5.sym\nT 10000 18800 9 10 1 0 0 0 1\n_6_6_ 6.sym\nT 10000 18600 9 10 1 0 0 0 1\n_7_7_ 7.sym\nT 10000 18400 9 10 1 0 0 0 1\n_8_8_ 8.sym\nT 10000 18200 9 10 1 0 0 0 1\n_9_9_ 9.sym\nT 18000 17200 9 10 1 0 0 0 1\n_q_q_ q_.sym\nv 20130925 2\nC 40000 40000 0 0 0 title-B.sym\nN 43500 47000 44200 47000 4\nN 44200 47000 44200 49400 4\nN 44200 49400 41800 49400 4\nN 41800 47300 41800 49400 4\nN 41800 47300 41500 47300 4\nN 41500 47300 41500 45600 4\nN 41500 45600 41600 45600 4\nN 41600 45600 41600 44600 4\nN 41100 44600 41600 44600 4\nN 41100 44600 41100 42900 4\nN 41100 42900 42400 42900 4\nN 42400 42900 42400 43600 4\nN 42400 43600 41000 43600 4\nN 41000 43600 41000 41300 4\nU 45300 49600 45300 43900 10 0\nU 45300 43900 53800 43900 10 0\nU 53800 43900 53800 45900 10 0\nU 53800 45900 53100 45900 10 0\nU 53100 45900 53100 47300 10 0\nU 53100 47300 50500 47300 10 0\nV 48500 47400 900 3 0 0 0 -1 -1 0 -1 -1 -1 -1 -1\nP 47300 49100 50100 49100 1 0 0\n{\nT 47300 49100 5 10 0 0 0 0 1\npintype=unknown\nT 50155 49095 5 10 1 1 0 0 1\npinlabel=unknown\nT 50005 49145 5 10 1 1 0 6 1\npinnumber=0\nT 47300 49100 5 10 0 0 0 0 1\npinseq=0\n}\nP 51800 50000 51800 48500 1 0 0\n{\nT 51800 50000 5 10 0 0 0 0 1\npintype=unknown\nT 51800 48445 5 10 1 1 90 6 1\npinlabel=unknown\nT 51750 48595 5 10 1 1 90 0 1\npinnumber=0\nT 51800 50000 5 10 0 0 0 0 1\npinseq=0\n}\nP 54500 48500 54500 47900 1 0 0\n{\nT 54500 48500 5 10 0 0 0 0 1\npintype=unknown\nT 54500 47845 5 10 1 1 90 6 1\npinlabel=unknown\nT 54450 47995 5 10 1 1 90 0 1\npinnumber=0\nT 54500 48500 5 10 0 0 0 0 1\npinseq=0\n}\nC 46700 49800 1 0 0 af_output_transformer-1.sym\n{\nT 48000 52200 5 10 0 0 0 0 1\ndevice=AF_OUTPUT_TRANSFORMER\nT 48000 51900 5 10 1 1 0 0 1\nrefdes=U?\n}\nC 42900 41300 1 0 0 af_output_transformer-1.sym\n{\nT 44200 43700 5 10 0 0 0 0 1\ndevice=AF_OUTPUT_TRANSFORMER\nT 44200 43400 5 10 1 1 0 0 1\nrefdes=U?\n}\nT 48100 42000 9 10 1 0 0 0 1\nNFI_LOL\nC 42200 44500 1 0 0 ssrelay-spdt-lcc110-1.sym\n{\nT 42500 47100 5 10 0 0 0 0 1\ndevice=LCC110\nT 42500 46700 5 10 0 0 0 0 1\nsymversion=0.1\nT 42500 46250 5 10 1 1 0 0 1\nrefdes=U?\nT 42500 46900 5 10 0 0 0 0 1\nfootprint=DIP8\n}\nU 53200 50000 53200 47900 10 0\nU 53200 47900 53700 47900 10 0\nU 53700 47900 53700 46500 10 0\nU 53700 46500 54200 46500 10 0\nU 54200 46500 54200 43800 10 0\nU 54200 43800 45500 43800 10 0\nU 45500 43800 45500 42600 10 0\nU 45500 42600 49200 42600 10 0\nU 49200 42600 49200 41500 10 0\nU 49200 41500 47700 41500 10 0\nU 47700 41500 47700 42200 10 0\nU 47700 42200 45300 42200 10 0\nU 45300 42200 45300 40500 10 0\nU 45300 40500 40900 40500 10 0\nU 40900 40500 40900 41000 10 0\nU 40900 41000 40500 41000 10 0\nU 40500 41000 40500 50300 10 0\nU 40500 50300 45800 50300 10 0\nU 45800 50300 45800 49700 10 0\nU 45800 49700 45300 49700 10 0\nU 45300 49700 45300 48100 10 0\nU 45300 48100 43600 48100 10 0\nC 42500 47400 1 0 0 switch-dip12.sym\n{\nT 42800 51700 5 10 1 1 0 0 1\nfootprint=SWITCH_DIP12\nT 42800 51975 5 8 0 0 0 0 1\ndevice=SWITCH_DIP12\nT 42800 51350 5 10 1 1 0 0 1\nrefdes=S?\n}\n" }, { "path": "src/test/resources/samples/langs/KiCad Schematic/ultimate-temp-controller.sch", "content": "EESchema Schematic File Version 2\nLIBS:power\nLIBS:device\nLIBS:transistors\nLIBS:conn\nLIBS:linear\nLIBS:regul\nLIBS:74xx\nLIBS:cmos4000\nLIBS:adc-dac\nLIBS:memory\nLIBS:xilinx\nLIBS:special\nLIBS:microcontrollers\nLIBS:dsp\nLIBS:microchip\nLIBS:analog_switches\nLIBS:motorola\nLIBS:texas\nLIBS:intel\nLIBS:audio\nLIBS:interface\nLIBS:digital-audio\nLIBS:philips\nLIBS:display\nLIBS:cypress\nLIBS:siliconi\nLIBS:opto\nLIBS:atmel\nLIBS:contrib\nLIBS:valves\nLIBS:relays\nLIBS:w_relay\nLIBS:ultimate-temp-controller-cache\nEELAYER 25 0\nEELAYER END\n$Descr A4 11693 8268\nencoding utf-8\nSheet 1 2\nTitle \"\"\nDate \"\"\nRev \"\"\nComp \"\"\nComment1 \"\"\nComment2 \"\"\nComment3 \"\"\nComment4 \"\"\n$EndDescr\n$Sheet\nS 1400 2100 2150 2000\nU 54E5B803\nF0 \"controller\" 60\nF1 \"controller.sch\" 60\nF2 \"TC+\" I L 1400 2300 60 \nF3 \"TC-\" I L 1400 2400 60 \nF4 \"VCC\" I L 1400 3750 60 \nF5 \"GND\" I L 1400 3900 60 \nF6 \"RS485A\" I R 3550 3700 60 \nF7 \"RS485B\" I R 3550 3800 60 \nF8 \"DRAIN\" O R 3550 3300 60 \nF9 \"+5V\" O R 3550 2250 60 \nF10 \"SDA\" B R 3550 2350 60 \nF11 \"SCL\" B R 3550 2450 60 \nF12 \"GND\" O R 3550 2550 60 \nF13 \"RELAY_NO\" I R 3550 2850 60 \nF14 \"RELAY_COM\" I R 3550 3050 60 \nF15 \"RELAY_NC\" I R 3550 2950 60 \n$EndSheet\n$EndSCHEMATC\n" }, { "path": "src/test/resources/samples/langs/Kit/demo.kit", "content": "\n\n
\n\t

\n\t

\n\t\t\n\t

\n
" }, { "path": "src/test/resources/samples/langs/Kotlin/Foo.kt", "content": "package addressbook\n\nclass Contact(\n val name : String,\n val emails : List,\n val addresses : List,\n val phonenums : List\n)\n\nclass EmailAddress(\n val user : String,\n val host : String\n)\n\nclass PostalAddress(\n val streetAddress : String,\n val city : String,\n val zip : String,\n val state : USState?,\n val country : Country\n) {\n assert {(state == null) xor (country == Countries[\"US\"]) }\n}\n\nclass PhoneNumber(\n val country : Country,\n val areaCode : Int,\n val number : Long\n)\n\nobject Countries {\n fun get(id : CountryID) : Country = countryTable[id]\n \n private var table : Map? = null\n private val countryTable : Map\n get() {\n if (table == null) {\n table = HashMap()\n for (line in TextFile(\"countries.txt\").lines(stripWhiteSpace = true)) {\n table[line] = Country(line)\n }\n }\n return table\n }\n}\n\nclass Country(val name : String)" }, { "path": "src/test/resources/samples/langs/LFE/church.lfe", "content": ";; Copyright (c) 2013 Duncan McGreggor \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;; File : church.lfe\n;; Author : Duncan McGreggor\n;; Purpose : Demonstrating church numerals from the lambda calculus\n\n;; The code below was used to create the section of the user guide here:\n;; http://lfe.github.io/user-guide/recursion/5.html\n;;\n;; Here is some example usage:\n;;\n;; > (slurp '\"church.lfe\")\n;; #(ok church)\n;; > (zero)\n;; #Fun\n;; > (church->int1 (zero))\n;; 0\n;; > (church->int1 (three))\n;; 3\n;; > (church->int1 (five))\n;; 5\n;; > (church->int2 #'five/0)\n;; 5\n;; > (church->int2 (lambda () (get-church 25)))\n;; 25\n\n(defmodule church\n (export all))\n\n(defun zero ()\n (lambda (s)\n (lambda (x) x)))\n\n(defun one ()\n (lambda (s)\n (lambda (x)\n (funcall s x))))\n\n(defun two ()\n (lambda (s)\n (lambda (x)\n (funcall s\n (funcall s x)))))\n\n(defun three ()\n (lambda (s)\n (lambda (x)\n (funcall s\n (funcall s\n (funcall s x))))))\n\n(defun four ()\n (lambda (s)\n (lambda (x)\n (funcall s\n (funcall s\n (funcall s\n (funcall s x)))))))\n\n(defun five ()\n (get-church 5))\n\n(defun int-successor (n)\n (+ n 1))\n\n(defun church->int1 (church-numeral)\n \"\n Converts a called church numeral to an integer, e.g.:\n > (church->int1 (five))\n \"\n (funcall\n (funcall church-numeral #'int-successor/1) 0))\n\n(defun church->int2 (church-numeral)\n \"\n Converts a non-called church numeral to an integer, e.g.:\n > (church->int2 #'five/0)\n \"\n (funcall\n (funcall\n (funcall church-numeral) #'int-successor/1) 0))\n\n(defun church-successor (church-numeral)\n (lambda (s)\n (lambda (x)\n (funcall s\n (funcall\n (funcall church-numeral s) x)))))\n\n(defun get-church (church-numeral count limit)\n (cond ((== count limit) church-numeral)\n ((/= count limit)\n (get-church\n (church-successor church-numeral)\n (+ 1 count)\n limit))))\n\n(defun get-church (integer)\n (get-church (zero) 0 integer))\n" }, { "path": "src/test/resources/samples/langs/LFE/gps1.lfe", "content": ";;; -*- Mode: LFE; -*-\n;;; Code from Paradigms of Artificial Intelligence Programming\n;;; Copyright (c) 1991 Peter Norvig\n\n;;;; File gps1.lisp: First version of GPS (General Problem Solver)\n\n;;;; Converted to LFE by Robert Virding\n\n;; Define macros for global variable access. This is a hack and very naughty!\n(defsyntax defvar\n ([name val] (let ((v val)) (put 'name v) v)))\n\n(defsyntax setvar\n ([name val] (let ((v val)) (put 'name v) v)))\n\n(defsyntax getvar\n ([name] (get 'name)))\n\n;; Module definition.\n\n(defmodule gps1\n (export (gps 2) (gps 3) (school-ops 0))\n (import (from lists (member 2) (all 2) (any 2))\n ;; Rename lists functions to be more CL like.\n (rename lists ((all 2) every) ((any 2) some) ((filter 2) find-all))))\n\n;; An operation.\n(defrecord op\n action preconds add-list del-list)\n\n;; General Problem Solver: achieve all goals using *ops*.\n(defun gps (state goals ops)\n ;; Set global variables\n (defvar *state* state) ;The current state: a list of conditions.\n (defvar *ops* ops) ;A list of available operators.\n (if (every (fun achieve 1) goals) 'solved))\n\n(defun gps (state goals)\n ;; Set global variables, but use existing *ops*\n (defvar *state* state) ;The current state: a list of conditions.\n (if (every (fun achieve 1) goals) 'solved))\n\n;; A goal is achieved if it already holds or if there is an\n;; appropriate op for it that is applicable.\"\n(defun achieve (goal)\n (orelse (member goal (getvar *state*))\n (some (fun apply-op 1)\n (find-all (lambda (op) (appropriate-p goal op))\n (getvar *ops*)))))\n\n;; An op is appropriate to a goal if it is in its add list.\n(defun appropriate-p (goal op)\n (member goal (op-add-list op)))\n\n;; Print a message and update *state* if op is applicable.\n(defun apply-op (op)\n (if (every (fun achieve 1) (op-preconds op))\n (progn\n (: io fwrite '\"executing ~p\\n\" (list (op-action op)))\n (setvar *state* (set-difference (getvar *state*) (op-del-list op)))\n (setvar *state* (union (getvar *state*) (op-add-list op)))\n 'true)))\n\n;; Define the set functions to work on list, a listsets module really.\n(defun set-difference\n ([(cons e es) s2]\n (if (member e s2)\n (set-difference es s2)\n (cons e (set-difference es s2))))\n ([() s2] ()))\n\n(defun union\n ([(cons e es) s2]\n (if (member e s2) (union es s2) (cons e (union es s2))))\n ([() s2] ()))\n\n;;; ==============================\n\n(defun school-ops ()\n (list\n (make-op action 'drive-son-to-school\n preconds '(son-at-home car-works)\n add-list '(son-at-school)\n del-list '(son-at-home))\n (make-op action 'shop-installs-battery\n preconds '(car-needs-battery shop-knows-problem shop-has-money)\n add-list '(car-works)\n del-list ())\n (make-op action 'tell-shop-problem\n preconds '(in-communication-with-shop)\n add-list '(shop-knows-problem)\n del-list ())\n (make-op action 'telephone-shop\n preconds '(know-phone-number)\n add-list '(in-communication-with-shop)\n del-list ())\n (make-op action 'look-up-number\n preconds '(have-phone-book)\n add-list '(know-phone-number)\n del-list ())\n (make-op action 'give-shop-money\n preconds '(have-money)\n add-list '(shop-has-money)\n del-list '(have-money))))\n" }, { "path": "src/test/resources/samples/langs/LFE/mnesia_demo.lfe", "content": ";; Copyright (c) 2008-2013 Robert Virding\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;; File : mnesia_demo.lfe\n;; Author : Robert Virding\n;; Purpose : A simple Mnesia demo file for LFE.\n\n;; This file contains a simple demo of using LFE to access Mnesia\n;; tables. It shows how to use the emp-XXXX macro (ETS match pattern)\n;; together with mnesia:match_object, match specifications with\n;; mnesia:select and Query List Comprehensions.\n\n(defmodule mnesia_demo\n (export (new 0) (by_place 1) (by_place_ms 1) (by_place_qlc 1)))\n\n(defrecord person name place job)\n\n(defun new ()\n ;; Start mnesia and create a table, we will get an in memory only schema.\n (: mnesia start)\n (: mnesia create_table 'person '(#(attributes (name place job))))\n ;; Initialise the table.\n (let ((people '(\n ;; First some people in London.\n #(fred london waiter)\n #(bert london waiter)\n #(john london painter)\n #(paul london driver)\n ;; Now some in Paris.\n #(jean paris waiter)\n #(gerard paris driver)\n #(claude paris painter)\n #(yves paris waiter)\n ;; And some in Rome.\n #(roberto rome waiter)\n #(guiseppe rome driver)\n #(paulo rome painter)\n ;; And some in Berlin.\n #(fritz berlin painter)\n #(kurt berlin driver)\n #(hans berlin waiter)\n #(franz berlin waiter)\n )))\n (: lists foreach (match-lambda\n ([(tuple n p j)]\n (: mnesia transaction\n (lambda ()\n (let ((new (make-person name n place p job j)))\n (: mnesia write new))))))\n people)))\n\n;; Match records by place using match_object and the emp-XXXX macro.\n(defun by_place (place)\n (: mnesia transaction\n (lambda () (: mnesia match_object (emp-person place place)))))\n\n;; Use match specifications to match records\n(defun by_place_ms (place)\n (let ((f (lambda () (: mnesia select 'person\n (match-spec ([(match-person name n place p job j)]\n (when (=:= p place))\n (tuple n j)))))))\n (: mnesia transaction f)))\n\n;; Use Query List Comprehensions to match records\n(defun by_place_qlc (place)\n (let ((f (lambda ()\n (let ((q (qlc (lc ((<- person (: mnesia table 'person))\n (=:= (person-place person) place))\n person))))\n (: qlc e q)))))\n (: mnesia transaction f)))\n" }, { "path": "src/test/resources/samples/langs/LFE/object.lfe", "content": ";; Copyright (c) 2013 Duncan McGreggor \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;; File : object.lfe\n;; Author : Duncan McGreggor\n;; Purpose : Demonstrating simple OOP with closures\n\n;; The simple object system demonstrated below shows how to do the following:\n;; * create objects\n;; * call methods on those objects\n;; * have methods which can call other methods\n;; * update the state of an instance variable\n;;\n;; Note, however, that his example does not demonstrate inheritance.\n;;\n;; To use the code below in LFE, do the following:\n;;\n;; $ cd examples\n;; $ ../bin/lfe -pa ../ebin\n;;\n;; Load the file and create a fish-class instance:\n;;\n;; > (slurp '\"object.lfe\")\n;; #(ok object)\n;; > (set mommy-fish (fish-class '\"Carp\"))\n;; #Fun\n;;\n;; Execute some of the basic methods:\n;;\n;; > (get-species mommy-fish)\n;; \"Carp\"\n;; > (move mommy-fish 17)\n;; The Carp swam 17 feet!\n;; ok\n;; > (get-id mommy-fish)\n;; \"47eebe91a648f042fc3fb278df663de5\"\n;;\n;; Now let's look at \"modifying\" state data (e.g., children counts):\n;;\n;; > (get-children mommy-fish)\n;; ()\n;; > (get-children-count mommy-fish)\n;; 0\n;; > (set (mommy-fish baby-fish-1) (reproduce mommy-fish))\n;; (#Fun #Fun)\n;; > (get-id mommy-fish)\n;; \"47eebe91a648f042fc3fb278df663de5\"\n;; > (get-id baby-fish-1)\n;; \"fdcf35983bb496650e558a82e34c9935\"\n;; > (get-children-count mommy-fish)\n;; 1\n;; > (set (mommy-fish baby-fish-2) (reproduce mommy-fish))\n;; (#Fun #Fun)\n;; > (get-id mommy-fish)\n;; \"47eebe91a648f042fc3fb278df663de5\"\n;; > (get-id baby-fish-2)\n;; \"3e64e5c20fb742dd88dac1032749c2fd\"\n;; > (get-children-count mommy-fish)\n;; 2\n;; > (get-info mommy-fish)\n;; id: \"47eebe91a648f042fc3fb278df663de5\"\n;; species: \"Carp\"\n;; children: [\"fdcf35983bb496650e558a82e34c9935\",\n;; \"3e64e5c20fb742dd88dac1032749c2fd\"]\n;; ok\n\n(defmodule object\n (export all))\n\n(defun fish-class (species)\n \"\n This is the constructor that will be used most often, only requiring that\n one pass a 'species' string.\n\n When the children are not defined, simply use an empty list.\n \"\n (fish-class species ()))\n\n(defun fish-class (species children)\n \"\n This contructor is mostly useful as a way of abstracting out the id\n generation from the larger constructor. Nothing else uses fish-class/2\n besides fish-class/1, so it's not strictly necessary.\n\n When the id isn't know, generate one.\"\n (let* (((binary (id (size 128))) (: crypto rand_bytes 16))\n (formatted-id (car\n (: io_lib format\n '\"~32.16.0b\" (list id)))))\n (fish-class species children formatted-id)))\n\n(defun fish-class (species children id)\n \"\n This is the constructor used internally, once the children and fish id are\n known.\n \"\n (let ((move-verb '\"swam\"))\n (lambda (method-name)\n (case method-name\n ('id\n (lambda (self) id))\n ('species\n (lambda (self) species))\n ('children\n (lambda (self) children))\n ('info\n (lambda (self)\n (: io format\n '\"id: ~p~nspecies: ~p~nchildren: ~p~n\"\n (list (get-id self)\n (get-species self)\n (get-children self)))))\n ('move\n (lambda (self distance)\n (: io format\n '\"The ~s ~s ~p feet!~n\"\n (list species move-verb distance))))\n ('reproduce\n (lambda (self)\n (let* ((child (fish-class species))\n (child-id (get-id child))\n (children-ids (: lists append\n (list children (list child-id))))\n (parent-id (get-id self))\n (parent (fish-class species children-ids parent-id)))\n (list parent child))))\n ('children-count\n (lambda (self)\n (: erlang length children)))))))\n\n(defun get-method (object method-name)\n \"\n This is a generic function, used to call into the given object (class\n instance).\n \"\n (funcall object method-name))\n\n; define object methods\n(defun get-id (object)\n (funcall (get-method object 'id) object))\n\n(defun get-species (object)\n (funcall (get-method object 'species) object))\n\n(defun get-info (object)\n (funcall (get-method object 'info) object))\n\n(defun move (object distance)\n (funcall (get-method object 'move) object distance))\n\n(defun reproduce (object)\n (funcall (get-method object 'reproduce) object))\n\n(defun get-children (object)\n (funcall (get-method object 'children) object))\n\n(defun get-children-count (object)\n (funcall (get-method object 'children-count) object))" }, { "path": "src/test/resources/samples/langs/LOLCODE/LOLTracer.lol", "content": "HAI 1.3\n OBTW\n Author: Logan Kelly (logan.kelly@gmail.com)\n Github: https://github.com/LoganKelly/LOLTracer\n TLDR\n\n OBTW prev is the number used in the randin function.\n I had to declare it in global scope so that it\n would retain its value between calls to randin.\n TLDR\n I HAS A prev ITZ 0\n I HAS A rand_max ITZ 104729\n\n\n OBTW Equivalent to C's rand() function, except returns\n a number in the range of 0 to rand_max.\n TLDR\n HOW IZ I randin\n I HAS A a ITZ 33083\n I HAS A c ITZ 67607\n prev R MOD OF SUM OF PRODUKT OF prev AN a AN c AN rand_max\n FOUND YR prev\n IF U SAY SO\n\n\n BTW Returns a random number within the range of 0-1.\n HOW IZ I rand_onein\n I HAS A rand_num ITZ I IZ randin MKAY\n rand_num IS NOW A NUMBAR\n I HAS A rand_max_float ITZ MAEK rand_max A NUMBAR\n FOUND YR QUOSHUNT OF rand_num AN rand_max_float\n IF U SAY SO\n\n\n OBTW Equivalent to C ceil() function. Returns the next\n largest integer for the given number.\n TLDR\n HOW IZ I ceilin YR num\n I HAS A int_num ITZ num\n int_num IS NOW A NUMBR\n BOTH SAEM int_num AN num, O RLY?\n YA RLY, FOUND YR num\n OIC\n DIFFRINT num AN SMALLR OF num AN 0, O RLY?\n YA RLY\n int_num R SUM OF int_num AN 1\n FOUND YR MAEK int_num A NUMBAR\n OIC\n DIFFRINT num AN BIGGR OF num AN 0, O RLY?\n YA RLY\n FOUND YR MAEK int_num A NUMBAR\n OIC\n IF U SAY SO\n\n\n OBTW Convert a number to hexadecimal. This\n is returned as a string.\n TLDR\n HOW IZ I decimal_to_hex YR num\n I HAS A i ITZ 0\n I HAS A rem\n I HAS A hex_num ITZ A BUKKIT\n I HAS A decimal_num ITZ num\n IM IN YR num_loop\n rem R MOD OF decimal_num AN 16\n I HAS A hex_digit\n rem, WTF?\n OMG 10, hex_digit R \"A\", GTFO\n OMG 11, hex_digit R \"B\", GTFO\n OMG 12, hex_digit R \"C\", GTFO\n OMG 13, hex_digit R \"D\", GTFO\n OMG 14, hex_digit R \"E\", GTFO\n OMG 15, hex_digit R \"F\", GTFO\n OMGWTF, hex_digit R rem\n OIC\n hex_num HAS A SRS i ITZ hex_digit\n decimal_num R QUOSHUNT OF decimal_num AN 16\n BOTH SAEM decimal_num AN 0, O RLY?\n YA RLY, GTFO\n NO WAI, i R SUM OF i AN 1\n OIC\n IM OUTTA YR num_loop\n I HAS A hex_string ITZ A YARN\n IM IN YR string_reverse\n DIFFRINT i AN BIGGR OF i AN 0, O RLY?\n YA RLY, GTFO\n OIC\n hex_string R SMOOSH hex_string AN hex_num'Z SRS i MKAY\n i R DIFF OF i AN 1\n IM OUTTA YR string_reverse\n FOUND YR hex_string\n IF U SAY SO\n\n\n OBTW Convert a number to binary. This is returned\n as a bukkit which has slots number 0-N where\n n is equal to the number of binary digits - 1.\n It also has a length slot which is equal to\n the number of binary digits.\n TLDR\n HOW IZ I decimal_to_binary YR num\n I HAS A i ITZ 0\n I HAS A decimal_num ITZ num\n I HAS A binary_num ITZ A BUKKIT\n IM IN YR num_loop\n binary_num HAS A SRS i ITZ MOD OF decimal_num AN 2\n decimal_num R QUOSHUNT OF decimal_num AN 2\n BOTH SAEM decimal_num AN 0, O RLY?\n YA RLY\n I HAS A length ITZ SUM OF i AN 1\n binary_num HAS A length ITZ length\n GTFO\n NO WAI, i R SUM OF i AN 1\n OIC\n IM OUTTA YR num_loop\n FOUND YR binary_num\n IF U SAY SO\n\n\n OBTW Bitwise and two binary numbers. The numbers\n must be provided in the format returned by\n decimal_to_binary.\n TLDR\n HOW IZ I bitwise_andin YR first_num AN YR second_num\n I HAS A binary_first_num ITZ I IZ decimal_to_binary YR first_num MKAY\n I HAS A binary_second_num ITZ I IZ decimal_to_binary YR second_num MKAY\n I HAS A first_length ITZ binary_first_num'Z length\n I HAS A second_length ITZ binary_second_num'Z length\n I HAS A max_length ITZ BIGGR OF first_length AN second_length\n I HAS A final_binary ITZ A BUKKIT\n I HAS A final_length ITZ 0\n I HAS A i ITZ 0\n IM IN YR num_loop\n BOTH SAEM i AN max_length, O RLY?\n YA RLY, GTFO\n OIC\n I HAS A first_binary ITZ 0\n I HAS A second_binary ITZ 0\n DIFFRINT i AN BIGGR OF i AN first_length, O RLY?\n YA RLY, first_binary R binary_first_num'Z SRS i\n OIC\n DIFFRINT i AN BIGGR OF i AN second_length, O RLY?\n YA RLY, second_binary R binary_second_num'Z SRS i\n OIC\n EITHER OF BOTH SAEM first_binary AN 0 AN ...\n BOTH SAEM second_binary AN 0, O RLY?\n YA RLY, final_binary HAS A SRS i ITZ 0\n NO WAI\n final_binary HAS A SRS i ITZ 1\n final_length R SUM OF i AN 1\n OIC\n i R SUM OF i AN 1\n IM OUTTA YR num_loop\n final_binary HAS A length ITZ final_length\n FOUND YR final_binary\n IF U SAY SO\n\n\n OBTW Bitshift left a binary number by num_bits.\n The binary number must be provided in the format\n returned by decimal_to_binary.\n TLDR\n HOW IZ I bit_shift_leftin YR num AN YR num_bits\n I HAS A binary_num ITZ num\n I HAS A length ITZ binary_num'Z length\n I HAS A i ITZ SUM OF DIFF OF length AN 1 AN num_bits\n I HAS A shifted_binary_num ITZ A BUKKIT\n IM IN YR num_loop\n BOTH SAEM i AN -1, O RLY?\n YA RLY, GTFO\n OIC\n I HAS A unshifted_index ITZ DIFF OF i AN num_bits\n BOTH SAEM unshifted_index AN BIGGR OF unshifted_index AN 0, O RLY?\n YA RLY\n shifted_binary_num HAS A SRS i ITZ binary_num'Z SRS unshifted_index\n NO WAI\n shifted_binary_num HAS A SRS i ITZ 0\n OIC\n i R DIFF OF i AN 1\n IM OUTTA YR num_loop\n shifted_binary_num HAS A length ITZ SUM OF binary_num'Z length AN num_bits\n FOUND YR shifted_binary_num\n IF U SAY SO\n\n\n OBTW Convert a binary number into a decimal number.\n The binary number must be provided in the format\n return by decimal_to_binary.\n TLDR\n HOW IZ I binary_to_decimal YR binary_num\n I HAS A length ITZ binary_num'Z length\n I HAS A decimal_num ITZ 0\n I HAS A i ITZ 0\n IM IN YR num_loop\n BOTH SAEM i AN length, O RLY?\n YA RLY, GTFO\n OIC\n I HAS A binary_value ITZ binary_num'Z SRS i\n I HAS A decimal_value ITZ 0\n BOTH SAEM binary_value AN 1, O RLY?\n YA RLY, decimal_value R I IZ power_of YR 2 AN YR i MKAY\n OIC\n decimal_num R SUM OF decimal_num AN decimal_value\n i R SUM OF i AN 1\n IM OUTTA YR num_loop\n FOUND YR decimal_num\n IF U SAY SO\n\n\n OBTW Equivalent to C's pow() function. Raises\n base to the power of exponent.\n TLDR\n HOW IZ I power_of YR base AN YR exponent\n I HAS A i ITZ 0\n I HAS A num ITZ 1\n IM IN YR num_loop\n BOTH SAEM i AN exponent, O RLY?\n YA RLY, GTFO\n OIC\n num R PRODUKT OF num AN base\n i R SUM OF i AN 1\n IM OUTTA YR num_loop\n FOUND YR num\n IF U SAY SO\n\n\n OBTW Return a binary number as a YARN.\n The binary number must be provided in the format\n return by decimal_to_binary.\n TLDR\n HOW IZ I binary_to_string YR binary_num\n I HAS A binary_string ITZ A YARN\n I HAS A i ITZ DIFF OF binary_num'Z length AN 1\n IM IN YR string_reverse\n DIFFRINT i AN BIGGR OF i AN 0, O RLY?\n YA RLY, GTFO\n OIC\n binary_string R SMOOSH binary_string AN binary_num'Z SRS i MKAY\n i R DIFF OF i AN 1\n IM OUTTA YR string_reverse\n FOUND YR binary_string\n IF U SAY SO\n\n OBTW Converts a hexadecimal number to the character\n equivalent in UNICODE. This was originally used\n in an attempt to write out to the P6 format of PPM,\n but the string produced by VISIBLE didn't seem to be\n properly formatted for some reason. Instead I fell back\n to P3 of PPM and wrote out to regular ascii format.\n TLDR\n HOW IZ I hex_to_char YR hex_string\n OBTW This is a hack I found for converting hexadecimal strings\n into their unicode character equivalents. Instead of using\n the \":\" character directly, we escape it and get it using its\n unicode hex value (3A). This allows us to assemble the string\n with our inserted hex value without errors.\n TLDR\n FOUND YR SMOOSH \":(3A)\" AN \"(\" AN hex_string AN \")\" MKAY\n IF U SAY SO\n\n\n OBTW Equivalent to C's square() function. However it will only\n produce accurate results if the number is no larger than\n 1048576. See the note below. This is based upon Newton's\n Approximation Method as adapted in C at this website (#11):\n\n http://www.codeproject.com/Articles/69941/Best-Square-Root-Method-Algorithm-Function-Precisi\n TLDR\n HOW IZ I square_rootin YR number\n OBTW Forcing a comparison between the accuracy and a number\n which is so big that its precision is larger than the\n accuracy causes an infinite loop to occur. For this\n reason we have to set any number larger than 2^20 to\n a value below it.\n TLDR\n BOTH SAEM number AN BIGGR OF number AN 1048576.00, O RLY?\n YA RLY, number R 1048575.00\n OIC\n I HAS A accuracy ITZ 0.0001\n I HAS A lower ITZ A NUMBAR\n I HAS A upper ITZ A NUMBAR\n I HAS A guess ITZ A NUMBAR\n DIFFRINT number AN BIGGR OF number AN 1.0, O RLY?\n YA RLY\n lower R number\n upper R 1.0\n NO WAI\n lower R 1.0\n upper R number\n OIC\n IM IN YR LOOP\n I HAS A delta ITZ DIFF OF upper AN lower\n BOTH SAEM delta AN SMALLR OF delta AN accuracy, O RLY?\n YA RLY, GTFO\n OIC\n I HAS A guess ITZ QUOSHUNT OF SUM OF lower AN upper AN 2.0\n I HAS A guess_squared ITZ PRODUKT OF guess AN guess\n DIFFRINT guess_squared AN SMALLR OF guess_squared AN number, O RLY?\n YA RLY\n upper R guess\n NO WAI\n lower R guess\n OIC\n IM OUTTA YR LOOP\n FOUND YR QUOSHUNT OF SUM OF lower AN upper AN 2.0\n IF U SAY SO\n\n\n OBTW\n The intersection test for line [o, d]\n Return 2 if a hit was found (and also return distance t and bouncing ray n).\n Return 0 if no hit was found but ray goes upward\n Return 1 if no hit was found but ray goes downward\n TLDR\n HOW IZ I tracin YR o AN YR d\n I HAS A t ITZ 1000000000\n I HAS A m ITZ 0\n BOTH SAEM d'Z z AN 0, O RLY?\n YA RLY, d'Z z R 0.00001\n OIC\n I HAS A p ITZ QUOSHUNT OF DIFF OF 0 AN o'Z z AN d'Z z\n I HAS A n ITZ LIEK A Vector\n DIFFRINT p AN SMALLR OF p AN 0.01, O RLY?\n YA RLY\n t R p\n n R Vector IZ constructin YR 0.0 AN YR 0.0 AN YR 1.0 MKAY\n m R 1\n OIC\n\n BTW The world is encoded in sphere_positions, with 9 lines and 19 columns\n I HAS A k ITZ 18\n IM IN YR column_loop BTW For each column of objects\n BOTH SAEM k AN -1, O RLY?\n YA RLY, GTFO\n OIC\n\n I HAS A j ITZ 8\n IM IN YR line_loop BTW For each line on that column\n BOTH SAEM j AN -1, O RLY?\n YA RLY, GTFO\n OIC\n\n I HAS A sphere_positions_line ITZ sphere_positions'Z SRS j\n sphere_positions_line'Z SRS k, O RLY?\n YA RLY\n BTW There is a sphere, but does the ray hit it?\n p R Vector IZ addin YR o AN YR ...\n Vector IZ constructin YR DIFF OF 0 AN k AN ...\n YR 0 AN ...\n YR DIFF OF DIFF OF 0 AN j AN 4 MKAY ...\n MKAY\n I HAS A b ITZ Vector IZ dot_productin YR p AN YR d MKAY\n I HAS A q_c ITZ DIFF OF Vector IZ dot_productin YR p AN YR p MKAY AN 1\n I HAS A q ITZ DIFF OF PRODUKT OF b AN b AN q_c\n\n\n DIFFRINT q AN SMALLR OF q AN 0, O RLY?\n YA RLY\n BTW It does, compute the distance camera-sphere\n I HAS A s ITZ DIFF OF DIFF OF 0 AN b AN I IZ square_rootin YR q MKAY\n\n\n BOTH OF DIFFRINT s AN BIGGR OF s AN t AN ...\n DIFFRINT s AN SMALLR OF s AN 0.01, O RLY?\n YA RLY\n BTW So far this is the minimum distance, save it. And\n BTW also compute the bouncing ray vector into 'n'\n t R s\n I HAS A bouncing_ray ITZ Vector IZ scalin YR direction AN YR t MKAY\n bouncing_ray R Vector IZ addin YR p AN YR bouncing_ray MKAY\n n R Vector IZ normalizin YR bouncing_ray MKAY\n m R 2\n OIC\n OIC\n OIC\n j R DIFF OF j AN 1\n IM OUTTA YR line_loop\n k R DIFF OF k AN 1\n IM OUTTA YR column_loop\n I HAS A result ITZ A BUKKIT\n result HAS A m ITZ m\n result HAS A t ITZ t\n result HAS A n ITZ n\n FOUND YR result\n IF U SAY SO\n\n\n OBTW\n Sample the world and return the pixel color for\n a ray [o, d]\n TLDR\n HOW IZ I samplin YR o AN YR d\n\n BTW Search for an intersection ray Vs. world\n I HAS A result ITZ I IZ tracin YR o AN YR d MKAY\n I HAS A m ITZ result'Z m\n I HAS A t ITZ result'Z t\n I HAS A n ITZ result'Z n\n\n BOTH SAEM m AN 0, O RLY?\n YA RLY\n BTW No sphere found and the ray goes upward: Generate a sky color\n I HAS A vec_result ITZ Vector IZ constructin YR 0.7 AN YR 0.6 AN YR 1.0 MKAY\n\n I HAS A z_component ITZ d'Z z\n DIFFRINT z_component AN BIGGR OF z_component AN 0, O RLY?\n YA RLY, z_component R 0\n OIC\n I HAS A vec_num ITZ DIFF OF 1 AN z_component\n vec_num R I IZ power_of YR vec_num AN YR 4 MKAY\n FOUND YR Vector IZ scalin YR vec_result AN YR vec_num MKAY\n OIC\n\n BTW h = intersection coordinate\n I HAS A h ITZ Vector IZ scalin YR d AN YR t MKAY\n h R Vector IZ addin YR o AN YR h MKAY\n BTW l = direction to light (with random delta for soft shadows)\n I HAS A l ITZ LIEK A Vector\n l HAS A x ITZ SUM OF 9 AN I IZ rand_onein MKAY\n l HAS A y ITZ SUM OF 9 AN I IZ rand_onein MKAY\n l HAS A z ITZ 16\n I HAS A l_two ITZ Vector IZ scalin YR h AN YR -1.0 MKAY\n l R Vector IZ addin YR l AN YR l_two MKAY\n l R Vector IZ normalizin YR l MKAY\n BTW r = The half-vector\n I HAS A r ITZ Vector IZ dot_productin YR n AN YR d MKAY\n r R PRODUKT OF r AN -2\n r R Vector IZ scalin YR n AN YR r MKAY\n r R Vector IZ addin YR d AN YR r MKAY\n\n BTW Calculate the lambertian factor\n I HAS A b ITZ Vector IZ dot_productin YR l AN YR n MKAY\n\n BTW Calculate illumination factor (lambertian coefficient > 0 or in shadow)?\n I HAS A illumination_result ITZ I IZ tracin YR h AN YR l MKAY\n I HAS A i_m ITZ illumination_result'Z m\n EITHER OF DIFFRINT b AN BIGGR OF b AN 0 AN BOTH SAEM i_m AN 2, O RLY?\n YA RLY, b R 0\n OIC\n\n BTW Calculate the color 'p' with diffuse and specular component\n I HAS A base\n DIFFRINT b AN SMALLR OF b AN 0, O RLY?\n YA RLY, base R 1\n NO WAI, base R 0\n OIC\n base R Vector IZ scalin YR r AN YR base MKAY\n base R Vector IZ dot_productin YR l AN YR r MKAY\n I HAS A p ITZ I IZ power_of YR base AN YR 99 MKAY\n\n BOTH SAEM m AN 1, O RLY?\n YA RLY\n BTW No sphere was hit and the ray was going downward: Generate a floor color\n h R Vector IZ scalin YR h AN YR 0.2 MKAY\n I HAS A ceil_h_x ITZ I IZ ceilin YR h'Z x MKAY\n I HAS A ceil_h_y ITZ I IZ ceilin YR h'Z y MKAY\n I HAS A ceil_h ITZ SUM OF ceil_h_x AN ceil_h_y\n ceil_h IS NOW A NUMBR\n I HAS A color_choice ITZ MOD OF ceil_h AN 2\n I HAS A color ITZ LIEK A Vector\n color_choice, O RLY?\n YA RLY\n color HAS A x ITZ 3\n color HAS A y ITZ 1\n color HAS A z ITZ 1\n NO WAI\n color HAS A x ITZ 3\n color HAS A y ITZ 3\n color HAS A z ITZ 3\n OIC\n FOUND YR Vector IZ scalin YR color AN YR SUM OF PRODUKT OF b AN 0.2 AN 0.1 MKAY\n OIC\n\n BTW m == 2 A sphere was hit. Cast a ray bouncing from the sphere surface.\n I HAS A sphere_color ITZ LIEK A Vector\n sphere_color HAS A x ITZ p\n sphere_color HAS A y ITZ p\n sphere_color HAS A z ITZ p\n I HAS A recursive_color ITZ I IZ samplin YR h AN YR r MKAY\n BTW Attenuate color by 50% since it is bouncing (* .5)\n recursive_color R Vector IZ scalin YR recursive_color AN YR 0.5 MKAY\n FOUND YR Vector IZ addin YR sphere_color AN YR recursive_color MKAY\n IF U SAY SO\n\n\n OBTW The vector class provides functionality for all the common\n linear algebra operations performed on vectors.\n TLDR\n O HAI IM Vector\n I HAS A x ITZ 0\n I HAS A y ITZ 0\n I HAS A z ITZ 0\n\n BTW Add vector_one and vector_two\n HOW IZ I addin YR vector_one AN YR vector_two\n I HAS A result ITZ LIEK A Vector\n result HAS A x ITZ 0\n result HAS A y ITZ 0\n result HAS A z ITZ 0\n result'Z x R SUM OF vector_one'Z x AN vector_two'Z x\n result'Z y R SUM OF vector_one'Z y AN vector_two'Z y\n result'Z z R SUM OF vector_one'Z z AN vector_two'Z z\n FOUND YR result\n IF U SAY SO\n\n BTW Scale vector_one by value\n HOW IZ I scalin YR vector_one AN YR value\n I HAS A result ITZ LIEK A Vector\n result HAS A x ITZ 0\n result HAS A y ITZ 0\n result HAS A z ITZ 0\n result'Z x R PRODUKT OF vector_one'Z x AN value\n result'Z y R PRODUKT OF vector_one'Z y AN value\n result'Z z R PRODUKT OF vector_one'Z z AN value\n FOUND YR result\n IF U SAY SO\n\n BTW Dot product of vector_one and vector_two\n HOW IZ I dot_productin YR vector_one AN YR vector_two\n FOUND YR SUM OF SUM OF PRODUKT OF vector_one'Z x AN vector_two'Z x AN ...\n PRODUKT OF vector_one'Z y AN vector_two'Z y AN ...\n PRODUKT OF vector_one'Z z AN vector_two'Z z\n IF U SAY SO\n\n BTW Cross product of vector_one and vector_two\n HOW IZ I cross_productin YR vector_one AN YR vector_two\n I HAS A result ITZ LIEK A Vector\n result HAS A x ITZ 0\n result HAS A y ITZ 0\n result HAS A z ITZ 0\n result'Z x R DIFF OF PRODUKT OF vector_one'Z y AN vector_two'Z z AN ...\n PRODUKT OF vector_one'Z z AN vector_two'Z y\n result'Z y R DIFF OF PRODUKT OF vector_one'Z z AN vector_two'Z x AN ...\n PRODUKT OF vector_one'Z x AN vector_two'Z z\n result'Z z R DIFF OF PRODUKT OF vector_one'Z x AN vector_two'Z y AN ...\n PRODUKT OF vector_one'Z y AN vector_two'Z x\n FOUND YR result\n IF U SAY SO\n\n BTW Length of vector_one\n HOW IZ I lengthin YR vector_one\n FOUND YR I IZ square_rootin YR ...\n SUM OF SUM OF PRODUKT OF vector_one'Z x AN vector_one'Z x AN ...\n PRODUKT OF vector_one'Z y AN vector_one'Z y AN ...\n PRODUKT OF vector_one'Z z AN vector_one'Z z MKAY\n IF U SAY SO\n\n BTW Normalize vector_one\n HOW IZ I normalizin YR vector_one\n I HAS A result ITZ LIEK A Vector\n result HAS A x ITZ 0\n result HAS A y ITZ 0\n result HAS A z ITZ 0\n I HAS A length ITZ Vector IZ lengthin YR vector_one MKAY\n BOTH SAEM length AN 0, O RLY?\n YA RLY\n length R 1\n OIC\n result'Z x R QUOSHUNT OF vector_one'Z x AN length\n result'Z y R QUOSHUNT OF vector_one'Z y AN length\n result'Z z R QUOSHUNT OF vector_one'Z z AN length\n FOUND YR result\n IF U SAY SO\n\n BTW Printable YARN version of vector\n HOW IZ I to_stringin YR vector\n FOUND YR SMOOSH \"[\" AN vector'Z x AN \", \" ...\n AN vector'Z y AN \", \" ...\n AN vector'Z z AN \"]\" MKAY\n IF U SAY SO\n\n BTW Create and return a vector with components x, y, and z\n HOW IZ I constructin YR x AN YR y AN YR z\n I HAS A result ITZ LIEK A Vector\n result HAS A x ITZ x\n result HAS A y ITZ y\n result HAS A z ITZ z\n FOUND YR result\n IF U SAY SO\n KTHX\n\n OBTW The positions of the spheres are essentially\n stored in a 2-D array. This differs from Kensler's\n version where he used bit flags to store the\n positions in a compressed and quickly accessed\n manner. Unfortunately for us, bit operations\n in LOLCODE were too slow for this to be a tenable\n solution.\n TLDR\n I HAS A sphere_positions ITZ A BUKKIT\n I HAS A sphere_positions_0 ITZ A BUKKIT\n IM IN YR LOOP UPPIN YR pos_index TIL BOTH SAEM pos_index AN 19\n sphere_positions_0 HAS A SRS pos_index ITZ FAIL\n IM OUTTA YR LOOP\n sphere_positions HAS A SRS 0 ITZ sphere_positions_0\n I HAS A sphere_positions_1 ITZ A BUKKIT\n sphere_positions_1 HAS A SRS 0 ITZ WIN\n BTW sphere_positions_1 HAS A SRS 0 ITZ FAIL\n sphere_positions_1 HAS A SRS 1 ITZ FAIL\n sphere_positions_1 HAS A SRS 2 ITZ WIN\n BTW sphere_positions_1 HAS A SRS 2 ITZ FAIL\n sphere_positions_1 HAS A SRS 3 ITZ FAIL\n sphere_positions_1 HAS A SRS 4 ITZ WIN\n BTW sphere_positions_1 HAS A SRS 4 ITZ FAIL\n sphere_positions_1 HAS A SRS 5 ITZ FAIL\n sphere_positions_1 HAS A SRS 6 ITZ FAIL\n sphere_positions_1 HAS A SRS 7 ITZ WIN\n BTW sphere_positions_1 HAS A SRS 7 ITZ FAIL\n sphere_positions_1 HAS A SRS 8 ITZ FAIL\n sphere_positions_1 HAS A SRS 9 ITZ WIN\n BTW sphere_positions_1 HAS A SRS 9 ITZ FAIL\n sphere_positions_1 HAS A SRS 10 ITZ FAIL\n sphere_positions_1 HAS A SRS 11 ITZ WIN\n BTW sphere_positions_1 HAS A SRS 11 ITZ FAIL\n sphere_positions_1 HAS A SRS 12 ITZ FAIL\n sphere_positions_1 HAS A SRS 13 ITZ FAIL\n sphere_positions_1 HAS A SRS 14 ITZ WIN\n BTWsphere_positions_1 HAS A SRS 14 ITZ FAIL\n sphere_positions_1 HAS A SRS 15 ITZ FAIL\n sphere_positions_1 HAS A SRS 16 ITZ WIN\n BTW sphere_positions_1 HAS A SRS 16 ITZ FAIL\n sphere_positions_1 HAS A SRS 17 ITZ FAIL\n sphere_positions_1 HAS A SRS 18 ITZ WIN\n BTW sphere_positions_1 HAS A SRS 18 ITZ FAIL\n sphere_positions HAS A SRS 1 ITZ sphere_positions_1\n I HAS A sphere_positions_2 ITZ A BUKKIT\n IM IN YR LOOP UPPIN YR pos_index TIL BOTH SAEM pos_index AN 19\n sphere_positions_2 HAS A SRS pos_index ITZ FAIL\n IM OUTTA YR LOOP\n sphere_positions HAS A SRS 2 ITZ sphere_positions_2\n I HAS A sphere_positions_3 ITZ A BUKKIT\n sphere_positions_3 HAS A SRS 0 ITZ FAIL\n sphere_positions_3 HAS A SRS 1 ITZ FAIL\n sphere_positions_3 HAS A SRS 2 ITZ FAIL\n sphere_positions_3 HAS A SRS 3 ITZ FAIL\n sphere_positions_3 HAS A SRS 4 ITZ WIN\n BTW sphere_positions_3 HAS A SRS 4 ITZ FAIL\n sphere_positions_3 HAS A SRS 5 ITZ FAIL\n sphere_positions_3 HAS A SRS 6 ITZ FAIL\n sphere_positions_3 HAS A SRS 7 ITZ WIN\n BTW sphere_positions_3 HAS A SRS 7 ITZ FAIL\n sphere_positions_3 HAS A SRS 8 ITZ FAIL\n sphere_positions_3 HAS A SRS 9 ITZ FAIL\n sphere_positions_3 HAS A SRS 10 ITZ FAIL\n sphere_positions_3 HAS A SRS 11 ITZ WIN\n sphere_positions_3 HAS A SRS 12 ITZ FAIL\n sphere_positions_3 HAS A SRS 13 ITZ FAIL\n sphere_positions_3 HAS A SRS 14 ITZ FAIL\n sphere_positions_3 HAS A SRS 15 ITZ FAIL\n sphere_positions_3 HAS A SRS 16 ITZ FAIL\n sphere_positions_3 HAS A SRS 17 ITZ FAIL\n sphere_positions_3 HAS A SRS 18 ITZ WIN\n BTW sphere_positions_3 HAS A SRS 18 ITZ FAIL\n sphere_positions HAS A SRS 3 ITZ sphere_positions_3\n I HAS A sphere_positions_4 ITZ A BUKKIT\n IM IN YR LOOP UPPIN YR pos_index TIL BOTH SAEM pos_index AN 19\n sphere_positions_4 HAS A SRS pos_index ITZ FAIL\n IM OUTTA YR LOOP\n sphere_positions HAS A SRS 4 ITZ sphere_positions_4\n I HAS A sphere_positions_5 ITZ A BUKKIT\n sphere_positions_5 HAS A SRS 0 ITZ FAIL\n sphere_positions_5 HAS A SRS 1 ITZ FAIL\n sphere_positions_5 HAS A SRS 2 ITZ FAIL\n sphere_positions_5 HAS A SRS 3 ITZ FAIL\n sphere_positions_5 HAS A SRS 4 ITZ WIN\n BTW sphere_positions_5 HAS A SRS 4 ITZ FAIL\n sphere_positions_5 HAS A SRS 5 ITZ FAIL\n sphere_positions_5 HAS A SRS 6 ITZ FAIL\n sphere_positions_5 HAS A SRS 7 ITZ WIN\n BTW sphere_positions_5 HAS A SRS 7 ITZ FAIL\n sphere_positions_5 HAS A SRS 8 ITZ FAIL\n sphere_positions_5 HAS A SRS 9 ITZ WIN\n BTW sphere_positions_5 HAS A SRS 9 ITZ FAIL\n sphere_positions_5 HAS A SRS 10 ITZ FAIL\n sphere_positions_5 HAS A SRS 11 ITZ WIN\n BTW sphere_positions_5 HAS A SRS 11 ITZ FAIL\n sphere_positions_5 HAS A SRS 12 ITZ FAIL\n sphere_positions_5 HAS A SRS 13 ITZ FAIL\n sphere_positions_5 HAS A SRS 14 ITZ FAIL\n sphere_positions_5 HAS A SRS 15 ITZ FAIL\n sphere_positions_5 HAS A SRS 16 ITZ FAIL\n sphere_positions_5 HAS A SRS 17 ITZ FAIL\n sphere_positions_5 HAS A SRS 18 ITZ WIN\n BTW sphere_positions_5 HAS A SRS 18 ITZ FAIL\n sphere_positions HAS A SRS 5 ITZ sphere_positions_5\n I HAS A sphere_positions_6 ITZ A BUKKIT\n IM IN YR LOOP UPPIN YR pos_index TIL BOTH SAEM pos_index AN 19\n sphere_positions_6 HAS A SRS pos_index ITZ FAIL\n IM OUTTA YR LOOP\n sphere_positions HAS A SRS 6 ITZ sphere_positions_6\n I HAS A sphere_positions_7 ITZ A BUKKIT\n IM IN YR LOOP UPPIN YR pos_index TIL BOTH SAEM pos_index AN 19\n sphere_positions_7 HAS A SRS pos_index ITZ FAIL\n IM OUTTA YR LOOP\n sphere_positions HAS A SRS 7 ITZ sphere_positions_7\n I HAS A sphere_positions_8 ITZ A BUKKIT\n IM IN YR LOOP UPPIN YR pos_index TIL BOTH SAEM pos_index AN 19\n sphere_positions_8 HAS A SRS pos_index ITZ FAIL\n IM OUTTA YR LOOP\n sphere_positions HAS A SRS 8 ITZ sphere_positions_8\n\n BTW Camera direction\n I HAS A g ITZ Vector IZ constructin YR -6.0 AN YR -16.0 AN YR 0.0 MKAY\n g R Vector IZ normalizin YR g MKAY\n\n BTW Camera up vector\n I HAS A a ITZ Vector IZ constructin YR 0.0 AN YR 0.0 AN YR 1.0 MKAY\n a R Vector IZ cross_productin YR a AN YR g MKAY\n a R Vector IZ normalizin YR a MKAY\n a R Vector IZ scalin YR a AN YR 0.002 MKAY\n BTW Camera right vector\n I HAS A b ITZ Vector IZ cross_productin YR g AN YR a MKAY\n b R Vector IZ normalizin YR b MKAY\n b R Vector IZ scalin YR b AN YR 0.002 MKAY\n BTW Camera eye offset\n I HAS A c ITZ Vector IZ addin YR a AN YR b MKAY\n c R Vector IZ scalin YR c AN YR -256.0 MKAY\n c R Vector IZ addin YR c AN YR g MKAY\n\n I HAS A max_x ITZ 511\n I HAS A max_y ITZ max_x\n BTW Issue the PPM Header info\n VISIBLE \"P3 \" SUM OF max_x AN 1 \" \" SUM OF max_y AN 1 \" 255\"!\n\n I HAS A viewpoint ITZ Vector IZ constructin YR 17 AN YR 16 AN YR 8 MKAY\n\n I HAS A y ITZ max_y\n IM IN YR y_loop\n BOTH SAEM y AN -1, O RLY?\n YA RLY, GTFO\n OIC\n I HAS A x ITZ max_x\n IM IN YR x_loop\n BOTH SAEM x AN -1, O RLY?\n YA RLY, GTFO\n OIC\n I HAS A pixel_color ITZ Vector IZ constructin YR 13 AN YR 13 AN YR 13 MKAY\n\n I HAS A rays ITZ 64\n IM IN YR ray_loop\n BOTH SAEM rays AN 0, O RLY?\n YA RLY, GTFO\n OIC\n\n BTW The delta to apply to the origin of the view (For Depth of View blur).\n I HAS A a_rand ITZ DIFF OF I IZ rand_onein MKAY AN 0.5\n I HAS A t_a ITZ Vector IZ scalin YR a AN YR a_rand MKAY\n t_a R Vector IZ scalin YR t_a AN YR 99.0 MKAY\n I HAS A b_rand ITZ DIFF OF I IZ rand_onein MKAY AN 0.5\n I HAS A t_b ITZ Vector IZ scalin YR b AN YR b_rand MKAY\n t_b R Vector IZ scalin YR t_b AN YR 99.0 MKAY\n I HAS A t ITZ Vector IZ addin YR t_a AN YR t_b MKAY\n\n I HAS A origin ITZ Vector IZ addin YR viewpoint AN YR t MKAY\n\n BTW Ray direction with random deltas for stochastic sampling\n I HAS A direction_up ITZ SUM OF I IZ rand_onein MKAY AN x\n direction_up R Vector IZ scalin YR a AN YR direction_up MKAY\n I HAS A direction_right ITZ SUM OF I IZ rand_onein MKAY AN y\n direction_right R Vector IZ scalin YR b AN YR direction_right MKAY\n I HAS A direction_t ITZ Vector IZ scalin YR t AN YR -1 MKAY\n I HAS A direction ITZ Vector IZ addin YR direction_right AN YR direction_up MKAY\n direction R Vector IZ addin YR direction AN YR c MKAY\n direction R Vector IZ scalin YR direction AN YR 16 MKAY\n direction R Vector IZ addin YR direction AN YR direction_t MKAY\n direction R Vector IZ normalizin YR direction MKAY\n\n I HAS A sample_color ITZ I IZ samplin YR origin AN YR direction MKAY\n sample_color R Vector IZ scalin YR sample_color AN YR 3.5 MKAY\n BTW + pixel_color for color accumulation\n pixel_color R Vector IZ addin YR sample_color AN YR pixel_color MKAY\n rays R DIFF OF rays AN 1\n IM OUTTA YR ray_loop\n I HAS A write_color ITZ pixel_color\n write_color'Z x IS NOW A NUMBR\n write_color'Z y IS NOW A NUMBR\n write_color'Z z IS NOW A NUMBR\n DIFFRINT write_color'Z x AN BIGGR OF write_color'Z x AN 0, O RLY?\n YA RLY, write_color'Z x R 0\n OIC\n DIFFRINT write_color'Z y AN BIGGR OF write_color'Z y AN 0, O RLY?\n YA RLY, write_color'Z y R 0\n OIC\n DIFFRINT write_color'Z z AN BIGGR OF write_color'Z z AN 0, O RLY?\n YA RLY, write_color'Z z R 0\n OIC\n VISIBLE \" \" write_color'Z x \" \" ...\n \" \" write_color'Z y \" \" ...\n \" \" write_color'Z z \" \"!\n x R DIFF OF x AN 1\n IM OUTTA YR x_loop\n y R DIFF OF y AN 1\n IM OUTTA YR y_loop\n\nKTHXBYE\n" }, { "path": "src/test/resources/samples/langs/LSL/LSL.lsl", "content": "/*\n Testing syntax highlighting\n for the Linden Scripting Language\n*/\n\ninteger someIntNormal = 3672;\ninteger someIntHex = 0x00000000;\ninteger someIntMath = PI_BY_TWO;\n\ninteger event = 5673;// 'event' is invalid.illegal\n\nkey someKeyTexture = TEXTURE_DEFAULT;\nstring someStringSpecial = EOF;\n\nsome_user_defined_function_without_return_type(string inputAsString)\n{\n llSay(PUBLIC_CHANNEL, inputAsString);\n}\n\nstring user_defined_function_returning_a_string(key inputAsKey)\n{\n return (string)inputAsKey;\n}\n\ndefault\n{\n state_entry()\n {\n key someKey = NULL_KEY;\n someKey = llGetOwner();\n\n string someString = user_defined_function_returning_a_string(someKey);\n\n some_user_defined_function_without_return_type(someString);\n }\n\n touch_start(integer num_detected)\n {\n list agentsInRegion = llGetAgentList(AGENT_LIST_REGION, []);\n integer numOfAgents = llGetListLength(agentsInRegion);\n\n integer index; // defaults to 0\n for (; index <= numOfAgents - 1; index++) // for each agent in region\n {\n llRegionSayTo(llList2Key(agentsInRegion, index), PUBLIC_CHANNEL, \"Hello, Avatar!\");\n }\n }\n\n touch_end(integer num_detected)\n {\n someIntNormal = 3672;\n someIntHex = 0x00000000;\n someIntMath = PI_BY_TWO;\n\n event = 5673;// 'event' is invalid.illegal\n\n someKeyTexture = TEXTURE_DEFAULT;\n someStringSpecial = EOF;\n\n llSetInventoryPermMask(\"some item\", MASK_NEXT, PERM_ALL);// 'llSetInventoryPermMask' is reserved.godmode\n\n llWhisper(PUBLIC_CHANNEL, \"Leaving \\\"default\\\" now...\");\n state other;\n }\n}\n\nstate other\n{\n state_entry()\n {\n llWhisper(PUBLIC_CHANNEL, \"Entered \\\"state other\\\", returning to \\\"default\\\" again...\");\n state default;\n }\n}\n" }, { "path": "src/test/resources/samples/langs/LSL/LSL.lslp", "content": "/*\n Testing syntax highlighting\n for the Linden Scripting Language\n*/\n\ninteger someIntNormal = 3672;\ninteger someIntHex = 0x00000000;\ninteger someIntMath = PI_BY_TWO;\n\ninteger event = 5673;// 'event' is invalid.illegal\n\nkey someKeyTexture = TEXTURE_DEFAULT;\nstring someStringSpecial = EOF;\n\nsome_user_defined_function_without_return_type(string inputAsString)\n{\n llSay(PUBLIC_CHANNEL, inputAsString);\n}\n\nstring user_defined_function_returning_a_string(key inputAsKey)\n{\n return (string)inputAsKey;\n}\n\ndefault\n{\n state_entry()\n {\n key someKey = NULL_KEY;\n someKey = llGetOwner();\n\n string someString = user_defined_function_returning_a_string(someKey);\n\n some_user_defined_function_without_return_type(someString);\n }\n\n touch_start(integer num_detected)\n {\n list agentsInRegion = llGetAgentList(AGENT_LIST_REGION, []);\n integer numOfAgents = llGetListLength(agentsInRegion);\n\n integer index; // defaults to 0\n for (; index <= numOfAgents - 1; index++) // for each agent in region\n {\n llRegionSayTo(llList2Key(agentsInRegion, index), PUBLIC_CHANNEL, \"Hello, Avatar!\");\n }\n }\n\n touch_end(integer num_detected)\n {\n someIntNormal = 3672;\n someIntHex = 0x00000000;\n someIntMath = PI_BY_TWO;\n\n event = 5673;// 'event' is invalid.illegal\n\n someKeyTexture = TEXTURE_DEFAULT;\n someStringSpecial = EOF;\n\n llSetInventoryPermMask(\"some item\", MASK_NEXT, PERM_ALL);// 'llSetInventoryPermMask' is reserved.godmode\n\n llWhisper(PUBLIC_CHANNEL, \"Leaving \\\"default\\\" now...\");\n state other;\n }\n}\n\nstate other\n{\n state_entry()\n {\n llWhisper(PUBLIC_CHANNEL, \"Entered \\\"state other\\\", returning to \\\"default\\\" again...\");\n state default;\n }\n}\n" }, { "path": "src/test/resources/samples/langs/Lasso/json.lasso", "content": "\n\t// \n\t// \n\t// This tag is now incorporated in Lasso 8.6.0.1\n\t//\n\nIf: (Lasso_TagExists: 'Encode_JSON') == False;\n\n\tDefine_Tag: 'JSON', -Namespace='Encode_', -Required='value', -Optional='options';\n\t\n\t\tLocal: 'escapes' = Map('\\\\' = '\\\\', '\"' = '\"', '\\r' = 'r', '\\n' = 'n', '\\t' = 't', '\\f' = 'f', '\\b' = 'b');\n\t\tLocal: 'output' = '';\n\t\tLocal: 'newoptions' = (Array: -Internal);\n\t\tIf: !(Local_Defined: 'options') || (#options->(IsA: 'array') == False);\n\t\t\tLocal: 'options' = (Array);\n\t\t/If;\n\t\tIf: (#options >> -UseNative) || (Params >> -UseNative);\n\t\t\t#newoptions->(Insert: -UseNative);\n\t\t/If;\n\t\tIf: (#options >> -NoNative) || (Params >> -NoNative);\n\t\t\t#newoptions->(Insert: -NoNative);\n\t\t/If;\n\t\tIf: (#options !>> -UseNative) && ((#value->(IsA: 'set')) || (#value->(IsA: 'list')) || (#value->(IsA: 'queue')) || (#value->(IsA: 'priorityqueue')) || (#value->(IsA: 'stack')));\n\t\t\t#output += (Encode_JSON: Array->(insertfrom: #value->iterator) &, -Options=#newoptions);\n\t\tElse: (#options !>> -UseNative) && (#value->(IsA: 'pair'));\n\t\t\t#output += (Encode_JSON: (Array: #value->First, #value->Second));\n\t\tElse: (#options !>> -Internal) && (#value->(Isa: 'array') == False) && (#value->(IsA: 'map') == False);\n\t\t\t#output += '[' + (Encode_JSON: #value, -Options=#newoptions) + ']';\n\t\tElse: (#value->(IsA: 'literal'));\n\t\t\t#output += #value;\n\t\tElse: (#value->(IsA: 'string'));\n\t\t\t#output += '\"';\n\t\t\tLoop: (#value->Length);\n\t\t\t\tLocal('character' = #value->(Get: Loop_Count));\n\t\t\t\t#output->(Append:\n\t\t\t\t\t(Match_RegExp('[\\\\x{0020}-\\\\x{21}\\\\x{23}-\\\\x{5b}\\\\x{5d}-\\\\x{10fff}]') == #character) ? #character |\n\t\t\t\t\t\t'\\\\' + (#escapes->(Contains: #character) ? #escapes->(Find: #character) | 'u' + String(Encode_Hex(#character))->PadLeading(4, '0')&)\n\t\t\t\t);\n\t\t\t/Loop;\n\t\t\t#output += '\"';\n\t\tElse: (#value->(IsA: 'integer')) || (#value->(IsA: 'decimal')) || (#value->(IsA: 'boolean'));\n\t\t\t#output += (String: #value);\n\t\tElse: (#value->(IsA: 'null'));\n\t\t\t#output += 'null';\n\t\tElse: (#value->(IsA: 'date'));\n\t\t\tIf: #value->gmt;\n\t\t\t\t#output += '\"' + #value->(format: '%QT%TZ') + '\"';\n\t\t\tElse;\n\t\t\t\t#output += '\"' + #value->(format: '%QT%T') + '\"';\n\t\t\t/If;\n\t\tElse: (#value->(IsA: 'array'));\n\t\t\t#output += '[';\n\t\t\tIterate: #value, (Local: 'temp');\n\t\t\t\t#output += (Encode_JSON: #temp, -Options=#newoptions);\n\t\t\t\tIf: #value->Size != Loop_Count;\n\t\t\t\t\t#output += ', ';\n\t\t\t\t/If;\n\t\t\t/Iterate;\n\t\t\t#output += ']';\n\t\tElse: (#value->(IsA: 'object'));\n\t\t\t#output += '{';\n\t\t\tIterate: #value, (Local: 'temp');\n\t\t\t\t#output += #temp->First + ': ' + (Encode_JSON: #temp->Second, -Options=#newoptions);\n\t\t\t\tIf: (#value->Size != Loop_Count);\n\t\t\t\t\t#output += ', ';\n\t\t\t\t/If;\n\t\t\t/Iterate;\n\t\t\t#output += '}';\n\t\tElse: (#value->(IsA: 'map'));\n\t\t\t#output += '{';\n\t\t\tIterate: #value, (Local: 'temp');\n\t\t\t\t#output += (Encode_JSON: #temp->First, -Options=#newoptions) + ': ' + (Encode_JSON: #temp->Second, -Options=#newoptions);\n\t\t\t\tIf: (#value->Size != Loop_Count);\n\t\t\t\t\t#output += ', ';\n\t\t\t\t/If;\n\t\t\t/Iterate;\n\t\t\t#output += '}';\n\t\tElse: (#value->(IsA: 'client_ip')) || (#value->(IsA: 'client_address'));\n\t\t\t#output += (Encode_JSON: (String: #value), -Options=#newoptions);\n\t\tElse: (#options !>> -UseNative) && (#value->(IsA: 'set')) || (#value->(IsA: 'list')) || (#value->(IsA: 'queue')) || (#value->(IsA: 'priorityqueue')) || (#value->(IsA: 'stack'));\n\t\t\t#output += (Encode_JSON: Array->(insertfrom: #value->iterator) &, -Options=#newoptions);\n\t\tElse: (#options !>> -NoNative);\n\t\t\t#output += (Encode_JSON: (Map: '__jsonclass__'=(Array:'deserialize',(Array:'' + #value->Serialize + ''))));\n\t\t/If;\n\t\tReturn: @#output;\n\t\t\n\t/Define_Tag;\n\n/If;\n\nIf: (Lasso_TagExists: 'Decode_JSON') == False;\n\n\tDefine_Tag: 'JSON', -Namespace='Decode_', -Required='value';\n\n\t\t(#value == '') ? Return: Null;\n\t\t\n\t\tDefine_Tag: 'consume_string', -Required='ibytes';\n\t\t\tLocal: 'unescapes' = (map: 34 = '\"', 92 = '\\\\', 98 = '\\b', 102 = '\\f', 110 = '\\n', 114 = '\\r', 116 = '\\t');\n\t\t\tLocal: 'temp' = 0, 'obytes' = Bytes;\n\t\t\tWhile: ((#temp := #ibytes->export8bits) != 34); // '\"'\n\t\t\t\tIf: (#temp === 92); // '\\'\n\t\t\t\t\t#temp = #ibytes->export8bits;\n\t\t\t\t\tIf: (#temp === 117); // 'u'\n\t\t\t\t\t\t#obytes->(ImportString: (Decode_Hex: (String: #ibytes->(GetRange: #ibytes->Position + 1, 4)))->(ExportString: 'UTF-16'), 'UTF-8');\n\t\t\t\t\t\t#ibytes->(SetPosition: #ibytes->Position + 4);\n\t\t\t\t\tElse;\n\t\t\t\t\t\tIf: (#unescapes->(Contains: #temp));\n\t\t\t\t\t\t\t#obytes->(ImportString: #unescapes->(Find: #temp), 'UTF-8');\n\t\t\t\t\t\tElse;\n\t\t\t\t\t\t\t#obytes->(Import8Bits: #temp);\n\t\t\t\t\t\t/If;\n\t\t\t\t\t/If;\n\t\t\t\tElse;\n\t\t\t\t\t#obytes->(Import8Bits: #temp);\n\t\t\t\t/If;\n\t\t\t/While;\n\t\t\tLocal('output' = #obytes->(ExportString: 'UTF-8'));\n\t\t\tIf: #output->(BeginsWith: '') && #output->(EndsWith: '');\n\t\t\t\tLocal: 'temp' = #output - '' - '';\n\t\t\t\tLocal: 'output' = null;\n\t\t\t\tProtect;\n\t\t\t\t\t#output->(Deserialize: #temp);\n\t\t\t\t/Protect;\n\t\t\tElse: (Valid_Date: #output, -Format='%QT%TZ');\n\t\t\t\tLocal: 'output' = (Date: #output, -Format='%QT%TZ');\n\t\t\tElse: (Valid_Date: #output, -Format='%QT%T');\n\t\t\t\tLocal: 'output' = (Date: #output, -Format='%QT%T');\n\t\t\t/If;\t\t\t\n\t\t\tReturn: @#output;\n\t\t/Define_Tag;\n\n\t\tDefine_Tag: 'consume_token', -Required='ibytes', -required='temp';\n\t\t\tLocal: 'obytes' = bytes->(import8bits: #temp) &;\n\t\t\tlocal: 'delimit' = (array: 9, 10, 13, 32, 44, 58, 93, 125); // \\t\\r\\n ,:]}\n\t\t\tWhile: (#delimit !>> (#temp := #ibytes->export8bits));\n\t\t\t\t#obytes->(import8bits: #temp);\n\t\t\t/While;\n\t\t\tLocal: 'output' = (String: #obytes);\n\t\t\tIf: (#output == 'true') || (#output == 'false');\n\t\t\t\tReturn: (Boolean: #output);\n\t\t\tElse: (#output == 'null');\n\t\t\t\tReturn: Null;\n\t\t\tElse: (String_IsNumeric: #output);\n\t\t\t\tReturn: (#output >> '.') ? (Decimal: #output) | (Integer: #output);\n\t\t\t/If;\n\t\t\tReturn: @#output;\n\t\t/Define_Tag;\n\n\t\tDefine_Tag: 'consume_array', -Required='ibytes';\n\t\t\tLocal: 'output' = array;\n\t\t\tlocal: 'delimit' = (array: 9, 10, 13, 32, 44); // \\t\\r\\n ,\n\t\t\tlocal: 'temp' = 0;\n\t\t\tWhile: ((#temp := #ibytes->export8bits) != 93); // ]\n\t\t\t\tIf: (#delimit >> #temp);\n\t\t\t\t\t// Discard whitespace \n\t\t\t\tElse: (#temp == 34); // \"\n\t\t\t\t\t#output->(insert: (consume_string: @#ibytes));\n\t\t\t\tElse: (#temp == 91); // [\n\t\t\t\t\t#output->(insert: (consume_array: @#ibytes));\n\t\t\t\tElse: (#temp == 123); // {\n\t\t\t\t\t#output->(insert: (consume_object: @#ibytes));\n\t\t\t\tElse;\n\t\t\t\t\t#output->(insert: (consume_token: @#ibytes, @#temp));\n\t\t\t\t\t(#temp == 93) ? Loop_Abort;\n\t\t\t\t/If;\n\t\t\t/While;\n\t\t\tReturn: @#output;\n\t\t/Define_Tag;\n\n\t\tDefine_Tag: 'consume_object', -Required='ibytes';\n\t\t\tLocal: 'output' = map;\n\t\t\tlocal: 'delimit' = (array: 9, 10, 13, 32, 44); // \\t\\r\\n ,\n\t\t\tlocal: 'temp' = 0;\n\t\t\tlocal: 'key' = null;\n\t\t\tlocal: 'val' = null;\n\t\t\tWhile: ((#temp := #ibytes->export8bits) != 125); // }\n\t\t\t\tIf: (#delimit >> #temp);\n\t\t\t\t\t// Discard whitespace \n\t\t\t\tElse: (#key !== null) && (#temp == 34); // \"\n\t\t\t\t\t#output->(insert: #key = (consume_string: @#ibytes));\n\t\t\t\t\t#key = null;\n\t\t\t\tElse: (#key !== null) && (#temp == 91); // [\n\t\t\t\t\t#output->(insert: #key = (consume_array: @#ibytes));\n\t\t\t\t\t#key = null;\n\t\t\t\tElse: (#key !== null) && (#temp == 123); // {\n\t\t\t\t\t#output->(insert: #key = (consume_object: @#ibytes));\n\t\t\t\t\t#key = null;\n\t\t\t\tElse: (#key !== null);\n\t\t\t\t\t#output->(insert: #key = (consume_token: @#ibytes, @#temp));\n\t\t\t\t\t(#temp == 125) ? Loop_abort;\n\t\t\t\t\t#key = null;\n\t\t\t\tElse;\n\t\t\t\t\t#key = (consume_string: @#ibytes);\n \t\t\t\t while(#delimit >> (#temp := #ibytes->export8bits));\n\t\t\t\t\t/while;\n \t\t\t\t\t#temp != 58 ? Loop_Abort;\n\t\t\t\t/If;\n\t\t\t/While;\n\t\t\tIf: (#output >> '__jsonclass__') && (#output->(Find: '__jsonclass__')->(isa: 'array')) && (#output->(Find: '__jsonclass__')->size >= 2) && (#output->(Find: '__jsonclass__')->First == 'deserialize');\n\t\t\t\tReturn: #output->(find: '__jsonclass__')->Second->First;\n\t\t\tElse: (#output >> 'native') && (#output >> 'comment') && (#output->(find: 'comment') == 'http://www.lassosoft.com/json');\n\t\t\t\tReturn: #output->(find: 'native');\n\t\t\t/If;\n\t\t\tReturn: @#output;\n\t\t/Define_Tag;\n\t\t\n\t\tLocal: 'ibytes' = (bytes: #value);\n\t\tLocal: 'start' = 1;\n \t \t#ibytes->removeLeading(BOM_UTF8);\n\t\tLocal: 'temp' = #ibytes->export8bits;\n\t\tIf: (#temp == 91); // [\n\t\t\tLocal: 'output' = (consume_array: @#ibytes);\n\t\t\tReturn: @#output;\n\t\tElse: (#temp == 123); // {\n\t\t\tLocal: 'output' = (consume_object: @#ibytes);\n\t\t\tReturn: @#output;\n\t\t/If;\n\t\t\n\t/Define_Tag;\n\n/If;\n\t\nIf: (Lasso_TagExists: 'Literal') == False;\n\n\tDefine_Type: 'Literal', 'String';\n\t/Define_Type;\n\n/If;\n\t\nIf: (Lasso_TagExists: 'Object') == False;\n\t\n\tDefine_Type: 'Object', 'Map';\n\t/Define_Type;\n\t\n/If;\n\nIf: (Lasso_TagExists: 'JSON_RPCCall') == False;\n\t\n\tDefine_Tag: 'RPCCall', -Namespace='JSON_',\n\t\t\t-Required='method',\n\t\t\t-Optional='params',\n\t\t\t-Optional='id',\n\t\t\t-Optional='host';\n\n\t\t!(Local_Defined: 'host') ? Local: 'host' = 'http://localhost/lassoapps.8/rpc/rpc.lasso';\n\t\t!(Local_Defined: 'id') ? Local: 'id' = Lasso_UniqueID;\n\t\tLocal: 'request' = (Map: 'method' = #method, 'params' = #params, 'id' = #id);\n\t\tLocal: 'request' = (Encode_JSON: #request);\n\t\tLocal: 'result' = (Include_URL: #host, -PostParams=#request);\n\t\tLocal: 'result' = (Decode_JSON: #result);\n\t\tReturn: @#result;\n\n\t/Define_Tag;\n\t\n/If;\n\nIf: (Lasso_TagExists: 'JSON_Records') == False;\n\n\tDefine_Tag: 'JSON_Records',\n\t\t\t-Optional='KeyField',\n\t\t\t-Optional='ReturnField',\n\t\t\t-Optional='ExcludeField',\n\t\t\t-Optional='Fields';\n\n\t\tLocal: '_fields' = (Local_Defined: 'fields') && #fields->(IsA: 'array') ? #fields | Field_Names;\n\t\tFail_If: #_fields->size == 0, -1, 'No fields found for [JSON_Records]';\n\t\tLocal: '_keyfield' = (Local: 'keyfield');\n\t\tIf: #_fields !>> #_keyfield;\n\t\t\tLocal: '_keyfield' = (KeyField_Name);\n\t\t\tIf: #_fields !>> #_keyfield;\n\t\t\t\tLocal: '_keyfield' = 'ID';\n\t\t\t\tIf: #_fields !>> #_keyfield;\n\t\t\t\t\tLocal: '_keyfield' = #_fields->First;\n\t\t\t\t/If;\n\t\t\t/If;\n\t\t/If;\n\t\tLocal: '_index' = #_fields->(FindPosition: #_keyfield)->First;\n\t\tLocal: '_return' = (Local_Defined: 'returnfield') ? (Params->(Find: -ReturnField)->(ForEach: {Params->First = Params->First->Second; Return: True}) &) | @#_fields;\n\t\tLocal: '_exclude' = (Local_Defined: 'excludefield') ? (Params->(Find: -ExcludeField)->(ForEach: {Params->First = Params->First->Second; Return: True}) &) | Array;\n\t\tLocal: '_records' = Array;\n\t\tIterate: Records_Array, (Local: '_record');\n\t\t\tLocal: '_temp' = Map;\n\t\t\tIterate: #_fields, (Local: '_field');\n\t\t\t\t((#_return >> #_field) && (#_exclude !>> #_field)) ? #_temp->Insert(#_field = #_record->(Get: Loop_Count));\n\t\t\t/Iterate;\n\t\t\t#_records->Insert(#_temp);\n\t\t/Iterate;\n\t\tLocal: '_output' = (Encode_JSON: (Object: 'error_msg'=Error_Msg, 'error_code'=Error_Code, 'found_count'=Found_Count, 'keyfield'=#_keyfield, 'rows'=#_records));\n\t\tReturn: @#_output;\n\n\t/Define_Tag;\n\n/If;\n\n?>\n" }, { "path": "src/test/resources/samples/langs/Lasso/json.lasso9", "content": "\n/**\n\ttrait_json_serialize\n\tObjects with this trait will be assumed to convert to json data\n\twhen its ->asString method is called\n*/\ndefine trait_json_serialize => trait {\n\trequire asString()\n}\n\ndefine json_serialize(e::bytes)::string => ('\"' + (string(#e)->Replace(`\\`, `\\\\`) & Replace('\\\"', '\\\\\"') & Replace('\\r', '\\\\r') & Replace('\\n', '\\\\n') & Replace('\\t', '\\\\t') & Replace('\\f', '\\\\f') & Replace('\\b', '\\\\b') &) + '\"')\ndefine json_serialize(e::string)::string => ('\"' + (string(#e)->Replace(`\\`, `\\\\`) & Replace('\\\"', '\\\\\"') & Replace('\\r', '\\\\r') & Replace('\\n', '\\\\n') & Replace('\\t', '\\\\t') & Replace('\\f', '\\\\f') & Replace('\\b', '\\\\b') &) + '\"')\ndefine json_serialize(e::json_literal)::string => (#e->asstring)\ndefine json_serialize(e::integer)::string => (#e->asstring)\ndefine json_serialize(e::decimal)::string => (#e->asstring)\ndefine json_serialize(e::boolean)::string => (#e->asstring)\ndefine json_serialize(e::null)::string => ('null')\ndefine json_serialize(e::date)::string => ('\"' + #e->format(#e->gmt ? '%QT%TZ' | '%Q%T') + '\"')\n/*\ndefine json_serialize(e::array)::string => {\n\tlocal(output) = '';\n\tlocal(delimit) = '';\n\t#e->foreach => { #output += #delimit + json_serialize(#1); #delimit = ', '; }\n\treturn('[' + #output + ']');\n}\ndefine json_serialize(e::staticarray)::string => {\n\tlocal(output) = '';\n\tlocal(delimit) = '';\n\t#e->foreach => { #output += #delimit + json_serialize(#1); #delimit = ', '; }\n\treturn('[' + #output + ']');\n}\n*/\ndefine json_serialize(e::trait_forEach)::string => {\n\tlocal(output) = '';\n\tlocal(delimit) = '';\n\t#e->foreach => { #output += #delimit + json_serialize(#1); #delimit = ', '; }\n\treturn('[' + #output + ']');\n}\ndefine json_serialize(e::map)::string => {\n\tlocal(output = with pr in #e->eachPair \n\t\t\t\t\tselect json_serialize(#pr->first->asString) + ': ' + json_serialize(#pr->second))\n\treturn '{' + #output->join(',') + '}'\n}\ndefine json_serialize(e::json_object)::string => {\n\tlocal(output) = '';\n\tlocal(delimit) = '';\n\t#e->foreachpair => { #output += #delimit + #1->first + ': ' + json_serialize(#1->second); #delimit = ', '; }\n\treturn('{' + #output + '}');\n}\ndefine json_serialize(e::trait_json_serialize) => #e->asString\ndefine json_serialize(e::any)::string => json_serialize('' + #e->serialize + '')\n\n// Bil Corry fixes for decoding json\ndefine json_consume_string(ibytes::bytes) => {\n\tlocal(obytes) = bytes;\n\tlocal(temp) = 0;\n\twhile((#temp := #ibytes->export8bits) != 34);\n\t\t#obytes->import8bits(#temp);\n\t\t(#temp == 92) ? #obytes->import8bits(#ibytes->export8bits); // Escape \\\n \t/while;\n\tlocal(output = string(#obytes)->unescape)\n\t//Replace('\\\\\"', '\\\"') & Replace('\\\\r', '\\r') & Replace('\\\\n', '\\n') & Replace('\\\\t', '\\t') & Replace('\\\\f', '\\f') & Replace('\\\\b', '\\b') &;\n\tif(#output->BeginsWith('') && #output->EndsWith(''));\n\t\tProtect;\n\t\t\treturn serialization_reader(xml(#output - '' - ''))->read\n\t\t/Protect;\n\telse( (#output->size == 16 or #output->size == 15) and regexp(`\\d{8}T\\d{6}Z?`, '', #output)->matches)\n\t\treturn date(#output, -Format=#output->size == 16?`yyyyMMdd'T'HHmmssZ`|`yyyyMMdd'T'HHmmss`)\n\t/if\n\treturn #output\n}\n\n// Bil Corry fix + Ke fix\ndefine json_consume_token(ibytes::bytes, temp::integer) => {\n\n\tlocal(obytes = bytes->import8bits(#temp) &,\n\t\tdelimit = array(9, 10, 13, 32, 44, 58, 93, 125)) // \\t\\r\\n ,:]}\n\n\twhile(#delimit !>> (#temp := #ibytes->export8bits))\n\t\t#obytes->import8bits(#temp)\n\t/while\n\n\t#temp == 125? // }\n\t\t#ibytes->marker -= 1\n//============================================================================\n//\tIs also end of token if end of array[]\n\t#temp == 93? // ]\n\t\t#ibytes->marker -= 1\n//............................................................................\t\t\n\n\tlocal(output = string(#obytes))\n\t#output == 'true'?\n\t\treturn true\n\t#output == 'false'?\n\t\treturn false\n\t#output == 'null'?\n\t\treturn null\n\tstring_IsNumeric(#output)?\n\treturn (#output >> '.')? decimal(#output) | integer(#output)\n\n\treturn #output\n}\n\n// Bil Corry fix\ndefine json_consume_array(ibytes::bytes)::array => {\n\tLocal(output) = array;\n\tlocal(delimit) = array( 9, 10, 13, 32, 44); // \\t\\r\\n ,\n\tlocal(temp) = 0;\n\tWhile((#temp := #ibytes->export8bits) != 93); // ]\n\t\tIf(#delimit >> #temp);\n\t\t\t// Discard whitespace\n\t\tElse(#temp == 34); // \"\n\t\t\t#output->insert(json_consume_string(#ibytes));\n\t\tElse(#temp == 91); // [\n\t\t\t#output->insert(json_consume_array(#ibytes));\n\t\tElse(#temp == 123); // {\n\t\t\t#output->insert(json_consume_object(#ibytes));\n\t\tElse;\n\t\t\t#output->insert(json_consume_token(#ibytes, #temp));\n\t\t\t(#temp == 93) ? Loop_Abort;\n\t\t/If;\n\t/While;\n\tReturn(#output);\n}\n\n// Bil Corry fix\ndefine json_consume_object(ibytes::bytes)::map => {\n\tLocal('output' = map,\n\t\t'delimit' = array( 9, 10, 13, 32, 44), // \\t\\r\\n ,\n\t\t'temp' = 0,\n\t\t'key' = null,\n\t\t'val' = null);\n\tWhile((#temp := #ibytes->export8bits) != 125); // }\n\t\tIf(#delimit >> #temp);\n\t\t\t// Discard whitespace\n\t\tElse((#key !== null) && (#temp == 34)); // \"\n\t\t\t#output->insert(#key = json_consume_string(#ibytes));\n\t\t\t#key = null;\n\t\tElse((#key !== null) && (#temp == 91)); // [\n\t\t\t#output->insert(#key = json_consume_array(#ibytes));\n\t\t\t#key = null;\n\t\tElse((#key !== null) && (#temp == 123)); // {\n\t\t\t#output->insert(#key = json_consume_object(#ibytes));\n\t\t\t#key = null;\n\t\tElse((#key !== null));\n\t\t\t#output->insert(#key = json_consume_token(#ibytes, #temp));\n\t\t\t#key = null;\n\t\tElse;\n\t\t\t#key = json_consume_string(#ibytes);\n\t\t\twhile(#delimit >> (#temp := #ibytes->export8bits));\n\t\t\t/while;\n\t\t\t#temp != 58 ? Loop_Abort;\n\t\t/If;\n\t/While;\n\n\tIf((#output >> '__jsonclass__') && (#output->Find('__jsonclass__')->isa('array')) && (#output->Find('__jsonclass__')->size >= 2) && (#output->Find('__jsonclass__')->First == 'deserialize'));\n\t\tReturn(#output->find('__jsonclass__')->Second->First);\n\tElse((#output >> 'native') && (#output >> 'comment') && (#output->find('comment') == 'http://www.lassosoft.com/json'));\n\t\tReturn(#output->find('native'));\n\t/If;\n\tReturn(#output);\n}\n\n// Bil Corry fix + Ke fix\ndefine json_deserialize(ibytes::bytes)::any => {\n\t#ibytes->removeLeading(bom_utf8);\n\n//============================================================================\n//\tReset marker on provided bytes\n\t#ibytes->marker = 0\n//............................................................................\t\t\n\t\n\tLocal(temp) = #ibytes->export8bits;\n\tIf(#temp == 91); // [\n\t\tReturn(json_consume_array(#ibytes));\n\tElse(#temp == 123); // {\n\t\tReturn(json_consume_object(#ibytes));\n\telse(#temp == 34) // \"\n\t\treturn json_consume_string(#ibytes)\n\t/If;\n}\n\ndefine json_deserialize(s::string) => json_deserialize(bytes(#s))\n\n/**! json_literal - This is a subclass of String used for JSON encoding.\n\n\tA json_literal works exactly like a string, but will be inserted directly\n\trather than being encoded into JSON. This allows JavaScript elements\n\tlike functions to be inserted into JSON objects. This is most useful\n\twhen the JSON object will be used within a JavaScript on the local page.\n\t[Map: 'fn'=Literal('function(){ ...})] => {'fn': function(){ ...}}\n**/\ndefine json_literal => type {\n\tparent string\n}\n\n/**! json_object - This is a subclass of Map used for JSON encoding.\n\n\tAn object works exactly like a map, but when it is encoded into JSON all\n\tof the keys will be inserted literally. This makes it easy to create a\n\tJavaScript object without extraneous quote marks.\n\tObject('name'='value') => {name: \"value\"}\n**/\ndefine json_object => type {\n\tparent map\n\tpublic onCreate(...) => ..onCreate(:#rest or (:))\n}\n\ndefine json_rpccall(method::string, params=map, id='', host='') => {\n\t#id == '' ? #host = Lasso_UniqueID;\n\t#host == '' ? #host = 'http://localhost/lassoapps.8/rpc/rpc.lasso';\n\tReturn(Decode_JSON(Include_URL(#host, -PostParams=Encode_JSON(Map('method' = #method, 'params' = #params, 'id' = #id)))));\n}\n" }, { "path": "src/test/resources/samples/langs/Lasso/knop.las", "content": "[/* \n\n\tOn-Demand library for namespace knop\n\tNamespace file built date 2012-06-10 02:05:30 by http://knop8/buildnamespace.lasso\n\tMontania System AB\n\n*/]\n\n[\n//------------------------------------------------------------------\n// Begin knop custom tags in util.inc\n//------------------------------------------------------------------\n\n] split('`') -> first;\n\treturn(@#output);\n/define_tag;\n\ndefine_tag: 'unique', -description='Returns a very unique but still rather short random string',\n\t-namespace='knop_',\n\t-priority='replace';\n\n\t// Johan Sölve 2006-09-20 \n\t\n\tlocal: 'output'=string,\n\t\t'seed'=integer,\n\t\t'charlist'='abcdefghijklmnopqrstuvwxyz0123456789';\n\tlocal: 'base'=(#charlist -> size);\n\t// start with the current date and time in a mixed up format as seed\n\t#seed = integer: (date -> (format: '%S%y%m%d%H%M'));\n\t// convert this integer to a string using base conversion\n\twhile: #seed>0;\n\t\t#output = #charlist -> (get: (#seed % #base)+1) + #output;\n\t\t#seed = #seed / #base;\n\t/while;\n\t// start over with a new chunk as seed\n\t#seed = string: 1000+(date->millisecond);\n\t#seed = #seed + string: (math_random: -lower=1000, -upper=9999);\n\t#seed = integer: #seed;\n\t// convert this integer to a string using base conversion\n\twhile: #seed>0;\n\t\t#output = #charlist -> (get: (#seed % #base)+1) + #output;\n\t\t#seed = #seed / #base;\n\t/while;\n\treturn: #output;\n/define_tag;\n\n\ndefine_tag: 'seed', \n\t-namespace='knop_',\n\t-priority='replace';\n\t\n\tlocal: 'seed'= (string: $__lassoservice_ip__) + response_localpath;\n\t#seed -> removetrailing(response_filepath);\n\treturn:\t #seed;\n/define_tag;\n\ndefine_tag: 'foundrows', // http://tagswap.net/found_rows\n\t-namespace='knop_',\n\t-priority='replace';\n\tlocal: 'sql'= action_statement;\n\tif: (string_findregexp: #sql, -find= '\\\\sLIMIT\\\\s', -ignorecase) -> size == 0;\n\t\t// || found_count < maxrecords_value; (this condition is inaccurate)\n\t\t// found_count must be accurate\n\t\treturn: found_count;\n\t/if;\n\tif: (string_findregexp: #sql, -find= '\\\\s(GROUP\\\\s+BY|HAVING)\\\\s', -ignorecase) -> size == 0;\n\t\t// Default method, usually the fastest. Can not be used with GROUP BY for example. \n\t\t// First normalize whitespace around FROM in the expression\n\t\t#sql = (string_replaceregexp: #sql, -find= '\\\\sFROM\\\\s', -replace=' FROM ', -ignorecase, -ReplaceOnlyOne);\n\t\t#sql = 'SELECT COUNT(*) AS found_rows ' + #sql -> (substring: (#sql -> (find: ' FROM ')) + 1) ;\n\t\t#sql = (string_replaceregexp: #sql, -find='\\\\sLIMIT\\\\s+[0-9,]+', -replace='');\n\t\tif: (string_findregexp: #sql, -find= '\\\\sORDER\\\\s+BY\\\\s', -ignorecase) -> size;\n\t\t\t// remove ORDER BY statement since it causes problems with field aliases\n\t\t\t// first normalize the expression so we can find it with simple string expression later\n\t\t\t#sql = (string_replaceregexp: #sql, -find= '\\\\sORDER\\\\s+BY\\\\s', -replace=' ORDER BY ', -ignorecase);\n\t\t\t#sql = #sql -> (substring: 1, (#sql -> (find: ' ORDER BY ')) -1);\n\t\t/if;\n\telse; // query contains GROUP BY so use SQL_CALC_FOUND_ROWS which can be much slower, see http://bugs.mysql.com/bug.php?id=18454\n\t\t#sql -> (removeleading: 'SELECT');\n\t\t#sql = 'SELECT SQL_CALC_FOUND_ROWS ' + #sql + ';SELECT FOUND_ROWS() AS found_rows';\n\t\t#sql = (string_replaceregexp: #sql, -find='\\\\sLIMIT\\\\s+[0-9,]+', -replace=' LIMIT 1', -ignorecase);\n\t/if;\n\tinline: -sql=#sql;\n\t\tif: (field: 'found_rows') > 0;\n\t\t\treturn: integer: (field: 'found_rows'); // exit here normally\n\t\t/if;\n\t/inline;\n\t// fallback\n\treturn: found_count;\n/define_tag;\t\n\ndefine_tag:'IDcrypt', -description='Encrypts or Decrypts integer values',\n\t-namespace='knop_',\n\t-required='value',\n\t-optional='seed',\n\t-priority='replace';\n/*\n\n[IDcrypt]\nEncrypts or Decrypts integer values\n\nAuthor: Pier Kuipers\nLast Modified: Jan. 29, 2007\nLicense: Public Domain\n\nDescription:\nThis tag was written to deal with \"scraping\" attacks where bots keep \nrequesting the same page with incremental id parameters, corresponding to \nmysql id columns. Rather than introducing a new column with a unique id, this \ntag will \"intelligently\" blowfish encrypt or decrypt existing id values.\n\n\nSample Usage:\n[local('myID' = (action_param('id')))]\n[IDcrypt(#myID)]\n\n[IDcrypt('35446')] -> j4b50f315238d68df\n\n[IDcrypt('j4b50f315238d68df')] -> 35446\n\n\n\nDownloaded from tagSwap.net on Feb. 07, 2007.\nLatest version available from .\n\n*/\n// if id values need to be retrieved from bookmarked urls, the tag's built-in seed value must be used,\n// or the seed value used must be guaranteed to be the same as when the value was encrypted!\t\t\n\n\tlocal('cryptvalue' = string);\n\t!local_defined('seed') ? local('seed' = knop_seed);\n\tLocal('RandChars' = 'AaBbCcDdEeFfGgHhiJjKkLmNnoPpQqRrSsTtUuVvWwXxYyZz');\n\tLocal('anyChar' = (#RandChars -> (Get:(Math_Random: -Min=1, -Max=(#RandChars->Size)))));\n// taken from Bil Corry's [lp_string_getNumeric]\n\tlocal('numericValue' = (string_findregexp((string: #value), -find='\\\\d')->(join:'')));\n\t\n\tif(\n\t\t(#numericValue == (integer(#value))) \n\t\t&& \n\t\t(((string(#value))->length) == ((string(#numericValue)) -> length))\n\t);\n// alpha character is inserted at beginning of encrypted string in case value needs to be\n// cast to a javascript variable, which cannot start with a number\t\t\n\t\t#cryptvalue = (#anyChar + (Encrypt_Blowfish(#value, -seed=#seed)));\n\telse(\n\t\t((((string(#value))->length) - 1) % 2 == 0)\n\t\t&&\n\t\t(((string(#value))->length) > 16)\n\t);\n\t\t#cryptvalue = (decrypt_blowfish((String_Remove: #value, -StartPosition=1, -EndPosition=1),-Seed=#seed));\n\telse;\n\t\t#cryptvalue = 0;\n\t/if;\n\t\n\tif(String_IsAlphaNumeric(#cryptvalue));\n\t\treturn(#cryptvalue);\n\telse;\n// successfully decrypted values resulting in lots of strange characters are probably\n// the result of someone guessing a value\t\t\n\t\treturn(0);\n\t/if;\n\n/define_tag;\n\n\n\ndefine_type: 'timer', -description='Utility type to provide a simple timer',\n\t-namespace='knop_';\n\t/*\n\t\n\tCHANGE NOTES\n\t2007-06-17\tJS\tCreated the type\n\t\n\t*/\n\n\tlocal: 't'=integer;\n\tdefine_tag: 'oncreate';\n\t\t(self -> 't') = _date_msec;\n\t/define_tag;\n\tdefine_tag: 'onconvert';\n\t\treturn: _date_msec - (self -> 't');\n\t/define_tag;\n\t\n/define_type;\n\ndefine_tag: 'cachestore', -description='Stores all instances of page variables of the specified type in a cache object. Caches are stored \\\n\t\tin a global variable named by host name and document root to isolate the storage of different hosts. \\n\\\n\t\tParameters:\\n\\\n\t\t-type (required string) Page variables of the specified type will be stored in cache. Data types can be specified with or without namespace.\\n\\\n\t\t-expires (optional integer) The number of seconds that the cached data should be valid. Defaults to 600 (10 minutes)\\n\\\n\t\t-session (optional string) The name of an existing session to use for cache storage instead of the global storage\\n\\\n\t\t-name (optional string) Extra name parameter to be able to isolate the cache storage from other sites on the same virtual hosts, or caches for different uses. ',\n\t-namespace='knop_',\n\t-required='type', -type='string',\n\t-optional='expires', -type='integer', // seconds\n\t-optional='session', -type='string',\n\t-optional='name', -type='string';\n\n\tlocal: 'data'=map;\n\t!(local_defined: 'expires') ? local: 'expires'=600; // default seconds\n\t// store all page vars of the specified type\n\titerate: vars -> keys, local: 'item';\n\t\tif: (var: #item) -> isa(#type);\n\t\t\t#data -> insert(#item = (var: #item));\n\t\t/if;\n\t/iterate;\n\tif: (local_defined: 'session');\n\t\t//fail_if: (session_id: -name=#session) -> size == 0, -1, 'Cachestore with -session requires that the specified session is started';\n\t\tlocal: 'cache_name' = '_knop_cache_' + (local: 'name');\n\t\tsession_addvar: -name=#session, #cache_name;\n\t\t!((var: #cache_name) -> isa('map')) ? var: #cache_name = map;\n\t\t(var: #cache_name) -> insert(#type = (map: \n\t\t\t'content'=#data, \n\t\t\t'timestamp'=date, \n\t\t\t'expires'=(date + (duration: -second=#expires))));\n\telse;\n\t\tlocal: 'cache_name'='knop_' + (local: 'name') + '_' + server_name + response_localpath;\n\t\t#cache_name -> removetrailing(response_filepath);\n\t\t// initiate thread RW lock\n\t\t!(global: 'rwlock_' + #cache_name) -> isa('rwlock') ? global: 'rwlock_' + #cache_name=Thread_RWLock;\n\t\t// create a reference to the lock\n\t\tlocal: 'lock'=@(global: 'rwlock_' + #cache_name);\n\t\t// lock for writing\n\t\t#lock -> writelock;\n\t\t// check and initiate the cache storage\n\t\t!((global: #cache_name) -> isa('map')) ? global: #cache_name = map;\n\t\t(global: #cache_name) -> insert(#type = (map: \n\t\t\t'content'=#data, \n\t\t\t'timestamp'=date, \n\t\t\t'expires'=(date + (duration: -second=#expires))));\n\t\t// unlock\n\t\t#lock -> writeunlock;\n\t/if;\n/define_tag;\n\ndefine_tag: 'cachefetch', -description='Recreates page variables from previously cached instances of the specified type, returns true if successful or false if there was no valid \\\n\t\texisting cache for the specified type. Caches are stored in a global variable named by host name and document root to isolate the storage of different hosts. \\n\\\n\t\tParameters:\\n\\\n\t\t-type (required string) Page variables of the specified type will be stored in cache. \\n\\\n\t\t-session (optional string) The name of an existing session to use for cache storage instead of the global storage\\n\\\n\t\t-name (optional string) Extra name parameter to be able to isolate the cache storage from other sites on the same virtual hosts. \\n\\\n\t\t-maxage (optional date) Cache data older than the date/time specified in -maxage will not be used.',\n\t-namespace='knop_',\n\t-required='type', -type='string',\n\t-optional='session', -type='string',\n\t-optional='name', -type='string',\n\t-optional='maxage', -type='date';\n\t\n\t\n\tlocal: 'data'=null;\n\tif: (local_defined: 'session');\n\t\t//fail_if: (session_id: -name=#session) -> size == 0, -1, 'Cachefetch with -session requires that the specified session is started';\n\t\tlocal: 'cache_name' = '_knop_cache_' + (local: 'name');\n\t\tif: (var: #cache_name) -> isa('map') \n\t\t\t&& (var: #cache_name) >> #type \n\t\t\t&& (var: #cache_name) -> find(#type) -> find('expires') > date;\n\t\t\tif(local_defined('maxage') \n\t\t\t\t&& var(#cache_name) -> find(#type) -> find('timestamp') < #maxage);\n\t\t\t\t// cached data too old\n\t\t\telse;\n\t\t\t\t#data = (var: #cache_name) -> find(#type) -> find('content');\n\t\t\t/if;\n\t\t/if;\n\telse;\n\t\tlocal: 'cache_name'='knop_' + (local: 'name') + '_' + server_name + response_localpath;\n\t\t#cache_name -> removetrailing(response_filepath);\n\t\t// initiate thread RW lock\n\t\t!(global: 'rwlock_' + #cache_name) -> isa('rwlock') ? global: 'rwlock_' + #cache_name=Thread_RWLock;\n\t\t// create a reference to the lock\n\t\tlocal: 'lock'=@(global: 'rwlock_' + #cache_name);\n\t\t// lock for reading\n\t\t#lock -> readlock;\n\t\tif: (global: #cache_name) -> isa('map') \n\t\t\t&& (global: #cache_name) >> #type \n\t\t\t&& (global: #cache_name) -> find(#type) -> find('expires') > date;\n\t\t\tif(local_defined('maxage') \n\t\t\t\t&& global(#cache_name) -> find(#type) -> find('timestamp') < #maxage);\n\t\t\t\t// cached data too old\n\t\t\telse;\n\t\t\t\t#data = (global: #cache_name) -> find(#type) -> find('content');\n\t\t\t/if;\n\t\t/if;\n\t\t// unlock\n\t\t#lock -> readunlock;\n\t/if;\n\tif: #data -> isa('map');\n\t\titerate: #data, local: 'item';\n\t\t\tvar: (#item -> name) = #item -> value;\n\t\t/iterate;\n\t\treturn: true;\n\telse;\n\t\treturn: false;\n\t/if;\n/define_tag;\n\n\ndefine_tag: 'cachedelete', -description='Deletes the cache for the specified name (and optionally name). \\n\\\n\t\tParameters:\\n\\\n\t\t-type (required string) Page variables of the specified type will be stored in cache. \\n\\\n\t\t-session (optional string) The name of an existing session to use for cache storage instead of the global storage\\n\\\n\t\t-name (optional string) Extra name parameter to be able to isolate the cache storage from other sites on the same virtual hosts. ',\n\t-namespace='knop_',\n\t-required='type', -type='string',\n\t-optional='session', -type='string',\n\t-optional='name', -type='string'; // ignored for session\n\tif: (local_defined: 'session');\n\t\t//fail_if: (session_id: -name=#session) -> size == 0, -1, 'Cachestore with -session requires that the specified session is started';\n\t\tlocal: 'cache_name' = '_knop_cache_' + (local: 'name');\n\t\tsession_addvar: -name=#session, #cache_name;\n\t\t!((var: #cache_name) -> isa('map')) ? var: #cache_name = map;\n\t\t(var: #cache_name) -> remove(#type);\n\telse;\n\t\tlocal: 'cache_name'='knop_' + (local: 'name') + '_' + server_name + response_localpath;\n\t\t#cache_name -> removetrailing(response_filepath);\n\t\t// initiate thread RW lock\n\t\t!(global: 'rwlock_' + #cache_name) -> isa('rwlock') ? global: 'rwlock_' + #cache_name=Thread_RWLock;\n\t\t// create a reference to the lock\n\t\tlocal: 'lock'=@(global: 'rwlock_' + #cache_name);\n\t\t// lock for writing\n\t\t#lock -> writelock;\n\t\t// check and initiate the cache storage\n\t\t!((global: #cache_name) -> isa('map')) ? global: #cache_name = map;\n\t\t(global: #cache_name) -> remove(#type);\n\t\t// unlock\n\t\t#lock -> writeunlock;\n\t/if;\n\n/define_tag;\n\n\n?>\n[\n//------------------------------------------------------------------\n// End knop custom tags in util.inc\n//------------------------------------------------------------------\n\n//##################################################################\n\n][\n//------------------------------------------------------------------\n// Begin knop_base\n//------------------------------------------------------------------\n\n]error_msg: custom error numbers can now be added, even if the language already exists.\n2008-01-10\tJS\t->error_msg: improved reporting of custom error messages such as from bad database queries\n2007-12-13\tJS\tAdded -> error_lang to provide a reference to the knop_lang object for error messages, to be able to add localized error messages to any Knop type (except knop_lang and knop_base)\n2007-12-12\tJS\tAdded -html and -xhtml to ->help to get a nicely formatted output. \n2007-12-11\tJS\tCentralized ->error_code and ->error_msg to knop_base. Moved all error codes to error_msg\n2007-12-06\tJS\tChanged ->help to improve the self-documentation. It will now always return an up to date list of member tags and parameter. \n2007-11-05\tJS\tAdded var name to trace output\n2007-06-17\tJS\tAdded ->tagtime (was in nav earlier)\n2007-06-13\tJS\tAdded -> varname to be able to retreive the name of the page variable that a type instance is stored in.\n2007-06-13\tJS\tAdded -> xhtml to automatically sense if an xhtml doctype exists in the current page buffer. The result is cached in a page variable for performance. \n\t\t\t\tThis is for internal use for member tags that output html. \n2007-06-13\tJS\tIntroduced page variable $_knop_data for general page level storage and caching, common between different knop objects. \n2007-06-13\tJS\tCreated the data type\n\nTODO: ->help: add output option to format for Google Code Wiki\n->xhtml is not working properly when site is run by atbegin handler and explicitly writing to content_body \n\n\n*/\n\n\tlocal: 'debug_trace'=array,\n\t\t'_debug_trace'=array,\n\t\t'instance_unique'=null,\n\t\t'instance_varname'=null,\n\t\t'tagtime'=integer,\t\t\t\t// time for entire tag in ms\n\t\t'tagtime_tagname'=string,\n\t\t'error_code'=0,\n\t\t'error_msg'=string,\n\t\t'error_lang'=null,\t// must be defined as knop_lang in each type instead, to avoid recursion\n\t\t;\n\n\tdefine_tag: 'ondeserialize', -description='Recreates transient variables after coming back from a session';\n\t\tself -> properties -> first -> insert('_debug_trace'=array);\n\t/define_tag;\n\n\tdefine_tag: 'help', -description='Auto generates an overview of all member tags of a type, with all parameters specified for each member tag.', \n\t\t-optional='html',\n\t\t-optional='xhtml';\n\t\tlocal: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');\n\t\tlocal: 'eol'=(local_defined: 'html') || #endslash -> size ? '\\n' | '\\n';\n\n\t\tlocal: 'output'=string,\n\t\t\t'tags'=array,\n\t\t\t'description'=string,\n\t\t\t'parameters'=string;\n\t\t#output += (self -> type) + ' - version ' + (self -> 'version') + '\\n' ;\n\t\t#output += (self -> 'description') + '\\n\\n';\n\t\titerate: (self -> properties -> second) , local: 't';\n\t\t\t#tags -> (insert: #t);\n\t\t/iterate;\n\t\tif: (self -> parent -> type != 'null'); // this doesn't work\n\t\t\titerate: (self -> parent -> properties -> second) , local: 't';\n\t\t\t\t#tags -> (insert: #t);\n\t\t\t/iterate;\n\t\t/if;\n\t\t#tags -> sort;\n\t\titerate: #tags , local: 't';\n\t\t\t#parameters = string;\n\t\t\t#output += '-> ' + (#t -> name);\n\t\t\t#description=(#t -> value -> description);\n\t\t\titerate: (#t -> value -> paraminfo) , local: 'p';\n\t\t\t\tif: #description !>> '-' + (#p -> paramname);\n\t\t\t\t\t#parameters += '-' + (#p -> paramname) + ' (' (#p -> isrequired ? 'required' | 'optional') \n\t\t\t\t\t\t+ (#p -> paramtype != 'null' && #p -> paramtype -> size ? ' ' + (#p -> paramtype)) + ')\\n';\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t\t#output += (#description -> size || #parameters -> size ? '\\n' + #description);\n\t\t\t#output += (#description >> 'Parameters:' ? '\\n');\n\t\t\t#output += (#description !>> 'Parameters:' && #parameters -> size ? '\\nParameters:\\n');\n\t\t\t#output += (#parameters -> size ? #parameters);\n\t\t\t#output -> removetrailing('\\n');\n\t\t\t#output += '\\n\\n';\n\t\t/iterate;\n\t\tif: ((local_defined: 'html') && #html != false) || ((local_defined: 'xhtml') && #xhtml != false);\n\t\t\t#output = encode_html: #output;\n\t\t\t// normalize line breaks and convert to
\n\t\t\t#output -> (replace: '\\r\\n', '\\n') & (replace: '\\r', '\\n') & (replace: '\\n', #eol + '\\n');\n\t\t/if;\n\t\treturn: #output;\n\t/define_tag;\n\n\n\tdefine_tag: 'xhtml', -description='Internal. Finds out if xhtml output should be used. Looks at doctype unless -xhtml is specified \\\n\t\t\tin the params array. The result is cached in a page variable. \\n\\\n\t\t\tLooking at doctype doesn\\'t work when using atbegin driven solutions since content_body isn\\'t filled with the page buffer until the page has already been processed. ',\n\t\t-optional='params';\n\t\tif: (local_defined: 'params') && #params >> '-xhtml';\n\t\t\tlocal: 'xhtmlparam'=#params -> (find: '-xhtml') -> first;\n\t\t\tif: #xhtmlparam -> type == 'pair'; // -xhtml=true / -xhtml=false\n\t\t\t\treturn: boolean: (#xhtmlparam -> value);\n\t\t\telse; // plain -xhtml\n\t\t\t\treturn: true;\n\t\t\t/if;\n\t\t/if;\n\t\tif: (var: '_knop_data') -> type != 'map';\n\t\t\t$_knop_data = map;\n\t\t/if;\n\t\tif: $_knop_data !>> 'doctype_xhtml';\n\t\t\tlocal: 'doctype' = content_body -> (substring: 1, (content_body -> (find: '>')));\n\t\t\t$_knop_data -> (insert: 'doctype_xhtml' = (#doctype >> '> 'xhtml'));\n\t\t/if;\n\t\treturn: $_knop_data -> (find: 'doctype_xhtml');\n\t/define_tag;\n\n\n\tdefine_tag: 'error_lang', -description='Returns a reference to the language object used for error codes, to be able to add localized error messages to any Knop type (except knop_lang and knop_base)';\n\t\treturn: @(self -> 'error_lang');\n\t/define_tag;\n\n\tdefine_tag: 'error_code', -description='Either proprietary error code or standard Lasso error code';\n\t\t\t\treturn: integer: (self -> 'error_code');\n\t/define_tag;\n\n\tdefine_tag: 'error_msg',\n\t\t-optional='error_code', -type='integer', -copy;\n\t\t!(local_defined: 'error_code') ? local: 'error_code'=(self -> error_code);\n\t\tlocal: 'error_lang_custom'=(self -> 'error_lang');\n\t\tlocal: 'error_lang'=(knop_lang: -default='en', -fallback);\n\n\t\tlocal: 'errorcodes'=(map:\n\t\t\t0 = 'No error',\n\t\t\t-1728 = 'No records found', // standard Lasso error code\n\t\t\t\n\t\t\t// database errors 7000\n\t\t\t7001 ='The specified table was not found',\n\t\t\t7002 = 'Keyfield not specified',\n\t\t\t7003 = 'Lockfield not specified',\n\t\t\t7004 = 'User not specified for record lock',\n\t\t\t7005 = 'Either keyvalue or lockvalue must be specified for update or delete',\n\t\t\t7006 = 'Keyfield or keyvalue missing',\n\t\t\t7007 = 'Keyvalue missing',\n\t\t\t7008 = 'Keyvalue not unique',\n\t\t\t7009 = '-sql can not be used with FileMaker',\n\t\t\t7010 = 'Record locked by another user', // see error_data\n\t\t\t7011 = 'Record lock not valid any more',\n\t\t\t7012 = 'Could not set record lock', // see error_data\n\t\t\t7013 = 'Failed to clear record locks', // see error_data\n\t\t\t7016 = 'Add error', // see error_data\n\t\t\t7017 = 'Add failed, duplicate key value',\n\t\t\t7018 = 'Update error', // see error_data\n\t\t\t7019 = 'Delete error', // see error_data\n\t\t\t7020 = 'Keyfield not present in query',\n\t\t\t7021 = 'Lockfield not present in query',\n\t\t\t\n\t\t\t// form errors 7100\n\t\t\t7101 ='Form validation failed',\n\t\t\t7102 = 'Unsupported field type',\n\t\t\t7103 = 'Form->process requires that a database object is defined for the form',\n\t\t\t7104 = 'Copyfield must copy to a different field name',\n\n\t\t\t// grid errors 7200 \n\t\t\t\n\t\t\t// lang errors 7300\n\t\t\t\n\t\t\t// nav errors 7400\n\t\t\t\n\t\t\t// user errors 7500\n\t\t\t7501 = 'Authentication failed',\n\t\t\t7502 = 'Username or password missing',\n\t\t\t7503 = 'Client fingerprint has changed'\n\t\t\t\n\t\t\t);\n\t\t#error_lang -> (addlanguage: -language='en', -strings=@#errorcodes);\n\t\t// add any custom error strings\n\t\titerate(#error_lang_custom -> 'strings', local('custom_language'));\n\t\t\tif(#error_lang -> 'strings' !>> #custom_language -> name);\n\t\t\t\t// add entire language at once\n\t\t\t\t#error_lang -> addlanguage(-language=#custom_language -> name, -strings=#custom_language -> value);\n\t\t\telse;\n\t\t\t\t// add one string at a time\n\t\t\t\titerate(#custom_language -> value, local('custom_string'));\n\t\t\t\t\t#error_lang -> insert(-language=#custom_language -> name, \n\t\t\t\t\t\t-key=#custom_string -> name, \n\t\t\t\t\t\t-value=#custom_string -> value);\n\t\t\t\t/iterate;\n\t\t\t/if;\n\t\t/iterate;\n\t\t\n\t\tif: #errorcodes >> #error_code;\n\t\t\t// return error message defined by this tag\n\t\t\tif: #error_lang -> keys >> #error_code;\n\t\t\t\treturn: #error_lang -> (getstring: #error_code);\n\t\t\telse;\n\t\t\t\treturn: #errorcodes -> (find: #error_code);\n\t\t\t/if;\n\t\telse;\n\t\t\tif: (self -> 'error_msg') != '';\n\t\t\t\t// return literal error message\n\t\t\t\treturn: (self -> 'error_msg');\n\t\t\telse;\n\t\t\t\t// test for error known by lasso\n\t\t\t\terror_code = #error_code;\n\t\t\t\t// return Lasso error message\n\t\t\t\treturn: error_msg;\n\t\t\t/if;\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'varname', -description='Returns the name of the variable that this type instance is stored in.';\n\t\tlocal: 'timer'=knop_timer;\n\t\tif: self -> 'instance_unique' == null;\n\t\t\tself -> 'instance_unique' = knop_unique;\n\t\t/if;\n\t\tif: self -> 'instance_varname' == null;\n\t\t\t// look for the var name and store it in instance variable\n\t\t\titerate: (vars -> keys), (local: 'varname');\n\t\t\t\tif: (var: #varname) -> type == self -> type \n\t\t\t\t\t&& ((var: #varname) -> 'instance_unique') == (self -> 'instance_unique');\n\t\t\t\t\t(self -> 'instance_varname')=#varname;\n\t\t\t\t\tloop_abort;\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t/if;\n\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer;\n\t\treturn: self -> 'instance_varname';\n\t/define_tag;\n\n\tdefine_tag: 'trace', -description='Returns the debug trace for a type instance',\n\t\t-optional='html',\n\t\t-optional='xhtml';\n\n\t\tlocal: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');\n\t\tlocal: 'eol'=(local_defined: 'html') || #endslash -> size ? '\\n' | '\\n';\n\t\tlocal: 'trace'=(self -> 'debug_trace');\n\t\t(self -> '_debug_trace') -> isa('array') ? #trace -> merge(self -> '_debug_trace');\n\t\treturn: #eol + 'Debug trace for ' + (self -> type ) + ' $' + (self -> varname) + #eol \n\t\t\t+ #trace -> (join: #eol) + #eol;\n\n\t/define_tag;\n\n\n\tdefine_tag: 'tagtime', -description='Returns the time it took to execute the last executed member tag for a type instance.',\n\t\t-optional='html',\n\t\t-optional='xhtml';\n\t\t/* Standard timer code\n\t\tAt beginning of tag code:\n\t\tlocal: 'timer'=knop_timer; \n\t\t\n\t\tBefore the end of tag code (before return):\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t\n\t\t*/\n\t\tlocal: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');\n\n\t\t((local_defined: 'html') || (local_defined: 'xhtml')) ? return: (self -> type) + '->' + (self -> 'tagtime_tagname') + ': ' + (self -> 'tagtime') + ' ms';\n\t\treturn: (self -> 'tagtime');\n\t/define_tag;\n\n/define_type;\n\n\n\n?>\n[\n//------------------------------------------------------------------\n// End knop_base\n//------------------------------------------------------------------\n\n//##################################################################\n\n][\n//------------------------------------------------------------------\n// Begin knop_database\n//------------------------------------------------------------------\n\n]settable: removed reference for -table\n2009-09-18\tJS\tSyntax adjustments for Lasso 9\n2009-06-26\tJS\t->nextrecord: Added deprecation warning\n2009-05-15\tJS\t->field: corrected the verification of the -index parameter\n2009-01-09\tJS\tAdded a check before calling resultset_count so it will not break in Lasso versions before 8.5\n2009-01-09\tJS\t->_unknowntag: fixed incorrect debug_trace\n2008-12-03\tJS\t->addrecord: improved how keyvalue is returned when adding records\n2008-12-03\tJS\t->addrecord: inserting a generated keyvalue can now be suppressed by specifying -keyvalue=false\n2008-12-03\tJS\t->saverecord and ->deleterecord will now use the current keyvalue (if any), so -keyvalue will not have to be specified in that case. \n2008-11-25\tJS\t->field and ->recorddata will no longer touch current_record if it was zero\n2008-11-24\tJS\t->field: Added -index parameter to be able to access any occurrence of the same field name\n2008-11-24\tJS\tAdded -> records that returns a new data type knop_databaserows\n2008-11-24\tJS\t->resultset_count: added support for -inlinename. \n2008-11-24\tJS\tChanged ->nextrecord to ->next. ->nextrecord remains supported for backwards compatibility.\n2008-11-14\tJS\t->nextrecord resets the record pointer when reaching the last record\n2008-11-13\tJS\t->recorddata now honors the current record pointer (as incremented by -nextrecord)\n2008-11-13\tJS\t->recorddata: added -recordindex parameter so a specific record can be returned instead of the first found.\n2008-10-30\tJS\t->getrecord now REALLY works with integer keyvalues (double oops) - I thought I fixed it 2008-05-28 but misplaced a paren...\n2008-09-26\tJS\tAdded -> resultset_count corresponding to the same Lasso tag, so [resultset]...[/resultset] can now be used through the use of inlinename.\n2008-09-10\tJS\t-> getrecord, ->saverecord, ->deleterecord: Corrected handling of lock user to work better with knop_user\n2008-07-09\tJS\t->saverecord: -keeplock now updates the lock timestamp\n2008-05-28\tJS\t->getrecord now works with integer keyvalues (oops)\n2008-05-27\tJS\t->get returns a new datatype knop_databaserow \n2008-05-27\tJS\tAdded ->size and ->get so a database object can be iterated. When iterating each row is returned as an array of field values. \n2008-05-27\tJS\tAddedd ->nextrecord that increments the recordpointer each time it is called until the last record in the found set is reached. Returns true as long as there are more records. Useful in a while loop - see example below\n2008-05-27\tJS\tImplemented record pointer 'current_record'. The record pointer is reset for each new query. \n2008-05-27\tJS\t->field: added -recordindex to get data from any record in the current found set\n2008-05-27\tJS\tAdded ->_unknowntag as shortcut to field\n2008-05-26\tJS\tRemoved onassign since it causes touble\n2008-05-26\tJS\tExtended field_names to return the field names for any specified table, return field names also for db objects that have never been used for a database query and optionally return field types\n2008-01-29\tJS\t->getrecord now supports -sql. Make sure that the SQL statement includes the relevant keyfield (and lockfield if locking is used). \n2008-01-10\tJS\t->capturesearchvars: error_code and error_msg was mysteriously not set after database operations that caused errors. \n2008-01-08\tJS\t->saverecord: added flag -keeplock to be able to save a locked record without releasing the lock\n2007-12-15\tJS\tAdding support for knop_user in record locking is in progress. Done for ->oncreate and ->getrecord. \n2007-12-11\tJS\tMoved error_code and error_msg to knop_base\n2007-12-11\tJS\tAdded documentation as -description to most member tags, to be used by the new ->help tag\n2007-12-11\tJS\tMoved ->help to knop_base\n2007-12-10\tJS\tAdded ->settable to be able to copy an existing database object and properly set a new table name for it. Faster than creating a new instance from scratch. \n2007-12-03\tJS\tCorrected shown_first once again, hoping it's right this time\n2007-11-29\tJS\tAdded support for field_names and corresponding member tag ->field_names\n2007-11-05\tJS\tAdded var name to trace output\n2007-10-26\tJS\t->capturesearchvars: corrected shown_first when no records found\n2007-10-26\tJS\t->oncreate: added default value \"keyfield\" if the -keyfield parameter is not specified\n2007-09-06\tJS\tCorrected self -> 'tagtime' typo\n2007-06-18\tJS\tAdded tag timer to most member tags\n2007-06-13\tJS\tadded inheritance from knop_base\n2007-06-11\tJC\tadded handling of xhtml output\n2007-05-30\tJS\tChanged recordid_value to keyfield_value and -recordid to -keyvalue\n2007-05-28\tJS\t->oncreate: Added clearing of current error at beginning of tag\n2007-04-19\tJS\tCorrected the handling of -maxrecords and -skiprecords for SQL selects that have LIMIT specified\n2007-04-19\tJS\tImproved handling of foundrows so it finds any whitespace around SQL keywords, instead of just plain spaces\n2007-04-18\tJS\t->select now populates recorddata with all the fields for the first found record. Previously it only populated recorddata when there was 1 found record. \n2007-04-12\tJS\t->oncreate: Added authentication inline around Database_TableNames../Database_TableNames\n2007-04-10\tJS\t->oncreate: Improved validation of table name (table_realname can sometimes be null even for valid table names)\n2007-04-03\tJS\tChanged namespace from mt_ to knop_\n2007-02-02\tJS\tImproved reporting of Lasso error messaged in error_msg\n2007-01-30\tJS \tAdded real error codes and additional error data for some errors (like record locked)\n2007-01-30\tJS\tChanged -keyvalue parameters to copy value instead of pass as reference, to not cause problems when using keyvalue from the same db object as is being updated, for example $db->(saverecord: -keyvalue=$db->keyvalue)\n2007-01-26\tJS\tAdjusted affectedrecord_keyvalue so it's only captured for -add and -update\n2007-01-23\tJS\tSupports -uselimit (or querys that use LIMIT) and still gets proper searchresult vars (using a separate COUNT(*) query) - may not always get the right result for example for queries with GROUP BY\n2007-01-23\tJS\t-keyfield can be specified for saverecord to override the default\n2007-01-23\tJS\tChanged name of ->updaterecord to ->saverecord\n2007-01-23\tJS \tFixed bug where keyfield was missing as returnfield when looking up locked record for deleterecord\n2007-01-23\tJS\tAdded ->field\n2007-01-19\tJS\tAdded maxrecords_value and skiprecords_value to searchresultvars\n2007-01-18\tJS\tAdded affectedrecord_keyvalue to make it possible to highlight affected record in record list (grid)\n\n\nTODO:\nAllow -keyfield to be specified for ->addrecord and ->deleterecord\nAdd some Active Record similar functionality for editing\nLook at making it so -table can be set dynamically instead of fixed at oncreate, to eliminate the need for one db object for each table. This can cause problems with record locks and how they interact with knop_user \ndatetime_create and datetime_mod, and also user_create and user_mod.\n\tUse default field names but allow to override at oncreate, and verify them at oncreate before trying to use them. \n\n\n*/\n\n\t// instance variables\n\t// these variables are set once\n\tlocal: 'database'=string,\n\t\t'table'=string,\n\t\t'table_realname'=string,\t// the actual table name, to be used in SQL statements (in case the table name is aliased in Lasso)\n\t\t'username'=string,\n\t\t'password'=string,\n\t\t'db_connect'=array,\n\t\t'host'=array,\t\t\t\t// add support for inline host method\n\t\t'datasource_name'=string,\n\t\t'isfilemaker'=false,\n\t\t'lock_expires'=1800,\t\t// seconds before a record lock expires\n\t\t'lock_seed'=knop_seed,\t\t// encryption seed for the record lock\n\t\t'error_lang'=(knop_lang: -default='en', -fallback),\n\t\t'user'=null,\t\t\t\t// knop_user that will be used for record locking\n\t\t'databaserows_map'=map;\t\t// map to hold databaserows for each inlinename\n\n\t// these variables are set for each query\n\tlocal: 'inlinename'=string,\t\t\t// the inlinename that holds the result of the latest db operation\n\t\t'keyfield'=string,\n\t\t'keyvalue'=null,\n\t\t'affectedrecord_keyvalue'=null,\t// keyvalue of last added or updated record (not reset by other db actions)\n\t\t'lockfield'=string,\n\t\t'lockvalue'=null,\n\t\t'lockvalue_encrypted'=null,\n\t\t'timestampfield'=string,\t\t// for optimistic locking\n\t\t'timestampvalue'=string,\n\t\t'searchparams'=string,\t\t\t// the resulting pair array used in the database action\n\t\t'querytime'=integer,\t\t\t// query time in ms\n\t\t// 'tagtime'=integer,\t\tmoved to knop_base\n\t\t'recorddata'=map,\t\t\t\t// for single record results, a map of all returned db fields\n\t\t'error_data'=map,\t\t\t\t// additional data for certain errors\n\t\t'message'=string,\t\t\t\t// user message for normal result\n\t\t'current_record'=integer,\t\t// index of the current record to get field values from a specific record\n\t\t'field_names_map'=map,\n\t\t'resultset_count_map'=map;\t\t// resultset_count stored for each inlinename \n\t// these vars have directly corresponding Lasso tags so they can be set programatically\n\tlocal: 'searchresultvars'=(array: 'action_statement', 'found_count', 'shown_first', \n\t\t'shown_last', 'shown_count', 'field_names', 'records_array', 'maxrecords_value', 'skiprecords_value');\n\titerate: #searchresultvars, (local: 'resultvar');\n\t\tlocal(#resultvar = null);\n\t/iterate;\n\n\tlocal: 'errors_error_data'=(map: 7010, 7012, 7013, 7016, 7018, 7019); // these error codes can have more info in error_data map\n\n\tdefine_tag: 'oncreate',\n\t\t-required='database',\n\t\t-required='table',\n\t\t-optional='host',\t\t\t// add support for inline host method\n\t\t-optional='username',\n\t\t-optional='password',\n\t\t-optional='keyfield',\n\t\t-optional='lockfield',\n\t\t-optional='user',\n\t\t-optional='validate';\t\t// validate the database connection info (adds the overhead of making a test connection to the database)\n\t\tlocal: 'timer'=knop_timer; \n\t\t\n\t\t// reset error\n\t\terror_code = 0;\n\t\terror_msg = error_noerror;\n\t\n\t\t// validate database and table names to make sure they exist in Lasso\n\t\t(self -> 'datasource_name') = Lasso_DatasourceModuleName: #database;\n\t\tfail_if: error_code != 0, error_code, error_msg;\n\t\t\t\t\n\t\t// store params as instance variables\n\t\tlocal_defined('database') ? (self -> 'database') = @#database; \n\t\tlocal_defined('table') ? (self -> 'table') = @#table; \n\t\tlocal_defined('host') ? (self -> 'host') = @#host;\t// add support for inline host method\n\t\tlocal_defined('username') ? (self -> 'username') = @#username; \n\t\tlocal_defined('password') ? (self -> 'password') = @#password; \n\t\tlocal_defined('lockfield') ? (self -> 'lockfield') = @#lockfield; \n\t\tlocal_defined('user') ? (self -> 'user') = @#user;\n\t\t\t// param has default value\n\t\t(self -> 'keyfield') = (local_defined('keyfield') \n\t\t\t\t\t\t\t\t? @#keyfield // use parameter value\n\t\t\t\t\t\t\t\t| 'keyfield'); // use default value\n\n\t\t\n\t\t// build inline connection array\n\t\tlocal_defined('database') ? (self -> 'db_connect') -> insert('-database' = @#database);\n\t\tlocal_defined('table') ? (self -> 'db_connect') -> insert('-table' = @#table);\n\t\tlocal_defined('host') ? (self -> 'db_connect') -> insert('-host' = @#host);\t// add support for inline host method\n\t\tlocal_defined('username') ? (self -> 'db_connect') -> insert('-username' = @#username);\n\t\tlocal_defined('password') ? (self -> 'db_connect') -> insert('-password' = @#password);\n\n\t\t(self -> 'table_realname') = (table_realname: #database, #table);\n\t\tif: (self -> 'table_realname') == null;\n\t\t\t// verify that the table exists even if table_realname is null\n\t\t\tinline: (self -> 'db_connect');\n\t\t\t\tDatabase_TableNames: #database;\n\t\t\t\t\tif: Database_TableNameItem == #table;\n\t\t\t\t\t\t(self -> 'table_realname') = #table;\n\t\t\t\t\t\tloop_abort;\n\t\t\t\t\t/if;\n\t\t\t\t/Database_TableNames;\n\t\t\t/inline;\n\t\t/if;\n\t\tfail_if: (self -> 'table_realname') == null, 7001, self -> error_msg(7001); // The specified table was not found\n\t\t\n\t\tif: (local_defined: 'validate');\n\t\t\t// validate db connection\n\t\t\tinline: (self -> 'db_connect');\n\t\t\t\tfail_if: error_code != 0, error_code, error_msg;\n\t\t\t/inline;\n\t\t/if;\n\n\t\tif: Lasso_DatasourceIsFilemaker: #database || Lasso_DatasourceIsFilemakerSA: #database;\n\t\t\t(self -> 'isfilemaker') = true;\n\t\t/if;\n\t\t(self -> 'debug_trace') -> (insert: tag_name + ': creating database object on ' + (self -> 'datasource_name') +', isfilemaker: ' + (self -> 'isfilemaker') + ' at ' + (date -> (format: '%Q %T')));\n\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\n\t/define_tag;\n\t\n\t/* \n\tdefine_tag: 'onassign', -required='value', -description='Internal, needed to restore references when ctype is defined as prototype';\n\t\t// recreate references here\n\t\t(self -> 'user') = @(#value -> 'user');\n\t/define_tag;\n\t*/\n\n\tdefine_tag('_unknowntag', -description='Shortcut to field');\n\t\tif((self -> 'field_names_map') >> tag_name);\n\t\t\treturn(self -> field(tag_name));\n\t\telse;\n\t\t\t//fail(-9948, self -> type + '->' + tag_name + ' not known.');\n\t\t\t(self -> 'debug_trace') -> insert(self -> type + '->' + tag_name + ' not known.');\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'settable',\t-description='Changes the current table for a database object. Useful to be able to create \\\n\t\tdatabase objects faster by copying an existing object and just change the table name. This is a little bit faster \\\n\t\tthan creating a new instance from scratch, but no table validation is performed. Only do this to add database \\\n\t\tobjects for tables within the same database as the original database object. ',\n\t\t-required='table', -type='string';\n\t\tlocal: 'timer'=knop_timer; \n\t\n\t\t(self -> 'error_code')=0;\n\t\t(self -> 'error_msg')=string;\n\t\t(self -> 'table_realname') = #table;\n\t\t(self -> 'db_connect') -> removeall(#table);\n\t\t(self -> 'db_connect') -> (insert: '-table' = #table);\n\t\t(self -> 'table_realname') = (table_realname: self -> 'database', #table);\n\t\tif: (self -> 'table_realname') == null;\n\t\t\t// verify that the table exists even if table_realname is null\n\t\t\tinline: (self -> 'db_connect');\n\t\t\t\tDatabase_TableNames: (self -> 'database');\n\t\t\t\t\tif: Database_TableNameItem == #table;\n\t\t\t\t\t\t(self -> 'table_realname') = #table;\n\t\t\t\t\t\tloop_abort;\n\t\t\t\t\t/if;\n\t\t\t\t/Database_TableNames;\n\t\t\t/inline;\n\t\t/if;\n\t\tfail_if: (self -> 'table_realname') == null, 7001, self -> error_msg(7001); // The specified table was not found\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'select', -description='perform database query, either Lasso-style pair array or SQL statement.\\\n\t\t\t ->recorddata returns a map with all the fields for the first found record. \\\n\t\t\t If multiple records are returned, the records can be accessed either through ->inlinename or ->records_array.\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-search (optional array) Lasso-style search parameters in pair array\\n\\\n\t\t\t-sql (optional string) Raw sql query\\n\\\n\t\t\t-keyfield (optional) Overrides default keyfield, if any\\n\\\n\t\t\t-keyvalue (optional)\\n\\\n\t\t\t-inlinename (optional) Defaults to autocreated inlinename',\n\t\t-optional='search', -type='array',\n\t\t-optional='sql', -type='string',\n\t\t-optional='keyfield',\n\t\t-optional='keyvalue', -copy,\n\t\t-optional='inlinename', -copy;\n\n\t\tknop_debug(self->type + ' -> ' + tag_name, -open, -type=self->type);\n\t\thandle;\n\t\t\t//knop_debug(-close, -witherrors, -type=self->type);\n\t\t\tknop_debug('Done with ' + self->type + ' -> ' + tag_name, -close, -witherrors, -time);\n\t\t/handle;\n\t\tlocal: 'timer'=knop_timer; \n\n\t\t// clear all search result vars\n\t\tself -> reset;\n\t\t\n\t\tlocal: '_search'=(local: 'search'),\n\t\t\t'_sql'=(local: 'sql');\n\t\tif: #_search -> type != 'array';\n\t\t\t#_search = array;\n\t\t/if;\n\t\tif: #_sql != '' && (self -> 'isfilemaker');\n\t\t\t#_sql='';\n\t\t\tfail: 7009, self -> error_msg(7009); // sql can not be used with filemaker\n\t\t/if;\n\t\t// inlinename defaults to a random string\n\t\t(self -> 'inlinename') = ((local: 'inlinename') != '' ? #inlinename | 'inline_' + knop_unique);\n\t\t#_search -> (removeall: -inlinename);\n\t\t#_search -> (insert: -inlinename=(self -> 'inlinename'));\n\t\t\n\t\t// remove all database actions from the search array\n\t\t#_search -> (removeall: -search) & (removeall: -add) & (removeall: -delete) & (removeall: -update) \n\t\t\t& (removeall: -sql) & (removeall: -nothing) & (removeall: -show)\n\t\t\t// & (removeall: -table) // table is ok to override\n\t\t\t& (removeall: -database);\n\n\t\tif: (local: 'sql') != '' && (string_findregexp: #sql, -find='\\\\bLIMIT\\\\b', -ignorecase) -> size;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': grabbing -maxrecords and -skiprecords from search array');\n\t\t\t// store maxrecords and skiprecords for later use\n\t\t\tif: #_search >> '-maxrecords';\n\t\t\t\t(self -> 'maxrecords_value') = #_search -> (find: '-maxrecords') -> last -> value;\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': -maxrecords value found in search array ' + (self -> 'maxrecords_value'));\n\t\t\t/if;\n\t\t\tif: #_search >> '-skiprecords';\n\t\t\t\t(self -> 'skiprecords_value') = #_search -> (find: '-skiprecords') -> last -> value;\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': -skiprecords value found in search array ' + (self -> 'skiprecords_value'));\n\t\t\t/if;\n\t\t\t// remove skiprecords from the actual search parameters since it will conflict with LIMIT\n\t\t\t#_search -> (removeall: '-skiprecords');\n\t\t/if;\n\n\t\tif: !(local_defined: 'keyfield') && (self -> 'keyfield') != '';\n\t\t\tlocal: 'keyfield'=(self -> 'keyfield');\n\t\t/if;\n\t\tif: (local: 'keyfield') != '';\n\t\t\t#_search -> (removeall: '-keyfield');\n\t\t\tif: !(self -> 'isfilemaker');\n\t\t\t\t#_search -> (insert: '-keyfield'=#keyfield);\n\t\t\t/if;\n\t\t\tif: (local: 'keyvalue') != '';\n\t\t\t\t#_search -> (removeall: '-keyvalue');\n\t\t\t\tif: (self -> 'isfilemaker');\n\t\t\t\t\t#_search -> (insert: '-op'='eq');\n\t\t\t\t\t#_search -> (insert: #keyfield=#keyvalue);\n\t\t\t\telse;\n\t\t\t\t\t#_search -> (insert: '-keyvalue'=#keyvalue);\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t/if;\n\n\t\t// add sql action or normal search action\n\t\tif: #_sql != '';\n\t\t\t#_search -> (insert: '-sql'=#_sql);\n\t\telse;\n\t\t\t#_search -> (insert: '-search');\n\t\t/if;\n\t\t// perform database query, put connection parameters last to override any provided by the search parameters\n\t\t//(self -> 'debug_trace') -> (insert: tag_name + ': search ' + #_search);\n\t\tlocal: 'querytimer'=knop_timer;\n\t\tinline: #_search,(self -> 'db_connect');\n\t\t\t(self -> 'querytime') = integer: #querytimer;\n\t\t\t(self -> 'searchparams') = #_search;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name ': action_statement ' + action_statement);\n\t\t\tknop_debug(action_statement, -sql);\n\t\t\tknop_debug(found_count ' found');\n\t\t\tself -> capturesearchvars;\n\t\t/inline;\n\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t(self -> 'debug_trace') -> (insert: tag_name + ': found ' (self -> 'found_count') + ' records in ' + (self -> 'querytime') + ' ms, tag time ' + (self -> 'tagtime') + ' ms, ' + (self -> error_msg) + ' ' + (self -> error_code));\n\t/define_tag;\n\n\n\tdefine_tag: 'addrecord', -description='Add a new record to the database. A random string keyvalue will be generated unless a -keyvalue is specified. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-fields (required array) Lasso-style field values in pair array\\n\\\n\t\t\t-keyvalue (optional) If -keyvalue is specified, it must not already exist in the database. Specify -keyvalue=false to prevent generating a keyvalue. \\n\\\n\t\t\t-inlinename (optional) Defaults to autocreated inlinename',\n\t\t-required='fields', -type='array',\n\t\t-optional='keyvalue', -copy,\n\t\t-optional='inlinename';\n\t\tlocal: 'timer'=knop_timer; \n\n\t\t// clear all search result vars\n\t\tself -> reset;\n\t\tlocal: '_fields'=#fields;\n\t\t\n\t\t// remove all database actions from the search array\n\t\t#_fields -> (removeall: '-search') & (removeall: '-add') & (removeall: '-delete') & (removeall: '-update') \n\t\t\t& (removeall: '-sql') & (removeall: '-nothing') & (removeall: '-show')\n\t\t\t// & (removeall: '-table') // table is ok to override\n\t\t\t& (removeall: '-database');\n\n\t\tinline: (self -> 'db_connect'); // connection wrapper\n\t\t\tif: (local: 'keyvalue') != '' && (local: 'keyvalue') !== false && (self -> 'keyfield')!='';\n\t\t\t\t// look for existing keyvalue\n\t\t\t\tinline: -op='eq', (self -> 'keyfield')=#keyvalue, \n\t\t\t\t\t-maxrecords=1,\n\t\t\t\t\t-returnfield=(self -> 'keyfield'),\n\t\t\t\t\t-search;\n\t\t\t\t\tif: found_count > 0;\n\t\t\t\t\t\t(self -> 'error_code') = 7017; // duplicate keyvalue\n\t\t\t\t\telse;\n\t\t\t\t\t\t(self -> 'keyvalue') = #keyvalue;\n\t\t\t\t\t/if;\n\t\t\t\t/inline;\n\t\t\t/if;\n\n\t\t\t\n\t\t\tif: (self -> 'error_code') == 0;\n\t\t\t\t// proceed to add record\n\n\t\t\t\tif: (self -> 'keyfield') != '';\n\t\t\t\t\tif: (local: 'keyvalue') == '' && (local: 'keyvalue') !== false;\n\t\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': generating keyvalue');\n\t\t\t\t\t\t// create unique keyvalue\n\t\t\t\t\t\t(self -> 'keyvalue')=knop_unique;\n\t\t\t\t\t/if;\n\t\t\t\t\t#_fields -> (removeall: (self -> 'keyfield'));\n\t\t\t\t\t#_fields -> (removeall: '-keyfield') & (removeall: '-keyvalue');\n\t\t\t\t\t#_fields -> (insert: '-keyfield'=(self -> 'keyfield'));\n\t\t\t\t\tif: (local: 'keyvalue') !== false;\n\t\t\t\t\t\t#_fields -> (insert: (self -> 'keyfield')=(self -> 'keyvalue'));\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\n\t\t\t\t// inlinename defaults to a random string\n\t\t\t\t(self -> 'inlinename') = ((local: 'inlinename') != '' ? #inlinename | 'inline_' + knop_unique);\n\t\t\t\t#_fields -> (removeall: '-inlinename');\n\t\t\t\t#_fields -> (insert: '-inlinename'=(self -> 'inlinename'));\n\t\t\t\t\n\t\t\t\tlocal: 'querytimer'=knop_timer;\n\t\t\t\tinline: #_fields, -add;\n\t\t\t\t\t(self -> 'querytime') = integer: #querytimer;\n\t\t\t\t\t(self -> 'searchparams') = #_fields;\n\t\t\t\t\n\t\t\t\t\tself -> capturesearchvars;\n\t\t\t\t\tif: error_code != 0;\n\t\t\t\t\t\t(self -> 'keyvalue') = null;\n\t\t\t\t\t/if;\n\t\t\t\t/inline;\n\t\t\t/if;\n\t\t/inline;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t(self -> 'debug_trace') -> (insert: tag_name + ': ' + (self -> error_msg) + ' ' + (self -> error_code) \n\t\t\t+ ' keyvalue ' + (self -> 'keyvalue') + ' ' + (self -> 'tagtime') + ' ms');\n\t/define_tag;\n\n\n\tdefine_tag: 'getrecord', -description='Returns a single specific record from the database, optionally locking the record. \\\n\t\t\tIf the keyvalue matches multiple records, an error is returned. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-keyvalue (optional) Uses a previously set keyvalue if not specified. If no keyvalue is available, an error is returned unless -sql is used. \\n\\\n\t\t\t-keyfield (optional) Temporarily override of keyfield specified at oncreate\\n\\\n\t\t\t-inlinename (optional) Defaults to autocreated inlinename\\n\\\n\t\t\t-lock (optional flag) If flag is specified, a record lock will be set\\n\\\n\t\t\t-user (optional) The user who is locking the record (required if using lock)\\n\\\n\t\t\t-sql (optional) SQL statement to use instead of keyvalue. Must include the keyfield (and lockfield of locking is used).',\n\t\t-optional='keyvalue', -copy,\n\t\t-optional='keyfield',\n\t\t-optional='inlinename', -copy,\n\t\t-optional='lock',\n\t\t-optional='user', -copy,\n\t\t-optional='sql', -type='string';\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tlocal: '_sql'=(local: 'sql');\n\n\t\tif: #_sql != '' && (self -> 'isfilemaker');\n\t\t\t#_sql='';\n\t\t\tfail: 7009, self -> error_msg(7009); // sql can not be used with filemaker\n\t\t/if;\n\t\t\n\t\t// get existing record pointer if any\n\t\tif: #_sql -> size == 0 && !(local_defined: 'keyvalue');\n\t\t\tlocal: 'keyvalue'=(self -> 'keyvalue');\n\t\telse: !(local_defined: 'keyvalue');\n\t\t\tlocal: 'keyvalue'=string;\n\t\t/if;\n\n\t\t// clear all search result vars\n\t\tself -> reset;\n\t\t\n\t\tfail_if: !(local_defined: 'keyfield') && (self -> 'keyfield') == '', 7002, self -> error_msg(7002); // Keyfield not specified\n\t\tif: (local_defined: 'lock') && #lock != false;\n\t\t\tfail_if: (self -> 'lockfield') == '', 7003, self -> error_msg(7003); // Lockfield must be specified to get record with lock\n\t\t\tif: !(local_defined: 'user') && ((self -> 'user') != '' || (self -> 'user') -> isa('user'));\n\t\t\t\t// use user from database object\n\t\t\t\tlocal('user' = (self -> 'user'));\n\t\t\t/if;\n\t\t\tfail_if: (local: 'user') == '' && !((local: 'user') -> isa('user')), 7004, self -> error_msg(7004); // User must be specified to get record with lock\n\t\t\t(self -> 'debug_trace') -> insert(tag_name ': user is type ' + (#user -> type) + ', isa(user) = ' + (#user -> isa('user')) );\n\t\t\tif: #user -> isa('user');\n\t\t\t\t#user= #user -> id_user;\n\t\t\t\tfail_if: #user == '', 7004, self -> error_msg(7004); // User must be logged in to get record with lock\n\t\t\t/if;\n\t\t\t(self -> 'debug_trace') -> insert(tag_name ': user id is ' + #user);\n\t\t/if;\n\t\tif: !(local_defined: 'keyfield') && (self -> 'keyfield') != '';\n\t\t\tlocal: 'keyfield'=(self -> 'keyfield');\n\t\t/if;\n\t\tif: #_sql -> size == 0 && string(#keyvalue) -> size == 0;\n\t\t\t(self -> 'error_code') = 7007; // keyvalue missing\n\t\t/if;\n\t\tif: (self -> 'error_code') == 0;\n\t\t\tinline: (self -> 'db_connect'); // connection wrapper\n\n\t\t\t\tif: #_sql -> size;\n\t\t\t\t\tself -> (select: -sql=#_sql, -inlinename=(local: 'inlinename'));\n\t\t\t\t\t#keyvalue = (self -> 'keyvalue');\n\t\t\t\telse;\n\t\t\t\t\tself -> (select: -keyfield=#keyfield, -keyvalue=#keyvalue, -inlinename=(local: 'inlinename'));\n\t\t\t\t/if;\n\t\t\t\tif: (self -> field_names) !>> #keyfield;\n\t\t\t\t\t(self -> 'error_code') = 7020; // Keyfield not present in query\n\t\t\t\t/if;\n\t\t\t\tif: (self -> field_names) !>> (self -> 'lockfield') && (local_defined: 'lock') && #lock != false;\n\t\t\t\t\t(self -> 'error_code') = 7021; // Lockfield not present in query\n\t\t\t\t/if;\n\t\t\t\t\n\t\t\t\tif: (self -> 'found_count') == 0 && (self -> 'error_code') == 0;\n\t\t\t\t\t(self -> 'error_code') = -1728;\n\t\t\t\telse: (self -> 'found_count') > 1 && (self -> 'error_code') == 0;\n\t\t\t\t\tself -> reset;\n\t\t\t\t\t(self -> 'error_code') = 7008; // keyvalue not unique\n\t\t\t\t/if;\n\t\t\n\t\t\n\t\t\t\t// handle record locking\n\t\t\t\tif: (self -> 'error_code') == 0 && (local_defined: 'lock') && #lock != false;\n\t\t\t\t\t// check for current lock\n\t\t\t\t\tif: (self -> 'lockvalue') != '';\n\t\t\t\t\t\t// there is a lock already set, check if it has expired or if it is the same user\n\t\t\t\t\t\tlocal: 'lockvalue'=(self -> 'lockvalue') -> (split: '|');\n\t\t\t\t\t\tlocal: 'lock_timestamp'=date: (#lockvalue->size > 1 ? #lockvalue -> (get: 2) | null);\n\t\t\t\t\t\tlocal: 'lock_user'=#lockvalue -> first;\n\t\t\t\t\t\tif: (date - #lock_timestamp) -> seconds < (self -> 'lock_expires')\n\t\t\t\t\t\t\t&& #lock_user != #user;\n\t\t\t\t\t\t\t// the lock is still valid and it is locked by another user\n\t\t\t\t\t\t\t// this is not a real error, more a warning condition\n\t\t\t\t\t\t\t(self -> 'error_code') = 7010; \n\t\t\t\t\t\t\t(self -> 'error_data') = (map: 'user' = #lock_user, 'timestamp' = #lock_timestamp);\n\t\t\t\t\t\t\t(self -> 'keyvalue') = null;\n\t\t\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name ': record ' + #keyvalue + ' was already locked by ' + #lock_user + '.');\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/if;\n\t\t\t\t\tif: (self -> 'error_code') == 0;\n\t\t\t\t\t\t// go ahead and lock record\n\t\t\t\t\t\t(self -> 'lockvalue') = #user + '|' + (date -> format: '%Q %T');\n\t\t\t\t\t\t(self -> 'lockvalue_encrypted') = (encrypt_blowfish: (self -> 'lockvalue'), -seed=(self -> 'lock_seed'));\n\t\t\t\t\t\tlocal: 'keyvalue_temp'=#keyvalue;\n\t\t\t\t\t\tif: (self -> 'isfilemaker');\n\t\t\t\t\t\t\t// find internal keyvalue\n\t\t\t\t\t\t\tinline: -op='eq', #keyfield=#keyvalue,\n\t\t\t\t\t\t\t\t-search;\n\t\t\t\t\t\t\t\tif: found_count == 1;\n\t\t\t\t\t\t\t\t\t#keyvalue_temp=keyfield_value;\n\t\t\t\t\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': will set record lock for FileMaker record id ' + keyfield_value + ' ' + error_msg + ' ' + error_code);\n\t\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': could not get record id for FileMaker record, ' found_count + ' found ' + + error_msg + ' ' + error_code);\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\t/inline;\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\tinline: -keyfield=#keyfield,\n\t\t\t\t\t\t\t-keyvalue=#keyvalue_temp, \n\t\t\t\t\t\t\t(self -> 'lockfield')=(self -> 'lockvalue'),\n\t\t\t\t\t\t\t-update;\n\t\t\t\t\t\t\tif: error_code;\n\t\t\t\t\t\t\t\t(self -> 'error_code') = 7012; // could not set record lock\n\t\t\t\t\t\t\t\t(self -> 'error_data') = (map: 'error_code'=error_code, 'error_msg'=error_msg);\n\t\t\t\t\t\t\t\t(self -> 'lockvalue') = null;\n\t\t\t\t\t\t\t\t(self -> 'lockvalue_encrypted') = null;\n\t\t\t\t\t\t\t\t(self -> 'keyvalue') = null;\n\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\t// lock was set ok\n\t\t\t\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': set record lock ' + (self -> 'lockvalue') + ' ' + (self -> 'lockvalue_encrypted'));\n\t\t\t\t\t\t\t\tif: (self -> 'user') -> isa('user');\n\t\t\t\t\t\t\t\t\t// tell user it has locked a record in this db object\n\t\t\t\t\t\t\t\t\t(self -> 'user') -> addlock(-dbname=self -> varname);\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t/inline;\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t\t\n\t\t\t/inline;\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t(self -> 'debug_trace') -> (insert: tag_name + ': ' + (self -> error_msg) + ' ' + (self -> error_code) + ' ' + (self -> 'tagtime') + ' ms');\n\t/define_tag;\n\n\n\tdefine_tag: 'saverecord', -description='Updates a specific database record. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-fields (required array) Lasso-style field values in pair array\\n\\\n\t\t\t-keyfield (optional) Keyfield is ignored if lockvalue is specified\\n\\\n\t\t\t-keyvalue (optional) Keyvalue is ignored if lockvalue is specified\\n\\\n\t\t\t-lockvalue (optional) Either keyvalue or lockvalue must be specified\\n\\\n\t\t\t-keeplock (optional flag) Avoid clearing the record lock when saving. Updates the lock timestamp.\\n\\'\n\t\t\t-user (optional) If lockvalue is specified, user must be specified as well\\n\\\n\t\t\t-inlinename (optional) Defaults to autocreated inlinename',\n\t\t-required='fields', -type='array',\n\t\t-optional='keyfield',\n\t\t-optional='keyvalue', -copy,\n\t\t-optional='lockvalue', -copy,\n\t\t-optional='keeplock',\n\t\t-optional='user', -copy,\n\t\t-optional='inlinename', -copy;\n\t\t\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tif(!local_defined('keyvalue') && string(self -> 'keyvalue') -> size);\n\t\t\t// use current record's keyvalue if any\n\t\t\tlocal('keyvalue'=(self -> 'keyvalue'));\n\t\t/if;\n\n\t\t// clear all search result vars\n\t\tself -> reset;\n\n\t\tfail_if: !(local_defined: 'keyvalue') && !(local_defined: 'lockvalue'), 7005, self -> error_msg(7005); // Either keyvalue or lockvalue must be specified for update or delete\n\t\tfail_if: (local_defined: 'keyvalue') && (self -> 'keyfield') == '' && (local: 'keyfield') == '', 7002, self -> error_msg(7002); // Keyfield not specified\n\t\tif: (local_defined: 'lockvalue');\n\t\t\tfail_if: (self -> 'lockfield') == '', 7003, self -> error_msg(7003); // Lockfield not specified\n\t\t\tif: !(local_defined: 'user') && ((self -> 'user') != '' || (self -> 'user') -> isa('user'));\n\t\t\t\t// use user from database object\n\t\t\t\tlocal('user' = (self -> 'user'));\n\t\t\t/if;\n\t\t\tfail_if: (local: 'user') == '' && !((local: 'user') -> isa('user')), 7004, self -> error_msg(7004); \n\t\t\t(self -> 'debug_trace') -> insert(tag_name ': user is type ' + (#user -> type) + ', isa(user) = ' + (#user -> isa('user')) );\n\t\t\tif: #user -> isa('user');\n\t\t\t\t#user= #user -> id_user;\n\t\t\t\tfail_if: #user == '', 7004, self -> error_msg(7004); // User must be logged in to get record with lock\n\t\t\t/if;\n\t\t\t(self -> 'debug_trace') -> insert(tag_name ': user id is ' + #user);\n\t\t/if;\n\t\t\n\t\t!(local_defined: 'keyfield') ? local: 'keyfield'=self -> 'keyfield';\n\t\t\n\t\tlocal: '_fields'=#fields;\n\t\t\n\t\t// remove all database actions from the search array\n\t\t#_fields -> (removeall: '-search') & (removeall: '-add') & (removeall: '-delete') & (removeall: '-update') \n\t\t\t& (removeall: '-sql') & (removeall: '-nothing') & (removeall: '-show')\n\t\t\t// & (removeall: '-table') // table is ok to override\n\t\t\t& (removeall: '-database');\n\t\t#_fields -> (removeall: '-keyfield') & (removeall: '-keyvalue');\n\n\t\tinline: (self -> 'db_connect'); // connection wrapper\n\n\t\t\t// handle record locking\n\t\t\tif: (self -> 'error_code') == 0 && (local: 'lockvalue') != '';\n\n\t\t\t\t// first check if record was locked by someone else, and that lock is still valid\n\t\t\t\tlocal: 'lock'=(decrypt_blowfish: #lockvalue, -seed=(self -> 'lock_seed')) -> (split: '|');\n\t\t\t\tlocal: 'lock_timestamp'=date: (#lock->size > 1 ? (#lock -> (get: 2)) | null);\n\t\t\t\tlocal: 'lock_user'=#lock -> first;\n\t\t\t\tif: (date - #lock_timestamp) -> seconds < (self -> 'lock_expires')\n\t\t\t\t\t&& #lock_user != #user;\n\t\t\t\t\t// the lock is still valid and it is locked by another user\n\t\t\t\t\t(self -> 'error_code') = 7010; \n\t\t\t\t\t(self -> 'error_data') = (map: 'user' = #lock_user, 'timestamp' = #lock_timestamp);\n\t\t\t\t/if;\n\n\t\t\t\t// check that the current lock is still valid\n\t\t\t\tif: (self -> 'error_code') == 0;\n\t\t\t\t\tinline: -op='eq', (self -> 'lockfield')=#lock -> (join: '|'), \n\t\t\t\t\t\t-maxrecords=1,\n\t\t\t\t\t\t-returnfield=(self -> 'lockfield'),\n\t\t\t\t\t\t-returnfield=(self -> 'keyfield'),\n\t\t\t\t\t\t-search;\n\t\t\t\t\t\tif: error_code == 0 && found_count != 1;\n\t\t\t\t\t\t\t// lock is not valid any more\n\t\t\t\t\t\t\t(self -> 'error_code') = 7011; // Update failed, record lock not valid any more\n\t\t\t\t\t\telse: error_code != 0;\n\t\t\t\t\t\t\t(self -> 'error_code') = 7018; // Update error\n\t\t\t\t\t\t\t(self -> 'error_data') = (map: 'error_code'=error_code, 'error_msg'=error_msg);\n\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t// lock OK, grab keyvalue for update\n\t\t\t\t\t\t\tlocal: 'keyvalue'=(field: (self -> 'keyfield'));\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/inline;\n\t\t\t\t/if;\n\t\t\t\t\n\t\t\t\tif: (self -> 'error_code') == 0;\n\t\t\t\t\t// go ahead and release record lock by clearing the field value in the update fields array\n\t\t\t\t\t#_fields -> (removeall: (self -> 'lockfield'));\n\t\t\t\t\tif: ((local_defined: 'keeplock') && #keeplock != false);\n\t\t\t\t\t\t// update the lock timestamp\n\t\t\t\t\t\t(self -> 'lockvalue') = #user + '|' + (date -> format: '%Q %T');\n\t\t\t\t\t\t(self -> 'lockvalue_encrypted') = (encrypt_blowfish: (self -> 'lockvalue'), -seed=(self -> 'lock_seed'));\n\t\t\t\t\t\t#_fields -> (insert: (self -> 'lockfield')=(self -> 'lockvalue'));\n\t\t\t\t\telse;\n\t\t\t\t\t\t#_fields -> (insert: (self -> 'lockfield') = '');\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\n\t\t\t/if;\n\n\t\t\tif: (self -> 'error_code') == 0 && (local: 'keyvalue') != '';\n\t\t\t\tif: (self -> 'isfilemaker');\n\t\t\t\t\tinline: -op='eq', #keyfield=#keyvalue, -search;\n\t\t\t\t\t\tif: found_count == 1;\n\t\t\t\t\t\t\t#_fields -> (insert: '-keyvalue'=keyfield_value);\n\t\t\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': FileMaker record id ' + keyfield_value);\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/inline;\n\t\t\t\telse;\n\t\t\t\t\t#_fields -> (insert: '-keyfield'=#keyfield);\n\t\t\t\t\t#_fields -> (insert: '-keyvalue'=#keyvalue);\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\tif: (#_fields >> '-keyfield' && #_fields -> (find: '-keyfield') -> first -> value != '' || (self -> 'isfilemaker'))\n\t\t\t\t&& #_fields >> '-keyvalue' && #_fields -> (find: '-keyvalue') -> first -> value != '';\n\t\t\t\t// ok to update\n\t\t\telse: (self -> 'error_code') == 0;\n\t\t\t\t(self -> 'error_code') = 7006; // Update failed, keyfield or keyvalue missing';\n\t\t\t/if;\n\n\t\t\t// update record\n\t\t\tif: (self -> 'error_code') == 0;\n\n\t\t\t\t// inlinename defaults to a random string\n\t\t\t\t(self -> 'inlinename') = ((local: 'inlinename') != '' ? #inlinename | 'inline_' + knop_unique);\n\t\t\t\t#_fields -> (removeall: '-inlinename');\n\t\t\t\t#_fields -> (insert: '-inlinename'=(self -> 'inlinename'));\n\t\n\t\t\t\tlocal: 'querytimer'=knop_timer;\n\t\t\t\tinline: #_fields, -update;\n\t\t\t\t\t(self -> 'querytime') = integer: #querytimer;\n\t\t\t\t\t(self -> 'searchparams') = #_fields;\n\t\t\t\t\tself -> capturesearchvars;\n\t\t\t\t/inline;\n\t\t\t/if;\n\t\t/inline;\n\t\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t(self -> 'debug_trace') -> (insert: tag_name + ': ' + (self -> 'keyvalue') + ' '+ (self -> error_msg) + ' ' + (self -> error_code) + ' ' + (self -> 'tagtime') + ' ms');\n\t/define_tag;\n\n\n\tdefine_tag: 'deleterecord', -description='Deletes a specific database record. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-keyvalue (optional) Keyvalue is ignored if lockvalue is specified\\n\\\n\t\t\t-lockvalue (optional) Either keyvalue or lockvalue must be specified\\n\\\n\t\t\t-user (optional) If lockvalue is specified, user must be specified as well',\n\t\t-optional='keyvalue', -copy,\n\t\t-optional='lockvalue', -copy,\n\t\t-optional='user';\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tif(!local_defined('keyvalue') && string(self -> 'keyvalue') -> size);\n\t\t\t// use current record's keyvalue if any\n\t\t\tlocal('keyvalue'=(self -> 'keyvalue'));\n\t\t/if;\n\n\t\t// clear all search result vars\n\t\tself -> reset;\n\n\t\tfail_if: !(local_defined: 'keyvalue') && !(local_defined: 'lockvalue'), 7005, self -> error_msg(7005); // Either keyvalue or lockvalue must be specified for update or delete\n\t\tfail_if: (local_defined: 'keyvalue') && (self -> 'keyfield') == '', 7002, self -> error_msg(7002); // Keyfield not specified\n\t\tif: (local_defined: 'lockvalue');\n\t\t\tfail_if: (self -> 'lockfield') == '', 7003, self -> error_msg(7003); // Lockfield not specified\n\t\t\tif: !(local_defined: 'user') && ((self -> 'user') != '' || (self -> 'user') -> isa('user'));\n\t\t\t\t// use user from database object\n\t\t\t\tlocal('user' = (self -> 'user'));\n\t\t\t/if;\n\t\t\tfail_if: (local: 'user') == '' && !((local: 'user') -> isa('user')), 7004, self -> error_msg(7004); \n\t\t\t(self -> 'debug_trace') -> insert(tag_name ': user is type ' + (#user -> type) + ', isa(user) = ' + (#user -> isa('user')) );\n\t\t\tif: #user -> isa('user');\n\t\t\t\t#user= #user -> id_user;\n\t\t\t\tfail_if: #user == '', 7004, self -> error_msg(7004); // User must be logged in to get record with lock\n\t\t\t/if;\n\t\t\t(self -> 'debug_trace') -> insert(tag_name ': user id is ' + #user);\n\t\t/if;\n\t\t\n\t\tlocal: '_fields'=array;\n\t\t\n\t\tinline: (self -> 'db_connect'); // connection wrapper\n\n\t\t\t// handle record locking\n\t\t\tif: (self -> 'error_code') == 0 && (local: 'lockvalue') != '';\n\n\t\t\t\t// first check if record was locked by someone else, and that lock is still valid\n\t\t\t\tlocal: 'lockvalue'=(decrypt_blowfish: #lockvalue, -seed=(self -> 'lock_seed')) -> (split: '|');\n\t\t\t\tlocal: 'lock_timestamp'=date: (#lockvalue->size > 1 ? #lockvalue -> (get: 2) | null);\n\t\t\t\tlocal: 'lock_user'=(#lockvalue -> first);\n\t\t\t\tif: (date - #lock_timestamp) -> seconds < (self -> 'lock_expires')\n\t\t\t\t\t&& #lock_user != #user;\n\t\t\t\t\t// the lock is still valid and it is locked by another user\n\t\t\t\t\t(self -> 'error_code') = 7010; // Delete failed, record locked \n\t\t\t\t\t(self -> 'error_data') = (map: 'user' = #lock_user, 'timestamp' = #lock_timestamp);\n\t\t\t\t/if;\n\n\t\t\t\t// check that the current lock is still valid\n\t\t\t\tif: (self -> 'error_code') == 0;\n\t\t\t\t\tinline: -op='eq', (self -> 'lockfield')=#lockvalue -> (join: '|'), \n\t\t\t\t\t\t-maxrecords=1,\n\t\t\t\t\t\t-returnfield=(self -> 'lockfield'),\n\t\t\t\t\t\t-returnfield=(self -> 'keyfield'),\n\t\t\t\t\t\t-search;\n\t\t\t\t\t\tif: error_code == 0 && found_count != 1;\n\t\t\t\t\t\t\t// lock is not valid any more\n\t\t\t\t\t\t\t(self -> 'error_code') = 7011; // Delete failed, record lock not valid any more';\n\t\t\t\t\t\telse: error_code != 0;\n\t\t\t\t\t\t\t(self -> 'error_code') = 7019; // delete error\n\t\t\t\t\t\t\t(self -> 'error_data') = (map: 'error_code'=error_code, 'error_msg'=error_msg);\n\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t// lock OK, grab keyvalue for update\n\t\t\t\t\t\t\tlocal: 'keyvalue'=(field: (self -> 'keyfield'));\n\t\t\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': got keyvalue ' + #keyvalue + ' for keyfield ' + (self -> 'keyfield'));\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/inline;\n\t\t\t\t/if;\n\t\t\t\t\n\t\t\t/if;\n\n\t\t\tif: (self -> 'error_code') == 0 && (local: 'keyvalue') != '';\n\t\t\t\tif: (self -> 'isfilemaker');\n\t\t\t\t\tinline: -op='eq', (self -> 'keyfield')=#keyvalue, -search;\n\t\t\t\t\t\tif: found_count == 1;\n\t\t\t\t\t\t\t#_fields -> (insert: '-keyvalue'=keyfield_value);\n\t\t\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': FileMaker record id ' + keyfield_value);\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/inline;\n\t\t\t\telse;\n\t\t\t\t\t#_fields -> (insert: '-keyfield'=(self -> 'keyfield'));\n\t\t\t\t\t#_fields -> (insert: '-keyvalue'=#keyvalue);\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t\t\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': will delete record with params ' + #_fields);\n\t\t\t\n\t\t\tif: (#_fields >> '-keyfield' && #_fields -> (find: '-keyfield') -> first -> value != '' || (self -> 'isfilemaker'))\n\t\t\t\t&& #_fields >> '-keyvalue' && #_fields -> (find: '-keyvalue') -> first -> value != '';\n\t\t\t\t// ok to delete\n\t\t\telse;\n\t\t\t\t(self -> 'error_code') = 7006; // Delete failed, keyfield or keyvalue missing\n\t\t\t/if;\n\t\t\t\n\t\t\t// delete record\n\t\t\tif: (self -> 'error_code') == 0;\n\t\n\t\t\t\tlocal: 'querytimer'=knop_timer;\n\t\t\t\tinline: #_fields, -delete;\n\t\t\t\t\t(self -> 'querytime') = integer: #querytimer;\n\t\t\t\t\t(self -> 'searchparams') = #_fields;\n\t\t\t\t\n\t\t\t\t\tself -> capturesearchvars;\n\t\t\t\t\n\t\t\t\t/inline;\n\t\t\t/if;\n\t\t/inline;\n\t\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t(self -> 'debug_trace') -> (insert: tag_name + ': ' + (self -> error_msg) + ' ' + (self -> error_code) + ' ' + (self -> 'tagtime') + ' ms');\n\t/define_tag;\n\n\n\tdefine_tag: 'clearlocks', -description='Release all record locks for the specified user, suitable to use when showing record list. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-user (required) The user to unlock records for',\n\t\t-required='user';\n\t\t// release all record locks for the specified user, suitable to use when showing record list\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tfail_if: (self -> 'lockfield') == '', 7003, self -> error_msg(7003); // Lockfield not specified\n\t\tfail_if: #user == '', 7004, self -> error_msg(7004); // User not specified\n\t\n\t\tif: (self -> 'isfilemaker');\n\t\t\tinline: (self -> 'db_connect'),\n\t\t\t\t-maxrecords=all,\n\t\t\t\t(self -> 'lockfield')='\"' + #user + '|\"',\n\t\t\t\t-search;\n\t\t\t\tif: found_count > 0;\n\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': clearing locks for ' + #user + ' in ' + found_count + ' FileMaker records ' + error_msg + ' ' + error_code);\n\t\t\t\t\trecords;\n\t\t\t\t\t\tinline: -keyvalue=keyfield_value,\n\t\t\t\t\t\t\t(self -> 'lockfield')='',\n\t\t\t\t\t\t\t-update;\n\t\t\t\t\t\t\tif: error_code;\n\t\t\t\t\t\t\t\t(self -> 'error_code') = 7013; // Clearlocks failed\n\t\t\t\t\t\t\t\t(self -> 'error_data') = (map: 'error_code'=error_code, 'error_msg'=error_msg);\n\t\t\t\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': error when clearing lock on FileMaker record ' + keyfield_value + ' ' + error_msg + ' ' + error_code);\n\t\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t/inline;\n\t\t\t\t\t/records;\n\t\t\t\telse: error_code;\n\t\t\t\t\t(self -> 'error_code') = 7013; // Clearlocks failed\n\t\t\t\t\t(self -> 'error_data') = (map: 'error_code'=error_code, 'error_msg'=error_msg);\n\t\t\t\t/if;\n\t\t\t/inline;\n\t\telse;\n\t\t\tinline: (self -> 'db_connect'),\n\t\t\t\t-sql='UPDATE `' + (self -> 'table_realname') + '` SET `' + (self -> 'lockfield') + '`=\"\" WHERE `' + (self -> 'lockfield') \n\t\t\t\t\t+ '` LIKE \"' + (encode_sql: #user) + '|%\"';\n\t\t\t\tif: error_code != 0;\n\t\t\t\t\t(self -> 'error_code') = 7013; // Clearlocks failed\n\t\t\t\t\t(self -> 'error_data') = (map: 'error_code'=error_code, 'error_msg'=error_msg);\n\t\t\t\t/if;\n\t\t\t/inline;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': clearing all locks for ' + #user + ' ' + (self -> error_msg) + ' ' + (self -> error_code));\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\tdefine_tag: 'action_statement';\t\treturn: (self -> 'action_statement');\t/define_tag;\n\tdefine_tag: 'found_count';\t\t\treturn: (self -> 'found_count');\t\t/define_tag;\n\tdefine_tag: 'shown_count';\t\t\treturn: (self -> 'shown_count');\t\t/define_tag;\n\tdefine_tag: 'shown_first';\t\t\treturn: (self -> 'shown_first');\t\t/define_tag;\n\tdefine_tag: 'shown_last';\t\t\treturn: (self -> 'shown_last');\t\t\t/define_tag;\n\tdefine_tag: 'maxrecords_value';\t\treturn: (self -> 'maxrecords_value');\t/define_tag;\n\tdefine_tag: 'skiprecords_value';\treturn: (self -> 'skiprecords_value');\t/define_tag;\n\tdefine_tag: 'keyfield';\t\t\t\treturn: (self -> 'keyfield');\t\t\t/define_tag;\n\tdefine_tag: 'keyvalue';\t\t\t\treturn: (self -> 'keyvalue');\t\t\t/define_tag;\n\tdefine_tag: 'lockfield';\t\t\treturn: (self -> 'lockfield');\t\t\t/define_tag;\n\tdefine_tag: 'lockvalue';\t\t\treturn: (self -> 'lockvalue');\t\t\t/define_tag;\n\tdefine_tag: 'lockvalue_encrypted';\treturn: (self -> 'lockvalue_encrypted'); /define_tag;\n\tdefine_tag: 'querytime';\t\t\treturn: (self -> 'querytime');\t\t\t/define_tag;\n\tdefine_tag: 'inlinename';\t\t\treturn: (self -> 'inlinename');\t\t\t/define_tag;\n\tdefine_tag: 'searchparams';\t\t\treturn: (self -> 'searchparams');\t\t/define_tag;\n\tdefine_tag: 'resultset_count',\n\t\t-optional='inlinename';\n\t\t!local_defined('inlinename') ? local('inlinename'=(self -> 'inlinename'));\n\t\treturn((self -> 'resultset_count_map') -> find(#inlinename));\n\t/define_tag;\n\n\tdefine_tag('recorddata', -description='A map containing all fields, only available for single record results',\n\t\t-optional='recordindex', -copy);\n\t\t!local_defined('recordindex') ? local('recordindex'=(self -> 'current_record'));\n\t\t#recordindex < 1 ? #recordindex = 1;\n\t\tif(#recordindex == 1);\n\t\t\t// return default (i.e. first) record\n\t\t\treturn(self -> 'recorddata');\n\t\telse;\n\t\t\tlocal('recorddata'=map);\n\t\t\titerate(self -> field_names, local('field_name'));\n\t\t\t\t#recorddata -> insert(#field_name = (self -> 'records_array' -> get(#recordindex) \n\t\t\t\t\t-> get(self -> 'field_names_map' -> find(#field_name))));\n\t\t\t/iterate;\n\t\t\treturn(#recorddata);\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'records_array';\t\treturn: (self -> 'records_array');\t\t/define_tag;\n\t\n\tdefine_tag('field_names', -description='Returns an array of the field names from the last database query. If no database query has been performed, a \"-show\" request is performed. \\n\\\n\t\t\tParameters: \\n\\\n\t\t\t-table (optional) Return the field names for the specified table\\n\\\n\t\t\t-types (optional flag) If specified, returns a pair array with fieldname and corresponding Lasso data type',\n\t\t-optional='table',\n\t\t-optional='types');\n\t\t!local_defined('table') ? local('table'=(self -> 'table'));\n\t\tlocal('field_names'=(self -> 'field_names'));\n\t\tif(#field_names -> size == 0 || (local_defined('types') && #types != false));\n\t\t\t#field_names=array;\n\t\t\tif(local_defined('types') && #types != false);\n\t\t\t\tlocal('types_mapping'=map('text'='string', 'number'='decimal', 'date/time'='date'));\n\t\t\t/if;\n\t\t\tinline(self->'db_connect', -table=#table, -show);\n\t\t\t\tif(local_defined('types') && #types != false);\n\t\t\t\t\tloop(field_name(-count));\n\t\t\t\t\t\t#field_names -> insert(field_name(loop_count) = #types_mapping->find(field_name(loop_count, -type)));\n\t\t\t\t\t/loop;\n\t\t\t\telse;\n\t\t\t\t\t#field_names=field_names;\n\t\t\t\t/if;\n\t\t\t/inline;\n\t\t/if;\n\t\treturn(@#field_names);\n\t/define_tag;\n\t\n\tdefine_tag('table_names', -description='Returns an array with all table names for the database');\n\t\tlocal('table_names'=array);\n\t\tinline(self -> 'db_connect');\n\t\t\tDatabase_TableNames(self -> 'database');\n\t\t\t\t#table_names -> insert(Database_TableNameItem);\n\t\t\t/Database_TableNames;\n\t\t/inline;\n\t\treturn(@#table_names);\n\t/define_tag;\n\t\n\tdefine_tag: 'error_data', -description='Returns more info for those errors that provide such';\n\t\tif: (self -> 'errors_error_data') >> (self -> error_code);\n\t\t\treturn: (self -> 'error_data');\n\t\telse;\n\t\t\treturn: map;\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag('size');\n\t\treturn(self -> 'shown_count');\n\t/define_tag;\n\n\tdefine_tag('get', -required='index');\n\t\treturn(knop_databaserow(\n\t\t\t-record_array=(self -> 'records_array' -> get(#index)), \n\t\t\t-field_names=(self -> 'field_names')));\n\t/define_tag;\n\n\tdefine_tag('records', -description='Returns all found records as a knop_databaserows object',\n\t\t-optional='inlinename');\n\t\t!local_defined('inlinename') ? local('inlinename'=(self -> 'inlinename'));\n\t\tif((self -> 'databaserows_map') !>> #inlinename);\n\t\t\t// create knop_databaserows on demand\n\t\t\t(self -> 'databaserows_map') -> insert(#inlinename = knop_databaserows(\n\t\t\t\t\t-records_array=(self -> 'records_array'), \n\t\t\t\t\t-field_names=(self -> 'field_names'))\n\t\t\t\t);\n\t\t/if;\n\t\treturn(@((self -> 'databaserows_map') -> find(#inlinename)));\n\t/define_tag;\n\n\tdefine_tag('field', -description='A shortcut to return a specific field from a single record result',\n\t\t-required='fieldname',\n\t\t-optional='recordindex',\n\t\t-optional='index');\n\t\t!local_defined('recordindex') ? local('recordindex'=(self -> 'current_record'));\n\t\t#recordindex < 1 ? #recordindex = 1;\n\t\t!local_defined('index') ? local('index'=1);\n\t\tif(#recordindex == 1 && #index == 1);\n\t\t\t// return first field occurrence from the default (i.e. first) record\n\t\t\treturn((self -> 'recorddata') -> find(#fieldname));\n\t\telse(self -> 'field_names_map' >> #fieldname \n\t\t\t&& #recordindex >= 1 \n\t\t\t&& #recordindex <= (self -> 'records_array') -> size);\n\t\t\t// return specific record\n\t\t\tif(#index==1);\n\t\t\t\t// return first ocurrence of field name through the index map - this is faster\n\t\t\t\treturn(self -> 'records_array' -> get(#recordindex) -> get(self -> 'field_names_map' -> find(#fieldname)));\n\t\t\telse;\n\t\t\t\t// return another occurrence of the field - this is slightly slower\n\t\t\t\tlocal('indexmatches'=(self -> 'field_names') -> findposition(#fieldname));\n\t\t\t\tif(#index >= 1 && #index <= #indexmatches -> size);\n\t\t\t\t\treturn(self -> 'records_array' -> get(#recordindex) -> get(#indexmatches -> get(#index)));\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t/if;\n\t/define_tag;\n\t\n\tdefine_tag('next', -description='Increments the record pointer, returns true if there are more records to show, false otherwise.\\n\\\n\t\t\tUseful as an alternative to a regular records loop:\\n\\\n\t\t\t\\t$database -> select;\\n\\\n\t\t\t\\twhile: $database -> next;\\n\\\n\t\t\t\\t\\t$database -> field(\\'name\\');\\'
\\';\\n\\\n\t\t\t\\t/while;');\n\t\tif((self -> 'current_record') < (self -> 'shown_count'));\n\t\t\t(self -> 'current_record') += 1;\n\t\t\treturn(true);\n\t\telse;\n\t\t\t// reset record pointer\n\t\t\t(self -> 'current_record') = 0;\n\t\t\treturn(false);\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag('nextrecord', -description='Deprecated synonym for ->next');\n\t\t(self -> 'debug_trace') -> insert('*** DEPRECATION WARNING *** ' + tag_name + ' is deprecated, use ->next instead ');\n\t\treturn(self -> next);\n\t/define_tag;\n\n\tdefine_tag: 'trace', \n\t\t-optional='html',\n\t\t-optional='xhtml';\n\n\t\tlocal: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');\n\n\t\tlocal: 'eol'=(local_defined: 'html') || #endslash -> size ? '\\n' | '\\n';\n\n\t\treturn: #eol + 'Debug trace for database $' + (self -> varname) + ' (' (self -> 'database') '.' (self -> 'table') + ')' + #eol \n\t\t\t+ (self -> 'debug_trace') -> (join: #eol) + #eol;\n\n\t/define_tag;\n\n\n\t// =========== Internal member tags ===============\n\t\n\tdefine_tag: 'reset', -description='Internal, reset all search result vars';\n\t\t// reset all search result vars\n\t\t// searchresultvars\n\t\t(self -> 'action_statement') = null;\n\t\t(self -> 'found_count') = null;\n\t\t(self -> 'shown_first') = null;\n\t\t(self -> 'shown_last') = null;\n\t\t(self -> 'shown_count') = null;\n\t\t(self -> 'field_names') = null;\n\t\t(self -> 'records_array') = null;\n\t\t(self -> 'maxrecords_value') = null;\n\t\t(self -> 'skiprecords_value') = null;\n\t\t\n\t\t(self -> 'inlinename')=string;\n\t\t(self -> 'keyvalue')=null;\n\t\t(self -> 'lockvalue')=null;\n\t\t(self -> 'lockvalue_encrypted')=null;\n\t\t(self -> 'timestampfield')=string;\n\t\t(self -> 'timestampvalue')=string;\n\t\t(self -> 'searchparams')=string;\n\t\t(self -> 'querytime')=integer;\n\t\t(self -> 'recorddata')=map;\n\t\t(self -> 'message')=string;\n\t\t(self -> 'current_record')=0;\n\t\t(self -> 'field_names_map')=map;\n\n\t\t(self -> 'error_code')=0;\n\t\t(self -> 'error_msg')=string;\n\t/define_tag;\n\n\tdefine_tag: 'capturesearchvars', -description='Internal';\n\t\t// internal member tag\n\n\t\t// capture various result variables like found_count, shown_first, shown_last, shown_count\n\t\t// searchresultvars\n\t\t(self -> 'action_statement') = action_statement;\n\t\t(self -> 'found_count') = found_count;\n\t\t(self -> 'shown_first') = shown_first;\n\t\t(self -> 'shown_last') = shown_last;\n\t\t(self -> 'shown_count') = shown_count;\n\t\t(self -> 'field_names') = field_names;\n\t\t(self -> 'records_array') = records_array;\n\t\n\t\t!((self -> 'maxrecords_value') > 0) ? (self -> 'maxrecords_value') = maxrecords_value;\n\t\t!((self -> 'skiprecords_value') > 0) ? (self -> 'skiprecords_value') = skiprecords_value;\n\n\t\tlasso_tagexists('resultset_count') ? (self -> 'resultset_count_map') -> insert((self -> 'inlinename')=resultset_count);\n\t\titerate(field_names, local('field_name'));\n\t\t\t(self -> 'field_names_map') !>> #field_name \n\t\t\t\t? (self -> 'field_names_map') -> insert(#field_name=loop_count);\n\t\t/iterate;\n\t\t\n\t\t(self -> 'error_code') = error_code;\n\t\terror_code && error_msg -> size ? (self -> 'error_msg') = error_msg;\n\t\t\n\n\t\t// handle queries that use LIMIT\n\t\tif: !(self -> 'isfilemaker') && (string_findregexp: action_statement, -find= '\\\\sLIMIT\\\\s', -ignorecase) -> size;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': old found_count, shown_first and shown_last ' + (self -> 'found_count') + ' '+ (self -> 'shown_first') + ' '+ (self -> 'shown_last'));\n\t\t\t(self -> 'found_count') = knop_foundrows;\n\t\t\t// adjust shown_first and shown_last\n\t\t\t(self -> 'shown_first') = ((self -> 'found_count') ? (self -> 'skiprecords_value') + 1 | 0);\n\t\t\t(self -> 'shown_last') = integer(math_min(((self -> 'skiprecords_value') + (self -> 'maxrecords_value')), (self -> 'found_count')));\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': new found_count, shown_first and shown_last ' + (self -> 'found_count') + ' '+ (self -> 'shown_first') + ' '+ (self -> 'shown_last'));\n\t\t/if;\n\n\t\t// capture some variables for single record results\n\t\tif: found_count <= 1 // -update gives found_count 0 but still has one record result\n\t\t\t&& error_code == 0;\n\t\t\tif((self -> 'keyfield') != '' && string(field(self -> 'keyfield')) -> size);\n\t\t\t\t(self -> 'keyvalue')=field(self -> 'keyfield');\n\t\t\telse: (self -> 'keyfield') != '' && (self -> 'keyvalue') == '' && !(self -> 'isfilemaker');\n\t\t\t\t(self -> 'keyvalue')=keyfield_value;\n\t\t\t/if;\n\t\t\tif: lasso_currentaction == 'add' || lasso_currentaction == 'update';\n\t\t\t\t(self -> 'affectedrecord_keyvalue') = (self -> 'keyvalue');\n\t\t\t/if;\n\t\t\tif: (self -> 'lockfield') != ''; \n\t\t\t\t(self -> 'lockvalue')=(field: (self -> 'lockfield'));\n\t\t\t\t(self -> 'lockvalue_encrypted')=(encrypt_blowfish: (field: (self -> 'lockfield')), -seed=(self -> 'lock_seed'));\n\t\t\t/if;\n\t\t/if;\n\t\tif: error_code == 0;\n\t\t\t// populate recorddata with field values from the first found record\n\t\t\titerate: field_names, local: 'field_name';\n\t\t\t\t(self -> 'recorddata') !>> #field_name \n\t\t\t\t\t? (self -> 'recorddata') -> (insert: #field_name = (field: #field_name) );\n\t\t\t/iterate;\n\t\telse;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': ' + error_msg);\n\t\t/if;\n\t\t(self -> 'debug_trace') -> (insert: tag_name + ': found_count ' + (self -> 'found_count') + ' ' + (self -> 'keyfield') + ' '+ (field: (self -> 'keyfield')) + ' keyfield_value ' + keyfield_value + ' keyvalue ' + (self -> 'keyvalue') + ' fieldcount ' + (field_name: -count));\n\n\t/define_tag;\n\n/define_type;\n\n\ndefine_type('databaserows',\n\t-namespace='knop_');\n\tlocal('version'='2009-01-08',\n\t\t'description'='Custom type to return all record rows from knop_database. Used as output for knop_database->records. ');\n/*\n\nCHANGE NOTES\n2009-01-08\tJS\t->_unknowntag: Added -index parameter\n2008-11-24\tJS\tCreated the type\n\n\n*/\n\n\tlocal('records_array'=array,\n\t\t'field_names'=array,\n\t\t'field_names_map'=map,\n\t\t'current_record'=integer);\n\t\t\n\tdefine_tag('oncreate', -description='Create a record rows object. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-records_array (array) Array of arrays with field values for all fields for each record of all found records\n\t\t\t-field_names (array) Array with all the field names',\n\t\t-required='records_array',\n\t\t-required='field_names');\n\t\tself -> 'records_array'=#records_array;\n\t\tself -> 'field_names'=#field_names;\n\t\t// store indexes to first occurrence of each field name for faster access\n\t\titerate(#field_names, local('field_name'));\n\t\t\t(self -> 'field_names_map') !>> #field_name \n\t\t\t\t? (self -> 'field_names_map') -> insert(#field_name=loop_count);\n\t\t/iterate;\n\t/define_tag;\n\t\n\tdefine_tag('_unknowntag', -description='Shortcut to field',\n\t\t-optional='index');\n\t\t!local_defined('index') ? local('index'=1);\n\t\tif(self -> 'field_names' >> tag_name);\n\t\t\treturn(self -> field(tag_name(-index=#index)));\n\t\telse;\n\t\t\t//fail: -9948, self -> type + '->' + tag_name + ' not known.';\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag('onconvert', -description='Output the current record as a plain array of field values');\n\t\t!local_defined('recordindex') ? local('recordindex'=(self -> 'current_record'));\n\t\t#recordindex < 1 ? #recordindex = 1;\n\t\tif(#recordindex >= 1 \n\t\t\t&& #recordindex <= (self -> 'records_array' -> size));\n\t\t\treturn(self -> 'records_array' -> get(#recordindex));\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag('size');\n\t\treturn(self -> 'records_array' -> size);\n\t/define_tag;\n\n\tdefine_tag('get', -required='index');\n\t\treturn(knop_databaserow(-record_array=(self -> 'records_array' -> get(#index)), -field_names=(self -> 'field_names')));\n\t/define_tag;\n\n\tdefine_tag('field', -description='Return an individual field value',\n\t\t-required='fieldname',\n\t\t-optional='recordindex',\n\t\t-optional='index');\n\t\t!local_defined('recordindex') ? local('recordindex'=(self -> 'current_record'));\n\t\t#recordindex < 1 ? #recordindex = 1;\n\t\t!local_defined('index') ? local('index'=1);\n\t\tif(self -> 'field_names_map' >> #fieldname \n\t\t\t&& #recordindex >= 1 \n\t\t\t&& #recordindex <= (self -> 'records_array') -> size);\n\t\t\t// return specific record\n\t\t\tif(#index==1);\n\t\t\t\t// return first ocurrence of field name through the index map - this is faster\n\t\t\t\treturn(self -> 'records_array' -> get(#recordindex) -> get(self -> 'field_names_map' -> find(#fieldname)));\n\t\t\telse;\n\t\t\t\t// return another occurrence of the field - this is slightly slower\n\t\t\t\tlocal('indexmatches'=(self -> 'field_names') -> findposition(#fieldname));\n\t\t\t\tif(#index >= 1 && #index <= #indexmatches -> size);\n\t\t\t\t\treturn(self -> 'records_array' -> get(#recordindex) -> get(#indexmatches -> get(#index)));\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag('summary_header', -description='Returns true if the specified field name has changed since the previous record, or if we are at the first record',\n\t\t-required='fieldname');\n\t\tlocal('recordindex'=(self -> 'current_record'));\n\t\t#recordindex < 1 ? #recordindex = 1;\n\t\tif(#recordindex == 1 // first record\n\t\t\t|| self -> field(#fieldname) != self -> field(#fieldname, -recordindex=(#recordindex - 1)) ); // different than previous record (look behind)\n\t\t\treturn(true);\n\t\telse;\n\t\t\treturn(false);\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag('summary_footer', -description='Returns true if the specified field name will change in the following record, or if we are at the last record',\n\t\t-required='fieldname');\n\t\tlocal('recordindex'=(self -> 'current_record'));\n\t\t#recordindex < 1 ? #recordindex = 1;\n\t\tif(#recordindex == (self -> 'records_array') -> size // last record\n\t\t\t|| self -> field(#fieldname) != self -> field(#fieldname, -recordindex=(#recordindex + 1)) ); // different than next record (look ahead)\n\t\t\treturn(true);\n\t\telse;\n\t\t\treturn(false);\n\t\t/if;\n\t/define_tag;\n\n\n\tdefine_tag('next', -description='Increments the record pointer, returns true if there are more records to show, false otherwise.');\n\t\tif((self -> 'current_record') < (self -> 'records_array') -> size);\n\t\t\t(self -> 'current_record') += 1;\n\t\t\treturn(true);\n\t\telse;\n\t\t\t// reset record pointer\n\t\t\t(self -> 'current_record') = 0;\n\t\t\treturn(false);\n\t\t/if;\n\t/define_tag;\n/define_type;\n\n\n\ndefine_type('databaserow',\n\t-namespace='knop_',\n\t//-prototype, // prototype prevents the namespace from unloading without restart\n\t);\n\tlocal: 'version'='2009-01-08',\n\t\t'description'='Custom type to return individual record rows from knop_database. Used as output for knop_database->get. ';\n/*\n\nCHANGE NOTES\n2009-01-08\tJS\t->_unknowntag: Added -index parameter\n2008-11-24\tJS\t->field: Added -index parameter to be able to access any occurrence of the same field name\n2008-05-29\tJS\tRemoved -prototype since it prevents unloading the namespace. It is recommended to turn it on for best performance\n2008-05-27\tJS\tCreated the type\n\n\n*/\n\tlocal('record_array'=array,\n\t\t'field_names'=array);\n\t\t\n\tdefine_tag('oncreate', -description='Create a record row object. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-record_array (array) Array with field values for all fields for the record\n\t\t\t-field_names (array) Array with all the field names, should be same size as -record_array',\n\t\t-required='record_array',\n\t\t-required='field_names');\n\t\tself -> 'record_array'=#record_array;\n\t\tself -> 'field_names'=#field_names;\n\t/define_tag;\n\t\n\tdefine_tag('_unknowntag', -description='Shortcut to field',\n\t\t-optional='index');\n\t\t!local_defined('index') ? local('index'=1);\n\t\tif(self -> 'field_names' >> tag_name);\n\t\t\treturn(self -> field(tag_name, -index=#index));\n\t\telse;\n\t\t\t//fail: -9948, self -> type + '->' + tag_name + ' not known.';\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag('onconvert', -description='Output the record as a plain array of field values');\n\t\treturn(self -> 'record_array');\n\t/define_tag;\n\n\n\tdefine_tag('field', -description='Return an individual field value',\n\t\t-required='fieldname',\n\t\t-optional='index');\n\t\t!local_defined('index') ? local('index'=1);\n\t\tif(self -> 'field_names' >> #fieldname);\n\t\t\t// return any occurrence of the field\n\t\t\tlocal('indexmatches'=(self -> 'field_names') -> findposition(#fieldname));\n\t\t\tif(#index >= 1 && #index <= #indexmatches -> size);\n\t\t\t\treturn((self -> 'record_array') -> get(#indexmatches -> get(#index)));\n\t\t\t/if;\n\t\t/if;\n\t/define_tag;\n\n\n/define_type;\n?>\n[\n//------------------------------------------------------------------\n// End knop_database\n//------------------------------------------------------------------\n\n//##################################################################\n\n][\n//------------------------------------------------------------------\n// Begin knop_form\n//------------------------------------------------------------------\n\n]addfield: Added -template to specify field specific template \n2010-11-22\tSP\t->init: Correction of -lockvalue handling after L9 syntax adjustment\n2010-07-18\tSP\tAdded support for series for -options\n2010-06-10\tJS\t->renderform: avoid adding -upload parameters to post forms since it conflicts with file uploads (found by Steve Piercy)\n2010-04-21\tJS\t->renderhtml: removed encode_html for label\n2010-03-06\tSP\tChanged default behavior of ->updatefields with -sql to add backticks between the table and column names. Now JOINs may be used.\n2010-03-06\tSP\tAdded ->updatefields with -removedotbackticks for backward compatibility for fields that contain periods. If you use periods in a fieldname then you cannot use a JOIN in Knop.\n2009-11-11\tJS\tAdded class and id to optiongroup div that surrounds for checkbox and radio\n2009-11-11\tJS\tCorrected id for checkbox and radio option labels\n2009-10-02\tJS\tAdded id for labels, auto generated from the field's id with _label appended\n2009-09-16\tJS\tSyntax adjustments for Lasso 9\n2009-09-04\tJS\tChanged $__html_reply__ to content_body\n2009-09-04\tJS\t->renderhtml: corrected typ for autoparams\n2009-07-23\tJS\t->renderform: removed encode_html that somehow has reappeared for label. \n2009-07-10\tSP\tadded -maxlength option for text fields\n2009-06-26\tJS\t->oncreate: added deprecation warning for -action\n2009-06-22\tJS\t->addfield: corrected -options check to look for set instead of series (besides array)\n2009-04-16\tJS\t->loadfileds can now load field values from -params also inside an inline\n2009-03-20\tJS\tAdded around injected scripts for better xhtml compliance\n2009-01-08\tJS\t->getvalue and _unknowntag: added -index parameter to be able to get value for a specific field instance when there are multiple fields with the same name \n2009-01-08\tJS\t->loadfields: implemented support for multiple fields with the same name when loading field values from form submission where the number of same name fields matches\n2009-01-07\tJS\t->setvalue: added -index parameter to be able to set value for a specific field instance when there are multiple fields with the same name \n2008-12-08\tJS\t->renderform: Removed the onclick handlers for checkbox and radio since Safari now supports clicking the label text as click for the checkbox/radio control. \n2008-12-05\tJS\t->renderform: the fieldset and legend field types will now use id and class on the fieldset tag if specified\n2008-12-03\tJS\t->renderform: fields of type fieldset now uses value as legend (just as field type legend already did) instead of always using an empty legend\n2008-09-24\tJS\t->updatefields: Added protection against backtick sql injection in MySQL object names\n2008-09-17\tJS\t->renderform and ->renderhtml: -from and -to allows negative numbers to count from end of form instead\n2008-09-13\tJS\tAdded ->getlabel to return the display name for a field. \n2008-09-13\tJS\t->addfield and ->validate: Implemented -validate to specify a compound expression to validate the field input. \n2008-09-13\tJS\t->addfield and ->loadfields: Implemented -filter to specify a compound expression to filter the field input. \n2008-09-11\tJS\t->updatefields: fixed exclusion of special field types html, legend and fieldset. \n2008-09-11\tJS\t->renderform: Fixed missing value for password fields\n2008-07-02\tJS\t->renderform: Cleaned up the automatic adding of javascript code so it's not added if not needed. Also moved all scripts to the end of the page. More work with with the javascripts is needed.\n2008-06-03\tJS\t->renderform: corrected missing closing \n2008-05-15\tJS\t->renderform and ->renderhtml: adjusted the behavior for nested fieldsets\n2008-05-13\tJS\tImplemented -legend for ->renderhtml, to make it consistent with the new legend field type\n2008-05-13\tJS\tImplemented special field types html, fieldset and legend. Use -value to display data for these fields. A legend field also creates a fieldset (closes any previously open fieldsets). Use fieldset with -value=false to close a fieldset without opening a new one. \n2008-05-06\tJS\tAdded unknowntag as shortcut to getvalue\n2008-01-30\tJS\tRemoved duplicate endscript entries for if(dirty) {makedirty()};\n2007-12-13\tJS\tCorrected ->addfield: -dbfield so empty dbfields are properly ignored by ->updatefields. \n2007-12-11\tJS\tMoved error_msg to knop_base (special version of error_code stays here) \n2007-12-11\tJS\tAdded documentation as -description to most member tags, to be used by the new ->help tag\n2007-12-11\tJS\tMoved ->help to knop_base\n2007-11-13\tJS\tAdded -buttontemplate to be able to specify separate template for buttons, defaults to no
, but if template has been specified that will be used instead (for backwards compatibility)\n2007-11-12\tJS\t->process delete now works also when not using record locking (not specifying -user)\n2007-11-01\tJS\t->renderform: added support for -hint for textarea fields.\n2007-09-27\tJS\t->renderhtml: multiple values (array) for radio, checkbox and select are now rendered properly with either \",\" or
depending on the presence of -linebreak, and with the display text instead of the actual option value\n2007-09-27\tJS\t->renderform: improved handling of multiple values for checkbox, radio and select\n2007-09-21\tJS\t->addfield: flag parameters now accept false as value\n2007-09-06\tJS\t->oncreate: changed name of -action to -formaction to make it more clear what it is. -action is still supported but deprecated.\n2007-09-06\tJS\t->renderform: Corrected the exception for -session... (duh)\n2007-08-08\tJS\t->renderform: Added exception for -session\n2007-06-18\tJS\tAdded tag timer to most member tags\n2007-06-13\tJS\tadded inheritance from knop_base\n2007-06-12\tJC\tbugfixed -xhtml form rendering when called by quicksearch\n2007-06-11\tJC\tadded handling of xhtml output\n2007-04-19\tJS\t->loadfields: fixed -params that was broken when adding -database\n2007-04-19\tJS\t->renderform: removed invalid wrap=\"soft\" from textarea\n2007-04-12\tJS\t->process: made -user optional (only needed when using record locking)\n2007-04-12\tJS ->loadfields can now take a -database parameter, either as a flag (no value) where the database object connected to the form will be used, or by specifying a database object as value. \n2007-04-03\tJS\tChanged namespace from mt_ to knop_\n2007-03-01\tJS\t->renderform fixed unsavedwarning on page load by moving checkdirty() to afterscript\n2007-03-01\tJS\t->formmode and ->init changed so it preserves the right mode after a failed add\n2007-02-27\tJS\t->renderform: added
around checkboxes and radios for css formating\n2007-02-26\tJS\t->oncreate: added -actionpath to specify the framework action path for the form instead of manually adding the -action hidden field\n2007-02-24\tJS\tCorrected entersubmitblock behavior by adding onfocus handler on form and starting with submitBlock=false\n2007-02-23\tJS\tRemoved encode_html from form field labels\n2007-02-22\tJS\t->setformat: Added -legend\n2007-02-07\tJS\tAdded ->copyfield to copy a form field to a new name, with the same properties. \n2007-02-07\tJS\t->errors now returns empty array if validate has not been called, instead of performing validation\n2007-02-05\tJS\t->getbutton can now look for also button names that are not one of the built-in ones (for example button_apply)\n2007-02-05\tJS The -keyvalue parameter can be given another name by specifying -keyparamname in oncreate\n2007-02-02\tJS\tAdded ->lockvalue_decrypted\n2007-02-02\tJS\t->addfield: -value is now stored as reference\n2007-02-02\tJS\terror_code now returns an error for when the form contains validation errors\n2007-02-02\tJS\tImproved reporting of Lasso error messaged in error_msg\n2007-02-02\tJS \tAdded real error codes\n2007-01-31\tJS\t->rederform action_params now also exclude \"-\" params that appear in the form action\n2007-01-29\tJS\t->renderform: The first field with input error will get focus when loading page\n2007-01-29\tJS\tAdded -focus to ->addfield to give default field focus when loading page with form\n2007-01-29\tJS\tAdded -disabled to ->addfield, and handling of it in ->renderform\n2007-01-29\tJS\tAdded -noautoparams to ->oncreate to disable the automatic passing of action_params that begin with \"-\"\n2007-01-29\tJS\t->renderform now renders label also for submit, reset to format properly with css\n2007-01-26\tJS\tAdded support for Safari specific \n2007-01-26\tJS\t->renderform action_params that begin with \"-\" now exclude params that exist in the form. Minor corrections to the behavior. \n2007-01-25\tJS\tAdded -nowarning to ->oncreate to disable unsaved warnings for the entire form\n2007-01-25\tJS\tAdded -required to ->oncreate (and a few more from ->setformat)\n2007-01-23\tJS\tAutogenerates id for the form itself\n2007-01-23\tJS\tAdded ->getbutton to return the button that was clicked when submitting a form (cancel, add, save, delete)\n2007-01-23\tJS\tAdded auto conversion of options left hand pair member to string, to make comparsions work reliably. Integer zeros don't compare nicely to strings. \n2007-01-23\tJS\tAdded support for submit-on-enter prevention: specify -entersubmitblock at oncreate\n2007-01-19\tJS\tAddes renderform: -legend to be able to group form fields at render time\n2007-01-19\tJS\tadded support for -optgroup in -options for select. Also works for radio and checkbox. Specify empty -optgroup to close optgroup in select without starting a new, or to add extra linebreak between checkboxes/radio buttons. \n2007-01-19\tJS\tadded -template for oncreate\n2007-01-19\tJS\tadded optional fieldset and legend to form, legend can be specified as -legend at oncreate. if -legend is specified, the form will be wrapped in a fieldset. \n2007-01-19\tJS\tmethod now defaults to post\n2007-01-19\tJS\tCorrected line separator for FileMaker checkboxes and added the same handling also for radio\n2007-01-18\tJS\trenderform: any action_params that begin with \"-\" (except -keyvalue and -lockvalue) are added as form parameters\n2007-01-18\tJS\trenderform: checkboxes and multiselects now show checked and selected properly when loading values from database\n2007-01-18\tJS\tupdatefields: added support for multiple values for one fieldname, like checkboxes (multiple fields in the update pair array, -sql generates comma separated values)\n2007-01-17\tJS\treset button now makes form undirty\n2007-01-17\tJS\taddfield: -confirmmessage can now be specified for any submit or reset button\n2007-01-17\tJS\tadded addfield: -nowarning to avoid unsaved warning when the field is changed\n2007-01-17\tJS\tchanged default class name for unsaved marker from dirty to unsaved\n2007-01-17\tJS\tchanged name of -dirtymarker and -dirtymarkerclass to unsavedmarker and -unsavedmarkerclass for userfriendlyness\n2007-01-17\tJS\tadded setformat: -unsavedwarning to dynamically set the javascript form dirty warning message\n2007-01-17\tJS\trenderform: -field changed to renderform: -name for consistency\n2007-01-16\tJS\trenderform: -field with wrong field name does not output anything, instead of the entire form\n2007-01-16\tJS\tfixed onbeforeunload in javascript form dirty handler\n\nTODO:\n->addfield: Add -format to manipulate the field value before it is displayed by ->renderform and ->renderhtml, much like -filter but only for display and without affecting input. \n->addfield: Add -fieldgroup to be able to group related fields together, useful for ->updatefields to return just fields that belong to a specific db table, or ->renderform as another way to render a form selectively\n->renderform needs a better way to display errors inline together with the fields\nMake _unknowntag also work as shortcut to setvalue if a value is specified\nAdd a new special field type to the form object, let's say \"data\". That field type will not interact with forms and will never be touched by loadfields, but it will populate ->updatefields.\nAdd -> searchfields, which will return a fulltext enabled pair array better suited for searchs than ->updatefields is. -fulltext needs to be specified per field. \nReview and clean up the javascripts inserted automatically by knop_form - partially done\nOption to let textarea grow automatically depending on the amount of text in it. \nUse http://bassistance.de/jquery-plugins/jquery-plugin-validation/ instead of client side validation\nPossibly add support for the same validation expressions as the jquery validation plugin uses, so server side a nd client side validation can be specified at once. \nAdd -path as parameter for oncreate so the form action can be set with less confusion... In that case -formaction will be a physical url, while -path would be a framework path. \nFix actionpath reference so it updates properly when altering the value (not possible?)\nShould loadfields load \"-\" params?\nUnsavedwarning made optional, does not seem to work properly now?\nMore flexible error hightlighting\nMove templates to a member tag to be make it easier to subclass (Douglas Burchard)\nAdd \"button\". . Subtypes are submit, reset and button. How to specify the subtype? (Douglas Burchard)\nChange ->addfield to ->insert and make ->addfield deprecated\nThere is no src for input type image!\nAdd ->size and ->get so the form object can be iterated\nAdd -skipemtpy to to ->renderhtml\nOption for -> renderhtml to output without html encoding\n->renderhtml should never html encode fields of type html\n\n*/\n\t\n\n\t// instance variables\n\tlocal: 'fields'=array,\n\t\t'template'=string,\t\t\t// html template used to render the html form fields\n\t\t'buttontemplate'=string,\t// html template used to render the html buttons (submit, reset, image)\n\t\t'class'=string,\t\t\t\t// default class for all form fields, can be overridden field by field\n\t\t'errorclass'=string,\t\t// class used to highlight field labels when validation fails\n\t\t'formaction'=null,\n\t\t'method'='post',\n\t\t'fieldset'=false,\t\t\t// html form fieldset\n\t\t'legend'=null,\t\t\t\t// html form legend\n\t\t'name'=null,\n\t\t'id'=null,\n\t\t'raw'=null,\n\t\t'enctype'=null,\t\t\t\t// is automatically set to multipart/formdata if the form contains a file input\n\t\t'actionpath'=null,\n\t\t'noautoparams'=false,\t\t// if true then no parameters that begin with - will be automatically added to the form\n\t\t'fieldsource'=null,\t\t\t// the source of the latest -> loadfields, can be database, form or params\n\t\t'required'=string,\t\t\t// marker used to show fields that are required (html or plain string)\n\t\t'entersubmitblock'=false,\t// if true, a javascript will prevent form submit without clicking on submit button (like pressing enter key)\n\t\t'unsavedmarker'=null,\n\t\t'unsavedmarkerclass'=null,\n\t\t'unsavedwarning'=string,\t// must be specified, or else there is no unsaved warning for the form\n\t\t'database'=null,\n\t\t'keyparamname'=string,\t\t// param name to use instead of the default -keyvalue\n\t\t'formmode'=null,\t\t\t// whether the form is for editing an existing record or a blank for for adding a new record (edit/add)\n\t\t\t\t\t\t\t\t\t// only valid if a database object is specified\n\t\t'formbutton'=null,\t\t\t// the button that was clicked when submitting a form (cancel, add, save, delete)\n\t\t'db_keyvalue'=null,\n\t\t'db_lockvalue'=null,\n\t\t\n\t\t'render_fieldset_open'=false,\t// used when rendering to keep track of if a fieldset from fieldset or legend field types is open so it can be closed properly\n\t\t'render_fieldset2_open'=false,\t// used when rendering to keep track of if a fieldset from renderform or renderhtml legend is open so it can be closed properly\n\t\t'noscript'=false,\t\t\t\t// when set to true, no scripts will be injected by renderform\n\t\t'error_lang'=(knop_lang: -default='en', -fallback);\n\t\n\tlocal: 'errors'=null;\n\n\n\t// config vars\n\tlocal: 'validfieldtypes' = (map: 'text', 'password', 'checkbox', 'radio', 'textarea', 'select', 'file', 'search',\n\t\t\t\t'submit', 'reset', 'image', 'hidden', \n\t\t\t\t'fieldset', 'legend', 'html'), // special types\n\t\t'exceptionfieldtypes' = (map: 'file', 'submit', 'reset', 'image', 'addbutton', 'savebutton', 'deletebutton', 'cancelbutton',\n\t\t\t\t'fieldset', 'legend', 'html'); // special types\n\tlocal: 'validfieldtypes_array'=array;\n\titerate: #validfieldtypes, (local: 'temp');\n\t\t#validfieldtypes_array -> (insert: #temp -> name);\n\t/iterate;\n\tlocal: 'exceptionfieldtypes_array'=array;\n\titerate: #exceptionfieldtypes, (local: 'temp');\n\t\t#exceptionfieldtypes_array -> (insert: #temp -> name);\n\t/iterate;\n\t\n\t// page var to keep track of the number of forms that have been rendered on a page\n\tif: !(var_defined: 'knop_form_renderform_counter');\n\t\tvar: 'knop_form_renderform_counter'=0;\n\t/if;\n\t\n\n\tdefine_tag: 'oncreate', -description='Parameters:\\n\\\n\t\t\t-formaction (optional) The action atribute in the form html tag\\n\\\n\t\t\t-action (optional) Deprecated synonym to -formaction\\n\\\n\t\t\t-method (optional) Defaults to post\\n\\\n\t\t\t-name (optional)\\n\\\n\t\t\t-id (optional)\\n\\\n\t\t\t-raw (optional) Anything in this parameter will be put in the opening form tag\\n\\\n\t\t\t-actionpath (optional) Knop action path\\n\\\n\t\t\t-fieldset (optional)\\n\\\n\t\t\t-legend (optional string) legend for the entire form - if specified, a fieldset will also be wrapped around the form\\n\\\n\t\t\t-entersubmitblock (optional)\\n\\\n\t\t\t-noautoparams (optional)\\n\\\n\t\t\t-template (optional string) html template, defaults to #label# #field##required#
\\n\\\n\t\t\t-buttontemplate (optional string) html template for buttons, defaults to #field# but uses -template if specified\\n\\\n\t\t\t-required (optional string) character(s) to display for required fields (used for #required#), defaults to *\\n\\\n\t\t\t-class (optional string) css class name that will be used for the form element, default none\\n\\\n\t\t\t-errorclass (optional string) css class name that will be used for the label to highlight input errors, if not defined style=\"color: red\" will be used\\n\\\n\t\t\t-unsavedmarker (optional string) id for html element that should be used to indicate when the form becomes dirty. \\n\\\n\t\t\t-unsavedmarkerclass (optional string) class name to use for the html element. Defaults to \"unsaved\". \\n\\\n\t\t\t-unsavedwarning (optional string)\\n\\\n\t\t\t-keyparamname (optional)\\n\\\n\t\t\t-noscript (optional flag) if specified, don\\'t inject any javascript in the form. This will disable all client side functionality such as hints, focus and unsaved warnings. \\n\\\n\t\t\t-database (optional database) Optional database object that the form object will interact with',\n\t\t// parameters for form html tag attributes\n\t\t-optional='formaction',\n\t\t-optional='action',\n\t\t-optional='method',\n\t\t-optional='name',\n\t\t-optional='id',\n\t\t-optional='raw',\n\n\t\t// knop parameters\n\t\t-optional='actionpath',\n\t\t-optional='fieldset',\n\t\t-optional='legend', \n\t\t-optional='entersubmitblock',\n\t\t-optional='noautoparams',\n\t\t-optional='template', -type='string',\n\t\t-optional='buttontemplate', -type='string',\n\t\t-optional='required', -type='string',\n\t\t-optional='class', -type='string',\n\t\t-optional='errorclass', -type='string',\n\t\t-optional='unsavedmarker', -type='string',\n\t\t-optional='unsavedmarkerclass', -type='string',\n\t\t-optional='unsavedwarning', -type='string',\n\t\t-optional='keyparamname',\n\t\t-optional='noscript',\n\t\t-optional='database', -type='database';\n\t\tlocal: 'timer'=knop_timer; \n\n\n\t\tlocal_defined('method') ? (self -> 'method') = #method;\n\t\tlocal_defined('name') ? (self -> 'name') = #name;\n\t\tlocal_defined('id') ? (self -> 'id') = #id;\n\t\tlocal_defined('raw') ? (self -> 'raw') = #raw;\n\t\tlocal_defined('legend') ? (self -> 'legend') = #legend;\n\t\tlocal_defined('template') ? (self -> 'template') = #template;\n\t\tlocal_defined('buttontemplate') ? (self -> 'buttontemplate') = #buttontemplate;\n\t\tlocal_defined('required') ? (self -> 'required') = #required;\n\t\tlocal_defined('class') ? (self -> 'class') = #class;\n\t\tlocal_defined('errorclass') ? (self -> 'errorclass') = #errorclass;\n\t\tlocal_defined('unsavedmarker') ? (self -> 'unsavedmarker') = #unsavedmarker;\n\t\tlocal_defined('unsavedmarkerclass') ? (self -> 'unsavedmarkerclass') = #unsavedmarkerclass;\n\t\tlocal_defined('unsavedwarning') ? (self -> 'unsavedwarning') = #unsavedwarning;\n\t\tlocal_defined('keyparamname') ? (self -> 'keyparamname') = #keyparamname;\n\n\t\t// the following params are stored as reference, so the values of the params can be altered after adding a field simply by changing the referenced variable. \n\t\tlocal_defined('formaction') ? (self -> 'formaction') = @#formaction;\n\t\tlocal_defined('actionpath') ? (self -> 'actionpath') = @#actionpath;\n\t\tlocal_defined('database') ? (self -> 'database') = @#database;\n\n\t\tif: !(local_defined: 'formaction') && (local_defined: 'action');\n\t\t\t// keep support for old -action insead of -formaction\n\t\t\t(self -> 'debug_trace') -> insert('*** DEPRECATION WARNING *** ' + tag_name + ' -action parameter is deprecated, use -formaction instead ');\n\t\t\t(self -> 'formaction') = @#action;\n\t\t/if;\n\t\t\n\t\t(self -> 'noscript') = (local_defined('noscript') && #noscript != false);\n\n\t\t// default value\n\t\t!(local_defined: 'required') ? (self -> 'required' = '*');\n\t\t!(local_defined: 'keyparamname') ? (self -> 'keyparamname' = '-keyvalue');\n\n\t\t(self -> 'fieldset') = ((local_defined: 'fieldset') && #fieldset != false) || (self -> 'legend') != '';\n\t\t(self -> 'entersubmitblock') = (local_defined: 'entersubmitblock');\n\t\t(self -> 'noautoparams') = (local_defined: 'noautoparams');\n\n\n\t\tif: (self -> 'unsavedmarker') != '' && (self -> 'unsavedmarkerclass') == '';\n\t\t\t// set default unsavedmarkerclass\n\t\t\t(self -> 'unsavedmarkerclass')='unsaved';\n\t\t/if;\n\n\t\tif: (self -> 'unsavedwarning') == '';\n\t\t\t// set default dirtywarning message\n\t\t\t//(self -> 'unsavedwarning')='Det finns ändringar som inte har sparats - vill du fortsätta utan att spara?';\n\t\t/if;\n\t\t\n\t\t// escape quotes for javascript\n\t\t(self -> 'unsavedwarning') -> (replace: '\\'', '\\\\\\'');\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\t/*\n\tdefine_tag: 'onassign', -description='Internal, needed to restore references when ctype is defined as prototype',\n\t\t-required='value'; \n\t\t// recreate references here\n\n\t\titerate: (array: \n\t\t\t'formaction',\n\t\t\t'actionpath',\n\t\t\t'database'), (local: 'param');\n\t\t\t(self -> #param) = @(#value -> #param);\n\t\t/iterate;\n\n\t/define_tag;\n\t*/\n\t\n\tdefine_tag: 'onconvert', -description='Outputs the form data in very basic form, just to see what it contains',\n\t\t-optional='xhtml';\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tlocal: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');\n\n\t\tlocal: 'output'=string;\n\t\titerate: (self -> 'fields'), (local: 'fieldpair');\n\t\t\t#output += #fieldpair -> name + ' = ' + #fieldpair -> value + ' \\n';\n\t\t/iterate;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: #output;\n\t/define_tag;\n\t\n\tdefine_tag: '_unknowntag', -description='Shortcut to getvalue',\n\t\t-optional='index', -type='integer', -copy;\n\t\t!local_defined('index') ? local('index') = 1;\n\t\tif: (self -> 'fields') >> tag_name; // should be (self -> keys) but this is faster\n\t\t\treturn: (self -> (getvalue: tag_name, -index=#index));\n\t\telse;\n\t\t\t//fail: -9948, self -> type + '->' + tag_name + ' not known.';\n\t\t\t(self -> '_debug_trace') -> insert(self -> type + '->' + tag_name + ' not known.');\n\t\t/if;\n\t/define_tag;\n\t\n\tdefine_tag: 'addfield', -description='Inserts a form element in the form. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-type (required) Supported types are listed in form -> \\'validfieldtypes_array\\'. Also custom field types addbuton, savebutton or deletebutton are supported (translated to submit buttons with predefined names). \\\n\t\t\tFor the field types html, fieldset and legend use -value to specify the data to display for these fields. A legend field automatically creates a fieldset (closes any previously open fieldsets). Use fieldset with -value=false to close a fieldset without opening a new one. \\n\\\n\t\t\t-name (optional) Required for all input types except addbuton, savebutton, deletebutton, fieldset, legend and html\\n\\\n\t\t\t-id (optional) id for the html object, will be autogenerated if not specified\\n\\\n\t\t\t-dbfield (optional) Corresponding database field name (name is used if dbfield is not specified), or null/emtpy string if ignore this field for database\\n\\\n\t\t\t-value (optional) Initial value for the field\\n\\\n\t\t\t-hint (optional) Optional gray hint text to show in empty text field\\n\\\n -options (optional) For select, checkbox and radio, must be array, set or series. For select, the array can contain -optgroup=label to create an optiongroup. \\n\\ \n\t\t\t-multiple (optional flag) Used for select\\n\\\n\t\t\t-linebreak (optional flag) Put linebreaks between checkbox and radio values\\n\\\n\t\t\t-default (optional) Default text to display in a popup menu, will be selected (with empty value) if no current value is set. Is followed by an empty option. \\n\\\n\t\t\t-label (optional) Text label for the field\\n\\\n\t\t\t-size (optional) Used for text and select\\n\\\n\t\t\t-maxlength (optional) Used for text\\n\\\n\t\t\t-rows (optional) Used for textarea\\n\\\n\t\t\t-cols (optional) Used for textarea\\n\\\n\t\t\t-focus (optional flag) The first text field with this parameter specified will get focus when page loads\\n\\\n\t\t\t-class (optional)\\n\\\n\t\t\t-disabled (optional flag) The form field will be rendered as disabled\\n\\\n\t\t\t-raw (optional) Raw attributes that will be put in the html tag\\n\\\n\t\t\t-confirmmessage (optional) Message to show in submit/reset confirm dialog (delete button always shows confirm dialog)\\n\\\n\t\t\t-required (optional flag) If specified then the field must not be empty (very basic validation)\\n\\\n\t\t\t-validate (optional) Compound expression to validate the field input. The input can be accessed as params inside the expression which should either return true for valid input or false for invalid, or return 0 for valid input or a non-zero error code or error message string for invalid input. \\n\\\n\t\t\t-filter (optional) Compound expression to filter the input before it is loaded into the form by ->loadfields. The field value can be accessed as params inside the expression which should return the filtered field value. -filter is applied before validation. \\n\\\n\t\t\t-nowarning (optional flag) If specified then changing the field will not trigger an unsaved warning\\n\\\n\t\t\t-after (optional) Numeric index or name of field to insert after\\n\\\n\t\t\t-template (optional) Format string that will override global template or buttontemplate',\n\t\t-required='type',\n\t\t-optional='name',\n\t\t-optional='id',\t\n\t\t-optional='dbfield',\n\t\t-optional='value',\n\t\t-optional='hint',\n\t\t-optional='options',\n\t\t-optional='multiple',\n\t\t-optional='linebreak',\n\t\t-optional='default',\n\t\t-optional='label',\n\t\t-optional='size',\n\t\t-optional='maxlength',\n\t\t-optional='rows',\n\t\t-optional='cols',\n\t\t-optional='focus',\n\t\t-optional='class',\n\t\t-optional='disabled',\n\t\t-optional='raw',\n\t\t-optional='confirmmessage',\n\t\t-optional='required',\n\t\t-optional='validate', -type='tag',\n\t\t-optional='filter', -type='tag',\n\t\t-optional='nowarning',\n\t\t-optional='after',\n\t\t-optional='template';\n\t\t// TODO: add optiontemplate to be able to format individual options\n\t\tlocal: 'timer'=knop_timer; \n\t\t\n\t\tlocal: '_type'=(local: 'type'), '_name'=(local: 'name'), 'originaltype'=(local: 'type');\n\t\tif: (map: 'addbutton', 'savebutton', 'deletebutton', 'cancelbutton') >> #_type;\n\t\t\t#originaltype = #_type;\n\t\t\t#_name = 'button_' + #_type;\n\t\t\t#_name -> (removetrailing: 'button');\n\t\t\t#_type = 'submit';\n\t\telse: #_type == 'reset' && (local: 'name') == '';\n\t\t\t#_name = 'button_' + #_type;\n\t\telse: (map: 'legend', 'fieldset', 'html') >> #_type && (local: 'name') == '';\n\t\t\t#_name = #_type;\n\t\telse;\n\t\t\tfail_if: (local: 'name') == '', -9956, 'form->addfield missing required parameter -name';\n\t\t/if;\n\t\t\n\t\t\n\t\tfail_if: !((self -> 'validfieldtypes') >> #_type), 7102, self -> error_msg(7202);\n\t\tfail_if: (map: 'select', 'radio', 'checkbox') >> #_type \n\t\t\t&& (local: 'options') -> type != 'array' \n\t\t\t&& (local: 'options') -> type != 'set' \n\t\t\t&& (local: 'options') -> type != 'series', \n\t\t\t-9956, 'Field type ' #_type ' requires -options array, set or series'; \n\t\tlocal: 'index'= (self -> 'fields') -> size + 1;\n\t\t(local_defined: 'after') \t? (#after -> type == 'string' && (self -> 'fields') >> #after \n\t\t\t\t\t\t\t\t\t\t? #index = (integer: ((self -> 'fields') -> (findindex: #after) -> first)) + 1\n\t\t\t\t\t\t\t\t\t\t| #after -> type == 'integer' ? #index= #after + 1);\n\t\tif: #_type == 'file';\n\t\t\t(self -> 'enctype') ='multipart/form-data';\n\t\t\t(self -> 'method') = 'post';\n\t\t/if;\n\t\tlocal: 'field'=(map: \n\t\t\t'required'=(local_defined: 'required') \t\t&& #required != false,\n\t\t\t'multiple'=(local_defined: 'multiple') \t\t&& #multiple != false,\n\t\t\t'linebreak'=(local_defined: 'linebreak') \t&& #linebreak != false,\n\t\t\t'focus'=(local_defined: 'focus') \t\t\t&& #focus != false,\n\t\t\t'nowarning'=(local_defined: 'nowarning') \t&& #nowarning != false,\n\t\t\t'disabled'=(local_defined: 'disabled') \t\t&& #disabled != false\n\t\t\t);\n\t\tif: (self -> 'exceptionfieldtypes') >> #_type;\n\t\t\t// || (map: 'legend', 'fieldset', 'html') >> #_type;\n\t\t\t// never make certain field types required\n\t\t\t#field -> insert('required'=false);\n\t\t/if;\n\n\t\t#field -> (insert: 'type'=#_type);\n\t\t#field -> (insert: 'name'=#_name);\n\n\t\tlocal_defined('id') ? #field -> insert('id' = #id);\n\t\tlocal_defined('hint') ? #field -> insert('hint' = #hint);\n\t\tlocal_defined('default') ? #field -> insert('default' = #default); \n\t\tlocal_defined('label') ? #field -> insert('label' = #label); \n\t\tlocal_defined('size') ? #field -> insert('size' = #size); \n\t\tlocal_defined('maxlength') ? #field -> insert('maxlength' = #maxlength); \n\t\tlocal_defined('rows') ? #field -> insert('rows' = #rows); \n\t\tlocal_defined('cols') ? #field -> insert('cols' = #cols); \n\t\tlocal_defined('class') ? #field -> insert('class' = #class); \n\t\tlocal_defined('raw') ? #field -> insert('raw' = #raw); \n\t\tlocal_defined('confirmmessage') ? #field -> insert('confirmmessage' = #confirmmessage);\n\t\tlocal_defined('originaltype') ? #field -> insert('originaltype' = #originaltype);\n\t\t(local_defined: 'template') ? #field -> (insert: 'template'=#template);\n\n\t\t#field -> (insert: 'dbfield'=( (local_defined: 'dbfield') ? #dbfield | #_name ) );\n\t\t(local_defined: 'value') ? #field -> (insert: 'defaultvalue'=#value);\n\t\t\n\t\t// the following params are stored as reference, so the values of the params can be altered after adding a field simply by changing the referenced variable. \n\t\tlocal_defined('options') ? #field -> insert('options' = @#options);\n\t\tlocal_defined('value') ? #field -> insert('value' = @#value);\n\t\tlocal_defined('validate') ? #field -> insert('validate' = @#validate);\n\t\tlocal_defined('filter') ? #field -> insert('filter' = @#filter);\n\t\t\n\t\t(self -> 'fields') -> (insert: #_name = @#field, #index);\n\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'copyfield', -description='Copies a form field to a new name.',\n\t\t-required='name',\n\t\t-required='newname';\n\t\tlocal: 'timer'=knop_timer; \n\t\tfail_if: #name == #newname, 7104, self -> error_msg(7104);\n\t\tif: (self -> 'fields') >> #name;\n\t\t\tlocal: 'copyfield'=(self -> 'fields') -> (find: #name) -> first -> value;\n\t\t\t#copyfield -> (insert: 'name' = #newname);\n\t\t\t(self -> 'fields') -> (insert: #newname = #copyfield);\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\n\tdefine_tag: 'init', -description='Initiates form to grab keyvalue and set formmode if we have a database connected to the form. \\\n\t\t\tDoes nothing if no database is specified. ',\n\t\t-optional='get',\n\t\t-optional='post',\n\t\t-optional='keyvalue';\n\t\tlocal: 'timer'=knop_timer; \n\t\t// Initiates form to grab keyvalue and set formmode if we have a database connected to the form. \n\t\t// TODO: should we run init if form is not valid? Now we have a condition in lib before running init. \n\t\t// TODO: how can we get the right formmode when showing an add form again after failed validation? Now we have an extra condition in lib for this\n\t\t\n\t\tif: (self -> 'database') -> type == 'database';\n\t\t\t(self -> 'db_keyvalue') = null;\n\t\t\t(self -> 'db_lockvalue') = null;\n\t\t\tlocal: '_params'=array,\n\t\t\t\t'source'='form',\n\t\t\t\t'field'=map;\n\t\t\t#_params = array;\n\t\t\tif: (local_defined: 'post');\n\t\t\t\t#_params -> (merge: client_postparams);\n\t\t\t/if;\n\t\t\tif: (local_defined: 'get');\n\t\t\t\t#_params -> (merge: client_getparams);\n\t\t\t/if;\n\t\t\tif: !(local_defined: 'post') && !(local_defined: 'get');\n\t\t\t\t#_params -> (merge: client_postparams);\n\t\t\t\t#_params -> (merge: client_getparams);\n\t\t\t/if;\n\t\t\t(self -> 'debug_trace') -> (insert: 'Init ');\n\t\t\n\t\t\tif: #_params >> '-lockvalue';\n\t\t\t\tif: #_params -> type == 'map';\n\t\t\t\t\t(self -> 'db_lockvalue')=((#_params -> (find: '-lockvalue' ) ) != '' \n\t\t\t\t\t\t? (#_params -> (find: '-lockvalue' ) ) | null);\n\t\t\t\telse;\n\t\t\t\t\t(self -> 'db_lockvalue')=((#_params -> (find: '-lockvalue' ) -> first -> value) != '' \n\t\t\t\t\t\t? (#_params -> (find: '-lockvalue' ) -> first -> value) | null);\n\t\t\t\t/if;\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': grabbing lockvalue from form ' + (self -> 'db_lockvalue'));\n\t\t\telse: (local_defined: 'keyvalue');\n\t\t\t\t(self -> 'db_keyvalue') = #keyvalue;\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': grabbing keyvalue from parameter ' + (self -> 'db_keyvalue'));\n\t\t\telse: #_params >> (self -> 'keyparamname');\n\t\t\t\tif: #_params -> type == 'map';\n\t\t\t\t\t(self -> 'db_keyvalue')=((#_params -> (find: (self -> 'keyparamname') ) ) != '' \n\t\t\t\t\t\t? (#_params -> (find: (self -> 'keyparamname') ) ) | null);\n\t\t\t\telse;\n\t\t\t\t\t(self -> 'db_keyvalue')=((#_params -> (find: (self -> 'keyparamname') ) -> first -> value) != '' \n\t\t\t\t\t\t? (#_params -> (find: (self -> 'keyparamname') ) -> first -> value) | null);\n\t\t\t\t/if;\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': grabbing keyvalue from form ' + (self -> 'db_keyvalue'));\n\t\t\t/if;\n\t\t\tif: (self -> 'db_lockvalue') == '' && (self -> 'db_keyvalue') == '';\n\t\t\t\t// we have no keyvalue or lockvalue - this must be an add operation\n\t\t\t\t(self -> 'formmode') = 'add';\n\t\t\t\t// create a keyvalue for the record to add\n\t\t\t\t(self -> 'db_keyvalue') = knop_unique;\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': generating keyvalue ' + (self -> 'db_keyvalue'));\n\t\t\telse: (self -> getbutton) == 'add';\n\t\t\t\t(self -> 'formmode') = 'add';\n\t\t\telse: (self -> formmode)=='';\n\t\t\t\t(self -> 'formmode') = 'edit';\n\t\t\t/if;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': formmode ' + (self -> formmode));\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\n\tdefine_tag: 'loadfields', -description='Overwrites all field values with values from either database, action_params or explicit -params. \\\n\t\t\t\tAuto-detects based on current lasso_currentaction.\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t\t-params (optional) Array or map to take field values from instead of database or submit (using dbnames)\\n\\\n\t\t\t\t-get (optional flag) Only getparams will be used\\n\\\n\t\t\t\t-post (optional flag) Only postparams will be used\\n\\\n\t\t\t\t-inlinename (optional) The first record in the result from the specified inline will be used as field values\\n\\ \n\t\t\t\t-database (optional) If a database object is specified, the first record from the latest search result of the database object will be used. \\\n\t\t\t\t\tIf -database is specified as flag (no value) and the form object has a database object attached to it, that database object will be used.',\n\t\t-optional='params',\n\t\t-optional='post',\n\t\t-optional='get',\n\t\t-optional='inlinename',\n\t\t-optional='database';\n\t\tlocal: 'timer'=knop_timer; \n\t\tlocal: '_params'=array,\n\t\t\t'source'='form',\n\t\t\t'field'=map;\n\t\t(self -> 'fieldsource') = null;\n\t\tif: (local_defined: 'params');\n\t\t\t(self -> 'fieldsource') = 'params';\n\t\t\tlocal: 'source'='params';\n\t\t\t#_params = #params;\n\t\telse: (local_defined: 'database') && !(local_defined: 'inlinename');\n\t\t\tif: #database -> type == 'database';\n\t\t\t\tlocal: 'inlinename'=#database -> inlinename;\n\t\t\telse: self -> 'database' -> type == 'database';\n\t\t\t\tlocal: 'inlinename'=self -> 'database' -> inlinename;\n\t\t\t/if;\n\t\t/if;\n\t\t\t\n\t\tif: (local_defined: 'inlinename');\n\t\t\t(self -> 'fieldsource') = 'database';\n\t\t\tlocal: 'source'='params';\n\t\t\t#_params=map;\n\t\t\trecords: -inlinename=#inlinename;\n\t\t\t\tloop: (field_name: -count);\n\t\t\t\t\t#_params -> (insert: (field_name: loop_count) = (field: (field_name: loop_count)) );\n\t\t\t\t/loop;\n\t\t\t\tloop_abort;\n\t\t\t/records;\n\t\telse: (self -> 'fieldsource') == null && lasso_currentaction != 'nothing';\n\t\t\t(self -> 'fieldsource') = 'database';\n\t\t\tlocal: 'source'='database';\n\t\telse: (self -> 'fieldsource') == null;\n\t\t\t(self -> 'fieldsource') = 'form';\n\t\t\t#_params = array;\n\t\t\tif: (local_defined: 'post');\n\t\t\t\t#_params -> (merge: client_postparams);\n\t\t\t/if;\n\t\t\tif: (local_defined: 'get');\n\t\t\t\t#_params -> (merge: client_getparams);\n\t\t\t/if;\n\t\t\tif: !(local_defined: 'post') && !(local_defined: 'get');\n\t\t\t\t#_params -> (merge: client_postparams);\n\t\t\t\t#_params -> (merge: client_getparams);\n\t\t\t/if;\n\t\t/if;\n\t\t(self -> 'debug_trace') -> (insert: tag_name + ': loading field values from ' + (self -> 'fieldsource'));\n\t\tlocal('fieldnames_done'=map, 'fields_samename'=array, 'params_fieldname'=array);\n\t\titerate: (self -> 'fields'), (local: 'fieldpair');\n\t\t\t//#field = @(#fieldpair -> value);\n\t\t\tif: (self -> 'exceptionfieldtypes') !>> #fieldpair -> value -> (find: 'type') // do not load data for excluded form fields (maybe it should do that in some cases???)\n\t\t\t\t// && (map: 'legend', 'fieldset', 'html') !>> #fieldpair -> value -> (find: 'type')\n\t\t\t\t&& !(#fieldpair -> name -> (beginswith: '-')); // exclude field names that begin with \"-\"\n\t\t\t\tif(#fieldnames_done !>> #fieldpair -> name); // check if we are already done with this field name (for multiple fields with the same name)\n\t\t\t\t\t// find all fields with the same name\n\t\t\t\t\t#fields_samename = @((self -> 'fields') -> find(#fieldpair -> name));\n\t\t\t\t\t#params_fieldname = @(#_params -> find(#fieldpair -> name));\n\t\t\t\t\tif: #source == 'database' && found_count > 0;\n\t\t\t\t\t\t// load field values from database\n\t\t\t\t\t\tif: (#fieldpair -> value -> find: 'dbfield') != '';\n\t\t\t\t\t\t\t// first remove value to break reference\n\t\t\t\t\t\t\t(#fieldpair -> value) -> (remove: 'value');\n\t\t\t\t\t\t\t(#fieldpair -> value) -> (insert: 'value'=(field: (#fieldpair -> value -> find: 'dbfield')) );\n\t\t\t\t\t\t/if;\n\t\t\t\t\telse: #source == 'params';\n\t\t\t\t\t\t// load field values from explicit -params using dbfield names\n\t\t\t\t\t\tif: #_params >> (#fieldpair -> value -> find: 'dbfield') && (#fieldpair -> value -> find: 'dbfield') != '';\n\t\t\t\t\t\t\t// first remove value to break reference\n\t\t\t\t\t\t\t(#fieldpair -> value) -> (remove: 'value');\n\t\t\t\t\t\t\tif(#_params -> isa('map'));\n\t\t\t\t\t\t\t\t(#fieldpair -> value) -> (insert: 'value'=(#_params -> (find: (#fieldpair -> value -> find: 'dbfield') ) ) );\n\t\t\t\t\t\t\t/*else: #_params -> (find: (#fieldpair -> value -> find: 'dbfield') ) -> size > 1;\n\t\t\t\t\t\t\t\t// multiple field values\n\t\t\t\t\t\t\t\tlocal: 'valuearray'=array;\n\t\t\t\t\t\t\t\titerate: #_params -> (find: (#fieldpair -> value -> find: 'dbfield')), (local: 'parampair');\n\t\t\t\t\t\t\t\t\t#parampair -> value != '' ? #valuearray -> (insert: #parampair -> value);\n\t\t\t\t\t\t\t\t/iterate;\n\t\t\t\t\t\t\t\t(#fieldpair -> value) -> (insert: 'value'=#valuearray);*/\n\t\t\t\t\t\t\telse(#_params -> isa('array'));\n\t\t\t\t\t\t\t\t(#fieldpair -> value) -> (insert: 'value'=(#_params -> (find: (#fieldpair -> value -> find: 'dbfield')) -> first -> value) );\n\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t/if;\n\t\t\t\t\telse: #source == 'form';\n\t\t\t\t\t\t// load field values from form submission\n\t\t\t\t\t\titerate(#fields_samename, local('fieldpair_samename'));\n\t\t\t\t\t\t\t// first remove value to break reference\n\t\t\t\t\t\t\t(#fieldpair_samename -> value) -> (remove: 'value');\n\t\t\t\t\t\t\tif(#params_fieldname -> size == #fields_samename -> size);\n\t\t\t\t\t\t\t\t// the number of submitted fields match the number of fields in the form\n\t\t\t\t\t\t\t\t(#fieldpair_samename -> value) -> (insert: 'value'=(#params_fieldname -> get(loop_count) -> value) );\n\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\tif: #params_fieldname -> size > 1;\n\t\t\t\t\t\t\t\t\t// multiple field values\n\t\t\t\t\t\t\t\t\tlocal: 'valuearray'=array;\n\t\t\t\t\t\t\t\t\titerate: #_params -> (find: (#fieldpair -> name)), (local: 'parampair');\n\t\t\t\t\t\t\t\t\t\t#parampair -> value != '' ? #valuearray -> (insert: #parampair -> value);\n\t\t\t\t\t\t\t\t\t/iterate;\n\t\t\t\t\t\t\t\t\t(#fieldpair_samename -> value) -> (insert: 'value'=#valuearray);\n\t\t\t\t\t\t\t\telse: #_params >> (#fieldpair -> name);\n\t\t\t\t\t\t\t\t\t(#fieldpair_samename -> value) -> (insert: 'value'=(#_params -> (find: #fieldpair_samename -> name) -> first -> value) );\n\t\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\t\t(#fieldpair_samename -> value) -> (insert: 'value'='');\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t/iterate;\n\t\t\t\t\t\t#fieldnames_done -> insert(#fieldpair -> name);\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t\t// apply filtering of field value (do this for all instances of the same field name, so outside of the #fieldnames_done check\n\t\t\t\tif(#fieldpair -> value -> find('filter') -> isa('tag'));\n\t\t\t\t\t(#fieldpair -> value) -> insert('value'= (#fieldpair -> value -> find('filter')) -> run(-params=(#fieldpair -> value -> find('value'))));\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t/iterate;\n\t\t\n\t\t// capture keyvalue or lockvalue if we have a database object connected to the form\n\t\tif: (self -> 'database') -> type == 'database';\n\t\t\t//(self -> 'db_keyvalue') = null;\n\t\t\t//(self -> 'db_lockvalue') = null;\n\t\t\tif: (self -> 'fieldsource') == 'database';\n\t\t\t\tif: (self -> 'database') -> lockfield != '' && (self -> 'database') -> lockvalue != '';\n\t\t\t\t\t(self -> 'db_lockvalue') = (self -> 'database') -> lockvalue_encrypted;\n\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': grabbing lockvalue from database ' + (self -> 'db_lockvalue'));\n\t\t\t\telse: (self -> 'database') -> keyfield != '' && (self -> 'database') -> keyvalue != '';\n\t\t\t\t\t(self -> 'db_keyvalue') = (self -> 'database') -> keyvalue;\n\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': grabbing keyvalue from database ' + (self -> 'db_keyvalue'));\n\t\t\t\t/if;\n\t\t\telse;\n\t\t\t\tif: #_params >> '-lockvalue';\n\t\t\t\t\tif: #_params -> type == 'map';\n\t\t\t\t\t\t(self -> 'db_lockvalue')=((#_params -> (find: '-lockvalue' ) ) != '' \n\t\t\t\t\t\t\t? (#_params -> (find: '-lockvalue' ) ) | null);\n\t\t\t\t\telse;\n\t\t\t\t\t\t(self -> 'db_lockvalue')=((#_params -> (find: '-lockvalue' ) -> first -> value) != '' \n\t\t\t\t\t\t\t? (#_params -> (find: '-lockvalue' ) -> first -> value) | null);\n\t\t\t\t\t/if;\n\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': grabbing lockvalue from form ' + (self -> 'db_lockvalue'));\n\t\t\t\telse: #_params >> (self -> 'keyparamname');\n\t\t\t\t\tif: #_params -> type == 'map';\n\t\t\t\t\t\t(self -> 'db_keyvalue')=((#_params -> (find: (self -> 'keyparamname') ) ) != '' \n\t\t\t\t\t\t\t? (#_params -> (find: (self -> 'keyparamname') ) ) | null);\n\t\t\t\t\telse;\n\t\t\t\t\t\t(self -> 'db_keyvalue')=((#_params -> (find: (self -> 'keyparamname') ) -> first -> value) != '' \n\t\t\t\t\t\t\t? (#_params -> (find: (self -> 'keyparamname') ) -> first -> value) | null);\n\t\t\t\t\t/if;\n\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': grabbing keyvalue from form ' + (self -> 'db_keyvalue'));\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t\tif: (self -> 'db_lockvalue') == '' && (self -> 'db_keyvalue') == '';\n\t\t\t\t// we have no keyvalue or lockvalue - this must be an add operation\n\t\t\t\t(self -> 'formmode') = 'add';\n\t\t\t\t// create a keyvalue for the record to add\n\t\t\t\t(self -> 'db_keyvalue') = knop_unique;\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': generating keyvalue ' + (self -> 'db_keyvalue'));\n\t\t\telse: (self -> formmode) == '';\n\t\t\t\t(self -> 'formmode') = 'edit';\n\t\t\t/if;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': formmode ' + (self -> formmode));\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'clearfields', -description='Emtpies all form field values';\n\t\tlocal: 'timer'=knop_timer; \n\t\titerate: (self -> 'fields'), (local: 'fieldpair');\n\t\t\tif: (self -> 'exceptionfieldtypes') !>> #fieldpair -> value -> (find: 'type');\n\t\t\t\t// && (map: 'legend', 'fieldset', 'html') !>> #fieldpair -> value -> (find: 'type');\n\t\t\t\t// first remove value to break reference\n\t\t\t\t(#fieldpair -> value) -> (remove: 'value');\n\t\t\t\t(#fieldpair -> value) -> (insert: 'value'='');\n\t\t\t/if;\n\t\t/iterate;\t\n\t\tif: (self -> 'database') -> type == 'database';\n\t\t\t(self -> 'db_keyvalue') = null;\n\t\t\t(self -> 'db_lockvalue') = null;\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'resetfields', -description='Resets all form field values to their initial values';\n\t\tlocal: 'timer'=knop_timer; \n\t\titerate: (self -> 'fields'), (local: 'fieldpair');\n\t\t\tif: (self -> 'exceptionfieldtypes') !>> #fieldpair -> value -> (find: 'type');\n\t\t\t\t//&& (map: 'legend', 'fieldset', 'html') !>> #fieldpair -> value -> (find: 'type');\n\t\t\t\t// first remove value to break reference\n\t\t\t\t(#fieldpair -> value) -> (remove: 'value');\n\t\t\t\t(#fieldpair -> value) -> (insert: 'value'=#fieldpair -> value -> (find: 'defaultvalue'));\n\t\t\t/if;\n\t\t/iterate;\t\n\t\tif: (self -> 'database') -> type == 'database';\n\t\t\t(self -> 'db_keyvalue') = null;\n\t\t\t(self -> 'db_lockvalue') = null;\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'validate', -description='Performs validation and fills a transient array with field names that have input errors. \\\n\t\t\t\t form -> loadfields must be called first.';\n\t\tlocal: 'timer'=knop_timer; \n\t\t\n\t\t// Performs validation and fills a transient array with field names that have input errors.\n\t\t// Must call -> loadfields first\n\t\tif: (self -> 'errors') == null;\n\t\t\t// initiate the errors array so we know validate has been performed\n\t\t\t(self -> 'errors') = array;\n\t\t\titerate: (self -> 'fields'), (local: 'fieldpair');\n\t\t\t\tif: !( (self -> 'exceptionfieldtypes') >> #fieldpair -> value -> (find: 'type') );\n\t\t\t\t\tif: (#fieldpair -> value -> (find: 'required') ) \n\t\t\t\t\t\t&& (#fieldpair -> value -> (find: 'value') ) == '';\n\t\t\t\t\t\t(self -> 'errors') -> (insert: (#fieldpair -> value -> (find: 'name') ));\n\t\t\t\t\t/if;\n\t\t\t\t\tif(#fieldpair -> value -> find('validate') -> isa('tag'));\n\t\t\t\t\t\t// perform validation expression on the field value\n\t\t\t\t\t\tlocal('result'=(#fieldpair -> value -> find('validate')) -> run(-params=#fieldpair -> value -> find('value')));\n\t\t\t\t\t\tif(#result === true || #result === 0);\n\t\t\t\t\t\t\t// validation was ok\n\t\t\t\t\t\telse(#result != 0 || #result -> size);\n\t\t\t\t\t\t\t// validation result was an error code or message\n\t\t\t\t\t\t\t(self -> 'errors') -> insert(#fieldpair -> value -> find('name') = #result);\n\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t(self -> 'errors') -> insert(#fieldpair -> value -> find('name'));\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t/if;\n\t\t(self -> 'debug_trace') -> (insert: tag_name + ': form is valid ' + ((self -> 'errors') -> size == 0));\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'isvalid', -description='Returns the result of form -> validate (true/false) without performing the validation again (unless it hasn\\'t been performed already)';\n\t\tlocal: 'timer'=knop_timer; \n\t\t// Returns the result of -> validate (true/false) without performing the validation again (unless it is needed)\n\t\t(self -> 'errors') == null ? self -> validate;\n\t\t(self -> 'debug_trace') -> (insert: tag_name + ': form is valid ' + ((self -> 'errors') -> size == 0));\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: (self -> 'errors') -> size == 0;\n\t/define_tag;\n\n\n\tdefine_tag: 'adderror', -description='adds the name for a field that has validation error, used for custom field validation. \\\n\t\t\t\tcalls form -> validate first if needed',\n\t\t-required='fieldname';\n\t\tlocal: 'timer'=knop_timer; \n\t\t// adds a field that has error\n\t\t// calls ->validate first if needed, to make sure self -> 'errors' is an array\n\t\t(self -> 'errors') == null ? self -> validate;\n\t\t(self -> 'errors') -> (insert: #fieldname);\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\n\tdefine_tag: 'errors', -description='Returns an array with fields that have input errors, or empty array if no errors or form has not been validated';\n\t\t// returns an array with fields that have input errors, or emtpy array if no errors or form has not been validated\n\t\tif: (self -> 'errors') == null;\n\t\t\treturn: array;\n\t\telse;\n\t\t\treturn: (self -> 'errors');\n\t\t/if;\n\t/define_tag;\n\n\n\n\tdefine_tag: 'updatefields', -description='Returns a pair array with fieldname=value, or optionally SQL string to be used in an update inline.\\\n\t\tform -> loadfields must be called first.\\n\\\n\t\tParameters:\\n\\\n\t\t-sql (optional)\\n\\\n\t\t-removedotbackticks (optional flag) Use with -sql for backward compatibility for fields that contain periods. If you use periods in a fieldname then you cannot use a JOIN in Knop.',\n\t\t-optional='sql',\n\t\t-optional='removedotbackticks';\n\t\tlocal: 'timer'=knop_timer; \n\t\t// Returns a pair array with fieldname=value, or optionally SQL string to be used in an update inline. Optionally use -removedotbackticks with -sql for backward compatibility with fields that contain periods.\n\t\t// Must call ->loadfields first.\n\t\tlocal: 'output'=array,\n\t\t\t'_sql'=(local_defined: 'sql'),\n\t\t\t'_removedotbackticks'=(local_defined: 'removedotbackticks'),\n\t\t\t'fieldvalue'=null, 'onevalue'=null;\n\t\titerate: (self -> 'fields'), (local: 'fieldpair');\n\t\t\tif: !( (self -> 'exceptionfieldtypes') >> #fieldpair -> value -> (find: 'type') )\n\t\t\t\t&& !(#fieldpair -> value -> (find: 'name') -> (beginswith: '-'))\n\t\t\t\t&& (#fieldpair -> value -> (find: 'dbfield')) != '';\n\t\t\t\t// don't use submit etc and exclude fields whose name begins with -\n\t\t\t\t#fieldvalue = (#fieldpair -> value -> (find: 'value') );\n\t\t\t\tif: #fieldvalue -> type != 'array';\n\t\t\t\t\t// to support multiple values for one fieldname, like checkboxes\n\t\t\t\t\t#fieldvalue = array: #fieldvalue;\n\t\t\t\t/if;\n\t\t\t\tif: #_sql;\n\t\t\t\t\tif(#_removedotbackticks);\n\t\t\t\t\t\t#output -> (insert: '`' + (encode_sql(knop_stripbackticks(#fieldpair -> value -> find('dbfield'))) ) + '`' \n\t\t\t\t\t\t\t+ '=\"' + (encode_sql: (#fieldvalue -> (join: ',')) ) + '\"');\n\t\t\t\t\telse;\n\t\t\t\t\t\t#output -> (insert: '`' + (encode_sql(string_replace(knop_stripbackticks(#fieldpair -> value -> find('dbfield')), -find='.', -replace='`.`')) ) + '`' \n\t\t\t\t\t\t+ '=\"' + (encode_sql: (#fieldvalue -> (join: ',')) ) + '\"');\n\t\t\t\t\t/if;\n\t\t\t\telse;\n\t\t\t\t\titerate: #fieldvalue, #onevalue;\n\t\t\t\t\t\t#output -> (insert: (#fieldpair -> value -> (find: 'dbfield') ) \n\t\t\t\t\t\t\t= #onevalue );\n\t\t\t\t\t/iterate;\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t/iterate;\n\t\tif: #_sql;\n\n\t\t\t#output = '(' + #output -> (join: ',') + ')';\n\n\t\t/if;\n\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @#output;\n\t\t\n\t/define_tag;\n\t\n\t\n\tdefine_tag: 'getbutton', -description='Returns what button was clicked on the form on the previous page. Assumes that submit buttons are named button_add etc. \\\n\t\t\t\tReturns add, update, delete, cancel or any custom submit button name that begins with button_.';\n\t\tlocal: 'timer'=knop_timer; \n\t\tif: (self -> 'formbutton') != '';\n\t\t\t// we have already found out once what button was clicked\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': cached ' + (self -> 'formbutton'));\n\t\t\tself -> 'tagtime_tagname'=tag_name;\n\t\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t\treturn: (self -> 'formbutton');\n\t\t/if;\n\t\tlocal: 'clientparams'=client_getparams;\n\t\t#clientparams -> (merge: client_postparams);\n\t\t// look for submit buttons, the least destructive first\n\t\titerate: (array: 'cancel', 'save', 'add', 'delete'), (local: 'buttonname');\n\t\t\tif: #clientparams >> 'button_' + #buttonname \n\t\t\t\t|| #clientparams >> 'button_' + #buttonname + '.x'\n\t\t\t\t|| #clientparams >> 'button_' + #buttonname + '.y';\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': built-in button name ' + #buttonname);\n\t\t\t\t(self -> 'formbutton') = #buttonname;\n\t\t\t\tself -> 'tagtime_tagname'=tag_name;\n\t\t\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t\t\treturn: #buttonname;\n\t\t\t/if;\n\t\t/iterate;\n\t\t// no button found yet - look for custom button names\n\t\titerate: #clientparams, #buttonname;\n\t\t\t#buttonname -> type == 'pair' ? #buttonname = #buttonname -> name;\n\t\t\tif: #buttonname -> (beginswith: 'button_');\n\t\t\t\t#buttonname -> (removeleading: 'button_') & (removetrailing: '.x') & (removetrailing: '.y');\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': custom button name ' + #buttonname);\n\t\t\t\t(self -> 'formbutton') = #buttonname;\n\t\t\t\tself -> 'tagtime_tagname'=tag_name;\n\t\t\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t\t\treturn: #buttonname;\n\t\t\t/if;\n\t\t/iterate;\n\t\t(self -> 'debug_trace') -> (insert: tag_name + ': No button found');\n\t/define_tag;\n\t\n\tdefine_tag: 'process', -description='Automatically handles a form submission and handles add, update, or delete. \\\n\t\t\t\tRequires that a database object is specified for the form',\n\t\t-optional='user',\n\t\t-optional='lock',\n\t\t-optional='keyvalue';\n\t\tlocal: 'timer'=knop_timer; \n\t\tfail_if: (self -> 'database') -> type != 'database', 7103, self -> error_msg(7103);\n\n\t\t(self -> 'error_code') = 0;\n\t\t(self -> 'error_msg') = string;\n\t\t\n\t\tif: self -> getbutton == 'cancel';\n\t\t\t// do nothing at all\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': cancelling ');\n\t\t\t\n\t\telse: self -> getbutton == 'save';\n\t\t\tself -> loadfields;\n\t\t\tif: self -> isvalid;\n\t\t\t\tif: (local_defined: 'user') && (self -> lockvalue) != '';\n\t\t\t\t\t(self -> database) -> (saverecord: (self -> updatefields), -lockvalue=(self -> lockvalue), -keyvalue=(self -> keyvalue), -user=#user);\n\t\t\t\telse;\n\t\t\t\t\t(self -> database) -> (saverecord: (self -> updatefields), -keyvalue=(self -> keyvalue));\n\t\t\t\t/if;\n\t\t\t\tif: self -> database -> error_code != 0;\n\t\t\t\t\t(self -> 'error_code') = self -> database -> error_code;\n\t\t\t\t\t(self -> 'error_msg') = 'Process: update record error ' + (self -> database -> error_msg);\n\t\t\t\t/if;\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': updating record ' + (self -> database -> error_msg) + ' ' + (self -> database -> error_code));\n\t\t\telse;\n\t\t\t\t(self -> 'error_code') = 7101; // Process: update record did not pass form validation\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': update record did not pass form validation');\n\t\t\t/if;\n\t\t\n\t\telse: self -> getbutton == 'add';\n\t\t\tself -> loadfields;\n\t\t\tif: self -> isvalid;\n\t\t\t\t(self -> database) -> (addrecord: (self -> updatefields), -keyvalue=(self -> keyvalue));\n\t\t\t\tif: self -> database -> error_code != 0;\n\t\t\t\t\t(self -> 'error_code') = self -> database -> error_code;\n\t\t\t\t\t(self -> 'error_msg') = 'Process: add record error ' + (self -> database -> error_msg);\n\t\t\t\t/if;\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': adding record ' + (self -> database -> error_msg) + ' ' + (self -> database -> error_code));\n\t\t\telse;\n\t\t\t\t(self -> 'error_code') = 7101; // Process: add record did not pass form validation\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': add record did not pass form validation');\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': reverting form mode to add');\n\t\t\t/if;\n\n\t\telse: self -> getbutton == 'delete';\n\t\t\tself -> loadfields;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': will delete record with keyvalue ' + (self -> keyvalue) + ' lockvalue ' + (self -> lockvalue));\n\t\t\tif: (local_defined: 'user') && (self -> lockvalue) != '';\n\t\t\t\t(self -> database) -> (deleterecord: -lockvalue=(self -> lockvalue), -keyvalue=(self -> keyvalue), -user=#user);\n\t\t\telse;\n\t\t\t\t(self -> database) -> (deleterecord: -keyvalue=(self -> keyvalue));\n\t\t\t/if;\n\t\t\tif: self -> database -> error_code == 0;\n\t\t\t\tself -> resetfields;\n\t\t\telse;\n\t\t\t\t(self -> 'error_code') = self -> database -> error_code;\n\t\t\t\t(self -> 'error_msg') = 'Process: delete record error ' + (self -> database -> error_msg);\n\t\t\t/if;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': deleting record ' + (self -> database -> error_msg) + ' ' + (self -> database -> error_code));\n\t\telse: false;\n\t\t\t// do not go here, database record should be loaded with a separate call\n\t\t\tif: (local_defined: 'lock');\n\t\t\t\tself -> database ->(getrecord: (local: 'keyvalue'), -lock, -user=#user);\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': loading record using lock' + (self -> database -> error_msg) + ' ' + (self -> database -> error_code));\n\t\t\telse;\n\t\t\t\tself -> database ->(getrecord: (local: 'keyvalue'), -user=#user);\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': loading record' + (self -> database -> error_msg) + ' ' + (self -> database -> error_code));\n\t\t\t/if;\n\t\t\tself -> (loadfields: -inlinename=(self -> database -> inlinename));\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'setformat', -description='Defines a html template for the form. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-template (optional string) html template, defaults to #label# #field##required#
\\n\\\n\t\t\t-buttontemplate (optional string) html template for buttons, defaults to #field#\\n\\\n\t\t\t-required (optional string) character(s) to display for required fields (used for #required#), defaults to *\\n\\\n\t\t\t-legend (optional string) legend for the entire form - if specified, a fieldset will also be wrapped around the form\\n\\\n\t\t\t-class (optional string) css class name that will be used for the form element, default none\\n\\\n\t\t\t-errorclass (optional string) css class name that will be used for the label to highlight input errors, if not defined style=\"color: red\" will be used\\n\\\n\t\t\t-unsavedmarker (optional string) \\n\\\n\t\t\t-unsavedmarkerclass (optional string) \\n\\\n\t\t\t-unsavedwarning (optional string)',\n\t\t-optional='template', -type='string',\n\t\t-optional='buttontemplate', -type='string',\n\t\t-optional='required', -type='string',\n\t\t-optional='legend', -type='string',\n\t\t-optional='class', -type='string',\n\t\t-optional='errorclass', -type='string',\n\t\t-optional='unsavedmarker', -type='string',\n\t\t-optional='unsavedmarkerclass', -type='string',\n\t\t-optional='unsavedwarning', -type='string';\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tlocal_defined('template') ? (self -> 'template') = #template;\n\t\tlocal_defined('buttontemplate') ? (self -> 'buttontemplate') = #buttontemplate;\n\t\tlocal_defined('required') ? (self -> 'required') = #required;\n\t\tlocal_defined('legend') ? (self -> 'legend') = #legend;\n\t\tlocal_defined('class') ? (self -> 'class') = #class;\n\t\tlocal_defined('errorclass') ? (self -> 'errorclass') = #errorclass;\n\t\tlocal_defined('unsavedmarker') ? (self -> 'unsavedmarker') = #unsavedmarker;\n\t\tlocal_defined('unsavedmarkerclass') ? (self -> 'unsavedmarkerclass') = #unsavedmarkerclass;\n\t\tlocal_defined('unsavedwarning') ? (self -> 'unsavedwarning') = #unsavedwarning;\n\n\t\tif: local_defined: 'unsavedwarning';\n\t\t\t// escape quotes for javascript\n\t\t\t(self -> 'unsavedwarning') -> (replace: '\\'', '\\\\\\'');\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\n\tdefine_tag: 'renderform', -description='Outputs HTML for the form fields, a specific field, a range of fields or all fields of a specific type. \\\n\t\t\tAlso inserts all needed javascripts into the page. \\\n\t\t\tUse form -> setformat first to specify the html format, otherwise default format #label# #field##required#
is used. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-name (optional) Render only the specified field\\n\\\n\t\t\t-from (optional) Render form fields from the specified number index or field name. Negative number count from the last field.\\n\\\n\t\t\t-to (optional) Render form fields to the specified number index or field name. Negative number count from the last field.\\n\\\n\t\t\t-type (optional) Only render fields of this or these types (string or array)\\n\\\n\t\t\t-excludetype (optional) Render fields except of this or these types (string or array)\\n\\\n\t\t\t-legend (optional) Groups the rendered fields in a fieldset and outputs a legend for the fieldset\\n\\\n\t\t\t-start (optional) Only render the starting
tag\\n\\\n\t\t\t-end (optional) Only render the ending
tag\\n\\\n\t\t\t-xhtml (optional flag) XHTML valid output',\n\t\t-optional='name', -copy, \t// field name\n\t\t-optional='from', -copy, \t// number index or field name\n\t\t-optional='to', -copy, \t\t// number index or field name\n\t\t-optional='type', -copy,\t// only output fields of this or these types (string or array)\n\t\t-optional='excludetype', -copy,\t// output fields except of this or these types (string or array)\n\t\t-optional='legend',\t\t\t// groups the rendered fields in a fieldset and outputs a legend for the fieldset\n\t\t-optional='start',\t\t\t// only output the starting
tag\n\t\t-optional='end',\t\t\t// only output the ending
tag\n\t\t-optional='xhtml';\t\t\t// boolean, if set to true adjust output for XHTML\n\t\tlocal: 'timer'=knop_timer; \n\t\thandle;knop_debug('Done with ' + self->type + ' -> ' + tag_name, -time, -type=self->type);/handle;\n\t\t\n\t\t// Outputs HTML for the form fields\n\t\t\n\t\t/*\n\t\t\tTODO: \n\t\t\tHandling of multiple fields with the same name\n\t\t*/\n\t\tlocal: 'output'=string, \n\t\t\t'onefield'=map, \n\t\t\t'renderfield'=string, \n\t\t\t'renderfield_base'=string, \n\t\t\t'renderrow'=string,\n\t\t\t'formid'=null,\n\t\t\t'usehint'=array,\n\t\t\t'nowarning'=false,\n\t\t\t'fieldtype',\n\t\t\t'fieldvalue'=string,\n\t\t\t'fieldvalue_array'=array,\n\t\t\t'options'=array,\n\t\t\t'focusfield';\n\n\t\tlocal: 'clientparams'=client_getparams;\n\t\t#clientparams -> (merge: client_postparams);\n\t\t#clientparams -> (removeall: (self -> 'keyparamname'));\n\t\t#clientparams -> (removeall: '-lockvalue');\n\t\t#clientparams -> (removeall: '-action');\n\t\t#clientparams -> (removeall: '-xhtml');\n\n\t\t// local var that adjust tag endings if rendered for XHTML\n\t\tlocal: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');\n\n\t\t// page var to keep track of the number of forms that has been rendered on a page\n\t\tif: !(var_defined: 'knop_form_renderform_counter');\n\t\t\tvar: 'knop_form_renderform_counter'=0;\n\t\t/if;\n\t\t\n\t\t$knop_form_renderform_counter += 1;\n\n\t\tif: (self -> 'id') != '';\n\t\t\t#formid = (self -> 'id');\n\t\telse: (self -> 'name') != '';\n\t\t\t#formid = (self -> 'name');\n\t\telse;\n\t\t\t#formid = 'form' + $knop_form_renderform_counter;\n\t\t/if;\n\t\t\n\t\t\n\t\tlocal: 'renderformStartTag'=false, 'renderformEndTag'=false;\n\t\t// remove params that should not stop formstarttag and formendtag from rendering\n\t\tparams -> type == 'array' ? params -> (removeall: '-legend') & (removeall: '-xhtml');\n\t\tif: (self -> 'formaction') != null \n\t\t\t&& (params -> size == 0 || (local_defined: 'start') );\n\t\t\t#renderformStartTag=true;\n\t\t/if;\n\t\tif: (self -> 'formaction') != null \n\t\t\t&& (params -> size == 0 || (local_defined: 'end') );\n\t\t\t#renderformEndTag=true;\n\t\t/if;\n\t\tif: #renderformStartTag;\n\t\t\t// render opening form tag\n\n\t\t\t#output +=' 'debug_trace') -> insert(tag_name + ': formaction = ' + (self -> 'formaction'));\n\t\t\tif: (self -> 'formaction') != null;\n\t\t\t\t#output += ' action=\"' + (self -> 'formaction');\n\t\t\t\tif: (self -> 'method') == 'post' && !(self -> 'noautoparams');\n\t\t\t\t\tlocal: 'actionparams'=array;\n\t\t\t\t\titerate: #clientparams, (local: 'clientparam');\n\t\t\t\t\t\tif: #clientparam -> type == 'pair';\n\t\t\t\t\t\t\tif: #clientparam -> name -> (beginswith: '-') \n\t\t\t\t\t\t\t && !(#clientparam -> name -> (beginswith: '-upload.'))\n\t\t\t\t\t\t\t && !(#clientparam -> name -> (beginswith: '-upload2.'))\n\t\t\t\t\t\t\t\t&& #clientparam -> name != '-session'\n\t\t\t\t\t\t\t\t&& (self -> 'fields') !>> #clientparam -> name\n\t\t\t\t\t\t\t\t// check if param name appears in form action\n\t\t\t\t\t\t\t\t// turn param into [p][a][r][a][m] to avoid problems with most reserved regex characters like \".\"\n\t\t\t\t\t\t\t\t&& (string_findregexp: (self -> 'formaction'), -find='[?;&]['\n\t\t\t\t\t\t\t\t\t+ ((#clientparam -> name) -> (split: '') -> (join: '][')) \n\t\t\t\t\t\t\t\t\t+ ']([&=]|$)', -ignorecase) -> size == 0;\n\t\t\t\t\t\t\t\t#actionparams -> (insert: (#clientparam -> name) + '=' + (encode_url: (#clientparam -> value)) );\n\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\telse: #clientparam -> type == 'string' \n\t\t\t\t\t\t\t&& #clientparam -> (beginswith: '-') \n\t\t\t\t\t\t\t&& (self -> 'fields') !>> #clientparam\n\t\t\t\t\t\t\t// check if param appears in form action\n\t\t\t\t\t\t\t// turn param into [p][a][r][a][m] to avoid problems with most reserved regex characters like \".\"\n\t\t\t\t\t\t\t&& (string_findregexp: (self -> 'formaction'), -find='[?;&]['\n\t\t\t\t\t\t\t\t+ (#clientparam -> (split: '') -> (join: '][')) \n\t\t\t\t\t\t\t\t+ ']([&=]|$)', -ignorecase) -> size == 0;\n\t\t\t\t\t\t\t#actionparams -> (insert: #clientparam );\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/iterate;\n\t\t\t\t\tif: #actionparams -> size;\n\t\t\t\t\t\t#output += ((self -> 'formaction') >> '?' ? '&' | '?' ) + #actionparams -> (join: '&');\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t\t#output += '\"';\n\t\t\t/if;\n\t\t\t(self -> 'method') != null\t\t? #output += ' method=\"' + (self -> 'method') + '\"';\n\t\t\t(self -> 'name') != null\t\t? #output += ' name=\"' + (self -> 'name') + '\"';\n\t\t\t#output += ' id=\"' + #formid + '\"';\n\t\t\t(self -> 'class') != null\t\t? #output += ' class=\"' + (self -> 'class') + '\"';\n\t\t\t(self -> 'enctype') != ''\t\t? #output += ' enctype=\"' + (self -> 'enctype') + '\"';\n\t\t\t(self -> 'raw') != null\t\t\t? #output += ' ' + (self -> 'raw');\n\t\t\t!(self -> 'noscript') ? #output += ' onsubmit=\"return validateform(this)\"';\n\t\t\t(self -> 'entersubmitblock') && !(self -> 'noscript')\t? #output += ' onkeydown=\"return submitOk(event);\" onfocus=\"submitBlock=true; return true;\" onblur=\"submitBlock=false; return true;\"';\n\t\t\t#output += '>\\n';\n\n\n\t\t\tif: (self -> 'actionpath') != '' \n\t\t\t\t&& !(self -> 'noautoparams') \n\t\t\t\t&& (self -> 'fields') !>> '-action';\n\t\t\t\t// auto-add -action unless there is already an -action field in the form\n\t\t\t\t#output += ' 'actionpath')) + '\"' + #endslash + '>\\n';\n\t\t\t/if;\n\t\t\tif: (self -> 'fieldset');\n\t\t\t\t#output += '
\\n';\n\t\t\t\t#output +='' + (self -> 'legend') + '\\n';\n\t\t\t/if;\n\t\t\tif: (self -> 'method') == 'get' && !(self -> 'noautoparams');\n\t\t\t\titerate: #clientparams, (local: 'clientparam');\n\t\t\t\t\tif: #clientparam -> type == 'pair';\n\t\t\t\t\t\tif: #clientparam -> name -> (beginswith: '-')\n\t\t\t\t\t\t\t&& #clientparam -> name != '-session'\n\t\t\t\t\t\t\t&& (self -> 'fields') !>> #clientparam -> name\n\t\t\t\t\t\t\t// check if param name appears in form action\n\t\t\t\t\t\t\t// turn param into [p][a][r][a][m] to avoid problems with most reserved regex characters like .\n\t\t\t\t\t\t\t&& (string_findregexp: (self -> 'formaction'), -find='[?;&]['\n\t\t\t\t\t\t\t\t+ ((#clientparam -> name) -> (split: '') -> (join: '][')) \n\t\t\t\t\t\t\t\t+ ']([&=]|$)', -ignorecase) -> size == 0;\n\t\t\t\t\t\t\t#output += ' name) + '\" value=\"' + (encode_html: (#clientparam -> value)) + '\"' + #endslash + '>\\n';\n\t\t\t\t\t\t/if;\n\t\t\t\t\telse: #clientparam -> type == 'string' \n\t\t\t\t\t\t&& #clientparam -> (beginswith: '-')\n\t\t\t\t\t\t&& (self -> 'fields') !>> #clientparam\n\t\t\t\t\t\t// check if param appears in form action\n\t\t\t\t\t\t// turn param into [p][a][r][a][m] to avoid problems with most reserved regex characters like .\n\t\t\t\t\t\t&& (string_findregexp: (self -> 'formaction'), -find='[?;&]['\n\t\t\t\t\t\t\t+ (#clientparam -> (split: '') -> (join: ']['))\n\t\t\t\t\t\t\t+ ']([&=]|$)', -ignorecase) -> size == 0;\n\t\t\t\t\t\t#output += '\\n';\n\t\t\t\t\t/if;\n\t\t\t\t/iterate;\n\t\t\t/if;\n\t\t\tif: (self -> 'database') -> type == 'database';\n\t\t\t\tif: (self -> 'database') -> lockfield != '' && (self -> 'db_lockvalue') != '';\n\t\t\t\t\t#output += ' 'db_lockvalue')) + '\"' + #endslash + '>\\n';\n\t\t\t\telse: (self -> 'database') -> keyfield != '' && (self -> 'db_keyvalue') != '';\n\t\t\t\t\t#output += ' 'keyparamname') + '\" value=\"' + (encode_html: (self -> 'db_keyvalue')) + '\"' + #endslash + '>\\n';\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t/if;\n\t\t\n\t\t\n\t\tif: !(local_defined: 'start') && !(local_defined: 'end');\n\n\t\t\t(local_defined: 'name') && !((self -> 'fields') >> #name) \t? \treturn;\n\t\t\t\n\t\t\t(local_defined: 'name')\t\t? local: 'from'=#name, 'to'=#name;\n\t\t\t!(local_defined: 'from') \t\t? local: 'from'=1;\n\t\t\t!(local_defined: 'to') \t\t\t? local: 'to'=(self -> 'fields') -> size;\n\t\t\t!(local_defined: 'type')\t\t? local: 'type'=(self -> 'validfieldtypes');\n\t\t\t!(local_defined: 'excludetype')\t? local: 'excludetype'=map;\n\t\t\t#type -> type == 'string' \t\t? #type = (map: #type);\n\t\t\t#excludetype -> type == 'string' ? #excludetype = (map: #excludetype);\n\n\t\t\t// only render form inputs if we are not only rendering the form tags\n\t\t\n\t\t\t// use field name if #from is a string\n\t\t\t#from -> type == 'string' ? #from = integer: ((self -> 'fields') -> (findindex: #from) -> first);\n\t\t\t#from == 0 ? #from = 1;\n\t\t\t// negative numbers count from the end\n\t\t\t#from < 0 ? #from = (self -> 'fields') -> size + #from;\n\t\n\t\t\t// use field name if #to is a string\n\t\t\t#to -> type == 'string' ? #to = integer: ((self -> 'fields') -> (findindex: #to) -> last);\n\t\t\t#to == 0 ? #to = (self -> 'fields') -> size;\n\t\t\t// negative numbers count from the end\n\t\t\t#to < 0 ? #to = (self -> 'fields') -> size + #to;\n\n\t\t\t// sanity check\n\t\t\t#from > #to ? #to = #from;\n\t\n\t\t\tlocal: 'template'=( (self -> 'template') != '' \n\t\t\t\t? (self -> 'template') \t\t\n\t\t\t\t| '#label# #field##required#\\n' );\n\t\t\tlocal: 'buttontemplate'=( (self -> 'buttontemplate') != '' \n\t\t\t\t? (self -> 'buttontemplate') \n\t\t\t\t| (self -> 'template') != '' \n\t\t\t\t? (self -> 'template')\n\t\t\t\t| '#field#\\n' );\n\t\t\tlocal: 'requiredmarker'=(self -> 'required');\n\t\t\tlocal: 'defaultclass'=( (self -> 'class') != '' \n\t\t\t\t? (self -> 'class') \t\t\n\t\t\t\t| '');\n\t\t\tlocal: 'errorclass'=( (self -> 'errorclass') != '' \n\t\t\t\t? ' class=\"' + (self -> 'errorclass') + '\"' \n\t\t\t\t| ' style=\"color: red;\"');\n\t\t\t\n\t\t\tif: (local_defined: 'legend');\n\t\t\t\t(self -> 'render_fieldset2_open') = true;\n\t\t\t\t#output += '
\\n'\n\t\t\t\t\t+ '' + #legend + '\\n';\n\t\t\t/if;\n\n\t\t\titerate: (self -> 'fields'), (local: 'fieldpair');\n\t\t\t\t#onefield = #fieldpair -> value;\n\t\t\t\t#fieldvalue = (#onefield -> (find: 'value'));\n\t\t\t\t#fieldvalue_array = #fieldvalue;\n\t\t\t\tif: #fieldvalue_array -> type != 'array';\n\t\t\t\t\tif: #fieldvalue_array >> '\\r'; // Filemaker value list with multiple checked\n\t\t\t\t\t\t#fieldvalue_array = #fieldvalue_array -> (split: '\\r');\n\t\t\t\t\telse: #fieldvalue_array >> ','; // Other database with multiple checked\n\t\t\t\t\t\t#fieldvalue_array = #fieldvalue_array -> (split: ',');\n\t\t\t\t\telse;\n\t\t\t\t\t\t#fieldvalue_array = array: #fieldvalue_array;\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t\tif: #onefield >> 'options';\n\t\t\t\t\t#options = (#onefield -> find: 'options');\n\t\t\t\t\t// convert types for pair \n\t\t\t\t\titerate: #options, (local: 'option');\n\t\t\t\t\t\tif: #option -> type != 'pair';\n\t\t\t\t\t\t\t#option = (pair: #option = #option);\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t// name must be string to make sure comparsions work\n\t\t\t\t\t\t(#option -> name) = (string: #option -> name);\n\t\t\t\t\t/iterate;\n\t\t\t\t/if;\n\t\t\t\t\n\t\t\t\tif: loop_count >= #from \n\t\t\t\t\t&& loop_count <= #to\n\t\t\t\t\t&& #type >> #onefield -> (find: 'type')\n\t\t\t\t\t&& !(#excludetype >> #onefield -> (find: 'type'));\n\t\t\t\t\tif: (self -> 'unsavedwarning') == '';\n\t\t\t\t\t\t#nowarning=true;\n\t\t\t\t\telse;\n\t\t\t\t\t\t#nowarning=#onefield -> (find: 'nowarning');\n\t\t\t\t\t/if;\n\t\t\t\t\t\n\t\t\t\t\tif: #onefield -> (find: 'template') -> size;\n\t\t\t\t\t\t#renderrow = #onefield -> (find: 'template');\n\t\t\t\t\telse: (map: 'submit', 'reset', 'image') >> #onefield -> (find: 'type');\n\t\t\t\t\t\t#renderrow=#buttontemplate;\n\t\t\t\t\telse;\n\t\t\t\t\t\t#renderrow=#template;\n\t\t\t\t\t/if;\n\t\t\t\t\tlocal: 'id'= string;\n\t\t\t\t\tif: (#onefield -> (find: 'id')) !='';\n\t\t\t\t\t\t#id = (#onefield -> (find: 'id'));\n\t\t\t\t\telse;\n\t\t\t\t\t\t#id = #formid + '_' + (#onefield -> (find: 'name')) + loop_count;\n\t\t\t\t\t/if;\n\t\t\t\t\tif: (self -> 'errors') -> size == 0 && #focusfield == '' && #onefield -> (find: 'focus');\n\t\t\t\t\t\t// give this field focus\n\t\t\t\t\t\t#focusfield = #id;\n\t\t\t\t\t/if;\n\t\t\t\t\t\n\t\t\t\t\t// set field label, with error marker if field validation failed\n\t\t\t\t\t// if: (self -> 'exceptionfieldtypes') >> (#onefield -> (find: 'type')) && (#onefield -> (find: 'type')) != 'file';\n\t\t\t\t\t//\t#renderrow -> (replace: '#label#', '');\n\t\t\t\t\t//else: \n\t\t\t\t\tif: (self -> 'errors') -> type == 'array' && (self -> 'errors') >> (#onefield -> (find: 'name'));\n\t\t\t\t\t\t#renderrow -> (replace: '#label#', \n\t\t\t\t\t\t\t'');\n\t\t\t\t\t\tif: #focusfield == '';\n\t\t\t\t\t\t\t#focusfield = #id;\n\t\t\t\t\t\t/if;\n\t\t\t\t\telse;\n\t\t\t\t\t\t#renderrow -> (replace: '#label#', '');\n\t\t\t\t\t/if;\n\t\t\t\t\t\n\t\t\t\t\t// set markers for required fields \n\t\t\t\t\tif: #onefield -> (find: 'required') && !((self -> 'exceptionfieldtypes') >> (#onefield -> (find: 'type')) );\n\t\t\t\t\t\t#renderrow -> (replace: '#required#', (encode_smart: #requiredmarker));\n\t\t\t\t\telse;\n\t\t\t\t\t\t#renderrow -> (replace: '#required#', '');\n\t\t\t\t\t/if;\n\t\t\t\t\t#renderfield=string;\n\t\t\t\t\t#renderfield_base = ' name=\"' + (encode_html: (#onefield -> (find: 'name'))) + '\"'\n\t\t\t\t\t\t+ (#onefield >> 'class' ? ' class=\"' + (#onefield -> (find: 'class')) + '\"' \n\t\t\t\t\t\t\t| (#defaultclass != '' ? ' class=\"' + #defaultclass + '\"') )\n\t\t\t\t\t\t+ ' id=\"' + (encode_html: #id) + '\"'\n\t\t\t\t\t\t+ (#onefield >> 'raw'\t? ' ' + (#onefield -> (find: 'raw')) )\n\t\t\t\t\t\t+ (#onefield -> (find: 'disabled') ? ' disabled=\"disabled\"');\n\n\t\t\t\t\t#fieldtype=(#onefield -> (find: 'type'));\n\t\t\t\t\tif: #fieldtype == 'search' && client_type !>> 'WebKit';\n\t\t\t\t\t\t// only show (replace: '#label#', '');\n\t\t\t\t\t\t#renderrow -> (replace: '#required#', '');\n\t\t\t\t\t\t#renderfield = #fieldvalue + '\\n';\n\t\t\t\t\tcase: 'legend';\n\t\t\t\t\t\t#renderrow = '';\n\t\t\t\t\t\tif: (self -> 'render_fieldset_open');\n\t\t\t\t\t\t\t#output += '
\\n';\n\t\t\t\t\t\t\t(self -> 'render_fieldset_open') = false;\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t#output += '> 'class' ? ' class=\"' + (#onefield -> (find: 'class')) + '\"' \n\t\t\t\t\t\t\t\t| (#defaultclass != '' ? ' class=\"' + #defaultclass + '\"') )\n\t\t\t\t\t\t\t+ ((#onefield -> (find: 'id') != '') ? ' id=\"' + #id + '\"') \n\t\t\t\t\t\t\t+ '>\\n';\n\t\t\t\t\t\t(self -> 'render_fieldset_open') = true;\n\t\t\t\t\t\t#output += '' + (encode_html: #fieldvalue) + '\\n';\n\t\t\t\t\tcase: 'fieldset';\n\t\t\t\t\t\t#renderrow = '';\n\t\t\t\t\t\tif: (self -> 'render_fieldset_open');\n\t\t\t\t\t\t\t#output += '
\\n';\n\t\t\t\t\t\t\t(self -> 'render_fieldset_open') = false;\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\tif: #fieldvalue !== false;\n\t\t\t\t\t\t\t(self -> 'render_fieldset_open') = true;\n\t\t\t\t\t\t\t#output += '> 'class' ? ' class=\"' + (#onefield -> (find: 'class')) + '\"' \n\t\t\t\t\t\t\t\t| (#defaultclass != '' ? ' class=\"' + #defaultclass + '\"') )\n\t\t\t\t\t\t\t+ ((#onefield -> (find: 'id') != '') ? ' id=\"' + #id + '\"') \n\t\t\t\t\t\t\t+ '>\\n' + (encode_html: #fieldvalue) + '\\n'; // must contain a legend\n\t\t\t\t\t\t/if;\n\t\t\t\t\tcase: 'hidden';\n\t\t\t\t\t\t#renderfield += '';\n\t\t\t\t\t\t#renderrow = '';\n\t\t\t\t\t\t#output += #renderfield + '\\n';\n\t\t\t\t\tcase: 'text';\n\t\t\t\t\t\t#renderfield += '> 'size' \t? ' size=\"' + (#onefield -> (find: 'size')) + '\"' )\n\t\t\t\t\t\t\t+ (#onefield >> 'maxlength' \t? ' maxlength=\"' + (#onefield -> (find: 'maxlength')) + '\"' );\n\t\t\t\t\t\tif: !(self -> 'noscript') && (#onefield -> (find: 'hint')) != '';\n\t\t\t\t\t\t\t#renderfield += ' onfocus=\"clearHint(this)\" onblur=\"setHint(this, \\'' (#onefield -> (find: 'hint')) '\\')\"';\n\t\t\t\t\t\t\t#usehint -> (insert: (#onefield -> find: 'name') = #id);\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\tif: !(self -> 'noscript') && !#nowarning;\n\t\t\t\t\t\t\t#renderfield += ' onkeydown=\"dirtyvalue(this)\" onkeyup=\"makedirty(this)\"';\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t#renderfield += #endslash + '>';\n\t\t\t\t\tcase: 'search';\n\t\t\t\t\t\t#renderfield += '> 'size' \t? ' size=\"' + (#onefield -> (find: 'size')) + '\"' );\n\t\t\t\t\t\tif: (#onefield -> (find: 'hint')) != '';\n\t\t\t\t\t\t\t#renderfield += ' placeholder=\"' + (encode_html: (#onefield -> (find: 'hint'))) + '\"';\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\tif: !(self -> 'noscript') && !#nowarning;\n\t\t\t\t\t\t\t#renderfield += ' onkeydown=\"dirtyvalue(this)\" onkeyup=\"makedirty(this)\"';\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t#renderfield += #endslash + '>';\n\t\t\t\t\tcase: 'password';\n\t\t\t\t\t\t#renderfield += '> 'size' \t? ' size=\"' + (#onefield -> (find: 'size')) + '\"' );\n\t\t\t\t\t\tif: !(self -> 'noscript') && !#nowarning;\n\t\t\t\t\t\t\t#renderfield += ' onkeydown=\"dirtyvalue(this)\" onkeyup=\"makedirty(this)\"';\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t#renderfield += #endslash + '>';\n\t\t\t\t\tcase: 'textarea';\n\t\t\t\t\t\t#renderfield += '> 'cols' \t? ' cols=\"' + (#onefield -> (find: 'cols')) + '\"')\n\t\t\t\t\t\t\t+ (#onefield >> 'rows' \t? ' rows=\"' + (#onefield -> (find: 'rows')) + '\"');\n\t\t\t\t\t\tif: !(self -> 'noscript') && (#onefield -> (find: 'hint')) != '';\n\t\t\t\t\t\t\t#renderfield += ' onfocus=\"clearHint(this)\" onblur=\"setHint(this, \\'' (#onefield -> (find: 'hint')) '\\')\"';\n\t\t\t\t\t\t\t#usehint -> (insert: (#onefield -> find: 'name') = #id);\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\tif: !(self -> 'noscript') && !#nowarning;\n\t\t\t\t\t\t\t#renderfield += ' onkeydown=\"dirtyvalue(this)\" onkeyup=\"makedirty(this)\"';\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t#renderfield += '>'\n\t\t\t\t\t\t\t+ (encode_html: #fieldvalue) + '';\n\t\t\t\t\tcase: 'checkbox';\n\t\t\t\t\t\tlocal: 'optioncount'=integer;\n\t\t\t\t\t\t#renderfield += '
> 'class' ? ' ' + (#onefield -> find('class'))\n\t\t\t\t\t\t\t| (#defaultclass != '' ? ' ' + #defaultclass) ) \n\t\t\t\t\t\t\t+ '\" id=\"' + #id + '\">\\n';\n\t\t\t\t\t\titerate: #options, (local: 'option');\n\t\t\t\t\t\t\t#optioncount += 1;\n\t\t\t\t\t\t\t#renderfield += (#optioncount > 1 && (#onefield -> find: 'linebreak') ? '') + '\\n';\n\t\t\t\t\t\t\tif: #option -> name == '-optgroup';\n\t\t\t\t\t\t\t\t#renderfield += (!(#onefield -> find: 'linebreak') && #optioncount > 1 ? '\\n');\n\t\t\t\t\t\t\t\tif: #option -> value != '-optgroup';\n\t\t\t\t\t\t\t\t\t#renderfield += #option -> value\n\t\t\t\t\t\t\t\t\t\t+ (!(#onefield -> find: 'linebreak') ? '\\n');\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\t#renderfield += ' name) + '\"';\n\t\t\t\t\t\t\t\tif: #option -> name != '' && #fieldvalue_array >> #option -> name;\n\t\t\t\t\t\t\t\t\t#renderfield +=' checked=\"checked\"';\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\t\tif: !(self -> 'noscript') && !#nowarning;\n\t\t\t\t\t\t\t\t\t#renderfield += ' onclick=\"makedirty();\"';\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\t\t#renderfield += #endslash + '> ';\n\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t/iterate;\n\t\t\t\t\t\t#renderfield += '
\\n';\n\t\t\t\t\tcase: 'radio';\n\t\t\t\t\t\tlocal: 'optioncount'=integer;\n\t\t\t\t\t\t#renderfield += '
> 'class' ? ' ' + (#onefield -> find('class'))\n\t\t\t\t\t\t\t| (#defaultclass != '' ? ' ' + #defaultclass) ) \n\t\t\t\t\t\t\t+ '\" id=\"' + #id + '\">\\n';\n\t\t\t\t\t\titerate: #options, (local: 'option');\n\t\t\t\t\t\t\t#optioncount += 1;\n\t\t\t\t\t\t\t#renderfield += (#optioncount > 1 && (#onefield -> find: 'linebreak') ? '') + '\\n';\n\t\t\t\t\t\t\tif: #option -> name == '-optgroup';\n\t\t\t\t\t\t\t\t#renderfield += (!(#onefield -> find: 'linebreak') && #optioncount > 1 ? '\\n');\n\t\t\t\t\t\t\t\tif: #option -> value != '-optgroup';\n\t\t\t\t\t\t\t\t\t#renderfield += #option -> value\n\t\t\t\t\t\t\t\t\t\t+ (!(#onefield -> find: 'linebreak') ? '\\n');\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\t#renderfield += ' name) + '\"';\n\t\t\t\t\t\t\t\tif: #option -> name != '' && #fieldvalue_array >> #option -> name;\n\t\t\t\t\t\t\t\t\t#renderfield +=' checked=\"checked\"';\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\t\tif: !(self -> 'noscript') && !#nowarning;\n\t\t\t\t\t\t\t\t\t#renderfield += ' onclick=\"makedirty();\"';\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\t\t#renderfield += #endslash + '> ';\n\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t/iterate;\n\t\t\t\t\t\t#renderfield += '
\\n';\n\t\t\t\t\tcase: 'select';\n\t\t\t\t\t\t#renderfield += '\\n';\n\t\t\t\t\tcase: 'submit';\n\t\t\t\t\t\t#renderfield += ' formmode) == 'add' \n\t\t\t\t\t\t\t&& !(#onefield -> (find: 'disabled')) // already disabled\n\t\t\t\t\t\t\t&& (#onefield -> (find: 'originaltype') == 'savebutton' || #onefield -> (find: 'originaltype') == 'deletebutton'\n\t\t\t\t\t\t\t|| #onefield -> (find: 'name') == 'button_save' || #onefield -> (find: 'name') == 'button_delete');\n\t\t\t\t\t\t\t#renderfield += ' disabled=\"disabled\"';\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\tif: !(self -> 'noscript') \n\t\t\t\t\t\t\t&& (#onefield -> (find: 'name') == 'button_delete' \n\t\t\t\t\t\t\t\t|| #onefield -> (find: 'originaltype') == 'deletebutton' \n\t\t\t\t\t\t\t\t|| #onefield -> (find: 'confirmmessage') != '');\n\t\t\t\t\t\t\tlocal: 'confirmmessage'=(#onefield -> (find: 'confirmmessage') != '' \n\t\t\t\t\t\t\t\t? #onefield -> (find: 'confirmmessage') | 'Really delete?');\n\t\t\t\t\t\t\t#confirmmessage -> (replace: '\"', '"');\n\t\t\t\t\t\t\t#confirmmessage -> (replace: '\\'', '\\\\\\'');\n\t\t\t\t\t\t\t#renderfield += ' onclick=\"return confirm(\\'' + #confirmmessage + '\\')\"';\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t#renderfield += #endslash + '>';\n\t\t\t\t\tcase: 'reset';\n\t\t\t\t\t\t#renderfield += ' 'noscript') && #onefield -> (find: 'confirmmessage') != '';\n\t\t\t\t\t\t\tlocal: 'confirmmessage'=#onefield -> (find: 'confirmmessage');\n\t\t\t\t\t\t\t#confirmmessage -> (replace: '\"', '"');\n\t\t\t\t\t\t\t#confirmmessage -> (replace: '\\'', '\\\\\\'');\n\t\t\t\t\t\t\t#renderfield += ' onclick=\"if(confirm(\\'' + #confirmmessage + '\\')){makeundirty();return true}else{return false};\"';\n\t\t\t\t\t\telse: !(self -> 'noscript');\n\t\t\t\t\t\t\t#renderfield += ' onclick=\"makeundirty();\"';\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t#renderfield += #endslash + '>';\n\t\t\t\t\tcase: 'image';\n\t\t\t\t\t\t#renderfield += ' formmode) == 'add' && \n\t\t\t\t\t\t\t(#onefield -> (find: 'originaltype') == 'savebutton' || #onefield -> (find: 'originaltype') == 'deletebutton'\n\t\t\t\t\t\t\t|| #onefield -> (find: 'name') == 'button_save' || #onefield -> (find: 'name') == 'button_delete');\n\t\t\t\t\t\t\t#renderfield += ' disabled=\"disabled\"';\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\tif: !(self -> 'noscript')\n\t\t\t\t\t\t\t&& (#onefield -> (find: 'name') == 'button_delete' \n\t\t\t\t\t\t\t\t|| #onefield -> (find: 'originaltype') == 'deletebutton' \n\t\t\t\t\t\t\t\t|| #onefield -> (find: 'confirmmessage') != '');\n\t\t\t\t\t\t\tlocal: 'confirmmessage'=(#onefield -> (find: 'confirmmessage') != '' \n\t\t\t\t\t\t\t\t? #onefield -> (find: 'confirmmessage') | 'Really delete?');\n\t\t\t\t\t\t\t#confirmmessage -> (replace: '\"', '"');\n\t\t\t\t\t\t\t#confirmmessage -> (replace: '\\'', '\\\\\\'');\n\t\t\t\t\t\t\t#renderfield += ' onclick=\"return confirm(\\'' + #confirmmessage + '\\')\"';\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t#renderfield += #endslash + '>';\n\t\t\t\t\tcase: 'file';\n\t\t\t\t\t\t#renderfield += ' 'noscript') && !#nowarning;\n\t\t\t\t\t\t\tif: #renderfield >> 'onchange=\"';\n\t\t\t\t\t\t\t\t#renderfield -> (replace: 'onchange=\"', 'onchange=\"makedirty();');\n\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\t#renderfield += ' onchange=\"makedirty()\"';\n\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t#renderfield += #endslash + '>';\n\t\t\t\t\t/select;\n\t\t\t\t\t#renderrow -> (replace: '#field#', #renderfield);\n\t\t\t\t\t#output += #renderrow;\n\t\t\t\t/if; \n\t\t\t/iterate;\n\t\t\t\n\t\t\t\t\n\t\t/if; // !(local_defined: 'start') && !(local_defined: 'end');\n\n\t\t// Add just the needed scripts to support the client side functionality\n\t\tif(!(self -> 'noscript'));\n\t\t\t#output >> 'togglecontrol(' \n\t\t\t\t? self -> (afterhandler: -endscript='function togglecontrol(obj){\n\t\t\t\t\t// toggles checkboxes and radios when clicking on label (for browsers that don´t support this already)\n\t\t\t\t\tswitch (obj.type){\n\t\t\t\t\tcase \\'checkbox\\':\n\t\t\t\t\t\tobj.checked=!obj.checked;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase \\'radio\\':\n\t\t\t\t\t\tobj.checked=true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}');\n\t\t\t#output >> 'setHint('\n\t\t\t\t? \t\tself -> (afterhandler: -endscript='function setHint(myField, hint) {\n\t\t\t\t\tif(myField.value==\\'\\') {\n\t\t\t\t\t\tif(myField.name.indexOf(\\'off_\\') != 0) {\n\t\t\t\t\t\t\tmyField.name=\\'off_\\' + myField.name;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tmyField.value=hint;\n\t\t\t\t\t\tgetStyleObject(myField.id).color=\\'#aaa\\';\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfunction clearHint(myField) {\n\t\t\t\t\tif(myField.name.indexOf(\\'off_\\') == 0) {\n\t\t\t\t\t\tmyField.name=myField.name.substr(4);\n\t\t\t\t\t\tmyField.value=\\'\\';\n\t\t\t\t\t\tgetStyleObject(myField.id).color=\\'black\\';\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfunction getStyleObject(objectId) {\n\t\t\t\t\tif(document.getElementById && document.getElementById(objectId)) {\n\t\t\t\t\treturn document.getElementById(objectId).style;\n\t\t\t\t\t} else {\n\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t}');\n\t\t\n\t\t\t#output >> 'makedirty(' || #output >> 'validateform('\n\t\t\t\t? self -> (afterhandler: -endscript='\n\t\t\t\tvar dirty=' + ((self -> 'errors') -> size ? 'true' | 'false') + ';\n\t\t\t\tvar dirtycheckname=null;\n\t\t\t\tvar dirtycheckvalue=null;\n\t\t\t\tvar submitBlock=false;\n\t\t\t\tfunction validateform(myForm) {\n\t\t\t\t\t// perform validation of myForm here\n\t\t\t\t\tif(submitBlock){return false};\n\t\t\t\t\tmakeundirty();\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tfunction dirtyvalue(obj){ // to be called at keydown to track if a text field changes or if arrow keys/tab/cmd-keys are pressed\n\t\t\t\t\t dirtycheckname = obj.name;\n\t\t\t\t\t dirtycheckvalue = obj.value;\n\t\t\t\t}\n\t\t\t\tfunction makeundirty(){\n\t\t\t\t\tdirty=false; \n\t\t\t\t\tdirtymarker();\n\t\t\t\t\twindow.onbeforeunload=null;\n\t\t\t\t}\n\t\t\t\tfunction makedirty(obj){\n\t\t\t\t\tif(obj){ // if object is specified then we are tracking if the value changes through keydown/keyup \n\t\t\t\t\t\tif (obj.value == dirtycheckvalue || obj.name != dirtycheckname) { // no change or tabbed to another field - return immediately\n\t\t\t\t\t\t\treturn\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tdirty=true; \n\t\t\t\t\tdirtymarker();\n\t\t\t\t}\n\t\t\t\tfunction checkdirty(){\n\t\t\t\t\tif(dirty){\n\t\t\t\t\t\treturn confirm(\\'' + (self -> 'unsavedwarning') + '\\')\n\t\t\t\t\t} else {return true}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tfunction dirtymarker() {\n\t\t\t\t\tvar obj = document.getElementById(\\'' + (self -> 'unsavedmarker') + '\\');\n\t\t\t\t\tif(dirty && obj){\n\t\t\t\t\t\tjscss(\\'add\\',obj,\\'' + (self -> 'unsavedmarkerclass') + '\\');\n\t\t\t\t\t}else if(obj) {\n\t\t\t\t\t\tjscss(\\'remove\\',obj,\\'' + (self -> 'unsavedmarkerclass') + '\\');\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfunction jscss(a,o,c1,c2){\n\t\t\t\t\t/*\n\t\t\t\t\t\ta = action: swap, add, remove, check\n\t\t\t\t\t\to = object\n\t\t\t\t\t\tc1 = name of the class (first class for swap)\n\t\t\t\t\t\tc2 = for swap, name of the second class\n\t\t\t\t\t\thttp://onlinetools.org/articles/unobtrusivejavascript/cssjsseparation.html\n\t\t\t\t\t*/\n\t\t\t\t\tswitch (a){\n\t\t\t\t\t\tcase \\'swap\\':\n\t\t\t\t\t\t\to.className=!jscss(\\'check\\',o,c1)?o.className.replace(c2,c1): o.className.replace(c1,c2);\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase \\'add\\':\n\t\t\t\t\t\t\tif(!jscss(\\'check\\',o,c1)){o.className+=o.className?\\' \\'+c1:c1;}\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase \\'remove\\':\n\t\t\t\t\t\t\tvar rep=o.className.match(\\' \\'+c1)?\\' \\'+c1:c1;\n\t\t\t\t\t\t\to.className=o.className.replace(rep,\\'\\');\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase \\'check\\':\n\t\t\t\t\t\t\treturn new RegExp(\\'\\\\\\\\b\\'+c1+\\'\\\\\\\\b\\').test(o.className);\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(dirty) {makedirty()};');\n\t\t\t\t\n\t\t\t\t(self -> 'unsavedwarning') != '' \n\t\t\t\t\t? self -> (afterhandler: -endscript='function beforeunload() {\n\t\t\t\t\tif(dirty) {return \\'' + (self -> 'unsavedwarning') + '\\';}\n\t\t\t\t}\n\t\t\t\twindow.onbeforeunload=beforeunload;');\n\t\t\t\t\n\t\t\t\t#output >> 'submitOk'\n\t\t\t\t\t? self -> (afterhandler: -endscript='function submitOk(e) { // prevents submit-on-enter\n\t\t\t\t\tvar keynum;\n\t\t\t\t\tvar elTarget;\n\t\t\t\t\tvar elType;\n\t\t\n\t\t\t\t\t// get keycode for the event \n\t\t\t\t\tif(window.event) keynum = e.keyCode; // IE\n\t\t\t\t\telse if(e.which) keynum = e.which; // DOM\n\t\t\n\t\t\t\t\t// get target\n\t\t\t\t\tif (e.target) elTarget = e.target;\n\t\t\t\t\telse if (e.srcElement) elTarget = e.srcElement;\n\t\t\n\t\t\t\t\tif(elTarget.tagName.toLowerCase() == \\'input\\') elType = elTarget.getAttribute(\\'type\\').toLowerCase();\n\t\t\t\t\tsubmitBlock=false;\n\t\t\t\t\tif (elType != \\'submit\\' && elType != \\'image\\' && elType != \\'reset\\') {\n\t\t\t\t\t\t// allow enter submit when submit button/image or reset button has focus\n\t\t\t\t\t\tif (keynum==13) submitBlock=true;\n\t\t\t\t\t}\n\t\t\t\t\treturn true;\n\t\t\t\t}');\n\t\t\t/if; // noscript\n\n\t\tif: false && $knop_form_renderform_counter <= 1;\n\t\t\t\t\t\t\t\t\t\tself -> (afterhandler: -headscript=\n\t\t\t\t\t\t\t\t\t\t\t'function getStyleObject(objectId) {\n\t\t\t\t\t\t\t\t\t\t\t\tif(document.getElementById && document.getElementById(objectId)) {\n\t\t\t\t\t\t\t\t\t\t\t\treturn document.getElementById(objectId).style;\n\t\t\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\tfunction jscss(a,o,c1,c2){\n\t\t\t\t\t\t\t\t\t\t\t\t/*\n\t\t\t\t\t\t\t\t\t\t\t\t\ta = action: swap, add, remove, check\n\t\t\t\t\t\t\t\t\t\t\t\t\to = object\n\t\t\t\t\t\t\t\t\t\t\t\t\tc1 = name of the class (first class for swap)\n\t\t\t\t\t\t\t\t\t\t\t\t\tc2 = for swap, name of the second class\n\t\t\t\t\t\t\t\t\t\t\t\t\thttp://onlinetools.org/articles/unobtrusivejavascript/cssjsseparation.html\n\t\t\t\t\t\t\t\t\t\t\t\t*/\n\t\t\t\t\t\t\t\t\t\t\t\tswitch (a){\n\t\t\t\t\t\t\t\t\t\t\t\t\tcase \\'swap\\':\n\t\t\t\t\t\t\t\t\t\t\t\t\t\to.className=!jscss(\\'check\\',o,c1)?o.className.replace(c2,c1): o.className.replace(c1,c2);\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t\t\tcase \\'add\\':\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif(!jscss(\\'check\\',o,c1)){o.className+=o.className?\\' \\'+c1:c1;}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t\t\tcase \\'remove\\':\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tvar rep=o.className.match(\\' \\'+c1)?\\' \\'+c1:c1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\to.className=o.className.replace(rep,\\'\\');\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t\t\tcase \\'check\\':\n\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn new RegExp(\\'\\\\\\\\b\\'+c1+\\'\\\\\\\\b\\').test(o.className);\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\tfunction togglecontrol(obj){\n\t\t\t\t\t\t\t\t\t\t\t\t// toggles checkboxes and radios when clicking on label (for browsers that don´t support this already)\n\t\t\t\t\t\t\t\t\t\t\t\tswitch (obj.type){\n\t\t\t\t\t\t\t\t\t\t\t\tcase \\'checkbox\\':\n\t\t\t\t\t\t\t\t\t\t\t\t\tobj.checked=!obj.checked;\n\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t\tcase \\'radio\\':\n\t\t\t\t\t\t\t\t\t\t\t\t\tobj.checked=true;\n\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\tfunction setHint(myField, hint) {\n\t\t\t\t\t\t\t\t\t\t\t\tif(myField.value==\\'\\') {\n\t\t\t\t\t\t\t\t\t\t\t\t\tif(myField.name.indexOf(\\'off_\\') != 0) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tmyField.name=\\'off_\\' + myField.name;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tmyField.value=hint;\n\t\t\t\t\t\t\t\t\t\t\t\t\tgetStyleObject(myField.id).color=\\'#aaa\\';\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tfunction clearHint(myField) {\n\t\t\t\t\t\t\t\t\t\t\t\tif(myField.name.indexOf(\\'off_\\') == 0) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tmyField.name=myField.name.substr(4);\n\t\t\t\t\t\t\t\t\t\t\t\t\tmyField.value=\\'\\';\n\t\t\t\t\t\t\t\t\t\t\t\t\tgetStyleObject(myField.id).color=\\'black\\';\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tvar dirty=' + ((self -> 'errors') -> size ? 'true' | 'false') + ';\n\t\t\t\t\t\t\t\t\t\t\tvar dirtycheckname=null;\n\t\t\t\t\t\t\t\t\t\t\tvar dirtycheckvalue=null;\n\t\t\t\t\t\t\t\t\t\t\tvar submitBlock=false;\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\tfunction validateform(myForm) {\n\t\t\t\t\t\t\t\t\t\t\t\t// perform validation of myForm here\n\t\t\t\t\t\t\t\t\t\t\t\tif(submitBlock){return false};\n\t\t\t\t\t\t\t\t\t\t\t\tmakeundirty();\n\t\t\t\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\tfunction dirtyvalue(obj){ // to be called at keydown to track if a text field changes or if arrow keys/tab/cmd-keys are pressed\n\t\t\t\t\t\t\t\t\t\t\t\t dirtycheckname = obj.name;\n\t\t\t\t\t\t\t\t\t\t\t\t dirtycheckvalue = obj.value;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tfunction makeundirty(){\n\t\t\t\t\t\t\t\t\t\t\t\tdirty=false; \n\t\t\t\t\t\t\t\t\t\t\t\tdirtymarker();\n\t\t\t\t\t\t\t\t\t\t\t\twindow.onbeforeunload=null;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tfunction makedirty(obj){\n\t\t\t\t\t\t\t\t\t\t\t\tif(obj){ // if object is specified then we are tracking if the value changes through keydown/keyup \n\t\t\t\t\t\t\t\t\t\t\t\t\tif (obj.value == dirtycheckvalue || obj.name != dirtycheckname) { // no change or tabbed to another field - return immediately\n\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tdirty=true; \n\t\t\t\t\t\t\t\t\t\t\t\tdirtymarker();\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tfunction checkdirty(){\n\t\t\t\t\t\t\t\t\t\t\t\tif(dirty){\n\t\t\t\t\t\t\t\t\t\t\t\t\treturn confirm(\\'' + (self -> 'unsavedwarning') + '\\')\n\t\t\t\t\t\t\t\t\t\t\t\t} else {return true}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tfunction beforeunload() {\n\t\t\t\t\t\t\t\t\t\t\t\tif(dirty) {\n\t\t\t\t\t\t\t\t\t\t\t\t\treturn \\'' + (self -> 'unsavedwarning') + '\\';\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\tfunction dirtymarker() {\n\t\t\t\t\t\t\t\t\t\t\t\tvar obj = document.getElementById(\\'' + (self -> 'unsavedmarker') + '\\');\n\t\t\t\t\t\t\t\t\t\t\t\tif(dirty && obj){\n\t\t\t\t\t\t\t\t\t\t\t\t\tjscss(\\'add\\',obj,\\'' + (self -> 'unsavedmarkerclass') + '\\');\n\t\t\t\t\t\t\t\t\t\t\t\t}else if(obj) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tjscss(\\'remove\\',obj,\\'' + (self -> 'unsavedmarkerclass') + '\\');\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t' + ((self -> 'unsavedwarning') != '' ? 'window.onbeforeunload=beforeunload;') + '\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\tfunction submitOk(e) { // prevents submit-on-enter\n\t\t\t\t\t\t\t\t\t\t\t\tvar keynum;\n\t\t\t\t\t\t\t\t\t\t\t\tvar elTarget;\n\t\t\t\t\t\t\t\t\t\t\t\tvar elType;\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t// get keycode for the event \n\t\t\t\t\t\t\t\t\t\t\t\tif(window.event) keynum = e.keyCode; // IE\n\t\t\t\t\t\t\t\t\t\t\t\telse if(e.which) keynum = e.which; // DOM\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t// get target\n\t\t\t\t\t\t\t\t\t\t\t\tif (e.target) elTarget = e.target;\n\t\t\t\t\t\t\t\t\t\t\t\telse if (e.srcElement) elTarget = e.srcElement;\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\tif(elTarget.tagName.toLowerCase() == \\'input\\') elType = elTarget.getAttribute(\\'type\\').toLowerCase();\n\t\t\t\t\t\t\t\t\t\t\t\tsubmitBlock=false;\n\t\t\t\t\t\t\t\t\t\t\t\tif (elType != \\'submit\\' && elType != \\'image\\' && elType != \\'reset\\') {\n\t\t\t\t\t\t\t\t\t\t\t\t\t// allow enter submit when submit button/image or reset button has focus\n\t\t\t\t\t\t\t\t\t\t\t\t\tif (keynum==13) submitBlock=true;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t');\n\t\t/if;\n\t\tif: !(self -> 'noscript') && #usehint -> size > 0;\n\t\t\tlocal: 'hintscript'=string;\n\t\t\t// #usehint is a pair array with name=id\n\t\t\titerate: #usehint, (local: 'hintfield');\n\t\t\t\tif: (self -> 'fields') >> #hintfield -> name;\n\t\t\t\t\t#onefield = (self -> 'fields') -> (find: #hintfield -> name) -> first -> value;\n\t\t\t\t\t#hintscript += 'setHint(document.getElementById(\\'' + (encode_html: #hintfield -> value) + '\\'), \\'' \n\t\t\t\t\t\t+ (#onefield -> (find: 'hint')) + '\\');\\n';\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t\t\n\t\t\tself -> (afterhandler: -endscript=#hintscript);\n\t\t/if;\n\t\tif: !(self -> 'noscript') && #focusfield != '';\n\t\t\tself -> (afterhandler: -endscript='document.getElementById(\\'' + #focusfield + '\\').focus();document.getElementById(\\'' + #focusfield + '\\').select();');\n\t\t/if;\n\n\t\tif: (self -> 'render_fieldset_open') && (params -> size == 0 || (local_defined: 'end'));\n\t\t\t// inner fieldset is open\n\t\t\t(self -> 'render_fieldset_open') = false;\n\t\t\t#output += '\\n';\n\t\t/if;\n\t\tif: (self -> 'render_fieldset2_open') && (local_defined: 'legend');\n\t\t\t// inner fieldset is open\n\t\t\t(self -> 'render_fieldset2_open') = false;\n\t\t\t#output += '\\n';\n\t\t/if;\n\n\t\tif: #renderformEndTag;\n\t\t\tif: (self -> 'fieldset');\n\t\t\t\t#output += '\\n';\n\t\t\t/if;\n\t\t\n\t\t\t// render closing form tag\n\t\t\t#output += '';\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @#output;\n\t/define_tag;\n\n\tdefine_tag: 'renderhtml', -description='Outputs form data as plain HTML, a specific field, a range of fields or all fields of a specific type. \\\n\t\t\tSome form field types are excluded, such as submit, reset, file etc. \\\n\t\t\tUse form -> setformat first to specify the html format, otherwise default format #label#: #field#
is used.\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-name (optional) Render only the specified field\\n\\\n\t\t\t-from (optional) Render fields from the specified number index or field name\\n\\\n\t\t\t-to (optional) Render fields to the specified number index or field name\\n\\\n\t\t\t-type (optional) Only render fields of this or these types (string or array)\\n\\\n\t\t\t-excludetype (optional) Render fields except of this or these types (string or array)\\n\\\n\t\t\t-legend (optional) Groups the rendered fields in a fieldset and outputs a legend for the fieldset\\n\\\n\t\t\t-xhtml (optional flag) XHTML valid output',\n\t\t-optional='name', -copy,\t// field name\n\t\t-optional='from', -copy, \t// number index or field name\n\t\t-optional='to', -copy, \t\t// number index or field name\n\t\t-optional='type', -copy,\t// only output fields of this or these types (string or array)\n\t\t-optional='excludetype', -copy,\t// do not output fields of this or these types (string or array)\n\t\t-optional='legend',\t\t\t// groups the rendered fields in a fieldset and outputs a legend for the fieldset\n\t\t-optional='xhtml';\t\t\t// boolean, if set to true adjust output for XHTML\n\t\tlocal: 'timer'=knop_timer; \n\t\t\n\t\tlocal: 'output'=string, \n\t\t\t'onefield'=map, \n\t\t\t'renderfield'=string, \n\t\t\t'renderfield_base'=string, \n\t\t\t'renderrow'=string,\n\t\t\t'fieldvalue'=string,\n\t\t\t'fieldvalue_array'=array,\n\t\t\t'options'=array,\n\t\t\t'usehint'=array;\n\n\t\t\n\t\t// local var that adjust tag endings if rendered for XHTML\n\t\tlocal: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');\n\n\t\t(local_defined: 'name') && !((self -> 'fields') >> #name) \t? \treturn;\n\n\t\t(local_defined: 'name')\t\t? local: 'from'=#name, 'to'=#name;\n\t\t!(local_defined: 'from') \t\t? local: 'from'=1;\n\t\t!(local_defined: 'to') \t\t\t? local: 'to'=(self -> 'fields') -> size;\n\t\t!(local_defined: 'type')\t\t? local: 'type'=(self -> 'validfieldtypes');\n\t\t!(local_defined: 'excludetype')\t? local: 'excludetype'=map;\n\t\t#type -> type == 'string' \t\t? #type = (map: #type);\n\t\t#excludetype -> type == 'string' ? #excludetype = (map: #excludetype);\n\n\t\t// use field name if #from is a string\n\t\t#from -> type == 'string' ? #from = integer: ((self -> 'fields') -> (findindex: #from) -> first);\n\t\t#from == 0 ? #from = 1;\n\t\t// negative numbers count from the end\n\t\t#from < 0 ? #from = (self -> 'fields') -> size + #from;\n\n\t\t// use field name if #to is a string\n\t\t#to -> type == 'string' ? #to = integer: ((self -> 'fields') -> (findindex: #to) -> last);\n\t\t#to == 0 ? #to = (self -> 'fields') -> size;\n\t\t// negative numbers count from the end\n\t\t#to < 0 ? #to = (self -> 'fields') -> size + #to;\n\n\t\t//Sanity check\n\t\t#from > #to ? #to = #from;\n\n\t\tlocal: 'template'=( (self -> 'template') != '' \n\t\t\t? (self -> 'template') \t\t\n\t\t\t| '#label#: #field#\\n' );\n\t\tlocal: 'buttontemplate'=( (self -> 'buttontemplate') != '' \n\t\t\t? (self -> 'buttontemplate') \t\t\n\t\t\t| (self -> 'template') != '' \n\t\t\t? (self -> 'template')\n\t\t\t| '#field#\\n' );\n\t\tlocal: 'defaultclass'=( (self -> 'class') != '' \n\t\t\t? (self -> 'class') \t\t\n\t\t\t| '');\n\t\tif: (local_defined: 'legend');\n\t\t\t#output += '
\\n'\n\t\t\t\t+ '' + #legend + '\\n';\n\t\t\t(self -> 'render_fieldset2_open') = true;\n\t\t/if;\n\t\titerate: (self -> 'fields'), (local: 'fieldpair');\n\t\t\t#onefield = #fieldpair -> value;\n\t\t\t#fieldvalue = (#onefield -> (find: 'value'));\n\t\t\t#fieldvalue_array = #fieldvalue;\n\t\t\tif: #fieldvalue_array -> type != 'array';\n\t\t\t\tif: #fieldvalue_array >> '\\r'; // Filemaker value list with multiple checked\n\t\t\t\t\t#fieldvalue_array = #fieldvalue_array -> (split: '\\r');\n\t\t\t\telse: #fieldvalue_array >> ','; // Other database with multiple checked\n\t\t\t\t\t#fieldvalue_array = #fieldvalue_array -> (split: ',');\n\t\t\t\telse;\n\t\t\t\t\t#fieldvalue_array = array: #fieldvalue_array;\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t\tif: #onefield >> 'options';\n\t\t\t\t#options = (#onefield -> find: 'options');\n\t\t\t\t// convert types for pair \n\t\t\t\titerate: #options, (local: 'option');\n\t\t\t\t\tif: #option -> type != 'pair';\n\t\t\t\t\t\t#option = (pair: #option = #option);\n\t\t\t\t\t/if;\n\t\t\t\t\t// name must be string to make sure comparsions work\n\t\t\t\t\t(#option -> name) = (string: #option -> name);\n\t\t\t\t/iterate;\n\t\t\t/if;\n\t\t\tif: loop_count >= #from \n\t\t\t\t&& loop_count <= #to\n\t\t\t\t&& #type >> #onefield -> (find: 'type')\n\t\t\t\t&& !(#excludetype >> #onefield -> (find: 'type'));\n\n\t\t\t\tif: #onefield -> (find: 'template') -> size;\n\t\t\t\t\t#renderrow = #onefield -> (find: 'template');\n\t\t\t\telse: (map: 'submit', 'reset', 'image') >> #onefield -> (find: 'type');\n\t\t\t\t\t#renderrow=#buttontemplate;\n\t\t\t\telse;\n\t\t\t\t\t#renderrow=#template;\n\t\t\t\t/if;\n\n\t\t\t\tif: (self -> 'exceptionfieldtypes') >> (#onefield -> (find: 'type'));\n\t\t\t\t\t#renderrow -> (replace: '#label#:', '');\n\t\t\t\t\t#renderrow -> (replace: '#label#', '');\n\t\t\t\telse: (#onefield -> (find: 'label')) != '';\n\t\t\t\t\t#renderrow -> (replace: '#label#', (#onefield -> (find: 'label') ));\n\t\t\t\telse: \n\t\t\t\t\t#renderrow -> (replace: '#label#:', '');\n\t\t\t\t\t#renderrow -> (replace: '#label#', '');\n\t\t\t\t/if;\n\t\t\t\tif: (map: 'radio', 'checkbox', 'select') >> (#onefield -> (find: 'type'));\n\t\t\t\t\t#renderfield = string;\n\t\t\t\t\titerate: #fieldvalue_array, local: 'onefieldvalue';\n\t\t\t\t\t\tif: loop_count > 1;\n\t\t\t\t\t\t\t#renderfield += ( (#onefield -> find: 'linebreak') ? '\\n' | ', ');\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\tif: #options >> #onefieldvalue;\n\t\t\t\t\t\t\t// show the display text for a selected option\n\t\t\t\t\t\t\t#renderfield += (encode_break: (#options -> (find: #onefieldvalue) -> first -> value));\n\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t// show the option value itself\n\t\t\t\t\t\t\t#renderfield += (encode_break: #onefieldvalue);\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/iterate;\n\t\t\t\telse: (#onefield -> (find: 'type')) == 'html';\n\t\t\t\t\t#renderrow = #template;\n\t\t\t\t\t#renderrow -> (replace: '#label#:', '');\n\t\t\t\t\t#renderrow -> (replace: '#label#', '');\n\t\t\t\t\t#renderrow -> (replace: '#required#', '');\n\t\t\t\t\t#renderfield = #fieldvalue + '\\n';\n\t\t\t\telse: (#onefield -> (find: 'type')) == 'legend';\n\t\t\t\t\t#renderrow = '';\n\t\t\t\t\tif: (self -> 'render_fieldset_open');\n\t\t\t\t\t\t#output += '
\\n';\n\t\t\t\t\t\t(self -> 'render_fieldset_open') = false;\n\t\t\t\t\t/if;\n\t\t\t\t\t#output += '
\\n';\n\t\t\t\t\t#output += '' + (encode_html: #fieldvalue) + '';\n\t\t\t\t\t(self -> 'render_fieldset_open') = true;\n\t\t\t\telse: (#onefield -> (find: 'type')) == 'fieldset';\n\t\t\t\t\t#renderrow = '';\n\t\t\t\t\tif: (self -> 'render_fieldset_open');\n\t\t\t\t\t\t#output += '
\\n';\n\t\t\t\t\t\t(self -> 'render_fieldset_open') = false;\n\t\t\t\t\t/if;\n\t\t\t\t\tif: #fieldvalue != false;\n\t\t\t\t\t\t#output += '
\\n'; // must contain a legend\n\t\t\t\t\t\t(self -> 'render_fieldset_open') = true;\n\t\t\t\t\t/if;\n\t\t\t\telse;\n\t\t\t\t\t#renderfield = (encode_break: #fieldvalue);\n\t\t\t\t/if;\n\t\t\t\t#renderrow -> (replace: '#field#', #renderfield);\n\t\t\t\t#output += #renderrow;\n\t\t\t/if;\n\t\t/iterate;\n\t\tif: (local_defined: 'legend') && (self -> 'render_fieldset2_open');\n\t\t\t// inner fieldset is open\n\t\t\t(self -> 'render_fieldset2_open') = false;\n\t\t\t#output += '
\\n';\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: #output;\n\t/define_tag;\n\n\tdefine_tag: 'getvalue', -description='Returns the current value of a form field. Returns an array for repeated form fields. ',\n\t\t-required='name', -type='string',\n\t\t-optional='index', -type='integer', -copy;\n\t\t!local_defined('index') ? local('index' = 1);\n\t\t#index < 1 ? #index = 1;\n\t\tif: (self -> 'fields') >> #name;\n\t\t\tif(#index > (self -> 'fields') -> find(#name) -> size);\n\t\t\t\treturn;\n\t\t\t/if;\n\t\t\treturn: (self -> 'fields') -> (find: #name) -> get(#index) -> value -> (find: 'value');\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'getlabel', -description='Returns the label for a form field. ',\n\t\t-required='name', -type='string';\n\t\tif: (self -> 'fields') >> #name;\n\t\t\treturn: (self -> 'fields') -> (find: #name) -> first -> value -> (find: 'label');\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'setvalue', -description='Sets the value for a form field. \\\n\t\t\t\tEither form -> (setvalue: fieldname=newvalue) or form -> (setvalue: -name=fieldname, -value=newvalue)',\n\t\t-required='name',\n\t\t-optional='value',\n\t\t-optional='index', -type='integer', -copy;\n\t\tlocal: 'timer'=knop_timer; \n\t\t// either -> (setvalue: 'fieldname'='newvalue') or -> (setvalue: -name='fieldname', -value='newvalue')\n\t\tlocal: '_name'=#name, '_value'=(local: 'value');\n\t\t!local_defined('index') ? local('index' = 1);\n\t\t#index < 1 ? #index = 1;\n\t\tif: #name -> type == 'pair';\n\t\t\t#_name = #name -> name;\n\t\t\t#_value = #name -> value;\n\t\t/if;\n\t\tif: (self -> 'fields') >> #_name;\n\t\t\tif(#index > (self -> 'fields') -> find(#_name) -> size);\n\t\t\t\treturn;\n\t\t\t/if;\n\t\t\t// first remove value to break reference\n\t\t\t((self -> 'fields') -> get((self -> 'fields') -> (findindex: #_name) -> get(#index)) -> value) -> (remove: 'value');\n\t\t\t((self -> 'fields') -> get((self -> 'fields') -> (findindex: #_name) -> get(#index)) -> value) -> (insert: 'value'=#_value);\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'removefield', -description='Removes all form elements with the specified name from the form',\n\t\t-required='name', -type='string';\n\t\tlocal: 'timer'=knop_timer; \n\t\t(self -> 'fields') -> (removeall: #name);\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\tdefine_tag: 'keys', -description='Returns an array of all field names';\n\t\tlocal: 'timer'=knop_timer; \n\t\tlocal: 'output'=array;\n\t\titerate: (self -> 'fields'), (local: 'fieldpair');\n\t\t\t#output -> (insert: #fieldpair -> name);\n\t\t/iterate;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: #output;\n\t/define_tag;\n\n\n\tdefine_tag: 'keyvalue'; \t\t\treturn: (self -> 'db_keyvalue');\t\t/define_tag;\n\tdefine_tag: 'lockvalue'; \t\t\treturn: (self -> 'db_lockvalue');\t\t/define_tag;\n\tdefine_tag: 'lockvalue_decrypted';\n\t\t(self -> 'database') -> type != 'database' ? return;\n\t\treturn: (decrypt_blowfish: (self -> 'db_lockvalue'), -seed=(self -> 'database' -> 'lock_seed'));\n\t/define_tag;\n\tdefine_tag: 'database'; \t\t\treturn: (self -> 'database');\t\t\t/define_tag;\n\n\tdefine_tag: 'formmode', -description='Returns add or edit after for -> init has been called';\n\t\tlocal: 'timer'=knop_timer; \n\t\tif: (self -> getbutton) == 'add';\n\t\t\t// this is needed to keep the right form mode after a failed add\n\t\t\t(self -> 'formmode') = 'add';\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n \t\treturn: (self -> 'formmode');\n \t/define_tag;\n\n\tdefine_tag: 'error_code';\n\t\t// custom error_code for knop_form\n\t\tif: (self -> 'error_code');\n\t\t\treturn: integer: (self -> 'error_code');\n\t\telse: (self -> 'errors') -> type == 'array' && (self -> 'errors') -> size > 0;\n\t\t\t(self -> 'error_code') = 7101;\n\t\t\treturn: (self -> 'error_code');\n\t\telse;\n\t\t\treturn: 0;\n\t\t/if;\n\t/define_tag;\n\n\n\t\n\tdefine_tag: 'afterhandler', -description='Internal member tag. Adds needed javascripts through an atend handler that will be processed when the entire page is done. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-headscript (optional) A single script, will be placed before (or at top of page if is missing)\\n\\\n\t\t\t-endscript (optional) Multiple scripts (no duplicates), will be placed before (or at end of page if is missing)',\n\t\t-optional='headscript', -type='string',\n\t\t-optional='endscript', -type='string';\n\t\t// adds needed javascripts through an atend handler that will be processed when the entire page is done\n\n\t\tif: !(var_defined: 'knop_afterhandler_data');\n\t\t\tvar: 'knop_afterhandler_data'=map;\n\t\t\tdefine_atend: { // this will run after the page is done processing\n\t\t\t\tif: $knop_afterhandler_data >> 'headscript';\n\t\t\t\t\t// put before or at beginning of page\n\t\t\t\t\tlocal: 'scriptdata'='\\n';\n\t\t\t\t\tif: content_body >> '';\n\t\t\t\t\t\tcontent_body -> (replace: '', #scriptdata + '');\n\t\t\t\t\telse;\n\t\t\t\t\t\tcontent_body = #scriptdata + content_body;\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t\tif: $knop_afterhandler_data >> 'endscript';\n\t\t\t\t\t// put before or at end of page\n\t\t\t\t\tlocal: 'scriptdata'='\\n\\n\\n\\n\\n';\n\t\t\t\t\tif: content_body >> '';\n\t\t\t\t\t\tcontent_body -> (replace: '', #scriptdata + '');\n\t\t\t\t\telse;\n\t\t\t\t\t\tcontent_body += #scriptdata;\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t};\n\t\t/if;\n\t\t\n\t\tif: (local_defined: 'headscript');\n\t\t\t// add to current headscript\n\t\t\tif: $knop_afterhandler_data !>> 'headscript';\n\t\t\t\t$knop_afterhandler_data -> (insert: 'headscript' = array);\n\t\t\t/if;\n\t\t\tif: $knop_afterhandler_data -> (find: 'headscript') !>> #headscript;\n\t\t\t\t$knop_afterhandler_data -> (find: 'headscript') -> insert(#headscript);\n\t\t\t/if;\n\t\t/if;\n\t\tif: (local_defined: 'endscript');\n\t\t\t// add to current endscript\n\t\t\tif: $knop_afterhandler_data !>> 'endscript';\n\t\t\t\t$knop_afterhandler_data -> (insert: 'endscript' = array);\n\t\t\t/if;\n\t\t\tif: $knop_afterhandler_data -> (find: 'endscript') !>> #endscript;\n\t\t\t\t$knop_afterhandler_data -> (find: 'endscript') -> insert(#endscript);\n\t\t\t/if;\n\t\t/if;\n\t/define_tag;\n/define_type;\n\n\n?>\n[\n//------------------------------------------------------------------\n// End knop_form\n//------------------------------------------------------------------\n\n//##################################################################\n\n][\n//------------------------------------------------------------------\n// Begin knop_grid\n//------------------------------------------------------------------\n\n] and \n2010-12-23\tSP\tCorrected pagination bug for -numbered.\n2010-11-17\tJC\tAdded -startwithfooter flag to grid->renderhtml. This moves the footer before the column titles in the table header.\n2010-11-17\tJC\tChanged rawheader inclusion to work even if there's no quicksearch for a grid\n2010-05-14\tJC\tAdded span separation on grid footer for better styling\n2010-03-06\tSP\tChanged default behavior of ->sortparams and ->quicksearch with -sql to add backticks between the table and column names. Now JOINs may be used.\n2010-03-06\tSP\tAdded ->sortparams and ->quicksearch with -removedotbackticks for backward compatibility for fields that contain periods. If you use periods in a fieldname then you cannot use a JOIN in Knop.\n2010-01-27\tJC\tAdjusted the id support\n2010-01-25\tJC\tAdded support for optional id, used by table, quicksearch and quicksearch_reset\n2009-09-18\tJS\tSyntax adjustments for Lasso 9\n2009-08-26\tJS\tCorrected prev/next links when no nav is defined for the grid object\n2009-06-29\tJS\t->renderlisting: documentation correction (renderlisting never calls renderfooter). \n2009-01-11\tJS\t->renderlisting: Made sure that template isn't applied on NULL field values since that would cause an error with ->replace \n2008-12-29\tJC\tSupport for optional classes in table header\n2008-11-27\tJC\t-> implemented support for td specific classes. The class is inserted in both the TH and TD tag for the specified field\n2008-09-24\tJS\t->sortparams: fieldnames specified by the -sort parameter are now validated so they exist in the database\n2008-09-24\tJS\t->sortparams, ->quicksearch: Added protection against backtick sql injection in MySQL object names\n2008-09-10\tJS\t-numbered can now be specified at oncreate in addition to ->renderhtml and ->renderfooter. \n2008-09-08\tJS\t->sortfield changed so defaultsort is honored even if -nosort is specified (-nosort is only used to prevent the user from changing sort order on the fly)\n2008-09-08\tJS\t->renderlisting and ->renderfooter optimized by caching the result of nav->url. \n2008-05-15\tJS\t->renderfooter: minor adjustment to numbered pagination links\n2008-05-14\tJS\t->renderfooter (and ->renderhtml): added -numbered as option to get google style numbered pagination links. Render the grid with -numbered (defaults to show 6 page number links plus the far ends) or -numbered=10 or another number. \n2008-05-13\tJS\tAdded ->renderlisting which is now part of ->renderhtml for more flexibility\n2008-02-25\tJS\t->renderheader and ->renderfooter calls nav -> url with -getargs \n2008-01-22\tJS\t->renderheader, ->renderfooter, ->renderhtml: addded -autoparams to nav -> url used in links since url was changed to default to no autoparams. \n2008-01-22\tJS\t->renderheader, ->renderfooter, ->renderhtml: improved support for param based navigation method in links, cleaned up linking to use nav -> url instead of self -> urlparams when nav is available\n2008-01-22\tJC\t->quicksearch: Changed wordseparators so that \\r and \\n aren't placed as \\r\\n, otherwise they are treated as a single character by ->split. \n2007-12-11\tJS\tAdded documentation as -description to most member tags, to be used by the new ->help tag\n2007-12-11\tJS\tMoved ->help to knop_base\n2007-12-03\tJS\tAdded optional -language parameter to set the initial language for the grid object\n2007-12-03\tJS\tAdded -> lang to provide a reference to the knop_lang object that is used for localized strings\n2007-12-03\tJS\tAdded localized strings for English and Swedish\n2007-12-03\tJS\tAdded knop_lang to handle localized strings\n2007-11-11\tJC\tAdded optional -rawheader for extra header content to be inserted before the Quicksearch form\n2007-10-23\tJS\t->renderheader: added class=\"grid\" to the opening table tag to be able to isolate the css specifications\n2007-10-03\tJS\t->renderfooter: added unique classes for each type of prev/next link to be able to replace with images using css\n2007-10-03\tJS\t->renderfooter: Changed prev/next link texts to simple |< << >> >| instead of unicode glyphs\n2007-09-20\tJS\tPostparams are only sent along for nav params (not \"-\" params)\n2007-09-07\tJS\tAlso send postparams along in prev/next links (not only getparams)\n2007-09-06\tJS\tIf nav has params defined, those params will be sent along with prev/next links\n2007-09-06\tJS\tAdded encode_url for link params\n2007-09-06\tJS\tChanged -action to -formaction in the quicksearch form\n2007-08-08\tJS\t->urlargs: Added exception for -session\n2007-06-18\tJS\tAdded tag timer to most member tags\n2007-06-13\tJS\tadded inheritance from knop_base\n2007-06-11\tJC\tadded handling of xhtml output\n2007-05-30\tJS\t->quicksearch: added \\r and \\n as word separators. \n2007-05-03\tJS\t->addfield: Added check for empty dbfield name before adding to dbfieldmap\n2007-04-19\tJS\t->quicksearch: added -value (flag) that makes quicksearch output just the value of the quicksearch field instead of a query\n2007-04-13\tJS\t->oncreate: added -nosort as global flag (overrides column specific sort options)\n2007-04-13\tJS\t->renderfooter: Added tbody to footer to make it pass validation, but it's still not semantically correct. \n2007-04-13\tJS\tChanged field type for quicksearch for non-WebKit based browsers\n2007-04-10\tJS\t->quicksearch: Added @ as word separator for \"word begins with\" search\n2007-04-10\tJS\t->quicksearch: Added -contains as option to perform a simple contains search instead of emulating \"word begins with\" search\n2007-04-10\tJS\t->renderheader: When grid has a defaultsort, there should be no \"unsort\" option in the sortable headings\n2007-04-10\tJS\t->insert: (-defaultsort='desc') or (-defaultsort='descending') makes the default sort order sort in descending order\n2007-04-04\tJS\t->addfield: -template can now also be a compound expression\n2007-04-03\tJS\tChanged namespace from mt_ to knop_\n2007-03-01\tJS\tAdded support for FileMaker with quicksearch (untested)\n2007-03-01\tJS\tChanged all texts to English\n2007-02-07\tJS\tRemoved classs=\"first\" and class=\"notopborder\" since CSS border-collapse: collapse; eliminates the need\n2007-02-05\tJS The -keyvalue parameter for url edit links can be given another name by specifying -keyparamname in addfield\n2007-01-31\tJS\t->addfield: #value# can be used in -url, as a way to provide mailto links etc in lists\n2007-01-30\tJS\tSortable columns now thave three states instead of two: sorted ascending, sorted descending and unsorted. \n2007-01-30\tJS\tImprovements to quicksearch, to emulate \"word begins with\" searches\n2007-01-26\tJS\tAdded support for quicksearch field in grid header. Specify -quicksearch at ->oncreate, and tell what fields to search by specifying -quicksearch for those fields at ->addfield. \n\t\t\t\tFields can be search only (no display) by leaving out name and label. All specified fields are searched word for word of thew search string. \n\t\t\t\tUse ->quicksearch to get the search parameters (optionally -sql)\n2007-01-26\tJS\tAdded ->urlargs to get a querystring with all \"-\" GET params, except those in optional -except string or array parameter. \n2007-01-22\tJS\tAdjustments to highlighting and \"(redigera)\"-link for records with empty values in the linked field\n2007-01-19\tJS\tAdded href titles to sort links and prevnext links\n2007-01-19\tJS\tCorrected sortparams when no sortfield is specified\n2007-01-19\tJS\tAddded go to first page, go to last page in footer\n2007-01-19\tJS\tAdded member tag page_skiprecords to help correcting out of bounds page numbers\n2007-01-19\tJS\tAdded member tag lastpage\n2007-01-18\tJS\tSupport for highlighting of affected record after edit or update (class name \"highlight\")\n2007-01-17\tJS\tAdded addfield: -template\n\nTODO\nMake it possible for knop_grid to work independently of a knop_database object so other types of listings can bre created. \nLanguage of quicksearch buttons can't be changed after the grid has been created\ntbody is used in renderfooter, which is not semantically correct. can't use tfoot though since the footer is rendered twice. \nMove templates to a member tag to be make it easier to subclass\nChange ->addfield to ->insert and make ->addfield deprecated\n\n*/\n\n\t// instance variables\n\tlocal: 'fields'=array,\n\t\t'dbfieldmap'=map,\n\t\t'sortfield'=string,\n\t\t'defaultsort'=string,\n\t\t'page'=integer,\n\t\t'sortdescending'=false,\n\t\t'database'=null,\n\t\t'nav'=null,\n\t\t'debug_trace'=array,\n\t\t'quicksearch'=string,\n\t\t'quicksearch_form',\n\t\t'quicksearch_form_reset',\n\t\t'rawheader' = string, // added by Jolle 071111\n\t\t'class' = string, // Added by Jolle 081229\n\t\t'tbl_id' = 'grid', // Added by Jolle 100125\n\t\t'qs_id' = 'quicksearch', // Added by Jolle 100125\n\t\t'qsr_id' = 'qs_reset', // Added by Jolle 100125\n\t\t'quicksearch_fields'=array,\n\t\t'footer' = string, // Added by Jolle 101117\n\t\t'lang'=(knop_lang: -default='en', -fallback),\t\t// language strings object \n\t\t'error_lang'=(knop_lang: -default='en', -fallback),\n\t\t'numbered'=false,\n\t\t'nosort';\n\n\t#lang -> (addlanguage: -language='en', -strings=(map: \n\t\t'quicksearch_showall' = 'Show all',\n\t\t'quicksearch_search' = 'Search',\n\t\t'linktext_edit' = '(edit)',\n\t\t'linktitle_showunsorted' = 'Show unsorted',\n\t\t'linktitle_changesort' = 'Change sort order to',\n\t\t'linktitle_ascending' = 'ascending',\n\t\t'linktitle_descending' = 'descending',\n\t\t'linktitle_sortascby' = 'Sort ascending by',\n\t\t'linktitle_gofirst' = 'Go to first page',\n\t\t'linktitle_goprev' = 'Go to previous page',\n\t\t'footer_shown' = '#1# - #2# of',\n\t\t'footer_found'='found',\n\t\t'linktext_gotopage'='Go to page', // SP customization\n\t\t'linktitle_gonext' = 'Go to next page',\n\t\t'linktitle_golast' = 'Go to last page',\n\n\t\t// language neutral strings, only need to be set for the default language\n\t\t'linktext_first'='|<',\n\t\t'linktext_prev'='<<',\n\t\t'linktext_next'='>>',\n\t\t'linktext_last'='>|'\n\t\t\t));\n\t\t\t\n\t#lang -> (addlanguage: -language='sv', -strings=(map: \n\t\t'quicksearch_showall' = 'Visa alla',\n\t\t'quicksearch_search' = 'Sök',\n\t\t'linktext_edit' = '(redigera)',\n\t\t'linktitle_showunsorted' = 'Visa osorterade',\n\t\t'linktitle_changesort' = 'Ändra sorteringsordning till',\n\t\t'linktitle_ascending' = 'stigande',\n\t\t'linktitle_descending' = 'fallande',\n\t\t'linktitle_sortascby' = 'Sortera i stigande ordning efter',\n\t\t'linktitle_gofirst' = 'Gå till första sidan',\n\t\t'linktitle_goprev' = 'Gå till föregående sida',\n\t\t'footer_shown' = '#1# - #2# av',\n\t\t'footer_found'='hittade',\n\t\t'linktext_gotopage'='Gå till sida', // SP cüstømizätiøn\n\t\t'linktitle_gonext' = 'Gå till nästa sida',\n\t\t'linktitle_golast' = 'Gå till sista sidan'\n\t));\n\t\n\tdefine_tag: 'oncreate', -description='Parameters:\\n\\\n\t\t\t-database (required database) Database object that the grid object will interact with\\n\\\n\t\t\t-nav (optional nav) Navigation object to interact with\\n\\\n\t\t\t-quicksearch (optional) Label text for the quick search field\\n\\\n\t\t\t-rawheader (optional) Extra html to be inserted in the grid header\\n\\\n\t\t\t-class (optional) Extra classes to be inserted in the grid header. The standard class \"grid\" is always inserted\\n\\\n\t\t\t-id (optional) Creates a custom id used for table, quicksearch and quicksearch_reset\\n\\\n\t\t\t-nosort (optional flag) Global setting for the entire grid (overrides column specific sort options)\\n\\\n\t\t\t-language (optional) Language to use for the grid, defaults to the browser\\'s preferred language\\n\\\n\t\t\t-numbered (optional flag or integer) If specified, pagination links will be shown as page numbers instead of regular prev/next links. Defaults to 6 links, specify another number (minimum 6) if more numbers are wanted. Can be specified in ->renderhtml as well. ',\n\t\t-required='database', -type='database',\n\t\t-optional='nav', -type='nav',\n\t\t-optional='quicksearch',\n\t\t-optional='rawheader',\n\t\t-optional='class',\n\t\t-optional='id',\n\t\t-optional='nosort',\n\t\t-optional='language',\n\t\t-optional='numbered';\n\t\tlocal: 'timer'=knop_timer; \n\t\t\n\t\tlocal: 'lang'=@(self -> 'lang');\n\t\t\n\t\tif: (local_defined: 'language');\n\t\t\t#lang -> (setlanguage: #language);\n\t\t/if;\n\t\t\n\t\t// the following params are stored as reference, so the values of the params can be altered after adding a field simply by changing the referenced variable. \n\t\tlocal_defined('database') ? (self -> 'database' = @#database);\n\t\tlocal_defined('nav') ? (self -> 'nav' = @#nav);\n\n\t\t(self -> 'nosort')=local_defined('nosort');\n\n\t\tif(local_defined('numbered'));\n\t\t\t(self -> 'numbered')=((#numbered !== false) ? integer(#numbered) | false);\n\t\t/if;\n\t\t(local_defined('class') && #class -> type == 'string') ?\n\t\t\t(self -> 'class') = #class;\n\t\t\n\t\tif(local_defined('id') && #id -> type == 'string');\n\t\t\t(self -> 'tbl_id') = #id + '_grid';\n\t\t\t(self -> 'qs_id') = #id + '_quicksearch';\n\t\t\t(self -> 'qsr_id') = #id + '_qs_reset';\n\t\t/if;\n\n\n\t\tlocal: 'clientparams'=client_getparams;\n\t\t#clientparams -> (merge: client_postparams);\n\t\tif: !(self -> 'nosort');\n\t\t\t(self -> 'sortfield') = (#clientparams >> '-sort' ? (#clientparams -> (find: '-sort') -> first -> value) | string);\n\t\t\t(self -> 'sortdescending') = (#clientparams >> '-desc');\n\t\t/if;\n\t\t(self -> 'page') = (#clientparams >> '-page' ? (integer: (#clientparams -> (find: '-page') -> first -> value)) | 1);\n\t\t(self -> 'page') < 1 ? (self -> 'page') = 1;\n\n\t\tif: (local_defined: 'quicksearch');\n\t\t\tif: #quicksearch != '';\n\t\t\t\t(self -> 'quicksearch') = #quicksearch;\n\t\t\telse;\n\t\t\t\t(self -> 'quicksearch') = 'Quicksearch';\n\t\t\t/if;\n\t\t\t(self -> 'quicksearch_form') = (knop_form: -name='quicksearch', -id = (self -> 'qs_id'), -formaction='./', -method='get', -template='#field#\\n', -noautoparams);\n\t\t\t(self -> 'quicksearch_form_reset') = (knop_form: -name='quicksearch_reset', -id = (self -> 'qsr_id'), -formaction='./', -method='get', -template='#field#\\n', -noautoparams);\n\t\t\tlocal: 'autosavekey'=server_name + response_path;\n\t\t\tif: (self -> 'nav') -> type =='nav' && (self -> 'nav') -> 'navmethod'=='param';\n\t\t\t\t(self -> 'quicksearch_form') -> (addfield: -type='hidden', -name='-path', -value=((self -> 'nav') -> path));\n\t\t\t\t(self -> 'quicksearch_form_reset') -> (addfield: -type='hidden', -name='-path', -value=((self -> 'nav') -> path));\n\t\t\t\t#autosavekey -> (removetrailing: '/');\n\t\t\t\t#autosavekey += '/' + ((self -> 'nav') -> path);\n\t\t\t/if;\n\t\t\tif: (self -> 'sortfield') != '' && !(self -> 'nosort');\n\t\t\t\t(self -> 'quicksearch_form') -> (addfield: -type='hidden', -name='-sort', -value=(self -> 'sortfield'));\n\t\t\t\t(self -> 'quicksearch_form_reset') -> (addfield: -type='hidden', -name='-sort', -value=(self -> 'sortfield'));\n\t\t\t\tif: (self -> 'sortdescending');\n\t\t\t\t\t(self -> 'quicksearch_form') -> (addfield: -type='hidden', -name='-desc');\n\t\t\t\t\t(self -> 'quicksearch_form_reset') -> (addfield: -type='hidden', -name='-desc');\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t\tif: client_type >> 'WebKit';\n\t\t\t\t// only use 'quicksearch_form') -> (addfield: -type='search', -name='-q', -hint=(self -> 'quicksearch'), \n\t\t\t\t\t-size=15, -id = (self -> 'qs_id') + '_q', -raw='autosave=\"' + #autosavekey + '\" results=\"10\"');\n\t\t\telse;\n\t\t\t\t(self -> 'quicksearch_form') -> (addfield: -type='text', -name='-q', -hint=(self -> 'quicksearch'), \n\t\t\t\t\t-size=15, -id = (self -> 'qs_id') + '_q');\n\t\t\t/if;\n\t\t\t(self -> 'quicksearch_form') -> (addfield: -type='submit', -name='s', -value=(#lang -> quicksearch_search));\n\t\t\tif: #clientparams >> '-q';\n\t\t\t\t(self -> 'quicksearch_form') -> (setvalue: '-q'=(#clientparams -> (find: '-q') -> first -> value));\n\t\t\t\t(self -> 'quicksearch_form_reset') -> (addfield: -type='submit', -name='a', -value=(#lang -> quicksearch_showall));\n\t\t\telse;\n\t\t\t\t(self -> 'quicksearch_form_reset') -> (addfield: -type='submit', -name='a', -value=(#lang -> quicksearch_showall), -disabled);\n\t\t\t/if;\n\t\t/if;\n\n\t\t/* Added by JC 071111 to handle extra form included in the header */\n\t\tif: (local_defined: 'rawheader');\n\t\t\tif: #rawheader -> type == 'string';\n\t\t\t\t(self -> 'rawheader') = #rawheader;\n\t\t\telse;\n\t\t\t\t(self -> 'rawheader') = '';\n\t\t\t/if;\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'onassign', -required='value', -description='Internal, needed to restore references when ctype is defined as prototype';\n\t\t// recreate references here\n\t\t(self->'database') = @(#value -> 'database');\n\t\t(self->'nav') = @(#value -> 'nav');\n\t/define_tag;\n\n\tdefine_tag: 'lang', -description='Returns a reference to the language object';\n\t\treturn: @(self -> 'lang');\n\t/define_tag;\n\n\t\n\tdefine_tag: 'addfield', -description='Adds a column to the record listing. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-name (optional) Name of the field. If not specified, the field will be omitted from the grid. \\\n\t\t\t\tUseful to be able to quicksearch in fields not shown in the grid. \\\n\t\t\t\tIn that case -dbfield must be specified. \\n\\\n\t\t\t-label (optional) Column heading\\n\\\n\t\t\t-dbfield (optional) Corresponding database field name (name is used if dbfield is not specified)\\n\\\n\t\t\t-width (optional) Pixels (CSS width)\\n\\\n\t\t\t-url (optional) Columns will be linked with this url as base. Can contain #value# for example to create clickable email links. \\n\\\n\t\t\t-keyparamname (optional) Param name to use instead of the default -keyvalue for edit links\\n\\\n\t\t\t-defaultsort (optional flag) This field will be the default sort field\\n\\\n\t\t\t-nosort (optional flag) The field header should not be clickable for sort\\n\\\n\t\t\t-template (optional) Either string to format values, compound expression or map containing templates to display individual values in different ways, use -default to display unknown values, use #value# to insert the actual field value in the template. \\n\\t\\\n\t\t\t\tIf a compound expression is specified, the field value is passed as param to the expression and can be accessed as params. \\n\\t\\\n\t\t\t\tExample expressions: \\n\\t\\\n\t\t\t\t{return: params} to return just the field value as is\\n\\t\\\n\t\t\t\t{return: (date: (field: \"moddate\")) -> (format: \"%-d/%-m\")} to return a specific field as formatted date\\n\\\n\t\t\t-quicksearch (optional flag) If specified, the field will be used for search with quicksearch',\n\t\t-optional='name',\n\t\t-optional='label',\n\t\t-optional='dbfield',\n\t\t-optional='width',\n\t\t-optional='class',\n\t\t// -optional='raw',\t\t// TODO: not implemented \n\t\t-optional='url',\n\t\t-optional='keyparamname',\n\t\t-optional='defaultsort',\n\t\t-optional='nosort',\n\t\t-optional='template',\n\t\t-optional='quicksearch';\n\t\tlocal: 'timer'=knop_timer; \n\t\t\n\t\tfail_if: (local_defined: 'template') && #template -> type != 'string' \n\t\t\t&& #template -> type != 'map' \n\t\t\t&& #template -> type != 'tag', -1, 'Template must be either string, map or compound expression';\n\t\tlocal: 'field'=map;\n\n\t\tlocal_defined('name') ? #field -> insert('name' = #name); \n\t\tlocal_defined('class') ? #field -> insert('class' = #class); \n\t\tlocal_defined('url') ? #field -> insert('url' = #url); \n\t\tlocal_defined('keyparamname') ? #field -> insert('keyparamname' = #keyparamname); \n\t\tlocal_defined('width') ? #field -> insert('width' = #width);\n\t\t#field !>> 'keyparamname' ? #field -> (insert: 'keyparamname' = '-keyvalue');\n\t\t\n\t\tif: (local_defined: 'template');\n\t\t\t#field -> (insert: 'template'=(#template -> type == 'string' ? (map: '-default'=#template) | #template));\n\t\t/if;\n\t\tif: (local_defined: 'name');\n\t\t\t#field -> (insert: 'label'=( (local_defined: 'label') ? #label | #name ) );\n\t\t\t#field -> (insert: 'dbfield'=( (local_defined: 'dbfield') ? #dbfield | #name ) );\n\t\t\t#field -> (insert: 'nosort'=(local_defined: 'nosort'));\n\t\t\tif(local_defined('defaultsort')\n\t\t\t\t//&& !(local_defined: 'nosort') \n\t\t\t\t&& (self -> 'defaultsort') == ''\n\t\t\t\t//&& !(self -> 'nosort')\n\t\t\t\t); \n\t\t\t\t(self -> 'defaultsort') = #name;\n\t\t\t\tif: (self -> 'sortfield') == '';\n\t\t\t\t\t(self -> 'sortfield') = (self -> 'defaultsort');\n\t\t\t\t\tif: #defaultsort == 'desc' || #defaultsort == 'descending';\n\t\t\t\t\t\t(self -> 'sortdescending') = true;\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t\t(self -> 'dbfieldmap') -> (insert: #name = ((local_defined: 'dbfield') && #dbfield != '' ? #dbfield | #name));\n\t\t/if;\n\t\t(local_defined: 'quicksearch') ? (self -> 'quicksearch_fields') -> (insert: ((local_defined: 'dbfield') ? #dbfield | (local: 'name')));\n\t\t\n\t\tif(local_defined('name') || local_defined('label'));\n\t\t\t(self -> 'fields') -> (insert: #field);\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\tdefine_tag: 'sortparams', -description='Returns a Lasso-style pair array with sort parameters to use in the search inline.\\n\\\n\t\tParameters:\\n\\\n\t\t-sql (optional)\\n\\\n\t\t-removedotbackticks (optional flag) Use with -sql for backward compatibility for fields that contain periods. If you use periods in a fieldname then you cannot use a JOIN in Knop.',\n\t\t-optional='sql',\n\t\t-optional='removedotbackticks';\n\t\tlocal: 'timer'=knop_timer; \n\t\tif: local_defined: 'sql';\n\t\t\tfail_if: (self -> 'database') -> 'isfilemaker', 7009, '-sql can not be used with FileMaker';\n\t\t\t(self -> 'sortfield') == '' ? return;\n\t\t\tlocal('output'=string);\n\t\t\tif: (self -> 'dbfieldmap') >> (self -> 'sortfield');\n\t\t\t\t#output=' ORDER BY ';\n\t\t\t\tif(local_defined('removedotbackticks'));\n\t\t\t\t\t#output += '`' + knop_stripbackticks((self -> 'dbfieldmap') -> find(self -> 'sortfield')) + '`';\n\t\t\t\telse;\n\t\t\t\t\t#output += '`' + string_replace(knop_stripbackticks((self -> 'dbfieldmap') -> find(self -> 'sortfield')), -find='.', -replace='`.`') + '`';\n\t\t\t\t/if;\n\t\t\t\tif: (self -> 'sortdescending');\n\t\t\t\t\t#output += ' DESC';\n\t\t\t\t/if;\n\t\t\t/if;\n\t\telse;\n\t\t\tlocal: 'output'=array;\n\t\t\t(self -> 'sortfield') == '' ? return: @#output;\n\t\t\tif: (self -> 'dbfieldmap') >> (self -> 'sortfield');\n\t\t\t\t#output -> (insert: -sortfield=(self -> 'dbfieldmap') -> (find: (self -> 'sortfield')) );\n\t\t\t\tif: (self -> 'sortdescending');\n\t\t\t\t\t#output -> (insert: -sortorder='descending');\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @#output;\n\t/define_tag;\n\n\tdefine_tag: 'quicksearch', -description='Returns a pair array with fieldname=value to use in a search inline. If you specify several fields in the grid as -quicksearch (visible or not), they will be treated as if they were one single concatenated field. Quicksearch will take each word entered in the search field and search for them in the combined set of quicksearch fields, performing a \"word begins with\" match (unless you specify -contains when calling -> quicksearch).\\n\\\n\t\t\tSo if you enter dev joh it will find records with firstname=Johan, occupation=Developer.\\n\\\n\t\t\tIf you\\'re familiar with how FileMaker performs text searches, this is the way quicksearch tries to behave.\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-sql (optional flag) Return an SQL string for the search parameters instead.\\n\\\n\t\t\t-contains (optional flag) Perform a simple contains search instead of emulating \"word begins with\" search\\n\\\n\t\t\t-value (optional flag) Output just the search value of the quicksearch field instead of a pair array or SQL string\\n\\\n\t\t\t-removedotbackticks (optional flag) Use with -sql for backward compatibility for fields that contain periods. If you use periods in a fieldname then you cannot use a JOIN in Knop.',\n\t\t-optional='sql',\n\t\t-optional='contains',\n\t\t-optional='value',\n\t\t-optional='removedotbackticks';\n\t\tlocal: 'timer'=knop_timer; \n\t\t\n\t\tlocal: 'output'=array,\n\t\t\t'output_temp'=array,\n\t\t\t'_sql'=(local_defined: 'sql'), \n\t\t\t'wordseparators'=',.- (\"@\\n\\r', // \\r and \\n must not come after each other as \\r\\n, but \\n\\r is fine. \n\t\t\t'fieldvalue', 'onevalue', 'field', 'wordseparator';\n\t\tfail_if: #_sql && (self -> 'database') -> 'isfilemaker', 7009, '-sql can not be used with FileMaker';\n\n\t\t#wordseparators = #wordseparators -> (split: '');\n\t\tif: (self -> 'quicksearch_form') -> type != 'form';\n\t\t\tif: #_sql; \n\t\t\t\treturn: string;\n\t\t\telse;\n\t\t\t\treturn: array;\n\t\t\t/if;\n\t\t/if;\n\t\tif: local_defined: 'value';\n\t\t\treturn: string: ((self -> 'quicksearch_form') -> (getvalue: '-q'));\n\t\t/if;\n\t\t\n\t\t#fieldvalue = string: ((self -> 'quicksearch_form') -> (getvalue: '-q'));\n\t\tif: #fieldvalue != '';\n\t\t\tif: (self -> 'database') -> 'isfilemaker';\n\t\t\t\t#output -> (insert: -logicaloperator='or');\n\t\t\t\titerate: (self -> 'quicksearch_fields'), #field;\n\t\t\t\t\tif: (local_defined: 'contains');\n\t\t\t\t\t\t#output -> (insert: -op = 'cn');\n\t\t\t\t\t/if;\n\t\t\t\t\t#output -> (insert: #field = #fieldvalue);\n\t\t\t\t/iterate;\n\t\t\telse;\n\t\t\t\t// search each word separately\n\t\t\t\t#fieldvalue = #fieldvalue -> (split: ' ');\n\t\t\t\titerate: #fieldvalue, #onevalue;\n\t\t\t\t\t#output_temp = array;\n\t\t\t\t\titerate: (self -> 'quicksearch_fields'), #field;\n\t\t\t\t\t\tif: #_sql;\n\t\t\t\t\t\t\tif: (local_defined: 'contains');\n\t\t\t\t\t\t\t\tif(local_defined('removedotbackticks'));\n\t\t\t\t\t\t\t\t\t#output_temp -> insert('`' + knop_stripbackticks(encode_sql(#field)) + '`' \n\t\t\t\t\t\t\t\t\t\t+ ' LIKE \"%' + encode_sql(#onevalue ) + '%\"');\n\t\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\t\t#output_temp -> insert('`' + string_replace(knop_stripbackticks(encode_sql(#field)), -find='.', -replace='`.`') + '`' \n\t\t\t\t\t\t\t\t\t\t+ ' LIKE \"%' + encode_sql(#onevalue ) + '%\"');\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\tif(local_defined('removedotbackticks'));\n\t\t\t\t\t\t\t\t\t#output_temp -> insert('`' + knop_stripbackticks(encode_sql(#field)) + '`' \n\t\t\t\t\t\t\t\t\t+ ' LIKE \"' + encode_sql(#onevalue ) + '%\"');\n\t\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\t\t#output_temp -> insert('`' + string_replace(knop_stripbackticks(encode_sql(#field)), -find='.', -replace='`.`') + '`' \n\t\t\t\t\t\t\t\t\t+ ' LIKE \"' + encode_sql(#onevalue ) + '%\"');\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\t\t// basic emulation of \"word begins with\"\n\t\t\t\t\t\t\t\titerate: #wordseparators, #wordseparator;\n\t\t\t\t\t\t\t\t\tif(local_defined('removedotbackticks'));\n\t\t\t\t\t\t\t\t\t\t#output_temp -> insert('`' + knop_stripbackticks(encode_sql(#field)) + '`' \n\t\t\t\t\t\t\t\t\t\t\t+ ' LIKE \"%' + encode_sql(#wordseparator + #onevalue ) + '%\"');\n\t\t\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\t\t\t#output_temp -> insert('`' + string_replace(knop_stripbackticks(encode_sql(#field)), -find='.', -replace='`.`') + '`' \n\t\t\t\t\t\t\t\t\t\t\t+ ' LIKE \"%' + encode_sql(#wordseparator + #onevalue ) + '%\"');\n\t\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\t\t/iterate;\n\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\telse;\n\t\t\t\t\t\t\tif: (local_defined: 'contains');\n\t\t\t\t\t\t\t\t#output_temp -> (insert: -op='cn');\n\t\t\t\t\t\t\t\t#output_temp -> (insert: #field = #onevalue );\n\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\t#output_temp -> (insert: -op='bw');\n\t\t\t\t\t\t\t\t#output_temp -> (insert: #field = #onevalue );\n\t\t\t\t\t\t\t\tif: !(self -> 'database' -> 'isfilemaker');\n\t\t\t\t\t\t\t\t\t// this variant is not needed for FileMaker since it already searches with \"word begins with\" as default\t\t\t\t\t\t\t#output_temp -> (insert: -op='cn');\n\t\t\t\t\t\t\t\t\titerate: #wordseparators, #wordseparator;\n\t\t\t\t\t\t\t\t\t\t#output_temp -> (insert: -op='cn');\n\t\t\t\t\t\t\t\t\t\t#output_temp -> (insert: #field = #wordseparator + #onevalue );\n\t\t\t\t\t\t\t\t\t/iterate;\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/iterate;\n\t\t\t\t\tif: #_sql;\n\t\t\t\t\t\tif: #output_temp -> size > 1;\n\t\t\t\t\t\t\t#output_temp = '(' + #output_temp -> (join: ' OR ') + ')';\n\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t#output_temp = #output_temp -> first;\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t#output -> (insert: #output_temp);\n\t\t\t\t\telse;\n\t\t\t\t\t\tif: #output_temp -> size > 2;\n\t\t\t\t\t\t\t#output_temp -> (insert: -opbegin='or', 1);\n\t\t\t\t\t\t\t#output_temp -> (insert: -opend='or');\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t#output -> (merge: #output_temp);\n\t\t\t\t\t/if;\n\t\t\t\t/iterate;\n\t\t\t\t\n\t\t\t\tif: #_sql;\n\t\t\t\t\tif: #output -> size;\n\t\t\t\t\t\t#output = '(' + #output -> (join: ' AND ') + ')';\n\t\t\t\t\telse;\n\t\t\t\t\t\t#output = string;\n\t\t\t\t\t/if;\n\t\t\t\telse;\n\t\t\t\t\tif: #output -> size;\n\t\t\t\t\t\t#output -> (insert: -opbegin='and', 1);\n\t\t\t\t\t\t#output -> (insert: -opend='and');\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t/if; // isfilemaker\n\t\t/if; // #fieldvalue != ''\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @#output;\n\t/define_tag;\n\t\n\tdefine_tag: 'urlargs', -description='returns all get params that begin with - as a query string, for internal use in links in the grid. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-except (optional) Exclude these parameters (string or array)\\n\\\n\t\t\t-prefix (optional) For example ? or & to include at the beginning of the querystring \\n\\\n\t\t\t-suffix (optional) For example & to include at the end of the querystring',\n\t\t-optional='except', -copy,\n\t\t-optional='prefix',\t// for example ? or & to include at the beginning of the querystring \n\t\t-optional='suffix';\t// for example & to include at the end of the querystring\n\t\tlocal: 'timer'=knop_timer; \n\t\tlocal: 'output'=array, 'param'=null;\n\n\t\t// only getparams to not send along -action etc\n\t\tlocal: 'clientparams'=client_getparams;\n\n\t\t!(local_defined: 'except') ? local: 'except'=array;\n\t\t#except -> type != 'array' ? #except = array: #except;\n\t\t#except -> (insert: -session);\n\t\t\n\t\t// add getparams that begin with -\n\t\titerate: #clientparams, #param;\n\t\t\tif: #param -> type == 'pair';\n\t\t\t\tif: #param -> name -> (beginswith: '-') && #except !>> #param -> name;\n\t\t\t\t\t#output -> (insert: (encode_stricturl: #param -> name) + '=' + (encode_stricturl: #param -> value));\n\t\t\t\t/if;\n\t\t\telse; // just a string param (no pair)\n\t\t\t\tif: #param -> (beginswith: '-') && #except !>> #param;\n\t\t\t\t\t#output -> (insert: encode_stricturl: #param);\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t/iterate;\n\n\t\tif: self -> 'nav' -> isa('nav');\n\t\t\t// send params that have been defined as -params in nav\n\t\t\tlocal: 'navitem'=self -> 'nav' -> getnav;\n\t\t\t// add post params\n\t\t\t#clientparams -> (merge: client_postparams);\n\n\t\t\titerate: #navitem -> (find: 'params'), #param;\n\t\t\t\tif: #clientparams >> #param && #clientparams -> (find: #param) -> first -> type == 'pair';\n\t\t\t\t\t#output -> (insert: (encode_stricturl: #clientparams -> (find: #param) -> first -> name) + '=' + (encode_stricturl: #clientparams -> (find: #param) -> first -> value));\n\t\t\t\telse: #clientparams >> #param;\n\t\t\t\t\t#output -> (insert: encode_stricturl: #clientparams -> (find: #param) -> first);\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t/if;\n\t\t#output = string: (#output -> (join: '&'));\n\t\t// restore / in paths\n\t\t#output -> replace('%2F', '/');\n\n\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\tif: #output -> size;\n\t\t\treturn: (local: 'prefix') + #output + (local: 'suffix');\n\t\t/if;\n\n\t/define_tag;\n\t\n\t\n\tdefine_tag: 'renderhtml', -description='Outputs the complete record listing. Calls renderheader, renderlisting and renderfooter as well. \\\n\t\t\tIf 10 records or more are shown, renderfooter is added also just below the header.\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-inlinename (optional) If not specified, inlinename from the connected database object is used\\n\\\n\t\t\t-numbered (optional flag or integer) If specified, pagination links will be shown as page numbers instead of regular prev/next links. Defaults to 6 links, specify another number (minimum 6) if more numbers are wanted.',\n\t\t-optional='inlinename',\n\t\t-optional='xhtml',\n\t\t-optional='numbered',\n\t\t-optional='startwithfooter';\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tlocal: 'output'=string,\n\t\t\t'db'=@(self -> 'database'), \n\t\t\t'_xhtml' = (((local_defined: 'xhtml') && #xhtml != false) ? true | false);\n\t\tif(local_defined('numbered'));\n\t\t\tlocal('numberedpaging'=((#numbered !== false) ? integer(#numbered) | false));\n\t\telse;\n\t\t\tlocal('numberedpaging'=(((self -> 'numbered') !== false) ? integer(self -> 'numbered') | false));\n\t\t/if;\n\n\t\tlocal_defined('startwithfooter') && #startwithfooter != false ? #startwithfooter = true | local('startwithfooter') = false;\n\n\t\t!(local_defined: 'inlinename') ? local: 'inlinename'=string;\n\t\tself -> 'footer' = (self -> (renderfooter: -xhtml = #_xhtml, -numbered=#numberedpaging));\n\t\t#output += (self -> renderheader(-start, -xhtml = #_xhtml, -startwithfooter = #startwithfooter));\n\t\tif: #db -> shown_count >= 10 && !#startwithfooter;\n\t\t\t#output += self -> 'footer';\n\t\t/if;\n\t\t#output += (self -> (renderlisting: -inlinename=#inlinename, -xhtml=#_xhtml));\n\n\t\t#output += self -> 'footer' + '\\n';\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @#output;\n\t/define_tag;\n\n\n\tdefine_tag: 'renderlisting', -description='Outputs just the actual record listing. Is called by renderhtml. \\\n\t\t\tParameters:\\n\\\n\t\t\t-inlinename (optional) If not specified, inlinename from the connected database object is used',\n\t\t-optional='inlinename',\n\t\t-optional='xhtml';\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tlocal: '_inlinename'=string, \n\t\t\t'output'=string, \n\t\t\t'fields'=(self -> 'fields'), \n\t\t\t'field'=string,\n\t\t\t'keyfield'=null,\n\t\t\t'affectedrecord_keyvalue'=null,\n\t\t\t'record_loop_count'=integer,\n\t\t\t'db'=@(self -> 'database'), \n\t\t\t'nav'=@(self -> 'nav'),\n\t\t\t'dbfieldmap'=@(self -> 'dbfieldmap'),\n\t\t\t'classarray'=array,\n\t\t\t'fieldname'=string,\n\t\t\t'value'=string,\n\t\t\t'keyparamname',\n\t\t\t'url',\n\t\t\t'url_cached_temp',\n\t\t\t'_xhtml' = (((local_defined: 'xhtml') && #xhtml != false) ? true | false),\n\t\t\t'lang'=@(self -> 'lang');\n\t\t\t\n\t\tif: (local: 'inlinename')!='';\n\t\t\t#_inlinename = #inlinename;\n\t\telse: #db -> type == 'database';\n\t\t\t#_inlinename=#db -> 'inlinename';\n\t\t\t#keyfield=#db -> 'keyfield';\n\t\t\t#affectedrecord_keyvalue = #db -> 'affectedrecord_keyvalue';\n\t\t/if;\n\t\t#output += '\\n\\n';\n\t\tif: #nav -> (isa: 'nav');\n\t\t\titerate: #fields, #field;\n\t\t\t\tif: (#field -> (find: 'url')) != '';\n\t\t\t\t\t#url = (#field -> (find: 'url'));\n\t\t\t\t\t#keyparamname = (#field -> (find: 'keyparamname'));\n\t\t\t\t\t#field -> insert('url_cached' = (#nav -> (url: -path=#url, \n\t\t\t\t\t\t#keyparamname='###keyvalue###',\n\t\t\t\t\t\t-autoparams,\n\t\t\t\t\t\t-except=(array: -path))));\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t/if;\n\t\trecords: -inlinename=#_inlinename;\n\t\t\t#record_loop_count = loop_count;\n\t\t\t#output += '\\n';\n\t\t\titerate: #fields, #field;\n\t\t\t\t#fieldname = (#dbfieldmap -> (find: (#field -> (find: 'name'))));\n\t\t\t\t#keyparamname = (#field -> (find: 'keyparamname'));\n\t\t\t\t#value=(field: #fieldname);\n\t\t\t\tif: #field -> (find: 'template') -> type == 'map';\n\t\t\t\t\t#value=string(#value);\n\t\t\t\t\tif: #field -> (find: 'template') >> #value;\n\t\t\t\t\t\t#value = #field -> (find: 'template') -> (find: #value);\n\t\t\t\t\telse: #field -> (find: 'template') >> '-default';\n\t\t\t\t\t\t#value = #field -> (find: 'template') -> (find: '-default');\n\t\t\t\t\telse;\n\t\t\t\t\t\t// show fieldvalue as is\n\t\t\t\t\t/if;\n\t\t\t\t\t// substitute field value in the display template\n\t\t\t\t\t#value -> (replace: '#value#', (field: #fieldname));\n\t\t\t\telse: #field -> (find: 'template') -> (isa: 'tag');\n\t\t\t\t\t#value = #field -> (find: 'template') -> (run: -params=#value);\n\t\t\t\t/if;\n\t\t\t\t#classarray=array;\n\t\t\t\tif: #affectedrecord_keyvalue == (field: #keyfield) && (field: #keyfield) != '';\n\t\t\t\t\t// hightlight affected row\n\t\t\t\t\t#classarray -> (insert: 'highlight');\n\t\t\t\telse;\n\t\t\t\t\t(#record_loop_count - 1) % 2 == 0 ? #classarray -> (insert: 'even');\n\t\t\t\t/if;\n\t\t\t\t// Added by JC 081127 to handle td specific classes\n\t\t\t\t(#field -> find('class') -> size ? #classarray -> insert( #field -> find('class')));\n\t\t\t\t#output += ' size;\n\t\t\t\t\t#output += ' class=\"' + #classarray -> (join: ' ') + '\"';\n\t\t\t\t/if;\n\t\t\t\t#output += '>';\n\t\t\t\tif: (#field -> (find: 'url')) != '';\n\t\t\t\t\t#url = (#field -> (find: 'url'));\n\t\t\t\t\t/*\n\t\t\t\t\tif: #nav -> (isa: 'nav') && #url !>> '#value#';\n\t\t\t\t\t\t#output += ' (url: -path=#url, \n\t\t\t\t\t\t\t#keyparamname=(field: #keyfield),\n\t\t\t\t\t\t\t-autoparams,\n\t\t\t\t\t\t\t-except=(array: -path)));\n\t\t\t\t\t*/\n\t\t\t\t\tif: #field -> find('url_cached') -> size && #url !>> '#value#';\n\t\t\t\t\t\t#url_cached_temp = #field -> find('url_cached');\n\t\t\t\t\t\t#url_cached_temp -> replace('###keyvalue###', field(#keyfield));\n\t\t\t\t\t\t#output += ' size == 0 ? (#lang -> linktext_edit)) \n\t\t\t\t\t\t\t+ '';\n\t\t\t\t\telse;\n\t\t\t\t\t\t#url -> (replace: '#value#', (field: #fieldname));\n\t\t\t\t\t\t#output += ' (beginswith: 'http://') || #url -> (beginswith: 'https://') || #url -> (beginswith: 'mailto:')\n\t\t\t\t\t\t\t? #output += ' class=\"ext\"';\n\t\t\t\t\t\t#output += '>' + #value + '';\n\t\t\t\t\t/if;\n\t\t\t\telse;\n\t\t\t\t\t#output += #value;\n\t\t\t\t/if;\n\t\t\t\t#output += '\\n';\n\t\t\t/iterate;\n\t\t\t#output += '\\n';\n\t\t/records;\n\t\t#output += '\\n\\n';\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @#output;\n\t/define_tag;\n\t\n\t\n\tdefine_tag: 'renderheader', -description='Outputs the header of the grid with the column headings. \\\n\t\t\tAutomatically included by ->renderhtml. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-start (optional flag) Also output opening tag',\n\t\t-optional='start',\n\t\t-optional='xhtml',\n\t\t-optional = 'startwithfooter';\n\t\tlocal: 'timer'=knop_timer; \n\t\tlocal: 'output'=string, \n\t\t\t'db'=@(self -> 'database'), \n\t\t\t'nav'=@(self -> 'nav'),\n\t\t\t'fields'=@(self -> 'fields'), \n\t\t\t'field'=string,\n\t\t\t'classarray'=array,\n\t\t\t'_xhtml' = ((local_defined: 'xhtml') && #xhtml != false) ? true | false,\n\t\t\t'lang'=@(self -> 'lang');\n\t\tlocal_defined('startwithfooter') && #startwithfooter != false ? #startwithfooter = true | local('startwithfooter') = false;\n\n\n\t\t(local_defined: 'start') ? #output += '
'tbl_id') + '\" class=\"grid' + (self -> 'class' -> size > 0 ? ' ' + self -> 'class') + '\">';\n\t\t#output += '\\n';\n\t\tif: (self -> 'quicksearch_form') -> type == 'form';\n\t\t\t#output += '\\n';\n\t\telse((self -> 'rawheader') -> size > 0);\n\t\t\t#output += '\\n';\n\t\t/if;\n\n\t\tif(#startwithfooter);\n\t\t\t#output += self -> 'footer';\n\t\t/if;\n\n\t\t#output += '';\n\n\t\titerate: #fields, #field;\n\t\t\t#classarray=array;\n\t\t\t//(self -> 'quicksearch_form') -> type == 'form' ? #classarray -> (insert: 'notopborder');\n\t\t\tif: !(self -> 'nosort');\n\t\t\t\t(self -> 'sortfield') == (#field -> (find: 'name')) \n\t\t\t\t\t&& !(#field -> (find: 'nosort')) ? #classarray -> (insert: 'sort');\n\t\t\t/if;\n\t\t\t#output += ' (find: 'width') > 0;\n\t\t\t\t#output += ' style=\"width: ' + (integer: #field -> (find: 'width')) + 'px;\"';\n\t\t\t/if;\n\t\t\t// Added by Jolle 081127 to handle td specific classes\n\t\t\t(#field -> find('class') -> size ? #classarray -> insert( #field -> find('class')));\n\t\t\tif: #classarray -> size;\n\t\t\t\t#output += ' class=\"' + #classarray -> (join: ' ') + '\"';\n\t\t\t/if;\n\t\t\t#output += '>';\n\t\t\tif: (#field -> (find: 'nosort')) || (self -> 'nosort');\n\t\t\t\t#output += '
' + (#field -> (find: 'label')) '
';\n\t\t\telse;\n\t\t\t\tif: (#classarray >> 'sort' && (self -> 'sortdescending') && (self -> 'defaultsort') == '');\n\t\t\t\t\t// create link to change to unsorted\n\t\t\t\t\tif: #nav -> isa('nav');\n\t\t\t\t\t\t#output += ' url(-autoparams, -getargs, -except=(array: -sort, -desc, -page, -path)) + '\"'\n\t\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_showunsorted) + '\">';\n\t\t\t\t\telse;\n\t\t\t\t\t\t#output += ' (urlargs: -except=(array: -sort, -desc, -page), -prefix='?')) + '\"'\n\t\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_showunsorted) + '\">';\n\t\t\t\t\t/if;\n\t\t\t\telse;\n\t\t\t\t\t// create link to toggle sort mode\n\t\t\t\t\tif: #nav -> isa('nav');\n\t\t\t\t\t\t#output += ' url(-autoparams, -getargs, -except=(array: -sort, -desc, -page, -path), \n\t\t\t\t\t\t\t-urlargs='-sort=' + (#field -> (find: 'name'))\n\t\t\t\t\t\t\t\t+ (#classarray >> 'sort' && !(self -> 'sortdescending') ? '&-desc')) + '\"'\n\t\t\t\t\t\t\t+ ' title=\"' + (#classarray >> 'sort' \n\t\t\t\t\t\t\t\t? (#lang -> linktitle_changesort) + ' ' \n\t\t\t\t\t\t\t\t\t+ ((self -> 'sortdescending') ? (#lang -> linktitle_ascending) | (#lang -> linktitle_descending))\n\t\t\t\t\t\t\t\t| (#lang -> linktitle_sortascby) + ' ' + (encode_html: (#field -> (find: 'label'))) ) + '\">';\n\t\t\t\t\telse;\n\t\t\t\t\t\t#output += ' (find: 'name')) \n\t\t\t\t\t\t\t+ (#classarray >> 'sort' && !(self -> 'sortdescending') ? '&-desc') \n\t\t\t\t\t\t\t+ (self -> (urlargs: -except=(array: -sort, -desc, -page), -prefix='&')) + '\"'\n\t\t\t\t\t\t\t+ ' title=\"' + (#classarray >> 'sort' \n\t\t\t\t\t\t\t\t? (#lang -> linktitle_changesort) + ' ' \n\t\t\t\t\t\t\t\t\t+ ((self -> 'sortdescending') ? (#lang -> linktitle_ascending) | (#lang -> linktitle_descending))\n\t\t\t\t\t\t\t\t| (#lang -> linktitle_sortascby) + ' ' + (encode_html: (#field -> (find: 'label'))) ) + '\">';\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t\t#output += (#field -> (find: 'label'));\n\t\t\t\tif: (string_findregexp: (#field -> (find: 'label')), -find='\\\\S') -> size == 0;\n\t\t\t\t\t#output += ' '; // to show sort link as block element properly even for empty label\n\t\t\t\t/if;\n\t\t\t\tif: #classarray >> 'sort';\n\t\t\t\t\t#output += ' ' + ((self -> 'sortdescending') ? '▼' | '▲') + '';\n\t\t\t\t/if;\n\t\t\t\t#output += '';\n\t\t\t /if;\n\t\t\t #output += '\\n';\n\t\t/iterate;\n\t\t#output += '\\n\\n';\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @#output;\n\t/define_tag;\n\n\tdefine_tag: 'renderfooter', -description='Outputs the footer of the grid with the prev/next links and information about found count. \\\n\t\t\tAutomatically included by ->renderhtml\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-end (optional flag) Also output closing
size) + '\" class=\"quicksearch';\n\t\t\t\t((self -> 'quicksearch_form') -> (getvalue: '-q') != '') ? #output += ' highlight';\n\t\t\t#output += '\">';\n\n\t\t\tif: (self -> 'rawheader') -> size > 0 ;\n\t\t\t\t#output += (self -> 'rawheader');\n\t\t\t/if;\n\n\n\t\t\t#output += (self -> 'quicksearch_form') -> (renderform: -xhtml = #_xhtml);\n\t\t\tif: (self -> 'quicksearch_form_reset') -> type =='form';\n\t\t\t\t#output += (self -> 'quicksearch_form_reset') -> (renderform: -xhtml = #_xhtml);\n\t\t\t/if;\n\t\t\t#output += '
size) + '\">';\n\t\t\t#output += (self -> 'rawheader');\n\t\t\t#output += '
tag\\n\\\n\t\t\t-numbered (optional flag or integer) If specified, pagination links will be shown as page numbers instead of regular prev/next links. Defaults to 6 links, specify another number (minimum 6) if more numbers are wanted.',\n\t\t-optional='end',\n\t\t-optional='numbered',\n\t\t-optional='xhtml';\n\t\tlocal: 'timer'=knop_timer; \n\t\tlocal: 'output'=string, \n\t\t\t'db'=@(self -> 'database'), \n\t\t\t'nav'=@(self -> 'nav'),\n\t\t\t'fields'=@(self -> 'fields'), \n\t\t\t'field'=string,\n\t\t\t//'numberedpaging'=(((local_defined: 'numbered') && #numbered !== false) ? integer(#numbered) | false),\n\t\t\t'_xhtml' = ((local_defined: 'xhtml') && #xhtml != false) ? true | false,\n\t\t\t'lang'=@(self -> 'lang'),\n\t\t\t'page'=(self -> page),\n\t\t\t'lastpage'=(self -> lastpage),\n\t\t\t'url_cached',\n\t\t\t'url_cached_temp';\n\t\tif(local_defined('numbered'));\n\t\t\tlocal('numberedpaging'=((#numbered !== false) ? integer(#numbered) | false));\n\t\telse;\n\t\t\tlocal('numberedpaging'=(((self -> 'numbered') !== false) ? integer(self -> 'numbered') | false));\n\t\t/if;\n\t\t\t\n\t\tif(#nav -> isa('nav'));\n\t\t\t#url_cached=#nav -> url(-autoparams, -getargs, -except=(array: -page, -path), \n\t\t\t\t\t-urlargs='-page=###page###');\n\t\t/if;\n\t\tif: #numberedpaging !== false && #numberedpaging < 6;\n\t\t\t// show 10 page numbers as default\n\t\t\t#numberedpaging = 6;\n\t\t/if;\n\t\tif: #numberedpaging;\n\t\t\t// make sure we have an even number\n\t\t\t#numberedpaging += #numberedpaging % 2;\n\t\t/if;\n\t\t\n\t\t#output += '\\n size) + '\" class=\"footer first' + '\">';\n\t\t/* not used\n\t\tif: #nav -> isa('nav');\n\t\t\tlocal: 'url'=#nav -> url(-autoparams, -getargs, -except=(array: -page, -path), -urlargs='-page='),\n\t\t\t\t'url_prefix'=(#nav -> 'navmethod' == 'param' ? '&' | '?');\n\t\telse;\n\t\t\tlocal: 'url'='./' + (self -> (urlargs: -except=(array: -page, -path), -suffix='&')),\n\t\t\t\t'url_prefix'='?';\n\t\t/if;\n\t\t*/\n\t\t// JC 2010-05-14 added span separation for better styling\n\t\tif: #numberedpaging;\n\t\t\tlocal: 'page_from'=1,\n\t\t\t\t'page_to'=#lastpage;\n\t\t\tif: #lastpage > #numberedpaging;\n\t\t\t\t#page_from=#page - (#numberedpaging/2 - 1);\n\t\t\t\t#page_to=#page + (#numberedpaging/2);\n\t\t\t\tif: #page_from < 1;\n\t\t\t\t\t#page_to += (1 - #page_from);\n\t\t\t\t\t#page_from = 1;\n\t\t\t\t/if;\n\t\t\t\tif: #page_to > #lastpage;\n\t\t\t\t\t#page_from = #lastpage - (#numberedpaging - 1);\n\t\t\t\t\t#page_to = #lastpage;\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t\t#output += '' + #db -> found_count + ' ' + (#lang -> footer_found) + ' — ' + (#lang -> linktext_gotopage) + ': '; // SP customization\n\t\t\tif: #page > 1;\n\t\t\t\tif: #url_cached -> size;\n\t\t\t\t\t#url_cached_temp=#url_cached;\n\t\t\t\t\t// 2010-12-23\tSP\tCorrected pagination bug for -numbered.\n\t\t\t\t\t#url_cached_temp -> replace('-page=###page###', '-page=' + 1);\n\t\t\t\t\t/*#output += ' url(-autoparams, -getargs, -except=(array: -page, -path), \n\t\t\t\t\t\t-urlargs='-page=' + (#page - 1)) + '\" class=\"prevnext prev\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_goprev) + '\">' + (#lang -> linktext_prev) + ' ';*/\n\t\t\t\t\t#output += ' linktitle_gofirst) + '\">' + (#lang -> linktext_first) + ' ';\n\n\t\t\t\t\t#url_cached_temp=#url_cached;\n\t\t\t\t\t#url_cached_temp -> replace('-page=###page###', '-page=' + (#page - 1));\n\t\t\t\t\t#output += ' linktitle_goprev) + '\">' + (#lang -> linktext_prev) + ' ';\n\t\t\t\telse;\n\t\t\t\t\t#output += ' (urlargs: -except=(array: -page, -path), -suffix='&')) \n\t\t\t\t\t\t+ '-page=1\" class=\"prevnext first\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_gofirst) + '\">' + (#lang -> linktext_first) + ' ';\n\t\t\t\t\t#output += ' (urlargs: -except=(array: -page, -path), -suffix='&')) \n\t\t\t\t\t\t+ '-page=' + (#page - 1) + '\" class=\"prevnext prev\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_goprev) + '\">' + (#lang -> linktext_prev) + ' ';\n\t\t\t\t/if;\n\t\t\telse;\n\t\t\t\t//#output += ' ' + (#lang -> linktext_prev) + ' ';\n\t\t\t/if;\n\t\t\tif: #page_from > 1;\n\t\t\t\tif: #url_cached -> size;\n\t\t\t\t\t#url_cached_temp=#url_cached;\n\t\t\t\t\t#url_cached_temp -> replace('-page=###page###', '-page=' + 1);\n\t\t\t\t\t/*#output += ' url(-autoparams, -getargs, -except=(array: -page, -path),\n\t\t\t\t\t\t-urlargs='-page=1') + '\" class=\"prevnext numbered first\">1';*/\n\t\t\t\t\t#output += ' 1';\n\t\t\t\telse;\n\t\t\t\t\t#output += ' (urlargs: -except=(array: -page, -path), -suffix='&')) \n\t\t\t\t\t\t+ '-page=1\" class=\"prevnext numbered first\">1 ';\n\t\t\t\t/if;\n\t\t\t\tif: #page_from > 2;\n\t\t\t\t\t#output +='...';\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t\tloop: -from=#page_from, -to=#page_to;\n\t\t\t\tif: loop_count == #page;\n\t\t\t\t\t#output += ' ' + loop_count + ' ';\n\t\t\t\telse;\n\t\t\t\t\tif: #url_cached -> size;\n\t\t\t\t\t\t#url_cached_temp=#url_cached;\n\t\t\t\t\t\t#url_cached_temp -> replace('-page=###page###', '-page=' + loop_count);\n\t\t\t\t\t\t/*#output += ' url(-autoparams, -getargs, -except=(array: -page, -path),\n\t\t\t\t\t\t\t-urlargs='-page=' + loop_count) + '\" class=\"prevnext numbered\">' + loop_count + ' ';*/\n\t\t\t\t\t\t#output += ' ' + loop_count + ' ';\n\t\t\t\t\telse;\n\t\t\t\t\t\t#output += ' (urlargs: -except=(array: -page, -path), -suffix='&')) \n\t\t\t\t\t\t\t+ '-page=' + loop_count + '\" class=\"prevnext numbered\">' + loop_count + ' ';\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t/loop;\n\t\t\tif: #page_to < #lastpage;\n\t\t\t\tif: #page_to < (#lastpage - 1);\n\t\t\t\t\t#output += '...';\n\t\t\t\t/if;\n\t\t\t\tif: #url_cached -> size;\n\t\t\t\t\t#url_cached_temp=#url_cached;\n\t\t\t\t\t#url_cached_temp -> replace('-page=###page###', '-page=' + #lastpage);\n\t\t\t\t\t/*#output += ' url(-autoparams, -getargs, -except=(array: -page, -path),\n\t\t\t\t\t\t-urlargs='-page=' + #lastpage) + '\" class=\"prevnext numbered last\">' + #lastpage + ' ';*/\n\t\t\t\t\t#output += ' ' + #lastpage + ' ';\n\t\t\t\telse;\n\t\t\t\t\t#output += ' (urlargs: -except=(array: -page, -path), -suffix='&')) \n\t\t\t\t\t\t+ '-page=' + #lastpage + '\" class=\"prevnext numbered last\">' + #lastpage + ' ';\n\t\t\t\t/if;\n\t\t\t/if;\n\t\n\t\t\tif: #page < #lastpage;\n\t\t\t\tif: #url_cached -> size;\n\t\t\t\t\t#url_cached_temp=#url_cached;\n\t\t\t\t\t#url_cached_temp -> replace('-page=###page###', '-page=' + (#page + 1));\n\t\t\t\t\t/*#output += ' url(-autoparams, -getargs, -except=(array: -page, -path), \n\t\t\t\t\t\t-urlargs='-page=' + (#page + 1)) + '\" class=\"prevnext next\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_gonext) + '\">' + (#lang -> linktext_next) + ' ';*/\n\t\t\t\t\t#output += ' linktitle_gonext) + '\">' + (#lang -> linktext_next) + ' ';\n\n\t\t\t\t\t#url_cached_temp=#url_cached;\n\t\t\t\t\t#url_cached_temp -> replace('-page=###page###', '-page=' + #lastpage);\n\t\t\t\t\t#output += ' linktitle_golast) + '\">' + (#lang -> linktext_last) + ' ';\n\t\t\t\telse;\n\t\t\t\t\t#output += ' (urlargs: -except=(array: -page, -path), -suffix='&')) \n\t\t\t\t\t\t+ '-page=' + (#page + 1) + '\" class=\"prevnext next\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_gonext) + '\">' + (#lang -> linktext_next) + ' ';\n\t\t\t\t\t#output += ' (urlargs: -except=(array: -page, -path), -suffix='&')) \n\t\t\t\t\t\t+ '-page=' + #lastpage + '\" class=\"prevnext last\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_golast) + '\">' + (#lang -> linktext_last) + ' ';\n\t\t\t\t/if;\n\t\t\telse;\n\t\t\t\t//#output += ' ' + (#lang -> linktext_next) + ' ';\n\t\t\t/if;\n\t\t\n\t\t\t#output += ' ';\n\t\t\n\t\t\n\t\telse; // regular prev/next links\n\t\t\n\t\t\n\t\t\tif: #page > 1;\n\t\t\t\tif: #url_cached -> size;\n\t\t\t\t\t#url_cached_temp=#url_cached;\n\t\t\t\t\t#url_cached_temp -> replace('-page=###page###', '-page=' + 1);\n\t\t\t\t\t/*#output += ' url(-autoparams, -getargs, -except=(array: -page, -path),\n\t\t\t\t\t\t-urlargs='-page=1') + '\" class=\"prevnext first\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_gofirst) + '\">' + (#lang -> linktext_first) + ' ';*/\n\t\t\t\t\t#output += ' linktitle_gofirst) + '\">' + (#lang -> linktext_first) + ' ';\n\t\t\n\t\t\t\t\t#url_cached_temp=#url_cached;\n\t\t\t\t\t#url_cached_temp -> replace('-page=###page###', '-page=' + (#page - 1));\n\t\t\t\t\t#output += ' linktitle_goprev) + '\">' + (#lang -> linktext_prev) + ' ';\n\t\t\t\telse;\n\t\t\t\t\t#output += ' (urlargs: -except=(array: -page, -path), -suffix='&')) \n\t\t\t\t\t\t+ '-page=1\" class=\"prevnext first\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_gofirst) + '\">' + (#lang -> linktext_first) + ' ';\n\t\t\n\t\t\t\t\t#output += ' (urlargs: -except=(array: -page, -path), -suffix='&')) \n\t\t\t\t\t\t+ '-page=' + (#page - 1) + '\" class=\"prevnext prev\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_goprev) + '\">' + (#lang -> linktext_prev) + ' ';\n\t\t\t\t/if;\n\t\t\telse;\n\t\t\t\t#output += ' ' + (#lang -> linktext_first) + ' \\\n\t\t\t\t\t\t\t' + (#lang -> linktext_prev) + ' ';\n\t\t\t/if;\n\t\t\tif: #db -> found_count > #db -> shown_count;\n\t\t\t\t#output += (#lang -> (footer_shown: -replace=(array: (#db -> shown_first), (#db -> shown_last)))) + ' ';\n\t\t\t/if;\n\t\t\t#output += #db -> found_count + ' ' + (#lang -> footer_found);\n\t\t\tif: (#db -> shown_last) < (#db -> found_count);\n\t\t\t\tif: #url_cached -> size;\n\t\t\t\t\t#url_cached_temp=#url_cached;\n\t\t\t\t\t#url_cached_temp -> replace('-page=###page###', '-page=' + (#page + 1));\n\t\t\t\t\t/*#output += ' url(-autoparams, -getargs, -except=(array: -page, -path), \n\t\t\t\t\t\t-urlargs='-page=' + (#page + 1)) + '\" class=\"prevnext next\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_gonext) + '\">' + (#lang -> linktext_next) + ' ';*/\n\t\t\t\t\t#output += ' linktitle_gonext) + '\">' + (#lang -> linktext_next) + ' ';\n\n\t\t\t\t\t#url_cached_temp=#url_cached;\n\t\t\t\t\t#url_cached_temp -> replace('-page=###page###', '-page=' + #lastpage);\n\t\t\t\t\t#output += ' linktitle_golast) + '\">' + (#lang -> linktext_last) + ' ';\n\t\t\t\telse;\n\t\t\t\t\t#output += ' (urlargs: -except=(array: -page, -path), -suffix='&')) \n\t\t\t\t\t\t+ '-page=' + (#page + 1) + '\" class=\"prevnext next\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_gonext) + '\">' + (#lang -> linktext_next) + ' ';\n\t\t\t\t\t#output += ' (urlargs: -except=(array: -page, -path), -suffix='&')) \n\t\t\t\t\t\t+ '-page=' + ((self -> lastpage)) + '\" class=\"prevnext last\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_golast) + '\">' + (#lang -> linktext_last) + ' ';\n\t\t\t\t/if;\n\t\t\telse;\n\t\t\t\t#output += ' ' + (#lang -> linktext_next) + ' \\\n\t\t\t\t\t\t\t' + (#lang -> linktext_last) + ' ';\n\t\t\t/if;\n\t\t/if;\n\t\t#output += '\\n';\n\t\t(local_defined: 'end') ? #output += '\\n';\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @#output;\n\t/define_tag;\n\t\n\tdefine_tag: 'page', -description='Returns the current page number';\n\t\treturn: (self -> 'page');\n\t/define_tag;\n\t\n\tdefine_tag: 'lastpage', -description='Returns the number of the last page for the found records';\n\t\tif: (self -> 'database') -> 'found_count' > 0;\n\t\t\treturn: (((self -> 'database') -> 'found_count' - 1) / (self -> 'database') -> 'maxrecords_value') + 1;\n\t\telse;\n\t\t\treturn: 1;\n\t\t/if;\n\t/define_tag;\n\t\n\tdefine_tag: 'page_skiprecords', -description='Converts curent page value to a skiprecords value to use in a search. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-maxrecords (required integer) Needed to be able to do the calculation. Maxrecords_value can not be taken from the database object since taht value is not available until aftetr performing the search',\n\t\t-required='maxrecords', -type='integer'; // TODO: maxrecords_value can be taken from the database object so should not be required\n\t\treturn: ((self -> 'page') - 1) * #maxrecords;\n\t/define_tag;\n\t\n\n/define_type;\n\n?>[\n//------------------------------------------------------------------\n// End knop_grid\n//------------------------------------------------------------------\n\n//##################################################################\n\n][\n//------------------------------------------------------------------\n// Begin knop_lang\n//------------------------------------------------------------------\n\n]getstring: make sure we only try to do replacement in strings or bytes\n2010-05-27\tJS\tgetstring now works also with empty -replace value\n2010-04-20\tJS\tgetstring debug output corrected for missing string. \n2009-09-16\tJS\tSyntax adjustments for Lasso 9\n2009-06-26\tJS\t->addstring: clarified deprecation warning\n2009-04-08\tJS\tAdded -debug flag to oncreate (when creating a lang object) to make undefined language keys appear as *key*.\n2009-03-24\tJS\t->getstring prevents replacements if there is no language string found, to prevent null->replace error\n2008-11-12\tJS\tAdded ->insert instead of ->addstring for better consistency with other Lasso data types. ->addstring will remain functional for backwards compatibility. \n2008-09-11\tJS\t->_unknowntag: added missing support for -language\n2008-01-22\tJS\t->getstring: corrected the fallback behavior when a current language has been set \n2008-01-07\tJS\tRemoved instance variable browserlanguage due to problems with transient storage. The browserlanguage is cached on page level so it's no loss in reality. \n2007-12-12\tJS\tAdded page level storage of currentlanguage, so all knop_lang instances defaults to the same language once one of them have set a language explictly, but only if the other knop_lang instances don't have a language set explicitly. \n2007-12-12\tJS\tAdded page level caching of browser language (stores the value in $_knop_data map)\n2007-12-06\tJS\tMoved -> help to knop_base\n2007-12-06\tJS\tAdded ->description to all member tags. \n2007-12-03\tJS\tFinished first complete version\n2007-06-18\tJS\tAdded tag timer to most member tags\n2007-06-13\tJS\tadded inheritance from knop_base\n2007-06-13\tJS\tRenamed to knop_lang (formerly knop_strings)\n2007-04-04\tJS\tCreated the data type and started coding\n\nTODO:\nProvide methods to handle formatting of dates, numbers, currency etc for different languages/locales. \nWeekday names, month names etc. \nMember tag to return the current language\nMember tag to set default output encoding unless it follows encode_set. \n\nExamples\n\tvar: 'lang_messages'=(knop_lang: -default='en');\n\t$lang_messages -> (insert: -key='welcome', -value='Welcome to the home page', -language='en');\n\t$lang_messages -> (insert: -key='welcome', -value='Välkommen till hemsidan', -language='sv');\n\t$lang_messages -> (insert: -key='loggedin', -value='You are logged in as #1# #2#', -language='en');\n\t$lang_messages -> (insert: -key='loggedin', -value='Du är inloggad som #1# #2#', -language='sv');\n\n\t// proper call, defaults to the browser's preferred language\n\t$lang_messages -> (getstring: 'welcome');\n\t// shorthand call\n\t$lang_messages -> welcome;\n\n\t// change language\n\t$lang_messages -> (setlanguage: 'sv');\n\t$lang_messages -> welcome;\n\n\t// proper call with replacements\n\t$lang_messages -> (getstring: -key='loggedin': -replace=(array: (field: 'firstname'), (field: 'lastname')));\n\n\t// shorthand call with replacements\n\t$lang_messages -> (loggedin: -replace=(array: (field: 'firstname'), (field: 'lastname')));\n\n\n*/\n\n\t// instance variables\n\tlocal: 'strings'=map,\t\t// map: language=(map: key=value, key=value), language=...\n\t\t'defaultlanguage'=string,\n\t\t'fallback'=false,\n\t\t'currentlanguage'=null,\t// the currently set language\n\t\t'keys'=null,\t\t\t// cached keys array\n\t\t'debug'=false;\n\n\tdefine_tag: 'oncreate', -description='Creates a new instance of knop_lang. \\n\\\n\t\t\tParameters: \\n\\\n\t\t\t-default (optional) Default language. \\n\\\n\t\t\t-fallback (optional) If specified, falls back to default language if key is missing. \\n\\\n\t\t\t-debug (optional flag) If specified, missing strings will be output using the key surrpunded by asterisks',\n\t\t-optional='default',\t\n\t\t-optional='fallback',\n\t\t-optional='debug';\n\t\tlocal: 'timer'=knop_timer; \n\t\t\n\t\tif(local_defined('default') && #default -> size);\n\t\t\t(self -> 'defaultlanguage') = #default;\n\t\t/if;\n\t\t(self -> 'fallback') = ((local_defined: 'fallback') && #fallback != false);\n\t\t(self -> 'debug') = ((local_defined: 'debug') && #debug != false);\n\t\t\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\tdefine_tag: 'onconvert', -description='Returns raw dump of the instance for debugging';\n\t\treturn: (self -> dump);\n\t/define_tag;\n\n\tdefine_tag: '_unknowntag', -description='Returns the language string for the specified text key \\\n\t\t\t= shortcut for getstring. \\n\\Parameters: \\n\\\n\t\t\t-language (optional) see getstring: -language.\\n\\ \n\t\t\t-replace (optional) see getstring: -replace. ',\n\t\t-optional='language',\n\t\t-optional='replace';\n\t\t!(local_defined: 'replace') ? local: 'replace'=string;\n\t\t!(local_defined: 'language') ? local: 'language'=string;\n\t\tif: self -> keys >> tag_name;\n\t\t\treturn: @(self -> (getstring: -key=Tag_name, -language=#language, -replace=#replace));\n\t\telse;\n\t\t\t(self -> 'debug_trace') -> insert('Error: ' + tag_name + ' not found');\n\t\t\t(self -> 'debug') ? return('*' + tag_name + '*');\n\t\t/if;\n\t/define_tag;\n\t\n\n\tdefine_tag: 'addlanguage', -description='Adds a map with language strings for an entire language. Replaces all existing language strings for that language. \\n\\\n\t\t\tParameters: \\n\\\n\t\t\t-language (required) The language to add. \\n\\\n\t\t\t-strings (required) Complete map of key=value for the entire language.',\n\t\t-required='language',\n\t\t-required='strings', -type='map';\n\t\tlocal: 'timer'=knop_timer; \n\t\t(self -> 'keys') = null;\n\t\t(self -> 'strings') -> (insert: #language = #strings);\n\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\n\tdefine_tag('addstring', -description='Deprecated synonym for ->insert',\n\t\t-required='language',\n\t\t-required='key',\n\t\t-required='value');\n\t\t(self -> 'debug_trace') -> insert('*** DEPRECATION WARNING *** ' + tag_name + ' is deprecated, use ->insert instead');\n\t\tself -> insert(-language=#language, -key=#key, -value=#value);\n\t/define_tag;\n\t\n\tdefine_tag: 'insert',-description='Adds an individual language string. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-language (required) The language for the string. \\n\\\n\t\t\t-key (required) Textkey to store the string under. Replaces any existing key for the same language. \\n\\\n\t\t\t-value (required) The actual string (can also be compound expression). Can contain replacement tokens #1#, #2# etc. ',\n\t\t-required='language',\n\t\t-required='key',\n\t\t-required='value';\n\t\tlocal: 'timer'=knop_timer; \n\t\t(self -> 'keys') = null;\n\t\tif: (self -> 'strings') !>> #language;\n\t\t\t(self -> 'strings') -> (insert: #language = map);\n\t\t/if;\n\t\t((self -> 'strings') -> (find: #language)) -> (insert: #key = #value);\n\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'getstring',\t-description='Returns a specific text string in the language that has previously been set for the instance.\\\n\t\t\t\tIf no language has been set, the browser\\'s preferred language will be used unless another instance on the same page \\\n\t\t\t\thas a language set using ->setlanguage. \\n\\\n\t\t\t\tIf the string is not available in the chosen language and -fallback was specified, \\\n\t\t\t\tthe string for the language that was first specified for that key will be returned. \\n\\\n\t\t\t\tParameters: \\n\\\n\t\t\t\t-key (required) textkey to return the string for. \\n\\\n\t\t\t\t-language (optional) to return a string for a specified language (temporary override). \\n\\\n\t\t\t\t-replace (optional) single value or array of values that will be used as substitutions for placeholders #1#, #2# etc in the returned string, in the order they appear. Replacements can be compund expressions, which will be executed. Can also be map or pair array, and in that case the left hand element of the map/array will be replaced by the right hand element. ',\n\t\t-required='key',\n\t\t-optional='language', -copy,\n\t\t-optional='replace', -copy;\n\t\t\t\t\t\t\t\t\t\t\n\t\tif: (var: '_knop_data') -> type != 'map';\n\t\t\t// page level caching\n\t\t\t$_knop_data = map;\n\t\t/if;\n\n\t\t!(local_defined: 'language') ? local: 'language'=string;\n\n\t\tlocal: 'timer'=knop_timer; \n\t\tlocal: 'output'=string;\n\t\tif: #language -> size == 0 || !(self -> (validlanguage: #language));\n\t\t\t#language=(self -> 'currentlanguage');\n\t\t\tif: #language -> size == 0;\n\t\t\t\tif: $_knop_data >> 'currentlanguage' && self -> (validlanguage: ($_knop_data -> (find: 'currentlanguage')));\n\t\t\t\t\t// fall back to page level language\n\t\t\t\t\t#language = $_knop_data -> find('currentlanguage');\n\t\t\t\telse;\n\t\t\t\t\t// fall back to the browser's preferred language\n\t\t\t\t\t#language=(self -> browserlanguage);\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t\tif: #language -> size == 0 && self -> (validlanguage: (self -> 'defaultlanguage'));\n\t\t\t\t// still no matching language, fall back to defaultlanguage\n\t\t\t\t#language = (self -> 'defaultlanguage');\n\t\t\telse: #language -> size == 0;\n\t\t\t\t// still no matching language, fall back to the first language\n\t\t\t\t#language = (self -> 'strings') -> keys -> first;\n\t\t\t/if;\n\t\t\tif: (self -> 'strings') !>> #language\n\t\t\t\t|| ((self -> 'strings') >> #language\n\t\t\t\t\t&& (self -> 'strings') -> (find: #language) !>> #key\n\t\t\t\t\t&& (self -> 'fallback'));\n\t\t\t\t// key is not found in current language, switch to default language\n\t\t\t\tif: self -> (validlanguage: (self -> 'defaultlanguage'));\n\t\t\t\t\t// still no matching language, fall back to defaultlanguage\n\t\t\t\t\t#language = (self -> 'defaultlanguage');\n\t\t\t\telse;\n\t\t\t\t\t// no default language to fall back to\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t/if;\n\t\tif: (self -> 'strings') >> #language;\n\t\t\tif((self -> 'strings') -> find(#language) !>> #key);\n\t\t\t\t(self -> 'debug_trace') -> insert('Error: ' + #key + ' not found');\n\t\t\t\tself -> 'tagtime_tagname'=tag_name;\n\t\t\t\tself -> 'tagtime'=integer(#timer); // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t\t\t(self -> 'debug') \n\t\t\t\t\t? return('*' + #key + '*') \n\t\t\t\t\t| return;\n\t\t\t/if;\n\t\t\t#output = (self -> 'strings') -> (find: #language) -> (find: #key);\n\t\t\t//(self -> 'debug_trace') -> (insert: tag_name + ': found string \"' + (encode_html: #output) + '\" for key \"' + #key + '\" and language ' + #language);\n\t\t\t\n\t\t\tif: #output -> (isa: 'tag');\n\t\t\t\t// execute compund expression\n\t\t\t\t#output = #output -> run;\n\t\t\t/if;\n\t\t\tif((#output -> isa('string') || #output -> isa('bytes')) \n\t\t\t\t&& #output -> size && (local_defined: 'replace'));\n\t\t\t\t// replace placeholders with real values\n\t\t\t\tif: !(#replace -> (isa: 'array')) && !(#replace -> (isa: 'map'));\n\t\t\t\t\t#replace = (array: #replace);\n\t\t\t\t/if;\n\t\t\t\titerate: #replace, local: 'replacement';\n\t\t\t\t\t// make sure we have a pair\n\t\t\t\t\tif: !(#replacement -> (isa: 'pair'));\n\t\t\t\t\t\t#replacement = (pair: '#' + loop_count + '#' = #replacement);\n\t\t\t\t\t/if;\n\t\t\t\t\t// if we have a compund expression as replacement, execute the replacement first\n\t\t\t\t\tif: (#replacement -> value -> (isa: 'tag'));\n\t\t\t\t\t\t(#replacement -> value) = #replacement -> value -> run;\n\t\t\t\t\t/if;\n\t\t\t\t\t#output -> (replace: #replacement -> name, #replacement -> value);\n\t\t\t\t/iterate;\n\t\t\t/if;\n\t\t/if;\n\t\t\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: #output;\n\t\t\n\t/define_tag;\n\t\n\tdefine_tag: 'setlanguage', -description='Sets the current language for the string object. Also affects other instances on the same page that do not have an explicit language set. ',\n\t\t-required='language';\n\t\tlocal: 'timer'=knop_timer; \n\t\tif: (var: '_knop_data') -> type != 'map';\n\t\t\t// page level caching\n\t\t\t$_knop_data = map;\n\t\t/if;\n\t\tif: self -> (validlanguage: #language);\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': Setting language to ' + #language);\n\t\t\t(self -> 'currentlanguage') = #language;\n\t\t\t// save page level language\n\t\t\t$_knop_data -> insert('currentlanguage' = #language);\n\t\telse;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': Could not set current language to ' + #language + ' since it does not exist in the lang object');\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\tdefine_tag: 'validlanguage', -description='Checks if a specified language exists in the string object, \\\n\t\treturns true or false.',\n\t\t-required='language';\n\t\treturn: (self -> 'strings') -> keys >> #language;\n\t/define_tag;\n\t\n\tdefine_tag: 'browserlanguage', -description='Autodetects and returns the most preferred language \\\n\t\t\tout of all available languages as specified by the browser\\'s accept-language q-value. ';\n\t\t\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tlocal: 'browserlanguage'=string;\n\n\t\tif: (var: '_knop_data') -> type != 'map';\n\t\t\t// page level caching\n\t\t\t$_knop_data = map;\n\t\t/if;\n\n\t\tif: $_knop_data >> 'browserlanguage';\n\t\t\t// use page cache\n\t\t\t#browserlanguage = $_knop_data -> find('browserlanguage');\n\n\t\telse;\n\t\t\tlocal: 'requestheader'=client_headers -> (split: '\\r\\n'),\n\t\t\t\t'acceptlanguage'=string,\n\t\t\t\t'browserlanguages'=array;\n\t\t\t\n\t\t\titerate: #requestheader, (local: 'headerfield'); \n\t\t\t\t// strip IIS header prefix\n\t\t\t\t#headerfield -> (removeleading: 'HTTP_');\n\t\t\t\t\n\t\t\t\tif: #headerfield -> (beginswith: 'Accept-Language:'); \n\t\t\t\t\t#acceptlanguage=#headerfield;\n\t\t\t\t\tloop_abort;\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t\t#acceptlanguage -> (removeleading: 'Accept-Language:');\n\t\t\t#acceptlanguage -> trim;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': Accept-Language: ' + #acceptlanguage);\n\t\t\t#acceptlanguage = #acceptlanguage -> (split: ',');\n\t\t\titerate: #acceptlanguage, local: 'language';\n\t\t\t\t#language = #language -> (split: ';');\n\t\t\t\tif: #language -> size == 1;\n\t\t\t\t\t// no q value specified, use default 1.0\n\t\t\t\t\t#language -> (insert: 'q=1.0');\n\t\t\t\t/if;\n\t\t\t\t(#language -> first) -> trim; \n\t\t\t\tif: #language -> size >= 2 && #language -> first -> size;\n\t\t\t\t\t(#language -> second) = (#language -> second) -> (split: '=') -> last;\n\t\t\t\t\t(#language -> second) -> trim; \n\t\t\t\t\t#browserlanguages -> (insert: (decimal: (#language -> second)) = (#language -> first) );\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t\t#browserlanguages -> (sort: -ascending=false);\n\t\n\t\t\t// find the most preferred language\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': looking for matching languages ');\n\t\t\titerate: #browserlanguages, local: 'language';\n\t\t\t\tif: (self -> validlanguage: (#language -> second));\n\t\t\t\t\t/// found a valid language\n\t\t\t\t\t#browserlanguage=#language -> second;\n\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': found valid language ' + #browserlanguage);\n\t\t\t\t\tloop_abort;\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t\tif: #browserlanguage -> size == 0;\n\t\t\t\t// no matching language found, try again without locale\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': no valid language found, looking again without locale ' + #language);\n\t\t\t\titerate: #browserlanguages, local: 'language';\n\t\t\t\t\t(#language -> second) = (#language -> second) -> (split: '-') -> first;\n\t\t\t\t\tif: (self -> validlanguage: (#language -> second));\n\t\t\t\t\t\t/// found a valid language\n\t\t\t\t\t\t#browserlanguage=#language -> second;\n\t\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': found valid language ' + #browserlanguage);\n\t\t\t\t\t\tloop_abort;\n\t\t\t\t\t/if;\n\t\t\t\t/iterate;\n\t\t\t/if;\n\t\t\t$_knop_data -> insert('browserlanguage'=#browserlanguage);\n\t\t/if;\n\t\t\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: #browserlanguage;\n\n\t/define_tag;\n\t\n\tdefine_tag: 'languages', -description='Returns an array of all available languages in the string object \\\n\t\t\t(out of the languages in the -language array if specified). \\n\\\n\t\t\tParameters: \\n\\\n\t\t\t-language (optional) string or array of strings.',\n\t\t-optional='language', -copy;\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tlocal: 'languages'=(self -> 'strings') -> keys;\n\t\tif: (local_defined: 'language');\n\t\t\tif: !(#language -> (isa: 'array'));\n\t\t\t\t#language = array: #language;\n\t\t\t/if;\n\t\t\t#languages -> sort;\n\t\t\t#language -> sort;\n\t\t\t// get the languages that exist in both arrays\n\t\t\t#languages = #languages -> (intersection: #language);\n\t\t/if;\n\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: #languages;\n\t/define_tag;\n\t\n\tdefine_tag: 'keys', -description='Returns array of all text keys in the string object. ';\n\t\tif: !((self -> 'keys') -> (isa: 'array'));\n\t\t\tlocal: 'keysarray'=array, 'keysmap'=map, 'keysarray_new'=array;\n\t\t\t// no cached result yet - create list of all keys\n\t\t\titerate: (self -> 'strings'), local: 'strings_language';\n\t\t\t\t#keysarray_new = #strings_language -> value -> keys;\n\t\t\t\t#keysarray_new -> sort;\n\t\t\t\t#keysarray -> sort;\n\t\t\t\t// add the keys that are not already in #keysarray by using union\n\t\t\t\t#keysarray = #keysarray -> (union: #keysarray_new);\n\t\t\t/iterate;\n\t\t\t(self -> 'keys') = #keysarray;\n\t\t/if;\n\t\treturn: (self -> 'keys');\n\t/define_tag;\n\t\n\n/define_type;\n\n?>\n[\n//------------------------------------------------------------------\n// End knop_lang\n//------------------------------------------------------------------\n\n//##################################################################\n\n][\n//------------------------------------------------------------------\n// Begin knop_nav\n//------------------------------------------------------------------\n\n] url tag.\n2010-11-17\tJC\tFixed a bug that would not convert local params to an array under certain situations\n2009-09-18\tJS\tSyntax adjustments for Lasso 9\n2009-09-04\tJS\t->linkparams: Multiple paramaters with the same name (typically checkboxes) are now passed properly\n2009-05-06\tJS\t->directorytree considers _include folders as part of the Knop directory structure. nav->include('_include/myfile.inc') will first look for _include/myfile.inc and if not found it will look for _knop/_include/myfile.inc \n2009-05-05\tJS\t->include looks for a specified file also inside a _knop folder, if the file does not exist at the specified location\n2009-02-09\tJS\t->filename: Casting path and actionpath to string\n2008-12-19\tJS\t->filename (and consequently ->include and ->library) can now use a specific -path instead of the current location's path\n2008-12-09\tJS\t->linkparams: fixed undefined local in trace call (only showed when trace was enabled for the nav object)\n2008-11-25\tJS\t->getlocation will now avoid disabled and hidden pages when looking for the first page if no default page is specified\n2008-11-03\tJS\t->getlocation will not break if no navigation items have been defined\n2008-10-30\tJS\t_mod folders will now work with knop paths with just a single level, so an include file path can end up as _mod_customer/lib_customer.inc or just _mod_customer/lib.inc (the latter variant does not apply to extension-based filenaming, so _mod_customer/.lib will never be a working file path)\n2008-07-10\tJS\tAdded -> label to return the name of the current page\n2008-05-20\tJS\t->renderhtml: #current# is not automatically added to the template if the more elaborate template format is used. This makes it easier to hide the currentmarker without changing the nav config (partial revert of fix 2008-01-04). \n2008-05-08\tJS\t->insert: A duplicate key does no longer cause a fatal error but instead fails silently and logs to the debug log\n2008-05-07\tJS\t->url: will now call ->linkparams so all links that are constructed from ->url will properly send along the parameters specified in the nav item. This also affects pagination and sort links in grid. \n2008-05-07\tJS\tAdded ->linkparams, Returns an array for all parameters that should be sent along with nav links (this was previously embedded in renderhtml)\n2008-02-25\tJS\t->url: new parameter -getargs to add the getargs to the path link if the path equals the current path\n2008-02-06\tJC\t->insert: the -hide flag can now be a boolean (also the -disabled flag)\n2008-02-03\tJS\t->include: can now include any specified filename\n2008-02-01\tJS\t->oncreate: added optional -fileroot to be able to use a root for files that is different from the logical site root used for navigation \n2008-01-23\tJS\t->url: Added -autoparams that is required to enable the automatic passing of action_params that begin with \"-\" (this reverts the default behavior to match the the old)\n2008-01-22\tJS\t->url: GET params that begin with \"-\" are sent as parameters on links. -path, -sort, -desc, -q are explicitly excluded from nav links in renderhtml. \n2008-01-22\tJS\tWhen using param based navigation, navigation links now use much cleaner /?path/to/page/ style links instead of /?-path=path/to/page/\n2008-01-22\tJS\t->getlocation: when navmethod is param, the path can now be sent as unnamed parameter insetad of -path parameter (such as /?path/to/page/). \n2008-01-04\tJS\t->renderbreadcrumb: added flag -plain to output breadcrumb without html\n2008-01-04\tJS\t->renderbreadcrumb: added flag -skipcurrent to not include the current location in the output\n2008-01-04\tJS\t->insert: -template can now be specified also for individual nav items. Use the form #link##label##current##/link##children#. \n2008-01-04\tJS\t->renderhtml: changed #title# to #label# in template for clarity, for example #link##label##current##/link##children# (#title# will remain supported)\n2008-01-04\tJS\tAdded #current# as placeholder for template, to specify where the current marker should occurr. If not specified in the template, the current marker appears immediately after the label.\n2007-12-12\tJS\t->include now logs processing time for the include to debug trace\n2007-12-11\tJS\tAdded documentation as -description to most member tags, to be used by the new ->help tag\n2007-12-11\tJS\tMoved ->help to knop_base\n2007-12-04\tJS\tnav item css class is now applied also to disabled nav items (rendered as )\n2007-11-08\tJS\tChanged trace so it tracks some things even when it's not enabled (like include etc)\n2007-11-05\tJS\tAdded var name to trace output\n2007-10-28\tJS\t->directorytree: should now work also when knop folders are symlinks\n2007-09-06\tJS\ttop level nav elements that are -disabled now behave properly when accessed\n2007-09-05\tJS\t-currentmarker can now be set separately on sublevels, not only on topmost level\n2007-08-29\tJS\tAdded _knop as optional base folder to put all knop files in\n2007-08-29\tJS\t->include: Removed file_exists check since the filename has already been verified in ->filename.\n2007-08-29\tJS\tAdded ->directorytree which returns a map with all knop filenames, to use when searching for includes\n2007-08-28\tJS\t->oncreate: -filenaming to specify how include files are named prefix/suffix/extension\n2007-08-28\tJS\t->filename: Implemented support for flexible folder structures\n2007-08-28\tJS\tInstance variable #actionconfigfile_didrun was not properly declared\n2007-06-18\tJS\tAdded tag timer to most member tags\n2007-06-14\tJS\t->insert: -url='/' can now be used to specify the \"home\" location. \n2007-06-13\tJS\tadded ->children to get a reference to the children nav object for a specified path, so new children can be inserted. Must call ->reindex afterwards. \n2007-06-13\tJS\tadded ->reindex to rebuild the index maps from scratch. Must be done after adding children items. \n2007-06-13\tJS\tadded ->addchildren to replace a current children nav object for a specified path. Will handle the reindexing transparently. \n2007-06-13\tJS\tadded ->keymap, ->pathmap and ->urlmap to access the index maps so they call reindex if they have been invalidated (for example by ->addchildren)\n2007-06-13\tJS\tadded inheritance from knop_base\n2007-06-11\tJC\tadded handling of xhtml output\n2007-06-08\tJS\t->insert: params with empty values are now ignored\n2007-05-04\tJS\t->insert: added check that default item exists in children before storing the default\n2007-04-19\tJS added ->data to retrieve data stored for the current path (or specified path). Optional -type ensures the returned data has the correct type. \n2007-04-19\tJS ->insert: added -data to store arbitrary data object for each path. The object is stored as reference so a variable can be changed after it has been added to the nav object\n2007-04-19\tJS\tadded ->patharray to return the current path as array\n2007-04-17\tJS\t->renderhtml: template now supports #link##title##/link##children# in addition to #item# to provide more flexibility\n2007-04-17\tJS\t->oncreate: added support for -template, -class, currentclass and -currentmarker\n2007-04-13\tJS\tImplemented -class per navitem (only worked globally with setformat before)\n2007-04-03\tJS\t->renderhtml: added -renderpath, -expand and -flat to be able to render parts of the nav menu for more flexible layout\n2007-04-03\tJS\t->renderbreadcrumb: added -home to show the default navigation item first in the breadcrumb \n2007-04-03\tJS\tChanged namespace from mt_ to knop_\n2007-03-01\tJS\tChanged navmethod path so it uses response_filepath instead of $url_path\n2007-02-25\tJS\tAdded ->actionpath\n2007-02-24\tJS\t->renderhtml: improved handling of classes in nav links\n2007-02-22\tJS\t->url: added -except\n2007-02-09\tJS\t->url: corrected the behavior for plain parameters passed to the tag\n2007-02-05\tJS\t->insert: Added -param to be able to specify params that should be propagated in nav for certain nav elements (like -keyvalue to be able to move between different subtabs for a selected record\n2007-02-05\tJS\t->renderhtml now use ->url to get the right links\n2007-02-01\tJS\tMade usage of trace optional to improve performance\n2007-02-01\tJS\tImprovements to debug_trace to log also recursive events\n2007-02-01\tJS\tAdded ->haschildren, which is now used by ->renderhtml to properly show or hide child level\n2007-01-31\tJS\t->renderhtml Added renderhtml_levels to keep track of how many levels deep navigation has been rendered, to be able to add proper spacing between navigation and content\n2007-01-31\tJS \t->url: -urlargs Improved handling of urlargs and ?/& delimiters, should work better with navmethod path\n2007-01-30\tJS\tRemoved automatic link title attribute since it can be confusing to show children page titles there\n2007-01-30\tJS\tCorrected parameter path to -path (bug)\n2007-01-23\tJS\t->include: 'config' checks if the same config has already run as actionconfig and won't run again in that case\n2007-01-23\tJS\t->include checks if the file exists first, so no need for empty placeholder files\n2007-01-23\tJS\tAdded ->include and ->library\n2007-01-23\tJS\tAdded ->setlocation\n2007-01-17\tJS\tAdded insert: -hide to allow a location without showing it in navigation\n\nTODO\nAdd support for compound expressions for template. The expression could return a map that would override corresponding param values. \n->insert: Add -raw to be able to inject code into the link tag, similar to form->addfield(-raw). \nExclude file name for example index.lasso from getargs\nOptimize nav->url! Very slow with complex nav object. \nNeeds to exclude also -keyfield and -lockfield. Maybe better to add an option to ->url to not auto-add any \"-\" params at all. \n-params are not sent along in breadcrumb links\nNeed simple way to exclude certain \"-\" params from ->url, also in config per nav item\nAdd support for adding nav structure from a database\nMove templates to a member tag to be make it easier to subclass\nMake it possible to use external URL for -url (make sure there is no / before http)\n\n*/\n\n\tlocal: 'navitems'=array,\t// array of maps\n\t\t'keymap'=map,\t\t\t// to speed up the locating of critical navigation elements (TBD)\n\t\t'pathmap'=map,\t\t\t// contains full key paths also for children navitems\n\t\t'urlmap'=map,\t\t\t// to translate a url to key path, contains url also for children navitems\n\t\t'default'=string,\t\t// default path, i.e. home page\n\t\t'parentkey'=null,\t\t// the key of the parent to this navitem (null for top item)\n\t\t'template'=string,\n\t\t'class'=string,\n\t\t'currentclass'=string,\n\t\t'currentmarker'=null,\n\n\t\t'actionpath'=string,\t\t// captured from -action parameter in submission\n\t\t'path'=string,\t\t\t// captured from path param or urlhandler and translated from url\n\t\t'patharray'=array,\t\t// path broken down into elements\n\t\t'pathargs'=string,\t\t// extra path parts that can contain record identification etc\n\t\t'urlparams'array,\t\t// holds everything needed to generate nav links\n\t\t'navmethod'=string,\t\t// path or param depending on how the nav is propagated. To be able to force path, since url handler doesn't kick in for the start page\n\t\t'filenaming'=string,\n\t\t'directorytreemap'=map,\t// contains a list of all existing filenames in the knop directory tree\n\t\t'root'='/',\t\t\t\t// site root\n\t\t'fileroot'='/',\t\t\t// root for physical files\n\t\t'renderhtml_levels'=0,\t// number of levels rendered by renderhtml\n\t\t// 'tagtime'=integer, \t\t\t// moved to knop_base\n\t\t// 'tagtime_tagname'=string, \t// moved to knop_base\n\t\t'debug_trace'=array,\n\t\t'dotrace'=false,\n\t\t'actionconfigfile_didrun'=string,\t// path to action config file that has been run for the current page load\n\t\t\t\t\t\t\t\t\t\t\t// used to not load the same config again\n\t\t'error_lang'=(knop_lang: -default='en', -fallback);\n\n\tdefine_tag: 'oncreate', -description='Parameters:\\n\\\n\t\t\t-default (optional) Key of default navigation item\\n\\\n\t\t\t-root (optional) The root path for the site section that this nav object is used for\\n\\\n\t\t\t-fileroot (optional) The root for include files, to be able to use a different root for physical files than the logical root of the site. Defaults to the value of -root. \\n\\\n\t\t\t-navmethod (optional) path or param. Path for \"URL designed\" URLs, otherwise a -path parameter will be used for the navigation. \\n\\\n\t\t\t-filenaming (optional) prefix (default), suffix or extension, specifies how include files are named\\n\\\n\t\t\t-trace (optional flag) If specified debug_trace will be used. Defaults to disabled for performance reasons. \\n\\\n\t\t\t-template (optional) html template used to render the navigation menu\\n\\\n\t\t\t-class (optional) default class for all navigation links\\n\\\n\t\t\t-currentclass (optional) class added for the currently active link\\n\\\n\t\t\t-currentmarker (optional) character(s) show to the right link of current nav (typically »)',\n\t\t-optional='template',\n\t\t-optional='class',\n\t\t-optional='currentclass',\n\t\t-optional='currentmarker',\n\t\t-optional='default',\n\t\t-optional='root',\n\t\t-optional='fileroot',\n\t\t-optional='navmethod',\n\t\t-optional='filenaming',\n\t\t-optional='trace';\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace');\n\t\t// TODO: check if we are in an inline, in that case use -key, -label etc as field names and loop through records to fill nav\t\t\n\t\t\n\t\tlocal_defined('default') ? (self -> 'default') = #default;\n\t\tlocal_defined('root') ? (self -> 'root') = #root;\n\t\tlocal_defined('navmethod') ? (self -> 'navmethod') = #navmethod; \n\t\tlocal_defined('template') ? (self -> 'template') = #template;\n\t\tlocal_defined('class') ? (self -> 'class') = #class;\n\t\tlocal_defined('currentclass') ? (self -> 'currentclass') = #currentclass;\n\t\tlocal_defined('currentmarker') ? (self -> 'currentmarker') = #currentmarker;\n\t\tlocal_defined('filenaming') ? (self -> 'filenaming') = #filenaming;\n\n\t\t(self -> 'dotrace') = (local_defined: 'trace') && #trace != false;\n\t\t// normalize slashes\n\t\t(self -> 'root') -> removeleading('/') & removetrailing('/');\n\t\t(self -> 'root') = '/' + (self -> 'root') + '/';\n\t\t(self -> 'root') -> replace('//', '/');\n\n\t\tif: (local_defined: 'fileroot');\n\t\t\t(self -> 'fileroot') = #fileroot;\n\t\t\t// normalize slashes\n\t\t\t(self -> 'fileroot') -> removeleading('/') & removetrailing('/');\n\t\t\t(self -> 'fileroot') = '/' + (self -> 'fileroot') + '/';\n\t\t\t(self -> 'fileroot') -> replace('//', '/');\n\t\telse;\n\t\t\t(self -> 'fileroot') = (self -> 'root');\n\t\t/if;\n\t\t\n\t\t// validate and set default value\n\t\t(map: 'prefix', 'suffix', 'extension') !>> (self -> 'filenaming') ? (self -> 'filenaming') = 'prefix'; \n\t\t\n\t\t// can not perform getlocation here since the nav structure must be defined first\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\tdefine_tag: 'onconvert', -description='Outputs the navigation object in a very basic form, just to see what it contains';\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\tlocal: 'output' = (self -> 'parentkey') + ': ';\n\t\titerate: (self -> 'navitems'), (local: 'navitem');\n\t\t\t#output += #navitem + '\\n';\n\t\t/iterate;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @#output;\n\t/define_tag;\n\n\tdefine_tag: 'insert', -description='Adds a navigation item to nav structure\\n\\\n\t\t\tParameters:\\n\\ \n\t\t\t-key (required) The key will be part of the path\\n\\ \n\t\t\t-label (optional) The menu text\\n\\ \n\t\t\t-url (optional) Nav url to use instead of the default url that is derived from the keys path, used as shortcuts for cleaner URLs\\n\\ \n\t\t\t-title (optional) Link href title text\\n\\ \n\t\t\t-template (optional) Template to use only for this specific nav item, in the form #link##label##current##/link##children#\\n\\\n\t\t\t-children (optional nav) Sub navitems\\n\\ \n\t\t\t-default (optional) Key of default child subnav item\\n\\ \n\t\t\t-param (optional) Name of param or params (string/array) that should be sent along with nav links\\n\\ \n\t\t\t-class (optional) CSS class name to use for this nav item (defaults to none)\\n\\ \n\t\t\t-filename (optional) Name stem for lib, action and content files (defaults to key path with _ instead of /), to be able to use the same processing files for multiple locations\\n\\ \n\t\t\t-disabled (optional flag) Makes the menu item dimmed and non-clickable\\n\\ \n\t\t\t-hide (optional flag) Makes the location valid without showing a menu item for it\\n\\ \n\t\t\t-after (optional) After which navitem to insert this navitem (key or numeric index)\\n\\ \n\t\t\t-data (optional) Arbitrary data object (variable, map, array, compound expression) that can be returned for the location by calling ->data',\n\t\t-required='key',\n\t\t-optional='label',\n\t\t-optional='default',\n\t\t-optional='url', -copy,\n\t\t-optional='title',\n\t\t-optional='template',\n\t\t-optional='children', -type='nav',\n\t\t-optional='param',\n\t\t-optional='class',\n\t\t-optional='filename',\n\t\t-optional='disabled',\n\t\t-optional='hide',\n\t\t-optional='after',\n\t\t-optional='data';\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\t\n\t\tfail_if: !(local_defined: 'hide') && (local: 'label') == '', -1, 'Insert requires a label';\n\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': -key = ' + #key);\n\t\t// fail_if: (self -> keymap) >> #key, -1, #key + ' is not unique';\n\t\tif: (self -> keymap) >> #key;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': *** Error key ' + #key + ' is not unique - skipping');\n\t\t\treturn;\n\t\t/if;\n\t\tlocal: 'urlmapchildren'=map,\n\t\t\t'pathmapchildren'=map;\n\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': #key=' + #key);\n\t\tif: (local_defined: 'children');\n\t\t\t(#children -> 'parentkey') = #key;\n\t\t\t// grab urlmap and pathmap from children\n\t\t\t#urlmapchildren = (#children -> urlmap);\n\t\t\t#pathmapchildren = (#children -> pathmap);\n\t\t\tif: !(local_defined: 'title');\n\t\t\t\t// set default title to labels of children\n\t\t\t\t/*\n\t\t\t\tlocal: 'title' = array;\n\t\t\t\titerate: (#children -> 'navitems'), (local: 'item');\n\t\t\t\t\t#title -> (insert: (#item -> (find: 'label')));\n\t\t\t\t/iterate;\n\t\t\t\t#title = #title -> (join: ', ');\n\t\t\t\t*/\n\t\t\t/if;\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': adding children');\n\t\t\t(self -> 'debug_trace') -> (merge: (#children -> 'debug_trace'));\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': done adding children');\n\t\t/if;\n\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': #key=' + #key);\n\t\tlocal: 'navitem'=map;\n\t\tlocal_defined('key') && #key != '' ? #navitem -> insert('key' = #key); \n\t\tlocal_defined('label') && #label != '' ? #navitem -> insert('label' = #label); \n\t\tlocal_defined('default') && #default != '' ? #navitem -> insert('default' = #default); \n\t\tlocal_defined('url') && #url != '' ? #navitem -> insert('url' = #url); \n\t\tlocal_defined('title') && #title != '' ? #navitem -> insert('title' = #title); \n\t\tlocal_defined('template') && #template != '' ? #navitem -> insert('template' = #template); \n\t\tlocal_defined('children') && #children != '' ? #navitem -> insert('children' = #children); \n\t\tlocal_defined('class') && #class != '' ? #navitem -> insert('class' = #class); \n\t\tlocal_defined('filename') && #filename != '' ? #navitem -> insert('filename' = #filename);\n\n\t\tif(local_defined('default') && #default != '' && #pathmapchildren >> #default);\n\t\t\t// only add default that exists in children\n\t\t\t#navitem -> insert('default' = #default);\n\t\t/if;\n\t\t// store these params by reference\n\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': #key=' + #key);\n\t\tlocal_defined('data') && #data != '' ? #navitem -> insert('data' = @#data);\n\n\t\tif: (local_defined: 'param') && #param -> type =='array';\n\t\t\t#navitem -> (insert: 'params'=#param);\n\t\telse: (local_defined: 'param') && #param != '';\n\t\t\t#navitem -> (insert: 'params'=(array: #param));\n\t\t/if;\n\t\t#navitem -> (insert: 'disabled'=(local_defined: 'disabled') && #disabled != false);\n\t\t#navitem -> (insert: 'hide'=(local_defined: 'hide') && #hide != false);\n\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': #key=' + #key);\n\t\tlocal: 'index'=(self -> 'navitems') -> size + 1;\n\t\tif: (local_defined: 'after') && (string: #after) -> size;\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': -after=' + #after);\n\t\t\tif: #after -> type == 'integer';\n\t\t\t\t#index = #after;\n\t\t\telse: (self -> keymap) >> #after;\n\t\t\t\t#index = (self -> keymap) -> (find: #after) + 1;\n\t\t\t/if;\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': index=' + #index);\n\t\t/if;\n\t\tif: #urlmapchildren -> size;\n\t\t\t// we have urlmap from children - insert it into our urlmap with modified keyvalues\n\t\t\titerate: #urlmapchildren, (local: 'urlitem');\n\t\t\t\tfail_if: (self -> urlmap) >> #urlitem -> name, -1, 'url ' + (#urlitem -> name) + ' is not unique';\n\t\t\t\t(self -> 'urlmap') -> (insert: #urlitem -> name = #key + '/' + (#urlitem -> value));\n\t\t\t/iterate;\n\t\t/if;\n\t\tif: #pathmapchildren -> size;\n\t\t\t// we have pathmap from children - insert it into our pathmap with modified keys\n\t\t\titerate: #pathmapchildren, (local: 'pathitem');\n\t\t\t\t(self -> 'pathmap') -> (insert: #key + '/' + #pathitem -> name);\n\t\t\t/iterate;\n\t\t/if;\n\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': #key=' + #key);\n\t\tif: (local_defined: 'url') && #url != '';\n\t\t\t#url -> (removeleading: '/') & (removetrailing: '/');\n\t\t\tfail_if: (self -> urlmap) >> #url, -1, 'url ' + #url + ' is not unique';\n\t\t\t(self -> 'urlmap') -> (insert: #url = #key);\n\t\t/if;\n\t\t(self -> 'pathmap') -> (insert: #key);\n\t\t(self -> 'navitems') -> (insert: #navitem, #index);\n\t\t// update keymap\n\t\t(self -> 'keymap') = map;\n\t\titerate: (self -> 'navitems'), (local: 'item');\n\t\t\t(self -> 'keymap') -> (insert: (#item -> (find: 'key')) = loop_count);\n\t\t/iterate;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\t\n\t/define_tag;\n\t\n\t\n\t/*\n\tdefine_tag: 'remove',\t-description='Remove nav object and its children for specified key path. Must update index maps afterwards. ',\n\t\t-required='path', -type='string', -copy;\n\t\tfail: -1, 'Not implemented'; // This tag is not yet functional\n\t\t\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\t#path -> removeleading('/') & removetrailing('/');\n\t\tlocal: 'path_remove'=#path -> split('/') -> last;\n\t\t#path -> removetrailing(#path_remove) & removetrailing('/');\n\t\t// we need to find a reference to the navitems array of maps that contains the nav item to remove\n\t\tif: #path -> size;\n\t\t\tlocal: 'navitem'=@(self -> getnav(#path));\n\t\telse;\n\t\t\tlocal: 'navitem'=@self -> getnav;\n\t\t/if;\n\t\t// we also need to find a reference to the keymap where we can find the index of the array item to remove\n\t\treturn: #navitem;\n\t\t(#navitem -> getnav) -> remove(#navitem -> keymap -> find(#path_remove));\n\t\t\n\t\t// invalidate index maps\n\t\t(#navitem -> 'keymap') = null;\n\t\t(#navitem -> 'pathmap') = null;\n\t\t(#navitem -> 'urlmap') = null;\n\n\t\t(self -> 'keymap') = null;\n\t\t(self -> 'pathmap') = null;\n\t\t(self -> 'urlmap') = null;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t*/\n\t\n\tdefine_tag: 'addchildren',\t-description='Add nav object as children to specified key path, replacing the current children if any. \\\n\t\tMust update index maps afterwards. ',\n\t\t-required='path',\n\t\t-required='children', -type='nav';\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\tlocal: 'navitem'=@(self -> (getnav: #path));\n\t\t#navitem -> (insert: 'children' = #children);\n\n\t\t// invalidate index maps\n\t\t(#navitem -> 'keymap') = null;\n\t\t(#navitem -> 'pathmap') = null;\n\t\t(#navitem -> 'urlmap') = null;\n\n\t\t(self -> 'keymap') = null;\n\t\t(self -> 'pathmap') = null;\n\t\t(self -> 'urlmap') = null;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\tdefine_tag: 'children', -description='Return reference to the children of the current navigation object map, or for the specified path',\n\t\t-optional='path', -copy; \n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\t!(local_defined: 'path') ? local: 'path'=(self -> 'patharray');\n\t\tif: #path -> type != 'array';\n\t\t\t#path = string: #path;\n\t\t\t#path -> (removeleading: '/') & (removetrailing: '/');\n\t\t\t#path = #path -> (split: '/');\n\t\t/if;\n\t\t(self -> pathmap) !>> (#path -> (join: '/')) ? return: knop_nav;\n\n\t\tlocal: 'nav'=@(self -> (getnav: #path));\n\t\tif: #nav !>> 'children';\n\t\t\t#nav -> (insert: 'children'=knop_nav);\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @(#nav -> (find: 'children'));\n\t/define_tag;\n\t\n\tdefine_tag: 'reindex', -description='To recreate keymap, pathmap and urlmap';\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\t(self -> 'keymap') = map;\n\t\t(self -> 'pathmap') = map;\n\t\t(self -> 'urlmap') = map;\n\t\tlocal: 'key'=null, 'pathitem'=null, 'urlitem'=null, 'url'=string;\n\t\titerate: (self -> 'navitems'), (local: 'navitem');\n\t\t\t#key = #navitem -> (find: 'key');\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': key=' + #key);\n\t\t\t(self -> 'keymap') -> (insert: #key = loop_count);\n\t\t\t(self -> 'pathmap') -> (insert: #key);\n\t\t\tif: #navitem -> (find: 'url') != '';\n\t\t\t\t#url=#navitem -> (find: 'url');\n\t\t\t\t#url -> (removeleading: '/') & (removetrailing: '/');\n\t\t\t\tfail_if: (self -> urlmap) >> #url, -1, 'url ' + #url + ' is not unique';\n\t\t\t\t(self -> 'urlmap') -> (insert: #url = #key);\n\t\t\t/if;\n\t\t\tif: #navitem >> 'children';\n\t\t\t\t#navitem -> (find: 'children') -> reindex; // recursive\n\t\t\t\titerate: (#navitem -> (find: 'children') -> pathmap), #pathitem;\n\t\t\t\t\t(self -> 'pathmap') -> (insert: #key + '/' + #pathitem -> name);\n\t\t\t\t/iterate;\n\t\t\t\titerate: (#navitem -> (find: 'children') -> urlmap), #urlitem;\n\t\t\t\t\tfail_if: (self -> urlmap) >> #urlitem -> name, -1, 'url ' + (#urlitem -> name) + ' is not unique';\n\t\t\t\t\t(self -> 'urlmap') -> (insert: #urlitem -> name = #key + '/' + (#urlitem -> value));\n\t\t\t\t/iterate;\n\t\t\t/if;\n\t\t/iterate;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\tdefine_tag: 'keymap';\n\t\t(self -> 'keymap') -> type != 'map' ? self -> reindex;\n\t\treturn: (self -> 'keymap');\n\t/define_tag;\n\tdefine_tag: 'pathmap';\n\t\t(self -> 'pathmap') -> type != 'map' ? self -> reindex;\n\t\treturn: (self -> 'pathmap');\n\t/define_tag;\n\tdefine_tag: 'urlmap';\n\t\t(self -> 'urlmap') -> type != 'map' ? self -> reindex;\n\t\treturn: (self -> 'urlmap');\n\t/define_tag;\n\t\n\tdefine_tag: 'getlocation', -description='Grabs path and actionpath from params or urlhandler, translates from url to path if needed. This must be called before using the nav object. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-setpath (optional) forces a new path',\n\t\t-optional='setpath';\n\t\thandle;knop_debug('Done with ' + self->type + ' -> ' + tag_name, -time, -type=self->type);/handle;\n\t\tlocal: 'path'=string, \n\t\t\t'patharray'=array, \n\t\t\t'originalpath'=string, \n\t\t\t'pathargs'=string,\n\t\t\t'actionpath'=string,\n\t\t\t'validurl'=false;\n\t\t\t// TODO: Produce 404 error for invalid urls\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\t\t\n\t\t(self -> 'path') = string;\n\t\t(self -> 'patharray') = array;\n\t\t(self -> 'pathargs') = string;\n\t\t(self -> 'actionpath') = string;\n\t\t// get action path\n\t\tlocal: 'clientparams'=client_getparams;\n\t\t#clientparams -> (merge: client_postparams);\n\t\t#actionpath = (#clientparams >> '-action' ? (#clientparams -> (find: '-action') -> first -> value) | string);\n\t\t#actionpath -> (removeleading: '/') & (removetrailing: '/');\n\t\t// validate action path\n\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': testing action path ' + #actionpath);\n\t\tif: #actionpath -> size && (self -> pathmap) >> #actionpath;\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': found match for action path ' + #actionpath);\n\t\t\t(self -> 'actionpath') = #actionpath;\n\t\t/if;\n\n\t\t// get url or path\n\t\tif: (local: 'setpath') != '';\n\t\t\t#originalpath = string: #setpath;\n\t\telse: (self -> 'navmethod') != 'param'; \n\t\t\t(self -> 'navmethod') = 'path';\n\t\t\t#originalpath = response_filepath;\n\t\t\t#originalpath -> (removeleading: (self -> 'root'));\n\t\telse: (self -> 'navmethod') != 'path';\n\t\t\t(self -> 'navmethod') = 'param';\n\t\t\tif: #clientparams >> '-path';\n\t\t\t\t// path is sent as -path GET or POST parameter\n\t\t\t\t#originalpath = (#clientparams >> '-path' ? (#clientparams -> (find: '-path') -> first -> value) | string);\n\t\t\telse: client_getparams -> size && client_getparams -> first -> isa('string');\n\t\t\t\t// path is sent as first unnamed GET parameter \n\t\t\t\t#originalpath = client_getparams -> first;\n\t\t\t/if;\n\t\t/if;\n\t\t#originalpath -> (removeleading: '/') & (removetrailing: '/');\n\t\t#path = #originalpath;\n\t\t#patharray = (string: #originalpath) -> (split: '/');\n\t\t// look for longest match in urlmap\n\t\tlocal: 'pathfinder'=#patharray;\n\t\tloop: #pathfinder -> size;\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': looking at url ' + #pathfinder -> (join: '/'));\n\t\t\tif: (self -> urlmap) >> #pathfinder -> (join: '/');\n\t\t\t\t// use translated key path\n\t\t\t\t#path=(self -> urlmap) -> (find: #pathfinder -> (join: '/'));\n\t\t\t\t#validurl=true;\n\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': found url match for ' (#pathfinder -> (join: '/')) + ' translating to ' + #path);\n\t\t\t\tloop_abort;\n\t\t\telse;\n\t\t\t\t// remove last path part and try again\n\t\t\t\t#pathfinder -> remove;\n\t\t\t/if;\n\t\t/loop;\n\t\tif: !#validurl;\n\t\t\t// no url found, dig into the nav structure to see if path is valid\n\t\t\tlocal: 'pathfinder'=#patharray;\n\t\t\tloop: #pathfinder -> size;\n\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': looking at path ' + #pathfinder -> (join: '/'));\n\t\t\t\tif: (self -> pathmap) >> #pathfinder -> (join: '/');\n\t\t\t\t\t// use key path\n\t\t\t\t\t#path=#pathfinder -> (join: '/');\n\t\t\t\t\t#validurl=true;\n\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': found path match for ' (#pathfinder -> (join: '/')));\n\t\t\t\t\tloop_abort;\n\t\t\t\telse;\n\t\t\t\t\t// remove last path part and try again\n\t\t\t\t\t#pathfinder -> remove;\n\t\t\t\t/if;\n\t\t\t/loop;\n\t\t/if;\n\t\t// look for disabled path\n\t\tif: #validurl;\n\t\t\t#path = (string: #path) -> (split: '/');\n\t\t\twhile: #path -> size > 1 && (self -> (getnav: #path)) -> (find: 'disabled');\n\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': path '+ #path + ' is disabled');\n\t\t\t\t#path -> remove;\n\t\t\t/while;\n\t\t\tif: (self -> (getnav: #path)) -> (find: 'disabled');\n\t\t\t\t#validurl = false;\n\t\t\t/if;\n\t\t\t#path = #path -> (join: '/');\n\t\t/if;\n\t\t\n\t\tif: !#validurl;\n\t\t\t// we haven't found a valid location, we must resort to a default page\n\t\t\tif: self -> 'default' != '' && self -> pathmap >> self -> 'default';\n\t\t\t\t#path = self -> 'default';\n\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': use defalt location ' #path);\n\t\t\telse;\n\t\t\t\t// use first page as default, if it exists\n\t\t\t\titerate(self -> 'navitems', local('navitem'));\n\t\t\t\t\tif(#navitem >> 'key' \n\t\t\t\t\t\t&& !(#navitem -> find('disabled')) \n\t\t\t\t\t\t&& !(#navitem -> find('hide')));\n\t\t\t\t\t\t#path = #navitem -> find('key');\n\t\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': use first page as default location ' #path);\n\t\t\t\t\t\tloop_abort;\n\t\t\t\t\t/if;\n\t\t\t\t/iterate;\n\t\t\t/if;\n\t\t\tif: (self -> pathmap) >> #path;\n\t\t\t\t#validurl = true;\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': no navigation seems to be defined ' #path);\n\t\t\t/if;\n\t\t/if;\n\t\t\n\t\tif: #validurl;\n\t\t\t// recursively look for default sub page\n\t\t\tlocal: 'hasdefault'=true;\n\t\t\twhile: #hasdefault;\n\t\t\t\tlocal: 'defaultkey' = (self -> (getnav: #path)) -> (find: 'default');\n\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': looking for default key ' + #defaultkey);\n\t\t\t\tif: !(((self -> (getnav: #path))) -> (find: 'disabled')) \n\t\t\t\t\t&& !(((self -> (getnav: #path + '/' + #defaultkey))) -> (find: 'disabled'))\n\t\t\t\t\t&& #defaultkey != '' && (self -> (getnav: #path)) -> (find: 'children') -> keymap >> #defaultkey;\n\t\t\t\t\t#path += '/' + #defaultkey;\n\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': new path is ' + #path);\n\t\t\t\telse;\n\t\t\t\t\t#hasdefault=false;\n\t\t\t\t/if;\n\t\t\t/while;\n\t\t\t\n\t\t\t// look for path arguments = the leftover when we found a matching path\n\t\t\t#pathargs = #originalpath;\n\t\t\t#pathargs -> (removeleading: #pathfinder -> (join: '/')) & (removeleading: '/');\n\t\t\t\n\t\t\t// store values\n\t\t\t(self -> 'path') = #path;\n\t\t\t(self -> 'patharray') = (string: #path) -> (split: '/');\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': path is ' + #path);\n\t\t\tif: #pathargs != '';\n\t\t\t\t(self -> 'pathargs') = #pathargs;\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': pathargs is ' + #pathargs);\n\t\t\t/if;\n\t\telse;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': no matching path found');\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\tdefine_tag: 'setlocation', -description='Sets the current location to a specific nav path or url',\n\t\t-required='path';\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\tself -> (getlocation: -setpath=#path);\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\t\n\tdefine_tag: 'setformat', -description='Sets html template for the nav object, use #items# #item# #/items# or more elaborate #items# #link##label##current##/link##children# #/items# as placeholders.\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-template (optional string) Html template, defaults to
    #items#
  • #item#
    • #/items#
\\n\\\n\t\t\t-class (optional string) Css class name that will be used for every navigation link\\n\\\n\t\t\t-currentclass (optional string) Css class name that will be added to the currently active navigation link (defaults to crnt)\\n\\\n\t\t\t-currentmarker (optional string) String that will be appended to menu text of currently active navigation link',\n\t\t-optional='template', -type='string',\n\t\t-optional='class', -type='string',\n\t\t-optional='currentclass', -type='string',\n\t\t-optional='currentmarker', -type='string';\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\t\n\t\t(local_defined: 'template') ? (self -> 'template') = #template;\n\t\t(local_defined: 'class') ? (self -> 'class') = #class;\n\t\t(local_defined: 'currentclass') ? (self -> 'currentclass') = #currentclass;\n\t\t(local_defined: 'currentmarker') ? (self -> 'currentmarker') = #currentmarker;\n\t\t\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'haschildren',\t-description='Returns true if nav object has children that are not all -hide.',\n\t\t-required='navitem', -type='map';\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\tlocal: 'haschildren'=#navitem >> 'children';\n\t\tif: #haschildren;\t// verify that there is at least one child that does not have -hide\n\t\t\t#haschildren=false; // assume there is no child to show\n\t\t\titerate: #navitem -> (find: 'children') -> 'navitems', (local: 'childitem');\n\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': checking ' + (#childitem -> (find: 'key')) + ', hide=' + (#childitem -> (find: 'hide')));\n\t\t\t\tif: !(#childitem -> (find: 'hide')); // found one\n\t\t\t\t\t#haschildren=true;\n\t\t\t\t\tloop_abort;\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t/if;\n\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': ' + #haschildren);\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: #haschildren;\n\t/define_tag;\n\n\tdefine_tag: 'renderhtml', -description='Called recursively to render hierarchial nav structure.\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-renderpath (optional) Only render the children of the specified path (and below)\\n\\\n\t\t\t-flat (optional flag) Only render one level\\n\\\n\t\t\t-expand (optional flag) Render the entire expanded nav tree and not just the currently active branch\\n\\\n\t\t\t-basepath (optional) Internal, needed for recursive calls to get proper paths\\n\\\n\t\t\t-ancestor (optional nav) Internal, reference to the topmost object, needed for recursive calls\\n\\\n\t\t\t-xhtml (optional) XHTML valid output',\n\t\t-optional='renderpath', -copy,\n\t\t-optional='flat',\n\t\t-optional='expand',\n\t\t-optional='basepath', -copy,\n\t\t-optional='ancestor', -type='nav';\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\tif: !(local_defined: 'ancestor');\n\t\t\thandle;knop_debug('Done with ' + self->type + ' -> ' + tag_name, -time, -type=self->type);/handle;\n\t\t\t// reset timer when called at top level\n\t\t\t// (self -> 'timer')=0; // undefined instance variable\n\t\t/if;\n\t\t\n\t\t// create reference to the topmost level nav object\n\t\tlocal: 'topself'=(local_defined: 'ancestor') ? @#ancestor | @self ;\n\t\t!(local_defined: 'ancestor') ? (#topself -> 'renderhtml_levels') = 1 | (#topself -> 'renderhtml_levels') += 1;\n\t\t\n\t\tlocal: '_flat' = (local_defined: 'flat') && #flat != false;\n\t\tlocal: '_expand' = (local_defined: 'expand') && #expand != false;\n\t\t\n\t\tlocal: 'template'=(self -> 'template' != '' ? self -> 'template' | #topself -> 'template');\n\t\tlocal: 'clientparams'=client_getparams;\n\t\t#clientparams -> (merge: client_postparams);\n\t\t\n\t\t!(local_defined: 'basepath') ? local: 'basepath'=string;\n\t\tif: #template == '';\n\t\t\t#template = '
    #items#
  • #item#
    • #/items#
';\n\t\t/if;\n\t\tlocal: 'output'=string,\n\t\t\t'itemoutput'=string,\n\t\t\t'itemchildren'=string,\n\t\t\t'itemrow'=string,\n\t\t\t'link'=string,\n\t\t\t'linkparams'=array,\n\t\t\t'thispath'=string,\n\t\t\t'classarray'=array,\n\t\t\t'currentmarker'=string,\n\t\t\t'itemtemplate'=(string_findregexp: #template, -find='(?si)#items#(.*?)#/items#'),\n\t\t\t'itemlinkstart'=string,\n\t\t\t'itemlinkend'=string,\n\t\t\t'itemlabel'=string;\n\t\t#itemtemplate = (#itemtemplate -> size >= 2 ? #itemtemplate -> (get: 2) | string);\n\t\t\n\t\tif: (local_defined: 'renderpath') && #renderpath != '' && #renderpath != '/';\n\t\t\t// render nav for specified path\n\t\t\t#renderpath -> (removeleading: '/') & (removetrailing: '/');\n\t\t\tif: #topself -> (getnav: #renderpath) -> (find: 'children') -> type == 'nav';\n\t\t\t\treturn: @(#topself -> (getnav: #renderpath) -> (find: 'children') -> (renderhtml: -basepath=#renderpath, \n\t\t\t\t\t-ancestor=#topself, -flat=#_flat, -expand=#_expand));\n\t\t\telse;\n\t\t\t\treturn: string;\n\t\t\t/if;\n\t\t/if;\n\t\titerate: (self -> 'navitems'), (local: 'navitem');\n\t\t\tif: #navitem -> (find: 'hide');\n\t\t\t\t// do not show in navigation\n\t\t\telse;\n\t\t\t\t#itemlinkstart=string;\n\t\t\t\t#itemlabel=string;\n\t\t\t\t#itemlinkend=string;\n\t\t\t\t#itemchildren = string;\n\t\t\t\t#currentmarker=string;\n\n\t\t\t\t#thispath=#basepath + '/' + (#navitem -> (find: 'key'));\n\t\t\t\t#thispath -> (removeleading: '/');\n\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': thispath is ' + #thispath + ', currentpath is ' + (#topself -> 'path'));\n\t\t\t\tif: (#navitem -> (find: 'template')) != '';\n\t\t\t\t\t#itemrow = (#navitem -> (find: 'template'));\n\t\t\t\telse;\n\t\t\t\t\t#itemrow = #itemtemplate;\n\t\t\t\t/if;\n\t\t\t\t#classarray = array;\n\t\t\t\t(#topself -> 'class') != '' ? #classarray -> (insert: (#topself -> 'class'));\n\t\t\t\t(#navitem -> (find: 'class')) != '' ? #classarray -> (insert: (#navitem -> (find: 'class')));\n\t\t\t\tif: #navitem -> (find: 'disabled');\n\t\t\t\t\t#itemlinkstart=' size;\n\t\t\t\t\t\t#itemlinkstart += ' class=\"' + #classarray -> (join: ' ') + '\"';\n\t\t\t\t\t/if;\n\t\t\t\t\t#itemlinkstart += '>';\n\t\t\t\t\t#itemlabel=(#navitem -> (find: 'label'));\n\t\t\t\t\t#itemlinkend='';\n\t\t\t\telse;\n\t\t\t\t\t/* this code is moved into ->url\n\t\t\t\t\tif: (#navitem -> (find: 'params')) -> type == 'array';\n\t\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': checking params for ' + #thispath + ' with ' + (#navitem -> (find: 'params')));\n\t\t\t\t\t\t// TODO: Move this to a new member tag ->linkparams: path|navitem\n\t\t\t\t\t\t#linkparams=array;\n\t\t\t\t\t\titerate: #navitem -> (find: 'params'), (local: 'param');\n\t\t\t\t\t\t\tif: #clientparams >> #param && #clientparams -> (find: #param) -> first -> type == 'pair';\n\t\t\t\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': got pair param');\n\t\t\t\t\t\t\t\t#linkparams -> (insert: #clientparams -> (find: #param) -> first -> name = #clientparams -> (find: #param) -> first -> value);\n\t\t\t\t\t\t\telse: #clientparams >> #param;\n\t\t\t\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': got plain param');\n\t\t\t\t\t\t\t\t#linkparams -> (insert: #clientparams -> (find: #param) -> first);\n\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t/iterate;\n\t\t\t\t\t\t#link = (self -> (url: -path=#thispath, -params=self -> (linkparams: -navitem=#navitem), -topself=#topself));\n\t\t\t\t\telse;*/\n\t\t\t\t\t\t//#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': no params for ' + #thispath);\n\t\t\t\t\t\t#link = (self -> (url: -path=#thispath, -topself=#topself));\n\t\t\t\t\t///if;\n\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t#itemlinkstart = ' (find: 'title')) != '';\n\t\t\t\t\t\t#itemlinkstart += ' title=\"' + (encode_html: (#navitem -> (find: 'title'))) + '\"';\n\t\t\t\t\t/if;\n\t\t\t\t\tif: (((#topself -> 'path') + '/') -> (beginswith: #thispath + '/'));\n\t\t\t\t\t\t#classarray -> (insert: ((#topself -> 'currentclass') != '' ? (#topself -> 'currentclass') | 'crnt') );\n\t\t\t\t\t/if;\n\t\t\t\t\tif: #classarray -> size;\n\t\t\t\t\t\t#itemlinkstart += ' class=\"' + #classarray -> (join: ' ') + '\"';\n\t\t\t\t\t/if;\n\t\t\t\t\t#itemlinkstart += '>';\n\t\t\t\t\t#itemlabel=(#navitem -> (find: 'label'));\n\t\t\t\t\tif: #thispath == (#topself -> 'path');\n\t\t\t\t\t\tif: (self -> 'currentmarker') -> type != 'null';\n\t\t\t\t\t\t\t#currentmarker = (self -> 'currentmarker');\n\t\t\t\t\t\telse: (#topself -> 'currentmarker') -> type != 'null';\n\t\t\t\t\t\t\t#currentmarker = (#topself -> 'currentmarker');\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/if;\n\t\t\t\t\t#itemlinkend = '';\n\t\t\t\t\tif: ( (((#topself -> 'path') + '/') -> (beginswith: #thispath + '/')) || #_expand)\n\t\t\t\t\t\t&& self -> (haschildren: #navitem)\n\t\t\t\t\t\t&& !#_flat;\n\t\t\t\t\t\t// recursively render child items\n\t\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': begin rendering children for ' + #basepath + '/' + (#navitem -> (find: 'key')) );\n\t\t\t\t\t\t// clear debug_trace for child\n\t\t\t\t\t\t(#navitem -> (find: 'children') -> 'debug_trace') = array;\n\t\t\t\t\t\t#itemchildren += (#navitem -> (find: 'children') -> (renderhtml: -basepath=#basepath + '/' + (#navitem -> (find: 'key')), \n\t\t\t\t\t\t\t-ancestor=#topself,\n\t\t\t\t\t\t\t-flat=#_flat,\n\t\t\t\t\t\t\t-expand=#_expand));\n\t\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (merge: (#navitem -> (find: 'children') -> 'debug_trace'));\n\t\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': done rendering children');\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t\tif: #itemrow >> '#link#';\n\t\t\t\t\t#itemrow -> (replace: '#link#', #itemlinkstart) \n\t\t\t\t\t\t& (replace: '#title#', #itemlabel)\t// deprecated, use #label# instead\n\t\t\t\t\t\t& (replace: '#label#', #itemlabel)\t// preferred\n\t\t\t\t\t\t& (replace: '#/link#', #itemlinkend)\n\t\t\t\t\t\t& (replace: '#children#', #itemchildren);\n\t\t\t\telse;\n\t\t\t\t\tif: #itemrow !>> '#current#';\n\t\t\t\t\t\t#itemlabel += '#current#';\n\t\t\t\t\t/if;\n\t\t\t\t\t#itemrow -> (replace: '#item#', #itemlinkstart + #itemlabel + #itemlinkend \n\t\t\t\t\t\t+ #itemchildren);\n\t\t\t\t/if;\n\t\t\t\t#itemrow -> (replace: '#current#', #currentmarker);\n\t\t\t\t#itemoutput += #itemrow;\n\t\t\t/if;\n\t\t/iterate;\n\t\t#output = (string_replaceregexp: #template, -find='(?si)#items#(.*?)#/items#', -replace=#itemoutput);\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': render done in ' (self -> 'tagtime') + ' ms');\n\t\treturn: @#output;\n\n\t/define_tag;\n\n\tdefine_tag: 'renderbreadcrumb', -description='Shows the current navigation as breadcrumb trail. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-delimiter (optional) Specifies the delimiter to use between nav levels, defaults to \" > \" if not specified\\n\\\n\t\t\t-home (optional flag) Show the default navigation item (i.e. \"home\") first in the breadcrumb (unless already there).',\n\t\t-optional='delimiter',\n\t\t-optional='home',\n\t\t-optional='skipcurrent',\n\t\t-optional='plain';\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\tlocal: 'output'=array, 'path'=array;\n\t\t!(local_defined: 'delimiter') ? local: 'delimiter'=' > ';\n\t\tif: (local_defined: 'home') && #home != false;\n\t\t\t// show the default navigation item first in breadcrumb\n\t\t\t\n\t\t\t// find default path\n\t\t\tif: self -> 'default' != '' && self -> pathmap >> self -> 'default';\n\t\t\t\tlocal: 'homepath'= (self -> 'default');\n\t\t\telse;\n\t\t\t\t// use first top level nav item as default\n\t\t\t\tlocal: 'homepath'= self -> 'navitems' -> first -> (find: 'key');\n\t\t\t/if;\n\t\t\t\n\t\t\tif: !((self -> 'path') -> (beginswith: #homepath));\n\t\t\t\tif: (local_defined: 'plain') && #plain != false;\n\t\t\t\t\t#output -> (insert: (self -> (getnav: #homepath)) -> (find: 'label'));\n\t\t\t\telse;\n\t\t\t\t\t#output -> (insert: ' (url: -path=#homepath)) + '\">' + (self -> (getnav: #homepath)) -> (find: 'label') + '');\t\t\t\t\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t/if;\n\t\titerate: (self -> 'patharray'), (local: 'pathitem');\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': pathitem ' #pathitem);\n\t\t\t#path -> (insert: #pathitem);\n\t\t\tif: (self -> (getnav: #path)) -> (find: 'hide');\n\t\t\t\t// do not show in navigation\n\t\t\t\tloop_abort;\n\t\t\telse;\n\t\t\t\tif: (local_defined: 'plain') && #plain != false;\n\t\t\t\t\t#output -> (insert: (self -> (getnav: #path)) -> (find: 'label'));\n\t\t\t\telse;\n\t\t\t\t\t#output -> (insert: ' (url: -path=#path)) + '\">' + (self -> (getnav: #path)) -> (find: 'label') + '');\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t/iterate;\n\t\tif: (local_defined: 'skipcurrent') && #skipcurrent != false;\n\t\t\t#output -> removelast;\n\t\t/if;\n\t\t#output = #output -> (join: #delimiter);\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @#output;\n\t/define_tag;\n\n\tdefine_tag: 'getnav', -description='Return reference to the current navigation object map, or for the specified path.',\n\t\t-optional='path', -copy; \n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\t!(local_defined: 'path') ? local: 'path'=(self -> 'patharray');\n\t\tif: #path -> type != 'array';\n\t\t\t#path = string: #path;\n\t\t\t#path -> (removeleading: '/') & (removetrailing: '/');\n\t\t\t#path = #path -> (split: '/');\n\t\t/if;\n\t\t(self -> pathmap) !>> (#path -> (join: '/')) ? return: map;\n\n\t\tlocal: 'nav'=@self,\n\t\t\t'navmap'=map;\n\t\tlocal: 'pathitem' = #path -> (get: 1);\n\t\tif: #nav -> keymap >> #pathitem; \n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': found ' + #pathitem + ' in nav');\n\t\t\t#navmap = @((#nav -> 'navitems') -> (get: ((#nav -> keymap) -> (find: #pathitem))));\n\t\t\tif: #navmap -> type == 'map' && !(#navmap -> (find: 'disabled')) && #navmap -> (find: 'children') -> type == 'nav' && #path -> size > 1;\n\t\t\t\t// look into children level recursively - remove the path level we are at now\n\t\t\t\t#path -> (remove: 1);\n\t\t\t\treturn: @(#navmap -> (find: 'children')) -> (getnav: #path); // recursion\n\t\t\telse;\n\t\t\t\t// we are at the bottom, bail out\n\t\t\t\tself -> 'tagtime_tagname'=tag_name;\n\t\t\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t\t\treturn: @#navmap;\n\t\t\t/if;\n\t\t/if;\n\t/define_tag;\n\n\n\t\n\tdefine_tag: 'getargs', -description='Path arguments = the leftover when we found a matching path, to be used for keyvalue for example.\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-index (optional integer) Specifies which leftover path item to return, defaults to all path items as a string',\n\t\t-optional='index', -type='integer';\n\t\tlocal: 'dotrace'=(self -> 'dotrace');\n\t\t\n\t\tlocal: 'args'=(self -> 'pathargs');\n\t\t#args == '' ? return;\n\t\tif: local_defined: 'index';\n\t\t\t#args = #args -> (split: '/');\n\t\t\tif: #args -> size >= #index;\n\t\t\t\treturn: #args -> (get: #index);\n\t\t\telse;\n\t\t\t\treturn;\n\t\t\t/if;\n\t\telse;\n\t\t\treturn: #args;\n\t\t/if;\n\t\t\n\t/define_tag;\n\t\n\tdefine_tag: 'label', -description='Returns the name of the current (or specified) nav location\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-path (optional)',\n\t\t-optional='path', -copy;\n\t\tlocal: 'dotrace'=(self -> 'dotrace');\n\t\t!(local_defined: 'path') ? local: 'path'=@(self -> 'path');\n\t\treturn: self -> (getnav: #path) -> (find: 'label');\n\t/define_tag;\n\n\tdefine_tag: 'path', -description='Returns url or key path for the current or specified location.',\n\t\t-optional='path', -copy;\t\n\t\tlocal: 'dotrace'=(self -> 'dotrace');\n\t\t!(local_defined: 'path') ? local: 'path'=@(self -> 'path');\n\t\tif: self -> (getnav: #path) -> (find: 'url') != '';\n\t\t\tlocal: 'url'=self -> (getnav: #path) -> (find: 'url');\n\t\t\t#url -> (removeleading: '/') & (removetrailing: '/');\n\t\t\treturn: #url;\n\t\telse: #path -> type == 'array';\n\t\t\treturn: @(#path -> (join: '/'));\n\t\telse;\n\t\t\treturn: @#path;\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'patharray', -description='Returns current path as array.';\n\t\t\treturn: (self -> 'patharray');\n\t/define_tag;\n\n\tdefine_tag: 'actionpath', -description='Returns action path if any.';\n\t\t\treturn: (self -> 'actionpath');\n\t/define_tag;\n\n\tdefine_tag: 'linkparams', -description='Returns an array for all parameters that should be sent along with nav links',\n\t\t-required='navitem', -type='map';\n\t\tif: (#navitem -> (find: 'params')) -> type == 'array';\n\t\t\tlocal: 'linkparams'=array,\n\t\t\t\t'dotrace'=(self -> 'dotrace'),\n\t\t\t\t'clientparams'=client_getparams;\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': checking params ' + (#navitem -> (find: 'params')));\n\t\t\t#clientparams -> (merge: client_postparams);\n\t\t\titerate: #navitem -> (find: 'params'), (local: 'param');\n\t\t\t\t\titerate(#clientparams -> find(#param), local('paraminstance'));\n\t\t\t\t\tif: #paraminstance -> type == 'pair';\n\t\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': got pair param');\n\t\t\t\t\t\t#linkparams -> (insert: (#paraminstance -> name) = (#paraminstance -> value));\n\t\t\t\t\telse;\n\t\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': got plain param');\n\t\t\t\t\t\t#linkparams -> (insert: #paraminstance);\n\t\t\t\t\t/if;\n\t\t\t\t/iterate;\n\t\t\t/iterate;\n\t\t\treturn: @#linkparams;\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'data', -description='Returns data object that can be stored for the current nav location (or specified nav location).\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-path (optional)\\n\\\n\t\t\t-type (optional string) Force a certain return type. If the stored object doesn´t match the specified type, an empty instance of the type is returned. That way the data can be filtered by type without having to use conditionals to check the type before. ',\n\t\t-optional='path', -copy,\n\t\t-optional='type';\n\t\tlocal: 'dotrace'=(self -> 'dotrace');\n\t\t!(local_defined: 'path') ? local: 'path'=@(self -> 'path');\n\t\tif: (local_defined: 'type');\n\t\t\tif: self -> (getnav: #path) -> (find: 'data') -> type == #type;\n\t\t\t\treturn: self -> (getnav: #path) -> (find: 'data');\n\t\t\telse;\n\t\t\t\t// return empty instance of the specified type\n\t\t\t\treturn: (\\#type)->astype;\n\t\t\t/if;\n\t\telse;\n\t\t\treturn: self -> (getnav: #path) -> (find: 'data');\n\t\t/if;\n\t/define_tag;\n\n\t\n\tdefine_tag: 'url', -description='Returns full url for current path or specified path. Path parameters can be provided and overridden by \\\n\t\t\tpassing them to this tag. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-path (optional) \\n\\\n\t\t\t-params (optional) Pair array to be used in url instead of plain parameters sent to this tag\\n\\\n\t\t\t-urlargs (optional) Raw string with url parameters to append at end of url and -params\\n\\\n\t\t\t-getargs (optional flag) Add the getargs (leftover path parts) to the url\\n\\\n\t\t\t-except (optional) Array of parameter names to exclude (or single parameter name as string)\\n\\\n\t\t\t-topself (optional nav) Internal, needed to call url from renderhtml when rendering sublevels\\n\\\n\t\t\t-autoparams (optional flag) Enables the automatic passing of action_params that begin with \"-\"',\n\t\t-optional='path', -copy,\n\t\t-optional='params', -copy,\n\t\t-optional='urlargs',\n\t\t-optional='except', -copy,\n\t\t-optional='topself', -type='nav',\n\t\t-optional='autoparams';\n\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\tlocal: 'url'=string,\n\t\t\t'urlparams'=array;\n\t\t// only getparams to not send along -action etc\n\t\tlocal: 'clientparams'=client_getparams, 'param'=null;\n\n\t\t!(local_defined: 'except') ? local: 'except'=array;\n\t\t#except -> type != 'array' ? #except = array: #except;\n\t\t#except -> insert('-session');\n\t\t!(local_defined: 'topself') ? local: 'topself'=@self;\n\t\t!(local_defined: 'params') ? local: 'params'=(params -> isa('array') ? params | array);\n\t\t!#params -> isa('array') ? #params = array(#params); // added by Jolle 101117\n\t\tif: local_defined: 'path';\n\t\t\tif: #params >> '-path';\n\t\t\t\t// -path was passed as explicit param\n\t\t\t\t#params -> (removeall: '-path');\n\t\t\telse: #params >> #path;\n\t\t\t\t// -path was passed as implicit param - shows up in params as plain value (no pair) so remove the value from params\n\t\t\t\t#params -> (removeall: #path);\n\t\t\t/if;\n\t\telse;\n\t\t\tlocal: 'path'=(#topself -> 'path');\n\t\t/if;\n\t\tlocal: 'navitem'=#topself -> getnav: #path;\n\t\tif: (#navitem -> (find: 'params')) -> type == 'array';\n\t\t\t// add parameters defined as -param for nav item\n\t\t\t#params -> (merge: (#topself -> (linkparams: -navitem=#navitem)));\n\t\t/if;\n\t\tif: #params -> isa('array');\n\t\t\t// clean up other parameters passed to he tag\n\t\t\t#params -> (removeall: '-urlargs')\n\t\t\t\t& (removeall: '-topself')\n\t\t\t\t& (removeall: '-params')\n\t\t\t\t& (removeall: '-except')\n\t\t\t\t& (removeall: '-autoparams')\n\t\t\t\t& (removeall: '-getargs');\n\t\t /if;\n\n\t\titerate: #except, (local: 'param');\n\t\t\t#params -> (removeall: #param);\n\t\t/iterate;\n\n\t\t#url = (#topself -> (path: #path)) + ((#topself -> (path: #path)) != '' ? '/');\n\t\tif: (#topself -> getargs) -> size && (local_defined: 'getargs') && #getargs != false;\n\t\t\t// for links to the current path, add the path args \n\t\t\t#url += (#topself -> getargs) + '/';\n\t\t/if;\n\t\tif: #params >> '-keyvalue';\n\t\t\t#url += (#params -> (find: '-keyvalue') -> first -> value) + '/';\n\t\t\t#params -> (removeall: '-keyvalue');\n\t\t/if;\n\t\t\n\t\titerate: (#params -> type == 'array' ? #params | array: #params), (local: 'param');\n\t\t\tif: #param -> type == 'pair';\n\t\t\t\t#urlparams -> (insert: (encode_stricturl: #param -> name) + '=' + (encode_stricturl: #param -> value));\n\t\t\telse: #param != '';\n\t\t\t\t#urlparams -> (insert: (encode_stricturl: #param));\n\t\t\t/if;\n\t\t/iterate;\n\t\tif: (local_defined: 'autoparams') && #autoparams != false;\n\t\t\t// add getparams that begin with -\n\t\t\titerate: #clientparams, #param;\n\t\t\t\tif: #param -> type == 'pair';\n\t\t\t\t\tif: #param -> name -> (beginswith: '-') && #except !>> #param -> name;\n\t\t\t\t\t\t#urlparams -> (insert: (encode_stricturl: #param -> name) + '=' + (encode_stricturl: #param -> value));\n\t\t\t\t\t/if;\n\t\t\t\telse; // just a string param (no pair)\n\t\t\t\t\tif: #param -> (beginswith: '-') && #except !>> #param;\n\t\t\t\t\t\t#urlparams -> (insert: encode_stricturl: #param);\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t/if;\n\t\t\n\t\tif: (#topself -> 'navmethod') == 'param';\n\t\t\t#url = './?' + #url + (#urlparams -> size || (local: 'urlargs') != '' ? '&');\n\t\telse; // path\n\t\t\t#url = (#topself -> 'root') + #url + (#urlparams -> size || (local: 'urlargs') != '' ? '?');\n\t\t/if;\n\n\t\t#urlparams = string: (#urlparams -> (join: '&'));\n\t\t// restore / in paths for looks\n\t\t#urlparams -> replace('%2f', '/');\n\t\t#url += #urlparams;\n\t\t#urlparams -> size && (local: 'urlargs') -> size ? #url += '&';\n\t\t(local: 'urlargs') -> size ? #url += #urlargs;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @#url;\n\t/define_tag;\n\t\n\tdefine_tag: 'filename', -description='Returns the full path to the specified type of precissing file for the current navigation. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-type (required) lib, act, cnt, cfg, actcfg',\n\t\t-required='type',\n\t\t-optional='path', -copy;\n\t\t/*\n\t\t\n\t\t-filenaming can be one of prefix, suffix or extension. \n\t\tPrefix is \"the old way\". lib_customer.inc. This is the default if -filenaming is not specified. \n\t\tSuffix is a hybrid, for example customer_lib.inc. \n\t\tExtension is for example customer.lib\n\t\t\n\t\tThe rest is automatic. \n\t\t\n\t\t\n\t\tPossible places to look for a library file that belongs to the path \"customer/edit\" (in order of precedence):\n\t\tA) -filenaming='prefix' (default)\n\t\t1. _mod_customer/lib_customer_edit.inc \t\t// modular prefixed with module name\n\t\t2. _mod_customer/lib_edit.inc\t\t\t\t// modular\n\t\t3. _mod_customer/_library/lib_customer_edit.inc\t// modular separated, prefixed with module name\n\t\t4. _mod_customer/_library/lib_edit.inc\t\t// modular separated\n\t\t5. _library/lib_customer_edit.inc\t\t\t// collective (\"all modules together\") separated. This is the old way. \n\t\t\n\t\tB) -filenaming='suffix'\n\t\t1. _mod_customer/customer_edit_lib.inc\n\t\t2. _mod_customer/edit_lib.inc\n\t\t3. _mod_customer/_library/customer_edit_lib.inc\n\t\t4. _mod_customer/_library/edit_lib.inc\n\t\t5. _library/customer_edit_lib.inc\n\t\t\n\t\tC) -filenaming='extension'\n\t\t1. _mod_customer/customer_edit.lib\n\t\t2. _mod_customer/edit.lib\n\t\t3. _mod_customer/_library/customer_edit.lib\n\t\t4. _mod_customer/_library/edit.lib\n\t\t5. _library/customer_edit.lib\n\t\t\n\t\tThe principle is to start looking at the most specific location and then look at more and more generic locations, to be able to do the local override. \n\n\t\t*/\n\t\t\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\tlocal: 'filenamearray'=array, \n\t\t\t'filenamearray_temp'=array,\n\t\t\t'filename'=string,\n\t\t\t'prefix'=string,\n\t\t\t'type_short'=string,\n\t\t\t'suffix'=string,\n\t\t\t'extension'=string,\n\t\t\t'typefoldermap'=(map: \n\t\t\t\t'cfg'='_config/', \n\t\t\t\t'actcfg'='_config/', \n\t\t\t\t'act'='_action/',\n\t\t\t\t'lib'='_library/',\n\t\t\t\t'cnt'='_content/'),\n\t\t\t'typefolder'=string,\n\t\t\t'basefolder'=string,\n\t\t\t'directorytree' = (self -> directorytree);\n\t\tif: #type == 'act' || #type == 'actcfg';\n\t\t\tlocal('path') -> size == 0 ? local('actionpath'=string(self -> 'actionpath')) | local('actionpath'=string(#path));\n\t\t\t#actionpath -> removeleading('/') & removetrailing('/');\n\t\t\t#actionpath == '' ? return;\n\t\t\t#filenamearray = (self -> getnav(#actionpath) -> find('filename'));\n\t\t\tif: #filenamearray == '';\n\t\t\t\t#filenamearray=#actionpath;\n\t\t\t/if;\n\t\t\t#filenamearray = #filenamearray -> split('/');\n\t\telse;\n\t\t\tlocal('path') -> size == 0 ? local('path'=string(self -> 'path'));\n\t\t\t#path -> removeleading('/') & removetrailing('/');\n\t\t\tself -> getnav(#path) -> size == 0 ? return;\n\t\t\t#filenamearray=(self -> getnav(#path) -> find('filename'));\n\t\t\tif: #filenamearray == '';\n\t\t\t\t#filenamearray=#path;\n\t\t\t/if;\n\t\t\t#filenamearray = #filenamearray -> split('/');\n\t\t/if;\n\t\t#type =='actcfg' ? #prefix = 'cfg' | #prefix = #type;\n\t\t#type_short = #prefix;\n\t\t#typefolder=#typefoldermap -> (find: #type);\n\n\t\tselect: (self -> 'filenaming');\n\t\tcase: 'suffix';\n\t\t\t#suffix='_' + #prefix;\n\t\t\t#extension='.inc';\n\t\t\t#prefix = '';\n\t\tcase: 'extension';\n\t\t\t#extension='.' + #prefix;\n\t\t\t#suffix='';\n\t\t\t#prefix = '';\n\t\tcase; // prefix as default\n\t\t\t#prefix += '_';\n\t\t\t#extension='.inc';\n\t\t\t#suffix='';\n\t\t/select;\n\n\t\tlocal: 'findtimer'=_date_msec;\n\t\tloop: 2;\n\t\t\t#basefolder=(array: '', '_knop/') -> (get: loop_count);\n\t\t\tloop: 5;\n\t\t\t\t#filename = string;\n\t\t\t\tselect: loop_count;\n\t\t\t\tcase: 1;\n\t\t\t\t\t// customer/lib_customer_edit.inc\n\t\t\t\t\tif: #filenamearray -> size >= 1;\n\t\t\t\t\t\t// at least 1 level, look in module folder\n\t\t\t\t\t\t#filenamearray_temp = #filenamearray;\n\t\t\t\t\t\t#filename = #basefolder + '_mod_' + #filenamearray_temp -> first;\n\t\t\t\t\t\t#filename += '/' + #prefix + (#filenamearray_temp -> (join: '_')) + #suffix + #extension;\n\t\t\t\t\t/if;\n\t\t\t\tcase: 2; \n\t\t\t\t\t// customer/lib_edit.inc\n\t\t\t\t\tif: #filenamearray -> size >= ((self -> 'filenaming') == 'extension' ? 2 | 1);\n\t\t\t\t\t\t// at least 1 level (2 levels for suffix naming), look in module folder\n\t\t\t\t\t\t#filenamearray_temp = #filenamearray;\n\t\t\t\t\t\t#filename = #basefolder + '_mod_' + #filenamearray_temp -> first;\n\t\t\t\t\t\t#filenamearray_temp -> removefirst;\n\t\t\t\t\t\t#filename += '/' + #prefix + (#filenamearray_temp -> (join: '_')) + #suffix + #extension;\n\t\t\t\t\t\tif(#filenamearray -> size == 1);\n\t\t\t\t\t\t\t// clean up underscore so filename ends up as lib.inc instead of lib_.inc etc\n\t\t\t\t\t\t\t#filename -> replace('/' + #type_short + '_' + #extension, '/' + #type_short + #extension);\n\t\t\t\t\t\t\t#filename -> replace('/_' + #type_short + #extension, '/' + #type_short + #extension);\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/if;\n\t\t\t\tcase: 3;\n\t\t\t\t\t// customer/_library/lib_customer_edit.inc\n\t\t\t\t\tif: #filenamearray -> size >= 2;\n\t\t\t\t\t\t// at least 2 levels, look in module folder\n\t\t\t\t\t\t#filenamearray_temp = #filenamearray;\n\t\t\t\t\t\t#filename = #basefolder + '_mod_' + #filenamearray_temp -> first;\n\t\t\t\t\t\t#filename += '/' + #typefolder + #prefix + (#filenamearray_temp -> (join: '_')) + #suffix + #extension;\n\t\t\t\t\t/if;\n\t\t\t\tcase: 4;\n\t\t\t\t\t// customer/_library/lib_edit.inc\n\t\t\t\t\tif: #filenamearray -> size >= 2;\n\t\t\t\t\t\t// at least 2 levels, look in module folder\n\t\t\t\t\t\t#filenamearray_temp = #filenamearray;\n\t\t\t\t\t\t#filename = #basefolder + '_mod_' + #filenamearray_temp -> first;\n\t\t\t\t\t\t#filenamearray_temp -> removefirst;\n\t\t\t\t\t\t#filename += '/' + #typefolder + #prefix + (#filenamearray_temp -> (join: '_')) + #suffix + #extension;\n\t\t\t\t\t/if;\n\t\t\t\tcase;\n\t\t\t\t\t// _library/lib_customer_edit.inc\n\t\t\t\t\t#filename = #basefolder + #typefolder + #prefix + (#filenamearray -> (join: '_')) \n\t\t\t\t\t\t+ #suffix + #extension;\n\t\t\t\t/select;\n\t\t\t\tif: #filename != '';\n\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': trying ' + (self -> 'fileroot') + #filename );\n\t\t\t\t\tif: #directorytree >> #filename;\n\t\t\t\t\t\t//file_exists: (self -> 'fileroot') + #filename;\n\t\t\t\t\t\t// clean up and exit\n\t\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': ** Found ' + (self -> 'fileroot') + #filename + ' in ' + (_date_msec - #findtimer) ' ms');\n\t\t\t\t\t\tself -> 'tagtime_tagname'=tag_name;\n\t\t\t\t\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t\t\t\t\treturn: (self -> 'fileroot') + #filename;\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t/loop;\n\t\t/loop;\n\t\t// clean exit if nothing was found\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn;\n\n\t/define_tag;\n\t\n\tdefine_tag: 'actionconfigfile', -description='Shortcut to filename: actcfg'; return: self -> (filename: 'actcfg'); \t/define_tag;\n\tdefine_tag: 'actionfile', -description='Shortcut to filename: act'; \t\treturn: self -> (filename: 'act'); \t\t/define_tag;\n\tdefine_tag: 'configfile', -description='Shortcut to filename: cfg'; \t\treturn: self -> (filename: 'cfg'); \t\t/define_tag;\n\tdefine_tag: 'libraryfile', -description='Shortcut to filename: lib'; \t\treturn: self -> (filename: 'lib'); \t\t/define_tag;\n\tdefine_tag: 'contentfile', -description='Shortcut to filename: cnt'; \t\treturn: self -> (filename: 'cnt'); \t\t/define_tag;\n\n\tdefine_tag: 'include', -description='Includes any of the files for the current path, fails silently if file does not exist. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-file (required) lib, act, cnt, cfg, actcfg or library, action, config, actionconfig, content, or any arbitrary filename',\n\t\t-required='file',\n\t\t-optional='path';\n\t\tknop_debug(self->type + ' -> ' + tag_name + ' ' + params -> first, -type=self->type, -open);\n\t\thandle;knop_debug('Done with ' + self->type + ' -> ' + tag_name + ' ' + params -> first, -close, -time, -witherrors);/handle;\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\t// includes any of the files for the current path, fails silently if file does not exist\n\t\tlocal: 'translation'=(map:\n\t\t\t\t'actionconfig'= 'actcfg',\n\t\t\t\t'action'= 'act',\n\t\t\t\t'config'= 'cfg',\n\t\t\t\t'library'= 'lib',\n\t\t\t\t'content'= 'cnt'),\n\t\t\t'types'=(map: 'actcfg', 'act', 'cfg', 'lib', 'cnt'),\n\t\t\t'result'=string;\n\t\tlocal: 'type'= (#translation >> #file ? #translation -> (find: #file) | #types >> #file ? #file | 'other');\n\t\t// find out full filename\n\t\t!local_defined('path') ? local('path'=null);\n\t\tlocal: 'filename'=null;\n\t\tif: #types >> #type;\n\t\t\t// knop include\n\t\t\t#filename = self -> filename(#type, -path=#path);\n\t\telse: (self -> directorytree) >> #file;\n\t\t\t// arbitrary include within the Knop folder structure\n\t\t\t#filename = (self -> 'fileroot') + #file;\n\t\telse: (self -> directorytree) >> '_knop/' + #file;\n\t\t\t// arbitrary include one level down in _knop folder\n\t\t\t#filename = (self -> 'fileroot') + '_knop/' + #file;\n\t\t/if;\n\t\tif: #type == 'cfg' && #filename -> size && (self -> 'actionconfigfile_didrun') == #filename;\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': ' + #filename ' has already run as actionconfig');\n\t\t\t//knop_debug(self->type + ' -> ' + tag_name + ': ' + #filename ' has already run as actionconfig');\n\t\t\treturn;\n\t\telse: #type == 'actcfg';\n\t\t\t// remember that we have run this config file as actionconfig so we don't run the same file again as page config\n\t\t\t(self -> 'actionconfigfile_didrun') = #filename;\n\t\t/if;\n\t\tif: #filename != '';\n\t\t\tlocal: 't'=_date_msec;\n\t\t\t#result=@(include: #filename);\n\t\t\t(self -> 'debug_trace') -> (insert: 'Include ' + #file + ': ' + #filename + ' processed in ' + (_date_msec - #t) ' ms');\n\t\t\t//knop_debug(self->type + ' -> ' + tag_name + ' ' + #file + ': ' + #filename + ' processed in ' + (_date_msec - #t) ' ms', -type=self->type);\n\t\t\tself -> 'tagtime_tagname'=tag_name;\n\t\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t\treturn: @#result;\n\t\telse;\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: 'Include ' + #file + ': no matching filename found');\n\t\t\tknop_debug(self->type + ' -> ' + tag_name + ' ' + #file + ': no matching filename found');\n\t\t/if;\n\t/define_tag;\n\t\n\tdefine_tag: 'library', -description='includes file just as ->include, but returns no output', \n\t\t-required='file',\n\t\t-optional='path';\n\t\t// includes file just as ->include, but returns no output\n\t\t!local_defined('path') ? local('path'=null);\n\t\tself -> include(#file, -path=#path);\n\t\t// returns nothing\n\t/define_tag;\n\n\tdefine_tag: 'directorytree', -description='Returns a map of all existing knop file paths', \n\t\t-optional='basepath'; // only used for recursive calls\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\tlocal: 'dirlist'=map;\n\t\tif: (self -> 'directorytreemap') -> size;\n\t\t\t// use the stored directory tree that has already been created\n\t\t\t#dirlist = (self -> 'directorytreemap');\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': Returning stored directorytree');\n\n\t\telse;\n\t\t\t// first time calling this tag - create the directory tree\n\t\t\tif: (local_defined: 'basepath');\n\t\t\t\tlocal: 'path' = #basepath;\n\t\t\telse;\n\t\t\t\tlocal: 'path'=(self -> 'fileroot');\n\t\t\t/if;\n\t\t\t!(#path -> (endswith: '/')) ? #path += '/';\n\t\t\tlocal: 'diritem'=string,\n\t\t\t\t'dirlist_sub'=map,\n\t\t\t\t'diritem_sub'=pair;\n\t\t\titerate: file_listdirectory: #path, #diritem;\n\t\t\t\tif: !(#diritem -> (beginswith: '.'));\n\t\t\t\t\t#dirlist_sub = map;\n\t\t\t\t\t#diritem -> (removetrailing: '/');\n\t\t\t\t\tif: //#diritem -> (endswith: '/') && \n\t\t\t\t\t\t((map: '_knop', '_include', '_config', '_action', '_library', '_content') >> #diritem\n\t\t\t\t\t\t\t|| #diritem -> (beginswith: '_mod_'));\n\t\t\t\t\t\t// recursive call for sub folder within the Knop directory structure\n\t\t\t\t\t\t#dirlist_sub = self -> (directorytree: #path + #diritem);\n\t\t\t\t\t\titerate: #dirlist_sub, #diritem_sub;\n\t\t\t\t\t\t\t#dirlist -> (insert: #diritem + '/' + #diritem_sub -> name);\n\t\t\t\t\t\t/iterate;\n\t\t\t\t\t/if;\n\t\t\t\t\t// Add item to map, with trailing / if item has sub items (folder contents)\n\t\t\t\t\t#dirlist -> (insert: #diritem + (#dirlist_sub -> size ? '/'));\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t\tif: !(local_defined: 'basepath');\n\t\t\t\t// this was the topmost call in the recursive chain, so store the result\n\t\t\t\t(self -> 'directorytreemap') = #dirlist;\n\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': Creating directorytree');\n\t\t\t/if;\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: #dirlist;\n\t/define_tag;\n\n\n\tdefine_tag: 'trace', \n\t\t-optional='html',\n\t\t-optional='xhtml';\n\t\tlocal: 'dotrace'=(self -> 'dotrace');\n\n\t\tlocal: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');\n\n\t\tlocal: 'eol'=(local_defined: 'html') || #endslash -> size ? '\\n' | '\\n';\n\n\t\treturn: #eol + 'Debug trace for nav $' + (self -> varname)\n\t\t\t+ (!#dotrace ? ' (detailed trace not enabled)' )\n\t\t\t+ #eol + (self -> 'debug_trace') -> (join: #eol) \n\t\t\t+ #eol;\n\n\t/define_tag;\n\n/define_type;\n\n\n?>\n[\n//------------------------------------------------------------------\n// End knop_nav\n//------------------------------------------------------------------\n\n//##################################################################\n\n][\n//------------------------------------------------------------------\n// Begin knop_user\n//------------------------------------------------------------------\n\n]removedata to remove field from the data map. Thanks to Ric Lewis.\n2009-09-18\tJS\tSyntax adjustments for Lasso 9\n2009-06-23\tJS\t->encrypt now uses default encrypt_cipher from the custom type instead of a hard coded default\n2009-02-26\tJS\t->login: further correction on the search for login with FileMaker, to reduce the risk for false duplicates\n2009-02-26\tJS\t->login: Added optional -searchparams to be able to add more conditions to the login search, for example to exclude users that are not enabled. \n2008-12-02\tJS\t->encrypt: Changed to -hex cipher instead of encode_base64\n2008-11-05\tJS\t->getdata: corrected a check that prevented the tag from returning anything\n2008-11-05\tJC\t->login: A failed login attempt now results in a logout instead of keeping any old authentication\n2008-11-05\tJC\t->getpermission will always return falseif a user is not logged in\n2008-11-05\tJC\t->logout: The permissions map is now cleared when logging out\n2008-11-04\tJC\t->encrypt: changed incorrect encrypt_cipher to encrypt_digest\n2008-09-10\tJS\tAdded ondeserialize to make client_fingerprint_expression survive session\n2008-07-17\tJS\tImplemented ->setpermission and ->getpermission\n2008-07-17\tJS\tAdded client_fingerprint_expression as compound expression so it can be configurable by changing the instant variable\n2008-05-20\tJS\t->login: Added delay between more than 5 failed login attempts \n2008-05-08\tJS\t->login: improved the search for FileMaker datasources to make it work for email address as username\n2008-02-08\tJS\tAdded ->keys\n2008-02-03\tJS\t-> login: Corrected storage of id_user\n2007-11-27\tJS\tCoded an incomplete version\n2007-06-13\tJS\tCreated the data type\n\n// TODO: \nMake it possible for knop_user to work independently of a knop_database object by creating a custom user lookup - see http://listsearch.com/Lasso/Thread/index.lasso?20528\nuserdb reference is brooken, probably when stored in session. Can this be fixed?\nMake client_fingerprint configurable by specifying a compound expression at oncreate\nAdd support for role based permisions\n\n*/\n\n\n/*\nPurpose:\n- Maintain user identity and authentication\n- Handle database record locking more intelligently, also to be able to release all unused locks for a user\n- Authenticating user login\n- Restricting access to data\n- displaying specific navigation options depending on type of user\n\nlets add some date handling in there too like time of last login\nand probably the IP that the user logged in from.\n\n\nSome options to handle what happens when a user logs in again whilst already logged in.\nie one could:\ndisallow second login (with a message explaining why)\nautomatically log the first session out (with a message indicating what happened)\nsend a message to first session: \"Your username is attempting to log in again, do you wish to close this session, or deny the second login attempt?\"\nallow multiple logins (from the same IP address)\nallow multiple logins from any IP address\n\nAll of these could be useful options, depending of the type of app.\n\nAnd different types of user (ie normal, admin) could have different types of treatment.\n\nHandling for failed login attempts:\nOption to set how many tries can be attempted; \nOption to lock users out permanently after x failed attempts? \nLogging (to database) of failed logins / successful logins\n\nPassword recovery system (ie emailing a time sensitive link to re-set password)\nBy \"password recovery\" I'm not thinking \"email my password\" (hashed passwords can't be emailed...) but rather to email a short lived link that gives the user an opportunity to change his password. How is this different from \"password reset\"?\nYes, that is an accurate description of what I had in mind, except for the bit about emailing a short-lived link. Instead I imagined having the user reset their password 100% on the web site through the use of \"Security Questions\", much like banks employ.\n\nI like the idea of more info attached to the user. Like login attempts, locking a user temporarily after too many failed attempts etc.\n\n\nThe setup is more or less that I have users and groups.\n\nI'm thinking that Knop shouldn't do any session handling by itself, but the knop_user variable would be stored in the app's session as any other variable. Knop should stay as lean as possible...\n\nOther things to handle:\nPrevent session sidejacking by storing and comparing the user's ip and other identifying properties.\nProvide safe password handling with strong one-way salted encryption.\n\nconsider having a separate table for auditing all user actions, including logging in, logging out, the basic CRUD actions, searches\n\nThe object have to handle situations where no user is logged in. A guest can still have rights to some actions. Modules that can be viewed. Forms that could be sent in etc.\nThat the added functions don't slow down the processing. We already have a lot of time consuming overhead in Knop.\n\n\n\nFeatures:\n1. Authentication and credentials\n- Handle the authentication process\n- Keep track of if a user is properly logged in\n- Optionally keep track of multiple logins to same account\n- Prevent sidejacking\n- Optionally handle encrypted/hashed passwords (with salt)\n- Prevent brute force attacks (delay between attempts etc)\n- Handle general information about the user\n- Provide accessors for user data\n\n2. Permissions and access control\n- Keep track of what actions a user is allowed to perform (the \"verbs\")\n- Tie into knop_nav to be able to filter out locations based on permissions\n\n3. Record locks\n- Handle clearing of record locks from knop_database\n\n4. Audit trail/logging\n- Optionally log login/logout actions\n- Provide hooks to be able to log other user actions\n\nFuture additions:\n- Keep track of what objects and resources a user is allowed to act on (the \"nouns\")\n- Provide filtering to use in database queries\n- What groups a user belongs to\n- Mechanism to update user information, password etc\n- Handle password recovery\n\n\nPermissions can be read, create, update, delete, or application specific (for example publish)\n\n*/\n\n\tlocal: 'id_user'=null,\n\t\t'validlogin'=false,\n\t\t'groups'=array,\n\t\t'data'=map,\t\t\t\t\t\t// map with arbitrary user information (name, address etc)\n\t\t'permissions'=map,\n\t\t'loginattempt_date'=(date: 0),\t// to keep track of delays multiple login attempts\n\t\t'loginattempt_count'=integer,\t// number of failed login attempts\n\n\t\t'userdb'=null,\t\t\t\t\t// database object for user authentication\n\t\t'useridfield'='id',\t\n\t\t'userfield'='username',\t\n\t\t'passwordfield'='password',\n\t\t'saltfield'=null,\n\t\t'encrypt'=false,\n\t\t'encrypt_cipher'='RIPEMD160',\t// digest encryption method\n\n\t\t'logdb'=null,\t\t\t\t\t// database object for logging\n\t\t'logeventfield'='event',\t\t// the event to be logged\n\t\t'loguserfield'='id_user',\t\t// the user who is performing the logged action\n\t\t'logobjectfield'='id_object',\t// what object is affected by the logged action\n\t\t'logdatafield'='data',\t\t\t// details about the logged action\n\n\t\t'singleuser'=false,\n\t\t'uniqueid'=null,\t\t\t\t// To track multiple logins on the same account (this is to be stored and compared server side)\n\t\t'client_fingerprint'=null,\t\t// combination of ip, useragent etc to be able to track sidejacking\n\t\t'client_fingerprint_expression'={return(encrypt_md5(string(client_ip) + client_type))},\n\t\t'dblocks'=array,\t\t\t\t// a list of all database objects that have been locked by this user \n\t\t'error_lang'=(knop_lang: -default='en', -fallback),\n\t\t;\n\n\tdefine_tag: 'oncreate', -description='Parameters:\\n\\\n\t\t\t-encrypt (optional flag or string) Use encrypted passwords. If a value is specified then that cipher will be used instead of the default RIPEMD160. If -saltfield is specified then the value of that field will be used as salt.\\n\\\n\t\t\t-singleuser (optional flag) Multiple logins to the same account are prevented (not implemented)',\n\t\t-required='userdb', -type='database',\n\t\t-optional='encrypt',\n\t\t-optional='useridfield', -type='string',\n\t\t-optional='userfield', -type='string',\n\t\t-optional='passwordfield', -type='string',\n\t\t-optional='saltfield', -type='string',\n\t\t-optional='logdb', -type='database',\n\t\t-optional='loguserfield', -type='string',\n\t\t-optional='logeventfield', -type='string',\n\t\t-optional='logdatafield', -type='string',\n\t\t-optional='singleuser';\n\t\t\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tlocal_defined('userfield') ? (self -> 'userfield') = #userfield;\n\t\tlocal_defined('useridfield') ? (self -> 'useridfield') = #useridfield;\n\t\tlocal_defined('passwordfield') ? (self -> 'passwordfield') = #passwordfield;\n\t\tlocal_defined('saltfield') ? (self -> 'saltfield') = #saltfield;\n\t\tlocal_defined('loguserfield') ? (self -> 'loguserfield') = #loguserfield;\n\t\tlocal_defined('logeventfield') ? (self -> 'logeventfield') = #logeventfield;\n\t\tlocal_defined('logdatafield') ? (self -> 'logdatafield') = #logdatafield;\n\n\t\t// the following params are stored as reference, so the values of the params can be altered after adding a field simply by changing the referenced variable. \n\t\tlocal_defined('userdb') ? (self -> 'userdb') = @#userdb;\n\t\tlocal_defined('logdb') ? (self -> 'logdb') = @#logdb;\n\n\t\tif: (local_defined: 'encrypt') && #encrypt != false;\n\t\t\t(self -> 'encrypt') = true;\n\t\t\tif: #encrypt -> size && (Cipher_List: -digest) >> #encrypt; // a valid digest cipher was specified\n\t\t\t\t(self -> 'encrypt_cipher') = #encrypt;\n\t\t\t/if;\n\t\telse;\n\t\t\t(self -> 'encrypt') = false;\n\t\t/if;\n\t\t(self -> 'singleuser') = (local_defined: 'singleuser') && #singleuser != false;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\n\tdefine_tag: 'ondeserialize', -description='Recreates transient variables after coming back from a session';\n\t\t// MARK: Why is client_fingerprint_expression considered a transient variable?\n\t\tself -> properties -> first -> insert('client_fingerprint_expression'={return(encrypt_md5(string(client_ip) + client_type))});\n\t/define_tag;\n\n/*\n\tdefine_tag: 'onassign', -description='Internal, needed to restore references when ctype is defined as prototype',\n\t\t-required='value';\n\t\t// recreate references here\n\t\titerate: (array: \n\t\t\t'userdb',\n\t\t\t'logdb'), (local: 'param');\n\t\t\t(self -> #param) = @(#value -> #param);\n\t\t/iterate;\n\t/define_tag;\n// */\t\n\t\n\tdefine_tag: '_unknowntag', -description='Shortcut to getdata';\n\t\tif: (self -> 'data') >> tag_name;\n\t\t\treturn: (self -> 'data') -> (find: tag_name);\n\t\telse;\n\t\t\t//fail: -9948, self -> type + '->' + tag_name + ' not known.';\n\t\t\t(self -> '_debug_trace') -> insert(self -> type + '->' + tag_name + ' not known.');\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'auth', -description='Checks if user is authenticated, returns true/false';\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tlocal: 'validlogin'=false, 'client_fingerprint_now'=string;\n\t\t// check validlogin\n\t\t#validlogin = (self -> 'validlogin');\n\t\tif: #validlogin;\n\t\t\t// check client_fingerprint to prevent sidejacking\n\t\t\t#client_fingerprint_now = (self -> 'client_fingerprint_expression') -> invoke;\n\t\t\tif: #client_fingerprint_now != (self -> 'client_fingerprint');\n\t\t\t\t#validlogin = false;\n\t\t\t\t(self -> '_debug_trace') -> insert(tag_name + ': Client fingerprint has changed - this looks like session sidejacking. Logging out.');\n\t\t\t\t(self -> 'error_code') = 7503;\n\t\t\t\tself -> logout;\n\t\t\t\t// TODO: log this\n\t\t\t/if;\n\t\t\t// TODO: if singleuser, check uniqueid\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: #validlogin;\n\t/define_tag;\n\n\n\tdefine_tag: 'login', -description='Log in user. On successful login, all fields on the user record will be available by -> getdata.\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-username (required) Optional if -force is specified\\n\\\n\t\t\t-password (required) Optional if -force is specified\\n\\\n\t\t\t-searchparams (optional) Extra search params array to use in combination with username and password\\n\\\n\t\t\t-force (optional) Supply a user id for a manually authenticated user if custom authentication logics is needed',\n\t\t-optional='username',\n\t\t-optional='password',\n\t\t-optional='searchparams', -type='array', -copy,\n\t\t-optional='force';\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tif(!local_defined('force') && (!local_defined('username') || !local_defined('password')));\n\t\t\tfail(-9956, self -> type + '->' + tag_name + ' requires -username and -password, or -force');\n\t\t/if;\n\t\t\n\t\tlocal: 'db'=@(self -> 'userdb'),\n\t\t\t'validlogin'=false;\n\t\t\n\n\t\tif(local_defined('force') && string(#force) -> size && #force != false);\n\t\t\t(self -> '_debug_trace') -> insert(tag_name + ': ' + 'Manually authenticating user id ' + #force);\n\t\t\t#validlogin = true;\n\t\t\t(self -> 'id_user') = #force;\n\n\t\telse;\n\t\t\t!local_defined('searchparams') ? local('searchparams'=array);\n\t\t\tif((local('username') -> size && local('password') -> size));\n\t\t\t\tif((self -> 'loginattempt_count') >= 5);\n\t\t\t\t\t// login delay since last attempt was made \n\t\t\t\t\t(self -> '_debug_trace') -> insert(tag_name + ': Too many login attempts, wait until ' + (2 * (self -> 'loginattempt_count')) + ' seconds has passed since last attempt.');\n\t\t\t\t\twhile(((date - (self -> 'loginattempt_date')) -> second) < (2 * (self -> 'loginattempt_count')) // at least 5 seconds, longer the more attempts\n\t\t\t\t\t\t&& loop_count < 100); // rescue sling\n\t\t\t\t\t\tsleep(200);\n\t\t\t\t\t/while;\n\t\t\t\t/if;\n\t\t\t\t// authenticate user against database (username must be unique)\n\t\t\t\t(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Authenticating user');\n\t\t\t\tif(#db -> 'isfilemaker');\n\t\t\t\t\t#searchparams -> merge(array(-op='eq', (self -> 'userfield') = '=\"' + #username + '\"'));\n\t\t\t\telse;\n\t\t\t\t\t#searchparams -> merge(array(-op='eq', (self -> 'userfield') = #username));\n\t\t\t\t/if;\n\t\t\t\t#db -> select(#searchparams);\n\t\t\t\t(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Searching user db, ' (#db -> found_count) + ' found ' + (#db -> error_msg) + ' ' + (#db -> action_statement));\n\t\t\t\tif: #db -> found_count == 1\n\t\t\t\t\t&& #db -> (field: (self -> 'userfield')) == #username; // double check the username\n\t\t\t\t\t// one match, continue by checking the password with case sensitive comparsion\n\t\t\t\t\tif: (self -> 'encrypt') && (self -> 'saltfield') -> size;\n\t\t\t\t\t\t// use encryption with salt\n\t\t\t\t\t\t(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Checking password with salted encryption');\n\t\t\t\t\t\tif: bytes: (#db -> (field: (self -> 'passwordfield'))) \n\t\t\t\t\t\t\t== bytes: (self -> (encrypt: #password, -salt=#db -> (field: (self -> 'saltfield') ), -cipher=(self -> 'encrypt_cipher') ));\n\t\t\t\t\t\t\t#validlogin=true;\n\t\t\t\t\t\t/if;\n\t\t\t\t\telse: (self -> 'encrypt');\n\t\t\t\t\t\t// use encryption with no salt\n\t\t\t\t\t\t(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Checking password with encryption, no salt');\n\t\t\t\t\t\tif: bytes: (#db -> (field: (self -> 'passwordfield'))) \n\t\t\t\t\t\t\t== bytes: (self -> (encrypt: #password, -cipher=(self -> 'encrypt_cipher')));\n\t\t\t\t\t\t\t#validlogin=true;\n\t\t\t\t\t\t/if;\n\t\t\t\t\telse;\n\t\t\t\t\t\t(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Checking plain text password');\n\t\t\t\t\t\tif: bytes: (#db -> (field: (self -> 'passwordfield'))) \n\t\t\t\t\t\t\t== bytes: #password;\n\t\t\t\t\t\t\t#validlogin=true;\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t\tif(#validlogin);\n\t\t\t\t\t(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'id_user: ' + #db -> (field: (self -> 'useridfield')));\n\t\t\t\t\t// store user id\n\t\t\t\t\t(self -> 'id_user') = #db -> (field: (self -> 'useridfield'));\n\t\t\t\t\t// store all user record fields in data map\n\t\t\t\t\t(self -> 'data') = #db -> recorddata;\n\t\t\t\t/if;\n\t\t\t/if; // #username and #password\n\t\t/if; // #force\n\n\t\tif: #validlogin; \n\t\t\t(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Valid login');\n\t\t\t(self -> 'loginattempt_count') = 0;\n\t\t\t(self -> 'error_code') = 0; // No error\n\t\t\t// set validlogin to true\n\t\t\t(self -> 'validlogin')=true;\n\t\t\t// log the action TODO\n\t\t\t// store client_fingerprint\n\t\t\t(self -> 'client_fingerprint') = (self -> 'client_fingerprint_expression') -> invoke;\n\t\t\t// if singleuser, store uniqueid in server side storage\n\t\telse(!(local('username') -> size && local('password') -> size));\n\t\t\t(self -> 'error_code') = 7502; // Username or password missing\n\t\t\tself -> logout;\n\t\telse;\n\t\t\t// TODO:\n\t\t\t// - block username for a while after too many attempts\n\t\t\t(self -> 'loginattempt_count') += 1;\n\t\t\t(self -> 'loginattempt_date') = date; // keep track of when last login attempt happened\n\t\t\t(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Invalid login (' + (self -> 'loginattempt_count') + ' attempts)');\n\t\t\t(self -> 'error_code') = 7501; // Authentication failed\n\t\t\tself -> logout;\n\t\t\t// exit\n\t\t/if;\n\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\t\n\tdefine_tag: 'logout'; \n\t\tlocal: 'timer'=knop_timer; \n\t\t// set validlogin to false\n\t\t(self -> 'validlogin')=false;\n\t\t(self -> 'id_user') = null;\n\t\t(self -> 'data') = map;\n\t\t(self -> 'permissions') = map;\n\t\t\n\t\t// clear all record locks\n\t\tself -> clearlocks;\n\t\t// log the action\n\n\t\t(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Logged out');\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'getdata', -description='Get field data from the data map.',\n\t\t-required='field';\n\t\tif: (self -> 'data') >> #field;\n\t\t\treturn: (self -> 'data') -> (find: #field);\n\t\telse;\n\t\t\t(self -> '_debug_trace') -> insert(tag_name + ': ' + #field + ' not known');\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'removedata', -description='Remove field from the data map.',\n\t\t-required='field';\n\t\tif: (self -> 'data') >> #field;\n\t\t\t(self -> 'data') -> (remove: #field);\n\t\telse;\n\t\t\t(self -> '_debug_trace') -> insert(tag_name + ': ' + #field + ' not known');\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'id_user', -description='Return the user id';\n\t\tif: self -> auth;\n\t\t\treturn: (self -> 'id_user');\n\t\telse;\n\t\t\treturn: false;\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'setdata', -description='Set field data in the data map. Either -> (setdata: -field=\\'fieldname\\', -value=\\'value\\') or -> (setdata: \\'fieldname\\'=\\'value\\')',\n\t\t-required='field', -copy,\t// can also be a pair with field=value\n\t\t-optional='value', -copy;\n\t\tlocal: 'timer'=knop_timer; \n\t\tif: #field -> isa('pair');\n\t\t\tlocal: 'value'=#field -> value;\n\t\t\t#field = #field -> name;\n\t\t/if;\n\t\tfail_if: !(local_defined: 'value'), -1, (self -> type) '->setdata requires a value parameter';\n\t\t(self -> 'data') -> insert(#field = #value);\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\tdefine_tag: 'getpermission', -description='Returns true if user has permission to perform the specified action, false otherwise',\n\t\t-required='permission';\n\t\tif((self -> auth) && (self -> 'permissions') >> #permission);\n\t\t\treturn((self -> 'permissions') -> find(#permission));\n\t\telse;\n\t\t\treturn(false);\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'setpermission', -description='Sets the user\\'s permission to perform the specified action (true or false, or just the name of the permission)',\n\t\t-required='permission',\n\t\t-optional='value';\n\t\tif(local_defined('value') && #value != false); // any non-false value is regarded as true\n\t\t\t(self -> 'permissions') -> insert(#permission=true);\n\t\telse(local_defined('value') && #value == false); // explicit false\n\t\t\t(self -> 'permissions') -> insert(#permission=false);\n\t\telse; // no value specified is regarded as true\n\t\t\t(self -> 'permissions') -> insert(#permission=true);\n\t\t/if;\n\t/define_tag;\n\n\n\tdefine_tag: 'addlock', -description='Called by database object, adds the name of a database object that has been locked by this user.',\n\t\t-required='dbname';\n\t\tif: (self -> 'dblocks') !>> #dbname && (var: #dbname) -> (isa: 'database');\n\t\t\t(self -> '_debug_trace') -> insert(tag_name + ': adding database name ' + #dbname);\n\t\t\t(self -> 'dblocks') -> (insert: #dbname);\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'clearlocks', -description='Clears all database locks that has been set by this user';\n\t\tlocal: 'timer'=knop_timer; \n\t\tif: (self -> auth);\n\t\t\t(self -> '_debug_trace') -> (insert: tag_name + ': ' + (self -> 'dblocks') -> (join: ', '));\n\t\t\titerate: (self -> 'dblocks'), local: 'dbname';\n\t\t\t\tif: (var: #dbname) -> (isa: 'database');\n\t\t\t\t\t(var: #dbname) -> (clearlocks: -user=(self -> 'id_user'));\n\t\t\t\t\t#dbname = null;\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t\t// remove all locks that has been cleared\n\t\t\t(self -> 'dblocks') -> (removeall: null);\n\t\t\t(self -> '_debug_trace') -> (insert: tag_name + ': done, remaining locks: ' + (self -> 'dblocks') -> (join: ', '));\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\n\tdefine_tag: 'encrypt', -description='Internal use. Encrypts the input using digest encryption, optionally with salt. ',\n\t\t-required='data', -copy,\n\t\t-optional='salt',\n\t\t-optional='cipher';\n\t\tlocal: 'output'=string;\n\t\t!(local_defined: 'cipher') ? local: 'cipher'=self -> 'encrypt_cipher';\n\t\tif: (local_defined: 'salt');\n\t\t\t#data = #salt + #data;\n\t\t/if;\n\t\tif: (Cipher_List: -digest) !>> #cipher;\n\t\t\t// fall back to default digest cipher\n\t\t\t#cipher = 'MD5';\n\t\t/if;\n\t\t#output = (cipher_digest: #data, -digest=#cipher, -hex);\n\t\treturn: #output;\n\t/define_tag;\n\t\n\tdefine_tag: 'keys', -description='Returns all keys for the stored user data';\n\t\treturn: (self -> 'data') -> keys;\n\t/define_tag;\n\n/define_type;\n\n\n\n?>\n[\n//------------------------------------------------------------------\n// End knop_user\n//------------------------------------------------------------------\n\n//##################################################################\n\n][define_tag('changenotes', -description='This tag is created on the fly by buildnamespace.lasso',\n\t\t-namespace='knop_',\n\t\t-optional='type', -optional='date', -copy);\n\t\tlocal('output'=string, 'changenotes'=map('knop_nav'='2010-11-17\tJC\tFixed bug so that session links no longer gets added to urls by the nav -> url tag.\n2010-11-17\tJC\tFixed a bug that would not convert local params to an array under certain situations\n2009-09-18\tJS\tSyntax adjustments for Lasso 9\n2009-09-04\tJS\t->linkparams: Multiple paramaters with the same name (typically checkboxes) are now passed properly\n2009-05-06\tJS\t->directorytree considers _include folders as part of the Knop directory structure. nav->include(\\'_include/myfile.inc\\') will first look for _include/myfile.inc and if not found it will look for _knop/_include/myfile.inc \n2009-05-05\tJS\t->include looks for a specified file also inside a _knop folder, if the file does not exist at the specified location\n2009-02-09\tJS\t->filename: Casting path and actionpath to string\n2008-12-19\tJS\t->filename (and consequently ->include and ->library) can now use a specific -path instead of the current location\\'s path\n2008-12-09\tJS\t->linkparams: fixed undefined local in trace call (only showed when trace was enabled for the nav object)\n2008-11-25\tJS\t->getlocation will now avoid disabled and hidden pages when looking for the first page if no default page is specified\n2008-11-03\tJS\t->getlocation will not break if no navigation items have been defined\n2008-10-30\tJS\t_mod folders will now work with knop paths with just a single level, so an include file path can end up as _mod_customer/lib_customer.inc or just _mod_customer/lib.inc (the latter variant does not apply to extension-based filenaming, so _mod_customer/.lib will never be a working file path)\n2008-07-10\tJS\tAdded -> label to return the name of the current page\n2008-05-20\tJS\t->renderhtml: #current# is not automatically added to the template if the more elaborate template format is used. This makes it easier to hide the currentmarker without changing the nav config (partial revert of fix 2008-01-04). \n2008-05-08\tJS\t->insert: A duplicate key does no longer cause a fatal error but instead fails silently and logs to the debug log\n2008-05-07\tJS\t->url: will now call ->linkparams so all links that are constructed from ->url will properly send along the parameters specified in the nav item. This also affects pagination and sort links in grid. \n2008-05-07\tJS\tAdded ->linkparams, Returns an array for all parameters that should be sent along with nav links (this was previously embedded in renderhtml)\n2008-02-25\tJS\t->url: new parameter -getargs to add the getargs to the path link if the path equals the current path\n2008-02-06\tJC\t->insert: the -hide flag can now be a boolean (also the -disabled flag)\n2008-02-03\tJS\t->include: can now include any specified filename\n2008-02-01\tJS\t->oncreate: added optional -fileroot to be able to use a root for files that is different from the logical site root used for navigation \n2008-01-23\tJS\t->url: Added -autoparams that is required to enable the automatic passing of action_params that begin with \"-\" (this reverts the default behavior to match the the old)\n2008-01-22\tJS\t->url: GET params that begin with \"-\" are sent as parameters on links. -path, -sort, -desc, -q are explicitly excluded from nav links in renderhtml. \n2008-01-22\tJS\tWhen using param based navigation, navigation links now use much cleaner /?path/to/page/ style links instead of /?-path=path/to/page/\n2008-01-22\tJS\t->getlocation: when navmethod is param, the path can now be sent as unnamed parameter insetad of -path parameter (such as /?path/to/page/). \n2008-01-04\tJS\t->renderbreadcrumb: added flag -plain to output breadcrumb without html\n2008-01-04\tJS\t->renderbreadcrumb: added flag -skipcurrent to not include the current location in the output\n2008-01-04\tJS\t->insert: -template can now be specified also for individual nav items. Use the form #link##label##current##/link##children#. \n2008-01-04\tJS\t->renderhtml: changed #title# to #label# in template for clarity, for example #link##label##current##/link##children# (#title# will remain supported)\n2008-01-04\tJS\tAdded #current# as placeholder for template, to specify where the current marker should occurr. If not specified in the template, the current marker appears immediately after the label.\n2007-12-12\tJS\t->include now logs processing time for the include to debug trace\n2007-12-11\tJS\tAdded documentation as -description to most member tags, to be used by the new ->help tag\n2007-12-11\tJS\tMoved ->help to knop_base\n2007-12-04\tJS\tnav item css class is now applied also to disabled nav items (rendered as )\n2007-11-08\tJS\tChanged trace so it tracks some things even when it\\'s not enabled (like include etc)\n2007-11-05\tJS\tAdded var name to trace output\n2007-10-28\tJS\t->directorytree: should now work also when knop folders are symlinks\n2007-09-06\tJS\ttop level nav elements that are -disabled now behave properly when accessed\n2007-09-05\tJS\t-currentmarker can now be set separately on sublevels, not only on topmost level\n2007-08-29\tJS\tAdded _knop as optional base folder to put all knop files in\n2007-08-29\tJS\t->include: Removed file_exists check since the filename has already been verified in ->filename.\n2007-08-29\tJS\tAdded ->directorytree which returns a map with all knop filenames, to use when searching for includes\n2007-08-28\tJS\t->oncreate: -filenaming to specify how include files are named prefix/suffix/extension\n2007-08-28\tJS\t->filename: Implemented support for flexible folder structures\n2007-08-28\tJS\tInstance variable #actionconfigfile_didrun was not properly declared\n2007-06-18\tJS\tAdded tag timer to most member tags\n2007-06-14\tJS\t->insert: -url=\\'/\\' can now be used to specify the \"home\" location. \n2007-06-13\tJS\tadded ->children to get a reference to the children nav object for a specified path, so new children can be inserted. Must call ->reindex afterwards. \n2007-06-13\tJS\tadded ->reindex to rebuild the index maps from scratch. Must be done after adding children items. \n2007-06-13\tJS\tadded ->addchildren to replace a current children nav object for a specified path. Will handle the reindexing transparently. \n2007-06-13\tJS\tadded ->keymap, ->pathmap and ->urlmap to access the index maps so they call reindex if they have been invalidated (for example by ->addchildren)\n2007-06-13\tJS\tadded inheritance from knop_base\n2007-06-11\tJC\tadded handling of xhtml output\n2007-06-08\tJS\t->insert: params with empty values are now ignored\n2007-05-04\tJS\t->insert: added check that default item exists in children before storing the default\n2007-04-19\tJS added ->data to retrieve data stored for the current path (or specified path). Optional -type ensures the returned data has the correct type. \n2007-04-19\tJS ->insert: added -data to store arbitrary data object for each path. The object is stored as reference so a variable can be changed after it has been added to the nav object\n2007-04-19\tJS\tadded ->patharray to return the current path as array\n2007-04-17\tJS\t->renderhtml: template now supports #link##title##/link##children# in addition to #item# to provide more flexibility\n2007-04-17\tJS\t->oncreate: added support for -template, -class, currentclass and -currentmarker\n2007-04-13\tJS\tImplemented -class per navitem (only worked globally with setformat before)\n2007-04-03\tJS\t->renderhtml: added -renderpath, -expand and -flat to be able to render parts of the nav menu for more flexible layout\n2007-04-03\tJS\t->renderbreadcrumb: added -home to show the default navigation item first in the breadcrumb \n2007-04-03\tJS\tChanged namespace from mt_ to knop_\n2007-03-01\tJS\tChanged navmethod path so it uses response_filepath instead of $url_path\n2007-02-25\tJS\tAdded ->actionpath\n2007-02-24\tJS\t->renderhtml: improved handling of classes in nav links\n2007-02-22\tJS\t->url: added -except\n2007-02-09\tJS\t->url: corrected the behavior for plain parameters passed to the tag\n2007-02-05\tJS\t->insert: Added -param to be able to specify params that should be propagated in nav for certain nav elements (like -keyvalue to be able to move between different subtabs for a selected record\n2007-02-05\tJS\t->renderhtml now use ->url to get the right links\n2007-02-01\tJS\tMade usage of trace optional to improve performance\n2007-02-01\tJS\tImprovements to debug_trace to log also recursive events\n2007-02-01\tJS\tAdded ->haschildren, which is now used by ->renderhtml to properly show or hide child level\n2007-01-31\tJS\t->renderhtml Added renderhtml_levels to keep track of how many levels deep navigation has been rendered, to be able to add proper spacing between navigation and content\n2007-01-31\tJS \t->url: -urlargs Improved handling of urlargs and ?/& delimiters, should work better with navmethod path\n2007-01-30\tJS\tRemoved automatic link title attribute since it can be confusing to show children page titles there\n2007-01-30\tJS\tCorrected parameter path to -path (bug)\n2007-01-23\tJS\t->include: \\'config\\' checks if the same config has already run as actionconfig and won\\'t run again in that case\n2007-01-23\tJS\t->include checks if the file exists first, so no need for empty placeholder files\n2007-01-23\tJS\tAdded ->include and ->library\n2007-01-23\tJS\tAdded ->setlocation\n2007-01-17\tJS\tAdded insert: -hide to allow a location without showing it in navigation\n\nTODO\nAdd support for compound expressions for template. The expression could return a map that would override corresponding param values. \n->insert: Add -raw to be able to inject code into the link tag, similar to form->addfield(-raw). \nExclude file name for example index.lasso from getargs\nOptimize nav->url! Very slow with complex nav object. \nNeeds to exclude also -keyfield and -lockfield. Maybe better to add an option to ->url to not auto-add any \"-\" params at all. \n-params are not sent along in breadcrumb links\nNeed simple way to exclude certain \"-\" params from ->url, also in config per nav item\nAdd support for adding nav structure from a database\nMove templates to a member tag to be make it easier to subclass\nMake it possible to use external URL for -url (make sure there is no / before http)\n\n','knop_base'='2009-09-14\tJS\tSyntax adjustments for Lasso 9\n2009-09-04\tJS\tChanged $__html_reply__ to content_body\n2009-04-07\tJS\t->error_msg: custom error numbers can now be added, even if the language already exists.\n2008-01-10\tJS\t->error_msg: improved reporting of custom error messages such as from bad database queries\n2007-12-13\tJS\tAdded -> error_lang to provide a reference to the knop_lang object for error messages, to be able to add localized error messages to any Knop type (except knop_lang and knop_base)\n2007-12-12\tJS\tAdded -html and -xhtml to ->help to get a nicely formatted output. \n2007-12-11\tJS\tCentralized ->error_code and ->error_msg to knop_base. Moved all error codes to error_msg\n2007-12-06\tJS\tChanged ->help to improve the self-documentation. It will now always return an up to date list of member tags and parameter. \n2007-11-05\tJS\tAdded var name to trace output\n2007-06-17\tJS\tAdded ->tagtime (was in nav earlier)\n2007-06-13\tJS\tAdded -> varname to be able to retreive the name of the page variable that a type instance is stored in.\n2007-06-13\tJS\tAdded -> xhtml to automatically sense if an xhtml doctype exists in the current page buffer. The result is cached in a page variable for performance. \n\t\t\t\tThis is for internal use for member tags that output html. \n2007-06-13\tJS\tIntroduced page variable $_knop_data for general page level storage and caching, common between different knop objects. \n2007-06-13\tJS\tCreated the data type\n\nTODO: ->help: add output option to format for Google Code Wiki\n->xhtml is not working properly when site is run by atbegin handler and explicitly writing to content_body \n\n\n','knop_grid'='2011-01-01\tSP\tCorrection of invalid HTML in and \n2010-12-23\tSP\tCorrected pagination bug for -numbered.\n2010-11-17\tJC\tAdded -startwithfooter flag to grid->renderhtml. This moves the footer before the column titles in the table header.\n2010-11-17\tJC\tChanged rawheader inclusion to work even if there\\'s no quicksearch for a grid\n2010-05-14\tJC\tAdded span separation on grid footer for better styling\n2010-03-06\tSP\tChanged default behavior of ->sortparams and ->quicksearch with -sql to add backticks between the table and column names. Now JOINs may be used.\n2010-03-06\tSP\tAdded ->sortparams and ->quicksearch with -removedotbackticks for backward compatibility for fields that contain periods. If you use periods in a fieldname then you cannot use a JOIN in Knop.\n2010-01-27\tJC\tAdjusted the id support\n2010-01-25\tJC\tAdded support for optional id, used by table, quicksearch and quicksearch_reset\n2009-09-18\tJS\tSyntax adjustments for Lasso 9\n2009-08-26\tJS\tCorrected prev/next links when no nav is defined for the grid object\n2009-06-29\tJS\t->renderlisting: documentation correction (renderlisting never calls renderfooter). \n2009-01-11\tJS\t->renderlisting: Made sure that template isn\\'t applied on NULL field values since that would cause an error with ->replace \n2008-12-29\tJC\tSupport for optional classes in table header\n2008-11-27\tJC\t-> implemented support for td specific classes. The class is inserted in both the TH and TD tag for the specified field\n2008-09-24\tJS\t->sortparams: fieldnames specified by the -sort parameter are now validated so they exist in the database\n2008-09-24\tJS\t->sortparams, ->quicksearch: Added protection against backtick sql injection in MySQL object names\n2008-09-10\tJS\t-numbered can now be specified at oncreate in addition to ->renderhtml and ->renderfooter. \n2008-09-08\tJS\t->sortfield changed so defaultsort is honored even if -nosort is specified (-nosort is only used to prevent the user from changing sort order on the fly)\n2008-09-08\tJS\t->renderlisting and ->renderfooter optimized by caching the result of nav->url. \n2008-05-15\tJS\t->renderfooter: minor adjustment to numbered pagination links\n2008-05-14\tJS\t->renderfooter (and ->renderhtml): added -numbered as option to get google style numbered pagination links. Render the grid with -numbered (defaults to show 6 page number links plus the far ends) or -numbered=10 or another number. \n2008-05-13\tJS\tAdded ->renderlisting which is now part of ->renderhtml for more flexibility\n2008-02-25\tJS\t->renderheader and ->renderfooter calls nav -> url with -getargs \n2008-01-22\tJS\t->renderheader, ->renderfooter, ->renderhtml: addded -autoparams to nav -> url used in links since url was changed to default to no autoparams. \n2008-01-22\tJS\t->renderheader, ->renderfooter, ->renderhtml: improved support for param based navigation method in links, cleaned up linking to use nav -> url instead of self -> urlparams when nav is available\n2008-01-22\tJC\t->quicksearch: Changed wordseparators so that \\\\r and \\\\n aren\\'t placed as \\\\r\\\\n, otherwise they are treated as a single character by ->split. \n2007-12-11\tJS\tAdded documentation as -description to most member tags, to be used by the new ->help tag\n2007-12-11\tJS\tMoved ->help to knop_base\n2007-12-03\tJS\tAdded optional -language parameter to set the initial language for the grid object\n2007-12-03\tJS\tAdded -> lang to provide a reference to the knop_lang object that is used for localized strings\n2007-12-03\tJS\tAdded localized strings for English and Swedish\n2007-12-03\tJS\tAdded knop_lang to handle localized strings\n2007-11-11\tJC\tAdded optional -rawheader for extra header content to be inserted before the Quicksearch form\n2007-10-23\tJS\t->renderheader: added class=\"grid\" to the opening table tag to be able to isolate the css specifications\n2007-10-03\tJS\t->renderfooter: added unique classes for each type of prev/next link to be able to replace with images using css\n2007-10-03\tJS\t->renderfooter: Changed prev/next link texts to simple |< << >> >| instead of unicode glyphs\n2007-09-20\tJS\tPostparams are only sent along for nav params (not \"-\" params)\n2007-09-07\tJS\tAlso send postparams along in prev/next links (not only getparams)\n2007-09-06\tJS\tIf nav has params defined, those params will be sent along with prev/next links\n2007-09-06\tJS\tAdded encode_url for link params\n2007-09-06\tJS\tChanged -action to -formaction in the quicksearch form\n2007-08-08\tJS\t->urlargs: Added exception for -session\n2007-06-18\tJS\tAdded tag timer to most member tags\n2007-06-13\tJS\tadded inheritance from knop_base\n2007-06-11\tJC\tadded handling of xhtml output\n2007-05-30\tJS\t->quicksearch: added \\\\r and \\\\n as word separators. \n2007-05-03\tJS\t->addfield: Added check for empty dbfield name before adding to dbfieldmap\n2007-04-19\tJS\t->quicksearch: added -value (flag) that makes quicksearch output just the value of the quicksearch field instead of a query\n2007-04-13\tJS\t->oncreate: added -nosort as global flag (overrides column specific sort options)\n2007-04-13\tJS\t->renderfooter: Added tbody to footer to make it pass validation, but it\\'s still not semantically correct. \n2007-04-13\tJS\tChanged field type for quicksearch for non-WebKit based browsers\n2007-04-10\tJS\t->quicksearch: Added @ as word separator for \"word begins with\" search\n2007-04-10\tJS\t->quicksearch: Added -contains as option to perform a simple contains search instead of emulating \"word begins with\" search\n2007-04-10\tJS\t->renderheader: When grid has a defaultsort, there should be no \"unsort\" option in the sortable headings\n2007-04-10\tJS\t->insert: (-defaultsort=\\'desc\\') or (-defaultsort=\\'descending\\') makes the default sort order sort in descending order\n2007-04-04\tJS\t->addfield: -template can now also be a compound expression\n2007-04-03\tJS\tChanged namespace from mt_ to knop_\n2007-03-01\tJS\tAdded support for FileMaker with quicksearch (untested)\n2007-03-01\tJS\tChanged all texts to English\n2007-02-07\tJS\tRemoved classs=\"first\" and class=\"notopborder\" since CSS border-collapse: collapse; eliminates the need\n2007-02-05\tJS The -keyvalue parameter for url edit links can be given another name by specifying -keyparamname in addfield\n2007-01-31\tJS\t->addfield: #value# can be used in -url, as a way to provide mailto links etc in lists\n2007-01-30\tJS\tSortable columns now thave three states instead of two: sorted ascending, sorted descending and unsorted. \n2007-01-30\tJS\tImprovements to quicksearch, to emulate \"word begins with\" searches\n2007-01-26\tJS\tAdded support for quicksearch field in grid header. Specify -quicksearch at ->oncreate, and tell what fields to search by specifying -quicksearch for those fields at ->addfield. \n\t\t\t\tFields can be search only (no display) by leaving out name and label. All specified fields are searched word for word of thew search string. \n\t\t\t\tUse ->quicksearch to get the search parameters (optionally -sql)\n2007-01-26\tJS\tAdded ->urlargs to get a querystring with all \"-\" GET params, except those in optional -except string or array parameter. \n2007-01-22\tJS\tAdjustments to highlighting and \"(redigera)\"-link for records with empty values in the linked field\n2007-01-19\tJS\tAdded href titles to sort links and prevnext links\n2007-01-19\tJS\tCorrected sortparams when no sortfield is specified\n2007-01-19\tJS\tAddded go to first page, go to last page in footer\n2007-01-19\tJS\tAdded member tag page_skiprecords to help correcting out of bounds page numbers\n2007-01-19\tJS\tAdded member tag lastpage\n2007-01-18\tJS\tSupport for highlighting of affected record after edit or update (class name \"highlight\")\n2007-01-17\tJS\tAdded addfield: -template\n\nTODO\nMake it possible for knop_grid to work independently of a knop_database object so other types of listings can bre created. \nLanguage of quicksearch buttons can\\'t be changed after the grid has been created\ntbody is used in renderfooter, which is not semantically correct. can\\'t use tfoot though since the footer is rendered twice. \nMove templates to a member tag to be make it easier to subclass\nChange ->addfield to ->insert and make ->addfield deprecated\n\n','knop_database'='2012-06-10\tSP\tFix for decimal precision bug in 8.6.0.1 in renderfooter.\n2012-01-15\tSP\tAdd support for inline host method. Thanks to Ric Lewis.\n2010-11-23\tJS\t->settable: removed reference for -table\n2009-09-18\tJS\tSyntax adjustments for Lasso 9\n2009-06-26\tJS\t->nextrecord: Added deprecation warning\n2009-05-15\tJS\t->field: corrected the verification of the -index parameter\n2009-01-09\tJS\tAdded a check before calling resultset_count so it will not break in Lasso versions before 8.5\n2009-01-09\tJS\t->_unknowntag: fixed incorrect debug_trace\n2008-12-03\tJS\t->addrecord: improved how keyvalue is returned when adding records\n2008-12-03\tJS\t->addrecord: inserting a generated keyvalue can now be suppressed by specifying -keyvalue=false\n2008-12-03\tJS\t->saverecord and ->deleterecord will now use the current keyvalue (if any), so -keyvalue will not have to be specified in that case. \n2008-11-25\tJS\t->field and ->recorddata will no longer touch current_record if it was zero\n2008-11-24\tJS\t->field: Added -index parameter to be able to access any occurrence of the same field name\n2008-11-24\tJS\tAdded -> records that returns a new data type knop_databaserows\n2008-11-24\tJS\t->resultset_count: added support for -inlinename. \n2008-11-24\tJS\tChanged ->nextrecord to ->next. ->nextrecord remains supported for backwards compatibility.\n2008-11-14\tJS\t->nextrecord resets the record pointer when reaching the last record\n2008-11-13\tJS\t->recorddata now honors the current record pointer (as incremented by -nextrecord)\n2008-11-13\tJS\t->recorddata: added -recordindex parameter so a specific record can be returned instead of the first found.\n2008-10-30\tJS\t->getrecord now REALLY works with integer keyvalues (double oops) - I thought I fixed it 2008-05-28 but misplaced a paren...\n2008-09-26\tJS\tAdded -> resultset_count corresponding to the same Lasso tag, so [resultset]...[/resultset] can now be used through the use of inlinename.\n2008-09-10\tJS\t-> getrecord, ->saverecord, ->deleterecord: Corrected handling of lock user to work better with knop_user\n2008-07-09\tJS\t->saverecord: -keeplock now updates the lock timestamp\n2008-05-28\tJS\t->getrecord now works with integer keyvalues (oops)\n2008-05-27\tJS\t->get returns a new datatype knop_databaserow \n2008-05-27\tJS\tAdded ->size and ->get so a database object can be iterated. When iterating each row is returned as an array of field values. \n2008-05-27\tJS\tAddedd ->nextrecord that increments the recordpointer each time it is called until the last record in the found set is reached. Returns true as long as there are more records. Useful in a while loop - see example below\n2008-05-27\tJS\tImplemented record pointer \\'current_record\\'. The record pointer is reset for each new query. \n2008-05-27\tJS\t->field: added -recordindex to get data from any record in the current found set\n2008-05-27\tJS\tAdded ->_unknowntag as shortcut to field\n2008-05-26\tJS\tRemoved onassign since it causes touble\n2008-05-26\tJS\tExtended field_names to return the field names for any specified table, return field names also for db objects that have never been used for a database query and optionally return field types\n2008-01-29\tJS\t->getrecord now supports -sql. Make sure that the SQL statement includes the relevant keyfield (and lockfield if locking is used). \n2008-01-10\tJS\t->capturesearchvars: error_code and error_msg was mysteriously not set after database operations that caused errors. \n2008-01-08\tJS\t->saverecord: added flag -keeplock to be able to save a locked record without releasing the lock\n2007-12-15\tJS\tAdding support for knop_user in record locking is in progress. Done for ->oncreate and ->getrecord. \n2007-12-11\tJS\tMoved error_code and error_msg to knop_base\n2007-12-11\tJS\tAdded documentation as -description to most member tags, to be used by the new ->help tag\n2007-12-11\tJS\tMoved ->help to knop_base\n2007-12-10\tJS\tAdded ->settable to be able to copy an existing database object and properly set a new table name for it. Faster than creating a new instance from scratch. \n2007-12-03\tJS\tCorrected shown_first once again, hoping it\\'s right this time\n2007-11-29\tJS\tAdded support for field_names and corresponding member tag ->field_names\n2007-11-05\tJS\tAdded var name to trace output\n2007-10-26\tJS\t->capturesearchvars: corrected shown_first when no records found\n2007-10-26\tJS\t->oncreate: added default value \"keyfield\" if the -keyfield parameter is not specified\n2007-09-06\tJS\tCorrected self -> \\'tagtime\\' typo\n2007-06-18\tJS\tAdded tag timer to most member tags\n2007-06-13\tJS\tadded inheritance from knop_base\n2007-06-11\tJC\tadded handling of xhtml output\n2007-05-30\tJS\tChanged recordid_value to keyfield_value and -recordid to -keyvalue\n2007-05-28\tJS\t->oncreate: Added clearing of current error at beginning of tag\n2007-04-19\tJS\tCorrected the handling of -maxrecords and -skiprecords for SQL selects that have LIMIT specified\n2007-04-19\tJS\tImproved handling of foundrows so it finds any whitespace around SQL keywords, instead of just plain spaces\n2007-04-18\tJS\t->select now populates recorddata with all the fields for the first found record. Previously it only populated recorddata when there was 1 found record. \n2007-04-12\tJS\t->oncreate: Added authentication inline around Database_TableNames../Database_TableNames\n2007-04-10\tJS\t->oncreate: Improved validation of table name (table_realname can sometimes be null even for valid table names)\n2007-04-03\tJS\tChanged namespace from mt_ to knop_\n2007-02-02\tJS\tImproved reporting of Lasso error messaged in error_msg\n2007-01-30\tJS \tAdded real error codes and additional error data for some errors (like record locked)\n2007-01-30\tJS\tChanged -keyvalue parameters to copy value instead of pass as reference, to not cause problems when using keyvalue from the same db object as is being updated, for example $db->(saverecord: -keyvalue=$db->keyvalue)\n2007-01-26\tJS\tAdjusted affectedrecord_keyvalue so it\\'s only captured for -add and -update\n2007-01-23\tJS\tSupports -uselimit (or querys that use LIMIT) and still gets proper searchresult vars (using a separate COUNT(*) query) - may not always get the right result for example for queries with GROUP BY\n2007-01-23\tJS\t-keyfield can be specified for saverecord to override the default\n2007-01-23\tJS\tChanged name of ->updaterecord to ->saverecord\n2007-01-23\tJS \tFixed bug where keyfield was missing as returnfield when looking up locked record for deleterecord\n2007-01-23\tJS\tAdded ->field\n2007-01-19\tJS\tAdded maxrecords_value and skiprecords_value to searchresultvars\n2007-01-18\tJS\tAdded affectedrecord_keyvalue to make it possible to highlight affected record in record list (grid)\n\n\nTODO:\nAllow -keyfield to be specified for ->addrecord and ->deleterecord\nAdd some Active Record similar functionality for editing\nLook at making it so -table can be set dynamically instead of fixed at oncreate, to eliminate the need for one db object for each table. This can cause problems with record locks and how they interact with knop_user \ndatetime_create and datetime_mod, and also user_create and user_mod.\n\tUse default field names but allow to override at oncreate, and verify them at oncreate before trying to use them. \n\n\n','knop custom tags in util.inc'='\t2007-06-17\tJS\tCreated the type\n\t\n\t','knop_user'='2012-01-16\tSP\tAdded ->removedata to remove field from the data map. Thanks to Ric Lewis.\n2009-09-18\tJS\tSyntax adjustments for Lasso 9\n2009-06-23\tJS\t->encrypt now uses default encrypt_cipher from the custom type instead of a hard coded default\n2009-02-26\tJS\t->login: further correction on the search for login with FileMaker, to reduce the risk for false duplicates\n2009-02-26\tJS\t->login: Added optional -searchparams to be able to add more conditions to the login search, for example to exclude users that are not enabled. \n2008-12-02\tJS\t->encrypt: Changed to -hex cipher instead of encode_base64\n2008-11-05\tJS\t->getdata: corrected a check that prevented the tag from returning anything\n2008-11-05\tJC\t->login: A failed login attempt now results in a logout instead of keeping any old authentication\n2008-11-05\tJC\t->getpermission will always return falseif a user is not logged in\n2008-11-05\tJC\t->logout: The permissions map is now cleared when logging out\n2008-11-04\tJC\t->encrypt: changed incorrect encrypt_cipher to encrypt_digest\n2008-09-10\tJS\tAdded ondeserialize to make client_fingerprint_expression survive session\n2008-07-17\tJS\tImplemented ->setpermission and ->getpermission\n2008-07-17\tJS\tAdded client_fingerprint_expression as compound expression so it can be configurable by changing the instant variable\n2008-05-20\tJS\t->login: Added delay between more than 5 failed login attempts \n2008-05-08\tJS\t->login: improved the search for FileMaker datasources to make it work for email address as username\n2008-02-08\tJS\tAdded ->keys\n2008-02-03\tJS\t-> login: Corrected storage of id_user\n2007-11-27\tJS\tCoded an incomplete version\n2007-06-13\tJS\tCreated the data type\n\n// TODO: \nMake it possible for knop_user to work independently of a knop_database object by creating a custom user lookup - see http://listsearch.com/Lasso/Thread/index.lasso?20528\nuserdb reference is brooken, probably when stored in session. Can this be fixed?\nMake client_fingerprint configurable by specifying a compound expression at oncreate\nAdd support for role based permisions\n\n','knop_lang'='2010-12-29\tJS\t->getstring: make sure we only try to do replacement in strings or bytes\n2010-05-27\tJS\tgetstring now works also with empty -replace value\n2010-04-20\tJS\tgetstring debug output corrected for missing string. \n2009-09-16\tJS\tSyntax adjustments for Lasso 9\n2009-06-26\tJS\t->addstring: clarified deprecation warning\n2009-04-08\tJS\tAdded -debug flag to oncreate (when creating a lang object) to make undefined language keys appear as *key*.\n2009-03-24\tJS\t->getstring prevents replacements if there is no language string found, to prevent null->replace error\n2008-11-12\tJS\tAdded ->insert instead of ->addstring for better consistency with other Lasso data types. ->addstring will remain functional for backwards compatibility. \n2008-09-11\tJS\t->_unknowntag: added missing support for -language\n2008-01-22\tJS\t->getstring: corrected the fallback behavior when a current language has been set \n2008-01-07\tJS\tRemoved instance variable browserlanguage due to problems with transient storage. The browserlanguage is cached on page level so it\\'s no loss in reality. \n2007-12-12\tJS\tAdded page level storage of currentlanguage, so all knop_lang instances defaults to the same language once one of them have set a language explictly, but only if the other knop_lang instances don\\'t have a language set explicitly. \n2007-12-12\tJS\tAdded page level caching of browser language (stores the value in $_knop_data map)\n2007-12-06\tJS\tMoved -> help to knop_base\n2007-12-06\tJS\tAdded ->description to all member tags. \n2007-12-03\tJS\tFinished first complete version\n2007-06-18\tJS\tAdded tag timer to most member tags\n2007-06-13\tJS\tadded inheritance from knop_base\n2007-06-13\tJS\tRenamed to knop_lang (formerly knop_strings)\n2007-04-04\tJS\tCreated the data type and started coding\n\nTODO:\nProvide methods to handle formatting of dates, numbers, currency etc for different languages/locales. \nWeekday names, month names etc. \nMember tag to return the current language\nMember tag to set default output encoding unless it follows encode_set. \n\nExamples\n\tvar: \\'lang_messages\\'=(knop_lang: -default=\\'en\\');\n\t$lang_messages -> (insert: -key=\\'welcome\\', -value=\\'Welcome to the home page\\', -language=\\'en\\');\n\t$lang_messages -> (insert: -key=\\'welcome\\', -value=\\'Välkommen till hemsidan\\', -language=\\'sv\\');\n\t$lang_messages -> (insert: -key=\\'loggedin\\', -value=\\'You are logged in as #1# #2#\\', -language=\\'en\\');\n\t$lang_messages -> (insert: -key=\\'loggedin\\', -value=\\'Du är inloggad som #1# #2#\\', -language=\\'sv\\');\n\n\t// proper call, defaults to the browser\\'s preferred language\n\t$lang_messages -> (getstring: \\'welcome\\');\n\t// shorthand call\n\t$lang_messages -> welcome;\n\n\t// change language\n\t$lang_messages -> (setlanguage: \\'sv\\');\n\t$lang_messages -> welcome;\n\n\t// proper call with replacements\n\t$lang_messages -> (getstring: -key=\\'loggedin\\': -replace=(array: (field: \\'firstname\\'), (field: \\'lastname\\')));\n\n\t// shorthand call with replacements\n\t$lang_messages -> (loggedin: -replace=(array: (field: \\'firstname\\'), (field: \\'lastname\\')));\n\n\n','knop_form'='2011-02-28\tJS\t->addfield: Added -template to specify field specific template \n2010-11-22\tSP\t->init: Correction of -lockvalue handling after L9 syntax adjustment\n2010-07-18\tSP\tAdded support for series for -options\n2010-06-10\tJS\t->renderform: avoid adding -upload parameters to post forms since it conflicts with file uploads (found by Steve Piercy)\n2010-04-21\tJS\t->renderhtml: removed encode_html for label\n2010-03-06\tSP\tChanged default behavior of ->updatefields with -sql to add backticks between the table and column names. Now JOINs may be used.\n2010-03-06\tSP\tAdded ->updatefields with -removedotbackticks for backward compatibility for fields that contain periods. If you use periods in a fieldname then you cannot use a JOIN in Knop.\n2009-11-11\tJS\tAdded class and id to optiongroup div that surrounds for checkbox and radio\n2009-11-11\tJS\tCorrected id for checkbox and radio option labels\n2009-10-02\tJS\tAdded id for labels, auto generated from the field\\'s id with _label appended\n2009-09-16\tJS\tSyntax adjustments for Lasso 9\n2009-09-04\tJS\tChanged $__html_reply__ to content_body\n2009-09-04\tJS\t->renderhtml: corrected typ for autoparams\n2009-07-23\tJS\t->renderform: removed encode_html that somehow has reappeared for label. \n2009-07-10\tSP\tadded -maxlength option for text fields\n2009-06-26\tJS\t->oncreate: added deprecation warning for -action\n2009-06-22\tJS\t->addfield: corrected -options check to look for set instead of series (besides array)\n2009-04-16\tJS\t->loadfileds can now load field values from -params also inside an inline\n2009-03-20\tJS\tAdded around injected scripts for better xhtml compliance\n2009-01-08\tJS\t->getvalue and _unknowntag: added -index parameter to be able to get value for a specific field instance when there are multiple fields with the same name \n2009-01-08\tJS\t->loadfields: implemented support for multiple fields with the same name when loading field values from form submission where the number of same name fields matches\n2009-01-07\tJS\t->setvalue: added -index parameter to be able to set value for a specific field instance when there are multiple fields with the same name \n2008-12-08\tJS\t->renderform: Removed the onclick handlers for checkbox and radio since Safari now supports clicking the label text as click for the checkbox/radio control. \n2008-12-05\tJS\t->renderform: the fieldset and legend field types will now use id and class on the fieldset tag if specified\n2008-12-03\tJS\t->renderform: fields of type fieldset now uses value as legend (just as field type legend already did) instead of always using an empty legend\n2008-09-24\tJS\t->updatefields: Added protection against backtick sql injection in MySQL object names\n2008-09-17\tJS\t->renderform and ->renderhtml: -from and -to allows negative numbers to count from end of form instead\n2008-09-13\tJS\tAdded ->getlabel to return the display name for a field. \n2008-09-13\tJS\t->addfield and ->validate: Implemented -validate to specify a compound expression to validate the field input. \n2008-09-13\tJS\t->addfield and ->loadfields: Implemented -filter to specify a compound expression to filter the field input. \n2008-09-11\tJS\t->updatefields: fixed exclusion of special field types html, legend and fieldset. \n2008-09-11\tJS\t->renderform: Fixed missing value for password fields\n2008-07-02\tJS\t->renderform: Cleaned up the automatic adding of javascript code so it\\'s not added if not needed. Also moved all scripts to the end of the page. More work with with the javascripts is needed.\n2008-06-03\tJS\t->renderform: corrected missing closing \n2008-05-15\tJS\t->renderform and ->renderhtml: adjusted the behavior for nested fieldsets\n2008-05-13\tJS\tImplemented -legend for ->renderhtml, to make it consistent with the new legend field type\n2008-05-13\tJS\tImplemented special field types html, fieldset and legend. Use -value to display data for these fields. A legend field also creates a fieldset (closes any previously open fieldsets). Use fieldset with -value=false to close a fieldset without opening a new one. \n2008-05-06\tJS\tAdded unknowntag as shortcut to getvalue\n2008-01-30\tJS\tRemoved duplicate endscript entries for if(dirty) {makedirty()};\n2007-12-13\tJS\tCorrected ->addfield: -dbfield so empty dbfields are properly ignored by ->updatefields. \n2007-12-11\tJS\tMoved error_msg to knop_base (special version of error_code stays here) \n2007-12-11\tJS\tAdded documentation as -description to most member tags, to be used by the new ->help tag\n2007-12-11\tJS\tMoved ->help to knop_base\n2007-11-13\tJS\tAdded -buttontemplate to be able to specify separate template for buttons, defaults to no
, but if template has been specified that will be used instead (for backwards compatibility)\n2007-11-12\tJS\t->process delete now works also when not using record locking (not specifying -user)\n2007-11-01\tJS\t->renderform: added support for -hint for textarea fields.\n2007-09-27\tJS\t->renderhtml: multiple values (array) for radio, checkbox and select are now rendered properly with either \",\" or
depending on the presence of -linebreak, and with the display text instead of the actual option value\n2007-09-27\tJS\t->renderform: improved handling of multiple values for checkbox, radio and select\n2007-09-21\tJS\t->addfield: flag parameters now accept false as value\n2007-09-06\tJS\t->oncreate: changed name of -action to -formaction to make it more clear what it is. -action is still supported but deprecated.\n2007-09-06\tJS\t->renderform: Corrected the exception for -session... (duh)\n2007-08-08\tJS\t->renderform: Added exception for -session\n2007-06-18\tJS\tAdded tag timer to most member tags\n2007-06-13\tJS\tadded inheritance from knop_base\n2007-06-12\tJC\tbugfixed -xhtml form rendering when called by quicksearch\n2007-06-11\tJC\tadded handling of xhtml output\n2007-04-19\tJS\t->loadfields: fixed -params that was broken when adding -database\n2007-04-19\tJS\t->renderform: removed invalid wrap=\"soft\" from textarea\n2007-04-12\tJS\t->process: made -user optional (only needed when using record locking)\n2007-04-12\tJS ->loadfields can now take a -database parameter, either as a flag (no value) where the database object connected to the form will be used, or by specifying a database object as value. \n2007-04-03\tJS\tChanged namespace from mt_ to knop_\n2007-03-01\tJS\t->renderform fixed unsavedwarning on page load by moving checkdirty() to afterscript\n2007-03-01\tJS\t->formmode and ->init changed so it preserves the right mode after a failed add\n2007-02-27\tJS\t->renderform: added
around checkboxes and radios for css formating\n2007-02-26\tJS\t->oncreate: added -actionpath to specify the framework action path for the form instead of manually adding the -action hidden field\n2007-02-24\tJS\tCorrected entersubmitblock behavior by adding onfocus handler on form and starting with submitBlock=false\n2007-02-23\tJS\tRemoved encode_html from form field labels\n2007-02-22\tJS\t->setformat: Added -legend\n2007-02-07\tJS\tAdded ->copyfield to copy a form field to a new name, with the same properties. \n2007-02-07\tJS\t->errors now returns empty array if validate has not been called, instead of performing validation\n2007-02-05\tJS\t->getbutton can now look for also button names that are not one of the built-in ones (for example button_apply)\n2007-02-05\tJS The -keyvalue parameter can be given another name by specifying -keyparamname in oncreate\n2007-02-02\tJS\tAdded ->lockvalue_decrypted\n2007-02-02\tJS\t->addfield: -value is now stored as reference\n2007-02-02\tJS\terror_code now returns an error for when the form contains validation errors\n2007-02-02\tJS\tImproved reporting of Lasso error messaged in error_msg\n2007-02-02\tJS \tAdded real error codes\n2007-01-31\tJS\t->rederform action_params now also exclude \"-\" params that appear in the form action\n2007-01-29\tJS\t->renderform: The first field with input error will get focus when loading page\n2007-01-29\tJS\tAdded -focus to ->addfield to give default field focus when loading page with form\n2007-01-29\tJS\tAdded -disabled to ->addfield, and handling of it in ->renderform\n2007-01-29\tJS\tAdded -noautoparams to ->oncreate to disable the automatic passing of action_params that begin with \"-\"\n2007-01-29\tJS\t->renderform now renders label also for submit, reset to format properly with css\n2007-01-26\tJS\tAdded support for Safari specific \n2007-01-26\tJS\t->renderform action_params that begin with \"-\" now exclude params that exist in the form. Minor corrections to the behavior. \n2007-01-25\tJS\tAdded -nowarning to ->oncreate to disable unsaved warnings for the entire form\n2007-01-25\tJS\tAdded -required to ->oncreate (and a few more from ->setformat)\n2007-01-23\tJS\tAutogenerates id for the form itself\n2007-01-23\tJS\tAdded ->getbutton to return the button that was clicked when submitting a form (cancel, add, save, delete)\n2007-01-23\tJS\tAdded auto conversion of options left hand pair member to string, to make comparsions work reliably. Integer zeros don\\'t compare nicely to strings. \n2007-01-23\tJS\tAdded support for submit-on-enter prevention: specify -entersubmitblock at oncreate\n2007-01-19\tJS\tAddes renderform: -legend to be able to group form fields at render time\n2007-01-19\tJS\tadded support for -optgroup in -options for select. Also works for radio and checkbox. Specify empty -optgroup to close optgroup in select without starting a new, or to add extra linebreak between checkboxes/radio buttons. \n2007-01-19\tJS\tadded -template for oncreate\n2007-01-19\tJS\tadded optional fieldset and legend to form, legend can be specified as -legend at oncreate. if -legend is specified, the form will be wrapped in a fieldset. \n2007-01-19\tJS\tmethod now defaults to post\n2007-01-19\tJS\tCorrected line separator for FileMaker checkboxes and added the same handling also for radio\n2007-01-18\tJS\trenderform: any action_params that begin with \"-\" (except -keyvalue and -lockvalue) are added as form parameters\n2007-01-18\tJS\trenderform: checkboxes and multiselects now show checked and selected properly when loading values from database\n2007-01-18\tJS\tupdatefields: added support for multiple values for one fieldname, like checkboxes (multiple fields in the update pair array, -sql generates comma separated values)\n2007-01-17\tJS\treset button now makes form undirty\n2007-01-17\tJS\taddfield: -confirmmessage can now be specified for any submit or reset button\n2007-01-17\tJS\tadded addfield: -nowarning to avoid unsaved warning when the field is changed\n2007-01-17\tJS\tchanged default class name for unsaved marker from dirty to unsaved\n2007-01-17\tJS\tchanged name of -dirtymarker and -dirtymarkerclass to unsavedmarker and -unsavedmarkerclass for userfriendlyness\n2007-01-17\tJS\tadded setformat: -unsavedwarning to dynamically set the javascript form dirty warning message\n2007-01-17\tJS\trenderform: -field changed to renderform: -name for consistency\n2007-01-16\tJS\trenderform: -field with wrong field name does not output anything, instead of the entire form\n2007-01-16\tJS\tfixed onbeforeunload in javascript form dirty handler\n\nTODO:\n->addfield: Add -format to manipulate the field value before it is displayed by ->renderform and ->renderhtml, much like -filter but only for display and without affecting input. \n->addfield: Add -fieldgroup to be able to group related fields together, useful for ->updatefields to return just fields that belong to a specific db table, or ->renderform as another way to render a form selectively\n->renderform needs a better way to display errors inline together with the fields\nMake _unknowntag also work as shortcut to setvalue if a value is specified\nAdd a new special field type to the form object, let\\'s say \"data\". That field type will not interact with forms and will never be touched by loadfields, but it will populate ->updatefields.\nAdd -> searchfields, which will return a fulltext enabled pair array better suited for searchs than ->updatefields is. -fulltext needs to be specified per field. \nReview and clean up the javascripts inserted automatically by knop_form - partially done\nOption to let textarea grow automatically depending on the amount of text in it. \nUse http://bassistance.de/jquery-plugins/jquery-plugin-validation/ instead of client side validation\nPossibly add support for the same validation expressions as the jquery validation plugin uses, so server side a nd client side validation can be specified at once. \nAdd -path as parameter for oncreate so the form action can be set with less confusion... In that case -formaction will be a physical url, while -path would be a framework path. \nFix actionpath reference so it updates properly when altering the value (not possible?)\nShould loadfields load \"-\" params?\nUnsavedwarning made optional, does not seem to work properly now?\nMore flexible error hightlighting\nMove templates to a member tag to be make it easier to subclass (Douglas Burchard)\nAdd \"button\". . Subtypes are submit, reset and button. How to specify the subtype? (Douglas Burchard)\nChange ->addfield to ->insert and make ->addfield deprecated\nThere is no src for input type image!\nAdd ->size and ->get so the form object can be iterated\nAdd -skipemtpy to to ->renderhtml\nOption for -> renderhtml to output without html encoding\n->renderhtml should never html encode fields of type html\n\n',));\n\t\tif(local_defined('type'));return(#changenotes -> find(#type));else;\n\t\t!local_defined('date') ? local('date'=date('1900-01-01')) | #date = date(#date);\n\t\titerate(#changenotes, local('changenote'));\n\t\t\t#output += #changenote -> name + '\\n';\n\t\t\titerate(#changenote ->value -> split('\\n'), local('changenote_row'));\n\t\t\t\tif(date(#changenote_row -> split(regexp('\\\\s')) -> first) >= #date);\n\t\t\t\t\t#output += #changenote_row + '\\n';\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t\t#output += '\\n';\n\t\t/iterate;\n\t\treturn(@#output);/if;\n\t\t/define_tag]" }, { "path": "src/test/resources/samples/langs/Lasso/knop.ldml", "content": "[/* \n\n\tOn-Demand library for namespace knop\n\tNamespace file built date 2012-06-10 02:05:30 by http://knop8/buildnamespace.lasso\n\tMontania System AB\n\n*/]\n\n[\n//------------------------------------------------------------------\n// Begin knop custom tags in util.inc\n//------------------------------------------------------------------\n\n] split('`') -> first;\n\treturn(@#output);\n/define_tag;\n\ndefine_tag: 'unique', -description='Returns a very unique but still rather short random string',\n\t-namespace='knop_',\n\t-priority='replace';\n\n\t// Johan Sölve 2006-09-20 \n\t\n\tlocal: 'output'=string,\n\t\t'seed'=integer,\n\t\t'charlist'='abcdefghijklmnopqrstuvwxyz0123456789';\n\tlocal: 'base'=(#charlist -> size);\n\t// start with the current date and time in a mixed up format as seed\n\t#seed = integer: (date -> (format: '%S%y%m%d%H%M'));\n\t// convert this integer to a string using base conversion\n\twhile: #seed>0;\n\t\t#output = #charlist -> (get: (#seed % #base)+1) + #output;\n\t\t#seed = #seed / #base;\n\t/while;\n\t// start over with a new chunk as seed\n\t#seed = string: 1000+(date->millisecond);\n\t#seed = #seed + string: (math_random: -lower=1000, -upper=9999);\n\t#seed = integer: #seed;\n\t// convert this integer to a string using base conversion\n\twhile: #seed>0;\n\t\t#output = #charlist -> (get: (#seed % #base)+1) + #output;\n\t\t#seed = #seed / #base;\n\t/while;\n\treturn: #output;\n/define_tag;\n\n\ndefine_tag: 'seed', \n\t-namespace='knop_',\n\t-priority='replace';\n\t\n\tlocal: 'seed'= (string: $__lassoservice_ip__) + response_localpath;\n\t#seed -> removetrailing(response_filepath);\n\treturn:\t #seed;\n/define_tag;\n\ndefine_tag: 'foundrows', // http://tagswap.net/found_rows\n\t-namespace='knop_',\n\t-priority='replace';\n\tlocal: 'sql'= action_statement;\n\tif: (string_findregexp: #sql, -find= '\\\\sLIMIT\\\\s', -ignorecase) -> size == 0;\n\t\t// || found_count < maxrecords_value; (this condition is inaccurate)\n\t\t// found_count must be accurate\n\t\treturn: found_count;\n\t/if;\n\tif: (string_findregexp: #sql, -find= '\\\\s(GROUP\\\\s+BY|HAVING)\\\\s', -ignorecase) -> size == 0;\n\t\t// Default method, usually the fastest. Can not be used with GROUP BY for example. \n\t\t// First normalize whitespace around FROM in the expression\n\t\t#sql = (string_replaceregexp: #sql, -find= '\\\\sFROM\\\\s', -replace=' FROM ', -ignorecase, -ReplaceOnlyOne);\n\t\t#sql = 'SELECT COUNT(*) AS found_rows ' + #sql -> (substring: (#sql -> (find: ' FROM ')) + 1) ;\n\t\t#sql = (string_replaceregexp: #sql, -find='\\\\sLIMIT\\\\s+[0-9,]+', -replace='');\n\t\tif: (string_findregexp: #sql, -find= '\\\\sORDER\\\\s+BY\\\\s', -ignorecase) -> size;\n\t\t\t// remove ORDER BY statement since it causes problems with field aliases\n\t\t\t// first normalize the expression so we can find it with simple string expression later\n\t\t\t#sql = (string_replaceregexp: #sql, -find= '\\\\sORDER\\\\s+BY\\\\s', -replace=' ORDER BY ', -ignorecase);\n\t\t\t#sql = #sql -> (substring: 1, (#sql -> (find: ' ORDER BY ')) -1);\n\t\t/if;\n\telse; // query contains GROUP BY so use SQL_CALC_FOUND_ROWS which can be much slower, see http://bugs.mysql.com/bug.php?id=18454\n\t\t#sql -> (removeleading: 'SELECT');\n\t\t#sql = 'SELECT SQL_CALC_FOUND_ROWS ' + #sql + ';SELECT FOUND_ROWS() AS found_rows';\n\t\t#sql = (string_replaceregexp: #sql, -find='\\\\sLIMIT\\\\s+[0-9,]+', -replace=' LIMIT 1', -ignorecase);\n\t/if;\n\tinline: -sql=#sql;\n\t\tif: (field: 'found_rows') > 0;\n\t\t\treturn: integer: (field: 'found_rows'); // exit here normally\n\t\t/if;\n\t/inline;\n\t// fallback\n\treturn: found_count;\n/define_tag;\t\n\ndefine_tag:'IDcrypt', -description='Encrypts or Decrypts integer values',\n\t-namespace='knop_',\n\t-required='value',\n\t-optional='seed',\n\t-priority='replace';\n/*\n\n[IDcrypt]\nEncrypts or Decrypts integer values\n\nAuthor: Pier Kuipers\nLast Modified: Jan. 29, 2007\nLicense: Public Domain\n\nDescription:\nThis tag was written to deal with \"scraping\" attacks where bots keep \nrequesting the same page with incremental id parameters, corresponding to \nmysql id columns. Rather than introducing a new column with a unique id, this \ntag will \"intelligently\" blowfish encrypt or decrypt existing id values.\n\n\nSample Usage:\n[local('myID' = (action_param('id')))]\n[IDcrypt(#myID)]\n\n[IDcrypt('35446')] -> j4b50f315238d68df\n\n[IDcrypt('j4b50f315238d68df')] -> 35446\n\n\n\nDownloaded from tagSwap.net on Feb. 07, 2007.\nLatest version available from .\n\n*/\n// if id values need to be retrieved from bookmarked urls, the tag's built-in seed value must be used,\n// or the seed value used must be guaranteed to be the same as when the value was encrypted!\t\t\n\n\tlocal('cryptvalue' = string);\n\t!local_defined('seed') ? local('seed' = knop_seed);\n\tLocal('RandChars' = 'AaBbCcDdEeFfGgHhiJjKkLmNnoPpQqRrSsTtUuVvWwXxYyZz');\n\tLocal('anyChar' = (#RandChars -> (Get:(Math_Random: -Min=1, -Max=(#RandChars->Size)))));\n// taken from Bil Corry's [lp_string_getNumeric]\n\tlocal('numericValue' = (string_findregexp((string: #value), -find='\\\\d')->(join:'')));\n\t\n\tif(\n\t\t(#numericValue == (integer(#value))) \n\t\t&& \n\t\t(((string(#value))->length) == ((string(#numericValue)) -> length))\n\t);\n// alpha character is inserted at beginning of encrypted string in case value needs to be\n// cast to a javascript variable, which cannot start with a number\t\t\n\t\t#cryptvalue = (#anyChar + (Encrypt_Blowfish(#value, -seed=#seed)));\n\telse(\n\t\t((((string(#value))->length) - 1) % 2 == 0)\n\t\t&&\n\t\t(((string(#value))->length) > 16)\n\t);\n\t\t#cryptvalue = (decrypt_blowfish((String_Remove: #value, -StartPosition=1, -EndPosition=1),-Seed=#seed));\n\telse;\n\t\t#cryptvalue = 0;\n\t/if;\n\t\n\tif(String_IsAlphaNumeric(#cryptvalue));\n\t\treturn(#cryptvalue);\n\telse;\n// successfully decrypted values resulting in lots of strange characters are probably\n// the result of someone guessing a value\t\t\n\t\treturn(0);\n\t/if;\n\n/define_tag;\n\n\n\ndefine_type: 'timer', -description='Utility type to provide a simple timer',\n\t-namespace='knop_';\n\t/*\n\t\n\tCHANGE NOTES\n\t2007-06-17\tJS\tCreated the type\n\t\n\t*/\n\n\tlocal: 't'=integer;\n\tdefine_tag: 'oncreate';\n\t\t(self -> 't') = _date_msec;\n\t/define_tag;\n\tdefine_tag: 'onconvert';\n\t\treturn: _date_msec - (self -> 't');\n\t/define_tag;\n\t\n/define_type;\n\ndefine_tag: 'cachestore', -description='Stores all instances of page variables of the specified type in a cache object. Caches are stored \\\n\t\tin a global variable named by host name and document root to isolate the storage of different hosts. \\n\\\n\t\tParameters:\\n\\\n\t\t-type (required string) Page variables of the specified type will be stored in cache. Data types can be specified with or without namespace.\\n\\\n\t\t-expires (optional integer) The number of seconds that the cached data should be valid. Defaults to 600 (10 minutes)\\n\\\n\t\t-session (optional string) The name of an existing session to use for cache storage instead of the global storage\\n\\\n\t\t-name (optional string) Extra name parameter to be able to isolate the cache storage from other sites on the same virtual hosts, or caches for different uses. ',\n\t-namespace='knop_',\n\t-required='type', -type='string',\n\t-optional='expires', -type='integer', // seconds\n\t-optional='session', -type='string',\n\t-optional='name', -type='string';\n\n\tlocal: 'data'=map;\n\t!(local_defined: 'expires') ? local: 'expires'=600; // default seconds\n\t// store all page vars of the specified type\n\titerate: vars -> keys, local: 'item';\n\t\tif: (var: #item) -> isa(#type);\n\t\t\t#data -> insert(#item = (var: #item));\n\t\t/if;\n\t/iterate;\n\tif: (local_defined: 'session');\n\t\t//fail_if: (session_id: -name=#session) -> size == 0, -1, 'Cachestore with -session requires that the specified session is started';\n\t\tlocal: 'cache_name' = '_knop_cache_' + (local: 'name');\n\t\tsession_addvar: -name=#session, #cache_name;\n\t\t!((var: #cache_name) -> isa('map')) ? var: #cache_name = map;\n\t\t(var: #cache_name) -> insert(#type = (map: \n\t\t\t'content'=#data, \n\t\t\t'timestamp'=date, \n\t\t\t'expires'=(date + (duration: -second=#expires))));\n\telse;\n\t\tlocal: 'cache_name'='knop_' + (local: 'name') + '_' + server_name + response_localpath;\n\t\t#cache_name -> removetrailing(response_filepath);\n\t\t// initiate thread RW lock\n\t\t!(global: 'rwlock_' + #cache_name) -> isa('rwlock') ? global: 'rwlock_' + #cache_name=Thread_RWLock;\n\t\t// create a reference to the lock\n\t\tlocal: 'lock'=@(global: 'rwlock_' + #cache_name);\n\t\t// lock for writing\n\t\t#lock -> writelock;\n\t\t// check and initiate the cache storage\n\t\t!((global: #cache_name) -> isa('map')) ? global: #cache_name = map;\n\t\t(global: #cache_name) -> insert(#type = (map: \n\t\t\t'content'=#data, \n\t\t\t'timestamp'=date, \n\t\t\t'expires'=(date + (duration: -second=#expires))));\n\t\t// unlock\n\t\t#lock -> writeunlock;\n\t/if;\n/define_tag;\n\ndefine_tag: 'cachefetch', -description='Recreates page variables from previously cached instances of the specified type, returns true if successful or false if there was no valid \\\n\t\texisting cache for the specified type. Caches are stored in a global variable named by host name and document root to isolate the storage of different hosts. \\n\\\n\t\tParameters:\\n\\\n\t\t-type (required string) Page variables of the specified type will be stored in cache. \\n\\\n\t\t-session (optional string) The name of an existing session to use for cache storage instead of the global storage\\n\\\n\t\t-name (optional string) Extra name parameter to be able to isolate the cache storage from other sites on the same virtual hosts. \\n\\\n\t\t-maxage (optional date) Cache data older than the date/time specified in -maxage will not be used.',\n\t-namespace='knop_',\n\t-required='type', -type='string',\n\t-optional='session', -type='string',\n\t-optional='name', -type='string',\n\t-optional='maxage', -type='date';\n\t\n\t\n\tlocal: 'data'=null;\n\tif: (local_defined: 'session');\n\t\t//fail_if: (session_id: -name=#session) -> size == 0, -1, 'Cachefetch with -session requires that the specified session is started';\n\t\tlocal: 'cache_name' = '_knop_cache_' + (local: 'name');\n\t\tif: (var: #cache_name) -> isa('map') \n\t\t\t&& (var: #cache_name) >> #type \n\t\t\t&& (var: #cache_name) -> find(#type) -> find('expires') > date;\n\t\t\tif(local_defined('maxage') \n\t\t\t\t&& var(#cache_name) -> find(#type) -> find('timestamp') < #maxage);\n\t\t\t\t// cached data too old\n\t\t\telse;\n\t\t\t\t#data = (var: #cache_name) -> find(#type) -> find('content');\n\t\t\t/if;\n\t\t/if;\n\telse;\n\t\tlocal: 'cache_name'='knop_' + (local: 'name') + '_' + server_name + response_localpath;\n\t\t#cache_name -> removetrailing(response_filepath);\n\t\t// initiate thread RW lock\n\t\t!(global: 'rwlock_' + #cache_name) -> isa('rwlock') ? global: 'rwlock_' + #cache_name=Thread_RWLock;\n\t\t// create a reference to the lock\n\t\tlocal: 'lock'=@(global: 'rwlock_' + #cache_name);\n\t\t// lock for reading\n\t\t#lock -> readlock;\n\t\tif: (global: #cache_name) -> isa('map') \n\t\t\t&& (global: #cache_name) >> #type \n\t\t\t&& (global: #cache_name) -> find(#type) -> find('expires') > date;\n\t\t\tif(local_defined('maxage') \n\t\t\t\t&& global(#cache_name) -> find(#type) -> find('timestamp') < #maxage);\n\t\t\t\t// cached data too old\n\t\t\telse;\n\t\t\t\t#data = (global: #cache_name) -> find(#type) -> find('content');\n\t\t\t/if;\n\t\t/if;\n\t\t// unlock\n\t\t#lock -> readunlock;\n\t/if;\n\tif: #data -> isa('map');\n\t\titerate: #data, local: 'item';\n\t\t\tvar: (#item -> name) = #item -> value;\n\t\t/iterate;\n\t\treturn: true;\n\telse;\n\t\treturn: false;\n\t/if;\n/define_tag;\n\n\ndefine_tag: 'cachedelete', -description='Deletes the cache for the specified name (and optionally name). \\n\\\n\t\tParameters:\\n\\\n\t\t-type (required string) Page variables of the specified type will be stored in cache. \\n\\\n\t\t-session (optional string) The name of an existing session to use for cache storage instead of the global storage\\n\\\n\t\t-name (optional string) Extra name parameter to be able to isolate the cache storage from other sites on the same virtual hosts. ',\n\t-namespace='knop_',\n\t-required='type', -type='string',\n\t-optional='session', -type='string',\n\t-optional='name', -type='string'; // ignored for session\n\tif: (local_defined: 'session');\n\t\t//fail_if: (session_id: -name=#session) -> size == 0, -1, 'Cachestore with -session requires that the specified session is started';\n\t\tlocal: 'cache_name' = '_knop_cache_' + (local: 'name');\n\t\tsession_addvar: -name=#session, #cache_name;\n\t\t!((var: #cache_name) -> isa('map')) ? var: #cache_name = map;\n\t\t(var: #cache_name) -> remove(#type);\n\telse;\n\t\tlocal: 'cache_name'='knop_' + (local: 'name') + '_' + server_name + response_localpath;\n\t\t#cache_name -> removetrailing(response_filepath);\n\t\t// initiate thread RW lock\n\t\t!(global: 'rwlock_' + #cache_name) -> isa('rwlock') ? global: 'rwlock_' + #cache_name=Thread_RWLock;\n\t\t// create a reference to the lock\n\t\tlocal: 'lock'=@(global: 'rwlock_' + #cache_name);\n\t\t// lock for writing\n\t\t#lock -> writelock;\n\t\t// check and initiate the cache storage\n\t\t!((global: #cache_name) -> isa('map')) ? global: #cache_name = map;\n\t\t(global: #cache_name) -> remove(#type);\n\t\t// unlock\n\t\t#lock -> writeunlock;\n\t/if;\n\n/define_tag;\n\n\n?>\n[\n//------------------------------------------------------------------\n// End knop custom tags in util.inc\n//------------------------------------------------------------------\n\n//##################################################################\n\n][\n//------------------------------------------------------------------\n// Begin knop_base\n//------------------------------------------------------------------\n\n]error_msg: custom error numbers can now be added, even if the language already exists.\n2008-01-10\tJS\t->error_msg: improved reporting of custom error messages such as from bad database queries\n2007-12-13\tJS\tAdded -> error_lang to provide a reference to the knop_lang object for error messages, to be able to add localized error messages to any Knop type (except knop_lang and knop_base)\n2007-12-12\tJS\tAdded -html and -xhtml to ->help to get a nicely formatted output. \n2007-12-11\tJS\tCentralized ->error_code and ->error_msg to knop_base. Moved all error codes to error_msg\n2007-12-06\tJS\tChanged ->help to improve the self-documentation. It will now always return an up to date list of member tags and parameter. \n2007-11-05\tJS\tAdded var name to trace output\n2007-06-17\tJS\tAdded ->tagtime (was in nav earlier)\n2007-06-13\tJS\tAdded -> varname to be able to retreive the name of the page variable that a type instance is stored in.\n2007-06-13\tJS\tAdded -> xhtml to automatically sense if an xhtml doctype exists in the current page buffer. The result is cached in a page variable for performance. \n\t\t\t\tThis is for internal use for member tags that output html. \n2007-06-13\tJS\tIntroduced page variable $_knop_data for general page level storage and caching, common between different knop objects. \n2007-06-13\tJS\tCreated the data type\n\nTODO: ->help: add output option to format for Google Code Wiki\n->xhtml is not working properly when site is run by atbegin handler and explicitly writing to content_body \n\n\n*/\n\n\tlocal: 'debug_trace'=array,\n\t\t'_debug_trace'=array,\n\t\t'instance_unique'=null,\n\t\t'instance_varname'=null,\n\t\t'tagtime'=integer,\t\t\t\t// time for entire tag in ms\n\t\t'tagtime_tagname'=string,\n\t\t'error_code'=0,\n\t\t'error_msg'=string,\n\t\t'error_lang'=null,\t// must be defined as knop_lang in each type instead, to avoid recursion\n\t\t;\n\n\tdefine_tag: 'ondeserialize', -description='Recreates transient variables after coming back from a session';\n\t\tself -> properties -> first -> insert('_debug_trace'=array);\n\t/define_tag;\n\n\tdefine_tag: 'help', -description='Auto generates an overview of all member tags of a type, with all parameters specified for each member tag.', \n\t\t-optional='html',\n\t\t-optional='xhtml';\n\t\tlocal: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');\n\t\tlocal: 'eol'=(local_defined: 'html') || #endslash -> size ? '\\n' | '\\n';\n\n\t\tlocal: 'output'=string,\n\t\t\t'tags'=array,\n\t\t\t'description'=string,\n\t\t\t'parameters'=string;\n\t\t#output += (self -> type) + ' - version ' + (self -> 'version') + '\\n' ;\n\t\t#output += (self -> 'description') + '\\n\\n';\n\t\titerate: (self -> properties -> second) , local: 't';\n\t\t\t#tags -> (insert: #t);\n\t\t/iterate;\n\t\tif: (self -> parent -> type != 'null'); // this doesn't work\n\t\t\titerate: (self -> parent -> properties -> second) , local: 't';\n\t\t\t\t#tags -> (insert: #t);\n\t\t\t/iterate;\n\t\t/if;\n\t\t#tags -> sort;\n\t\titerate: #tags , local: 't';\n\t\t\t#parameters = string;\n\t\t\t#output += '-> ' + (#t -> name);\n\t\t\t#description=(#t -> value -> description);\n\t\t\titerate: (#t -> value -> paraminfo) , local: 'p';\n\t\t\t\tif: #description !>> '-' + (#p -> paramname);\n\t\t\t\t\t#parameters += '-' + (#p -> paramname) + ' (' (#p -> isrequired ? 'required' | 'optional') \n\t\t\t\t\t\t+ (#p -> paramtype != 'null' && #p -> paramtype -> size ? ' ' + (#p -> paramtype)) + ')\\n';\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t\t#output += (#description -> size || #parameters -> size ? '\\n' + #description);\n\t\t\t#output += (#description >> 'Parameters:' ? '\\n');\n\t\t\t#output += (#description !>> 'Parameters:' && #parameters -> size ? '\\nParameters:\\n');\n\t\t\t#output += (#parameters -> size ? #parameters);\n\t\t\t#output -> removetrailing('\\n');\n\t\t\t#output += '\\n\\n';\n\t\t/iterate;\n\t\tif: ((local_defined: 'html') && #html != false) || ((local_defined: 'xhtml') && #xhtml != false);\n\t\t\t#output = encode_html: #output;\n\t\t\t// normalize line breaks and convert to
\n\t\t\t#output -> (replace: '\\r\\n', '\\n') & (replace: '\\r', '\\n') & (replace: '\\n', #eol + '\\n');\n\t\t/if;\n\t\treturn: #output;\n\t/define_tag;\n\n\n\tdefine_tag: 'xhtml', -description='Internal. Finds out if xhtml output should be used. Looks at doctype unless -xhtml is specified \\\n\t\t\tin the params array. The result is cached in a page variable. \\n\\\n\t\t\tLooking at doctype doesn\\'t work when using atbegin driven solutions since content_body isn\\'t filled with the page buffer until the page has already been processed. ',\n\t\t-optional='params';\n\t\tif: (local_defined: 'params') && #params >> '-xhtml';\n\t\t\tlocal: 'xhtmlparam'=#params -> (find: '-xhtml') -> first;\n\t\t\tif: #xhtmlparam -> type == 'pair'; // -xhtml=true / -xhtml=false\n\t\t\t\treturn: boolean: (#xhtmlparam -> value);\n\t\t\telse; // plain -xhtml\n\t\t\t\treturn: true;\n\t\t\t/if;\n\t\t/if;\n\t\tif: (var: '_knop_data') -> type != 'map';\n\t\t\t$_knop_data = map;\n\t\t/if;\n\t\tif: $_knop_data !>> 'doctype_xhtml';\n\t\t\tlocal: 'doctype' = content_body -> (substring: 1, (content_body -> (find: '>')));\n\t\t\t$_knop_data -> (insert: 'doctype_xhtml' = (#doctype >> '> 'xhtml'));\n\t\t/if;\n\t\treturn: $_knop_data -> (find: 'doctype_xhtml');\n\t/define_tag;\n\n\n\tdefine_tag: 'error_lang', -description='Returns a reference to the language object used for error codes, to be able to add localized error messages to any Knop type (except knop_lang and knop_base)';\n\t\treturn: @(self -> 'error_lang');\n\t/define_tag;\n\n\tdefine_tag: 'error_code', -description='Either proprietary error code or standard Lasso error code';\n\t\t\t\treturn: integer: (self -> 'error_code');\n\t/define_tag;\n\n\tdefine_tag: 'error_msg',\n\t\t-optional='error_code', -type='integer', -copy;\n\t\t!(local_defined: 'error_code') ? local: 'error_code'=(self -> error_code);\n\t\tlocal: 'error_lang_custom'=(self -> 'error_lang');\n\t\tlocal: 'error_lang'=(knop_lang: -default='en', -fallback);\n\n\t\tlocal: 'errorcodes'=(map:\n\t\t\t0 = 'No error',\n\t\t\t-1728 = 'No records found', // standard Lasso error code\n\t\t\t\n\t\t\t// database errors 7000\n\t\t\t7001 ='The specified table was not found',\n\t\t\t7002 = 'Keyfield not specified',\n\t\t\t7003 = 'Lockfield not specified',\n\t\t\t7004 = 'User not specified for record lock',\n\t\t\t7005 = 'Either keyvalue or lockvalue must be specified for update or delete',\n\t\t\t7006 = 'Keyfield or keyvalue missing',\n\t\t\t7007 = 'Keyvalue missing',\n\t\t\t7008 = 'Keyvalue not unique',\n\t\t\t7009 = '-sql can not be used with FileMaker',\n\t\t\t7010 = 'Record locked by another user', // see error_data\n\t\t\t7011 = 'Record lock not valid any more',\n\t\t\t7012 = 'Could not set record lock', // see error_data\n\t\t\t7013 = 'Failed to clear record locks', // see error_data\n\t\t\t7016 = 'Add error', // see error_data\n\t\t\t7017 = 'Add failed, duplicate key value',\n\t\t\t7018 = 'Update error', // see error_data\n\t\t\t7019 = 'Delete error', // see error_data\n\t\t\t7020 = 'Keyfield not present in query',\n\t\t\t7021 = 'Lockfield not present in query',\n\t\t\t\n\t\t\t// form errors 7100\n\t\t\t7101 ='Form validation failed',\n\t\t\t7102 = 'Unsupported field type',\n\t\t\t7103 = 'Form->process requires that a database object is defined for the form',\n\t\t\t7104 = 'Copyfield must copy to a different field name',\n\n\t\t\t// grid errors 7200 \n\t\t\t\n\t\t\t// lang errors 7300\n\t\t\t\n\t\t\t// nav errors 7400\n\t\t\t\n\t\t\t// user errors 7500\n\t\t\t7501 = 'Authentication failed',\n\t\t\t7502 = 'Username or password missing',\n\t\t\t7503 = 'Client fingerprint has changed'\n\t\t\t\n\t\t\t);\n\t\t#error_lang -> (addlanguage: -language='en', -strings=@#errorcodes);\n\t\t// add any custom error strings\n\t\titerate(#error_lang_custom -> 'strings', local('custom_language'));\n\t\t\tif(#error_lang -> 'strings' !>> #custom_language -> name);\n\t\t\t\t// add entire language at once\n\t\t\t\t#error_lang -> addlanguage(-language=#custom_language -> name, -strings=#custom_language -> value);\n\t\t\telse;\n\t\t\t\t// add one string at a time\n\t\t\t\titerate(#custom_language -> value, local('custom_string'));\n\t\t\t\t\t#error_lang -> insert(-language=#custom_language -> name, \n\t\t\t\t\t\t-key=#custom_string -> name, \n\t\t\t\t\t\t-value=#custom_string -> value);\n\t\t\t\t/iterate;\n\t\t\t/if;\n\t\t/iterate;\n\t\t\n\t\tif: #errorcodes >> #error_code;\n\t\t\t// return error message defined by this tag\n\t\t\tif: #error_lang -> keys >> #error_code;\n\t\t\t\treturn: #error_lang -> (getstring: #error_code);\n\t\t\telse;\n\t\t\t\treturn: #errorcodes -> (find: #error_code);\n\t\t\t/if;\n\t\telse;\n\t\t\tif: (self -> 'error_msg') != '';\n\t\t\t\t// return literal error message\n\t\t\t\treturn: (self -> 'error_msg');\n\t\t\telse;\n\t\t\t\t// test for error known by lasso\n\t\t\t\terror_code = #error_code;\n\t\t\t\t// return Lasso error message\n\t\t\t\treturn: error_msg;\n\t\t\t/if;\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'varname', -description='Returns the name of the variable that this type instance is stored in.';\n\t\tlocal: 'timer'=knop_timer;\n\t\tif: self -> 'instance_unique' == null;\n\t\t\tself -> 'instance_unique' = knop_unique;\n\t\t/if;\n\t\tif: self -> 'instance_varname' == null;\n\t\t\t// look for the var name and store it in instance variable\n\t\t\titerate: (vars -> keys), (local: 'varname');\n\t\t\t\tif: (var: #varname) -> type == self -> type \n\t\t\t\t\t&& ((var: #varname) -> 'instance_unique') == (self -> 'instance_unique');\n\t\t\t\t\t(self -> 'instance_varname')=#varname;\n\t\t\t\t\tloop_abort;\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t/if;\n\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer;\n\t\treturn: self -> 'instance_varname';\n\t/define_tag;\n\n\tdefine_tag: 'trace', -description='Returns the debug trace for a type instance',\n\t\t-optional='html',\n\t\t-optional='xhtml';\n\n\t\tlocal: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');\n\t\tlocal: 'eol'=(local_defined: 'html') || #endslash -> size ? '\\n' | '\\n';\n\t\tlocal: 'trace'=(self -> 'debug_trace');\n\t\t(self -> '_debug_trace') -> isa('array') ? #trace -> merge(self -> '_debug_trace');\n\t\treturn: #eol + 'Debug trace for ' + (self -> type ) + ' $' + (self -> varname) + #eol \n\t\t\t+ #trace -> (join: #eol) + #eol;\n\n\t/define_tag;\n\n\n\tdefine_tag: 'tagtime', -description='Returns the time it took to execute the last executed member tag for a type instance.',\n\t\t-optional='html',\n\t\t-optional='xhtml';\n\t\t/* Standard timer code\n\t\tAt beginning of tag code:\n\t\tlocal: 'timer'=knop_timer; \n\t\t\n\t\tBefore the end of tag code (before return):\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t\n\t\t*/\n\t\tlocal: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');\n\n\t\t((local_defined: 'html') || (local_defined: 'xhtml')) ? return: (self -> type) + '->' + (self -> 'tagtime_tagname') + ': ' + (self -> 'tagtime') + ' ms';\n\t\treturn: (self -> 'tagtime');\n\t/define_tag;\n\n/define_type;\n\n\n\n?>\n[\n//------------------------------------------------------------------\n// End knop_base\n//------------------------------------------------------------------\n\n//##################################################################\n\n][\n//------------------------------------------------------------------\n// Begin knop_database\n//------------------------------------------------------------------\n\n]settable: removed reference for -table\n2009-09-18\tJS\tSyntax adjustments for Lasso 9\n2009-06-26\tJS\t->nextrecord: Added deprecation warning\n2009-05-15\tJS\t->field: corrected the verification of the -index parameter\n2009-01-09\tJS\tAdded a check before calling resultset_count so it will not break in Lasso versions before 8.5\n2009-01-09\tJS\t->_unknowntag: fixed incorrect debug_trace\n2008-12-03\tJS\t->addrecord: improved how keyvalue is returned when adding records\n2008-12-03\tJS\t->addrecord: inserting a generated keyvalue can now be suppressed by specifying -keyvalue=false\n2008-12-03\tJS\t->saverecord and ->deleterecord will now use the current keyvalue (if any), so -keyvalue will not have to be specified in that case. \n2008-11-25\tJS\t->field and ->recorddata will no longer touch current_record if it was zero\n2008-11-24\tJS\t->field: Added -index parameter to be able to access any occurrence of the same field name\n2008-11-24\tJS\tAdded -> records that returns a new data type knop_databaserows\n2008-11-24\tJS\t->resultset_count: added support for -inlinename. \n2008-11-24\tJS\tChanged ->nextrecord to ->next. ->nextrecord remains supported for backwards compatibility.\n2008-11-14\tJS\t->nextrecord resets the record pointer when reaching the last record\n2008-11-13\tJS\t->recorddata now honors the current record pointer (as incremented by -nextrecord)\n2008-11-13\tJS\t->recorddata: added -recordindex parameter so a specific record can be returned instead of the first found.\n2008-10-30\tJS\t->getrecord now REALLY works with integer keyvalues (double oops) - I thought I fixed it 2008-05-28 but misplaced a paren...\n2008-09-26\tJS\tAdded -> resultset_count corresponding to the same Lasso tag, so [resultset]...[/resultset] can now be used through the use of inlinename.\n2008-09-10\tJS\t-> getrecord, ->saverecord, ->deleterecord: Corrected handling of lock user to work better with knop_user\n2008-07-09\tJS\t->saverecord: -keeplock now updates the lock timestamp\n2008-05-28\tJS\t->getrecord now works with integer keyvalues (oops)\n2008-05-27\tJS\t->get returns a new datatype knop_databaserow \n2008-05-27\tJS\tAdded ->size and ->get so a database object can be iterated. When iterating each row is returned as an array of field values. \n2008-05-27\tJS\tAddedd ->nextrecord that increments the recordpointer each time it is called until the last record in the found set is reached. Returns true as long as there are more records. Useful in a while loop - see example below\n2008-05-27\tJS\tImplemented record pointer 'current_record'. The record pointer is reset for each new query. \n2008-05-27\tJS\t->field: added -recordindex to get data from any record in the current found set\n2008-05-27\tJS\tAdded ->_unknowntag as shortcut to field\n2008-05-26\tJS\tRemoved onassign since it causes touble\n2008-05-26\tJS\tExtended field_names to return the field names for any specified table, return field names also for db objects that have never been used for a database query and optionally return field types\n2008-01-29\tJS\t->getrecord now supports -sql. Make sure that the SQL statement includes the relevant keyfield (and lockfield if locking is used). \n2008-01-10\tJS\t->capturesearchvars: error_code and error_msg was mysteriously not set after database operations that caused errors. \n2008-01-08\tJS\t->saverecord: added flag -keeplock to be able to save a locked record without releasing the lock\n2007-12-15\tJS\tAdding support for knop_user in record locking is in progress. Done for ->oncreate and ->getrecord. \n2007-12-11\tJS\tMoved error_code and error_msg to knop_base\n2007-12-11\tJS\tAdded documentation as -description to most member tags, to be used by the new ->help tag\n2007-12-11\tJS\tMoved ->help to knop_base\n2007-12-10\tJS\tAdded ->settable to be able to copy an existing database object and properly set a new table name for it. Faster than creating a new instance from scratch. \n2007-12-03\tJS\tCorrected shown_first once again, hoping it's right this time\n2007-11-29\tJS\tAdded support for field_names and corresponding member tag ->field_names\n2007-11-05\tJS\tAdded var name to trace output\n2007-10-26\tJS\t->capturesearchvars: corrected shown_first when no records found\n2007-10-26\tJS\t->oncreate: added default value \"keyfield\" if the -keyfield parameter is not specified\n2007-09-06\tJS\tCorrected self -> 'tagtime' typo\n2007-06-18\tJS\tAdded tag timer to most member tags\n2007-06-13\tJS\tadded inheritance from knop_base\n2007-06-11\tJC\tadded handling of xhtml output\n2007-05-30\tJS\tChanged recordid_value to keyfield_value and -recordid to -keyvalue\n2007-05-28\tJS\t->oncreate: Added clearing of current error at beginning of tag\n2007-04-19\tJS\tCorrected the handling of -maxrecords and -skiprecords for SQL selects that have LIMIT specified\n2007-04-19\tJS\tImproved handling of foundrows so it finds any whitespace around SQL keywords, instead of just plain spaces\n2007-04-18\tJS\t->select now populates recorddata with all the fields for the first found record. Previously it only populated recorddata when there was 1 found record. \n2007-04-12\tJS\t->oncreate: Added authentication inline around Database_TableNames../Database_TableNames\n2007-04-10\tJS\t->oncreate: Improved validation of table name (table_realname can sometimes be null even for valid table names)\n2007-04-03\tJS\tChanged namespace from mt_ to knop_\n2007-02-02\tJS\tImproved reporting of Lasso error messaged in error_msg\n2007-01-30\tJS \tAdded real error codes and additional error data for some errors (like record locked)\n2007-01-30\tJS\tChanged -keyvalue parameters to copy value instead of pass as reference, to not cause problems when using keyvalue from the same db object as is being updated, for example $db->(saverecord: -keyvalue=$db->keyvalue)\n2007-01-26\tJS\tAdjusted affectedrecord_keyvalue so it's only captured for -add and -update\n2007-01-23\tJS\tSupports -uselimit (or querys that use LIMIT) and still gets proper searchresult vars (using a separate COUNT(*) query) - may not always get the right result for example for queries with GROUP BY\n2007-01-23\tJS\t-keyfield can be specified for saverecord to override the default\n2007-01-23\tJS\tChanged name of ->updaterecord to ->saverecord\n2007-01-23\tJS \tFixed bug where keyfield was missing as returnfield when looking up locked record for deleterecord\n2007-01-23\tJS\tAdded ->field\n2007-01-19\tJS\tAdded maxrecords_value and skiprecords_value to searchresultvars\n2007-01-18\tJS\tAdded affectedrecord_keyvalue to make it possible to highlight affected record in record list (grid)\n\n\nTODO:\nAllow -keyfield to be specified for ->addrecord and ->deleterecord\nAdd some Active Record similar functionality for editing\nLook at making it so -table can be set dynamically instead of fixed at oncreate, to eliminate the need for one db object for each table. This can cause problems with record locks and how they interact with knop_user \ndatetime_create and datetime_mod, and also user_create and user_mod.\n\tUse default field names but allow to override at oncreate, and verify them at oncreate before trying to use them. \n\n\n*/\n\n\t// instance variables\n\t// these variables are set once\n\tlocal: 'database'=string,\n\t\t'table'=string,\n\t\t'table_realname'=string,\t// the actual table name, to be used in SQL statements (in case the table name is aliased in Lasso)\n\t\t'username'=string,\n\t\t'password'=string,\n\t\t'db_connect'=array,\n\t\t'host'=array,\t\t\t\t// add support for inline host method\n\t\t'datasource_name'=string,\n\t\t'isfilemaker'=false,\n\t\t'lock_expires'=1800,\t\t// seconds before a record lock expires\n\t\t'lock_seed'=knop_seed,\t\t// encryption seed for the record lock\n\t\t'error_lang'=(knop_lang: -default='en', -fallback),\n\t\t'user'=null,\t\t\t\t// knop_user that will be used for record locking\n\t\t'databaserows_map'=map;\t\t// map to hold databaserows for each inlinename\n\n\t// these variables are set for each query\n\tlocal: 'inlinename'=string,\t\t\t// the inlinename that holds the result of the latest db operation\n\t\t'keyfield'=string,\n\t\t'keyvalue'=null,\n\t\t'affectedrecord_keyvalue'=null,\t// keyvalue of last added or updated record (not reset by other db actions)\n\t\t'lockfield'=string,\n\t\t'lockvalue'=null,\n\t\t'lockvalue_encrypted'=null,\n\t\t'timestampfield'=string,\t\t// for optimistic locking\n\t\t'timestampvalue'=string,\n\t\t'searchparams'=string,\t\t\t// the resulting pair array used in the database action\n\t\t'querytime'=integer,\t\t\t// query time in ms\n\t\t// 'tagtime'=integer,\t\tmoved to knop_base\n\t\t'recorddata'=map,\t\t\t\t// for single record results, a map of all returned db fields\n\t\t'error_data'=map,\t\t\t\t// additional data for certain errors\n\t\t'message'=string,\t\t\t\t// user message for normal result\n\t\t'current_record'=integer,\t\t// index of the current record to get field values from a specific record\n\t\t'field_names_map'=map,\n\t\t'resultset_count_map'=map;\t\t// resultset_count stored for each inlinename \n\t// these vars have directly corresponding Lasso tags so they can be set programatically\n\tlocal: 'searchresultvars'=(array: 'action_statement', 'found_count', 'shown_first', \n\t\t'shown_last', 'shown_count', 'field_names', 'records_array', 'maxrecords_value', 'skiprecords_value');\n\titerate: #searchresultvars, (local: 'resultvar');\n\t\tlocal(#resultvar = null);\n\t/iterate;\n\n\tlocal: 'errors_error_data'=(map: 7010, 7012, 7013, 7016, 7018, 7019); // these error codes can have more info in error_data map\n\n\tdefine_tag: 'oncreate',\n\t\t-required='database',\n\t\t-required='table',\n\t\t-optional='host',\t\t\t// add support for inline host method\n\t\t-optional='username',\n\t\t-optional='password',\n\t\t-optional='keyfield',\n\t\t-optional='lockfield',\n\t\t-optional='user',\n\t\t-optional='validate';\t\t// validate the database connection info (adds the overhead of making a test connection to the database)\n\t\tlocal: 'timer'=knop_timer; \n\t\t\n\t\t// reset error\n\t\terror_code = 0;\n\t\terror_msg = error_noerror;\n\t\n\t\t// validate database and table names to make sure they exist in Lasso\n\t\t(self -> 'datasource_name') = Lasso_DatasourceModuleName: #database;\n\t\tfail_if: error_code != 0, error_code, error_msg;\n\t\t\t\t\n\t\t// store params as instance variables\n\t\tlocal_defined('database') ? (self -> 'database') = @#database; \n\t\tlocal_defined('table') ? (self -> 'table') = @#table; \n\t\tlocal_defined('host') ? (self -> 'host') = @#host;\t// add support for inline host method\n\t\tlocal_defined('username') ? (self -> 'username') = @#username; \n\t\tlocal_defined('password') ? (self -> 'password') = @#password; \n\t\tlocal_defined('lockfield') ? (self -> 'lockfield') = @#lockfield; \n\t\tlocal_defined('user') ? (self -> 'user') = @#user;\n\t\t\t// param has default value\n\t\t(self -> 'keyfield') = (local_defined('keyfield') \n\t\t\t\t\t\t\t\t? @#keyfield // use parameter value\n\t\t\t\t\t\t\t\t| 'keyfield'); // use default value\n\n\t\t\n\t\t// build inline connection array\n\t\tlocal_defined('database') ? (self -> 'db_connect') -> insert('-database' = @#database);\n\t\tlocal_defined('table') ? (self -> 'db_connect') -> insert('-table' = @#table);\n\t\tlocal_defined('host') ? (self -> 'db_connect') -> insert('-host' = @#host);\t// add support for inline host method\n\t\tlocal_defined('username') ? (self -> 'db_connect') -> insert('-username' = @#username);\n\t\tlocal_defined('password') ? (self -> 'db_connect') -> insert('-password' = @#password);\n\n\t\t(self -> 'table_realname') = (table_realname: #database, #table);\n\t\tif: (self -> 'table_realname') == null;\n\t\t\t// verify that the table exists even if table_realname is null\n\t\t\tinline: (self -> 'db_connect');\n\t\t\t\tDatabase_TableNames: #database;\n\t\t\t\t\tif: Database_TableNameItem == #table;\n\t\t\t\t\t\t(self -> 'table_realname') = #table;\n\t\t\t\t\t\tloop_abort;\n\t\t\t\t\t/if;\n\t\t\t\t/Database_TableNames;\n\t\t\t/inline;\n\t\t/if;\n\t\tfail_if: (self -> 'table_realname') == null, 7001, self -> error_msg(7001); // The specified table was not found\n\t\t\n\t\tif: (local_defined: 'validate');\n\t\t\t// validate db connection\n\t\t\tinline: (self -> 'db_connect');\n\t\t\t\tfail_if: error_code != 0, error_code, error_msg;\n\t\t\t/inline;\n\t\t/if;\n\n\t\tif: Lasso_DatasourceIsFilemaker: #database || Lasso_DatasourceIsFilemakerSA: #database;\n\t\t\t(self -> 'isfilemaker') = true;\n\t\t/if;\n\t\t(self -> 'debug_trace') -> (insert: tag_name + ': creating database object on ' + (self -> 'datasource_name') +', isfilemaker: ' + (self -> 'isfilemaker') + ' at ' + (date -> (format: '%Q %T')));\n\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\n\t/define_tag;\n\t\n\t/* \n\tdefine_tag: 'onassign', -required='value', -description='Internal, needed to restore references when ctype is defined as prototype';\n\t\t// recreate references here\n\t\t(self -> 'user') = @(#value -> 'user');\n\t/define_tag;\n\t*/\n\n\tdefine_tag('_unknowntag', -description='Shortcut to field');\n\t\tif((self -> 'field_names_map') >> tag_name);\n\t\t\treturn(self -> field(tag_name));\n\t\telse;\n\t\t\t//fail(-9948, self -> type + '->' + tag_name + ' not known.');\n\t\t\t(self -> 'debug_trace') -> insert(self -> type + '->' + tag_name + ' not known.');\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'settable',\t-description='Changes the current table for a database object. Useful to be able to create \\\n\t\tdatabase objects faster by copying an existing object and just change the table name. This is a little bit faster \\\n\t\tthan creating a new instance from scratch, but no table validation is performed. Only do this to add database \\\n\t\tobjects for tables within the same database as the original database object. ',\n\t\t-required='table', -type='string';\n\t\tlocal: 'timer'=knop_timer; \n\t\n\t\t(self -> 'error_code')=0;\n\t\t(self -> 'error_msg')=string;\n\t\t(self -> 'table_realname') = #table;\n\t\t(self -> 'db_connect') -> removeall(#table);\n\t\t(self -> 'db_connect') -> (insert: '-table' = #table);\n\t\t(self -> 'table_realname') = (table_realname: self -> 'database', #table);\n\t\tif: (self -> 'table_realname') == null;\n\t\t\t// verify that the table exists even if table_realname is null\n\t\t\tinline: (self -> 'db_connect');\n\t\t\t\tDatabase_TableNames: (self -> 'database');\n\t\t\t\t\tif: Database_TableNameItem == #table;\n\t\t\t\t\t\t(self -> 'table_realname') = #table;\n\t\t\t\t\t\tloop_abort;\n\t\t\t\t\t/if;\n\t\t\t\t/Database_TableNames;\n\t\t\t/inline;\n\t\t/if;\n\t\tfail_if: (self -> 'table_realname') == null, 7001, self -> error_msg(7001); // The specified table was not found\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'select', -description='perform database query, either Lasso-style pair array or SQL statement.\\\n\t\t\t ->recorddata returns a map with all the fields for the first found record. \\\n\t\t\t If multiple records are returned, the records can be accessed either through ->inlinename or ->records_array.\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-search (optional array) Lasso-style search parameters in pair array\\n\\\n\t\t\t-sql (optional string) Raw sql query\\n\\\n\t\t\t-keyfield (optional) Overrides default keyfield, if any\\n\\\n\t\t\t-keyvalue (optional)\\n\\\n\t\t\t-inlinename (optional) Defaults to autocreated inlinename',\n\t\t-optional='search', -type='array',\n\t\t-optional='sql', -type='string',\n\t\t-optional='keyfield',\n\t\t-optional='keyvalue', -copy,\n\t\t-optional='inlinename', -copy;\n\n\t\tknop_debug(self->type + ' -> ' + tag_name, -open, -type=self->type);\n\t\thandle;\n\t\t\t//knop_debug(-close, -witherrors, -type=self->type);\n\t\t\tknop_debug('Done with ' + self->type + ' -> ' + tag_name, -close, -witherrors, -time);\n\t\t/handle;\n\t\tlocal: 'timer'=knop_timer; \n\n\t\t// clear all search result vars\n\t\tself -> reset;\n\t\t\n\t\tlocal: '_search'=(local: 'search'),\n\t\t\t'_sql'=(local: 'sql');\n\t\tif: #_search -> type != 'array';\n\t\t\t#_search = array;\n\t\t/if;\n\t\tif: #_sql != '' && (self -> 'isfilemaker');\n\t\t\t#_sql='';\n\t\t\tfail: 7009, self -> error_msg(7009); // sql can not be used with filemaker\n\t\t/if;\n\t\t// inlinename defaults to a random string\n\t\t(self -> 'inlinename') = ((local: 'inlinename') != '' ? #inlinename | 'inline_' + knop_unique);\n\t\t#_search -> (removeall: -inlinename);\n\t\t#_search -> (insert: -inlinename=(self -> 'inlinename'));\n\t\t\n\t\t// remove all database actions from the search array\n\t\t#_search -> (removeall: -search) & (removeall: -add) & (removeall: -delete) & (removeall: -update) \n\t\t\t& (removeall: -sql) & (removeall: -nothing) & (removeall: -show)\n\t\t\t// & (removeall: -table) // table is ok to override\n\t\t\t& (removeall: -database);\n\n\t\tif: (local: 'sql') != '' && (string_findregexp: #sql, -find='\\\\bLIMIT\\\\b', -ignorecase) -> size;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': grabbing -maxrecords and -skiprecords from search array');\n\t\t\t// store maxrecords and skiprecords for later use\n\t\t\tif: #_search >> '-maxrecords';\n\t\t\t\t(self -> 'maxrecords_value') = #_search -> (find: '-maxrecords') -> last -> value;\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': -maxrecords value found in search array ' + (self -> 'maxrecords_value'));\n\t\t\t/if;\n\t\t\tif: #_search >> '-skiprecords';\n\t\t\t\t(self -> 'skiprecords_value') = #_search -> (find: '-skiprecords') -> last -> value;\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': -skiprecords value found in search array ' + (self -> 'skiprecords_value'));\n\t\t\t/if;\n\t\t\t// remove skiprecords from the actual search parameters since it will conflict with LIMIT\n\t\t\t#_search -> (removeall: '-skiprecords');\n\t\t/if;\n\n\t\tif: !(local_defined: 'keyfield') && (self -> 'keyfield') != '';\n\t\t\tlocal: 'keyfield'=(self -> 'keyfield');\n\t\t/if;\n\t\tif: (local: 'keyfield') != '';\n\t\t\t#_search -> (removeall: '-keyfield');\n\t\t\tif: !(self -> 'isfilemaker');\n\t\t\t\t#_search -> (insert: '-keyfield'=#keyfield);\n\t\t\t/if;\n\t\t\tif: (local: 'keyvalue') != '';\n\t\t\t\t#_search -> (removeall: '-keyvalue');\n\t\t\t\tif: (self -> 'isfilemaker');\n\t\t\t\t\t#_search -> (insert: '-op'='eq');\n\t\t\t\t\t#_search -> (insert: #keyfield=#keyvalue);\n\t\t\t\telse;\n\t\t\t\t\t#_search -> (insert: '-keyvalue'=#keyvalue);\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t/if;\n\n\t\t// add sql action or normal search action\n\t\tif: #_sql != '';\n\t\t\t#_search -> (insert: '-sql'=#_sql);\n\t\telse;\n\t\t\t#_search -> (insert: '-search');\n\t\t/if;\n\t\t// perform database query, put connection parameters last to override any provided by the search parameters\n\t\t//(self -> 'debug_trace') -> (insert: tag_name + ': search ' + #_search);\n\t\tlocal: 'querytimer'=knop_timer;\n\t\tinline: #_search,(self -> 'db_connect');\n\t\t\t(self -> 'querytime') = integer: #querytimer;\n\t\t\t(self -> 'searchparams') = #_search;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name ': action_statement ' + action_statement);\n\t\t\tknop_debug(action_statement, -sql);\n\t\t\tknop_debug(found_count ' found');\n\t\t\tself -> capturesearchvars;\n\t\t/inline;\n\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t(self -> 'debug_trace') -> (insert: tag_name + ': found ' (self -> 'found_count') + ' records in ' + (self -> 'querytime') + ' ms, tag time ' + (self -> 'tagtime') + ' ms, ' + (self -> error_msg) + ' ' + (self -> error_code));\n\t/define_tag;\n\n\n\tdefine_tag: 'addrecord', -description='Add a new record to the database. A random string keyvalue will be generated unless a -keyvalue is specified. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-fields (required array) Lasso-style field values in pair array\\n\\\n\t\t\t-keyvalue (optional) If -keyvalue is specified, it must not already exist in the database. Specify -keyvalue=false to prevent generating a keyvalue. \\n\\\n\t\t\t-inlinename (optional) Defaults to autocreated inlinename',\n\t\t-required='fields', -type='array',\n\t\t-optional='keyvalue', -copy,\n\t\t-optional='inlinename';\n\t\tlocal: 'timer'=knop_timer; \n\n\t\t// clear all search result vars\n\t\tself -> reset;\n\t\tlocal: '_fields'=#fields;\n\t\t\n\t\t// remove all database actions from the search array\n\t\t#_fields -> (removeall: '-search') & (removeall: '-add') & (removeall: '-delete') & (removeall: '-update') \n\t\t\t& (removeall: '-sql') & (removeall: '-nothing') & (removeall: '-show')\n\t\t\t// & (removeall: '-table') // table is ok to override\n\t\t\t& (removeall: '-database');\n\n\t\tinline: (self -> 'db_connect'); // connection wrapper\n\t\t\tif: (local: 'keyvalue') != '' && (local: 'keyvalue') !== false && (self -> 'keyfield')!='';\n\t\t\t\t// look for existing keyvalue\n\t\t\t\tinline: -op='eq', (self -> 'keyfield')=#keyvalue, \n\t\t\t\t\t-maxrecords=1,\n\t\t\t\t\t-returnfield=(self -> 'keyfield'),\n\t\t\t\t\t-search;\n\t\t\t\t\tif: found_count > 0;\n\t\t\t\t\t\t(self -> 'error_code') = 7017; // duplicate keyvalue\n\t\t\t\t\telse;\n\t\t\t\t\t\t(self -> 'keyvalue') = #keyvalue;\n\t\t\t\t\t/if;\n\t\t\t\t/inline;\n\t\t\t/if;\n\n\t\t\t\n\t\t\tif: (self -> 'error_code') == 0;\n\t\t\t\t// proceed to add record\n\n\t\t\t\tif: (self -> 'keyfield') != '';\n\t\t\t\t\tif: (local: 'keyvalue') == '' && (local: 'keyvalue') !== false;\n\t\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': generating keyvalue');\n\t\t\t\t\t\t// create unique keyvalue\n\t\t\t\t\t\t(self -> 'keyvalue')=knop_unique;\n\t\t\t\t\t/if;\n\t\t\t\t\t#_fields -> (removeall: (self -> 'keyfield'));\n\t\t\t\t\t#_fields -> (removeall: '-keyfield') & (removeall: '-keyvalue');\n\t\t\t\t\t#_fields -> (insert: '-keyfield'=(self -> 'keyfield'));\n\t\t\t\t\tif: (local: 'keyvalue') !== false;\n\t\t\t\t\t\t#_fields -> (insert: (self -> 'keyfield')=(self -> 'keyvalue'));\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\n\t\t\t\t// inlinename defaults to a random string\n\t\t\t\t(self -> 'inlinename') = ((local: 'inlinename') != '' ? #inlinename | 'inline_' + knop_unique);\n\t\t\t\t#_fields -> (removeall: '-inlinename');\n\t\t\t\t#_fields -> (insert: '-inlinename'=(self -> 'inlinename'));\n\t\t\t\t\n\t\t\t\tlocal: 'querytimer'=knop_timer;\n\t\t\t\tinline: #_fields, -add;\n\t\t\t\t\t(self -> 'querytime') = integer: #querytimer;\n\t\t\t\t\t(self -> 'searchparams') = #_fields;\n\t\t\t\t\n\t\t\t\t\tself -> capturesearchvars;\n\t\t\t\t\tif: error_code != 0;\n\t\t\t\t\t\t(self -> 'keyvalue') = null;\n\t\t\t\t\t/if;\n\t\t\t\t/inline;\n\t\t\t/if;\n\t\t/inline;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t(self -> 'debug_trace') -> (insert: tag_name + ': ' + (self -> error_msg) + ' ' + (self -> error_code) \n\t\t\t+ ' keyvalue ' + (self -> 'keyvalue') + ' ' + (self -> 'tagtime') + ' ms');\n\t/define_tag;\n\n\n\tdefine_tag: 'getrecord', -description='Returns a single specific record from the database, optionally locking the record. \\\n\t\t\tIf the keyvalue matches multiple records, an error is returned. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-keyvalue (optional) Uses a previously set keyvalue if not specified. If no keyvalue is available, an error is returned unless -sql is used. \\n\\\n\t\t\t-keyfield (optional) Temporarily override of keyfield specified at oncreate\\n\\\n\t\t\t-inlinename (optional) Defaults to autocreated inlinename\\n\\\n\t\t\t-lock (optional flag) If flag is specified, a record lock will be set\\n\\\n\t\t\t-user (optional) The user who is locking the record (required if using lock)\\n\\\n\t\t\t-sql (optional) SQL statement to use instead of keyvalue. Must include the keyfield (and lockfield of locking is used).',\n\t\t-optional='keyvalue', -copy,\n\t\t-optional='keyfield',\n\t\t-optional='inlinename', -copy,\n\t\t-optional='lock',\n\t\t-optional='user', -copy,\n\t\t-optional='sql', -type='string';\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tlocal: '_sql'=(local: 'sql');\n\n\t\tif: #_sql != '' && (self -> 'isfilemaker');\n\t\t\t#_sql='';\n\t\t\tfail: 7009, self -> error_msg(7009); // sql can not be used with filemaker\n\t\t/if;\n\t\t\n\t\t// get existing record pointer if any\n\t\tif: #_sql -> size == 0 && !(local_defined: 'keyvalue');\n\t\t\tlocal: 'keyvalue'=(self -> 'keyvalue');\n\t\telse: !(local_defined: 'keyvalue');\n\t\t\tlocal: 'keyvalue'=string;\n\t\t/if;\n\n\t\t// clear all search result vars\n\t\tself -> reset;\n\t\t\n\t\tfail_if: !(local_defined: 'keyfield') && (self -> 'keyfield') == '', 7002, self -> error_msg(7002); // Keyfield not specified\n\t\tif: (local_defined: 'lock') && #lock != false;\n\t\t\tfail_if: (self -> 'lockfield') == '', 7003, self -> error_msg(7003); // Lockfield must be specified to get record with lock\n\t\t\tif: !(local_defined: 'user') && ((self -> 'user') != '' || (self -> 'user') -> isa('user'));\n\t\t\t\t// use user from database object\n\t\t\t\tlocal('user' = (self -> 'user'));\n\t\t\t/if;\n\t\t\tfail_if: (local: 'user') == '' && !((local: 'user') -> isa('user')), 7004, self -> error_msg(7004); // User must be specified to get record with lock\n\t\t\t(self -> 'debug_trace') -> insert(tag_name ': user is type ' + (#user -> type) + ', isa(user) = ' + (#user -> isa('user')) );\n\t\t\tif: #user -> isa('user');\n\t\t\t\t#user= #user -> id_user;\n\t\t\t\tfail_if: #user == '', 7004, self -> error_msg(7004); // User must be logged in to get record with lock\n\t\t\t/if;\n\t\t\t(self -> 'debug_trace') -> insert(tag_name ': user id is ' + #user);\n\t\t/if;\n\t\tif: !(local_defined: 'keyfield') && (self -> 'keyfield') != '';\n\t\t\tlocal: 'keyfield'=(self -> 'keyfield');\n\t\t/if;\n\t\tif: #_sql -> size == 0 && string(#keyvalue) -> size == 0;\n\t\t\t(self -> 'error_code') = 7007; // keyvalue missing\n\t\t/if;\n\t\tif: (self -> 'error_code') == 0;\n\t\t\tinline: (self -> 'db_connect'); // connection wrapper\n\n\t\t\t\tif: #_sql -> size;\n\t\t\t\t\tself -> (select: -sql=#_sql, -inlinename=(local: 'inlinename'));\n\t\t\t\t\t#keyvalue = (self -> 'keyvalue');\n\t\t\t\telse;\n\t\t\t\t\tself -> (select: -keyfield=#keyfield, -keyvalue=#keyvalue, -inlinename=(local: 'inlinename'));\n\t\t\t\t/if;\n\t\t\t\tif: (self -> field_names) !>> #keyfield;\n\t\t\t\t\t(self -> 'error_code') = 7020; // Keyfield not present in query\n\t\t\t\t/if;\n\t\t\t\tif: (self -> field_names) !>> (self -> 'lockfield') && (local_defined: 'lock') && #lock != false;\n\t\t\t\t\t(self -> 'error_code') = 7021; // Lockfield not present in query\n\t\t\t\t/if;\n\t\t\t\t\n\t\t\t\tif: (self -> 'found_count') == 0 && (self -> 'error_code') == 0;\n\t\t\t\t\t(self -> 'error_code') = -1728;\n\t\t\t\telse: (self -> 'found_count') > 1 && (self -> 'error_code') == 0;\n\t\t\t\t\tself -> reset;\n\t\t\t\t\t(self -> 'error_code') = 7008; // keyvalue not unique\n\t\t\t\t/if;\n\t\t\n\t\t\n\t\t\t\t// handle record locking\n\t\t\t\tif: (self -> 'error_code') == 0 && (local_defined: 'lock') && #lock != false;\n\t\t\t\t\t// check for current lock\n\t\t\t\t\tif: (self -> 'lockvalue') != '';\n\t\t\t\t\t\t// there is a lock already set, check if it has expired or if it is the same user\n\t\t\t\t\t\tlocal: 'lockvalue'=(self -> 'lockvalue') -> (split: '|');\n\t\t\t\t\t\tlocal: 'lock_timestamp'=date: (#lockvalue->size > 1 ? #lockvalue -> (get: 2) | null);\n\t\t\t\t\t\tlocal: 'lock_user'=#lockvalue -> first;\n\t\t\t\t\t\tif: (date - #lock_timestamp) -> seconds < (self -> 'lock_expires')\n\t\t\t\t\t\t\t&& #lock_user != #user;\n\t\t\t\t\t\t\t// the lock is still valid and it is locked by another user\n\t\t\t\t\t\t\t// this is not a real error, more a warning condition\n\t\t\t\t\t\t\t(self -> 'error_code') = 7010; \n\t\t\t\t\t\t\t(self -> 'error_data') = (map: 'user' = #lock_user, 'timestamp' = #lock_timestamp);\n\t\t\t\t\t\t\t(self -> 'keyvalue') = null;\n\t\t\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name ': record ' + #keyvalue + ' was already locked by ' + #lock_user + '.');\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/if;\n\t\t\t\t\tif: (self -> 'error_code') == 0;\n\t\t\t\t\t\t// go ahead and lock record\n\t\t\t\t\t\t(self -> 'lockvalue') = #user + '|' + (date -> format: '%Q %T');\n\t\t\t\t\t\t(self -> 'lockvalue_encrypted') = (encrypt_blowfish: (self -> 'lockvalue'), -seed=(self -> 'lock_seed'));\n\t\t\t\t\t\tlocal: 'keyvalue_temp'=#keyvalue;\n\t\t\t\t\t\tif: (self -> 'isfilemaker');\n\t\t\t\t\t\t\t// find internal keyvalue\n\t\t\t\t\t\t\tinline: -op='eq', #keyfield=#keyvalue,\n\t\t\t\t\t\t\t\t-search;\n\t\t\t\t\t\t\t\tif: found_count == 1;\n\t\t\t\t\t\t\t\t\t#keyvalue_temp=keyfield_value;\n\t\t\t\t\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': will set record lock for FileMaker record id ' + keyfield_value + ' ' + error_msg + ' ' + error_code);\n\t\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': could not get record id for FileMaker record, ' found_count + ' found ' + + error_msg + ' ' + error_code);\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\t/inline;\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\tinline: -keyfield=#keyfield,\n\t\t\t\t\t\t\t-keyvalue=#keyvalue_temp, \n\t\t\t\t\t\t\t(self -> 'lockfield')=(self -> 'lockvalue'),\n\t\t\t\t\t\t\t-update;\n\t\t\t\t\t\t\tif: error_code;\n\t\t\t\t\t\t\t\t(self -> 'error_code') = 7012; // could not set record lock\n\t\t\t\t\t\t\t\t(self -> 'error_data') = (map: 'error_code'=error_code, 'error_msg'=error_msg);\n\t\t\t\t\t\t\t\t(self -> 'lockvalue') = null;\n\t\t\t\t\t\t\t\t(self -> 'lockvalue_encrypted') = null;\n\t\t\t\t\t\t\t\t(self -> 'keyvalue') = null;\n\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\t// lock was set ok\n\t\t\t\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': set record lock ' + (self -> 'lockvalue') + ' ' + (self -> 'lockvalue_encrypted'));\n\t\t\t\t\t\t\t\tif: (self -> 'user') -> isa('user');\n\t\t\t\t\t\t\t\t\t// tell user it has locked a record in this db object\n\t\t\t\t\t\t\t\t\t(self -> 'user') -> addlock(-dbname=self -> varname);\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t/inline;\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t\t\n\t\t\t/inline;\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t(self -> 'debug_trace') -> (insert: tag_name + ': ' + (self -> error_msg) + ' ' + (self -> error_code) + ' ' + (self -> 'tagtime') + ' ms');\n\t/define_tag;\n\n\n\tdefine_tag: 'saverecord', -description='Updates a specific database record. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-fields (required array) Lasso-style field values in pair array\\n\\\n\t\t\t-keyfield (optional) Keyfield is ignored if lockvalue is specified\\n\\\n\t\t\t-keyvalue (optional) Keyvalue is ignored if lockvalue is specified\\n\\\n\t\t\t-lockvalue (optional) Either keyvalue or lockvalue must be specified\\n\\\n\t\t\t-keeplock (optional flag) Avoid clearing the record lock when saving. Updates the lock timestamp.\\n\\'\n\t\t\t-user (optional) If lockvalue is specified, user must be specified as well\\n\\\n\t\t\t-inlinename (optional) Defaults to autocreated inlinename',\n\t\t-required='fields', -type='array',\n\t\t-optional='keyfield',\n\t\t-optional='keyvalue', -copy,\n\t\t-optional='lockvalue', -copy,\n\t\t-optional='keeplock',\n\t\t-optional='user', -copy,\n\t\t-optional='inlinename', -copy;\n\t\t\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tif(!local_defined('keyvalue') && string(self -> 'keyvalue') -> size);\n\t\t\t// use current record's keyvalue if any\n\t\t\tlocal('keyvalue'=(self -> 'keyvalue'));\n\t\t/if;\n\n\t\t// clear all search result vars\n\t\tself -> reset;\n\n\t\tfail_if: !(local_defined: 'keyvalue') && !(local_defined: 'lockvalue'), 7005, self -> error_msg(7005); // Either keyvalue or lockvalue must be specified for update or delete\n\t\tfail_if: (local_defined: 'keyvalue') && (self -> 'keyfield') == '' && (local: 'keyfield') == '', 7002, self -> error_msg(7002); // Keyfield not specified\n\t\tif: (local_defined: 'lockvalue');\n\t\t\tfail_if: (self -> 'lockfield') == '', 7003, self -> error_msg(7003); // Lockfield not specified\n\t\t\tif: !(local_defined: 'user') && ((self -> 'user') != '' || (self -> 'user') -> isa('user'));\n\t\t\t\t// use user from database object\n\t\t\t\tlocal('user' = (self -> 'user'));\n\t\t\t/if;\n\t\t\tfail_if: (local: 'user') == '' && !((local: 'user') -> isa('user')), 7004, self -> error_msg(7004); \n\t\t\t(self -> 'debug_trace') -> insert(tag_name ': user is type ' + (#user -> type) + ', isa(user) = ' + (#user -> isa('user')) );\n\t\t\tif: #user -> isa('user');\n\t\t\t\t#user= #user -> id_user;\n\t\t\t\tfail_if: #user == '', 7004, self -> error_msg(7004); // User must be logged in to get record with lock\n\t\t\t/if;\n\t\t\t(self -> 'debug_trace') -> insert(tag_name ': user id is ' + #user);\n\t\t/if;\n\t\t\n\t\t!(local_defined: 'keyfield') ? local: 'keyfield'=self -> 'keyfield';\n\t\t\n\t\tlocal: '_fields'=#fields;\n\t\t\n\t\t// remove all database actions from the search array\n\t\t#_fields -> (removeall: '-search') & (removeall: '-add') & (removeall: '-delete') & (removeall: '-update') \n\t\t\t& (removeall: '-sql') & (removeall: '-nothing') & (removeall: '-show')\n\t\t\t// & (removeall: '-table') // table is ok to override\n\t\t\t& (removeall: '-database');\n\t\t#_fields -> (removeall: '-keyfield') & (removeall: '-keyvalue');\n\n\t\tinline: (self -> 'db_connect'); // connection wrapper\n\n\t\t\t// handle record locking\n\t\t\tif: (self -> 'error_code') == 0 && (local: 'lockvalue') != '';\n\n\t\t\t\t// first check if record was locked by someone else, and that lock is still valid\n\t\t\t\tlocal: 'lock'=(decrypt_blowfish: #lockvalue, -seed=(self -> 'lock_seed')) -> (split: '|');\n\t\t\t\tlocal: 'lock_timestamp'=date: (#lock->size > 1 ? (#lock -> (get: 2)) | null);\n\t\t\t\tlocal: 'lock_user'=#lock -> first;\n\t\t\t\tif: (date - #lock_timestamp) -> seconds < (self -> 'lock_expires')\n\t\t\t\t\t&& #lock_user != #user;\n\t\t\t\t\t// the lock is still valid and it is locked by another user\n\t\t\t\t\t(self -> 'error_code') = 7010; \n\t\t\t\t\t(self -> 'error_data') = (map: 'user' = #lock_user, 'timestamp' = #lock_timestamp);\n\t\t\t\t/if;\n\n\t\t\t\t// check that the current lock is still valid\n\t\t\t\tif: (self -> 'error_code') == 0;\n\t\t\t\t\tinline: -op='eq', (self -> 'lockfield')=#lock -> (join: '|'), \n\t\t\t\t\t\t-maxrecords=1,\n\t\t\t\t\t\t-returnfield=(self -> 'lockfield'),\n\t\t\t\t\t\t-returnfield=(self -> 'keyfield'),\n\t\t\t\t\t\t-search;\n\t\t\t\t\t\tif: error_code == 0 && found_count != 1;\n\t\t\t\t\t\t\t// lock is not valid any more\n\t\t\t\t\t\t\t(self -> 'error_code') = 7011; // Update failed, record lock not valid any more\n\t\t\t\t\t\telse: error_code != 0;\n\t\t\t\t\t\t\t(self -> 'error_code') = 7018; // Update error\n\t\t\t\t\t\t\t(self -> 'error_data') = (map: 'error_code'=error_code, 'error_msg'=error_msg);\n\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t// lock OK, grab keyvalue for update\n\t\t\t\t\t\t\tlocal: 'keyvalue'=(field: (self -> 'keyfield'));\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/inline;\n\t\t\t\t/if;\n\t\t\t\t\n\t\t\t\tif: (self -> 'error_code') == 0;\n\t\t\t\t\t// go ahead and release record lock by clearing the field value in the update fields array\n\t\t\t\t\t#_fields -> (removeall: (self -> 'lockfield'));\n\t\t\t\t\tif: ((local_defined: 'keeplock') && #keeplock != false);\n\t\t\t\t\t\t// update the lock timestamp\n\t\t\t\t\t\t(self -> 'lockvalue') = #user + '|' + (date -> format: '%Q %T');\n\t\t\t\t\t\t(self -> 'lockvalue_encrypted') = (encrypt_blowfish: (self -> 'lockvalue'), -seed=(self -> 'lock_seed'));\n\t\t\t\t\t\t#_fields -> (insert: (self -> 'lockfield')=(self -> 'lockvalue'));\n\t\t\t\t\telse;\n\t\t\t\t\t\t#_fields -> (insert: (self -> 'lockfield') = '');\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\n\t\t\t/if;\n\n\t\t\tif: (self -> 'error_code') == 0 && (local: 'keyvalue') != '';\n\t\t\t\tif: (self -> 'isfilemaker');\n\t\t\t\t\tinline: -op='eq', #keyfield=#keyvalue, -search;\n\t\t\t\t\t\tif: found_count == 1;\n\t\t\t\t\t\t\t#_fields -> (insert: '-keyvalue'=keyfield_value);\n\t\t\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': FileMaker record id ' + keyfield_value);\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/inline;\n\t\t\t\telse;\n\t\t\t\t\t#_fields -> (insert: '-keyfield'=#keyfield);\n\t\t\t\t\t#_fields -> (insert: '-keyvalue'=#keyvalue);\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\tif: (#_fields >> '-keyfield' && #_fields -> (find: '-keyfield') -> first -> value != '' || (self -> 'isfilemaker'))\n\t\t\t\t&& #_fields >> '-keyvalue' && #_fields -> (find: '-keyvalue') -> first -> value != '';\n\t\t\t\t// ok to update\n\t\t\telse: (self -> 'error_code') == 0;\n\t\t\t\t(self -> 'error_code') = 7006; // Update failed, keyfield or keyvalue missing';\n\t\t\t/if;\n\n\t\t\t// update record\n\t\t\tif: (self -> 'error_code') == 0;\n\n\t\t\t\t// inlinename defaults to a random string\n\t\t\t\t(self -> 'inlinename') = ((local: 'inlinename') != '' ? #inlinename | 'inline_' + knop_unique);\n\t\t\t\t#_fields -> (removeall: '-inlinename');\n\t\t\t\t#_fields -> (insert: '-inlinename'=(self -> 'inlinename'));\n\t\n\t\t\t\tlocal: 'querytimer'=knop_timer;\n\t\t\t\tinline: #_fields, -update;\n\t\t\t\t\t(self -> 'querytime') = integer: #querytimer;\n\t\t\t\t\t(self -> 'searchparams') = #_fields;\n\t\t\t\t\tself -> capturesearchvars;\n\t\t\t\t/inline;\n\t\t\t/if;\n\t\t/inline;\n\t\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t(self -> 'debug_trace') -> (insert: tag_name + ': ' + (self -> 'keyvalue') + ' '+ (self -> error_msg) + ' ' + (self -> error_code) + ' ' + (self -> 'tagtime') + ' ms');\n\t/define_tag;\n\n\n\tdefine_tag: 'deleterecord', -description='Deletes a specific database record. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-keyvalue (optional) Keyvalue is ignored if lockvalue is specified\\n\\\n\t\t\t-lockvalue (optional) Either keyvalue or lockvalue must be specified\\n\\\n\t\t\t-user (optional) If lockvalue is specified, user must be specified as well',\n\t\t-optional='keyvalue', -copy,\n\t\t-optional='lockvalue', -copy,\n\t\t-optional='user';\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tif(!local_defined('keyvalue') && string(self -> 'keyvalue') -> size);\n\t\t\t// use current record's keyvalue if any\n\t\t\tlocal('keyvalue'=(self -> 'keyvalue'));\n\t\t/if;\n\n\t\t// clear all search result vars\n\t\tself -> reset;\n\n\t\tfail_if: !(local_defined: 'keyvalue') && !(local_defined: 'lockvalue'), 7005, self -> error_msg(7005); // Either keyvalue or lockvalue must be specified for update or delete\n\t\tfail_if: (local_defined: 'keyvalue') && (self -> 'keyfield') == '', 7002, self -> error_msg(7002); // Keyfield not specified\n\t\tif: (local_defined: 'lockvalue');\n\t\t\tfail_if: (self -> 'lockfield') == '', 7003, self -> error_msg(7003); // Lockfield not specified\n\t\t\tif: !(local_defined: 'user') && ((self -> 'user') != '' || (self -> 'user') -> isa('user'));\n\t\t\t\t// use user from database object\n\t\t\t\tlocal('user' = (self -> 'user'));\n\t\t\t/if;\n\t\t\tfail_if: (local: 'user') == '' && !((local: 'user') -> isa('user')), 7004, self -> error_msg(7004); \n\t\t\t(self -> 'debug_trace') -> insert(tag_name ': user is type ' + (#user -> type) + ', isa(user) = ' + (#user -> isa('user')) );\n\t\t\tif: #user -> isa('user');\n\t\t\t\t#user= #user -> id_user;\n\t\t\t\tfail_if: #user == '', 7004, self -> error_msg(7004); // User must be logged in to get record with lock\n\t\t\t/if;\n\t\t\t(self -> 'debug_trace') -> insert(tag_name ': user id is ' + #user);\n\t\t/if;\n\t\t\n\t\tlocal: '_fields'=array;\n\t\t\n\t\tinline: (self -> 'db_connect'); // connection wrapper\n\n\t\t\t// handle record locking\n\t\t\tif: (self -> 'error_code') == 0 && (local: 'lockvalue') != '';\n\n\t\t\t\t// first check if record was locked by someone else, and that lock is still valid\n\t\t\t\tlocal: 'lockvalue'=(decrypt_blowfish: #lockvalue, -seed=(self -> 'lock_seed')) -> (split: '|');\n\t\t\t\tlocal: 'lock_timestamp'=date: (#lockvalue->size > 1 ? #lockvalue -> (get: 2) | null);\n\t\t\t\tlocal: 'lock_user'=(#lockvalue -> first);\n\t\t\t\tif: (date - #lock_timestamp) -> seconds < (self -> 'lock_expires')\n\t\t\t\t\t&& #lock_user != #user;\n\t\t\t\t\t// the lock is still valid and it is locked by another user\n\t\t\t\t\t(self -> 'error_code') = 7010; // Delete failed, record locked \n\t\t\t\t\t(self -> 'error_data') = (map: 'user' = #lock_user, 'timestamp' = #lock_timestamp);\n\t\t\t\t/if;\n\n\t\t\t\t// check that the current lock is still valid\n\t\t\t\tif: (self -> 'error_code') == 0;\n\t\t\t\t\tinline: -op='eq', (self -> 'lockfield')=#lockvalue -> (join: '|'), \n\t\t\t\t\t\t-maxrecords=1,\n\t\t\t\t\t\t-returnfield=(self -> 'lockfield'),\n\t\t\t\t\t\t-returnfield=(self -> 'keyfield'),\n\t\t\t\t\t\t-search;\n\t\t\t\t\t\tif: error_code == 0 && found_count != 1;\n\t\t\t\t\t\t\t// lock is not valid any more\n\t\t\t\t\t\t\t(self -> 'error_code') = 7011; // Delete failed, record lock not valid any more';\n\t\t\t\t\t\telse: error_code != 0;\n\t\t\t\t\t\t\t(self -> 'error_code') = 7019; // delete error\n\t\t\t\t\t\t\t(self -> 'error_data') = (map: 'error_code'=error_code, 'error_msg'=error_msg);\n\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t// lock OK, grab keyvalue for update\n\t\t\t\t\t\t\tlocal: 'keyvalue'=(field: (self -> 'keyfield'));\n\t\t\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': got keyvalue ' + #keyvalue + ' for keyfield ' + (self -> 'keyfield'));\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/inline;\n\t\t\t\t/if;\n\t\t\t\t\n\t\t\t/if;\n\n\t\t\tif: (self -> 'error_code') == 0 && (local: 'keyvalue') != '';\n\t\t\t\tif: (self -> 'isfilemaker');\n\t\t\t\t\tinline: -op='eq', (self -> 'keyfield')=#keyvalue, -search;\n\t\t\t\t\t\tif: found_count == 1;\n\t\t\t\t\t\t\t#_fields -> (insert: '-keyvalue'=keyfield_value);\n\t\t\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': FileMaker record id ' + keyfield_value);\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/inline;\n\t\t\t\telse;\n\t\t\t\t\t#_fields -> (insert: '-keyfield'=(self -> 'keyfield'));\n\t\t\t\t\t#_fields -> (insert: '-keyvalue'=#keyvalue);\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t\t\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': will delete record with params ' + #_fields);\n\t\t\t\n\t\t\tif: (#_fields >> '-keyfield' && #_fields -> (find: '-keyfield') -> first -> value != '' || (self -> 'isfilemaker'))\n\t\t\t\t&& #_fields >> '-keyvalue' && #_fields -> (find: '-keyvalue') -> first -> value != '';\n\t\t\t\t// ok to delete\n\t\t\telse;\n\t\t\t\t(self -> 'error_code') = 7006; // Delete failed, keyfield or keyvalue missing\n\t\t\t/if;\n\t\t\t\n\t\t\t// delete record\n\t\t\tif: (self -> 'error_code') == 0;\n\t\n\t\t\t\tlocal: 'querytimer'=knop_timer;\n\t\t\t\tinline: #_fields, -delete;\n\t\t\t\t\t(self -> 'querytime') = integer: #querytimer;\n\t\t\t\t\t(self -> 'searchparams') = #_fields;\n\t\t\t\t\n\t\t\t\t\tself -> capturesearchvars;\n\t\t\t\t\n\t\t\t\t/inline;\n\t\t\t/if;\n\t\t/inline;\n\t\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t(self -> 'debug_trace') -> (insert: tag_name + ': ' + (self -> error_msg) + ' ' + (self -> error_code) + ' ' + (self -> 'tagtime') + ' ms');\n\t/define_tag;\n\n\n\tdefine_tag: 'clearlocks', -description='Release all record locks for the specified user, suitable to use when showing record list. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-user (required) The user to unlock records for',\n\t\t-required='user';\n\t\t// release all record locks for the specified user, suitable to use when showing record list\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tfail_if: (self -> 'lockfield') == '', 7003, self -> error_msg(7003); // Lockfield not specified\n\t\tfail_if: #user == '', 7004, self -> error_msg(7004); // User not specified\n\t\n\t\tif: (self -> 'isfilemaker');\n\t\t\tinline: (self -> 'db_connect'),\n\t\t\t\t-maxrecords=all,\n\t\t\t\t(self -> 'lockfield')='\"' + #user + '|\"',\n\t\t\t\t-search;\n\t\t\t\tif: found_count > 0;\n\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': clearing locks for ' + #user + ' in ' + found_count + ' FileMaker records ' + error_msg + ' ' + error_code);\n\t\t\t\t\trecords;\n\t\t\t\t\t\tinline: -keyvalue=keyfield_value,\n\t\t\t\t\t\t\t(self -> 'lockfield')='',\n\t\t\t\t\t\t\t-update;\n\t\t\t\t\t\t\tif: error_code;\n\t\t\t\t\t\t\t\t(self -> 'error_code') = 7013; // Clearlocks failed\n\t\t\t\t\t\t\t\t(self -> 'error_data') = (map: 'error_code'=error_code, 'error_msg'=error_msg);\n\t\t\t\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': error when clearing lock on FileMaker record ' + keyfield_value + ' ' + error_msg + ' ' + error_code);\n\t\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t/inline;\n\t\t\t\t\t/records;\n\t\t\t\telse: error_code;\n\t\t\t\t\t(self -> 'error_code') = 7013; // Clearlocks failed\n\t\t\t\t\t(self -> 'error_data') = (map: 'error_code'=error_code, 'error_msg'=error_msg);\n\t\t\t\t/if;\n\t\t\t/inline;\n\t\telse;\n\t\t\tinline: (self -> 'db_connect'),\n\t\t\t\t-sql='UPDATE `' + (self -> 'table_realname') + '` SET `' + (self -> 'lockfield') + '`=\"\" WHERE `' + (self -> 'lockfield') \n\t\t\t\t\t+ '` LIKE \"' + (encode_sql: #user) + '|%\"';\n\t\t\t\tif: error_code != 0;\n\t\t\t\t\t(self -> 'error_code') = 7013; // Clearlocks failed\n\t\t\t\t\t(self -> 'error_data') = (map: 'error_code'=error_code, 'error_msg'=error_msg);\n\t\t\t\t/if;\n\t\t\t/inline;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': clearing all locks for ' + #user + ' ' + (self -> error_msg) + ' ' + (self -> error_code));\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\tdefine_tag: 'action_statement';\t\treturn: (self -> 'action_statement');\t/define_tag;\n\tdefine_tag: 'found_count';\t\t\treturn: (self -> 'found_count');\t\t/define_tag;\n\tdefine_tag: 'shown_count';\t\t\treturn: (self -> 'shown_count');\t\t/define_tag;\n\tdefine_tag: 'shown_first';\t\t\treturn: (self -> 'shown_first');\t\t/define_tag;\n\tdefine_tag: 'shown_last';\t\t\treturn: (self -> 'shown_last');\t\t\t/define_tag;\n\tdefine_tag: 'maxrecords_value';\t\treturn: (self -> 'maxrecords_value');\t/define_tag;\n\tdefine_tag: 'skiprecords_value';\treturn: (self -> 'skiprecords_value');\t/define_tag;\n\tdefine_tag: 'keyfield';\t\t\t\treturn: (self -> 'keyfield');\t\t\t/define_tag;\n\tdefine_tag: 'keyvalue';\t\t\t\treturn: (self -> 'keyvalue');\t\t\t/define_tag;\n\tdefine_tag: 'lockfield';\t\t\treturn: (self -> 'lockfield');\t\t\t/define_tag;\n\tdefine_tag: 'lockvalue';\t\t\treturn: (self -> 'lockvalue');\t\t\t/define_tag;\n\tdefine_tag: 'lockvalue_encrypted';\treturn: (self -> 'lockvalue_encrypted'); /define_tag;\n\tdefine_tag: 'querytime';\t\t\treturn: (self -> 'querytime');\t\t\t/define_tag;\n\tdefine_tag: 'inlinename';\t\t\treturn: (self -> 'inlinename');\t\t\t/define_tag;\n\tdefine_tag: 'searchparams';\t\t\treturn: (self -> 'searchparams');\t\t/define_tag;\n\tdefine_tag: 'resultset_count',\n\t\t-optional='inlinename';\n\t\t!local_defined('inlinename') ? local('inlinename'=(self -> 'inlinename'));\n\t\treturn((self -> 'resultset_count_map') -> find(#inlinename));\n\t/define_tag;\n\n\tdefine_tag('recorddata', -description='A map containing all fields, only available for single record results',\n\t\t-optional='recordindex', -copy);\n\t\t!local_defined('recordindex') ? local('recordindex'=(self -> 'current_record'));\n\t\t#recordindex < 1 ? #recordindex = 1;\n\t\tif(#recordindex == 1);\n\t\t\t// return default (i.e. first) record\n\t\t\treturn(self -> 'recorddata');\n\t\telse;\n\t\t\tlocal('recorddata'=map);\n\t\t\titerate(self -> field_names, local('field_name'));\n\t\t\t\t#recorddata -> insert(#field_name = (self -> 'records_array' -> get(#recordindex) \n\t\t\t\t\t-> get(self -> 'field_names_map' -> find(#field_name))));\n\t\t\t/iterate;\n\t\t\treturn(#recorddata);\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'records_array';\t\treturn: (self -> 'records_array');\t\t/define_tag;\n\t\n\tdefine_tag('field_names', -description='Returns an array of the field names from the last database query. If no database query has been performed, a \"-show\" request is performed. \\n\\\n\t\t\tParameters: \\n\\\n\t\t\t-table (optional) Return the field names for the specified table\\n\\\n\t\t\t-types (optional flag) If specified, returns a pair array with fieldname and corresponding Lasso data type',\n\t\t-optional='table',\n\t\t-optional='types');\n\t\t!local_defined('table') ? local('table'=(self -> 'table'));\n\t\tlocal('field_names'=(self -> 'field_names'));\n\t\tif(#field_names -> size == 0 || (local_defined('types') && #types != false));\n\t\t\t#field_names=array;\n\t\t\tif(local_defined('types') && #types != false);\n\t\t\t\tlocal('types_mapping'=map('text'='string', 'number'='decimal', 'date/time'='date'));\n\t\t\t/if;\n\t\t\tinline(self->'db_connect', -table=#table, -show);\n\t\t\t\tif(local_defined('types') && #types != false);\n\t\t\t\t\tloop(field_name(-count));\n\t\t\t\t\t\t#field_names -> insert(field_name(loop_count) = #types_mapping->find(field_name(loop_count, -type)));\n\t\t\t\t\t/loop;\n\t\t\t\telse;\n\t\t\t\t\t#field_names=field_names;\n\t\t\t\t/if;\n\t\t\t/inline;\n\t\t/if;\n\t\treturn(@#field_names);\n\t/define_tag;\n\t\n\tdefine_tag('table_names', -description='Returns an array with all table names for the database');\n\t\tlocal('table_names'=array);\n\t\tinline(self -> 'db_connect');\n\t\t\tDatabase_TableNames(self -> 'database');\n\t\t\t\t#table_names -> insert(Database_TableNameItem);\n\t\t\t/Database_TableNames;\n\t\t/inline;\n\t\treturn(@#table_names);\n\t/define_tag;\n\t\n\tdefine_tag: 'error_data', -description='Returns more info for those errors that provide such';\n\t\tif: (self -> 'errors_error_data') >> (self -> error_code);\n\t\t\treturn: (self -> 'error_data');\n\t\telse;\n\t\t\treturn: map;\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag('size');\n\t\treturn(self -> 'shown_count');\n\t/define_tag;\n\n\tdefine_tag('get', -required='index');\n\t\treturn(knop_databaserow(\n\t\t\t-record_array=(self -> 'records_array' -> get(#index)), \n\t\t\t-field_names=(self -> 'field_names')));\n\t/define_tag;\n\n\tdefine_tag('records', -description='Returns all found records as a knop_databaserows object',\n\t\t-optional='inlinename');\n\t\t!local_defined('inlinename') ? local('inlinename'=(self -> 'inlinename'));\n\t\tif((self -> 'databaserows_map') !>> #inlinename);\n\t\t\t// create knop_databaserows on demand\n\t\t\t(self -> 'databaserows_map') -> insert(#inlinename = knop_databaserows(\n\t\t\t\t\t-records_array=(self -> 'records_array'), \n\t\t\t\t\t-field_names=(self -> 'field_names'))\n\t\t\t\t);\n\t\t/if;\n\t\treturn(@((self -> 'databaserows_map') -> find(#inlinename)));\n\t/define_tag;\n\n\tdefine_tag('field', -description='A shortcut to return a specific field from a single record result',\n\t\t-required='fieldname',\n\t\t-optional='recordindex',\n\t\t-optional='index');\n\t\t!local_defined('recordindex') ? local('recordindex'=(self -> 'current_record'));\n\t\t#recordindex < 1 ? #recordindex = 1;\n\t\t!local_defined('index') ? local('index'=1);\n\t\tif(#recordindex == 1 && #index == 1);\n\t\t\t// return first field occurrence from the default (i.e. first) record\n\t\t\treturn((self -> 'recorddata') -> find(#fieldname));\n\t\telse(self -> 'field_names_map' >> #fieldname \n\t\t\t&& #recordindex >= 1 \n\t\t\t&& #recordindex <= (self -> 'records_array') -> size);\n\t\t\t// return specific record\n\t\t\tif(#index==1);\n\t\t\t\t// return first ocurrence of field name through the index map - this is faster\n\t\t\t\treturn(self -> 'records_array' -> get(#recordindex) -> get(self -> 'field_names_map' -> find(#fieldname)));\n\t\t\telse;\n\t\t\t\t// return another occurrence of the field - this is slightly slower\n\t\t\t\tlocal('indexmatches'=(self -> 'field_names') -> findposition(#fieldname));\n\t\t\t\tif(#index >= 1 && #index <= #indexmatches -> size);\n\t\t\t\t\treturn(self -> 'records_array' -> get(#recordindex) -> get(#indexmatches -> get(#index)));\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t/if;\n\t/define_tag;\n\t\n\tdefine_tag('next', -description='Increments the record pointer, returns true if there are more records to show, false otherwise.\\n\\\n\t\t\tUseful as an alternative to a regular records loop:\\n\\\n\t\t\t\\t$database -> select;\\n\\\n\t\t\t\\twhile: $database -> next;\\n\\\n\t\t\t\\t\\t$database -> field(\\'name\\');\\'
\\';\\n\\\n\t\t\t\\t/while;');\n\t\tif((self -> 'current_record') < (self -> 'shown_count'));\n\t\t\t(self -> 'current_record') += 1;\n\t\t\treturn(true);\n\t\telse;\n\t\t\t// reset record pointer\n\t\t\t(self -> 'current_record') = 0;\n\t\t\treturn(false);\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag('nextrecord', -description='Deprecated synonym for ->next');\n\t\t(self -> 'debug_trace') -> insert('*** DEPRECATION WARNING *** ' + tag_name + ' is deprecated, use ->next instead ');\n\t\treturn(self -> next);\n\t/define_tag;\n\n\tdefine_tag: 'trace', \n\t\t-optional='html',\n\t\t-optional='xhtml';\n\n\t\tlocal: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');\n\n\t\tlocal: 'eol'=(local_defined: 'html') || #endslash -> size ? '\\n' | '\\n';\n\n\t\treturn: #eol + 'Debug trace for database $' + (self -> varname) + ' (' (self -> 'database') '.' (self -> 'table') + ')' + #eol \n\t\t\t+ (self -> 'debug_trace') -> (join: #eol) + #eol;\n\n\t/define_tag;\n\n\n\t// =========== Internal member tags ===============\n\t\n\tdefine_tag: 'reset', -description='Internal, reset all search result vars';\n\t\t// reset all search result vars\n\t\t// searchresultvars\n\t\t(self -> 'action_statement') = null;\n\t\t(self -> 'found_count') = null;\n\t\t(self -> 'shown_first') = null;\n\t\t(self -> 'shown_last') = null;\n\t\t(self -> 'shown_count') = null;\n\t\t(self -> 'field_names') = null;\n\t\t(self -> 'records_array') = null;\n\t\t(self -> 'maxrecords_value') = null;\n\t\t(self -> 'skiprecords_value') = null;\n\t\t\n\t\t(self -> 'inlinename')=string;\n\t\t(self -> 'keyvalue')=null;\n\t\t(self -> 'lockvalue')=null;\n\t\t(self -> 'lockvalue_encrypted')=null;\n\t\t(self -> 'timestampfield')=string;\n\t\t(self -> 'timestampvalue')=string;\n\t\t(self -> 'searchparams')=string;\n\t\t(self -> 'querytime')=integer;\n\t\t(self -> 'recorddata')=map;\n\t\t(self -> 'message')=string;\n\t\t(self -> 'current_record')=0;\n\t\t(self -> 'field_names_map')=map;\n\n\t\t(self -> 'error_code')=0;\n\t\t(self -> 'error_msg')=string;\n\t/define_tag;\n\n\tdefine_tag: 'capturesearchvars', -description='Internal';\n\t\t// internal member tag\n\n\t\t// capture various result variables like found_count, shown_first, shown_last, shown_count\n\t\t// searchresultvars\n\t\t(self -> 'action_statement') = action_statement;\n\t\t(self -> 'found_count') = found_count;\n\t\t(self -> 'shown_first') = shown_first;\n\t\t(self -> 'shown_last') = shown_last;\n\t\t(self -> 'shown_count') = shown_count;\n\t\t(self -> 'field_names') = field_names;\n\t\t(self -> 'records_array') = records_array;\n\t\n\t\t!((self -> 'maxrecords_value') > 0) ? (self -> 'maxrecords_value') = maxrecords_value;\n\t\t!((self -> 'skiprecords_value') > 0) ? (self -> 'skiprecords_value') = skiprecords_value;\n\n\t\tlasso_tagexists('resultset_count') ? (self -> 'resultset_count_map') -> insert((self -> 'inlinename')=resultset_count);\n\t\titerate(field_names, local('field_name'));\n\t\t\t(self -> 'field_names_map') !>> #field_name \n\t\t\t\t? (self -> 'field_names_map') -> insert(#field_name=loop_count);\n\t\t/iterate;\n\t\t\n\t\t(self -> 'error_code') = error_code;\n\t\terror_code && error_msg -> size ? (self -> 'error_msg') = error_msg;\n\t\t\n\n\t\t// handle queries that use LIMIT\n\t\tif: !(self -> 'isfilemaker') && (string_findregexp: action_statement, -find= '\\\\sLIMIT\\\\s', -ignorecase) -> size;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': old found_count, shown_first and shown_last ' + (self -> 'found_count') + ' '+ (self -> 'shown_first') + ' '+ (self -> 'shown_last'));\n\t\t\t(self -> 'found_count') = knop_foundrows;\n\t\t\t// adjust shown_first and shown_last\n\t\t\t(self -> 'shown_first') = ((self -> 'found_count') ? (self -> 'skiprecords_value') + 1 | 0);\n\t\t\t(self -> 'shown_last') = integer(math_min(((self -> 'skiprecords_value') + (self -> 'maxrecords_value')), (self -> 'found_count')));\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': new found_count, shown_first and shown_last ' + (self -> 'found_count') + ' '+ (self -> 'shown_first') + ' '+ (self -> 'shown_last'));\n\t\t/if;\n\n\t\t// capture some variables for single record results\n\t\tif: found_count <= 1 // -update gives found_count 0 but still has one record result\n\t\t\t&& error_code == 0;\n\t\t\tif((self -> 'keyfield') != '' && string(field(self -> 'keyfield')) -> size);\n\t\t\t\t(self -> 'keyvalue')=field(self -> 'keyfield');\n\t\t\telse: (self -> 'keyfield') != '' && (self -> 'keyvalue') == '' && !(self -> 'isfilemaker');\n\t\t\t\t(self -> 'keyvalue')=keyfield_value;\n\t\t\t/if;\n\t\t\tif: lasso_currentaction == 'add' || lasso_currentaction == 'update';\n\t\t\t\t(self -> 'affectedrecord_keyvalue') = (self -> 'keyvalue');\n\t\t\t/if;\n\t\t\tif: (self -> 'lockfield') != ''; \n\t\t\t\t(self -> 'lockvalue')=(field: (self -> 'lockfield'));\n\t\t\t\t(self -> 'lockvalue_encrypted')=(encrypt_blowfish: (field: (self -> 'lockfield')), -seed=(self -> 'lock_seed'));\n\t\t\t/if;\n\t\t/if;\n\t\tif: error_code == 0;\n\t\t\t// populate recorddata with field values from the first found record\n\t\t\titerate: field_names, local: 'field_name';\n\t\t\t\t(self -> 'recorddata') !>> #field_name \n\t\t\t\t\t? (self -> 'recorddata') -> (insert: #field_name = (field: #field_name) );\n\t\t\t/iterate;\n\t\telse;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': ' + error_msg);\n\t\t/if;\n\t\t(self -> 'debug_trace') -> (insert: tag_name + ': found_count ' + (self -> 'found_count') + ' ' + (self -> 'keyfield') + ' '+ (field: (self -> 'keyfield')) + ' keyfield_value ' + keyfield_value + ' keyvalue ' + (self -> 'keyvalue') + ' fieldcount ' + (field_name: -count));\n\n\t/define_tag;\n\n/define_type;\n\n\ndefine_type('databaserows',\n\t-namespace='knop_');\n\tlocal('version'='2009-01-08',\n\t\t'description'='Custom type to return all record rows from knop_database. Used as output for knop_database->records. ');\n/*\n\nCHANGE NOTES\n2009-01-08\tJS\t->_unknowntag: Added -index parameter\n2008-11-24\tJS\tCreated the type\n\n\n*/\n\n\tlocal('records_array'=array,\n\t\t'field_names'=array,\n\t\t'field_names_map'=map,\n\t\t'current_record'=integer);\n\t\t\n\tdefine_tag('oncreate', -description='Create a record rows object. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-records_array (array) Array of arrays with field values for all fields for each record of all found records\n\t\t\t-field_names (array) Array with all the field names',\n\t\t-required='records_array',\n\t\t-required='field_names');\n\t\tself -> 'records_array'=#records_array;\n\t\tself -> 'field_names'=#field_names;\n\t\t// store indexes to first occurrence of each field name for faster access\n\t\titerate(#field_names, local('field_name'));\n\t\t\t(self -> 'field_names_map') !>> #field_name \n\t\t\t\t? (self -> 'field_names_map') -> insert(#field_name=loop_count);\n\t\t/iterate;\n\t/define_tag;\n\t\n\tdefine_tag('_unknowntag', -description='Shortcut to field',\n\t\t-optional='index');\n\t\t!local_defined('index') ? local('index'=1);\n\t\tif(self -> 'field_names' >> tag_name);\n\t\t\treturn(self -> field(tag_name(-index=#index)));\n\t\telse;\n\t\t\t//fail: -9948, self -> type + '->' + tag_name + ' not known.';\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag('onconvert', -description='Output the current record as a plain array of field values');\n\t\t!local_defined('recordindex') ? local('recordindex'=(self -> 'current_record'));\n\t\t#recordindex < 1 ? #recordindex = 1;\n\t\tif(#recordindex >= 1 \n\t\t\t&& #recordindex <= (self -> 'records_array' -> size));\n\t\t\treturn(self -> 'records_array' -> get(#recordindex));\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag('size');\n\t\treturn(self -> 'records_array' -> size);\n\t/define_tag;\n\n\tdefine_tag('get', -required='index');\n\t\treturn(knop_databaserow(-record_array=(self -> 'records_array' -> get(#index)), -field_names=(self -> 'field_names')));\n\t/define_tag;\n\n\tdefine_tag('field', -description='Return an individual field value',\n\t\t-required='fieldname',\n\t\t-optional='recordindex',\n\t\t-optional='index');\n\t\t!local_defined('recordindex') ? local('recordindex'=(self -> 'current_record'));\n\t\t#recordindex < 1 ? #recordindex = 1;\n\t\t!local_defined('index') ? local('index'=1);\n\t\tif(self -> 'field_names_map' >> #fieldname \n\t\t\t&& #recordindex >= 1 \n\t\t\t&& #recordindex <= (self -> 'records_array') -> size);\n\t\t\t// return specific record\n\t\t\tif(#index==1);\n\t\t\t\t// return first ocurrence of field name through the index map - this is faster\n\t\t\t\treturn(self -> 'records_array' -> get(#recordindex) -> get(self -> 'field_names_map' -> find(#fieldname)));\n\t\t\telse;\n\t\t\t\t// return another occurrence of the field - this is slightly slower\n\t\t\t\tlocal('indexmatches'=(self -> 'field_names') -> findposition(#fieldname));\n\t\t\t\tif(#index >= 1 && #index <= #indexmatches -> size);\n\t\t\t\t\treturn(self -> 'records_array' -> get(#recordindex) -> get(#indexmatches -> get(#index)));\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag('summary_header', -description='Returns true if the specified field name has changed since the previous record, or if we are at the first record',\n\t\t-required='fieldname');\n\t\tlocal('recordindex'=(self -> 'current_record'));\n\t\t#recordindex < 1 ? #recordindex = 1;\n\t\tif(#recordindex == 1 // first record\n\t\t\t|| self -> field(#fieldname) != self -> field(#fieldname, -recordindex=(#recordindex - 1)) ); // different than previous record (look behind)\n\t\t\treturn(true);\n\t\telse;\n\t\t\treturn(false);\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag('summary_footer', -description='Returns true if the specified field name will change in the following record, or if we are at the last record',\n\t\t-required='fieldname');\n\t\tlocal('recordindex'=(self -> 'current_record'));\n\t\t#recordindex < 1 ? #recordindex = 1;\n\t\tif(#recordindex == (self -> 'records_array') -> size // last record\n\t\t\t|| self -> field(#fieldname) != self -> field(#fieldname, -recordindex=(#recordindex + 1)) ); // different than next record (look ahead)\n\t\t\treturn(true);\n\t\telse;\n\t\t\treturn(false);\n\t\t/if;\n\t/define_tag;\n\n\n\tdefine_tag('next', -description='Increments the record pointer, returns true if there are more records to show, false otherwise.');\n\t\tif((self -> 'current_record') < (self -> 'records_array') -> size);\n\t\t\t(self -> 'current_record') += 1;\n\t\t\treturn(true);\n\t\telse;\n\t\t\t// reset record pointer\n\t\t\t(self -> 'current_record') = 0;\n\t\t\treturn(false);\n\t\t/if;\n\t/define_tag;\n/define_type;\n\n\n\ndefine_type('databaserow',\n\t-namespace='knop_',\n\t//-prototype, // prototype prevents the namespace from unloading without restart\n\t);\n\tlocal: 'version'='2009-01-08',\n\t\t'description'='Custom type to return individual record rows from knop_database. Used as output for knop_database->get. ';\n/*\n\nCHANGE NOTES\n2009-01-08\tJS\t->_unknowntag: Added -index parameter\n2008-11-24\tJS\t->field: Added -index parameter to be able to access any occurrence of the same field name\n2008-05-29\tJS\tRemoved -prototype since it prevents unloading the namespace. It is recommended to turn it on for best performance\n2008-05-27\tJS\tCreated the type\n\n\n*/\n\tlocal('record_array'=array,\n\t\t'field_names'=array);\n\t\t\n\tdefine_tag('oncreate', -description='Create a record row object. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-record_array (array) Array with field values for all fields for the record\n\t\t\t-field_names (array) Array with all the field names, should be same size as -record_array',\n\t\t-required='record_array',\n\t\t-required='field_names');\n\t\tself -> 'record_array'=#record_array;\n\t\tself -> 'field_names'=#field_names;\n\t/define_tag;\n\t\n\tdefine_tag('_unknowntag', -description='Shortcut to field',\n\t\t-optional='index');\n\t\t!local_defined('index') ? local('index'=1);\n\t\tif(self -> 'field_names' >> tag_name);\n\t\t\treturn(self -> field(tag_name, -index=#index));\n\t\telse;\n\t\t\t//fail: -9948, self -> type + '->' + tag_name + ' not known.';\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag('onconvert', -description='Output the record as a plain array of field values');\n\t\treturn(self -> 'record_array');\n\t/define_tag;\n\n\n\tdefine_tag('field', -description='Return an individual field value',\n\t\t-required='fieldname',\n\t\t-optional='index');\n\t\t!local_defined('index') ? local('index'=1);\n\t\tif(self -> 'field_names' >> #fieldname);\n\t\t\t// return any occurrence of the field\n\t\t\tlocal('indexmatches'=(self -> 'field_names') -> findposition(#fieldname));\n\t\t\tif(#index >= 1 && #index <= #indexmatches -> size);\n\t\t\t\treturn((self -> 'record_array') -> get(#indexmatches -> get(#index)));\n\t\t\t/if;\n\t\t/if;\n\t/define_tag;\n\n\n/define_type;\n?>\n[\n//------------------------------------------------------------------\n// End knop_database\n//------------------------------------------------------------------\n\n//##################################################################\n\n][\n//------------------------------------------------------------------\n// Begin knop_form\n//------------------------------------------------------------------\n\n]addfield: Added -template to specify field specific template \n2010-11-22\tSP\t->init: Correction of -lockvalue handling after L9 syntax adjustment\n2010-07-18\tSP\tAdded support for series for -options\n2010-06-10\tJS\t->renderform: avoid adding -upload parameters to post forms since it conflicts with file uploads (found by Steve Piercy)\n2010-04-21\tJS\t->renderhtml: removed encode_html for label\n2010-03-06\tSP\tChanged default behavior of ->updatefields with -sql to add backticks between the table and column names. Now JOINs may be used.\n2010-03-06\tSP\tAdded ->updatefields with -removedotbackticks for backward compatibility for fields that contain periods. If you use periods in a fieldname then you cannot use a JOIN in Knop.\n2009-11-11\tJS\tAdded class and id to optiongroup div that surrounds for checkbox and radio\n2009-11-11\tJS\tCorrected id for checkbox and radio option labels\n2009-10-02\tJS\tAdded id for labels, auto generated from the field's id with _label appended\n2009-09-16\tJS\tSyntax adjustments for Lasso 9\n2009-09-04\tJS\tChanged $__html_reply__ to content_body\n2009-09-04\tJS\t->renderhtml: corrected typ for autoparams\n2009-07-23\tJS\t->renderform: removed encode_html that somehow has reappeared for label. \n2009-07-10\tSP\tadded -maxlength option for text fields\n2009-06-26\tJS\t->oncreate: added deprecation warning for -action\n2009-06-22\tJS\t->addfield: corrected -options check to look for set instead of series (besides array)\n2009-04-16\tJS\t->loadfileds can now load field values from -params also inside an inline\n2009-03-20\tJS\tAdded around injected scripts for better xhtml compliance\n2009-01-08\tJS\t->getvalue and _unknowntag: added -index parameter to be able to get value for a specific field instance when there are multiple fields with the same name \n2009-01-08\tJS\t->loadfields: implemented support for multiple fields with the same name when loading field values from form submission where the number of same name fields matches\n2009-01-07\tJS\t->setvalue: added -index parameter to be able to set value for a specific field instance when there are multiple fields with the same name \n2008-12-08\tJS\t->renderform: Removed the onclick handlers for checkbox and radio since Safari now supports clicking the label text as click for the checkbox/radio control. \n2008-12-05\tJS\t->renderform: the fieldset and legend field types will now use id and class on the fieldset tag if specified\n2008-12-03\tJS\t->renderform: fields of type fieldset now uses value as legend (just as field type legend already did) instead of always using an empty legend\n2008-09-24\tJS\t->updatefields: Added protection against backtick sql injection in MySQL object names\n2008-09-17\tJS\t->renderform and ->renderhtml: -from and -to allows negative numbers to count from end of form instead\n2008-09-13\tJS\tAdded ->getlabel to return the display name for a field. \n2008-09-13\tJS\t->addfield and ->validate: Implemented -validate to specify a compound expression to validate the field input. \n2008-09-13\tJS\t->addfield and ->loadfields: Implemented -filter to specify a compound expression to filter the field input. \n2008-09-11\tJS\t->updatefields: fixed exclusion of special field types html, legend and fieldset. \n2008-09-11\tJS\t->renderform: Fixed missing value for password fields\n2008-07-02\tJS\t->renderform: Cleaned up the automatic adding of javascript code so it's not added if not needed. Also moved all scripts to the end of the page. More work with with the javascripts is needed.\n2008-06-03\tJS\t->renderform: corrected missing closing \n2008-05-15\tJS\t->renderform and ->renderhtml: adjusted the behavior for nested fieldsets\n2008-05-13\tJS\tImplemented -legend for ->renderhtml, to make it consistent with the new legend field type\n2008-05-13\tJS\tImplemented special field types html, fieldset and legend. Use -value to display data for these fields. A legend field also creates a fieldset (closes any previously open fieldsets). Use fieldset with -value=false to close a fieldset without opening a new one. \n2008-05-06\tJS\tAdded unknowntag as shortcut to getvalue\n2008-01-30\tJS\tRemoved duplicate endscript entries for if(dirty) {makedirty()};\n2007-12-13\tJS\tCorrected ->addfield: -dbfield so empty dbfields are properly ignored by ->updatefields. \n2007-12-11\tJS\tMoved error_msg to knop_base (special version of error_code stays here) \n2007-12-11\tJS\tAdded documentation as -description to most member tags, to be used by the new ->help tag\n2007-12-11\tJS\tMoved ->help to knop_base\n2007-11-13\tJS\tAdded -buttontemplate to be able to specify separate template for buttons, defaults to no
, but if template has been specified that will be used instead (for backwards compatibility)\n2007-11-12\tJS\t->process delete now works also when not using record locking (not specifying -user)\n2007-11-01\tJS\t->renderform: added support for -hint for textarea fields.\n2007-09-27\tJS\t->renderhtml: multiple values (array) for radio, checkbox and select are now rendered properly with either \",\" or
depending on the presence of -linebreak, and with the display text instead of the actual option value\n2007-09-27\tJS\t->renderform: improved handling of multiple values for checkbox, radio and select\n2007-09-21\tJS\t->addfield: flag parameters now accept false as value\n2007-09-06\tJS\t->oncreate: changed name of -action to -formaction to make it more clear what it is. -action is still supported but deprecated.\n2007-09-06\tJS\t->renderform: Corrected the exception for -session... (duh)\n2007-08-08\tJS\t->renderform: Added exception for -session\n2007-06-18\tJS\tAdded tag timer to most member tags\n2007-06-13\tJS\tadded inheritance from knop_base\n2007-06-12\tJC\tbugfixed -xhtml form rendering when called by quicksearch\n2007-06-11\tJC\tadded handling of xhtml output\n2007-04-19\tJS\t->loadfields: fixed -params that was broken when adding -database\n2007-04-19\tJS\t->renderform: removed invalid wrap=\"soft\" from textarea\n2007-04-12\tJS\t->process: made -user optional (only needed when using record locking)\n2007-04-12\tJS ->loadfields can now take a -database parameter, either as a flag (no value) where the database object connected to the form will be used, or by specifying a database object as value. \n2007-04-03\tJS\tChanged namespace from mt_ to knop_\n2007-03-01\tJS\t->renderform fixed unsavedwarning on page load by moving checkdirty() to afterscript\n2007-03-01\tJS\t->formmode and ->init changed so it preserves the right mode after a failed add\n2007-02-27\tJS\t->renderform: added
around checkboxes and radios for css formating\n2007-02-26\tJS\t->oncreate: added -actionpath to specify the framework action path for the form instead of manually adding the -action hidden field\n2007-02-24\tJS\tCorrected entersubmitblock behavior by adding onfocus handler on form and starting with submitBlock=false\n2007-02-23\tJS\tRemoved encode_html from form field labels\n2007-02-22\tJS\t->setformat: Added -legend\n2007-02-07\tJS\tAdded ->copyfield to copy a form field to a new name, with the same properties. \n2007-02-07\tJS\t->errors now returns empty array if validate has not been called, instead of performing validation\n2007-02-05\tJS\t->getbutton can now look for also button names that are not one of the built-in ones (for example button_apply)\n2007-02-05\tJS The -keyvalue parameter can be given another name by specifying -keyparamname in oncreate\n2007-02-02\tJS\tAdded ->lockvalue_decrypted\n2007-02-02\tJS\t->addfield: -value is now stored as reference\n2007-02-02\tJS\terror_code now returns an error for when the form contains validation errors\n2007-02-02\tJS\tImproved reporting of Lasso error messaged in error_msg\n2007-02-02\tJS \tAdded real error codes\n2007-01-31\tJS\t->rederform action_params now also exclude \"-\" params that appear in the form action\n2007-01-29\tJS\t->renderform: The first field with input error will get focus when loading page\n2007-01-29\tJS\tAdded -focus to ->addfield to give default field focus when loading page with form\n2007-01-29\tJS\tAdded -disabled to ->addfield, and handling of it in ->renderform\n2007-01-29\tJS\tAdded -noautoparams to ->oncreate to disable the automatic passing of action_params that begin with \"-\"\n2007-01-29\tJS\t->renderform now renders label also for submit, reset to format properly with css\n2007-01-26\tJS\tAdded support for Safari specific \n2007-01-26\tJS\t->renderform action_params that begin with \"-\" now exclude params that exist in the form. Minor corrections to the behavior. \n2007-01-25\tJS\tAdded -nowarning to ->oncreate to disable unsaved warnings for the entire form\n2007-01-25\tJS\tAdded -required to ->oncreate (and a few more from ->setformat)\n2007-01-23\tJS\tAutogenerates id for the form itself\n2007-01-23\tJS\tAdded ->getbutton to return the button that was clicked when submitting a form (cancel, add, save, delete)\n2007-01-23\tJS\tAdded auto conversion of options left hand pair member to string, to make comparsions work reliably. Integer zeros don't compare nicely to strings. \n2007-01-23\tJS\tAdded support for submit-on-enter prevention: specify -entersubmitblock at oncreate\n2007-01-19\tJS\tAddes renderform: -legend to be able to group form fields at render time\n2007-01-19\tJS\tadded support for -optgroup in -options for select. Also works for radio and checkbox. Specify empty -optgroup to close optgroup in select without starting a new, or to add extra linebreak between checkboxes/radio buttons. \n2007-01-19\tJS\tadded -template for oncreate\n2007-01-19\tJS\tadded optional fieldset and legend to form, legend can be specified as -legend at oncreate. if -legend is specified, the form will be wrapped in a fieldset. \n2007-01-19\tJS\tmethod now defaults to post\n2007-01-19\tJS\tCorrected line separator for FileMaker checkboxes and added the same handling also for radio\n2007-01-18\tJS\trenderform: any action_params that begin with \"-\" (except -keyvalue and -lockvalue) are added as form parameters\n2007-01-18\tJS\trenderform: checkboxes and multiselects now show checked and selected properly when loading values from database\n2007-01-18\tJS\tupdatefields: added support for multiple values for one fieldname, like checkboxes (multiple fields in the update pair array, -sql generates comma separated values)\n2007-01-17\tJS\treset button now makes form undirty\n2007-01-17\tJS\taddfield: -confirmmessage can now be specified for any submit or reset button\n2007-01-17\tJS\tadded addfield: -nowarning to avoid unsaved warning when the field is changed\n2007-01-17\tJS\tchanged default class name for unsaved marker from dirty to unsaved\n2007-01-17\tJS\tchanged name of -dirtymarker and -dirtymarkerclass to unsavedmarker and -unsavedmarkerclass for userfriendlyness\n2007-01-17\tJS\tadded setformat: -unsavedwarning to dynamically set the javascript form dirty warning message\n2007-01-17\tJS\trenderform: -field changed to renderform: -name for consistency\n2007-01-16\tJS\trenderform: -field with wrong field name does not output anything, instead of the entire form\n2007-01-16\tJS\tfixed onbeforeunload in javascript form dirty handler\n\nTODO:\n->addfield: Add -format to manipulate the field value before it is displayed by ->renderform and ->renderhtml, much like -filter but only for display and without affecting input. \n->addfield: Add -fieldgroup to be able to group related fields together, useful for ->updatefields to return just fields that belong to a specific db table, or ->renderform as another way to render a form selectively\n->renderform needs a better way to display errors inline together with the fields\nMake _unknowntag also work as shortcut to setvalue if a value is specified\nAdd a new special field type to the form object, let's say \"data\". That field type will not interact with forms and will never be touched by loadfields, but it will populate ->updatefields.\nAdd -> searchfields, which will return a fulltext enabled pair array better suited for searchs than ->updatefields is. -fulltext needs to be specified per field. \nReview and clean up the javascripts inserted automatically by knop_form - partially done\nOption to let textarea grow automatically depending on the amount of text in it. \nUse http://bassistance.de/jquery-plugins/jquery-plugin-validation/ instead of client side validation\nPossibly add support for the same validation expressions as the jquery validation plugin uses, so server side a nd client side validation can be specified at once. \nAdd -path as parameter for oncreate so the form action can be set with less confusion... In that case -formaction will be a physical url, while -path would be a framework path. \nFix actionpath reference so it updates properly when altering the value (not possible?)\nShould loadfields load \"-\" params?\nUnsavedwarning made optional, does not seem to work properly now?\nMore flexible error hightlighting\nMove templates to a member tag to be make it easier to subclass (Douglas Burchard)\nAdd \"button\". . Subtypes are submit, reset and button. How to specify the subtype? (Douglas Burchard)\nChange ->addfield to ->insert and make ->addfield deprecated\nThere is no src for input type image!\nAdd ->size and ->get so the form object can be iterated\nAdd -skipemtpy to to ->renderhtml\nOption for -> renderhtml to output without html encoding\n->renderhtml should never html encode fields of type html\n\n*/\n\t\n\n\t// instance variables\n\tlocal: 'fields'=array,\n\t\t'template'=string,\t\t\t// html template used to render the html form fields\n\t\t'buttontemplate'=string,\t// html template used to render the html buttons (submit, reset, image)\n\t\t'class'=string,\t\t\t\t// default class for all form fields, can be overridden field by field\n\t\t'errorclass'=string,\t\t// class used to highlight field labels when validation fails\n\t\t'formaction'=null,\n\t\t'method'='post',\n\t\t'fieldset'=false,\t\t\t// html form fieldset\n\t\t'legend'=null,\t\t\t\t// html form legend\n\t\t'name'=null,\n\t\t'id'=null,\n\t\t'raw'=null,\n\t\t'enctype'=null,\t\t\t\t// is automatically set to multipart/formdata if the form contains a file input\n\t\t'actionpath'=null,\n\t\t'noautoparams'=false,\t\t// if true then no parameters that begin with - will be automatically added to the form\n\t\t'fieldsource'=null,\t\t\t// the source of the latest -> loadfields, can be database, form or params\n\t\t'required'=string,\t\t\t// marker used to show fields that are required (html or plain string)\n\t\t'entersubmitblock'=false,\t// if true, a javascript will prevent form submit without clicking on submit button (like pressing enter key)\n\t\t'unsavedmarker'=null,\n\t\t'unsavedmarkerclass'=null,\n\t\t'unsavedwarning'=string,\t// must be specified, or else there is no unsaved warning for the form\n\t\t'database'=null,\n\t\t'keyparamname'=string,\t\t// param name to use instead of the default -keyvalue\n\t\t'formmode'=null,\t\t\t// whether the form is for editing an existing record or a blank for for adding a new record (edit/add)\n\t\t\t\t\t\t\t\t\t// only valid if a database object is specified\n\t\t'formbutton'=null,\t\t\t// the button that was clicked when submitting a form (cancel, add, save, delete)\n\t\t'db_keyvalue'=null,\n\t\t'db_lockvalue'=null,\n\t\t\n\t\t'render_fieldset_open'=false,\t// used when rendering to keep track of if a fieldset from fieldset or legend field types is open so it can be closed properly\n\t\t'render_fieldset2_open'=false,\t// used when rendering to keep track of if a fieldset from renderform or renderhtml legend is open so it can be closed properly\n\t\t'noscript'=false,\t\t\t\t// when set to true, no scripts will be injected by renderform\n\t\t'error_lang'=(knop_lang: -default='en', -fallback);\n\t\n\tlocal: 'errors'=null;\n\n\n\t// config vars\n\tlocal: 'validfieldtypes' = (map: 'text', 'password', 'checkbox', 'radio', 'textarea', 'select', 'file', 'search',\n\t\t\t\t'submit', 'reset', 'image', 'hidden', \n\t\t\t\t'fieldset', 'legend', 'html'), // special types\n\t\t'exceptionfieldtypes' = (map: 'file', 'submit', 'reset', 'image', 'addbutton', 'savebutton', 'deletebutton', 'cancelbutton',\n\t\t\t\t'fieldset', 'legend', 'html'); // special types\n\tlocal: 'validfieldtypes_array'=array;\n\titerate: #validfieldtypes, (local: 'temp');\n\t\t#validfieldtypes_array -> (insert: #temp -> name);\n\t/iterate;\n\tlocal: 'exceptionfieldtypes_array'=array;\n\titerate: #exceptionfieldtypes, (local: 'temp');\n\t\t#exceptionfieldtypes_array -> (insert: #temp -> name);\n\t/iterate;\n\t\n\t// page var to keep track of the number of forms that have been rendered on a page\n\tif: !(var_defined: 'knop_form_renderform_counter');\n\t\tvar: 'knop_form_renderform_counter'=0;\n\t/if;\n\t\n\n\tdefine_tag: 'oncreate', -description='Parameters:\\n\\\n\t\t\t-formaction (optional) The action atribute in the form html tag\\n\\\n\t\t\t-action (optional) Deprecated synonym to -formaction\\n\\\n\t\t\t-method (optional) Defaults to post\\n\\\n\t\t\t-name (optional)\\n\\\n\t\t\t-id (optional)\\n\\\n\t\t\t-raw (optional) Anything in this parameter will be put in the opening form tag\\n\\\n\t\t\t-actionpath (optional) Knop action path\\n\\\n\t\t\t-fieldset (optional)\\n\\\n\t\t\t-legend (optional string) legend for the entire form - if specified, a fieldset will also be wrapped around the form\\n\\\n\t\t\t-entersubmitblock (optional)\\n\\\n\t\t\t-noautoparams (optional)\\n\\\n\t\t\t-template (optional string) html template, defaults to #label# #field##required#
\\n\\\n\t\t\t-buttontemplate (optional string) html template for buttons, defaults to #field# but uses -template if specified\\n\\\n\t\t\t-required (optional string) character(s) to display for required fields (used for #required#), defaults to *\\n\\\n\t\t\t-class (optional string) css class name that will be used for the form element, default none\\n\\\n\t\t\t-errorclass (optional string) css class name that will be used for the label to highlight input errors, if not defined style=\"color: red\" will be used\\n\\\n\t\t\t-unsavedmarker (optional string) id for html element that should be used to indicate when the form becomes dirty. \\n\\\n\t\t\t-unsavedmarkerclass (optional string) class name to use for the html element. Defaults to \"unsaved\". \\n\\\n\t\t\t-unsavedwarning (optional string)\\n\\\n\t\t\t-keyparamname (optional)\\n\\\n\t\t\t-noscript (optional flag) if specified, don\\'t inject any javascript in the form. This will disable all client side functionality such as hints, focus and unsaved warnings. \\n\\\n\t\t\t-database (optional database) Optional database object that the form object will interact with',\n\t\t// parameters for form html tag attributes\n\t\t-optional='formaction',\n\t\t-optional='action',\n\t\t-optional='method',\n\t\t-optional='name',\n\t\t-optional='id',\n\t\t-optional='raw',\n\n\t\t// knop parameters\n\t\t-optional='actionpath',\n\t\t-optional='fieldset',\n\t\t-optional='legend', \n\t\t-optional='entersubmitblock',\n\t\t-optional='noautoparams',\n\t\t-optional='template', -type='string',\n\t\t-optional='buttontemplate', -type='string',\n\t\t-optional='required', -type='string',\n\t\t-optional='class', -type='string',\n\t\t-optional='errorclass', -type='string',\n\t\t-optional='unsavedmarker', -type='string',\n\t\t-optional='unsavedmarkerclass', -type='string',\n\t\t-optional='unsavedwarning', -type='string',\n\t\t-optional='keyparamname',\n\t\t-optional='noscript',\n\t\t-optional='database', -type='database';\n\t\tlocal: 'timer'=knop_timer; \n\n\n\t\tlocal_defined('method') ? (self -> 'method') = #method;\n\t\tlocal_defined('name') ? (self -> 'name') = #name;\n\t\tlocal_defined('id') ? (self -> 'id') = #id;\n\t\tlocal_defined('raw') ? (self -> 'raw') = #raw;\n\t\tlocal_defined('legend') ? (self -> 'legend') = #legend;\n\t\tlocal_defined('template') ? (self -> 'template') = #template;\n\t\tlocal_defined('buttontemplate') ? (self -> 'buttontemplate') = #buttontemplate;\n\t\tlocal_defined('required') ? (self -> 'required') = #required;\n\t\tlocal_defined('class') ? (self -> 'class') = #class;\n\t\tlocal_defined('errorclass') ? (self -> 'errorclass') = #errorclass;\n\t\tlocal_defined('unsavedmarker') ? (self -> 'unsavedmarker') = #unsavedmarker;\n\t\tlocal_defined('unsavedmarkerclass') ? (self -> 'unsavedmarkerclass') = #unsavedmarkerclass;\n\t\tlocal_defined('unsavedwarning') ? (self -> 'unsavedwarning') = #unsavedwarning;\n\t\tlocal_defined('keyparamname') ? (self -> 'keyparamname') = #keyparamname;\n\n\t\t// the following params are stored as reference, so the values of the params can be altered after adding a field simply by changing the referenced variable. \n\t\tlocal_defined('formaction') ? (self -> 'formaction') = @#formaction;\n\t\tlocal_defined('actionpath') ? (self -> 'actionpath') = @#actionpath;\n\t\tlocal_defined('database') ? (self -> 'database') = @#database;\n\n\t\tif: !(local_defined: 'formaction') && (local_defined: 'action');\n\t\t\t// keep support for old -action insead of -formaction\n\t\t\t(self -> 'debug_trace') -> insert('*** DEPRECATION WARNING *** ' + tag_name + ' -action parameter is deprecated, use -formaction instead ');\n\t\t\t(self -> 'formaction') = @#action;\n\t\t/if;\n\t\t\n\t\t(self -> 'noscript') = (local_defined('noscript') && #noscript != false);\n\n\t\t// default value\n\t\t!(local_defined: 'required') ? (self -> 'required' = '*');\n\t\t!(local_defined: 'keyparamname') ? (self -> 'keyparamname' = '-keyvalue');\n\n\t\t(self -> 'fieldset') = ((local_defined: 'fieldset') && #fieldset != false) || (self -> 'legend') != '';\n\t\t(self -> 'entersubmitblock') = (local_defined: 'entersubmitblock');\n\t\t(self -> 'noautoparams') = (local_defined: 'noautoparams');\n\n\n\t\tif: (self -> 'unsavedmarker') != '' && (self -> 'unsavedmarkerclass') == '';\n\t\t\t// set default unsavedmarkerclass\n\t\t\t(self -> 'unsavedmarkerclass')='unsaved';\n\t\t/if;\n\n\t\tif: (self -> 'unsavedwarning') == '';\n\t\t\t// set default dirtywarning message\n\t\t\t//(self -> 'unsavedwarning')='Det finns ändringar som inte har sparats - vill du fortsätta utan att spara?';\n\t\t/if;\n\t\t\n\t\t// escape quotes for javascript\n\t\t(self -> 'unsavedwarning') -> (replace: '\\'', '\\\\\\'');\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\t/*\n\tdefine_tag: 'onassign', -description='Internal, needed to restore references when ctype is defined as prototype',\n\t\t-required='value'; \n\t\t// recreate references here\n\n\t\titerate: (array: \n\t\t\t'formaction',\n\t\t\t'actionpath',\n\t\t\t'database'), (local: 'param');\n\t\t\t(self -> #param) = @(#value -> #param);\n\t\t/iterate;\n\n\t/define_tag;\n\t*/\n\t\n\tdefine_tag: 'onconvert', -description='Outputs the form data in very basic form, just to see what it contains',\n\t\t-optional='xhtml';\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tlocal: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');\n\n\t\tlocal: 'output'=string;\n\t\titerate: (self -> 'fields'), (local: 'fieldpair');\n\t\t\t#output += #fieldpair -> name + ' = ' + #fieldpair -> value + ' \\n';\n\t\t/iterate;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: #output;\n\t/define_tag;\n\t\n\tdefine_tag: '_unknowntag', -description='Shortcut to getvalue',\n\t\t-optional='index', -type='integer', -copy;\n\t\t!local_defined('index') ? local('index') = 1;\n\t\tif: (self -> 'fields') >> tag_name; // should be (self -> keys) but this is faster\n\t\t\treturn: (self -> (getvalue: tag_name, -index=#index));\n\t\telse;\n\t\t\t//fail: -9948, self -> type + '->' + tag_name + ' not known.';\n\t\t\t(self -> '_debug_trace') -> insert(self -> type + '->' + tag_name + ' not known.');\n\t\t/if;\n\t/define_tag;\n\t\n\tdefine_tag: 'addfield', -description='Inserts a form element in the form. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-type (required) Supported types are listed in form -> \\'validfieldtypes_array\\'. Also custom field types addbuton, savebutton or deletebutton are supported (translated to submit buttons with predefined names). \\\n\t\t\tFor the field types html, fieldset and legend use -value to specify the data to display for these fields. A legend field automatically creates a fieldset (closes any previously open fieldsets). Use fieldset with -value=false to close a fieldset without opening a new one. \\n\\\n\t\t\t-name (optional) Required for all input types except addbuton, savebutton, deletebutton, fieldset, legend and html\\n\\\n\t\t\t-id (optional) id for the html object, will be autogenerated if not specified\\n\\\n\t\t\t-dbfield (optional) Corresponding database field name (name is used if dbfield is not specified), or null/emtpy string if ignore this field for database\\n\\\n\t\t\t-value (optional) Initial value for the field\\n\\\n\t\t\t-hint (optional) Optional gray hint text to show in empty text field\\n\\\n -options (optional) For select, checkbox and radio, must be array, set or series. For select, the array can contain -optgroup=label to create an optiongroup. \\n\\ \n\t\t\t-multiple (optional flag) Used for select\\n\\\n\t\t\t-linebreak (optional flag) Put linebreaks between checkbox and radio values\\n\\\n\t\t\t-default (optional) Default text to display in a popup menu, will be selected (with empty value) if no current value is set. Is followed by an empty option. \\n\\\n\t\t\t-label (optional) Text label for the field\\n\\\n\t\t\t-size (optional) Used for text and select\\n\\\n\t\t\t-maxlength (optional) Used for text\\n\\\n\t\t\t-rows (optional) Used for textarea\\n\\\n\t\t\t-cols (optional) Used for textarea\\n\\\n\t\t\t-focus (optional flag) The first text field with this parameter specified will get focus when page loads\\n\\\n\t\t\t-class (optional)\\n\\\n\t\t\t-disabled (optional flag) The form field will be rendered as disabled\\n\\\n\t\t\t-raw (optional) Raw attributes that will be put in the html tag\\n\\\n\t\t\t-confirmmessage (optional) Message to show in submit/reset confirm dialog (delete button always shows confirm dialog)\\n\\\n\t\t\t-required (optional flag) If specified then the field must not be empty (very basic validation)\\n\\\n\t\t\t-validate (optional) Compound expression to validate the field input. The input can be accessed as params inside the expression which should either return true for valid input or false for invalid, or return 0 for valid input or a non-zero error code or error message string for invalid input. \\n\\\n\t\t\t-filter (optional) Compound expression to filter the input before it is loaded into the form by ->loadfields. The field value can be accessed as params inside the expression which should return the filtered field value. -filter is applied before validation. \\n\\\n\t\t\t-nowarning (optional flag) If specified then changing the field will not trigger an unsaved warning\\n\\\n\t\t\t-after (optional) Numeric index or name of field to insert after\\n\\\n\t\t\t-template (optional) Format string that will override global template or buttontemplate',\n\t\t-required='type',\n\t\t-optional='name',\n\t\t-optional='id',\t\n\t\t-optional='dbfield',\n\t\t-optional='value',\n\t\t-optional='hint',\n\t\t-optional='options',\n\t\t-optional='multiple',\n\t\t-optional='linebreak',\n\t\t-optional='default',\n\t\t-optional='label',\n\t\t-optional='size',\n\t\t-optional='maxlength',\n\t\t-optional='rows',\n\t\t-optional='cols',\n\t\t-optional='focus',\n\t\t-optional='class',\n\t\t-optional='disabled',\n\t\t-optional='raw',\n\t\t-optional='confirmmessage',\n\t\t-optional='required',\n\t\t-optional='validate', -type='tag',\n\t\t-optional='filter', -type='tag',\n\t\t-optional='nowarning',\n\t\t-optional='after',\n\t\t-optional='template';\n\t\t// TODO: add optiontemplate to be able to format individual options\n\t\tlocal: 'timer'=knop_timer; \n\t\t\n\t\tlocal: '_type'=(local: 'type'), '_name'=(local: 'name'), 'originaltype'=(local: 'type');\n\t\tif: (map: 'addbutton', 'savebutton', 'deletebutton', 'cancelbutton') >> #_type;\n\t\t\t#originaltype = #_type;\n\t\t\t#_name = 'button_' + #_type;\n\t\t\t#_name -> (removetrailing: 'button');\n\t\t\t#_type = 'submit';\n\t\telse: #_type == 'reset' && (local: 'name') == '';\n\t\t\t#_name = 'button_' + #_type;\n\t\telse: (map: 'legend', 'fieldset', 'html') >> #_type && (local: 'name') == '';\n\t\t\t#_name = #_type;\n\t\telse;\n\t\t\tfail_if: (local: 'name') == '', -9956, 'form->addfield missing required parameter -name';\n\t\t/if;\n\t\t\n\t\t\n\t\tfail_if: !((self -> 'validfieldtypes') >> #_type), 7102, self -> error_msg(7202);\n\t\tfail_if: (map: 'select', 'radio', 'checkbox') >> #_type \n\t\t\t&& (local: 'options') -> type != 'array' \n\t\t\t&& (local: 'options') -> type != 'set' \n\t\t\t&& (local: 'options') -> type != 'series', \n\t\t\t-9956, 'Field type ' #_type ' requires -options array, set or series'; \n\t\tlocal: 'index'= (self -> 'fields') -> size + 1;\n\t\t(local_defined: 'after') \t? (#after -> type == 'string' && (self -> 'fields') >> #after \n\t\t\t\t\t\t\t\t\t\t? #index = (integer: ((self -> 'fields') -> (findindex: #after) -> first)) + 1\n\t\t\t\t\t\t\t\t\t\t| #after -> type == 'integer' ? #index= #after + 1);\n\t\tif: #_type == 'file';\n\t\t\t(self -> 'enctype') ='multipart/form-data';\n\t\t\t(self -> 'method') = 'post';\n\t\t/if;\n\t\tlocal: 'field'=(map: \n\t\t\t'required'=(local_defined: 'required') \t\t&& #required != false,\n\t\t\t'multiple'=(local_defined: 'multiple') \t\t&& #multiple != false,\n\t\t\t'linebreak'=(local_defined: 'linebreak') \t&& #linebreak != false,\n\t\t\t'focus'=(local_defined: 'focus') \t\t\t&& #focus != false,\n\t\t\t'nowarning'=(local_defined: 'nowarning') \t&& #nowarning != false,\n\t\t\t'disabled'=(local_defined: 'disabled') \t\t&& #disabled != false\n\t\t\t);\n\t\tif: (self -> 'exceptionfieldtypes') >> #_type;\n\t\t\t// || (map: 'legend', 'fieldset', 'html') >> #_type;\n\t\t\t// never make certain field types required\n\t\t\t#field -> insert('required'=false);\n\t\t/if;\n\n\t\t#field -> (insert: 'type'=#_type);\n\t\t#field -> (insert: 'name'=#_name);\n\n\t\tlocal_defined('id') ? #field -> insert('id' = #id);\n\t\tlocal_defined('hint') ? #field -> insert('hint' = #hint);\n\t\tlocal_defined('default') ? #field -> insert('default' = #default); \n\t\tlocal_defined('label') ? #field -> insert('label' = #label); \n\t\tlocal_defined('size') ? #field -> insert('size' = #size); \n\t\tlocal_defined('maxlength') ? #field -> insert('maxlength' = #maxlength); \n\t\tlocal_defined('rows') ? #field -> insert('rows' = #rows); \n\t\tlocal_defined('cols') ? #field -> insert('cols' = #cols); \n\t\tlocal_defined('class') ? #field -> insert('class' = #class); \n\t\tlocal_defined('raw') ? #field -> insert('raw' = #raw); \n\t\tlocal_defined('confirmmessage') ? #field -> insert('confirmmessage' = #confirmmessage);\n\t\tlocal_defined('originaltype') ? #field -> insert('originaltype' = #originaltype);\n\t\t(local_defined: 'template') ? #field -> (insert: 'template'=#template);\n\n\t\t#field -> (insert: 'dbfield'=( (local_defined: 'dbfield') ? #dbfield | #_name ) );\n\t\t(local_defined: 'value') ? #field -> (insert: 'defaultvalue'=#value);\n\t\t\n\t\t// the following params are stored as reference, so the values of the params can be altered after adding a field simply by changing the referenced variable. \n\t\tlocal_defined('options') ? #field -> insert('options' = @#options);\n\t\tlocal_defined('value') ? #field -> insert('value' = @#value);\n\t\tlocal_defined('validate') ? #field -> insert('validate' = @#validate);\n\t\tlocal_defined('filter') ? #field -> insert('filter' = @#filter);\n\t\t\n\t\t(self -> 'fields') -> (insert: #_name = @#field, #index);\n\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'copyfield', -description='Copies a form field to a new name.',\n\t\t-required='name',\n\t\t-required='newname';\n\t\tlocal: 'timer'=knop_timer; \n\t\tfail_if: #name == #newname, 7104, self -> error_msg(7104);\n\t\tif: (self -> 'fields') >> #name;\n\t\t\tlocal: 'copyfield'=(self -> 'fields') -> (find: #name) -> first -> value;\n\t\t\t#copyfield -> (insert: 'name' = #newname);\n\t\t\t(self -> 'fields') -> (insert: #newname = #copyfield);\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\n\tdefine_tag: 'init', -description='Initiates form to grab keyvalue and set formmode if we have a database connected to the form. \\\n\t\t\tDoes nothing if no database is specified. ',\n\t\t-optional='get',\n\t\t-optional='post',\n\t\t-optional='keyvalue';\n\t\tlocal: 'timer'=knop_timer; \n\t\t// Initiates form to grab keyvalue and set formmode if we have a database connected to the form. \n\t\t// TODO: should we run init if form is not valid? Now we have a condition in lib before running init. \n\t\t// TODO: how can we get the right formmode when showing an add form again after failed validation? Now we have an extra condition in lib for this\n\t\t\n\t\tif: (self -> 'database') -> type == 'database';\n\t\t\t(self -> 'db_keyvalue') = null;\n\t\t\t(self -> 'db_lockvalue') = null;\n\t\t\tlocal: '_params'=array,\n\t\t\t\t'source'='form',\n\t\t\t\t'field'=map;\n\t\t\t#_params = array;\n\t\t\tif: (local_defined: 'post');\n\t\t\t\t#_params -> (merge: client_postparams);\n\t\t\t/if;\n\t\t\tif: (local_defined: 'get');\n\t\t\t\t#_params -> (merge: client_getparams);\n\t\t\t/if;\n\t\t\tif: !(local_defined: 'post') && !(local_defined: 'get');\n\t\t\t\t#_params -> (merge: client_postparams);\n\t\t\t\t#_params -> (merge: client_getparams);\n\t\t\t/if;\n\t\t\t(self -> 'debug_trace') -> (insert: 'Init ');\n\t\t\n\t\t\tif: #_params >> '-lockvalue';\n\t\t\t\tif: #_params -> type == 'map';\n\t\t\t\t\t(self -> 'db_lockvalue')=((#_params -> (find: '-lockvalue' ) ) != '' \n\t\t\t\t\t\t? (#_params -> (find: '-lockvalue' ) ) | null);\n\t\t\t\telse;\n\t\t\t\t\t(self -> 'db_lockvalue')=((#_params -> (find: '-lockvalue' ) -> first -> value) != '' \n\t\t\t\t\t\t? (#_params -> (find: '-lockvalue' ) -> first -> value) | null);\n\t\t\t\t/if;\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': grabbing lockvalue from form ' + (self -> 'db_lockvalue'));\n\t\t\telse: (local_defined: 'keyvalue');\n\t\t\t\t(self -> 'db_keyvalue') = #keyvalue;\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': grabbing keyvalue from parameter ' + (self -> 'db_keyvalue'));\n\t\t\telse: #_params >> (self -> 'keyparamname');\n\t\t\t\tif: #_params -> type == 'map';\n\t\t\t\t\t(self -> 'db_keyvalue')=((#_params -> (find: (self -> 'keyparamname') ) ) != '' \n\t\t\t\t\t\t? (#_params -> (find: (self -> 'keyparamname') ) ) | null);\n\t\t\t\telse;\n\t\t\t\t\t(self -> 'db_keyvalue')=((#_params -> (find: (self -> 'keyparamname') ) -> first -> value) != '' \n\t\t\t\t\t\t? (#_params -> (find: (self -> 'keyparamname') ) -> first -> value) | null);\n\t\t\t\t/if;\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': grabbing keyvalue from form ' + (self -> 'db_keyvalue'));\n\t\t\t/if;\n\t\t\tif: (self -> 'db_lockvalue') == '' && (self -> 'db_keyvalue') == '';\n\t\t\t\t// we have no keyvalue or lockvalue - this must be an add operation\n\t\t\t\t(self -> 'formmode') = 'add';\n\t\t\t\t// create a keyvalue for the record to add\n\t\t\t\t(self -> 'db_keyvalue') = knop_unique;\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': generating keyvalue ' + (self -> 'db_keyvalue'));\n\t\t\telse: (self -> getbutton) == 'add';\n\t\t\t\t(self -> 'formmode') = 'add';\n\t\t\telse: (self -> formmode)=='';\n\t\t\t\t(self -> 'formmode') = 'edit';\n\t\t\t/if;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': formmode ' + (self -> formmode));\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\n\tdefine_tag: 'loadfields', -description='Overwrites all field values with values from either database, action_params or explicit -params. \\\n\t\t\t\tAuto-detects based on current lasso_currentaction.\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t\t-params (optional) Array or map to take field values from instead of database or submit (using dbnames)\\n\\\n\t\t\t\t-get (optional flag) Only getparams will be used\\n\\\n\t\t\t\t-post (optional flag) Only postparams will be used\\n\\\n\t\t\t\t-inlinename (optional) The first record in the result from the specified inline will be used as field values\\n\\ \n\t\t\t\t-database (optional) If a database object is specified, the first record from the latest search result of the database object will be used. \\\n\t\t\t\t\tIf -database is specified as flag (no value) and the form object has a database object attached to it, that database object will be used.',\n\t\t-optional='params',\n\t\t-optional='post',\n\t\t-optional='get',\n\t\t-optional='inlinename',\n\t\t-optional='database';\n\t\tlocal: 'timer'=knop_timer; \n\t\tlocal: '_params'=array,\n\t\t\t'source'='form',\n\t\t\t'field'=map;\n\t\t(self -> 'fieldsource') = null;\n\t\tif: (local_defined: 'params');\n\t\t\t(self -> 'fieldsource') = 'params';\n\t\t\tlocal: 'source'='params';\n\t\t\t#_params = #params;\n\t\telse: (local_defined: 'database') && !(local_defined: 'inlinename');\n\t\t\tif: #database -> type == 'database';\n\t\t\t\tlocal: 'inlinename'=#database -> inlinename;\n\t\t\telse: self -> 'database' -> type == 'database';\n\t\t\t\tlocal: 'inlinename'=self -> 'database' -> inlinename;\n\t\t\t/if;\n\t\t/if;\n\t\t\t\n\t\tif: (local_defined: 'inlinename');\n\t\t\t(self -> 'fieldsource') = 'database';\n\t\t\tlocal: 'source'='params';\n\t\t\t#_params=map;\n\t\t\trecords: -inlinename=#inlinename;\n\t\t\t\tloop: (field_name: -count);\n\t\t\t\t\t#_params -> (insert: (field_name: loop_count) = (field: (field_name: loop_count)) );\n\t\t\t\t/loop;\n\t\t\t\tloop_abort;\n\t\t\t/records;\n\t\telse: (self -> 'fieldsource') == null && lasso_currentaction != 'nothing';\n\t\t\t(self -> 'fieldsource') = 'database';\n\t\t\tlocal: 'source'='database';\n\t\telse: (self -> 'fieldsource') == null;\n\t\t\t(self -> 'fieldsource') = 'form';\n\t\t\t#_params = array;\n\t\t\tif: (local_defined: 'post');\n\t\t\t\t#_params -> (merge: client_postparams);\n\t\t\t/if;\n\t\t\tif: (local_defined: 'get');\n\t\t\t\t#_params -> (merge: client_getparams);\n\t\t\t/if;\n\t\t\tif: !(local_defined: 'post') && !(local_defined: 'get');\n\t\t\t\t#_params -> (merge: client_postparams);\n\t\t\t\t#_params -> (merge: client_getparams);\n\t\t\t/if;\n\t\t/if;\n\t\t(self -> 'debug_trace') -> (insert: tag_name + ': loading field values from ' + (self -> 'fieldsource'));\n\t\tlocal('fieldnames_done'=map, 'fields_samename'=array, 'params_fieldname'=array);\n\t\titerate: (self -> 'fields'), (local: 'fieldpair');\n\t\t\t//#field = @(#fieldpair -> value);\n\t\t\tif: (self -> 'exceptionfieldtypes') !>> #fieldpair -> value -> (find: 'type') // do not load data for excluded form fields (maybe it should do that in some cases???)\n\t\t\t\t// && (map: 'legend', 'fieldset', 'html') !>> #fieldpair -> value -> (find: 'type')\n\t\t\t\t&& !(#fieldpair -> name -> (beginswith: '-')); // exclude field names that begin with \"-\"\n\t\t\t\tif(#fieldnames_done !>> #fieldpair -> name); // check if we are already done with this field name (for multiple fields with the same name)\n\t\t\t\t\t// find all fields with the same name\n\t\t\t\t\t#fields_samename = @((self -> 'fields') -> find(#fieldpair -> name));\n\t\t\t\t\t#params_fieldname = @(#_params -> find(#fieldpair -> name));\n\t\t\t\t\tif: #source == 'database' && found_count > 0;\n\t\t\t\t\t\t// load field values from database\n\t\t\t\t\t\tif: (#fieldpair -> value -> find: 'dbfield') != '';\n\t\t\t\t\t\t\t// first remove value to break reference\n\t\t\t\t\t\t\t(#fieldpair -> value) -> (remove: 'value');\n\t\t\t\t\t\t\t(#fieldpair -> value) -> (insert: 'value'=(field: (#fieldpair -> value -> find: 'dbfield')) );\n\t\t\t\t\t\t/if;\n\t\t\t\t\telse: #source == 'params';\n\t\t\t\t\t\t// load field values from explicit -params using dbfield names\n\t\t\t\t\t\tif: #_params >> (#fieldpair -> value -> find: 'dbfield') && (#fieldpair -> value -> find: 'dbfield') != '';\n\t\t\t\t\t\t\t// first remove value to break reference\n\t\t\t\t\t\t\t(#fieldpair -> value) -> (remove: 'value');\n\t\t\t\t\t\t\tif(#_params -> isa('map'));\n\t\t\t\t\t\t\t\t(#fieldpair -> value) -> (insert: 'value'=(#_params -> (find: (#fieldpair -> value -> find: 'dbfield') ) ) );\n\t\t\t\t\t\t\t/*else: #_params -> (find: (#fieldpair -> value -> find: 'dbfield') ) -> size > 1;\n\t\t\t\t\t\t\t\t// multiple field values\n\t\t\t\t\t\t\t\tlocal: 'valuearray'=array;\n\t\t\t\t\t\t\t\titerate: #_params -> (find: (#fieldpair -> value -> find: 'dbfield')), (local: 'parampair');\n\t\t\t\t\t\t\t\t\t#parampair -> value != '' ? #valuearray -> (insert: #parampair -> value);\n\t\t\t\t\t\t\t\t/iterate;\n\t\t\t\t\t\t\t\t(#fieldpair -> value) -> (insert: 'value'=#valuearray);*/\n\t\t\t\t\t\t\telse(#_params -> isa('array'));\n\t\t\t\t\t\t\t\t(#fieldpair -> value) -> (insert: 'value'=(#_params -> (find: (#fieldpair -> value -> find: 'dbfield')) -> first -> value) );\n\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t/if;\n\t\t\t\t\telse: #source == 'form';\n\t\t\t\t\t\t// load field values from form submission\n\t\t\t\t\t\titerate(#fields_samename, local('fieldpair_samename'));\n\t\t\t\t\t\t\t// first remove value to break reference\n\t\t\t\t\t\t\t(#fieldpair_samename -> value) -> (remove: 'value');\n\t\t\t\t\t\t\tif(#params_fieldname -> size == #fields_samename -> size);\n\t\t\t\t\t\t\t\t// the number of submitted fields match the number of fields in the form\n\t\t\t\t\t\t\t\t(#fieldpair_samename -> value) -> (insert: 'value'=(#params_fieldname -> get(loop_count) -> value) );\n\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\tif: #params_fieldname -> size > 1;\n\t\t\t\t\t\t\t\t\t// multiple field values\n\t\t\t\t\t\t\t\t\tlocal: 'valuearray'=array;\n\t\t\t\t\t\t\t\t\titerate: #_params -> (find: (#fieldpair -> name)), (local: 'parampair');\n\t\t\t\t\t\t\t\t\t\t#parampair -> value != '' ? #valuearray -> (insert: #parampair -> value);\n\t\t\t\t\t\t\t\t\t/iterate;\n\t\t\t\t\t\t\t\t\t(#fieldpair_samename -> value) -> (insert: 'value'=#valuearray);\n\t\t\t\t\t\t\t\telse: #_params >> (#fieldpair -> name);\n\t\t\t\t\t\t\t\t\t(#fieldpair_samename -> value) -> (insert: 'value'=(#_params -> (find: #fieldpair_samename -> name) -> first -> value) );\n\t\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\t\t(#fieldpair_samename -> value) -> (insert: 'value'='');\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t/iterate;\n\t\t\t\t\t\t#fieldnames_done -> insert(#fieldpair -> name);\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t\t// apply filtering of field value (do this for all instances of the same field name, so outside of the #fieldnames_done check\n\t\t\t\tif(#fieldpair -> value -> find('filter') -> isa('tag'));\n\t\t\t\t\t(#fieldpair -> value) -> insert('value'= (#fieldpair -> value -> find('filter')) -> run(-params=(#fieldpair -> value -> find('value'))));\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t/iterate;\n\t\t\n\t\t// capture keyvalue or lockvalue if we have a database object connected to the form\n\t\tif: (self -> 'database') -> type == 'database';\n\t\t\t//(self -> 'db_keyvalue') = null;\n\t\t\t//(self -> 'db_lockvalue') = null;\n\t\t\tif: (self -> 'fieldsource') == 'database';\n\t\t\t\tif: (self -> 'database') -> lockfield != '' && (self -> 'database') -> lockvalue != '';\n\t\t\t\t\t(self -> 'db_lockvalue') = (self -> 'database') -> lockvalue_encrypted;\n\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': grabbing lockvalue from database ' + (self -> 'db_lockvalue'));\n\t\t\t\telse: (self -> 'database') -> keyfield != '' && (self -> 'database') -> keyvalue != '';\n\t\t\t\t\t(self -> 'db_keyvalue') = (self -> 'database') -> keyvalue;\n\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': grabbing keyvalue from database ' + (self -> 'db_keyvalue'));\n\t\t\t\t/if;\n\t\t\telse;\n\t\t\t\tif: #_params >> '-lockvalue';\n\t\t\t\t\tif: #_params -> type == 'map';\n\t\t\t\t\t\t(self -> 'db_lockvalue')=((#_params -> (find: '-lockvalue' ) ) != '' \n\t\t\t\t\t\t\t? (#_params -> (find: '-lockvalue' ) ) | null);\n\t\t\t\t\telse;\n\t\t\t\t\t\t(self -> 'db_lockvalue')=((#_params -> (find: '-lockvalue' ) -> first -> value) != '' \n\t\t\t\t\t\t\t? (#_params -> (find: '-lockvalue' ) -> first -> value) | null);\n\t\t\t\t\t/if;\n\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': grabbing lockvalue from form ' + (self -> 'db_lockvalue'));\n\t\t\t\telse: #_params >> (self -> 'keyparamname');\n\t\t\t\t\tif: #_params -> type == 'map';\n\t\t\t\t\t\t(self -> 'db_keyvalue')=((#_params -> (find: (self -> 'keyparamname') ) ) != '' \n\t\t\t\t\t\t\t? (#_params -> (find: (self -> 'keyparamname') ) ) | null);\n\t\t\t\t\telse;\n\t\t\t\t\t\t(self -> 'db_keyvalue')=((#_params -> (find: (self -> 'keyparamname') ) -> first -> value) != '' \n\t\t\t\t\t\t\t? (#_params -> (find: (self -> 'keyparamname') ) -> first -> value) | null);\n\t\t\t\t\t/if;\n\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': grabbing keyvalue from form ' + (self -> 'db_keyvalue'));\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t\tif: (self -> 'db_lockvalue') == '' && (self -> 'db_keyvalue') == '';\n\t\t\t\t// we have no keyvalue or lockvalue - this must be an add operation\n\t\t\t\t(self -> 'formmode') = 'add';\n\t\t\t\t// create a keyvalue for the record to add\n\t\t\t\t(self -> 'db_keyvalue') = knop_unique;\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': generating keyvalue ' + (self -> 'db_keyvalue'));\n\t\t\telse: (self -> formmode) == '';\n\t\t\t\t(self -> 'formmode') = 'edit';\n\t\t\t/if;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': formmode ' + (self -> formmode));\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'clearfields', -description='Emtpies all form field values';\n\t\tlocal: 'timer'=knop_timer; \n\t\titerate: (self -> 'fields'), (local: 'fieldpair');\n\t\t\tif: (self -> 'exceptionfieldtypes') !>> #fieldpair -> value -> (find: 'type');\n\t\t\t\t// && (map: 'legend', 'fieldset', 'html') !>> #fieldpair -> value -> (find: 'type');\n\t\t\t\t// first remove value to break reference\n\t\t\t\t(#fieldpair -> value) -> (remove: 'value');\n\t\t\t\t(#fieldpair -> value) -> (insert: 'value'='');\n\t\t\t/if;\n\t\t/iterate;\t\n\t\tif: (self -> 'database') -> type == 'database';\n\t\t\t(self -> 'db_keyvalue') = null;\n\t\t\t(self -> 'db_lockvalue') = null;\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'resetfields', -description='Resets all form field values to their initial values';\n\t\tlocal: 'timer'=knop_timer; \n\t\titerate: (self -> 'fields'), (local: 'fieldpair');\n\t\t\tif: (self -> 'exceptionfieldtypes') !>> #fieldpair -> value -> (find: 'type');\n\t\t\t\t//&& (map: 'legend', 'fieldset', 'html') !>> #fieldpair -> value -> (find: 'type');\n\t\t\t\t// first remove value to break reference\n\t\t\t\t(#fieldpair -> value) -> (remove: 'value');\n\t\t\t\t(#fieldpair -> value) -> (insert: 'value'=#fieldpair -> value -> (find: 'defaultvalue'));\n\t\t\t/if;\n\t\t/iterate;\t\n\t\tif: (self -> 'database') -> type == 'database';\n\t\t\t(self -> 'db_keyvalue') = null;\n\t\t\t(self -> 'db_lockvalue') = null;\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'validate', -description='Performs validation and fills a transient array with field names that have input errors. \\\n\t\t\t\t form -> loadfields must be called first.';\n\t\tlocal: 'timer'=knop_timer; \n\t\t\n\t\t// Performs validation and fills a transient array with field names that have input errors.\n\t\t// Must call -> loadfields first\n\t\tif: (self -> 'errors') == null;\n\t\t\t// initiate the errors array so we know validate has been performed\n\t\t\t(self -> 'errors') = array;\n\t\t\titerate: (self -> 'fields'), (local: 'fieldpair');\n\t\t\t\tif: !( (self -> 'exceptionfieldtypes') >> #fieldpair -> value -> (find: 'type') );\n\t\t\t\t\tif: (#fieldpair -> value -> (find: 'required') ) \n\t\t\t\t\t\t&& (#fieldpair -> value -> (find: 'value') ) == '';\n\t\t\t\t\t\t(self -> 'errors') -> (insert: (#fieldpair -> value -> (find: 'name') ));\n\t\t\t\t\t/if;\n\t\t\t\t\tif(#fieldpair -> value -> find('validate') -> isa('tag'));\n\t\t\t\t\t\t// perform validation expression on the field value\n\t\t\t\t\t\tlocal('result'=(#fieldpair -> value -> find('validate')) -> run(-params=#fieldpair -> value -> find('value')));\n\t\t\t\t\t\tif(#result === true || #result === 0);\n\t\t\t\t\t\t\t// validation was ok\n\t\t\t\t\t\telse(#result != 0 || #result -> size);\n\t\t\t\t\t\t\t// validation result was an error code or message\n\t\t\t\t\t\t\t(self -> 'errors') -> insert(#fieldpair -> value -> find('name') = #result);\n\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t(self -> 'errors') -> insert(#fieldpair -> value -> find('name'));\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t/if;\n\t\t(self -> 'debug_trace') -> (insert: tag_name + ': form is valid ' + ((self -> 'errors') -> size == 0));\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'isvalid', -description='Returns the result of form -> validate (true/false) without performing the validation again (unless it hasn\\'t been performed already)';\n\t\tlocal: 'timer'=knop_timer; \n\t\t// Returns the result of -> validate (true/false) without performing the validation again (unless it is needed)\n\t\t(self -> 'errors') == null ? self -> validate;\n\t\t(self -> 'debug_trace') -> (insert: tag_name + ': form is valid ' + ((self -> 'errors') -> size == 0));\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: (self -> 'errors') -> size == 0;\n\t/define_tag;\n\n\n\tdefine_tag: 'adderror', -description='adds the name for a field that has validation error, used for custom field validation. \\\n\t\t\t\tcalls form -> validate first if needed',\n\t\t-required='fieldname';\n\t\tlocal: 'timer'=knop_timer; \n\t\t// adds a field that has error\n\t\t// calls ->validate first if needed, to make sure self -> 'errors' is an array\n\t\t(self -> 'errors') == null ? self -> validate;\n\t\t(self -> 'errors') -> (insert: #fieldname);\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\n\tdefine_tag: 'errors', -description='Returns an array with fields that have input errors, or empty array if no errors or form has not been validated';\n\t\t// returns an array with fields that have input errors, or emtpy array if no errors or form has not been validated\n\t\tif: (self -> 'errors') == null;\n\t\t\treturn: array;\n\t\telse;\n\t\t\treturn: (self -> 'errors');\n\t\t/if;\n\t/define_tag;\n\n\n\n\tdefine_tag: 'updatefields', -description='Returns a pair array with fieldname=value, or optionally SQL string to be used in an update inline.\\\n\t\tform -> loadfields must be called first.\\n\\\n\t\tParameters:\\n\\\n\t\t-sql (optional)\\n\\\n\t\t-removedotbackticks (optional flag) Use with -sql for backward compatibility for fields that contain periods. If you use periods in a fieldname then you cannot use a JOIN in Knop.',\n\t\t-optional='sql',\n\t\t-optional='removedotbackticks';\n\t\tlocal: 'timer'=knop_timer; \n\t\t// Returns a pair array with fieldname=value, or optionally SQL string to be used in an update inline. Optionally use -removedotbackticks with -sql for backward compatibility with fields that contain periods.\n\t\t// Must call ->loadfields first.\n\t\tlocal: 'output'=array,\n\t\t\t'_sql'=(local_defined: 'sql'),\n\t\t\t'_removedotbackticks'=(local_defined: 'removedotbackticks'),\n\t\t\t'fieldvalue'=null, 'onevalue'=null;\n\t\titerate: (self -> 'fields'), (local: 'fieldpair');\n\t\t\tif: !( (self -> 'exceptionfieldtypes') >> #fieldpair -> value -> (find: 'type') )\n\t\t\t\t&& !(#fieldpair -> value -> (find: 'name') -> (beginswith: '-'))\n\t\t\t\t&& (#fieldpair -> value -> (find: 'dbfield')) != '';\n\t\t\t\t// don't use submit etc and exclude fields whose name begins with -\n\t\t\t\t#fieldvalue = (#fieldpair -> value -> (find: 'value') );\n\t\t\t\tif: #fieldvalue -> type != 'array';\n\t\t\t\t\t// to support multiple values for one fieldname, like checkboxes\n\t\t\t\t\t#fieldvalue = array: #fieldvalue;\n\t\t\t\t/if;\n\t\t\t\tif: #_sql;\n\t\t\t\t\tif(#_removedotbackticks);\n\t\t\t\t\t\t#output -> (insert: '`' + (encode_sql(knop_stripbackticks(#fieldpair -> value -> find('dbfield'))) ) + '`' \n\t\t\t\t\t\t\t+ '=\"' + (encode_sql: (#fieldvalue -> (join: ',')) ) + '\"');\n\t\t\t\t\telse;\n\t\t\t\t\t\t#output -> (insert: '`' + (encode_sql(string_replace(knop_stripbackticks(#fieldpair -> value -> find('dbfield')), -find='.', -replace='`.`')) ) + '`' \n\t\t\t\t\t\t+ '=\"' + (encode_sql: (#fieldvalue -> (join: ',')) ) + '\"');\n\t\t\t\t\t/if;\n\t\t\t\telse;\n\t\t\t\t\titerate: #fieldvalue, #onevalue;\n\t\t\t\t\t\t#output -> (insert: (#fieldpair -> value -> (find: 'dbfield') ) \n\t\t\t\t\t\t\t= #onevalue );\n\t\t\t\t\t/iterate;\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t/iterate;\n\t\tif: #_sql;\n\n\t\t\t#output = '(' + #output -> (join: ',') + ')';\n\n\t\t/if;\n\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @#output;\n\t\t\n\t/define_tag;\n\t\n\t\n\tdefine_tag: 'getbutton', -description='Returns what button was clicked on the form on the previous page. Assumes that submit buttons are named button_add etc. \\\n\t\t\t\tReturns add, update, delete, cancel or any custom submit button name that begins with button_.';\n\t\tlocal: 'timer'=knop_timer; \n\t\tif: (self -> 'formbutton') != '';\n\t\t\t// we have already found out once what button was clicked\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': cached ' + (self -> 'formbutton'));\n\t\t\tself -> 'tagtime_tagname'=tag_name;\n\t\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t\treturn: (self -> 'formbutton');\n\t\t/if;\n\t\tlocal: 'clientparams'=client_getparams;\n\t\t#clientparams -> (merge: client_postparams);\n\t\t// look for submit buttons, the least destructive first\n\t\titerate: (array: 'cancel', 'save', 'add', 'delete'), (local: 'buttonname');\n\t\t\tif: #clientparams >> 'button_' + #buttonname \n\t\t\t\t|| #clientparams >> 'button_' + #buttonname + '.x'\n\t\t\t\t|| #clientparams >> 'button_' + #buttonname + '.y';\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': built-in button name ' + #buttonname);\n\t\t\t\t(self -> 'formbutton') = #buttonname;\n\t\t\t\tself -> 'tagtime_tagname'=tag_name;\n\t\t\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t\t\treturn: #buttonname;\n\t\t\t/if;\n\t\t/iterate;\n\t\t// no button found yet - look for custom button names\n\t\titerate: #clientparams, #buttonname;\n\t\t\t#buttonname -> type == 'pair' ? #buttonname = #buttonname -> name;\n\t\t\tif: #buttonname -> (beginswith: 'button_');\n\t\t\t\t#buttonname -> (removeleading: 'button_') & (removetrailing: '.x') & (removetrailing: '.y');\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': custom button name ' + #buttonname);\n\t\t\t\t(self -> 'formbutton') = #buttonname;\n\t\t\t\tself -> 'tagtime_tagname'=tag_name;\n\t\t\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t\t\treturn: #buttonname;\n\t\t\t/if;\n\t\t/iterate;\n\t\t(self -> 'debug_trace') -> (insert: tag_name + ': No button found');\n\t/define_tag;\n\t\n\tdefine_tag: 'process', -description='Automatically handles a form submission and handles add, update, or delete. \\\n\t\t\t\tRequires that a database object is specified for the form',\n\t\t-optional='user',\n\t\t-optional='lock',\n\t\t-optional='keyvalue';\n\t\tlocal: 'timer'=knop_timer; \n\t\tfail_if: (self -> 'database') -> type != 'database', 7103, self -> error_msg(7103);\n\n\t\t(self -> 'error_code') = 0;\n\t\t(self -> 'error_msg') = string;\n\t\t\n\t\tif: self -> getbutton == 'cancel';\n\t\t\t// do nothing at all\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': cancelling ');\n\t\t\t\n\t\telse: self -> getbutton == 'save';\n\t\t\tself -> loadfields;\n\t\t\tif: self -> isvalid;\n\t\t\t\tif: (local_defined: 'user') && (self -> lockvalue) != '';\n\t\t\t\t\t(self -> database) -> (saverecord: (self -> updatefields), -lockvalue=(self -> lockvalue), -keyvalue=(self -> keyvalue), -user=#user);\n\t\t\t\telse;\n\t\t\t\t\t(self -> database) -> (saverecord: (self -> updatefields), -keyvalue=(self -> keyvalue));\n\t\t\t\t/if;\n\t\t\t\tif: self -> database -> error_code != 0;\n\t\t\t\t\t(self -> 'error_code') = self -> database -> error_code;\n\t\t\t\t\t(self -> 'error_msg') = 'Process: update record error ' + (self -> database -> error_msg);\n\t\t\t\t/if;\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': updating record ' + (self -> database -> error_msg) + ' ' + (self -> database -> error_code));\n\t\t\telse;\n\t\t\t\t(self -> 'error_code') = 7101; // Process: update record did not pass form validation\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': update record did not pass form validation');\n\t\t\t/if;\n\t\t\n\t\telse: self -> getbutton == 'add';\n\t\t\tself -> loadfields;\n\t\t\tif: self -> isvalid;\n\t\t\t\t(self -> database) -> (addrecord: (self -> updatefields), -keyvalue=(self -> keyvalue));\n\t\t\t\tif: self -> database -> error_code != 0;\n\t\t\t\t\t(self -> 'error_code') = self -> database -> error_code;\n\t\t\t\t\t(self -> 'error_msg') = 'Process: add record error ' + (self -> database -> error_msg);\n\t\t\t\t/if;\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': adding record ' + (self -> database -> error_msg) + ' ' + (self -> database -> error_code));\n\t\t\telse;\n\t\t\t\t(self -> 'error_code') = 7101; // Process: add record did not pass form validation\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': add record did not pass form validation');\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': reverting form mode to add');\n\t\t\t/if;\n\n\t\telse: self -> getbutton == 'delete';\n\t\t\tself -> loadfields;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': will delete record with keyvalue ' + (self -> keyvalue) + ' lockvalue ' + (self -> lockvalue));\n\t\t\tif: (local_defined: 'user') && (self -> lockvalue) != '';\n\t\t\t\t(self -> database) -> (deleterecord: -lockvalue=(self -> lockvalue), -keyvalue=(self -> keyvalue), -user=#user);\n\t\t\telse;\n\t\t\t\t(self -> database) -> (deleterecord: -keyvalue=(self -> keyvalue));\n\t\t\t/if;\n\t\t\tif: self -> database -> error_code == 0;\n\t\t\t\tself -> resetfields;\n\t\t\telse;\n\t\t\t\t(self -> 'error_code') = self -> database -> error_code;\n\t\t\t\t(self -> 'error_msg') = 'Process: delete record error ' + (self -> database -> error_msg);\n\t\t\t/if;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': deleting record ' + (self -> database -> error_msg) + ' ' + (self -> database -> error_code));\n\t\telse: false;\n\t\t\t// do not go here, database record should be loaded with a separate call\n\t\t\tif: (local_defined: 'lock');\n\t\t\t\tself -> database ->(getrecord: (local: 'keyvalue'), -lock, -user=#user);\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': loading record using lock' + (self -> database -> error_msg) + ' ' + (self -> database -> error_code));\n\t\t\telse;\n\t\t\t\tself -> database ->(getrecord: (local: 'keyvalue'), -user=#user);\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': loading record' + (self -> database -> error_msg) + ' ' + (self -> database -> error_code));\n\t\t\t/if;\n\t\t\tself -> (loadfields: -inlinename=(self -> database -> inlinename));\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'setformat', -description='Defines a html template for the form. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-template (optional string) html template, defaults to #label# #field##required#
\\n\\\n\t\t\t-buttontemplate (optional string) html template for buttons, defaults to #field#\\n\\\n\t\t\t-required (optional string) character(s) to display for required fields (used for #required#), defaults to *\\n\\\n\t\t\t-legend (optional string) legend for the entire form - if specified, a fieldset will also be wrapped around the form\\n\\\n\t\t\t-class (optional string) css class name that will be used for the form element, default none\\n\\\n\t\t\t-errorclass (optional string) css class name that will be used for the label to highlight input errors, if not defined style=\"color: red\" will be used\\n\\\n\t\t\t-unsavedmarker (optional string) \\n\\\n\t\t\t-unsavedmarkerclass (optional string) \\n\\\n\t\t\t-unsavedwarning (optional string)',\n\t\t-optional='template', -type='string',\n\t\t-optional='buttontemplate', -type='string',\n\t\t-optional='required', -type='string',\n\t\t-optional='legend', -type='string',\n\t\t-optional='class', -type='string',\n\t\t-optional='errorclass', -type='string',\n\t\t-optional='unsavedmarker', -type='string',\n\t\t-optional='unsavedmarkerclass', -type='string',\n\t\t-optional='unsavedwarning', -type='string';\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tlocal_defined('template') ? (self -> 'template') = #template;\n\t\tlocal_defined('buttontemplate') ? (self -> 'buttontemplate') = #buttontemplate;\n\t\tlocal_defined('required') ? (self -> 'required') = #required;\n\t\tlocal_defined('legend') ? (self -> 'legend') = #legend;\n\t\tlocal_defined('class') ? (self -> 'class') = #class;\n\t\tlocal_defined('errorclass') ? (self -> 'errorclass') = #errorclass;\n\t\tlocal_defined('unsavedmarker') ? (self -> 'unsavedmarker') = #unsavedmarker;\n\t\tlocal_defined('unsavedmarkerclass') ? (self -> 'unsavedmarkerclass') = #unsavedmarkerclass;\n\t\tlocal_defined('unsavedwarning') ? (self -> 'unsavedwarning') = #unsavedwarning;\n\n\t\tif: local_defined: 'unsavedwarning';\n\t\t\t// escape quotes for javascript\n\t\t\t(self -> 'unsavedwarning') -> (replace: '\\'', '\\\\\\'');\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\n\tdefine_tag: 'renderform', -description='Outputs HTML for the form fields, a specific field, a range of fields or all fields of a specific type. \\\n\t\t\tAlso inserts all needed javascripts into the page. \\\n\t\t\tUse form -> setformat first to specify the html format, otherwise default format #label# #field##required#
is used. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-name (optional) Render only the specified field\\n\\\n\t\t\t-from (optional) Render form fields from the specified number index or field name. Negative number count from the last field.\\n\\\n\t\t\t-to (optional) Render form fields to the specified number index or field name. Negative number count from the last field.\\n\\\n\t\t\t-type (optional) Only render fields of this or these types (string or array)\\n\\\n\t\t\t-excludetype (optional) Render fields except of this or these types (string or array)\\n\\\n\t\t\t-legend (optional) Groups the rendered fields in a fieldset and outputs a legend for the fieldset\\n\\\n\t\t\t-start (optional) Only render the starting
tag\\n\\\n\t\t\t-end (optional) Only render the ending
tag\\n\\\n\t\t\t-xhtml (optional flag) XHTML valid output',\n\t\t-optional='name', -copy, \t// field name\n\t\t-optional='from', -copy, \t// number index or field name\n\t\t-optional='to', -copy, \t\t// number index or field name\n\t\t-optional='type', -copy,\t// only output fields of this or these types (string or array)\n\t\t-optional='excludetype', -copy,\t// output fields except of this or these types (string or array)\n\t\t-optional='legend',\t\t\t// groups the rendered fields in a fieldset and outputs a legend for the fieldset\n\t\t-optional='start',\t\t\t// only output the starting
tag\n\t\t-optional='end',\t\t\t// only output the ending
tag\n\t\t-optional='xhtml';\t\t\t// boolean, if set to true adjust output for XHTML\n\t\tlocal: 'timer'=knop_timer; \n\t\thandle;knop_debug('Done with ' + self->type + ' -> ' + tag_name, -time, -type=self->type);/handle;\n\t\t\n\t\t// Outputs HTML for the form fields\n\t\t\n\t\t/*\n\t\t\tTODO: \n\t\t\tHandling of multiple fields with the same name\n\t\t*/\n\t\tlocal: 'output'=string, \n\t\t\t'onefield'=map, \n\t\t\t'renderfield'=string, \n\t\t\t'renderfield_base'=string, \n\t\t\t'renderrow'=string,\n\t\t\t'formid'=null,\n\t\t\t'usehint'=array,\n\t\t\t'nowarning'=false,\n\t\t\t'fieldtype',\n\t\t\t'fieldvalue'=string,\n\t\t\t'fieldvalue_array'=array,\n\t\t\t'options'=array,\n\t\t\t'focusfield';\n\n\t\tlocal: 'clientparams'=client_getparams;\n\t\t#clientparams -> (merge: client_postparams);\n\t\t#clientparams -> (removeall: (self -> 'keyparamname'));\n\t\t#clientparams -> (removeall: '-lockvalue');\n\t\t#clientparams -> (removeall: '-action');\n\t\t#clientparams -> (removeall: '-xhtml');\n\n\t\t// local var that adjust tag endings if rendered for XHTML\n\t\tlocal: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');\n\n\t\t// page var to keep track of the number of forms that has been rendered on a page\n\t\tif: !(var_defined: 'knop_form_renderform_counter');\n\t\t\tvar: 'knop_form_renderform_counter'=0;\n\t\t/if;\n\t\t\n\t\t$knop_form_renderform_counter += 1;\n\n\t\tif: (self -> 'id') != '';\n\t\t\t#formid = (self -> 'id');\n\t\telse: (self -> 'name') != '';\n\t\t\t#formid = (self -> 'name');\n\t\telse;\n\t\t\t#formid = 'form' + $knop_form_renderform_counter;\n\t\t/if;\n\t\t\n\t\t\n\t\tlocal: 'renderformStartTag'=false, 'renderformEndTag'=false;\n\t\t// remove params that should not stop formstarttag and formendtag from rendering\n\t\tparams -> type == 'array' ? params -> (removeall: '-legend') & (removeall: '-xhtml');\n\t\tif: (self -> 'formaction') != null \n\t\t\t&& (params -> size == 0 || (local_defined: 'start') );\n\t\t\t#renderformStartTag=true;\n\t\t/if;\n\t\tif: (self -> 'formaction') != null \n\t\t\t&& (params -> size == 0 || (local_defined: 'end') );\n\t\t\t#renderformEndTag=true;\n\t\t/if;\n\t\tif: #renderformStartTag;\n\t\t\t// render opening form tag\n\n\t\t\t#output +=' 'debug_trace') -> insert(tag_name + ': formaction = ' + (self -> 'formaction'));\n\t\t\tif: (self -> 'formaction') != null;\n\t\t\t\t#output += ' action=\"' + (self -> 'formaction');\n\t\t\t\tif: (self -> 'method') == 'post' && !(self -> 'noautoparams');\n\t\t\t\t\tlocal: 'actionparams'=array;\n\t\t\t\t\titerate: #clientparams, (local: 'clientparam');\n\t\t\t\t\t\tif: #clientparam -> type == 'pair';\n\t\t\t\t\t\t\tif: #clientparam -> name -> (beginswith: '-') \n\t\t\t\t\t\t\t && !(#clientparam -> name -> (beginswith: '-upload.'))\n\t\t\t\t\t\t\t && !(#clientparam -> name -> (beginswith: '-upload2.'))\n\t\t\t\t\t\t\t\t&& #clientparam -> name != '-session'\n\t\t\t\t\t\t\t\t&& (self -> 'fields') !>> #clientparam -> name\n\t\t\t\t\t\t\t\t// check if param name appears in form action\n\t\t\t\t\t\t\t\t// turn param into [p][a][r][a][m] to avoid problems with most reserved regex characters like \".\"\n\t\t\t\t\t\t\t\t&& (string_findregexp: (self -> 'formaction'), -find='[?;&]['\n\t\t\t\t\t\t\t\t\t+ ((#clientparam -> name) -> (split: '') -> (join: '][')) \n\t\t\t\t\t\t\t\t\t+ ']([&=]|$)', -ignorecase) -> size == 0;\n\t\t\t\t\t\t\t\t#actionparams -> (insert: (#clientparam -> name) + '=' + (encode_url: (#clientparam -> value)) );\n\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\telse: #clientparam -> type == 'string' \n\t\t\t\t\t\t\t&& #clientparam -> (beginswith: '-') \n\t\t\t\t\t\t\t&& (self -> 'fields') !>> #clientparam\n\t\t\t\t\t\t\t// check if param appears in form action\n\t\t\t\t\t\t\t// turn param into [p][a][r][a][m] to avoid problems with most reserved regex characters like \".\"\n\t\t\t\t\t\t\t&& (string_findregexp: (self -> 'formaction'), -find='[?;&]['\n\t\t\t\t\t\t\t\t+ (#clientparam -> (split: '') -> (join: '][')) \n\t\t\t\t\t\t\t\t+ ']([&=]|$)', -ignorecase) -> size == 0;\n\t\t\t\t\t\t\t#actionparams -> (insert: #clientparam );\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/iterate;\n\t\t\t\t\tif: #actionparams -> size;\n\t\t\t\t\t\t#output += ((self -> 'formaction') >> '?' ? '&' | '?' ) + #actionparams -> (join: '&');\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t\t#output += '\"';\n\t\t\t/if;\n\t\t\t(self -> 'method') != null\t\t? #output += ' method=\"' + (self -> 'method') + '\"';\n\t\t\t(self -> 'name') != null\t\t? #output += ' name=\"' + (self -> 'name') + '\"';\n\t\t\t#output += ' id=\"' + #formid + '\"';\n\t\t\t(self -> 'class') != null\t\t? #output += ' class=\"' + (self -> 'class') + '\"';\n\t\t\t(self -> 'enctype') != ''\t\t? #output += ' enctype=\"' + (self -> 'enctype') + '\"';\n\t\t\t(self -> 'raw') != null\t\t\t? #output += ' ' + (self -> 'raw');\n\t\t\t!(self -> 'noscript') ? #output += ' onsubmit=\"return validateform(this)\"';\n\t\t\t(self -> 'entersubmitblock') && !(self -> 'noscript')\t? #output += ' onkeydown=\"return submitOk(event);\" onfocus=\"submitBlock=true; return true;\" onblur=\"submitBlock=false; return true;\"';\n\t\t\t#output += '>\\n';\n\n\n\t\t\tif: (self -> 'actionpath') != '' \n\t\t\t\t&& !(self -> 'noautoparams') \n\t\t\t\t&& (self -> 'fields') !>> '-action';\n\t\t\t\t// auto-add -action unless there is already an -action field in the form\n\t\t\t\t#output += ' 'actionpath')) + '\"' + #endslash + '>\\n';\n\t\t\t/if;\n\t\t\tif: (self -> 'fieldset');\n\t\t\t\t#output += '
\\n';\n\t\t\t\t#output +='' + (self -> 'legend') + '\\n';\n\t\t\t/if;\n\t\t\tif: (self -> 'method') == 'get' && !(self -> 'noautoparams');\n\t\t\t\titerate: #clientparams, (local: 'clientparam');\n\t\t\t\t\tif: #clientparam -> type == 'pair';\n\t\t\t\t\t\tif: #clientparam -> name -> (beginswith: '-')\n\t\t\t\t\t\t\t&& #clientparam -> name != '-session'\n\t\t\t\t\t\t\t&& (self -> 'fields') !>> #clientparam -> name\n\t\t\t\t\t\t\t// check if param name appears in form action\n\t\t\t\t\t\t\t// turn param into [p][a][r][a][m] to avoid problems with most reserved regex characters like .\n\t\t\t\t\t\t\t&& (string_findregexp: (self -> 'formaction'), -find='[?;&]['\n\t\t\t\t\t\t\t\t+ ((#clientparam -> name) -> (split: '') -> (join: '][')) \n\t\t\t\t\t\t\t\t+ ']([&=]|$)', -ignorecase) -> size == 0;\n\t\t\t\t\t\t\t#output += ' name) + '\" value=\"' + (encode_html: (#clientparam -> value)) + '\"' + #endslash + '>\\n';\n\t\t\t\t\t\t/if;\n\t\t\t\t\telse: #clientparam -> type == 'string' \n\t\t\t\t\t\t&& #clientparam -> (beginswith: '-')\n\t\t\t\t\t\t&& (self -> 'fields') !>> #clientparam\n\t\t\t\t\t\t// check if param appears in form action\n\t\t\t\t\t\t// turn param into [p][a][r][a][m] to avoid problems with most reserved regex characters like .\n\t\t\t\t\t\t&& (string_findregexp: (self -> 'formaction'), -find='[?;&]['\n\t\t\t\t\t\t\t+ (#clientparam -> (split: '') -> (join: ']['))\n\t\t\t\t\t\t\t+ ']([&=]|$)', -ignorecase) -> size == 0;\n\t\t\t\t\t\t#output += '\\n';\n\t\t\t\t\t/if;\n\t\t\t\t/iterate;\n\t\t\t/if;\n\t\t\tif: (self -> 'database') -> type == 'database';\n\t\t\t\tif: (self -> 'database') -> lockfield != '' && (self -> 'db_lockvalue') != '';\n\t\t\t\t\t#output += ' 'db_lockvalue')) + '\"' + #endslash + '>\\n';\n\t\t\t\telse: (self -> 'database') -> keyfield != '' && (self -> 'db_keyvalue') != '';\n\t\t\t\t\t#output += ' 'keyparamname') + '\" value=\"' + (encode_html: (self -> 'db_keyvalue')) + '\"' + #endslash + '>\\n';\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t/if;\n\t\t\n\t\t\n\t\tif: !(local_defined: 'start') && !(local_defined: 'end');\n\n\t\t\t(local_defined: 'name') && !((self -> 'fields') >> #name) \t? \treturn;\n\t\t\t\n\t\t\t(local_defined: 'name')\t\t? local: 'from'=#name, 'to'=#name;\n\t\t\t!(local_defined: 'from') \t\t? local: 'from'=1;\n\t\t\t!(local_defined: 'to') \t\t\t? local: 'to'=(self -> 'fields') -> size;\n\t\t\t!(local_defined: 'type')\t\t? local: 'type'=(self -> 'validfieldtypes');\n\t\t\t!(local_defined: 'excludetype')\t? local: 'excludetype'=map;\n\t\t\t#type -> type == 'string' \t\t? #type = (map: #type);\n\t\t\t#excludetype -> type == 'string' ? #excludetype = (map: #excludetype);\n\n\t\t\t// only render form inputs if we are not only rendering the form tags\n\t\t\n\t\t\t// use field name if #from is a string\n\t\t\t#from -> type == 'string' ? #from = integer: ((self -> 'fields') -> (findindex: #from) -> first);\n\t\t\t#from == 0 ? #from = 1;\n\t\t\t// negative numbers count from the end\n\t\t\t#from < 0 ? #from = (self -> 'fields') -> size + #from;\n\t\n\t\t\t// use field name if #to is a string\n\t\t\t#to -> type == 'string' ? #to = integer: ((self -> 'fields') -> (findindex: #to) -> last);\n\t\t\t#to == 0 ? #to = (self -> 'fields') -> size;\n\t\t\t// negative numbers count from the end\n\t\t\t#to < 0 ? #to = (self -> 'fields') -> size + #to;\n\n\t\t\t// sanity check\n\t\t\t#from > #to ? #to = #from;\n\t\n\t\t\tlocal: 'template'=( (self -> 'template') != '' \n\t\t\t\t? (self -> 'template') \t\t\n\t\t\t\t| '#label# #field##required#\\n' );\n\t\t\tlocal: 'buttontemplate'=( (self -> 'buttontemplate') != '' \n\t\t\t\t? (self -> 'buttontemplate') \n\t\t\t\t| (self -> 'template') != '' \n\t\t\t\t? (self -> 'template')\n\t\t\t\t| '#field#\\n' );\n\t\t\tlocal: 'requiredmarker'=(self -> 'required');\n\t\t\tlocal: 'defaultclass'=( (self -> 'class') != '' \n\t\t\t\t? (self -> 'class') \t\t\n\t\t\t\t| '');\n\t\t\tlocal: 'errorclass'=( (self -> 'errorclass') != '' \n\t\t\t\t? ' class=\"' + (self -> 'errorclass') + '\"' \n\t\t\t\t| ' style=\"color: red;\"');\n\t\t\t\n\t\t\tif: (local_defined: 'legend');\n\t\t\t\t(self -> 'render_fieldset2_open') = true;\n\t\t\t\t#output += '
\\n'\n\t\t\t\t\t+ '' + #legend + '\\n';\n\t\t\t/if;\n\n\t\t\titerate: (self -> 'fields'), (local: 'fieldpair');\n\t\t\t\t#onefield = #fieldpair -> value;\n\t\t\t\t#fieldvalue = (#onefield -> (find: 'value'));\n\t\t\t\t#fieldvalue_array = #fieldvalue;\n\t\t\t\tif: #fieldvalue_array -> type != 'array';\n\t\t\t\t\tif: #fieldvalue_array >> '\\r'; // Filemaker value list with multiple checked\n\t\t\t\t\t\t#fieldvalue_array = #fieldvalue_array -> (split: '\\r');\n\t\t\t\t\telse: #fieldvalue_array >> ','; // Other database with multiple checked\n\t\t\t\t\t\t#fieldvalue_array = #fieldvalue_array -> (split: ',');\n\t\t\t\t\telse;\n\t\t\t\t\t\t#fieldvalue_array = array: #fieldvalue_array;\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t\tif: #onefield >> 'options';\n\t\t\t\t\t#options = (#onefield -> find: 'options');\n\t\t\t\t\t// convert types for pair \n\t\t\t\t\titerate: #options, (local: 'option');\n\t\t\t\t\t\tif: #option -> type != 'pair';\n\t\t\t\t\t\t\t#option = (pair: #option = #option);\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t// name must be string to make sure comparsions work\n\t\t\t\t\t\t(#option -> name) = (string: #option -> name);\n\t\t\t\t\t/iterate;\n\t\t\t\t/if;\n\t\t\t\t\n\t\t\t\tif: loop_count >= #from \n\t\t\t\t\t&& loop_count <= #to\n\t\t\t\t\t&& #type >> #onefield -> (find: 'type')\n\t\t\t\t\t&& !(#excludetype >> #onefield -> (find: 'type'));\n\t\t\t\t\tif: (self -> 'unsavedwarning') == '';\n\t\t\t\t\t\t#nowarning=true;\n\t\t\t\t\telse;\n\t\t\t\t\t\t#nowarning=#onefield -> (find: 'nowarning');\n\t\t\t\t\t/if;\n\t\t\t\t\t\n\t\t\t\t\tif: #onefield -> (find: 'template') -> size;\n\t\t\t\t\t\t#renderrow = #onefield -> (find: 'template');\n\t\t\t\t\telse: (map: 'submit', 'reset', 'image') >> #onefield -> (find: 'type');\n\t\t\t\t\t\t#renderrow=#buttontemplate;\n\t\t\t\t\telse;\n\t\t\t\t\t\t#renderrow=#template;\n\t\t\t\t\t/if;\n\t\t\t\t\tlocal: 'id'= string;\n\t\t\t\t\tif: (#onefield -> (find: 'id')) !='';\n\t\t\t\t\t\t#id = (#onefield -> (find: 'id'));\n\t\t\t\t\telse;\n\t\t\t\t\t\t#id = #formid + '_' + (#onefield -> (find: 'name')) + loop_count;\n\t\t\t\t\t/if;\n\t\t\t\t\tif: (self -> 'errors') -> size == 0 && #focusfield == '' && #onefield -> (find: 'focus');\n\t\t\t\t\t\t// give this field focus\n\t\t\t\t\t\t#focusfield = #id;\n\t\t\t\t\t/if;\n\t\t\t\t\t\n\t\t\t\t\t// set field label, with error marker if field validation failed\n\t\t\t\t\t// if: (self -> 'exceptionfieldtypes') >> (#onefield -> (find: 'type')) && (#onefield -> (find: 'type')) != 'file';\n\t\t\t\t\t//\t#renderrow -> (replace: '#label#', '');\n\t\t\t\t\t//else: \n\t\t\t\t\tif: (self -> 'errors') -> type == 'array' && (self -> 'errors') >> (#onefield -> (find: 'name'));\n\t\t\t\t\t\t#renderrow -> (replace: '#label#', \n\t\t\t\t\t\t\t'');\n\t\t\t\t\t\tif: #focusfield == '';\n\t\t\t\t\t\t\t#focusfield = #id;\n\t\t\t\t\t\t/if;\n\t\t\t\t\telse;\n\t\t\t\t\t\t#renderrow -> (replace: '#label#', '');\n\t\t\t\t\t/if;\n\t\t\t\t\t\n\t\t\t\t\t// set markers for required fields \n\t\t\t\t\tif: #onefield -> (find: 'required') && !((self -> 'exceptionfieldtypes') >> (#onefield -> (find: 'type')) );\n\t\t\t\t\t\t#renderrow -> (replace: '#required#', (encode_smart: #requiredmarker));\n\t\t\t\t\telse;\n\t\t\t\t\t\t#renderrow -> (replace: '#required#', '');\n\t\t\t\t\t/if;\n\t\t\t\t\t#renderfield=string;\n\t\t\t\t\t#renderfield_base = ' name=\"' + (encode_html: (#onefield -> (find: 'name'))) + '\"'\n\t\t\t\t\t\t+ (#onefield >> 'class' ? ' class=\"' + (#onefield -> (find: 'class')) + '\"' \n\t\t\t\t\t\t\t| (#defaultclass != '' ? ' class=\"' + #defaultclass + '\"') )\n\t\t\t\t\t\t+ ' id=\"' + (encode_html: #id) + '\"'\n\t\t\t\t\t\t+ (#onefield >> 'raw'\t? ' ' + (#onefield -> (find: 'raw')) )\n\t\t\t\t\t\t+ (#onefield -> (find: 'disabled') ? ' disabled=\"disabled\"');\n\n\t\t\t\t\t#fieldtype=(#onefield -> (find: 'type'));\n\t\t\t\t\tif: #fieldtype == 'search' && client_type !>> 'WebKit';\n\t\t\t\t\t\t// only show (replace: '#label#', '');\n\t\t\t\t\t\t#renderrow -> (replace: '#required#', '');\n\t\t\t\t\t\t#renderfield = #fieldvalue + '\\n';\n\t\t\t\t\tcase: 'legend';\n\t\t\t\t\t\t#renderrow = '';\n\t\t\t\t\t\tif: (self -> 'render_fieldset_open');\n\t\t\t\t\t\t\t#output += '
\\n';\n\t\t\t\t\t\t\t(self -> 'render_fieldset_open') = false;\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t#output += '> 'class' ? ' class=\"' + (#onefield -> (find: 'class')) + '\"' \n\t\t\t\t\t\t\t\t| (#defaultclass != '' ? ' class=\"' + #defaultclass + '\"') )\n\t\t\t\t\t\t\t+ ((#onefield -> (find: 'id') != '') ? ' id=\"' + #id + '\"') \n\t\t\t\t\t\t\t+ '>\\n';\n\t\t\t\t\t\t(self -> 'render_fieldset_open') = true;\n\t\t\t\t\t\t#output += '' + (encode_html: #fieldvalue) + '\\n';\n\t\t\t\t\tcase: 'fieldset';\n\t\t\t\t\t\t#renderrow = '';\n\t\t\t\t\t\tif: (self -> 'render_fieldset_open');\n\t\t\t\t\t\t\t#output += '
\\n';\n\t\t\t\t\t\t\t(self -> 'render_fieldset_open') = false;\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\tif: #fieldvalue !== false;\n\t\t\t\t\t\t\t(self -> 'render_fieldset_open') = true;\n\t\t\t\t\t\t\t#output += '> 'class' ? ' class=\"' + (#onefield -> (find: 'class')) + '\"' \n\t\t\t\t\t\t\t\t| (#defaultclass != '' ? ' class=\"' + #defaultclass + '\"') )\n\t\t\t\t\t\t\t+ ((#onefield -> (find: 'id') != '') ? ' id=\"' + #id + '\"') \n\t\t\t\t\t\t\t+ '>\\n' + (encode_html: #fieldvalue) + '\\n'; // must contain a legend\n\t\t\t\t\t\t/if;\n\t\t\t\t\tcase: 'hidden';\n\t\t\t\t\t\t#renderfield += '';\n\t\t\t\t\t\t#renderrow = '';\n\t\t\t\t\t\t#output += #renderfield + '\\n';\n\t\t\t\t\tcase: 'text';\n\t\t\t\t\t\t#renderfield += '> 'size' \t? ' size=\"' + (#onefield -> (find: 'size')) + '\"' )\n\t\t\t\t\t\t\t+ (#onefield >> 'maxlength' \t? ' maxlength=\"' + (#onefield -> (find: 'maxlength')) + '\"' );\n\t\t\t\t\t\tif: !(self -> 'noscript') && (#onefield -> (find: 'hint')) != '';\n\t\t\t\t\t\t\t#renderfield += ' onfocus=\"clearHint(this)\" onblur=\"setHint(this, \\'' (#onefield -> (find: 'hint')) '\\')\"';\n\t\t\t\t\t\t\t#usehint -> (insert: (#onefield -> find: 'name') = #id);\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\tif: !(self -> 'noscript') && !#nowarning;\n\t\t\t\t\t\t\t#renderfield += ' onkeydown=\"dirtyvalue(this)\" onkeyup=\"makedirty(this)\"';\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t#renderfield += #endslash + '>';\n\t\t\t\t\tcase: 'search';\n\t\t\t\t\t\t#renderfield += '> 'size' \t? ' size=\"' + (#onefield -> (find: 'size')) + '\"' );\n\t\t\t\t\t\tif: (#onefield -> (find: 'hint')) != '';\n\t\t\t\t\t\t\t#renderfield += ' placeholder=\"' + (encode_html: (#onefield -> (find: 'hint'))) + '\"';\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\tif: !(self -> 'noscript') && !#nowarning;\n\t\t\t\t\t\t\t#renderfield += ' onkeydown=\"dirtyvalue(this)\" onkeyup=\"makedirty(this)\"';\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t#renderfield += #endslash + '>';\n\t\t\t\t\tcase: 'password';\n\t\t\t\t\t\t#renderfield += '> 'size' \t? ' size=\"' + (#onefield -> (find: 'size')) + '\"' );\n\t\t\t\t\t\tif: !(self -> 'noscript') && !#nowarning;\n\t\t\t\t\t\t\t#renderfield += ' onkeydown=\"dirtyvalue(this)\" onkeyup=\"makedirty(this)\"';\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t#renderfield += #endslash + '>';\n\t\t\t\t\tcase: 'textarea';\n\t\t\t\t\t\t#renderfield += '> 'cols' \t? ' cols=\"' + (#onefield -> (find: 'cols')) + '\"')\n\t\t\t\t\t\t\t+ (#onefield >> 'rows' \t? ' rows=\"' + (#onefield -> (find: 'rows')) + '\"');\n\t\t\t\t\t\tif: !(self -> 'noscript') && (#onefield -> (find: 'hint')) != '';\n\t\t\t\t\t\t\t#renderfield += ' onfocus=\"clearHint(this)\" onblur=\"setHint(this, \\'' (#onefield -> (find: 'hint')) '\\')\"';\n\t\t\t\t\t\t\t#usehint -> (insert: (#onefield -> find: 'name') = #id);\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\tif: !(self -> 'noscript') && !#nowarning;\n\t\t\t\t\t\t\t#renderfield += ' onkeydown=\"dirtyvalue(this)\" onkeyup=\"makedirty(this)\"';\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t#renderfield += '>'\n\t\t\t\t\t\t\t+ (encode_html: #fieldvalue) + '';\n\t\t\t\t\tcase: 'checkbox';\n\t\t\t\t\t\tlocal: 'optioncount'=integer;\n\t\t\t\t\t\t#renderfield += '
> 'class' ? ' ' + (#onefield -> find('class'))\n\t\t\t\t\t\t\t| (#defaultclass != '' ? ' ' + #defaultclass) ) \n\t\t\t\t\t\t\t+ '\" id=\"' + #id + '\">\\n';\n\t\t\t\t\t\titerate: #options, (local: 'option');\n\t\t\t\t\t\t\t#optioncount += 1;\n\t\t\t\t\t\t\t#renderfield += (#optioncount > 1 && (#onefield -> find: 'linebreak') ? '') + '\\n';\n\t\t\t\t\t\t\tif: #option -> name == '-optgroup';\n\t\t\t\t\t\t\t\t#renderfield += (!(#onefield -> find: 'linebreak') && #optioncount > 1 ? '\\n');\n\t\t\t\t\t\t\t\tif: #option -> value != '-optgroup';\n\t\t\t\t\t\t\t\t\t#renderfield += #option -> value\n\t\t\t\t\t\t\t\t\t\t+ (!(#onefield -> find: 'linebreak') ? '\\n');\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\t#renderfield += ' name) + '\"';\n\t\t\t\t\t\t\t\tif: #option -> name != '' && #fieldvalue_array >> #option -> name;\n\t\t\t\t\t\t\t\t\t#renderfield +=' checked=\"checked\"';\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\t\tif: !(self -> 'noscript') && !#nowarning;\n\t\t\t\t\t\t\t\t\t#renderfield += ' onclick=\"makedirty();\"';\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\t\t#renderfield += #endslash + '> ';\n\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t/iterate;\n\t\t\t\t\t\t#renderfield += '
\\n';\n\t\t\t\t\tcase: 'radio';\n\t\t\t\t\t\tlocal: 'optioncount'=integer;\n\t\t\t\t\t\t#renderfield += '
> 'class' ? ' ' + (#onefield -> find('class'))\n\t\t\t\t\t\t\t| (#defaultclass != '' ? ' ' + #defaultclass) ) \n\t\t\t\t\t\t\t+ '\" id=\"' + #id + '\">\\n';\n\t\t\t\t\t\titerate: #options, (local: 'option');\n\t\t\t\t\t\t\t#optioncount += 1;\n\t\t\t\t\t\t\t#renderfield += (#optioncount > 1 && (#onefield -> find: 'linebreak') ? '') + '\\n';\n\t\t\t\t\t\t\tif: #option -> name == '-optgroup';\n\t\t\t\t\t\t\t\t#renderfield += (!(#onefield -> find: 'linebreak') && #optioncount > 1 ? '\\n');\n\t\t\t\t\t\t\t\tif: #option -> value != '-optgroup';\n\t\t\t\t\t\t\t\t\t#renderfield += #option -> value\n\t\t\t\t\t\t\t\t\t\t+ (!(#onefield -> find: 'linebreak') ? '\\n');\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\t#renderfield += ' name) + '\"';\n\t\t\t\t\t\t\t\tif: #option -> name != '' && #fieldvalue_array >> #option -> name;\n\t\t\t\t\t\t\t\t\t#renderfield +=' checked=\"checked\"';\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\t\tif: !(self -> 'noscript') && !#nowarning;\n\t\t\t\t\t\t\t\t\t#renderfield += ' onclick=\"makedirty();\"';\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\t\t#renderfield += #endslash + '> ';\n\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t/iterate;\n\t\t\t\t\t\t#renderfield += '
\\n';\n\t\t\t\t\tcase: 'select';\n\t\t\t\t\t\t#renderfield += '\\n';\n\t\t\t\t\tcase: 'submit';\n\t\t\t\t\t\t#renderfield += ' formmode) == 'add' \n\t\t\t\t\t\t\t&& !(#onefield -> (find: 'disabled')) // already disabled\n\t\t\t\t\t\t\t&& (#onefield -> (find: 'originaltype') == 'savebutton' || #onefield -> (find: 'originaltype') == 'deletebutton'\n\t\t\t\t\t\t\t|| #onefield -> (find: 'name') == 'button_save' || #onefield -> (find: 'name') == 'button_delete');\n\t\t\t\t\t\t\t#renderfield += ' disabled=\"disabled\"';\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\tif: !(self -> 'noscript') \n\t\t\t\t\t\t\t&& (#onefield -> (find: 'name') == 'button_delete' \n\t\t\t\t\t\t\t\t|| #onefield -> (find: 'originaltype') == 'deletebutton' \n\t\t\t\t\t\t\t\t|| #onefield -> (find: 'confirmmessage') != '');\n\t\t\t\t\t\t\tlocal: 'confirmmessage'=(#onefield -> (find: 'confirmmessage') != '' \n\t\t\t\t\t\t\t\t? #onefield -> (find: 'confirmmessage') | 'Really delete?');\n\t\t\t\t\t\t\t#confirmmessage -> (replace: '\"', '"');\n\t\t\t\t\t\t\t#confirmmessage -> (replace: '\\'', '\\\\\\'');\n\t\t\t\t\t\t\t#renderfield += ' onclick=\"return confirm(\\'' + #confirmmessage + '\\')\"';\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t#renderfield += #endslash + '>';\n\t\t\t\t\tcase: 'reset';\n\t\t\t\t\t\t#renderfield += ' 'noscript') && #onefield -> (find: 'confirmmessage') != '';\n\t\t\t\t\t\t\tlocal: 'confirmmessage'=#onefield -> (find: 'confirmmessage');\n\t\t\t\t\t\t\t#confirmmessage -> (replace: '\"', '"');\n\t\t\t\t\t\t\t#confirmmessage -> (replace: '\\'', '\\\\\\'');\n\t\t\t\t\t\t\t#renderfield += ' onclick=\"if(confirm(\\'' + #confirmmessage + '\\')){makeundirty();return true}else{return false};\"';\n\t\t\t\t\t\telse: !(self -> 'noscript');\n\t\t\t\t\t\t\t#renderfield += ' onclick=\"makeundirty();\"';\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t#renderfield += #endslash + '>';\n\t\t\t\t\tcase: 'image';\n\t\t\t\t\t\t#renderfield += ' formmode) == 'add' && \n\t\t\t\t\t\t\t(#onefield -> (find: 'originaltype') == 'savebutton' || #onefield -> (find: 'originaltype') == 'deletebutton'\n\t\t\t\t\t\t\t|| #onefield -> (find: 'name') == 'button_save' || #onefield -> (find: 'name') == 'button_delete');\n\t\t\t\t\t\t\t#renderfield += ' disabled=\"disabled\"';\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\tif: !(self -> 'noscript')\n\t\t\t\t\t\t\t&& (#onefield -> (find: 'name') == 'button_delete' \n\t\t\t\t\t\t\t\t|| #onefield -> (find: 'originaltype') == 'deletebutton' \n\t\t\t\t\t\t\t\t|| #onefield -> (find: 'confirmmessage') != '');\n\t\t\t\t\t\t\tlocal: 'confirmmessage'=(#onefield -> (find: 'confirmmessage') != '' \n\t\t\t\t\t\t\t\t? #onefield -> (find: 'confirmmessage') | 'Really delete?');\n\t\t\t\t\t\t\t#confirmmessage -> (replace: '\"', '"');\n\t\t\t\t\t\t\t#confirmmessage -> (replace: '\\'', '\\\\\\'');\n\t\t\t\t\t\t\t#renderfield += ' onclick=\"return confirm(\\'' + #confirmmessage + '\\')\"';\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t#renderfield += #endslash + '>';\n\t\t\t\t\tcase: 'file';\n\t\t\t\t\t\t#renderfield += ' 'noscript') && !#nowarning;\n\t\t\t\t\t\t\tif: #renderfield >> 'onchange=\"';\n\t\t\t\t\t\t\t\t#renderfield -> (replace: 'onchange=\"', 'onchange=\"makedirty();');\n\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\t#renderfield += ' onchange=\"makedirty()\"';\n\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t#renderfield += #endslash + '>';\n\t\t\t\t\t/select;\n\t\t\t\t\t#renderrow -> (replace: '#field#', #renderfield);\n\t\t\t\t\t#output += #renderrow;\n\t\t\t\t/if; \n\t\t\t/iterate;\n\t\t\t\n\t\t\t\t\n\t\t/if; // !(local_defined: 'start') && !(local_defined: 'end');\n\n\t\t// Add just the needed scripts to support the client side functionality\n\t\tif(!(self -> 'noscript'));\n\t\t\t#output >> 'togglecontrol(' \n\t\t\t\t? self -> (afterhandler: -endscript='function togglecontrol(obj){\n\t\t\t\t\t// toggles checkboxes and radios when clicking on label (for browsers that don´t support this already)\n\t\t\t\t\tswitch (obj.type){\n\t\t\t\t\tcase \\'checkbox\\':\n\t\t\t\t\t\tobj.checked=!obj.checked;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase \\'radio\\':\n\t\t\t\t\t\tobj.checked=true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}');\n\t\t\t#output >> 'setHint('\n\t\t\t\t? \t\tself -> (afterhandler: -endscript='function setHint(myField, hint) {\n\t\t\t\t\tif(myField.value==\\'\\') {\n\t\t\t\t\t\tif(myField.name.indexOf(\\'off_\\') != 0) {\n\t\t\t\t\t\t\tmyField.name=\\'off_\\' + myField.name;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tmyField.value=hint;\n\t\t\t\t\t\tgetStyleObject(myField.id).color=\\'#aaa\\';\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfunction clearHint(myField) {\n\t\t\t\t\tif(myField.name.indexOf(\\'off_\\') == 0) {\n\t\t\t\t\t\tmyField.name=myField.name.substr(4);\n\t\t\t\t\t\tmyField.value=\\'\\';\n\t\t\t\t\t\tgetStyleObject(myField.id).color=\\'black\\';\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfunction getStyleObject(objectId) {\n\t\t\t\t\tif(document.getElementById && document.getElementById(objectId)) {\n\t\t\t\t\treturn document.getElementById(objectId).style;\n\t\t\t\t\t} else {\n\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t}');\n\t\t\n\t\t\t#output >> 'makedirty(' || #output >> 'validateform('\n\t\t\t\t? self -> (afterhandler: -endscript='\n\t\t\t\tvar dirty=' + ((self -> 'errors') -> size ? 'true' | 'false') + ';\n\t\t\t\tvar dirtycheckname=null;\n\t\t\t\tvar dirtycheckvalue=null;\n\t\t\t\tvar submitBlock=false;\n\t\t\t\tfunction validateform(myForm) {\n\t\t\t\t\t// perform validation of myForm here\n\t\t\t\t\tif(submitBlock){return false};\n\t\t\t\t\tmakeundirty();\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tfunction dirtyvalue(obj){ // to be called at keydown to track if a text field changes or if arrow keys/tab/cmd-keys are pressed\n\t\t\t\t\t dirtycheckname = obj.name;\n\t\t\t\t\t dirtycheckvalue = obj.value;\n\t\t\t\t}\n\t\t\t\tfunction makeundirty(){\n\t\t\t\t\tdirty=false; \n\t\t\t\t\tdirtymarker();\n\t\t\t\t\twindow.onbeforeunload=null;\n\t\t\t\t}\n\t\t\t\tfunction makedirty(obj){\n\t\t\t\t\tif(obj){ // if object is specified then we are tracking if the value changes through keydown/keyup \n\t\t\t\t\t\tif (obj.value == dirtycheckvalue || obj.name != dirtycheckname) { // no change or tabbed to another field - return immediately\n\t\t\t\t\t\t\treturn\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tdirty=true; \n\t\t\t\t\tdirtymarker();\n\t\t\t\t}\n\t\t\t\tfunction checkdirty(){\n\t\t\t\t\tif(dirty){\n\t\t\t\t\t\treturn confirm(\\'' + (self -> 'unsavedwarning') + '\\')\n\t\t\t\t\t} else {return true}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tfunction dirtymarker() {\n\t\t\t\t\tvar obj = document.getElementById(\\'' + (self -> 'unsavedmarker') + '\\');\n\t\t\t\t\tif(dirty && obj){\n\t\t\t\t\t\tjscss(\\'add\\',obj,\\'' + (self -> 'unsavedmarkerclass') + '\\');\n\t\t\t\t\t}else if(obj) {\n\t\t\t\t\t\tjscss(\\'remove\\',obj,\\'' + (self -> 'unsavedmarkerclass') + '\\');\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfunction jscss(a,o,c1,c2){\n\t\t\t\t\t/*\n\t\t\t\t\t\ta = action: swap, add, remove, check\n\t\t\t\t\t\to = object\n\t\t\t\t\t\tc1 = name of the class (first class for swap)\n\t\t\t\t\t\tc2 = for swap, name of the second class\n\t\t\t\t\t\thttp://onlinetools.org/articles/unobtrusivejavascript/cssjsseparation.html\n\t\t\t\t\t*/\n\t\t\t\t\tswitch (a){\n\t\t\t\t\t\tcase \\'swap\\':\n\t\t\t\t\t\t\to.className=!jscss(\\'check\\',o,c1)?o.className.replace(c2,c1): o.className.replace(c1,c2);\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase \\'add\\':\n\t\t\t\t\t\t\tif(!jscss(\\'check\\',o,c1)){o.className+=o.className?\\' \\'+c1:c1;}\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase \\'remove\\':\n\t\t\t\t\t\t\tvar rep=o.className.match(\\' \\'+c1)?\\' \\'+c1:c1;\n\t\t\t\t\t\t\to.className=o.className.replace(rep,\\'\\');\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase \\'check\\':\n\t\t\t\t\t\t\treturn new RegExp(\\'\\\\\\\\b\\'+c1+\\'\\\\\\\\b\\').test(o.className);\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(dirty) {makedirty()};');\n\t\t\t\t\n\t\t\t\t(self -> 'unsavedwarning') != '' \n\t\t\t\t\t? self -> (afterhandler: -endscript='function beforeunload() {\n\t\t\t\t\tif(dirty) {return \\'' + (self -> 'unsavedwarning') + '\\';}\n\t\t\t\t}\n\t\t\t\twindow.onbeforeunload=beforeunload;');\n\t\t\t\t\n\t\t\t\t#output >> 'submitOk'\n\t\t\t\t\t? self -> (afterhandler: -endscript='function submitOk(e) { // prevents submit-on-enter\n\t\t\t\t\tvar keynum;\n\t\t\t\t\tvar elTarget;\n\t\t\t\t\tvar elType;\n\t\t\n\t\t\t\t\t// get keycode for the event \n\t\t\t\t\tif(window.event) keynum = e.keyCode; // IE\n\t\t\t\t\telse if(e.which) keynum = e.which; // DOM\n\t\t\n\t\t\t\t\t// get target\n\t\t\t\t\tif (e.target) elTarget = e.target;\n\t\t\t\t\telse if (e.srcElement) elTarget = e.srcElement;\n\t\t\n\t\t\t\t\tif(elTarget.tagName.toLowerCase() == \\'input\\') elType = elTarget.getAttribute(\\'type\\').toLowerCase();\n\t\t\t\t\tsubmitBlock=false;\n\t\t\t\t\tif (elType != \\'submit\\' && elType != \\'image\\' && elType != \\'reset\\') {\n\t\t\t\t\t\t// allow enter submit when submit button/image or reset button has focus\n\t\t\t\t\t\tif (keynum==13) submitBlock=true;\n\t\t\t\t\t}\n\t\t\t\t\treturn true;\n\t\t\t\t}');\n\t\t\t/if; // noscript\n\n\t\tif: false && $knop_form_renderform_counter <= 1;\n\t\t\t\t\t\t\t\t\t\tself -> (afterhandler: -headscript=\n\t\t\t\t\t\t\t\t\t\t\t'function getStyleObject(objectId) {\n\t\t\t\t\t\t\t\t\t\t\t\tif(document.getElementById && document.getElementById(objectId)) {\n\t\t\t\t\t\t\t\t\t\t\t\treturn document.getElementById(objectId).style;\n\t\t\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\tfunction jscss(a,o,c1,c2){\n\t\t\t\t\t\t\t\t\t\t\t\t/*\n\t\t\t\t\t\t\t\t\t\t\t\t\ta = action: swap, add, remove, check\n\t\t\t\t\t\t\t\t\t\t\t\t\to = object\n\t\t\t\t\t\t\t\t\t\t\t\t\tc1 = name of the class (first class for swap)\n\t\t\t\t\t\t\t\t\t\t\t\t\tc2 = for swap, name of the second class\n\t\t\t\t\t\t\t\t\t\t\t\t\thttp://onlinetools.org/articles/unobtrusivejavascript/cssjsseparation.html\n\t\t\t\t\t\t\t\t\t\t\t\t*/\n\t\t\t\t\t\t\t\t\t\t\t\tswitch (a){\n\t\t\t\t\t\t\t\t\t\t\t\t\tcase \\'swap\\':\n\t\t\t\t\t\t\t\t\t\t\t\t\t\to.className=!jscss(\\'check\\',o,c1)?o.className.replace(c2,c1): o.className.replace(c1,c2);\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t\t\tcase \\'add\\':\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif(!jscss(\\'check\\',o,c1)){o.className+=o.className?\\' \\'+c1:c1;}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t\t\tcase \\'remove\\':\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tvar rep=o.className.match(\\' \\'+c1)?\\' \\'+c1:c1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\to.className=o.className.replace(rep,\\'\\');\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t\t\tcase \\'check\\':\n\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn new RegExp(\\'\\\\\\\\b\\'+c1+\\'\\\\\\\\b\\').test(o.className);\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\tfunction togglecontrol(obj){\n\t\t\t\t\t\t\t\t\t\t\t\t// toggles checkboxes and radios when clicking on label (for browsers that don´t support this already)\n\t\t\t\t\t\t\t\t\t\t\t\tswitch (obj.type){\n\t\t\t\t\t\t\t\t\t\t\t\tcase \\'checkbox\\':\n\t\t\t\t\t\t\t\t\t\t\t\t\tobj.checked=!obj.checked;\n\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t\tcase \\'radio\\':\n\t\t\t\t\t\t\t\t\t\t\t\t\tobj.checked=true;\n\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\tfunction setHint(myField, hint) {\n\t\t\t\t\t\t\t\t\t\t\t\tif(myField.value==\\'\\') {\n\t\t\t\t\t\t\t\t\t\t\t\t\tif(myField.name.indexOf(\\'off_\\') != 0) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tmyField.name=\\'off_\\' + myField.name;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tmyField.value=hint;\n\t\t\t\t\t\t\t\t\t\t\t\t\tgetStyleObject(myField.id).color=\\'#aaa\\';\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tfunction clearHint(myField) {\n\t\t\t\t\t\t\t\t\t\t\t\tif(myField.name.indexOf(\\'off_\\') == 0) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tmyField.name=myField.name.substr(4);\n\t\t\t\t\t\t\t\t\t\t\t\t\tmyField.value=\\'\\';\n\t\t\t\t\t\t\t\t\t\t\t\t\tgetStyleObject(myField.id).color=\\'black\\';\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tvar dirty=' + ((self -> 'errors') -> size ? 'true' | 'false') + ';\n\t\t\t\t\t\t\t\t\t\t\tvar dirtycheckname=null;\n\t\t\t\t\t\t\t\t\t\t\tvar dirtycheckvalue=null;\n\t\t\t\t\t\t\t\t\t\t\tvar submitBlock=false;\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\tfunction validateform(myForm) {\n\t\t\t\t\t\t\t\t\t\t\t\t// perform validation of myForm here\n\t\t\t\t\t\t\t\t\t\t\t\tif(submitBlock){return false};\n\t\t\t\t\t\t\t\t\t\t\t\tmakeundirty();\n\t\t\t\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\tfunction dirtyvalue(obj){ // to be called at keydown to track if a text field changes or if arrow keys/tab/cmd-keys are pressed\n\t\t\t\t\t\t\t\t\t\t\t\t dirtycheckname = obj.name;\n\t\t\t\t\t\t\t\t\t\t\t\t dirtycheckvalue = obj.value;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tfunction makeundirty(){\n\t\t\t\t\t\t\t\t\t\t\t\tdirty=false; \n\t\t\t\t\t\t\t\t\t\t\t\tdirtymarker();\n\t\t\t\t\t\t\t\t\t\t\t\twindow.onbeforeunload=null;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tfunction makedirty(obj){\n\t\t\t\t\t\t\t\t\t\t\t\tif(obj){ // if object is specified then we are tracking if the value changes through keydown/keyup \n\t\t\t\t\t\t\t\t\t\t\t\t\tif (obj.value == dirtycheckvalue || obj.name != dirtycheckname) { // no change or tabbed to another field - return immediately\n\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tdirty=true; \n\t\t\t\t\t\t\t\t\t\t\t\tdirtymarker();\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tfunction checkdirty(){\n\t\t\t\t\t\t\t\t\t\t\t\tif(dirty){\n\t\t\t\t\t\t\t\t\t\t\t\t\treturn confirm(\\'' + (self -> 'unsavedwarning') + '\\')\n\t\t\t\t\t\t\t\t\t\t\t\t} else {return true}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tfunction beforeunload() {\n\t\t\t\t\t\t\t\t\t\t\t\tif(dirty) {\n\t\t\t\t\t\t\t\t\t\t\t\t\treturn \\'' + (self -> 'unsavedwarning') + '\\';\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\tfunction dirtymarker() {\n\t\t\t\t\t\t\t\t\t\t\t\tvar obj = document.getElementById(\\'' + (self -> 'unsavedmarker') + '\\');\n\t\t\t\t\t\t\t\t\t\t\t\tif(dirty && obj){\n\t\t\t\t\t\t\t\t\t\t\t\t\tjscss(\\'add\\',obj,\\'' + (self -> 'unsavedmarkerclass') + '\\');\n\t\t\t\t\t\t\t\t\t\t\t\t}else if(obj) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tjscss(\\'remove\\',obj,\\'' + (self -> 'unsavedmarkerclass') + '\\');\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t' + ((self -> 'unsavedwarning') != '' ? 'window.onbeforeunload=beforeunload;') + '\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\tfunction submitOk(e) { // prevents submit-on-enter\n\t\t\t\t\t\t\t\t\t\t\t\tvar keynum;\n\t\t\t\t\t\t\t\t\t\t\t\tvar elTarget;\n\t\t\t\t\t\t\t\t\t\t\t\tvar elType;\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t// get keycode for the event \n\t\t\t\t\t\t\t\t\t\t\t\tif(window.event) keynum = e.keyCode; // IE\n\t\t\t\t\t\t\t\t\t\t\t\telse if(e.which) keynum = e.which; // DOM\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t// get target\n\t\t\t\t\t\t\t\t\t\t\t\tif (e.target) elTarget = e.target;\n\t\t\t\t\t\t\t\t\t\t\t\telse if (e.srcElement) elTarget = e.srcElement;\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\tif(elTarget.tagName.toLowerCase() == \\'input\\') elType = elTarget.getAttribute(\\'type\\').toLowerCase();\n\t\t\t\t\t\t\t\t\t\t\t\tsubmitBlock=false;\n\t\t\t\t\t\t\t\t\t\t\t\tif (elType != \\'submit\\' && elType != \\'image\\' && elType != \\'reset\\') {\n\t\t\t\t\t\t\t\t\t\t\t\t\t// allow enter submit when submit button/image or reset button has focus\n\t\t\t\t\t\t\t\t\t\t\t\t\tif (keynum==13) submitBlock=true;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t');\n\t\t/if;\n\t\tif: !(self -> 'noscript') && #usehint -> size > 0;\n\t\t\tlocal: 'hintscript'=string;\n\t\t\t// #usehint is a pair array with name=id\n\t\t\titerate: #usehint, (local: 'hintfield');\n\t\t\t\tif: (self -> 'fields') >> #hintfield -> name;\n\t\t\t\t\t#onefield = (self -> 'fields') -> (find: #hintfield -> name) -> first -> value;\n\t\t\t\t\t#hintscript += 'setHint(document.getElementById(\\'' + (encode_html: #hintfield -> value) + '\\'), \\'' \n\t\t\t\t\t\t+ (#onefield -> (find: 'hint')) + '\\');\\n';\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t\t\n\t\t\tself -> (afterhandler: -endscript=#hintscript);\n\t\t/if;\n\t\tif: !(self -> 'noscript') && #focusfield != '';\n\t\t\tself -> (afterhandler: -endscript='document.getElementById(\\'' + #focusfield + '\\').focus();document.getElementById(\\'' + #focusfield + '\\').select();');\n\t\t/if;\n\n\t\tif: (self -> 'render_fieldset_open') && (params -> size == 0 || (local_defined: 'end'));\n\t\t\t// inner fieldset is open\n\t\t\t(self -> 'render_fieldset_open') = false;\n\t\t\t#output += '\\n';\n\t\t/if;\n\t\tif: (self -> 'render_fieldset2_open') && (local_defined: 'legend');\n\t\t\t// inner fieldset is open\n\t\t\t(self -> 'render_fieldset2_open') = false;\n\t\t\t#output += '\\n';\n\t\t/if;\n\n\t\tif: #renderformEndTag;\n\t\t\tif: (self -> 'fieldset');\n\t\t\t\t#output += '\\n';\n\t\t\t/if;\n\t\t\n\t\t\t// render closing form tag\n\t\t\t#output += '';\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @#output;\n\t/define_tag;\n\n\tdefine_tag: 'renderhtml', -description='Outputs form data as plain HTML, a specific field, a range of fields or all fields of a specific type. \\\n\t\t\tSome form field types are excluded, such as submit, reset, file etc. \\\n\t\t\tUse form -> setformat first to specify the html format, otherwise default format #label#: #field#
is used.\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-name (optional) Render only the specified field\\n\\\n\t\t\t-from (optional) Render fields from the specified number index or field name\\n\\\n\t\t\t-to (optional) Render fields to the specified number index or field name\\n\\\n\t\t\t-type (optional) Only render fields of this or these types (string or array)\\n\\\n\t\t\t-excludetype (optional) Render fields except of this or these types (string or array)\\n\\\n\t\t\t-legend (optional) Groups the rendered fields in a fieldset and outputs a legend for the fieldset\\n\\\n\t\t\t-xhtml (optional flag) XHTML valid output',\n\t\t-optional='name', -copy,\t// field name\n\t\t-optional='from', -copy, \t// number index or field name\n\t\t-optional='to', -copy, \t\t// number index or field name\n\t\t-optional='type', -copy,\t// only output fields of this or these types (string or array)\n\t\t-optional='excludetype', -copy,\t// do not output fields of this or these types (string or array)\n\t\t-optional='legend',\t\t\t// groups the rendered fields in a fieldset and outputs a legend for the fieldset\n\t\t-optional='xhtml';\t\t\t// boolean, if set to true adjust output for XHTML\n\t\tlocal: 'timer'=knop_timer; \n\t\t\n\t\tlocal: 'output'=string, \n\t\t\t'onefield'=map, \n\t\t\t'renderfield'=string, \n\t\t\t'renderfield_base'=string, \n\t\t\t'renderrow'=string,\n\t\t\t'fieldvalue'=string,\n\t\t\t'fieldvalue_array'=array,\n\t\t\t'options'=array,\n\t\t\t'usehint'=array;\n\n\t\t\n\t\t// local var that adjust tag endings if rendered for XHTML\n\t\tlocal: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');\n\n\t\t(local_defined: 'name') && !((self -> 'fields') >> #name) \t? \treturn;\n\n\t\t(local_defined: 'name')\t\t? local: 'from'=#name, 'to'=#name;\n\t\t!(local_defined: 'from') \t\t? local: 'from'=1;\n\t\t!(local_defined: 'to') \t\t\t? local: 'to'=(self -> 'fields') -> size;\n\t\t!(local_defined: 'type')\t\t? local: 'type'=(self -> 'validfieldtypes');\n\t\t!(local_defined: 'excludetype')\t? local: 'excludetype'=map;\n\t\t#type -> type == 'string' \t\t? #type = (map: #type);\n\t\t#excludetype -> type == 'string' ? #excludetype = (map: #excludetype);\n\n\t\t// use field name if #from is a string\n\t\t#from -> type == 'string' ? #from = integer: ((self -> 'fields') -> (findindex: #from) -> first);\n\t\t#from == 0 ? #from = 1;\n\t\t// negative numbers count from the end\n\t\t#from < 0 ? #from = (self -> 'fields') -> size + #from;\n\n\t\t// use field name if #to is a string\n\t\t#to -> type == 'string' ? #to = integer: ((self -> 'fields') -> (findindex: #to) -> last);\n\t\t#to == 0 ? #to = (self -> 'fields') -> size;\n\t\t// negative numbers count from the end\n\t\t#to < 0 ? #to = (self -> 'fields') -> size + #to;\n\n\t\t//Sanity check\n\t\t#from > #to ? #to = #from;\n\n\t\tlocal: 'template'=( (self -> 'template') != '' \n\t\t\t? (self -> 'template') \t\t\n\t\t\t| '#label#: #field#\\n' );\n\t\tlocal: 'buttontemplate'=( (self -> 'buttontemplate') != '' \n\t\t\t? (self -> 'buttontemplate') \t\t\n\t\t\t| (self -> 'template') != '' \n\t\t\t? (self -> 'template')\n\t\t\t| '#field#\\n' );\n\t\tlocal: 'defaultclass'=( (self -> 'class') != '' \n\t\t\t? (self -> 'class') \t\t\n\t\t\t| '');\n\t\tif: (local_defined: 'legend');\n\t\t\t#output += '
\\n'\n\t\t\t\t+ '' + #legend + '\\n';\n\t\t\t(self -> 'render_fieldset2_open') = true;\n\t\t/if;\n\t\titerate: (self -> 'fields'), (local: 'fieldpair');\n\t\t\t#onefield = #fieldpair -> value;\n\t\t\t#fieldvalue = (#onefield -> (find: 'value'));\n\t\t\t#fieldvalue_array = #fieldvalue;\n\t\t\tif: #fieldvalue_array -> type != 'array';\n\t\t\t\tif: #fieldvalue_array >> '\\r'; // Filemaker value list with multiple checked\n\t\t\t\t\t#fieldvalue_array = #fieldvalue_array -> (split: '\\r');\n\t\t\t\telse: #fieldvalue_array >> ','; // Other database with multiple checked\n\t\t\t\t\t#fieldvalue_array = #fieldvalue_array -> (split: ',');\n\t\t\t\telse;\n\t\t\t\t\t#fieldvalue_array = array: #fieldvalue_array;\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t\tif: #onefield >> 'options';\n\t\t\t\t#options = (#onefield -> find: 'options');\n\t\t\t\t// convert types for pair \n\t\t\t\titerate: #options, (local: 'option');\n\t\t\t\t\tif: #option -> type != 'pair';\n\t\t\t\t\t\t#option = (pair: #option = #option);\n\t\t\t\t\t/if;\n\t\t\t\t\t// name must be string to make sure comparsions work\n\t\t\t\t\t(#option -> name) = (string: #option -> name);\n\t\t\t\t/iterate;\n\t\t\t/if;\n\t\t\tif: loop_count >= #from \n\t\t\t\t&& loop_count <= #to\n\t\t\t\t&& #type >> #onefield -> (find: 'type')\n\t\t\t\t&& !(#excludetype >> #onefield -> (find: 'type'));\n\n\t\t\t\tif: #onefield -> (find: 'template') -> size;\n\t\t\t\t\t#renderrow = #onefield -> (find: 'template');\n\t\t\t\telse: (map: 'submit', 'reset', 'image') >> #onefield -> (find: 'type');\n\t\t\t\t\t#renderrow=#buttontemplate;\n\t\t\t\telse;\n\t\t\t\t\t#renderrow=#template;\n\t\t\t\t/if;\n\n\t\t\t\tif: (self -> 'exceptionfieldtypes') >> (#onefield -> (find: 'type'));\n\t\t\t\t\t#renderrow -> (replace: '#label#:', '');\n\t\t\t\t\t#renderrow -> (replace: '#label#', '');\n\t\t\t\telse: (#onefield -> (find: 'label')) != '';\n\t\t\t\t\t#renderrow -> (replace: '#label#', (#onefield -> (find: 'label') ));\n\t\t\t\telse: \n\t\t\t\t\t#renderrow -> (replace: '#label#:', '');\n\t\t\t\t\t#renderrow -> (replace: '#label#', '');\n\t\t\t\t/if;\n\t\t\t\tif: (map: 'radio', 'checkbox', 'select') >> (#onefield -> (find: 'type'));\n\t\t\t\t\t#renderfield = string;\n\t\t\t\t\titerate: #fieldvalue_array, local: 'onefieldvalue';\n\t\t\t\t\t\tif: loop_count > 1;\n\t\t\t\t\t\t\t#renderfield += ( (#onefield -> find: 'linebreak') ? '\\n' | ', ');\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\tif: #options >> #onefieldvalue;\n\t\t\t\t\t\t\t// show the display text for a selected option\n\t\t\t\t\t\t\t#renderfield += (encode_break: (#options -> (find: #onefieldvalue) -> first -> value));\n\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t// show the option value itself\n\t\t\t\t\t\t\t#renderfield += (encode_break: #onefieldvalue);\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/iterate;\n\t\t\t\telse: (#onefield -> (find: 'type')) == 'html';\n\t\t\t\t\t#renderrow = #template;\n\t\t\t\t\t#renderrow -> (replace: '#label#:', '');\n\t\t\t\t\t#renderrow -> (replace: '#label#', '');\n\t\t\t\t\t#renderrow -> (replace: '#required#', '');\n\t\t\t\t\t#renderfield = #fieldvalue + '\\n';\n\t\t\t\telse: (#onefield -> (find: 'type')) == 'legend';\n\t\t\t\t\t#renderrow = '';\n\t\t\t\t\tif: (self -> 'render_fieldset_open');\n\t\t\t\t\t\t#output += '
\\n';\n\t\t\t\t\t\t(self -> 'render_fieldset_open') = false;\n\t\t\t\t\t/if;\n\t\t\t\t\t#output += '
\\n';\n\t\t\t\t\t#output += '' + (encode_html: #fieldvalue) + '';\n\t\t\t\t\t(self -> 'render_fieldset_open') = true;\n\t\t\t\telse: (#onefield -> (find: 'type')) == 'fieldset';\n\t\t\t\t\t#renderrow = '';\n\t\t\t\t\tif: (self -> 'render_fieldset_open');\n\t\t\t\t\t\t#output += '
\\n';\n\t\t\t\t\t\t(self -> 'render_fieldset_open') = false;\n\t\t\t\t\t/if;\n\t\t\t\t\tif: #fieldvalue != false;\n\t\t\t\t\t\t#output += '
\\n'; // must contain a legend\n\t\t\t\t\t\t(self -> 'render_fieldset_open') = true;\n\t\t\t\t\t/if;\n\t\t\t\telse;\n\t\t\t\t\t#renderfield = (encode_break: #fieldvalue);\n\t\t\t\t/if;\n\t\t\t\t#renderrow -> (replace: '#field#', #renderfield);\n\t\t\t\t#output += #renderrow;\n\t\t\t/if;\n\t\t/iterate;\n\t\tif: (local_defined: 'legend') && (self -> 'render_fieldset2_open');\n\t\t\t// inner fieldset is open\n\t\t\t(self -> 'render_fieldset2_open') = false;\n\t\t\t#output += '
\\n';\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: #output;\n\t/define_tag;\n\n\tdefine_tag: 'getvalue', -description='Returns the current value of a form field. Returns an array for repeated form fields. ',\n\t\t-required='name', -type='string',\n\t\t-optional='index', -type='integer', -copy;\n\t\t!local_defined('index') ? local('index' = 1);\n\t\t#index < 1 ? #index = 1;\n\t\tif: (self -> 'fields') >> #name;\n\t\t\tif(#index > (self -> 'fields') -> find(#name) -> size);\n\t\t\t\treturn;\n\t\t\t/if;\n\t\t\treturn: (self -> 'fields') -> (find: #name) -> get(#index) -> value -> (find: 'value');\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'getlabel', -description='Returns the label for a form field. ',\n\t\t-required='name', -type='string';\n\t\tif: (self -> 'fields') >> #name;\n\t\t\treturn: (self -> 'fields') -> (find: #name) -> first -> value -> (find: 'label');\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'setvalue', -description='Sets the value for a form field. \\\n\t\t\t\tEither form -> (setvalue: fieldname=newvalue) or form -> (setvalue: -name=fieldname, -value=newvalue)',\n\t\t-required='name',\n\t\t-optional='value',\n\t\t-optional='index', -type='integer', -copy;\n\t\tlocal: 'timer'=knop_timer; \n\t\t// either -> (setvalue: 'fieldname'='newvalue') or -> (setvalue: -name='fieldname', -value='newvalue')\n\t\tlocal: '_name'=#name, '_value'=(local: 'value');\n\t\t!local_defined('index') ? local('index' = 1);\n\t\t#index < 1 ? #index = 1;\n\t\tif: #name -> type == 'pair';\n\t\t\t#_name = #name -> name;\n\t\t\t#_value = #name -> value;\n\t\t/if;\n\t\tif: (self -> 'fields') >> #_name;\n\t\t\tif(#index > (self -> 'fields') -> find(#_name) -> size);\n\t\t\t\treturn;\n\t\t\t/if;\n\t\t\t// first remove value to break reference\n\t\t\t((self -> 'fields') -> get((self -> 'fields') -> (findindex: #_name) -> get(#index)) -> value) -> (remove: 'value');\n\t\t\t((self -> 'fields') -> get((self -> 'fields') -> (findindex: #_name) -> get(#index)) -> value) -> (insert: 'value'=#_value);\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'removefield', -description='Removes all form elements with the specified name from the form',\n\t\t-required='name', -type='string';\n\t\tlocal: 'timer'=knop_timer; \n\t\t(self -> 'fields') -> (removeall: #name);\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\tdefine_tag: 'keys', -description='Returns an array of all field names';\n\t\tlocal: 'timer'=knop_timer; \n\t\tlocal: 'output'=array;\n\t\titerate: (self -> 'fields'), (local: 'fieldpair');\n\t\t\t#output -> (insert: #fieldpair -> name);\n\t\t/iterate;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: #output;\n\t/define_tag;\n\n\n\tdefine_tag: 'keyvalue'; \t\t\treturn: (self -> 'db_keyvalue');\t\t/define_tag;\n\tdefine_tag: 'lockvalue'; \t\t\treturn: (self -> 'db_lockvalue');\t\t/define_tag;\n\tdefine_tag: 'lockvalue_decrypted';\n\t\t(self -> 'database') -> type != 'database' ? return;\n\t\treturn: (decrypt_blowfish: (self -> 'db_lockvalue'), -seed=(self -> 'database' -> 'lock_seed'));\n\t/define_tag;\n\tdefine_tag: 'database'; \t\t\treturn: (self -> 'database');\t\t\t/define_tag;\n\n\tdefine_tag: 'formmode', -description='Returns add or edit after for -> init has been called';\n\t\tlocal: 'timer'=knop_timer; \n\t\tif: (self -> getbutton) == 'add';\n\t\t\t// this is needed to keep the right form mode after a failed add\n\t\t\t(self -> 'formmode') = 'add';\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n \t\treturn: (self -> 'formmode');\n \t/define_tag;\n\n\tdefine_tag: 'error_code';\n\t\t// custom error_code for knop_form\n\t\tif: (self -> 'error_code');\n\t\t\treturn: integer: (self -> 'error_code');\n\t\telse: (self -> 'errors') -> type == 'array' && (self -> 'errors') -> size > 0;\n\t\t\t(self -> 'error_code') = 7101;\n\t\t\treturn: (self -> 'error_code');\n\t\telse;\n\t\t\treturn: 0;\n\t\t/if;\n\t/define_tag;\n\n\n\t\n\tdefine_tag: 'afterhandler', -description='Internal member tag. Adds needed javascripts through an atend handler that will be processed when the entire page is done. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-headscript (optional) A single script, will be placed before (or at top of page if is missing)\\n\\\n\t\t\t-endscript (optional) Multiple scripts (no duplicates), will be placed before (or at end of page if is missing)',\n\t\t-optional='headscript', -type='string',\n\t\t-optional='endscript', -type='string';\n\t\t// adds needed javascripts through an atend handler that will be processed when the entire page is done\n\n\t\tif: !(var_defined: 'knop_afterhandler_data');\n\t\t\tvar: 'knop_afterhandler_data'=map;\n\t\t\tdefine_atend: { // this will run after the page is done processing\n\t\t\t\tif: $knop_afterhandler_data >> 'headscript';\n\t\t\t\t\t// put before or at beginning of page\n\t\t\t\t\tlocal: 'scriptdata'='\\n';\n\t\t\t\t\tif: content_body >> '';\n\t\t\t\t\t\tcontent_body -> (replace: '', #scriptdata + '');\n\t\t\t\t\telse;\n\t\t\t\t\t\tcontent_body = #scriptdata + content_body;\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t\tif: $knop_afterhandler_data >> 'endscript';\n\t\t\t\t\t// put before or at end of page\n\t\t\t\t\tlocal: 'scriptdata'='\\n\\n\\n\\n\\n';\n\t\t\t\t\tif: content_body >> '';\n\t\t\t\t\t\tcontent_body -> (replace: '', #scriptdata + '');\n\t\t\t\t\telse;\n\t\t\t\t\t\tcontent_body += #scriptdata;\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t};\n\t\t/if;\n\t\t\n\t\tif: (local_defined: 'headscript');\n\t\t\t// add to current headscript\n\t\t\tif: $knop_afterhandler_data !>> 'headscript';\n\t\t\t\t$knop_afterhandler_data -> (insert: 'headscript' = array);\n\t\t\t/if;\n\t\t\tif: $knop_afterhandler_data -> (find: 'headscript') !>> #headscript;\n\t\t\t\t$knop_afterhandler_data -> (find: 'headscript') -> insert(#headscript);\n\t\t\t/if;\n\t\t/if;\n\t\tif: (local_defined: 'endscript');\n\t\t\t// add to current endscript\n\t\t\tif: $knop_afterhandler_data !>> 'endscript';\n\t\t\t\t$knop_afterhandler_data -> (insert: 'endscript' = array);\n\t\t\t/if;\n\t\t\tif: $knop_afterhandler_data -> (find: 'endscript') !>> #endscript;\n\t\t\t\t$knop_afterhandler_data -> (find: 'endscript') -> insert(#endscript);\n\t\t\t/if;\n\t\t/if;\n\t/define_tag;\n/define_type;\n\n\n?>\n[\n//------------------------------------------------------------------\n// End knop_form\n//------------------------------------------------------------------\n\n//##################################################################\n\n][\n//------------------------------------------------------------------\n// Begin knop_grid\n//------------------------------------------------------------------\n\n] and \n2010-12-23\tSP\tCorrected pagination bug for -numbered.\n2010-11-17\tJC\tAdded -startwithfooter flag to grid->renderhtml. This moves the footer before the column titles in the table header.\n2010-11-17\tJC\tChanged rawheader inclusion to work even if there's no quicksearch for a grid\n2010-05-14\tJC\tAdded span separation on grid footer for better styling\n2010-03-06\tSP\tChanged default behavior of ->sortparams and ->quicksearch with -sql to add backticks between the table and column names. Now JOINs may be used.\n2010-03-06\tSP\tAdded ->sortparams and ->quicksearch with -removedotbackticks for backward compatibility for fields that contain periods. If you use periods in a fieldname then you cannot use a JOIN in Knop.\n2010-01-27\tJC\tAdjusted the id support\n2010-01-25\tJC\tAdded support for optional id, used by table, quicksearch and quicksearch_reset\n2009-09-18\tJS\tSyntax adjustments for Lasso 9\n2009-08-26\tJS\tCorrected prev/next links when no nav is defined for the grid object\n2009-06-29\tJS\t->renderlisting: documentation correction (renderlisting never calls renderfooter). \n2009-01-11\tJS\t->renderlisting: Made sure that template isn't applied on NULL field values since that would cause an error with ->replace \n2008-12-29\tJC\tSupport for optional classes in table header\n2008-11-27\tJC\t-> implemented support for td specific classes. The class is inserted in both the TH and TD tag for the specified field\n2008-09-24\tJS\t->sortparams: fieldnames specified by the -sort parameter are now validated so they exist in the database\n2008-09-24\tJS\t->sortparams, ->quicksearch: Added protection against backtick sql injection in MySQL object names\n2008-09-10\tJS\t-numbered can now be specified at oncreate in addition to ->renderhtml and ->renderfooter. \n2008-09-08\tJS\t->sortfield changed so defaultsort is honored even if -nosort is specified (-nosort is only used to prevent the user from changing sort order on the fly)\n2008-09-08\tJS\t->renderlisting and ->renderfooter optimized by caching the result of nav->url. \n2008-05-15\tJS\t->renderfooter: minor adjustment to numbered pagination links\n2008-05-14\tJS\t->renderfooter (and ->renderhtml): added -numbered as option to get google style numbered pagination links. Render the grid with -numbered (defaults to show 6 page number links plus the far ends) or -numbered=10 or another number. \n2008-05-13\tJS\tAdded ->renderlisting which is now part of ->renderhtml for more flexibility\n2008-02-25\tJS\t->renderheader and ->renderfooter calls nav -> url with -getargs \n2008-01-22\tJS\t->renderheader, ->renderfooter, ->renderhtml: addded -autoparams to nav -> url used in links since url was changed to default to no autoparams. \n2008-01-22\tJS\t->renderheader, ->renderfooter, ->renderhtml: improved support for param based navigation method in links, cleaned up linking to use nav -> url instead of self -> urlparams when nav is available\n2008-01-22\tJC\t->quicksearch: Changed wordseparators so that \\r and \\n aren't placed as \\r\\n, otherwise they are treated as a single character by ->split. \n2007-12-11\tJS\tAdded documentation as -description to most member tags, to be used by the new ->help tag\n2007-12-11\tJS\tMoved ->help to knop_base\n2007-12-03\tJS\tAdded optional -language parameter to set the initial language for the grid object\n2007-12-03\tJS\tAdded -> lang to provide a reference to the knop_lang object that is used for localized strings\n2007-12-03\tJS\tAdded localized strings for English and Swedish\n2007-12-03\tJS\tAdded knop_lang to handle localized strings\n2007-11-11\tJC\tAdded optional -rawheader for extra header content to be inserted before the Quicksearch form\n2007-10-23\tJS\t->renderheader: added class=\"grid\" to the opening table tag to be able to isolate the css specifications\n2007-10-03\tJS\t->renderfooter: added unique classes for each type of prev/next link to be able to replace with images using css\n2007-10-03\tJS\t->renderfooter: Changed prev/next link texts to simple |< << >> >| instead of unicode glyphs\n2007-09-20\tJS\tPostparams are only sent along for nav params (not \"-\" params)\n2007-09-07\tJS\tAlso send postparams along in prev/next links (not only getparams)\n2007-09-06\tJS\tIf nav has params defined, those params will be sent along with prev/next links\n2007-09-06\tJS\tAdded encode_url for link params\n2007-09-06\tJS\tChanged -action to -formaction in the quicksearch form\n2007-08-08\tJS\t->urlargs: Added exception for -session\n2007-06-18\tJS\tAdded tag timer to most member tags\n2007-06-13\tJS\tadded inheritance from knop_base\n2007-06-11\tJC\tadded handling of xhtml output\n2007-05-30\tJS\t->quicksearch: added \\r and \\n as word separators. \n2007-05-03\tJS\t->addfield: Added check for empty dbfield name before adding to dbfieldmap\n2007-04-19\tJS\t->quicksearch: added -value (flag) that makes quicksearch output just the value of the quicksearch field instead of a query\n2007-04-13\tJS\t->oncreate: added -nosort as global flag (overrides column specific sort options)\n2007-04-13\tJS\t->renderfooter: Added tbody to footer to make it pass validation, but it's still not semantically correct. \n2007-04-13\tJS\tChanged field type for quicksearch for non-WebKit based browsers\n2007-04-10\tJS\t->quicksearch: Added @ as word separator for \"word begins with\" search\n2007-04-10\tJS\t->quicksearch: Added -contains as option to perform a simple contains search instead of emulating \"word begins with\" search\n2007-04-10\tJS\t->renderheader: When grid has a defaultsort, there should be no \"unsort\" option in the sortable headings\n2007-04-10\tJS\t->insert: (-defaultsort='desc') or (-defaultsort='descending') makes the default sort order sort in descending order\n2007-04-04\tJS\t->addfield: -template can now also be a compound expression\n2007-04-03\tJS\tChanged namespace from mt_ to knop_\n2007-03-01\tJS\tAdded support for FileMaker with quicksearch (untested)\n2007-03-01\tJS\tChanged all texts to English\n2007-02-07\tJS\tRemoved classs=\"first\" and class=\"notopborder\" since CSS border-collapse: collapse; eliminates the need\n2007-02-05\tJS The -keyvalue parameter for url edit links can be given another name by specifying -keyparamname in addfield\n2007-01-31\tJS\t->addfield: #value# can be used in -url, as a way to provide mailto links etc in lists\n2007-01-30\tJS\tSortable columns now thave three states instead of two: sorted ascending, sorted descending and unsorted. \n2007-01-30\tJS\tImprovements to quicksearch, to emulate \"word begins with\" searches\n2007-01-26\tJS\tAdded support for quicksearch field in grid header. Specify -quicksearch at ->oncreate, and tell what fields to search by specifying -quicksearch for those fields at ->addfield. \n\t\t\t\tFields can be search only (no display) by leaving out name and label. All specified fields are searched word for word of thew search string. \n\t\t\t\tUse ->quicksearch to get the search parameters (optionally -sql)\n2007-01-26\tJS\tAdded ->urlargs to get a querystring with all \"-\" GET params, except those in optional -except string or array parameter. \n2007-01-22\tJS\tAdjustments to highlighting and \"(redigera)\"-link for records with empty values in the linked field\n2007-01-19\tJS\tAdded href titles to sort links and prevnext links\n2007-01-19\tJS\tCorrected sortparams when no sortfield is specified\n2007-01-19\tJS\tAddded go to first page, go to last page in footer\n2007-01-19\tJS\tAdded member tag page_skiprecords to help correcting out of bounds page numbers\n2007-01-19\tJS\tAdded member tag lastpage\n2007-01-18\tJS\tSupport for highlighting of affected record after edit or update (class name \"highlight\")\n2007-01-17\tJS\tAdded addfield: -template\n\nTODO\nMake it possible for knop_grid to work independently of a knop_database object so other types of listings can bre created. \nLanguage of quicksearch buttons can't be changed after the grid has been created\ntbody is used in renderfooter, which is not semantically correct. can't use tfoot though since the footer is rendered twice. \nMove templates to a member tag to be make it easier to subclass\nChange ->addfield to ->insert and make ->addfield deprecated\n\n*/\n\n\t// instance variables\n\tlocal: 'fields'=array,\n\t\t'dbfieldmap'=map,\n\t\t'sortfield'=string,\n\t\t'defaultsort'=string,\n\t\t'page'=integer,\n\t\t'sortdescending'=false,\n\t\t'database'=null,\n\t\t'nav'=null,\n\t\t'debug_trace'=array,\n\t\t'quicksearch'=string,\n\t\t'quicksearch_form',\n\t\t'quicksearch_form_reset',\n\t\t'rawheader' = string, // added by Jolle 071111\n\t\t'class' = string, // Added by Jolle 081229\n\t\t'tbl_id' = 'grid', // Added by Jolle 100125\n\t\t'qs_id' = 'quicksearch', // Added by Jolle 100125\n\t\t'qsr_id' = 'qs_reset', // Added by Jolle 100125\n\t\t'quicksearch_fields'=array,\n\t\t'footer' = string, // Added by Jolle 101117\n\t\t'lang'=(knop_lang: -default='en', -fallback),\t\t// language strings object \n\t\t'error_lang'=(knop_lang: -default='en', -fallback),\n\t\t'numbered'=false,\n\t\t'nosort';\n\n\t#lang -> (addlanguage: -language='en', -strings=(map: \n\t\t'quicksearch_showall' = 'Show all',\n\t\t'quicksearch_search' = 'Search',\n\t\t'linktext_edit' = '(edit)',\n\t\t'linktitle_showunsorted' = 'Show unsorted',\n\t\t'linktitle_changesort' = 'Change sort order to',\n\t\t'linktitle_ascending' = 'ascending',\n\t\t'linktitle_descending' = 'descending',\n\t\t'linktitle_sortascby' = 'Sort ascending by',\n\t\t'linktitle_gofirst' = 'Go to first page',\n\t\t'linktitle_goprev' = 'Go to previous page',\n\t\t'footer_shown' = '#1# - #2# of',\n\t\t'footer_found'='found',\n\t\t'linktext_gotopage'='Go to page', // SP customization\n\t\t'linktitle_gonext' = 'Go to next page',\n\t\t'linktitle_golast' = 'Go to last page',\n\n\t\t// language neutral strings, only need to be set for the default language\n\t\t'linktext_first'='|<',\n\t\t'linktext_prev'='<<',\n\t\t'linktext_next'='>>',\n\t\t'linktext_last'='>|'\n\t\t\t));\n\t\t\t\n\t#lang -> (addlanguage: -language='sv', -strings=(map: \n\t\t'quicksearch_showall' = 'Visa alla',\n\t\t'quicksearch_search' = 'Sök',\n\t\t'linktext_edit' = '(redigera)',\n\t\t'linktitle_showunsorted' = 'Visa osorterade',\n\t\t'linktitle_changesort' = 'Ändra sorteringsordning till',\n\t\t'linktitle_ascending' = 'stigande',\n\t\t'linktitle_descending' = 'fallande',\n\t\t'linktitle_sortascby' = 'Sortera i stigande ordning efter',\n\t\t'linktitle_gofirst' = 'Gå till första sidan',\n\t\t'linktitle_goprev' = 'Gå till föregående sida',\n\t\t'footer_shown' = '#1# - #2# av',\n\t\t'footer_found'='hittade',\n\t\t'linktext_gotopage'='Gå till sida', // SP cüstømizätiøn\n\t\t'linktitle_gonext' = 'Gå till nästa sida',\n\t\t'linktitle_golast' = 'Gå till sista sidan'\n\t));\n\t\n\tdefine_tag: 'oncreate', -description='Parameters:\\n\\\n\t\t\t-database (required database) Database object that the grid object will interact with\\n\\\n\t\t\t-nav (optional nav) Navigation object to interact with\\n\\\n\t\t\t-quicksearch (optional) Label text for the quick search field\\n\\\n\t\t\t-rawheader (optional) Extra html to be inserted in the grid header\\n\\\n\t\t\t-class (optional) Extra classes to be inserted in the grid header. The standard class \"grid\" is always inserted\\n\\\n\t\t\t-id (optional) Creates a custom id used for table, quicksearch and quicksearch_reset\\n\\\n\t\t\t-nosort (optional flag) Global setting for the entire grid (overrides column specific sort options)\\n\\\n\t\t\t-language (optional) Language to use for the grid, defaults to the browser\\'s preferred language\\n\\\n\t\t\t-numbered (optional flag or integer) If specified, pagination links will be shown as page numbers instead of regular prev/next links. Defaults to 6 links, specify another number (minimum 6) if more numbers are wanted. Can be specified in ->renderhtml as well. ',\n\t\t-required='database', -type='database',\n\t\t-optional='nav', -type='nav',\n\t\t-optional='quicksearch',\n\t\t-optional='rawheader',\n\t\t-optional='class',\n\t\t-optional='id',\n\t\t-optional='nosort',\n\t\t-optional='language',\n\t\t-optional='numbered';\n\t\tlocal: 'timer'=knop_timer; \n\t\t\n\t\tlocal: 'lang'=@(self -> 'lang');\n\t\t\n\t\tif: (local_defined: 'language');\n\t\t\t#lang -> (setlanguage: #language);\n\t\t/if;\n\t\t\n\t\t// the following params are stored as reference, so the values of the params can be altered after adding a field simply by changing the referenced variable. \n\t\tlocal_defined('database') ? (self -> 'database' = @#database);\n\t\tlocal_defined('nav') ? (self -> 'nav' = @#nav);\n\n\t\t(self -> 'nosort')=local_defined('nosort');\n\n\t\tif(local_defined('numbered'));\n\t\t\t(self -> 'numbered')=((#numbered !== false) ? integer(#numbered) | false);\n\t\t/if;\n\t\t(local_defined('class') && #class -> type == 'string') ?\n\t\t\t(self -> 'class') = #class;\n\t\t\n\t\tif(local_defined('id') && #id -> type == 'string');\n\t\t\t(self -> 'tbl_id') = #id + '_grid';\n\t\t\t(self -> 'qs_id') = #id + '_quicksearch';\n\t\t\t(self -> 'qsr_id') = #id + '_qs_reset';\n\t\t/if;\n\n\n\t\tlocal: 'clientparams'=client_getparams;\n\t\t#clientparams -> (merge: client_postparams);\n\t\tif: !(self -> 'nosort');\n\t\t\t(self -> 'sortfield') = (#clientparams >> '-sort' ? (#clientparams -> (find: '-sort') -> first -> value) | string);\n\t\t\t(self -> 'sortdescending') = (#clientparams >> '-desc');\n\t\t/if;\n\t\t(self -> 'page') = (#clientparams >> '-page' ? (integer: (#clientparams -> (find: '-page') -> first -> value)) | 1);\n\t\t(self -> 'page') < 1 ? (self -> 'page') = 1;\n\n\t\tif: (local_defined: 'quicksearch');\n\t\t\tif: #quicksearch != '';\n\t\t\t\t(self -> 'quicksearch') = #quicksearch;\n\t\t\telse;\n\t\t\t\t(self -> 'quicksearch') = 'Quicksearch';\n\t\t\t/if;\n\t\t\t(self -> 'quicksearch_form') = (knop_form: -name='quicksearch', -id = (self -> 'qs_id'), -formaction='./', -method='get', -template='#field#\\n', -noautoparams);\n\t\t\t(self -> 'quicksearch_form_reset') = (knop_form: -name='quicksearch_reset', -id = (self -> 'qsr_id'), -formaction='./', -method='get', -template='#field#\\n', -noautoparams);\n\t\t\tlocal: 'autosavekey'=server_name + response_path;\n\t\t\tif: (self -> 'nav') -> type =='nav' && (self -> 'nav') -> 'navmethod'=='param';\n\t\t\t\t(self -> 'quicksearch_form') -> (addfield: -type='hidden', -name='-path', -value=((self -> 'nav') -> path));\n\t\t\t\t(self -> 'quicksearch_form_reset') -> (addfield: -type='hidden', -name='-path', -value=((self -> 'nav') -> path));\n\t\t\t\t#autosavekey -> (removetrailing: '/');\n\t\t\t\t#autosavekey += '/' + ((self -> 'nav') -> path);\n\t\t\t/if;\n\t\t\tif: (self -> 'sortfield') != '' && !(self -> 'nosort');\n\t\t\t\t(self -> 'quicksearch_form') -> (addfield: -type='hidden', -name='-sort', -value=(self -> 'sortfield'));\n\t\t\t\t(self -> 'quicksearch_form_reset') -> (addfield: -type='hidden', -name='-sort', -value=(self -> 'sortfield'));\n\t\t\t\tif: (self -> 'sortdescending');\n\t\t\t\t\t(self -> 'quicksearch_form') -> (addfield: -type='hidden', -name='-desc');\n\t\t\t\t\t(self -> 'quicksearch_form_reset') -> (addfield: -type='hidden', -name='-desc');\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t\tif: client_type >> 'WebKit';\n\t\t\t\t// only use 'quicksearch_form') -> (addfield: -type='search', -name='-q', -hint=(self -> 'quicksearch'), \n\t\t\t\t\t-size=15, -id = (self -> 'qs_id') + '_q', -raw='autosave=\"' + #autosavekey + '\" results=\"10\"');\n\t\t\telse;\n\t\t\t\t(self -> 'quicksearch_form') -> (addfield: -type='text', -name='-q', -hint=(self -> 'quicksearch'), \n\t\t\t\t\t-size=15, -id = (self -> 'qs_id') + '_q');\n\t\t\t/if;\n\t\t\t(self -> 'quicksearch_form') -> (addfield: -type='submit', -name='s', -value=(#lang -> quicksearch_search));\n\t\t\tif: #clientparams >> '-q';\n\t\t\t\t(self -> 'quicksearch_form') -> (setvalue: '-q'=(#clientparams -> (find: '-q') -> first -> value));\n\t\t\t\t(self -> 'quicksearch_form_reset') -> (addfield: -type='submit', -name='a', -value=(#lang -> quicksearch_showall));\n\t\t\telse;\n\t\t\t\t(self -> 'quicksearch_form_reset') -> (addfield: -type='submit', -name='a', -value=(#lang -> quicksearch_showall), -disabled);\n\t\t\t/if;\n\t\t/if;\n\n\t\t/* Added by JC 071111 to handle extra form included in the header */\n\t\tif: (local_defined: 'rawheader');\n\t\t\tif: #rawheader -> type == 'string';\n\t\t\t\t(self -> 'rawheader') = #rawheader;\n\t\t\telse;\n\t\t\t\t(self -> 'rawheader') = '';\n\t\t\t/if;\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'onassign', -required='value', -description='Internal, needed to restore references when ctype is defined as prototype';\n\t\t// recreate references here\n\t\t(self->'database') = @(#value -> 'database');\n\t\t(self->'nav') = @(#value -> 'nav');\n\t/define_tag;\n\n\tdefine_tag: 'lang', -description='Returns a reference to the language object';\n\t\treturn: @(self -> 'lang');\n\t/define_tag;\n\n\t\n\tdefine_tag: 'addfield', -description='Adds a column to the record listing. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-name (optional) Name of the field. If not specified, the field will be omitted from the grid. \\\n\t\t\t\tUseful to be able to quicksearch in fields not shown in the grid. \\\n\t\t\t\tIn that case -dbfield must be specified. \\n\\\n\t\t\t-label (optional) Column heading\\n\\\n\t\t\t-dbfield (optional) Corresponding database field name (name is used if dbfield is not specified)\\n\\\n\t\t\t-width (optional) Pixels (CSS width)\\n\\\n\t\t\t-url (optional) Columns will be linked with this url as base. Can contain #value# for example to create clickable email links. \\n\\\n\t\t\t-keyparamname (optional) Param name to use instead of the default -keyvalue for edit links\\n\\\n\t\t\t-defaultsort (optional flag) This field will be the default sort field\\n\\\n\t\t\t-nosort (optional flag) The field header should not be clickable for sort\\n\\\n\t\t\t-template (optional) Either string to format values, compound expression or map containing templates to display individual values in different ways, use -default to display unknown values, use #value# to insert the actual field value in the template. \\n\\t\\\n\t\t\t\tIf a compound expression is specified, the field value is passed as param to the expression and can be accessed as params. \\n\\t\\\n\t\t\t\tExample expressions: \\n\\t\\\n\t\t\t\t{return: params} to return just the field value as is\\n\\t\\\n\t\t\t\t{return: (date: (field: \"moddate\")) -> (format: \"%-d/%-m\")} to return a specific field as formatted date\\n\\\n\t\t\t-quicksearch (optional flag) If specified, the field will be used for search with quicksearch',\n\t\t-optional='name',\n\t\t-optional='label',\n\t\t-optional='dbfield',\n\t\t-optional='width',\n\t\t-optional='class',\n\t\t// -optional='raw',\t\t// TODO: not implemented \n\t\t-optional='url',\n\t\t-optional='keyparamname',\n\t\t-optional='defaultsort',\n\t\t-optional='nosort',\n\t\t-optional='template',\n\t\t-optional='quicksearch';\n\t\tlocal: 'timer'=knop_timer; \n\t\t\n\t\tfail_if: (local_defined: 'template') && #template -> type != 'string' \n\t\t\t&& #template -> type != 'map' \n\t\t\t&& #template -> type != 'tag', -1, 'Template must be either string, map or compound expression';\n\t\tlocal: 'field'=map;\n\n\t\tlocal_defined('name') ? #field -> insert('name' = #name); \n\t\tlocal_defined('class') ? #field -> insert('class' = #class); \n\t\tlocal_defined('url') ? #field -> insert('url' = #url); \n\t\tlocal_defined('keyparamname') ? #field -> insert('keyparamname' = #keyparamname); \n\t\tlocal_defined('width') ? #field -> insert('width' = #width);\n\t\t#field !>> 'keyparamname' ? #field -> (insert: 'keyparamname' = '-keyvalue');\n\t\t\n\t\tif: (local_defined: 'template');\n\t\t\t#field -> (insert: 'template'=(#template -> type == 'string' ? (map: '-default'=#template) | #template));\n\t\t/if;\n\t\tif: (local_defined: 'name');\n\t\t\t#field -> (insert: 'label'=( (local_defined: 'label') ? #label | #name ) );\n\t\t\t#field -> (insert: 'dbfield'=( (local_defined: 'dbfield') ? #dbfield | #name ) );\n\t\t\t#field -> (insert: 'nosort'=(local_defined: 'nosort'));\n\t\t\tif(local_defined('defaultsort')\n\t\t\t\t//&& !(local_defined: 'nosort') \n\t\t\t\t&& (self -> 'defaultsort') == ''\n\t\t\t\t//&& !(self -> 'nosort')\n\t\t\t\t); \n\t\t\t\t(self -> 'defaultsort') = #name;\n\t\t\t\tif: (self -> 'sortfield') == '';\n\t\t\t\t\t(self -> 'sortfield') = (self -> 'defaultsort');\n\t\t\t\t\tif: #defaultsort == 'desc' || #defaultsort == 'descending';\n\t\t\t\t\t\t(self -> 'sortdescending') = true;\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t\t(self -> 'dbfieldmap') -> (insert: #name = ((local_defined: 'dbfield') && #dbfield != '' ? #dbfield | #name));\n\t\t/if;\n\t\t(local_defined: 'quicksearch') ? (self -> 'quicksearch_fields') -> (insert: ((local_defined: 'dbfield') ? #dbfield | (local: 'name')));\n\t\t\n\t\tif(local_defined('name') || local_defined('label'));\n\t\t\t(self -> 'fields') -> (insert: #field);\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\tdefine_tag: 'sortparams', -description='Returns a Lasso-style pair array with sort parameters to use in the search inline.\\n\\\n\t\tParameters:\\n\\\n\t\t-sql (optional)\\n\\\n\t\t-removedotbackticks (optional flag) Use with -sql for backward compatibility for fields that contain periods. If you use periods in a fieldname then you cannot use a JOIN in Knop.',\n\t\t-optional='sql',\n\t\t-optional='removedotbackticks';\n\t\tlocal: 'timer'=knop_timer; \n\t\tif: local_defined: 'sql';\n\t\t\tfail_if: (self -> 'database') -> 'isfilemaker', 7009, '-sql can not be used with FileMaker';\n\t\t\t(self -> 'sortfield') == '' ? return;\n\t\t\tlocal('output'=string);\n\t\t\tif: (self -> 'dbfieldmap') >> (self -> 'sortfield');\n\t\t\t\t#output=' ORDER BY ';\n\t\t\t\tif(local_defined('removedotbackticks'));\n\t\t\t\t\t#output += '`' + knop_stripbackticks((self -> 'dbfieldmap') -> find(self -> 'sortfield')) + '`';\n\t\t\t\telse;\n\t\t\t\t\t#output += '`' + string_replace(knop_stripbackticks((self -> 'dbfieldmap') -> find(self -> 'sortfield')), -find='.', -replace='`.`') + '`';\n\t\t\t\t/if;\n\t\t\t\tif: (self -> 'sortdescending');\n\t\t\t\t\t#output += ' DESC';\n\t\t\t\t/if;\n\t\t\t/if;\n\t\telse;\n\t\t\tlocal: 'output'=array;\n\t\t\t(self -> 'sortfield') == '' ? return: @#output;\n\t\t\tif: (self -> 'dbfieldmap') >> (self -> 'sortfield');\n\t\t\t\t#output -> (insert: -sortfield=(self -> 'dbfieldmap') -> (find: (self -> 'sortfield')) );\n\t\t\t\tif: (self -> 'sortdescending');\n\t\t\t\t\t#output -> (insert: -sortorder='descending');\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @#output;\n\t/define_tag;\n\n\tdefine_tag: 'quicksearch', -description='Returns a pair array with fieldname=value to use in a search inline. If you specify several fields in the grid as -quicksearch (visible or not), they will be treated as if they were one single concatenated field. Quicksearch will take each word entered in the search field and search for them in the combined set of quicksearch fields, performing a \"word begins with\" match (unless you specify -contains when calling -> quicksearch).\\n\\\n\t\t\tSo if you enter dev joh it will find records with firstname=Johan, occupation=Developer.\\n\\\n\t\t\tIf you\\'re familiar with how FileMaker performs text searches, this is the way quicksearch tries to behave.\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-sql (optional flag) Return an SQL string for the search parameters instead.\\n\\\n\t\t\t-contains (optional flag) Perform a simple contains search instead of emulating \"word begins with\" search\\n\\\n\t\t\t-value (optional flag) Output just the search value of the quicksearch field instead of a pair array or SQL string\\n\\\n\t\t\t-removedotbackticks (optional flag) Use with -sql for backward compatibility for fields that contain periods. If you use periods in a fieldname then you cannot use a JOIN in Knop.',\n\t\t-optional='sql',\n\t\t-optional='contains',\n\t\t-optional='value',\n\t\t-optional='removedotbackticks';\n\t\tlocal: 'timer'=knop_timer; \n\t\t\n\t\tlocal: 'output'=array,\n\t\t\t'output_temp'=array,\n\t\t\t'_sql'=(local_defined: 'sql'), \n\t\t\t'wordseparators'=',.- (\"@\\n\\r', // \\r and \\n must not come after each other as \\r\\n, but \\n\\r is fine. \n\t\t\t'fieldvalue', 'onevalue', 'field', 'wordseparator';\n\t\tfail_if: #_sql && (self -> 'database') -> 'isfilemaker', 7009, '-sql can not be used with FileMaker';\n\n\t\t#wordseparators = #wordseparators -> (split: '');\n\t\tif: (self -> 'quicksearch_form') -> type != 'form';\n\t\t\tif: #_sql; \n\t\t\t\treturn: string;\n\t\t\telse;\n\t\t\t\treturn: array;\n\t\t\t/if;\n\t\t/if;\n\t\tif: local_defined: 'value';\n\t\t\treturn: string: ((self -> 'quicksearch_form') -> (getvalue: '-q'));\n\t\t/if;\n\t\t\n\t\t#fieldvalue = string: ((self -> 'quicksearch_form') -> (getvalue: '-q'));\n\t\tif: #fieldvalue != '';\n\t\t\tif: (self -> 'database') -> 'isfilemaker';\n\t\t\t\t#output -> (insert: -logicaloperator='or');\n\t\t\t\titerate: (self -> 'quicksearch_fields'), #field;\n\t\t\t\t\tif: (local_defined: 'contains');\n\t\t\t\t\t\t#output -> (insert: -op = 'cn');\n\t\t\t\t\t/if;\n\t\t\t\t\t#output -> (insert: #field = #fieldvalue);\n\t\t\t\t/iterate;\n\t\t\telse;\n\t\t\t\t// search each word separately\n\t\t\t\t#fieldvalue = #fieldvalue -> (split: ' ');\n\t\t\t\titerate: #fieldvalue, #onevalue;\n\t\t\t\t\t#output_temp = array;\n\t\t\t\t\titerate: (self -> 'quicksearch_fields'), #field;\n\t\t\t\t\t\tif: #_sql;\n\t\t\t\t\t\t\tif: (local_defined: 'contains');\n\t\t\t\t\t\t\t\tif(local_defined('removedotbackticks'));\n\t\t\t\t\t\t\t\t\t#output_temp -> insert('`' + knop_stripbackticks(encode_sql(#field)) + '`' \n\t\t\t\t\t\t\t\t\t\t+ ' LIKE \"%' + encode_sql(#onevalue ) + '%\"');\n\t\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\t\t#output_temp -> insert('`' + string_replace(knop_stripbackticks(encode_sql(#field)), -find='.', -replace='`.`') + '`' \n\t\t\t\t\t\t\t\t\t\t+ ' LIKE \"%' + encode_sql(#onevalue ) + '%\"');\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\tif(local_defined('removedotbackticks'));\n\t\t\t\t\t\t\t\t\t#output_temp -> insert('`' + knop_stripbackticks(encode_sql(#field)) + '`' \n\t\t\t\t\t\t\t\t\t+ ' LIKE \"' + encode_sql(#onevalue ) + '%\"');\n\t\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\t\t#output_temp -> insert('`' + string_replace(knop_stripbackticks(encode_sql(#field)), -find='.', -replace='`.`') + '`' \n\t\t\t\t\t\t\t\t\t+ ' LIKE \"' + encode_sql(#onevalue ) + '%\"');\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\t\t// basic emulation of \"word begins with\"\n\t\t\t\t\t\t\t\titerate: #wordseparators, #wordseparator;\n\t\t\t\t\t\t\t\t\tif(local_defined('removedotbackticks'));\n\t\t\t\t\t\t\t\t\t\t#output_temp -> insert('`' + knop_stripbackticks(encode_sql(#field)) + '`' \n\t\t\t\t\t\t\t\t\t\t\t+ ' LIKE \"%' + encode_sql(#wordseparator + #onevalue ) + '%\"');\n\t\t\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\t\t\t#output_temp -> insert('`' + string_replace(knop_stripbackticks(encode_sql(#field)), -find='.', -replace='`.`') + '`' \n\t\t\t\t\t\t\t\t\t\t\t+ ' LIKE \"%' + encode_sql(#wordseparator + #onevalue ) + '%\"');\n\t\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\t\t/iterate;\n\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\telse;\n\t\t\t\t\t\t\tif: (local_defined: 'contains');\n\t\t\t\t\t\t\t\t#output_temp -> (insert: -op='cn');\n\t\t\t\t\t\t\t\t#output_temp -> (insert: #field = #onevalue );\n\t\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t\t#output_temp -> (insert: -op='bw');\n\t\t\t\t\t\t\t\t#output_temp -> (insert: #field = #onevalue );\n\t\t\t\t\t\t\t\tif: !(self -> 'database' -> 'isfilemaker');\n\t\t\t\t\t\t\t\t\t// this variant is not needed for FileMaker since it already searches with \"word begins with\" as default\t\t\t\t\t\t\t#output_temp -> (insert: -op='cn');\n\t\t\t\t\t\t\t\t\titerate: #wordseparators, #wordseparator;\n\t\t\t\t\t\t\t\t\t\t#output_temp -> (insert: -op='cn');\n\t\t\t\t\t\t\t\t\t\t#output_temp -> (insert: #field = #wordseparator + #onevalue );\n\t\t\t\t\t\t\t\t\t/iterate;\n\t\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/iterate;\n\t\t\t\t\tif: #_sql;\n\t\t\t\t\t\tif: #output_temp -> size > 1;\n\t\t\t\t\t\t\t#output_temp = '(' + #output_temp -> (join: ' OR ') + ')';\n\t\t\t\t\t\telse;\n\t\t\t\t\t\t\t#output_temp = #output_temp -> first;\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t#output -> (insert: #output_temp);\n\t\t\t\t\telse;\n\t\t\t\t\t\tif: #output_temp -> size > 2;\n\t\t\t\t\t\t\t#output_temp -> (insert: -opbegin='or', 1);\n\t\t\t\t\t\t\t#output_temp -> (insert: -opend='or');\n\t\t\t\t\t\t/if;\n\t\t\t\t\t\t#output -> (merge: #output_temp);\n\t\t\t\t\t/if;\n\t\t\t\t/iterate;\n\t\t\t\t\n\t\t\t\tif: #_sql;\n\t\t\t\t\tif: #output -> size;\n\t\t\t\t\t\t#output = '(' + #output -> (join: ' AND ') + ')';\n\t\t\t\t\telse;\n\t\t\t\t\t\t#output = string;\n\t\t\t\t\t/if;\n\t\t\t\telse;\n\t\t\t\t\tif: #output -> size;\n\t\t\t\t\t\t#output -> (insert: -opbegin='and', 1);\n\t\t\t\t\t\t#output -> (insert: -opend='and');\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t/if; // isfilemaker\n\t\t/if; // #fieldvalue != ''\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @#output;\n\t/define_tag;\n\t\n\tdefine_tag: 'urlargs', -description='returns all get params that begin with - as a query string, for internal use in links in the grid. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-except (optional) Exclude these parameters (string or array)\\n\\\n\t\t\t-prefix (optional) For example ? or & to include at the beginning of the querystring \\n\\\n\t\t\t-suffix (optional) For example & to include at the end of the querystring',\n\t\t-optional='except', -copy,\n\t\t-optional='prefix',\t// for example ? or & to include at the beginning of the querystring \n\t\t-optional='suffix';\t// for example & to include at the end of the querystring\n\t\tlocal: 'timer'=knop_timer; \n\t\tlocal: 'output'=array, 'param'=null;\n\n\t\t// only getparams to not send along -action etc\n\t\tlocal: 'clientparams'=client_getparams;\n\n\t\t!(local_defined: 'except') ? local: 'except'=array;\n\t\t#except -> type != 'array' ? #except = array: #except;\n\t\t#except -> (insert: -session);\n\t\t\n\t\t// add getparams that begin with -\n\t\titerate: #clientparams, #param;\n\t\t\tif: #param -> type == 'pair';\n\t\t\t\tif: #param -> name -> (beginswith: '-') && #except !>> #param -> name;\n\t\t\t\t\t#output -> (insert: (encode_stricturl: #param -> name) + '=' + (encode_stricturl: #param -> value));\n\t\t\t\t/if;\n\t\t\telse; // just a string param (no pair)\n\t\t\t\tif: #param -> (beginswith: '-') && #except !>> #param;\n\t\t\t\t\t#output -> (insert: encode_stricturl: #param);\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t/iterate;\n\n\t\tif: self -> 'nav' -> isa('nav');\n\t\t\t// send params that have been defined as -params in nav\n\t\t\tlocal: 'navitem'=self -> 'nav' -> getnav;\n\t\t\t// add post params\n\t\t\t#clientparams -> (merge: client_postparams);\n\n\t\t\titerate: #navitem -> (find: 'params'), #param;\n\t\t\t\tif: #clientparams >> #param && #clientparams -> (find: #param) -> first -> type == 'pair';\n\t\t\t\t\t#output -> (insert: (encode_stricturl: #clientparams -> (find: #param) -> first -> name) + '=' + (encode_stricturl: #clientparams -> (find: #param) -> first -> value));\n\t\t\t\telse: #clientparams >> #param;\n\t\t\t\t\t#output -> (insert: encode_stricturl: #clientparams -> (find: #param) -> first);\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t/if;\n\t\t#output = string: (#output -> (join: '&'));\n\t\t// restore / in paths\n\t\t#output -> replace('%2F', '/');\n\n\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\tif: #output -> size;\n\t\t\treturn: (local: 'prefix') + #output + (local: 'suffix');\n\t\t/if;\n\n\t/define_tag;\n\t\n\t\n\tdefine_tag: 'renderhtml', -description='Outputs the complete record listing. Calls renderheader, renderlisting and renderfooter as well. \\\n\t\t\tIf 10 records or more are shown, renderfooter is added also just below the header.\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-inlinename (optional) If not specified, inlinename from the connected database object is used\\n\\\n\t\t\t-numbered (optional flag or integer) If specified, pagination links will be shown as page numbers instead of regular prev/next links. Defaults to 6 links, specify another number (minimum 6) if more numbers are wanted.',\n\t\t-optional='inlinename',\n\t\t-optional='xhtml',\n\t\t-optional='numbered',\n\t\t-optional='startwithfooter';\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tlocal: 'output'=string,\n\t\t\t'db'=@(self -> 'database'), \n\t\t\t'_xhtml' = (((local_defined: 'xhtml') && #xhtml != false) ? true | false);\n\t\tif(local_defined('numbered'));\n\t\t\tlocal('numberedpaging'=((#numbered !== false) ? integer(#numbered) | false));\n\t\telse;\n\t\t\tlocal('numberedpaging'=(((self -> 'numbered') !== false) ? integer(self -> 'numbered') | false));\n\t\t/if;\n\n\t\tlocal_defined('startwithfooter') && #startwithfooter != false ? #startwithfooter = true | local('startwithfooter') = false;\n\n\t\t!(local_defined: 'inlinename') ? local: 'inlinename'=string;\n\t\tself -> 'footer' = (self -> (renderfooter: -xhtml = #_xhtml, -numbered=#numberedpaging));\n\t\t#output += (self -> renderheader(-start, -xhtml = #_xhtml, -startwithfooter = #startwithfooter));\n\t\tif: #db -> shown_count >= 10 && !#startwithfooter;\n\t\t\t#output += self -> 'footer';\n\t\t/if;\n\t\t#output += (self -> (renderlisting: -inlinename=#inlinename, -xhtml=#_xhtml));\n\n\t\t#output += self -> 'footer' + '\\n';\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @#output;\n\t/define_tag;\n\n\n\tdefine_tag: 'renderlisting', -description='Outputs just the actual record listing. Is called by renderhtml. \\\n\t\t\tParameters:\\n\\\n\t\t\t-inlinename (optional) If not specified, inlinename from the connected database object is used',\n\t\t-optional='inlinename',\n\t\t-optional='xhtml';\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tlocal: '_inlinename'=string, \n\t\t\t'output'=string, \n\t\t\t'fields'=(self -> 'fields'), \n\t\t\t'field'=string,\n\t\t\t'keyfield'=null,\n\t\t\t'affectedrecord_keyvalue'=null,\n\t\t\t'record_loop_count'=integer,\n\t\t\t'db'=@(self -> 'database'), \n\t\t\t'nav'=@(self -> 'nav'),\n\t\t\t'dbfieldmap'=@(self -> 'dbfieldmap'),\n\t\t\t'classarray'=array,\n\t\t\t'fieldname'=string,\n\t\t\t'value'=string,\n\t\t\t'keyparamname',\n\t\t\t'url',\n\t\t\t'url_cached_temp',\n\t\t\t'_xhtml' = (((local_defined: 'xhtml') && #xhtml != false) ? true | false),\n\t\t\t'lang'=@(self -> 'lang');\n\t\t\t\n\t\tif: (local: 'inlinename')!='';\n\t\t\t#_inlinename = #inlinename;\n\t\telse: #db -> type == 'database';\n\t\t\t#_inlinename=#db -> 'inlinename';\n\t\t\t#keyfield=#db -> 'keyfield';\n\t\t\t#affectedrecord_keyvalue = #db -> 'affectedrecord_keyvalue';\n\t\t/if;\n\t\t#output += '\\n\\n';\n\t\tif: #nav -> (isa: 'nav');\n\t\t\titerate: #fields, #field;\n\t\t\t\tif: (#field -> (find: 'url')) != '';\n\t\t\t\t\t#url = (#field -> (find: 'url'));\n\t\t\t\t\t#keyparamname = (#field -> (find: 'keyparamname'));\n\t\t\t\t\t#field -> insert('url_cached' = (#nav -> (url: -path=#url, \n\t\t\t\t\t\t#keyparamname='###keyvalue###',\n\t\t\t\t\t\t-autoparams,\n\t\t\t\t\t\t-except=(array: -path))));\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t/if;\n\t\trecords: -inlinename=#_inlinename;\n\t\t\t#record_loop_count = loop_count;\n\t\t\t#output += '\\n';\n\t\t\titerate: #fields, #field;\n\t\t\t\t#fieldname = (#dbfieldmap -> (find: (#field -> (find: 'name'))));\n\t\t\t\t#keyparamname = (#field -> (find: 'keyparamname'));\n\t\t\t\t#value=(field: #fieldname);\n\t\t\t\tif: #field -> (find: 'template') -> type == 'map';\n\t\t\t\t\t#value=string(#value);\n\t\t\t\t\tif: #field -> (find: 'template') >> #value;\n\t\t\t\t\t\t#value = #field -> (find: 'template') -> (find: #value);\n\t\t\t\t\telse: #field -> (find: 'template') >> '-default';\n\t\t\t\t\t\t#value = #field -> (find: 'template') -> (find: '-default');\n\t\t\t\t\telse;\n\t\t\t\t\t\t// show fieldvalue as is\n\t\t\t\t\t/if;\n\t\t\t\t\t// substitute field value in the display template\n\t\t\t\t\t#value -> (replace: '#value#', (field: #fieldname));\n\t\t\t\telse: #field -> (find: 'template') -> (isa: 'tag');\n\t\t\t\t\t#value = #field -> (find: 'template') -> (run: -params=#value);\n\t\t\t\t/if;\n\t\t\t\t#classarray=array;\n\t\t\t\tif: #affectedrecord_keyvalue == (field: #keyfield) && (field: #keyfield) != '';\n\t\t\t\t\t// hightlight affected row\n\t\t\t\t\t#classarray -> (insert: 'highlight');\n\t\t\t\telse;\n\t\t\t\t\t(#record_loop_count - 1) % 2 == 0 ? #classarray -> (insert: 'even');\n\t\t\t\t/if;\n\t\t\t\t// Added by JC 081127 to handle td specific classes\n\t\t\t\t(#field -> find('class') -> size ? #classarray -> insert( #field -> find('class')));\n\t\t\t\t#output += ' size;\n\t\t\t\t\t#output += ' class=\"' + #classarray -> (join: ' ') + '\"';\n\t\t\t\t/if;\n\t\t\t\t#output += '>';\n\t\t\t\tif: (#field -> (find: 'url')) != '';\n\t\t\t\t\t#url = (#field -> (find: 'url'));\n\t\t\t\t\t/*\n\t\t\t\t\tif: #nav -> (isa: 'nav') && #url !>> '#value#';\n\t\t\t\t\t\t#output += ' (url: -path=#url, \n\t\t\t\t\t\t\t#keyparamname=(field: #keyfield),\n\t\t\t\t\t\t\t-autoparams,\n\t\t\t\t\t\t\t-except=(array: -path)));\n\t\t\t\t\t*/\n\t\t\t\t\tif: #field -> find('url_cached') -> size && #url !>> '#value#';\n\t\t\t\t\t\t#url_cached_temp = #field -> find('url_cached');\n\t\t\t\t\t\t#url_cached_temp -> replace('###keyvalue###', field(#keyfield));\n\t\t\t\t\t\t#output += ' size == 0 ? (#lang -> linktext_edit)) \n\t\t\t\t\t\t\t+ '';\n\t\t\t\t\telse;\n\t\t\t\t\t\t#url -> (replace: '#value#', (field: #fieldname));\n\t\t\t\t\t\t#output += ' (beginswith: 'http://') || #url -> (beginswith: 'https://') || #url -> (beginswith: 'mailto:')\n\t\t\t\t\t\t\t? #output += ' class=\"ext\"';\n\t\t\t\t\t\t#output += '>' + #value + '';\n\t\t\t\t\t/if;\n\t\t\t\telse;\n\t\t\t\t\t#output += #value;\n\t\t\t\t/if;\n\t\t\t\t#output += '\\n';\n\t\t\t/iterate;\n\t\t\t#output += '\\n';\n\t\t/records;\n\t\t#output += '\\n\\n';\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @#output;\n\t/define_tag;\n\t\n\t\n\tdefine_tag: 'renderheader', -description='Outputs the header of the grid with the column headings. \\\n\t\t\tAutomatically included by ->renderhtml. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-start (optional flag) Also output opening tag',\n\t\t-optional='start',\n\t\t-optional='xhtml',\n\t\t-optional = 'startwithfooter';\n\t\tlocal: 'timer'=knop_timer; \n\t\tlocal: 'output'=string, \n\t\t\t'db'=@(self -> 'database'), \n\t\t\t'nav'=@(self -> 'nav'),\n\t\t\t'fields'=@(self -> 'fields'), \n\t\t\t'field'=string,\n\t\t\t'classarray'=array,\n\t\t\t'_xhtml' = ((local_defined: 'xhtml') && #xhtml != false) ? true | false,\n\t\t\t'lang'=@(self -> 'lang');\n\t\tlocal_defined('startwithfooter') && #startwithfooter != false ? #startwithfooter = true | local('startwithfooter') = false;\n\n\n\t\t(local_defined: 'start') ? #output += '
'tbl_id') + '\" class=\"grid' + (self -> 'class' -> size > 0 ? ' ' + self -> 'class') + '\">';\n\t\t#output += '\\n';\n\t\tif: (self -> 'quicksearch_form') -> type == 'form';\n\t\t\t#output += '\\n';\n\t\telse((self -> 'rawheader') -> size > 0);\n\t\t\t#output += '\\n';\n\t\t/if;\n\n\t\tif(#startwithfooter);\n\t\t\t#output += self -> 'footer';\n\t\t/if;\n\n\t\t#output += '';\n\n\t\titerate: #fields, #field;\n\t\t\t#classarray=array;\n\t\t\t//(self -> 'quicksearch_form') -> type == 'form' ? #classarray -> (insert: 'notopborder');\n\t\t\tif: !(self -> 'nosort');\n\t\t\t\t(self -> 'sortfield') == (#field -> (find: 'name')) \n\t\t\t\t\t&& !(#field -> (find: 'nosort')) ? #classarray -> (insert: 'sort');\n\t\t\t/if;\n\t\t\t#output += ' (find: 'width') > 0;\n\t\t\t\t#output += ' style=\"width: ' + (integer: #field -> (find: 'width')) + 'px;\"';\n\t\t\t/if;\n\t\t\t// Added by Jolle 081127 to handle td specific classes\n\t\t\t(#field -> find('class') -> size ? #classarray -> insert( #field -> find('class')));\n\t\t\tif: #classarray -> size;\n\t\t\t\t#output += ' class=\"' + #classarray -> (join: ' ') + '\"';\n\t\t\t/if;\n\t\t\t#output += '>';\n\t\t\tif: (#field -> (find: 'nosort')) || (self -> 'nosort');\n\t\t\t\t#output += '
' + (#field -> (find: 'label')) '
';\n\t\t\telse;\n\t\t\t\tif: (#classarray >> 'sort' && (self -> 'sortdescending') && (self -> 'defaultsort') == '');\n\t\t\t\t\t// create link to change to unsorted\n\t\t\t\t\tif: #nav -> isa('nav');\n\t\t\t\t\t\t#output += ' url(-autoparams, -getargs, -except=(array: -sort, -desc, -page, -path)) + '\"'\n\t\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_showunsorted) + '\">';\n\t\t\t\t\telse;\n\t\t\t\t\t\t#output += ' (urlargs: -except=(array: -sort, -desc, -page), -prefix='?')) + '\"'\n\t\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_showunsorted) + '\">';\n\t\t\t\t\t/if;\n\t\t\t\telse;\n\t\t\t\t\t// create link to toggle sort mode\n\t\t\t\t\tif: #nav -> isa('nav');\n\t\t\t\t\t\t#output += ' url(-autoparams, -getargs, -except=(array: -sort, -desc, -page, -path), \n\t\t\t\t\t\t\t-urlargs='-sort=' + (#field -> (find: 'name'))\n\t\t\t\t\t\t\t\t+ (#classarray >> 'sort' && !(self -> 'sortdescending') ? '&-desc')) + '\"'\n\t\t\t\t\t\t\t+ ' title=\"' + (#classarray >> 'sort' \n\t\t\t\t\t\t\t\t? (#lang -> linktitle_changesort) + ' ' \n\t\t\t\t\t\t\t\t\t+ ((self -> 'sortdescending') ? (#lang -> linktitle_ascending) | (#lang -> linktitle_descending))\n\t\t\t\t\t\t\t\t| (#lang -> linktitle_sortascby) + ' ' + (encode_html: (#field -> (find: 'label'))) ) + '\">';\n\t\t\t\t\telse;\n\t\t\t\t\t\t#output += ' (find: 'name')) \n\t\t\t\t\t\t\t+ (#classarray >> 'sort' && !(self -> 'sortdescending') ? '&-desc') \n\t\t\t\t\t\t\t+ (self -> (urlargs: -except=(array: -sort, -desc, -page), -prefix='&')) + '\"'\n\t\t\t\t\t\t\t+ ' title=\"' + (#classarray >> 'sort' \n\t\t\t\t\t\t\t\t? (#lang -> linktitle_changesort) + ' ' \n\t\t\t\t\t\t\t\t\t+ ((self -> 'sortdescending') ? (#lang -> linktitle_ascending) | (#lang -> linktitle_descending))\n\t\t\t\t\t\t\t\t| (#lang -> linktitle_sortascby) + ' ' + (encode_html: (#field -> (find: 'label'))) ) + '\">';\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t\t#output += (#field -> (find: 'label'));\n\t\t\t\tif: (string_findregexp: (#field -> (find: 'label')), -find='\\\\S') -> size == 0;\n\t\t\t\t\t#output += ' '; // to show sort link as block element properly even for empty label\n\t\t\t\t/if;\n\t\t\t\tif: #classarray >> 'sort';\n\t\t\t\t\t#output += ' ' + ((self -> 'sortdescending') ? '▼' | '▲') + '';\n\t\t\t\t/if;\n\t\t\t\t#output += '';\n\t\t\t /if;\n\t\t\t #output += '\\n';\n\t\t/iterate;\n\t\t#output += '\\n\\n';\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @#output;\n\t/define_tag;\n\n\tdefine_tag: 'renderfooter', -description='Outputs the footer of the grid with the prev/next links and information about found count. \\\n\t\t\tAutomatically included by ->renderhtml\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-end (optional flag) Also output closing
size) + '\" class=\"quicksearch';\n\t\t\t\t((self -> 'quicksearch_form') -> (getvalue: '-q') != '') ? #output += ' highlight';\n\t\t\t#output += '\">';\n\n\t\t\tif: (self -> 'rawheader') -> size > 0 ;\n\t\t\t\t#output += (self -> 'rawheader');\n\t\t\t/if;\n\n\n\t\t\t#output += (self -> 'quicksearch_form') -> (renderform: -xhtml = #_xhtml);\n\t\t\tif: (self -> 'quicksearch_form_reset') -> type =='form';\n\t\t\t\t#output += (self -> 'quicksearch_form_reset') -> (renderform: -xhtml = #_xhtml);\n\t\t\t/if;\n\t\t\t#output += '
size) + '\">';\n\t\t\t#output += (self -> 'rawheader');\n\t\t\t#output += '
tag\\n\\\n\t\t\t-numbered (optional flag or integer) If specified, pagination links will be shown as page numbers instead of regular prev/next links. Defaults to 6 links, specify another number (minimum 6) if more numbers are wanted.',\n\t\t-optional='end',\n\t\t-optional='numbered',\n\t\t-optional='xhtml';\n\t\tlocal: 'timer'=knop_timer; \n\t\tlocal: 'output'=string, \n\t\t\t'db'=@(self -> 'database'), \n\t\t\t'nav'=@(self -> 'nav'),\n\t\t\t'fields'=@(self -> 'fields'), \n\t\t\t'field'=string,\n\t\t\t//'numberedpaging'=(((local_defined: 'numbered') && #numbered !== false) ? integer(#numbered) | false),\n\t\t\t'_xhtml' = ((local_defined: 'xhtml') && #xhtml != false) ? true | false,\n\t\t\t'lang'=@(self -> 'lang'),\n\t\t\t'page'=(self -> page),\n\t\t\t'lastpage'=(self -> lastpage),\n\t\t\t'url_cached',\n\t\t\t'url_cached_temp';\n\t\tif(local_defined('numbered'));\n\t\t\tlocal('numberedpaging'=((#numbered !== false) ? integer(#numbered) | false));\n\t\telse;\n\t\t\tlocal('numberedpaging'=(((self -> 'numbered') !== false) ? integer(self -> 'numbered') | false));\n\t\t/if;\n\t\t\t\n\t\tif(#nav -> isa('nav'));\n\t\t\t#url_cached=#nav -> url(-autoparams, -getargs, -except=(array: -page, -path), \n\t\t\t\t\t-urlargs='-page=###page###');\n\t\t/if;\n\t\tif: #numberedpaging !== false && #numberedpaging < 6;\n\t\t\t// show 10 page numbers as default\n\t\t\t#numberedpaging = 6;\n\t\t/if;\n\t\tif: #numberedpaging;\n\t\t\t// make sure we have an even number\n\t\t\t#numberedpaging += #numberedpaging % 2;\n\t\t/if;\n\t\t\n\t\t#output += '\\n size) + '\" class=\"footer first' + '\">';\n\t\t/* not used\n\t\tif: #nav -> isa('nav');\n\t\t\tlocal: 'url'=#nav -> url(-autoparams, -getargs, -except=(array: -page, -path), -urlargs='-page='),\n\t\t\t\t'url_prefix'=(#nav -> 'navmethod' == 'param' ? '&' | '?');\n\t\telse;\n\t\t\tlocal: 'url'='./' + (self -> (urlargs: -except=(array: -page, -path), -suffix='&')),\n\t\t\t\t'url_prefix'='?';\n\t\t/if;\n\t\t*/\n\t\t// JC 2010-05-14 added span separation for better styling\n\t\tif: #numberedpaging;\n\t\t\tlocal: 'page_from'=1,\n\t\t\t\t'page_to'=#lastpage;\n\t\t\tif: #lastpage > #numberedpaging;\n\t\t\t\t#page_from=#page - (#numberedpaging/2 - 1);\n\t\t\t\t#page_to=#page + (#numberedpaging/2);\n\t\t\t\tif: #page_from < 1;\n\t\t\t\t\t#page_to += (1 - #page_from);\n\t\t\t\t\t#page_from = 1;\n\t\t\t\t/if;\n\t\t\t\tif: #page_to > #lastpage;\n\t\t\t\t\t#page_from = #lastpage - (#numberedpaging - 1);\n\t\t\t\t\t#page_to = #lastpage;\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t\t#output += '' + #db -> found_count + ' ' + (#lang -> footer_found) + ' — ' + (#lang -> linktext_gotopage) + ': '; // SP customization\n\t\t\tif: #page > 1;\n\t\t\t\tif: #url_cached -> size;\n\t\t\t\t\t#url_cached_temp=#url_cached;\n\t\t\t\t\t// 2010-12-23\tSP\tCorrected pagination bug for -numbered.\n\t\t\t\t\t#url_cached_temp -> replace('-page=###page###', '-page=' + 1);\n\t\t\t\t\t/*#output += ' url(-autoparams, -getargs, -except=(array: -page, -path), \n\t\t\t\t\t\t-urlargs='-page=' + (#page - 1)) + '\" class=\"prevnext prev\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_goprev) + '\">' + (#lang -> linktext_prev) + ' ';*/\n\t\t\t\t\t#output += ' linktitle_gofirst) + '\">' + (#lang -> linktext_first) + ' ';\n\n\t\t\t\t\t#url_cached_temp=#url_cached;\n\t\t\t\t\t#url_cached_temp -> replace('-page=###page###', '-page=' + (#page - 1));\n\t\t\t\t\t#output += ' linktitle_goprev) + '\">' + (#lang -> linktext_prev) + ' ';\n\t\t\t\telse;\n\t\t\t\t\t#output += ' (urlargs: -except=(array: -page, -path), -suffix='&')) \n\t\t\t\t\t\t+ '-page=1\" class=\"prevnext first\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_gofirst) + '\">' + (#lang -> linktext_first) + ' ';\n\t\t\t\t\t#output += ' (urlargs: -except=(array: -page, -path), -suffix='&')) \n\t\t\t\t\t\t+ '-page=' + (#page - 1) + '\" class=\"prevnext prev\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_goprev) + '\">' + (#lang -> linktext_prev) + ' ';\n\t\t\t\t/if;\n\t\t\telse;\n\t\t\t\t//#output += ' ' + (#lang -> linktext_prev) + ' ';\n\t\t\t/if;\n\t\t\tif: #page_from > 1;\n\t\t\t\tif: #url_cached -> size;\n\t\t\t\t\t#url_cached_temp=#url_cached;\n\t\t\t\t\t#url_cached_temp -> replace('-page=###page###', '-page=' + 1);\n\t\t\t\t\t/*#output += ' url(-autoparams, -getargs, -except=(array: -page, -path),\n\t\t\t\t\t\t-urlargs='-page=1') + '\" class=\"prevnext numbered first\">1';*/\n\t\t\t\t\t#output += ' 1';\n\t\t\t\telse;\n\t\t\t\t\t#output += ' (urlargs: -except=(array: -page, -path), -suffix='&')) \n\t\t\t\t\t\t+ '-page=1\" class=\"prevnext numbered first\">1 ';\n\t\t\t\t/if;\n\t\t\t\tif: #page_from > 2;\n\t\t\t\t\t#output +='...';\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t\tloop: -from=#page_from, -to=#page_to;\n\t\t\t\tif: loop_count == #page;\n\t\t\t\t\t#output += ' ' + loop_count + ' ';\n\t\t\t\telse;\n\t\t\t\t\tif: #url_cached -> size;\n\t\t\t\t\t\t#url_cached_temp=#url_cached;\n\t\t\t\t\t\t#url_cached_temp -> replace('-page=###page###', '-page=' + loop_count);\n\t\t\t\t\t\t/*#output += ' url(-autoparams, -getargs, -except=(array: -page, -path),\n\t\t\t\t\t\t\t-urlargs='-page=' + loop_count) + '\" class=\"prevnext numbered\">' + loop_count + ' ';*/\n\t\t\t\t\t\t#output += ' ' + loop_count + ' ';\n\t\t\t\t\telse;\n\t\t\t\t\t\t#output += ' (urlargs: -except=(array: -page, -path), -suffix='&')) \n\t\t\t\t\t\t\t+ '-page=' + loop_count + '\" class=\"prevnext numbered\">' + loop_count + ' ';\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t/loop;\n\t\t\tif: #page_to < #lastpage;\n\t\t\t\tif: #page_to < (#lastpage - 1);\n\t\t\t\t\t#output += '...';\n\t\t\t\t/if;\n\t\t\t\tif: #url_cached -> size;\n\t\t\t\t\t#url_cached_temp=#url_cached;\n\t\t\t\t\t#url_cached_temp -> replace('-page=###page###', '-page=' + #lastpage);\n\t\t\t\t\t/*#output += ' url(-autoparams, -getargs, -except=(array: -page, -path),\n\t\t\t\t\t\t-urlargs='-page=' + #lastpage) + '\" class=\"prevnext numbered last\">' + #lastpage + ' ';*/\n\t\t\t\t\t#output += ' ' + #lastpage + ' ';\n\t\t\t\telse;\n\t\t\t\t\t#output += ' (urlargs: -except=(array: -page, -path), -suffix='&')) \n\t\t\t\t\t\t+ '-page=' + #lastpage + '\" class=\"prevnext numbered last\">' + #lastpage + ' ';\n\t\t\t\t/if;\n\t\t\t/if;\n\t\n\t\t\tif: #page < #lastpage;\n\t\t\t\tif: #url_cached -> size;\n\t\t\t\t\t#url_cached_temp=#url_cached;\n\t\t\t\t\t#url_cached_temp -> replace('-page=###page###', '-page=' + (#page + 1));\n\t\t\t\t\t/*#output += ' url(-autoparams, -getargs, -except=(array: -page, -path), \n\t\t\t\t\t\t-urlargs='-page=' + (#page + 1)) + '\" class=\"prevnext next\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_gonext) + '\">' + (#lang -> linktext_next) + ' ';*/\n\t\t\t\t\t#output += ' linktitle_gonext) + '\">' + (#lang -> linktext_next) + ' ';\n\n\t\t\t\t\t#url_cached_temp=#url_cached;\n\t\t\t\t\t#url_cached_temp -> replace('-page=###page###', '-page=' + #lastpage);\n\t\t\t\t\t#output += ' linktitle_golast) + '\">' + (#lang -> linktext_last) + ' ';\n\t\t\t\telse;\n\t\t\t\t\t#output += ' (urlargs: -except=(array: -page, -path), -suffix='&')) \n\t\t\t\t\t\t+ '-page=' + (#page + 1) + '\" class=\"prevnext next\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_gonext) + '\">' + (#lang -> linktext_next) + ' ';\n\t\t\t\t\t#output += ' (urlargs: -except=(array: -page, -path), -suffix='&')) \n\t\t\t\t\t\t+ '-page=' + #lastpage + '\" class=\"prevnext last\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_golast) + '\">' + (#lang -> linktext_last) + ' ';\n\t\t\t\t/if;\n\t\t\telse;\n\t\t\t\t//#output += ' ' + (#lang -> linktext_next) + ' ';\n\t\t\t/if;\n\t\t\n\t\t\t#output += ' ';\n\t\t\n\t\t\n\t\telse; // regular prev/next links\n\t\t\n\t\t\n\t\t\tif: #page > 1;\n\t\t\t\tif: #url_cached -> size;\n\t\t\t\t\t#url_cached_temp=#url_cached;\n\t\t\t\t\t#url_cached_temp -> replace('-page=###page###', '-page=' + 1);\n\t\t\t\t\t/*#output += ' url(-autoparams, -getargs, -except=(array: -page, -path),\n\t\t\t\t\t\t-urlargs='-page=1') + '\" class=\"prevnext first\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_gofirst) + '\">' + (#lang -> linktext_first) + ' ';*/\n\t\t\t\t\t#output += ' linktitle_gofirst) + '\">' + (#lang -> linktext_first) + ' ';\n\t\t\n\t\t\t\t\t#url_cached_temp=#url_cached;\n\t\t\t\t\t#url_cached_temp -> replace('-page=###page###', '-page=' + (#page - 1));\n\t\t\t\t\t#output += ' linktitle_goprev) + '\">' + (#lang -> linktext_prev) + ' ';\n\t\t\t\telse;\n\t\t\t\t\t#output += ' (urlargs: -except=(array: -page, -path), -suffix='&')) \n\t\t\t\t\t\t+ '-page=1\" class=\"prevnext first\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_gofirst) + '\">' + (#lang -> linktext_first) + ' ';\n\t\t\n\t\t\t\t\t#output += ' (urlargs: -except=(array: -page, -path), -suffix='&')) \n\t\t\t\t\t\t+ '-page=' + (#page - 1) + '\" class=\"prevnext prev\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_goprev) + '\">' + (#lang -> linktext_prev) + ' ';\n\t\t\t\t/if;\n\t\t\telse;\n\t\t\t\t#output += ' ' + (#lang -> linktext_first) + ' \\\n\t\t\t\t\t\t\t' + (#lang -> linktext_prev) + ' ';\n\t\t\t/if;\n\t\t\tif: #db -> found_count > #db -> shown_count;\n\t\t\t\t#output += (#lang -> (footer_shown: -replace=(array: (#db -> shown_first), (#db -> shown_last)))) + ' ';\n\t\t\t/if;\n\t\t\t#output += #db -> found_count + ' ' + (#lang -> footer_found);\n\t\t\tif: (#db -> shown_last) < (#db -> found_count);\n\t\t\t\tif: #url_cached -> size;\n\t\t\t\t\t#url_cached_temp=#url_cached;\n\t\t\t\t\t#url_cached_temp -> replace('-page=###page###', '-page=' + (#page + 1));\n\t\t\t\t\t/*#output += ' url(-autoparams, -getargs, -except=(array: -page, -path), \n\t\t\t\t\t\t-urlargs='-page=' + (#page + 1)) + '\" class=\"prevnext next\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_gonext) + '\">' + (#lang -> linktext_next) + ' ';*/\n\t\t\t\t\t#output += ' linktitle_gonext) + '\">' + (#lang -> linktext_next) + ' ';\n\n\t\t\t\t\t#url_cached_temp=#url_cached;\n\t\t\t\t\t#url_cached_temp -> replace('-page=###page###', '-page=' + #lastpage);\n\t\t\t\t\t#output += ' linktitle_golast) + '\">' + (#lang -> linktext_last) + ' ';\n\t\t\t\telse;\n\t\t\t\t\t#output += ' (urlargs: -except=(array: -page, -path), -suffix='&')) \n\t\t\t\t\t\t+ '-page=' + (#page + 1) + '\" class=\"prevnext next\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_gonext) + '\">' + (#lang -> linktext_next) + ' ';\n\t\t\t\t\t#output += ' (urlargs: -except=(array: -page, -path), -suffix='&')) \n\t\t\t\t\t\t+ '-page=' + ((self -> lastpage)) + '\" class=\"prevnext last\"'\n\t\t\t\t\t\t+ ' title=\"' + (#lang -> linktitle_golast) + '\">' + (#lang -> linktext_last) + ' ';\n\t\t\t\t/if;\n\t\t\telse;\n\t\t\t\t#output += ' ' + (#lang -> linktext_next) + ' \\\n\t\t\t\t\t\t\t' + (#lang -> linktext_last) + ' ';\n\t\t\t/if;\n\t\t/if;\n\t\t#output += '\\n';\n\t\t(local_defined: 'end') ? #output += '\\n';\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @#output;\n\t/define_tag;\n\t\n\tdefine_tag: 'page', -description='Returns the current page number';\n\t\treturn: (self -> 'page');\n\t/define_tag;\n\t\n\tdefine_tag: 'lastpage', -description='Returns the number of the last page for the found records';\n\t\tif: (self -> 'database') -> 'found_count' > 0;\n\t\t\treturn: (((self -> 'database') -> 'found_count' - 1) / (self -> 'database') -> 'maxrecords_value') + 1;\n\t\telse;\n\t\t\treturn: 1;\n\t\t/if;\n\t/define_tag;\n\t\n\tdefine_tag: 'page_skiprecords', -description='Converts curent page value to a skiprecords value to use in a search. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-maxrecords (required integer) Needed to be able to do the calculation. Maxrecords_value can not be taken from the database object since taht value is not available until aftetr performing the search',\n\t\t-required='maxrecords', -type='integer'; // TODO: maxrecords_value can be taken from the database object so should not be required\n\t\treturn: ((self -> 'page') - 1) * #maxrecords;\n\t/define_tag;\n\t\n\n/define_type;\n\n?>[\n//------------------------------------------------------------------\n// End knop_grid\n//------------------------------------------------------------------\n\n//##################################################################\n\n][\n//------------------------------------------------------------------\n// Begin knop_lang\n//------------------------------------------------------------------\n\n]getstring: make sure we only try to do replacement in strings or bytes\n2010-05-27\tJS\tgetstring now works also with empty -replace value\n2010-04-20\tJS\tgetstring debug output corrected for missing string. \n2009-09-16\tJS\tSyntax adjustments for Lasso 9\n2009-06-26\tJS\t->addstring: clarified deprecation warning\n2009-04-08\tJS\tAdded -debug flag to oncreate (when creating a lang object) to make undefined language keys appear as *key*.\n2009-03-24\tJS\t->getstring prevents replacements if there is no language string found, to prevent null->replace error\n2008-11-12\tJS\tAdded ->insert instead of ->addstring for better consistency with other Lasso data types. ->addstring will remain functional for backwards compatibility. \n2008-09-11\tJS\t->_unknowntag: added missing support for -language\n2008-01-22\tJS\t->getstring: corrected the fallback behavior when a current language has been set \n2008-01-07\tJS\tRemoved instance variable browserlanguage due to problems with transient storage. The browserlanguage is cached on page level so it's no loss in reality. \n2007-12-12\tJS\tAdded page level storage of currentlanguage, so all knop_lang instances defaults to the same language once one of them have set a language explictly, but only if the other knop_lang instances don't have a language set explicitly. \n2007-12-12\tJS\tAdded page level caching of browser language (stores the value in $_knop_data map)\n2007-12-06\tJS\tMoved -> help to knop_base\n2007-12-06\tJS\tAdded ->description to all member tags. \n2007-12-03\tJS\tFinished first complete version\n2007-06-18\tJS\tAdded tag timer to most member tags\n2007-06-13\tJS\tadded inheritance from knop_base\n2007-06-13\tJS\tRenamed to knop_lang (formerly knop_strings)\n2007-04-04\tJS\tCreated the data type and started coding\n\nTODO:\nProvide methods to handle formatting of dates, numbers, currency etc for different languages/locales. \nWeekday names, month names etc. \nMember tag to return the current language\nMember tag to set default output encoding unless it follows encode_set. \n\nExamples\n\tvar: 'lang_messages'=(knop_lang: -default='en');\n\t$lang_messages -> (insert: -key='welcome', -value='Welcome to the home page', -language='en');\n\t$lang_messages -> (insert: -key='welcome', -value='Välkommen till hemsidan', -language='sv');\n\t$lang_messages -> (insert: -key='loggedin', -value='You are logged in as #1# #2#', -language='en');\n\t$lang_messages -> (insert: -key='loggedin', -value='Du är inloggad som #1# #2#', -language='sv');\n\n\t// proper call, defaults to the browser's preferred language\n\t$lang_messages -> (getstring: 'welcome');\n\t// shorthand call\n\t$lang_messages -> welcome;\n\n\t// change language\n\t$lang_messages -> (setlanguage: 'sv');\n\t$lang_messages -> welcome;\n\n\t// proper call with replacements\n\t$lang_messages -> (getstring: -key='loggedin': -replace=(array: (field: 'firstname'), (field: 'lastname')));\n\n\t// shorthand call with replacements\n\t$lang_messages -> (loggedin: -replace=(array: (field: 'firstname'), (field: 'lastname')));\n\n\n*/\n\n\t// instance variables\n\tlocal: 'strings'=map,\t\t// map: language=(map: key=value, key=value), language=...\n\t\t'defaultlanguage'=string,\n\t\t'fallback'=false,\n\t\t'currentlanguage'=null,\t// the currently set language\n\t\t'keys'=null,\t\t\t// cached keys array\n\t\t'debug'=false;\n\n\tdefine_tag: 'oncreate', -description='Creates a new instance of knop_lang. \\n\\\n\t\t\tParameters: \\n\\\n\t\t\t-default (optional) Default language. \\n\\\n\t\t\t-fallback (optional) If specified, falls back to default language if key is missing. \\n\\\n\t\t\t-debug (optional flag) If specified, missing strings will be output using the key surrpunded by asterisks',\n\t\t-optional='default',\t\n\t\t-optional='fallback',\n\t\t-optional='debug';\n\t\tlocal: 'timer'=knop_timer; \n\t\t\n\t\tif(local_defined('default') && #default -> size);\n\t\t\t(self -> 'defaultlanguage') = #default;\n\t\t/if;\n\t\t(self -> 'fallback') = ((local_defined: 'fallback') && #fallback != false);\n\t\t(self -> 'debug') = ((local_defined: 'debug') && #debug != false);\n\t\t\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\tdefine_tag: 'onconvert', -description='Returns raw dump of the instance for debugging';\n\t\treturn: (self -> dump);\n\t/define_tag;\n\n\tdefine_tag: '_unknowntag', -description='Returns the language string for the specified text key \\\n\t\t\t= shortcut for getstring. \\n\\Parameters: \\n\\\n\t\t\t-language (optional) see getstring: -language.\\n\\ \n\t\t\t-replace (optional) see getstring: -replace. ',\n\t\t-optional='language',\n\t\t-optional='replace';\n\t\t!(local_defined: 'replace') ? local: 'replace'=string;\n\t\t!(local_defined: 'language') ? local: 'language'=string;\n\t\tif: self -> keys >> tag_name;\n\t\t\treturn: @(self -> (getstring: -key=Tag_name, -language=#language, -replace=#replace));\n\t\telse;\n\t\t\t(self -> 'debug_trace') -> insert('Error: ' + tag_name + ' not found');\n\t\t\t(self -> 'debug') ? return('*' + tag_name + '*');\n\t\t/if;\n\t/define_tag;\n\t\n\n\tdefine_tag: 'addlanguage', -description='Adds a map with language strings for an entire language. Replaces all existing language strings for that language. \\n\\\n\t\t\tParameters: \\n\\\n\t\t\t-language (required) The language to add. \\n\\\n\t\t\t-strings (required) Complete map of key=value for the entire language.',\n\t\t-required='language',\n\t\t-required='strings', -type='map';\n\t\tlocal: 'timer'=knop_timer; \n\t\t(self -> 'keys') = null;\n\t\t(self -> 'strings') -> (insert: #language = #strings);\n\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\n\tdefine_tag('addstring', -description='Deprecated synonym for ->insert',\n\t\t-required='language',\n\t\t-required='key',\n\t\t-required='value');\n\t\t(self -> 'debug_trace') -> insert('*** DEPRECATION WARNING *** ' + tag_name + ' is deprecated, use ->insert instead');\n\t\tself -> insert(-language=#language, -key=#key, -value=#value);\n\t/define_tag;\n\t\n\tdefine_tag: 'insert',-description='Adds an individual language string. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-language (required) The language for the string. \\n\\\n\t\t\t-key (required) Textkey to store the string under. Replaces any existing key for the same language. \\n\\\n\t\t\t-value (required) The actual string (can also be compound expression). Can contain replacement tokens #1#, #2# etc. ',\n\t\t-required='language',\n\t\t-required='key',\n\t\t-required='value';\n\t\tlocal: 'timer'=knop_timer; \n\t\t(self -> 'keys') = null;\n\t\tif: (self -> 'strings') !>> #language;\n\t\t\t(self -> 'strings') -> (insert: #language = map);\n\t\t/if;\n\t\t((self -> 'strings') -> (find: #language)) -> (insert: #key = #value);\n\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'getstring',\t-description='Returns a specific text string in the language that has previously been set for the instance.\\\n\t\t\t\tIf no language has been set, the browser\\'s preferred language will be used unless another instance on the same page \\\n\t\t\t\thas a language set using ->setlanguage. \\n\\\n\t\t\t\tIf the string is not available in the chosen language and -fallback was specified, \\\n\t\t\t\tthe string for the language that was first specified for that key will be returned. \\n\\\n\t\t\t\tParameters: \\n\\\n\t\t\t\t-key (required) textkey to return the string for. \\n\\\n\t\t\t\t-language (optional) to return a string for a specified language (temporary override). \\n\\\n\t\t\t\t-replace (optional) single value or array of values that will be used as substitutions for placeholders #1#, #2# etc in the returned string, in the order they appear. Replacements can be compund expressions, which will be executed. Can also be map or pair array, and in that case the left hand element of the map/array will be replaced by the right hand element. ',\n\t\t-required='key',\n\t\t-optional='language', -copy,\n\t\t-optional='replace', -copy;\n\t\t\t\t\t\t\t\t\t\t\n\t\tif: (var: '_knop_data') -> type != 'map';\n\t\t\t// page level caching\n\t\t\t$_knop_data = map;\n\t\t/if;\n\n\t\t!(local_defined: 'language') ? local: 'language'=string;\n\n\t\tlocal: 'timer'=knop_timer; \n\t\tlocal: 'output'=string;\n\t\tif: #language -> size == 0 || !(self -> (validlanguage: #language));\n\t\t\t#language=(self -> 'currentlanguage');\n\t\t\tif: #language -> size == 0;\n\t\t\t\tif: $_knop_data >> 'currentlanguage' && self -> (validlanguage: ($_knop_data -> (find: 'currentlanguage')));\n\t\t\t\t\t// fall back to page level language\n\t\t\t\t\t#language = $_knop_data -> find('currentlanguage');\n\t\t\t\telse;\n\t\t\t\t\t// fall back to the browser's preferred language\n\t\t\t\t\t#language=(self -> browserlanguage);\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t\tif: #language -> size == 0 && self -> (validlanguage: (self -> 'defaultlanguage'));\n\t\t\t\t// still no matching language, fall back to defaultlanguage\n\t\t\t\t#language = (self -> 'defaultlanguage');\n\t\t\telse: #language -> size == 0;\n\t\t\t\t// still no matching language, fall back to the first language\n\t\t\t\t#language = (self -> 'strings') -> keys -> first;\n\t\t\t/if;\n\t\t\tif: (self -> 'strings') !>> #language\n\t\t\t\t|| ((self -> 'strings') >> #language\n\t\t\t\t\t&& (self -> 'strings') -> (find: #language) !>> #key\n\t\t\t\t\t&& (self -> 'fallback'));\n\t\t\t\t// key is not found in current language, switch to default language\n\t\t\t\tif: self -> (validlanguage: (self -> 'defaultlanguage'));\n\t\t\t\t\t// still no matching language, fall back to defaultlanguage\n\t\t\t\t\t#language = (self -> 'defaultlanguage');\n\t\t\t\telse;\n\t\t\t\t\t// no default language to fall back to\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t/if;\n\t\tif: (self -> 'strings') >> #language;\n\t\t\tif((self -> 'strings') -> find(#language) !>> #key);\n\t\t\t\t(self -> 'debug_trace') -> insert('Error: ' + #key + ' not found');\n\t\t\t\tself -> 'tagtime_tagname'=tag_name;\n\t\t\t\tself -> 'tagtime'=integer(#timer); // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t\t\t(self -> 'debug') \n\t\t\t\t\t? return('*' + #key + '*') \n\t\t\t\t\t| return;\n\t\t\t/if;\n\t\t\t#output = (self -> 'strings') -> (find: #language) -> (find: #key);\n\t\t\t//(self -> 'debug_trace') -> (insert: tag_name + ': found string \"' + (encode_html: #output) + '\" for key \"' + #key + '\" and language ' + #language);\n\t\t\t\n\t\t\tif: #output -> (isa: 'tag');\n\t\t\t\t// execute compund expression\n\t\t\t\t#output = #output -> run;\n\t\t\t/if;\n\t\t\tif((#output -> isa('string') || #output -> isa('bytes')) \n\t\t\t\t&& #output -> size && (local_defined: 'replace'));\n\t\t\t\t// replace placeholders with real values\n\t\t\t\tif: !(#replace -> (isa: 'array')) && !(#replace -> (isa: 'map'));\n\t\t\t\t\t#replace = (array: #replace);\n\t\t\t\t/if;\n\t\t\t\titerate: #replace, local: 'replacement';\n\t\t\t\t\t// make sure we have a pair\n\t\t\t\t\tif: !(#replacement -> (isa: 'pair'));\n\t\t\t\t\t\t#replacement = (pair: '#' + loop_count + '#' = #replacement);\n\t\t\t\t\t/if;\n\t\t\t\t\t// if we have a compund expression as replacement, execute the replacement first\n\t\t\t\t\tif: (#replacement -> value -> (isa: 'tag'));\n\t\t\t\t\t\t(#replacement -> value) = #replacement -> value -> run;\n\t\t\t\t\t/if;\n\t\t\t\t\t#output -> (replace: #replacement -> name, #replacement -> value);\n\t\t\t\t/iterate;\n\t\t\t/if;\n\t\t/if;\n\t\t\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: #output;\n\t\t\n\t/define_tag;\n\t\n\tdefine_tag: 'setlanguage', -description='Sets the current language for the string object. Also affects other instances on the same page that do not have an explicit language set. ',\n\t\t-required='language';\n\t\tlocal: 'timer'=knop_timer; \n\t\tif: (var: '_knop_data') -> type != 'map';\n\t\t\t// page level caching\n\t\t\t$_knop_data = map;\n\t\t/if;\n\t\tif: self -> (validlanguage: #language);\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': Setting language to ' + #language);\n\t\t\t(self -> 'currentlanguage') = #language;\n\t\t\t// save page level language\n\t\t\t$_knop_data -> insert('currentlanguage' = #language);\n\t\telse;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': Could not set current language to ' + #language + ' since it does not exist in the lang object');\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\tdefine_tag: 'validlanguage', -description='Checks if a specified language exists in the string object, \\\n\t\treturns true or false.',\n\t\t-required='language';\n\t\treturn: (self -> 'strings') -> keys >> #language;\n\t/define_tag;\n\t\n\tdefine_tag: 'browserlanguage', -description='Autodetects and returns the most preferred language \\\n\t\t\tout of all available languages as specified by the browser\\'s accept-language q-value. ';\n\t\t\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tlocal: 'browserlanguage'=string;\n\n\t\tif: (var: '_knop_data') -> type != 'map';\n\t\t\t// page level caching\n\t\t\t$_knop_data = map;\n\t\t/if;\n\n\t\tif: $_knop_data >> 'browserlanguage';\n\t\t\t// use page cache\n\t\t\t#browserlanguage = $_knop_data -> find('browserlanguage');\n\n\t\telse;\n\t\t\tlocal: 'requestheader'=client_headers -> (split: '\\r\\n'),\n\t\t\t\t'acceptlanguage'=string,\n\t\t\t\t'browserlanguages'=array;\n\t\t\t\n\t\t\titerate: #requestheader, (local: 'headerfield'); \n\t\t\t\t// strip IIS header prefix\n\t\t\t\t#headerfield -> (removeleading: 'HTTP_');\n\t\t\t\t\n\t\t\t\tif: #headerfield -> (beginswith: 'Accept-Language:'); \n\t\t\t\t\t#acceptlanguage=#headerfield;\n\t\t\t\t\tloop_abort;\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t\t#acceptlanguage -> (removeleading: 'Accept-Language:');\n\t\t\t#acceptlanguage -> trim;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': Accept-Language: ' + #acceptlanguage);\n\t\t\t#acceptlanguage = #acceptlanguage -> (split: ',');\n\t\t\titerate: #acceptlanguage, local: 'language';\n\t\t\t\t#language = #language -> (split: ';');\n\t\t\t\tif: #language -> size == 1;\n\t\t\t\t\t// no q value specified, use default 1.0\n\t\t\t\t\t#language -> (insert: 'q=1.0');\n\t\t\t\t/if;\n\t\t\t\t(#language -> first) -> trim; \n\t\t\t\tif: #language -> size >= 2 && #language -> first -> size;\n\t\t\t\t\t(#language -> second) = (#language -> second) -> (split: '=') -> last;\n\t\t\t\t\t(#language -> second) -> trim; \n\t\t\t\t\t#browserlanguages -> (insert: (decimal: (#language -> second)) = (#language -> first) );\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t\t#browserlanguages -> (sort: -ascending=false);\n\t\n\t\t\t// find the most preferred language\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': looking for matching languages ');\n\t\t\titerate: #browserlanguages, local: 'language';\n\t\t\t\tif: (self -> validlanguage: (#language -> second));\n\t\t\t\t\t/// found a valid language\n\t\t\t\t\t#browserlanguage=#language -> second;\n\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': found valid language ' + #browserlanguage);\n\t\t\t\t\tloop_abort;\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t\tif: #browserlanguage -> size == 0;\n\t\t\t\t// no matching language found, try again without locale\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': no valid language found, looking again without locale ' + #language);\n\t\t\t\titerate: #browserlanguages, local: 'language';\n\t\t\t\t\t(#language -> second) = (#language -> second) -> (split: '-') -> first;\n\t\t\t\t\tif: (self -> validlanguage: (#language -> second));\n\t\t\t\t\t\t/// found a valid language\n\t\t\t\t\t\t#browserlanguage=#language -> second;\n\t\t\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': found valid language ' + #browserlanguage);\n\t\t\t\t\t\tloop_abort;\n\t\t\t\t\t/if;\n\t\t\t\t/iterate;\n\t\t\t/if;\n\t\t\t$_knop_data -> insert('browserlanguage'=#browserlanguage);\n\t\t/if;\n\t\t\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: #browserlanguage;\n\n\t/define_tag;\n\t\n\tdefine_tag: 'languages', -description='Returns an array of all available languages in the string object \\\n\t\t\t(out of the languages in the -language array if specified). \\n\\\n\t\t\tParameters: \\n\\\n\t\t\t-language (optional) string or array of strings.',\n\t\t-optional='language', -copy;\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tlocal: 'languages'=(self -> 'strings') -> keys;\n\t\tif: (local_defined: 'language');\n\t\t\tif: !(#language -> (isa: 'array'));\n\t\t\t\t#language = array: #language;\n\t\t\t/if;\n\t\t\t#languages -> sort;\n\t\t\t#language -> sort;\n\t\t\t// get the languages that exist in both arrays\n\t\t\t#languages = #languages -> (intersection: #language);\n\t\t/if;\n\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: #languages;\n\t/define_tag;\n\t\n\tdefine_tag: 'keys', -description='Returns array of all text keys in the string object. ';\n\t\tif: !((self -> 'keys') -> (isa: 'array'));\n\t\t\tlocal: 'keysarray'=array, 'keysmap'=map, 'keysarray_new'=array;\n\t\t\t// no cached result yet - create list of all keys\n\t\t\titerate: (self -> 'strings'), local: 'strings_language';\n\t\t\t\t#keysarray_new = #strings_language -> value -> keys;\n\t\t\t\t#keysarray_new -> sort;\n\t\t\t\t#keysarray -> sort;\n\t\t\t\t// add the keys that are not already in #keysarray by using union\n\t\t\t\t#keysarray = #keysarray -> (union: #keysarray_new);\n\t\t\t/iterate;\n\t\t\t(self -> 'keys') = #keysarray;\n\t\t/if;\n\t\treturn: (self -> 'keys');\n\t/define_tag;\n\t\n\n/define_type;\n\n?>\n[\n//------------------------------------------------------------------\n// End knop_lang\n//------------------------------------------------------------------\n\n//##################################################################\n\n][\n//------------------------------------------------------------------\n// Begin knop_nav\n//------------------------------------------------------------------\n\n] url tag.\n2010-11-17\tJC\tFixed a bug that would not convert local params to an array under certain situations\n2009-09-18\tJS\tSyntax adjustments for Lasso 9\n2009-09-04\tJS\t->linkparams: Multiple paramaters with the same name (typically checkboxes) are now passed properly\n2009-05-06\tJS\t->directorytree considers _include folders as part of the Knop directory structure. nav->include('_include/myfile.inc') will first look for _include/myfile.inc and if not found it will look for _knop/_include/myfile.inc \n2009-05-05\tJS\t->include looks for a specified file also inside a _knop folder, if the file does not exist at the specified location\n2009-02-09\tJS\t->filename: Casting path and actionpath to string\n2008-12-19\tJS\t->filename (and consequently ->include and ->library) can now use a specific -path instead of the current location's path\n2008-12-09\tJS\t->linkparams: fixed undefined local in trace call (only showed when trace was enabled for the nav object)\n2008-11-25\tJS\t->getlocation will now avoid disabled and hidden pages when looking for the first page if no default page is specified\n2008-11-03\tJS\t->getlocation will not break if no navigation items have been defined\n2008-10-30\tJS\t_mod folders will now work with knop paths with just a single level, so an include file path can end up as _mod_customer/lib_customer.inc or just _mod_customer/lib.inc (the latter variant does not apply to extension-based filenaming, so _mod_customer/.lib will never be a working file path)\n2008-07-10\tJS\tAdded -> label to return the name of the current page\n2008-05-20\tJS\t->renderhtml: #current# is not automatically added to the template if the more elaborate template format is used. This makes it easier to hide the currentmarker without changing the nav config (partial revert of fix 2008-01-04). \n2008-05-08\tJS\t->insert: A duplicate key does no longer cause a fatal error but instead fails silently and logs to the debug log\n2008-05-07\tJS\t->url: will now call ->linkparams so all links that are constructed from ->url will properly send along the parameters specified in the nav item. This also affects pagination and sort links in grid. \n2008-05-07\tJS\tAdded ->linkparams, Returns an array for all parameters that should be sent along with nav links (this was previously embedded in renderhtml)\n2008-02-25\tJS\t->url: new parameter -getargs to add the getargs to the path link if the path equals the current path\n2008-02-06\tJC\t->insert: the -hide flag can now be a boolean (also the -disabled flag)\n2008-02-03\tJS\t->include: can now include any specified filename\n2008-02-01\tJS\t->oncreate: added optional -fileroot to be able to use a root for files that is different from the logical site root used for navigation \n2008-01-23\tJS\t->url: Added -autoparams that is required to enable the automatic passing of action_params that begin with \"-\" (this reverts the default behavior to match the the old)\n2008-01-22\tJS\t->url: GET params that begin with \"-\" are sent as parameters on links. -path, -sort, -desc, -q are explicitly excluded from nav links in renderhtml. \n2008-01-22\tJS\tWhen using param based navigation, navigation links now use much cleaner /?path/to/page/ style links instead of /?-path=path/to/page/\n2008-01-22\tJS\t->getlocation: when navmethod is param, the path can now be sent as unnamed parameter insetad of -path parameter (such as /?path/to/page/). \n2008-01-04\tJS\t->renderbreadcrumb: added flag -plain to output breadcrumb without html\n2008-01-04\tJS\t->renderbreadcrumb: added flag -skipcurrent to not include the current location in the output\n2008-01-04\tJS\t->insert: -template can now be specified also for individual nav items. Use the form #link##label##current##/link##children#. \n2008-01-04\tJS\t->renderhtml: changed #title# to #label# in template for clarity, for example #link##label##current##/link##children# (#title# will remain supported)\n2008-01-04\tJS\tAdded #current# as placeholder for template, to specify where the current marker should occurr. If not specified in the template, the current marker appears immediately after the label.\n2007-12-12\tJS\t->include now logs processing time for the include to debug trace\n2007-12-11\tJS\tAdded documentation as -description to most member tags, to be used by the new ->help tag\n2007-12-11\tJS\tMoved ->help to knop_base\n2007-12-04\tJS\tnav item css class is now applied also to disabled nav items (rendered as )\n2007-11-08\tJS\tChanged trace so it tracks some things even when it's not enabled (like include etc)\n2007-11-05\tJS\tAdded var name to trace output\n2007-10-28\tJS\t->directorytree: should now work also when knop folders are symlinks\n2007-09-06\tJS\ttop level nav elements that are -disabled now behave properly when accessed\n2007-09-05\tJS\t-currentmarker can now be set separately on sublevels, not only on topmost level\n2007-08-29\tJS\tAdded _knop as optional base folder to put all knop files in\n2007-08-29\tJS\t->include: Removed file_exists check since the filename has already been verified in ->filename.\n2007-08-29\tJS\tAdded ->directorytree which returns a map with all knop filenames, to use when searching for includes\n2007-08-28\tJS\t->oncreate: -filenaming to specify how include files are named prefix/suffix/extension\n2007-08-28\tJS\t->filename: Implemented support for flexible folder structures\n2007-08-28\tJS\tInstance variable #actionconfigfile_didrun was not properly declared\n2007-06-18\tJS\tAdded tag timer to most member tags\n2007-06-14\tJS\t->insert: -url='/' can now be used to specify the \"home\" location. \n2007-06-13\tJS\tadded ->children to get a reference to the children nav object for a specified path, so new children can be inserted. Must call ->reindex afterwards. \n2007-06-13\tJS\tadded ->reindex to rebuild the index maps from scratch. Must be done after adding children items. \n2007-06-13\tJS\tadded ->addchildren to replace a current children nav object for a specified path. Will handle the reindexing transparently. \n2007-06-13\tJS\tadded ->keymap, ->pathmap and ->urlmap to access the index maps so they call reindex if they have been invalidated (for example by ->addchildren)\n2007-06-13\tJS\tadded inheritance from knop_base\n2007-06-11\tJC\tadded handling of xhtml output\n2007-06-08\tJS\t->insert: params with empty values are now ignored\n2007-05-04\tJS\t->insert: added check that default item exists in children before storing the default\n2007-04-19\tJS added ->data to retrieve data stored for the current path (or specified path). Optional -type ensures the returned data has the correct type. \n2007-04-19\tJS ->insert: added -data to store arbitrary data object for each path. The object is stored as reference so a variable can be changed after it has been added to the nav object\n2007-04-19\tJS\tadded ->patharray to return the current path as array\n2007-04-17\tJS\t->renderhtml: template now supports #link##title##/link##children# in addition to #item# to provide more flexibility\n2007-04-17\tJS\t->oncreate: added support for -template, -class, currentclass and -currentmarker\n2007-04-13\tJS\tImplemented -class per navitem (only worked globally with setformat before)\n2007-04-03\tJS\t->renderhtml: added -renderpath, -expand and -flat to be able to render parts of the nav menu for more flexible layout\n2007-04-03\tJS\t->renderbreadcrumb: added -home to show the default navigation item first in the breadcrumb \n2007-04-03\tJS\tChanged namespace from mt_ to knop_\n2007-03-01\tJS\tChanged navmethod path so it uses response_filepath instead of $url_path\n2007-02-25\tJS\tAdded ->actionpath\n2007-02-24\tJS\t->renderhtml: improved handling of classes in nav links\n2007-02-22\tJS\t->url: added -except\n2007-02-09\tJS\t->url: corrected the behavior for plain parameters passed to the tag\n2007-02-05\tJS\t->insert: Added -param to be able to specify params that should be propagated in nav for certain nav elements (like -keyvalue to be able to move between different subtabs for a selected record\n2007-02-05\tJS\t->renderhtml now use ->url to get the right links\n2007-02-01\tJS\tMade usage of trace optional to improve performance\n2007-02-01\tJS\tImprovements to debug_trace to log also recursive events\n2007-02-01\tJS\tAdded ->haschildren, which is now used by ->renderhtml to properly show or hide child level\n2007-01-31\tJS\t->renderhtml Added renderhtml_levels to keep track of how many levels deep navigation has been rendered, to be able to add proper spacing between navigation and content\n2007-01-31\tJS \t->url: -urlargs Improved handling of urlargs and ?/& delimiters, should work better with navmethod path\n2007-01-30\tJS\tRemoved automatic link title attribute since it can be confusing to show children page titles there\n2007-01-30\tJS\tCorrected parameter path to -path (bug)\n2007-01-23\tJS\t->include: 'config' checks if the same config has already run as actionconfig and won't run again in that case\n2007-01-23\tJS\t->include checks if the file exists first, so no need for empty placeholder files\n2007-01-23\tJS\tAdded ->include and ->library\n2007-01-23\tJS\tAdded ->setlocation\n2007-01-17\tJS\tAdded insert: -hide to allow a location without showing it in navigation\n\nTODO\nAdd support for compound expressions for template. The expression could return a map that would override corresponding param values. \n->insert: Add -raw to be able to inject code into the link tag, similar to form->addfield(-raw). \nExclude file name for example index.lasso from getargs\nOptimize nav->url! Very slow with complex nav object. \nNeeds to exclude also -keyfield and -lockfield. Maybe better to add an option to ->url to not auto-add any \"-\" params at all. \n-params are not sent along in breadcrumb links\nNeed simple way to exclude certain \"-\" params from ->url, also in config per nav item\nAdd support for adding nav structure from a database\nMove templates to a member tag to be make it easier to subclass\nMake it possible to use external URL for -url (make sure there is no / before http)\n\n*/\n\n\tlocal: 'navitems'=array,\t// array of maps\n\t\t'keymap'=map,\t\t\t// to speed up the locating of critical navigation elements (TBD)\n\t\t'pathmap'=map,\t\t\t// contains full key paths also for children navitems\n\t\t'urlmap'=map,\t\t\t// to translate a url to key path, contains url also for children navitems\n\t\t'default'=string,\t\t// default path, i.e. home page\n\t\t'parentkey'=null,\t\t// the key of the parent to this navitem (null for top item)\n\t\t'template'=string,\n\t\t'class'=string,\n\t\t'currentclass'=string,\n\t\t'currentmarker'=null,\n\n\t\t'actionpath'=string,\t\t// captured from -action parameter in submission\n\t\t'path'=string,\t\t\t// captured from path param or urlhandler and translated from url\n\t\t'patharray'=array,\t\t// path broken down into elements\n\t\t'pathargs'=string,\t\t// extra path parts that can contain record identification etc\n\t\t'urlparams'array,\t\t// holds everything needed to generate nav links\n\t\t'navmethod'=string,\t\t// path or param depending on how the nav is propagated. To be able to force path, since url handler doesn't kick in for the start page\n\t\t'filenaming'=string,\n\t\t'directorytreemap'=map,\t// contains a list of all existing filenames in the knop directory tree\n\t\t'root'='/',\t\t\t\t// site root\n\t\t'fileroot'='/',\t\t\t// root for physical files\n\t\t'renderhtml_levels'=0,\t// number of levels rendered by renderhtml\n\t\t// 'tagtime'=integer, \t\t\t// moved to knop_base\n\t\t// 'tagtime_tagname'=string, \t// moved to knop_base\n\t\t'debug_trace'=array,\n\t\t'dotrace'=false,\n\t\t'actionconfigfile_didrun'=string,\t// path to action config file that has been run for the current page load\n\t\t\t\t\t\t\t\t\t\t\t// used to not load the same config again\n\t\t'error_lang'=(knop_lang: -default='en', -fallback);\n\n\tdefine_tag: 'oncreate', -description='Parameters:\\n\\\n\t\t\t-default (optional) Key of default navigation item\\n\\\n\t\t\t-root (optional) The root path for the site section that this nav object is used for\\n\\\n\t\t\t-fileroot (optional) The root for include files, to be able to use a different root for physical files than the logical root of the site. Defaults to the value of -root. \\n\\\n\t\t\t-navmethod (optional) path or param. Path for \"URL designed\" URLs, otherwise a -path parameter will be used for the navigation. \\n\\\n\t\t\t-filenaming (optional) prefix (default), suffix or extension, specifies how include files are named\\n\\\n\t\t\t-trace (optional flag) If specified debug_trace will be used. Defaults to disabled for performance reasons. \\n\\\n\t\t\t-template (optional) html template used to render the navigation menu\\n\\\n\t\t\t-class (optional) default class for all navigation links\\n\\\n\t\t\t-currentclass (optional) class added for the currently active link\\n\\\n\t\t\t-currentmarker (optional) character(s) show to the right link of current nav (typically »)',\n\t\t-optional='template',\n\t\t-optional='class',\n\t\t-optional='currentclass',\n\t\t-optional='currentmarker',\n\t\t-optional='default',\n\t\t-optional='root',\n\t\t-optional='fileroot',\n\t\t-optional='navmethod',\n\t\t-optional='filenaming',\n\t\t-optional='trace';\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace');\n\t\t// TODO: check if we are in an inline, in that case use -key, -label etc as field names and loop through records to fill nav\t\t\n\t\t\n\t\tlocal_defined('default') ? (self -> 'default') = #default;\n\t\tlocal_defined('root') ? (self -> 'root') = #root;\n\t\tlocal_defined('navmethod') ? (self -> 'navmethod') = #navmethod; \n\t\tlocal_defined('template') ? (self -> 'template') = #template;\n\t\tlocal_defined('class') ? (self -> 'class') = #class;\n\t\tlocal_defined('currentclass') ? (self -> 'currentclass') = #currentclass;\n\t\tlocal_defined('currentmarker') ? (self -> 'currentmarker') = #currentmarker;\n\t\tlocal_defined('filenaming') ? (self -> 'filenaming') = #filenaming;\n\n\t\t(self -> 'dotrace') = (local_defined: 'trace') && #trace != false;\n\t\t// normalize slashes\n\t\t(self -> 'root') -> removeleading('/') & removetrailing('/');\n\t\t(self -> 'root') = '/' + (self -> 'root') + '/';\n\t\t(self -> 'root') -> replace('//', '/');\n\n\t\tif: (local_defined: 'fileroot');\n\t\t\t(self -> 'fileroot') = #fileroot;\n\t\t\t// normalize slashes\n\t\t\t(self -> 'fileroot') -> removeleading('/') & removetrailing('/');\n\t\t\t(self -> 'fileroot') = '/' + (self -> 'fileroot') + '/';\n\t\t\t(self -> 'fileroot') -> replace('//', '/');\n\t\telse;\n\t\t\t(self -> 'fileroot') = (self -> 'root');\n\t\t/if;\n\t\t\n\t\t// validate and set default value\n\t\t(map: 'prefix', 'suffix', 'extension') !>> (self -> 'filenaming') ? (self -> 'filenaming') = 'prefix'; \n\t\t\n\t\t// can not perform getlocation here since the nav structure must be defined first\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\tdefine_tag: 'onconvert', -description='Outputs the navigation object in a very basic form, just to see what it contains';\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\tlocal: 'output' = (self -> 'parentkey') + ': ';\n\t\titerate: (self -> 'navitems'), (local: 'navitem');\n\t\t\t#output += #navitem + '\\n';\n\t\t/iterate;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @#output;\n\t/define_tag;\n\n\tdefine_tag: 'insert', -description='Adds a navigation item to nav structure\\n\\\n\t\t\tParameters:\\n\\ \n\t\t\t-key (required) The key will be part of the path\\n\\ \n\t\t\t-label (optional) The menu text\\n\\ \n\t\t\t-url (optional) Nav url to use instead of the default url that is derived from the keys path, used as shortcuts for cleaner URLs\\n\\ \n\t\t\t-title (optional) Link href title text\\n\\ \n\t\t\t-template (optional) Template to use only for this specific nav item, in the form #link##label##current##/link##children#\\n\\\n\t\t\t-children (optional nav) Sub navitems\\n\\ \n\t\t\t-default (optional) Key of default child subnav item\\n\\ \n\t\t\t-param (optional) Name of param or params (string/array) that should be sent along with nav links\\n\\ \n\t\t\t-class (optional) CSS class name to use for this nav item (defaults to none)\\n\\ \n\t\t\t-filename (optional) Name stem for lib, action and content files (defaults to key path with _ instead of /), to be able to use the same processing files for multiple locations\\n\\ \n\t\t\t-disabled (optional flag) Makes the menu item dimmed and non-clickable\\n\\ \n\t\t\t-hide (optional flag) Makes the location valid without showing a menu item for it\\n\\ \n\t\t\t-after (optional) After which navitem to insert this navitem (key or numeric index)\\n\\ \n\t\t\t-data (optional) Arbitrary data object (variable, map, array, compound expression) that can be returned for the location by calling ->data',\n\t\t-required='key',\n\t\t-optional='label',\n\t\t-optional='default',\n\t\t-optional='url', -copy,\n\t\t-optional='title',\n\t\t-optional='template',\n\t\t-optional='children', -type='nav',\n\t\t-optional='param',\n\t\t-optional='class',\n\t\t-optional='filename',\n\t\t-optional='disabled',\n\t\t-optional='hide',\n\t\t-optional='after',\n\t\t-optional='data';\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\t\n\t\tfail_if: !(local_defined: 'hide') && (local: 'label') == '', -1, 'Insert requires a label';\n\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': -key = ' + #key);\n\t\t// fail_if: (self -> keymap) >> #key, -1, #key + ' is not unique';\n\t\tif: (self -> keymap) >> #key;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': *** Error key ' + #key + ' is not unique - skipping');\n\t\t\treturn;\n\t\t/if;\n\t\tlocal: 'urlmapchildren'=map,\n\t\t\t'pathmapchildren'=map;\n\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': #key=' + #key);\n\t\tif: (local_defined: 'children');\n\t\t\t(#children -> 'parentkey') = #key;\n\t\t\t// grab urlmap and pathmap from children\n\t\t\t#urlmapchildren = (#children -> urlmap);\n\t\t\t#pathmapchildren = (#children -> pathmap);\n\t\t\tif: !(local_defined: 'title');\n\t\t\t\t// set default title to labels of children\n\t\t\t\t/*\n\t\t\t\tlocal: 'title' = array;\n\t\t\t\titerate: (#children -> 'navitems'), (local: 'item');\n\t\t\t\t\t#title -> (insert: (#item -> (find: 'label')));\n\t\t\t\t/iterate;\n\t\t\t\t#title = #title -> (join: ', ');\n\t\t\t\t*/\n\t\t\t/if;\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': adding children');\n\t\t\t(self -> 'debug_trace') -> (merge: (#children -> 'debug_trace'));\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': done adding children');\n\t\t/if;\n\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': #key=' + #key);\n\t\tlocal: 'navitem'=map;\n\t\tlocal_defined('key') && #key != '' ? #navitem -> insert('key' = #key); \n\t\tlocal_defined('label') && #label != '' ? #navitem -> insert('label' = #label); \n\t\tlocal_defined('default') && #default != '' ? #navitem -> insert('default' = #default); \n\t\tlocal_defined('url') && #url != '' ? #navitem -> insert('url' = #url); \n\t\tlocal_defined('title') && #title != '' ? #navitem -> insert('title' = #title); \n\t\tlocal_defined('template') && #template != '' ? #navitem -> insert('template' = #template); \n\t\tlocal_defined('children') && #children != '' ? #navitem -> insert('children' = #children); \n\t\tlocal_defined('class') && #class != '' ? #navitem -> insert('class' = #class); \n\t\tlocal_defined('filename') && #filename != '' ? #navitem -> insert('filename' = #filename);\n\n\t\tif(local_defined('default') && #default != '' && #pathmapchildren >> #default);\n\t\t\t// only add default that exists in children\n\t\t\t#navitem -> insert('default' = #default);\n\t\t/if;\n\t\t// store these params by reference\n\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': #key=' + #key);\n\t\tlocal_defined('data') && #data != '' ? #navitem -> insert('data' = @#data);\n\n\t\tif: (local_defined: 'param') && #param -> type =='array';\n\t\t\t#navitem -> (insert: 'params'=#param);\n\t\telse: (local_defined: 'param') && #param != '';\n\t\t\t#navitem -> (insert: 'params'=(array: #param));\n\t\t/if;\n\t\t#navitem -> (insert: 'disabled'=(local_defined: 'disabled') && #disabled != false);\n\t\t#navitem -> (insert: 'hide'=(local_defined: 'hide') && #hide != false);\n\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': #key=' + #key);\n\t\tlocal: 'index'=(self -> 'navitems') -> size + 1;\n\t\tif: (local_defined: 'after') && (string: #after) -> size;\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': -after=' + #after);\n\t\t\tif: #after -> type == 'integer';\n\t\t\t\t#index = #after;\n\t\t\telse: (self -> keymap) >> #after;\n\t\t\t\t#index = (self -> keymap) -> (find: #after) + 1;\n\t\t\t/if;\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': index=' + #index);\n\t\t/if;\n\t\tif: #urlmapchildren -> size;\n\t\t\t// we have urlmap from children - insert it into our urlmap with modified keyvalues\n\t\t\titerate: #urlmapchildren, (local: 'urlitem');\n\t\t\t\tfail_if: (self -> urlmap) >> #urlitem -> name, -1, 'url ' + (#urlitem -> name) + ' is not unique';\n\t\t\t\t(self -> 'urlmap') -> (insert: #urlitem -> name = #key + '/' + (#urlitem -> value));\n\t\t\t/iterate;\n\t\t/if;\n\t\tif: #pathmapchildren -> size;\n\t\t\t// we have pathmap from children - insert it into our pathmap with modified keys\n\t\t\titerate: #pathmapchildren, (local: 'pathitem');\n\t\t\t\t(self -> 'pathmap') -> (insert: #key + '/' + #pathitem -> name);\n\t\t\t/iterate;\n\t\t/if;\n\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': #key=' + #key);\n\t\tif: (local_defined: 'url') && #url != '';\n\t\t\t#url -> (removeleading: '/') & (removetrailing: '/');\n\t\t\tfail_if: (self -> urlmap) >> #url, -1, 'url ' + #url + ' is not unique';\n\t\t\t(self -> 'urlmap') -> (insert: #url = #key);\n\t\t/if;\n\t\t(self -> 'pathmap') -> (insert: #key);\n\t\t(self -> 'navitems') -> (insert: #navitem, #index);\n\t\t// update keymap\n\t\t(self -> 'keymap') = map;\n\t\titerate: (self -> 'navitems'), (local: 'item');\n\t\t\t(self -> 'keymap') -> (insert: (#item -> (find: 'key')) = loop_count);\n\t\t/iterate;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\t\n\t/define_tag;\n\t\n\t\n\t/*\n\tdefine_tag: 'remove',\t-description='Remove nav object and its children for specified key path. Must update index maps afterwards. ',\n\t\t-required='path', -type='string', -copy;\n\t\tfail: -1, 'Not implemented'; // This tag is not yet functional\n\t\t\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\t#path -> removeleading('/') & removetrailing('/');\n\t\tlocal: 'path_remove'=#path -> split('/') -> last;\n\t\t#path -> removetrailing(#path_remove) & removetrailing('/');\n\t\t// we need to find a reference to the navitems array of maps that contains the nav item to remove\n\t\tif: #path -> size;\n\t\t\tlocal: 'navitem'=@(self -> getnav(#path));\n\t\telse;\n\t\t\tlocal: 'navitem'=@self -> getnav;\n\t\t/if;\n\t\t// we also need to find a reference to the keymap where we can find the index of the array item to remove\n\t\treturn: #navitem;\n\t\t(#navitem -> getnav) -> remove(#navitem -> keymap -> find(#path_remove));\n\t\t\n\t\t// invalidate index maps\n\t\t(#navitem -> 'keymap') = null;\n\t\t(#navitem -> 'pathmap') = null;\n\t\t(#navitem -> 'urlmap') = null;\n\n\t\t(self -> 'keymap') = null;\n\t\t(self -> 'pathmap') = null;\n\t\t(self -> 'urlmap') = null;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t*/\n\t\n\tdefine_tag: 'addchildren',\t-description='Add nav object as children to specified key path, replacing the current children if any. \\\n\t\tMust update index maps afterwards. ',\n\t\t-required='path',\n\t\t-required='children', -type='nav';\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\tlocal: 'navitem'=@(self -> (getnav: #path));\n\t\t#navitem -> (insert: 'children' = #children);\n\n\t\t// invalidate index maps\n\t\t(#navitem -> 'keymap') = null;\n\t\t(#navitem -> 'pathmap') = null;\n\t\t(#navitem -> 'urlmap') = null;\n\n\t\t(self -> 'keymap') = null;\n\t\t(self -> 'pathmap') = null;\n\t\t(self -> 'urlmap') = null;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\tdefine_tag: 'children', -description='Return reference to the children of the current navigation object map, or for the specified path',\n\t\t-optional='path', -copy; \n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\t!(local_defined: 'path') ? local: 'path'=(self -> 'patharray');\n\t\tif: #path -> type != 'array';\n\t\t\t#path = string: #path;\n\t\t\t#path -> (removeleading: '/') & (removetrailing: '/');\n\t\t\t#path = #path -> (split: '/');\n\t\t/if;\n\t\t(self -> pathmap) !>> (#path -> (join: '/')) ? return: knop_nav;\n\n\t\tlocal: 'nav'=@(self -> (getnav: #path));\n\t\tif: #nav !>> 'children';\n\t\t\t#nav -> (insert: 'children'=knop_nav);\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @(#nav -> (find: 'children'));\n\t/define_tag;\n\t\n\tdefine_tag: 'reindex', -description='To recreate keymap, pathmap and urlmap';\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\t(self -> 'keymap') = map;\n\t\t(self -> 'pathmap') = map;\n\t\t(self -> 'urlmap') = map;\n\t\tlocal: 'key'=null, 'pathitem'=null, 'urlitem'=null, 'url'=string;\n\t\titerate: (self -> 'navitems'), (local: 'navitem');\n\t\t\t#key = #navitem -> (find: 'key');\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': key=' + #key);\n\t\t\t(self -> 'keymap') -> (insert: #key = loop_count);\n\t\t\t(self -> 'pathmap') -> (insert: #key);\n\t\t\tif: #navitem -> (find: 'url') != '';\n\t\t\t\t#url=#navitem -> (find: 'url');\n\t\t\t\t#url -> (removeleading: '/') & (removetrailing: '/');\n\t\t\t\tfail_if: (self -> urlmap) >> #url, -1, 'url ' + #url + ' is not unique';\n\t\t\t\t(self -> 'urlmap') -> (insert: #url = #key);\n\t\t\t/if;\n\t\t\tif: #navitem >> 'children';\n\t\t\t\t#navitem -> (find: 'children') -> reindex; // recursive\n\t\t\t\titerate: (#navitem -> (find: 'children') -> pathmap), #pathitem;\n\t\t\t\t\t(self -> 'pathmap') -> (insert: #key + '/' + #pathitem -> name);\n\t\t\t\t/iterate;\n\t\t\t\titerate: (#navitem -> (find: 'children') -> urlmap), #urlitem;\n\t\t\t\t\tfail_if: (self -> urlmap) >> #urlitem -> name, -1, 'url ' + (#urlitem -> name) + ' is not unique';\n\t\t\t\t\t(self -> 'urlmap') -> (insert: #urlitem -> name = #key + '/' + (#urlitem -> value));\n\t\t\t\t/iterate;\n\t\t\t/if;\n\t\t/iterate;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\tdefine_tag: 'keymap';\n\t\t(self -> 'keymap') -> type != 'map' ? self -> reindex;\n\t\treturn: (self -> 'keymap');\n\t/define_tag;\n\tdefine_tag: 'pathmap';\n\t\t(self -> 'pathmap') -> type != 'map' ? self -> reindex;\n\t\treturn: (self -> 'pathmap');\n\t/define_tag;\n\tdefine_tag: 'urlmap';\n\t\t(self -> 'urlmap') -> type != 'map' ? self -> reindex;\n\t\treturn: (self -> 'urlmap');\n\t/define_tag;\n\t\n\tdefine_tag: 'getlocation', -description='Grabs path and actionpath from params or urlhandler, translates from url to path if needed. This must be called before using the nav object. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-setpath (optional) forces a new path',\n\t\t-optional='setpath';\n\t\thandle;knop_debug('Done with ' + self->type + ' -> ' + tag_name, -time, -type=self->type);/handle;\n\t\tlocal: 'path'=string, \n\t\t\t'patharray'=array, \n\t\t\t'originalpath'=string, \n\t\t\t'pathargs'=string,\n\t\t\t'actionpath'=string,\n\t\t\t'validurl'=false;\n\t\t\t// TODO: Produce 404 error for invalid urls\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\t\t\n\t\t(self -> 'path') = string;\n\t\t(self -> 'patharray') = array;\n\t\t(self -> 'pathargs') = string;\n\t\t(self -> 'actionpath') = string;\n\t\t// get action path\n\t\tlocal: 'clientparams'=client_getparams;\n\t\t#clientparams -> (merge: client_postparams);\n\t\t#actionpath = (#clientparams >> '-action' ? (#clientparams -> (find: '-action') -> first -> value) | string);\n\t\t#actionpath -> (removeleading: '/') & (removetrailing: '/');\n\t\t// validate action path\n\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': testing action path ' + #actionpath);\n\t\tif: #actionpath -> size && (self -> pathmap) >> #actionpath;\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': found match for action path ' + #actionpath);\n\t\t\t(self -> 'actionpath') = #actionpath;\n\t\t/if;\n\n\t\t// get url or path\n\t\tif: (local: 'setpath') != '';\n\t\t\t#originalpath = string: #setpath;\n\t\telse: (self -> 'navmethod') != 'param'; \n\t\t\t(self -> 'navmethod') = 'path';\n\t\t\t#originalpath = response_filepath;\n\t\t\t#originalpath -> (removeleading: (self -> 'root'));\n\t\telse: (self -> 'navmethod') != 'path';\n\t\t\t(self -> 'navmethod') = 'param';\n\t\t\tif: #clientparams >> '-path';\n\t\t\t\t// path is sent as -path GET or POST parameter\n\t\t\t\t#originalpath = (#clientparams >> '-path' ? (#clientparams -> (find: '-path') -> first -> value) | string);\n\t\t\telse: client_getparams -> size && client_getparams -> first -> isa('string');\n\t\t\t\t// path is sent as first unnamed GET parameter \n\t\t\t\t#originalpath = client_getparams -> first;\n\t\t\t/if;\n\t\t/if;\n\t\t#originalpath -> (removeleading: '/') & (removetrailing: '/');\n\t\t#path = #originalpath;\n\t\t#patharray = (string: #originalpath) -> (split: '/');\n\t\t// look for longest match in urlmap\n\t\tlocal: 'pathfinder'=#patharray;\n\t\tloop: #pathfinder -> size;\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': looking at url ' + #pathfinder -> (join: '/'));\n\t\t\tif: (self -> urlmap) >> #pathfinder -> (join: '/');\n\t\t\t\t// use translated key path\n\t\t\t\t#path=(self -> urlmap) -> (find: #pathfinder -> (join: '/'));\n\t\t\t\t#validurl=true;\n\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': found url match for ' (#pathfinder -> (join: '/')) + ' translating to ' + #path);\n\t\t\t\tloop_abort;\n\t\t\telse;\n\t\t\t\t// remove last path part and try again\n\t\t\t\t#pathfinder -> remove;\n\t\t\t/if;\n\t\t/loop;\n\t\tif: !#validurl;\n\t\t\t// no url found, dig into the nav structure to see if path is valid\n\t\t\tlocal: 'pathfinder'=#patharray;\n\t\t\tloop: #pathfinder -> size;\n\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': looking at path ' + #pathfinder -> (join: '/'));\n\t\t\t\tif: (self -> pathmap) >> #pathfinder -> (join: '/');\n\t\t\t\t\t// use key path\n\t\t\t\t\t#path=#pathfinder -> (join: '/');\n\t\t\t\t\t#validurl=true;\n\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': found path match for ' (#pathfinder -> (join: '/')));\n\t\t\t\t\tloop_abort;\n\t\t\t\telse;\n\t\t\t\t\t// remove last path part and try again\n\t\t\t\t\t#pathfinder -> remove;\n\t\t\t\t/if;\n\t\t\t/loop;\n\t\t/if;\n\t\t// look for disabled path\n\t\tif: #validurl;\n\t\t\t#path = (string: #path) -> (split: '/');\n\t\t\twhile: #path -> size > 1 && (self -> (getnav: #path)) -> (find: 'disabled');\n\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': path '+ #path + ' is disabled');\n\t\t\t\t#path -> remove;\n\t\t\t/while;\n\t\t\tif: (self -> (getnav: #path)) -> (find: 'disabled');\n\t\t\t\t#validurl = false;\n\t\t\t/if;\n\t\t\t#path = #path -> (join: '/');\n\t\t/if;\n\t\t\n\t\tif: !#validurl;\n\t\t\t// we haven't found a valid location, we must resort to a default page\n\t\t\tif: self -> 'default' != '' && self -> pathmap >> self -> 'default';\n\t\t\t\t#path = self -> 'default';\n\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': use defalt location ' #path);\n\t\t\telse;\n\t\t\t\t// use first page as default, if it exists\n\t\t\t\titerate(self -> 'navitems', local('navitem'));\n\t\t\t\t\tif(#navitem >> 'key' \n\t\t\t\t\t\t&& !(#navitem -> find('disabled')) \n\t\t\t\t\t\t&& !(#navitem -> find('hide')));\n\t\t\t\t\t\t#path = #navitem -> find('key');\n\t\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': use first page as default location ' #path);\n\t\t\t\t\t\tloop_abort;\n\t\t\t\t\t/if;\n\t\t\t\t/iterate;\n\t\t\t/if;\n\t\t\tif: (self -> pathmap) >> #path;\n\t\t\t\t#validurl = true;\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': no navigation seems to be defined ' #path);\n\t\t\t/if;\n\t\t/if;\n\t\t\n\t\tif: #validurl;\n\t\t\t// recursively look for default sub page\n\t\t\tlocal: 'hasdefault'=true;\n\t\t\twhile: #hasdefault;\n\t\t\t\tlocal: 'defaultkey' = (self -> (getnav: #path)) -> (find: 'default');\n\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': looking for default key ' + #defaultkey);\n\t\t\t\tif: !(((self -> (getnav: #path))) -> (find: 'disabled')) \n\t\t\t\t\t&& !(((self -> (getnav: #path + '/' + #defaultkey))) -> (find: 'disabled'))\n\t\t\t\t\t&& #defaultkey != '' && (self -> (getnav: #path)) -> (find: 'children') -> keymap >> #defaultkey;\n\t\t\t\t\t#path += '/' + #defaultkey;\n\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': new path is ' + #path);\n\t\t\t\telse;\n\t\t\t\t\t#hasdefault=false;\n\t\t\t\t/if;\n\t\t\t/while;\n\t\t\t\n\t\t\t// look for path arguments = the leftover when we found a matching path\n\t\t\t#pathargs = #originalpath;\n\t\t\t#pathargs -> (removeleading: #pathfinder -> (join: '/')) & (removeleading: '/');\n\t\t\t\n\t\t\t// store values\n\t\t\t(self -> 'path') = #path;\n\t\t\t(self -> 'patharray') = (string: #path) -> (split: '/');\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': path is ' + #path);\n\t\t\tif: #pathargs != '';\n\t\t\t\t(self -> 'pathargs') = #pathargs;\n\t\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': pathargs is ' + #pathargs);\n\t\t\t/if;\n\t\telse;\n\t\t\t(self -> 'debug_trace') -> (insert: tag_name + ': no matching path found');\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\tdefine_tag: 'setlocation', -description='Sets the current location to a specific nav path or url',\n\t\t-required='path';\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\tself -> (getlocation: -setpath=#path);\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\t\n\tdefine_tag: 'setformat', -description='Sets html template for the nav object, use #items# #item# #/items# or more elaborate #items# #link##label##current##/link##children# #/items# as placeholders.\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-template (optional string) Html template, defaults to
    #items#
  • #item#
    • #/items#
\\n\\\n\t\t\t-class (optional string) Css class name that will be used for every navigation link\\n\\\n\t\t\t-currentclass (optional string) Css class name that will be added to the currently active navigation link (defaults to crnt)\\n\\\n\t\t\t-currentmarker (optional string) String that will be appended to menu text of currently active navigation link',\n\t\t-optional='template', -type='string',\n\t\t-optional='class', -type='string',\n\t\t-optional='currentclass', -type='string',\n\t\t-optional='currentmarker', -type='string';\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\t\n\t\t(local_defined: 'template') ? (self -> 'template') = #template;\n\t\t(local_defined: 'class') ? (self -> 'class') = #class;\n\t\t(local_defined: 'currentclass') ? (self -> 'currentclass') = #currentclass;\n\t\t(local_defined: 'currentmarker') ? (self -> 'currentmarker') = #currentmarker;\n\t\t\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'haschildren',\t-description='Returns true if nav object has children that are not all -hide.',\n\t\t-required='navitem', -type='map';\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\tlocal: 'haschildren'=#navitem >> 'children';\n\t\tif: #haschildren;\t// verify that there is at least one child that does not have -hide\n\t\t\t#haschildren=false; // assume there is no child to show\n\t\t\titerate: #navitem -> (find: 'children') -> 'navitems', (local: 'childitem');\n\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': checking ' + (#childitem -> (find: 'key')) + ', hide=' + (#childitem -> (find: 'hide')));\n\t\t\t\tif: !(#childitem -> (find: 'hide')); // found one\n\t\t\t\t\t#haschildren=true;\n\t\t\t\t\tloop_abort;\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t/if;\n\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': ' + #haschildren);\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: #haschildren;\n\t/define_tag;\n\n\tdefine_tag: 'renderhtml', -description='Called recursively to render hierarchial nav structure.\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-renderpath (optional) Only render the children of the specified path (and below)\\n\\\n\t\t\t-flat (optional flag) Only render one level\\n\\\n\t\t\t-expand (optional flag) Render the entire expanded nav tree and not just the currently active branch\\n\\\n\t\t\t-basepath (optional) Internal, needed for recursive calls to get proper paths\\n\\\n\t\t\t-ancestor (optional nav) Internal, reference to the topmost object, needed for recursive calls\\n\\\n\t\t\t-xhtml (optional) XHTML valid output',\n\t\t-optional='renderpath', -copy,\n\t\t-optional='flat',\n\t\t-optional='expand',\n\t\t-optional='basepath', -copy,\n\t\t-optional='ancestor', -type='nav';\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\tif: !(local_defined: 'ancestor');\n\t\t\thandle;knop_debug('Done with ' + self->type + ' -> ' + tag_name, -time, -type=self->type);/handle;\n\t\t\t// reset timer when called at top level\n\t\t\t// (self -> 'timer')=0; // undefined instance variable\n\t\t/if;\n\t\t\n\t\t// create reference to the topmost level nav object\n\t\tlocal: 'topself'=(local_defined: 'ancestor') ? @#ancestor | @self ;\n\t\t!(local_defined: 'ancestor') ? (#topself -> 'renderhtml_levels') = 1 | (#topself -> 'renderhtml_levels') += 1;\n\t\t\n\t\tlocal: '_flat' = (local_defined: 'flat') && #flat != false;\n\t\tlocal: '_expand' = (local_defined: 'expand') && #expand != false;\n\t\t\n\t\tlocal: 'template'=(self -> 'template' != '' ? self -> 'template' | #topself -> 'template');\n\t\tlocal: 'clientparams'=client_getparams;\n\t\t#clientparams -> (merge: client_postparams);\n\t\t\n\t\t!(local_defined: 'basepath') ? local: 'basepath'=string;\n\t\tif: #template == '';\n\t\t\t#template = '
    #items#
  • #item#
    • #/items#
';\n\t\t/if;\n\t\tlocal: 'output'=string,\n\t\t\t'itemoutput'=string,\n\t\t\t'itemchildren'=string,\n\t\t\t'itemrow'=string,\n\t\t\t'link'=string,\n\t\t\t'linkparams'=array,\n\t\t\t'thispath'=string,\n\t\t\t'classarray'=array,\n\t\t\t'currentmarker'=string,\n\t\t\t'itemtemplate'=(string_findregexp: #template, -find='(?si)#items#(.*?)#/items#'),\n\t\t\t'itemlinkstart'=string,\n\t\t\t'itemlinkend'=string,\n\t\t\t'itemlabel'=string;\n\t\t#itemtemplate = (#itemtemplate -> size >= 2 ? #itemtemplate -> (get: 2) | string);\n\t\t\n\t\tif: (local_defined: 'renderpath') && #renderpath != '' && #renderpath != '/';\n\t\t\t// render nav for specified path\n\t\t\t#renderpath -> (removeleading: '/') & (removetrailing: '/');\n\t\t\tif: #topself -> (getnav: #renderpath) -> (find: 'children') -> type == 'nav';\n\t\t\t\treturn: @(#topself -> (getnav: #renderpath) -> (find: 'children') -> (renderhtml: -basepath=#renderpath, \n\t\t\t\t\t-ancestor=#topself, -flat=#_flat, -expand=#_expand));\n\t\t\telse;\n\t\t\t\treturn: string;\n\t\t\t/if;\n\t\t/if;\n\t\titerate: (self -> 'navitems'), (local: 'navitem');\n\t\t\tif: #navitem -> (find: 'hide');\n\t\t\t\t// do not show in navigation\n\t\t\telse;\n\t\t\t\t#itemlinkstart=string;\n\t\t\t\t#itemlabel=string;\n\t\t\t\t#itemlinkend=string;\n\t\t\t\t#itemchildren = string;\n\t\t\t\t#currentmarker=string;\n\n\t\t\t\t#thispath=#basepath + '/' + (#navitem -> (find: 'key'));\n\t\t\t\t#thispath -> (removeleading: '/');\n\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': thispath is ' + #thispath + ', currentpath is ' + (#topself -> 'path'));\n\t\t\t\tif: (#navitem -> (find: 'template')) != '';\n\t\t\t\t\t#itemrow = (#navitem -> (find: 'template'));\n\t\t\t\telse;\n\t\t\t\t\t#itemrow = #itemtemplate;\n\t\t\t\t/if;\n\t\t\t\t#classarray = array;\n\t\t\t\t(#topself -> 'class') != '' ? #classarray -> (insert: (#topself -> 'class'));\n\t\t\t\t(#navitem -> (find: 'class')) != '' ? #classarray -> (insert: (#navitem -> (find: 'class')));\n\t\t\t\tif: #navitem -> (find: 'disabled');\n\t\t\t\t\t#itemlinkstart=' size;\n\t\t\t\t\t\t#itemlinkstart += ' class=\"' + #classarray -> (join: ' ') + '\"';\n\t\t\t\t\t/if;\n\t\t\t\t\t#itemlinkstart += '>';\n\t\t\t\t\t#itemlabel=(#navitem -> (find: 'label'));\n\t\t\t\t\t#itemlinkend='';\n\t\t\t\telse;\n\t\t\t\t\t/* this code is moved into ->url\n\t\t\t\t\tif: (#navitem -> (find: 'params')) -> type == 'array';\n\t\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': checking params for ' + #thispath + ' with ' + (#navitem -> (find: 'params')));\n\t\t\t\t\t\t// TODO: Move this to a new member tag ->linkparams: path|navitem\n\t\t\t\t\t\t#linkparams=array;\n\t\t\t\t\t\titerate: #navitem -> (find: 'params'), (local: 'param');\n\t\t\t\t\t\t\tif: #clientparams >> #param && #clientparams -> (find: #param) -> first -> type == 'pair';\n\t\t\t\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': got pair param');\n\t\t\t\t\t\t\t\t#linkparams -> (insert: #clientparams -> (find: #param) -> first -> name = #clientparams -> (find: #param) -> first -> value);\n\t\t\t\t\t\t\telse: #clientparams >> #param;\n\t\t\t\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': got plain param');\n\t\t\t\t\t\t\t\t#linkparams -> (insert: #clientparams -> (find: #param) -> first);\n\t\t\t\t\t\t\t/if;\n\t\t\t\t\t\t/iterate;\n\t\t\t\t\t\t#link = (self -> (url: -path=#thispath, -params=self -> (linkparams: -navitem=#navitem), -topself=#topself));\n\t\t\t\t\telse;*/\n\t\t\t\t\t\t//#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': no params for ' + #thispath);\n\t\t\t\t\t\t#link = (self -> (url: -path=#thispath, -topself=#topself));\n\t\t\t\t\t///if;\n\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t#itemlinkstart = ' (find: 'title')) != '';\n\t\t\t\t\t\t#itemlinkstart += ' title=\"' + (encode_html: (#navitem -> (find: 'title'))) + '\"';\n\t\t\t\t\t/if;\n\t\t\t\t\tif: (((#topself -> 'path') + '/') -> (beginswith: #thispath + '/'));\n\t\t\t\t\t\t#classarray -> (insert: ((#topself -> 'currentclass') != '' ? (#topself -> 'currentclass') | 'crnt') );\n\t\t\t\t\t/if;\n\t\t\t\t\tif: #classarray -> size;\n\t\t\t\t\t\t#itemlinkstart += ' class=\"' + #classarray -> (join: ' ') + '\"';\n\t\t\t\t\t/if;\n\t\t\t\t\t#itemlinkstart += '>';\n\t\t\t\t\t#itemlabel=(#navitem -> (find: 'label'));\n\t\t\t\t\tif: #thispath == (#topself -> 'path');\n\t\t\t\t\t\tif: (self -> 'currentmarker') -> type != 'null';\n\t\t\t\t\t\t\t#currentmarker = (self -> 'currentmarker');\n\t\t\t\t\t\telse: (#topself -> 'currentmarker') -> type != 'null';\n\t\t\t\t\t\t\t#currentmarker = (#topself -> 'currentmarker');\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/if;\n\t\t\t\t\t#itemlinkend = '';\n\t\t\t\t\tif: ( (((#topself -> 'path') + '/') -> (beginswith: #thispath + '/')) || #_expand)\n\t\t\t\t\t\t&& self -> (haschildren: #navitem)\n\t\t\t\t\t\t&& !#_flat;\n\t\t\t\t\t\t// recursively render child items\n\t\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': begin rendering children for ' + #basepath + '/' + (#navitem -> (find: 'key')) );\n\t\t\t\t\t\t// clear debug_trace for child\n\t\t\t\t\t\t(#navitem -> (find: 'children') -> 'debug_trace') = array;\n\t\t\t\t\t\t#itemchildren += (#navitem -> (find: 'children') -> (renderhtml: -basepath=#basepath + '/' + (#navitem -> (find: 'key')), \n\t\t\t\t\t\t\t-ancestor=#topself,\n\t\t\t\t\t\t\t-flat=#_flat,\n\t\t\t\t\t\t\t-expand=#_expand));\n\t\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (merge: (#navitem -> (find: 'children') -> 'debug_trace'));\n\t\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': done rendering children');\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t\tif: #itemrow >> '#link#';\n\t\t\t\t\t#itemrow -> (replace: '#link#', #itemlinkstart) \n\t\t\t\t\t\t& (replace: '#title#', #itemlabel)\t// deprecated, use #label# instead\n\t\t\t\t\t\t& (replace: '#label#', #itemlabel)\t// preferred\n\t\t\t\t\t\t& (replace: '#/link#', #itemlinkend)\n\t\t\t\t\t\t& (replace: '#children#', #itemchildren);\n\t\t\t\telse;\n\t\t\t\t\tif: #itemrow !>> '#current#';\n\t\t\t\t\t\t#itemlabel += '#current#';\n\t\t\t\t\t/if;\n\t\t\t\t\t#itemrow -> (replace: '#item#', #itemlinkstart + #itemlabel + #itemlinkend \n\t\t\t\t\t\t+ #itemchildren);\n\t\t\t\t/if;\n\t\t\t\t#itemrow -> (replace: '#current#', #currentmarker);\n\t\t\t\t#itemoutput += #itemrow;\n\t\t\t/if;\n\t\t/iterate;\n\t\t#output = (string_replaceregexp: #template, -find='(?si)#items#(.*?)#/items#', -replace=#itemoutput);\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': render done in ' (self -> 'tagtime') + ' ms');\n\t\treturn: @#output;\n\n\t/define_tag;\n\n\tdefine_tag: 'renderbreadcrumb', -description='Shows the current navigation as breadcrumb trail. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-delimiter (optional) Specifies the delimiter to use between nav levels, defaults to \" > \" if not specified\\n\\\n\t\t\t-home (optional flag) Show the default navigation item (i.e. \"home\") first in the breadcrumb (unless already there).',\n\t\t-optional='delimiter',\n\t\t-optional='home',\n\t\t-optional='skipcurrent',\n\t\t-optional='plain';\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\tlocal: 'output'=array, 'path'=array;\n\t\t!(local_defined: 'delimiter') ? local: 'delimiter'=' > ';\n\t\tif: (local_defined: 'home') && #home != false;\n\t\t\t// show the default navigation item first in breadcrumb\n\t\t\t\n\t\t\t// find default path\n\t\t\tif: self -> 'default' != '' && self -> pathmap >> self -> 'default';\n\t\t\t\tlocal: 'homepath'= (self -> 'default');\n\t\t\telse;\n\t\t\t\t// use first top level nav item as default\n\t\t\t\tlocal: 'homepath'= self -> 'navitems' -> first -> (find: 'key');\n\t\t\t/if;\n\t\t\t\n\t\t\tif: !((self -> 'path') -> (beginswith: #homepath));\n\t\t\t\tif: (local_defined: 'plain') && #plain != false;\n\t\t\t\t\t#output -> (insert: (self -> (getnav: #homepath)) -> (find: 'label'));\n\t\t\t\telse;\n\t\t\t\t\t#output -> (insert: ' (url: -path=#homepath)) + '\">' + (self -> (getnav: #homepath)) -> (find: 'label') + '');\t\t\t\t\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t/if;\n\t\titerate: (self -> 'patharray'), (local: 'pathitem');\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': pathitem ' #pathitem);\n\t\t\t#path -> (insert: #pathitem);\n\t\t\tif: (self -> (getnav: #path)) -> (find: 'hide');\n\t\t\t\t// do not show in navigation\n\t\t\t\tloop_abort;\n\t\t\telse;\n\t\t\t\tif: (local_defined: 'plain') && #plain != false;\n\t\t\t\t\t#output -> (insert: (self -> (getnav: #path)) -> (find: 'label'));\n\t\t\t\telse;\n\t\t\t\t\t#output -> (insert: ' (url: -path=#path)) + '\">' + (self -> (getnav: #path)) -> (find: 'label') + '');\n\t\t\t\t/if;\n\t\t\t/if;\n\t\t/iterate;\n\t\tif: (local_defined: 'skipcurrent') && #skipcurrent != false;\n\t\t\t#output -> removelast;\n\t\t/if;\n\t\t#output = #output -> (join: #delimiter);\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @#output;\n\t/define_tag;\n\n\tdefine_tag: 'getnav', -description='Return reference to the current navigation object map, or for the specified path.',\n\t\t-optional='path', -copy; \n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\t!(local_defined: 'path') ? local: 'path'=(self -> 'patharray');\n\t\tif: #path -> type != 'array';\n\t\t\t#path = string: #path;\n\t\t\t#path -> (removeleading: '/') & (removetrailing: '/');\n\t\t\t#path = #path -> (split: '/');\n\t\t/if;\n\t\t(self -> pathmap) !>> (#path -> (join: '/')) ? return: map;\n\n\t\tlocal: 'nav'=@self,\n\t\t\t'navmap'=map;\n\t\tlocal: 'pathitem' = #path -> (get: 1);\n\t\tif: #nav -> keymap >> #pathitem; \n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': found ' + #pathitem + ' in nav');\n\t\t\t#navmap = @((#nav -> 'navitems') -> (get: ((#nav -> keymap) -> (find: #pathitem))));\n\t\t\tif: #navmap -> type == 'map' && !(#navmap -> (find: 'disabled')) && #navmap -> (find: 'children') -> type == 'nav' && #path -> size > 1;\n\t\t\t\t// look into children level recursively - remove the path level we are at now\n\t\t\t\t#path -> (remove: 1);\n\t\t\t\treturn: @(#navmap -> (find: 'children')) -> (getnav: #path); // recursion\n\t\t\telse;\n\t\t\t\t// we are at the bottom, bail out\n\t\t\t\tself -> 'tagtime_tagname'=tag_name;\n\t\t\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t\t\treturn: @#navmap;\n\t\t\t/if;\n\t\t/if;\n\t/define_tag;\n\n\n\t\n\tdefine_tag: 'getargs', -description='Path arguments = the leftover when we found a matching path, to be used for keyvalue for example.\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-index (optional integer) Specifies which leftover path item to return, defaults to all path items as a string',\n\t\t-optional='index', -type='integer';\n\t\tlocal: 'dotrace'=(self -> 'dotrace');\n\t\t\n\t\tlocal: 'args'=(self -> 'pathargs');\n\t\t#args == '' ? return;\n\t\tif: local_defined: 'index';\n\t\t\t#args = #args -> (split: '/');\n\t\t\tif: #args -> size >= #index;\n\t\t\t\treturn: #args -> (get: #index);\n\t\t\telse;\n\t\t\t\treturn;\n\t\t\t/if;\n\t\telse;\n\t\t\treturn: #args;\n\t\t/if;\n\t\t\n\t/define_tag;\n\t\n\tdefine_tag: 'label', -description='Returns the name of the current (or specified) nav location\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-path (optional)',\n\t\t-optional='path', -copy;\n\t\tlocal: 'dotrace'=(self -> 'dotrace');\n\t\t!(local_defined: 'path') ? local: 'path'=@(self -> 'path');\n\t\treturn: self -> (getnav: #path) -> (find: 'label');\n\t/define_tag;\n\n\tdefine_tag: 'path', -description='Returns url or key path for the current or specified location.',\n\t\t-optional='path', -copy;\t\n\t\tlocal: 'dotrace'=(self -> 'dotrace');\n\t\t!(local_defined: 'path') ? local: 'path'=@(self -> 'path');\n\t\tif: self -> (getnav: #path) -> (find: 'url') != '';\n\t\t\tlocal: 'url'=self -> (getnav: #path) -> (find: 'url');\n\t\t\t#url -> (removeleading: '/') & (removetrailing: '/');\n\t\t\treturn: #url;\n\t\telse: #path -> type == 'array';\n\t\t\treturn: @(#path -> (join: '/'));\n\t\telse;\n\t\t\treturn: @#path;\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'patharray', -description='Returns current path as array.';\n\t\t\treturn: (self -> 'patharray');\n\t/define_tag;\n\n\tdefine_tag: 'actionpath', -description='Returns action path if any.';\n\t\t\treturn: (self -> 'actionpath');\n\t/define_tag;\n\n\tdefine_tag: 'linkparams', -description='Returns an array for all parameters that should be sent along with nav links',\n\t\t-required='navitem', -type='map';\n\t\tif: (#navitem -> (find: 'params')) -> type == 'array';\n\t\t\tlocal: 'linkparams'=array,\n\t\t\t\t'dotrace'=(self -> 'dotrace'),\n\t\t\t\t'clientparams'=client_getparams;\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': checking params ' + (#navitem -> (find: 'params')));\n\t\t\t#clientparams -> (merge: client_postparams);\n\t\t\titerate: #navitem -> (find: 'params'), (local: 'param');\n\t\t\t\t\titerate(#clientparams -> find(#param), local('paraminstance'));\n\t\t\t\t\tif: #paraminstance -> type == 'pair';\n\t\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': got pair param');\n\t\t\t\t\t\t#linkparams -> (insert: (#paraminstance -> name) = (#paraminstance -> value));\n\t\t\t\t\telse;\n\t\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': got plain param');\n\t\t\t\t\t\t#linkparams -> (insert: #paraminstance);\n\t\t\t\t\t/if;\n\t\t\t\t/iterate;\n\t\t\t/iterate;\n\t\t\treturn: @#linkparams;\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'data', -description='Returns data object that can be stored for the current nav location (or specified nav location).\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-path (optional)\\n\\\n\t\t\t-type (optional string) Force a certain return type. If the stored object doesn´t match the specified type, an empty instance of the type is returned. That way the data can be filtered by type without having to use conditionals to check the type before. ',\n\t\t-optional='path', -copy,\n\t\t-optional='type';\n\t\tlocal: 'dotrace'=(self -> 'dotrace');\n\t\t!(local_defined: 'path') ? local: 'path'=@(self -> 'path');\n\t\tif: (local_defined: 'type');\n\t\t\tif: self -> (getnav: #path) -> (find: 'data') -> type == #type;\n\t\t\t\treturn: self -> (getnav: #path) -> (find: 'data');\n\t\t\telse;\n\t\t\t\t// return empty instance of the specified type\n\t\t\t\treturn: (\\#type)->astype;\n\t\t\t/if;\n\t\telse;\n\t\t\treturn: self -> (getnav: #path) -> (find: 'data');\n\t\t/if;\n\t/define_tag;\n\n\t\n\tdefine_tag: 'url', -description='Returns full url for current path or specified path. Path parameters can be provided and overridden by \\\n\t\t\tpassing them to this tag. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-path (optional) \\n\\\n\t\t\t-params (optional) Pair array to be used in url instead of plain parameters sent to this tag\\n\\\n\t\t\t-urlargs (optional) Raw string with url parameters to append at end of url and -params\\n\\\n\t\t\t-getargs (optional flag) Add the getargs (leftover path parts) to the url\\n\\\n\t\t\t-except (optional) Array of parameter names to exclude (or single parameter name as string)\\n\\\n\t\t\t-topself (optional nav) Internal, needed to call url from renderhtml when rendering sublevels\\n\\\n\t\t\t-autoparams (optional flag) Enables the automatic passing of action_params that begin with \"-\"',\n\t\t-optional='path', -copy,\n\t\t-optional='params', -copy,\n\t\t-optional='urlargs',\n\t\t-optional='except', -copy,\n\t\t-optional='topself', -type='nav',\n\t\t-optional='autoparams';\n\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\tlocal: 'url'=string,\n\t\t\t'urlparams'=array;\n\t\t// only getparams to not send along -action etc\n\t\tlocal: 'clientparams'=client_getparams, 'param'=null;\n\n\t\t!(local_defined: 'except') ? local: 'except'=array;\n\t\t#except -> type != 'array' ? #except = array: #except;\n\t\t#except -> insert('-session');\n\t\t!(local_defined: 'topself') ? local: 'topself'=@self;\n\t\t!(local_defined: 'params') ? local: 'params'=(params -> isa('array') ? params | array);\n\t\t!#params -> isa('array') ? #params = array(#params); // added by Jolle 101117\n\t\tif: local_defined: 'path';\n\t\t\tif: #params >> '-path';\n\t\t\t\t// -path was passed as explicit param\n\t\t\t\t#params -> (removeall: '-path');\n\t\t\telse: #params >> #path;\n\t\t\t\t// -path was passed as implicit param - shows up in params as plain value (no pair) so remove the value from params\n\t\t\t\t#params -> (removeall: #path);\n\t\t\t/if;\n\t\telse;\n\t\t\tlocal: 'path'=(#topself -> 'path');\n\t\t/if;\n\t\tlocal: 'navitem'=#topself -> getnav: #path;\n\t\tif: (#navitem -> (find: 'params')) -> type == 'array';\n\t\t\t// add parameters defined as -param for nav item\n\t\t\t#params -> (merge: (#topself -> (linkparams: -navitem=#navitem)));\n\t\t/if;\n\t\tif: #params -> isa('array');\n\t\t\t// clean up other parameters passed to he tag\n\t\t\t#params -> (removeall: '-urlargs')\n\t\t\t\t& (removeall: '-topself')\n\t\t\t\t& (removeall: '-params')\n\t\t\t\t& (removeall: '-except')\n\t\t\t\t& (removeall: '-autoparams')\n\t\t\t\t& (removeall: '-getargs');\n\t\t /if;\n\n\t\titerate: #except, (local: 'param');\n\t\t\t#params -> (removeall: #param);\n\t\t/iterate;\n\n\t\t#url = (#topself -> (path: #path)) + ((#topself -> (path: #path)) != '' ? '/');\n\t\tif: (#topself -> getargs) -> size && (local_defined: 'getargs') && #getargs != false;\n\t\t\t// for links to the current path, add the path args \n\t\t\t#url += (#topself -> getargs) + '/';\n\t\t/if;\n\t\tif: #params >> '-keyvalue';\n\t\t\t#url += (#params -> (find: '-keyvalue') -> first -> value) + '/';\n\t\t\t#params -> (removeall: '-keyvalue');\n\t\t/if;\n\t\t\n\t\titerate: (#params -> type == 'array' ? #params | array: #params), (local: 'param');\n\t\t\tif: #param -> type == 'pair';\n\t\t\t\t#urlparams -> (insert: (encode_stricturl: #param -> name) + '=' + (encode_stricturl: #param -> value));\n\t\t\telse: #param != '';\n\t\t\t\t#urlparams -> (insert: (encode_stricturl: #param));\n\t\t\t/if;\n\t\t/iterate;\n\t\tif: (local_defined: 'autoparams') && #autoparams != false;\n\t\t\t// add getparams that begin with -\n\t\t\titerate: #clientparams, #param;\n\t\t\t\tif: #param -> type == 'pair';\n\t\t\t\t\tif: #param -> name -> (beginswith: '-') && #except !>> #param -> name;\n\t\t\t\t\t\t#urlparams -> (insert: (encode_stricturl: #param -> name) + '=' + (encode_stricturl: #param -> value));\n\t\t\t\t\t/if;\n\t\t\t\telse; // just a string param (no pair)\n\t\t\t\t\tif: #param -> (beginswith: '-') && #except !>> #param;\n\t\t\t\t\t\t#urlparams -> (insert: encode_stricturl: #param);\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t/if;\n\t\t\n\t\tif: (#topself -> 'navmethod') == 'param';\n\t\t\t#url = './?' + #url + (#urlparams -> size || (local: 'urlargs') != '' ? '&');\n\t\telse; // path\n\t\t\t#url = (#topself -> 'root') + #url + (#urlparams -> size || (local: 'urlargs') != '' ? '?');\n\t\t/if;\n\n\t\t#urlparams = string: (#urlparams -> (join: '&'));\n\t\t// restore / in paths for looks\n\t\t#urlparams -> replace('%2f', '/');\n\t\t#url += #urlparams;\n\t\t#urlparams -> size && (local: 'urlargs') -> size ? #url += '&';\n\t\t(local: 'urlargs') -> size ? #url += #urlargs;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: @#url;\n\t/define_tag;\n\t\n\tdefine_tag: 'filename', -description='Returns the full path to the specified type of precissing file for the current navigation. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-type (required) lib, act, cnt, cfg, actcfg',\n\t\t-required='type',\n\t\t-optional='path', -copy;\n\t\t/*\n\t\t\n\t\t-filenaming can be one of prefix, suffix or extension. \n\t\tPrefix is \"the old way\". lib_customer.inc. This is the default if -filenaming is not specified. \n\t\tSuffix is a hybrid, for example customer_lib.inc. \n\t\tExtension is for example customer.lib\n\t\t\n\t\tThe rest is automatic. \n\t\t\n\t\t\n\t\tPossible places to look for a library file that belongs to the path \"customer/edit\" (in order of precedence):\n\t\tA) -filenaming='prefix' (default)\n\t\t1. _mod_customer/lib_customer_edit.inc \t\t// modular prefixed with module name\n\t\t2. _mod_customer/lib_edit.inc\t\t\t\t// modular\n\t\t3. _mod_customer/_library/lib_customer_edit.inc\t// modular separated, prefixed with module name\n\t\t4. _mod_customer/_library/lib_edit.inc\t\t// modular separated\n\t\t5. _library/lib_customer_edit.inc\t\t\t// collective (\"all modules together\") separated. This is the old way. \n\t\t\n\t\tB) -filenaming='suffix'\n\t\t1. _mod_customer/customer_edit_lib.inc\n\t\t2. _mod_customer/edit_lib.inc\n\t\t3. _mod_customer/_library/customer_edit_lib.inc\n\t\t4. _mod_customer/_library/edit_lib.inc\n\t\t5. _library/customer_edit_lib.inc\n\t\t\n\t\tC) -filenaming='extension'\n\t\t1. _mod_customer/customer_edit.lib\n\t\t2. _mod_customer/edit.lib\n\t\t3. _mod_customer/_library/customer_edit.lib\n\t\t4. _mod_customer/_library/edit.lib\n\t\t5. _library/customer_edit.lib\n\t\t\n\t\tThe principle is to start looking at the most specific location and then look at more and more generic locations, to be able to do the local override. \n\n\t\t*/\n\t\t\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\tlocal: 'filenamearray'=array, \n\t\t\t'filenamearray_temp'=array,\n\t\t\t'filename'=string,\n\t\t\t'prefix'=string,\n\t\t\t'type_short'=string,\n\t\t\t'suffix'=string,\n\t\t\t'extension'=string,\n\t\t\t'typefoldermap'=(map: \n\t\t\t\t'cfg'='_config/', \n\t\t\t\t'actcfg'='_config/', \n\t\t\t\t'act'='_action/',\n\t\t\t\t'lib'='_library/',\n\t\t\t\t'cnt'='_content/'),\n\t\t\t'typefolder'=string,\n\t\t\t'basefolder'=string,\n\t\t\t'directorytree' = (self -> directorytree);\n\t\tif: #type == 'act' || #type == 'actcfg';\n\t\t\tlocal('path') -> size == 0 ? local('actionpath'=string(self -> 'actionpath')) | local('actionpath'=string(#path));\n\t\t\t#actionpath -> removeleading('/') & removetrailing('/');\n\t\t\t#actionpath == '' ? return;\n\t\t\t#filenamearray = (self -> getnav(#actionpath) -> find('filename'));\n\t\t\tif: #filenamearray == '';\n\t\t\t\t#filenamearray=#actionpath;\n\t\t\t/if;\n\t\t\t#filenamearray = #filenamearray -> split('/');\n\t\telse;\n\t\t\tlocal('path') -> size == 0 ? local('path'=string(self -> 'path'));\n\t\t\t#path -> removeleading('/') & removetrailing('/');\n\t\t\tself -> getnav(#path) -> size == 0 ? return;\n\t\t\t#filenamearray=(self -> getnav(#path) -> find('filename'));\n\t\t\tif: #filenamearray == '';\n\t\t\t\t#filenamearray=#path;\n\t\t\t/if;\n\t\t\t#filenamearray = #filenamearray -> split('/');\n\t\t/if;\n\t\t#type =='actcfg' ? #prefix = 'cfg' | #prefix = #type;\n\t\t#type_short = #prefix;\n\t\t#typefolder=#typefoldermap -> (find: #type);\n\n\t\tselect: (self -> 'filenaming');\n\t\tcase: 'suffix';\n\t\t\t#suffix='_' + #prefix;\n\t\t\t#extension='.inc';\n\t\t\t#prefix = '';\n\t\tcase: 'extension';\n\t\t\t#extension='.' + #prefix;\n\t\t\t#suffix='';\n\t\t\t#prefix = '';\n\t\tcase; // prefix as default\n\t\t\t#prefix += '_';\n\t\t\t#extension='.inc';\n\t\t\t#suffix='';\n\t\t/select;\n\n\t\tlocal: 'findtimer'=_date_msec;\n\t\tloop: 2;\n\t\t\t#basefolder=(array: '', '_knop/') -> (get: loop_count);\n\t\t\tloop: 5;\n\t\t\t\t#filename = string;\n\t\t\t\tselect: loop_count;\n\t\t\t\tcase: 1;\n\t\t\t\t\t// customer/lib_customer_edit.inc\n\t\t\t\t\tif: #filenamearray -> size >= 1;\n\t\t\t\t\t\t// at least 1 level, look in module folder\n\t\t\t\t\t\t#filenamearray_temp = #filenamearray;\n\t\t\t\t\t\t#filename = #basefolder + '_mod_' + #filenamearray_temp -> first;\n\t\t\t\t\t\t#filename += '/' + #prefix + (#filenamearray_temp -> (join: '_')) + #suffix + #extension;\n\t\t\t\t\t/if;\n\t\t\t\tcase: 2; \n\t\t\t\t\t// customer/lib_edit.inc\n\t\t\t\t\tif: #filenamearray -> size >= ((self -> 'filenaming') == 'extension' ? 2 | 1);\n\t\t\t\t\t\t// at least 1 level (2 levels for suffix naming), look in module folder\n\t\t\t\t\t\t#filenamearray_temp = #filenamearray;\n\t\t\t\t\t\t#filename = #basefolder + '_mod_' + #filenamearray_temp -> first;\n\t\t\t\t\t\t#filenamearray_temp -> removefirst;\n\t\t\t\t\t\t#filename += '/' + #prefix + (#filenamearray_temp -> (join: '_')) + #suffix + #extension;\n\t\t\t\t\t\tif(#filenamearray -> size == 1);\n\t\t\t\t\t\t\t// clean up underscore so filename ends up as lib.inc instead of lib_.inc etc\n\t\t\t\t\t\t\t#filename -> replace('/' + #type_short + '_' + #extension, '/' + #type_short + #extension);\n\t\t\t\t\t\t\t#filename -> replace('/_' + #type_short + #extension, '/' + #type_short + #extension);\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/if;\n\t\t\t\tcase: 3;\n\t\t\t\t\t// customer/_library/lib_customer_edit.inc\n\t\t\t\t\tif: #filenamearray -> size >= 2;\n\t\t\t\t\t\t// at least 2 levels, look in module folder\n\t\t\t\t\t\t#filenamearray_temp = #filenamearray;\n\t\t\t\t\t\t#filename = #basefolder + '_mod_' + #filenamearray_temp -> first;\n\t\t\t\t\t\t#filename += '/' + #typefolder + #prefix + (#filenamearray_temp -> (join: '_')) + #suffix + #extension;\n\t\t\t\t\t/if;\n\t\t\t\tcase: 4;\n\t\t\t\t\t// customer/_library/lib_edit.inc\n\t\t\t\t\tif: #filenamearray -> size >= 2;\n\t\t\t\t\t\t// at least 2 levels, look in module folder\n\t\t\t\t\t\t#filenamearray_temp = #filenamearray;\n\t\t\t\t\t\t#filename = #basefolder + '_mod_' + #filenamearray_temp -> first;\n\t\t\t\t\t\t#filenamearray_temp -> removefirst;\n\t\t\t\t\t\t#filename += '/' + #typefolder + #prefix + (#filenamearray_temp -> (join: '_')) + #suffix + #extension;\n\t\t\t\t\t/if;\n\t\t\t\tcase;\n\t\t\t\t\t// _library/lib_customer_edit.inc\n\t\t\t\t\t#filename = #basefolder + #typefolder + #prefix + (#filenamearray -> (join: '_')) \n\t\t\t\t\t\t+ #suffix + #extension;\n\t\t\t\t/select;\n\t\t\t\tif: #filename != '';\n\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': trying ' + (self -> 'fileroot') + #filename );\n\t\t\t\t\tif: #directorytree >> #filename;\n\t\t\t\t\t\t//file_exists: (self -> 'fileroot') + #filename;\n\t\t\t\t\t\t// clean up and exit\n\t\t\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': ** Found ' + (self -> 'fileroot') + #filename + ' in ' + (_date_msec - #findtimer) ' ms');\n\t\t\t\t\t\tself -> 'tagtime_tagname'=tag_name;\n\t\t\t\t\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t\t\t\t\treturn: (self -> 'fileroot') + #filename;\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t/loop;\n\t\t/loop;\n\t\t// clean exit if nothing was found\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn;\n\n\t/define_tag;\n\t\n\tdefine_tag: 'actionconfigfile', -description='Shortcut to filename: actcfg'; return: self -> (filename: 'actcfg'); \t/define_tag;\n\tdefine_tag: 'actionfile', -description='Shortcut to filename: act'; \t\treturn: self -> (filename: 'act'); \t\t/define_tag;\n\tdefine_tag: 'configfile', -description='Shortcut to filename: cfg'; \t\treturn: self -> (filename: 'cfg'); \t\t/define_tag;\n\tdefine_tag: 'libraryfile', -description='Shortcut to filename: lib'; \t\treturn: self -> (filename: 'lib'); \t\t/define_tag;\n\tdefine_tag: 'contentfile', -description='Shortcut to filename: cnt'; \t\treturn: self -> (filename: 'cnt'); \t\t/define_tag;\n\n\tdefine_tag: 'include', -description='Includes any of the files for the current path, fails silently if file does not exist. \\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-file (required) lib, act, cnt, cfg, actcfg or library, action, config, actionconfig, content, or any arbitrary filename',\n\t\t-required='file',\n\t\t-optional='path';\n\t\tknop_debug(self->type + ' -> ' + tag_name + ' ' + params -> first, -type=self->type, -open);\n\t\thandle;knop_debug('Done with ' + self->type + ' -> ' + tag_name + ' ' + params -> first, -close, -time, -witherrors);/handle;\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\t// includes any of the files for the current path, fails silently if file does not exist\n\t\tlocal: 'translation'=(map:\n\t\t\t\t'actionconfig'= 'actcfg',\n\t\t\t\t'action'= 'act',\n\t\t\t\t'config'= 'cfg',\n\t\t\t\t'library'= 'lib',\n\t\t\t\t'content'= 'cnt'),\n\t\t\t'types'=(map: 'actcfg', 'act', 'cfg', 'lib', 'cnt'),\n\t\t\t'result'=string;\n\t\tlocal: 'type'= (#translation >> #file ? #translation -> (find: #file) | #types >> #file ? #file | 'other');\n\t\t// find out full filename\n\t\t!local_defined('path') ? local('path'=null);\n\t\tlocal: 'filename'=null;\n\t\tif: #types >> #type;\n\t\t\t// knop include\n\t\t\t#filename = self -> filename(#type, -path=#path);\n\t\telse: (self -> directorytree) >> #file;\n\t\t\t// arbitrary include within the Knop folder structure\n\t\t\t#filename = (self -> 'fileroot') + #file;\n\t\telse: (self -> directorytree) >> '_knop/' + #file;\n\t\t\t// arbitrary include one level down in _knop folder\n\t\t\t#filename = (self -> 'fileroot') + '_knop/' + #file;\n\t\t/if;\n\t\tif: #type == 'cfg' && #filename -> size && (self -> 'actionconfigfile_didrun') == #filename;\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': ' + #filename ' has already run as actionconfig');\n\t\t\t//knop_debug(self->type + ' -> ' + tag_name + ': ' + #filename ' has already run as actionconfig');\n\t\t\treturn;\n\t\telse: #type == 'actcfg';\n\t\t\t// remember that we have run this config file as actionconfig so we don't run the same file again as page config\n\t\t\t(self -> 'actionconfigfile_didrun') = #filename;\n\t\t/if;\n\t\tif: #filename != '';\n\t\t\tlocal: 't'=_date_msec;\n\t\t\t#result=@(include: #filename);\n\t\t\t(self -> 'debug_trace') -> (insert: 'Include ' + #file + ': ' + #filename + ' processed in ' + (_date_msec - #t) ' ms');\n\t\t\t//knop_debug(self->type + ' -> ' + tag_name + ' ' + #file + ': ' + #filename + ' processed in ' + (_date_msec - #t) ' ms', -type=self->type);\n\t\t\tself -> 'tagtime_tagname'=tag_name;\n\t\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\t\treturn: @#result;\n\t\telse;\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: 'Include ' + #file + ': no matching filename found');\n\t\t\tknop_debug(self->type + ' -> ' + tag_name + ' ' + #file + ': no matching filename found');\n\t\t/if;\n\t/define_tag;\n\t\n\tdefine_tag: 'library', -description='includes file just as ->include, but returns no output', \n\t\t-required='file',\n\t\t-optional='path';\n\t\t// includes file just as ->include, but returns no output\n\t\t!local_defined('path') ? local('path'=null);\n\t\tself -> include(#file, -path=#path);\n\t\t// returns nothing\n\t/define_tag;\n\n\tdefine_tag: 'directorytree', -description='Returns a map of all existing knop file paths', \n\t\t-optional='basepath'; // only used for recursive calls\n\t\tlocal: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); \n\t\tlocal: 'dirlist'=map;\n\t\tif: (self -> 'directorytreemap') -> size;\n\t\t\t// use the stored directory tree that has already been created\n\t\t\t#dirlist = (self -> 'directorytreemap');\n\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': Returning stored directorytree');\n\n\t\telse;\n\t\t\t// first time calling this tag - create the directory tree\n\t\t\tif: (local_defined: 'basepath');\n\t\t\t\tlocal: 'path' = #basepath;\n\t\t\telse;\n\t\t\t\tlocal: 'path'=(self -> 'fileroot');\n\t\t\t/if;\n\t\t\t!(#path -> (endswith: '/')) ? #path += '/';\n\t\t\tlocal: 'diritem'=string,\n\t\t\t\t'dirlist_sub'=map,\n\t\t\t\t'diritem_sub'=pair;\n\t\t\titerate: file_listdirectory: #path, #diritem;\n\t\t\t\tif: !(#diritem -> (beginswith: '.'));\n\t\t\t\t\t#dirlist_sub = map;\n\t\t\t\t\t#diritem -> (removetrailing: '/');\n\t\t\t\t\tif: //#diritem -> (endswith: '/') && \n\t\t\t\t\t\t((map: '_knop', '_include', '_config', '_action', '_library', '_content') >> #diritem\n\t\t\t\t\t\t\t|| #diritem -> (beginswith: '_mod_'));\n\t\t\t\t\t\t// recursive call for sub folder within the Knop directory structure\n\t\t\t\t\t\t#dirlist_sub = self -> (directorytree: #path + #diritem);\n\t\t\t\t\t\titerate: #dirlist_sub, #diritem_sub;\n\t\t\t\t\t\t\t#dirlist -> (insert: #diritem + '/' + #diritem_sub -> name);\n\t\t\t\t\t\t/iterate;\n\t\t\t\t\t/if;\n\t\t\t\t\t// Add item to map, with trailing / if item has sub items (folder contents)\n\t\t\t\t\t#dirlist -> (insert: #diritem + (#dirlist_sub -> size ? '/'));\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t\tif: !(local_defined: 'basepath');\n\t\t\t\t// this was the topmost call in the recursive chain, so store the result\n\t\t\t\t(self -> 'directorytreemap') = #dirlist;\n\t\t\t\t#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': Creating directorytree');\n\t\t\t/if;\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: #dirlist;\n\t/define_tag;\n\n\n\tdefine_tag: 'trace', \n\t\t-optional='html',\n\t\t-optional='xhtml';\n\t\tlocal: 'dotrace'=(self -> 'dotrace');\n\n\t\tlocal: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');\n\n\t\tlocal: 'eol'=(local_defined: 'html') || #endslash -> size ? '\\n' | '\\n';\n\n\t\treturn: #eol + 'Debug trace for nav $' + (self -> varname)\n\t\t\t+ (!#dotrace ? ' (detailed trace not enabled)' )\n\t\t\t+ #eol + (self -> 'debug_trace') -> (join: #eol) \n\t\t\t+ #eol;\n\n\t/define_tag;\n\n/define_type;\n\n\n?>\n[\n//------------------------------------------------------------------\n// End knop_nav\n//------------------------------------------------------------------\n\n//##################################################################\n\n][\n//------------------------------------------------------------------\n// Begin knop_user\n//------------------------------------------------------------------\n\n]removedata to remove field from the data map. Thanks to Ric Lewis.\n2009-09-18\tJS\tSyntax adjustments for Lasso 9\n2009-06-23\tJS\t->encrypt now uses default encrypt_cipher from the custom type instead of a hard coded default\n2009-02-26\tJS\t->login: further correction on the search for login with FileMaker, to reduce the risk for false duplicates\n2009-02-26\tJS\t->login: Added optional -searchparams to be able to add more conditions to the login search, for example to exclude users that are not enabled. \n2008-12-02\tJS\t->encrypt: Changed to -hex cipher instead of encode_base64\n2008-11-05\tJS\t->getdata: corrected a check that prevented the tag from returning anything\n2008-11-05\tJC\t->login: A failed login attempt now results in a logout instead of keeping any old authentication\n2008-11-05\tJC\t->getpermission will always return falseif a user is not logged in\n2008-11-05\tJC\t->logout: The permissions map is now cleared when logging out\n2008-11-04\tJC\t->encrypt: changed incorrect encrypt_cipher to encrypt_digest\n2008-09-10\tJS\tAdded ondeserialize to make client_fingerprint_expression survive session\n2008-07-17\tJS\tImplemented ->setpermission and ->getpermission\n2008-07-17\tJS\tAdded client_fingerprint_expression as compound expression so it can be configurable by changing the instant variable\n2008-05-20\tJS\t->login: Added delay between more than 5 failed login attempts \n2008-05-08\tJS\t->login: improved the search for FileMaker datasources to make it work for email address as username\n2008-02-08\tJS\tAdded ->keys\n2008-02-03\tJS\t-> login: Corrected storage of id_user\n2007-11-27\tJS\tCoded an incomplete version\n2007-06-13\tJS\tCreated the data type\n\n// TODO: \nMake it possible for knop_user to work independently of a knop_database object by creating a custom user lookup - see http://listsearch.com/Lasso/Thread/index.lasso?20528\nuserdb reference is brooken, probably when stored in session. Can this be fixed?\nMake client_fingerprint configurable by specifying a compound expression at oncreate\nAdd support for role based permisions\n\n*/\n\n\n/*\nPurpose:\n- Maintain user identity and authentication\n- Handle database record locking more intelligently, also to be able to release all unused locks for a user\n- Authenticating user login\n- Restricting access to data\n- displaying specific navigation options depending on type of user\n\nlets add some date handling in there too like time of last login\nand probably the IP that the user logged in from.\n\n\nSome options to handle what happens when a user logs in again whilst already logged in.\nie one could:\ndisallow second login (with a message explaining why)\nautomatically log the first session out (with a message indicating what happened)\nsend a message to first session: \"Your username is attempting to log in again, do you wish to close this session, or deny the second login attempt?\"\nallow multiple logins (from the same IP address)\nallow multiple logins from any IP address\n\nAll of these could be useful options, depending of the type of app.\n\nAnd different types of user (ie normal, admin) could have different types of treatment.\n\nHandling for failed login attempts:\nOption to set how many tries can be attempted; \nOption to lock users out permanently after x failed attempts? \nLogging (to database) of failed logins / successful logins\n\nPassword recovery system (ie emailing a time sensitive link to re-set password)\nBy \"password recovery\" I'm not thinking \"email my password\" (hashed passwords can't be emailed...) but rather to email a short lived link that gives the user an opportunity to change his password. How is this different from \"password reset\"?\nYes, that is an accurate description of what I had in mind, except for the bit about emailing a short-lived link. Instead I imagined having the user reset their password 100% on the web site through the use of \"Security Questions\", much like banks employ.\n\nI like the idea of more info attached to the user. Like login attempts, locking a user temporarily after too many failed attempts etc.\n\n\nThe setup is more or less that I have users and groups.\n\nI'm thinking that Knop shouldn't do any session handling by itself, but the knop_user variable would be stored in the app's session as any other variable. Knop should stay as lean as possible...\n\nOther things to handle:\nPrevent session sidejacking by storing and comparing the user's ip and other identifying properties.\nProvide safe password handling with strong one-way salted encryption.\n\nconsider having a separate table for auditing all user actions, including logging in, logging out, the basic CRUD actions, searches\n\nThe object have to handle situations where no user is logged in. A guest can still have rights to some actions. Modules that can be viewed. Forms that could be sent in etc.\nThat the added functions don't slow down the processing. We already have a lot of time consuming overhead in Knop.\n\n\n\nFeatures:\n1. Authentication and credentials\n- Handle the authentication process\n- Keep track of if a user is properly logged in\n- Optionally keep track of multiple logins to same account\n- Prevent sidejacking\n- Optionally handle encrypted/hashed passwords (with salt)\n- Prevent brute force attacks (delay between attempts etc)\n- Handle general information about the user\n- Provide accessors for user data\n\n2. Permissions and access control\n- Keep track of what actions a user is allowed to perform (the \"verbs\")\n- Tie into knop_nav to be able to filter out locations based on permissions\n\n3. Record locks\n- Handle clearing of record locks from knop_database\n\n4. Audit trail/logging\n- Optionally log login/logout actions\n- Provide hooks to be able to log other user actions\n\nFuture additions:\n- Keep track of what objects and resources a user is allowed to act on (the \"nouns\")\n- Provide filtering to use in database queries\n- What groups a user belongs to\n- Mechanism to update user information, password etc\n- Handle password recovery\n\n\nPermissions can be read, create, update, delete, or application specific (for example publish)\n\n*/\n\n\tlocal: 'id_user'=null,\n\t\t'validlogin'=false,\n\t\t'groups'=array,\n\t\t'data'=map,\t\t\t\t\t\t// map with arbitrary user information (name, address etc)\n\t\t'permissions'=map,\n\t\t'loginattempt_date'=(date: 0),\t// to keep track of delays multiple login attempts\n\t\t'loginattempt_count'=integer,\t// number of failed login attempts\n\n\t\t'userdb'=null,\t\t\t\t\t// database object for user authentication\n\t\t'useridfield'='id',\t\n\t\t'userfield'='username',\t\n\t\t'passwordfield'='password',\n\t\t'saltfield'=null,\n\t\t'encrypt'=false,\n\t\t'encrypt_cipher'='RIPEMD160',\t// digest encryption method\n\n\t\t'logdb'=null,\t\t\t\t\t// database object for logging\n\t\t'logeventfield'='event',\t\t// the event to be logged\n\t\t'loguserfield'='id_user',\t\t// the user who is performing the logged action\n\t\t'logobjectfield'='id_object',\t// what object is affected by the logged action\n\t\t'logdatafield'='data',\t\t\t// details about the logged action\n\n\t\t'singleuser'=false,\n\t\t'uniqueid'=null,\t\t\t\t// To track multiple logins on the same account (this is to be stored and compared server side)\n\t\t'client_fingerprint'=null,\t\t// combination of ip, useragent etc to be able to track sidejacking\n\t\t'client_fingerprint_expression'={return(encrypt_md5(string(client_ip) + client_type))},\n\t\t'dblocks'=array,\t\t\t\t// a list of all database objects that have been locked by this user \n\t\t'error_lang'=(knop_lang: -default='en', -fallback),\n\t\t;\n\n\tdefine_tag: 'oncreate', -description='Parameters:\\n\\\n\t\t\t-encrypt (optional flag or string) Use encrypted passwords. If a value is specified then that cipher will be used instead of the default RIPEMD160. If -saltfield is specified then the value of that field will be used as salt.\\n\\\n\t\t\t-singleuser (optional flag) Multiple logins to the same account are prevented (not implemented)',\n\t\t-required='userdb', -type='database',\n\t\t-optional='encrypt',\n\t\t-optional='useridfield', -type='string',\n\t\t-optional='userfield', -type='string',\n\t\t-optional='passwordfield', -type='string',\n\t\t-optional='saltfield', -type='string',\n\t\t-optional='logdb', -type='database',\n\t\t-optional='loguserfield', -type='string',\n\t\t-optional='logeventfield', -type='string',\n\t\t-optional='logdatafield', -type='string',\n\t\t-optional='singleuser';\n\t\t\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tlocal_defined('userfield') ? (self -> 'userfield') = #userfield;\n\t\tlocal_defined('useridfield') ? (self -> 'useridfield') = #useridfield;\n\t\tlocal_defined('passwordfield') ? (self -> 'passwordfield') = #passwordfield;\n\t\tlocal_defined('saltfield') ? (self -> 'saltfield') = #saltfield;\n\t\tlocal_defined('loguserfield') ? (self -> 'loguserfield') = #loguserfield;\n\t\tlocal_defined('logeventfield') ? (self -> 'logeventfield') = #logeventfield;\n\t\tlocal_defined('logdatafield') ? (self -> 'logdatafield') = #logdatafield;\n\n\t\t// the following params are stored as reference, so the values of the params can be altered after adding a field simply by changing the referenced variable. \n\t\tlocal_defined('userdb') ? (self -> 'userdb') = @#userdb;\n\t\tlocal_defined('logdb') ? (self -> 'logdb') = @#logdb;\n\n\t\tif: (local_defined: 'encrypt') && #encrypt != false;\n\t\t\t(self -> 'encrypt') = true;\n\t\t\tif: #encrypt -> size && (Cipher_List: -digest) >> #encrypt; // a valid digest cipher was specified\n\t\t\t\t(self -> 'encrypt_cipher') = #encrypt;\n\t\t\t/if;\n\t\telse;\n\t\t\t(self -> 'encrypt') = false;\n\t\t/if;\n\t\t(self -> 'singleuser') = (local_defined: 'singleuser') && #singleuser != false;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\n\tdefine_tag: 'ondeserialize', -description='Recreates transient variables after coming back from a session';\n\t\t// MARK: Why is client_fingerprint_expression considered a transient variable?\n\t\tself -> properties -> first -> insert('client_fingerprint_expression'={return(encrypt_md5(string(client_ip) + client_type))});\n\t/define_tag;\n\n/*\n\tdefine_tag: 'onassign', -description='Internal, needed to restore references when ctype is defined as prototype',\n\t\t-required='value';\n\t\t// recreate references here\n\t\titerate: (array: \n\t\t\t'userdb',\n\t\t\t'logdb'), (local: 'param');\n\t\t\t(self -> #param) = @(#value -> #param);\n\t\t/iterate;\n\t/define_tag;\n// */\t\n\t\n\tdefine_tag: '_unknowntag', -description='Shortcut to getdata';\n\t\tif: (self -> 'data') >> tag_name;\n\t\t\treturn: (self -> 'data') -> (find: tag_name);\n\t\telse;\n\t\t\t//fail: -9948, self -> type + '->' + tag_name + ' not known.';\n\t\t\t(self -> '_debug_trace') -> insert(self -> type + '->' + tag_name + ' not known.');\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'auth', -description='Checks if user is authenticated, returns true/false';\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tlocal: 'validlogin'=false, 'client_fingerprint_now'=string;\n\t\t// check validlogin\n\t\t#validlogin = (self -> 'validlogin');\n\t\tif: #validlogin;\n\t\t\t// check client_fingerprint to prevent sidejacking\n\t\t\t#client_fingerprint_now = (self -> 'client_fingerprint_expression') -> invoke;\n\t\t\tif: #client_fingerprint_now != (self -> 'client_fingerprint');\n\t\t\t\t#validlogin = false;\n\t\t\t\t(self -> '_debug_trace') -> insert(tag_name + ': Client fingerprint has changed - this looks like session sidejacking. Logging out.');\n\t\t\t\t(self -> 'error_code') = 7503;\n\t\t\t\tself -> logout;\n\t\t\t\t// TODO: log this\n\t\t\t/if;\n\t\t\t// TODO: if singleuser, check uniqueid\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t\treturn: #validlogin;\n\t/define_tag;\n\n\n\tdefine_tag: 'login', -description='Log in user. On successful login, all fields on the user record will be available by -> getdata.\\n\\\n\t\t\tParameters:\\n\\\n\t\t\t-username (required) Optional if -force is specified\\n\\\n\t\t\t-password (required) Optional if -force is specified\\n\\\n\t\t\t-searchparams (optional) Extra search params array to use in combination with username and password\\n\\\n\t\t\t-force (optional) Supply a user id for a manually authenticated user if custom authentication logics is needed',\n\t\t-optional='username',\n\t\t-optional='password',\n\t\t-optional='searchparams', -type='array', -copy,\n\t\t-optional='force';\n\t\tlocal: 'timer'=knop_timer; \n\n\t\tif(!local_defined('force') && (!local_defined('username') || !local_defined('password')));\n\t\t\tfail(-9956, self -> type + '->' + tag_name + ' requires -username and -password, or -force');\n\t\t/if;\n\t\t\n\t\tlocal: 'db'=@(self -> 'userdb'),\n\t\t\t'validlogin'=false;\n\t\t\n\n\t\tif(local_defined('force') && string(#force) -> size && #force != false);\n\t\t\t(self -> '_debug_trace') -> insert(tag_name + ': ' + 'Manually authenticating user id ' + #force);\n\t\t\t#validlogin = true;\n\t\t\t(self -> 'id_user') = #force;\n\n\t\telse;\n\t\t\t!local_defined('searchparams') ? local('searchparams'=array);\n\t\t\tif((local('username') -> size && local('password') -> size));\n\t\t\t\tif((self -> 'loginattempt_count') >= 5);\n\t\t\t\t\t// login delay since last attempt was made \n\t\t\t\t\t(self -> '_debug_trace') -> insert(tag_name + ': Too many login attempts, wait until ' + (2 * (self -> 'loginattempt_count')) + ' seconds has passed since last attempt.');\n\t\t\t\t\twhile(((date - (self -> 'loginattempt_date')) -> second) < (2 * (self -> 'loginattempt_count')) // at least 5 seconds, longer the more attempts\n\t\t\t\t\t\t&& loop_count < 100); // rescue sling\n\t\t\t\t\t\tsleep(200);\n\t\t\t\t\t/while;\n\t\t\t\t/if;\n\t\t\t\t// authenticate user against database (username must be unique)\n\t\t\t\t(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Authenticating user');\n\t\t\t\tif(#db -> 'isfilemaker');\n\t\t\t\t\t#searchparams -> merge(array(-op='eq', (self -> 'userfield') = '=\"' + #username + '\"'));\n\t\t\t\telse;\n\t\t\t\t\t#searchparams -> merge(array(-op='eq', (self -> 'userfield') = #username));\n\t\t\t\t/if;\n\t\t\t\t#db -> select(#searchparams);\n\t\t\t\t(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Searching user db, ' (#db -> found_count) + ' found ' + (#db -> error_msg) + ' ' + (#db -> action_statement));\n\t\t\t\tif: #db -> found_count == 1\n\t\t\t\t\t&& #db -> (field: (self -> 'userfield')) == #username; // double check the username\n\t\t\t\t\t// one match, continue by checking the password with case sensitive comparsion\n\t\t\t\t\tif: (self -> 'encrypt') && (self -> 'saltfield') -> size;\n\t\t\t\t\t\t// use encryption with salt\n\t\t\t\t\t\t(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Checking password with salted encryption');\n\t\t\t\t\t\tif: bytes: (#db -> (field: (self -> 'passwordfield'))) \n\t\t\t\t\t\t\t== bytes: (self -> (encrypt: #password, -salt=#db -> (field: (self -> 'saltfield') ), -cipher=(self -> 'encrypt_cipher') ));\n\t\t\t\t\t\t\t#validlogin=true;\n\t\t\t\t\t\t/if;\n\t\t\t\t\telse: (self -> 'encrypt');\n\t\t\t\t\t\t// use encryption with no salt\n\t\t\t\t\t\t(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Checking password with encryption, no salt');\n\t\t\t\t\t\tif: bytes: (#db -> (field: (self -> 'passwordfield'))) \n\t\t\t\t\t\t\t== bytes: (self -> (encrypt: #password, -cipher=(self -> 'encrypt_cipher')));\n\t\t\t\t\t\t\t#validlogin=true;\n\t\t\t\t\t\t/if;\n\t\t\t\t\telse;\n\t\t\t\t\t\t(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Checking plain text password');\n\t\t\t\t\t\tif: bytes: (#db -> (field: (self -> 'passwordfield'))) \n\t\t\t\t\t\t\t== bytes: #password;\n\t\t\t\t\t\t\t#validlogin=true;\n\t\t\t\t\t\t/if;\n\t\t\t\t\t/if;\n\t\t\t\t/if;\n\t\t\t\tif(#validlogin);\n\t\t\t\t\t(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'id_user: ' + #db -> (field: (self -> 'useridfield')));\n\t\t\t\t\t// store user id\n\t\t\t\t\t(self -> 'id_user') = #db -> (field: (self -> 'useridfield'));\n\t\t\t\t\t// store all user record fields in data map\n\t\t\t\t\t(self -> 'data') = #db -> recorddata;\n\t\t\t\t/if;\n\t\t\t/if; // #username and #password\n\t\t/if; // #force\n\n\t\tif: #validlogin; \n\t\t\t(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Valid login');\n\t\t\t(self -> 'loginattempt_count') = 0;\n\t\t\t(self -> 'error_code') = 0; // No error\n\t\t\t// set validlogin to true\n\t\t\t(self -> 'validlogin')=true;\n\t\t\t// log the action TODO\n\t\t\t// store client_fingerprint\n\t\t\t(self -> 'client_fingerprint') = (self -> 'client_fingerprint_expression') -> invoke;\n\t\t\t// if singleuser, store uniqueid in server side storage\n\t\telse(!(local('username') -> size && local('password') -> size));\n\t\t\t(self -> 'error_code') = 7502; // Username or password missing\n\t\t\tself -> logout;\n\t\telse;\n\t\t\t// TODO:\n\t\t\t// - block username for a while after too many attempts\n\t\t\t(self -> 'loginattempt_count') += 1;\n\t\t\t(self -> 'loginattempt_date') = date; // keep track of when last login attempt happened\n\t\t\t(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Invalid login (' + (self -> 'loginattempt_count') + ' attempts)');\n\t\t\t(self -> 'error_code') = 7501; // Authentication failed\n\t\t\tself -> logout;\n\t\t\t// exit\n\t\t/if;\n\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\t\n\tdefine_tag: 'logout'; \n\t\tlocal: 'timer'=knop_timer; \n\t\t// set validlogin to false\n\t\t(self -> 'validlogin')=false;\n\t\t(self -> 'id_user') = null;\n\t\t(self -> 'data') = map;\n\t\t(self -> 'permissions') = map;\n\t\t\n\t\t// clear all record locks\n\t\tself -> clearlocks;\n\t\t// log the action\n\n\t\t(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Logged out');\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\tdefine_tag: 'getdata', -description='Get field data from the data map.',\n\t\t-required='field';\n\t\tif: (self -> 'data') >> #field;\n\t\t\treturn: (self -> 'data') -> (find: #field);\n\t\telse;\n\t\t\t(self -> '_debug_trace') -> insert(tag_name + ': ' + #field + ' not known');\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'removedata', -description='Remove field from the data map.',\n\t\t-required='field';\n\t\tif: (self -> 'data') >> #field;\n\t\t\t(self -> 'data') -> (remove: #field);\n\t\telse;\n\t\t\t(self -> '_debug_trace') -> insert(tag_name + ': ' + #field + ' not known');\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'id_user', -description='Return the user id';\n\t\tif: self -> auth;\n\t\t\treturn: (self -> 'id_user');\n\t\telse;\n\t\t\treturn: false;\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'setdata', -description='Set field data in the data map. Either -> (setdata: -field=\\'fieldname\\', -value=\\'value\\') or -> (setdata: \\'fieldname\\'=\\'value\\')',\n\t\t-required='field', -copy,\t// can also be a pair with field=value\n\t\t-optional='value', -copy;\n\t\tlocal: 'timer'=knop_timer; \n\t\tif: #field -> isa('pair');\n\t\t\tlocal: 'value'=#field -> value;\n\t\t\t#field = #field -> name;\n\t\t/if;\n\t\tfail_if: !(local_defined: 'value'), -1, (self -> type) '->setdata requires a value parameter';\n\t\t(self -> 'data') -> insert(#field = #value);\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\t\n\tdefine_tag: 'getpermission', -description='Returns true if user has permission to perform the specified action, false otherwise',\n\t\t-required='permission';\n\t\tif((self -> auth) && (self -> 'permissions') >> #permission);\n\t\t\treturn((self -> 'permissions') -> find(#permission));\n\t\telse;\n\t\t\treturn(false);\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'setpermission', -description='Sets the user\\'s permission to perform the specified action (true or false, or just the name of the permission)',\n\t\t-required='permission',\n\t\t-optional='value';\n\t\tif(local_defined('value') && #value != false); // any non-false value is regarded as true\n\t\t\t(self -> 'permissions') -> insert(#permission=true);\n\t\telse(local_defined('value') && #value == false); // explicit false\n\t\t\t(self -> 'permissions') -> insert(#permission=false);\n\t\telse; // no value specified is regarded as true\n\t\t\t(self -> 'permissions') -> insert(#permission=true);\n\t\t/if;\n\t/define_tag;\n\n\n\tdefine_tag: 'addlock', -description='Called by database object, adds the name of a database object that has been locked by this user.',\n\t\t-required='dbname';\n\t\tif: (self -> 'dblocks') !>> #dbname && (var: #dbname) -> (isa: 'database');\n\t\t\t(self -> '_debug_trace') -> insert(tag_name + ': adding database name ' + #dbname);\n\t\t\t(self -> 'dblocks') -> (insert: #dbname);\n\t\t/if;\n\t/define_tag;\n\n\tdefine_tag: 'clearlocks', -description='Clears all database locks that has been set by this user';\n\t\tlocal: 'timer'=knop_timer; \n\t\tif: (self -> auth);\n\t\t\t(self -> '_debug_trace') -> (insert: tag_name + ': ' + (self -> 'dblocks') -> (join: ', '));\n\t\t\titerate: (self -> 'dblocks'), local: 'dbname';\n\t\t\t\tif: (var: #dbname) -> (isa: 'database');\n\t\t\t\t\t(var: #dbname) -> (clearlocks: -user=(self -> 'id_user'));\n\t\t\t\t\t#dbname = null;\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t\t// remove all locks that has been cleared\n\t\t\t(self -> 'dblocks') -> (removeall: null);\n\t\t\t(self -> '_debug_trace') -> (insert: tag_name + ': done, remaining locks: ' + (self -> 'dblocks') -> (join: ', '));\n\t\t/if;\n\t\tself -> 'tagtime_tagname'=tag_name;\n\t\tself -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to \"stop timer\"\n\t/define_tag;\n\n\n\tdefine_tag: 'encrypt', -description='Internal use. Encrypts the input using digest encryption, optionally with salt. ',\n\t\t-required='data', -copy,\n\t\t-optional='salt',\n\t\t-optional='cipher';\n\t\tlocal: 'output'=string;\n\t\t!(local_defined: 'cipher') ? local: 'cipher'=self -> 'encrypt_cipher';\n\t\tif: (local_defined: 'salt');\n\t\t\t#data = #salt + #data;\n\t\t/if;\n\t\tif: (Cipher_List: -digest) !>> #cipher;\n\t\t\t// fall back to default digest cipher\n\t\t\t#cipher = 'MD5';\n\t\t/if;\n\t\t#output = (cipher_digest: #data, -digest=#cipher, -hex);\n\t\treturn: #output;\n\t/define_tag;\n\t\n\tdefine_tag: 'keys', -description='Returns all keys for the stored user data';\n\t\treturn: (self -> 'data') -> keys;\n\t/define_tag;\n\n/define_type;\n\n\n\n?>\n[\n//------------------------------------------------------------------\n// End knop_user\n//------------------------------------------------------------------\n\n//##################################################################\n\n][define_tag('changenotes', -description='This tag is created on the fly by buildnamespace.lasso',\n\t\t-namespace='knop_',\n\t\t-optional='type', -optional='date', -copy);\n\t\tlocal('output'=string, 'changenotes'=map('knop_nav'='2010-11-17\tJC\tFixed bug so that session links no longer gets added to urls by the nav -> url tag.\n2010-11-17\tJC\tFixed a bug that would not convert local params to an array under certain situations\n2009-09-18\tJS\tSyntax adjustments for Lasso 9\n2009-09-04\tJS\t->linkparams: Multiple paramaters with the same name (typically checkboxes) are now passed properly\n2009-05-06\tJS\t->directorytree considers _include folders as part of the Knop directory structure. nav->include(\\'_include/myfile.inc\\') will first look for _include/myfile.inc and if not found it will look for _knop/_include/myfile.inc \n2009-05-05\tJS\t->include looks for a specified file also inside a _knop folder, if the file does not exist at the specified location\n2009-02-09\tJS\t->filename: Casting path and actionpath to string\n2008-12-19\tJS\t->filename (and consequently ->include and ->library) can now use a specific -path instead of the current location\\'s path\n2008-12-09\tJS\t->linkparams: fixed undefined local in trace call (only showed when trace was enabled for the nav object)\n2008-11-25\tJS\t->getlocation will now avoid disabled and hidden pages when looking for the first page if no default page is specified\n2008-11-03\tJS\t->getlocation will not break if no navigation items have been defined\n2008-10-30\tJS\t_mod folders will now work with knop paths with just a single level, so an include file path can end up as _mod_customer/lib_customer.inc or just _mod_customer/lib.inc (the latter variant does not apply to extension-based filenaming, so _mod_customer/.lib will never be a working file path)\n2008-07-10\tJS\tAdded -> label to return the name of the current page\n2008-05-20\tJS\t->renderhtml: #current# is not automatically added to the template if the more elaborate template format is used. This makes it easier to hide the currentmarker without changing the nav config (partial revert of fix 2008-01-04). \n2008-05-08\tJS\t->insert: A duplicate key does no longer cause a fatal error but instead fails silently and logs to the debug log\n2008-05-07\tJS\t->url: will now call ->linkparams so all links that are constructed from ->url will properly send along the parameters specified in the nav item. This also affects pagination and sort links in grid. \n2008-05-07\tJS\tAdded ->linkparams, Returns an array for all parameters that should be sent along with nav links (this was previously embedded in renderhtml)\n2008-02-25\tJS\t->url: new parameter -getargs to add the getargs to the path link if the path equals the current path\n2008-02-06\tJC\t->insert: the -hide flag can now be a boolean (also the -disabled flag)\n2008-02-03\tJS\t->include: can now include any specified filename\n2008-02-01\tJS\t->oncreate: added optional -fileroot to be able to use a root for files that is different from the logical site root used for navigation \n2008-01-23\tJS\t->url: Added -autoparams that is required to enable the automatic passing of action_params that begin with \"-\" (this reverts the default behavior to match the the old)\n2008-01-22\tJS\t->url: GET params that begin with \"-\" are sent as parameters on links. -path, -sort, -desc, -q are explicitly excluded from nav links in renderhtml. \n2008-01-22\tJS\tWhen using param based navigation, navigation links now use much cleaner /?path/to/page/ style links instead of /?-path=path/to/page/\n2008-01-22\tJS\t->getlocation: when navmethod is param, the path can now be sent as unnamed parameter insetad of -path parameter (such as /?path/to/page/). \n2008-01-04\tJS\t->renderbreadcrumb: added flag -plain to output breadcrumb without html\n2008-01-04\tJS\t->renderbreadcrumb: added flag -skipcurrent to not include the current location in the output\n2008-01-04\tJS\t->insert: -template can now be specified also for individual nav items. Use the form #link##label##current##/link##children#. \n2008-01-04\tJS\t->renderhtml: changed #title# to #label# in template for clarity, for example #link##label##current##/link##children# (#title# will remain supported)\n2008-01-04\tJS\tAdded #current# as placeholder for template, to specify where the current marker should occurr. If not specified in the template, the current marker appears immediately after the label.\n2007-12-12\tJS\t->include now logs processing time for the include to debug trace\n2007-12-11\tJS\tAdded documentation as -description to most member tags, to be used by the new ->help tag\n2007-12-11\tJS\tMoved ->help to knop_base\n2007-12-04\tJS\tnav item css class is now applied also to disabled nav items (rendered as )\n2007-11-08\tJS\tChanged trace so it tracks some things even when it\\'s not enabled (like include etc)\n2007-11-05\tJS\tAdded var name to trace output\n2007-10-28\tJS\t->directorytree: should now work also when knop folders are symlinks\n2007-09-06\tJS\ttop level nav elements that are -disabled now behave properly when accessed\n2007-09-05\tJS\t-currentmarker can now be set separately on sublevels, not only on topmost level\n2007-08-29\tJS\tAdded _knop as optional base folder to put all knop files in\n2007-08-29\tJS\t->include: Removed file_exists check since the filename has already been verified in ->filename.\n2007-08-29\tJS\tAdded ->directorytree which returns a map with all knop filenames, to use when searching for includes\n2007-08-28\tJS\t->oncreate: -filenaming to specify how include files are named prefix/suffix/extension\n2007-08-28\tJS\t->filename: Implemented support for flexible folder structures\n2007-08-28\tJS\tInstance variable #actionconfigfile_didrun was not properly declared\n2007-06-18\tJS\tAdded tag timer to most member tags\n2007-06-14\tJS\t->insert: -url=\\'/\\' can now be used to specify the \"home\" location. \n2007-06-13\tJS\tadded ->children to get a reference to the children nav object for a specified path, so new children can be inserted. Must call ->reindex afterwards. \n2007-06-13\tJS\tadded ->reindex to rebuild the index maps from scratch. Must be done after adding children items. \n2007-06-13\tJS\tadded ->addchildren to replace a current children nav object for a specified path. Will handle the reindexing transparently. \n2007-06-13\tJS\tadded ->keymap, ->pathmap and ->urlmap to access the index maps so they call reindex if they have been invalidated (for example by ->addchildren)\n2007-06-13\tJS\tadded inheritance from knop_base\n2007-06-11\tJC\tadded handling of xhtml output\n2007-06-08\tJS\t->insert: params with empty values are now ignored\n2007-05-04\tJS\t->insert: added check that default item exists in children before storing the default\n2007-04-19\tJS added ->data to retrieve data stored for the current path (or specified path). Optional -type ensures the returned data has the correct type. \n2007-04-19\tJS ->insert: added -data to store arbitrary data object for each path. The object is stored as reference so a variable can be changed after it has been added to the nav object\n2007-04-19\tJS\tadded ->patharray to return the current path as array\n2007-04-17\tJS\t->renderhtml: template now supports #link##title##/link##children# in addition to #item# to provide more flexibility\n2007-04-17\tJS\t->oncreate: added support for -template, -class, currentclass and -currentmarker\n2007-04-13\tJS\tImplemented -class per navitem (only worked globally with setformat before)\n2007-04-03\tJS\t->renderhtml: added -renderpath, -expand and -flat to be able to render parts of the nav menu for more flexible layout\n2007-04-03\tJS\t->renderbreadcrumb: added -home to show the default navigation item first in the breadcrumb \n2007-04-03\tJS\tChanged namespace from mt_ to knop_\n2007-03-01\tJS\tChanged navmethod path so it uses response_filepath instead of $url_path\n2007-02-25\tJS\tAdded ->actionpath\n2007-02-24\tJS\t->renderhtml: improved handling of classes in nav links\n2007-02-22\tJS\t->url: added -except\n2007-02-09\tJS\t->url: corrected the behavior for plain parameters passed to the tag\n2007-02-05\tJS\t->insert: Added -param to be able to specify params that should be propagated in nav for certain nav elements (like -keyvalue to be able to move between different subtabs for a selected record\n2007-02-05\tJS\t->renderhtml now use ->url to get the right links\n2007-02-01\tJS\tMade usage of trace optional to improve performance\n2007-02-01\tJS\tImprovements to debug_trace to log also recursive events\n2007-02-01\tJS\tAdded ->haschildren, which is now used by ->renderhtml to properly show or hide child level\n2007-01-31\tJS\t->renderhtml Added renderhtml_levels to keep track of how many levels deep navigation has been rendered, to be able to add proper spacing between navigation and content\n2007-01-31\tJS \t->url: -urlargs Improved handling of urlargs and ?/& delimiters, should work better with navmethod path\n2007-01-30\tJS\tRemoved automatic link title attribute since it can be confusing to show children page titles there\n2007-01-30\tJS\tCorrected parameter path to -path (bug)\n2007-01-23\tJS\t->include: \\'config\\' checks if the same config has already run as actionconfig and won\\'t run again in that case\n2007-01-23\tJS\t->include checks if the file exists first, so no need for empty placeholder files\n2007-01-23\tJS\tAdded ->include and ->library\n2007-01-23\tJS\tAdded ->setlocation\n2007-01-17\tJS\tAdded insert: -hide to allow a location without showing it in navigation\n\nTODO\nAdd support for compound expressions for template. The expression could return a map that would override corresponding param values. \n->insert: Add -raw to be able to inject code into the link tag, similar to form->addfield(-raw). \nExclude file name for example index.lasso from getargs\nOptimize nav->url! Very slow with complex nav object. \nNeeds to exclude also -keyfield and -lockfield. Maybe better to add an option to ->url to not auto-add any \"-\" params at all. \n-params are not sent along in breadcrumb links\nNeed simple way to exclude certain \"-\" params from ->url, also in config per nav item\nAdd support for adding nav structure from a database\nMove templates to a member tag to be make it easier to subclass\nMake it possible to use external URL for -url (make sure there is no / before http)\n\n','knop_base'='2009-09-14\tJS\tSyntax adjustments for Lasso 9\n2009-09-04\tJS\tChanged $__html_reply__ to content_body\n2009-04-07\tJS\t->error_msg: custom error numbers can now be added, even if the language already exists.\n2008-01-10\tJS\t->error_msg: improved reporting of custom error messages such as from bad database queries\n2007-12-13\tJS\tAdded -> error_lang to provide a reference to the knop_lang object for error messages, to be able to add localized error messages to any Knop type (except knop_lang and knop_base)\n2007-12-12\tJS\tAdded -html and -xhtml to ->help to get a nicely formatted output. \n2007-12-11\tJS\tCentralized ->error_code and ->error_msg to knop_base. Moved all error codes to error_msg\n2007-12-06\tJS\tChanged ->help to improve the self-documentation. It will now always return an up to date list of member tags and parameter. \n2007-11-05\tJS\tAdded var name to trace output\n2007-06-17\tJS\tAdded ->tagtime (was in nav earlier)\n2007-06-13\tJS\tAdded -> varname to be able to retreive the name of the page variable that a type instance is stored in.\n2007-06-13\tJS\tAdded -> xhtml to automatically sense if an xhtml doctype exists in the current page buffer. The result is cached in a page variable for performance. \n\t\t\t\tThis is for internal use for member tags that output html. \n2007-06-13\tJS\tIntroduced page variable $_knop_data for general page level storage and caching, common between different knop objects. \n2007-06-13\tJS\tCreated the data type\n\nTODO: ->help: add output option to format for Google Code Wiki\n->xhtml is not working properly when site is run by atbegin handler and explicitly writing to content_body \n\n\n','knop_grid'='2011-01-01\tSP\tCorrection of invalid HTML in and \n2010-12-23\tSP\tCorrected pagination bug for -numbered.\n2010-11-17\tJC\tAdded -startwithfooter flag to grid->renderhtml. This moves the footer before the column titles in the table header.\n2010-11-17\tJC\tChanged rawheader inclusion to work even if there\\'s no quicksearch for a grid\n2010-05-14\tJC\tAdded span separation on grid footer for better styling\n2010-03-06\tSP\tChanged default behavior of ->sortparams and ->quicksearch with -sql to add backticks between the table and column names. Now JOINs may be used.\n2010-03-06\tSP\tAdded ->sortparams and ->quicksearch with -removedotbackticks for backward compatibility for fields that contain periods. If you use periods in a fieldname then you cannot use a JOIN in Knop.\n2010-01-27\tJC\tAdjusted the id support\n2010-01-25\tJC\tAdded support for optional id, used by table, quicksearch and quicksearch_reset\n2009-09-18\tJS\tSyntax adjustments for Lasso 9\n2009-08-26\tJS\tCorrected prev/next links when no nav is defined for the grid object\n2009-06-29\tJS\t->renderlisting: documentation correction (renderlisting never calls renderfooter). \n2009-01-11\tJS\t->renderlisting: Made sure that template isn\\'t applied on NULL field values since that would cause an error with ->replace \n2008-12-29\tJC\tSupport for optional classes in table header\n2008-11-27\tJC\t-> implemented support for td specific classes. The class is inserted in both the TH and TD tag for the specified field\n2008-09-24\tJS\t->sortparams: fieldnames specified by the -sort parameter are now validated so they exist in the database\n2008-09-24\tJS\t->sortparams, ->quicksearch: Added protection against backtick sql injection in MySQL object names\n2008-09-10\tJS\t-numbered can now be specified at oncreate in addition to ->renderhtml and ->renderfooter. \n2008-09-08\tJS\t->sortfield changed so defaultsort is honored even if -nosort is specified (-nosort is only used to prevent the user from changing sort order on the fly)\n2008-09-08\tJS\t->renderlisting and ->renderfooter optimized by caching the result of nav->url. \n2008-05-15\tJS\t->renderfooter: minor adjustment to numbered pagination links\n2008-05-14\tJS\t->renderfooter (and ->renderhtml): added -numbered as option to get google style numbered pagination links. Render the grid with -numbered (defaults to show 6 page number links plus the far ends) or -numbered=10 or another number. \n2008-05-13\tJS\tAdded ->renderlisting which is now part of ->renderhtml for more flexibility\n2008-02-25\tJS\t->renderheader and ->renderfooter calls nav -> url with -getargs \n2008-01-22\tJS\t->renderheader, ->renderfooter, ->renderhtml: addded -autoparams to nav -> url used in links since url was changed to default to no autoparams. \n2008-01-22\tJS\t->renderheader, ->renderfooter, ->renderhtml: improved support for param based navigation method in links, cleaned up linking to use nav -> url instead of self -> urlparams when nav is available\n2008-01-22\tJC\t->quicksearch: Changed wordseparators so that \\\\r and \\\\n aren\\'t placed as \\\\r\\\\n, otherwise they are treated as a single character by ->split. \n2007-12-11\tJS\tAdded documentation as -description to most member tags, to be used by the new ->help tag\n2007-12-11\tJS\tMoved ->help to knop_base\n2007-12-03\tJS\tAdded optional -language parameter to set the initial language for the grid object\n2007-12-03\tJS\tAdded -> lang to provide a reference to the knop_lang object that is used for localized strings\n2007-12-03\tJS\tAdded localized strings for English and Swedish\n2007-12-03\tJS\tAdded knop_lang to handle localized strings\n2007-11-11\tJC\tAdded optional -rawheader for extra header content to be inserted before the Quicksearch form\n2007-10-23\tJS\t->renderheader: added class=\"grid\" to the opening table tag to be able to isolate the css specifications\n2007-10-03\tJS\t->renderfooter: added unique classes for each type of prev/next link to be able to replace with images using css\n2007-10-03\tJS\t->renderfooter: Changed prev/next link texts to simple |< << >> >| instead of unicode glyphs\n2007-09-20\tJS\tPostparams are only sent along for nav params (not \"-\" params)\n2007-09-07\tJS\tAlso send postparams along in prev/next links (not only getparams)\n2007-09-06\tJS\tIf nav has params defined, those params will be sent along with prev/next links\n2007-09-06\tJS\tAdded encode_url for link params\n2007-09-06\tJS\tChanged -action to -formaction in the quicksearch form\n2007-08-08\tJS\t->urlargs: Added exception for -session\n2007-06-18\tJS\tAdded tag timer to most member tags\n2007-06-13\tJS\tadded inheritance from knop_base\n2007-06-11\tJC\tadded handling of xhtml output\n2007-05-30\tJS\t->quicksearch: added \\\\r and \\\\n as word separators. \n2007-05-03\tJS\t->addfield: Added check for empty dbfield name before adding to dbfieldmap\n2007-04-19\tJS\t->quicksearch: added -value (flag) that makes quicksearch output just the value of the quicksearch field instead of a query\n2007-04-13\tJS\t->oncreate: added -nosort as global flag (overrides column specific sort options)\n2007-04-13\tJS\t->renderfooter: Added tbody to footer to make it pass validation, but it\\'s still not semantically correct. \n2007-04-13\tJS\tChanged field type for quicksearch for non-WebKit based browsers\n2007-04-10\tJS\t->quicksearch: Added @ as word separator for \"word begins with\" search\n2007-04-10\tJS\t->quicksearch: Added -contains as option to perform a simple contains search instead of emulating \"word begins with\" search\n2007-04-10\tJS\t->renderheader: When grid has a defaultsort, there should be no \"unsort\" option in the sortable headings\n2007-04-10\tJS\t->insert: (-defaultsort=\\'desc\\') or (-defaultsort=\\'descending\\') makes the default sort order sort in descending order\n2007-04-04\tJS\t->addfield: -template can now also be a compound expression\n2007-04-03\tJS\tChanged namespace from mt_ to knop_\n2007-03-01\tJS\tAdded support for FileMaker with quicksearch (untested)\n2007-03-01\tJS\tChanged all texts to English\n2007-02-07\tJS\tRemoved classs=\"first\" and class=\"notopborder\" since CSS border-collapse: collapse; eliminates the need\n2007-02-05\tJS The -keyvalue parameter for url edit links can be given another name by specifying -keyparamname in addfield\n2007-01-31\tJS\t->addfield: #value# can be used in -url, as a way to provide mailto links etc in lists\n2007-01-30\tJS\tSortable columns now thave three states instead of two: sorted ascending, sorted descending and unsorted. \n2007-01-30\tJS\tImprovements to quicksearch, to emulate \"word begins with\" searches\n2007-01-26\tJS\tAdded support for quicksearch field in grid header. Specify -quicksearch at ->oncreate, and tell what fields to search by specifying -quicksearch for those fields at ->addfield. \n\t\t\t\tFields can be search only (no display) by leaving out name and label. All specified fields are searched word for word of thew search string. \n\t\t\t\tUse ->quicksearch to get the search parameters (optionally -sql)\n2007-01-26\tJS\tAdded ->urlargs to get a querystring with all \"-\" GET params, except those in optional -except string or array parameter. \n2007-01-22\tJS\tAdjustments to highlighting and \"(redigera)\"-link for records with empty values in the linked field\n2007-01-19\tJS\tAdded href titles to sort links and prevnext links\n2007-01-19\tJS\tCorrected sortparams when no sortfield is specified\n2007-01-19\tJS\tAddded go to first page, go to last page in footer\n2007-01-19\tJS\tAdded member tag page_skiprecords to help correcting out of bounds page numbers\n2007-01-19\tJS\tAdded member tag lastpage\n2007-01-18\tJS\tSupport for highlighting of affected record after edit or update (class name \"highlight\")\n2007-01-17\tJS\tAdded addfield: -template\n\nTODO\nMake it possible for knop_grid to work independently of a knop_database object so other types of listings can bre created. \nLanguage of quicksearch buttons can\\'t be changed after the grid has been created\ntbody is used in renderfooter, which is not semantically correct. can\\'t use tfoot though since the footer is rendered twice. \nMove templates to a member tag to be make it easier to subclass\nChange ->addfield to ->insert and make ->addfield deprecated\n\n','knop_database'='2012-06-10\tSP\tFix for decimal precision bug in 8.6.0.1 in renderfooter.\n2012-01-15\tSP\tAdd support for inline host method. Thanks to Ric Lewis.\n2010-11-23\tJS\t->settable: removed reference for -table\n2009-09-18\tJS\tSyntax adjustments for Lasso 9\n2009-06-26\tJS\t->nextrecord: Added deprecation warning\n2009-05-15\tJS\t->field: corrected the verification of the -index parameter\n2009-01-09\tJS\tAdded a check before calling resultset_count so it will not break in Lasso versions before 8.5\n2009-01-09\tJS\t->_unknowntag: fixed incorrect debug_trace\n2008-12-03\tJS\t->addrecord: improved how keyvalue is returned when adding records\n2008-12-03\tJS\t->addrecord: inserting a generated keyvalue can now be suppressed by specifying -keyvalue=false\n2008-12-03\tJS\t->saverecord and ->deleterecord will now use the current keyvalue (if any), so -keyvalue will not have to be specified in that case. \n2008-11-25\tJS\t->field and ->recorddata will no longer touch current_record if it was zero\n2008-11-24\tJS\t->field: Added -index parameter to be able to access any occurrence of the same field name\n2008-11-24\tJS\tAdded -> records that returns a new data type knop_databaserows\n2008-11-24\tJS\t->resultset_count: added support for -inlinename. \n2008-11-24\tJS\tChanged ->nextrecord to ->next. ->nextrecord remains supported for backwards compatibility.\n2008-11-14\tJS\t->nextrecord resets the record pointer when reaching the last record\n2008-11-13\tJS\t->recorddata now honors the current record pointer (as incremented by -nextrecord)\n2008-11-13\tJS\t->recorddata: added -recordindex parameter so a specific record can be returned instead of the first found.\n2008-10-30\tJS\t->getrecord now REALLY works with integer keyvalues (double oops) - I thought I fixed it 2008-05-28 but misplaced a paren...\n2008-09-26\tJS\tAdded -> resultset_count corresponding to the same Lasso tag, so [resultset]...[/resultset] can now be used through the use of inlinename.\n2008-09-10\tJS\t-> getrecord, ->saverecord, ->deleterecord: Corrected handling of lock user to work better with knop_user\n2008-07-09\tJS\t->saverecord: -keeplock now updates the lock timestamp\n2008-05-28\tJS\t->getrecord now works with integer keyvalues (oops)\n2008-05-27\tJS\t->get returns a new datatype knop_databaserow \n2008-05-27\tJS\tAdded ->size and ->get so a database object can be iterated. When iterating each row is returned as an array of field values. \n2008-05-27\tJS\tAddedd ->nextrecord that increments the recordpointer each time it is called until the last record in the found set is reached. Returns true as long as there are more records. Useful in a while loop - see example below\n2008-05-27\tJS\tImplemented record pointer \\'current_record\\'. The record pointer is reset for each new query. \n2008-05-27\tJS\t->field: added -recordindex to get data from any record in the current found set\n2008-05-27\tJS\tAdded ->_unknowntag as shortcut to field\n2008-05-26\tJS\tRemoved onassign since it causes touble\n2008-05-26\tJS\tExtended field_names to return the field names for any specified table, return field names also for db objects that have never been used for a database query and optionally return field types\n2008-01-29\tJS\t->getrecord now supports -sql. Make sure that the SQL statement includes the relevant keyfield (and lockfield if locking is used). \n2008-01-10\tJS\t->capturesearchvars: error_code and error_msg was mysteriously not set after database operations that caused errors. \n2008-01-08\tJS\t->saverecord: added flag -keeplock to be able to save a locked record without releasing the lock\n2007-12-15\tJS\tAdding support for knop_user in record locking is in progress. Done for ->oncreate and ->getrecord. \n2007-12-11\tJS\tMoved error_code and error_msg to knop_base\n2007-12-11\tJS\tAdded documentation as -description to most member tags, to be used by the new ->help tag\n2007-12-11\tJS\tMoved ->help to knop_base\n2007-12-10\tJS\tAdded ->settable to be able to copy an existing database object and properly set a new table name for it. Faster than creating a new instance from scratch. \n2007-12-03\tJS\tCorrected shown_first once again, hoping it\\'s right this time\n2007-11-29\tJS\tAdded support for field_names and corresponding member tag ->field_names\n2007-11-05\tJS\tAdded var name to trace output\n2007-10-26\tJS\t->capturesearchvars: corrected shown_first when no records found\n2007-10-26\tJS\t->oncreate: added default value \"keyfield\" if the -keyfield parameter is not specified\n2007-09-06\tJS\tCorrected self -> \\'tagtime\\' typo\n2007-06-18\tJS\tAdded tag timer to most member tags\n2007-06-13\tJS\tadded inheritance from knop_base\n2007-06-11\tJC\tadded handling of xhtml output\n2007-05-30\tJS\tChanged recordid_value to keyfield_value and -recordid to -keyvalue\n2007-05-28\tJS\t->oncreate: Added clearing of current error at beginning of tag\n2007-04-19\tJS\tCorrected the handling of -maxrecords and -skiprecords for SQL selects that have LIMIT specified\n2007-04-19\tJS\tImproved handling of foundrows so it finds any whitespace around SQL keywords, instead of just plain spaces\n2007-04-18\tJS\t->select now populates recorddata with all the fields for the first found record. Previously it only populated recorddata when there was 1 found record. \n2007-04-12\tJS\t->oncreate: Added authentication inline around Database_TableNames../Database_TableNames\n2007-04-10\tJS\t->oncreate: Improved validation of table name (table_realname can sometimes be null even for valid table names)\n2007-04-03\tJS\tChanged namespace from mt_ to knop_\n2007-02-02\tJS\tImproved reporting of Lasso error messaged in error_msg\n2007-01-30\tJS \tAdded real error codes and additional error data for some errors (like record locked)\n2007-01-30\tJS\tChanged -keyvalue parameters to copy value instead of pass as reference, to not cause problems when using keyvalue from the same db object as is being updated, for example $db->(saverecord: -keyvalue=$db->keyvalue)\n2007-01-26\tJS\tAdjusted affectedrecord_keyvalue so it\\'s only captured for -add and -update\n2007-01-23\tJS\tSupports -uselimit (or querys that use LIMIT) and still gets proper searchresult vars (using a separate COUNT(*) query) - may not always get the right result for example for queries with GROUP BY\n2007-01-23\tJS\t-keyfield can be specified for saverecord to override the default\n2007-01-23\tJS\tChanged name of ->updaterecord to ->saverecord\n2007-01-23\tJS \tFixed bug where keyfield was missing as returnfield when looking up locked record for deleterecord\n2007-01-23\tJS\tAdded ->field\n2007-01-19\tJS\tAdded maxrecords_value and skiprecords_value to searchresultvars\n2007-01-18\tJS\tAdded affectedrecord_keyvalue to make it possible to highlight affected record in record list (grid)\n\n\nTODO:\nAllow -keyfield to be specified for ->addrecord and ->deleterecord\nAdd some Active Record similar functionality for editing\nLook at making it so -table can be set dynamically instead of fixed at oncreate, to eliminate the need for one db object for each table. This can cause problems with record locks and how they interact with knop_user \ndatetime_create and datetime_mod, and also user_create and user_mod.\n\tUse default field names but allow to override at oncreate, and verify them at oncreate before trying to use them. \n\n\n','knop custom tags in util.inc'='\t2007-06-17\tJS\tCreated the type\n\t\n\t','knop_user'='2012-01-16\tSP\tAdded ->removedata to remove field from the data map. Thanks to Ric Lewis.\n2009-09-18\tJS\tSyntax adjustments for Lasso 9\n2009-06-23\tJS\t->encrypt now uses default encrypt_cipher from the custom type instead of a hard coded default\n2009-02-26\tJS\t->login: further correction on the search for login with FileMaker, to reduce the risk for false duplicates\n2009-02-26\tJS\t->login: Added optional -searchparams to be able to add more conditions to the login search, for example to exclude users that are not enabled. \n2008-12-02\tJS\t->encrypt: Changed to -hex cipher instead of encode_base64\n2008-11-05\tJS\t->getdata: corrected a check that prevented the tag from returning anything\n2008-11-05\tJC\t->login: A failed login attempt now results in a logout instead of keeping any old authentication\n2008-11-05\tJC\t->getpermission will always return falseif a user is not logged in\n2008-11-05\tJC\t->logout: The permissions map is now cleared when logging out\n2008-11-04\tJC\t->encrypt: changed incorrect encrypt_cipher to encrypt_digest\n2008-09-10\tJS\tAdded ondeserialize to make client_fingerprint_expression survive session\n2008-07-17\tJS\tImplemented ->setpermission and ->getpermission\n2008-07-17\tJS\tAdded client_fingerprint_expression as compound expression so it can be configurable by changing the instant variable\n2008-05-20\tJS\t->login: Added delay between more than 5 failed login attempts \n2008-05-08\tJS\t->login: improved the search for FileMaker datasources to make it work for email address as username\n2008-02-08\tJS\tAdded ->keys\n2008-02-03\tJS\t-> login: Corrected storage of id_user\n2007-11-27\tJS\tCoded an incomplete version\n2007-06-13\tJS\tCreated the data type\n\n// TODO: \nMake it possible for knop_user to work independently of a knop_database object by creating a custom user lookup - see http://listsearch.com/Lasso/Thread/index.lasso?20528\nuserdb reference is brooken, probably when stored in session. Can this be fixed?\nMake client_fingerprint configurable by specifying a compound expression at oncreate\nAdd support for role based permisions\n\n','knop_lang'='2010-12-29\tJS\t->getstring: make sure we only try to do replacement in strings or bytes\n2010-05-27\tJS\tgetstring now works also with empty -replace value\n2010-04-20\tJS\tgetstring debug output corrected for missing string. \n2009-09-16\tJS\tSyntax adjustments for Lasso 9\n2009-06-26\tJS\t->addstring: clarified deprecation warning\n2009-04-08\tJS\tAdded -debug flag to oncreate (when creating a lang object) to make undefined language keys appear as *key*.\n2009-03-24\tJS\t->getstring prevents replacements if there is no language string found, to prevent null->replace error\n2008-11-12\tJS\tAdded ->insert instead of ->addstring for better consistency with other Lasso data types. ->addstring will remain functional for backwards compatibility. \n2008-09-11\tJS\t->_unknowntag: added missing support for -language\n2008-01-22\tJS\t->getstring: corrected the fallback behavior when a current language has been set \n2008-01-07\tJS\tRemoved instance variable browserlanguage due to problems with transient storage. The browserlanguage is cached on page level so it\\'s no loss in reality. \n2007-12-12\tJS\tAdded page level storage of currentlanguage, so all knop_lang instances defaults to the same language once one of them have set a language explictly, but only if the other knop_lang instances don\\'t have a language set explicitly. \n2007-12-12\tJS\tAdded page level caching of browser language (stores the value in $_knop_data map)\n2007-12-06\tJS\tMoved -> help to knop_base\n2007-12-06\tJS\tAdded ->description to all member tags. \n2007-12-03\tJS\tFinished first complete version\n2007-06-18\tJS\tAdded tag timer to most member tags\n2007-06-13\tJS\tadded inheritance from knop_base\n2007-06-13\tJS\tRenamed to knop_lang (formerly knop_strings)\n2007-04-04\tJS\tCreated the data type and started coding\n\nTODO:\nProvide methods to handle formatting of dates, numbers, currency etc for different languages/locales. \nWeekday names, month names etc. \nMember tag to return the current language\nMember tag to set default output encoding unless it follows encode_set. \n\nExamples\n\tvar: \\'lang_messages\\'=(knop_lang: -default=\\'en\\');\n\t$lang_messages -> (insert: -key=\\'welcome\\', -value=\\'Welcome to the home page\\', -language=\\'en\\');\n\t$lang_messages -> (insert: -key=\\'welcome\\', -value=\\'Välkommen till hemsidan\\', -language=\\'sv\\');\n\t$lang_messages -> (insert: -key=\\'loggedin\\', -value=\\'You are logged in as #1# #2#\\', -language=\\'en\\');\n\t$lang_messages -> (insert: -key=\\'loggedin\\', -value=\\'Du är inloggad som #1# #2#\\', -language=\\'sv\\');\n\n\t// proper call, defaults to the browser\\'s preferred language\n\t$lang_messages -> (getstring: \\'welcome\\');\n\t// shorthand call\n\t$lang_messages -> welcome;\n\n\t// change language\n\t$lang_messages -> (setlanguage: \\'sv\\');\n\t$lang_messages -> welcome;\n\n\t// proper call with replacements\n\t$lang_messages -> (getstring: -key=\\'loggedin\\': -replace=(array: (field: \\'firstname\\'), (field: \\'lastname\\')));\n\n\t// shorthand call with replacements\n\t$lang_messages -> (loggedin: -replace=(array: (field: \\'firstname\\'), (field: \\'lastname\\')));\n\n\n','knop_form'='2011-02-28\tJS\t->addfield: Added -template to specify field specific template \n2010-11-22\tSP\t->init: Correction of -lockvalue handling after L9 syntax adjustment\n2010-07-18\tSP\tAdded support for series for -options\n2010-06-10\tJS\t->renderform: avoid adding -upload parameters to post forms since it conflicts with file uploads (found by Steve Piercy)\n2010-04-21\tJS\t->renderhtml: removed encode_html for label\n2010-03-06\tSP\tChanged default behavior of ->updatefields with -sql to add backticks between the table and column names. Now JOINs may be used.\n2010-03-06\tSP\tAdded ->updatefields with -removedotbackticks for backward compatibility for fields that contain periods. If you use periods in a fieldname then you cannot use a JOIN in Knop.\n2009-11-11\tJS\tAdded class and id to optiongroup div that surrounds for checkbox and radio\n2009-11-11\tJS\tCorrected id for checkbox and radio option labels\n2009-10-02\tJS\tAdded id for labels, auto generated from the field\\'s id with _label appended\n2009-09-16\tJS\tSyntax adjustments for Lasso 9\n2009-09-04\tJS\tChanged $__html_reply__ to content_body\n2009-09-04\tJS\t->renderhtml: corrected typ for autoparams\n2009-07-23\tJS\t->renderform: removed encode_html that somehow has reappeared for label. \n2009-07-10\tSP\tadded -maxlength option for text fields\n2009-06-26\tJS\t->oncreate: added deprecation warning for -action\n2009-06-22\tJS\t->addfield: corrected -options check to look for set instead of series (besides array)\n2009-04-16\tJS\t->loadfileds can now load field values from -params also inside an inline\n2009-03-20\tJS\tAdded around injected scripts for better xhtml compliance\n2009-01-08\tJS\t->getvalue and _unknowntag: added -index parameter to be able to get value for a specific field instance when there are multiple fields with the same name \n2009-01-08\tJS\t->loadfields: implemented support for multiple fields with the same name when loading field values from form submission where the number of same name fields matches\n2009-01-07\tJS\t->setvalue: added -index parameter to be able to set value for a specific field instance when there are multiple fields with the same name \n2008-12-08\tJS\t->renderform: Removed the onclick handlers for checkbox and radio since Safari now supports clicking the label text as click for the checkbox/radio control. \n2008-12-05\tJS\t->renderform: the fieldset and legend field types will now use id and class on the fieldset tag if specified\n2008-12-03\tJS\t->renderform: fields of type fieldset now uses value as legend (just as field type legend already did) instead of always using an empty legend\n2008-09-24\tJS\t->updatefields: Added protection against backtick sql injection in MySQL object names\n2008-09-17\tJS\t->renderform and ->renderhtml: -from and -to allows negative numbers to count from end of form instead\n2008-09-13\tJS\tAdded ->getlabel to return the display name for a field. \n2008-09-13\tJS\t->addfield and ->validate: Implemented -validate to specify a compound expression to validate the field input. \n2008-09-13\tJS\t->addfield and ->loadfields: Implemented -filter to specify a compound expression to filter the field input. \n2008-09-11\tJS\t->updatefields: fixed exclusion of special field types html, legend and fieldset. \n2008-09-11\tJS\t->renderform: Fixed missing value for password fields\n2008-07-02\tJS\t->renderform: Cleaned up the automatic adding of javascript code so it\\'s not added if not needed. Also moved all scripts to the end of the page. More work with with the javascripts is needed.\n2008-06-03\tJS\t->renderform: corrected missing closing \n2008-05-15\tJS\t->renderform and ->renderhtml: adjusted the behavior for nested fieldsets\n2008-05-13\tJS\tImplemented -legend for ->renderhtml, to make it consistent with the new legend field type\n2008-05-13\tJS\tImplemented special field types html, fieldset and legend. Use -value to display data for these fields. A legend field also creates a fieldset (closes any previously open fieldsets). Use fieldset with -value=false to close a fieldset without opening a new one. \n2008-05-06\tJS\tAdded unknowntag as shortcut to getvalue\n2008-01-30\tJS\tRemoved duplicate endscript entries for if(dirty) {makedirty()};\n2007-12-13\tJS\tCorrected ->addfield: -dbfield so empty dbfields are properly ignored by ->updatefields. \n2007-12-11\tJS\tMoved error_msg to knop_base (special version of error_code stays here) \n2007-12-11\tJS\tAdded documentation as -description to most member tags, to be used by the new ->help tag\n2007-12-11\tJS\tMoved ->help to knop_base\n2007-11-13\tJS\tAdded -buttontemplate to be able to specify separate template for buttons, defaults to no
, but if template has been specified that will be used instead (for backwards compatibility)\n2007-11-12\tJS\t->process delete now works also when not using record locking (not specifying -user)\n2007-11-01\tJS\t->renderform: added support for -hint for textarea fields.\n2007-09-27\tJS\t->renderhtml: multiple values (array) for radio, checkbox and select are now rendered properly with either \",\" or
depending on the presence of -linebreak, and with the display text instead of the actual option value\n2007-09-27\tJS\t->renderform: improved handling of multiple values for checkbox, radio and select\n2007-09-21\tJS\t->addfield: flag parameters now accept false as value\n2007-09-06\tJS\t->oncreate: changed name of -action to -formaction to make it more clear what it is. -action is still supported but deprecated.\n2007-09-06\tJS\t->renderform: Corrected the exception for -session... (duh)\n2007-08-08\tJS\t->renderform: Added exception for -session\n2007-06-18\tJS\tAdded tag timer to most member tags\n2007-06-13\tJS\tadded inheritance from knop_base\n2007-06-12\tJC\tbugfixed -xhtml form rendering when called by quicksearch\n2007-06-11\tJC\tadded handling of xhtml output\n2007-04-19\tJS\t->loadfields: fixed -params that was broken when adding -database\n2007-04-19\tJS\t->renderform: removed invalid wrap=\"soft\" from textarea\n2007-04-12\tJS\t->process: made -user optional (only needed when using record locking)\n2007-04-12\tJS ->loadfields can now take a -database parameter, either as a flag (no value) where the database object connected to the form will be used, or by specifying a database object as value. \n2007-04-03\tJS\tChanged namespace from mt_ to knop_\n2007-03-01\tJS\t->renderform fixed unsavedwarning on page load by moving checkdirty() to afterscript\n2007-03-01\tJS\t->formmode and ->init changed so it preserves the right mode after a failed add\n2007-02-27\tJS\t->renderform: added
around checkboxes and radios for css formating\n2007-02-26\tJS\t->oncreate: added -actionpath to specify the framework action path for the form instead of manually adding the -action hidden field\n2007-02-24\tJS\tCorrected entersubmitblock behavior by adding onfocus handler on form and starting with submitBlock=false\n2007-02-23\tJS\tRemoved encode_html from form field labels\n2007-02-22\tJS\t->setformat: Added -legend\n2007-02-07\tJS\tAdded ->copyfield to copy a form field to a new name, with the same properties. \n2007-02-07\tJS\t->errors now returns empty array if validate has not been called, instead of performing validation\n2007-02-05\tJS\t->getbutton can now look for also button names that are not one of the built-in ones (for example button_apply)\n2007-02-05\tJS The -keyvalue parameter can be given another name by specifying -keyparamname in oncreate\n2007-02-02\tJS\tAdded ->lockvalue_decrypted\n2007-02-02\tJS\t->addfield: -value is now stored as reference\n2007-02-02\tJS\terror_code now returns an error for when the form contains validation errors\n2007-02-02\tJS\tImproved reporting of Lasso error messaged in error_msg\n2007-02-02\tJS \tAdded real error codes\n2007-01-31\tJS\t->rederform action_params now also exclude \"-\" params that appear in the form action\n2007-01-29\tJS\t->renderform: The first field with input error will get focus when loading page\n2007-01-29\tJS\tAdded -focus to ->addfield to give default field focus when loading page with form\n2007-01-29\tJS\tAdded -disabled to ->addfield, and handling of it in ->renderform\n2007-01-29\tJS\tAdded -noautoparams to ->oncreate to disable the automatic passing of action_params that begin with \"-\"\n2007-01-29\tJS\t->renderform now renders label also for submit, reset to format properly with css\n2007-01-26\tJS\tAdded support for Safari specific \n2007-01-26\tJS\t->renderform action_params that begin with \"-\" now exclude params that exist in the form. Minor corrections to the behavior. \n2007-01-25\tJS\tAdded -nowarning to ->oncreate to disable unsaved warnings for the entire form\n2007-01-25\tJS\tAdded -required to ->oncreate (and a few more from ->setformat)\n2007-01-23\tJS\tAutogenerates id for the form itself\n2007-01-23\tJS\tAdded ->getbutton to return the button that was clicked when submitting a form (cancel, add, save, delete)\n2007-01-23\tJS\tAdded auto conversion of options left hand pair member to string, to make comparsions work reliably. Integer zeros don\\'t compare nicely to strings. \n2007-01-23\tJS\tAdded support for submit-on-enter prevention: specify -entersubmitblock at oncreate\n2007-01-19\tJS\tAddes renderform: -legend to be able to group form fields at render time\n2007-01-19\tJS\tadded support for -optgroup in -options for select. Also works for radio and checkbox. Specify empty -optgroup to close optgroup in select without starting a new, or to add extra linebreak between checkboxes/radio buttons. \n2007-01-19\tJS\tadded -template for oncreate\n2007-01-19\tJS\tadded optional fieldset and legend to form, legend can be specified as -legend at oncreate. if -legend is specified, the form will be wrapped in a fieldset. \n2007-01-19\tJS\tmethod now defaults to post\n2007-01-19\tJS\tCorrected line separator for FileMaker checkboxes and added the same handling also for radio\n2007-01-18\tJS\trenderform: any action_params that begin with \"-\" (except -keyvalue and -lockvalue) are added as form parameters\n2007-01-18\tJS\trenderform: checkboxes and multiselects now show checked and selected properly when loading values from database\n2007-01-18\tJS\tupdatefields: added support for multiple values for one fieldname, like checkboxes (multiple fields in the update pair array, -sql generates comma separated values)\n2007-01-17\tJS\treset button now makes form undirty\n2007-01-17\tJS\taddfield: -confirmmessage can now be specified for any submit or reset button\n2007-01-17\tJS\tadded addfield: -nowarning to avoid unsaved warning when the field is changed\n2007-01-17\tJS\tchanged default class name for unsaved marker from dirty to unsaved\n2007-01-17\tJS\tchanged name of -dirtymarker and -dirtymarkerclass to unsavedmarker and -unsavedmarkerclass for userfriendlyness\n2007-01-17\tJS\tadded setformat: -unsavedwarning to dynamically set the javascript form dirty warning message\n2007-01-17\tJS\trenderform: -field changed to renderform: -name for consistency\n2007-01-16\tJS\trenderform: -field with wrong field name does not output anything, instead of the entire form\n2007-01-16\tJS\tfixed onbeforeunload in javascript form dirty handler\n\nTODO:\n->addfield: Add -format to manipulate the field value before it is displayed by ->renderform and ->renderhtml, much like -filter but only for display and without affecting input. \n->addfield: Add -fieldgroup to be able to group related fields together, useful for ->updatefields to return just fields that belong to a specific db table, or ->renderform as another way to render a form selectively\n->renderform needs a better way to display errors inline together with the fields\nMake _unknowntag also work as shortcut to setvalue if a value is specified\nAdd a new special field type to the form object, let\\'s say \"data\". That field type will not interact with forms and will never be touched by loadfields, but it will populate ->updatefields.\nAdd -> searchfields, which will return a fulltext enabled pair array better suited for searchs than ->updatefields is. -fulltext needs to be specified per field. \nReview and clean up the javascripts inserted automatically by knop_form - partially done\nOption to let textarea grow automatically depending on the amount of text in it. \nUse http://bassistance.de/jquery-plugins/jquery-plugin-validation/ instead of client side validation\nPossibly add support for the same validation expressions as the jquery validation plugin uses, so server side a nd client side validation can be specified at once. \nAdd -path as parameter for oncreate so the form action can be set with less confusion... In that case -formaction will be a physical url, while -path would be a framework path. \nFix actionpath reference so it updates properly when altering the value (not possible?)\nShould loadfields load \"-\" params?\nUnsavedwarning made optional, does not seem to work properly now?\nMore flexible error hightlighting\nMove templates to a member tag to be make it easier to subclass (Douglas Burchard)\nAdd \"button\". . Subtypes are submit, reset and button. How to specify the subtype? (Douglas Burchard)\nChange ->addfield to ->insert and make ->addfield deprecated\nThere is no src for input type image!\nAdd ->size and ->get so the form object can be iterated\nAdd -skipemtpy to to ->renderhtml\nOption for -> renderhtml to output without html encoding\n->renderhtml should never html encode fields of type html\n\n',));\n\t\tif(local_defined('type'));return(#changenotes -> find(#type));else;\n\t\t!local_defined('date') ? local('date'=date('1900-01-01')) | #date = date(#date);\n\t\titerate(#changenotes, local('changenote'));\n\t\t\t#output += #changenote -> name + '\\n';\n\t\t\titerate(#changenote ->value -> split('\\n'), local('changenote_row'));\n\t\t\t\tif(date(#changenote_row -> split(regexp('\\\\s')) -> first) >= #date);\n\t\t\t\t\t#output += #changenote_row + '\\n';\n\t\t\t\t/if;\n\t\t\t/iterate;\n\t\t\t#output += '\\n';\n\t\t/iterate;\n\t\treturn(@#output);/if;\n\t\t/define_tag]" }, { "path": "src/test/resources/samples/langs/Latte/layout.latte", "content": "{**\n * @param string $basePath web base path\n * @param string $robots tell robots how to index the content of a page (optional)\n * @param array $flashes flash messages\n *}\n\n\n\n\t\n\t\n\t\n\t\n\t\n\t\n\n\t{ifset $title}{$title} › {/ifset}Translation report\n\n\t\n\t\n\t\n \n \n\t{block #head}{/block}\n\n\n\n\t\n\n\t{block #navbar}\n\t\t{include _navbar.latte}\n\t{/block}\n\n\t
\n\t\t
\n\t\t\t
\n\t\t\t\t{include _flash.latte, flash => $flash}\n\t\t\t
\n\t\t
\n\n\t\t{include #content}\n\t
\n\n\t
\n\t
\n\n\t\n\t{block #scripts}{/block}\n\n\n" }, { "path": "src/test/resources/samples/langs/Latte/template.latte", "content": "{var $title => \"⚐ {$new->title}\"}\n{define author}\n\t $author->id\" class=\"black\">\n\t\tavatar}\" width=\"32\" height=\"32\" class=\"img-rounded\">\n\t\t{$author->name|trim}\n\t\n\tshortName} translated on all videos.\">\n\t\t{$author->estimatedTimeTranslated|secondsToTime}{*\n\t*}{if $author->joined}, {/if}\n\t{if $author->joined}joined {$author->joined|timeAgo}{/if}{*\n\t*}{ifset $postfix}, {$postfix}{/ifset}\n{/define}\n{block #scripts}\n\t\n{/block}\n{block #content}\n\n{if isset($old)}\n\t

Diffing revision #{$old->revision} and #{$new->revision}

\n{else}\n\t

First revision

\n{/if}\n\n{var $editor = $user->loggedIn && $new->language === 'cs'}\n{var $rev = $new->video->siteRevision}\n
\n\t
\n\t\t

\n\t\t\tpublished {$new->publishedAt|timeAgo}{*\n\t\t\t*}{ifset $old},\n\t\t\t\t\n\t\t\t\t\t{$new->textChange * 100|number} % text change{*\n\t\t\t\t*}{*\n\t\t\t\t*}{if $new->timeChange},\n\t\t\t\t\t\n\t\t\t\t\t\t{$new->timeChange * 100|number} % timing change\n\t\t\t\t\t\n\t\t\t\t{/if}\n\t\t\t{/ifset}\n\t\t

\n\t\t{cache $new->id, expires => '+4 hours'}\n\t\t\t

\n\t\t\t\t{if isset($old) && $old->author->name !== $new->author->name}\n\t\t\t\t\t{include author, author => $old->author, class => 'author-old'}\n\t\t\t\t\t—\n\t\t\t\t\t{include author, author => $new->author, class => 'author-new'}\n\t\t\t\t{elseif isset($old)}\n\t\t\t\t\t{include author, author => $new->author, class => 'author-new', postfix => 'authored both revisions'}\n\t\t\t\t{else}\n\t\t\t\t\t{include author, author => $new->author, class => 'author-new'}\n\t\t\t\t{/if}\n\t\t\t

\n\t\t{/cache}\n\n\t\t{var $threshold = 10}\n\t\t{cache $new->id}\n\t\t\t{var $done = $new->timeTranslated}\n\t\t\t{var $outOf = $new->video->canonicalTimeTranslated}\n\t\t\t{if $outOf}\n\t\t\t\t

$done + $threshold\" class=\"alert alert-warning\">\n\t\t\t\t\tOnly {$done|time} translated out of {$outOf|time},\n\t\t\t\t\t{(1-$done/$outOf) * 100|number} % ({$outOf - $done|time}) left\n\t\t\t\t

\n\t\t\t\t

\n\t\t\t\t\tSeems complete: {$done|time} translated out of {$outOf|time}\n\t\t\t\t

\n\t\t\t{elseif $done}\n\t\t\t\t

\n\t\t\t\t\tAlthough {$done|time} is translated, there are no English subtitles for comparison.\n\t\t\t\t

\n\t\t\t{/if}\n\t\t{/cache}\n\n\t\t{if $editor}\n\t\t\t{var $ksid = $new->video->siteId}\n\t\t\t{if $ksid}\n\t\t\t\t\n\t\t\t\t\tVideo on khanovaskola.cz\n\t\t\t\t\t{if $new->revision === $rev}\n\t\t\t\t\t\t(on this revision)\n\t\t\t\t\t{elseif $new->revision > $rev}\n\t\t\t\t\t\t(on older revision #{$rev})\n\t\t\t\t\t{else}\n\t\t\t\t\t\t(on newer revision #{$rev})\n\t\t\t\t\t{/if}\n\t\t\t\t\n\t\t\t{/if}\n\t\t{/if}\n\n\t\t

{$diffs->title|noescape}

\n\t\t
{$diffs->description|noescape}
\n\t\t
\n\t\t\t
text as $line\" class=\"line\" data-context=\"{$line->context}\">\n\t\t\t\t{$line->text|noescape} \n\t\t\t
\n\t\t\t
\n\t\t\t\t\n\t\t\t\t\t \n\t\t\t\t\n\t\t\t
\n\t\t
\n\n\t\t{if $editor}\n\t\t\t{if $new->approved}\n\t\t\t\t\n\t\t\t\t\tRevision has been approved{if $new->editor} by {$new->editor->name}{/if}.\n\t\t\t\t\n\t\t\t\t $new->video->amaraId\" n:block=\"editButton\" class=\"btn btn-default\">\n\t\t\t\t\t\n\t\t\t\t\tEdit on Amara\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\ton Khan Academy\n\t\t\t\t\n\n\t\t\t{elseif $new->incomplete}\n\t\t\t\t\n\t\t\t\t\tRevision has been marked as incomplete by {if $new->editor}{$new->editor->name}{/if}.\n\t\t\t\t\n\t\t\t\t{include editButton}\n\t\t\t\t{include kaButton}\n\n\t\t\t{* else $new->status === UNSET: *}\n\t\t\t{elseif $new->video->siteId}\n\t\t\t\t
\n\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\tApprove (update kš)\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\tMark as incomplete\n\t\t\t\t\t\n\t\t\t\t\t{include editButton}\n\t\t\t\t
\n\t\t\t\t{include kaButton}\n\n\t\t\t{else}\n\t\t\t\t
\n\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\tApprove (add to kš)\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\tMark as incomplete\n\t\t\t\t\t\n\t\t\t\t\t{include editButton}\n\t\t\t\t
\n\t\t\t\t{include kaButton}\n\t\t\t\t
\n\t\t\t\t\t
Filed under category:
\n\t\t\t\t\t{foreach $new->video->categories as $list}\n\t\t\t\t\t\t— {$list|implode:' › '}{sep}
{/sep}\n\t\t\t\t\t{/foreach}\n\t\t\t\t
\n\t\t\t{/if}\n\t\t{/if}\n\t
\n\t
\n\t\t

All revisions:

\n\t\t\n\t\t\t{foreach $new->video->getRevisionsIn($new->language) as $revision}\n\t\t\t\trevision === $new->revision ? 'active'\">\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t{if $user->loggedIn && $revision->comments->count()}\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\t\n\t\t\t\t\t{/if}\n\t\t\t\t\t{if $user->loggedIn && $new->id === $revision->id}\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\t\n\t\t\t\t\t{/if}\n\t\t\t\t\n\t\t\t{/foreach}\n\t\t
\n\t\t\t\t\t\t $revision->id\">#{$revision->revision}\n\t\t\t\t\t\n\t\t\t\t\t\t $revision->author->id\" class=\"black\">\n\t\t\t\t\t\t\tauthor->avatar}\" width=\"32\" height=\"32\" class=\"img-rounded\">\n\t\t\t\t\t\t\t{$revision->author->name}\n\t\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\t{$revision->publishedAt|timeAgo}\n\t\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\t{* vars $outOf, $threshold already set *}\n\t\t\t\t\t\t{default $outOf = $new->video->canonicalTimeTranslated}\n\t\t\t\t\t\t{if $outOf} {* ignore if canonical time not set *}\n\t\t\t\t\t\t\t{var $done = $revision->timeTranslated}\n\t\t\t\t\t\t\t $done + $threshold\" class=\"text-warning\"\n\t\t\t\t\t\t\t\tdata-toggle=\"tooltip\" title=\"Percent of lines translated\">\n\t\t\t\t\t\t\t\t{$done/$outOf * 100|number} %\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t~100 %\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t{/if}\n\t\t\t\t\t\n\t\t\t\t\t\t{if $revision->incomplete || $revision->approved}\n\t\t\t\t\t\t\t{var $i = $revision->incomplete}\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t{if $i}incomplete{else}approved{/if}\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t{/if}\n\t\t\t\t\t
\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\tcomments as $comment\">\n\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t
\n\t\t\t\t\t\t\t\t\t\t\tcreatedAt|timeAgo}\">\n\t\t\t\t\t\t\t\t\t\t\t\t{$comment->user->name}:\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\t{$comment->text}\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t\t\t\t\t\t{form commentForm}\n\t\t\t\t\t\t\t\t\t
\n\t\t\t\t\t\t\t\t\t\t{input text, class => \"form-control\", placeholder => \"Comment this revision (only visible to other editors)\"}\n\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t
\n\t\t\t\t\t\t\t\t{/form}\n\t\t\t\t\t\t\t
\n\n\t
\n
\n" }, { "path": "src/test/resources/samples/langs/Lean/binary.lean", "content": "/-\nCopyright (c) 2014 Microsoft Corporation. All rights reserved.\nReleased under Apache 2.0 license as described in the file LICENSE.\n\nModule: algebra.binary\nAuthors: Leonardo de Moura, Jeremy Avigad\n\nGeneral properties of binary operations.\n-/\n\nimport logic.eq\nopen eq.ops\n\nnamespace binary\n section\n variable {A : Type}\n variables (op₁ : A → A → A) (inv : A → A) (one : A)\n\n local notation a * b := op₁ a b\n local notation a ⁻¹ := inv a\n local notation 1 := one\n\n definition commutative := ∀a b, a * b = b * a\n definition associative := ∀a b c, (a * b) * c = a * (b * c)\n definition left_identity := ∀a, 1 * a = a\n definition right_identity := ∀a, a * 1 = a\n definition left_inverse := ∀a, a⁻¹ * a = 1\n definition right_inverse := ∀a, a * a⁻¹ = 1\n definition left_cancelative := ∀a b c, a * b = a * c → b = c\n definition right_cancelative := ∀a b c, a * b = c * b → a = c\n\n definition inv_op_cancel_left := ∀a b, a⁻¹ * (a * b) = b\n definition op_inv_cancel_left := ∀a b, a * (a⁻¹ * b) = b\n definition inv_op_cancel_right := ∀a b, a * b⁻¹ * b = a\n definition op_inv_cancel_right := ∀a b, a * b * b⁻¹ = a\n\n variable (op₂ : A → A → A)\n\n local notation a + b := op₂ a b\n\n definition left_distributive := ∀a b c, a * (b + c) = a * b + a * c\n definition right_distributive := ∀a b c, (a + b) * c = a * c + b * c\n end\n\n context\n variable {A : Type}\n variable {f : A → A → A}\n variable H_comm : commutative f\n variable H_assoc : associative f\n infixl `*` := f\n theorem left_comm : ∀a b c, a*(b*c) = b*(a*c) :=\n take a b c, calc\n a*(b*c) = (a*b)*c : H_assoc\n ... = (b*a)*c : H_comm\n ... = b*(a*c) : H_assoc\n\n theorem right_comm : ∀a b c, (a*b)*c = (a*c)*b :=\n take a b c, calc\n (a*b)*c = a*(b*c) : H_assoc\n ... = a*(c*b) : H_comm\n ... = (a*c)*b : H_assoc\n end\n\n context\n variable {A : Type}\n variable {f : A → A → A}\n variable H_assoc : associative f\n infixl `*` := f\n theorem assoc4helper (a b c d) : (a*b)*(c*d) = a*((b*c)*d) :=\n calc\n (a*b)*(c*d) = a*(b*(c*d)) : H_assoc\n ... = a*((b*c)*d) : H_assoc\n end\n\nend binary\n" }, { "path": "src/test/resources/samples/langs/Lean/set.hlean", "content": "-- Copyright (c) 2015 Jakob von Raumer. All rights reserved.\n-- Released under Apache 2.0 license as described in the file LICENSE.\n-- Authors: Jakob von Raumer\n-- Category of sets\n\nimport .basic types.pi trunc\n\nopen truncation sigma sigma.ops pi function eq morphism precategory\nopen equiv\n\nnamespace precategory\n\n universe variable l\n\n definition set_precategory : precategory.{l+1 l} (Σ (A : Type.{l}), is_hset A) :=\n begin\n fapply precategory.mk.{l+1 l},\n intros, apply (a.1 → a_1.1),\n intros, apply trunc_pi, intros, apply b.2,\n intros, intro x, exact (a_1 (a_2 x)),\n intros, exact (λ (x : a.1), x),\n intros, apply funext.path_pi, intro x, apply idp,\n intros, apply funext.path_pi, intro x, apply idp,\n intros, apply funext.path_pi, intro x, apply idp,\n end\n\nend precategory\n\nnamespace category\n\n universe variable l\n local attribute precategory.set_precategory.{l+1 l} [instance]\n\n definition set_category_equiv_iso (a b : (Σ (A : Type.{l}), is_hset A))\n : (a ≅ b) = (a.1 ≃ b.1) :=\n /-begin\n apply ua, fapply equiv.mk,\n intro H,\n apply (isomorphic.rec_on H), intros (H1, H2),\n apply (is_iso.rec_on H2), intros (H3, H4, H5),\n fapply equiv.mk,\n apply (isomorphic.rec_on H), intros (H1, H2),\n exact H1,\n fapply is_equiv.adjointify, exact H3,\n exact sorry,\n exact sorry,\n end-/ sorry\n\n definition set_category : category.{l+1 l} (Σ (A : Type.{l}), is_hset A) :=\n /-begin\n assert (C : precategory.{l+1 l} (Σ (A : Type.{l}), is_hset A)),\n apply precategory.set_precategory,\n apply category.mk,\n assert (p : (λ A B p, (set_category_equiv_iso A B) ▹ iso_of_path p) = (λ A B p, @equiv_path A.1 B.1 p)),\n apply is_equiv.adjointify,\n intros,\n apply (isomorphic.rec_on a_1), intros (iso', is_iso'),\n apply (is_iso.rec_on is_iso'), intros (f', f'sect, f'retr),\n fapply sigma.path,\n apply ua, fapply equiv.mk, exact iso',\n fapply is_equiv.adjointify,\n exact f',\n intros, apply (f'retr ▹ _),\n intros, apply (f'sect ▹ _),\n apply (@is_hprop.elim),\n apply is_trunc_is_hprop,\n intros,\n end -/ sorry\n\nend category\n" }, { "path": "src/test/resources/samples/langs/Less/screen.less", "content": "@blue: #3bbfce;\n@margin: 16px;\n\n.content-navigation {\n border-color: @blue;\n color:\n darken(@blue, 9%);\n}\n\n.border {\n padding: @margin / 2;\n margin: @margin / 2;\n border-color: @blue;\n}\n" }, { "path": "src/test/resources/samples/langs/Lex/zend_ini_scanner.l", "content": "/*\n +----------------------------------------------------------------------+\n | Zend Engine |\n +----------------------------------------------------------------------+\n | Copyright (c) 1998-2012 Zend Technologies Ltd. (http://www.zend.com) |\n +----------------------------------------------------------------------+\n | This source file is subject to version 2.00 of the Zend license, |\n | that is bundled with this package in the file LICENSE, and is |\n | available through the world-wide-web at the following url: |\n | http://www.zend.com/license/2_00.txt. |\n | If you did not receive a copy of the Zend license and are unable to |\n | obtain it through the world-wide-web, please send a note to |\n | license@zend.com so we can mail you a copy immediately. |\n +----------------------------------------------------------------------+\n | Authors: Zeev Suraski |\n | Jani Taskinen |\n | Marcus Boerger |\n | Nuno Lopes |\n | Scott MacVicar |\n +----------------------------------------------------------------------+\n*/\n\n/* $Id$ */\n\n#include \n#include \"zend.h\"\n#include \"zend_globals.h\"\n#include \n#include \"zend_ini_scanner.h\"\n\n#if 0\n# define YYDEBUG(s, c) printf(\"state: %d char: %c\\n\", s, c)\n#else\n# define YYDEBUG(s, c)\n#endif\n\n#include \"zend_ini_scanner_defs.h\"\n\n#define YYCTYPE unsigned char\n/* allow the scanner to read one null byte after the end of the string (from ZEND_MMAP_AHEAD)\n * so that if will be able to terminate to match the current token (e.g. non-enclosed string) */\n#define YYFILL(n) { if (YYCURSOR > YYLIMIT) return 0; }\n#define YYCURSOR SCNG(yy_cursor)\n#define YYLIMIT SCNG(yy_limit)\n#define YYMARKER SCNG(yy_marker)\n\n#define YYGETCONDITION() SCNG(yy_state)\n#define YYSETCONDITION(s) SCNG(yy_state) = s\n\n#define STATE(name) yyc##name\n\n/* emulate flex constructs */\n#define BEGIN(state) YYSETCONDITION(STATE(state))\n#define YYSTATE YYGETCONDITION()\n#define yytext ((char*)SCNG(yy_text))\n#define yyleng SCNG(yy_leng)\n#define yyless(x) do {\tYYCURSOR = (unsigned char*)yytext + x; \\\n\t\t\t\t\t\t\tyyleng = (unsigned int)x; } while(0)\n\n/* #define yymore() goto yymore_restart */\n\n/* perform sanity check. If this message is triggered you should\n increase the ZEND_MMAP_AHEAD value in the zend_streams.h file */\n/*!max:re2c */\n#if ZEND_MMAP_AHEAD < (YYMAXFILL + 1)\n# error ZEND_MMAP_AHEAD should be greater than YYMAXFILL\n#endif\n\n\n/* How it works (for the core ini directives):\n * ===========================================\n *\n * 1. Scanner scans file for tokens and passes them to parser.\n * 2. Parser parses the tokens and passes the name/value pairs to the callback\n * function which stores them in the configuration hash table.\n * 3. Later REGISTER_INI_ENTRIES() is called which triggers the actual\n * registering of ini entries and uses zend_get_configuration_directive()\n * to fetch the previously stored name/value pair from configuration hash table\n * and registers the static ini entries which match the name to the value\n * into EG(ini_directives) hash table.\n * 4. PATH section entries are used per-request from down to top, each overriding\n * previous if one exists. zend_alter_ini_entry() is called for each entry.\n * Settings in PATH section are ZEND_INI_SYSTEM accessible and thus mimics the\n * php_admin_* directives used within Apache httpd.conf when PHP is compiled as\n * module for Apache.\n * 5. User defined ini files (like .htaccess for apache) are parsed for each request and\n * stored in separate hash defined by SAPI.\n */\n\n/* TODO: (ordered by importance :-)\n * ===============================================================================\n *\n * - Separate constant lookup totally from plain strings (using CONSTANT pattern)\n * - Add #if .. #else .. #endif and ==, !=, <, > , <=, >= operators\n * - Add #include \"some.ini\"\n * - Allow variables to refer to options also when using parse_ini_file()\n *\n */\n\n/* Globals Macros */\n#define SCNG\tINI_SCNG\n#ifdef ZTS\nZEND_API ts_rsrc_id ini_scanner_globals_id;\n#else\nZEND_API zend_ini_scanner_globals ini_scanner_globals;\n#endif\n\n/* Eat leading whitespace */\n#define EAT_LEADING_WHITESPACE() \\\n\twhile (yytext[0]) { \\\n\t\tif (yytext[0] == ' ' || yytext[0] == '\\t') { \\\n\t\t\tSCNG(yy_text)++; \\\n\t\t\tyyleng--; \\\n\t\t} else { \\\n\t\t\tbreak; \\\n\t\t} \\\n\t}\n\n/* Eat trailing whitespace + extra char */\n#define EAT_TRAILING_WHITESPACE_EX(ch) \\\n\twhile (yyleng > 0 && ( \\\n\t\t(ch != 'X' && yytext[yyleng - 1] == ch) || \\\n\t\tyytext[yyleng - 1] == '\\n' || \\\n\t\tyytext[yyleng - 1] == '\\r' || \\\n\t\tyytext[yyleng - 1] == '\\t' || \\\n\t\tyytext[yyleng - 1] == ' ') \\\n\t) { \\\n\t\tyyleng--; \\\n\t}\n\n/* Eat trailing whitespace */\n#define EAT_TRAILING_WHITESPACE()\tEAT_TRAILING_WHITESPACE_EX('X')\n\n#define zend_ini_copy_value(retval, str, len) { \\\n\tZ_STRVAL_P(retval) = zend_strndup(str, len); \\\n\tZ_STRLEN_P(retval) = len; \\\n\tZ_TYPE_P(retval) = IS_STRING; \\\n}\n\n#define RETURN_TOKEN(type, str, len) { \\\n\tzend_ini_copy_value(ini_lval, str, len); \\\n\treturn type; \\\n}\n\nstatic void _yy_push_state(int new_state TSRMLS_DC)\n{\n\tzend_stack_push(&SCNG(state_stack), (void *) &YYGETCONDITION(), sizeof(int));\n\tYYSETCONDITION(new_state);\n}\n\n#define yy_push_state(state_and_tsrm) _yy_push_state(yyc##state_and_tsrm)\n\nstatic void yy_pop_state(TSRMLS_D)\n{\n\tint *stack_state;\n\tzend_stack_top(&SCNG(state_stack), (void **) &stack_state);\n\tYYSETCONDITION(*stack_state);\n\tzend_stack_del_top(&SCNG(state_stack));\n}\n\nstatic void yy_scan_buffer(char *str, unsigned int len TSRMLS_DC)\n{\n\tYYCURSOR = (YYCTYPE*)str;\n\tSCNG(yy_start) = YYCURSOR;\n\tYYLIMIT = YYCURSOR + len;\n}\n\n#define ini_filename SCNG(filename)\n\n/* {{{ init_ini_scanner()\n*/\nstatic int init_ini_scanner(int scanner_mode, zend_file_handle *fh TSRMLS_DC)\n{\n\t/* Sanity check */\n\tif (scanner_mode != ZEND_INI_SCANNER_NORMAL && scanner_mode != ZEND_INI_SCANNER_RAW) {\n\t\tzend_error(E_WARNING, \"Invalid scanner mode\");\n\t\treturn FAILURE;\n\t}\n\n\tSCNG(lineno) = 1;\n\tSCNG(scanner_mode) = scanner_mode;\n\tSCNG(yy_in) = fh;\n\n\tif (fh != NULL) {\n\t\tini_filename = zend_strndup(fh->filename, strlen(fh->filename));\n\t} else {\n\t\tini_filename = NULL;\n\t}\n\n\tzend_stack_init(&SCNG(state_stack));\n\tBEGIN(INITIAL);\n\n\treturn SUCCESS;\n}\n/* }}} */\n\n/* {{{ shutdown_ini_scanner()\n*/\nvoid shutdown_ini_scanner(TSRMLS_D)\n{\n\tzend_stack_destroy(&SCNG(state_stack));\n\tif (ini_filename) {\n\t\tfree(ini_filename);\n\t}\n}\n/* }}} */\n\n/* {{{ zend_ini_scanner_get_lineno()\n*/\nint zend_ini_scanner_get_lineno(TSRMLS_D)\n{\n\treturn SCNG(lineno);\n}\n/* }}} */\n\n/* {{{ zend_ini_scanner_get_filename()\n*/\nchar *zend_ini_scanner_get_filename(TSRMLS_D)\n{\n\treturn ini_filename ? ini_filename : \"Unknown\";\n}\n/* }}} */\n\n/* {{{ zend_ini_open_file_for_scanning()\n*/\nint zend_ini_open_file_for_scanning(zend_file_handle *fh, int scanner_mode TSRMLS_DC)\n{\n\tchar *buf;\n\tsize_t size;\n\n\tif (zend_stream_fixup(fh, &buf, &size TSRMLS_CC) == FAILURE) {\n\t\treturn FAILURE;\n\t}\n\n\tif (init_ini_scanner(scanner_mode, fh TSRMLS_CC) == FAILURE) {\n\t\tzend_file_handle_dtor(fh TSRMLS_CC);\n\t\treturn FAILURE;\n\t}\n\n\tyy_scan_buffer(buf, size TSRMLS_CC);\n\n\treturn SUCCESS;\n}\n/* }}} */\n\n/* {{{ zend_ini_prepare_string_for_scanning()\n*/\nint zend_ini_prepare_string_for_scanning(char *str, int scanner_mode TSRMLS_DC)\n{\n\tint len = strlen(str);\n\n\tif (init_ini_scanner(scanner_mode, NULL TSRMLS_CC) == FAILURE) {\n\t\treturn FAILURE;\n\t}\n\n\tyy_scan_buffer(str, len TSRMLS_CC);\n\n\treturn SUCCESS;\n}\n/* }}} */\n\n/* {{{ zend_ini_escape_string()\n */\nstatic void zend_ini_escape_string(zval *lval, char *str, int len, char quote_type TSRMLS_DC)\n{\n\tregister char *s, *t;\n\tchar *end;\n\n\tzend_ini_copy_value(lval, str, len);\n\n\t/* convert escape sequences */\n\ts = t = Z_STRVAL_P(lval);\n\tend = s + Z_STRLEN_P(lval);\n\n\twhile (s < end) {\n\t\tif (*s == '\\\\') {\n\t\t\ts++;\n\t\t\tif (s >= end) {\n\t\t\t\t*t++ = '\\\\';\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tswitch (*s) {\n\t\t\t\tcase '\"':\n\t\t\t\t\tif (*s != quote_type) {\n\t\t\t\t\t\t*t++ = '\\\\';\n\t\t\t\t\t\t*t++ = *s;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\tcase '\\\\':\n\t\t\t\tcase '$':\n\t\t\t\t\t*t++ = *s;\n\t\t\t\t\tZ_STRLEN_P(lval)--;\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\t*t++ = '\\\\';\n\t\t\t\t\t*t++ = *s;\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t} else {\n\t\t\t*t++ = *s;\n\t\t}\n\t\tif (*s == '\\n' || (*s == '\\r' && (*(s+1) != '\\n'))) {\n\t\t\tSCNG(lineno)++;\n\t\t}\n\t\ts++;\n\t}\n\t*t = 0;\n}\n/* }}} */\n\nint ini_lex(zval *ini_lval TSRMLS_DC)\n{\nrestart:\n\tSCNG(yy_text) = YYCURSOR;\n\n/* yymore_restart: */\n\t/* detect EOF */\n\tif (YYCURSOR >= YYLIMIT) {\n\t\tif (YYSTATE == STATE(ST_VALUE) || YYSTATE == STATE(ST_RAW)) {\n\t\t\tBEGIN(INITIAL);\n\t\t\treturn END_OF_LINE;\n\t\t}\n\t\treturn 0;\n\t}\n\n\t/* Eat any UTF-8 BOM we find in the first 3 bytes */\n\tif (YYCURSOR == SCNG(yy_start) && YYCURSOR + 3 < YYLIMIT) {\n\t\tif (memcmp(YYCURSOR, \"\\xef\\xbb\\xbf\", 3) == 0) {\n\t\t\tYYCURSOR += 3;\n\t\t\tgoto restart;\n\t\t}\n\t}\n/*!re2c\nre2c:yyfill:check = 0;\nLNUM [0-9]+\nDNUM ([0-9]*[\\.][0-9]+)|([0-9]+[\\.][0-9]*)\nNUMBER [-]?{LNUM}|{DNUM}\nANY_CHAR (.|[\\n\\t])\nNEWLINE\t(\"\\r\"|\"\\n\"|\"\\r\\n\")\nTABS_AND_SPACES [ \\t]\nWHITESPACE [ \\t]+\nCONSTANT [a-zA-Z_][a-zA-Z0-9_]*\nLABEL [^=\\n\\r\\t;|&$~(){}!\"\\[]+\nTOKENS [:,.\\[\\]\"'()|^&+-/*=%$!~<>?@{}]\nOPERATORS [&|~()!]\nDOLLAR_CURLY \"${\"\n\nSECTION_RAW_CHARS [^\\]\\n\\r]\nSINGLE_QUOTED_CHARS [^']\nRAW_VALUE_CHARS [^\"\\n\\r;\\000]\n\nLITERAL_DOLLAR (\"$\"([^{\\000]|(\"\\\\\"{ANY_CHAR})))\nVALUE_CHARS ([^$= \\t\\n\\r;&|~()!\"'\\000]|{LITERAL_DOLLAR})\nSECTION_VALUE_CHARS ([^$\\n\\r;\"'\\]\\\\]|(\"\\\\\"{ANY_CHAR})|{LITERAL_DOLLAR})\n\n := yyleng = YYCURSOR - SCNG(yy_text);\n\n\"[\" { /* Section start */\n\t/* Enter section data lookup state */\n\tif (SCNG(scanner_mode) == ZEND_INI_SCANNER_RAW) {\n\t\tyy_push_state(ST_SECTION_RAW TSRMLS_CC);\n\t} else {\n\t\tyy_push_state(ST_SECTION_VALUE TSRMLS_CC);\n\t}\n\treturn TC_SECTION;\n}\n\n\"'\"{SINGLE_QUOTED_CHARS}+\"'\" { /* Raw string */\n\t/* Eat leading and trailing single quotes */\n\tif (yytext[0] == '\\'' && yytext[yyleng - 1] == '\\'') {\n\t\tSCNG(yy_text)++;\n\t\tyyleng = yyleng - 2;\n\t}\n\tRETURN_TOKEN(TC_RAW, yytext, yyleng);\n}\n\n\"]\"{TABS_AND_SPACES}*{NEWLINE}? { /* End of section */\n\tBEGIN(INITIAL);\n\tSCNG(lineno)++;\n\treturn ']';\n}\n\n{LABEL}\"[\"{TABS_AND_SPACES}* { /* Start of option with offset */\n\t/* Eat leading whitespace */\n\tEAT_LEADING_WHITESPACE();\n\t\n\t/* Eat trailing whitespace and [ */\n\tEAT_TRAILING_WHITESPACE_EX('[');\n\n\t/* Enter offset lookup state */\n\tyy_push_state(ST_OFFSET TSRMLS_CC);\n\n\tRETURN_TOKEN(TC_OFFSET, yytext, yyleng);\n}\n\n{TABS_AND_SPACES}*\"]\" { /* End of section or an option offset */\n\tBEGIN(INITIAL);\n\treturn ']';\n}\n\n{DOLLAR_CURLY} { /* Variable start */\n\tyy_push_state(ST_VARNAME TSRMLS_CC);\n\treturn TC_DOLLAR_CURLY;\n}\n\n{LABEL} { /* Variable name */\n\t/* Eat leading whitespace */\n\tEAT_LEADING_WHITESPACE();\n\n\t/* Eat trailing whitespace */\n\tEAT_TRAILING_WHITESPACE();\n\n\tRETURN_TOKEN(TC_VARNAME, yytext, yyleng);\n}\n\n\"}\" { /* Variable end */\n\tyy_pop_state(TSRMLS_C);\n\treturn '}';\n}\n\n(\"true\"|\"on\"|\"yes\"){TABS_AND_SPACES}* { /* TRUE value (when used outside option value/offset this causes parse error!) */\n\tRETURN_TOKEN(BOOL_TRUE, \"1\", 1);\n}\n\n(\"false\"|\"off\"|\"no\"|\"none\"|\"null\"){TABS_AND_SPACES}* { /* FALSE value (when used outside option value/offset this causes parse error!)*/\n\tRETURN_TOKEN(BOOL_FALSE, \"\", 0);\n}\n\n{LABEL} { /* Get option name */\n\t/* Eat leading whitespace */\n\tEAT_LEADING_WHITESPACE();\n\n\t/* Eat trailing whitespace */\n\tEAT_TRAILING_WHITESPACE();\n\n\tRETURN_TOKEN(TC_LABEL, yytext, yyleng);\n}\n\n{TABS_AND_SPACES}*[=]{TABS_AND_SPACES}* { /* Start option value */\n\tif (SCNG(scanner_mode) == ZEND_INI_SCANNER_RAW) {\n\t\tyy_push_state(ST_RAW TSRMLS_CC);\n\t} else {\n\t\tyy_push_state(ST_VALUE TSRMLS_CC);\n\t}\n\treturn '=';\n}\n\n[\"] {\n\twhile (YYCURSOR < YYLIMIT) {\n\t\tswitch (*YYCURSOR++) {\n\t\t\tcase '\\n':\n\t\t\t\tSCNG(lineno)++;\n\t\t\t\tbreak;\n\t\t\tcase '\\r':\n\t\t\t\tif (*YYCURSOR != '\\n') {\n\t\t\t\t\tSCNG(lineno)++;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase '\"':\n\t\t\t\tyyleng = YYCURSOR - SCNG(yy_text) - 2;\n\t\t\t\tSCNG(yy_text)++;\n\t\t\t\tRETURN_TOKEN(TC_RAW, yytext, yyleng);\n\t\t\tcase '\\\\':\n\t\t\t\tif (YYCURSOR < YYLIMIT) {\n\t\t\t\t\tYYCURSOR++;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t}\n\t}\n\tyyleng = YYCURSOR - SCNG(yy_text);\n\tRETURN_TOKEN(TC_RAW, yytext, yyleng);\n}\n\n{RAW_VALUE_CHARS}+ { /* Raw value, only used when SCNG(scanner_mode) == ZEND_INI_SCANNER_RAW. */\n\tRETURN_TOKEN(TC_RAW, yytext, yyleng);\n}\n\n{SECTION_RAW_CHARS}+ { /* Raw value, only used when SCNG(scanner_mode) == ZEND_INI_SCANNER_RAW. */\n\tRETURN_TOKEN(TC_RAW, yytext, yyleng);\n}\n\n{TABS_AND_SPACES}*{NEWLINE} { /* End of option value */\n\tBEGIN(INITIAL);\n\tSCNG(lineno)++;\n\treturn END_OF_LINE;\n}\n\n{CONSTANT} { /* Get constant option value */\n\tRETURN_TOKEN(TC_CONSTANT, yytext, yyleng);\n}\n\n{NUMBER} { /* Get number option value as string */\n\tRETURN_TOKEN(TC_NUMBER, yytext, yyleng);\n}\n\n{TOKENS} { /* Disallow these chars outside option values */\n\treturn yytext[0];\n}\n\n{OPERATORS}{TABS_AND_SPACES}* { /* Boolean operators */\n\treturn yytext[0];\n}\n\n[=] { /* Make = used in option value to trigger error */\n\tyyless(0);\n\tBEGIN(INITIAL);\n\treturn END_OF_LINE;\n}\n\n{VALUE_CHARS}+ { /* Get everything else as option/offset value */\n\tRETURN_TOKEN(TC_STRING, yytext, yyleng);\n}\n\n{SECTION_VALUE_CHARS}+ { /* Get rest as section/offset value */\n\tRETURN_TOKEN(TC_STRING, yytext, yyleng);\n}\n\n{TABS_AND_SPACES}*[\"] { /* Double quoted '\"' string start */\n\tyy_push_state(ST_DOUBLE_QUOTES TSRMLS_CC);\n\treturn '\"';\n}\n\n[\"]{TABS_AND_SPACES}* { /* Double quoted '\"' string ends */\n\tyy_pop_state(TSRMLS_C);\n\treturn '\"';\n}\n\n[^] { /* Escape double quoted string contents */\n\tif (YYCURSOR > YYLIMIT) {\n\t\treturn 0;\n\t}\n\t\n\twhile (YYCURSOR < YYLIMIT) {\n\t\tswitch (*YYCURSOR++) {\n\t\t\tcase '\"':\n\t\t\t\tif (YYCURSOR < YYLIMIT && YYCURSOR[-2] == '\\\\' && *YYCURSOR != '\\r' && *YYCURSOR != '\\n') {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase '$':\n\t\t\t\tif (*YYCURSOR == '{') {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\tcase '\\\\':\n\t\t\t\tif (YYCURSOR < YYLIMIT && *YYCURSOR != '\"') {\n\t\t\t\t\tYYCURSOR++;\n\t\t\t\t}\n\t\t\t\t/* fall through */\n\t\t\tdefault:\n\t\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tYYCURSOR--;\n\t\tbreak;\n\t}\n\n\tyyleng = YYCURSOR - SCNG(yy_text);\n\t\n\tzend_ini_escape_string(ini_lval, yytext, yyleng, '\"' TSRMLS_CC);\n\treturn TC_QUOTED_STRING;\n}\n\n{WHITESPACE} {\n\tRETURN_TOKEN(TC_WHITESPACE, yytext, yyleng);\n}\n\n{TABS_AND_SPACES}+ {\n\t/* eat whitespace */\n\tgoto restart;\n}\n\n{TABS_AND_SPACES}*{NEWLINE} {\n\tSCNG(lineno)++;\n\treturn END_OF_LINE;\n}\n\n{TABS_AND_SPACES}*[;][^\\r\\n]*{NEWLINE} { /* Comment */\n\tBEGIN(INITIAL);\n\tSCNG(lineno)++;\n\treturn END_OF_LINE;\n}\n\n{TABS_AND_SPACES}*[#][^\\r\\n]*{NEWLINE} { /* #Comment */\n\tzend_error(E_DEPRECATED, \"Comments starting with '#' are deprecated in %s on line %d\", zend_ini_scanner_get_filename(TSRMLS_C), SCNG(lineno));\n\tBEGIN(INITIAL);\n\tSCNG(lineno)++;\n\treturn END_OF_LINE;\n}\n\n[^] { /* End of option value (if EOF is reached before EOL */\n\tBEGIN(INITIAL);\n\treturn END_OF_LINE;\n}\n\n<*>[^] {\n\treturn 0;\n}\n\n*/\n}\n" }, { "path": "src/test/resources/samples/langs/Limbo/cat.b", "content": "implement Cat;\n\ninclude \"sys.m\";\n\tsys: Sys;\n\ninclude \"draw.m\";\n\nCat: module\n{\n\tinit:\tfn(ctxt: ref Draw->Context, argv: list of string);\n};\n\nstdout: ref Sys->FD;\n\ninit(nil: ref Draw->Context, args: list of string)\n{\n\tsys = load Sys Sys->PATH;\n\tstdout = sys->fildes(1);\n\targs = tl args;\n\tif(args == nil)\n\t\targs = \"-\" :: nil;\n\tfor(; args != nil; args = tl args){\n\t\tfile := hd args;\n\t\tif(file != \"-\"){\n\t\t\tfd := sys->open(file, Sys->OREAD);\n\t\t\tif(fd == nil){\n\t\t\t\tsys->fprint(sys->fildes(2), \"cat: cannot open %s: %r\\n\", file);\n\t\t\t\traise \"fail:bad open\";\n\t\t\t}\n\t\t\tcat(fd, file);\n\t\t}else\n\t\t\tcat(sys->fildes(0), \"\");\n\t}\n}\n\ncat(fd: ref Sys->FD, file: string)\n{\n\tbuf := array[Sys->ATOMICIO] of byte;\n\twhile((n := sys->read(fd, buf, len buf)) > 0)\n\t\tif(sys->write(stdout, buf, n) < n) {\n\t\t\tsys->fprint(sys->fildes(2), \"cat: write error: %r\\n\");\n\t\t\traise \"fail:write error\";\n\t\t}\n\tif(n < 0) {\n\t\tsys->fprint(sys->fildes(2), \"cat: error reading %s: %r\\n\", file);\n\t\traise \"fail:read error\";\n\t}\n}\n" }, { "path": "src/test/resources/samples/langs/Limbo/lock.b", "content": "implement Lock;\n\ninclude \"sys.m\";\n\tsys:\tSys;\ninclude \"lock.m\";\n\nSemaphore.obtain(l: self ref Semaphore)\n{\n\tl.c <-= 0;\n}\n\nSemaphore.release(l: self ref Semaphore)\n{\n\t<-l.c;\n}\n\nSemaphore.new(): ref Semaphore\n{\n\tl := ref Semaphore;\n\tl.c = chan[1] of int;\n\treturn l;\n}\n\ninit()\n{\n}\n" }, { "path": "src/test/resources/samples/langs/Limbo/lock.m", "content": "Lock: module\n{\n\tPATH:\tcon \"/dis/lib/lock.dis\";\n\n\tSemaphore: adt {\n\t\tc: chan of int;\n\t\tobtain:\tfn(nil: self ref Semaphore);\n\t\trelease: fn(nil: self ref Semaphore);\n\t\tnew: fn(): ref Semaphore;\n\t};\n\t\n\tinit: fn();\n};\n" }, { "path": "src/test/resources/samples/langs/Linker Script/filenames/ld.script", "content": "/*\n * ld.script for compressed kernel support of MIPS\n *\n * Copyright (C) 2009 Lemote Inc.\n * Author: Wu Zhangjin \n * Copyright (C) 2010 \"Wu Zhangjin\" \n */\n\nOUTPUT_ARCH(mips)\nENTRY(start)\nSECTIONS\n{\n\t/* Text and read-only data */\n\t/* . = VMLINUZ_LOAD_ADDRESS; */\n\t.text : {\n\t\t*(.text)\n\t\t*(.rodata)\n\t}\n\t/* End of text section */\n\n\t/* Writable data */\n\t.data : {\n\t\t*(.data)\n\t\t/* Put the compressed image here */\n\t\t__image_begin = .;\n\t\t*(.image)\n\t\t__image_end = .;\n\t\tCONSTRUCTORS\n\t}\n\t. = ALIGN(16);\n\t_edata = .;\n\t/* End of data section */\n\n\t/* BSS */\n\t.bss : {\n\t\t*(.bss)\n\t}\n\t. = ALIGN(16);\n\t_end = .;\n\n\t/* Sections to be discarded */\n\t/DISCARD/ : {\n\t\t*(.MIPS.options)\n\t\t*(.options)\n\t\t*(.pdr)\n\t\t*(.reginfo)\n\t\t*(.comment)\n\t\t*(.note)\n\t}\n}\n" }, { "path": "src/test/resources/samples/langs/Linker Script/inject.x", "content": "/* OUTPUT_FORMAT(\"elf32-littlearm\", \"elf32-bigarm\", \"elf32-littlearm\") */\n/* OUTPUT_ARCH(arm) */\nENTRY(__adbi$entry)\nSECTIONS\n{\n . = 0x00000000 + SIZEOF_HEADERS;\n \n .adbi : { \n *(.rodata) \n *(.rodata.*) \n *(.data) *(.data.*)\n *(.bss) *(.bss.*)\n *(.text) \n *(.text.*)\n *(.adbi)\n *(.adbi.*)\n } = 0\n \n}\n" }, { "path": "src/test/resources/samples/langs/Linker Script/link.ld", "content": "/*\n* link.ld\n*/\nOUTPUT_FORMAT(elf32-i386)\nENTRY(start)\nSECTIONS\n {\n . = 0x100000;\n .text : { *(.text) }\n .data : { *(.data) }\n .bss : { *(.bss) }\n }" }, { "path": "src/test/resources/samples/langs/Linker Script/vmlinux.lds", "content": "/*\n * ld script for the x86 kernel\n *\n * Historic 32-bit version written by Martin Mares \n *\n * Modernisation, unification and other changes and fixes:\n * Copyright (C) 2007-2009 Sam Ravnborg \n *\n *\n * Don't define absolute symbols until and unless you know that symbol\n * value is should remain constant even if kernel image is relocated\n * at run time. Absolute symbols are not relocated. If symbol value should\n * change if kernel is relocated, make the symbol section relative and\n * put it inside the section definition.\n */\n\n#ifdef CONFIG_X86_32\n#define LOAD_OFFSET __PAGE_OFFSET\n#else\n#define LOAD_OFFSET __START_KERNEL_map\n#endif\n\n#include \n#include \n#include \n#include \n#include \n#include \n\n#undef i386 /* in case the preprocessor is a 32bit one */\n\nOUTPUT_FORMAT(CONFIG_OUTPUT_FORMAT, CONFIG_OUTPUT_FORMAT, CONFIG_OUTPUT_FORMAT)\n\n#ifdef CONFIG_X86_32\nOUTPUT_ARCH(i386)\nENTRY(phys_startup_32)\njiffies = jiffies_64;\n#else\nOUTPUT_ARCH(i386:x86-64)\nENTRY(phys_startup_64)\njiffies_64 = jiffies;\n#endif\n\n#if defined(CONFIG_X86_64) && defined(CONFIG_DEBUG_RODATA)\n/*\n * On 64-bit, align RODATA to 2MB so that even with CONFIG_DEBUG_RODATA\n * we retain large page mappings for boundaries spanning kernel text, rodata\n * and data sections.\n *\n * However, kernel identity mappings will have different RWX permissions\n * to the pages mapping to text and to the pages padding (which are freed) the\n * text section. Hence kernel identity mappings will be broken to smaller\n * pages. For 64-bit, kernel text and kernel identity mappings are different,\n * so we can enable protection checks that come with CONFIG_DEBUG_RODATA,\n * as well as retain 2MB large page mappings for kernel text.\n */\n#define X64_ALIGN_DEBUG_RODATA_BEGIN\t. = ALIGN(HPAGE_SIZE);\n\n#define X64_ALIGN_DEBUG_RODATA_END\t\t\t\t\\\n\t\t. = ALIGN(HPAGE_SIZE);\t\t\t\t\\\n\t\t__end_rodata_hpage_align = .;\n\n#else\n\n#define X64_ALIGN_DEBUG_RODATA_BEGIN\n#define X64_ALIGN_DEBUG_RODATA_END\n\n#endif\n\nPHDRS {\n\ttext PT_LOAD FLAGS(5); /* R_E */\n\tdata PT_LOAD FLAGS(6); /* RW_ */\n#ifdef CONFIG_X86_64\n#ifdef CONFIG_SMP\n\tpercpu PT_LOAD FLAGS(6); /* RW_ */\n#endif\n\tinit PT_LOAD FLAGS(7); /* RWE */\n#endif\n\tnote PT_NOTE FLAGS(0); /* ___ */\n}\n\nSECTIONS\n{\n#ifdef CONFIG_X86_32\n . = LOAD_OFFSET + LOAD_PHYSICAL_ADDR;\n phys_startup_32 = startup_32 - LOAD_OFFSET;\n#else\n . = __START_KERNEL;\n phys_startup_64 = startup_64 - LOAD_OFFSET;\n#endif\n\n\t/* Text and read-only data */\n\t.text : AT(ADDR(.text) - LOAD_OFFSET) {\n\t\t_text = .;\n\t\t/* bootstrapping code */\n\t\tHEAD_TEXT\n\t\t. = ALIGN(8);\n\t\t_stext = .;\n\t\tTEXT_TEXT\n\t\tSCHED_TEXT\n\t\tLOCK_TEXT\n\t\tKPROBES_TEXT\n\t\tENTRY_TEXT\n\t\tIRQENTRY_TEXT\n\t\t*(.fixup)\n\t\t*(.gnu.warning)\n\t\t/* End of text section */\n\t\t_etext = .;\n\t} :text = 0x9090\n\n\tNOTES :text :note\n\n\tEXCEPTION_TABLE(16) :text = 0x9090\n\n#if defined(CONFIG_DEBUG_RODATA)\n\t/* .text should occupy whole number of pages */\n\t. = ALIGN(PAGE_SIZE);\n#endif\n\tX64_ALIGN_DEBUG_RODATA_BEGIN\n\tRO_DATA(PAGE_SIZE)\n\tX64_ALIGN_DEBUG_RODATA_END\n\n\t/* Data */\n\t.data : AT(ADDR(.data) - LOAD_OFFSET) {\n\t\t/* Start of data section */\n\t\t_sdata = .;\n\n\t\t/* init_task */\n\t\tINIT_TASK_DATA(THREAD_SIZE)\n\n#ifdef CONFIG_X86_32\n\t\t/* 32 bit has nosave before _edata */\n\t\tNOSAVE_DATA\n#endif\n\n\t\tPAGE_ALIGNED_DATA(PAGE_SIZE)\n\n\t\tCACHELINE_ALIGNED_DATA(L1_CACHE_BYTES)\n\n\t\tDATA_DATA\n\t\tCONSTRUCTORS\n\n\t\t/* rarely changed data like cpu maps */\n\t\tREAD_MOSTLY_DATA(INTERNODE_CACHE_BYTES)\n\n\t\t/* End of data section */\n\t\t_edata = .;\n\t} :data\n\n\n\t. = ALIGN(PAGE_SIZE);\n\t__vvar_page = .;\n\n\t.vvar : AT(ADDR(.vvar) - LOAD_OFFSET) {\n\t\t/* work around gold bug 13023 */\n\t\t__vvar_beginning_hack = .;\n\n\t\t/* Place all vvars at the offsets in asm/vvar.h. */\n#define EMIT_VVAR(name, offset) \t\t\t\\\n\t\t. = __vvar_beginning_hack + offset;\t\\\n\t\t*(.vvar_ ## name)\n#define __VVAR_KERNEL_LDS\n#include \n#undef __VVAR_KERNEL_LDS\n#undef EMIT_VVAR\n\n\t\t/*\n\t\t * Pad the rest of the page with zeros. Otherwise the loader\n\t\t * can leave garbage here.\n\t\t */\n\t\t. = __vvar_beginning_hack + PAGE_SIZE;\n\t} :data\n\n . = ALIGN(__vvar_page + PAGE_SIZE, PAGE_SIZE);\n\n\t/* Init code and data - will be freed after init */\n\t. = ALIGN(PAGE_SIZE);\n\t.init.begin : AT(ADDR(.init.begin) - LOAD_OFFSET) {\n\t\t__init_begin = .; /* paired with __init_end */\n\t}\n\n#if defined(CONFIG_X86_64) && defined(CONFIG_SMP)\n\t/*\n\t * percpu offsets are zero-based on SMP. PERCPU_VADDR() changes the\n\t * output PHDR, so the next output section - .init.text - should\n\t * start another segment - init.\n\t */\n\tPERCPU_VADDR(INTERNODE_CACHE_BYTES, 0, :percpu)\n\tASSERT(SIZEOF(.data..percpu) < CONFIG_PHYSICAL_START,\n\t \"per-CPU data too large - increase CONFIG_PHYSICAL_START\")\n#endif\n\n\tINIT_TEXT_SECTION(PAGE_SIZE)\n#ifdef CONFIG_X86_64\n\t:init\n#endif\n\n\tINIT_DATA_SECTION(16)\n\n\t.x86_cpu_dev.init : AT(ADDR(.x86_cpu_dev.init) - LOAD_OFFSET) {\n\t\t__x86_cpu_dev_start = .;\n\t\t*(.x86_cpu_dev.init)\n\t\t__x86_cpu_dev_end = .;\n\t}\n\n#ifdef CONFIG_X86_INTEL_MID\n\t.x86_intel_mid_dev.init : AT(ADDR(.x86_intel_mid_dev.init) - \\\n\t\t\t\t\t\t\t\tLOAD_OFFSET) {\n\t\t__x86_intel_mid_dev_start = .;\n\t\t*(.x86_intel_mid_dev.init)\n\t\t__x86_intel_mid_dev_end = .;\n\t}\n#endif\n\n\t/*\n\t * start address and size of operations which during runtime\n\t * can be patched with virtualization friendly instructions or\n\t * baremetal native ones. Think page table operations.\n\t * Details in paravirt_types.h\n\t */\n\t. = ALIGN(8);\n\t.parainstructions : AT(ADDR(.parainstructions) - LOAD_OFFSET) {\n\t\t__parainstructions = .;\n\t\t*(.parainstructions)\n\t\t__parainstructions_end = .;\n\t}\n\n\t/*\n\t * struct alt_inst entries. From the header (alternative.h):\n\t * \"Alternative instructions for different CPU types or capabilities\"\n\t * Think locking instructions on spinlocks.\n\t */\n\t. = ALIGN(8);\n\t.altinstructions : AT(ADDR(.altinstructions) - LOAD_OFFSET) {\n\t\t__alt_instructions = .;\n\t\t*(.altinstructions)\n\t\t__alt_instructions_end = .;\n\t}\n\n\t/*\n\t * And here are the replacement instructions. The linker sticks\n\t * them as binary blobs. The .altinstructions has enough data to\n\t * get the address and the length of them to patch the kernel safely.\n\t */\n\t.altinstr_replacement : AT(ADDR(.altinstr_replacement) - LOAD_OFFSET) {\n\t\t*(.altinstr_replacement)\n\t}\n\n\t/*\n\t * struct iommu_table_entry entries are injected in this section.\n\t * It is an array of IOMMUs which during run time gets sorted depending\n\t * on its dependency order. After rootfs_initcall is complete\n\t * this section can be safely removed.\n\t */\n\t.iommu_table : AT(ADDR(.iommu_table) - LOAD_OFFSET) {\n\t\t__iommu_table = .;\n\t\t*(.iommu_table)\n\t\t__iommu_table_end = .;\n\t}\n\n\t. = ALIGN(8);\n\t.apicdrivers : AT(ADDR(.apicdrivers) - LOAD_OFFSET) {\n\t\t__apicdrivers = .;\n\t\t*(.apicdrivers);\n\t\t__apicdrivers_end = .;\n\t}\n\n\t. = ALIGN(8);\n\t/*\n\t * .exit.text is discard at runtime, not link time, to deal with\n\t * references from .altinstructions and .eh_frame\n\t */\n\t.exit.text : AT(ADDR(.exit.text) - LOAD_OFFSET) {\n\t\tEXIT_TEXT\n\t}\n\n\t.exit.data : AT(ADDR(.exit.data) - LOAD_OFFSET) {\n\t\tEXIT_DATA\n\t}\n\n#if !defined(CONFIG_X86_64) || !defined(CONFIG_SMP)\n\tPERCPU_SECTION(INTERNODE_CACHE_BYTES)\n#endif\n\n\t. = ALIGN(PAGE_SIZE);\n\n\t/* freed after init ends here */\n\t.init.end : AT(ADDR(.init.end) - LOAD_OFFSET) {\n\t\t__init_end = .;\n\t}\n\n\t/*\n\t * smp_locks might be freed after init\n\t * start/end must be page aligned\n\t */\n\t. = ALIGN(PAGE_SIZE);\n\t.smp_locks : AT(ADDR(.smp_locks) - LOAD_OFFSET) {\n\t\t__smp_locks = .;\n\t\t*(.smp_locks)\n\t\t. = ALIGN(PAGE_SIZE);\n\t\t__smp_locks_end = .;\n\t}\n\n#ifdef CONFIG_X86_64\n\t.data_nosave : AT(ADDR(.data_nosave) - LOAD_OFFSET) {\n\t\tNOSAVE_DATA\n\t}\n#endif\n\n\t/* BSS */\n\t. = ALIGN(PAGE_SIZE);\n\t.bss : AT(ADDR(.bss) - LOAD_OFFSET) {\n\t\t__bss_start = .;\n\t\t*(.bss..page_aligned)\n\t\t*(.bss)\n\t\t. = ALIGN(PAGE_SIZE);\n\t\t__bss_stop = .;\n\t}\n\n\t. = ALIGN(PAGE_SIZE);\n\t.brk : AT(ADDR(.brk) - LOAD_OFFSET) {\n\t\t__brk_base = .;\n\t\t. += 64 * 1024;\t\t/* 64k alignment slop space */\n\t\t*(.brk_reservation)\t/* areas brk users have reserved */\n\t\t__brk_limit = .;\n\t}\n\n\t_end = .;\n\n STABS_DEBUG\n DWARF_DEBUG\n\n\t/* Sections to be discarded */\n\tDISCARDS\n\t/DISCARD/ : { *(.eh_frame) }\n}\n\n\n#ifdef CONFIG_X86_32\n/*\n * The ASSERT() sink to . is intentional, for binutils 2.14 compatibility:\n */\n. = ASSERT((_end - LOAD_OFFSET <= KERNEL_IMAGE_SIZE),\n\t \"kernel image bigger than KERNEL_IMAGE_SIZE\");\n#else\n/*\n * Per-cpu symbols which need to be offset from __per_cpu_load\n * for the boot processor.\n */\n#define INIT_PER_CPU(x) init_per_cpu__##x = x + __per_cpu_load\nINIT_PER_CPU(gdt_page);\nINIT_PER_CPU(irq_stack_union);\n\n/*\n * Build-time check on the image size:\n */\n. = ASSERT((_end - _text <= KERNEL_IMAGE_SIZE),\n\t \"kernel image bigger than KERNEL_IMAGE_SIZE\");\n\n#ifdef CONFIG_SMP\n. = ASSERT((irq_stack_union == 0),\n \"irq_stack_union is not at start of per-cpu area\");\n#endif\n\n#endif /* CONFIG_X86_32 */\n\n#ifdef CONFIG_KEXEC\n#include \n\n. = ASSERT(kexec_control_code_size <= KEXEC_CONTROL_CODE_MAX_SIZE,\n \"kexec control code size is too big\");\n#endif\n\n" }, { "path": "src/test/resources/samples/langs/Linux Kernel Module/bcm4334x.mod", "content": "/data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/bcm4334x.ko\n/data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_pno.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_common.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_ip.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_custom_gpio.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_linux.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_linux_sched.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_cfg80211.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_linux_wq.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/aiutils.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/bcmevent.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/bcmutils.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/bcmwifi_channels.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/hndpmu.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/linux_osl.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/sbutils.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/siutils.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/wl_android.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/wl_cfg80211.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/wl_cfgp2p.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/wl_cfg_btcoex.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/wldev_common.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/wl_linux_mon.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_linux_platdev.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/bcmsdh.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/bcmsdh_linux.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/bcmsdh_sdmmc.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/bcmsdh_sdmmc_linux.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_cdc.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_wlfc.o /data/israel/edison/poky/meta-edison/recipes-kernel/bcm43340/driver_bcm43x/dhd_sdio.o\n" }, { "path": "src/test/resources/samples/langs/Linux Kernel Module/mbcache.mod", "content": "fs/mbcache.ko\nfs/mbcache.o\n" }, { "path": "src/test/resources/samples/langs/Linux Kernel Module/md5.mod", "content": "crypto/md5.ko\ncrypto/md5.o\n" }, { "path": "src/test/resources/samples/langs/Liquid/layout.liquid", "content": "\n\n\n\n \n {{shop.name}} - {{page_title}}\n\n {{ 'textile.css' | global_asset_url | stylesheet_tag }}\n {{ 'lightbox/v204/lightbox.css' | global_asset_url | stylesheet_tag }}\n\n {{ 'prototype/1.6/prototype.js' | global_asset_url | script_tag }}\n {{ 'scriptaculous/1.8.2/scriptaculous.js' | global_asset_url | script_tag }}\n {{ 'lightbox/v204/lightbox.js' | global_asset_url | script_tag }}\n {{ 'option_selection.js' | shopify_asset_url | script_tag }}\n\n {{ 'layout.css' | asset_url | stylesheet_tag }}\n {{ 'shop.js' | asset_url | script_tag }}\n\n {{ content_for_header }}\n\n\n\n\n

Skip to navigation.

\n \n {% if cart.item_count > 0 %}\n
\n
\n

There {{ cart.item_count | pluralize: 'is', 'are' }} {{ cart.item_count }} {{ cart.item_count | pluralize: 'item', 'items' }} in your cart!

Your subtotal is {{ cart.total_price | money }}.

\n {% for item in cart.items %}\n
\n
\n
\n {% endfor %}\n
\n
\n
\n {% endif %}\n\n
\n \n
\n
\n\n
\n
\n {{ content_for_layout }}\n
\n
\n\n
\n
\n\n
    \n {% for link in linklists.main-menu.links %}\n
  • {{ link.title | link_to: link.url }}
    • \n {% endfor %}\n
\n\n {% if tags %}\n
    \n {% for tag in collection.tags %}\n
  • {{ '+' | link_to_add_tag: tag }}{{ tag | highlight_active_tag | link_to_tag: tag }}
    • \n {% endfor %}\n
\n {% endif %}\n\n
    \n {% for link in linklists.footer.links %}\n
  • {{ link.title | link_to: link.url }}
    • \n {% endfor %}\n
\n\n
\n\n

\n\n
\n
\n All prices are in {{ shop.currency }}.\n Powered by Shopify.\n
\n
\n\n
\n
\n\n
\n\n\n\n\n" }, { "path": "src/test/resources/samples/langs/Liquid/template.liquid", "content": "

We have wonderful products!

\n
    \n
    \n
    \n {% for image in product.images %}\n {% if forloop.first %}\n \n \"{{product.title\n \n {% else %}\n \n \"{{product.title\n \n {% endif %}\n {% endfor %}\n
    \n\n

    {{ product.title }}

    \n\n
      \n
    • Vendor: {{ product.vendor | link_to_vendor }}
      • \n
    • Type: {{ product.type | link_to_type }}
      • \n
    \n\n {{ product.price_min | money }}{% if product.price_varies %} - {{ product.price_max | money }}{% endif %}\n\n
    \n
    \n\n \n\n
    \n\n
    \n
    \n
    \n\n
    \n {{ product.description }}\n
    \n
    \n\n \n
\n" }, { "path": "src/test/resources/samples/langs/Literate Agda/NatCat.lagda", "content": "\\documentclass{article}\r\n\r\n % The following packages are needed because unicode\r\n % is translated (using the next set of packages) to\r\n % latex commands. You may need more packages if you\r\n % use more unicode characters:\r\n\r\n \\usepackage{amssymb}\r\n \\usepackage{bbm}\r\n \\usepackage[greek,english]{babel}\r\n\r\n % This handles the translation of unicode to latex:\r\n\r\n \\usepackage{ucs}\r\n \\usepackage[utf8x]{inputenc}\r\n \\usepackage{autofe}\r\n\r\n % Some characters that are not automatically defined\r\n % (you figure out by the latex compilation errors you get),\r\n % and you need to define:\r\n\r\n \\DeclareUnicodeCharacter{8988}{\\ensuremath{\\ulcorner}}\r\n \\DeclareUnicodeCharacter{8989}{\\ensuremath{\\urcorner}}\r\n \\DeclareUnicodeCharacter{8803}{\\ensuremath{\\overline{\\equiv}}}\r\n\r\n % Add more as you need them (shouldn’t happen often).\r\n\r\n % Using “\\newenvironment” to redefine verbatim to\r\n % be called “code” doesn’t always work properly. \r\n % You can more reliably use:\r\n\r\n \\usepackage{fancyvrb}\r\n\r\n \\DefineVerbatimEnvironment\r\n {code}{Verbatim}\r\n {} % Add fancy options here if you like.\r\n\r\n \\begin{document}\r\n\r\n \\begin{code}\r\nmodule NatCat where\r\n\r\nopen import Relation.Binary.PropositionalEquality\r\n\r\n-- If you can show that a relation only ever has one inhabitant\r\n-- you get the category laws for free\r\nmodule\r\n EasyCategory\r\n (obj : Set)\r\n (_⟶_ : obj → obj → Set)\r\n (_∘_ : ∀ {x y z} → x ⟶ y → y ⟶ z → x ⟶ z)\r\n (id : ∀ x → x ⟶ x)\r\n (single-inhabitant : (x y : obj) (r s : x ⟶ y) → r ≡ s)\r\n where\r\n\r\n idʳ : ∀ x y (r : x ⟶ y) → r ∘ id y ≡ r\r\n idʳ x y r = single-inhabitant x y (r ∘ id y) r \r\n\r\n idˡ : ∀ x y (r : x ⟶ y) → id x ∘ r ≡ r\r\n idˡ x y r = single-inhabitant x y (id x ∘ r) r\r\n\r\n ∘-assoc : ∀ w x y z (r : w ⟶ x) (s : x ⟶ y) (t : y ⟶ z) → (r ∘ s) ∘ t ≡ r ∘ (s ∘ t)\r\n ∘-assoc w x y z r s t = single-inhabitant w z ((r ∘ s) ∘ t) (r ∘ (s ∘ t))\r\n\r\nopen import Data.Nat\r\n\r\nsame : (x y : ℕ) (r s : x ≤ y) → r ≡ s\r\nsame .0 y z≤n z≤n = refl\r\nsame .(suc m) .(suc n) (s≤s {m} {n} r) (s≤s s) = cong s≤s (same m n r s)\r\n\r\n≤-trans : ∀ x y z → x ≤ y → y ≤ z → x ≤ z\r\n≤-trans .0 y z z≤n s = z≤n\r\n≤-trans .(suc m) .(suc n) .(suc n₁) (s≤s {m} {n} r) (s≤s {.n} {n₁} s) = s≤s (≤-trans m n n₁ r s)\r\n\r\n≤-refl : ∀ x → x ≤ x\r\n≤-refl zero = z≤n\r\n≤-refl (suc x) = s≤s (≤-refl x)\r\n\r\nmodule Nat-EasyCategory = EasyCategory ℕ _≤_ (λ {x}{y}{z} → ≤-trans x y z) ≤-refl same\r\n \\end{code}\r\n\r\n \\end{document} " }, { "path": "src/test/resources/samples/langs/Literate CoffeeScript/scope.litcoffee", "content": "The **Scope** class regulates lexical scoping within CoffeeScript. As you\ngenerate code, you create a tree of scopes in the same shape as the nested\nfunction bodies. Each scope knows about the variables declared within it,\nand has a reference to its parent enclosing scope. In this way, we know which\nvariables are new and need to be declared with `var`, and which are shared\nwith external scopes.\n\nImport the helpers we plan to use.\n\n {extend, last} = require './helpers'\n\n exports.Scope = class Scope\n\nThe `root` is the top-level **Scope** object for a given file.\n\n @root: null\n\nInitialize a scope with its parent, for lookups up the chain,\nas well as a reference to the **Block** node it belongs to, which is\nwhere it should declare its variables, and a reference to the function that\nit belongs to.\n\n constructor: (@parent, @expressions, @method) ->\n @variables = [{name: 'arguments', type: 'arguments'}]\n @positions = {}\n Scope.root = this unless @parent\n\nAdds a new variable or overrides an existing one.\n\n add: (name, type, immediate) ->\n return @parent.add name, type, immediate if @shared and not immediate\n if Object::hasOwnProperty.call @positions, name\n @variables[@positions[name]].type = type\n else\n @positions[name] = @variables.push({name, type}) - 1\n\nWhen `super` is called, we need to find the name of the current method we're\nin, so that we know how to invoke the same method of the parent class. This\ncan get complicated if super is being called from an inner function.\n`namedMethod` will walk up the scope tree until it either finds the first\nfunction object that has a name filled in, or bottoms out.\n\n namedMethod: ->\n return @method if @method.name or !@parent\n @parent.namedMethod()\n\nLook up a variable name in lexical scope, and declare it if it does not\nalready exist.\n\n find: (name) ->\n return yes if @check name\n @add name, 'var'\n no\n\nReserve a variable name as originating from a function parameter for this\nscope. No `var` required for internal references.\n\n parameter: (name) ->\n return if @shared and @parent.check name, yes\n @add name, 'param'\n\nJust check to see if a variable has already been declared, without reserving,\nwalks up to the root scope.\n\n check: (name) ->\n !!(@type(name) or @parent?.check(name))\n\nGenerate a temporary variable name at the given index.\n\n temporary: (name, index) ->\n if name.length > 1\n '_' + name + if index > 1 then index - 1 else ''\n else\n '_' + (index + parseInt name, 36).toString(36).replace /\\d/g, 'a'\n\nGets the type of a variable.\n\n type: (name) ->\n return v.type for v in @variables when v.name is name\n null\n\nIf we need to store an intermediate result, find an available name for a\ncompiler-generated variable. `_var`, `_var2`, and so on...\n\n freeVariable: (name, reserve=true) ->\n index = 0\n index++ while @check((temp = @temporary name, index))\n @add temp, 'var', yes if reserve\n temp\n\nEnsure that an assignment is made at the top of this scope\n(or at the top-level scope, if requested).\n\n assign: (name, value) ->\n @add name, {value, assigned: yes}, yes\n @hasAssignments = yes\n\nDoes this scope have any declared variables?\n\n hasDeclarations: ->\n !!@declaredVariables().length\n\nReturn the list of variables first declared in this scope.\n\n declaredVariables: ->\n realVars = []\n tempVars = []\n for v in @variables when v.type is 'var'\n (if v.name.charAt(0) is '_' then tempVars else realVars).push v.name\n realVars.sort().concat tempVars.sort()\n\nReturn the list of assignments that are supposed to be made at the top\nof this scope.\n\n assignedVariables: ->\n \"#{v.name} = #{v.type.value}\" for v in @variables when v.type.assigned\n\n" }, { "path": "src/test/resources/samples/langs/LiveScript/hello.ls", "content": "a = -> 1\nconst b = --> 2\nvar c = ~> 3\nd = ~~> 10_000_000km * 500ms\ne = (a) -> (b) ~> (c) --> (d, e) ~~> 5\ndashes-identifiers = ->\n a - a\n b -- c\n 1-1 1- -1\n a- a\n a -a\nunderscores_i$d = ->\n/regexp1/ and //regexp2//g\n'strings' and \"strings\" and \\strings\n([2 til 10] or [1 to 50])\n |> map (* 2)\n |> filter (> 5)\n |> fold (+)\n\nclass Class extends Anc-est-or\n (args) ->\n\ncopy = (from, to, callback) -->\n error, data <- read file\n return callback error if error?\n error <~ write file, data\n return callback error if error?\n callback()\n\n->\n~>\n~~>\n-->\n# Comment\n/* Comment */\n" }, { "path": "src/test/resources/samples/langs/Logos/NCHax.x", "content": "#import \n#import \n#import \n#import \n\nstatic NSString *const kHBDPWeeAppIdentifier = @\"ws.hbang.dailypaperweeapp\";\n\n#pragma mark - Change section header and icon\n\n// courtesy of benno\n\nBOOL isDailyPaper = NO;\n\n%hook SBBulletinObserverViewController\n\n- (void)_addSection:(BBSectionInfo *)section toCategory:(NSInteger)category widget:(id)widget {\n\tif ([section.sectionID isEqualToString:kHBDPWeeAppIdentifier]) {\n\t\tisDailyPaper = YES;\n\t\t%orig;\n\t\tisDailyPaper = NO;\n\t} else {\n\t\t%orig;\n\t}\n}\n\n%end\n\n%hook SBBulletinListSection\n\n- (void)setDisplayName:(NSString *)displayName {\n\t%orig(isDailyPaper ? @\"Current Wallpaper\" : displayName);\n}\n\n- (void)setIconImage:(UIImage *)iconImage {\n\t%orig(isDailyPaper ? [UIImage imageNamed:@\"icon\" inBundle:[NSBundle bundleWithPath:@\"/Library/PreferenceBundles/DailyPaper.bundle\"]] : iconImage);\n}\n\n%end\n\n#pragma mark - Enable by default\n\n%hook SBNotificationCenterDataProviderController\n\n- (NSArray *)_copyDefaultEnabledWidgetIDs {\n\tNSArray *defaultWidgets = %orig;\n\treturn [[defaultWidgets arrayByAddingObject:kHBDPWeeAppIdentifier] copy];\n}\n\n%end\n\n#pragma mark - Constructor\n\n%ctor {\n\tif (!IS_IOS_OR_NEWER(iOS_8_0)) {\n\t\t%init;\n\t}\n}\n" }, { "path": "src/test/resources/samples/langs/Logos/NoCarrier.x", "content": "//\n// NoCarrier.x\n// NoCarrier\n//\n// Created by Jonas Gessner on 27.01.2014.\n// Copyright (c) 2014 Jonas Gessner. All rights reserved.\n//\n\n#import \n\n#include \n\n%group main\n\n%hook UIStatusBarServiceItemView\n\n- (id)_serviceContentsImage {\n return nil;\n}\n\n- (CGFloat)extraLeftPadding {\n return 0.0f;\n}\n\n- (CGFloat)extraRightPadding {\n return 0.0f;\n}\n\n- (CGFloat)standardPadding {\n return 2.0f;\n}\n\n%end\n\n%end\n\n\n%ctor {\n\t@autoreleasepool {\n\t\t%init(main);\n\t}\n}\n" }, { "path": "src/test/resources/samples/langs/Logos/Tweak.x", "content": "/*\n * ShadowSocks Per-App Proxy Plugin\n * https://github.com/linusyang/MobileShadowSocks\n *\n * Copyright (c) 2014 Linus Yang \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 .\n *\n */\n\n#include \n#include \n\n#define FUNC_NAME SCDynamicStoreCopyProxies\n#define ORIG_FUNC original_ ## FUNC_NAME\n#define CUST_FUNC custom_ ## FUNC_NAME\n\n#define DECL_FUNC(ret, ...) \\\n extern ret FUNC_NAME(__VA_ARGS__); \\\n static ret (*ORIG_FUNC)(__VA_ARGS__); \\\n ret CUST_FUNC(__VA_ARGS__)\n\n#define HOOK_FUNC() \\\n MSHookFunction(FUNC_NAME, (void *) CUST_FUNC, (void **) &ORIG_FUNC)\n\ntypedef const struct __SCDynamicStore *SCDynamicStoreRef;\nvoid MSHookFunction(void *symbol, void *replace, void **result);\n\nstatic BOOL proxyEnabled = YES;\nstatic BOOL spdyDisabled = YES;\nstatic BOOL finderEnabled = YES;\n\nstatic BOOL getValue(NSDictionary *dict, NSString *key, BOOL defaultVal)\n{\n if (dict == nil || key == nil) {\n return defaultVal;\n }\n NSNumber *valObj = [dict objectForKey:key];\n if (valObj == nil) {\n return defaultVal;\n }\n return [valObj boolValue];\n}\n\nstatic void updateSettings(void)\n{\n proxyEnabled = YES;\n spdyDisabled = YES;\n finderEnabled = YES;\n NSDictionary *dict = [[NSDictionary alloc] initWithContentsOfFile:@\"/var/mobile/Library/Preferences/com.linusyang.ssperapp.plist\"];\n if (dict != nil) {\n NSString *bundleName = [[NSBundle mainBundle] bundleIdentifier];\n if (getValue(dict, @\"SSPerAppEnabled\", NO) && bundleName != nil) {\n NSString *entry = [[NSString alloc] initWithFormat:@\"Enabled-%@\", bundleName];\n proxyEnabled = getValue(dict, entry, NO);\n if (getValue(dict, @\"SSPerAppReversed\", NO)) {\n proxyEnabled = !proxyEnabled;\n }\n [entry release];\n }\n spdyDisabled = getValue(dict, @\"SSPerAppDisableSPDY\", YES);\n finderEnabled = getValue(dict, @\"SSPerAppFinder\", YES);\n [dict release];\n }\n}\n\nDECL_FUNC(CFDictionaryRef, SCDynamicStoreRef store)\n{\n if (proxyEnabled) {\n return ORIG_FUNC(store);\n }\n CFMutableDictionaryRef proxyDict = CFDictionaryCreateMutable(kCFAllocatorDefault, 0, &kCFTypeDictionaryKeyCallBacks, &kCFTypeDictionaryValueCallBacks);\n int zero = 0;\n CFNumberRef zeroNumber = CFNumberCreate(kCFAllocatorDefault, kCFNumberIntType, &zero);\n CFDictionarySetValue(proxyDict, CFSTR(\"HTTPEnable\"), zeroNumber);\n CFDictionarySetValue(proxyDict, CFSTR(\"HTTPProxyType\"), zeroNumber);\n CFDictionarySetValue(proxyDict, CFSTR(\"HTTPSEnable\"), zeroNumber);\n CFDictionarySetValue(proxyDict, CFSTR(\"ProxyAutoConfigEnable\"), zeroNumber);\n CFRelease(zeroNumber);\n return proxyDict;\n}\n\n@interface SettingTableViewController \n\n- (BOOL)useLibFinder;\n- (UIViewController *)allocFinderController;\n- (void)finderSelectedFilePath:(NSString *)path checkSanity:(BOOL)check;\n\n@end\n\n%group FinderHook\n\n%hook SettingTableViewController\n- (BOOL)useLibFinder\n{\n return finderEnabled;\n}\n\n- (UIViewController *)allocFinderController\n{\n LFFinderController* finder = [[LFFinderController alloc] initWithMode:LFFinderModeDefault];\n finder.actionDelegate = self;\n return finder;\n}\n\n%new\n-(void)finder:(LFFinderController*)finder didSelectItemAtPath:(NSString*)path\n{\n [self finderSelectedFilePath:path checkSanity:NO];\n}\n%end\n\n%end\n\n%group TwitterHook\n\n%hook T1SPDYConfigurationChangeListener \n- (BOOL)_shouldEnableSPDY\n{\n if (spdyDisabled) {\n return NO;\n } else {\n return %orig;\n }\n}\n%end\n\n%end\n\n%group FacebookHook\n\n%hook FBRequester\n- (BOOL)allowSPDY\n{\n if (spdyDisabled) {\n return NO;\n } else {\n return %orig;\n }\n}\n\n- (BOOL)useDNSCache\n{\n if (spdyDisabled) {\n return NO;\n } else {\n return %orig;\n }\n}\n%end\n\n%hook FBNetworkerRequest\n- (BOOL)disableSPDY\n{\n if (spdyDisabled) {\n return YES;\n } else {\n return %orig;\n }\n}\n%end\n\n%hook FBRequesterState\n- (BOOL)didUseSPDY\n{\n if (spdyDisabled) {\n return NO;\n } else {\n return %orig;\n }\n}\n%end\n\n%hook FBAppConfigService\n- (BOOL)disableDNSCache\n{\n if (spdyDisabled) {\n return YES;\n } else {\n return %orig;\n }\n}\n%end\n\n%hook FBNetworker\n- (BOOL)_shouldAllowUseOfDNSCache:(id)arg\n{\n if (spdyDisabled) {\n return NO;\n } else {\n return %orig;\n }\n}\n%end\n\n%hook FBAppSessionController\n- (BOOL)networkerShouldAllowUseOfDNSCache:(id)arg\n{\n if (spdyDisabled) {\n return NO;\n } else {\n return %orig;\n }\n}\n%end\n\n%end\n\n%ctor\n{\n NSAutoreleasePool *pool = [[NSAutoreleasePool alloc] init];\n NSString *bundleName = [[NSBundle mainBundle] bundleIdentifier];\n if (bundleName != nil && ![bundleName isEqualToString:@\"com.apple.springboard\"]) {\n updateSettings();\n CFNotificationCenterAddObserver(CFNotificationCenterGetDarwinNotifyCenter(), NULL, (CFNotificationCallback) updateSettings, CFSTR(\"com.linusyang.ssperapp.settingschanged\"), NULL, CFNotificationSuspensionBehaviorCoalesce);\n if ([bundleName isEqualToString:@\"com.linusyang.MobileShadowSocks\"]) {\n %init(FinderHook);\n } else {\n HOOK_FUNC();\n if ([bundleName isEqualToString:@\"com.atebits.Tweetie2\"]) {\n %init(TwitterHook);\n } else if ([bundleName isEqualToString:@\"com.facebook.Facebook\"]) {\n %init(FacebookHook);\n }\n }\n }\n [pool drain];\n}\n" }, { "path": "src/test/resources/samples/langs/Logos/example.xm", "content": "%hook ABC\n- (id)a:(B)b {\n\t%log;\n\treturn %orig(nil);\n}\n%end\n\n%subclass DEF: NSObject\n- (id)init {\n\t[%c(RuntimeAccessibleClass) alloc];\n\treturn nil;\n}\n%end\n\n%group OptionalHooks\n%hook ABC\n- (void)release {\n\t[self retain];\n\t%orig;\n}\n%end\n%end\n\n%ctor {\n\t%init;\n\tif(OptionalCondition)\n\t\t%init(OptionalHooks);\n}\n" }, { "path": "src/test/resources/samples/langs/Logos/string1.x", "content": "# APPLE LOCAL file string workaround 4943900\nif { [istarget \"*-*-darwin\\[9123\\]*\"] } {\n set additional_flags \"-framework Foundation -fconstant-cfstrings\"\n}\nreturn 0\n" }, { "path": "src/test/resources/samples/langs/Logtalk/foo.lgt", "content": "% this is a Logtalk source file\n\n:- object(hello_world).\n\n\t% the initialization/1 directive argument is automatically executed\n\t% when the object is loaded into memory:\n\t:- initialization((nl, write('********** Hello World! **********'), nl)).\n\n:- end_object.\n" }, { "path": "src/test/resources/samples/langs/LookML/comments.view.lookml", "content": "- view: comments\n fields:\n\n - dimension: id\n primary_key: true\n type: int\n sql: ${TABLE}.id\n\n - dimension: body\n sql: ${TABLE}.body\n\n - dimension_group: created\n type: time\n timeframes: [time, date, week, month]\n sql: ${TABLE}.created_at\n\n - dimension: headline_id\n type: int\n hidden: true\n sql: ${TABLE}.headline_id\n\n - dimension_group: updated\n type: time\n timeframes: [time, date, week, month]\n sql: ${TABLE}.updated_at\n\n - dimension: user_id\n type: int\n hidden: true\n sql: ${TABLE}.user_id\n\n - measure: count\n type: count\n detail: detail*\n\n\n # ----- Detail ------\n sets:\n detail:\n - id\n - headlines.id\n - headlines.name\n - users.id\n" }, { "path": "src/test/resources/samples/langs/LookML/example.model.lkml", "content": "- label: 'desired label name'\n- connection: connection_name\n- include: filename_or_pattern\n # Possibly more include declarations\n- persist_for: N (seconds | minutes | hours)\n- case_sensitive: true | false\n- week_start_day: monday | tuesday | wednesday | thursday | friday | saturday | sunday\n- value_formats:\n - name: desired_format_name\n value_format: 'excel-style formatting string'\n # Possibly more value formats\n\n- explore: view_name\n label: 'desired label name'\n description: 'description string'\n symmetric_aggregates: true | false\n hidden: true | false\n fields: [field_or_set, field_or_set, …]\n\n sql_always_where: SQL WHERE condition\n always_filter:\n field_name: 'looker filter expression'\n conditionally_filter:\n field_name: 'looker filter expression'\n unless: [field_or_set, field_or_set, …]\n access_filter_fields: [fully_scoped_field, fully_scoped_field, …]\n\n always_join: [view_name, view_name, …]\n joins:\n - join: view_name\n type: left_outer | full_outer | inner | cross\n relationship: one_to_one | many_to_one | one_to_many | many_to_many\n from: view_name\n sql_table_name: table_name\n view_label: 'desired label name'\n fields: [field_or_set, field_or_set, …]\n required_joins: [view_name, view_name, …]\n foreign_key: dimension_name\n sql_on: SQL ON clause\n # Possibly more join declarations\n\n persist_for: N (seconds | minutes | hours)\n from: view_name\n view: view_name\n case_sensitive: true | false\n sql_table_name: table_name\n cancel_grouping_fields: [fully_scoped_field, fully_scoped_field, …]\n\n# Possibly more explore declarations\n" }, { "path": "src/test/resources/samples/langs/LookML/example.view.lkml", "content": "- view: view_name\n sql_table_name: table_name\n suggestions: true | false\n\n derived_table:\n sql: SQL query\n persist_for: N (seconds | minutes | hours)\n sql_trigger_value: SQL query\n distribution: column_name\n distribution_style: ALL | EVEN\n sortkeys: [column_name, column_name, …]\n indexes: [column_name, column_name, …]\n\n sets:\n set_name:\n - field_or_set\n - field_or_set\n - …\n # Possibly more set declarations\n\n fields:\n - (dimension | dimension_group | measure | filter): field_name\n label: 'desired label name'\n view_label: 'desired label name'\n group_label: 'desired label name'\n description: 'description string'\n hidden: true | false\n alias: [old_field_name, old_field_name, …]\n value_format: 'excel-style formatting string'\n value_format_name: format_name\n html: HTML expression using Liquid template elements\n sql: SQL expression to generate the field value\n required_fields: [field_name, field_name, …]\n drill_fields: [field_or_set, field_or_set, …]\n can_filter: true | false\n fanout_on: repeated_record_name\n\n # DIMENSION SPECIFIC PARAMETERS\n\n type: dimension_field_type\n primary_key: true | false\n sql_case:\n value: SQL condition\n value: SQL condition\n # Possibly more sql_case statements\n alpha_sort: true | false\n tiers: [N, N, …]\n style: classic | interval | integer | relational\n sql_latitude: SQL expression to generate a latitude\n sql_longitude: SQL expression to generate a longitude\n suggestable: true | false\n suggest_persist_for: N (seconds | minutes | hours)\n suggest_dimension: dimension_name\n suggest_explore: explore_name\n suggestions: ['suggestion string', 'suggestion string', …]\n bypass_suggest_restrictions: true | false\n full_suggestions: true | false\n skip_drill_filter: true | false\n case_sensitive: true | false\n order_by_field: dimension_name\n map_layer: name_of_map_layer\n links:\n - label: 'desired label name'\n url: desired_url\n icon_url: url_of_an_ico_file\n # Possibly more links\n\n # DIMENSION GROUP SPECIFIC PARAMETERS\n\n timeframes: [timeframe, timeframe, …]\n convert_tz: true | false\n datatype: epoch | timestamp | datetime | date | yyyymmdd\n\n # MEASURE SPECIFIC PARAMETERS\n\n type: measure_field_type\n direction: row | column\n approximate: true | false\n approximate_threshold: N\n sql_distinct_key: SQL expression to define repeated entities\n list_field: dimension_name\n filters:\n dimension_name: 'looker filter expression'\n # Possibly more filters statements\n\n # FILTER SPECIFIC PARAMETERS\n\n default_value: 'desired default value'\n\n # Possibly more dimension or measure declarations\n" }, { "path": "src/test/resources/samples/langs/LoomScript/HelloWorld.ls", "content": "package\n{\n import loom.Application;\n import loom2d.display.StageScaleMode;\n import loom2d.ui.SimpleLabel;\n\n /**\n The HelloWorld app renders a label with its name on it,\n and traces 'hello' to the log.\n */\n public class HelloWorld extends Application\n {\n\n override public function run():void\n {\n stage.scaleMode = StageScaleMode.LETTERBOX;\n centeredMessage(simpleLabel, this.getFullTypeName());\n\n trace(\"hello\");\n }\n\n // a convenience getter that generates a label and adds it to the stage\n private function get simpleLabel():SimpleLabel\n {\n return stage.addChild(new SimpleLabel(\"assets/Curse-hd.fnt\")) as SimpleLabel;\n }\n\n // a utility to set the label's text and then center it on the stage\n private function centeredMessage(label:SimpleLabel, msg:String):void\n {\n label.text = msg;\n label.center();\n label.x = stage.stageWidth / 2;\n label.y = (stage.stageHeight / 2) - (label.height / 2);\n }\n\n }\n}\n" }, { "path": "src/test/resources/samples/langs/LoomScript/SyntaxExercise.ls", "content": "package\n{\n import loom.Application;\n\n public interface I {}\n public class C {}\n public class B extends C implements I {}\n final public class A extends B {}\n\n delegate ToCompute(s:String, o:Object):Number;\n\n public enum Enumeration\n {\n foo,\n baz,\n cat,\n }\n\n struct P {\n public var x:Number = 0;\n public var y:Number = 0;\n public static operator function =(a:P, b:P):P\n {\n a.x = b.x;\n a.y = b.y;\n\n return a;\n }\n }\n\n // single-line comment\n\n /*\n Multi-line comment\n */\n\n /**\n Doc comment\n */\n public class SyntaxExercise extends Application\n {\n static public var classVar:String = 'class variable';\n public const CONST:String = 'constant';\n private var _a:A = new A();\n public var _d:ToCompute;\n\n override public function run():void\n {\n trace(\"hello\");\n }\n\n private function get a():A { return _a; }\n private function set a(value:A):void { _a = value; }\n\n private function variousTypes(defaultValue:String = ''):void\n {\n var nil:Object = null;\n var b1:Boolean = true;\n var b2:Boolean = false;\n var n1:Number = 0.123;\n var n2:Number = 12345;\n var n3:Number = 0xfed;\n var s1:String = 'single-quotes with \"quotes\" inside';\n var s2:String = \"double-quotes with 'quotes' inside\";\n var f1:Function = function (life:String, universe:Object, ...everything):Number { return 42; };\n var v1:Vector. = [1, 2];\n var d1:Dictionary. = { 'three': 3, 'four': 4 };\n\n _d += f1;\n _d -= f1;\n }\n\n private function variousOps():void\n {\n var a = ((100 + 200 - 0) / 300) % 2;\n var b = 100 * 30;\n var d = true && (b > 301);\n var e = 0x10 | 0x01;\n\n b++; b--;\n a += 300; a -= 5; a *= 4; a /= 2; a %= 7;\n\n var castable1:Boolean = (a is B);\n var castable2:Boolean = (a as B) != null;\n var cast:String = B(a).toString();\n var instanced:Boolean = (_a instanceof A);\n }\n\n private function variousFlow():void\n {\n var n:Number = Math.random();\n if (n > 0.6)\n trace('top 40!');\n else if(n > 0.3)\n trace('mid 30!');\n else\n trace('bottom 30');\n\n var flip:String = (Math.random() > 0.5) ? 'heads' : 'tails';\n\n for (var i = 0; i < 100; i++)\n trace(i);\n\n var v:Vector. = ['a', 'b', 'c'];\n for each (var s:String in v)\n trace(s);\n\n var d:Dictionary. = { 'one': 1 };\n for (var key1:String in d)\n trace(key1);\n\n for (var key2:Number in v)\n trace(key2);\n\n while (i > 0)\n {\n i--;\n if (i == 13) continue;\n trace(i);\n }\n\n do\n {\n i++;\n }\n while (i < 10);\n\n switch (Math.floor(Math.random()) * 3 + 1)\n {\n case 1 : trace('rock'); break;\n case 2 : trace('paper'); break;\n default: trace('scissors'); break;\n }\n }\n\n }\n}\n" }, { "path": "src/test/resources/samples/langs/Lua/h-counter.pd_lua", "content": "\n-- A simple counting object that increments an internal counter whenever it receives a bang at its first inlet, or changes to whatever number it receives at its second inlet.\n\nlocal HelloCounter = pd.Class:new():register(\"h-counter\")\n\nfunction HelloCounter:initialize(sel, atoms)\n\tself.inlets = 2\n\tself.outlets = 1\n\tself.num = 0\n\treturn true\nend\n\nfunction HelloCounter:in_1_bang()\n\tself:outlet(1, \"float\", {self.num})\n\tself.num = self.num + 1\nend\n\nfunction HelloCounter:in_2_float(f)\n\tself.num = f\nend\n" }, { "path": "src/test/resources/samples/langs/Lua/treegen.p8", "content": "pico-8 cartridge // http://www.pico-8.com\nversion 7\n// taken from: https://github.com/lvictorino/pico8/blob/master/treegen.p8\n__lua__\n-- tree generation\n-- basic space colonization algorithm\n-- by laurent victorino\n\ntree={} --tree node list\ninfluence={} --influence list\nnewnodedist=5 -- distance between tree nodes\ninfluencedist=50 -- attraction max distance\ninfluencekilldist=10 -- distance at which an influence node is killed\ncrownw=64 -- tree crown width\ncrownh=64 -- tree crown height\ncrownx=64 -- tree crown x center position\ncronwy=64 -- tree crown y center position\ngenerate=false -- has generation started?\n\nfunction _init()\n\t-- randomize properties\n\tnewnodedist=rnd(10)+2\n\tinfluencedist=rnd(60)+20\n\tinfluencekilldist=rnd(20)+8\n\tcrownx=64+rnd(40)*(rnd(1)-rnd(1))\n\tcrowny=64+rnd(40)*(rnd(1)-rnd(1))\n\tcrownw=rnd(60)+30\n\tcrownh=rnd(60)+20\n\t--\n\tgenerate = false\n\t\n\tinitialize_root()\n\tinitialize_crown()\nend\n\n-- initialize first tree node\nfunction initialize_root()\n\ttree={}\n\tadd(tree,newnode(rnd(10)+54,127,nil,7))\nend\n\n-- initialize crown size and influence\nfunction initialize_crown()\n\tinfluence={}\n\t-- create an eliptic crown composed of 100->400 influence nodes\n\tfor i=0,rnd(100)+300 do\n\t a = rnd(1)\n\t\tx = crownx + rnd(crownw) * cos(a)\n\t\ty = crowny + rnd(crownh) * sin(a)\n\t\t-- add a new influence to the list\n\t\tadd(influence,newnode(x,y,nil,5))\n\tend\nend\n\nfunction _update()\n\t-- x button: generate a new set\n\tif btn(4) and btnp(4) == true then\n\t\t_init()\n\tend\n\t-- c button: start generation\n\tif btn(5) and btnp(5) == true then\n\t\tgenerate=true\n\tend\n\n -- generation loop\n\tif #influence != 0 and generate==true then\t\t\t\n\t\t-- reset all tree nodes influence\n\t\tfor c in all(tree) do c.resetinfluence(c) end \n\t\t-- is there any remaining influence?\n\t\tflag=false\n\t\t-- for every influence node\n\t\t-- check what node they it influenced\n\t\tfor i in all(influence) do\n\t\t\tclosest=nil\n\t\t\tfor t in all(tree) do\n\t\t\t\tif distvector(i,t) < influencedist\n\t\t\t\t\t\tand (closest==nil or abs(distvector(i,t)) < abs(distvector(i,closest))) \t\t\t\t\t\t\t\tthen\n\t\t\t\t\tflag=true\n\t\t\t\t\tclosest=t\n\t\t\t\tend\n\t\t\tend\n\t\t\tif closest!=nil then \n\t\t\t\tclosest.addinfluence(closest,i) \n\t\t\tend\n\t\tend\t\n\t\t-- if no influence remains stop the generation\n\t\tif flag == false then \n\t\t\tinfluence={}\n\t\t\tgenerate=false\n\t\t\treturn\n\t\tend\n\t\t-- for every tree node\n\t\t-- compute the influence vector\n\t\t-- and add a new tree node to the list\n\t\tfor t in all(tree) do\n\t\t\tif #t.influence != 0 then\n \t\t\tmedv={}\n\t \t\tmedv.x=0\n\t\t \tmedv.y=0\n\t\t\t for i in all(t.influence) do\n\t\t\t\t dist=distvector(i,t)\n\t\t\t\t medv.x+=(i.x-t.x)/dist -- closest influence nodes are more powerful\n\t\t\t\t medv.y+=(i.y-t.y)/dist\n\t\t\t\t -- destroy influence if too close\n\t\t\t\t if dist < influencekilldist then\n\t\t\t\t\t del(influence,i)\n\t\t\t\t end\n\t\t\t end\n\t\t\t -- compute the influence vector\n\t\t\t\tmedv.x /= #t.influence\n\t\t\t\tmedv.y /= #t.influence\n\t\t\t\t-- normalize influence vector\n\t\t\t\tnewn=normalize(medv)\n\t\t\t\t-- compute new node position\n\t\t\t\tnewn.x=t.x+newnodedist*newn.x\n\t\t\t\tnewn.y=t.y+newnodedist*newn.y\n\t\t\t\t-- add new node to the list\n\t\t\t\tadd(tree,newnode(newn.x,newn.y,t))\n\t\t\tend\n\t\tend\n\tend\nend\n\nfunction _draw()\n\tcls()\n\n\t-- draw tree lines\n\tfor t in all(tree) do\n\t\tif t.parent != nil then\n\t\t\tline(t.x,t.y,t.parent.x,t.parent.y,4)\n\t\tend\n\tend\n\t-- draw influence\n\tfor i in all(influence) do\n\t\ti.draw(i,8)\n\tend\n\n\t-- helpers\n\tcolor(13)\n\tprint(\"c:new set\\tx:generate\")\n\tprint(\"nodes\\t\\t\\t\\t\\tcount:\"..#tree..\"\\tdist:\"..flr(newnodedist))\n\tprint(\"influence\\tcount:\"..#influence..\"\\tdist:\"..flr(influencedist))\n\tif #influence==0 then\n\t\tprint(\"generation is over.\",0,123)\n\tend\nend\n\n-- generate a new node\n-- params: xpos,ypos,parent node to be attached to\nfunction newnode(x,y,parent)\n\t\tn={}\n\t\tn.x=x\n\t\tn.y=y\n\t\t-- set parent\n\t\tn.parent=parent\n\t\t-- list of influence node\n\t\tn.influence={}\n\t\t-- draw node as crosses\n\t\tn.draw=function(node,col)\n\t\t\tline(node.x,node.y-1,node.x,node.y+1,col)\n\t\t\tline(node.x-1,node.y,node.x+1,node.y,col)\n\t\tend\n\t\t-- add an influence node to the list\n\t\tn.addinfluence=function(node,influence)\n\t\t\tadd(node.influence,influence)\n\t\tend\n\t\t-- reset the influence list\n\t\tn.resetinfluence=function(node)\n\t\t\tnode.influence={}\n\t\tend\n\t\treturn n\nend\n\n-- return the distance between \n-- two vectors\nfunction distvector(v1,v2)\n\tvx=v1.x-v2.x\n\tvy=v1.y-v2.y\n\treturn sqrt(vx*vx+vy*vy)\nend\n\n-- return the magnitude of a vector\nfunction magnitude(v)\n\treturn sqrt(v.x*v.x+v.y*v.y)\nend\n\n-- return a normalized vector\nfunction normalize(v)\n\tvp={}\n\tvp.x=v.x/magnitude(v)\n\tvp.y=v.y/magnitude(v)\n\treturn vp\nend\n__gfx__\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00700700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00077000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00077000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00700700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n__gff__\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n__map__\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n__sfx__\n000100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n__music__\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n00 41424344\n" }, { "path": "src/test/resources/samples/langs/Lua/vidya-file-list-parser.pd_lua", "content": "\nlocal FileListParser = pd.Class:new():register(\"vidya-file-list-parser\")\n\nfunction FileListParser:initialize(sel, atoms)\n\n\t-- 1. Base filename\n\t-- 2. File extension\n\t-- 3. Number of files in batch\n\tself.inlets = 3\n\t\n\t-- 1. To [list trim]-[binfile]\n\t-- 2. To [vidya-file-modder]'s filename variables\n\t-- 3. Sends a bang to [vidya-file-modder], triggering the object's mechanisms\n\tself.outlets = 3\n\t\n\t-- File extension\n\tself.extension = \"jpg\"\n\t\n\t-- Number of the last file in the batch\n\tself.batchlimit = 0\n\t\n\treturn true\n\nend\n\nfunction FileListParser:in_1_symbol(s)\n\n\tfor i = 0, self.batchlimit do\n\t\tself:outlet(2, \"list\", {s, i})\n\t\tself:outlet(1, \"read\", {s .. i .. \".\" .. self.extension})\n\t\tself:outlet(1, \"info\", {})\n\t\tself:outlet(3, \"bang\", {})\n\tend\n\nend\n\nfunction FileListParser:in_2_list(d)\n\tself.extension = d[1]\nend\n\nfunction FileListParser:in_3_float(f)\n\tself.batchlimit = f\nend" }, { "path": "src/test/resources/samples/langs/Lua/vidya-file-modder.pd_lua", "content": "\nlocal FileModder = pd.Class:new():register(\"vidya-file-modder\")\n\nfunction FileModder:initialize(sel, atoms)\n\n\t-- 1. Object-triggering bang\n\t-- 2. Incoming single data bytes from [binfile]\n\t-- 3. Total bytes in file, from [route buflength]\n\t-- 4. Glitch type\n\t-- 5. Glitch point\n\t-- 6. Number of times to glitch a file\n\t-- 7. Toggle for a randomized number of glitches within the bounds of (6)\n\t-- 8. Active filename\n\tself.inlets = 8\n\t\n\t-- 1. To [binfile] inlet - bang(get next byte), clear(clear the buffer), FLOAT(write a byte to buffer), write(write to file)\n\tself.outlets = 1\n\t\n\t-- Currently active file's namedata\n\tself.filedata = {\n\t\t\"default-filename\",\n\t\t0,\n\t}\n\t\n\t-- Glitch type (pattern, random, or splice)\n\tself.glitchtype = \"random\"\n\t\n\t-- Minimum glitch point in image data\n\tself.glitchpoint = 500\n\t\n\t-- Number of times to repeat random glitches on a given file\n\tself.randrepeat = 1\n\t\n\t-- Toggles whether the number of repeating glitches should be random, within the bounds of 1 to self.randrepeat\n\tself.randtoggle = \"concrete\"\n\t\n\t-- Hold all bytes, which are converted to ints in the 0-255 range\n\tself.bytebuffer = {}\n\t\n\t-- Buffer length of currently active file\n\tself.buflength = 0\n\t\n\treturn true\n\nend\n\nfunction FileModder:in_1_bang()\n\n\tfor i = 1, self.buflength do\n\t\tself:outlet(1, \"bang\", {})\n\tend\n\t\n\tself:outlet(1, \"clear\", {})\n\t\n\tif self.glitchtype == \"pattern\" then\n\t\n\t\tlocal plen = math.random(2, 1000)\n\t\tlocal patbuffer = {}\n\t\t\n\t\tfor i = 1, plen do\n\t\t\ttable.insert(patbuffer, math.random(1, 254))\n\t\tend\n\t\t\n\t\tfor i = self.glitchpoint, self.buflength do\n\t\t\tself.bytebuffer[i] = patbuffer[((i - 1) % #patbuffer) + 1]\n\t\tend\n\t\t\n\telseif self.glitchtype == \"random\" then\n\t\n\t\tlocal randlimit = 0\n\t\tif self.randtoggle == \"random\" then\n\t\t\trandlimit = math.random(1, self.randrepeat)\n\t\telse\n\t\t\trandlimit = self.randrepeat\n\t\tend\n\t\t\n\t\tfor i = 1, randlimit do\n\t\t\tself.bytebuffer[math.random(self.glitchpoint, self.buflength)] = math.random(1, 244)\n\t\tend\n\t\t\n\telseif self.glitchtype == \"splice\" then\n\t\t\n\t\tlocal sloc = math.random(self.glitchpoint, self.buflength)\n\t\tlocal schunksize = math.random(1, self.buflength - sloc)\n\t\tlocal splicebuffer = {}\n\t\tfor i = 1, schunksize do\n\t\t\ttable.insert(splicebuffer, table.remove(self.bytebuffer, sloc))\n\t\tend\n\t\t\n\t\tlocal insertpoint = math.random(self.glitchpoint, #self.bytebuffer)\n\t\tfor _, v in ipairs(splicebuffer) do\n\t\t\ttable.insert(self.bytebuffer, insertpoint, v)\n\t\tend\n\t\t\n\tend\n\n\tfor _, v in ipairs(self.bytebuffer) do\n\t\tself:outlet(1, \"float\", {v})\n\tend\n\t\n\tlocal outname = self.filedata[1] .. \"-glitch\" .. self.filedata[2] .. \".jpeg\"\n\tself:outlet(1, \"write\", {outname})\n\tpd.post(\"New glitched image: \" .. outname)\n\t\n\tself:outlet(1, \"clear\", {})\n\t\n\tself.bytebuffer = {}\n\nend\n\nfunction FileModder:in_2_float(f)\n\ttable.insert(self.bytebuffer, f)\nend\n\nfunction FileModder:in_3_list(f)\n\tself.buflength = f[1] + 1 -- Shift from 0-indexed to 1-indexed\nend\n\nfunction FileModder:in_4_list(d)\n\tself.glitchtype = d[1]\nend\n\nfunction FileModder:in_5_float(f)\n\tself.glitchpoint = f\nend\n\nfunction FileModder:in_6_float(f)\n\tself.randrepeat = f\nend\n\nfunction FileModder:in_7_list(d)\n\tself.randtoggle = d[1]\nend\n\nfunction FileModder:in_8_list(d)\n\tself.filedata = {d[1], d[2]}\nend\n" }, { "path": "src/test/resources/samples/langs/Lua/wsapi.fcgi", "content": "#!/usr/bin/lua\n\n-- Generic WSAPI FastCGI launcher, extracts application to launch\n-- from SCRIPT_FILENAME/PATH_TRANSLATED, each application (defined\n-- by its script entry point) gets an isolated Lua VM; sequential\n-- requests to the same application go to the same VM\n\npcall(require,\"luarocks.require\")\n\nlocal common = require \"wsapi.common\"\nlocal fastcgi = require \"wsapi.fastcgi\"\n\nlocal ONE_HOUR = 60 * 60\nlocal ONE_DAY = 24 * ONE_HOUR\n\nlocal wsapi_loader = common.make_loader{\n isolated = true, -- isolate each script in its own Lua state\n filename = nil, -- if you want to force the launch of a single script\n launcher = \"wsapi.fcgi\", -- the name of this script\n reload = false, -- if you want to reload the application on every request\n period = ONE_HOUR, -- frequency of Lua state staleness checks\n ttl = ONE_DAY, -- time-to-live for Lua states\n vars = -- order of checking for the path of the script\n { \"SCRIPT_FILENAME\",\n \"PATH_TRANSLATED\" } \n}\n\nfastcgi.run(wsapi_loader)\n" }, { "path": "src/test/resources/samples/langs/M/Comment.m", "content": "Comment ;\n ; this is a comment block\n ; comments always start with a semicolon\n ; the next line, while not a comment, is a legal blank line\n \n ;whitespace alone is a valid line in a routine\n ;** Comments can have any graphic character, but no \"control\"\n ;** characters\n \n ;graphic characters such as: !@#$%^&*()_+=-{}[]|\\:\"?/>.<,\n ;the space character is considered a graphic character, even \n ;though you can't see it.\n ; ASCII characters whose numeric code is above 128 and below 32\n ; are NOT allowed on a line in a routine.\n ;; multiple semicolons are okay\n ; a line that has a tag must have whitespace after the tag, bug\n ; does not have to have a comment or a command on it\nTag1 \n ;\n ;Tags can start with % or an uppercase or lowercase alphabetic\n ; or can be a series of numeric characters\n%HELO ;\n ;\n0123 ;\n ;\n%987 ;\n ; the most common label is uppercase alphabetic\nLABEL ;\n ; \n ; Tags can be followed directly by an open parenthesis and a\n ; formal list of variables, and a close parenthesis\nANOTHER(X) ;\n ;\n ;Normally, a subroutine would be ended by a QUIT command, but we\n ; are taking advantage of the rule that the END of routine is an\n ; implicit QUIT\n" }, { "path": "src/test/resources/samples/langs/M/GMRGPNB0.m", "content": "GMRGPNB0 ;CISC/JH/RM-NARRATIVE BUILDER FOR TEXT GENERATOR (cont.) ;6/20/91\n ;;3.0;Text Generator;;Jan 24, 1996\nTEXT ; ENTRY WITH GMRGA SET TO POINT AT WHICH WANT TO START BUILDING TEXT\n S (GMRGE0,GMRGADD)=\"\"\n Q:'$D(^GMR(124.3,GMRGPDA,1,\"ALIST\",GMRGA0))&GMRGCSW Q:('$D(^GMR(124.3,\"B\",GMRGA0,GMRGPDA))&'$D(^GMR(124.3,GMRGPDA,1,\"B\",GMRGA0)))&'GMRGCSW D NOW^%DTC\n S GMRGB0=$O(^GMR(124.3,GMRGPDA,1,\"B\",GMRGA0,0)) I GMRGB0>0 S GMRGST=GMRGB0,GMRGST(1)=GMRGPDA,GMRGST(2)=$S(GMRGCSW=1:%,1:GMRGPDT) D STAT^GMRGRUT0 S GMRGF0=GMRGSTAT,GMRGST=GMRGB0,GMRGST(1)=GMRGPDA,GMRGST(2)=GMRGPDT D STAT^GMRGRUT0\n I GMRGB0>0 S GMRGE0=$S($P(GMRGSTAT,\"^\",3)=1:\"\",$P(GMRGSTAT,\"^\")=$P(GMRGF0,\"^\"):$S($D(^GMR(124.3,GMRGPDA,1,GMRGB0,0)):$P(^(0),\"^\",2),1:\"\"),1:$S($D(^GMR(124.3,GMRGPDA,1,GMRGB0,2,+$P(GMRGSTAT,\"^\"),0)):$P(^(0),\"^\",4),1:\"\"))\n I S GMRGADD=$S($P(GMRGSTAT,\"^\",3)=1:\"\",$P(GMRGSTAT,\"^\")=$P(GMRGF0,\"^\"):$S($D(^GMR(124.3,GMRGPDA,1,GMRGB0,\"ADD\")):\"1;\"_GMRGB0_\";0\",1:\"\"),1:$S($D(^GMR(124.3,GMRGPDA,1,GMRGB0,2,$P(GMRGSTAT,\"^\"),\"ADD\")):\"1;\"_GMRGB0_\";2;\"_$P(GMRGSTAT,\"^\"),1:\"\"))\n S GMRGE0(0)=$S($D(^GMRD(124.2,GMRGA0,0)):^(0),1:\"\"),GMRGE0(4)=$S($D(^GMRD(124.2,GMRGA0,4)):^(4),1:\"\"),GMRGE0(5)=$S($D(^GMRD(124.2,GMRGA0,5)):^(5),1:\"\") Q:$P(GMRGE0(0),\"^\",2)=3&GMRGSSW\n I \"S\"[$P(GMRGE0(0),\"^\",8)!GMRGSSW D SNT^GMRGPNB1 Q\n S GMRGNAR=GMRGPAR_\"^\"_$P(GMRGE0(0),\"^\",8)_\"^\"_GMRGSPC_\"^^\"_GMRGRM,GMRGNAR(0)=$P(GMRGE0(0),\"^\")_\"^\"_GMRGE0,GMRGNAR(\"LEAD\")=GMRGE0(4),GMRGNAR(\"TRAIL\")=GMRGE0(5) D STORETXT^GMRGRUT1\n S GMRGSPC=GMRGSPC+3\n F GMRGD0=0:0 S GMRGD0=$O(^GMRD(124.2,GMRGA0,1,GMRGD0)) Q:GMRGD0'>0 D RECUR\n Q:'GMRGADD\n S GMRGNAR=GMRGPAR_\"^T^\"_GMRGSPC_\"^^\"_GMRGRM,GMRGNAR(\"LEAD\")=\"Additional Text: \",GMRGNAR(\"TRAIL\")=\"\"\n S GMRGNAR(0)=$S('$P(GMRGADD,\";\",3):^GMR(124.3,GMRGPDA,1,$P(GMRGADD,\";\",2),\"ADD\"),1:^GMR(124.3,GMRGPDA,1,$P(GMRGADD,\";\",2),2,$P(GMRGADD,\";\",4),\"ADD\")) D STORETXT^GMRGRUT1\n Q\nRECUR ;\n Q:'$$ALIST^GMRGRUT0(GMRGPDA,GMRGA0,+$G(^GMRD(124.2,+GMRGA0,1,+GMRGD0,0)))\n S ^TMP($J,\"GMRGPLVL\",GMRGPLVL)=GMRGA0_\"^\"_GMRGD0_\"^\"_GMRGSPC_\"^\"_GMRGSSW_\"^\"_GMRGADD,GMRGPLVL=GMRGPLVL+1,GMRGA0=$S($D(^GMRD(124.2,GMRGA0,1,GMRGD0,0)):$P(^(0),\"^\"),1:\"\")\n D TEXT\n S GMRGPLVL=GMRGPLVL-1,GMRGI0=^TMP($J,\"GMRGPLVL\",GMRGPLVL),GMRGA0=$P(GMRGI0,\"^\"),GMRGD0=$P(GMRGI0,\"^\",2),GMRGSPC=$P(GMRGI0,\"^\",3),GMRGSSW=$P(GMRGI0,\"^\",4),GMRGADD=$P(GMRGI0,\"^\",5)\n Q\n" }, { "path": "src/test/resources/samples/langs/M/MDB.m", "content": "MDB ; M/DB: Mumps Emulation of Amazon SimpleDB\n ;\n ; ----------------------------------------------------------------------------\n ; | M/DB |\n ; | Copyright (c) 2004-11 M/Gateway Developments Ltd, |\n ; | Reigate, Surrey UK. |\n ; | All rights reserved. |\n ; | |\n ; | http://www.mgateway.com |\n ; | Email: rtweed@mgateway.com |\n ; | |\n ; | This program is free software: you can redistribute it and/or modify |\n ; | it under the terms of the GNU Affero General Public License as |\n ; | published by the Free Software Foundation, either version 3 of the |\n ; | License, or (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 Affero General Public License for more details. |\n ; | |\n ; | You should have received a copy of the GNU Affero General Public License |\n ; | along with this program. If not, see . |\n ; ----------------------------------------------------------------------------\n ;\n ;\nversion()\t\n\tQUIT \"44\"\n\t;\nbuildDate()\t\n\tQUIT \"06 July 2011\"\n\t;\nindexLength()\n QUIT 180\n ;\n ; Note: keyId will have been tested and must be valid\n ; by the time these methods are called\n ;\n ; To Initialise the service: http://192.168.1.xxx/mdb/test.mgwsi?Action=Initialise\n ;\naddUser(userKeyId,userSecretKey,requestId,boxUsage)\n ;\n n startTime,stop\n ;\n s requestId=$$init(.startTime)\n s ^MDBUAF(\"keys\",userKeyId)=userSecretKey\n QUIT $$end(startTime,.boxUsage)\n ;\ncreateDomain(keyId,domainName,requestId,boxUsage)\n ;\n n dn,dnx,id,noOfDomains,startTime,token\n ;\n s requestId=$$init(.startTime)\n s keyId=$g(keyId)\n i keyId=\"\" QUIT $$end(startTime,.boxUsage,\"MissingParameter\",\"AWSAccessKeyId\")\n s domainName=$g(domainName)\n i domainName=\"\" QUIT $$end(startTime,.boxUsage,\"MissingParameter\",\"DomainName\")\n s dn=$tr(domainName,\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz1234567890_-.\",\"\")\n i dn'=\"\" QUIT $$end(startTime,.boxUsage,\"InvalidParameterValue\",domainName,\"DomainName\")\n ;\n s noOfDomains=+$g(^MDB(keyId))\n i $g(^MDBConfig(\"DomainsPerAccount\"))'=\"\",noOfDomains=^MDBConfig(\"DomainsPerAccount\") QUIT $$end(startTime,.boxUsage,\"NumberDomainsExceeded\")\n s dnx=$e(domainName,1,$$indexLength())\n i '$$domainExists(keyId,domainName) d\n . s noOfDomains=$increment(^MDB(keyId))\n . s id=$increment(^MDB(keyId,\"domains\"))\n . s ^MDB(keyId,\"domains\",id,\"name\")=domainName\n . s ^MDB(keyId,\"domains\",id,\"created\")=$h\n . d updateDomainMetaData(keyId,id)\n . s ^MDB(keyId,\"domainIndex\",dnx,id)=\"\"\n ;\n QUIT $$end(startTime,.boxUsage)\n ;\nupdateDomainMetaData(keyId,id)\n ;\n s ^MDB(keyId,\"domains\",id,\"modified\")=$h\n QUIT\n ;\ngetDomainMetaData(keyId,domainId,metaData)\n ;\n n size,timestamp\n ;\n k metaData\n s timestamp=$g(^MDB(keyId,\"domains\",domainId,\"modified\"))\n s timestamp=$$convertToEpochTime(timestamp)\n s metaData(\"Timestamp\")=timestamp\n s metaData(\"ItemCount\")=$$countItems(keyId,domainId,.size)_\".0\"\n s metaData(\"ItemNamesSizeBytes\")=size_\".0\"\n s metaData(\"AttributeValueCount\")=$$countNVPs(keyId,domainId,.size)_\".0\"\n s metaData(\"AttributeValuesSizeBytes\")=size_\".0\"\n s metaData(\"AttributeNameCount\")=$$countAttributeNames(keyId,domainId,.size)_\".0\"\n s metaData(\"AttributeNamesSizeBytes\")=size_\".0\"\n QUIT\n ;\ndomainMetadata(keyId,domainName,metaData,requestId,boxUsage)\n ;\n n domainId,startTime\n ;\n s requestId=$$init(.startTime)\n s keyId=$g(keyId)\n i keyId=\"\" QUIT $$end(startTime,.boxUsage,\"MissingParameter\",\"AWSAccessKeyId\")\n s domainName=$g(domainName)\n i domainName=\"\" QUIT $$end(startTime,.boxUsage,\"MissingParameter\",\"DomainName\")\n s domainId=$$getDomainId(keyId,domainName)\n i domainId=\"\" QUIT $$end(startTime,.boxUsage,\"NoSuchDomain\",\"The specified domain does not exist.\")\n ;\n d getDomainMetaData(keyId,domainId,.metaData)\n ;\n QUIT $$end(startTime,.boxUsage)\n ;\nconvertToEpochTime(dh)\n ;\n n time\n ;\n s time=(dh*86400)+$p(dh,\",\",2)\n s time=time-4070908800\n QUIT time\n ;\nconvertFromEpochTime(time)\n ;\n n dh\n ;\n s time=time+4070908800\n s dh=time\\86400\n s time=time#86400\n QUIT dh_\",\"_time\n ;\ncountItems(keyId,domainId,size)\n ;\n n count,id\n ;\n s id=\"\",count=0,size=0\n f s id=$o(^MDB(keyId,\"domains\",domainId,\"items\",id)) q:id=\"\" d\n . s count=count+1\n . s size=size+$l(^MDB(keyId,\"domains\",domainId,\"items\",id))\n QUIT count\n ;\ncountNVPs(keyId,domainId,size)\n ;\n n attribId,count,itemId,valueId\n ;\n s itemId=\"\",count=0,size=0\n f s itemId=$o(^MDB(keyId,\"domains\",domainId,\"items\",itemId)) q:itemId=\"\" d\n . s attribId=0\n . f s attribId=$o(^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId)) q:attribId=\"\" d\n . . s valueId=\"\"\n . . f s valueId=$o(^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"value\",valueId)) q:valueId=\"\" d\n . . . s count=count+1\n . . . s size=size+$l(^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"value\",valueId))\n QUIT count\n ;\ncountAttributeNames(keyId,domainId,size)\n ;\n n attribId,count,name\n ;\n s attribId=0,count=0,size=0\n f s attribId=$o(^MDB(keyId,\"domains\",domainId,\"attribs\",attribId)) q:attribId=\"\" d\n . s count=count+1\n . s name=^MDB(keyId,\"domains\",domainId,\"attribs\",attribId)\n . s size=size+$l(name)\n QUIT count\n ;\n \ndomainExists(keyId,name)\n ;\n n id\n ;\n s id=$$getDomainId($g(keyId),$g(name))\n QUIT (id'=\"\")\n ;\ngetDomainId(keyId,name)\n ;\n n found,id,namex\n ;\n i $g(name)=\"\" QUIT \"\"\n i $g(keyId)=\"\" QUIT \"\"\n s namex=$e(name,1,$$indexLength())\n s id=\"\",found=0\n f s id=$o(^MDB(keyId,\"domainIndex\",namex,id)) q:id=\"\" d q:found\n . i $g(^MDB(keyId,\"domains\",id,\"name\"))=name s found=1\n i id'=\"\",'$d(^MDB(keyId,\"domains\",id,\"attribs\",0)) d buildItemNameIndex(keyId,id)\n QUIT id\n ;\nbuildItemNameIndex(keyId,domainId)\n ;\n n itemId,itemValue,itemValuex\n ;\n s ^MDB(keyId,\"domains\",domainId,\"attribs\",0)=\"itemName()\"\n s ^MDB(keyId,\"domains\",domainId,\"attribsIndex\",\"itemName()\",0)=\"\"\n s itemId=\"\"\n f s itemId=$o(^MDB(keyId,\"domains\",domainId,\"items\",itemId)) q:itemId=\"\" d\n . s itemValue=^MDB(keyId,\"domains\",domainId,\"items\",itemId)\n . s itemValuex=$e(itemValue,1,$$indexLength())\n . s ^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",0,\"value\")=1\n . s ^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",0,\"value\",1)=itemValue\n . s ^MDB(keyId,\"domains\",domainId,\"queryIndex\",0,itemValuex,itemId)=\"\"\n QUIT \n ;\ncountDomains(key)\n ;\n n id,no\n ;\n s id=\"\",no=0\n f s id=$o(^MDB(key,\"domains\",id)) q:id=\"\" s no=no+1\n QUIT no\n ;\ndeleteDomain(keyId,domainName,requestId,boxUsage)\n ;\n n dn,dnx,id,noOfDomains,startTime,token\n ;\n s requestId=$$init(.startTime)\n s keyId=$g(keyId)\n i keyId=\"\" QUIT $$end(startTime,.boxUsage,\"MissingParameter\",\"AWSAccessKeyId\")\n s domainName=$g(domainName)\n i domainName=\"\" QUIT $$end(startTime,.boxUsage,\"MissingParameter\",\"DomainName\")\n s id=$$getDomainId(keyId,domainName)\n i id=\"\" QUIT $$end(startTime,.boxUsage)\n k ^MDB(keyId,\"domains\",id)\n k ^MDB(keyId,\"domainIndex\",$e(domainName,1,$$indexLength()),id)\n s noOfDomains=$$countDomains(keyId)\n i noOfDomains>0 d\n . s ^MDB(keyId)=noOfDomains\n e d\n . k ^MDB(keyId)\n ;\n QUIT $$end(startTime,.boxUsage)\n ;\nlistDomains(keyId,maxNoOfDomains,nextToken,domainList,requestId,boxUsage)\n ;\n n domainName,fullName,id,noOfDomains,startTime,stop,token\n ;\n s requestId=$$init(.startTime)\n s keyId=$g(keyId)\n i keyId=\"\" QUIT $$end(startTime,.boxUsage,\"MissingParameter\",\"AWSAccessKeyId\")\n k domainList s noOfDomains=0,stop=0\n i $g(nextToken)=\"\" d\n . s domainName=\"\"\n e d\n . s domainName=$$decodeBase64(nextToken)\n s nextToken=\"\"\n f s domainName=$o(^MDB(keyId,\"domainIndex\",domainName)) q:domainName=\"\" d q:stop\n . s id=\"\"\n . f s id=$o(^MDB(keyId,\"domainIndex\",domainName,id)) q:id=\"\" d\n . . s fullName=$g(^MDB(keyId,\"domains\",id,\"name\"))\n . . s noOfDomains=noOfDomains+1\n . . s domainList(noOfDomains)=fullName\n . i noOfDomains=maxNoOfDomains d q\n . . s stop=1\n . . s nextToken=$$encodeBase64(domainName)\n ;\n QUIT $$end(startTime,.boxUsage)\n ;\nitemExists(keyId,domainId,name)\n ;\n n id\n ;\n s id=$$getItemId($g(keyId),$g(domainId),$g(name))\n QUIT (id'=\"\")\n ;\ngetItemId(keyId,domainId,name)\n ;\n n found,id,namex\n ;\n i $g(domainId)=\"\" QUIT \"\"\n i $g(name)=\"\" QUIT \"\"\n i $g(keyId)=\"\" QUIT \"\"\n i domainId=\"\" QUIT \"\"\n s namex=$e(name,1,$$indexLength())\n s id=\"\",found=0\n f s id=$o(^MDB(keyId,\"domains\",domainId,\"itemIndex\",namex,id)) q:id=\"\" d q:found\n . i $g(^MDB(keyId,\"domains\",domainId,\"items\",id))=name s found=1\n QUIT id\n ;\ngetAttributeId(keyId,domainId,name)\n ;\n n found,id,namex\n ;\n i $g(domainId)=\"\" QUIT \"\"\n i $g(name)=\"\" QUIT \"\"\n i $g(keyId)=\"\" QUIT \"\"\n i domainId=\"\" QUIT \"\"\n s namex=$e(name,1,$$indexLength())\n s id=\"\",found=0\n f s id=$o(^MDB(keyId,\"domains\",domainId,\"attribsIndex\",namex,id)) q:id=\"\" d q:found\n . i $g(^MDB(keyId,\"domains\",domainId,\"attribs\",id))'=name q\n . s found=1\n QUIT id\n ;\ngetAttributeValueId(keyId,domainId,itemId,attribId,value)\n ;\n n found,id,valuex\n ;\n i $g(domainId)=\"\" QUIT \"\"\n i '$d(value) QUIT \"\"\n i $g(keyId)=\"\" QUIT \"\"\n i domainId=\"\" QUIT \"\"\n i value=\"\" s value=$c(31)\n s itemId=$g(itemId)\n i itemId=\"\" QUIT \"\"\n s valuex=$e(value,1,$$indexLength())\n s id=\"\",found=0\n f s id=$o(^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"valueIndex\",valuex,id)) q:id=\"\" d q:found\n . i $g(^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"value\",id))'=value q\n . s found=1\n QUIT id\n \nputAttributes(keyId,domainName,itemName,attributes,requestId,boxUsage)\n ;\n n attribId,domainId,itemId,name,namex,no,replace,startTime,value,valueId,valuex,xvalue\n ;\n s requestId=$$init(.startTime)\n s keyId=$g(keyId)\n i keyId=\"\" QUIT $$end(startTime,.boxUsage,\"MissingParameter\",\"AWSAccessKeyId\")\n s domainName=$g(domainName)\n i domainName=\"\" QUIT $$end(startTime,.boxUsage,\"MissingParameter\",\"DomainName\")\n s domainId=$$getDomainId(keyId,domainName)\n i domainId=\"\" QUIT $$end(startTime,.boxUsage,\"NoSuchDomain\",\"The specified domain does not exist.\")\n s itemName=$g(itemName)\n i itemName=\"\" QUIT $$end(startTime,.boxUsage,\"MissingParameter\",\"ItemName\")\n s itemId=$$getItemId(keyId,domainId,itemName)\n i itemId=\"\" d\n . ; add Item to Domain if it's new\n . n itemNamex\n . s itemNamex=$e(itemName,1,$$indexLength())\n . s itemId=$increment(^MDB(keyId,\"domains\",domainId,\"items\"))\n . s ^MDB(keyId,\"domains\",domainId,\"itemIndex\",itemNamex,itemId)=\"\"\n . s ^MDB(keyId,\"domains\",domainId,\"items\",itemId)=itemName\n . s ^MDB(keyId,\"domains\",domainId,\"attribs\",0)=\"itemName()\"\n . s ^MDB(keyId,\"domains\",domainId,\"attribsIndex\",\"itemName()\",0)=\"\"\n . s ^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",0,\"value\")=1\n . s ^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",0,\"value\",1)=itemName\n . s ^MDB(keyId,\"domains\",domainId,\"queryIndex\",0,itemNamex,itemId)=\"\"\n ;\n ; attributes(no,\"name\")=attribute name\n ; attributes(no,\"value\")=attribute value\n ; attributes(no,\"replace\")=1\n ;\n s no=\"\"\n f s no=$o(attributes(no)) q:no=\"\" d\n . s name=$g(attributes(no,\"name\"))\n . s value=$g(attributes(no,\"value\"))\n . i value=\"\" s value=$c(31)\n . s replace=+$g(attributes(no,\"replace\"))\n . s namex=$e(name,1,$$indexLength())\n . s valuex=$e(value,1,$$indexLength())\n . s attribId=$$getAttributeId(keyId,domainId,name)\n . i attribId=\"\" d\n . . ; add new attribute name to the domain\n . . s attribId=$increment(^MDB(keyId,\"domains\",domainId,\"attribs\"))\n . . s ^MDB(keyId,\"domains\",domainId,\"attribs\",attribId)=name\n . . s ^MDB(keyId,\"domains\",domainId,\"attribsIndex\",namex,attribId)=\"\"\n . s valueId=$$getAttributeValueId(keyId,domainId,itemId,attribId,value)\n . i 'replace,valueId'=\"\" q ; Not allowed to have more than one attribute with the same name and value\n . i replace d\n . . ; first remove any existing values for this attribute name\n . . f s valueId=$o(^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"value\",valueId)) q:valueId=\"\" d\n . . . s xvalue=^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"value\",valueId)\n . . . k ^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"valueIndex\",xvalue,valueId)\n . . . k ^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue,itemId)\n . . k ^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"value\")\n . ; now add the new attribute name/value pair\n . s valueId=$increment(^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"value\"))\n . s ^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"value\",valueId)=value\n . s ^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"valueIndex\",valuex,valueId)=\"\"\n . s ^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,valuex,itemId)=\"\"\n ;\n d updateDomainMetaData(keyId,domainId)\n QUIT $$end(startTime,.boxUsage)\n ;\nbatchPutItem(keyId,domainId,itemName,attributesJSON)\n ;\n n attribId,attributes,error,itemId,name,namex,no,replace,value,valueId,valuex,xvalue\n ;\n ;d trace^zmwire(\"batchPutItem: keyid=\"_keyId_\"; domainId=\"_domainId_\"; itemName=\"_itemName_\"; attributes=\"_attributesJSON)\n s itemName=$g(itemName)\n i itemName=\"\" QUIT 0\n s itemId=$$getItemId(keyId,domainId,itemName)\n i itemId=\"\" d\n . ; add Item to Domain if it's new\n . n itemNamex\n . s itemNamex=$e(itemName,1,$$indexLength())\n . s itemId=$increment(^MDB(keyId,\"domains\",domainId,\"items\"))\n . s ^MDB(keyId,\"domains\",domainId,\"itemIndex\",itemNamex,itemId)=\"\"\n . s ^MDB(keyId,\"domains\",domainId,\"items\",itemId)=itemName\n . s ^MDB(keyId,\"domains\",domainId,\"attribs\",0)=\"itemName()\"\n . s ^MDB(keyId,\"domains\",domainId,\"attribsIndex\",\"itemName()\",0)=\"\"\n . s ^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",0,\"value\")=1\n . s ^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",0,\"value\",1)=itemName\n . s ^MDB(keyId,\"domains\",domainId,\"queryIndex\",0,itemNamex,itemId)=\"\"\n ;\n s error=$$parseJSON^zmwire(attributesJSON,.attributes,1)\n ;\n ; attributes(no,\"name\")=attribute name\n ; attributes(no,\"value\")=attribute value\n ; attributes(no,\"replace\")=1\n ;\n s no=\"\"\n f s no=$o(attributes(no)) q:no=\"\" d\n . s name=$g(attributes(no,\"name\"))\n . s value=$g(attributes(no,\"value\"))\n . i value=\"\" s value=$c(31)\n . s replace=+$g(attributes(no,\"replace\"))\n . s namex=$e(name,1,$$indexLength())\n . s valuex=$e(value,1,$$indexLength())\n . s attribId=$$getAttributeId(keyId,domainId,name)\n . i attribId=\"\" d\n . . ; add new attribute name to the domain\n . . s attribId=$increment(^MDB(keyId,\"domains\",domainId,\"attribs\"))\n . . s ^MDB(keyId,\"domains\",domainId,\"attribs\",attribId)=name\n . . s ^MDB(keyId,\"domains\",domainId,\"attribsIndex\",namex,attribId)=\"\"\n . s valueId=$$getAttributeValueId(keyId,domainId,itemId,attribId,value)\n . i 'replace,valueId'=\"\" q ; Not allowed to have more than one attribute with the same name and value\n . i replace d\n . . ; first remove any existing values for this attribute name\n . . f s valueId=$o(^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"value\",valueId)) q:valueId=\"\" d\n . . . s xvalue=^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"value\",valueId)\n . . . k ^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"valueIndex\",xvalue,valueId)\n . . . k ^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue,itemId)\n . . k ^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"value\")\n . ; now add the new attribute name/value pair\n . s valueId=$increment(^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"value\"))\n . s ^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"value\",valueId)=value\n . s ^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"valueIndex\",valuex,valueId)=\"\"\n . s ^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,valuex,itemId)=\"\"\n QUIT 1\n ;\ngetAttributes(keyId,domainName,itemName,attributes,requestId,boxUsage,suppressBoxUsage)\n ;\n n attribId,attrNo,domainId,itemId,name,startTime,value,valueId,valueNo\n ;\n s requestId=\"\"\n i '$g(suppressBoxUsage) s requestId=$$init(.startTime)\n s keyId=$g(keyId)\n i keyId=\"\" QUIT $$end(startTime,.boxUsage,\"MissingParameter\",\"AWSAccessKeyId\")\n s domainName=$g(domainName)\n i domainName=\"\" QUIT $$end(startTime,.boxUsage,\"MissingParameter\",\"DomainName\")\n s domainId=$$getDomainId(keyId,domainName)\n i domainId=\"\" QUIT $$end(startTime,.boxUsage,\"NoSuchDomain\",\"The specified domain does not exist.\")\n s itemName=$g(itemName)\n i itemName=\"\" QUIT $$end(startTime,.boxUsage,\"MissingParameter\",\"ItemName\")\n s itemId=$$getItemId(keyId,domainId,itemName)\n i itemId=\"\" QUIT $$end(startTime,.boxUsage,\"NoSuchItemName\",\"The specified ItemName does not exist.\")\n ;\n ; attributes(no)=attribute name\n ; attributes(no,\"value\",vno)=attribute value\n ;\n i '$d(attributes) d\n . s name=\"\",attrNo=0\n . f s name=$o(^MDB(keyId,\"domains\",domainId,\"attribsIndex\",name)) q:name=\"\" d \n . . s attribId=0\n . . f s attribId=$o(^MDB(keyId,\"domains\",domainId,\"attribsIndex\",name,attribId)) q:attribId=\"\" d\n . . . i '$d(^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId)) q\n . . . s attrNo=attrNo+1\n . . . s attributes(attrNo)=^MDB(keyId,\"domains\",domainId,\"attribs\",attribId)\n . . . s valueId=\"\",valueNo=0\n . . . f s valueId=$o(^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"value\",valueId)) q:valueId=\"\" d\n . . . . s value=^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"value\",valueId)\n . . . . s valueNo=valueNo+1\n . . . . i value=$c(31) s value=\"\"\n . . . . s attributes(attrNo,\"value\",valueNo)=value\n e d\n . s attrNo=\"\"\n . f s attrNo=$o(attributes(attrNo)) q:attrNo=\"\" d\n . . s name=attributes(attrNo)\n . . s attribId=$$getAttributeId(keyId,domainId,name)\n . . i attribId=\"\" q\n . . s valueId=\"\",valueNo=0\n . . f s valueId=$o(^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"value\",valueId)) q:valueId=\"\" d\n . . . s value=^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"value\",valueId)\n . . . s valueNo=valueNo+1\n . . . i value=$c(31) s value=\"\"\n . . . s attributes(attrNo,\"value\",valueNo)=value\n . . . ;i $g(^zewd(\"trace\")) d trace($h_\": attributes(\"_attrNo_\",value,\"_valueNo_\")=\"_value)\n ;\n i $g(suppressBoxUsage) QUIT \"\"\n QUIT $$end(startTime,.boxUsage)\n ;\ndeleteAttributes(keyId,domainName,itemName,attributes,requestId,boxUsage)\n ;\n n attribId,attrNo,domainId,itemId,name,namex,startTime,value,valueId,valueNo,valuex\n ;\n s requestId=$$init(.startTime)\n s keyId=$g(keyId)\n i keyId=\"\" QUIT $$end(startTime,.boxUsage,\"MissingParameter\",\"AWSAccessKeyId\")\n s domainName=$g(domainName)\n i domainName=\"\" QUIT $$end(startTime,.boxUsage,\"MissingParameter\",\"DomainName\")\n s domainId=$$getDomainId(keyId,domainName)\n i domainId=\"\" QUIT $$end(startTime,.boxUsage,\"NoSuchDomain\",\"The specified domain does not exist.\")\n s itemName=$g(itemName)\n i itemName=\"\" QUIT $$end(startTime,.boxUsage,\"MissingParameter\",\"ItemName\")\n s itemId=$$getItemId(keyId,domainId,itemName)\n i itemId=\"\" QUIT $$end(startTime,.boxUsage,\"NoSuchItemName\",\"The specified ItemName does not exist.\")\n i '$d(attributes) d\n . ; delete all attributes for this item, first the associated queryIndex records\n . s attribId=\"\"\n . f s attribId=$o(^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId)) q:attribId=\"\" d\n . . s valuex=\"\"\n . . f s valuex=$o(^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"valueIndex\",valuex)) q:valuex=\"\" d\n . . . k ^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,valuex,itemId)\n . k ^MDB(keyId,\"domains\",domainId,\"items\",itemId)\n . s namex=$e(itemName,1,$$indexLength())\n . k ^MDB(keyId,\"domains\",domainId,\"itemIndex\",namex,itemId)\n e d\n . ;delete the specified attribute name/value pairs\n . ; attributes(no)=name\n . ; attributes(no,\"value\",vno)=value\n . s attrNo=\"\"\n . f s attrNo=$o(attributes(attrNo)) q:attrNo=\"\" d\n . . s name=$g(attributes(attrNo))\n . . i name=\"\" q\n . . s attribId=$$getAttributeId(keyId,domainId,name)\n . . i attribId=\"\" q\n . . s valueNo=\"\"\n . . f s valueNo=$o(attributes(attrNo,\"value\",valueNo)) q:valueNo=\"\" d\n . . . s value=attributes(attrNo,\"value\",valueNo)\n . . . s valueId=$$getAttributeValueId(keyId,domainId,itemId,attribId,value)\n . . . i valueId=\"\" q\n . . . ; remove specified value\n . . . s valuex=$e(value,1,$$indexLength())\n . . . k ^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"valueIndex\",valuex,valueId)\n . . . k ^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"value\",valueId)\n . . . k ^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,valuex,itemId)\n . . ; if no values are left, completely remove attribute from item\n . . i $o(^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"value\",\"\"))=\"\" d\n . . . k ^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId,\"value\")\n . . ; if no references left to this attribute name, remove the attribute name\n . . i '$d(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId)) d\n . . . s namex=$e(name,1,$$indexLength())\n . . . k ^MDB(keyId,\"domains\",domainId,\"attribs\",attribId)\n . . . k ^MDB(keyId,\"domains\",domainId,\"attribsIndex\",namex,attribId)\n . ; if no attributes are left, remove the item\n . i $o(^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",\"\"))=\"\" d\n . . k ^MDB(keyId,\"domains\",domainId,\"items\",itemId)\n . . s namex=$e(itemName,1,$$indexLength())\n . . k ^MDB(keyId,\"domains\",domainId,\"itemIndex\",namex,itemId)\n . . k ^MDB(keyId,\"domains\",domainId,\"attribs\")\n . . k ^MDB(keyId,\"domains\",domainId,\"attribsIndex\")\n ;\n QUIT $$end(startTime,.boxUsage)\n ;\nquery(keyId,domainName,queryExpression,maxNoOfItems,nextToken,itemList,requestId,boxUsage)\n ;\n n context,name,error,startTime,stop,token,value,xvalue\n ;\n i $zv[\"GT.M\" d\n . s context=1\n . i $d(^zewd(\"config\",\"MGWSI\")) s context=0\n s requestId=$$init(.startTime)\n s keyId=$g(keyId)\n i keyId=\"\" QUIT $$end(startTime,.boxUsage,\"MissingParameter\",\"keyId\")\n s domainName=$g(domainName)\n i domainName=\"\" QUIT $$end(startTime,.boxUsage,\"MissingParameter\",\"DomainName\")\n s queryExpression=$g(queryExpression)\n i $g(^zewd(\"trace\"))=1 d trace(\"Query Expression=\"_queryExpression)\n s maxNoOfItems=$g(maxNoOfItems)\n k itemList\n ;\n s error=\"\"\n i $g(nextToken)'=\"\" d QUIT error\n . n n,pos\n . s pos=$g(^MDB(keyId,\"queryResults\",\"nextToken\",nextToken))\n . i pos=\"\" s error=\"InvalidNextToken~The specified next token is not valid\" q\n . s n=0,nextToken=\"\"\n . f s pos=$o(^MDB(keyId,\"queryResults\",\"itemList\",pos)) q:pos=\"\" d q:n=maxNoOfItems\n . . s n=n+1\n . . s itemList(n)=^MDB(keyId,\"queryResults\",\"itemList\",pos)\n . i pos'=\"\" d\n . . s nextToken=itemList(n)\n . . i $zv[\"GT.M\" d\n . . . s nextToken=$$B64^%ZMGWSIS(nextToken)\n . . e d\n . . . s nextToken=$$b64Encode^MDBMCache(nextToken)\n . . s ^MDB(keyId,\"queryResults\",\"nextToken\",nextToken)=pos\n . e d\n . . k ^MDB(keyId,\"queryResults\")\n . s error=$$end(startTime,.boxUsage)\n ;\n s nextToken=\"\"\n s error=$$runQuery(keyId,domainName,queryExpression,nextToken,.itemList)\n i error'=\"\" QUIT error\n i $g(maxNoOfItems)>0 d\n . ; add session identifier to stored records\n . k ^MDB(keyId,\"queryResults\")\n . m ^MDB(keyId,\"queryResults\",\"itemList\")=itemList\n . ;i queryExpression[\"sort \" s ^MDB(keyId,\"queryResults\",\"sorted\")=1\n . k itemList\n . s n=0,pos=\"\"\n . f s pos=$o(^MDB(keyId,\"queryResults\",\"itemList\",pos)) q:pos=\"\" d q:n=maxNoOfItems\n . . s n=n+1\n . . s itemList(n)=^MDB(keyId,\"queryResults\",\"itemList\",pos)\n . i pos'=\"\" d\n . . s nextToken=itemList(n)\n . . i $zv[\"GT.M\" d\n . . . s nextToken=$$B64^%ZMGWSIS(nextToken,context)\n . . e d\n . . . s nextToken=$$b64Encode^MDBMCache(nextToken)\n . . s ^MDB(keyId,\"queryResults\",\"nextToken\",nextToken)=pos\n ;\n QUIT $$end(startTime,.boxUsage)\n ;\n ;\n ; MDB Server side response to incoming REST requests\n ;\nmgwsiResponse(cgi,data)\n ; m_apache HTTP entry point: normalise to WebLink interface\n n %CGIEVAR,n,name,%KEY,unescName\n i $g(^zewd(\"trace\"))=1 k ^mdbcgi m ^mdbcgi=cgi\n i $g(^zewd(\"trace\"))=1 s n=$increment(^mdbdata) m ^mdbdata(n)=data\n i $g(^%zewd(\"relink\"))=1,'$d(^%zewd(\"relink\",\"process\",$j)) s ok=$$relink^%zewdGTMRuntime()\n m %CGIEVAR=cgi\n s name=\"\"\n f s name=$o(data(name)) q:name=\"\" d\n . i name=\"$CONTENT\" q\n . s unescName=$$urlDecode(name)\n . s %KEY(unescName)=$$urlDecode($g(data(name,1)))\n . i %KEY(unescName)[$c(13,10) s %KEY(unescName)=$$replace(%KEY(unescName),$c(13,10),\"\")\n d response\n QUIT\n ;\nresponse\n i $d(%KEY) d\n . ; WebLink access entry point here\n . n action,attributes,AWSAcessKeyId,boxUsage,db,error,hash,itemsAndAttrs,keyId\n . n requestId,secretKey,signatureMethod,signatureVersion,stringToSign\n . ;\n . ;k ^rltKey m ^rltKey=%KEY\n . s db=$g(%KEY(\"db\"))\n . i db=\"\" s db=\"mdb\" ;,%KEY(\"db\")=db\n . s action=$g(%KEY(\"Action\"))\n . i $g(^zewd(\"trace\"))=1 d\n . . n i\n . . d trace(\"MDB request processing for \"_action_\": started at \"_$h_\"; process: \"_$j)\n . . s i=$increment(^mdbKey)\n . . m ^mdbKey(i)=%KEY\n . i action=\"Initialise\"!(action=\"initialise\")!(action=\"Initialize\")!(action=\"initialize\") d QUIT\n . . s %KEY(\"db\")=db\n . . i $d(^MDBUAF(\"administrator\")) d errorResponse(\"InvalidAction\",\"M DB has already been initialised\") q\n . . s error=$$initialise(.requestId,.boxUsage)\n . . i error'=\"\" d errorResponse(\"InvalidConfigurationFile\",error) q\n . . d createResponse(action,requestId,boxUsage)\n . i action=\"InstallMDBX\" d QUIT\n . . s %KEY(\"db\")=db\n . . s error=$$installMDBX(.requestId,.boxUsage)\n . . i error'=\"\" d errorResponse(\"InvalidInstallRequest\",error) q\n . . d createResponse(action,requestId,boxUsage)\n . i action=\"InstallMDBM\" d QUIT\n . . s %KEY(\"db\")=db\n . . s error=$$installMDBM(.requestId,.boxUsage)\n . . i error'=\"\" d errorResponse(\"InvalidInstallRequest\",error) q\n . . d createResponse(action,requestId,boxUsage)\n . i $g(%KEY(\"MDBToken\"))'=\"\" d q:error\n . . n keyId\n . . s error=\"\"\n . . s keyId=$$authenticate^MDBSession(%KEY(\"MDBToken\"))\n . . i keyId=\"\" s error=1 d errorResponse(\"InvalidTokenId\",\"The Access Token you provided does not exist in our records\") QUIT\n . e d q:error=1\n . . s error=\"\"\n . . s signatureVersion=+$g(%KEY(\"SignatureVersion\"))\n . . s signatureMethod=$g(%KEY(\"SignatureMethod\"))\n . . s stringToSign=$$createResponseStringToSign(signatureVersion)\n . . s keyId=$g(%KEY(\"AWSAccessKeyId\"))\n . . i keyId=\"\" s keyId=$g(%KEY(\"MDBAccessKeyId\"))\n . . i action=\"AddUser\" d i error'=\"\" QUIT\n . . . s error=\"\"\n . . . i keyId=$g(^MDBUAF(\"administrator\")) q\n . . . d errorResponse(\"InvalidAdministratorKey\",\"The Access Key Id was not that of the Administrator\")\n . . . s error=1\n . . i keyId=\"\" s error=1 d errorResponse(\"InvalidClientTokenId\",\"The Access Key Id you provided does not exist in our records\") QUIT\n . . i $g(^MDBUAF(\"keys\",keyId))=\"\" s error=1 d errorResponse(\"InvalidClientTokenId\",\"The Access Key Id you provided does not exist in our records\") QUIT\n . . i $g(%KEY(\"Signature\"))=\"\" s error=1 d errorResponse(\"SignatureDoesNotMatch\",\"The request signature we calculated does not match the signature you provided. Check your Secret Access Key and signing method. Consult the service documentation for details\") QUIT\n . . s secretKey=$g(^MDBUAF(\"keys\",keyId))\n . . s hash=$$getSignedString(stringToSign,secretKey,signatureMethod)\n . . i $g(^zewd(\"trace\"))=1 d trace($h_\": string to sign:\"_stringToSign)\n . . i $g(^zewd(\"trace\"))=1 d trace($h_\": hash=\"_hash_\"; signature rcvd=\"_%KEY(\"Signature\"))\n . . i hash'=%KEY(\"Signature\") s error=1 d errorResponse(\"SignatureDoesNotMatch\",\"The request signature we calculated does not match the signature you provided. Check your Secret Access Key and signing method. Consult the service documentation for details\") QUIT\n . ;\n . ; Security OK\n . ;\n . ;d trace(\"security ok: db=\"_db)\n . i $g(^MDBAPI(db,action))'=\"\" d QUIT\n . . ; Custom extension gateway. Method should return output in response(lineNo)\n . . ; any error should be returned as errorCode~errorText\n . . n doll,lineNo,method,no,requestId,response,startTime,x\n . . s method=^MDBAPI(db,action)\n . . s x=\"s error=$$\"_method_\"(.%KEY,.response)\"\n . . s requestId=$$init(.startTime)\n . . x x\n . . i error'=\"\" d errorResponse($p(error,\"~\",1),$p(error,\"~\",2)) QUIT\n . . i $$end(startTime,.boxUsage)\n . . s lineNo=1\n . . i $g(%KEY(\"mdbRawOutput\"))'=\"true\",$g(%KEY(\"OutputFormat\"))'=\"JSON\" d\n . . . s ^CacheTempEWD($j,lineNo)=\"\"_$c(13,10),lineNo=lineNo+1\n . . . s ^CacheTempEWD($j,lineNo)=\"<\"_action_\"Response xmlns=\"\"http://\"_db_\".mgateway.com/doc/2009-06-05/\"\">\",lineNo=lineNo+1\n . . s no=\"\"\n . . f s no=$o(response(no)) q:no=\"\" d\n . . . s ^CacheTempEWD($j,lineNo)=response(no),lineNo=lineNo+1\n . . d createResponse(db_\":\"_action,requestId,boxUsage) QUIT\n . ;\n . i db=\"mdb\" s %KEY(\"db\")=\"mdb\"\n . i action=\"AddUser\" d QUIT\n . . n userKeyId,userSecretKey\n . . s userKeyId=$g(%KEY(\"UserAccessKeyId\"))\n . . i userKeyId=\"\" d errorResponse(\"InvalidKeyId\",\"The new user Access Key Id was not defined\") QUIT\n . . s userSecretKey=$g(%KEY(\"UserSecretKey\"))\n . . i userSecretKey=\"\" d errorResponse(\"InvalidSecretKey\",\"The new user Secret Key was not defined\") QUIT\n . . s error=$$addUser(userKeyId,userSecretKey,.requestId,.boxUsage)\n . . i error'=\"\" d errorResponse($p(error,\"~\",1),$p(error,\"~\",2)) QUIT\n . . d createResponse(action,requestId,boxUsage) QUIT\n . ;\n . i action=\"GetToken\" d QUIT\n . . n boxUsage,requestId,startTime,token\n . . s requestId=$$init(.startTime)\n . . s token=$$createNewSession^MDBSession(keyId,1200)\n . . i $$end(startTime,.boxUsage)\n . . d createResponse(action,requestId,boxUsage)\n . ;\n . i action=\"CreateDomain\" d QUIT\n . . n domainName,resp\n . . s domainName=$g(%KEY(\"DomainName\"))\n . . s error=$$createDomain(keyId,domainName,.requestId,.boxUsage)\n . . i error'=\"\" d errorResponse($p(error,\"~\",1),$p(error,\"~\",2)) QUIT\n . . d createResponse(action,requestId,boxUsage) QUIT\n . ;\n . i action=\"DeleteDomain\" d QUIT\n . . n domainName,resp\n . . s domainName=$g(%KEY(\"DomainName\"))\n . . s error=$$deleteDomain(keyId,domainName,.requestId,.boxUsage)\n . . i error'=\"\" d errorResponse($p(error,\"~\",1),$p(error,\"~\",2)) QUIT\n . . d createResponse(action,requestId,boxUsage) QUIT\n . ;\n . i action=\"ListDomains\" d QUIT\n . . ;d trace(\"in ListDomains\")\n . . n domainList,maxNoOfDomains,nextToken,resp\n . . s maxNoOfDomains=$g(%KEY(\"MaxNumberOfDomains\"))\n . . s nextToken=$g(%KEY(\"NextToken\"))\n . . s error=$$listDomains(keyId,maxNoOfDomains,.nextToken,.domainList,.requestId,.boxUsage)\n . . i error'=\"\" d errorResponse($p(error,\"~\",1),$p(error,\"~\",2)) QUIT\n . . d createResponse(action,requestId,boxUsage) QUIT\n . ;\n . i action=\"DomainMetadata\" d QUIT\n . . n domainName,metaData\n . . s domainName=$g(%KEY(\"DomainName\"))\n . . s error=$$domainMetadata(keyId,domainName,.metaData,.requestId,.boxUsage)\n . . i error'=\"\" d errorResponse($p(error,\"~\",1),$p(error,\"~\",2)) QUIT\n . . d createResponse(action,requestId,boxUsage) QUIT\n . ;\n . i action=\"PutAttributes\" d QUIT\n . . n domainName,error,i,itemName,name,paramName,paramValue,replace,start,stop\n . . s domainName=$g(%KEY(\"DomainName\"))\n . . s itemName=$g(%KEY(\"ItemName\"))\n . . s stop=0\n . . s name=$o(%KEY(\"Attribute.\"))\n . . s start=$p(name,\".\",2)\n . . s error=\"\"\n . . f i=start:1 d q:stop\n . . . s paramName=\"Attribute.\"_i_\".Name\"\n . . . i '$d(%KEY(paramName)) s stop=1 q\n . . . s paramValue=\"Attribute.\"_i_\".Value\"\n . . . ;i '$d(%KEY(paramValue)) s stop=1 q\n . . . i '$d(%KEY(paramValue)) s error=\"MissingParameter~Attribute Value missing for Attribute Name='\"_%KEY(paramName),stop=1 q\n . . . ;i %KEY(paramValue)=\"\" s error=\"MissingParameter~Attribute Value missing for Attribute Name='\"_%KEY(paramName),stop=1\n . . . s replace=$g(%KEY(\"Attribute.\"_i_\".Replace\"))\n . . . i replace=\"true\" s replace=1\n . . . ; attributes(no,\"name\")=attribute name\n . . . ; attributes(no,\"value\")=attribute value\n . . . ; attributes(no,\"replace\")=1\n . . . s attributes(i,\"name\")=%KEY(paramName)\n . . . s attributes(i,\"value\")=%KEY(paramValue)\n . . . i replace s attributes(i,\"replace\")=1\n . . i error=\"\" s error=$$putAttributes(keyId,domainName,itemName,.attributes,.requestId,.boxUsage)\n . . i error'=\"\" d errorResponse($p(error,\"~\",1),$p(error,\"~\",2)) QUIT\n . . d createResponse(action,requestId,boxUsage) QUIT\n . ;\n . i action=\"GetAttributes\" d QUIT\n . . n domainName,error,i,itemName,name,paramName,paramValue,replace,start,stop\n . . s domainName=$g(%KEY(\"DomainName\"))\n . . s itemName=$g(%KEY(\"ItemName\"))\n . . s stop=0\n . . s name=$o(%KEY(\"AttributeName.\"))\n . . s start=$p(name,\".\",2)\n . . s error=\"\"\n . . k attributes\n . . f i=start:1 d q:stop\n . . . s paramName=\"AttributeName.\"_i\n . . . i '$d(%KEY(paramName)) s stop=1 q\n . . . s attributes(i)=%KEY(paramName)\n . . . ;s attributes(1)=\"test\"\n . . s error=$$getAttributes(keyId,domainName,itemName,.attributes,.requestId,.boxUsage)\n . . ; attributes(no)=attribute name\n . . ; attributes(no,\"value\",vno)=attribute value\n . . i error'=\"\" d errorResponse($p(error,\"~\",1),$p(error,\"~\",2)) QUIT\n . . d createResponse(action,requestId,boxUsage)\n . ;\n . i action=\"DeleteAttributes\" d QUIT\n . . n attributes,domainName,error,i,itemName,name,paramName,paramValue,start,stop\n . . s domainName=$g(%KEY(\"DomainName\"))\n . . s itemName=$g(%KEY(\"ItemName\"))\n . . s stop=0\n . . s name=$o(%KEY(\"Attribute.\"))\n . . s start=$p(name,\".\",2)\n . . s error=\"\"\n . . ; attributes(no)=name\n . . ; attributes(no,\"value\",vno)=value\n . . k attributes\n . . f i=start:1 d q:stop\n . . . s paramName=\"Attribute.\"_i_\".Name\"\n . . . i '$d(%KEY(paramName)) s stop=1 q\n . . . s name=%KEY(paramName)\n . . . s attributes(i)=name\n . . . s paramValue=\"Attribute.\"_i_\".Value\"\n . . . i '$d(%KEY(paramValue)) s stop=1 q\n . . . i %KEY(paramValue)=\"\" s error=\"MissingParameter~Attribute Value missing for Attribute Name='\"_%KEY(paramName),stop=1\n . . . s attributes(i,\"value\",1)=%KEY(paramValue)\n . . i error=\"\" s error=$$deleteAttributes(keyId,domainName,itemName,.attributes,.requestId,.boxUsage)\n . . i error'=\"\" d errorResponse($p(error,\"~\",1),$p(error,\"~\",2)) QUIT\n . . d createResponse(action,requestId,boxUsage) QUIT\n . ;\n . i action=\"Query\" d QUIT\n . . n domainName,error,itemList,maxNoOfItems,nextToken,queryExpression\n . . s domainName=$g(%KEY(\"DomainName\"))\n . . s queryExpression=$g(%KEY(\"QueryExpression\"))\n . . s maxNoOfItems=$g(%KEY(\"MaxNumberOfItems\"))\n . . s nextToken=$g(%KEY(\"NextToken\"))\n . . s error=$$query(keyId,domainName,queryExpression,maxNoOfItems,.nextToken,.itemList,.requestId,.boxUsage)\n . . i error'=\"\" d errorResponse($p(error,\"~\",1),$p(error,\"~\",2)) QUIT\n . . d createResponse(action,requestId,boxUsage) QUIT\n . ;\n . i action=\"QueryWithAttributes\" d QUIT\n . . n attribs,bx,domainName,error,ex,i,name,itemList,itemName,itemsAndAttrs,maxNoOfItems,name,nextToken\n . . n paramName,pos,queryExpression,rx,sorted,start,stop,sub\n . . ;\n . . s domainName=$g(%KEY(\"DomainName\"))\n . . s queryExpression=$g(%KEY(\"QueryExpression\"))\n . . s maxNoOfItems=$g(%KEY(\"MaxNumberOfItems\"))\n . . s nextToken=$g(%KEY(\"NextToken\"))\n . . s name=$o(%KEY(\"AttributeName.\"))\n . . s start=$p(name,\".\",2)\n . . s error=\"\",stop=0\n . . f i=start:1 d q:stop\n . . . s paramName=\"AttributeName.\"_i\n . . . i '$d(%KEY(paramName)) s stop=1 q\n . . . s attributes(i)=%KEY(paramName)\n . . s error=$$query(keyId,domainName,queryExpression,maxNoOfItems,.nextToken,.itemList,.requestId,.boxUsage)\n . . s pos=\"\"\n . . f s pos=$o(itemList(pos)) q:pos=\"\" d\n . . . s itemName=itemList(pos)\n . . . k attribs\n . . . m attribs=attributes\n . . . s ex=$$getAttributes(keyId,domainName,itemName,.attribs,.rx,.bx,1)\n . . . m itemsAndAttrs(pos)=attribs\n . . . s itemsAndAttrs(pos)=itemName\n . . i error'=\"\" d errorResponse($p(error,\"~\",1),$p(error,\"~\",2)) QUIT\n . . d createResponse(action,requestId,boxUsage) QUIT\n . ;\n . i action=\"Select\" d QUIT\n . . n attribs,attributes,boxUsage,bx,domainName,error,ex,itemList,itemName,nextToken\n . . n pos,requestId,rx,selectExpression,startTime\n . . ;\n . . s requestId=$$init(.startTime)\n . . s selectExpression=$g(%KEY(\"SelectExpression\"))\n . . s nextToken=$g(%KEY(\"NextToken\"))\n . . i $g(^zewd(\"trace\"))=1 d trace($h_\": Action Select, entering runSelect. keyId=\"_keyId_\"; selectExpression=\"_selectExpression)\n . . s error=$$runSelect(keyId,selectExpression,.itemList,.attributes,.domainName)\n . . i $g(^zewd(\"trace\")) d trace($h_\": finished runSelect\")\n . . i error'=\"\" d errorResponse($p(error,\"~\",1),$p(error,\"~\",2)) QUIT\n . . i $g(attributes)=\"count(*)\" d\n . . . n count\n . . . s itemsAndAttrs(1)=\"Domain\"\n . . . s itemsAndAttrs(1,1)=\"Count\"\n . . . s pos=\"\",count=0\n . . . f s pos=$o(itemList(pos)) q:pos=\"\" s count=count+1\n . . . s itemsAndAttrs(1,1,\"value\",1)=count\n . . e d\n . . . s pos=\"\"\n . . . ;i $g(^zewd(\"trace\")) d trace($h_\": pos=''\")\n . . . f s pos=$o(itemList(pos)) q:pos=\"\" d\n . . . . ;i $g(^zewd(\"trace\")) d trace($h_\": pos=\"_pos)\n . . . . s itemName=itemList(pos)\n . . . . k attribs\n . . . . m attribs=attributes\n . . . . ;i $g(^zewd(\"trace\")) d trace($h_\": calling getAttributes for keyId=\"_keyId_\"; domainName=\"_domainName_\"; itemName \"_itemName)\n . . . . s ex=$$getAttributes(keyId,domainName,itemName,.attribs,.rx,.bx,1)\n . . . . ;i $g(^zewd(\"trace\")) d trace($h_\": finished getAttributes\")\n . . . . m itemsAndAttrs(pos)=attribs\n . . . . s itemsAndAttrs(pos)=itemName\n . . ;i $g(^zewd(\"trace\")) d trace($h_\": about to call $$end\")\n . . i $$end(startTime,.boxUsage)\n . . ;i $g(^zewd(\"trace\")) d trace($h_\": about to start createResponse\")\n . . d createResponse(action,requestId,boxUsage) QUIT\n . ;\n . d errorResponse(\"InvalidAction\",\"The action \"_action_\" is not valid for this web service\") QUIT\n i $g(^zewd(\"trace\"))=1 d trace(\"MDB request processing ended at \"_$h)\n QUIT\n ;\ncreateResponse(action,requestId,boxUsage)\n ;\n n len,lineNo\n ;\n ;i $g(^zewd(\"trace\"))=1 d trace($h_\": Commencing createResponse\")\n i '$d(%KEY(\"isCSP\")) d\n . w \"HTTP/1.0 200 OK\"_$c(13,10)\n . w \"Date: \"_$$inetDate^%zewdAPI($h)_\" \"_$tr($g(^MDBConfig(\"GMTOffset\")),\":\",\"\")_$c(13,10)\n . i $g(%KEY(\"OutputFormat\"))=\"JSON\" d\n . . w \"Content-type: application/json\"_$c(13,10)\n . e d\n . . w \"Content-type: text/xml\"_$c(13,10)\n s lineNo=1\n i $g(%KEY(\"OutputFormat\"))'=\"JSON\" d\n . i $g(%KEY(\"db\"))=\"mdb\" d\n . . n apiVersion\n . . k ^CacheTempEWD($j)\n . . s lineNo=1\n . . s ^CacheTempEWD($j,lineNo)=\"\"_$c(13,10),lineNo=lineNo+1\n . . s apiVersion=$g(%KEY(\"Version\")) i apiVersion=\"\" s apiVersion=\"2009-04-15\"\n . . s ^CacheTempEWD($j,lineNo)=\"<\"_action_\"Response xmlns=\"\"http://sdb.amazonaws.com/doc/\"_apiVersion_\"/\"\">\",lineNo=lineNo+1\n . e d\n . . s action=$p(action,\":\",2)\n . . s lineNo=$o(^CacheTempEWD($j,\"\"),-1)+1\n ;\n i action=\"GetToken\" d\n . i $g(%KEY(\"OutputFormat\"))=\"JSON\" d\n . . s ^CacheTempEWD($j,lineNo)=\"{token:\"\"\"_token_\"\"\"}\"\n . e d\n . . s ^CacheTempEWD($j,lineNo)=\"\"_token_\"\",lineNo=lineNo+1\n ;\n i action=\"ListDomains\" d\n . i '$d(domainList) d\n . . i $g(%KEY(\"OutputFormat\"))=\"JSON\" d\n . . . s ^CacheTempEWD($j,lineNo)=\"[]\",lineNo=lineNo+1\n . . e d\n . . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . e d\n . . n comma,no\n . . i $g(%KEY(\"OutputFormat\"))=\"JSON\" d\n . . . s ^CacheTempEWD($j,lineNo)=\"[\",lineNo=lineNo+1\n . . . s no=\"\",comma=\"\"\n . . . f s no=$o(domainList(no)) q:no=\"\" d\n . . . . s ^CacheTempEWD($j,lineNo)=comma_\"\"\"\"_domainList(no)_\"\"\"\",lineNo=lineNo+1,comma=\",\"\n . . . s ^CacheTempEWD($j,lineNo)=\"]\",lineNo=lineNo+1\n . . e d\n . . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . . . s no=\"\"\n . . . f s no=$o(domainList(no)) q:no=\"\" d\n . . . . s ^CacheTempEWD($j,lineNo)=\"\"_domainList(no)_\"\",lineNo=lineNo+1\n . . . i $g(nextToken)'=\"\" s ^CacheTempEWD($j,lineNo)=\"\"_nextToken_\"\",lineNo=lineNo+1\n . . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n ;\n i action=\"CreateDomain\",$g(%KEY(\"OutputFormat\"))=\"JSON\" d\n . s ^CacheTempEWD($j,lineNo)=\"{ok:true}\",lineNo=lineNo+1\n ;\n i action=\"DeleteAttributes\",$g(%KEY(\"OutputFormat\"))=\"JSON\" d\n . s ^CacheTempEWD($j,lineNo)=\"{ok:true}\",lineNo=lineNo+1\n ;\n i action=\"DeleteDomain\",$g(%KEY(\"OutputFormat\"))=\"JSON\" d\n . s ^CacheTempEWD($j,lineNo)=\"{ok:true}\",lineNo=lineNo+1\n ;\n i action=\"PutAttributes\",$g(%KEY(\"OutputFormat\"))=\"JSON\" d\n . s ^CacheTempEWD($j,lineNo)=\"{ok:true}\",lineNo=lineNo+1\n ;\n i action=\"DomainMetadata\" d\n . i '$d(metaData) d\n . . i $g(%KEY(\"OutputFormat\"))=\"JSON\" d\n . . . s ^CacheTempEWD($j,lineNo)=\"{}\",lineNo=lineNo+1\n . . e d\n . . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . e d\n . . n comma,name\n . . i $g(%KEY(\"OutputFormat\"))=\"JSON\" d\n . . . s ^CacheTempEWD($j,lineNo)=\"{\",lineNo=lineNo+1\n . . . s name=\"\",comma=\"\"\n . . . f s name=$o(metaData(name)) q:name=\"\" d\n . . . . s ^CacheTempEWD($j,lineNo)=comma_name_\":\"_metaData(name),lineNo=lineNo+1,comma=\",\"\n . . . s ^CacheTempEWD($j,lineNo)=\"}\",lineNo=lineNo+1\n . . e d\n . . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . . . s name=\"\"\n . . . f s name=$o(metaData(name)) q:name=\"\" d\n . . . . s ^CacheTempEWD($j,lineNo)=\"<\"_name_\">\"_metaData(name)_\"\",lineNo=lineNo+1\n . . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n ;\n i action=\"GetAttributes\",%KEY(\"db\")=\"mdb\" d\n . i '$d(attributes) d\n . . i $g(%KEY(\"OutputFormat\"))=\"JSON\" d\n . . . s ^CacheTempEWD($j,lineNo)=\"{}\",lineNo=lineNo+1\n . . e d\n . . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . e d\n . . n acomma,comma,count,name,no,quote,stop,value,valueNo\n . . i $g(%KEY(\"OutputFormat\"))=\"JSON\" d\n . . . s ^CacheTempEWD($j,lineNo)=\"{\",lineNo=lineNo+1\n . . . s no=\"\",comma=\"\"\n . . . f s no=$o(attributes(no)) q:no=\"\" d\n . . . . s name=attributes(no)\n . . . . s valueNo=\"\",count=0,stop=0\n . . . . f s valueNo=$o(attributes(no,\"value\",valueNo)) q:valueNo=\"\" d q:stop\n . . . . . s count=count+1 i count>1 s stop=1\n . . . . i count=1 d\n . . . . . s ^CacheTempEWD($j,lineNo)=comma_name_\":\",acomma=\"\",comma=\",\",lineNo=lineNo+1\n . . . . e d\n . . . . . s ^CacheTempEWD($j,lineNo)=comma_name_\":[\",acomma=\"\",comma=\",\",lineNo=lineNo+1\n . . . . s valueNo=\"\"\n . . . . f s valueNo=$o(attributes(no,\"value\",valueNo)) q:valueNo=\"\" d\n . . . . . s value=attributes(no,\"value\",valueNo)\n . . . . . s quote=\"\"\"\" i $$numeric(value) s quote=\"\"\n . . . . . s ^CacheTempEWD($j,lineNo)=acomma_quote_value_quote,lineNo=lineNo+1,acomma=\",\"\n . . . . i count>1 s ^CacheTempEWD($j,lineNo)=\"]\",lineNo=lineNo+1\n . . . s ^CacheTempEWD($j,lineNo)=\"}\",lineNo=lineNo+1\n . . e d\n . . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . . . s no=\"\"\n . . . f s no=$o(attributes(no)) q:no=\"\" d\n . . . . s name=attributes(no)\n . . . . s valueNo=\"\"\n . . . . f s valueNo=$o(attributes(no,\"value\",valueNo)) q:valueNo=\"\" d\n . . . . . s value=attributes(no,\"value\",valueNo)\n . . . . . s value=$$escape(value)\n . . . . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . . . . . s ^CacheTempEWD($j,lineNo)=\"\"_name_\"\",lineNo=lineNo+1\n . . . . . s ^CacheTempEWD($j,lineNo)=\"\"_value_\"\",lineNo=lineNo+1\n . . . . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n ;\n i action=\"Select\" d\n . ;i $g(^zewd(\"trace\"))=1 d trace($h_\": action=Select\")\n . i '$d(itemsAndAttrs) d q\n . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . e d\n . . n attrName,attrNo,attrValue,attrValueNo,itemName,itemNo\n . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . . s itemNo=\"\"\n . . f s itemNo=$o(itemsAndAttrs(itemNo)) q:itemNo=\"\" d\n . . . s itemName=itemsAndAttrs(itemNo)\n . . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . . . s ^CacheTempEWD($j,lineNo)=\"\"_itemName_\"\",lineNo=lineNo+1\n . . . s attrNo=\"\"\n . . . f s attrNo=$o(itemsAndAttrs(itemNo,attrNo)) q:attrNo=\"\" d\n . . . . s attrName=itemsAndAttrs(itemNo,attrNo)\n . . . . s attrValueNo=\"\"\n . . . . f s attrValueNo=$o(itemsAndAttrs(itemNo,attrNo,\"value\",attrValueNo)) q:attrValueNo=\"\" d\n . . . . . s attrValue=itemsAndAttrs(itemNo,attrNo,\"value\",attrValueNo)\n . . . . . s attrValue=$$escape(attrValue)\n . . . . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . . . . . s ^CacheTempEWD($j,lineNo)=\"\"_attrName_\"\"_attrValue_\"\",lineNo=lineNo+1\n . . . . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . ;i $g(^zewd(\"trace\"))=1 d trace($h_\": finished action=Select\")\n ;\n i action=\"Query\" d\n . i '$d(itemList) d\n . . i $g(%KEY(\"OutputFormat\"))=\"JSON\" d\n . . . s ^CacheTempEWD($j,lineNo)=\"[]\",lineNo=lineNo+1\n . . e d\n . . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . e d\n . . n comma,position,quotes\n . . i $g(%KEY(\"OutputFormat\"))=\"JSON\" d\n . . . s ^CacheTempEWD($j,lineNo)=\"[\",lineNo=lineNo+1\n . . . s position=\"\",comma=\"\"\n . . . f s position=$o(itemList(position)) q:position=\"\" d\n . . . . s quotes=\"\"\"\" i $$numeric(itemList(position)) s quotes=\"\"\n . . . . s ^CacheTempEWD($j,lineNo)=comma_quotes_itemList(position)_quotes,lineNo=lineNo+1,comma=\",\"\n . . . s ^CacheTempEWD($j,lineNo)=\"]\",lineNo=lineNo+1\n . . e d\n . . . n position\n . . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . . . s position=\"\"\n . . . f s position=$o(itemList(position)) q:position=\"\" d\n . . . . s ^CacheTempEWD($j,lineNo)=\"\"_itemList(position)_\"\",lineNo=lineNo+1\n . . . i $g(nextToken)'=\"\" s ^CacheTempEWD($j,lineNo)=\"\"_nextToken_\"\",lineNo=lineNo+1\n . . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n ;\n i action=\"QueryWithAttributes\" d\n . i '$d(itemsAndAttrs) d q\n . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . e d\n . . n attrName,attrNo,attrValue,attrValueNo,itemName,itemNo\n . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . . s itemNo=\"\"\n . . f s itemNo=$o(itemsAndAttrs(itemNo)) q:itemNo=\"\" d\n . . . s itemName=itemsAndAttrs(itemNo)\n . . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . . . s ^CacheTempEWD($j,lineNo)=\"\"_itemName_\"\",lineNo=lineNo+1\n . . . s attrNo=\"\"\n . . . f s attrNo=$o(itemsAndAttrs(itemNo,attrNo)) q:attrNo=\"\" d\n . . . . s attrName=itemsAndAttrs(itemNo,attrNo)\n . . . . s attrValueNo=\"\"\n . . . . f s attrValueNo=$o(itemsAndAttrs(itemNo,attrNo,\"value\",attrValueNo)) q:attrValueNo=\"\" d\n . . . . . s attrValue=itemsAndAttrs(itemNo,attrNo,\"value\",attrValueNo)\n . . . . . s attrValue=$$escape(attrValue)\n . . . . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . . . . . s ^CacheTempEWD($j,lineNo)=\"\"_attrName_\"\"_attrValue_\"\",lineNo=lineNo+1\n . . . . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n ;\n i $g(%KEY(\"db\"))=\"mdb\",$g(%KEY(\"OutputFormat\"))'=\"JSON\" d\n . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n . s ^CacheTempEWD($j,lineNo)=\"\"_$g(requestId)_\"\",lineNo=lineNo+1\n . s ^CacheTempEWD($j,lineNo)=\"\"_$g(boxUsage)_\"\",lineNo=lineNo+1\n . s ^CacheTempEWD($j,lineNo)=\"\",lineNo=lineNo+1\n i $g(%KEY(\"mdbRawOutput\"))'=\"true\",$g(%KEY(\"OutputFormat\"))'=\"JSON\" d\n . s ^CacheTempEWD($j,lineNo)=\"\"_$c(13,10),lineNo=lineNo+1\n ;\n s len=0,lineNo=\"\"\n f s lineNo=$o(^CacheTempEWD($j,lineNo)) q:lineNo=\"\" d\n . s len=len+$l(^CacheTempEWD($j,lineNo))\n i '$d(%KEY(\"isCSP\")) w \"Content-length: \"_len_$c(13,10,13,10) \n s lineNo=\"\"\n f s lineNo=$o(^CacheTempEWD($j,lineNo)) q:lineNo=\"\" d\n . w ^CacheTempEWD($j,lineNo)\n k ^CacheTempEWD($j)\n w !\n ;i $g(^zewd(\"trace\"))=1 d trace($h_\": finished createResponse\")\n QUIT\n ;\nerrorResponse(ec,em)\n ;\n n resp\n ;\n i $g(%KEY(\"OutputFormat\"))=\"JSON\" d QUIT\n . s resp=\"400 Bad Request\"\n . i ec=\"SignatureDoesNotMatch\" s resp=\"403 Forbidden\"\n . w \"HTTP/1.0 \"_resp_$c(13,10)\n . w \"Date: \"_$$inetDate^%zewdAPI($h)_\" \"_$tr($g(^MDBConfig(\"GMTOffset\")),\":\",\"\")_$c(13,10)\n . w \"Content-type: application/json\"_$c(13,10),$c(13,10)\n . w \"{\"\"ErrorCode\"\":\"\"\"_ec_\"\"\",\"\"ErrorMessage\"\":\"\"\"_em_\"\"\"}\"_$c(13,10)\n . w !\n ;\n s resp=\"400 Bad Request\"\n i ec=\"SignatureDoesNotMatch\" s resp=\"403 Forbidden\"\n w \"HTTP/1.0 \"_resp_$c(13,10)\n w \"Date: \"_$$inetDate^%zewdAPI($h)_\" \"_$tr($g(^MDBConfig(\"GMTOffset\")),\":\",\"\")_$c(13,10)\n w \"Content-type: text/xml\"_$c(13,10),$c(13,10)\n w \"\"_$c(13,10)\n w \"\"\n w \"\"_ec_\"\"\n w \"\"_em_\"\"\n i ec'=\"SignatureDoesNotMatch\",ec'=\"InvalidClientTokenId\" w \"0\"\n w \"\"\n ; Note mis-spelling of ID instead of Id to follow SimpleDB's \"feature\"!\n w \"\"_$$createRequestId()_\"\"\n w \"\"_$c(13,10)\n w !\n QUIT\n ;\ncreateResponseStringToSign(version)\n ;\n n amp,n,name,nlc,stringToSign,nvpListlc,value\n ;\n s stringToSign=\"\"\n ;\n i version=0 d QUIT stringToSign\n . s stringToSign=$g(%KEY(\"Action\"))_$g(%KEY(\"Timestamp\"))\n ;\n i version=1 d QUIT stringToSign\n . s n=\"\"\n . f s n=$o(%KEY(n)) q:n=\"\" d\n . . q:$e(n,1,3)=\"MGW\"\n . . q:n=\"Signature\"\n . . q:n=\"isCSP\"\n . . s nvpListlc($zconvert(n,\"l\"))=n\n . . ;i $zv[\"GT.M\" d\n . . ;. s nvpListlc($zconvert(n,\"l\"))=n\n . . ;e d\n . . ;. s nvpListlc($zconvert(n,\"l\"))=n\n . s nlc=\"\"\n . f s nlc=$o(nvpListlc(nlc)) q:nlc=\"\" d\n . . s name=nvpListlc(nlc)\n . . s value=%KEY(name)\n . . s stringToSign=stringToSign_name_value\n ;\n i version=2 d QUIT stringToSign\n . n location,method,url\n . s name=\"\",amp=\"\"\n . f s name=$o(%KEY(name)) q:name=\"\" d\n . . q:$e(name,1,3)=\"MGW\"\n . . q:name=\"Signature\"\n . . q:name=\"isCSP\"\n . . s value=$$urlEscape(%KEY(name))\n . . s stringToSign=stringToSign_amp_name_\"=\"_value\n . . s amp=\"&\"\n . s method=$g(%CGIEVAR(\"REQUEST_METHOD\"))\n . s url=$g(%CGIEVAR(\"SERVER_NAME\"))\n . s location=$g(%CGIEVAR(\"REQUEST_URI\"))\n . i location[\"?\" s location=$p(location,\"?\",1)\n . i location=\"\" d\n . . s location=\"/scripts/mgwms32.dll\"\n . . i $d(%KEY(\"isCSP\")) s location=$$baseUri^MDBMCache()\n . e d\n . . i location[\"http://\"!(location[\"https://\") d\n . . . s location=$p(location,\"://\",2)\n . . . s location=\"/\"_$p(location,\"/\",2,2000)\n . . . s location=$p(location,\"?\",1)\n . s stringToSign=method_$c(10)_url_$c(10)_location_$c(10)_stringToSign\n . ;s stringToSign=$$replaceAll(stringToSign,$c(13,10),\"\")\n ;\n QUIT stringToSign\n ;\ncreateToken(length)\n ;\n n i,string,token\n ;\n s string=\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz1234567890\"\n s token=\"\"\n f i=1:1:length s token=token_$e(string,($r($l(string))+1))\n QUIT token_\"=\"\n ;\ninit(startTime)\n ;\n i $g(^zewd(\"trace\")) d trace($h_\": $$init\")\n i $zv[\"GT.M\" d\n . s startTime=$$ZTS^%ZMGWSIS(1)\n e d\n . s startTime=$zts\n s startTime=(startTime*86400)+$p(startTime,\",\",2)\n QUIT $$createRequestId()\n ;\ncreateRequestId()\n n hex,i,responseId\n s responseId=\"\" \n f i=1:1:16 d\n . s hex=$$hex($r(256))\n . i $l(hex)=1 s hex=0_hex\n . s responseId=responseId_hex\n . i i=4!(i=6)!(i=8)!(i=10) s responseId=responseId_\"-\"\n QUIT $zconvert(responseId,\"l\")\n ;i $zv[\"GT.M\" QUIT $zconvert(responseId,\"l\")\n ;QUIT $zconvert(responseId,\"l\")\n \nend(startTime,boxUsage,errorCode,parameter1,parameter2)\n ;\n n endTime,error\n ;\n i $g(^zewd(\"trace\")) d trace($h_\": $$end\")\n i $zv[\"GT.M\" d\n . s endTime=$$ZTS^%ZMGWSIS(1)\n e d\n . s endTime=$zts\n s endTime=(endTime*86400)+$p(endTime,\",\",2)\n s boxUsage=endTime-startTime,boxUsage=$j(boxUsage,1,10)\n i $g(errorCode)=\"\" QUIT \"\"\n s error=$g(^MDBErrors(errorCode))\n i error=\"\" QUIT errorCode_\"~\"_$g(parameter1)\n i $g(parameter1)'=\"\" s $p(error,\"~\",2)=parameter1\n i $g(parameter2)'=\"\" s $p(error,\"~\",4)=parameter2\n QUIT errorCode_\"~\"_$tr(error,\"~\",\"\")\n ;\ngetSignedString(string,secretKey,signatureMethod)\n ;\n n context,hash,returnValue\n ;\n i $zv[\"GT.M\" d QUIT returnValue\n . s context=1\n . i $d(^zewd(\"config\",\"MGWSI\")) s context=0\n . i $zconvert($g(signatureMethod),\"l\")=\"hmacsha256\" d\n . . s returnValue=$$HMACSHA256^%ZMGWSIS(string,secretKey,1,context)\n . e d\n . . s returnValue=$$HMACSHA1^%ZMGWSIS(string,secretKey,1,context)\n ;\n QUIT $$sign^MDBMCache(signatureMethod,string,secretKey)\n ;\nrunQuery(keyId,domainName,queryExpression,nextToken,itemList)\n ;\n n domainId,error,filter,itemId,itemName,matchList,name,no,pos,stop\n ;\n ;i $g(^zewd(\"trace\")) d trace($h_\": runQuery started\")\n s error=\"\"\n s filter=\"\",stop=0\n i queryExpression[\"itemName{}\" s queryExpression=$$replaceAll(queryExpression,\"itemName{}\",\"itemName()\")\n s queryExpression=$$stripSpaces($g(queryExpression))\n s domainId=$$getDomainId(keyId,domainName)\n i $g(^zewd(\"trace\"))=1 d trace(\"runQuery: domainId=\"_domainId_\"; queryExpression=\"_queryExpression)\n i domainId=\"\" QUIT \"\"\n ;\n i queryExpression=\"\" d QUIT error\n . s itemId=\"\",no=0\n . f s itemId=$o(^MDB(keyId,\"domains\",domainId,\"items\",itemId)) q:itemId=\"\" d\n . . s no=no+1\n . . s itemList(no)=^MDB(keyId,\"domains\",domainId,\"items\",itemId)\n ;\n i queryExpression[\"sort \" d i error'=\"\" QUIT error\n . i queryExpression[\"union \"!(queryExpression[\"union[\")!(queryExpression[\"not \")!(queryExpression[\"not[\") s error=$$queryError(1)\n ;\n f d q:stop q:queryExpression=\"\" q:error'=\"\"\n . k matchList\n . s error=$$queryPredicate(.queryExpression,keyId,domainId,.matchList,.name)\n . q:error'=\"\"\n . i filter=\"\" d mergeLists(.itemList,.matchList) ;m itemList=matchList\n . i filter=\"intersection\" d\n . . s pos=\"\"\n . . f s pos=$o(itemList(pos)) q:pos=\"\" d\n . . . s itemName=itemList(pos)\n . . . i '$$inMatchList(.matchList,itemName) k itemList(pos)\n . . . ;i '$d(matchList(itemId)) k itemList(itemId)\n . i filter=\"union\" d mergeLists(.itemList,.matchList) ;m itemList=matchList\n . q:queryExpression=\"\"\n . s filter=\"\"\n . i $$startsWith(queryExpression,\"intersection\") d q\n . . s queryExpression=$e(queryExpression,13,$l(queryExpression))\n . . s queryExpression=$$stripSpaces(queryExpression)\n . . s filter=\"intersection\"\n . i $$startsWith(queryExpression,\"union\") d q\n . . s queryExpression=$e(queryExpression,6,$l(queryExpression))\n . . s queryExpression=$$stripSpaces(queryExpression)\n . . s filter=\"union\"\n . i $$startsWith(queryExpression,\"sort\") s stop=1 q\n . s error=$$queryError(2)\n ;\n i $$startsWith(queryExpression,\"sort\") d\n . n attrNo,direction,found,itemName,itemId,n,sortAttr,sortAttrId,sortedList,xvalue\n . s queryExpression=$e(queryExpression,5,$l(queryExpression))\n . s queryExpression=$$stripSpaces(queryExpression)\n . s sortAttr=$p(queryExpression,\"'\",2)\n . i sortAttr=\"\" s error=$$queryError(3) q\n . s sortAttrId=$$getAttributeId(keyId,domainId,sortAttr)\n . i sortAttrId=\"\" s error=$$queryError(4) q\n . i $g(name)'=\"\",name'=sortAttr s error=$$queryError(5) q\n . i $g(name)=\"\" d q:error'=\"\"\n . . n no,ok\n . . s no=\"\",ok=0\n . . f s no=$o(name(no)) q:no=\"\" d q:ok\n . . . i name(no)=sortAttr s ok=1 q\n . . i 'ok s error=$$queryError(6)\n . s direction=\"1\"\n . s queryExpression=$p(queryExpression,\"'\",3)\n . i queryExpression[\"desc\" s direction=\"-1\"\n . s pos=\"\"\n . ;f s pos=$o(itemList(pos)) q:pos=\"\" d\n . ;. s itemName=itemList(pos)\n . ;. s itemNamex=$e(itemName,1,$$indexLength())\n . ;. s sortedList(itemNamex,pos)=itemName\n . s pos=\"\"\n . f s pos=$o(itemList(pos)) q:pos=\"\" d\n . . s itemName=itemList(pos)\n . . s itemId=$$getItemId(keyId,domainId,itemName)\n . . s attrNo=\"\"\n . . f s attrNo=$o(^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",sortAttrId,\"value\",attrNo)) q:attrNo=\"\" d\n . . . s xvalue=^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",sortAttrId,\"value\",attrNo)\n . . . s sortedList(xvalue,itemName)=\"\"\n . k itemList\n . s n=0\n . s xvalue=\"\"\n . f s xvalue=$o(sortedList(xvalue),direction) q:xvalue=\"\" d\n . . s itemName=\"\"\n . . f s itemName=$o(sortedList(xvalue,itemName)) q:itemName=\"\" d\n . . . i $d(found(itemName)) q\n . . . s n=n+1\n . . . s itemList(n)=itemName\n . . . s found(itemName)=\"\"\n ;i $g(^zewd(\"trace\")) d trace($h_\": runQuery ended\")\n QUIT error\n ;\ninMatchList(matchList,itemName)\n ;\n n pos,present\n ;\n s pos=\"\",present=0\n f s pos=$o(matchList(pos)) q:pos=\"\" d q:present\n . i matchList(pos)=itemName s present=1\n QUIT present\n ;\n ;\nmergeLists(toList,fromList)\n ;\n n index,itemName,maxPos,newPos,pos,posx,stop,toPos\n ;\n s pos=\"\"\n f s pos=$o(toList(pos)) q:pos=\"\" d\n . s itemName=toList(pos)\n . i itemName=\"\" s itemName=\" \"\n . s index(itemName)=pos\n ;\n s pos=\"\",maxPos=$o(toList(\"\"),-1)\n f s pos=$o(fromList(pos)) q:pos=\"\" d\n . s itemName=fromList(pos)\n . ;s toPos=\"\",stop=0\n . ;f s toPos=$o(toList(toPos)) q:toPos=maxPos q:toPos=\"\" d q:stop\n . ;. i toList(toPos)=itemName s stop=1\n . ;i 'stop d\n . s posx=$g(index(itemName))\n . i posx=\"\" d\n . . s newPos=$o(toList(\"\"),-1)+1\n . . s toList(newPos)=itemName\n . . s index(itemName)=newPos\n QUIT\n ;\nqueryPredicate(query,keyId,domainId,itemList,name)\n n c,compOp,error,i,inString,no,not,predicate,relation,stop,value\n ;\n ;d trace(\"in queryPredicate - query=\"_query)\n d\n . n queryx\n . s queryx=$$replaceAll(query,\"\\\\\",$c(3))\n . i queryx[\"\\'\" s query=$$replaceAll(queryx,\"\\'\",$c(1))\n i query[\"''\" s query=$$replaceAll(query,\"''\",$c(1))\n i query[$c(32,1,39) s query=$$replaceAll(query,$c(32,1,39),$c(32,39,1))\n i query[$c(61,1,39) s query=$$replaceAll(query,$c(61,1,39),$c(61,39,1))\n i query[$c(2) s query=$$replaceAll(query,$c(2),$c(1))\n s error=\"\",predicate=\"\"\n s not=$$queryNot(.query)\n i $e(query,1)'=\"[\" QUIT $$queryError(7)\n s inString=0\n s query=$e(query,2,$l(query))\n s stop=0\n ;d trace(\"1 query=\"_query)\n f i=1:1:$l(query) d q:stop\n . s c=$e(query,i)\n . i c=\"'\" s inString='inString\n . i c=\"]\",'inString d q\n . . s predicate=$e(query,1,i-1)\n . . s query=$e(query,i+1,$l(query))\n . . s stop=1\n ;d trace(\"predicate=\"_predicate)\n i predicate=\"\" QUIT $$queryError(8)\n s query=$$stripSpaces(query)\n ;d trace(\"query=\"_query)\n s error=$$parsePredicate(.predicate,.name,.compOp,.value)\n i error'=\"\" QUIT error\n s no=1\n ;d trace(\"predicate=\"_predicate)\n i predicate'=\"\" d i error'=\"\" QUIT error\n . ;d trace(\"name=\"_name)\n . s name(1)=name\n . ;d trace(\"compOp=\"_compOp)\n . s compOp(1)=compOp\n . ;d trace(\"value=\"_value)\n . i value=\"\" s value=$c(31)\n . s value(1)=value\n . f q:predicate=\"\" d q:error'=\"\"\n . . i $e(predicate,1,3)=\"and\" d q\n . . . s predicate=$e(predicate,4,$l(predicate))\n . . . s error=$$parseSubPredicate(.predicate,.name,.compOp,.value,.no)\n . . . s relation(no)=\"&\"\n . . i $e(predicate,1,2)=\"or\" d q\n . . . s predicate=$e(predicate,3,$l(predicate))\n . . . s error=$$parseSubPredicate(.predicate,.name,.compOp,.value,.no)\n . . . s relation(no)=\"!\"\n ;d trace(\"about to run executeQuery\")\n d executeQuery(keyId,domainId,no,.name,.compOp,.value,.relation,.itemList)\n i not d not(.itemList)\n QUIT error\n ;\nparseSubPredicate(predicate,name,compOp,value,no)\n n error\n ;\n s predicate=$$stripSpaces(predicate)\n s error=$$parsePredicate(.predicate,.name,.compOp,.value)\n i error'=\"\" QUIT error\n i name'=name(1) QUIT $$queryError(9)\n i value=\"\" s value=$c(31)\n s no=no+1\n s name(no)=name,compOp(no)=compOp,value(no)=value\n QUIT \"\"\n ;\nparsePredicate(predicate,name,compOp,value)\n n c1,cx,error\n ;\n ;d trace(\"in parsePredicate - predicate=\"_predicate)\n s predicate=$$stripSpaces(predicate)\n s c1=$e(predicate,1)\n ;d trace(\"c1=\"_c1)\n i c1'=\"'\" QUIT $$queryError(10)\n s cx=$e(predicate,$l(predicate))\n ;d trace(\"cx=\"_cx)\n i cx'=\"'\",cx'=\"\"\"\" QUIT $$queryError(11)\n ;d trace(\"passed 1\")\n ;d trace(\"111 predicate=\"_predicate)\n s error=$$getIdentifier(.predicate,.name)\n ;d trace(\"name=\"_name)\n i error'=\"\" QUIT error\n i name=\"\" QUIT $$queryError(13)\n s error=$$getCompOp(.predicate,.compOp)\n i error'=\"\" QUIT error\n ;d trace(\"222 predicate=\"_predicate)\n s error=$$getIdentifier(.predicate,.value)\n ;d trace(\"222 value=\"_value)\n i value=\"\" s value=$c(31)\n i error'=\"\",compOp=\"starts-with\",value=\"\" s error=\"\"\n QUIT error\n ;\ngetIdentifier(predicate,identifier)\n ;\n n c,c1,cx,error,escaped,i\n ;\n s error=\"\"\n s identifier=\"\"\n s escaped=0\n s c1=$e(predicate,1)\n ;d trace(\"in getIdentifier: c1=\"_c1)\n i c1'=\"'\",c1'=\"\"\"\" QUIT $$queryError(12)\n s cx=c1\n f i=2:1:$l(predicate) d q:identifier'=\"\"\n . s c=$e(predicate,i)\n . i c=\"\\\",'escaped s escaped=1 q\n . i 'escaped,c=cx d q\n . . s identifier=$e(predicate,2,i-1)\n . . s predicate=$e(predicate,i+1,$l(predicate))\n . . s predicate=$$stripSpaces(predicate)\n . i escaped s escaped=0\n i identifier[\"\\\\\" d\n . s identifier=$$replaceAll(identifier,\"\\\\\",$c(5))\n . s identifier=$$replaceAll(identifier,$c(5),\"\\\")\n ;d trace(\"predicate=\"_predicate_\"; identifier=\"_identifier)\n ;i identifier=\"\" QUIT $$queryError(13)\n QUIT error\n ;\ngetCompOp(predicate,compOp)\n ;\n n error\n ;\n s error=\"\"\n i $e(predicate,1)=\"=\" d QUIT \"\"\n . s compOp=\"=\"\n . s predicate=$e(predicate,2,$l(predicate))\n . s predicate=$$stripSpaces(predicate)\n i $e(predicate,1,2)=\"<=\" d QUIT \"\"\n . s compOp=\"<=\"\n . s predicate=$e(predicate,3,$l(predicate))\n . s predicate=$$stripSpaces(predicate)\n i $e(predicate,1,2)=\">=\" d QUIT \"\"\n . s compOp=\">=\"\n . s predicate=$e(predicate,3,$l(predicate))\n . s predicate=$$stripSpaces(predicate)\n i $e(predicate,1,2)=\"!=\" d QUIT \"\"\n . s compOp=\"!=\"\n . s predicate=$e(predicate,3,$l(predicate))\n . s predicate=$$stripSpaces(predicate)\n i $e(predicate,1)=\"<\" d QUIT \"\"\n . s compOp=\"<\"\n . s predicate=$e(predicate,2,$l(predicate))\n . s predicate=$$stripSpaces(predicate)\n i $e(predicate,1)=\">\" d QUIT \"\"\n . s compOp=\">\"\n . s predicate=$e(predicate,2,$l(predicate))\n . s predicate=$$stripSpaces(predicate)\n i $e(predicate,1,11)=\"starts-with\" d QUIT \"\"\n . s compOp=\"starts-with\"\n . s predicate=$e(predicate,12,$l(predicate))\n . s predicate=$$stripSpaces(predicate)\n i $e(predicate,1,4)=\"like\" d QUIT \"\"\n . s compOp=\"like\"\n . s predicate=$e(predicate,5,$l(predicate))\n . s predicate=$$stripSpaces(predicate)\n i $e(predicate,1,8)=\"not like\" d QUIT \"\"\n . s compOp=\"notlike\"\n . s predicate=$e(predicate,9,$l(predicate))\n . s predicate=$$stripSpaces(predicate)\n i $e(predicate,1,19)=\"does-not-start-with\" d QUIT \"\"\n . s compOp=\"does-not-start-with\"\n . s predicate=$e(predicate,20,$l(predicate))\n . s predicate=$$stripSpaces(predicate)\n i $e(predicate,1,6)=\"isNull\" d QUIT \"\"\n . s compOp=\"isNull\"\n . s predicate=$e(predicate,7,$l(predicate))\n . s predicate=$$stripSpaces(predicate)\n i $e(predicate,1,9)=\"isNotNull\" d QUIT \"\"\n . s compOp=\"isNotNull\"\n . s predicate=$e(predicate,10,$l(predicate))\n . s predicate=$$stripSpaces(predicate)\n QUIT $$queryError(14)\n ;\nqueryNot(query)\n n not\n s not=0\n i $e(query,1,3)=\"not\" d\n . s not=1\n . s query=$e(query,4,$l(query))\n . s query=$$stripSpaces(query)\n QUIT not\n ;\nqueryError(x)\n i x=5 QUIT \"InvalidSortExpression~Invalid sort expression. The sort attribute must be present in at least one of the predicates, and the predicate cannot contain the is null operator.\"\n QUIT \"InvalidQueryExpression~The specified query expression syntax is not valid (\"_x_\")\"\n ;\nnot(itemList)\n ;\n n itemId,itemName,pos,selected\n ;\n s pos=\"\"\n f s pos=$o(itemList(pos)) q:pos=\"\" d\n . s itemName=itemList(pos)\n . s itemId=$$getItemId(keyId,domainId,itemName)\n . s selected(itemId)=\"\"\n k itemList\n s itemId=\"\",pos=0\n f s itemId=$o(^MDB(keyId,\"domains\",domainId,\"items\",itemId)) q:itemId=\"\" d\n . i '$d(selected(itemId)) d\n . . s pos=pos+1\n . . s itemList(pos)=^MDB(keyId,\"domains\",domainId,\"items\",itemId)\n ;\n QUIT\n ;\nexecuteQuery(keyId,domainId,no,name,compOp,value,relation,itemList)\n ;\n n attribId,expr,func,itemId,itemName,pos,stop,xvalue\n ;\n s attribId=\"\"\n ;d trace(\"xx keyId=\"_keyId_\"; domainId=\"_domainId_\"; name=\"_name_\": no=\"_no)\n i $g(name)'=\"\" d\n . i $e(name,1)=\"`\",$e(name,$l(name))=\"`\" s name=$e(name,2,$l(name)-1)\n . i name[\"``\" s name=$$replace(name,\"``\",\"`\")\n . s attribId=$$getAttributeId(keyId,domainId,name)\n ;d trace(\"xx attribId=\"_attribId)\n i attribId=\"\",compOp'=\"isNull\" QUIT\n ;\n ;d trace(\"name=\"_name_\"; value=\"_value_\"; compOp=\"_compOp)\n i value[$c(1) s value=$tr(value,$c(1),\"'\")\n i name[$c(1) s name=$tr(name,$c(1),\"'\")\n i no=1,compOp=\"=\" d QUIT\n . s pos=0,itemId=\"\"\n . f s itemId=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,value,itemId)) q:itemId=\"\" d\n . . s pos=pos+1\n . . s itemList(pos)=$g(^MDB(keyId,\"domains\",domainId,\"items\",itemId))\n . . ;d trace(value_\" found for itemId=\"_itemId)\n ;\n i no=1,compOp=\"!=\" d QUIT\n . s xvalue=\"\",pos=0\n . f s xvalue=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue)) q:xvalue=\"\" d\n . . i value=xvalue q\n . . s itemId=\"\"\n . . f s itemId=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue,itemId)) q:itemId=\"\" d\n . . . s pos=pos+1\n . . . s itemList(pos)=$g(^MDB(keyId,\"domains\",domainId,\"items\",itemId))\n ;\n i no=1,compOp=\"<\" d QUIT\n . s xvalue=\"\",stop=0,pos=0\n . f s xvalue=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue)) q:xvalue'value q:xvalue=\"\" d q:stop\n . . i $e(xvalue,1)'?1N s stop=1 q\n . . s itemId=\"\"\n . . f s itemId=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue,itemId)) q:itemId=\"\" d\n . . . s pos=pos+1\n . . . s itemList(pos)=$g(^MDB(keyId,\"domains\",domainId,\"items\",itemId))\n ;\n i no=1,compOp=\">\" d QUIT\n . s xvalue=value,stop=0,pos=0\n . f s xvalue=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue)) q:xvalue=\"\" d q:stop\n . . i $e(xvalue,1)'?1N s stop=1 q\n . . s itemId=\"\"\n . . f s itemId=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue,itemId)) q:itemId=\"\" d\n . . . s pos=pos+1\n . . . s itemList(pos)=$g(^MDB(keyId,\"domains\",domainId,\"items\",itemId))\n ;\n i no=1,compOp=\">=\" d QUIT\n . s xvalue=value-1,stop=0,pos=0\n . f s xvalue=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue)) q:xvalue=\"\" d q:stop\n . . i $e(xvalue,1)'?1N s stop=1 q\n . . s itemId=\"\"\n . . f s itemId=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue,itemId)) q:itemId=\"\" d\n . . . s pos=pos+1\n . . . s itemList(pos)=$g(^MDB(keyId,\"domains\",domainId,\"items\",itemId))\n ;\n i no=1,compOp=\"isNull\" d QUIT\n . s itemId=\"\",pos=0\n . f s itemId=$o(^MDB(keyId,\"domains\",domainId,\"items\",itemId)) q:itemId=\"\" d\n . . i attribId'=\"\",$d(^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId)) q\n . . s pos=pos+1\n . . s itemList(pos)=$g(^MDB(keyId,\"domains\",domainId,\"items\",itemId))\n ;\n i no=1,compOp=\"isNotNull\" d QUIT\n . s itemId=\"\",pos=0\n . f s itemId=$o(^MDB(keyId,\"domains\",domainId,\"items\",itemId)) q:itemId=\"\" d\n . . i '$d(^MDB(keyId,\"domains\",domainId,\"items\",itemId,\"attribs\",attribId)) q\n . . s pos=pos+1\n . . s itemList(pos)=$g(^MDB(keyId,\"domains\",domainId,\"items\",itemId))\n ;\n . f s xvalue=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue)) q:xvalue=\"\" d\n . . i $e(xvalue,1,len)=value q\n . . s itemId=\"\"\n . . f s itemId=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue,itemId)) q:itemId=\"\" d\n . . . s pos=pos+1\n . . . s itemList(pos)=$g(^MDB(keyId,\"domains\",domainId,\"items\",itemId))\n ;\n i no=1,compOp=\"like\" d\n . i value[\"\\%\" s value=$$replaceAll(value,\"\\%\",$c(6))\n . i $e(value,1)=\"%\",$e(value,$l(value))=\"%\" d q\n . . s value=$e(value,2,$l(value)-1)\n . . s compOp=\"contains\"\n . i $e(value,$l(value))=\"%\" d q\n . . s value=$e(value,1,$l(value)-1)\n . . s compOp=\"starts-with\"\n . i $e(value,1)=\"%\" d q\n . . s value=$e(value,2,$l(value))\n . . s compOp=\"ends-with\"\n i no=1,compOp=\"notlike\" d\n . i value[\"\\%\" s value=$$replaceAll(value,\"\\%\",$c(6))\n . i $e(value,1)=\"%\",$e(value,$l(value))=\"%\" d q\n . . s value=$e(value,2,$l(value)-1)\n . . s compOp=\"does-not-contain\"\n . i $e(value,$l(value))=\"%\" d q\n . . s value=$e(value,1,$l(value)-1)\n . . s compOp=\"does-not-start-with\"\n . i $e(value,1)=\"%\" d q\n . . s value=$e(value,2,$l(value))\n . . s compOp=\"does-not-end-with\"\n . ;s compOp=\"does-not-start-with\"\n . ;i $e(value,$l(value))=\"%\" s value=$e(value,1,$l(value)-1)\n i no=1 s value=$$replaceAll(value,$c(6),\"%\")\n i no=1,compOp=\"starts-with\" d QUIT\n . i value=$c(31) s value=\"\"\n . i $l(value)=1 d\n . . s xvalue=$c($a(value)-1)\n . e d\n . . n c\n . . q:value=\"\"\n . . s c=$e(value,$l(value))\n . . s c=$c($a(c)-1)\n . . s xvalue=$e(value,1,$l(value)-1)_c\n . s stop=0,pos=0\n . i value?1N.N d\n . . n len\n . . s xvalue=value-1\n . . s len=$l(value)\n . . f s xvalue=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue)) q:xvalue=\"\" d\n . . . i $e(xvalue,1,len)'=value q\n . . . s itemId=\"\"\n . . . f s itemId=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue,itemId)) q:itemId=\"\" d\n . . . . s pos=pos+1\n . . . . s itemList(pos)=$g(^MDB(keyId,\"domains\",domainId,\"items\",itemId))\n . e d\n . . n len\n . . i value'=\"\" d\n . . . s xvalue=xvalue_\"~\"\n . . . s len=$l(value)\n . . e d\n . . . s xvalue=\"\"\n . . f s xvalue=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue)) q:xvalue=\"\" d q:stop\n . . . i value'=\"\",$e(xvalue,1,len)'=value s stop=1 q\n . . . s itemId=\"\"\n . . . f s itemId=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue,itemId)) q:itemId=\"\" d\n . . . . s pos=pos+1\n . . . . s itemList(pos)=$g(^MDB(keyId,\"domains\",domainId,\"items\",itemId))\n ;\n i no=1,compOp=\"does-not-start-with\" d QUIT\n . n len\n . i value=$c(31) q\n . s xvalue=\"\",len=$l(value),pos=0\n . f s xvalue=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue)) q:xvalue=\"\" d\n . . i $e(xvalue,1,len)=value q\n . . s itemId=\"\"\n . . f s itemId=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue,itemId)) q:itemId=\"\" d\n . . . s pos=pos+1\n . . . s itemList(pos)=$g(^MDB(keyId,\"domains\",domainId,\"items\",itemId))\n ;\n i no=1,compOp=\"contains\" d QUIT\n . n len\n . i value=$c(31) q\n . s xvalue=\"\",pos=0\n . f s xvalue=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue)) q:xvalue=\"\" d\n . . i xvalue'[value q\n . . s itemId=\"\"\n . . f s itemId=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue,itemId)) q:itemId=\"\" d\n . . . s pos=pos+1\n . . . s itemList(pos)=$g(^MDB(keyId,\"domains\",domainId,\"items\",itemId))\n ;\n i no=1,compOp=\"does-not-contain\" d QUIT\n . n len\n . i value=$c(31) q\n . s xvalue=\"\",pos=0\n . f s xvalue=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue)) q:xvalue=\"\" d\n . . i xvalue[value q\n . . s itemId=\"\"\n . . f s itemId=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue,itemId)) q:itemId=\"\" d\n . . . s pos=pos+1\n . . . s itemList(pos)=$g(^MDB(keyId,\"domains\",domainId,\"items\",itemId))\n ;\n i no=1,compOp=\"ends-with\" d QUIT\n . n len,xend,xlen\n . i value=$c(31) q\n . s xvalue=\"\",len=$l(value),pos=0\n . f s xvalue=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue)) q:xvalue=\"\" d\n . . s xlen=$l(xvalue)\n . . s xend=$e(xvalue,(xlen-len+1),xlen)\n . . i xend'=value q\n . . s itemId=\"\"\n . . f s itemId=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue,itemId)) q:itemId=\"\" d\n . . . s pos=pos+1\n . . . s itemList(pos)=$g(^MDB(keyId,\"domains\",domainId,\"items\",itemId))\n ;\n i no=1,compOp=\"does-not-end-with\" d QUIT\n . n len,xend,xlen\n . i value=$c(31) q\n . s xvalue=\"\",len=$l(value),pos=0\n . f s xvalue=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue)) q:xvalue=\"\" d\n . . s xlen=$l(xvalue)\n . . s xend=$e(xvalue,(xlen-len+1),xlen)\n . . i xend=value q\n . . s itemId=\"\"\n . . f s itemId=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue,itemId)) q:itemId=\"\" d\n . . . s pos=pos+1\n . . . s itemList(pos)=$g(^MDB(keyId,\"domains\",domainId,\"items\",itemId))\n ;\n i no=1 QUIT\n s expr=\"\"\n f i=1:1:no d\n . i i>1 s expr=expr_relation(i)\n . d\n . . i compOp(i)=\"=\" s func=\"equals\" q\n . . i compOp(i)=\"<\" s func=\"lt\" q\n . . i compOp(i)=\">\" s func=\"gt\" q\n . . i compOp(i)=\"!=\" s func=\"notEquals\" q\n . . i compOp(i)=\"<=\" s func=\"le\" q\n . . i compOp(i)=\">=\" s func=\"ge\" q\n . . i compOp(i)=\"starts-with\" s func=\"startsWith\" q\n . . i compOp(i)=\"notlike\" d q\n . . . i $e(value(i),1)=\"%\",$e(value(i),$l(value(i)))=\"%\" d q\n . . . . s value(i)=$e(value(i),2,$l(value(i))-1)\n . . . . s func=\"notContains\"\n . . . i $e(value(i),$l(value(i)))=\"%\" d q\n . . . . s value(i)=$e(value(i),1,$l(value(i))-1)\n . . . . s func=\"notStartsWith\"\n . . . i $e(value(i),1)=\"%\" d q\n . . . . s value(i)=$e(value(i),2,$l(value(i)))\n . . . . s func=\"notEndsWith\"\n . . . ;s func=\"notStartsWith\"\n . . . ;i $e(value(i),$l(value(i)))=\"%\" s value(i)=$e(value(i),1,$l(value(i))-1)\n . . i compOp(i)=\"like\" d q\n . . . i $e(value(i),1)=\"%\",$e(value(i),$l(value(i)))=\"%\" d q\n . . . . s value(i)=$e(value(i),2,$l(value(i))-1)\n . . . . s func=\"contains\"\n . . . i $e(value(i),$l(value(i)))=\"%\" d q\n . . . . s value(i)=$e(value(i),1,$l(value(i))-1)\n . . . . s func=\"startsWith\"\n . . . i $e(value(i),1)=\"%\" d q\n . . . . s value(i)=$e(value(i),2,$l(value(i)))\n . . . . s func=\"endsWith\"\n . . . ;s func=\"startsWith\"\n . . . ;i $e(value(i),$l(value(i)))=\"%\" s value(i)=$e(value(i),1,$l(value(i))-1)\n . . i compOp(i)=\"does-not-start-with\" s func=\"notStartsWith\"\n . s value(i)=$$replaceAll(value(i),$c(6),\"%\")\n . s expr=expr_\"$$\"_func_\"(xvalue,\"\"\"_value(i)_\"\"\")\"\n . ;d trace(\"expr=\"_expr)\n s xvalue=\"\"\n s attribId=$$getAttributeId(keyId,domainId,name(1))\n s pos=0\n f s xvalue=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue)) q:xvalue=\"\" d\n . i @expr d\n . . s itemId=\"\"\n . . f s itemId=$o(^MDB(keyId,\"domains\",domainId,\"queryIndex\",attribId,xvalue,itemId)) q:itemId=\"\" d\n . . . s pos=pos+1\n . . . s itemList(pos)=$g(^MDB(keyId,\"domains\",domainId,\"items\",itemId)) \n QUIT\n ;\nequals(indexValue,targetValue)\n QUIT indexValue=targetValue\n ;\nnotEquals(indexValue,targetValue)\n QUIT indexValue'=targetValue\n ;\nlt(indexValue,targetValue)\n i $e(indexValue,1)'?1N QUIT 0\n QUIT indexValuetargetValue\n ;\nle(indexValue,targetValue)\n i $e(indexValue,1)'?1N QUIT 0\n QUIT indexValue'>targetValue\n ;\nge(indexValue,targetValue)\n i $e(indexValue,1)'?1N QUIT 0\n QUIT indexValue'= \"\n . . . . s p1=p1_$p(expr,\" \",np-2)_\" and \"_$p(expr,\" \",np-4)_\" <= \"\n . . . . s expr=p1\n . . . . s lastWord=\"<=\"\n . . i lastWord=\"and\" s inAttr=1,expr=expr_\"'\",thisWord=\"'\"\n . . i lastWord=\"or\" s inAttr=1,expr=expr_\"'\",thisWord=\"'\"\n . . i lastWord=\"union\" s inAttr=1,expr=expr_\"'\",thisWord=\"'\"\n . . i lastWord=\"intersection\" s inAttr=1,expr=expr_\"'\",thisWord=\"'\"\n . i inAttr,c=\"=\" d\n . . s c=\" \"\n . . i $e(queryExpression,1)'=\" \" s queryExpression=\" \"_queryExpression\n . . s queryExpression=\"=\"_queryExpression\n . i c'=\" \" d q\n . . s thisWord=thisWord_c\n . . s expr=expr_c\n . i inAttr d\n . . s expr=expr_\"'\"\n . . s thisWord=thisWord_\"'\"\n . . s inAttr=0\n . s expr=expr_c\n . s lastWord=thisWord\n . s thisWord=\"\"\n . i lastWord=\"is\" d\n . . i $e(queryExpression,1,4)=\"null\" d\n . . . s lastWord=\"isNull\"\n . . . s expr=$e(expr,1,$l(expr)-3)_\"isNull \"\n . . . s queryExpression=\"'null'\"_$e(queryExpression,5,$l(queryExpression))\n . . i $e(queryExpression,1,8)=\"not null\" d\n . . . s lastWord=\"isNotNull\"\n . . . s expr=$e(expr,1,$l(expr)-3)_\"isNotNull \"\n . . . s queryExpression=\"'null'\"_$e(queryExpression,9,$l(queryExpression))\n i expr'=\"\" d\n . n i,name,np,offset,prevName,rel,term\n . s expr=$$escVals(expr)\n . s np=$l(expr,\" \")\n . i np>3 d\n . . n diffNames,name\n . . f i=1:1:np s term(i)=$p(expr,\" \",i)\n . . s offset=4\n . . s diffNames=0\n . . s name=term(1)\n . . f i=1:offset q:'$d(term(i)) d q:diffNames\n . . . i term(i)'=name s diffNames=1 q\n . . . i $g(term(i+3))=\"intersection\" s diffNames=1 q\n . . . i $g(term(i+3))=\"union\" s diffNames=1 q\n . . i diffNames d\n . . . s expr=\"[\"_term(1)_\" \"_term(2)_\" \"_term(3)\n . . . f d q:'$d(term(offset+1))\n . . . . s name=term(offset+1)\n . . . . s rel=term(offset)\n . . . . i rel=\"and\"!(rel=\"intersection\") d\n . . . . . s expr=expr_\"] intersection [\"\n . . . . i rel=\"or\"!(rel=\"union\") d\n . . . . . s expr=expr_\"] union [\"\n . . . . s expr=expr_term(offset+1)_\" \"_term(offset+2)_\" \"_term(offset+3)\n . . . . s offset=offset+4\n . . . s expr=expr_\"]\"\n . . e d\n . . . s expr=\"[\"_expr_\"]\"\n . e d\n . . s expr=\"[\"_expr_\"]\"\n . k itemList\n . s expr=$tr(expr,$c(1),\" \")\n . i $g(orderBy)'=\"\" s expr=expr_\" sort \"_orderBy\n . s error=$$runQuery(keyId,domainName,expr,,.itemList)\n QUIT error\n ;\nescVals(expr)\n ;\n n c,inValue,no,str\n ;\n s inValue=0,no=0,str=\"\"\n f q:expr=\"\" d\n . s c=$e(expr,1),expr=$e(expr,2,$l(expr))\n . i c=\"'\" d q\n . . s inValue='inValue\n . . s str=str_c\n . i 'inValue s str=str_c q\n . i c=\" \" s c=$c(1)\n . s str=str_c\n QUIT str\n ;\ninvalid(x)\n QUIT \"InvalidQueryExpression~The specified query expression syntax is not valid. (\"_x_\")\"\n ;\nrunSelect(keyId,query,itemList,attributes,domainName)\n ;\n n error,limit,orderBy,queryExpression\n ;\n ;d trace(\"in runSelect: query=\"_query)\n s error=$$parseSelect(query,.domainName,.queryExpression,.attributes,.orderBy,.limit)\n i $g(^zewd(\"trace\"))=1 d trace($h_\": completed parseSelect: queryExpression=\"_$g(queryExpression))\n i error'=\"\" QUIT error\n i queryExpression=\"\" d\n . i orderBy'=\"\" d\n . . s error=$$invalid(5)\n . e d\n . . s error=$$runQuery(keyId,domainName,\"\",,.itemList)\n e d\n . i queryExpression[\"itemName()\" s queryExpression=$$replaceAll(queryExpression,\"itemName()\",\"itemName{}\")\n . s error=$$executeSelect(queryExpression,.itemList,keyId,.itemStack)\n . i $g(^zewd(\"trace\"))=1 d trace($h_\": finished executeSelect and returned to runSelect\")\n ;***\n i $d(itemStack(\"list\")) k itemList m itemList=itemStack(\"list\")\n ;***\n i limit>0 d\n . n count,listCopy,no,stop\n . s count=0,no=\"\",stop=0\n . f s no=$o(itemList(no)) q:no=\"\" d q:stop\n . . s count=count+1\n . . i count>limit s stop=1 q\n . . s listCopy(no)=itemList(no)\n . k itemList\n . m itemList=listCopy\n QUIT error\n ;\nnumeric(value)\n i $e(value,1)=0,$l(value)>1 QUIT 0\n i value?1N.N QUIT 1\n i value?1\"-\"1N.N QUIT 1\n i value?1N.N1\".\"1N.N QUIT 1\n i value?1\"-\"1N.N1\".\"1N.N QUIT 1\n QUIT 0\n ; \nescape(value)\n i value[\"&\" s value=$$replaceAll(value,\"&\",\"&\")\n i value[\"<\" s value=$$replaceAll(value,\"<\",\"<\")\n i value[\">\" s value=$$replaceAll(value,\">\",\">\")\n QUIT value\n ;\nexternalSelect(keyId,selectExpression) ;\n ;\n n attributes,count,domainName,error,itemList,itemsAndAttrs,json,pos\n ;\n i $g(^zewd(\"trace\"))=1 d trace(\"in externalSelect - keyId = \"_keyId_\": select=\"_selectExpression)\n s error=$$runSelect(keyId,selectExpression,.itemList,.attributes,.domainName)\n i error'=\"\" d QUIT json\n . s json=\"{\"\"error\"\":{\"\"errorCode\"\":\"\"\"_$p(error,\"~\",1)_\"\"\",\"\"errorMessage\"\":\"\"\"_$p(error,\"~\",2)_\"\"\"}}\"\n i $g(attributes)=\"count(*)\" d\n . n count,pos\n . s itemsAndAttrs(1,\"i\")=\"Domain\"\n . s itemsAndAttrs(1,\"a\",1,\"n\")=\"Count\"\n . s pos=\"\",count=0\n . f s pos=$o(itemList(pos)) q:pos=\"\" s count=count+1\n . s itemsAndAttrs(1,\"a\",1,\"v\",1)=count\n e d\n . n attribs,attribArray,ex,itemName,no,rx,bx,val,vno\n . s pos=\"\"\n . f s pos=$o(itemList(pos)) q:pos=\"\" d\n . . s itemName=itemList(pos)\n . . k attribs,attribArray\n . . m attribs=attributes\n . . s ex=$$getAttributes(keyId,domainName,itemName,.attribs,.rx,.bx,1)\n . . s no=\"\"\n . . f s no=$o(attribs(no)) q:no=\"\" d\n . . . s attribArray(no,\"n\")=$g(attribs(no))\n . . . s vno=\"\"\n . . . f s vno=$o(attribs(no,\"value\",vno)) q:vno=\"\" d\n . . . . s val=attribs(no,\"value\",vno)\n . . . . ;s val=$$replaceAll(val,\"\"\"\",\"\\\"\"\")\n . . . . s val=$$replaceAll(val,\"\\\",\"\\\\\")\n . . . . s attribArray(no,\"v\",vno)=val\n . . m itemsAndAttrs(pos,\"a\")=attribArray\n . . s itemsAndAttrs(pos,\"i\")=itemName\n s pos=\"\",count=0\n f s pos=$o(itemsAndAttrs(pos)) q:pos=\"\" s count=count+1\n i count=1 d\n . n array\n . m array=itemsAndAttrs(1)\n . ;m ^rob=array\n . s json=$$arrayToJSON^zmwire(\"array\")\n . s json=\"[\"_json_\"]\"\n e d\n . s json=$$arrayToJSON^zmwire(\"itemsAndAttrs\")\n i $g(^zewd(\"trace\"))=1 d trace(\"json=\"_json)\n QUIT json\n ;\ntrace(text,clear) ; trace ;\n n i\n s text=$g(text)\n i $g(clear)=1 k ^%zewdTrace\n s i=$increment(^%zewdTrace)\n s ^%zewdTrace(i)=text\n QUIT\n ;\nreplaceAll(InText,FromStr,ToStr) ; Replace all occurrences of a substring\n ;\n n p\n ;\n s p=InText\n i ToStr[FromStr d QUIT p\n . n i,stop,tempText,tempTo\n . s stop=0\n . f i=0:1:255 d q:stop\n . . q:InText[$c(i)\n . . q:FromStr[$c(i)\n . . q:ToStr[$c(i)\n . . s stop=1\n . s tempTo=$c(i)\n . s tempText=$$replaceAll(InText,FromStr,tempTo)\n . s p=$$replaceAll(tempText,tempTo,ToStr)\n f q:p'[FromStr S p=$$replace(p,FromStr,ToStr)\n QUIT p\n ;\nreplace(InText,FromStr,ToStr) ; replace old with new in string\n ;\n n np,p1,p2\n ;\n i InText'[FromStr q InText\n s np=$l(InText,FromStr)+1\n s p1=$p(InText,FromStr,1),p2=$p(InText,FromStr,2,np)\n QUIT p1_ToStr_p2\n ;\nstripSpaces(string)\n i $zv[\"Cache\" QUIT $$stripSpaces^MDBMCache(string)\n ;\n s string=$$stripLeadingSpaces(string)\n QUIT $$stripTrailingSpaces(string)\n ;\nstripLeadingSpaces(string)\n ;\n n i\n ;\n f i=1:1:$l(string) QUIT:$e(string,i)'=\" \"\n QUIT $e(string,i,$l(string))\n ;\nstripTrailingSpaces(string)\n ;\n n i,spaces,new\n ;\n s spaces=$$makeString(\" \",100)\n s new=string_spaces\n QUIT $p(new,spaces,1)\n ;\nmakeString(char,len) ; create a string of len characters\n ;\n n str\n ;\n s str=\"\",$p(str,char,len+1)=\"\"\n QUIT str\n ;\ntest\n s select=\"select * from testing where attr3 = 'control'\"\n s key=\"rob\"\n s ok=$$externalSelect^MDB(key,select)\n QUIT\n ;\n" }, { "path": "src/test/resources/samples/langs/M/PRCAAPR.m", "content": "PRCAAPR ;WASH-ISC@ALTOONA,PA/RGY-PATIENT ACCOUNT PROFILE (CONT) ;3/9/94 8:41 AM\nV ;;4.5;Accounts Receivable;**198,221**;Mar 20, 1995\n ;;Per VHA Directive 10-93-142, this routine should not be modified.\nEN(PRCATY) ;\n NEW DIC,X,Y,DEBT,PRCADB,DA,PRCA,COUNT,OUT,SEL,BILL,BAT,TRAN,DR,DXS,DTOUT,DIROUT,DIRUT,DUOUT\nASK N DPTNOFZY,DPTNOFZK S (DPTNOFZY,DPTNOFZK)=1\n K OUT S COUNT=0 R !,\"Select DEBTOR NAME or BILL NUMBER: \",X:DTIME I \"^\"[$E(X) S $P(DEBT,\"^\",2)=\"\" G Q\n S X=$$UPPER^VALM1(X)\n S Y=$S($O(^PRCA(430,\"B\",X,0)):$O(^(0)),$O(^PRCA(430,\"D\",X,0)):$O(^(0)),1:-1)\n I Y>0 S DEBT=$P($G(^PRCA(430,Y,0)),\"^\",9) I DEBT S PRCADB=$P($G(^RCD(340,DEBT,0)),\"^\"),^DISV(DUZ,\"^PRCA(430,\")=Y,$P(DEBT,\"^\",2)=$$NAM^RCFN01(DEBT) D COMP,EN1^PRCAATR(Y) G:$D(DTOUT) Q G ASK\n S DIC=\"^RCD(340,\",DIC(0)=\"E\" D ^DIC G:Y<0 ASK\n S ^DISV(DUZ,\"^RCD(340,\")=+Y,PRCADB=$P(Y,\"^\",2),DEBT=+Y_\"^\"_$P(@(\"^\"_$P(PRCADB,\";\",2)_+PRCADB_\",0)\"),\"^\")\n D COMP,HDR^PRCAAPR1,HDR2^PRCAAPR1,DIS^PRCAAPR1 G:'$D(DTOUT) ASK\nQ K ^TMP(\"PRCAAPR\",$J) Q\nCOMP ;Compile patient bills\n K ^TMP(\"PRCAAPR\",$J)\n NEW STAT,STAT1,CNT,Y\n S STAT1=0\n F CNT=1:1 S STAT1=+$S(PRCATY=\"ALL\":$O(^PRCA(430,\"AS\",+DEBT,STAT1)),1:$O(^PRCA(430.3,\"AC\",+$P(PRCATY,\",\",CNT),0))) Q:'STAT1 F BILL=0:0 S BILL=$O(^PRCA(430,\"AS\",+DEBT,STAT1,BILL)) Q:'BILL D COMP1\n I PRCADB[\";DPT(\" F BILL=0:0 S BILL=$O(^PRCA(430,\"E\",+PRCADB,BILL)) Q:'BILL I PRCATY=\"ALL\"!((\",\"_PRCATY_\",\")[(\",\"_$P($G(^PRCA(430.3,+$P($G(^PRCA(430,BILL,0)),\"^\",8),0)),\"^\",3)_\",\")) D COMP1\n F BAT=0:0 S BAT=$O(^RCY(344,\"AC\",PRCADB,BAT)) Q:'BAT F TRAN=0:0 S TRAN=$O(^RCY(344,\"AC\",PRCADB,BAT,TRAN)) Q:'TRAN I $G(^RCY(344,BAT,1,TRAN,0))]\"\",$P(^(0),\"^\",5)=\"\" D COMP2\n Q\nCOMP1 S STAT=$P($G(^PRCA(430.3,+$P($G(^PRCA(430,BILL,0)),\"^\",8),0)),\"^\",3) Q:STAT=\"\"\n S X=$G(^PRCA(430,BILL,7)),Y=$P(X,\"^\")+$P(X,\"^\",2)+$P(X,\"^\",3)+$P(X,\"^\",4)+$P(X,\"^\",5)\n I $P(^PRCA(430,BILL,0),\"^\",2)=$O(^PRCA(430.2,\"AC\",33,0)) S Y=-Y\n S Y=$S($P(^PRCA(430,BILL,0),\"^\",2)=$O(^PRCA(430.2,\"AC\",33,0))&(STAT'=112):0,$P(^PRCA(430,BILL,0),\"^\",9)'=+DEBT:0,\",102,107,112,\"[(\",\"_STAT_\",\"):Y,1:0)\n S ^TMP(\"PRCAAPR\",$J,\"C\")=$G(^TMP(\"PRCAAPR\",$J,\"C\"))+Y\n S ^TMP(\"PRCAAPR\",$J,\"C\",STAT)=$G(^TMP(\"PRCAAPR\",$J,\"C\",STAT))+Y_\"^\"_STAT,^(STAT,BILL)=$P(X,\"^\",1,5)\n Q\nCOMP2 ;Compile payments\n S Y=$P(^RCY(344,BAT,1,TRAN,0),\"^\",4)\n S ^TMP(\"PRCAAPR\",$J,\"C\")=$G(^TMP(\"PRCAAPR\",$J,\"C\"))-Y\n S ^TMP(\"PRCAAPR\",$J,\"C\",99)=$G(^TMP(\"PRCAAPR\",$J,\"C\",99))-Y_\"^99\",^TMP(\"PRCAAPR\",$J,\"C\",99,$P(^RCY(344,BAT,0),\"^\")_\"-\"_TRAN)=$P(^RCY(344,BAT,1,TRAN,0),\"^\",4)\n Q\n" }, { "path": "src/test/resources/samples/langs/M/PXAI.m", "content": "PXAI ;ISL/JVS,ISA/KWP,ESW - PCE DRIVING RTN FOR 'DATA2PCE' API ;6/20/03 11:15am\n ;;1.0;PCE PATIENT CARE ENCOUNTER;**15,74,69,102,111,112,130,164,168**;Aug 12, 1996;Build 14\n Q\n ;\n ;+ 1 2 3 4 5 6 7 8 9\nDATA2PCE(PXADATA,PXAPKG,PXASOURC,PXAVISIT,PXAUSER,PXANOT,ERRRET,PXAPREDT,PXAPROB,PXACCNT) ;+API to pass data for add/edit/delete to PCE.\n ;+ PXADATA (required)\n ;+ PXAPKG (required)\n ;+ PXASOURC (required)\n ;+ PXAVISIT (optional) is pointer to a visit for which the data is to\n ;+ be related. If the visit is not known then there must be\n ;+ the ENCOUNTER nodes needed to lookup/create the visit.\n ;+ PXAUSER (optional) this is a pointer to the user adding the data.\n ;+ PXANOT (optional) set to 1 if errors are to be displayed to the screen should only be set while writing and debugging the initial code.\n ;+ ERRRET (optional) passed by reference. If present will return PXKERROR\n ;+ array elements to the caller.\n ;+ PXAPREDT (optional) Set to 1 if you want to edit the Primary Provider\n ;+ only use if for the moment that editing is being done. (dangerous)\n ;+ PXAPROB (optional) A dotted variable name. When errors and\n ;+ warnings occur, They will be passed back in the form\n ;+ of an array with the general description of the problem.\n ;+ IF ERROR1 - (GENERAL ERRORS)\n ;+ PXAPROB($J,SUBSCRIPT,\"ERROR1\",PASSED IN 'FILE',PASSED IN FIELD,\n ;+ SUBSCRIPT FROM PXADATA)\n ;+ PXAPROB(23432234,2,\"ERROR1\",\"PROVIDER\",\"NAME\",7)=\"BECAUSE...\"\n ;+ IF WARNING2 - (GENERAL WARNINGS)\n ;+ PXAPROB($J,SUBSCRIPT,\"WARNING2\",PASSED IN 'FILE',PASSED IN FIELD,\n ;+ SUBSCRIPT FROM PXADATA)\n ;+ PXAPROB(23432234,3,\"WARNING2\",\"PROCEDURE\",\"QTY\",3)=\"BECAUSE...\"\n ;+ IF WARNING3 - (WARNINGS FOR SERVICE CONNECTION)\n ;+ PXAPROB($J,1,\"WARNING3\",\"ENCOUNTER\",1,\"AO\")=REASON\n ;+ PXAPROB($J,1,\"WARNING3\",\"ENCOUNTER\",1,\"EC\")=REASON\n ;+ PXAPROB($J,1,\"WARNING3\",\"ENCOUNTER\",1,\"IR\")=REASON\n ;+ PXAPROB($J,1,\"WARNING3\",\"ENCOUNTER\",1,\"SC\")=REASON\n ;+ PXAPROB($J,1,\"WARNING3\",\"ENCOUNTER\",1,\"MST\")=REASON\n ;+ PXAPROB($J,1,\"WARNING3\",\"ENCOUNTER\",1,\"HNC\")=REASON\n ;+ PXAPROB($J,1,\"WARNING3\",\"ENCOUNTER\",1,\"CV\")=REASON\n ;+ PXAPROB($J,1,\"WARNING3\",\"ENCOUNTER\",1,\"SHAD\")=REASON\n ;+ IF ERROR4 - (PROBLEM LIST ERRORS)\n ;+ PXAPROB($J,6,\"ERROR4\",\"PX/DL\",(SUBSCRIPT FROM PXADATA))=REASON\n ;+ PXACCNT (optional) passed by reference. Returns the PFSS Account Reference if known.\n ; Returned as null if the PFSS Account Reference is located in the Order file(#100)\n ;+\n ;+\n ;+ Returns:\n ;+ 1 if no errors and process completely\n ;+ -1 if errors occurred but processed completely as possible\n ;+ -2 if could not get a visit\n ;+ -3 if called incorrectly\n ;\nNEW ;--NEW VARIABLES\n N NOVSIT,PXAK,DFN,PXAERRF,PXADEC,PXELAP,PXASUB\n N PATIENT,VALQUIET,PRIMFND\n K PXAERROR,PXKERROR,PXAERR,PRVDR\n S PXASUB=0,VALQUIET=1\n ; needs to look up if not passed. \n I '$G(PXAVISIT),'$D(@PXADATA@(\"ENCOUNTER\")) Q -3\n I $G(PXAUSER)<1 S PXAUSER=DUZ\n ;\n K ^TMP(\"PXK\",$J),^TMP(\"DIERR\",$J),^TMP(\"PXAIADDPRV\",$J)\nSOR ;--SOURCE\n I PXAPKG=+PXAPKG S PXAPKG=PXAPKG\n E S PXAPKG=$$PKG2IEN^VSIT(PXAPKG)\n I PXASOURC=+PXASOURC S PXASOURC=PXASOURC\n E S PXASOURC=$$SOURCE^PXAPIUTL(PXASOURC)\n ;\n D TMPSOURC^PXAPIUTL(PXASOURC) ;-SAVES & CREATES ^TMP(\"PXK\",$J,\"SOR\")\nVST ;--VISIT\n ;--KILL VISIT\n I $G(PXAVISIT) D VPTR^PXAIVSTV I $G(PXAERRF) D ERR Q -2\n D VST^PXAIVST\n I $G(PXAVISIT)<0 Q -2\n I $G(PXAERRF) D ERR K PXAERR Q -2\nPRV ;--PROVIDER\n S PATIENT=$P($G(^AUPNVSIT(PXAVISIT,0)),\"^\",5)\n S (PXAK,PRIMFND)=0\n F S PXAK=$O(@PXADATA@(\"PROVIDER\",PXAK)) Q:(PRIMFND)!(PXAK=\"\") D\n .I $D(@PXADATA@(\"PROVIDER\",PXAK,\"PRIMARY\")) D\n ..S PRIMFND=$G(@PXADATA@(\"PROVIDER\",PXAK,\"PRIMARY\"))\n I 'PRIMFND D ;Check for each provider's status as Primary or Secondary\n .S PXAK=0 F S PXAK=$O(@PXADATA@(\"PROVIDER\",PXAK)) Q:PXAK=\"\" D\n ..I '$D(@PXADATA@(\"PROVIDER\",PXAK,\"PRIMARY\")) D PROVDRST\n S PXAK=0 F S PXAK=$O(@PXADATA@(\"PROVIDER\",PXAK)) Q:PXAK=\"\" D\n . D PRV^PXAIPRV I $G(PXAERRF) D ERR\n K PRI ;--FLAG FOR PRIMARY PROVIDER\n K PXAERR\nPOV ;--DIAGNOSIS\n S (PXAK,PRIMFND)=0\n F S PXAK=$O(@PXADATA@(\"DX/PL\",PXAK)) Q:(PXAK=\"\") D Q:PRIMFND\n .I +$G(@PXADATA@(\"DX/PL\",PXAK,\"PRIMARY\"))=1 D\n ..S PRIMFND=$G(@PXADATA@(\"DX/PL\",PXAK,\"DIAGNOSIS\"))\n I $D(@PXADATA@(\"DX/PL\")) D POVPRM(PXAVISIT,PRIMFND,.PXADATA) D\n .S PXAK=0 F S PXAK=$O(@PXADATA@(\"DX/PL\",PXAK)) Q:PXAK=\"\" D\n ..D POV^PXAIPOV I $G(PXAERRF) D ERR\n K PXAERR\n ;\nCPT ;--PROCEDURE\n S PXAK=0 F S PXAK=$O(@PXADATA@(\"PROCEDURE\",PXAK)) Q:PXAK=\"\" D\n . D CPT^PXAICPT I $G(PXAERRF) D ERR\n K PXAERR\n ;\nEDU ;--PATIENT EDUCATION\n S PXAK=0 F S PXAK=$O(@PXADATA@(\"PATIENT ED\",PXAK)) Q:PXAK=\"\" D\n . D EDU^PXAIPED I $G(PXAERRF) D ERR\n K PXAERR\n ;\nEXAM ;--EXAMINATION\n S PXAK=0 F S PXAK=$O(@PXADATA@(\"EXAM\",PXAK)) Q:PXAK=\"\" D\n . D EXAM^PXAIXAM I $G(PXAERRF) D ERR\n K PXAERR\n ;\nHF ;--HEALTH FACTOR\n S PXAK=0 F S PXAK=$O(@PXADATA@(\"HEALTH FACTOR\",PXAK)) Q:PXAK=\"\" D\n . D HF^PXAIHF I $G(PXAERRF) D ERR\n K PXAERR\n ;\nIMM ;--IMMUNIZATION\n S PXAK=0 F S PXAK=$O(@PXADATA@(\"IMMUNIZATION\",PXAK)) Q:PXAK=\"\" D\n . D IMM^PXAIIMM I $G(PXAERRF) D ERR\n K PXAERR\n ;\nSKIN ;--SKIN TEST\n S PXAK=0 F S PXAK=$O(@PXADATA@(\"SKIN TEST\",PXAK)) Q:PXAK=\"\" D\n . D SKIN^PXAISK I $G(PXAERRF) D ERR\n K PXAERR\n ;\n ;\n D OTHER^PXAIPRV\n ;\n ;\n I $D(^TMP(\"PXK\",$J)) D\n . D EN1^PXKMAIN\n . M ERRRET=PXKERROR\n . D PRIM^PXAIPRV K PRVDR\n . D EVENT^PXKMAIN\n S PXACCNT=$P($G(^AUPNVSIT(PXAVISIT,0)),\"^\",26) ;PX*1.0*164 ;Sets the PFSS Account Reference, if any\n K ^TMP(\"PXK\",$J),PXAERR,PXKERROR\n Q $S($G(PXAERRF):-1,1:1)\n ;\n ;\nEXIT ;--EXIT AND CLEAN UP\n D EVENT^PXKMAIN\n K ^TMP(\"PXK\",$J),PRVDR\n K PXAERR\n Q\n ;-----------------SUBROUTINES-----------------------\nERR ;\n ;\n ;\n I '$D(PXADI(\"DIALOG\")) Q\n N NODE,SCREEN\n S PXAERR(1)=$G(PXADATA),PXAERR(2)=$G(PXAPKG),PXAERR(3)=$G(PXASOURC)\n S PXAERR(4)=$G(PXAVISIT),PXAERR(5)=$G(PXAUSER)_\" \"_$P($G(^VA(200,PXAUSER,0)),\"^\",1)\n I $G(PXANOT)=1 D EXTERNAL\n E D INTERNAL\n D ARRAY^PXAICPTV\n K PXADI(\"DIALOG\")\n Q\n ;\nEXTERNAL ;---SEND ERRORS TO SCREEN\n W !,\"-----------------------------------------------------------------\"\n D BLD^DIALOG($G(PXADI(\"DIALOG\")),.PXAERR,\"\",\"SCREEN\",\"F\")\n D MSG^DIALOG(\"ESW\",\"\",50,10,\"SCREEN\")\n ;\n Q\nINTERNAL ;---SET ERRORS TO GLOBAL ARRAY\n S NODE=PXADATA\n D BLD^DIALOG($G(PXADI(\"DIALOG\")),.PXAERR,.PXAERR,NODE,\"F\")\n S NODE=$NA(@PXADATA@(\"DIERR\",$J)) D MSG^DIALOG(\"ESW\",\"\",50,10,NODE)\n Q\n ;\nPROVDRST ; Check provider status (Primary or Secondary)\n N PRVIEN,DETS,DIC,DR,DA,DIQ,PRI,PRVPRIM\n I $G(PXAK)=\"\" QUIT\n S PRVIEN=0\n F S PRVIEN=$O(^AUPNVPRV(\"AD\",PXAVISIT,PRVIEN)) Q:PRVIEN=\"\" D\n .S DETS=$G(^AUPNVPRV(PRVIEN,0))\n .I $P(DETS,U)=$G(@PXADATA@(\"PROVIDER\",PXAK,\"NAME\")) D\n ..S DIC=9000010.06,DR=.04,DA=PRVIEN\n ..S DIQ=\"PRVPRIM(\",DIQ(0)=\"EI\" D EN^DIQ1\n ..S PRI=$E($G(PRVPRIM(9000010.06,DA,DR,\"E\")),1,1)\n ..S @PXADATA@(\"PROVIDER\",PXAK,\"PRIMARY\")=$S(PRI=\"P\":1,1:0)\n Q\nPOVPRM(VISIT,PRIMFND,POVARR) ;\n N PRVIEN,DETS,STOP,LPXAK,ORDX,NDX,ORDXP\n S PRVIEN=0\n ;create array of existing DX; ORDX - pointer to ^ICD9(\n F S PRVIEN=$O(^AUPNVPOV(\"AD\",PXAVISIT,PRVIEN)) Q:PRVIEN=\"\" D\n .S DETS=$G(^AUPNVPOV(PRVIEN,0)),ORDX=$P(DETS,U)\n .S ORDX(ORDX)=PRVIEN I $P(DETS,U,12)=\"P\" S ORDXP(ORDX)=\"\"\n ; create array of passed DX; NDX - pointer to ^ICD9(\n S PXAK=0 F S PXAK=$O(@POVARR@(\"DX/PL\",PXAK)) Q:PXAK=\"\" D\n .S NDX=$G(@POVARR@(\"DX/PL\",PXAK,\"DIAGNOSIS\")) S NDX(NDX)=PXAK\n ; force entry of originally primary diagnosis with \"S\" flag\n I PRIMFND S ORDX=\"\" D\n .F S ORDX=$O(ORDXP(ORDX)) Q:ORDX=\"\" I PRIMFND'=ORDX D\n ..I $D(NDX(ORDX)) S @POVARR@(\"DX/PL\",NDX(ORDX),\"PRIMARY\")=0\n ..E D\n ...S LPXAK=$O(@POVARR@(\"DX/PL\",\"\"),-1)\n ...S @POVARR@(\"DX/PL\",LPXAK+1,\"DIAGNOSIS\")=ORDX\n ...S @POVARR@(\"DX/PL\",LPXAK+1,\"PRIMARY\")=0\n Q\n ;\n" }, { "path": "src/test/resources/samples/langs/M/WVBRNOT.m", "content": "WVBRNOT ;HCIOFO/FT,JR IHS/ANMC/MWR - BROWSE NOTIFICATIONS; ;7/30/98 11:02\n ;;1.0;WOMEN'S HEALTH;;Sep 30, 1998\n ;;* MICHAEL REMILLARD, DDS * ALASKA NATIVE MEDICAL CENTER *\n ;; CALLED BY OPTION: \"WV BROWSE NOTIFICATIONS\" TO BROWSE AND EDIT\n ;; NOTIFICATIONS.\n ;\n ;---> VARIABLES:\n ;---> WVA: 1=ALL PATIENTS, 0=ONE PATIENT\n ;---> WVDFN: DFN OF SELECTED PATIENT\n ;---> DATES: WVBEGDT=BEGINNING DATE, WVENDDT=ENDING DATE\n ;---> WVB: d=DELINQUENT, o=OPEN, q=queued, a=ALL (includes CLOSED).\n ;---> SORT SEQUENCE IN WVC: 1=DATE, PATIENT, PRIORITY\n ;---> 2=PATIENT, DATE, PRIORITY\n ;---> 3=PRIORITY, DATE, PATIENT\n ;---> USE NODES 3 & 4 IN ^TMP GLOBAL.\n ;\n D SETVARS^WVUTL5\n D ^WVBRNOT2 G:WVPOP EXIT\n D SORT\n D COPYGBL\n D ^WVBRNOT1\n ;\nEXIT ;EP\n D KILLALL^WVUTL8\n Q\n ;\n ;\nSORT ;EP\n ;---> SORT AND STORE ARRAY IN ^TMP(\"WV\",$J\n K ^TMP(\"WV\",$J)\n ;---> WVBEGDT1=ONE SECOND BEFORE BEGIN DATE.\n ;---> WVENDDT1=THE LAST SECOND OF END DATE.\n S WVBEGDT1=WVBEGDT-.0001,WVENDDT1=WVENDDT+.9999\n ;\n ;**************************\n ;---> WVA=1: ALL PATIENTS\n I WVA D Q\n .;---> BY DATE GET EITHER ALL OR OPEN ONLY.\n .N WVDFN,WVIEN,Y\n .S WVXREF=$S(WVB=\"a\":\"D\",WVB=\"q\":\"APRT\",1:\"AOPEN\")\n .S WVDATE=WVBEGDT1\n .F S WVDATE=$O(^WV(790.4,WVXREF,WVDATE)) Q:'WVDATE!(WVDATE>WVENDDT1) D\n ..S WVIEN=0\n ..F S WVIEN=$O(^WV(790.4,WVXREF,WVDATE,WVIEN)) Q:'WVIEN D\n ...Q:'$D(^WV(790.4,WVIEN,0))\n ...S Y=^WV(790.4,WVIEN,0),WVDFN=$P(Y,U)\n ...;---> QUIT IF SELECTING FOR ONE CASE MANAGER AND THIS DOESN'T MATCH.\n ...I 'WVE Q:$P(^WV(790,WVDFN,0),U,10)'=WVCMGR\n ...;---> QUIT IF LISTING \"DELINQUENT\" AND THIS PROCDURE IS NOT DELINQ.\n ...I WVB=\"d\" Q:$P(Y,U,13)' WVA=0: ONE PATIENT\n N WVIEN,Y S WVIEN=0\n F S WVIEN=$O(^WV(790.4,\"B\",WVDFN,WVIEN)) Q:'WVIEN D\n .S Y=^WV(790.4,WVIEN,0)\n .;---> QUIT IF NOT WITHIN DATE RANGE.\n .S WVDATE=$P(Y,U,2)\n .Q:WVDATE'>WVBEGDT1!(WVDATE>WVENDDT1)\n .;---> QUIT IF \"QUEUED\" AND THIS NOTIFICATION IS NOT QUEUED.\n .I WVB=\"q\" Q:'$P(Y,U,11) Q:'$D(^WV(790.4,\"APRT\",$P(Y,U,11),WVIEN))\n .;---> QUIT IF \"DELINQUENT\" OR OPEN ONLY AND THIS ENTRY IS CLOSED.\n .Q:\"do\"[WVB&($P(Y,U,14)=\"c\")\n .I WVB=\"d\" Q:$P(Y,U,13)'WVDATE IS ALREADY SET FROM LL SORT ABOVE. ;---> DATE\n S WVCHRT=$$SSN^WVUTL1(WVDFN)_\" \" ;---> SSN#\n S WVNAME=$$NAME^WVUTL1(WVDFN) ;---> NAME\n S WVACC=$P(Y,U,6) ;---> ACCESSION#\n I WVACC]\"\" S WVACC=$P(^WV(790.1,WVACC,0),U)\n S WVSTAT=$$STATUS^WVUTL4 ;---> STATUS\n S WVPRIO=9\n S:$P(Y,U,4)]\"\" WVPRIO=$P(^WV(790.404,$P(Y,U,4),0),U,2) ;---> PRIORITY\n ;\n S X=WVCHRT_U_WVNAME_U_WVDATE_U_WVACC_U_WVSTAT_U_WVPRIO_U_WVIEN\n I WVC=1 S ^TMP(\"WV\",$J,3,WVDATE,WVNAME,WVPRIO,WVIEN)=X Q\n I WVC=2 S ^TMP(\"WV\",$J,3,WVNAME,WVDATE,WVPRIO,WVIEN)=X Q\n I WVC=3 S ^TMP(\"WV\",$J,3,WVPRIO,WVDATE,WVNAME,WVIEN)=X\n Q\n ;\nCOPYGBL ;EP\n ;---> COPY ^TMP(\"WV\",$J,3 TO ^TMP(\"WV\",$J,4 TO MAKE IT FLAT.\n N I,M,N,P,Q\n S N=0,I=0\n F S N=$O(^TMP(\"WV\",$J,3,N)) Q:N=\"\" D\n .S M=0\n .F S M=$O(^TMP(\"WV\",$J,3,N,M)) Q:M=\"\" D\n ..S P=0\n ..F S P=$O(^TMP(\"WV\",$J,3,N,M,P)) Q:P=\"\" D\n ...S Q=0\n ...F S Q=$O(^TMP(\"WV\",$J,3,N,M,P,Q)) Q:Q=\"\" D\n ....S I=I+1,^TMP(\"WV\",$J,4,I)=^TMP(\"WV\",$J,3,N,M,P,Q)\n Q\n ;\n ;\nDEQUEUE ;EP\n ;---> TASKMAN QUEUE OF PRINTOUT.\n D SETVARS^WVUTL5,SORT,COPYGBL,^WVBRNOT1,EXIT\n Q\n ;\nFOLLOW(WVDFN) ;EP\n ;---> CALLED FROM PROCEDURE FOLLOWUP MENU.\n D SETVARS^WVUTL5\n S WVA=0,WVB=\"o\",WVBEGDT=(DT-50000),WVC=1,WVE=1,WVENDDT=DT\n D DEVICE^WVBRNOT2 Q:WVPOP\n S WVLOOP=1\n D SORT,COPYGBL,^WVBRNOT1\n Q\n" }, { "path": "src/test/resources/samples/langs/M/ZDIOUT1.m", "content": "ZDIOUT1 ; Experimental FileMan file output to host file\n ;---------------------------------------------------------------------------\n ; Copyright 2011 The Open Source Electronic Health Record Agent\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 N W \"Experimental FileMan file output to host file\",!\n D ASKFILE Q:FILE[\"^\"\n D ASKDIR Q:DIR[\"^\"\n D SAVEFILE(FILE,DIR)\n Q\nSAVEFILE(FILE,DIR) ; Save FILE to given host directory\n I '$$SLASH(DIR) Q\n N FGR S FGR=$$FGR(FILE) Q:'$$CHECK(FGR,\"Not a valid file number: \"_FILE)\n S IO=DIR_$P($E(FGR,2,$L(FGR)),\"(\")_\"+\"_$$FILENAME(FILE,FGR)_\".txt\"\n W IO,!\n C IO O IO:(\"WNS\"):1 E U $P W \"Cannot open \"\"\"_IO_\"\"\" for write!\",! Q\n D FILE(\"\",FILE,FGR)\n C IO\n Q\nPRNFILE(FILE,IO) ; Print FILE, optionally to IO device\n S:'$D(IO) IO=$P\n N FGR S FGR=$$FGR(FILE) Q:'$$CHECK(FGR,\"Not a valid file number: \"_FILE)\n D FILE(\"\",FILE,FGR)\n Q\nPRNENTRY(FILE,I,IO) ; Print FILE record #I, optionally to IO device\n S:'$D(IO) IO=$P\n N FGR S FGR=$$FGR(FILE) Q:'$$CHECK(FGR,\"Not a valid file number: \"_FILE)\n N DD D DDCR(FILE,.DD)\n D ENTITY(\"\",FILE,.DD,$$EGR(FGR,I))\n Q\nPRNDD(FILE,IO) ; Print DD for FILE, optionally to IO device\n S:'$D(IO) IO=$P\n ; DD(FILE) is a file#0 whose entries define fields of FILE\n N FGR S FGR=$NA(^DD(FILE))\n I '$D(@FGR) W \"Not a valid file number: \"_FILE,! Q\n D FILE(\"\",0,FGR)\n Q\n ;---------------------------------------------------------------------------\n ; Private implementation entry points below.\n ; References cite the VA FileMan 22.0 Programmer Manual.\n ;\nASKFILE ; Ask for file number\n R !,\"File#: \",FILE G:FILE=\"\" ASKFILE Q:FILE[\"^\" S FILE=+FILE\n S FGR=$$FGR(FILE)\n I '$$CHECK(FGR,\" (Not a valid file number)\") G ASKFILE\n W \" \",$$FILENAME(FILE,FGR)\n Q\nASKDIR ; Ask for host dir\n R !,!,\"Host output directory: \",DIR,! Q:DIR[\"^\" G:'$$SLASH(DIR) ASKDIR\n Q\nSLASH(DIR) ; Validate trailing slash\n I $E(DIR,$L(DIR))?1(1\"/\",1\"\\\") Q 1\n E U $P W \"Output directory must end in a slash!\" Q 0\nFGR(FILE) ; Get FILE Global Root\n Q $$ROOT^DILFD(FILE,\"\",1)\nEGR(FGR,I) ; Get ENTRY Global Root\n Q $NA(@FGR@(I))\nCHECK(V,MSG) ; Validate non-empty value\n I V=\"\" W MSG,! Q 0\n Q 1\nDDCR(FILE,DD) ; X-ref global subscript location to DD field\n ; The DD field definition 0-node has ^-pieces \"^^^S;P^\" where\n ; \"S;P\" is the node Subscript and Piece within the node value (14.9.2).\n N F S F=\"\" F S F=$O(^DD(FILE,F)) Q:F=\"\" D:+F\n . N F4,S,P S F4=$P(^DD(FILE,F,0),\"^\",4),S=$P(F4,\";\",1),P=$P(F4,\";\",2) Q:S=\" \"\n . S DD(S,F)=P ; Subscript S contains field F at piece P\n Q\nFILE(D,FILE,FGR) ; Write all entries in a file\n ; TODO: Sort entries by .01 or KEY to ensure consistent order\n N DD D DDCR(FILE,.DD)\n N I S I=\"\" F S I=$O(@FGR@(I)) Q:I=\"\" D\n . I +I D\n . . D ENTITY(D,FILE,.DD,$$EGR(FGR,I))\n . E D ; TODO: Handle known non-entry subscripts such as \"B\"\n . . D SUBS(D,$$EGR(FGR,I),I)\n Q\nWP(D,FGR) ; Write a word-processing value\n ; A word processing field is actually a file in which each entry has a\n ; .01 field containing the line of text, and the type of the field has \"W\".\n U IO W D,\";\",$$VALUE(@FGR@(0)),! ; TODO: Preserve date from ^(0)\n N I S I=\"\" F S I=$O(@FGR@(I)) Q:I=\"\" D:+I ; TODO: Other subscripts?\n . U IO W D,$$VALUE(@FGR@(I,0)),!\n U IO W D,\";\",!\n Q\nENTITY(D,FILE,DD,EGR) ; Write a file entry\n U IO W D,\"ENTITY\"_$C(9)_\";;\"_$$FILENAME(FILE,FGR)_\"^\"_$S(FILE=0:\"\",1:FILE)_\" ;\"_EGR,!\n U IO W D_$C(9)_\";\",!\n ; Add key tag with field .01 value (14.9.2).\n ; TODO: Use indexing cross-references or KEY file entries for key tags?\n ; TODO: Escape key values, handle pointers?\n U IO W D,\"KA\"_$C(9)_\";;\",$P(@EGR@(0),\"^\"),!\n U IO W D_$C(9)_\";\",!\n N S S S=\"\" F S S=$O(@EGR@(S)) Q:S=\"\" D ; Find DD fields at S.\n . I $D(DD(S))<10 D ; TODO: Field defs like \"DEL\" not in ^DD(0)\n . . D SUBS(D,$NA(@EGR@(S)),S)\n . N F S F=\"\" F S F=$O(DD(S,F)) Q:F=\"\" D\n . . D FIELD(D,FILE,F,$NA(@EGR@(S)),DD(S,F))\n Q\n ;\nSUBS(D,G,S) ; Write an extraneous subscript\n U IO W D,\"SUBS\"_$C(9)_\";;\"_S,!\n I $D(@G)#10 U IO W D_$C(9),$$VALUE(@G),!\n I $D(@G)\\10 U IO W D_$C(9),\"; OMITTED CHILDREN\",!\n U IO W D_$C(9),\";\",!\n Q\nFIELD(D,FILE,F,EGRF,P) ; Write a field\n ; The DD field definition 0-node has ^-pieces \"NAME^TYPE^\" (14.9.2).\n N FD S FD=^DD(FILE,F,0)\n N NAME S NAME=$P(FD,\"^\",1)\n N TYPE S TYPE=$P(FD,\"^\",2)\n ; TYPE starts with a subfile number if the field is a multiple (14.9.2)\n N SUBFILE S SUBFILE=+TYPE\n I SUBFILE D\n . D FIELDSUB\n E D\n . D FIELDONE\n Q\nFIELDTAG ; Write tag for a field\n U IO W D,\"F\"_$TR(F,\".\",\"P\")_$C(9)_\";;\"_NAME_\"^\"_F_\" ;\"_TYPE,!\n Q\nFIELDSUB ; Write a multiple-valued field\n D FIELDTAG\n I $D(@EGRF)#10 U IO W D_$C(9),\"; OMITTED SELF\",!\n ; Word-processing values are files whose .01 field type has \"W\".\n I $P($G(^DD(SUBFILE,.01,0)),\"^\",2)[\"W\" D\n . D WP(D_$C(9),EGRF)\n E D\n . D FILE(D_$C(9),SUBFILE,EGRF) U IO W D_$C(9),\";\",!\n Q\nFIELDONE ; Write a single-valued field\n N V S V=$$FIELDVAL(EGRF,P) Q:V=\"\"\n N EV ; Some TYPEs have an external-format value\n N T S T=TYPE\n I T[\"F\" S TYPE=TYPE_\";\"_\"Free Text\"\n I T[\"N\" S TYPE=TYPE_\";\"_\"Numeric\"\n I T[\"K\" S TYPE=TYPE_\";\"_\"MUMPS Code\"\n I T[\"P\" S TYPE=TYPE_\";\"_\"Pointer\",EV=1\n I T[\"V\" S TYPE=TYPE_\";\"_\"Variable Pointer\",EV=1\n I T[\"S\" S TYPE=TYPE_\";\"_\"Set of Codes\",EV=1\n I T[\"D\" S TYPE=TYPE_\";\"_\"Date\",EV=1\n I $D(EV) S V=V_\"^\"_$$EXTERNAL^DILFD(FILE,F,\"\",V)\n D FIELDTAG\n U IO W D_$C(9),$$VALUE(V),!\n I $D(@EGRF)\\10 U IO W D_$C(9),\"; OMITTED CHILDREN\",!\n U IO W D_$C(9),\";\",!\n Q\nFIELDVAL(EGRF,P) ; Extract piece P of node value holding field\n I +P Q $P(@EGRF,\"^\",P)\n I $E(P,1)=\"E\" Q $E(@EGRF,$P($E(P,2,$L(P)),\",\",1),$P(P,\",\",2))\n Q \";UNKNOWN \"\"GLOBAL SUBSCRIPT LOCATION\"\" PIECE \"\"\"_P_\"\"\"\"\n ;\nFILENAME(FILE,FGR) ; Lookup the name of given FILE# (or subfile#)\n I FILE=0 Q $P(@FGR@(0),\"^\") ; DD\n Q $O(^DD(FILE,0,\"NM\",\"\")) ; TODO: Reliable? Any documented API?\nVALUE(V) ; Write value line to output\n ; TODO: If value starts in one of \" $ ; or contains non-printing\n ; characters then it must be escaped for evaluation on RHS of SET.\n ; TODO: Caller must define indentation level with a comment if\n ; the first character of the first value is a tab or space.\n Q V\n" }, { "path": "src/test/resources/samples/langs/M/_zewdAPI.m", "content": "%zewdAPI\t; Enterprise Web Developer run-time functions and user APIs\n ;\n ; Product: Enterprise Web Developer (Build 944)\n ; Build Date: Fri, 23 Nov 2012 17:15:06\n ; \n ; ----------------------------------------------------------------------------\n ; | Enterprise Web Developer for GT.M and m_apache |\n ; | Copyright (c) 2004-12 M/Gateway Developments Ltd, |\n ; | Reigate, Surrey UK. |\n ; | All rights reserved. |\n ; | |\n ; | http://www.mgateway.com |\n ; | Email: rtweed@mgateway.com |\n ; | |\n ; | This program is free software: you can redistribute it and/or modify |\n ; | it under the terms of the GNU Affero General Public License as |\n ; | published by the Free Software Foundation, either version 3 of the |\n ; | License, or (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 Affero General Public License for more details. |\n ; | |\n ; | You should have received a copy of the GNU Affero General Public License |\n ; | along with this program. If not, see . |\n ; ----------------------------------------------------------------------------\n ;\n ;QUIT\n ;\n ;\nversion() ;\n QUIT \"Enterprise Web Developer (Build \"_$$getVersion^%zewdCompiler()_\")\"\n ;\ndate() ;\n QUIT $$getDate^%zewdCompiler()\n ;\ncompilePage(app,page,mode,technology,outputPath,multilingual,maxLines)\n d compilePage^%zewdCompiler($g(app),$g(page),$g(mode),$g(technology),$g(outputPath),$g(multilingual),$g(maxLines))\n QUIT\n ;\ncompileAll(app,mode,technology,outputPath,multilingual,templatePageName,maxLines)\n d compileAll^%zewdCompiler($g(app),$g(mode),$g(technology),$g(outputPath),$g(multilingual),$g(templatePageName),$g(maxLines))\n QUIT\n ;\nautoTranslate(app,language,verbose)\n d autoTranslate^%zewdMgr($g(app),$g(language),$g(verbose))\n ;\nstartSession(page,requestArray,serverArray,sessionArray,filesArray) ;\n ;\n QUIT $$startSession^%zewdPHP(page,.requestArray,.serverArray,.sessionArray,.filesArray)\n ;\ncloseSession(requestArray) ;\n ;\n QUIT $$closeSession^%zewdPHP(.requestArray)\n ;\nsaveSession(sessionArray) ;\n ;\n d saveSession^%zewdPHP(.sessionArray)\n QUIT\n ;\nendOfPage(sessionArray)\n ;\n d endOfPage^%zewdPHP(.sessionArray)\n QUIT\n ;\nprePageScript(sessid)\n QUIT $$prePageScript^%zewdPHP(sessid)\n ;\nreleaseLock(sessid)\n d releaseLock^%zewdPHP(sessid)\n QUIT\n ;\ntokeniseURL(url,sessid)\n QUIT $$tokeniseURL^%zewdCompiler16($g(url),$g(sessid))\n ;\ngetSessid(token)\n ;\n i token=\"\" QUIT \"\"\n i $$isTokenExpired(token) QUIT \"\"\n QUIT $p(^%zewdSession(\"tokens\",token),\"~\",1)\n ;\ninitialiseSession(sessid)\n k ^%zewdSession(\"session\",sessid)\n QUIT\n ;\ndeleteSession(sessid)\n ;\n d deleteSession^%zewdPHP(sessid)\n ;\n QUIT\n ;\nchangeApp(appName,sessid)\n i $g(appName)=\"\" QUIT\n i $g(sessid)=\"\" QUIT\n d setSessionValue(\"ewd_appName\",appName,sessid)\n QUIT\n ;\nsetRedirect(toPage,sessid,app)\n i $g(app)'=\"\" d\n . d setSessionValue(\"ewd_appName\",app,sessid)\n d setJump(toPage,sessid,$g(app))\n QUIT\n ;\nsetJump(toPage,sessid,app)\n ;\n n token\n ;\n i $g(app)'=\"\",$e(sessid,1,4)=\"csp:\" d\n . n path\n . s path=$$getRootURL(\"csp\")\n . i $e(path,$l(path))'=\"/\" s path=path_\"/\"\n . s toPage=path_app_\"/\"_toPage\n d setSessionValue(\"ewd_jump\",toPage,sessid)\n d setSessionValue(\"ewd_nextPage\",toPage,sessid)\n QUIT:$e(sessid,1,4)=\"csp:\"\n s token=$$setNextPageToken(toPage,sessid)\n d setSessionValue(\"ewd_pageToken\",token,sessid)\n QUIT\n ;\nsetNextPageToken(nextPage,sessid)\n ;\n n token,length\n ;\n s length=$$getSessionValue(\"ewd_sessid_length\",sessid)\n i length=\"\" s length=30\n i $g(sessid)=\"\" s sessid=0\n f s token=$$makeTokenString(length) q:'$d(^%zewdSession(\"nextPageTokens\",sessid,token))\n i $g(^zewd(\"trace\"))=1 d trace^%zewdAPI(\"setNextPageToken^%zewdAPI: sessid=\"_sessid_\"; token=\"_token_\"; nextPage=\"_nextPage)\n s ^%zewdSession(\"nextPageTokens\",sessid,token,$$zcvt(nextPage,\"l\"))=\"\"\n QUIT token\n ; \nisNextPageTokenValid(token,sessid,page)\n QUIT $$isNextPageTokenValid^%zewdCompiler13(token,sessid,page)\n ;\nisCSP(sessid)\n QUIT $e(sessid,1,4)=\"csp:\"\n ;\nnormaliseTextValue(text)\n s text=$$replaceAll(text,\"'\",\"'\")\n QUIT $$zcvt(text,\"o\",\"HTML\")\n ;\nwriteLine(line,technology)\n i technology=\"node\" d\n . s ^CacheTempBuffer($j,$increment(^CacheTempBuffer($j)))=line\n e d\n . w line\n QUIT\n ;\ndisplayOptions(fieldName,listName,escape)\n ;d displayOptions^%zewdCompiler13($g(fieldName),$g(listName),$g(escape))\n n codeValue,%d,i,line,name,nnvp,nvp,pos,technology,textValue,value\n ;\n s technology=$$getSessionValue^%zewdAPI(\"ewd.technology\",sessid)\n s fieldName=$tr(fieldName,\".\",\"_\")\n s listName=$tr(listName,\".\",\"_\")\n i 0\n e d\n . s escape=+$g(escape)\n . s pos=\"\"\n . f s pos=$o(^%zewdSession(\"session\",sessid,\"ewd_list\",listName,pos)) q:pos=\"\" d\n . . k %d,textValue,codeValue,codeValueEsc,textValueEsc\n . . s %d=^%zewdSession(\"session\",sessid,\"ewd_list\",listName,pos)\n . . s textValue=$p(%d,$c(1),1)\n . . ;\n . . s textValueEsc=textValue\n . . i $g(^zewd(\"xssEncoding\")) d\n . . . s textValueEsc=$$htmlOutputEncode^%zewdAPI2(textValueEsc)\n . . e d \n . . . s textValueEsc=$$replaceAll(textValueEsc,\"'\",\"'\")\n . . . i escape s textValueEsc=$$zcvt(textValue,\"o\",\"HTML\")\n . . ;\n . . s codeValue=$p(%d,$c(1),2)\n . . i codeValue=\"\" s codeValue=textValue\n . . s codeValueEsc=codeValue\n . . i $g(^zewd(\"xssEncoding\")) d\n . . . s codeValueEsc=$$htmlOutputEncode^%zewdAPI2(codeValueEsc)\n . . e d \n . . . s codeValueEsc=$$replaceAll(codeValueEsc,\"'\",\"'\")\n . . . i escape s codeValueEsc=$$zcvt(codeValue,\"o\",\"HTML\")\n . . s line=\"\"_$c(13,10)\n . . d writeLine(line,technology)\n QUIT\n ;\ndisplayTextArea(fieldName)\n d displayTextArea^%zewdCompiler13($g(fieldName))\n QUIT\n ;\nmCSPReq2(fields)\n ;\n n i,noOfFields,field,type\n s noOfFields=$l(fields,\"`\")\n f i=1:1:noOfFields d\n . s field=$p(fields,\"`\",i)\n . q:field=\"\"\n . s type=$p(field,\"|\",2)\n . S field=$P(field,\"|\",1)\n . d mergeCSPRequestToSession(field,type)\n d mergeCSPRequestToSession(\"ewd_pressed\",\"hidden\")\n QUIT\n ;\nmCSPReq(fieldName,type)\n d mergeCSPRequestToSession(fieldName,type)\n QUIT\n ;\nmergeCSPRequestToSession(fieldName,type)\n d mergeCSPRequestToSession^%zewdCompiler16($g(fieldName),$g(type))\n QUIT\n ;\n ; note - textarea data storage can be queried using SQL with the following construct\n ; \n ; listAttributeFL {type=%Library.String ; sqllisttype=subnode}\n ;\ndisplayText(textID,reviewMode,sessid)\n\tQUIT $$displayText^%zewdCompiler13($g(textID),$g(reviewMode),$g(sessid))\n\t;\nsystemMessage(text,type,sessid,appName,langCode)\n n textid,fragments,outputText,error,technology,translationMode,typex\n ;\n ;d trace^%zewdAPI(\"systemMessage : text=\"_text_\" ; type=\"_type_\" ; sessid=\"_sessid)\n i $g(text)=\"\" QUIT \"\"\n ; manual API or where sessid not known\n i $g(sessid)=\"\" QUIT $$systemMessage^%zewdCompiler5(text,$g(type),$g(appName),$g(langCode))\n s translationMode=+$$getSessionValue^%zewdAPI(\"ewd_translationMode\",sessid)\n ;d trace^%zewdAPI(\"ewd_translationMode=\"_translationMode)\n i 'translationMode QUIT text\n s appName=$$getSessionValue^%zewdAPI(\"ewd_appName\",sessid)\n ;d trace^%zewdAPI(\"appName=\"_appName)\n s typex=type ; avoid Cache bug !\n i $$getPhraseIndex^%zewdCompiler5(text)=\"\" QUIT \"\"\n i '$$isTextPreviouslyFound^%zewdCompiler5(text,appName,\"\",\"\",.textid,,,type) d\n . s textid=$$addTextToIndex^%zewdCompiler5(text,appName,\"\",\"\",.fragments,.outputText,typex)\n s error=$$displayText(textid,0,sessid)\n QUIT error\n ;\nerrorMessage(text,sessid)\n QUIT $$systemMessage(text,\"error\",sessid)\n ;\n ; ============================================================================\n ; User API Methods\n ; ============================================================================\n ;\nisCSPPage(docOID)\n ;\n n docName\n ;\n s docName=$$getDocumentName^%zewdDOM(docOID)\n QUIT $$bypassMode^%zewdCompiler(docName)\n ;\ngetSessionValue(name,sessid)\n ;\n n %zt,return,technology,value\n ;\n s name=$$stripSpaces(name)\n i $g(name)=\"\" QUIT \"\"\n i $g(sessid)=\"\" QUIT \"\"\n i name[\".\" d QUIT value\n . n np,obj,prop\n . i name[\"_\" s name=$p(name,\"_\",1)_\".\"_$p(name,\"_\",2,200)\n . s np=$l(name,\".\")\n . s obj=$p(name,\".\",1,np-1)\n . s prop=$p(name,\".\",np)\n . s value=$$getSessionObject(obj,prop,sessid)\n ;s $zt=\"extcErr\"\n ;i $r(100)<10 i '$$$licensed(\"DOM\",,,,,,,,,,) d setWarning(\"You do not have a current eXtc License\",sessid)\n ;i $$isTemp(name) d QUIT value\n i $e(name,1,4)=\"tmp_\" d QUIT value\n . s value=$g(zewdSession(name))\n . i value=\"\",$g(^%zewdSession(\"session\",sessid,\"ewd_technology\"))=\"gtm\" s value=$g(sessionArray(name))\n QUIT $g(^%zewdSession(\"session\",sessid,name))\n ;\nsetWLDSymbol(name,sessid)\n ;\n ; ------------------------------------------------------\n ; Duplicate copy for performance: see also %zewdPHP!\n ; ------------------------------------------------------\n ;\n n wldAppName,wldName,wldSessid,%zzname\n ;\n QUIT:$zv[\"GT.M\"\n QUIT\n ;\nextcErr\n ;\n n mess\n s mess=\"eXtc does not appear to have been installed or is unavailable in the \"_$$namespace()_\" namespace where your application is attempting to run. Your application will be unable to run correctly\"\n d setWarning(mess,sessid)\n s $zt=%zt\n QUIT \"\"\n ;\nvalueErr ;\n s $zt=$g(%zt)\n QUIT \"\"\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nexportCustomTags(tagList,filepath)\n QUIT $$exportCustomTags^%zewdCompiler16(.tagList,$g(filepath))\n ;\nexportAllCustomTags(filepath)\n QUIT $$exportAllCustomTags^%zewdCompiler16($g(filepath))\n ;\nimportCustomTags(filePath)\n QUIT $$importCustomTags^%zewdForm($g(filePath))\n ;\nsetSessionValue(name,value,sessid)\n ;\n s name=$$stripSpaces(name)\n i $g(name)=\"\" QUIT\n i $g(sessid)=\"\" QUIT\n i name[\".\" d QUIT\n . n np,obj,prop\n . i name[\"_\" s name=$p(name,\"_\",1)_\".\"_$p(name,\"_\",2,200)\n . s np=$l(name,\".\")\n . s obj=$p(name,\".\",1,np-1)\n . s prop=$p(name,\".\",np)\n . d setSessionObject(obj,prop,value,sessid)\n s value=$g(value)\n i $e(name,1,4)=\"tmp_\" s zewdSession(name)=value QUIT\n s ^%zewdSession(\"session\",sessid,name)=value\n QUIT\n ;\nallowJSONAccess(sessionName,access,sessid)\n ; access=\"r|rw\"\n s ^%zewdSession(\"jsonAccess\",sessid,sessionName)=access\n QUIT\n ;\ndisallowJSONAccess(sessionName,sessid)\n k ^%zewdSession(\"jsonAccess\",sessid,sessionName)\n QUIT\n ;\nJSONAccess(sessionName,sessid)\n QUIT $g(^%zewdSession(\"jsonAccess\",sessid,sessionName))\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nisTemp(name)\n QUIT $e(name,1,4)=\"tmp_\"\n ;\n ;\nexistsInSession(name,sessid)\n QUIT $$existsInSession^%zewdCompiler13($g(name),$g(sessid))\n ;\nexistsInSessionArray(name,p1,p2,p3,p4,p5,p6,p7,p8,p9,p10,p11)\n QUIT $$existsInSessionArray^%zewdCompiler13($g(name),$g(p1),$g(p2),$g(p3),$g(p4),$g(p5),$g(p6),$g(p7),$g(p8),$g(p9),$g(p10),$g(p11))\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nclearSessionArray(arrayName,sessid)\n s arrayName=$$stripSpaces(arrayName)\n i $g(sessid)=\"\" QUIT\n i $g(arrayName)=\"\" QUIT\n s arrayName=$tr(arrayName,\".\",\"_\")\n ;i $$isTemp(arrayName) k zewdSession(arrayName) QUIT\n i $e(arrayName,1,4)=\"tmp_\" k zewdSession(arrayName) QUIT\n k ^%zewdSession(\"session\",sessid,arrayName)\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nsetSessionArray(arrayName,itemName,itemValue,sessid)\n ;\n s arrayName=$$stripSpaces(arrayName)\n QUIT:$g(arrayName)=\"\"\n QUIT:$g(itemName)=\"\"\n QUIT:$g(sessid)=\"\"\n s arrayName=$tr(arrayName,\".\",\"_\")\n i $$isTemp(arrayName) s zewdSession(arrayName,itemName)=itemValue QUIT\n s ^%zewdSession(\"session\",sessid,arrayName,itemName)=itemValue\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\ngetSessionArray(arrayName,sessid,array,clearArray)\n ;\n s arrayName=$$stripSpaces(arrayName)\n QUIT:$g(arrayName)=\"\"\n s arrayName=$tr(arrayName,\".\",\"_\")\n QUIT:$g(sessid)=\"\"\n set $zt=\"getSessionArrayErr\"\n i $g(clearArray)=1 k array\n i $$isTemp(arrayName) m array=zewdSession(arrayName) QUIT\n m array=^%zewdSession(\"session\",sessid,arrayName)\n QUIT\n ;\ngetSessionArrayErr ; --- Come here if error occurred in 'getSessionArray' ---\n set $zt=\"\"\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\naddToSession(name,sessid)\n s name=$$stripSpaces(name)\n QUIT:$g(sessid)=\"\"\n QUIT:$g(name)=\"\"\n s name=$tr(name,\".\",\"_\")\n i $$isTemp(name) m zewdSession(name)=@name QUIT\n m ^%zewdSession(\"session\",sessid,name)=@name\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nmergeToSession(name,sessid)\n QUIT:$g(sessid)=\"\"\n QUIT:$g(name)=\"\"\n d addToSession(name,sessid)\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nmergeGlobalToSession(globalName,sessionName,sessid)\n d mergeGlobalToSession^%zewdCompiler13($g(globalName),$g(sessionName),$g(sessid))\n QUIT\n ;\nmergeGlobalFromSession(globalName,sessionName,sessid)\n d mergeGlobalFromSession^%zewdCompiler13($g(globalName),$g(sessionName),$g(sessid))\n QUIT\n ;\nmergeArrayToSession(array,sessionName,sessid)\n QUIT:$g(sessid)=\"\"\n QUIT:$g(sessionName)=\"\"\n s sessionName=$tr(sessionName,\".\",\"_\")\n ;i $$isTemp(sessionName) m zewdSession(sessionName)=array QUIT\n i $e(sessionName,1,4)=\"tmp_\" m zewdSession(sessionName)=array QUIT\n m ^%zewdSession(\"session\",sessid,sessionName)=array\n QUIT\n ;\nmergeArrayToSessionObject(array,sessionName,sessid)\n d mergeArrayToSessionObject^%zewdCompiler16(.array,$g(sessionName),$g(sessid))\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nmergeArrayFromSession(array,sessionName,sessid)\n QUIT:$g(sessid)=\"\"\n QUIT:$g(sessionName)=\"\"\n s sessionName=$tr(sessionName,\".\",\"_\")\n ;i $$isTemp(sessionName) m array=zewdSession(sessionName) QUIT\n i $e(sessionName,1,4)=\"tmp_\" m array=zewdSession(sessionName) QUIT\n m array=^%zewdSession(\"session\",sessid,sessionName)\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nmergeFromSession(name,sessid)\n QUIT:$g(sessid)=\"\"\n QUIT:$g(name)=\"\"\n s name=$tr(name,\".\",\"_\")\n i $$isTemp(name) m @name=zewdSession(name)\n m @name=^%zewdSession(\"session\",sessid,name)\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\ndeleteFromSession(name,sessid)\n QUIT:$g(sessid)=\"\"\n QUIT:$g(name)=\"\"\n i name[\".\" d QUIT\n . n np,obj,prop\n . s np=$l(name,\".\")\n . s obj=$p(name,\".\",1,np-1)\n . s prop=$p(name,\".\",np)\n . d deleteFromSessionObject(obj,prop,sessid)\n ;i $$isTemp(name) k zewdSession(name) QUIT\n i $e(name,1,4)=\"tmp_\" k zewdSession(name) QUIT\n k ^%zewdSession(\"session\",sessid,name)\n QUIT\n ;\nsessionNameExists(name,sessid)\n QUIT:$g(sessid)=\"\"\n QUIT:$g(name)=\"\"\n s name=$tr(name,\".\",\"_\")\n i $$isTemp(name) QUIT $d(zewdSession(name))\n QUIT $d(^%zewdSession(\"session\",sessid,name))\n ;\ngetSessionArrayValue(arrayName,subscript,sessid,exists)\n QUIT $$getSessionArrayValue^%zewdCompiler13($g(arrayName),$g(subscript),$g(sessid),.exists)\n ;\nsessionArrayValueExists(arrayName,subscript,sessid)\n QUIT $$sessionArrayValueExists^%zewdCompiler13($g(arrayName),$g(subscript),$g(sessid))\n ;\ndeleteSessionArrayValue(arrayName,subscript,sessid)\n d deleteSessionArrayValue^%zewdCompiler13($g(arrayName),$g(subscript),$g(sessid))\n QUIT\n ;\n ; Objects\n ;\nsetSessionObject(objectName,propertyName,propertyValue,sessid)\n ;d setSessionObject^%zewdCompiler13($g(objectName),$g(propertyName),$g(propertyValue),$g(sessid))\n ;QUIT\n\t;\n\tn comma,i,np,p,sessionArray,x\n\t;\n\ti $g(objectName)=\"\" QUIT\n\ti $g(propertyName)=\"\" QUIT\n\t;i $g(propertyValue)=\"\" QUIT\n\ti $g(sessid)=\"\" QUIT\n s np=$l(objectName,\".\")\n ;s objectName=$$replace(objectName,\".\",\"_\")\n i objectName[\".\" s objectName=$p(objectName,\".\",1)_\"_\"_$p(objectName,\".\",2,2000)\n i np=1 d QUIT\n\t. i $e(objectName,1,3)=\"tmp\" s zewdSession(objectName_\"_\"_propertyName)=propertyValue q\n\t. s ^%zewdSession(\"session\",sessid,(objectName_\"_\"_propertyName))=propertyValue\n ;\n f i=1:1:np-1 s p(i)=$p(objectName,\".\",i)\n s comma=\",\"\n i $e(objectName,1,4)=\"tmp_\" d\n . s x=\"s zewdSession(\",comma=\"\"\n\te d\n . s x=\"s ^%zewdSession(\"\"session\"\",\"\"\"_sessid_\"\"\"\"\n i propertyValue[\"\"\"\" d\n . s propertyValue=$$replaceAll^%zewdAPI(propertyValue,\"\"\"\",$c(4))\n . s propertyValue=$$replaceAll^%zewdAPI(propertyValue,$c(4),\"\"\"\"\"\")\n f i=1:1:np-1 s x=x_comma_\"\"\"\"_p(i)_\"\"\"\",comma=\",\"\n s x=x_\",\"\"\"_propertyName_\"\"\")=\"\"\"_propertyValue_\"\"\"\"\n x x\n QUIT\n ;\ngetSessionObject(objectName,propertyName,sessid)\n ;\n n i,np,p,value,x\n ;\n i $g(sessid)=\"\" QUIT \"\"\n s value=\"\"\n s np=$l(objectName,\".\")\n i objectName[\".\",objectName'[\"_\" s objectName=$p(objectName,\".\",1)_\"_\"_$p(objectName,\".\",2,2000)\n ;s objectName=$$replace(objectName,\".\",\"_\")\n i np=1 QUIT $g(^%zewdSession(\"session\",sessid,(objectName_\"_\"_propertyName)))\n ;\n f i=1:1:np-1 s p(i)=$p(objectName,\".\",i)\n s x=\"s value=$g(^%zewdSession(\"\"session\"\",\"\"\"_sessid_\"\"\"\"\n f i=1:1:np-1 s x=x_\",\"\"\"_p(i)_\"\"\"\"\n s x=x_\",\"\"\"_propertyName_\"\"\"))\"\n x x\n QUIT value\n ;\ndeleteFromSessionObject(objectName,propertyName,sessid)\n d deleteFromSessionObject^%zewdCompiler13($g(objectName),$g(propertyName),$g(sessid))\n QUIT\n ;\nsessionObjectPropertyExists(objectName,propertyName,sessid)\n QUIT $$sessionObjectPropertyExists^%zewdCompiler13($g(objectName),$g(propertyName),$g(sessid))\n ;\ndeleteSessionObject(objectName,sessid)\n n obj\n s obj=objectName\n i obj[\".\" s obj=$tr(obj,\".\",\"_\")\n i obj'[\"_\" s obj=obj_\"_\"\n d clearSessionByPrefix(obj,$g(sessid))\n ;d deleteSessionObject^%zewdCompiler13($g(objectName),$g(sessid))\n QUIT\n ;\ncopyObjectToSession(oref,objectName,sessid)\n d copyObjectToSession^%zewdCompiler13($g(oref),$g(objectName),$g(sessid))\n QUIT\n ;\ncopyResultSetToSession(oref,objectName,sessid)\n d copyResultSetToSession^%zewdCompiler13($g(oref),$g(objectName),$g(sessid))\n QUIT\n ;\ngetResultSetValue(resultSetName,index,propertyName,sessid)\n QUIT $$getResultSetValue^%zewdCompiler13($g(resultSetName),$g(index),$g(propertyName),$g(sessid))\n ;\naddToResultSet(sessionName,propertyName,value,sessid)\n d addToResultSet^%zewdCompiler13($g(sessionName),$g(propertyName),$g(value),$g(sessid))\n QUIT\n ;\nmergeRecordArrayToResultSet(sessionName,recordArray,sessid)\n d mergeRecordArrayToResultSet^%zewdCompiler13($g(sessionName),.recordArray,$g(sessid))\n QUIT\n ;\nJSONToSessionObject(objectName,jsonString,sessid)\n d JSONToSessionObject^%zewdCompiler13($g(objectName),$g(jsonString),$g(sessid))\n QUIT\n ;\nsessionObjectToJSON(objectName,sessid)\n QUIT $$sessionObjectToJSON^%zewdCompiler13($g(objectName),$g(sessid))\n ;\nobjectGlobalToJSON(objectName)\n QUIT $$objectGlobalToJSON^%zewdCompiler13($g(objectName))\n ;\nsaveJSON(objectName,jsonString)\n QUIT $$saveJSON^%zewdCompiler13($g(objectName),$g(jsonString))\n ;\ngetJSON(objectName,addRefCol)\n QUIT $$getJSON^%zewdCompiler13($g(objectName),$g(addRefCol))\n ;\nsetJSONValue(JSONName,objectName,sessid)\n d setJSONValue^%zewdCompiler16($g(JSONName),$g(objectName),$g(sessid))\n d allowJSONAccess(objectName,\"r\",sessid)\n QUIT\n ;\nconvertToJSON(arrayName,isExtJS)\n n dojo\n i '$d(@arrayName) QUIT \"\"\n s dojo=\"\"\n i $g(isExtJS)=1 s dojo=2\n QUIT $$walkArray^%zewdCompiler13(\"\",arrayName,dojo)\n ;\nmergeToJSObject(sessionObject,JSObject)\n QUIT $$mergeToJSObject^%zewdCompiler13($g(sessionObject),$g(JSObject),$g(sessid))\n ;\n ; Javascript objects\n ;\ngetJavascriptObjectBlock(objectName,docName,textArray)\n QUIT $$getJavascriptObjectBlock^%zewdCompiler13($g(objectName),$g(docName),.textArray)\n ;\nreplaceJavascriptObject(objectName,newFunctionText,docName)\n QUIT $$replaceJavascriptObject^%zewdCompiler13($g(objectName),$g(newFunctionText),$g(docName))\n ;\nreplaceJavascriptObjectBody(functionName,newBody,docName)\n QUIT $$replaceJavascriptObjectBody^%zewdCompiler13($g(functionName),$g(newBody),$g(docName))\n ;\ngetJavascriptObjectBody(functionName,docName)\n QUIT $$getJavascriptObjectBody^%zewdCompiler13($g(functionName),$g(docName))\n ;\ngetJavascriptObject(objectName,docName,eOID)\n QUIT $$getJavascriptObject^%zewdCompiler13($g(objectName),$g(docName),$g(eOID))\n ;\njavascriptObjectExists(objectName,docName)\n QUIT $$javascriptObjectExists^%zewdCompiler13($g(objectName),$g(docName))\n ;\ngetLastJavascriptTag(docName,textArray)\n QUIT $$getLastJavascriptTag^%zewdCompiler13($g(docName),.textArray)\n ;\naddJavascriptObject(docName,jsText)\n QUIT $$addJavascriptObject^%zewdCompiler13($g(docName),.jsText)\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nsetSessionValues(nvArray,sessid)\n ;\n QUIT:$g(sessid)=\"\"\n n name,no,value\n s name=\"\"\n f s name=$o(nvArray(name)) q:name=\"\" d\n . d deleteFromSession(name,sessid)\n . d clearSelected(name,sessid)\n . s value=$g(nvArray(name))\n . d setSessionValue(name,value,sessid)\n . s no=\"\"\n . f s no=$o(nvArray(name,no)) q:no=\"\" d\n . . s value=nvArray(name,no)\n . . d addToSelected(name,value,sessid)\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\ngetSessionValues(prefix,nvArray,sessid)\n ;\n n len,name,no,value\n QUIT:$g(sessid)=\"\"\n QUIT:$g(prefix)=\"\"\n set $zt=\"getSessionValuesErr\"\n s len=$l(prefix)\n k nvArray\n s name=prefix\n f s name=$o(^%zewdSession(\"session\",sessid,name)) q:name=\"\" q:$e(name,1,len)'=prefix d\n . d setNVArray(name,.nvArray,sessid)\n s name=prefix,no=0\n f s name=$o(^%zewdSession(\"session\",sessid,\"ewd_selected\",name)) q:name=\"\" q:$e(name,1,len)'=prefix d\n . s value=\"\"\n . f s value=$o(^%zewdSession(\"session\",sessid,\"ewd_selected\",name,value)) q:value=\"\" d\n . . s no=no+1\n . . s nvArray(name,no)=value\n QUIT\n ;\ngetSessionValuesErr ; --- Come here if error occurred in 'getSessionValues' ---\n set $zt=\"\"\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\ngetSessionValuesByPrefix(prefix,sessid)\n ;\n n len,name\n QUIT:$g(sessid)=\"\"\n QUIT:$g(prefix)=\"\"\n s prefix=$tr(prefix,\".\",\"_\")\n set $zt=\"getSessionValuesByPrefixErr\"\n s len=$l(prefix)\n s name=prefix\n f s name=$o(^%zewdSession(\"session\",sessid,name)) q:name=\"\" q:$e(name,1,len)'=prefix d\n . i name?1A.AN m @name=^%zewdSession(\"session\",sessid,name)\n QUIT\n ;\ngetSessionValuesByPrefixErr\n set $zt=\"\"\n QUIT\n ;\nsetNVArray(name,nvArray,sessid)\n n selected,value,no\n s nvArray(name)=$$getSessionValue(name,sessid)\n QUIT\n ;\nclearSessionByPrefix(prefix,sessid)\n d clearSessionByPrefix^%zewdCompiler20($g(prefix),$g(sessid))\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\n ; HTML Form-specific APIs\n ;\ngetTextValue(fieldName,sessid)\n QUIT $$getSessionValue(fieldName,sessid)\n ;\nsetTextValue(fieldName,value,sessid)\n d setSessionValue(fieldName,value,sessid)\n QUIT\n ;\ngetPasswordValue(fieldName,sessid)\n QUIT $$getSessionValue(fieldName,sessid)\n ;\ngetHiddenValue(fieldName,sessid)\n QUIT $$getSessionValue(fieldName,sessid)\n ;\nsetHiddenValue(fieldName,value,sessid)\n d setSessionValue(fieldName,value,sessid)\n ;\ngetRadioValue(fieldName,sessid)\n QUIT $$getSessionValue(fieldName,sessid)\n ;\nsetRadioOn(fieldName,value,sessid)\n d setSessionValue(fieldName,value,sessid)\n QUIT\n ;\nisRadionOn(fieldName,value,sessid)\n QUIT $$getRadioValue(fieldName,sessid)=value\n ;\nisCheckboxOn(fieldName,value,sessid)\n QUIT $$isSelected(fieldName,value,sessid)\n ;\ngetCheckboxValues(fieldName,selectedValueArray,sessid)\n d mergeFromSelected(fieldName,.selectedValueArray,sessid)\n QUIT\n ;\ninitialiseCheckbox(fieldName,sessid)\n d clearSelected(fieldName,sessid)\n QUIT\n ;\nsetCheckboxOn(fieldName,value,sessid)\n d addToSelected(fieldName,value,sessid)\n QUIT\n ;\nsetCheckboxOff(fieldName,value,sessid)\n d removeFromSelected(fieldName,value,sessid)\n ;\nsetCheckboxValues(fieldName,selectedValueArray,sessid)\n ;\n ; array format : array(checkboxValue)=checkboxValue\n ; eg selected(\"red\")=\"red\"\n ;\n d mergeToSelected(fieldName,.selectedValueArray,sessid)\n QUIT\n ;\ngetSelectValue(fieldName,sessid,nullify)\n ;\n n value\n ;\n s value=$$getSessionValue(fieldName,sessid)\n i $a(value)=160 s value=\"\"\n QUIT value\n ;\nsetSelectValue(fieldName,value,sessid)\n d setSessionValue(fieldName,value,sessid)\n ;\nisSelectOn(fieldName,value,sessid)\n QUIT $$getSelectValue(fieldName,sessid)=value\n ;\nisMultipleSelectOn(fieldName,value,sessid)\n QUIT $$isSelected(fieldName,value,sessid)\n ;\ngetMultipleSelectValues(fieldName,selectedValueArray,sessid)\n n value\n d mergeFromSelected(fieldName,.selectedValueArray,sessid)\n s value=$$getSessionValue^%zewdAPI(fieldName,sessid)\n i value'=\"\" s selectedValueArray(value)=value\n QUIT\n ;\ninitialiseMultipleSelect(fieldName,sessid)\n d clearSelected(fieldName,sessid)\n QUIT\n ;\nsetMultipleSelectOn(fieldName,value,sessid)\n d addToSelected(fieldName,value,sessid)\n QUIT\n ;\nsetMultipleSelectOff(fieldName,value,sessid)\n d removeFromSelected(fieldName,value,sessid)\n ;\nsetMultipleSelectValues(fieldName,selectedValueArray,sessid)\n ;\n ; array format : array(checkboxValue)=checkboxValue\n ; eg selected(\"red\")=\"red\"\n ;\n d mergeToSelected(fieldName,.selectedValueArray,sessid)\n QUIT\n ;\ngetTextArea(fieldName,textArray,sessid)\n d mergeFromTextArea(fieldName,.textArray,sessid)\n QUIT\n ;\nsetFieldError(fieldName,sessid)\n ;\n n errors\n s errors(fieldName)=$$getSessionValue(\"ewd_errorClass\",sessid)\n d mergeArrayToSession^%zewdAPI(.errors,\"ewd_errorFields\",sessid)\n d setSessionValue^%zewdAPI(\"ewd_hasErrors\",1,sessid)\n QUIT\n ;\nsetErrorClasses()\n QUIT $$setErrorClasses^%zewdUtilities()\n ;\ngetRequestValue(fieldName,sessid)\n n value,zt\n i $g(fieldName)=\"\" QUIT \"\"\n s value=$g(requestArray(fieldName))\n QUIT value\n ;\nmergeGlobalFromRequest(globalName,fieldName,sessid)\n d mergeGlobalFromRequest^%zewdCompiler13($g(globalName),$g(fieldName),$g(sessid))\n QUIT\n ;\nmergeFromRequest(array,fieldName,sessid)\n QUIT:fieldName=\"\"\n m array=requestArray(fieldName)\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\ncopyRequestValueToSession(fieldName,sessid)\n ;\n QUIT:$g(sessid)=\"\"\n QUIT:$g(fieldName)=\"\"\n i $$isTemp(fieldName) m zewdSession(fieldName)=requestArray(fieldName)\n m ^%zewdSession(\"session\",sessid,fieldName)=requestArray(fieldName)\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\ngetCookieValue(cookieName,sessid)\n QUIT:$g(cookieName)=\"\"\n set $zt=\"getCookieValueErr\"\n QUIT $g(requestArray(cookieName))\n ;\ngetCookieValueErr ; --- Come here if error occurred in 'getCookieValue' ---\n set $zt=\"\"\n QUIT \"\"\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\ndeleteCookie(cookieName,sessid)\n d setCookieValue(cookieName,\"\",-3600,sessid)\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nenableGetPage(page,sessid)\n d enableGetPage^%zewdCompiler24($g(page),$g(sessid))\n QUIT\n ;\ndisableGetPage(page,sessid)\n d disableGetPage^%zewdCompiler24($g(page),$g(sessid))\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nconvertDaysToSeconds(days)\n QUIT days*86400\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nparseHTMLFile(filepath,docName)\n QUIT $$parseHTMLFile^%zewdCompiler16($g(filepath),$g(docName))\n ;\nparseXMLFile(filepath,docName)\n QUIT $$parseXMLFile^%zewdCompiler16($g(filepath),$g(docName))\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nparseStream(streamName,docName,error,isHTML)\n d parseStream^%zewdCompiler16($g(streamName),$g(docName),.error,$g(isHTML))\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nparseHTMLStream(streamName,docName)\n QUIT $$parseHTMLStream^%zewdCompiler16($g(streamName),$g(docName))\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nparseURL(server,getPath,docName,port,isHTML,responseTime,browserType,post,maxLineLength,headers)\n ;\n QUIT $$parseURL^%zewdHTMLParser($g(server),$g(getPath),$g(docName),$g(port),$g(isHTML),.responseTime,$g(browserType),$g(post),$g(maxLineLength),.headers)\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nsetCookieValue(cookieName,value,expiryDuration,sessid)\n ;\n ; expiryDuration is no of seconds\n ;\n n expires\n s expires=expiryDuration\n i $$isCSP(sessid) d\n . s expires=$$convertDateToSeconds($h)+expires\n . s expires=$$convertSecondsToDate(expires)\n . s expires=$$inetDate(expires)\n s value=value_$c(1)_expires\n d setSessionArray(\"ewd_cookie\",cookieName,value,sessid)\n ;\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nsetResponseHeader(headerName,headerValue,sessid)\n d setSessionArray^%zewdAPI(\"ewd_header\",$g(headerName),$g(headerValue),$g(sessid))\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nsuppressResponseHeader(headerName,sessid)\n i $$isCSP(sessid) d setResponseHeader(headerName,\"\",sessid)\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\naddServerToSession(sessid,serverArray)\n d addServerToSession^%zewdCompiler13($g(sessid),.serverArray)\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\ngetServerValue(serverFieldName,sessid)\n ;\n n value,zt\n ;\n i $g(serverFieldName)=\"\" QUIT \"\"\n ;\n QUIT $g(serverArray(serverFieldName))\n ;\ngetServerValueErr ; --- Come here if error occurred in 'getServerValue' ---\n set $zt=zt\n QUIT \"\"\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\ndeleteWarning(sessid)\n QUIT:$g(sessid)=\"\"\n d deleteFromSession(\"ewd_warning\",sessid)\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nsetWarning(warningMessage,sessid)\n QUIT:$g(sessid)=\"\"\n QUIT:$g(warningMessage)=\"\"\n s warningMessage=$$systemMessage(warningMessage,\"warning\",sessid)\n i '$$isCSP(sessid) s warningMessage=$$zcvt(warningMessage,\"o\",\"JS\")\n d setSessionValue(\"ewd_warning\",warningMessage,sessid)\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nclearAllSelected(sessid)\n k ^%zewdSession(\"session\",sessid,\"ewd_selected\")\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nclearSelected(fieldName,sessid)\n QUIT:$g(fieldName)=\"\"\n QUIT:$g(sessid)=\"\"\n s fieldName=$tr(fieldName,\".\",\"_\")\n k ^%zewdSession(\"session\",sessid,\"ewd_selected\",fieldName)\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\naddToSelected(fieldName,fieldValue,sessid)\n ;\n n shortFieldValue\n QUIT:$g(fieldName)=\"\"\n QUIT:$g(sessid)=\"\"\n QUIT:$g(fieldValue)=\"\"\n s fieldName=$tr(fieldName,\".\",\"_\")\n s shortFieldValue=$e(fieldValue,1,200)\n s ^%zewdSession(\"session\",sessid,\"ewd_selected\",fieldName,shortFieldValue)=fieldValue\n QUIT\n ;\nremoveFromSelected(fieldName,fieldValue,sessid)\n ;\n n shortFieldValue\n QUIT:$g(fieldName)=\"\"\n QUIT:$g(sessid)=\"\"\n QUIT:$g(fieldValue)=\"\"\n s fieldName=$tr(fieldName,\".\",\"_\")\n s shortFieldValue=$e(fieldValue,1,200)\n k ^%zewdSession(\"session\",sessid,\"ewd_selected\",fieldName,shortFieldValue)\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nmergeFromSelected(fieldName,selected,sessid)\n ;\n k selected\n s fieldName=$tr(fieldName,\".\",\"_\")\n m selected=^%zewdSession(\"session\",sessid,\"ewd_selected\",fieldName)\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nmergeToSelected(fieldName,selected,sessid)\n ;\n s fieldName=$tr(fieldName,\".\",\"_\")\n ;\n k ^%zewdSession(\"session\",sessid,\"ewd_selected\",fieldName)\n m ^%zewdSession(\"session\",sessid,\"ewd_selected\",fieldName)=selected\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nisSelected(fieldName,fieldValue,sessid)\n n shortFieldValue\n i $g(fieldName)=\"\" QUIT 0\n i $g(sessid)=\"\" QUIT 0\n i $g(fieldValue)=\"\" QUIT 0\n s fieldName=$tr(fieldName,\".\",\"_\")\n set $zt=\"isSelectedErr\"\n s shortFieldValue=$e(fieldValue,1,200)\n QUIT $d(^%zewdSession(\"session\",sessid,\"ewd_selected\",fieldName,shortFieldValue))\n ;\nisSelectedErr ; --- Come here if error occurred in 'isSelected' ---\n set $zt=\"\"\n QUIT 0\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nclearTextArea(fieldName,sessid)\n QUIT:$g(fieldName)=\"\"\n QUIT:$g(sessid)=\"\"\n s fieldName=$tr(fieldName,\".\",\"_\")\n k ^%zewdSession(\"session\",sessid,\"ewd_textarea\",fieldName)\n s ^%zewdSession(\"session\",sessid,\"ewd_textarea\",fieldName,1)=\"\"\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\ncreateTextArea(fieldName,textArray,sessid)\n ;\n QUIT:$g(fieldName)=\"\"\n QUIT:$g(sessid)=\"\"\n s fieldName=$tr(fieldName,\".\",\"_\")\n m ^%zewdSession(\"session\",sessid,\"ewd_textarea\",fieldName)=textArray\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nmergeTextAreaFromRequest(fieldName,requestArray,sessid)\n ;\n q:$g(sessid)=\"\"\n s fieldName=$tr(fieldName,\".\",\"_\")\n ;\n q:'$d(^%zewdSession(\"session\",sessid,\"ewd_textarea\",fieldName))\n d clearTextArea(fieldName,sessid)\n m ^%zewdSession(\"session\",sessid,\"ewd_textarea\",fieldName)=requestArray(fieldName)\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nappendToTextArea(fieldName,lineOfText,sessid)\n ;\n n position\n ;\n QUIT:$g(fieldName)=\"\"\n QUIT:$g(sessid)=\"\"\n s fieldName=$tr(fieldName,\".\",\"_\")\n ;\n s position=$o(^%zewdSession(\"session\",sessid,\"ewd_textarea\",fieldName,\"\"),-1)+1\n s ^%zewdSession(\"session\",sessid,\"ewd_textarea\",fieldName,position)=lineOfText \n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nmergeFromTextArea(fieldName,textArray,sessid)\n ;\n s fieldName=$tr(fieldName,\".\",\"_\")\n m textArray=^%zewdSession(\"session\",sessid,\"ewd_textarea\",fieldName)\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nmergeToTextArea(fieldName,textArray,sessid)\n ;\n s fieldName=$tr(fieldName,\".\",\"_\")\n m ^%zewdSession(\"session\",sessid,\"ewd_textarea\",fieldName)=textArray\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nclearList(listName,sessid)\n QUIT:$g(listName)=\"\"\n QUIT:$g(sessid)=\"\"\n s listName=$tr(listName,\".\",\"_\")\n k ^%zewdSession(\"session\",sessid,\"ewd_list\",listName)\n k ^%zewdSession(\"session\",sessid,\"ewd_listIndex\",listName)\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nisListDefined(listName,sessid)\n QUIT $d(^%zewdSession(\"session\",sessid,\"ewd_list\",listName))\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\ncountList(listName,sessid)\n QUIT $$countList^%zewdCompiler16($g(listName),$g(sessid))\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nappendToList(listName,textValue,codeValue,sessid,otherAttrs)\n ;\n n position\n ;\n QUIT:$g(listName)=\"\"\n QUIT:$g(sessid)=\"\"\n ;QUIT:$g(textValue)=\"\"\n ;QUIT:$g(codeValue)=\"\"\n s listName=$tr(listName,\".\",\"_\")\n ;\n s position=$o(^%zewdSession(\"session\",sessid,\"ewd_list\",listName,\"\"),-1)+1\n d addToList(listName,textValue,codeValue,position,sessid,.otherAttrs)\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\naddToList(listName,textValue,codeValue,position,sessid,otherAttrs)\n ;d addToList^%zewdCompiler16($g(listName),$g(textValue),$g(codeValue),$g(position),$g(sessid),.otherAttrs)\n ;\n n attrList,attrName\n ;\n QUIT:$g(listName)=\"\"\n QUIT:$g(sessid)=\"\"\n QUIT:$g(position)=\"\"\n i $g(codeValue)=\"\",$g(textValue)=\"\" QUIT\n s position=+position\n d removeFromList(listName,codeValue,sessid) ; just in case\n s attrName=\"\",attrList=\"\"\n f s attrName=$o(otherAttrs(attrName)) q:attrName=\"\" d\n . s attrList=attrList_attrName_$c(3)_otherAttrs(attrName)_$c(1)\n ;\n s codeValue=$g(codeValue) i codeValue=\"\" s codeValue=textValue\n s ^%zewdSession(\"session\",sessid,\"ewd_list\",listName,position)=textValue_$c(1)_codeValue_$c(1)_attrList\n s ^%zewdSession(\"session\",sessid,\"ewd_listIndex\",listName,codeValue)=position\n k otherAttrs\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nmergeToList(listName,listArray,sessid)\n ;\n d mergeToList^%zewdCompiler7(listName,.listArray,sessid)\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nremoveFromList(listName,codeValue,sessid)\n d removeFromList^%zewdCompiler20($g(listName),$g(codeValue),$g(sessid))\n QUIT\n ;\ncopyList(fromListName,toListName,sessid)\n d copyList^%zewdCompiler7($g(fromListName),$g(toListName),$g(sessid))\n QUIT\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\ngetTextFromList(listName,codeValue,sessid)\n ;\n QUIT $$getTextFromList^%zewdCompiler7(listName,codeValue,sessid)\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nreplaceOptionsByFieldName(formName,fieldName,listName,sessid)\n ;\n QUIT $$replaceOptionsByFieldName^%zewdCompiler7(formName,fieldName,listName,sessid)\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\nreplaceOptionsByID(fieldID,listName,sessid)\n ;\n QUIT $$replaceOptionsByID^%zewdCompiler7(fieldID,listName,sessid)\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\ngetUploadedFileName(fieldName,sessid)\n QUIT $$getUploadedFileName^%zewdCompiler20($g(fieldName),$g(sessid))\n ;\ngetUploadedFileSize(fieldName,sessid)\n QUIT $$getUploadedFileSize^%zewdCompiler20($g(fieldName),$g(sessid))\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\ngetUploadedFileType(fieldName,sessid)\n ;\n set $zt=\"getUploadedFileTypeErr\"\n QUIT 0\n ;\ngetUploadedFileTypeErr\n set $zt=\"\"\n QUIT \"\"\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nerrorOccurred(sessid)\n ;\n n warning\n ;\n i $g(Error)=\"\" QUIT 0\n s warning=$$getSessionValue(\"ewd_warning\",sessid)\n QUIT Error'=warning\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nremoveQuotes(string)\n ;\n n quoted,c1,quote\n s quote=\"\"\n s c1=$e(string,1)\n s quoted=0\n i c1=\"\"\"\"!(c1=\"'\") s quoted=1,quote=c1\n i 'quoted QUIT string\n i $e(string,$l(string))'=quote QUIT string\n QUIT $e(string,2,$l(string)-1)\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nescapeQuotes(text)\n ;\n s text=$$replaceAll(text,\"'\",$c(4))\n s text=$$replaceAll(text,$c(4),\"\\'\")\n s text=$$replaceAll(text,\"\"\"\",$c(4))\n s text=$$replaceAll(text,$c(4),\"\\\"\"\")\n ;\n QUIT text\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\ngetAttrValue(attrName,attrValues,technology)\n QUIT $$getAttrValue^%zewdCompiler4(attrName,.attrValues,technology)\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\nreplaceAll(InText,FromStr,ToStr) ; Replace all occurrences of a substring\n ;\n n %p\n ;\n s %p=InText\n i ToStr[FromStr d QUIT %p\n . n i,stop,tempText,tempTo\n . s stop=0\n . f i=0:1:255 d q:stop\n . . q:InText[$c(i)\n . . q:FromStr[$c(i)\n . . q:ToStr[$c(i)\n . . s stop=1\n . s tempTo=$c(i)\n . s tempText=$$replaceAll(InText,FromStr,tempTo)\n . s %p=$$replaceAll(tempText,tempTo,ToStr)\n f q:%p'[FromStr S %p=$$replace(%p,FromStr,ToStr)\n QUIT %p\n ;\nreplace(InText,FromStr,ToStr) ; replace old with new in string\n ;\n n %np,%p1,%p2\n ;\n i InText'[FromStr q InText\n s %np=$l(InText,FromStr)+1\n s %p1=$p(InText,FromStr,1),%p2=$p(InText,FromStr,2,%np)\n QUIT %p1_ToStr_%p2\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\naddImmediateOneOffTask(executeCode,startTime,namespace,rc,rm)\n QUIT $$addImmediateOneOffTask^%zewdScheduler($g(executeCode),$g(startTime),$g(namespace),.rc,.rm)\n ;\n ;-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=\n ;\ngetDataTypeErrors(errorArray,sessid)\n k errorArray\n d mergeArrayFromSession(.errorArray,\"ewd_DataTypeError\",sessid)\n QUIT\n ;\nclearSchemaFormErrors(sessid)\n d deleteFromSession(\"ewd_SchemaFormError\",sessid)\n QUIT\n ;\ngetSchemaFormErrors(errorArray,sessid)\n QUIT $$getSchemaFormErrors^%zewdCompiler13(.errorArray,$g(sessid))\n ;\nsetSchemaFormErrors(errorArray,sessid)\n ;\n n sessionName\n ;\n s sessionName=\"ewd_SchemaFormError\"\n d deleteFromSession(sessionName,sessid)\n d mergeArrayToSession(.errorArray,sessionName,sessid)\n QUIT\n ;\nremoveInstanceDocument(instanceName)\n ;\n n ok\n s ok=$$openDOM\n i ok'=\"\" QUIT ok \n s ok=$$removeDocument^%zewdDOM(instanceName,\"\",\"\")\n d clearXMLIndex^%zewdSchemaForm(instanceName)\n s ok=$$closeDOM^%zewdDOM()\n QUIT \"\"\n ;\n ;\nmakeTokenString(length)\n ;\n n string,token,i\n ;\n s string=\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz1234567890\"\n s token=\"\"\n f i=1:1:length s token=token_$e(string,($r($l(string))+1))\n QUIT token\n ;\nmakeString(%char,%len) ; create a string of len characters\n ;\n n %str\n ;\n s %str=\"\",$p(%str,%char,%len+1)=\"\"\n QUIT %str\n ;\nconvertDateToSeconds(hdate)\n ;\n Q (hdate*86400)+$p(hdate,\",\",2)\n ;\nconvertSecondsToDate(secs)\n ;\n QUIT (secs\\86400)_\",\"_(secs#86400)\n ;\ngetTokenExpiry(token)\n ;\n n sessid\n ;\n i $g(token)=\"\" QUIT 0\n s sessid=$p($g(^%zewdSession(\"tokens\",token)),\"~\",1)\n i sessid=\"\" QUIT 0\n QUIT $$getSessionValue(\"ewd_sessionExpiry\",sessid)\n ;\nisTokenExpired(token)\n ;\n ;QUIT $$getTokenExpiry(token)'>$$convertDateToSeconds($h)\n QUIT $$getTokenExpiry(token)'>(($h*86400)+$p($h,\",\",2))\n ;\nrandChar()\n ;\n n string\n ;\n s string=\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz1234567890\"\n QUIT $e(string,($R($l(string))+1))\n ;\nlowerCase(string)\n QUIT $tr(string,\"ABCDEFGHIJKLMNOPQRSTUVQXYZ\",\"abcdefghijklmnopqrstuvwxyz\")\n ;\nstripSpaces(string)\n s string=$$stripLeadingSpaces(string)\n QUIT $$stripTrailingSpaces(string)\n ;\nstripLeadingSpaces(string)\n n i\n ;\n f i=1:1:$l(string) QUIT:$e(string,i)'=\" \"\n QUIT $e(string,i,$l(string))\n ;\nstripTrailingSpaces(string)\n n i,spaces,new\n ;\n s spaces=$$makeString(\" \",100)\n s new=string_spaces\n QUIT $p(new,spaces,1)\n ;\nparseMethod(methodString,class,method)\n ;\n n %p1,%p2,meth\n ;\n s %p1=$p(methodString,\"##class(\",2)\n s class=$p(%p1,\")\",1)\n s %p2=$p(%p1,\")\",2,500)\n s method=$p(%p2,\".\",2)\n s method=$p(method,\"(\",1)\n QUIT\n ;\nevent(requestArray)\n QUIT $$event^%zewdPHP(.requestArray)\n ;\nclearURLNVP(urlNo)\n ;\n QUIT\n ;\nsetURLNVP(urlNo,name)\n ;\n QUIT\n ;\ndecodeDataType(name,dataType,sessid)\n d decodeDataType^%zewdCompiler20($g(name),$g(dataType),$g(sessid))\n QUIT\n ;\nencodeDataType(name,dataType,sessid)\n QUIT $$encodeDataType^%zewdCompiler13($g(name),$g(dataType),$g(sessid))\n ;\ncopyURLNVPsToSession(urlNo)\n ;\n n name\n ;\n QUIT\n ;\ndoubleQuotes(string)\n ;\n s string=$$replaceAll(string,\"\"\"\",$c(1,1))\n s string=$tr(string,$c(1),\"\"\"\")\n QUIT string\n ;\n ; ==========================================================================\n ; Error Trap Functions\n ; ==========================================================================\n ;\ncopySessionToSymbolTable(sessid)\n d copySessionToSymbolTable^%zewdCompiler16($g(sessid))\n QUIT\n ;\nsaveSymbolTable(sessid)\n ;\n n ok\n ;s sessid=0\n k ^%zewdError(sessid)\n n %zzv\n k ^%zewdError(sessid)\n s %zzv=\"%\"\n f s %zzv=$o(@%zzv) Q:%zzv=\"\" m ^%zewdError(sessid,%zzv)=@%zzv\n QUIT\n ;\nloadErrorSymbols(sessid)\n d loadErrorSymbols^%zewdCompiler19($g(sessid))\n QUIT\n ;\ndeleteErrorLog(sessid)\n k ^%zewdError(sessid)\n QUIT\n ;\ndeleteAllErrorLogs\n k ^%zewdError\n QUIT\n ;\nfileSize(path)\n QUIT $$fileSize^%zewdCompiler13($g(path))\n ;\nfileExists(path)\n QUIT $$fileExists^%zewdCompiler13($g(path))\n ;\nfileInfo(path,info)\n d fileInfo^%zewdCompiler13($g(path),.info)\n QUIT\n ;\ndirectoryExists(path)\n QUIT $$directoryExists^%zewdCompiler13($g(path))\n ;\ndeleteFile(filepath)\n QUIT $$deleteFile^%zewdCompiler13($g(filepath))\n ;\nrenameFile(filepath,newpath)\n QUIT $$renameFile^%zewdCompiler13($g(filepath),$g(newpath))\n ;\ncreateDirectory(path)\n QUIT $$createDirectory^%zewdCompiler13($g(path))\n ;\nremoveCR(string)\n i $e(string,$l(string))=$c(13) s string=$e(string,1,$l(string)-1)\n QUIT string\n ;\nsetApplicationRootPath(path)\n d setApplicationRootPath^%zewdCompiler(path)\n QUIT\n ;\napplicationRootPath()\n QUIT $$applicationRootPath^%zewdCompiler()\n ;\ngetApplicationRootPath()\n QUIT $$getApplicationRootPath^%zewdCompiler()\n ;\nsetOutputRootPath(path,technology)\n d setOutputRootPath^%zewdCompiler(path,technology)\n QUIT\n ;\ngetRootURL(technology)\n QUIT $$getRootURL^%zewdCompiler(technology)\n ;\nsetRootURL(cspURL,technology)\n d setRootURL^%zewdCompiler(cspURL,technology)\n QUIT\n ;\ngetDefaultTechnology()\n QUIT $$getDefaultTechnology^%zewdCompiler()\n ;\ngetDefaultMultiLingual()\n QUIT $$getDefaultMultiLingual^%zewdCompiler()\n ;\ngetOutputRootPath(technology)\n QUIT $$getOutputRootPath^%zewdCompiler(technology)\n ;\ngetJSScriptsPath(app,technology)\n QUIT $$getJSScriptsPath^%zewdCompiler8(app,technology)\n ;\ngetJSScriptsPathMode(technology)\n QUIT $$getJSScriptsPathMode^%zewdCompiler8(technology)\n\t;\nsetJSScriptsPathMode(technology,mode)\n d setJSScriptsPathMode^%zewdCompiler8(technology,mode)\n QUIT\n\t;\ngetJSScriptsRootPath(technology)\n QUIT $$getJSScriptsRootPath^%zewdCompiler8(technology)\n\t;\nsetJSScriptsRootPath(technology,path)\n d setJSScriptsRootPath^%zewdCompiler8(technology,path)\n QUIT\n ;\ngetHomePage()\n QUIT $$getHomePage^%zewdCompiler()\n ;\nsetHomePage(homePage)\n d setHomePage^%zewdCompiler($g(homePage))\n QUIT\n ;\ngetApplications(appList)\n QUIT $$getApplications^%zewdCompiler16(.appList)\n ;\ngetPages(application,pageList)\n QUIT $$getPages^%zewdCompiler16($g(application),.pageList)\n ;\ngetDefaultFormat()\n QUIT $$getDefaultFormat^%zewdCompiler()\n ;\ngetNextChild(parentOID,childOID)\n i $g(parentOID)=\"\" QUIT \"\"\n i childOID=\"\" QUIT $$getFirstChild^%zewdDOM(parentOID)\n QUIT $$getNextSibling^%zewdDOM(childOID)\n ;\naddCSPServerScript(parentOID,text,atTop)\n QUIT $$addCSPServerScript^%zewdCompiler4(parentOID,text,$g(atTop))\n ;\ncreatePHPCommand(data,docOID)\n QUIT $$createPHPCommand^%zewdCompiler4(data,docOID)\n ;\ncreateJSPCommand(data,docOID)\n QUIT $$createJSPCommand^%zewdCompiler4(data,docOID)\n ;\ninstantiateJSPVar(var,type,docOID,arraySize,initialValue)\n d instantiateJSPVar^%zewdCompiler4(var,type,docOID,arraySize,initialValue)\n QUIT\n ;\nremoveIntermediateNode(inOID)\n d removeIntermediateNode^%zewdCompiler4(inOID)\n QUIT\n ;\ngetNormalisedAttributeValue(attrName,nodeOID,technology)\n QUIT $$getNormalAttributeValue^%zewdCompiler($g(attrName),$g(nodeOID),$g(technology))\n ;\ngetNormalAttributeValue(attrName,nodeOID,technology)\n QUIT $$getNormalAttributeValue^%zewdCompiler($g(attrName),$g(nodeOID),$g(technology))\n ;\ngetTagOID(tagName,docName,lowerCase)\n QUIT $$getTagOID^%zewdCompiler($g(tagName),$g(docName),$g(lowerCase))\n ;\ngetTagByNameAndAttr(tagName,attrName,attrValue,matchCase,docName)\n QUIT $$getTagByNameAndAttr^%zewdCompiler3($g(tagName),$g(attrName),$g(attrValue),$g(matchCase),$g(docName))\n ;\njavascriptFunctionExists(functionName,docName)\n QUIT $$javascriptFunctionExists^%zewdCompiler7($g(functionName),$g(docName))\n ;\naddJavascriptFunction(docName,jsTextArray)\n QUIT $$addJavascriptFunction^%zewdCompiler7($g(docName),.jsTextArray)\n ;\ngetJavascriptFunctionBody(functionName,docName)\n QUIT $$getJavascriptFunctionBody^%zewdCompiler7($g(functionName),docName)\n ;\nreplaceJavascriptFunctionBody(functionName,jsText,docName)\n QUIT $$replaceJavascriptFunctionBody^%zewdCompiler7($g(functionName),$g(jsText),$g(docName))\n ;\ngetDelim()\n QUIT $$getDelim^%zewdCompiler()\n ;\nsetJSONPage(sessid)\n QUIT $$setJSONPage^%zewdCompiler20($g(sessid))\n ; ===========================================================================\n ; WLD conversion utilities\n ; ===========================================================================\n ;\nconfigureWebLink(webserver,mode,alias,path)\n QUIT $$configure^%zewdWLD($g(webserver),$g(mode),$g(alias),$g(path))\n ;\nmergeListToSession(fieldName,sessid)\n d mergeListToSession^%zewdCompiler16($g(fieldName),$g(sessid))\n QUIT\n ;\ngetPREVPAGE(sessid) ;\n QUIT $$getPREVPAGE^%zewdCompiler19($g(sessid)) ;\n ;\ncopyToWLDSymbolTable(sessid)\n d copyToWLDSymbolTable^%zewdCompiler16($g(sessid))\n ;\ngetPRESSED(sessid)\n QUIT $$getSessionValue(\"ewd_pressed\",sessid)\n ;\ncopyToLIST(listName,sessid)\n ;\n k LIST(listName)\n m LIST(listName)=^%zewdSession(\"session\",sessid,\"ewd_list\",listName)\n QUIT\n ;\ncopyToSELECTED(fieldName,sessid)\n ;\n k SELECTED(fieldName)\n m SELECTED(fieldName)=^%zewdSession(\"session\",sessid,\"ewd_selected\",fieldName)\n QUIT\n ;\ntraceModeOn\n s ^zewd(\"trace\")=1\n QUIT\n ;\ntraceModeOff\n k ^zewd(\"trace\")\n QUIT\n ;\ngetTraceMode()\n i $g(^zewd(\"trace\"))=1 QUIT 1\n QUIT 0\n ;\ntrace(text,clear) ; trace ;\n n i\n s text=$g(text)\n i $g(clear)=1 k ^%zewdTrace\n s i=$increment(^%zewdTrace)\n s ^%zewdTrace(i)=text\n QUIT\n ;\ninetDate(hdate) ; Decode $H date and time to Internet format\n ;\n N %d,%day,%time,%date\n ;\n S %time=$P(hdate,\",\",2)\n I %time>86400 D\n .S %time=%time-86400\n .S hdate=(hdate+1)_\",\"_%time\n ;\n S %d=\"Thu,Fri,Sat,Sun,Mon,Tue,Wed\"\n S %day=(hdate#7)+1\n S %day=$P(%d,\",\",%day)\n ;\n S %date=$$decDate(hdate)\n ;S %date=$TR(%date,\" \",\"-\")\n S %time=$$inetTime(hdate)\n S %date=%day_\", \"_%date_\" \"_%time\n Q %date\ndecDate(hdate) ; Decode a date from $H format\n ;\n n %yy,%mm,%dd,%d1,%d\n i $zv'[\"GT.M\" d\n . s %d1=$zd(hdate,5)\n . s %yy=$p(%d1,\", \",2)\n . s %dd=+$p(%d1,\" \",2) I %dd<10 S %dd=\"0\"_%dd\n . s %mm=$p(%d1,\" \",1)\n e d\n . n p1,p2\n . s %d1=$zd(hdate,2) \n . s %dd=$p(%d1,\"-\",1)\n . s %mm=$p(%d1,\"-\",2)\n . s p1=$e(%mm,1),p2=$e(%mm,2,$l(%mm))\n . s %mm=p1_$$lowerCase(p2)\n . s %yy=$p(%d1,\"-\",3)\n . i hdate>58073 s %yy=\"20\"_%yy\n s %d=%dd_\" \"_%mm_\" \"_%yy\n QUIT %d\n ;\ninetTime(hdate) ; Decode Internet Format Time from $H format\n ; Offset is relative to GMT, eg -0500\n ;\n n hh,mm,ss,time\n s time=$p(hdate,\",\",2)\n s hh=time\\3600 i hh<10 s hh=\"0\"_hh\n s time=time#3600\n s mm=time\\60 i mm<10 s mm=\"0\"_mm\n s ss=time#60 i ss<10 s ss=\"0\"_ss\n QUIT hh_\":\"_mm_\":\"_ss\n ;\nopenNewFile(filepath)\n QUIT $$openNewFile^%zewdCompiler($g(filepath))\n ;\nopenFile(filepath)\n QUIT $$openFile^%zewdCompiler($g(filepath))\n ;\nopenDOM()\n ;\n n i,ok\n ;\n f i=1:1:20 s ok=$$openDOM^%zewdDOM(0,,,,,,,,,,,,,,,,,) q:$$zcvt(ok,\"l\")[\"licensing violation\" q:ok=\"\" h 1\n i ok'=\"\" s ok=\"No eXtc Licenses available!\"\n QUIT ok\n ;\nremoveChild(nodeOID,removeFromDOM)\n ;\n n ver\n ;\n s ver=\"\" \n QUIT $$removeChild^%zewdDOM(nodeOID,$g(removeFromDOM))\n ;\nremoveAttribute(attrName,nodeOID,removeFromDOM)\n ;\n n ver\n ;\n s ver=\"\" \n d removeAttribute^%zewdDOM(attrName,nodeOID,$g(removeFromDOM)) QUIT\n ;\nremoveAttributeNS(ns,attrName,nodeOID,removeFromDOM)\n ;\n n ver\n ;\n s ver=\"\" \n d removeAttributeNS^%zewdDOM(ns,attrName,nodeOID,$g(removeFromDOM)) QUIT\n ;\nremoveIntermediateNodeeXtc(nodeOID,removeFromDOM)\n ;\n n ver\n ;\n d removeIntermediateNode^%zewdDOM(nodeOID,$g(removeFromDOM))\n QUIT\n ;\nexport(fileName,prefix,extension)\n d export^%zewdCompiler16($g(fileName),$g(prefix),$g(extension))\n QUIT\n ;\nimport(fileName)\n ;\n i $g(fileName)=\"\" s fileName=\"zewd.xml\"\n QUIT\n ;\nlistDOMsByPrefix(prefix)\n\td listDOMsByPrefix^%zewdCompiler19($g(prefix))\n\tQUIT\n ;\nremoveDOMsByPrefix(prefix)\n\td removeDOMsByPrefix^%zewdCompiler19($g(prefix))\n\tQUIT\n\t;\ndumpDOM(docName)\n ;\n d dumpDOM^%zewdCompiler20($g(docName))\n QUIT\n ;\nnamespace()\n QUIT $zdir\n ;\nsetNamespace(namespace)\n s $zdir=namespace\n QUIT\n ;\nzcvt(string,param,param2)\n ;\n i $g(param)=\"\" s param=\"l\"\n i param=\"l\"!(param=\"L\") QUIT $tr(string,\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\",\"abcdefghijklmnopqrstuvwxyz\")\n i param=\"u\"!(param=\"U\") QUIT $tr(string,\"abcdefghijklmnopqrstuvwxyz\",\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\")\n i param=\"O\",param2=\"HTML\" d QUIT string\n . s string=$$replaceAll^%zewdAPI(string,\"&\",$c(1))\n . s string=$$replaceAll^%zewdAPI(string,\"\"\"\",\""\")\n . s string=$$replaceAll^%zewdAPI(string,\"'\",\"'\")\n . s string=$$replaceAll^%zewdAPI(string,\"<\",\"<\")\n . s string=$$replaceAll^%zewdAPI(string,\">\",\">\")\n . s string=$$replaceAll^%zewdAPI(string,$c(1),\"&\")\n i param=\"I\",param2=\"HTML\" d QUIT string\n . n c,no,no2,p1,p2,p3,stop\n . s string=$$replaceAll^%zewdAPI(string,\""\",\"\"\"\")\n . s string=$$replaceAll^%zewdAPI(string,\"'\",\"'\")\n . s string=$$replaceAll^%zewdAPI(string,\"&\",\"&\")\n . s string=$$replaceAll^%zewdAPI(string,\"<\",\"<\")\n . s string=$$replaceAll^%zewdAPI(string,\">\",\">\")\n . s stop=0\n . f d q:stop\n . . s no=$l(string,\"&#\")\n . . i string'[\"&#\" s stop=1 q\n . . s p1=$p(string,\"&#\",1)\n . . s p2=$p(string,\"&#\",2,no+1)\n . . s no2=$l(p2,\";\")\n . . s p3=$p(p2,\";\",1)\n . . i $l(p3)'=2 s stop=1 q\n . . s p2=$p(p2,\";\",2,no2+1)\n . . s c=$c(p3)\n . . s string=p1_c_p2\n QUIT string\n ;\ngetIP() ; Get own IP address\n QUIT $$getIP^%zewdAPI2()\n ;\najaxErrorRedirect(sessid)\n QUIT $$ajaxErrorRedirect^%zewdAPI2($g(sessid))\n ;\nclassExport(className,methods,filepath)\n ;\n QUIT $$classExport^%zewdCompiler16($g(className),.methods,$g(filepath))\n ;\nstrx(string)\n d strx^%zewdAPI2($g(string))\n QUIT\n ;\ndisableEwdMgr\n s ^%zewd(\"disabled\")=1\n QUIT\n ;\nenableEwdMgr\n k ^%zewd(\"disabled\")\n QUIT\n ;\nenableWLDAccess(app,page)\n i $g(^zewd(\"allowWLDAccess\",$$zcvt(app,\"l\"),$$zcvt(page,\"l\")))'=1 s ^zewd(\"allowWLDAccess\",$$zcvt(app,\"l\"),$$zcvt(page,\"l\"))=1\n QUIT\n ;\ndisableWLDAccess(app,page)\n k ^zewd(\"allowWLDAccess\",$$zcvt(app,\"l\"),$$zcvt(page,\"l\"))\n QUIT\nisSSOValid(sso,username,password,sessid)\n QUIT $$isSSOValid^%zewdMgrAjax2($g(sso),$g(username),$g(password),$g(sessid))\n ;\nuniqueId(nodeOID,filename)\n QUIT $p(filename,\".ewd\",1)_$p(nodeOID,\"-\",2)\n ;\nlinkToParentSession(sessid)\n QUIT $$linkToParentSession^%zewdCompiler20($g(sessid))\n ;\nexportToGTM(routine)\n" }, { "path": "src/test/resources/samples/langs/M/_zewdDemo.m", "content": "%zewdDemo ; Tutorial page functions\n ;\n ; Product: Enterprise Web Developer (Build 910)\n ; Build Date: Wed, 25 Apr 2012 17:59:25\n ;\n ; \n ; ----------------------------------------------------------------------------\n ; | Enterprise Web Developer for GT.M and m_apache |\n ; | Copyright (c) 2004-12 M/Gateway Developments Ltd, |\n ; | Reigate, Surrey UK. |\n ; | All rights reserved. |\n ; | |\n ; | http://www.mgateway.com |\n ; | Email: rtweed@mgateway.com |\n ; | |\n ; | This program is free software: you can redistribute it and/or modify |\n ; | it under the terms of the GNU Affero General Public License as |\n ; | published by the Free Software Foundation, either version 3 of the |\n ; | License, or (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 Affero General Public License for more details. |\n ; | |\n ; | You should have received a copy of the GNU Affero General Public License |\n ; | along with this program. If not, see . |\n ; ----------------------------------------------------------------------------\n ;\ngetLanguage(sessid)\n ;\n s language=$$getRequestValue^%zewdAPI(\"ewd_Language\",sessid)\n d setSessionValue^%zewdAPI(\"ewd_Language\",language,sessid)\n d setSessionValue^%zewdAPI(\"url\",\"www.mgateway.com\",sessid)\n d setSessionValue^%zewdAPI(\"imageTest\",2,sessid)\n d setSessionValue^%zewdAPI(\"tmp_testing\",1234567,sessid)\n QUIT \"\"\n ;\nlogin(sessid)\n ;\n n username,password\n ;\n s username=$$getTextValue^%zewdAPI(\"username\",sessid)\n s password=$$getPasswordValue^%zewdAPI(\"password\",sessid)\n ;d trace^%zewdAPI(\"in login - username=\"_username_\" ; password=\"_password)\n i username'=\"ROB\" QUIT \"invalid username\"\n i password'=\"ROB\" QUIT \"invalid password\"\n QUIT \"\"\n ;\nlogine(sessid)\n ;\n n error,username,password,message,textid\n ;\n s error=\"\"\n s message=$$errorMessage^%zewdAPI(\"invalid login attempt\",sessid)\n s username=$$getTextValue^%zewdAPI(\"username\",sessid)\n s password=$$getPasswordValue^%zewdAPI(\"password\",sessid)\n ;\n i '$d(^ewdDemo(\"tutorial\",\"authentication\")) d QUIT $$errorMessage^%zewdAPI(error,sessid)\n . i username'=\"ROB\" s error=message q\n . i password'=\"ROB\" s error=message q\n ;\n i username=\"\" QUIT message\n i '$d(^ewdDemo(\"tutorial\",\"authentication\",username)) QUIT message\n i password'=$p(^ewdDemo(\"tutorial\",\"authentication\",username),\"~\",1) QUIT message\n QUIT \"\"\n ;\ngetUsernames(sessid) ;\n ;\n n user\n ;\n i '$d(^ewdDemo(\"tutorial\",\"authentication\")) d QUIT \"\"\n . d clearList^%zewdAPI(\"user\",sessid)\n . d appendToList^%zewdAPI(\"user\",\"Select a user..\",\"nul\",sessid)\n . d appendToList^%zewdAPI(\"user\",\"ROB\",\"ROB\",sessid)\n ;\n s user=\"\"\n d clearList^%zewdAPI(\"user\",sessid)\n d appendToList^%zewdAPI(\"user\",\"Select a user..\",\"\",sessid)\n f s user=$o(^ewdDemo(\"tutorial\",\"authentication\",user)) q:user=\"\" d\n . d appendToList^%zewdAPI(\"user\",user,user,sessid)\n ;\n QUIT \"\"\n ;\naddUsername(sessid)\n ;\n n newUsername\n ;\n s newUsername=$$getTextValue^%zewdAPI(\"newUsername\",sessid)\n i newUsername=\"\" QUIT \"You must enter a username\"\n i $d(^ewdDemo(\"tutorial\",\"authentication\",newUsername)) QUIT newUsername_\" already exists\"\n d setTextValue^%zewdAPI(\"user\",newUsername,sessid)\n QUIT \"\"\n ;\ntestValue(sessid)\n ;\n n user,pass\n ;\n s user=$$getSelectValue^%zewdAPI(\"user\",sessid)\n ;d trace^%zewdAPI(\"user=\"_user)\n QUIT \"\"\n ;\ngetPassword(sessid)\n ;\n n user,pass\n ;\n s user=$$getSelectValue^%zewdAPI(\"user\",sessid)\n s pass=$g(^ewdDemo(\"tutorial\",\"authentication\",user))\n s pass=$p(pass,\"~\",1)\n i user=\"ROB\",pass=\"\" s pass=\"ROB\"\n d setTextValue^%zewdAPI(\"pass\",pass,sessid)\n QUIT \"\"\n ;\nsetPassword(sessid)\n ;\n n user,pass\n ;\n s user=$$getSelectValue^%zewdAPI(\"user\",sessid)\n s pass=$$getTextValue^%zewdAPI(\"pass\",sessid)\n i pass=\"\" QUIT \"You must enter a password\"\n s ^ewdDemo(\"tutorial\",\"authentication\",user)=pass\n QUIT \"\"\n ;\ngetObjDetails(sessid)\n i '$$sessionNameExists^%zewdAPI(\"person.username\",sessid) d\n . d setSessionValue^%zewdAPI(\"person.username\",\"Rob\",sessid)\n . d setSessionValue^%zewdAPI(\"person.password\",\"secret!\",sessid)\n . d setSessionValue^%zewdAPI(\"person.userType\",\"g\",sessid)\n . d setCheckboxOn^%zewdAPI(\"person.permissions\",\"w\",sessid)\n . d setCheckboxOn^%zewdAPI(\"person.permissions\",\"e\",sessid)\n . d clearList^%zewdAPI(\"person.language\",sessid)\n . d appendToList^%zewdAPI(\"person.language\",\"English\",\"en\",sessid)\n . d appendToList^%zewdAPI(\"person.language\",\"French\",\"fr\",sessid)\n . d appendToList^%zewdAPI(\"person.language\",\"German\",\"d\",sessid)\n . d appendToList^%zewdAPI(\"person.language\",\"Italian\",\"it\",sessid)\n . d setMultipleSelectOn^%zewdAPI(\"person.language\",\"en\",sessid)\n . d setMultipleSelectOn^%zewdAPI(\"person.language\",\"d\",sessid)\n . d clearTextArea^%zewdAPI(\"person.comments\",sessid)\n . s textarea(1)=\"This is a line of text\"\n . s textarea(2)=\"This is the second line\"\n . d createTextArea^%zewdAPI(\"person.comments\",.textarea,sessid)\n . d setSessionValue^%zewdAPI(\"wld.%KEY.MGWLPN\",\"EXTC\",sessid)\n QUIT \"\"\n ;\nsetObjDetails(sessid)\n QUIT \"\"\n ;\ngetDetails(sessid)\n ;\n n user,pass,data,expireDate,userType,selected,textarea,confirmText\n ;\n ;d trace^%zewdAPI(\"got here!!\")\n s browser=$$getServerValue^%zewdAPI(\"HTTP_USER_AGENT\",sessid)\n d setSessionValue^%zewdAPI(\"browser\",browser,sessid)\n s user=$$getTextValue^%zewdAPI(\"user\",sessid)\n s data=\"\"\n i user'=\"\" s data=$g(^ewdDemo(\"tutorial\",\"authentication\",user))\n ;d trace^%zewdAPI(\"user=\"_user_\" ; data=\"_data)\n s pass=$p(data,\"~\",1)\n i user=\"ROB\",pass=\"\" d QUIT \"\"\n . d setTextValue^%zewdAPI(\"pass\",\"ROB\",sessid)\n . d setRadioOn^%zewdAPI(\"userType\",\"a\",sessid)\n . d initialiseCheckbox^%zewdAPI(\"permissions\",sessid)\n . d setCheckboxOn^%zewdAPI(\"permissions\",\"w\",sessid)\n . d setCheckboxOn^%zewdAPI(\"permissions\",\"e\",sessid)\n . d setCheckboxOn^%zewdAPI(\"permissions\",\"s\",sessid)\n . d createLanguageList(sessid)\n . d setMultipleSelectOn^%zewdAPI(\"language\",\"en\",sessid)\n . d setMultipleSelectOn^%zewdAPI(\"language\",\"d\",sessid)\n . d clearTextArea^%zewdAPI(\"comments\",sessid)\n . s textarea(1)=\"This is a line of text\"\n . s textarea(2)=\"This is the second line\"\n . d createTextArea^%zewdAPI(\"comments\",.textarea,sessid)\n ;\n d setTextValue^%zewdAPI(\"pass\",pass,sessid)\n ;d trace^%zewdAPI(\"data=\"_data)\n s userType=$p(data,\"~\",2)\n i userType=\"\" s userType=\"g\"\n d setRadioOn^%zewdAPI(\"userType\",userType,sessid)\n d initialiseCheckbox^%zewdAPI(\"permissions\",sessid)\n i user'=\"\" m selected=^ewdDemo(\"tutorial\",\"authentication\",user,\"permissions\")\n d setCheckboxValues^%zewdAPI(\"permissions\",.selected,sessid)\n d createLanguageList(sessid)\n k selected\n i user'=\"\" m selected=^ewdDemo(\"tutorial\",\"authentication\",user,\"language\")\n d setMultipleSelectValues^%zewdAPI(\"language\",.selected,sessid)\n d clearTextArea^%zewdAPI(\"comments\",sessid)\n i user'=\"\" m textarea=^ewdDemo(\"tutorial\",\"authentication\",user,\"comments\")\n d createTextArea^%zewdAPI(\"comments\",.textarea,sessid)\n ;\n QUIT \"\"\n ;\ncreateLanguageList(sessid)\n ;\n n attr\n d clearList^%zewdAPI(\"language\",sessid)\n d appendToList^%zewdAPI(\"language\",\"English\",\"en\",sessid)\n s attr(\"style\")=\"color:red\"\n d appendToList^%zewdAPI(\"language\",\"French\",\"fr\",sessid,.attr)\n d appendToList^%zewdAPI(\"language\",\"German\",\"d\",sessid,.attr)\n s attr(\"style\")=\"color:green\"\n d appendToList^%zewdAPI(\"language\",\"Italian\",\"it\",sessid,.attr)\n s attr(\"style\")=\"color:green\"\n d appendToList^%zewdAPI(\"language\",\"Spanish\",\"esp\",sessid,.attr)\n d appendToList^%zewdAPI(\"language\",\"Portuguese\",\"por\",sessid)\n d appendToList^%zewdAPI(\"language\",\"Danish\",\"den\",sessid)\n d appendToList^%zewdAPI(\"language\",\"Swedish\",\"swe\",sessid)\n d appendToList^%zewdAPI(\"language\",\"Norwegian\",\"nor\",sessid)\n d initialiseMultipleSelect^%zewdAPI(\"language\",sessid)\n QUIT\n ;\nsetDetails(sessid)\n ;\n n error,expireDate,user,pass,userType,selected,comments,warning\n ;\n s user=$$getTextValue^%zewdAPI(\"user\",sessid)\n s pass=$$getTextValue^%zewdAPI(\"pass\",sessid)\n i pass=\"\" d QUIT \"You must enter a password\"\n . d setFieldError^%zewdAPI(\"pass\",sessid)\n i pass=\"xxx\" d setFieldError^%zewdAPI(\"testField\",sessid) QUIT \"test error\"\n s userType=$$getRadioValue^%zewdAPI(\"userType\",sessid)\n s ^ewdDemo(\"tutorial\",\"authentication\",user)=pass_\"~\"_userType\n k ^ewdDemo(\"tutorial\",\"authentication\",user,\"permissions\")\n d getCheckboxValues^%zewdAPI(\"permissions\",.selected,sessid)\n m ^ewdDemo(\"tutorial\",\"authentication\",user,\"permissions\")=selected\n k ^ewdDemo(\"tutorial\",\"authentication\",user,\"language\")\n k selected\n d getMultipleSelectValues^%zewdAPI(\"language\",.selected,sessid)\n m ^ewdDemo(\"tutorial\",\"authentication\",user,\"language\")=selected\n k ^ewdDemo(\"tutorial\",\"authentication\",user,\"comments\")\n d getTextArea^%zewdAPI(\"comments\",.comments,sessid)\n m ^ewdDemo(\"tutorial\",\"authentication\",user,\"comments\")=comments\n ;s warning=\"Record successfully updated\"\n ;d setWarning^%zewdAPI(warning,sessid)\n ;\n QUIT \"\"\n ;\ntestAjaxForm(sessid)\n ;\n i $$getRequestValue^%zewdAPI(\"testField1\",sessid)=\"\" d QUIT \"field1 must not be null\"\n . d setFieldError^%zewdAPI(\"testField1\",sessid)\n i $$getRequestValue^%zewdAPI(\"testField2\",sessid)=\"\" d QUIT \"javascript: x=1 ; document.getElementById('testField3').value = x\"\n . d setFieldError^%zewdAPI(\"testField2\",sessid)\n i $$getRequestValue^%zewdAPI(\"testField3\",sessid)=\"\" d QUIT \"field3 must not be null\"\n . d setFieldError^%zewdAPI(\"testField3\",sessid)\n ;\n QUIT \"\"\n ;\ngetVersion() ;\n QUIT $zv\n ;\ngetTime(sessid)\n ;\n d setSessionValue^%zewdAPI(\"dateTime\",$$inetDate^%zewdAPI($h),sessid)\n QUIT \"\"\n ;\n" }, { "path": "src/test/resources/samples/langs/M/arrays.m", "content": "start ; create student data\n set student(\"name\",\"first\")=\"Linus\"\n set student(\"name\",\"last\")=\"Torvalds\"\n set student(\"language\")=\"C\"\n set student(\"classes\",\"monday\")=\"Algebra\"\n set student(\"classes\",\"tuesday\")=\"Geometry\"\n set student(\"classes\",\"wednesday\")=\"English\"\n set student(\"classes\",\"thursday\")=\"French\"\n set student(\"classes\",\"friday\")=\"Jujitsu\"\n zwrite student\n write $order(student)\n\n write !,\"Student array top level\",!\n set x=\"\"\n for do quit:x=\"\"\n . set x=$order(student(x))\n . write x,!\n\n write !,\"Student classes \",!\n set x=\"\"\n for do quit:x=\"\"\n . set x=$order(student(\"classes\",x))\n . write:x'=\"\" x,\" : \",student(\"classes\",x),!\n\n quit\n" }, { "path": "src/test/resources/samples/langs/M/base64.m", "content": "\t;\n\t; This file is part of DataBallet.\n\t; Copyright (C) 2012 Laurent Parenteau \n\t;\n\t; DataBallet is free software: you can redistribute it and/or modify\n\t; it under the terms of the GNU Affero General Public License as\n\t; published by the Free Software Foundation, either version 3 of the\n\t; License, or (at your option) any later version.\n\t;\n\t; DataBallet is distributed in the hope that it will be useful,\n\t; but WITHOUT ANY WARRANTY; without even the implied warranty of\n\t; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\t; GNU Affero General Public License for more details.\n\t;\n\t; You should have received a copy of the GNU Affero General Public License\n\t; along with DataBallet. If not, see .\n\t;\n\nencode(message)\n\t;\n\t; Return base64 with URL and Filename safe alphabet (RFC 4648)\n\t;\n\tnew base64,todrop,i\n\t\n\t; Populate safe alphabet values on first use only.\n\tif '$data(base64safe) do\n\t.\tfor i=0:1:25 set base64safe(i)=$zchar(65+i),base64safe(i+26)=$zchar(97+i)\n\t.\tfor i=52:1:61 set base64safe(i)=$zchar(i-4)\n\t.\tset base64safe(62)=\"-\",base64safe(63)=\"_\"\n\n\t; Pad message with 0 to ensure number of bytes is a multiple of 3.\n\tset todrop=0\n\tfor quit:($zlength(message)#3)=0 set message=message_$zchar(0) set todrop=todrop+1\n\n\t; Base64 encode the message\n\tset base64=\"\"\n\tfor i=1:3:$zlength(message) do\n\t.\tset base64=base64_base64safe($zascii(message,i)\\4)\n\t.\tset base64=base64_base64safe(($zascii(message,i)#4*16)+($zascii(message,i+1)\\16))\n\t.\tset base64=base64_base64safe(($zascii(message,i+1)#16*4)+($zascii(message,i+2)\\64))\n\t.\tset base64=base64_base64safe($zascii(message,i+2)#64)\n\n\tset:todrop'=0 base64=$zextract(base64,1,$zlength(base64)-todrop)\n\n\tquit base64\n" }, { "path": "src/test/resources/samples/langs/M/digest.m", "content": ";\n; GT.M Digest Extension\n; Copyright (C) 2012 Piotr Koper \n;\n; This program is free software: you can redistribute it and/or modify\n; it under the terms of the GNU Affero General Public License as\n; published by the Free Software Foundation, either version 3 of the\n; License, or (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 Affero General Public License for more details.\n;\n; You should have received a copy of the GNU Affero General Public License\n; along with this program. If not, see .\n;\n\n; GT.M™ is a trademark of Fidelity Information Services, Inc.\n\n; \"GT.M™ is a vetted industrial strength, transaction processing application\n; platform consisting of a key-value database engine optimized for extreme\n; transaction processing throughput & business continuity.\"\n; -- http://sourceforge.net/projects/fis-gtm/\n\n\n\n; GT.M Digest Extension\n;\n; This simple OpenSSL based digest extension is a rewrite of OpenSSL\n; EVP_DigestInit usage example with additional M wrapper.\n; See http://www.openssl.org/docs/crypto/EVP_DigestInit.html for details.\n;\n; The return value from $&digest.init() is 0, usually when an invalid digest\n; algorithm was specification. Anyway, properly used, should never fail.\n;\n; Please feel free to contact me if you have any questions or comments,\n; Piotr Koper \n;\n\n\ndigest(m,a) ; returns digest in ASCII HEX, all-in-one\n\tn c,d\n\ts c=$&digest.init(a)\n\td &digest.update(.c,.m)\n\td &digest.final(.c,.d)\n\tq d\n\n\ninit(alg) ; returns context handler, for alg try \"md5\", \"sha256\", etc\n\t; 0 is returned when an error occurs (e.g. unknown digest)\n\tq $&digest.init(alg)\n\nupdate(ctx,msg) ; updates digest (ctx) by message msg\n\td &digest.update(.ctx,.msg)\n\tq\n\nfinal(ctx,digest) ; returns hex encoded message digest in digest\n\t; frees memory allocated for the ctx also\n\td &digest.final(.ctx,.digest)\n\tq\n\n\n; digest algorithms availability depends on libcrypto (OpenSSL) configuration\n\nmd4(m) q $$digest(.m,\"md4\")\nmd5(m) q $$digest(.m,\"md5\")\nsha(m) q $$digest(.m,\"sha\")\nsha1(m) q $$digest(.m,\"sha1\")\nsha224(m) q $$digest(.m,\"sha224\")\nsha256(m) q $$digest(.m,\"sha256\")\nsha512(m) q $$digest(.m,\"sha512\")\ndss1(m) q $$digest(.m,\"dss1\")\nripemd160(m) q $$digest(.m,\"ripemd160\")\n" }, { "path": "src/test/resources/samples/langs/M/dynamicscoping.m", "content": ";------------------------------------\n; These first two routines illustrate\n; the dynamic scope of variables in M\n;------------------------------------\ntriangle1(x) ;;\n set sum=0\n for do quit:x'>1\n . set sum=sum+x\n . set x=x-1\n quit sum\n\nmain1() ;;\n set sum=1500\n set x=6\n write \"sum before=\",sum,!\n set y=$$triangle1(x)\n write \"sum after=\",sum,!\n write \"triangle of \",x,\" is \",y,!\n quit\n\n\n;------------------------------------\n; These next two routines illustrate\n; the use of the NEW command to make\n; variables limited to the local scope\n;------------------------------------\ntriangle2(x) ;;\n new sum ; <-- HERE !!\n set sum=0\n for do quit:x'>1\n . set sum=sum+x\n . set x=x-1\n quit sum\n\nmain2() ;;\n set sum=1500\n set x=6\n write \"sum before=\",sum,!\n set y=$$triangle2(x)\n write \"sum after=\",sum,!\n write \"triangle of \",x,\" is \",y,!\n quit\n" }, { "path": "src/test/resources/samples/langs/M/fibonacci.m", "content": "start ; compute the Fibonacci series\n set (a,b)=1\n for i=1:1 do quit:term>100\n . set term=a+b\n . write !,term\n . set a=b\n . set b=term\n write !,\"Result= \",term,!\n quit\n" }, { "path": "src/test/resources/samples/langs/M/forloop.m", "content": "start1 ; entry label\n set a=1\n set b=20\n set c=2\n set sum=0\n for i=a:c do quit:'(i1\n . set n=n-1\n . set f=f*n\n . write n,\" : \",f,!\n quit f\n\n\n\nmain() ;;\n set x=5\n set y=$$factorial(x)\n write \"Factorial of \",x,\" = \",y,!\n quit\n" }, { "path": "src/test/resources/samples/langs/M/helloworld.m", "content": "label1 ; This is a label\n write \"Hello World !\",!\n quit\n" }, { "path": "src/test/resources/samples/langs/M/ifelse.m", "content": "if1 ; simple if statement\n set a=5\n set b=10\n set c=25\n if (ab) write \"variable a=\",a,\" is larger than b=\",b,!\n quit\n\nif3 ; if statement with else clause\n set a=5\n set b=10\n if (a\n;\n; This program is free software: you can redistribute it and/or modify\n; it under the terms of the GNU Affero General Public License as\n; published by the Free Software Foundation, either version 3 of the\n; License, or (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 Affero General Public License for more details.\n;\n; You should have received a copy of the GNU Affero General Public License\n; along with this program. If not, see .\n;\n\n; It works in GT.M with ZCHSET=M, but please, don't use it. It's only a joke.\n; Serves well as a reverse engineering example on obtaining boolean functions\n; from integer addition, modulo and division.\n\n\nmd5(msg)\n\t; http://en.wikipedia.org/wiki/MD5\n\tn m,r,k,h,i,j,a,b,c,d,f,g,w,t,p,q\n\ts r(0)=7,r(1)=12,r(2)=17,r(3)=22,r(4)=7,r(5)=12,r(6)=17,r(7)=22,r(8)=7,r(9)=12,r(10)=17,r(11)=22,r(12)=7,r(13)=12,r(14)=17,r(15)=22,r(16)=5,r(17)=9,r(18)=14,r(19)=20,r(20)=5,r(21)=9,r(22)=14,r(23)=20,r(24)=5,r(25)=9,r(26)=14,r(27)=20,r(28)=5,r(29)=9,r(30)=14,r(31)=20,r(32)=4,r(33)=11,r(34)=16,r(35)=23,r(36)=4,r(37)=11,r(38)=16,r(39)=23,r(40)=4,r(41)=11,r(42)=16,r(43)=23,r(44)=4,r(45)=11,r(46)=16,r(47)=23,r(48)=6,r(49)=10,r(50)=15,r(51)=21,r(52)=6,r(53)=10,r(54)=15,r(55)=21,r(56)=6,r(57)=10,r(58)=15,r(59)=21,r(60)=6,r(61)=10,r(62)=15,r(63)=21\n\ts k(0)=3614090360,k(1)=3905402710,k(2)=606105819,k(3)=3250441966,k(4)=4118548399,k(5)=1200080426,k(6)=2821735955,k(7)=4249261313,k(8)=1770035416,k(9)=2336552879,k(10)=4294925233,k(11)=2304563134,k(12)=1804603682,k(13)=4254626195,k(14)=2792965006,k(15)=1236535329,k(16)=4129170786,k(17)=3225465664,k(18)=643717713,k(19)=3921069994,k(20)=3593408605,k(21)=38016083,k(22)=3634488961,k(23)=3889429448,k(24)=568446438,k(25)=3275163606,k(26)=4107603335,k(27)=1163531501,k(28)=2850285829,k(29)=4243563512,k(30)=1735328473,k(31)=2368359562,k(32)=4294588738,k(33)=2272392833,k(34)=1839030562,k(35)=4259657740,k(36)=2763975236,k(37)=1272893353,k(38)=4139469664,k(39)=3200236656,k(40)=681279174,k(41)=3936430074,k(42)=3572445317,k(43)=76029189,k(44)=3654602809,k(45)=3873151461,k(46)=530742520,k(47)=3299628645,k(48)=4096336452,k(49)=1126891415,k(50)=2878612391,k(51)=4237533241,k(52)=1700485571,k(53)=2399980690,k(54)=4293915773,k(55)=2240044497,k(56)=1873313359,k(57)=4264355552,k(58)=2734768916,k(59)=1309151649,k(60)=4149444226,k(61)=3174756917,k(62)=718787259,k(63)=3951481745\n\ts h(0)=1732584193,h(1)=4023233417,h(2)=2562383102,h(3)=271733878\n\ts $p(m,$c(0),(55-$l(msg))#64+1)=\"\",m=msg_$c(128)_m_$$n64($l(msg)*8),p=1,q=0\n\tf q:q d\n\t. f j=0:1:15 s w(j)=$$read(.m,.p)\n\t. i w(0)<0 s q=1 q\n\t. s a=h(0),b=h(1),c=h(2),d=h(3)\n\t. f i=0:1:63 d\n\t.. i i<16 d\n\t... s f=$$or($$and(b,c),$$and($$not(b),d)),g=i\n\t.. e i i<32 d\n\t... s f=$$or($$and(d,b),$$and($$not(d),c)),g=(5*i+1)#16\n\t.. e i i<48 d\n\t... s f=$$xor($$xor(b,c),d),g=(3*i+5)#16\n\t.. e s f=$$xor(c,$$or(b,$$not(d))),g=(7*i)#16\n\t.. s t=d,d=c,c=b,b=(b+$$rotate((a+f+k(i)+w(g))#4294967296,r(i)))#4294967296,a=t\n\t. s h(0)=(h(0)+a)#4294967296,h(1)=(h(1)+b)#4294967296,h(2)=(h(2)+c)#4294967296,h(3)=(h(3)+d)#4294967296\n\tq $$n32h(h(0))_$$n32h(h(1))_$$n32h(h(2))_$$n32h(h(3))\n\nnot(a) ; 32bit\n\tq 4294967295-a\n\nxor(a,b) ; 32bit\n\tn x,i s x=0 f i=1:1:32 s x=(x\\2)+(((a+b)#2)*2147483648),a=a\\2,b=b\\2\n\tq x\n\nand(a,b) ; 32bit\n\tn x,i s x=0 f i=1:1:32 s x=(x\\2)+((((a#2)+(b#2))\\2)*2147483648),a=a\\2,b=b\\2\n\tq x\n\nor(a,b) ; 32bit\n\tq $$not($$and($$not(.a),$$not(.b)))\n\nrotate(a,n) ; 32bit, rol\n\tn c s c=a*(2**n)\n\tq c#4294967296+(c\\4294967296)\n\nread(b,i)\n\tn n,j s n=0 f j=3:-1:0 s n=256*n+$a($e(b,i+j))\n\ts i=i+4\n\tq n\n\nn64(n)\n\tn s,i f i=1:1:8 s $e(s,i)=$c(n#256),n=n\\256\n\tq s\n\nn32h(n)\n\tn h,s,i s h=\"0123456789abcdef\" f i=1:2:8 s $e(s,i+1)=$e(h,n#16+1),n=n\\16,$e(s,i)=$e(h,n#16+1),n=n\\16\n\tq s\n" }, { "path": "src/test/resources/samples/langs/M/mileage.m", "content": "compute(miles,gallons)\n quit miles/gallons\n\ncomputepesimist(miles,gallons)\n quit miles/(gallons+1)\n\ncomputeoptimist(miles,gallons)\n quit (miles+1)/gallons\n\n" }, { "path": "src/test/resources/samples/langs/M/mumtris.m", "content": ";\n; Mumtris\n; Copyright (C) 2012 Piotr Koper \n;\n; This program is free software: you can redistribute it and/or modify\n; it under the terms of the GNU Affero General Public License as\n; published by the Free Software Foundation, either version 3 of the\n; License, or (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 Affero General Public License for more details.\n;\n; You should have received a copy of the GNU Affero General Public License\n; along with this program. If not, see .\n;\n\n; Mumtris\n; This is a tetris game in MUMPS, for GT.M, have fun.\n;\n; Resize your terminal (e.g. maximize your PuTTY window), restart GT.M so that\n; it can report true size of your terminal, and d ^mumtris.\n;\n; Try setting ansi=0 for GT.M compatible cursor positioning.\n;\n; NOTICE: Mumtris uses \"active waiting\" for making delays lower that 1s.\n; That means that one of your CPU will be used at 99%. It's not a bug,\n; the Mumtris and GT.M will be fully responsive. Take care when\n; running on production system ;-)\n;\n\nmumtris\n\tn ansi,e,n,w,h,gr,fl,hl,sc,lv,lc,sb,st,ml,dh,dw,mx,my,mt,r,y,x,t10m,c,ne,i,q\n\n\ts ansi=1\t; use (faster) ANSI CSI instead of USE $P:X=x positioning\n\ts w=10\t\t; matrix width\n\ts h=22\t\t; matrix height (see below)\n\ts gr=1\t\t; grid\n\ts fl=1\t\t; fill\n\ts hl=1\t\t; help\n\ts sc=0\t\t; score\n\ts lv=1\t\t; level\n\ts lc=0\t\t; lines cleared at current level\n\ts sb=70\t\t; step base\n\ts st=$$step\t; current step\n\ts ml=3\t\t; move/rotate hold limit (without fall)\n\n\td dev\t\t; defines dw, dh (device width, device height)\n\ts h=dh-2\t; comment out to disable auto height\n\ts mx=dw/2-(3*w/2)\t; matrix left coordinate\n\ts my=dh/2-(h/2)-1\t; matrix top coordinate\n\ts mt=\"3 5_9 8 2_9 .2_02 /5 \\2 2_ 2_2 6_/2 |8_|2_| 6_0 /2 \\ /2 \\|2 |2 \\/5 \\3 2_\\_2 2_ \\2 |/2 3_/0/4 Y4 \\2 |2 /2 Y Y2 \\2 |2 |2 | \\/2 |\\3_ \\0\\4_|2_2 /4_/|2_|_|2 /2_|2 |2_|2 |2_/4_2 >08 \\/9 3 \\/9 9 2 \\/0\" ; Mumtris\n\n\tu $p:noecho\n\tu $p:escape\n\td cls\n\n\td intro\n\n\td elements\n\ts ne=$r(e)+1\t; new element\n\td change,new(),preview\n\td score(),help,redraw\n\n\ts (i,q)=0\n\tf q:q d\n\t. d pos(0,0)\n\t. s c=$$key\n\t. i c=1 d exit s q=1 q\n\t. s i=$s('c:0,1:i+1)\n\t. s:i'-1 i $h\n\t. i c<0 s q=1 q\n\t. s d=2\n\t. i c=27 d q:q\n\t.. i $l($zb)=1 s (q,ex)=1 q\n\t.. s c=$a($e($zb,3))\n\t.. d:c=65 rotate\n\t.. d:c=66 fall(1)\n\t.. d:c=67 right\n\t.. d:c=68 left\n\t. i c=70!(c=102) s fl=fl+1#3 d preview\n\t. s:c=71!(c=103) gr='gr\n\t. i c=72!(c=104) s hl='hl d help\n\t. d:c=73!(c=105) rotate\n\t. d:c=74!(c=106) left\n\t. d:c=75!(c=107) fall(1)\n\t. d:c=76!(c=108) right\n\t. s:c=81!(c=113) (q,ex)=1\n\t. i c=32 d drop s hd=1\n\tq $s(ex:1,hd:2,d:3,1:0)\n\nredraw\n\td matrix\n\td stack\n\td draw(n,r,y,x)\n\tq\n\nticks\n\tn x,h,b,e,q\n\ts h=$h,(b,e,q)=0 f i=1:1:1000000000 r *x:0 i h'=$h s h=$h d q:q\n\t. i 'b s b=i\n\t. e s e=i,q=1\n\ts t10m=(e-b)\\100\n\tq\n\nchange\n\ts n=ne\n\ts ne=$r(e)+1\n\ts x=0,y=0,r=1\n\tq\n\nnew()\n\ts r=1,x=w/2-2,y=1-e(n,r)\n\tq:$q $$collision(r,y,x) q\n\ndrop\n\tn i\n\ts i=0 f q:$$fall s i=i+2\n\td score(i)\n\tq\n\nrotate\n\tn k\n\ts k=r#e(n)+1\n\tq:$$collision(k,y,x)\n\ts r=k\n\tq\n\nfall(k)\n\tn c\n\ti $$collision(r,y+1,x) q:$q 1 q\n\ts y=y+1\n\td:$g(k) score(1)\n\tq:$q 0 q\n\nright\tq:$$collision(r,y,x+1) s x=x+1 q\nleft\tq:$$collision(r,y,x-1) s x=x-1 q\n\ncollision(r,y,x)\n\tn i,j,q\n\ts q=0\n\tf i=1:1:4 q:q f j=1:1:4 q:q s:$g(e(n,r,j,i))&($g(n(y+j,x+i))!(y+j>h!(x+i>w!(x+i<1)))) q=1\n\tq q\n\nlock\n\tn i,j\n\tf i=1:1:4 q:q f j=1:1:4 q:q s:$g(e(n,r,j,i)) n(y+j,x+i)=1\n\tq\n\nclear\n\tn c,i,j,q\n\ts c=0\n\tf j=h:-1:1 d\n\t. s q=0\n\t. f i=1:1:w i '$g(n(j,i)) s q=1 q\n\t. q:q\n\t. f i=j:-1:1 k n(i) m n(i)=n(i-1)\n\t. s j=j+1,c=c+1\n\t. d redraw\n\ti c d\n\t. d score($s(c=4:800,1:i*200-100*lv))\n\t. s lc=lc+c\n\t. i lv*10'>lc d score(,1) s lc=0\n\tq\n\nexit\n\tn s\n\ts s=mt_\"09 Piotr Koper 09 8 h2tps:2/github.com/pkoper\"\n\td cls d write(.s,dh/2-3,dw/2-24) h 1 r *s:0 r *s:4\n\td cls u $p:echo\n\tq\n\nintro\n\tn s\n\ts s=mt_\"9 9 8 Mumtris for GT.M0\"\n\td cls h 1 d write(.s,dh/2-3,dw/2-24) h 1\n\td ticks\n\td cls\n\tr s:0\n\tq\n\ncls\n\td pos(0,0,1)\n\tq\n\npos(y,x,c)\n\ti ansi d\n\t. ; workaround for ANSI driver: NL in some safe place (1,1)\n\t. w $c(27)_\"[1;1f\",!,$c(27)_\"[\"_(y\\1+1)_\";\"_(x\\1+1)_\"f\"\n\t. w:$g(c) $c(27)_\"[2J\"\n\te d\n\t. u $p:(x=x:y=y)\n\t. u:$g(c) $p:clearscreen\n\tq\n\nover\n\tn s\n\ts s=\"2 8_9 9 6 8_0 /2 5_/5_4 5_3 4_3 \\5_2 \\3_2 2_ 9_2_0/3 \\2 3_\\2_2 \\2 /5 \\_/ 2_ \\3 /3 |3 \\2 \\/ 2/ 2_ \\_2 2_ \\0\\4 \\_\\2 \\/ 2_ \\|2 Y Y2 \\2 3_/2 /4 |4 \\3 /\\2 3_/|2 | \\/0 \\6_2 (4_2 /2_|_|2 /\\3_2 > \\7_2 /\\_/2 \\3_2 >2_|08 \\/5 \\/6 \\/5 \\/9 \\/9 \\/0\"\n\td cls,write(.s,dh/2-3,dw/2-32) h 1 r *s:0 r *s:2\n\tq\n\nwrite(s,y,x)\n\tn i,j,l,c,d\n\td pos(y,x)\n\ts l=$l(s) f i=1:1:l d\n\t. s c=$e(s,i)\n\t. i c?1N d\n\t.. i 'c s y=y+1 d pos(y,x) q\n\t.. s d=$e(s,i+1) f j=1:1:c w d\n\t.. s i=i+1\n\t. e w c\n\td pos(0,0)\n\tq\n\nhelp\n\tn i,x,l,j\n\ts i=9 f x=\"MOVE: LEFT, RIGHT\",\"TURN: UP\",\"DROP: SPACE\",\"\",\"FILL: F\",\"GRID: G\",\"HELP: H\",\"\",\"QUIT: ESC, Q\" d pos(dh/2-(h/2)+i,dw/2+(3*w/2+3)) d s i=i+1\n\t. i hl w x\n\t. e s l=$l(x) f j=1:1:l w \" \"\n\tq\n\nfill() q $s(fl=1:\"[#]\",fl=2:\"[+]\",1:\"[ ]\")\n\ndraw(n,r,y,x,o)\n\tn i,j\n\ts x=3*x+mx+1,y=y+my\n\tf i=1:1:4 i y+i>my f j=1:1:4 d pos(y+i-1,3*(j-1)+x) w $s($g(e(n,r,i,j)):$$fill,$g(o):\" \",1:\"\")\n\tq\n\nstep() q 0.85**lv*sb+(0.1*lv)\n\nscore(s,l)\n\ts:$g(s) sc=sc+s\n\ti $g(l) s lv=lv+l,st=$$step\n\td pos(dh/2-(h/2)+2,dw/2+(3*w/2+3)) w \"SCORE: \",sc\n\td pos(dh/2-(h/2)+3,dw/2+(3*w/2+3)) w \"LEVEL: \",lv\n\tq\n\npreview\n\td draw(ne,1,4-e(ne,1),-5,1)\n\tq\n\nstack\n\tn i,j,x,y\n\ts x=mx+1,y=my\n\tf i=1:1:h f j=1:1:w i $g(n(i,j)) d pos(y+i-1,3*(j-1)+x) w $$fill\n\tq\n\nmatrix\n\tn i,j\n\tf i=0:1:h-1 d\n\t. d pos(my+i,mx) w \"|\" f j=1:1:w w $s(gr:\" . \",1:\" \")\n\t. w \"|\"\n\td pos(my+h,mx) w \"|\" f j=1:1:w*3 w \"~\"\n\tw \"|\",!\n\tq\n\ndev\n\tn x,i\n\tzsh \"d\":x\n\ts i=\"\" f s i=$o(x(\"D\",i)) q:i=\"\" d:(x(\"D\",i)[$p)\n\t. s dw=$p($p(x(\"D\",i),\"WIDTH=\",2),\" \",1),dh=$p($p(x(\"D\",i),\"LENG=\",2),\" \",1)\n\tq\n\nelements\n\t; e - elements\n\t; e(elemId) - rotateVersions\n\t; e(elemId,rotateVersion) - bottom coordinate\n\t; e(elemId,rotateVersion,y,x) - point\n\t;\n\ts e=7\n\t; ____\n\ts e(1)=2,e(1,1)=2\n\ts (e(1,1,2,1),e(1,1,2,2),e(1,1,2,3),e(1,1,2,4))=1\n\ts (e(1,2,1,2),e(1,2,2,2),e(1,2,3,2),e(1,2,4,2))=1\n\t; |__\n\ts e(2)=4,e(2,1)=2\n\ts (e(2,1,1,1),e(2,1,2,1),e(2,1,2,2),e(2,1,2,3))=1\n\ts (e(2,2,1,2),e(2,2,1,3),e(2,2,2,2),e(2,2,3,2))=1\n\ts (e(2,3,2,1),e(2,3,2,2),e(2,3,2,3),e(2,3,3,3))=1\n\ts (e(2,4,1,2),e(2,4,2,2),e(2,4,3,1),e(2,4,3,2))=1\n\t; __|\n\ts e(3)=4,e(3,1)=2\n\ts (e(3,1,1,3),e(3,1,2,1),e(3,1,2,2),e(3,1,2,3))=1\n\ts (e(3,2,1,2),e(3,2,2,2),e(3,2,3,2),e(3,2,3,3))=1\n\ts (e(3,3,2,1),e(3,3,2,2),e(3,3,2,3),e(3,3,3,1))=1\n\ts (e(3,4,1,1),e(3,4,1,2),e(3,4,2,2),e(3,4,3,2))=1\n\t; ||\n\ts e(4)=1,e(4,1)=2\n\ts (e(4,1,1,1),e(4,1,1,2),e(4,1,2,1),e(4,1,2,2))=1\n\t; _-\n\ts e(5)=2,e(5,1)=3\n\ts (e(5,1,2,2),e(5,1,2,3),e(5,1,3,1),e(5,1,3,2))=1\n\ts (e(5,2,1,2),e(5,2,2,2),e(5,2,2,3),e(5,2,3,3))=1\n\t; _|_\n\ts e(6)=4,e(6,1)=2\n\ts (e(6,1,1,2),e(6,1,2,1),e(6,1,2,2),e(6,1,2,3))=1\n\ts (e(6,2,1,2),e(6,2,2,2),e(6,2,2,3),e(6,2,3,2))=1\n\ts (e(6,3,2,1),e(6,3,2,2),e(6,3,2,3),e(6,3,3,2))=1\n\ts (e(6,4,1,2),e(6,4,2,1),e(6,4,2,2),e(6,4,3,2))=1\n\t; -_\n\ts e(7)=2,e(7,1)=3\n\ts (e(7,1,2,1),e(7,1,2,2),e(7,1,3,2),e(7,1,3,3))=1\n\ts (e(7,2,1,2),e(7,2,2,1),e(7,2,2,2),e(7,2,3,1))=1\n\tq\n" }, { "path": "src/test/resources/samples/langs/M/nesting.m", "content": "start1 ; entry label\n set ax=1\n set bx=20\n set cx=2\n set ay=1\n set by=20\n set cy=2\n set sumx=0\n set sqrx=0\n set sumxy=0\n for x=ax:cx:bx do\n . set sumx=sumx+x\n . set sqrx=sqrx+(x*x)\n . for y=ay:cy:by do\n .. set sumxy=sumxy+(x*y)\n .. if (sumxy<100) do\n ... write sumxy,!\n" }, { "path": "src/test/resources/samples/langs/M/pcre.m", "content": ";\n; GT.M PCRE Extension\n; Copyright (C) 2012 Piotr Koper \n;\n; This program is free software: you can redistribute it and/or modify\n; it under the terms of the GNU Affero General Public License as\n; published by the Free Software Foundation, either version 3 of the\n; License, or (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 Affero General Public License for more details.\n;\n; You should have received a copy of the GNU Affero General Public License\n; along with this program. If not, see .\n;\n\n; GT.M™ is a trademark of Fidelity Information Services, Inc.\n\n; \"GT.M™ is a vetted industrial strength, transaction processing application\n; platform consisting of a key-value database engine optimized for extreme\n; transaction processing throughput & business continuity.\"\n; -- http://sourceforge.net/projects/fis-gtm/\n\n\n\n; GT.M PCRE Extension\n;\n; This extension tries to deliver the best possible PCRE interface for the\n; M world by providing a support for PCRE with M arrays, stringified parameter\n; names, simplified API, locales, exceptions and Perl5 Global Match.\n;\n; See pcreexamples.m for comprehensive examples on ^pcre routines usage and\n; beginner level tips on match limits, exception handling and UTF-8 in GT.M.\n;\n; Try out the best known book on regular expressions: http://regex.info/\n; For more information on PCRE see: http://pcre.org/\n;\n; Please feel free to contact me if you have any questions or comments,\n; Piotr Koper \n;\n\n\npcre\t;GT.M PCRE Extension\n\t;1.0;Initial release;pkoper\n\tq\n\n\nversion()\n\tq $&pcre.version()\n\nconfig(name)\n\t; name is one of: (case insensitive)\n\t;\t\"UTF8\", \"NEWLINE\", \"LINK_SIZE\", \"POSIX_MALLOC_THRESHOLD\",\n\t;\t\"MATCH_LIMIT\", \"MATCH_LIMIT_RECURSION\", \"STACKRECURSE\",\n\t;\t\"BSR\", \"UNICODE_PROPERTIES\", \"JIT\", \"JITTARGET\"\n\t;\n\td protect\n\t;\n\tn erropt,isstring,s,n,code\n\ts code=$&pcre.config(.name,.erropt,.isstring,.s,.n)\n\ts:code $ec=\",U\"_(-code)_\",\"\n\tq $s(isstring:s,1:n)\n\ncompile(pattern,options,locale,mlimit,reclimit)\n\t; options is case insensitive and optional string with \"|\" joined:\n\t;\t\"ANCHORED\", \"CASELESS\", \"DOLLAR_ENDONLY\", \"DOTALL\", \"EXTENDED\",\n\t;\t\"FIRSTLINE\", \"MULTILINE\", \"NO_AUTO_CAPTURE\", \"DUPNAMES\",\n\t;\t\"UNGREEDY\", \"BSR_ANYCRLF\", \"BSR_UNICODE\", \"JAVASCRIPT_COMPAT\",\n\t;\t\"NL_ANY\", \"NL_ANYCRLF\", \"NL_CR\", \"NL_CRLF\",\"NL_LF\",\n\t;\t\"UTF8\", \"UCP\", \"NO_UTF8_CHECK\"\n\t;\n\t; locale is an optional Unix locale name used for pcre_maketables(),\n\t; cases:\n\t;\tundefined or \"\":\n\t;\t\tpcre_maketables() will not be called\n\t;\t\"ENV\" (case insensitive):\n\t;\t\tuse locale in program environment defined by the\n\t;\t\tenvironment variables LANG or LC_*\n\t;\tspecified:\n\t;\t\t\"pl_PL.iso88592\", \"pl_PL.utf8\", \"C\", ...\n\t;\t\tsee locale(1), locale(2) and the output of command:\n\t;\t\t\t$ locale -a\n\t;\t\tDebian tip: use\n\t;\t\t\t$ dpkg-reconfigure locales\n\t;\t\tto enable or set system-wide locale\n\t;\n\t; mlimit (optional) limits the number of internal matching function\n\t;\tcalls in pcre_exec() execution, see PCRE manual for details\n\t;\n\t; reclimit (optional) limit for the depth of recursion when calling\n\t;\tthe internal matching function in a pcre_exec() execution,\n\t;\tsee PCRE manual for details\n\t;\n\td protect\n\t;\n\tn erropt,ref,err,erroffset,code\n\ts code=$&pcre.compile(.pattern,$g(options),.erropt,.ref,.err,.erroffset,$g(locale),$g(mlimit,0),$g(reclimit,0))\n\ts:code $ec=\",U\"_(-code)_\",\"\n\tq ref\n\nexec(ref,subject,options,startoffset,length)\n\t; options is case insensitive and optional string with \"|\" joined:\n\t;\t\"ANCHORED\", \"BSR_ANYCRLF\", \"BSR_UNICODE\",\n\t;\t\"NL_ANY\", \"NL_ANYCRLF\", \"NL_CR\", \"NL_CRLF\", \"NL_LF\",\n\t;\t\"NOTBOL\", \"NOTEOL\", \"NOTEMPTY\", \"NOTEMPTY_ATSTART\",\n\t;\t\"NO_START_OPTIMIZE\", \"NO_UTF8_CHECK\",\n\t;\t\"PARTIAL_SOFT\", \"PARTIAL_HARD\"\n\t;\n\t; startoffset is in octets, starts with 1 (like in M) (optional)\n\t;\n\t; length is subject length in octets, not chars (optional)\n\t;\n\td protect\n\t;\n\tn erropt,code,start\n\ts start=$g(startoffset,1)-1\n\ts code=$&pcre.exec(.ref,.subject,$g(length,$zl(subject)),start,$g(options),.erropt)\n\ts:code<0 $ec=\",U\"_(-code)_\",\"\n\tq code\n\novector(ref,i) ; return i-element from ovector\n\td protect\n\t;\n\tn n,code\n\ts code=$&pcre.ovector(.ref,.i,.n)\n\ts:code $ec=\",U\"_(-code)_\",\"\n\t;s $ec=\",U123,\"\n\tq n\n\novecsize(ref) ; return ovecsize\n\td protect\n\t;\n\tn n,code\n\ts code=$&pcre.ovecsize(.ref,.n)\n\ts:code $ec=\",U\"_(-code)_\",\"\n\tq n\n\nfullinfo(ref,name)\n\t; name is one of: (case insensitive)\n\t;\t\"OPTIONS\", \"SIZE\", \"CAPTURECOUNT\", \"BACKREFMAX\", \"FIRSTBYTE\",\n\t;\t\"FIRSTTABLE\", \"LASTLITERAL\", \"NAMEENTRYSIZE\", \"NAMECOUNT\",\n\t; \t\"STUDYSIZE\", \"OKPARTIAL\", \"JCHANGED\", \"HASCRORLF\", \"MINLENGTH\",\n\t;\t\"JIT\", \"JITSIZE\"\n\t; for NAME* options see also $$nametable^pcre()\n\t;\n\td protect\n\t;\n\tn erropt,isstring,s,n,code\n\ts code=$&pcre.fullinfo(.ref,.name,.erropt,.isstring,.s,.n)\n\ts:code $ec=\",U\"_(-code)_\",\"\n\tq $s(isstring:s,1:n)\n\nnametable(ref,i,n) ; returns index (n) and name, or { 0, \"\" } for invalid i\n\t; i is indexed from 1\n\t;\n\td protect\n\t;\n\tn s,code\n\ts code=$&pcre.nametable(.ref,.i,.n,.s)\n\ts:code $ec=\",U\"_(-code)_\",\"\n\tq s\n\nsubstring(ref,i,begin,end)\n\ts begin=$$ovector(.ref,i*2)+1,end=$$ovector(.ref,i*2+1)\n\t; ovector contains octet indexed data not UNICODE chars, so $ze is used\n\tq:'begin \"\"\n\tq $s($g(o,0):begin_\",\"_end,1:$ze(subject,begin,end))\n\nstore(ref,i,n,o,key) ; same as above but stores captured data in n array\n\tn begin,end\n\ts begin=$$ovector(.ref,i*2)+1,end=$$ovector(.ref,i*2+1)\n\tq:'begin\n\ts key=$g(key,i)\n\ts:o n(key,0)=begin,n(key,1)=end\n\ts n(key)=$ze(subject,begin,end)\n\tq\n\ngstore(ref,i,n,round,byref,o,key) ; store for global match\n\tn begin,end\n\ts begin=$$ovector(.ref,i*2)+1,end=$$ovector(.ref,i*2+1)\n\tq:'begin\n\ts key=$g(key,i)\n\ti byref d\n\t. s:o n(key,round,0)=begin,n(key,round,1)=end\n\t. s n(key,round)=$ze(subject,begin,end)\n\te d\n\t. s:o n(round,key,0)=begin,n(round,key,1)=end\n\t. s n(round,key)=$ze(subject,begin,end)\n\tq\n\ntest(subject,pattern,options,locale,mlimit,reclimit)\n\t; see $$compile^pcre for options, locale, mlimit and reclimit\n\t;\n\td protect\n\tn ref,l\n\ts ref=$$compile(.pattern,$g(options),$g(locale),$g(mlimit,0),$g(reclimit,0))\n\ts l=$$exec(.ref,.subject)\n\td free(.ref)\n\tq l\n\nmatch(subject,pattern,match,capture,options,locale,mlimit,reclimit)\n\t; see $$compile^pcre for options, locale, mlimit and reclimit\n\t;\n\t; capture is case insensitive and optional string with \"|\" joined\n\t;\tnames or indexes to be capture\n\t;\n\t; extended options:\n\t; \"NAMED_ONLY\" - capture only named groups\n\t; \"OVECTOR\" - return additional ovector data\n\t;\n\td protect\n\t;\n\tn namedonly,ovector,ref,o,l,i,j,s,c,begin\n\t;\n\ts options=$g(options),(namedonly,ovector)=0\n\tf i=1:1:$l(options,\"|\") d\n\t. s o=$zco($p(options,\"|\",i),\"u\")\n\t. i o=\"NAMED_ONLY\" s namedonly=1,$p(options,\"|\",i)=\"\"\n\t. i o=\"OVECTOR\" s ovector=1,$p(options,\"|\",i)=\"\"\n\ts:namedonly options=options_\"|NO_AUTO_CAPTURE\"\n\t;\n\tk match\n\ts ref=$$compile(.pattern,.options,$g(locale),$g(mlimit,0),$g(reclimit,0))\n\ts l=$$exec(.ref,.subject)\n\ti $d(capture) d\n\t. s c=\"|\"_capture_\"|\"\n\t. ; ovector indexed data\n\t. i 'namedonly f i=0:1:l-1 d:c[(\"|\"_i_\"|\") store(.ref,.i,.match,.ovector)\n\t. ; named matches data\n\t. f i=1:1 s s=$$nametable(.ref,.i,.j) q:s=\"\" d:c[(\"|\"_s_\"|\") store(.ref,.j,.match,.ovector,.s)\n\te d\n\t. i 'namedonly f i=0:1:l-1 d store(.ref,.i,.match,.ovector)\n\t. f i=1:1 s s=$$nametable(.ref,.i,.j) q:s=\"\" d store(.ref,.j,.match,.ovector,.s)\n\td free(.ref)\n\tq:$q l q\n\nglobal(subject,pattern,match,capture,options,locale,mlimit,reclimit)\n\t; options is the same as for match^pcre, extended options:\n\t; \"OVECTOR\" - return additional ovector data\n\t; \"GROUPED\" - group the result in match array by pattern groups\n\t; \"NAMED_ONLY\" - capture only named patterns\n\t;\n\t; see pcredemo.c and pcreccp.cc from PCRE for comments on procedure\n\t; for Perl like global matching\n\t;\n\td protect\n\t;\n\tn ref,c,o,ovector,byref,namedonly,utf8,crlf,start,end,matches,empty,skip,round,i,j,s,n,q\n\tk match\n\t;\n\t; determine additional options and remove them before calling the compile^pcre\n\ts options=$g(options),(ovector,byref,namedonly)=0\n\tf i=1:1:$l(options,\"|\") d\n\t. s o=$zco($p(options,\"|\",i),\"u\")\n\t. i o=\"NAMED_ONLY\" s namedonly=1,$p(options,\"|\",i)=\"\"\n\t. i o=\"GROUPED\" s byref=1,$p(options,\"|\",i)=\"\"\n\t. i o=\"OVECTOR\" s ovector=1,$p(options,\"|\",i)=\"\"\n\ts:namedonly options=options_\"|NO_AUTO_CAPTURE\"\n\t;\n\t; compile the pattern\n\ts ref=$$compile(.pattern,.options,$g(locale),$g(mlimit,0),$g(reclimit,0))\n\t;\n\ts:$d(capture) c=\"|\"_capture_\"|\"\n\ts byref=$g(byref,0)\n\t;\n\t; check pattern options for UTF8 and double char new line\n\ts o=\"|\"_$$fullinfo(.ref,\"OPTIONS\")_\"|\"\n\ts utf8=$s(o[\"|UTF8|\":1,1:0)\n\ts crlf=$s(o[\"|NL_CRLF|\":1,o[\"|NL_ANY|\":1,o[\"|NL_ANYCRLF|\":1,1:0)\n\t;\n\t; if none check the PCRE build options\n\ti crlf=0 d\n\t. s o=$$config(\"NEWLINE\")\n\t. s crlf=$s(o=\"NL_CRLF\":1,o=\"NL_ANY\":1,o=\"NL_ANYCRLF\":1,1:0)\n\t;\n\ts (start,round,i)=1,(empty,skip,q)=0\n\ts end=$l(subject)+1\n\tf d q:start>end!q\n\t. i empty d\n\t.. s matches=$$exec(.ref,.subject,\"NOTEMPTY_ATSTART|ANCHORED\",.start) ; unwind this call to optimize\n\t.. q:matches ; quit this do, leave empty=1, store the matches\n\t..\n\t.. ; advance if no match & clear empty\n\t.. s start=start+1\n\t.. i start>end s q=1 q\n\t..\n\t.. ; skip LF if CR was before and CRLF mode\n\t.. s:crlf&(($ze(subject,start-1)=$c(13))&($ze(subject,start)=$c(10))) start=start+1\n\t..\n\t.. ; skip if in a middle of UTF char\n\t.. i utf8 f q:start'(?:\\d+|\\\\))|{(?[^}]+)})\",.backref,,\"ovector|dupnames\")\n\t;\n\ts options=$g(options)_\"|ovector\"\n\t; silently remove \"NAMED_ONLY\" and \"GROUPPED\" options\n\tf i=1:1:$l(options,\"|\") d\n\t. s o=$zco($p(options,\"|\",i),\"u\")\n\t. s:o=\"NAMED_ONLY\"!(o=\"GROUPED\") $p(options,\"|\",i)=\"\"\n\tq:'$$global(.subject,.pattern,.n,,.options,$g(locale),$g(mlimit,0),$g(reclimit,0)) subject\n\t;\n\t; perform the substitution on matched subject parts\n\ts first=$g(first,1),last=$g(last,0)\n\ts offset=0,i=\"\"\n\tf s i=$o(n(i)) q:i=\"\" d:i'0&(i'end $ze(subject,begin+offset,begin+offset+1)=s_$ze(subject,begin+offset,begin+offset+1)\n\t.\n\t. s offset=offset-(end+1-begin)+$l(s)\n\tq:$q subject q\n\nfree(ref)\n\td protect\n\tn code\n\ts code=$&pcre.free(.ref)\n\ts:code $ec=\",U\"_(-code)_\",\"\n\tq\n\nstackusage()\n\t; return the approximate amount of stack (in bytes) used per\n\t; recursion in pcre_exec()\n\tq -$&pcre.stackusage()\n\n\n; Exception Handling\n;\n; Error conditions are handled by setting the $zc to user codes, see labels\n; at the end of this file. When neither $zt nor $et are set by the user,\n; the default handler (trap^pcre) is used within $zt mechanism.\n;\n; The default handler will write out the details of the exception, and\n; depending on the caller type, it will re raise the exception. This will\n; lead to:\n; a) writing the exception details, when called from the GT.M prompt,\n; b) writing the exception details, the M code place when the pcre routine\n; was called, and terminating the GT.M image.\n;\n; The user should define own exception handler using $zt or $et, see\n; pcreexample.m for example exception handlers.\n;\n\nprotect ; try setup $zt with default handler\n\t;\n\t; \"n protect\" in the $zt is a marker for trap^pcre\n\ts:'$l($et)&(($zt=\"B\")!'$l($zt)) $zt=\"n protect d trap zg \"_($zl-2)\n\tq\n\ntrap(stack)\n\t; see U* labels at the bottom of this file, some lvns are mandatory\n\t; all exceptions are passed through if we wasn't called from direct mode\n\t;\n\tn zl,ref,msg,place\n\t;\n\t; take the $zl if in default handler setup by protect^trap\n\ts zl=$p($zt,\"n protect d trap zg \",2)\n\t;\n\t; clear the $zt\n\ts $zt=\"\"\n\t;\n\t; source location from either stack argument, zl (default handler), or $st-2\n\ts place=$st($g(stack,$g(zl,$st-1)-1),\"PLACE\")\n\t;\n\t; clear location if called from direct mode\n\ts:place[\"^GTM$DMOD\" place=\"\"\n\t;\n\ts ref=$p($ec,\",\",$l($ec,\",\")-1)\n\ti $l($t(@ref)) d\n\t. u $p\n\t. w @$p($t(@ref),\";\",2)\n\t. ; %PCRE-E-COMPILE additional message\n\t. w:ref=\"U16392\"&$g(erroffset) \" in \"_$e($g(pattern),1,erroffset)_\" <-- HERE\"\n\t. w !\n\t. ; write the location it has any meaning\n\t. w:$l(place) \"%PCRE-I-RTSLOC, At M source location \",place,!\n\te d\n\t. w $p($zs,\",\",3,4),!\n\t. w \"%GTM-I-RTSLOC, At M source location \",$p($zs,\",\",2),!\n\t; \n\t; re raise the exception if in a default handler and not called from the direct mode\n\ts:$l(place)&$g(zl,0) $ec=$ec\n\tq\n\n; XC API specific\n;\nU16384\t;\"%PCRE-E-ARGSMALL, Actual argument count is too small\"\nU16385\t;\"%PCRE-E-OPTNAME, Unknown option name \"_$p($g(erropt),\"|\")\nU16386\t;\"%PCRE-E-OBJLIMIT, Maximum number of objects exceeded\"\nU16387\t;\"%PCRE-E-INVREF, Invalid object reference\"\nU16388\t;\"%PCRE-E-INTBUF, Internal buffer too small\"\nU16389\t;\"%PCRE-E-MALLOC, Could not allocate memory\"\nU16390\t;\"%PCRE-E-STUDY, Pattern study failed: \"_$g(err,\"unknown reason\")\nU16391\t;\"%PCRE-E-LOCALE, Invalid locale name \"_$g(locale)\nU16392\t;\"%PCRE-E-COMPILE, Pattern compilation failed, \"_$g(err,\"unknown reason\")\nU16393\t;\"%PCRE-E-LENGTH, Invalid length value specified\"\n\n; PCRE specific\n;\n; NOTES:\n;\n;\tU16401 exception is never raised; when pcre_exec() returns -1\n; (i.e. NOMATCH) the pcre.exec returns 0, so no exception will\n;\tever raise, NOMATCH is not an uncommon situation\n;\n;\tU16388 is raised when pcre_exec() returns 0, i.e. the ovector\n;\twas too small; considering that ovector size is not controlled\n;\tin M world, it is an exception here\n;\nU16401\t;\"%PCRE-E-NOMATCH, The subject string did not match the pattern\"\nU16402\t;\"%PCRE-E-NULL, Either compiled code or subject was passed as NULL, or ovector was NULL\"\nU16403\t;\"%PCRE-E-BADOPTION, An unrecognized bit was set in the options argument\"\nU16404\t;\"%PCRE-E-BADMAGIC, The magic number is not present in compiled code\"\nU16405\t;\"%PCRE-E-UNKNOWNOPCODE, While running the pattern match, an unknown item was encountered in the compiled pattern\"\nU16406\t;\"%PCRE-E-NOMEMORY, Call via pcre_malloc() or pcre_stack_malloc() failed\"\nU16407\t;\"%PCRE-E-NOSUBSTRING, No substring\"\nU16408\t;\"%PCRE-E-MATCHLIMIT, Match limit was reached\"\nU16409\t;\"%PCRE-E-CALLOUT, Callout function wanted to yield a distinctive error code\"\nU16410\t;\"%PCRE-E-BADUTF8, A string that contains an invalid UTF-8 byte sequence was passed as a subject\"\nU16411\t;\"%PCRE-E-BADUTF8OFFSET, The value of startoffset did not point to the beginning of a UTF-8 character or the end of the subject\"\nU16412\t;\"%PCRE-E-PARTIAL, The subject string did not match, but it did match partially\"\nU16414\t;\"%PCRE-E-INTERNAL, An unexpected internal error has occurred\"\nU16415\t;\"%PCRE-E-BADCOUNT, The value of the ovecsize argument is negative\"\nU16416\t;\"%PCRE-E-DFAUITEM, Unsupported item in the pattern, for e.g. \\C o a back reference\"\nU16417\t;\"%PCRE-E-DFAUCOND, Unsupported condition item, for e.g. a back reference for a condition, or a test for recursion in a specific group\"\nU16418\t;\"%PCRE-E-DFAUMLIMIT, Match limits are unsupported for DTA matching\"\nU16419\t;\"%PCRE-E-DFAWSSIZE, Out of space in the workspace vector\"\nU16420\t;\"%PCRE-E-DFARECURSE, The output vector was not large enough while processing recursive subpattern\"\nU16421\t;\"%PCRE-E-RECURSIONLIMIT, The internal recursion limit was reached\"\nU16423\t;\"%PCRE-E-BADNEWLINE, An invalid combination of NL_xxx options was given\"\nU16424\t;\"%PCRE-E-BADOFFSET, The startoffset was negative or greater than the length of the value in length\"\nU16425\t;\"%PCRE-E-SHORTUTF8, The subject string ends with a truncated UTF-8 character and the PCRE_PARTIAL_HARD option is set\"\nU16426\t;\"%PCRE-E-RECURSELOOP, A recursion loop within the pattern was detected\"\nU16427\t;\"%PCRE-E-JITSTACKLIMIT, The memory available for the just-in-time processing stack is not large enough\"\n" }, { "path": "src/test/resources/samples/langs/M/pcreexamples.m", "content": ";\n; GT.M PCRE Extension\n; Copyright (C) 2012 Piotr Koper \n;\n; This program is free software: you can redistribute it and/or modify\n; it under the terms of the GNU Affero General Public License as\n; published by the Free Software Foundation, either version 3 of the\n; License, or (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 Affero General Public License for more details.\n;\n; You should have received a copy of the GNU Affero General Public License\n; along with this program. If not, see .\n;\n\n\n\n; GT.M PCRE Extension Examples\n;\n; see pcre.m for comments on routines parameters and all possible values for\n; the options\n;\npcreexamples ;GT.M PCRE Extension Examples\n\t;1.0;Initial release;pkoper\n\td routines\n\tq\n\n\n; GT.M PCRE Extension API\n; The shining examples\n;\n\ntest\n\t; Test the subject for the match\n\tw $$test^pcre(\"The quick brown fox jumps over the lazy dog\",\"fox\"),!\n\tw $$test^pcre(\"The quick brown fox jumps over the lazy dog\",\"FoX\",\"caseless\"),!\n\tq\n\nmatch\n\tn n\n\t; Simple match\n\tw $$match^pcre(\"The quick brown fox jumps over the lazy dog\",\" (\\w+) \",.n),! zwr\n\n\t; Match with a named groups\n\tw $$match^pcre(\"The quick brown fox jumps over the lazy dog\",\"(?\\w+) (?\\w+)\",.n),! zwr\n\n\t; Match with a named group and limit the output to only the \"second\"\n\tw $$match^pcre(\"The quick brown fox jumps over the lazy dog\",\"(?\\w+) (?\\w+)\",.n,\"second\"),! zwr\n\n\t; Match with a named group with only named patterns\n\tw $$match^pcre(\"The quick brown fox jumps over the lazy dog\",\"(?\\w+) (?\\w+)\",.n,,\"named_only\"),! zwr\n\tq\n\nglobal\n\tn n\n\t; Global match\n\tw $$global^pcre(\"The quick brown fox jumps over the lazy dog\",\"(\\w+)\",.n),! zwr\n\n\t; Global match with a named groups\n\tw $$global^pcre(\"The quick brown fox jumps over the lazy dog\",\"(?\\w+)\\s+(?\\w+)\",.n),! zwr\n\n\t; Global match with grouped captured data\n\tw $$global^pcre(\"The quick brown fox jumps over the lazy dog\",\"(?\\w+)\\s+(?\\w+)\",.n,,\"grouped\"),! zwr\n\n\t; Global match with grouped captured data and only named patterns\n\tw $$global^pcre(\"The quick brown fox jumps over the lazy dog\",\"(?\\w+)\\s+(?\\w+)\",.n,,\"grouped|named_only\"),! zwr\n\tq\n\nreplace\n\t; Just the replace\n\tw $$replace^pcre(\"The quick brown fox jumps over the lazy dog\",\"brown\",\"yellow\"),!\n\n\t; Change the word order\n\tw $$replace^pcre(\"The quick brown fox jumps over the lazy dog\",\"(\\w+)\\s+(\\w+)\",\"\\2 \\1\"),!\n\n\t; Change the word order with named groups\n\tw $$replace^pcre(\"The quick brown fox jumps over the lazy dog\",\"(?\\w+)\\s+(?\\w+)\",\"\\{second} \\{first}\"),!\n\n\t; Escape the \\ sequence\n\tw $$replace^pcre(\"The quick brown fox jumps over the lazy dog\",\"(?\\w+)\\s+(?\\w+)\",\"\\{second} \\\\{first}\"),!\n\n\t; More \\ chars\n\tw $$replace^pcre(\"The quick brown fox jumps over the lazy dog\",\"(?\\w+)\\s+(?\\w+)\",\"\\\\\\{second} \\\\\\\\{first}\"),!\n\tq\n\n\n\n; PCRE API\n; Low level PCRE API examples\n;\napi\n\tn subject,pattern,options,offset,ref,count,i,begin,end,s,name,n\n\n\t; Setup exception trap as in myexception2^pcreexamples\n\ts $zt=\"d trap^pcre(\"_$st_\") zg \"_$zl_\":apitrap^pcreexamples\"\n\n\ts subject=\"The quick brown fox \"_$c(10)_\"jumps over the lazy dog\"\n\ts pattern=\"(?(.*?(?F\\S+).*?)(?\\w+))\"\n\n\t; options are case insensitive, as well as all stringified option\n\t; names for all functions in this extension\n\ts options=\"CASELESS|multiLINE|NL_CrLf|NO_AUTO_CAPTURE|dotall\"\n\ts offset=5 ; start the match with \"quick\"\n\n\t; Compile the pattern\n\ts ref=$$compile^pcre(.pattern,.options) ; pass by the reference\n\n\t; Run the match\n\ts count=$$exec^pcre(.ref,.subject,,.offset)\n\tw \"count: \",count,!\n\n\t; To access the ovector array $$ovector^pcre and $$ovecsize^pcre can\n\t; be used.\n\t;\n\t; ovector array size is always (n + 1) * 3, where n is a number of\n\t; possible capture strings in the submitted pattern for the\n\t; $$compile^pcre(). The exact number of usable pairs of integers in\n\t; ovector array is by the $$exec^pcre().\n\t;\n\tw \"ovecsize: \",$$ovecsize^pcre(.ref),!\n\n\t; Get the captured data in an old way\n\tf i=0:1:count-1 d\n\t. s begin=$$ovector^pcre(.ref,i*2)+1\n\t. s end=$$ovector^pcre(.ref,i*2+1)\n\t. s s=$ze(subject,begin,end)\n\t. w i,\": \",s,!\n\n\t; See what's in the nametable\n\t;\n\t; $$nametable^pcre returns i-th element of nametable array, where the\n\t; index of the ovector array is passed by the reference in n, and the\n\t; return value is a name.\n\t;\n\tf i=1:1 s name=$$nametable^pcre(.ref,.i,.n) q:name=\"\" d\n\t. s begin=$$ovector^pcre(.ref,n*2)+1 ; the returned subject index in n\n\t. s end=$$ovector^pcre(.ref,n*2+1)\n\t. s s=$ze(subject,begin,end)\n\t. w name,\": \",s,!\n\n\t; Use $$substring^pcre() to get the captured string instead of playing\n\t; with $$ovector^pcre().\n\tf i=0:1:count-1 w i,\": \",$$substring^pcre(.ref,.i),!\n\n\t; .. and get the begin and the end index of the captured data in the\n\t; subject, as a side effect.\n\tf i=0:1:count-1 d\n\t. w i,\": \",$$substring^pcre(.ref,.i,.begin,.end),!\n\t. w \"begin: \",begin,!\n\t. w \"end: \",end,!\n\n\t; Get some details on compiled pattern\n\tw \"options: \",$$fullinfo^pcre(.ref,\"OPTIONS\"),!\n\tw \"capture count: \",$$fullinfo^pcre(.ref,\"CAPTURECOUNT\"),!\n\tw \"jit: \",$$fullinfo^pcre(.ref,\"JIT\"),!\n\tw \"min length: \",$$fullinfo^pcre(.ref,\"MINLENGTH\"),!\n\n\t; Free the data internally allocated for the PCRE structures\n\t;\n\td free^pcre(.ref)\n\n\t; Finally, raise an example exception\n\t;\n\t; see \"Exception Handler Examples\"\n\t; \n\tw $t(api+4^pcreexamples),!\n\tw $$compile^pcre(\"aa)bb\"),!\n\tw \"should never be written, the %PCRE-E-COMPILE should be raised\",!\n\tq\n\napitrap\n\tw \"apitrap^pcreexamples\",!\n\tq\n\n\n\n\n; Perl5 Global Match Compatibility\n;\n; Global match as with /g switch on regular expressions in Perl5 is supported.\n;\n; See $$global^pcre and $$replace^pcre examples.\n\n\n; Compatibility Case: Empty Matches\n;\n\n; Global Match\n;\np5global\n\tw \"$ perl -e '$_ = \"\"aa\"\"; print \"\"1: $1\\n\"\" while /(b*|aa)/mg'\",!\n\tzsy \"perl -e \"\"\\$_ = \\\"\"aa\\\"\"; print \\\"\"1: \\$1\\n\\\"\" while /(b*|aa)/mg\"\"\"\n\td global^pcre(\"aa\",\"b*|aa\",.n) zwr\n\tq\n\n; Global Replace\n;\np5replace\n\tw \"$ perl -e '$_ = \"\"aa\"\"; s/(b*|a)/Xy/g; print \"\"$_\\n\"\"'\",!\n\tzsy \"perl -e \"\"\\$_ = \\\"\"aa\\\"\"; s/(b*|a)/Xy/g; print \\\"\"\\$_\\n\\\"\"\"\"\"\n\tw $$replace^pcre(\"aa\",\"(b*|a)\",\"Xy\"),!\n\n\tw \"$ perl -e '$_ = \"\"aa\"\"; s/(b*|aa)/Xy/g; print \"\"$_\\n\"\"'\",!\n\tzsy \"perl -e \"\"\\$_ = \\\"\"aa\\\"\"; s/(b*|aa)/Xy/g; print \\\"\"\\$_\\n\\\"\"\"\"\"\n\tw $$replace^pcre(\"aa\",\"(b*|aa)\",\"Xy\"),!\n\n\tw \"$ perl -e '$_ = \"\"aaa\"\"; s/(b*|aa)/Xy/g; print \"\"$_\\n\"\"'\",!\n\tzsy \"perl -e \"\"\\$_ = \\\"\"aaa\\\"\"; s/(b*|aa)/Xy/g; print \\\"\"\\$_\\n\\\"\"\"\"\"\n\tw $$replace^pcre(\"aaa\",\"(b*|aa)\",\"Xy\"),!\n\tq\n\n\n; Compatibility Case: New Line Characters\n;\n\n; Multi-line with LF\n;\np5lf\n\tw \"perl -e '$_ = \"\"aa\\nbb\"\"; print \"\"1: $1\\n\"\" while /(.*)/mg'\",!\n\tzsy \"perl -e \"\"\\$_ = \\\"\"aa\\nbb\\\"\"; print \\\"\"1: \\$1\\n\\\"\" while /(.*)/mg\"\"\"\n\td global^pcre(\"aa\"_$c(10)_\"bb\",\".*\",.n,,\"multiline|nl_lf\") zwr\n\tq\n\n; Various New Line Specs\n;\np5nl\n\td global^pcre(\"aa\"_$c(13)_$c(10)_\"bb\",\".*\",.n,,\"multiline|nl_lf\") zwr\n\td global^pcre(\"aa\"_$c(13)_$c(10)_\"bb\",\".*\",.n,,\"multiline|nl_cr\") zwr\n\td global^pcre(\"aa\"_$c(13)_$c(10)_\"bb\",\".*\",.n,,\"multiline|nl_crlf\") zwr\n\tq\n\n\n\n; PCRE library version\n;\nversion\n\tw $$version^pcre,!\n\tq\n\n; PCRE compile time defaults\n;\nnewline\n\tw $$config^pcre(\"NEWLINE\"),!\n\tq\n\nutf8support\n\tw $$config^pcre(\"UTF8\"),!\n\tq\n\n; Stack Usage\n;\n; PCRE's stack usage discover procedure\n;\nstackusage\n \tw $$stackusage^pcre,!\n\tq\n\n\n\n; Locale Support Examples\n;\n; Polish language has been used as an example for I18N support in PCRE.\n;\n\n; The example word \"dąb\" (encoded here in UTF-8) is an \"oak\" in Polish.\n;\n; The second letter in \"dąb\" is (I18N) which is:\n; $c(177) in ISO8859-2,\n; $c(261) in UTF-8,\n; see http://en.wikipedia.org/wiki/Polish_code_pages for complete listing\n;\n\n; Note of $CHAR(n) in different GT.M character modes:\n;\n;\tIn UTF-8 mode $c(177) will return two octet encoded UTF-8 char is\n;\tprobably not an expected result when working with single octet ISO\n;\tencoded chars.\n;\n;\tUse $zch(177) to create single octet ISO char, but be prepared for\n;\t%GTM-E-BADCHAR errors. Also the result of $l(), $a() and others might\n;\tbe not what is expected.\n;\n\n\n; Locale: C or POSIX (i.e. no localization)\n;\nnolocale\n\tw $zchset,!\n\tw $$match^pcre(\"d\"_$zch(177)_\"b\",\"\\w{3}\",.n,,,),! zwr\n\tq\n\n; Locale: ISO\n;\nisolocale\n\tw $zchset,!\n\tw $$match^pcre(\"d\"_$zch(177)_\"b\",\"\\w{3}\",.n,,,\"pl_PL\"),! zwr\n\tq\n\n; Locale: UTF-8\n;\nutflocale\n\t; M and UTF-8 mode\n\tw $$match^pcre(\"d\"_$zch(196)_$zch(133)_\"b\",\"\\w{3}\",.n,,\"UTF8|UCP\",\"pl_PL.UTF8\"),! zwr\n\n\t; UTF-8 mode only\n\tw $$match^pcre(\"d\"_$c(261)_\"b\",\"\\w{3}\",.n,,\"UTF8|UCP\",\"pl_PL.UTF8\"),! zwr\n\tq\n\n; Locale: environment ($LANG, $LC_CTYPE)\n;\n; Set the GT.M environment for LANG=\"pl_PL\" or LANG=\"pl_PL.UTF8\" to obtain\n; different results.\n;\nenvlocale\n\tw $ztrnlnm(\"LANG\"),!\n\tw $ztrnlnm(\"LC_CTYPE\"),!\n\tw $$match^pcre(\"d\"_$c(177)_\"b\",\"\\w{3}\",.n,,,\"env\"),! zwr\n\tw $$match^pcre(\"d\"_$zch(196)_$zch(133)_\"b\",\"\\w{3}\",.n,,\"UTF8|UCP\",\"pl_PL.UTF8\"),! zwr\n\tq\n\n\n; Notes on GT.M in UTF-8\n;\n;\tEnabling native support for UTF-8 in GT.M requires:\n;\t1) libicu\n;\t2) environment:\n;\t gtm_chset=UTF-8\n;\t gtm_icu_version=4.8\n;\t3) recompiled object files for UTF-8\n;\n;\n; Instructions for UTF-8 in Debian 6\n;\n;\t1) Install libicu (libicu48)\n;\t $ apt-get install libicu48\n;\t2) append environment setup to GT.M's user .bash_profile\n;\t export gtm_chset=UTF-8\n;\t export gtm_icu_version=4.8\n;\t3) remove *.o files from the GT.M installation directory\n;\t $ rm /opt/gtm/*.o\n;\t4) allow GT.M's user to write new object files\n; $ chown gtm /opt/gtm\n;\n;\n; Startup errors in UTF-8 mode\n;\n; %GTM-E-INVOBJ, Cannot ZLINK object file due to unexpected format\n; %GTM-I-TEXT, Object compiled with CHSET=M which is different from $ZCHSET\n;\n; The above errors are written by the GT.M at the startup when the environment\n; has the correct setup for the UTF-8, but GT.M can't use already existing\n; object files for execution, because they were compiled for the M charset.\n; Remove all GT.M's object files like in step 3) in the \"Instructions for\n; UTF-8 in Debian 6\" above.\n;\n\n\n\n; Match Limits\n;\n;\tPCRE has built-in limits on internal matching and recursion.\n;\n;\tThose limits prevent the PCRE engine from a very long runs, especially\n;\twhen there would be no matches and all possible\tpaths in the match\n;\ttree must be checked.\n;\n;\tFunctions using $$compile^pcre and the $$compile^pcre itself allows\n;\tsetting MATCH_LIMIT and MATCH_LIMIT_RECURSION in optional arguments\n;\tnamed mlimit and reclimit:\n;\n;\t $$compile^pcre(pattern,options,locale,mlimit,reclimit)\n;\t $$match^pcre(subject,pattern,match,capture,options,locale,mlimit,reclimit)\n;\t $$global^pcre(subject,pattern,match,capture,options,locale,mlimit,reclimit)\n;\t $$replace^pcre(subject,pattern,subst,first,last,options,locale,mlimit,reclimit)\n;\n;\tIf the mlimit or reclimit are not specified, the PCRE library\n;\tcompilation time defaults are used.\n;\nlimits\n\tw \"Compile time (default) MATCH_LIMIT is: \",$$config^pcre(\"MATCH_LIMIT\"),!\n\tw \"Compile time (default) MATCH_LIMIT_RECURSION is: \",$$config^pcre(\"MATCH_LIMIT\"),!\n\tq\n\n; Example pattern with a very long run time\n;\nlongrun\n\tw $$match^pcre(\"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\",\"(\\D+|<\\d+>)*[!?]\",.n),! zwr\n\tw \"should never be written, the %PCRE-E-MATCHLIMIT should be raised\",!\n\tq\n\n; Equal to the longrun^pcreexamples, but corrected pattern\n;\nshortrun\n\tw $$match^pcre(\"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\",\"((?>\\D+)|<\\d+>)*[!?]\",.n),! zwr\n\tq\n\n; Enforced mlimit\n;\nenforcedlimit\n\tw $$match^pcre(\"aaaaaa\",\"(.)(.)\",.n,,,,2),! zwr\n\tw \"should never be written, the %PCRE-E-MATCHLIMIT should be raised\",!\n\tq\n\n\n\n; Exception Handling\n;\n; Error conditions are handled by setting the $zc to user codes, see labels at\n; the end of this file. When neither $zt nor $et are set by the user, the\n; default handler (trap^pcre) is used within $zt mechanism.\n;\n; The default handler will write out the details of the exception, and\n; depending on the caller type, it will re raise the exception. This will lead\n; to:\n; a) writing the exception details, when called from the GT.M prompt,\n; b) writing the exception details, the M code place when the pcre routine\n; was called, and terminating the GT.M image.\n;\n; The user should define own exception handler using $zt or $et, see\n; pcreexamples.m for example exception handlers.\n;\n\n\n; Exception Handler Examples\n;\n\n; No handler\n;\nnohandler\n\ts ($ec,$et,$zt)=\"\"\n\ts x=$$compile^pcre(\"a)b\")\n\tw \"will never be written\",!\n\tq\n;\n; GTM>d nohandler^pcreexamples\n; %PCRE-E-COMPILE, Pattern compilation failed, unmatched parentheses in a <-- HERE\n; %PCRE-I-RTSLOC, At M source location nohandler+2^pcreexamples\n; %GTM-E-SETECODE, Non-empty value assigned to $ECODE (user-defined error trap)\n; %GTM-I-RTSLOC, At M source location trap+32^pcre\n; $ (GT.M image has been terminated)\n;\n\n\n; Simple handler\n;\nmyexception1\n\ts $zt=\"zg \"_$zl_\":mytrap1^pcreexamples\"\n\ts x=$$compile^pcre(\"a)b\")\n\tw \"will never be written\",!\n\tq\n\nmytrap1\n\tw \"it's a trap\",!\n\tw $ec,!\n\ts $ec=\"\"\n\tq\n;\n; GTM>d myexception1^pcreexamples\n; it's a trap\n; ,U16392,\n; GTM>\n;\n\n\n; Simple handler with pcre exception details\n;\nmyexception2\n\ts $zt=\"d trap^pcre(\"_$st_\") zg \"_$zl_\":mytrap2^pcreexamples\"\n\ts x=$$compile^pcre(\"a)b\")\n\tw \"will never be written\",!\n\tq\n\nmytrap2\n\tw \"it's a trap\",!\n\tw $ec,!\n\ts $ec=\"\"\n\tq\n;\n; GTM>d myexception2^pcreexamples\n; %PCRE-E-COMPILE, Pattern compilation failed, unmatched parentheses in a <-- HERE\n; %PCRE-I-RTSLOC, At M source location myexception2+2^pcreexamples\n; it's a trap\n; ,U16392,\n; GTM>\n;\n; In this example the trap^pcre is called with optional argument (level\n; of M execution stack), for which trap^pcre will produce the\n; %PCRE-I-RTSLOC details.\n;\n; DETAILS:\n;\tThe trap^pcre is executed in the stack frame where the error condition\n;\toccurred, that gives the trap^pcre routine an access to the local\n;\tvariables like locale (locale name) or err (PCRE error message).\n;\tThe following zg command drops stack frames up to the current frame\n;\t(the frame where the s $zt=.. is used), and executes the mytrap label,\n;\twhere locale or err is not available.\n;\n\n\n; Simple handler with limited pcre exception details\n;\nmyexception3\n\ts $zt=\"zg \"_$zl_\":mytrap3^pcreexamples\"\n\ts x=$$compile^pcre(\"a)b\")\n\tw \"will never be written\",!\n\tq\n\nmytrap3\n\td trap^pcre($st)\n\tw \"it's a trap\",!\n\tw $ec,!\n\ts $ec=\"\"\n\tq\n;\n; GTM>d myexception3^pcreexamples\n; %PCRE-E-COMPILE, Pattern compilation failed, unknown reason\n; %PCRE-I-RTSLOC, At M source location myexception3+2^pcreexamples\n; it's a trap\n; ,U16392,\n; GTM>\n;\n; DETAILS:\n;\tThe trap^pcre is executed in the stack frame where the compile^pcre\n;\twas called. The deeper stack frames has already\tbeen dropped by the\n;\tzg command, so the err local variable is not available in this\n;\tcontext. Thats why trap^pcre doesn't know the exact reason why the\n;\t%PCRE-E-COMPILE was raised.\n;\n\n\n; Note on $st() and repeated exceptions\n;\n;\tThe $st() function returns information connected with $ec codes\tin\n;\ta stack manner. That means that when once the $ec was set at n-th\n;\texecution level, any future exceptions at that level won't change\n;\tthe $st() output for that level unless $ec is cleared.\n;\n;\tAlways clear $ec when the exception handling is done.\n;\n\n\n; Execute all of the routines in this file\n;\nroutines\n\tw \">> test^pcreexamples\",!\n\td test^pcreexamples\n\n\tw !,\">> match^pcreexamples\",!\n\td match^pcreexamples\n\n\tw !,\">> global^pcreexamples\",!\n\td global^pcreexamples\n\n\tw !,\">> replace^pcreexamples\",!\n\td replace^pcreexamples\n\n\tw !,\">> p5global^pcreexamples\",!\n\td p5global^pcreexamples\n\n\tw !,\">> p5replace^pcreexamples\",!\n\td p5replace^pcreexamples\n\n\tw !,\">> p5lf^pcreexamples\",!\n\td p5lf^pcreexamples\n\n\tw !,\">> p5nl^pcreexamples\",!\n\td p5nl^pcreexamples\n\n\tw !,\">> version^pcreexamples\",!\n\td version^pcreexamples\n\n\tw !,\">> newline^pcreexamples\",!\n\td newline^pcreexamples\n\n\tw !,\">> utf8support^pcreexamples\",!\n\td utf8support^pcreexamples\n\n\tw !,\">> stackusage^pcreexamples\",!\n\td stackusage^pcreexamples\n\n\tw !,\">> nolocale^pcreexamples\",!\n\td nolocale^pcreexamples\n\n\tw !,\">> isolocale^pcreexamples\",!\n\td isolocale^pcreexamples\n\n\tw !,\">> utflocale^pcreexamples\",!\n\td utflocale^pcreexamples\n\n\tw !,\">> envlocale^pcreexamples\",!\n\td envlocale^pcreexamples\n\n\tw !,\">> limits^pcreexamples\",!\n\td limits^pcreexamples\n\n\tw !,\">> longrun^pcreexamples\",!\n\tw \"(skipped, uncomment to raise the exception)\",!\n\t; d longrun^pcreexamples\n\n\tw !,\">> shortrun^pcreexamples\",!\n\td shortrun^pcreexamples\n\n\tw !,\">> enforcedlimit^pcreexamples\",!\n\tw \"(skipped, uncomment to raise the exception)\",!\n\t; d enforcedlimit^pcreexamples\n\n\tw !,\">> nohandler^pcreexamples\",!\n\tw \"(skipped, uncomment to raise the exception)\",!\n\t; d nohandler^pcreexamples\n\n\tw !,\">> myexception1^pcreexamples\",!\n\td myexception1^pcreexamples\n\n\tw !,\">> myexception2^pcreexamples\",!\n\td myexception2^pcreexamples\n\n\tw !,\">> myexception3^pcreexamples\",!\n\td myexception3^pcreexamples\n\tq\n" }, { "path": "src/test/resources/samples/langs/M/postconditional.m", "content": " ;\n ; M code examples contrasting postconditionals with IF-commands\n ;\npost1 ; postconditional in set command\n set a=5\n set b=10\n set c=25\n I 0 ;purposely set $TEST to false\n write \"$TEST special variable (before post-condition)=\",$TEST\n set:(ab) \"variable a=\",a,\" is larger than b=\",b,!\n write \"$TEST special variable (after post-condition) =\",$TEST \n quit\n ;\nif1 ; if command\n set a=5\n set b=10\n set c=25\n I 0 ;purposely set $TEST to false\n write \"$TEST special variable (before IF)=\",$TEST\n if (ab) write \"variable a=\",a,\" is larger than b=\",b,!\n write \"$TEST special variable (after IF) =\",$TEST \n quit\n" }, { "path": "src/test/resources/samples/langs/M/primes.m", "content": "\t; part of Keith Lynch's .signature; it prints a table of primes,\n\t; including code to format it neatly into columns -- DPBS\n\t; -- M Technology and MUMPS Language FAQ, Part 1/2\n\t;\n\n\tf p=2,3:2 s q=1 x \"f f=3:2 q:f*f>p!'q s q=p#f\" w:q p,?$x\\8+1*8\n" }, { "path": "src/test/resources/samples/langs/M/url.m", "content": "\t;\n\t; This file is part of DataBallet.\n\t; Copyright (C) 2012 Laurent Parenteau \n\t;\n\t; DataBallet is free software: you can redistribute it and/or modify\n\t; it under the terms of the GNU Affero General Public License as published by\n\t; the Free Software Foundation, either version 3 of the License, or\n\t; (at your option) any later version.\n\t;\n\t; DataBallet is distributed in the hope that it will be useful,\n\t; but WITHOUT ANY WARRANTY; without even the implied warranty of\n\t; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\t; GNU Affero General Public License for more details.\n\t;\n\t; You should have received a copy of the GNU Affero General Public License\n\t; along with DataBallet. If not, see .\n\t;\n\ndecode(val)\n\t;\n\t; Decoded a URL Encoded string\n\t;\n\tnew decoded,c,i\n\n\tset decoded=\"\"\n\tfor i=1:1:$zlength(val) do\n\t.\tset c=$zextract(val,i,i)\n\t.\tif c=\"+\" set decoded=decoded_\" \"\n\t.\telse if c'=\"%\" set decoded=decoded_c\n\t.\telse set decoded=decoded_$zchar($$FUNC^%HD($zextract(val,i+1,i+2))) set i=i+2\n\tquit decoded\n\nencode(val)\n\t;\n\t; Encoded a string for URL usage\n\t;\n\tnew encoded,c,i\n\tset encoded=\"\"\n\n\t; Populate safe char only the first time\n\tif '$data(safechar) for i=45,46,95,126,48:1:57,65:1:90,97:1:122 set safechar($zchar(i))=\"\"\n\n\tfor i=1:1:$zlength(val) do\n\t.\tset c=$zextract(val,i,i)\n\t.\tif $data(safechar(c)) set encoded=encoded_c\n\t.\telse if c=\" \" set encoded=encoded_\"+\"\n\t.\telse set encoded=encoded_\"%\"_$$FUNC^%DH($zascii(c),2)\n\n\tquit encoded\n" }, { "path": "src/test/resources/samples/langs/M/zmwire.m", "content": "zmwire ; M/Wire Protocol for M Systems (eg GT.M, Cache)\n ;\n ; ----------------------------------------------------------------------------\n ; | M/Wire |\n ; | Copyright (c) 2004-11 M/Gateway Developments Ltd, |\n ; | Reigate, Surrey UK. |\n ; | All rights reserved. |\n ; | |\n ; | http://www.mgateway.com |\n ; | Email: rtweed@mgateway.com |\n ; | |\n ; | This program is free software: you can redistribute it and/or modify |\n ; | it under the terms of the GNU Affero General Public License as |\n ; | published by the Free Software Foundation, either version 3 of the |\n ; | License, or (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 Affero General Public License for more details. |\n ; | |\n ; | You should have received a copy of the GNU Affero General Public License |\n ; | along with this program. If not, see . |\n ; ----------------------------------------------------------------------------\n ;\n QUIT\n ;\n ; By default this server code runs on port 6330\n ;\n ; For GT.M systems it is invoked via xinetd:\n ; Edit /etc/services and add the line:\n ; \n ; mwire 6330/tcp # Service for M/Wire Protocol\n ;\n ; Copy the file mwire to /etc/xinetd.d/mwire\n ; Copy the file zmwire to /usr/local/gtm/zmwire and change \n ; its permissions to executable (eg 755)\n ;\n ; These files may be edited to change the paths or port number\n ; Restart xinetd using: sudo /etc/init.d/xinetd restart\n ;\n ; On GT.M systems you must also have installed MGWSI or m_apache\n ; in order to provide the MD5 hashing function for passwords\n ; Alternatively substitute the MD5 callout to the MD5 function of your choice\n ;\n ; For Cache systems, it is invoked via the M/Wire Daemon routine\n ; which should be running as a jobbed process:\n ;\n ; job start^zmwireDaemon\n ;\n ; You can change the port number by simply editing the line\n ; \n ; port+1^zmwireDaemon\n ;\n ; Stop the Daemon process using ^RESJOB and restart it.\n ;\nmwireVersion\n ;;Build 22\n ;\nmwireDate\n ;;06 July 2011\n ;\nversion\n ;\n s output=\"+M/Wire \"_$p($t(mwireVersion+1),\";;\",2,2000)_crlf\n w output\n QUIT\n ;\nbuild\n ;\n n crlf,response\n ;\n s crlf=$c(13,10)\n s response=\"*3\"_crlf\n w response\n i $g(^zewd(\"trace\"))=1 d trace(\"build: \"_response_\" sent\")\n ;\n s response=$p($t(mwireVersion+1),\";;\",2,2000)\n s response=\"$\"_$l(response)_crlf_response_crlf\n w response\n i $g(^zewd(\"trace\"))=1 d trace(\"build: \"_response_\" sent\")\n ;\n s response=$p($t(mwireDate+1),\";;\",2,2000)\n s response=\"$\"_$l(response)_crlf_response_crlf\n w response\n i $g(^zewd(\"trace\"))=1 d trace(\"build: \"_response_\" sent\")\n ;\n s response=$zv\n s response=\"$\"_$l(response)_crlf_response_crlf\n w response\n i $g(^zewd(\"trace\"))=1 d trace(\"build: \"_response_\" sent\")\n QUIT\n ;\ncommand ;\n n authNeeded,c,crlf,input,output\n ;\n d cleardown\n i $zv[\"GT.M\" s $zint=\"d monitoroutput\"\n s ^zmwire(\"connected\",$j)=\"\"\n l +^zmwire(\"connected\",$j)\n s crlf=$c(13,10)\n s authNeeded=0\n s role=\"user\"\n i $d(^zmwire(\"auth\")) s authNeeded=1\nloop\n i $g(^zmwire(\"relink\"))=1,'$d(^zmwire(\"relink\",\"process\",$j)) s ok=$$relinkRoutines()\n r *c\n i $c(c)=\"*\" d\n . s input=$$multiBulkRequest()\n . i $g(^zewd(\"trace\"))=1 d trace($j_\": \"_$h_\": mwire input: \"_input)\n e d\n . r input s input=$c(c)_input \n . i $g(^zewd(\"trace\"))=1 d trace($h_\": mwire input: \"_input)\n . i input'=\"\" d\n . . i $zv[\"GT.M\" s input=$e(input,1,$l(input)-2)\n . . i $zv[\"Cache\" s input=$e(input,1,$l(input)-1)\n ;i input=\"PING\" w \"+PONG\"_crlf g loop\n i input=\"PING\" s output=\"+PONG\"_crlf w output g loop\n i $d(^zmwire(\"monitor\",\"listener\")) d log(input)\n i input=\"\" g loop\n i input=\"EXIT\" g halt\n i input=\"QUIT\" g quit\n i input=\"HALT\" g halt\n ;\n i authNeeded,$e(input,1,4)'=\"AUTH\" s output=\"-Authentication required\"_crlf w output g loop\n i 'authNeeded,$e(input,1,4)=\"AUTH\" s output=\"-Authentication ignored\"_crlf w output g loop\n i $e(input,1,5)=\"AUTH \" d auth($e(input,6,$l(input))) g loop\n i 'authNeeded!(role=\"admin\"),$e(input,1,12)=\"SETPASSWORD \" d setpassword($e(input,13,$l(input))) g loop\n ;\n s input=$$utfConvert(input)\n i $e(input,1,4)=\"SET \" d set($e(input,5,$l(input))) g loop\n i $e(input,1,10)=\"GETGLOBAL \" d getGlobal($e(input,11,$l(input))) g loop\n i $e(input,1,14)=\"GETJSONSTRING \" d getJSON($e(input,15,$l(input))) g loop\n i $e(input,1,14)=\"SETJSONSTRING \" d setJSON($e(input,15,$l(input))) g loop\n i $e(input,1,15)=\"RUNTRANSACTION \" d runTransaction($e(input,16,$l(input))) g loop\n i $e(input,1,4)=\"GET \" d get($e(input,5,$l(input))) g loop\n i $e(input,1,7)=\"INCRBY \" d incrby($e(input,8,$l(input))) g loop\n i $e(input,1,7)=\"DECRBY \" d decrby($e(input,8,$l(input))) g loop\n i $e(input,1,14)=\"NEXTSUBSCRIPT \" d nextSubscript($e(input,15,$l(input)),1) g loop\n i $e(input,1,18)=\"PREVIOUSSUBSCRIPT \" d nextSubscript($e(input,19,$l(input)),-1) g loop\n i $e(input,1,5)=\"KILL \" d kill($e(input,6,$l(input))) g loop\n i $e(input,1,4)=\"DEL \" d kill($e(input,5,$l(input))) g loop\n i $e(input,1,5)=\"DATA \" d data($e(input,6,$l(input))) g loop\n i $e(input,1,7)=\"EXISTS \" d data($e(input,8,$l(input))) g loop\n i $e(input,1,5)=\"INCR \" d incr($e(input,6,$l(input))) g loop\n i $e(input,1,5)=\"DECR \" d decr($e(input,6,$l(input))) g loop\n i $e(input,1,11)=\"COPYGLOBAL \" d copy($e(input,12,$l(input))) g loop\n i $e(input,1,5)=\"LOCK \" d lock($e(input,6,$l(input))) g loop\n i $e(input,1,7)=\"UNLOCK \" d unlock($e(input,8,$l(input))) g loop\n i $e(input,1,6)=\"ORDER \" d order($e(input,7,$l(input))) g loop\n i $e(input,1,5)=\"NEXT \" d order($e(input,6,$l(input))) g loop\n i $e(input,1,9)=\"ORDERALL \" d orderall($e(input,10,$l(input))) g loop\n i $e(input,1,11)=\"GETGLOBALS2\" d getGlobals() g loop\n i $e(input,1,10)=\"GETGLOBALS\" d getGlobalList() g loop\n i $e(input,1,9)=\"MULTIGET \" d multiGet($e(input,10,$l(input))) g loop\n i $e(input,1,11)=\"GETALLSUBS \" d orderall($e(input,12,$l(input))) g loop\n i $e(input,1,14)=\"GETSUBSCRIPTS \" d getAllSubscripts($e(input,15,$l(input))) g loop\n i $e(input,1,9)=\"REVORDER \" d reverseorder($e(input,10,$l(input))) g loop\n i $e(input,1,9)=\"PREVIOUS \" d reverseorder($e(input,10,$l(input))) g loop\n i $e(input,1,6)=\"QUERY \" d query($e(input,7,$l(input))) g loop\n i $e(input,1,9)=\"QUERYGET \" d queryget($e(input,10,$l(input))) g loop\n i $e(input,1,10)=\"MERGEFROM \" d mergefrom($e(input,11,$l(input))) g loop\n i $e(input,1,11)=\"GETSUBTREE \" d mergefrom($e(input,12,$l(input))) g loop\n i $e(input,1,8)=\"MERGETO \" d mergeto($e(input,9,$l(input))) g loop\n i $e(input,1,11)=\"SETSUBTREE \" d mergeto($e(input,12,$l(input))) g loop\n i $e(input,1,9)=\"FUNCTION \" d function($e(input,10,$l(input))) g loop\n i $e(input,1,8)=\"EXECUTE \" d function($e(input,9,$l(input))) g loop\n i $e(input,1,6)=\"TSTART\" d tstart g loop\n i $e(input,1,7)=\"TCOMMIT\" d tcommit g loop\n i $e(input,1,9)=\"TROLLBACK\" d trollback g loop\n i $e(input,1,5)=\"MDATE\" d mdate g loop\n i $e(input,1,9)=\"PROCESSID\" d processid g loop\n i $e(input,1,7)=\"VERSION\" d version g loop\n i $e(input,1,8)=\"GETBUILD\" d build g loop\n i $e(input,1,8)=\"MVERSION\" d zv g loop\n i $e(input,1,4)=\"INFO\" d info g loop\n i $e(input,1,7)=\"MONITOR\" d monitor g loop\n s output=\"-\"_input_\" not recognized\"_crlf w output\n g loop\n ;\nmultiBulkRequest()\n ;\n n buff,c,i,input,j,len,noOfCommands,param,space\n ;\n s noOfCommands=\"\"\n f d q:c=13\n . r *c q:c=13\n . ;d trace(\"0: \"_$c(c))\n . s noOfCommands=noOfCommands_$c(c)\n r *x\n ;d trace(\"1: \"_$c(x))\n ;\n f i=1:1:noOfCommands d\n . ;d trace(\"i=\"_i)\n . s len=\"\"\n . f d q:c=13\n . . r *c\n . . ;d trace(\"2: \"_$c(c))\n . . i $c(c)=\"$\",len=\"\" q\n . . q:c=13\n . . s len=len_$c(c)\n . r *c\n . ;d trace(\"3: \"_$c(c))\n . s input=\"\"\n . i len=0 d\n . . s param(i)=\"\"\n . . r *c\n . . ;d trace(\"4: \"_$c(c))\n . e d\n . . r input#len\n . . ;d trace(\"input=\"_input)\n . . s param(i)=input\n . . ;d trace(\"param \"_i_\" = \"_input)\n . . r *c,*c\n ;\n s param(1)=$zconvert(param(1),\"U\")\n ;QUIT \"PING\"\n i param(1)=\"PING\" QUIT param(1)\n ;s no=$increment(^rob) m ^rob(no)=param\n i param(1)=\"SET\" QUIT param(1)_\" \"_param(2)_\" \"_$l(param(3))_crlf_param(3)\n i param(1)=\"SETJSONSTRING\" QUIT param(1)_\" \"_param(2)_crlf_param(3)_crlf_param(4)\n i param(1)=\"COPYGLOBAL\"!(param(1)=\"GETSUBSCRIPTS\") d QUIT input\n . s space=\"\",input=\"\"\n . f i=1:1:noOfCommands d\n . . s input=input_space_param(i)\n . . i space=\"\" s space=\" \" q\n . . i space=\" \" s space=$c(1)\n i param(1)=\"EXECUTE\" d QUIT input\n . ;d trace(\"Execute: param(3)=\"_param(3))\n . s param(3)=$$replaceAll(param(3),\"\\\"\"\",\"\"\"\"\"\")\n . i $e(param(3),1)=\"[\" s input=param(1)_\" \"_param(2)_\"(\"_$e(param(3),2,$l(param(3))-1)_\")\" q\n . s input=param(1)_\" \"_param(2)\n ;\n s space=\"\",input=\"\"\n f i=1:1:noOfCommands d\n . s input=input_space_param(i)\n . s space=\" \" \n ;\n QUIT input\n ;\nhalt\n k ^zmwire(\"connected\",$j)\n HALT\n ;\nquit\n ;\n i '$d(^zmwire(\"monitor\",\"listener\",$j)) g halt\n k ^zmwire(\"monitor\",\"listener\",$j)\n g loop\n ;\ncleardown\n ;\n n ignore,pid\n ;\n s pid=\"\"\n f s pid=$o(^zmwire(\"connected\",pid)) q:pid=\"\" d\n . i pid=$j q\n . s ignore=1\n . l +^zmwire(\"connected\",pid):0 e s ignore=0\n . i ignore d\n . . l -^zmwire(\"connected\",pid)\n . . k ^zmwire(\"connected\",pid)\n . . k ^zmwire(\"monitor\",\"listener\",pid)\n . . k ^zmwire(\"monitor\",\"output\",pid)\n s pid=\"\"\n f s pid=$o(^zmwire(\"monitor\",\"output\",pid)) q:pid=\"\" d\n . i pid=$j q\n . s ignore=1\n . l +^zmwire(\"connected\",pid):0 e s ignore=0\n . l -^zmwire(\"connected\",pid)\n . i ignore d\n . . k ^zmwire(\"monitor\",\"output\",pid)\n QUIT\n ;\nmonitor\n ;\n i $zv'[\"GT.M\" w \"-Command unavailable\"_crlf QUIT\n n quit\n ;\n s ^zmwire(\"monitor\",\"listener\",$j)=\"\"\n s output=\"+OK\"_crlf w output\n f h 1 r quit:0 i $e(quit,1,4)=\"QUIT\" q\n k ^zmwire(\"monitor\",\"listener\",$j)\n s output=\"+OK\"_crlf w output\n QUIT\n ;\nlog(input)\n ;\n i $zv'[\"GT.M\" QUIT\n ;\n QUIT:'$d(^zmwire(\"monitor\",\"listener\"))\n ;\n n dev,inputr,io,lineNo,pid\n ;\n i input[\"AUTH\" QUIT\n i input[\"QUIT\" QUIT\n i input[\"EXIT\" QUIT\n i input[\"HALT\" QUIT\n s inputr=$re(input)\n i $e(inputr,1,2)'=$c(10,13) s input=input_crlf\n s pid=\"\"\n f s pid=$o(^zmwire(\"monitor\",\"listener\",pid)) q:pid=\"\" d\n . i pid=$j q\n . s lineNo=$o(^zmwire(\"monitor\",\"output\",pid,\"\"),-1)+1\n . s ^zmwire(\"monitor\",\"output\",pid,lineNo)=input\n . ;zsy \"mupip intrpt \"_pid_\" >/dev/null\"\n . zsy \"kill -USR1 \"_pid\n ;\n QUIT\n ;\nmonitoroutput\n ;\n n lineNo\n ;\n s lineNo=\"\"\n f s lineNo=$o(^zmwire(\"monitor\",\"output\",$j,lineNo)) q:lineNo=\"\" d\n . w ^zmwire(\"monitor\",\"output\",$j,lineNo)\n . k ^zmwire(\"monitor\",\"output\",$j,lineNo)\n QUIT\n ;\nlogger(command,initialise)\n ;\n n tot,count\n ;\n i $g(initialise) k ^mwireLogger\n s tot=$increment(^mwireLogger)\n s count=$increment(^mwireLogger(command))\n ;\n QUIT\n ;\ninfo\n ;\n n count,ignore,pid,response\n ;\n s response=\"m_wire_version:\"_$p($t(mwireVersion+1),\";;\",2,2000)_crlf\n s pid=\"\",count=0\n f s pid=$o(^zmwire(\"connected\",pid)) q:pid=\"\" d\n . s ignore=1\n . i pid=$j d\n . . s ignore=0\n . e d\n . . l +^zmwire(\"connected\",pid):0 e s ignore=0\n . i ignore d\n . . l -^zmwire(\"connected\",pid)\n . . k ^zmwire(\"connected\",pid)\n . . k ^zmwire(\"monitor\",\"listener\",pid)\n . e d\n . . s count=count+1\n s response=response_\"connected_clients:\"_count ;_crlf\n s output=\"$\"_$l(response)_crlf_response_crlf\n w output\n QUIT\n ;\nauth(input)\n ;\n n pass\n s pass=$$MD5(input)\n i $d(^zmwire(\"auth\",pass)) d\n . s authNeeded=0\n . s role=^zmwire(\"auth\",pass)\n . s output=\"+OK\"_crlf\n . w output\n e d\n . s output=\"-Invalid password\"_crlf\n . w output\n QUIT\n ;\nsetpassword(input)\n ;\n ; SETPASSWORD secret\n ; +OK \n ;\n ; SETPASSWORD secret admin\n ; +OK\n ;\n n pass,newrole\n ;\n i $d(^zmwire(\"auth\")),role'=\"admin\" s output=\"-Invalid command\"_crlf w output QUIT\n i $$stripSpaces(input)=\"\" s output=\"-Invalid command\"_crlf w output QUIT\n s newrole=\"user\"\n i input[\" \" d\n . s newrole=$p(input,\" \",2)\n . s input=$p(input,\" \",1)\n i '$d(^zmwire(\"auth\")) s newrole=\"admin\"\n i newrole'=\"user\",newrole'=\"admin\" s output=\"-Invalid role\"_crlf w output QUIT\n ;\n s pass=$$MD5(input)\n s ^zmwire(\"auth\",pass)=newrole\n s output=\"+OK\"_crlf\n w output\n QUIT\n ;\ngetGloRef(input)\n ;\n n gloName,gloRef,nb,subs\n ;\n s gloRef=input\n i $e(gloRef,1)'=\"^\" s gloRef=\"^\"_gloRef\n i $e(gloRef,$l(gloRef))=\"]\" s gloRef=$e(gloRef,1,$l(gloRef)-1)\n s gloName=$p(gloRef,\"[\",1)\n s nb=$l(gloRef,\"[\")+2\n s subs=$p(gloRef,\"[\",2,nb)\n i subs=\"\" QUIT gloName\n QUIT gloName_\"(\"_subs_\")\"\n ;\nset(input)\n ;\n n c123,data,gloName,gloRef,i,inputr,json,len,nb,nsp,ok,quot,subs,x\n ;\n ; SET myglobal[\"1\",\"xx yy\",3] 5\n ; hello\n ; +OK\n ; SET myGlo 5\n ; hello\n ; +OK\n ;\n ;n n\n ;s n=$increment(^rob(\"set\"))\n ;s ^rob(\"set\",n)=input\n i input[crlf d\n . s data=$p(input,crlf,2,$l(input))\n . s input=$p(input,crlf,1)\n s nsp=$l(input,\" \")\n s len=$p(input,\" \",nsp)\n i len'=0,+len=0 s output=\"-Data length was not specified\"_crlf w output QUIT\n s gloRef=$p(input,\" \",1,nsp-1)\n i $e(gloRef,1)'=\"^\" s gloRef=\"^\"_gloRef\n i $e(gloRef,$l(gloRef))=\"]\" s gloRef=$e(gloRef,1,$l(gloRef)-1)\n s gloName=$p(gloRef,\"[\",1)\n s nb=$l(gloRef,\"[\")+2\n s subs=$p(gloRef,\"[\",2,nb)\n ; Process Javascript escaping\n i subs'=\"\" s subs=subs_\")\"\n s quot=\"\"\"\"\n i subs'=\"\" f i=1:1:$l(subs)-2 d\n . s c123=$e(subs,i,i+2)\n . i $e(c123,1)'=\"\\\" q\n . i $e(c123,2)=\"\\\" q\n . i $e(c123,2)=quot d q\n . . i $e(c123,3)=\",\" q\n . . i $e(c123,3)=\")\" q\n . . s subs=$e(subs,1,i-1)_quot_quot_$e(subs,i+2,$l(subs))\n i subs[\"\\\\\" d\n . s subs=$$replaceAll(subs,\"\\\\\",$c(5))\n . s subs=$$replaceAll(subs,$c(5),\"\\\")\n s gloRef=gloName\n i gloRef[\"^zmwire\" s output=\"-No access allowed to this global\"_crlf w output QUIT\n i subs'=\"\" s gloRef=gloRef_\"(\"_subs\n i '$d(data) d\n . s data=$$readChars(len)\n . r ok \n . i $d(^zmwire(\"monitor\",\"listener\")) d log(data)\n i data[\"\"\"\" s data=$$replaceAll(data,\"\"\"\",\"\"\"\"\"\")\n i data=\"zmwire_null_value\" s data=\"\"\n s x=\"s \"_gloRef_\"=\"\"\"_data_\"\"\"\"\n i $g(^zewd(\"trace\"))=1 d trace(\"SET x = \"_x)\n s $zt=$$zt()\n x x\n s $zt=\"\"\n s json=\"{\"\"ok\"\":true}\"\n s output=\"$\"_$l(json)_crlf_json_crlf\n w output\n i $g(^zewd(\"trace\"))=1 d trace(\"set: ok:true sent\")\n i $g(^mwire(\"logger\"))=1 d logger(\"set\")\n QUIT\n ;\ngetGlobalList()\n ;\n n arrString,comma,count,glo,gloRef,list,response,x\n ;\n i $zv[\"GT.M\" d\n . s x=\"^%\"\n . i $d(@x) s list(x)=\"\"\n . f s x=$order(@x) q:x=\"\" s list(x)=\"\"\n . ;\n e d\n . d getGlobalList^MDBMCache(.list)\n ;\n ;s count=0,glo=\"\"\n ;f s glo=$o(list(glo)) q:glo=\"\" s count=count+1\n ;s response=\"*\"_count_crlf\n ;w response\n ;i $g(^zewd(\"trace\"))=1 d trace(\"getGlobalList: \"_response_\" sent\") \n ;s glo=\"\"\n ;f s glo=$o(list(glo)) q:glo=\"\" d\n ;. s gloRef=$e(glo,2,$l(glo))\n ;. s response=\"$\"_$l(gloRef)_crlf_gloRef_crlf\n ;. w response\n ;. i $g(^zewd(\"trace\"))=1 d trace(\"getGlobalList: \"_response_\" sent\") \n s arrString=\"[\"\n s glo=\"\",comma=\"\"\n f s glo=$o(list(glo)) q:glo=\"\" d\n . s gloRef=$e(glo,2,$l(glo))\n . s arrString=arrString_comma_\"\"\"\"_gloRef_\"\"\"\"\n . s comma=\",\"\n s arrString=arrString_\"]\"\n s response=\"$\"_$l(arrString)_crlf_arrString_crlf\n w response\n i $g(^zewd(\"trace\"))=1 d trace(\"getGlobalList: \"_response_\" sent\") ;\n QUIT\n ;\ngetGlobals()\n ;\n n arrString,comma,count,glo,gloRef,list,response,x\n ;\n i $zv[\"GT.M\" d\n . s x=\"^%\"\n . i $d(@x) s list(x)=\"\"\n . f s x=$order(@x) q:x=\"\" s list(x)=\"\"\n . ;\n e d\n . d getGlobalList^MDBMCache(.list)\n ;\n s count=0,glo=\"\"\n f s glo=$o(list(glo)) q:glo=\"\" s count=count+1\n s response=\"*\"_count_crlf\n w response\n i $g(^zewd(\"trace\"))=1 d trace(\"getGlobalList: \"_response_\" sent\") \n s glo=\"\"\n f s glo=$o(list(glo)) q:glo=\"\" d\n . s gloRef=$e(glo,2,$l(glo))\n . s response=\"$\"_$l(gloRef)_crlf_gloRef_crlf\n . w response\n . i $g(^zewd(\"trace\"))=1 d trace(\"getGlobalList: \"_response_\" sent\") \n QUIT\n ;\nget(input)\n ;\n n data,exists,gloRef,response,x\n ;\n ; GET myglobal[\"1\",\"xx yy\",3]\n ; $6\n ; foobar\n ;\n s gloRef=$$getGloRef(input)\n i gloRef[\"^zmwire\" s output=\"-No access allowed to this global\"_crlf w output QUIT\n s x=\"s exists=$d(\"_gloRef_\")\"\n s $zt=$$zt()\n x x\n s $zt=\"\"\n i exists'=1,exists'=11 s output=\"$-1\"_crlf w output QUIT\n s x=\"s data=\"_gloRef\n s $zt=$$zt()\n x x\n s $zt=\"\"\n ;\n s response=\"$\"_$l(data)_crlf_data_crlf\n ;\n w response\n i $g(^mwire(\"logger\"))=1 d logger(\"get\")\n QUIT\n ;\ngetGlobal(input)\n ;\n n data,exists,gloRef,json,response,x\n ;\n ; GET myglobal[\"1\",\"xx yy\",3]\n ; $6\n ; foobar\n ;\n s gloRef=$$getGloRef(input)\n i gloRef[\"^zmwire\" s output=\"-No access allowed to this global\"_crlf w output QUIT\n s x=\"s exists=$d(\"_gloRef_\"),\"\n ;x x\n s x=x_\"data=$g(\"_gloRef_\")\"\n s $zt=$$zt()\n x x\n s $zt=\"\"\n s json=\"{\"\"value\"\":\"\"\"_data_\"\"\",\"\"dataStatus\"\":\"_exists_\"}\"\n ;\n s response=\"$\"_$l(json)_crlf_json_crlf\n ;\n w response\n i $g(^zewd(\"trace\"))=1 d trace(\"getGlobal: response=\"_response)\n i $g(^mwire(\"logger\"))=1 d logger(\"getGlobal\")\n QUIT\n ;\nmultiGet(input)\n ;\n n comma,dataStatus,error,exists,globalName,i,json,props,ref,response,subs,value\n ;\n ; MULTIGET myglobal[\n ; {globalName:'xxx', subscripts:[\"x1\",\"y1\"]},\n ; {globalName:'xxx', subscripts:[\"x2\",\"\"]},\n ; {globalName:'xxx', subscripts:[\"x2\",\"y2\"]}\n ;]\n ;\n ;\n s error=$$parseJSON(input,.props,1)\n i error'=\"\" s output=\"-\"_error_crlf w output QUIT\n ;\n s stop=0,error=\"\",json=\"[\",comma=\"\"\n f i=1:1 q:'$d(props(i)) d\n . s dataStatus=0,value=\"\",error=\"\"\n . s globalName=$g(props(i,\"globalName\"))\n . i globalName=\"\" s globalName=$g(props(i,\"GlobalName\"))\n . i globalName=\"\" d\n . . s error=\"globalName not defined\"\n . e d\n . . i $e(globalName,1)'=\"^\" s globalName=\"^\"_globalName\n . . s ref=\"s exists=$d(\"_globalName\n . . s subs=\"\"\n . . i $d(props(i,\"subscripts\")) d\n . . . n comma,j,stop,sub\n . . . s subs=\"(\",comma=\"\",stop=0\n . . . f j=1:1 q:'$d(props(i,\"subscripts\",j)) d q:stop\n . . . . s sub=props(i,\"subscripts\",j)\n . . . . i sub=\"\" s error=\"Subscript \"_j_\" is null\",stop=1 q\n . . . . s subs=subs_comma_\"\"\"\"_props(i,\"subscripts\",j)_\"\"\"\",comma=\",\"\n . . . i error=\"\" s subs=subs_\")\"\n . . i error=\"\" d\n . . . s ref=ref_subs_\")\"\n . . . s $zt=$$zt()\n . . . x ref\n . . . s $zt=\"\"\n . . . i exists d\n . . . . s ref=\"s value=$g(\"_globalName\n . . . . s ref=ref_subs_\")\"\n . . . . s $zt=$$zt()\n . . . . x ref\n . . . . s $zt=\"\"\n . s json=json_comma_\"{\"\"value\"\":\"\"\"_value_\"\"\",\"\"dataStatus\"\":\"_exists_\",\"\"error\"\":\"\"\"_error_\"\"\"}\"\n . s comma=\",\"\n s json=json_\"]\"\n ;\n s response=\"$\"_$l(json)_crlf_json_crlf\n ;\n w response\n i $g(^zewd(\"trace\"))=1 d trace(\"multiGet: response=\"_response)\n QUIT\n ;\nkill(input)\n ;\n n i,glo,gloRef,len,nsp,p1,p2,x\n ;\n ; KILL myglobal[\"1\",\"xx yy\",3]\n ; +OK\n ;\n s glo=input\n s p1=$p(glo,\"[\",1)\n s p2=$p(glo,\"[\",2,2000)\n s p2=$e(p2,1,$l(p2)-1)\n s glo=p1_\"(\"_p2_\")\"\n i glo[\"()\" d\n . s len=$l(glo)\n . i $e(glo,len-1,len)=\"()\" s glo=$e(glo,1,len-2)\n e d\n . ; Process Javascript escaping\n . n c123,quot\n . s quot=\"\"\"\"\n . f i=1:1:$l(glo)-2 d\n . . s c123=$e(glo,i,i+2)\n . . i $e(c123,1)'=\"\\\" q\n . . i $e(c123,2)=\"\\\" q\n . . i $e(c123,2)=quot d q\n . . . i $e(c123,3)=\",\" q\n . . . i $e(c123,3)=\")\" q\n . . . s glo=$e(glo,1,i-1)_quot_quot_$e(glo,i+2,$l(glo))\n . i glo[\"\\\\\" d\n . . s glo=$$replaceAll(glo,\"\\\\\",$c(5))\n . . s glo=$$replaceAll(glo,$c(5),\"\\\")\n ;\n i glo'[\"zmwire\" s glo(glo)=\"\"\n\n s x=\"k ^\"_glo\n s $zt=$$zt()\n x x\n s $zt=\"\"\n s response=\"+ok\"_crlf\n i $g(^%zewd(\"trace\"))=1 d trace(\"kill: response=\"_response)\n w response\n i $g(^mwire(\"logger\"))=1 d logger(\"kill\")\n QUIT\n ;\ndata(input)\n ;\n n data,gloRef,x\n ;\n ; DATA myglobal[\"1\",\"xx yy\",3]\n ; :10\n ;\n s gloRef=$$getGloRef(input)\n i gloRef[\"^zmwire\" s output=\"-No access allowed to this global\"_crlf w output QUIT\n s x=\"s data=$d(\"_gloRef_\")\"\n s $zt=$$zt()\n x x\n s $zt=\"\"\n i $g(^zewd(\"trace\"))=1 d trace(\"input=\"_input_\"; data=\"_data)\n s output=\":\"_data_crlf\n w output\n i $g(^mwire(\"logger\"))=1 d logger(\"data\")\n QUIT\n ;\nrunTransaction(input)\n ;\n n error,globalName,i,json,props,ref,result,stop,subscripts\n ;\n s error=$$parseJSON(input,.props,1)\n i error'=\"\" s output=\"-\"_error_crlf w output QUIT\n ;\n s stop=0,error=\"\"\n f i=1:1 q:'$d(props(i)) d q:stop\n . s method=$g(props(i,\"method\"))\n . i method=\"\" s stop=1,error=\"Missing method in JSON transaction document at step \"_i q\n . i method=\"setJSON\" d q:stop\n . . n json\n . . m json=props(i,\"json\")\n . . i '$d(json) s stop=1,error=\"Missing JSON document in JSON transaction document at step \"_i q\n . . s globalName=$g(props(i,\"globalName\"))\n . . i globalName=\"\" s globalName=$g(props(i,\"GlobalName\"))\n . . i globalName=\"\" s stop=1,error=\"Missing Global name in JSON transaction document at step \"_i q\n . . i $e(globalName,1)'=\"^\" s globalName=\"^\"_globalName\n . . s ref=\"m \"_globalName\n . . i $d(props(i,\"subscripts\")) d\n . . . n comma,j\n . . . s ref=ref_\"(\",comma=\"\"\n . . . f j=1:1 q:'$d(props(i,\"subscripts\",j)) d\n . . . . s ref=ref_comma_\"\"\"\"_props(i,\"subscripts\",j)_\"\"\"\",comma=\",\"\n . . . s ref=ref_\")\"\n . . s ref=ref_\"=json\"\n . . x ref\n . i method=\"setGlobal\" d q:stop\n . . n value\n . . s globalName=$g(props(i,\"globalName\"))\n . . i globalName=\"\" s globalName=$g(props(i,\"GlobalName\"))\n . . i globalName=\"\" s stop=1,error=\"Missing Global name in JSON transaction document at step \"_i q\n . . i $e(globalName,1)'=\"^\" s globalName=\"^\"_globalName\n . . s ref=\"s \"_globalName\n . . i $d(props(i,\"subscripts\")) d\n . . . n comma,j\n . . . s ref=ref_\"(\",comma=\"\"\n . . . f j=1:1 q:'$d(props(i,\"subscripts\",j)) d\n . . . . s ref=ref_comma_\"\"\"\"_props(i,\"subscripts\",j)_\"\"\"\",comma=\",\"\n . . . s value=$g(props(i,\"value\"))\n . . . i value=\"zmwire_null_value\" s value=\"\"\n . . . s ref=ref_\")=\"\"\"_value_\"\"\"\"\n . . x ref\n . i method=\"kill\" d q:stop\n . . s globalName=$g(props(i,\"globalName\"))\n . . i globalName=\"\" s globalName=$g(props(i,\"GlobalName\"))\n . . i globalName=\"\" s stop=1,error=\"Missing Global name in JSON transaction document at step \"_i q\n . . i $e(globalName,1)'=\"^\" s globalName=\"^\"_globalName\n . . s ref=\"k \"_globalName\n . . i $d(props(i,\"subscripts\")) d\n . . . n comma,j\n . . . s ref=ref_\"(\",comma=\"\"\n . . . f j=1:1 q:'$d(props(i,\"subscripts\",j)) d\n . . . . s ref=ref_comma_\"\"\"\"_props(i,\"subscripts\",j)_\"\"\"\",comma=\",\"\n . . . s ref=ref_\")\"\n . . x ref\n ;\n i error'=\"\" s output=\"-\"_error_crlf w output QUIT\n s response=\"+ok\"_crlf\n w response\n i $g(^zewd(\"trace\"))=1 d trace(\"transaction: response=\"_response)\n QUIT\n ;\nsetJSON(input)\n ;\n n arr,del,error,flrc,inputr,gloRef,inputr,json,nb,nsp,props,ref,response,subs\n ;\n ; SETJSONSTRING myglobal[\"1\",\"xx yy\",3] CRLF {\"a\":123} CRLF 1\n ; +ok\n ;\n s flrc=$c(10,13)\n s gloRef=$p(input,crlf,1)\n s input=$p(input,crlf,2,10000)\n s inputr=$re(input)\n s del=$p(inputr,flrc,1),del=$re(del)\n s inputr=$p(inputr,flrc,2,10000) ; in case it contains crlfs\n s json=$re(inputr)\n i $zv[\"GT.M\" d\n . s json=$$unEscape(json)\n e d\n . s json=$$unEscape^MDBMCache(json)\n ;\n i $e(gloRef,1)'=\"^\" s gloRef=\"^\"_gloRef\n i $e(gloRef,$l(gloRef))=\"]\" s gloRef=$e(gloRef,1,$l(gloRef)-1)\n s gloName=$p(gloRef,\"[\",1)\n s nb=$l(gloRef,\"[\")+2\n s subs=$p(gloRef,\"[\",2,nb)\n s gloRef=gloName\n i gloRef[\"^zmwire\" s output=\"-No access allowed to this global\"_crlf w output QUIT\n i subs'=\"\" s gloRef=gloRef_\"(\"_subs_\")\"\n s error=$$parseJSON(json,.props,1)\n i error'=\"\" s output=\"-Invalid JSON in setJSON: \"_json_crlf w output QUIT\n ;\n s ref=\"\"\n i del s ref=\"k \"_gloRef_\" \"\n ;\n s ref=ref_\"m \"_gloRef_\"=props\"\n x ref\n s response=\"+OK\"_crlf\n w response\n i $g(^zewd(\"trace\"))=1 d trace(\"setJSON: response=\"_response)\n i $g(^mwire(\"logger\"))=1 d logger(\"setJSON\")\n ;\n QUIT\n ;\ngetJSON(input)\n ;\n n arr,inputr,gloRef,json,nb,nsp,ref,response,subs\n ;\n ; GETJSONSTRING myglobal[\"1\",\"xx yy\",3]\n ; $5\n ; {x:1}\n ;\n s gloRef=input\n i $e(gloRef,1)'=\"^\" s gloRef=\"^\"_gloRef\n i $e(gloRef,$l(gloRef))=\"]\" s gloRef=$e(gloRef,1,$l(gloRef)-1)\n s gloName=$p(gloRef,\"[\",1)\n s nb=$l(gloRef,\"[\")+2\n s subs=$p(gloRef,\"[\",2,nb)\n s gloRef=gloName\n i gloRef[\"^zmwire\" s output=\"-No access allowed to this global\"_crlf w output QUIT\n i subs'=\"\" s gloRef=gloRef_\"(\"_subs_\")\"\n s ref=\"m arr=\"_gloRef\n x ref\n i '$d(arr) d\n . s response=\"$-1\"_crlf\n e d\n . s json=$$arrayToJSON(\"arr\")\n . s response=\"$\"_$l(json)_crlf_json_crlf\n i $g(^zewd(\"trace\"))=1 d trace(\"getJSON: response=\"_response)\n ;\n w response\n ;\n i $g(^mwire(\"logger\"))=1 d logger(\"getJSON\")\n QUIT\n ;\nincr(input)\n ;\n n data,gloRef,x\n ;\n ; INCR myglobal[\"1\",\"xx yy\",3]\n ; :4\n ;\n s gloRef=$$getGloRef(input)\n i gloRef[\"^zmwire\" s output=\"-No access allowed to this global\"_crlf w output QUIT\n s x=\"s data=$increment(\"_gloRef_\")\"\n s $zt=$$zt()\n x x\n s $zt=\"\"\n s output=\":\"_data_crlf\n w output\n i $g(^mwire(\"logger\"))=1 d logger(\"incr\")\n QUIT\n ;\nincrby(input)\n ;\n n by,data,gloName,gloRef,inputr,len,nb,nsp,ok,subs,x\n ;\n ; INCRBY myglobal[\"1\",\"xx yy\",3] 3\n ; :7\n ;\n s inputr=$re(input)\n s by=$re($p(inputr,\" \",1))\n s nsp=$l(input,\" \")+2\n s gloRef=$p(inputr,\" \",2,nsp)\n s gloRef=$re(gloRef)\n i $e(gloRef,1)'=\"^\" s gloRef=\"^\"_gloRef\n i $e(gloRef,$l(gloRef))=\"]\" s gloRef=$e(gloRef,1,$l(gloRef)-1)\n s gloName=$p(gloRef,\"[\",1)\n s nb=$l(gloRef,\"[\")+2\n s subs=$p(gloRef,\"[\",2,nb)\n s gloRef=gloName\n i gloRef[\"^zmwire\" s output=\"-No access allowed to this global\"_crlf w output QUIT\n i subs'=\"\" s gloRef=gloRef_\"(\"_subs_\")\"\n s x=\"s data=$increment(\"_gloRef_\",\"_by_\")\"\n s $zt=$$zt() x x\n s $zt=\"\"\n s output=\":\"_data_crlf\n w output\n i $g(^mwire(\"logger\"))=1 d logger(\"incrbr\")\n QUIT\n ;\nfunction(input)\n ;\n n data,func,x\n ;\n ; FUNCTION label^rou(\"1\",\"xx yy\")\n ; $5\n ; hello\n ;\n s func=input\n i func[\"^\",$e(func,1,2)'=\"$$\" s func=\"$$\"_func\n i func[\"class(\",$e(func,1,2)'=\"##\" s func=\"##\"_func\n s x=\"s data=\"_func\n s $zt=$$zt()\n x x\n s $zt=\"\"\n s output=\"$\"_$l(data)_crlf_data_crlf\n w output\n i $g(^mwire(\"logger\"))=1 d logger(\"function\")\n QUIT\n ;\ndecr(input)\n ;\n n data,gloRef,x\n ;\n ; DECR myglobal[\"1\",\"xx yy\",3]\n ; :3\n ;\n s gloRef=$$getGloRef(input)\n i gloRef[\"^zmwire\" s output=\"-No access allowed to this global\"_crlf w output QUIT\n s x=\"s data=$increment(\"_gloRef_\",-1)\"\n s $zt=$$zt() x x\n s $zt=\"\"\n s output=\":\"_data_crlf\n w output\n i $g(^mwire(\"logger\"))=1 d logger(\"decr\")\n QUIT\n ;\ndecrby(input)\n ;\n n by,data,gloName,gloRef,inputr,nb,nsp,ok,subs,x\n ;\n ; DECRBY myglobal[\"1\",\"xx yy\",3] 3\n ; :4\n ;\n s inputr=$re(input)\n s by=$re($p(inputr,\" \",1))\n s nsp=$l(input,\" \")+2\n s gloRef=$p(inputr,\" \",2,nsp)\n s gloRef=$re(gloRef)\n i $e(gloRef,1)'=\"^\" s gloRef=\"^\"_gloRef\n i $e(gloRef,$l(gloRef))=\"]\" s gloRef=$e(gloRef,1,$l(gloRef)-1)\n s gloName=$p(gloRef,\"[\",1)\n s nb=$l(gloRef,\"[\")+2\n s subs=$p(gloRef,\"[\",2,nb)\n s gloRef=gloName\n i gloRef[\"^zmwire\" s output=\"-No access allowed to this global\"_crlf w output QUIT\n i subs'=\"\" s gloRef=gloRef_\"(\"_subs_\")\"\n s x=\"s data=$increment(\"_gloRef_\",-\"_by_\")\"\n s $zt=$$zt()\n x x\n s $zt=\"\"\n s output=\":\"_data_crlf\n w output\n i $g(^mwire(\"logger\"))=1 d logger(\"decrby\")\n QUIT\n ;\nnextSubscript(input,direction)\n ;\n n data,gloRef,response,subscript,x,value\n ;\n ; NEXTSUBSCRIPT myglobal[\"1\",\"xx yy\",\"\"]\n ; +abc\n ;\n s gloRef=$$getGloRef(input)\n i gloRef[\"^zmwire\" s output=\"-No access allowed to this global\"_crlf w output QUIT\n s x=\"s subscript=$o(\"_gloRef_\",direction)\"\n s $zt=$$zt()\n x x\n s $zt=\"\"\n s value=\"\",data=0\n i subscript'=\"\" d\n . s value=$g(^(subscript))\n . s data=$d(^(subscript))\n ;\n s response=\"{\"\"subscriptValue\"\":\"\"\"_subscript_\"\"\",\"\n s response=response_\"\"\"dataStatus\"\":\"_data_\",\"\n s response=response_\"\"\"dataValue\"\":\"\"\"_value_\"\"\"}\"\n ;\n s response=\"$\"_$l(response)_crlf_response_crlf\n i $g(^zewd(\"trace\"))=1 d trace(\"nextsubscript: response=\"_response)\n w response\n i $g(^mwire(\"logger\"))=1 d logger(\"nextsubscript\")\n ;\n QUIT\n ;\norder(input)\n ;\n n data,gloRef,x\n ;\n ; ORDER myglobal[\"1\",\"xx yy\",\"\"]\n ; +abc\n ;\n s gloRef=$$getGloRef(input)\n i gloRef[\"^zmwire\" s output=\"-No access allowed to this global\"_crlf w output QUIT\n s x=\"s data=$o(\"_gloRef_\")\"\n s $zt=$$zt()\n x x\n s $zt=\"\"\n i data=\"\" s output=\"$-1\"_crlf w output QUIT\n s output=\"$\"_$l(data)_crlf_data_crlf\n w output\n i $g(^mwire(\"logger\"))=1 d logger(\"order\")\n QUIT\n ;\nreverseorder(input)\n ;\n n data,gloRef,x\n ;\n ; REVORDER myglobal[\"1\",\"xx yy\",\"\"]\n ; +abc\n ;\n s gloRef=$$getGloRef(input)\n i gloRef[\"^zmwire\" s output=\"-No access allowed to this global\"_crlf w output QUIT\n s x=\"s data=$o(\"_gloRef_\",-1)\"\n s $zt=$$zt()\n x x\n s $zt=\"\"\n i data=\"\" s output=\"$-1\"_crlf w output QUIT\n s output=\"$\"_$l(data)_crlf_data_crlf\n w output\n i $g(^mwire(\"logger\"))=1 d logger(\"reverseorder\")\n QUIT\n ;\nquery(input)\n ;\n n data,gloRef,nb,p1,p2,x\n ;\n ; QUERY myglobal[\"1\",\"xx yy\"]\n ;\n s gloRef=$$getGloRef(input)\n i gloRef[\"^zmwire\" s output=\"-No access allowed to this global\"_crlf w output QUIT\n s x=\"s data=$q(\"_gloRef_\")\"\n s $zt=$$zt()\n ;d trace(\"query x=\"_x)\n x x\n i data=\"\" s output=\"$-1\"_crlf w output QUIT\n s data=$e(data,2,$l(data))\n ;d trace(\"data=\"_data)\n s p1=$p(data,\"(\",1)\n s nb=$l(data,\"(\")+2\n ;d trace(\"nb=\"_nb)\n s p2=$p(data,\"(\",2,nb)\n ;d trace(\"1 p2=\"_p2)\n s p2=$e(p2,1,$l(p2)-1)\n ;d trace(\"2 p2=\"_p2)\n s data=p1_\"[\"_p2_\"]\"\n s output=\"$\"_$l(data)_crlf_data_crlf\n w output\n s $zt=\"\"\n i $g(^mwire(\"logger\"))=1 d logger(\"query\")\n QUIT\n ;\nqueryget(input)\n ;\n n data,gloRef,nb,odata,p1,p2,value,x\n ;\n ; QUERYGET myglobal[\"1\",\"xx yy\"]\n ;\n s gloRef=$$getGloRef(input)\n i gloRef[\"^zmwire\" s output=\"-No access allowed to this global\"_crlf w output QUIT\n s x=\"s data=$q(\"_gloRef_\")\"\n s $zt=$$zt()\n x x\n i data=\"\" s output=\"$-1\"_crlf w output QUIT\n s odata=data\n s output=\"*2\"_crlf\n w output\n s data=$e(data,2,$l(data))\n s p1=$p(data,\"(\",1)\n s nb=$l(data,\"(\")+2\n s p2=$p(data,\"(\",2,nb)\n s p2=$e(p2,1,$l(p2)-1)\n s data=p1_\"[\"_p2_\"]\"\n s output=\"$\"_$l(data)_crlf_data_crlf\n w output\n s value=@odata\n s output=\"$\"_$l(value)_crlf_value_crlf\n w output\n s $zt=\"\"\n i $g(^mwire(\"logger\"))=1 d logger(\"queryget\")\n QUIT\n ;\nlock(input)\n ;\n n gloName,gloRef,inputr,nb,nsp,ok,subs,time,x\n ;\n ; LOCK myglobal[\"1\",\"xxyy\"] 5\n ; +OK\n ;\n s inputr=$re(input)\n s time=$re($p(inputr,\" \",1))\n i time?1N.N d\n . s nsp=$l(input,\" \")+2\n . s gloRef=$p(inputr,\" \",2,nsp)\n e d\n . s time=5\n . s gloRef=inputr\n s gloRef=$re(gloRef)\n i $e(gloRef,1)'=\"^\" s gloRef=\"^\"_gloRef\n i $e(gloRef,$l(gloRef))=\"]\" s gloRef=$e(gloRef,1,$l(gloRef)-1)\n s gloName=$p(gloRef,\"[\",1)\n i gloRef[\"^zmwire\" s output=\"-No access allowed to this global\"_crlf w output QUIT\n s nb=$l(gloRef,\"[\")+2\n s subs=$p(gloRef,\"[\",2,nb)\n s gloRef=gloName\n i subs'=\"\" s gloRef=gloRef_\"(\"_subs_\")\"\n s x=\"s ok=1 l +\"_gloRef_\":\"_time_\" e s ok=0\"\n s $zt=$$zt()\n x x\n s $zt=\"\"\n s output=\":\"_ok_crlf\n w output\n QUIT\n ;\nunlock(input)\n ;\n n gloRef,x\n ;\n ; UNLOCK myglobal[\"1\",\"xxyy\"]\n ; +OK\n ;\n s gloRef=$$getGloRef(input)\n i gloRef[\"^zmwire\" s output=\"-No access allowed to this global\"_crlf w output QUIT\n s x=\"l -\"_gloRef\n s $zt=$$zt()\n x x\n s $zt=\"\"\n s output=\"+OK\"_crlf\n w output\n QUIT\n ;\ngetAllSubscripts(input)\n ;\n n comma,data,exists,from,i,gloRef,len,numericEnd,rec,ref\n n stop,subscripts,subs,subs1,to,x\n ;\n ; GETSUBSCRIPTS myglobal[\"1\",\"xx yy\"] fromValue toValue\n ; \n s gloRef=$p(input,$c(1),1)\n s gloRef=$$getGloRef(gloRef)\n s from=$p(input,$c(1),2)\n i from=\"zz-null\" s from=\"\"\n s to=$p(input,$c(1),3)\n i to=\"zz-null\" s to=\"\"\n s numericEnd=$$numeric(to)\n ;d trace(\"to=\"_to_\": numeric = \"_numericEnd)\n ;\n i gloRef[\"^zmwire\" s output=\"-No access allowed to this global\"_crlf w output QUIT\n i $e(gloRef,$l(gloRef))=\")\" d\n . s x=\"s exists=$d(\"_gloRef_\")\"\n . s gloRef=$e(gloRef,1,$l(gloRef)-1)_\",\"\n e d\n . s x=\"s exists=$d(\"_gloRef_\")\"\n . s gloRef=gloRef_\"(\"\n s $zt=$$zt()\n x x\n s $zt=\"\"\n i 'exists!(exists=1) s output=\"$2\"_crlf_\"[]\"_crlf w output QUIT\n ;\n s subs=from\n s subs1=subs i subs1[\"\"\"\" s subs1=$$replaceAll(subs1,\"\"\"\",\"\"\"\"\"\")\n i from'=\"\" d\n . s x=\"s subs1=$o(\"_gloRef_\"\"\"\"_subs1_\"\"\"),-1)\"\n . ;d trace(\"1 x=\"_x)\n . x x\n s x=\"s subs=$o(\"_gloRef_\"\"\"\"_subs1_\"\"\"))\"\n x x\n s len=3+$l(subs)\n s comma=\",\",stop=0\n i subs'=\"\" d\n . f s subs=$o(^(subs)) q:stop d\n . . i subs=\"\" s stop=1 q\n . . i to'=\"\" d q:stop\n . . . i numericEnd d\n . . . . ;d trace(\"numeric: subs=\"_subs_\": to=\"_to)\n . . . . i $$numeric(subs),subs>to s stop=1\n . . . e d\n . . . . i subs]to s stop=1\n . . s len=len+$l(comma)+2+$l(subs)\n ;d trace(\"3 len=\"_len)\n s len=len+1\n s response=\"$\"_len_crlf\n w response\n ;\n s x=\"s subs=$o(\"_gloRef_\"\"\"\"_subs1_\"\"\"))\"\n ;d trace(\"4 x=\"_x)\n ;d trace(\"xx to=\"_to)\n x x\n s response=\"[\"\"\"_subs_\"\"\"\"\n w response\n i subs'=\"\" d\n . s stop=0\n . f s subs=$o(^(subs)) q:stop d\n . . i subs=\"\" s stop=1 q\n . . i to'=\"\" d q:stop\n . . . i numericEnd d\n . . . . ;d trace(\"numeric: subs=\"_subs_\": to=\"_to)\n . . . . i $$numeric(subs),subs>to s stop=1\n . . . e d\n . . . . i subs]to s stop=1\n . . s response=comma_\"\"\"\"_subs_\"\"\"\"\n . . w response\n ;d trace(\"5 response=\"_response)\n s response=\"]\"_crlf\n w response\n i $g(^mwire(\"logger\"))=1 d logger(\"getallsubscripts\")\n ;\n QUIT\n ;\norderall(input)\n ;\n n data,exists,i,gloRef,rec,subs,subs1,x\n ;\n ; ORDERALL myglobal[\"1\",\"xx yy\"] \n ; *6\n ; $2\n ; aa\n ; $5\n ; hello\n ; $2\n ; bb\n ; $5\n ; world\n ; $3\n ; bba\n ; $-1\n ; \n s gloRef=$$getGloRef(input)\n i gloRef[\"^zmwire\" s output=\"-No access allowed to this global\"_crlf w output QUIT\n i $e(gloRef,$l(gloRef))=\")\" d\n . s x=\"s exists=$d(\"_gloRef_\")\"\n . s gloRef=$e(gloRef,1,$l(gloRef)-1)_\",\"\n e d\n . s x=\"s exists=$d(\"_gloRef_\")\"\n . s gloRef=gloRef_\"(\"\n s $zt=$$zt()\n x x\n i 'exists s output=\"$-1\"_crlf w output QUIT\n ;\n s subs=\"\",rec=0\n k ^CacheTempEWD($j)\n f d q:subs=\"\"\n . s subs1=subs i subs1[\"\"\"\" s subs1=$$replaceAll(subs1,\"\"\"\",\"\"\"\"\"\")\n . s x=\"s subs=$o(\"_gloRef_\"\"\"\"_subs1_\"\"\"))\"\n . x x\n . i subs=\"\" q\n . s rec=rec+1\n . s ^CacheTempEWD($j,rec)=\"$\"_$l(subs)_crlf_subs_crlf\n . s x=\"s exists=$d(\"_gloRef_\"\"\"\"_subs_\"\"\"))\"\n . x x\n . i exists=1!(exists=11) d\n . . s x=\"s data=\"_gloRef_\"\"\"\"_subs_\"\"\")\"\n . . x x\n . . s rec=rec+1\n . . s ^CacheTempEWD($j,rec)=\"$\"_$l(data)_crlf_data_crlf\n . e d\n . . s rec=rec+1\n . . s ^CacheTempEWD($j,rec)=\"$-1\"_crlf\n s $zt=\"\"\n s output=\"*\"_rec_crlf\n w output\n f i=1:1:rec w ^CacheTempEWD($j,i)\n k ^CacheTempEWD($j)\n i $g(^mwire(\"logger\"))=1 d logger(\"orderall\")\n QUIT\n ;\nmergefrom(input)\n ;\n n data,gloRef,i,params,resp,start,x\n ;\n ; MERGEFROM myglobal[\"1\",\"a\"]\n ; *6\n ; $1\n ; 1 \n ; $5\n ; hello \n ; $9\n ; 1,\"a\\\"aa\" note escaping\n ; $5\n ; world\n ; $8\n ; 2,\"cccc\"\n ; $3\n ; foo\n ;\n s gloRef=$$getGloRef(input)\n i gloRef[\"^zmwire\" s output=\"-No access allowed to this global\"_crlf w output QUIT\n k ^CacheTempEWD($j)\n s x=\"m ^CacheTempEWD($j)=\"_gloRef\n s $zt=$$zt()\n x x\n s $zt=\"\"\n s x=$q(^CacheTempEWD($j,\"\"))\n i x=\"\" d QUIT\n . s output=\"*-1\"_crlf \n . w output \n . k ^CacheTempEWD($j)\n f i=1:1 s x=$q(@x) q:x=\"\"\n i $d(^CacheTempEWD($j))=1!($d(^CacheTempEWD($j))=11) s i=i+1\n s output=\"*\"_(i*2)_crlf\n w output\n i $d(^CacheTempEWD($j))=1!($d(^CacheTempEWD($j))=11) d\n . s output=\"$-1\"_crlf\n . w output\n . s output=\"$\"_$l(^CacheTempEWD($j))_crlf_^CacheTempEWD($j)_crlf\n . w output\n s x=$q(^CacheTempEWD($j,\"\"))\n s start=\"^CacheTempEWD(\"_$j_\",\"\n s params=$p(x,start,2,2000)\n s params=$e(params,1,$l(params)-1)\n s resp=params\n s output=\"$\"_$l(resp)_crlf_resp_crlf\n w output\n s data=@x\n s output=\"$\"_$l(data)_crlf_data_crlf \n w output\n f i=1:1 s x=$q(@x) q:x=\"\" d\n . s params=$p(x,start,2,2000)\n . s params=$e(params,1,$l(params)-1)\n . s resp=params\n . s output=\"$\"_$l(resp)_crlf_resp_crlf \n . w output\n . s data=@x\n . i data=\"\" d\n . . s output=\"$-1\"_crlf\n . . w output\n . e d\n . . s output=\"$\"_$l(data)_crlf_data_crlf \n . . w output\n k ^CacheTempEWD($j)\n QUIT\n ;\nmergeto(input)\n ;\n n data,dataLength,error,gloRef,i,key,keyLength,noOfRecs,x\n ;\n ; MERGETO myglobal[\"1\",\"a\"]\n ; *6\n ; $1\n ; 1 \n ; $5\n ; hello \n ; $7\n ; 1,\"aaa\" \n ; $5\n ; world \n ; $8\n ; 2,\"cccc\"\n ; $3\n ; foo\n ; +OK\n ; note $-1 for key length means no key - data put at top level\n ;\n s $zt=$$zt()\n s gloRef=$$getGloRef(input)\n i gloRef[\"^zmwire\" s output=\"-No access allowed to this global\"_crlf w output QUIT\n i $e(gloRef,$l(gloRef))=\")\" s gloRef=$e(gloRef,1,$l(gloRef)-1)\n ;\n r noOfRecs\n i $e(noOfRecs,1)'=\"*\" s output=\"-Invalid: expected number of records\"_crlf w output QUIT\n s noOfRecs=+$e(noOfRecs,2,$l(noOfRecs))\n i noOfRecs'?1N.N s output=\"-Invalid format for number of records\"_crlf w output QUIT\n i noOfRecs=0 QUIT \"+OK\"_crlf QUIT\n i (noOfRecs#2)=1 s output=\"-Invalid: no of records must be an even number\"_crlf w output QUIT\n s noOfRecs=noOfRecs/2\n k ^CacheTempEWD($j)\n s error=\"\"\n k ^CacheTempEWD($j)\n f i=1:1:noOfRecs d q:error'=\"\"\n . r keyLength\n . i $e(keyLength,1)'=\"$\" s error=\"Invalid record \"_i_\": record length\" q\n . s keyLength=+$e(keyLength,2,$l(keyLength))\n . i keyLength=-1 d\n . . s key=\"\"\n . e d\n . . i keyLength'?1N.N s error=\"Invalid record \"_i_\": bad format for record length\" q\n . . i keyLength=0 s error=\"Invalid record \"_i_\": record length cannot be zero\" q\n . . s key=$$readChars(keyLength)\n . . r ok d log(key)\n . . ;r key#keyLength,ok d log(key)\n . . i key[\"\\\"\"\" s key=$$replaceAll(key,\"\\\"\"\",\"\"\"\"\"\")\n . i error'=\"\" q\n . r dataLength\n . i $e(dataLength,1)'=\"$\" s error=\"Invalid record \"_i_\": expected data length\" q\n . s dataLength=+$e(dataLength,2,$l(dataLength))\n . i dataLength'=-1,dataLength'?1N.N s error=\"Invalid record \"_i_\": bad format for data length\" q\n . i dataLength=-1 d\n . . s data=\"\"\n . e d\n . . s data=$$readChars(dataLength)\n . . r ok\n . . d log(data)\n . . ;r data#dataLength,ok d log(data)\n . . i data[\"\"\"\" s data=$$replaceAll(data,\"\"\"\",\"\"\"\"\"\")\n . i key=\"\" d\n . . n gloRef1\n . . s gloRef1=gloRef\n . . i gloRef[\"(\" s gloRef1=gloRef1_\")\"\n . . s x=\"s \"_gloRef1_\"=\"\"\"_data_\"\"\"\"\n . e d\n . . n gloRef1\n . . s gloRef1=gloRef\n . . i gloRef'[\"(\" d\n . . . s gloRef1=gloRef1_\"(\"\n . . e d\n . . . s gloRef1=gloRef1_\",\"\n . . s x=\"s \"_gloRef1_key_\")=\"\"\"_data_\"\"\"\"\n . s ^CacheTempEWD($j,i)=x\n i error'=\"\" s output=\"-\"_error_crlf w output QUIT\n f i=1:1:noOfRecs d\n . s x=^CacheTempEWD($j,i)\n . x x\n k ^CacheTempEWD($j)\n s output=\"+OK\"_crlf\n w output\n s $zt=\"\"\n QUIT\n ;\ncopy(input)\n ;\n n fromGlo,killToFirst,p2,response,toGlo,x\n ;\n ; COPY fromGlobal[\"1\",\"a\"] toGlobal[\"x\"] 1\n i $g(^%zewd(\"trace\"))=1 d trace(\"copy: input=\"_input)\n s $zt=$$zt()\n s fromGlo=$p(input,$c(1),1)\n s toGlo=$p(input,$c(1),2)\n s killToFirst=$p(input,$c(1),3)\n s p2=$p(fromGlo,\"[\",2,2000)\n s p2=$e(p2,1,$l(p2)-1)\n i p2'=\"\" s p2=\"(\"_p2_\")\"\n s fromGlo=\"^\"_$p(fromGlo,\"[\",1)_p2\n s p2=$p(toGlo,\"[\",2,2000)\n s p2=$e(p2,1,$l(p2)-1)\n i p2'=\"\" s p2=\"(\"_p2_\")\"\n s toGlo=\"^\"_$p(toGlo,\"[\",1)_p2\n s x=\"\"\n i killToFirst s x=\"k \"_toGlo_\" \"\n s x=x_\"m \"_toGlo_\"=\"_fromGlo\n x x\n ;\n i $g(^%zewd(\"trace\"))=1 d trace(\"x=\"_x)\n s response=\"+ok\"_crlf\n i $g(^%zewd(\"trace\"))=1 d trace(\"copy: response=\"_response)\n w response\n s $zt=\"\"\n i $g(^mwire(\"logger\"))=1 d logger(\"copy\")\n ;\n QUIT\n ;\nmdate\n ;\n n date,day,time\n ;\n s date=$h\n s day=+date\n s output=\"*2\"_crlf_\"$\"_$l(day)_crlf_day_crlf\n w output\n s time=$p(date,\",\",2)\n s output=\"$\"_$l(time)_crlf_time_crlf\n w output\n QUIT\n ;\ntstart\n s $zt=$$zt()\n TSTART\n s output=\"+OK\"_crlf\n w output\n s $zt=\"\"\n QUIT\n ;\ntcommit\n s $zt=$$zt()\n TCOMMIT\n s output=\"+OK\"_crlf\n w output\n s $zt=\"\"\n QUIT\n ;\ntrollback\n s $zt=$$zt()\n TROLLBACK\n s output=\"+OK\"_crlf\n w output\n s $zt=\"\"\n QUIT\n ;\nzv\n s output=\"+\"_$zv_crlf\n w output\n QUIT\n ;\nzt()\n i $zv[\"GT.M\" QUIT \"g executeError^zmwire\"\n QUIT \"executeError^zmwire\"\n ;\nprocessid\n s output=\":\"_$j_crlf\n w output\n QUIT\n ;\nping\n s output=\"+PONG\"_crlf\n w output\n QUIT\n ;\nexecuteError\n s output=\"-Invalid Command\"_crlf\n w output\n g loop\n ;\nreplaceAll(InText,FromStr,ToStr) ; Replace all occurrences of a substring\n ;\n n p\n ;\n s p=InText\n i ToStr[FromStr d QUIT p\n . n i,stop,tempText,tempTo\n . s stop=0\n . f i=0:1:255 d q:stop\n . . q:InText[$c(i)\n . . q:FromStr[$c(i)\n . . q:ToStr[$c(i)\n . . s stop=1\n . s tempTo=$c(i)\n . s tempText=$$replaceAll(InText,FromStr,tempTo)\n . s p=$$replaceAll(tempText,tempTo,ToStr)\n f q:p'[FromStr S p=$$replace(p,FromStr,ToStr)\n QUIT p\n ;\nreplace(InText,FromStr,ToStr) ; replace old with new in string\n ;\n n np,p1,p2\n ;\n i InText'[FromStr q InText\n s np=$l(InText,FromStr)+1\n s p1=$p(InText,FromStr,1),p2=$p(InText,FromStr,2,np)\n QUIT p1_ToStr_p2\n ;\nreadChars(length)\n ;\n n data,i,x\n ;\n s data=\"\"\n f i=1:1:length r *x s data=data_$c(x)\n QUIT data\n ;\nstripSpaces(string)\n i $zv[\"Cache\" QUIT $$stripSpaces^MDBMCache(string)\n ;\n s string=$$stripLeadingSpaces(string)\n QUIT $$stripTrailingSpaces(string)\n ;\nstripLeadingSpaces(string)\n ;\n n i\n ;\n f i=1:1:$l(string) QUIT:$e(string,i)'=\" \"\n QUIT $e(string,i,$l(string))\n ;\nstripTrailingSpaces(string)\n ;\n n i,spaces,new\n ;\n s spaces=$$makeString(\" \",100)\n s new=string_spaces\n QUIT $p(new,spaces,1)\n ;\nmakeString(char,len) ; create a string of len characters\n ;\n n str\n ;\n s str=\"\",$p(str,char,len+1)=\"\"\n QUIT str\n ;\nMD5(string)\n ;\n ; n hash\n ;\n i $zv[\"Cache\" QUIT $$MD5^MDBMCache(string)\n ;\n QUIT $$MD5^%ZMGWSIS(string,1,1)\n ;\nunEscape(string)\n ;\n n buf,outstring,p1,p2,hex,asc\n ;\n s buf=string\n s outstring=\"\"\n f q:buf'[\"%\" d\n . s p1=$p(buf,\"%\",1)\n . s outstring=outstring_p1\n . s p2=$p(buf,\"%\",2,50000)\n . i $e(p2)=\"u\" s buf=$e(p2,6,9999),hex=$e(p2,2,5),outstring=outstring_$c($$hex2Ascii(hex)-1264) q\n . s hex=$e(p2,1,2)\n . s buf=$e(p2,3,$l(p2))\n . s asc=$$hex2Ascii(hex)\n . s outstring=outstring_$c(asc)\n QUIT (outstring_buf)\n ;\nhex2Ascii(string)\n ;\n n asc,c,conv,err,i,n,power\n ;\n s string=$zconvert(string,\"U\")\n s asc=0\n f i=0:1:9 S conv(i)=i\n s conv(\"A\")=10\n s conv(\"B\")=11\n s conv(\"C\")=12\n s conv(\"D\")=13\n s conv(\"E\")=14\n s conv(\"F\")=15\n s n=-1,err=0\n f i=$l(string):-1:1 d q:err\n . s n=n+1\n . s power=16**n\n . s c=$e(string,i)\n . i '$d(conv(c)) s err=1 q\n . s asc=asc+(conv(c)*power)\n i err QUIT \"-1\"\n QUIT asc\n ;\nts()\n s last=$g(^zmwire(\"lastts\"))\n n io,p,resp\n s io=$io\n s p=\"time\"\n o p:(COMMAND=\"date +%s%N\":READONLY)::\"PIPE\"\n u p\n r resp q:$ZEOF\n c p\n u io\n s ^zmwire(\"lastts\")=resp\n QUIT ((resp-last)/1000000000)\n ;\nrelinkRoutines()\n n list,rou,xrou\n i $g(^zewd(\"trace\"))=1 d trace(\"Process \"_$j_\": Relinking...\")\n s rou=\"\"\n f s rou=$view(\"RTNNEXT\",rou) q:rou=\"\" d\n . i rou=\"zmwire\" q\n . i rou=\"%zewdGTMRuntime\" q\n . i rou=\"%zewdPHP\" q\n . i rou=\"MDB\" q\n . i rou=\"ewdWLewdmgrrelink\" q\n . i rou=\"%ZMGWSI\" q\n . i rou=\"%ZMGWSIS\" q\n . i rou=\"GTM$DMOD\" q\n . s xrou=rou\n . i $e(xrou,1)=\"%\" s xrou=\"_\"_$e(xrou,2,$l(xrou))\n . zl xrou\n . i $g(^zewd(\"trace\"))=1 d trace(\"relinked \"_rou)\n s ^zmwire(\"relink\",\"process\",$j)=\"\"\n i $g(^zewd(\"trace\"))=1 d trace(\"Process \"_$j_\": Relinking complete\")\n QUIT \"\"\n ;\nrelink ;\n s ^zmwire(\"relink\")=1\n k ^zmwire(\"relink\",\"process\")\n QUIT\n ;\narrayToJSON(name)\n n a,buff,c,json,subscripts\n i '$d(@name) QUIT \"[]\"\n s json=$$walkArray(\"\",name)\n ; Encode UTF-8 characters\n s buff=\"\"\n f i=1:1:$l(json) d\n . s c=$e(json,i)\n . s a=$a(c)\n . i a>160 d\n . . i a<192 d\n . . . s buff=buff_$c(194)_c\n . . e d\n . . . s buff=buff_$c(195)_$c(a-64)\n . e d\n . . s buff=buff_c\n QUIT buff\n ;\nwalkArray(json,name,subscripts)\n ;\n n allNumeric,arrComma,brace,comma,count,cr,dd,i,no,numsub,dblquot,quot\n n ref,sub,subNo,subscripts1,type,valquot,value,xref,zobj\n ;\n s cr=$c(13,10),comma=\",\"\n s (quot,dblquot,valquot)=\"\"\"\"\n s dd=$d(@name)\n i dd=1!(dd=11) d i dd=1 QUIT json\n . s value=@name\n . i value'[\">\" q\n . s json=$$walkArray(json,value,.subscripts)\n s ref=name_\"(\"\n s no=$o(subscripts(\"\"),-1)\n i no>0 f i=1:1:no d\n . i subscripts(i)[quot s subscripts(i)=$$replaceAll(subscripts(i),quot,quot_quot)\n . i subscripts(i)?.\"-\"1N.N s quot=\"\"\n . s ref=ref_quot_subscripts(i)_quot_\",\"\n . s quot=dblquot\n s ref=ref_\"sub)\"\n s sub=\"\",numsub=0,subNo=0,count=0\n s allNumeric=1\n f s sub=$o(@ref) q:sub=\"\" d q:'allNumeric\n . i sub'?1N.N s allNumeric=0\n . s count=count+1\n . i sub'=count s allNumeric=0\n ;i allNumeric,count=1 s allNumeric=0\n s allNumeric=0\n i allNumeric d\n . s json=json_\"[\"\n e d\n . s json=json_\"{\"\n s sub=\"\"\n f s sub=$o(@ref) q:sub=\"\" d\n . s subscripts(no+1)=sub\n . s subNo=subNo+1\n . s dd=$d(@ref)\n . i dd=1 d\n . . s value=@ref\n . . ;i value[\"\\\" s value=$$replaceAll(value,\"\\\",\"\\\\\")\n . . s value=$$removeControlChars(value)\n . . i 'allNumeric d\n . . . ;i sub[\"\\\",sub'[\"\\\\\",sub'[\"\\\"\"\" s sub=$$replaceAll(sub,\"\\\",\"\\\\\")\n . . . i sub[\"\\\" s sub=$$replaceAll(sub,\"\\\",\"\\\\\")\n . . . s sub=$$removeControlChars(sub)\n . . . s json=json_\"\"\"\"_sub_\"\"\":\"\n . . s type=\"literal\"\n . . i $$numeric(value) s type=\"numeric\"\n . . i value=\"true\"!(value=\"false\") s type=\"boolean\"\n . . i $e(value,1)=\"{\",$e(value,$l(value))=\"}\" s type=\"variable\"\n . . i type=\"literal\" d\n . . . ;i value[quot s value=$$replaceAll(value,quot,\"\\\"_quot)\n . . . ;i value[\"\\\",value'[\"\\\\\",value'[\"\\\"\"\" s value=$$replaceAll(value,\"\\\",\"\\\\\")\n . . . i value[\"\\\" s value=$$replaceAll(value,\"\\\",\"\\\\\")\n . . . i value[quot s value=$$replaceAll(value,quot,\"\\\"\"\")\n . . . s value=valquot_value_valquot\n . . d\n . . . s json=json_value_\",\"\n . k subscripts1\n . m subscripts1=subscripts\n . i dd>9 d\n . . n subx\n . . ;i sub?1N.N d\n . . ;. i subNo=1 d\n . . ;. . s numsub=1\n . . ;. . s json=$e(json,1,$l(json)-1)_\"[\"\n . . ;e d\n . . ;. s json=json_\"\"\"\"_sub_\"\"\":\"\n . . ;i sub[\"\\\",sub'[\"\\\\\",sub'[\"\\\"\"\" s sub=$$replaceAll(sub,\"\\\",\"\\\\\")\n . . s subx=sub\n . . i subx[\"\\\" s subx=$$replaceAll(sub,\"\\\",\"\\\\\")\n . . i subx[quot s subx=$$replaceAll(subx,quot,\"\\\"\"\")\n . . s subx=$$removeControlChars(subx)\n . . s json=json_\"\"\"\"_subx_\"\"\":\"\n . . s json=$$walkArray(json,name,.subscripts1)\n . . d\n . . . s json=json_\",\"\n ;\n s json=$e(json,1,$l(json)-1)\n i allNumeric d\n . s json=json_\"]\"\n e d\n . s json=json_\"}\"\n QUIT json ; exit!\n ;\ntrace(text,clear) ; trace ;\n n i\n s text=$g(text)\n i $g(clear)=1 k ^%zewdTrace\n s i=$increment(^%zewdTrace)\n s ^%zewdTrace(i)=text\n QUIT\n ;\nparseJSON(jsonString,propertiesArray,mode)\n ;\n n array,arrRef,buff,c,error\n ;\n k propertiesArray\n s error=\"\"\n s buff=$g(jsonString)\n s buff=$$replaceAll(buff,\"\\\"\"\",\"\\'\")\n s arrRef=\"array\"\n s c=$e(buff,1)\n s buff=$e(buff,2,$l(buff))\n d\n . i c=\"{\" d q\n . . n prefix\n . . s prefix=\"\"\"zobj1\"\"\"\n . . i $g(mode)=1 s prefix=\"\"\n . . s error=$$parseJSONObject(.buff,prefix)\n . . q:error\n . . i buff'=\"\" s error=1\n . i c=\"[\" d q\n . . n prefix\n . . s prefix=1\n . . i $g(mode)=1 s prefix=\"\"\n . . s error=$$parseJSONArray(.buff,prefix)\n . . q:error\n . . i buff'=\"\" s error=1\n . s error=1\n i error=1 QUIT \"Invalid JSON\"\n m propertiesArray=array\n QUIT \"\"\n ;\nparseJSONObject(buff,subs)\n n c,error,name,stop,subs2,value,x\n s stop=0,name=\"\",error=\"\"\n f d q:stop\n . s c=$e(buff,1)\n . i c=\"\" s error=1,stop=1 q\n . s buff=$e(buff,2,$l(buff))\n . i c=\"[\" s error=1,stop=1 q\n . i c=\"}\" d q\n . . s stop=1\n . i c=\":\" d q\n . . n subs2\n . . s value=$$getJSONValue(.buff)\n . . d q:stop\n . . . i value=\"\" q\n . . . i $e(value,1)=\"\"\"\",$e(value,$l(value))=\"\"\"\" q\n . . . i value=\"true\"!(value=\"false\") s value=\"\"\"\"_value_\"\"\"\" q\n . . . i $$numeric(value) q\n . . . s error=1,stop=1\n . . i value=\"\",$e(buff,1)=\"{\" d q\n . . . i $e(name,1)'=\"\"\"\",$e(name,$l(name))'=\"\"\"\" s name=\"\"\"\"_name_\"\"\"\"\n . . . s subs2=subs\n . . . i subs'=\"\" s subs2=subs2_\",\"\n . . . s subs2=subs2_name\n . . . i $g(mode)=\"\" s subs2=subs2_\",\"\"zobj1\"\"\"\n . . . s buff=$e(buff,2,$l(buff))\n . . . s error=$$parseJSONObject(.buff,subs2)\n . . . i error=1 s stop=1 q\n . . i value=\"\",$e(buff,1)=\"[\" d q\n . . . ;s subs2=subs_\",\"\"\"_name_\"\"\",\"\"1\"\"\"\n . . . i $e(name,1)'=\"\"\"\",$e(name,$l(name))'=\"\"\"\" s name=\"\"\"\"_name_\"\"\"\"\n . . . s subs2=subs\n . . . i subs'=\"\" s subs2=subs2_\",\"\n . . . s subs2=subs2_name\n . . . s buff=$e(buff,2,$l(buff))\n . . . s error=$$parseJSONArray(.buff,subs2)\n . . . i error=1 s stop=1 q\n . . i $e(name,1)=\"\"\"\",$e(name,$l(name))'=\"\"\"\" s error=1,stop=1 q\n . . i $e(name,1)'=\"\"\"\",$e(name,$l(name))=\"\"\"\" s error=1,stop=1 q\n . . i $e(name,1)'=\"\"\"\",$e(name,$l(name))'=\"\"\"\" s name=\"\"\"\"_name_\"\"\"\"\n . . s subs2=subs\n . . i subs'=\"\" s subs2=subs2_\",\"\n . . s subs2=subs2_name\n . . i value[\"\\'\" s value=$$replaceAll(value,\"\\'\",\"\"\"\"\"\")\n . . s x=\"s \"_arrRef_\"(\"_subs2_\")=\"_value\n . . x x\n . i c=\",\" s name=\"\" q\n . s name=name_c q\n QUIT error\n ;\nparseJSONArray(buff,subs)\n n c,error,name,no,stop,subs2,value,x\n s stop=0,name=\"\",no=0,error=\"\"\n f d q:stop\n . s c=$e(buff,1)\n . i c=\"\" s error=1,stop=1 q\n . s buff=$e(buff,2,$l(buff))\n . i c=\":\" s error=1,stop=1 q\n . i c=\"]\" d q\n . . s stop=1\n . . i name=\"\" q\n . . s no=no+1\n . . s subs2=subs\n . . i subs'=\"\" s subs2=subs2_\",\"\n . . s subs2=subs2_no\n . . s x=\"s \"_arrRef_\"(\"_subs2_\")=\"_name\n . . x x\n . i c=\"[\" d q\n . . s no=no+1\n . . s subs2=subs\n . . i subs'=\"\" s subs2=subs2_\",\"\n . . s subs2=subs2_no\n . . ;s buff=$e(buff,2,$l(buff))\n . . s error=$$parseJSONArray(.buff,subs2)\n . . i error=1 s stop=1 q\n . i c=\"{\" d q\n . . s no=no+1\n . . s subs2=subs\n . . i subs'=\"\" s subs2=subs2_\",\"\n . . s subs2=subs2_no\n . . i $g(mode)=\"\" s subs2=subs2_\",\"\"zobj1\"\"\"\n . . ;s buff=$e(buff,2,$l(buff))\n . . s error=$$parseJSONObject(.buff,subs2)\n . . i error=1 s stop=1 q\n . s subs2=subs\n . i subs'=\"\" s subs2=subs2_\",\"\n . s subs2=subs2_\"\"\"\"_name_\"\"\"\"\n . i c=\",\" d q\n . . i name=\"\" q\n . . d q:stop\n . . . i $e(name,1)=\"\"\"\",$e(name,$l(name))=\"\"\"\" q\n . . . ;i value=\"true\"!(value=\"false\") s value=\"\"\"\"_value_\"\"\"\" q\n . . . i $$numeric(name) q\n . . . s error=1,stop=1\n . . s no=no+1\n . . s subs2=subs\n . . i subs'=\"\" s subs2=subs2_\",\"\n . . s subs2=subs2_\"\"\"\"_no_\"\"\"\"\n . . s x=\"s \"_arrRef_\"(\"_subs2_\")=\"_name\n . . x x\n . . s name=\"\"\n . s name=name_c q\n QUIT error\n ;\ngetJSONValue(buff)\n n c,isLiteral,lc,stop,value\n s stop=0,value=\"\",isLiteral=0,lc=\"\"\n f d q:stop q:buff=\"\"\n . s c=$e(buff,1)\n . i value=\"\",c=\"\"\"\" s isLiteral=1\n . i 'isLiteral,c=\"[\" s stop=1 q\n . i 'isLiteral,c=\"{\" s stop=1 q\n . i c=\"}\" d q:stop\n . . i isLiteral,lc'=\"\"\"\" q\n . . s stop=1\n . i c=\",\" d q:stop\n . . i isLiteral,lc'=\"\"\"\" q\n . . s stop=1\n . s buff=$e(buff,2,$l(buff))\n . s value=value_c\n . s lc=c\n QUIT value\n ;\nnumeric(value)\n i $e(value,1)=0,$l(value)>1 QUIT 0\n i $e(value,1,2)=\"-0\",$l(value)>2,$e(value,1,3)'=\"-0.\" QUIT 0\n i value?1N.N QUIT 1\n i value?1\"-\"1N.N QUIT 1\n i value?1N.N1\".\"1N.N QUIT 1\n i value?1\"-\"1N.N1\".\"1N.N QUIT 1\n i value?1\".\"1N.N QUIT 1\n i value?1\"-.\"1N.N QUIT 1\n QUIT 0\n ;\nremoveControlChars(string)\n n c,i,newString\n s newString=\"\"\n f i=1:1:$l(string) d\n . s c=$e(string,i)\n . i $a(c)<32 s c=\"~\"\n . s newString=newString_c\n QUIT newString\n ;\nutfConvert(input)\n ; Unescape UTF-8 characters\n i input[$c(195) d\n . n buf,c1,i,no,p\n . s buf=$p(input,$c(195),1)\n . s no=$l(input,$c(195))\n . f i=2:1:no d\n . . s p=$p(input,$c(195),i)\n . . s c1=$e(p,1)\n . . s c1=$c($a(c1)+64)\n . . s buf=buf_c1_$e(p,2,$l(p))\n . s input=buf\n s input=$tr(input,$c(194),\"\")\n QUIT input\n ;\n\n" }, { "path": "src/test/resources/samples/langs/M4/htmlgen.m4", "content": "dnl Took from https://en.wikipedia.org/wiki/M4_(computer_language)\ndivert(-1)\n\nM4 has multiple output queues that can be manipulated with the\n`divert' macro. Valid queues range from 0 to 10, inclusive, with\nthe default queue being 0.\n\nCalling the `divert' macro with an invalid queue causes text to be\ndiscarded until another call. Note that even while output is being\ndiscarded, quotes around `divert' and other macros are needed to\nprevent expansion.\n\n# Macros aren't expanded within comments, meaning that keywords such\n# as divert and other built-ins may be used without consequence.\n\n# HTML utility macro:\n\ndefine(`H2_COUNT', 0)\n\n# The H2_COUNT macro is redefined every time the H2 macro is used:\n\ndefine(`H2',\n\t`define(`H2_COUNT', incr(H2_COUNT))

H2_COUNT. $1

')\n\ndivert(1)dnl\ndnl\ndnl The dnl macro causes m4 to discard the rest of the line, thus\ndnl preventing unwanted blank lines from appearing in the output.\ndnl\nH2(First Section)\nH2(Second Section)\nH2(Conclusion)\ndnl\ndivert(0)dnl\ndnl\n\nundivert(1)dnl One of the queues is being pushed to output.\n\n" }, { "path": "src/test/resources/samples/langs/M4Sugar/ax_ruby_devel.m4", "content": "# ===========================================================================\n# http://www.gnu.org/software/autoconf-archive/ax_ruby_devel.html\n# ===========================================================================\n#\n# SYNOPSIS\n#\n# AX_RUBY_DEVEL([version])\n#\n# DESCRIPTION\n#\n# This macro checks for Ruby and tries to get the include path to\n# 'ruby.h'. It provides the $(RUBY_CPPFLAGS) and $(RUBY_LDFLAGS) output\n# variables. It also exports $(RUBY_EXTRA_LIBS) for embedding Ruby in your\n# code.\n#\n# You can search for some particular version of Ruby by passing a\n# parameter to this macro, for example \"1.8.6\".\n#\n# LICENSE\n#\n# Copyright (c) 2008 Rafal Rzepecki \n# Copyright (c) 2008 Sebastian Huber \n# Copyright (c) 2008 Alan W. Irwin\n# Copyright (c) 2008 Rafael Laboissiere \n# Copyright (c) 2008 Andrew Collier\n# Copyright (c) 2008 Matteo Settenvini \n# Copyright (c) 2008 Horst Knorr \n#\n# This program is free software: you can redistribute it and/or modify it\n# under the terms of the GNU General Public License as published by the\n# Free Software Foundation, either version 3 of the License, or (at your\n# 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 General\n# Public License for more details.\n#\n# You should have received a copy of the GNU General Public License along\n# with this program. If not, see .\n#\n# As a special exception, the respective Autoconf Macro's copyright owner\n# gives unlimited permission to copy, distribute and modify the configure\n# scripts that are the output of Autoconf when processing the Macro. You\n# need not follow the terms of the GNU General Public License when using\n# or distributing such scripts, even though portions of the text of the\n# Macro appear in them. The GNU General Public License (GPL) does govern\n# all other use of the material that constitutes the Autoconf Macro.\n#\n# This special exception to the GPL applies to versions of the Autoconf\n# Macro released by the Autoconf Archive. When you make and distribute a\n# modified version of the Autoconf Macro, you may extend this special\n# exception to the GPL to apply to your modified version as well.\n\n#serial 11\n\nAC_DEFUN([AX_RUBY_DEVEL],[\n AC_REQUIRE([AX_WITH_RUBY])\n AS_IF([test -n \"$1\"], [AX_PROG_RUBY_VERSION([$1])])\n\n #\n # Check if you have mkmf, else fail\n #\n AC_MSG_CHECKING([for the mkmf Ruby package])\n ac_mkmf_result=`$RUBY -rmkmf -e \";\" 2>&1`\n if test -z \"$ac_mkmf_result\"; then\n AC_MSG_RESULT([yes])\n else\n AC_MSG_RESULT([no])\n AC_MSG_ERROR([cannot import Ruby module \"mkmf\".\nPlease check your Ruby installation. The error was:\n$ac_mkmf_result])\n fi\n\n #\n # Check for Ruby include path\n #\n AC_MSG_CHECKING([for Ruby include path])\n if test -z \"$RUBY_CPPFLAGS\"; then\n ruby_path=`$RUBY -rmkmf -e 'print Config::CONFIG[[\"archdir\"]]'`\n if test -n \"${ruby_path}\"; then\n ruby_path=\"-I$ruby_path\"\n fi\n RUBY_CPPFLAGS=$ruby_path\n fi\n AC_MSG_RESULT([$RUBY_CPPFLAGS])\n AC_SUBST([RUBY_CPPFLAGS])\n\n #\n # Check for Ruby library path\n #\n AC_MSG_CHECKING([for Ruby library path])\n if test -z \"$RUBY_LDFLAGS\"; then\n RUBY_LDFLAGS=`$RUBY -rmkmf -e 'print Config::CONFIG[[\"LIBRUBYARG_SHARED\"]]'`\n fi\n AC_MSG_RESULT([$RUBY_LDFLAGS])\n AC_SUBST([RUBY_LDFLAGS])\n\n #\n # Check for site packages\n #\n AC_MSG_CHECKING([for Ruby site-packages path])\n if test -z \"$RUBY_SITE_PKG\"; then\n RUBY_SITE_PKG=`$RUBY -rmkmf -e 'print Config::CONFIG[[\"sitearchdir\"]]'`\n fi\n AC_MSG_RESULT([$RUBY_SITE_PKG])\n AC_SUBST([RUBY_SITE_PKG])\n\n #\n # libraries which must be linked in when embedding\n #\n AC_MSG_CHECKING(ruby extra libraries)\n if test -z \"$RUBY_EXTRA_LIBS\"; then\n RUBY_EXTRA_LIBS=`$RUBY -rmkmf -e 'print Config::CONFIG[[\"SOLIBS\"]]'`\n fi\n AC_MSG_RESULT([$RUBY_EXTRA_LIBS])\n AC_SUBST(RUBY_EXTRA_LIBS)\n\n #\n # linking flags needed when embedding\n # (is it even needed for Ruby?)\n #\n # AC_MSG_CHECKING(ruby extra linking flags)\n # if test -z \"$RUBY_EXTRA_LDFLAGS\"; then\n # RUBY_EXTRA_LDFLAGS=`$RUBY -rmkmf -e 'print Config::CONFIG[[\"LINKFORSHARED\"]]'`\n # fi\n # AC_MSG_RESULT([$RUBY_EXTRA_LDFLAGS])\n # AC_SUBST(RUBY_EXTRA_LDFLAGS)\n\n # this flags breaks ruby.h, and is sometimes defined by KDE m4 macros\n CFLAGS=\"`echo \"$CFLAGS\" | sed -e 's/-std=iso9899:1990//g;'`\"\n #\n # final check to see if everything compiles alright\n #\n AC_MSG_CHECKING([consistency of all components of ruby development environment])\n AC_LANG_PUSH([C])\n # save current global flags\n ac_save_LIBS=\"$LIBS\"\n LIBS=\"$ac_save_LIBS $RUBY_LDFLAGS\"\n ac_save_CPPFLAGS=\"$CPPFLAGS\"\n CPPFLAGS=\"$ac_save_CPPFLAGS $RUBY_CPPFLAGS\"\n AC_TRY_LINK([\n #include \n ],[\n ruby_init();\n ],[rubyexists=yes],[rubyexists=no])\n\n AC_MSG_RESULT([$rubyexists])\n\n if test ! \"$rubyexists\" = \"yes\"; then\n AC_MSG_ERROR([\n Could not link test program to Ruby. Maybe the main Ruby 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/ruby/lib\"\n ============================================================================\n ERROR!\n You probably have to install the development version of the Ruby package\n for your distribution. The exact name of this package varies among them.\n ============================================================================\n ])\n RUBY_VERSION=\"\"\n fi\n AC_LANG_POP\n # turn back to default flags\n CPPFLAGS=\"$ac_save_CPPFLAGS\"\n LIBS=\"$ac_save_LIBS\"\n\n #\n # all done!\n #\n])\n" }, { "path": "src/test/resources/samples/langs/M4Sugar/filenames/configure.ac", "content": "# -*- Autoconf -*-\n# Process this file with autoconf to produce a configure script.\n\nAC_PREREQ(2.68)\nAC_INIT([GARDEN], \n\t[1.0.9], \n\t[bubla@users.sourceforge.net])\nAC_CONFIG_AUX_DIR([build-aux])\nAM_INIT_AUTOMAKE([-Wall])\nAC_CONFIG_SRCDIR([src/input.h])\nAC_CONFIG_HEADERS([src/configure.h])\nAC_CONFIG_MACRO_DIR([m4])\n\nAC_ARG_ENABLE([debug],\n\t [AS_HELP_STRING([--enable-debug],\n\t\t\t [Builds the debug version of the library [[default = no]]]) ],\n\t [],\n\t [enable_debug=\"no\"])\n\nAS_IF([test \"x$enable_debug\" = \"xyes\"],\n [CFLAGS=\"${CFLAGS} -g -O0\"])\n\n# Checks for programs.\nAC_PROG_CC\nAC_PROG_LIBTOOL\nLT_PROG_RC\n\nAC_CANONICAL_HOST\n\ndnl\ndnl Check whether it makes sense to install a garden.desktop file\ndnl\nAC_CHECK_PROG([have_freedesktop],\n\t [update-desktop-database],\n\t [yes])\n\nAM_CONDITIONAL([HAVE_FREEDESKTOP],\n\t [test \"x$have_freedesktop\" = \"xyes\"])\n\nAM_CONDITIONAL([WANT_FREEDESKTOP],\n\t [test \"x$enable_desktop_install\" = \"xyes\"])\n\nAC_ARG_ENABLE([desktop-install],\n\t [AS_HELP_STRING([--enable-desktop-install],\n\t\t\t [Whether you want to install the garden.desktop file if applicable. !!! DO NOT USE if you are a PACKAGER!!!])]\n\t )\n\nAS_CASE([$host],\n [*mingw* | *cygwin*],\n [AC_DEFINE([WINDOWS_VERSION],\n \t\t [1],\n\t\t [Define when building for Windows])\n windows_version=\"yes\"])\n\nAM_CONDITIONAL([WINDOWS_VERSION],\n\t [test \"x$windows_version\" = \"xyes\" ])\n\ndnl now the datadir specification, that is useful if one does want to play without installing\nAC_ARG_ENABLE([datadir],\n\t [AS_HELP_STRING([--enable-datadir=path-to-your-garden-datafiles],\n\t\t\t [Normally you dont have to use this, but it is handy when you want to play the game without installing it or if you want to use already installed data. In the first case, use for instance --enable-datadir=`pwd`/data (if it makes sense)])], \n\t [DATADIR_NAME=\"$enableval\"],\n\t [DATADIR_NAME='$(datadir)/'garden])\n\n# Sets the data subdirectory\nAC_SUBST([DATADIR_NAME])\n\n# Checks for libraries.\nAC_CHECK_HEADER([allegro.h],\n\t\t[],\n\t\t[have_allegro=\"no\"\n\t\t AC_MSG_ERROR([You don't even have Allegro headers... Get Allegro first!]) ])\n\nAC_CHECK_LIB([m], [sin])\n\ntest \"x$host_os\" != \"x$build_os\" && CROSS_COMPILING=\"yes\"\n\ntry_link_allegro ()\n{\n\tLIBS_SAVE=$LIBS\n\tLIBS=\"$LIBS $1\"\n\tAC_MSG_CHECKING([for Allegro using $1])\n\tAC_LINK_IFELSE([AC_LANG_PROGRAM([AC_INCLUDES_DEFAULT\n\t\t\t\t\t [ #include ]],\n\t\t\t\t\t[allegro_init();])END_OF_MAIN() ],\n\t\t [have_allegro=\"yes\"],\n\t\t [have_allegro=\"no\"])\n\tAC_MSG_RESULT([$have_allegro])\n\tLIBS=$LIBS_SAVE\n\tAS_IF([test \"x$have_allegro\" == \"xyes\"],\n\t [return 0],\n\t [return 1])\n}\n# first check for 'official allegro'\n# The official allegro does not support cross-compiling, though...\nAM_PATH_ALLEGRO([4.2.0]) \n\ntry_link_allegro \"$allegro_LIBS\"\nAS_IF([test \"x$?\" == \"x0\"],\n [[LIBS=\"$LIBS $allegro_LIBS\"\n ALLEGRO_LIB=`echo $allegro_LIBS | sed -e 's/.*-l\\([^[:blank:]]*\\).*/\\1/'`\n have_allegro=\"yes\"]])\n\nALLEGRO_RELEASE_LIBS=\"alleg alleg42 alleg44\"\nALLEGRO_DEBUG_LIBS=\"alld42 alleg44-debug\"\nAS_IF([test \"x$enable_debug\" = \"xyes\"],\n [ALLEGRO_LIBS=\"$ALLEGRO_DEBUG_LIBS $ALLEGRO_RELEASE_LIBS\"],\n [ALLEGRO_LIBS=\"$ALLEGRO_RELEASE_LIBS $ALLEGRO_DEBUG_LIBS\"])\n\nfor lib in $ALLEGRO_LIBS\ndo\n\tldflag=\"-l$lib\"\n\tAS_IF([test \"x$have_allegro\" == \"xyes\"],\n\t [break])\n\ttry_link_allegro $ldflag\n\tAS_IF([test \"x$?\" == \"x0\"],\n\t [LIBS=\"$LIBS $ldflag\"\n\t ALLEGRO_LIB=\"$lib\"\n\t have_allegro=\"yes\"])\ndone\n\nAS_IF([test \"x$have_allegro\" != \"xyes\"],\n [AC_MSG_ERROR([Unable to find Allegro game programming library 4.2, check out www.allegro.cc (or your distro repositories if you use a unix-like system)]) ])\n\n# Checks for header files.\nAC_CHECK_HEADERS([string.h sys/stat.h])\n\n# Checks for typedefs, structures, and compiler characteristics.\nAC_C_INLINE\nAC_HEADER_STDBOOL\n\n# Checks for library functions.\n\nAC_SUBST([ALLEGRO_LIB])\n\nAC_CONFIG_FILES([Makefile\n src/Makefile\n\t\t data/Makefile\n\t\t resources/Makefile\n\t \t docs/garden.doxyfile\n\t\t pkgs/w32/winstaller.nsi])\n\nAC_OUTPUT\n" }, { "path": "src/test/resources/samples/langs/M4Sugar/list.m4", "content": "m4_define([m4_list_declare], [m4_do(\n\t[m4_define([$1_GET], [m4_expand([m4_list_nth([$1], $][1)])])],\n\t[m4_define([$1_FOREACH], [m4_foreach([item], [m4_dquote_elt(m4_list_contents([$1]))], m4_quote($][1))])],\n)])\n\nm4_define([m4_list_add], [m4_do(\n\t[m4_pushdef([_LIST_NAME], [[_LIST_$1]])],\n\t[m4_ifndef(_LIST_NAME,\n\t\t[m4_define(_LIST_NAME, m4_dquote(m4_escape([$2])))],\n\t\t[m4_define(_LIST_NAME, m4_dquote(m4_list_contents([$1]), m4_escape([$2])))],\n\t)],\n\t[m4_popdef([_LIST_NAME])],\n)])\n\nm4_define([m4_list_contents], [m4_do(\n\t[m4_pushdef([_LIST_NAME], [[_LIST_$1]])],\n\t[m4_ifndef(_LIST_NAME, [], m4_quote(_LIST_NAME))],\n\t[m4_popdef([_LIST_NAME])],\n)])\n\nm4_define([m4_list_nth], [m4_argn([$2], m4_list_contents([$1]))])\n\nm4_define([m4_list_pop_front], [m4_do(\n\t[m4_pushdef([_LIST_NAME], [[_LIST_$1]])],\n\t[m4_car(m4_unquote(_LIST_NAME))],\n\t[m4_define(_LIST_NAME, m4_cdr(m4_unquote(_LIST_NAME)))],\n\t[m4_popdef([_LIST_NAME])],\n)])\n\nm4_define([m4_list_pop_back], [m4_do(\n\t[m4_pushdef([_LIST_NAME], [[_LIST_$1]])],\n\t[m4_define(_LIST_NAME, m4_dquote(m4_reverse(m4_unquote(_LIST_NAME))))],\n\t[m4_list_pop_front([$1])],\n\t[m4_define(_LIST_NAME, m4_dquote(m4_reverse(m4_unquote(_LIST_NAME))))],\n\t[m4_popdef([_LIST_NAME])],\n)])\n\ndnl\ndnl $1: List name\ndnl $2: What\ndnl $3: If contains\ndnl $4: If not\nm4_define([m4_list_contains], [m4_do(\n\t[m4_foreach([item], m4_list_contents([$1]), m4_if(item, [$2], [[$3]], [[$4]]))]\n)])\n\n" }, { "path": "src/test/resources/samples/langs/MAXScript/macro-1.mcr", "content": "-- Taken from an example from Autodesk's MAXScript reference:\n-- http://help.autodesk.com/view/3DSMAX/2016/ENU/?guid=__files_GUID_84E24969_C175_4389_B9A6_3B2699B66785_htm\n\nmacroscript MoveToSurface\n category: \"HowTo\"\n(\n fn g_filter o = superclassof o == Geometryclass\n fn find_intersection z_node node_to_z = (\n local testRay = ray node_to_z.pos [0,0,-1]\n local nodeMaxZ = z_node.max.z\n testRay.pos.z = nodeMaxZ + 0.0001 * abs nodeMaxZ\n intersectRay z_node testRay\n )\n \n on isEnabled return selection.count > 0\n \n on Execute do (\n target_mesh = pickObject message:\"Pick Target Surface:\" filter:g_filter\n \n if isValidNode target_mesh then (\n undo \"MoveToSurface\" on (\n for i in selection do (\n int_point = find_intersection target_mesh i\n if int_point != undefined then i.pos = int_point.pos\n )--end i loop\n )--end undo\n )--end if\n )--end execute\n)--end script\n" }, { "path": "src/test/resources/samples/langs/MAXScript/macro-2.mcr", "content": "-- Taken from an example from Autodesk's MAXScript reference:\n-- http://help.autodesk.com/view/3DSMAX/2016/ENU/?guid=__files_GUID_0876DF46_FAA3_4131_838D_5739A67FF2C1_htm\n\nmacroscript FreeSpline category:\"HowTo\" tooltip:\"FreeSpline\" (\nlocal old_pos\nlocal new_spline\nlocal second_knot_set\n\nfn get_mouse_pos pen_pos old_pen_pos = (\n\tif old_pos == undefined then old_pos = old_pen_pos\n\tif distance pen_pos old_pos > 10 then\n\t(\n\t\tif second_knot_set then\n\t\t\taddKnot new_spline 1 #smooth #curve pen_pos\n\t\telse\n\t\t(\n\t\t\tsetKnotPoint new_spline 1 2 pen_pos\n\t\t\tsecond_knot_set = true\n\t\t)\n\t\told_pos = pen_pos\n\t\tupdateShape new_spline\n\t)-- end if\n)-- end fn\n\nfn draw_new_line old_pen_pos = (\n\tpickPoint mouseMoveCallback:#(get_mouse_pos,old_pen_pos)\n)\n\nundo\"Free Spline\"on(\n\tnew_spline = splineShape ()\n\told_pen_pos = pickPoint ()\n\t\n\tif old_pen_pos == #RightClick then\n\t\tdelete new_spline\n\telse\n\t(\n\t\tselect new_spline\n\t\tnew_spline.pos = old_pen_pos\n\t\taddNewSpline new_spline\n\t\taddKnot new_spline 1 #smooth #curve old_pen_pos\n\t\taddKnot new_spline 1 #smooth #curve old_pen_pos\n\t\tsecond_knot_set = false\n\t\tdraw_new_line old_pen_pos\n\t\tq = querybox \"Close Spline?\" title:\"Free Spline\"\n\t\tif q then\n\t\t(\n\t\t\tclose new_spline 1\n\t\t\tupdateshape new_spline\n\t\t)\n\t\tselect new_spline\n\t)--end else\n)--end undo\n)--end script\n" }, { "path": "src/test/resources/samples/langs/MAXScript/rolloutCreator.ms", "content": "-------------------------------------------------------------------------------\n-- \n-- File:\t\trolloutCreator.ms\n-- Description:\tLocalization friendly helper struct for dynamically creating rollouts\n-- By:\t\tRavi Karra [Discreet] \t\t\travi.karra@discreet.com\n--\t \n-- Version:\t1.01\n-- Version:\t1.02 - Larry Minton [Discreet] \n--\t\t\t\t\t\tchanged += to append string1 string2\n--\t\t\t\t\t\tadded addText method\n-- Declarations:\n/*\n\trolloutCreator [width:] [height:]\n\t\tcreates an instance of rolloutCreator, assign it to a variable\n\t\twidth - width of the rollout/dialog to be created\n\t\theight - of the rollout/dialog to be created\n\t\t\n\t\teg:\n\t \trci = rolloutCreator \"myRollout\" \"My Rollout\"\n\t\t\n\n\t.begin()\n\t\tthis function needs to be called immediately after the instance is created, this does the initialization\n\n\t.addLocal [init:]\n\t\t \n\t\tname of the local\n\t\t\n\t\t[init:]\n\t\twhat the local should be initialized to\n\t\n\t.addControl [paramStr:] =\n\t\tadds a control to the rollout\n\t\t\n\t\t\n\t\tcan be any of named rolloutControls eg: #button, #spinner, #activeXControl etc\n\t\t\n\t\t\n\t\tvariable name of the control by which it is referred eg: #btnButton\n\t\t\n\t\t\n\t\tcaption of the control \"My Button\"\n\t\t\n\t\t[paramStr:]\n\t\tan optional string representation of all the keyword parameters that needs to be passed to the control\n\t\teg: \"width:100 height:20 align:#right\"\n\t\t\n\t\teg:\n\t\trci.addControl #button #myButton \"My Button\"\n\t\n\t.addHandler [paramStr:] [codeStr:] [filter:]\n\t\tadds an event handler for the controls previously added \n\t\t\n\t\t\n\t\tthe variable passed during the control creation\n\t\t \n\t\t\n\t\tany of the events supported by the control, eg: #changed, #pressed, #selected\n\t\t\n\t\t[paramStr:]\n\t\tan optional string representation of all the positional and keyword parameters that are passed to the event\t\n\n\t\t[codeStr:]\n\t\ta string representation of the event handler code, if the string contains sub-strings, enclose them in two character '@' \n\t\tand pass on\\true for the filter: parameter\n\n\t\t[filter:]\n\t\tif true, converts '@' to quote in codeStr\n\t\t\t\t\n\t\teg:\n\t\trci.addHandler #myButton #pressed codeStr:\"MessageBox @Hey@\" filter:on\n\t\twill add an event handler for button named \"myButton\". When the button is clicked, messagebox pops up with text \"hey\" in it.\n\t\t\n\t.addText [filter:]\n\t\tadds string to rollout definition. Typically used for function definitions.\n\n\t\t[filter:]\n\t\tif true, converts '@' to quote in string\n\t\t\t\t\n\t.end()\n\t\tthis function has to be called whenever all the required control and their event handler's are called. This function forms \n\t\tthe rollout string, evaluates it and returns the definition which can passed to createDialog and addRollout functions.\n\t\n\tComplete Example:\n\t\t rci = rolloutCreator \"myRollout\" \"My Rollout\"\n\t\t rci.begin()\n\t\t\trci.addControl #button #myButton \"My Button\"\n\t\t\trci.addHandler #myButton #pressed filter:on codeStr:\"MessageBox @Isn't this cool@ title:@Wow@\"\n\t\tcreateDialog (rci.end())\n*/\n-------------------------------------------------------------------------------\n\n\nif __rcCounter == undefined then global __rcCounter = 0\nstruct rolloutCreator\n(\n\t-- variables\n\tname, caption, str, def, width, height, quote=\"\\\"\",\n\t\n\t-- functions\n\tfn begin = \n( \n\t\tif name == undefined then\n\t(\n\t\t\t__rcCounter += 1\n\t\t\tname = \"rolloutCreator\" + __rcCounter as string\n\t)\n\t\tif caption == undefined then caption = \"\"\n\t\tstr = \"\"\n\t),\n\t\n\tfn addLocal name init: = \n(\n\t\tlocal dStr = \"\\tlocal \" + name as string\n\t\tif init != unsupplied then append dStr (\" = \" + init as string)\n\t\tappend dStr \"\\n\"\n\t\tappend str dStr\n\t),\n\n\tfn addControl type name caption paramStr:\"\" =\n(\t\n\t\tappend str (\"\\t\" + type as string + \" \" + name as string + \" \" + quote + caption + quote + paramStr + \"\\n\")\n\t),\n\t\n\tfn strFilter codeStr =\n(\n\t\t\tlocal last_is_at = codeStr[codeStr.count] == \"@\"\n\t\t\tlocal fltStr = filterString codeStr \"@\"\n\t\t\tlocal rep = \"\\\"\"\n\t\t\tcodeStr = (if (codeStr[1] == \"@\") then rep else \"\") + fltStr[1]\n\t\t\tfor i=2 to fltStr.count do\n\t\t(\n\t\t\t\tappend codeStr (rep + fltStr[i])\n\t\t)\n\t\t\tif last_is_at then append codeStr rep\n\t\t\tcodeStr\n\t),\n\n\tfn addHandler ctrl event paramStr:\"\" filter:on codeStr:\"\" =\n(\n\t\tif filter do codeStr = (strFilter codeStr)\n\t\tappend str (\"\\non \" + ctrl as string + \" \" + event as string + \" \" + paramStr as string + \" do \\n(\\n\" + codeStr + \";ok\\n)\\n\")\n\t),\n\t\n\tfn addText txt filter:on =\n(\n\t\tif filter do txt = (strFilter txt )\n\t\tappend str (\"\\t \" + txt + \"\\n\")\n\t),\n\t\n\tfn end = \n( \n\t\tlocal dStr = \"rollout \" + name + \" \" + quote + caption + quote\n\t\tif width != undefined then\n \t\t\tappend dStr (\" width:\" + width as string)\n\t\tif height != undefined then\n\t\t\tappend dStr (\" height:\" + height as string)\n\t\tappend dStr \"\\n(\\n\" \n\t\tappend dStr str\n\t\tappend dStr \"\\n)\\n\"\n\t\tstr = dStr\n\t\tdef = execute str\n)\n)\n\n/*-- Usage\n-- Create an instance of the rolloutCreator passing the name and the caption\nrfTest = rolloutCreator \"rfTestN\" \"rfTestC\" --width:300 height:100\n-- Start creating the rollout\nrfTest.begin()\n\trfTest.addControl #button #myButton \"My Button\"\t\t\t-- add a button\n--\trfTest.addHandler #myButton #pressed filter:on codeStr:\"MessageBox @Hey@\"\nrfTest.addHandler #myButton #pressed filter:on codeStr:\"MessageBox @Look to the \\@Light\\@ thing@\" \nrfTest.end()\ncreateDialog rfTest.def\n*/" }, { "path": "src/test/resources/samples/langs/MAXScript/svg-renderer.ms", "content": "-- Taken from a 3-part tutorial from Autodesk's MAXScript reference\n-- Source: http://help.autodesk.com/view/3DSMAX/2016/ENU/?guid=__files_GUID_6B5EDC11_A154_4AA7_A972_A11AC36949E9_htm\n\nfn ColourToHex col = (\n\tlocal theComponents = #(bit.intAsHex col.r, bit.intAsHex col.g, bit.intAsHex col.b)\n\tlocal theValue = \"#\"\n\tfor i in theComponents do \n\t\ttheValue += (if i.count == 1 then \"0\" else \"\") + i\n\ttheValue\n)\n\nlocal st = timestamp()\nlocal theFileName = (getDir #userscripts + \"\\\\PolygonRendering3.svg\")\nlocal theSVGfile = createFile theFileName\nformat \"\\n\" to:theSVGfile\n\nlocal theViewTM = viewport.getTM()\ntheViewTM.row4 = [0,0,0]\n\nlocal theViewTM2 = viewport.getTM()\nlocal theViewSize = getViewSize()\nlocal theViewScale = getViewSize()\ntheViewScale.x /= 1024.0\ntheViewScale.y /= 1024.0\n\t\nlocal theStrokeThickness = 3\n\t\ngw.setTransform (matrix3 1)\t\nfor o in Geometry where not o.isHiddenInVpt and classof o != TargetObject do (\n\tlocal theStrokeColour = white\n\tlocal theFillColour = o.wirecolor\n\t\n\tlocal theMesh = snapshotAsMesh o\n\tfor f = 1 to theMesh.numfaces do (\n\t\tlocal theNormal = normalize (getFaceNormal theMesh f)\n\t\t\n\t\tif (theNormal*theViewTM).z > 0 do\n\t\t(\n\t\t\tlocal theFace = getFace theMesh f\n\t\t\tlocal v1 = gw.transPoint (getVert theMesh theFace.x)\n\t\t\tlocal v2 = gw.transPoint (getVert theMesh theFace.y)\n\t\t\tlocal v3 = gw.transPoint (getVert theMesh theFace.z)\n\t\t\t\n\t\t\tv1.x /= theViewScale.x \n\t\t\tv1.y /= theViewScale.y \n\t\t\tv2.x /= theViewScale.x \n\t\t\tv2.y /= theViewScale.y\n\t\t\tv3.x /= theViewScale.x\n\t\t\tv3.y /= theViewScale.y\n\t\t\t\n\t\t\tformat \"\\t\\n\" (ColourToHex theStrokeColour) (ColourToHex theFillColour) theStrokeThickness to:theSVGfile\t\t\t\n\t\t)--end if normal positive\n\t)--end f loop\n)--end o loop\n\nformat \"\\n\" to:theSVGfile\nclose theSVGfile\nlocal theSVGMap = VectorMap vectorFile:theFileName alphasource:0\nlocal theBitmap = bitmap theViewSize.x theViewSize.y\nrenderMap theSVGMap into:theBitmap filter:true\ndisplay theBitmap\nformat \"Render Time: % sec.\\n\" ((timestamp()-st)/1000.0)\n" }, { "path": "src/test/resources/samples/langs/MAXScript/volume-calc.ms", "content": "fn CalculateVolumeAndCentreOfMass obj =\n(\n\tlocal Volume= 0.0\n\tlocal Centre= [0.0, 0.0, 0.0]\n\tlocal theMesh = snapshotasmesh obj\n\tlocal numFaces = theMesh.numfaces\n\tfor i = 1 to numFaces do\n\t(\n\t\tlocal Face= getFace theMesh i\n\t\tlocal vert2 = getVert theMesh Face.z\n\t\tlocal vert1 = getVert theMesh Face.y\n\t\tlocal vert0 = getVert theMesh Face.x\n\t\tlocal dV = Dot (Cross (vert1 - vert0) (vert2 - vert0)) vert0\n\t\tVolume+= dV\n\t\tCentre+= (vert0 + vert1 + vert2) * dV\n\t)\n\tdelete theMesh\n\tVolume /= 6\n\tCentre /= 24\n\tCentre /= Volume\n\t#(Volume,Centre)\n)\n" }, { "path": "src/test/resources/samples/langs/MQL4/header-sample.mqh", "content": "//+------------------------------------------------------------------+\r\n//| header-sample.mqh |\r\n//| Copyright 2016, Andrey Osorgin |\r\n//+------------------------------------------------------------------+\r\n//| The MIT License (MIT) |\r\n//| |\r\n//| Permission is hereby granted, free of charge, to any person |\r\n//| obtaining a copy of this software and associated documentation |\r\n//| files (the \"Software\"), to deal in the Software without |\r\n//| restriction, including without limitation the rights to use, |\r\n//| copy, modify, merge, publish, distribute, sublicense, and/or sell|\r\n//| copies of the Software, and to permit persons to whom the |\r\n//| Software is furnished to do so, subject to the following |\r\n//| conditions: |\r\n//| |\r\n//| The above copyright notice and this permission notice shall be |\r\n//| included in all copies or substantial portions of the Software. |\r\n//| |\r\n//| THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, |\r\n//| EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES |\r\n//| OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND |\r\n//| NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT |\r\n//| HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, |\r\n//| WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING |\r\n//| FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR |\r\n//| OTHER DEALINGS IN THE SOFTWARE. |\r\n//| |\r\n//| A copy of the MIT License (MIT) is available at |\r\n//| https://opensource.org/licenses/MIT |\r\n//+------------------------------------------------------------------+\r\n#property strict\r\n//+------------------------------------------------------------------+\r\n//| |\r\n//+------------------------------------------------------------------+\r\nclass CSomeObject\r\n {\r\nprotected:\r\n int m_someproperty;\r\nprivate:\r\n bool SomeFunction() {return true;}\r\npublic:\r\n CSomeObject(void): m_someproperty(0) {}\r\n ~CSomeObject(void) {}\r\n void SetName(int n){m_someproperty=n;}// sets somepropery\r\n int GetName(){return(m_someproperty);} // returns someproperty\r\n };\r\n//+------------------------------------------------------------------+\r\n" }, { "path": "src/test/resources/samples/langs/MQL4/indicator-sample.mq4", "content": "//+------------------------------------------------------------------+\r\n//| indicator-sample.mq4 |\r\n//| Copyright 2016, Andrey Osorgin |\r\n//+------------------------------------------------------------------+\r\n//| The MIT License (MIT) |\r\n//| |\r\n//| Permission is hereby granted, free of charge, to any person |\r\n//| obtaining a copy of this software and associated documentation |\r\n//| files (the \"Software\"), to deal in the Software without |\r\n//| restriction, including without limitation the rights to use, |\r\n//| copy, modify, merge, publish, distribute, sublicense, and/or sell|\r\n//| copies of the Software, and to permit persons to whom the |\r\n//| Software is furnished to do so, subject to the following |\r\n//| conditions: |\r\n//| |\r\n//| The above copyright notice and this permission notice shall be |\r\n//| included in all copies or substantial portions of the Software. |\r\n//| |\r\n//| THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, |\r\n//| EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES |\r\n//| OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND |\r\n//| NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT |\r\n//| HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, |\r\n//| WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING |\r\n//| FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR |\r\n//| OTHER DEALINGS IN THE SOFTWARE. |\r\n//| |\r\n//| A copy of the MIT License (MIT) is available at |\r\n//| https://opensource.org/licenses/MIT |\r\n//+------------------------------------------------------------------+\r\n#property version \"1.00\"\r\n#property strict\r\n\r\n#property indicator_chart_window\r\n#property indicator_plots 0\r\n//+------------------------------------------------------------------+\r\n//| Custom indicator initialization function |\r\n//+------------------------------------------------------------------+\r\nvoid OnInit(void)\r\n {\r\n //---\r\n }\r\n//+------------------------------------------------------------------+\r\n//| Bears Power |\r\n//+------------------------------------------------------------------+\r\nint OnCalculate(const int rates_total,\r\n const int prev_calculated,\r\n const datetime &time[],\r\n const double &open[],\r\n const double &high[],\r\n const double &low[],\r\n const double &close[],\r\n const long &tick_volume[],\r\n const long &volume[],\r\n const int &spread[])\r\n {\r\n Print(\"The number of bars on the current chart: \",iBars(Symbol(),Period()));\r\n//---\r\n return(rates_total);\r\n }\r\n//+------------------------------------------------------------------+\r\n" }, { "path": "src/test/resources/samples/langs/MQL4/script-sample.mq4", "content": "//+------------------------------------------------------------------+\r\n//| script-sample.mq4 |\r\n//| Copyright 2016, Andrey Osorgin |\r\n//+------------------------------------------------------------------+\r\n//| The MIT License (MIT) |\r\n//| |\r\n//| Permission is hereby granted, free of charge, to any person |\r\n//| obtaining a copy of this software and associated documentation |\r\n//| files (the \"Software\"), to deal in the Software without |\r\n//| restriction, including without limitation the rights to use, |\r\n//| copy, modify, merge, publish, distribute, sublicense, and/or sell|\r\n//| copies of the Software, and to permit persons to whom the |\r\n//| Software is furnished to do so, subject to the following |\r\n//| conditions: |\r\n//| |\r\n//| The above copyright notice and this permission notice shall be |\r\n//| included in all copies or substantial portions of the Software. |\r\n//| |\r\n//| THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, |\r\n//| EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES |\r\n//| OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND |\r\n//| NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT |\r\n//| HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, |\r\n//| WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING |\r\n//| FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR |\r\n//| OTHER DEALINGS IN THE SOFTWARE. |\r\n//| |\r\n//| A copy of the MIT License (MIT) is available at |\r\n//| https://opensource.org/licenses/MIT |\r\n//+------------------------------------------------------------------+\r\n#property version \"1.00\"\r\n#property strict\r\n#property script_show_inputs\r\n\r\ninput int StopLoss=100; //Stop Loss\r\ninput int TakeProfit=100; //Take Profit\r\n//+------------------------------------------------------------------+\r\n//| Script program start function |\r\n//+------------------------------------------------------------------+\r\nvoid OnStart()\r\n {\r\n double minstoplevel=MarketInfo(Symbol(),MODE_STOPLEVEL);\r\n Print(\"Minimum Stop Level=\",minstoplevel,\" points\");\r\n//---\r\n double sl=NormalizeDouble(Bid-StopLoss*Point,Digits);\r\n double tp=NormalizeDouble(Ask+TakeProfit*Point,Digits);\r\n//---\r\n int result=OrderSend(Symbol(),OP_BUY,0.01,Ask,1,sl,tp,\"Test\",0,0,clrNONE);\r\n Print(\"Success? \",result);\r\n }\r\n//+------------------------------------------------------------------+\r\n" }, { "path": "src/test/resources/samples/langs/MQL5/Regex.mqh", "content": "//+------------------------------------------------------------------+\r\n//| Regular Expression |\r\n//| Copyright 2016, MetaQuotes Software Corp. |\r\n//| https://www.mql5.com |\r\n//+------------------------------------------------------------------+\r\n//| Regular Expression Library from .NET Framework 4.6.1 implemented |\r\n//| in MetaQuotes Language 5 (MQL5) |\r\n//| Original sources at https://github.com/Microsoft/referencesource |\r\n//| |\r\n//| The capabilities of the Regular Expression Library include: |\r\n//| - Lazy quantifiers |\r\n//| - Positive and negative lookbehind |\r\n//| - Conditional evaluation |\r\n//| - Balancing group definitions |\r\n//| - Nonbacktracking subexpressions |\r\n//| - Right-to-left matching |\r\n//| |\r\n//| If you find any functional differences between Regular Expression|\r\n//| Library for MQL5 and the original .NET Framework 4.6.1 project, |\r\n//| please contact developers of MQL5 on the Forum at www.mql5.com. |\r\n//| |\r\n//| You can report bugs found in the computational algorithms of the |\r\n//| Regular Expression Library from .Net Framework 4.6.1 by notifying|\r\n//| the project coordinators. |\r\n//+------------------------------------------------------------------+\r\n//| The MIT License (MIT) |\r\n//| |\r\n//| Permission is hereby granted, free of charge, to any person |\r\n//| obtaining a copy of this software and associated documentation |\r\n//| files (the \"Software\"), to deal in the Software without |\r\n//| restriction, including without limitation the rights to use, |\r\n//| copy, modify, merge, publish, distribute, sublicense, and/or sell|\r\n//| copies of the Software, and to permit persons to whom the |\r\n//| Software is furnished to do so, subject to the following |\r\n//| conditions: |\r\n//| |\r\n//| The above copyright notice and this permission notice shall be |\r\n//| included in all copies or substantial portions of the Software. |\r\n//| |\r\n//| THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, |\r\n//| EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES |\r\n//| OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND |\r\n//| NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT |\r\n//| HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, |\r\n//| WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING |\r\n//| FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR |\r\n//| OTHER DEALINGS IN THE SOFTWARE. |\r\n//| |\r\n//| A copy of the MIT License (MIT) is available at |\r\n//| https://opensource.org/licenses/MIT |\r\n//+------------------------------------------------------------------+\r\nclass Match;\r\nclass MatchCollection;\r\nclass CachedCodeEntry;\r\nclass ReplacementReference;\r\nclass RunnerReference;\r\nclass RegexRunner;\r\n//+------------------------------------------------------------------+\r\n//| Callback class. |\r\n//+------------------------------------------------------------------+\r\ntypedef string(*MatchEvaluator)(Match*);\r\n#include \r\n#include \r\n#include \r\n#include \"RegexOptions.mqh\"\r\n#include \"RegexCode.mqh\"\r\n#include \"RegexTree.mqh\"\r\n#include \"RegexParser.mqh\"\r\n#include \"RegexReplacement.mqh\"\r\n#include \"RegexWriter.mqh\"\r\n#include \"RegexMatchCollection.mqh\"\r\n#include \"RegexRunner.mqh\"\r\n#include \"RegexInterpreter.mqh\"\r\n//+------------------------------------------------------------------+\r\n//| Purpose: The Regex class represents a single compiled instance of| \r\n//| a regular expression. |\r\n//+------------------------------------------------------------------+\r\n//+------------------------------------------------------------------+\r\n//| Represents an immutable, compiled regular expression. Also |\r\n//| contains static methods that allow use of regular expressions |\r\n//| without instantiating a Regex explicitly. |\r\n//+------------------------------------------------------------------+\r\nclass Regex\r\n {\r\nprotected:\r\n string m_pattern;\r\n RegexOptions m_roptions;\r\nprivate:\r\n static const TimeSpan MaximumMatchTimeout;\r\npublic:\r\n static const TimeSpan InfiniteMatchTimeout;\r\nprotected:\r\n TimeSpan m_internalMatchTimeout;// timeout for the execution of this regex\r\nprivate:\r\n static const string DefaultMatchTimeout_ConfigKeyName;\r\npublic:\r\n static const TimeSpan FallbackDefaultMatchTimeout;\r\n static const TimeSpan DefaultMatchTimeout;\r\nprotected:\r\n Dictionary*m_caps; // if captures are sparse, this is the hashtable capnum->index\r\n Dictionary*m_capnames; // if named captures are used, this maps names->index\r\n string m_capslist[]; // if captures are sparse or named captures are used, this is the sorted list of names\r\n int m_capsize; // the size of the capture array\r\n RegexTree *m_tree;\r\n RunnerReference *m_runnerref; // cached runner\r\n ReplacementReference*m_replref; // cached parsed replacement pattern\r\n RegexCode *m_code; // if interpreted, this is the code for RegexIntepreter\r\n bool m_refsInitialized;// Default is false\r\n static LinkedListm_livecode;// the cached of code that are currently loaded\r\n static int m_cacheSize; // Default is 15\r\npublic:\r\n static const int MaxOptionShift;\r\npublic:\r\n //--- Constructors:\r\n //+------------------------------------------------------------------+\r\n //| Initializes a new instance of the Regex class. |\r\n //+------------------------------------------------------------------+\r\n Regex() : m_refsInitialized(false)\r\n {\r\n this.m_internalMatchTimeout=DefaultMatchTimeout;\r\n }\r\n //+------------------------------------------------------------------+\r\n //| Creates and compiles a regular expression object for the |\r\n //| specified regular expression. |\r\n //+------------------------------------------------------------------+\r\n Regex(const string pattern) : m_refsInitialized(0)\r\n {\r\n Initialize(pattern,None,DefaultMatchTimeout,false);\r\n }\r\n //+------------------------------------------------------------------+\r\n //| Creates and compiles a regular expression object for the |\r\n //| specified regular expression with options that modify the |\r\n //| pattern. |\r\n //+------------------------------------------------------------------+\r\n Regex(const string pattern,RegexOptions options) : m_refsInitialized(0)\r\n {\r\n Initialize(pattern,options,DefaultMatchTimeout,false);\r\n }\r\n //+------------------------------------------------------------------+\r\n //| Initializes a new instance of the Regex class for the specified |\r\n //| regular expression,with options that modify the pattern and a |\r\n //| value that specifies how long a pattern matching method should |\r\n //| attempt a match before it times out. |\r\n //+------------------------------------------------------------------+\r\n Regex(const string pattern,RegexOptions options,const TimeSpan &matchTimeout) : m_refsInitialized(0)\r\n {\r\n Initialize(pattern,options,matchTimeout,false);\r\n }\r\n //--- Destructors: \r\n //+------------------------------------------------------------------+\r\n //| Destructor without parameters. |\r\n //+------------------------------------------------------------------+\r\n ~Regex()\r\n {\r\n if(CheckPointer(m_tree)==POINTER_DYNAMIC)\r\n {\r\n delete m_tree;\r\n }\r\n if(CheckPointer(m_caps)==POINTER_DYNAMIC)\r\n {\r\n delete m_caps;\r\n }\r\n bool deleteRun=true;\r\n bool deleteRepl = true;\r\n bool deleteCode = true;\r\n for(LinkedListNode*current=m_livecode.First(); current!=NULL; current=current.Next())\r\n {\r\n if(CheckPointer(current.Value())==POINTER_DYNAMIC)\r\n {\r\n if(current.Value().RunnerRef()==m_runnerref)\r\n {\r\n deleteRun=false;\r\n }\r\n if(current.Value().ReplRef()==m_replref)\r\n {\r\n deleteRepl=false;\r\n }\r\n if(current.Value().Code()==m_code)\r\n {\r\n deleteCode=false;\r\n }\r\n }\r\n }\r\n if(CheckPointer(m_replref)==POINTER_DYNAMIC && deleteRepl)\r\n {\r\n delete m_replref;\r\n }\r\n if(CheckPointer(m_runnerref)==POINTER_DYNAMIC && deleteRun)\r\n {\r\n delete m_runnerref;\r\n }\r\n if(CheckPointer(m_code)==POINTER_DYNAMIC && deleteCode)\r\n {\r\n delete m_code;\r\n }\r\n }\r\nprivate:\r\n //+------------------------------------------------------------------+\r\n //| General constructor with parameters. |\r\n //+------------------------------------------------------------------+\r\n Regex(const string pattern,RegexOptions options,const TimeSpan &matchTimeout,const bool useCache) : m_refsInitialized(0)\r\n {\r\n Initialize(pattern,options,matchTimeout,useCache);\r\n }\r\n //--- Methods:\r\n //+------------------------------------------------------------------+\r\n //| Initialize. |\r\n //+------------------------------------------------------------------+\r\n void Initialize(const string pattern,RegexOptions options,const TimeSpan &matchTimeout,const bool useCache)\r\n {\r\n RegexTree *tree;\r\n CachedCodeEntry *cached=NULL;\r\n if(pattern==NULL)\r\n {\r\n Print(\"Argument 'pattern'= Null.\");\r\n //--- return\r\n return;\r\n }\r\n if(options>MaxOptionShift)!=0)\r\n {\r\n Print(\"Argument 'options' out of range.\");\r\n //--- return \r\n return;\r\n }\r\n if((options &ECMAScript)!=0\r\n && (options &~(ECMAScript|IgnoreCase|Multiline\r\n #ifdef _DEBUG\r\n |Debug\r\n #endif\r\n ))!=0)\r\n {\r\n Print(\"Argument 'options' out of range\");\r\n //--- return\r\n return;\r\n }\r\n ValidateMatchTimeout(matchTimeout);\r\n //--- Try to look up this regex in the cache. We do this regardless of whether useCache is true since there's really no reason not to. \r\n string key=IntegerToString(options)+\":\"+pattern;\r\n cached=LookupCachedAndUpdate(key);\r\n this.m_pattern=pattern;\r\n this.m_roptions=options;\r\n this.m_internalMatchTimeout=matchTimeout;\r\n if(cached==NULL)\r\n {\r\n //--- Parse the input\r\n tree=RegexParser::Parse(pattern,(RegexOptions)m_roptions);\r\n //--- Extract the relevant information\r\n m_capnames=tree.CapNames();\r\n tree.GetCapsList(m_capslist);\r\n m_code = RegexWriter::Write(tree);\r\n m_caps = m_code.Caps();\r\n m_capsize = m_code.CapSize();\r\n InitializeReferences();\r\n m_tree=tree;\r\n if(useCache)\r\n {\r\n cached=CacheCode(key);\r\n }\r\n }\r\n else\r\n {\r\n m_caps = cached.Caps();\r\n m_capnames = cached.CapNames();\r\n cached.GetCapList(m_capslist);\r\n m_capsize = cached.CapSize();\r\n m_code = cached.Code();\r\n m_runnerref = cached.RunnerRef();\r\n m_replref = cached.ReplRef();\r\n m_refsInitialized=true;\r\n }\r\n }\r\npublic:\r\n //--- Methods:\r\n //+------------------------------------------------------------------+\r\n //| Pattern. |\r\n //+------------------------------------------------------------------+\r\n string Pattern()\r\n {\r\n //--- return pattern\r\n return (m_pattern);\r\n }\r\n //+------------------------------------------------------------------+\r\n //| Validates that the specified match timeout value is valid. |\r\n //| The valid range is: | \r\n //| TimeSpan::Zero < matchTimeout <= Regex::MaximumMatchTimeout. |\r\n //+------------------------------------------------------------------+\r\n static void ValidateMatchTimeout(const TimeSpan &matchTimeout)\r\n {\r\n if(InfiniteMatchTimeout==matchTimeout)\r\n {\r\n //--- return\r\n return;\r\n }\r\n //--- Change this to make sure timeout is not longer then Environment.Ticks cycle length:\r\n if(TimeSpan::Zero()*Caps()\r\n {\r\n //---\r\n return (m_caps);\r\n }\r\n Dictionary*CapNames()\r\n {\r\n //--- return \r\n return (m_capnames);\r\n }\r\n int CapSize()\r\n {\r\n //--- \r\n return (m_capsize);\r\n }\r\n //+------------------------------------------------------------------+\r\n //| Returns the options passed into the constructor. |\r\n //+------------------------------------------------------------------+\r\n RegexOptions Options()\r\n {\r\n //--- return\r\n return (m_roptions);\r\n }\r\n //+------------------------------------------------------------------+\r\n //| Escape metacharacters within the string. |\r\n //+------------------------------------------------------------------+\r\n static string Escape(const string str)\r\n {\r\n if(StringLen(str)==NULL)\r\n {\r\n Print(\"Argument 'str' = NULL.\");\r\n //--- return NULL\r\n return (NULL);\r\n }\r\n //--- return result\r\n return RegexParser::Escape(str);\r\n }\r\n //+------------------------------------------------------------------+\r\n //| Unescape character codes within the string. |\r\n //+------------------------------------------------------------------+\r\n static string Unescape(const string str)\r\n {\r\n if(StringLen(str)==NULL)\r\n {\r\n Print(\"Argument 'str' = NULL.\");\r\n //--- return NULL\r\n return (NULL);\r\n }\r\n //--- return result\r\n return RegexParser::Unescape(str);\r\n }\r\n //+------------------------------------------------------------------+\r\n //| CacheCount. |\r\n //+------------------------------------------------------------------+\r\n static int CacheCount()\r\n {\r\n //--- return count\r\n return (m_livecode.Count());\r\n }\r\n //+------------------------------------------------------------------+\r\n //| CacheSize. |\r\n //+------------------------------------------------------------------+\r\n static int CacheSize()\r\n {\r\n //--- return size\r\n return (m_cacheSize);\r\n }\r\n //+------------------------------------------------------------------+\r\n //| CacheSize. |\r\n //+------------------------------------------------------------------+\r\n static void CacheSize(const int value)\r\n {\r\n if(value<0)\r\n {\r\n Print(\"Argument 'value' out of range.\");\r\n //--- return\r\n return;\r\n }\r\n m_cacheSize=value;\r\n if(m_livecode.Count()>m_cacheSize)\r\n {\r\n while(m_livecode.Count()>m_cacheSize)\r\n {\r\n m_livecode.RemoveLast();\r\n }\r\n }\r\n }\r\n //+------------------------------------------------------------------+\r\n //| The match timeout used by this Regex instance. |\r\n //+------------------------------------------------------------------+\r\n TimeSpan MatchTimeout()\r\n {\r\n //--- return result\r\n return (m_internalMatchTimeout);\r\n }\r\n //+------------------------------------------------------------------+\r\n //| True if the regex is leftward. |\r\n //| |\r\n //| Indicates whether the regular expression matches from right to |\r\n //| left. |\r\n //+------------------------------------------------------------------+\r\n bool RightToLeft()\r\n {\r\n //--- return result\r\n return UseOptionR();\r\n }\r\n //+------------------------------------------------------------------+\r\n //| Returns the regular expression pattern passed into the |\r\n //| constructor. |\r\n //+------------------------------------------------------------------+\r\n string ToString()\r\n {\r\n //--- return result\r\n return (m_pattern);\r\n }\r\n //+------------------------------------------------------------------+\r\n //| Returns an array of the group names that are used to capture |\r\n //| groups in the regular expression. Only needed if the regex is not|\r\n //| known until runtime, and one wants to extract captured groups. |\r\n //| (Probably unusual, but supplied for completeness.). |\r\n //+------------------------------------------------------------------+\r\n void GetGroupNames(string &result[])\r\n {\r\n if(ArraySize(m_capslist)==NULL)\r\n {\r\n int max=m_capsize;\r\n ArrayResize(result,max);\r\n for(int i=0; i*de=m_caps.GetEnumerator();\r\n while(de.MoveNext())\r\n {\r\n result[(int)de.Value()]=(int)de.Key();\r\n }\r\n delete de;\r\n }\r\n }\r\n //+------------------------------------------------------------------+\r\n //| Given a group number, maps it to a group name. Note that nubmered|\r\n //| groups automatically get a group name that is the decimal string |\r\n //| equivalent of its number. |\r\n //+------------------------------------------------------------------+\r\n string GroupNameFromNumber(const int index)\r\n {\r\n int i=index;\r\n if(ArraySize(m_capslist)==NULL)\r\n {\r\n if(i>=0 && i=0 && i'9' || ch<'0')\r\n {\r\n //--- return result\r\n return (-1);\r\n }\r\n result *= 10;\r\n result += (ch - '0');\r\n }\r\n //--- return int if it's in range\r\n if(result>=0 && resultStringLen(in))\r\n {\r\n Print(\"Argument 'start' out of range.\");\r\n //--- return NULL\r\n return (NULL);\r\n }\r\n if(length<0 || length>StringLen(in))\r\n {\r\n Print(\"Argument 'length' out of range.\");\r\n //--- return NULL\r\n return (NULL);\r\n }\r\n bool fromCache=false;\r\n //--- There may be a cached runner; grab ownership of it if we can.\r\n if(m_runnerref!=NULL)\r\n {\r\n fromCache=true;\r\n runner=m_runnerref.Get();\r\n }\r\n //--- Create a RegexRunner instance if we need to\r\n if(runner==NULL)\r\n {\r\n fromCache=false;\r\n //--- Use the compiled RegexRunner factory if the code was compiled to MSIL\r\n runner=new RegexInterpreter(m_code);\r\n }\r\n //--- Do the scan starting at the requested position \r\n match=runner.Scan(GetPointer(this),in,beginning,beginning+length,startat,prevlen,quick,m_internalMatchTimeout);\r\n if(m_runnerref!=NULL && !fromCache)\r\n {\r\n if(CheckPointer(m_runnerref.Get())==POINTER_DYNAMIC)\r\n {\r\n delete m_runnerref.Get();\r\n }\r\n //--- Release or fill the cache slot\r\n m_runnerref.Set(runner);\r\n }\r\n else if(!fromCache)\r\n {\r\n delete runner;\r\n }\r\n#ifdef _DEBUG\r\n if(Debug() && match!=NULL)\r\n {\r\n match.Dump();\r\n }\r\n#endif\r\n //--- return result\r\n return (match);\r\n }\r\n //+------------------------------------------------------------------+\r\n //| Find code cache based on options+pattern. |\r\n //+------------------------------------------------------------------+\r\n static CachedCodeEntry *LookupCachedAndUpdate(const string key)\r\n {\r\n for(LinkedListNode*current=m_livecode.First(); current!=NULL; current=current.Next())\r\n {\r\n if(current.Value().Key()==key)\r\n {\r\n //--- If we find an entry in the cache, move it to the head at the same time. \r\n m_livecode.Remove(current);\r\n m_livecode.AddFirst(current);\r\n //--- retrun result\r\n return (current.Value());\r\n }\r\n }\r\n //--- return result\r\n return (NULL);\r\n }\r\n //+------------------------------------------------------------------+\r\n //| Add current code to the cache. |\r\n //+------------------------------------------------------------------+\r\n CachedCodeEntry *CacheCode(const string key)\r\n {\r\n CachedCodeEntry *newcached=NULL;\r\n //--- first look for it in the cache and move it to the head\r\n for(LinkedListNode*current=m_livecode.First(); current!=NULL; current=current.Next())\r\n {\r\n if(current.Value().Key()==key)\r\n {\r\n m_livecode.Remove(current);\r\n m_livecode.AddFirst(current);\r\n //--- return result\r\n return (current.Value());\r\n }\r\n }\r\n //--- it wasn't in the cache, so we'll add a new one. Shortcut out for the case where cacheSize is zero.\r\n if(m_cacheSize!=0)\r\n {\r\n newcached=new CachedCodeEntry(key,m_capnames,m_capslist,m_code,m_caps,m_capsize,m_runnerref,m_replref);\r\n m_livecode.AddFirst(newcached);\r\n if(m_livecode.Count()>m_cacheSize)\r\n {\r\n m_livecode.RemoveLast();\r\n }\r\n }\r\n //--- return result\r\n return (newcached);\r\n }\r\n //+------------------------------------------------------------------+\r\n //| Delete all objects in cache. |\r\n //+------------------------------------------------------------------+\r\n static void ClearCache()\r\n {\r\n IEnumerator*en=m_livecode.GetEnumerator();\r\n while(en.MoveNext())\r\n {\r\n if(CheckPointer(en.Current())==POINTER_DYNAMIC)\r\n {\r\n if(CheckPointer(en.Current().RunnerRef().Get().RunRegex())==POINTER_DYNAMIC)\r\n {\r\n delete en.Current().RunnerRef().Get().RunRegex();\r\n }\r\n delete en.Current();\r\n }\r\n }\r\n delete en;\r\n }\r\n //+------------------------------------------------------------------+\r\n //| True if the O option was set. |\r\n //+------------------------------------------------------------------+\r\n bool UseOptionC()\r\n {\r\n return(m_roptions) != 0;\r\n }\r\n //+------------------------------------------------------------------+\r\n //| True if the L option was set. |\r\n //+------------------------------------------------------------------+\r\n bool UseOptionR()\r\n {\r\n return(m_roptions & RightToLeft) != 0;\r\n }\r\n //+------------------------------------------------------------------+\r\n //| UseOptionInvariant. |\r\n //+------------------------------------------------------------------+\r\n bool UseOptionInvariant()\r\n {\r\n return(m_roptions) != 0;\r\n }\r\n#ifdef _DEBUG\r\n //+------------------------------------------------------------------+\r\n //| True if the regex has debugging enabled. |\r\n //+------------------------------------------------------------------+\r\n bool Debug()\r\n {\r\n //--- return result\r\n return((m_roptions &Debug) != 0);\r\n }\r\n#endif\r\n };\r\nstatic const TimeSpan Regex::MaximumMatchTimeout=TimeSpan::FromMilliseconds(Int32::MaxValue-1);\r\nstatic const TimeSpan Regex::InfiniteMatchTimeout(0,0,0,0,-1);\r\nstatic const string Regex::DefaultMatchTimeout_ConfigKeyName=\"REGEX_DEFAULT_MATCH_TIMEOUT\";\r\nstatic const TimeSpan Regex::FallbackDefaultMatchTimeout=Regex::InfiniteMatchTimeout;\r\nstatic const TimeSpan Regex::DefaultMatchTimeout=Regex::InitDefaultMatchTimeout();\r\nstatic LinkedListRegex::m_livecode();\r\nstatic int Regex::m_cacheSize=15;\r\nstatic const int Regex::MaxOptionShift=10;\r\n//+------------------------------------------------------------------+\r\n//| Purpose: Used to cache byte codes or compiled factories. |\r\n//+------------------------------------------------------------------+\r\nclass CachedCodeEntry : public IComparable\r\n {\r\nprivate:\r\n string m_key;\r\n RegexCode *m_code;\r\n Dictionary*m_caps;\r\n Dictionary*m_capnames;\r\n string m_capslist[];\r\n int m_capsize;\r\n RunnerReference *m_runnerref;\r\n ReplacementReference *m_replref;\r\npublic:\r\n //--- Constructors:\r\n //+------------------------------------------------------------------+\r\n //| Constructor with parameters. |\r\n //+------------------------------------------------------------------+\r\n CachedCodeEntry(const string key,Dictionary*capnames,const string &capslist[],\r\n RegexCode *code,Dictionary*caps,const int capsize,\r\n RunnerReference *runner,ReplacementReference *repl)\r\n {\r\n m_key=key;\r\n m_capnames=capnames;\r\n ArrayCopy(m_capslist,capslist);\r\n m_code= code;\r\n m_caps= caps;\r\n m_capsize=capsize;\r\n m_runnerref=runner;\r\n m_replref=repl;\r\n }\r\n //--- Destructors:\r\n //+------------------------------------------------------------------+\r\n //| destructor without parameters. |\r\n //+------------------------------------------------------------------+\r\n ~CachedCodeEntry()\r\n {\r\n if(CheckPointer(m_code)==POINTER_DYNAMIC)\r\n {\r\n delete m_code;\r\n }\r\n if(CheckPointer(m_caps)==POINTER_DYNAMIC)\r\n {\r\n delete m_caps;\r\n }\r\n if(CheckPointer(m_capnames)==POINTER_DYNAMIC)\r\n {\r\n delete m_capnames;\r\n }\r\n if(CheckPointer(m_replref)==POINTER_DYNAMIC)\r\n {\r\n delete m_replref;\r\n }\r\n if(CheckPointer(m_runnerref)==POINTER_DYNAMIC)\r\n {\r\n delete m_runnerref;\r\n }\r\n }\r\n //--- Methods:\r\n //+------------------------------------------------------------------+\r\n //| Gets the runnerref. |\r\n //+------------------------------------------------------------------+\r\n RunnerReference *RunnerRef()\r\n {\r\n //--- reurn runnerref\r\n return (m_runnerref);\r\n }\r\n //+------------------------------------------------------------------+\r\n //| Gets the replref. |\r\n //+------------------------------------------------------------------+\r\n ReplacementReference *ReplRef()\r\n {\r\n //--- return replref\r\n return (m_replref);\r\n }\r\n //+------------------------------------------------------------------+\r\n //| Gets the key. |\r\n //+------------------------------------------------------------------+\r\n string Key()\r\n {\r\n //--- return key\r\n return (m_key);\r\n }\r\n //+------------------------------------------------------------------+\r\n //| Gets the caps. |\r\n //+------------------------------------------------------------------+\r\n Dictionary*Caps()\r\n {\r\n //--- return caps\r\n return (m_caps);\r\n }\r\n //+------------------------------------------------------------------+\r\n //| Gets the capnames. |\r\n //+------------------------------------------------------------------+\r\n Dictionary*CapNames()\r\n {\r\n //--- return capnames\r\n return (m_capnames);\r\n }\r\n //+------------------------------------------------------------------+\r\n //| Gets the capsize. |\r\n //+------------------------------------------------------------------+\r\n int CapSize()\r\n {\r\n //--- retrun capsize\r\n return (m_capsize);\r\n }\r\n //+------------------------------------------------------------------+\r\n //| Gets the code. |\r\n //+------------------------------------------------------------------+\r\n RegexCode *Code()\r\n {\r\n //--- return code\r\n return (m_code);\r\n }\r\n //+------------------------------------------------------------------+\r\n //| Gets the caplist. |\r\n //+------------------------------------------------------------------+\r\n void GetCapList(string &array[])\r\n {\r\n ArrayCopy(array,m_capslist);\r\n }\r\n };\r\n//+------------------------------------------------------------------+\r\n//| Used to cache a weak reference in a threadsafe way. |\r\n//+------------------------------------------------------------------+\r\nclass ReplacementReference\r\n {\r\nprivate:\r\n RegexReplacement *m_obj;\r\npublic:\r\n //--- Destructors:\r\n //+------------------------------------------------------------------+\r\n //| Destructor without parameters. |\r\n //+------------------------------------------------------------------+ \r\n ~ReplacementReference()\r\n {\r\n if(CheckPointer(m_obj)==POINTER_DYNAMIC)\r\n {\r\n delete m_obj;\r\n }\r\n }\r\n //--- Methods:\r\n //+------------------------------------------------------------------+\r\n //| Get RegexReplacement. |\r\n //+------------------------------------------------------------------+\r\n RegexReplacement *Get()\r\n {\r\n //--- return pointer\r\n return (m_obj);\r\n }\r\n //+------------------------------------------------------------------+\r\n //| Set RegexReplacement. |\r\n //+------------------------------------------------------------------+\r\n void Set(RegexReplacement *obj)\r\n {\r\n m_obj=obj;\r\n }\r\n };\r\n//+------------------------------------------------------------------+\r\n//| Used to cache one exclusive runner reference. |\r\n//+------------------------------------------------------------------+\r\nclass RunnerReference\r\n {\r\nprivate:\r\n RegexRunner *m_obj;\r\npublic:\r\n //--- Destructors:\r\n //+------------------------------------------------------------------+\r\n //| Destructor without parameters. |\r\n //+------------------------------------------------------------------+ \r\n ~RunnerReference()\r\n {\r\n if(CheckPointer(m_obj)==POINTER_DYNAMIC)\r\n {\r\n delete m_obj;\r\n }\r\n }\r\n //--- Methods:\r\n //+------------------------------------------------------------------+\r\n //| Get RegexRunner. |\r\n //+------------------------------------------------------------------+\r\n RegexRunner *Get()\r\n {\r\n //--- return pointer\r\n return (m_obj);\r\n }\r\n //+------------------------------------------------------------------+\r\n //| Set RegexRunner. |\r\n //+------------------------------------------------------------------+\r\n void Set(RegexRunner *obj)\r\n {\r\n m_obj=obj;\r\n }\r\n };\r\n//+------------------------------------------------------------------+\r\n" }, { "path": "src/test/resources/samples/langs/MQL5/indicator-sample.mq5", "content": "//+------------------------------------------------------------------+\r\n//| indicator-sample.mq5 |\r\n//| Copyright 2016, Andrey Osorgin |\r\n//+------------------------------------------------------------------+\r\n//| The MIT License (MIT) |\r\n//| |\r\n//| Permission is hereby granted, free of charge, to any person |\r\n//| obtaining a copy of this software and associated documentation |\r\n//| files (the \"Software\"), to deal in the Software without |\r\n//| restriction, including without limitation the rights to use, |\r\n//| copy, modify, merge, publish, distribute, sublicense, and/or sell|\r\n//| copies of the Software, and to permit persons to whom the |\r\n//| Software is furnished to do so, subject to the following |\r\n//| conditions: |\r\n//| |\r\n//| The above copyright notice and this permission notice shall be |\r\n//| included in all copies or substantial portions of the Software. |\r\n//| |\r\n//| THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, |\r\n//| EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES |\r\n//| OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND |\r\n//| NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT |\r\n//| HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, |\r\n//| WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING |\r\n//| FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR |\r\n//| OTHER DEALINGS IN THE SOFTWARE. |\r\n//| |\r\n//| A copy of the MIT License (MIT) is available at |\r\n//| https://opensource.org/licenses/MIT |\r\n//+------------------------------------------------------------------+\r\n#property version \"1.00\"\r\n\r\n#property indicator_chart_window\r\n#property indicator_plots 0\r\n//+------------------------------------------------------------------+\r\n//| Custom indicator initialization function |\r\n//+------------------------------------------------------------------+\r\nint OnInit()\r\n {\r\n//---\r\n return(INIT_SUCCEEDED);\r\n }\r\n//+------------------------------------------------------------------+\r\n//| Custom indicator iteration function |\r\n//+------------------------------------------------------------------+\r\nint OnCalculate(const int rates_total,\r\n const int prev_calculated,\r\n const datetime &time[],\r\n const double &open[],\r\n const double &high[],\r\n const double &low[],\r\n const double &close[],\r\n const long &tick_volume[],\r\n const long &volume[],\r\n const int &spread[])\r\n {\r\n//---\r\n int bars=Bars(Symbol(),0);\r\n Print(\"Bars = \",bars,\", rates_total = \",rates_total,\", prev_calculated = \",prev_calculated);\r\n Print(\"time[0] = \",time[0],\" time[rates_total-1] = \",time[rates_total-1]);\r\n//--- return value of prev_calculated for next call\r\n return(rates_total);\r\n }\r\n//+------------------------------------------------------------------+\r\n" }, { "path": "src/test/resources/samples/langs/MQL5/script-sample.mq5", "content": "//+------------------------------------------------------------------+\r\n//| script-sample.mq5 |\r\n//| Copyright 2016, Andrey Osorgin |\r\n//+------------------------------------------------------------------+\r\n//| The MIT License (MIT) |\r\n//| |\r\n//| Permission is hereby granted, free of charge, to any person |\r\n//| obtaining a copy of this software and associated documentation |\r\n//| files (the \"Software\"), to deal in the Software without |\r\n//| restriction, including without limitation the rights to use, |\r\n//| copy, modify, merge, publish, distribute, sublicense, and/or sell|\r\n//| copies of the Software, and to permit persons to whom the |\r\n//| Software is furnished to do so, subject to the following |\r\n//| conditions: |\r\n//| |\r\n//| The above copyright notice and this permission notice shall be |\r\n//| included in all copies or substantial portions of the Software. |\r\n//| |\r\n//| THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, |\r\n//| EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES |\r\n//| OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND |\r\n//| NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT |\r\n//| HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, |\r\n//| WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING |\r\n//| FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR |\r\n//| OTHER DEALINGS IN THE SOFTWARE. |\r\n//| |\r\n//| A copy of the MIT License (MIT) is available at |\r\n//| https://opensource.org/licenses/MIT |\r\n//+------------------------------------------------------------------+\r\n#property version \"1.00\"\r\n#property script_show_inputs\r\n\r\n#include \r\n\r\ninput int StopLoss=100; // Stop Loss\r\ninput int TakeProfit=100; // Take Profit\r\n//+------------------------------------------------------------------+\r\n//| Script program start function |\r\n//+------------------------------------------------------------------+\r\nvoid OnStart()\r\n {\r\n CTrade trade;\r\n//---\r\n long stoplevel=SymbolInfoInteger(Symbol(),SYMBOL_TRADE_STOPS_LEVEL);\r\n Print(\"Minimum stop level is: \",stoplevel);\r\n double ask=SymbolInfoDouble(Symbol(),SYMBOL_ASK);\r\n double bid=SymbolInfoDouble(Symbol(),SYMBOL_BID);\r\n double sl = NormalizeDouble(bid - StopLoss*Point(),Digits());\r\n double tp = NormalizeDouble(ask + TakeProfit*Point(),Digits());\r\n//---\r\n bool result=trade.Buy(0.01,Symbol(),ask,sl,tp,\"test\");\r\n//---\r\n Print(\"Success? \",result);\r\n }\r\n//+------------------------------------------------------------------+\r\n" }, { "path": "src/test/resources/samples/langs/MTML/categories_to_columns.mtml", "content": "<$mt:Var name=\"num_cols\" value=\"6\"$>\n<$mt:Var name=\"index\" value=\"0\"$>\n\n <$mt:Var name=\"index\" op=\"++\" setvar=\"index\"$>\n \n \"><$mt:CategoryLabel remove_html=\"1\"$>\n \n\n<$mt:Var name=\"categories\" function=\"count\" setvar=\"cat_count\"$>\n<$mt:Var name=\"cat_count\" op=\"%\" value=\"$num_cols\" setvar=\"modulus\"$>\n\n <$mt:Var name=\"cat_count\" op=\"-\" value=\"$modulus\" setvar=\"cat_count_minus_mod\"$>\n <$mt:Var name=\"cat_count_minus_mod\" op=\"/\" value=\"$num_cols\" setvar=\"cats_per_col\"$>\n <$mt:Var name=\"cats_per_col\" op=\"+\" value=\"1\" setvar=\"cats_per_col\"$>\n\n <$mt:Var name=\"cat_count\" op=\"/\" value=\"$num_cols\" setvar=\"cats_per_col\"$>\n\n\n <$mt:Var name=\"index\" op=\"++\" setvar=\"index\"$>\n \n <$mt:Var name=\"categories{$index}\"$>\n \n\n\n<$mt:Var name=\"index\" value=\"0\"$>\n<$mt:Var name=\"col_num\" value=\"1\"$>\n\n
\">\n \n <$mt:Var name=\"for_inner\"$>\n \n
\n <$mt:Var name=\"col_num\" op=\"++\" setvar=\"col_num\"$>\n\n\n" }, { "path": "src/test/resources/samples/langs/MUF/39.m", "content": "$include $lib/strings\n$include $lib/match\nlvar check-obj-addr\n \n: check-next-loop (d -- )\n dup not if pop exit then\n dup exit? over thing? or\n me @ 3 pick .controls and if\n dup check-obj-addr @ execute\n then\n next check-next-loop\n;\n \n: check-contents (d -- )\n contents check-next-loop\n;\n \n: check-exits (d -- )\n exits check-next-loop\n;\n \n: exec-err (d mtypestr warnstr -- )\n \"On \" 4 rotate unparseobj strcat\n \", in it's \" strcat rot strcat\n \", \" strcat swap strcat .tell\n;\n \n: can-linkto? (player object -- i)\n dup \"link_ok\" flag? if pop pop 1 exit then\n .controls\n;\n \n: check-exec (d mtype execstr -- )\n dup \"@\" 1 strncmp if pop pop pop exit then\n 1 strcut swap pop\n \" \" .split pop\n dup \"$\" 1 strncmp not if\n dup match ok? not if\n \" is not a known registered program.\" strcat\n exec-err exit\n then\n dup match program? not if\n \" is not a program.\" strcat\n exec-err exit\n then\n 3 pick owner over match can-linkto? not if\n \" is not Link_OK.\" strcat\n exec-err exit\n then\n else\n dup number? not if\n \" is not a program dbref.\" strcat\n \"@\" swap strcat exec-err exit\n then\n dup atoi dbref ok? not if\n \" is not a valid program reference.\" strcat\n \"@\" swap strcat exec-err exit\n then\n dup atoi dbref program? not if\n \" is not a valid program reference.\" strcat\n \"@\" swap strcat exec-err exit\n then\n 3 pick owner over atoi dbref can-linkto? not if\n \" is not Link_OK.\" strcat\n \"@\" swap strcat exec-err exit\n then\n then\n pop pop pop\n;\n \n \n: missing-err ( d s -- )\n swap unparseobj\n \" is missing an \"\n strcat swap strcat\n \" message.\" strcat .tell\n;\n \n: colon-err ( d s -- )\n swap unparseobj\n \" has an unnecesary ':' at the start of its \"\n strcat swap strcat\n \" message.\" strcat .tell\n;\n \n: check-desc (d -- )\n dup desc not if\n \"@description\" missing-err\n else\n \"@description\" over\n desc check-exec\n then\n;\n \n: check-succ (d -- )\n dup succ not if\n \"@success\" missing-err\n else\n \"@success\" over\n succ check-exec\n then\n;\n \n: check-fail (d -- )\n dup fail not if\n \"@fail\" missing-err\n else\n \"@fail\" over\n fail check-exec\n then\n;\n \n: check-drop (d -- )\n dup drop not if\n \"@drop\" missing-err\n else\n \"@drop\" over\n drop check-exec\n then\n;\n \n: check-osucc (d -- )\n dup osucc not if\n \"@osuccess\" missing-err\n else\n dup osucc \":\" 1 strncmp not if\n \"@osuccess\" colon-err\n else pop\n then\n then\n;\n \n: check-ofail (d -- )\n dup ofail not if\n \"@ofail\" missing-err\n else\n dup ofail \":\" 1 strncmp not if\n \"@ofail\" colon-err\n else pop\n then\n then\n;\n \n: check-odrop (d -- )\n dup odrop not if\n \"@odrop\" missing-err\n else\n dup odrop \":\" 1 strncmp not if\n \"@odrop\" colon-err\n else pop\n then\n then\n;\n \n \n$define islocked? (d -- i) getlockstr \"*UNLOCKED*\" stringcmp $enddef\n \n: islocked_always? (d -- i)\n getlockstr dup \"#0\" stringcmp not if pop 1 exit then\n dup \"#\" STRsplit swap pop atoi\n \"#\" swap intostr strcat\n (lockstr \"#dbref\")\n dup \"&!\" over strcat strcat\n 3 pick stringcmp not if pop pop 1 exit then\n \"&\" over strcat strcat \"!\" swap strcat\n stringcmp not if 1 exit then\n 0\n;\n \n: check-link ( d -- )\n dup getlink not if\n dup unparseobj \" is unlinked.\" strcat .tell\n else\n dup getlink over location dbcmp if\n dup islocked? not if\n dup unparseobj\n \" is linked to it's location, but is unlocked.\"\n strcat .tell\n then\n else (is not linked to it's location)\n dup getlink program? if\n dup dup owner swap getlink can-linkto? not if\n dup unparseobj\n \" is linked to a program which is not Link_OK.\"\n strcat .tell\n then\n then\n then\n then\n pop\n;\n \n: check-room (d -- )\n dup check-desc\n dup islocked? if\n dup islocked_always? not if\n dup check-succ\n then\n dup check-fail\n then\n dup getlink if\n dup check-drop\n dup check-odrop\n then\n dup check-contents\n check-exits\n;\n \n: check-exit ( d -- )\n dup check-link\n dup check-desc\n dup getlink dup ok? if\n program? not if\n dup islocked_always? not if\n dup check-succ\n dup check-osucc\n dup check-odrop\n then\n dup islocked? if\n dup check-fail\n dup check-ofail\n then\n then\n else pop\n then\n pop\n;\n \n: check-thing ( d -- )\n dup check-desc\n dup islocked_always? not if\n dup check-succ\n dup check-osucc\n then\n dup islocked? if\n dup check-fail\n dup check-ofail\n then\n dup check-drop\n dup check-odrop\n check-exits\n;\n \n: check-player ( d -- )\n dup check-desc\n dup islocked_always? not if\n dup check-succ\n dup check-osucc\n then\n dup islocked? if\n dup check-fail\n dup check-ofail\n then\n dup check-contents\n check-exits\n;\n \n: check-program ( d -- )\n check-desc\n;\n \n: check-obj (d -- )\n dup room? if check-room exit then\n dup exit? if check-exit exit then\n dup thing? if check-thing exit then\n dup player? if check-player exit then\n check-program\n;\n \n: main\n 'check-obj check-obj-addr !\n .strip dup not if pop \"here\" then\n .match_controlled\n dup #-3 dbcmp if pop me @ getlink then\n dup ok? not if pop exit then\n check-obj\n me @ \"Check done.\" notify\n;\n" }, { "path": "src/test/resources/samples/langs/MUF/cmd-say.muf", "content": "@program cmd-say.muf\n1 1000 d\ni\n( cmd-say.muf by Natasha@HLM\n\n Copyright 2002-2004 Natasha Snunkmeox. Copyright 2002-2004 Here Lie Monsters.\n \"@view $box/mit\" for license information.\n)\n$author Natasha Snunkmeox \n$note Say for Fuzzball 6.\n$version 1.0\n\n$include $lib/ignore\n$include $lib/strings\n$include $lib/match\n\n$def str_program \"saypose\"\n$def prop_third \"_prefs/say/third\"\n$def prop_quotes \"_say/def/quotes\"\n$def prop_overb \"_say/def/osay\"\n$def prop_verb \"_say/def/say\"\n$def prop_split \"_prefs/say/split\"\n$def prop_color \"_prefs/say/color\"\n$def prop_meow \"_prefs/say/meow\"\n\nlvar randomWord\n\nlvar verb\nlvar overb\nlvar lquo\nlvar rquo\nlvar splitsay\n\n: rtn-getThirdVerb[ var:overb -- ]\n ( Get the third-person verb. )\n me @ prop_overb getpropstr dup if ( str strOverb )\n strip dup dup \",\" instr not and if \",\" strcat then\n else pop \"says,\" then ( str strOverb )\n me @ \"%D %s\" fmtstring overb @ ! ( str )\n;\n\n: rtn-getFirstVerb[ var:verb var:overb -- ]\n me @ prop_third getpropstr .yes? not if ( str )\n ( Get the first-person verb. )\n me @ prop_verb getpropstr dup if ( str strVerb )\n strip dup dup \",\" instr not and if \",\" strcat then\n else pop \"say,\" then ( str strVerb )\n splitsay @ if \"you %s\" else \"You %s\" then fmtstring ( str strVerb )\n else overb @ @ then verb @ ! ( str )\n;\n\n: rtn-getQuotes[ var:lquo var:rquo -- ]\n me @ prop_quotes getpropstr dup \"%m\" instr if ( strQuotes )\n \"%m\" split ( strLquo strRquo )\n else pop \"\\\"\" dup then ( strLquo strRquo )\n rquo @ ! lquo @ ! ( )\n;\n\n: do-say ( str -- )\n \"\" randomWord !\n\n var who\n var exclude\n\n ( Ignoring? Get 'em outta here. )\n loc @ contents_array ( str arrHere )\n dup me @ str_program array_get_ignorers ( str arrHere arrIgnorers )\n dup exclude !\n swap array_diff who !\n\n\n ( Anyone #meowing this player? Go ahead and notify before special formatting. )\n who @ prop_meow me @ owner \"*{%d}*\" fmtstring array_filter_prop ( str arrMeow )\n dup if ( str arrMeow )\n dup who @ array_diff who ! ( str arrMeow )\n dup exclude @ array_union exclude ! ( str arrMeow )\n\n over ansi_strip ( str arrMeow str )\n \"\\\\b[A-Z0-9_]+\\\\b\" \"MEOW\" REG_ALL regsub ( str arrMeow str' )\n \"\\\\b[A-Z0-9_][A-Za-z0-9_]*[a-z][A-Za-z0-9_]*\\\\b\" \"Meow\" REG_ALL regsub ( str arrMeow str' )\n \"\\\\b[a-z_][A-Za-z0-9_]*\\\\b\" \"meow\" REG_ALL regsub ( str arrMeow str' )\n me @ \"%D meows, \\\"%s\\\"\" fmtstring ( str arrMeow str\" )\n 1 array_make swap array_notify ( str )\n else pop then ( str )\n\n\n var msg\n\n dup \",,\" instr ( str boolCommas )\n me @ prop_split getpropstr .no? not ( str boolCommas boolSplitOK )\n and if ( str )\n \",,\" split ( str- -str )\n\n ( User-supplied verb? )\n dup \",,\" instr if\n \",,\" split ( str- strVerb -str )\n swap dup if ( str- -str strVerb )\n strip ( str- -str strVerb )\n dup me @ name instr over tolower \"%n\" instr or if ( str- -str strVerb )\n \"%n\" \"%N\" subst me @ name \"%n\" subst ( str- -str strVerb )\n else\n me @ swap \"%s %D,\" fmtstring ( str- -str -str- )\n then ( str- -str -str- )\n dup \"*[-!.,:;]\" smatch not if \",\" strcat then ( str- -str -str- )\n dup verb ! overb ! ( str- -str )\n else pop then ( str- -str )\n then ( str- -str )\n\n 2 array_make ( arrMsg )\n 1\n else 0 then splitsay ! msg !\n\n\n verb @ string? not if\n overb rtn-getThirdVerb\n verb overb rtn-getFirstVerb\n then\n lquo rquo rtn-getQuotes ( str )\n\n\n ( Say. )\n msg @ string? if\n rquo @ msg @ lquo @ ( strRquo strMsg strLquo )\n \"%s %s%s%s\" ( strRquo strMsg strLquo strFormat )\n\n 4 dupn\n verb @ swap fmtstring .tell ( strRquo strMsg strLquo strFormat )\n overb @ swap fmtstring ( strOsay )\n else\n rquo @ msg @ array_vals pop ( strRquo strMsg strMsg2 )\n swap dup \"*[-!.,:;]\" smatch not if \",\" strcat then swap ( strRquo strMsg strMsg2 )\n ( Only handle strMsg if there's no strMsg2. )\n dup if ( strRquo strMsg strMsg2 )\n swap ( strRquo strMsg2 strMsg )\n lquo @ swap rquo @ swap lquo @ ( strRquo strMsg2 strLquo strRquo strMsg' strLquo )\n \"%s%s%s %s %s%s%s\" ( strRquo strMsg2 strLquo strRquo strMsg' strLquo strFormat )\n\n 7\n else ( strRquo strMsg strMsg2 )\n pop lquo @ ( strRquo strMsg' strLquo )\n \"%s%s%s %s\" ( strRquo strMsg' strLquo strFormat )\n\n verb @ \",$\" \".\" 0 regsub verb !\n overb @ \",$\" \".\" 0 regsub overb !\n\n 4\n then ( ... strRquo strMsg strLquo strFormat intDepth )\n\n dupn\n verb @ -5 rotate fmtstring .tell ( ... strRquo strMsg strLquo strFormat )\n overb @ -5 rotate fmtstring ( strOsay )\n then ( strOsay )\n\n\n ( Is there color to avoid? )\n dup \"\\[[\" instr if\n who @ prop_color \"{n*|0}\" array_filter_prop ( strOsay arrGreyed )\n dup if ( strOsay arrGreyed )\n over ansi_strip 1 array_make ( strOsay arrGreyed arrMsg )\n over array_notify ( strOsay arrGreyed )\n\n exclude @ array_union exclude ! ( strOsay )\n else pop then ( strOsay )\n then ( strOsay )\n\n loc @ ( strOsay db )\n exclude @ array_vals ( strOsay db dbExcludeN..dbExclude1 intN )\n me @ swap ++ ( strOsay db dbGreyedN..dbGreyed1' intN' )\n dup 3 + rotate ( db dbGreyedN..dbGreyed1 intN strOsay )\n notify_exclude ( )\n;\n\n: do-help pop pop .showhelp ;\n: do-ignore pop str_program cmd-ignore-add ;\n: do-unignore pop str_program cmd-ignore-del ;\n\n: do-third ( strY strZ -- )\n pop pop ( )\n me @ prop_third \"yes\" setprop\n me @ \"You will see your own says in the third person (\\\"%D says\\\").\" fmtstring .tellgood\n;\n: do-unthird ( strY strZ -- )\n pop pop ( )\n me @ prop_third remove_prop\n \"You will see your own says in the second person (\\\"You say\\\").\" .tellgood\n;\n\n: do-grey ( strY strZ -- )\n pop pop ( )\n me @ prop_color \"no\" setprop\n me @ \"You will not see color in any says. Note you will see color in your own says.\" fmtstring .tellgood\n;\n: do-ungrey ( strY strZ -- )\n pop pop ( )\n me @ prop_color remove_prop\n \"You will see color in says.\" .tellgood\n;\n\n: do-meow ( strY strZ -- )\n pop ( strY )\n dup if\n .noisy_pmatch dup ok? not if pop exit then ( db )\n me @ prop_meow 3 pick reflist_find if ( db )\n \"%D is already in your #meow list.\" fmtstring .tellbad exit ( )\n then ( db )\n me @ prop_meow 3 pick reflist_add ( db )\n \"%D added.\" fmtstring .tellgood\n else\n me @ prop_meow array_get_reflist ( arr )\n \"\" swap foreach swap pop \"%D %s\" fmtstring repeat\n \"Your meowlist: \" swap strcat .tellgood\n then\n;\n: do-unmeow ( strY strZ -- )\n pop ( strY )\n .noisy_pmatch dup ok? not if pop exit then ( db )\n me @ prop_meow 3 pick reflist_find not if ( db )\n \"%D is not in your #meow list.\" fmtstring .tellbad exit ( )\n then ( db )\n me @ prop_meow 3 pick reflist_del ( db )\n \"%D removed.\" fmtstring .tellgood\n;\n\n$define dict_commands {\n \"help\" 'do-help\n \"ignore\" 'do-ignore\n \"!ignore\" 'do-unignore\n \"meow\" 'do-meow\n \"!meow\" 'do-unmeow\n \"third\" 'do-third\n \"!third\" 'do-unthird\n \"grey\" 'do-grey\n \"gray\" 'do-grey\n \"!grey\" 'do-ungrey\n \"!gray\" 'do-ungrey\n}dict $enddef\n\n: main ( str -- )\n dup STRparse ( str strX strY strZ )\n 3 pick string? if 3 pick \"#\" stringpfx if ( str strX strY strZ )\n pop pop pop ( str )\n \"#\" split strcat ( str' )\n do-say exit ( )\n then then\n 3 pick int? if pop pop pop do-say exit then\n 4 rotate pop ( strX strY strZ )\n\n rot dict_commands over array_getitem ( strY strZ strX ? )\n dup address? if ( strY strZ strX adr )\n swap pop ( strY strZ adr )\n execute ( )\n else pop ( strY strZ strX )\n \"I don't recognize the command '#%s'. Try 'say #help' for help, or using '##' to say something starting with '#'.\" fmtstring .tellbad ( strY strZ )\n pop pop ( )\n then ( )\n;\n.\nc\nq\n\nlsedit #257=_help\n.del 1 $\nsay \n.\"\nsay #[!]ignore \nsay #[!]third\nsay #[!]grey\nsay #[!]meow \n\nSpeaks to the room. Use #ignore to not see 's says, poses, and spoofs; use #meow to see 's says with all the words replaced with \"meow.\" Use #third to see your own says in the third person (that is, \"Puck says\" instead of the normal \"You say\"). Use #grey to turn off color in others' says and poses.\n\nSay supports a \"split\" say if you put two consecutive commas in your message. For example, if CobaltBlue typed '\"Hello,,how are you?' everyone would see '\"Hello,\" says CobaltBlue, \"how are you?\"' You can also specify an \"ad-hoc\" verb by putting a message with your name or '%N' between pairs of commas: '\"Hello,,%N welcomes Weiran,,how are you?' would display '\"Hello,\" CobaltBlue welcomes Weiran, \"how are you?\"'\n.format 10=78\n.format 8=78\n.end\n" }, { "path": "src/test/resources/samples/langs/Makefile/file-icons.make", "content": "charmap := charmap.md\nfont-name := file-icons\nfont-folder := dist\nfont-config := icomoon.json\nicon-size := 34\nicon-folder := svg\nrepo-name := Alhadis/FileIcons\nsvg := $(wildcard $(icon-folder)/*.svg)\nlast-commit = $(shell git log -1 --oneline --no-abbrev | cut -d' ' -f1)\n\n\nall: unpack $(font-folder)/$(font-name).woff2 charmap\n\n\n# Aliases\nunpack: $(font-folder)/$(font-name).ttf\ncharmap: $(charmap)\n\n\n# Extract a downloaded IcoMoon folder\n$(font-folder)/%.ttf: %.zip\n\t@rm -rf $(font-folder) tmp $(font-config)\n\t@unzip -qd tmp $^\n\t@mv tmp/fonts $(font-folder)\n\t@mv tmp/selection.json $(font-config)\n\t@rm -rf tmp $^\n\t@perl -pi -e 's|^( {2})+|\"\\t\" x (length($$&)/2)|ge' $(font-config)\n\t@echo \"\" >> $(font-config) # Ensure trailing newline\n\t@echo \"Files extracted.\"\n\n\n# Generate a WOFF2 file from a TTF\n%.woff2: %.ttf\n\t@[ ! -f $@ ] && { \\\n\t\thash woff2_compress 2>/dev/null || { \\\n\t\t\techo >&2 \"WOFF2 conversion tools not found. Consult the readme file.\"; \\\n\t\t\texit 2; \\\n\t\t}; \\\n\t\twoff2_compress $^ >/dev/null; \\\n\t\techo \"WOFF2 file generated.\"; \\\n\t};\n\t\n\n\n# Clean up SVG source\nlint: $(svg)\n\t@perl -0777 -pi -e '\\\n\t\ts/\\r\\n/\\n/g; \\\n\t\ts/\\s*<\\/g>//gmi; \\\n\t\ts/\\s*<\\/g>//gmi; \\\n\t\ts/\\s+(id|viewBox|xml:space)=\"[^\"]*\"/ /gmi; \\\n\t\ts/]*>//gi; \\\n\t\ts/<\\?xml.*?\\?>//gi; \\\n\t\ts///gm; \\\n\t\ts/ style=\"enable-background:.*?;\"//gmi; \\\n\t\ts/\"\\s+>/\">/g; \\\n\t\ts/\\x20{2,}/ /g; \\\n\t\ts/[\\t\\n]+//gm;' $^\n\n\n\n# Generate/update character map\n$(charmap):\n\t@./create-map.pl -r=$(repo-name) -i=$(icon-folder) --size=$(icon-size) $(font-folder)/$(font-name).svg $@\n\n\n\n\n# POSIX systems only: reattach hard links to File-Icons package\nrelink:\n\t@$(call need-var,ATOM_FILE_ICONS,ERROR_NO_PKG)\n\t@ln -f $(font-folder)/$(font-name).woff2 $(wildcard $(ATOM_FILE_ICONS)/fonts/file-icons-*.woff2)\n\n\n\n# Force an icon's preview to be refreshed on GitHub\ncachebust:\n\t@$(call need-var,icon,ERROR_NO_ICON)\n\t@base=\"https://cdn.rawgit.com/Alhadis/FileIcons/\"; \\\n\tperl -pi -e 's{$$base\\K\\w+(?=/svg/$(icon:%.svg=%)\\.svg\")}{$(last-commit)}ig;' $(charmap)\n\n\n# Dummy task to improve feedback if `cachebust` is mistyped\nicon:\n\t$(call need-var,,ERROR_UNDEF_ICON)\n\n\n\n# Reset unstaged changes/additions in object directories\nclean:\n\t@git clean -fd $(font-folder)\n\t@git checkout -- $(font-folder) 2>/dev/null || true\n\n\n# Delete extracted and generated files\ndistclean:\n\t@rm -rf $(font-folder)\n\n\n.PHONY: clean distclean $(charmap) cachebust icon\n.ONESHELL:\n\n\n# Error message shown to users attempting to run `make relink` without a link\nERROR_NO_PKG := Environment variable ATOM_FILE_ICONS not found. \\\n\t| \\\n\t| Try this instead:\\\n\t| \\\n\t| \\\tmake relink ATOM_FILE_ICONS=/path/to/your/file-icons/installation | \n\n\n# Error message shown when running `make cachebust` without an icon\nERROR_NO_ICON := No icon specified. Task aborted.| \\\n\t| Usage: \\\n\t| \\\tmake icon=file[.svg] cachebust \\\n\t| \\\n\t| Examples: \\\n\t| \\\tmake icon=Manpage cachebust \\\n\t| \\\tmake icon=APL.svg cachebust | \n\n\n# Shown if user tries running `make icon NAME cachebust` by mistake\nERROR_UNDEF_ICON := No task named \\\"icon\\\". \\\n\t| \\\n\t| Did you mean this? \\\n\t| \\\tmake icon=NAME cachebust | \n\t\n\n\n# If the given value is empty, die with an error message\nneed = @$(if $(1),,echo $(subst | ,$$'\\n',$(2)); exit 2)\n\n# Like `need`, but uses variable names instead of string values\nneed-var = @$(call need,$($(1)),$($(2)))\n" }, { "path": "src/test/resources/samples/langs/Makefile/filenames/BSDmakefile", "content": "# pmake might add -J (private)\nFLAGS=${.MAKEFLAGS:C/\\-J ([0-9]+,?)+//W}\n\nall: .DEFAULT\n.DEFAULT:\n\t@which gmake > /dev/null 2>&1 ||\\\n\t\t(echo \"GMake is required for node.js to build.\\\n\t\t\tInstall and try again\" && exit 1)\n\t@gmake ${.FLAGS} ${.TARGETS}\n\n.PHONY: test\n" }, { "path": "src/test/resources/samples/langs/Makefile/filenames/Kbuild", "content": "# Fail on warnings - also for files referenced in subdirs\n# -Werror can be disabled for specific files using:\n# CFLAGS_ := -Wno-error\nsubdir-ccflags-y := -Werror\n\n# platform specific definitions\ninclude arch/mips/Kbuild.platforms\nobj-y := $(platform-y)\n\n# make clean traverses $(obj-) without having included .config, so\n# everything ends up here\nobj- := $(platform-)\n\n# mips object files\n# The object files are linked as core-y files would be linked\n\nobj-y += kernel/\nobj-y += mm/\nobj-y += net/\n\nifdef CONFIG_KVM\nobj-y += kvm/\nendif\n" }, { "path": "src/test/resources/samples/langs/Makefile/filenames/Makefile", "content": "all: hello\n\nhello: main.o factorial.o hello.o\n\tg++ main.o factorial.o hello.o -o hello\n\nmain.o: main.cpp\n\tg++ -c main.cpp\n\nfactorial.o: factorial.cpp\n\tg++ -c factorial.cpp\n\nhello.o: hello.cpp\n\tg++ -c hello.cpp\n\nclean:\n\trm -rf *o hello\n" }, { "path": "src/test/resources/samples/langs/Makefile/filenames/Makefile.boot", "content": "# $NetBSD$\n\nS=\t${.CURDIR}/../../../../..\n\nNOMAN=\nPROG?= boot\nNEWVERSWHAT?= \"BIOS Boot\"\nVERSIONFILE?= ${.CURDIR}/../version\n\nAFLAGS.biosboot.S= ${${ACTIVE_CC} == \"clang\":?-no-integrated-as:}\n\nSOURCES?= biosboot.S boot2.c conf.c devopen.c exec.c\nSRCS= ${SOURCES}\n.if !make(depend)\nSRCS+= vers.c\n.endif\n\nPIE_CFLAGS=\nPIE_AFLAGS=\nPIE_LDFLAGS=\n\n.include \n\nSTRIPFLAG=\t# nothing\n\nLIBCRT0=\t# nothing\nLIBCRTI=\t# nothing\nLIBCRTBEGIN=\t# nothing\nLIBCRTEND=\t# nothing\nLIBC=\t\t# nothing\n\nBINDIR=/usr/mdec\nBINMODE=444\n\n.PATH:\t${.CURDIR}/.. ${.CURDIR}/../../lib\n\nLDFLAGS+= -nostdlib -Wl,-N -Wl,-e,boot_start\nCPPFLAGS+= -I ${.CURDIR}/.. -I ${.CURDIR}/../../lib -I ${S}/lib/libsa\nCPPFLAGS+= -I ${.OBJDIR}\n# Make sure we override any optimization options specified by the user\nCOPTS= -Os\n\n.if ${MACHINE_ARCH} == \"x86_64\"\nLDFLAGS+= -Wl,-m,elf_i386\nAFLAGS+= -m32\nCPUFLAGS= -m32\nLIBKERN_ARCH=i386\nKERNMISCMAKEFLAGS=\"LIBKERN_ARCH=i386\"\n.else\nCPUFLAGS= -march=i386 -mtune=i386\n.endif\n\nCFLAGS+= -mno-sse -mno-sse2 -mno-sse3\n\nCOPTS+= -ffreestanding\nCFLAGS+= -Wall -Wmissing-prototypes -Wstrict-prototypes\nCPPFLAGS+= -nostdinc -D_STANDALONE\nCPPFLAGS+= -I$S\n\nCPPFLAGS+= -DSUPPORT_PS2\nCPPFLAGS+= -DDIRECT_SERIAL\nCPPFLAGS+= -DSUPPORT_SERIAL=boot_params.bp_consdev\n\nCPPFLAGS+= -DCONSPEED=boot_params.bp_conspeed\nCPPFLAGS+= -DCONSADDR=boot_params.bp_consaddr\nCPPFLAGS+= -DCONSOLE_KEYMAP=boot_params.bp_keymap\n\nCPPFLAGS+= -DSUPPORT_CD9660\nCPPFLAGS+= -DSUPPORT_USTARFS\nCPPFLAGS+= -DSUPPORT_DOSFS\nCPPFLAGS+= -DSUPPORT_EXT2FS\n#CPPFLAGS+= -DSUPPORT_MINIXFS3\nCPPFLAGS+= -DPASS_BIOSGEOM\nCPPFLAGS+= -DPASS_MEMMAP\n#CPPFLAGS+= -DBOOTPASSWD\nCPPFLAGS+= -DEPIA_HACK\n#CPPFLAGS+= -DDEBUG_MEMSIZE\n#CPPFLAGS+= -DBOOT_MSG_COM0\nCPPFLAGS+= -DLIBSA_ENABLE_LS_OP\n\n# The biosboot code is linked to 'virtual' address of zero and is\n# loaded at physical address 0x10000.\n# XXX The heap values should be determined from _end.\nSAMISCCPPFLAGS+= -DHEAP_START=0x40000 -DHEAP_LIMIT=0x70000\nSAMISCCPPFLAGS+= -DLIBSA_PRINTF_LONGLONG_SUPPORT\nSAMISCMAKEFLAGS+= SA_USE_CREAD=yes\t# Read compressed kernels\nSAMISCMAKEFLAGS+= SA_INCLUDE_NET=no\t# Netboot via TFTP, NFS\n\nCPPFLAGS+=\t-Wno-pointer-sign\n\n# CPPFLAGS+= -DBOOTXX_RAID1_SUPPORT\n\nI386_STAND_DIR?= $S/arch/i386/stand\n\n### find out what to use for libi386\nI386DIR= ${I386_STAND_DIR}/lib\n.include \"${I386DIR}/Makefile.inc\"\nLIBI386= ${I386LIB}\n\n### find out what to use for libsa\nSA_AS= library\nSAMISCMAKEFLAGS+=\"SA_USE_LOADFILE=yes\"\nSAMISCMAKEFLAGS+=\"SA_ENABLE_LS_OP=yes\"\n.include \"${S}/lib/libsa/Makefile.inc\"\nLIBSA= ${SALIB}\n\n### find out what to use for libkern\nKERN_AS= library\n.include \"${S}/lib/libkern/Makefile.inc\"\nLIBKERN= ${KERNLIB}\n\n### find out what to use for libz\nZ_AS= library\n.include \"${S}/lib/libz/Makefile.inc\"\nLIBZ= ${ZLIB}\n\nLDSCRIPT ?= $S/arch/i386/conf/stand.ldscript\n\ncleandir distclean: .WAIT cleanlibdir\n\ncleanlibdir:\n\t-rm -rf lib\n\nLIBLIST= ${LIBI386} ${LIBSA} ${LIBZ} ${LIBKERN} ${LIBI386} ${LIBSA}\n# LIBLIST= ${LIBSA} ${LIBKERN} ${LIBI386} ${LIBSA} ${LIBZ} ${LIBKERN}\n\nCLEANFILES+= ${PROG}.tmp ${PROG}.map ${PROG}.sym vers.c\n\nvers.c: ${VERSIONFILE} ${SOURCES} ${LIBLIST} ${.CURDIR}/../Makefile.boot\n\t${HOST_SH} ${S}/conf/newvers_stand.sh ${VERSIONFILE} x86 ${NEWVERSWHAT}\n\n# Anything that calls 'real_to_prot' must have a %pc < 0x10000.\n# We link the program, find the callers (all in libi386), then\n# explicitly pull in the required objects before any other library code.\n${PROG}: ${OBJS} ${LIBLIST} ${.CURDIR}/../Makefile.boot\n\t${_MKTARGET_LINK}\n\tbb=\"$$( ${CC} -o ${PROG}.sym ${LDFLAGS} -Wl,-Ttext,0 -Wl,-cref \\\n\t ${OBJS} ${LIBLIST} | ( \\\n\t\twhile read symbol file; do \\\n\t\t\t[ -z \"$$file\" ] && continue; \\\n\t\t\t[ \"$$symbol\" = real_to_prot ] && break; \\\n\t\tdone; \\\n\t\twhile \\\n\t\t\toifs=\"$$IFS\"; \\\n\t\t\tIFS='()'; \\\n\t\t\tset -- $$file; \\\n\t\t\tIFS=\"$$oifs\"; \\\n\t\t\t[ -n \"$$2\" ] && echo \"${I386DST}/$$2\"; \\\n\t\t\tread file rest && [ -z \"$$rest\" ]; \\\n\t\tdo :; \\\n\t\tdone; \\\n\t) )\"; \\\n\t${CC} -o ${PROG}.sym ${LDFLAGS} -Wl,-Ttext,0 -T ${LDSCRIPT} \\\n\t\t-Wl,-Map,${PROG}.map -Wl,-cref ${OBJS} $$bb ${LIBLIST}\n\t${OBJCOPY} -O binary ${PROG}.sym ${PROG}\n\n.include \nKLINK_MACHINE=\ti386\n.include \n" }, { "path": "src/test/resources/samples/langs/Makefile/filenames/Makefile.frag", "content": "all: link-php-objects index-php-objects $(all_targets)\n\t@echo\n\t@echo \"Build complete.\"\n\t@echo \"Don't forget to run 'make test'.\"\n\t@echo\n\ngenerate-php-objects:\n\t@echo \"Generating PHP objects in $(PHP_DIR)\"\n\t@for f in `ls $(PHP_DIR)/*.php`; do \\\n\t\tobjcopy --input binary --output elf64-x86-64 --binary-architecture i386 $$f $$f.o; \\\n\tdone;\n\nlink-php-objects: generate-php-objects\n\t@echo \"Linking PHP objects in $(PHP_DIR)\"\n\t@for f in `ls $(PHP_DIR)/*.php`; do \\\n\t\tar rcs $(PHP_DIR)/lib$(PHP_LIB).a $$f.o; \\\n\tdone;\n\nindex-php-objects: link-php-objects\n\t@echo \"Indexing PHP objects in $(PHP_DIR)\"\n\t@echo \"#ifndef HAVE_PHP_$(PHP_LIB)_H\" \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"#define HAVE_PHP_$(PHP_LIB)_H\" \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"/* I AM GENERATED | DO NOT EDIT | I AM GENERATED */\"\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@for f in `ls $(PHP_DIR)/*.php`; do \\\n\t\tname=`echo $$f | sed 's/[^a-z]/_/g'`; \\\n\t\techo \"extern char _binary_\"$$name\"_start;\" \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h; \\\n\t\techo \"static inline char* php_index_$(PHP_LIB)_\"$$name\"() {\" \t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h; \\\n\t\techo \"\treturn (char*) &_binary_\"$$name\"_start;\"\t\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h; \\\n\t\techo \"}\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h; \\\n\t\techo \"extern char _binary_\"$$name\"_end;\" \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h; \\\n\t\techo \"static inline char* php_index_$(PHP_LIB)_\"$$name\"_end() {\" \t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h; \\\n\t\techo \"\treturn (char*) &_binary_\"$$name\"_end;\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h; \\\n\t\techo \"}\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h; \\\n\t\techo \"static inline size_t php_index_$(PHP_LIB)_\"$$name\"_size() {\" \t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h; \\\n\t\techo \"\treturn (size_t) (php_index_$(PHP_LIB)_\"$$name\"_end() - php_index_$(PHP_LIB)_\"$$name\"());\"\t>> $(PHP_DIR)/$(PHP_LIB).h; \\\n\t\techo \"}\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h; \\\n\tdone;\n\t@echo \"static inline php_$(PHP_LIB)_init(HashTable *index, HashTable *includes) {\"\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"\tzval val;\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"\tzend_hash_init(index, 8, NULL, ZVAL_PTR_DTOR, 0);\"\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"\tzend_hash_init(includes, 8, NULL, NULL, 0);\"\t\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@for f in `ls $(PHP_DIR)/*.php`; do \\\n\t\tname=`echo $$f | sed 's/[^a-z]/_/g'`; \\\n\t\techo \"\tZVAL_NEW_STR(&val, zend_string_init(\\\n\t\t\t\t\tphp_index_$(PHP_LIB)_\"$$name\"(), \\\n\t\t\t\t\t\tphp_index_$(PHP_LIB)_\"$$name\"_size(), 0));\"\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h; \\\n\t\techo \"\tzend_hash_str_add(index, \\\"\"$$f\"\\\", sizeof(\\\"\"$$f\"\\\")-1, &val);\"\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h; \\\n\tdone;\n\t@echo \"}\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"static inline void php_$(PHP_LIB)_include(HashTable *index, HashTable *includes, \\\n\t\t\t\t\tchar *path, size_t len, zval *retval) {\"\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"\tzend_string *key = zend_string_init(path, len, 0);\"\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"\tzval *code = zend_hash_find(index, key);\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"\tif (code && !zend_hash_exists(includes, key)) {\"\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"\t\tzend_string *prepared = zend_string_alloc(Z_STRLEN_P(code) + (sizeof(\\\";\\\")-1), 0);\"\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"\t\tmemcpy(&ZSTR_VAL(prepared)[0], \\\";\\\", sizeof(\\\";\\\")-1);\"\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"\t\tif (Z_STRLEN_P(code) > (sizeof(\\\"> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"\t\t\tmemcmp(Z_STRVAL_P(code), \\\"> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"\t\t\t\tmemcpy(&ZSTR_VAL(prepared)[1], &Z_STRVAL_P(code)[5], \\\n\t\t\t\t\t\t\tZ_STRLEN_P(code) - (sizeof(\\\"> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"\t\t\t\tZSTR_LEN(prepared) -= (sizeof(\\\"> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"\t\t\t\tZSTR_VAL(prepared)[ZSTR_LEN(prepared)] = 0;\"\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"\t\t} else {\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"\t\t\tmemcpy(&ZSTR_VAL(prepared)[1], Z_STRVAL_P(code), Z_STRLEN_P(code));\"\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"\t\t}\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"\t\tzend_eval_stringl(ZSTR_VAL(prepared), ZSTR_LEN(prepared), retval, path);\"\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"\t\tzend_hash_add_empty_element(includes, key);\"\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"\t\tzend_string_release(prepared);\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"\t}\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"\tzend_string_release(key);\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"}\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"static inline void php_$(PHP_LIB)_shutdown(HashTable *index, HashTable *includes) {\"\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"\tzend_hash_destroy(index);\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"\tzend_hash_destroy(includes);\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"}\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n\t@echo \"#endif\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t>> $(PHP_DIR)/$(PHP_LIB).h\n" }, { "path": "src/test/resources/samples/langs/Makefile/filenames/Makefile.inc", "content": "#\t$OpenBSD: Makefile.inc,v 1.2 2003/11/14 20:09:20 drahn Exp $\n#\t$NetBSD: Makefile.inc,v 1.1 1996/09/30 16:34:59 ws Exp $\n\n.if !defined(__stand_makefile_inc)\n__stand_makefile_inc=1\n\nKERN_AS=\tlibrary\n\nS=$(.CURDIR)/../../../$(R)\n\n.if !make(libdep) && !make(sadep) && !make(salibdir) && !make(kernlibdir) && !make(obj) && !defined(NOMACHINE)\n.BEGIN:\n\t@([ -h machine ] || ln -s $(S)/arch/$(MACHINE)/include machine)\n.endif\n\n#\nEXTRACFLAGS=\t-msoft-float\nREAL_VIRT?=\t-v\nENTRY?=\t_start\n\nINCLUDES+=\t-I. -I$(.OBJDIR) -I$(.CURDIR)/.. -I$(S)/arch -I$(S)\nINCLUDES+=\t-I$(S)/lib/libsa\nDEFS+=\t\t-DSTANDALONE\nCFLAGS+=\t$(INCLUDES) $(DEFS) $(EXTRACFLAGS)\nCFLAGS+=\t-fno-stack-protector\nLDFLAGS?=\t-X -N -Ttext $(RELOC) -e $(ENTRY)\n\ncleandir:\n\trm -rf lib machine\n\n.endif\n" }, { "path": "src/test/resources/samples/langs/Makefile/filenames/Makefile.wat", "content": "#\n# The FreeType Project LICENSE\n# ----------------------------\n# \n# Copyright 1996-1999 by\n# David Turner, Robert Wilhelm, and Werner Lemberg\n# \n# \n# \n# Introduction\n# ============\n# \n# The FreeType Project is distributed in several archive packages;\n# some of them may contain, in addition to the FreeType font engine,\n# various tools and contributions which rely on, or relate to, the\n# FreeType Project.\n# \n# This license applies to all files found in such packages, and\n# which do not fall under their own explicit license. The license\n# affects thus the FreeType font engine, the test programs,\n# documentation and makefiles, at the very least.\n# \n# This license was inspired by the BSD, Artistic, and IJG\n# (Independent JPEG Group) licenses, which all encourage inclusion\n# and use of free software in commercial and freeware products\n# alike. As a consequence, its main points are that:\n# \n# o We don't promise that this software works. However, we are be\n# interested in any kind of bug reports. (`as is' distribution)\n# \n# o You can use this software for whatever you want, in parts or\n# full form, without having to pay us. (`royalty-free' usage)\n# \n# o You may not pretend that you wrote this software. If you use\n# it, or only parts of it, in a program, you must acknowledge\n# somewhere in your documentation that you've used the FreeType\n# code. (`credits')\n# \n# We specifically permit and encourage the inclusion of this\n# software, with or without modifications, in commercial products,\n# provided that all warranty or liability claims are assumed by the\n# product vendor.\n# \n# \n# Legal Terms\n# ===========\n# \n# 0. Definitions\n# --------------\n# \n# Throughout this license, the terms `package', `FreeType Project',\n# and `FreeType archive' refer to the set of files originally\n# distributed by the authors (David Turner, Robert Wilhelm, and\n# Werner Lemberg) as the `FreeType project', be they named as alpha,\n# beta or final release.\n# \n# `You' refers to the licensee, or person using the project, where\n# `using' is a generic term including compiling the project's source\n# code as well as linking it to form a `program' or `executable'.\n# This program is referred to as `a program using the FreeType\n# engine'.\n# \n# This license applies to all files distributed in the original\n# FreeType archive, including all source code, binaries and\n# documentation, unless otherwise stated in the file in its\n# original, unmodified form as distributed in the original archive.\n# If you are unsure whether or not a particular file is covered by\n# this license, you must contact us to verify this.\n# \n# The FreeType project is copyright (C) 1996-1999 by David Turner,\n# Robert Wilhelm, and Werner Lemberg. All rights reserved except as\n# specified below.\n# \n# 1. No Warranty\n# --------------\n# \n# THE FREETYPE ARCHIVE IS PROVIDED `AS IS' WITHOUT WARRANTY OF ANY\n# KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,\n# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n# PURPOSE. IN NO EVENT WILL ANY OF THE AUTHORS OR COPYRIGHT HOLDERS\n# BE LIABLE FOR ANY DAMAGES CAUSED BY THE USE OR THE INABILITY TO\n# USE, OF THE FREETYPE PROJECT.\n# \n# As you have not signed this license, you are not required to\n# accept it. However, as the FreeType project is copyrighted\n# material, only this license, or another one contracted with the\n# authors, grants you the right to use, distribute, and modify it.\n# Therefore, by using, distributing, or modifying the FreeType\n# project, you indicate that you understand and accept all the terms\n# of this license.\n# \n# 2. Redistribution\n# -----------------\n# \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# \n# o Redistribution of source code must retain this license file\n# (`licence.txt') unaltered; any additions, deletions or changes\n# to the original files must be clearly indicated in\n# accompanying documentation. The copyright notices of the\n# unaltered, original files must be preserved in all copies of\n# source files.\n# \n# o Redistribution in binary form must provide a disclaimer that\n# states that the software is based in part of the work of the\n# FreeType Team, in the distribution documentation. We also\n# encourage you to put an URL to the FreeType web page in your\n# documentation, though this isn't mandatory.\n# \n# These conditions apply to any software derived from or based on\n# the FreeType code, not just the unmodified files. If you use our\n# work, you must acknowledge us. However, no fee need be paid to\n# us.\n# \n# 3. Advertising\n# --------------\n# \n# The names of FreeType's authors and contributors may not be used\n# to endorse or promote products derived from this software without\n# specific prior written permission.\n# \n# We suggest, but do not require, that you use one or more of the\n# following phrases to refer to this software in your documentation\n# or advertising materials: `FreeType Project', `FreeType Engine',\n# `FreeType library', or `FreeType Distribution'.\n# \n# 4. Contacts\n# -----------\n# \n# There are two mailing lists related to FreeType:\n# \n# o freetype@freetype.org\n# \n# Discusses general use and applications of FreeType, as well as\n# future and wanted additions to the library and distribution.\n# If you are looking for support, start in this list if you\n# haven't found anything to help you in the documentation.\n# \n# o devel@freetype.org\n# \n# Discusses bugs, as well as engine internals, design issues,\n# specific licenses, porting, etc.\n# \n# o http://www.freetype.org\n# \n# Holds the current FreeType web page, which will allow you to\n# download our latest development version and read online\n# documentation.\n# \n# You can also contact us individually at:\n# \n# David Turner \n# Robert Wilhelm \n# Werner Lemberg \n# \n# \n# --- end of license ---\n#\n# This file is part of the FreeType project.\n#\n# This builds the Watcom library with Watcom's wcc386 under OS/2.\n#\n# You'll need Watcom's wmake.\n#\n#\n# Invoke by \"wmake -f arch\\os2\\Makefile.wat\" when in the \"lib\" directory\n#\n# This will build \"freetype\\lib\\libttf.lib\"\n\nARCH = arch\\os2\nFT_MAKEFILE = $(ARCH)\\Makefile.wat\nFT_MAKE = wmake -h\n\n\n.EXTENSIONS:\n.EXTENSIONS: .lib .obj .c .h\n.obj:.;.\\extend;.\\$(ARCH)\n.c:.;.\\extend;.\\$(ARCH)\n.h:.;.\\extend;.\\$(ARCH)\n\nCC = wcc386\n\nCCFLAGS = /otexanl+ /s /w5 /zq -Iarch\\os2 -I. -Iextend\n\nTTFILE = .\\ttfile.c\nTTMEMORY = .\\ttmemory.c\nTTMUTEX = .\\ttmutex.c\n\nTTFILE_OBJ = ttfile.obj\nTTMEMORY_OBJ = ttmemory.obj\nTTMUTEX_OBJ = ttmutex.obj\n\nPORT = $(TTFILE) $(TTMEMORY) $(TTMUTEX)\nPORT_OBJS = $(TTFILE_OBJ) $(TTMEMORY_OBJ) $(TTMUTEX_OBJ)\n\nSRC_X = extend\\ftxgasp.c extend\\ftxkern.c extend\\ftxpost.c &\n extend\\ftxcmap.c extend\\ftxwidth.c extend\\ftxsbit.c &\n extend\\ftxgsub.c extend\\ftxgpos.c extend\\ftxopen.c &\n extend\\ftxgdef.c\n\nOBJS_X = extend\\ftxgasp.obj extend\\ftxkern.obj extend\\ftxpost.obj &\n extend\\ftxcmap.obj extend\\ftxwidth.obj extend\\ftxsbit.obj &\n extend\\ftxgsub.obj extend\\ftxgpos.obj extend\\ftxopen.obj &\n extend\\ftxgdef.obj\n\nSRC_M = ttapi.c ttcache.c ttcalc.c ttcmap.c &\n ttgload.c ttinterp.c ttload.c ttobjs.c &\n ttraster.c ttextend.c $(PORT)\n\nOBJS_M = ttapi.obj ttcache.obj ttcalc.obj ttcmap.obj &\n ttgload.obj ttinterp.obj ttload.obj ttobjs.obj &\n ttraster.obj ttextend.obj $(PORT_OBJS) $(OBJS_X)\n\nSRC_S = freetype.c\nOBJ_S = freetype.obj\nOBJS_S = $(OBJ_S) $(OBJS_X)\n\n\n.c.obj:\n $(CC) $(CCFLAGS) $[* /fo=$[*.obj\n\nall: .symbolic\n $(FT_MAKE) -f $(FT_MAKEFILE) libttf.lib\n\ndebug: .symbolic\n $(FT_MAKE) -f $(FT_MAKEFILE) LIB_FILES=\"$(OBJS_M)\" libttf.lib\n\n\nlibttf.lib: $(OBJS_M)\n wlib -q -n libttf.lib $(OBJS_M)\n\n# is this correct? Know nothing about wmake and the Watcom compiler...\n$(OBJ_S): $(SRC_S) $(SRC_M)\n $(CC) $(CCFLAGS) $(SRC_S) /fo=$(OBJ_S)\n\nclean: .symbolic\n @-erase $(OBJS_M)\n @-erase *.err\n\ndistclean: .symbolic clean\n @-erase libttf.lib\n\nnew: .symbolic\n @-wtouch *.c\n\n# end of Makefile.wat\n" }, { "path": "src/test/resources/samples/langs/Makefile/filenames/makefile.sco", "content": "# makefile for SCO OSr5 ELF and Unixware 7 with Native cc\n# Contributed by Mike Hopkirk (hops@sco.com) modified from Makefile.lnx\n# force ELF build dynamic linking, SONAME setting in lib and RPATH in app\n# Copyright (C) 2002, 2006, 2010-2014 Glenn Randers-Pehrson\n# Copyright (C) 1998 Greg Roelofs\n# Copyright (C) 1996, 1997 Andreas Dilger\n#\n# This code is released under the libpng license.\n# For conditions of distribution and use, see the disclaimer\n# and license in png.h\n\n# Library name:\nLIBNAME = libpng16\nPNGMAJ = 16\n\n# Shared library names:\nLIBSO=$(LIBNAME).so\nLIBSOMAJ=$(LIBNAME).so.$(PNGMAJ)\nLIBSOREL=$(LIBSOMAJ).$(RELEASE)\nOLDSO=libpng.so\n\n# Utilities:\nCC=cc\nAR_RC=ar rc\nMKDIR_P=mkdir\nLN_SF=ln -f -s\nRANLIB=echo\nCP=cp\nRM_F=/bin/rm -f\n\n# where make install puts libpng.a, $(OLDSO)*, and png.h\nprefix=/usr/local\nexec_prefix=$(prefix)\n\n# Where the zlib library and include files are located\n#ZLIBLIB=/usr/local/lib\n#ZLIBINC=/usr/local/include\nZLIBLIB=../zlib\nZLIBINC=../zlib\n\nCPPFLAGS=-I$(ZLIBINC)\nCFLAGS= -dy -belf -O3\nLDFLAGS=-L. -L$(ZLIBLIB) -lpng16 -lz -lm\n\nINCPATH=$(prefix)/include\nLIBPATH=$(exec_prefix)/lib\nMANPATH=$(prefix)/man\nBINPATH=$(exec_prefix)/bin\n\n# override DESTDIR= on the make install command line to easily support\n# installing into a temporary location. Example:\n#\n# make install DESTDIR=/tmp/build/libpng\n#\n# If you're going to install into a temporary location\n# via DESTDIR, $(DESTDIR)$(prefix) must already exist before\n# you execute make install.\nDESTDIR=\n\nDB=$(DESTDIR)$(BINPATH)\nDI=$(DESTDIR)$(INCPATH)\nDL=$(DESTDIR)$(LIBPATH)\nDM=$(DESTDIR)$(MANPATH)\n\n# Pre-built configuration\n# See scripts/pnglibconf.mak for more options\nPNGLIBCONF_H_PREBUILT = scripts/pnglibconf.h.prebuilt\n\nOBJS = png.o pngset.o pngget.o pngrutil.o pngtrans.o pngwutil.o \\\n\tpngread.o pngrio.o pngwio.o pngwrite.o pngrtran.o \\\n\tpngwtran.o pngmem.o pngerror.o pngpread.o\n\nOBJSDLL = $(OBJS:.o=.pic.o)\n\n.SUFFIXES: .c .o .pic.o\n\n.c.o:\n\t$(CC) -c $(CPPFLAGS) $(CFLAGS) -o $@ $<\n\n.c.pic.o:\n\t$(CC) -c $(CPPFLAGS) $(CFLAGS) -KPIC -o $@ $*.c\n\nall: libpng.a $(LIBSO) pngtest libpng.pc libpng-config\n\npnglibconf.h: $(PNGLIBCONF_H_PREBUILT)\n\t$(CP) $(PNGLIBCONF_H_PREBUILT) $@\n\nlibpng.a: $(OBJS)\n\t$(AR_RC) $@ $(OBJS)\n\t$(RANLIB) $@\n\nlibpng.pc:\n\tcat scripts/libpng.pc.in | sed -e s!@prefix@!$(prefix)! \\\n\t-e s!@exec_prefix@!$(exec_prefix)! \\\n\t-e s!@libdir@!$(LIBPATH)! \\\n\t-e s!@includedir@!$(INCPATH)! \\\n\t-e s!-lpng16!-lpng16\\ -lz\\ -lm! > libpng.pc\n\nlibpng-config:\n\t( cat scripts/libpng-config-head.in; \\\n\techo prefix=\\\"$(prefix)\\\"; \\\n\techo I_opts=\\\"-I$(INCPATH)/$(LIBNAME)\\\"; \\\n\techo ccopts=\\\"-belf\\\"; \\\n\techo L_opts=\\\"-L$(LIBPATH)\\\"; \\\n\techo libs=\\\"-lpng16 -lz -lm\\\"; \\\n\tcat scripts/libpng-config-body.in ) > libpng-config\n\tchmod +x libpng-config\n\n$(LIBSO): $(LIBSOMAJ)\n\t$(LN_SF) $(LIBSOMAJ) $(LIBSO)\n\n$(LIBSOMAJ): $(OBJSDLL)\n\t$(CC) -G -Wl,-h,$(LIBSOMAJ) -o $(LIBSOMAJ) \\\n\t $(OBJSDLL)\n\npngtest: pngtest.o $(LIBSO)\n\tLD_RUN_PATH=.:$(ZLIBLIB) $(CC) -o pngtest $(CFLAGS) pngtest.o $(LDFLAGS)\n\ntest: pngtest\n\t./pngtest\n\ninstall-headers: png.h pngconf.h pnglibconf.h\n\t-@if [ ! -d $(DI) ]; then $(MKDIR_P) $(DI); fi\n\t-@if [ ! -d $(DI)/$(LIBNAME) ]; then $(MKDIR_P) $(DI)/$(LIBNAME); fi\n\t-@$(RM_F) $(DI)/png.h\n\t-@$(RM_F) $(DI)/pngconf.h\n\t-@$(RM_F) $(DI)/pnglibconf.h\n\tcp png.h pngconf.h pnglibconf.h $(DI)/$(LIBNAME)\n\tchmod 644 $(DI)/$(LIBNAME)/png.h $(DI)/$(LIBNAME)/pngconf.h $(DI)/$(LIBNAME)/pnglibconf.h\n\t-@$(RM_F) $(DI)/png.h $(DI)/pngconf.h $(DI)/pnglibconf.h\n\t-@$(RM_F) $(DI)/libpng\n\t(cd $(DI); $(LN_SF) $(LIBNAME) libpng; $(LN_SF) $(LIBNAME)/* .)\n\ninstall-static: install-headers libpng.a\n\t-@if [ ! -d $(DL) ]; then $(MKDIR_P) $(DL); fi\n\tcp libpng.a $(DL)/$(LIBNAME).a\n\tchmod 644 $(DL)/$(LIBNAME).a\n\t-@$(RM_F) $(DL)/libpng.a\n\t(cd $(DL); $(LN_SF) $(LIBNAME).a libpng.a)\n\ninstall-shared: install-headers $(LIBSOMAJ) libpng.pc\n\t-@if [ ! -d $(DL) ]; then $(MKDIR_P) $(DL); fi\n\t-@$(RM_F) $(DL)/$(LIBSO)\n\t-@$(RM_F) $(DL)/$(LIBSOREL)\n\t-@$(RM_F) $(DL)/$(OLDSO)\n\tcp $(LIBSOMAJ) $(DL)/$(LIBSOREL)\n\tchmod 755 $(DL)/$(LIBSOREL)\n\t(cd $(DL); \\\n\t$(LN_SF) $(LIBSOREL) $(LIBSO); \\\n\t$(LN_SF) $(LIBSO) $(OLDSO))\n\t-@if [ ! -d $(DL)/pkgconfig ]; then $(MKDIR_P) $(DL)/pkgconfig; fi\n\t-@$(RM_F) $(DL)/pkgconfig/$(LIBNAME).pc\n\t-@$(RM_F) $(DL)/pkgconfig/libpng.pc\n\tcp libpng.pc $(DL)/pkgconfig/$(LIBNAME).pc\n\tchmod 644 $(DL)/pkgconfig/$(LIBNAME).pc\n\t(cd $(DL)/pkgconfig; $(LN_SF) $(LIBNAME).pc libpng.pc)\n\ninstall-man: libpng.3 libpngpf.3 png.5\n\t-@if [ ! -d $(DM) ]; then $(MKDIR_P) $(DM); fi\n\t-@if [ ! -d $(DM)/man3 ]; then $(MKDIR_P) $(DM)/man3; fi\n\t-@$(RM_F) $(DM)/man3/libpng.3\n\t-@$(RM_F) $(DM)/man3/libpngpf.3\n\tcp libpng.3 $(DM)/man3\n\tcp libpngpf.3 $(DM)/man3\n\t-@if [ ! -d $(DM)/man5 ]; then $(MKDIR_P) $(DM)/man5; fi\n\t-@$(RM_F) $(DM)/man5/png.5\n\tcp png.5 $(DM)/man5\n\ninstall-config: libpng-config\n\t-@if [ ! -d $(DB) ]; then $(MKDIR_P) $(DB); fi\n\t-@$(RM_F) $(DB)/libpng-config\n\t-@$(RM_F) $(DB)/$(LIBNAME)-config\n\tcp libpng-config $(DB)/$(LIBNAME)-config\n\tchmod 755 $(DB)/$(LIBNAME)-config\n\t(cd $(DB); $(LN_SF) $(LIBNAME)-config libpng-config)\n\ninstall: install-static install-shared install-man install-config\n\n# If you installed in $(DESTDIR), test-installed won't work until you\n# move the library to its final location. Use test-dd to test it\n# before then.\n\ntest-dd:\n\techo\n\techo Testing installed dynamic shared library in $(DL).\n\t$(CC) -I$(DI) $(CPPFLAGS) \\\n\t `$(BINPATH)/$(LIBNAME)-config --cflags` pngtest.c \\\n\t -L$(DL) -L$(ZLIBLIB) \\\n\t -o pngtestd `$(BINPATH)/$(LIBNAME)-config --ldflags`\n\t./pngtestd pngtest.png\n\ntest-installed:\n\t$(CC) $(CPPFLAGS) $(CFLAGS) \\\n\t `$(BINPATH)/$(LIBNAME)-config --cflags` pngtest.c \\\n\t -L$(ZLIBLIB) \\\n\t -o pngtesti `$(BINPATH)/$(LIBNAME)-config --ldflags`\n\t./pngtesti pngtest.png\n\nclean:\n\t$(RM_F) *.o libpng.a pngtest pngout.png libpng-config \\\n\t$(LIBSO) $(LIBSOMAJ)* pngtest-static pngtesti \\\n\tpnglibconf.h libpng.pc\n\nDOCS = ANNOUNCE CHANGES INSTALL KNOWNBUG LICENSE README TODO Y2KINFO\nwritelock:\n\tchmod a-w *.[ch35] $(DOCS) scripts/*\n\n# DO NOT DELETE THIS LINE -- make depend depends on it.\n\npng.o png.pic.o: png.h pngconf.h pnglibconf.h pngpriv.h pngstruct.h pnginfo.h pngdebug.h\npngerror.o pngerror.pic.o: png.h pngconf.h pnglibconf.h pngpriv.h pngstruct.h pnginfo.h pngdebug.h\npngrio.o pngrio.pic.o: png.h pngconf.h pnglibconf.h pngpriv.h pngstruct.h pnginfo.h pngdebug.h\npngwio.o pngwio.pic.o: png.h pngconf.h pnglibconf.h pngpriv.h pngstruct.h pnginfo.h pngdebug.h\npngmem.o pngmem.pic.o: png.h pngconf.h pnglibconf.h pngpriv.h pngstruct.h pnginfo.h pngdebug.h\npngset.o pngset.pic.o: png.h pngconf.h pnglibconf.h pngpriv.h pngstruct.h pnginfo.h pngdebug.h\npngget.o pngget.pic.o: png.h pngconf.h pnglibconf.h pngpriv.h pngstruct.h pnginfo.h pngdebug.h\npngread.o pngread.pic.o: png.h pngconf.h pnglibconf.h pngpriv.h pngstruct.h pnginfo.h pngdebug.h\npngrtran.o pngrtran.pic.o: png.h pngconf.h pnglibconf.h pngpriv.h pngstruct.h pnginfo.h pngdebug.h\npngrutil.o pngrutil.pic.o: png.h pngconf.h pnglibconf.h pngpriv.h pngstruct.h pnginfo.h pngdebug.h\npngtrans.o pngtrans.pic.o: png.h pngconf.h pnglibconf.h pngpriv.h pngstruct.h pnginfo.h pngdebug.h\npngwrite.o pngwrite.pic.o: png.h pngconf.h pnglibconf.h pngpriv.h pngstruct.h pnginfo.h pngdebug.h\npngwtran.o pngwtran.pic.o: png.h pngconf.h pnglibconf.h pngpriv.h pngstruct.h pnginfo.h pngdebug.h\npngwutil.o pngwutil.pic.o: png.h pngconf.h pnglibconf.h pngpriv.h pngstruct.h pnginfo.h pngdebug.h\npngpread.o pngpread.pic.o: png.h pngconf.h pnglibconf.h pngpriv.h pngstruct.h pnginfo.h pngdebug.h\n\npngtest.o: png.h pngconf.h pnglibconf.h\n" }, { "path": "src/test/resources/samples/langs/Makefile/filenames/mkfile", "content": "GREETINGS=hello gday bonjour hola ola kaixo tag hoi konnichiwa nihao dobredan namaste salaam\n\nall:V:\n\tmk greet.^($GREETINGS)\n\tfor(i in $GREETINGS)\n\t\tmk $i\n\ngreet.%: text-folder\n\t/n/$printer $stem >[2=1]\n" }, { "path": "src/test/resources/samples/langs/Makefile/foo.o.d", "content": "bar/foo.o: \\\n bar/foo.c \\\n bar/baz.h\n\nbar/baz.h:\n" }, { "path": "src/test/resources/samples/langs/Makefile/makefile", "content": "#!/usr/bin/make -f\n%:\n\tls -l\n" }, { "path": "src/test/resources/samples/langs/Markdown/README.mdown", "content": "# Installation\n\nYou can install this bundle in TextMate by opening the preferences and going to the bundles tab. After installation it will be automatically updated for you.\n\n# General\n\n* [Bundle Styleguide](http://kb.textmate.org/bundle_styleguide) — _before you make changes_\n* [Commit Styleguide](http://kb.textmate.org/commit_styleguide) — _before you send a pull request_\n* [Writing Bug Reports](http://kb.textmate.org/writing_bug_reports) — _before you report an issue_\n\n# License\n\nIf not otherwise specified (see below), files in this repository fall under the following license:\n\n\tPermission to copy, use, modify, sell and distribute this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”." }, { "path": "src/test/resources/samples/langs/Markdown/csharp6.workbook", "content": "---\nuti: com.xamarin.workbook\nplatforms:\n- Console\n---\n\n# Using C# 6\n\nSome examples from Xamarin's [intro to C# 6](https://developer.xamarin.com/guides/cross-platform/advanced/csharp_six/).\n\n* Null-conditional operator\n\n* String Interpolation\n\n* Expression-bodied Function Members\n\n* Auto-property Initialization\n\n* Index Initializers\n\n* using static\n\n## Null-conditional operator\n\nThe `?.` operator automatically does a null-check before referencing the\nspecified member. The example string array below has a `null` entry:\n\n```csharp\nvar names = new string[] { \"Foo\", null };\n```\n\nIn C# 5, a null-check is required before accessing the `.Length` property:\n\n```csharp\n// C# 5\nint secondLength = 0;\nif (names[1] != null)\n secondLength = names[1].Length;\n```\n\nC# 6 allows the length to be queried in a single line; the entire\nstatement returns `null` if any object is null.\n\n```csharp\nvar length0 = names[0]?.Length; // 3\nvar length1 = names[1]?.Length; // null\n```\n\nThis can be used in conjunction with the `??` null coalescing operator\nto set a default value (such as `0`) in the example below:\n\n```csharp\nvar lengths = names.Select (names => names?.Length ?? 0); //[3, 0]\n```\n\n## String Interpolation\n\nPreviously strings were built in a number of different ways:\n\n```csharp\nvar animal = \"Monkeys\";\nvar food = \"bananas\";\n\nvar out1 = String.Format (\"{0} love to eat {1}\", animal, food);\nvar out2 = animal + \" love to eat \" + food;\n// or even StringBuilder\n```\n\nC# 6 provides a simple syntax where the fieldname can be\nembedded directly in the string:\n\n```csharp\n$\"{animal} love to eat {food}\"\n```\n\nString-formatting can also be done with this syntax:\n\n```csharp\nvar values = new int[] { 1, 2, 3, 4, 12, 123456 };\nforeach (var s in values.Select (i => $\"The value is {i,10:N2}.\")) {\n Console.WriteLine (s);\n}\n```\n\n## Expression-bodied Function Members\n\nThe `ToString` override in the following class is an expression-bodied\nfunction - a more succinct declaration syntax.\n\n```csharp\nclass Person\n{\n public string FirstName { get; }\n public string LastName { get; }\n public Person (string firstname, string lastname)\n {\n FirstName = firstname;\n LastName = lastname;\n }\n // note there is no explicit `return` keyword\n public override string ToString () => $\"{LastName}, {FirstName} {LastName}\";\n}\n```\n\n`void` expression bodied functions are also allowed so long as\nthe expression is a statement:\n\n```csharp\npublic void Log(string message) => System.Console.WriteLine($\"{DateTime.Now.ToString (\"s\", System.Globalization.CultureInfo.InvariantCulture )}: {message}\");\n```\n\nThis simple example calls these two methods:\n\n```csharp\nLog(new Person(\"James\", \"Bond\").ToString())\n```\n\n## Auto-property Initialization\n\nProperties (ie. specified with `{get;set;}`) can be initialized inline\nwith C# 6:\n\n```csharp\nclass Todo\n{\n public bool Done { get; set; } = false;\n public DateTime Created { get; } = DateTime.Now;\n public string Description { get; }\n\n public Todo (string description)\n {\n this.Description = description; // can assign (only in constructor!)\n }\n public override string ToString () => $\"'{Description}' was created on {Created}\";\n}\n```\n\n```csharp\nnew Todo(\"buy apples\")\n```\n\n## Index Initializers\n\nDictionary-style data structures let you specify key/value\ntypes with a simple object-initializer-like syntax:\n\n```csharp\nvar userInfo = new Dictionary {\n [\"Created\"] = DateTime.Now,\n [\"Due\"] = DateTime.Now.AddSeconds(60 * 60 * 24),\n [\"Task\"] = \"buy lettuce\"\n};\n```\n\n## using static\n\nEnumerations, and certain classes such as System.Math, are primarily\nholders of static values and functions. In C# 6, you can import all\nstatic members of a type with a single using static statement:\n\n```csharp\nusing static System.Math;\n```\n\nC# 6 code can then reference the static members directly, avoiding\nrepetition of the class name (eg. `Math.PI` becomes `PI`):\n\n```csharp\npublic class Location \n{\n public Location (double lat, double @long) {Latitude = lat; Longitude = @long;} \n public double Latitude = 0; public double Longitude = 0; \n}\nstatic public double MilesBetween(Location loc1, Location loc2)\n{\n double rlat1 = PI * loc1.Latitude / 180;\n double rlat2 = PI * loc2.Latitude / 180;\n double theta = loc1.Longitude - loc2.Longitude;\n double rtheta = PI * theta / 180;\n double dist =\n Sin(rlat1) * Sin(rlat2) + Cos(rlat1) *\n Cos(rlat2) * Cos(rtheta);\n dist = Acos(dist);\n dist = dist*180/PI;\n dist = dist*60*1.1515;\n return dist; //miles\n}\n```\n\n```csharp\nMilesBetween (new Location(-12,22), new Location(-13,33))\n```" }, { "path": "src/test/resources/samples/langs/Markdown/minimal.md", "content": "_This_ is a **Markdown** readme." }, { "path": "src/test/resources/samples/langs/Markdown/symlink.md", "content": "# Installation\n\nYou can install this bundle in TextMate by opening the preferences and going to the bundles tab. After installation it will be automatically updated for you.\n\n# General\n\n* [Bundle Styleguide](http://kb.textmate.org/bundle_styleguide) — _before you make changes_\n* [Commit Styleguide](http://kb.textmate.org/commit_styleguide) — _before you send a pull request_\n* [Writing Bug Reports](http://kb.textmate.org/writing_bug_reports) — _before you report an issue_\n\n# License\n\nIf not otherwise specified (see below), files in this repository fall under the following license:\n\n\tPermission to copy, use, modify, sell and distribute this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”." }, { "path": "src/test/resources/samples/langs/Markdown/tender.md", "content": "Tender\n======\n" }, { "path": "src/test/resources/samples/langs/Marko/counter.marko", "content": "class {\n constructor() {\n this.state = { count:0 };\n }\n increment() {\n this.state.count++;\n }\n}\n\nstyle {\n .count {\n color:#09c;\n font-size:3em;\n }\n .example-button {\n font-size:1em;\n padding:0.5em;\n }\n}\n\n\n ${state.count}\n
\n\n Click me!\n" }, { "path": "src/test/resources/samples/langs/Marko/hello.marko", "content": "$ var name = 'Frank';\n$ var colors = ['red', 'green', 'blue'];\n\n

\n Hello ${name}!\n

\n\n
    \n
  • \n ${color}\n
    • \n
\n
\n No colors!\n
\n" }, { "path": "src/test/resources/samples/langs/Marko/rgb-sliders.marko", "content": "static const colors = ['red', 'green', 'blue'];\nstatic const defaultColor = [255, 0, 0];\n\nclass {\n\tonInput(input) {\n\t\tthis.state = { color: input.color || defaultColor };\n\t}\n\n\tupdateColor() {\n \tthis.state.color = colors.map((color) => {\n \treturn parseInt(this.getEl(color + 'Input').value, 10);\n });\n }\n\n getStyleColor() {\n \treturn 'rgb(' + this.state.color.join(',') + ')';\n }\n}\n\n\n \n \t\n \t
\n \n \n
\n \n
\n \n
\n
\n" }, { "path": "src/test/resources/samples/langs/Mask/view.mask", "content": "\n// HTML Elements\nheader {\n \n img .logo src='/images/~[currentLogo].png' alt=logo;\n \n h4 > 'Bar View'\n \n if (currentUser) {\n \n .account >\n a href='/acount' >\n 'Hello, ~[currentUser.username]'\n }\n}\n\n.view {\n ul {\n \n // Iteration\n for ((user, index) of users) {\n \n li.user data-id='~[user.id]' {\n \n // interpolation\n .name > '~[ user.username ]'\n \n // expression\n .count > '~[: user.level.toFixed(2) ]'\n \n // util\n /* Localization sample\n * lastActivity: \"Am {0:dd. MM} war der letzte Eintrag\"\n */\n .date > '~[ L: \"lastActivity\", user.date]'\n }\n }\n }\n \n // Component\n :countdownComponent {\n input type = text >\n :dualbind value='number';\n \n button x-signal='click: countdownStart' > 'Start';\n \n h5 {\n '~[bind: number]'\n \n :animation x-slot='countdownStart' {\n @model > 'transition | scale(0) > scale(1) | 500ms'\n @next > 'background-color | red > blue | 2s linear'\n }\n }\n }\n}\n\nfooter > :bazCompo {\n \n 'Component generated at ~[: $u.format($c.date, \"HH-mm\") ]'\n}" }, { "path": "src/test/resources/samples/langs/Mathematica/HeyexImport.m", "content": "(* Mathematica Package *)\n(* Created with IntelliJ IDEA and the Mathematica Language plugin *)\n\n(* :Title: Importer for the RAW data-format of the Heidelberg Eye Explorer (known as HEYEX) *)\n\n(* :Context: HeyexImport` *)\n\n(* :Author: Patrick Scheibe pscheibe@trm.uni-leipzig.de *)\n\n(* :Package Version: 1.0 *)\n\n(* :Mathematica Version: 8.0 *)\n\n(* :Copyright: Patrick Scheibe, 2013-2015 *)\n\n(* :Discussion: This package registers a new importer which can load the RAW data-format exported by a\n Heidelberg Spectralis OCT. The import-functionality can access different information contained\n in a file:\n 1. The file header which contains meta data like when the patient was scanned etc\n 2. The scanned volume data\n 3. Images which represent slices of the scanned volume\n 4. The Scanning laser ophthalmoscopy (SLO) image which is taken with every scanned patient\n 5. The segmentation data for different retina layers provided by the software\n\n*)\n\n(* :Keywords: Import, Heyex, OCT, Spectralis, Heidelberg Engineering *)\n\nBeginPackage[ \"HeyexImport`\" ]\n\nHeyexEyePosition::usage = \"HeyexEyePosition[file] tries to extract which eye was scanned, left or right.\";\n\nHeyexImport::wrongHdr = \"Error importing OCT data. Broken/Wrong file?\";\n\n\nBegin[ \"`Private`\" ];\n\n(*\n Registration of all import possibilities for the Heidelberg OCT.\n*)\n\nImportExport`RegisterImport[\n \"Heyex\" ,\n {\n \"FileHeader\" :> importHeader,\n { \"Data\" , n_Integer} :> (importData[n][##]&),\n \"Data\" :> importData,\n { \"Images\" , n_Integer} :> (importImages[n][##]&),\n \"Images\" :> importImages,\n \"SLOImage\" :> importSLOImage,\n \"SegmentationData\" :> importSegmentation,\n { \"SegmentationData\" , n_Integer} :> (importSegmentation[n][##]&),\n \"DataSize\" :> importDataSize,\n importData\n },\n\n {\n \"Image3D\" :> (Image3D[\"Data\" /. #1]&)\n },\n\n \"AvailableElements\" -> {\"FileHeader\", \"Data\", \"DataSize\", \"Images\", \"SLOImage\", \"SegmentationData\", \"Image3D\"}\n];\n\n\nIf[Quiet[Check[TrueQ[Compile[{}, 0, CompilationTarget -> \"C\"][] == 0], False]],\n $compileTarget = CompilationTarget -> \"C\",\n $compileTarget = CompilationTarget -> \"MVM\"\n];\n\n\n(*\n Helper function which reads data from a stream. This is\n only a unification so I can map the read function over a\n list.\n*)\nread[{id_String, type_String}, str_] :=\nid -> BinaryRead[str, type];\nread[{type_String, n_Integer}, str_] := BinaryReadList[str, type, n];\nread[{id_String, {type_String, n_Integer}}, str_] := id -> BinaryReadList[str, type, n];\n(*\n Note that when reading bytes explicitly I convert them to\n a string and remove any zeroes at the end.\n*)\nread[{id_String, { \"Byte\" , n_Integer}}, str_] :=\nid -> StringJoin[\n FromCharacterCode /@ (Rest[\n NestList[BinaryRead[str, \"Byte\" ] &, Null,\n n]] /. {chars___Integer, Longest[0 ...]} :> {chars})];\n\n(*\n The layout of a file exported with \"Raw Export\"\n\n *****************\n * File Header *\n *****************\n * SLO Image *\n *****************\n * B-Scan #0 *\n *****************\n * ..... *\n *****************\n * B-Scan #n-1 *\n *****************\n*)\n\nWith[{i = \"Integer32\", f = \"Real32\", d = \"Real64\", b = \"Byte\"},\n\n $fileHeaderInfo = Transpose[{\n {\n \"Version\" , \"SizeX\" , \"NumBScans\" , \"SizeZ\" , \"ScaleX\" , \"Distance\" ,\n \"ScaleZ\" , \"SizeXSlo\" , \"SizeYSlo\" , \"ScaleXSlo\" , \"ScaleYSlo\" ,\n \"FieldSizeSlo\" , \"ScanFocus\" , \"ScanPosition\" , \"ExamTime\" ,\n \"ScanPattern\" , \"BScanHdrSize\" , \"ID\" , \"ReferenceID\" , \"PID\" ,\n \"PatientID\" , \"Padding\" , \"DOB\" , \"VID\" , \"VisitID\" , \"VisitDate\" ,\n \"Spare\"\n },\n {\n {b, 12}, i, i, i, d, d, d, i, i, d, d, i, d, {b, 4}, {i, 2}, i, i,\n {b, 16}, {b, 16}, i, {b, 21}, {b, 3}, d, i, {b, 24}, d, {b, 1840}\n }\n }];\n\n $bScanHeaderInfo = Transpose[{\n {\n \"Version\" , \"BScanHdrSize\" , \"StartX\" , \"StartY\" , \"EndX\" , \"EndY\" ,\n \"NumSeg\" , \"OffSeg\" , \"Quality\" , \"Spare\"\n },\n {{b, 12}, i, d, d, d, d, i, i, f, {b, 196}}\n }];\n];\n\n\nisHeyexRawFormat[{\"Version\" -> version_String, \"SizeX\" -> _Integer, \"NumBScans\" -> _Integer, _Rule..}] /; StringMatchQ[version, \"HSF-OCT\" ~~__] := True ;\nisHeyexRawFormat[___] := False;\n\nreadFileHeader[str_InputStream] := With[{hdr = Quiet[read[#, str]] & /@ $fileHeaderInfo},\n hdr /; TrueQ[isHeyexRawFormat[hdr]]\n];\nreadFileHeader[___] := (Message[HeyexImport::wrongHdr]; Throw[$Failed]);\n\n\n(* Reads the camera image of the retina. Note that you must have the\n information from the fileheader and you must be at the right position\n of the file stream for this.*)\nreadSLOImage[str_InputStream, fileHdr : {(_String -> _) ..}] :=\n Image[Partition[\n BinaryReadList[str, \"Byte\" , \"SizeXSlo\" * \"SizeYSlo\" /. fileHdr],\n \"SizeXSlo\" /. fileHdr], \"Byte\" ];\n\nskipSLOImage[str_InputStream, fileHdr : {(_String -> _) ..}] :=\n Skip[str, \"Byte\" , \"SizeXSlo\" * \"SizeYSlo\" /. fileHdr];\n\n\n(* One single BScan consists itself again of a header and a data part *)\nreadBScanHeader[str_InputStream, fileHdr : {(_String -> _) ..}] :=\n Module[{i = \"Integer32\", f = \"Real32\", d = \"Real64\", b = \"Byte\",\n bScanHdr},\n bScanHdr = read[#, str] & /@ Transpose[{\n { \"Version\" , \"BScanHdrSize\" , \"StartX\" , \"StartY\" , \"EndX\" , \"EndY\" ,\n \"NumSeg\" , \"OffSeg\" , \"Quality\" , \"Spare\" },\n {{b, 12}, i, d, d, d, d, i, i, f, {b, 196}}}\n ];\n AppendTo[bScanHdr,\n read[{ \"SegArray\" , { \"Real32\" ,\n \"NumSeg\" * \"SizeX\" /. bScanHdr /. fileHdr}}, str]\n ];\n (*\n This is horrible slow, therefore I just skip the fillbytes\n \n AppendTo[bScanHdr,\n read[{\"Fillbytes\", {\"Byte\",\n \"BScanHdrSize\" - 256 - \"NumSeg\"*\"SizeX\"*4 /. bScanHdr /.\n fileHdr}}, str]\n ]\n *)\n Skip[str, \"Byte\" , \"BScanHdrSize\" - 256 - \"NumSeg\" * \"SizeX\" * 4 /. bScanHdr /. fileHdr];\n AppendTo[bScanHdr, \"FillBytes\" -> None]\n ]\n\nskipBScanHeader[str_InputStream, fileHdr : {(_String -> _) ..}] :=\n Skip[str, \"Byte\" , \"BScanHdrSize\" /. fileHdr];\n\nreadBScanData[str_InputStream, fileHdr : {(_String -> _) ..}] :=\n Module[{},\n Developer`ToPackedArray[\n Partition[read[{ \"Real32\" , \"SizeX\" * \"SizeZ\" /. fileHdr}, str],\n \"SizeX\" /. fileHdr]]\n ];\n\nskipBScanData[str_InputStream, fileHdr : {(_String -> _) ..}] :=\n Skip[str, \"Byte\" , \"SizeX\" * \"SizeZ\" * 4 /. fileHdr];\n\nskipBScanBlocks[str_InputStream, fileHdr : {(_String -> _) ..}, n_Integer] :=\n Skip[str, \"Byte\" , n * (\"BScanHdrSize\" + \"SizeX\" * \"SizeZ\" * 4) /. fileHdr];\n\n\nimportHeader[filename_String, ___] := Module[\n {str, header},\n str = OpenRead[filename, BinaryFormat -> True];\n header = readFileHeader[str];\n Close[str];\n \"FileHeader\" -> header\n];\n\n\n(* Imports the dimension of the scanned volume. *)\nimportDataSize[filename_String, r___] := Module[{header = importHeader[filename]},\n \"DataSize\" -> ({\"NumBScans\", \"SizeZ\", \"SizeXSlo\"} /. (\"FileHeader\" /. header))\n]\n\nimportSLOImage[filename_String, ___] := Module[\n {str, header, slo},\n str = OpenRead[filename, BinaryFormat -> True];\n header = readFileHeader[str];\n slo = readSLOImage[str, header];\n Close[str];\n \"SLOImage\" -> slo\n]\n\nimportData[filename_String, ___] := Module[\n {str, header, nx, n, data},\n str = OpenRead[filename, BinaryFormat -> True];\n header = readFileHeader[str];\n {nx, n} = { \"SizeX\" , \"SizeX\" * \"SizeZ\"} /. header;\n skipSLOImage[str, header];\n data = Table[\n skipBScanHeader[str, header];\n Partition[read[{ \"Real32\" , n}, str], nx],\n {\"NumBScans\" /. header}\n ];\n Close[str];\n \"Data\" -> Developer`ToPackedArray[data]\n];\n\nimportData[num_Integer][filename_String, ___] := Module[\n {str, header, nx, n, data},\n str = OpenRead[filename, BinaryFormat -> True];\n header = readFileHeader[str];\n {nx, n} = { \"SizeX\" , \"SizeX\" * \"SizeZ\"} /. header;\n skipSLOImage[str, header];\n skipBScanBlocks[str, header, Max[Min[\"NumBScans\" /. header, num - 1], 0] ];\n skipBScanHeader[str, header];\n data = Partition[read[{ \"Real32\" , n}, str], nx];\n Close[str];\n {\"Data\" -> {num -> Developer`ToPackedArray[data]}}\n];\n\n(*\n As suggested in the Heidelberg OCT Manual the importer will adjust\n the graylevels when importing images. Since this is very time-consuming\n for the whole scanned volume, I use an optimized version of this function.\n*)\nWith[{$compileTarget = $compileTarget}, $adjustGraylevelFunc := ($adjustGraylevelFunc = Compile[{{values, _Real, 2}},\n Map[Floor[255.0 * Min[Max[0.0, #], 1.0]^(0.25) + 0.5] &, values, {2}],\n RuntimeAttributes -> {Listable},\n Parallelization -> True,\n RuntimeOptions -> \"Speed\",\n $compileTarget\n])];\n\nimportImages[filename_String, ___] := Module[\n {data},\n data = \"Data\" /. importData[filename];\n \"Images\" -> (Image[#, \"Byte\" ]& /@ $adjustGraylevelFunc[data])\n]\n\nimportImages[imageNumber_Integer][filename_String, ___] := Module[\n {data},\n data = {imageNumber /. (\"Data\" /. importData[imageNumber][filename])};\n {\"Images\" -> {imageNumber -> (Image[#, \"Byte\" ]& @@ $adjustGraylevelFunc[data])}}\n];\n\nimportSegmentation[filename_String, ___] := Module[\n {str, header, data},\n str = OpenRead[filename, BinaryFormat -> True];\n header = readFileHeader[str];\n skipSLOImage[str, header];\n data = Table[\n Module[{bScanHeader, t},\n {t, bScanHeader} = Timing@readBScanHeader[str, header];\n skipBScanData[str, header];\n bScanHeader\n ], {\"NumBScans\" /. header}\n ];\n Close[str];\n (*\n The BScanHeaderData contain the segmentation vectors as a single list\n of numbers. Before returning the result, I check how many segmentations\n there are inside the BScan an I transform the segmentation value list\n into separate vectors and call them \"ILM\", \"RPE\" and \"NFL\" like described\n in the manual\n *)\n \"SegmentationData\" -> Function[{bhdr},\n Block[{numVecs = \"NumSeg\" /. bhdr, vecNames, nx = \"SizeX\" /. header},\n If[numVecs > 0,\n vecNames = Take[{ \"ILM\" , \"RPE\" , \"NFL\" }, numVecs];\n bhdr /. (\"SegArray\" -> vec_) :> Sequence @@ (Rule @@@ Transpose[{vecNames, Partition[vec, nx]} ]),\n bhdr\n ]\n ]] /@ data\n]\n\nimportSegmentation[num_Integer][filename_String, ___] := Module[\n {str, header, bhdr},\n str = OpenRead[filename, BinaryFormat -> True];\n header = readFileHeader[str];\n skipSLOImage[str, header];\n skipBScanBlocks[str, header, Max[Min[\"NumBScans\" /. header, num - 1], 0] ];\n bhdr = readBScanHeader[str, header];\n Close[str];\n (* See doc above *)\n {\"SegmentationData\" -> {num -> Block[\n {numVecs = \"NumSeg\" /. bhdr, vecNames, nx = \"SizeX\" /. header},\n If[ numVecs > 0,\n vecNames = Take[{ \"ILM\" , \"RPE\" , \"NFL\" }, numVecs];\n bhdr /. (\"SegArray\" -> vec_) :> Sequence @@ (Rule @@@ Transpose[{vecNames, Partition[vec, nx]} ]),\n bhdr\n ]\n ]\n }}\n]\n\n(* Extracts which eye was scanned. This is stored in the header of the file *)\n(* OD stands for oculus dexter which is latin for \"right eye\" and OS stands\n for oculus sinister which is latin for \"left eye\" *)\nHeyexEyePosition[file_String /; FileExistsQ[file]] := Module[{position},\n Check[\n position = \"ScanPosition\" /. Import[file, { \"Heyex\" , \"FileHeader\" }];\n Switch[\n position,\n \"OD\" ,\n Right,\n \"OS\" ,\n Left,\n _,\n $Failed\n ],\n $Failed\n ]\n];\n\nEnd[]\n\nEndPackage[]" }, { "path": "src/test/resources/samples/langs/Mathematica/Init.m", "content": "(* Mathematica Init File *)\n\nGet[ \"Foobar`Foobar`\"]\n" }, { "path": "src/test/resources/samples/langs/Mathematica/MiscCalculations.nb", "content": "(* Content-type: application/vnd.wolfram.mathematica *)\r\n\r\n(*** Wolfram Notebook File ***)\r\n(* http://www.wolfram.com/nb *)\r\n\r\n(* CreatedBy='Mathematica 9.0' *)\r\n\r\n(*CacheID: 234*)\r\n(* Internal cache information:\r\nNotebookFileLineBreakTest\r\nNotebookFileLineBreakTest\r\nNotebookDataPosition[ 157, 7]\r\nNotebookDataLength[ 7164, 223]\r\nNotebookOptionsPosition[ 6163, 182]\r\nNotebookOutlinePosition[ 6508, 197]\r\nCellTagsIndexPosition[ 6465, 194]\r\nWindowFrame->Normal*)\r\n\r\n(* Beginning of Notebook Content *)\r\nNotebook[{\r\n\r\nCell[CellGroupData[{\r\nCell[BoxData[\r\n RowBox[{\r\n RowBox[{\"Solve\", \"[\", \r\n RowBox[{\r\n RowBox[{\"y\", \"'\"}], \"\\[Equal]\", \" \", \"xy\"}], \"]\"}], \r\n \"\\[IndentingNewLine]\"}]], \"Input\",\r\n CellChangeTimes->{{3.6112716342092056`*^9, 3.6112716549793935`*^9}}],\r\n\r\nCell[BoxData[\r\n RowBox[{\"{\", \r\n RowBox[{\"{\", \r\n RowBox[{\"xy\", \"\\[Rule]\", \r\n SuperscriptBox[\"y\", \"\\[Prime]\",\r\n MultilineFunction->None]}], \"}\"}], \"}\"}]], \"Output\",\r\n CellChangeTimes->{3.6112716579295626`*^9}]\r\n}, Open ]],\r\n\r\nCell[CellGroupData[{\r\n\r\nCell[BoxData[\r\n RowBox[{\"Log\", \"[\", \r\n RowBox[{\"Sin\", \"[\", \"38\", \"]\"}], \"]\"}]], \"Input\",\r\n CellChangeTimes->{{3.611271663920905*^9, 3.6112716759275913`*^9}}],\r\n\r\nCell[BoxData[\r\n RowBox[{\"Log\", \"[\", \r\n RowBox[{\"Sin\", \"[\", \"38\", \"]\"}], \"]\"}]], \"Output\",\r\n CellChangeTimes->{3.611271678256725*^9}]\r\n}, Open ]],\r\n\r\nCell[CellGroupData[{\r\n\r\nCell[BoxData[\r\n RowBox[{\"N\", \"[\", \r\n RowBox[{\"Log\", \"[\", \r\n RowBox[{\"Sin\", \"[\", \"38\", \"]\"}], \"]\"}], \"]\"}]], \"Input\",\r\n NumberMarks->False],\r\n\r\nCell[BoxData[\r\n RowBox[{\"-\", \"1.2161514009320473`\"}]], \"Output\",\r\n CellChangeTimes->{3.611271682061942*^9}]\r\n}, Open ]],\r\n\r\nCell[CellGroupData[{\r\n\r\nCell[BoxData[\r\n RowBox[{\"Abs\", \"[\", \r\n RowBox[{\"-\", \"1.2161514009320473`\"}], \"]\"}]], \"Input\",\r\n NumberMarks->False],\r\n\r\nCell[BoxData[\"1.2161514009320473`\"], \"Output\",\r\n CellChangeTimes->{3.6112716842780695`*^9}]\r\n}, Open ]],\r\n\r\nCell[CellGroupData[{\r\n\r\nCell[BoxData[\r\n RowBox[{\"RealDigits\", \"[\", \"1.2161514009320473`\", \"]\"}]], \"Input\",\r\n NumberMarks->False],\r\n\r\nCell[BoxData[\r\n RowBox[{\"{\", \r\n RowBox[{\r\n RowBox[{\"{\", \r\n RowBox[{\r\n \"1\", \",\", \"2\", \",\", \"1\", \",\", \"6\", \",\", \"1\", \",\", \"5\", \",\", \"1\", \",\", \"4\",\r\n \",\", \"0\", \",\", \"0\", \",\", \"9\", \",\", \"3\", \",\", \"2\", \",\", \"0\", \",\", \"4\", \r\n \",\", \"7\"}], \"}\"}], \",\", \"1\"}], \"}\"}]], \"Output\",\r\n CellChangeTimes->{3.611271685319129*^9}]\r\n}, Open ]],\r\n\r\nCell[CellGroupData[{\r\n\r\nCell[BoxData[\r\n RowBox[{\r\n RowBox[{\"Graph\", \"[\", \r\n RowBox[{\"Log\", \"[\", \"x\", \"]\"}], \"]\"}], \"\\[IndentingNewLine]\"}]], \"Input\",\r\n CellChangeTimes->{{3.611271689258354*^9, 3.611271702038085*^9}}],\r\n\r\nCell[BoxData[\r\n RowBox[{\"Graph\", \"[\", \r\n RowBox[{\"Log\", \"[\", \"x\", \"]\"}], \"]\"}]], \"Output\",\r\n CellChangeTimes->{3.611271704295214*^9}]\r\n}, Open ]],\r\n\r\nCell[BoxData[\"\"], \"Input\",\r\n CellChangeTimes->{{3.611271712769699*^9, 3.6112717423153887`*^9}}],\r\n\r\nCell[CellGroupData[{\r\n\r\nCell[BoxData[\r\n RowBox[{\r\n RowBox[{\"Plot\", \"[\", \r\n RowBox[{\r\n RowBox[{\"Log\", \"[\", \"x\", \"]\"}], \",\", \" \", \r\n RowBox[{\"{\", \r\n RowBox[{\"x\", \",\", \" \", \"0\", \",\", \" \", \"10\"}], \"}\"}]}], \"]\"}], \r\n \"\\[IndentingNewLine]\"}]], \"Input\",\r\n CellChangeTimes->{{3.6112717573482485`*^9, 3.6112717747822456`*^9}}],\r\n\r\nCell[BoxData[\r\n GraphicsBox[{{}, {}, \r\n {Hue[0.67, 0.6, 0.6], LineBox[CompressedData[\"\r\n1:eJwVzXs81Pkex/GZH7XlsutSQprwqxTSZVfJGp9P6UYqlyxHUhTaLrq4JpVK\r\n0SHRisGWjYiEbHSvb+Q27rllmYwaY6JpwxgZTI7zx/vxejz/eht4H3PyoRgM\r\nRsj0/t+1MEPjP1Zc8O6L0tCYkJERTokxP5YLLR+MQy2qZWSzX62gWcaFn9s7\r\n5sVFyohY4ZvLs5Ya6AheLQxnyIgFe4fllag6yH4zayhMcYw0FU5SRl8bweS/\r\nwyVFa0aJBsz2VDVrAl8V299DGKPk1yWJllEHmqD42vuI4RopiRvJlYS9bYLZ\r\na2c4j3pJyS8JbT7eeW/By6ht44vkEXKuxtRu1d4WOB5QmStjSUhO0eMleTda\r\n4EZtHmU5PEyaORsUFte1QFHRg6WjFcNkkZ/bC+11rVC0s8n9nf8wqVGINGNo\r\ntkFRzD3HsYohosXu0misbAdxXml1VdQgKSi80nXErBNo/oP47aliMqAxEGvn\r\n1QlVgoRvezzExCjYznppYifkn+K6CVli8peV8m2BrBNM20LljlmfyXVurK97\r\nRRfcVCpPCXg8QIIF14a2eLyHn6Y4909//UTSlWsvqm/qge1fVjduzhISa/Zp\r\njwjPHvCM6ZD7BQgJz9/E/GtIDyRsSj3Svl5ItJtj+uru9cBdE2PXZH4vSeDY\r\n20arfYAT6Z3e8axecnFxw49TXR/gU5X5vDu5H4kfvE0RnxSAsqvDMcduPmFk\r\njD7rihGA7RmZ5qlYPuEo6vFq7gigR67QPetXPqnm+rJy2wUA0hVVHindZOmu\r\nyQwfy17Y4OU185n7e/LpoNH9bqYQPPrPvwn+2kkOXT/zqim+DzJ72WEzdrcT\r\nSprBJ7l9UD/Fag2c005SXasZhWV9kH51Z/aqhjZSo6dpc3WkD4L1tqolbGgj\r\nJndzqmzdRPD67PLxVrNWIn7e0lS28BMs6Ba9FM1pJv7CZYLign6IeWFYmrqk\r\njvR4/jOrlNsPoqNsieZftcS5I9qsvrcf8tnmIzq6tcSiVnRKqDsALqbKTVU/\r\n1RCFoiw1ragBULG3LYphVhNOuIF1yN7PkFMpYVXI35BSTZ2UdWpfgMls07e/\r\n84QoGUQa8S0GgVn/55MIdixUWyWsOLtpEAIiTazYlglw2e3W2gVOg5BMOVFO\r\nzolAxT/ZsvvwIJAvj7SczqbC+Hex37ubgxD8udJ0tkcmfOa55DRSQ8DwsFzc\r\n6lkIdRyjZa/rhsAywLBSze45xKnVGt/eJwFLB1UN7sVq8O7aRRTqRsFbq7Mr\r\nJqcdTlREeh8zGoeOsKZ1bgF8KDqu4qxtK4c/T0q26boJ4PbpwwMrXRn4N9vd\r\nqamzDy6kTzqOiJmo6OOuteZtPzBaevBFmALy6nNqfwkTw5JA39BdxjPwSH3B\r\nvlWGX6FXmvyb8suZeCtkhRV5NAh2wkNnrp+YhaOXrkQMdg/Bjt54ExZLCdti\r\nv+y2+XcYBt54R1TnKyOH4R+txpOAmXr7Apu9quiaByGbG0dACaRePMmPmLmw\r\nvX84Swpbvrh/M3RRQziRFnP5wih0lB1gupuqY0FCbZyewzcoiS731JeqY4Zj\r\n3+qZP4yB74ygnoYGDcz5GOJ8uXwM9p88XaKSqonn9R26+EdlsMLPpMHeaw4K\r\nrc1neaqOQ6OGqXLQurmYKexKyno4Ds8LLqSZKmhhhvxW6cjWCTjNNHaoe6+F\r\npidKHHi9E6DEC9vqXzwPGaH7eO6hkyDMNkhMD9fGsUD+Knv5JCQu1VF86qKD\r\nh3vll15HyyE+1bfKS18XbTje/KqZ38E9cU+DikgXNYxUk++f/Q5jG7Nk6a/m\r\n49yHih6fJ7+DQLghtCxKD9We/pFtf2wKMtir5td7LcDHFdUyrmgK8i8Fqfst\r\nZ2H5rdC2ZGMGRrns36YgZWHfc/sj7Z4MNOfdzo2qX4jaWiITpSQGcpal5ddv\r\n08c4nrYPVjPw3OurnG1P9ZGdfship5yB2+e7ZNUsMsAzD/MLtFcycb1/1W71\r\nKwb4qn7LsIcnE9P1vBfVSQ1QUbd5z75rTFz05m7Sjt2GeHJ9UIrOCybGLy8z\r\nbn5liLETFcsURUz0lSi+5RrTGL/GlX1jDoXeRcP6V67R6DRvQNHcmsIjF5wn\r\n7RJoPPVD0ph42kHOxe9U/qDR/97LrjtAYbQ0KC4+iUa6N+b4nPUUFqyTTSTf\r\npDFTFtw6bEOhrHSqPTuPRo1786Pv21IY36xytbyKxo0v5z7UdKEwNfPowctc\r\nGuUeojTutDMDG2y21tIYpHQ98NxvFD7Sih+vbaBRfeZZ6YArhTx3zYMtbTRC\r\nCmNNqTuFRgIdm48CGveGmxUf2kfhyuIw1h0hjasPiNIWelFoealL5iOiMZKf\r\nHdA6bXujmw/6B2gk7zZK2PspPHlYnzU0RGN40raf1XwpDLc6L/tbMv0vikor\r\nn/Yl1Y+tgVIayzZ/kIT6UcgpzIwZG6Px0d7RwA8HKcyIUPR7Nk7j8sLHN2/8\r\nTmGeo8+G8Ekab1ncfmR7iMJiw8oF1t9pnF9RQuTTfiVZIpuaonFCb+xJ0WEK\r\n/wc13qzo\r\n \"]]}},\r\n AspectRatio->NCache[GoldenRatio^(-1), 0.6180339887498948],\r\n Axes->True,\r\n AxesLabel->{None, None},\r\n AxesOrigin->{0, 0},\r\n Method->{},\r\n PlotRange->{{0, 10}, {-1.623796532045525, 2.3025850725858823`}},\r\n PlotRangeClipping->True,\r\n PlotRangePadding->{\r\n Scaled[0.02], \r\n Scaled[0.02]}]], \"Output\",\r\n CellChangeTimes->{3.6112717778594217`*^9}]\r\n}, Open ]]\r\n},\r\nWindowSize->{716, 833},\r\nWindowMargins->{{Automatic, 214}, {Automatic, 26}},\r\nFrontEndVersion->\"9.0 for Microsoft Windows (64-bit) (January 25, 2013)\",\r\nStyleDefinitions->\"Default.nb\"\r\n]\r\n(* End of Notebook Content *)\r\n\r\n(* Internal cache information *)\r\n(*CellTagsOutline\r\nCellTagsIndex->{}\r\n*)\r\n(*CellTagsIndex\r\nCellTagsIndex->{}\r\n*)\r\n(*NotebookFileOutline\r\nNotebook[{\r\nCell[CellGroupData[{\r\nCell[579, 22, 224, 6, 52, \"Input\"],\r\nCell[806, 30, 211, 6, 31, \"Output\"]\r\n}, Open ]],\r\nCell[CellGroupData[{\r\nCell[1054, 41, 155, 3, 31, \"Input\"],\r\nCell[1212, 46, 130, 3, 31, \"Output\"]\r\n}, Open ]],\r\nCell[CellGroupData[{\r\nCell[1379, 54, 137, 4, 31, \"Input\"],\r\nCell[1519, 60, 105, 2, 31, \"Output\"]\r\n}, Open ]],\r\nCell[CellGroupData[{\r\nCell[1661, 67, 113, 3, 31, \"Input\"],\r\nCell[1777, 72, 90, 1, 31, \"Output\"]\r\n}, Open ]],\r\nCell[CellGroupData[{\r\nCell[1904, 78, 102, 2, 31, \"Input\"],\r\nCell[2009, 82, 321, 8, 31, \"Output\"]\r\n}, Open ]],\r\nCell[CellGroupData[{\r\nCell[2367, 95, 191, 4, 52, \"Input\"],\r\nCell[2561, 101, 131, 3, 31, \"Output\"]\r\n}, Open ]],\r\nCell[2707, 107, 94, 1, 31, \"Input\"],\r\nCell[CellGroupData[{\r\nCell[2826, 112, 299, 8, 52, \"Input\"],\r\nCell[3128, 122, 3019, 57, 265, \"Output\"]\r\n}, Open ]]\r\n}\r\n]\r\n*)\r\n\r\n(* End of internal cache information *)\r\n" }, { "path": "src/test/resources/samples/langs/Mathematica/MiscCalculations2.nb", "content": "(* Content-type: application/vnd.wolfram.mathematica *)\r\n\r\n(*** Wolfram Notebook File ***)\r\n(* http://www.wolfram.com/nb *)\r\n\r\n(* CreatedBy='Mathematica 9.0' *)\r\n\r\n(*CacheID: 234*)\r\n(* Internal cache information:\r\nNotebookFileLineBreakTest\r\nNotebookFileLineBreakTest\r\nNotebookDataPosition[ 157, 7]\r\nNotebookDataLength[ 200462, 3656]\r\nNotebookOptionsPosition[ 199657, 3624]\r\nNotebookOutlinePosition[ 200002, 3639]\r\nCellTagsIndexPosition[ 199959, 3636]\r\nWindowFrame->Normal*)\r\n\r\n(* Beginning of Notebook Content *)\r\nNotebook[{\r\n\r\nCell[CellGroupData[{\r\nCell[\"\\<\\\r\nHow far is the Earth from the Moon?\\\r\n\\>\", \"WolframAlphaLong\",\r\n CellChangeTimes->{{3.6112720079145803`*^9, 3.61127201386392*^9}}],\r\n\r\nCell[BoxData[\r\n NamespaceBox[\"WolframAlphaQueryResults\",\r\n DynamicModuleBox[{Typeset`q$$ = \"How far is the Earth from the Moon?\", \r\n Typeset`opts$$ = {\r\n AppearanceElements -> {\r\n \"Warnings\", \"Assumptions\", \"Brand\", \"Pods\", \"PodMenus\", \"Unsuccessful\", \r\n \"Sources\"}, Asynchronous -> All, \r\n TimeConstraint -> {30, Automatic, Automatic, Automatic}, \r\n Method -> {\r\n \"Formats\" -> {\"cell\", \"minput\", \"msound\", \"dataformats\"}, \"Server\" -> \r\n \"http://api.wolframalpha.com/v1/\"}}, Typeset`elements$$ = {\r\n \"Warnings\", \"Assumptions\", \"Brand\", \"Pods\", \"PodMenus\", \"Unsuccessful\", \r\n \"Sources\"}, Typeset`pod1$$ = XMLElement[\r\n \"pod\", {\"title\" -> \"Input interpretation\", \"scanner\" -> \"Identity\", \"id\" -> \r\n \"Input\", \"position\" -> \"100\", \"error\" -> \"false\", \"numsubpods\" -> \"1\"}, {\r\n XMLElement[\"subpod\", {\"title\" -> \"\"}, {\r\n XMLElement[\"cell\", {\"compressed\" -> False, \"string\" -> True}, {\r\n Cell[\r\n BoxData[\r\n FormBox[\r\n TagBox[\r\n FormBox[\r\n TagBox[\r\n GridBox[{{\r\n PaneBox[\r\n StyleBox[\r\n TagBox[\r\n GridBox[{{\r\n StyleBox[\r\n TagBox[\r\n TagBox[\"\\\"Moon\\\"\", \r\n $CellContext`TagBoxWrapper[\r\n \"Entity\" -> {AstronomicalData, \"Moon\"}]], Identity], {\r\n LineIndent -> 0, LineSpacing -> {0.9, 0, 1.5}}], \r\n \"\\\"distance from Earth\\\"\"}}, \r\n GridBoxBackground -> {\"Columns\" -> {\r\n GrayLevel[0.949], None}, \"Rows\" -> {{None}}}, \r\n GridBoxItemSize -> {\r\n \"Columns\" -> {{Automatic}}, \"Rows\" -> {{Automatic}}}, \r\n ColumnsEqual -> False, RowsEqual -> False, \r\n GridBoxDividers -> {\"Columns\" -> {\r\n GrayLevel[0.84], \r\n GrayLevel[0.84], \r\n GrayLevel[0.84]}, \"Rows\" -> {{\r\n GrayLevel[0.84]}}, \r\n \"RowsIndexed\" -> {\r\n 1 -> GrayLevel[0.84], -1 -> GrayLevel[0.84]}}, \r\n GridBoxSpacings -> {\r\n \"Columns\" -> {1, 1, 1}, \"Rows\" -> {{0.3}}}, \r\n GridBoxAlignment -> {\r\n \"Columns\" -> {{Left}}, \"Rows\" -> {{Baseline}}}, \r\n AllowScriptLevelChange -> False, BaselinePosition -> 1], \r\n $CellContext`TagBoxWrapper[\"Separator\" -> \" | \"]], \r\n LineSpacing -> {1, 0, 1.5}, LineIndent -> 0], \r\n BaselinePosition -> Center]}}, \r\n GridBoxItemSize -> {\r\n \"Columns\" -> {{Automatic}}, \"Rows\" -> {{Automatic}}}, \r\n ColumnsEqual -> False, RowsEqual -> False, \r\n GridBoxSpacings -> {\"Columns\" -> {{\r\n AbsoluteThickness[-1]}}, \"Rows\" -> {{0}}}, \r\n AllowScriptLevelChange -> False], \r\n $CellContext`TagBoxWrapper[\"Separator\" -> \" | \"]], \r\n TraditionalForm], \r\n PolynomialForm[#, TraditionalOrder -> False]& ], \r\n TraditionalForm]], \"Output\", {}]}], \r\n XMLElement[\r\n \"dataformats\", {}, {\"plaintext,computabledata,formatteddata\"}]}]}], \r\n Typeset`pod2$$ = XMLElement[\r\n \"pod\", {\"title\" -> \"Current result\", \"scanner\" -> \"Data\", \"id\" -> \"Result\",\r\n \"position\" -> \"200\", \"error\" -> \"false\", \"numsubpods\" -> \"1\", \"primary\" -> \r\n \"true\"}, {\r\n XMLElement[\"subpod\", {\"title\" -> \"\"}, {\r\n XMLElement[\"cell\", {\"compressed\" -> False, \"string\" -> True}, {\r\n Cell[\r\n BoxData[\r\n FormBox[\r\n StyleBox[\r\n TagBox[\r\n TagBox[\r\n TagBox[\r\n RowBox[{\r\n TagBox[\"239\\[ThinSpace]262\", \r\n $CellContext`TagBoxWrapper[\"StringBoxes\" -> \"239262\"]], \r\n \"\\[InvisibleSpace]\", \" \", \r\n StyleBox[\r\n \"\\\"miles\\\"\", LinebreakAdjustments -> {1, 100, 1, 0, 100}, \r\n LineIndent -> 0, {\r\n FontFamily :> $CellContext`$UnitFontFamily, FontSize -> \r\n Smaller}, StripOnInput -> False]}], Identity], #& , \r\n SyntaxForm -> Dot], \"Unit\", SyntaxForm -> Dot], \r\n LinebreakAdjustments -> {1, 100, 1, 0, 100}, LineIndent -> 0, \r\n ZeroWidthTimes -> False], TraditionalForm]], \"Output\", {}]}], \r\n XMLElement[\r\n \"dataformats\", {}, {\r\n \"plaintext,moutput,computabledata,formatteddata,numberdata,\\\r\nquantitydata\"}]}], \r\n XMLElement[\"states\", {\"count\" -> \"1\"}, {\r\n XMLElement[\r\n \"state\", {\r\n \"name\" -> \"Show metric\", \"input\" -> \"Result__Show metric\"}, {}]}]}], \r\n Typeset`pod3$$ = XMLElement[\r\n \"pod\", {\"title\" -> \"History\", \"scanner\" -> \"Data\", \"id\" -> \r\n \"DistanceHistory:AstronomicalData\", \"position\" -> \"300\", \"error\" -> \r\n \"false\", \"numsubpods\" -> \"1\"}, {\r\n XMLElement[\"subpod\", {\"title\" -> \"\"}, {\r\n XMLElement[\"cell\", {\"compressed\" -> True, \"string\" -> False}, {\r\n Cell[\r\n BoxData[\r\n FormBox[\r\n TemplateBox[{\r\n GraphicsBox[\r\n GraphicsComplexBox[CompressedData[\"\r\n1:eJxcnHc8lv/7961K0lCUnRWl7JHMt7JCIoRCGso4r+u0QktRpIyGKCoaRkap\r\nbNFQUQoVSRlZITOJkHS/rvv+fP+5f//8Hq/Hh+s8jufxfh/H6zgvfSX30Nvc\r\nOdjY2ATnsrGx/v+wEU/7SFO/YUOKbGH4LpoEPBBMiPjcb6j70EbK25YmdcFB\r\nU2u+9BvKxbtfdz7CJIXcHGcqoJ1lDalFZxnksi4t7NjcbzivYCPbyRKKWL1Z\r\n5zQN/eiozmB4AEUuSC1/caGl3/DCduc4Q3sGyWzY2qLR2m+YkhR6eOAjkzyS\r\npyYaoc3/GAj4HqCJ0+Z8XUZbv6GqcrJn4nMmqamwVF7ytd9QJ2Ms9Uwig9Rw\r\n8VnfgS7McrW78Y0iVf1Fvnrt/YZncyYcxR5RJGFtLvkKHap4MvC8AoOMqn/Q\r\nCezoN/QLi+9o1GYSqUTjbqHOfkOj6GrBUGOaWN68GlsK3T4+P1pQliacfmLu\r\n1l39hsun8pUNZxnk3PWRvp/QNV66JcoVFMm4MHTlbHe/4Zb30xPV5ykS364z\r\nofit39CJ42NTNJ53tJ6yfwfNXFIyv3Ylk/yIfd2+v6ff8Lpc+POzvDTZkBYo\r\nxNPbb1iZvGJ3AUWTRae2htyCzghf4ut2nUnY/r//UznCp6ODepx28K88fZgm\r\nUgKvTJuguRKsZjaMM0nFU13DQNQjhO2Z82IOJkm/VWyzEPwzm7oCY4UZ5Cdn\r\n7YZM6L9n15gMoB4/Am8uMkE9Iv94sp1GPtf/qL7rgj57QkDQX4xJHv5z8YxA\r\nPWSKtN/8NacJj/Z5ISnUo7h8aIOwKk2WRZwofAy9h8OpUH4d6tOlSJxRjyfz\r\n4zakrmOQ6qDu9p/QKisin4g+o4hilJpTLOoRXXKl7U0zRYzuk8fyqMfN0yb8\r\nNukMwtO7YMkraN663d2un5hk/XWfDV6ox6/4SofZPTS5c6bl0Bzwd/GfN/dV\r\nOpO8Pj034yb0l0SfQx2mDHL18vBTfdRDcmHz69IzFBEvuVTVAv0y4dQPmVqK\r\ncO9oSDuOejzMLKzISmEQTRWRqyKox8noIVfua0zCLyxxrBh6rjrvcArOfyp/\r\nl8V21OPkJbHJyjU0CTS+qzIEffXJl8GD7QyypD0mRgD8swMtLXQDaWKx9wcz\r\nF7po3/ePB/Dzr0R3iFmjHrwX/g4M6DPJPXuXoV5oi79b1q+2YRCjG+JZJ1CP\r\nmCmuPck4Pysle9UkwH9E72x+/wWKrDgnU10KXXRgRuRkEYMo9jdKuaIerSvv\r\nrYwVpske1dnTM9D8/Y9v7rWnSeGBpKl41COG+8TbqENMsqVeT0sT/Gdsik/l\r\nuTKI5ePDV2qgSXPw9fA6ikyXHvzmjnp8U7eWbHhJkaGhoH9c4L/v8ivXD/sY\r\nZHbhyKoU6I0Bh2o0o5lknUjzoo2oh/l8jWd24HNYQJerHfqJYdSXc0NM0jPD\r\nN/cQ6rHNYp3KQ/CNFx5pEAR/d44FT3yvU2TPKsP7edDfV271H89EfxDjtnJA\r\nPfZVKU2dwPOcOIwmx6G/vnhYKeHKJGENv+6dQz12OzonL9GjyXBLjqoy+P/J\r\nqOhkR74V+2Y/VUF/mfkxw9jEJNuWx/e5gb9d268PUkyaTFamSLCDd1yy+KRJ\r\nKZMkjywrVAXvI0X8krt7KXLjwLHX76E97kfN8/OiyNO3O797g3d1QtSFAi4G\r\nkfYwbOQF39oNIpY6x5lEU+Bb7j1oLl/7ky37aPLQUCrbFLxlfmWJu7LRxCd1\r\nv38v9Cb5NdmKOB9bfq00CwPvcFONtJv4PDMVqzWC4D2g/PuObil47Bx9Wwi9\r\nbnt3ssIsRZL85h+zBu9etuGl08MMsvzp6ukf0Eo+juTVcppsXDl330Xwrt5w\r\ncfTOVpo0/j06Ig/eOW/fOJ60Z5KcpX9Mq6E9t5auSpqhyE3+4Zx94O0re8FF\r\nPIIiXyz72uaA78nET9SdaYosc/upZwi+hd1zuXhx39J3WVh0QBc1Lg8/4oP+\r\naynkfhR8d9aeXNs9wPzv/H/57/y7kONL3xZygDeJKmHr8KKJ29lTHFehDb5k\r\nqKob0uRttccCPfCvu+w1bunCJKq5SjofoesvVNlcZTAIc9hkDwX+uY7SIa9v\r\nUURz4ozJQvBPDqiM6AqhSIOjmGk6tFlRwbadEQxC7Yr7txn8VW0sFzRPMkms\r\nosaT79AD6iLn/XbTJNJR7moo+I/MvmEYpTDJQgtjdWnwn+Iwvlt4hEGiO4x/\r\nlUL/ZRP/RH2mSPuHhGwb8LfNLC1sfEyRiuhlEj+hh47VXu43Y5Dgm+33z4J/\r\nj7NMyfu9TCK34/yUAvhzHa8S+rOdJnubvTfXQKuMLBFrQj8PKLpcsA/851+w\r\ncpyqZZClziNtc8D/vDDbxsG7FDm187JMCvSJiVizliSK/JyVlNqEeix5cbJm\r\nN57X79Uk2wVtoDVmMYV+UaLy1fQI6mEsrON/FvOI/xmfrBjqERtX+mzBfpp4\r\n/JJdWwDNZ+ofWueD/m9Wz2cF/rzD3cXn0Y8WDqvlD0IfOXbiAt9nzLvNPZwS\r\n4H2Nmah5mY1BXhekhZZDX6kcdKrF+W+6OfvHEbzPZeXpb+4EHxVt20noVIq6\r\n5GrFJAFnb0YngbeTJqfWkBNN2vScOtXBWz1eN+2eKM5n/Bh/PfS3sqSQ1Dng\r\nT8kZ0eA90snmHybIIGfshMLngO+Utc3Sc5jPZv5L425BP2iVLUoeoAjNl3Zd\r\nD7wzmv/Y7atmkPO2wuEt0MvD9xodnGISXddHViHgPSAletoQ/efJ8xx1QfAO\r\nThsS9g9hEu2aE78LoB/U7nMKk2QQ8e3DhTbgbdLJOKJ+iiIzYfq2o9CzNSfP\r\nreuiSOqrCEoRfJ/2zOy5W8IkrWUa3W+hvWJUbfO8aRKiHOLoCb6vrd11+hfS\r\nRPCX4bdRhW7D/MWpvo4e+8mNu1v3rQZfAS+dC7cO0URT17n5OfRgruiBPXw0\r\nEdk2MXoJfM/wv+YjxzF/LI0k1cBTRDt7Yk8G5m+AsIkfeH5WsT+6SB2/r1ll\r\nvRj8dHuSa8NNaRKzU1N3M/i13l31NduYQRZczdVth/ZsfUxlVVKE/7bdysPg\r\nZ8ambW6Ifn7q8N+kPPCyv1nNvygP961llcx28Jrh9l39COflwlbeJz+h2Xmr\r\nfKLfMInjxujtMeBV+PxMYaQ/gwh+Hq5eCz628nUaiZhHZKRf5xW0wpKtZubo\r\nVxZBPMtTwefvQfk2DhuavJ40NdjEmo+PqjknN9FE9OPHU1+gddq+/RrlY5Ku\r\nru1P/MHj+6qXE2f20kQ4wdDDGDxePL2a7I54g4Ts+Xqg1yfJFwjg/N35XdwY\r\nAj5zXv8KK4N/2J9s5iQJPhcb/L3eZzHJZMrq+groLxcSMqs8aBJhPOC/A7yi\r\nRi2ss7uYJOaooGU8+By7kFHp/wu8F52skQefQbUFSznhR49uejf3DXQev/ej\r\n9/wMcm3denoOeLhEa3PkqNDEtN36UDr0li/lk28MaCLuePBKG/jwemgP8rVR\r\nRKZ+6FYQeFzzyjfgjqRI2G+XxXbgIRovffDITybx4dj9cBw6sk05WdKfJuoe\r\n+b7nwKNsRerdTZX/65/V//XPLaRwrbfFFPy2noDPTjV3mvRft3p7Hrx+be6S\r\nuwe/VSvpE6aGfvlAwOO1HcUkv5oFO99Ar3Dm+tqAfhYmsFN/D/iZ8ERtTEV/\r\nqXBrruMEv5zJEyX5hyjysDxxzjXokjnz/WvRb3mSRocMwE/ZQySUvY9JUnPe\r\n7WiHts5WsXqP8/Hj3ZB3EHgeFCwYYD5gkqG5mx8KgaeQveiaG/D36/zX3noA\r\n3RL3w98NPBpcM2JNwXNudtO86TKKrHPefb8Pen3j6tN6Ogyi7u0UeALnsWxT\r\n+bdzW/G8qf5hafAlF+9o6WF+OT7mHHwO3eIbYxcsRJOySztidoD3+QdfB671\r\nMMi7oyN7Z1j+O+PwyTWF8POBFW2XwH9V94uU+niKvBhR5N3A8gt719n+1mYQ\r\ntRSpx5+hHWQas/YqMYmdmx2/L+pxIo3LKht+SVbtRcoy1GPCuPpNgSdNdHQf\r\nNWRDu/QYTq04zSTTu/3SjcC/b7wluwr++gr77LFO6EVneitX9TJJ98G6rOXg\r\nrVC901B1IYO0tZS45EH/funU/pSmyD5e6/Ct4M1bH7vS4wNFHicU8g1Dt3HF\r\na/3QYJJlL/8dPg/eHEI7Lh60o8mvR7+OrQXvwDXx9D45mmQtLP32Cjq+/VBS\r\nryD4y62tcAfv1Ps9n/2kGES+Z1Z1htVP8wb77DGvdP5JBV4B7xtvvpoXoJ99\r\naf+poA7e/15zBAoVw3+IxZl/gP7urmB5+juTlP4VMAoAb0dn35GVmJf56Uaf\r\nFoGvQ9Th89cvwm9lbarLhj7Fq+0/ocYgLYHDOmbgnT/bHmcB/7Aw2XNhL/Ru\r\nVa6nd5rgF2feca4C39i+oKWzuJ/BA1n3K6Bzl/49OMzqN7eUP+wC33S/Z4lN\r\nIjSpuhYUNXK21/DOAQOlAzJepKlyeFIcfHf7p0wooX8+3SqbVsLab+TPZoSK\r\n0UT5EE/tWfBd8Xq8PvI0RS4VxmetAc+EsqSP6dcoci43WN0DPNXozoaE1djf\r\n8vcMzgG/Oy/OyzvjfDFWaJcagNfwv+EHStsYJGddfH8j9G6zdLaL1RSZp+TO\r\n4QN+l4VfFpyFNjQKdMsErx//bjt43mCS3CMnhCzBK7V24FIo+leEauru79CT\r\nqzJXxbYwScrKrYonWf3Tabm98xkGaZwa3ioFPo8Dzx9Tx/m04Vk+UQ69QLCu\r\ndeVDivSkHe9MBJ+OicE8WzOatHhNF28Any0PTMaOWtJkRNRL8T10FGNgMlee\r\nSYT/jtt6gUdw48zXAZzXlgr5xbrg0b9z2/LKLxSJJp5DzdBWq3a2bUL/VN/D\r\n43YQfPqUCE8J5q0R58sVK8An5Ae1xyieSS5/iXhWDC3c+mzMD5937XnEYhvw\r\navI7UsSF/sXQEq2OAp92rrfHW/+gH6d4HJEEH2/V0NYU9E+6rv37U2hmgdzd\r\n4/Ph1ydy1f+AV/m3bY99V9HkxfFs5jXw8eVZfbAU88tdQ8unAXycD5SEcwxS\r\npHNsSI4JHkde3bJahnpWr72Tbg4eh6p/1vh/Y5IFKo0hA9DH/nAnf/WjicmX\r\n/QPh4MH9K25wGfzL/5u/Df/N3+3EbGqdFC/4bGTnTI+FX20MLNVKg+5JNuOy\r\n0oB/rVKNCASflWv4f+QlUiQrSqt8OfiYPjkUp4jn18ho8NmBR6TWsfj8+TQJ\r\nvp8oPQZ9fPGQoPdOmgxudTN5AR7iTAvtQw047yYRr3Yif42tzdFi2GezSjW4\r\ntFjzwyhkSA4/z5ysT2+EPu3COHdhFv1HZ8RpMav+seFsuWkU8SeUVyZ0pVwd\r\n95ub2E85vY6Es85DyZvIGswf9q27cmSR74vr+h8iXGhyVkn9mAPyUe4ZfOkE\r\nHvmxF9KqkE+YTpnyDdT749ZNyamI955tTus++KFXT8pN9FFPv4NfwosW0UTh\r\nvnRlMOLXFhDhvbiIQfoq1D4tQvxeSoyAz5jn9r3s93OgX4wwpCPHKFJ/5uaT\r\nHtTz9rRLhTg3/NVjN6dI5DPoOcO47ECTsZHylU9Z8/DcOYNFixnETWNYZSfy\r\n8Tx1nFoTTpGNsU9XfEI+Sg9lqBXYv6jHb9r8kM/dO/5e+eDhZcFr8Otdu+Gz\r\nIu78zTl7iMel+3UqyO+V26e1Aui3c9d2CqQgvznWU9kChzGvO35e1mX5ARnj\r\njjTcHxvtMoejrPr8qpKOwHyWKF5bIIh8p21MuN7p0uRuiurjbci3bqcz7+oN\r\nDOI1vzr2O7T/YemErucUkVxhpHuK5T+/3Wv7XU+RfN03im7I70KdyFPWPrej\r\neNhYA/lEi3z8tyaGIkoNT0I/QMv94ZK8id+/bxa/+R7yc7EX2W/jiH07Iv6l\r\nJfJrLDq0vWA9TTbHGDZ3Qfdbtf9Qm0K/qS6SP4b80ryjog/jfOz5STR+NLPu\r\nU7H+JJMikRveJq1FPmnFh/1cnzLJDvfq7rfQZ0y8d4nC33gcvb5SHfG2/r7H\r\nsR/37+uex5mLEa9NdFhMgg5NqsnEyfvQXibvbG+p4fwffvi0D/UR83q0TfId\r\nRfY/HBILRfwvOE0frorGvK4f+PYP8dfppx4foP/3PqP0Pz+iR7YVl8b/gh+J\r\n3PEm0nkPTXIz1B5EIX7BEOE0XvRTq5qxckX4D43G/XlN/kxi7xejUQW94dmt\r\ntNEwBuFd477OBfnptu+/GZcH/7X8FP8/6Dzttm1iQRSR+vGpOwH1dMhV5Yzc\r\nzSA7iiS+aSNf53GOsktfmeS+d/KdZmij+mIVyQM0kVloY+eH+q5Py5Q/hf29\r\ntdt8lB/1lJ+d18t/kUFmdMSncqDT9rlJzXZQpDZV6cRG8PqafeD+AviRjk2R\r\nk13QzhyNs/vVsY+9E3A6gvPNvydzr5oxk+zdfOW7OPhtOleyehf81ofcrXpP\r\noNvyLHxercQ+y6l7yB48GwzvFDB/MohyDJ3+G5pt/4YtudhfxLmaHp0D38Nf\r\ndllsjYP/8dBgV4f/8HvItnwjnudYUjX/I7TmVdMvV+SY5Nbv2Glv1rzsecF9\r\ndRnmG3W9ZRHOi8ZPnwQN7BsybuFrMqDV16/R0MU8Thh+9sMA/Ie2PVv2DPfD\r\nZUHXnlboM4uvdigNM4kxr9EsH/je4Hre+GQZg3j8eG5xD/rQHcNl2/3Qn55N\r\nvjYHb4sDM+eCMN8UX//60QftYpvJU7KGSfZ0KvpFgXfvil/JJdY0+Xe44o0s\r\neF/2f2b3ZB32u81itc+hmX6eq89Igf8cBfbd4B1y2WmhtxyDTN8bPfMb+py7\r\ntl3JE8wf4+wDceCttrHs0tOvmM+vhAKVwFuNRMz9dQ/+MWyrQg2061VTQf92\r\n+IUtz/Vp8Nabuiq9GOdN8cr51Tzg6/SPvHl4jUlkhVY9SodmZsucUNZjEN3T\r\nzJBN4F02p02RM5L1fvd4fwe0gLtR037c56UrArdKgK+ul4ZX+m0mqQz7llAO\r\n7XSbS9UU8zupef7ineBrfWrkVZ0U9nVb/U3C4Dkv2CZzIhjz3WnB2Xzo+VUl\r\njwOkaVIazV8WDp7bdv9NWob788Vbf0QG/OqPLX1pdpkibW8z1u4FP6uFa9ib\r\n8XkO/sra7ODl8kmuZ9c21GtcZ0obfMbv2F71dWSQo+OnDT9Av7uwuG5BDUXY\r\nDg6NeYHXyYyz3kqvKCKRqboplbXvPopdap3AJMw3Cvym4LOOWrLWG36NTebH\r\nw27oZjVhtsWYlxtjlYVDwKc6zVnG5BKDaPLQF8XAQ6psi7gt5t2Xy2vri6F3\r\niZ67w3MP9dErfXUJPG5kyKx5uJEm327Xj6uDx+0cLu8nqH8TUT/5Fjpcc3h6\r\n0XomKTxjnOwOHvu/BDvNo2ii55SyZz14PDyTd3UZ7ttyO//mRugvXmM/d2Ae\r\nHV6Rl+oDPk5d37YUYd7ka3D+5gOf2BOebcfOMknP74LiPGivf2u2X8H9zgiz\r\nc7EEr+Nqy7xVsN+7LBeffxp8stwqfDP/USTYY+cHUfDJUdHdNIz+5yHg2fwI\r\nWm/O3PRGTgbR2kmtmACve9n2/0TFaXKyztHzMviISbnkPbCgCXeqkHMd+Jy4\r\nXyfohvm2kYvp5QkeYb+FGq/Azw4bb/lpDB7z9m7O2duGffjVEvce6Jm+cxfu\r\n+tLEehlZHcq6n+0LeI92wv+HH6XmgUesiWt9EYMmV0+kiN2AjtMNFjFEP+7+\r\nohvgCx4BT0WK9JOx35MO9qXgEX5iNOxdKEVEN+7j3or8573Y986UHfHSB3yH\r\noTWlTjUwXbH/CNpef4L8Y4ryucca4RejF5VuR77Bd9Yueon75cHTNauK/I50\r\n3DrJ50STvu8rJ99DR97bxh45lyZ5FvQ1Htb3EQ0bb9ZkUmSmJtQ0FVpk3bn6\r\ngusUoZJSd59g1d+Lc3Yt7jdPpNZ3SeQnkjiz+TXOl2zZyaptyEe838PgYABN\r\n9G9djatAPktC7YyLUF8Zhl98CuItf/GJJ9OZJvUhUZc2oH6Cmn4bugVoIha7\r\nak4A4uefiTE4i35UHCWryIP4MxVXf5FDv7RSOHszA3r7fnNG3Aj202GXWx2o\r\n36WnbpzVbDQJWbTI7iTySQxVyYnFvExwTVnwCPWrUjpsaQY/+8SYGbAd+Tjk\r\nTYzdO0WR86v+/H2PfPpTsnd9w/k8+DtVhIl8JAzW846BB5ckm7AC8mG6n2lr\r\nxn5xXn+QMwn5nFbtaMs6in054WrLetSnNVht3rMcitxwGLAKQn5JFxdZV2+g\r\nydqgKQ5+5Cdyze+7PO7L9WPqf7cgv0auZ+OeBgyi/aHsWzcr33W+7KYvKSLs\r\n8lbhOOt9ul/ApWvv4feig9fsRD6mlMmvN9jvS14xI5UR/4jUh6SOWIoU7/7o\r\nWgN9m/fcsV3Y52a/1illIh/uHimpLOyHT58wOcyQz/xXGeE5+jRRfbBA+St0\r\nz4qunxfnMImZw7yDwchvh9kdwzD4v8E5FtIDyG9jzMQBFYoiv715Dssin6sm\r\nQcOXC5gkM2yquYr1/nTwBJcf/IWW8flAJdb9UrfOyS/Gvlp1OJoH8dZHt5ne\r\n1KRJ5PnbIdnQ3D556w9o0+Tw97icLtRD4PvhFKFPFHlZwXA7ivifiQ4trj+D\r\n+e4t+3Ya8WfH9sdG4P6suuTZG4/43gnkZG01ockku431AcS3VT23Kz8D/i5b\r\nNYob/NMKpSUsUY/EIY6F3xDfLdOHFoHwY85ZWhaF4MswP53W04x+JrjyuiXi\r\nXZu1eVdfOe5Hpt6v1YhvfcJlMxHwantblPQK+otSndZqzFdfipZkR3z1buWd\r\nPPCPC7/nsCex3m8NrfnlcIUiYtP9ewTB0z1Rml0TPFw/SjlvRrzTo26qOZgH\r\ndq9z6WLE69/le3ctgyIvMt6djEd8YxmK7irww99nZJWVcT7sv3qcnY/+v0OM\r\nt4UN8W3hSDn2E/7jz12PzYcQz80nJo+U3WhybD9zyhLPt/ndNRmH8ytv51Nd\r\nBV7fD5eYhHqBt6dD/D7E89ctzquDnya62in3pBHPI+bQJk+c33R3tvZziKdF\r\neZh3Ngz3iX3IXZHVb/9I9XDdogi5uFmPgfgE31+9s02RJobjl5J5EN/ogymm\r\nI/bLlr234prBc3RWV1UQ82bR95YlB1n1j/n379tb9Ku19eI2iFdEpWr2Ms5r\r\n0HfmQjnEW6Ty9p31RYq8Osom9By6YNniZRqFFLmyyHgmGfGPzlFN2rkF/klF\r\n8qg+4m8ujDyijf02xCd9Ps3aXzk7sy+g33Mo7PrXjviffq14vQ79xKzcoboc\r\n8fquz7ESwz7a1HhQRpZVX7XKIBv0+8MXxmzYEE9fVEJZIfrVXOVZ/5vQU6M/\r\nNZ9vQv/sYnzzY/n1xLVVMdjnHidevfKD9X5yYVgWH/pXDtX6aQme//tRRrC7\r\nP032NZ4LFgEvnln21GjM85B5c4Wd8Pz5d+N3SC6lyS+22UY31vvUCoFPwfD7\r\nv+ZG2jfjebe3zuQvmWBi/+fPyGR9X9154r4E/IrzzUOPH+DnhTIqLp+apMie\r\n8J83g5D/ibI/5pbjTPJ23u5wTTxfynnVISv4N8115raGeH7VuU8+Cdi/OMRi\r\n3ELxefu2h/42NKZJ+TPl4w6oT9XD31I9qgyy+v0j8zP4/D7lg6s/4b65eQZF\r\n9OHzf4S3DjcMMsiVvKxXWvjvlh8+3DXE590I6dT+Cf+u9Dd45SjO28V16dJn\r\nPrPePxZ26djQZNHtgp3r4NeDNfffSQpCPuWmX19Azxsb5T4RwSAfVL1u70B9\r\neKsbrKNQ32yfpsIZ6KLm6JT3BymyY36Q3SXEL3vK9M2+nQzCYVLspoX48wfF\r\n4zWamUTTInzrZ2j9A0elN6Pe+tlhr2icvysD0tWLnjDJx/o355civ4cf/hrX\r\nxTPIvhuXU7Ogl0bu0qnrokh11dikAfIRW5d76hLmRVnR1Wsd0KsTc0r/KDNI\r\nGEdAdTDmhYl/itQcAv8zOrxflNVfF1ZI/DClybk749/KWN/fN8iH/MB9fFi6\r\nbmQb+tXvM9FJDpPYV+NzTcehi3q1OX+g33ZW75GPwflJs1eQXIjz7ZZafEQF\r\nfv3RZ6+gXjzPyyQp9wP0B3s2vzxpJtm8KYfhifMlMG9Vz9Il2Me5eY7wsr6v\r\nN3txZBz+Xcivvz4VmtEmalt7GX4h/3u8Hvgb2gszUlF/ct7+4xfo5R9+DeeP\r\nMkmgw2zGYtb7HEa9rNwKBlGYflWRDV2WWJBzw58iW0S3UGbg7amiZna8Evtc\r\nZ5xbD/TVw3n+1xEPj2/lUCR4RxxYUdCM+3dqR6afDHhvSHSoopTQb3utNj6D\r\n3qGze8QJ+8fHX3dvuIL3AM8yud41DLJnmbfGOOt9mH7HfO+nFFHxoNvPs/an\r\nY1kbKlsp4qWrIKwA3ikHkv95ZDHI1fy7ydXQGgV2s32ot+O4UBkF3qGmD8oj\r\ncB8Gzmu+nwe+OzakepTfhL9/J6CSCl3uV3OB2sgg1Ll7Kw3B2+CM80wb/PuO\r\nn/Odvnazvm/b1/0S+6pMqtm4GPhu2eDb1JPCJIxaDp5H0Pe9uc/7w5+sDA68\r\n6wi+XtERbhayNPkb1DE6zHpfVixk+aGZQSqE9vetAN85Dcn5GUHYn9uOzTyA\r\nDkywMWfi548nCKmdBF9aIXTWEfP3aOXFC1Lgae1SW5Z4iSIROw0y3MDT1Ek7\r\n7AX8ZMu2FR2z0Dy7x5532NLEvrvsihZ4Hfo75/xFnP9uJ/ahOujTmkaFZrUU\r\n+Xv5AeXBej/EZFSyV2H/aT6ffxO87q7g8tl0gUm2+J+6YAReZaVSE7twP8tF\r\nE3Z2QteUbmNs/c4kl4wlzx8BLyVOM8vXiQyyf2mumghrfrnmMPdcpUiya6Fh\r\nIbS0+MhCNviV5shPOhfBh/3E070dBjTxIuSSKni0Znalt2P/qNmWqFANfT9x\r\n5Ii+HpNwWTM27QUPlxbN5QLwr8xUJ16NZtb38ftctbvxeS7B2xqgb8UYHNuP\r\n/izmN8+UCT5Ly4vpwvkMMmh1a/9i8Ljy6sA14XAmiY3Yov6A5V+Ln1Da+2my\r\nbo8Olznr/TX/1xdVM0xiPyflzinwEWw4ErWKg0Ha3zYcEwYfiwdCgQLoV+5a\r\nCnYl0PkKB6U42BkkI6Y6cgy8RhZ+SvFj/X1DUG7PJfBxuBe07S7O946dPB/e\r\ngs+vf0Yr//6miB/vvQUHwGPuuY+JO+Hn2epXXtkEHsulVzcVfWGSf8sUm7qg\r\nv+yyjeKHH2nIzakMAQ+jpioR5V4mUbVM5ZsDHurfF3hZwj+GzFl6/jp0A8+S\r\nDG34rcxuwwEmeFyMThE+dYMicVc1UheDR2L9Cm2lE/AD7/6ctET+1882Mfj+\r\nMgn3VivBQeiu7K0Pf8CPyRx7a1aO/E2cv48oNVGkK/eDqh3LH67279wCP2/2\r\ncMNRZeR3ULnAaq4j5nvnyxt1rO+Ta1UW359Pk07bXD1u5Pc16OZoSzZFnl7i\r\nLbwJvf3IMz/xa9h3e541HEN+PYYpWjvXoP/JpJ1eifxsE5rD+7HvBoRlU9as\r\n7ycHZWfCDsIP59zgeYp8Pty+UVeB+r79M5/vOuKNOsaQtIDfdnT101mP+imv\r\n0I87LEQTgWPpqb6IP5Q2dZq7nEEkfqR8nof4ze/NWbgV/dnC2ko4DZrrltbS\r\nxCGKSEqWLfuK+jVIdd5eCR4uhfven0A+DQstLc66YF8ROB9ajPrpHh/Z9k2U\r\nQYa33BOwQz4V5g+LfOGHNH0FfeuQT/Ry2olVj+k4vlJv5KNtWnubyUOTbb1y\r\nT+SRT8WBzvVP4Ie2m40evox8TKXtg8eP4TyNjoRooD7HnEZm+bLAtyesOgD5\r\nbehU2T8IP3t/e3smH/Irf8bt3GREk3iq4JoF8tvh5N9/Fv3plqbmhU7obi7B\r\nokn4+RUnzqcfZX0/sMFhhIn+tE29Lt0R+ZSW7ozdhPPe9+7eGkXEX5du7VF+\r\nDv1ktVtNNfSBRSOddvB/qWuHbqUjn/S7sicacR+NnJtvGCMf88cDVY2GNJF7\r\n7vOlBXrJkW7/igVMkiCmJByI/PIKNUUj0O8eLrZO6kN+Gx7Fz9SgXorhmd+l\r\nkc/Z6IM56veZxJrvgsNL6MVPFny6Bv96I3O+lALrfuUrfG2Gn1eYbvo7j7VP\r\nRfOmyaqjH2pN/7kDfYwzLfO1Hk3e3jgl1YF6XLjz5WX8F/id6rvshxE/+5qn\r\njzPRn18XbjKYRPyJhTHL7fywTwu1OMUhvoBc0+8h8HflC7ZX7UN8FivF4nLA\r\ne+Xc0wpzwT/T4QPFdoQi4jXf8zoR39b3x9ZMwk++WPRwIg98ZUYeRUtjvnzS\r\n6RIwR7yJ8hfUfOHnX9pc8pVFfLr8N0gO/MrVly6bKlnfD1rfM7FejvwCcitm\r\nEe9eLlE14XyKfMhd73MZ8f7x+P1a4DJFbiU4sC8Hz1MjgT3j4JFz1ZzdFPGO\r\njomPlOC8CNXn9xQg3vyGbyaBTOzDmh7/LiK+p24vjtTbox+2LPykgPPxm+vf\r\nTKEMTSpCw0/PIt6VzcZqqYjvi/2TykDEw7/I2f4O+ncO816SOZ6vcmRPJR1O\r\nkfcpMXovWe+bzKdWVOD5vHNfqO1BPDFe8hwugjQ5y1ZlK8n6PtHX5Lol4vGm\r\n5zjEIJ6pGV+fTfj90Z2G3OvA73dzW6t9CkX6JDqKvRBfocSTxwFraVLZcMSY\r\nG/El67y0/IJ+aPRKxOAz4rtz21fI/jVFeHhvnvFj9Rfbzh3Fbyjyrn7NNStW\r\nvCc+v47GPpU+eu+eDOK9UmCevC6OItGbok4/Zb2/FKCD5cHTYMce+hriDxW3\r\nOSRjQROH2hhhXcTPn3+gaKc5zotm7T0K8Yc16Eu3Ib8qzX2BbYg/gmOxnRbO\r\n5w+LEeNHiFePZ72kGfw80Rmpk0Y8bx/ezgqGn+9/bvP8L/rDkZPvxUTRr759\r\nshtNRnwaIQsbH8P/Phy4G+GDeCaUe89aw8/v+1a8YBjxpJwyTg2Gf59WnXNs\r\nEZ5/3dV+8TT6+TyVbmEh8LrTVn61FfunbML1+O0sf+4/f5L19xo/pCu2urLe\r\nr0VOqlhUUOTBP4XZJjwvvlFdymaaSRSfZUtl4Oepq8urKlBPxxd663Px8761\r\nKvz3xynSK7mLHET+lx8W7WDDzwvXRsqrs86/a8gHFfi5zxHJ4/p4fq/TojXJ\r\n8MtZ2TItIfg8zvTUhfs20qTg/gNxe9THfF7WinmaDCLz6/jzCHx+jffempaP\r\nFLE70qLcg89/NtBGc40xCJugTIAm/jv/N9JUD17y0UXsbay/hzUYN5hCv7n0\r\nKXVLLj5vg+Hu+QrtFDl105CSZL0/5XugXIv9ji1cac407sfm7vWXmbj/2XXK\r\n+nz4/OXXxB4cxH5ptjrJYiPiv2rtUdqK+EttL0/EsN63vx+5swL+hve4Yqsx\r\n+GuF7dotB/4r17+Sfgr+XM1sDcK4v7Ixy5NF8fsFBye3LmP9vYv+kvvu+P3c\r\n8jkDxauw/8VtjuPE+by/xZm7zZom/BcWJTSw5v/Ql95anMdY6U8JmxGvqtjs\r\nrkD4xbkcSqMr8TxaaKRmE+5vzOg1+8t4nmFd5HAYzoPHc7GpA3ge3VR6bQrx\r\n63uK6xXieddMLhlM4Py5y133PIPPL5EUGC76i/109aL0SZyvWdMG1ypJmhQO\r\nru55Dx7rVwvlhLDeNx0dG+3D5+/we3vZBP1sS0/0Ln7U71uKRtRxzJ9+T3ND\r\nJ/DXWd29QRd+eO3ooa0NiPdQd9rMew6aaM373ZTOev8kr8R8ivtpLXc3jBc/\r\nz5NrnsGGebiNp3J1FrTfWudXMaPgp2uqrY3P178StNgnF/1Qm7sgFP89O+fC\r\nhuoP6LdJ5j/q8HlzBFYpsD2jiI40xz5z1n73ZMmwsg7mw4xxzhDuV+Muh/pL\r\nDNzn9uVvVPD76TxiCpOob2afJfs9xLeh+dlLrvU0SShVeBLCer+5RHj3zFmK\r\nqE1afPbE79fIZHQsSqMI/yLR/b3gN17ew/j1f/n3Bq7F78fVfO4eQf+74hLy\r\nQpjljza9EwnE/hb7JGuyFL9f8PPvsg5v3EcxckYV9c0r+bDCeSVNfhZfVOZE\r\nPOjuVQTzTnTu0rdH8HlKviqSJfA/Vq6KjlsRz5tDawx+n8R55bZ1qAZ/U64J\r\nS2HsS+07/3hcxOenuntlFsNPlQnc+82Lzy/l0TBUQ78J+Le6rxX1HSxwl3KG\r\nn+Y7dfSmLT4/qjNf7Tbug1mHIrUGn//p7hbOgxco8rNC7sxNfP42fUVdJdb3\r\nVfH5rYT19zfFmQZCJjRRzgrZ58t6vxlv+z4G51lXekdkF54/WxZoIIn+tWBX\r\nfDsHPl862mOXCvYn2ciMidus96v7my5XYV7bNSsYHWT9fTGHD+cb3I8VViGr\r\nxvC8g3MbVo2gP738kPvVCfFucjVWfKnEIN4OS1v68fyXUi2MtB4GaZ274Nv6\r\nvn7DYfVaVYYQg4R2L5/6DD3V1tDSJYPzedZqg+93/HxNurVGKkWKoxplBfpx\r\n/h65fipuY5BiZcPlhdA5R7e8HsS+YJT8ScVyoN9Q7pP3NVHc57T9j6eHoU1O\r\nTqpaaNMk7ve7kYjBfsOgOr/BO0MMcnhdZY/IUL+hvErwuqVOFFlftiCqHPqR\r\nvaD+6SFvcoL/2E67YfiRBTPC1FIGSa7S//wb2sny7t7+ONb+u+7k+ZF+w3V5\r\nEbsJ+A3tmVGU/YHz75lpuieaJgdaRSNfQZfKJyckNWJ/k/Bc6DaK8yxoW/TU\r\ngUHMHs8hXD8x/xs5bwu1ehMxtvCANOiLEZm6mgoUCeFR/qgzhv616MB3/QoG\r\nKaDXdrVBL1t18L2/PE2Cr28TC/qF+b8py1sijiYatLMT7zjuc9fZ1aLw61VX\r\nCzfeg15Rw5PxWZlJvp3XdTSewDzg2HI8Gn576aPxf0PQCyZ6RpIavQlH8P/b\r\nH0XOWaxm7Y+540tGIlGPELuJ9DKaIklFqomrUI/+k3P1agwoohG1VPk59GXv\r\nANczegyi1RaV7I56ZEuJzByimSTkAK8MO6seG9afvon+H8BhkXAd+sISlfXx\r\nx2kimms6ro16eG2qMm97wCRzL1p4v4eOF4opEYS/dvzVV0yhHn92l6Xnd3kT\r\nZw+jMW7wbxM8pVi9iyKLh12E06FfRs7YJbUzSEC4hqIR6rFr/7XTHEtpImLL\r\n79QMXefzeNPBWJrI34jeGYR6ZL/97h8K/9k/W2HOj3qs/mDLEbGGSXbQRbIP\r\noXN8qjQ2BVFEdZfxFzvUo33VrO6ZZ97EKvxL6g/oBetGR/71U0S4XME5BvXo\r\nSePQCMB5SJhrwLYW9fi50KvdFudve4TDo2fQdmf7t5ofxT4VPt/KBfX4HGY8\r\n90Itk2xPOFQzBd1HMt+2HGWQmVVCOYmoh7FVZchlAeq/+1H93/3YQkxmF3q5\r\noR7zZWT+sv49x6Jamdf/oM/e0E3wlUP/PHtfPek76+9FBBQ+Yv+YVH+wRw/1\r\n0IzZL3MZ+Ym8lb3eDD1o92ewDPuMszVfdwDqsSZJ+7xGOPoPD+ckP/i3eR7a\r\ndnyWSd4axSrkQP/2YsY9D2UQz/OfthqhHve1fobXLqaI+dLVBl3Q9bY7jr8T\r\nwX4ROqR9DPU4X/OvqO4wg5yRLeUUB//rXEGtlk3YLy0khgug7S6OsdWF0CQ6\r\n1OilFeoxt9dNfWsQTVYP057D0AfP+Gati2CSbtMlwmdQD9k5ome0uihSHrsq\r\nZh34S6WELhgs9yaFFbm8b6ANnjn7H4RffNt178o+1KP8xKRgGs67rE7BKBf4\r\nx1bHpuc50aSXz566Bv3s6N59XDHYn6cf1quDvyX3gQ86vDRZJCTI3QB95eql\r\nkqrPDOLTLB9Gox7pL7iF+HbDf8g6Ry0F74wBi5lPyE9waFnAA+gDa2ee5erC\r\nb90knhbgL1CxopO1Twaf3v8lBrwFynni3+QySQfHzyxZ8B5MnuO1FftodP4p\r\ns0rodr2qoIWYL4620T/dwPu8bLPLV3smIV+5MyegwwKNns5/AL6O05Lx4C28\r\n6+YtzSZvwnzslqEI3pPrE2dewK827qidqoWOO3o729SASVy77zt6gbes8BPV\r\nUYJ9dyf3Czbw1RQ9PnQc/eLV44bRFOh7Cl8sOcXg3xcvX6cN3lqWk1F7nzPI\r\n+wRXtWbon13f/XnFKHJHyV3uGHh7jqt0f+j1Jj2mc/SWg/fLPZkKedsZxCMh\r\nZ2UhtPS129ese5lk3odXi2zA2/z7lgxh8K6cduLphd4mfchwCvvcrSVur8LB\r\nu3FT6wK1cCZJXtZ8cSV4u1hQPXZiDHLaZ17jc+g2k4hRl2/e/92H0v/ugx65\r\nGBYtZwn+rR7BX3T7wOezWMcgtNwF25iOlRSpP/uvMBz1cEhlWx/3iiKO7c+N\r\n1qAejqmdf+W4mMRrNu/zK2ir9KXte+BnrIN+nXVDPd5q5lh0hmHfKXabYgd/\r\nA9m5cw3EMS+Tc2MTof/221+SK2YQvzYrEWXUo8dc4M9vRYqQXiH3d9Dnf+W/\r\nbuSgSLe5xhsP1KN2cUXNHhMG4Q86OsyDelhN+QuJFzOJvmm61m1o86oxDyPM\r\nS10/icPaqEfiw/Un/uL5r9wrg5uhTTu3BQ1jv12dXxYXgHowD4oOXhdlkLD0\r\n+P2CqMc6ZeE3b6u9idfuJFIMvXwVZ5M95tmqoBFN6zFWvRUzo/4wCNPep390\r\njPV+2PaiJvzk/U/1L86gHn+/zvVYeh7Pyz+dIIF6iPPt3lIvRxOvHQdWPYM2\r\nrAycyJ7LJPKFaowdqMf7rto88/PwXwWn2v5hXoSqCMQU3WWQfb4XVa6z7odg\r\neqSJDUXccjaEaoE/ezBvRdk2ijSpHio7BN4eCRcOVZ9jEmWN473LwFtAUNeb\r\nE37rRPOBkQfQTsraihmBNNFm7x/bwuKtbtPQdpJJbmvJ83RDT71/4OLXAb+Z\r\n7jt0ArwP5I2PfcJ9cI/bViMC3t53YuNN4ff8ZJafLYVemZe6YQ4fk3xX99/k\r\nAN4PnkgGyKyjyRKH2EXD0Jcqk69MI/9DuffTo8DbvCJDpWoDTSxOUzpy4O3H\r\nm5HJel++nHPB3UrW/Vhb+tPJlCIM049snuAtLO72s6remyT1jPhwgu/85dJ3\r\n10gwyLM1Q+U3ocVcMrWOPGMSq8GT8/R/sb7fXHm45RT85NOmPQ3QBZmTn8x8\r\nEM8b9Shf8Jbelu5blcMk03by93nB+620dc+0JYNstFjy7B60LNd22+C/3kTW\r\n+NXAGsUGw4cZwj189fZk+tC5nADwf5vK/bcD/q+hYu2DpeA/lLsqhV0J/TEx\r\n0W0Y/Fvvj713gJ/zWKOodwa8KV/xA9Xo/7POaRNy4Ds5Z83udvRrt41upxzB\r\n18z2/gqBX97EVk9TaAJ6eudT3xg9isx+/C2oAn73F6y42v4b/XZr0u1X0EXm\r\nx7fIn6ZJ83mPJXvBs2dp37Jj8KcpzXtvXAc/j72+4QbZmE+BBXkE/Op+5ha0\r\nop/7WzOng8Erd3inCsOdSdokpidXgM/wmvuZEhRNxC0bl+VCv1YMFxNFvIMG\r\nbUs2g1dsXnfSjh9MUsgmdfnUBOvfK93aY60Df52gprUKPC4GpS/N2cwgbz3i\r\nC19Czy55kdcqT5HBeFMbV5afoai0wAiKXHy3j7kBPJ6vqvO4in36SszNm1+g\r\npd7fty/APtga3ms6H/nzinySugl/TnhObs+EFrt+1PdTmzdpiBtmHEP+Hw+m\r\nr+DHeZ50DTu0jHWeuuKfr8X5Eqyd1M2HHm04Gqo4wyTR8g9LRsCj3uNoQd+U\r\nN+lcMb7lAnicctvT58mD+c5JhVaDxz3HrF0/MJ+eFi1cvg/5v7VSVPPF582q\r\nNz+Ygl51/dDt7zY0eRs/29+E/G8lF/rMtP6vX2b91y8VSPELi7kbWX4u2vC5\r\n4T/0J1dhRhf0voMtPMJSFKngkQs+Ah5ri+s37cP+zq1Zo7ES5+V77g0vn1EG\r\nuXB5OugJ9G6r5M8FE0xSzbPfdTv4TM/lDTiOeZ5/bvHhSeg5dsdFjXG/Os2J\r\nwXmcJ7bs15ec6hkkMJyHXRa8uB9XLptjhP3m/dLJSujCtB5OpUlv8lDJKc4V\r\n93VQ+bbjunUM4pTSupcdPA3jE8wG0+Hvjb+3JkIn6em5b8R5uOQVa6cMnnsF\r\npdMbIlGvm75sH6Avc+/05nvJJOb9F629wPfGqyIbJW0GcX+4xXYR+K7mXLx+\r\nDPf1xf1zX+5Bszls5zHZRJEPTxfPNQHv0qyj7Gu/MsjFzpr9fdAdQt0qH7FP\r\nXtJe5nsCvB9caPJMvAD+fD+DluP8PS5MFHJVQ33/LMovgq6uflpbIcIkkdLF\r\nnVtRD6GfMYkDGRS5/VcwcgL9km44ZC9XxSBn82yWxIH/ibVDfzJdKfJXRXOh\r\nEviPHzvzz2gzRSIjw+7S4L2U8+PA6+NM4lD7MpwHfLf8bdptYkmTaebnigzo\r\ngzcKVMWP0GRt05UAI/BW140+15bEJHbfSku/QDfamHab/aGI3RaF+kDwfsDj\r\ntMUE57X9mIXbUvA+uWt+J/dBnOf52tvuQysG6CxsmGIQRZeG4i3g7bT067Fl\r\n2G+X27/P64Z+cVVxuOgcTT5kiIeGgndn1CKZNWY0EX6+4rkYeCf6/P04vIRJ\r\ntDZ0eJax/EMNuWQFv25tGzPkCt6+UrmX72Be/dL4xjMNnTXydbCbC/PJf2HM\r\nZfC+zdFYGJTFJH6HOk6qg7dFjJHCFewLftKCi99A91Bat33gF01Xp1AHwPt4\r\n/7hOTjmT3Bl/r88J3jseHv08sI9BUoovaaZCa65Z9P30fPjVbtkRqffvDPk7\r\nnhp0K20jEmVWUV7gn8x+ODYW+6Wv2Wq9+eCvu/pB0oa18NOq7bPd4N+cQ495\r\nrsJ5LktZchy8q8Nz/hxH/xlRswsSB9+B9e8/5w4wyb7vIl5W4Jtt8r52lJ0i\r\ntXJKOYPQ7A4xk/fWUcRo1jFWDvzEooIN9vUxybotrWZPoMOZGzJmMO/VzzT2\r\nO4JnhEZv12HMgwo+bZc48Ot/aDJPF/v+lzDGDU3wmnp1pb0b/VIiKfY1E7ys\r\n8lvfqVgwCcc9h4OLwMfg8MrV/XtowpEr8DQNmjN0G1f4GZpIXzf7qQ9enZz9\r\n/D7w98uY6byHwaf47sdyZSuKOLRVdYiAh2LSxbA3uxnkZ5Zd/CPoSvUM132q\r\nFDkjYtRqBz7HV1Q8vxZMkVLPbF5l8Cjd4+XJep+2VHLZwXfQofPK9u92wXxT\r\nDZ78Bz4C1TG+H68g/wf6uingITq7iOd0szcRKtva5Y/8Z6tU0zgsWPPnpTgP\r\n8reSiA5dcpEmPpX7V2Sx9rU9/jtuLqLJPbfIwG/goSeXd+nwAoq8lL6rfRo8\r\nJuTN94ujfz6yjLZ+Ch6e07IhEtPYH4y8L+5A/lKi+kMvsf91XhZ2/QEt4bYh\r\n8P0O7IOcJ91qkX+cn7jK3Y7/zdMX/81TY0KRGrPtyN/PpNb77nuKZNtK2k9A\r\nfxZ8dSFTGn67K6zIC/mevvdKZgDz/H3Hg+AFyPffRPSI1hKaMNfHaWgj3wL5\r\nZXrZ8M8vZyQ+fIaONjp5LmQhRbQ2743LQf6/rbMoE+yL3Ycephgh33eWljtk\r\nj9HkRlLrISnkZ+a8alc69k/zV0uZf5DfV+FZmWPW6PcBlwTjWP5aUWN/FPK7\r\n4CBWII/65vN2n5snTCP63N/7kJ95/eLaTNTrL+OH+nzEfyn2/gvTSwyir1S/\r\nLQOaW8pm1R8TijyX1Rs3RH2zKQbbd2f0/2tam8UGWO/7b3itcabJXLMJkTJo\r\nEvAhsgTn0/Jfwbwo5CP0VE2np8GbpPIurXVDPi4Mi6dfNWnC42Th+RvafXTR\r\nJj3UU6Jo49t45Pdwkhi4r6XJr7fqP96hnsci1Wzc4U/O6ojx+yPf50J8W3pb\r\nvAl/+9vhbOQ7R1fi0YkG+M9dslGmyHcmaqpS4ixNslwSC1uhT/YU80p6gl9r\r\nlEUJ8tVpv17uMepNONI9+5SjPhlaMwOiDQKdSMP6dzUhyPfYsX82dZjf6/WU\r\nVoki37YzJw/ba1JkOL7MMw753T2Ro8OLejpfTU3eg/yMS1aySX/3Jk3b9CL+\r\nQY+5jfV7476U3E24rY385pc4XRjlQn42DrPvoftkX445RNEk7Mq0BoPl33/0\r\nbToOfgLefyvNkV+6aNXZRtzf0rhrRyURf1LsubjFB+F3vyccKGbtqy1Fmnkn\r\naFLQ6a9ki3qqicS/O/iVSZzirkueQ37Nx+l5Pqspki7b+KkO+UgGW75qx/7v\r\nvV783UbEL2zBrckH/yw+rVTbDZ16784Km800Wfd5++WlQ6x/j7gqJZiiiO7e\r\nKp88aHHd/ia5Tm8S6x0zGYH4b7C1hwi70uSnm0GDKOI3Sk+ZY4rz5fWreWYK\r\n9fLMMm7c3udN2Hj1dl9FPq8vH/YqwP6/p8TiYQPqddh2fq24KE2uyd9PZCCf\r\nwFDxQ6Kov/CHq3M4kU+RAUcPB+YFvfrwwS7ks73a6r7FF29S7Z49rot82Dvn\r\nHXHgZZCHNwXz2qDts5rGQnDfSqtLHQNRr8mNetWWdynS3m6jKIz+/KDg3w3+\r\nPgaR6RarKoX+pnB7IgV+8HSDuJkN8l8yosNtdRT5/9lfOga9b/CRnBnmtfbN\r\nyMtRuK/engFfm9oZZNKxb0wCPK4ErbwRhfpOm5wzrIA2D/kn0fwT/UrKO8gJ\r\n87H4q0ad9koGOaoWmzwD/XZUcrv3dSYxeXFWOR78OCd3733mAb+2/6XhWvA7\r\n1bNz906chxMGpkY10I+uzLA11jCJ85xZRXfw3E6Hc02aMcj24szN88FThDGf\r\nEYF9xsfxrFwW9LWh49L6Wti/v6UMEfANa/Edz3+HfDNnUrugFW/khMqo4H4O\r\nqlYdAe+zXs/6ncE7iWR48IH3KculkuVa6Kdv9vx5CF1f/U3bSpZJNHccvm4O\r\n/keOMHjL8igSLdnVMgp/YiiXs+Er/No1uwf/YsC/8amvjdoB7A8B6rby4O/D\r\nbiZ+Bv7NTW1euhd4HyiZSH0dxCT9wt8b5oBvoXDkL39TmhRpXcy5BX3KcSzf\r\nCf0sddOPfAPwTny8huEKP3dXh3NZI3SBRn/tfW4GaZRYUOkL3tsLeQ7/bfcm\r\n4mNVmQvBV7nMJNKT9e9h/1hoZkMX/BNRWT/EIDajp8bMwNu5rJwjShD+q8Fv\r\nbju0VsTEleXwJ7O37ZlHwbtNuz8qbAvm4e6huULgvfvmakpbjEk221maFUFv\r\nXcn1zcybIoZO37ucwHtN6vZ+wUpvcrP1q8M4tIrqj4ze35hfV64HXARvI7vB\r\n8fFkJuEiSyqUwDt5y6e5Ezhf3Q3r3Suh13ecbGH9+53O7XYue8A7rEjspngl\r\nk/x7uSpiFvrm1FLbbh8GsRrZPpoM/vI6/XnnFlNEzeXeYXfwrl9aZ9yYCz8W\r\nJXuSC7wTugOv2K+BHzzOadUO3idDNXzi4MdSIhynD7H897mxlzvgRzxSsouE\r\nwLN366qEFeNM0lM25bwZPF2e7pZv56YI7/Xs8V5or49jjwxkKLL/4vzXUuA1\r\ntyoo1rGdSZTehlwthWacWN7wDf3HLXxhky34Sal739wbQJP6dWk6seDF7axi\r\npv0R5yHydYIK+CxUXxjYh3428Vj8gSf4hAsPBAzoMcmlgIi8+eCxX8qh1wr9\r\nJMBNY/lNaEn5kqAS3IfHb/52bgCPlxF3xuznwO+kelQFsOaVFj1wwwH5c1zU\r\nXAEeMVeFBCWYDDLHMv9UIfSK+zZLzq6niKPrRmlr8IkYGvyQ60sRq8LanWvB\r\nQ4292LMT+2Zd/xvXN9D3bxnS6+GHeiOfWv8BHwuJ71dG4PcqT4kqJYHHNUXH\r\nxrbP3kTXmk2cZu0Xo5MDU8Y0YW/Z7zsH+b/XP93OEYd+VnGdKw163at02w8C\r\nuN9HxuzawaPslNWpTfwUKVwzXyUMPOwW66cF//AmF31FtR6Bh5qle0wx+lHg\r\ngqR39si/hsPE/EcMTew2a+cPQJcYft7pDj5NG4xFXk+w/vcVtl0I7/ImxzvW\r\nadkg3zsO0tLjLRQ5nLDy6ii02seYcy8lKRJ3V+emO/IrLl488hLzynzL/JK5\r\nyK8z5vW0zgqa/ODxXa2B/Pan3r6SiHpz+F0X+Qj9V+RajjzOg84rrp4M5CvJ\r\nW+f1EvNiSeD3aIMfrPtlOMSH+l+4scFHDPnoVK6M34D70BJrmDOBfLifa3R3\r\nwK/py+YzYxG/9DzxXivct3URH9JWoZ6Xz91iDknQ5Ohx34e7kA+9Y4QcPkWR\r\nngulZ7hY70s7Ou/8u4H7+0514y1ox+t/GiUssX976ujooZ6nx7fcDkb9r/Xt\r\nvCKI/BIPDXslONLkOV/unCJoy+CZbG+cx9oPcdPhyKdinlGVRKM3qbxRwe2M\r\nfAbi+eZ9Qj9c2DT46Cf03+bGoavY1yzzDpWcR35qrgFaCao0mdOXUvsG9Wv+\r\nPHFzlw5Fjhoe4mEi3z3XilMc0H/7uVwa05HvRJRrteAbJilbZf96I/K1toy+\r\nEXKaJqKLS3g/Q4u+cvyZj300jt9qbj7yVf15KNLntzfpbVIqP4T8ZPhOZTie\r\nocjcEwreK5Cf08KNiYkq8JO7DtrGIh+9A5+ujeD+tjHDLrggn4TPK8tkh7zJ\r\n8lclddPQO7863ZsxpkiLoWmbBvLh3au13BP+XfrdpHUN6/sNrVsShvD39y6p\r\nSHsgP/6wvrUhuzEPfJ3KjZFP6WkdiS+4n5Y73pSKIt6XocH9j+DfcpIKy/Og\r\nc8LFs3qxf1jzrZGwQv00+8o0+nqZhLt6V8sZ5MPgma/RjnhLqjSqqpHPOSNu\r\n/V3oR7MnDVfqI/7mU41hC1CP5ud9RV+hRzXWbvlqRZNTSikjCxF/U+HRprWB\r\nFHmsmbb3HnQypZZ2HP39wT89tTDEr23Z/k4Ufnz8a7usIOKvfJG0bwPO05HF\r\nps2/UJ/r8zteroSfG+VLdEhAPnJHmZmLl8E/tzUn1qE+fzxtLX/x00RxtO2T\r\nB6u/eMg2mqDe0Scf7ZyFpofLjSawL4vv0lVuQz5b88OWyMBfLhcVletDPv6k\r\nXbJAgiILDe8G7ET8XeItX+/j/P96sG7RWsQbyMU8HbIB86HSNCp5hPW/lyV4\r\n4DmNfst0OKCBeEPcFZZ9R/0CckadlyE+zUR+drc6+CPRlNVDiC8+TqQzXJ8m\r\ne7t0T4uwvu9ZKbn0nwJNSj9bqf3BvL0WaupLlzJI0NKfEldY33/GWWtT2ymi\r\nOLK+Sg3n5ch0dTsb/MiL0FuaixFf99c1dYI2NNFLk/icA+3RF3S/Mxj7+KGt\r\n7UdY76d2ZUicw37F+1o6ZBviLfBkm7qK/TU9uzcuAvHulm2WnyQ0uWJ1LO0a\r\n4mN78CRoqoBJ2h8+NN4AXr/fPrDVxnlg85ssroPeEnWlvMUf90lk5CrN4qUV\r\ns807iSK35sj/Xoj4OrwHrokpUGTVWI/sKcRz9Yi7Shp4dAroB9kinqm3xJ/z\r\njzfhjkn564LnF93u/XPEmybfj/Jl6YBXt4uMRQfOp0/v6vXLfrH+HrjXI/wA\r\nTc7/HffMYu37nwbOW+O+RTLj2I3Ab/bEWs2zv5nk6/zxtKeIJ7BkJkcfz5cV\r\niyxXx/P1X4h6cjNpYu+wI+ojtA2l6RqF/qHZonSDC/EY+aqaP4qmSEWr2+ZU\r\n6Os1L/WUWjG/5FLuBIPX3mTKdQH2qz+t0m8XId637BekxHGejKqV5HOhx4+r\r\nH43DvLpuLHalf5T171FWpD1gve+Xm/F4CZ437vQxIzlpsi1E124X4g/S0Dx/\r\nFefZp2d63jh0i4UGR+t2mggJV9fQA6zvI0J3LAEvx8AdWkvQvxtO1izqnUeT\r\nwb0FGw0QH8eDsI6y5Zj/p1Mj21j+/cPTjbtx/jWqn5EHiFcn9Z1C8VHW/Q89\r\nKQee63kmboyAZzF7txIbnlfkV+kuaE+THc8DKi5D+9pbfqvC/BFfOqTrhfsg\r\nZ6m88zP2gV9d+rkmqGdqwsbRj3spsjlET/UZ4lv82fJEF+pVvbaJ/zyen3Su\r\nnxmLfjvvS+byGTy/dq7plTb4zc4Hr/kaWd/XbQrf+3EVRRI1nokFIx7eK57T\r\ngdivr1z5bWnJen9bZ89lHI16ZLw+/xjPl6x59tNtwJt4TCt/lcDz9819uZMP\r\n/VjlLeeJKwOs93fMknehNPlSVZl9AM+/sZBZ793jTZJa/09RVx6P1fa9M5Qh\r\npAwp0q0oQyKRpLRTSTSSjGWWvOd9T/ESciuXkoQikZKpkAjhkhQiiUsoQ4ZK\r\nykwqUVJ9n/NHv9+fz6ez91rrOWuv/ax99quyDfzQg+ffXVjRgfUi31Rwp4VZ\r\nn1L9VRzEp+CS1LAH9i/lmn5tAh9KdWz95bBvWD99P/c4+kfbDtfLsL/ja/Or\r\n3/LoXzSOvx+AvXWxexXrN2N9Rgz8XQR7ohs1jzb2sQjV2vkwFPMbWq85moX6\r\nOtYdH7AE+RAefDN1P+xZvToq/xvxz1SVinmMeMVmdbsnwn5+7llVG+y/ws4B\r\nNh6wXxsnLfcZfJV9Kizuh/1Dbxfu9cR+s3+tDXs9c/4iPHTg3Tw2c552oBM4\r\noPKA22qM/zeD/5kn+Dkk6CFank6RnWsvZ8yHHoxep17i2sMmnPPZnCLgHebf\r\n7AxHOMRV90fJbsRj2mNmqn2CJv05kdafgCPXWWc9Q3/u+l/mlhDkW2P8lw+k\r\nj03uG1iw5RGvw0uT3nozisQG7OotBfYYCFVfDT2zU5Y7cAB8LxuX8XohwyZh\r\nf/fqTQFLJPR1ZsRySHVgx6tI5jzDnPtuBtZvy3v7IiXw0532z8vX0HtcMc3e\r\nGuA6+zqTdU0c8j5yzQ1H8HV52/BB271ssudBa+Us8JWYNEuwAf2gYaZAfRrw\r\nUJGkRrEmRSS+HXbQ/8KcV1MffZ+xCSUiubUbeKT7ovJ/qKellQYevkz9atG+\r\n8wj89rfydIuhXhyOqb9J6UG/5Ykk5AC3GX8bi1LlkHCvjqntE8zfl+vadvM+\r\nRQLWGAV/RD3es+eJql47myxXdDgeyuhxIa3p4+gP1lxZM7EC/GcZpKmpGjD6\r\nd8dSN/AdeTk44Jknh2iV+/nzgd+Pt988FIZ+vBLPWZIIbKY1z/v4Sejp77Lm\r\nG8E3b8A3G/lMDml3XVH6Alg7Va/SeQ6bxAj7baLBt9IFJ3Er9OMP1c7ung1+\r\nz7q7dCxwwf4/vj89Hdhvm0hFfy+bOOp1XTQE39niak8MoUfjoiqyu4CjT1iP\r\nMuddkks/vfcdY37vPvibB/VsQr0tXRp8P9HV17FfxiFN3QGF+cz3hyoXUUPo\r\n5/W28+0swLevS4ZEYwWL+Kw++Osz8MmcsVrPTxTJznDpjwDfUn8fl9K+yiG7\r\nUlY4qDHrOSvxy03kV3zWdvFK4CptHWkNYI3Ru8124FstPveFRQ2HqNx9rjwN\r\nHCL/OuKtN5vcEi7afZ05f9xqeTVqHkVK1A59dmTuM1z3XeJXQJG0TMXlvOD7\r\n4mOrGCclijQpRn/tAt9trNhV6XI0OTmkRR9nvh9KzVc1Qv1UMG+1mA8+e2z3\r\ncGu/c0h6qluLIfhs+aFsaSECvdV6JO4Doz8k0xYJYr/36XRw/Qt83XadLDDt\r\n5JCc0Odbi4BXCJ1xbz9FE2++27v3gb9o0V73V140sS1uzwgFX7rZqW660OOV\r\noZNz1cFPzJGnZBD1xaGxV+EwU//rPhka6XBIV2u8qQD48Jv4bMhjC32iu638\r\nBrCZ+MeUZNQ/ESdLGx3wce6pQE+1IPaDsmcKHuDD95cer5Ut6rvk5FtJ8BFX\r\noSnsz2WTcDnn6TzgzaPLB+TWU6T01OaqXeCn3uIfa10O1qutPZ8y+PBoeD0g\r\n44L9YE/6i2rg53SQZ7Iz8iH//fQ38LOw5krmdAZFgjmh6THgo6PKv0QY/c+u\r\nOMsHFOJ/M9M2wmsLTf65VriQj+l36vnF/dH/3CO6J5KBR/xIg/sCmhgJKVd2\r\ngQ9NbbnpNBnkx0qdzFPg4xBvUaXiMIv8DHx/pwh8qHL5o/mHOeQRJ5c2Q/xf\r\nvz7zOYN6KbrU2G4A+Kzm7d3q9sgX81SfKsRfsI8qP/YeeuFeZ/ZuxGvfXfcr\r\n9h1Fugvl9T8Cq+UdDX+B9+cxT0baCfFNGlzm+REIvcunbcWP+Oa2Hz79cCFN\r\ncsffJGky3+dG+/PzoVeTMm3KmoC3n1N6cHom8i3YPOIW4jU/0j3Aj/e7fDyI\r\nbyPiW/Gq5N9g7DfnUw4PLUQ8pVNyGoHVLKL42dJkHPEsqeEMhhvRZPJXxYIL\r\n8P+SZ2RaDvZ3v0Vq8svwPm0aeA7ZK6BfjmuacxDx/LXYzs/xPEU6UhZr8cJ/\r\nrtB0nE0am7QnvrufwNT3jobsPOi77+fXv16P91m5NuveQnP0S+Ejm6QRX5uR\r\n1NB/0AvJ3qF++cCy+2XZIfA3ooSXG4h4LnddP+jfyiJtgwtTrRDPpjvcDFN1\r\nmoTHbHQZY85DGtdvMYF+cVwtpRHO6BdxsYJVqP/hXs0bn+H9HQqwrLHdTBHu\r\n1rQzLMRbayvybA729wPzFY1vIt7qgp+NzlUcMjOEciNMPmeah6mdpUlzX3Vh\r\nC/BAkdKHk9Bbg+rZTrmIt/RHH5s7BT13+43W8X7m748YmsaHUYSdtFJMCvF9\r\naTRI/MKc91buqw5FPBbDUzxdWL8Jlp+EbRAPR7p/IB77TT6vD/cbcJWcqPgT\r\n+DcSmnBiDXO/qzCtTeEHh9yM2DFVAxxSLl6ofY4mlfPqrrogvinj/oSfTjT5\r\n7Rm8bgvi2frw62AH1mf0w3dWC+HvK3NJYw78dfGscssF1mtv7OFB/3wjPTDW\r\nhPk+UrfXbQny1e5DmW4w4rnW0GwSu5YiBrEf9KsRz7BKr4+8CkWMVF5U6cH/\r\n8aSNtwWhj4uVnqzsYs4b+Tj7jKHPc6wrrs1m6vkyJa+ZJyhy6i/JrjsjzN+/\r\nsgy984ZFHu+40nAK/gfYb+HGWqDeJKxukGLOW/bLXL6HfOKP9zf+zLyforsb\r\ng76iH5V82hTFnEfR/dUlYhRJGUsRrcP70fPymW03lybH9094uzJ60yaDv/Mi\r\nTbbZ1s6aBq55IjtO76GJl198WAdTX25fJ+LQu39vlK35gHiGrA9dObyEIsO3\r\nQgYs4b+ixLgy872t4Nq1YCX4u8khrq5cH3r5TKzWdfib+kallxf8nRz+3KUJ\r\nf8f00zsPQZ9T2YvbxOFfSv3c67cbWWTHqX+fDsK/By2/Q9Sw/+b4xfyWAb/t\r\nrK7ouxqoT0N5Xd+w3zpk2jvVlrHJjJ6k2Gj4E/hOZZ+LNUWuiOu4r0a+FG1Q\r\nGUs2oYiYktZrEfgnRwfEZqO/lBP+uSsDWKfyyrEZfui/nR5Z+TL8as0oHER/\r\nt0jCX3Yvc771iH5gsZQmJcqBwkEMv6+4aRe30oTPYduCOPjX+Mo4Zl0OhyhL\r\n17xfy/SPaifIAPq/+8aCznXAC/zdclKx3q4M3ZBgM+ftfs/vDd6AnluhHDcb\r\n/m0xrr+mupIi/JYV1wLgT+GMkCuRyOeU35lje5n7cUJCSX6/WER+th7XZozp\r\nf/voH2zo5VObFHXBFzvqtVQP8vO+MWkRhz3V1MBqHdTvHS0zpdKBuSsTatyR\r\n3y0zR303g7/y8vOKP6c4xK395qJH8CdxsvFMI9bT0YoFLpqwfyJqy4A+RROt\r\nkrUzXgAf1fV1nEB/7Siwfycv/Mlc9PZgdSRFAp8+f5wE3OkyuMwGfAl6TG7z\r\nZu5v5D3nCd5FE/94rpcI/F1+Scw0BvXD2qg2MRPYx/zi923CqJcvTAX6kZ/V\r\n3h/kpAUosnd9Zedj8HmsKdj75S8OudZt9sWWOe9SKn6kgXxWLhXO+8zsf/SR\r\nQAErmnw7mWrAhn9c5VulP7H+JFeebRNF/W64ODkcJ0KTrF0KJRuY/WnEeI7W\r\nQvR3jx3VOoEN2iZOK4lDD4fMG7wLfydWbqrMhN5Ii8n+pcB8P1qhVGlbyiI8\r\nLj/qf8KfWkPHJzWmNJG4HsSOhv2u8rJbytBH3mq74w5jPVwVS7xc7kER25n6\r\npluZ/oO3zcfOniJKPQvSHsG/VakRQbuR76FS28PDYL99xRzz4mYWOXd1qvQ7\r\n7AtOZ4yEQW+yNv0+/QJ89H0y7dBFfYhc9zHWC/7YWD1cpo713v1DbHgH7Dep\r\narQfgx4Oe6wy+gD277aotzmPskiDrMY/8rCfbKTAyltHEfHVb8ejYZ++GeY3\r\nin78Wq62ogujx3uqjjxFP6Irc6qbB3rw0RISkmJKkYRLs8xfwh+1GwcOOkFf\r\nyLk9N9kF+3J9ImUvkV/HNM50LWPOQ1ZVpdp704TXZ0PlJdjPup88VriMIiTa\r\nzKoP9jgp/jcioF9P+FpOFsCegsamkAnsx38v0bYJwfyeWSGTPXY0OZY0qrIY\r\n+dAvvbSlDvv5O9fUsGnEz9u8aO58PC8gNKc3HvYf3Zxhwugts6exUzSzvsLj\r\njIPBl4zoAple2Fdr1jptB/1hcnqBeDdzny/C+tR/SymS0a9cq4b5Wz7F08bn\r\naRI756TmOOqF/3Tk9sA6NpEI4jl3Ec+v9M5OHXWkSL9i8eRJPD9xbHA+nwlN\r\nVKdXFFfD3u0LDck/fNDvXfjF64bnZUMU3DWhf4wFPBwO4Pkc67HWEQ+aPAhW\r\nZKUw+3nzTP0E2PM/wS96n6n3x/x1JrUoclpOulqAuZ+aLZQbAv/PbuUNTwOm\r\npERbdefh/RxVERrF+OG9QkeuQe/lG9mtdAOf19cMh7Qx971iumSEkN/5m1W9\r\niiVoor6EN1sH/IYd7nBfivrrrPPGuxW4OWfOjZfCFCkWzN+QAb6H75YMnYH/\r\nsfGzvy4Gn/9eWjr1Efo8SlVF9Dvye3z0apA66qGK0YbYTcifHXmjUS1WFHmf\r\n2XTxPnP+YSAVpsCc3wwoBJzD/B9XD2k8ecki/tbudvV4Xxaa0b6O2qgH+iYR\r\nRzH/vA5n7wT0X56PN6psQzzLhx/nPUf9uXFoVfUCzC9b+y5kcg36n6nY1xcx\r\n/6ht7bQy6t2iMxIy9phfJsLnyslBFkkWT097Dv8lc9ac3wk+xTiqBkaYX900\r\nwLwN+cg3mSe7mLlPk9V5Xgj+5XdlHyeYr/IwbSuGejt9SGTLO+CXbv1G3J00\r\n+blz7WAO8z3jpVipGfrrxIIP0UGYP2z/2ln7wPfngLnUJOJ5bS2x+wH054ew\r\np+tYzH0pbnJaLupX9pRc0CDe5w9Fxyxe5OPoZoPbccD15iccXqHf9esQj5jL\r\n9Mt9jkO6ZjRZuaFgdQL4HT2jZVn8gEP03qvsF0f8fWGCN+asosgB3W2rKjBe\r\nbDJp9Loq+jPvCSkdjOf5+rW/kaZJoeiQ7STsB3BbTZ3202RgZ2/PW/gvECXa\r\nHTsf9euSmaAK+Mh8qdcyAj4SB53nx+H5VQOtCq5YT08nQt9QWB/c4LIln1wp\r\ncnahFfsXc19xbo+BOvR4omZUsh/Gl7RINT7qYZG92m+zdmN8YmdjczbW/+tQ\r\ntzXlGH+/0kz0YD+LXJ/nwvsK44Vdl15VQP1TdfQ0N8V4jb59rptRL802+wnF\r\n4Hk5daGK7ai3DSZ62Tz4d6EAkUUc1C9pvryPycAOZSIid9GPlc9wL+Ey33fT\r\nIkds4c+RlgMHhzBee2jGX8Gt//97gqhLPltNY9z/7/cGf/Cf/1/hD/7z+/U/\r\n+H+hweW+\r\n \"], {{{}, {\r\n EdgeForm[], \r\n Directive[\r\n Opacity[0.05], \r\n Hue[0.67, 0.6, 0.6]], \r\n GraphicsGroupBox[{\r\n PolygonBox[CompressedData[\"\r\n1:eJwl1nfYjnUYxvEH2XuTkD2yV1b23iTKnmWFMkr2SJTsVfauEClSSUOiUkaI\r\nllIhIQ0qUX0u/XEe5/d73e/xep/7/t2Xp0CvIe0GJ00kEknkctL/O2eKRCKX\r\nlOIV+VX9tws7dWX9hjyK17n2l0zktXgLPEYOyX1m2c1y4x2Shs+V1ma9+BW8\r\nDRfVm2UAnmt+Ei/EZ/AQfAeugCvhk/h1/Yhea3ZJ/8BX6z/5BHwXbo5z45XS\r\nlY/m3+pD/Gl9kO/W9/JsOhevjffKJL6d/64v8hd0an1Qz9GtdE/Xi+BN0j/m\r\n/Kw+wRfE38Tf1YN5SV2eV8SvyUi+hl/U3/NV+g/+gR7Pa+pmPBdeIV34Y/wT\r\n6ciz8pz4FUnFZ0tLsx58tnwvD5qVMCuHm8oo+Vg6mGcxz4HLShN5VA7IPa5l\r\ndi077i6z5DsZZF7cvAyugE/gnXqEXh0/E/cZX8XjcA3cOM4Q/hQv1531I2YH\r\n8Qz8EW6PM+FsuBb+Cr+nJ+qXzX7TF/jzOqWeJS1wN9cK443Sj8/kZ/RnfL4+\r\nzd/RA3kxXZqXx6/KcL6KX4ifi/urr/D9eiyvrhvxHHiZdOIj497jp/CH+E19\r\nN8+os/K78B6ZwLfxFPiT+Lt0c93VrFCcI3mAPx1nUQbworwUXhnnLd4ds2pm\r\nDfGIOBPSziyDWRbcRWbIN9LfvIj5HXhF3C8ZbVbVrAH+FW+J56mP6KX6Pj08\r\nzgJ+Eu/HbXF6nBnXxF/id/V4/VL8Hv0Tf04nj/dHmuHOrhWM5yP386f4D/o4\r\nn6dP8X64MC6Jy+EdMizOBP9Jf8uX61/5vjjn/E5dn2fDS+RePiw+sz7Ap+t9\r\nfJduw9PpTLwGfkfG8a38F32eb9C36I/1DN1Ud3K9QHwm6cuf5F/LA7wQL4GX\r\nxe+Id8esilk9/LC8L63N0ppljD0n0+Urud+8oHlxXFcekr3SyjyNeQa8RZLF\r\neZImsYPi2eOX8O36mN6g++hprn0pfXkBXgxfi7OMy+rPYlfph+P5xj2Kc4sv\r\nx3uNK+M68Tnwi3Fe9WH9rO6oh7r2EZ4W7x5uiVPj9Ph67CtcXX+h39Zj9Yuu\r\n/YjX46RxjqQx7mieHx/F63Vv/UTsI32Mz9Vf8D74dlwUl8GvyEN8CT8f54Yv\r\n1T/HvY69wSvp2jwLfkY68CH8Q/wE3oPf0C14Kp2Ob5Yk/ACfrhvpDmb58Drp\r\nxafyz6U3z8+L4Cv6rzirsTv0yzI07plrl2Qkr8hr4cGx56W5WUqztLFH5XE5\r\nKb3M85kXjj0Rezl2kzQzT2GeBm9KJG7+pztNGpq1p3nxWunJp8SO1Uf5HH2C\r\n98R5cSFcCm+TIfyZeDb663h39MU4f3oEr6Br8sx4sdzDB/FT+gM+NZ4xf103\r\n5cl1al4NvyVj+EZ+Lu4f/jfOTjxj3iB2YuwgvBXfptdIDzzZ/FM8O3Y0flv3\r\n4LfpgvxPvD32WLwDEl9GFsf7hJ/FF/B7sbd4eV2DX8ab473Xi6Q9Hmj+ljTh\r\nt/BUuCreLaP5C/wfmcrr83Z4khyX7mZ5zArg6rGbZbc0Nk9mnhI/Lzfi2ZrV\r\nM2uLJ8ox6WZ2a7y/+I8407Hz9PHYRfpBvSje5Ti/sU/xMFwOV8M/402xT/Qh\r\nvVDfrfu7th8/jt/EjXBS7KtZ4k78ecz1Y/q5xP/f387G2dHX+RRcN/YkzoNX\r\nS3c+gZ/WR/isOFu8K86N8+MSeIsMir8lnnm8u3FuYqfGHsRlcVWcAS+Qdrxf\r\n7NHYz3yK3sUb4iQ4Od4gf8tkszpmrfH4OB/SxSyXWb74bLGL452WBuaJ2OHx\r\nXkiV2LNxTqW+a//GM4odK+PkiHQ2yxnnEC+IdyJ2sVkZs8o4PZ4vbXnf2DN4\r\nMn4N18P/JLn5Tyaq6F0yKnZaPCd9Js62vhb7R0/itXVLfiteJd34WH4Yz8SH\r\n42zqTjyHzsOvxm7BxWM3y0A8P/ZRnGl8Du+JHc1L60qxf/DG2G96nrTBfcx3\r\nSl1+Q/4D9Bd4ag==\r\n \"]]}]}, {}, {\r\n EdgeForm[], \r\n Directive[\r\n Opacity[0.05], \r\n Hue[0.67, 0.6, 0.6]], \r\n GraphicsGroupBox[{\r\n PolygonBox[CompressedData[\"\r\n1:eJwl1nfcVnMcxvG78bT30iYVbTLae+89VTRQifZSaUgTUbRRKqloKomoRFFU\r\nCCkZIUlD2tv7+/LH9bo+1/U7z32fc+7z+56nUPd+rfomTyQSyShPikQiC+VM\r\nlUjkosw4B0+dlEh8T+VTJhIf0TT8trWbNFnuIHfEGR17Ud4p5+dLaDCeau0w\r\n9ZTLy8Xiexx7U94rl+BraRx+xdppGi43kGvitI49LW+RM/KZ9AgeaO1Tai7f\r\nKmfCHWgK/UiP6svp78Q1aAB9Qs30BeOzcPu4BjpEj+jv19+Bi+M1NFaeLx/E\r\nK/ApPAzXx9VxBvwyPSz3l3fgWXg7booL4Ay4HP6QnpffkpNc01H5XfmG/Duf\r\nJLfn7eR8eDENil7+Cr+OD8a95A/L9/GicjG8msbI8+Qf8HJ8Ev/Ch8r1eDU5\r\nje89Fb+jnJ6/RD1wP2sfUxM5f6zh7I5Nhb+j+/XX+Wb+HF9h/Q+8AV/HE3E7\r\n3Dbuib+7IO+Q8/IzfBEfyCda34cX4h9wD3wvLoJv4D3xe/GLfBUfzedaO4CX\r\n4RN4CK6Lq+KTcV9xOv43n8G7877xbMSzgrfhxjhfHIfvwx/Qs/LyuPd4Pb6G\r\nJ+C2uA3OE/ecBsgT5GSua6+8QD4gd8f34MJ4Dv1Ng3V1dFXwE7SVGuny6tLi\r\n1vQMfU/d9GX1t+PK9DhtoYb6PPo0OJvvTMLf0r3692kqXmbtanyW3EZuhdM7\r\n9rz8qZyb/8MX8v58vPXvqKt8t1wIZ3b8dfnLeOb5Bb6SP8VnxzniN/FxPAjX\r\nxpVwan93Qt4c18SP8+m8G+8Teyz2BP4IN8C5cWqc1d+lxPvpHv01volP4W9a\r\n/w2/g6/g8bg1bonP4U/wLfw0X8D78aetfUsPyXfJt+FZ9BcN1NXSVcSP0YdU\r\nX3eLLhVuQeNoPz2oL6O/FVeg3rSZ6ulz6ZPwUjoir5Mvx7nG98uteHM5F36N\r\n+spj5T2R8Tcxi3gXuTQvKBfFb9MoeWb8LngpPoZ/5gPkmjFvY7/iF6mr3Eve\r\nHnsWfxD7nNeVc/KUcor4Piqre48m4zf0v8Z8xZfiGvg4uSVvJqfzm5yVt8s5\r\n+av0BB5j7WvqLJeSC+BMjr0mfxH7lZ+PWcZH8pet/0n95RpyudgPsc/it+d/\r\n8Rf4Q7xnzBo8A7+P6+AcOAVOzr+mu3VX+UY+iS+JWRYzGV/EY3EL3BTnwK/Q\r\n4/Jo+cu4DvwV7oRL4vy4cMxwGiG/JB+lfnL1mG/xvqBNVFuXXZc85iE9FTOL\r\nHtCX0OeLGRLvC3qPaumz6ZPFnKFRtJc66ovHDIy9infHXo/ZTE/GrIoZSn3l\r\narG/cSr3+Hjs83hO+TE+jT8YM9/6RqopZ5UTMZPiOuku3RX+Lp/IF8ezFO8F\r\nfAGPwc1xI/wv/hhn56f4fN6Hj7T2RdxLvAd3wMWS/v+/4AreFXODn4v5w4fH\r\nvo89iN/Av8fMw1Vjf8c+xJti//A/+fO8C+9hbRueHueLa+As+KZ/RMrgDTRB\r\nXmTtJ7wKn8ejcTPcEI+I35na6+6MeYfLxkymDVRdn1l/w2c2kJ+Ma6N2+jti\r\nluAXYx/H3NVViWcOH4u9E/uJH+XP8c68m7X1VE3OJF+Pf5r4Piqtu8zX82f4\r\n6447jFfic/H84Ka4Pj6Dt+Fs/CSfxx/jw63txvPxbtwWF8W58GX8ecw3fjZm\r\nJR8W+ynmF16Cj+A+uHI8C7EX8cbYU/wP/izvxLta2xozBb+Dq+KM+JrrKYUv\r\nRc/H84XWU3oef4x5JZ+NZxs3wfVinuO51FseJiccu0ueJ++S2+AiMVfwtJhD\r\nMYt1lXRlYm7TOqqiy6C76hzqykPpc2qtL6zPgUvHnKa1VFmfPt4Tjs8ul6Iu\r\ntIYqWUsXM9ragnjWaaSusa4O/gdvxVn4CT6H9+JD4jvjevBnuBW+PX4nfAl/\r\nFu8H/i9fyofG8xzzyjV/Iy+Wf4l3B66IS8YankoPyJ3lG3yL/AJfLR/gFeW0\r\nMZudb0m8jp6WX4t57rMPyW/JZ+L+8RFyI15bzoxnU095sHwzzl2ew3fKh3hL\r\nuRDPKheMfUpD4rmO+Y4X4Z9jn/FecgVeIuYKnkId5U7yKqogp4n561xfjXsZ\r\n+0rXUFcr3g94Fj0qD5J3xvnhHfggbyHfxv8DtIGUAA==\r\n \"]]}]}, {}, {}, {}, {}, {}, {}}, {{}, {}, {\r\n Hue[0.67, 0.6, 0.6], \r\n Directive[\r\n RGBColor[0.24720000000000014`, 0.24, 0.6]], \r\n LineBox[CompressedData[\"\r\n1:eJwl1nfYiFUcxvFXJNolJBUqKg07JaMiiowQIjM7hRKRrUJlJKLSsBLtEhoo\r\nbRpWQ3soEdp7fu6rP2739/t7XK/nPc8551Khx8DWVxQqKCjYs1dBQfpvf5wt\r\nK3FPaWV+K99fHsB7dE3zU/Ag/IL+ms/W7/OZ+DL8MD5BnsC/6LLmpXBHvEZv\r\n5FPTfBTugufhI6Q5b8DH43X6D75Af8W/1ffx4fpZfprAgn/0OfIUnmDwMu6F\r\nL8Qz8QFSi5/KB+MdeJYcKaXNOpltwqOlhRSWf80aytO4t5wmR0kRyT/ayLNn\r\nYB+pLUfL4eaXmG/GY6SlnGU2wexPvFj2lkJm55o9i6/Dr+CPdV/eWs/iB8rp\r\nvAq/Eu/Ec/AH+Gt9Gx+gH+EnSjlehnfGW/A0vAl/rsfyrnp+voW04mfz6/Bf\r\neCHejr/T9/MRehV/X9fWRfMr48Z4Fb4ev4r74TZ5F7xBH6Qf1N/qMzyriq/C\r\n3+Db8Yd4Nr4cP4rf0ZX1Mv2rLu/ZEbgLfhuPyzeUc8yuN/sbL5F98o3Mmpit\r\nxv2ljlSQsuZd87Px+KynNDS7wewfvFSu5auzvlIs35Sfl72Z/Stt+Wx+sDyE\r\nv9NnmlfDQ/CLehe/Q3/E5+Ar8GP4JHkS/6aPyR7D3fBz+l0+XW/mE3A3vAAf\r\nKY/iH3Ub80Z4Il6v/+WLcs5yBvFIvCbrK8Wzn/j52af6OX6Dfo1/ogfwi/Qc\r\nfojU5dX51fglvZvfqT/OmdC384H6cX6yHJs9z7vj9/AteAv+InuHd9cL+VHS\r\nlp/LJ+UiyT5Q+0pRs6b8+Xx3qSfH5byY9zDfmv2U95T98m3Nm5mvzZpKfalh\r\nNtRsT9ZcBvEn+CmyHP+uf9YVPSunL83ezVpID76IHy3teGM+Gb+eOy/f12x/\r\nKcYvyJnWL/CJeh0fiNtlbfCh0oDX5MPwy9nrfK7+JGdU38kH62X8VKnEy/Oe\r\n+AM8A7+Nt+Ub80tzp+XM6nK6vVkTfGPuNrkP79APm4/KN87P0XVy3+m/cr95\r\nVhw3z97Ek/B6PAi3x3fgjbpEfo7+Xp/lWS18Tc49vgt/iufiK/GT+F1dRa/I\r\nPayPzxnDvfCH+XekJ1+c86rL68f0T7qDZ+fhm3BheYQfmD1h1iL7L+uUe0hO\r\nkGPMe5t/hCfLxXJQ9oR5y6x13it3Qe5is+Fm3+e95UQ51qxP7lF8o/TKXcYr\r\nSEd+Pr8Zv6GL6MV6Z35G7iLPR+vnc85z7rMneKvc0bmf8076df5p7jTeId+a\r\nHyYNeW0+Ar+if+B3689y9+m7+VV6Oa8qlXMGeN+cU3wrfgd/mfXivfWS3B/S\r\niTflU/Decj/+Rv+Q+8azMXptvoeum3NudgC+EL+atcBv4CFZUzwXb9Il803y\r\nrrqRZ6fja/GP+B45SSqa9cvvjG+WS+TQfEfz1uav4atz7uUMs5FmP+F75WSp\r\nZNbf7DM8RfrwpblXpDNvxqfiN3VR/bjZ2Jw/XE9KZA/wNnhVziO/Sb/Jh+KO\r\n+C5cShrzOnxUfm/9c34P/TnfpefxIXoFr5a7gx/PL8vdlL/HZ+aO5l/lvXhf\r\n/QA/TrrwC/g0vI8swbuyXrmLPBunX8z+1fWzL8wOxm3x+qwffgsPw52yJ/Bm\r\nXVo3MTsTj8a/ZP3wF3h+1hevzP2rq+dOyXnBA3IP42nSVUrKIeYX5W7D1+T8\r\nSRUple/mWbvsfzw850Gq5uyYX577CE+XbtLcbLpZMVnGS0sJs/b5VnhE9gK/\r\nhx8uTXldPiZ7Qv/K5+ltfLdewIfqp3iNrD+vzPOfz7X6Sz5Lv8e361t4P/0g\r\nryjdeYvM8Vu6uF6qd2e/5a7yfLx+Kfdz3okfxjvg1Vn37D+9IXsx+5x31vfy\r\nMtKM1+Nj8W94ft6p0P//L17Ih+mn+VZdU1fP+cADs1fwbXgrnoH744dwpezn\r\n7EPdw7wlnoH3leW8TL6Z2cV8Ax6Z/SX1zcaZ/Y4X5TvyZ3gtWYn/zB7RNXLG\r\n9H+6xHgr\r\n \"]]}, {\r\n Hue[0.9060679774997897, 0.6, 0.6], \r\n Directive[\r\n RGBColor[0.24720000000000014`, 0.24, 0.6], \r\n Dashing[{0, Small}]], \r\n LineBox[CompressedData[\"\r\n1:eJwl1XccjfUbxvFjr8y0JFmhLRooZEUKEUpTIUqhkEppokFSycwMGVFWu2hv\r\n7ZSGSlvSFEq/9/X6/XG9rs91388553m+z/d7n1oXDu42qEihUNinWKFQiWqW\r\nKBROK14ofMJfkifzl+Wh+CJ8H65AreWT5avxNnw/bS9aKJRWa6K2TD6besm3\r\nyUXoELmJPAB/zr+Q5/J35XF4OJ6Pa1BluZbcFW/MPchT+Cvyf3yY3J9PlitS\r\nG7mjfA3+kv8qL+Eb5WIlC4WZ8k3yCvlQ+tu9lpGb4g18uf4E/qy8m58jn8Vv\r\nl4vmM3JT+WK8Cc/D76Xnu8fLV8oL5N/4gfwV/jevolcbd0sNT8Wv4uF4AJ6C\r\nt/BKfC3fxtvqnYJH5vvwLNrhfsuqNVN7WD6XDqM9aadeOb3j9R6Rz6PDqSrV\r\nUT9d/dXcI7WjXa7fQ/0E9RXy+XQENVO7JOuH76S9qK5ad7XX8DT8Gi545hHy\r\nxfLUvCs6ST5Vvhb/jpfiT3Fx186Wb5ZXZt35Yfwf91AeN8cr9e/Ca3Hv7Bt8\r\nB/6GF+OP8u/4kXrH44H4K/wAfh9PwCPwwvw2r5nn5Tv43noH4R74dTwdv46v\r\nwpfgafhnXoWvy77h7fU64evwH/gh/Bmeg2/Bq/AOfjh/mxfoX89TgbdQW+W6\r\nC+gceZz8LS/OH+Pf84Z6J+BL8dd59mL/P3/11HqqvYGvpg602/dWVG+pvlq+\r\nkI6ifam++hnqb+Jrch6ps9ootT/xMvw5notH49X4iJwf31lJPhGv0ZuI1+E+\r\n2Vd4PP6Ol+CP8x94I73m+DK8Gc/HH+CJ+Cr8YNaK18pe4Tv5fnoN8Jn4LTwD\r\nv4FH4oF4Ot7K9+TP8d94R70u+Hr8F16eOYHn4TF4Dd7Jj+Tv8CJZf73KvFX2\r\nCu6bMyDfKX/PS/In+I+8pP3YWL+FPCh7DN+d9ZYXybWzT/AuXk39YNwLr8fX\r\n5lxSEaqi3jrvFPejo2l/OkT9rOwLfF3OBBXNOVVvk/XMHKVjqKXa4OwPfE/e\r\nobxYrkPV5UPls/Ocma/4TTwKX4pn4KrUST5NvgFvxw/jTfgBPBY/infxhvxd\r\nXjRnKrOBt8265Pnxc7h/ZgGegH/gpfiT/Cd+rN6JeEj2Br6XRspLstd43exb\r\n/k/+H6zxAZlPmaP5XXw9XSbfL+9Fz+PfeVnXdtbrKt+Yc525KT/Cv5Tn41vx\r\nY/goei/3n/OU+cTbqX3Mn8wa8uflAbg3vguXpuPkVvLl+IucQXkB/1CelPeK\r\nl+KDqEZmp3wu/jQzXp7J35JvwIPwzMwV6iJ3k2/KOc68kVfwr+QFuATtLZ8k\r\nP5V5SU3owMxb9fPU38c35h1SycwB9fbqT2c+UVNqrXZF3gm+j2rSkWrnq32A\r\nb6LB8iz5F74Pf4H/wbvqnY5vzrnBK/HXeCG+DT+eWcwb5V6yrlTZOymVGYM7\r\nqD+T941fwAMz2/BE/CMvk2fjW3gpn2um30Yemj5eiD/Ck3Me8EM517xe5lbm\r\nJq/oc7X0G8q95Q/zf0FD5NnyNr4vf5H/ycu5vpt+d/mW7G/8IN0uPyE3zrpk\r\nfmWuu7a03n74ZPVnc37yP0K1M0vVL1D/KLM9a0VlqJp6R/W12beZ19RWbZja\r\nT3gK1aFGaheqbcCz8HpcxG+Oli+X52QOUne5hzw6641X4c14Eb4j+xcfnfOQ\r\nOSKfgtfhSfhFPCizH9+d3+dls0f4z7y5Xjs8HG/JWuANeCoehZdlNvD6mcN8\r\nN6+r1xj3yfnBs/HbeAy+As/Fv/Jq/CX+F9/Dc/XQ7ymPkf/Fq/E3eDEeh59K\r\nnR+T95jZm/nuc+X0q+NTM+uzX6mPfE/eZ/YY3prz6toWeifJV8qb8ozyIv6x\r\nPC2zBC/HDXJmM3vlvvgz/ok8h78jj8VD8Ty8P/WUz5DH4s1ZB3kN/1Yu4XeX\r\nyOPlpzPv8rzyAXKnzKucPfwSHoL74ntzDbWU28sj8Fa8OPeBp+Mb8MP4YKqX\r\nuS/3wxsz13I/VJ5qqHfOuc2+yayl+nSs+kWZRTmvdCZVyAxR75IzkfdF/eRJ\r\ncvnscfwLL+OZWul1kK/KbMAzMm/kR+RDaD3+j1dybQO94+T+WcucJxomPyBX\r\np5fx9vyGa3vlXuRb5f/wUrpTfibzNucp/x9U1bUV9f4HQ42TxQ==\r\n \"]]}}}], {GridLines -> Dynamic[\r\n Join[{{{3605299200, \r\n GrayLevel[0.9]}, {3607891200, \r\n GrayLevel[0.9]}, {3610569600, \r\n GrayLevel[0.9]}, {3613161600, \r\n GrayLevel[0.9]}, {3615840000, \r\n GrayLevel[0.9]}, {3618518400, \r\n GrayLevel[0.9]}}, {210, 220, 230, 240, 250, 260}}, \r\n Replace[\r\n MousePosition[{\"Graphics\", Graphics}, None], {\r\n None -> {{}, {}}, {\r\n Pattern[CalculateUtilities`GraphicsUtilities`Private`x$, \r\n Blank[]], \r\n Pattern[CalculateUtilities`GraphicsUtilities`Private`y$, \r\n Blank[]]} :> {{{\r\n CalculateUtilities`GraphicsUtilities`Private`x$, \r\n GrayLevel[0.7]}}, {{\r\n CalculateUtilities`GraphicsUtilities`Private`y$, \r\n GrayLevel[0.7]}}}}], 2]], Epilog -> {{\r\n Directive[\r\n AbsoluteThickness[0.5], \r\n RGBColor[1, 0, 0]], \r\n \r\n LineBox[{{3611188800, 212.72879241512837`}, {\r\n 3611188800, 257.21097084166985`}}], {\r\n CapForm[None], {\r\n GrayLevel[1], \r\n PolygonBox[{\r\n Offset[{-4.6, -4.25}, \r\n Scaled[{0, 0.08}]], \r\n Offset[{-4.6, -0.34999999999999987`}, \r\n Scaled[{0, 0.08}]], \r\n Offset[{4.6, 4.25}, \r\n Scaled[{0, 0.08}]], \r\n Offset[{4.6, 0.34999999999999987`}, \r\n Scaled[{0, 0.08}]]}]}, {\r\n AbsoluteThickness[1], \r\n GrayLevel[0], \r\n LineBox[{{\r\n Offset[{-4.6, -4.25}, \r\n Scaled[{0, 0.08}]], \r\n Offset[{4.6, 0.34999999999999987`}, \r\n Scaled[{0, 0.08}]]}, {\r\n Offset[{-4.6, -0.34999999999999987`}, \r\n Scaled[{0, 0.08}]], \r\n Offset[{4.6, 4.25}, \r\n Scaled[{0, 0.08}]]}}]}}}, \r\n DynamicBox[\r\n Typeset`ToBoxes[\r\n \r\n DynamicModule[{\r\n CalculateUtilities`GraphicsUtilities`Private`pt = (\r\n NearestFunction[1, {1541, 1}, 3, CompressedData[\"\r\n1:eJwl2nc41t//B3AjQshKdjbZO1lRZIayV0kI2clKSkZKJDIiq0QhK0miRCER\r\n4SNlZCWUmZXE7/n+/v5wPf64Xec8X6/zHufc183n5HPChYyEhIQUfxSUJCRz\r\n2jQj8/0zWrnhYypL8ERNbcoyrBY/Z/gHXmZqryb7MqMlZ5TPSAEnosM8d0K9\r\nPxL8tHBDjuISPSzxHPrMABlG4uP3wEZ216m9MMBM4wgHFI5nzeaC/c1z6zzw\r\nBkmLGR9UU8kpFYC5T0ycReGJHyKvxeAOPhIOSeh2p7xTFnJ8jBVTgO07T0cr\r\nQdmLjKqqRJ6q6RR1mDr3ZuEQkUs0w/Awkeu0f4E2kSvTgFQXnvyP316fyKXX\r\nw2hM5Lpa7GlK5KqLbDlB5JFWuGRFzM+aMuVIzG/qdeQMrL6uk+1C5Gji/nOW\r\nyPFvxcyDyKH0sdQThvsWUPtAmaJwZz84Pm75+jyRh1uaI5DIY7XzQjCRo+25\r\n2CVi3gq21BiYJFEgcB2WFcpXxMGZLOP2REjFPmiTDIXuuP9IgY43osgyiXko\r\nmBKzYOaVHO5c2BdYq/wQGp5Z8C4j8g1f2qyAMTa7blTBBhPhhy+gkpr9QBPk\r\n39Oq2w81Ey3++woddo07DcF00q1LY5BuTr7qF1xvzuEl/Tqj1Rkc9Gc/pH/w\r\nzE4CGnf8rpeCH/l8r8rD9ja3XeqwlcuW2xQ2NqhpBcJqKrLrjTCmXvfbW2jh\r\nH6/YApcH2MY+QLkyadX/YKmFw+wPWHC/5jjdwIxWoNVW4W6oQ6u9xQgnLnQW\r\nsUJ+/UlyXpg9z1wtB73zbWgVobpNjtMBONgotlsNcqRquenANDUfDmvYLefx\r\nwBbS7neRcIBX99hpOMH6XZYtznCd9LjpWSi/bvjFnRh37qiTJ3w8ofXTm5j/\r\nq1qAH7RpkYsJhNq5PEVX4OVUdvlIWHuTpS4ayoTQfLwBz/lQWMXDAheSkVtw\r\nxO6vWxLkPLG6eAda6i2GpsFEjV/kGZBSfGxPDlwi/3jwMZTcaG0shm4LTYal\r\ncHjwhcNTyN5TNfkMmr8v86mBCa+L1mvh+2cPI+rhjpJcmgaocT8zuRFWJdx+\r\n2AJzz156/wkOOASf6IWs5ucH+uBNTffZAdii5Bw4DMkkT22PQDUB29hxGMRu\r\nwTgJK3ebZkzBXxSGAj+hyKZOySx0WtJUXIDGHyRsNmCxb3/1JqRijWLZho2O\r\nA53kgzNa+yivSVLCsGK5OCqotHr9KB1MzlTM3w0XNEdJmeCxyZunWGBRnHI9\r\nK9wpO8HBDp37bgVzEuPw/ZDnJcZpTrrND7+e05gXhHeqU4r2w0U7LSoJaEw6\r\n6yIFqYy0+eShy+J8uCJsTM0cPECMo6arokKMM7qUpga/xGSvaBC5JAzMtIg8\r\ngXn0R4k8XMc89Yg8b9bfGxA5aE2jTWB/3tZfa9jQbjd9DnL779T1hqF7n+b7\r\nQgUnGscL8NFaTV84vM3P+vY2tKUOMr8D+Rc+T6TCyvq7FPdgrzW3bgHce0uw\r\nrRZm/ZXrGoeuY8mOk1Dq/fLCFHyVWs04B0dkVczWoYCbVh/tENbF+L7rblil\r\nSL7GCLXJ3+3dC12z9Wz4oFT042kBuHaOJlQYxh5szxCHj3tNBhUh2dEaR2Vo\r\n+5z3uwqkyVicPQQ9TyVv68O3XX8jjSDXYWcqE9ghqMhoDoVTs1IsYfhOSg4b\r\nYp6ZPv6TMMbuUKEjHG4vFD8DlTQYyl3grbJgBTc4xTta4wE1k/TVveBCAMdR\r\nf6g3ebUtAOZa/TQOgsdV6qzCYFGx4GA4kZM73jECVm47uMcQOf2aZ2Oh05iU\r\nfxysNUtbjYfM77ZDE4n8Sm7bSUT+wq7IFBhwI+9mBmz/S82YBQW9/FNy4H8m\r\nR7LzifxvivkLifxyLIWPidx7vpeVwoSYYwoVcHLtWc1TqOHOo14N077GvKkh\r\n8hvO67wk8tdbtdXD9RzRnkZoynjb6h3R56t/BlqI/rq0TbTDl2Keq33E+IbR\r\nJl9g+bnsRwNQ7OZz0mGYX9JlOwJ5OqafjsG7s2R03yELPZfrDyKPlOLraUhl\r\nYsz2C0b6nPWbg8HldwV+E/2Q27q2CQdP7B3dglbnZVRIh/EcTNZPJodGVU6/\r\nKGBz70UdKqi1ciebBtbtKV2jhUpKLaa7YbnlyGNGKB70h4wF8taIP2ODNCqJ\r\n7PwwyvaxvyDcDm38IAyXXy5fEofeg3SfJeH0prCMDHTm1rwuB4fVbcYUoPVJ\r\nf9UDsCc87s5B2Pq6/qgGrNTiL9aFEk6qOwxg4VVzByN4rylm93EYo/PzvC20\r\n0a9S84IaxVdbfaAg3XFzf7jQNXsuCMZai2RGwOqzGX9SIHPMlepXcP2H8eE3\r\nRA597o9NsIiu9nsrPJzym6UH+ua7nv8BOxqNZBi+4bro+ZDIBIcmDBZZ4Cyl\r\nfiU7pDPUURCAx3rUlZWgxURdujJ0WFH9owK99qrUHoLxdkpq+jDF89k9Q5h1\r\nSeHfMfgkR+7VCfisvILHAta/kblsBd91l32zgR3jUpr2xPzLT3JPEvNTSJKe\r\nJuYXEW90Ieb3FNH2gXsuFeT7Qe4EIYoAKFku0BxM5Frep3eVyEWR8yiKyMXK\r\nQ30NuohkuV8n8ilztcUR+cLYjFKI+XYwmj6Czrlp+UVwU5XnTwm88zn/WBmU\r\nOC9+vwK+pa9cfQrti5QNq+HNUZ3lWih4qV2vHtaxmWW9hr9MHI++hUavQtM7\r\n4IQN6WwnDFu5ptUNWW7Tp/bCEomUmT6o3cp56AscPHM/eQAGbItODcFdmWVq\r\nI/C+ktLtMajSXfd9AnpQtyVMw7agiZEl6MR8TnEFbpQuXl+DYpNbcpuwMSL6\r\n2ha05aYdJBnB+7UmSYYcXjdnj6aAvAs5X3bCmjhhKRpoKvLkKi2capT/TA/1\r\nZI33s8GR9t5LHDDYza6bCz7KcbvIBzVV5zsFYH/fBUFhSEUf2SEGcx9T80tC\r\nZZ3EQGnYNcL6QRa6hWXtU4AkbIIBSjD9aVGrMmyZee6nDttafq8fgh/zpa8c\r\nhr0nCxN04WfV8T0G8CvbviwjIk93avFxOF7WLWcOJ2/S11rCGXcDLRs4ezSm\r\n1Q4uCDSanITLJFt9jnCj9sJ3F/gvrcLTjchxYfa3B9wp7ULmC2lo8677Q/rp\r\nQYYLkOWB+b5QuPdKYkEY5HBol7wMeVSonkVAvr3aalFQcPlyUwwU/fTS4DqU\r\nipO3SYCybj4jiVBBp/hsMlTd5g9MJ/p6nin5PjQ0NeZ4CI0lb+QVwhM0zaJF\r\n0OIHaXkJtH6rfqAM2ueFvKqATnaL7dXQRVnS/AXRzz3uAy+hT+fIdAMMO9JF\r\n+QGmipdpfoN1zzPvjcLRI7Hr41DC/nT5FGy8ycy7RPRpNmh7xyiuv3LNV2LQ\r\nQ02SQxLeamUPlIZfR5YkFaAP48MsdZjhT33JFC4qdKsGwqtkAW3BkKlrj81F\r\nqHDOJvAKDM4bKb8Bt+jmhXKI8QYSq/Ig72O5I/lQSzvQ8TGMCv2X8RTS/NjF\r\n0Aozq55kt0GJqyaSHfAYd7JBN0w044gehHx8dczfYOWcw/1R2HM97/UkZG0Q\r\n3ViAhfFtsb+hsp3n3lXYKkpfsA5tVssU/sKZpuNN/2Do7d/HScZwf51KGSGD\r\n9yQO+FCMEfvO/n874auW0Js08JvTq8e7If9dnQl2eHhxzpULntFPn+aBUXla\r\nnnww/8/MnAB8d/yOnzCcfKy+LAopyX4EikMR28Q/klCv8mCYDHSjGd+Sg0W1\r\nijuUoQTnAP1heOx81G1t6P1BkkUXJgh8TtWHZRevsBvBrp7994zhgngPz3HI\r\nGBWWZwblBoUELeEJhc4Ca3j+ZvB+O1il9kHKER7I8j3oAa1X2Os8YfCxJg0f\r\nWPtvj3YA/GrxujkQ/n3iph8CuSiZ2i9CtZMvjcOhQ7XzpyswnJ7ePBK+fuVo\r\nE0v0Yx+lcxJ0CiqbvAMjO63d0+Dby8Xe9+D3z+aL2UQfZLbO50Hh2MLVB1B3\r\nxDSkgOiD8sbfRzA28UF4MXw8ZURaCts0VyPLoVFeZkItvPVo5Xsd7C4zUX9N\r\n1PGK/FcTzHzncKR5jNhnPc9oJdZl4Jx+BywYe5fbCaem961/guKLISa9RF/X\r\newr6YMW25FY/XKaMtRiAoXvUdozAeq5UuzFIIrhQOTFG7IPyT0/D2ya0r5fg\r\no+uDIRTjM1o/E5U+7YRS6YmiNLCqQPszPXzdVKLABvv+hc2LQXJ/bhdTWFkr\r\nMX8COpKrhVjAuju28bYw4HnaM2c4uclIGQLv6PAlXoSHE2Q4wmHOPhOpSGh9\r\n+KZlPHx/jbIwDwZ37ZHNh8LsQi8L4NWiI53FUKXjytozOLUnMaIGpp7M2fUS\r\n/p6v39cAS5j+6rZBWzua7nZIlc9u3wmrf4lOfoIuisq+vZDH+kL6MGzPjeIf\r\nhaHTySXjRF2hlQ1T8FbW/NQSUU9Kme4KlIn3KViDJNHSFBuwK2z+zCbMDShr\r\n3IJ+nj58pBN4TtjPD1PAMbMydSr41NDnHg00V5232Q1TOOZ72aArU5k8J1Si\r\n8UniniDuI+nFfbDvz5wJPyxYLC0VhEHT3nQiUG9UynM/ZPsy1yYOp7pK90vB\r\nF63esTLQtmZORxFmps01aEDPW6X7tKDaNe/wI5D2stSQDhwMnFPVgyXepRkG\r\n8JKr9x8jaHxSytoE8ljOVR+Hc8dK95jD1zreAZbQUXFO1g7mscyVOEN/2tJd\r\nZ+HhHd4e7kS9v2dFvGHlzycxvjBy3Ou7P1H3gKT2BSjYM3s/CC63PSENhe8a\r\nvRzDYGqt5Otwoh+Vs9wRsPD2bPoNYrw2J7F4Is+O/pe3iP8LbBy+M0HcHwd8\r\n0yDddAlpBoyySxPMgQ13aKvz4GZHhG4+VN651l8Az2t6ejyGTkJa5U9h9slq\r\nrWr4NU28pwYep2FdrYc3j8Rda4CtYSTsTVBzfka1FYaJOna0wZrT/53sIPJn\r\nGCx0Qune1xHdRL4Xd1oGif4vUdt8I3KKX54ZJfJlu9P9IPJc1TBbJOYzmhqm\r\n+I71H1FdlYKO+TUXZaGEmyKpAnw7L0V7EC5t8fEfgcbcVMZWkMq29+FlGNbj\r\nadEFPY5mlHVD6xct1P9B+Rz+V1/gjEe/8Di0IdNeX4FKspyZnJPoe77eCjdk\r\n2htowgtnN7vIhWB+a4ynFGR2XFLXgiQ9+9KPwDmdY0s6sE38UYEBvLrmsNsc\r\nLiS8H3GF+kdKvNzh/bWEjXPQ3NGcxQ++kP2me5GYZ/JN7yXomZF/+grkIfe4\r\nGE2M07tcegsOxH5WTYIK6rWtd2D84j2LNDj58PLYXXjI1snnHkyn19nMhkuN\r\nItfzoGEQDWs+kVt89n4B3PrWKf0Yluul6JdCFg7eSzXQ6yMZzUvYfPV7aj3c\r\nd6BVoAEG/ywqb4SfcuLV30Exc9+2FhhFZWbVBofqFCfaoZIfm18nTBT6++/T\r\nJPGcatj7GRacMjQchdvMUv3j0LqVwWUSVob9XpyCu2T7wn9C5+81u+bgq7uZ\r\n6Qtwr3G40G/oS3a6cgW+rz5yaB3ynxNu34C9PT+/b8ODDwPZaX7gOUtFc5EW\r\nynhmDdLD4k4ZDUYoLP82hxneT7UiZYXcGzNObDDdIfwtB2R5wyjMDW8JPry2\r\nD9LEKk/zQVKTUyXCcG6wRE4Gemhq3pGD3x/0rCjAQY+NmoPQ6mM8hxrsluUL\r\n04DGKVVDmvD9uu6hI1DbfiBXBza89ibTg6oCZM4GsDom5Z0RzGcZN7SE+4ID\r\nn1jDjAHq3Xbw9n2Z7lOQlvKtvBOMdbdKcYbhMuHW7nAjmbH2HLywls/pDT1f\r\nfRj2hz/4TmlegE7RS3lB0MaI3SUM9paVNIdDU2ZN0Qh49Kvrz2io4FbldwvS\r\nR5mE34fs/jM9+VDQMXp/IZFX7WVvMXRbFhZ/Bhudtz63wI4TdyXbYL+mQmQ7\r\nnOfykPoEuf77L+orFGny/ToI5Sp2yXyD+vFaA+PQ/OKgzCR0dA+KmYLnrJgG\r\nZ2CgzhPZWfgvaHRxDpIF/78R8nrX5uFNvvHBRWLddofLLcMH/9hiV2Hpz6dD\r\n67D2i7H8X9j1LGp4Gw482KdANoX743bt9R3wn9eCAjUUE7aPY4KKLGsjLFCT\r\nLElpL7QabhnlhFGp8spCcIhy1/cD0FzJzksFtrkUr6jBmreGlIdh0tWbIkaQ\r\nqnKwzBheHpVQPg49NTv0LOHRLToPR1gneXLJCco7lIa6wKKbW2RukLfOOM4D\r\npv7MZvaCdJzzmT5wI+RWSQD0ffxNIQj+6JeuD4G9B7o6wmHZCsN8LBQWOh0U\r\nB++ZV2zHQ+Yo0thEeOPpcYZkSDKel54Cg5iWeNPhnNbhxxnQ2S9JNgt+zR17\r\nkQOPd8kdvg81pHtOFEK2WeaACpjA5bz5FFIYVUVVw7CLO+hewKUi85SX0O1r\r\nPvcr+I165WEDtDyoI9UE291Sqt/Bw+nfNVrhixbFljZYINz3uRNGTLD++QI5\r\nmvZaDsLKPLanw9DwCjvDKJw4yeE1Di+pc7Z9h6xcXCJTRN0bXFEzUO8L9+gv\r\nOPqcR2Mehqbuy1yExWZ8FquQ/qPg+21YWCIkTDaN9Y0TjtwB/fRE1akhjcj+\r\njF3wPoXYGh1UnRAzZ4C9jeIVTNArT4J+D6S8Inlu7zTx3pNqZYcH1KWFuGAX\r\np8xVHui2IfONF2Y8l7srBOVT5VdFYHuAgpkY/CerRCcNUxkOeMhCqfkDLfLQ\r\nseRghDL8c0NlWAUmuauqqkMxPbX0Q7BJWH1FC9pTaJzQhsvjGmVHoXCeprsh\r\nfH1Zq/nYNPE90WEBU3idU3vIHP5K0T1+ElbeMD7oB6uLdrw/D2vbaq0DYSON\r\nSPBF2HNjuzqaGPdGuUIGVIxjkmmaJs75fcJ7ZrCvVrpTtBeOjByX4oBUSh2K\r\n+6D1SJP2friuUOGkDpWH47JdYHusPr8bdJTfWeABY2OvPvGB/XIhdSEw+Jrr\r\n13hYI6PFWg29b5R510DBCe6WWng7bSPoNfTYevqlFXK2C2cNwG6hlJUhYrzL\r\n5MYjcFluZGuCmO/uXcc5GH6WVpD0J55fb0LDyOEMx3QvxU/iefwumgbSiyoM\r\n08K3EfeVdsPQAYZbjFBG8fIPZjiZMHuIFd6bsktng1T3lPW54SjZUpEwTLd3\r\nJN8Pjas/2onDWvdiWhno28TuIgeFuWPrFX4S+8LVPQdgUpez90GoJ9bTrAq3\r\nIrX2acCqobIgTXjuAE/XYaid/VnWCLoe/FtnDK/18ugdh200rict4a+H16et\r\nIZ3WkwA7aBq0fMMR+jOxsZ6ByU9U81yIcfVOSbjBvvGrzz3genjBYS/IztHW\r\n4QPtTRknAmD4TwWfIJgTY70RAsfqchguwx3WTZkREC9Z4Sjotl9K/Tq88fZ4\r\naxwsPnXBLAG2b6QPJ8K5lDr3ZMggO7KcAmXbya+kwwAyw9QsmJrlzZcLnysn\r\nldyHG95fGgshF82/Y0VQ/SHvlxJ4ZeDsfAW8HxgXWgWbGMsonsOJku7EF5BS\r\nb5WzDoqOsxe+gvrh6nJv4M2qKL1mWGryqKcVds58OPkBMvExX+giroM6JZIe\r\naGFlG/cfsX7xeXlfiXUTfScxBAeapp5/g5snaY+MQZ4N6Y8TUDPFzOYHdJIJ\r\nmpiGD11fbczBqfIk20Uo8de19jfR71u7Q9dhY43jH9JfyEmuaLMDGhyjfkEJ\r\nE9KG2Kjhp9GK4F2QRSKmnw5aB9oqM8ARGvJ1Fiho8dlqL3TLKX7ODuflzYN4\r\n4Jb9w1URyIVjkwp0/MNpoQ7zjyxUHYLi/ekB2lCFdOb3MWJcs5tLjjB5rWs+\r\nBrq2lxy5TnyeF5sWB8cMNA8lQpnssoS7sF07QbKEyJ1keO4T/Ooq8roHPlEl\r\nZ+6D5t9ra7/CB8piNBNQ8xvV41WijqqJzXX4I7bB9C9Rp1zw+jZ02mluRDaL\r\nfd+gdO4OOBT9Q5calts2Ze6CUdI583RQ4otlGhMMlWie5IQvDlt58cB166nf\r\nvDAwmoZUGD7LzLwmCpcrJOjFof+wMacMrFj+licHF2j8RBWhNB9Z2QHofSBZ\r\nUQU+OSZYpwZ/nXl2+BB0T/xsog0fFbj1HYWTdX/s9aHzNKeHMXywXbJgCsf2\r\naASZQcfDjlHWMMd6kcYODntfve0AuaOZ2RyhfWZ+thPMrFAUcoFfW5qLz0Lr\r\n5akaT5hGE3rIB/bx7mr2g+bHJHsCYfKZVzYhsDvEZOQiNC3wm70Cb9WRBUTC\r\nj93JG9GzxHlMMCIWGm0/2xkH4/boJsTPEueIfpZEqGe9wZcCr3nHPUqDzVFc\r\n0hlQu0JDLQdGtnQ25sHGIUf9fKhJE2n5GF7mZRkqhq+UHp4phf+MlGbKodqZ\r\nFt+n8GKI9dozWHtr+lINPFC3K64epkccm3wNN47e0mqEdZ+Y1puJcX+wu3TB\r\nvBK7hm5I5p/F+R/R1wPfAj/Dd5u83V+gcKOT5CCMvZYfOwynjSbHR6ABk+ih\r\ncVj82T3jO6TNKl75QfRBRLrkFzRTV2JfhVVkwQHrkLX1RecG7D+hHrMND7Jd\r\nHiWdw/t2qEFtB7R30/5NBeslY4x3QZ7fLY/p4MglQ0cm6JJ8ooMTer9yLJSC\r\nV1gu2ZlDI86AaUvIzn8uyAZWStskn4QTBoof3KBexKzKJbh7zoGjAA4umz96\r\nBB/9NVQqhprUKifKob8g641a2Gf78c9HmN2i8WUNxl+aVN2AYfIJ2ZvQJmfo\r\nDOk87qOgsDkaeF24lpwHBg+eduWFrknU7/mh9pZ1ggjc+m+NTRbOxuVclIeD\r\nWrrDivDFk9QHKjAgWlFKGzqpDiUehccXo37rQSmH3ppjkJs5jNMU0r4XCD8B\r\npxXOH7GC/TMcBTawObeRyh7m0zJ9dIQnJ8qtPeCxDOuXnlDNlITHB7LXmYyf\r\nh1T+azqBcFUk51Ew7E2e87oEG/VTuy7PE9+XqctfhbnPvqdEwYRz8esx8BKf\r\not116Pl5sD5unjj/SkQmwtbIgS9J8OjbGzIpRN0600N3ifGi0xXuQa1m3bhs\r\nqKFboPwA1l2zuPUQqrbumCyEtVRVakVQWf9Mcsk88bsTpplSqNj2RrMCyhny\r\nzj2D5XGd2jVQuj08sxZKHBvSew2FTTIetBL139LfaIMCXeumHfA+w6PCTsh7\r\n3GrrE8y5TWnRC3m6nxX3wXtMLmRfIKcZi80AzEhuKhuCbL3+lCOQ1eLT0wnI\r\nYJVAP0f0IU3dZQHS9f96uQRpbAzd12Ds3Y3Xf+DOr49ZN2EMh43XFtxhR/WW\r\nZAHn/cznHOSQdNDVjwJe4WJt3blAvB/e8dDAsKyAC7Tw75BAOz1cP3k1hBkG\r\n5sh27YEr30aE2eCS46FeLuiXNye2Dy6MZkXwwVmnTSlh2DfhWCMKG1zfaYnD\r\noqn9HyThHY8EcxkY/mtpSA66eVudVYRq/ryhKlB4OYpcHTIETt88BCdCKnO0\r\n4c0I7XfGRA7yx8bHoWM0Xb8ZNNjpf9oSKlzvm7GGPLtUA+wgVXzOPwc4kOjG\r\ncAa+Zeq46wJL78gKuBF9SN9Q9IJiuTftgiAL/+JECNGHBxbeYXBKqHYtHHYX\r\n8kREwLr9kTRRsKD4R3IMDCkrL4iDTrJ7ZBKg0dOQF4mQ9/nh9hTY+qp3MQdW\r\nah68eB/ea8za8RDGaJMlFELfZte9RdBW70NuCdRukxYrg2wf19Wq4NkhrthW\r\nGEAvN9lGrNMhXe0OmJ7nR9JNjO/SHDwARed83OfgzFajAcsi7iPp/keskOz0\r\nLCX74v/OQU3c0PCap6oILNnNKqECvXjd6RzhRJJ8ttMicR7YknKBBjNJph5Q\r\ntKouOYD4XJeB4zrxee3XojjYI/FQNQE2Mqo4JMOcgTO5WdDW57lwJewejXhe\r\nBfXNjfSeQ+WDo+51kJV815NmmHDhP/X3kGIq5+MHGGbrceojXG5XWOiC5w5t\r\nX+mBYxXvGfvgp9ST8gNQj3r/2yHYcPG3+QgsdYwN/A6Fe07snIJZOtzpM/Cm\r\nWOWLebgjK8xgCV7crTuwDJciGD3XoMfywOYfYnzXgvhNaPPFl2cbdhmqlpEu\r\nYZ5XFJo7oMnLz28poWXNY31q6FJ5zIweepbt62eAASWL9szwakGKKxu88eDs\r\nTw54O/egLzdMz9q1sg/mZgyF8MPCtLItwSXi+ouIFIHVt82oxGB9glC8BHwb\r\nt8YovUScd96nysKvV71yleDY5UNCB+F0GGORKlwPfPZUE26fv6Z8BFL62dTr\r\nQHpv8cN6cM+5f80GkMut0/AYFHTJ6zKB4k7nLU5AuVM6X82hiv3eU1ZQy2Z6\r\n3AaamsXPnoReuv+RuBP1aRdGn4NhWiE03jBSw/CWL1GnKjfLeZikPJ9+Ad5V\r\nfMMdTNQpl3w/FD6SdhG5BMskDpRcJurcTy17Fb4TeKJyjahn78qx23CGpaU7\r\nGS4y3rVKhSS06qcz4U7q3ZNZRD2Uox65S8R183T+PuQmiQ54CI+W7PxYCH2t\r\nb4gUEX0rv/W1FHqcztCsIeZrLKP9AI2jv+YvwGBZh60lmDf0zWoFLit+p9mA\r\nGZPzvuS/sX/TpVBnheE0Mv+pQub1s6c14KPvObOasLthN+VRKBQ0r2QK28dL\r\n053h6U+Tgmfh6iueCnfIm5Hw3hueN/XeCIYc9ZL28bCsyGXqFtROzwpIgt7n\r\n6eLTIPlpHfYMmG586eE9KKH2TDYHvtk/W58HLfcKGeTDmR0OfQWQZaR9rhi6\r\npZbsq4b/IieKa2CSH5fyS/jS6KZpAzRVeTvYCCdENt3eQXpyz4g2+GDhAV3H\r\nb+JcPXC3Ezq9MKzshc98xMeHoScti/YoFHy8mT9OjDvW4ToF9S9Xt8xAEq4c\r\n0Vkiv4XvzCLRjyVrw2U4mKBVsgqTxcXo/kCDVibvv5DU5e/Hf7CGdEKaZBn3\r\nqeqzxR1w6HPWiZ3wTkDMU2pIVmp1gR6+MNDsY4C+P0QPMMNh3o31vTClfsyG\r\nAxrZfqjlguRrTzn3wdrke2F80E8mekgAinZ4aQjDVMpDJOLw2AOR05JwhyZD\r\nozT0DxmNVID7WdsmlOBIZaXOQWj8K3KnBqS47ummCeuELN4fhucb1cV0oNgp\r\n4ThdOPqX/pc+TE9fMzKCpoojT4zhzu5W+uPwlXeFjxkM3JXRZQEntM8l2cLM\r\nUbPf9vBEuJr5KdjwnI7VGQaZrwa6QqnF4c9u8Ht8i/I5eE+s/K4XNGtJ3/CB\r\nNM4Rdv7wDYlHXQAMzjrBHQRfvz3sHwIpf8m1XCT6qcLsdwWWf+55ex2ubTWx\r\n34QawlXeCcvE90Z32JIh870orxRo2xTQmAZzZ5z3ZsAfjBae94g8B3XeZMMA\r\nR0XWPPjymtC5B8Q6le1peAj1+yj2PIKJ/1bciyCPUR9zGXQ53+xWAUsyquuf\r\nQpXp1LM10DLG6uUbmPVEl+Et0ZfeAy7NUHxTpLaVWBcBtt0f/rf+VM4dkMR/\r\nvaYTJjT0O/XC/360Pu+DXLtf0H6BRQ53q4dg84YNzQ9Ix29wahqa66tU/ST6\r\n7StGPQfH0jhOLhDr/Zrm6RJxXU1u7FyBz+l+2q/BLYWBij9Qx/4D5Sa8GfnS\r\nbgtydGdSkK9gv+djb0MLpz6TjtLDDM1CN0a4xbgUxArLQ9O22eCZcbVrnLC1\r\n6loqLwzlluQRgBIx3Q+F4G0r7mdi0HajskcB0p6xtjsAX334N3YQCmTpLWnA\r\nPoq5EC0Y651Mqg1/HRpm0IfZjyLTDVeI37Pt5zWGz8bOS5vB8GhqYwcoM1f6\r\n3yk4Zmnu4AR1RXM8z0KGDwpxfivEvtOxNRq2ZFYfLoX3ntLmlEPfD05/KyHb\r\nX/qq59DD9qzQG0jPzkbVCy1TQzr+QLHSzv2bcPudUMwWfLTySYN8Fec3c7Fy\r\nWpjNPJC0D35PVLPWWSXe7wMbulDJNjTLAMYK1IyZQLFqeS9b2JPRvdsBhl32\r\nqzwFO/TK1pxhoKRxxlnIwzSr5gFbVuO+eULfAbGrPpC94b2gP2zMd2sJgMze\r\nBbShsJqEPy0KnvrecPAapGo7NXgd2iRn8d1aJb7nV3t7GxbZD7jegWZaodRp\r\ncFOIveQufEhTY3wPGs9bLmbDnJo7SvnwsCHDm1I4I112pgImsxhTVsGJoTjD\r\nFzC+UWzuJVFn4fvEV3A4zk3+Dbzmu7OvCcpYFAQ3w/6DOpzvifrJIx0/wvaU\r\nrZl+eCE0K36AqPeUmsww9BENvTAO2ejY2SZhw+Lz2ino3mfp8BMyvVzZnoX/\r\nB69ISgU=\r\n \"], CompressedData[\"\r\n1:eJwl2nc8l9/7B3AjQshKdjbZO1lRZIayV0kI2clKSkZKJDIiq0QhK0miRCER\r\n4SNlZCWUmZXE73V/f389/3h7nPO6rnOPc+4HPiefEy6kJCQkFJQkJHPaNCPz\r\n/TNaueFjKkvwRE1tyjKsFj9n+AdeZmqvJvsyoyVnlM9IASeiwzx3Qr0/Evy0\r\ncEOO4hI9LPEc+swAGUbi4/fARnbXqb0wwEzjCAcUjmfN5oL9zXPrPPAGSYsZ\r\nH1RTySkVgLlPTJxF4YkfIq/F4A4+Eg5J6HanvFMWcnyMFVOA7TtPRytB2YuM\r\nqqpEnqrpFHWYOvdm4RCRSzTD8DCR67R/gTaRK9OAVBee/I/fXp/IpdfDaEzk\r\nulrsaUrkqotsOUHkkVa4ZEXMz5oy5UjMb+p15Aysvq6T7ULkaOL+c5bI8W/F\r\nzIPIofSx1BOG+xZQ+0CZonBnPzg+bvn6PJGHW5ojkMhjtfNCMJGj7bnYJWLe\r\nCrbUGJgkUSBwHZYVylfEwZks4/ZESMU+aJMMhe64/0iBjjeiyDKJeSiYErNg\r\n5pUc7lzYF1ir/BAanlnwLiPyDV/arIAxNrtuVMEGE+GHL6CSmv1AE+Tf06rb\r\nDzUTLf77Ch12jTsNwXTSrUtjkG5OvuoXXG/O4SX9OqPVGRz0Zz+kf/DMTgIa\r\nd/yul4If+XyvysP2Nrdd6rCVy5bbFDY2qGkFwmoqsuuNMKZe99tbaOEfr9gC\r\nlwfYxj5AuTJp1f9gqYXD7A9YcL/mON3AjFag1VbhbqhDq73FCCcudBaxQn79\r\nSXJemD3PXC0HvfNtaBWhuk2O0wE42Ci2Ww1ypGq56cA0NR8Oa9gt5/HAFtLu\r\nd5FwgFf32Gk4wfpdli3OcJ30uOlZKL9u+MWdGHfuqJMnfDyh9dObmP+rWoAf\r\ntGmRiwmE2rk8RVfg5VR2+UhYe5OlLhrKhNB8vAHP+VBYxcMCF5KRW3DE7q9b\r\nEuQ8sbp4B1rqLYamwUSNX+QZkFJ8bE8OXCL/ePAxlNxobSyGbgtNhqVwePCF\r\nw1PI3lM1+Qyavy/zqYEJr4vWa+H7Zw8j6uGOklyaBqhxPzO5EVYl3H7YAnPP\r\nXnr/CQ44BJ/ohazm5wf64E1N99kB2KLkHDgMySRPbY9ANQHb2HEYxG7BOAkr\r\nd5tmTMFfFIYCP6HIpk7JLHRa0lRcgMYfJGw2YLFvf/UmpGKNYtmGjY4DneSD\r\nM1r7KK9JUsKwYrk4Kqi0ev0oHUzOVMzfDRc0R0mZ4LHJm6dYYFGccj0r3Ck7\r\nwcEOnftuBXMS4/D9kOclxmlOus0Pv57TmBeEd6pTivbDRTstKgloTDrrIgWp\r\njLT55KHL4ny4ImxMzRw8QIyjpquiQowzupSmBr/EZK9oELkkDMy0iDyBefRH\r\niTxcxzz1iDxv1t8bEDloTaNNYH/e1l9r2NBuN30Ocvvv1PWGoXuf5vtCBSca\r\nxwvw0VpNXzi8zc/69ja0pQ4yvwP5Fz5PpMLK+rsU92CvNbduAdx7S7CtFmb9\r\nlesah65jyY6TUOr98sIUfJVazTgHR2RVzNahgJtWH+0Q1sX4vutuWKVIvsYI\r\ntcnf7d0LXbP1bPigVPTjaQG4do4mVBjGHmzPEIePe00GFSHZ0RpHZWj7nPe7\r\nCqTJWJw9BD1PJW/rw7ddfyONINdhZyoT2CGoyGgOhVOzUixh+E5KDhtinpk+\r\n/pMwxu5QoSMcbi8UPwOVNBjKXeCtsmAFNzjFO1rjATWT9NW94EIAx1F/qDd5\r\ntS0A5lr9NA6Cx1XqrMJgUbHgYDiRkzveMQJWbju4xxA5/ZpnY6HTmJR/HKw1\r\nS1uNh8zvtkMTifxKbttJRP7CrsgUGHAj72YGbP9LzZgFBb38U3LgfyZHsvOJ\r\n/G+K+QuJ/HIshY+J3Hu+l5XChJhjChVwcu1ZzVOo4c6jXg3Tvsa8qSHyG87r\r\nvCTy11u11cP1HNGeRmjKeNvqHdHnq38GWoj+urRNtMOXYp6rfcT4htEmX2D5\r\nuexHA1Ds5nPSYZhf0mU7Ank6pp+OwbuzZHTfIQs9l+sPIo+U4utpSGVizPYL\r\nRvqc9ZuDweV3BX4T/ZDburYJB0/sHd2CVudlVEiH8RxM1k8mh0ZVTr8oYHPv\r\nRR0qqLVyJ5sG1u0pXaOFSkotprthueXIY0YoHvSHjAXy1og/Y4M0Kons/DDK\r\n9rG/INwObfwgDJdfLl8Sh96DdJ8l4fSmsIwMdObWvC4Hh9VtxhSg9Ul/1QOw\r\nJzzuzkHY+rr+qAas1OIv1oUSTqo7DGDhVXMHI3ivKWb3cRij8/O8LbTRr1Lz\r\nghrFV1t9oCDdcXN/uNA1ey4IxlqLZEbA6rMZf1Igc8yV6ldw/Yfx4TdEDn3u\r\nj02wiK72eys8nPKbpQf65rue/wE7Go1kGL7huuj5kMgEhyYMFlngLKV+JTuk\r\nM9RREIDHetSVlaDFRF26MnRYUf2jAr32qtQegvF2Smr6MMXz2T1DmHVJ4d8x\r\n+CRH7tUJ+Ky8gscC1r+RuWwF33WXfbOBHeNSmvbE/MtPck8S81NIkp4m5hcR\r\nb3Qh5vcU0faBey4V5PtB7gQhigAoWS7QHEzkWt6nd5XIRZHzKIrIxcpDfQ26\r\niGS5XyfyKXO1xRH5wtiMUoj5djCaPoLOuWn5RXBTledPCbzzOf9YGZQ4L36/\r\nAr6lr1x9Cu2LlA2r4c1RneVaKHipXa8e1rGZZb2Gv0wcj76FRq9C0zvghA3p\r\nbCcMW7mm1Q1ZbtOn9sISiZSZPqjdynnoCxw8cz95AAZsi04NwV2ZZWoj8L6S\r\n0u0xqNJd930CelC3JUzDtqCJkSXoxHxOcQVulC5eX4Nik1tym7AxIvraFrTl\r\nph0kGcH7tSZJhhxeN2ePpoC8CzlfdsKaOGEpGmgq8uQqLZxqlP9MD/Vkjfez\r\nwZH23kscMNjNrpsLPspxu8gHNVXnOwVgf98FQWFIRR/ZIQZzH1PzS0JlncRA\r\nadg1wvpBFrqFZe1TgCRsggFKMP1pUasybJl57qcO21p+rx+CH/OlrxyGvScL\r\nE3ThZ9XxPQbwK9u+LCMiT3dq8XE4XtYtZw4nb9LXWsIZdwMtGzh7NKbVDi4I\r\nNJqchMskW32OcKP2wncX+C+twtONyHFh9rcH3CntQuYLaWjzrvtD+ulBhguQ\r\n5YH5vlC490piQRjkcGiXvAx5VKieRUC+vdpqUVBw+XJTDBT99NLgOpSKk7dJ\r\ngLJuPiOJUEGn+GwyVN3mD0wn+nqeKfk+NDQ15ngIjSVv5BXCEzTNokXQ4gdp\r\neQm0fqt+oAza54W8qoBOdovt1dBFWdL8BdHPPe4DL6FP58h0Aww70kX5AaaK\r\nl2l+g3XPM++NwtEjsevjUML+dPkUbLzJzLtE9Gk2aHvHKK6/cs1XYtBDTZJD\r\nEt5qZQ+Uhl9HliQVoA/jwyx1mOFPfckULip0qwbCq2QBbcGQqWuPzUWocM4m\r\n8AoMzhspvwG36OaFcojxBhKr8iDvY7kj+VBLO9DxMYwK/ZfxFNL82MXQCjOr\r\nnmS3QYmrJpId8Bh3skE3TDTjiB6EfHx1zN9g5ZzD/VHYcz3v9SRkbRDdWICF\r\n8W2xv6GynefeVdgqSl+wDm1WyxT+wpmm403/YOjt38dJxnB/nUoZIYP3JA74\r\nUIwR+87+fzvhq5bQmzTwm9Orx7sh/12dCXZ4eHHOlQue0U+f5oFReVqefDD/\r\nz8ycAHx3/I6fMJx8rL4sCinJfgSKQxHbxD+SUK/yYJgMdKMZ35KDRbWKO5Sh\r\nBOcA/WF47HzUbW3o/UGSRRcmCHxO1YdlF6+wG8Gunv33jOGCeA/PccgYFZZn\r\nBuUGhQQt4QmFzgJreP5m8H47WKX2QcoRHsjyPegBrVfY6zxh8LEmDR9Y+2+P\r\ndgD8avG6ORD+feKmHwK5KJnaL0K1ky+Nw6FDtfOnKzCcnt48Er5+5WgTS/Rj\r\nH6VzEnQKKpu8AyM7rd3T4NvLxd734PfP5ovZRB9kts7nQeHYwtUHUHfENKSA\r\n6IPyxt9HMDbxQXgxfDxlRFoK2zRXI8uhUV5mQi289Wjlex3sLjNRf03U8Yr8\r\nVxPMfOdwpHmM2Gc9z2gl1mXgnH4HLBh7l9sJp6b3rX+C4oshJr1EX9d7Cvpg\r\nxbbkVj9cpoy1GIChe9R2jMB6rlS7MUgiuFA5MUbsg/JPT8PbJrSvl+Cj64Mh\r\nFOMzWj8TlT7thFLpiaI0sKpA+zM9fN1UosAG+/6FzYtBcn9uF1NYWSsxfwI6\r\nkquFWMC6O7bxtjDgedozZzi5yUgZAu/o8CVehIcTZDjCYc4+E6lIaH34pmU8\r\nfH+NsjAPBnftkc2HwuxCLwvg1aIjncVQpePK2jM4tScxogamnszZ9RL+nq/f\r\n1wBLmP7qtkFbO5rudkiVz27fCat/iU5+gi6Kyr69kMf6QvowbM+N4h+FodPJ\r\nJeNEXaGVDVPwVtb81BJRT0qZ7gqUifcpWIMk0dIUG7ArbP7MJswNKGvcgn6e\r\nPnykE3hO2M8PU8AxszJ1KvjU0OceDTRXnbfZDVM45nvZoCtTmTwnVKLxSeKe\r\nIO4j6cV9sO/PnAk/LFgsLRWEQdPedCJQb1TKcz9k+zLXJg6nukr3S8EXrd6x\r\nMtC2Zk5HEWamzTVoQM9bpfu0oNo17/AjkPay1JAOHAycU9WDJd6lGQbwkqv3\r\nHyNofFLK2gTyWM5VH4dzx0r3mMPXOt4BltBRcU7WDuaxzJU4Q3/a0l1n4eEd\r\n3h7uRL2/Z0W8YeXPJzG+MHLc67s/UfeApPYFKNgzez8ILrc9IQ2F7xq9HMNg\r\naq3k63CiH5Wz3BGw8PZs+g1ivDYnsXgiz47+l7eIvwtsHL4zQdwfB3zTIN10\r\nCWkGjLJLE8yBDXdoq/PgZkeEbj5U3rnWXwDPa3p6PIZOQlrlT2H2yWqtavg1\r\nTbynBh6nYV2thzePxF1rgK1hJOxNUHN+RrUVhok6drTBmtP/newg8mcYLHRC\r\n6d7XEd1Evhd3WgaJ/i9R23wjcopfnhkl8mW70/0g8lzVMFsk5jOaGqb4jvUf\r\nUV2Vgo75NRdloYSbIqkCfDsvRXsQLm3x8R+BxtxUxlaQyrb34WUY1uNp0QU9\r\njmaUdUPrFy3U/0H5HP5XX+CMR7/wOLQh015fgUqynJmck+h7vt4KN2TaG2jC\r\nC2c3u8iFYH5rjKcUZHZcUteCJD370o/AOZ1jSzqwTfxRgQG8uuaw2xwuJLwf\r\ncYX6R0q83OH9tYSNc9Dc0ZzFD76Q/aZ7kZhn8k3vJeiZkX/6CuQh97gYTYzT\r\nu1x6Cw7EflZNggrqta13YPziPYs0OPnw8thdeMjWyeceTKfX2cyGS40i1/Og\r\nYRANaz6RW3z2fgHc+tYp/RiW66Xol0IWDt5LNdDrIxnNS9h89XtqPdx3oFWg\r\nAQb/LCpvhJ9y4tXfQTFz37YWGEVlZtUGh+oUJ9qhkh+bXydMFPr779Mk8Zxq\r\n2PsZFpwyNByF28xS/ePQupXBZRJWhv1enIK7ZPvCf0Ln7zW75uCru5npC3Cv\r\ncbjQb+hLdrpyBb6vPnJoHfKfE27fgL09P79vw4MPA9lpfuA5S0VzkRbKeGYN\r\n0sPiThkNRigs/zaHGd5PtSJlhdwbM05sMN0h/C0HZHnDKMwNbwk+vLYP0sQq\r\nT/NBUpNTJcJwbrBETgZ6aGrekYPfH/SsKMBBj42ag9DqYzyHGuyW5QvTgMYp\r\nVUOa8P267qEjUNt+IFcHNrz2JtODqgJkzgawOiblnRHMZxk3tIT7ggOfWMOM\r\nAerddvD2fZnuU5CW8q28E4x1t0pxhuEy4dbucCOZsfYcvLCWz+kNPV99GPaH\r\nP/hOaV6ATtFLeUHQxojdJQz2lpU0h0NTZk3RCHj0q+vPaKjgVuV3C9JHmYTf\r\nh+z+Mz35UNAxen8hkVftZW8xdFsWFn8GG523PrfAjhN3Jdtgv6ZCZDuc5/KQ\r\n+gS5/vsv6isUafL9OgjlKnbJfIP68VoD49D84qDMJHR0D4qZguesmAZnYKDO\r\nE9lZ+C9odHEOkgX/vxHyetfm4U2+8cFFYt12h8stwwf/2GJXYenPp0PrsPaL\r\nsfxf2PUsangbDjzYp0A2hfvjdu31HfCf14ICNRQTto9jgoosayMsUJMsSWkv\r\ntBpuGeWEUanyykJwiHLX9wPQXMnOSwW2uRSvqMGat4aUh2HS1ZsiRpCqcrDM\r\nGF4elVA+Dj01O/Qs4dEtOg9HWCd5cskJyjuUhrrAoptbZG6Qt844zgOm/sxm\r\n9oJ0nPOZPnAj5FZJAPR9/E0hCP7ol64Pgb0HujrCYdkKw3wsFBY6HRQH75lX\r\nbMdD5ijS2ER44+lxhmRIMp6XngKDmJZ40+Gc1uHHGdDZL0k2C37NHXuRA493\r\nyR2+DzWke04UQrZZ5oAKmMDlvPkUUhhVRVXDsIs76F7ApSLzlJfQ7Ws+9yv4\r\njXrlYQO0PKgj1QTb3VKq38HD6d81WuGLFsWWNlgg3Pe5E0ZMsP75Ajma9loO\r\nwso8tqfD0PAKO8MonDjJ4TUOL6lztn2HrFxcIlNE3RtcUTNQ7wv36C84+pxH\r\nYx6Gpu7LXITFZnwWq5D+o+D7bVhYIiRMNo31jROO3AH99ETVqSGNyP6MXfA+\r\nhdgaHVSdEDNngL2N4hVM0CtPgn4PpLwieW7vNPHek2plhwfUpYW4YBenzFUe\r\n6LYh840XZjyXuysE5VPlV0Vge4CCmRj8J6tEJw1TGQ54yEKp+QMt8tCx5GCE\r\nMvxzQ2VYBSa5q6qqQzE9tfRDsElYfUUL2lNonNCGy+MaZUehcJ6muyF8fVmr\r\n+dg08Z3osIApvM6pPWQOf6XoHj8JK28YH/SD1UU73p+HtW211oGwkUYk+CLs\r\nubFdHU2Me6NcIQMqxjHJNE0T5/w+4T0z2Fcr3SnaC0dGjktxQCqlDsV90Hqk\r\nSXs/XFeocFKHysNx2S6wPVaf3w06yu8s8ICxsVef+MB+uZC6EBh8zfVrPKyR\r\n0WKtht43yrxroOAEd0stvJ22EfQaemw9/dIKOduFswZgt1DKyhAx3mVy4xG4\r\nLDeyNUHMd/eu4xwMP0srSPoTz683oWHkcIZjupfiJ/E8fhdNA+lFFYZp4duI\r\n+0q7YegAwy1GKKN4+QcznEyYPcQK703ZpbNBqnvK+txwlGypSBim2zuS74fG\r\n1R/txGGtezGtDPRtYneRg8LcsfUKP4l94eqeAzCpy9n7INQT62lWhVuRWvs0\r\nYNVQWZAmPHeAp+sw1M7+LGsEXQ/+rTOG13p59I7DNhrXk5bw18Pr09aQTutJ\r\ngB00DVq+4Qj9mdhYz8DkJ6p5LsS4eqck3GDf+NXnHnA9vOCwF2TnaOvwgfam\r\njBMBMPyngk8QzImx3giBY3U5DJfhDuumzAiIl6xwFHTbL6V+Hd54e7w1Dhaf\r\numCWANs30ocT4VxKnXsyZJAdWU6Bsu3kV9JhAJlhahZMzfLmy4XPlZNK7sMN\r\n7y+NhZCL5t+xIqj+kPdLCbwycHa+At4PjAutgk2MZRTP4URJd+ILSKm3ylkH\r\nRcfZC19B/XB1uTfwZlWUXjMsNXnU0wo7Zz6c/ACZ+JgvdBHXQZ0SSQ+0sLKN\r\n+49Yv/i8vK/Euom+kxiCA01Tz7/BzZO0R8Ygz4b0xwmomWJm8wM6yQRNTMOH\r\nrq825uBUeZLtIpT461r7m+j3rd2h67CxxvEP6S/kJFe02QENjlG/oIQJaUNs\r\n1PDTaEXwLsgiEdNPB60DbZUZ4AgN+ToLFLT4bLUXuuUUP2eH8/LmQTxwy/7h\r\nqgjkwrFJBTr+4bRQh/lHFqoOQfH+9ABtqEI68/sYMa7ZzSVHmLzWNR8DXdtL\r\njlwnfs+LTYuDYwaahxKhTHZZwl3Yrp0gWULkTjI89wl+dRV53QOfqJIz90Hz\r\n77W1X+EDZTGaCaj5jerxKlFH1cTmOvwR22D6l6hTLnh9GzrtNDcim8W+b1A6\r\ndwcciv6hSw3LbZsyd8Eo6Zx5OijxxTKNCYZKNE9ywheHrbx44Lr11G9eGBhN\r\nQyoMn2VmXhOFyxUS9OLQf9iYUwZWLH/Lk4MLNH6iilCaj6zsAPQ+kKyoAp8c\r\nE6xTg7/OPDt8CLonfjbRho8K3PqOwsm6P/b60Hma08MYPtguWTCFY3s0gsyg\r\n42HHKGuYY71IYweHva/edoDc0cxsjtA+Mz/bCWZWKAq5wK8tzcVnofXyVI0n\r\nTKMJPeQD+3h3NftB82OSPYEw+cwrmxDYHWIychGaFvjNXoG36sgCIuHH7uSN\r\n6FniPCYYEQuNtp/tjINxe3QT4meJc0Q/SyLUs97gS4HXvOMepcHmKC7pDKhd\r\noaGWAyNbOhvzYOOQo34+1KSJtHwML/OyDBXDV0oPz5TCf0ZKM+VQ7UyL71N4\r\nMcR67RmsvTV9qQYeqNsVVw/TI45NvoYbR29pNcK6T0zrzcS4P9hdumBeiV1D\r\nNyTzz+L8j+jrgW+Bn+G7Td7uL1C40UlyEMZey48dhtNGk+Mj0IBJ9NA4LP7s\r\nnvEd0mYVr/wg+iAiXfILmqkrsa/CKrLggHXI2vqicwP2n1CP2YYH2S6Pks7h\r\nfTvUoLYD2rtp/6aC9ZIxxrsgz++Wx3Rw5JKhIxN0ST7RwQm9XzkWSsErLJfs\r\nzKERZ8C0JWTnPxdkAyulbZJPwgkDxQ9uUC9iVuUS3D3nwFEAB5fNHz2Cj/4a\r\nKhVDTWqVE+XQX5D1Ri3ss/345yPMbtH4sgbjL02qbsAw+YTsTWiTM3SGdB73\r\nUVDYHA28LlxLzgODB0+78kLXJOr3/FB7yzpBBG79t8YmC2fjci7Kw0Et3WFF\r\n+OJJ6gMVGBCtKKUNnVSHEo/C44tRv/WglENvzTHIzRzGaQpp3wuEn4DTCueP\r\nWMH+GY4CG9ic20hlD/NpmT46wpMT5dYe8FiG9UtPqGZKwuMD2etMxs9DKv81\r\nnUC4KpLzKBj2Js95XYKN+qldl+eJ72Xq8ldh7rPvKVEw4Vz8egy8xKdodx16\r\nfh6sj5snzr8SkYmwNXLgSxI8+vaGTApRt8700F1ivOh0hXtQq1k3Lhtq6BYo\r\nP4B11yxuPYSqrTsmC2EtVZVaEVTWP5NcMk/83wnTTClUbHujWQHlDHnnnsHy\r\nuE7tGijdHp5ZCyWODem9hsImGQ9aifpv6W+0QYGuddMOeJ/hUWEn5D1utfUJ\r\n5tymtOiFPN3PivvgPSYXsi+Q04zFZgBmJDeVDUG2Xn/KEchq8enpBGSwSqCf\r\nI/qQpu6yAOn6f71cgjQ2hu5rMPbuxus/cOfXx6ybMIbDxmsL7rCjekuygPN+\r\n5nMOckg66OpHAa9wsbbuXCDeD+94aGBYVsAFWvh3SKCdHq6fvBrCDANzZLv2\r\nwJVvI8JscMnxUC8X9MubE9sHF0azIvjgrNOmlDDsm3CsEYUNru+0xGHR1P4P\r\nkvCOR4K5DAz/tTQkB928rc4qQjV/3lAVKLwcRa4OGQKnbx6CEyGVOdrwZoT2\r\nO2MiB/lj4+PQMZqu3wwa7PQ/bQkVrvfNWEOeXaoBdpAqPuefAxxIdGM4A98y\r\nddx1gaV3ZAXciD6kbyh6QbHcm3ZBkIV/cSKE6MMDC+8wOCVUuxYOuwt5IiJg\r\n3f5ImihYUPwjOQaGlJUXxEEn2T0yCdDoaciLRMj7/HB7Cmx91buYAys1D168\r\nD+81Zu14CGO0yRIKoW+z694iaKv3IbcEardJi5VBto/ralXw7BBXbCsMoJeb\r\nbCPW6ZCudgdMz/Mj6SbGd2kOHoCicz7uc3Bmq9GAZRH3kXT/I1ZIdnqWkn3x\r\nf+egJm5oeM1TVQSW7GaVUIFevO50jnAiST7baZE4D2xJuUCDmSRTDyhaVZcc\r\nQPyuy8Bxnfi99mtRHOyReKiaABsZVRySYc7AmdwsaOvzXLgSdo9GPK+C+uZG\r\nes+h8sFR9zrISr7rSTNMuPCf+ntIMZXz8QMMs/U49REutyssdMFzh7av9MCx\r\niveMffBT6kn5AahHvf/tEGy4+Nt8BJY6xgZ+h8I9J3ZOwSwd7vQZeFOs8sU8\r\n3JEVZrAEL+7WHViGSxGMnmvQY3lg8w8xvmtB/Ca0+eLLsw27DFXLSJcwzysK\r\nzR3Q5OXnt5TQsuaxPjV0qTxmRg89y/b1M8CAkkV7Zni1IMWVDd54cPYnB7yd\r\ne9CXG6Zn7VrZB3MzhkL4YWFa2ZbgEnH9RUSKwOrbZlRisD5BKF4Cvo1bY5Re\r\nIs4771Nl4derXrlKcOzyIaGDcDqMsUgVrgc+e6oJt89fUz4CKf1s6nUgvbf4\r\nYT2459y/ZgPI5dZpeAwKuuR1mUBxp/MWJ6DcKZ2v5lDFfu8pK6hlMz1uA03N\r\n4mdPQi/d/0jcifq0C6PPwTCtEBpvGKlheMuXqFOVm+U8TFKeT78A7yq+4Q4m\r\n6pRLvh8KH0m7iFyCZRIHSi4Tde6nlr0K3wk8UblG1LN35dhtOMPS0p0MFxnv\r\nWqVCElr105lwJ/XuySyiHspRj9wl4rp5On8fcpNEBzyER0t2fiyEvtY3RIqI\r\nvpXf+loKPU5naNYQ8zWW0X6AxtFf8xdgsKzD1hLMG/pmtQKXFb/TbMCMyXlf\r\n8t/Yv+lSqLPCcBqZ/1Qh8/rZ0xrw0fecWU3Y3bCb8igUCppXMoXt46XpzvD0\r\np0nBs3D1FU+FO+TNSHjvDc+bem8EQ456Sft4WFbkMnULaqdnBSRB7/N08WmQ\r\n/LQOewZMN7708B6UUHsmmwPf7J+tz4OWe4UM8uHMDoe+Asgy0j5XDN1SS/ZV\r\nw3+RE8U1MMmPS/klfGl007QBmqq8HWyEEyKbbu8gPblnRBt8sPCAruM3ca4e\r\nuNsJnV4YVvbCZz7i48PQk5ZFexQKPt7MHyfGHetwnYL6l6tbZiAJV47oLJHf\r\nwndmkejHkrXhMhxM0CpZhcniYnR/oEErk/dfSOry9+M/WEM6IU2yjPtU9dni\r\nDjj0OevETngnIOYpNSQrtbpAD18YaPYxQN8fogeY4TDvxvpemFI/ZsMBjWw/\r\n1HJB8rWnnPtgbfK9MD7oJxM9JABFO7w0hGEq5SEScXjsgchpSbhDk6FRGvqH\r\njEYqwP2sbRNKcKSyUucgNP4VuVMDUlz3dNOEdUIW7w/D843qYjpQ7JRwnC4c\r\n/Uv/Sx+mp68ZGUFTxZEnxnBndyv9cfjKu8LHDAbuyuiygBPa55JsYeao2W97\r\neCJczfwUbHhOx+oMg8xXA12h1OLwZzf4Pb5F+Ry8J1Z+1wuataRv+EAa5wg7\r\nf/iGxKMuAAZnneAOgq/fHvYPgZS/5FouEv1UYfa7Ass/97y9Dte2mthvQg3h\r\nKu+EZeK70R22ZMh8L8orBdo2BTSmwdwZ570Z8Aejhec9Is9BnTfZMMBRkTUP\r\nvrwmdO4BsU5lexoeQv0+ij2PYOK/FfciyGPUx1wGXc43u1XAkozq+qdQZTr1\r\nbA20jLF6+QZmPdFleEv0pfeASzMU3xSpbSXWRYBt94f/rT+Vcwck8V+v6YQJ\r\nDf1OvfC/H63P+yDX7he0X2CRw93qIdi8YUPzA9LxG5yahub6KlU/iX77ilHP\r\nwbE0jpMLxHq/pnm6RFxXkxs7V+Bzup/2a3BLYaDiD9Sx/0C5CW9GvrTbghzd\r\nmRTkK9jv+djb0MKpz6Sj9DBDs9CNEW4xLgWxwvLQtG02eGZc7RonbK26lsoL\r\nQ7kleQSgREz3QyF424r7mRi03ajsUYC0Z6ztDsBXH/6NHYQCWXpLGrCPYi5E\r\nC8Z6J5Nqw1+Hhhn0YfajyHTDFeL/2fbzGsNnY+elzWB4NLWxA5SZK/3vFByz\r\nNHdwgrqiOZ5nIcMHhTi/FWLf6dgaDVsyqw+XwntPaXPKoe8Hp7+VkO0vfdVz\r\n6GF7VugNpGdno+qFlqkhHX+gWGnn/k24/U4oZgs+WvmkQb6K85u5WDktzGYe\r\nSNoHvyeqWeusEu/3gQ1dqGQbmmUAYwVqxkygWLW8ly3syeje7QDDLvtVnoId\r\nemVrzjBQ0jjjLORhmlXzgC2rcd88oe+A2FUfyN7wXtAfNua7tQRAZu8C2lBY\r\nTcKfFgVPfW84eA1StZ0avA5tkrP4bq0S3/nV3t6GRfYDrnegmVYodRrcFGIv\r\nuQsf0tQY34PG85aL2TCn5o5SPjxsyPCmFM5Il52pgMksxpRVcGIozvAFjG8U\r\nm3tJ1Fn4PvEVHI5zk38Dr/nu7GuCMhYFwc2w/6AO53uifvJIx4+wPWVrph9e\r\nCM2KHyDqPaUmMwx9REMvjEM2Ona2Sdiw+Lx2Crr3WTr8hEwvV7Zn4f8BSDhK\r\nAw==\r\n \"], CompressedData[\"\r\n1:eJwk3Hc41e0fB3CzJCSRrUhkb9luJYREESJpKON7zskIqRRRZJZIFCmRURpW\r\n0lIhhYpHyshKtjSQpN/7XL+/nut1cc65x+e+v593zvVI72Vs82JjYWHhXMTC\r\nwvzvhDl3z2T7iFlrtlx59G4GuRreZ/AdVvsbumrKk0G2VVal/oRjdr6Ocd/L\r\nIOVKfja/YWOhQ25aXgxyQuBNOdvHETMS94Cl15dBNG1zl3PC2sNLfW0pBhmI\r\nPkYthhMtPFoqaAxi9VtZhgfewMqel3iIQeY0OY/zwVc8nJbN+TNIMdX1gR+e\r\neZgf6hXIIPw9CQlCcFGwrY1RMIPUiB4YEoY5W7NK80MYJGi7yUYxeHGoQ8F0\r\nKIPIJazMkoDLDs9uXXGEQdprJ2al4D2B2dNq8FmWuu3SMJ+/xRVb2Mgg+/Ya\r\n+CF9fKMPfPXW1v3rYCFfw3PX4G1f5Z8owjUH+9Y/gTmkWcRUYLpXbHcH7H3h\r\nTrMGXO/5QUkojEHEmmIUteEgj/D3GvCbxXuidWEZ97VH7GCNo8sNDeEzzoG1\r\nZ+CB0uFUY9jMSYyWC6dNPPtmCo9ve7biGWy1LsNmA5xp713VBc/tCcgzh4d+\r\ndRbVwcWZ1qyW8NQPqckHGI/HfzLum+G5KU/NYqxHjVXLcjuYZ2KgMhnrFxRZ\r\nRNkz5zcmNx95GOtVfapuGyw14m16OAjro6Z93BlWHxx76RqA+a9MHfKEHbt/\r\nvpehY/72tI374F2duiuFsJ/lsZuyvOADn0JdF2O/vZ9L/j4IM9qrLv9GPYj9\r\n/bXdFw5tm/886oP10G26TcGRrSZrur0ZJPxQ3hIG8+fsfUXnDjKIemH4fn/m\r\neFK3v0tAffX373gSCA+vfTkduw/rI6kmFgzfL9eVOL0H6+O8+HAovNPqplkk\r\n6re4oULxOHzDLy4+zA3zvSuSdho2uucg47edQc4r562JhauFy/sNHRikJF/r\r\nbhwsEi52g2crg4xcsXuTDP/c3C9/25pBuEQ7XVOY+1liORxuxSBrL/h8TYXf\r\nChUXbrVgEM+zUWyZsOmnfE1tM8yHUyD5CtzKzZ9vYMIgmSezJa/CKUah4maG\r\nDNIWXKV3Ax7MsuKw02EQm33f6CVwxf7h/w4qYP26j8/fhYPTHKzpcgxy2nXp\r\n2VJ4Sd2Dx0FrGOTpVrkbD5j1o3g2P0KSQXSN3Duew2MlEgf3LmcQGaF6y3aY\r\nI81uXv8XnZBkp/8+wSvf/5wonaKTXUv793bBscsye9Um6CSddeF4H/M8xH6t\r\nXfuVTngntErH4KPHT55b/pFOZmuzV7N+wvizpGYtquikOTTktwIsn+p1xf0o\r\nnfBdL3NThkN1D9zMCKETu8Yfj1RhnbYD99sD6aRJ+lCkFnxXyPuVI0Unbxq8\r\nlxrDzRd9f9nuopN6iZ2S9jDPub+joyZ0UvPUyCwYDmd55r6MjU7Kudhia2B3\r\nOTOK7yyNnH5k+fkFvPjHFNfJ0zTiFJCgUwfrP7t2YyqSRn52iPS9hoXdOT63\r\nHqURzRI1w//glnN1Dpk0GrnttGv8K2zzd8v6dQ40knet0oG3Y8SsoL0/OFGM\r\nRoKdF/KXwSO0Fjl5YRrZxGO+sBy+yvG87ckKGhk43Fy4ElZpcDPT5KURmc2D\r\n7Kvhy/RLuhdZaCRrckW5Jny0QlB6z1eK0HNdeXTg4VX7PQwGKGLsmr13PXwv\r\n9n7mil6KdNYoLjNifp7btpW1nygilmbmvQl+8TQzy6uZIheNGGIu8OKyDSyn\r\nHlDkvabv9Z0wT0OrfVw5RXgUvJR3wUY9B3JS7lMkUsjNZC9swR23IfcWRR4t\r\n3VG3H7ZZJZlSXEiRWVYH+4PwVu2S/tJ8imjN2nz0gRtl83v5bmC8ExZ7KbjE\r\nZU34q2sUKRgwG6XD5+OzxaKuUmTgk1GQPxz0VLzCJIsirnWap4PhVQqC3+5f\r\nooj5VanCk3DCb469WckUOZEmqnUKZqhELLgkUqQqXrA6Gt6252/GiniKqB/h\r\nbjoLC7/61RJzhiJ+DE7nBPj3vP+hjdEUyfNi6UmCO9UneBYiKdLj9sf7PJzr\r\n5VtQeZIi4tumpy7AsYKvlpMTFNlhNRV2EbZc4xT66zhFkk3G2DPgM5q93YXH\r\nKLJIqU8oG+a0/10kFEaR7+xN+gXw37MKFqNBFFGZq68pgqsvlRVfDaSI97fn\r\nNrfhIzfNVuwIoEh354Nd9+GZl649TxkUEW0pHSyDS1u/WATTKeL4qoRRCQf2\r\n+99SolEk8UnhbBVc9v3vil4/irwquxHxCE6vHXNt8qUIR/FV7qfw++tXm2tg\r\nk2uZKTUwf4Tjpgq4NPHcjTo40rBa/Sp89eDxV+9g7ztxiwPgjl2h21rhawmm\r\nxw/AKx0DO9rgT74/vu+E44nPeAdst9ateyNcp7s/uBs+zbbMUQ9mU9n9rwd+\r\n+rnmlTJstGZnTD+8UB1sKg2HiDotH4TXZyiWCcH3ltlnDMH6D1PnG+ExTps1\r\no/CGhOmDGhRF5Oc3FY/DbbudWy5g/nu/E51vsJ9mpcks1sfutbLrHPzwmOFY\r\nNNa76FB7+Txc0RGf/e4wRbhWRgn+g+8bdG+TDKFIjWdHM3vniFnx7MkHpUco\r\nsmrRGZVFcIHze4rlKEWOFWnGccE3ytestsX+6k7HWvDCWUG1p/vDKZKSqZO7\r\nDL7UImyghnr5RnpZBeDok1ORbyMosmUwfrcg/CVbJ+5EFEUK4/QerYQtnxxJ\r\nUUU9LtYYEBOFb3Y/yuyKpcj+tqRQcZh7gTU3HvW7Svqr1mp40vhs6cg5jKf2\r\n/DkZ2H5XU/WlCxT55GcyKQu3HBd4aXWRIhfKUwsV4LTqjP/yLlNkys2MSxme\r\n6ejucsrG+rCOe6nCrn9kBjlw/rhszaW1YHGDoum9OK9eU5PhOvBx18mF5TjP\r\nNWmZnevhrlCtxc+KMR4jSwMD2CQ9ZNmhEoyn9/tFI5hTdlPvjXsU+Xg665cJ\r\n/NWVTyEL94eusvV2M7gu6cOhtCqsT3AOnwUc88eH5UwN1kdiC2UF+2hoWZ2o\r\nxfo8m31lDdscnE8KacB68NhHb4V5WhJXeb+nSHvOwh8XOKnwvsnmPoo8feM2\r\n7Ac3pMWdK+OgEcmAxZZ0WOBRJaN8CY2ECd/PPcScb/+XLRV8NKK9l9vzMDyk\r\nRrgfiNDIzZnKtnDm+F/9jKxWppFzMitfnIPP7XBPMXOikZ1LQhwvwHJRlq/3\r\nu+E+/vZhIA12LtFkj9lDI/ceXeK8DD/gXBLYhPu/1UXSMg+2qijb5obnh3CS\r\nbEMVXHFwXvxUBY1c+aP5th8+e1JIJFCSTg70pXgOwplh9wOvrKET1Vc/vw3B\r\nu7YXcD9QoJPHaeXLJ+BujlS9bzp00qNhsH0WzqWoCx52dLLG26yNp2vErElf\r\n3NbwBJ2M2V07sAxOrz94WSyaTkp12GeWw4knfbqPn6UTc/aXwsJw+Ddqr3kq\r\nPj/LylUaPt8a6PuuEJ8fXTC8Bj4bf7hY+w6dzPhxh8nBmRYhExfL6CRG/02G\r\nEnyjMizA4ymdFLRu7dSBszMiwkb/oxM2i0pPPbh0TCpVp4NOdlas/mIAu/9i\r\nq77wmU64M6bGTWF1b/EI1iE6oXan/NsMazrYLu2YpZMXb/+csoWvnG2nLf9L\r\nJxIb9nNthRe/2P/WkpVBGmV1ljvCMXrHU0uXoL9Mu5K6g/n5gUtmR3jRHy1e\r\nJOYKL7mVulNagEFUR9pkPOCuVbdXJYqh33EzzfeELV0NIl9IMUj3m3ylfbAd\r\nrwJrhwz6HRP+O15wySPO0cq1DJJUEqrtDWsx+lrT1jHI0OreSl+4fPWTx0FK\r\nDELObzamwSLvMm9uU2WQb0FiFgHwRw2nY3za6B8HIxuCYP0+jQNjuuj/nUft\r\nQuCM83z2DfoM4mBQ7XwMPvGzbs1pUwYpLJLtDIfZ83J5929gEDbJBM8IeP+O\r\niBmzTQxy798un9OwbIXB67/oH7n9a8dj4NMHhcs6tjDI3j7VgDj4q/DPrAf2\r\nDFK1/eJ0Amz+bvKmMPrTFS//hSXDbKI7zx92ZBBK1/vfefip54ujLU4M8iL/\r\n7alU+Ee+qpeGM/rbsznxGbCrLrveuCv66z9Lll+B447TpG3Q/8rSAlKz4Ucv\r\nPnAXuDPIf1s3ZuXCt7cXd+1Hv6z6rEgmH6YyV9bVIO+d1hTML2DuV9/JO6uR\r\n93SFvpTchjn8nU517meQxNNbtO/CupVPKIMDDDI4U1Z5H/b9p7AjHf27iY+U\r\ncTl82eKC6TT6+4ufTj+rhMW6nv0IQP//zWZy00PYmHu9tBVs9ci54RHsv77Y\r\nThKezV7XUgN/OpdWUIfX2y8/5/wSXvZk6YfLcEHk7446Zj2OneQIgHd6NQy8\r\ngWMt/HZLwA8Vqek22PqPqZA/xqNrE731I2xy8NiazfAdv6ybHcz1bqnUkIYV\r\n4ytYu5m/b/rL9Dfmk1v8dmcPbF+kYfcOlmocvt8Hb313XGEWeeTSOBvvF/ia\r\n5T2bYKyHIJ/Ega/wr0eDtJ9Yr0RVnSfD8Ki2eHIA8gnXVjuRMbi/aOu9b1jv\r\nU4yD/hPM9ZOJaqV7MEjonUtrfjDra9m4iB/2a6/mwpl5WHDkcc4+7HfnNuHe\r\nBZh7z4/nvagP50B1A9Zu3D8f5Ad3b2OQ9ymbU9jhO1vcubpRT7ale8c44Zsv\r\nkhXdkWdqW49u4oKzDF/afkL9mf26kMUNT939TXexZZBqodszPHAVt46ZFupV\r\nV7fOfhlsNJjVFG2J9drRU7AcfvSMy73dnEGUQn6zCcLilwOGFVH/qyuVykTg\r\nOQcLjrdGqHeDZFEZuPLRuL6YJoNE7SwIkIX1LznXUWoM8i+s5rUcfDHwmeMT\r\nZQb5+fDncSU4WCGVsV+eQeidvB9U4BmOf/PlsgwyPC+nrg47ffY+uwTnf78k\r\nidWE7z94L+y+CveDsWufNqydanTjtgSDuHgEGK6H1YVNUsJEGaQlPO6CPiyi\r\nG6A/IMQg9U8eWZjAAYc/RVfw4byayRRZwrI/C6U8WBhEea8hhzWcKvj5Rd08\r\nneRHOu6yhU9orfDT+E0nl5+fXuYAtwccreD4TienN40G7oTjpmzsi/rpxHVz\r\nqREN1lTP8rn0nE5MiiLrGXD66JoGvid0Isvr4BgAr79RoBiFPPXt7bhfCHxY\r\npGyUfhf3t4t8ZgQ8ufCaZp6N/HMw43cqnMB18k3cETpZcfpk+WN4L5truaIy\r\n8tlXuw3P4J2GeyZd5emke7Nk03OYHuCzLlaGTgp5q77UM+fTcyTjqwidbEj9\r\nIdgCf6nOCM/lpJNDuQcCv8IbFRWKVHtopLHGVp3/84iZYf6P3NhLNPJfy+tk\r\nAfje+7+bmlNppGvAekoQVlxY/FXwPI2ML9p8TxQWdZJQuIp8xmuzSXsN/Jtt\r\n061y5K8tLcZ6uvC8Q2XUfQ/ktYHqdD34yF/O5PN4Xu/6ZfjbAP51c3umvwuN\r\n0IQNqkzhiX8Td9W20UiCm67RZrjr1trPRZtoJJUqu2wD73QNHDm7Ac/r49p/\r\nt8BtHM9++ZjSyK1szcfb4GY3d551+jRSdueulBNsvbhQeLEujTx6pn7CGa67\r\nNyMzqEkjL9+XfHaFN3psUn2phvn3qxJ3+MmSFP1c9Bv//bx11QMe5V4h/1UB\r\n8+dUYd0Dh1905fWTx/zllWq84Nw7gx8DZDB/St6cAU/2sQRGon8ROp6X6w9H\r\nMCxdF61E/5O4ljMIFpxPMD2LPKlyZ01tKGwgJM5zHv3Plp+rrCLhaEudGzno\r\nl5w4s29GwSKtR+PWsmG9VkotOQMXetb4F/xDPyh/xScWfiAtNFHxlyI0PYmG\r\nOLiH482Jrj8USTgmYpsKHz+XXxv4kyKNHMvtb8LlhR6OV7+gf7t6MbcQFojZ\r\nbdjcT5F5Q6nfxfCN/Z4yC8inFz7kbimB9c32LFHpoYhyoNK1u3BnyrdAz26K\r\nvOC7N30flp18GL+miyLuhXo25TDN+syNwQ7kj95NP6vgvyxSH6iPFJE9/sbq\r\nEWzhPjyp1k6RapHtV57ACRWlXD/akCe2elq8gKXoNgZHWili+zgsvREmHaFX\r\nopGHB1xZx5vhM7rm5VZN6G9/nTF7D789t6x5aSNFBM/xpbUy12v809em1xQp\r\nVk4daYP3WOWxnEe/al4vbvoRvnndX9TpFfL3vmspHfDUgpGmSD1Fgv6tG+qC\r\nx8q8ZNzrKLI0s8SoB/bpekwVov+9pqt7rg8e4BCpmH1JEYP31V8GmPup7M9q\r\nCfsuaUgchgPD1qT1P6dIQ8hAz3dYQzjmicQz5KEVfjq/mOMx6V3i95Qic7en\r\nYmfgJC8DxwdPKKI4uKA5z6yf+2NDTo/R30dEn1mAV3Vs0sp9RJGdkjydLD0j\r\nZlvYso9/r0Z+rTyvzg7j6VRH4FhH0WhO+Le9g0DSQ4qs/pb9cTFsfZuTdytc\r\nGSenyg0XqK77JA/by9+K5IG5S6zzWeChGq0PfLCvGi3oI/KAlYadggg8qj5z\r\n0wjuedN6XAy2uSsaLASHeru9l4CLNYw2TjygyM1s76PSPcy8F9GVDRPDyeY1\r\n8Jt71wtD4fa2w7JysJJWbYgDzMV3qlERHtNaKsAOXy1YIqPCfP9Slc8dlRTR\r\n25QcrMZ8f2374lL4bc/K1xpwHrekyizsfezKKm24a+Y22wG8nkVENkgXFvxC\r\n2lvg9PuF9Xqw7fv3t8ww3rqRCn9j+GzxtIsk5ttQ92PWFJZULom6ADflqp3c\r\nAH8uOnhnKdaz1SM/0RJeVNS+eA7+YNgvZA1fUjyn5Y/9+CSy6ootcz6Fm3cP\r\nwT3v04oc4O0FVeVt2L/+kveajvCXdYF9W7C/g/F8VTvg0JtKfC/hER9rM1fY\r\ncN2AvhHqYdzidL0brLO1I14S9fJtTc1WD/hUzKyGDfLYT5aFNk/YqkboQyjq\r\na67q8Bcv5vtr20u3ov7+XrxLeTNfT6fVsqJ+WQ6P//Blvj7/rJ8a6nuxmhfb\r\nIfii2MuyszgP3Dw5sQHM12/v21mJ88I33Ml/mLneCf/+fXmD83TdcVUY8/NY\r\nDKzNcP6ETybnHWO+Xt95kv6WImK73qicYL4+IOjC5XcUkTLgKouAi4rP6Tcg\r\nD0oLmxtFMevxy+3umRac/58nnp+GG/32NXb+R5F17x5ax8JD6ofXffhAEdU4\r\nLddEOP5Bevdr3B8a3oyeZOZ+HC/Ur8X9or2p6GAKrLWh+sLTzxQx/CcTnA5f\r\nff3Zugz3l1WgQMo1+G6XXEXWKEVs7O3EbsAc1/QELo0jX6uczcmHdxywpqVM\r\nUmQbd+26QjhAyb0+YYoiTl9Z7xTDLyZpa2J+UMTlhfH6Eti/SUPwzi/cbzlH\r\nHt+FRfNrLkbN4jy7Tb0ph5V3DGSpLOA+1lNxfACXqhyWYWOlEW8hn46HsDHn\r\norw2dhphNPcMP4XpZfK3TiD/Htv4dtFr+L6g38N3gjSSplRCPsMRqqeCk1Vo\r\npLoi83IvvO5ScdUfdRrp3Rgz2w+7s7UtHNCmEWX3PXeG4PVt684YG9JITfyK\r\n1d/h8eNNF0es8HwaD/nH0Yt8crHe4/1+GjG/Qx4rwjlnLAQd8mjE10hFTAXO\r\nPpj1z7uQRpLqRYPVYC1yetHP2zTyqee7ijb87xVbsGglxr/8xhVjOL/jj+P+\r\nBhrJCFhy3B7+yjIhMDdBI1Pa7w2D4YDI1N42AzqJZAtqCIUtArNlOAmdCLwV\r\ncj0KC+4t2Ke1iU60/VyDT8LVGx99SdpKJ6E5PXfOwoPusg/e7aOTBd7Jtdnw\r\nhqAjjbrxdJLUkVyaA98S5ji08RydrC7Q3JgLr3yYKGCfRidm5sGeBfC3f9ed\r\nfa7SSVTY34z7sFNOgyDffeTbr0v562Ge5j0DHh/oJLP0VlYDrFPmuDCEPKwc\r\nuVWlEfbItBQJ7KGTLZIp1u/hYS8V2zPDdJK8XSy6k/l50fvMD6MflJauXvEZ\r\nbpXpu74KefjexK5rvfCFp57sDegnW2JzngzC1+d21UhxMcjKp+vmvsFqh1xI\r\n/UoGyU9oiPkBT/J+yA5A/tVzo4Sn4dtFTv8kkH/r1/HlzcILlq0eddIM4jpd\r\nov0HfvRl22N/5N+R5w7P/8JHT72TlFBgkLBzPxxY+nCe4tKqy9FfL92d2sMG\r\nr4n33q2B/vuy8noGJ7wr3oCtWINBVOba/y6GL8Xz3JBDHn5cFxbPDbfEd1vm\r\nIA9/3vu4YBnsEB+ZkGbIIDKXNg2IwubxDSIRyLsbpiYOSMCWvDWrvyEv7Nuc\r\nPiwFb0x6sG438kRUjhklDRsvv6vehLyR+3tkYg1Mzt/UM0Y+eelwwV8ONhK8\r\nSoodkCcLjH+ug9enXbQSR/5dxPY1WAlOafw4MIk8JL8z+bcKzHGiTvTPDuTH\r\ne/rH1OHD6mV2i1wYxJu7f0ETPtp77dRy5OHCKh0OPeZ8zcPH5ZGvlMU7+DbA\r\n1kt0njkij20JjDpnDldXyUzvRv6lv1YRtISVKX4lP+S3xDUf0jbDmpILu4OR\r\n70qOnhS1hXObRi9E7GOQty0Kl+1gwZMfX8UjD35TapFygMU16hYuIi8ujzqW\r\nsx2O6yvVuo48qdm5VnYHPM/lv+4hvE27Oc8FrqpyS9wIB8aHKrgx15Oy+Pka\r\nry81eq3qCZ9rFn/KzN/rrxzS94V/ptY6L2A8Lr9Eqyk4wvLuo9Nw6JbnJgzm\r\nev/OXLMMrvorZB4Eu7j7T67CfD45PakNZo6Xz93pJub755b35iNwzhOLh+qw\r\nxCKBN0dhNX8N6QdYHyOPh3bh8KiMxBkzeFf5/ncn4VZeW5uzuxgknI/P8RSz\r\nfiI0ihOxvk8ee7rGwGM+87SLzqiPVYv2n4cb9M9P3cR+7w0pGbwAO98O2XYL\r\nefRUs4vPRVhSZtf9uzYM8uJEEf0y7M+97nAV6unLB8epLFgnnLftMeptkfpC\r\nYA78e+q77vONDCIXkz99HY450H6xzoxBLHvsj+TBWz49mn1tinrQm/tzEz7O\r\nfqPglTGDxCRfDy+CuQ7dX3/QgEEKhmxZb8P6Hc9ecqxnkAYyfeoO7Gvxdvs1\r\nLeTpnMzEKrjn15J4ETkGSbr560s1062K4d+QR9+XbDV+AnfftzlUjzzq8ph9\r\n7Dnc6Z/gGIr8mfly18Zapu1vW9ivZP57VkVGPfxJrVlv3Qqclw6/zY2wxiS/\r\nZDsPg+T1vbzazHSTxrI7SxhkaHjV7Dvm/G5vY41ZhPw9dWRrK3xk4Mb8OzbU\r\n62xLXht8Zhct6dwCndz9p7LQDqe2acs4zNHJz0UxTh3w9a3zpfzTdBImZMTR\r\nAz8xi/uUNE4njyTS3PrgxqpttK2431hkv90bgDu0xFiWfUG+1czdMwzPri1Y\r\nm9hJJ+e28jz5DrPy1B2Kf00nN2M7j3D243wFLl5Un0cno8m67xbDO/VzvR/l\r\n0IlqevI6btj1H3l97zKdlOaZf+CDnePCkq+cp5Mnz4u1ReDQG+NigeF00vb3\r\n2KQiXPzmtcspJzphD5D0sodX/i5VN1ugkXtVypPb4JnY+AznWRrxZDc64gS3\r\nmt0so3/H8/LCzoSdcPLdz6OXB2kkqOJi2X54yTk7l99NNDI4v3zREXibjbLG\r\nvWwaubBJOvkorMZuZfsKeXdDorpYONxww13W4gKNZK/aqnoKLndd6eQeSyMu\r\nG+J3JDD9PLY8JpBGXp1ZlJ8Df7p06EivJY2EvhXSyIUfBTSeo5BP5UTXPsyD\r\n6UWyJ9WNaSSycGNzERzFYxA4rUUjBo0nZ8rgu037XSOlaWRIKDmiEjY6Mbnt\r\niwT6AY/spQ/hOrUwWyvkyR+Tj1Y9hXmSkkz5ltFIscAfywbYZ2vV2ox55AM3\r\n7vdv4J//zFf9nUF/nSvq3gyfvNMs4ol+pnxs3eA7eP060eJw9D9eOnqHWmH3\r\ngw+i2cbQv7kcTu9mvr+3wdhy5Ls3V6NkeuFzNz+9TP1EkbDhlOJ+WGg4LFsU\r\n/Vpb2L2nQ7Ck78Nt0ugHk65MDn2HG32NHqijX/VMLbH8BVd8NWD/hn5YPYGR\r\nNwOzHNDfUoJ+myVajXMO3jyw/iKd2d8fm9w3z9zv/LBTCuXIA0ElNQvwPg4J\r\nLbFSivhTDGnWATyfPB/1cd+jiID7ZDcnnCzGsmHsFkX6tpcYc8GfQ3KmOoso\r\nct+GcZkb3tK6IaexgCKOhpOuy+ClidEsJTcokio22SoCe7EtfeJ/hSIHBEq0\r\nxJnv71FM35tJEV1uxnlJWKZ6i9T2SxSeR2pTq2CG6GTjxouY/++JrTLw4+Dk\r\n49qpFMmbun1bFk4vs85STqFIyDCdVx6u0Hjz1v48+tNeVUoB/nBrC/vhcxQR\r\n+TjRoARvV2zWuZSM/PX2toIq3Jxn7/0oiSIP6ukx6vCkzPuM3kTsb+XEJh04\r\nXvy/fwoJFMm8OPHUBJbm7XhVFUsRKun2KjPYNNZ9vjuGIkZn6OEb4WrOblV2\r\nmOeEatcmWC9y9x75M8i/wROGVnDpQk+KzWnkZfrtDGtY4+jeWkY0RY4foP+2\r\nhR1m+mdTotA/e6i6bIVfH1EwnTmFetkxUe4AW/TRjmrj5xNbbgs5wjXW9yr8\r\n4Seb6EE7YOf70z9uw546ExpusE/UCUoB758jOFG8H/aXO7dLCp8fwHN76UF4\r\nUdJ/l9zgDRx0Xx84cka0LR3u+zEuT4eP1l+zW4Hx3xu9dfoQPK3+9aw9fKqf\r\n9iWAuT6XlOoSYMcOFfPDzPVhO8T+GpZtGb8WAl/2LTXlwnr8bLjFGgazKjx9\r\nXAC/rKF5HoOfSYwva8F6plWpPAlnfj6/2J75s6iPe+OSEfALdst7a+Mpkn9u\r\nPP0ss77ezU03YP/6GvYqJsA3nFSkebHfUhztD5PgsE+7bbaiHtKCa7ovwGsH\r\nXmS3oF7el6w/dBH+4z3zSgj1xDtczJrBrIdxhZ/O6RSJcrsomw2fnE606syg\r\nyNMLPOU58I6jzwKkLlNkvjHCMhcWV05qKUP96i2eac9jrreiGv1pNkUCCeVb\r\nANfKN3O9zkFeWWt25/4A8/sIWwN/4TxkeZSblcNrpCZ5WYqRZy8qtVTCuyWS\r\nbnLfpogD98rpR8zzItLctQrnLX5j3JmnzPkIMUIVcR7rj7GIPofLVixboYPz\r\nSiZHDOthFf6tVtbI28fWeTY2wAf5JvsckZ8r9/zn0Qhf50k6vhv3wc8M62/N\r\nMKfQWhUW5F211icR72H5PxzSOci3Ug8u1HXCL9Oivsk2of6/L3H9PMDMN/sH\r\nXuK+SVM6MdILC3mZtx9AvuTN8uH9Cu/R5Hh6sx3rE2myfQpeaDyVpIx8+Ml2\r\nqJvzC/LwpQ/UzTmc/x7DaVXYle2/9njkLc/cyqMa8MOPviFfkbeUvXVYteGA\r\neywrNyBvvZhU5dGHP+9T3j5jQCPfF6RlNsL8L0417kHespPksnOG99ep/T6J\r\nvMW1s/XGCfheQXlNIZ43x1oop7cwnf/BkqZVdOJrkVHyHn7vxBJwfw2duDyo\r\nW/IfrJtp+Sldnk60smUef4SdZdsK96nRyYhvu1w/bKr3w+a3CZ24spnP/mKO\r\n58W92tUedKKrIZ4pPoj5xY97cOF5K5tr9UsS3qLv3z6YjfwlHLx1NWzkq+Ob\r\nd51Oxuffsq+FE4dCBBYK6SS3/jSlCj8dnN976wGdrPD8bmwGlw8s4uBBXmJp\r\nWZW+EV65Zl17xSc6mdi05fsmePG+zcX7uumkQelmnjV8pOF7YyD6h8iZXcsc\r\nYYnUNYePfqeTb4mveg7AV+Sjn59Fv7N5YzHNBxZavHZQgJ9Brs0kzvkxxzP4\r\ngisT/ZGjp6OgP3zyBoddEfLRA43PlkfhTWKGgWfRjwkMPms9Dg+aZeu5If9Q\r\nGbl7TsJXfdkXlJB/pNh9j0bDvQ9exzQi70S2/rydBO9xcc/iRz/YEfPB8DzM\r\nevLpvl70i9rGVfUXmK/Pl1W4t4FBEqYuO12EzZpjJiLRfw7eONF3ifl+02P3\r\nt1sxiOnOvYzLcISUwxFZ9K/pfJvms+ApTs0MN/S332vkY3PgbSaqRmrof21C\r\nuFfmwn8PK3azIe/kKo1fy4PzbsmdbNvGIAufm9UKYK5BGZlC5J87Vqmbb8O7\r\nnMQPOCDfCIqtPl4JL9LmmchGP05rYuN+CN/x40oORH9fG/kl7RHsep1D0xL5\r\nZNX6+jVPYY4OllYx5InQ0cI7NXCJwN/DE8gb77ITjF8yf9/6t3CNN4MoOh5q\r\nqIOHwx5YRPgiv3Ftd26ALTmmbcX8GKSrWmfgDeyboLn9PqzrL+LfDMevZLgy\r\nv++ZvPbP33fwSHbR7i/whsSnwh9gtXuylDAd/e1uG5teuKJtZfTRQwzyb4Vq\r\nez/8aff2OEF/9M/1/F6D8PxQ0rlb8L1jP6aG4J0Bby5aBCDParSFj8LH/3Bl\r\nfYb3f6lcOgFnR23KDQ1Efr2Umf6Nub68kYXLgxhE2C587Q/48KLWtZP4+SG2\r\nPfd+wTHd6lnS8Kvyjaaz8KXyhJWOeD8ZP7k3c3BR4kjiaXx+a8vol39ws0nu\r\niVEGg+jfCBbl/or7NEt4TxnmV8rFfZQHzrd6cfQX1kOdutLJB+t8P5SmAxc1\r\nq5ssh1delrx7GOspp/UiewU8vanhdZkP6j3NmXUlHDUZPPgL6y85N7JXBPa6\r\ntIZVF07fFf5CDDbf+FY8+CD2/9lyOUk4MaXq2VLsX5LsjTOr4O1pHdEj2G/u\r\nGL1haVj80vzmV6gH1q27i+XgF1dM3p9GXpvoLNZUh//k1/SxIk/7EnJBE+4q\r\n6M/rQf19ud7ySxu+Xszh98SeQTp95yr14S13LX4cQ353bkoQM4IFSw9WuCHf\r\nv9eQPmYCd5THHDXAebBLLe0icHVlgamoBdZ31tJ0I3zqYQP7LPKauXvH1U2w\r\n9ePRujbktadP6GxW8JL6/OhiEwYxXMO23xr+9oR/Qt2QQcpPp760hdsqjuwo\r\nQz7LFey32cF8vwuSs7U476tCg2+5wL7xpz1tcB9kdCxZ5gbbR03WNyOfnbum\r\n/n43nBfw7FK7OIPwLHqhtRdO8FVk2yWCPOjjnLof/uuZ4tsriDyrHu7iA7+y\r\n9zJkfl9hLmV5lR9sYNl0nc7NIIdncsXp8GrT9Tw/kMeox6+7A+BbNwN9S5G/\r\nvkrvJofhi/cqdrIgf+2N/p4TAp+s/mNt+wv3ta2o1zHYremU0sAonbSWFNeG\r\nM/e3vU5c/Sud2K8g6yKY9dOzlOdYH51YfDowGg1z/UwZW/GRTrS9S/2TmOsr\r\nnHtrYy2d8EVtDb/GrL9ofn/PK3QiGjDSkgvTuiW2N13E/e8ZrZAPa69X0DFC\r\n3jI0ethaBO8aNPstfIZOvH/KKZXByy0DI5oP0UnN/oUPdfCn+W/ztI100rjt\r\nkkoDfOfS5FETYzppJ9qn3sDRuhNzfOvpZFLCV/UdHEcbnS1RpBOJ//6L+gQb\r\ndn/5ObWcTuSfH/rUCfMfHQisWUonmneXqn+GB4X7v5/npJPNCWYd/fCIXc83\r\nrd804ni0U30QfjbazeD4geexT8jpIWY9RHdNtI7RiJ+zQOcI/FKmk3YD+S54\r\n0y2NcTjzyaexwz008jekd2qCOZ5KUdv3HTTCFvp/iyfZrGM6QsvqzCS8detL\r\nJcNPNBIv3d85BZvJF+t/bqGR9GXhmj/hY/PnLU810sj1vyIx0zCj9YiTfB2N\r\n3B693zUL7yn23Pf6KY1UfbTT+gNfjrD0Z1TRyNuyqO5/cISGUELFLRrpuL5K\r\nm21oxCxoyXyGWz7y57mqWA74YG/fzX9XMV7aN+0l8IXEOy8skTcV5dzjBOD8\r\nUZv5D2E0oiM40yMIZzzX5D4WRCOE7byuMJyQKSqymk4jzt11veKwasb5yNd7\r\naCQqTUtvLXw+JE+geDONdC1a+mU9PKHdpEkTxfrqutEMmL/PPbqjT4BGGryK\r\nfhnBrH2Ljzrz0EjlC5tFG+DweLPnZv8ocj4yXt4W7vIO/WQ0hDx5r7PEDvbs\r\nbVxI76PIiV5lPQf4pvOaNb86kT9Io9UOOMCiye/WO4pYLPD6esJLZGX/Mv/e\r\nUq3i8X0vfPbyEemwMopo7bod5gW3CDRvaiuhSGH8Aps3LB4r66tZSJHV1XZx\r\nvnAWa1hiYi76vdGsFTRYOqz53kgW+j3xyUwGHKiXsM0P/fHckaTiIPhNLtff\r\nXuSrQwWftUOGmH8Ptth2BXnpa7vaoyOw7PKofBf0963r3zaGw8eP/3NoPkmR\r\nkl/8kzHM+TtO51UzKCK3dk9IHHN8S7TnQ/woctnx7r8EuO2pv4PWQYqsiGKN\r\nSYaVg0vyJvZS5Ox9B/4U+KTS+J8CD+Tb/pz0VPhUn6KD107kQYHvq9Ph3yn2\r\nBtQO5CWzDQUZcJPT0T0ft1Nkv/95jSvM/RfJi7FwQL96te9BNhzR8bbkvh36\r\n8beaG67BLlf+tK22pYiJWsu2fJhLxmHtHwvkyfEVQXeZ9aU0/6zEiCKJEvvn\r\n78NmE3LDEgYU4bQtjSqHhe848J9dj/78KAfvA3jM/9j6GW2KfC90TH0I12rn\r\ne+zXpIj3p1zJx/DVmXfR79Qo8nnJrxtP4eAH88UmKhTZob9J9TnMN5MzcVmJ\r\nIm+8U8tfwgv8L+53KSK/pX8xqWe+v+JgqBT8oE6nrgFOMucy2a2AvCzX9qGZ\r\nuZ+htvU98hSJGFj5+yNzfbpbO/tlKSL2XHhHJ3P+L3Z4a8D3ckTud8NOhe0/\r\nwtdQxOakKH8vsz6Tdp54I0ORAQ8xWj+8/3Antxh83Fi84Qs8utMj7aA0RVZK\r\nSMgPMeuF9EiXrcZ+z0lEjcB/1u69xQZbfZTsHYPlz21P6F1Fkd4KKZNJWOX+\r\nocQW/DwsbVXmFKz1X0LSS7xf0XZpp2n4o0j9uQKMh69J9tU/Zn1fNUrzx3zy\r\ni9fKsQ2PmCXXuF7ctw75KE7uFAecNhCc7oT5+1utM14CG627m6GP9eOWV8hY\r\nCm+0bspUUqbINU7FGV6412/0siTW23BA0ZEf/prAlbVMFfVbo3RXAB4vWZvN\r\niv2h5SjzCcE/3m24+gNedFLFTxh25d1w6ZIGM++p1ovC4q/7Yme0KLLeWG2t\r\nBNwdeyrMSZcib8XVI6Xga1ayfvf1sP9z6p9Xw/sXvXRbbkiRjArNS2vhkVOL\r\njBtNcX7TtKbl4Vsb8lWUNmD/g7S3K8KHWK2kYs0p8ldDl1cN/nU89p/5Zpxf\r\n/vW+GnClkeK3azYUUZ1cX6cFH51r6GFBfXsW60fowayhPDXV2yjy+6xBtwH8\r\nQvfWPTEn3Ec+hobG8JlfW66HOlNE0coo3RTefH8ipc2VIs/ljH+ZwUUUjWXY\r\nnSLunCbbzJnjZ2sP3e2JvNlvUmIB56ZtmPpvH853DvGxgYVqhPuY379+csKs\r\ndgvc5By5U59OERePDWvs4dPjY+9L/CkSK27e5QifEK55fjmUImOplg4ezPWg\r\nqBvBp1GfZ+30/eGXjXn2Orivygs5XgXCHlwBvM9uUqSqocolGJ7dYNxge4si\r\nNdzyoUdhpcqWjfuRn1vO/iuPhp1zWdan1GO8Z+9oZwwz+10hlf/GKaITJ6D+\r\nHL7oF+QRa4z7Oq5NTmgEeeuhx4fKbhqx1b1QKAyn6qlVH+inkZ4eB1Ux+G7Z\r\nv6uCQ8ijuo06q+Dhkqu+h6ZoxKXnubkC7JLb91eeg05mte/uNYZ1Ew7IXlSg\r\nE73uuCwvuEhGfP4Ig07exGyW8YbPXzgT8SqQTjy1Fuf5wgcfTOe+CqGTmJjI\r\nWwxYgP2/0Vcn0C9oHqk+AnunnTvSkEQnoWcOfEqAhR5xp74uoZNKdbOV5XDx\r\nsS2vxobphH62hF4Jb3aa3W0xjv5lQLKuCv6icn06+xudnLs4F/IE3mOX9bFs\r\nGvl54f7HetguT6BnLxuDiL+Ru9IBjzn+GasWRX+6NvVXF9zul656UwL93gl2\r\nux74VITOoZRVDPJTs2dhAO4oZvzwWcsgby5d8pyAu+78eOeshn7wII8s6yju\r\nA/31Z3KQB7WfhR1jhycLPj/iRh4cERtu5YTLxWJ+Bloy++OX0dzwlr/teyzQ\r\nL/Ot0+7mgSUYEekldgzyIuKa7jJ44LNCswjyX1gHf9JyeNvXvaP625EfdE58\r\nXQELiRj5saM/H0wcN10Jt1sJjb7ZwSCXh9zSReBLRyZ805AHuS7rbZYcZX4/\r\n5KqvgjuD9LJ9L5SDx7I4fbciD6S7e7IrwAFvu4dFkP/sypvclGAt1kqfPuSH\r\nKp8iHnW4aq+vDzOfHHou6qUJH03ZOGyCfCMnGfNIGzZ5IeHDhfzWGTwttB5m\r\n/fVr6B3y0Pm3++n68PO1zd6ZyEtWii21hvDPHOMCLuSrhVNmq0zgjqi2yKXI\r\nY6VdJSEEfnGQ4c53mEH81ku93QCL2XDpLg9GPsj6oGHLXO8PfpclwhjkgP6f\r\najvm+vRv36ZzlEHOtEpZOcD8k4ZcdscYpIH7gMcOeG4RT9CJcAYZuxE77AKv\r\nXfFTIf0Eg/Ca3Qpyg/ulOj/fOckg9iE/z3rCb3SLbfoiGSRAQGTlPnhmwwXW\r\nP6cYJOWWYY4XXFm5bPJlFMZrtVvZG76sNRbbDrf1R1b4wmdu18uOwrPheRto\r\ncJDCjSd/YVGxhkbGKPM8Rezkj2YQd/vlA0GwQoZBsg4cPqrNCGHur5CwkhWc\r\nfdpl7ghz/Ek/Xu6E+6qz+U/ADdHFf07AHC7PMyPgCpbYtPMwwqxcFJx51Evj\r\nBuytoGocC1P+Ugcb4LMvHOrjYOexOdYuuGj34e2JsPHBD5cn4Tdz6d3J8IT7\r\n63kFeCK12icFvnWy2JAH4+fX6PmZCjNyE8ImsD4ab9hPpsNX6+kP3kYwSBCb\r\nTdoV+By/xvpUrG/aFbr0VXi7tkBwCNa/Qu988TU4yuVHqetx5Cf6x5p8+PDV\r\nMk0p7J8E998thfD6F2n+LNhf4xurPxbD3kMhd/pCGeRkx8HJu7CruoFqPurh\r\nWnBcWCks7ihOi0W9PF9ewlkB24bOF/mhngaK3yc/gB02CCXIot4WWU2LV8Mk\r\n6H3Mg0MMsq5fNP8xrJqXFGWH+t0cbqz5DF720fZkP/J5fGmUVS3cY1wXwot8\r\nfXvrzZZ6uJkRFXhtP4M0j7z2eA3fuWbGWL+XQQSkVxx+C0csrj6wB3lau1qX\r\npQU+pH9k7/ROBnFy3hn3H3M8lK5HHM5nekJOzidY5t0dpzKc76p1L5W7mPXL\r\nTnewxvnveD5U8Rme0lHa8hn3w7wHz8Y+uNV7yCoI94fUnFrTAJx7+6aww2YG\r\nIanbXb/C9OvHspJw/+xVDxkYhvXS7dc2IU/fOPB4bgK2ODWraWPAIEN3zu+c\r\ngs/r7bz1SpdBlP8cqPoB7x97KG+lhfpOWhY2C3M6npDYpMwgNZWev1nHRsxM\r\n5RYtMpXCerLruHLAyz8dPPlIjEGstyx5sAjuS3g1ZyjMIIkXu0SWwKVmSoer\r\nVjDIu967oUvhf9Pxk3r8DCKofLqdF36bPDOWwcMgLsE79fjh1lONfF8XM0gP\r\nN/usINztc2TbCeRnWacPzsJwv/vWoNe/kU+ziypE4a9b16YJIz9PajmGSMGj\r\n6999LEF+XnC/MS0Pz3Iq7OlpR/4ssfxlAPturLPuvovn029xJ2OYLWLWTaqY\r\nTnI3fis1hS89VqB55NGJUnt6kDmsbRSf1J1BJwasIz+2wH+1HVq7T9GJy/b4\r\n755wslzHrs9OdJIy83byNBzSHDB2c5xGDrwp3hgLv7vy4wv5SiMGOTEX42A/\r\nn6DP7cijfdbENBlmKXp1wRX5Uj2rJPES8/1HnC7IV9LIG/NElWJ4xpee8jyC\r\nRhadt/F7B6eKJjwQWUkjnw7IP2mBdfIMX+xfRiO3DNlXtMFlOiNNd7iQ575U\r\nVX2C2xwsB6z+UOS6niL3APz73d1dAb3oNz9zFUzDkcHmT5fcpYhg6cD8LCzW\r\nkFY8j3z1Neap/R/YZvVw+iT6lUTN0Nl/sFBDgv9/6RTZu9jRlm0cz2fJnl31\r\n5ymi26l2lQM299e0fhhPka7or5ZLYB7xDzI5yE93dj7PXAqvW7PuMOdRikSp\r\nZU/ywu3lx9qVgimi/HHHRYFx5r8PrM0OpdBPK9cOisOKGqHKAujfHmxwpknB\r\ne1ptBpuQh2Zdhn6shtNDVl2NQ38YHM3NKgdzPa5dwYn+siwz88w62HRPRuMz\r\nE/RLd5X5lOBgDvqZcH2KBHTbiavDg9ZCf2bQL9/9+TlHE5acGCotRf/9jdt/\r\nnQ58IPd6+iXkCzVptpL1cMLBDl8Z9Pf09Sk6BnCZ4grjIkmK3NoiW20Ed4xb\r\nL9MWQ/+3r2yDKcx2N7K3eiVFfJI/bDWH7+h9j25aRpGbed5tFnDbHwUXZx6K\r\nDFb/dt8M73q6R7GHC3lvWNzXDi6yeNc0xYr9+1f8zX6cmTeX5IQt+JE+IZOQ\r\n7fDvNySQ/Y8f8dzgGeUCW22/Iyz0049ku0xxu8H0lUPDV775kW565LldcNrH\r\nVdVy435EMnqFiCcskhSaFj7iR9wzc7P2wpserGJZM+xHMu/qrPWCA/prfeq+\r\n+pFPdbVFB+GrvPQWv0E/4vJzqJKC/+ypzivt9yMXucNMGcz9jd/H79rnR9pW\r\nL631h3eUc4f97fEjjltUWoLhu9yuWyy6/UjKvseuR+BubZaKkU4/8v7I1p6j\r\nzHrZnb86qcOP2Of5j5+ED97/9eNDux9JqmYLOgVf6Lq869gHP9L0PmUuGq5Z\r\nbF63us2P8A7LRsTAkxqj6i9b/Yjtv7LFcbDoUy3DQThOyDIxAf4kv8yp6j8/\r\n0qDULpgMZySN0BPxeiuXOelUWGx3zjVdfN4ZetzNi8z9rD1Wzf3Rj9RGSahl\r\nwJdVXdq6YfO7JkbZsMQCH/cZjPdUXXNNDtzpNbLGDfOp6fLcnAtfaXxprNbl\r\nRwj3qR0FzPq6csz/A+Z/YrVgVxFz/hwucUWf/chj3Rv7bsNZlNaNE1ivv7a6\r\nI3eY9dDK92R7rx8x2ld36D4sZTTSLo/1PXrEZaYMllU3jZ0e8CNVScPHK2Fe\r\nY81D77Bf66uXxj2CHzqJmJzBfqdHbBl8wtzP4Tg1DdTDnEWSWQ1sHf5vdcd3\r\nP1L9TmC2Fi6/MciuNovxfhX1egsn/yx91cZGkZxit6fvYcuYdQ9PclKELeCK\r\n+H/wX/HLxYrMel3/OfgD/N+dZVmt3BR5Ob/6/Uc43vxUUjgv8lTNXpVOeEP7\r\n9Ml1/BSJOZMb08087++fbtizgiLDtoP9PfDiFN7edGGKWAusM+1n1vv2nSfe\r\niiNPf/DJ+MJcH8F8SS7kbZ4rRb++wr7//XhoivPZJK9WPAazOifM3kY+3m6s\r\nKzoNz7k99U8wpkgpW2jQLFwrwcv/0gx5v/5B8xzs9tn19vwmirRvMz79D/7h\r\n+WPED/eJvsiJXtaJEbPH0iT2OvJmRtdTIw74bF+8fMcO5Edv8x9ccLdIlGrD\r\nboo8UjlttxQ+7evVIepFEakfdQW8sHq1RYwP8mPPcRtPAfjU7iV9XIcp4pWy\r\nrVEc9ruZmGp5FvfJY898VXh2/aX5F6UUOSl43M0R5l86L0YJIL+JBw3vgNf8\r\nFDncIkIjojJ+Ia5w5WedZoNVNHJPzTXFAx5Tv+6irEwjA9Y6r73hpmU1jXst\r\naMQqYtzgOJzc+K+iOYxGlk3sEsuDX8bMO2bgedT50/HmTThsE8/zoUEaufnH\r\nRrcILvsnrrEezzOyxGDbHVg1yJC39TeNBMiuPFsFr7qfq8+5nE7adjb9boJT\r\njl0vsjSlk6w6k48zsKvtrX0jKXSScHzQcA5ekf21szCdTo5pJWbNw2+mpHf4\r\nXaET1+yufayTI2ZmqWlWY3j+CoYcm+CG7X4HikpV0kmsXBW7FHyFI6TLFs/z\r\n0M49B1bDBQdmyrZ10smB80teycCL6kISXXroxHzBJVEelowLNd0/hH7gvxkR\r\nDfjOUuHMnhk6GY/LPqoF767Ib5f9QyedZpbdOjDPPr2VPug3HtxKu24AL3ng\r\nem6KA/1ttI6qOfP3D1w+wyaA/sqwK9kCLuFXeWkhxCAOU1E/rGD36kdscSIM\r\norqrtXIL7Crw+fgK5EnJFcfE7Znje8x46CzDIDyv1oRvg8t8WH5nIl8Oawdu\r\ndIbvPpEOkkW/1T4ilucKmxYFFW5D3qy9WsPlDo+mLl/8QYNBcnkEmjzhXTSb\r\np5/Rv3kM3HHxheXEnmhOEQbZkuHykII/c7onHd7IIEb2LFIMOGNqdvQ3+kPR\r\n6q39gfBCneYNNhvkxYCZTcFwxf1m1jNbGGRaPvtmKLwvi/JYas8grSkTtOPw\r\nf4fzhAWRP2s2p709AUd4bgxKd2aQu/+MtSJhA9uetxLod6+WfUmNghMcdRc5\r\nIH8m+iXMnoavsvSEi3kwyHFpHbdYOPBW7Ez/bgahPnQ+ioMtdmodurWH+fdf\r\n5VPJsPL903sI8mn9qY6P5+EZp6A+FvTjFi/OqqfC7LN79j3zRj7cNNx1iTk/\r\nY2OvDcinNdHp2pfhvM+Kg2zo781qLeOyJpnfPxY5+Bz51MQyT+86bF33w9sc\r\n+aD6jFPSDdjJp3eYA3nCsJ5jMB+W5mn2fYm8UcVValQIj92uHo1GHtHbvC+l\r\nmDke+0LKIoz5/zsRGLkNTyubvihGntFpeEbuwoa5b1UqkUc1bVZPlMGO53+w\r\nNCMP3YlrNq+E5ZdE+35CXlJ7E55ZBdNOrmz9gjyqvKXL6gkcTdfPn0fektua\r\ncb2euT/WJ7YonsH+J22ea4Bjn/FX6MQwyJq3s/aNcLPetdVmschH/Dfzm2HB\r\nO1pnbc8yyGoH54V38JDcyx/OcciX5xY5tcIqWTt27YtHnnhfVtTGXB+hoVp6\r\nAoNcFvBi+whzH5C5JJvIIOLbBV07mO9/6PHGw3BGyvOSLjj16M6Jl7BIa8Ci\r\nHljv9HT6yiQGWen07v4A/CJTdaIC5ndO5JuAL9Rmpc8lM/OBsdc35u+/M9ho\r\ncw55vH3s4Xf4b0fbeCbM7WrjMwN7TfFtND7PIDGX5p78hrnmC8cT4MWfClbO\r\nw02LLNO74dNirrQF5vsv79+gloJ87Mb1guXbiJmuxInxE3BkZoUYO6zcxMF/\r\nDGbtPODPCb8zOdPDBp+UWFm/GD5csuRuLN5vwf2lFDdstzo+gh8+diXoMA8s\r\nd45v20WM70/Xmjd88BvWczJS8KxH5JEVsHV/6nMlzC84W+OtECzjKHLhHub/\r\n63OPnAhc+yJjvz783dO0VQI2z8vmtMT6+edMKK6Ch1bKtDVi/b/1XomQhhPP\r\n5OY5wuN751XlYG6fAsu92K+2Ac/KdXBvfmRrN/bz6YGXZkpw1KDbHje4cEjh\r\ntQrcNnWFYY39v+Cb6KgO7xNZk9eKegkf+96lCX8zudnpgXrypjsf1IHDvVRW\r\nDCP/GwWsDjOAL91bf/Ivs/5+RrEbw/Ifq8vPIO/zBw/Hm35jPh/MxpejXgeO\r\n3Ms2h9/a2u6UQ76PjzB/aQcv+uqpvTUE68FeYOcAp/IO+n7E+fKM5m3fzlwf\r\nbb+cfcjr1osD9uyA7+z89mE8APk5tm3EBT6t87U/DHldaqlhkNs3Zn/0lfGH\r\nhvsqIfvvLrji+tc/R5HXO5K9+ffBgwJDK44fYJAXAo2XvOA566Hsv/uQ3y9o\r\nrPGGBSOHlMJxv0Smz+nQYMtvQxtP4H5SvBrvFgIXvRkOjNiGfCozNXDkG/P7\r\nXCP/WHH/LVx3oh+Duw1G4iJxPw6trZoJh6f9R4TZcX++z5eKiID74vhkFaxw\r\nnyic4o5izu9jUH6yOYPkFX1NOQ3vketQnMX9fKTkTl4cs15q8jXq9PE80RBS\r\nT4R/8fOVqeI+t71/5EEyrOURpJemifNbseFNKnxvlph6KeE+fNw6lQ3fVvlk\r\nyy7JIPeI/tFr8HgYeesrivNbc4XjBrPe6/O2v8fz6bQ5W2I+TAnxftDH8+tQ\r\n7QHhQuZ89wbuzOFjkJ1Wr68Ww6FOyb83ceM+bVBTLGGO54T2sRROnO+mWaNS\r\neKr1WITqPJ0c7JKIqYerFLPSMtroJIhPc7ABbvRstNF7TycnTS3NG+GH6fMs\r\nbY10kp7jz/Ievsjl5rf8JZ3Ue9WGdjDXv29byMQdOlk3wfCZYJ6/WP9C5dN0\r\nMrJQYy04hTzxfjvbaQU6mVZrv7kSfqlvst5zDZ2w7RlfJArvyVlHGUjSmX8P\r\nei4JXzr0978JfjqxOUMZysMBPPkFzO8DFy9bqWwA69nOxu17TiO01T68nvA3\r\nke0VT53RL53XytoLX9g0tsvdnkbcORdUveAdjGiOWSsasR45b+87xfz3rgoH\r\nNQMaWVdanRIE0w9LjF2RwOst+cViYTlOiVi9fvSHVZ8K42D9kjxv/U6KtCjf\r\nMEyEudw1rAz+o0jNcoNdKfDIPYvFRnUUye7Yd/UK7L3PP9q0iCI7GRVy9+Di\r\nQ3U6G0Mo8r43oqIUbqn14rXwp8hmR1urCnjrKo4vVn4U0dPv9amGvzeSC3bo\r\nR1eyL71Vy5yvUtV3V0vk98P/Gb+CPSJcGtzR/3IOZTe9hjs+TufsNqTIsZ2+\r\nu5tgZ83UI3t1kJffaH97Cx+P0XLwUqOIn+m/ky3w16ltHfqKFOm7+2p5G3O+\r\nG6P3/beWIu/SPLQ6mJ/fPxzIgzxstUThRResqSMxny9CkadHfzj2wNVRdlEb\r\nBSly2zMm+AtsLH//QthS5IOWbYuH4PrgLxIrF1PkyibJ9JEp5vc/hG/cRf6I\r\nV7z3YJI5f+9jZUO//QjHlWPW35nzqbxtHPULeWiZZcdP+MqS3perpvzI94jl\r\n1AzcvXOF3cMxP+L7s2P+N+xTuKltxxDy84G8hHmY7T/J5cLIT64fD0n9gzmV\r\nhC7WIG+9tTEsYf2Oz4/gkaQjn1k95iQcsGwb+3VR5LmtDz+8WARfzVnE9faT\r\nH9lRWbB5CSxOW0I7jfzodW/Ldj54Hfuy9T9a/AhVsqqdH77etPxywTs/ElQ8\r\n5b4C1r0kyOrZ7Eci81IPiMDK6mKv3zT4kbPXD46KwU/mJNRP1fuRc1f1D0nC\r\nhrWrUvVrkeeuLP21Ci4/JzM3+dyPXM3oOiIDW7mv3Z33zI/kXyxZkIWfy697\r\n4f7ED/dfxCl5eP3/KrjzcKq2MAzgQkTGRiQRypBQkeJq1Y1uSK4xUySKzjn7\r\nEJlut0kooqIyRCQRV4YMkRSSmaKQDJkyz0Wl6b77z99zDvZe61trfe/jnM0/\r\nnzhVwiAF182WKMEZb7VbJ+CScPmwTfD6hPNLx+GK0C+iqnCUWxUZhesv1dxS\r\nhwW3CXoPw+8vsBI14W/V0T0DcN/ZXfI7YFZk98p+eOS0aLo2PGAvZ9gLf/XO\r\nzyXwq9ms/C74t2ew1p/w3pK50Q6Yx8O6RA9+Eqwt/R4WopT3/AWrmp63eAev\r\nZPysNIBTJKtCWmFJ11eGB2DJIYHSt7Ccy93XB+HrOaZzzbCyk6eFKaw29Pex\r\n3bj/LQ56783hHvlfOpcxPjvtVjtYwX4u6cubMH67rUf6rWHFZMtRMYyviVnY\r\nxGHYY31W1APMB2tfC4cbLCHlOFuF+fTamxrIgOvsBGqEWxnk9G4/fgp2iitM\r\nsML8B+gaXnWHl3U4eyegPkK0167wpOdDXPTAUCeDRGhNRZ+Cba1LZFVRXzEa\r\nZWt9YYFotwVv1F/ilsgkf/hp68qmZ/0M8kDVZeO/sNuc+kAz8n3Wpu0ZZ+HD\r\nnIUV8qjvAkU+9QuwubDufV/k+5eyD3cGw/NKBseksF76Vs8duA5fdHQadkM+\r\nH11R1RwJq7OHq58KMcmMaIzVLXjjaSpNGHmcQ+CPI7fhmij/E/nI37x8woPx\r\n8LNkDkM6fwvx9J5IhPNygpRt5ej9JncqCT5SKiCQqcAkazkCve7DEUFpOpoq\r\nTKKfwduYCo8VrlB7soVJ3A+FbEyH4ybOyupqMUlF9tX3mTCHlSW//p9McuJI\r\nLCmEV8lzvbOwZpKC8iyBOnhXmZ3nqUAmMQ58nzwNL900M/V7lEl81e1/zcJn\r\nsqfrPGeY5G7XB6s5+v62TKcOfcF+pvGRfwFOn/owPsDNIrGDU+5cn7C+V8k+\r\nVJRmkcF9i/9YBb90SlPJtWSRM/xqLdrwfqHjI7rlLLL86/Ejup/ozw8wp/xq\r\nkI8/JkwQ+EKnx1zeaxZpLhXm0YefpJ9epPyBReR9pjRNPtH95+a00O8sUt+f\r\nGe0Ml5z7KnZfjSJHmgbljsOJDTP6f23H+fZMKscNDpQY8xr7gyLSseE1FGyc\r\n1/Va3ZAinibUgi+cNWmrznLBeVeiYhcGD97n1PBCvs5Kdxm+Cq/812elRgzy\r\nb3S8VwS813x8bu4ORShPwbAo+B5na4FPOkW4juiJx8JN7QZRWjh/o43/vR8H\r\nc+Q89/mWT5FNOvnqCfBk4LZDT4opUqY4UXIXXmufpvVPGUUsV8sbJMPV+T+b\r\nnCtxXnPbt6bA86GHa8XqkN976if/gxfrSBefe0sR11sZ6wpg2bh7cSZDFPkZ\r\nMPBfIazsxX2Te5wiER6SWsXwViOXsMJpihQbXTEphd0WNpyRXqCIyc6KznLY\r\noznY+y3y+cDGH64v6fF7MExd4mITIS7m+Vo481C6w7QAm9ybvifYAGuf8l3q\r\nIIq81t0R8wr+7mZm9HkF+q0iw0dvYX8zvkYpSTbJZyv3d8PL5U81eSohjwqs\r\n2NsLT/ReU6xXYRO5tB/J/fDmxIzzcsjfEX0Nx4bhXvEB9ZbtyKtnC6pG4eLW\r\n35dVtNmEQzJBYQK+GbmmL1CXTSgL99GZT/T3Ic0iNJG/5WcPGX6GZWqp0XD0\r\ni53huzPm4SUvNAZ60U9GKisJfoM/T8ZcVDVGf1y9jPoOf5D4Jfcv+tFFLt8b\r\nf8J1+k4va9GvFi4aUOX4jH74ZKWLGPL5Bu38GW44vDY8JdeaTbra4k15Yf/5\r\nWf1F6HdveAXl8sHH1lsNGSOPc2ZanRKCd/mvUxh1YpMiA9IqAiunBFRvR/52\r\nH1LYvvwz/bzIIddA5O9u6YWvq+FJxew0aeTtmyV91hJwu8UKAwp528im7okk\r\n/PK872gx+neuL7lr1sE5DztD+JC3n0TGnZaBY8OvRgojD3ioBXbJwuzNlSmO\r\nyNsKDSzdDbB+44+iHOSHWzy7OJThWcETPWbI2wfubTyiAtc8TPyUjLzNTUTK\r\nVeE7B9p45pG3T/r1BmyDDcP2qtD/71VcVTugCcuo/ENGkFd6Hj3S2wF/qc8x\r\n24l8YzwewKv7mf7+wTr/zotssvgy05XQ45VhEaYShH5e3qJmD2xidCXxDPKS\r\nZ/kfSnrwhvHy3FfIU0oOG0L3wT9Cv1VKI2/1fhca3w83K6u990Aei47+YmRE\r\nX+8rC2495DcTjZ6HxnBiZ1NLFszbXC30N2wwciBVAnnvGZXDNoPn5mp8A2Hv\r\npbGvLeAGTn2DaXhgLyPCBl4vqTtB5+/bvWaf7OjXFZ48U0O+ND2jY+4A+2ho\r\nXrsNlz4WXOUM1xtv3uqBfOpjPu99jH7dNp27E948093mSo+P64ZWfeTZj2FV\r\nWgz6/V5JqTlwnFJ2DAv2Pi/lJ4k8bFYVvcCm3x8eaxAM8zuftz0J18WukpyF\r\nyzhOPPWi358aMWGHfO0bb7rWBz76ZzpDGn5eseekHz3+rRr/PcP7eca3VP0D\r\nh5woG7WDb+xc7nGOrpfr79xi8Pez295UXIZ/fuBxXYbr/fLrhfgV+LpnRGo2\r\n7k93Qx4VDsvySg0Zw/VeN8Qi6fHcrHEsFOOzPO4i6ybcVVZ6XxG2eeFVHgV7\r\nWBh9rMJ4Jo46r46FN4+0yR2Dh0QtmHFw2emjztzw5h16ZXdgM5Gpe0mYLy9H\r\njVV36ftXKvIpwvwWB8sz7tHX07JYNwHzz5m1svQ+zHXelDvwMvaH1sUrH8Be\r\nmxJqT6Berv2cc0uHB9vGrpmgnqSMWpdn0fWxOXCtJPK3i2elaw6s/b6pfxHq\r\nMSO2oCQXzgiUSh9Cve4cuXW8kF7fnY81c1HPlkFWxWWwecjoQQPUf/zDfSIV\r\ncKXG9lVqWB8Db7e7VMLbewM66ecRK//Y+KQaTrvyOum7L9aLrJhwHX09TK17\r\n7j70+l/i3ACLn3bNTsH65Dj5tfAVfCA0uqQT6ze89J3TWzg/7WvbX1jfLUPV\r\nj1vhkUKFj2ew/iWFiwTaYcnqQ7N52B/S7WMKuuCAwUIBGTc2qVyw5h+CTWX9\r\ndn9DHhdcb+AwAgdtSTNWdWQT8/0788bgot3tti7Yn267K/FNwuMmfG63sX/1\r\nRUkcnoalHXd4N9lgfT/nz52l54ftFsCL/c59cIF3Du401ODssmSTx4Jjdl/g\r\n815tpkfNkee3deR8g+Xj/e6N/M0menZ1PD/g2pdrPrMPssmVgGLbX/R+NFmy\r\nd96ITSSaby/mmsP+uotzkBP7tQbbzloAtukPUZDE/j7ctqhXCD4e1ZjMxP4f\r\nS1JdReGLRstkSrTw90RnfVbBzwpixA9vRT37R/0Wg98zum5mqrHJ0X6d4DXw\r\n8DqZZb9x3lTnBd+ShqVEjxx4s5FN/NeqSMnCtq8XHXaUY5NNQc335eGoq0nU\r\nhDSbXLdam68E5wkMXOWVQH0vPHqzDTZacrxZG+ehwNFDttvhS1W8/dVLsL/U\r\n/ezbAb8MevDJAvleNv6vWV24j2t0hTvO19bFk3674bKyEPmfOH8vUZGL9sK/\r\nzilrhnyhyPiubpH9cHjuQKwNzus7DwKiDemfbzBxlcF5biKqKG0Maw4/1RjG\r\neZ/f56lqBm9dc/P1qQ8UORPIZ2wPt1/Q47neSBG1ycwWB1glPueNVS1F+izN\r\n7Z3gC4/X3pVCf7FPIYF5HD47OqedUUIRkbptoR6wrGmKR1UGRZJEHKsD4dY/\r\nu5ZuDaRI1e2CPZnw6gb+1Hb0W3G5AgnZ8DuDr9ORyhRxr3P6/gh+U/txp/EG\r\nioh9F8p7DNfWljaWr6HICZvj8mXw7krv+f94KCIkLrbkLRx9+0ZRVTuLWN7y\r\na/hGzxdJq+88zSJKma8Uf8CXpbqv9nizyO+X8kG/4LvflpkNuKNfnGvS5ZpH\r\nvTw63T7mzCIL5krZAnC9rMngghGL3FneEbEOtjdkDpqvZZGP13QO6cEJnAfO\r\nXnlO5/eOhX3z9PNEu/SSi5hE08Y/3gD+5x+WwNNcJrkkW9h3EBafDYsZS2US\r\npYKtLBu4qb8x1+Aak7yJbRa2h6XXOfg7hSDvn/V45ACzbaaI/0X609lZX5xh\r\ngzfCjWm+TOKtYhx7HI4RSrxRdpJJpJZN6JyANxqp2bYzmaRqPvQDE/YKLpWZ\r\nOYZ+vkPpAhtOqVgiLnqEScRLa+ROwn6/tDmt7ZikPNm1yov+/VrssUQrJllO\r\npQj4w4UPW0rUjNHfc6yPujhPPw80yclEm0kcPpbuCIZvv24xjNZkkiW1Dp2X\r\nYRY/n0aPOpNYR8bLXIU7zrJ53ZE3OH11Kq7DD4uSph/LMkm6XcexG/D+uZb2\r\n31JMYrbbny8KllTle7FPgkl+yItnxMB6xpVnolYyyX3+QuM4+nr2HoqJXIZ8\r\nMWU5cwdW0h7NvSrMJAmFNzSTYU1FoZFgPibZYyhSlglv4LY08/3JIKOqWUdz\r\n4Offh1heCwwSucKYJw/eMut3yf0Lgwx0hRoWwdo98SWuMwwSVq40WQxntqq+\r\nc55kEM3UmmvPYJmGslnHMQbpDnXdWgYXVZgJ2g8zSLA7b+sLuFs/aMb+I4Oo\r\nWaT4VsL5fzPLPAYY5N0OvTU18/TzUUyvByIvKnEFODbCkSel1B8iT9bf/DX6\r\nDk66U+D+o4tBTvnHh3XQ85MWR0RgKQcdtW74YN4FETnkU7aC/6l+2LLWONsQ\r\n+VVMUFxsEFZp2XbOoZ1BSmcePxmGD/dImHgi77q1WtqPwRpjHNLBbQyyrHju\r\n9wS8dH5wKhb5+H+PylPO\r\n \"], Automatic, \r\n Hold[\r\n Nearest[CompressedData[\"\r\n1:eJwl2nc8l9/7B3AjQshKdjbZO1lRZIayV0kI2clKSkZKJDIiq0QhK0miRCER\r\n4SNlZCWUmZXE73V/f389/3h7nPO6rnOPc+4HPiefEy6kJCQkFJQkJHPaNCPz\r\n/TNaueFjKkvwRE1tyjKsFj9n+AdeZmqvJvsyoyVnlM9IASeiwzx3Qr0/Evy0\r\ncEOO4hI9LPEc+swAGUbi4/fARnbXqb0wwEzjCAcUjmfN5oL9zXPrPPAGSYsZ\r\nH1RTySkVgLlPTJxF4YkfIq/F4A4+Eg5J6HanvFMWcnyMFVOA7TtPRytB2YuM\r\nqqpEnqrpFHWYOvdm4RCRSzTD8DCR67R/gTaRK9OAVBee/I/fXp/IpdfDaEzk\r\nulrsaUrkqotsOUHkkVa4ZEXMz5oy5UjMb+p15Aysvq6T7ULkaOL+c5bI8W/F\r\nzIPIofSx1BOG+xZQ+0CZonBnPzg+bvn6PJGHW5ojkMhjtfNCMJGj7bnYJWLe\r\nCrbUGJgkUSBwHZYVylfEwZks4/ZESMU+aJMMhe64/0iBjjeiyDKJeSiYErNg\r\n5pUc7lzYF1ir/BAanlnwLiPyDV/arIAxNrtuVMEGE+GHL6CSmv1AE+Tf06rb\r\nDzUTLf77Ch12jTsNwXTSrUtjkG5OvuoXXG/O4SX9OqPVGRz0Zz+kf/DMTgIa\r\nd/yul4If+XyvysP2Nrdd6rCVy5bbFDY2qGkFwmoqsuuNMKZe99tbaOEfr9gC\r\nlwfYxj5AuTJp1f9gqYXD7A9YcL/mON3AjFag1VbhbqhDq73FCCcudBaxQn79\r\nSXJemD3PXC0HvfNtaBWhuk2O0wE42Ci2Ww1ypGq56cA0NR8Oa9gt5/HAFtLu\r\nd5FwgFf32Gk4wfpdli3OcJ30uOlZKL9u+MWdGHfuqJMnfDyh9dObmP+rWoAf\r\ntGmRiwmE2rk8RVfg5VR2+UhYe5OlLhrKhNB8vAHP+VBYxcMCF5KRW3DE7q9b\r\nEuQ8sbp4B1rqLYamwUSNX+QZkFJ8bE8OXCL/ePAxlNxobSyGbgtNhqVwePCF\r\nw1PI3lM1+Qyavy/zqYEJr4vWa+H7Zw8j6uGOklyaBqhxPzO5EVYl3H7YAnPP\r\nXnr/CQ44BJ/ohazm5wf64E1N99kB2KLkHDgMySRPbY9ANQHb2HEYxG7BOAkr\r\nd5tmTMFfFIYCP6HIpk7JLHRa0lRcgMYfJGw2YLFvf/UmpGKNYtmGjY4DneSD\r\nM1r7KK9JUsKwYrk4Kqi0ev0oHUzOVMzfDRc0R0mZ4LHJm6dYYFGccj0r3Ck7\r\nwcEOnftuBXMS4/D9kOclxmlOus0Pv57TmBeEd6pTivbDRTstKgloTDrrIgWp\r\njLT55KHL4ny4ImxMzRw8QIyjpquiQowzupSmBr/EZK9oELkkDMy0iDyBefRH\r\niTxcxzz1iDxv1t8bEDloTaNNYH/e1l9r2NBuN30Ocvvv1PWGoXuf5vtCBSca\r\nxwvw0VpNXzi8zc/69ja0pQ4yvwP5Fz5PpMLK+rsU92CvNbduAdx7S7CtFmb9\r\nlesah65jyY6TUOr98sIUfJVazTgHR2RVzNahgJtWH+0Q1sX4vutuWKVIvsYI\r\ntcnf7d0LXbP1bPigVPTjaQG4do4mVBjGHmzPEIePe00GFSHZ0RpHZWj7nPe7\r\nCqTJWJw9BD1PJW/rw7ddfyONINdhZyoT2CGoyGgOhVOzUixh+E5KDhtinpk+\r\n/pMwxu5QoSMcbi8UPwOVNBjKXeCtsmAFNzjFO1rjATWT9NW94EIAx1F/qDd5\r\ntS0A5lr9NA6Cx1XqrMJgUbHgYDiRkzveMQJWbju4xxA5/ZpnY6HTmJR/HKw1\r\nS1uNh8zvtkMTifxKbttJRP7CrsgUGHAj72YGbP9LzZgFBb38U3LgfyZHsvOJ\r\n/G+K+QuJ/HIshY+J3Hu+l5XChJhjChVwcu1ZzVOo4c6jXg3Tvsa8qSHyG87r\r\nvCTy11u11cP1HNGeRmjKeNvqHdHnq38GWoj+urRNtMOXYp6rfcT4htEmX2D5\r\nuexHA1Ds5nPSYZhf0mU7Ank6pp+OwbuzZHTfIQs9l+sPIo+U4utpSGVizPYL\r\nRvqc9ZuDweV3BX4T/ZDburYJB0/sHd2CVudlVEiH8RxM1k8mh0ZVTr8oYHPv\r\nRR0qqLVyJ5sG1u0pXaOFSkotprthueXIY0YoHvSHjAXy1og/Y4M0Kons/DDK\r\n9rG/INwObfwgDJdfLl8Sh96DdJ8l4fSmsIwMdObWvC4Hh9VtxhSg9Ul/1QOw\r\nJzzuzkHY+rr+qAas1OIv1oUSTqo7DGDhVXMHI3ivKWb3cRij8/O8LbTRr1Lz\r\nghrFV1t9oCDdcXN/uNA1ey4IxlqLZEbA6rMZf1Igc8yV6ldw/Yfx4TdEDn3u\r\nj02wiK72eys8nPKbpQf65rue/wE7Go1kGL7huuj5kMgEhyYMFlngLKV+JTuk\r\nM9RREIDHetSVlaDFRF26MnRYUf2jAr32qtQegvF2Smr6MMXz2T1DmHVJ4d8x\r\n+CRH7tUJ+Ky8gscC1r+RuWwF33WXfbOBHeNSmvbE/MtPck8S81NIkp4m5hcR\r\nb3Qh5vcU0faBey4V5PtB7gQhigAoWS7QHEzkWt6nd5XIRZHzKIrIxcpDfQ26\r\niGS5XyfyKXO1xRH5wtiMUoj5djCaPoLOuWn5RXBTledPCbzzOf9YGZQ4L36/\r\nAr6lr1x9Cu2LlA2r4c1RneVaKHipXa8e1rGZZb2Gv0wcj76FRq9C0zvghA3p\r\nbCcMW7mm1Q1ZbtOn9sISiZSZPqjdynnoCxw8cz95AAZsi04NwV2ZZWoj8L6S\r\n0u0xqNJd930CelC3JUzDtqCJkSXoxHxOcQVulC5eX4Nik1tym7AxIvraFrTl\r\nph0kGcH7tSZJhhxeN2ePpoC8CzlfdsKaOGEpGmgq8uQqLZxqlP9MD/Vkjfez\r\nwZH23kscMNjNrpsLPspxu8gHNVXnOwVgf98FQWFIRR/ZIQZzH1PzS0JlncRA\r\nadg1wvpBFrqFZe1TgCRsggFKMP1pUasybJl57qcO21p+rx+CH/OlrxyGvScL\r\nE3ThZ9XxPQbwK9u+LCMiT3dq8XE4XtYtZw4nb9LXWsIZdwMtGzh7NKbVDi4I\r\nNJqchMskW32OcKP2wncX+C+twtONyHFh9rcH3CntQuYLaWjzrvtD+ulBhguQ\r\n5YH5vlC490piQRjkcGiXvAx5VKieRUC+vdpqUVBw+XJTDBT99NLgOpSKk7dJ\r\ngLJuPiOJUEGn+GwyVN3mD0wn+nqeKfk+NDQ15ngIjSVv5BXCEzTNokXQ4gdp\r\neQm0fqt+oAza54W8qoBOdovt1dBFWdL8BdHPPe4DL6FP58h0Aww70kX5AaaK\r\nl2l+g3XPM++NwtEjsevjUML+dPkUbLzJzLtE9Gk2aHvHKK6/cs1XYtBDTZJD\r\nEt5qZQ+Uhl9HliQVoA/jwyx1mOFPfckULip0qwbCq2QBbcGQqWuPzUWocM4m\r\n8AoMzhspvwG36OaFcojxBhKr8iDvY7kj+VBLO9DxMYwK/ZfxFNL82MXQCjOr\r\nnmS3QYmrJpId8Bh3skE3TDTjiB6EfHx1zN9g5ZzD/VHYcz3v9SRkbRDdWICF\r\n8W2xv6GynefeVdgqSl+wDm1WyxT+wpmm403/YOjt38dJxnB/nUoZIYP3JA74\r\nUIwR+87+fzvhq5bQmzTwm9Orx7sh/12dCXZ4eHHOlQue0U+f5oFReVqefDD/\r\nz8ycAHx3/I6fMJx8rL4sCinJfgSKQxHbxD+SUK/yYJgMdKMZ35KDRbWKO5Sh\r\nBOcA/WF47HzUbW3o/UGSRRcmCHxO1YdlF6+wG8Gunv33jOGCeA/PccgYFZZn\r\nBuUGhQQt4QmFzgJreP5m8H47WKX2QcoRHsjyPegBrVfY6zxh8LEmDR9Y+2+P\r\ndgD8avG6ORD+feKmHwK5KJnaL0K1ky+Nw6FDtfOnKzCcnt48Er5+5WgTS/Rj\r\nH6VzEnQKKpu8AyM7rd3T4NvLxd734PfP5ovZRB9kts7nQeHYwtUHUHfENKSA\r\n6IPyxt9HMDbxQXgxfDxlRFoK2zRXI8uhUV5mQi289Wjlex3sLjNRf03U8Yr8\r\nVxPMfOdwpHmM2Gc9z2gl1mXgnH4HLBh7l9sJp6b3rX+C4oshJr1EX9d7Cvpg\r\nxbbkVj9cpoy1GIChe9R2jMB6rlS7MUgiuFA5MUbsg/JPT8PbJrSvl+Cj64Mh\r\nFOMzWj8TlT7thFLpiaI0sKpA+zM9fN1UosAG+/6FzYtBcn9uF1NYWSsxfwI6\r\nkquFWMC6O7bxtjDgedozZzi5yUgZAu/o8CVehIcTZDjCYc4+E6lIaH34pmU8\r\nfH+NsjAPBnftkc2HwuxCLwvg1aIjncVQpePK2jM4tScxogamnszZ9RL+nq/f\r\n1wBLmP7qtkFbO5rudkiVz27fCat/iU5+gi6Kyr69kMf6QvowbM+N4h+FodPJ\r\nJeNEXaGVDVPwVtb81BJRT0qZ7gqUifcpWIMk0dIUG7ArbP7MJswNKGvcgn6e\r\nPnykE3hO2M8PU8AxszJ1KvjU0OceDTRXnbfZDVM45nvZoCtTmTwnVKLxSeKe\r\nIO4j6cV9sO/PnAk/LFgsLRWEQdPedCJQb1TKcz9k+zLXJg6nukr3S8EXrd6x\r\nMtC2Zk5HEWamzTVoQM9bpfu0oNo17/AjkPay1JAOHAycU9WDJd6lGQbwkqv3\r\nHyNofFLK2gTyWM5VH4dzx0r3mMPXOt4BltBRcU7WDuaxzJU4Q3/a0l1n4eEd\r\n3h7uRL2/Z0W8YeXPJzG+MHLc67s/UfeApPYFKNgzez8ILrc9IQ2F7xq9HMNg\r\naq3k63CiH5Wz3BGw8PZs+g1ivDYnsXgiz47+l7eIvwtsHL4zQdwfB3zTIN10\r\nCWkGjLJLE8yBDXdoq/PgZkeEbj5U3rnWXwDPa3p6PIZOQlrlT2H2yWqtavg1\r\nTbynBh6nYV2thzePxF1rgK1hJOxNUHN+RrUVhok6drTBmtP/newg8mcYLHRC\r\n6d7XEd1Evhd3WgaJ/i9R23wjcopfnhkl8mW70/0g8lzVMFsk5jOaGqb4jvUf\r\nUV2Vgo75NRdloYSbIqkCfDsvRXsQLm3x8R+BxtxUxlaQyrb34WUY1uNp0QU9\r\njmaUdUPrFy3U/0H5HP5XX+CMR7/wOLQh015fgUqynJmck+h7vt4KN2TaG2jC\r\nC2c3u8iFYH5rjKcUZHZcUteCJD370o/AOZ1jSzqwTfxRgQG8uuaw2xwuJLwf\r\ncYX6R0q83OH9tYSNc9Dc0ZzFD76Q/aZ7kZhn8k3vJeiZkX/6CuQh97gYTYzT\r\nu1x6Cw7EflZNggrqta13YPziPYs0OPnw8thdeMjWyeceTKfX2cyGS40i1/Og\r\nYRANaz6RW3z2fgHc+tYp/RiW66Xol0IWDt5LNdDrIxnNS9h89XtqPdx3oFWg\r\nAQb/LCpvhJ9y4tXfQTFz37YWGEVlZtUGh+oUJ9qhkh+bXydMFPr779Mk8Zxq\r\n2PsZFpwyNByF28xS/ePQupXBZRJWhv1enIK7ZPvCf0Ln7zW75uCru5npC3Cv\r\ncbjQb+hLdrpyBb6vPnJoHfKfE27fgL09P79vw4MPA9lpfuA5S0VzkRbKeGYN\r\n0sPiThkNRigs/zaHGd5PtSJlhdwbM05sMN0h/C0HZHnDKMwNbwk+vLYP0sQq\r\nT/NBUpNTJcJwbrBETgZ6aGrekYPfH/SsKMBBj42ag9DqYzyHGuyW5QvTgMYp\r\nVUOa8P267qEjUNt+IFcHNrz2JtODqgJkzgawOiblnRHMZxk3tIT7ggOfWMOM\r\nAerddvD2fZnuU5CW8q28E4x1t0pxhuEy4dbucCOZsfYcvLCWz+kNPV99GPaH\r\nP/hOaV6ATtFLeUHQxojdJQz2lpU0h0NTZk3RCHj0q+vPaKjgVuV3C9JHmYTf\r\nh+z+Mz35UNAxen8hkVftZW8xdFsWFn8GG523PrfAjhN3Jdtgv6ZCZDuc5/KQ\r\n+gS5/vsv6isUafL9OgjlKnbJfIP68VoD49D84qDMJHR0D4qZguesmAZnYKDO\r\nE9lZ+C9odHEOkgX/vxHyetfm4U2+8cFFYt12h8stwwf/2GJXYenPp0PrsPaL\r\nsfxf2PUsangbDjzYp0A2hfvjdu31HfCf14ICNRQTto9jgoosayMsUJMsSWkv\r\ntBpuGeWEUanyykJwiHLX9wPQXMnOSwW2uRSvqMGat4aUh2HS1ZsiRpCqcrDM\r\nGF4elVA+Dj01O/Qs4dEtOg9HWCd5cskJyjuUhrrAoptbZG6Qt844zgOm/sxm\r\n9oJ0nPOZPnAj5FZJAPR9/E0hCP7ol64Pgb0HujrCYdkKw3wsFBY6HRQH75lX\r\nbMdD5ijS2ER44+lxhmRIMp6XngKDmJZ40+Gc1uHHGdDZL0k2C37NHXuRA493\r\nyR2+DzWke04UQrZZ5oAKmMDlvPkUUhhVRVXDsIs76F7ApSLzlJfQ7Ws+9yv4\r\njXrlYQO0PKgj1QTb3VKq38HD6d81WuGLFsWWNlgg3Pe5E0ZMsP75Ajma9loO\r\nwso8tqfD0PAKO8MonDjJ4TUOL6lztn2HrFxcIlNE3RtcUTNQ7wv36C84+pxH\r\nYx6Gpu7LXITFZnwWq5D+o+D7bVhYIiRMNo31jROO3AH99ETVqSGNyP6MXfA+\r\nhdgaHVSdEDNngL2N4hVM0CtPgn4PpLwieW7vNPHek2plhwfUpYW4YBenzFUe\r\n6LYh840XZjyXuysE5VPlV0Vge4CCmRj8J6tEJw1TGQ54yEKp+QMt8tCx5GCE\r\nMvxzQ2VYBSa5q6qqQzE9tfRDsElYfUUL2lNonNCGy+MaZUehcJ6muyF8fVmr\r\n+dg08Z3osIApvM6pPWQOf6XoHj8JK28YH/SD1UU73p+HtW211oGwkUYk+CLs\r\nubFdHU2Me6NcIQMqxjHJNE0T5/w+4T0z2Fcr3SnaC0dGjktxQCqlDsV90Hqk\r\nSXs/XFeocFKHysNx2S6wPVaf3w06yu8s8ICxsVef+MB+uZC6EBh8zfVrPKyR\r\n0WKtht43yrxroOAEd0stvJ22EfQaemw9/dIKOduFswZgt1DKyhAx3mVy4xG4\r\nLDeyNUHMd/eu4xwMP0srSPoTz683oWHkcIZjupfiJ/E8fhdNA+lFFYZp4duI\r\n+0q7YegAwy1GKKN4+QcznEyYPcQK703ZpbNBqnvK+txwlGypSBim2zuS74fG\r\n1R/txGGtezGtDPRtYneRg8LcsfUKP4l94eqeAzCpy9n7INQT62lWhVuRWvs0\r\nYNVQWZAmPHeAp+sw1M7+LGsEXQ/+rTOG13p59I7DNhrXk5bw18Pr09aQTutJ\r\ngB00DVq+4Qj9mdhYz8DkJ6p5LsS4eqck3GDf+NXnHnA9vOCwF2TnaOvwgfam\r\njBMBMPyngk8QzImx3giBY3U5DJfhDuumzAiIl6xwFHTbL6V+Hd54e7w1Dhaf\r\numCWANs30ocT4VxKnXsyZJAdWU6Bsu3kV9JhAJlhahZMzfLmy4XPlZNK7sMN\r\n7y+NhZCL5t+xIqj+kPdLCbwycHa+At4PjAutgk2MZRTP4URJd+ILSKm3ylkH\r\nRcfZC19B/XB1uTfwZlWUXjMsNXnU0wo7Zz6c/ACZ+JgvdBHXQZ0SSQ+0sLKN\r\n+49Yv/i8vK/Euom+kxiCA01Tz7/BzZO0R8Ygz4b0xwmomWJm8wM6yQRNTMOH\r\nrq825uBUeZLtIpT461r7m+j3rd2h67CxxvEP6S/kJFe02QENjlG/oIQJaUNs\r\n1PDTaEXwLsgiEdNPB60DbZUZ4AgN+ToLFLT4bLUXuuUUP2eH8/LmQTxwy/7h\r\nqgjkwrFJBTr+4bRQh/lHFqoOQfH+9ABtqEI68/sYMa7ZzSVHmLzWNR8DXdtL\r\njlwnfs+LTYuDYwaahxKhTHZZwl3Yrp0gWULkTjI89wl+dRV53QOfqJIz90Hz\r\n77W1X+EDZTGaCaj5jerxKlFH1cTmOvwR22D6l6hTLnh9GzrtNDcim8W+b1A6\r\ndwcciv6hSw3LbZsyd8Eo6Zx5OijxxTKNCYZKNE9ywheHrbx44Lr11G9eGBhN\r\nQyoMn2VmXhOFyxUS9OLQf9iYUwZWLH/Lk4MLNH6iilCaj6zsAPQ+kKyoAp8c\r\nE6xTg7/OPDt8CLonfjbRho8K3PqOwsm6P/b60Hma08MYPtguWTCFY3s0gsyg\r\n42HHKGuYY71IYweHva/edoDc0cxsjtA+Mz/bCWZWKAq5wK8tzcVnofXyVI0n\r\nTKMJPeQD+3h3NftB82OSPYEw+cwrmxDYHWIychGaFvjNXoG36sgCIuHH7uSN\r\n6FniPCYYEQuNtp/tjINxe3QT4meJc0Q/SyLUs97gS4HXvOMepcHmKC7pDKhd\r\noaGWAyNbOhvzYOOQo34+1KSJtHwML/OyDBXDV0oPz5TCf0ZKM+VQ7UyL71N4\r\nMcR67RmsvTV9qQYeqNsVVw/TI45NvoYbR29pNcK6T0zrzcS4P9hdumBeiV1D\r\nNyTzz+L8j+jrgW+Bn+G7Td7uL1C40UlyEMZey48dhtNGk+Mj0IBJ9NA4LP7s\r\nnvEd0mYVr/wg+iAiXfILmqkrsa/CKrLggHXI2vqicwP2n1CP2YYH2S6Pks7h\r\nfTvUoLYD2rtp/6aC9ZIxxrsgz++Wx3Rw5JKhIxN0ST7RwQm9XzkWSsErLJfs\r\nzKERZ8C0JWTnPxdkAyulbZJPwgkDxQ9uUC9iVuUS3D3nwFEAB5fNHz2Cj/4a\r\nKhVDTWqVE+XQX5D1Ri3ss/345yPMbtH4sgbjL02qbsAw+YTsTWiTM3SGdB73\r\nUVDYHA28LlxLzgODB0+78kLXJOr3/FB7yzpBBG79t8YmC2fjci7Kw0Et3WFF\r\n+OJJ6gMVGBCtKKUNnVSHEo/C44tRv/WglENvzTHIzRzGaQpp3wuEn4DTCueP\r\nWMH+GY4CG9ic20hlD/NpmT46wpMT5dYe8FiG9UtPqGZKwuMD2etMxs9DKv81\r\nnUC4KpLzKBj2Js95XYKN+qldl+eJ72Xq8ldh7rPvKVEw4Vz8egy8xKdodx16\r\nfh6sj5snzr8SkYmwNXLgSxI8+vaGTApRt8700F1ivOh0hXtQq1k3Lhtq6BYo\r\nP4B11yxuPYSqrTsmC2EtVZVaEVTWP5NcMk/83wnTTClUbHujWQHlDHnnnsHy\r\nuE7tGijdHp5ZCyWODem9hsImGQ9aifpv6W+0QYGuddMOeJ/hUWEn5D1utfUJ\r\n5tymtOiFPN3PivvgPSYXsi+Q04zFZgBmJDeVDUG2Xn/KEchq8enpBGSwSqCf\r\nI/qQpu6yAOn6f71cgjQ2hu5rMPbuxus/cOfXx6ybMIbDxmsL7rCjekuygPN+\r\n5nMOckg66OpHAa9wsbbuXCDeD+94aGBYVsAFWvh3SKCdHq6fvBrCDANzZLv2\r\nwJVvI8JscMnxUC8X9MubE9sHF0azIvjgrNOmlDDsm3CsEYUNru+0xGHR1P4P\r\nkvCOR4K5DAz/tTQkB928rc4qQjV/3lAVKLwcRa4OGQKnbx6CEyGVOdrwZoT2\r\nO2MiB/lj4+PQMZqu3wwa7PQ/bQkVrvfNWEOeXaoBdpAqPuefAxxIdGM4A98y\r\nddx1gaV3ZAXciD6kbyh6QbHcm3ZBkIV/cSKE6MMDC+8wOCVUuxYOuwt5IiJg\r\n3f5ImihYUPwjOQaGlJUXxEEn2T0yCdDoaciLRMj7/HB7Cmx91buYAys1D168\r\nD+81Zu14CGO0yRIKoW+z694iaKv3IbcEardJi5VBto/ralXw7BBXbCsMoJeb\r\nbCPW6ZCudgdMz/Mj6SbGd2kOHoCicz7uc3Bmq9GAZRH3kXT/I1ZIdnqWkn3x\r\nf+egJm5oeM1TVQSW7GaVUIFevO50jnAiST7baZE4D2xJuUCDmSRTDyhaVZcc\r\nQPyuy8Bxnfi99mtRHOyReKiaABsZVRySYc7AmdwsaOvzXLgSdo9GPK+C+uZG\r\nes+h8sFR9zrISr7rSTNMuPCf+ntIMZXz8QMMs/U49REutyssdMFzh7av9MCx\r\niveMffBT6kn5AahHvf/tEGy4+Nt8BJY6xgZ+h8I9J3ZOwSwd7vQZeFOs8sU8\r\n3JEVZrAEL+7WHViGSxGMnmvQY3lg8w8xvmtB/Ca0+eLLsw27DFXLSJcwzysK\r\nzR3Q5OXnt5TQsuaxPjV0qTxmRg89y/b1M8CAkkV7Zni1IMWVDd54cPYnB7yd\r\ne9CXG6Zn7VrZB3MzhkL4YWFa2ZbgEnH9RUSKwOrbZlRisD5BKF4Cvo1bY5Re\r\nIs4771Nl4derXrlKcOzyIaGDcDqMsUgVrgc+e6oJt89fUz4CKf1s6nUgvbf4\r\nYT2459y/ZgPI5dZpeAwKuuR1mUBxp/MWJ6DcKZ2v5lDFfu8pK6hlMz1uA03N\r\n4mdPQi/d/0jcifq0C6PPwTCtEBpvGKlheMuXqFOVm+U8TFKeT78A7yq+4Q4m\r\n6pRLvh8KH0m7iFyCZRIHSi4Tde6nlr0K3wk8UblG1LN35dhtOMPS0p0MFxnv\r\nWqVCElr105lwJ/XuySyiHspRj9wl4rp5On8fcpNEBzyER0t2fiyEvtY3RIqI\r\nvpXf+loKPU5naNYQ8zWW0X6AxtFf8xdgsKzD1hLMG/pmtQKXFb/TbMCMyXlf\r\n8t/Yv+lSqLPCcBqZ/1Qh8/rZ0xrw0fecWU3Y3bCb8igUCppXMoXt46XpzvD0\r\np0nBs3D1FU+FO+TNSHjvDc+bem8EQ456Sft4WFbkMnULaqdnBSRB7/N08WmQ\r\n/LQOewZMN7708B6UUHsmmwPf7J+tz4OWe4UM8uHMDoe+Asgy0j5XDN1SS/ZV\r\nw3+RE8U1MMmPS/klfGl007QBmqq8HWyEEyKbbu8gPblnRBt8sPCAruM3ca4e\r\nuNsJnV4YVvbCZz7i48PQk5ZFexQKPt7MHyfGHetwnYL6l6tbZiAJV47oLJHf\r\nwndmkejHkrXhMhxM0CpZhcniYnR/oEErk/dfSOry9+M/WEM6IU2yjPtU9dni\r\nDjj0OevETngnIOYpNSQrtbpAD18YaPYxQN8fogeY4TDvxvpemFI/ZsMBjWw/\r\n1HJB8rWnnPtgbfK9MD7oJxM9JABFO7w0hGEq5SEScXjsgchpSbhDk6FRGvqH\r\njEYqwP2sbRNKcKSyUucgNP4VuVMDUlz3dNOEdUIW7w/D843qYjpQ7JRwnC4c\r\n/Uv/Sx+mp68ZGUFTxZEnxnBndyv9cfjKu8LHDAbuyuiygBPa55JsYeao2W97\r\neCJczfwUbHhOx+oMg8xXA12h1OLwZzf4Pb5F+Ry8J1Z+1wuataRv+EAa5wg7\r\nf/iGxKMuAAZnneAOgq/fHvYPgZS/5FouEv1UYfa7Ass/97y9Dte2mthvQg3h\r\nKu+EZeK70R22ZMh8L8orBdo2BTSmwdwZ570Z8Aejhec9Is9BnTfZMMBRkTUP\r\nvrwmdO4BsU5lexoeQv0+ij2PYOK/FfciyGPUx1wGXc43u1XAkozq+qdQZTr1\r\nbA20jLF6+QZmPdFleEv0pfeASzMU3xSpbSXWRYBt94f/rT+Vcwck8V+v6YQJ\r\nDf1OvfC/H63P+yDX7he0X2CRw93qIdi8YUPzA9LxG5yahub6KlU/iX77ilHP\r\nwbE0jpMLxHq/pnm6RFxXkxs7V+Bzup/2a3BLYaDiD9Sx/0C5CW9GvrTbghzd\r\nmRTkK9jv+djb0MKpz6Sj9DBDs9CNEW4xLgWxwvLQtG02eGZc7RonbK26lsoL\r\nQ7kleQSgREz3QyF424r7mRi03ajsUYC0Z6ztDsBXH/6NHYQCWXpLGrCPYi5E\r\nC8Z6J5Nqw1+Hhhn0YfajyHTDFeL/2fbzGsNnY+elzWB4NLWxA5SZK/3vFByz\r\nNHdwgrqiOZ5nIcMHhTi/FWLf6dgaDVsyqw+XwntPaXPKoe8Hp7+VkO0vfdVz\r\n6GF7VugNpGdno+qFlqkhHX+gWGnn/k24/U4oZgs+WvmkQb6K85u5WDktzGYe\r\nSNoHvyeqWeusEu/3gQ1dqGQbmmUAYwVqxkygWLW8ly3syeje7QDDLvtVnoId\r\nemVrzjBQ0jjjLORhmlXzgC2rcd88oe+A2FUfyN7wXtAfNua7tQRAZu8C2lBY\r\nTcKfFgVPfW84eA1StZ0avA5tkrP4bq0S3/nV3t6GRfYDrnegmVYodRrcFGIv\r\nuQsf0tQY34PG85aL2TCn5o5SPjxsyPCmFM5Il52pgMksxpRVcGIozvAFjG8U\r\nm3tJ1Fn4PvEVHI5zk38Dr/nu7GuCMhYFwc2w/6AO53uifvJIx4+wPWVrph9e\r\nCM2KHyDqPaUmMwx9REMvjEM2Ona2Sdiw+Lx2Crr3WTr8hEwvV7Zn4f8BSDhK\r\nAw==\r\n \"] -> CompressedData[\"\r\n1:eJwk3Hc41e0fB3CzJCSRrUhkb9luJYREESJpKON7zskIqRRRZJZIFCmRURpW\r\n0lIhhYpHyshKtjSQpN/7XL+/nut1cc65x+e+v593zvVI72Vs82JjYWHhXMTC\r\nwvzvhDl3z2T7iFlrtlx59G4GuRreZ/AdVvsbumrKk0G2VVal/oRjdr6Ocd/L\r\nIOVKfja/YWOhQ25aXgxyQuBNOdvHETMS94Cl15dBNG1zl3PC2sNLfW0pBhmI\r\nPkYthhMtPFoqaAxi9VtZhgfewMqel3iIQeY0OY/zwVc8nJbN+TNIMdX1gR+e\r\neZgf6hXIIPw9CQlCcFGwrY1RMIPUiB4YEoY5W7NK80MYJGi7yUYxeHGoQ8F0\r\nKIPIJazMkoDLDs9uXXGEQdprJ2al4D2B2dNq8FmWuu3SMJ+/xRVb2Mgg+/Ya\r\n+CF9fKMPfPXW1v3rYCFfw3PX4G1f5Z8owjUH+9Y/gTmkWcRUYLpXbHcH7H3h\r\nTrMGXO/5QUkojEHEmmIUteEgj/D3GvCbxXuidWEZ97VH7GCNo8sNDeEzzoG1\r\nZ+CB0uFUY9jMSYyWC6dNPPtmCo9ve7biGWy1LsNmA5xp713VBc/tCcgzh4d+\r\ndRbVwcWZ1qyW8NQPqckHGI/HfzLum+G5KU/NYqxHjVXLcjuYZ2KgMhnrFxRZ\r\nRNkz5zcmNx95GOtVfapuGyw14m16OAjro6Z93BlWHxx76RqA+a9MHfKEHbt/\r\nvpehY/72tI374F2duiuFsJ/lsZuyvOADn0JdF2O/vZ9L/j4IM9qrLv9GPYj9\r\n/bXdFw5tm/886oP10G26TcGRrSZrur0ZJPxQ3hIG8+fsfUXnDjKIemH4fn/m\r\neFK3v0tAffX373gSCA+vfTkduw/rI6kmFgzfL9eVOL0H6+O8+HAovNPqplkk\r\n6re4oULxOHzDLy4+zA3zvSuSdho2uucg47edQc4r562JhauFy/sNHRikJF/r\r\nbhwsEi52g2crg4xcsXuTDP/c3C9/25pBuEQ7XVOY+1liORxuxSBrL/h8TYXf\r\nChUXbrVgEM+zUWyZsOmnfE1tM8yHUyD5CtzKzZ9vYMIgmSezJa/CKUah4maG\r\nDNIWXKV3Ax7MsuKw02EQm33f6CVwxf7h/w4qYP26j8/fhYPTHKzpcgxy2nXp\r\n2VJ4Sd2Dx0FrGOTpVrkbD5j1o3g2P0KSQXSN3Duew2MlEgf3LmcQGaF6y3aY\r\nI81uXv8XnZBkp/8+wSvf/5wonaKTXUv793bBscsye9Um6CSddeF4H/M8xH6t\r\nXfuVTngntErH4KPHT55b/pFOZmuzV7N+wvizpGYtquikOTTktwIsn+p1xf0o\r\nnfBdL3NThkN1D9zMCKETu8Yfj1RhnbYD99sD6aRJ+lCkFnxXyPuVI0Unbxq8\r\nlxrDzRd9f9nuopN6iZ2S9jDPub+joyZ0UvPUyCwYDmd55r6MjU7Kudhia2B3\r\nOTOK7yyNnH5k+fkFvPjHFNfJ0zTiFJCgUwfrP7t2YyqSRn52iPS9hoXdOT63\r\nHqURzRI1w//glnN1Dpk0GrnttGv8K2zzd8v6dQ40knet0oG3Y8SsoL0/OFGM\r\nRoKdF/KXwSO0Fjl5YRrZxGO+sBy+yvG87ckKGhk43Fy4ElZpcDPT5KURmc2D\r\n7Kvhy/RLuhdZaCRrckW5Jny0QlB6z1eK0HNdeXTg4VX7PQwGKGLsmr13PXwv\r\n9n7mil6KdNYoLjNifp7btpW1nygilmbmvQl+8TQzy6uZIheNGGIu8OKyDSyn\r\nHlDkvabv9Z0wT0OrfVw5RXgUvJR3wUY9B3JS7lMkUsjNZC9swR23IfcWRR4t\r\n3VG3H7ZZJZlSXEiRWVYH+4PwVu2S/tJ8imjN2nz0gRtl83v5bmC8ExZ7KbjE\r\nZU34q2sUKRgwG6XD5+OzxaKuUmTgk1GQPxz0VLzCJIsirnWap4PhVQqC3+5f\r\nooj5VanCk3DCb469WckUOZEmqnUKZqhELLgkUqQqXrA6Gt6252/GiniKqB/h\r\nbjoLC7/61RJzhiJ+DE7nBPj3vP+hjdEUyfNi6UmCO9UneBYiKdLj9sf7PJzr\r\n5VtQeZIi4tumpy7AsYKvlpMTFNlhNRV2EbZc4xT66zhFkk3G2DPgM5q93YXH\r\nKLJIqU8oG+a0/10kFEaR7+xN+gXw37MKFqNBFFGZq68pgqsvlRVfDaSI97fn\r\nNrfhIzfNVuwIoEh354Nd9+GZl649TxkUEW0pHSyDS1u/WATTKeL4qoRRCQf2\r\n+99SolEk8UnhbBVc9v3vil4/irwquxHxCE6vHXNt8qUIR/FV7qfw++tXm2tg\r\nk2uZKTUwf4Tjpgq4NPHcjTo40rBa/Sp89eDxV+9g7ztxiwPgjl2h21rhawmm\r\nxw/AKx0DO9rgT74/vu+E44nPeAdst9ateyNcp7s/uBs+zbbMUQ9mU9n9rwd+\r\n+rnmlTJstGZnTD+8UB1sKg2HiDotH4TXZyiWCcH3ltlnDMH6D1PnG+ExTps1\r\no/CGhOmDGhRF5Oc3FY/DbbudWy5g/nu/E51vsJ9mpcks1sfutbLrHPzwmOFY\r\nNNa76FB7+Txc0RGf/e4wRbhWRgn+g+8bdG+TDKFIjWdHM3vniFnx7MkHpUco\r\nsmrRGZVFcIHze4rlKEWOFWnGccE3ytestsX+6k7HWvDCWUG1p/vDKZKSqZO7\r\nDL7UImyghnr5RnpZBeDok1ORbyMosmUwfrcg/CVbJ+5EFEUK4/QerYQtnxxJ\r\nUUU9LtYYEBOFb3Y/yuyKpcj+tqRQcZh7gTU3HvW7Svqr1mp40vhs6cg5jKf2\r\n/DkZ2H5XU/WlCxT55GcyKQu3HBd4aXWRIhfKUwsV4LTqjP/yLlNkys2MSxme\r\n6ejucsrG+rCOe6nCrn9kBjlw/rhszaW1YHGDoum9OK9eU5PhOvBx18mF5TjP\r\nNWmZnevhrlCtxc+KMR4jSwMD2CQ9ZNmhEoyn9/tFI5hTdlPvjXsU+Xg665cJ\r\n/NWVTyEL94eusvV2M7gu6cOhtCqsT3AOnwUc88eH5UwN1kdiC2UF+2hoWZ2o\r\nxfo8m31lDdscnE8KacB68NhHb4V5WhJXeb+nSHvOwh8XOKnwvsnmPoo8feM2\r\n7Ac3pMWdK+OgEcmAxZZ0WOBRJaN8CY2ECd/PPcScb/+XLRV8NKK9l9vzMDyk\r\nRrgfiNDIzZnKtnDm+F/9jKxWppFzMitfnIPP7XBPMXOikZ1LQhwvwHJRlq/3\r\nu+E+/vZhIA12LtFkj9lDI/ceXeK8DD/gXBLYhPu/1UXSMg+2qijb5obnh3CS\r\nbEMVXHFwXvxUBY1c+aP5th8+e1JIJFCSTg70pXgOwplh9wOvrKET1Vc/vw3B\r\nu7YXcD9QoJPHaeXLJ+BujlS9bzp00qNhsH0WzqWoCx52dLLG26yNp2vErElf\r\n3NbwBJ2M2V07sAxOrz94WSyaTkp12GeWw4knfbqPn6UTc/aXwsJw+Ddqr3kq\r\nPj/LylUaPt8a6PuuEJ8fXTC8Bj4bf7hY+w6dzPhxh8nBmRYhExfL6CRG/02G\r\nEnyjMizA4ymdFLRu7dSBszMiwkb/oxM2i0pPPbh0TCpVp4NOdlas/mIAu/9i\r\nq77wmU64M6bGTWF1b/EI1iE6oXan/NsMazrYLu2YpZMXb/+csoWvnG2nLf9L\r\nJxIb9nNthRe/2P/WkpVBGmV1ljvCMXrHU0uXoL9Mu5K6g/n5gUtmR3jRHy1e\r\nJOYKL7mVulNagEFUR9pkPOCuVbdXJYqh33EzzfeELV0NIl9IMUj3m3ylfbAd\r\nrwJrhwz6HRP+O15wySPO0cq1DJJUEqrtDWsx+lrT1jHI0OreSl+4fPWTx0FK\r\nDELObzamwSLvMm9uU2WQb0FiFgHwRw2nY3za6B8HIxuCYP0+jQNjuuj/nUft\r\nQuCM83z2DfoM4mBQ7XwMPvGzbs1pUwYpLJLtDIfZ83J5929gEDbJBM8IeP+O\r\niBmzTQxy798un9OwbIXB67/oH7n9a8dj4NMHhcs6tjDI3j7VgDj4q/DPrAf2\r\nDFK1/eJ0Amz+bvKmMPrTFS//hSXDbKI7zx92ZBBK1/vfefip54ujLU4M8iL/\r\n7alU+Ee+qpeGM/rbsznxGbCrLrveuCv66z9Lll+B447TpG3Q/8rSAlKz4Ucv\r\nPnAXuDPIf1s3ZuXCt7cXd+1Hv6z6rEgmH6YyV9bVIO+d1hTML2DuV9/JO6uR\r\n93SFvpTchjn8nU517meQxNNbtO/CupVPKIMDDDI4U1Z5H/b9p7AjHf27iY+U\r\ncTl82eKC6TT6+4ufTj+rhMW6nv0IQP//zWZy00PYmHu9tBVs9ci54RHsv77Y\r\nThKezV7XUgN/OpdWUIfX2y8/5/wSXvZk6YfLcEHk7446Zj2OneQIgHd6NQy8\r\ngWMt/HZLwA8Vqek22PqPqZA/xqNrE731I2xy8NiazfAdv6ybHcz1bqnUkIYV\r\n4ytYu5m/b/rL9Dfmk1v8dmcPbF+kYfcOlmocvt8Hb313XGEWeeTSOBvvF/ia\r\n5T2bYKyHIJ/Ega/wr0eDtJ9Yr0RVnSfD8Ki2eHIA8gnXVjuRMbi/aOu9b1jv\r\nU4yD/hPM9ZOJaqV7MEjonUtrfjDra9m4iB/2a6/mwpl5WHDkcc4+7HfnNuHe\r\nBZh7z4/nvagP50B1A9Zu3D8f5Ad3b2OQ9ymbU9jhO1vcubpRT7ale8c44Zsv\r\nkhXdkWdqW49u4oKzDF/afkL9mf26kMUNT939TXexZZBqodszPHAVt46ZFupV\r\nV7fOfhlsNJjVFG2J9drRU7AcfvSMy73dnEGUQn6zCcLilwOGFVH/qyuVykTg\r\nOQcLjrdGqHeDZFEZuPLRuL6YJoNE7SwIkIX1LznXUWoM8i+s5rUcfDHwmeMT\r\nZQb5+fDncSU4WCGVsV+eQeidvB9U4BmOf/PlsgwyPC+nrg47ffY+uwTnf78k\r\nidWE7z94L+y+CveDsWufNqydanTjtgSDuHgEGK6H1YVNUsJEGaQlPO6CPiyi\r\nG6A/IMQg9U8eWZjAAYc/RVfw4byayRRZwrI/C6U8WBhEea8hhzWcKvj5Rd08\r\nneRHOu6yhU9orfDT+E0nl5+fXuYAtwccreD4TienN40G7oTjpmzsi/rpxHVz\r\nqREN1lTP8rn0nE5MiiLrGXD66JoGvid0Isvr4BgAr79RoBiFPPXt7bhfCHxY\r\npGyUfhf3t4t8ZgQ8ufCaZp6N/HMw43cqnMB18k3cETpZcfpk+WN4L5truaIy\r\n8tlXuw3P4J2GeyZd5emke7Nk03OYHuCzLlaGTgp5q77UM+fTcyTjqwidbEj9\r\nIdgCf6nOCM/lpJNDuQcCv8IbFRWKVHtopLHGVp3/84iZYf6P3NhLNPJfy+tk\r\nAfje+7+bmlNppGvAekoQVlxY/FXwPI2ML9p8TxQWdZJQuIp8xmuzSXsN/Jtt\r\n061y5K8tLcZ6uvC8Q2XUfQ/ktYHqdD34yF/O5PN4Xu/6ZfjbAP51c3umvwuN\r\n0IQNqkzhiX8Td9W20UiCm67RZrjr1trPRZtoJJUqu2wD73QNHDm7Ac/r49p/\r\nt8BtHM9++ZjSyK1szcfb4GY3d551+jRSdueulBNsvbhQeLEujTx6pn7CGa67\r\nNyMzqEkjL9+XfHaFN3psUn2phvn3qxJ3+MmSFP1c9Bv//bx11QMe5V4h/1UB\r\n8+dUYd0Dh1905fWTx/zllWq84Nw7gx8DZDB/St6cAU/2sQRGon8ROp6X6w9H\r\nMCxdF61E/5O4ljMIFpxPMD2LPKlyZ01tKGwgJM5zHv3Plp+rrCLhaEudGzno\r\nl5w4s29GwSKtR+PWsmG9VkotOQMXetb4F/xDPyh/xScWfiAtNFHxlyI0PYmG\r\nOLiH482Jrj8USTgmYpsKHz+XXxv4kyKNHMvtb8LlhR6OV7+gf7t6MbcQFojZ\r\nbdjcT5F5Q6nfxfCN/Z4yC8inFz7kbimB9c32LFHpoYhyoNK1u3BnyrdAz26K\r\nvOC7N30flp18GL+miyLuhXo25TDN+syNwQ7kj95NP6vgvyxSH6iPFJE9/sbq\r\nEWzhPjyp1k6RapHtV57ACRWlXD/akCe2elq8gKXoNgZHWili+zgsvREmHaFX\r\nopGHB1xZx5vhM7rm5VZN6G9/nTF7D789t6x5aSNFBM/xpbUy12v809em1xQp\r\nVk4daYP3WOWxnEe/al4vbvoRvnndX9TpFfL3vmspHfDUgpGmSD1Fgv6tG+qC\r\nx8q8ZNzrKLI0s8SoB/bpekwVov+9pqt7rg8e4BCpmH1JEYP31V8GmPup7M9q\r\nCfsuaUgchgPD1qT1P6dIQ8hAz3dYQzjmicQz5KEVfjq/mOMx6V3i95Qic7en\r\nYmfgJC8DxwdPKKI4uKA5z6yf+2NDTo/R30dEn1mAV3Vs0sp9RJGdkjydLD0j\r\nZlvYso9/r0Z+rTyvzg7j6VRH4FhH0WhO+Le9g0DSQ4qs/pb9cTFsfZuTdytc\r\nGSenyg0XqK77JA/by9+K5IG5S6zzWeChGq0PfLCvGi3oI/KAlYadggg8qj5z\r\n0wjuedN6XAy2uSsaLASHeru9l4CLNYw2TjygyM1s76PSPcy8F9GVDRPDyeY1\r\n8Jt71wtD4fa2w7JysJJWbYgDzMV3qlERHtNaKsAOXy1YIqPCfP9Slc8dlRTR\r\n25QcrMZ8f2374lL4bc/K1xpwHrekyizsfezKKm24a+Y22wG8nkVENkgXFvxC\r\n2lvg9PuF9Xqw7fv3t8ww3rqRCn9j+GzxtIsk5ttQ92PWFJZULom6ADflqp3c\r\nAH8uOnhnKdaz1SM/0RJeVNS+eA7+YNgvZA1fUjyn5Y/9+CSy6ootcz6Fm3cP\r\nwT3v04oc4O0FVeVt2L/+kveajvCXdYF9W7C/g/F8VTvg0JtKfC/hER9rM1fY\r\ncN2AvhHqYdzidL0brLO1I14S9fJtTc1WD/hUzKyGDfLYT5aFNk/YqkboQyjq\r\na67q8Bcv5vtr20u3ov7+XrxLeTNfT6fVsqJ+WQ6P//Blvj7/rJ8a6nuxmhfb\r\nIfii2MuyszgP3Dw5sQHM12/v21mJ88I33Ml/mLneCf/+fXmD83TdcVUY8/NY\r\nDKzNcP6ETybnHWO+Xt95kv6WImK73qicYL4+IOjC5XcUkTLgKouAi4rP6Tcg\r\nD0oLmxtFMevxy+3umRac/58nnp+GG/32NXb+R5F17x5ax8JD6ofXffhAEdU4\r\nLddEOP5Bevdr3B8a3oyeZOZ+HC/Ur8X9or2p6GAKrLWh+sLTzxQx/CcTnA5f\r\nff3Zugz3l1WgQMo1+G6XXEXWKEVs7O3EbsAc1/QELo0jX6uczcmHdxywpqVM\r\nUmQbd+26QjhAyb0+YYoiTl9Z7xTDLyZpa2J+UMTlhfH6Eti/SUPwzi/cbzlH\r\nHt+FRfNrLkbN4jy7Tb0ph5V3DGSpLOA+1lNxfACXqhyWYWOlEW8hn46HsDHn\r\norw2dhphNPcMP4XpZfK3TiD/Htv4dtFr+L6g38N3gjSSplRCPsMRqqeCk1Vo\r\npLoi83IvvO5ScdUfdRrp3Rgz2w+7s7UtHNCmEWX3PXeG4PVt684YG9JITfyK\r\n1d/h8eNNF0es8HwaD/nH0Yt8crHe4/1+GjG/Qx4rwjlnLAQd8mjE10hFTAXO\r\nPpj1z7uQRpLqRYPVYC1yetHP2zTyqee7ijb87xVbsGglxr/8xhVjOL/jj+P+\r\nBhrJCFhy3B7+yjIhMDdBI1Pa7w2D4YDI1N42AzqJZAtqCIUtArNlOAmdCLwV\r\ncj0KC+4t2Ke1iU60/VyDT8LVGx99SdpKJ6E5PXfOwoPusg/e7aOTBd7Jtdnw\r\nhqAjjbrxdJLUkVyaA98S5ji08RydrC7Q3JgLr3yYKGCfRidm5sGeBfC3f9ed\r\nfa7SSVTY34z7sFNOgyDffeTbr0v562Ge5j0DHh/oJLP0VlYDrFPmuDCEPKwc\r\nuVWlEfbItBQJ7KGTLZIp1u/hYS8V2zPDdJK8XSy6k/l50fvMD6MflJauXvEZ\r\nbpXpu74KefjexK5rvfCFp57sDegnW2JzngzC1+d21UhxMcjKp+vmvsFqh1xI\r\n/UoGyU9oiPkBT/J+yA5A/tVzo4Sn4dtFTv8kkH/r1/HlzcILlq0eddIM4jpd\r\nov0HfvRl22N/5N+R5w7P/8JHT72TlFBgkLBzPxxY+nCe4tKqy9FfL92d2sMG\r\nr4n33q2B/vuy8noGJ7wr3oCtWINBVOba/y6GL8Xz3JBDHn5cFxbPDbfEd1vm\r\nIA9/3vu4YBnsEB+ZkGbIIDKXNg2IwubxDSIRyLsbpiYOSMCWvDWrvyEv7Nuc\r\nPiwFb0x6sG438kRUjhklDRsvv6vehLyR+3tkYg1Mzt/UM0Y+eelwwV8ONhK8\r\nSoodkCcLjH+ug9enXbQSR/5dxPY1WAlOafw4MIk8JL8z+bcKzHGiTvTPDuTH\r\ne/rH1OHD6mV2i1wYxJu7f0ETPtp77dRy5OHCKh0OPeZ8zcPH5ZGvlMU7+DbA\r\n1kt0njkij20JjDpnDldXyUzvRv6lv1YRtISVKX4lP+S3xDUf0jbDmpILu4OR\r\n70qOnhS1hXObRi9E7GOQty0Kl+1gwZMfX8UjD35TapFygMU16hYuIi8ujzqW\r\nsx2O6yvVuo48qdm5VnYHPM/lv+4hvE27Oc8FrqpyS9wIB8aHKrgx15Oy+Pka\r\nry81eq3qCZ9rFn/KzN/rrxzS94V/ptY6L2A8Lr9Eqyk4wvLuo9Nw6JbnJgzm\r\nev/OXLMMrvorZB4Eu7j7T67CfD45PakNZo6Xz93pJub755b35iNwzhOLh+qw\r\nxCKBN0dhNX8N6QdYHyOPh3bh8KiMxBkzeFf5/ncn4VZeW5uzuxgknI/P8RSz\r\nfiI0ihOxvk8ee7rGwGM+87SLzqiPVYv2n4cb9M9P3cR+7w0pGbwAO98O2XYL\r\nefRUs4vPRVhSZtf9uzYM8uJEEf0y7M+97nAV6unLB8epLFgnnLftMeptkfpC\r\nYA78e+q77vONDCIXkz99HY450H6xzoxBLHvsj+TBWz49mn1tinrQm/tzEz7O\r\nfqPglTGDxCRfDy+CuQ7dX3/QgEEKhmxZb8P6Hc9ecqxnkAYyfeoO7Gvxdvs1\r\nLeTpnMzEKrjn15J4ETkGSbr560s1062K4d+QR9+XbDV+AnfftzlUjzzq8ph9\r\n7Dnc6Z/gGIr8mfly18Zapu1vW9ivZP57VkVGPfxJrVlv3Qqclw6/zY2wxiS/\r\nZDsPg+T1vbzazHSTxrI7SxhkaHjV7Dvm/G5vY41ZhPw9dWRrK3xk4Mb8OzbU\r\n62xLXht8Zhct6dwCndz9p7LQDqe2acs4zNHJz0UxTh3w9a3zpfzTdBImZMTR\r\nAz8xi/uUNE4njyTS3PrgxqpttK2431hkv90bgDu0xFiWfUG+1czdMwzPri1Y\r\nm9hJJ+e28jz5DrPy1B2Kf00nN2M7j3D243wFLl5Un0cno8m67xbDO/VzvR/l\r\n0IlqevI6btj1H3l97zKdlOaZf+CDnePCkq+cp5Mnz4u1ReDQG+NigeF00vb3\r\n2KQiXPzmtcspJzphD5D0sodX/i5VN1ugkXtVypPb4JnY+AznWRrxZDc64gS3\r\nmt0so3/H8/LCzoSdcPLdz6OXB2kkqOJi2X54yTk7l99NNDI4v3zREXibjbLG\r\nvWwaubBJOvkorMZuZfsKeXdDorpYONxww13W4gKNZK/aqnoKLndd6eQeSyMu\r\nG+J3JDD9PLY8JpBGXp1ZlJ8Df7p06EivJY2EvhXSyIUfBTSeo5BP5UTXPsyD\r\n6UWyJ9WNaSSycGNzERzFYxA4rUUjBo0nZ8rgu037XSOlaWRIKDmiEjY6Mbnt\r\niwT6AY/spQ/hOrUwWyvkyR+Tj1Y9hXmSkkz5ltFIscAfywbYZ2vV2ox55AM3\r\n7vdv4J//zFf9nUF/nSvq3gyfvNMs4ol+pnxs3eA7eP060eJw9D9eOnqHWmH3\r\ngw+i2cbQv7kcTu9mvr+3wdhy5Ls3V6NkeuFzNz+9TP1EkbDhlOJ+WGg4LFsU\r\n/Vpb2L2nQ7Ck78Nt0ugHk65MDn2HG32NHqijX/VMLbH8BVd8NWD/hn5YPYGR\r\nNwOzHNDfUoJ+myVajXMO3jyw/iKd2d8fm9w3z9zv/LBTCuXIA0ElNQvwPg4J\r\nLbFSivhTDGnWATyfPB/1cd+jiID7ZDcnnCzGsmHsFkX6tpcYc8GfQ3KmOoso\r\nct+GcZkb3tK6IaexgCKOhpOuy+ClidEsJTcokio22SoCe7EtfeJ/hSIHBEq0\r\nxJnv71FM35tJEV1uxnlJWKZ6i9T2SxSeR2pTq2CG6GTjxouY/++JrTLw4+Dk\r\n49qpFMmbun1bFk4vs85STqFIyDCdVx6u0Hjz1v48+tNeVUoB/nBrC/vhcxQR\r\n+TjRoARvV2zWuZSM/PX2toIq3Jxn7/0oiSIP6ukx6vCkzPuM3kTsb+XEJh04\r\nXvy/fwoJFMm8OPHUBJbm7XhVFUsRKun2KjPYNNZ9vjuGIkZn6OEb4WrOblV2\r\nmOeEatcmWC9y9x75M8i/wROGVnDpQk+KzWnkZfrtDGtY4+jeWkY0RY4foP+2\r\nhR1m+mdTotA/e6i6bIVfH1EwnTmFetkxUe4AW/TRjmrj5xNbbgs5wjXW9yr8\r\n4Seb6EE7YOf70z9uw546ExpusE/UCUoB758jOFG8H/aXO7dLCp8fwHN76UF4\r\nUdJ/l9zgDRx0Xx84cka0LR3u+zEuT4eP1l+zW4Hx3xu9dfoQPK3+9aw9fKqf\r\n9iWAuT6XlOoSYMcOFfPDzPVhO8T+GpZtGb8WAl/2LTXlwnr8bLjFGgazKjx9\r\nXAC/rKF5HoOfSYwva8F6plWpPAlnfj6/2J75s6iPe+OSEfALdst7a+Mpkn9u\r\nPP0ss77ezU03YP/6GvYqJsA3nFSkebHfUhztD5PgsE+7bbaiHtKCa7ovwGsH\r\nXmS3oF7el6w/dBH+4z3zSgj1xDtczJrBrIdxhZ/O6RSJcrsomw2fnE606syg\r\nyNMLPOU58I6jzwKkLlNkvjHCMhcWV05qKUP96i2eac9jrreiGv1pNkUCCeVb\r\nANfKN3O9zkFeWWt25/4A8/sIWwN/4TxkeZSblcNrpCZ5WYqRZy8qtVTCuyWS\r\nbnLfpogD98rpR8zzItLctQrnLX5j3JmnzPkIMUIVcR7rj7GIPofLVixboYPz\r\nSiZHDOthFf6tVtbI28fWeTY2wAf5JvsckZ8r9/zn0Qhf50k6vhv3wc8M62/N\r\nMKfQWhUW5F211icR72H5PxzSOci3Ug8u1HXCL9Oivsk2of6/L3H9PMDMN/sH\r\nXuK+SVM6MdILC3mZtx9AvuTN8uH9Cu/R5Hh6sx3rE2myfQpeaDyVpIx8+Ml2\r\nqJvzC/LwpQ/UzTmc/x7DaVXYle2/9njkLc/cyqMa8MOPviFfkbeUvXVYteGA\r\neywrNyBvvZhU5dGHP+9T3j5jQCPfF6RlNsL8L0417kHespPksnOG99ep/T6J\r\nvMW1s/XGCfheQXlNIZ43x1oop7cwnf/BkqZVdOJrkVHyHn7vxBJwfw2duDyo\r\nW/IfrJtp+Sldnk60smUef4SdZdsK96nRyYhvu1w/bKr3w+a3CZ24spnP/mKO\r\n58W92tUedKKrIZ4pPoj5xY97cOF5K5tr9UsS3qLv3z6YjfwlHLx1NWzkq+Ob\r\nd51Oxuffsq+FE4dCBBYK6SS3/jSlCj8dnN976wGdrPD8bmwGlw8s4uBBXmJp\r\nWZW+EV65Zl17xSc6mdi05fsmePG+zcX7uumkQelmnjV8pOF7YyD6h8iZXcsc\r\nYYnUNYePfqeTb4mveg7AV+Sjn59Fv7N5YzHNBxZavHZQgJ9Brs0kzvkxxzP4\r\ngisT/ZGjp6OgP3zyBoddEfLRA43PlkfhTWKGgWfRjwkMPms9Dg+aZeu5If9Q\r\nGbl7TsJXfdkXlJB/pNh9j0bDvQ9exzQi70S2/rydBO9xcc/iRz/YEfPB8DzM\r\nevLpvl70i9rGVfUXmK/Pl1W4t4FBEqYuO12EzZpjJiLRfw7eONF3ifl+02P3\r\nt1sxiOnOvYzLcISUwxFZ9K/pfJvms+ApTs0MN/S332vkY3PgbSaqRmrof21C\r\nuFfmwn8PK3azIe/kKo1fy4PzbsmdbNvGIAufm9UKYK5BGZlC5J87Vqmbb8O7\r\nnMQPOCDfCIqtPl4JL9LmmchGP05rYuN+CN/x40oORH9fG/kl7RHsep1D0xL5\r\nZNX6+jVPYY4OllYx5InQ0cI7NXCJwN/DE8gb77ITjF8yf9/6t3CNN4MoOh5q\r\nqIOHwx5YRPgiv3Ftd26ALTmmbcX8GKSrWmfgDeyboLn9PqzrL+LfDMevZLgy\r\nv++ZvPbP33fwSHbR7i/whsSnwh9gtXuylDAd/e1uG5teuKJtZfTRQwzyb4Vq\r\nez/8aff2OEF/9M/1/F6D8PxQ0rlb8L1jP6aG4J0Bby5aBCDParSFj8LH/3Bl\r\nfYb3f6lcOgFnR23KDQ1Efr2Umf6Nub68kYXLgxhE2C587Q/48KLWtZP4+SG2\r\nPfd+wTHd6lnS8Kvyjaaz8KXyhJWOeD8ZP7k3c3BR4kjiaXx+a8vol39ws0nu\r\niVEGg+jfCBbl/or7NEt4TxnmV8rFfZQHzrd6cfQX1kOdutLJB+t8P5SmAxc1\r\nq5ssh1delrx7GOspp/UiewU8vanhdZkP6j3NmXUlHDUZPPgL6y85N7JXBPa6\r\ntIZVF07fFf5CDDbf+FY8+CD2/9lyOUk4MaXq2VLsX5LsjTOr4O1pHdEj2G/u\r\nGL1haVj80vzmV6gH1q27i+XgF1dM3p9GXpvoLNZUh//k1/SxIk/7EnJBE+4q\r\n6M/rQf19ud7ySxu+Xszh98SeQTp95yr14S13LX4cQ353bkoQM4IFSw9WuCHf\r\nv9eQPmYCd5THHDXAebBLLe0icHVlgamoBdZ31tJ0I3zqYQP7LPKauXvH1U2w\r\n9ePRujbktadP6GxW8JL6/OhiEwYxXMO23xr+9oR/Qt2QQcpPp760hdsqjuwo\r\nQz7LFey32cF8vwuSs7U476tCg2+5wL7xpz1tcB9kdCxZ5gbbR03WNyOfnbum\r\n/n43nBfw7FK7OIPwLHqhtRdO8FVk2yWCPOjjnLof/uuZ4tsriDyrHu7iA7+y\r\n9zJkfl9hLmV5lR9sYNl0nc7NIIdncsXp8GrT9Tw/kMeox6+7A+BbNwN9S5G/\r\nvkrvJofhi/cqdrIgf+2N/p4TAp+s/mNt+wv3ta2o1zHYremU0sAonbSWFNeG\r\nM/e3vU5c/Sud2K8g6yKY9dOzlOdYH51YfDowGg1z/UwZW/GRTrS9S/2TmOsr\r\nnHtrYy2d8EVtDb/GrL9ofn/PK3QiGjDSkgvTuiW2N13E/e8ZrZAPa69X0DFC\r\n3jI0ethaBO8aNPstfIZOvH/KKZXByy0DI5oP0UnN/oUPdfCn+W/ztI100rjt\r\nkkoDfOfS5FETYzppJ9qn3sDRuhNzfOvpZFLCV/UdHEcbnS1RpBOJ//6L+gQb\r\ndn/5ObWcTuSfH/rUCfMfHQisWUonmneXqn+GB4X7v5/npJPNCWYd/fCIXc83\r\nrd804ni0U30QfjbazeD4geexT8jpIWY9RHdNtI7RiJ+zQOcI/FKmk3YD+S54\r\n0y2NcTjzyaexwz008jekd2qCOZ5KUdv3HTTCFvp/iyfZrGM6QsvqzCS8detL\r\nJcNPNBIv3d85BZvJF+t/bqGR9GXhmj/hY/PnLU810sj1vyIx0zCj9YiTfB2N\r\n3B693zUL7yn23Pf6KY1UfbTT+gNfjrD0Z1TRyNuyqO5/cISGUELFLRrpuL5K\r\nm21oxCxoyXyGWz7y57mqWA74YG/fzX9XMV7aN+0l8IXEOy8skTcV5dzjBOD8\r\nUZv5D2E0oiM40yMIZzzX5D4WRCOE7byuMJyQKSqymk4jzt11veKwasb5yNd7\r\naCQqTUtvLXw+JE+geDONdC1a+mU9PKHdpEkTxfrqutEMmL/PPbqjT4BGGryK\r\nfhnBrH2Ljzrz0EjlC5tFG+DweLPnZv8ocj4yXt4W7vIO/WQ0hDx5r7PEDvbs\r\nbVxI76PIiV5lPQf4pvOaNb86kT9Io9UOOMCiye/WO4pYLPD6esJLZGX/Mv/e\r\nUq3i8X0vfPbyEemwMopo7bod5gW3CDRvaiuhSGH8Aps3LB4r66tZSJHV1XZx\r\nvnAWa1hiYi76vdGsFTRYOqz53kgW+j3xyUwGHKiXsM0P/fHckaTiIPhNLtff\r\nXuSrQwWftUOGmH8Ptth2BXnpa7vaoyOw7PKofBf0963r3zaGw8eP/3NoPkmR\r\nkl/8kzHM+TtO51UzKCK3dk9IHHN8S7TnQ/woctnx7r8EuO2pv4PWQYqsiGKN\r\nSYaVg0vyJvZS5Ox9B/4U+KTS+J8CD+Tb/pz0VPhUn6KD107kQYHvq9Ph3yn2\r\nBtQO5CWzDQUZcJPT0T0ft1Nkv/95jSvM/RfJi7FwQL96te9BNhzR8bbkvh36\r\n8beaG67BLlf+tK22pYiJWsu2fJhLxmHtHwvkyfEVQXeZ9aU0/6zEiCKJEvvn\r\n78NmE3LDEgYU4bQtjSqHhe848J9dj/78KAfvA3jM/9j6GW2KfC90TH0I12rn\r\ne+zXpIj3p1zJx/DVmXfR79Qo8nnJrxtP4eAH88UmKhTZob9J9TnMN5MzcVmJ\r\nIm+8U8tfwgv8L+53KSK/pX8xqWe+v+JgqBT8oE6nrgFOMucy2a2AvCzX9qGZ\r\nuZ+htvU98hSJGFj5+yNzfbpbO/tlKSL2XHhHJ3P+L3Z4a8D3ckTud8NOhe0/\r\nwtdQxOakKH8vsz6Tdp54I0ORAQ8xWj+8/3Antxh83Fi84Qs8utMj7aA0RVZK\r\nSMgPMeuF9EiXrcZ+z0lEjcB/1u69xQZbfZTsHYPlz21P6F1Fkd4KKZNJWOX+\r\nocQW/DwsbVXmFKz1X0LSS7xf0XZpp2n4o0j9uQKMh69J9tU/Zn1fNUrzx3zy\r\ni9fKsQ2PmCXXuF7ctw75KE7uFAecNhCc7oT5+1utM14CG627m6GP9eOWV8hY\r\nCm+0bspUUqbINU7FGV6412/0siTW23BA0ZEf/prAlbVMFfVbo3RXAB4vWZvN\r\niv2h5SjzCcE/3m24+gNedFLFTxh25d1w6ZIGM++p1ovC4q/7Yme0KLLeWG2t\r\nBNwdeyrMSZcib8XVI6Xga1ayfvf1sP9z6p9Xw/sXvXRbbkiRjArNS2vhkVOL\r\njBtNcX7TtKbl4Vsb8lWUNmD/g7S3K8KHWK2kYs0p8ldDl1cN/nU89p/5Zpxf\r\n/vW+GnClkeK3azYUUZ1cX6cFH51r6GFBfXsW60fowayhPDXV2yjy+6xBtwH8\r\nQvfWPTEn3Ec+hobG8JlfW66HOlNE0coo3RTefH8ipc2VIs/ljH+ZwUUUjWXY\r\nnSLunCbbzJnjZ2sP3e2JvNlvUmIB56ZtmPpvH853DvGxgYVqhPuY379+csKs\r\ndgvc5By5U59OERePDWvs4dPjY+9L/CkSK27e5QifEK55fjmUImOplg4ezPWg\r\nqBvBp1GfZ+30/eGXjXn2Orivygs5XgXCHlwBvM9uUqSqocolGJ7dYNxge4si\r\nNdzyoUdhpcqWjfuRn1vO/iuPhp1zWdan1GO8Z+9oZwwz+10hlf/GKaITJ6D+\r\nHL7oF+QRa4z7Oq5NTmgEeeuhx4fKbhqx1b1QKAyn6qlVH+inkZ4eB1Ux+G7Z\r\nv6uCQ8ijuo06q+Dhkqu+h6ZoxKXnubkC7JLb91eeg05mte/uNYZ1Ew7IXlSg\r\nE73uuCwvuEhGfP4Ig07exGyW8YbPXzgT8SqQTjy1Fuf5wgcfTOe+CqGTmJjI\r\nWwxYgP2/0Vcn0C9oHqk+AnunnTvSkEQnoWcOfEqAhR5xp74uoZNKdbOV5XDx\r\nsS2vxobphH62hF4Jb3aa3W0xjv5lQLKuCv6icn06+xudnLs4F/IE3mOX9bFs\r\nGvl54f7HetguT6BnLxuDiL+Ru9IBjzn+GasWRX+6NvVXF9zul656UwL93gl2\r\nux74VITOoZRVDPJTs2dhAO4oZvzwWcsgby5d8pyAu+78eOeshn7wII8s6yju\r\nA/31Z3KQB7WfhR1jhycLPj/iRh4cERtu5YTLxWJ+Bloy++OX0dzwlr/teyzQ\r\nL/Ot0+7mgSUYEekldgzyIuKa7jJ44LNCswjyX1gHf9JyeNvXvaP625EfdE58\r\nXQELiRj5saM/H0wcN10Jt1sJjb7ZwSCXh9zSReBLRyZ805AHuS7rbZYcZX4/\r\n5KqvgjuD9LJ9L5SDx7I4fbciD6S7e7IrwAFvu4dFkP/sypvclGAt1kqfPuSH\r\nKp8iHnW4aq+vDzOfHHou6qUJH03ZOGyCfCMnGfNIGzZ5IeHDhfzWGTwttB5m\r\n/fVr6B3y0Pm3++n68PO1zd6ZyEtWii21hvDPHOMCLuSrhVNmq0zgjqi2yKXI\r\nY6VdJSEEfnGQ4c53mEH81ku93QCL2XDpLg9GPsj6oGHLXO8PfpclwhjkgP6f\r\najvm+vRv36ZzlEHOtEpZOcD8k4ZcdscYpIH7gMcOeG4RT9CJcAYZuxE77AKv\r\nXfFTIf0Eg/Ca3Qpyg/ulOj/fOckg9iE/z3rCb3SLbfoiGSRAQGTlPnhmwwXW\r\nP6cYJOWWYY4XXFm5bPJlFMZrtVvZG76sNRbbDrf1R1b4wmdu18uOwrPheRto\r\ncJDCjSd/YVGxhkbGKPM8Rezkj2YQd/vlA0GwQoZBsg4cPqrNCGHur5CwkhWc\r\nfdpl7ghz/Ek/Xu6E+6qz+U/ADdHFf07AHC7PMyPgCpbYtPMwwqxcFJx51Evj\r\nBuytoGocC1P+Ugcb4LMvHOrjYOexOdYuuGj34e2JsPHBD5cn4Tdz6d3J8IT7\r\n63kFeCK12icFvnWy2JAH4+fX6PmZCjNyE8ImsD4ab9hPpsNX6+kP3kYwSBCb\r\nTdoV+By/xvpUrG/aFbr0VXi7tkBwCNa/Qu988TU4yuVHqetx5Cf6x5p8+PDV\r\nMk0p7J8E998thfD6F2n+LNhf4xurPxbD3kMhd/pCGeRkx8HJu7CruoFqPurh\r\nWnBcWCks7ihOi0W9PF9ewlkB24bOF/mhngaK3yc/gB02CCXIot4WWU2LV8Mk\r\n6H3Mg0MMsq5fNP8xrJqXFGWH+t0cbqz5DF720fZkP/J5fGmUVS3cY1wXwot8\r\nfXvrzZZ6uJkRFXhtP4M0j7z2eA3fuWbGWL+XQQSkVxx+C0csrj6wB3lau1qX\r\npQU+pH9k7/ROBnFy3hn3H3M8lK5HHM5nekJOzidY5t0dpzKc76p1L5W7mPXL\r\nTnewxvnveD5U8Rme0lHa8hn3w7wHz8Y+uNV7yCoI94fUnFrTAJx7+6aww2YG\r\nIanbXb/C9OvHspJw/+xVDxkYhvXS7dc2IU/fOPB4bgK2ODWraWPAIEN3zu+c\r\ngs/r7bz1SpdBlP8cqPoB7x97KG+lhfpOWhY2C3M6npDYpMwgNZWev1nHRsxM\r\n5RYtMpXCerLruHLAyz8dPPlIjEGstyx5sAjuS3g1ZyjMIIkXu0SWwKVmSoer\r\nVjDIu967oUvhf9Pxk3r8DCKofLqdF36bPDOWwcMgLsE79fjh1lONfF8XM0gP\r\nN/usINztc2TbCeRnWacPzsJwv/vWoNe/kU+ziypE4a9b16YJIz9PajmGSMGj\r\n6999LEF+XnC/MS0Pz3Iq7OlpR/4ssfxlAPturLPuvovn029xJ2OYLWLWTaqY\r\nTnI3fis1hS89VqB55NGJUnt6kDmsbRSf1J1BJwasIz+2wH+1HVq7T9GJy/b4\r\n755wslzHrs9OdJIy83byNBzSHDB2c5xGDrwp3hgLv7vy4wv5SiMGOTEX42A/\r\nn6DP7cijfdbENBlmKXp1wRX5Uj2rJPES8/1HnC7IV9LIG/NElWJ4xpee8jyC\r\nRhadt/F7B6eKJjwQWUkjnw7IP2mBdfIMX+xfRiO3DNlXtMFlOiNNd7iQ575U\r\nVX2C2xwsB6z+UOS6niL3APz73d1dAb3oNz9zFUzDkcHmT5fcpYhg6cD8LCzW\r\nkFY8j3z1Neap/R/YZvVw+iT6lUTN0Nl/sFBDgv9/6RTZu9jRlm0cz2fJnl31\r\n5ymi26l2lQM299e0fhhPka7or5ZLYB7xDzI5yE93dj7PXAqvW7PuMOdRikSp\r\nZU/ywu3lx9qVgimi/HHHRYFx5r8PrM0OpdBPK9cOisOKGqHKAujfHmxwpknB\r\ne1ptBpuQh2Zdhn6shtNDVl2NQ38YHM3NKgdzPa5dwYn+siwz88w62HRPRuMz\r\nE/RLd5X5lOBgDvqZcH2KBHTbiavDg9ZCf2bQL9/9+TlHE5acGCotRf/9jdt/\r\nnQ58IPd6+iXkCzVptpL1cMLBDl8Z9Pf09Sk6BnCZ4grjIkmK3NoiW20Ed4xb\r\nL9MWQ/+3r2yDKcx2N7K3eiVFfJI/bDWH7+h9j25aRpGbed5tFnDbHwUXZx6K\r\nDFb/dt8M73q6R7GHC3lvWNzXDi6yeNc0xYr9+1f8zX6cmTeX5IQt+JE+IZOQ\r\n7fDvNySQ/Y8f8dzgGeUCW22/Iyz0049ku0xxu8H0lUPDV775kW565LldcNrH\r\nVdVy435EMnqFiCcskhSaFj7iR9wzc7P2wpserGJZM+xHMu/qrPWCA/prfeq+\r\n+pFPdbVFB+GrvPQWv0E/4vJzqJKC/+ypzivt9yMXucNMGcz9jd/H79rnR9pW\r\nL631h3eUc4f97fEjjltUWoLhu9yuWyy6/UjKvseuR+BubZaKkU4/8v7I1p6j\r\nzHrZnb86qcOP2Of5j5+ED97/9eNDux9JqmYLOgVf6Lq869gHP9L0PmUuGq5Z\r\nbF63us2P8A7LRsTAkxqj6i9b/Yjtv7LFcbDoUy3DQThOyDIxAf4kv8yp6j8/\r\n0qDULpgMZySN0BPxeiuXOelUWGx3zjVdfN4ZetzNi8z9rD1Wzf3Rj9RGSahl\r\nwJdVXdq6YfO7JkbZsMQCH/cZjPdUXXNNDtzpNbLGDfOp6fLcnAtfaXxprNbl\r\nRwj3qR0FzPq6csz/A+Z/YrVgVxFz/hwucUWf/chj3Rv7bsNZlNaNE1ivv7a6\r\nI3eY9dDK92R7rx8x2ld36D4sZTTSLo/1PXrEZaYMllU3jZ0e8CNVScPHK2Fe\r\nY81D77Bf66uXxj2CHzqJmJzBfqdHbBl8wtzP4Tg1DdTDnEWSWQ1sHf5vdcd3\r\nP1L9TmC2Fi6/MciuNovxfhX1egsn/yx91cZGkZxit6fvYcuYdQ9PclKELeCK\r\n+H/wX/HLxYrMel3/OfgD/N+dZVmt3BR5Ob/6/Uc43vxUUjgv8lTNXpVOeEP7\r\n9Ml1/BSJOZMb08087++fbtizgiLDtoP9PfDiFN7edGGKWAusM+1n1vv2nSfe\r\niiNPf/DJ+MJcH8F8SS7kbZ4rRb++wr7//XhoivPZJK9WPAazOifM3kY+3m6s\r\nKzoNz7k99U8wpkgpW2jQLFwrwcv/0gx5v/5B8xzs9tn19vwmirRvMz79D/7h\r\n+WPED/eJvsiJXtaJEbPH0iT2OvJmRtdTIw74bF+8fMcO5Edv8x9ccLdIlGrD\r\nboo8UjlttxQ+7evVIepFEakfdQW8sHq1RYwP8mPPcRtPAfjU7iV9XIcp4pWy\r\nrVEc9ruZmGp5FvfJY898VXh2/aX5F6UUOSl43M0R5l86L0YJIL+JBw3vgNf8\r\nFDncIkIjojJ+Ia5w5WedZoNVNHJPzTXFAx5Tv+6irEwjA9Y6r73hpmU1jXst\r\naMQqYtzgOJzc+K+iOYxGlk3sEsuDX8bMO2bgedT50/HmTThsE8/zoUEaufnH\r\nRrcILvsnrrEezzOyxGDbHVg1yJC39TeNBMiuPFsFr7qfq8+5nE7adjb9boJT\r\njl0vsjSlk6w6k48zsKvtrX0jKXSScHzQcA5ekf21szCdTo5pJWbNw2+mpHf4\r\nXaET1+yufayTI2ZmqWlWY3j+CoYcm+CG7X4HikpV0kmsXBW7FHyFI6TLFs/z\r\n0M49B1bDBQdmyrZ10smB80teycCL6kISXXroxHzBJVEelowLNd0/hH7gvxkR\r\nDfjOUuHMnhk6GY/LPqoF767Ib5f9QyedZpbdOjDPPr2VPug3HtxKu24AL3ng\r\nem6KA/1ttI6qOfP3D1w+wyaA/sqwK9kCLuFXeWkhxCAOU1E/rGD36kdscSIM\r\norqrtXIL7Crw+fgK5EnJFcfE7Znje8x46CzDIDyv1oRvg8t8WH5nIl8Oawdu\r\ndIbvPpEOkkW/1T4ilucKmxYFFW5D3qy9WsPlDo+mLl/8QYNBcnkEmjzhXTSb\r\np5/Rv3kM3HHxheXEnmhOEQbZkuHykII/c7onHd7IIEb2LFIMOGNqdvQ3+kPR\r\n6q39gfBCneYNNhvkxYCZTcFwxf1m1jNbGGRaPvtmKLwvi/JYas8grSkTtOPw\r\nf4fzhAWRP2s2p709AUd4bgxKd2aQu/+MtSJhA9uetxLod6+WfUmNghMcdRc5\r\nIH8m+iXMnoavsvSEi3kwyHFpHbdYOPBW7Ez/bgahPnQ+ioMtdmodurWH+fdf\r\n5VPJsPL903sI8mn9qY6P5+EZp6A+FvTjFi/OqqfC7LN79j3zRj7cNNx1iTk/\r\nY2OvDcinNdHp2pfhvM+Kg2zo781qLeOyJpnfPxY5+Bz51MQyT+86bF33w9sc\r\n+aD6jFPSDdjJp3eYA3nCsJ5jMB+W5mn2fYm8UcVValQIj92uHo1GHtHbvC+l\r\nmDke+0LKIoz5/zsRGLkNTyubvihGntFpeEbuwoa5b1UqkUc1bVZPlMGO53+w\r\nNCMP3YlrNq+E5ZdE+35CXlJ7E55ZBdNOrmz9gjyqvKXL6gkcTdfPn0fektua\r\ncb2euT/WJ7YonsH+J22ea4Bjn/FX6MQwyJq3s/aNcLPetdVmschH/Dfzm2HB\r\nO1pnbc8yyGoH54V38JDcyx/OcciX5xY5tcIqWTt27YtHnnhfVtTGXB+hoVp6\r\nAoNcFvBi+whzH5C5JJvIIOLbBV07mO9/6PHGw3BGyvOSLjj16M6Jl7BIa8Ci\r\nHljv9HT6yiQGWen07v4A/CJTdaIC5ndO5JuAL9Rmpc8lM/OBsdc35u+/M9ho\r\ncw55vH3s4Xf4b0fbeCbM7WrjMwN7TfFtND7PIDGX5p78hrnmC8cT4MWfClbO\r\nw02LLNO74dNirrQF5vsv79+gloJ87Mb1guXbiJmuxInxE3BkZoUYO6zcxMF/\r\nDGbtPODPCb8zOdPDBp+UWFm/GD5csuRuLN5vwf2lFDdstzo+gh8+diXoMA8s\r\nd45v20WM70/Xmjd88BvWczJS8KxH5JEVsHV/6nMlzC84W+OtECzjKHLhHub/\r\n63OPnAhc+yJjvz783dO0VQI2z8vmtMT6+edMKK6Ch1bKtDVi/b/1XomQhhPP\r\n5OY5wuN751XlYG6fAsu92K+2Ac/KdXBvfmRrN/bz6YGXZkpw1KDbHje4cEjh\r\ntQrcNnWFYY39v+Cb6KgO7xNZk9eKegkf+96lCX8zudnpgXrypjsf1IHDvVRW\r\nDCP/GwWsDjOAL91bf/Ivs/5+RrEbw/Ifq8vPIO/zBw/Hm35jPh/MxpejXgeO\r\n3Ms2h9/a2u6UQ76PjzB/aQcv+uqpvTUE68FeYOcAp/IO+n7E+fKM5m3fzlwf\r\nbb+cfcjr1osD9uyA7+z89mE8APk5tm3EBT6t87U/DHldaqlhkNs3Zn/0lfGH\r\nhvsqIfvvLrji+tc/R5HXO5K9+ffBgwJDK44fYJAXAo2XvOA566Hsv/uQ3y9o\r\nrPGGBSOHlMJxv0Smz+nQYMtvQxtP4H5SvBrvFgIXvRkOjNiGfCozNXDkG/P7\r\nXCP/WHH/LVx3oh+Duw1G4iJxPw6trZoJh6f9R4TZcX++z5eKiID74vhkFaxw\r\nnyic4o5izu9jUH6yOYPkFX1NOQ3vketQnMX9fKTkTl4cs15q8jXq9PE80RBS\r\nT4R/8fOVqeI+t71/5EEyrOURpJemifNbseFNKnxvlph6KeE+fNw6lQ3fVvlk\r\nyy7JIPeI/tFr8HgYeesrivNbc4XjBrPe6/O2v8fz6bQ5W2I+TAnxftDH8+tQ\r\n7QHhQuZ89wbuzOFjkJ1Wr68Ww6FOyb83ceM+bVBTLGGO54T2sRROnO+mWaNS\r\neKr1WITqPJ0c7JKIqYerFLPSMtroJIhPc7ABbvRstNF7TycnTS3NG+GH6fMs\r\nbY10kp7jz/Ievsjl5rf8JZ3Ue9WGdjDXv29byMQdOlk3wfCZYJ6/WP9C5dN0\r\nMrJQYy04hTzxfjvbaQU6mVZrv7kSfqlvst5zDZ2w7RlfJArvyVlHGUjSmX8P\r\nei4JXzr0978JfjqxOUMZysMBPPkFzO8DFy9bqWwA69nOxu17TiO01T68nvA3\r\nke0VT53RL53XytoLX9g0tsvdnkbcORdUveAdjGiOWSsasR45b+87xfz3rgoH\r\nNQMaWVdanRIE0w9LjF2RwOst+cViYTlOiVi9fvSHVZ8K42D9kjxv/U6KtCjf\r\nMEyEudw1rAz+o0jNcoNdKfDIPYvFRnUUye7Yd/UK7L3PP9q0iCI7GRVy9+Di\r\nQ3U6G0Mo8r43oqIUbqn14rXwp8hmR1urCnjrKo4vVn4U0dPv9amGvzeSC3bo\r\nR1eyL71Vy5yvUtV3V0vk98P/Gb+CPSJcGtzR/3IOZTe9hjs+TufsNqTIsZ2+\r\nu5tgZ83UI3t1kJffaH97Cx+P0XLwUqOIn+m/ky3w16ltHfqKFOm7+2p5G3O+\r\nG6P3/beWIu/SPLQ6mJ/fPxzIgzxstUThRResqSMxny9CkadHfzj2wNVRdlEb\r\nBSly2zMm+AtsLH//QthS5IOWbYuH4PrgLxIrF1PkyibJ9JEp5vc/hG/cRf6I\r\nV7z3YJI5f+9jZUO//QjHlWPW35nzqbxtHPULeWiZZcdP+MqS3perpvzI94jl\r\n1AzcvXOF3cMxP+L7s2P+N+xTuKltxxDy84G8hHmY7T/J5cLIT64fD0n9gzmV\r\nhC7WIG+9tTEsYf2Oz4/gkaQjn1k95iQcsGwb+3VR5LmtDz+8WARfzVnE9faT\r\nH9lRWbB5CSxOW0I7jfzodW/Ldj54Hfuy9T9a/AhVsqqdH77etPxywTs/ElQ8\r\n5b4C1r0kyOrZ7Eci81IPiMDK6mKv3zT4kbPXD46KwU/mJNRP1fuRc1f1D0nC\r\nhrWrUvVrkeeuLP21Ci4/JzM3+dyPXM3oOiIDW7mv3Z33zI/kXyxZkIWfy697\r\n4f7ED/dfxCl5eP3/KrjzcKq2MAzgQkTGRiQRypBQkeJq1Y1uSK4xUySKzjn7\r\nEJlut0kooqIyRCQRV4YMkRSSmaKQDJkyz0Wl6b77z99zDvZe61trfe/jnM0/\r\nnzhVwiAF182WKMEZb7VbJ+CScPmwTfD6hPNLx+GK0C+iqnCUWxUZhesv1dxS\r\nhwW3CXoPw+8vsBI14W/V0T0DcN/ZXfI7YFZk98p+eOS0aLo2PGAvZ9gLf/XO\r\nzyXwq9ms/C74t2ew1p/w3pK50Q6Yx8O6RA9+Eqwt/R4WopT3/AWrmp63eAev\r\nZPysNIBTJKtCWmFJ11eGB2DJIYHSt7Ccy93XB+HrOaZzzbCyk6eFKaw29Pex\r\n3bj/LQ56783hHvlfOpcxPjvtVjtYwX4u6cubMH67rUf6rWHFZMtRMYyviVnY\r\nxGHYY31W1APMB2tfC4cbLCHlOFuF+fTamxrIgOvsBGqEWxnk9G4/fgp2iitM\r\nsML8B+gaXnWHl3U4eyegPkK0167wpOdDXPTAUCeDRGhNRZ+Cba1LZFVRXzEa\r\nZWt9YYFotwVv1F/ilsgkf/hp68qmZ/0M8kDVZeO/sNuc+kAz8n3Wpu0ZZ+HD\r\nnIUV8qjvAkU+9QuwubDufV/k+5eyD3cGw/NKBseksF76Vs8duA5fdHQadkM+\r\nH11R1RwJq7OHq58KMcmMaIzVLXjjaSpNGHmcQ+CPI7fhmij/E/nI37x8woPx\r\n8LNkDkM6fwvx9J5IhPNygpRt5ej9JncqCT5SKiCQqcAkazkCve7DEUFpOpoq\r\nTKKfwduYCo8VrlB7soVJ3A+FbEyH4ybOyupqMUlF9tX3mTCHlSW//p9McuJI\r\nLCmEV8lzvbOwZpKC8iyBOnhXmZ3nqUAmMQ58nzwNL900M/V7lEl81e1/zcJn\r\nsqfrPGeY5G7XB6s5+v62TKcOfcF+pvGRfwFOn/owPsDNIrGDU+5cn7C+V8k+\r\nVJRmkcF9i/9YBb90SlPJtWSRM/xqLdrwfqHjI7rlLLL86/Ejup/ozw8wp/xq\r\nkI8/JkwQ+EKnx1zeaxZpLhXm0YefpJ9epPyBReR9pjRNPtH95+a00O8sUt+f\r\nGe0Ml5z7KnZfjSJHmgbljsOJDTP6f23H+fZMKscNDpQY8xr7gyLSseE1FGyc\r\n1/Va3ZAinibUgi+cNWmrznLBeVeiYhcGD97n1PBCvs5Kdxm+Cq/812elRgzy\r\nb3S8VwS813x8bu4ORShPwbAo+B5na4FPOkW4juiJx8JN7QZRWjh/o43/vR8H\r\nc+Q89/mWT5FNOvnqCfBk4LZDT4opUqY4UXIXXmufpvVPGUUsV8sbJMPV+T+b\r\nnCtxXnPbt6bA86GHa8XqkN976if/gxfrSBefe0sR11sZ6wpg2bh7cSZDFPkZ\r\nMPBfIazsxX2Te5wiER6SWsXwViOXsMJpihQbXTEphd0WNpyRXqCIyc6KznLY\r\noznY+y3y+cDGH64v6fF7MExd4mITIS7m+Vo481C6w7QAm9ybvifYAGuf8l3q\r\nIIq81t0R8wr+7mZm9HkF+q0iw0dvYX8zvkYpSTbJZyv3d8PL5U81eSohjwqs\r\n2NsLT/ReU6xXYRO5tB/J/fDmxIzzcsjfEX0Nx4bhXvEB9ZbtyKtnC6pG4eLW\r\n35dVtNmEQzJBYQK+GbmmL1CXTSgL99GZT/T3Ic0iNJG/5WcPGX6GZWqp0XD0\r\ni53huzPm4SUvNAZ60U9GKisJfoM/T8ZcVDVGf1y9jPoOf5D4Jfcv+tFFLt8b\r\nf8J1+k4va9GvFi4aUOX4jH74ZKWLGPL5Bu38GW44vDY8JdeaTbra4k15Yf/5\r\nWf1F6HdveAXl8sHH1lsNGSOPc2ZanRKCd/mvUxh1YpMiA9IqAiunBFRvR/52\r\nH1LYvvwz/bzIIddA5O9u6YWvq+FJxew0aeTtmyV91hJwu8UKAwp528im7okk\r\n/PK872gx+neuL7lr1sE5DztD+JC3n0TGnZaBY8OvRgojD3ioBXbJwuzNlSmO\r\nyNsKDSzdDbB+44+iHOSHWzy7OJThWcETPWbI2wfubTyiAtc8TPyUjLzNTUTK\r\nVeE7B9p45pG3T/r1BmyDDcP2qtD/71VcVTugCcuo/ENGkFd6Hj3S2wF/qc8x\r\n24l8YzwewKv7mf7+wTr/zotssvgy05XQ45VhEaYShH5e3qJmD2xidCXxDPKS\r\nZ/kfSnrwhvHy3FfIU0oOG0L3wT9Cv1VKI2/1fhca3w83K6u990Aei47+YmRE\r\nX+8rC2495DcTjZ6HxnBiZ1NLFszbXC30N2wwciBVAnnvGZXDNoPn5mp8A2Hv\r\npbGvLeAGTn2DaXhgLyPCBl4vqTtB5+/bvWaf7OjXFZ48U0O+ND2jY+4A+2ho\r\nXrsNlz4WXOUM1xtv3uqBfOpjPu99jH7dNp27E948093mSo+P64ZWfeTZj2FV\r\nWgz6/V5JqTlwnFJ2DAv2Pi/lJ4k8bFYVvcCm3x8eaxAM8zuftz0J18WukpyF\r\nyzhOPPWi358aMWGHfO0bb7rWBz76ZzpDGn5eseekHz3+rRr/PcP7eca3VP0D\r\nh5woG7WDb+xc7nGOrpfr79xi8Pez295UXIZ/fuBxXYbr/fLrhfgV+LpnRGo2\r\n7k93Qx4VDsvySg0Zw/VeN8Qi6fHcrHEsFOOzPO4i6ybcVVZ6XxG2eeFVHgV7\r\nWBh9rMJ4Jo46r46FN4+0yR2Dh0QtmHFw2emjztzw5h16ZXdgM5Gpe0mYLy9H\r\njVV36ftXKvIpwvwWB8sz7tHX07JYNwHzz5m1svQ+zHXelDvwMvaH1sUrH8Be\r\nmxJqT6Berv2cc0uHB9vGrpmgnqSMWpdn0fWxOXCtJPK3i2elaw6s/b6pfxHq\r\nMSO2oCQXzgiUSh9Cve4cuXW8kF7fnY81c1HPlkFWxWWwecjoQQPUf/zDfSIV\r\ncKXG9lVqWB8Db7e7VMLbewM66ecRK//Y+KQaTrvyOum7L9aLrJhwHX09TK17\r\n7j70+l/i3ACLn3bNTsH65Dj5tfAVfCA0uqQT6ze89J3TWzg/7WvbX1jfLUPV\r\nj1vhkUKFj2ew/iWFiwTaYcnqQ7N52B/S7WMKuuCAwUIBGTc2qVyw5h+CTWX9\r\ndn9DHhdcb+AwAgdtSTNWdWQT8/0788bgot3tti7Yn267K/FNwuMmfG63sX/1\r\nRUkcnoalHXd4N9lgfT/nz52l54ftFsCL/c59cIF3Du401ODssmSTx4Jjdl/g\r\n815tpkfNkee3deR8g+Xj/e6N/M0menZ1PD/g2pdrPrMPssmVgGLbX/R+NFmy\r\nd96ITSSaby/mmsP+uotzkBP7tQbbzloAtukPUZDE/j7ctqhXCD4e1ZjMxP4f\r\nS1JdReGLRstkSrTw90RnfVbBzwpixA9vRT37R/0Wg98zum5mqrHJ0X6d4DXw\r\n8DqZZb9x3lTnBd+ShqVEjxx4s5FN/NeqSMnCtq8XHXaUY5NNQc335eGoq0nU\r\nhDSbXLdam68E5wkMXOWVQH0vPHqzDTZacrxZG+ehwNFDttvhS1W8/dVLsL/U\r\n/ezbAb8MevDJAvleNv6vWV24j2t0hTvO19bFk3674bKyEPmfOH8vUZGL9sK/\r\nzilrhnyhyPiubpH9cHjuQKwNzus7DwKiDemfbzBxlcF5biKqKG0Maw4/1RjG\r\neZ/f56lqBm9dc/P1qQ8UORPIZ2wPt1/Q47neSBG1ycwWB1glPueNVS1F+izN\r\n7Z3gC4/X3pVCf7FPIYF5HD47OqedUUIRkbptoR6wrGmKR1UGRZJEHKsD4dY/\r\nu5ZuDaRI1e2CPZnw6gb+1Hb0W3G5AgnZ8DuDr9ORyhRxr3P6/gh+U/txp/EG\r\nioh9F8p7DNfWljaWr6HICZvj8mXw7krv+f94KCIkLrbkLRx9+0ZRVTuLWN7y\r\na/hGzxdJq+88zSJKma8Uf8CXpbqv9nizyO+X8kG/4LvflpkNuKNfnGvS5ZpH\r\nvTw63T7mzCIL5krZAnC9rMngghGL3FneEbEOtjdkDpqvZZGP13QO6cEJnAfO\r\nXnlO5/eOhX3z9PNEu/SSi5hE08Y/3gD+5x+WwNNcJrkkW9h3EBafDYsZS2US\r\npYKtLBu4qb8x1+Aak7yJbRa2h6XXOfg7hSDvn/V45ACzbaaI/0X609lZX5xh\r\ngzfCjWm+TOKtYhx7HI4RSrxRdpJJpJZN6JyANxqp2bYzmaRqPvQDE/YKLpWZ\r\nOYZ+vkPpAhtOqVgiLnqEScRLa+ROwn6/tDmt7ZikPNm1yov+/VrssUQrJllO\r\npQj4w4UPW0rUjNHfc6yPujhPPw80yclEm0kcPpbuCIZvv24xjNZkkiW1Dp2X\r\nYRY/n0aPOpNYR8bLXIU7zrJ53ZE3OH11Kq7DD4uSph/LMkm6XcexG/D+uZb2\r\n31JMYrbbny8KllTle7FPgkl+yItnxMB6xpVnolYyyX3+QuM4+nr2HoqJXIZ8\r\nMWU5cwdW0h7NvSrMJAmFNzSTYU1FoZFgPibZYyhSlglv4LY08/3JIKOqWUdz\r\n4Offh1heCwwSucKYJw/eMut3yf0Lgwx0hRoWwdo98SWuMwwSVq40WQxntqq+\r\nc55kEM3UmmvPYJmGslnHMQbpDnXdWgYXVZgJ2g8zSLA7b+sLuFs/aMb+I4Oo\r\nWaT4VsL5fzPLPAYY5N0OvTU18/TzUUyvByIvKnEFODbCkSel1B8iT9bf/DX6\r\nDk66U+D+o4tBTvnHh3XQ85MWR0RgKQcdtW74YN4FETnkU7aC/6l+2LLWONsQ\r\n+VVMUFxsEFZp2XbOoZ1BSmcePxmGD/dImHgi77q1WtqPwRpjHNLBbQyyrHju\r\n9wS8dH5wKhb5+H+PylPO\r\n \"]]]][\r\n Part[#, 1]]& )[\r\n MousePosition[{\"Graphics\", Graphics}, {0, 0}]], \r\n CalculateUtilities`GraphicsUtilities`Private`scaled = \r\n MousePosition[{\"GraphicsScaled\", Graphics}, None]}, \r\n If[\r\n CalculateUtilities`GraphicsUtilities`Private`scaled === \r\n None, {}, {\r\n Text[\r\n Style[\r\n Row[{\r\n (\r\n DateString[#, {\r\n \"DayShort\", \" \", \"MonthNameShort\", \" \", \"Year\"}]& )[\r\n Part[\r\n CalculateUtilities`GraphicsUtilities`Private`pt, 1, 1]], \r\n (\r\n Function[{\r\n CalculateUtilities`GraphicsUtilities`Private`a, \r\n CalculateUtilities`GraphicsUtilities`Private`acc}, \r\n Quiet[\r\n RawBoxes[\r\n ToBoxes[\r\n NumberForm[CalculateUtilities`GraphicsUtilities`Private`a, \r\n Max[1, \r\n Ceiling[\r\n RealExponent[\r\n CalculateUtilities`GraphicsUtilities`Private`a] + \r\n CalculateUtilities`GraphicsUtilities`Private`acc]], \r\n ExponentFunction -> (Null& ), \r\n NumberFormat -> (StringReplace[#, StringExpression[\r\n Pattern[CalculateUtilities`GraphicsUtilities`Private`s, \r\n BlankSequence[]], \".\", EndOfString] -> \r\n CalculateUtilities`GraphicsUtilities`Private`s]& )]]]]][#,\r\n 0]& )[\r\n Part[\r\n CalculateUtilities`GraphicsUtilities`Private`pt, 1, 2]]}, \r\n \",\"], 12], \r\n Part[\r\n CalculateUtilities`GraphicsUtilities`Private`pt, 1], {\r\n 1.5 Sign[\r\n Part[CalculateUtilities`GraphicsUtilities`Private`scaled, \r\n 1] - 0.5], 0}, Background -> White], \r\n AbsolutePointSize[7], \r\n Point[CalculateUtilities`GraphicsUtilities`Private`pt], \r\n White, \r\n AbsolutePointSize[5], \r\n Point[CalculateUtilities`GraphicsUtilities`Private`pt]}]],\r\n TraditionalForm, Graphics]]}, FrameTicks -> {{{{220., \r\n FormBox[\r\n TagBox[\"220\", #& ], TraditionalForm], {0.00625, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.25]}}, {230., \r\n FormBox[\r\n TagBox[\"230\", #& ], TraditionalForm], {0.00625, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.25]}}, {240., \r\n FormBox[\r\n TagBox[\"240\", #& ], TraditionalForm], {0.00625, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.25]}}, {250., \r\n FormBox[\r\n TagBox[\"250\", #& ], TraditionalForm], {0.00625, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.25]}}, {222., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {224., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {226., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {228., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {232., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {234., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {236., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {238., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {242., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {244., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {246., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {248., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {252., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {254., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {256., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}}, {{220., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00625, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.25]}}, {230., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00625, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.25]}}, {240., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00625, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.25]}}, {250., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00625, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.25]}}, {222., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {224., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {226., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {228., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {232., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {234., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {236., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {238., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {242., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {244., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {246., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {248., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {218., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {216., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {214., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {252., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {254., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}, {256., \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {0.00375, 0.}, {\r\n GrayLevel[0.], \r\n AbsoluteThickness[0.125]}}}}, {{{3605299200, \r\n FormBox[\"\\\"Apr\\\"\", TraditionalForm], {\r\n 0.020601132958329826`, 0}}, {3607891200, \r\n FormBox[\"\\\"May\\\"\", TraditionalForm], {\r\n 0.020601132958329826`, 0}}, {3610569600, \r\n FormBox[\"\\\"Jun\\\"\", TraditionalForm], {\r\n 0.020601132958329826`, 0}}, {3613161600, \r\n FormBox[\"\\\"Jul\\\"\", TraditionalForm], {\r\n 0.020601132958329826`, 0}}, {3615840000, \r\n FormBox[\"\\\"Aug\\\"\", TraditionalForm], {\r\n 0.020601132958329826`, 0}}, {3618518400, \r\n FormBox[\"\\\"Sep\\\"\", TraditionalForm], {\r\n 0.020601132958329826`, 0}}, {3603830400, \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {\r\n 0.012360679774997897`, 0}}, {3606508800, \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {\r\n 0.012360679774997897`, 0}}, {3609100800, \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {\r\n 0.012360679774997897`, 0}}, {3611779200, \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {\r\n 0.012360679774997897`, 0}}, {3614371200, \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {\r\n 0.012360679774997897`, 0}}, {3617049600, \r\n FormBox[\"\\\"\\\"\", TraditionalForm], {\r\n 0.012360679774997897`, 0}}}, {{3605299200, \r\n FormBox[\r\n StyleBox[\"\\\"\\\"\", 0, StripOnInput -> False], \r\n TraditionalForm], {0.020601132958329826`, 0}}, {\r\n 3607891200, \r\n FormBox[\r\n StyleBox[\"\\\"\\\"\", 0, StripOnInput -> False], \r\n TraditionalForm], {0.020601132958329826`, 0}}, {\r\n 3610569600, \r\n FormBox[\r\n StyleBox[\"\\\"\\\"\", 0, StripOnInput -> False], \r\n TraditionalForm], {0.020601132958329826`, 0}}, {\r\n 3613161600, \r\n FormBox[\r\n StyleBox[\"\\\"\\\"\", 0, StripOnInput -> False], \r\n TraditionalForm], {0.020601132958329826`, 0}}, {\r\n 3615840000, \r\n FormBox[\r\n StyleBox[\"\\\"\\\"\", 0, StripOnInput -> False], \r\n TraditionalForm], {0.020601132958329826`, 0}}, {\r\n 3618518400, \r\n FormBox[\r\n StyleBox[\"\\\"\\\"\", 0, StripOnInput -> False], \r\n TraditionalForm], {0.020601132958329826`, 0}}, {\r\n 3603830400, \r\n FormBox[\r\n StyleBox[\"\\\"\\\"\", 0, StripOnInput -> False], \r\n TraditionalForm], {0.012360679774997897`, 0}}, {\r\n 3606508800, \r\n FormBox[\r\n StyleBox[\"\\\"\\\"\", 0, StripOnInput -> False], \r\n TraditionalForm], {0.012360679774997897`, 0}}, {\r\n 3609100800, \r\n FormBox[\r\n StyleBox[\"\\\"\\\"\", 0, StripOnInput -> False], \r\n TraditionalForm], {0.012360679774997897`, 0}}, {\r\n 3611779200, \r\n FormBox[\r\n StyleBox[\"\\\"\\\"\", 0, StripOnInput -> False], \r\n TraditionalForm], {0.012360679774997897`, 0}}, {\r\n 3614371200, \r\n FormBox[\r\n StyleBox[\"\\\"\\\"\", 0, StripOnInput -> False], \r\n TraditionalForm], {0.012360679774997897`, 0}}, {\r\n 3617049600, \r\n FormBox[\r\n StyleBox[\"\\\"\\\"\", 0, StripOnInput -> False], \r\n TraditionalForm], {0.012360679774997897`, 0}}}}}, \r\n ImagePadding -> All, GridLines -> {{{3605299200, \r\n GrayLevel[0.9]}, {3607891200, \r\n GrayLevel[0.9]}, {3610569600, \r\n GrayLevel[0.9]}, {3613161600, \r\n GrayLevel[0.9]}, {3615840000, \r\n GrayLevel[0.9]}, {3618518400, \r\n GrayLevel[0.9]}}, Automatic}, Epilog -> {\r\n Directive[\r\n AbsoluteThickness[0.5], \r\n RGBColor[1, 0, 0]], \r\n \r\n LineBox[{{3611188800, 212.72879241512837`}, {\r\n 3611188800, 257.21097084166985`}}], {\r\n CapForm[None], {\r\n GrayLevel[1], \r\n PolygonBox[{\r\n Offset[{-4.6, -4.25}, \r\n Scaled[{0, 0.08}]], \r\n Offset[{-4.6, -0.34999999999999987`}, \r\n Scaled[{0, 0.08}]], \r\n Offset[{4.6, 4.25}, \r\n Scaled[{0, 0.08}]], \r\n Offset[{4.6, 0.34999999999999987`}, \r\n Scaled[{0, 0.08}]]}]}, {\r\n AbsoluteThickness[1], \r\n GrayLevel[0], \r\n LineBox[{{\r\n Offset[{-4.6, -4.25}, \r\n Scaled[{0, 0.08}]], \r\n Offset[{4.6, 0.34999999999999987`}, \r\n Scaled[{0, 0.08}]]}, {\r\n Offset[{-4.6, -0.34999999999999987`}, \r\n Scaled[{0, 0.08}]], \r\n Offset[{4.6, 4.25}, \r\n Scaled[{0, 0.08}]]}}]}}}, PlotRangeClipping -> False, \r\n PlotRangePadding -> None, AspectRatio -> 0.3, \r\n AxesOrigin -> {3.604*^9, 214.}, AxesStyle -> Directive[\r\n GrayLevel[0, 0.35], FontColor -> GrayLevel[0.25], \r\n FontOpacity -> 1], BaseStyle -> AbsoluteThickness[1], \r\n Epilog -> {\r\n Directive[\r\n AbsoluteThickness[0.5], \r\n RGBColor[1, 0, 0]], \r\n \r\n LineBox[{{3611188800, 212.72879241512837`}, {\r\n 3611188800, 257.21097084166985`}}]}, Frame -> True, \r\n FrameLabel -> {None, None}, FrameStyle -> Directive[\r\n GrayLevel[0, 0.35], FontColor -> GrayLevel[0.25], \r\n FontOpacity -> 1], FrameTicksStyle -> \r\n Directive[FontFamily -> \"Times\", FontSize -> 10], \r\n GridLines -> {{{3605299200, \r\n GrayLevel[0.9]}, {3607891200, \r\n GrayLevel[0.9]}, {3610569600, \r\n GrayLevel[0.9]}, {3613161600, \r\n GrayLevel[0.9]}, {3615840000, \r\n GrayLevel[0.9]}, {3618518400, \r\n GrayLevel[0.9]}}, Automatic}, GridLinesStyle -> \r\n GrayLevel[0.9], ImageSize -> Full, \r\n LabelStyle -> {FontFamily -> \"Verdana\", FontSize -> 10}, \r\n Method -> {\"AxesInFront\" -> True}, \r\n PlotRange -> {{3603398400, 3619123200}, {212.72879241512837`, \r\n 257.21097084166985`}}, PlotRangeClipping -> True, \r\n PlotRangePadding -> None, Prolog -> {\r\n Opacity[0], \r\n TagBox[\r\n RectangleBox[\r\n Scaled[{0, 0}], \r\n Scaled[{1, 1}]], Annotation[#, \"DatePlot\", \"Frame\"]& ]}, \r\n TicksStyle -> \r\n Directive[FontFamily -> \"Times\", FontSize -> 10]}], \r\n TagBox[\r\n GridBox[{{\r\n TagBox[\r\n GridBox[{{\r\n StyleBox[\r\n RowBox[{\"\\\"(\\\"\", \"\\[NoBreak]\", \r\n FormBox[\r\n TagBox[\r\n FormBox[\r\n TemplateBox[{\"\\\"from \\\"\", \r\n FormBox[\r\n TagBox[\"\\\"Mar 10, 2014\\\"\", Identity], TraditionalForm], \r\n \"\\\" to \\\"\", \r\n FormBox[\r\n TagBox[\"\\\"Sep 8, 2014\\\"\", Identity], TraditionalForm]}, \r\n \"RowDefault\"], TraditionalForm], \r\n Format[#, TraditionalForm]& ], TraditionalForm], \r\n \"\\[NoBreak]\", \"\\\")\\\"\"}], {\r\n FontFamily -> \"Verdana\", FontSize -> 10, \r\n GrayLevel[0.5], \r\n LinebreakAdjustments -> {1, 100, 1, 0, 100}, LineIndent -> \r\n 0}, StripOnInput -> False]}}, \r\n GridBoxAlignment -> {\"Columns\" -> {{Left}}}, \r\n DefaultBaseStyle -> \"Column\", \r\n GridBoxItemSize -> {\r\n \"Columns\" -> {{Automatic}}, \"Rows\" -> {{Automatic}}}], \r\n \"Column\"], \r\n TagBox[\r\n GridBox[{{\r\n StyleBox[\r\n RowBox[{\"\\\"(\\\"\", \"\\[NoBreak]\", \r\n \r\n TemplateBox[{\r\n \"\\\"in \\\"\", \"\\\"thousands\\\"\", \"\\\" of \\\"\", \"\\\"miles\\\"\"}, \r\n \"RowDefault\"], \"\\[NoBreak]\", \"\\\")\\\"\"}], {\r\n FontFamily -> \"Verdana\", FontSize -> 10, \r\n GrayLevel[0.5], \r\n LinebreakAdjustments -> {1, 100, 1, 0, 100}, LineIndent -> \r\n 0}, StripOnInput -> False]}}, \r\n GridBoxAlignment -> {\"Columns\" -> {{Left}}}, \r\n DefaultBaseStyle -> \"Column\", \r\n GridBoxItemSize -> {\r\n \"Columns\" -> {{Automatic}}, \"Rows\" -> {{Automatic}}}], \r\n \"Column\"]}}, \r\n GridBoxAlignment -> {\r\n \"Columns\" -> {{Automatic}}, \"Rows\" -> {{Baseline}}}, \r\n AutoDelete -> False, \r\n GridBoxItemSize -> {\r\n \"Columns\" -> {{Automatic}}, \"Rows\" -> {{Automatic}}}, \r\n GridBoxSpacings -> {\"Columns\" -> {{0.5}}}], \"Grid\"]}, \r\n \"Labeled\", DisplayFunction -> (FormBox[\r\n GridBox[{{\r\n TagBox[\r\n ItemBox[\r\n PaneBox[\r\n TagBox[#, \"SkipImageSizeLevel\"], \r\n Alignment -> {Center, Baseline}, BaselinePosition -> \r\n Baseline], DefaultBaseStyle -> \"Labeled\"], \r\n \"SkipImageSizeLevel\"]}, {\r\n \r\n ItemBox[#2, Alignment -> {Left, Inherited}, \r\n DefaultBaseStyle -> \"LabeledLabel\"]}}, \r\n GridBoxAlignment -> {\r\n \"Columns\" -> {{Center}}, \"Rows\" -> {{Center}}}, AutoDelete -> \r\n False, GridBoxItemSize -> {\r\n \"Columns\" -> {{Automatic}}, \"Rows\" -> {{Automatic}}}, \r\n BaselinePosition -> {1, 1}], TraditionalForm]& ), \r\n InterpretationFunction -> (RowBox[{\r\n StyleBox[\r\n \"Labeled\", FontFamily -> \"Bitstream Vera Sans\", \r\n FontSize -> -1 + Inherited], \"[\", \r\n RowBox[{#, \",\", \r\n RowBox[{\"{\", #2, \"}\"}], \",\", \r\n RowBox[{\"(\", \"\\[NoBreak]\", \r\n GridBox[{{\r\n StyleBox[\r\n \"Bottom\", FontFamily -> \"Bitstream Vera Sans\", \r\n FontSize -> -1 + Inherited], \r\n StyleBox[\r\n \"Left\", FontFamily -> \"Bitstream Vera Sans\", \r\n FontSize -> -1 + Inherited]}}, RowSpacings -> 1, \r\n ColumnSpacings -> 1, RowAlignments -> Baseline, \r\n ColumnAlignments -> Center], \"\\[NoBreak]\", \")\"}]}], \r\n \"]\"}]& )], TraditionalForm]], \"Output\", {\r\n Background -> None}]}], \r\n XMLElement[\r\n \"dataformats\", {}, {\"computabledata,formatteddata,timeseriesdata\"}]}], \r\n XMLElement[\"states\", {\"count\" -> \"2\"}, {\r\n XMLElement[\r\n \"state\", {\r\n \"name\" -> \"Use Metric\", \"input\" -> \r\n \"DistanceHistory:AstronomicalData__Use Metric\"}, {}], \r\n XMLElement[\r\n \"statelist\", {\r\n \"count\" -> \"5\", \"value\" -> \"\\[PlusMinus]3 months\", \"delimiters\" -> \r\n \"\"}, {\r\n XMLElement[\r\n \"state\", {\r\n \"name\" -> \"\\[PlusMinus]3 months\", \"input\" -> \r\n \"DistanceHistory:AstronomicalData__\\[PlusMinus]3 months\"}, {}], \r\n XMLElement[\r\n \"state\", {\r\n \"name\" -> \"\\[PlusMinus]6 months\", \"input\" -> \r\n \"DistanceHistory:AstronomicalData__\\[PlusMinus]6 months\"}, {}], \r\n XMLElement[\r\n \"state\", {\r\n \"name\" -> \"\\[PlusMinus]1 year\", \"input\" -> \r\n \"DistanceHistory:AstronomicalData__\\[PlusMinus]1 year\"}, {}], \r\n XMLElement[\r\n \"state\", {\r\n \"name\" -> \"\\[PlusMinus]5 years\", \"input\" -> \r\n \"DistanceHistory:AstronomicalData__\\[PlusMinus]5 years\"}, {}], \r\n XMLElement[\r\n \"state\", {\r\n \"name\" -> \"\\[PlusMinus]10 years\", \"input\" -> \r\n \"DistanceHistory:AstronomicalData__\\[PlusMinus]10 years\"}, \\\r\n{}]}]}]}], Typeset`pod4$$ = XMLElement[\r\n \"pod\", {\"title\" -> \"Unit conversions\", \"scanner\" -> \"Unit\", \"id\" -> \r\n \"UnitConversion\", \"position\" -> \"400\", \"error\" -> \"false\", \"numsubpods\" -> \r\n \"2\"}, {\r\n XMLElement[\"subpod\", {\"title\" -> \"\"}, {\r\n XMLElement[\"cell\", {\"compressed\" -> False, \"string\" -> True}, {\r\n Cell[\r\n BoxData[\r\n FormBox[\r\n StyleBox[\r\n TagBox[\r\n RowBox[{\r\n TagBox[\r\n TagBox[\r\n RowBox[{\r\n TagBox[\"385\\[ThinSpace]056\", \r\n $CellContext`TagBoxWrapper[\"StringBoxes\" -> \"385056\"]], \r\n \"\\[NoBreak]\", \r\n StyleBox[\r\n RowBox[{}], FontFamily -> \"Helvetica\", FontSize -> \r\n Smaller], \"\\[InvisibleSpace]\", \"\\[ThickSpace]\", \r\n \"\\[InvisibleSpace]\", \r\n StyleBox[\r\n \"\\\"km\\\"\", FontFamily -> \"Helvetica\", FontSize -> \r\n Smaller]}], Identity], #& , SyntaxForm -> Dot], \" \", \r\n StyleBox[\r\n \r\n RowBox[{\r\n \"\\\"(\\\"\", \"\\[NoBreak]\", \"\\\"kilometers\\\"\", \"\\[NoBreak]\", \r\n \"\\\")\\\"\"}], {\r\n FontFamily :> $CellContext`$UnitFontFamily, FontSize -> \r\n Smaller, \r\n GrayLevel[0.6], LinebreakAdjustments -> {1, 100, 1, 0, 100},\r\n LineIndent -> 0}, StripOnInput -> False]}], \"Unit\", \r\n SyntaxForm -> Dot], LinebreakAdjustments -> {1, 100, 1, 0, 100},\r\n LineIndent -> 0, ZeroWidthTimes -> False], TraditionalForm]], \r\n \"Output\", {}]}], \r\n XMLElement[\r\n \"dataformats\", {}, {\r\n \"plaintext,computabledata,formatteddata,numberdata,quantitydata\"}]}], \r\n XMLElement[\"subpod\", {\"title\" -> \"\"}, {\r\n XMLElement[\"cell\", {\"compressed\" -> False, \"string\" -> True}, {\r\n Cell[\r\n BoxData[\r\n FormBox[\r\n StyleBox[\r\n TagBox[\r\n TagBox[\r\n TagBox[\r\n RowBox[{\r\n TagBox[\r\n RowBox[{\"3.851\", \r\n StyleBox[\"\\[Times]\", \r\n GrayLevel[0.5]], \r\n SuperscriptBox[\"10\", \"8\"]}], \r\n $CellContext`TagBoxWrapper[\r\n \"StringBoxes\" -> RowBox[{\"3.851\", \"\\[Times]\", \r\n SuperscriptBox[\"10\", \"8\"]}]], SyntaxForm -> CenterDot], \r\n \"\\[InvisibleSpace]\", \" \", \r\n StyleBox[\r\n \"\\\"meters\\\"\", LinebreakAdjustments -> {1, 100, 1, 0, 100}, \r\n LineIndent -> 0, {\r\n FontFamily :> $CellContext`$UnitFontFamily, FontSize -> \r\n Smaller}, StripOnInput -> False]}], Identity], #& , \r\n SyntaxForm -> Dot], \"Unit\", SyntaxForm -> Dot], \r\n LinebreakAdjustments -> {1, 100, 1, 0, 100}, LineIndent -> 0, \r\n ZeroWidthTimes -> False], TraditionalForm]], \"Output\", {}]}], \r\n XMLElement[\r\n \"dataformats\", {}, {\r\n \"plaintext,computabledata,formatteddata,numberdata,quantitydata\"}]}]}]\\\r\n, Typeset`pod5$$ = XMLElement[\r\n \"pod\", {\"title\" -> \"Comparison as distance\", \"scanner\" -> \"Unit\", \"id\" -> \r\n \"ComparisonAsDistance\", \"position\" -> \"500\", \"error\" -> \"false\", \r\n \"numsubpods\" -> \"1\"}, {\r\n XMLElement[\"subpod\", {\"title\" -> \"\"}, {\r\n XMLElement[\"cell\", {\"compressed\" -> False, \"string\" -> True}, {\r\n Cell[\r\n BoxData[\r\n FormBox[\r\n FormBox[\r\n \r\n TemplateBox[{\r\n \"\\\" \\[TildeTilde] \\\"\", \r\n \"1.00017081986198578379799203020065608125`4.767535813146223\", \r\n \"\\\" \\\"\", \r\n StyleBox[\"\\\"\\[Times]\\\"\", \r\n GrayLevel[0.3], FontSize -> 10.219999999999999`, StripOnInput -> \r\n False], \"\\\"\\[MediumSpace]\\\"\", \r\n StyleBox[\r\n \"\\\"mean Moon\\[Hyphen]Earth distance\\\"\", FontFamily -> \r\n \"Helvetica\", FontSize -> Smaller, StripOnInput -> False], \r\n \"\\\" \\\"\", \r\n StyleBox[\r\n RowBox[{\"\\\"(\\\"\", \"\\[NoBreak]\", \r\n TemplateBox[{\"\\\"\\[MediumSpace]\\\"\", \r\n StyleBox[\r\n TagBox[\r\n TagBox[\r\n TagBox[\r\n RowBox[{\r\n TagBox[\r\n RowBox[{\"3.85\", \r\n StyleBox[\"\\[Times]\", \r\n GrayLevel[0.5]], \r\n SuperscriptBox[\"10\", \"8\"]}], \r\n $CellContext`TagBoxWrapper[\r\n \"StringBoxes\" -> RowBox[{\"3.85\", \"\\[Times]\", \r\n SuperscriptBox[\"10\", \"8\"]}]], SyntaxForm -> CenterDot], \r\n \"\\[NoBreak]\", \r\n StyleBox[\r\n RowBox[{}], FontFamily -> \"Helvetica\", FontSize -> \r\n Smaller], \"\\[InvisibleSpace]\", \"\\[ThickSpace]\", \r\n \"\\[InvisibleSpace]\", \r\n StyleBox[\r\n \"\\\"m\\\"\", FontFamily -> \"Helvetica\", FontSize -> \r\n Smaller]}], Identity], #& , SyntaxForm -> Dot], \"Unit\", \r\n SyntaxForm -> Dot], \r\n LinebreakAdjustments -> {1, 100, 1, 0, 100}, LineIndent -> \r\n 0, ZeroWidthTimes -> False], \"\\\"\\[MediumSpace]\\\"\"}, \r\n \"RowDefault\"], \"\\[NoBreak]\", \"\\\")\\\"\"}], {\r\n FontFamily -> \"Verdana\", FontSize -> 10, \r\n GrayLevel[0.5], LinebreakAdjustments -> {1, 100, 1, 0, 100}, \r\n LineIndent -> 0}, StripOnInput -> False]}, \"RowDefault\"], \r\n TraditionalForm], TraditionalForm]], \"Output\", {}]}], \r\n XMLElement[\"dataformats\", {}, {\"plaintext\"}]}]}], Typeset`pod6$$ = \r\n XMLElement[\r\n \"pod\", {\"title\" -> \"Corresponding quantities\", \"scanner\" -> \"Unit\", \"id\" -> \r\n \"CorrespondingQuantity\", \"position\" -> \"600\", \"error\" -> \"false\", \r\n \"numsubpods\" -> \"2\"}, {\r\n XMLElement[\"subpod\", {\"title\" -> \"\"}, {\r\n XMLElement[\"cell\", {\"compressed\" -> False, \"string\" -> True}, {\r\n Cell[\r\n BoxData[\r\n FormBox[\r\n TagBox[\r\n GridBox[{{\r\n InterpretationBox[\r\n Cell[\r\n TextData[{\"Light travel time \", \r\n Cell[\r\n BoxData[\r\n FormBox[\"t\", TraditionalForm]]], \" in vacuum from \", \r\n Cell[\r\n BoxData[\r\n FormBox[\r\n FormBox[\r\n TemplateBox[{\r\n TagBox[\r\n RowBox[{\"t\", \"\\[LongEqual]\", \r\n \r\n RowBox[{\"x\", \"\\[InvisibleSpace]\", \"\\\"/\\\"\", \r\n \"\\[InvisibleSpace]\", \"c\"}]}], \r\n PolynomialForm[#, TraditionalOrder -> False]& ]}, \r\n \"RowDefault\"], TraditionalForm], TraditionalForm]]], \r\n \":\"}]], \r\n TextCell[\r\n Row[{\"Light travel time \", \r\n $CellContext`CalculateSymbol[\"t\"], \" in vacuum from \", \r\n $CellContext`InlineForm[\"t \\[LongEqual] x/c\"], \":\"}]]]}, {\r\n TagBox[\r\n GridBox[{{\r\n InterpretationBox[\r\n StyleBox[\r\n \r\n GraphicsBox[{}, ImageSize -> {10, 0}, BaselinePosition -> \r\n Baseline], \"CacheGraphics\" -> False], \r\n Spacer[10]], \r\n StyleBox[\r\n TagBox[\r\n TagBox[\r\n TagBox[\r\n RowBox[{\r\n TagBox[\"1.3\", \r\n $CellContext`TagBoxWrapper[\"StringBoxes\" -> \"1.3\"]], \r\n \"\\[InvisibleSpace]\", \" \", \r\n StyleBox[\r\n \"\\\"seconds\\\"\", \r\n LinebreakAdjustments -> {1, 100, 1, 0, 100}, LineIndent -> \r\n 0, {FontFamily :> $CellContext`$UnitFontFamily, FontSize -> \r\n Smaller}, StripOnInput -> False]}], Identity], #& , \r\n SyntaxForm -> Dot], \"Unit\", SyntaxForm -> Dot], \r\n LinebreakAdjustments -> {1, 100, 1, 0, 100}, LineIndent -> \r\n 0, ZeroWidthTimes -> False]}}, \r\n GridBoxAlignment -> {\"Columns\" -> {{Left}}}, AutoDelete -> \r\n False, GridBoxItemSize -> {\r\n \"Columns\" -> {{Automatic}}, \"Rows\" -> {{Automatic}}}], \r\n \"Grid\"]}}, GridBoxAlignment -> {\"Columns\" -> {{Left}}}, \r\n DefaultBaseStyle -> \"Column\", \r\n GridBoxItemSize -> {\"ColumnsIndexed\" -> {1 -> 0}}], \"Column\"], \r\n TraditionalForm]], \"Output\", {}]}], \r\n XMLElement[\r\n \"dataformats\", {}, {\r\n \"plaintext,computabledata,formatteddata,numberdata,quantitydata\"}]}], \r\n XMLElement[\"subpod\", {\"title\" -> \"\"}, {\r\n XMLElement[\"cell\", {\"compressed\" -> False, \"string\" -> True}, {\r\n Cell[\r\n BoxData[\r\n FormBox[\r\n TagBox[\r\n GridBox[{{\r\n InterpretationBox[\r\n Cell[\r\n TextData[{\"Light travel time \", \r\n Cell[\r\n BoxData[\r\n FormBox[\"t\", TraditionalForm]]], \" in an optical fiber \", \r\n Cell[\r\n BoxData[\r\n FormBox[\r\n FormBox[\r\n TemplateBox[{\r\n TagBox[\r\n RowBox[{\"t\", \"\\[LongEqual]\", \r\n RowBox[{\r\n RowBox[{\"1.48`\", \"\\[InvisibleSpace]\", \"x\"}], \r\n \"\\[InvisibleSpace]\", \"\\\"/\\\"\", \"\\[InvisibleSpace]\", \r\n \"c\"}]}], PolynomialForm[#, TraditionalOrder -> False]& ]},\r\n \"RowDefault\"], TraditionalForm], TraditionalForm]]], \r\n \":\"}]], \r\n TextCell[\r\n Row[{\"Light travel time \", \r\n $CellContext`CalculateSymbol[\"t\"], \r\n \" in an optical fiber \", \r\n $CellContext`InlineForm[\"t \\[LongEqual] 1.48x/c\"], \r\n \":\"}]]]}, {\r\n TagBox[\r\n GridBox[{{\r\n InterpretationBox[\r\n StyleBox[\r\n \r\n GraphicsBox[{}, ImageSize -> {10, 0}, BaselinePosition -> \r\n Baseline], \"CacheGraphics\" -> False], \r\n Spacer[10]], \r\n StyleBox[\r\n TagBox[\r\n TagBox[\r\n TagBox[\r\n RowBox[{\r\n TagBox[\"1.9\", \r\n $CellContext`TagBoxWrapper[\"StringBoxes\" -> \"1.9\"]], \r\n \"\\[InvisibleSpace]\", \" \", \r\n StyleBox[\r\n \"\\\"seconds\\\"\", \r\n LinebreakAdjustments -> {1, 100, 1, 0, 100}, LineIndent -> \r\n 0, {FontFamily :> $CellContext`$UnitFontFamily, FontSize -> \r\n Smaller}, StripOnInput -> False]}], Identity], #& , \r\n SyntaxForm -> Dot], \"Unit\", SyntaxForm -> Dot], \r\n LinebreakAdjustments -> {1, 100, 1, 0, 100}, LineIndent -> \r\n 0, ZeroWidthTimes -> False]}}, \r\n GridBoxAlignment -> {\"Columns\" -> {{Left}}}, AutoDelete -> \r\n False, GridBoxItemSize -> {\r\n \"Columns\" -> {{Automatic}}, \"Rows\" -> {{Automatic}}}], \r\n \"Grid\"]}}, GridBoxAlignment -> {\"Columns\" -> {{Left}}}, \r\n DefaultBaseStyle -> \"Column\", \r\n GridBoxItemSize -> {\"ColumnsIndexed\" -> {1 -> 0}}], \"Column\"], \r\n TraditionalForm]], \"Output\", {}]}], \r\n XMLElement[\r\n \"dataformats\", {}, {\r\n \"plaintext,computabledata,formatteddata,numberdata,quantitydata\"}]}]}]\\\r\n, Typeset`pod7$$ = XMLElement[\r\n \"pod\", {\"title\" -> \"Orbital properties\", \"scanner\" -> \"Data\", \"id\" -> \r\n \"BasicPlanetOrbitalProperties:AstronomicalData\", \"position\" -> \"700\", \r\n \"error\" -> \"false\", \"numsubpods\" -> \"1\"}, {\r\n XMLElement[\"subpod\", {\"title\" -> \"\"}, {\r\n XMLElement[\"cell\", {\"compressed\" -> True, \"string\" -> False}, {\r\n Cell[\r\n BoxData[\r\n FormBox[\r\n StyleBox[\r\n TagBox[\r\n GridBox[{{\r\n TagBox[\r\n PaneBox[\r\n \"\\\"current distance from Earth\\\"\", \r\n BaseStyle -> {{\r\n BaselinePosition -> Baseline, FontColor -> \r\n GrayLevel[0.3]}, LineSpacing -> {0.9, 0, 1.5}, \r\n LinebreakAdjustments -> {1, 10, 10000, 0, 100}, \r\n TextAlignment -> Left}, BaselinePosition -> Baseline], \r\n $CellContext`TagBoxWrapper[\"Label\"]], \r\n TagBox[\r\n GridBox[{{\r\n StyleBox[\r\n TagBox[\r\n TagBox[\r\n TagBox[\r\n RowBox[{\r\n TagBox[\"239\\[ThinSpace]262\", \r\n $CellContext`TagBoxWrapper[\"StringBoxes\" -> \"239262\"]], \r\n \"\\[NoBreak]\", \r\n StyleBox[\r\n RowBox[{}], FontFamily -> \"Helvetica\", FontSize -> \r\n Smaller], \"\\[InvisibleSpace]\", \"\\[ThickSpace]\", \r\n \"\\[InvisibleSpace]\", \r\n StyleBox[\r\n \"\\\"mi\\\"\", FontFamily -> \"Helvetica\", FontSize -> \r\n Smaller]}], Identity], #& , SyntaxForm -> Dot], \"Unit\", \r\n SyntaxForm -> Dot], \r\n LinebreakAdjustments -> {1, 100, 1, 0, 100}, LineIndent -> \r\n 0, ZeroWidthTimes -> False]}, {\r\n StyleBox[\r\n TagBox[\r\n TagBox[\r\n TagBox[\r\n RowBox[{\r\n TagBox[\"60.37\", \r\n $CellContext`TagBoxWrapper[\"StringBoxes\" -> \"60.37\"]], \r\n \"\\[NoBreak]\", \r\n StyleBox[\r\n RowBox[{}], FontFamily -> \"Helvetica\", FontSize -> \r\n Smaller], \"\\[InvisibleSpace]\", \"\\[ThickSpace]\", \r\n \"\\[InvisibleSpace]\", \r\n StyleBox[\r\n SubscriptBox[\r\n StyleBox[\"\\\"a\\\"\", Italic, StripOnInput -> False], \r\n \"\\\"\\[Earth]\\\"\"], FontFamily -> \"Helvetica\", FontSize -> \r\n Smaller]}], Identity], #& , SyntaxForm -> Dot], \"Unit\", \r\n SyntaxForm -> Dot], \r\n LinebreakAdjustments -> {1, 100, 1, 0, 100}, LineIndent -> \r\n 0, ZeroWidthTimes -> False]}}, \r\n GridBoxAlignment -> {\"Columns\" -> {{Left}}}, \r\n BaselinePosition -> 1, DefaultBaseStyle -> \"Column\", \r\n GridBoxItemSize -> {\r\n \"Columns\" -> {{Automatic}}, \"Rows\" -> {{Automatic}}}, \r\n GridBoxSpacings -> {\r\n \"Columns\" -> {{Automatic}}, \"Rows\" -> {{Automatic}}}], \r\n \"Column\"]}, {\r\n TagBox[\r\n PaneBox[\r\n TagBox[\"\\\"average distance from Earth\\\"\", Identity], \r\n BaseStyle -> {{\r\n BaselinePosition -> Baseline, FontColor -> \r\n GrayLevel[0.3]}, LineSpacing -> {0.9, 0, 1.5}, \r\n LinebreakAdjustments -> {1, 10, 10000, 0, 100}, \r\n TextAlignment -> Left}, BaselinePosition -> Baseline], \r\n $CellContext`TagBoxWrapper[\"Label\"]], \r\n TagBox[\r\n GridBox[{{\r\n StyleBox[\r\n TagBox[\r\n TagBox[\r\n TagBox[\r\n RowBox[{\r\n TagBox[\"239\\[ThinSpace]200\", \r\n $CellContext`TagBoxWrapper[\"StringBoxes\" -> \"239200\"]], \r\n \"\\[NoBreak]\", \r\n StyleBox[\r\n RowBox[{}], FontFamily -> \"Helvetica\", FontSize -> \r\n Smaller], \"\\[InvisibleSpace]\", \"\\[ThickSpace]\", \r\n \"\\[InvisibleSpace]\", \r\n StyleBox[\r\n \"\\\"mi\\\"\", FontFamily -> \"Helvetica\", FontSize -> \r\n Smaller]}], Identity], #& , SyntaxForm -> Dot], \"Unit\", \r\n SyntaxForm -> Dot], \r\n LinebreakAdjustments -> {1, 100, 1, 0, 100}, LineIndent -> \r\n 0, ZeroWidthTimes -> False]}, {\r\n StyleBox[\r\n TagBox[\r\n TagBox[\r\n TagBox[\r\n RowBox[{\r\n TagBox[\"60.36\", \r\n $CellContext`TagBoxWrapper[\"StringBoxes\" -> \"60.36\"]], \r\n \"\\[NoBreak]\", \r\n StyleBox[\r\n RowBox[{}], FontFamily -> \"Helvetica\", FontSize -> \r\n Smaller], \"\\[InvisibleSpace]\", \"\\[ThickSpace]\", \r\n \"\\[InvisibleSpace]\", \r\n StyleBox[\r\n SubscriptBox[\r\n StyleBox[\"\\\"a\\\"\", Italic, StripOnInput -> False], \r\n \"\\\"\\[Earth]\\\"\"], FontFamily -> \"Helvetica\", FontSize -> \r\n Smaller]}], Identity], #& , SyntaxForm -> Dot], \"Unit\", \r\n SyntaxForm -> Dot], \r\n LinebreakAdjustments -> {1, 100, 1, 0, 100}, LineIndent -> \r\n 0, ZeroWidthTimes -> False]}}, \r\n GridBoxAlignment -> {\"Columns\" -> {{Left}}}, \r\n BaselinePosition -> 1, DefaultBaseStyle -> \"Column\", \r\n GridBoxItemSize -> {\r\n \"Columns\" -> {{Automatic}}, \"Rows\" -> {{Automatic}}}, \r\n GridBoxSpacings -> {\r\n \"Columns\" -> {{Automatic}}, \"Rows\" -> {{Automatic}}}], \r\n \"Column\"]}, {\r\n TagBox[\r\n PaneBox[\r\n \"\\\"largest distance from orbit center\\\"\", \r\n BaseStyle -> {{\r\n BaselinePosition -> Baseline, FontColor -> \r\n GrayLevel[0.3]}, LineSpacing -> {0.9, 0, 1.5}, \r\n LinebreakAdjustments -> {1, 10, 10000, 0, 100}, \r\n TextAlignment -> Left}, BaselinePosition -> Baseline], \r\n $CellContext`TagBoxWrapper[\"Label\"]], \r\n TagBox[\r\n GridBox[{{\r\n StyleBox[\r\n TagBox[\r\n TagBox[\r\n TagBox[\r\n RowBox[{\r\n TagBox[\"252\\[ThinSpace]100\", \r\n $CellContext`TagBoxWrapper[\"StringBoxes\" -> \"252100\"]], \r\n \"\\[NoBreak]\", \r\n StyleBox[\r\n RowBox[{}], FontFamily -> \"Helvetica\", FontSize -> \r\n Smaller], \"\\[InvisibleSpace]\", \"\\[ThickSpace]\", \r\n \"\\[InvisibleSpace]\", \r\n StyleBox[\r\n \"\\\"mi\\\"\", FontFamily -> \"Helvetica\", FontSize -> \r\n Smaller]}], Identity], #& , SyntaxForm -> Dot], \"Unit\", \r\n SyntaxForm -> Dot], \r\n LinebreakAdjustments -> {1, 100, 1, 0, 100}, LineIndent -> \r\n 0, ZeroWidthTimes -> False]}, {\r\n StyleBox[\r\n TagBox[\r\n TagBox[\r\n TagBox[\r\n RowBox[{\r\n TagBox[\"63.61\", \r\n $CellContext`TagBoxWrapper[\"StringBoxes\" -> \"63.61\"]], \r\n \"\\[NoBreak]\", \r\n StyleBox[\r\n RowBox[{}], FontFamily -> \"Helvetica\", FontSize -> \r\n Smaller], \"\\[InvisibleSpace]\", \"\\[ThickSpace]\", \r\n \"\\[InvisibleSpace]\", \r\n StyleBox[\r\n SubscriptBox[\r\n StyleBox[\"\\\"a\\\"\", Italic, StripOnInput -> False], \r\n \"\\\"\\[Earth]\\\"\"], FontFamily -> \"Helvetica\", FontSize -> \r\n Smaller]}], Identity], #& , SyntaxForm -> Dot], \"Unit\", \r\n SyntaxForm -> Dot], \r\n LinebreakAdjustments -> {1, 100, 1, 0, 100}, LineIndent -> \r\n 0, ZeroWidthTimes -> False]}}, \r\n GridBoxAlignment -> {\"Columns\" -> {{Left}}}, \r\n BaselinePosition -> 1, DefaultBaseStyle -> \"Column\", \r\n GridBoxItemSize -> {\r\n \"Columns\" -> {{Automatic}}, \"Rows\" -> {{Automatic}}}, \r\n GridBoxSpacings -> {\r\n \"Columns\" -> {{Automatic}}, \"Rows\" -> {{Automatic}}}], \r\n \"Column\"]}, {\r\n TagBox[\r\n PaneBox[\r\n \"\\\"nearest distance from orbit center\\\"\", \r\n BaseStyle -> {{\r\n BaselinePosition -> Baseline, FontColor -> \r\n GrayLevel[0.3]}, LineSpacing -> {0.9, 0, 1.5}, \r\n LinebreakAdjustments -> {1, 10, 10000, 0, 100}, \r\n TextAlignment -> Left}, BaselinePosition -> Baseline], \r\n $CellContext`TagBoxWrapper[\"Label\"]], \r\n TagBox[\r\n GridBox[{{\r\n StyleBox[\r\n TagBox[\r\n TagBox[\r\n TagBox[\r\n RowBox[{\r\n TagBox[\"225\\[ThinSpace]600\", \r\n $CellContext`TagBoxWrapper[\"StringBoxes\" -> \"225600\"]], \r\n \"\\[NoBreak]\", \r\n StyleBox[\r\n RowBox[{}], FontFamily -> \"Helvetica\", FontSize -> \r\n Smaller], \"\\[InvisibleSpace]\", \"\\[ThickSpace]\", \r\n \"\\[InvisibleSpace]\", \r\n StyleBox[\r\n \"\\\"mi\\\"\", FontFamily -> \"Helvetica\", FontSize -> \r\n Smaller]}], Identity], #& , SyntaxForm -> Dot], \"Unit\", \r\n SyntaxForm -> Dot], \r\n LinebreakAdjustments -> {1, 100, 1, 0, 100}, LineIndent -> \r\n 0, ZeroWidthTimes -> False]}, {\r\n StyleBox[\r\n TagBox[\r\n TagBox[\r\n TagBox[\r\n RowBox[{\r\n TagBox[\"56.93\", \r\n $CellContext`TagBoxWrapper[\"StringBoxes\" -> \"56.93\"]], \r\n \"\\[NoBreak]\", \r\n StyleBox[\r\n RowBox[{}], FontFamily -> \"Helvetica\", FontSize -> \r\n Smaller], \"\\[InvisibleSpace]\", \"\\[ThickSpace]\", \r\n \"\\[InvisibleSpace]\", \r\n StyleBox[\r\n SubscriptBox[\r\n StyleBox[\"\\\"a\\\"\", Italic, StripOnInput -> False], \r\n \"\\\"\\[Earth]\\\"\"], FontFamily -> \"Helvetica\", FontSize -> \r\n Smaller]}], Identity], #& , SyntaxForm -> Dot], \"Unit\", \r\n SyntaxForm -> Dot], \r\n LinebreakAdjustments -> {1, 100, 1, 0, 100}, LineIndent -> \r\n 0, ZeroWidthTimes -> False]}}, \r\n GridBoxAlignment -> {\"Columns\" -> {{Left}}}, \r\n BaselinePosition -> 1, DefaultBaseStyle -> \"Column\", \r\n GridBoxItemSize -> {\r\n \"Columns\" -> {{Automatic}}, \"Rows\" -> {{Automatic}}}, \r\n GridBoxSpacings -> {\r\n \"Columns\" -> {{Automatic}}, \"Rows\" -> {{Automatic}}}], \r\n \"Column\"]}, {\r\n TagBox[\r\n PaneBox[\r\n TagBox[\"\\\"orbital period\\\"\", Identity], \r\n BaseStyle -> {{\r\n BaselinePosition -> Baseline, FontColor -> \r\n GrayLevel[0.3]}, LineSpacing -> {0.9, 0, 1.5}, \r\n LinebreakAdjustments -> {1, 10, 10000, 0, 100}, \r\n TextAlignment -> Left}, BaselinePosition -> Baseline], \r\n $CellContext`TagBoxWrapper[\"Label\"]], \r\n StyleBox[\r\n TagBox[\r\n TagBox[\r\n TagBox[\r\n RowBox[{\r\n TagBox[\"27.322\", \r\n $CellContext`TagBoxWrapper[\"StringBoxes\" -> \"27.322\"]], \r\n \"\\[InvisibleSpace]\", \" \", \r\n StyleBox[\r\n \"\\\"days\\\"\", LinebreakAdjustments -> {1, 100, 1, 0, 100}, \r\n LineIndent -> 0, {\r\n FontFamily :> $CellContext`$UnitFontFamily, FontSize -> \r\n Smaller}, StripOnInput -> False]}], Identity], #& , \r\n SyntaxForm -> Dot], \"Unit\", SyntaxForm -> Dot], \r\n LinebreakAdjustments -> {1, 100, 1, 0, 100}, LineIndent -> \r\n 0, ZeroWidthTimes -> False]}}, \r\n GridBoxAlignment -> {\r\n \"Columns\" -> {Left, Left}, \"Rows\" -> {{Baseline}}}, \r\n AutoDelete -> False, \r\n GridBoxBackground -> {\"Columns\" -> {None, None}}, \r\n GridBoxFrame -> {\"Columns\" -> {{True}}, \"Rows\" -> {{True}}}, \r\n GridBoxItemSize -> {\r\n \"Columns\" -> {{Automatic}}, \"Rows\" -> {{Automatic}}}, \r\n GridBoxSpacings -> {\"Columns\" -> {{1.5}, 2}, \"Rows\" -> {{1}}}, \r\n FrameStyle -> GrayLevel[0.84], BaselinePosition -> Automatic, \r\n AllowScriptLevelChange -> False], \"Grid\"], \r\n LineSpacing -> {0.9, 0, 1.5}, LineIndent -> 0, StripOnInput -> \r\n False], TraditionalForm]], \"Output\", {}]}], \r\n XMLElement[\r\n \"dataformats\", {}, {\r\n \"plaintext,computabledata,formatteddata,numberdata,quantitydata\"}]}], \r\n XMLElement[\"states\", {\"count\" -> \"2\"}, {\r\n XMLElement[\r\n \"state\", {\r\n \"name\" -> \"Show metric\", \"input\" -> \r\n \"BasicPlanetOrbitalProperties:AstronomicalData__Show metric\"}, {}], \r\n XMLElement[\r\n \"state\", {\r\n \"name\" -> \"More\", \"input\" -> \r\n \"BasicPlanetOrbitalProperties:AstronomicalData__More\"}, {}]}], \r\n XMLElement[\"infos\", {\"count\" -> \"1\"}, {\r\n XMLElement[\"info\", {}, {\r\n XMLElement[\"units\", {\"count\" -> \"2\"}, {\r\n XMLElement[\r\n \"unit\", {\r\n \"short\" -> \"a_\\[Earth]\", \"long\" -> \r\n \"equatorial radii of Earth\"}, {}], \r\n XMLElement[\"unit\", {\"short\" -> \"mi\", \"long\" -> \"miles\"}, {}], \r\n XMLElement[\"cell\", {\"compressed\" -> False, \"string\" -> True}, {\r\n Cell[\r\n BoxData[\r\n FormBox[\r\n StyleBox[\r\n TagBox[\r\n GridBox[{{\r\n StyleBox[\r\n StyleBox[\r\n TagBox[\r\n TagBox[\r\n RowBox[{\r\n StyleBox[\r\n SubscriptBox[\r\n StyleBox[\"\\\"a\\\"\", Italic, StripOnInput -> False], \r\n \"\\\"\\[Earth]\\\"\"], FontFamily -> \"Helvetica\", FontSize -> \r\n Smaller]}], Identity], \"UnitOnly\", SyntaxForm -> Dot], \r\n LinebreakAdjustments -> {1, 100, 1, 0, 100}, LineIndent -> \r\n 0, ZeroWidthTimes -> False], 10, StripOnInput -> False], \r\n StyleBox[\r\n \"\\\"equatorial radii of Earth\\\"\", FontSize -> 10, \r\n LinebreakAdjustments -> {1, 100, 1, 0, 100}, LineIndent -> \r\n 0, {FontFamily :> $CellContext`$UnitFontFamily, FontSize -> \r\n Smaller}, \r\n GrayLevel[0.6], StripOnInput -> False]}, {\r\n StyleBox[\r\n StyleBox[\r\n TagBox[\r\n TagBox[\r\n RowBox[{\r\n StyleBox[\r\n \"\\\"mi\\\"\", FontFamily -> \"Helvetica\", FontSize -> \r\n Smaller]}], Identity], \"UnitOnly\", SyntaxForm -> Dot], \r\n LinebreakAdjustments -> {1, 100, 1, 0, 100}, LineIndent -> \r\n 0, ZeroWidthTimes -> False], 10, StripOnInput -> False], \r\n StyleBox[\r\n \"\\\"miles\\\"\", FontSize -> 10, \r\n LinebreakAdjustments -> {1, 100, 1, 0, 100}, LineIndent -> \r\n 0, {FontFamily :> $CellContext`$UnitFontFamily, FontSize -> \r\n Smaller}, \r\n GrayLevel[0.6], StripOnInput -> False]}}, \r\n GridBoxAlignment -> {\r\n \"Columns\" -> {Left, Left}, \"Rows\" -> {{Baseline}}}, \r\n AutoDelete -> False, \r\n GridBoxBackground -> {\"Columns\" -> {{None}}}, \r\n GridBoxFrame -> {\r\n \"Columns\" -> {{True}}, \"Rows\" -> {{True}}}, \r\n GridBoxItemSize -> {\r\n \"Columns\" -> {{Automatic}}, \"Rows\" -> {{Automatic}}}, \r\n GridBoxSpacings -> {\r\n \"Columns\" -> {{1.5}}, \"Rows\" -> {{0.5}}}, FrameStyle -> \r\n GrayLevel[0.84], BaselinePosition -> Automatic, \r\n AllowScriptLevelChange -> False], \"Grid\"], \r\n LineSpacing -> {0.9, 0, 1.5}, LineIndent -> 0, StripOnInput -> \r\n False], TraditionalForm]], \"Output\", {}]}]}]}]}]}], \r\n Typeset`aux1$$ = {True, False, {False}, True}, Typeset`aux2$$ = {\r\n True, False, {False}, True}, Typeset`aux3$$ = {True, False, {False}, True},\r\n Typeset`aux4$$ = {True, False, {False, False}, True}, Typeset`aux5$$ = {\r\n True, False, {False}, True}, Typeset`aux6$$ = {\r\n True, False, {False, False}, True}, Typeset`aux7$$ = {\r\n True, False, {False}, True}, Typeset`asyncpods$$ = {}, Typeset`nonpods$$ = {\r\n XMLElement[\"sources\", {\"count\" -> \"1\"}, {\r\n XMLElement[\r\n \"source\", {\r\n \"url\" -> \r\n \"http://www.wolframalpha.com/sources/\\\r\nAstronomicalDataSourceInformationNotes.html\", \"text\" -> \r\n \"Astronomical data\"}, {}]}]}, Typeset`initdone$$ = True, \r\n Typeset`queryinfo$$ = {\r\n \"success\" -> \"true\", \"error\" -> \"false\", \"numpods\" -> \"7\", \"datatypes\" -> \r\n \"Astronomical\", \"timedout\" -> \"\", \"timedoutpods\" -> \"\", \"timing\" -> \r\n \"2.573\", \"parsetiming\" -> \"0.486\", \"parsetimedout\" -> \"false\", \r\n \"recalculate\" -> \"\", \"id\" -> \r\n \"MSPa79522303fg0608bh95i00004h41i28eicg1ci5g\", \"host\" -> \r\n \"http://www3.wolframalpha.com\", \"server\" -> \"20\", \"related\" -> \r\n \"http://www3.wolframalpha.com/api/v2/relatedQueries.jsp?id=\\\r\nMSPa79622303fg0608bh95i000037d20g9h7ib3ec64&s=20\", \"version\" -> \"2.6\"}, \r\n Typeset`sessioninfo$$ = {\r\n \"TimeZone\" -> -4., \r\n \"Date\" -> {2014, 6, 8, 23, 7, 20.2144277`9.058236384941416}, \"Line\" -> 3, \r\n \"SessionID\" -> 25552092645876612485}, Typeset`showpods$$ = {1, 2, 3, 4, 5,\r\n 6, 7}, Typeset`failedpods$$ = {}, Typeset`chosen$$ = {}, Typeset`open$$ = \r\n False, Typeset`newq$$ = \"How far is the Earth from the Moon?\"}, \r\n DynamicBox[ToBoxes[\r\n AlphaIntegration`FormatAlphaResults[\r\n Dynamic[{\r\n 1, {Typeset`pod1$$, Typeset`pod2$$, Typeset`pod3$$, Typeset`pod4$$, \r\n Typeset`pod5$$, Typeset`pod6$$, Typeset`pod7$$}, {\r\n Typeset`aux1$$, Typeset`aux2$$, Typeset`aux3$$, Typeset`aux4$$, \r\n Typeset`aux5$$, Typeset`aux6$$, Typeset`aux7$$}, Typeset`chosen$$, \r\n Typeset`open$$, Typeset`elements$$, Typeset`q$$, Typeset`opts$$, \r\n Typeset`nonpods$$, Typeset`queryinfo$$, Typeset`sessioninfo$$, \r\n Typeset`showpods$$, Typeset`failedpods$$, Typeset`newq$$}]], \r\n StandardForm],\r\n ImageSizeCache->{648., {478., 483.}},\r\n TrackedSymbols:>{Typeset`showpods$$, Typeset`failedpods$$}],\r\n DynamicModuleValues:>{},\r\n Initialization:>If[\r\n Not[Typeset`initdone$$], Null; WolframAlphaClient`Private`doAsyncUpdates[\r\n Hold[{\r\n Typeset`pod1$$, Typeset`pod2$$, Typeset`pod3$$, Typeset`pod4$$, \r\n Typeset`pod5$$, Typeset`pod6$$, Typeset`pod7$$}], \r\n Typeset`asyncpods$$, \r\n Dynamic[Typeset`failedpods$$]]; Typeset`asyncpods$$ = {}; \r\n Typeset`initdone$$ = True],\r\n SynchronousInitialization->False],\r\n BaseStyle->{Deployed -> True},\r\n DeleteWithContents->True,\r\n Editable->False,\r\n SelectWithContents->True]], \"Print\",\r\n CellMargins->{{20, 10}, {Inherited, Inherited}},\r\n CellChangeTimes->{3.611272040233429*^9}]\r\n}, Open ]],\r\n\r\nCell[CellGroupData[{\r\n\r\nCell[BoxData[\r\n RowBox[{\"Plot3D\", \"[\", \r\n RowBox[{\r\n RowBox[{\r\n RowBox[{\"Power\", \"[\", \r\n RowBox[{\"x\", \",\", \" \", \"2\"}], \"]\"}], \" \", \"+\", \" \", \"y\", \" \", \"+\", \" \", \r\n \"z\"}], \",\", \" \", \r\n RowBox[{\"{\", \r\n RowBox[{\"x\", \",\", \" \", \"0\", \",\", \" \", \"10\"}], \"}\"}], \" \", \",\", \" \", \r\n RowBox[{\"{\", \r\n RowBox[{\"y\", \",\", \" \", \"0\", \",\", \" \", \"10\"}], \"}\"}]}], \"]\"}]], \"Input\",\r\n CellChangeTimes->{{3.6112720578024335`*^9, 3.6112721112124887`*^9}}],\r\n\r\nCell[BoxData[\r\n Graphics3DBox[{},\r\n Axes->True,\r\n BoxRatios->{1, 1, 0.4},\r\n Method->{\"RotationControl\" -> \"Globe\"},\r\n PlotRange->{{0, 10}, {0, 10}, {0., 0.}},\r\n PlotRangePadding->{\r\n Scaled[0.02], \r\n Scaled[0.02], \r\n Scaled[0.02]}]], \"Output\",\r\n CellChangeTimes->{3.6112721144606743`*^9}]\r\n}, Open ]],\r\n\r\nCell[CellGroupData[{\r\n\r\nCell[BoxData[\r\n RowBox[{\"Plot3D\", \"[\", \r\n RowBox[{\r\n RowBox[{\r\n SuperscriptBox[\"x\", \"2\"], \"+\", \"y\", \"+\", \"z\"}], \",\", \r\n RowBox[{\"{\", \r\n RowBox[{\"x\", \",\", \"0\", \",\", \"10\"}], \"}\"}], \",\", \r\n RowBox[{\"{\", \r\n RowBox[{\"y\", \",\", \"0\", \",\", \"10\"}], \"}\"}], \",\", \r\n RowBox[{\"Mesh\", \"\\[Rule]\", \"Automatic\"}], \",\", \r\n RowBox[{\"MeshFunctions\", \"\\[Rule]\", \"Automatic\"}]}], \"]\"}]], \"Input\",\r\n NumberMarks->False],\r\n\r\nCell[BoxData[\r\n Graphics3DBox[{},\r\n Axes->True,\r\n BoxRatios->{1, 1, 0.4},\r\n Method->{\"RotationControl\" -> \"Globe\"},\r\n PlotRange->{{0, 10}, {0, 10}, {0., 0.}},\r\n PlotRangePadding->{\r\n Scaled[0.02], \r\n Scaled[0.02], \r\n Scaled[0.02]}]], \"Output\",\r\n CellChangeTimes->{3.6112721290995116`*^9}]\r\n}, Open ]],\r\n\r\nCell[CellGroupData[{\r\n\r\nCell[BoxData[\r\n RowBox[{\"Plot3D\", \"[\", \r\n RowBox[{\r\n RowBox[{\r\n SuperscriptBox[\"x\", \"2\"], \"+\", \"y\", \"+\", \"z\"}], \",\", \r\n RowBox[{\"{\", \r\n RowBox[{\"x\", \",\", \"0\", \",\", \"10\"}], \"}\"}], \",\", \r\n RowBox[{\"{\", \r\n RowBox[{\"y\", \",\", \"0\", \",\", \"10\"}], \"}\"}], \",\", \r\n RowBox[{\"MeshStyle\", \"\\[Rule]\", \r\n RowBox[{\"Directive\", \"[\", \r\n RowBox[{\r\n RowBox[{\"RGBColor\", \"[\", \r\n RowBox[{\"0.05`\", \",\", \"1.`\", \",\", \"0.98`\"}], \"]\"}], \",\", \r\n RowBox[{\"Opacity\", \"[\", \"0.11`\", \"]\"}], \",\", \r\n RowBox[{\"AbsoluteThickness\", \"[\", \"1.555`\", \"]\"}]}], \"]\"}]}], \",\", \r\n RowBox[{\"Mesh\", \"\\[Rule]\", \"Automatic\"}], \",\", \r\n RowBox[{\"MeshFunctions\", \"\\[Rule]\", \"Automatic\"}]}], \"]\"}]], \"Input\",\r\n NumberMarks->False],\r\n\r\nCell[BoxData[\r\n Graphics3DBox[{},\r\n Axes->True,\r\n BoxRatios->{1, 1, 0.4},\r\n Method->{\"RotationControl\" -> \"Globe\"},\r\n PlotRange->{{0, 10}, {0, 10}, {0., 0.}},\r\n PlotRangePadding->{\r\n Scaled[0.02], \r\n Scaled[0.02], \r\n Scaled[0.02]}]], \"Output\",\r\n CellChangeTimes->{3.6112721409161873`*^9}]\r\n}, Open ]],\r\n\r\nCell[CellGroupData[{\r\n\r\nCell[BoxData[\r\n RowBox[{\"Manipulate\", \"[\", \r\n RowBox[{\r\n RowBox[{\"Plot\", \"[\", \r\n RowBox[{\r\n RowBox[{\"Derivative\", \"[\", \r\n RowBox[{\"Power\", \"[\", \r\n RowBox[{\"x\", \",\", \" \", \"3\"}], \"]\"}], \"]\"}], \",\", \" \", \r\n RowBox[{\"{\", \r\n RowBox[{\"x\", \",\", \" \", \"0\", \",\", \" \", \"10\"}], \"}\"}]}], \"]\"}], \",\", \" \", \r\n RowBox[{\"{\", \r\n RowBox[{\"x\", \",\", \" \", \"0\", \",\", \" \", \"100\"}], \"}\"}]}], \"]\"}]], \"Input\",\r\n CellChangeTimes->{{3.611272144379386*^9, 3.61127220827404*^9}}],\r\n\r\nCell[BoxData[\r\n TagBox[\r\n StyleBox[\r\n DynamicModuleBox[{$CellContext`x$$ = 74.60000000000001, Typeset`show$$ = \r\n True, Typeset`bookmarkList$$ = {}, Typeset`bookmarkMode$$ = \"Menu\", \r\n Typeset`animator$$, Typeset`animvar$$ = 1, Typeset`name$$ = \r\n \"\\\"untitled\\\"\", Typeset`specs$$ = {{\r\n Hold[$CellContext`x$$], 0, 100}}, Typeset`size$$ = {360., {106., 110.}},\r\n Typeset`update$$ = 0, Typeset`initDone$$, Typeset`skipInitDone$$ = \r\n True, $CellContext`x$5214$$ = 0}, \r\n DynamicBox[Manipulate`ManipulateBoxes[\r\n 1, StandardForm, \"Variables\" :> {$CellContext`x$$ = 0}, \r\n \"ControllerVariables\" :> {\r\n Hold[$CellContext`x$$, $CellContext`x$5214$$, 0]}, \r\n \"OtherVariables\" :> {\r\n Typeset`show$$, Typeset`bookmarkList$$, Typeset`bookmarkMode$$, \r\n Typeset`animator$$, Typeset`animvar$$, Typeset`name$$, \r\n Typeset`specs$$, Typeset`size$$, Typeset`update$$, Typeset`initDone$$,\r\n Typeset`skipInitDone$$}, \"Body\" :> Plot[\r\n Derivative[$CellContext`x$$^3], {$CellContext`x$$, 0, 10}], \r\n \"Specifications\" :> {{$CellContext`x$$, 0, 100}}, \"Options\" :> {}, \r\n \"DefaultOptions\" :> {}],\r\n ImageSizeCache->{411., {152., 157.}},\r\n SingleEvaluation->True],\r\n Deinitialization:>None,\r\n DynamicModuleValues:>{},\r\n SynchronousInitialization->True,\r\n UnsavedVariables:>{Typeset`initDone$$},\r\n UntrackedVariables:>{Typeset`size$$}], \"Manipulate\",\r\n Deployed->True,\r\n StripOnInput->False],\r\n Manipulate`InterpretManipulate[1]]], \"Output\",\r\n CellChangeTimes->{3.611272211487224*^9}]\r\n}, Open ]]\r\n},\r\nWindowSize->{716, 833},\r\nWindowMargins->{{Automatic, 275}, {Automatic, 64}},\r\nFrontEndVersion->\"9.0 for Microsoft Windows (64-bit) (January 25, 2013)\",\r\nStyleDefinitions->\"Default.nb\"\r\n]\r\n(* End of Notebook Content *)\r\n\r\n(* Internal cache information *)\r\n(*CellTagsOutline\r\nCellTagsIndex->{}\r\n*)\r\n(*CellTagsIndex\r\nCellTagsIndex->{}\r\n*)\r\n(*NotebookFileOutline\r\nNotebook[{\r\nCell[CellGroupData[{\r\nCell[579, 22, 138, 3, 41, \"WolframAlphaLong\"],\r\nCell[720, 27, 194311, 3452, 971, \"Print\"]\r\n}, Open ]],\r\nCell[CellGroupData[{\r\nCell[195068, 3484, 441, 11, 31, \"Input\"],\r\nCell[195512, 3497, 292, 10, 306, \"Output\"]\r\n}, Open ]],\r\nCell[CellGroupData[{\r\nCell[195841, 3512, 404, 11, 55, \"Input\"],\r\nCell[196248, 3525, 292, 10, 306, \"Output\"]\r\n}, Open ]],\r\nCell[CellGroupData[{\r\nCell[196577, 3540, 708, 18, 76, \"Input\"],\r\nCell[197288, 3560, 292, 10, 306, \"Output\"]\r\n}, Open ]],\r\nCell[CellGroupData[{\r\nCell[197617, 3575, 472, 12, 31, \"Input\"],\r\nCell[198092, 3589, 1549, 32, 358, \"Output\"]\r\n}, Open ]]\r\n}\r\n]\r\n*)\r\n\r\n(* End of internal cache information *)\r\n\r\n" }, { "path": "src/test/resources/samples/langs/Mathematica/PacletInfo.m", "content": "(* Paclet Info File *)\n\n(* created 2014/02/07*)\n\nPaclet[\n Name -> \"Foobar\",\n Version -> \"0.0.1\",\n MathematicaVersion -> \"8+\",\n Description -> \"Example of an automatically generated PacletInfo file.\",\n Creator -> \"Chris Granade\",\n Extensions -> \n {\n {\"Documentation\", Language -> \"English\", MainPage -> \"Guides/Foobar\"}\n }\n]\n\n\n" }, { "path": "src/test/resources/samples/langs/Mathematica/Predicates.m", "content": "(* ::Package:: *)\n\nBeginPackage[\"Predicates`\"];\n\n\n(* ::Title:: *)\n(*Predicates*)\n\n\n(* ::Section::Closed:: *)\n(*Fuzzy Logic*)\n\n\n(* ::Subsection:: *)\n(*Documentation*)\n\n\nPossiblyTrueQ::usage=\"Returns True if the argument is not definitely False.\";\nPossiblyFalseQ::usage=\"Returns True if the argument is not definitely True.\";\nPossiblyNonzeroQ::usage=\"Returns True if and only if its argument is not definitely zero.\";\n\n\n(* ::Subsection:: *)\n(*Implimentation*)\n\n\nBegin[\"`Private`\"];\n\n\nPossiblyTrueQ[expr_]:=\\[Not]TrueQ[\\[Not]expr]\n\n\nPossiblyFalseQ[expr_]:=\\[Not]TrueQ[expr]\n\n\nEnd[];\n\n\n(* ::Section::Closed:: *)\n(*Numbers and Lists*)\n\n\n(* ::Subsection:: *)\n(*Documentation*)\n\n\nAnyQ::usage=\"Given a predicate and a list, retuns True if and only if that predicate is True for at least one element of the list.\";\nAnyElementQ::usage=\"Returns True if cond matches any element of L.\";\nAllQ::usage=\"Given a predicate and a list, retuns True if and only if that predicate is True for all elements of the list.\";\nAllElementQ::usage=\"Returns True if cond matches any element of L.\";\n\n\nAnyNonzeroQ::usage=\"Returns True if L is a list such that at least one element is definitely not zero.\";\nAnyPossiblyNonzeroQ::usage=\"Returns True if expr is a list such that at least one element is not definitely zero.\";\n\n\nRealQ::usage=\"Returns True if and only if the argument is a real number\";\nPositiveQ::usage=\"Returns True if and only if the argument is a positive real number\";\nNonnegativeQ::usage=\"Returns True if and only if the argument is a non-negative real number\";\nPositiveIntegerQ::usage=\"Returns True if and only if the argument is a positive integer\";\nNonnegativeIntegerQ::usage=\"Returns True if and only if the argument is a non-negative integer\";\n\n\nIntegerListQ::usage=\"Returns True if and only if the input is a list of integers.\";\nPositiveIntegerListQ::usage=\"Returns True if and only if the input is a list of positive integers.\";\nNonnegativeIntegerListQ::usage=\"Returns True if and only if the input is a list of non-negative integers.\";\nIntegerOrListQ::usage=\"Returns True if and only if the input is a list of integers or an integer.\";\nPositiveIntegerOrListQ::usage=\"Returns True if and only if the input is a list of positive integers or a positive integer.\";\nNonnegativeIntegerOrListQ::usage=\"Returns True if and only if the input is a list of positive integers or a positive integer.\";\n\n\nSymbolQ::usage=\"Returns True if argument is an unassigned symbol.\";\nSymbolOrNumberQ::usage=\"Returns True if argument is a number of has head 'Symbol'\";\n\n\n(* ::Subsection:: *)\n(*Implimentation*)\n\n\nBegin[\"`Private`\"];\n\n\nAnyQ[cond_, L_] := Fold[Or, False, cond /@ L]\n\n\nAnyElementQ[cond_,L_]:=AnyQ[cond,Flatten[L]]\n\n\nAllQ[cond_, L_] := Fold[And, True, cond /@ L]\n\n\nAllElementQ[cond_, L_] := Fold[And, True, cond /@ L]\n\n\nAnyNonzeroQ[L_]:=AnyElementQ[#!=0&,L]\n\n\nPossiblyNonzeroQ[expr_]:=PossiblyTrueQ[expr!=0]\n\n\nAnyPossiblyNonzeroQ[expr_]:=AnyElementQ[PossiblyNonzeroQ,expr]\n\n\nRealQ[n_]:=TrueQ[Im[n]==0];\n\n\nPositiveQ[n_]:=Positive[n];\n\n\nPositiveIntegerQ[n_]:=PositiveQ[n]\\[And]IntegerQ[n];\n\n\nNonnegativeQ[n_]:=TrueQ[RealQ[n]&&n>=0];\n\n\nNonnegativeIntegerQ[n_]:=NonnegativeQ[n]\\[And]IntegerQ[n];\n\n\nIntegerListQ[input_]:=ListQ[input]&&Not[MemberQ[IntegerQ/@input,False]];\n\n\nIntegerOrListQ[input_]:=IntegerListQ[input]||IntegerQ[input];\n\n\nPositiveIntegerListQ[input_]:=IntegerListQ[input]&&Not[MemberQ[Positive[input],False]];\n\n\nPositiveIntegerOrListQ[input_]:=PositiveIntegerListQ[input]||PositiveIntegerQ[input];\n\n\nNonnegativeIntegerListQ[input_]:=IntegerListQ[input]&&Not[MemberQ[NonnegativeIntegerQ[input],False]];\n\n\nNonnegativeIntegerOrListQ[input_]:=NonnegativeIntegerListQ[input]||NonnegativeIntegerQ[input];\n\n\nSymbolQ[a_]:=Head[a]===Symbol;\n\n\nSymbolOrNumberQ[a_]:=NumericQ[a]||Head[a]===Symbol;\n\n\nEnd[];\n\n\n(* ::Section:: *)\n(*Epilogue*)\n\n\nEndPackage[];\n" }, { "path": "src/test/resources/samples/langs/Mathematica/Predicates.wl", "content": "(* ::Package:: *)\n\nBeginPackage[\"Predicates`\"];\n\n\n(* ::Title:: *)\n(*Predicates*)\n\n\n(* ::Section::Closed:: *)\n(*Fuzzy Logic*)\n\n\n(* ::Subsection:: *)\n(*Documentation*)\n\n\nPossiblyTrueQ::usage=\"Returns True if the argument is not definitely False.\";\nPossiblyFalseQ::usage=\"Returns True if the argument is not definitely True.\";\nPossiblyNonzeroQ::usage=\"Returns True if and only if its argument is not definitely zero.\";\n\n\n(* ::Subsection:: *)\n(*Implimentation*)\n\n\nBegin[\"`Private`\"];\n\n\nPossiblyTrueQ[expr_]:=\\[Not]TrueQ[\\[Not]expr]\n\n\nPossiblyFalseQ[expr_]:=\\[Not]TrueQ[expr]\n\n\nEnd[];\n\n\n(* ::Section::Closed:: *)\n(*Numbers and Lists*)\n\n\n(* ::Subsection:: *)\n(*Documentation*)\n\n\nAnyQ::usage=\"Given a predicate and a list, retuns True if and only if that predicate is True for at least one element of the list.\";\nAnyElementQ::usage=\"Returns True if cond matches any element of L.\";\nAllQ::usage=\"Given a predicate and a list, retuns True if and only if that predicate is True for all elements of the list.\";\nAllElementQ::usage=\"Returns True if cond matches any element of L.\";\n\n\nAnyNonzeroQ::usage=\"Returns True if L is a list such that at least one element is definitely not zero.\";\nAnyPossiblyNonzeroQ::usage=\"Returns True if expr is a list such that at least one element is not definitely zero.\";\n\n\nRealQ::usage=\"Returns True if and only if the argument is a real number\";\nPositiveQ::usage=\"Returns True if and only if the argument is a positive real number\";\nNonnegativeQ::usage=\"Returns True if and only if the argument is a non-negative real number\";\nPositiveIntegerQ::usage=\"Returns True if and only if the argument is a positive integer\";\nNonnegativeIntegerQ::usage=\"Returns True if and only if the argument is a non-negative integer\";\n\n\nIntegerListQ::usage=\"Returns True if and only if the input is a list of integers.\";\nPositiveIntegerListQ::usage=\"Returns True if and only if the input is a list of positive integers.\";\nNonnegativeIntegerListQ::usage=\"Returns True if and only if the input is a list of non-negative integers.\";\nIntegerOrListQ::usage=\"Returns True if and only if the input is a list of integers or an integer.\";\nPositiveIntegerOrListQ::usage=\"Returns True if and only if the input is a list of positive integers or a positive integer.\";\nNonnegativeIntegerOrListQ::usage=\"Returns True if and only if the input is a list of positive integers or a positive integer.\";\n\n\nSymbolQ::usage=\"Returns True if argument is an unassigned symbol.\";\nSymbolOrNumberQ::usage=\"Returns True if argument is a number of has head 'Symbol'\";\n\n\n(* ::Subsection:: *)\n(*Implimentation*)\n\n\nBegin[\"`Private`\"];\n\n\nAnyQ[cond_, L_] := Fold[Or, False, cond /@ L]\n\n\nAnyElementQ[cond_,L_]:=AnyQ[cond,Flatten[L]]\n\n\nAllQ[cond_, L_] := Fold[And, True, cond /@ L]\n\n\nAllElementQ[cond_, L_] := Fold[And, True, cond /@ L]\n\n\nAnyNonzeroQ[L_]:=AnyElementQ[#!=0&,L]\n\n\nPossiblyNonzeroQ[expr_]:=PossiblyTrueQ[expr!=0]\n\n\nAnyPossiblyNonzeroQ[expr_]:=AnyElementQ[PossiblyNonzeroQ,expr]\n\n\nRealQ[n_]:=TrueQ[Im[n]==0];\n\n\nPositiveQ[n_]:=Positive[n];\n\n\nPositiveIntegerQ[n_]:=PositiveQ[n]\\[And]IntegerQ[n];\n\n\nNonnegativeQ[n_]:=TrueQ[RealQ[n]&&n>=0];\n\n\nNonnegativeIntegerQ[n_]:=NonnegativeQ[n]\\[And]IntegerQ[n];\n\n\nIntegerListQ[input_]:=ListQ[input]&&Not[MemberQ[IntegerQ/@input,False]];\n\n\nIntegerOrListQ[input_]:=IntegerListQ[input]||IntegerQ[input];\n\n\nPositiveIntegerListQ[input_]:=IntegerListQ[input]&&Not[MemberQ[Positive[input],False]];\n\n\nPositiveIntegerOrListQ[input_]:=PositiveIntegerListQ[input]||PositiveIntegerQ[input];\n\n\nNonnegativeIntegerListQ[input_]:=IntegerListQ[input]&&Not[MemberQ[NonnegativeIntegerQ[input],False]];\n\n\nNonnegativeIntegerOrListQ[input_]:=NonnegativeIntegerListQ[input]||NonnegativeIntegerQ[input];\n\n\nSymbolQ[a_]:=Head[a]===Symbol;\n\n\nSymbolOrNumberQ[a_]:=NumericQ[a]||Head[a]===Symbol;\n\n\nEnd[];\n\n\n(* ::Section:: *)\n(*Epilogue*)\n\n\nEndPackage[];\n" }, { "path": "src/test/resources/samples/langs/Mathematica/Problem12.m", "content": "(* ::Package:: *)\r\n\r\n(* Problem12.m *)\r\n(* Author: William Woodruff *)\r\n(* Problem: What is the value of the first triangle number to have over five hundred divisors? *)\r\n\r\nDo[If[Length[Divisors[Binomial[i + 1, 2]]] > 500, \r\n Print[Binomial[i + 1, 2]]; Break[]], {i, 1000000}]\r\n" }, { "path": "src/test/resources/samples/langs/Mathematica/TestArithmetic.mt", "content": "Test[1 + 2, 3, TestID -> \"One plus two\"]\n" }, { "path": "src/test/resources/samples/langs/Mathematica/TestString.mt", "content": "Test[\"a\" <> \"b\", \"ab\", TestID -> \"Concat \\\"a\\\" and \\\"b\\\"\"]\n" }, { "path": "src/test/resources/samples/langs/Mathematica/TestSuite.mt", "content": "TestSuite[\n { \"TestArithmetic.mt\"\n , \"TestString.mt\"\n }\n]\n" }, { "path": "src/test/resources/samples/langs/Mathematica/UnitTest.wlt", "content": "BeginTestSection[\"Untitled-5\"]\n\nVerificationTest[(* 1 *)\n\tRotationMatrix[phi]\n\t,\n\tList[List[Cos[phi], Times[-1, Sin[phi]]], List[Sin[phi], Cos[phi]]]\t\n]\n\nVerificationTest[(* 2 *)\n\tTimes[1, Power[Plus[a, Times[-1, a]], -1]]\n\t,\n\tComplexInfinity\n\t,\n\t{Power::infy}\n]\n\nEndTestSection[]\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/Contents.m", "content": "% CVX: A system for disciplined convex programming.\n% CVX is a modeling framework for building, constructing, and solving\n% disciplined convex programs. \n%\n% cvx_setup - Sets up and tests the cvx distribution.\n% cvx_error - Formats text for inclusion in error messages.\n% cvx_license - License processing for CVX Professional.\n% cvx_startup - Quietly add CVX to your MATLAB path (for startup).\n% cvx_version - Returns version and environment information for CVX.\n%\n% commands/ - Top-level commands to create and control CVX.\n% functions/ - Additional functions created specifically for CVX.\n% keywords/ - Keywords for declaring variables and objectives\n% lib/ - Code for internal use by CVX.\n% sdpt3/ - The SDPT3 semidefinite-quadratic-linear solver.\n% sedumi/ - The SeDuMi semidefinite-quadratic-linear solver.\n% sets/ - CVX set definitions: nonnegative, semidefinite, etc.\n% shims/ - Interface code to connect CVX to solvers.\n% structures/ - Matrix structure definitions and utilities.\n% doc/ - Documentation (PDF, HTML)\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/abs.m", "content": "function y = abs( x )\n\n%Disciplined convex/geometric programming information for ABS:\n% ABS(X) is convex and nonmonotonic in X. Therefore, when used in\n% DCPs, X must be affine. ABS(X) is not useful in DGPs, since all\n% log-convex and log-concave expressions are already positive.\n\n%\n% Determine the expression types\n%\n\n% 0 : convex, concave, invalid\n% 1 : constant\n% 2 : real affine\n% 3 : complex affine\npersistent remap\nif isempty( remap ),\n remap_1 = cvx_remap( 'constant' );\n remap_2 = cvx_remap( 'real-affine' );\n remap_3 = cvx_remap( 'complex-affine' );\n remap_4 = cvx_remap( 'log-valid' );\n remap = remap_1 + ( 2 * remap_2 + 3 * remap_3 + 4 * remap_4 ) .* ~remap_1;\nend\nv = remap( cvx_classify( x ) );\n\n%\n% Process each type of expression one piece at a time\n%\n\nvu = sort( v(:) );\nvu = vu([true;diff(vu)~=0]);\nnv = length( vu );\nsx = x.size_;\nif nv ~= 1,\n y = cvx( sx, [] );\nend\nfor k = 1 : nv,\n\n %\n % Select the category of expression to compute\n %\n\n vk = vu( k );\n if nv == 1,\n xt = x;\n else\n t = v == vk;\n xt = cvx_subsref( x, t );\n end\n\n %\n % Perform the computations\n %\n\n switch vk,\n case 0,\n % Invalid\n error( 'Disciplined convex programming error:\\n Illegal operation: abs( {%s} ).', cvx_class( xt ) );\n case 1,\n % Constant\n cvx_optval = cvx( builtin( 'abs', cvx_constant( xt ) ) );\n case 2,\n % Real affine\n w = [];\n st = size( xt );\n cvx_begin\n epigraph variable w( st )\n { xt, w } == lorentz( st, 0 ); %#ok\n cvx_end\n case 3,\n % Complex affine\n w = [];\n st = size( xt );\n cvx_begin\n epigraph variable w( st )\n { xt, w } == complex_lorentz( st, 0 ); %#ok\n cvx_end\n case 4,\n % log-affine, log-convex\n cvx_optval = xt;\n otherwise,\n error( 'Shouldn''t be here.' );\n end\n\n %\n % Store the results\n %\n\n if nv == 1,\n y = cvx_optval;\n else\n y = cvx_subsasgn( y, t, cvx_optval );\n end\n\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/blkdiag.m", "content": "function y = blkdiag( varargin )\n\n%Disciplined convex/geometric programming information for BLKDIAG:\n% BLKDIAG imposes no convexity restrictions on its arguments.\n\nnv = 0;\nnz = 0;\nsz = [ 0, 0 ];\nfor k = 1 : nargin,\n x = cvx( varargin{k} );\n sx = x.size_;\n if length( sx ) > 2,\n error( 'N-D matrices not supported.' );\n end\n b = x.basis_;\n sz = sz + sx;\n nv = max( nv, size( b, 1 ) );\n nz = nz + nnz( b );\n varargin{k} = x;\nend\nbz = sparse( [], [], [], prod( sz ), nz, nv );\nroff = 0;\ncoff = 0;\nfor k = 1 : nargin,\n x = varargin{k};\n b = x.basis_;\n sx = x.size_;\n ndxr = ( roff : roff + sx( 1 ) - 1 )';\n ndxr = ndxr( :, ones( 1, sx( 2 ) ) );\n ndxc = ( coff : coff + sx( 2 ) - 1 );\n ndxc = ndxc( ones( 1, sx( 1 ) ), : );\n bz( 1 : size( b, 1 ), ndxc( : ) * sz( 1 ) + ndxr( : ) + 1 ) = b; %#ok\n roff = roff + sx( 1 );\n coff = coff + sx( 2 );\nend\ny = cvx( sz, bz );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/builtins.m", "content": "% CVX: Built-in operators and functions supported in CVX models.\n% \n% The following operators and functions are included with MATLAB but\n% have either been verified to work properly within CVX models or have\n% been extended with additional code to do so. In many cases, typing\n% help cvx/\n% where is one of the names listed below will provide specific\n% help on the proper use of that item in CVX models---including any\n% restrictions imposed by the DCP and DGP rulesets.\n%\n% For a list of new functions created specifically for CVX, type\n% \"help cvx/functions\".\n%\n% Computational operators:\n% plus (+), uplus (unary +), minus (-), uminus (unary -), times (.*),\n% mtimes (*), ldivide (.\\), mldivide (\\), rdivide (./), mrdivide (/), \n% power (.^), mpower (^), subsref/subsasgn/end (subscripting),\n% transpose (.'), ctranspose (')\n% Relational operators:\n% eq (==), ge (>=), gt (>), le (<=), lt(<), ne (~=).\n% Linear/affine functions:\n% blkdiag, cat, conj, conv, cumsum, diag, dot, find, flipdim, fliplr, \n% flipud, hankel, horzcat, imag, ipermute, kron, permute, polyval, real,\n% repmat, reshape, rot90, sparse, sum, toeplitz, tril, triu, vertcat\n% Nonlinear functions:\n% abs, max, min, norm, prod, sqrt\n% Query functions:\n% disp/display, end, isempty, isequal, length, isreal, ndims, nnz,\n% numel, size, spy\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/cat.m", "content": "function y = cat( dim, varargin )\n\n%Disciplined convex/geometric programming information for CAT:\n% CAT imposes no convexity restrictions on its arguments.\n\nif ~isnumeric( dim ) || any( size( dim ) ~= 1 ) || dim <= 0 || dim ~= floor( dim ),\n error( 'First argument must be a dimension.' );\nend\n\n%\n% Quick exit\n%\n\nif nargin == 2,\n y = varargin{1};\n return\nend\n\n%\n% Determine the final size and check consistency\n%\n\nsz = [];\nnz = 1;\nnzer = 0;\nnargs = 0;\nisr = true;\nfor k = 1 : nargin - 1,\n x = varargin{k};\n sx = size( x );\n if any( sx ),\n x = cvx( x );\n bx = x.basis_;\n nz = max( nz, size( bx, 1 ) );\n nzer = nzer + nnz( bx );\n sx( end + 1 : dim ) = 1;\n if isempty( sz ),\n sz = sx;\n elseif length( sx ) ~= length( sz ) || nnz( sx - sz ) > 1,\n error( 'All dimensions but the one being concatenated (%d) must be equal.', dim );\n else\n sz( dim ) = sz( dim ) + sx( dim ); %#ok\n end\n if ~isreal( bx ), \n isr = false; \n end\n if all( sx ),\n nargs = nargs + 1;\n varargin{nargs} = x;\n end\n end\nend\n\n%\n% Simple cases\n%\n\nif nargs == 0,\n \n if isempty( sz ), \n sz( dim ) = nargin; \n end\n y = cvx( sz, [] );\n return\n \nelseif nargs == 1,\n \n y = varargin{1};\n return\n \nend\n\n%\n% Harder cases\n%\n\nmsiz = sz( dim );\nlsiz = prod( sz( 1 : dim - 1 ) );\nrsiz = prod( sz( dim + 1 : end ) );\npsz = lsiz * msiz * rsiz;\nissp = cvx_use_sparse( [ nz, psz ], nzer, isr );\nfor k = 1 : nargs,\n x = varargin{k}.basis_;\n if issp ~= issparse(x),\n if issp, \n x = sparse(x); \n else\n x = full(x); \n end\n end\n x( end + 1 : nz, end ) = 0; %#ok\n if rsiz > 1,\n x = reshape( x, numel(x) / rsiz, rsiz );\n end\n varargin{k} = x;\nend\nif rsiz > 1,\n yb = builtin( 'cat', 1, varargin{1:nargs} );\nelse\n yb = builtin( 'cat', 2, varargin{1:nargs} );\nend\nyb = reshape( yb, nz, psz );\n \n%\n% Create object\n%\n\ny = cvx( sz, yb );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/conj.m", "content": "function y = conj( x )\n\n%Disciplined convex/geometric programming information for CONJ:\n% CONJ(X) imposes no convexity restrictions on its arguments. However,\n% since CONJ(X)=X when X is real, it is only useful for complex\n% affine expressions.\n\ny = cvx( x.size_, conj( x.basis_ ) );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/conv.m", "content": "function z = conv(x,y)\n\n%Disciplined convex programming information for CONV:\n% Convolutions are a combination of both multiplications and additions.\n% Therefore, to insure that the no-product rule is satisfied, CONV(X,Y)\n% requires that either X or Y be constant. Further conditions may also\n% apply depending on the exact content of X and Y. For example, if the\n% elements of Y are all convex, then the convolution kernel X must be\n% real, and all of the elements must have the same sign.\n%\n%Disciplined geometric programming information for TIMES:\n% CONV(X,Y) requires that either X or Y be constant, and that the\n% non-constant term be log-convex or log-affine. Strictly speaking,\n% CONV(X,Y) where X and Y are both log-convex satisfies the DGP rulest,\n% but this version does not support that scenario.\n\nnarginchk(2,2);\nsx = size(x);\nsy = size(y);\nif sum(sx~=1)>1 || sum(sy~=1)>1,\n \n error( 'Arguments must be vectors.' );\n \nelseif any(sx==0) && any(sy==0),\n \n error( 'At least one argument must be non-empty.' );\n \nelseif cvx_isconstant(x) || cvx_isconstant(y), \n \n sz = sy;\n sx = prod(sx);\n sy = prod(sy);\n nz = sx + sy - 1;\n sz(sz>1) = nz;\n if cvx_isconstant(x),\n [xi,xj,xv] = find(cvx_constant(x));\n yb = cvx_basis(y);\n else\n [xi,xj,xv] = find(cvx_constant(y));\n yb = cvx_basis(x);\n end\n [yi,yj,yv] = find(yb);\n nx = length(xv);\n ny = length(yv);\n ox = ones(1,nx);\n yi = yi(:,ox);\n xi = reshape( xi + xj - 2, 1, nx ); \n yj = yj(:,ox) + xi(ones(ny,1),:);\n yv = yv * reshape( xv, 1, nx );\n z = sparse( yi, yj, yv, size(yb,1), nz );\n z = cvx( sz, z );\n if nnz( cvx_classify( z ) == 13 ),\n error( 'Disciplined convex programming error:\\n Illegal affine combination of convex/concave terms in convolution.' );\n end\n \nelse\n \n error( 'At least one argument must be constant.' );\n \nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/ctranspose.m", "content": "function y = ctranspose( x )\n\n%Disciplined convex/geometric programming information for CTRANSPOSE (.):\n% The complex conjugate transpose operation may be applied to CVX\n% variables without restriction.\n\n%\n% Determine permutation\n%\n\ns = x.size_;\nif length( s ) > 2,\n error( 'Transpose of an ND array is not defined.' );\nend\n\n%\n% Permute the data\n%\n\nndxs = 1 : prod( s );\nndx2 = reshape( ndxs, s ).';\nb = conj( x.basis_ );\ntry\n b = b( :, ndx2 );\ncatch %#ok\n ndxs( ndx2( : ).' ) = ndxs;\n [ r, c, v ] = find( b );\n b = sparse( r, ndxs( c ), v, size( b, 1 ), size( b, 2 ) );\n clear r c v\nend\ny = cvx( size( ndx2 ), b );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/cumprod.m", "content": "function y = cumprod( x, dim )\r\n\r\n% Disciplined geometric programming information for PROD:\r\n% CUMPROD(X,DIM) is a vectorized version of multiplication,\r\n% so in most cases it would be incompatible with DCPs. Therefore it\r\n% has not been implemented to support DCPs. DGPs however support\r\n% products more liberally. When PROD is used in a DCP, elements in\r\n% each subvector must satisfy the corresponding combination rule\r\n% for multiplication (see TIMES). For example, suppose that X looks\r\n% like this:\r\n% X = [ log-convex log-concave log-affine ;\r\n% log-affine log-concave log-concave ]\r\n% Then CUMPROD(X,1) would be legal, but CUMPROD(X,2) would not, \r\n% because the top row contains the product of log-convex and \r\n% log-concave terms, in violation of the DGP ruleset.\r\n\r\nnarginchk(1,2);\r\n\r\n%\r\n% Size check\r\n%\r\n\r\ntry\r\n ox = x;\r\n if nargin < 2, dim = []; end\r\n [ x, sx, sy, zx, zy, nx, nv, perm ] = cvx_reduce_size( x, dim ); %#ok\r\ncatch exc\r\n error( exc.message );\r\nend\r\n \r\n%\r\n% Quick exit for easy cases\r\n%\r\n\r\nif isempty( x ) || nx == 1,\r\n y = ox;\r\n return\r\nend\r\n\r\n%\r\n% Type check\r\n%\r\n\r\npersistent remap_1 remap_2 remap_3 remap_0\r\nif isempty( remap_3 ),\r\n remap_0 = cvx_remap( 'zero' );\r\n remap_1 = cvx_remap( 'constant' );\r\n remap_2 = cvx_remap( 'log-convex' );\r\n remap_3 = cvx_remap( 'log-concave' );\r\nend\r\nvx = cvx_reshape( cvx_classify( x ), sx );\r\nt0 = any( reshape( remap_0( vx ), sx ) );\r\nt1 = all( reshape( remap_1( vx ), sx ) );\r\nt2 = all( reshape( remap_2( vx ), sx ) ) | ...\r\n all( reshape( remap_3( vx ), sx ) );\r\nt3 = t2 & t0;\r\nta = ( t1 | t3 ) + 2 * ( t2 & ~t3 );\r\nnu = sort( ta(:) );\r\nnu = nu([true;diff(nu)~=0]);\r\nnk = length( nu );\r\n\r\n%\r\n% Perform the computations\r\n%\r\n\r\nif nk > 1,\r\n y = cvx( [ nx, nv ], [] );\r\nend\r\nfor k = 1 : nk,\r\n\r\n if nk == 1,\r\n xt = x;\r\n else\r\n tt = ta == nu( k );\r\n xt = cvx_subsref( x, ':', tt );\r\n end\r\n\r\n switch nu( k ),\r\n case 0,\r\n error( 'Disciplined convex programming error:\\n Invalid computation: cumprod( {%s} )', cvx_class( xt, true, true ) );\r\n case 1,\r\n yt = cvx( cumprod( cvx_constant( xt ) ) );\r\n case 2,\r\n yt = exp( cumsum( log( xt ) ) );\r\n otherwise,\r\n error( 'Shouldn''t be here.' );\r\n end\r\n\r\n if nk == 1,\r\n y = yt;\r\n else\r\n y = cvx_subsasgn( y, ':', tt, yt );\r\n end\r\n\r\nend\r\n\r\n%\r\n% Reverse the reshaping and permutation steps\r\n%\r\n\r\ny = reshape( y, sx );\r\nif ~isempty( perm ),\r\n y = ipermute( y, perm );\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/cumsum.m", "content": "function y = cumsum( x, dim )\n\n%Disciplined convex/geometric programming information for SUM:\n% CUMSUM(X) and CUMSUM(X,DIM) are vectorized forms of addition. So \n% when CUMSUM is used in a DCP or DGP, elements in each subvector \n% must satisfy the corresponding combination rules for addition (see\n% PLUS). For example, suppose that X looks like this:\n% X = [ convex concave affine ;\n% affine concave concave ]\n% Then CUMSUM(X,1) would be permittted, but CUMSUM(X,2) would not, \n% because the top row contains the sum of convex and concave terms, in\n% violation of the DCP ruleset. For DGPs, addition rules dictate that\n% the elements of X must be log-convex or log-affine.\n\ns = x.size_;\nswitch nargin,\n case 0,\n error( 'Not enough input arguments.' );\n case 1,\n dim = cvx_default_dimension( s );\n case 2,\n if ~cvx_check_dimension( dim, false ),\n error( 'Second argument must be a dimension.' );\n end\nend\n\nif dim > length( s ) || s( dim ) <= 1,\n\n y = x;\n\nelse\n\n b = x.basis_;\n sb = size( b );\n need_perm = any( s( dim + 1 : end ) > 1 );\n if need_perm,\n ndxs = reshape( 1 : prod( s ), s );\n ndxs = permute( ndxs, [ 1 : dim - 1, dim + 1 : length( s ), dim ] );\n b = b( :, ndxs );\n end\n b = reshape( b, prod( sb ) / s( dim ), s( dim ) );\n b = cumsum( b, 2 );\n b = reshape( b, sb );\n if need_perm,\n b( :, ndxs ) = b;\n end\n y = cvx( s, b );\n v = cvx_vexity( y );\n if any( isnan( v( : ) ) ),\n error( 'Disciplined convex programming error:\\n Illegal addition encountered (e.g., {convex} + {concave}).', 1 ); %#ok\n end\n\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/diag.m", "content": "function y = diag( v, k )\n\n%Disciplined convex/geometric programming information for DIAG:\n% DIAG imposes no convexity restrictions on its arguments.\n\nswitch nargin,\n case 0,\n error( 'Not enough arguments.' );\n case 1,\n k = 0;\n case 2,\n if ~isnumeric( k ) || k ~= floor( k ),\n error( 'Second argument must be an integer.' );\n end\nend\n\ns = size( v );\nif length( s ) ~= 2,\n error( 'First input must be 2D.' );\nend\n\nif k < 0,\n absk = -k;\n roff = absk;\n coff = 0;\nelse\n absk = +k;\n roff = 0;\n coff = absk;\nend\n\nif any( s == 1 ),\n nn = prod( s );\n nel = nn + roff + coff;\n y = sparse( roff + 1 : roff + nn, coff + 1 : coff + nn, v, nel, nel );\nelseif roff >= s(1) || coff >= s(2),\n y = sparse( 0, 1 );\nelse\n nel = min( s(1) - roff, s(2) - coff );\n nv = roff + ( coff - 1 ) * s(1) + ( 1 : nel ) * ( s(1) + 1 );\n y = reshape( cvx_subsref( v, nv ), nel, 1 );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/disp.m", "content": "function disp( x, prefix )\nif nargin < 2,\n prefix = '';\nend\ndisp( [ prefix, 'cvx ', cvx_class( x, true, true, true ), ' expression (', type( x ), ')' ] );\ndual = cvx_getdual( x );\nif ~isempty( dual ),\n disp( [ prefix, ' tied to dual variable: ', dual.subs ] );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/end.m", "content": "function y = end( x, k, n )\n\n%Disciplined convex/geometric programming information for END:\n% The use of END as an array subscript (e.g., X(:,end)) is identical\n% with CVX variables as it is for numeric vectors and arrays.\n\nsz = size( x );\nnz = length( sz );\nif k > nz,\n y = 1;\nelseif k < n || nz <= n,\n y = sz( k );\nelse\n y = prod( sz( k : end ) );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/eq.m", "content": "function a = eq( x, y )\n\n%Disciplined convex programming information for EQ (==):\n% Both the left- and right-hand sides of an equality constraint must\n% be affine (or constant). If either side of the constraint is complex,\n% then the real and imaginary portions are constrained separately.\n%\n%Disciplined geometric programming information for EQ (>):\n% Both the left- and right-hand sides of an equality constraint must\n% be log-affine, which includes positive constants and monomials.\n\nb = newcnstr( evalin( 'caller', 'cvx_problem', '[]' ), x, y, '==' );\nif nargout, a = b; end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/exp.m", "content": "function y = exp( x )\r\n\r\n% Disciplined convex programming information:\r\n% EXP(X) is convex and nondecreasing in X. When used in CVX\r\n% expressions, X must be real. Typically, X must also be affine\r\n% or convex; X can also be concave, but this produces a log-concave\r\n% result with very limited usefulness.\r\n%\r\n% Disciplined geometric programming information:\r\n% EXP(X) is typically not used in geometric programs. However,\r\n% EXP(X), where X is a monomial or posynomial, can be included in \r\n% geometric programs wherever a posynomial would be appropriate.\r\n\r\nglobal cvx___\r\nnarginchk(1,1);\r\ncvx_expert_check( 'log', x );\r\n \r\n%\r\n% Determine the expression types\r\n%\r\n\r\npersistent remap\r\nif isempty( remap ),\r\n remap_1 = cvx_remap( 'real' );\r\n remap_2 = cvx_remap( 'convex', 'concave' ) & ~remap_1;\r\n remap = remap_1 + 2 * remap_2;\r\nend\r\nv = remap( cvx_classify( x ) );\r\n\r\n%\r\n% Process each type of expression one piece at a time\r\n%\r\n\r\nvu = sort( v(:) );\r\nvu = vu([true;diff(vu)~=0]);\r\nnv = length( vu );\r\nsx = x.size_;\r\nif nv ~= 1,\r\n y = cvx( sx, [] );\r\nend\r\nfor k = 1 : nv,\r\n\r\n %\r\n % Select the category of expression to compute\r\n %\r\n\r\n vk = vu( k );\r\n if nv == 1,\r\n xt = x;\r\n else\r\n t = v == vk;\r\n xt = cvx_subsref( x, t );\r\n end\r\n\r\n %\r\n % Perform the computations\r\n %\r\n\r\n switch vk,\r\n case 0,\r\n % Invalid\r\n error( 'Disciplined convex programming error:\\n Illegal operation: exp( {%s} ).', cvx_class( xt ) );\r\n case 1,\r\n % Constant\r\n xt = cvx( exp( cvx_constant( xt ) ) );\r\n case 2,\r\n % Affine, convex, concave\r\n xt = sparsify( xt, 'exponential' );\r\n [ rx, cx, vx ] = find( xt.basis_ );\r\n tt = rx == 1; rx( tt ) = [];\r\n cc = cx( tt ); cx( tt ) = [];\r\n vc = vx( tt ); % vx( tt ) = [];\r\n exps = cvx___.exponential( rx, 1 );\r\n tt = exps == 0;\r\n if any( tt ),\r\n n1 = unique( rx( tt ) );\r\n n2 = newvar( cvx___.problems( end ).self, '', length( n1 ) );\r\n [ n2, dummy ] = find( n2.basis_ ); %#ok\r\n cvx___.exponential( n1, 1 ) = n2( : );\r\n cvx___.logarithm( n2, 1 ) = n1( : );\r\n cvx___.vexity( n2 ) = 1;\r\n n2 = n2( cvx___.vexity( n1 ) < 0 );\r\n if ~isempty( n2 ),\r\n cvx___.vexity( n2 ) = NaN;\r\n cvx___.nan_used = true;\r\n cvx___.canslack( n2 ) = +1;\r\n end\r\n exps = cvx___.exponential( rx, 1 );\r\n cvx___.exp_used = true;\r\n end\r\n nb = size( xt.basis_, 2 );\r\n bx = sparse( exps, cx, 1, full( max( exps ) ), nb );\r\n if ~isempty( cc ),\r\n bx = bx * diag(exp(sparse(cc,1,vc,nb,1)));\r\n end\r\n xt = cvx( xt.size_, bx );\r\n otherwise,\r\n error( 'Shouldn''t be here.' );\r\n end\r\n\r\n %\r\n % Store the results\r\n %\r\n\r\n if nv == 1,\r\n y = xt;\r\n else\r\n y = cvx_subsasgn( y, t, xt );\r\n end\r\n\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/find.m", "content": "function [ i, j, v ] = find( x )\r\n\r\n%Disciplined convex/geometric programming information for FIND:\r\n% When used in CVX models, FIND cannot deduce the numeric value of a\r\n% CVX variable. So it returns the indices of elements that are \r\n% \"structurally\" nonzero; i.e., that are not *identically* zero.\r\n% This is similar to the concept of structural nonzeros in sparse\r\n% matrix factorizations. To illustrate the distinction, consider:\r\n% variable x(3);\r\n% x(2) == 0;\r\n% y = [x(1);0;x(3)];\r\n% In this case, FIND(x) returns [1;2;3] even though x(2) has been set\r\n% to zero in an equality constraint. (After all, the overall model may\r\n% be infeasible, in which case x(2) is arguably not zero.) However,\r\n% FIND(y) will return [1;3], because y(2) is identically zero.\r\n%\r\n% When X is a CVX variable, the first two outputs of [I,J,V]=FIND(X) \r\n% are constant, and the third is a CVX variable containing the \r\n% structural nonzeros of X.\r\n%\r\n% FIND(X) places no convexity restrictions on its argument.\r\n\r\nndxs = find( any( x.basis_, 1 ) );\r\nndxs = ndxs( : );\r\n\r\nif nargout > 1,\r\n i = ndxs - 1;\r\n j = floor( i / x.size_(1) ) + 1;\r\n i = rem( i, x.size_(1) ) + 1;\r\nelse\r\n\ti = ndxs;\r\nend\t\r\n\r\nif nargout > 2,\r\n v = reshape( cvx_subsref( x, ndxs ), length( ndxs ) );\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/full.m", "content": "function z = full( x )\n\n% Disciplined convex/geometric programming information for FULL (+):\n% This is effectively a \"no-op\", and can be used in DCPs and DGPs\n% without restrictions.\n\nz = x;\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/ge.m", "content": "function a = ge( x, y )\n\n%Disciplined convex programming information for GE (>=):\n% The right-hand side of a less-than constraint must be convex. The\n% left-hand side must be concave. Of course, real constant and affine\n% expressions are both convex and concave and can be used on either\n% side as well.\n%\n%Disciplined geometric programming information for GE (>=):\n% The right-hand side of a less-than constraint must be log-convex---\n% including positive constants, monomials, posynomials, generalized\n% posynomials, and products thereof. The left-hand side must be log-\n% concave---including positive constants, monomials, reciprocals of\n% log-convex expressions, and products thereof.\n%\n%Note that CVX does not distinguish between strict greater-than (>) and\n%greater-than-or-equal (<=) constraints; they are treated identically. \n%Feasible interior-point solvers tend to return points which satisfy\n%strict inequality, but not all solvers do.\n\nb = newcnstr( evalin( 'caller', 'cvx_problem', '[]' ), x, y, '>=' );\nif nargout, a = b; end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/gt.m", "content": "function a = gt( x, y )\n\n%Disciplined convex programming information for GT (>):\n% The right-hand side of a less-than constraint must be convex. The\n% left-hand side must be concave. Of course, real constant and affine\n% expressions are both convex and concave and can be used on either\n% side as well.\n%\n%Disciplined geometric programming information for GT (>):\n% The right-hand side of a less-than constraint must be log-convex---\n% including positive constants, monomials, posynomials, generalized\n% posynomials, and products thereof. The left-hand side must be log-\n% concave---including positive constants, monomials, reciprocals of\n% log-convex expressions, and products thereof.\n%\n%Note that CVX does not distinguish between strict greater-than (>) and\n%greater-than-or-equal (>=) constraints; they are treated identically. \n%Feasible interior-point solvers tend to return points which satisfy\n%strict inequality, but not all solvers do.\n\nwarning( 'CVX:StrictInequalities', cvx_error( 'The use of strict inequalities in CVX is strongly discouraged, because solvers treat them as non-strict inequalities. Please consider using \">=\" instead.', [66,75], false, '' ) );\nb = newcnstr( evalin( 'caller', 'cvx_problem', '[]' ), x, y, '>' );\nif nargout, a = b; end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/hankel.m", "content": "function H = hankel(c,r)\n\n%Disciplined convex/geometric programming information for HANKEL:\n% HANKEL imposes no convexity restrictions on its arguments. Instead\n% of using the HANKEL function, however, consider creating a matrix\n% variable using the 'hankel' or 'upper_hankel' keyword; e.g.\n% variable X(5,5) hankel;\n% variable Y(4,4) upper_hankel;\n\n%\n% Check arguments\n%\n\nnarginchk(1,2);\nif nargin < 2,\n r = zeros(size(c));\nelse\n temp = cvx_subsref( r, 1 ) - cvx_subsref( c, numel(c) );\n if ~cvx_isnonzero( temp ),\n warning('MATLAB:hankel:AntiDiagonalConflict',['Last element of ' ...\n 'input column does not match first element of input row. ' ...\n '\\n Column wins anti-diagonal conflict.'])\n end\nend\n\n%\n% Compute indices and construct data vector\n%\n\nr = vec( r );\nc = vec( c );\nnc = length( c );\nnr = length( r );\nx = [ c ; cvx_subsref( r, 2 : nr, 1 ) ];\n\n%\n% Construct matrix\n%\n\ncidx = ( 1 : nc )';\nridx = 0 : nr - 1;\nH = cidx(:,ones(nr,1)) + ridx(ones(nc,1),:);\nH = reshape( cvx_subsref( x, H( : ) ), size( H ) );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/horzcat.m", "content": "function y = horzcat( varargin )\ny = cat( 2, varargin{:} );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/imag.m", "content": "function y = imag( x )\n\n%Disciplined convex/geometric programming information for IMAG:\n% IMAG(X) may be freely applied to any CVX expression. Of course,\n% IMAG(X)=0 for all real expressions (including convex, concave,\n% log-convex, and log-concave), so it is primarily useful in the\n% complex affine case.\n\ny = cvx( x.size_, imag( x.basis_ ) );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/ipermute.m", "content": "function y = ipermute( x, order )\n\n% Disciplined convex/geometric programming information for IPERMUTE:\n% IPERMUTE(A,ORDER) imposes no convexity restrictions on A. ORDER\n% must be constant.\n\n%\n% Determine the permutation\n%\n\ns = x.size_;\nndxs = 1 : prod( s );\nndx2 = ipermute( reshape( ndxs, s ), order );\n\n%\n% Permute the data\n%\n\nb = x.basis_;\ntry\n b = b( :, ndx2 );\ncatch\n ndxs( ndx2( : ).' ) = ndxs;\n [ r, c, v ] = find( b );\n b = sparse( r, ndxs( c ), v, size( b, 1 ), size( b, 2 ) );\n clear r c v\nend\ny = cvx( size( ndx2 ), b );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/isreal.m", "content": "function y = isreal( x, full )\n\n%Disciplined convex/geometric programming information for ISREAL:\n% ISREAL(X) may be freely applied to any CVX expression. It will\n% return TRUE for all real affine, convex, concave, log-convex,\n% and log-concave expressions, and FALSE for complex affine \n% expressions.\n\ny = x.basis_;\nif nargin > 1 && full,\n y = any( imag( y ), 1 );\nelse\n y = isreal( x.basis_ ) | nnz(imag(x.basis_)) == 0;\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/kron.m", "content": "function z = kron( x, y )\n\n%Disciplined convex/geometric programming information for KRON:\n% KRON(X,Y) computes scalar products between every element of X and\n% every element of Y. Each of those scalar products must obey the\n% DCP or DGP ruleset.\n\n%\n% Check sizes and handle cases that can be computed\n% using non-Kronecker products\n%\n\nnarginchk(2,2);\nsx = size( x );\nsy = size( y );\nif length( sx ) > 2 || length( sy ) > 2,\n error( 'N-D arrays not supported.' );\nelseif sx( 2 ) == 1 && ( sx( 1 ) == 1 || sy( 1 ) == 1 ),\n z = mtimes( x, y );\n return\nelseif sy( 2 ) == 1 && ( sy( 1 ) == 1 || sx( 1 ) == 1 ),\n z = mtimes( y, x );\n return\nelse\n sz = sx .* sy;\nend\n\n%\n% Expand and multiply\n%\n\n[ ix, jx, vx ] = find(x);\n[ iy, jy, vy ] = find(y);\nif isempty( vx ) || isempty( vy ),\n z = cvx( sparse( [], [], [], sz(1), sz(2) ) );\nelse\n ix = ix(:); jx = jx(:); nx = numel(ix); kx = ones(nx,1);\n iy = iy(:); jy = jy(:); ny = numel(iy); ky = ones(ny,1);\n t = sy(1) * ( ix - 1 )';\n iz = t( ky, : ) + iy( :, kx );\n t = sy(2) * ( jx - 1 )';\n jz = t( ky, : ) + jy( :, kx );\n z = reshape( vy, ny, 1 ) * reshape( vx, 1, nx );\n z = sparse( iz, jz, z, sz(1), sz(2) );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/ldivide.m", "content": "function z = ldivide( x, y )\n\n%Disciplined convex programming information for LDIVIDE:\n% For DCP purposes, the LDIVIDE division operator X.\\Y is equivalent to\n% (1./X).*Y. The left-hand term must be constant and non-zero; and if the\n% right-hand term is nonlinear, t constant must also be real.\n%\n%Disciplined geometric programming information for LDIVIDE:\n% Terms in a left divide must have opposite log-curvature, so the\n% following products are permitted:\n% {log-convex} .\\ {log-concave} {log-concave} .\\ {log-convex}\n% {log-affine} .\\ {log-affine}\n% Note that log-affine expressions are both log-convex and log-concave.\n%\n%For vectors, matrices, and arrays, these rules are verified indepdently\n%for each element.\n\nz = times( x, y, '.\\' );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/le.m", "content": "function a = le( x, y )\n\n% Disciplined convex programming information for LE (<=):\n% The left-hand side of a less-than constraint must be convex. The\n% right-hand side must be concave. Of course, real constant and \n% affine expressions are both convex and concave and can be used on\n% either side as well.\n% \n% Disciplined geometric programming information for LE (<=):\n% The left-hand side of a less-than constraint must be log-convex,\n% including positive constants, monomials, posynomials, generalized\n% posynomials, and products thereof. The right-hand side must be \n% log-concave---including positive constants, monomials, \n% reciprocals of log-convex expressions, and products thereof.\n% \n% Note that CVX does not distinguish between strict less-than (<) and\n% less-than-or-equal (<=) constraints; they are treated identically. \n% Feasible interior-point solvers tend to return points which satisfy\n% strict inequality, but not all solvers do.\n\nb = newcnstr( evalin( 'caller', 'cvx_problem', '[]' ), x, y, '<=' );\nif nargout, a = b; end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/log.m", "content": "function y = log( x )\r\n\r\n% Disciplined convex programming information:\r\n% LOG(X) is concave and nondecreasing in X. When used in CVX\r\n% expressions, X must be concave.\r\n%\r\n% Disciplined geometric programming information:\r\n% LOG(X) is typically not used in geometric programs. Technically it\r\n% possible to do so in certain advanced cases, because monomials and\r\n% posynomials are treated by CVX as log-affine and log-convex\r\n% constructs, respectively. However, such usage is undocumented and\r\n% will not be officially supported.\r\n\r\nglobal cvx___\r\nnarginchk(1,1);\r\ncvx_expert_check( 'log', x );\r\n\r\n%\r\n% Determine the expression types\r\n%\r\n\r\npersistent remap\r\nif isempty( remap ),\r\n remap_0 = cvx_remap( 'nonpositive' );\r\n remap_1 = cvx_remap( 'positive' );\r\n remap_2 = cvx_remap( 'real-affine', 'concave' ) & ~remap_1 & ~remap_0;\r\n remap_3 = cvx_remap( 'monomial' );\r\n remap_4 = cvx_remap( 'posynomial' );\r\n remap = remap_1 + 2 * remap_2 + 3 * remap_3 + 4 * remap_4;\r\nend\r\nv = remap( cvx_classify( x ) );\r\n\r\n%\r\n% Process each type of expression one piece at a time\r\n%\r\n\r\nvu = sort( v(:) );\r\nvu = vu([true;diff(vu)~=0]);\r\nnv = length( vu );\r\nif nv ~= 1,\r\n y = cvx( size( x ), [] );\r\nend\r\nfor k = 1 : nv,\r\n\r\n %\r\n % Select the category of expression to compute\r\n %\r\n\r\n vk = vu( k );\r\n if nv == 1,\r\n xt = x;\r\n else\r\n t = v == vk;\r\n xt = cvx_subsref( x, t );\r\n end\r\n\r\n %\r\n % Perform the computations\r\n %\r\n\r\n switch vk,\r\n case 0,\r\n % Invalid\r\n error( 'Disciplined convex programming error:\\n Illegal operation: log( {%s} ).', cvx_class( xt, true, true, true ) );\r\n case 1,\r\n % Positive constant\r\n yt = cvx( log( cvx_constant( xt ) ) );\r\n case 2,\r\n % Affine, convex (invalid)\r\n sx = xt.size_; %#ok\r\n yt = [];\r\n cvx_begin\r\n hypograph variable yt( sx ) \r\n exp( yt ) <= xt; %#ok\r\n cvx_end\r\n case 3,\r\n % Monomial\r\n nb = prod( xt.size_ );\r\n [ rx, cx, vx ] = find( xt.basis_ );\r\n logs = cvx___.logarithm( rx, 1 );\r\n tt = vx ~= 1; nt = sum( tt );\r\n bx = sparse( [ ones( nt, 1 ) ; logs ], [ cx( tt ) ; cx ], [ log( vx( tt ) ) ; ones( nb, 1 ) ], full( max( logs ) ), size( xt.basis_, 2 ) );\r\n yt = cvx( xt.size_, bx );\r\n case 4,\r\n % Posynomial\r\n sx = xt.size_;\r\n xt = xt.basis_;\r\n rc = full( sum( xt ~= 0, 1 ) );\r\n ru = sort( rc(:) );\r\n ru = ru([true;diff(ru)~=0]);\r\n nu = length( ru );\r\n if nu ~= 1,\r\n yt = cvx( sx, [] );\r\n end\r\n for kk = 1 : nu,\r\n rk = ru( kk );\r\n if nu == 1,\r\n xtt = xt;\r\n else\r\n tt = rc == rk;\r\n xtt = xt( :, tt );\r\n end\r\n [ rx, cx, vx ] = find( xtt ); %#ok\r\n rx = rx( : ); vx = vx( : );\r\n nq = length( vx );\r\n vx = log( vx );\r\n tz = rx ~= 1;\r\n rx = cvx___.logarithm( rx( tz ), 1 );\r\n vx = vx + cvx( nq, sparse( rx, find( tz ), 1, full( max( rx ) ), nq ) );\r\n vx = reshape( vx, rk, nq / rk );\r\n vx = log_sum_exp( vx );\r\n if nu == 1,\r\n yt = reshape( vx, sx );\r\n else\r\n yt = cvx_subsasgn( yt, tt, vx );\r\n end\r\n end\r\n otherwise,\r\n error( 'Shouldn''t be here.' );\r\n end\r\n\r\n %\r\n % Store the results\r\n %\r\n\r\n if nv == 1,\r\n y = yt;\r\n else\r\n y = cvx_subsasgn( y, t, yt );\r\n end\r\n\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/lt.m", "content": "function a = lt( x, y )\n\n% Disciplined convex programming information for LT (<):\n% The left-hand side of a less-than constraint must be convex. The\n% right-hand side must be concave. Of course, real constant and \n% affine expressions are both convex and concave and can be used on\n% either side as well.\n% \n% Disciplined geometric programming information for LT (<):\n% The left-hand side of a less-than constraint must be log-convex,\n% including positive constants, monomials, posynomials, generalized\n% posynomials, and products thereof. The right-hand side must be \n% log-concave---including positive constants, monomials, \n% reciprocals of log-convex expressions, and products thereof.\n% \n% Note that CVX does not distinguish between strict less-than (<) and\n% less-than-or-equal (<=) constraints; they are treated identically. \n% Feasible interior-point solvers tend to return points which satisfy\n% strict inequality, but not all solvers do.\n\nwarning( 'CVX:StrictInequalities', cvx_error( 'The use of strict inequalities in CVX is strongly discouraged, because solvers treat them as non-strict inequalities. Please consider using \"<=\" instead.', [66,75], false, '' ) );\nb = newcnstr( evalin( 'caller', 'cvx_problem', '[]' ), x, y, '<' );\nif nargout, a = b; end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/max.m", "content": "function z = max( x, y, dim )\n\n% Disciplined convex/geometric programming information:\n% MAX is convex, log-log-convex, and nondecreasing in its first \n% two arguments. Thus when used in disciplined convex programs, \n% both arguments must be convex (or affine). In disciplined \n% geometric programs, both arguments must be log-convex/affine.\n\npersistent remap remap_1 remap_2 remap_3\nnarginchk(1,3);\nif nargin == 2,\n\n %\n % max( X, Y )\n %\n\n sx = size( x );\n sy = size( y );\n xs = all( sx == 1 );\n ys = all( sy == 1 );\n if xs,\n sz = sy;\n elseif ys || isequal( sx, sy ),\n sz = sx;\n else\n error( 'Array dimensions must match.' );\n end\n\n %\n % Determine the computation methods\n %\n\n\n if isempty( remap ),\n remap1 = cvx_remap( 'real' );\n remap1 = remap1' * remap1;\n remap2 = cvx_remap( 'log-valid' )' * cvx_remap( 'nonpositive' );\n remap3 = remap2';\n remap4 = cvx_remap( 'log-convex', 'real' );\n remap4 = remap4' * remap4;\n remap5 = cvx_remap( 'convex' );\n remap5 = remap5' * remap5;\n remap = remap1 + ~remap1 .* ...\n ( 2 * remap2 + 3 * remap3 + ~( remap2 | remap3 ) .* ...\n ( 4 * remap4 + ~remap4 .* ( 5 * remap5 ) ) );\n end\n vx = cvx_classify( x );\n vy = cvx_classify( y );\n vr = remap( vx + size( remap, 1 ) * ( vy - 1 ) );\n vu = sort( vr(:) );\n vu = vu([true;diff(vu)~=0]);\n nv = length( vu );\n\n %\n % The cvx multi-objective problem\n %\n\n xt = x;\n yt = y;\n if nv ~= 1,\n z = cvx( sz, [] );\n end\n for k = 1 : nv,\n\n %\n % Select the category of expression to compute\n %\n\n if nv ~= 1,\n t = vr == vu( k );\n if ~xs,\n xt = cvx_subsref( x, t );\n sz = size( xt ); %#ok\n end\n if ~ys,\n yt = cvx_subsref( y, t );\n sz = size( yt ); %#ok\n end\n end\n\n %\n % Apply the appropriate computation\n %\n\n switch vu( k ),\n case 0,\n % Invalid\n error( 'Disciplined convex programming error:\\n Cannot perform the operation max( {%s}, {%s} )', cvx_class( xt, false, true ), cvx_class( yt, false, true ) );\n case 1,\n % constant\n cvx_optval = cvx( max( cvx_constant( xt ), cvx_constant( yt ) ) );\n case 2,\n % max( log-valid, nonpositive ) (no-op)\n cvx_optval = xt;\n case 3,\n % max( nonpositive, log-valid ) (no-op)\n cvx_optval = yt;\n case 4,\n % posy\n zt = [];\n cvx_begin gp\n epigraph variable zt( sz );\n xt <= zt; %#ok\n yt <= zt; %#ok\n cvx_end\n case 5,\n % non-posy\n zt = [];\n cvx_begin\n epigraph variable zt( sz );\n xt <= zt; %#ok\n yt <= zt; %#ok\n cvx_end\n otherwise,\n error( 'Shouldn''t be here.' );\n end\n\n %\n % Store the results\n %\n\n if nv == 1,\n z = cvx_optval;\n else\n z = cvx_subsasgn( z, t, cvx_optval );\n end\n\n end\n\nelse\n\n %\n % max( X, [], dim )\n %\n\n if nargin > 1 && ~isempty( y ),\n error( 'max with two matrices to compare and a working dimension is not supported.' );\n end\n\n\t%\n\t% Size check\n\t%\n\n\ttry\n\t\tox = x;\n\t\tif nargin < 3, dim = []; end\n\t\t[ x, sx, sy, zx, zy, nx, nv, perm ] = cvx_reduce_size( x, dim ); %#ok\n\tcatch exc\n\t error( exc.message );\n\tend\n\t\n\t%\n\t% Quick exit for empty array\n\t%\n\t\n\tif isempty( x ),\n\t\tz = zeros( zx );\n\t\treturn\n\tend\n\t\n %\n % Type check\n %\n\n if isempty( remap_3 ),\n remap_1 = cvx_remap( 'real' );\n remap_2 = cvx_remap( 'log-convex', 'real' );\n remap_3 = cvx_remap( 'convex' );\n end\n vx = cvx_reshape( cvx_classify( x ), sx );\n t1 = all( reshape( remap_1( vx ), sx ) );\n t2 = all( reshape( remap_2( vx ), sx ) );\n t3 = all( reshape( remap_3( vx ), sx ) );\n t3 = t3 & ~( t1 | t2 );\n t2 = t2 & ~t1;\n ta = t1 + ( 2 * t2 + 3 * t3 ) .* ~t1;\n nu = sort( ta(:) );\n nu = nu([true;diff(nu)~=0]);\n nk = length( nu );\n\n %\n % Quick exit for size 1\n %\n\n if nx == 1 && all( nu ),\n z = ox;\n return\n end\n\n %\n % Perform the computations\n %\n\n if nk ~= 1,\n z = cvx( [ 1, nv ], [] );\n end\n for k = 1 : nk,\n\n if nk == 1,\n xt = x;\n else\n tt = ta == nu( k );\n xt = cvx_subsref( x, ':', tt );\n nv = nnz( tt ); %#ok\n end\n\n switch nu( k ),\n case 0,\n error( 'Disciplined convex programming error:\\n Invalid computation: max( {%s} )', cvx_class( xt, false, true ) );\n case 1,\n cvx_optval = max( cvx_constant( xt ), [], 1 );\n case 2,\n\t zt = [];\n cvx_begin gp\n epigraph variable zt( 1, nv )\n xt <= ones(nx,1) * zt; %#ok\n cvx_end\n case 3,\n\t zt = [];\n cvx_begin\n epigraph variable zt( 1, nv )\n xt <= ones(nx,1) * zt; %#ok\n cvx_end\n otherwise,\n error( 'Shouldn''t be here.' );\n end\n\n if nk == 1,\n z = cvx_optval;\n else\n z = cvx_subsasgn( z, tt, cvx_optval );\n end\n\n end\n\n %\n % Reverse the reshaping and permutation steps\n %\n\n z = reshape( z, sy );\n if ~isempty( perm ),\n z = ipermute( z, perm );\n end\n\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/min.m", "content": "function z = min( x, y, dim )\n\n% Disciplined convex/geometric programming information:\n% MAX is convex, log-log-concave, and nondecreasing in its first\n% two arguments. Thus when used in disciplined convex programs, \n% both arguments must be concave (or affine). In disciplined \n% geometric programs, both arguments must be log-concave/affine.\n\npersistent remap remap_1 remap_2 remap_3\nnarginchk(1,3);\nif nargin == 2,\n\n %\n % min( X, Y )\n %\n\n sx = size( x );\n sy = size( y );\n xs = all( sx == 1 );\n ys = all( sy == 1 );\n if xs,\n sz = sy;\n elseif ys || isequal( sx, sy ),\n sz = sx;\n else\n error( 'Array dimensions must match.' );\n end\n\n %\n % Determine the computation methods\n %\n\n if isempty( remap ),\n remap1 = cvx_remap( 'real' );\n remap1 = remap1' * remap1;\n remap2 = cvx_remap( 'log-concave' )' * cvx_remap( 'nonpositive' );\n remap3 = remap2';\n remap4 = cvx_remap( 'log-concave', 'real' );\n remap4 = remap4' * remap4;\n remap5 = cvx_remap( 'concave' );\n remap5 = remap5' * remap5;\n remap = remap1 + ~remap1 .* ...\n ( 2 * remap2 + 3 * remap3 + ~( remap2 | remap3 ) .* ...\n ( 4 * remap4 + ~remap4 .* ( 5 * remap5 ) ) );\n end\n vx = cvx_classify( x );\n vy = cvx_classify( y );\n vr = remap( vx + size( remap, 1 ) * ( vy - 1 ) );\n vu = sort( vr(:) );\n vu = vu([true;diff(vu)~=0]);\n nv = length( vu );\n\n %\n % The cvx multi-objective problem\n %\n\n xt = x;\n yt = y;\n if nv ~= 1,\n z = cvx( sz, [] );\n end\n for k = 1 : nv,\n\n %\n % Select the category of expression to compute\n %\n\n if nv ~= 1,\n t = vr == vu( k );\n if ~xs,\n xt = cvx_subsref( x, t );\n sz = size( xt ); %#ok\n end\n if ~ys,\n yt = cvx_subsref( y, t );\n sz = size( yt ); %#ok\n end\n end\n\n %\n % Apply the appropriate computation\n %\n\n switch vu( k ),\n case 0,\n % Invalid\n error( 'Disciplined convex programming error:\\n Cannot perform the operation min( {%s}, {%s} )', cvx_class( xt, false, true ), cvx_class( yt, false, true ) );\n case 1,\n % constant\n cvx_optval = cvx( min( cvx_constant( xt ), cvx_constant( yt ) ) );\n case 2,\n % min( log-concave, nonpositive ) (no-op)\n cvx_optval = yt;\n case 3,\n % min( nonpositive, log-concave ) (no-op)\n cvx_optval = xt;\n case 4,\n % posy\n zt = [];\n cvx_begin gp\n hypograph variable zt( sz )\n xt >= zt; %#ok\n yt >= zt; %#ok\n cvx_end\n case 5,\n % non-posy\n zt = [];\n cvx_begin\n hypograph variable zt( sz )\n xt >= zt; %#ok\n yt >= zt; %#ok\n cvx_end\n otherwise,\n error( 'Shouldn''t be here.' );\n end\n\n %\n % Store the results\n %\n\n if nv == 1,\n z = cvx_optval;\n else\n z = cvx_subsasgn( z, t, cvx_optval );\n end\n\n end\n\nelse\n\n %\n % min( X, [], dim )\n %\n\n if nargin > 1 && ~isempty( y ),\n error( 'min with two matrices to compare and a working dimension is not supported.' );\n end\n \n\t%\n\t% Size check\n\t%\n\n\ttry\n\t\tox = x;\n\t\tif nargin < 3, dim = []; end\n\t\t[ x, sx, sy, zx, zy, nx, nv, perm ] = cvx_reduce_size( x, dim ); %#ok\n\tcatch exc\n\t error( exc.message );\n\tend\n\t\n\t%\n\t% Quick exit for empty array\n\t%\n\t\n\tif isempty( x ),\n\t\tz = zeros( zx );\n\t\treturn\n\tend\n\n %\n % Type check\n %\n\n if isempty( remap_3 ),\n remap_1 = cvx_remap( 'real' );\n remap_2 = cvx_remap( 'log-concave', 'real' );\n remap_3 = cvx_remap( 'concave' );\n end\n vx = cvx_reshape( cvx_classify( x ), sx );\n t1 = all( reshape( remap_1( vx ), sx ) );\n t2 = all( reshape( remap_2( vx ), sx ) );\n t3 = all( reshape( remap_3( vx ), sx ) );\n t3 = t3 & ~( t1 | t2 );\n t2 = t2 & ~t1;\n ta = t1 + ( 2 * t2 + 3 * t3 ) .* ~t1;\n nu = sort( ta(:) );\n nu = nu([true;diff(nu)~=0]);\n nk = length( nu );\n\n %\n % Quick exit for size 1\n %\n\n if nx == 1 && all( nu ),\n z = ox;\n return\n end\n\n %\n % Perform the computations\n %\n\n if nk ~= 1,\n z = cvx( [ 1, nv ], [] );\n end\n for k = 1 : nk,\n\n if nk == 1,\n xt = x;\n else\n tt = ta == nu( k );\n xt = cvx_subsref( x, ':', tt );\n nv = nnz( tt ); %#ok\n end\n\n switch nu( k ),\n case 0,\n error( 'Disciplined convex programming error:\\n Invalid computation: min( {%s} )', cvx_class( xt, false, true ) );\n case 1,\n cvx_optval = min( cvx_constant( xt ), [], 1 );\n case 2,\n \tzt = [];\n cvx_begin gp\n hypograph variable zt( 1, nv )\n xt >= ones(nx,1) * zt; %#ok\n cvx_end\n case 3,\n \tzt = [];\n cvx_begin\n hypograph variable zt( 1, nv )\n xt >= ones(nx,1) * zt; %#ok\n cvx_end\n otherwise,\n error( 'Shouldn''t be here.' );\n end\n\n if nk == 1,\n z = cvx_optval;\n else\n z = cvx_subsasgn( z, tt, cvx_optval );\n end\n\n end\n\n %\n % Reverse the reshaping and permutation steps\n %\n\n z = reshape( z, sy );\n if ~isempty( perm ),\n z = ipermute( z, perm );\n end\n\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/minus.m", "content": "function z = minus( x, y, cheat )\n\n% Disciplined convex programming information for MINUS:\n% Terms in a difference must have opposite curvature. Real affine\n% expressions are both convex and concave, so they can be involved\n% in a difference with any nonlinear expression. Complex affine (or\n% constant) expressions, however, are neither, so they can only be\n% involved in differences with other affine expressions. So, for\n% example, the following differences are valid:\n% {convex}-{concave} {concave}-{convex} {affine}-{affine}\n% The following are not:\n% {convex}-{concave} {convex}-{complex constant}\n% For vectors, matrices, and arrays, these rules are verified\n% independently for each element.\n% \n% Disciplined geometric programming information for MINUS:\n% Non-constant expressions (log-convex or log-concave) may not be\n% involved in a subtraction in disciplined geometric programs.\n\nif nargin < 3, cheat = false; end\nz = plus( x, y, true, cheat );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/mldivide.m", "content": "function z = mldivide( x, y )\n\n% Disciplined convex/geomtric programming information for MLDIVIDE:\n% The MLDIVIDE operation X\\Y can be employed with X as a scalar. In\n% that case, it is equivalent to the LDIVIDE operation X.\\Y, and \n% must obey the same rules as outlined in the help for CVX/LDIVIDE.\n% \n% When X is a matrix, the MRDIVIDE operation X\\Y is equivalent to\n% inv(X)*Y for both DCP and DGP purposes. The inv() operation is \n% not supported for non-constant expressions, so X must be both \n% constant and nonsingular. The resulting matrix multiplication \n% must obey the same rules as outlined in the help for CVX/MTIMES.\n\nz = mtimes( x, y, 'ldivide' );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/mpower.m", "content": "function z = mpower( x, y )\n\n% Disciplined convex/geometric programming information for MPOWER (^):\n% The CVX version of the matrix power function Z=X.^Y supports only\n% the case where X and Y are scalars. In such instances, the rules\n% are identical to those outlined in the help for CVX/POWER.\n\nif length( x ) == 1 && length( y ) == 1,\n z = power( x, y );\nelse\n error( 'Disciplined convex programming error:\\n Matrix powers not permitted.', 1 ); %#ok\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/mrdivide.m", "content": "function z = mrdivide( x, y )\n\n% Disciplined convex/geomtric programming information for MRDIVIDE:\n% The MRDIVIDE operation X/Y is quite often employed with Y as a \n% scalar. In that case, it is equivalent to the RDIVIDE operation\n% X./Y, and must obey the same rules as outlined in the help for \n% CVX/RDIVIDE.\n% \n% When Y is a matrix, the MRDIVIDE operation X/Y is equivalent to\n% X*inv(Y) for both DCP and DGP purposes. The inv() operation is \n% not supported for non-constant expressions, so Y must be both \n% constant and nonsingular. The resulting matrix multiplication \n% must obey the same rules as outlined in the help for CVX/MTIMES.\n\nz = mtimes( x, y, 'rdivide' );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/mtimes.m", "content": "function z = mtimes( x, y, oper )\n\n% Disciplined convex programming information for MTIMES:\n% True matrix multiplications Z = X * Y---that is, where neither X\n% nor Y is a scalar---require both multiplications and additions. \n% For example, element (i,j) of Z is given by\n% X(i,1) * Y(1,j) + X(i,2) * Y(2,j) + ... + X(i,k) * Y(k,j)\n% Therefore, matrix multiplications must satisfy *both* the \n% \"no-product\" rule of multiplication and the \"same curvature\" rule\n% of addition. See the help for CVX/TIMES and CVX/PLUS, \n% respectively, for individual descriptions of these rules.\n% \n% An exception is made to these general rules for quadratic forms.\n% That is, two affine expressions may be multiplied together if the\n% result can immediately be verified as a convex quadratic form. \n% For example, the construction\n% variable x(n)\n% x' * Q * x <= 1;\n% would be permitted if Q is *constant* and positive semidefinite.\n% \n% Disciplined geometric programming information for TIMES:\n% As mentioned above, true matrix multiplies Z = X * Y require both\n% multiplications and additions. Since only log-convex terms can be\n% summed, both X and Y must be elementwise log-convex/affine.\n\npersistent remap\nif nargin < 3, oper = 'times'; end\n\n%\n% Check sizes\n%\n\nsx = size( x );\nsy = size( y );\nif all( sx == 1 ) || all( sy == 1 ),\n z = feval( oper, x, y );\n return\nelseif length( sx ) > 2 || length( sy ) > 2,\n error( 'Input arguments must be 2-D.' );\nelseif sx( 2 ) ~= sy( 1 ),\n error( 'Inner matrix dimensions must agree.' );\nelse\n sz = [ sx( 1 ), sy( 2 ) ];\nend\nnz = prod( sz );\n\n%\n% Check expression types\n%\n\nif cvx_isconstant( x ),\n \n xC = cvx_constant( x );\n if nnz( isnan( xC ) ),\n error( 'Disciplined convex programming error:\\n Invalid numeric values (NaNs) may not be used in CVX expressions.', 1 ); %#ok\n elseif cvx_isconstant( y ),\n yC = cvx_constant( y );\n if nnz( isnan( yC ) ),\n error( 'Disciplined convex programming error:\\n Invalid numeric values (NaNs) may not be used in CVX expressions.', 1 ); %#ok\n end\n z = feval( [ 'm', oper ], xC, yC );\n if nnz( isnan( z ) ),\n error( 'Disciplined convex programming error:\\n This expression produced one or more invalid numeric values (NaNs).', 1 ); %#ok\n end\n z = cvx( z );\n return\n elseif isequal( oper, 'rdivide' ),\n error( 'Disciplined convex programming error:\\n Matrix divisor must be constant.', 1 ); %#ok\n end\n yA = cvx_basis( y );\n laff = true;\n cnst = false;\n raff = false;\n quad = false;\n posy = false;\n vpos = false;\n \nelseif cvx_isconstant( y ),\n\n yC = cvx_constant( y );\n if nnz( isnan( yC ) ),\n error( 'Disciplined convex programming error:\\n Invalid numeric values (NaNs) may not be used in CVX expressions.', 1 ); %#ok\n elseif isequal( oper, 'ldivide' ),\n error( 'Disciplined convex programming error:\\n Matrix divisor must be constant.', 1 ); %#ok\n end\n xA = cvx_basis( x );\n raff = true;\n laff = false;\n quad = false;\n cnst = false;\n posy = false;\n vpos = false;\n \nelse\n\n if isempty( remap ),\n remap_0 = cvx_remap( 'zero' );\n remap_1 = cvx_remap( 'nonzero', 'complex' );\n temp = ~( remap_0 | remap_1 );\n remap_2 = cvx_remap( 'affine' ) & temp;\n remap_4 = cvx_remap( 'log-convex' );\n remap_5 = cvx_remap( 'log-concave' ) & ~remap_4;\n remap_4 = remap_4 & temp;\n remap_3 = cvx_remap( 'valid' ) & ~( remap_0 | remap_1 | remap_2 | remap_4 | remap_5 );\n remap = remap_1 + 2 * remap_2 + 3 * remap_3 + 4 * remap_4 + 5 * remap_5 - cvx_remap( 'invalid' );\n end\n vx = remap( cvx_classify( x ) );\n vy = remap( cvx_classify( y ) );\n xA = cvx_basis( x );\n yA = cvx_basis( y );\n xC = cvx_reshape( xA( 1, : ), sx );\n yC = cvx_reshape( yA( 1, : ), sy );\n vx = reshape( vx, sx );\n vy = reshape( vy, sy );\n cx = xC ~= 0;\n cy = yC ~= 0;\n ax = vx == 2;\n ay = vy == 2;\n px = vx == 4;\n py = vy == 4;\n gx = vx == 5;\n gy = vy == 5;\n quad = +ax * +ay;\n if nnz( quad ) ~= 0,\n if length( quad ) ~= 1,\n error( 'Disciplined convex programming error:\\n Only scalar quadratic forms can be specified in CVX\\n.', 1 ); %#ok\n else\n cx = cx & ~ax;\n cy = cy & ~ay;\n xC( ax ) = 0;\n yC( ay ) = 0;\n end\n end\n cnst = +cx * +cy; %#ok\n laff = +cx * +( vy > 1 );\n raff = +( vx > 1 ) * cy;\n posy = +px * +py;\n vpos = +gx * +gy;\n if nnz( raff ) ~= 0,\n raff = true;\n cnst = false;\n elseif nnz( laff ) ~= 0,\n laff = true;\n cnst = false;\n else\n laff = false;\n raff = false;\n cnst = true;\n end\n othr = +( vx > 1 | vx < 0 ) * +( vy > 1 | vy < 0 ) - quad - posy - vpos;\n if nnz( othr ) ~= 0,\n error( 'Disciplined convex programming error:\\n Cannot perform the operation {%s}*{%s}', cvx_class( x ), cvx_class( y ) );\n end\n quad = nnz( quad ) ~= 0;\n posy = nnz( posy ) ~= 0;\n \nend\n\nfirst = true;\n\nif cnst,\n switch oper,\n case 'ldivide', z2 = xC \\ yC;\n case 'rdivide', z2 = xC / yC;\n otherwise, z2 = xC * yC;\n end\n if first, z = z2; first = false; else z = z + z2; end %#ok\nend\n\nif raff,\n % everything * constant\n nA = size( xA, 1 );\n z2 = cvx_reshape( xA, [ nA * sx( 1 ), sx( 2 ) ] );\n if issparse( z2 ),\n tt = any( z2, 2 );\n if cvx_use_sparse( size( z2 ), nnz( tt ) * sx( 2 ), isreal( z2 ) & isreal( yC ) ),\n z2 = z2( tt, : );\n else\n tt = [];\n end\n else\n tt = [];\n end\n switch oper,\n case 'rdivide', z2 = z2 / yC;\n otherwise, z2 = z2 * yC;\n end\n z2 = cvx_reshape( z2, [ nA, nz ], tt );\n z2 = cvx( sz, z2 );\n if first, z = z2; first = false; else z = z + z2; end\nend\n\nif laff,\n % constant * everything\n nA = size( yA, 1 );\n t1 = reshape( 1 : prod( sy ), sy )';\n t2 = reshape( 1 : prod( sz ), [ sz(2), sz(1) ] )';\n z2 = yA; if raff, z2( 1, : ) = 0; end\n z2 = cvx_reshape( z2, [ nA * sy( 2 ), sy( 1 ) ], [], t1 );\n if issparse( z2 ),\n tt = any( z2, 2 );\n if cvx_use_sparse( size( z2 ), nnz( tt ) * sy( 1 ), isreal( z2 ) & isreal( xC ) ),\n z2 = z2( tt, : );\n else\n tt = [];\n end\n else\n tt = [];\n end\n switch oper,\n case 'ldivide', z2 = z2 / xC.';\n otherwise, z2 = z2 * xC.';\n end\n z2 = cvx_reshape( z2, [ nA, nz ], tt, [], t2 );\n z2 = cvx( sz, z2 );\n if first, z = z2; first = false; else z = z + z2; end\nend\n\nif quad,\n % affine * affine\n tt = ax( : ) & ay( : );\n xA = xA( :, tt ); xB = xA( 1, : ); xA( 1, : ) = 0;\n yA = yA( :, tt ); yB = yA( 1, : ); yA( 1, : ) = 0;\n xM = size( xA, 1 ); yM = size( yA, 1 );\n if xM < yM, xA( yM, end ) = 0;\n elseif yM < xM, yA( xM, end ) = 0; end\n %\n % Quadratic form test 1: See if x == a conj( y ) + b for some real a, b,\n % so that the quadratic form involves a simple squaring (or sum of squares)\n %\n cyA = conj( yA );\n alpha = sum( sum( real( xA .* yA ) ) ) ./ max( sum( sum( cyA .* yA ) ), realmin );\n if sum( sum( abs( xA - alpha * cyA ) ) ) <= 2 * eps * sum( sum( abs( xA ) ) ),\n beta = xB - alpha * conj( yB );\n yt = cvx( [ 1, size( yA, 2 ) ], yA ) + yB;\n if isreal( yA ) && isreal( yB ) && isreal( beta ),\n beta = ( 0.5 / alpha ) * beta;\n z2 = alpha * ( sum_square( yt + beta ) - sum_square( beta ) );\n elseif all( abs( beta ) <= 2 * eps * abs( xB ) ),\n z2 = alpha * sum_square_abs( yt );\n else\n error( 'Disciplined convex programming error:\\n Invalid quadratic form: product is not real.\\n', 1 ); %#ok\n end\n else\n %\n % Quadratic form test 2: Extract the quadratic coefficient matrix\n % and test it for semidefiniteness\n %\n dx = find( any( xA, 2 ) | any( yA, 2 ) );\n zb = length( dx );\n cxA = conj( xA( dx, : ) );\n cyA = cyA( dx, : );\n P = cxA * cyA.';\n Q = cxA * yB.' + cyA * xB.';\n R = xB * yB.';\n P = 0.5 * ( P + P.' );\n if ~isreal( R ) || ~isreal( Q ) || ~isreal( P ),\n error( 'Disciplined convex programming error:\\n Invalid quadratic form: product is complex.', 1 ); %#ok\n else\n xx = cvx( zb, sparse( dx, 1 : zb, 1 ) );\n [ z2, success ] = quad_form( xx, P, Q, R );\n if ~success,\n error( 'Disciplined convex programming error:\\n Invalid quadratic form: neither convex nor concave.', 1 ); %#ok\n end\n end\n end\n if first, z = z2; first = false; else z = z + z2; end\nend\n\nif posy,\n [ ix, jx ] = find( reshape( px, sx ) );\n vx = log( cvx_subsref( x, px ) );\n [ iy, jy ] = find( reshape( py, sy ) );\n vy = log( cvx_subsref( y, py ) );\n [ iz, jz ] = find( sparse( 1 : nnz(px), jx, 1 ) * sparse( iy, 1 : nnz(py), 1 ) );\n z2 = exp( vec( cvx_subsref( vx, iz ) ) + vec( cvx_subsref( vy, jz ) ) );\n z2 = sparse( ix(iz), jy(jz), z2, sz(1), sz(2) );\n if first, z = z2; first = false; else z = z + z2; end\nend\n\nif vpos,\n [ ix, jx ] = find( reshape( gx, sx ) );\n vx = log( cvx_subsref( x, gx ) );\n [ iy, jy ] = find( reshape( gy, sy ) );\n vy = log( cvx_subsref( y, gy ) );\n [ iz, jz ] = find( sparse( 1 : nnz(gx), jx, 1 ) * sparse( iy, 1 : nnz(gy), 1 ) );\n z2 = exp( vec( cvx_subsref( vx, iz ) ) + vec( cvx_subsref( vy, jz ) ) );\n z2 = sparse( ix(iz), jy(jz), z2, sz(1), sz(2) );\n if first, z = z2; first = false; else z = z + z2; end %#ok\nend\n\n%\n% Check that the sums are legal\n%\n\nv = cvx_vexity( z );\nif any( isnan( v( : ) ) ),\n temp = 'Disciplined convex programming error:';\n tt = isnan( cvx_constant( z ) );\n if any( tt ),\n temp = [ temp, '\\n This expression produced one or more invalid numeric values (NaNs).' ];\n end\n if any( isnan( v( ~tt ) ) ),\n temp = [ temp, '\\n Illegal affine combination of convex and/or concave terms detected.' ];\n end\n error( temp, 1 ); \nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/ne.m", "content": "function a = ne( x, y )\n\n% Disciplined convex/geometric programming information for NE (~=):\n% Not-equal constraints violate both the DCP and DGP rulesets. Thus\n% not-equal expressions may only appear in CVX models when both \n% sides are constant.\n\nb = newcnstr( evalin( 'caller', 'cvx_problem', '[]' ), x, y, '~=' );\nif nargout, a = b; end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/nnz.m", "content": "function s = nnz( x )\n\n% Disciplined convex/geometric programming information for NNZ:\n% When used in CVX models, NNZ cannot deduce the numeric value of a\n% CVX variable, so it returns the number of \"structurally\" nonzero\n% elements; i.e., those that are not *identically* zero. This is\n% similar to the concept of structural nonzeros in sparse matrix\n% factorizations. To illustrate the distinction, consider:\n% variable x(3);\n% x(2) == 0;\n% y = [x(1);0;x(3)];\n% In this case, NNZ(x) returns 3, even though x(2) has been set to\n% zero in an equality constraint. (After all, the overall model may\n% be infeasible, in which case x(2) is arguably not zero.) However,\n% NNZ(y) returns 2, because y(2) is identically zero.\n\ns = nnz( any( x.basis_, 1 ) );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/norm.m", "content": "function cvx_optval = norm( x, p )\n\n% Disciplined convex programming information:\n% NORM is convex, except when P<1, so an error will result if\n% these non-convex \"norms\" are used within CVX expressions. NORM \n% is nonmonotonic, so its input must be affine.\n\n%\n% Argument map\n%\n\npersistent remap1 remap2\nif isempty( remap2 ),\n remap1 = cvx_remap( 'log-convex' );\n remap2 = cvx_remap( 'affine', 'log-convex' );\nend\n\n%\n% Check arguments\n%\n\nnarginchk(1,2);\nif nargin < 2,\n p = 2;\nelseif ~isequal( p, 'fro' ) && ( ~isnumeric( p ) || ~isreal( p ) || p < 1 ),\n error( 'Second argument must be a real number between 1 and Inf, or ''fro''.' );\nend\nif ndims( x ) > 2, %#ok\n error( 'norm is not defined for N-D arrays.' );\nend\n\n[m,n] = size(x);\nif m == 1 || n == 1 || isequal( p, 'fro' ),\n \n %\n % Vector norms\n %\n \n if isempty( x ),\n cvx_optval = cvx( 0 );\n return\n end\n if isequal( p, 'fro' ),\n p = 2;\n end\n x = svec( x, p );\n if length( x ) == 1,\n p = 1;\n end\n xc = cvx_classify( x );\n if ~all( remap2( xc ) ),\n error( 'Disciplined convex programming error:\\n Cannot perform the operation norm( {%s}, %g )', cvx_class( x ), p );\n end\n switch p,\n case 1,\n cvx_optval = sum( abs( x ) );\n case Inf,\n cvx_optval = max( abs( x ) );\n otherwise,\n tt = remap1( xc );\n if all( tt ),\n cvx_optval = ( sum( x .^ p ) ) .^ (1/p);\n else\n if nnz( tt ) > 1,\n tt = tt ~= 0;\n xx = cvx_subsref( x, tt );\n xx = ( sum( xx .^ p ) ) .^ (1/p);\n x = [ cvx_subsref( x, ~tt ) ; cvx_accept_convex( xx ) ];\n end\n n = length( x );\n if p == 2,\n z = [];\n cvx_begin\n epigraph variable z\n { x, z } == lorentz( n, [], ~isreal( x ) ); %#ok\n cvx_end\n else\n if isreal( x ),\n cmode = 'abs';\n else\n cmode = 'cabs';\n end\n y = []; z = [];\n cvx_begin\n epigraph variable z\n variable y( n )\n { [ y, z*ones(n,1) ], x } == geo_mean_cone( [n,2], 2, [1/p,1-1/p], cmode ); %#ok\n sum( y ) == z; %#ok\n cvx_end\n end\n end\n end\n \nelse\n \n %\n % Matrix norms\n %\n \n if ~cvx_isaffine( x ),\n error( 'Disciplined convex programming error:\\n Cannot perform the operation norm( {%s}, %g )\\n when the first argument is a matrix.', cvx_class( xt ), p );\n end\n switch p,\n case 1,\n cvx_optval = max( sum( abs( x ), 1 ), [], 2 );\n case Inf,\n cvx_optval = max( sum( abs( x ), 2 ), [], 1 );\n case 2,\n cvx_optval = sigma_max( x );\n otherwise,\n error( 'The only matrix norms available are 1, 2, Inf, and ''fro''.' );\n end\n \nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/permute.m", "content": "function y = permute( x, order )\n\n% Disciplined convex/geometric programming information for PERMUTE:\n% PERMUTE(A,ORDER) imposes no convexity restrictions on A. ORDER\n% must be constant.\n\n%\n% Determine the permutation\n%\n\ns = x.size_;\nndxs = 1 : prod( s );\nndx2 = permute( reshape( ndxs, s ), order );\n\n%\n% Permute the data\n%\n\nb = x.basis_;\ntry\n b = x.basis_( :, ndx2 );\ncatch %#ok\n ndxs( ndx2( : ).' ) = ndxs;\n [ r, c, v ] = find( b );\n b = sparse( r, ndxs( c ), v, size( b, 1 ), size( b, 2 ) );\n clear r c v\nend\ny = cvx( size( ndx2 ), b );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/plus.m", "content": "function z = plus( x, y, isdiff, cheat )\n\n% Disciplined convex programming information for PLUS:\n% Both terms in a sum must have the same curvature. Real affine\n% expressions are both convex and concave, so they can be added to\n% any nonlinear expressions. Complex affine (or constant)\n% expressions, however, can only be added to other affine \n% expressions. So, for example, the following sums are valid:\n% {convex}+{convex} {concave}+{concave} {affine}+{affine}\n% The following are not:\n% {convex}+{concave} {convex}+{complex constant}\n% \n% Disciplined geometric programming information for PLUS:\n% Only log-convex terms may be summed; this includes positive \n% constants, monomials, posynomials, and generalized posynomials.\n% \n% For vectors, matrices, and arrays, these rules are verified \n% indepdently for each element.\n\n%\n% Default arguments\n%\n\npersistent remap_plus remap_minus\nif nargin < 4,\n if nargin < 3,\n isdiff = false;\n end\n cheat = false;\nend\n\n%\n% Check sizes\n%\n\nsx = size( x );\nsy = size( y );\nxs = all( sx == 1 );\nys = all( sy == 1 );\nif xs,\n sz = sy;\nelseif ys,\n sz = sx;\nelseif ~isequal( sx, sy ),\n error( 'Matrix dimensions must agree.' );\nelse\n sz = sx;\nend\n\n%\n% Check vexity\n%\n\nif ~cheat,\n if isempty( remap_plus ),\n temp0 = cvx_remap( 'affine' );\n tempc = cvx_remap( 'complex', 'complex-affine' );\n temp1 = cvx_remap( 'convex' ) & ~temp0;\n temp1c = temp1 + tempc;\n temp2 = cvx_remap( 'concave' ) & ~temp0;\n temp2c = temp2 + tempc;\n temp3 = temp1' * temp2c + temp2' * temp1c;\n temp1 = temp1' * temp1c;\n temp2 = temp2' * temp2c;\n temp4 = ( cvx_remap( 'log-concave' ) & ~cvx_remap( 'log-affine' ) )' * +(~cvx_remap( 'zero' )) | ...\n cvx_remap( 'invalid' )' * cvx_remap( 'valid', 'invalid' );\n temp4 = temp4 | temp4';\n remap_minus = temp4 | temp1 | temp1' | temp2 | temp2';\n remap_plus = temp4 | temp3 | temp3';\n end\n vx = cvx_classify( x );\n vy = cvx_classify( y );\n bad = vx + size( remap_plus, 1 ) * ( vy - 1 );\n if isdiff,\n bad = remap_minus( bad );\n else\n bad = remap_plus( bad );\n end\n if nnz( bad ),\n if ~xs, x = cvx_subsref( x, bad ); end\n if ~ys, y = cvx_subsref( y, bad ); end\n if isdiff, op = '-'; else op = '+'; end\n error( 'Disciplined convex programming error:\\n Illegal operation: {%s} %s {%s}', cvx_class( x, false, true ), op, cvx_class( y, false, true ) );\n end\nend\n\n%\n% Apply operation, stretching basis matrices as needed\n%\n\nif any( sz == 0 ),\n bz = sparse( 1, 0 );\nelse\n x = cvx( x );\n y = cvx( y );\n bx = x.basis_;\n by = y.basis_;\n if isdiff,\n by = -by;\n end\n if xs && ~ys,\n nz = prod( sz );\n bx = bx( :, ones( 1, nz ) );\n elseif ys && ~xs,\n nz = prod( sz );\n by = by( :, ones( 1, nz ) );\n end\n [ nx, nv ] = size( bx );\n ny = size( by, 1 );\n if nx < ny,\n if issparse( by ), bx = sparse( bx ); end\n bx = [ bx ; sparse( ny - nx, nv ) ];\n elseif ny < nx,\n if issparse( bx ), by = sparse( by ); end\n by = [ by ; sparse( nx - ny, nv ) ];\n end\n bz = bx + by;\nend\n\n%\n% Construct result\n%\n\nz = cvx( sz, bz );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/polyval.m", "content": "function y = polyval( p, x )\r\n\r\n% Disciplined convex/geometric programming information for POLYVAL:\r\n% POLYVAL can be used with CVX variables in two ways:\r\n% -- If P is constant and X is a variable, then POLYVAL(P,X)\r\n% represents a polynomial function of X, p(X). If p(X) is affine\r\n% then the basic DCP or DCP rules for sums and products apply.\r\n% If P is nonlinear then:\r\n% -- for DCPs, the polynomial must be convex or concave, and X\r\n% must be affine (such polynomials cannot be monotonic).\r\n% -- for DGPs, the elements of P must be nonnegative, in which\r\n% case p(X) is nondecreasing, so X must be log-convex.\r\n% -- If X is a constant and P is a variable, then POLYVAL(P,X)\r\n% performs a weighted sum of the elements of P. The weights are,\r\n% of course, [X^N,X^(N-1),...,X,1]. As in the affine case above,\r\n% then standard DCP or DGP rules for sums and products apply.\r\n\r\nsp = size( p );\r\nif isempty( p ),\r\n p = zeros( 1, 0 );\r\nelseif length( sp ) > 2 || ~any( sp == 1 ),\r\n error( 'First argument must be a vector.' );\r\nend\r\nsx = size(x);\r\n\r\npersistent remap\r\nif isempty( remap ),\r\n remap_1 = cvx_remap( 'real-affine' );\r\n remap_2 = cvx_remap( 'log-convex' );\r\n remap = remap_1 + 2 * remap_2;\r\nend\r\n\r\nif cvx_isconstant( p ),\r\n p = cvx_constant( p );\r\n if cvx_isconstant( x ),\r\n y = cvx( polyval( p, cvx_constant( x ) ) );\r\n return\r\n end\r\n if any( isinf( p ) | isnan( p ) ),\r\n error( 'Inf and NaN not accepted here.' );\r\n end\r\n ndxs = find( p );\r\n if isempty( ndxs ),\r\n y = zeros( sx );\r\n return\r\n end\r\n for k = ndxs(:)',\r\n pt = p( k : end );\r\n if ~any( isinf( pt ./ pt(1) ) ),\r\n p = pt;\r\n break;\r\n end\r\n end\r\n n = length( p );\r\n switch length( p ),\r\n case 0,\r\n % Zero\r\n y = zeros(sx);\r\n case 1,\r\n % Constant\r\n y = cvx( p(1) * ones(sx) );\r\n case 2,\r\n % Affine\r\n y = p(1) * x + p(2);\r\n otherwise,\r\n vu = remap(cvx_classify(x));\r\n p = reshape( p, n, 1 );\r\n t0 = vu == 0;\r\n if any( t0 ),\r\n error( 'Disciplined convex programming error:\\n Illegal operation: polyval( p, {%s} ).', cvx_class( cvx_subsref( x, t0 ), false, true ) );\r\n end\r\n t1 = vu == 1;\r\n if any( t1 ),\r\n pd = roots( (n-2:-1:1).*(n-1:-1:2).*p(1:end-2,:)' );\r\n pd = pd( imag(pd) == 0 );\r\n if ~isempty( pd ),\r\n pr = diff( [ 0, find(diff(sort(pd))~=0), length(pd) ] );\r\n if any( rem( pr, 2 ) ),\r\n error( 'Polynomials in DCPs must be affine, convex, or concave.' );\r\n end\r\n end\r\n end\r\n t2 = vu == 2;\r\n if any( t2 ) && any( p < 0 ),\r\n error( 'Polynomials in DGPs must have nonnegative coefficients.' );\r\n end\r\n if any( t2 ),\r\n if all( t2 ),\r\n y = x;\r\n else\r\n y = cvx_subsref( x, t2 );\r\n end\r\n ny = numel(y);\r\n y = reshape( y, ny, 1 );\r\n q = find( p(1:end-2) );\r\n y = ( ( y * ones(1,length(q)) ) .^ ( ones(ny,1) * (n-q)' ) ) * p(q,:) + p(end-1) * y + p(end);\r\n if all( t2 ),\r\n y = reshape( y, sx );\r\n else\r\n y = cvx_subsasgn( x, t2, y );\r\n end\r\n end\r\n if all( t1 ),\r\n y = poly_env( p, x );\r\n elseif any( t1 ),\r\n y = cvx_subsasgn( y, t1, poly_env( p, cvx_subsref( x, t1 ) ) );\r\n end\r\n end\r\n \r\nelseif cvx_isconstant( x ),\r\n \r\n n = length( p );\r\n [ ii, jj, vv ] = find( p );\r\n jj = ii + jj - 1;\r\n nv = length(vv);\r\n nx = prod( sx );\r\n y = reshape( x, nx, 1 ) * ones( 1, nv );\r\n y = y .^ ( ones( nx, 1 ) * (n-jj(:))' );\r\n y = reshape( y * reshape( vv, nv, 1 ), sx );\r\n \r\nelse\r\n \r\n error( 'At least one of the arguments must be constant.' );\r\n \r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/power.m", "content": "function z = power( x, y )\n\n% Disciplined convex programming information for POWER (.^):\n% When used in CVX expressions, either X or Y must be constant. Only\n% certain convex or concave branches are accepted as valid:\n% --- if both X and Y are constant, then Z = X.^Y is interpreted\n% precisely as the MATLAB built-in version.\n% --- if Y is constant and 0 < Y < 1, then Z = X.^Y is concave and\n% nondecreasing in X. Therefore, X must be concave, and is\n% implicitly constrained to be nonnegative.\n% --- if Y is constant and Y == 1, then Z = X.\n% --- if Y is constant and a positive even integer, then Z = X.^Y\n% is convex and nonmonotonic in X. Therefore, X must be affine.\n% --- if Y is constant and Y > 1, but *not* an integer, then \n% Z = X.^Y is convex and nonmonotonic in X. Therefore, X must\n% be affine (and real), and is implicitly constrained to be\n% nonnegative.\n% In expert mode, additional cases are handled:\n% --- if X is constant and 0 < X < 1, then Z = X.^Y is convex and\n% nonincreasing in X. Therefore, Y must be concave.\n% --- if X is constant and X == 1, then Z = 1.\n% --- if X is constant and X > 1, then Z = X.^Y is convex and\n% nondecreasing in X. Therefore, Y must be convex.\n% All other combinations are rejected as invalid. For instance, if Y\n% is an odd integer, then X .^ Y is neither convex nor concave, so it\n% is rejected. In such cases, consider using POW_P, POW_POS, or\n% POW_ABS instead.\n% \n% Disciplined geometric programming information for POWER (.^):\n% In disciplined geometric programs, the power operation Z=X.^Y is\n% valid only if Y is a real constant. There are no restrictions on\n% X. Note that a negative exponent Y reverses curvature; that is, Z\n% is log-convex if X is log-concave, and vice versa.\n\n%\n% Check sizes\n%\n\nsx = size( x ); xs = all( sx == 1 );\nsy = size( y ); ys = all( sy == 1 );\nif xs,\n sz = sy;\nelseif ys || isequal( sx, sy ),\n sz = sx;\nelse\n error( 'Matrix dimensions must agree.' );\nend\n\n%\n% Determine the expression types\n%\n\nif cvx_isconstant( y ),\n \n z = pow_cvx( x, y, 'power' );\n return\n \nelseif ~cvx_isconstant( x ),\n \n error( 'Disciplined convex programming error:\\n In an expression X .^ Y, either X or Y must be constant.', 1 ); %#ok\n \nend\n\n%\n% Now handle constant .^ non-constant\n%\n \npersistent remap\nif isempty( remap ),\n\tremap_y1 = cvx_remap( 'real-affine' );\n\tremap_y2 = cvx_remap( 'convex' ) & ~remap_y1;\n\tremap_y3 = cvx_remap( 'concave' ) & ~remap_y1;\n\tremap_y4 = cvx_remap( 'log-valid' ) & ~( remap_y1 | remap_y2 | remap_y3 );\n\tremap = [0;0;2;2;2] * remap_y1 + ...\n\t [0;0;0;2;2] * remap_y2 + ...\n\t [0;0;2;2;0] * remap_y3 + ...\n\t [0;1;0;2;0] * remap_y4;\nend\nx = cvx_constant( x );\nvy = cvx_classify( y );\nvx = 1 + isreal( x ) .* ( ( x >= 0 ) + ( x > 0 ) + ( x >= 1 ) + ( x > 1 ) );\nvr = remap( vx + size( remap, 1 ) * ( vy - 1 ) );\nvu = sort( vr(:) );\nvu = vu([true;diff(vu)~=0]);\nnv = length( vu );\n\n%\n% Perform the individual computations and combine\n%\n\nx = cvx( x ); xt = x;\ny = cvx( y ); yt = y;\nif nv ~= 1,\n z = cvx( sz, [] );\nend\nfor k = 1 : nv,\n\n %\n % Select the category of expression to compute\n %\n\n if nv ~= 1,\n t = vr == vu( k );\n if ~xs, xt = cvx_subsref( x, t ); sz = size( xt ); end\n if ~ys, yt = cvx_subsref( y, t ); sz = size( yt ); end\n end\n\n %\n % The computational kernels\n %\n\n switch vu( k ),\n case 0,\n % Invalid\n error( 'Disciplined convex programming error:\\n Cannot perform the operation {%s}.^{%s}', cvx_class( xt, true, true, true ), cvx_class( yt, true, true, true ) );\n case 1,\n % zero .^ convex\n cvx_optval = cvx( zeros( sz ) );\n case 2,\n % (01) .^ convex\n cvx_optval = exp( log( cvx_constant( xt ) ) .* yt );\n otherwise,\n error( 'Shouldn''t be here.' );\n end\n\n %\n % Store the results\n %\n\n if nv == 1,\n z = cvx_optval;\n else\n z = cvx_subsasgn( z, t, cvx_optval );\n end\n\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/prod.m", "content": "function y = prod( x, dim )\r\n\r\n% Disciplined geometric programming information for PROD:\r\n% PROD(X) and PROD(X,DIM) are vectorized versions of multiplication\r\n% so in most cases it would be incompatible with DCPs. Therefore it\r\n% has not been implemented to support DCPs. DGPs however support\r\n% products more liberally. When PROD is used in a DCP, elements in\r\n% each subvector must satisfy the corresponding combination rule\r\n% for multiplication (see TIMES). For example, suppose that X looks\r\n% like this:\r\n% X = [ log-convex log-concave log-affine ;\r\n% log-affine log-concave log-concave ]\r\n% Then PROD(X,1) would be permittted, but PROD(X,2) would not, \r\n% because the top row contains the product of log-convex and \r\n% log-concave terms, in violation of the DGP ruleset.\r\n\r\nnarginchk(1,2);\r\n\r\n%\r\n% Size check\r\n%\r\n\r\ntry\r\n ox = x;\r\n if nargin < 2, dim = []; end\r\n [ x, sx, sy, zx, zy, nx, nv, perm ] = cvx_reduce_size( x, dim ); %#ok\r\ncatch exc\r\n error( exc.message );\r\nend\r\n \r\n%\r\n% Quick exit for easy cases\r\n%\r\n\r\nif isempty( x ),\r\n if ~any( zy ), zy = 1; end\r\n y = cvx( ones( zy ) );\r\n return\r\nelseif nx == 1,\r\n y = ox;\r\n return\r\nend\r\n\r\n%\r\n% Type check\r\n%\r\n\r\npersistent remap_1 remap_2 remap_3 remap_0\r\nif isempty( remap_3 ),\r\n remap_0 = cvx_remap( 'zero' );\r\n remap_1 = cvx_remap( 'constant' );\r\n remap_2 = cvx_remap( 'log-convex' );\r\n remap_3 = cvx_remap( 'log-concave' );\r\nend\r\nvx = cvx_reshape( cvx_classify( x ), sx );\r\nt0 = any( reshape( remap_0( vx ), sx ) );\r\nt1 = all( reshape( remap_1( vx ), sx ) );\r\nt2 = all( reshape( remap_2( vx ), sx ) ) | ...\r\n all( reshape( remap_3( vx ), sx ) );\r\nt3 = t0 & t1;\r\nta = t3 + 2 * ( t2 & ~t3 );\r\nnu = sort( ta(:) );\r\nnu = nu([true;diff(nu)~=0]);\r\nnk = length( nu );\r\n\r\n%\r\n% Perform the computations\r\n%\r\n\r\nif nk > 1,\r\n y = cvx( [ 1, nv ], [] );\r\nend\r\nfor k = 1 : nk,\r\n\r\n if nk == 1,\r\n xt = x;\r\n else\r\n tt = ta == nu( k );\r\n xt = cvx_subsref( x, ':', tt );\r\n end\r\n\r\n switch nu( k ),\r\n case 0,\r\n error( 'Disciplined convex programming error:\\n Invalid computation: prod( {%s} )', cvx_class( xt, true, true ) );\r\n case 1,\r\n yt = cvx( prod( cvx_constant( xt ) ) );\r\n case 2,\r\n yt = exp( sum( log( xt ) ) );\r\n otherwise,\r\n error( 'Shouldn''t be here.' );\r\n end\r\n\r\n if nk == 1,\r\n y = yt;\r\n else\r\n y = cvx_subsasgn( y, tt, yt );\r\n end\r\n\r\nend\r\n\r\n%\r\n% Reverse the reshaping and permutation steps\r\n%\r\n\r\ny = reshape( y, sy );\r\nif ~isempty( perm ),\r\n y = ipermute( y, perm );\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/rdivide.m", "content": "function z = rdivide( x, y )\n\n% Disciplined convex programming information for RDIVIDE:\n% For DCP purposes, the RDIVIDE division operator X./Y is identical\n% to X.*(1./Y). The right-hand term must be constant and non-zero;\n% and if the left-hand term is nonlinear, the constat must be real.\n% \n% Disciplined geometric programming information for RDIVIDE:\n% Terms in a left divide must have opposite log-curvature, so the\n% following products are permitted:\n% {log-convex} ./ {log-concave} {log-concave} ./ {log-convex}\n% {log-affine} ./ {log-affine}\n% Note that log-affine expressions are both log-convex and \n% log-concave.\n% \n% For vectors, matrices, and arrays, these rules are verified \n% indepdently for each element.\n\nz = times( x, y, './' );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/real.m", "content": "function y = real( x )\n\n% Disciplined convex/geometric programming information for REAL:\n% REAL(X) may be freely applied to any CVX expression. However,\n% since REAL(X)=X for all real expressions (including convex,\n% concave, log-convex, and log-concave), it is only useful in\n% the complex affine case.\n\ny = cvx( x.size_, real( x.basis_ ) );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/reshape.m", "content": "function x = reshape( x, varargin )\n\n% Disciplined convex/geometric programming information for RESHAPE:\n% RESHAPE imposes no convexity restrictions on its arguments.\n\n%\n% Check size arguments\n%\n\nswitch nargin,\n case {0,1},\n error( 'Not enough input arguments.' );\n case 2,\n [ temp, sz ] = cvx_check_dimlist( varargin{1}, true );\n if ~temp,\n error( 'Second argument must be a valid dimension list.' );\n end\n otherwise,\n [ temp, sz ] = cvx_check_dimlist( varargin, true );\n if ~temp,\n error( 'Second and subsequent arguments must be nonnegative integers.' );\n end\nend\n\n%\n% Quick exit if the size remains the same\n%\n\nsx = x.size_;\nif isequal( sx, sz ),\n return;\nend\n\n%\n% Confirm compatible reshape\n%\n\npx = prod( sx );\ntt = isnan( sz );\nif any( tt ),\n if nnz( tt ) > 1,\n error( 'Size can only have one unknown dimension.' );\n end\n tmp = px / prod( sz( ~tt ) );\n if isnan( tmp ) || tmp ~= floor( tmp ),\n error( 'Product of known dimensions, %d, not divisible into total number of elements, %d.', prod( sz( ~tt ) ), px );\n end\n sz( tt ) = tmp;\nelseif px ~= prod( sz ),\n error( 'To RESHAPE the number of elements must not change.' );\nend\n\n%\n% Perform the resize\n%\n\nx = cvx( sz, x.basis_ );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/size.m", "content": "function varargout = size( x, dim )\n\n% Disciplined convex/geometric programming information for SIZE:\n% SIZE imposes no convexity restrictions on its first argument.\n% The second argument, if supplied, must be a positive integer.\n\ns = x.size_;\nif nargin > 1,\n if nargout > 1,\n error( 'Too many output arguments.' );\n elseif ~isnumeric( dim ) || length( dim ) ~= 1 || dim <= 0 || dim ~= floor( dim ),\n error( 'Dimension argument must be a positive integer scalar.' );\n elseif dim > length( s ),\n varargout{1} = 1;\n else\n varargout{1} = s(dim);\n end\nelseif nargout > 1,\n ns = length( s );\n no = nargout;\n if no > ns,\n s( end+1:no ) = 1;\n elseif no < ns,\n s( no ) = prod( s( no : end ) );\n end\n for k = 1 : no,\n varargout{k} = s(k); %#ok\n end\nelse\n varargout{1} = s;\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/sparse.m", "content": "function z = sparse( i, j, x, m, n )\r\n\r\n% Disciplined convex/geometric programming information for SPARSE:\r\n% For a CVX variable X, SPARSE(X) just returns X. In the three-\r\n% and five-argument versions SPARSE(I,J,V,M,N), the index\r\n% arguments I and J and size arguments M and N must be constant.\r\n% If any of the index pairs (I(k),J(k)) are repeated, then the\r\n% corresponding elements V(k) will be added together. Therefore,\r\n% those elements must be compatible with addition; i.e., they\r\n% must have the same curvature.\r\n\r\nswitch nargin,\r\n\tcase 1,\r\n\t\tz = i;\r\n\t\treturn\r\n\tcase {2,4}\r\n\t\terror( 'Not enough arguments.' );\r\nend\r\n\r\n%\r\n% Check sizes and indices\r\n%\r\n\r\nif ( ~isnumeric( i ) && ~ischar( i ) ) || ( ~isnumeric( j ) && ~ischar( j ) ),\r\n error( 'The first two arguments must be numeric.' );\r\nend\r\nnn = [ numel( i ), numel( j ), prod( x.size_ ) ];\r\nnz = max( nn );\r\nif any( nn(nn~=nz) ~= 1 ),\r\n error( 'Vectors must be the same lengths.' );\r\nend\r\ni = i( : ); j = j( : );\r\nif nargin == 3,\r\n m = max( i );\r\n n = max( j );\r\nelseif ( ~isnumeric( m ) && ~ischar( m ) ) || ( ~isnumeric( n ) && ~ischar( n ) ) || n < 0 || m < 0 || n ~= floor( n ) || m ~= floor( m ),\r\n error( 'Sparse matrix sizes must be positive integers.' );\r\nelseif any( i > m ) || any( j > n ),\r\n error( 'Index exceeds matrix dimensions.' );\r\nend\r\n\r\n%\r\n% Reconstruct basis matrices and indices\r\n%\r\n\r\n[ ix, jx, vx ] = find( x.basis_ );\r\nij = i + m * ( j - 1 );\r\nif length(ij) > 1,\r\n ij = ij(jx);\r\nend\r\nxb = sparse( ix, ij, vx, max(ix), m * n );\r\nz = cvx( [ m, n ], xb );\r\n\r\n%\r\n% Verify vexity is preserved\r\n%\r\n\r\nv = cvx_vexity( z );\r\nif any( isnan( v( : ) ) ),\r\n error( 'Disciplined convex programming error:\\n Sparse matrix construction produced invalid sums of convex and concave terms.' );\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/spy.m", "content": "function spy( x, mode )\nglobal cvx___\n\n% SPY is not a computational function, so it can be applied to any \n% CVX variables. \n\nswitch nargin,\n case 0,\n error( 'Not enough arguments.' );\n case 1,\n mode = '';\n case 2,\n if ~ischar( mode ) || size( mode, 1 ) > 1,\n error( 'Second argument must be a string.' );\n end\nend\n\nb = x.basis_;\ns = x.size_;\n\nswitch mode,\n case { '2-d', '2-D', '2d', '2D' },\n b = sum( b ~= 0, 1 );\n b = reshape( b, s );\n case { '', '3-d', '3-D', '3d', '3D' },\n p = length( cvx___.reserved ) + 1;\n if size( b, 1 ) < p, b( p, end ) = 0; end\n otherwise,\n error( [ 'Unknown spy mode: ', mode ] );\nend\n\nspy( b );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/sqrt.m", "content": "function cvx_optval = sqrt( x )\n\n% Discipined convex programming information for SQRT:\n% SQRT(X) is log-concave and nondecreasing in X. Therefore, when used\n% in DCPs, X must be concave (or affine).\n% \n% Disciplined geometric programming information for SQRT:\n% SQRT(X) is log-log-affine and nondecreasing in X. Therefore, when\n% used in DGPs, X may be log-affine, log-convex, or log-concave.\n\nnarginchk(1,1);\n\n%\n% Determine the expression types\n%\n\n% 0 : affine complex, convex, invalid\n% 1 : constant\n% 2 : concave, real affine\npersistent remap\nif isempty( remap ),\n remap_1 = cvx_remap( 'constant' );\n remap_2 = cvx_remap( 'real-affine', 'concave' );\n remap_3 = cvx_remap( 'log-convex', 'log-concave' );\n remap = remap_1 + ( 2 * remap_2 + 3 * remap_3 ) .* ~remap_1;\nend\nv = remap( cvx_classify( x ) );\n\n%\n% Perform the computations for each expression type separately\n%\n\nvu = sort( v(:) );\nvu = vu([true;diff(vu)~=0]);\nnv = length( vu );\nsx = x.size_;\nif nv ~= 1,\n y = cvx( sx, [] );\nend\nfor k = 1 : nv,\n\n %\n % Select the category of expression to compute\n %\n\n vk = vu( k );\n if nv == 1,\n xt = x;\n else\n t = v == vk;\n xt = cvx_subsref( x, t );\n end\n\n %\n % Perform the computations\n %\n\n switch vk,\n case 0,\n % Invalid\n error( 'Disciplined convex programming error:\\n Illegal operation: sqrt( {%s} ).', cvx_class( xt, true, true ) );\n case 1,\n % Constant\n cvx_optval = cvx( builtin( 'sqrt', cvx_constant( xt ) ) );\n case 2,\n % Real affine, concave\n w = [];\n st = size( xt ); %#ok\n cvx_begin\n hypograph variable w( st );\n square( w ) <= xt; %#ok\n cvx_end\n case 3,\n % Monomial, posynomial\n cvx_optval = exp( 0.5 * log( xt ) );\n otherwise,\n error( 'Shouldn''t be here.' );\n end\n\n %\n % Store the results\n %\n\n if nv == 1,\n y = cvx_optval;\n else\n y = cvx_subsasgn( y, t, cvx_optval );\n end\n\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/std.m", "content": "function y = std( x, w, dim )\n\n%STD Internal cvx version.\n\nif ~cvx_isaffine( x ),\n error( 'Disciplined convex programming error:\\n VAR is convex and nonmonotonic in X, so X must be affine.', 1 ); %#ok\nelseif nargin > 1 && ~cvx_isconstant( w ),\n error( 'Weight vector must be constant.' );\nend\n\ntry\n if nargin < 3, dim = []; end\n [ x, sx, sy, zx, zy, nx, nv, perm ] = cvx_reduce_size( x, dim ); %#ok\ncatch exc\n error( exc.message );\nend\n\nif nx > 1 && nv > 0,\n if nargin < 2 || numel( w ) == 1,\n if nargin == 2 && w,\n denom = nx;\n else\n denom = nx - 1;\n end\n % In theory we could just say y = mean(abs(x-mean(x))). However, by\n % adding an extra variable we preserve sparsity.\n cvx_begin\n variable xbar( 1, nv )\n denom * xbar == sum( x ); %#ok\n minimize( norms( x - ones(nx,1) * xbar ) / sqrt( denom ) );\n cvx_end\n y = cvx_optval;\n elseif numel( w ) ~= nx || ~isreal( w ) || any( w < 0 ),\n error( 'Weight vector expected to have %d nonnegative elements.', w );\n else\n sw = sum( w(:) );\n if sw == 0,\n error( 'Weight vector must not be all zeros.' );\n end\n w = w(:) / sw;\n cvx_begin\n variable xbar( 1, nv )\n xbar == sum( w' * x ); %#ok\n w = sqrt( w );\n minimize( norms( w( :, ones(1,nv) ) .* ( x - ones(nx,1) * xbar ) ) );\n cvx_end\n y = cvx_optval;\n end\nelseif nx == 0,\n y = NaN( sy );\nelse\n y = zeros( sy );\nend\n\n%\n% Reverse the reshaping and permutation steps\n%\n\ny = reshape( y, sy );\nif ~isempty( perm ),\n y = ipermute( y, perm );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/subsasgn.m", "content": "function x = subsasgn( x, S, y )\n\n% Disciplined convex/geometric programming information for SUBSASGN:\n% Subscripting can be used to change values of elements or slices\n% of CVX variables in the same manner as with numeric arrays. All\n% conventions are preserved, including the colon ':' and 'end'\n% notation, as well as the ability to \"expand\" a CVX variable by\n% assigning a value to a location outside of its current dimensions\n% (e.g., X(end+1)=0).\n% \n% One notable exception is this: if the right-hand side is a CVX\n% expression, then the left-hand side must be as well. So, for \n% example, the following will fail:\n% variable x;\n% y = ones(3,1);\n% y(2) = x;\n% This is because MATLAB does not know how to automatically promote\n% 'y' to a CVX variable so that it can accept 'x' as an element. If\n% you want\n% to accomplish something like this, you must manually convert y into a\n% CVX variable first, as follows:\n% variable x;\n% y = cvx(ones(3,1));\n% y(2) = x;\n\nnarginchk(3,3);\n\n%\n% Test subscripts\n%\n\nszx = size( x );\nszy = size( y );\nnlx = prod( szx );\ntry\n temp = reshape( 1 : nlx, szx );\n ndx_x = builtin( 'subsasgn', temp, S, zeros( szy ) );\ncatch errmsg\n error( errmsg.identifier, errmsg.message );\nend\nszx_n = size( ndx_x );\nif length( szx_n ) ~= length( szx ),\n szx_n(end+1:length(szx)) = 1;\n szx(end+1:length(szx_n)) = 1;\nend\n\n%\n% Assign data\n%\n\nx = cvx( x );\nbx = x.basis_;\nif any( szx_n < szx ),\n bx = bx( :, ndx_x );\nelse\n if any( szx_n > szx ),\n bx( :, end + 1 ) = 0;\n ndx_x( ndx_x == 0 ) = size( bx, 2 );\n bx = bx( :, ndx_x );\n temp = reshape( 1 : prod( szx_n ), szx_n );\n end\n ndx_x = builtin( 'subsref', temp, S );\n ndx_x = ndx_x( : );\n nlz = length( ndx_x );\n y = cvx( y );\n by = y.basis_;\n nx = size( bx, 1 );\n [ ny, my ] = size( by );\n if nx < ny,\n if issparse( by ) && ~issparse( bx ), bx = sparse( bx ); end\n bx( ny, : ) = 0;\n elseif nx > ny,\n if issparse( bx ) && ~issparse( by ), by = sparse( by ); end\n by( nx, : ) = 0;\n end\n if my < nlz,\n by = by( :, ones( 1, nlz ) );\n end\n bx( :, ndx_x ) = by;\nend\n\n%\n% Create the new object\n%\n\nx = cvx( szx_n, bx );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/subsref.m", "content": "function x = subsref( x, S )\n\n% Disciplined convex/geometric programming information for SUBSREF:\n% The use of subscripts to extract elements or \"slices\" of any CVX\n% variable is identical to their use with numeric arrays. All \n% conventions are preserved, including the colon ':' and 'end'.\n\nnarginchk(2,2);\n\ntry\n ndxs = builtin( 'subsref', reshape( 1 : prod( x.size_ ), x.size_ ), S );\ncatch errmsg\n error( errmsg.identifier, errmsg.message );\nend\n\nx = cvx( size( ndxs ), x.basis_( :, ndxs ) );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/sum.m", "content": "function y = sum( x, dim )\n\n% Disciplined convex/geometric programming information for SUM:\n% SUM(X) and SUM(X,DIM) is a vectorized version of addition. So \n% when SUM is used in a DCP or DGP, elements in each subvector must\n% satisfy the corresponding combination rules for addition (see \n% PLUS). For example, suppose that X looks like this:\n% X = [ convex concave affine ;\n% affine concave concave ]\n% Then SUM(X,1) would be permittted, but SUM(X,2) would not, \n% because the top row contains the sum of convex and concave terms,\n% in violation of the DCP ruleset. For DGPs, addition rules dictate\n% that the elements of X must be log-convex or log-affine.\n\n%\n% Basic argument check\n%\n\ns = size( x );\nswitch nargin,\n case 0,\n error( 'Not enough input arguments.' );\n case 1,\n dim = [ find( s > 1 ), 1 ];\n dim = dim( 1 );\n case 2,\n if ~isnumeric( dim ) || dim <= 0 || dim ~= floor( dim ),\n error( 'Second argument must be a dimension.' );\n end\nend\n\nif dim > length( s ) || s( dim ) == 1,\n\n y = x;\n\nelseif s( dim ) == 0,\n\n if ~any( s ), s = [1,1];\n else s( dim ) = 1; end\n y = cvx( s, sparse( 1, prod( s ) ) );\n\nelse\n\n p = prod( s( 1 : dim - 1 ) );\n cc = 0 : prod( s ) - 1;\n cl = rem( cc, p );\n cr = floor( cc / ( p * s( dim ) ) );\n cc = cl + cr * p + 1;\n s( dim ) = 1;\n b = x.basis_;\n [ r, c, v ] = find( b );\n b = sparse( r, cc( c ), v, size( b, 1 ), prod( s ) );\n y = cvx( s, b );\n v = cvx_vexity( y );\n if any( isnan( v( : ) ) ),\n error( 'Disciplined convex programming error:\\n Illegal addition encountered (e.g., {convex} + {concave}).', 1 ); %#ok\n end\n\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/times.m", "content": "function z = times( x, y, oper )\n\n% Disciplined convex programming information for TIMES:\n% In general, disciplined convex programs must obey the \"no-product\n% rule\" which states that two non-constant expressions cannot be \n% multiplied together. Under this rule, the following combinations\n% are allowed:\n% {constant} .* {non-constant} {non-constant} .* {constant}\n% Furthermore, if the non-constant expression is nonlinear, then \n% the constant term must be real.\n% \n% A lone exception to the no-product rule is made for quadratic \n% forms: two affine expressions may be multiplied together if the \n% result is convex or concave. For example, the construction\n% variable x(n)\n% x.*x <= 1;\n% would be permitted because each element of x.*x is convex.\n% \n% Disciplined geometric programming information for TIMES:\n% Both terms in a multiplication must have the same log-curvature, \n% so the following products are permitted:\n% {log-convex} .* {log-convex} {log-concave} .* {log-concave}\n% {log-affine} .* {log-affine}\n% Note that log-affine expressions are both log-convex and\n% log-concave.\n% \n% For vectors, matrices, and arrays, these rules are verified \n% indepdently for each element.\n\nnarginchk(2,3);\nif nargin < 3, oper = '.*'; end\n\n%\n% Check sizes\n%\n\nsx = size( x );\nsy = size( y );\nxs = all( sx == 1 );\nys = all( sy == 1 );\nif xs,\n sz = sy;\nelseif ys,\n sz = sx;\nelseif ~isequal( sx, sy ),\n error( 'Matrix dimensions must agree.' );\nelse\n sz = sx;\nend\nnn = prod( sz );\nif nn == 0,\n z = zeros( sz );\n return\nend\n\n%\n% Determine the computation methods\n%\n\npersistent remap_m remap_l remap_r\nif isempty( remap_r ),\n % zero .* valid, valid .* zero, constant .* constant\n temp_1 = cvx_remap( 'constant' );\n temp_2 = cvx_remap( 'zero' );\n temp_3 = temp_2' * cvx_remap( 'valid' );\n remap_1 = ( temp_1' * temp_1 ) | temp_3 | temp_3';\n remap_1n = ~remap_1;\n % constant / nonzero, zero / log-concave, zero / log-convex\n temp_4 = temp_1 & ~temp_2;\n remap_1r = ( temp_1' * temp_4 ) | ( temp_2' * cvx_remap( 'log-valid' ) );\n remap_1rn = ~remap_1r;\n\n % constant * affine, real * convex/concave/log-convex, positive * log-concave\n temp_5 = cvx_remap( 'real' );\n temp_6 = cvx_remap( 'positive' );\n temp_7 = cvx_remap( 'affine' );\n temp_1n = ~temp_1;\n temp_8 = cvx_remap( 'log-concave' ) & temp_1n;\n remap_2 = ( temp_1' * temp_7 ) | ...\n ( temp_5' * cvx_remap( 'convex', 'concave', 'log-convex' ) ) | ...\n ( temp_6' * temp_8 );\n remap_2 = remap_2 & remap_1n;\n % real / log-concave, positive / log-convex\n temp_9 = cvx_remap( 'log-convex' ) & temp_1n;\n remap_2r = ( temp_5' * temp_8 ) | ...\n ( temp_6' * temp_9 );\n remap_2r = remap_2r & remap_1rn;\n \n % Affine * constant, convex/concave/log-convex * real, log-concave * positive\n remap_3 = remap_2';\n % Affine / nonzero, convex/concave/log-convex / nzreal, log-concave / positive\n remap_3r = remap_3;\n remap_3r(:,2) = 0;\n \n % Affine * affine\n remap_4 = temp_7 & ~temp_1;\n remap_4 = remap_4' * +remap_4;\n\n % log-concave * log-concave, log-convex * log-convex\n remap_5 = ( temp_8' * +temp_8 ) | ( temp_9' * +temp_9 );\n % log-concave / log-convex, log-convex / log-concave\n remap_5r = temp_8' * +temp_9;\n remap_5r = remap_5r | remap_5r';\n \n remap_m = remap_1 + 2 * remap_2 + 3 * remap_3 + 4 * remap_4 + 5 * remap_5;\n remap_r = remap_1r + 2 * remap_2r + 3 * remap_3r + 5 * remap_5r;\n remap_r(:,2) = 0;\n remap_l = remap_r';\nend\nswitch oper,\n case '.*',\n remap = remap_m;\n r_recip = 0;\n l_recip = 0;\n case './',\n remap = remap_r;\n r_recip = 1;\n l_recip = 0;\n case '.\\',\n remap = remap_l;\n r_recip = 0;\n l_recip = 1;\nend\nvx = cvx_classify( x );\nvy = cvx_classify( y );\nvr = remap( vx + size( remap, 1 ) * ( vy - 1 ) );\nvu = sort( vr(:) );\nvu = vu([true;diff(vu)~=0]);\nnv = length( vu );\nif vu(1) == 1 && nv > 1,\n vr(vr==1) = vu(2); \n nv = nv - 1;\n vu(1) = [];\nend\n\n%\n% Process each computation type separately\n%\n\nx = cvx( x );\ny = cvx( y );\nxt = x;\nyt = y;\nif nv ~= 1,\n z = cvx( sz, [] );\nend\nfor k = 1 : nv,\n\n %\n % Select the category of expression to compute\n %\n\n if nv ~= 1,\n t = vr == vu( k );\n if ~xs,\n xt = cvx_subsref( x, t );\n sz = size( xt );\n end\n if ~ys,\n yt = cvx_subsref( y, t );\n sz = size( yt );\n end\n end\n\n %\n % Apply the appropriate computation\n %\n\n switch vu( k ),\n case 0,\n\n % Invalid\n error( 'Disciplined convex programming error:\\n Cannot perform the operation: {%s} %s {%s}', cvx_class( xt, true, true, true ), oper, cvx_class( yt, true, true, true ) );\n \n case 1,\n \n % constant .* constant\n xb = cvx_constant( xt );\n yb = cvx_constant( yt );\n if l_recip,\n cvx_optval = xb .\\ yb;\n elseif r_recip,\n cvx_optval = xb ./ yb;\n else\n cvx_optval = xb .* yb;\n end\n if nnz( isnan( cvx_optval ) ),\n error( 'Disciplined convex programming error:\\n This expression produced one or more invalid numeric values (NaNs).', 1 ); %#ok\n end\n cvx_optval = cvx( cvx_optval );\n\n case 2,\n\n % constant .* something\n xb = cvx_constant( xt );\n if l_recip, xb = 1.0 ./ xb; end\n yb = yt;\n if r_recip && nnz( xb ), yb = exp( - log( yb ) ); end\n yb = yb.basis_;\n if ~xs,\n nn = numel( xb );\n if ys,\n xb = cvx_reshape( xb, [ 1, nn ] );\n if issparse( yb ) && ~issparse( xb ), \n xb = sparse( xb ); \n end\n else\n n1 = 1 : nn;\n xb = sparse( n1, n1, xb( : ), nn, nn );\n end\n end\n cvx_optval = cvx( sz, yb * xb );\n\n case 3,\n\n % something .* constant\n yb = cvx_constant( yt );\n if r_recip, yb = 1.0 ./ yb; end\n xb = xt;\n if l_recip && any( xb ), xb = exp( - log( xb ) ); end\n xb = xb.basis_;\n if ~ys,\n nn = numel( yb );\n if xs,\n yb = cvx_reshape( yb, [ 1, nn ] );\n if issparse( xb ) && ~issparse( yb ),\n yb = sparse( yb );\n end\n else\n n1 = 1 : nn;\n yb = sparse( n1, n1, yb( : ), nn, nn );\n end\n end\n cvx_optval = cvx( sz, xb * yb );\n\n case 4,\n\n % affine .* affine\n nn = prod( sz );\n xA = xt.basis_; yA = yt.basis_;\n if xs && ~ys, xA = xA( :, ones( 1, nn ) ); end\n if ys && ~xs, yA = yA( :, ones( 1, nn ) ); end\n mm = max( size( xA, 1 ), size( yA, 1 ) );\n if size( xA, 1 ) < mm, xA( mm, end ) = 0; end\n if size( yA, 1 ) < mm, yA( mm, end ) = 0; end\n xB = xA( 1, : ); xA( 1, : ) = 0;\n yB = yA( 1, : ); yA( 1, : ) = 0;\n cyA = conj( yA );\n alpha = sum( real( xA .* yA ), 1 ) ./ max( sum( cyA .* yA, 1 ), realmin );\n adiag = sparse( 1 : nn, 1 : nn, alpha, nn, nn );\n if all( sum( abs( xA - cyA * adiag ), 2 ) <= 2 * eps * sum( abs( xA ), 2 ) ),\n beta = xB - alpha .* conj( yB );\n alpha = reshape( alpha, sz );\n if isreal( y ),\n cvx_optval = alpha .* square( y ) + reshape( beta, sz ) .* y;\n elseif all( abs( beta ) <= 2 * eps * abs( xB ) ),\n cvx_optval = alpha .* square_abs( y );\n else\n error( 'Disciplined convex programming error:\\n Invalid quadratic form(s): product is not real.\\n', 1 ); %#ok\n end\n else\n error( 'Disciplined convex programming error:\\n Invalid quadratic form(s): not a square.\\n', 1 ); %#ok\n end\n\n case 5,\n\n % posynomial .* posynomial\n xb = log( xt );\n if l_recip, xb = - xb; end\n yb = log( yt );\n if r_recip, yb = - yb; end\n cvx_optval = exp( xb + yb );\n\n otherwise,\n\n error( 'Shouldn''t be here.' );\n\n end\n\n %\n % Store the results\n %\n\n if nv == 1,\n z = cvx_optval;\n else\n z = cvx_subsasgn( z, t, cvx_optval );\n end\n\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/toeplitz.m", "content": "function t = toeplitz( c, r )\n\n% Disciplined convex/geometric programming information for TOEPLITZ:\n% TOEPLITZ imposes no convexity restrictions on its arguments. \n% Instead of using the TOEPLITZ function, however, consider \n% creating a matrix variable using the 'toeplitz' keyword; e.g.\n% variable X(5,5) toeplitz;\n\n%\n% Check arguments\n%\n\nnarginchk(1,2);\nif nargin < 2,\n c = vec( c );\n m = length( c );\n p = m;\n x = [ cvx_subsref( c, p : -1 : 1 ) ; conj( cvx_subsref( c, 2 : p ) ) ];\nelse\n temp = cvx_subsref( r, 1 ) - cvx_subsref( c, 1 );\n if ~cvx_isconstant( temp ) || cvx_constant( temp ) ~= 0,\n warning('MATLAB:toeplitz:DiagonalConflict',['First element of ' ...\n 'input column does not match first element of input row. ' ...\n '\\n Column wins diagonal conflict.'])\n end\n r = vec( r );\n c = vec( c );\n p = length( r );\n m = length( c );\n x = [ cvx_subsref( r, p : -1 : 2 ) ; c ];\nend\n\n%\n% Construct matrix\n%\n\ncidx = ( 0 : m - 1 )';\nridx = p : -1 : 1;\nt = cidx( :, ones( p, 1 ) ) + ridx( ones( m, 1 ) , : );\nt = reshape( cvx_subsref( x, t ), size( t ) );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/transpose.m", "content": "function y = transpose( x )\n\n% Disciplined convex/geometric programming information for TRANSPOSE:\n% The transpose operation may be applied to CVX variables without\n% restriction.\n\n%\n% Determine permutation\n%\n\ns = x.size_;\nif length( s ) > 2,\n error( 'Transpose of an ND array is not defined.' );\nend\n\n%\n% Permute the data\n%\n\nndxs = 1 : prod( s );\nndx2 = reshape( ndxs, s ).';\nb = x.basis_;\ntry\n b = b( :, ndx2 );\ncatch %#ok\n ndxs( ndx2( : ).' ) = ndxs;\n [ r, c, v ] = find( b );\n b = sparse( r, ndxs( c ), v, size( b, 1 ), size( b, 2 ) );\n clear r c v\nend\ny = cvx( size( ndx2 ), b );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/tril.m", "content": "function x = tril( x, k )\n\n% Disciplined convex/geometric programming information for TRIL:\n% TRIL imposes no convexity restrictions on its arguments.\n\n%\n% Check inputs\n%\n\nif nargin < 2, k = 0; end\ns = x.size_;\nif length( s ) > 2,\n error( 'The first argument must be 2-D.' );\nelseif ~isnumeric( k ) || length( k ) ~= 1,\n error( 'The second argument must be an integer scalar.' );\nend\n\n%\n% Zero out the elements outside of the desired triangle\n%\n\nb = x.basis_;\nb( :, ~tril(ones(s),k) ) = 0;\nx = cvx( s, b );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/triu.m", "content": "function x = triu( x, k )\n\n% Disciplined convex/geometric programming information for TRIU:\n% TRIU imposes no convexity restrictions on its arguments.\n\n%\n% Check inputs\n%\n\nif nargin < 2, k = 0; end\ns = x.size_;\nif length( s ) > 2,\n error( 'The first argument must be 2-D.' );\nelseif ~isnumeric( k ) || length( k ) ~= 1,\n error( 'The second argument must be an integer scalar.' );\nend\n\n%\n% Zero out the elements outside of the desired triangle\n%\n\nb = x.basis_;\nb( :, ~triu(ones(s),k) ) = 0;\nx = cvx( s, b );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/uminus.m", "content": "function z = uminus( x )\n\n% Disciplined convex programming information for UMINUS (-):\n% Unary minus may be used in DCPs without restrictions---with the\n% understanding, of course, that it produces a result with the \n% opposite cuvature to its argument; i.e., the negative of a convex\n% expression is concave, and vice versa.\n%\n% Disciplined geometric programming information for UMINUS(-):\n% Negation of non-constant values may not be used in disciplined\n% geometric programs.\n\npersistent remap\nif isempty( remap ),\n remap = cvx_remap( 'invalid', 'log-concave' ) & ~cvx_remap( 'log-affine' );\nend\ntt = remap( cvx_classify( x ) );\nif nnz( tt ),\n xt = cvx_subsref( x, tt );\n error( 'Disciplined convex programming error:\\n Illegal operation: - {%s}', cvx_class( xt ) );\nend\n\nz = cvx( x.size_, -x.basis_ );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/uplus.m", "content": "function z = uplus( x )\n\n% Disciplined convex/geometric programming information for UPLUS (+):\n% Unary plus may be used in DCPs and DGPs without restrictions.\n\nz = x;\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/var.m", "content": "function y = var( varargin )\n\n%STD Internal cvx version.\n\ny = square_pos( std( varargin{:} ) );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvx/vertcat.m", "content": "function y = vertcat( varargin )\n\n% Disciplined convex/geometric programming information for VERTCAT:\n% VERTCAT imposes no convexity restrictions on its arguments.\n\ny = cat( 1, varargin{:} );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvxcnst/eq.m", "content": "function a = eq( x, y )\n\n%Disciplined convex programming information for EQ (==):\n% Both the left- and right-hand sides of an equality constraint must\n% be affine (or constant). If either side of the constraint is complex,\n% then the real and imaginary portions are constrained separately.\n%\n%Disciplined geometric programming information for EQ (>):\n% Both the left- and right-hand sides of an equality constraint must\n% be log-affine, which includes positive constants and monomials.\n\nb = newcnstr( evalin( 'caller', 'cvx_problem', '[]' ), x, y, '==' );\nif nargout, a = b; end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvxcnst/ge.m", "content": "function a = ge( x, y )\n\n%Disciplined convex programming information for GE (>=):\n% The right-hand side of a less-than constraint must be convex. The\n% left-hand side must be concave. Of course, real constant and affine\n% expressions are both convex and concave and can be used on either\n% side as well.\n%\n%Disciplined geometric programming information for GE (>=):\n% The right-hand side of a less-than constraint must be log-convex---\n% including positive constants, monomials, posynomials, generalized\n% posynomials, and products thereof. The left-hand side must be log-\n% concave---including positive constants, monomials, reciprocals of\n% log-convex expressions, and products thereof.\n%\n%Note that CVX does not distinguish between strict greater-than (>) and\n%greater-than-or-equal (<=) constraints; they are treated identically. \n%Feasible interior-point solvers tend to return points which satisfy\n%strict inequality, but not all solvers do.\n\nb = newcnstr( evalin( 'caller', 'cvx_problem', '[]' ), x, y, '>=' );\nif nargout, a = b; end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvxcnst/gt.m", "content": "function a = gt( x, y )\n\n%Disciplined convex programming information for GT (>):\n% The right-hand side of a less-than constraint must be convex. The\n% left-hand side must be concave. Of course, real constant and affine\n% expressions are both convex and concave and can be used on either\n% side as well.\n%\n%Disciplined geometric programming information for GT (>):\n% The right-hand side of a less-than constraint must be log-convex---\n% including positive constants, monomials, posynomials, generalized\n% posynomials, and products thereof. The left-hand side must be log-\n% concave---including positive constants, monomials, reciprocals of\n% log-convex expressions, and products thereof.\n%\n%Note that CVX does not distinguish between strict greater-than (>) and\n%greater-than-or-equal (<=) constraints; they are treated identically. \n%Feasible interior-point solvers tend to return points which satisfy\n%strict inequality, but not all solvers do.\n\nb = newcnstr( evalin( 'caller', 'cvx_problem', '[]' ), x, y, '>' );\nif nargout, a = b; end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvxcnst/le.m", "content": "function a = le( x, y )\n\n% Disciplined convex programming information for LE (<=):\n% The left-hand side of a less-than constraint must be convex. The\n% right-hand side must be concave. Of course, real constant and \n% affine expressions are both convex and concave and can be used on\n% either side as well.\n% \n% Disciplined geometric programming information for LE (<=):\n% The left-hand side of a less-than constraint must be log-convex,\n% including positive constants, monomials, posynomials, generalized\n% posynomials, and products thereof. The right-hand side must be \n% log-concave---including positive constants, monomials, \n% reciprocals of log-convex expressions, and products thereof.\n% \n% Note that CVX does not distinguish between strict less-than (<) and\n% less-than-or-equal (<=) constraints; they are treated identically. \n% Feasible interior-point solvers tend to return points which satisfy\n% strict inequality, but not all solvers do.\n\nb = newcnstr( evalin( 'caller', 'cvx_problem', '[]' ), x, y, '<=' );\nif nargout, a = b; end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvxcnst/lt.m", "content": "function a = lt( x, y )\n\n% Disciplined convex programming information for LT (<):\n% The left-hand side of a less-than constraint must be convex. The\n% right-hand side must be concave. Of course, real constant and \n% affine expressions are both convex and concave and can be used on\n% either side as well.\n% \n% Disciplined geometric programming information for LT (<):\n% The left-hand side of a less-than constraint must be log-convex,\n% including positive constants, monomials, posynomials, generalized\n% posynomials, and products thereof. The right-hand side must be \n% log-concave---including positive constants, monomials, \n% reciprocals of log-convex expressions, and products thereof.\n% \n% Note that CVX does not distinguish between strict less-than (<) and\n% less-than-or-equal (<=) constraints; they are treated identically. \n% Feasible interior-point solvers tend to return points which satisfy\n% strict inequality, but not all solvers do.\n\nb = newcnstr( evalin( 'caller', 'cvx_problem', '[]' ), x, y, '<' );\nif nargout, a = b; end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/@cvxcnst/ne.m", "content": "function a = ne( x, y )\n\n% Disciplined convex/geometric programming information for NE (~=):\n% Not-equal constraints violate both the DCP and DGP rulesets. Thus\n% not-equal expressions may only appear in CVX models when both \n% sides are constant.\n\nb = newcnstr( evalin( 'caller', 'cvx_problem', '[]' ), x, y, '~=' );\nif nargout, a = b; end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/builtins/Contents.m", "content": "% CVX: Built-in operators and functions supported in CVX models.\n% \n% The following operators and functions are included with MATLAB but\n% have either been verified to work properly within CVX models or have\n% been extended with additional code to do so. In many cases, typing\n% help cvx/\n% where is one of the names listed below will provide specific\n% help on the proper use of that item in CVX models---including any\n% restrictions imposed by the DCP and DGP rulesets.\n%\n% For a list of new functions created specifically for CVX, type\n% \"help cvx/functions\".\n%\n% The exponential and logarithm functions, along with the starred \n% functions listed in \"help cvx/functions\", are supported using a\n% \"successive approximation\" approach: the solver must be called \n% multiple times to achieve the required accuracy. Thus models using\n% these functions should be expected to run more slowly than models\n% of comparable size that do not. See the CVX user guide for details.\n%\n% Computational operators:\n% plus (+), uplus (unary +), minus (-), uminus (unary -), times (.*),\n% mtimes (*), ldivide (.\\), mldivide (\\), rdivide (./), mrdivide (/), \n% power (.^), mpower (^), subsref/subsasgn/end (subscripting),\n% transpose (.'), ctranspose (')\n% Relational operators:\n% eq (==), ge (>=), gt (>), le (<=), lt(<), ne (~=).\n% Linear/affine functions:\n% blkdiag, cat, conj, conv, cumsum, diag, dot, find, flipdim, fliplr, \n% flipud, hankel, horzcat, imag, ipermute, kron, permute, polyval, real,\n% repmat, reshape, rot90, sparse, sum, toeplitz, tril, triu, vertcat\n% Nonlinear functions:\n% abs, exp(*), log (*), max, min, norm, prod, sqrt\n% Query functions:\n% disp/display, end, isempty, isequal, length, isreal, ndims, nnz,\n% numel, size, spy\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/commands/@cvx/commands.m", "content": "% CVX: Top-level commands to control CVX.\n% cvx_begin - Starts a new CVX specification.\n% cvx_begin_set - Starts a new cvx CVX specification.\n% cvx_cd - Change current working directory to a CVX subdirectory. \n% cvx_clear - Clears all active CVX data.\n% cvx_end - Completes a cvx specification.\n% cvx_end_set - Completes a cvx set specification.\n% cvx_gp_precision - Changes the precision of CVX's GP approximation.\n% cvx_pause - Pauses the processing of CVX models.\n% cvx_power_warning - Controls the CVX warning message for x.^p expressions.\n% cvx_precision - Controls CVX solver precision.\n% cvx_profile - CVX-specific profiler control.\n% cvx_quiet - CVX output control.\n% cvx_solver - CVX solver selection.\n% cvx_where - Returns the location of the CVX system.\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/commands/Contents.m", "content": "% CVX: Top-level commands to control CVX.\n%\n% cvx_begin - Starts a new CVX specification.\n% cvx_clear - Clears all active CVX data.\n% cvx_end - Completes a cvx specification.\n% cvx_pause - Pauses the processing of CVX models.\n% cvx_power_warning - Controls the CVX warning message for x.^p expressions.\n% cvx_precision - Controls CVX solver precision.\n% cvx_profile - CVX-specific profiler control.\n% cvx_quiet - CVX output control.\n% cvx_solver - CVX solver selection.\n% cvx_where - Returns the location of the CVX system.\n% cvx_expert - CVX expert mode.\n% cvx_save_prefs - Saves current CVX settings for future MATLAB sessions.\n% cvx_solver_settings - CVX solver settings adjustment.\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/commands/cvx_begin.m", "content": "function cvx_begin( varargin )\n\n%CVX_BEGIN Starts a new CVX specification.\n% CVX_BEGIN marks the beginning of a new CVX model. Following this command\n% may be variable declarations, objective functions, and constraints, and\n% a CVX_END to mark the completion of the model.\n%\n% If another model has already been created and is still in progress, then\n% CVX_BEGIN will issue a warning and clear the previous model.\n%\n% CVX_BEGIN SDP marks the beginning of a semidefinite programming (SDP) model.\n% This command alters the interpretation of inequality constraints when used\n% with matrices, so that SDPs are easier to construct. Specifically, \n% constraints of the form\n% X >= Y X > Y Y < X Y <= X\n% where X and Y are matrices (i.e., not vectors or scalars), CVX will\n% interpret them all as LMIs, and convert them to\n% X - Y == semidefinite(size(X,1));\n% X and Y _must_ be square and identically sized---with one exception: \n% X or Y may also be the scalar number zero, so that expressions such as\n% X >= 0 have the expected meaning.\n%\n% CVX_BEGIN GP marks the beginning of a geometric programming (GP) model. This\n% command alters the definition of the VARIABLE keyword to create geometric\n% variables by default GP and SDP cannot be supplied simultaneously.\n%\n% CVX_BEGIN SET can be used to mark the beginning of a set definition---a cvx\n% feasibility problem intended to describe a set for use in other models. See\n% the files in the cvx subdirectory sets/ for examples. The SET keyword can be\n% combined with SDP or GP to specify sets which use SDP or GP conventions;\n% for example, CVX_BEGIN SET SDP\n%\n% CVX_BEGIN SEPARABLE gives permission for CVX to solve a multiobjective\n% problem simply by taking the sum of the objectives and solving the resulting\n% single-objective problem. As the name implies, this produces equivalent \n% results only when the subproblems are separable. Behavior is undefined when\n% one or more of the subproblems is infeasible or unbounded. The keyword is\n% ignored for sets and incomplete specifications.\n\nif ~iscellstr( varargin ), error( 'Arguments must be strings.' ); end\nassignin( 'caller', 'cvx_problem', cvxprob( varargin{:} ) );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/commands/cvx_clear.m", "content": "% CVX_CLEAR Clears all active CVX data.\n% CVX_CLEAR clears the current CVX model in progress. This is useful if, for\n% example, you have made an error typing in your model and wish to start \n% over. Typing this before entering another CVX_BEGIN again avoids the \n% warning message that occurs if CVX_BEGIN detects a model in progress.\n\nprob = evalin( 'caller', 'cvx_problem', '[]' );\nif isa( prob, 'cvxprob' ),\n\tevalin( 'caller', 'pop( cvx_problem, ''clear'' )' );\nend\n% cvx_clearpath( 1 );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/commands/cvx_end.m", "content": "function cvx_end\n\n%CVX_END Completes a cvx specification.\n% CVX_BEGIN marks the end of a new cvx model, and instructs cvx to\n% complete its processing. For standard, complete models, cvx will send\n% a transformed version of the problem to a solver to obtain numeric\n% results, and replace references to cvx variables with numeric values.\n\nglobal cvx___\ntstart = tic;\nprob = evalin( 'caller', 'cvx_problem', '[]' );\nif ~isa( prob, 'cvxprob' ),\n error( 'No CVX model exists in this scope.' );\nelseif isempty( cvx___.problems ) || cvx___.problems( end ).self ~= prob,\n error( 'Internal CVX data corruption. Please CLEAR ALL and rebuild your model.' );\nend\npstr = cvx___.problems( end );\nestruc = [];\n\nif isempty( pstr.objective ) && isempty( pstr.variables ) && isempty( pstr.duals ) && nnz( pstr.t_variable ) == 1,\n\n warning( 'CVX:EmptyModel', 'Empty cvx model; no action taken.' );\n evalin( 'caller', 'pop( cvx_problem, ''none'' )' );\n\nelseif pstr.complete && nnz( pstr.t_variable ) == 1,\n\n %\n % Check the integrity of the variables\n %\n\n if isempty( pstr.variables ),\n fn1 = cell( 0, 1 );\n vv1 = fn1;\n else\n fn1 = fieldnames( pstr.variables );\n ndxs = horzcat( fn1{:} );\n ndxs = ndxs( cumsum( cellfun( 'length', fn1 ) ) ) ~= '_';\n fn1 = fn1( ndxs );\n vv1 = struct2cell( pstr.variables );\n vv1 = vv1(ndxs);\n end\n if isempty( pstr.duals ),\n fn2 = cell( 0, 1 );\n vv2 = fn2;\n else\n fn2 = fieldnames( pstr.duals );\n ndxs = horzcat( fn2{:} );\n ndxs = ndxs( cumsum( cellfun( 'length', fn2 ) ) ) ~= '_';\n fn2 = fn2( ndxs );\n vv2 = struct2cell( pstr.dvars );\n vv2 = vv2( ndxs );\n end\n fn1 = [ fn1 ; fn2 ];\n i1 = cvx_ids( vv1{:}, vv2{:} );\n i2 = sprintf( '%s,', fn1{:} );\n try\n i2 = evalin( 'caller', sprintf( 'cvx_ids( %s )', i2(1:end-1) ) );\n catch\n i2 = zeros(1,numel(fn1));\n for k = 1 : length(fn1),\n try\n i2(k) = evalin( 'caller', sprintf( 'cvx_ids( %s )', fn1{k} ) );\n catch\n end\n end\n end\n if any( i1 ~= i2 ),\n evalin( 'caller', 'cvx_clear' );\n temp = sprintf( ' %s', fn1{ i1 ~= i2 } );\n error( 'The following cvx variable(s) have been cleared or overwritten:\\n %s\\nThis is often an indication that an equality constraint was\\nwritten with one equals ''='' instead of two ''==''. The model\\nmust be rewritten before cvx can proceed.', temp ); %#ok\n end\n\n %\n % Pause\n %\n\n if cvx___.pause,\n disp( ' ' );\n input( 'Press Enter/Return to call the solver:' );\n disp( ' ' );\n end\n\n %\n % Compress and solve\n %\n\n try\n solve( prob );\n catch estruc\n end\n pstr = cvx___.problems( end );\n\n %\n % Pause again!\n %\n\n if cvx___.pause && ~cvx___.quiet,\n disp( ' ' );\n input( 'Press Enter/Return to continue:' );\n disp( ' ' );\n end\n\n %\n % Copy the variable data to the workspace\n %\n\n if numel( pstr.objective ) > 1 && ~isempty(pstr.result),\n if strfind( pstr.status, 'Solved' ),\n pstr.result = value( pstr.objective );\n if pstr.geometric, pstr.result = exp( pstr.result ); end\n else\n pstr.result = pstr.result * ones(size(pstr.objective));\n end\n end\n % Removed these for simplicity. cvx_optdpt in particular was buggy,\n % and I can't support it. In fact they are for internal use anyway.\n % assignin( 'caller', 'cvx_optpnt', pstr.variables );\n % assignin( 'caller', 'cvx_optdpt', pstr.duals );\n assignin( 'caller', 'cvx_status', pstr.status );\n assignin( 'caller', 'cvx_optval', pstr.result );\n assignin( 'caller', 'cvx_optbnd', pstr.bound );\n assignin( 'caller', 'cvx_slvitr', pstr.iters );\n assignin( 'caller', 'cvx_slvtol', pstr.tol );\n assignin( 'caller', 'cvx_cputime', cputime - pstr.cputime );\n \n %\n % Compute the numerical values and clear out\n %\n\n evalin( 'caller', 'pop( cvx_problem, ''value'' )' );\n\nelse\n\n %\n % Determine the parent problem\n %\n\n p = length( cvx___.problems );\n if p < 2,\n error( 'Internal cvx data corruption.' );\n end\n np = p - 1;\n\n %\n % Move the variable structure into the parent\n %\n\n vars = cvx_collapse( pstr.variables, true, false );\n dvars = cvx_collapse( pstr.duals, true, false );\n if ~isempty( vars ) || ~isempty( dvars ),\n pname = [ pstr.name, '_' ];\n if ~isempty( vars ),\n try\n ovars = cvx___.problems(np).variables.(pname);\n catch\n ovars = {};\n end\n ovars{end+1} = vars;\n cvx___.problems(np).variables.(pname) = ovars;\n end\n if ~isempty( dvars ),\n try\n ovars = cvx___.problems(np).duals.(name);\n catch\n ovars = {};\n end\n ovars{end+1} = dvars;\n cvx___.problems(np).duals.(pname) = ovars;\n end\n end\n\n %\n % Merge the touch information\n %\n\n v = cvx___.problems( np ).t_variable;\n v = v | pstr.t_variable( 1 : size( v, 1 ), : );\n cvx___.problems( np ).t_variable = v;\n\n %\n % Process the objective and optimal point, converting to pure\n % epigraph/hypograph form if necessary\n %\n\n assignin( 'caller', 'cvx_optpnt', cvxtuple( cvx_collapse( vars, false, false ) ) );\n assignin( 'caller', 'cvx_optdpt', cvxtuple( cvx_collapse( dvars, false, false ) ) );\n x = pstr.objective;\n if isempty( x ),\n\n assignin( 'caller', 'cvx_optval', 0 );\n temp = length( pstr.t_variable ) + 1 : length( cvx___.readonly );\n cvx___.readonly( temp ) = cvx___.readonly( temp ) - 1;\n\n else\n\n switch pstr.direction,\n case 'minimize',\n force = false;\n os = +1;\n case 'epigraph',\n force = true;\n os = +1;\n case 'maximize',\n force = false;\n os = -1;\n case 'hypograph',\n force = true;\n os = -1;\n end\n \n if ~force,\n x = sparsify( x, 'objective' );\n end\n xB = cvx_basis( x );\n [ r, c ] = find( xB ); %#ok\n t = r ~= 1; r = r( t );\n cvx___.canslack( r ) = true;\n\n %\n % Set the vexity flags\n %\n\n cvx___.vexity( r, : ) = os;\n cvx___.readonly( r, : ) = np;\n \n %\n % Convert to geometric form if necessary\n %\n\n tt = pstr.geometric;\n if any( tt ),\n if all( tt ),\n x = exp( x );\n else\n x( tt ) = exp( x( tt ) );\n end\n end\n\n assignin( 'caller', 'cvx_optval', x );\n end\n\n %\n % Set the status and clear the problem from internal storage\n %\n\n evalin( 'caller', 'pop( cvx_problem, ''none'' )' );\n\nend\n\nif isempty( cvx___.problems ),\n tfin = tic;\n ptic = pstr.tictime;\n timers = cvx___.timers;\n if isa( timers, 'double' ),\n tfin = double(tfin);\n ptic = double(ptic);\n tstart = double(tstart);\n end\n timers(2) = timers(2) + ( tfin - ptic );\n timers(3) = timers(3) + ( tfin - tstart );\n cvx___.timers = timers;\n profile off;\nend\n\nif ~isempty( estruc ),\n if strncmp( estruc.identifier, 'CVX:', 4 ),\n error( estruc.identifier, estruc.message );\n else\n rethrow( estruc );\n end\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/commands/cvx_expert.m", "content": "function cvx_expert( flag )\n\n%CVX_EXPERT CVX expert mode.\n% CVX_EXPERT(TRUE) enables certain feature of CVX that have not yet been\n% announced to the general audience due to insufficient testing.\n% Specifically, CVX_EXPERT(TRUE) enables the use of successive\n% approximation methods to handle exponentials, logarithms, and entropy,\n% and changes CVX to solve geometric programs using the same method.\n%\n% CVX_EXPERT(FALSE) disables expert mode.\n%\n% On exit, CVX_EXPERT(TF) returns the *previous* value of the expert flag,\n% so that it can be flag, so it can be saved and restored later.\n%\n% CVX_EXPERT, with no arguments, returns the current flag value.\n\nglobal cvx___\ncvx_global\nnarginchk(1,1);\nif nargin == 1,\n if isnumeric(flag) || islogical(flag),\n ns = double(flag) ~= 0;\n elseif ischar(flag) && size(flag,1) == 1,\n switch lower(flag),\n case 'true',\n ns = true;\n case 'false',\n ns = false;\n otherwise,\n error( 'String arugment must be ''true'' or ''false''.' );\n end\n else\n error( 'Argument must be a numeric scalar or a string.' );\n end\nend\ncvx___.expert = ns;\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/commands/cvx_pause.m", "content": "function sout = cvx_pause( flag )\n\n%CVX_PAUSE Pauses the processing of CVX models.\n% CVX_PAUSE(TRUE) instructs CVX to pause and wait for user keypress before\n% and after proceeding with the numerical solution of a model. The pauses\n% occur within the CVX_END. This is useful for demo purposes.\n%\n% CVX_PAUSE(FALSE) ends the pausing behavior.\n\nglobal cvx___\ncvx_global\ns = cvx___.pause;\nif nargin == 1,\n if isnumeric(flag) || islogical(flag),\n ns = double(flag) ~= 0;\n elseif ischar(flag) && size(flag,1) == 1,\n switch lower(flag),\n case 'true',\n ns = true;\n case 'false',\n ns = false;\n otherwise,\n error( 'String arugment must be ''true'' or ''false''.' );\n end\n else\n error( 'Argument must be a numeric scalar or a string.' );\n end\n cvx___.pause = ns;\nend\nif nargin == 0 || nargout > 0,\n sout = s;\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/commands/cvx_power_warning.m", "content": "function sout = cvx_power_warning( flag )\r\n\r\n%CVX_POWER_WARNING Controls the CVX warning message for x.^p expressions.\r\n% CVX converts power functions like x.^p, for variable x and fixed p, into\r\n% solvable form using an SOCP transformation. For quadratics x.^2 and square\r\n% roots x.^(1/2), a single second-order cone is required; for other powers,\r\n% the number depends on the rational representation of the exponent p.\r\n%\r\n% CVX_POWER_WARNING(Q) instructs CVX to issue a warning if the resulting\r\n% transformations requires more than Q second-order cones. The default value\r\n% is 10, which is not likely to be exceeded for typical choices of P.\r\n\r\nglobal cvx___\r\ncvx_global\r\nif nargin > 0,\r\n if isempty( flag ),\r\n ns = 10;\r\n elseif ~isnumeric( flag ) || ~isreal( flag ) || numel( flag ) > 1 || flag <= 0 || flag ~= floor( flag ),\r\n error( 'Argument must be a positive integer.' );\r\n else\r\n ns = flag;\r\n end\r\nend\r\nif isempty( cvx___.problems ),\r\n s = cvx___.rat_growth;\r\n if nargin > 0,\r\n cvx___.rat_growth = ns;\r\n end\r\nelse\r\n s = cvx___.problems(end).rat_growth;\r\n if nargin > 0,\r\n if ~isequal( s, ns ) && isa( evalin( 'caller', 'cvx_problem', '[]' ), 'cvxprob' ),\r\n warning( 'CVX:PowerWarning', 'The global CVX x.^p warning setting cannot be changed while a model is being constructed.' );\r\n else\r\n cvx___.problems(end).rat_growth = ns;\r\n end\r\n end\r\nend\r\nif nargin == 0 || nargout > 0,\r\n sout = s;\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/commands/cvx_precision.m", "content": "function sout = cvx_precision( flag )\r\n\r\n%CVX_PRECISION Controls CVX solver precision.\r\n% The CVX_PRECISION command controls the precision-related stopping criteria\r\n% for the numerical solver. Up to 3 precision levels can be specified:\r\n% 0 <= PBEST <= PHIGH <= PLOW << 1.\r\n% --- PBEST: the solver's target precision. The solver is instructed\r\n% to iterate until it achieves this precision OR until it can\r\n% make no further progress.\r\n% --- PHIGH: the 'standard' precision level. Any problem achieving\r\n% PRECISION <= PHIGH is considered accurately solved (returning\r\n% cvx_status = 'Solved').\r\n% --- PLOW: the 'minimum acceptable' precision level. Any problem\r\n% achieving PHIGH < PRECISION <= PLOW is considered inaccurately\r\n% solved (returning cvx_status = 'Inaccurate/Solved').\r\n% Problems which cannot achieve PRECISION <= PLOW are considered unsolved\r\n% (returning cvx_status = 'Failed'). These precision levels apply in\r\n% appropriate ways to infeasible and unbounded problems as well.\r\n%\r\n% CVX_PRECISION(TOL), where TOL is a positive scalar, sets\r\n% PBEST = MAX(TOL,eps^0.5), PHIGH = TOL, \r\n% PLOW = min(sqrt(TOL),max(TOL,eps^0.25)).\r\n% Note that if TOL>eps^0.25, then PLOW=PHIGH.\r\n%\r\n% CVX_PRECISION(TOL), where TOL is a nonnegative 2-vector, \r\n% PBEST = MAX(MIN(TOL),eps^0.5), PHIGH = MIN(TOL), and PLOW = MAX(TOL).\r\n%\r\n% CVX_PRECISION(TOL), where TOL is a 3-vector, sets\r\n% PBEST = MIN(TOL), PHIGH = MEDIAN(TOL), and PLOW = MAX(TOL).\r\n% MIN(TOL) may be zero, but the other two elements must be positive.\r\n% \r\n% A number of text-based options are provided for convenience:\r\n% CVX_PRECISION DEFAULT: [eps^0.5, eps^0.5, eps^0.25 ]\r\n% CVX_PRECISION HIGH : [eps^0.75, eps^0.75, eps^0.375] \r\n% CVX_PRECISION MEDIUM : [eps^0.5, eps^0.375, eps^0.25 ]\r\n% CVX_PRECISION LOW : [eps^0.5, eps^0.25, eps^0.25 ]\r\n% CVX_PRECISION BEST : [0, eps^0.5, eps^0.25 ]\r\n%\r\n% CVX_PRECISION([]) is the same as CVX_PRECISION DEFAULT.\r\n%\r\n% CVX_PRECISION BEST creates a 'best effort' mode. By setting PBSET=0,\r\n% it instructs the solver to proceed as long as it can make any useful\r\n% progress. By setting PLOW and PHIGH to their default values, it returns\r\n% exactly the same CVX_STATUS values as the DEFAULT setting. Therefore,\r\n% it yields higher precision when it can be achieved, without penalizing\r\n% models for which it cannot. Of course, higher precision comes at a cost\r\n% of increased computation time as well.\r\n%\r\n% If CVX_PRECISION(TOL) is called within a model---that is, between the\r\n% statements CVX_BEGIN and CVX_END---then the new precision applies only to\r\n% that particular model. If called outside of a model, then the change \r\n% applies to all subsequent models.\r\n%\r\n% On exit, CVX_PRECISION(TOL) returns the *previous* precision, so that it\r\n% can be saved and restored later; for example:\r\n% otol = cvx_precision(tol);\r\n% cvx_begin\r\n% ...\r\n% cvx_end\r\n% cvx_precision(otol);\r\n% Of course, this is equivalent to\r\n% cvx_begin\r\n% cvx_precision(tol);\r\n% ...\r\n% cvx_end\r\n% but the former syntax it may come in handy if you wish to solve several \r\n% models in a row with a different precision.\r\n%\r\n% CVX_PRECISION, with no arguments, returns the current precision value.\r\n\r\nglobal cvx___\r\ncvx_global\r\npersistent prefvals prefnames\r\nif isempty( prefvals ),\r\n prefvals = { ...\r\n [ eps^0.5, eps^0.5, eps^0.25 ], ...\r\n [ eps^0.75, eps^0.75, eps^0.375 ], ...\r\n [ eps^0.5, eps^0.375, eps^0.25 ], ...\r\n [ eps^0.375, eps^0.25, eps^0.25 ], ...\r\n [ 0, eps^0.5, eps^0.25 ] };\r\n prefnames = { 'default', 'high', 'medium', 'low', 'best' };\r\nend\r\nif nargin > 0,\r\n if isempty( flag ),\r\n flag = 'default';\r\n end\r\n if ischar( flag ),\r\n if size( flag, 1 ) ~= 1,\r\n error( 'Invalid precision string.' );\r\n else\r\n ndx = find( strcmpi( flag, prefnames ) );\r\n if isempty( ndx ),\r\n error( [ 'Invalid precision mode: ', flag ] );\r\n else\r\n flag = prefnames{ndx};\r\n ns = prefvals{ndx};\r\n end\r\n end\r\n else\r\n if ~isnumeric( flag ) || numel( flag ) > 3 || length(flag) ~= numel(flag),\r\n error( 'Argument must be a real number, a 2-vector, a 3-vector, or a string.' );\r\n elseif any( flag < 0 ) || any( flag >= 1 ),\r\n error( 'Each precision value must satisfy 0 <= P < 1.' );\r\n elseif numel( flag ) == 1,\r\n ns = [ max(flag,eps^0.5), flag, min(sqrt(flag),max(flag,eps^0.25)) ];\r\n elseif numel( flag ) == 2,\r\n ns = [ min(flag), min(flag), max(flag) ];\r\n elseif all( flag == 0 ),\r\n error( 'At least one precision must be positive.' );\r\n else\r\n ns = reshape( sort(flag), 1, 3 );\r\n end\r\n ndx = find(cellfun(@(x)all(x==ns),prefvals));\r\n if isempty(ndx),\r\n flag = 'custom';\r\n else\r\n flag = prefnames{ndx};\r\n end\r\n end\r\nend\r\nif isempty( cvx___.problems ),\r\n s = cvx___.precision;\r\n f = cvx___.precflag;\r\n if nargin > 0,\r\n cvx___.precision = ns;\r\n cvx___.precflag = flag;\r\n end\r\nelse\r\n s = cvx___.problems(end).precision;\r\n f = cvx___.problems(end).precflag;\r\n if nargin > 0,\r\n if ~isequal( s, ns ) && ~isa( evalin( 'caller', 'cvx_problem', '[]' ), 'cvxprob' ),\r\n warning( 'CVX:Precision', 'The global CVX precision setting cannot be changed while a model is being constructed.' );\r\n else\r\n cvx___.problems(end).precision = ns;\r\n cvx___.problems(end).precflag = flag;\r\n end\r\n end\r\nend\r\nif nargout > 0,\r\n sout = s;\r\nelseif nargin == 0,\r\n fprintf( 'Precision setting: %s\\n', f );\r\n fprintf( ' Solver goal: precision <= %.2e\\n', s(1) );\r\n fprintf( ' \"Solved\" if precision <= %.2e\\n', s(2) );\r\n fprintf( ' \"Inaccurate/Solved\" if %.2e < precision <= %.2e\\n', s(2), s(3) );\r\nend \r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/commands/cvx_profile.m", "content": "function sout = cvx_profile( flag )\r\n\r\n% CVX_PROFILE\tCVX-specific profiler control.\r\n% This is a function used for internal CVX development to help determine \r\n% performance limits within the CVX code itself, by turning off the profiler\r\n% when the solver is being called. End users will likely not find this\r\n% function to be useful.\r\n\r\nglobal cvx___\r\ncvx_global\r\ns = cvx___.profile;\r\nif nargin == 1,\r\n if isnumeric(flag) || islogical(flag),\r\n ns = double(flag) ~= 0;\r\n elseif ischar(flag) && size(flag,1) == 1,\r\n switch lower(flag),\r\n case 'true',\r\n ns = true;\r\n case 'false',\r\n ns = false;\r\n otherwise,\r\n error( 'String arugment must be ''true'' or ''false''.' );\r\n end\r\n else\r\n error( 'Argument must be a numeric scalar or a string.' );\r\n end\r\n if cvx___.profile ~= ns,\r\n cvx___.profile = ns;\r\n stat = profile('status');\r\n if ns && ~isempty( cvx___.problems ) && ~isequal( stat.ProfilerStatus, 'on' ),\r\n profile on\r\n elseif ~ns && isequal( stat.ProfilerStatus, 'on' ),\r\n profile off\r\n end\r\n end\r\nend\r\nif nargin == 0 || nargout > 0,\r\n sout = s;\r\nend\r\n \r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n \r\n\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/commands/cvx_quiet.m", "content": "function sout = cvx_quiet( flag )\n\n%CVX_QUIET CVX output control.\n% CVX_QUIET(TRUE) suppresses all text output from CVX (except for error and\n% warning messages). Specifically, solver progress is not printed.\n%\n% CVX_QUIET(FALSE) restores full text output.\n%\n% If CVX_QUIET(TF) is called within a model---that is, between the statements\n% CVX_BEGIN and CVX_END---then its effect applies only for the current model.\n% If called outside of a model, the change applies to all subsequent models.\n%\n% On exit, CVX_QUIET(TF) returns the *previous* value of the quiet flag, so \n% that it can be saved and restored later; for example:\n% oflag = cvx_quiet(true);\n% cvx_begin\n% ...\n% cvx_end\n% cvx_quiet(oflag);\n% Of course, this is equivalent to\n% cvx_begin\n% cvx_quiet(true);\n% ...\n% cvx_end\n% but the former syntax is handy if you have a script that solves several \n% models at once. In general it is good practice to make sure that the\n% CVX_QUIET flag is restored to its previous state upon exit from a script,\n% using either of these techniques.\n%\n% CVX_QUIET, with no arguments, returns the current flag value.\n\nglobal cvx___\ncvx_global\nif nargin == 1,\n if isnumeric(flag) || islogical(flag),\n ns = double(flag) ~= 0;\n elseif ischar(flag) && size(flag,1) == 1,\n switch lower(flag),\n case 'true',\n ns = true;\n case 'false',\n ns = false;\n otherwise,\n error( 'String arugment must be ''true'' or ''false''.' );\n end\n else\n error( 'Argument must be a numeric scalar or a string.' );\n end\nend\nif isempty( cvx___.problems ),\n s = cvx___.quiet;\n if nargin > 0,\n cvx___.quiet = ns;\n end\nelse\n s = cvx___.problems(end).quiet;\n if nargin > 0,\n if s ~= ns && ~isa( evalin( 'caller', 'cvx_problem', '[]' ), 'cvxprob' ),\n warning( 'CVX:Quiet', 'The global CVX quiet setting cannot be changed while a model is being constructed.' );\n else\n cvx___.problems(end).quiet = ns;\n end\n end\nend\nif nargin == 0 || nargout > 0,\n sout = s;\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/commands/cvx_save_prefs.m", "content": "function cvx_save_prefs( varargin )\n\n%CVX_SAVE_PREFS Saves current CVX settings for future MATLAB sessions.\n% CVX_SAVE_PREFS saves the the current global CVX settings to a special\n% prefences file (stored in the \"prefdir\" directory). This enables CVX to\n% remember your preferred settings (solver, precision, etc.) between\n% MATLAB sessions.\n\nglobal cvx___\nif ~isfield( cvx___, 'pfile' ),\n error( 'CVX:BadPrefsSave', 'CVX is not currently loaded; there are no preferences to save.' );\nelseif nargin == 0,\n fprintf( 'Saving prefs...' );\nend\noutp.expert = cvx___.expert;\noutp.precision = cvx___.precision;\noutp.precflag = cvx___.precflag;\noutp.rat_growth = cvx___.rat_growth;\noutp.path = cvx___.path;\noutp.solvers = cvx___.solvers;\noutp.license = cvx___.license;\noutp.solvers.map.default = cvx___.solvers.selected;\n[ outp.solvers.list.check, outp.solvers.list.solve, outp.solvers.list.eargs ] = deal( {} );\noutp.solvers.active = 0;\nsave(cvx___.pfile,'-struct','outp');\nif nargin == 0,\n fprintf( 'done.\\n' );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/commands/cvx_solver.m", "content": "function [ sout, slist ] = cvx_solver( sname )\r\n\r\n%CVX_SOLVER CVX solver selection.\r\n% CVX_SOLVER or CVX_SOLVER('')\r\n% selects the named solver the CVX uses to solve models. The solver name\r\n% is case-insensitive; so, for example, both 'SeDuMi' and 'sedumi' will\r\n% select the same solver.\r\n%\r\n% When CVX is first installed, the solver SDPT3 is selected as the\r\n% default. For most problems, this will be a good choice; nevertheless,\r\n% no solver is perfect, so if you encounter issues you may wish to\r\n% experiment with other solvers.\r\n%\r\n% There are two ways to use the CVX_SOLVER command. If you use it within\r\n% a model---that is, between the statements CVX_BEGIN and CVX_END---then\r\n% the new solver selection will apply only to that particular model. For\r\n% instance, if the default solver is SDPT3, then the following structure\r\n% will solve a single model using SeDuMi instead:\r\n% cvx_begin\r\n% cvx_solver sedumi\r\n% variables ...\r\n% ...\r\n% cvx_end\r\n% On the other hand, if CVX_SOLVER is called *outside* of a model, then\r\n% the change will apply for all subsequent models, or until you call \r\n% CVX_SOLVER once again.\r\n%\r\n% [ SOLVER, SOLVER_LIST ] = CVX_SOLVER returns the name of the current\r\n% solver, and a cell array containing the names of all available choices.\r\n%\r\n% Calling CVX_SOLVER with no input or output arguments produces a listing\r\n% of the solvers that CVX currently recognized, and an indication of the\r\n% current solver selection and/or the default.\r\n\r\nglobal cvx___\r\ncvx_global\r\nif nargin,\r\n if isempty( sname ),\r\n sname = 'default';\r\n elseif ~ischar( sname ) || size( sname, 1 ) ~= 1,\r\n error( 'Argument must be a string.' );\r\n end\r\n try\r\n snumber = cvx___.solvers.map.(lower(sname));\r\n catch\r\n error( 'Unknown, unusable, or missing solver: %s', sname );\r\n end\r\n if ~isempty( cvx___.solvers.list(snumber).error ),\r\n error( 'Solver unusable due to prior errors: %s', sname );\r\n end\r\n if isempty( cvx___.problems ),\r\n cvx___.solvers.selected = snumber;\r\n elseif ~isa( evalin( 'caller', 'cvx_problem', '[]' ), 'cvxprob' ),\r\n error( 'The global CVX solver selection cannot be changed while a model is being constructed.' );\r\n else\r\n cvx___.problems(end).solver.index = snumber;\r\n end\r\n if cvx___.solvers.active,\r\n cvx_setspath;\r\n end\r\nelseif nargout == 0,\r\n solvers = cvx___.solvers;\r\n snames = solvers.names;\r\n statvec = [ 0, solvers.map.default, solvers.active ];\r\n statstr = { 'selected', 'default', 'active' };\r\n if ~isempty( cvx___.problems ),\r\n statvec(1) = cvx___.problems(end).solver.index;\r\n else\r\n statvec(1) = solvers.selected;\r\n end\r\n fprintf( '\\n' );\r\n dash = '-';\r\n solvers = solvers.list;\r\n nsolv = length( solvers );\r\n lens = [4,6,7,8];\r\n for k = 1 : nsolv,\r\n if isempty( solvers(k).error ),\r\n nstat = statstr(k==statvec);\r\n if ~isempty(nstat),\r\n nstat = sprintf( '%s,', nstat{:} );\r\n nstat = nstat(1:end-1);\r\n end\r\n else\r\n nstat = 'disabled';\r\n end\r\n lens = max( lens, [ length(snames{k}), length(nstat), length(solvers(k).version), length(solvers(k).location) ] );\r\n end\r\n fmt = sprintf( ' %%-%ds %%-%ds %%-%ds %%s\\\\n', lens(1), lens(2), lens(3) );\r\n fprintf( fmt, 'Name', 'Status', 'Version', 'Location' ); %#ok\r\n fprintf( '%s\\n', dash(ones(1,sum(lens)+15)) );\r\n for k = 1 : nsolv,\r\n if isempty( solvers(k).error ),\r\n nstat = statstr(k==statvec);\r\n if ~isempty(nstat),\r\n nstat = sprintf( '%s,', nstat{:} );\r\n nstat = nstat(1:end-1);\r\n else\r\n nstat = '';\r\n end\r\n else\r\n nstat = 'disabled';\r\n end\r\n fprintf( fmt, snames{k}, nstat, solvers(k).version, solvers(k).location );\r\n end\r\n fprintf( '\\n' );\r\nend\r\nif nargout > 0,\r\n sout = cvx___.solvers.list(cvx___.solvers.selected).name;\r\n slist = cvx___.solvers.names;\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/commands/cvx_solver_settings.m", "content": "function sout = cvx_solver_settings( varargin )\n\n%CVX_SOLVER_SETTINGS CVX solver settings adjustment.\n% CVX_SOLVER_SETTINGS is used to adjust the advaned settings of the \n% current solver being used by CVX. Before using this function, please \n% read the IMPORTANT NOTE below.\n%\n% CVX_SOLVER_SETTINGS( , , [ , , ... ] )\n% stores a custom setting called for the active solver, and gives\n% it a value of , and so forth for the other key-value pairs.\n% Each name must be a string containing a valid variable name; the values\n% may be of any type or size, including empty arrays or strings.\n%\n% When CVX_END is reached, these key/value pairs will be delivered to the\n% underlying solver as parameters. This allows an expert user to modify\n% the behavior of the underlying solver in a manner that is otherwise\n% unavailable through more standard CVX commands.\n%\n% CVX_SOLVER_SETTINGS( 'name' ) or\n% CVX_SOLVER_SETTINGS name\n% returns the current value of that setting for the current solver. If\n% there is no such setting by that name, an error results.\n%\n% CVX_SOLVER_SETTINGS( '-clear', , '-clear', , ... ) or\n% CVX_SOLVER_SETTINGS -clear \n% Removes the key/value pair matching from the settings list for \n% the active solver.\n%\n% CVX_SOLVER_SETTINGS, with no arguments, displays the current list of\n% settings for the active solver.\n%\n% CVX_SOLVER_SETTINGS -all displays a list of the settings for all\n% all available solvers.\n%\n% CVX_SOLVER_SETTINGS -clear clears all settings for the active solver.\n%\n% CVX_SOLVER_SETTINGS -clearall clears all settings for all solvers.\n%\n% CVX_SOLVER_SETTINGS( S )\n% where S is a structure, replaces the *entire* list of solver settings\n% with the field-value pairs stored in the structure S.\n%\n% S = CVX_SOLVER_SETTINGS returns a structure containing all of the\n% settings for the current solver.\n%\n% If you call CVX_SOLVER_SETTINGS within a model --- that is, between\n% CVX_BEGIN and CVX_END --- then the changes are \"local\": that is, they\n% will apply ONLY to the current model.\n%\n% On the other hand, if you call CVX_SOLVER_SETTINGS outside of a model,\n% then the changes are \"global\": they will apply to all subsequent models\n% that employ that solver.\n%\n% CVX_SAVE_PREFS will save any global settings you have provided, so they\n% will be restored the next time you start MATLAB.\n%\n% CVX_SOLVER_SETTINGS( 'dumpfile', ) is a setting supported by\n% all solvers. If set, it will save a .MAT file containing the exact\n% input arguments delivered to the solver. This file will be created\n% immediately before the solver is called, so you will be able to examine\n% their contents even if the solver fails with an error. This feature is\n% to be used primarily by solver developers.\n%\n% **** IMPORTANT NOTE ****\n% Please use this feature with extreme caution, and at your own risk:\n% * CVX does not check the correctness of the settings you supply. If the\n% solver rejects the setting you supply, CVX will fail until you change\n% or remove that setting.\n% * Use of this feature can alter the quality of the solutions that the\n% solver produces: sometimes for the better, sometimes for the worse.\n% * Please consult your solver's specific documentation for information\n% about its available settings.\n% * The settings set here *override* any default values CVX has chosen\n% for each solver. In certain cases, this may actually confuse CVX and\n% and cause it to misinterpret the results. Fpr this reason, we cannot\n% support all possible combinations of custom settings.\n%\n% See also CVX_SOLVER, CVX_SAVE_PREFS, CVX_QUIET, CVX_PRECISION.\n\nglobal cvx___\ncvx_global\nis_local = ~isempty( cvx___.problems );\nif is_local,\n snumber = cvx___.problems(end).solver.index;\n settings = cvx___.problems(end).solver.settings;\nelse\n snumber = cvx___.solvers.selected;\n if isfield( cvx___.solvers.list, 'settings' ),\n settings = cvx___.solvers.list(snumber).settings;\n else\n settings = [];\n end\nend\nsname = cvx___.solvers.names{snumber};\nupdate = false;\nswitch nargin,\n case 0,\n if is_local,\n fprintf( '\\nLocal settings for solver %s:\\n', sname );\n else\n fprintf( '\\nGlobal settings for solver %s:\\n', sname );\n end\n if isempty( settings ) || isempty( fieldnames( settings ) ),\n fprintf( ' No custom settings specified.\\n\\n' );\n else\n disp( settings );\n end\n case 1,\n t_setting = varargin{1};\n if isstruct( t_setting ),\n update = true;\n if numel( t_setting ) > 1,\n error( 'Argument must be a string or a scalar structure.' );\n elseif isempty( fieldnames( settings ) ),\n settings = [];\n else\n settings = t_setting;\n end\n elseif ~ischar( t_setting ) || isempty( t_setting ) || size( t_setting, 1 ) > 1,\n error( 'Argument must be a string or a scalar structure.' );\n else\n switch t_setting,\n case '-all',\n fprintf( '\\n' );\n if is_local,\n fprintf( 'Local settings for solver %s:\\n', sname );\n if isempty( settings ) || isempty( fieldnames( settings ) ),\n fprintf( ' No custom settings specified.\\n\\n' );\n else\n disp( settings );\n end\n end\n for k = 1 : length(cvx___.solvers.list),\n fprintf( 'Global settings for solver %s:\\n', cvx___.solvers.names{k} );\n settings = cvx___.solvers.list(k).settings;\n if isempty( settings ) || isempty( fieldnames( settings ) ),\n fprintf( ' No custom settings specified.\\n\\n' );\n else\n disp( settings );\n end\n end\n case '-clear',\n settings = [];\n update = true;\n case '-clearall',\n settings = [];\n update = is_local;\n [ cvx___.solvers.list.settings ] = deal( [] );\n otherwise,\n if ~isvarname( t_setting ),\n error( 'CVX:InvalidField', 'Not a valid setting name: %s', t_setting );\n elseif isfield( settings, t_setting ),\n settings = settings.(t_setting);\n else\n error( 'CVX:NoSetting', 'Setting %s is not set.', t_setting );\n end\n end\n end\n otherwise,\n update = true;\n if rem( nargin, 2 ) ~= 0,\n error( 'Number of arguments must be even.' );\n end\n for k = 1 : nargin/2,\n t_setting = varargin{2*k-1};\n t_value = varargin{2*k};\n if ~ischar( t_setting ) || isempty( t_setting ) || size( t_setting, 1 ) > 1,\n error( 'CVX:InvalidField', 'Argument %d must be a string.', 2*k-1 );\n else\n switch t_setting,\n case '-clear',\n if ~isvarname( t_value ),\n error( 'CVX:InvalidField', 'Not a valid setting name: %s', t_value );\n elseif ~isfield( settings, t_value ),\n error( 'CVX:NoSetting', 'Setting %s is not set.', t_setting );\n else\n settings = rmfield( settings, t_value );\n update = true;\n end\n otherwise,\n if ~isvarname( t_setting ),\n error( 'CVX:InvalidField', 'Not a valid setting name: %s', t_setting );\n else\n settings.(t_setting) = t_value;\n update = true;\n end\n end\n end\n end\nend\nif update,\n if is_local,\n cvx___.problems(end).solver.settings = settings;\n else\n cvx___.solvers.list(snumber).settings = settings;\n end\nend \nif nargout,\n sout = settings;\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/commands/cvx_tic.m", "content": "function cvx_tic\n \n%CVX_TIC Resets the CVX timing functionality.\n%\n% CVX collects the following timing information:\n% --- Elapsed time since CVX_TIC was last called. If CVX_TIC was never\n% called, this measures the time since CVX was first initialized.\n% --- Elapsed time spent between top-level CVX_BEGIN and CVX_END comamnds\n% --- Elapsed time spent within the top-level CVX_END itself. This\n% includes final problem extraction, presolving, and solving.\n% --- Elapsed time spent calling the numerical solver.\n% To retrieve the current totals for these numbers, type CVX_TOC.\n% CVX_TIC resets these numbers to zero.\n\nglobal cvx___\ncvx_global\nif ~isempty( cvx___.problems ),\n error( 'CVX_TIC can only be called when no models are in construction.' );\nend\ncvx___.timers(1) = tic;\ncvx___.timers(2:4) = 0;\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/commands/cvx_toc.m", "content": "function timers = cvx_toc\n \n%CVX_TOC Returns the current timing information.\n%\n% CVX collects the following timing information:\n% --- Elapsed time since CVX_TIC was last called. If CVX_TIC was never\n% called, this measures the time since CVX was first initialized.\n% --- Elapsed time spent between top-level CVX_BEGIN and CVX_END comamnds\n% --- Elapsed time spent within the top-level CVX_END itself. This\n% includes final problem extraction, presolving, and solving.\n% --- Elapsed time spent calling the numerical solver.\n% To retrieve the current totals for these numbers, type CVX_TOC.\n% CVX_TIC resets these numbers to zero.\n\nglobal cvx___\nif isempty( cvx___ ),\n error( 'CVX has not yet been used (or the global workspace has been cleared).' );\nend\ntstart = tic;\ntimers = double(cvx___.timers);\ndbltim = isa( timers, 'double' );\nif dbltim,\n tstart = double(tstart);\nend\ntimers(1) = tstart - timers(1);\nif isempty(cvx___.increment),\n switch computer,\n case { 'MACI', 'MACI64' },\n cvx___.increment = 1e9;\n otherwise,\n t1 = tic; pause(0.25); t2 = tic; t3 = toc(t1); t4=toc(t2);\n if dbltim,\n cvx___.increment = (double(t2)-double(t1))/(double(t3)-0.5*double(t4));\n else\n two = uint64(2);\n cvx___.increment = double( two * ( t2 - t1 ) ) / ( two * t3 - t4 );\n end\n end\nend\ntimers = [ timers(1), timers(1:3) - timers(2:4), timers(4) ];\ntimers = timers / cvx___.increment;\nif nargout == 0,\n fprintf( 'Total time: %g sec\\n', timers(1) );\n fprintf( 'Outside of CVX: %g sec\\n', timers(2) );\n fprintf( 'Model building: %g sec\\n', timers(3) );\n fprintf( 'Presolving: %g sec\\n', timers(4) );\n fprintf( 'Solving: %g sec\\n', timers(5) );\n clear timers\nend\n \n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/commands/cvx_where.m", "content": "function s = cvx_where\n\n%CVX_WHERE Returns the location of the CVX system.\n% CVX_WHERE returns a string containing the base directory of the CVX\n% modeling framework. Within that directory are some useful\n% subdirectories and files:\n% functions/ new functions \n% examples/ sample cvx models\n% LICENSE.txt copyright information\n% The proper operation of this function assumes that it has not been\n% moved from its default position within the cvx distribution.\n\ntry\n s = dbstack('-completenames');\ncatch\n s = dbstack;\nend\ns = s(1);\nif isfield( s, 'file' ),\n s = s.file;\nelse\n s = s.name;\nend\nif ispc, \n fs = '\\'; \nelse\n fs = '/'; \nend\ntemp = strfind( s, fs );\ns( temp(end-1) + 1 : end ) = [];\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/cvx_error.m", "content": "function lines = cvx_error( errmsg, widths, useline, prefix, chop )\n\n% CVX_ERROR Formats text for inclusion in error messages.\n% This is an internal function used by CVX. It needed to be in the CVX\n% home directory so that it's available during a fresh installation.\n\nif ~ischar( errmsg ),\n if strncmp( errmsg.identifier, 'CVX:', 4 ),\n format = 'basic';\n else\n format = 'extended';\n end\n try\n errmsg = getReport( errmsg, format, 'hyperlinks', 'off' );\n errmsg = regexprep( errmsg,']*>', '' );\n catch\n if isfield(errmsg,'stack') && length(errmsg.stack) >= 1,\n errmsg = sprintf( '%s\\n Line %d: %s\\n', errmsg.message, errmsg.stack(1).line, errmsg.stack(1).file );\n else\n errmsg = sprintf( '%s\\n', errmsg.message );\n end\n end\nend\nlines = {};\nrndx = [ 0, regexp( errmsg, '\\n' ), length(errmsg) + 1 ];\nfor k = 1 : length(rndx) - 1,\n line = errmsg( rndx(k)+1 : rndx(k+1) - 1 );\n if ~isempty( line ),\n width = widths( min( k, length(widths) ) );\n emax = length( line );\n n_indent = 0;\n if emax > width,\n f_indent = sum( regexp( line, '[^ ]', 'once' ) - 1 );\n sndxs = find( line == ' ' );\n end\n while true,\n if emax + n_indent <= width || isempty( sndxs ),\n lines{end+1} = [ 32 * ones(1,n_indent), line ];\n break;\n end\n sndx = sndxs( sndxs <= width - n_indent + 1 );\n if isempty( sndx ), sndx = sndxs(1); end\n chunk = line(1:sndx(end)-1);\n lines{end+1} = [ 32*ones(1,n_indent), chunk ]; %#ok\n line(1:sndx(end)) = [];\n sndxs = sndxs(length(sndx)+1:end) - sndx(end);\n emax = emax - sndx(end);\n n_indent = f_indent + 4;\n end\n end\nend\nif nargin >= 3 && ( ischar(useline) || useline ),\n line = '-';\n line = line(1,ones(1,max(cellfun(@length,lines))));\n sline = line;\n if ischar( useline ),\n sline(1:length(useline)) = useline;\n end\n lines = [ sline, lines, line ];\nend\nif nargout == 0 || nargin >= 4,\n if nargin < 4, prefix = ''; end\n lines = sprintf( [ prefix, '%s\\n' ], lines{:} );\nend\nif nargin >= 5 && chop,\n lines(end) = [];\nend\nif nargout == 0,\n fprintf( '%s', lines );\n clear lines\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/cvx_setup.m", "content": "function cvx_setup( varargin )\n\n% CVX_SETUP Sets up and tests the cvx distribution.\n% This function is to be called any time CVX is installed on a new machine,\n% to insure that the paths are set properly and the MEX files are compiled.\n\nglobal cvx___\ntry \n\n cvx___ = [];\n squares = {}; %#ok\n nret = false;\n oldpath = '';\n line = '---------------------------------------------------------------------------'; \n\n %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n % Get version and portability information %\n %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n \n cvx_version( '-install', varargin{:} );\n if ~isfield( cvx___, 'loaded' ) || ~cvx___.loaded, %#ok\n error( 'CVX:Expected', 'Error detected by cvx_version' );\n end\n isoctave = cvx___.isoctave;\n mpath = cvx___.where;\n fs = cvx___.fs;\n ps = cvx___.ps;\n\n %%%%%%%%%%%%%%%%%%%%%%%\n % Reset the CVX paths %\n %%%%%%%%%%%%%%%%%%%%%%%\n \n oldpath = cvx_startup( false );\n if ~isempty( oldpath ),\n fprintf( 'Saving updated path...' ); \n nret = true;\n s = warning('off'); %#ok\n stat = savepath;\n warning(s);\n if stat,\n fprintf('failed. (see below)\\n');\n else\n fprintf('done.\\n');\n oldpath = [];\n end\n end\n \n %%%%%%%%%%%%%%%%%%%%%%\n % Search for solvers %\n %%%%%%%%%%%%%%%%%%%%%%\n\n try\n selected = cvx___.solvers.names{cvx___.solvers.map.default};\n catch\n selected = 'sdpt3';\n end\n cvx___.solvers = struct( 'selected', 0, 'active', 0, 'list', [], 'names', {{}}, 'map', struct( 'default', 0 ) );\n fprintf( 'Searching for solvers...' ); nret = true;\n shimpath = [ mpath, fs, 'shims', fs ];\n solvers = dir( shimpath );\n solvers = { solvers(~[solvers.isdir]).name };\n if isoctave, efilt = '\\.m$'; else efilt = '\\.(m|p)$'; end\n solvers = solvers( ~cellfun( @isempty, regexp( solvers, efilt ) ) );\n solvers = unique( cellfun( @(x)x(1:end-2), solvers, 'UniformOutput', false ) );\n solvers = struct( 'name', '', 'version', '', 'location', '', 'fullpath', '', 'error', '', 'warning', '', 'dualize', '', 'path', '', 'check', [], 'solve', [], 'settings', [], 'sname', solvers, 'spath', shimpath, 'params', [], 'eargs', {{}} );\n solver2 = which( 'cvx_solver_shim', '-all' );\n if ~isempty(solver2) && ~iscell(solver2),\n solver2 = { solver2 };\n end\n for k = 1 : length(solver2),\n tsolv = solver2{k};\n ndxs = find(tsolv==fs,1,'last');\n solvers(end+1).spath = tsolv(1:ndxs); %#ok\n solvers(end).sname = tsolv(ndxs+1:end-2);\n end\n cur_d = pwd;\n nsolvers = [];\n nshims = length(solvers);\n for k = 1 : nshims,\n tsolv = solvers(k);\n try\n cd(tsolv.spath);\n tsolv = feval( tsolv.sname, tsolv );\n nsolv = length(tsolv);\n if nsolv > 1,\n sndx = 0;\n for e = 0 : 1,\n for j = 1 : nsolv,\n if e ~= isempty( tsolv(j).error ),\n sndx = sndx + 1;\n if sndx > 1, tsolv(j).name = sprintf( '%s_%d', tsolv(j).name, sndx ); end\n end\n end\n end\n end\n catch errmsg\n errmsg = cvx_error( errmsg, 63, false, ' ' );\n if isempty( tsolv.name ),\n tsolv.name = [ tsolv.spath, tsolv.sname ];\n end\n tsolv.error = sprintf( 'unexpected error:\\n%s', errmsg );\n end\n nsolvers = [ nsolvers, tsolv ]; %#ok\n end\n solvers = nsolvers;\n cd( cur_d );\n \n %%%%%%%%%%%%%%%%%%%%%%%%%\n % Process solver errors %\n %%%%%%%%%%%%%%%%%%%%%%%%%\n \n plurals = { 's', '', 's' };\n nsolv = length(solvers);\n nrej = sum(~cellfun(@isempty,{solvers.error}));\n nwarn = sum(~cellfun(@isempty,{solvers.warning}));\n fprintf( '%d shim%s found.\\n', nshims, plurals{min(nshims+1,3)} ); nret = false;\n lens = [ 0, 0 ];\n for k = 1 : nsolv,\n lens = max( lens, [ length(solvers(k).name), length(solvers(k).version) ] );\n end\n fmt = sprintf( ' %%s %%-%ds %%-%ds %%s\\\\n', lens(1), lens(2) );\n if nsolv > nrej,\n fprintf( '%d solver%s initialized (* = default):\\n', nsolv-nrej, plurals{min(nsolv-nrej+1,3)} );\n stats = { ' ', '*' };\n for k = 1 : nsolv,\n if isempty( solvers(k).error ),\n fprintf( fmt, stats{1+strcmpi(solvers(k).name,selected)}, solvers(k).name, solvers(k).version, solvers(k).location );\n end\n end\n end\n if nrej,\n fprintf( '%d solver%s skipped:\\n', nrej, plurals{min(nrej+1,3)} );\n for k = 1 : nsolv,\n if ~isempty( solvers(k).error ),\n fprintf( fmt, ' ', solvers(k).name, solvers(k).version, solvers(k).location ); %#ok\n cvx_error( solvers(k).error, 63, false, ' ' );\n end\n end\n end\n if nwarn,\n fprintf( '%d solver%s issued warnings:\\n', nwarn, plurals{min(nwarn+1,3)} );\n for k = 1 : nsolv,\n if ~isempty( solvers(k).warning ) && isempty( solvers(k).error ),\n fprintf( fmt, ' ', solvers(k).name, solvers(k).version, solvers(k).location ); %#ok\n cvx_error( solvers(k).warning, 63, false, ' ' );\n end\n end\n end\n if nrej == nsolv,\n fprintf( [ ... \n 'No valid solvers were found. This suggests a corrupt installation. Please\\n', ...\n 'try re-installing the files and re-running cvx_setup. If the same error\\n', ...\n 'occurs, please contact CVX support.\\n' ] );\n error('CVX:Unexpected','No valid solvers were found.');\n end\n solvers = solvers(cellfun(@isempty,{solvers.error}));\n cvx___.solvers.list = solvers;\n cvx___.solvers.names = { solvers.name };\n cvx___.solvers.map = struct( 'default', 0 );\n for k = 1 : length(solvers),\n cvx___.solvers.map.(lower(solvers(k).name)) = k;\n if strcmpi( solvers(k).name, selected ),\n cvx___.solvers.map.default = k;\n cvx___.solvers.selected = k;\n end\n end\n if cvx___.solvers.selected == 0,\n cvx___.solvers.selected = 1;\n cvx___.solvers.map.default = 1;\n fprintf( [ ...\n 'WARNING: The default solver %s is missing; %s has been selected as a\\n', ...\n ' new default. If this was unexpected, try re-running cvx_setup.\\n' ], ...\n selected, cvx___.solvers.list(cvx___.solvers.selected).name, lower(cvx___.solvers.list(cvx___.solvers.selected).name) );\n end\n \n %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n % Create the global data structure %\n %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n \n cvx_global;\n if isempty( cvx___.solvers.list ),\n error('CVX:Unexpected','No valid solvers were found.');\n end\n \n %%%%%%%%%%%%%%%%%%%%\n % Save preferences %\n %%%%%%%%%%%%%%%%%%%%\n \n fprintf( 'Saving updated preferences...' ); nret = true;\n try\n cvx_save_prefs( 'save' );\n fprintf( 'done.\\n' ); nret = false;\n catch errmsg\n fprintf( 'unexpected error:\\n' ); nret = false;\n cvx_error( errmsg, 67, true, ' ' );\n fprintf( 'Please attempt to correct this error and re-run cvx_setup. If you cannot,\\n' );\n fprintf( 'you will be forced to re-run cvx_setup every time you start MATLAB.\\n' );\n end\n \n %%%%%%%%%%%%%%%%%%%%%%%%%\n % Test the distribution %\n %%%%%%%%%%%%%%%%%%%%%%%%%\n\n fprintf( 'Testing with a simple model...' ); nret = true;\n need_cc = false;\n try\n m = 16; n = 8;\n A = randn(m,n);\n b = randn(m,1);\n cvx_begin('quiet')\n variable('x(n)');\n minimize( norm(A*x-b,1) );\n cvx_end\n fprintf( 'done!\\n' ); nret = false;\n catch exc\n if any(strfind(exc.message,'clear classes')),\n fprintf( 'problem (see below).\\n' );\n need_cc = true;\n else\n rethrow( exc );\n end\n end\n \n %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n % Quick instructions on changing the solver %\n %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n \n if length( cvx___.solvers.list ) > 1,\n fprintf( '%s\\n', line );\n fprintf( 'To change the default solver, type \"cvx_solver \".\\n')\n fprintf( 'To save this change for future sessions, type \"cvx_save_prefs\".\\n' );\n fprintf( 'Please consult the users'' guide for more information.\\n' );\n end\n \n %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n % Instruct the user to save the path %\n %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n \n if ~isempty( oldpath )\n need_upr = false;\n need_disclaim = true;\n user_path = which( 'startup.m' );\n if isempty( user_path ),\n user_path = userpath;\n if length(user_path) <= 1,\n need_upr = true;\n user_path = system_dependent('getuserworkfolder', 'default');\n if ~isempty( user_path ),\n if isempty( strfind( user_path, [ fs, 'MATLAB' ] ) ),\n user_path = [ user_path, fs, 'MATLAB' ];\n end\n end\n elseif user_path(end) == ps,\n user_path(end) = '';\n end\n if ~isempty( user_path ),\n user_file = [ user_path, fs, 'startup.m' ];\n else\n user_file = '';\n end\n else\n user_file = user_path;\n user_path = user_path(1:end-10);\n end\n fprintf( '%s\\n', line );\n fprintf('NOTE: the MATLAB path has been changed to point to the CVX distribution. To\\n' );\n fprintf('use CVX without having to re-run CVX_SETUP every time MATLAB starts, you\\n' );\n fprintf('will need to save this path permanently. This script attempted to do this\\n' );\n if fs == '/',\n fprintf('for you, but failed---likely due to UNIX permissions restrictions.\\n' );\n nextword = 'To solve the problem';\n else\n fprintf('for you, but failed, due to the Windows User Access Control (UAC) settings.\\n');\n fprintf('Click here for a MATLAB document that discusses the issue.\\n\\n');\n fprintf('To solve this problem, please take the following steps:\\n');\n fprintf(' 1) Exit MATLAB.\\n');\n fprintf(' 2) Right click on the MATLAB icon, and select \"Run as administrator.\"\\n' );\n fprintf(' 3) Re-run \"cvx_setup\".\\n\\n');\n nextword = 'Alternatively, if you do not have administrator access';\n end\n if exist( user_file, 'file' ),\n fprintf( '%s, edit the file\\n %s\\nand add the following line to the end of the file:\\n', nextword, user_file ); \n fprintf( ' run %s%scvx_startup.m\\n', mpath, fs );\n elseif ~isempty( user_path ),\n fprintf( '%s, create a new file\\n %s\\ncontaining the following line:\\n', nextword, user_file );\n fprintf( ' run %s%scvx_startup.m\\n', mpath, fs );\n else\n fprintf( '%s, create a startup.m file containing the line:\\n', nextword );\n fprintf( ' run %s%scvx_startup.m\\n', mpath, fs );\n fprintf( 'Consult the MATLAB documentation for the proper location for that file.\\n' );\n need_disclaim = false;\n end\n if need_upr,\n fprintf( 'Then execute the following MATLAB commands:\\n userpath reset; startup\\n' );\n end\n if need_disclaim,\n fprintf( 'Please consult the MATLAB documentation for more information about the\\n' );\n fprintf( 'startup.m file and its proper placement and usage.\\n' );\n end\n end\n \n %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n % Warn about class conflict with previous version of CVX %\n %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n \n if need_cc,\n fprintf( '%s\\n', line );\n fprintf('WARNING: CVX was unable to run the test model due to a conflict with the\\n' );\n fprintf('previous version of CVX. If no other errors occurred, then the setup was\\n' );\n fprintf('still successful; however, to use CVX, you will need to re-start MATLAB.\\n' );\n end\n \n %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n % Warn about signal processing toolbox conflict %\n %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n \n squares = which( 'square', '-all' );\n if iscell( squares ) && length( squares ) > 1,\n squares = squares(~cellfun(@(x)any(strfind(x,[fs,'@cvx',fs])),squares));\n if length(squares) == 1 || ~strncmp(squares{1},[mpath,fs],length(mpath)+1),\n squares = {};\n end\n else\n squares = {};\n end\n if ~isempty(squares),\n fprintf( '%s\\n', line );\n fprintf('WARNING: CVX includes a function\\n %s\\n', squares{1} );\n fprintf('that conflicts with a function of the same name found here:\\n %s\\n', squares{2} );\n fprintf('If you wish to use this second function, you will need to rename or delete\\n' );\n fprintf('the CVX version, as it will likely produce different results. This will not\\n' );\n fprintf('affect the use of SQUARE() within CVX models, because CVX relies on a\\n' );\n fprintf('different, internal version of SQUARE() when constructing CVX models.\\n')\n end\n\ncatch errmsg\n\n %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n % Restore the environment in the event of an error %\n %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n if nret, fprintf( '\\n' ); end\n switch errmsg.identifier,\n case { 'CVX:Expected', 'CVX:Licensing' },\n unexpected = false;\n if ~isempty( errmsg.message ),\n cvx_error( errmsg, 67, 'ERROR: ', ' ' );\n end\n case 'CVX:Unexpected',\n unexpected = true;\n otherwise,\n cvx_error( errmsg, 67, 'UNEXPECTED ERROR: ', ' ' );\n unexpected = true;\n end\n if ~isempty( oldpath ),\n path( oldpath );\n end\n clear global cvx___\n if unexpected,\n fprintf( 'Please report this error to support, and include entire output of\\n' );\n fprintf( 'CVX_SETUP in your support request.\\n' );\n else\n fprintf( 'The installation of CVX was not completed. Please correct the error\\n' );\n fprintf( 'and re-run CVX_SETUP.\\n' );\n end\n\nend\n\nfprintf( '%s\\n\\n', line );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/cvx_startup.m", "content": "function prevpath = cvx_startup( quiet )\n\n%CVX_STARTUP Quietly add CVX to your MATLAB path (for startup).\n% Running CVX_STARTUP upon startup ensures that CVX is properly included\n% in your MATLAB path.\n%\n% On Mac and PC systems, this function is not necessary, because you can\n% simply run \"savepath\" to save the CVX path changes permanently, or use\n% the \"pathtool\" command to do the same. In fact, CVX_SETUP attempts to\n% run \"savepath\" as part of its setup process.\n%\n% On UNIX systems, the MATLAB installation is usually installed in such\n% a manner that individual users cannot change the global MATLAB path.\n% This can be circumvented by making the PATHDEF.M file world-writable;\n% but if the system serves multiple users, this may not be desirable.\n%\n% CVX_STARTUP provides a simple solution to this problem. Simply add the\n% following line to the end of your local STARTUP.M file:\n% run /cvx_startup\n% Note that using the \"run\" command *and* providing the full path to the\n% CVX installation are critical. With this change, CVX_STARTUP.M will be\n% called every time the user runs MATLAB.\n%\n% Note that CVX_STARTUP is *not* a substitute for running CVX_SETUP.\n% Please run CVX_SETUP first when installing CVX, and *then* add the\n% CVX_STARTUP line if instructed to do so.\n\nglobal cvx___\nif nargin < 1 || isempty( quiet ), \n quiet = false; \nend\nif ~quiet,\n fprintf( 'Setting CVX paths...' );\nend\ncvx_version(1);\nfs = cvx___.fs;\nps = cvx___.ps;\ncs = cvx___.cs;\nmpath = cvx___.where;\nmsub = cvx___.msub;\n\nprevpath = path;\noldpath = textscan( prevpath, '%s', 'Delimiter', ps );\noldpath = oldpath{1}(:)';\nother_homes = which( 'cvx_setup.m', '-all' );\nif ~iscell( other_homes ), other_homes = { other_homes }; end\nother_homes = regexprep( other_homes, '.cvx_setup\\.m$', '' );\nother_homes( strcmp( other_homes, mpath ) ) = [];\nndxs = false(size(oldpath));\nfor k = 0 : length(other_homes),\n if k, tpath = other_homes{k}; else tpath = mpath; end\n plen = length(tpath);\n if cs, tndxs = strncmp( tpath, oldpath, plen );\n else tndxs = strncmpi( tpath, oldpath, plen ); end\n tndxs(tndxs) = cellfun(@(x)length(x)<=plen||x(plen+1)==fs,oldpath(tndxs));\n ndxs = ndxs | tndxs;\nend\ndndx = find(ndxs,1) - 1;\nif isempty(dndx),\n dndx = +strcmp(oldpath{1},'.');\nend\nchanged = false;\nif any(ndxs),\n changed = true;\n newpath = horzcat( oldpath(~ndxs) );\n npath = sprintf( [ '%s', pathsep ], newpath{:} );\n npath = npath(1:end-1);\n path(npath);\nend\n\naddpaths = { 'builtins', 'commands', 'functions', 'lib', 'structures' };\nmpath2 = mpath + fs; npath2 = length(mpath2);\nif ~any(~strncmp(which('vec', '-all'), mpath2, npath2)),\n addpaths{end+1} = [ 'functions', fs, 'vec_' ]; \nend\nif ~any(~strncmp(which('square', '-all'), mpath2, npath2)),\n addpaths{end+1} = [ 'functions', fs, 'square_' ]; \nend\nif ~any(~strncmp(which('narginchk', '-all'), mpath2, npath2)),\n addpaths{end+1} = [ 'lib', fs, 'narginchk_' ]; \nend\naddpaths = strcat( [ mpath, fs ], addpaths );\nif ~isempty(msub),\n mpath2 = [ mpath, fs, 'lib', fs, msub ];\n if exist( mpath2, 'dir' ),\n addpaths{end+1} = mpath2;\n end\nend\naddpaths{end+1} = mpath;\n\nndxs(1:dndx) = true;\nnewpath = horzcat( oldpath(1:dndx), addpaths, oldpath(~ndxs) );\nif changed || ~isequal( newpath, oldpath ),\n npath = sprintf( [ '%s', pathsep ], newpath{:} );\n npath = npath(1:end-1);\n path(npath);\nend\nif ~quiet,\n if isequal( newpath, oldpath ),\n fprintf( 'already set!\\n' );\n else\n fprintf( 'done.\\n' );\n end\n if ~isempty( other_homes ),\n fprintf( 'WARNING: other CVX installations were found in your MATLAB path:\\n' );\n fprintf( ' %s\\n', other_homes{:} );\n fprintf( 'They have been removed to prevent conflicts.\\n' );\n end\nend\nif nargout,\n if isequal( npath, prevpath ),\n prevpath = '';\n end\nelse\n clear prevpath\nend\ncpath = struct('string','','active',false,'hold',false);\nsubs = strcat([mpath,fs],{'keywords','sets'});\ncpath.string = sprintf( ['%s',ps], subs{:} );\ncvx___.path = cpath;\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/cvx_version.m", "content": "function varargout = cvx_version( varargin )\n\n% CVX_VERSION Returns version and environment information for CVX.\n%\n% When called with no arguments, CVX_VERSION prints out version and\n% platform information that is needed when submitting CVX bug reports.\n%\n% This function is also used internally to return useful variables that\n% allows CVX to adjust its settings to the current environment.\n\nglobal cvx___\n\nargs = varargin;\ncompile = false;\nquick = nargout > 0;\nif nargin\n if ~ischar( args{1} ),\n quick = true;\n else\n tt = strcmp( args, '-quick' );\n quick = any( tt );\n if quick, args(tt) = []; end\n tt = strcmp( args, '-compile' );\n compile = any( tt );\n if compile, quick = false; args(tt) = []; end\n end\nend\n\nif isfield( cvx___, 'loaded' ),\n \n if quick, return; end\n fs = cvx___.fs;\n mpath = cvx___.where;\n isoctave = cvx___.isoctave;\n \nelse\n \n % Matlab / Octave flag\n isoctave = exist( 'OCTAVE_VERSION', 'builtin' );\n\n % File and path separators, MEX extension\n if isoctave,\n comp = octave_config_info('canonical_host_type');\n mext = 'mex';\n izpc = false;\n izmac = false;\n if octave_config_info('mac'),\n msub = 'mac';\n izmac = true;\n elseif octave_config_info('windows'),\n msub = 'win';\n izpc = true;\n elseif octave_config_info('unix') && any(strfind(comp,'linux')),\n msub = 'lin';\n else\n msub = 'unknown';\n end\n if ~isempty( msub ),\n msub = [ 'o_', msub ];\n if strncmp( comp, 'x86_64', 6 ),\n msub = [ msub, '64' ];\n else\n msub = [ msub, '32' ];\n end\n end\n else\n comp = computer;\n izpc = strncmp( comp, 'PC', 2 );\n izmac = strncmp( comp, 'MAC', 3 );\n mext = mexext;\n msub = '';\n end\n if izpc,\n fs = '\\'; \n fsre = '\\\\';\n ps = ';'; \n cs = false;\n else\n fs = '/'; \n fsre = '/';\n ps = ':';\n cs = ~izmac;\n end\n\n % Install location\n mpath = mfilename('fullpath');\n temp = strfind( mpath, fs );\n mpath = mpath( 1 : temp(end) - 1 );\n\n % Numeric version\n nver = version;\n nver(nver=='.') = ' ';\n nver = sscanf(nver,'%d');\n nver = nver(1) + 0.01 * ( nver(2) + 0.01 * nver(3) );\n \n if isoctave || ~usejava('jvm'),\n jver = 0;\n else\n jver = char(java.lang.System.getProperty('java.version'));\n try\n ndxs = strfind( jver, '.' );\n jver = str2double( jver(1:ndxs(2)-1) );\n catch\n jver = 0;\n end\n end\n \n cvx___.where = mpath;\n cvx___.isoctave = isoctave;\n cvx___.nver = nver;\n cvx___.jver = jver;\n cvx___.comp = comp;\n cvx___.mext = mext;\n cvx___.msub = msub;\n cvx___.fs = fs;\n cvx___.fsre = fsre;\n cvx___.ps = ps;\n cvx___.cs = cs;\n \nend\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% Quick exit for non-verbose output %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nif quick,\n if nargout,\n varargout = { fs, cvx___.ps, mpath, cvx___.mext };\n end\n cvx_load_prefs( false );\n cvx___.loaded = true;\n return\nend\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% Verbose output (cvx_setup, cvx_version plain) %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\ncvx_ver = '2.1';\ncvx_bld = '****';\ncvx_bdate = '';\ncvx_bcomm = '*******';\nline = '---------------------------------------------------------------------------';\nfprintf( '\\n%s\\n', line );\nfprintf( 'CVX: Software for Disciplined Convex Programming (c)2014 CVX Research\\n' );\nfprintf( 'Version %3s, Build %4s (%7s)%42s\\n', cvx_ver, cvx_bld, cvx_bcomm, cvx_bdate );\nfprintf( '%s\\n', line );\nfprintf( 'Installation info:\\n Path: %s\\n', cvx___.where );\nif isoctave,\n fprintf( ' GNU Octave %s on %s\\n', version, cvx___.comp );\nelse\n verd = ver('MATLAB');\n fprintf( ' MATLAB version: %s %s\\n', verd.Version, verd.Release );\n if usejava( 'jvm' ),\n os_name = char(java.lang.System.getProperty('os.name'));\n os_arch = char(java.lang.System.getProperty('os.arch'));\n os_version = char(java.lang.System.getProperty('os.version'));\n java_str = char(java.lang.System.getProperty('java.version'));\n fprintf(' OS: %s %s version %s\\n', os_name, os_arch, os_version );\n fprintf(' Java version: %s\\n', java_str );\n else\n fprintf( ' Architecture: %s\\n', cvx___.comp );\n fprintf( ' Java version: disabled\\n' );\n end\nend\n \n%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% Check for valid version %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nissue = false;\nisoctave = cvx___.isoctave;\nnver = cvx___.nver;\nif isoctave,\n if nver <= 3.08,\n fprintf( '%s\\nCVX is not yet supported on Octave.\\n(Please do not waste further time trying: changes to Octave are required.\\nBut they are coming! Stay tuned.)\\n%s\\n', line, line );\n issue = true;\n end\nelseif nver < 7.08 && strcmp( cvx___.comp(end-1:end), '64' ),\n fprintf( '%s\\nCVX requires MATLAB 7.8 or later (7.5 or later on 32-bit platforms).\\n' , line, line );\n issue = true;\nelseif nver < 7.05,\n fprintf( '%s\\nCVX requires MATLAB 7.5 or later (7.8 or later on 64-bit platforms).\\n' , line, line );\n issue = true;\nend\n\n%%%%%%%%%%%%%%%%%%%%%%%%\n% Verify file contents %\n%%%%%%%%%%%%%%%%%%%%%%%%\n\nfid = fopen( [ mpath, fs, 'MANIFEST' ], 'r' );\nif fid > 0,\n fprintf( 'Verfying CVX directory contents:' );\n manifest = textscan( fid, '%s' );\n manifest = manifest{1};\n fclose( fid );\n newman = get_manifest( mpath, fs );\n if ~isequal( manifest, newman ),\n missing = setdiff( manifest, newman );\n additional = setdiff( newman, manifest );\n if ~isempty( missing ) || ~isempty( additional ),\n if fs ~= '/',\n missing = strrep( missing, '/', fs );\n additional = strrep( additional, '/', fs );\n end\n if ~isempty( missing ),\n fprintf( '\\n WARNING: The following files/directories are missing:\\n' );\n isdir = cellfun(@(x)x(end)==fs,missing);\n missing_d = missing(isdir);\n missing_f = missing(~isdir);\n while ~isempty( missing_d ),\n mdir = missing_d{1};\n ss = strncmp( missing_d, mdir, length(mdir) );\n tt = strncmp( missing_f, mdir, length(mdir) );\n fprintf( ' %s%s%s + %d files, %d subdirectories\\n', mpath, fs, mdir, nnz(tt), nnz(ss) - 1 );\n missing_d(ss) = [];\n missing_f(tt) = [];\n end\n for k = 1 : min(length(missing_f),10),\n fprintf( ' %s%s%s\\n', mpath, fs, missing_f{k} );\n end\n if length(missing_f) > 10,\n fprintf( ' (and %d more files)\\n', length(missing_f) - 10 );\n end\n fprintf( ' These omissions may prevent CVX from operating properly.\\n' );\n end\n if ~isempty( additional ),\n if isempty( missing ), fprintf( '\\n' ); end\n fprintf( ' WARNING: The following extra files/directories were found:\\n' );\n isdir = cellfun(@(x)x(end)==fs,additional);\n issedumi = cellfun(@any,regexp( additional, [ '^sedumi.*[.]', mexext, '$' ] ));\n additional_d = additional(isdir&~issedumi);\n additional_f = additional(~isdir&~issedumi);\n additional_s = additional(issedumi);\n while ~isempty( additional_d ),\n mdir = additional_d{1};\n ss = strncmp( additional_d, mdir, length(mdir) );\n tt = strncmp( additional_f, mdir, length(mdir) );\n fprintf( ' %s%s%s + %d files, %d subdirectories\\n', mpath, fs, mdir, nnz(tt), nnz(ss) - 1 );\n additional_d(ss) = [];\n additional_f(tt) = [];\n end\n for k = 1 : min(length(additional_f),10),\n fprintf( ' %s%s%s\\n', mpath, fs, additional_f{k} );\n end\n if length(additional_f) > 10,\n fprintf( ' (and %d more files)\\n', length(additional_f) - 10 );\n end\n fprintf( ' These files may alter the behavior of CVX in unsupported ways.\\n' );\n if ~isempty( additional_s ),\n fprintf( ' ERROR: obsolete versions of SeDuMi MEX files were found:\\n' );\n for k = 1 : length(additional_s),\n fprintf( ' %s%s%s\\n', mpath, fs, additional_f{k} );\n end\n fprintf( ' These files are now obsolete, and must be removed to ensure\\n' );\n fprintf( ' that SeDuMi operates properly and produces sound results.\\n' );\n if ~issue,\n fprintf( ' Please remove these files and re-run CVX_SETUP.\\n' );\n issue = true;\n end\n end\n end\n else\n fprintf( '\\n No missing files.\\n' );\n end\n else\n fprintf( '\\n No missing files.\\n' );\n end\nelse \n fprintf( 'Manifest missing; cannot verify file structure.\\n' ) ;\nend\nif ~compile,\n mexpath = [ mpath, fs, 'lib', fs ];\n mext = cvx___.mext;\n if ( ~exist( [ mexpath, 'cvx_eliminate_mex.', mext ], 'file' ) || ...\n ~exist( [ mexpath, 'cvx_bcompress_mex.', mext ], 'file' ) ) && ~issue,\n issue = true;\n if ~isempty( msub ),\n mexpath = [ mexpath, msub, fs ];\n issue = ~exist( [ mexpath, 'cvx_eliminate_mex.mex' ], 'file' ) || ...\n ~exist( [ mexpath, 'cvx_bcompress_mex.mex' ], 'file' );\n end\n if issue,\n fprintf( ' ERROR: one or more MEX files for this platform are missing.\\n' );\n fprintf( ' These files end in the suffix \".%s\". CVX will not operate\\n', mext );\n fprintf( ' without these files. Please visit\\n' );\n fprintf( ' http://cvxr.com/cvx/download\\n' );\n fprintf( ' And download a distribution targeted for your platform.\\n' );\n end\n end\nend\n\n%%%%%%%%%%%%%%%\n% Preferences %\n%%%%%%%%%%%%%%%\n\ncvx_load_prefs( true );\n \n%%%%%%%%%%%%%%%%\n% License file %\n%%%%%%%%%%%%%%%%\n\nif isoctave,\n if ~isempty( cvx___.license ),\n fprintf( 'CVX Professional is not supported with Octave.\\n' );\n end\nelseif cvx___.jver < 1.6,\n fprintf(' WARNING: full support for CVX Professional licenses\\n' );\n fprintf(' requres Java version 1.6.0 or later. Please upgrade.\\n' );\nelseif exist( 'cvx_license', 'file' ),\n cvx_license( args{:} );\nend\n\n%%%%%%%%%%%%%%%\n% Wrapping up %\n%%%%%%%%%%%%%%%\n\nif ~issue,\n cvx___.loaded = true;\nend\nclear fs;\nfprintf( '%s\\n', line );\nif length(dbstack) <= 1,\n fprintf( '\\n' );\nend\n\n%%%%%%%%%%%%%%%%%%%%%%\n% Preference loading %\n%%%%%%%%%%%%%%%%%%%%%%\n\nfunction cvx_load_prefs( verbose )\n\nglobal cvx___\nfs = cvx___.fs;\nisoctave = cvx___.isoctave;\nerrmsg = '';\nif verbose,\n fprintf( 'Preferences: ' );\nend\nif isoctave,\n pfile = [ prefdir, fs, '.cvx_prefs.mat' ];\nelse\n pfile = [ regexprep( prefdir(1), [ cvx___.fsre, 'R\\d\\d\\d\\d\\w$' ], '' ), fs, 'cvx_prefs.mat' ];\nend\noutp = [];\ntry\n if exist( pfile, 'file' )\n outp = load( pfile );\n pfile2 = pfile;\n elseif ~isoctave,\n pfile2 = [ prefdir, fs, 'cvx_prefs.mat' ];\n if exist( pfile2, 'file' ),\n outp = load( pfile2 );\n end\n end\ncatch errmsg\n errmsg = cvx_error( errmsg, 67, false, ' ' );\n errmsg = sprintf( 'CVX encountered the following error attempting to load your preferences:\\n%sPlease attempt to diagnose this error and try again.\\nYou may need to re-run CVX_SETUP as well.\\nIn the meanwhile, preferences will be set to their defaults.\\n', errmsg );\nend\nif ~isempty( outp ),\n try\n cvx___.expert = outp.expert;\n cvx___.precision = outp.precision;\n cvx___.precflag = outp.precflag;\n cvx___.rat_growth = outp.rat_growth;\n cvx___.path = outp.path;\n cvx___.solvers = outp.solvers;\n cvx___.license = outp.license;\n catch\n outp = [];\n errmsg = 'Your CVX preferences file seems out of date; default preferences will be used.';\n end\nend\nif isempty( outp ),\n cvx___.expert = false;\n cvx___.precision = [eps^0.5,eps^0.5,eps^0.25];\n cvx___.precflag = 'default';\n cvx___.rat_growth = 10;\n cvx___.path = [];\n cvx___.solvers = [];\n cvx___.license = [];\nend\ncvx___.pfile = pfile;\nif verbose,\n if ~isempty( errmsg ),\n fprintf( 'error during load:\\n%s', cvx_error( errmsg, 70, false, ' ' ) );\n elseif isempty( cvx___.path ),\n fprintf( 'none found; defaults loaded.\\n' );\n else\n fprintf( '\\n Path: %s\\n', pfile2 );\n end\nelseif ~isempty( errmsg ),\n warning( 'CVX:BadPrefsLoad', errmsg );\nend\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% Recursive manifest building function %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nfunction newman = get_manifest( mpath, fs )\ndirs = {};\nfiles = {};\nnfiles = dir( mpath );\nndir = '';\ndndx = 0;\npat2 = '^\\.|~$|';\npat = '^\\.|~$|^cvx_license.[md]at$|^doc$|^examples$';\nwhile true,\n isdir = [ nfiles.isdir ];\n nfiles = { nfiles.name };\n tt = cellfun( @isempty, regexp( nfiles, pat ) ); pat = pat2;\n isdir = isdir(tt);\n nfiles = nfiles(tt);\n ndirs = nfiles(isdir);\n if ~isempty(ndirs),\n dirs = horzcat( dirs, strcat(strcat(ndir,ndirs), fs ) ); %#ok\n end\n nfiles = nfiles(~isdir);\n if ~isempty(nfiles),\n files = horzcat( files, strcat(ndir,nfiles) ); %#ok\n end\n if length( dirs ) == dndx, break; end\n dndx = dndx + 1;\n ndir = dirs{dndx};\n nfiles = dir( [ mpath, fs, ndir ] );\nend\n[tmp,ndxs1] = sort(upper(dirs)); %#ok\n[tmp,ndxs2] = sort(upper(files)); %#ok\nnewman = horzcat( dirs(ndxs1), files(ndxs2) );\nif fs ~= '/',\n newman = strrep( newman, fs, '/' );\nend\nnewman = newman(:);\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/Contents.m", "content": "% CVX example library\n%\n% antenna_array_design/ - Antenna array design\n% circuit_design/ - Circuit design\n% cvxbook/ - Figures, examples, and exercises from the book Convex Optimization\n% filter_design/ - Filter design\n% gp_tutorial/ - Examples from A Tutorial on Geometric Programming\n% graph_laplacian/ - Graph Laplacian eigenvalue optimization\n% log_exp/ - Examples employing logarithms, exponentials, and entropy functions\n% sparse_heuristics/ - Sparse solution heuristics\n% time_series_analysis/ - Example from l1 Trend Filtering\n% quickstart.m - Examples from the CVX Users' guide\n% regularized_norm_tradeoff.m - Builds a norm minimization tradeoff curve\n% simple_LP2.m - Builds and solves a simple inequality-constrained linear program\n% simple_LS.m - Builds and solves a simple least-squares problem using cvx\n% simple_LP.m - Builds and solves a simple linear program\n% closest_toeplitz_psd.m - Closest Toeplitz SDP search.\n% equality_constr_norm_min.m - Equality constrained norm minimization.\n% min_phase_spectral_fact.m - Minimal phase spectral factorization\n% nonneg_matrix_fact.m - Nonnegative matrix factorization\nhelp Contents\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/antenna_array_design/Contents.m", "content": "% Antenna array design\n% Antenna Array Pattern Synthesis via Convex Optimization\n% FIR Filter Design via Spectral Factorization and Convex Optimization\n%\n% ant_array_min_beamwidth.m - Minimize beamwidth of an array with arbitrary 2-D geometry\n% line_array_spec_fact.m - Minimize sidelobe level of a uniform linear array via spectral factorization\n% broadband_array_min_sidelobe.m - Minimize sidelobe level of an FIR broadband far-field antenna array\n% ant_array_min_sidelobe.m - Minimize sidelobe level of an array with arbitrary 2-D geometry\n% ant_array_min_therm_noise.m - Minimize thermal noise power of an array with arbitrary 2-D geometry\n% polar_plot_ant.m - Plot a polar plot of an antenna array sensitivity\n% spectral_fact.m - Spectral factorization using Kolmogorov 1939 approach\nhelp Contents\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/antenna_array_design/ant_array_min_beamwidth.m", "content": "% Minimize beamwidth of an array with arbitrary 2-D geometry\n% \"Convex optimization examples\" lecture notes (EE364) by S. Boyd\n% \"Antenna array pattern synthesis via convex optimization\"\n% by H. Lebret and S. Boyd\n% (figures are generated)\n%\n% Designs an antenna array such that:\n% - it has unit sensitivity at some target direction\n% - it obeys a constraint on a minimum sidelobe level outside the beam\n% - it minimizes the beamwidth of the pattern\n%\n% This is a quasiconvex problem and can be solved using a bisection.\n%\n% minimize max |y(theta)| for theta outside the beam\n% s.t. y(theta_tar) = 1\n%\n% where y is the antenna array gain pattern (complex function) and\n% variables are w (antenna array weights or shading coefficients).\n% Gain pattern is a linear function of w: y(theta) = w'*a(theta)\n% for some a(theta) describing antenna array configuration and specs.\n%\n% Written for CVX by Almir Mutapcic 02/02/06\n\n% select array geometry\nARRAY_GEOMETRY = '2D_RANDOM';\n% ARRAY_GEOMETRY = '1D_UNIFORM_LINE';\n% ARRAY_GEOMETRY = '2D_UNIFORM_LATTICE';\n\n%********************************************************************\n% problem specs\n%********************************************************************\nlambda = 1; % wavelength\ntheta_tar = 60; % target direction\nmin_sidelobe = -20; % maximum sidelobe level in dB\n\nmax_half_beam = 50; % starting half beamwidth (must be feasible)\n\n%********************************************************************\n% random array of n antenna elements\n%********************************************************************\nif strcmp( ARRAY_GEOMETRY, '2D_RANDOM' )\n % set random seed to repeat experiments\n rand('state',0);\n\n % (uniformly distributed on [0,L]-by-[0,L] square)\n n = 36;\n L = 5;\n loc = L*rand(n,2);\n\n%********************************************************************\n% uniform 1D array with n elements with inter-element spacing d\n%********************************************************************\nelseif strcmp( ARRAY_GEOMETRY, '1D_UNIFORM_LINE' )\n % (unifrom array on a line)\n n = 30;\n d = 0.45*lambda;\n loc = [d*[0:n-1]' zeros(n,1)];\n\n%********************************************************************\n% uniform 2D array with m-by-m element with d spacing\n%********************************************************************\nelseif strcmp( ARRAY_GEOMETRY, '2D_UNIFORM_LATTICE' )\n m = 6; n = m^2;\n d = 0.45*lambda;\n\n loc = zeros(n,2);\n for x = 0:m-1\n for y = 0:m-1\n loc(m*y+x+1,:) = [x y];\n end\n end\n loc = loc*d;\n\nelse\n error('Undefined array geometry')\nend\n\n%********************************************************************\n% construct optimization data\n%********************************************************************\n% build matrix A that relates w and y(theta), ie, y = A*w\ntheta = [1:360]';\nA = kron(cos(pi*theta/180), loc(:,1)') + kron(sin(pi*theta/180), loc(:,2)');\nA = exp(2*pi*i/lambda*A);\n\n% target constraint matrix\n[diff_closest, ind_closest] = min( abs(theta - theta_tar) );\nAtar = A(ind_closest,:);\n\n%*********************************************************************\n% use bisection algorithm to solve the problem\n%*********************************************************************\n\nhalfbeam_bot = 1;\nhalfbeam_top = max_half_beam;\n\ndisp('We are only considering integer values of the half beam-width')\ndisp('(since we are sampling the angle with 1 degree resolution).')\ndisp(' ')\n\nwhile( halfbeam_top - halfbeam_bot > 1)\n % try to find a feasible design for given specs\n halfbeam_cur = ceil( (halfbeam_top + halfbeam_bot)/2 );\n\n % create optimization matrices for the stopband\n ind = find(theta <= (theta_tar-halfbeam_cur) | ...\n theta >= (theta_tar+halfbeam_cur) );\n As = A(ind,:);\n\n % formulate and solve the feasibility antenna array problem\n cvx_begin quiet\n variable w(n) complex\n % feasibility problem\n Atar*w == 1;\n abs(As*w) <= 10^(min_sidelobe/20);\n cvx_end\n\n % bisection\n if strfind(cvx_status,'Solved') % feasible\n fprintf(1,'Problem is feasible for half beam-width = %d degress\\n',...\n halfbeam_cur);\n halfbeam_top = halfbeam_cur;\n else % not feasible\n fprintf(1,'Problem is not feasible for half beam-width = %d degress\\n',...\n halfbeam_cur);\n halfbeam_bot = halfbeam_cur;\n end\nend\n\n% optimal beamwidth\nhalfbeam = halfbeam_top;\nfprintf(1,'\\nOptimum half beam-width for given specs is %d.\\n',halfbeam);\n\n% compute the minimum noise design for the optimal beamwidth\nind = find(theta <= (theta_tar-halfbeam) | ...\n theta >= (theta_tar+halfbeam) );\nAs = A(ind,:);\ncvx_begin quiet\n variable w(n) complex\n minimize( norm( w ) )\n subject to\n Atar*w == 1;\n abs(As*w) <= 10^(min_sidelobe/20);\ncvx_end\n\n%********************************************************************\n% plots\n%********************************************************************\nfigure(1), clf\nplot(loc(:,1),loc(:,2),'o')\ntitle('Antenna locations')\n\n% plot array pattern\ny = A*w;\n\nfigure(2), clf\nymin = -40; ymax = 0;\nplot([1:360], 20*log10(abs(y)), ...\n [theta_tar theta_tar],[ymin ymax],'g--',...\n [theta_tar+halfbeam theta_tar+halfbeam],[ymin ymax],'r--',...\n [theta_tar-halfbeam theta_tar-halfbeam],[ymin ymax],'r--');\nxlabel('look angle'), ylabel('mag y(theta) in dB');\naxis([0 360 ymin ymax]);\n\n% polar plot\nfigure(3), clf\nzerodB = 50;\ndBY = 20*log10(abs(y)) + zerodB;\nplot(dBY.*cos(pi*theta/180), dBY.*sin(pi*theta/180), '-');\naxis([-zerodB zerodB -zerodB zerodB]), axis('off'), axis('square')\nhold on\nplot(zerodB*cos(pi*theta/180),zerodB*sin(pi*theta/180),'k:') % 0 dB\nplot( (min_sidelobe + zerodB)*cos(pi*theta/180), ...\n (min_sidelobe + zerodB)*sin(pi*theta/180),'k:') % min level\ntext(-zerodB,0,'0 dB')\ntext(-(min_sidelobe + zerodB),0,sprintf('%0.1f dB',min_sidelobe));\ntheta_1 = theta_tar+halfbeam;\ntheta_2 = theta_tar-halfbeam;\nplot([0 55*cos(theta_tar*pi/180)], [0 55*sin(theta_tar*pi/180)], 'k:')\nplot([0 55*cos(theta_1*pi/180)], [0 55*sin(theta_1*pi/180)], 'k:')\nplot([0 55*cos(theta_2*pi/180)], [0 55*sin(theta_2*pi/180)], 'k:')\nhold off\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/antenna_array_design/ant_array_min_sidelobe.m", "content": "% Minimize sidelobe level of an array with arbitrary 2-D geometry\n% \"Convex optimization examples\" lecture notes (EE364) by S. Boyd\n% \"Antenna array pattern synthesis via convex optimization\"\n% by H. Lebret and S. Boyd\n% (figures are generated)\n%\n% Designs an antenna array such that:\n% - it minimizes sidelobe level outside the beamwidth of the pattern\n% - it has a unit sensitivity at some target direction\n% - it has nulls (zero sensitivity) at specified direction(s) (optional)\n%\n% This is a convex problem (after sampling it can be formulated as an SOCP).\n%\n% minimize max |y(theta)| for theta outside the beam\n% s.t. y(theta_tar) = 1\n% y(theta_null) = 0 (optional)\n%\n% where y is the antenna array gain pattern (complex function) and\n% variables are w (antenna array weights or shading coefficients).\n% Gain pattern is a linear function of w: y(theta) = w'*a(theta)\n% for some a(theta) describing antenna array configuration and specs.\n%\n% Written for CVX by Almir Mutapcic 02/02/06\n\n% select array geometry\nARRAY_GEOMETRY = '2D_RANDOM';\n% ARRAY_GEOMETRY = '1D_UNIFORM_LINE';\n% ARRAY_GEOMETRY = '2D_UNIFORM_LATTICE';\n\n% select if the optimal array pattern should enforce nulls or not\nHAS_NULLS = 0; % HAS_NULLS = 1;\n\n%********************************************************************\n% problem specs\n%********************************************************************\nlambda = 1; % wavelength\ntheta_tar = 60; % target direction (should be an integer -- discretization)\nhalf_beamwidth = 10; % half beamwidth around the target direction\n\n% angles where we want nulls (optional)\nif HAS_NULLS\n theta_nulls = [95 110 120 140 225];\nend\n\n%********************************************************************\n% random array of n antenna elements\n%********************************************************************\nif strcmp( ARRAY_GEOMETRY, '2D_RANDOM' )\n % set random seed to repeat experiments\n rand('state',0);\n\n % (uniformly distributed on [0,L]-by-[0,L] square)\n n = 40;\n L = 5;\n loc = L*rand(n,2);\n angleRange = 360;\n\n%********************************************************************\n% uniform 1D array with n elements with inter-element spacing d\n%********************************************************************\nelseif strcmp( ARRAY_GEOMETRY, '1D_UNIFORM_LINE' )\n % (unifrom array on a line)\n n = 30;\n d = 0.45*lambda;\n loc = [d*[0:n-1]' zeros(n,1)];\n angleRange = 180;\n\n%********************************************************************\n% uniform 2D array with m-by-m element with d spacing\n%********************************************************************\nelseif strcmp( ARRAY_GEOMETRY, '2D_UNIFORM_LATTICE' )\n m = 6; n = m^2;\n d = 0.45*lambda;\n\n loc = zeros(n,2);\n for x = 0:m-1\n for y = 0:m-1\n loc(m*y+x+1,:) = [x y];\n end\n end\n loc = loc*d;\n angleRange = 360;\n\nelse\n error('Undefined array geometry')\nend\n\n%********************************************************************\n% construct optimization data\n%********************************************************************\n% build matrix A that relates w and y(theta), ie, y = A*w\ntheta = [1:angleRange]';\nA = kron(cos(pi*theta/180), loc(:,1)') + kron(sin(pi*theta/180), loc(:,2)');\nA = exp(2*pi*i/lambda*A);\n\n% target constraint matrix\n[diff_closest, ind_closest] = min( abs(theta - theta_tar) );\nAtar = A(ind_closest,:);\n\n% nulls constraint matrix\nif HAS_NULLS\n Anull = []; ind_nulls = [];\n for k = 1:length(theta_nulls)\n [diff_closest, ind_closest] = min( abs(theta - theta_nulls(k)) );\n Anull = [Anull; A(ind_closest,:)];\n ind_nulls = [ind_nulls ind_closest];\n end\nend\n\n% stopband constraint matrix\nind = find(theta <= (theta_tar-half_beamwidth) | ...\n theta >= (theta_tar+half_beamwidth) );\nif HAS_NULLS, ind = setdiff(ind,ind_nulls); end;\nAs = A(ind,:);\n\n%********************************************************************\n% optimization problem\n%********************************************************************\ncvx_begin\n variable w(n) complex\n minimize( max( abs(As*w) ) )\n subject to\n Atar*w == 1; % target constraint\n if HAS_NULLS % nulls constraints\n Anull*w == 0;\n end\ncvx_end\n\n% check if problem was successfully solved\ndisp(['Problem is ' cvx_status])\nif ~strfind(cvx_status,'Solved')\n return\nend\n\nmin_sidelobe_level = 20*log10( max(abs(As*w)) );\nfprintf(1,'The minimum sidelobe level is %3.2f dB.\\n\\n',...\n min_sidelobe_level );\n\n%********************************************************************\n% plots\n%********************************************************************\nfigure(1), clf\nplot(loc(:,1),loc(:,2),'o')\ntitle('Antenna locations')\n\n% plot array pattern\nif angleRange == 180,\n theta = [1:360]';\n A = [ A; -A ];\nend\ny = A*w;\nfigure(2), clf\nymin = floor(0.1*min_sidelobe_level)*10-10; ymax = 0;\nplot([1:360], 20*log10(abs(y)), ...\n [theta_tar theta_tar],[ymin ymax],'r--',...\n [theta_tar+half_beamwidth theta_tar+half_beamwidth],[ymin ymax],'g--',...\n [theta_tar-half_beamwidth theta_tar-half_beamwidth],[ymin ymax],'g--');\nif HAS_NULLS % add lines that represent null positions\n hold on;\n for k = 1:length(theta_nulls)\n plot([theta_nulls(k) theta_nulls(k)],[ymin ymax],'m--');\n end\n hold off;\nend\nxlabel('look angle'), ylabel('mag y(theta) in dB');\naxis([0 360 ymin ymax]);\n\n% polar plot\nfigure(3), clf\nzerodB = -ymin;\ndBY = 20*log10(abs(y)) + zerodB;\nind = find( dBY <= 0 ); dBY(ind) = 0;\nplot(dBY.*cos(pi*theta/180), dBY.*sin(pi*theta/180), '-');\naxis([-zerodB zerodB -zerodB zerodB]), axis('off'), axis('square')\nhold on\nplot(zerodB*cos(pi*theta/180),zerodB*sin(pi*theta/180),'k:') % 0 dB\nplot( (min_sidelobe_level + zerodB)*cos(pi*theta/180), ...\n (min_sidelobe_level + zerodB)*sin(pi*theta/180),'k:') % min level\ntext(-zerodB,0,'0 dB')\ntt = text(-(min_sidelobe_level + zerodB),0,sprintf('%0.1f dB',min_sidelobe_level));\nset(tt,'HorizontalAlignment','right');\ntheta_1 = theta_tar+half_beamwidth;\ntheta_2 = theta_tar-half_beamwidth;\nplot([0 55*cos(theta_tar*pi/180)], [0 55*sin(theta_tar*pi/180)], 'k:')\nplot([0 55*cos(theta_1*pi/180)], [0 55*sin(theta_1*pi/180)], 'k:')\nplot([0 55*cos(theta_2*pi/180)], [0 55*sin(theta_2*pi/180)], 'k:')\nif HAS_NULLS % add lines that represent null positions\n for k = 1:length(theta_nulls)\n plot([0 55*cos(theta_nulls(k)*pi/180)], ...\n [0 55*sin(theta_nulls(k)*pi/180)], 'k:')\n end\nend\nhold off\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/antenna_array_design/ant_array_min_therm_noise.m", "content": "% Minimize thermal noise power of an array with arbitrary 2-D geometry\n% \"Convex optimization examples\" lecture notes (EE364) by S. Boyd\n% \"Antenna array pattern synthesis via convex optimization\"\n% by H. Lebret and S. Boyd\n% (figures are generated)\n%\n% Designs an antenna array such that:\n% - it has unit a sensitivity at some target direction\n% - obeys constraint for minimum sidelobe level outside the beamwidth\n% - minimizes thermal noise power in y (sigma*||w||_2^2)\n%\n% This is a convex problem described as:\n%\n% minimize norm(w)\n% s.t. y(theta_tar) = 1\n% |y(theta)| <= min_sidelobe for theta outside the beam\n%\n% where y is the antenna array gain pattern (complex function) and\n% variables are w (antenna array weights or shading coefficients).\n% Gain pattern is a linear function of w: y(theta) = w'*a(theta)\n% for some a(theta) describing antenna array configuration and specs.\n%\n% Written for CVX by Almir Mutapcic 02/02/06\n\n% select array geometry\nARRAY_GEOMETRY = '2D_RANDOM';\n% ARRAY_GEOMETRY = '1D_UNIFORM_LINE';\n% ARRAY_GEOMETRY = '2D_UNIFORM_LATTICE';\n\n%********************************************************************\n% problem specs\n%********************************************************************\nlambda = 1; % wavelength\ntheta_tar = 60; % target direction\nhalf_beamwidth = 10; % half beamwidth around the target direction\nmin_sidelobe = -20; % maximum sidelobe level in dB\n\n%********************************************************************\n% random array of n antenna elements\n%********************************************************************\nif strcmp( ARRAY_GEOMETRY, '2D_RANDOM' )\n % set random seed to repeat experiments\n rand('state',0);\n\n % (uniformly distributed on [0,L]-by-[0,L] square)\n n = 36;\n L = 5;\n loc = L*rand(n,2);\n\n%********************************************************************\n% uniform 1D array with n elements with inter-element spacing d\n%********************************************************************\nelseif strcmp( ARRAY_GEOMETRY, '1D_UNIFORM_LINE' )\n % (unifrom array on a line)\n n = 30;\n d = 0.45*lambda;\n loc = [d*[0:n-1]' zeros(n,1)];\n\n%********************************************************************\n% uniform 2D array with m-by-m element with d spacing\n%********************************************************************\nelseif strcmp( ARRAY_GEOMETRY, '2D_UNIFORM_LATTICE' )\n m = 6; n = m^2;\n d = 0.45*lambda;\n\n loc = zeros(n,2);\n for x = 0:m-1\n for y = 0:m-1\n loc(m*y+x+1,:) = [x y];\n end\n end\n loc = loc*d;\n\nelse\n error('Undefined array geometry')\nend\n\n%********************************************************************\n% construct optimization data\n%********************************************************************\n% build matrix A that relates w and y(theta), ie, y = A*w\ntheta = [1:360]';\nA = kron(cos(pi*theta/180), loc(:,1)') + kron(sin(pi*theta/180), loc(:,2)');\nA = exp(2*pi*i/lambda*A);\n\n% target constraint matrix\n[diff_closest, ind_closest] = min( abs(theta - theta_tar) );\nAtar = A(ind_closest,:);\n\n% stopband constraint matrix\nind = find(theta <= (theta_tar-half_beamwidth) | ...\n theta >= (theta_tar+half_beamwidth) );\nAs = A(ind,:);\n\n%********************************************************************\n% optimization problem\n%********************************************************************\ncvx_begin\n variable w(n) complex\n minimize( norm( w ) )\n subject to\n Atar*w == 1;\n abs(As*w) <= 10^(min_sidelobe/20);\ncvx_end\n\n% check if problem was successfully solved\ndisp(['Problem is ' cvx_status])\nif ~strfind(cvx_status,'Solved')\n return\nend\n\nfprintf(1,'The minimum norm of w is %3.2f.\\n\\n',norm(w));\n\n%********************************************************************\n% plots\n%********************************************************************\nfigure(1), clf\nplot(loc(:,1),loc(:,2),'o')\ntitle('Antenna locations')\n\n% plot array pattern\ny = A*w;\n\nfigure(2), clf\nymin = -30; ymax = 0;\nplot([1:360], 20*log10(abs(y)), ...\n [theta_tar theta_tar],[ymin ymax],'r--',...\n [theta_tar+half_beamwidth theta_tar+half_beamwidth],[ymin ymax],'g--',...\n [theta_tar-half_beamwidth theta_tar-half_beamwidth],[ymin ymax],'g--',...\n [0 theta_tar-half_beamwidth],[min_sidelobe min_sidelobe],'r--',...\n [theta_tar+half_beamwidth 360],[min_sidelobe min_sidelobe],'r--');\nxlabel('look angle'), ylabel('mag y(theta) in dB');\naxis([0 360 ymin ymax]);\n\n% polar plot\nfigure(3), clf\nzerodB = 50;\ndBY = 20*log10(abs(y)) + zerodB;\nplot(dBY.*cos(pi*theta/180), dBY.*sin(pi*theta/180), '-');\naxis([-zerodB zerodB -zerodB zerodB]), axis('off'), axis('square')\nhold on\nplot(zerodB*cos(pi*theta/180),zerodB*sin(pi*theta/180),'k:') % 0 dB\nplot( (min_sidelobe + zerodB)*cos(pi*theta/180), ...\n (min_sidelobe + zerodB)*sin(pi*theta/180),'k:') % min level\ntext(-zerodB,0,'0 dB')\ntext(-(min_sidelobe + zerodB),0,sprintf('%0.1f dB',min_sidelobe));\ntheta_1 = theta_tar+half_beamwidth;\ntheta_2 = theta_tar-half_beamwidth;\nplot([0 55*cos(theta_tar*pi/180)], [0 55*sin(theta_tar*pi/180)], 'k:')\nplot([0 55*cos(theta_1*pi/180)], [0 55*sin(theta_1*pi/180)], 'k:')\nplot([0 55*cos(theta_2*pi/180)], [0 55*sin(theta_2*pi/180)], 'k:')\nhold off\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/antenna_array_design/broadband_array_min_sidelobe.m", "content": "% Minimize sidelobe level of an FIR broadband far-field antenna array\n% \"Antenna array pattern synthesis via convex optimization\"\n% by H. Lebret and S. Boyd\n% (figures are generated)\n%\n% Designs a broadband antenna array with the far-field wave model such that:\n% - it minimizes sidelobe level outside the beamwidth of the pattern\n% - it has a unit sensitivity at some target direction and for some frequencies\n%\n% This is a convex problem (after sampling it can be formulated as an SOCP).\n%\n% minimize max |y(theta,f)| for theta,f outside the desired region\n% s.t. y(theta_tar,f_tar) = 1\n%\n% where y is the antenna array gain pattern (complex function) and\n% variables are w (antenna array weights or shading coefficients).\n% Gain pattern is a linear function of w: y(theta,f) = w'*a(theta,f)\n% for some a(theta,f) describing antenna array configuration and specs.\n%\n% Written for CVX by Almir Mutapcic 02/02/06\n\n% select array geometry\nARRAY_GEOMETRY = '2D_UNIFORM_LATTICE';\n% ARRAY_GEOMETRY = '2D_RANDOM';\n\n%********************************************************************\n% problem specs\n%********************************************************************\nP = 2; % number of filter taps at each antenna element\nfs = 8000; % sampling rate = 8000 Hz\nT = 1/fs; % sampling spacing\nc = 2000; % wave speed\n\ntheta_tar = 70; % target direction\nhalf_beamwidth = 10; % half beamwidth around the target direction\nf_low = 1500; % low frequency bound for the desired band\nf_high = 2000; % high frequency bound for the desired band\n\n%********************************************************************\n% random array of n antenna elements\n%********************************************************************\nif strcmp( ARRAY_GEOMETRY, '2D_RANDOM' )\n % set random seed to repeat experiments\n rand('state',0);\n\n % uniformly distributed on [0,L]-by-[0,L] square\n n = 20;\n L = 0.45*(c/f_high)*sqrt(n);\n % loc is a column vector of x and y coordinates\n loc = L*rand(n,2);\n\n%********************************************************************\n% uniform 2D array with m-by-m element with d spacing\n%********************************************************************\nelseif strcmp( ARRAY_GEOMETRY, '2D_UNIFORM_LATTICE' )\n m = 6; n = m^2;\n d = 0.45*(c/f_high);\n\n loc = zeros(n,2);\n for x = 0:m-1\n for y = 0:m-1\n loc(m*y+x+1,:) = [x y];\n end\n end\n loc = loc*d;\n\nelse\n error('Undefined array geometry')\nend\n\n%********************************************************************\n% construct optimization data\n%********************************************************************\n% discretized grid sampling parameters\nnumtheta = 180;\nnumfreqs = 6;\n\ntheta = linspace(1,360,numtheta)';\nfreqs = linspace(500,3000,numfreqs)';\n\nclear Atotal;\nfor k = 1:numfreqs\n % FIR portion of the main matrix\n Afir = kron( ones(numtheta,n), -[0:P-1]/fs );\n\n % cos/sine part of the main matrix\n Alocx = kron( loc(:,1)', ones(1,P) );\n Alocy = kron( loc(:,2)', ones(1,P) );\n Aloc = kron( cos(pi*theta/180)/c, Alocx ) + kron( sin(pi*theta/180)/c, Alocy );\n\n % create the main matrix for each frequency sample\n Atotal(:,:,k) = exp(2*pi*i*freqs(k)*(Afir+Aloc));\nend\n\n% single out indices so we can make equalities and inequalities\ninbandInd = find( freqs >= f_low & freqs <= f_high );\noutbandInd = find( freqs < f_low | freqs > f_high );\nthetaStopInd = find( theta > (theta_tar+half_beamwidth) | ...\n theta < (theta_tar-half_beamwidth) );\n[diffClosest, thetaTarInd] = min( abs(theta - theta_tar) );\n\n% create target and stopband constraint matrices\nAtar = []; As = [];\n% inband frequencies constraints\nfor k = [inbandInd]'\n Atar = [Atar; Atotal(thetaTarInd,:,k)];\n As = [As; Atotal(thetaStopInd,:,k)];\nend\n% outband frequencies constraints\nfor k = [outbandInd]'\n As = [As; Atotal(:,:,k)];\nend\n\n%********************************************************************\n% optimization problem\n%********************************************************************\ncvx_begin\n variable w(n*P) complex\n minimize( max( abs( As*w ) ) )\n subject to\n % target direction equality constraint\n Atar*w == 1;\ncvx_end\n\n% check if problem was successfully solved\ndisp(['Problem is ' cvx_status])\nif ~strfind(cvx_status,'Solved')\n return\nend\n\nfprintf(1,'The minimum sidelobe level is %3.2f dB.\\n\\n',...\n 20*log10(cvx_optval) );\n\n%********************************************************************\n% plots\n%********************************************************************\nfigure(1); clf;\nplot(loc(:,1),loc(:,2),'o')\ntitle('Antenna locations')\naxis('square')\n\n% plots of array patterns (cross sections for different frequencies)\nfigure(2); clf;\nclr = { 'r' 'r' 'b' 'b' 'r' 'r' };\nlinetype = {'--' '--' '-' '-' '--' '--'};\nfor k = 1:numfreqs\n plot(theta, 20*log10(abs(Atotal(:,:,k)*w)), [clr{k} linetype{k}]);\n hold on;\nend\naxis([1 360 -15 0])\ntitle('Passband (blue solid curves) and stopband (red dashed curves)')\nxlabel('look angle'), ylabel('abs(y) in dB');\nhold off;\n\n% cross section polar plots\nfigure(3); clf;\nbw = 2*half_beamwidth;\nsubplot(2,2,1); polar_plot_ant(abs( Atotal(:,:,2)*w ),theta_tar,bw,'f = 1000 (stop)');\nsubplot(2,2,2); polar_plot_ant(abs( Atotal(:,:,3)*w ),theta_tar,bw,'f = 1500 (pass)');\nsubplot(2,2,3); polar_plot_ant(abs( Atotal(:,:,4)*w ),theta_tar,bw,'f = 2000 (pass)');\nsubplot(2,2,4); polar_plot_ant(abs( Atotal(:,:,5)*w ),theta_tar,bw,'f = 2500 (stop)');\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/antenna_array_design/line_array_spec_fact.m", "content": "% Minimize sidelobe level of a uniform linear array via spectral factorization\n% \"FIR Filter Design via Spectral Factorization and Convex Optimization\" example\n% by S.-P. Wu, S. Boyd, and L. Vandenberghe\n% (figures are generated)\n%\n% Designs a uniform linear antenna array using spectral factorization method where:\n% - it minimizes sidelobe level outside the beamwidth of the pattern\n% - it has a constraint on the maximum ripple around unit gain in the beamwidth\n%\n% minimize max |y(theta)| for theta in the stop-beamwidth\n% s.t. 1/delta <= |y(theta)| <= delta for theta in the pass-beamwidth\n%\n% We first replace the look-angle variable theta with the \"frequency\"\n% variable omega, defined by omega = -2*pi*d/lambda*cos(theta).\n% This transforms the antenna pattern y(theta) into a standard discrete\n% Fourier transform of array weights w. Then we apply another change of\n% variables: we replace w with its auto-correlation coefficients r.\n%\n% Now the problem can be solved via spectral factorization approach:\n%\n% minimize max R(omega) for omega in the stopband\n% s.t. (1/delta)^2 <= R(omega) <= delta^2 for omega in the passband\n% R(omega) >= 0 for all omega\n%\n% where R(omega) is the squared magnitude of the y(theta) array response\n% (and the Fourier transform of the autocorrelation coefficients r).\n% Variables are coefficients r. delta is the allowed passband ripple.\n% This is a convex problem (can be formulated as an LP after sampling).\n%\n% Written for CVX by Almir Mutapcic 02/02/06\n\n%********************************************************************\n% problem specs: a uniform line array with inter-element spacing d\n% antenna element locations are at d*[0:n-1]\n% (the array pattern will be symmetric around origin)\n%********************************************************************\nn = 20; % number of antenna elements\nlambda = 1; % wavelength\nd = 0.45*lambda; % inter-element spacing\n\n% passband direction from 30 to 60 degrees (30 degrees bandwidth)\n% transition band is 15 degrees on both sides of the passband\ntheta_pass = 40;\ntheta_stop = 50;\n\n% passband max allowed ripple\nripple = 0.1; % in dB (+/- around the unit gain)\n\n%********************************************************************\n% construct optimization data\n%********************************************************************\n% number of frequency samples\nm = 30*n;\n\n% convert passband and stopband angles into omega frequencies\nomega_zero = -2*pi*d/lambda;\nomega_pass = -2*pi*d/lambda*cos(theta_pass*pi/180);\nomega_stop = -2*pi*d/lambda*cos(theta_stop*pi/180);\nomega_pi = +2*pi*d/lambda;\n\n% build matrix A that relates R(omega) and r, ie, R = A*r\nomega = linspace(-pi,pi,m)';\nA = exp( -j*omega(:)*[1-n:n-1] );\n\n% passband constraint matrix\nAp = A(omega >= omega_zero & omega <= omega_pass,:);\n\n% stopband constraint matrix\nAs = A(omega >= omega_stop & omega <= omega_pi,:);\n\n%********************************************************************\n% formulate and solve the magnitude design problem\n%********************************************************************\ncvx_begin\n variable r(2*n-1,1) complex\n % minimize stopband attenuation\n minimize( max( real( As*r ) ) )\n subject to\n % passband ripple constraints\n (10^(-ripple/20))^2 <= real( Ap*r ) <= (10^(+ripple/20))^2;\n % nonnegative-real constraint for all frequencies\n % a bit redundant: the passband frequencies are already constrained\n real( A*r ) >= 0;\n % auto-correlation symmetry constraints\n imag(r(n)) == 0;\n r(n-1:-1:1) == conj(r(n+1:end));\ncvx_end\n\n% check if problem was successfully solved\nif ~strfind(cvx_status,'Solved')\n return\nend\n\n% find antenna weights by computing the spectral factorization\nw = spectral_fact(r);\n\n% divided by 2 since this is in PSD domain\nmin_sidelobe_level = 10*log10( cvx_optval );\nfprintf(1,'The minimum sidelobe level is %3.2f dB.\\n\\n',...\n min_sidelobe_level);\n\n%********************************************************************\n% plots\n%********************************************************************\n% build matrix G that relates y(theta) and w, ie, y = G*w\ntheta = [-180:180]';\nG = kron( cos(pi*theta/180), [0:n-1] );\nG = exp(2*pi*i*d/lambda*G);\ny = G*w;\n\n% plot array pattern\nfigure(1), clf\nymin = -40; ymax = 5;\nplot([-180:180], 20*log10(abs(y)), ...\n [theta_stop theta_stop],[ymin ymax],'r--',...\n [-theta_pass -theta_pass],[ymin ymax],'r--',...\n [-theta_stop -theta_stop],[ymin ymax],'r--',...\n [theta_pass theta_pass],[ymin ymax],'r--');\nxlabel('look angle'), ylabel('mag y(theta) in dB');\naxis([-180 180 ymin ymax]);\n\n% polar plot\nfigure(2), clf\nzerodB = 50;\ndBY = 20*log10(abs(y)) + zerodB;\nplot(dBY.*cos(pi*theta/180), dBY.*sin(pi*theta/180), '-');\naxis([-zerodB zerodB -zerodB zerodB]), axis('off'), axis('square')\nhold on\nplot(zerodB*cos(pi*theta/180),zerodB*sin(pi*theta/180),'k:') % 0 dB\nplot( (min_sidelobe_level + zerodB)*cos(pi*theta/180), ...\n (min_sidelobe_level + zerodB)*sin(pi*theta/180),'k:') % min level\ntext(-zerodB,0,'0 dB')\ntext(-(min_sidelobe_level + zerodB),0,sprintf('%0.1f dB',min_sidelobe_level));\nplot([0 60*cos(theta_pass*pi/180)], [0 60*sin(theta_pass*pi/180)], 'k:')\nplot([0 60*cos(-theta_pass*pi/180)],[0 60*sin(-theta_pass*pi/180)],'k:')\nplot([0 60*cos(theta_stop*pi/180)], [0 60*sin(theta_stop*pi/180)], 'k:')\nplot([0 60*cos(-theta_stop*pi/180)],[0 60*sin(-theta_stop*pi/180)],'k:')\nhold off\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/antenna_array_design/polar_plot_ant.m", "content": "% Plot a polar plot of an antenna array sensitivity\n% with lines denoting the target direction and beamwidth.\n% This is a helper function used in the broadband antenna examples.\n%\n% Inputs:\n% X: an array of abs(y(theta)) where y is the antenna array pattern\n% theta0: target direction\n% bw: total beamwidth\n% label: a string displayed as the plot legend\n%\n% Original code by Lieven Vandenberghe\n% Updated for CVX by Almir Mutapcic 02/17/06\n\nfunction polar_plot_ant(X,theta0,bw,label)\n\n% polar plot\nnumpoints = length(X);\nthetas2 = linspace(1,360,numpoints)';\n\nplot(X.*cos(pi*thetas2/180), X.*sin(pi*thetas2/180), '-');\nplot(X.*cos(pi*thetas2/180), X.*sin(pi*thetas2/180), '-');\nhold on;\naxis('equal');\n\nplot(cos(pi*[thetas2;1]/180), sin(pi*[thetas2;1]/180), '--');\ntext(1.1,0,'1');\n\nplot([0 cos(pi*theta0/180)], [0 sin(pi*theta0/180)], '--');\nsl1 = find(thetas2-theta0 > bw/2);\nsl2 = find(thetas2-theta0 < -bw/2);\nGsl = max(max(X(sl1)), max(X(sl2)));\nplot(Gsl*cos(pi*thetas2(sl1)/180), Gsl*sin(pi*thetas2(sl1)/180), '--');\nplot(Gsl*cos(pi*thetas2(sl2)/180), Gsl*sin(pi*thetas2(sl2)/180), '--');\n\ntext(-1,1.1,label);\n\naxis off;\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/antenna_array_design/spectral_fact.m", "content": "% Spectral factorization using Kolmogorov 1939 approach\n% (code follows pp. 232-233, Signal Analysis, by A. Papoulis)\n%\n% Computes the minimum-phase impulse response which satisfies\n% given auto-correlation.\n%\n% Input:\n% r: top-half of the auto-correlation coefficients\n% starts from 0th element to end of the auto-corelation\n% should be passed in as a column vector\n% Output\n% h: impulse response that gives the desired auto-correlation\n\nfunction h = spectral_fact(r)\n\n% length of the impulse response sequence\nnr = length(r);\nn = (nr+1)/2;\n\n% over-sampling factor\nmult_factor = 30; % should have mult_factor*(n) >> n\nm = mult_factor*n;\n\n% computation method:\n% H(exp(jTw)) = alpha(w) + j*phi(w)\n% where alpha(w) = 1/2*ln(R(w)) and phi(w) = Hilbert_trans(alpha(w))\n\n% compute 1/2*ln(R(w))\nw = 2*pi*[0:m-1]/m;\nR = exp( -j*kron(w',[-(n-1):n-1]) )*r;\nR = abs(real(R)); % remove numerical noise from the imaginary part\nfigure; plot(20*log10(R));\nalpha = 1/2*log(R);\n\n% find the Hilbert transform\nalphatmp = fft(alpha);\nalphatmp(floor(m/2)+1:m) = -alphatmp(floor(m/2)+1:m);\nalphatmp(1) = 0;\nalphatmp(floor(m/2)+1) = 0;\nphi = real(ifft(j*alphatmp));\n\n% now retrieve the original sampling\nindex = find(rem([0:m-1],mult_factor)==0);\nalpha1 = alpha(index);\nphi1 = phi(index);\n\n% compute the impulse response (inverse Fourier transform)\nh = ifft(exp(alpha1+j*phi1),n);\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/circuit_design/Contents.m", "content": "% Circuit design\n% Optimizing Dominant Time Constant in RC Circuits\n% Optimal Wire and Transistor Sizing for Circuits with Non-Tree Topology\n% Geometric Programming and its Applications to EDA Problems\n% Digital Circuit Optimization via Geometric Programming\n%\n% wire_driver_sizing.m - Combined sizing of drivers, repeaters, and wire\n% wire_sizing_spacing.m - Combined wire sizing and spacing\n% dig_ckt_sizing.m - Digital circuit sizing example (GP)\n% inverter_chain_sizing.m - Digital circuit sizing for an inverter chain (GP)\n% elmore_straight_wire.m - Elmore delay sizing for a straight wire (GP)\n% LC_osc_design.m - LC oscillator design (GP)\n% wire_sizing.m - Optimal interconnect wire sizing\n% clock_mesh.m - Sizing of clock meshes\n% tristate_bus_sizing.m - Tri-state bus sizing and topology design\n% simple_NAND2_gate_design.m - Two-input NAND gate sizing (GP)\n% wire_sizing_topology.m - Wire sizing and topology design\n% simple_step.m - Computes the step response of a linear system\n% plot_four_tapers.m - Plots four different taper desings on a single graph.\nhelp Contents\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/circuit_design/LC_osc_design.m", "content": "% LC oscillator design (GP)\n% Boyd, Kim, and Mohan, \"Geometric programming and its\n% applications to EDA Problems\", (DATE Tutorial 2005), pp.102-113.\n% Original code by S. Mohan\n% Written for CVX by Almir Mutapcic 02/08/06\n%\n% Designs an LC oscillator consisting of a loop inductor, varactors\n% for fine tuning, binary weighted switching capacitors for coarse\n% tuning, cross coupled NMOS transistors, and tail current source.\n% The optimal LC oscillator design iwith minimum power consumption,\n% and limits on phase noise, area, etc... can be formulated as a GP:\n%\n% minimize P\n% s.t. N <= Nmax, A <= Amax, l >= lmin, etc.\n%\n% where optimization variables are loop inductor dimensions D,W,\n% size of varactor Vc, size of switching caps Csw, width and length\n% of transistors Wnmos, Lnmos, bias current Ibias, etc.\n\n%********************************************************************\n% problem data\n%********************************************************************\nVdd = 1.2; % voltage\nCL = 0.2e-12; % load capcitance\nF = 5e9; % operating frequency in Hz\nomega = 2*pi*F; % operating freq. in radians\n\nFOff = 6e5; % offset frequency for phase noise calculation\nLoopGainSpec = 2.0; % loop gain spec\nVbias = 0.2; % non ideality of current mirror\n\n% tuning specs\nT = 0.1; % +/- tuning range as a normalized value\nCvarRatio = 3; % maximum to minimum value of CVar\nCswBits = 3;\nCswSegs = 2^(CswBits);\nCvarCswLSBOverlap = 2;\n\ndisp('Generating the optimal tradeoff curve...')\n\n%********************************************************************\n% optimization of LC oscillator circuit (with tradeoff curve)\n%********************************************************************\n% varying phase noise parameter for the tradeoff curve\npowers = [];\nfor PNSpec=0.7e-12:0.2e-12:1e-11\n fprintf(' PNSpec = %5.2f dBc/Hz: ', 10*log10(PNSpec) );\n cvx_begin gp quiet\n % optimization variables\n variable D; % diameter of loop inductor\n variable W; % width of loop inductor\n variable SRF; % self resonance frequency\n variable l; % length of CMOS transistor\n variable w; % width of CMOS transistor\n variable Imax; % maximum current through CMOS transistor\n variable VOsc; % differential voltage amplitude\n variable CT; % total capacitance of oscillator\n variable Csw; % maximum switching capacitance\n variable Cvar; % minimum variable capacitance\n variable IBias; % bias current\n variable CMaxFreq; % capacitor max frequency\n\n % minimize power = Vdd*IBias;\n minimize( Vdd*IBias )\n subject to\n %*******************************************%\n % loop inductor definitions and constraints %\n %*******************************************%\n SRFSpec = 3*F;\n omegaSRF = 2*pi*SRF;\n\n % inductance\n L = 2.1e-06*D^(1.28)*(W)^(-0.25)*(F)^(-0.01);\n % series resistance\n R = 0.1*D/W+3e-6*D*W^(-0.84)*F^(0.5)+5e-9*D*W^(-0.76)*F^(0.75)+0.02*D*W*F;\n % effective capacitance\n C = 1e-11*D+5e-6*D*W;\n\n % area, tank conductance, and inverse quality factor\n Area = (D+W)^2;\n G = R/(omega*L)^2;\n invQ = R/(omega*L);\n\n % loop constraints\n Area <= 0.25e-6;\n W <= 30e-6;\n 5e-6 <= W;\n 10*W <= D;\n D <= 100*W;\n SRFSpec <= SRF;\n omegaSRF^2*L*C <= 1;\n\n %****************************************%\n % transistor definitions and constraints %\n %****************************************%\n GM = 6e-3*(w/l)^0.6*(Imax/2)^(0.4);\n GD = 4e-10*(w/l)^0.4*(Imax/2)^(0.6)*1/l;\n Vgs = 0.34+1e-8/l+800*(Imax*l/(2*w))^0.7;\n Cgs = 1e-2*w*l;\n Cgd = 1e-9*w;\n Cdb = 1e-9*w;\n\n % transistor constraints\n 2e-6 <= w;\n 0.13e-6 <= l;\n l <= 1e-6;\n\n %***************************************************%\n % overall LC oscillator definitions and constraints %\n %***************************************************%\n invVOsc = (G+GD)/IBias;\n\n % phase noise\n kT4 = 4*1.38e-23*300;\n kT4G = 2*kT4;\n LoopCurrentNoise = kT4*G;\n TransistorCurrentNoise = 0.5*kT4G*GM;\n PN = 1/(160*(FOff*VOsc*CT)^2)*(LoopCurrentNoise+TransistorCurrentNoise);\n\n % capacitance\n Cfix = C+0.5*(CL+Cgs+Cdb+4*Cgd); % fixed capacitance\n CDiffMaxFreq = Cfix+0.5*Cvar;\n\n invLoopGain = (G+0.5*GD)/(0.5*GM);\n\n % LC oscillator constraints\n PN <= PNSpec;\n omega^2*L*CT == 1;\n omega^2*(1+T)^2*L*CMaxFreq == 1;\n 4*T/((1-T^2)^2)*CT <= Csw*(1+CvarCswLSBOverlap/CswSegs);\n Csw*CvarCswLSBOverlap/CswSegs <= 0.5*Cvar*(CvarRatio-1);\n CDiffMaxFreq <= CMaxFreq;\n VOsc+2*Vbias <= 2*Vdd;\n VOsc*invVOsc <= 1;\n invLoopGain*LoopGainSpec <= 1; % loop gain spec\n Vbias+Vgs+IBias/2*R/2 <= Vdd; % bias constraint spec\n Imax == IBias;\n cvx_end\n fprintf('min_power = %3.2f mW\\n', cvx_optval/1e-3);\n powers = [powers cvx_optval];\nend\n\n% plot the tradeoff curve\nPNSpec = 0.7e-12:0.2e-12:1e-11;\nplot(10*log10(PNSpec),powers/1e-3);\nxlabel('Phase Noise (dBc/Hz)')\nylabel('Power (mW)')\ndisp('Optimal tradeoff curve plotted.')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/circuit_design/clock_mesh.m", "content": "% Sizing of clock meshes\n% Section 4, L. Vandenberghe, S. Boyd, and A. El Gamal\n% \"Optimal Wire and Transistor Sizing for Circuits with Non-Tree Topology\"\n% Original by Lieven Vanderberghe\n% Adapted to CVX by Argyris Zymnis - 12/04/05\n% Modified by Michael Grant - 3/8/06\n%\n% We consider the problem of sizing a clock mesh, so as to minimize the\n% total dissipated power under a constraint on the dominant time constant.\n% The numbers of nodes in the mesh is N per row or column (thus n=(N+1)^2\n% in total). We divide the wire into m segments of width xi, i = 1,...,m\n% which is constrained as 0 <= xi <= Wmax. We use a pi-model of each wire\n% segment, with capacitance beta_i*xi and conductance alpha_i*xi.\n% Defining C(x) = C0+x1*C1+x2*C2+...+xm*Cm we have that the dissipated\n% power is equal to ones(1,n)*C(x)*ones(n,1). Thus to minimize the\n% dissipated power subject to a constraint in the widths and a constraint\n% in the dominant time constant, we solve the SDP\n% minimize ones(1,m)*C(x)*ones(m,1)\n% s.t. Tmax*G(x) - C(x) >= 0\n% 0 <= xi <= Wmax\n\n%\n% Circuit parameters\n%\n\ndim=4; % grid is dimxdim (assume dim is even)\nn=(dim+1)^2; % number of nodes\nm=2*dim*(dim+1); % number of wires\n % 1...dim(dim+1) are horizontal segments\n % (numbered rowwise);\n % dim(dim+1)+1 ... 2*dim(dim+1) are vertical\n % (numbered columnwise)\nbeta = 0.5; % capacitance per segment is twice beta times xi\nalpha = 1; % conductance per segment is alpha times xi\nG0 = 1; % source conductance\nC0 = [ 10 2 7 5 3;\n 8 3 9 5 5;\n 1 8 4 9 3;\n 7 3 6 8 2;\n 5 2 1 9 10 ];\nwmax = 1; % upper bound on x\n\n%\n% Build capacitance and conductance matrices\n%\n\nCC = zeros(dim+1,dim+1,dim+1,dim+1,m+1);\nGG = zeros(dim+1,dim+1,dim+1,dim+1,m+1);\n\n% constant term\nCC(:,:,:,:,1) = reshape( diag(C0(:)), dim+1, dim+1, dim+1, dim+1 );\nzo13 = reshape( [1,0;0,1], 2, 1, 2, 1 );\nzo24 = reshape( zo13, 1, 2, 1, 2 );\npn13 = reshape( [1,-1;-1,1], 2, 1, 2, 1 );\npn24 = reshape( pn13, 1, 2, 1, 2 );\nfor i = 1 : dim+1,\n % source conductance\n % first driver in the middle of row 1\n GG(dim/2+1,i,dim/2+1,i,1) = G0;\n for j = 1 : dim,\n % horizontal segments\n node = 1 + j + ( i - 1 ) * dim;\n CC([j,j+1],i,[j,j+1],i,node) = beta * zo13;\n GG([j,j+1],i,[j,j+1],i,node) = alpha * pn13;\n % vertical segments\n node = node + dim * ( dim + 1 );\n CC(i,[j,j+1],i,[j,j+1],node) = beta * zo24;\n GG(i,[j,j+1],i,[j,j+1],node) = alpha * pn24;\n end\nend\n% reshape for ease of use in Matlab\nCC = reshape( CC, n*n, m+1 );\nGG = reshape( GG, n*n, m+1 );\n\n%\n% Compute points the tradeoff curve, and the three sample points\n%\n\nnpts = 50;\ndelays = linspace( 50, 150, npts );\nxdelays = [ 50, 100 ];\nxnpts = length( xdelays );\nareas = zeros(1,npts);\nfor i = 1 : npts + xnpts,\n\n if i > npts,\n xi = i - npts;\n delay = xdelays(xi);\n disp( sprintf( 'Particular solution %d of %d (Tmax = %g)', xi, xnpts, delay ) );\n else,\n delay = delays(i);\n disp( sprintf( 'Point %d of %d on the tradeoff curve (Tmax = %g)', i, npts, delay ) );\n end\n\n %\n % Construct and solve the convex model\n %\n\n cvx_begin sdp quiet\n variable x(m)\n variable G(n,n) symmetric\n variable C(n,n) symmetric\n dual variables Y1 Y2 Y3 Y4 Y5\n minimize( sum( C(:) ) )\n subject to\n G == reshape( GG * [ 1 ; x ], n, n );\n C == reshape( CC * [ 1 ; x ], n, n );\n delay * G - C >= 0;\n 0 <= x <= wmax;\n cvx_end\n\n if i <= npts,\n areas(i) = sum(x);\n else,\n xareas(xi) = sum(x);\n\n %\n % Display sizes\n %\n\n disp( sprintf( 'Solution %d:', xi ) );\n disp( 'Vertical segments:' );\n reshape( x(1:dim*(dim+1),1), dim, dim+1 )\n disp( 'Horizontal segments:' );\n reshape( x(dim*(dim+1)+1:end), dim, dim+1 )\n\n %\n % Determine the step responses\n %\n\n figure(xi+1);\n A = -inv(C)*G;\n B = -A*ones(n,1);\n T = linspace(0,500,2000);\n Y = simple_step(A,B,T(2),length(T));\n indmax = 0;\n indmin = Inf;\n for j = 1 : size(Y,1),\n inds = min(find(Y(j,:) >= 0.5));\n if ( inds > indmax )\n indmax = inds;\n jmax = j;\n end;\n if ( inds < indmin )\n indmin = inds;\n jmin = j;\n end;\n end;\n tthres = T(indmax);\n GinvC = full( G \\ C );\n tdom = max(eig(GinvC));\n elmore = max(sum(GinvC'));\n hold off; plot(T,Y(jmax,:),'-',T,Y(jmin,:)); hold on;\n plot( tdom * [1;1], [0;1], '--', ...\n elmore * [1;1], [0;1], '--', ...\n tthres * [1;1], [0;1], '--');\n axis([0 500 0 1])\n text(tdom,1,'d');\n text(elmore,1,'e');\n text(tthres,1,'t');\n text( T(600), Y(jmax,600), sprintf( 'v%d', jmax ) );\n text( T(600), Y(jmin,600), sprintf( 'v%d', jmin ) );\n title( sprintf( 'Solution %d (Tmax=%g), fastest and slowest step responses', xi, delay ) );\n\n end\n\nend;\n\n%\n% Plot the tradeoff curve\n%\n\nfigure(1)\nind = isfinite(areas);\nplot(areas(ind), delays(ind));\nxlabel('Area');\nylabel('Tdom');\ntitle('Area-delay tradeoff curve');\nhold on\nfor k = 1 : xnpts,\n text( xareas(k), xdelays(k), sprintf( '(%d)', k ) );\nend\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/circuit_design/dig_ckt_sizing.m", "content": "% Digital circuit sizing example (GP)\n% Boyd, Kim, Patil, and Horowitz, \"Digital circuit optimization\n% via geometric programming\"\n% Written for CVX by Almir Mutapcic 02/08/06\n%\n% Solves the problem of choosing gate scale factors x_i to give\n% minimum ckt delay, subject to limits on the total area and power.\n% Uses max gate arrival time T formulation that avoids evaluation\n% of the delay over all paths in the circuit.\n%\n% minimize T_bar\n% s.t. T_j <= T_bar for j an output gate\n% T_j + d_i <= T_i for j in FI(i)\n% P <= Pmax, A <= Amax\n% x >= 1\n%\n% where variables are x and T.\n%\n% We use the circuit topology presented in figure 1 (page 902),\n% where we take gates 1, 3 and 6 to be inverters (INV),\n% gates 2 and 7 to be three input NANDs (NAND3),\n% and gates 4 and 5 to be two input NORs (NOR2).\n\n%********************************************************************\n% user specified data (specify problem constant and ckt topology)\n%********************************************************************\nm = 7; % number of gates\nVdd = 5; % supply voltage\nAmax = 250; % maximum area spec\n\n% gate specs\nINV = struct('Cin',3, 'Cint',3, 'Rdrv',0.48, 'A',3, 'Ileak',0.006);\nNAND3 = struct('Cin',4, 'Cint',6, 'Rdrv',0.48, 'A',8, 'Ileak',0.007);\nNOR2 = struct('Cin',5, 'Cint',6, 'Rdrv',0.48, 'A',10, 'Ileak',0.009);\n\nclear gates;\ngates([1 3 6]) = INV;\ngates([2 7]) = NAND3;\ngates([4 5]) = NOR2;\n\n% primary inputs and primary outputs labels (start with m+1)\nprimary_inputs = [8 9 10];\nprimary_outputs = [11 12];\nM = m + length( primary_inputs ) + length( primary_outputs );\n\n% fan-in cell array\nFI = cell(M,1);\nFI{1} = [8];\nFI{2} = [8 9 10];\nFI{3} = [10];\nFI{4} = [1 2];\nFI{5} = [2 3];\nFI{6} = [4];\nFI{7} = [3 4 5];\nFI{8} = [];\nFI{9} = [];\nFI{10} = [];\nFI{11} = [6];\nFI{12} = [7];\n\n% primary output has Cin capacitance (but has no Cload)\nCin_po = sparse(M,1);\nCin_po(primary_outputs) = [10 10];\n\n% primary input has Cload capacitance (but has no Cin)\nCload_pi = sparse(M,1);\nCload_pi(primary_inputs) = [10 10 10];\n\n% activity frequency of gates and primary inputs\nf_gates = 0.001*ones(m,1);\nf_pi = sparse(M,1);\nf_pi(primary_inputs) = 0.001*[10 10 10];\n\n%********************************************************************\n% derived problem data (computed from user inputs)\n%********************************************************************\n% fan-out cell array (compute it from the fan-in cell array)\nFO = cell(M,1);\nfor gate = [1:m primary_outputs]\n preds = FI{gate};\n for k = 1:length(preds)\n FO{preds(k)}(end+1) = gate;\n end\nend\n\n% input and internal capacitance of gates, and driving resistance\nCin_norm = [gates.Cin]';\nCint_norm = [gates.Cint]';\nRdrv_norm = [gates.Rdrv]';\n\n% area specification for each gate with unit scaling\nA_norm = [gates.A]';\n\n% leakage current of gate i with unit scaling\nIleak_norm = [gates.Ileak]';\n\n%********************************************************************\n% optimization (with tradeoff curve generation)\n%********************************************************************\n% objective is the upper bound on the overall delay\n% and that is the max of arrival times for output gates\noutput_gates = [FI{primary_outputs}];\n\n% varying parameters for the tradeoff curve\nN = 25;\nPmax = linspace(10,20,N);\nmin_delay = zeros(N,1);\ndisp('Generating the optimal tradeoff curve...')\nfor n = 1:N\n fprintf('Pmax = %6.2f: ',Pmax(n));\n cvx_begin gp quiet\n % optimization variables\n variable x(m) % scale factor\n variable T(m) % arrival times\n\n % input capacitance is an affine function of sizes\n Cin = Cin_norm.*x;\n Cint = Cint_norm.*x;\n\n % driving resistance is inversily proportional to sizes\n R = Rdrv_norm./x;\n\n % gate delay is the product of its driving resistance and load cap.\n Cload = cvx( zeros(m,1) );\n for gate = 1:m\n if ~ismember( FO{gate}, primary_outputs )\n Cload(gate) = sum( Cin(FO{gate}) );\n else\n Cload(gate) = Cin_po( FO{gate} );\n end\n end\n\n % delay\n D = 0.69*ones(m,1).*R.*( Cint + Cload );\n\n % total area\n area = A_norm'*x;\n\n % total power calculation\n Pdyn = Vdd^2*sum( f_pi(primary_inputs).*Cload_pi(primary_inputs) ) + ...\n Vdd^2*(f_gates'*(Cint + Cload));\n Pstat = Vdd*Ileak_norm'*x;\n power = Pdyn + Pstat;\n\n minimize( max( T(output_gates) ) )\n subject to\n % constraints\n x >= 1;\n area <= Amax;\n power <= Pmax(n);\n\n % create timing constraints\n for gate = 1:m\n if ~ismember( FI{gate}, primary_inputs )\n for j = FI{gate}\n % enforce T_j + D_j <= T_i over all gates j that drive i\n D(gate) + T(j) <= T(gate);\n end\n else\n % enforce D_i <= T_i for gates i connected to primary inputs\n D(gate) <= T(gate);\n end\n end\n cvx_end\n fprintf( 'delay = %3.2f\\n', cvx_optval );\n min_delay(n) = cvx_optval;\nend\n\n% plot the tradeoff curve\nfigure, clf\nplot(Pmax,min_delay);\nxlabel('Pmax'); ylabel('Dmin');\ntitle(['Tradeoff curve for Amax = ' num2str(Amax)])\ndisp('Optimal tradeoff curve plotted.')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/circuit_design/elmore_straight_wire.m", "content": "% Elmore delay sizing for a straight wire (GP)\n% Boyd, \"Problems in VLSI design\" (Lecture)\n% Written for CVX by Almir Mutapcic 02/08/06\n%\n% We consider the problem of finding optimal width profile\n% for a straight wire segmented into N parts. We want to\n% minimize the Elmore delay, subject to limits on wire width\n% and the total area. We use a pi-model for each wire segment.\n% Problem can be formulated as GP:\n%\n% minimize D\n% s.t. w_min <= w <= w_max\n% area <= Amax\n%\n% where variables are widths w (and arrival times T that are used\n% to formulate the overall delay D expression).\n%\n% Important: We label root node as 1, and all the other nodes as\n% node_label_in_the_paper + 1 (due to Matlab's convention).\n% Also label nodes with increasing numbers downstream.\n\n%********************************************************************\n% user supplied data (problem constants and tree topology)\n%********************************************************************\nN = 10+1; % number of segments (including the root node which is labeled as 1)\n\n% parent node array for the straight wire\n% specifies which node is a unique parent for node i (always have a tree)\nparent = [0:N-1];\n\n% problem constants\nRsource = 0.1;\nl = 1*ones(N-1,1);\nalpha = 1*ones(N-1,1);\nbeta = 1*ones(N-1,1);\ngamma = 1*ones(N-1,1);\n\n% load capacitance at each node\nCload = [0; ones(N-1,1)];\n\n% minimum and maximum width and area specification\nWmin = 1;\nWmax = 10;\nAmax = 50;\n\n%********************************************************************\n% derived data (computed from user's data)\n%********************************************************************\n% compute children cell array (evaluate who are children for each node)\nchildren = cell(N,1);\nleafs = [];\nfor node = [1:N]\n children{node} = find(parent == node);\n if isempty(children{node})\n leafs(end+1) = node; % leafs have no children\n end\nend\n\n%********************************************************************\n% optimization\n%********************************************************************\n\ndisp('Generating the tradeoff curve...')\nDarray = []; widths = [];\nfor Amax = [10.05 10.5 11 12:2:20 22.5 25:5:60]\n fprintf( 'Amax = %5.2f: ', Amax );\n cvx_begin gp quiet\n % optimization variables\n variable w(N-1) % wire width\n variable T(N) % arrival time (Elmore delay to node i)\n\n % objective is the critical Elmore delay\n minimize( max( T(leafs) ) )\n subject to\n\n % wire segment resistance is inversely proportional to widths\n R = alpha.*l./w;\n R = [Rsource; R];\n\n % wire segment capacitance is an affine function of widths\n C_bar = beta.*l.*w + gamma.*l;\n C_bar = [0; C_bar];\n\n % compute common capacitances for each node (C_tilde in GP tutorial)\n C_tilde = cvx( zeros(N,1) );\n for node = [1:N]\n C_tilde(node,1) = Cload(node);\n for k = parent(node)\n if k > 0; C_tilde(node,1) = C_tilde(node,1) + C_bar(k); end;\n end\n for k = children{node}\n C_tilde(node,1) = C_tilde(node,1) + C_bar(k);\n end\n end\n\n % now compute total downstream capacitances\n C_total = C_tilde;\n for node = N:-1:1\n for k = children{node}\n C_total(node,1) = C_total(node,1) + C_total(k,1);\n end\n end\n\n % generate Elmore delay constraints\n R(1)*C_total(1) <= T(1,1);\n for node = 2:N\n R(node)*C_total(node) + T(parent(node),1) <= T(node,1);\n end\n\n % collect all the constraints\n sum(w.*l) <= Amax;\n Wmin <= w <= Wmax;\n cvx_end\n % display and store computed values\n fprintf('delay = %3.2f\\n',cvx_optval);\n Darray = [Darray cvx_optval];\n widths = [widths w];\nend\n\n% indices of four taper designs on the tradeoff curve\nAmax = [10.05 10.5 11 12:2:20 22.5 25:5:60];\nA11ind = find(Amax == 11);\nA20ind = find(Amax == 20);\nA35ind = find(Amax == 35);\nA50ind = find(Amax == 50);\n\n% plot the tradeoff curve\nfigure, clf\nplot(Darray,Amax, ...\n Darray(A11ind),Amax(A11ind),'ro',...\n Darray(A20ind),Amax(A20ind),'ro',...\n Darray(A35ind),Amax(A35ind),'ro',...\n Darray(A50ind),Amax(A50ind),'ro');\nxlabel('Elmore delay D'); ylabel('Amax');\ndisp('Optimal tradeoff curve plotted.')\n\n% plot four taper designs\nfigure, clf\nw1 = widths(:,A50ind);\nw2 = widths(:,A35ind);\nw3 = widths(:,A20ind);\nw4 = widths(:,A11ind);\nplot_four_tapers(w1,w2,w3,w4);\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/circuit_design/inverter_chain_sizing.m", "content": "% Digital circuit sizing for an inverter chain (GP)\n% Boyd, Kim, Patil, and Horowitz, \"Digital circuit optimization\n% via geometric programming\"\n% Written for CVX by Almir Mutapcic 02/08/06\n%\n% We consider a chain of N inverters driving a load capacitance CL.\n% The problem is to find optimal scale factors for the inverter\n% that minimize the sum of them (area), while obeying constraints\n% on the maximum delay through the circuit, and minimum and maximum\n% limits on scale factors. There are no limits on the total power.\n% (For more details about the inverter chain see sec. 2.1.11 in the paper.)\n%\n% minimize sum(x)\n% s.t. T_j <= Dmax for j an output gate\n% T_j + d_i <= T_i for j in FI(i)\n% x_min <= x <= x_max\n%\n% where variables are x and T.\n% Here we use data structures and digital circuit models from the\n% referenced paper.\n\n%********************************************************************\n% problem data\n%********************************************************************\nN = 8; % number of inverters\nCL = 20; % capacitance load\nDmax = 20; % maximum delay through the circuit\nx_min = 1; % minimum scale factor\nx_max = 20; % maximum scale factor\n\n% circuit labeling convention:\n% label primary input (input to the first inverter in the chain) with N+1\n% label primary output (output of the last inverter in the chain) with N+2\n% label inverters in the chain with 1,2,...,N based on their location\n\n% primary input and primary output labels (start with N+1)\nprimary_inputs = [N+1];\nprimary_outputs = [N+2];\nM = N + length( primary_inputs ) + length( primary_outputs );\n\n% fan-in cell array for a straight chain of inverters\nFI{1} = [N+1]; % fan-in of the first inverter is the primary input\nfor k = 2:N\n FI{k} = [k-1]; % fan-in of other inverters is the inverter feeding into them\nend\nFI{N+2} = [N]; % fan-in of the primary output is the last inverter in the chain\n\n% fan-out cell array\n% (will be computed from the fan-in cell array, no need to modify)\nFO = cell(M,1);\nfor gate = [1:N primary_outputs]\n preds = FI{gate};\n for k = 1:length(preds)\n FO{preds(k)}(end+1) = gate;\n end\nend\n\n% input and internal capacitance of gates and the driving resistance\nCin_norm = ones(N,1);\nCint_norm = ones(N,1);\nRdrv_norm = ones(N,1);\n\n% place extra capacitance before the input of the 5th inverter\nCin_norm(5) = 80;\n\n% primary output has Cin capacitance (but has no Cload)\nCin_po = sparse(M,1);\nCin_po(primary_outputs) = CL;\n\n% primary input has Cload capacitance (but has no Cin)\nCload_pi = sparse(M,1);\nCload_pi(primary_inputs) = 1;\n\n%********************************************************************\n% optimization\n%********************************************************************\ncvx_begin gp\n % optimization variables\n variable x(N) % sizes\n variable T(N) % arrival times\n\n % minimize the sum of scale factors subject to above constraints\n minimize( sum(x) )\n subject to\n\n % input capacitance is an affine function of sizes\n Cin = Cin_norm.*x;\n Cint = Cint_norm.*x;\n\n % driving resistance is inversily proportional to sizes\n R = Rdrv_norm./x;\n\n % gate delay is the product of its driving resistance and load cap.\n Cload = cvx( zeros(N,1) );\n for gate = 1:N\n if ~ismember( FO{gate}, primary_outputs )\n Cload(gate) = sum( Cin(FO{gate}) );\n else\n Cload(gate) = Cin_po( FO{gate} );\n end\n end\n\n % delay\n D = 0.69*ones(N,1).*R.*( Cint + Cload );\n\n % create timing constraints\n for gate = 1:N\n if ~ismember( FI{gate}, primary_inputs )\n for j = FI{gate}\n % enforce T_j + D_j <= T_i over all gates j that drive i\n D(gate) + T(j) <= T(gate);\n end\n else\n % enforce D_i <= T_i for gates i connected to primary inputs\n D(gate) <= T(gate);\n end\n end\n\n % circuit delay is the max of arrival times for output gates\n output_gates = [FI{primary_outputs}];\n circuit_delay = max( T(output_gates) );\n\n % collect all the constraints\n circuit_delay <= Dmax;\n x_min <= x <= x_max;\ncvx_end\n\n% message about extra capacitance and result display\ndisp(' ')\ndisp(['Note: there is an extra capacitance between the 4th and 5th inverter'...\n ' in the chain.'])\nfprintf(1,'\\nOptimal scale factors are: \\n'), x\n\n% plot scale factors and maximum delay for inverter i\nclose all;\nsubplot(2,1,1); plot([1:N],T,'g--',[1:N],T,'bo');\nylabel('maximum delay T')\nsubplot(2,1,2); stem([1:N],x);\nylabel('scale factor x')\nxlabel('inverter stage')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/circuit_design/plot_four_tapers.m", "content": "function plot_four_tapers(w1,w2,w3,w4)\n% Plots four different taper desings on a single graph.\n% Inputs:\n% [w1 w2 w3 w4]: an array of taper widths\n%\n% Original code written by Lieven Vandenberghe.\n% Updated by Almir Mutapcic 12/2005\n\nn = size(w1,1);\ncolormap(gray);\nwidth = zeros(2*n,4);\nwidth([1:2:2*n-1],:) = [w1 w2 w3 w4];\nwidth([2:2:2*n],:) = [w1 w2 w3 w4];\nx = zeros(2*n,1);\nx([1:2:2*n-1],:) = [0:n-1]';\nx([2:2:2*n],:) = [1:n]';\n\n% first solution\nsubplot(411)\nhold off\nplot([x;flipud(x);0], [0.5*(width(1,1)-width(:,1)); ...\n flipud(0.5*(width(1,1)+width(:,1))); 0]);\nhold on;\nfill([x;flipud(x);0]', [0.5*(width(1,1)-width(:,1)); ...\n flipud(0.5*(width(1,1)+width(:,1))); 0]', 0.9*ones(size([x;x;0]'))); \ncaxis([-1,1]);\nplot([x;flipud(x);0], [0.5*(width(1,1)-width(:,1)); ...\n flipud(0.5*(width(1,1)+width(:,1))); 0]);\nylabel('width');\n\n% second solution\nsubplot(412)\nhold off\nplot([x;flipud(x);0], [0.5*(width(1,2)-width(:,2)); ...\n flipud(0.5*(width(1,2)+width(:,2))); 0]);\nhold on;\nfill([x;flipud(x);0]', [0.5*(width(1,2)-width(:,2)); ...\n flipud(0.5*(width(1,2)+width(:,2))); 0]', 0.9*ones(size([x;x;0]'))); \ncaxis([-1,1]);\nplot([x;flipud(x);0], [0.5*(width(1,2)-width(:,2)); ...\n flipud(0.5*(width(1,2)+width(:,2))); 0]);\nylabel('width');\n\n% third solution\nsubplot(413)\nhold off\nplot([x;flipud(x);0], [0.5*(width(1,3)-width(:,3)); ...\n flipud(0.5*(width(1,3)+width(:,3))); 0]);\nhold on;\nfill([x;flipud(x);0]', [0.5*(width(1,3)-width(:,3)); ...\n flipud(0.5*(width(1,3)+width(:,3))); 0]', 0.9*ones(size([x;x;0]'))); \ncaxis([-1,1]);\nplot([x;flipud(x);0], [0.5*(width(1,3)-width(:,3)); ...\n flipud(0.5*(width(1,3)+width(:,3))); 0]);\nylabel('width');\n\n% fourth solution\nsubplot(414)\nhold off\nplot([x;flipud(x);0], [0.5*(width(1,4)-width(:,4)); ...\n flipud(0.5*(width(1,4)+width(:,4))); 0]);\nhold on;\nfill([x;flipud(x);0]', [0.5*(width(1,4)-width(:,4)); ...\n flipud(0.5*(width(1,4)+width(:,4))); 0]', 0.9*ones(size([x;x;0]'))); \ncaxis([-1,1]);\nplot([x;flipud(x);0], [0.5*(width(1,4)-width(:,4)); ...\n flipud(0.5*(width(1,4)+width(:,4))); 0]);\nylabel('width');\nxlabel('segment');\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/circuit_design/simple_NAND2_gate_design.m", "content": "% Two-input NAND gate sizing (GP)\n% Boyd, Kim, Patil, and Horowitz, \"Digital circuit optimization\n% via geometric programming\"\n% Written for CVX by Almir Mutapcic 02/08/06\n% (a figure is generated)\n%\n% This is an example taken directly from the paper:\n%\n% Digital circuit optimization via geometrical programming\n% by Boyd, Kim, Patil, and Horowitz\n% Operations Research 53(6): 899-932, 2005.\n%\n% Solves the problem of choosing device widths w_i for the given\n% NAND2 gate in order to achive minimum Elmore delay for different\n% gate transitions, subject to limits on the device widths,\n% gate area, power, and so on. The problem is a GP:\n%\n% minimize D = max( D_1, ..., D_k ) for k transitions\n% s.t. w_min <= w <= w_max\n% A <= Amax, etc.\n%\n% where variables are widths w.\n%\n% This code is specific to the NAND2 gate shown in figure 19\n% (page 926) of the paper. All the constraints and the objective\n% are hard-coded for this particular circuit.\n\n%********************************************************************\n% problem data and hard-coded GP specs (evaluate all transitions)\n%********************************************************************\nN = 4; % number of devices\nCload = 12; % load capacitance\nVdd = 1.5; % voltage\n\n% device specs\nNMOS = struct('R',0.4831, 'Cdb',0.6, 'Csb',0.6, 'Cgb',1, 'Cgs',1);\nPMOS = struct('R',2*0.4831, 'Cdb',0.6, 'Csb',0.6, 'Cgb',1, 'Cgs',1);\n\n% maximum area and power specification\nAmax = 24;\nwmin = 1;\n\n% varying parameters for the tradeoff curve\nNpoints = 25;\nAmax = linspace(5,45,Npoints);\nDopt = [];\n\ndisp('Generating the optimal tradeoff curve...')\nneed_sedumi = strncmpi(cvx_solver,'sdpt',4);\nif need_sedumi,\n warning('This model does not converge with SDPT3... switching to SeDuMi.');\nend\nfor k = 1:Npoints\n fprintf(1,' Amax = %5.2f:', Amax(k));\n cvx_begin gp quiet\n if need_sedumi,\n cvx_solver sedumi\n end\n \n % device width variables\n variable w(N)\n\n % device specs\n device(1:2) = PMOS; device(3:4) = NMOS;\n\n for num = 1:N\n device(num).R = device(num).R/w(num);\n device(num).Cdb = device(num).Cdb*w(num);\n device(num).Csb = device(num).Csb*w(num);\n device(num).Cgb = device(num).Cgb*w(num);\n device(num).Cgs = device(num).Cgs*w(num);\n end\n\n % capacitances\n C1 = sum([device(1:3).Cdb]) + Cload;\n C2 = device(3).Csb + device(4).Cdb;\n\n % input capacitances\n Cin_A = sum([ device([2 3]).Cgb ]) + sum([ device([2 3]).Cgs ]);\n Cin_B = sum([ device([1 4]).Cgb ]) + sum([ device([1 4]).Cgs ]);\n\n % resistances\n R = [device.R]';\n\n % area definition\n area = sum(w);\n\n % delays and dissipated energies for all six possible transitions\n % transition 1 is A: 1->1, B: 1->0, Z: 0->1\n D1 = R(1)*(C1 + C2);\n E1 = (C1 + C2)*Vdd^2/2;\n % transition 2 is A: 1->0, B: 1->1, Z: 0->1\n D2 = R(2)*C1;\n E2 = C1*Vdd^2/2;\n % transition 3 is A: 1->0, B: 1->0, Z: 0->1\n % D3 = C1*R(1)*R(2)/(R(1) + R(2)); % not a posynomial\n E3 = C1*Vdd^2/2;\n % transition 4 is A: 1->1, B: 0->1, Z: 1->0\n D4 = C1*R(3) + R(4)*(C1 + C2);\n E4 = (C1 + C2)*Vdd^2/2;\n % transition 5 is A: 0->1, B: 1->1, Z: 1->0\n D5 = C1*(R(3) + R(4));\n E5 = (C1 + C2)*Vdd^2/2;\n % transition 6 is A: 0->1, B: 0->1, Z: 1->0\n D6 = C1*R(3) + R(4)*(C1 + C2);\n E6 = (C1 + C2)*Vdd^2/2;\n\n % objective is the worst-case delay\n minimize( max( [D1 D2 D4] ) )\n subject to\n area <= Amax(k);\n w >= wmin;\n cvx_end\n % display and store computed values\n fprintf(1,' delay = %3.2f\\n',cvx_optval);\n Dopt = [Dopt cvx_optval];\nend\n\n% plot the tradeoff curve\nplot(Dopt,Amax);\nxlabel('Dmin'); ylabel('Amax');\ndisp('Optimal tradeoff curve plotted.')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/circuit_design/simple_step.m", "content": "% Computes the step response of a linear system\r\n\r\nfunction X = simple_step(A,B,DT,N)\r\nn = size(A,1);\r\nAd = expm( full( A * DT ) );\r\nBd = ( Ad - eye(n) ) * B;\r\nBd = A \\ Bd;\r\nX = zeros(n,N);\r\nfor k = 2 : N,\r\n X(:,k) = Ad*X(:,k-1)+Bd;\r\nend\r\n\r\n\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/circuit_design/tristate_bus_sizing.m", "content": "% Tri-state bus sizing and topology design\n% Section 5.4, L. Vandenberghe, S. Boyd, and A. El Gamal\n% \"Optimizing dominant time constant in RC circuits\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX by Joelle Skaf - 11/27/05\n% Modified by Michael Grant - 3/8/06\n%\n% We optimize a tri-state bus connecting six nodes ( The model for the bus\n% is shown in the paper, fig.16). The total wire area is sum_{i>j} lij*xij\n% The bus can be driven from any node. When node i drives the bus, the ith\n% switch is closed and the others are all open. Thus we really have six\n% different circuits, each corresponding to a given node driving the bus.\n% we require that the dominant time constant of each of the six drive\n% configuration circuits has dominant time constant less than Tmax.\n% The problem can be formulated with the following SDP:\n% minimize sum_{i>j}(x_ij*l_ij)\n% s.t. 0 <= xij <= wmax\n% Tmax*(G(x) + GE_kk) - C(x) >= 0 , 1 <=k<= 6\n% The matrix E_kk is zero except for the kth diagonal element, which is 1.\n\n%\n% Circuit parameters\n%\n\nn=6; % number of nodes\nm=15; % number of wires\nbeta = 0.5; % capacitance per segment is twice beta times xi*li\nalpha = 1; % conductance per segment is alpha times xi/li\nG0 = 1; % source conductance\nC0 = 10; % load capacitor\nwmax = 1; % upper bound on x\n\n%\n% Node positions\n%\n\nxpos = [ 0 1 6 8 -4 -1 ;\n 0 -1 4 -2 1 4 ] ;\nX11 = repmat(xpos(1,:),n,1);\nX12 = repmat(xpos(1,:)',1,n);\nX21 = repmat(xpos(2,:),n,1);\nX22 = repmat(xpos(2,:)',1,n);\nLL = abs(X11-X12) + abs(X21-X22);\nL = tril(LL);\nL = L(L>0);\n\n%\n% Construct the capacitance and conductance matrices\n% C(x) = C0 + w11 * C1 + w21 * C2 + ...\n% G(x) = G0 + w11 * G1 + w21 * G2 + ...\n% and we assemble the coefficient matrices together as follows:\n% CC = [ C0(:) C1(:) C2(:) ... ]\n% GG = [ G0(:) G1(:) G2(:) ... ]\n%\n\nCC = zeros(n,n,m+1);\nGG = zeros(n,n,m+1);\nCC(:,:,1) = C0 * eye(n);\n% segment capacitances and conductances\nk3 = 1;\nfor k1 = 1 : 5,\n for k2 = k1 + 1 : 6,\n CC([k1,k2],[k1,k2],k3) = beta *[1, 0; 0,1]*L(k3);\n GG([k1,k2],[k1,k2],k3) = alpha*[1,-1;-1,1]/L(k3);\n k3 = k3 + 1;\n end\nend\nGG = reshape( GG, n*n, m+1 );\nCC = reshape( CC, n*n, m+1 );\n\n%\n% Compute points the tradeoff curve and the two desired points\n%\n\n% points on the tradeoff curve\nnpts = 50;\ndelays = linspace( 410, 2000, npts );\nxdelays = [ 410, 2000 ];\nxnpts = length(xdelays);\nareas = zeros(1,npts);\nxareas = zeros(1,xnpts);\nsizes = zeros(m,xnpts);\nfor i = 1 : npts + xnpts,\n\n if i > npts,\n xi = i - npts;\n delay = xdelays(xi);\n disp( sprintf( 'Particular solution %d of %d (Tmax = %g)', xi, xnpts, delay ) );\n else\n delay = delays(i);\n disp( sprintf( 'Point %d of %d on the tradeoff curve (Tmax = %g)', i, npts, delay ) );\n end\n\n %\n % Construct and solve the convex model\n %\n\n cvx_begin sdp quiet\n variable x(m)\n variable G(n,n) symmetric\n variable C(n,n) symmetric\n minimize( L'*x )\n G == reshape( GG * [ 1 ; x ], n, n );\n C == reshape( CC * [ 1 ; x ], n, n );\n for k = 1 : n,\n delay * G - C + sparse(k,k,delay,n,n) >= 0;\n end\n 0 <= x <= wmax;\n cvx_end\n\n if i <= npts,\n areas(i) = cvx_optval;\n else\n xareas(xi) = cvx_optval;\n sizes(:,xi) = x;\n\n %\n % Plot the step response\n %\n\n T = linspace(0,2*delay,1000);\n for inp = 1 : 6,\n figure(6*xi-5+inp);\n GQ = G + sparse(inp,inp,delay,n,n);\n A = -inv(C)*GQ;\n B = -A*ones(n,1);\n Y = simple_step(A,B,T(2),length(T));\n hold off; plot(T,Y,'-'); hold on;\n ind=0;\n for j=1:size(Y,1),\n ind = max(min(find(Y(j,:)>=0.5)),ind);\n end\n tdom = max(eig(inv(GQ)*C));\n elmore = max(sum((inv(GQ)*C)'));\n tthres = T(ind);\n plot( tdom * [1;1], [0;1], '--', ...\n elmore * [1;1], [0;1], '--', ...\n tthres * [1;1], [0;1], '--');\n text(tdom, 0,'d');\n text(elmore,0,'e');\n text(tthres,0,'t');\n ylabel('Voltage');\n title(sprintf('Step response for solution %d, Tmax=%d, with switch %d is closed',xi,delay,inp));\n end\n\n end\n\nend;\n\n%\n% Plot the tradeoff curve\n%\n\nfigure(1)\nind = isfinite(areas);\nplot(areas(ind), delays(ind));\nxlabel('Area');\nylabel('Tdom');\ntitle('Area-delay tradeoff curve');\nhold on\nfor k = 1 : xnpts,\n text( xareas(k), xdelays(k), sprintf( '(%d)', k ) );\nend\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/circuit_design/wire_driver_sizing.m", "content": "% Combined sizing of drivers, repeaters, and wire\n% Section 5.2, L. Vandenberghe, S. Boyd, and A. El Gamal\n% \"Optimizing dominant time constant in RC circuits\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX by Joelle Skaf - 11/25/05\n% Modified by Michael Grant - 3/8/06\n%\n% The first driver drives an interconnect wire, modeled as n RC Pi segments\n% connected to a repeater, which drives a capacitive load through another n\n% segment wires. The problem is to determine the sizes of the wire segments\n% (x1, . . . , x40) and the sizes of the driver & repeater d1 and d2.\n% We want to minimize area subject to bound on the combined delay Tdom1 +\n% Tdom2 of the two stages.\n% minimize L(d1 + d2) + sum(xi*li)\n% s.t. 0 <= xi <= wmax\n% d1 >=0 , d2 >= 0\n% (Tmax/2)G1(x, d1, d2) - C1(x,d2) >= 0\n% (Tmax/2)G2(x, d1, d2) - C2(x) >= 0\n\n%\n% Circuit parameters\n%\n\nn = 21; % number of nodes per wire\nm = n-1; % number of segments per wire\ng = 1.0; % output conductance is g times driver size\nc0 = 1.0; % input capacitance of driver is co + c*driver size\nc = 3.0;\nalpha = 10; % wire segment: two capacitances beta*width\nbeta = 0.5; % wire segment: conductance alpha*width\nC = 50; % external load\nL = 10.0; % area is sum xi + L*(d1+d2)\nwmax = 2.0; % maximum wire width\ndmax = 100.0; % maximum driver size\n\n%\n% Construct the capacitance and conductance matrices\n% C1(x) = C10 + w11 * C11 + w21 * C12 + ...\n% C2(x) = C20 + w11 * C21 + w21 * C22 + ...\n% G1(x) = G10 + w11 * G11 + w21 * G12 + ...\n% G2(x) = G20 + w11 * G21 + w21 * G22 + ...\n% and we assemble the coefficient matrices together as follows:\n% CC = [ C10(:) C11(:) C12(:) ... ; C20(:) C21(:) C22(:) ... ]\n% GG = [ G10(:) G11(:) G12(:) ... ; C20(:) C21(:) C22(:) ... ]\n%\n%\n\nCC = zeros(n,n,2,2*m+3);\nGG = zeros(n,n,2,2*m+3);\n% load on first circuit from second driver = c0 + c * d2\nCC(n,n,1,1 ) = c0;\nCC(n,n,1,2*m+3) = c;\n% external load\nCC(n,n,2,1) = C;\n% output conductances of drivers\nGG(1,1,1,2*m+2) = g;\nGG(1,1,2,2*m+3) = g;\n% segment capacitances and conductances\nfor i = 1 : n-1,\n CC(i:i+1,i:i+1,1, i+1) = beta * [1, 0; 0,1];\n CC(i:i+1,i:i+1,2,m+i+1) = beta * [1, 0; 0,1];\n GG(i:i+1,i:i+1,1, i+1) = alpha * [1,-1;-1,1];\n GG(i:i+1,i:i+1,2,m+i+1) = alpha * [1,-1;-1,1];\nend\n% reshape for Matlab use\nCC = reshape( CC, n*n*2, 2*m+3 );\nGG = reshape( GG, n*n*2, 2*m+3 );\n\n%\n% Compute points the tradeoff curve and the sample solution\n%\n\nnpts = 50;\ndelays = linspace( 150, 500, npts );\nxdelays = 189;\nxnpts = length( xdelays );\nareas = zeros( 1, npts );\nxareas = zeros( 1, xnpts );\nfor i = 1 : npts + xnpts,\n\n if i > npts,\n xi = i - npts;\n delay = xdelays(xi);\n disp( sprintf( 'Particular solution %d of %d (Tmax = %g)', xi, xnpts, delay ) );\n else,\n delay = delays(i);\n disp( sprintf( 'Point %d of %d on the tradeoff curve (Tmax = %g)', i, npts, delay ) );\n end\n\n %\n % Construct and solve the convex model\n %\n\n cvx_begin sdp quiet\n variables w(m,2) d(1,2)\n variable G(n,n,2) symmetric\n variable C(n,n,2) symmetric\n minimize( L * sum(d) + sum(w(:)) );\n G == reshape( GG * [ 1 ; w(:) ; d(:) ], n, n, 2 );\n C == reshape( CC * [ 1 ; w(:) ; d(:) ], n, n, 2 );\n % This is actually two LMIs, one for each circuit\n (delay/2) * G - C >= 0;\n 0 <= w(:) <= wmax;\n d(:) >= 0;\n cvx_end\n\n if i <= npts,\n areas(i) = cvx_optval;\n else\n xareas(xi) = cvx_optval;\n\n %\n % Draw solution, plotting drivers as a block with width os\n % and height L/(2*os).\n %\n\n figure(2*xi);\n os = 3;\n m2 = 2 * m;\n ss = max( L * max( d ) / os, max( w(:) ) );\n x = reshape( [ 1 : m ; 1 : m ], 1, m2 );\n y = 0.5 * [ - w(x,:) ; w(x(end:-1:1),:) ; + w(1,:) ];\n yd = ( 0.5 * L / os ) * [ -d ; -d ; +d ; +d ; -d ];\n x = reshape( [ 0 : m - 1 ; 1 : m ], m2, 1 );\n x = [ x ; x(end:-1:1,:) ; 0 ];\n xd = [ 0 ; os ; os ; 0 ; 0 ];\n x = x + os + 0.5;\n xd = [ xd, xd + os + m + 1 ];\n x = [ x, x + os + m + 1 ];\n fill( x, y, 0.9 * ones(size(y)), xd, yd, 0.9 * ones(size(yd)) );\n hold on\n plot( x, y, '-', xd, yd, '-' );\n axis( [-0.5, 2*m+2*os+2, -0.5*ss-0.1,0.5*ss+0.1 ] );\n set( gca, 'XTick', [x(1,1),x(1,1)+m,x(1,2),x(1,2)+m] );\n set( gca, 'XTicklabel', {'0',num2str(m),'0',num2str(m)} );\n colormap(gray);\n caxis([-1,1])\n title(sprintf('Sample solution (%d), Tmax = %g', xi, delay ));\n\n %\n % Build the state space models and plot step responses\n %\n\n figure(2*xi+1);\n T = linspace(0,1000,1000);\n tdom = []; telm = []; tthresh = []; Y = {};\n for k = 1 : 2,\n A = -inv(C(:,:,k))*G(:,:,k);\n B = -A* ones(n,1);\n tdom(k) = max(eig(inv(G(:,:,k))*C(:,:,k)));\n telm(k) = max(sum((inv(G(:,:,k))*C(:,:,k))'));\n Y{k} = simple_step(A,B,T(2),length(T));\n Y{k} = Y{k}(n,:);\n tthresh(k) = min(find(Y{k}>=0.5));\n end\n plot( T, Y{1}, '-', T, Y{2}, '-' );\n axis([0 T(500) 0 1]);\n xlabel('time');\n ylabel('v');\n hold on;\n text(tdom(1),0,'d1');\n text(telm(2),0,'e1');\n text(tthresh(1),0,'t1');\n text(tdom(1)+tdom(2),0,'d2');\n text(tdom(1)+telm(2),0,'e2');\n text(tdom(1)+tthresh(2),0,'t2');\n plot(tdom(1)*[1;1],[0;1],'--');\n plot(telm(1)*[1;1],[0;1],'--');\n plot(tthresh(1)*[1;1],[0;1],'--');\n plot((tdom(1)+tdom(2))*[1;1],[0;1],'--');\n plot((tdom(1)+telm(2))*[1;1],[0;1],'--');\n plot((tdom(1)+tthresh(2))*[1;1],[0;1],'--');\n title(sprintf('Step responses for sample solution (%d), Tmax = %g', xi, delay ));\n\n end\n\nend\n\n%\n% Plot tradeoff curve\n%\n\nfigure(1)\nind = isfinite(areas);\nplot(areas(ind), delays(ind));\nxlabel('Area');\nylabel('Tdom');\ntitle('Area-delay tradeoff curve');\nhold on\nfor k = 1 : xnpts,\n text( xareas(k), xdelays(k), sprintf( '(%d)', k ) );\nend\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/circuit_design/wire_sizing.m", "content": "% Optimal interconnect wire sizing\n% Section 5.1, L. Vandenberghe, S. Boyd, and A. El Gamal\n% \"Optimizing dominant time constant in RC circuits\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX by Joelle Skaf - 11/25/05\n% Modified by Michael Grant - 3/8/06\n%\n% we consider the problem of sizing an interconnect wire that connects\n% a voltage source and conductance G to a capacitive load C. We divide the\n% wire into n segments of length li, and width xi, i = 1,...,n, which is\n% constrained as 0 <= xi <= Wmax. The total area of the interconnect wire\n% is therefore sum(li*xi). We use a pi-model of each wire segment, with\n% capacitors beta_i*xi and conductance alpha_i*xi.\n% To minimize the total area subject to the width bound and a bound Tmax on\n% dominant time constant, we solve the SDP\n% minimize sum_{i=1}^20 xi*li\n% s.t. Tmax*G(x) - C(x) >= 0\n% 0 <= xi <= Wmax\n\n%\n% Circuit parameters\n%\n\nn=21; % number of nodes; n-1 is number of segments in the wire\nm=n-1; % number of segments\nbeta = 0.5; % segment has two capacitances beta*xi\nalpha = 1; % conductance is alpha*xi per segment\nGo = 1; % driver conductance\nCo = 10; % load capacitance\nwmax = 1.0; % upper bound on x\n\n%\n% Construct the capacitance and conductance matrices\n% C(x) = C0 + x1 * C1 + x2 * C2 + ... + xn * Cn\n% G(x) = G0 + x1 * G1 + x2 * G2 + ... + xn * Gn\n% We assemble the coefficient matrices together as follows:\n% CC = [ C0(:) C1(:) C2(:) ... Cn(:) ]\n% GG = [ G0(:) G1(:) G2(:) ... Gn(:) ]\n%\n\nCC = zeros(n,n,m+1);\nGG = zeros(n,n,m+1);\n% constant terms\nCC(n,n,1) = Co;\nGG(1,1,1) = Go;\n% segment values\nfor i = 1 : n - 1,\n CC(i, i, i+1) = beta;\n CC(i+1,i+1,i+1) = beta;\n GG(i, i, i+1) = +alpha;\n GG(i+1,i, i+1) = -alpha;\n GG(i, i+1,i+1) = -alpha;\n GG(i+1,i+1,i+1) = +alpha;\nend\n% Reshape for easy Matlab use\nCC = reshape(CC,n*n,m+1);\nGG = reshape(GG,n*n,m+1);\n\n%\n% Compute points the tradeoff curve, and the four sample points\n%\n\nnpts = 50;\ndelays = linspace(400,2000,npts);\nxdelays = [ 370, 400, 600, 1800 ];\nxnpts = length(xdelays);\nareas = zeros(1,npts);\nxareas = zeros(1,xnpts);\nsizes = zeros(m,xnpts);\nfor i = 1 : npts + xnpts,\n\n if i > npts,\n xi = i - npts;\n delay = xdelays(xi);\n disp( sprintf( 'Particular solution %d of %d (Tmax = %g)', xi, xnpts, delay ) );\n else,\n delay = delays(i);\n disp( sprintf( 'Point %d of %d on the tradeoff curve (Tmax = %g)', i, npts, delay ) );\n end\n\n %\n % Construct and solve the convex model\n %\n\n cvx_begin sdp quiet\n variable x(m)\n variable G(n,n) symmetric\n variable C(n,n) symmetric\n minimize( sum(x) )\n G == reshape( GG * [ 1 ; x ], n, n );\n C == reshape( CC * [ 1 ; x ], n, n );\n delay * G - C >= 0;\n 0 <= x <= wmax;\n cvx_end\n\n if i <= npts,\n areas(i) = cvx_optval;\n else,\n xareas(xi) = cvx_optval;\n sizes(:,xi) = x;\n\n %\n % Plot the step response\n %\n\n figure(xi+2);\n A = -inv(C)*G;\n B = -A*ones(n,1);\n T = linspace(0,2000,1000);\n Y = simple_step(A,B,T(2),length(T));\n hold off; plot(T,Y,'-'); hold on;\n xlabel('time');\n ylabel('v');\n\n % compute threshold delay, elmore delay, dominant time constant\n tthres=T(min(find(Y(n,:)>0.5)));\n GinvC=full(G\\C);\n tdom=max(eig(GinvC));\n telm=max(sum(GinvC'));\n plot(tdom*[1;1], [0;1], '--', telm*[1;1], [0;1],'--', ...\n tthres*[1;1], [0;1], '--');\n text(tdom,0,'d');\n text(telm,0,'e');\n text(tthres,0,'t');\n title(sprintf('Step responses at the 21 nodes for solution (%d), Tmax=%g', xi, delay ));\n\n end\n\nend\n\n%\n% Plot the tradeoff curve\n%\n\nfigure(1)\nind = isfinite(areas);\nplot(areas(ind), delays(ind));\nxlabel('Area');\nylabel('Tdom');\ntitle('Area-delay tradeoff curve');\nhold on\nfor k = 1 : xnpts,\n text( xareas(k), xdelays(k), sprintf( '(%d)', k ) );\nend\n\n\n%\n% Draw wires for the four solutions\n%\n\nfigure(2)\nm2 = 2 * m;\nx1 = reshape( [ 1 : m ; 1 : m ], 1, m2 );\nx2 = x1( 1, end : -1 : 1 );\ny = [ - 0.5 * sizes(x1,:) ; + 0.5 * sizes(x2,:) ; - 0.5 * sizes(1,:) ];\nx1 = reshape( [ 0 : m - 1 ; 1 : m ], m2, 1 );\nx2 = x1( end : -1 : 1, 1 );\nx = [ x1 ; x2 ; 0 ];\nh = fill( x, y, ones(4*m+1,1)*[0.9,0.8,0.7,0.6] );\nhold on\nh2 = plot( x, y, '-' );\naxis([ -0.1, m + 0.1, min(y(:))-0.25, max(y(:))+0.1 ]);\ncolormap(gray);\ncaxis([-1,1]);\ntitle('Solutions at points on the tradeoff curve');\nlegends = {};\nfor k = 1 : xnpts,\n set( h(k), 'EdgeColor', get( h2(k), 'Color' ) );\n legends{k} = sprintf( 'Tmax=%g', xdelays(k) );\nend\nlegend(legends{:},4);\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/circuit_design/wire_sizing_spacing.m", "content": "% Combined wire sizing and spacing\n% Section 5.5, L. Vandenberghe, S. Boyd, and A. El Gamal\n% \"Optimizing dominant time constant in RC circuits\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX by Joelle Skaf - 11/27/05\n% Modified by Michael Grant - 3/8/06\n%\n% The problem is to determine the optimal sizes of interconnect wires and\n% the optimal distances between them. We will consider an example with 3\n% wires, each consisting of 5 segments (see paper, fig.21). The variables\n% are the widths wij , and the distances s1 and s2 between the wires.\n% The difference with the models used in other scripts is that we include a\n% parasitic capacitance between the wires.\n% The objective is to minimize the total width s1+s2.\n% The problem can be formulated with the following SDP:\n% mimimize s1 + s2\n% s.t. Tmax*G(w11,..,w35)-C(w11,..,w35,t11,..,t23) >=0\n% 1/t1j <= s1 - w1j - 0.5*w2j , j = 1,..,5\n% 1/t2j <= s2 - w3j - 0.5*w2j , j = 1,..,5\n% 0 <= tij <= 1 , i = 1,2 , j = 1,..,5\n% t1 >=0, t2 >= 0, s1 >=smin, s2>=smin\n% 0 <= wij <= wmax\n% the 2nd and 3rd constraints are nonlinear convex constraints that can be\n% cast as 3 x 3-LMIs (Please refer to the paper for more details).\n\n%\n% Circuit parameters\n%\n\nn = 6; % number of nodes per wire\nN = 3*n; % total number of nodes\nm = n-1; % number of segments per wire\nalpha = 1; % conductance per segment is is alpha*size\nbeta = 0.5; % capacitance per segment is twice beta*size\ngamma = 2; % coupling capacitance is twice gamma*distance\nG0 = 100; % source conductance\nC0 = [10,20,30]; % loads of first, second, third wires\nwmin = 0.1; % minimum width\nwmax = 2.0; % maximum width\nsmin = 1.0; % minimum distance between wires\nsmax = 50; % upper bound on s1 and s2 (meant to be inactive)\n\n%\n% Construct the capacitance and conductance matrices\n% C(x) = C0 + w11 * C1 + w21 * C2 + ...\n% G(x) = G0 + w11 * G1 + w21 * G2 + ...\n% and we assemble the coefficient matrices together as follows:\n% CC = [ C0(:) C1(:) C2(:) ... ]\n% GG = [ G0(:) G1(:) G2(:) ... ]\n%\n\nCC = zeros(N,N,5*m+1);\nGG = zeros(N,N,3*m+1);\nfor w = 0 : 2,\n % Constant terms\n CC(w*n+n,w*n+n,1) = C0(w+1);\n GG(w*n+1,w*n+1,1) = G0;\n for i = 1 : m,\n % capacitances to ground\n CC(w*n+[i,i+1],w*n+[i,i+1],w*m+i+1) = beta*[1,0;0,1];\n if w < 2,\n % coupling capacitors\n CC(w*n+[i, n+i ],w*n+[i, n+i ],(w+3)*m+i+1) = gamma*[1,-1;-1,1];\n CC(w*n+[i+1,n+i+1],w*n+[i+1,n+i+1],(w+3)*m+i+1) = gamma*[1,-1;-1,1];\n end\n % segment conductances\n GG(w*n+[i,i+1],w*n+[i,i+1],w*m+i+1) = alpha*[1,-1;-1,1];\n end\nend\n% Reshape for Matlab use\nCC = reshape(CC,N*N,5*m+1);\nGG = reshape(GG,N*N,3*m+1);\n\n%\n% Compute points the tradeoff curve and the two desired points\n%\n\nnpts = 50;\ndelays = linspace( 85, 200, npts );\nxdelays = [ 130, 90 ];\nxnpts = length(xdelays);\nareas = zeros(1,npts);\nxareas = zeros(1,xnpts);\nfor j = 1 : npts + xnpts,\n\n if j > npts,\n xj = j - npts;\n delay = xdelays(xj);\n disp( sprintf( 'Particular solution %d of %d (Tmax = %g)', xj, xnpts, delay ) );\n else,\n delay = delays(j);\n disp( sprintf( 'Point %d of %d on the tradeoff curve (Tmax = %g)', j, npts, delay ) );\n end\n\n %\n % Construct and solve the convex model\n %\n\n cvx_begin sdp quiet\n variables w(m,3) t(m,2) s(1,2)\n variable G(N,N) symmetric\n variable C(N,N) symmetric\n minimize( sum(s) )\n subject to\n G == reshape( GG * [ 1 ; w(:) ], N, N );\n C == reshape( CC * [ 1 ; w(:) ; t(:) ], N, N );\n delay * G - C >= 0;\n wmin <= w(:) <= wmax;\n t( : ) <= 1 / smin;\n s( : ) <= smax;\n inv_pos( t(:,1) ) <= s(1) - w(:,1) - 0.5 * w(:,2);\n inv_pos( t(:,2) ) <= s(2) - w(:,3) - 0.5 * w(:,2);\n cvx_end\n ss = cvx_optval;\n\n if j <= npts,\n areas(j) = ss;\n else,\n xareas(xj) = ss;\n\n %\n % Draw the wires\n %\n\n figure(4*xj-2);\n m2 = 2 * m;\n x1 = reshape( [ 1 : m ; 1 : m ], 1, m2 );\n x2 = x1( 1, end : -1 : 1 );\n y = [ ss*ones(m2,1), s(2) + 0.5*w(x1,2), zeros(m2,1) ; ...\n ss-w(x2,1), s(2) - 0.5*w(x2,2), w(x2,3) ; ...\n ss, s(2) + 0.5*w(1,2), 0 ];\n x1 = reshape( [ 0 : m - 1 ; 1 : m ], m2, 1 );\n x2 = x1( end : -1 : 1, 1 );\n x = [ x1 ; x2 ; 0 ];\n hold off;\n fill( x, y, 0.9 * ones(size(y)) );\n hold on\n plot( x, y, '-' );\n axis( [-0.1, m+0.1,-0.1, ss+0.1]);\n colormap(gray);\n caxis([-1,1])\n title(sprintf('Solution (%d), Tmax = %g',xj,delay));\n\n %\n % Build the state space models and plot step responses\n %\n\n A = -inv(C)*G;\n T = linspace(0,2*delay,1000);\n B = -A * kron( eye(3), ones(n,1) );\n for inp = 1 : 3,\n figure(4*xj-2+inp);\n Y1 = simple_step(A,B(:,inp),T(2),length(T));\n hold off;\n plot(T,Y1([n,2*n,3*n],:),'-');\n hold on;\n text(T(1000),Y1( n,1000),'v1');\n text(T(1000),Y1(2*n,1000),'v2');\n text(T(1000),Y1(3*n,1000),'v3');\n axis([0 2*delay -0.1 1.1]);\n % show dominant time constant\n plot(delay*[1;1], [-0.1;1.1], '--');\n title(sprintf('Solution (%d), Tmax = %g, step applied to wire %d',xj,delay,inp));\n end\n\n end\n\nend\n\n%\n% Plot the tradeoff curve\n%\n\nfigure(1);\nind = isfinite(areas);\nplot(areas(ind), delays(ind));\nxlabel('total width s_1 + s_2');\nylabel('dominant time constant');\ntitle('Width-delay tradeoff curve')\nhold on;\nfor k = 1 : xnpts,\n text( xareas(k), xdelays(k), sprintf( '(%d)', k ) );\nend\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/circuit_design/wire_sizing_topology.m", "content": "% Wire sizing and topology design\n% Section 5.3, L. Vandenberghe, S. Boyd, and A. El Gamal\n% \"Optimizing dominant time constant in RC circuits\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX by Joelle Skaf - 11/25/05\n% Modified by Michael Grant - 3/8/06\n%\n% We size the wires for an interconnect circuit with four nodes. The\n% topology of the circuit is more complex; the wires don't even form a tree\n% (refer to Figure 13 in the paper).\n% The problem can be formulated with the following SDP:\n% minimize sum(xi*li)\n% s.t. 0 <= xi <= wmax\n% Tmax*G(x) - C(x) >= 0\n% Please refer to the paper (section 2) to find what G(x) and C(x) are.\n\n%\n% Circuit parameters\n%\n\nn = 4; % number of nodes\nm = 6; % number of branches\nG = 0.1; % resistor between node 1 and 0\nCo = 10; % load capacitance\nwmax = 10.0; % maximum width\n% alpha: conductance per segment\n% 2 * beta: capacitance per segment\nalpha = [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ];\nbeta = [ 10, 10, 100, 1, 1, 1 ];\n\n%\n% Build capacitance and conductance matrices\n%\n\nCC = zeros(n,n,m+1);\nGG = zeros(n,n,m+1);\n% constant terms\nCC(3,3,1) = Co;\nGG(1,1,1) = G;\n% branch 1\nCC(1,1,2) = + beta(1);\nCC(2,2,2) = + beta(1);\nGG(1,1,2) = + alpha(1);\nGG(2,1,2) = - alpha(1);\nGG(1,2,2) = - alpha(1);\nGG(2,2,2) = + alpha(1);\n% branch 2\nCC(2,2,3) = + beta(2);\nCC(3,3,3) = + beta(2);\nGG(2,2,3) = + alpha(2);\nGG(3,2,3) = - alpha(2);\nGG(2,3,3) = - alpha(2);\nGG(3,3,3) = + alpha(2);\n% branch 3\nCC(1,1,4) = + beta(3);\nCC(3,3,4) = + beta(3);\nGG(1,1,4) = + alpha(3);\nGG(3,1,4) = - alpha(3);\nGG(1,3,4) = - alpha(3);\nGG(3,3,4) = + alpha(3);\n% branch 4\nCC(1,1,5) = + beta(4);\nCC(4,4,5) = + beta(4);\nGG(1,1,5) = + alpha(4);\nGG(4,1,5) = - alpha(4);\nGG(1,4,5) = - alpha(4);\nGG(4,4,5) = + alpha(4);\n% branch 5\nCC(2,2,6) = + beta(5);\nCC(4,4,6) = + beta(5);\nGG(2,2,6) = + alpha(5);\nGG(2,4,6) = - alpha(5);\nGG(4,2,6) = - alpha(5);\nGG(4,4,6) = + alpha(5);\n% branch 6\nCC(3,3,7) = + beta(6);\nCC(4,4,7) = + beta(6);\nGG(3,3,7) = + alpha(6);\nGG(4,3,7) = - alpha(6);\nGG(3,4,7) = - alpha(6);\nGG(4,4,7) = + alpha(6);\n\n% Reshape for easy Matlab use\nCC = reshape(CC,n*n,m+1);\nGG = reshape(GG,n*n,m+1);\n\n%\n% Compute points the tradeoff curve, and the three sample points\n%\n\nnpts = 50;\ndelays = linspace( 180, 800, npts );\nxdelays = [ 200, 400, 600 ];\nxnpts = length(xdelays);\nareas = zeros(1,npts);\nsizes = zeros(6,xnpts);\nfor i = 1 : npts + xnpts,\n\n if i > npts,\n xi = i - npts;\n delay = xdelays(xi);\n disp( sprintf( 'Particular solution %d of %d (Tmax = %g)', xi, xnpts, delay ) );\n else,\n delay = delays(i);\n disp( sprintf( 'Point %d of %d on the tradeoff curve (Tmax = %g)', i, npts, delay ) );\n end\n\n %\n % Construct and solve the convex model\n %\n\n cvx_begin sdp quiet\n variable x(6)\n variable G(n,n) symmetric\n variable C(n,n) symmetric\n minimize( sum( x ) )\n subject to\n G == reshape( GG * [ 1 ; x ], n, n );\n C == reshape( CC * [ 1 ; x ], n, n );\n delay * G - C >= 0;\n 0 <= x <= wmax;\n cvx_end\n\n if i <= npts,\n areas(i) = cvx_optval;\n else,\n xareas(xi) = cvx_optval;\n sizes(:,xi) = x;\n\n %\n % Plot the step response\n %\n\n figure(xi+1);\n A = -inv(C)*G;\n B = -A*ones(n,1);\n T = linspace(0,1000,1000);\n Y = simple_step(A,B,T(2),length(T));\n hold off; plot(T,Y([1,3,4],:),'-'); hold on;\n\n % compute threshold delay, elmore delay, dominant time constant\n tthres=T(min(find(Y(3,:)>0.5)));\n tdom=max(eig(inv(G)*C));\n telm=max(sum((inv(G)*C)'));\n plot(tdom*[1;1], [0;1], '--', telm*[1;1], [0;1],'--', ...\n tthres*[1;1], [0;1], '--');\n text(tdom,0,'d');\n text(telm,0,'e');\n text(tthres,0,'t');\n title(sprintf('Step response for solution (%d), Tmax=%g', xi, delay ));\n\n end\n\nend\n\n%\n% Plot the tradeoff curve\n%\n\nfigure(1)\nind = isfinite(areas);\nplot(areas(ind), delays(ind));\nxlabel('Area');\nylabel('Tdom');\ntitle('Area-delay tradeoff curve');\nhold on\nfor k = 1 : xnpts,\n text( xareas(k), xdelays(k), sprintf( '(%d)', k ) );\nend\n\n%\n% Display sizes for the three solutions\n%\n\ndisp(['Three specific solutions:']);\nsizes\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/closest_toeplitz_psd.m", "content": "% Closest Toeplitz SDP search.\n%\n% This script finds a Toeplitz Hermitian PSD matrix that is closest to a\n% given Hermitian matrix, as measured by the Frobenius norm. That is, for\n% a given matrix P, it solves:\n% minimize || Z - P ||_F\n% subject to Z >= 0\n%\n% Adapted from an example provided in the SeDuMi documentation. Notice\n% the use of SDP mode to simplify the semidefinite constraint.\n\n% The data. P is Hermitian, but is neither Toeplitz nor PSD.\nP = [ 4, 1+2*j, 3-j ; ...\n 1-2*j, 3.5, 0.8+2.3*j ; ...\n 3+j, 0.8-2.3*j, 4 ];\n \n% Construct and solve the model\nn = size( P, 1 );\ncvx_begin sdp\n variable Z(n,n) hermitian toeplitz\n dual variable Q\n minimize( norm( Z - P, 'fro' ) )\n Z >= 0 : Q;\ncvx_end\n\n% Display resuls\ndisp( 'The original matrix, P: ' );\ndisp( P )\ndisp( 'The optimal point, Z:' );\ndisp( Z )\ndisp( 'The optimal dual variable, Q:' );\ndisp( Q )\ndisp( 'min( eig( Z ) ), min( eig( Q ) ) (both should be nonnegative, or close):' );\ndisp( sprintf( ' %g %g\\n', min( eig( Z ) ), min( eig( Q ) ) ) );\ndisp( 'The optimal value, || Z - P ||_F:' );\ndisp( norm( Z - P, 'fro' ) );\ndisp( 'Complementary slackness: Z * Q, should be near zero:' );\ndisp( Z * Q )\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch04_cvx_opt_probs/Contents.m", "content": "% Chapter 4: Convex optimization problems\n%\n% chebyshev_center_2D.m - Section 4.3.1: Compute and display the Chebyshev center of a 2D polyhedron\n% chebyshev_center.m - Section 4.3.1: Compute the Chebyshev center of a polyhedron\n% cantilever_beam_rec.m - Section 4.5.4: Design of a cantilever beam: recursive formulation (GP)\n% frob_norm_diag_scaling.m - Section 4.5.4: Frobenius norm diagonal scaling (GP)\n% min_spec_rad_ppl_dynamics.m - Section 4.5.4: Minimum spectral radius via Peron-Frobenius theory (GP)\n% fastest_mixing_MC.m - Section 4.6.3: Find the fastest mixing Markov chain on a graph\n% ex_4_27.m - Exercise 4.27: Matrix fractional minimization using second-order cone programming\n% cantilever_beam.m - Exercise 4.31: Design of a cantilever beam (GP)\n% ex_4_38.m - Exercise 4.38(b): Linear matrix inequalities with one variable\n% ex_4_3.m - Exercise 4.3: Solve a simple QP with inequality constraints\n% max_det_psd_completion.m - Exercise 4.47: Maximum determinant PSD matrix completion\n% channel_capacity.m - Exercise 4.57: Capacity of a communication channel\n% ex_4_5.m - Exercise 4.5: Show the equivalence of 3 convex problem formations\n% logopt_investment.m - Exercise 4.60: Log-optimal investment strategy\n% cantilever_beam_plot.m - Plots a cantilever beam as a 3D figure.\nhelp Contents\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch04_cvx_opt_probs/cantilever_beam.m", "content": "% Exercise 4.31: Design of a cantilever beam (GP)\r\n% Boyd & Vandenberghe \"Convex Optimization\"\r\n% Almir Mutapcic - 01/30/06\r\n% Updated to use GP mode 02/08/06\r\n% (a figure is generated)\r\n%\r\n% We have a segmented cantilever beam with N segments. Each segment\r\n% has a unit length and variable width and height (rectangular profile).\r\n% The goal is minimize the total volume of the beam, over all segment\r\n% widths w_i and heights h_i, subject to constraints on aspect ratios,\r\n% maximum allowable stress in the material, vertical deflection y, etc.\r\n%\r\n% The problem can be posed as a geometric program (posynomial form)\r\n% minimize sum( w_i* h_i)\r\n% s.t. w_min <= w_i <= w_max, for all i = 1,...,N\r\n% h_min <= h_i <= h_max\r\n% S_min <= h_i/w_i <= S_max\r\n% 6*i*F/(w_i*h_i^2) <= sigma_max\r\n% 6*F/(E*w_i*h_i^3) == d_i\r\n% (2*i - 1)*d_i + v_(i+1) <= v_i\r\n% (i - 1/3)*d_i + v_(i+1) + y_(i+1) <= y_i\r\n% y_1 <= y_max\r\n%\r\n% with variables w_i, h_i, d_i, (i = 1,...,N) and v_i, y_i (i = 1,...,N+1).\r\n% (Consult the book for other definitions and a recursive formulation of\r\n% this problem.)\r\n\r\n% optimization variables\r\nN = 8;\r\n\r\n% constants\r\nwmin = .1; wmax = 100;\r\nhmin = .1; hmax = 6;\r\nSmin = 1/5; Smax = 5;\r\nsigma_max = 1;\r\nymax = 10;\r\nE = 1; F = 1;\r\n\r\ncvx_begin gp\r\n % optimization variables\r\n variables w(N) h(N) v(N+1) y(N+1);\r\n\r\n % objective is the total volume of the beam\r\n % obj = sum of (widths*heights*lengths) over each section\r\n % (recall that the length of each segment is set to be 1)\r\n minimize( w'*h )\r\n subject to\r\n % non-recursive formulation\r\n d = 6*F*ones(N,1)./(E*ones(N,1).*w.*h.^3);\r\n for i = 1:N\r\n (2*i-1)*d(i) + v(i+1) <= v(i);\r\n (i-1/3)*d(i) + v(i+1) + y(i+1) <= y(i);\r\n end\r\n\r\n % constraint set\r\n wmin <= w <= wmax;\r\n hmin <= h <= hmax;\r\n Smin <= h./w <= Smax;\r\n 6*F*[1:N]'./(w.*(h.^2)) <= sigma_max;\r\n y(1) <= ymax;\r\ncvx_end\r\n\r\n% display results\r\ndisp('The optimal widths and heights are: ');\r\nw, h\r\nfprintf(1,'The optimal minimum volume of the beam is %3.4f.\\n', sum(w.*h))\r\n\r\n% plot the 3D model of the optimal cantilever beam\r\nfigure, clf\r\ncantilever_beam_plot([h; w])\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch04_cvx_opt_probs/cantilever_beam_plot.m", "content": "% Plots a cantilever beam as a 3D figure.\n% This is a helper function for the optimal cantilever beam example.\n%\n% Inputs:\n% values: an array of heights and widths of each segment\n% [h1 h2 ... hN w1 w2 ... wN]\n%\n% Almir Mutapcic 01/25/06\n\nfunction cantilever_beam_plot(values)\n\nN = length(values)/2;\nfor k = 0:N-1\n [X Y Z] = data_rect3(values(2*N-k),values(N-k),k);\n plot3(X,Y,Z); hold on;\nend\nhold off;\n\nxlabel('width')\nylabel('height')\nzlabel('length')\nreturn;\n\n%****************************************************************\nfunction [X, Y, Z] = data_rect3(w,h,d)\n%****************************************************************\n% back face\nX = [-w/2 w/2 w/2 -w/2 -w/2];\nY = [-h/2 -h/2 h/2 h/2 -h/2];\nZ = [d d d d d];\n% side face\nX = [X -w/2 -w/2 -w/2 -w/2 -w/2];\nY = [Y -h/2 -h/2 h/2 h/2 -h/2];\nZ = [Z d d+1 d+1 d d];\n% front face\nX = [X -w/2 w/2 w/2 -w/2 -w/2];\nY = [Y -h/2 -h/2 h/2 h/2 -h/2];\nZ = [Z d+1 d+1 d+1 d+1 d+1];\n% back side face\nX = [X w/2 w/2 w/2 w/2 w/2];\nY = [Y -h/2 h/2 h/2 -h/2 -h/2];\nZ = [Z d+1 d+1 d d d+1];\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch04_cvx_opt_probs/cantilever_beam_rec.m", "content": "% Section 4.5.4: Design of a cantilever beam: recursive formulation (GP)\n% Boyd & Vandenberghe \"Convex Optimization\"\n% (a figure is generated)\n% Almir Mutapcic 02/08/06\n%\n% We have a segmented cantilever beam with N segments. Each segment\n% has a unit length and variable width and height (rectangular profile).\n% The goal is minimize the total volume of the beam, over all segment\n% widths w_i and heights h_i, subject to constraints on aspect ratios,\n% maximum allowable stress in the material, vertical deflection y, etc.\n%\n% The problem can be posed as a geometric program (posynomial form)\n% minimize sum( w_i* h_i)\n% s.t. w_min <= w_i <= w_max, for all i = 1,...,N\n% h_min <= h_i <= h_max\n% S_min <= h_i/w_i <= S_max\n% 6*i*F/(w_i*h_i^2) <= sigma_max\n% y_1 <= y_max\n%\n% with variables w_i and h_i (i = 1,...,N).\n% For other definitions consult the book.\n% (See exercise 4.31 for a non-recursive formulation.)\n\n% optimization variables\nN = 8;\n\n% constants\nwmin = .1; wmax = 100;\nhmin = .1; hmax = 6;\nSmin = 1/5; Smax = 5;\nsigma_max = 1;\nymax = 10;\nE = 1; F = 1;\n\ncvx_begin gp\n % optimization variables\n variables w(N) h(N)\n\n % setting up variables relations\n % (recursive formulation)\n v = cvx( zeros(N+1,1) );\n y = cvx( zeros(N+1,1) );\n for i = N:-1:1\n fprintf(1,'Building recursive relations for index: %d\\n',i);\n v(i) = 12*(i-1/2)*F/(E*w(i)*h(i)^3) + v(i+1);\n y(i) = 6*(i-1/3)*F/(E*w(i)*h(i)^3) + v(i+1) + y(i+1);\n end\n\n % objective is the total volume of the beam\n % obj = sum of (widths*heights*lengths) over each section\n % (recall that the length of each segment is set to be 1)\n minimize( w'*h )\n subject to\n % constraint set\n wmin <= w <= wmax;\n hmin <= h <= hmax;\n Smin <= h./w <= Smax;\n 6*F*[1:N]'./(w.*(h.^2)) <= sigma_max;\n y(1) <= ymax;\ncvx_end\n\n% display results\ndisp('The optimal widths and heights are: ');\nw, h\nfprintf(1,'The optimal minimum volume of the beam is %3.4f.\\n', sum(w.*h))\n\n% plot the 3D model of the optimal cantilever beam\nfigure, clf\ncantilever_beam_plot([h; w])\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch04_cvx_opt_probs/channel_capacity.m", "content": "% Exercise 4.57: Capacity of a communication channel \n% Boyd & Vandenberghe \"Convex Optimization\" \n% Joëlle Skaf - 04/24/08 \n%\n% We consider a discrete memoryless communication channel, with input \n% X(t) \\in {1,...,n}, and output Y(t) \\in {1,...,m}, for t = 1,2,... \n% The relation between the input and output is given statistically: \n% p_ij = Prob(Y(t)=i|X(t)=j), i=1,...,m, j=1,...,n\n% The matrix P is called the channel transition matrix.\n% The channel capacity C is given by \n% C = sup{ I(X;Y) | x >= 0, sum(x) = 1}, \n% I(X;Y) is the mutual information between X and Y, and it can be shown \n% that: I(X;Y) = c'*x - sum_{i=1}^m y_i*log_2(y_i)\n% where c_j = sum_{i=1}^m p_ij*log_2(p_ij), j=1,...,m\n\n% Input data \nrand('state', 0); \nn = 15;\nm = 10; \nP = rand(m,n); \nP = P./repmat(sum(P),m,1); \nc = sum(P.*log2(P))';\n\n% Channel capacity \ncvx_begin\n variable x(n) \n y = P*x; \n maximize (c'*x + sum(entr(y))/log(2))\n x >= 0;\n sum(x) == 1; \ncvx_end\nC = cvx_optval; \n\n% Results\ndisplay(['The channel capacity is: ' num2str(C) ' bits.'])\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch04_cvx_opt_probs/chebyshev_center.m", "content": "% Section 4.3.1: Compute the Chebyshev center of a polyhedron\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Jolle Skaf - 08/16/05\n%\n% The goal is to find the largest Euclidean ball (i.e. its center and\n% radius) that lies in a polyhedron described by linear inequalites in this\n% fashion: P = {x : a_i'*x <= b_i, i=1,...,m}\n\n% Generate the data\nrandn('state',0);\nn = 10; m = 2*n;\nA = randn(m,n);\nb = A*rand(n,1) + 2*rand(m,1);\nnorm_ai = sum(A.^2,2).^(.5);\n\n% Build and execute model\nfprintf(1,'Computing Chebyshev center...');\ncvx_begin\n variable r(1)\n variable x_c(n)\n dual variable y\n maximize ( r )\n y: A*x_c + r*norm_ai <= b;\ncvx_end\nfprintf(1,'Done! \\n');\n\n% Display results\nfprintf(1,'The Chebyshev center coordinates are: \\n');\ndisp(x_c);\nfprintf(1,'The radius of the largest Euclidean ball is: \\n');\ndisp(r);\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch04_cvx_opt_probs/chebyshev_center_2D.m", "content": "% Section 4.3.1: Compute and display the Chebyshev center of a 2D polyhedron\n% Boyd & Vandenberghe, \"Convex Optimization\"\n% Jolle Skaf - 08/16/05\n% (a figure is generated)\n%\n% The goal is to find the largest Euclidean ball (i.e. its center and\n% radius) that lies in a polyhedron described by linear inequalites in this\n% fashion: P = {x : a_i'*x <= b_i, i=1,...,m} where x is in R^2\n\n% Generate the input data\na1 = [ 2; 1];\na2 = [ 2; -1];\na3 = [-1; 2];\na4 = [-1; -2];\nb = ones(4,1);\n\n% Create and solve the model\ncvx_begin\n variable r(1)\n variable x_c(2)\n maximize ( r )\n a1'*x_c + r*norm(a1,2) <= b(1);\n a2'*x_c + r*norm(a2,2) <= b(2);\n a3'*x_c + r*norm(a3,2) <= b(3);\n a4'*x_c + r*norm(a4,2) <= b(4);\ncvx_end\n\n% Generate the figure\nx = linspace(-2,2);\ntheta = 0:pi/100:2*pi;\nplot( x, -x*a1(1)./a1(2) + b(1)./a1(2),'b-');\nhold on\nplot( x, -x*a2(1)./a2(2) + b(2)./a2(2),'b-');\nplot( x, -x*a3(1)./a3(2) + b(3)./a3(2),'b-');\nplot( x, -x*a4(1)./a4(2) + b(4)./a4(2),'b-');\nplot( x_c(1) + r*cos(theta), x_c(2) + r*sin(theta), 'r');\nplot(x_c(1),x_c(2),'k+')\nxlabel('x_1')\nylabel('x_2')\ntitle('Largest Euclidean ball lying in a 2D polyhedron');\naxis([-1 1 -1 1])\naxis equal\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch04_cvx_opt_probs/ex_4_27.m", "content": "% Exercise 4.27: Matrix fractional minimization using second-order cone programming\n% From Boyd & Vandenberghe, \"Convex Optimization\"\n% Jolle Skaf - 09/26/05\n%\n% Shows the equivalence of the following formulations:\n% 1) minimize (Ax + b)'*inv(I + B*diag(x)*B')*(Ax + b)\n% s.t. x >= 0\n% 2) minimize (Ax + b)'*inv(I + B*Y*B')*(Ax + b)\n% s.t. x >= 0\n% Y = diag(x)\n% 3) minimize v'*v + w'*inv(diag(x))*w\n% s.t. v + Bw = Ax + b\n% x >= 0\n% 4) minimize v'*v + w'*inv(Y)*w\n% s.t. Y = diag(x)\n% v + Bw = Ax + b\n% x >= 0\n\n% Generate input data\nrandn('state',0);\nm = 16; n = 8;\nA = randn(m,n);\nb = randn(m,1);\nB = randn(m,n);\n\n% Problem 1: original formulation\ndisp('Computing optimal solution for 1st formulation...');\ncvx_begin\n variable x1(n)\n minimize( matrix_frac(A*x1 + b , eye(m) + B*diag(x1)*B') )\n x1 >= 0;\ncvx_end\nopt1 = cvx_optval;\n\n% Problem 2: original formulation (modified)\ndisp('Computing optimal solution for 2nd formulation...');\ncvx_begin\n variable x2(n)\n variable Y(n,n) diagonal\n minimize( matrix_frac(A*x2 + b , eye(m) + B*Y*B') )\n x2 >= 0;\n Y == diag(x2);\ncvx_end\nopt2 = cvx_optval;\n\n% Problem 3: equivalent formulation (as given in the book)\ndisp('Computing optimal solution for 3rd formulation...');\ncvx_begin\n variables x3(n) w(n) v(m)\n minimize( square_pos(norm(v)) + matrix_frac(w, diag(x3)) )\n v + B*w == A*x3 + b;\n x3 >= 0;\ncvx_end\nopt3 = cvx_optval;\n\n% Problem 4: equivalent formulation (modified)\ndisp('Computing optimal solution for 4th formulation...');\ncvx_begin\n variables x4(n) w(n) v(m)\n variable Y(n,n) diagonal\n minimize( square_pos(norm(v)) + matrix_frac(w, Y) )\n v + B*w == A*x4 + b;\n x4 >= 0;\n Y == diag(x4);\ncvx_end\nopt4 = cvx_optval;\n\n% Display the results\ndisp('------------------------------------------------------------------------');\ndisp('The optimal value for each of the 4 formulations is: ');\n[opt1 opt2 opt3 opt4]\ndisp('They should be equal!')\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch04_cvx_opt_probs/ex_4_3.m", "content": "% Exercise 4.3: Solve a simple QP with inequality constraints\n% From Boyd & Vandenberghe, \"Convex Optimization\"\n% Jolle Skaf - 09/26/05\n%\n% Solves the following QP with inequality constraints:\n% minimize 1/2x'*P*x + q'*x + r\n% s.t. -1 <= x_i <= 1 for i = 1,2,3\n% Also shows that the given x_star is indeed optimal\n\n% Generate data\nP = [13 12 -2; 12 17 6; -2 6 12];\nq = [-22; -14.5; 13];\nr = 1;\nn = 3;\nx_star = [1;1/2;-1];\n\n% Construct and solve the model\nfprintf(1,'Computing the optimal solution ...');\ncvx_begin\n variable x(n)\n minimize ( (1/2)*quad_form(x,P) + q'*x + r)\n x >= -1;\n x <= 1;\ncvx_end\nfprintf(1,'Done! \\n');\n\n% Display results\ndisp('------------------------------------------------------------------------');\ndisp('The computed optimal solution is: ');\ndisp(x);\ndisp('The given optimal solution is: ');\ndisp(x_star);\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch04_cvx_opt_probs/ex_4_38.m", "content": "% Exercise 4.38(b): Linear matrix inequalities with one variable\n% From Boyd & Vandenberghe, \"Convex Optimization\"\n% Jolle Skaf - 09/26/05\n%\n% Finds the optimal t that would maximize c*t while still having A - t*B\n% positive semidefinite by solving the following SDP:\n% minimize c*t\n% s.t. t*B <= A\n% c can either be a positive or negative real number\n\n% Generate input data\nrandn('state',0);\nn = 4;\nA = randn(n); A = 0.5*(A'+A); %A = A'*A;\nB = randn(n); B = B'*B;\n% can modify the value of c (>0 or <0)\nc = -1;\n\n% Create and solve the model\ncvx_begin sdp\n variable t\n minimize ( c*t )\n A >= t * B;\ncvx_end\n\n% Display results\ndisp('------------------------------------------------------------------------');\ndisp('The optimal t obtained is');\ndisp(t);\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch04_cvx_opt_probs/ex_4_5.m", "content": "% Exercise 4.5: Show the equivalence of 3 convex problem formations\n% From Boyd & Vandenberghe, \"Convex Optimization\"\n% Jolle Skaf - 08/17/05\n%\n% Shows the equivalence of the following 3 problems:\n% 1) Robust least-squares problem\n% minimize sum_{i=1}^{m} phi(a_i'*x - bi)\n% where phi(u) = u^2 for |u| <= M\n% M(2|u| - M) for |u| > M\n% 2) Least-squares with variable weights\n% minimize sum_{i=1}^{m} (a_i'*x - bi)^2/(w_i+1) + M^2*1'*w\n% s.t. w >= 0\n% 3) Quadratic program\n% minimize sum_{i=1}^{m} (u_i^2 + 2*M*v_i)\n% s.t. -u - v <= Ax - b <= u + v\n% 0 <= u <= M*1\n% v >= 0\n\n% Generate input data\nrandn('state',0);\nm = 16; n = 8;\nA = randn(m,n);\nb = randn(m,1);\nM = 2;\n\n% (a) robust least-squares problem\ndisp('Computing the solution of the robust least-squares problem...');\ncvx_begin\n variable x1(n)\n minimize( sum(huber(A*x1-b,M)) )\ncvx_end\n\n% (b)least-squares problem with variable weights\ndisp('Computing the solution of the least-squares problem with variable weights...');\ncvx_begin\n variable x2(n)\n variable w(m)\n minimize( sum(quad_over_lin(diag(A*x2-b),w'+1)) + M^2*ones(1,m)*w)\n w >= 0;\ncvx_end\n\n% (c) quadratic program\ndisp('Computing the solution of the quadratic program...');\ncvx_begin\n variable x3(n)\n variable u(m)\n variable v(m)\n minimize( sum(square(u) + 2*M*v) )\n A*x3 - b <= u + v;\n A*x3 - b >= -u - v;\n u >= 0;\n u <= M;\n v >= 0;\ncvx_end\n\n% Display results\ndisp('------------------------------------------------------------------------');\ndisp('The optimal solutions for problem formulations 1, 2 and 3 are given');\ndisp('respectively as follows (per column): ');\n[x1 x2 x3]\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch04_cvx_opt_probs/fastest_mixing_MC.m", "content": "% Section 4.6.3: Find the fastest mixing Markov chain on a graph\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Jolle Skaf - 09/26/05\n%\n% The 'fastest mixing Markov chain problem' is to find a transition\n% probability matrix P on a graph E that minimizes the mixing rate r, where\n% r = max{ lambda_2, -lambda_n } with lambda_1>=...>=lambda_n being the\n% eigenvalues of P.\n\n% Generate input data\nn = 5;\nE = [0 1 0 1 1; ...\n 1 0 1 0 1; ...\n 0 1 0 1 1; ...\n 1 0 1 0 1; ...\n 1 1 1 1 0];\n\n% Create and solve model\ncvx_begin\n variable P(n,n) symmetric\n minimize(norm(P - (1/n)*ones(n)))\n P*ones(n,1) == ones(n,1);\n P >= 0;\n P(E==0) == 0;\ncvx_end\ne = flipud(eig(P));\nr = max(e(2), -e(n));\n\n% Display results\ndisp('------------------------------------------------------------------------');\ndisp('The transition probability matrix of the optimal Markov chain is: ');\ndisp(P);\ndisp('The optimal mixing rate is: ');\ndisp(r);\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch04_cvx_opt_probs/frob_norm_diag_scaling.m", "content": "% Section 4.5.4: Frobenius norm diagonal scaling (GP)\r\n% Boyd & Vandenberghe \"Convex Optimization\"\r\n% Joelle Skaf - 01/29/06\r\n% Updated to use GP mode by Almir Mutapcic 02/08/06\r\n%\r\n% Given a square matrix M, the goal is to find a vector (with dii > 0)\r\n% such that ||DMD^{-1}||_F is minimized, where D = diag(d).\r\n% The problem can be cast as an unconstrained geometric program:\r\n% minimize sqrt( sum_{i,j=1}^{n} Mij^2*di^2/dj^2 )\r\n%\r\n\r\nrs = randn( 'state' );\r\nrandn( 'state', 0 );\r\n\r\n% matrix size (M is an n-by-n matrix)\r\nn = 4;\r\nM = randn(n,n);\r\n\r\n% formulating the problem as a GP\r\ncvx_begin gp\r\n variable d(n)\r\n minimize( sqrt( sum( sum( diag(d.^2)*(M.^2)*diag(d.^-2) ) ) ) )\r\n % Alternate formulation: norm( diag(d)*abs(M)*diag(1./d), 'fro' )\r\ncvx_end\r\n\r\n% displaying results\r\nD = diag(d);\r\ndisp('The matrix D that minimizes ||DMD^{-1}||_F is: ');\r\ndisp(D);\r\ndisp('The minimium Frobenius norm achieved is: ');\r\ndisp(norm(D*M*inv(D),'fro'));\r\ndisp('while the Frobunius norm of the original matrix M is: ');\r\ndisp(norm(M,'fro'));\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch04_cvx_opt_probs/logopt_investment.m", "content": "% Exercise 4.60: Log-optimal investment strategy\n% Boyd & Vandenberghe \"Convex Optimization\" \n% Joëlle Skaf - 04/24/08 \n% (a figure is generated) \n% \n% The investment strategy x that maximizes the long term growth rate \n% R = sum_{j=1}^m pi_j*log(p_j^Tx) \n% is called the log-optimal investment strategy, and can be found by\n% solving the optimization problem \n% maximize sum_{j=1}^m pi_j log(p_j^Tx) \n% subject to x >= 0, sum(x) = 1,\n% where p_ij is the return of asset i over one period in scenario j and \n% pi_j is the probability of scenario j. There are n assets and m scenarios.\n% We consider the case of equiprobable scenarios. \n%\n% The log-optimal long term growth rate is found and compared to the one\n% obtained with a uniform allocation strategy, i.e., x_i=(1/n). \n% Sample trajectories ofthe accumulated wealth for the optimal strategy and \n% the uniform one are plotted. \n\n\n% Input data \nP = [3.5000 1.1100 1.1100 1.0400 1.0100;\n 0.5000 0.9700 0.9800 1.0500 1.0100;\n 0.5000 0.9900 0.9900 0.9900 1.0100;\n 0.5000 1.0500 1.0600 0.9900 1.0100;\n 0.5000 1.1600 0.9900 1.0700 1.0100;\n 0.5000 0.9900 0.9900 1.0600 1.0100;\n 0.5000 0.9200 1.0800 0.9900 1.0100;\n 0.5000 1.1300 1.1000 0.9900 1.0100;\n 0.5000 0.9300 0.9500 1.0400 1.0100;\n 3.5000 0.9900 0.9700 0.9800 1.0100];\n\n[m,n] = size(P);\nPi = ones(m,1)/m;\nx_unif = ones(n,1)/n; % uniform resource allocation\n\n% Find the log-optimal investment policy \ncvx_begin \n variable x_opt(n)\n maximize sum(Pi.*log(P*x_opt))\n sum(x_opt) == 1\n x_opt >= 0\ncvx_end\n\n% Long-term growth rates\nR_opt = sum(Pi.*log(P*x_opt));\nR_unif = sum(Pi.*log(P*x_unif));\ndisplay('The long term growth rate of the log-optimal strategy is: '); \ndisp(R_opt); \ndisplay('The long term growth rate of the uniform strategy is: ');\ndisp(R_unif); \n\n% Generate random event sequences\nrand('state',10);\nN = 10; % number of random trajectories \nT = 200; % time horizon\nw_opt = []; w_unif = [];\nfor i = 1:N\n events = ceil(rand(1,T)*m);\n P_event = P(events,:);\n w_opt = [w_opt [1; cumprod(P_event*x_opt)]];\n w_unif = [w_unif [1; cumprod(P_event*x_unif)]];\nend\n\n% Plot wealth versus time\nfigure\nsemilogy(w_opt,'g')\nhold on\nsemilogy(w_unif,'r--')\ngrid\naxis tight\nxlabel('time')\nylabel('wealth')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch04_cvx_opt_probs/max_det_psd_completion.m", "content": "% Exercise 4.47: Maximum determinant PSD matrix completion\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Almir Mutapcic - Jan 2006\n%\n% Given a symmetric matrix A in R^(n-by-n) with some entries unspecified\n% we find its completion such that A is positive semidefinite and\n% it has a maximum determinant out of all possible completions.\n% This problem can be formulated as a log det (and det_rootn) problem.\n%\n% This is a numerical instance of the specified book exercise.\n\n% problem size\nn = 4;\n\n% create and solve the problem\ncvx_begin sdp\n % A is a PSD symmetric matrix (n-by-n)\n variable A(n,n) symmetric;\n A >= 0;\n\n % constrained matrix entries.\n A(1,1) == 3;\n A(2,2) == 2;\n A(3,3) == 1;\n A(4,4) == 5;\n % Note that because A is symmetric, these off-diagonal\n % constraints affect the corresponding element on the\n % opposite side of the diagonal.\n A(1,2) == .5;\n A(1,4) == .25;\n A(2,3) == .75;\n\n % find the solution to the problem\n maximize( log_det( A ) )\n % maximize( det_rootn( A ) )\ncvx_end\n\n% display solution\ndisp(['Matrix A with maximum determinant (' num2str(det(A)) ') is:'])\nA\ndisp(['Its eigenvalues are:'])\neigs = eig(A)\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch04_cvx_opt_probs/min_spec_rad_ppl_dynamics.m", "content": "% Section 4.5.4: Minimum spectral radius via Peron-Frobenius theory (GP)\r\n% Boyd & Vandenberghe \"Convex Optimization\"\r\n% Joelle Skaf - 01/29/06\r\n% Updated to use CVX mode by Almir Mutapcic 02/08/06\r\n%\r\n% The goal is to minimize the spectral radius of a square matrix A\r\n% which is elementwise nonnegative, Aij >= 0 for all i,j. In this\r\n% case A has a positive real eigenvalue lambda_pf (the Perron-Frobenius\r\n% eigenvalue) which is equal to the spectral radius, and thus gives\r\n% the fastest decay rate or slowest growth rate.\r\n% The problem of minimizing the Perron-Frobenius eigenvalue of A,\r\n% possibly subject to posynomial inequalities in some underlying\r\n% variable x can be posed as a GP (for example):\r\n%\r\n% minimize lambda_pf( A(x) )\r\n% s.t. f_i(x) <= 1 for i = 1,...,p\r\n%\r\n% where matrix A entries are some posynomial functions of variable x,\r\n% and f_i are posynomials.\r\n%\r\n% We consider a specific example in which we want to find the fastest\r\n% decay or slowest growth rate for the bacteria population governed\r\n% by a simple dynamic model (see page 166). The problem is a GP:\r\n% minimize lambda\r\n% s.t. b1*v1 + b2*v2 + b3*v3 + b4*v4 <= lambda*v1\r\n% s1*v1 <= lambda*v2\r\n% s2*v2 <= lambda*v3\r\n% s3*v3 <= lambda*v4\r\n% 1/2 <= ci <= 2\r\n% bi == bi^{nom}*(c1/c1^{nom})^alpha_i*(c2/c2^{nom})^beta_i\r\n% si == si^{nom}*(c1/c1^{nom})^gamma_i*(c2/c2^{nom})^delta_i\r\n%\r\n% with variables bi, si, ci, vi, lambda.\r\n\r\n% constants\r\nc_nom = [1 1]';\r\nb_nom = [2 3 2 1]';\r\nalpha = [1 1 1 1]'; beta = [1 1 1 1]';\r\ns_nom = [1 1 3]';\r\ngamma = [1 1 1]'; delta = [1 1 1]';\r\n\r\ncvx_begin gp\r\n % optimization variables\r\n variables lambda b(4) s(3) v(4) c(2)\r\n\r\n % objective is the Perron-Frobenius eigenvalue\r\n minimize( lambda )\r\n subject to\r\n % inequality constraints\r\n b'*v <= lambda*v(1);\r\n s(1)*v(1) <= lambda*v(2);\r\n s(2)*v(2) <= lambda*v(3);\r\n s(3)*v(3) <= lambda*v(4);\r\n [0.5; 0.5] <= c; c <= [2; 2];\r\n % equality constraints\r\n b == b_nom.*((ones(4,1)*(c(1)/c_nom(1))).^alpha).*...\r\n ((ones(4,1)*(c(2)/c_nom(2))).^beta);\r\n s == s_nom.*((ones(3,1)*(c(1)/c_nom(1))).^gamma).*...\r\n ((ones(3,1)*(c(2)/c_nom(2))).^delta);\r\ncvx_end\r\n\r\n% displaying results\r\ndisp(' ')\r\nif lambda < 1\r\n fprintf(1,'The fastest decay rate of the bacteria population is %3.2f.\\n', lambda);\r\nelse\r\n fprintf(1,'The slowest growth rate of the bacteria population is %3.2f.\\n', lambda);\r\nend\r\ndisp(' ')\r\nfprintf(1,'The concentration of chemical 1 achieving this result is %3.2f.\\n', c(1));\r\nfprintf(1,'The concentration of chemical 2 achieving this result is %3.2f.\\n', c(2));\r\ndisp(' ')\r\n\r\n% construct matrix A\r\nA = zeros(4,4);\r\nA(1,:) = b';\r\nA(2,1) = s(1);\r\nA(3,2) = s(2);\r\nA(4,3) = s(3);\r\n\r\n% eigenvalues of matrix A\r\ndisp('Eigenvalues of matrix A are: ')\r\neigA = eig(A)\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch05_duality/Contents.m", "content": "% Chapter 5: Duality\n%\n% qcqp.m - Section 5.2.4: Solves a simple QCQP\n% matrix_games.m - Section 5.2.5: Mixed strategies for matrix games\n% matrix_games_LP.m - Section 5.2.5: Mixed strategies for matrix games (LP formulation)\n% norm_approx.m - Examples 5.6,5.8: An l_p norm approximation problem\n% ex_5_19.m - Exercise 5.19c: Markovitz portfolio optimization w/ diversification constraint\n% ex_5_1.m - Exercise 5.1d: Sensitivity analysis for a simple QCQP\n% ex_5_33.m - Exercise 5.33: Parametrized l1-norm approximation\n% ex_5_39.m - Exercise 5.39: SDP relaxations of the two-way partitioning problem\nhelp Contents\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch05_duality/ex_5_1.m", "content": "% Exercise 5.1d: Sensitivity analysis for a simple QCQP\n% Boyd & Vandenberghe, \"Convex Optimization\"\n% Jolle Skaf - 08/29/05\n% (a figure is generated)\n%\n% Let p_star(u) denote the optimal value of:\n% minimize x^2 + 1\n% s.t. (x-2)(x-2)<=u\n% Finds p_star(u) and plots it versus u.\n\nfprintf(1,'Computing p_star(u)...\\n ');\n\nu = linspace(-0.9,10,50);\np_star = zeros(1,length(u));\nfor i = 1:length(u)\n disp(['for u = ' num2str(u(i))]);\n % perturbed problem\n cvx_begin quiet\n variable x(1)\n minimize ( quad_form(x,1) + 1 )\n quad_form(x,1) - 6*x + 8 <= u(i);\n cvx_end\n % optimal value\n p_star(i) = cvx_optval;\nend\n\nfprintf(1,'Done! \\n');\n\n% Plots\nplot(u,p_star)\naxis([-2 10 -2 10])\nxlabel('u');\nylabel('p^*(u)')\ntitle('Sensitivity analysis: p^*(u) vs u');\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch05_duality/ex_5_19.m", "content": "% Exercise 5.19c: Markovitz portfolio optimization w/ diversification constraint\n% Boyd & Vandenberghe, \"Convex Optimization\"\n% Jolle Skaf - 08/29/05\n%\n% Solves an extension of the classical Markovitz portfolio optimization\n% problem: minimize x'Sx\n% s.t. p_'*x >= r_min\n% 1'*x = 1, x >= 0\n% sum_{i=1}^{0.1*n}x[i] <= alpha\n% where p_ and S are the mean and covariance matrix of the price range\n% vector p, x[i] is the ith greatest component in x.\n% The last constraint can be replaced by this equivalent set of constraints\n% r*t + sum(u) <= alpha\n% t*1 + u >= x\n% u >= 0\n\n% Input data\nrandn('state',0);\nn = 25;\np_mean = randn(n,1);\ntemp = randn(n);\nsig = temp'*temp;\nr = floor(0.1*n);\nalpha = 0.8;\nr_min = 1;\n\n% original formulation\nfprintf(1,'Computing the optimal Markovitz portfolio: \\n');\nfprintf(1,'# using the original formulation ... ');\n\ncvx_begin\n variable x1(n)\n minimize ( quad_form(x1,sig) )\n p_mean'*x1 >= r_min;\n ones(1,n)*x1 == 1;\n x1 >= 0;\n sum_largest(x1,r) <= alpha;\ncvx_end\n\nfprintf(1,'Done! \\n');\nopt1 = cvx_optval;\n\n% equivalent formulation\nfprintf(1,'# using an equivalent formulation by replacing the diversification\\n');\nfprintf(1,' constraint by an equivalent set of linear constraints...');\n\ncvx_begin\n variables x2(n) u(n) t(1)\n minimize ( quad_form(x2,sig) )\n p_mean'*x2 >= r_min;\n sum(x2) == 1;\n x2 >= 0;\n r*t + sum(u) <= alpha;\n t*ones(n,1) + u >= x2;\n u >= 0;\ncvx_end\n\nfprintf(1,'Done! \\n');\nopt2 = cvx_optval;\n\n% Displaying results\ndisp('------------------------------------------------------------------------');\ndisp('The optimal portfolios obtained from the original problem formulation and');\ndisp('from the equivalent formulation are respectively: ');\ndisp([x1 x2])\ndisp('They are equal as expected!');\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch05_duality/ex_5_33.m", "content": "% Exercise 5.33: Parametrized l1-norm approximation\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Jolle Skaf - 08/29/05\n% (a figure is generated)\n%\n% Let p_star(epsilon) be the optimal value of the following problem:\n% minimize ||Ax + b + epsilon*d||_1\n% Plots p_star(epsilon) versus epsilon and demonstrates the fact that it's\n% affine on an interval that includes epsilon = 0.\n\n% Input data\nA = [-2 7 1; ...\n -5 -1 3; ...\n -7 3 -5; ...\n -1 4 -4; ...\n 1 5 5; ...\n 2 -5 -1];\nb = [-4 3 9 0 -11 5]';\nd = [-10 -13 -27 -10 -7 14]';\nepsilon = [-1:0.05:1];\np_star = zeros(size(epsilon));\n\nfprintf(1,'Computing p*(epsilon) for -1 <= epsilon <= 1 ...');\n\nfor i=1:length(epsilon)\n cvx_begin quiet\n variable x(3);\n minimize ( norm( A*x + b + epsilon(i)*d, 1) )\n cvx_end\n p_star(i)= cvx_optval;\nend\n\nfprintf(1,'Done! \\n');\n\n% Plots\nplot(epsilon, p_star)\nline([-.2 -.2], [2 14], 'LineStyle', '--')\nline([.5 .5], [2 14], 'LineStyle', '--')\nxlabel('\\epsilon');\nylabel('p^*(\\epsilon)');\ntitle('p^*(\\epsilon) vs \\epsilon');\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch05_duality/ex_5_39.m", "content": "% Exercise 5.39: SDP relaxations of the two-way partitioning problem\n% Boyd & Vandenberghe. \"Convex Optimization\"\n% Jolle Skaf - 09/07/05\n% (a figure is generated)\n%\n% Compares the optimal values of:\n% 1) the Lagrange dual of the two-way partitioning problem\n% maximize -sum(nu)\n% s.t. W + diag(nu) >= 0\n% 2) the SDP relaxation of the two-way partitioning problem\n% minimize trace(WX)\n% s.t. X >= 0\n% X_ii = 1\n\n% Input data\nrandn('state',0);\nn = 10;\nW = randn(n); W = 0.5*(W + W');\n\n% Lagrange dual\nfprintf(1,'Solving the dual of the two-way partitioning problem...');\n\ncvx_begin sdp\n variable nu(n)\n maximize ( -sum(nu) )\n W + diag(nu) >= 0;\ncvx_end\n\nfprintf(1,'Done! \\n');\nopt1 = cvx_optval;\n\n% SDP relaxation\nfprintf(1,'Solving the SDP relaxation of the two-way partitioning problem...');\n\ncvx_begin sdp\n variable X(n,n) symmetric\n minimize ( trace(W*X) )\n diag(X) == 1;\n X >= 0;\ncvx_end\n\nfprintf(1,'Done! \\n');\nopt2 = cvx_optval;\n\n% Displaying results\ndisp('------------------------------------------------------------------------');\ndisp('The optimal value of the Lagrange dual and the SDP relaxation fo the ');\ndisp('two-way partitioning problem are, respectively, ');\ndisp([opt1 opt2])\ndisp('They are equal as expected!');\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch05_duality/matrix_games.m", "content": "% Section 5.2.5: Mixed strategies for matrix games\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Jolle Skaf - 08/24/05\n%\n% Player 1 wishes to choose u to minimize his expected payoff u'Pv, while\n% player 2 wishes to choose v to maximize u'Pv, where P is the payoff\n% matrix, u and v are the probability distributions of the choices of each\n% player (i.e. u>=0, v>=0, sum(u_i)=1, sum(v_i)=1)\n\n% Input data\nrandn('state',0);\nn = 10;\nm = 10;\nP = randn(n,m);\n\n% Optimal strategy for Player 1\nfprintf(1,'Computing the optimal strategy for player 1 ... ');\n\ncvx_begin\n variable u(n)\n minimize ( max ( P'*u) )\n u >= 0;\n ones(1,n)*u == 1;\ncvx_end\n\nfprintf(1,'Done! \\n');\nobj1 = cvx_optval;\n\n% Optimal strategy for Player 2\nfprintf(1,'Computing the optimal strategy for player 2 ... ');\n\ncvx_begin\n variable v(m)\n maximize ( min (P*v) )\n v >= 0;\n ones(1,m)*v == 1;\ncvx_end\n\nfprintf(1,'Done! \\n');\nobj2 = cvx_optval;\n\n% Displaying results\ndisp('------------------------------------------------------------------------');\ndisp('The optimal strategies for players 1 and 2 are respectively: ');\ndisp([u v]);\ndisp('The expected payoffs for player 1 and player 2 respectively are: ');\n[obj1 obj2]\ndisp('They are equal as expected!');" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch05_duality/matrix_games_LP.m", "content": "% Section 5.2.5: Mixed strategies for matrix games (LP formulation)\n% Boyd & Vandenberghe, \"Convex Optimization\"\n% Jolle Skaf - 08/24/05\n%\n% Player 1 wishes to choose u to minimize his expected payoff u'Pv, while\n% player 2 wishes to choose v to maximize u'Pv, where P is the payoff\n% matrix, u and v are the probability distributions of the choices of each\n% player (i.e. u>=0, v>=0, sum(u_i)=1, sum(v_i)=1)\n% LP formulation: minimize t\n% s.t. u >=0 , sum(u) = 1, P'*u <= t*1\n% maximize t\n% s.t. v >=0 , sum(v) = 1, P*v >= t*1\n\n% Input data\nrandn('state',0);\nn = 12;\nm = 12;\nP = randn(n,m);\n\n% Optimal strategy for Player 1\nfprintf(1,'Computing the optimal strategy for player 1 ... ');\n\ncvx_begin\n variables u(n) t1\n minimize ( t1 )\n u >= 0;\n ones(1,n)*u == 1;\n P'*u <= t1*ones(m,1);\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% Optimal strategy for Player 2\nfprintf(1,'Computing the optimal strategy for player 2 ... ');\n\ncvx_begin\n variables v(m) t2\n maximize ( t2 )\n v >= 0;\n ones(1,m)*v == 1;\n P*v >= t2*ones(n,1);\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% Displaying results\ndisp('------------------------------------------------------------------------');\ndisp('The optimal strategies for players 1 and 2 are respectively: ');\ndisp([u v]);\ndisp('The expected payoffs for player 1 and player 2 respectively are: ');\n[t1 t2]\ndisp('They are equal as expected!');\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch05_duality/norm_approx.m", "content": "% Examples 5.6,5.8: An l_p norm approximation problem\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Jolle Skaf - 08/23/05\n%\n% The goal is to show the following problem formulations give all the same\n% optimal residual norm ||Ax - b||:\n% 1) minimize ||Ax - b||\n% 2) minimize ||y||\n% s.t. Ax - b = y\n% 3) maximize b'v\n% s.t. ||v||* <= 1 , A'v = 0\n% 4) minimize 1/2 ||y||^2\n% s.t. Ax - b = y\n% 5) maximize -1/2||v||*^2 + b'v\n% s.t. A'v = 0\n% where ||.||* denotes the dual norm of ||.||\n\n% Input data\nrandn('state',0);\nn = 4;\nm = 2*n;\nA = randn(m,n);\nb = randn(m,1);\np = 2;\nq = p/(p-1);\n\n% Original problem\nfprintf(1,'Computing the optimal solution of problem 1... ');\n\ncvx_begin quiet\n variable x(n)\n minimize ( norm ( A*x - b , p) )\ncvx_end\n\nfprintf(1,'Done! \\n');\nopt1 = cvx_optval;\n\n% Reformulation 1\nfprintf(1,'Computing the optimal solution of problem 2... ');\n\ncvx_begin quiet\n variables x(n) y(m)\n minimize ( norm ( y , p ) )\n A*x - b == y;\ncvx_end\n\nfprintf(1,'Done! \\n');\nopt2 = cvx_optval;\n\n% Dual of reformulation 1\nfprintf(1,'Computing the optimal solution of problem 3... ');\n\ncvx_begin quiet\n variable nu(m)\n maximize ( b'*nu )\n norm( nu , q ) <= 1;\n A'*nu == 0;\ncvx_end\n\nfprintf(1,'Done! \\n');\nopt3 = cvx_optval;\n\n% Reformulation 2\nfprintf(1,'Computing the optimal solution of problem 4... ');\n\ncvx_begin quiet\n variables x(n) y(m)\n minimize ( 0.5 * square_pos ( norm ( y , p ) ) )\n A*x - b == y;\ncvx_end\n\nfprintf(1,'Done! \\n');\nopt4 = (2*cvx_optval).^(.5);\n\n% Dual of reformulation 2\nfprintf(1,'Computing the optimal solution of problem 5... ');\n\ncvx_begin quiet\n variable nu(m)\n maximize ( -0.5 * square_pos ( norm ( nu , q ) ) + b'*nu )\n A'*nu == 0;\ncvx_end\n\nfprintf(1,'Done! \\n');\nopt5 = (2*cvx_optval).^(0.5);\n\n% Displaying results\ndisp('------------------------------------------------------------------------');\ndisp('The optimal residual values for problems 1,2,3,4 and 5 are respectively:');\n[ opt1 opt2 opt3 opt4 opt5 ]'\ndisp('They are equal as expected!');\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch05_duality/qcqp.m", "content": "% Section 5.2.4: Solves a simple QCQP\n% Boyd & Vandenberghe, \"Convex Optimization\"\n% Jolle Skaf - 08/23/05\n%\n% Solved a QCQP with 3 inequalities:\n% minimize 1/2 x'*P0*x + q0'*r + r0\n% s.t. 1/2 x'*Pi*x + qi'*r + ri <= 0 for i=1,2,3\n% and verifies that strong duality holds.\n\n% Input data\nrandn('state',13);\nn = 6;\nP0 = randn(n); P0 = P0'*P0 + eps*eye(n);\nP1 = randn(n); P1 = P1'*P1;\nP2 = randn(n); P2 = P2'*P2;\nP3 = randn(n); P3 = P3'*P3;\nq0 = randn(n,1); q1 = randn(n,1); q2 = randn(n,1); q3 = randn(n,1);\nr0 = randn(1); r1 = randn(1); r2 = randn(1); r3 = randn(1);\n\nfprintf(1,'Computing the optimal value of the QCQP and its dual... ');\n\ncvx_begin\n variable x(n)\n dual variables lam1 lam2 lam3\n minimize( 0.5*quad_form(x,P0) + q0'*x + r0 )\n lam1: 0.5*quad_form(x,P1) + q1'*x + r1 <= 0;\n lam2: 0.5*quad_form(x,P2) + q2'*x + r2 <= 0;\n lam3: 0.5*quad_form(x,P3) + q3'*x + r3 <= 0;\ncvx_end\n\nobj1 = cvx_optval;\nP_lam = P0 + lam1*P1 + lam2*P2 + lam3*P3;\nq_lam = q0 + lam1*q1 + lam2*q2 + lam3*q3;\nr_lam = r0 + lam1*r1 + lam2*r2 + lam3*r3;\nobj2 = -0.5*q_lam'*inv(P_lam)*q_lam + r_lam;\n\nfprintf(1,'Done! \\n');\n\n% Displaying results\ndisp('------------------------------------------------------------------------');\ndisp('The duality gap is equal to ');\ndisp(obj1-obj2)\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch06_approx_fitting/Contents.m", "content": "% Chapter 6: Approximation and fitting\n%\n% deadzone.m - Section 6.1.2: Residual minimization with deadzone penalty\n% fig6_15.m - Figure 6.15: A comparison of stochastic and worst-case robust approximation\n% fig6_19.m - Figure 6.19: Polynomial fitting\n% convex_interpolation.m - Figure 6.24: Fitting a convex function to given data\n% penalty_comp_cvx.m - Figure 6.2: Penalty function approximation\n% fig6_9.m - Figure 6.9: An optimal tradeoff curve\n% tv_cvx.m - Figures 6.11-6.14: Total variation reconstruction\n% basispursuit.m - Figures 6.21-6.23: Basis pursuit using Gabor functions\n% smoothrec_cvx.m - Figures 6.8-6.10: Quadratic smoothing\n% fig6_5.m - Example 6.2: Robust regression using the Huber penalty\n% fig6_6.m - Example 6.3: Optimal input design\n% regressor_cvx.m - Example 6.4: Regressor selection problem\n% wcrobls.m - Example 6.6: Comparison of worst-case robust, Tikhonov, and nominal least squares\n% fig6_20.m - Example 6.8: Spline fitting\n% preference_regions.m - Example 6.9: Bounding consumer preference\nhelp Contents\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch06_approx_fitting/basispursuit.m", "content": "% Figures 6.21-6.23: Basis pursuit using Gabor functions\n% Section 6.5.4\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX by Argyris Zymnis - 11/27/2005\n%\n% Here we find a sparse basis for a signal y out of\n% a set of Gabor functions. We do this by solving\n% minimize ||A*x-y||_2 + ||x||_1\n%\n% where the columns of A are sampled Gabor functions.\n% We then fix the sparsity pattern obtained and solve\n% minimize ||A*x-y||_2\n%\n% NOTE: The file takes a while to run\n\nclear\n\n% Problem parameters\nsigma = 0.05; % Size of Gaussian function\nTinv = 500; % Inverse of sample time\nThr = 0.001; % Basis signal threshold\nkmax = 30; % Number of signals are 2*kmax+1\nw0 = 5; % Base frequency (w0 * kmax should be 150 for good results)\n\n% Build sine/cosine basis\nfprintf(1,'Building dictionary matrix...');\n% Gaussian kernels\nTK = (Tinv+1)*(2*kmax+1);\nt = (0:Tinv)'/Tinv;\nA = exp(-t.^2/(sigma^2));\nns = nnz(A>=Thr)-1;\nA = A([ns+1:-1:1,2:ns+1],:);\nii = (0:2*ns)';\njj = ones(2*ns+1,1)*(1:Tinv+1);\noT = ones(1,Tinv+1);\nA = sparse(ii(:,oT)+jj,jj,A(:,oT));\nA = A(ns+1:ns+Tinv+1,:);\n% Sine/Cosine basis\nk = [ 0, reshape( [ 1 : kmax ; 1 : kmax ], 1, 2 * kmax ) ];\np = zeros(1,2*kmax+1); p(3:2:end) = -pi/2;\nSC = cos(w0*t*k+ones(Tinv+1,1)*p);\n% Multiply\nii = 1:numel(SC);\njj = rem(ii-1,Tinv+1)+1;\nA = sparse(ii,jj,SC(:)) * A;\nA = reshape(A,Tinv+1,(Tinv+1)*(2*kmax+1));\nfprintf(1,'done.\\n');\n\n% Construct example signal\na = 0.5*sin(t*11)+1;\ntheta = sin(5*t)*30;\nb = a.*sin(theta);\n\n% Solve the Basis Pursuit problem\ndisp('Solving Basis Pursuit problem...');\ntic\ncvx_begin\n variable x(30561)\n minimize(sum_square(A*x-b)+norm(x,1))\ncvx_end\ndisp('done');\ntoc\n\n% Reoptimize problem over nonzero coefficients\np = find(abs(x) > 1e-5);\nA2 = A(:,p);\nx2 = A2 \\ b;\n\n% Constants\nM = 61; % Number of different Basis signals\nsk = 250; % Index of s = 0.5\n\n% Plot example basis functions;\n%if (0) % to do this, re-run basispursuit.m to create A\nfigure(1); clf;\nsubplot(3,1,1); plot(t,A(:,M*sk+1)); axis([0 1 -1 1]);\ntitle('Basis function 1');\nsubplot(3,1,2); plot(t,A(:,M*sk+31)); axis([0 1 -1 1]);\ntitle('Basis function 2');\nsubplot(3,1,3); plot(t,A(:,M*sk+61)); axis([0 1 -1 1]);\ntitle('Basis function 3');\n%print -deps bp-dict_helv.eps\n\n% Plot reconstructed signal\nfigure(2); clf;\nsubplot(2,1,1);\nplot(t,A2*x2,'--',t,b,'-'); axis([0 1 -1.5 1.5]);\nxlabel('t'); ylabel('y_{hat} and y');\ntitle('Original and Reconstructed signals')\nsubplot(2,1,2);\nplot(t,A2*x2-b); axis([0 1 -0.06 0.06]);\ntitle('Reconstruction error')\nxlabel('t'); ylabel('y - y_{hat}');\n%print -deps bp-approx_helv.eps\n\n% Plot frequency plot\nfigure(3); clf;\n\nsubplot(2,1,1);\nplot(t,b); xlabel('t'); ylabel('y'); axis([0 1 -1.5 1.5]);\ntitle('Original Signal')\nsubplot(2,1,2);\nplot(t,150*abs(cos(w0*t)),'--');\nhold on;\nfor k = 1:length(t);\n if(abs(x((k-1)*M+1)) > 1e-5), plot(t(k),0,'o'); end;\n for j = 2:2:kmax*2\n if((abs(x((k-1)*M+j)) > 1e-5) | (abs(x((k-1)*M+j+1)) > 1e-5)),\n plot(t(k),w0*j/2,'o');\n end;\n end;\nend;\nxlabel('t'); ylabel('w');\ntitle('Instantaneous frequency')\nhold off;\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch06_approx_fitting/convex_interpolation.m", "content": "% Figure 6.24: Fitting a convex function to given data\n% Section 6.5.5\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX by Argyris Zymnis - 11/27/2005\n%\n% Here we find the convex function f that best fits\n% some given data in the least squares sense.\n% To do this we solve\n% minimize ||yns - yhat||_2\n% subject to yhat(j) >= yhat(i) + g(i)*(u(j) - u(i)), for all i,j\n\nclear\n\n% Noise level in percent and random seed.\nrand('state',29);\nnoiseint=.05;\n\n% Generate the data set\nu = [0:0.04:2]';\nm=length(u);\ny = 5*(u-1).^4 + .6*(u-1).^2 + 0.5*u;\nv1=u>=.2;\nv2=u<=.6;\nv3=v1.*v2;\ndipvec=((v3.*u-.4*ones(1,size(v3,2))).^(2)).*v3;\ny=y+40*(dipvec-((.2))^2*v3);\n\n% add perturbation and plots the input data\nrandf=noiseint*(rand(m,1)-.5);\nyns=y+norm(y)*(randf);\nfigure\nplot(u,yns,'o');\n\n% min. ||yns-yhat||_2\n% s.t. yhat(j) >= yhat(i) + g(i)*(u(j) - u(i)), for all i,j\ncvx_begin\n variables yhat(m) g(m)\n minimize(norm(yns-yhat))\n subject to\n yhat*ones(1,m) >= ones(m,1)*yhat' + (ones(m,1)*g').*(u*ones(1,m)-ones(m,1)*u');\ncvx_end\n\nnopts =1000;\nt = linspace(0,2,nopts);\nf = max(yhat(:,ones(1,nopts)) + ...\n g(:,ones(1,nopts)).*(t(ones(m,1),:)-u(:,ones(1,nopts))));\nplot(u,yns,'o',t,f,'-');\naxis off\n%print -deps interpol_convex_function2.eps\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch06_approx_fitting/deadzone.m", "content": "% Section 6.1.2: Residual minimization with deadzone penalty\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Joelle Skaf - 08/17/05\n%\n% The penalty function approximation problem has the form:\n% minimize sum(deadzone(Ax - b))\n% where 'deadzone' is the deadzone penalty function\n% deadzone(y) = max(abs(y)-1,0)\n\n% Input data\nrandn('state',0);\nm = 16; n = 8;\nA = randn(m,n);\nb = randn(m,1);\n\n% deadzone penalty\n% original formulation\nfprintf(1,'Computing the optimal solution of the deadzone approximation problem: \\n');\n\ncvx_begin\n variable x(n)\n minimize( sum(max(abs(A*x-b)-1,0)) )\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% Compare\ndisp( sprintf( '\\nResults:\\n--------\\nsum(max(abs(A*x-b)-1,0)): %6.4f\\ncvx_optval: %6.4f\\ncvx_status: %s\\n', sum(max(abs(A*x-b)-1,0)), cvx_optval, cvx_status ) );\ndisp( 'Optimal vector:' );\ndisp( [ ' x = [ ', sprintf( '%7.4f ', x ), ']' ] );\ndisp( 'Residual vector:' );\ndisp( [ ' A*x-b = [ ', sprintf( '%7.4f ', A*x-b ), ']' ] );\ndisp( ' ' );\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch06_approx_fitting/fig6_15.m", "content": "% Figure 6.15: A comparison of stochastic and worst-case robust approximation\n% Section 6.4.2\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX by Joelle Skaf - 10/03/05\n%\n% Consider the least-squares problem:\n% minimize ||(A + tB)x - b||_2\n% where t is an uncertain parameter in [-1,1]\n% Three approximate solutions are found:\n% 1- nominal optimal (i.e. letting t=0)\n% 2- stochastic robust approximation:\n% minimize E||(A+tB)x - b||_2\n% assuming u is uniformly distributed on [-1,1] )\n% (reduces to minimizing E ||(A+tB)x-b||^2 = ||A*x-b||^2 + x^TPx\n% where P = E(t^2) B^TB = (1/3) B^TB )\n% 3- worst-case robust approximation:\n% minimize sup{-1<=u<=1} ||(A+tB)x - b||_2)\n% (reduces to minimizing max{||(A-B)x - b||_2, ||(A+B)x - b||_2} )\n\n% Input Data\nrandn('seed',0);\nm=20; n=10;\nA = randn(m,n);\n[U,S,V] = svd(A);\nS = diag(logspace(-1,1,n));\nA = U(:,1:n)*S*V';\n\nB = randn(m,n);\nB = B/norm(B);\n\nb = randn(m,1);\n\n% Case 1: Nominal optimal solution\nfprintf(1,'Computing the optimal solution for: \\n');\nfprintf(1,'1) the nominal problem ... ');\n\ncvx_begin quiet\n variable x_nom(n)\n minimize ( norm(A*x_nom - b) )\ncvx_end\n% (reduces to minimizing max{||(A-B)x - b||_2, ||(A+B)x - b||_2}\nfprintf(1,'Done! \\n');\n\n% Case 2: Stochastic robust approximation\n\nfprintf(1,'2) the stochastic robust approximation problem ... ');\n\nP = (1/3)*B'*B;\ncvx_begin quiet\n variable x_stoch(n)\n minimize ( square_pos(norm(A*x_stoch - b)) + quad_form(x_stoch,P) )\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% Case 3: Worst-case robust approximation\n\nfprintf(1,'3) the worst-case robust approximation problem ... ');\n\ncvx_begin quiet\n variable x_wc(n)\n minimize ( max( norm((A-B)*x_wc - b), norm((A+B)*x_wc - b) ) )\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% plot residuals\nnovals = 100;\nparvals = linspace(-2,2,novals);\n\nerrvals_ls = [];\nerrvals_stoch = [];\nerrvals_wc = [];\nfor k=1:novals\n errvals_ls = [errvals_ls, norm((A+parvals(k)*B)*x_nom - b)];\n errvals_stoch = [errvals_stoch, norm((A+parvals(k)*B)*x_stoch - b)];\n errvals_wc = [errvals_wc, norm((A+parvals(k)*B)*x_wc - b)];\nend;\n\nplot(parvals, errvals_ls, '-', parvals, errvals_stoch, '-', ...\n parvals, errvals_wc, '-', [-1;-1], [0; 12], 'k--', ...\n [1;1], [0; 12], 'k--');\nxlabel('u');\nylabel('r(u) = ||A(u)x-b||_2');\ntitle('Residual r(u) vs a parameter u for three approximate solutions');\n% print -deps robappr.eps\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch06_approx_fitting/fig6_19.m", "content": "% Figure 6.19: Polynomial fitting\n% Section 6.5.3\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX by Joelle Skaf - 10/03/05\n% (a figure is generated)\n%\n% Given data u_1,...,u_m and v_1,...,v_m in R, the goal is to fit to the\n% data a polynomial of the form\n% p(u) = x_1 + x_2*u + ... + x_n*u^{n-1}\n% i.e. solve the problem: minimize ||Ax - v||\n% where A is the Vandermonde matrix s.t. Aij = u_i^{j-1}\n% Two cases are considered: L2-norm and Linfty-norm\n\n% Input data\nn=6;\nm=40;\nrandn('state',0);\n% generate 50 ponts ui, vi\nu = linspace(-1,1,m);\nv = 1./(5+40*u.^2) + 0.1*u.^3 + 0.01*randn(1,m);\n\n\n% LS fit polynomial x_1 + x_2*u + ... + x_n*u^(n-1) to (ui,vi)\nfprintf(1,'Computing optimal polynomial in the case of L2-norm...');\n\nA = vander(u');\nA = A(:,m-n+[1:n]); % last n columns of A\nx = A\\(v'); % coefficients of the polynomial in the following\n % order: x = [x_n x_(n-1) ... x_2 x_1]'\n\nfprintf(1,'Done! \\n');\n\n% L-infty fit\nfprintf(1,'Computing optimal polynomial in the case of Linfty-norm...');\n\ncvx_begin quiet\n variable x1(n)\n minimize (norm(A*x1 - v', inf))\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% generates 1000 points in [-1,1]\nu2 = linspace(-1.1,1.1,1000);\n\n% evaluate the interpolating polynomial using Horner's method\nvpol = x(1)*ones(1,1000);\nvpoll1 = x1(1)*ones(1,1000);\nfor i = 2:n\n vpol = vpol.*u2 + x(i);\n vpoll1 = vpoll1.*u2 + x1(i);\nend;\n\nfigure\n% plot function and interpolating polynomial\nplot(u2, vpol,'-', u, v, 'o', u2, vpoll1,'--');\nxlabel('u');\nylabel('p(u)');\ntitle('Fitting of data points with two polynomials of degree 5');\nlegend('L_2 norm','data points','L_{\\infty} norm', 'Location','Best');\n% print -deps polapprox.eps\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch06_approx_fitting/fig6_20.m", "content": "% Example 6.8: Spline fitting\n% Section 6.5.3, Figure 6.20\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX by Joelle Skaf - 10/03/05\n% (a figure is generated)\n%\n% Given data u_1,...,u_m and v_1,...,v_m in R, the goal is to fit to the\n% data piecewise polynomials with maximum degree 3 (with continuous first\n% and second derivatives).\n% The [0,1] interval is divided into 3 equal intervals: [-1, -1/3],\n% [-1/3,1/3], [1/3,1] with the following polynomials defined on each\n% interval respectively:\n% p1(t) = x11 + x12*t + x13*t^2 + x14*t^3\n% p2(t) = x21 + x22*t + x23*t^2 + x24*t^3\n% p3(t) = x31 + x32*t + x33*t^2 + x34*t^3\n% L2-norm and Linfty-norm cases are considered\n\n% Input Data\nn=4; % variables per segment\nm=40;\nrandn('state',0);\n% generate 50 points ui, vi\nu = linspace(-1,1,m);\nv = 1./(5+40*u.^2) + 0.1*u.^3 + 0.01*randn(1,m);\n\na = -1/3; b = 1/3; % boundary points\nu1 = u(find(u= a) & (u= b))); m3 = length(u3);\n\nA1 = vander(u1'); A1 = fliplr(A1(:,m1-n+[1:n]));\nA2 = vander(u2'); A2 = fliplr(A2(:,m2-n+[1:n]));\nA3 = vander(u3'); A3 = fliplr(A3(:,m3-n+[1:n]));\n\n%L-2 fit\nfprintf(1,'Computing splines in the case of L2-norm...');\n\ncvx_begin\n variables x1(n) x2(n) x3(n)\n minimize ( norm( [A1*x1;A2*x2;A3*x3] - v') )\n %continuity conditions at point a\n [1 a a^2 a^3]*x1 == [1 a a^2 a^3]*x2;\n [0 1 2*a 3*a^2]*x1 == [0 1 2*a 3*a^2]*x2;\n [0 0 2 6*a ]*x1 == [0 0 2 6*a ]*x2;\n %continuity conditions at point b\n [1 b b^2 b^3]*x2 == [1 b b^2 b^3]*x3;\n [0 1 2*b 3*b^2]*x2 == [0 1 2*b 3*b^2]*x3;\n [0 0 2 6*b ]*x2 == [0 0 2 6*b ]*x3;\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% L-infty fit\nfprintf(1,'Computing splines in the case of Linfty-norm...');\n\ncvx_begin\n variables xl1(n) xl2(n) xl3(n)\n minimize ( norm( [A1*xl1;A2*xl2;A3*xl3] - v', inf) )\n %continuity conditions at point a\n [1 a a^2 a^3]*xl1 == [1 a a^2 a^3]*xl2;\n [0 1 2*a 3*a^2]*xl1 == [0 1 2*a 3*a^2]*xl2;\n [0 0 2 6*a ]*xl1 == [0 0 2 6*a ]*xl2;\n %continuity conditions at point b\n [1 b b^2 b^3]*xl2 == [1 b b^2 b^3]*xl3;\n [0 1 2*b 3*b^2]*xl2 == [0 1 2*b 3*b^2]*xl3;\n [0 0 2 6*b ]*xl2 == [0 0 2 6*b ]*xl3;\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% evaluate the interpolating polynomials using Horner's method\nu1s = linspace(-1.0,a,1000)';\np1 = x1(1) + x1(2)*u1s + x1(3)*u1s.^2 + x1(4).*u1s.^3;\np1l1 = xl1(1) + xl1(2)*u1s + xl1(3)*u1s.^2 + xl1(4).*u1s.^3;\n\nu2s = linspace(a,b,1000)';\np2 = x2(1) + x2(2)*u2s + x2(3)*u2s.^2 + x2(4).*u2s.^3;\np2l1 = xl2(1) + xl2(2)*u2s + xl2(3)*u2s.^2 + xl2(4).*u2s.^3;\n\nu3s = linspace(b,1.0,1000)';\np3 = x3(1) + x3(2)*u3s + x3(3)*u3s.^2 + x3(4).*u3s.^3;\np3l1 = xl3(1) + xl3(2)*u3s + xl3(3)*u3s.^2 + xl3(4).*u3s.^3;\n\nus = [u1s;u2s;u3s];\np = [p1;p2;p3];\npl = [p1l1;p2l1;p3l1];\n% plot function and cubic splines\nd = plot(us,p,'b-',u,v,'go', us,pl,'r--',...\n [-1 -1], [-0.1 0.25], 'k--', [1 1], [-0.1 0.25], 'k--', ...\n [a a], [-0.1 0.25], 'k--', [b b], [-0.1 0.25], 'k--');\n\ntitle('Approximation using 2 cubic splines');\nxlabel('u');\nylabel('f(u)');\nlegend('L_2 norm','Data points','L_{\\infty} norm', 'Location','Best');\n% print -deps splineapprox.eps\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch06_approx_fitting/fig6_5.m", "content": "% Example 6.2: Robust regression using the Huber penalty\n% Section 6.1.2, Figure 6.5\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX by Joelle Skaf - 09/07/05\n%\n% Compares the solution of regular Least-squares:\n% minimize sum(y_i - alpha - beta*t_i)^2\n% to the solution of the following:\n% minimize sum( phi_h (y_i - alpha - beta*t_i)^2 )\n% where phi_h is the Huber penalty function, (t_i,y_i) are data points in a\n% plane.\n\n% Input data\nrandn('seed',1);\nrand('seed',1);\n\nm=40; n=2; A = randn(m,n);\nxex = [5;1];\npts = -10+20*rand(m,1);\nA = [ones(m,1) pts];\nb = A*xex + .5*randn(m,1);\noutliers = [-9.5; 9]; outvals = [20; -15];\nA = [A; ones(length(outliers),1), outliers];\nb = [b; outvals];\nm = size(A,1);\npts = [pts;outliers];\n\n% Least Squares\nfprintf(1,'Computing the solution of the least-squares problem...');\n\nxls = A\\b;\n\nfprintf(1,'Done! \\n');\n\n% Huber\nfprintf(1,'Computing the solution of the huber-penalized problem...');\n\ncvx_begin quiet\n variable xhub(n)\n minimize(sum(huber(A*xhub-b)))\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% Plots\nfigure(1); hold off\nplot(pts,b,'o', [-11; 11], [1 -11; 1 11]*xhub, '-', ...\n [-11; 11], [1 -11; 1 11]*xls, '--');\naxis([-11 11 -20 25])\ntitle('Least-square fit vs robust least-squares fit (Huber-penalized)');\nxlabel('x');\nylabel('y');\nlegend('Data points','Huber penalty','Regular LS','Location','Best');\n%print -deps robustls.eps\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch06_approx_fitting/fig6_6.m", "content": "% Example 6.3: Optimal input design\n% Section 6.3.2, Figure 6.6\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX by Joelle Skaf - 09/26/05\n%\n% Consider a dynamical system with scalar input sequence u(0),u(1),...,u(N)\n% and scalar output sequence y(0),y(1),...,y(N) related by the convolution\n% y = h*u where h = [h(0),h(1),...,h(N)] is the impulse response.\n% Our goal is to choose an input sequence to minimize the weighted sum:\n% minimize J_track + delta*J_der + eta*J_mag\n% where J_track = 1/(N+1) sum_{t=0}^N (y(t) - y_des(t))^2\n% J_mag = 1/(N+1) sum_{t=0}^N u(t)^2\n% J_der = 1/N sum_{t=0}^{N-1} (u(t+1) - u(t))^2\n\n% Input data\nm = 201; n = 201; N=200;\nt = [0:m-1]';\nh = (1/9)*((.9).^t) .* (1 - 0.4*cos(2*t)); % sum(h) is approx. 1\n\nH = toeplitz(h', [h(1) zeros(1,n-1)]);\n% m1 = round(m/6); m2 = round(m/5); m3 = round(m/5); m4 = m-m1-m2-m3;\nm1 = round(m/5); m2 = round(m/4); m3 = round(m/4); m4 = m-m1-m2-m3;\ny_des = [zeros(m1,1); ones(m2,1); -ones(m3,1); zeros(m4,1)];\n\nD = [-eye(n-1) zeros(n-1,1)];\nD = D + [zeros(n-1,1) eye(n-1)];\n\ndelta = [0 0 0.3];\neta = [0.005 0.05 0.05];\ndisp('Finding the optimal input for ');\nfor i = 1:length(delta)\n disp(['* delta = ' num2str(delta(i)) ' and eta = ' num2str(eta(i))]);\n cvx_begin quiet\n variable u(N+1)\n minimize ( square_pos(norm(H*u - y_des))/(N+1) + ...\n eta(i)*square_pos(norm(u))/(N+1) + ...\n delta(i)*square_pos(norm(D*u))/N )\n cvx_end\n switch(i)\n case 1\n figure(1); plot(t,u); xlabel('t'); ylabel('u(t)');\n title(['Input u(t) for \\delta = ' num2str(delta(i)) ' and \\eta = ' num2str(eta(i))]);\n % print -deps smoothreg1u.eps\n figure(2); plot(t,H*u); xlabel('t'); ylabel('y(t)');\n title(['Output y(t) for \\delta = ' num2str(delta(i)) ' and \\eta = ' num2str(eta(i))]);\n % print -deps smoothreg1y.eps\n case 2\n figure(3); plot(t,u); xlabel('t'); ylabel('u(t)');\n title(['Input u(t) for \\delta = ' num2str(delta(i)) ' and \\eta = ' num2str(eta(i))]);\n % print -deps smoothreg2u.eps\n figure(4); plot(t,H*u); xlabel('t'); ylabel('y(t)');\n title(['Output y(t) for \\delta = ' num2str(delta(i)) ' and \\eta = ' num2str(eta(i))]);\n % print -deps smoothreg2y.eps\n case 3\n figure(5); plot(t,u); xlabel('t'); ylabel('u(t)');\n title(['Input u(t) for \\delta = ' num2str(delta(i)) ' and \\eta = ' num2str(eta(i))]);\n % print -deps smoothreg3u.eps\n figure(6); plot(t,H*u); xlabel('t'); ylabel('y(t)');\n title(['Output y(t) for \\delta = ' num2str(delta(i)) ' and \\eta = ' num2str(eta(i))]);\n % print -deps smoothreg3y.eps\n end\nend\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch06_approx_fitting/fig6_9.m", "content": "% Figure 6.9: An optimal tradeoff curve\n% Section 6.3.3\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX Joelle Skaf - 09/29/05\n% (a figure is generated)\n%\n% Plots the optimal trade-off curve between ||Dx||_2 and ||x-x_cor||_2 by\n% solving the following problem for different values of delta:\n% minimize ||x - x_cor||^2 + delta*||Dx||^2\n% where x_cor is the a problem parameter, ||Dx|| is a measure of smoothness\n\n%Input data\nrandn('state',0);\nn = 4000; t = (0:n-1)';\nexact = 0.5*sin((2*pi/n)*t).*sin(0.01*t);\ncorrupt = exact + 0.05*randn(size(exact));\n\ne = ones(n,1);\nD = spdiags([-e e], -1:0, n, n);\n\n% tradeoff curve\nnopts = 50;\nlambdas = logspace(-10,10,nopts);\nobj1 = zeros(1,nopts);\nobj2 = zeros(1,nopts);\n\nfprintf(1,'Generating the optimal trade-off curve for different values of delta...\\n');\nfor i=1:nopts\n disp(['* delta = ' num2str(lambdas(i))]);\n cvx_begin quiet\n variable x(n)\n minimize ( norm(x - corrupt) + lambdas(i)*norm(D*x) )\n cvx_end\n obj1(i) = norm(x - corrupt);\n obj2(i) = norm(D*x);\nend\nfprintf(1,'Done! \\n');\n\n% Plots\nplot(obj1, obj2)\nxlabel('||x - x_{cor}||_2');\nylabel('||Dx||_2');\ntitle('Optimal trade-off curve');\n% print -deps smoothrec_tradeoff.eps\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch06_approx_fitting/penalty_comp_cvx.m", "content": "% Figure 6.2: Penalty function approximation\n% Section 6.1.2\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX Argyris Zymnis - 10/2005\n%\n% Comparison of the ell1, ell2, deadzone-linear and log-barrier\n% penalty functions for the approximation problem:\n% minimize phi(A*x-b),\n%\n% where phi(x) is the penalty function\n% Log-barrier will be implemented in the future version of CVX\n\n% Generate input data\nrandn('state',0);\nm=100; n=30;\nA = randn(m,n);\nb = randn(m,1);\n\n% ell_1 approximation\n% minimize ||Ax+b||_1\ndisp('ell-one approximation');\ncvx_begin\n variable x1(n)\n minimize(norm(A*x1+b,1))\ncvx_end\n\n% ell_2 approximation\n% minimize ||Ax+b||_2\ndisp('ell-2');\nx2=-A\\b;\n\n% deadzone penalty approximation\n% minimize sum(deadzone(Ax+b,0.5))\n% deadzone(y,z) = max(abs(y)-z,0)\ndz = 0.5;\ndisp('deadzone penalty');\ncvx_begin\n variable xdz(n)\n minimize(sum(max(abs(A*xdz+b)-dz,0)))\ncvx_end\n\n\n% log-barrier penalty approximation\n%\n% minimize -sum log(1-(ai'*x+bi)^2)\n\ndisp('log-barrier')\n\n% parameters for Newton Method & line search\nalpha=.01; beta=.5;\n\n% minimize linfty norm to get starting point\ncvx_begin\n variable xlb(n)\n minimize norm(A*xlb+b,Inf)\ncvx_end\nlinf = cvx_optval;\nA = A/(1.1*linf);\nb = b/(1.1*linf);\n\nfor iters = 1:50\n\n yp = 1 - (A*xlb+b); ym = (A*xlb+b) + 1;\n f = -sum(log(yp)) - sum(log(ym));\n g = A'*(1./yp) - A'*(1./ym);\n H = A'*diag(1./(yp.^2) + 1./(ym.^2))*A;\n v = -H\\g;\n fprime = g'*v;\n ntdecr = sqrt(-fprime);\n if (ntdecr < 1e-5), break; end;\n\n t = 1;\n newx = xlb + t*v;\n while ((min(1-(A*newx +b)) < 0) | (min((A*newx +b)+1) < 0))\n t = beta*t;\n newx = xlb + t*v;\n end;\n newf = -sum(log(1 - (A*newx+b))) - sum(log(1+(A*newx+b)));\n while (newf > f + alpha*t*fprime)\n t = beta*t;\n newx = xlb + t*v;\n newf = -sum(log(1-(A*newx+b))) - sum(log(1+(A*newx+b)));\n end;\n xlb = xlb+t*v;\nend\n\n\n% Plot histogram of residuals\n\nss = max(abs([A*x1+b; A*x2+b; A*xdz+b; A*xlb+b]));\ntt = -ceil(ss):0.05:ceil(ss); % sets center for each bin\n[N1,hist1] = hist(A*x1+b,tt);\n[N2,hist2] = hist(A*x2+b,tt);\n[N3,hist3] = hist(A*xdz+b,tt);\n[N4,hist4] = hist(A*xlb+b,tt);\n\n\nrange_max=2.0; rr=-range_max:1e-2:range_max;\n\nfigure(1), clf, hold off\nsubplot(4,1,1),\nbar(hist1,N1);\nhold on\nplot(rr, abs(rr)*40/3, '-');\nylabel('p=1')\naxis([-range_max range_max 0 40]);\nhold off\n\nsubplot(4,1,2),\nbar(hist2,N2);\nhold on;\nplot(rr,2*rr.^2),\nylabel('p=2')\naxis([-range_max range_max 0 11]);\nhold off\n\nsubplot(4,1,3),\nbar(hist3,N3);\nhold on\nplot(rr,30/3*max(0,abs(rr)-dz))\nylabel('Deadzone')\naxis([-range_max range_max 0 25]);\nhold off\n\nsubplot(4,1,4),\nbar(hist4,N4);\nrr_lb=linspace(-1+(1e-6),1-(1e-6),600);\nhold on\nplot(rr_lb, -3*log(1-rr_lb.^2),rr,2*rr.^2,'--')\naxis([-range_max range_max 0 11]);\nylabel('Log barrier'),\nxlabel('r')\nhold off\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch06_approx_fitting/preference_regions.m", "content": "% Example 6.9: Bounding consumer preference\n% Section 6.5.5, Figures 6.25-6.26\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX Argyris Zymnis - 11/30/2005\n%\n% We are given a set of consumer preference data for bundles\n% of two goods x_1 and x_2. These points are generated by\n% taking 40 random points and comparing them using the\n% utility function: u(x_1,x_2) = (1.1*sqrt(x_1)+0.8*sqrt(x_2))/1.9\n% Then, if we have u(i) >= u(j) we say that (i,j) is in Pweak.\n%\n% Given this, we wish to compare the point (0.5,0.5) to each\n% of the bundles in the given dataset. I.e. for each point k in the\n% dataset, we wish to decide wether u(k) >= u(0) or u(k) <= u(0),\n% or both, in which case we cannot make any conclusions about\n% consumer preferences.\n%\n% To do this, we have to solve two LPs for each point:\n% minimize u(k) - u(0)\n% subject to g_i >= 0\n% u(j) <= u(i) + g_i^T(a_j - a_i), for all i,j\n% u(i) >= u(j), for all (i,j) in Pweak\n%\n% and:\n% maximize u(k) - u(0)\n% subject to g_i >= 0\n% u(j) <= u(i) + g_i^T(a_j - a_i), for all i,j\n% u(i) >= u(j), for all (i,j) in Pweak\n%\n% If the second LP has a strictly negative solution, we can deduce that\n% u(k) < u(0). If on the other hand the second LP has a nonnegative\n% solution and the first LP has a strictly positive solution, we can\n% deduce that u(k) > u(0). Finally if none of the two previous cases\n% holds, we cannot make a decision between the two bundles.\n%\n% NOTE: This file requires the auxilliary function utilfun.m to run.\n\ndata= [...\n 4.5e-01 9.6e-01\n 2.1e-01 3.4e-01\n 9.6e-01 3.0e-02\n 8.0e-02 9.2e-01\n 2.0e-02 2.2e-01\n 0.0e+00 3.9e-01\n 2.6e-01 6.4e-01\n 3.5e-01 9.7e-01\n 9.1e-01 7.8e-01\n 1.2e-01 1.4e-01\n 5.8e-01 8.4e-01\n 4.9e-01 2.7e-01\n 7.0e-02 8.0e-01\n 9.3e-01 8.7e-01\n 4.4e-01 8.6e-01\n 3.3e-01 4.2e-01\n 8.9e-01 9.0e-01\n 4.9e-01 7.0e-02\n 9.5e-01 3.3e-01\n 6.6e-01 2.6e-01\n 9.5e-01 7.3e-01\n 4.2e-01 9.1e-01\n 6.8e-01 2.0e-01\n 5.2e-01 6.2e-01\n 7.7e-01 6.3e-01\n 2.0e-02 2.9e-01\n 9.8e-01 2.0e-02\n 5.0e-02 7.9e-01\n 7.9e-01 1.9e-01\n 6.2e-01 6.0e-02\n 2.8e-01 8.7e-01\n 6.9e-01 1.0e-01\n 6.9e-01 3.7e-01\n 0.0e+00 7.2e-01\n 8.7e-01 1.7e-01\n 6.3e-01 4.0e-02\n 3.2e-01 7.3e-01\n 4.0e-02 4.6e-01\n 3.6e-01 9.5e-01\n 8.2e-01 6.7e-01 ];\n\n% objective point\nobj=[0.5,0.5];\n\nfigure(1);\n% display the utility function's level sets on some data points.\n\nplot(data(:,1),data(:,2),'o');\nhold on;\n\n[X,Y] = meshgrid(0:.01:1,0:.01:1);\nZ=(1.1*X.^(1/2)+0.8*Y.^(1/2))/1.9;\n\n[C,h] = contour(X,Y,Z,[.1,.2,.3,.4,.5,.6,.7,.8,.9],'--');\nclear X Y Z C\nhold off;\nxlabel('x_1');\nylabel('x_2');\nhold off\n\nm = size(data,1); % number of baskets, including 0,1\n\n% add preference data\nPweak = zeros(m+1,m+1);\nfor i=1:m,\n for j=1:m\n if (i~=j) & (1.1*data(i,1).^(1/2)+0.8*data(i,2).^(1/2))/1.9 >= ...\n (1.1*data(j,1).^(1/2)+0.8*data(j,2).^(1/2))/1.9,\n Pweak(i,j) = 1;\n end;\n end;\nend;\n\n% Find consumer preferences\ndata = [data; 0.5 0.5];\nbounds = zeros(m,2);\nfor k = 1:m\n fprintf(1,'Deciding on bundle %d of %d: ',k,m);\n\n % Check for u(k) >= u(0.5,0.5)\n cvx_begin quiet\n variables u(m+1) g_x(m+1) g_y(m+1)\n minimize(u(k)-u(m+1))\n subject to\n g_x >= 0;\n g_y >= 0;\n ones(m+1,1)*u' <= u*ones(1,m+1)+(g_x*ones(1,m+1)).*...\n (ones(m+1,1)*data(:,1)'-data(:,1)*ones(1,m+1))+...\n (g_y*ones(1,m+1)).*(ones(m+1,1)*data(:,2)'-data(:,2)*ones(1,m+1));\n (u*ones(1,m+1)).*Pweak >= (ones(m+1,1)*u').*Pweak;\n cvx_end\n bounds(k,1) = cvx_optval;\n fprintf( 1,'%g', round(cvx_optval) );\n\n % Check for u(0.5,0.5) >= u(k)\n cvx_begin quiet\n variables u(m+1) g_x(m+1) g_y(m+1)\n maximize(u(k)-u(m+1))\n subject to\n g_x >= 0;\n g_y >= 0;\n ones(m+1,1)*u' <= u*ones(1,m+1) + (g_x*ones(1,m+1)).*...\n (ones(m+1,1)*data(:,1)'-data(:,1)*ones(1,m+1))+...\n (g_y*ones(1,m+1)).*(ones(m+1,1)*data(:,2)'-data(:,2)*ones(1,m+1));\n (u*ones(1,m+1)).*Pweak >= (ones(m+1,1)*u').*Pweak;\n cvx_end\n bounds(k,2) = cvx_optval;\n fprintf( 1,' %g\\n', round(cvx_optval) );\n \nend\n\nfigure(2);\nhold off\n\n% plot data pt and contour line through it\nval = 1.1*sqrt(0.5)+ 0.8*sqrt(.5); % value at center\nt = linspace(((val-.8)/1.1)^2, 1, 1000);\ny = ( (val - 1.1*(t.^(1/2)))/.8 ).^2;\nplot(t,y,'--', [.5 .5], [0 1], ':', [0 1], [.5 .5], ':');\naxis([0 1 0 1]);\nhold on\n\nfor k=1:m\n if bounds(k,2) < 1e-5, % preferred over (.5,.5)\n dot = plot(data(k,1),data(k,2),'o');\n %'MarkerSize',8);\n elseif bounds(k,1) > -1e-5, % rejected in favor of (.5,.5)\n dot = plot(data(k,1),data(k,2),'o','MarkerFaceColor',[0 0 0]);\n else % no conclusion\n dot = plot(data(k,1),data(k,2),'square', 'LineWidth',1.0,...\n 'MarkerSize',10);\n end;\nend;\nxlabel('x_1'); ylabel('x_2');\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch06_approx_fitting/regressor_cvx.m", "content": "% Example 6.4: Regressor selection problem\n% Section 6.3.1, Figure 6.7\n% Original by Lieven Vandenberghe\n% Adapted for CVX Argyris Zymnis - 10/2005\n%\n% Solves\n% minimize ||A*x-b||_2\n% subject to card(x) <= k\n%\n% where card(x) denotes the number of nonzero elements in x,\n% by first solving (for some value of alpha close to ||x_ln||_1)\n% minimize ||A*x-b||_2\n% subject to ||x||_1 <= alpha\n%\n% and iteratively decreasing alpha so as to get card(x) = k\n% The sparsity pattern is then fixed in A and b and\n% minimize ||A*x-b||_2\n%\n% is solved\n\nrand('state',0);\n\nm = 10;\nn = 20;\n\nA = randn(m,n);\nb = A*[randn(round(m/2),1); zeros(n-round(m/2),1)];\nb = b + 0.1*norm(b)*randn(m,1);\n\nif (1) %%%%%%%%%%%%\n\n% tradeoff curve for heuristic\n%\n% min. ||Ax-b||_2\n% s.t. ||x||_1 <= alpha\n\nresiduals_heur = [norm(b)];\nxln = A'*((A*A')\\b);\nlnorm = norm(xln,1);\nnopts = 100;\nalphas = linspace(0,lnorm,nopts);\nresiduals_heur = [norm(b)];\ncard_heur = [0];\n\n\nfor k=2:(nopts-1)\n alpha = alphas(k);\n\n cvx_begin quiet\n variable x(n)\n minimize(norm(A*x-b))\n subject to\n norm(x,1) <= alpha;\n cvx_end\n\n x(find(abs(x) < 1e-3*max(abs(x)))) = 0;\n ind = find(abs(x));\n sparsity = length(ind);\n fprintf(1,'Current sparsity pattern k = %d \\n',sparsity);\n x = zeros(n,1); x(ind) = A(:,ind)\\b;\n card_heur = [card_heur, sparsity];\n residuals_heur = [residuals_heur, norm(A*x-b)];\nend;\n\nobj1 = norm(b)\nobj2 = [0];\n\ni=1;\nfor k=1:m-1\n if ~isempty(find(card_heur == k))\n obj2(i+1) = k;\n obj1(i+1) = min(residuals_heur(find(card_heur ==k)));\n i=i+1;\n end;\nend;\nobj2(i) = m; obj1(i) = 0;\n\nend; %%%%%%%%%%%%%%%%%%%\n\n\n% globally optimal tradeoff\n\n\nif (1) %%%%%%%%%%%%%\n\nbestx = zeros(n,m);\nbestres = zeros(1,m);\n\nfor k=1:m-1\n k\n % enumerate sparsity patterns with exactly k nonzeros\n bestres(k) = Inf;\n ind = 1:k\n nocases = 1;\n done = 0;\n while ~done\n done = 1;\n for i=0:k-1\n if (ind(k-i) < n-i),\n ind(k-i:k) = ind(k-i)+[1:i+1];\n done = 0;\n break;\n end;\n end;\n if done, break; end;\n x = zeros(n,1);\n x(ind) = A(:,ind)\\b;\n if (norm(A*x-b) < bestres(k)),\n bestres(k) = norm(A*x-b);\n bestx(:,k) = x;\n end;\n nocases = nocases + 1;\n end;\n nocases\n factorial(n)/(factorial(n-k)*factorial(k))\nend;\n\nx = A\\b;\nbestres(m) = norm(A*x-b);\nbestres = [norm(b) bestres];\n\nend; %%%%%%%%%\n\nfigure\nhold off\nobj1dbl =[];\nobj2dbl =[];\nfor i=1:length(obj1)-1\n obj1dbl = [obj1dbl, obj1(i), obj1(i)];\n obj2dbl = [obj2dbl, obj2(i), obj2(i+1)];\nend;\nobj1dbl = [obj1dbl, obj1(length(obj1))];\nobj2dbl = [obj2dbl, obj2(length(obj1))];\n\nbestobj1 = bestres;\nbestobj2 = [0:1:m];\nbestobj1dbl =[];\nbestobj2dbl =[];\nfor i=1:length(bestobj1)-1\n bestobj1dbl = [bestobj1dbl, bestobj1(i), bestobj1(i)];\n bestobj2dbl = [bestobj2dbl, bestobj2(i), bestobj2(i+1)];\nend;\nbestobj1dbl = [bestobj1dbl, bestobj1(length(bestobj1))];\nbestobj2dbl = [bestobj2dbl, bestobj2(length(bestobj1))];\n\nplot(obj1dbl,obj2dbl,'-', bestobj1dbl, bestobj2dbl,'--');\nhold on\nplot(obj1,obj2,'o', bestobj1, bestobj2,'o');\naxis([0 ceil(2*norm(b))/2 0 m+1])\nxlabel('x');\nylabel('y');\nhold off\n\n%print -deps sparse_regressor_global_helv.eps\n%save regressor_results\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch06_approx_fitting/smoothrec_cvx.m", "content": "% Figures 6.8-6.10: Quadratic smoothing\n% Section 6.3.3\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX Argyris Zymnis - 10/2005\n%\n% Suppose we have a signal x, which does not vary too rapidly\n% and that x is corrupted by some small, rapidly varying noise v,\n% ie. x_cor = x + v. Then if we want to reconstruct x from x_cor\n% we should solve (with x_hat as the parameter)\n% minimize ||x_hat - x_cor||_2 + lambda*phi_quad(x_hat)\n%\n% where phi_quad(x) = sum(x_(i+1)-x_i)^2 , for i = 1 to n-1.\n% The parameter lambda controls the ''smoothness'' of x_hat.\n%\n% The first figure which is generated shows the original and\n% the corrupted signals. The second figure shows the tradeoff curve\n% obtained when varying lambda and the third figure shows three\n% reconstructed signals.\n%\n% NOTE: This is not a good problem to use CVX on. By exploiting\n% the sparsity in this case, we can solve this problem much more\n% efficiently using least squares.\n\n\nrandn('state',0);\n\nn = 4000; t = (0:n-1)';\nexact = 0.5*sin((2*pi/n)*t).*sin(0.01*t);\ncorrupt = exact + 0.05*randn(size(exact));\n\nfigure(1)\nsubplot(211)\nplot(t,exact,'-');\naxis([0 n -0.6 0.6])\ntitle('original signal');\nylabel('ya');\n\nsubplot(212)\nplot(t,corrupt,'-');\naxis([0 n -0.6 0.6])\nxlabel('x');\nylabel('yb');\ntitle('corrupted signal');\n%print -deps smoothrec_signals.eps % figure 6.8, page 313\n\nA = sparse(n-1,n);\nA(:,1:n-1) = -speye(n-1,n-1); A(:,2:n) = A(:,2:n)+speye(n-1,n-1);\n\n% tradeoff curve, figure 6.9, page 313\nnopts = 100;\nlambdas = logspace(-10,10,nopts);\n\nobj1 = []; obj2 = [];\n\nfprintf('computing 100 points on tradeoff curve ... \\n');\n\nfor i=1:nopts\n\n lambda = lambdas(i);\n cvx_begin quiet\n variable x(n)\n minimize(norm(x-corrupt)+lambda*norm(x(2:n)-x(1:n-1)))\n cvx_end\n obj1 = [obj1, norm(full(A*x))];\n obj2 = [obj2, norm(full(x-corrupt))];\n\n fprintf('tradeoff point %d\\n',i);\nend;\n\nfigure(2)\nplot(obj2,obj1,'-'); hold on;\nplot(0,norm(A*corrupt),'o');\nplot(norm(corrupt),0,'o'); hold off;\nxlabel('x');\nylabel('y');\ntitle('||xhat-xcorr||_2 vs. ||D xhat||_2');\n%print -deps smoothrec_tradeoff.eps % figure 6.9, page 313\n\n%three smooth signals, figure 6.10, page 314\nnopts = 3;\nalphas = [8 3 1];\nxrecon = [];\n\nfor i=1:3\n fprintf(1,'Reconstructed Signals: %d of 3 \\n',i)\n alpha = alphas(i);\n cvx_begin quiet\n variable x(n)\n minimize(norm(x(2:n)-x(1:n-1)))\n subject to\n norm(x-corrupt) <= alpha;\n cvx_end\n xrecon = [xrecon, x];\n\nend\n\nfigure(3)\nsubplot(311), plot(xrecon(:,1));\naxis([0 n -0.6 0.6])\nylabel('ya');\ntitle('||xhat-xcorr||_2=8');\nsubplot(312), plot(xrecon(:,2));\naxis([0 n -0.6 0.6])\nylabel('yb');\ntitle('||xhat-xcorr||_2=3');\nsubplot(313), plot(xrecon(:,3));\naxis([0 n -0.6 0.6])\nxlabel('x');\nylabel('yc');\ntitle('||xhat-xcorr||_2=1');\n%print -deps smoothrec_results.eps % figure 6.10, page 314\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch06_approx_fitting/tv_cvx.m", "content": "% Figures 6.11-6.14: Total variation reconstruction\n% Section 6.3.3\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX Argyris Zymnis - 10/2005\n%\n% Suppose we have a signal x, which is mostly smooth, but has several\n% rapid variations (or jumps). If we apply quadratic smoothing on\n% this signal (see SMOOTHREC_CVX) then in order to remove the noise\n% we will not be able to preserve the signal's sharp transitions.\n%\n% We can instead apply total variation reconstruction on the signal\n% by solving\n% minimize ||x_hat - x_cor||_2 + lambda*TV(x_hat)\n%\n% where TV(x) = sum(abs(x_(i+1)-x_i)) , for i = 1 to n-1.\n% The parameter lambda controls the ''smoothness'' of x_hat.\n%\n% Figure 1 shows the original and corrupted signals.\n% Figure 2 shows the tradeoff curve obtained when varying lambda\n% and figure 3 shows three reconstructed signals with different\n% total variation.\n%\n% Figure 4 is a tradeoff curve for quadratic smoothing, while figure 5\n% shows three reconstructed signals with quadratic smoothing.\n% Note how TV reconstruction does a better job of preserving the\n% sharp transitions in the signal while removing the noise.\n\nn = 2000; % length of signal\nt = (0:n)';\n\nfigure(1)\nsubplot(211)\ntemp = ones(ceil((n+1)/4),1);\nexact= [temp; -temp; temp; -temp];\nexact = exact(1:n+1) + 0.5*sin((2*pi/n)*t);\nplot(t,exact,'-');\naxis([0 n+10 -2 2]);\nylabel('ya');\ntitle('signal');\nexact_variation = sum(abs(exact(2:(n+1)) - exact(1:n)))\n\nsubplot(212)\nnoise = 0.1*randn(size(t));\ncorrupt = exact+noise;\nplot(t,corrupt,'-');\naxis([0 n+10 -2 2]);\nnoisy_variation = sum(abs(corrupt(2:(n+1)) - corrupt(1:n)))\nylabel('yb');\nxlabel('x');\ntitle('corrupted signal');\n%print -deps tv_exact_corrupt.eps % figure 6.11, page 315\n\n% tradeoff curve, total variation vs ||x-xcorr||_2\n% figure 6.13 page 316\nfprintf('computing 100 points on tradeoff curve ... \\n');\nnopts = 100;\nTVs = linspace(0.01,.9*noisy_variation,nopts);\n\n obj1 = []; obj2 = [];\n for i=1:nopts\n fprintf('tradeoff point %d\\n',i);\n cvx_begin quiet\n variable xrec(n+1)\n minimize(norm(xrec-corrupt))\n subject to\n norm(xrec(2:(n+1))-xrec(1:n),1) <= TVs(i);\n cvx_end\n obj1 = [obj1, TVs(i)];\n obj2 = [obj2, norm(full(xrec-corrupt))];\n end;\n obj1 = [0 obj1 noisy_variation];\n obj2 = [norm(corrupt) obj2 0];\n\nfigure(2)\n plot(obj2,obj1,'-'); hold on\n plot(0,noisy_variation,'o');\n plot(norm(corrupt),0,'o'); hold off\n xlabel('x');\n ylabel('y');\n title('||Dxhat||_1 versus ||xhat-x||_2');\n %print -deps tv_tradeoff.eps % figure 6.13, page 316\n\nfigure(3)\n subplot(311)\n % solve total variation problem\n cvx_begin quiet\n variable xrec(n+1)\n minimize(norm(xrec-corrupt))\n subject to\n norm(xrec(2:(n+1))-xrec(1:n),1) <= 10;\n cvx_end\n plot(t,xrec','-');\n axis([0 n -2 2]);\n ylabel('ya');\n title('xhat with TV=10');\n\n subplot(312)\n cvx_begin quiet\n variable xrec(n+1)\n minimize(norm(xrec-corrupt))\n subject to\n norm(xrec(2:(n+1))-xrec(1:n),1) <= 8;\n cvx_end\n plot(t,xrec','-');\n axis([0 n -2 2]);\n ylabel('yb');\n title('xhat with TV=8');\n\n subplot(313)\n cvx_begin quiet\n variable xrec(n+1)\n minimize(norm(xrec-corrupt))\n subject to\n norm(xrec(2:(n+1))-xrec(1:n),1) <= 5;\n cvx_end\n plot(t,xrec','-');\n axis([0 n -2 2]);\n xlabel('x');\n ylabel('yc');\n title('xhat with TV=5');\n\n %print -deps tv_rec_10_8_5.eps % figure 6.14, page 317\n\n% quadratic smoothing, figure 6.12, page 316\n% In this case it is not a good idea to use CVX\n% as the sparsity in the closed form solution\n% makes it very easy to solve directly\nA = sparse(n,n+1);\nA(:,1:n) = -speye(n,n); A(:,2:n+1) = A(:,2:n+1)+speye(n,n);\n\n% tradeoff curve with quadratic smoothing\nnopts = 100;\nlambdas = logspace(-10,10,nopts);\nobj1 = []; obj2 = [];\nfor i=1:nopts\n\n lambda = lambdas(i);\n x = (A'*A+lambda*speye(n+1,n+1)) \\ (lambda*corrupt);\n obj1 = [obj1, norm(full(A*x))];\n obj2 = [obj2, norm(full(x-corrupt))];\nend;\n\nfigure(4)\nplot(obj2,obj1,'-'); hold on\nplot(0,norm(A*corrupt),'o');\nplot(norm(corrupt),0,'o'); hold off\nxlabel('x');\nylabel('y');\ntitle('||Dxhat||_2 vs ||xhat-xcor||_2');\n%print -deps tv_smooth_tradeoff.eps\n\nnopts = 3;\nalphas = [10 7 4];\nxrecon = [];\n\nfor i=1:3\n alpha = alphas(i);\n u = 10; l = -10; normx = Inf;\n while (abs(normx-alpha) > 1e-3)\n lambda = 10^((u+l)/2);\n x = (A'*A+lambda*speye(n+1,n+1)) \\ (lambda*corrupt);\n normx = norm(x-corrupt);\n if (normx > alpha), l = (u+l)/2; else u = (u+l)/2; end;\n end;\n xrecon = [xrecon, x];\n\nend;\n\nfigure(5)\nsubplot(311), plot(xrecon(:,1));\naxis([0 n -2 2])\nylabel('ya');\ntitle('quadratic smoothing with ||xhat-xcor||_2=10');\nsubplot(312), plot(xrecon(:,2));\naxis([0 n -2 2])\nylabel('yb');\ntitle('quadratic smoothing with ||xhat-xcor||_2=7');\nsubplot(313), plot(xrecon(:,3));\naxis([0 n -2 2])\nxlabel('x');\nylabel('yc');\ntitle('quadratic smoothing with ||xhat-xcor||_2=4');\n%print -deps tv_smooth_tradeoff_examples.eps\n% figure 6.12, page 316\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch06_approx_fitting/wcrobls.m", "content": "% Example 6.6: Comparison of worst-case robust, Tikhonov, and nominal least squares\n% Section 6.4.2, Figure 6.16\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX Argyris Zymnis - 11/27/05\n% (a figure is generated)\n%\n% Consider the least-squares problem:\n% minimize ||(A0 + u1*A1 + u2*A2)x - b||_2\n% where u = [u1 u2]' is an uncertain parameter and ||u||_2 <= 1\n% Three approximate solutions are found:\n% 1- nominal optimal (i.e. letting u=0)\n% 2- Tikhonov Regularized Solution:\n% minimize ||A0*x - b||_2 + delta*||x||_2\n% for some delta (in this case we set delta = 0.1)\n% 3- worst-case robust approximation:\n% minimize sup{||u||_2 <= 1} ||(A0 + u1*A1 + u2*A2)x - b||_2)\n% (reduces to solving an SDP, see pages 323-324 in the book)\n\nm = 50;\nn = 20;\nrandn('state',0);\nrand('state',0);\n\nA0 = randn(m,n);\n[U,S,V] = svd(A0);\nS= diag(fliplr(logspace(-0.7,1,n)));\nA0 = U(:,1:n)*S*V';\nA1 = randn(m,n); A1 = A1/norm(A1);\nA2 = randn(m,n); A2 = A2/norm(A2);\n\nAperb0 = [A1;A2];\np = 2;\n\nb = U(:,1:n)*randn(n,1) + .1*randn(m,1);\n\n% we consider LS problems || (A0 + u1*A1 + u2*A2) x - b||\n% where ||u|| leq rho\n\n% Nominal Solution\nxnom = A0\\b;\n\n% Tikhonov Regularized Solution\ndelta = .1;\nxtych = [A0; sqrt(delta)*eye(n)] \\ [b; zeros(n,1)];\n\n% Robust Least Squares solution\ncvx_begin sdp quiet\n variables t lambda xrob(n)\n minimize(t+lambda)\n subject to\n [eye(m) A1*xrob A2*xrob A0*xrob-b; ...\n [A1*xrob A2*xrob]' lambda*eye(2) zeros(2,1); ...\n [A0*xrob-b]' zeros(1,2) t] >= 0;\ncvx_end\n\n% Generate Random Trials\nnotrials=100000;\nr = sqrt(rand(notrials,1)); % random on [0,1] with pdf g(r) = 2r;\ntheta = 2*pi*rand(notrials,1); % uniform on [0,2pi]\nv = [r.*cos(theta) r.*sin(theta)];\nls_res = zeros(1,notrials);\nrob2_res = zeros(1,notrials);\nrob_res = zeros(1,notrials);\ntych_res = zeros(1,notrials);\n\nfor i =1:notrials\n\n A = A0 + v(i,1)*A1 + v(i,2)*A2;\n ls_res(i) = norm(A*xnom-b);\n rob_res(i) = norm(A*xrob-b);\n tych_res(i) = norm(A*xtych-b);\n\nend;\n\n\n% Plot histograms\nfigure\n%subplot(211)\n[N1, hist1] = hist(ls_res,[min(ls_res):.1:max(ls_res)]);\nfreq1 = N1/notrials;\n[N2, hist2] = hist(rob_res,hist1);\nfreq2 = N2/notrials;\n[N3, hist3] = hist(tych_res,hist1);\nfreq3 = N3/notrials;\n\n\n\nh = bar(hist3,freq3);\ntext(3, 0.07, 'Tikhonov');\nset(h,'FaceColor',0.90*[1 1 1]);\nhold on\n\nh = bar(hist2,freq2);\ntext(4.2, 0.05, 'Nominal');\nset(h,'FaceColor',0.80*[1 1 1]);\n\nh = bar(hist2,freq2);\nset(h,'FaceColor','none');\ntext(2.6, 0.2, 'Robust LS');\n\nh = bar(hist3,freq3);\nset(h,'FaceColor','none');\nh = bar(hist1,freq1);\nset(h,'FaceColor','none');\n\nxlabel('||(A0 + u1*A1 + u2*A2)*x - b||_2')\nylabel('Frequency')\nhold off\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch07_statistical_estim/Contents.m", "content": "% Chapter 7: Statistical estimation\n%\n% counting_problem_poisson.m - Section 7.1.1: Counting problems with Poisson distribution\n% ML_covariance_est.m - Section 7.1.1: Covariance estimation for Gaussian variables\n% probbounds.m - Section 7.4.3: Probability bounds example with Voronoi diagram\n% expdesign.m - Section 7.5.2: Experiment design\n% logistics.m - Figure 7.1: Logistic regression\n% logistics_gp.m - Figure 7.1: Logistic regression (GP version)\n% maxent.m - Example 7.2: Maximum entropy distribution\n% detector2.m - Example 7.4: Binary hypothesis testing\n% cheb.m - Computes Chebyshev lower bounds on probability vectors\n% cher.m - Computes Chernoff upper bounds on probability\n% montecarlo.m - Probability estimate using Monte Carlo methods\nhelp Contents\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch07_statistical_estim/ML_covariance_est.m", "content": "% Section 7.1.1: Covariance estimation for Gaussian variables\n% Boyd & Vandenberghe \"Convex Optimization\" \n% Joëlle Skaf - 04/24/08 \n% \n% Suppose y \\in\\reals^n is a Gaussian random variable with zero mean and \n% covariance matrix R = \\Expect(yy^T). We want to estimate the covariance \n% matrix R based on N independent samples y1,...,yN drawn from the \n% distribution, and using prior knowledge about R (lower and upper bounds \n% on R) \n% L <= R <= U \n% Let S be R^{-1}. The maximum likelihood (ML) estimate of S is found \n% by solving the problem \n% maximize logdet(S) - tr(SY) \n% subject to U^{-1} <= S <= L^{-1} \n% where Y is the sample covariance of y1,...,yN. \n\n% Input data \nrandn('state',0);\nn = 10; \nN = 1000; \ntmp = randn(n); \nL = tmp*tmp'; \ntmp = randn(n);\nU = L + tmp*tmp'; \nR = (L+U)/2; \ny_sample = sqrtm(R)*randn(n,N); \nY = cov(y_sample'); \nUi = inv(U); Ui = 0.5*(Ui+Ui');\nLi = inv(L); Li = 0.5*(Li+Li');\n\n% Maximum likelihood estimate of R^{-1} \ncvx_begin sdp\n variable S(n,n) symmetric \n maximize( log_det(S) - trace(S*Y) );\n S >= Ui;\n S <= Li;\ncvx_end\nR_hat = inv(S);\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch07_statistical_estim/cheb.m", "content": "function [cvx_optval,P,q,r,X,lambda] = cheb(A,b,Sigma);\n\n% Computes Chebyshev lower bounds on probability vectors\n%\n% Calculates a lower bound on the probability that a random vector\n% x with mean zero and covariance Sigma satisfies A x <= b\n%\n% Sigma must be positive definite\n%\n% output arguments:\n% - prob: lower bound on probability\n% - P,q,r: x'*P*x + 2*q'*x + r is a quadratic function\n% that majorizes the 0-1 indicator function of the complement\n% of the polyhedron,\n% - X, lambda: a discrete distribution with mean zero, covariance\n% Sigma and Prob(X not in C) >= 1-prob\n\n%\n% maximize 1 - Tr Sigma*P - r\n% s.t. [ P q ] [ 0 a_i/2 ]\n% [ q' r - 1 ] >= tau(i) * [ a_i'/2 -b_i ], i=1,...,m\n% taui >= 0\n% [ P q ]\n% [ q' r ] >= 0\n%\n% variables P in Sn, q in Rn, r in R\n%\n\n[ m, n ] = size( A );\ncvx_begin sdp quiet\n variable P(n,n) symmetric\n variables q(n) r tau(m)\n dual variables Z{m}\n maximize( 1 - trace( Sigma * P ) - r )\n subject to\n for i = 1 : m,\n qadj = q - 0.5 * tau(i) * A(i,:)';\n radj = r - 1 + tau(i) * b(i);\n [ P, qadj ; qadj', radj ] >= 0 : Z{i};\n end\n [ P, q ; q', r ] >= 0;\n tau >= 0;\ncvx_end\n\nif nargout < 4,\n return\nend\n\nX = [];\nlambda = [];\nfor i=1:m\n Zi = Z{i};\n if (abs(Zi(3,3)) > 1e-4)\n lambda = [lambda; Zi(3,3)];\n X = [X Zi(1:2,3)/Zi(3,3)];\n end;\nend;\nmu = 1-sum(lambda);\nif (mu>1e-5)\n w = (-X*lambda)/mu;\n W = (Sigma - X*diag(lambda)*X')/mu;\n [v,d] = eig(W-w*w');\n d = diag(d);\n s = sum(d>1e-5);\n if (d(1) > 1e-5)\n X = [X w+sqrt(s)*sqrt(d(1))*v(:,1) ...\n w-sqrt(s)*sqrt(d(1))*v(:,1)];\n lambda = [lambda; mu/(2*s); mu/(2*s)];\n elseif (d(2) > 1e-5)\n X = [X w+sqrt(s)*sqrt(d(2))*v(:,2) ...\n w-sqrt(s)*sqrt(d(2))*v(:,2)];\n lambda = [lambda; mu/(2*s); mu/(2*s)];\n else\n X = [X w];\n lambda = [lambda; mu];\n end;\nend;\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch07_statistical_estim/cher.m", "content": "function prob = cher( A, b, Sigma );\n\n% Computes Chernoff upper bounds on probability\n%\n% Computes a bound on the probability that a Gaussian random vector\n% N(0,Sigma) satisfies A x <= b, by solving a QP\n%\n\n[ m, n ] = size( A );\ncvx_begin quiet\n variable u( m )\n minimize( b' * u + 0.5 * sum_square( chol( Sigma ) * A' * u ) )\n subject to\n u >= 0;\ncvx_end\nprob = exp( cvx_optval );\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch07_statistical_estim/counting_problem_poisson.m", "content": "% Section 7.1.1: Counting problems with Poisson distribution \n% Boyd & Vandenberghe \"Convex Optimization\" \n% Joëlle Skaf - 04/24/08 \n%\n% The random variable y is nonnegative and integer valued with a Poisson\n% distribution with mean mu > 0. In a simple statistical model, the mean mu\n% is modeled as an affine function of a vector u: mu = a'*u + b.\n% We are given a number of observations which consist of pairs (u_i,y_i), \n% i = 1,..., m, where y_i is the observed value of y for which the value of\n% the explanatory variable is u_i. We find a maximum likelihood estimate of\n% the model parameters a and b from these data by solving the problem \n% maximize sum_{i=1}^m (y_i*log(a'*u_i + b) - (a'*u_i + b))\n% where the variables are a and b. \n\n% Input data\nrand('state',0);\nn = 10; \nm = 100; \natrue = rand(n,1); \nbtrue = rand; \n\nu = rand(n,m);\nmu = atrue'*u + btrue; \n\n% Generate random variables y from a Poisson distribution\n% (The distribution is actually truncated at 10*max(mu) for simplicity)\nL = exp(-mu);\nns = ceil(max(10*mu));\ny = sum(cumprod(rand(ns,m))>=L(ones(ns,1),:));\n\n% Maximum likelihood estimate of model parameters \ncvx_begin \n variables a(n) b(1) \n maximize sum(y.*log(a'*u+b) - (a'*u+b))\ncvx_end \n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch07_statistical_estim/detector2.m", "content": "% Example 7.4: Binary hypothesis testing\n% Figure 7.4\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Original version by Lieven Vandenberghe\n% Updated for CVX by Michael Grant, 2005-12-19\n\n% Generate the data\nP = [0.70 0.10\n 0.20 0.10\n 0.05 0.70\n 0.05 0.10];\n[n,m] = size(P);\n\n% Construct the tradeoff curve by finding the\n% the Pareto optimal deterministic detectors,\n% which are the curve's vertices\n\nnopts = 1000;\nweights = logspace(-5,5,nopts);\nobj = [0;1];\ninds = ones(n,1);\n\n% minimize -t1'*q1 - w*t2'*q2\n% s.t. t1+t2 = 1, t1,t2 \\geq 0\n\nnext = 2;\nfor i = 1 : nopts,\n PW = P * diag( [ 1 ; weights(i) ] );\n [ maxvals, maxinds ] = max( PW' ); % max elt in each row\n if (~isequal(maxinds', inds(:,next-1)))\n inds(:,next) = maxinds';\n T = zeros(m,n);\n for j=1:n\n T(maxinds(1,j),j) = 1;\n end;\n obj(:,next) = 1-diag(T*P);\n next = next+1;\n end;\nend;\nplot(obj(1,:), obj(2,:),[0 1], [0 1],'--');\ngrid on\nfor i=2:size(obj,2)-1\n text(obj(1,i),obj(2,i),['a', num2str(i-1)]);\nend;\n\n% Minimax detector: not deterministic\n\ncvx_begin\n variables T( m, n ) D( m, m )\n minimize max( D(1,2), D(2,1) )\n subject to\n D == T * P;\n sum( T, 1 ) == 1;\n T >= 0;\ncvx_end\n\nobjmp = 1 - diag( D );\ntext( objmp(1), objmp(2), 'b' );\nxlabel('P_{fp}'); ylabel('P_{fn}');\n\n%print -deps roc.eps\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch07_statistical_estim/expdesign.m", "content": "% Section 7.5.2: Experiment design\n% Boyd & Vandenberghe, \"Convex Optimization\"\n% Original version by Lieven Vandenberghe\n% Updated for CVX by Almir Mutapcic - Jan 2006\n% (a figure is generated)\n%\n% This is an example of D-optimal, A-optimal, and E-optimal\n% experiment designs.\n\n% problem data\nm = 10;\nangles1 = linspace(3*pi/4,pi,m);\nangles2 = linspace(0,-pi/2,m);\n\n% sensor positions\nV = [3.0*[cos(angles1); sin(angles1)], ...\n 1.5*[cos(angles2); sin(angles2)]];\np = size(V,2);\nn = 2;\nnoangles = 5000;\n\n% D-optimal design\n%\n% maximize log det V*diag(lambda)*V'\n% subject to sum(lambda)=1, lambda >=0\n%\n\n% setup the problem and solve it\ncvx_begin\n variable lambda(p)\n maximize ( det_rootn( V*diag(lambda)*V' ) )\n subject to\n sum(lambda) == 1;\n lambda >= 0;\ncvx_end\nlambdaD = lambda; % save the solution for confidence ellipsoids\n\n% plot results\nfigure(1)\n% draw ellipsoid v'*W*v <= 2\nW = inv(V*diag(lambda)*V');\nangles = linspace(0,2*pi,noangles);\nR = chol(W); % W = R'*R\nellipsoid = sqrt(2)*(R\\[cos(angles); sin(angles)]);\nd = plot(ellipsoid(1,:), ellipsoid(2,:), '--', 0,0,'+');\nset(d, 'Color', [0 0.5 0]); set(d(2),'MarkerFaceColor',[0 0.5 0]);\nhold on;\n\ndot=plot(V(1,:),V(2,:),'o');\nind = find(lambda > 0.001);\ndots = plot(V(1,ind),V(2,ind),'o');\nset(dots,'MarkerFaceColor','blue');\n\n% print out nonzero lambda\ndisp('Nonzero lambda values for D design:');\nfor i=1:length(ind)\n text(V(1,ind(i)),V(2,ind(i)), ['l',int2str(ind(i))]);\n disp(['lambda(',int2str(ind(i)),') = ', num2str(lambda(ind(i)))]);\nend;\n\n%axis([-4.5 4.5 -4.5 4.5])\naxis([-5 5 -5 5])\nset(gca,'Xtick',[]);\nset(gca,'Ytick',[]);\nhold off, axis off\n% print -deps Ddesign.eps\n\n% A-optimal design\n%\n% minimize Trace (sum_i lambdai*vi*vi')^{-1}\n% subject to lambda >= 0, 1'*lambda = 1\n%\n\n% SDP formulation\ne = eye(2,2);\ncvx_begin sdp\n variables lambda(p) u(n)\n minimize ( sum(u) )\n subject to\n for k = 1:n\n [ V*diag(lambda)*V' e(:,k);\n e(k,:) u(k) ] >= 0;\n end\n sum(lambda) == 1;\n lambda >= 0;\ncvx_end\nlambdaA = lambda; % save the solution for confidence ellipsoids\n\n% plot results\nfigure(2)\n% draw ellipsoid v'*W*v <= mu\nW = inv(V*diag(lambda)*V')^2;\nmu = diag(V'*W*V);\nmu = mean(mu(ind));\nangles = linspace(0,2*pi,noangles);\nR = chol(W); % W = R'*R\nellipsoid = sqrt(mu)*(R\\[cos(angles); sin(angles)]);\nd = plot(ellipsoid(1,:), ellipsoid(2,:), '--',0,0,'+');\nset(d, 'Color', [0 0.5 0]);\nset(d(2), 'MarkerFaceColor', [0 0.5 0]);\nhold on\n\ndot = plot(V(1,:),V(2,:),'o');\nind = find(lambda > 0.001);\ndots = plot(V(1,ind),V(2,ind),'o');\nset(dots,'MarkerFaceColor','blue');\n\ndisp('Nonzero lambda values for A design:');\nfor i=1:length(ind)\n text(V(1,ind(i)),V(2,ind(i)), ['l',int2str(ind(i))]);\n disp(['lambda(',int2str(ind(i)),') = ', num2str(lambda(ind(i)))]);\nend;\n%axis([-4.5 4.5 -4.5 4.5])\naxis([-5 5 -5 5])\nset(gca,'Xtick',[]);\nset(gca,'Ytick',[]);\naxis off, hold off\n% print -deps Adesign.eps\n\n% E-optimal design\n%\n% minimize w\n% subject to sum_i lambda_i*vi*vi' >= w*I\n% lambda >= 0, 1'*lambda = 1;\n%\n\ncvx_begin sdp\n variables t lambda(p)\n maximize ( t )\n subject to\n V*diag(lambda)*V' >= t*eye(n,n);\n sum(lambda) == 1;\n lambda >= 0;\ncvx_end\n\nlambdaE = lambda; % save the solution for confidence ellipsoids\n\nfigure(3)\n% draw ellipsoid v'*W*v <= mu\nmu = diag(V'*W*V);\nmu = mean(mu(ind));\nangles = linspace(0,2*pi,noangles);\nR = chol(W); % W = R'*R\nellipsoid = sqrt(mu)*(R\\[cos(angles); sin(angles)]);\nd = plot(ellipsoid(1,:), ellipsoid(2,:), '--', 0, 0, '+');\nset(d, 'Color', [0 0.5 0]);\nset(d(2), 'MarkerFaceColor', [0 0.5 0]);\nhold on\n\ndot = plot(V(1,:),V(2,:),'o');\nlambda = lambda(1:p);\nind = find(lambda > 0.001);\ndots = plot(V(1,ind),V(2,ind),'o');\nset(dots,'MarkerFaceColor','blue');\n\ndisp('Nonzero lambda values for E design:');\nfor i=1:length(ind)\n text(V(1,ind(i)),V(2,ind(i)), ['l',int2str(ind(i))]);\n disp(['lambda(',int2str(ind(i)),') = ', num2str(lambda(ind(i)))]);\nend;\n%axis([-4.5 4.5 -4.5 4.5])\naxis([-5 5 -5 5])\nset(gca,'Xtick',[]);\nset(gca,'Ytick',[]);\naxis off, hold off\n% print -deps Edesign.eps\n\n\n% confidence ellipsoids\neta = 6.2514; % chi2inv(.9,3) value (command available in stat toolbox)\n% draw 90 percent confidence ellipsoid for D design\nW = V*diag(lambdaD)*V';\nangles = linspace(0,2*pi,noangles);\nR = chol(W); % W = R'*R\nellipsoid = sqrt(eta)*(R\\[cos(angles); sin(angles)]);\n\nfigure(4)\nplot(0,0,'ok',ellipsoid(1,:), ellipsoid(2,:), '-');\ntext(ellipsoid(1,1100),ellipsoid(2,1100),'D');\nhold on\n\n% draw 90 percent confidence ellipsoid for A design\nW = V*diag(lambdaA)*V';\nangles = linspace(0,2*pi,noangles);\nR = chol(W); % W = R'*R\nellipsoid = sqrt(eta)*(R\\[cos(angles); sin(angles)]);\nplot(0,0,'ok',ellipsoid(1,:), ellipsoid(2,:), '-');\ntext(ellipsoid(1,1),ellipsoid(2,1),'A');\n\n% draw 90 percent confidence ellipsoid for E design\nW = V*diag(lambdaE)*V';\nangles = linspace(0,2*pi,noangles);\nR = chol(W); % W = R'*R\nellipsoid = sqrt(eta)*(R\\[cos(angles); sin(angles)]);\nd=plot(0,0,'ok',ellipsoid(1,:), ellipsoid(2,:), '-');\nset(d,'Color',[0 0.5 0]);\ntext(ellipsoid(1,4000),ellipsoid(2,4000),'E');\n\n% draw 90 percent confidence ellipsoid for uniform design\nW_u = inv(V*V'/p);\nR = chol(W_u); % W = R'*R\nellipsoid_u = sqrt(eta)*(R\\[cos(angles); sin(angles)]);\nplot(ellipsoid_u(1,:), ellipsoid_u(2,:), '--');\ntext(ellipsoid_u(1),ellipsoid_u(2),'U');\nset(gca,'Xtick',[]);\nset(gca,'Ytick',[]);\naxis off\n% print -deps confidence.eps\nhold off\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch07_statistical_estim/logistics.m", "content": "% Figure 7.1: Logistic regression\n% Section 7.1.1\n% Boyd & Vandenberghe, \"Convex Optimization\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX by Argyris Zymnis - 01/31/06\n%\n% We consider a binary random variable y with prob(y=1) = p and\n% prob(y=0) = 1-p. We assume that that y depends on a vector of\n% explanatory variables u in R^n. The logistic model has the form\n% p = exp(a'*u+b)/(1+exp(a'*u+b)), where a and b are the model parameters.\n% We have m data points (u_1,y_1),...,(u_m,y_m).\n% We can reorder the data so that for u_1,..,u_q the outcome is y = 1\n% and for u_(q+1),...,u_m the outcome is y = 0. Then it can be shown\n% that the ML estimate of a and b can be found by solving\n%\n% minimize sum_{i=1,..,q}(a'*u_i+b) - sum_i(log(1+exp(a'*u_i+b)))\n%\n% In this case we have m = 100 and the u_i are just scalars.\n% The figure shows the data as well as the function\n% f(x) = exp(aml*x+bml)/(1+exp(aml*x+bml)) where aml and bml are the\n% ML estimates of a and b.\n\nrandn('state',0);\nrand('state',0);\n\n% Generate data\na = 1;\nb = -5 ;\nm= 100;\n\nu = 10*rand(m,1);\ny = (rand(m,1) < exp(a*u+b)./(1+exp(a*u+b)));\nplot(u,y,'o')\naxis([-1,11,-0.1, 1.1]);\n\n% Solve problem\n%\n% minimize -(sum_(y_i=1) ui)*a - b + sum log (1+exp(a*ui+b)\n\nU = [ones(m,1) u];\ncvx_expert true\ncvx_begin\n variables x(2)\n maximize(y'*U*x-sum(log_sum_exp([zeros(1,m); x'*U'])))\ncvx_end\n\n% Plot results and logistic function\n\nind1 = find(y==1);\nind2 = find(y==0);\n\naml = x(2); bml = x(1);\nus = linspace(-1,11,1000)';\nps = exp(aml*us + bml)./(1+exp(aml*us+bml));\n\ndots = plot(us,ps,'-', u(ind1),y(ind1),'o',...\n u(ind2),y(ind2),'o');\n\naxis([-1, 11,-0.1,1.1]);\nxlabel('x');\nylabel('y');\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch07_statistical_estim/logistics_gp.m", "content": "% Figure 7.1: Logistic regression (GP version)\n% Section 7.1.1\n% Boyd & Vandenberghe, \"Convex Optimization\"\n% Kim & Mutapcic, \"Logistic regression via geometric programming\"\n% Written for CVX by Almir Mutapcic 02/08/06\n%\n% Solves the logistic regression problem re-formulated as a GP.\n% The original log regression problem is:\n%\n% minimize sum_i(theta'*x_i) + sum_i( log(1 + exp(-theta'*x_i)) )\n%\n% where x are explanatory variables and theta are model parameters.\n% The equivalent GP is obtained by the following change of variables:\n% z_i = exp(theta_i). The log regression problem is then a GP:\n%\n% minimize prod( prod(z_j^x_j) ) * (prod( 1 + prod(z_j^(-x_j)) ))\n%\n% with variables z and data x (explanatory variables).\n\nrandn('state',0);\nrand('state',0);\n\na = 1;\nb = -5;\n\nm = 100;\nu = 10*rand(m,1);\ny = (rand(m,1) < exp(a*u+b)./(1+exp(a*u+b)));\n\n% order the observation data\nind_false = find( y == 0 );\nind_true = find( y == 1 );\n\n% X is the sorted design matrix\n% first have true than false observations followed by the bias term\nX = [u(ind_true); u(ind_false)];\nX = [X ones(size(u,1),1)];\n[m,n] = size(X);\nq = length(ind_true);\n\ncvx_begin gp\n % optimization variables\n variables z(n) t(q) s(m)\n\n minimize( prod(t)*prod(s) )\n subject to\n for k = 1:q\n prod( z.^(X(k,:)') ) <= t(k);\n end\n\n for k = 1:m\n 1 + prod( z.^(-X(k,:)') ) <= s(k);\n end\ncvx_end\n\n% retrieve the optimal values and plot the result\ntheta = log(z);\naml = -theta(1);\nbml = -theta(2);\n\nus = linspace(-1,11,1000)';\nps = exp(aml*us + bml)./(1+exp(aml*us+bml));\n\nplot(us,ps,'-', u(ind_true),y(ind_true),'o', ...\n u(ind_false),y(ind_false),'o');\naxis([-1, 11,-0.1,1.1]);\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch07_statistical_estim/maxent.m", "content": "% Example 7.2: Maximum entropy distribution\n% Section 7.2, Figures 7.2-7.3\n% Boyd & Vandenberghe, \"Convex Optimization\"\n% Originally by Lieven Vandenberghe\n% Adapted for CVX by Michael Grant 4/11/06\n%\n% We consider a probability distribution on 100 equidistant points in the\n% interval [-1,1]. We impose the following prior assumptions:\n%\n% -0.1 <= E(X) <= +0.1\n% +0.5 <= E(X^2) <= +0.6\n% -0.3 <= E(3*X^3-2*X) <= -0.2\n% +0.3 <= Pr(X<0) <= 0.4\n%\n% Along with the constraints sum(p) == 1, p >= 0, these constraints\n% describe a polyhedron of probability distrubtions. In the first figure,\n% the distribution that maximizes entropy is computed. In the second\n% figure, we compute upper and lower bounds for Prob(X<=a_i) for each\n% point -1 <= a_i <= +1 in the distribution, as well as the maximum\n% entropy CDF.\n\n%\n% Represent the polyhedron as follows:\n% A * p <= b\n% sum( p ) == 1\n% p >= 0\n%\n\nn = 100;\na = linspace(-1,1,n);\na2 = a .^ 2;\na3 = 3 * ( a.^ 3 ) - 2 * a;\nap = +( a < 0 );\nA = [ a ; -a ; a2 ; -a2 ; a3 ; -a3 ; ap ; -ap ];\nb = [ 0.1 ; 0.1 ;0.5 ; -0.5 ; -0.2 ; 0.3 ; 0.4 ; -0.3 ];\n\n%\n% Compute the maximum entropy distribution\n%\n\ncvx_expert true\ncvx_begin \n variables pent(n)\n maximize( sum(entr(pent)) )\n sum(pent) == 1;\n A * pent <= b;\ncvx_end\n\n%\n% Compute the bounds on Prob(X<=a_i), i=1,...,n\n%\n\nUbnds = zeros(1,n);\nLbnds = zeros(1,n);\nfor t = 1 : n,\n cvx_begin quiet\n variable p( n )\n minimize sum( p(1:t) )\n p >= 0; \n sum( p ) == 1;\n A * p <= b;\n cvx_end\n Lbnds(t) = cvx_optval;\n cvx_begin quiet\n variable p( n )\n maximize sum( p(1:t) )\n p >= 0; \n sum( p ) == 1;\n A * p <= b;\n cvx_end\n Ubnds(t) = cvx_optval;\n disp( sprintf( '%g <= Prob(x<=%g) <= %g', Lbnds(t), a(t), Ubnds(t) ) );\nend\n\n%\n% Generate the figures\n%\n\nfigure( 1 )\nstairs( a, pent );\nxlabel( 'x' );\nylabel( 'PDF( x )' );\n\nfigure( 2 )\nstairs( a, cumsum( pent ) );\ngrid on;\nhold on\nd = stairs(a, Lbnds,'r-'); set(d,'Color',[0 0.5 0]);\nd = stairs(a, Ubnds,'r-'); set(d,'Color',[0 0.5 0]);\nd = plot([-1,-1], [Lbnds(1), Ubnds(1)],'r-');\nset(d,'Color',[0 0.5 0]);\naxis([-1.1 1.1 -0.1 1.1]);\nxlabel( 'x' );\nylabel( 'CDF( x )' );\nhold off\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch07_statistical_estim/montecarlo.m", "content": "function prob = montecarlo(A,b,Sigma,notrials);\n\n% Probability estimate using Monte Carlo methods\n%\n% Estimates the probability that a random vector x in R2\n% with mean zero and covariance Sigma satisfies Ax <= b,\n% based on 100 * notrials trials. Sigma must be PSD.\n\nm = size(A,1);\n\nR = chol(Sigma); % Y = R^{-T}X has covariance I\nX = R'*randn(2,notrials);\nprob = length(find(sum(A*X - b(:,ones(1,notrials)) < 0) == m))/notrials;\n\nfor i=1:99\nX = R'*randn(2,notrials);\nprob = 0.5*(prob + ...\n length(find(sum(A*X - b(:,ones(1,notrials)) < 0) == m))/notrials);\nend;\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch07_statistical_estim/probbounds.m", "content": "% Section 7.4.3: Probability bounds example with Voronoi diagram\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Original version by Lieven Vandenberghe\n% Adapted for CVX by Michael Grant, 2005/12/19\n% Generates figures 7.5-7.8\n\n% The constellation points. Feel free to change them, but they must\n% produce a valid Voronoi diagram. Therefore, there must be three or\n% more points, and no three can be collinear. To test your selected\n% points, run VORONOI( Cs(:,1), Cs(:,2) ) and see if a complete diagram\n% is drawn; if so, your points should work.\nCs = [ ...\n 0, 0 ; ...\n 1.2, 2.4 ; ...\n -3, +3 ; ...\n -4, 0 ; ...\n -1.6, -3.2 ; ...\n 1.84615384615385, -2.76923076923077 ; ...\n 2.35294117647059, 0.58823529411765 ];\nCmax = max(max(abs(Cs))) * 1.25;\n\n% Plot the constellation points and the Voronoi tesselation\nclf\nCx = Cs( :, 1 );\nCy = Cs( :, 2 );\nm = length( Cx );\nCs = Cs';\n[ Vx, Vy ] = voronoi( Cx, Cy );\nplot( Vx, Vy, 'b-', Cx, Cy, 'o' );\naxis equal\naxis( Cmax * [ -1, 1, -1, 1 ] );\naxis off\nhold on\n\n% Draw unit circles around each constellation point\nnoangles = 200;\nangles = linspace( 0, 2 * pi, noangles );\ncrcpts = [ cos(angles) ; sin(angles) ];\nfor i=1 : m,\n text( Cx(i)+0.25, Cy(i)+0.25, [ 's', int2str(i) ] );\n ellipse = [ cos(angles) ; sin(angles) ] + Cs(:,i) * ones(1,noangles);\n plot( ellipse(1,:), ellipse(2,:), ':' );\nend;\n% print -deps chebbnds_example.eps\n\n% Determine the polyhedrons for each Voronoi region by computing the\n% Delaunay triangulation; that is, matrices A and b such that \n% A * ( x - c ) <= b\n% where c is the constellation point. The faces of a polyhedron for a given\n% point consist of the perpindicular bisectors of edges of the Delaunay\n% triangles to which it belongs.\nm = size( Cs, 2 );\ntri = delaunay( Cx, Cy );\nee = sparse( tri, tri( :, [ 3, 1, 2 ] ), 1, m, m );\nee = ee + ee';\nfor k = 1 : m,\n v2 = find( ee( :, k ) );\n pk = Cs( :, v2 );\n qk = Cs( :, k ) * ones( 1, length( v2 ) );\n Ak = pk - qk;\n bk = 0.5 * sum( Ak .* Ak, 1 );\n As{k} = Ak';\n bs{k} = bk';\nend\n\n% For each polyhedron, compute lower bounds on the probability of\n% correct detection with sigma = 1. Check the results by plotting the\n% ellipsoid x'*P*x + 2*q'*x + r = 1, which should inscribe the polyhedron.\nints = 1 : m;\n% Uncomment to do only the first polyhedron, like the book does\n% ints = 1;\nfor i = ints( : ).',\n [ cd_cheb, P, q, r, X, lambda ] = cheb( As{i}, bs{i}, eye(2) );\n ellipse = sqrt(1-r+q'*(P\\q)) * P^(-1/2) * crcpts + ...\n (-P\\q + Cs(:,i)) * ones(1,noangles);\n plot( ellipse(1,:), ellipse(2,:), 'r-' );\n dots = plot( X(1,:)+Cx(i), X(2,:)+Cy(i), 'ro' );\n set( dots, 'MarkerFaceColor', 'red' );\n set( dots, 'MarkerSize', 4 );\nend\nhold off\n% print -deps chebbnds_example2.eps\n\n% Compute Chebyshev lower bounds for Prob( As(i) * v <= bs(i) )\n% where v = N(Cs(i),sigma) for varying values of sigma\nnsigma = 500;\nsigmas = linspace( 0.001, 6.0, nsigma )';\ncd_cheb = zeros( nsigma, m );\nfprintf( 'Computing lower bounds' );\n% Uncomment to match the book\nints = 1 : m;\n% ints = 1 : 3;\nfor i = ints( : ).',\n for k = 1 : nsigma,\n cd_cheb(k,i) = cheb( As{i}, bs{i}, sigmas(k) * eye(2) );\n end;\n if rem( k, 10 ) == 0,\n fprintf( '.' );\n end\nend;\nfprintf( 'done.\\n' );\n\nfigure(2)\nmc = size( cd_cheb, 2 );\nplot(sqrt(sigmas(:,ones(1,mc))), cd_cheb);\nfor i = 1 : mc,\n text( sqrt(sigmas(nsigma/4)), cd_cheb(nsigma/4,i), ['b',int2str(i)] );\nend;\nxlabel('x');\nylabel('y');\naxis( [ 0, 2.5, 0, 1 ] );\n\n% For the central set, compute Chebyshev lower bounds, Monte Carlo\n% estimates, and Chernoff bounds.\n% for central set, compute cheb lower bounds, mc estimates,\n% and chernoff bounds\n%\n\nnsigma = 50;\nsigmas = linspace( 0.1, 0.5, nsigma );\ncd1 = zeros( 1, nsigma ); % lower bounds for prob( x in C1 )\nmc1 = zeros( 1, nsigma ); % monte carlo estimates of prob( x in C1 )\ncher1 = zeros( m-1, nsigma ); % chernoff upper bounds on Prob( x in Cj | s = s_1 )\nfprintf( 'Computing lower bounds and Monte Carlo sims' );\nfor i = 1 : nsigma,\n % Compute the Chebyshev lower bound on Prob( As{1} * v <= bs{1} )\n % for v in N( 0, Sigma )\n Sigma = sigmas(i)^2 * eye(2);\n cd1(i) = cheb( As{1}, bs{1}, Sigma );\n mc1(i) = montecarlo( As{1}, bs{1}, Sigma, 10000 );\n if rem( i, 5 ) == 0, \n fprintf( '.' );\n end\nend\nfprintf( 'done.\\nComputing upper bounds' );\nfor j = 2 : m,\n A = As{j};\n b = bs{j} - A * ( Cs(:,1) - Cs(:,j) );\n % Compute the Chernoff upper bound on \n % Prob( As{j} * ( v + Cs{1} - Cs{j} ) <= bs{j} )\n % for v in N( 0, Sigma )\n for i = 1 : nsigma,\n cher1( j - 1, i ) = cher( A, b, sigmas(i)^2*eye(2) );\n end\n fprintf( '.' );\nend;\nfprintf( 'done.\\n' );\ncher1 = max( 1 - sum( cher1 ), 0 );\nfigure(4)\nplot( sigmas, cher1, '-', sigmas, mc1, '--' );\naxis( [ 0.2 0.5 0.9 1 ] );\nxlabel( 'x' );\nylabel( 'y' );\n%print -deps chernoff_example.eps\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/Contents.m", "content": "% Chapter 8: Geometric problems\n%\n% separate_pt_poly.m - Section 8.1.1: Separating a point from a polyhedron\n% separate_poly_2D.m - Section 8.2.2: Separating polyhedra in 2D\n% analytic_center.m - Section 8.5.3: Analytic center of a set of linear inequalities\n% svm_1.m - Figure 8.10: Approximate linear discrimination via linear programming\n% svm_2.m - Figure 8.11: Approximate linear discrimination via support vector classifier\n% placement_lin.m - Figure 8.15: Linear placement problem\n% placement_quad.m - Figure 8.16: Quadratic placement problem\n% placement_quar.m - Figure 8.17: Fourth-order placement problem\n% linear_discr.m - Figure 8.8: Simplest linear discrimination\n% robust_lin_discr.m - Figure 8.9: Robust linear discrimination problem\n% ex_8_3.m - Example 8.3: Bounding correlation coefficients\n% ex_8_4.m - Example 8.4: One free point localization\n% test_floorplan.m - Example 8.7: Floorplan generation test script\n% eucl_dist_poly.m - Euclidean distance between polyhedra\n% eucl_dist_poly_2D.m - Euclidean distance between polyhedra in 2D\n% eucl_proj_hlf.m - Euclidean projection on a halfspace\n% eucl_proj_hyp.m - Euclidean projection on a hyperplane\n% eucl_proj_rect.m - Euclidean projection on a rectangle\n% eucl_proj_cone1.m - Euclidean projection on the nonnegative orthant\n% eucl_proj_cone2.m - Euclidean projection on the semidefinite cone\n% floor_plan.m - Floor planning\n% max_vol_ellip_in_polyhedra.m - Maximum volume inscribed ellipsoid in a polyhedron\n% min_vol_elp_finite_set.m - Minimum volume ellipsoid covering a finite set\n% min_vol_union_ellip.m - Minimum volume ellipsoid covering union of ellipsoids\n% ex_8_5.m - One free point localization\n% poly3_discr.m - Polynomial discrimination\n% poly4_discr.m - Polynomial discrimination\n% quad_discr.m - Quadratic discrimination (separating ellipsoid)\n% separate_ell_2D.m - Separating ellipsoids in 2D\n% floor_plan_graphs.m - Solve a floor planning problem given graphs H & V\n% floorplan.m - Computes a minimum-perimeter bounding box subject to positioning constraints\n% data_floorplan_32.mat - (no title)\n% data_floorplan_60.mat - (no title)\nhelp Contents\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/analytic_center.m", "content": "% Section 8.5.3: Analytic center of a set of linear inequalities\n% Boyd & Vandenberghe \"Convex Optimization\" \n% Joëlle Skaf - 04/29/08 \n%\n% The analytic center of a set of linear inequalities and equalities:\n% a_i^Tx <= b_i i=1,...,m,\n% Fx = g,\n% is the solution of the unconstrained minimization problem \n% minimize -sum_{i=1}^m log(b_i-a_i^Tx).\n\n% Input data \nrandn('state', 0);\nrand('state', 0);\nn = 10;\nm = 50; \np = 5;\ntmp = randn(n,1);\nA = randn(m,n); \nb = A*tmp + 10*rand(m,1); \nF = randn(p,n); \ng = F*tmp; \n\n% Analytic center \ncvx_begin\n variable x(n)\n minimize -sum(log(b-A*x))\n F*x == g\ncvx_end\n\ndisp(['The analytic center of the set of linear inequalities and ' ... \n 'equalities is: ']);\ndisp(x);\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/eucl_dist_poly.m", "content": "% Euclidean distance between polyhedra\n% Section 8.2.1, Boyd & Vandenberghe \"Convex Optimization\"\n% Joelle Skaf - 10/09/05\n%\n% Given two polyhedra C = {x | A1*x <= b1} and D = {x | A2*x <= b2}, the\n% distance between them is the optimal value of the problem:\n% minimize || x - y ||_2\n% s.t. A1*x <= b1\n% A2*y <= b2\n\n% Input data\nrandn('state',0);\nrand('state',0);\n\nn = 5;\nm1 = 2*n;\nm2 = 3*n;\nA1 = randn(m1,n);\nA2 = randn(m2,n);\nb1 = rand(m1,1);\nb2 = rand(m2,1) + A2*randn(n,1);\n\n% Solution via CVX\ncvx_begin\n variables x(n) y(n)\n minimize (norm(x - y))\n A1*x <= b1;\n A2*y <= b2;\ncvx_end\n\n% Displaying results\ndisp('------------------------------------------------------------------');\ndisp('The distance between the 2 polyhedra C and D is: ' );\ndisp(['dist(C,D) = ' num2str(cvx_optval)]);\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/eucl_dist_poly_2D.m", "content": "% Euclidean distance between polyhedra in 2D\n% Section 8.2.1, Boyd & Vandenberghe \"Convex Optimization\"\n% Joelle Skaf - 10/09/05\n% (a figure is generated)\n%\n% Given two polyhedra C = {x | A1*x <= b1} and D = {x | A2*x <= b2}, the\n% distance between them is the optimal value of the problem:\n% minimize || x - y ||_2\n% s.t. A1*x <= b1\n% A2*y <= b2\n% Note: here x is in R^2\n\n% Input data\nrandn('seed',0);\nn = 2;\nm = 2*n;\nA1 = randn(m,n);\nb1 = randn(m,1);\nA2 = randn(m,n);\nb2 = randn(m,1);\n\nfprintf(1,'Computing the distance between the 2 polyhedra...');\n% Solution via CVX\ncvx_begin\n variables x(n) y(n)\n minimize (norm(x - y))\n norm(x,1) <= 2;\n norm(y-[4;3],inf) <=1;\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% Displaying results\ndisp('------------------------------------------------------------------');\ndisp('The distance between the 2 polyhedra C and D is: ' );\ndisp(['dist(C,D) = ' num2str(cvx_optval)]);\ndisp('The optimal points are: ')\ndisp('x = '); disp(x);\ndisp('y = '); disp(y);\n\n%Plotting\nfigure;\nfill([-2; 0; 2; 0],[0;2;0;-2],'b', [3;5;5;3],[2;2;4;4],'r')\naxis([-3 6 -3 6])\naxis square\nhold on;\nplot(x(1),x(2),'k.')\nplot(y(1),y(2),'k.')\nplot([x(1) y(1)],[x(2) y(2)])\ntitle('Euclidean distance between 2 polyhedron in R^2');\nxlabel('x_1');\nylabel('x_2');\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/eucl_proj_cone1.m", "content": "% Euclidean projection on the nonnegative orthant\n% Section 8.1.1, Boyd & Vandenberghe \"Convex Optimization\"\n% Joelle Skaf - 10/07/05\n%\n% The projection of x0 on the proper cone K = R+^n is given by\n% minimize || x - x0 ||^2\n% s.t. x >= 0\n% It is also given by: P_K(x0)_k = max{x0_k,0}\n\n% Input data\nrandn('seed',0);\nn = 10;\nx0 = randn(n,1);\n\nfprintf(1,'Computing the analytical solution...');\n\n% Analytical solution\npk_x0 = max(x0,0);\n\nfprintf(1,'Done! \\n');\n\n% Solution via CVX\nfprintf(1,'Computing the solution via a QP...');\n\ncvx_begin quiet\n variable x(n)\n minimize ( norm(x - x0) )\n x >= 0;\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% Verification\ndisp('-----------------------------------------------------------------');\ndisp('Verifying that the analytical solution and the solution obtained via QP are equal: ');\n[pk_x0 x]\ndisp('They are equal as expected!');\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/eucl_proj_cone2.m", "content": "% Euclidean projection on the semidefinite cone\n% Sec. 8.1.1, Boyd & Vandenberghe \"Convex Optimization\"\n% Joelle Skaf - 10/07/05\n%\n% The projection of X0 on the proper cone K = S+^n is given by\n% minimize ||X - X0||_F\n% s.t. X >=0\n% where X is a nxn matrix and ||.||_F is the Frobenius norm\n% It is also given by: P_K(X0)_k = sum_{i=1}^{n}max{0,lam_i}v_i*v_i'\n% s.t. X0= sum_{i=1}^{n}lam_i*v_i*v_i'is the eigenvalue decomposition of X0\n\n% Input data\nrandn('seed',0);\nn = 10;\nX0 = randn(n);\nX0 = 0.5 * (X0 + X0');\n[V,lam] = eig(X0);\n\nfprintf(1,'Computing the analytical solution...');\n% Analytical solution\npk_X0 = V*max(lam,0)*V';\nfprintf(1,'Done! \\n');\n\n% Solution via CVX\nfprintf(1,'Computing the optimal solution by solving an SDP...');\n\ncvx_begin sdp quiet\n variable X(n,n) symmetric\n minimize ( norm(X-X0,'fro') )\n X >= 0;\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% Verification\ndisp('-----------------------------------------------------------------');\ndisp('Verifying that the analytical solution and the solution obtained ');\ndisp('via CVX are equal by computing ||X_star - P_K(X0)||_F: ');\nnorm(X-pk_X0,'fro')\ndisp('Hence X_star and P_K(X0) are equal to working precision.');\n\n\n\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/eucl_proj_hlf.m", "content": "% Euclidean projection on a halfspace\n% Sec. 8.1.1, Boyd & Vandenberghe \"Convex Optimization\"\n% Joelle Skaf - 10/04/05\n%\n% The projection of x0 on a halfspace C = {x | a'*x <= b} is given by\n% minimize || x - x0 ||^2\n% s.t. a'*x <= b\n% It is also given by P_C(x0) = x0 + (b - a'*x0)*a/||a||^2 if a'*x0 > b\n% and x0 if a'*x0 <=b\n\n% Input data\nrandn('seed',0);\nn = 10;\na = randn(n,1);\nb = randn(1);\nx0 = randn(n,1); % a'*x0 <=b\nx1 = x0 + a; % a'*x1 > b\n\n% Analytical solution\nfprintf(1,'Computing the analytical solution for the case where a^T*x0 <=b...');\npc_x0 = x0;\nfprintf(1,'Done! \\n');\nfprintf(1,'Computing the analytical solution for the case where a^T*x0 > b...');\npc_x1 = x1 + (b - a'*x1)*a/norm(a)^2;\nfprintf(1,'Done! \\n');\n\n% Solution via QP\nfprintf(1,'Computing the solution of the QP for the case where a^T*x0 <=b...');\ncvx_begin quiet\n variable xs0(n)\n minimize ( square_pos(norm(xs0 - x0)) )\n a'*xs0 <= b;\ncvx_end\nfprintf(1,'Done! \\n');\n\nfprintf(1,'Computing the solution of the QP for the case where a^T*x0 > b...');\ncvx_begin quiet\n variable xs1(n)\n minimize ( square_pos(norm(xs1 - x1)) )\n a'*xs1 <= b;\ncvx_end\nfprintf(1,'Done! \\n');\n\n% Verification\ndisp('-----------------------------------------------------------------');\ndisp('Verifying that p_C(x0) and x0_star are equal in the case where a^T*x0 <=b');\ndisp(['||p_C(x0) - x0_star|| = ' num2str(norm(xs0 - pc_x0))]);\ndisp('Hence they are equal to working precision');\ndisp('Verifying that p_C(x1) and x1_star are equal in the case where a^T*x1 > b');\ndisp(['||p_C(x1) - x1_star|| = ' num2str(norm(xs1 - pc_x1))]);\ndisp('Hence they are equal to working precision');\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/eucl_proj_hyp.m", "content": "% Euclidean projection on a hyperplane\n% Section 8.1.1, Boyd & Vandenberghe \"Convex Optimization\"\n% Joelle Skaf - 10/04/05\n%\n% The projection of x0 on a hyperplane C = {x | a'*x = b} is given by\n% minimize || x - x0 ||^2\n% s.t. a'*x = b\n% It is also given by P_C(x0) = x0 + (b - a'*x0)*a/||a||^2\n\n% Input data\nrandn('seed',0);\nn = 10;\na = randn(n,1);\nb = randn(1);\nx0 = randn(n,1);\n\n% Analytical solution\nfprintf(1,'Computing the analytical solution ...');\npc_x0 = x0 + (b - a'*x0)*a/norm(a)^2;\nfprintf(1,'Done! \\n');\n\n% Solution via QP\nfprintf(1,'Computing the optimal solution by solving a QP ...');\n\ncvx_begin quiet\n variable x(n)\n minimize ( square_pos(norm(x - x0)) )\n a'*x == b;\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% Verification\ndisp('--------------------------------------------------------------------------------');\ndisp('Verifying that p_C(x0) and x_star belong to the hyperplane C: ');\ndisp(['a^T*p_C(x0) - b = ' num2str(a'*pc_x0 - b)]);\ndisp(['a^T*x_star - b = ' num2str(a'*x - b)]);\ndisp('Computing the distance between x0 and the hyperplane in each case');\ndisp(['||x0 - p_C(x0)|| = ' num2str(norm(x0 - pc_x0))]);\ndisp(['||x0 - x_star || = ' num2str(norm(x0 - x))]);\ndisp('Verifying that the analytical solution and the solution obtained via QP are equal: ');\n[pc_x0 x]\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/eucl_proj_rect.m", "content": "% Euclidean projection on a rectangle\n% Section 8.1.1, Boyd & Vandenberghe \"Convex Optimization\"\n% Joelle Skaf - 10/07/05\n%\n% The projection of x0 on a rectangle C = {x | l <= x <= u} is given by\n% minimize || x - x0 ||^2\n% s.t. l <= x <= u\n% It is also given by P_C(x0)_k = l_k if x0_k <= l_k\n% x0_k if l_k <= x0_k <= u_k\n% u_k if x0_k >= u_k\n\n% Input data: generate vectors l and u such that l < 0 < u\nn = 10;\nl = -rand(n,1);\nu = rand(n,1);\nx0 = randn(n,1);\n\n% Analytical solution\nfprintf(1,'Computing the analytical solution ...');\npc_x0 = x0;\npc_x0(find(x0<=l)) = l(find(x0<=l));\npc_x0(find(x0>=u)) = u(find(x0>=u));\nfprintf(1,'Done! \\n');\n\n% Solution via QP\nfprintf(1,'Computing the optimal solution by solving a QP ...');\n\ncvx_begin quiet\n variable x(n)\n minimize ( norm(x-x0) )\n x <= u;\n x >= l;\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% Verification\ndisp('-----------------------------------------------------------------');\ndisp('Verifying that the analytical solution and the solution obtained via QP are equal: ');\n[pc_x0 x]\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/ex_8_3.m", "content": "% Example 8.3: Bounding correlation coefficients\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Joelle Skaf - 10/09/05\n%\n% Let C be a correlation matrix. Given lower and upper bounds on\n% some of the angles (or correlation coeff.), find the maximum and minimum\n% possible values of rho_14 by solving 2 SDP's\n% minimize/maximize rho_14\n% s.t. C >=0\n% 0.6 <= rho_12 <= 0.9\n% 0.8 <= rho_13 <= 0.9\n% 0.5 <= rho_24 <= 0.7\n% -0.8 <= rho_34 <= -0.4\n\nn = 4;\n\n% Upper bound SDP\nfprintf(1,'Solving the upper bound SDP ...');\n\ncvx_begin sdp\n variable C1(n,n) symmetric\n maximize ( C1(1,4) )\n C1 >= 0;\n diag(C1) == ones(n,1);\n C1(1,2) >= 0.6;\n C1(1,2) <= 0.9;\n C1(1,3) >= 0.8;\n C1(1,3) <= 0.9;\n C1(2,4) >= 0.5;\n C1(2,4) <= 0.7;\n C1(3,4) >= -0.8;\n C1(3,4) <= -0.4;\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% Lower bound SDP\nfprintf(1,'Solving the lower bound SDP ...');\n\ncvx_begin sdp\n variable C2(n,n) symmetric\n minimize ( C2(1,4) )\n C2 >= 0;\n diag(C2) == ones(n,1);\n C2(1,2) >= 0.6;\n C2(1,2) <= 0.9;\n C2(1,3) >= 0.8;\n C2(1,3) <= 0.9;\n C2(2,4) >= 0.5;\n C2(2,4) <= 0.7;\n C2(3,4) >= -0.8;\n C2(3,4) <= -0.4;\ncvx_end\n\nfprintf(1,'Done! \\n');\n% Displaying results\ndisp('--------------------------------------------------------------------------------');\ndisp(['The minimum and maximum values of rho_14 are: ' num2str(C2(1,4)) ' and ' num2str(C1(1,4))]);\ndisp('with corresponding correlation matrices: ');\ndisp(C2)\ndisp(C1)\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/ex_8_4.m", "content": "% Example 8.4: One free point localization\n% Section 8.7.1, Boyd & Vandenberghe \"Convex Optimization\"\n% Joelle Skaf - 10/23/05\n%\n% K fixed points (u1,v1),..., (uK,vK) in R^2 are given and the goal is to place\n% one additional point (u,v) such that:\n% 1) the L1-norm is minimized, i.e.\n% minimize sum_{i=1}^K ( |u - u_i| + |v - v_i| )\n% the solution in this case is any median of the fixed points\n% 2) the L2-norm is minimized, i.e.\n% minimize sum_{i=1}^K ( |u - u_i|^2 + |v - v_i|^2 )^.5\n% the solution in this case is the Weber point of the fixed points\n\n% Data generation\nn = 2;\nK = 11;\nrandn('state',0);\nP = randn(n,K);\n\n% L1 - norm\nfprintf(1,'Minimizing the L1-norm of the sum of the distances to fixed points...');\n\ncvx_begin\n variable x1(2)\n minimize ( sum(norms(x1*ones(1,K) - P,1)) )\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% L2 - norm\nfprintf(1,'Minimizing the L2-norm of the sum of the distances to fixed points...');\n\ncvx_begin\n variable x2(2)\n minimize ( sum(norms(x2*ones(1,K) - P,2)) )\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% Displaying results\ndisp('------------------------------------------------------------------');\ndisp('The optimal point location for the L1-norm case is: ');\ndisp(x1);\ndisp('The optimal point location for the L2-norm case is: ');\ndisp(x2);\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/ex_8_5.m", "content": "% One free point localization\n% Section 8.7.3, Boyd & Vandenberghe \"Convex Optimization\"\n% Joelle Skaf - 10/24/05\n%\n% K fixed points x_1,...,x_K in R^2 are given and the goal is to place\n% one additional point x such that the sum of the squares of the\n% Euclidean distances to fixed points is minimized:\n% minimize sum_{i=1}^K ||x - x_i||^2\n% The optimal point is the average of the given fixed points\n\n% Data generation\nn = 2;\nK = 11;\nrandn('state',0);\nP = randn(n,K);\n\n% minimizing the sum of Euclidean distance\nfprintf(1,'Minimizing the sum of the squares the distances to fixed points...');\n\ncvx_begin\n variable x(2)\n minimize ( sum( square_pos( norms(x*ones(1,K) - P,2) ) ) )\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% Displaying results\ndisp('------------------------------------------------------------------');\ndisp('The optimal point location is: ');\ndisp(x);\ndisp('The average location of the fixed points is');\ndisp(sum(P,2)/K);\ndisp('They are the same as expected!');\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/floor_plan.m", "content": "% Floor planning\n% Section 8.8.1/2, Example 8.7, Boyd & Vandenberghe \"Convex Optimization\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX by Joelle Skaf - 11/13/05\n% (a figure is generated)\n%\n% Rectangles aligned with the axies need to be place in the smallest\n% possible bounding box. No overlap is allowed. Each rectangle to be placed\n% can be reconfigured, within some limits. We are given relative\n% positioning contrainsts on those rectangles, and minimal required areas.\n% In the current problem, 5 rectangles are given\n\n% input data\nn = 5;\nAmin = [100 100 100 100 100; ...\n 20 50 80 150 200; ...\n 180 80 80 80 80; ...\n 20 150 20 200 110];\nr = 1; % minimum spacing constraints\n\nfor iter = 1:4\n A = Amin(iter,:);\n cvx_begin quiet\n variables x(n) y(n) w(n) h(n) W H\n minimize ( W + H )\n x >= r;\n y >= r;\n w >= 0;\n h >= 0;\n x(5) + w(5) + r <= W; % No rectangles at the right of Rectangle 5\n x(1) + w(1) + r <= x(3); % Rectangle 1 is at the left of Rectangle 3\n x(2) + w(2) + r <= x(3); % Rectangle 2 is at the left of Rectangle 3\n x(3) + w(3) + r <= x(5); % Rectangle 3 is at the left of Rectangle 5\n x(4) + w(4) + r <= x(5); % Rectangle 4 is at the left of Rectangle 5\n y(4) + h(4) + r <= H; % No rectangles on top of Rectangle 4\n y(5) + h(5) + r <= H; % No rectangles on top of Rectangle 5\n y(2) + h(2) + r <= y(1); % Rectangle 2 is below Rectangle 1\n y(1) + h(1) + r <= y(4); % Rectangle 1 is below Rectangle 4\n y(3) + h(3) + r <= y(4); % Rectangle 3 is below Rectangle 4\n w <= 5*h; % Aspect ratio constraints\n h <= 5*w;\n w' >= quad_over_lin([A.^.5;zeros(1,n)],h');\n cvx_end\n % Plotting\n subplot(2,2,iter)\n for i=1:n\n fill([x(i); x(i)+w(i); x(i)+w(i); x(i)],[y(i);y(i);y(i)+h(i);y(i)+h(i)],0.90*[1 1 1]);\n hold on;\n text(x(i)+w(i)/2, y(i)+h(i)/2,['B',int2str(i)]);\n end\n axis([0 W 0 H]);\n axis equal; axis off;\nend\n\n% print -deps floorplan-opt.eps\n\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/floor_plan_graphs.m", "content": "% Solve a floor planning problem given graphs H & V\n% Section 8.8.1/2, Example 8.7, Boyd & Vandenberghe \"Convex Optimization\"\n% Joelle Skaf - 11/13/05\n% (a figure is generated)\n%\n% Rectangles aligned with the axes need to be place in the smallest\n% possible bounding box. No overlap is allowed. Each rectangle to be placed\n% can be reconfigured, within some limits.\n% In the current problem, 5 rectangles are to be place. We are given 2\n% acyclic graphs H and V (for horizontal and vertical) that specify the\n% relative positioning constraints of those rectangles.\n% We are also given minimal areas for the rectangles.\n\n% Input data\nn = 5;\n% for each entry i, X_tree(i) = parent(i)\nH_tree = [0 0 1 0 0;...\n 0 0 1 0 0;...\n 0 0 0 0 1;...\n 0 0 0 0 1;...\n 0 0 0 0 0];\nV_tree = [0 0 0 1 0;...\n 1 0 0 0 0;...\n 0 0 0 1 0;...\n 0 0 0 0 0;...\n 0 0 0 0 0];\n\nAmin = [100 100 100 100 100; ...\n 20 50 80 150 200; ...\n 180 80 80 80 80; ...\n 20 150 20 200 110];\nrho = 1; % minimum spacing constraints\n\n% solving the problem by calling the general FLOORPLAN routine\nfor iter = 1:4\n A = Amin(iter,:);\n [W, H, w, h, x, y] = floorplan(H_tree, V_tree, rho, A, 1/5*ones(n,1), 5*ones(n,1));\n % Plotting\n subplot(2,2,iter)\n for i=1:n\n fill([x(i); x(i)+w(i); x(i)+w(i); x(i)],[y(i);y(i);y(i)+h(i);y(i)+h(i)],0.90*[1 1 1]);\n hold on;\n text(x(i)+w(i)/2, y(i)+h(i)/2,['B',int2str(i)]);\n end\n axis([0 W 0 H]);\n axis equal; axis off;\nend\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/floorplan.m", "content": "function [W, H, w, h, x, y] = floorplan(adj_H, adj_V, rho, Amin, l, u )\n\n% Computes a minimum-perimeter bounding box subject to positioning constraints\n%\n% Inputs:\n% adj_H,adj_V: adjacency matrices\n% Amin: minimum spacing: w_i * h_i >= Amin\n% rho: boundaries: rho <= x_i <= W-rho, rho <= y_i <= H-rho\n% l, u: aspect ratio constraints: l_i <= h_i/w_i <= u_i\n% Only adj_H and adj_V are required; the rest are optional. If n is the\n% number of cells, then adj_H and adj_V must be nxn matrices, and Amin,\n% l, and u must be vectors of length n. rho must be a scalar. The default\n% values of rho and Amin are 0.\n% Joelle Skaf - 12/04/05\n\nif nargin < 2\n error('Insufficient number of input arguments');\nend\n\n[n1, n2] = size(adj_H);\n[m1, m2] = size(adj_V);\n\nif n1~=n2\n error('Input adjacency matrix for horizontal graph must be square');\nend\n\nif m1~=m2\n error('Input adjacency matrix for horizontal graph must be square');\nend\n\n\nif n1~=m1\n error('Input adjacency matrices must be of the same size');\nend\n\nn = n1; % number of cells\n\nif nargin <3\n rho = 0;\nend\n\nif nargin <4\n Amin = zeros(1,n);\nelse\n if min(size(Amin)) ~=1\n error('Amin should be a vector');\n end\n if max(size(Amin)) ~= n\n error('Amin should have the same length as the input graphs');\n end\n if size(Amin,1)~=1\n Amin = Amin';\n end\nend\n\nif nargin == 5\n if min(size(1)) ~= 1\n error('l must be a vector');\n end\n if max(size(l)) ~= n\n error('the vector l must have same length as the input graphs');\n end\n if size(l,1) == 1\n l = l';\n end\nend\n\nif nargin == 6\n if min(size(1)) ~= 1\n error('u must be a vector');\n end\n if max(size(u)) ~= n\n error('the vector u must have same length as the input graphs');\n end\n if size(u,1) == 1\n u = u';\n end\nend\n\nif nargin < 6\n u = [];\nend\nif nargin < 5\n l = [];\nend\n\n\n% verifying that there is a directed path between any pair of cells in at\n% least one of the 2 graphs\n\npaths_H = adj_H;\npaths_V = adj_V;\ntemp_H = adj_H^2;\ntemp_V = adj_V^2;\nwhile (sum(temp_H(:))>0)\n paths_H = paths_H + temp_H;\n temp_H = temp_H*adj_H;\nend\nwhile (sum(temp_V(:))>0)\n paths_V = paths_V + temp_V;\n temp_V = temp_V*adj_V;\nend\n\nhh = paths_H + paths_H';\nvv = paths_V + paths_V';\np = hh+vv+eye(n);\nall_paths = p>0;\nif sum(all_paths(:)) ~= n^2\n error('There must be a directed graph between every pair of cells in one or the other input graphs');\nend\n\npar_H = sum(adj_H,2); % number of parents of each node in H\npar_V = sum(adj_V,2); % number of parents of each node in V\nchi_H = sum(adj_H); % number of children of each node in H\nchi_V = sum(adj_V); % number of children of each node in V\n\n% find the root(s) for each tree\nroots_H = find(par_H==0);\nroots_V = find(par_V==0);\n\n% find all non-root nodes for each tree\nnodes_H = find(par_H>0);\nnodes_V = find(par_V>0);\n\n% find leaf(s) for each tree\nleafs_H = find(chi_H==0);\nleafs_V = find(chi_V==0);\n\ncvx_begin quiet\n variables x(n) y(n) w(n) h(n) W H\n minimize ( W + H )\n w >= 0;\n h >= 0;\n x(leafs_H) >= rho;\n y(leafs_V) >= rho;\n x(roots_H) + w(roots_H) + rho <= W;\n y(roots_V) + h(roots_V) + rho <= H;\n for i=1:length(nodes_H)\n node = nodes_H(i);\n c = adj_H(node,:);\n prnt = find(c>0)';\n m = length(prnt);\n x(node) + w(node) + rho <= x(prnt);\n end\n\n for i=1:length(nodes_V)\n node = nodes_V(i);\n c = adj_V(node,:);\n prnt = find(c>0)';\n m = length(prnt);\n y(node) + h(node) + rho <= y(prnt);\n end\n\n if sum(size(u))~= 0\n h <= u.*w;\n end\n if sum(size(l))~= 0\n h >= l.*w;\n end\n w' >= quad_over_lin([Amin.^.5;zeros(1,n)],h');\ncvx_end\n\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/linear_discr.m", "content": "% Figure 8.8: Simplest linear discrimination\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Joelle Skaf - 10/16/05\n% (a figure is generated)\n%\n% The goal is to find a function f(x) = a'*x - b that classifies the points\n% {x_1,...,x_N} and {y_1,...,y_M}. a and b can be obtained by solving a\n% feasibility problem:\n% minimize 0\n% s.t. a'*x_i - b >= 1 for i = 1,...,N\n% a'*y_i - b <= -1 for i = 1,...,M\n\n% data generation\nn = 2;\nrandn('state',3);\nN = 10; M = 6;\nY = [1.5+1*randn(1,M); 2*randn(1,M)];\nX = [-1.5+1*randn(1,N); 2*randn(1,N)];\nT = [-1 1; 1 1];\nY = T*Y; X = T*X;\n\n% Solution via CVX\nfprintf('Finding a separating hyperplane...');\n\ncvx_begin\n variables a(n) b(1)\n X'*a - b >= 1;\n Y'*a - b <= -1;\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% Displaying results\nlinewidth = 0.5; % for the squares and circles\nt_min = min([X(1,:),Y(1,:)]);\nt_max = max([X(1,:),Y(1,:)]);\nt = linspace(t_min-1,t_max+1,100);\np = -a(1)*t/a(2) + b/a(2);\n\ngraph = plot(X(1,:),X(2,:), 'o', Y(1,:), Y(2,:), 'o');\nset(graph(1),'LineWidth',linewidth);\nset(graph(2),'LineWidth',linewidth);\nset(graph(2),'MarkerFaceColor',[0 0.5 0]);\nhold on;\nplot(t,p, '-r');\naxis equal\ntitle('Simple classification using an affine function');\n% print -deps lin-discr.eps\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/max_vol_ellip_in_polyhedra.m", "content": "% Maximum volume inscribed ellipsoid in a polyhedron \n% Section 8.4.1, Boyd & Vandenberghe \"Convex Optimization\"\n% Original version by Lieven Vandenberghe\n% Updated for CVX by Almir Mutapcic - Jan 2006\n% (a figure is generated)\n%\n% We find the ellipsoid E of maximum volume that lies inside of\n% a polyhedra C described by a set of linear inequalities.\n%\n% C = { x | a_i^T x <= b_i, i = 1,...,m } (polyhedra)\n% E = { Bu + d | || u || <= 1 } (ellipsoid) \n%\n% This problem can be formulated as a log det maximization\n% which can then be computed using the det_rootn function, ie,\n% maximize log det B\n% subject to || B a_i || + a_i^T d <= b, for i = 1,...,m\n\n% problem data\nn = 2;\npx = [0 .5 2 3 1];\npy = [0 1 1.5 .5 -.5];\nm = size(px,2);\npxint = sum(px)/m; pyint = sum(py)/m;\npx = [px px(1)];\npy = [py py(1)];\n\n% generate A,b\nA = zeros(m,n); b = zeros(m,1);\nfor i=1:m\n A(i,:) = null([px(i+1)-px(i) py(i+1)-py(i)])';\n b(i) = A(i,:)*.5*[px(i+1)+px(i); py(i+1)+py(i)];\n if A(i,:)*[pxint; pyint]-b(i)>0\n A(i,:) = -A(i,:);\n b(i) = -b(i);\n end\nend\n\n% formulate and solve the problem\ncvx_begin\n variable B(n,n) symmetric\n variable d(n)\n maximize( det_rootn( B ) )\n subject to\n for i = 1:m\n norm( B*A(i,:)', 2 ) + A(i,:)*d <= b(i);\n end\ncvx_end\n\n% make the plots\nnoangles = 200;\nangles = linspace( 0, 2 * pi, noangles );\nellipse_inner = B * [ cos(angles) ; sin(angles) ] + d * ones( 1, noangles );\nellipse_outer = 2*B * [ cos(angles) ; sin(angles) ] + d * ones( 1, noangles );\n\nclf\nplot(px,py)\nhold on\nplot( ellipse_inner(1,:), ellipse_inner(2,:), 'r--' );\nplot( ellipse_outer(1,:), ellipse_outer(2,:), 'r--' );\naxis square\naxis off\nhold off\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/min_vol_elp_finite_set.m", "content": "% Minimum volume ellipsoid covering a finite set\n% Section 8.4.1, Boyd & Vandenberghe \"Convex Optimization\"\n% Almir Mutapcic - 10/05\n% (a figure is generated)\n%\n% Given a finite set of points x_i in R^2, we find the minimum volume\n% ellipsoid (described by matrix A and vector b) that covers all of\n% the points by solving the optimization problem:\n%\n% maximize log det A\n% subject to || A x_i + b || <= 1 for all i\n%\n% CVX cannot yet handle the logdet function, but this problem can be\n% represented in an equivalent way as follows:\n%\n% maximize det(A)^(1/n)\n% subject to || A x_i + b || <= 1 for all i\n%\n% The expression det(A)^(1/n) is SDP-representable, and is implemented\n% by the MATLAB function det_rootn().\n\n% Generate data\nx = [ 0.55 0.0;\n 0.25 0.35\n -0.2 0.2\n -0.25 -0.1\n -0.0 -0.3\n 0.4 -0.2 ]';\n[n,m] = size(x);\n\n% Create and solve the model\ncvx_begin\n variable A(n,n) symmetric\n variable b(n)\n maximize( det_rootn( A ) )\n subject to\n norms( A * x + b * ones( 1, m ), 2 ) <= 1;\ncvx_end\n\n% Plot the results\nclf\nnoangles = 200;\nangles = linspace( 0, 2 * pi, noangles );\nellipse = A \\ [ cos(angles) - b(1) ; sin(angles) - b(2) ];\nplot( x(1,:), x(2,:), 'ro', ellipse(1,:), ellipse(2,:), 'b-' );\naxis off\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/min_vol_union_ellip.m", "content": "% Minimum volume ellipsoid covering union of ellipsoids\n% Section 8.4.1, Boyd & Vandenberghe \"Convex Optimization\"\n% Original version by Lieven Vandenberghe\n% Updated for CVX by Almir Mutapcic - Jan 2006\n% (a figure is generated)\n%\n% We find a smallest ellipsoid containing m ellipsoids\n% { x'*A_i*x + 2*b_i'*x + c < 0 }, for i = 1,...,m\n%\n% Problem data:\n% As = {A1, A2, ..., Am}: cell array of m pos. def. matrices\n% bs = {b1, b2, ..., bm}: cell array of m 2-vectors\n% cs = {c1, c2, ..., cm}: cell array of m scalars\n\n% ellipse data\nAs = {}; bs = {}; cs = {};\nAs{1} = [ 0.1355 0.1148; 0.1148 0.4398];\nAs{2} = [ 0.6064 -0.1022; -0.1022 0.7344];\nAs{3} = [ 0.7127 -0.0559; -0.0559 0.9253];\nAs{4} = [ 0.2706 -0.1379; -0.1379 0.2515];\nAs{5} = [ 0.4008 -0.1112; -0.1112 0.2107];\nbs{1} = [ -0.2042 0.0264]';\nbs{2} = [ 0.8259 -2.1188]';\nbs{3} = [ -0.0256 1.0591]';\nbs{4} = [ 0.1827 -0.3844]';\nbs{5} = [ 0.3823 -0.8253]';\ncs{1} = 0.2351;\ncs{2} = 5.8250;\ncs{3} = 0.9968;\ncs{4} = -0.2981;\ncs{5} = 2.6735;\n\n% dimensions\nn = 2;\nm = size(bs,2); % m ellipsoids given\n\n% construct and solve the problem as posed in the book\ncvx_begin sdp\n variable Asqr(n,n) symmetric\n variable btilde(n)\n variable t(m)\n maximize( det_rootn( Asqr ) )\n subject to\n t >= 0;\n for i = 1:m\n [ -(Asqr - t(i)*As{i}), -(btilde - t(i)*bs{i}), zeros(n,n);\n -(btilde - t(i)*bs{i})', -(- 1 - t(i)*cs{i}), -btilde';\n zeros(n,n), -btilde, Asqr] >= 0;\n end\ncvx_end\n\n% convert to ellipsoid parametrization E = { x | || Ax + b || <= 1 }\nA = sqrtm(Asqr);\nb = A\\btilde;\n\n% plot ellipsoids using { x | || A_i x + b_i || <= alpha } parametrization\nnoangles = 200;\nangles = linspace( 0, 2 * pi, noangles );\n\nclf\nfor i=1:m\n Ai = sqrtm(As{i}); bi = Ai\\bs{i};\n alpha = bs{i}'*inv(As{i})*bs{i} - cs{i};\n ellipse = Ai \\ [ sqrt(alpha)*cos(angles)-bi(1) ; sqrt(alpha)*sin(angles)-bi(2) ];\n plot( ellipse(1,:), ellipse(2,:), 'b-' );\n hold on\nend\nellipse = A \\ [ cos(angles) - b(1) ; sin(angles) - b(2) ];\n\nplot( ellipse(1,:), ellipse(2,:), 'r--' );\naxis square\naxis off\nhold off\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/placement_lin.m", "content": "% Figure 8.15: Linear placement problem\n% Section 8.7.3, Boyd & Vandenberghe \"Convex Optimization\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX by Joelle Skaf - 10/24/05\n% (a figure is generated)\n%\n% Placement problem with 6 free points, 8 fixed points and 27 links.\n% The coordinates of the free points minimize the sum of the Euclidean\n% lengths of the links, i.e.\n% minimize sum_{i= t for i = 1,...,M\n\n% Data generation\nrand('state',0);\nN = 100;\nM = 120;\n\n% The points X lie within a circle of radius 0.9, with a wedge of points\n% near [1.1,0] removed. The points Y lie outside a circle of radius 1.1,\n% with a wedge of points near [1.1,0] added. The wedges are precisely what\n% makes the separation difficult and interesting.\nX = 2 * rand(2,N) - 1;\nX = X * diag(0.9*rand(1,N)./sqrt(sum(X.^2)));\nY = 2 * rand(2,M) - 1;\nY = Y * diag((1.1+rand(1,M))./sqrt(sum(Y.^2)));\nd = sqrt(sum((X-[1.1;0]*ones(1,N)).^2));\nY = [ Y, X(:,d<0.9) ];\nX = X(:,d>1);\nN = size(X,2);\nM = size(Y,2);\n\n% Construct Vandermonde-style monomial matrices\np1 = [0,0,1,0,1,2,0,1,2,3]';\np2 = [0,1,1,2,2,2,3,3,3,3]'-p1;\nnp = length(p1);\nop = ones(np,1);\nmonX = X(op,:) .^ p1(:,ones(1,N)) .* X(2*op,:) .^ p2(:,ones(1,N));\nmonY = Y(op,:) .^ p1(:,ones(1,M)) .* Y(2*op,:) .^ p2(:,ones(1,M));\n\n% Solution via CVX\nfprintf(1,'Finding the optimal polynomial of order 4 that separates the 2 classes...');\n\ncvx_begin\n variables a(np) t(1)\n minimize ( t )\n a'*monX <= t;\n a'*monY >= -t;\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% Displaying results\nnopts = 2000;\nangles = linspace(0,2*pi,nopts);\ncont = zeros(2,nopts);\nfor i=1:nopts\n v = [cos(angles(i)); sin(angles(i))];\n l = 0; u = 1;\n while ( u - l > 1e-3 )\n s = (u+l)/2;\n x = s * v;\n if a' * ( x(op,:) .^ p1 .* x(2*op) .^ p2 ) > 0, \n u = s; \n else\n l = s;\n end\n end;\n s = (u+l)/2;\n cont(:,i) = s*v;\nend;\n\ngraph=plot(X(1,:),X(2,:),'o', Y(1,:), Y(2,:),'o', cont(1,:), cont(2,:), '-');\nset(graph(2),'MarkerFaceColor',[0 0.5 0]);\ntitle('No cubic polynomial can separate the 2 classes')\n\n% Results\ndisp('-----------------------------------------------------------------');\ndisp('As seen on the figure, the 2 sets of points are not separated. ');\ndisp('There exists no cubic polynomial that can separate these 2 sets.');\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/poly4_discr.m", "content": "% Polynomial discrimination\n% Section 8.6.2, Boyd & Vandenberghe \"Convex Optimization\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX by Joelle Skaf - 10/23/05\n% (a figure is generated)\n%\n% The goal is to find the polynomial of degree 4 on R^n that separates\n% two sets of points {x_1,...,x_N} and {y_1,...,y_N}. We are trying to find\n% the coefficients of an order-4-polynomial P(x) that would satisfy:\n% minimize t\n% s.t. P(x_i) <= t for i = 1,...,N\n% P(y_i) >= t for i = 1,...,M\n\n% Data generation\nrand('state',0);\nN = 100;\nM = 120;\n\n% The points X lie within a circle of radius 0.9, with a wedge of points\n% near [1.1,0] removed. The points Y lie outside a circle of radius 1.1,\n% with a wedge of points near [1.1,0] added. The wedges are precisely what\n% makes the separation difficult and interesting.\nX = 2 * rand(2,N) - 1;\nX = X * diag(0.9*rand(1,N)./sqrt(sum(X.^2)));\nY = 2 * rand(2,M) - 1;\nY = Y * diag((1.1+rand(1,M))./sqrt(sum(Y.^2)));\nd = sqrt(sum((X-[1.1;0]*ones(1,N)).^2));\nY = [ Y, X(:,d<0.9) ];\nX = X(:,d>1);\nN = size(X,2);\nM = size(Y,2);\n\n% Construct Vandermonde-style monomial matrices\np1 = [0,0,1,0,1,2,0,1,2,3,0,1,2,3,4]';\np2 = [0,1,1,2,2,2,3,3,3,3,4,4,4,4,4]'-p1;\nnp = length(p1);\nop = ones(np,1);\nmonX = X(op,:) .^ p1(:,ones(1,N)) .* X(2*op,:) .^ p2(:,ones(1,N));\nmonY = Y(op,:) .^ p1(:,ones(1,M)) .* Y(2*op,:) .^ p2(:,ones(1,M));\n\n% Solution via CVX\nfprintf(1,'Finding the optimal polynomial of order 4 that separates the 2 classes...');\n\ncvx_begin\n variables a(np) t(1)\n minimize ( t )\n a'*monX <= t;\n a'*monY >= -t;\n % For normalization purposes only\n norm(a) <= 1;\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% Displaying results\nnopts = 2000;\nangles = linspace(0,2*pi,nopts);\ncont = zeros(2,nopts);\nfor i=1:nopts\n v = [cos(angles(i)); sin(angles(i))];\n l = 0; u = 1;\n while ( u - l > 1e-3 )\n s = (u+l)/2;\n x = s * v;\n if a' * ( x(op,:) .^ p1 .* x(2*op) .^ p2 ) > 0, \n u = s; \n else\n l = s;\n end\n end;\n s = (u+l)/2;\n cont(:,i) = s*v;\nend;\n\ngraph = plot(X(1,:),X(2,:),'o', Y(1,:), Y(2,:),'o', cont(1,:), cont(2,:), '-');\nset(graph(2),'MarkerFaceColor',[0 0.5 0]);\ntitle('Optimal order-4 polynomial that separates the 2 classes')\n% print -deps min-deg-discr.eps\n\n%%%% Dual infeasible ?????\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/quad_discr.m", "content": "% Quadratic discrimination (separating ellipsoid)\n% Section 8.6.2, Boyd & Vandenberghe \"Convex Optimization\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX by Joelle Skaf - 10/16/05\n% (a figure is generated)\n%\n% The goal is to find an ellipsoid that contains all the points\n% x_1,...,x_N but none of the points y_1,...,y_M. The equation of the\n% ellipsoidal surface is: z'*P*z + q'*z + r =0\n% P, q and r can be obtained by solving the SDP feasibility problem:\n% minimize 0\n% s.t. x_i'*P*x_i + q'*x_i + r >= 1 for i = 1,...,N\n% y_i'*P*y_i + q'*y_i + r <= -1 for i = 1,...,M\n% P <= -I\n\n% data generation\nn = 2;\nrand('state',0); randn('state',0);\nN=50;\nX = randn(2,N); X = X*diag(0.99*rand(1,N)./sqrt(sum(X.^2)));\nY = randn(2,N); Y = Y*diag((1.02+rand(1,N))./sqrt(sum(Y.^2)));\nT = [1 -1; 2 1]; X = T*X; Y = T*Y;\n\n% Solution via CVX\nfprintf(1,'Find the optimal ellipsoid that seperates the 2 classes...');\n\ncvx_begin sdp\n variable P(n,n) symmetric\n variables q(n) r(1)\n P <= -eye(n);\n sum((X'*P).*X',2) + X'*q + r >= +1;\n sum((Y'*P).*Y',2) + Y'*q + r <= -1;\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% Displaying results\nr = -r; P = -P; q = -q;\nc = 0.25*q'*inv(P)*q - r;\nxc = -0.5*inv(P)*q;\nnopts = 1000;\nangles = linspace(0,2*pi,nopts);\nell = inv(sqrtm(P/c))*[cos(angles); sin(angles)] + repmat(xc,1,nopts);\ngraph=plot(X(1,:),X(2,:),'o', Y(1,:), Y(2,:),'o', ell(1,:), ell(2,:),'-');\nset(graph(2),'MarkerFaceColor',[0 0.5 0]);\nset(gca,'XTick',[]); set(gca,'YTick',[]);\ntitle('Quadratic discrimination');\n% print -deps ellips.eps\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/robust_lin_discr.m", "content": "% Figure 8.9: Robust linear discrimination problem\n% Section 8.6.1, Boyd & Vandenberghe \"Convex Optimization\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX by Joelle Skaf - 10/16/05\n% (a figure is generated)\n%\n% The goal is to find a function f(x) = a'*x - b that classifies the points\n% {x_1,...,x_N} and {y_1,...,y_M} with maximal 'gap'. a and b can be\n% obtained by solving the following problem:\n% maximize t\n% s.t. a'*x_i - b >= t for i = 1,...,N\n% a'*y_i - b <= -t for i = 1,...,M\n% ||a||_2 <= 1\n\n% data generation\nn = 2;\nrandn('state',3);\nN = 10; M = 6;\nY = [1.5+1*randn(1,M); 2*randn(1,M)];\nX = [-1.5+1*randn(1,N); 2*randn(1,N)];\nT = [-1 1; 1 1];\nY = T*Y; X = T*X;\n\n% Solution via CVX\ncvx_begin\n variables a(n) b(1) t(1)\n maximize (t)\n X'*a - b >= t;\n Y'*a - b <= -t;\n norm(a) <= 1;\ncvx_end\n\n% Displaying results\nlinewidth = 0.5; % for the squares and circles\nt_min = min([X(1,:),Y(1,:)]);\nt_max = max([X(1,:),Y(1,:)]);\ntt = linspace(t_min-1,t_max+1,100);\np = -a(1)*tt/a(2) + b/a(2);\np1 = -a(1)*tt/a(2) + (b+t)/a(2);\np2 = -a(1)*tt/a(2) + (b-t)/a(2);\n\ngraph = plot(X(1,:),X(2,:), 'o', Y(1,:), Y(2,:), 'o');\nset(graph(1),'LineWidth',linewidth);\nset(graph(2),'LineWidth',linewidth);\nset(graph(2),'MarkerFaceColor',[0 0.5 0]);\nhold on;\nplot(tt,p, '-r', tt,p1, '--r', tt,p2, '--r');\naxis equal\ntitle('Robust linear discrimination problem');\n% print -deps linsep.eps\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/separate_ell_2D.m", "content": "% Separating ellipsoids in 2D\n% Joelle Skaf - 11/06/05\n% (a figure is generated)\n%\n% Finds a separating hyperplane between 2 ellipsoids {x| ||Ax+b||^2<=1} and\n% {y | ||Cy + d||^2 <=1} by solving the following problem and using its\n% dual variables:\n% minimize ||w||\n% s.t. ||Ax + b||^2 <= 1 : lambda\n% ||Cy + d||^2 <= 1 : mu\n% x - y == w : z\n% the vector z will define a separating hyperplane because z'*(x-y)>0\n\n% input data\nn = 2;\nA = eye(n);\nb = zeros(n,1);\nC = [2 1; -.5 1];\nd = [-3; -3];\n\n% solving for the minimum distance between the 2 ellipsoids and finding\n% the dual variables\ncvx_begin\n variables x(n) y(n) w(n)\n dual variables lam muu z\n minimize ( norm(w,2) )\n subject to\n lam: square_pos( norm (A*x + b) ) <= 1;\n muu: square_pos( norm (C*y + d) ) <= 1;\n z: x - y == w;\ncvx_end\n\n\nt = (x + y)/2;\np=z;\np(1) = z(2); p(2) = -z(1);\nc = linspace(-2,2,100);\nq = repmat(t,1,length(c)) +p*c;\n\n% figure\nnopts = 1000;\nangles = linspace(0,2*pi,nopts);\n[u,v] = meshgrid([-2:0.01:4]);\nz1 = (A(1,1)*u + A(1,2)*v + b(1)).^2 + (A(2,1)*u + A(2,2)*v + b(2)).^2;\nz2 = (C(1,1)*u + C(1,2)*v + d(1)).^2 + (C(2,1)*u + C(2,2)*v + d(2)).^2;\ncontour(u,v,z1,[1 1]);\nhold on;\ncontour(u,v,z2,[1 1]);\naxis square\nplot(x(1),x(2),'r+');\nplot(y(1),y(2),'b+');\nline([x(1) y(1)],[x(2) y(2)]);\nplot(q(1,:),q(2,:),'k');\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/separate_poly_2D.m", "content": "% Section 8.2.2: Separating polyhedra in 2D\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Joelle Skaf - 10/09/05\n% (a figure is generated)\n%\n% If the two polyhedra C = {x | A1*x <= b1} and D = {y | A2*y <= b2} can be\n% separated by a hyperplane, it will be of the form\n% z'*x - z'*y >= -lambda'*b1 - mu'*b2 > 0\n% where z, lambda and mu are the optimal variables of the problem:\n% maximize -b1'*lambda - b2'*mu\n% s.t. A1'*lambda + z = 0\n% A2'*mu - z = 0\n% norm*(z) <= 1\n% lambda >=0 , mu >= 0\n% Note: here x is in R^2\n\n% Input data\nrandn('seed',0);\nn = 2;\nm = 2*n;\nA1 = [1 1; 1 -1; -1 1; -1 -1];\nA2 = [1 0; -1 0; 0 1; 0 -1];\nb1 = 2*ones(m,1);\nb2 = [5; -3; 4; -2];\n\n% Solving with CVX\nfprintf(1,'Finding a separating hyperplane between the 2 polyhedra...');\n\ncvx_begin\n variables lam(m) muu(m) z(n)\n maximize ( -b1'*lam - b2'*muu)\n A1'*lam + z == 0;\n A2'*muu - z == 0;\n norm(z) <= 1;\n -lam <=0;\n -muu <=0;\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% Displaying results\ndisp('------------------------------------------------------------------');\ndisp('The distance between the 2 polyhedra C and D is: ' );\ndisp(['dist(C,D) = ' num2str(cvx_optval)]);\n\n% Plotting\nt = linspace(-3,6,100);\np = -z(1)*t/z(2) + (muu'*b2 - lam'*b1)/(2*z(2));\nfigure;\nfill([-2; 0; 2; 0],[0;2;0;-2],'b', [3;5;5;3],[2;2;4;4],'r')\naxis([-3 6 -3 6])\naxis square\nhold on;\nplot(t,p)\ntitle('Separating 2 polyhedra by a hyperplane');\n\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/separate_pt_poly.m", "content": "% Section 8.1.1: Separating a point from a polyhedron\n% Boyd & Vandenberghe \"Convex Optimization\"\n% Joelle Skaf - 10/09/05\n%\n% The goal is to produce a hyperplane separating x0 and the polyhedron\n% defined as {x | Ax <= b}\n% minimize mu'*x0 - b'*lambda\n% A'*lambda = mu\n% norm(mu)* <= 1\n% lambda >= 0\n\n% Input data\nrandn('seed',0);\nn = 10;\nm = 2*n;\nx0 = randn(n,1);\nA = randn(m,n);\nb = rand(m,1);\n\n% CVX solution\nfprintf(1,'Finding a separating hyperplane between the 2 polyhedra...');\n\ncvx_begin quiet\n variables muu(n) lambda(m)\n maximize ( muu'*x0 - b'*lambda )\n A'*lambda == muu;\n norm(muu) <= 1;\n lambda >= 0;\ncvx_end\n\nfprintf(1,'Done! \\n');\n\n% Verification\ndisp('------------------------------------------------------------------');\ndisp('Note that 0 is in {x | Ax <= b} by construction...' );\ndisp('Verifying that x0 is separated from {x | Ax <= b} i.e. mu^T*x0 > 0');\ndisp([' mu^T*x0 = ' num2str(muu'*x0) ]);\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/svm_1.m", "content": "% Figure 8.10: Approximate linear discrimination via linear programming\n% Section 8.6.1, Boyd & Vandenberghe \"Convex Optimization\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX by Joelle Skaf - 10/16/05\n% (a figure is generated)\n%\n% The goal is to find a function f(x) = a'*x - b that classifies the non-\n% separable points {x_1,...,x_N} and {y_1,...,y_M} by allowing some\n% misclassification. a and b can be obtained by solving the following\n% problem:\n% minimize 1'*u + 1'*v\n% s.t. a'*x_i - b >= 1 - u_i for i = 1,...,N\n% a'*y_i - b <= -(1 - v_i) for i = 1,...,M\n% u >= 0 and v >= 0\n\n% data generation\nn = 2;\nrandn('state',2);\nN = 50; M = 50;\nY = [1.5+0.9*randn(1,0.6*N), 1.5+0.7*randn(1,0.4*N);\n 2*(randn(1,0.6*N)+1), 2*(randn(1,0.4*N)-1)];\nX = [-1.5+0.9*randn(1,0.6*M), -1.5+0.7*randn(1,0.4*M);\n 2*(randn(1,0.6*M)-1), 2*(randn(1,0.4*M)+1)];\nT = [-1 1; 1 1];\nY = T*Y; X = T*X;\n\n% Solution via CVX\ncvx_begin\n variables a(n) b(1) u(N) v(M)\n minimize (ones(1,N)*u + ones(1,M)*v)\n X'*a - b >= 1 - u;\n Y'*a - b <= -(1 - v);\n u >= 0;\n v >= 0;\ncvx_end\n\n% Displaying results\nlinewidth = 0.5; % for the squares and circles\nt_min = min([X(1,:),Y(1,:)]);\nt_max = max([X(1,:),Y(1,:)]);\ntt = linspace(t_min-1,t_max+1,100);\np = -a(1)*tt/a(2) + b/a(2);\np1 = -a(1)*tt/a(2) + (b+1)/a(2);\np2 = -a(1)*tt/a(2) + (b-1)/a(2);\n\ngraph = plot(X(1,:),X(2,:), 'o', Y(1,:), Y(2,:), 'o');\nset(graph(1),'LineWidth',linewidth);\nset(graph(2),'LineWidth',linewidth);\nset(graph(2),'MarkerFaceColor',[0 0.5 0]);\nhold on;\nplot(tt,p, '-r', tt,p1, '--r', tt,p2, '--r');\naxis equal\ntitle('Approximate linear discrimination via linear programming');\n% print -deps svc-discr.eps\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/svm_2.m", "content": "% Figure 8.11: Approximate linear discrimination via support vector classifier\n% Section 8.6.1, Boyd & Vandenberghe \"Convex Optimization\"\n% Original by Lieven Vandenberghe\n% Adapted for CVX by Joelle Skaf - 10/16/05\n% (a figure is generated)\n%\n% The goal is to find a function f(x) = a'*x - b that classifies the non-\n% separable points {x_1,...,x_N} and {y_1,...,y_M} by doing a trade-off\n% between the number of misclassifications and the width of the separating\n% slab. a and b can be obtained by solving the following problem:\n% minimize ||a||_2 + gamma*(1'*u + 1'*v)\n% s.t. a'*x_i - b >= 1 - u_i for i = 1,...,N\n% a'*y_i - b <= -(1 - v_i) for i = 1,...,M\n% u >= 0 and v >= 0\n% where gamma gives the relative weight of the number of misclassified\n% points compared to the width of the slab.\n\n% data generation\nn = 2;\nrandn('state',2);\nN = 50; M = 50;\nY = [1.5+0.9*randn(1,0.6*N), 1.5+0.7*randn(1,0.4*N);\n 2*(randn(1,0.6*N)+1), 2*(randn(1,0.4*N)-1)];\nX = [-1.5+0.9*randn(1,0.6*M), -1.5+0.7*randn(1,0.4*M);\n 2*(randn(1,0.6*M)-1), 2*(randn(1,0.4*M)+1)];\nT = [-1 1; 1 1];\nY = T*Y; X = T*X;\ng = 0.1; % gamma\n\n% Solution via CVX\ncvx_begin\n variables a(n) b(1) u(N) v(M)\n minimize (norm(a) + g*(ones(1,N)*u + ones(1,M)*v))\n X'*a - b >= 1 - u;\n Y'*a - b <= -(1 - v);\n u >= 0;\n v >= 0;\ncvx_end\n\n% Displaying results\nlinewidth = 0.5; % for the squares and circles\nt_min = min([X(1,:),Y(1,:)]);\nt_max = max([X(1,:),Y(1,:)]);\ntt = linspace(t_min-1,t_max+1,100);\np = -a(1)*tt/a(2) + b/a(2);\np1 = -a(1)*tt/a(2) + (b+1)/a(2);\np2 = -a(1)*tt/a(2) + (b-1)/a(2);\n\ngraph = plot(X(1,:),X(2,:), 'o', Y(1,:), Y(2,:), 'o');\nset(graph(1),'LineWidth',linewidth);\nset(graph(2),'LineWidth',linewidth);\nset(graph(2),'MarkerFaceColor',[0 0.5 0]);\nhold on;\nplot(tt,p, '-r', tt,p1, '--r', tt,p2, '--r');\naxis equal\ntitle('Approximate linear discrimination via support vector classifier');\n% print -deps svc-discr2.eps\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch08_geometric_probs/test_floorplan.m", "content": "% Example 8.7: Floorplan generation test script\n% Section 8.8.1/2, Boyd & Vandenberghe \"Convex Optimization\"\n% Joelle Skaf 12/04/05\n%\n% Rectangles aligned with the axes need to be place in the smallest\n% possible bounding box. No overlap is allowed. Each rectangle to be placed\n% can be reconfigured, within some limits.\n% In the current problem, 60 rectangles are to be place. We are given 2\n% acyclic graphs H and V (for horizontal and vertical) that specify the\n% relative positioning constraints of those rectangles.\n% We are also given minimal areas for the rectangles and aspect ratio\n% constraints\n\n% input data\nload data_floorplan_60;\nrho = 1;\nAmin = 100*ones(1,n);\n\n[W, H, w, h, x, y] = floorplan(adj_H, adj_V, rho, Amin,ones(60,1)*0.5,ones(60,1)*2);\nfill([0; W; W; 0],[0;0;H;H],[1 1 1]); % bounding box\nhold on\nfor i=1:n\n fill([x(i); x(i)+w(i); x(i)+w(i); x(i)],[y(i);y(i);y(i)+h(i);y(i)+h(i)],0.90*[1 1 1]);\n hold on;\n text(x(i)+w(i)/2, y(i)+h(i)/2,[int2str(i)]);\nend\naxis([0 W 0 H]);\naxis equal; axis off;\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch11_intpt_methods/Contents.m", "content": "% Chapter 11: Interior-point methods\n%\n% log_utility_flow.m - Section 11.8.4: Network rate optimization\nhelp Contents\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Ch11_intpt_methods/log_utility_flow.m", "content": "% Section 11.8.4: Network rate optimization\n% Boyd & Vandenberghe \"Convex Optimization\" \n% Argyrios Zymnis - 05/03/08\n%\n% We consider a network with n flows and L links. Each flow i,\n% moves along a fixed predetermined path (i.e. a subset of the links)\n% and has an associated rate x_i. Each link j has an associated capacity\n% c_j. The total rate of all flows travelling along a link cannot exceed\n% the link capacity. We can describe these link capacity limits using the\n% flow-link incidence matrix A \\in \\reals^{L \\times n}, where\n% A_{ij} = 1, if flow j passes through link i and 0 otherwise.\n% The link capacity constraints can be expressed as A*x <= c\n% In the network rate problem the variables are the flow rates x. The\n% objective is to choose the flow rates to maximize a separate utility\n% function U, given by\n% U(x) = U_1(x_1)+U_2(x_2)+...+U_n(x_n)\n% The network rate optimization problem is then\n% maximize U(x)\n% subject to A*x <= c\n% Here we use U_i(x_i) = log x_i for all i\n\n% Input data\nrand('state',1)\nL = 20;\nn = 10;\nk = 7; %average links per flow\nA = double(rand(L,n) <= k/L);\nc = 0.9*rand(L,1)+0.1;\n\n% Solve network rate problem\ncvx_begin\n variable x(n);\n maximize(sum(log(x)))\n subject to\n A*x <= c\ncvx_end\nprimal_obj = cvx_optval;\n\n% Solve dual problem to obtain link prices\ncvx_begin\n variable lambda(L);\n minimize(c'*lambda-sum(log(A'*lambda))-n)\n subject to\n lambda >= 0\ncvx_end\ndual_obj = cvx_optval;\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/cvxbook/Contents.m", "content": "% Figures, examples, and exercises from the book Convex Optimization\n%\n% Ch04_cvx_opt_probs/ - Chapter 4: Convex optimization problems\n% Ch05_duality/ - Chapter 5: Duality\n% Ch06_approx_fitting/ - Chapter 6: Approximation and fitting\n% Ch07_statistical_estim/ - Chapter 7: Statistical estimation\n% Ch08_geometric_probs/ - Chapter 8: Geometric problems\n% Ch11_intpt_methods/ - Chapter 11: Interior-point methods\nhelp Contents\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/equality_constr_norm_min.m", "content": "% Equality constrained norm minimization.\n%\n% This script constructs a random equality-constrained norm minimization\n% problem and solves it using CVX. You can also change p to +2 or +Inf\n% to produce different results. Alternatively, you an replace\n% norm( A * x - b, p )\n% with\n% norm_largest( A * x - b, 'largest', p )\n% for 1 <= p <= 2 * n.\n\n% Generate data\np = 1;\nn = 10; m = 2*n; q=0.5*n;\nA = randn(m,n);\nb = randn(m,1);\nC = randn(q,n);\nd = randn(q,1);\n\n% Create and solve problem\ncvx_begin\n variable x(n)\n dual variable y\n minimize( norm( A * x - b, p ) )\n subject to\n y : C * x == d;\ncvx_end\n\n% Display results\ndisp( sprintf( 'norm(A*x-b,%g):', p ) );\ndisp( [ ' ans = ', sprintf( '%7.4f', norm(A*x-b,p) ) ] );\ndisp( 'Optimal vector:' );\ndisp( [ ' x = [ ', sprintf( '%7.4f ', x ), ']' ] );\ndisp( 'Residual vector:' );\ndisp( [ ' A*x-b = [ ', sprintf( '%7.4f ', A*x-b ), ']' ] );\ndisp( 'Equality constraints:' );\ndisp( [ ' C*x = [ ', sprintf( '%7.4f ', C*x ), ']' ] );\ndisp( [ ' d = [ ', sprintf( '%7.4f ', d ), ']' ] );\ndisp( 'Lagrange multiplier for C*x==d:' );\ndisp( [ ' y = [ ', sprintf( '%7.4f ', y ), ']' ] );\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/filter_design/Contents.m", "content": "% Filter design\n% FIR Filter Design via Spectral Factorization and Convex Optimization\n% EE364 lecture, Filter design and equalization\n%\n% fir_chebychev_design.m - Chebychev design of an FIR filter given a desired H(w)\n% one_over_f_filter.m - Design a 1/f spectrum shaping (pink-noise) filter\n% equalizer_design.m - Equalizer design example\n% iir_mag_design_bandpass_max_atten.m - Maximize stopband attenuation of a bandpass IIR filter\n% fir_lin_phase_lowpass_max_atten.m - Maximize stopband attenuation of a linear phase lowpass FIR filter\n% fir_mag_design_lowpass_max_atten.m - Maximize stopband attenuation of a lowpass FIR filter (magnitude design)\n% iir_mag_design_lowpass_max_atten.m - Maximize stopband attenuation of a lowpass IIR filter\n% fir_lin_phase_lowpass_min_order.m - Minimize order of a linear phase lowpass FIR filter\n% fir_mag_design_lowpass_min_order.m - Minimize order of a lowpass FIR filter (magnitude design)\n% fir_lin_phase_lowpass_min_ripple.m - Minimize stopband ripple of a linear phase lowpass FIR filter\n% fir_lin_phase_lowpass_min_trans.m - Minimize transition bandwidth of a linear phase lowpass FIR filter\n% spectral_fact.m - Spectral factorization using Kolmogorov 1939 approach.\nhelp Contents\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/filter_design/equalizer_design.m", "content": "% Equalizer design example\n% \"Filter design\" lecture notes (EE364) by S. Boyd\n% (figures are generated)\n%\n% Designs a frequency-domain and time-domain FIR equalizer for\n% a single-input single-output (SISO) channel.\n%\n% Frequency-domain equalization uses a Chebychev criteria and\n% is specified in terms of frequency response functions.\n% It is a convex problem (which can be formulated as an SOCP):\n%\n% minimize max |G(w)H(w) - G_des(w)| for w in [0,pi] \n%\n% where H is the frequency response function and our variable\n% is the filter impulse response h. Function G is the unequalized\n% frequency response and G_des is the desired freq response.\n%\n% Time-domain equalization immediately designs the impulse\n% response function by specifying the problem in time (it's an LP):\n%\n% minimize max_{t neq D} |g_tilde(t)|\n% s.t. g_tilde(D) = 1\n%\n% where g_tilde is the impulse response of equalized system,\n% and D is the delay of the system.\n%\n% Written for CVX by Almir Mutapcic 02/02/06\n\n%********************************************************************\n% problem specs\n%********************************************************************\n% sample channel with impulse response g\ng =.5*[ 0.6526; 0.2157; -0.2639; 1.8024; -0.6430; ...\n 0.1096; -0.7190; 0.4206; -0.0193; 0.6603;];\n\n% problem parameters\nn = 30; % filter order\nD = 10; % overall delay\n\n%********************************************************************\n% frequency domain equalization\n%********************************************************************\n% number of freq samples (rule-of-thumb)\nm = 15*(length(g) + n);\n\nw = linspace(0,pi,m)';\nG = exp( -j*kron(w,[0:length(g)-1]) )*g;\nA = exp( -j*kron(w,[0:n-1]) );\n\n% desired frequency response is a pure delay (equalized channel)\nGdes = exp(-j*D*w);\n\n% formulate and solve the Chebyshev design problem\ncvx_begin\n variable hf(n,1)\n minimize( max( abs( G.*(A*hf) - Gdes ) ) ) \ncvx_end\n\n% check if problem was successfully solved\ndisp(['Frequency equalization problem is ' cvx_status])\nif ~strfind(cvx_status,'Solved')\n return\nend\n\n%********************************************************************\n% time-domain equalization\n%********************************************************************\n% define the convolution matrix\nTconv = toeplitz([g; zeros(n-1,1)],[g(1) zeros(1,n-1)]);\n\n% create array of all times without t=D\ntimes_not_D = [1:D D+2:size(Tconv,1)];\n\n% formulate and solve the time equalization problem\ncvx_begin\n variable t\n variable ht(n,1)\n\n minimize( max( abs( Tconv(times_not_D,:)*ht ) ) )\n subject to\n Tconv(D+1,:)*ht == 1;\ncvx_end\n\n% check if problem was successfully solved\nif ~strfind(cvx_status,'Solved')\n disp(['Frequency equalization problem is ' cvx_status])\n return\nend\n\n%********************************************************************\n% equalizer plots\n%********************************************************************\n% plot g\nfigure(1)\nplot([0:length(g)-1],g,'o',[0:length(g)-1],g,'b:')\nxlabel('t')\nylabel('g(t)')\n\nfigure(2)\nH = exp(-j*kron(w,[0:length(g)-1]))*g;\n% magnitude\nsubplot(2,1,1);\nplot(w,20*log10(abs(H)))\naxis([0,pi,-20,20])\nxlabel('w')\nylabel('mag G(w) in dB')\n% phase\nsubplot(2,1,2)\nplot(w,angle(H))\naxis([0,pi,-pi,pi])\nxlabel('w')\nylabel('phase G(w)')\n\n% freq equalizer\nfigure(3)\nplot([0:n-1],hf,'o',[0:n-1],hf,'b:')\nxlabel('t')\nylabel('h(t)')\n\n% plot g_tilde\nfigure(4)\ngt=conv(g,hf);\nplot([1:length(gt)]-1,gt,'o',[1:length(gt)]-1,gt,'b:')\nxlabel('t')\nylabel('g tilde(t)')\naxis([0,length(gt)-1,-.2 1.2])\n\nfigure(5)\nH = exp(-j*kron(w,[0:length(gt)-1]))*gt;\n% amplitude\nsubplot(2,1,1)\nplot(w,20*log10(abs(H)))\naxis([0,pi,-20,20])\nxlabel('w')\nylabel('mag G tilde(w) in dB')\n% phase\nsubplot(2,1,2)\nplot(w,angle(H))\naxis([0,pi,-pi,pi])\nxlabel('w')\nylabel('phase G tilde(w)')\n\n% time equalizer\nfigure(6)\nplot([0:n-1],ht,'o',[0:n-1],ht,'b:')\nxlabel('t')\nylabel('h(t)')\n\n% plot g_tilde\nfigure(7)\ngt=conv(g,ht);\nplot([1:length(gt)]-1,gt,'o',[1:length(gt)]-1,gt,'b:')\nxlabel('t')\nylabel('g tilde(t)')\n\nfigure(8)\nH = exp(-j*kron(w,[0:length(gt)-1]))*gt;\n% magnitude\nsubplot(2,1,1)\nplot(w,20*log10(abs(H)))\naxis([0,pi,-20,20])\nxlabel('w')\nylabel('mag G tilde(w) in dB')\n% phase\nsubplot(2,1,2)\nplot(w,angle(H))\naxis([0,pi,-pi,pi])\nxlabel('w')\nylabel('phase G tilde(w)')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/filter_design/fir_chebychev_design.m", "content": "% Chebychev design of an FIR filter given a desired H(w)\n% \"Filter design\" lecture notes (EE364) by S. Boyd\n% (figures are generated)\n%\n% Designs an FIR filter given a desired frequency response H_des(w).\n% The design is judged by the maximum absolute error (Chebychev norm).\n% This is a convex problem (after sampling it can be formulated as an SOCP).\n%\n% minimize max |H(w) - H_des(w)| for w in [0,pi]\n%\n% where H is the frequency response function and variable is h\n% (the filter impulse response).\n%\n% Written for CVX by Almir Mutapcic 02/02/06\n\n%********************************************************************\n% problem specs\n%********************************************************************\n% number of FIR coefficients (including the zeroth one)\nn = 20;\n\n% rule-of-thumb frequency discretization (Cheney's Approx. Theory book)\nm = 15*n;\nw = linspace(0,pi,m)'; % omega\n\n%********************************************************************\n% construct the desired filter\n%********************************************************************\n% fractional delay\nD = 8.25; % delay value\nHdes = exp(-j*D*w); % desired frequency response\n\n% Gaussian filter with linear phase (uncomment lines below for this design)\n% var = 0.05;\n% Hdes = 1/(sqrt(2*pi*var))*exp(-(w-pi/2).^2/(2*var));\n% Hdes = Hdes.*exp(-j*n/2*w);\n\n%*********************************************************************\n% solve the minimax (Chebychev) design problem\n%*********************************************************************\n% A is the matrix used to compute the frequency response\n% A(w,:) = [1 exp(-j*w) exp(-j*2*w) ... exp(-j*n*w)]\nA = exp( -j*kron(w,[0:n-1]) );\n\n% optimal Chebyshev filter formulation\ncvx_begin\n variable h(n,1)\n minimize( max( abs( A*h - Hdes ) ) )\ncvx_end\n\n% check if problem was successfully solved\ndisp(['Problem is ' cvx_status])\nif ~strfind(cvx_status,'Solved')\n h = [];\nend\n\n%*********************************************************************\n% plotting routines\n%*********************************************************************\n% plot the FIR impulse reponse\nfigure(1)\nstem([0:n-1],h)\nxlabel('n')\nylabel('h(n)')\n\n% plot the frequency response\nH = [exp(-j*kron(w,[0:n-1]))]*h;\nfigure(2)\n% magnitude\nsubplot(2,1,1);\nplot(w,20*log10(abs(H)),w,20*log10(abs(Hdes)),'--')\nxlabel('w')\nylabel('mag H in dB')\naxis([0 pi -30 10])\nlegend('optimized','desired','Location','SouthEast')\n% phase\nsubplot(2,1,2)\nplot(w,angle(H))\naxis([0,pi,-pi,pi])\nxlabel('w'), ylabel('phase H(w)')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/filter_design/fir_lin_phase_lowpass_max_atten.m", "content": "% Maximize stopband attenuation of a linear phase lowpass FIR filter\n% \"Filter design\" lecture notes (EE364) by S. Boyd\n% (figures are generated)\n%\n% Designs a linear phase FIR lowpass filter such that it:\n% - minimizes maximum stopband attenuation\n% - has a constraint on the maximum passband ripple\n%\n% This is a convex problem (when sampled it can be represented as an LP).\n%\n% minimize max |H(w)| for w in the stopband\n% s.t. 1/delta <= |H(w)| <= delta for w in the passband\n%\n% where H is the frequency response function and variable is\n% h (the filter impulse response). delta is allowed passband ripple.\n%\n% Written for CVX by Almir Mutapcic 02/02/06\n\n%********************************************************************\n% user's filter specifications\n%********************************************************************\n% filter order is 2n+1 (symmetric around the half-point)\nn = 10;\n\nwpass = 0.12*pi; % passband cutoff freq (in radians)\nwstop = 0.24*pi; % stopband start freq (in radians)\nripple = 1; % (delta) max allowed passband ripple in dB\n % ideal passband gain is 0 dB\n\n%********************************************************************\n% create optimization parameters\n%********************************************************************\nN = 30*n; % freq samples (rule-of-thumb)\nw = linspace(0,pi,N);\nA = [ones(N,1) 2*cos(kron(w',[1:n]))]; % matrix of cosines\n\n% passband 0 <= w <= w_pass\nind = find((0 <= w) & (w <= wpass)); % passband\nAp = A(ind,:);\n\n% transition band is not constrained (w_pass <= w <= w_stop)\n\n% stopband (w_stop <= w)\nind = find((wstop <= w) & (w <= pi)); % stopband\nAs = A(ind,:);\n\n%********************************************************************\n% optimization\n%********************************************************************\n% formulate and solve the linear-phase lowpass filter design\ncvx_begin\n variable h(n+1,1);\n minimize(norm(As*h,Inf))\n subject to\n 10^(-ripple/20) <= Ap*h <= 10^(ripple/20);\ncvx_end\n\n% check if problem was successfully solved\ndisp(['Problem is ' cvx_status])\nif ~strfind(cvx_status,'Solved')\n return\nelse\n fprintf(1,'The minimum attenuation in the stopband is %3.2f dB.\\n\\n',...\n 20*log10(cvx_optval));\n % construct the full impulse response\n h = [flipud(h(2:end)); h];\nend\n\n%********************************************************************\n% plots\n%********************************************************************\nfigure(1)\n% FIR impulse response\nplot(-n:n,h','o',[-n:n;-n:n],[zeros(1,2*n+1);h'],'b:',[-n-1,n+1],[0,0],'k-');\nxlabel('t'), ylabel('h(t)')\nset(gca,'XLim',[-n-1,n+1])\n\nfigure(2)\n% frequency response\nH = exp(-j*kron(w',[0:2*n]))*h;\n% magnitude\nsubplot(2,1,1)\nplot(w,20*log10(abs(H)),...\n [0 wpass],[ripple ripple],'r--',...\n [0 wpass],[-ripple -ripple],'r--');\naxis([0,pi,-50,10])\nxlabel('w'), ylabel('mag H(w) in dB')\n% phase\nsubplot(2,1,2)\nplot(w,angle(H))\naxis([0,pi,-pi,pi])\nxlabel('w'), ylabel('phase H(w)')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/filter_design/fir_lin_phase_lowpass_min_order.m", "content": "% Minimize order of a linear phase lowpass FIR filter\n% \"Filter design\" lecture notes (EE364) by S. Boyd\n% (figures are generated)\n%\n% Designs a linear phase FIR lowpass filter such that it:\n% - minimizes the filter order\n% - has a constraint on the maximum passband ripple\n% - has a constraint on the maximum stopband attenuation\n%\n% This is a quasiconvex problem and can be solved using a bisection.\n%\n% minimize filter order n\n% s.t. 1/delta <= H(w) <= delta for w in the passband\n% |H(w)| <= atten_level for w in the stopband\n%\n% where H is the frequency response function and variable is\n% the filter impulse response h (and its order/length).\n% Data is delta (max passband ripple) and atten_level (max stopband\n% attenuation level).\n%\n% Written for CVX by Almir Mutapcic 02/02/06\n\n%********************************************************************\n% user's filter specifications\n%********************************************************************\n% filter order that is used to start the bisection (has to be feasible)\nmax_order = 20;\n\nwpass = 0.12*pi; % passband cutoff freq (in radians)\nwstop = 0.24*pi; % stopband start freq (in radians)\ndelta = 0.5; % max (+/-) passband ripple in dB\natten = -35; % stopband attenuation level in dB\n\n%********************************************************************\n% create optimization parameters\n%********************************************************************\nm = 30*max_order; % freq samples (rule-of-thumb)\nw = linspace(0,pi,m);\n\n%*********************************************************************\n% use bisection algorithm to solve the problem\n%*********************************************************************\n\nn_bot = 1;\nn_top = max_order;\nn = Inf;\n\ndisp('Rememeber that we are only considering filters with linear phase, i.e.,')\ndisp('filters that are symmetric around their midpoint and have order 2*n+1.')\ndisp(' ')\n\nwhile( n_top - n_bot > 1)\n % try to find a feasible design for given specs\n n_cur = ceil( (n_top + n_bot)/2 );\n \n % create optimization matrices (this is cosine matrix)\n A = [ones(m,1) 2*cos(kron(w',[1:n_cur]))];\n \n % passband 0 <= w <= w_pass\n ind = find((0 <= w) & (w <= wpass)); % passband\n Ap = A(ind,:);\n \n % transition band is not constrained (w_pass <= w <= w_stop)\n \n % stopband (w_stop <= w)\n ind = find((wstop <= w) & (w <= pi)); % stopband\n As = A(ind,:);\n \n ptop = 10^(delta/20);\n \n % This is the feasibility problem:\n % cvx_begin\n % variable h_cur(n_cur+1,1);\n % 10^(-delta/20) <= Ap * h_cur <= 10^(+delta/20);\n % abs( As * h_cur ) <= +10^(+atten/20);\n % cvx_end\n % Unfortunately, the solvers often struggle with this formulation. For\n % this model, there is a logical optimization problem: minimize the\n % stopband attenuation. If the minimum attenuation is below the target,\n % then we know the original problem is feasible.\n cvx_begin quiet\n variable h_cur(n_cur+1,1);\n minimize( max( abs( As * h_cur ) ) );\n 10^(-delta/20) <= Ap * h_cur <= 10^(+delta/20);\n cvx_end\n \n % bisection\n if isnan( cvx_optval ),\n fprintf( 1, 'Solver failed for n = %d taps, assuming infeasible\\n', n_cur );\n n_bot = n_cur;\n elseif cvx_optval <= 10^(atten/20),\n fprintf(1,'Problem is feasible for n = %d taps\\n',n_cur);\n n_top = n_cur;\n if n > n_cur, \n n = n_cur;\n h = h_cur; \n end\n else\n fprintf(1,'Problem not feasible for n = %d taps\\n',n_cur);\n n_bot = n_cur;\n end\nend\n\nh = [ h(end:-1:2); h ];\nfprintf(1,'\\nOptimum number of filter taps for given specs is 2n+1 = %d.\\n', length(h));\n\n%********************************************************************\n% plots\n%********************************************************************\nfigure(1)\n% FIR impulse response\nplot([-n:n],h','o',[-n:n],h','b:')\nxlabel('t'), ylabel('h(t)')\n\nfigure(2)\n% frequency response\nH = exp(-j*kron(w',[0:2*n]))*h;\n% magnitude\nsubplot(2,1,1)\nplot(w,20*log10(abs(H)),...\n [wstop pi],[atten atten],'r--',...\n [0 wpass],[delta delta],'r--',...\n [0 wpass],[-delta -delta],'r--');\naxis([0,pi,-50,10])\nxlabel('w'), ylabel('mag H(w) in dB')\n% phase\nsubplot(2,1,2)\nplot(w,angle(H))\naxis([0,pi,-pi,pi])\nxlabel('w'), ylabel('phase H(w)')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/filter_design/fir_lin_phase_lowpass_min_ripple.m", "content": "% Minimize stopband ripple of a linear phase lowpass FIR filter\n% \"Filter design\" lecture notes (EE364) by S. Boyd\n% (figures are generated)\n%\n% Designs a linear phase FIR lowpass filter such that it:\n% - minimizes the maximum passband ripple\n% - has a constraint on the maximum stopband attenuation\n%\n% This is a convex problem.\n%\n% minimize delta\n% s.t. 1/delta <= H(w) <= delta for w in the passband\n% |H(w)| <= atten_level for w in the stopband\n%\n% where H is the frequency response function and variables are\n% delta and h (the filter impulse response).\n%\n% Written for CVX by Almir Mutapcic 02/02/06\n\n%********************************************************************\n% user's filter specifications\n%********************************************************************\n% filter order is 2n+1 (symmetric around the half-point)\nn = 10;\n\nwpass = 0.12*pi; % passband cutoff freq (in radians)\nwstop = 0.24*pi; % stopband start freq (in radians)\natten_level = -30; % stopband attenuation level in dB\n\n%********************************************************************\n% create optimization parameters\n%********************************************************************\nN = 30*n+1; % freq samples (rule-of-thumb)\nw = linspace(0,pi,N);\nA = [ones(N,1) 2*cos(kron(w',[1:n]))]; % matrix of cosines\n\n% passband 0 <= w <= w_pass\nind = find((0 <= w) & (w <= wpass)); % passband\nAp = A(ind,:);\n\n% transition band is not constrained (w_pass <= w <= w_stop)\n\n% stopband (w_stop <= w)\nind = find((wstop <= w) & (w <= pi)); % stopband\nUs = 10^(atten_level/20)*ones(length(ind),1);\nAs = A(ind,:);\n\n%********************************************************************\n% optimization\n%********************************************************************\n% formulate and solve the linear-phase lowpass filter design\ncvx_begin\n variable delta\n variable h(n+1,1);\n\n minimize( delta )\n subject to\n % passband bounds\n Ap*h <= delta;\n inv_pos(Ap*h) <= delta;\n\n % stopband bounds\n abs( As*h ) <= Us;\ncvx_end\n\n% check if problem was successfully solved\ndisp(['Problem is ' cvx_status])\nif ~strfind(cvx_status,'Solved')\n return\nelse\n % construct the full impulse response\n h = [flipud(h(2:end)); h];\n fprintf(1,'The optimal minimum passband ripple is %4.3f dB.\\n\\n',...\n 20*log10(delta));\nend\n\n%********************************************************************\n% plots\n%********************************************************************\nfigure(1)\n% FIR impulse response\nplot([0:2*n],h','o',[0:2*n],h','b:')\nxlabel('t'), ylabel('h(t)')\n\nfigure(2)\n% frequency response\nH = exp(-j*kron(w',[0:2*n]))*h;\n% magnitude\nsubplot(2,1,1)\nplot(w,20*log10(abs(H)),[wstop pi],[atten_level atten_level],'r--');\naxis([0,pi,-40,10])\nxlabel('w'), ylabel('mag H(w) in dB')\n% phase\nsubplot(2,1,2)\nplot(w,angle(H))\naxis([0,pi,-pi,pi])\nxlabel('w'), ylabel('phase H(w)')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/filter_design/fir_lin_phase_lowpass_min_trans.m", "content": "% Minimize transition bandwidth of a linear phase lowpass FIR filter\n% \"Filter design\" lecture notes (EE364) by S. Boyd\n% (figures are generated)\n%\n% Designs a linear phase FIR lowpass filter such that it:\n% - minimizes the transition band width (i.e. minimize w_stop)\n% - has a constraint on the maximum passband ripple\n% - has a constraint on the maximum stopband attenuation\n%\n% This is a quasiconvex problem and is solved using a bisection.\n%\n% minimize w_stop\n% s.t. 1/delta <= H(w) <= delta for w in the passband\n% |H(w)| <= atten_level for w in the stopband\n%\n% where H is the frequency response function and variable is\n% the filter impulse response h (and its order/length).\n% Data is delta (max passband ripple) and atten_level (max stopband\n% attenuation level).\n%\n% Written for CVX by Almir Mutapcic 02/02/06\n\n%********************************************************************\n% user's filter specifications\n%********************************************************************\n% starting point for the stopband (needs to be feasible)\nwstop = 0.24*pi; % stopband start freq (in radians)\nTOL = 1e-3; % precision to which we should run bisection\n\nn = 10; % filter order (2n+1 is the full order)\nwpass = 0.12*pi; % passband cutoff freq (in radians)\ndelta = 1; % max (+/-) passband ripple in dB\natten_level = -30; % stopband attenuation level in dB\n\n%********************************************************************\n% create optimization parameters\n%********************************************************************\nm = 30*n; % freq samples (rule-of-thumb)\nw = linspace(0,pi,m);\n\n%*********************************************************************\n% use bisection algorithm to solve the problem\n%*********************************************************************\n\nwstop_bot = wpass;\nwstop_top = wstop;\n\nwhile( wstop_top - wstop_bot > TOL)\n % try to find a feasible design for given specs\n wstop_cur = (wstop_top + wstop_bot)/2;\n\n % create optimization matrices (matrix of cosines)\n A = [ones(m,1) 2*cos(kron(w',[1:n]))];\n\n % passband 0 <= w <= w_pass\n ind = find((0 <= w) & (w <= wpass)); % passband\n Ap = A(ind,:);\n\n % transition band is not constrained (w_pass <= w <= w_stop)\n\n % stopband (w_stop <= w) (this is the changing constraint)\n ind = find((wstop_cur <= w) & (w <= pi)); % stopband\n As = A(ind,:);\n\n % formulate and solve the feasibility linear-phase lp filter design\n cvx_begin quiet\n variable h_cur(n+1,1);\n % feasibility problem\n % passband bounds\n Ap*h_cur <= 10^(delta/20);\n Ap*h_cur >= 10^(-delta/20);\n % stopband bounds\n abs( As*h_cur ) <= 10^(atten_level/20);\n cvx_end\n\n % bisection\n if strfind(cvx_status,'Solved') % feasible\n fprintf(1,'Problem is feasible for stopband freq = %3.4f rads\\n',wstop_cur);\n wstop_top = wstop_cur;\n % construct the full impulse response\n h = [flipud(h_cur(2:end)); h_cur];\n else % not feasible\n fprintf(1,'Problem is not feasible for stopband freq = %3.4f rads\\n',wstop_cur);\n wstop_bot = wstop_cur;\n end\nend\n\nwstop = wstop_top;\nfprintf(1,['\\nOptimum stopband frequency for given specs is %3.4f*pi rads\\n' ...\n 'and the minimum transition width is %3.4f*pi radians.\\n'],...\n wstop/pi, (wstop-wpass)/pi);\n\n\n%********************************************************************\n% plots\n%********************************************************************\nfigure(1)\n% FIR impulse response\nplot([0:2*n],h','o',[0:2*n],h','b:')\nxlabel('t'), ylabel('h(t)')\n\nfigure(2)\n% frequency response\nH = exp(-j*kron(w',[0:2*n]))*h;\n% magnitude\nsubplot(2,1,1)\nplot(w,20*log10(abs(H)),...\n [wstop pi],[atten_level atten_level],'r--',...\n [0 wpass],[delta delta],'r--',...\n [0 wpass],[-delta -delta],'r--');\naxis([0,pi,-40,10])\nxlabel('w'), ylabel('mag H(w) in dB')\n% phase\nsubplot(2,1,2)\nplot(w,angle(H))\naxis([0,pi,-pi,pi])\nxlabel('w'), ylabel('phase H(w)')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/filter_design/fir_mag_design_lowpass_max_atten.m", "content": "% Maximize stopband attenuation of a lowpass FIR filter (magnitude design)\n% \"FIR Filter Design via Spectral Factorization and Convex Optimization\"\n% by S.-P. Wu, S. Boyd, and L. Vandenberghe\n% (figures are generated)\n%\n% Designs an FIR lowpass filter using spectral factorization method where we:\n% - minimize maximum stopband attenuation\n% - have a constraint on the maximum passband ripple\n%\n% minimize max |H(w)| for w in the stopband\n% s.t. 1/delta <= |H(w)| <= delta for w in the passband\n%\n% We change variables via spectral factorization method and get:\n%\n% minimize max R(w) for w in the stopband\n% s.t. (1/delta)^2 <= R(w) <= delta^2 for w in the passband\n% R(w) >= 0 for all w\n%\n% where R(w) is the squared magnited of the frequency response\n% (and the Fourier transform of the autocorrelation coefficients r).\n% Variables are coeffients r. delta is the allowed passband ripple.\n% This is a convex problem (can be formulated as an LP after sampling).\n%\n% Written for CVX by Almir Mutapcic 02/02/06\n\n%*********************************************************************\n% user's filter specs (for a low-pass filter example)\n%*********************************************************************\n% number of FIR coefficients (including the zeroth one)\nn = 20;\n\nwpass = 0.12*pi; % end of the passband\nwstop = 0.24*pi; % start of the stopband\ndelta = 1; % maximum passband ripple in dB (+/- around 0 dB)\n\n%*********************************************************************\n% create optimization parameters\n%*********************************************************************\n% rule-of-thumb discretization (from Cheney's Approx. Theory book)\nm = 15*n;\nw = linspace(0,pi,m)'; % omega\n\n% A is the matrix used to compute the power spectrum\n% A(w,:) = [1 2*cos(w) 2*cos(2*w) ... 2*cos(n*w)]\nA = [ones(m,1) 2*cos(kron(w,[1:n-1]))];\n\n% passband 0 <= w <= w_pass\nind = find((0 <= w) & (w <= wpass)); % passband\nLp = 10^(-delta/20)*ones(length(ind),1);\nUp = 10^(+delta/20)*ones(length(ind),1);\nAp = A(ind,:);\n\n% transition band is not constrained (w_pass <= w <= w_stop)\n\n% stopband (w_stop <= w)\nind = find((wstop <= w) & (w <= pi)); % stopband\nAs = A(ind,:);\n\n%********************************************************************\n% optimization\n%********************************************************************\n% formulate and solve the magnitude design problem\ncvx_begin\n variable r(n,1)\n\n % this is a feasibility problem\n minimize( max( abs( As*r ) ) )\n subject to\n % passband constraints\n Ap*r >= (Lp.^2);\n Ap*r <= (Up.^2);\n % nonnegative-real constraint for all frequencies (a bit redundant)\n A*r >= 0;\ncvx_end\n\n% check if problem was successfully solved\ndisp(['Problem is ' cvx_status])\nif ~strfind(cvx_status,'Solved')\n return\nend\n\n% compute the spectral factorization\nh = spectral_fact(r);\n\n% compute the max attenuation in the stopband (convert to original vars)\nUstop = 10*log10(cvx_optval);\nfprintf(1,'The max attenuation in the stopband is %3.2f dB.\\n\\n',Ustop);\n\n%*********************************************************************\n% plotting routines\n%*********************************************************************\n% frequency response of the designed filter, where j = sqrt(-1)\nH = [exp(-j*kron(w,[0:n-1]))]*h;\n\nfigure(1)\n% FIR impulse response\nplot([0:n-1],h','o',[0:n-1],h','b:')\nxlabel('t'), ylabel('h(t)')\n\nfigure(2)\n% magnitude\nsubplot(2,1,1)\nplot(w,20*log10(abs(H)), ...\n [0 wpass],[delta delta],'r--', ...\n [0 wpass],[-delta -delta],'r--', ...\n [wstop pi],[Ustop Ustop],'r--')\nxlabel('w')\nylabel('mag H(w) in dB')\naxis([0 pi -50 5])\n% phase\nsubplot(2,1,2)\nplot(w,angle(H))\naxis([0,pi,-pi,pi])\nxlabel('w'), ylabel('phase H(w)')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/filter_design/fir_mag_design_lowpass_min_order.m", "content": "% Minimize order of a lowpass FIR filter (magnitude design)\n% \"FIR Filter Design via Spectral Factorization and Convex Optimization\"\n% by S.-P. Wu, S. Boyd, and L. Vandenberghe\n% (figures are generated)\n%\n% Designs an FIR lowpass filter using spectral factorization method where we:\n% - minimize the filter order\n% - have a constraint on the maximum passband ripple\n% - have a constraint on the maximum stopband attenuation\n%\n% minimize filter order n\n% s.t. 1/delta <= |H(w)| <= delta for w in the passband\n% |H(w)| <= atten_level for w in the stopband\n%\n% We change variables via spectral factorization method and get:\n%\n% minimize filter order n\n% s.t. (1/delta)^2 <= R(w) <= delta^2 for w in the passband\n% R(w) <= atten_level^2 for w in the stopband\n% R(w) >= 0 for all w\n%\n% where R(w) is the squared magnited of the frequency response\n% (and the Fourier transform of the autocorrelation coefficients r).\n% Variables are coeffients r. delta is the allowed passband ripple\n% and atten_level is the max allowed level in the stopband.\n%\n% This is a quasiconvex problem and can be solved using a bisection.\n%\n% Written for CVX by Almir Mutapcic 02/02/06\n\n%*********************************************************************\n% user's filter specs (for a low-pass filter example)\n%*********************************************************************\n% filter order that is used to start the bisection (has to be feasible)\nmax_order = 20;\n\nwpass = 0.12*pi; % passband cutoff freq (in radians)\nwstop = 0.24*pi; % stopband start freq (in radians)\ndelta = 1; % max (+/-) passband ripple in dB\natten = -30; % stopband attenuation level in dB\n\n%********************************************************************\n% create optimization parameters\n%********************************************************************\nm = 15*(max_order); % freq samples (rule-of-thumb)\nw = linspace(0,pi,m);\n\n%*********************************************************************\n% use bisection algorithm to solve the problem\n%*********************************************************************\n\nn_bot = 1;\nn_top = max_order;\nn_best = Inf;\n\nwhile( n_top - n_bot > 1)\n % try to find a feasible design for given specs\n n_cur = ceil( (n_top + n_bot)/2 );\n \n % create optimization matrices\n % A is the matrix used to compute the power spectrum\n % A(w,:) = [1 2*cos(w) 2*cos(2*w) ... 2*cos(n*w)]\n A = [ones(m,1) 2*cos(kron(w',[1:n_cur-1]))];\n \n % passband 0 <= w <= w_pass\n ind = find((0 <= w) & (w <= wpass)); % passband\n Ap = A(ind,:);\n \n % transition band is not constrained (w_pass <= w <= w_stop)\n \n % stopband (w_stop <= w)\n ind = find((wstop <= w) & (w <= pi)); % stopband\n As = A(ind,:);\n \n % This is the feasiblity problem:\n % cvx_begin quiet\n % variable r_cur(n_cur+1,1);\n % 10^(-delta/10) <= Ap * r_cur <= 10^(+delta/10);\n % abs( As * r_cur ) <= +10^(+atten/10);\n % A * r >= 0;\n % cvx_end\n % Unfortunately it seems to be a bit unreliable to solve. So we have\n % reformulated it as a stopband minimization. If the optimum stopband\n % attenuation is smaller than 10^(atten/10), then we have feasibility.\n % formulate and solve the feasibility linear-phase lp filter design\n cvx_begin quiet\n variables r_cur(n_cur,1);\n minimize( max( abs( As * r_cur ) ) );\n 10^(-delta/10) <= Ap * r_cur <= 10^(+delta/10);\n A * r_cur >= 0;\n cvx_end\n \n % bisection\n if isnan( cvx_optval ),\n fprintf( 1, 'Solver failed for n = %d taps, assuming infeasible\\n', n_cur );\n n_bot = n_cur;\n elseif cvx_optval <= 10^(atten/10), % strfind(cvx_status,'Solved') % feasible\n fprintf(1,'Problem is feasible for n = %d taps\\n',n_cur);\n n_top = n_cur;\n if n_best > n_cur, r = r_cur; end\n else % not feasible\n fprintf(1,'Problem not feasible for n = %d taps\\n',n_cur);\n n_bot = n_cur;\n end\nend\n\nh = spectral_fact(r);\nn = length(r);\nfprintf(1,'\\nOptimum number of filter taps for given specs is %d.\\n',n);\n\n\n%********************************************************************\n% plots\n%********************************************************************\nfigure(1)\n% FIR impulse response\nplot([0:n-1],h','o',[0:n-1],h','b:')\nxlabel('t'), ylabel('h(t)')\n\nfigure(2)\n% frequency response\nH = exp(-j*kron(w',[0:n-1]))*h;\n% magnitude\nsubplot(2,1,1)\nplot(w,20*log10(abs(H)),...\n [wstop pi],[atten atten],'r--',...\n [0 wpass],[delta delta],'r--',...\n [0 wpass],[-delta -delta],'r--');\naxis([0,pi,-40,10])\nxlabel('w'), ylabel('mag H(w) in dB')\n% phase\nsubplot(2,1,2)\nplot(w,angle(H))\naxis([0,pi,-pi,pi])\nxlabel('w'), ylabel('phase H(w)')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/filter_design/iir_mag_design_bandpass_max_atten.m", "content": "% Maximize stopband attenuation of a bandpass IIR filter\n% \"Linear Programming Design of IIR Digital Filters with Arbitrary\n% Magnitude Functions\" by L.R. Rabiner, N.Y. Graham, and H.D. Helms\n% (figures are generated)\n%\n% Designs a bandpass IIR filter using spectral factorization method where we:\n% - minimize maximum stopband attenuation\n% - have a constraint on the maximum passband ripple\n%\n% minimize max |H(w)| for w in the stopband\n% s.t. 1/delta <= |H(w)| <= delta for w in the passband\n%\n% where we now have a rational frequency response function:\n%\n% H(w) = sum_{m=0}^{M-1} b_m exp{-jwm} / sum_{n=1}^{N-1} a_n exp{-jwn}\n%\n% We change variables via spectral factorization method and get:\n%\n% minimize max R(w) for w in the stopband\n% s.t. (1/delta)^2 <= R(w) <= delta^2 for w in the passband\n% R(w) >= 0 for all w\n%\n% where R(w) is the squared magnited of the frequency response\n% (and the Fourier transform of the autocorrelation coefficients r).\n% We represent R(w) = N_hat(w)/D_hat(w), where now R(w) is a rational\n% function since we deal with IIR filter (see the reference paper).\n%\n% Variables are coeffients of the numerator, denoted as c, and\n% denominator, denoted as d. delta is the allowed passband ripple.\n% This is a quasiconvex problem and can be solved using bisection.\n%\n% Written for CVX by Almir Mutapcic 02/02/06\n\n%*********************************************************************\n% user's filter specs (for a low-pass filter example)\n%*********************************************************************\n% number of coefficients for the IIR filter (including the zeroth one)\n% (also without loss of generality we can assume that d_0 = 1, which\n% is the zeroth coefficient of the autocorrelation denominator)\nM = 6; % nominator\nN = 6; % denominator\n\n% maximum passband ripple in dB (+/- from the nominal 0 dB value)\ndelta = 1;\n\n% specification of the upper and lower bound functions U(w) and L(w)\n% freq specs\nwstop1 = 0.35*pi;\nwpass1 = 0.4*pi;\nwpass2 = 0.5*pi;\nwstop2 = 0.55*pi;\n\n%*********************************************************************\n% create optimization parameters\n%*********************************************************************\n% rule-of-thumb discretization (from Cheney's Approx. Theory book)\nsample_order = 30;\nm = 15*(sample_order);\nw = linspace(0,pi,m)'; % omega\n\n% A's are matrices used to compute the power spectrum\nAnum = [ones(m,1) 2*cos(kron(w,[1:M-1]))];\nAden = [ones(m,1) 2*cos(kron(w,[1:N-1]))];\n\n% first stopband 0 <= w <= wstop1\nind = find((0 <= w) & (w <= wstop1));\nAs1_num = Anum(ind,:);\nAs1_den = Aden(ind,:);\n\n% passband wpass1 <= w <= wpass2\nind = find(wpass1<=w & w<=wpass2);\nAp_num = Anum(ind,:);\nAp_den = Aden(ind,:);\n\n% second stopband wstop2 <= w <= pi\nind = find(w >= wstop2);\nAs2_num = Anum(ind,:);\nAs2_den = Aden(ind,:);\n\n%********************************************************************\n% optimization\n%********************************************************************\n\n% use bisection (on the log of vars) to solve for the min stopband atten\nUs_top = 1e-0; % 0 dB\nUs_bot = 1e-8; % -80 dB (in original variables)\n\nwhile( 20*log10(Us_top/Us_bot) > 1)\n % try to find a feasible design for given specs\n Us_cur = sqrt(Us_top*Us_bot);\n\n % [b_cur,a_cur] = iir_mag_design_spec_fact(w,L,U,N,M);\n % formulate and solve the magnitude design problem\n cvx_begin quiet\n variable c(M,1)\n variable d(N-1,1)\n\n % feasibility problem\n % passband constraints\n (Ap_num*c) <= (10^(+delta/20))^2*(Ap_den*[1;d]); % upper constr\n (Ap_num*c) >= (10^(-delta/20))^2*(Ap_den*[1;d]); % lower constr\n % stopband constraint\n (As1_num*c) <= (Us_cur)*(As1_den*[1;d]); % upper constr\n (As2_num*c) <= (Us_cur)*(As2_den*[1;d]); % upper constr\n % nonnegative-real constraint\n Anum*c >= 0;\n Aden*[1;d] >= 0;\n cvx_end\n\n % bisection\n if strfind(cvx_status,'Solved') % feasible\n fprintf(1,'Problem is feasible for stopband atten = %3.2f dB\\n', ...\n 10*log10(Us_cur));\n Us_top = Us_cur;\n b = spectral_fact(c);\n a = spectral_fact([1;d]);\n else % not feasible\n fprintf(1,'Problem not feasible for stopband atten = %3.2f dB\\n', ...\n 10*log10(Us_cur));\n Us_bot = Us_cur;\n end\nend\n\n% display the max attenuation in the stopband (convert to original vars)\nfprintf(1,'\\nOptimum min stopband atten is between %3.2f and %3.2f dB.\\n',...\n 10*log10(Us_bot),10*log10(Us_top));\ndisp('Optimal IIR filter coefficients are: ')\ndisp('Numerator: '), b\ndisp('Denominator: '), a\n\n%*********************************************************************\n% plotting routines\n%*********************************************************************\n% frequency response of the designed filter, where j = sqrt(-1)\nw = linspace(0,pi,5*m)'; % omega\nH = ([exp(-j*kron(w,[0:M-1]))]*b)./([exp(-j*kron(w,[0:N-1]))]*a);\n\n% magnitude plot\nfigure(1)\nsubplot(2,1,1)\nplot(w,20*log10(abs(H)), ...\n [wpass1 wpass2],[delta delta],'r--', ...\n [wpass1 wpass2],[-delta -delta],'r--', ...\n [0 wstop1],[10*log10(Us_top) 10*log10(Us_top)],'r--', ...\n [wstop2 pi],[10*log10(Us_top) 10*log10(Us_top)],'r--')\nxlabel('w')\nylabel('mag H(w) in dB')\naxis([0 pi -50 10]);\n\n% phase plot\nsubplot(2,1,2)\nplot(w,angle(H))\naxis([0,pi,-pi,pi])\nxlabel('w'), ylabel('phase H(w)')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/filter_design/iir_mag_design_lowpass_max_atten.m", "content": "% Maximize stopband attenuation of a lowpass IIR filter\n% \"Linear Programming Design of IIR Digital Filters with Arbitrary\n% Magnitude Functions\" by L.R. Rabiner, N.Y. Graham, and H.D. Helms\n% (figures are generated)\n%\n% Designs a lowpass IIR filter using spectral factorization method where we:\n% - minimize maximum stopband attenuation\n% - have a constraint on the maximum passband ripple\n%\n% minimize max |H(w)| for w in the stopband\n% s.t. 1/delta <= |H(w)| <= delta for w in the passband\n%\n% where we now have a rational frequency response function:\n%\n% H(w) = sum_{m=0}^{M-1} b_m exp{-jwm} / sum_{n=1}^{N-1} a_n exp{-jwn}\n%\n% We change variables via spectral factorization method and get:\n%\n% minimize max R(w) for w in the stopband\n% s.t. (1/delta)^2 <= R(w) <= delta^2 for w in the passband\n% R(w) >= 0 for all w\n%\n% where R(w) is the squared magnited of the frequency response\n% (and the Fourier transform of the autocorrelation coefficients r).\n% We represent R(w) = N_hat(w)/D_hat(w), where now R(w) is a rational\n% function since we deal with IIR filter (see the reference paper).\n%\n% Variables are coeffients of the numerator, denoted as c, and\n% denominator, denoted as d. delta is the allowed passband ripple.\n% This is a quasiconvex problem and can be solved using bisection.\n%\n% Written for CVX by Almir Mutapcic 02/02/06\n\n%*********************************************************************\n% user's filter specs (for a low-pass filter example)\n%*********************************************************************\n% number of coefficients for the IIR filter (including the zeroth one)\n% (also without loss of generality we can assume that d_0 = 1, which\n% is the zeroth coefficient of the autocorrelation denominator)\nM = 4; % nominator\nN = 4; % denominator\n\nwpass = 0.12*pi; % end of the passband\nwstop = 0.24*pi; % start of the stopband\ndelta = 1; % maximum passband ripple in dB (+/- around 0 dB)\n\n%*********************************************************************\n% create optimization parameters\n%*********************************************************************\n% rule-of-thumb discretization (from Cheney's Approx. Theory book)\nsample_order = 30;\nm = 15*(sample_order);\nw = linspace(0,pi,m)'; % omega\n\n% A's are matrices used to compute the power spectrum\nAnum = [ones(m,1) 2*cos(kron(w,[1:M-1]))];\nAden = [ones(m,1) 2*cos(kron(w,[1:N-1]))];\n\n% passband 0 <= w <= w_pass\nind = find((0 <= w) & (w <= wpass)); % passband\nAp_num = Anum(ind,:);\nAp_den = Aden(ind,:);\n\n% transition band is not constrained (w_pass <= w <= w_stop)\n\n% stopband (w_stop <= w)\nind = find((wstop <= w) & (w <= pi)); % stopband\nAs_num = Anum(ind,:);\nAs_den = Aden(ind,:);\n\n%********************************************************************\n% optimization\n%********************************************************************\n\n% use bisection (on the log of vars) to solve for the min stopband atten\nUs_top = 1e-0; % 0 dB\nUs_bot = 1e-6; % -60 dB (in original variables)\n\nwhile( 20*log10(Us_top/Us_bot) > 1)\n % try to find a feasible design for given specs\n Us_cur = sqrt(Us_top*Us_bot);\n \n % formulate and solve the magnitude design problem\n cvx_begin quiet\n variable c(M,1)\n variable d(N-1,1)\n\n % feasibility problem\n % passband constraints\n (Ap_num*c) <= (10^(+delta/20))^2*(Ap_den*[1;d]); % upper constr\n (Ap_num*c) >= (10^(-delta/20))^2*(Ap_den*[1;d]); % lower constr\n % stopband constraint\n (As_num*c) <= (Us_cur)*(As_den*[1;d]); % upper constr\n % nonnegative-real constraint\n Anum*c >= 0;\n Aden*[1;d] >= 0;\n cvx_end\n\n % bisection\n if ~any(isnan(c)) % feasible\n fprintf(1,'Problem is feasible for stopband atten = %3.2f dB\\n', ...\n 10*log10(Us_cur));\n Us_top = Us_cur;\n b = spectral_fact(c);\n a = spectral_fact([1;d]);\n else % not feasible\n fprintf(1,'Problem not feasible for stopband atten = %3.2f dB\\n', ...\n 10*log10(Us_cur));\n Us_bot = Us_cur;\n end\nend\n\n% display the max attenuation in the stopband (convert to original vars)\nfprintf(1,'\\nOptimum min stopband atten is between %3.2f and %3.2f dB.\\n',...\n 10*log10(Us_bot),10*log10(Us_top));\ndisp('Optimal IIR filter coefficients are: ')\ndisp('Numerator: '), b\ndisp('Denominator: '), a\n\n%*********************************************************************\n% plotting routines\n%*********************************************************************\n% frequency response of the designed filter, where j = sqrt(-1)\nH = ([exp(-j*kron(w,[0:M-1]))]*b)./([exp(-j*kron(w,[0:N-1]))]*a);\n\n% magnitude plot\nfigure(1)\nsubplot(2,1,1)\nplot(w,20*log10(abs(H)), ...\n [0 wpass],[delta delta],'r--', ...\n [0 wpass],[-delta -delta],'r--', ...\n [wstop pi],[10*log10(Us_top) 10*log10(Us_top)],'r--')\nxlabel('w')\nylabel('mag H(w) in dB')\naxis([0 pi -55 10]);\n\n% phase plot\nsubplot(2,1,2)\nplot(w,angle(H))\naxis([0,pi,-pi,pi])\nxlabel('w'), ylabel('phase H(w)')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/filter_design/one_over_f_filter.m", "content": "% Design a 1/f spectrum shaping (pink-noise) filter\n% \"Filter design\" lecture notes (EE364) by S. Boyd\n% \"FIR filter design via spectral factorization and convex optimization\"\n% by S.-P. Wu, S. Boyd, and L. Vandenberghe\n% (a figure is generated)\n%\n% Designs a log-Chebychev filter magnitude design given as:\n%\n% minimize max| log|H(w)| - log D(w) | for w in [0,pi]\n%\n% where variables are impulse response coefficients h, and data\n% is the desired frequency response magnitude D(w).\n%\n% We can express and solve the log-Chebychev problem above as\n%\n% minimize max( R(w)/D(w)^2, D(w)^2/R(w) )\n% s.t. R(w) = |H(w)|^2 for w in [0,pi]\n%\n% where we now use the auto-correlation coeffients r as variables. \n%\n% As an example we consider the 1/sqrt(w) spectrum shaping filter\n% (the so-called pink-noise filter) where D(w) = 1/sqrt(w).\n% Here we use a logarithmically sampled freq range w = [0.01*pi,pi].\n%\n% Written for CVX by Almir Mutapcic 02/02/06\n\n% parameters\nn = 40; % filter order\nm = 15*n; % frequency discretization (rule-of-thumb)\n\n% log-space frequency specification\nwa = 0.01*pi; wb = pi;\nwl = logspace(log10(wa),log10(wb),m)';\n\n% desired frequency response (pink-noise filter)\nD = 1./sqrt(wl);\n\n% matrix of cosines to compute the power spectrum\nAl = [ones(m,1) 2*cos(kron(wl,[1:n-1]))];\n\n% solve the problem using cvx\ncvx_begin\n variable r(n,1) % auto-correlation coefficients\n variable R(m,1) % power spectrum\n\n % log-chebychev minimax design\n minimize( max( max( [R./(D.^2) (D.^2).*inv_pos(R)]' ) ) )\n subject to\n % power spectrum constraint\n R == Al*r;\ncvx_end\n\n% check if problem was successfully solved\ndisp(['Problem is ' cvx_status])\nif ~strfind(cvx_status,'Solved')\n return\nend\n\n% spectral factorization\nh = spectral_fact(r);\n\n% figures\nfigure(1)\nH = exp(-j*kron(wl,[0:n-1]))*h;\nloglog(wl,abs(H),wl,D,'r--')\nset(gca,'XLim',[wa pi])\nxlabel('freq w')\nylabel('mag H(w) and D(w)')\nlegend('optimized','desired')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/filter_design/spectral_fact.m", "content": "% Spectral factorization using Kolmogorov 1939 approach.\n% (code follows pp. 232-233, Signal Analysis, by A. Papoulis)\n%\n% Computes the minimum-phase impulse response which satisfies\n% given auto-correlation.\n%\n% Input:\n% r: top-half of the auto-correlation coefficients\n% starts from 0th element to end of the auto-corelation\n% should be passed in as a column vector\n% Output\n% h: impulse response that gives the desired auto-correlation\n\nfunction h = spectral_fact(r)\n\n% length of the impulse response sequence\nn = length(r);\n\n% over-sampling factor\nmult_factor = 100; % should have mult_factor*(n) >> n \nm = mult_factor*n;\n\n% computation method:\n% H(exp(jTw)) = alpha(w) + j*phi(w)\n% where alpha(w) = 1/2*ln(R(w)) and phi(w) = Hilbert_trans(alpha(w))\n\n% compute 1/2*ln(R(w))\nw = 2*pi*[0:m-1]/m;\nR = [ ones(m,1) 2*cos(kron(w',[1:n-1])) ]*r;\nalpha = 1/2*log(R);\n\n% find the Hilbert transform \nalphatmp = fft(alpha);\nalphatmp(floor(m/2)+1:m) = -alphatmp(floor(m/2)+1:m);\nalphatmp(1) = 0;\nalphatmp(floor(m/2)+1) = 0;\nphi = real(ifft(j*alphatmp));\n\n% now retrieve the original sampling \nindex = find(rem([0:m-1],mult_factor)==0);\nalpha1 = alpha(index);\nphi1 = phi(index);\n\n% compute the impulse response (inverse Fourier transform)\nh = real(ifft(exp(alpha1+j*phi1),n));\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/gp_tutorial/Contents.m", "content": "% Examples from A Tutorial on Geometric Programming\n%\n% max_volume_box.m - Box volume maximization\n% simple_dig_ckt_sizing.m - Digital circuit sizing\n% simple_dig_ckt_sizing_vect.m - Digital circuit sizing (vectorized)\n% elmore_interconnect.m - Elmore delay sizing for an interconnect network.\n% floor_planning.m - Floor planning with an optimal trade-off curve.\n% basic_odp.m - Optimal doping profile optimization\n% beta_min_odp.m - Optimal doping profile optimization with current gain constraint.\n% power_control.m - Simple power control in communication systems via GP.\nhelp Contents\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/gp_tutorial/basic_odp.m", "content": "% Optimal doping profile optimization\n% Boyd, Kim, Vandenberghe, and Hassibi, \"A tutorial on geometric programming\"\n% Joshi, Boyd, and Dutton, \"Optimal doping profiles via geometric programming\"\n% Written for CVX by Almir Mutapcic 02/08/06\n% (a figure is generated)\n%\n% Determines the optimal doping profile that minimizes base transit\n% time in a (homojunction) bipolar junction transistor.\n% This problem can be posed as a GP:\n%\n% minimize tau_B\n% s.t. Nmin <= v <= Nmax\n% y_(i+1) + v_i^const1 <= y_i\n% w_(i+1) + v_i^const2 <= w_i, etc...\n%\n% where variables are v_i, y_i, and w_i.\n\n% discretization size\nM = 50;\n% M = 1000; % takes a few minutes to process constraints\n\n% problem constants\ng1 = 0.42;\ng2 = 0.69;\nNmax = 5*10^18;\nNmin = 5*10^16;\nNref = 10^17;\nDn0 = 20.72;\nni0 = 1.4*(10^10);\nWB = 10^(-5);\nC = WB^2/((M^2)*(Nref^g1)*Dn0);\n\n% exponent powers\npwi = g2 -1;\npwj = 1+g1-g2;\n\n% optimization variables\ncvx_begin gp\n variables v(M) y(M) w(M)\n\n % objective function is the base transmit time\n tau_B = C*w(1);\n\n minimize( tau_B )\n subject to\n % problem constraints\n v >= Nmin;\n v <= Nmax;\n\n for i = 1:M-1\n if( mod(i,100) == 0 ), fprintf(1,'progress counter: %d\\n',i), end;\n y(i+1) + v(i)^pwj <= y(i);\n w(i+1) + y(i)*v(i)^pwi <= w(i);\n end\n\n y(M) == v(M)^pwj;\n w(M) == y(M)*v(M)^pwi;\ncvx_end\n\n% plot the basic optimal doping profile\nfigure, clf\nnbw = 0:1/M:1-1/M;\nsemilogy(nbw,v,'LineWidth',2);\naxis([0 1 1e16 1e19]);\nxlabel('base');\nylabel('doping');\ntext(0,Nmin,'Nmin ', 'HorizontalAlignment','right');\ntext(0,Nmax,'Nmax ', 'HorizontalAlignment','right');\ndisp('Optimal doping profile is plotted.')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/gp_tutorial/beta_min_odp.m", "content": "% Optimal doping profile optimization with current gain constraint.\n% Boyd, Kim, Vandenberghe, and Hassibi, \"A tutorial on geometric programming\"\n% Joshi, Boyd, and Dutton, \"Optimal doping profiles via geometric programming\"\n% Written for CVX by Almir Mutapcic 02/08/06\n% (a figure is generated)\n%\n% Determines the optimal doping profile that minimizes base transit\n% time subject to a lower bound constraint on the current gain (beta).\n% This problem can be posed as a GP:\n%\n% minimize tau_B\n% s.t. Nmin <= v <= Nmax\n% y_(i+1) + v_i^const1 <= y_i\n% w_(i+1) + v_i^const2 <= w_i, etc...\n% beta => beta_min\n%\n% where variables are v_i, y_i, and w_i.\n\n% problem size\nM = 20;\n\n% problem constants\ng1 = 0.42;\ng2 = 0.69;\nNmax = 5*10^18;\nNmin = 5*10^16;\nNref = 10^17;\nDn0 = 20.72;\nni0 = 1.4*(10^10);\nWB = 10^(-5);\nC = WB^2/((M^2)*(Nref^g1)*Dn0);\n\n% minimum current gain values\nbeta_min_GE = [1 1.4 1.8 2.2 2.6 3.0 3.4 3.43]*(1e-11);\n\n% exponent powers\npwi = g2 -1;\npwj = 1+g1-g2;\n\nv_array = [];\nfor k = 1:length(beta_min_GE)\n fprintf( 'beta_min_GE = %g: ', beta_min_GE(k) );\n cvx_begin gp quiet\n % optimization variables\n variables v(M) y(M) w(M)\n\n % objective function is the base transmit time\n tau_B = C*w(1);\n\n minimize( tau_B )\n subject to\n % fixed problem constraints\n Nmin <= v <= Nmax;\n\n for i=1:M-1\n y(i+1) + v(i)^pwj <= y(i);\n w(i+1) + y(i)*v(i)^pwi <= w(i);\n end\n\n % equalities\n y(M) == v(M)^pwj;\n w(M) == y(M)*v(M)^pwi;\n\n % changing constraint\n (WB*beta_min_GE(k)/(M*Nref^(g1-g2)*Dn0))*y(1) <= 1;\n cvx_end\n fprintf( '%s\\n', cvx_status );\n % keep the optimal solution\n v_array = [v_array v];\nend\n\n% plot the basic optimal doping profile\nfigure, clf\nnbw = 0:1/M:1-1/M;\nfor k = 1:length(beta_min_GE)\n semilogy(nbw,v_array(:,k),'LineWidth',2); hold on;\nend\naxis([0 1 1e16 1e19]);\nxlabel('base');\nylabel('doping');\ntext(0,Nmin,'Nmin ', 'HorizontalAlignment','right');\ntext(0,Nmax,'Nmax ', 'HorizontalAlignment','right');\nhold off;\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/gp_tutorial/elmore_interconnect.m", "content": "% Elmore delay sizing for an interconnect network.\n% Boyd, Kim, Vandenberghe, and Hassibi, \"A Tutorial on Geometric Programming\"\n% Boyd, Kim, Patil, and Horowitz, \"Digital circuit optimization via geometric programming\"\n% Written for CVX by Almir Mutapcic 02/08/06\n% (a figure is generated)\n%\n% We consider the problem of finding optimal wire widths w_i\n% of N wire segments in an interconnect network, which will\n% minimize the critical Elmore delay, subject to limits on\n% wire widths and the total circuit area. We use a pi-model\n% for each wire segment. Problem can be formulated as GP:\n%\n% minimize D\n% s.t. w_min <= w <= w_max\n% area <= Amax\n%\n% where variables are widths w (and arrival times T that are used\n% to formulate the overall delay D expression).\n%\n% Important: We label root node as 1, and all the other nodes as\n% node_label_in_the_paper + 1 (due to Matlab's convention).\n% Also label nodes with increasing numbers downstream.\n\n%********************************************************************\n% user supplied data (problem constants and tree topology)\n%********************************************************************\nN = 6; % number of nodes (including the root node which is labeled as 1)\n\n% parent node array\n% specifies which node is a unique parent for node i (always have a tree)\nparent(1) = 0; % root node does not have a valid parent\nparent(2) = 1;\nparent(3) = 2;\nparent(4) = 3;\nparent(5) = 2;\nparent(6) = 5;\n\n% problem constants\nRsource = 0.1;\nl = 1*ones(N-1,1);\nalpha = 1*ones(N-1,1);\nbeta = 1*ones(N-1,1);\ngamma = 1*ones(N-1,1);\n\n% load capacitance at each node\nC1 = 10; C2 = 10; C3 = 10; C4 = 10; C5 = 10;\nCload = [0 C1 C2 C3 C4 C5];\n\n% minimum and maximum width and area specification\nWmin = 1;\nWmax = 10;\nAmax = 15;\n\n%********************************************************************\n% derived data (computed from user's data)\n%********************************************************************\n% compute children cell array (evaluate who are children for each node)\nchildren = cell(N,1);\nleafs = [];\nfor node = [1:N]\n children{node} = find(parent == node);\n if isempty(children{node})\n leafs(end+1) = node; % leafs have no children\n end\nend\n\n%********************************************************************\n% optimization (generating optimal tradeoff curve)\n%********************************************************************\ndisp('Generating the tradeoff curve...')\n\nDarray = [];\nfor Amax = [5.05 5.25 5.5 5.75 6:25]\n % formulate the GP problem and solve it\n cvx_begin gp quiet\n % optimization variables\n variable w(N-1) % wire width\n variable T(N) % arrival time (Elmore delay to node i)\n\n % area definition\n area = sum(w.*l);\n\n % wire segment resistance is inversely proportional to widths\n R = alpha.*l./w;\n R = [Rsource; R];\n\n % wire segment capacitance is an affine function of widths\n C_bar = beta.*l.*w + gamma.*l;\n C_bar = [0; C_bar];\n\n % compute common capacitances for each node (C_tilde in GP tutorial)\n C_tilde = cvx( zeros(N,1) );\n for node = [1:N]\n C_tilde(node,1) = Cload(node);\n for k = parent(node)\n if k > 0; C_tilde(node,1) = C_tilde(node,1) + C_bar(k); end;\n end\n for k = children{node}\n C_tilde(node,1) = C_tilde(node,1) + C_bar(k);\n end\n end\n\n % now compute total downstream capacitances\n C_total = C_tilde;\n for node = N:-1:1\n for k = children{node}\n C_total(node,1) = C_total(node,1) + C_total(k,1);\n end\n end\n\n % objective is the critical Elmore delay\n minimize( max( T(leafs) ) )\n subject to\n % generate Elmore delay constraints\n R(1)*C_total(1) <= T(1,1);\n for node = 2:N\n R(node)*C_total(node) + T(parent(node),1) <= T(node,1);\n end\n\n % area and width constraints\n area <= Amax;\n w >= Wmin;\n w <= Wmax;\n cvx_end\n\n % display and store computed values\n fprintf(1,' Amax = %5.2f delay = %3.2f\\n',Amax,cvx_optval);\n Darray = [Darray cvx_optval];\nend\n\n% plot the tradeoff curve\nfigure, clf\nAmax = [5.05 5.25 5.5 5.75 6:25];\nplot(Darray,Amax);\nxlabel('Elmore delay D'); ylabel('Amax');\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/gp_tutorial/floor_planning.m", "content": "% Floor planning with an optimal trade-off curve.\n% Boyd, Kim, Vandenberghe, and Hassibi, \"A Tutorial on Geometric Programming\"\n% Written for CVX by Almir Mutapcic 02/08/06\n% (a figure is generated)\n%\n% Solves the problem of configuring and placing rectangles such\n% that they do not overlap and that they minimize the area of the\n% bounding box. This code solves the specific instances given\n% in the GP tutorial. We have four rectangles with variable\n% width w_i and height h_i. They need to satisfy area and aspect\n% ration constraints. The GP is formulated as:\n%\n% minimize max(wa+wb,wc+wd)*(max(ha,hb)+max(hc,hd))\n% s.t. wa*ha == area_a, wb*hb == area_b, ...\n% 1/alpha_max <= ha/wa <= alpha_max, ...\n%\n% where variables are rectangle widths w's and heights h's.\n\n% constants\na = 0.2;\nb = 0.5;\nc = 1.5;\nd = 0.5;\n\n% alpha is the changing parameter\nN = 20;\nalpha = linspace(1.01,4,N);\n\nfprintf(1,'Solving for the optimal tradeoff curve...\\n');\nmin_area = zeros(N,1);\nfor n = 1:N\n % GP variables\n fprintf( 'alpha = %.2f ... ', alpha(n) );\n cvx_begin gp quiet\n variables wa wb wc wd ha hb hc hd\n % objective function is the area of the bounding box\n minimize( max(wa+wb,wc+wd)*(max(ha,hb)+max(hc,hd)) )\n subject to\n % constraints (now impose the non-changing constraints)\n ha*wa == a; hb*wb == b; hc*wc == c; hd*wd == d;\n 1/alpha(n) <= ha/wa <= alpha(n);\n 1/alpha(n) <= hb/wb <= alpha(n);\n 1/alpha(n) <= hc/wc <= alpha(n);\n 1/alpha(n) <= hd/wd <= alpha(n);\n cvx_end\n fprintf( 'area = %.2f\\n', cvx_optval );\n min_area(n) = cvx_optval;\nend\n\nfigure, clf\nplot(alpha,min_area);\nxlabel('alpha'); ylabel('min area');\naxis([1 4 2.5 4]);\ndisp('Optimal tradeoff curve is plotted.')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/gp_tutorial/max_volume_box.m", "content": "% Box volume maximization\r\n% Boyd, Kim, Vandenberghe, and Hassibi, \"A Tutorial on Geometric Programming\"\r\n% Written for CVX by Almir Mutapcic 02/08/06\r\n% (a figure is generated)\r\n%\r\n% Maximizes volume of a box-shaped structure which has constraints\r\n% on its total wall area, its total floor area, and which has lower\r\n% and upper bounds on the aspect ratios. This leads to a GP:\r\n%\r\n% maximize h*w*d\r\n% s.t. 2(h*w + h*d) <= Awall, w*d <= Afloor\r\n% alpha <= h/w <= beta\r\n% gamma <= d/w <= delta\r\n%\r\n% where variables are the box height h, width w, and depth d.\r\n\r\n% problem constants\r\nalpha = 0.5; beta = 2; gamma = 0.5; delta = 2;\r\n\r\n% varying parameters for an optimal trade-off curve\r\nN = 10;\r\nAfloor = logspace(1,3,N);\r\nAwall = [100 1000 10000];\r\nopt_volumes = zeros(length(Awall),N);\r\n\r\ndisp('Computing optimal box volume for:')\r\n\r\n% setup various GP problems with varying parameters\r\nfor k = 1:length(Awall)\r\n Awall_k = Awall(k);\r\n fprintf( 'Awall = %d:\\n', Awall(k) );\r\n for n = 1:N\r\n % resolve the problem with varying parameters\r\n Afloor_n = Afloor(n);\r\n fprintf( ' Afloor = %7.2f: ', Afloor(n) );\r\n cvx_begin gp quiet\r\n variables h w d\r\n % objective function is the box volume\r\n maximize( h*w*d )\r\n subject to\r\n 2*(h*w + h*d) <= Awall_k;\r\n w*d <= Afloor_n;\r\n alpha <= h/w <= beta;\r\n gamma <= d/w <= delta;\r\n cvx_end\r\n fprintf( 'max_volume = %3.2f\\n', cvx_optval );\r\n opt_volumes(k,n) = cvx_optval;\r\n end\r\nend\r\n\r\n% plot the tradeoff curve\r\nfigure, clf\r\nloglog(Afloor,opt_volumes(1,:), Afloor,opt_volumes(2,:), Afloor,opt_volumes(3,:));\r\nxlabel('Afloor'); ylabel('V');\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/gp_tutorial/power_control.m", "content": "% Simple power control in communication systems via GP.\r\n% Boyd, Kim, Vandenberghe, and Hassibi, \"A Tutorial on Geometric Programming\"\r\n% Written for CVX by Almir Mutapcic 02/08/06\r\n% (a figure is generated)\r\n%\r\n% Solves the power control problem in communication systems, where\r\n% we want to minimize the total transmitter power for n transmitters,\r\n% subject to minimum SINR level, and lower and upper bounds on powers.\r\n% This results in a GP:\r\n%\r\n% minimize sum(P)\r\n% s.t. Pmin <= P <= Pmax\r\n% SINR >= SINR_min\r\n%\r\n% where variables are transmitter powers P.\r\n% Numerical data for the specific examples was made up.\r\n\r\n% problem constants\r\nn = 5; % number of transmitters and receivers\r\nsigma = 0.5*ones(n,1); % noise power at the receiver i\r\nPmin = 0.1*ones(n,1); % minimum power at the transmitter i\r\nPmax = 5*ones(n,1); % maximum power at the transmitter i\r\nSINR_min = 2; % threshold SINR for each receiver\r\n\r\n% path gain matrix\r\nG = [1.0 0.1 0.2 0.1 0.0\r\n 0.1 1.0 0.1 0.1 0.0\r\n 0.2 0.1 2.0 0.2 0.2\r\n 0.1 0.1 0.2 1.0 0.1\r\n 0.0 0.0 0.2 0.1 1.0];\r\n\r\n% variables are power levels\r\ncvx_begin gp\r\n variable P(n)\r\n % objective function is the total transmitter power\r\n minimize( sum(P) )\r\n subject to\r\n % formulate the inverse SINR at each receiver using vectorize features\r\n Gdiag = diag(G); % the main diagonal of G matrix\r\n Gtilde = G - diag(Gdiag); % G matrix without the main diagonal\r\n % inverse SINR\r\n inverseSINR = (sigma + Gtilde*P)./(Gdiag.*P);\r\n % constraints are power limits and minimum SINR level\r\n Pmin <= P <= Pmax;\r\n inverseSINR <= (1/SINR_min);\r\ncvx_end\r\n\r\nfprintf(1,'\\nThe minimum total transmitter power is %3.2f.\\n',cvx_optval);\r\ndisp('Optimal power levels are: '), P\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/gp_tutorial/simple_dig_ckt_sizing.m", "content": "% Digital circuit sizing\n% Boyd, Kim, Vandenberghe, and Hassibi, \"A Tutorial on Geometric Programming\"\n% Written for CVX by Almir Mutapcic 02/08/06\n% (a figure is generated)\n%\n% Solves the problem of choosing gate scale factors x_i to give\n% minimum ckt delay, subject to limits on the total area and power.\n%\n% minimize D\n% s.t. P <= Pmax, A <= Amax\n% x >= 1\n%\n% where variables are scale factors x.\n%\n% This code is specific to the digital circuit shown in figure 4\n% (page 28) of GP tutorial paper. All the constraints and\n% the worst-case delay expression are hard-coded for this\n% particular circuit.\n%\n% A more general code with more precise models for digital cicuit\n% sizing is also available as part of the CVX examples library.\n\n% number of cells\nm = 7;\n\n% problem constants\nf = [1 0.8 1 0.7 0.7 0.5 0.5]';\ne = [1 2 1 1.5 1.5 1 2]';\nCout6 = 10;\nCout7 = 10;\n\na = ones(m,1);\nalpha = ones(m,1);\nbeta = ones(m,1);\ngamma = ones(m,1);\n\n% varying parameters for an optimal trade-off curve\nN = 25;\nPmax = linspace(10,100,N);\nAmax = [25 50 100];\nmin_delay = zeros(length(Amax),N);\n\ndisp('Generating the optimal tradeoff curve...')\n\nfor k = 1:length(Amax)\n fprintf( 'Amax = %d:\\n', Amax(k) );\n for n = 1:N\n fprintf( ' Pmax = %6.2f: ', Pmax(n) );\n cvx_begin gp quiet\n % optimization variables\n variable x(m) % scale factors\n\n % input capacitance is an affine function of sizes\n cin = alpha + beta.*x;\n\n % load capacitance of a gate is the sum of its fan-out c_in's\n clear cload; % start with a fresh variable\n cload(1) = cin(4);\n cload(2) = cin(4) + cin(5);\n cload(3) = cin(5) + cin(7);\n cload(4) = cin(6) + cin(7);\n cload(5) = cin(7);\n % output gates have their load capacitances\n cload(6) = Cout6;\n cload(7) = Cout7;\n\n % gate delay is the product of its driving res. R = gamma./x and cload\n d = (cload').*gamma./x;\n\n power = (f.*e)'*x; % total power\n area = a'*x; % total area\n\n % evaluate delay over all paths in the given circuit (there are 7 paths)\n path_delays = [ ...\n d(1) + d(4) + d(6); % delay of path 1\n d(1) + d(4) + d(7); % delay of path 2, etc...\n d(2) + d(4) + d(6);\n d(2) + d(4) + d(7);\n d(2) + d(5) + d(7);\n d(3) + d(5) + d(6);\n d(3) + d(7) ];\n\n % overall circuit delay\n circuit_delay = ( max(path_delays) );\n\n % objective is the worst-case delay\n minimize( circuit_delay )\n subject to\n % construct the constraints\n x >= 1; % all sizes greater than 1 (normalized)\n power <= Pmax(n); % power constraint\n area <= Amax(k); % area constraint\n cvx_end\n fprintf( 'delay = %3.2f\\n', cvx_optval );\n min_delay(k,n) = cvx_optval;\n end\nend\n\n% plot the tradeoff curve\nplot(Pmax,min_delay(1,:), Pmax,min_delay(2,:), Pmax,min_delay(3,:));\nxlabel('Pmax'); ylabel('Dmin');\ndisp('Optimal tradeoff curve plotted.')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/gp_tutorial/simple_dig_ckt_sizing_vect.m", "content": "% Digital circuit sizing (vectorized)\n% Boyd, Kim, Vandenberghe, and Hassibi, \"A Tutorial on Geometric Programming\"\n% Written for CVX by Almir Mutapcic 02/08/06\n% (a figure is generated)\n%\n% Solves the problem of choosing gate scale factors x_i to give\n% minimum ckt delay, subject to limits on the total area and power.\n%\n% minimize D\n% s.t. P <= Pmax, A <= Amax\n% x >= 1\n%\n% where variables are scale factors x.\n%\n% This code uses matrices in order to evaluate signal paths\n% through the circuit (thus, it uses vectorize Matlab features).\n% It is specific to the digital circuit shown in figure 4 (page 28)\n% of GP tutorial paper.\n\n% digital circuit shown in figure 4 (page 28) of GP tutorial paper\nm = 7; % number of cells\nn = 8; % number of edges\nA = sparse(m,n);\n\n% A is standard cell-edge incidence matrix of the circuit\n% A_ij = 1 if edge j comes out of cell i, -1 if it comes in, 0 otherwise\n A(1,1) = 1;\n A(2,2) = 1;\n A(2,3) = 1;\n A(3,4) = 1;\n A(3,8) = 1;\n A(4,1) = -1;\n A(4,2) = -1;\n A(4,5) = 1;\n A(4,6) = 1;\n A(5,3) = -1;\n A(5,4) = -1;\n A(5,7) = 1;\n A(6,5) = -1;\n A(7,6) = -1;\n A(7,7) = -1;\n A(7,8) = -1;\n\n% decompose A into edge outgoing and edge-incoming part\nAout = double(A > 0);\nAin = double(A < 0);\n\n% problem constants\nf = [1 0.8 1 0.7 0.7 0.5 0.5]';\ne = [1 2 1 1.5 1.5 1 2]';\nCout6 = 10;\nCout7 = 10;\n\na = ones(m,1);\nalpha = ones(m,1);\nbeta = ones(m,1);\ngamma = ones(m,1);\n\n% varying parameters for an optimal trade-off curve\nN = 20;\nPmax = linspace(10,100,N);\nAmax = [25 50 100];\nmin_delay = zeros(length(Amax),N);\n\ndisp('Generating the optimal tradeoff curve...')\n\nfor k = 1:length(Amax)\n fprintf( 'Amax = %d:\\n', Amax(k) );\n for n = 1:N\n fprintf( ' Pmax = %6.2f: ', Pmax(n) );\n cvx_begin gp quiet\n % optimization variables\n variable x(m) % scale factors\n variable t(m) % arrival times\n\n % objective is the upper bound on the overall delay\n % and that is the max of arrival times for output gates 6 and 7\n minimize( max( t(6),t(7) ) )\n subject to\n % input capacitance is an affine function of sizes\n cin = alpha + beta.*x;\n\n % load capacitance is the input capacitance times the fan-out matrix\n % given by Fout = Aout*Ain'\n cload = (Aout*Ain')*cin;\n cload(6) = Cout6; % load capacitance of the output gate 6\n cload(7) = Cout7; % load capacitance of othe utput gate 7\n\n % delay is the product of its driving resistance R = gamma./x and cload\n d = cload.*gamma./x;\n\n % power and area definitions\n power = (f.*e)'*x;\n area = a'*x;\n\n % scale size, power, and area constraints\n x >= 1;\n power <= Pmax(n);\n area <= Amax(k);\n\n % create timing constraints\n % these constraints enforce t_j + d_j <= t_i over all gates j that drive gate i\n Aout'*t + Ain'*d <= Ain'*t;\n\n % for gates with inputs not connected to other gates we enforce d_i <= t_i\n d(1:3) <= t(1:3);\n cvx_end\n fprintf( 'delay = %3.2f\\n', cvx_optval );\n min_delay(k,n) = cvx_optval;\n end\nend\n\n% plot the tradeoff curve\nplot(Pmax,min_delay(1,:), Pmax,min_delay(2,:), Pmax,min_delay(3,:));\nxlabel('Pmax'); ylabel('Dmin');\ndisp('Optimal tradeoff curve plotted.')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/graph_laplacian/Contents.m", "content": "% Graph Laplacian eigenvalue optimization\n% Convex Optimization of Graph Laplacian Eigenvalues\n%\n% larger_example.m - FDLA and FMMC solutions for a 50-node, 200-edge graph\n% cut_grid_example.m - FDLA and FMMC solutions for a 64-node, 95-edge cut-grid graph\n% small_example.m - FDLA and FMMC solutions for an 8-node, 13-edge graph\n% fmmc.m - Computes fastest mixing Markov chain (FMMC) edge weights\n% mh.m - Computes the Metropolis-Hastings heuristic edge weights\n% best_const.m - Computes the constant edge weight that yields fastest averaging.\n% fdla.m - Computes the fastest distributed linear averaging (FDLA) edge weights\n% max_deg.m - Computes the maximum-degree heuristic edge weights\n% cut_grid_data.m - Generate a cut-grid graph for the ICM 2006 talk example\n% plotgraph.m - Plots a graph with each edge width proportional to its weight.\nhelp Contents\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/graph_laplacian/best_const.m", "content": "function [w,rho] = best_const(A)\n% Computes the constant edge weight that yields fastest averaging.\n%\n% [W,RHO] = BEST_CONST(A) gives a vector of the best constant edge weights\n% for a graph described by the incidence matrix A (NxM). N is the number of\n% nodes, and M is the number of edges. Each column of A has exactly one +1\n% and one -1. \n%\n% The best constant edge weight is the inverse of the average of\n% the second smallest and largest eigenvalues of the unweighted Laplacian:\n% W = 2/( lambda_2(A*A') + lambda_n(A*A') )\n% RHO is computed from the weights W as follows:\n% RHO = max(abs(eig( eye(n,n) - (1/n)*ones(n,n) - A*W*A' ))).\n%\n% For more details, see the references:\n% \"Fast linear iterations for distributed averaging\" by L. Xiao and S. Boyd\n% \"Fastest mixing Markov chain on a graph\" by S. Boyd, P. Diaconis, and L. Xiao\n% \"Convex Optimization of Graph Laplacian Eigenvalues\" by S. Boyd\n%\n% Almir Mutapcic 08/29/06\n[n,m] = size(A);\n\n% max degrees of the nodes\nLunw = A*A'; % unweighted Laplacian matrix\neigvals = sort(eig(Lunw));\n\n% max degree weigth allocation\nalpha = 2/(eigvals(2) + eigvals(n));\nw = alpha*ones(m,1);\n\n% compute the norm\nif nargout > 1,\n rho = norm( eye(n) - A*diag(w)*A' - (1/n)*ones(n) );\nend\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/graph_laplacian/cut_grid_data.m", "content": "function [A,xy]= cut_grid_data\n\n% Generate a cut-grid graph for the ICM 2006 talk example\n%\n% The graph has 64 nodes and 95 edges\n% A is an n x m incidence matrix (n is number of nodes, m is number of edges)\n% xy is the location data\n%\n% Original code by Arpita Ghosh, modified for ICM06 talk by Almir Mutapcic\n\nn = 8; \nr1 = 2;\ny = ones(n,1) * [1:n];\nx = y';\nx = x(:);\ny = y(:);\ndx = x * ones(1,n^2);\ndy = y * ones(1,n^2);\nxy = [ x, y ];\n\n% Find the adjacency matrix, manually deleting edges to get down to size\nAdj1 = tril( ( dx - dx' ) .^ 2 + ( dy - dy' ) .^2 < r1, -1 );\nAdj1(49,41) = 0;\nAdj1(50,42) = 0; \nAdj1(16,8) = 0;\nAdj1(24,16) = 0;\nAdj1(15,7) = 0;\nAdj1(23,15) = 0;\nAdj1(10,1) = 0; \nAdj1(21,13) = 0;\nAdj1(13,5) = 0; \nAdj1(22,14) = 0;\nAdj1(14,6) = 0; \nAdj1(51,43) = 0; \nAdj1(52,44) = 0; \nAdj1(53,45) = 0; \nAdj1(54,46) = 0; \nAdj1(42,41) = 0;\nAdj1(34,33) = 0;\nAdj1(26,25) = 0;\n\n% Build the incidence matrix\n[i,j,v] = find(Adj1);\nm = length(i);\nA = sparse( [i;j], [1:m,1:m]', [ones(m,1);-ones(m,1)] );\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/graph_laplacian/cut_grid_example.m", "content": "% FDLA and FMMC solutions for a 64-node, 95-edge cut-grid graph\n% S. Boyd, et. al., \"Convex Optimization of Graph Laplacian Eigenvalues\"\n% ICM'06 talk examples (www.stanford.edu/~boyd/cvx_opt_graph_lapl_eigs.html)\n% Written for CVX by Almir Mutapcic 08/29/06\n% (figures are generated)\n%\n% In this example we consider a graph described by the incidence matrix A.\n% Each edge has a weight W_i, and we optimize various functions of the\n% edge weights as described in the referenced paper; in particular,\n%\n% - the fastest distributed linear averaging (FDLA) problem (fdla.m)\n% - the fastest mixing Markov chain (FMMC) problem (fmmc.m)\n%\n% Then we compare these solutions to the heuristics listed below:\n%\n% - maximum-degree heuristic (max_deg.m)\n% - constant weights that yield fastest averaging (best_const.m)\n% - Metropolis-Hastings heuristic (mh.m)\n\n% generate a cut-grid graph example\n[A,xy] = cut_grid_data;\n\n% Compute edge weights: some optimal, some based on heuristics\n[n,m] = size(A);\n\n[ w_fdla, rho_fdla ] = fdla(A);\n[ w_fmmc, rho_fmmc ] = fmmc(A);\n[ w_md, rho_md ] = max_deg(A);\n[ w_bc, rho_bc ] = best_const(A);\n[ w_mh, rho_mh ] = mh(A);\n\ntau_fdla = 1/log(1/rho_fdla);\ntau_fmmc = 1/log(1/rho_fmmc);\ntau_md = 1/log(1/rho_md);\ntau_bc = 1/log(1/rho_bc);\ntau_mh = 1/log(1/rho_mh);\n\nfprintf(1,'\\nResults:\\n');\nfprintf(1,'FDLA weights:\\t\\t rho = %5.4f \\t tau = %5.4f\\n',rho_fdla,tau_fdla);\nfprintf(1,'FMMC weights:\\t\\t rho = %5.4f \\t tau = %5.4f\\n',rho_fmmc,tau_fmmc);\nfprintf(1,'M-H weights:\\t\\t rho = %5.4f \\t tau = %5.4f\\n',rho_mh,tau_mh);\nfprintf(1,'MAX_DEG weights:\\t rho = %5.4f \\t tau = %5.4f\\n',rho_md,tau_md);\nfprintf(1,'BEST_CONST weights:\\t rho = %5.4f \\t tau = %5.4f\\n',rho_bc,tau_bc);\n\n% plot results\nfigure(1), clf\nplotgraph(A,xy,w_fdla);\ntext(0.425,1.05,'FDLA optimal weights')\n\nfigure(2), clf\nplotgraph(A,xy,w_fmmc);\ntext(0.425,1.05,'FMMC optimal weights')\n\nfigure(3), clf\nplotgraph(A,xy,w_md);\ntext(0.375,1.05,'Max degree optimal weights')\n\nfigure(4), clf\nplotgraph(A,xy,w_bc);\ntext(0.375,1.05,'Best constant optimal weights')\n\nfigure(5), clf\nplotgraph(A,xy,w_mh);\ntext(0.3,1.05,'Metropolis-Hastings optimal weights')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/graph_laplacian/fdla.m", "content": "function [ w, cvx_optval ] = fdla( A )\n\n% Computes the fastest distributed linear averaging (FDLA) edge weights\n%\n% [W,S] = FDLA(A) gives a vector of the fastest distributed linear averaging\n% edge weights for a graph described by the incidence matrix A (n x m).\n% Here n is the number of nodes and m is the number of edges in the graph;\n% each column of A has exactly one +1 and one -1.\n%\n% The FDLA edge weights are given by the SDP:\n%\n% minimize s\n% subject to -s*I <= I - L - (1/n)11' <= s*I\n%\n% where the variables are edge weights w in R^m and s in R.\n% Here L is the weighted Laplacian defined by L = A*diag(w)*A'.\n% The optimal value is s, and is returned in the second output.\n%\n% For more details see the references:\n% \"Fast linear iterations for distributed averaging\" by L. Xiao and S. Boyd\n% \"Convex Optimization of Graph Laplacian Eigenvalues\" by S. Boyd\n%\n% Written for CVX by Almir Mutapcic 08/29/06\n\n[n,m] = size(A);\nI = eye(n,n);\nJ = I - (1/n) * ones(n,n);\ncvx_begin sdp\n variable w(m,1) % edge weights\n variable s % epigraph variable\n variable L(n,n) symmetric\n minimize( s )\n subject to\n L == A * diag(w) * A';\n -s * I <= J - L <= s * I;\ncvx_end\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/graph_laplacian/fmmc.m", "content": "function [ w, cvx_optval ] = fmmc(A)\n\n% Computes fastest mixing Markov chain (FMMC) edge weights\n%\n% [W,S] = FMMC(A) gives a vector of the fastest mixing Markov chain\n% edge weights for a graph described by the incidence matrix A (n x m).\n% Here n is the number of nodes and m is the number of edges in the graph;\n% each column of A has exactly one +1 and one -1.\n%\n% The FMMC edge weights are given the SDP:\n%\n% minimize s\n% subject to -s*I <= I - L - (1/n)11' <= s*I\n% w >= 0, diag(L) <= 1\n%\n% where the variables are edge weights w in R^m and s in R.\n% Here L is the weighted Laplacian defined by L = A*diag(w)*A'.\n% The optimal value is s, and is returned in the second output.\n%\n% For more details see references:\n% \"Fastest mixing Markov chain on a graph\" by S. Boyd, P. Diaconis, and L. Xiao\n% \"Convex Optimization of Graph Laplacian Eigenvalues\" by S. Boyd\n%\n% Written for CVX by Almir Mutapcic 08/29/06\n\n[n,m] = size(A);\nI = eye(n,n);\nJ = I - (1/n)*ones(n,n);\ncvx_begin sdp\n variable w(m,1) % edge weights\n variable s % epigraph variable\n variable L(n,n) symmetric\n minimize( s )\n subject to\n L == A * diag(w) * A';\n -s * I <= J - L <= +s * I;\n w >= 0;\n diag(L) <= 1;\ncvx_end\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/graph_laplacian/larger_example.m", "content": "% FDLA and FMMC solutions for a 50-node, 200-edge graph\n% S. Boyd, et. al., \"Convex Optimization of Graph Laplacian Eigenvalues\"\n% ICM'06 talk examples (www.stanford.edu/~boyd/cvx_opt_graph_lapl_eigs.html)\n% Written for CVX by Almir Mutapcic 08/29/06\n% (figures are generated)\n%\n% In this example we consider a graph described by the incidence matrix A.\n% Each edge has a weight W_i, and we optimize various functions of the\n% edge weights as described in the referenced paper; in particular,\n%\n% - the fastest distributed linear averaging (FDLA) problem (fdla.m)\n% - the fastest mixing Markov chain (FMMC) problem (fmmc.m)\n%\n% Then we compare these solutions to the heuristics listed below:\n%\n% - maximum-degree heuristic (max_deg.m)\n% - constant weights that yield fastest averaging (best_const.m)\n% - Metropolis-Hastings heuristic (mh.m)\n\n% randomly generate a graph with 50 nodes and 200 edges\n% and make it pretty for plotting\nn = 50; threshold = 0.2529;\nrand('state',209);\nxy = rand(n,2);\n\nangle = 10*pi/180;\nRotate = [ cos(angle) sin(angle); -sin(angle) cos(angle) ];\nxy = (Rotate*xy')';\n\nDist = zeros(n,n);\nfor i=1:(n-1);\n for j=i+1:n;\n Dist(i,j) = norm( xy(i,:) - xy(j,:) );\n end;\nend;\nDist = Dist + Dist';\nAd = Dist < threshold;\nAd = Ad - eye(n);\nm = sum(sum(Ad))/2;\n\n% find the incidence matrix\nA = zeros(n,m);\nl = 0;\nfor i=1:(n-1);\n for j=i+1:n;\n if Ad(i,j)>0.5\n l = l + 1;\n A(i,l) = 1;\n A(j,l) = -1;\n end;\n end;\nend;\nA = sparse(A);\n\n% Compute edge weights: some optimal, some based on heuristics\n[n,m] = size(A);\n\n[ w_fdla, rho_fdla ] = fdla(A);\n[ w_fmmc, rho_fmmc ] = fmmc(A);\n[ w_md, rho_md ] = max_deg(A);\n[ w_bc, rho_bc ] = best_const(A);\n[ w_mh, rho_mh ] = mh(A);\n\ntau_fdla = 1/log(1/rho_fdla);\ntau_fmmc = 1/log(1/rho_fmmc);\ntau_md = 1/log(1/rho_md);\ntau_bc = 1/log(1/rho_bc);\ntau_mh = 1/log(1/rho_mh);\n\neig_opt = sort(eig(eye(n) - A * diag(w_fdla) * A'));\neig_fmmc = sort(eig(eye(n) - A * diag(w_fmmc) * A'));\neig_mh = sort(eig(eye(n) - A * diag(w_mh) * A'));\neig_md = sort(eig(eye(n) - A * diag(w_md) * A'));\neig_bc = sort(eig(eye(n) - A * diag(w_bc) * A'));\n\nfprintf(1,'\\nResults:\\n');\nfprintf(1,'FDLA weights:\\t\\t rho = %5.4f \\t tau = %5.4f\\n',rho_fdla,tau_fdla);\nfprintf(1,'FMMC weights:\\t\\t rho = %5.4f \\t tau = %5.4f\\n',rho_fmmc,tau_fmmc);\nfprintf(1,'M-H weights:\\t\\t rho = %5.4f \\t tau = %5.4f\\n',rho_mh,tau_mh);\nfprintf(1,'MAX_DEG weights:\\t rho = %5.4f \\t tau = %5.4f\\n',rho_md,tau_md);\nfprintf(1,'BEST_CONST weights:\\t rho = %5.4f \\t tau = %5.4f\\n',rho_bc,tau_bc);\n\n% plot results\nfigure(1), clf\ngplot(Ad,xy);\nhold on;\nplot(xy(:,1), xy(:,2), 'ko','LineWidth',4, 'MarkerSize',4);\naxis([0.05 1.1 -0.1 0.95]);\ntitle('Graph')\nhold off;\n\nfigure(2), clf\nv_fdla = [w_fdla; diag(eye(n) - A*diag(w_fdla)*A')];\n[ifdla, jfdla, neg_fdla] = find( v_fdla.*(v_fdla < -0.001 ) );\nv_fdla(ifdla) = [];\nwbins = [-0.6:0.012:0.6];\nhist(neg_fdla,wbins); hold on,\nh = findobj(gca,'Type','patch');\nset(h,'FaceColor','r')\nhist(v_fdla,wbins); hold off,\naxis([-0.6 0.6 0 12]);\nxlabel('optimal FDLA weights');\nylabel('histogram');\n\nfigure(3), clf\nxbins = (-1:0.015:1)';\nymax = 6;\nsubplot(3,1,1)\nhist(eig_md, xbins); hold on;\nmax_md = max(abs(eig_md(1:n-1)));\nplot([-max_md -max_md],[0 ymax], 'b--');\nplot([ max_md max_md],[0 ymax], 'b--');\naxis([-1 1 0 ymax]);\ntext(0,5,'MAX DEG');\ntitle('Eigenvalue distributions')\nsubplot(3,1,2)\nhist(eig_bc, xbins); hold on;\nmax_opt = max(abs(eig_bc(1:n-1)));\nplot([-max_opt -max_opt],[0 ymax], 'b--');\nplot([ max_opt max_opt],[0 ymax], 'b--');\naxis([-1 1 0 ymax]);\ntext(0,5,'BEST CONST');\nsubplot(3,1,3)\nhist(eig_opt, xbins); hold on;\nmax_opt = max(abs(eig_opt(1:n-1)));\nplot([-max_opt -max_opt],[0 ymax], 'b--');\nplot([ max_opt max_opt],[0 ymax], 'b--');\naxis([-1 1 0 ymax]);\ntext(0,5,'FDLA');\n\nfigure(4), clf\nxbins = (-1:0.015:1)';\nymax = 6;\nsubplot(3,1,1)\nhist(eig_md, xbins); hold on;\nmax_md = max(abs(eig_md(1:n-1)));\nplot([-max_md -max_md],[0 ymax], 'b--');\nplot([ max_md max_md],[0 ymax], 'b--');\naxis([-1 1 0 ymax]);\ntext(0,5,'MAX DEG');\ntitle('Eigenvalue distributions')\nsubplot(3,1,2)\nhist(eig_mh, xbins); hold on;\nmax_opt = max(abs(eig_mh(1:n-1)));\nplot([-max_opt -max_opt],[0 ymax], 'b--');\nplot([ max_opt max_opt],[0 ymax], 'b--');\naxis([-1 1 0 ymax]);\ntext(0,5,'MH');\nsubplot(3,1,3)\nhist(eig_fmmc, xbins); hold on;\nmax_opt = max(abs(eig_fmmc(1:n-1)));\nplot([-max_opt -max_opt],[0 ymax], 'b--');\nplot([ max_opt max_opt],[0 ymax], 'b--');\naxis([-1 1 0 ymax]);\ntext(0,5,'FMMC');\n\nfigure(5), clf\nv_fmmc = [w_fmmc; diag(eye(n) - A*diag(w_fmmc)*A')];\n[ifmmc, jfmmc, nonzero_fmmc] = find( v_fmmc.*(v_fmmc > 0.001 ) );\nhist(nonzero_fmmc,80);\naxis([0 1 0 10]);\nxlabel('optimal positive FMMC weights');\nylabel('histogram');\n\nfigure(6), clf\nAn = abs(A*diag(w_fmmc)*A');\nAn = (An - diag(diag(An))) > 0.0001;\ngplot(An,xy,'b-'); hold on;\nh = findobj(gca,'Type','line');\nset(h,'LineWidth',2.5)\ngplot(Ad,xy,'b:');\nplot(xy(:,1), xy(:,2), 'ko','LineWidth',4, 'MarkerSize',4);\naxis([0.05 1.1 -0.1 0.95]);\ntitle('Subgraph with positive transition prob.')\nhold off;\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/graph_laplacian/max_deg.m", "content": "function [w,rho] = max_deg(A)\n\n% Computes the maximum-degree heuristic edge weights\n%\n% [W,RHO] = MAX_DEG(A) gives a vector of maximum-degree edge weights for a\n% graph described by the incidence matrix A (NxM). N is the number of\n% nodes, and M is the number of edges. Each column of A has exactly one +1\n% and one -1. RHO is computed from the weights W as follows:\n% RHO = max(abs(eig( eye(n,n) - (1/n)*ones(n,n) - A*W*A' ))).\n%\n% Maximum-degree edge weights are all equal to one over the maximum\n% degree of the nodes in the graph.\n%\n% For more details, see the references:\n% \"Fast linear iterations for distributed averaging\" by L. Xiao and S. Boyd\n% \"Fastest mixing Markov chain on a graph\" by S. Boyd, P. Diaconis, and L. Xiao\n% \"Convex Optimization of Graph Laplacian Eigenvalues\" by S. Boyd\n%\n% Almir Mutapcic 08/29/06\n\n% maximum degree solution\n[n,m] = size(A);\n\n% max degrees of the nodes\nLunw = A*A'; % unweighted Laplacian matrix\ndegs = diag(Lunw);\n\n% max degree weight allocation\nmax_deg = max(degs);\nw = (1/max_deg)*ones(m,1);\n\n% compute the norm\nif nargout > 1,\n rho = norm( eye(n) - A*diag(w)*A' - (1/n)*ones(n) );\nend\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/graph_laplacian/mh.m", "content": "function [w,rho] = mh(A)\n% Computes the Metropolis-Hastings heuristic edge weights\n%\n% [W,RHO] = MH(A) gives a vector of the Metropolis-Hastings edge weights\n% for a graphb described by the incidence matrix A (NxM). N is the number\n% of nodes, and M is the number of edges. Each column of A has exactly one\n% +1 and one -1. RHO is computed from the weights W as follows:\n% RHO = max(abs(eig( eye(n,n) - (1/n)*ones(n,n) - A*W*A' ))).\n%\n% The M.-H. weight on an edge is one over the maximum of the degrees of the\n% adjacent nodes.\n%\n% For more details, see the references:\n% \"Fast linear iterations for distributed averaging\" by L. Xiao and S. Boyd\n% \"Fastest mixing Markov chain on a graph\" by S. Boyd, P. Diaconis, and L. Xiao\n% \"Convex Optimization of Graph Laplacian Eigenvalues\" by S. Boyd\n%\n% Almir Mutapcic 08/29/06\n\n% degrees of the nodes\n[n,m] = size(A);\nLunw = A*A'; % unweighted Laplacian matrix\ndegs = diag(Lunw);\n\n% Metropolis-Hastings weights\nmh_degs = abs(A)'*diag(degs);\nw = 1./max(mh_degs,[],2);\n\n% compute the norm\nif nargout > 1,\n rho = norm( eye(n) - A*diag(w)*A' - (1/n)*ones(n) );\nend\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/graph_laplacian/plotgraph.m", "content": "function plotgraph(A,xy,weights)\n% Plots a graph with each edge width proportional to its weight.\n%\n% Edges with positive weights are drawn in blue; negative weights in red.\n%\n% Input parameters:\n% A --- incidence matrix of the graph (size is n x m)\n% (n is the number of nodes and m is the number of edges)\n% xy --- horizontal and vertical positions of the nodes (n x 2 matrix)\n% weights --- m vector giving edge weights\n%\n% Original by Lin Xiao\n% Modified by Almir Mutapcic\n\n% graph size\n[n,m]= size(A);\n\n% set the graph scale and normalize the coordinates to lay in [-1,1] square\nR = max(max(abs(xy))); % maximum abs value of the xy coordinates\nx = xy(:,1)/R; y = xy(:,2)/R;\n\n% normalize weight vector to range between +1 and -1\nweights = weights/max(abs(weights));\n\n% internal parameters (tune these parameters to make the plot look pretty)\n% (note that the graph coordinates and the weights have been rescaled\n% to a common unity scale)\n%rNode = 0.005; % radius of the node circles\nrNode = 0; % set the node radius to zero if you do not want the nodes\nwNode = 2; % line width of the node circles\nPWColor = [0 0 1]; % color of the edges with positive weights\nNWColor = [1 0 0]; % color of the edges with negative weights\nWmin = 0.0001; % minimum weight value for which we draw an edge\nmax_width = 0.05; % drawn width of edge with maximum absolute weight\n\n% first draw the edges with patch widths proportional to the weights\nfor i=1:m\n if ( abs(weights(i)) > Wmin )\n Isrc = find( sign(weights(i))*A(:,i)>0 );\n Idst = find( sign(weights(i))*A(:,i)<0 );\n else\n Isrc = find( A(:,i)>0 );\n Idst = find( A(:,i)<0 );\n end\n\n % obtain edge patch coordinates\n xdelta = x(Idst) - x(Isrc); ydelta = y(Idst) - y(Isrc);\n RotAgl = atan2( ydelta, xdelta );\n xstart = x(Isrc) + rNode*cos(RotAgl); ystart = y(Isrc) + rNode*sin(RotAgl);\n xend = x(Idst) - rNode*cos(RotAgl); yend = y(Idst) - rNode*sin(RotAgl);\n L = sqrt( xdelta^2 + ydelta^2 ) - 2*rNode;\n\n if ( weights(i) > Wmin )\n W = abs(weights(i))*max_width;\n drawedge(xstart, ystart, RotAgl, L, W, PWColor);\n hold on;\n elseif ( weights(i) < -Wmin )\n W = abs(weights(i))*max_width;\n drawedge(xstart, ystart, RotAgl, L, W, NWColor);\n hold on;\n else\n plot([xstart xend],[ystart yend],'k:','LineWidth',2.5);\n end\nend\n\n% the circle to draw around each node\nangle = linspace(0,2*pi,100);\nxbd = rNode*cos(angle);\nybd = rNode*sin(angle);\n\n% draw the nodes\nfor i=1:n\n plot( x(i)+xbd, y(i)+ybd, 'k', 'LineWidth', wNode );\nend;\naxis equal;\nset(gca,'Visible','off');\nhold off;\n\n%********************************************************************\n% helper function to draw edges in the graph \n%********************************************************************\nfunction drawedge( x0, y0, RotAngle, L, W, color )\nxp = [ 0 L L L L L 0 0 ];\nyp = [-0.5*W -0.5*W -0.5*W 0 0.5*W 0.5*W 0.5*W -0.5*W];\nRotMat = [cos(RotAngle) -sin(RotAngle); sin(RotAngle) cos(RotAngle)];\n\nDrawCoordinates = RotMat*[ xp; yp ];\nxd = x0 + DrawCoordinates(1,:);\nyd = y0 + DrawCoordinates(2,:);\n\n% draw the edge\npatch( xd, yd, color );\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/graph_laplacian/small_example.m", "content": "% FDLA and FMMC solutions for an 8-node, 13-edge graph\n% S. Boyd, et. al., \"Convex Optimization of Graph Laplacian Eigenvalues\"\n% ICM'06 talk examples (www.stanford.edu/~boyd/cvx_opt_graph_lapl_eigs.html)\n% Written for CVX by Almir Mutapcic 08/29/06\n% (figures are generated)\n%\n% In this example we consider a graph described by the incidence matrix A.\n% Each edge has a weight W_i, and we optimize various functions of the\n% edge weights as described in the referenced paper; in particular,\n%\n% - the fastest distributed linear averaging (FDLA) problem (fdla.m)\n% - the fastest mixing Markov chain (FMMC) problem (fmmc.m)\n%\n% Then we compare these solutions to the heuristics listed below:\n%\n% - maximum-degree heuristic (max_deg.m)\n% - constant weights that yield fastest averaging (best_const.m)\n% - Metropolis-Hastings heuristic (mh.m)\n\n% small example (incidence matrix A)\nA = [ 1 0 0 1 0 0 0 0 0 0 0 0 0;\n -1 1 0 0 1 1 0 0 0 0 0 0 1;\n 0 -1 1 0 0 0 0 0 -1 0 0 0 0;\n 0 0 -1 0 0 -1 0 0 0 -1 0 0 0;\n 0 0 0 -1 0 0 -1 1 0 0 0 0 0;\n 0 0 0 0 0 0 1 0 0 0 1 0 0;\n 0 0 0 0 0 0 0 -1 1 0 -1 1 -1;\n 0 0 0 0 -1 0 0 0 0 1 0 -1 0];\n\n% x and y locations of the graph nodes\nxy = [ 1 2 3 3 1 1 2 3 ; ...\n 3 2.5 3 2 2 1 1.5 1 ]';\n\n% Compute edge weights: some optimal, some based on heuristics\n[n,m] = size(A);\n\n[ w_fdla, rho_fdla ] = fdla(A);\n[ w_fmmc, rho_fmmc ] = fmmc(A);\n[ w_md, rho_md ] = max_deg(A);\n[ w_bc, rho_bc ] = best_const(A);\n[ w_mh, rho_mh ] = mh(A);\n\ntau_fdla = 1/log(1/rho_fdla);\ntau_fmmc = 1/log(1/rho_fmmc);\ntau_md = 1/log(1/rho_md);\ntau_bc = 1/log(1/rho_bc);\ntau_mh = 1/log(1/rho_mh);\n\nfprintf(1,'\\nResults:\\n');\nfprintf(1,'FDLA weights:\\t\\t rho = %5.4f \\t tau = %5.4f\\n',rho_fdla,tau_fdla);\nfprintf(1,'FMMC weights:\\t\\t rho = %5.4f \\t tau = %5.4f\\n',rho_fmmc,tau_fmmc);\nfprintf(1,'M-H weights:\\t\\t rho = %5.4f \\t tau = %5.4f\\n',rho_mh,tau_mh);\nfprintf(1,'MAX_DEG weights:\\t rho = %5.4f \\t tau = %5.4f\\n',rho_md,tau_md);\nfprintf(1,'BEST_CONST weights:\\t rho = %5.4f \\t tau = %5.4f\\n',rho_bc,tau_bc);\n\n% Plot results\nfigure(1), clf\nplotgraph(A,xy,w_fdla);\ntext(0.55,1.05,'FDLA optimal weights')\n\nfigure(2), clf\nplotgraph(A,xy,w_fmmc);\ntext(0.55,1.05,'FMMC optimal weights')\n\nfigure(3), clf\nplotgraph(A,xy,w_md);\ntext(0.5,1.05,'Max degree optimal weights')\n\nfigure(4), clf\nplotgraph(A,xy,w_bc);\ntext(0.5,1.05,'Best constant optimal weights')\n\nfigure(5), clf\nplotgraph(A,xy,w_mh);\ntext(0.46,1.05,'Metropolis-Hastings optimal weights')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/log_exp/Contents.m", "content": "% Examples employing logarithms, exponentials, and entropy functions\n%\n% max_entropy.m - Entropy maximization\n% sparse_covariance_est.m - Sparse covariance estimation for Gaussian variables\n% sparse_covariance_est_tradeoff.m - Sparse covariance estimation for Gaussian variables\n% weighted_analytic_center.m - Weighted analytic center of a set of linear inequalities\nhelp Contents\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/log_exp/max_entropy.m", "content": "% Entropy maximization \n% Jolle Skaf - 04/24/08\n%\n% Consider the linear inequality constrained entroy maximization problem \n% maximize -sum_{i=1}^n x_i*log(x_i) \n% subject to sum(x) = 1 \n% Fx <= g\n% where the variable is x \\in \\reals^{n} \n\n% Input data \nrandn('state', 0); \nrand('state', 0); \nn = 20; \nm = 10; \np = 5; \n\ntmp = rand(n,1); \nA = randn(m,n); \nb = A*tmp; \nF = randn(p,n); \ng = F*tmp + rand(p,1); \n\n% Entropy maximization \ncvx_begin\n variable x(n) \n maximize sum(entr(x)) \n A*x == b \n F*x <= g\ncvx_end\n\n% Results \ndisplay('The optimal solution is:' );\ndisp(x); \n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/log_exp/sparse_covariance_est.m", "content": "% Sparse covariance estimation for Gaussian variables\n% Joëlle Skaf - 04/24/08 \n% (a figure is generated) \n%\n% Suppose y \\in\\reals^n is a Gaussian random variable with zero mean and \n% covariance matrix R = \\Expect(yy^T), with sparse inverse S = R^{-1} \n% (S_ij = 0 means that y_i and y_j are conditionally independent).\n% We want to estimate the covariance matrix R based on N independent \n% samples y1,...,yN drawn from the distribution, and using prior knowledge \n% that S is sparse\n% A good heuristic for estimating R is to solve the problem \n% maximize logdet(S) - tr(SY) \n% subject to sum(sum(abs(S))) <= alpha \n% S >= 0\n% where Y is the sample covariance of y1,...,yN, and alpha is a sparsity\n% parameter to be chosen or tuned. \n\n% Input data \nrand('state',0);\nrandn('state',0);\nn = 10; \nN = 100; \nStrue = sprandsym(n,0.5,0.01,1);\nR = inv(full(Strue));\ny_sample = sqrtm(R)*randn(n,N); \nY = cov(y_sample'); \nalpha = 50;\n\n% Computing sparse estimate of R^{-1} \ncvx_begin sdp\n variable S(n,n) symmetric \n maximize log_det(S) - trace(S*Y)\n sum(sum(abs(S))) <= alpha\n S >= 0\ncvx_end\nR_hat = inv(S);\n\nS(find(S<1e-4)) = 0; \nfigure; \nsubplot(121);\nspy(Strue); \ntitle('Inverse of true covariance matrix') \nsubplot(122); \nspy(S)\ntitle('Inverse of estimated covariance matrix')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/log_exp/sparse_covariance_est_tradeoff.m", "content": "% Sparse covariance estimation for Gaussian variables\n% Joëlle Skaf - 04/24/08 \n% (a figure is generated)\n% \n% Suppose y \\in\\reals^n is a Gaussian random variable with zero mean and \n% covariance matrix R = \\Expect(yy^T), with sparse inverse S = R^{-1} \n% (S_ij = 0 means that y_i and y_j are conditionally independent).\n% We want to estimate the covariance matrix R based on N independent \n% samples y1,...,yN drawn from the distribution, and using prior knowledge \n% that S is sparse\n% A good heuristic for estimating R is to solve the problem \n% maximize logdet(S) - tr(SY) - lambda*sum(sum(abs(S)))\n% subject to S >= 0\n% where Y is the sample covariance of y1,...,yN, and lambda is a sparsity\n% parameter to be chosen or tuned. \n% A figure showing the sparsity (number of nonzeros) of S versus lambda \n% is generated.\n\n% Input data \nrandn('state',0);\nn = 10; \nN = 100; \nStrue = sprandsym(n,0.5,0.01,1);\nnnz_true = sum(Strue(:)>1e-4);\nR = inv(full(Strue));\ny_sample = sqrtm(R)*randn(n,N); \nY = cov(y_sample'); \nNlambda = 20;\nlambda = logspace(-2, 3, Nlambda);\nnnz = zeros(1,Nlambda);\n\nfor i=1:Nlambda\n disp(['i = ' num2str(i) ', lambda(i) = ' num2str(lambda(i))]); \n % Maximum likelihood estimate of R^{-1}\n cvx_begin sdp quiet\n variable S(n,n) symmetric\n maximize log_det(S) - trace(S*Y) - lambda(i)*sum(sum(abs(S)))\n S >= 0\n cvx_end\n nnz(i) = sum(S(:)>1e-4);\nend\n\nfigure; \nsemilogx(lambda, nnz); \nhold on; \nsemilogx(lambda, nnz_true*ones(1,Nlambda),'r');\nxlabel('\\lambda');\nlegend('nonzeros in S', 'nonzeros in R^{-1}'); \n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/log_exp/weighted_analytic_center.m", "content": "% Weighted analytic center of a set of linear inequalities\n% Joëlle Skaf - 04/29/08 \n%\n% The weighted analytic center of a set of linear inequalities:\n% a_i^Tx <= b_i i=1,...,m,\n% is the solution of the unconstrained minimization problem \n% minimize -sum_{i=1}^m w_i*log(b_i-a_i^Tx),\n% where w_i>0\n\n% Input data \nrandn('state', 0);\nrand('state', 0);\nn = 10;\nm = 50; \ntmp = randn(n,1);\nA = randn(m,n); \nb = A*tmp + 2*rand(m,1); \nw = rand(m,1); \n\n% Analytic center \ncvx_begin\n variable x(n)\n minimize -sum(w.*log(b-A*x))\ncvx_end\n\ndisp('The weighted analytic center of the set of linear inequalities is: ');\ndisp(x);\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/make.m", "content": "function make( varargin )\r\n\r\n%\r\n% Determine the base path\r\n%\r\n\r\nodir = pwd;\nbase = mfilename('fullpath');\nbase = fileparts( base );\r\n\r\n%\r\n% Check the force and runonly flags\r\n%\r\n\r\nargs = varargin;\r\nis_octave = exist( 'OCTAVE_VERSION', 'builtin' );\r\nif is_octave,\r\n force = true;\r\n runonly = true;\r\n indexonly = false;\n page_output_immediately(true);\nelse\n temp = strcmp( args, '-force' );\r\n force = any( temp );\r\n if force, args(temp) = []; end\r\n temp = strcmp( args, '-runonly' );\r\n runonly = any( temp );\r\n if runonly, args(temp) = []; end\r\n temp = strcmp( args, '-indexonly' );\r\n indexonly = any( temp );\r\n if indexonly, args(temp) = []; end\n if ~runonly,\r\n close all;\n fclose all;\n end\nend\r\nif isempty( args ), \r\n args = { base }; \r\nend\r\n\r\n%\r\n% Process the arguments\r\n%\r\n\r\nfor k = 1 : length( args ),\r\n file = args{k};\r\n if any( file == '*' ),\r\n files = dir( file );\r\n files = { files.name };\r\n else\r\n files = { file };\r\n end\r\n for j = 1 : length( files );\r\n\r\n %\r\n % Check the validity of the file or directory\r\n %\r\n\r\n file = files{j};\r\n switch exist( file, 'file' ),\r\n case 0,\r\n error( 'Cannot find file or directory: %s', file );\r\n case 2,\r\n file = which( file );\r\n if isempty( file ), \r\n file = files{j};\r\n if file(1) ~= filesep,\r\n file = [ base, filesep, file ];\r\n end\r\n end\r\n [ mpath, file, ext ] = fileparts( file );\r\n file = [ file, ext ];\r\n if ~strcmp( ext, '.m' ),\r\n error( 'Must be an m-file: %s' );\r\n elseif strcmp( file, 'Contents.m' ) && length( files ) > 1,\r\n continue;\r\n elseif strcmp( file, 'make.m' ) && strcmp( mpath, base ),\r\n continue;\r\n end\r\n case 7,\r\n cd( file );\r\n mpath = pwd;\r\n cd( odir );\r\n file = '';\r\n otherwise,\r\n error( 'Invalid file: %s', file );\r\n end\r\n if length( mpath ) < length( base ) || strncmpi( mpath, base, length( base ) ) == 0,\r\n error( 'Not a valid a subdirectory of cvx/examples/: %s', mpath );\r\n end\r\n\r\n %\r\n % Process the file or directory\r\n %\r\n\r\n if ~runonly && isempty( file ) && strcmp( mpath, base ),\r\n [ fidr, message ] = fopen( 'index.html', 'r' );\r\n if fidr < 0,\r\n error( 'Cannot open index.html\\n %s', message );\r\n end\r\n [ fidw, message ] = fopen( 'index.html.new', 'w+' );\r\n if fidw < 0,\r\n error( 'Cannot open index.html.new\\n %s', message );\r\n end\r\n while ~feof( fidr ),\r\n temp = fgetl( fidr );\r\n fprintf( fidw, '%s\\n', temp );\r\n if strcmp(temp,'
    '),\r\n while ~feof( fidr ),\r\n temp = fgetl( fidr );\r\n if strcmp(temp,'
'), break; end\r\n end\r\n break;\r\n end\r\n end\r\n else\r\n fidw = -1;\r\n end\r\n if isempty( file ),\r\n generate_directory( mpath, '', force, runonly, indexonly, fidw, base, 0, is_octave );\r\n else\r\n cd( mpath );\r\n generate_file( file, '', force, runonly, indexonly, is_octave );\r\n end\r\n cd( odir );\r\n if fidw >= 0,\r\n fprintf( fidw, '\\n' );\r\n while ~feof( fidr ),\r\n fprintf( fidw, '%s\\n', fgetl( fidr ) );\r\n end\r\n fclose( fidr );\r\n fclose( fidw );\r\n cd( mpath )\r\n compare_and_replace( '', 'index.html' );\r\n end\r\n end\r\nend\r\n\r\nfunction [ title, files ] = generate_directory( mpath, prefix, force, runonly, indexonly, fidc, base, depth, is_octave )\r\n\r\nfprintf( 1, '%sDirectory: %s\\n', prefix, mpath );\r\nprefix = [ prefix, ' ' ];\r\ncd( mpath );\r\nmpath = pwd;\r\n\r\n%\r\n% Open Contents.m file and retrieve title and comments\r\n%\r\n\r\ntitle = '';\r\nif ~runonly,\r\n comments = {};\r\n fcomments = {};\r\n [ fidr, message ] = fopen( 'Contents.m', 'r' );\r\n if fidr >= 0,\r\n temp = fgetl( fidr );\r\n if length( temp ) > 2 && temp( 1 ) == '%' && temp( 2 ) == ' ' && temp( 3 ) ~= ' ',\r\n title = temp( min( find( temp ~= '%' & temp ~= ' ' ) ) : end );\r\n while ~feof( fidr ),\r\n temp = fgetl( fidr );\r\n if isempty(temp) || temp( 1 ) ~= '%' || ~any( temp ~= '%' & temp ~= ' ' ), break; end\r\n temp = temp( min( find( temp ~= '%' & temp ~= ' ' ) ) : end );\r\n if strcmp(title(end-2:end),'...'),\r\n title = [ title(1:end-3), temp ];\r\n else\r\n if ~isempty(fcomments) && strcmp( fcomments{end}(end-2:end),'...' ),\r\n fcomments{end} = [ fcomments{end}(1:end-3), temp ];\r\n else\r\n fcomments{end+1} = temp;\r\n end\r\n comments{end+1} = temp;\r\n end\r\n end\r\n end\r\n fclose( fidr );\r\n elseif ~isempty( dir( 'Contents.m' ) ),\r\n error( 'Cannot open Contents.m for reading\\n %s', message );\r\n end\r\nend\r\nif isempty(title),\r\n title = '(no title)';\r\nend\r\n\r\n%\r\n% Read the entries, and process the scripts and functions\r\n%\r\n\r\ndd = dir;\r\nmlen = 0;\r\nfiles = struct( 'name', {}, 'title', {}, 'type', {} );\r\nfor k = 1 : length( dd ),\r\n name = dd(k).name;\r\n if dd(k).isdir,\r\n if name(1) == '.' || strcmp( name, 'eqs' ) || strcmp( name, 'html' ), continue; end\r\n name(end+1) = '/';\r\n files( end + 1 ) = struct( 'name', name, 'title', '', 'type', 'dir' );\r\n elseif length( name ) > 2,\r\n ndx = max(find(name=='.'));\r\n if isempty( ndx ), continue; end\r\n switch name(ndx+1:end),\r\n case 'm',\r\n if strcmp( name, 'Contents.m' ) || strcmp( name, 'make.m' ) || name(end-2) == '_', continue; end\r\n [ temp, isfunc ] = generate_file( name, prefix, force, runonly, indexonly, is_octave );\r\n if isfunc, type = 'func'; else type = 'script'; end\r\n files( end + 1 ) = struct( 'name', name, 'title', temp, 'type', type );\r\n case 'tex',\r\n temp = generate_doc( name, prefix, force );\r\n files( end + 1 ) = struct( 'name', name, 'title', temp, 'type', 'tex' );\r\n case { 'pdf', 'ps' },\r\n if any( strcmp( { dd.name }, [name(1:ndx+1),'tex'] ) ), continue; end\r\n files( end + 1 ) = struct( 'name', name, 'title', '', 'type', 'doc' );\r\n case { 'dat', 'mat', 'txt' },\r\n if strcmp( name, 'index.dat' ), continue; end\r\n files( end + 1 ) = struct( 'name', name, 'title', '', 'type', 'dat' );\r\n otherwise,\r\n continue;\r\n end\r\n end\r\n mlen = max( mlen, length(name) );\r\nend\r\n\r\n%\r\n% Sort the files\r\n%\r\n\r\nif ~isempty( files ),\r\n [ fnames, ndxs ] = sort( { files.title } );\r\n files = files(ndxs);\r\n ftypes = { files.type };\r\n tdir = strcmp( ftypes, 'dir' );\r\n tfun = strcmp( ftypes, 'func' );\r\n tdoc = strcmp( ftypes, 'doc' ) | strcmp( ftypes, 'tex' );\r\n tdat = strcmp( ftypes, 'dat' );\r\n tscr = ~( tdir | tfun | tdoc | tdat );\r\n t1 = strncmp( fnames, 'Exercise', 8 ) & tscr;\r\n t2 = strncmp( fnames, 'Example', 7 ) & tscr;\r\n t3 = strncmp( fnames, 'Section', 7 ) & tscr;\r\n t4 = strncmp( fnames, 'Figure', 6 ) & tscr;\r\n t5 = ~( t1 | t2 | t3 | t4 ) & tscr;\r\n tdir = find(tdir(:));\r\n tscr = [ find(t3(:)); find(t4(:)); find(t2(:)); find(t5(:)); find(t1(:)); ];\r\n tfun = find(tfun(:));\r\n tdoc = find(tdoc(:));\r\n tdat = find(tdat(:));\r\n files = files( [ tdoc ; tdir ; tscr ; tfun ; tdat ] );\r\n tdoc = [ 1, length(tdoc) ];\r\n tdir = tdoc(end) + [ 1, length(tdir) ];\r\n tscr = tdir(end) + [ 1, length(tscr) ];\r\n tfun = tscr(end) + [ 1, length(tfun) ];\r\n tdat = tfun(end) + [ 1, length(tdat) ];\r\nend\r\n\r\n%\r\n% Fill out the index.jemdoc file\r\n%\r\n\r\nif fidc >= 0,\r\n \r\n dots = sprintf('\\t');\r\n dots = dots(ones(1,depth+1));\r\n dpath = mpath( length(base) + 2 : end );\r\n dpath(dpath=='\\') = '/';\r\n if ~isempty(dpath), dpath(end+1) = '/'; end\r\n \r\n % Directory title---skip for the top level\r\n \r\n if depth,\r\n title = regexprep(title,'','');\r\n title = regexprep(title,' target=\"_blank\"','');\r\n title2 = regexprep(title,']*>)','');\r\n title2 = regexprep(title2,'','');\r\n title2 = regexprep(['',title2,''],'','');\r\n fprintf( fidc, '%s
  • %s
      \\n', dots(1:end-1), title2 );\r\n end\r\n \r\n if tdoc(2) >= tdoc(1) || ~isempty( fcomments ),\r\n for k = tdoc(1) : tdoc(2),\r\n name = files( k ).name;\r\n if strcmp( files(k).type, 'tex' ),\r\n name = [ name(1:end-4), 'pdf' ];\r\n end\r\n temp = files( k ).title;\r\n if isempty( temp ),\r\n fprintf( fidc, '%s
    • Reference: %s
      • \\n', dots, dpath, name, name );\r\n else\r\n fprintf( fidc, '%s
    • Reference: %s (%s)
      • \\n', dots, dpath, name, temp, name );\r\n end\r\n end\r\n for k = 1 : length(fcomments),\r\n fprintf( fidc, '%s
    • Reference: %s
      • \\n', dots, regexprep(fcomments{k},'Miscellaneous examples\\n', dots );\r\n dots(end+1) = dots(end);\r\n fprintf( fidc, '%s\\n', dots );\r\n dots(end) = [];\r\n fprintf( fidc, '%s\\n', dots );\r\n end\r\n end\r\n\r\n if tfun(2) >= tfun(1),\r\n pref = 'Utility: ';\r\n for k = tfun(1) : tfun(2),\r\n name = files( k ).name;\r\n temp = files( k ).title;\r\n if isempty( temp ),\r\n fprintf( fidc, '%s
    • Utility: %s
      • \\n', dots, dpath, name, name );\r\n else\r\n fprintf( fidc, '%s
    • Utility: %s (%s)
      • \\n', dots, dpath, name(1:end-1), temp, dpath, name, name );\r\n end\r\n end\r\n end\r\n \r\n if tdat(2) >= tdat(1),\r\n pref = '- Data: ';\r\n for k = tdat(1) : tdat(2),\r\n name = files( k ).name;\r\n temp = files( k ).title;\r\n if isempty( temp ),\r\n fprintf( fidc, '%s
    • Data: %s
      • \\n', dots, dpath, name, name );\r\n else\r\n fprintf( fidc, '%s
    • Data: %s (%s)
      • \\n', dots, dpath, name, temp, name );\r\n end\r\n end\r\n end\r\n \r\n if depth, \r\n fprintf( fidc, '%s
    • \\n', dots(1:end-1) );\r\n end\r\n \r\nelseif any( tdir ),\r\n \r\n for k = 1 : length( files ),\r\n if strcmp( files(k).type, 'dir' ),\r\n files(k).title = generate_directory( files(k).name(1:end-1), prefix, force, runonly, indexonly, fidc, base, depth+1, is_octave );\r\n cd(mpath);\r\n end\r\n end\r\n\r\nend\r\n \r\n\r\n%\r\n% Create Contents.m.new\r\n%\r\n\r\nif ~runonly,\r\n [ fidw, message ] = fopen( 'Contents.m.new', 'w+' );\r\n if fidw < 0,\r\n if fidr >= 0, fclose( fidr ); end\r\n error( 'Cannot open Contents.m.new\\n %s', message );\r\n elseif ~isempty( title ),\r\n fprintf( fidw, '%% %s\\n', title );\r\n for k = 1 : length( comments ),\r\n fprintf( fidw, '%% %s\\n', comments{k} );\r\n end\r\n fprintf( fidw, '%%\\n' );\r\n end\r\n for k = 1 : length( files ),\r\n tfile = files(k);\r\n tfile.name(end+1:mlen) = ' ';\r\n if isempty( tfile.title ),\r\n fprintf( fidw, '%% %s - (no title)\\n', tfile.name );\r\n else\r\n fprintf( fidw, '%% %s - %s\\n', tfile.name, tfile.title );\r\n end\r\n end\r\n fprintf( fidw, 'help Contents\\n' );\r\n fclose( fidw );\r\nelse\r\n fidw = -1;\r\nend\r\n\r\n%\r\n% Compare Contents.m and Contents.m.new and update if necessary\r\n%\r\n\r\ncd( mpath )\r\nif fidw >= 0,\r\n compare_and_replace( prefix, 'Contents.m' );\r\nend\r\n\r\nfunction [ title, isfunc ] = generate_file( name, prefix, force, runonly, indexonly, is_octave )\r\n\r\nif length( name ) < 2 || ~strcmp( name(end-1:end), '.m' ),\r\n error( 'Not an m-file.' );\r\nelseif strcmp( name, 'Contents.m' ),\r\n error( 'To generate the Contents.m file, you must run this function on the entire directory.' );\r\nelse\r\n fprintf( 1, '%s%s: ', prefix, name );\r\nend\r\n\r\ndd = dir( name );\r\nndate = date_convert( dd.date );\r\n[ fidr, message ] = fopen( name, 'r' );\r\nif fidr < 0,\r\n error( 'Cannot open the source file\\n %s', message );\r\nend\r\ntitle = '';\r\nisfunc = false;\r\nlasttitle = false;\r\nfounddata = false;\r\nprefixes = {};\r\nwhile ~feof( fidr ) && ( ~founddata || isempty( title ) || lasttitle ),\r\n temp1 = fgetl( fidr );\r\n if isempty( temp1 ),\r\n if lasttitle, continue; end\r\n else\r\n temp2 = find( temp1 ~= ' ' );\r\n if isempty( temp2 ),\r\n if lasttitle, continue; end\r\n elseif temp1(temp2(1)) == '%',\r\n temp2 = temp1(temp2(1):temp2(end));\r\n temp3 = find( temp2 ~= '%' );\r\n if isempty( temp3 ),\r\n if lasttitle, continue; end\r\n else\r\n temp3 = temp2( temp3(1) : end );\r\n temp4 = find( temp3 ~= ' ' );\r\n if isempty( temp4 ),\r\n if lasttitle, continue; end\r\n elseif isempty( title ),\r\n title = temp3(temp4(1):temp4(end));\r\n lasttitle = true;\r\n continue;\r\n else\r\n lasttitle = false;\r\n end\r\n end\r\n else\r\n lasttitle = false;\r\n founddata = true;\r\n temp2 = temp1(temp2(1):temp2(end));\r\n if strncmp( temp2, 'function', 8 ) && ( length( temp2 ) == 8 || ~isvarname( temp2( 1 : 9 ) ) ),\r\n isfunc = true;\r\n end\r\n end\r\n end\r\n prefixes{end+1} = temp1;\r\nend\r\nif runonly,\r\n fclose( fidr );\r\n if isfunc, return; end\r\nend\r\nhfile = [ name(1:end-1), 'html' ];\r\nodir = pwd;\r\nhdir = 'html';\r\nhdate = 0;\r\nif exist( hdir, 'dir' ),\r\n cd( hdir );\r\n df = dir( hfile );\r\n if length( df ) == 1,\r\n hdate = date_convert( df.date );\r\n end\r\n cd( odir );\r\nend\r\nif indexonly,\r\n fprintf( 1, 'done.\\n' );\r\nelseif force || hdate <= ndate,\r\n if runonly,\r\n fprintf( 1, 'running %s ...', name );\r\n elseif hdate == 0,\r\n fprintf( 1, 'creating %s ...', hfile );\r\n else\r\n fprintf( 1, 'updating %s ...', hfile );\r\n end\r\n name = name(1:end-2);\r\n if ~runonly,\r\n [ fidw, message ] = fopen( [ name, '_.m' ], 'w+' );\r\n if fidw < 0,\r\n error( 'Cannot open the temporary file\\n %s', message );\r\n end\r\n if isempty( title ),\r\n fprintf( fidw, '%%%% %s\\n\\n', name );\r\n else\r\n fprintf( fidw, '%%%% %s\\n\\n', title );\r\n end\r\n fprintf( fidw, '%s\\n', prefixes{:} );\r\n fwrite( fidw, fread( fidr, Inf, 'uint8' ), 'uint8' );\r\n fclose( fidw );\r\n fclose( fidr );\r\n end\r\n evalin( 'base', 'clear' );\r\n cvx_clear;\r\n cvx_quiet( false );\r\n cvx_precision default;\r\n success = true;\r\n try\r\n out___ = [];\n if is_octave,\n run_clean_octave( name );\r\n elseif runonly,\r\n out___ = run_clean( name );\r\n fprintf( 1, ' done.\\n' );\r\n else\r\n opts.format = 'html';\r\n opts.useNewFigure = false;\r\n opts.createThumbnail = false;\r\n opts.evalCode = ~isfunc;\r\n opts.showCode = true;\r\n opts.catchError = false;\r\n publish( [ name, '_' ], opts );\r\n prefixes = { '', '-->', '

    ', '>', '>' };\r\n suffix = '';\r\n f_in = fopen( [ 'html', filesep, name, '_.html' ], 'r' );\r\n data = fread( f_in, Inf, 'uint8=>char' )';\r\n fclose( f_in );\r\n backpath = '';\r\n for k = 1 : 10,\r\n if exist( [ backpath, filesep, 'examples.css' ], 'file' ), break; end\r\n backpath = [ '..', filesep, backpath ];\r\n end\r\n backpath = [ '..', filesep, backpath ];\r\n canon = [regexprep(pwd,'.*/cvx/examples','http://cvxr.com/cvx/examples'),'/html/',hfile];\r\n data = regexprep( data, '||||

    ', '' );\r\n data = regexprep( data, '', sprintf( '\\n\\n\\n', canon, backpath ) );\r\n data = regexprep( data, '

    (.*?)

    ','
    \\n

    $1

    \\n
    ' );\r\n data = regexprep( data, '
    \\n?', '\\n
    \\n' );\r\n            if ~isempty( regexp( data, '
    ' ) ),\r\n                control_o = 'Text output\\n';\r\n                data = regexprep( data, '
    \\n?', '\\n
    \\n' );\r\n            else\r\n                control_o = 'Text output\\n';\r\n            end\r\n            if ~isempty( regexp( data, '
    \\s*\\s*\\n
    \\n\\s*', '
    ' );\r\n else\r\n control_p = 'Plots\\n';\r\n end\r\n control = sprintf( 'Jump to:    \\nSource code    \\n%s    \\n%s    Library index', control_o, control_p, backpath );\r\n data = regexprep( data, '', control );\r\n data = regexprep( data, '', '\\n' );\r\n data = regexprep( data, '(|||)', '\\n$1' );\r\n data = regexprep( data, '^\\s*','' );\r\n data = regexprep( data, '', '' );\r\n data = regexprep( data, '\\s*((v|h)space=\\S*)', '' );\r\n data = regexprep( data, '\\s*(', '>' );\r\n f_out = fopen( [ 'html', filesep, name, '.html' ], 'w' );\r\n fwrite( f_out, data );\r\n fclose( f_out );\r\n delete( [ 'html', filesep, name, '_.html' ] );\r\n fprintf( 1, ' done.\\n' );\r\n end\r\n catch\r\n err = lasterror;\r\n fprintf( 1, ' aborted.\\n' );\r\n cd( odir );\r\n fprintf( 1, '===> ERROR: %s\\n', err.message );\r\n success = false;\r\n end\r\n if runonly,\r\n disp( out___ );\r\n else\r\n delete( [ name, '_.m' ] );\r\n end\r\n cd( odir );\r\n if ~success && ~runonly && exist( hdir, 'dir' ),\r\n cd( hdir );\r\n df = dir( hfile );\r\n if length( df ) == 1,\r\n delete( hfile );\r\n end\r\n cd( odir );\r\n end\r\n close all\r\nelse\r\n fprintf( 1, 'up to date.\\n' );\r\nend\r\n\r\nfunction title = generate_doc( name, prefix, force )\r\n\r\nif length( name ) < 5 || ~strcmp( name(end-3:end), '.tex' ),\r\n error( 'Not an valid TeX file.' );\r\nelse\r\n fprintf( 1, '%s%s: ', prefix, name );\r\nend\r\n\r\ndd = dir( name );\r\nndate = date_convert( dd.date );\r\n[ fidr, message ] = fopen( name, 'r' );\r\nif fidr < 0,\r\n error( 'Cannot open the source file\\n %s', message );\r\nend\r\ntitle = '';\r\nwhile ~feof( fidr ),\r\n temp = strtrim( fgetl( fidr ) );\r\n kndx = strfind( temp, '\\title{' );\r\n if isempty( kndx ), continue; end\r\n knd2 = strfind( temp(kndx(1):end), '}' );\r\n if isempty( knd2 ), continue; end\r\n title = strtrim(temp(kndx(1)+7:kndx(1)+kndx(2)-2));\r\n break;\r\nend\r\npdffile = [ name(1:end-3), 'pdf' ];\r\nhdate = 0;\r\ndf = dir( pdffile );\r\nif length( df ) == 1,\r\n hdate = date_convert( df.date );\r\nend\r\nif force || hdate < ndate,\r\n if hdate == 0,\r\n fprintf( 1, 'creating %s:', hfile );\r\n else\r\n fprintf( 1, 'updating %s:', hfile );\r\n end\r\n name2 = name(1:end-4);\r\n eval( sprintf( '!latex %s', name2 ) );\r\n eval( sprintf( '!latex %s', name2 ) );\r\n eval( sprintf( '!bibtex %s', name2 ) );\r\n eval( sprintf( '!latex %s', name2 ) );\r\n eval( sprintf( '!latex %s', name2 ) );\r\n eval( sprintf( '!latex %s', name2 ) );\r\n eval( sprintf( '!dvips %s', name2 ) );\r\n eval( sprintf( '!ps2pdf %s.ps', name2 ) );\r\nend\r\n\r\nfunction dnum = date_convert( dstr )\r\npersistent mstrs\r\nif isempty( mstrs ),\r\n mstrs = { 'Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep', 'Oct', 'Nov', 'Dec' };\r\nend\r\n% DD-MMM-YY HH:MM:SS\r\nS = sscanf( dstr, '%d-%3s-%d %d:%d:%d' );\r\nS = [ S(5), find(strcmp(char(S(2:4)'),mstrs)), S(1), S(6), S(7), S(8) ];\r\ndnum = S(6) + 100 * ( S(5) + 100 * ( S(4) + 100 * ( S(3) + 100 * ( S(2) + 100 * S(1) ) ) ) );\r\n\r\nfunction compare_and_replace( prefix, oldname )\r\n\r\nnames = { oldname, [ oldname, '.new' ] };\r\nfprintf( 1, '%s%s ... ', prefix, oldname );\r\nfids = [];\r\nc = {};\r\nfor k = 1 : 2,\r\n [ fids(k), message ] = fopen( names{k}, 'r' );\r\n if fids(k) < 0 && ~isempty( dir( names{k} ) ),\r\n error( 'Cannot open file %s for reading:\\n %s', names{k}, message );\r\n end\r\n c{k} = fread( fids(k), Inf, 'uint8' );\r\n fclose( fids(k) );\r\nend\r\nif isempty( c{2} ),\r\n if fids(k) >= 0,\r\n fprintf( 1, ' removed.\\n' );\r\n delete( oldname );\r\n end\r\n delete( names{2} );\r\nelseif length( c{1} ) ~= length( c{2} ) || any( c{1} ~= c{2} ),\r\n [ success, message ] = movefile( names{2}, names{1}, 'f' );\r\n if ~success,\r\n error( 'Cannot move %s into place\\n %s', names{2}, message );\r\n delete( names{2} )\r\n end\r\n if ~isempty( c{1} ),\r\n fprintf( 1, ' updated.\\n' );\r\n else\r\n fprintf( 1, ' created.\\n' );\r\n end\r\nelse\r\n delete( names{2} )\r\n fprintf( 1, ' up to date.\\n' );\r\nend\n\nfunction run_clean_octave( name )\nfeval( name );\r\n\r\nfunction out___ = run_clean( name )\r\nout___ = evalc( name );\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/min_phase_spectral_fact.m", "content": "% Minimal phase spectral factorization\n%\n% A PSD matrix is found which minimizes a weighted trace while obtaining\n% fixed sums along the diagonals. Notice the use of a FOR loop to access\n% the diagonals of X. A later version of CVX will eliminate the need for\n% this by allowing the use of the SPDIAGS function in side models.\n% Nevertheless, this example provides an illustration of the use of\n% standard Matlab control statements to build models.\n%\n% Adapted from an example provided in the SeDuMi documentation.\n\n% Generate data\nb = [2; 0.2; -0.3];\nn = length( b );\n\n% Create and solve model\ncvx_begin sdp\n variable X( n, n ) symmetric\n dual variable y{n}\n dual variable Z\n minimize( ( n - 1 : -1 : 0 ) * diag( X ) );\n for k = 1 : n,\n sum( diag( X, k - 1 ) ) == b( k ) : y{k};\n end\n X >= 0 : Z;\ncvx_end\ny = [ y{:} ]';\n\n% Display resuls\ndisp( 'The optimal point, X:' );\ndisp( X )\ndisp( 'The diagonal sums:' );\ndisp( sum( spdiags( X, 0:n-1 ), 1 ) );\ndisp( 'min( eig( X ) ) (should be nonnegative):' );\ndisp( min( eig( X ) ) )\ndisp( 'The optimal weighted trace:' );\ndisp( ( n - 1 : -1 : 0 ) * diag( X ) );\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/nonneg_matrix_fact.m", "content": "% Nonnegative matrix factorization\r\n% Argyris Zymnis, Joelle Skaf, Stephen Boyd\r\n%\r\n% We are given a matrix A in R^{m*n}\r\n% and are interested in solving the problem:\r\n%\r\n% minimize ||A - Y*X||_F\r\n% subject to Y >= 0, X >= 0\r\n%\r\n% where Y in R{m*k} and X in R{k*n}.\r\n% This script generates a random matrix A and obtains an\r\n% *approximate* solution to the above problem by first generating\r\n% a random initial guess for Y and the alternatively minimizing\r\n% over X and Y for a fixed number of iterations.\r\n\r\n% Generate data matrix A\r\nrstate = rand('state');\r\nm = 10; n = 10; k = 5;\r\nA = rand(m,k)*rand(k,n);\r\n\r\n% Initialize Y randomly\r\nY = rand(m,k);\r\n\r\n% Perform alternating minimization\r\nMAX_ITERS = 30;\r\nresidual = zeros(1,MAX_ITERS);\r\nfor iter = 1:MAX_ITERS\r\n cvx_begin quiet\r\n if mod(iter,2) == 1\r\n variable X(k,n)\r\n X >= 0; \r\n else\r\n variable Y(m,k)\r\n Y >= 0;\r\n end\r\n minimize(norm(A - Y*X,'fro'));\r\n cvx_end\r\n fprintf(1,'Iteration %d, residual norm %g\\n',iter,cvx_optval);\r\n residual(iter) = cvx_optval;\r\nend\r\n\r\n% Plot residuals\r\nplot(residual); \r\nxlabel('Iteration Number');\r\nylabel('Residual Norm');\r\n\r\n% Display results\r\ndisp( 'Original matrix:' );\r\ndisp( A );\r\ndisp( 'Left factor Y:' );\r\ndisp( Y );\r\ndisp( 'Right factor X:' );\r\ndisp( X );\r\ndisp( 'Residual A - Y * X:' );\r\ndisp( A - Y * X );\r\nfprintf( 'Residual after %d iterations: %g\\n', iter, cvx_optval );\r\n\r\n\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/quickstart.m", "content": "% Examples from the CVX Users' guide\n\nhas_quadprog = exist( 'quadprog' );\nhas_quadprog = has_quadprog == 2 | has_quadprog == 3;\nhas_linprog = exist( 'linprog' );\nhas_linprog = has_linprog == 2 | has_linprog == 3;\nrnstate = randn( 'state' ); randn( 'state', 1 );\ns_quiet = cvx_quiet(true);\ns_pause = cvx_pause(false);\ncvx_clear; echo on\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% SECTION 2.1: LEAST SQUARES %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n% Input data\nm = 16; n = 8;\nA = randn(m,n);\nb = randn(m,1);\n\n% Matlab version\nx_ls = A \\ b;\n\n% cvx version\ncvx_begin\n variable x(n)\n minimize( norm(A*x-b) )\ncvx_end\n\necho off\n\n% Compare\ndisp( sprintf( '\\nResults:\\n--------\\nnorm(A*x_ls-b): %6.4f\\nnorm(A*x-b): %6.4f\\ncvx_optval: %6.4f\\ncvx_status: %s\\n', norm(A*x_ls-b), norm(A*x-b), cvx_optval, cvx_status ) );\ndisp( 'Verify that x_ls == x:' );\ndisp( [ ' x_ls = [ ', sprintf( '%7.4f ', x_ls ), ']' ] );\ndisp( [ ' x = [ ', sprintf( '%7.4f ', x ), ']' ] );\ndisp( 'Residual vector:' );\ndisp( [ ' A*x-b = [ ', sprintf( '%7.4f ', A*x-b ), ']' ] );\ndisp( ' ' );\n\ntry input( 'Press Enter/Return for the next example...' ); clc; catch, end\necho on\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% SECTION 2.2: BOUND-CONSTRAINED LEAST SQUARES %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n% More input data\nbnds = randn(n,2);\nl = min( bnds, [] ,2 );\nu = max( bnds, [], 2 );\n\nif has_quadprog,\n % Quadprog version\n x_qp = quadprog( 2*A'*A, -2*A'*b, [], [], [], [], l, u );\nelse\n % quadprog not present on this system.\nend\n\n% cvx version\ncvx_begin\n variable x(n)\n minimize( norm(A*x-b) )\n subject to\n l <= x <= u\ncvx_end\n\necho off\n\n% Compare\nif has_quadprog,\n disp( sprintf( '\\nResults:\\n--------\\nnorm(A*x_qp-b): %6.4f\\nnorm(A*x-b): %6.4f\\ncvx_optval: %6.4f\\ncvx_status: %s\\n', norm(A*x_qp-b), norm(A*x-b), cvx_optval, cvx_status ) );\n disp( 'Verify that l <= x_qp == x <= u:' );\n disp( [ ' l = [ ', sprintf( '%7.4f ', l ), ']' ] );\n disp( [ ' x_qp = [ ', sprintf( '%7.4f ', x_qp ), ']' ] );\n disp( [ ' x = [ ', sprintf( '%7.4f ', x ), ']' ] );\n disp( [ ' u = [ ', sprintf( '%7.4f ', u ), ']' ] );\nelse\n disp( sprintf( '\\nResults:\\n--------\\nnorm(A*x-b): %6.4f\\ncvx_optval: %6.4f\\ncvx_status: %s\\n', norm(A*x-b), cvx_optval, cvx_status ) );\n disp( 'Verify that l <= x <= u:' );\n disp( [ ' l = [ ', sprintf( '%7.4f ', l ), ']' ] );\n disp( [ ' x = [ ', sprintf( '%7.4f ', x ), ']' ] );\n disp( [ ' u = [ ', sprintf( '%7.4f ', u ), ']' ] );\nend\ndisp( 'Residual vector:' );\ndisp( [ ' A*x-b = [ ', sprintf( '%7.4f ', A*x-b ), ']' ] );\ndisp( ' ' );\n\ntry input( 'Press Enter/Return for the next example...' ); clc; catch, end\necho on\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% SECTION 2.3: OTHER NORMS AND FUNCTIONS: INFINITY NORM %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nif has_linprog,\n % linprog version\n f = [ zeros(n,1); 1 ];\n Ane = [ +A, -ones(m,1) ; ...\n -A, -ones(m,1) ];\n bne = [ +b; -b ];\n xt = linprog(f,Ane,bne);\n x_lp = xt(1:n,:);\nelse\n % linprog not present on this system.\nend\n\n% cvx version\ncvx_begin\n variable x(n)\n minimize( norm(A*x-b,Inf) )\ncvx_end\n\necho off\n\n% Compare\nif has_linprog,\n disp( sprintf( '\\nResults:\\n--------\\nnorm(A*x_lp-b,Inf): %6.4f\\nnorm(A*x-b,Inf): %6.4f\\ncvx_optval: %6.4f\\ncvx_status: %s\\n', norm(A*x_lp-b,Inf), norm(A*x-b,Inf), cvx_optval, cvx_status ) );\n disp( 'Verify that x_lp == x:' );\n disp( [ ' x_lp = [ ', sprintf( '%7.4f ', x_lp ), ']' ] );\n disp( [ ' x = [ ', sprintf( '%7.4f ', x ), ']' ] );\nelse\n disp( sprintf( '\\nResults:\\n--------\\nnorm(A*x-b,Inf): %6.4f\\ncvx_optval: %6.4f\\ncvx_status: %s\\n', norm(A*x-b,Inf), cvx_optval, cvx_status ) );\n disp( 'Optimal vector:' );\n disp( [ ' x = [ ', sprintf( '%7.4f ', x ), ']' ] );\nend\ndisp( sprintf( 'Residual vector; verify that the peaks match the objective (%6.4f):', cvx_optval ) );\ndisp( [ ' A*x-b = [ ', sprintf( '%7.4f ', A*x-b ), ']' ] );\ndisp( ' ' );\n\ntry input( 'Press Enter/Return for the next example...' ); clc; catch, end\necho on\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% SECTION 2.3: OTHER NORMS AND FUNCTIONS: ONE NORM %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nif has_linprog,\n % Matlab version\n f = [ zeros(n,1); ones(m,1); ones(m,1) ];\n Aeq = [ A, -eye(m), +eye(m) ];\n lb = [ -Inf*ones(n,1); zeros(m,1); zeros(m,1) ];\n xzz = linprog(f,[],[], Aeq,b,lb,[]);\n x_lp = xzz(1:n,:) - xzz(n+1:2*n,:);\nelse\n % linprog not present on this system\nend\n\n% cvx version\ncvx_begin\n variable x(n)\n minimize( norm(A*x-b,1) )\ncvx_end\n\necho off\n\n% Compare\nif has_linprog,\n disp( sprintf( '\\nResults:\\n--------\\nnorm(A*x_lp-b,1): %6.4f\\nnorm(A*x-b,1): %6.4f\\ncvx_optval: %6.4f\\ncvx_status: %s\\n', norm(A*x_lp-b,1), norm(A*x-b,1), cvx_optval, cvx_status ) );\n disp( 'Verify that x_lp == x:' );\n disp( [ ' x_lp = [ ', sprintf( '%7.4f ', x_lp ), ']' ] );\n disp( [ ' x = [ ', sprintf( '%7.4f ', x ), ']' ] );\nelse\n disp( sprintf( '\\nResults:\\n--------\\nnorm(A*x-b,1): %6.4f\\ncvx_optval: %6.4f\\ncvx_status: %s\\n', norm(A*x-b,1), cvx_optval, cvx_status ) );\n disp( 'Optimal vector:' );\n disp( [ ' x = [ ', sprintf( '%7.4f ', x ), ']' ] );\nend\ndisp( 'Residual vector; verify the presence of several zero residuals:' );\ndisp( [ ' A*x-b = [ ', sprintf( '%7.4f ', A*x-b ), ']' ] );\ndisp( ' ' );\n\ntry input( 'Press Enter/Return for the next example...' ); clc; catch, end\necho on\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% SECTION 2.3: OTHER NORMS AND FUNCTIONS: LARGEST-K NORM %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n% cvx specification\nk = 5;\ncvx_begin\n variable x(n)\n minimize( norm_largest(A*x-b,k) )\ncvx_end\n\necho off\n\n% Compare\ntemp = sort(abs(A*x-b));\ndisp( sprintf( '\\nResults:\\n--------\\nnorm_largest(A*x-b,k): %6.4f\\ncvx_optval: %6.4f\\ncvx_status: %s\\n', norm_largest(A*x-b,k), cvx_optval, cvx_status ) );\ndisp( 'Optimal vector:' );\ndisp( [ ' x = [ ', sprintf( '%7.4f ', x ), ']' ] );\ndisp( sprintf( 'Residual vector; verify a tie for %d-th place (%7.4f):', k, temp(end-k+1) ) );\ndisp( [ ' A*x-b = [ ', sprintf( '%7.4f ', A*x-b ), ']' ] );\ndisp( ' ' );\n\ntry input( 'Press Enter/Return for the next example...' ); clc; catch, end\necho on\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% SECTION 2.3: OTHER NORMS AND FUNCTIONS: HUBER PENALTY %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n% cvx specification\ncvx_begin\n variable x(n)\n minimize( sum(huber(A*x-b)) )\ncvx_end\n\necho off\n\n% Compare\ndisp( sprintf( '\\nResults:\\n--------\\nsum(huber(A*x-b)): %6.4f\\ncvx_optval: %6.4f\\ncvx_status: %s\\n', sum(huber(A*x-b)), cvx_optval, cvx_status ) );\ndisp( 'Optimal vector:' );\ndisp( [ ' x = [ ', sprintf( '%7.4f ', x ), ']' ] );\ndisp( 'Residual vector:' );\ndisp( [ ' A*x-b = [ ', sprintf( '%7.4f ', A*x-b ), ']' ] );\ndisp( ' ' );\n\ntry input( 'Press Enter/Return for the next example...' ); clc; catch, end\necho on\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% SECTION 2.4: OTHER CONSTRAINTS %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n% More input data\np = 4;\nC = randn(p,n);\nd = randn(p,1);\n\n% cvx specification\ncvx_begin\n variable x(n);\n minimize( norm(A*x-b) )\n subject to\n C*x == d\n norm(x,Inf) <= 1\ncvx_end\n\necho off\n\n% Compare\ndisp( sprintf( '\\nResults:\\n--------\\nnorm(A*x-b): %6.4f\\ncvx_optval: %6.4f\\ncvx_status: %s\\n', norm(A*x-b), cvx_optval, cvx_status ) );\ndisp( 'Optimal vector:' );\ndisp( [ ' x = [ ', sprintf( '%7.4f ', x ), ']' ] );\ndisp( 'Residual vector:' );\ndisp( [ ' A*x-b = [ ', sprintf( '%7.4f ', A*x-b ), ']' ] );\ndisp( 'Equality constraints:' );\ndisp( [ ' C*x = [ ', sprintf( '%7.4f ', C*x ), ']' ] );\ndisp( [ ' d = [ ', sprintf( '%7.4f ', d ), ']' ] );\n\ntry input( 'Press Enter/Return for the next example...' ); clc; catch, end\necho on\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% SECTION 2.5: AN OPTIMAL TRADEOFF CURVE %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n% The basic problem:\n% cvx_begin\n% variable x(n)\n% minimize( norm(A*x-b)+gamma(k)*norm(x,1) )\n% cvx_end\n\necho off\ndisp( ' ' );\ndisp( 'Generating tradeoff curve...' );\ncvx_pause(false);\ngamma = logspace( -2, 2, 20 );\nl2norm = zeros(size(gamma));\nl1norm = zeros(size(gamma));\nfprintf( 1, ' gamma norm(x,1) norm(A*x-b)\\n' );\nfprintf( 1, '---------------------------------------\\n' );\nfor k = 1:length(gamma),\n fprintf( 1, '%8.4e', gamma(k) );\n cvx_begin\n variable x(n)\n minimize( norm(A*x-b)+gamma(k)*norm(x,1) )\n cvx_end\n l1norm(k) = norm(x,1);\n l2norm(k) = norm(A*x-b);\n fprintf( 1, ' %8.4e %8.4e\\n', l1norm(k), l2norm(k) );\nend\nplot( l1norm, l2norm );\nxlabel( 'norm(x,1)' );\nylabel( 'norm(A*x-b)' );\ngrid\ndisp( 'Done. (Check out the graph!)' );\nrandn( 'state', rnstate );\ncvx_quiet(s_quiet);\ncvx_pause(s_pause);\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/regularized_norm_tradeoff.m", "content": "% Builds a norm minimization tradeoff curve\n%\n% This script solves a family of problems of the form\n% minimize || A*x-b ||_1 + gamma * || x ||_Inf\n% for varying values of gamma. For gamma = 0, this is simply an\n% unconstrained norm minimization; for gamma = Inf, x = 0 and\n% || A x - b || = || b || are optimal. Varying gamma allows us\n% to genreate a tradeoff curve between these extremes.\n\nn = 10;\nA = randn(2*n,n);\nb = randn(2*n,1);\ngamma = logspace( -1, 3 );\nnrms = zeros( size( gamma ) );\nxnrms = zeros( size( gamma ) );\nfprintf( 1, 'Gamma: ' );\nfor k = 1 : length( gamma ),\n if k > 1 && rem( k, 10 ) == 1, fprintf( 1, '\\n ' ); end\n fprintf( 1, '%g ', gamma( k ) );\n cvx_begin quiet\n variable x(n)\n minimize( norm( A * x - b, 1 ) + gamma( k ) * norm( x, Inf ) )\n cvx_end\n nrms( k ) = norm( A * x - b, 1 );\n xnrms( k ) = norm( x, Inf );\nend\nfprintf( 1, 'done.\\n' );\nfigure\nsemilogx( gamma, nrms );\nxlabel( '\\gamma' );\nylabel( '|| A * x - b ||_1' );\nfigure\nplot( xnrms, nrms );\nxlabel( '|| x ||_{\\infty}' );\nylabel( '|| A * x - b ||_1' );\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/simple_LP.m", "content": "% Builds and solves a simple linear program\n\necho on\n\nn = 100;\nA = randn(0.5*n,n);\nb = randn(0.5*n,1);\nc = randn(n,1);\nd = randn;\ncvx_begin\n variable x(n)\n dual variables y z\n minimize( c' * x + d )\n subject to\n y : A * x == b;\n z : x >= 0;\ncvx_end\n\necho off\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/simple_LP2.m", "content": "% Builds and solves a simple inequality-constrained linear program\n\necho on\n\nn = 10;\nA = randn(2*n,n);\nb = randn(2*n,1);\nc = randn(n,1);\nd = randn;\ncvx_begin\n variable x(n)\n dual variables y z\n minimize( c' * x + d )\n subject to\n y : A * x <= b;\ncvx_end\n\necho off\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/simple_LS.m", "content": "% Builds and solves a simple least-squares problem using cvx\n\necho on\n\nn = 100;\nA = randn(2*n,n);\nb = randn(2*n,1);\ncvx_begin\n variable x(n)\n minimize( norm( A*x-b ) )\ncvx_end\n\necho off\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/sparse_heuristics/Contents.m", "content": "% Sparse solution heuristics\n%\n% sparse_solution.m - Computing a sparse solution of a set of linear inequalities\n% sparse_infeas_dual.m - Detecting a small subset of infeasible linear inequalities\n% sparse_infeas.m - Finding a point that satisfies many linear inequalities\nhelp Contents\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/sparse_heuristics/sparse_infeas.m", "content": "% Finding a point that satisfies many linear inequalities\n% Section 11.4.1, Boyd & Vandenberghe \"Convex Optimization\"\n% Written for CVX by Almir Mutapcic - 02/18/06\n%\n% We consider a set of linear inequalities A*x <= b which are\n% infeasible. Here A is a matrix in R^(m-by-n) and b belongs\n% to R^m. We apply a heuristic to find a point x that violates\n% only a small number of inequalities.\n%\n% We use the sum of infeasibilities heuristic:\n%\n% minimize sum( max( Ax - b ) )\n%\n% which is equivalent to the following LP (book pg. 580):\n%\n% minimize sum( s )\n% s.t. Ax <= b + s\n% s >= 0\n%\n% with variables x in R^n and s in R^m.\n\n% problem dimensions (m inequalities in n-dimensional space)\nm = 150;\nn = 10;\n\n% fix random number generator so we can repeat the experiment\nseed = 0;\nrandn('state',seed);\n\n% construct infeasible inequalities\nA = randn(m,n);\nb = randn(m,1);\n\nfprintf(1, ['Starting with an infeasible set of %d inequalities ' ...\n 'in %d variables.\\n'],m,n);\n\n% sum of infeasibilities heuristic\ncvx_begin\n variable x(n)\n minimize( sum( max( A*x - b, 0 ) ) )\ncvx_end\n\n% full LP version of the sum of infeasibilities heuristic\n% cvx_begin\n% variables x(n) s(m)\n% minimize( sum( s ) )\n% subject to\n% A*x <= b + s;\n% s >= 0;\n% cvx_end\n\n% number of satisfied inequalities\nnv = length( find( A*x > b ) );\nfprintf(1,'\\nFound an x that violates %d out of %d inequalities.\\n',nv,m);\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/sparse_heuristics/sparse_infeas_dual.m", "content": "% Detecting a small subset of infeasible linear inequalities\n% Section 5.8, Boyd & Vandenberghe \"Convex Optimization\"\n% Written for CVX by Almir Mutapcic - 02/18/06\n%\n% We consider a set of linear inequalities A*x <= b which are\n% infeasible. Here A is a matrix in R^(m-by-n) and b belongs\n% to R^m. We apply a l1-norm heuristic to find a small subset\n% of mutually infeasible inequalities from a larger set of\n% infeasible inequalities. The heuristic finds a sparse solution\n% to the alternative inequality system.\n%\n% Original system is A*x <= b and it alternative ineq. system is:\n%\n% lambda >= 0, A'*lambda == 0. b'*lambda < 0\n%\n% where lambda in R^m. We apply the l1-norm heuristic:\n%\n% minimize sum( lambda )\n% s.t. A'*lambda == 0\n% b'*lambda == -1\n% lambda >= 0\n%\n% Positive lambdas gives us a small subset of inequalities from\n% the original set which are mutually inconsistent.\n\n% problem dimensions (m inequalities in n-dimensional space)\nm = 150;\nn = 10;\n\n% fix random number generator so we can repeat the experiment\nseed = 0;\nrandn('state',seed);\n\n% construct infeasible inequalities\nA = randn(m,n);\nb = randn(m,1);\n\nfprintf(1, ['Starting with an infeasible set of %d inequalities ' ...\n 'in %d variables.\\n'],m,n);\n\n% you can verify that the set is infeasible\n% cvx_begin\n% variable x(n)\n% A*x <= b;\n% cvx_end\n\n% solve the l1-norm heuristic problem applied to the alternative system\ncvx_begin\n variables lambda(m)\n minimize( sum( lambda ) )\n subject to\n A'*lambda == 0;\n b'*lambda == -1; \n lambda >= 0;\ncvx_end\n\n% report the smaller set of mutually inconsistent inequalities\ninfeas_set = find( abs(b.*lambda) > sqrt(eps)/n );\ndisp(' ');\nfprintf(1,'Found a smaller set of %d mutually inconsistent inequalities.\\n',...\n length(infeas_set));\ndisp(' ');\ndisp('A smaller set of mutually inconsistent inequalities are the ones');\ndisp('with row indices:'), infeas_set'\n\n% check that this set is infeasible\n% cvx_begin\n% variable x_infeas(n)\n% A(infeas_set,:)*x_infeas <= b(infeas_set);\n% cvx_end\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/sparse_heuristics/sparse_solution.m", "content": "% Computing a sparse solution of a set of linear inequalities\n% Section 6.2, Boyd & Vandenberghe \"Convex Optimization\"\n% \"Just relax: Convex programming methods for subset selection\n% and sparse approximation\" by J. A. Tropp\n% Written for CVX by Almir Mutapcic - 02/28/06\n%\n% We consider a set of linear inequalities A*x <= b which are\n% feasible. We apply two heuristics to find a sparse point x that\n% satisfies these inequalities.\n%\n% The (standard) l1-norm heuristic for finding a sparse solution is:\n%\n% minimize ||x||_1\n% s.t. Ax <= b\n%\n% The log-based heuristic is an iterative method for finding\n% a sparse solution, by finding a local optimal point for the problem:\n%\n% minimize sum(log( delta + |x_i| ))\n% s.t. Ax <= b\n%\n% where delta is a small threshold value (determines what is close to zero).\n% We cannot solve this problem since it is a minimization of a concave\n% function and thus it is not a convex problem. However, we can apply\n% a heuristic in which we linearize the objective, solve, and re-iterate.\n% This becomes a weighted l1-norm heuristic:\n%\n% minimize sum( W_i * |x_i| )\n% s.t. Ax <= b\n%\n% which in each iteration re-adjusts the weights W_i based on the rule:\n%\n% W_i = 1/(delta + |x_i|), where delta is a small threshold value\n%\n% This algorithm is described in papers:\n% \"An Affine Scaling Methodology for Best Basis Selection\"\n% by B. D. Rao and K. Kreutz-Delgado\n% \"Portfolio optimization with linear and ?xed transaction costs\"\n% by M. S. Lobo, M. Fazel, and S. Boyd\n\n% fix random number generator so we can repeat the experiment\nseed = 0;\nrandn('state',seed);\nrand('state',seed);\n\n% the threshold value below which we consider an element to be zero\ndelta = 1e-8;\n\n% problem dimensions (m inequalities in n-dimensional space)\nm = 100;\nn = 50;\n\n% construct a feasible set of inequalities\n% (this system is feasible for the x0 point)\nA = randn(m,n);\nx0 = randn(n,1);\nb = A*x0 + rand(m,1); \n\n% l1-norm heuristic for finding a sparse solution\nfprintf(1, 'Finding a sparse feasible point using l1-norm heuristic ...')\ncvx_begin\n variable x_l1(n)\n minimize( norm( x_l1, 1 ) )\n subject to\n A*x_l1 <= b;\ncvx_end\n\n% number of nonzero elements in the solution (its cardinality or diversity)\nnnz = length(find( abs(x_l1) > delta ));\nfprintf(1,['\\nFound a feasible x in R^%d that has %d nonzeros ' ...\n 'using the l1-norm heuristic.\\n'],n,nnz);\n\n% iterative log heuristic\nNUM_RUNS = 15;\nnnzs = [];\nW = ones(n,1); % initial weights\n\ndisp([char(10) 'Log-based heuristic:']);\nfor k = 1:NUM_RUNS\n cvx_begin quiet\n variable x_log(n)\n minimize( sum( W.*abs(x_log) ) )\n subject to\n A*x_log <= b;\n cvx_end\n\n % display new number of nonzeros in the solution vector\n nnz = length(find( abs(x_log) > delta ));\n nnzs = [nnzs nnz];\n fprintf(1,' found a solution with %d nonzeros...\\n', nnz);\n\n % adjust the weights and re-iterate\n W = 1./(delta + abs(x_log));\nend\n\n% number of nonzero elements in the solution (its cardinality or diversity)\nnnz = length(find( abs(x_log) > delta ));\nfprintf(1,['\\nFound a feasible x in R^%d that has %d nonzeros ' ...\n 'using the log heuristic.\\n'],n,nnz);\n\n% plot number of nonzeros versus iteration\nplot(1:NUM_RUNS, nnzs, [1 NUM_RUNS],[nnzs(1) nnzs(1)],'--');\naxis([1 NUM_RUNS 0 n])\nxlabel('iteration'), ylabel('number of nonzeros (cardinality)');\nlegend('log heuristic','l1-norm heuristic','Location','SouthEast')\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/time_series_analysis/Contents.m", "content": "% Example from l1 Trend Filtering\n%\n% l1_trend_filter_snp500.m - l1 trend filtering\n% snp500.txt - (no title)\nhelp Contents\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/examples/time_series_analysis/l1_trend_filter_snp500.m", "content": "% l1 trend filtering\n% Written for CVX by Kwangmoo Koh - 12/10/07\n%\n% The problem of estimating underlying trends in time series data arises in\n% a variety of disciplines. The l1 trend filtering method produces trend \n% estimates x that are piecewise linear from the time series y.\n%\n% The l1 trend estimation problem can be formulated as\n%\n% minimize (1/2)*||y-x||^2+lambda*||Dx||_1,\n%\n% with variable x , and problem data y and lambda, with lambda >0.\n% D is the second difference matrix, with rows [0... -1 2 -1 ...0]\n%\n% CVX is not optimized for the l1 trend filtering problem.\n% For large problems, use l1_tf (www.stanford.edu/~boyd/l1_tf/).\n\n% load time series data\ny = csvread('snp500.txt'); % log price of snp500\nn = length(y);\n\n% form second difference matrix\ne = ones(n,1);\nD = spdiags([e -2*e e], 0:2, n-2, n);\n\n% set regularization parameter\nlambda = 50;\n\n% solve l1 trend filtering problem\ncvx_begin\n variable x(n)\n minimize( 0.5*sum_square(y-x)+lambda*norm(D*x,1) )\ncvx_end\n\n% plot estimated trend with original signal\nfigure(1);\nplot(1:n,y,'k:','LineWidth',1.0); hold on;\nplot(1:n,x,'b-','LineWidth',2.0); hold off;\nxlabel('date'); ylabel('log price');\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/avg_abs_dev.m", "content": "function y = avg_abs_dev( x, dim )\n\n%AVG_ABS_DEV Internal cvx version.\n\nif ~cvx_isaffine( x ),\n error( 'Disciplined convex programming error:\\n ABS_AVG_DEV is convex and nonmonotonic in X, so X must be affine.', 1 ); %#ok\nend\n\ntry\n\tif nargin < 2, dim = []; end\n\t[ x, sx, sy, zx, zy, nx, nv, perm ] = cvx_reduce_size( x, dim ); %#ok\ncatch exc\n\terror( exc.message );\nend\n\nif nx > 1 && nv > 0,\n % In theory we could just say y = mean(abs(x-mean(x))). However, by\n % adding an extra variable we preserve sparsity.\n cvx_begin\n variable y( 1, nv );\n y == sum( x ) / nx; %#ok\n minimize( sum( abs( x - ones(nx,1) * y ) ) / nx );\n cvx_end\n y = cvx_optval;\nelseif nx == 0,\n\ty = NaN( sy );\nelse\n\ty = zeros( sy );\nend\n\n%\n% Reverse the reshaping and permutation steps\n%\n\ny = reshape( y, sy );\nif ~isempty( perm ),\n y = ipermute( y, perm );\nend\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/avg_abs_dev_med.m", "content": "function y = avg_abs_dev_med( x, dim )\n\n%AVG_ABS_DEV_MED Internal cvx version.\n\nif ~cvx_isaffine( x ),\n error( 'Disciplined convex programming error:\\n ABS_AVG_DEV_MED is convex and nonmonotonic in X, so X must be affine.', 1 ); %#ok\nend\n\ntry\n\tif nargin < 2, dim = []; end\n\t[ x, sx, sy, zx, zy, nx, nv, perm ] = cvx_reduce_size( x, dim ); %#ok\ncatch exc\n\terror( exc.message );\nend\n\nif nx > 1 && nv > 0,\n cvx_begin\n variable y( 1, nv );\n minimize( sum( abs( x - ones(nx,1) * y ) ) / nx ); %#ok\n cvx_end\n y = cvx_optval;\nelseif nx == 0,\n\ty = NaN( sy );\nelse\n\ty = zeros( sy );\nend\n\n%\n% Reverse the reshaping and permutation steps\n%\n\ny = reshape( y, sy );\nif ~isempty( perm ),\n y = ipermute( y, perm );\nend\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/berhu.m", "content": "function cvx_optval = berhu( x, M, t ) %#ok\n\n%BERHU Internal cvx version.\n\n%\n% Check arguments\n%\n\nnarginchk(1,3);\nif ~cvx_isaffine( x ),\n error( 'Disciplined convex programming error:\\n HUBER is nonmonotonic in X, so X must be affine.', 1 ); %#ok\nend\nif nargin < 2,\n M = 1;\nelseif isa( M, 'cvx' ),\n error( 'Second argument must be numeric.' );\nelseif ~isreal( M ) || any( M( : ) <= 0 ),\n error( 'Second argument must be real and positive.' );\nend\nif nargin < 3,\n t = 1;\nelseif ~isreal( t ),\n error( 'Third argument must be real.' );\nelseif cvx_isconstant( t ) && nnz( cvx_constant( t ) <= 0 ),\n error( 'Third argument must be real and positive.' );\nelseif ~cvx_isconcave( t ),\n error( 'Disciplined convex programming error:\\n HUBER is convex and nonincreasing in T, so T must be concave.', 1 ); %#ok\nend\nsz = cvx_size_check( x, M, t );\nif isempty( sz ),\n error( 'Sizes are incompatible.' );\nend\n\n%\n% Compute result\n%\n\nv = []; w = [];\ncvx_begin separable\n variables v( sz ) w( sz )\n minimize( quad_over_lin( w, t, 0 ) ./ (2*M) + v + w )\n abs( x ) <= w + v; %#ok\n v <= M * t; %#ok\n w >= 0; %#ok\ncvx_end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/cvx_recip.m", "content": "function y = cvx_recip( x )\r\n\r\n%RECIP Internal cvx version.\r\n\r\n%\r\n% Determine the expression types\r\n%\r\n\r\nnarginchk(1,1);\r\npersistent remap\r\nif isempty( remap ),\r\n remap_1 = cvx_remap( 'constant' ) & ~cvx_remap( 'zero' );\r\n remap_2 = cvx_remap( 'log-valid' ) & ~remap_1;\r\n remap = remap_1 + 2 * remap_2;\r\nend\r\nvr = remap( cvx_classify( x ) );\r\nvu = sort( vr(:) );\r\nvu = vu([true;diff(vu)~=0]);\r\nnv = length( vu );\r\n\r\n%\r\n% Process each result type one at a time\r\n%\r\n\r\nif nv ~= 1,\r\n y = cvx( x.size_, [] );\r\nend\r\nfor k = 1 : nv,\r\n\r\n %\r\n % Select the category of expression to compute\r\n %\r\n\r\n if nv == 1,\r\n xt = x;\r\n else\r\n t = vr == vu( k );\r\n xt = cvx_subsref( x, t );\r\n end\r\n\r\n %\r\n % Perform the computations\r\n %\r\n\r\n switch vu( k ),\r\n case 0,\r\n % Invalid\r\n error( 'Disciplined convex programming error:\\n Cannot perform the operation recip( {%s} )', cvx_class( x, false, false, true ) );\r\n case 1,\r\n % Non-zero constant\r\n yt = cvx( 1.0 ./ cvx_constant( xt ) );\r\n case 2,\r\n % Monomial, posynomial\r\n yt = exp( -log( xt ) );\r\n otherwise,\r\n error( 'Shouldn''t be here.' );\r\n end\r\n\r\n %\r\n % Store the results\r\n %\r\n\r\n if nv == 1,\r\n y = yt;\r\n else\r\n y = cvx_subsasgn( y, t, yt );\r\n end\r\n\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/det_inv.m", "content": "function cvx_optval = det_inv( X, p )\n\n%DET_INV Internal cvx version.\n\nnarginchk(1,2);\nn = size( X, 1 );\nif ndims( X ) > 2, %#ok\n error( 'N-D arrays are not supported.' );\nelseif size( X, 2 ) ~= n,\n error( 'Matrix must be square.' );\nelseif nargin < 2,\n p = 1;\nelseif ~isnumeric( p ) || ~isreal( p ) || numel( p ) ~= 1 || p <= 0,\n error( 'Second argument must be a positive scalar.' );\nend\n\nw = [ ones(n,1) ; p ];\nif cvx_isconstant( X ),\n \n cvx_optval = cvx( det_inv( cvx_constant( X ), p ) );\n\nelseif nnz( X ) <= n && nnz( diag( X ) ) == nnz( X ),\n \n y = [];\n cvx_begin\n epigraph variable y\n geo_mean( [ diag(X) ; y ], w ) >= 1; %#ok\n cvx_end\n\nelseif isreal( X ),\n\n\ty = []; Z = [];\n cvx_begin\n epigraph variable y\n variable Z(n,n) lower_triangular\n D = diag( Z );\n [ diag( D ), Z' ; Z, X ] == semidefinite(2*n); %#ok\n geo_mean( [ D ; y ], [], w ) >= 1; %#ok\n cvx_end\n\nelse\n\n\ty = []; Z = [];\n cvx_begin\n epigraph variable y\n variable Z(n,n) lower_triangular complex\n D = diag( Z );\n [ diag( D ), Z' ; Z, X ] == hermitian_semidefinite(2*n); %#ok\n geo_mean( [ real( D ) ; y ], [], w ) >= 1; %#ok\n cvx_end\n\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/det_rootn.m", "content": "function cvx_optval = det_rootn( X )\r\n\r\n%DET_ROOTN Internal cvx version.\r\n\r\nnarginchk(1,1);\r\nn = size( X, 1 );\r\nif ndims( X ) > 2, %#ok\r\n\r\n error( 'N-D arrays are not supported.' );\r\n\r\nelseif size( X, 2 ) ~= n,\r\n\r\n error( 'Matrix must be square.' );\r\n\r\nelseif nnz( X ) <= n && nnz( diag( X ) ) == nnz( X ),\r\n\r\n cvx_optval = geo_mean( diag( X ) );\r\n\r\nelseif cvx_isconstant( X ),\r\n\r\n cvx_optval = cvx( det_rootn( cvx_constant( X ) ) );\r\n\r\nelseif isreal( X ),\r\n\r\n\tZ = [];\r\n cvx_begin\r\n variable Z(n,n) lower_triangular\r\n D = diag( Z );\r\n maximize( geo_mean( D ) );\r\n subject to\r\n [ diag( D ), Z' ; Z, X ] == semidefinite(2*n); %#ok\r\n cvx_end\r\n\r\nelse\r\n\r\n\tZ = [];\r\n cvx_begin\r\n variable Z(n,n) lower_triangular complex\r\n D = diag( Z );\r\n maximize( geo_mean( real( D ) ) );\r\n subject to\r\n [ diag( D ), Z' ; Z, X ] == hermitian_semidefinite(2*n); %#ok\r\n cvx_end\r\n\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/functions.m", "content": "% CVX: Additional functions added by CVX.\n%\n% These functions have been provided to expand the variety of constraints\n% and objectives that can be specified in CVX models. But in fact, they \n% can be used with numeric arguments *outside* of CVX as well. The help \n% text for each of these functions contains general information about the\n% computations it performs, as well as specific information about its\n% proper use in CVX models, as dictated by its convexity/concavity and\n% monotonicity properties.\n%\n% Those functions marked with a (*), as well as the exponential and \n% logarithm functions, are supported using a \"successive approximation\"\n% approach: that is, the solver is called multiple times to refine the \n% solution to the required accuracy. Thus models using these functions\n% should be expected to run more slowly than models of comparable size\n% that do not. See the CVX user guide for details.\n%\n% A number of Matlab's built-in functions have been extended to provide\n% CVX support; for example,\n% abs, exp(*), log (*), max, min, norm, prod, sqrt\n% For a full list, type \"help cvx/builtins\".\n%\n% berhu - Reverse Huber penalty function.\n% det_inv - Determinant of the inverse of an SPD matrix.\n% det_root2n - 2nth-root of the determinant of an SPD matrix.\n% det_rootn - nth-root of the determinant of an SPD matrix.\n% entr - Scalar entropy. (*)\n% geo_mean - Geometric mean. (*)\n% huber - Huber penalty function.\n% huber_circ - Circularly symmetric version of the Huber penalty.\n% huber_pos - Monotonic Huber-style function.\n% inv_pos - Reciprocal of a positive quantity.\n% kl_div - Scalar Kullback-Leibler distance. (*)\n% lambda_max - Maximum eigenvalue of a symmetric matrix.\n% lambda_min - Minimum eigenvalue of a symmetric matrix.\n% log_det - Logarithm of the determinant. (*)\n% log_normcdf - Logarithm of the normal CDF. (approximation)\n% log_sum_exp - log(sum(exp(x))). (*)\n% logsumexp_sdp - SDP-based approximation of log(sum(exp(x))).\n% matrix_frac - Matrix fractional function.\n% norm_largest - Sum of the k largest magnitudes of a vector.\n% norm_nuc - Nuclear norm of a matrix.\n% norms - Computation of multiple vector norms.\n% norms_largest - Computation of multiple norm_largest() norms.\n% poly_env - Convex or concave envelope of a polynomial.\n% polyval_trig - Evaluate a trigonometric polynomial.\n% pos - Positive part.\n% pow_p - Nonnegative branches of the power function.\n% pow_pos - Convex/concave branches of the power function.\n% pow_abs - Absolute value raised to a fixed power.\n% quad_form - Quadratic form.\n% quad_over_lin - Sum of squares over linear.\n% quad_pos_over_lin - Sum of squares of positives over linear.\n% rel_entr - Scalar relative entropy. (*)\n% sigma_max - Maximum singular value.\n% square - Square.\n% square_abs - Square of absolute value.\n% square_pos - Square of positive part.\n% sum_largest - Sum of the largest k values of a vector.\n% sum_smallest - Sum of the smallest k elements of a vector.\n% sum_square - Sum of squares.\n% sum_square_abs - sum of squares of absolute values.\n% sum_square_pos - Sum of squares of positive parts.\n% trace_inv - Trace of the inverse of a PSD matrix.\n% trace_sqrtm - Trace of the square root of a PSD matrix.\n% vec - Vectorize.\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/geo_mean.m", "content": "function y = geo_mean( x, dim, w )\nnarginchk(1,3);\n\n%GEO_MEAN Internal cvx version.\n\n%\n% Size check\n%\n\ntry\n if nargin < 2, dim = []; end\n [ x, sx, sy, zx, zy, nx, nv, perm ] = cvx_reduce_size( x, dim ); %#ok\ncatch exc\n rethrow( exc )\nend\n \n%\n% Third argument check\n%\n\nif nargin < 3 || isempty( w ),\n w = [];\nelseif numel( w ) ~= length( w ) || ~isnumeric( w ) || ~isreal( w ) || any( w < 0 ) || any( w ~= floor( w ) ),\n error( 'Third argument must be a vector of nonnegative integers.' );\nelseif length( w ) ~= nx,\n error( 'Third argument must be a vector of length %d', nx );\nend\n\n%\n% Quick exit for simple cases\n%\n\nif isempty( x ) || ~isempty( w ) && ~any( w ),\n y = ones( zy );\n return\nend\n\n%\n% Type check\n%\n\npersistent remap_1 remap_2 remap_3 remap_4\nif isempty( remap_4 ),\n % Constant (postive or negative)\n remap_1 = cvx_remap( 'real' );\n remap_2 = cvx_remap( 'concave' );\n remap_3 = cvx_remap( 'log-convex' );\n remap_4 = cvx_remap( 'log-concave' );\nend\nvx = cvx_reshape( cvx_classify( x ), sx );\nt1 = all( reshape( remap_1( vx ), sx ) );\nt2 = all( reshape( remap_2( vx ), sx ) );\nt3 = all( reshape( remap_3( vx ), sx ) ) | ...\n all( reshape( remap_4( vx ), sx ) );\n% Valid combinations with zero or negative entries can be treated as constants\nt1 = t1 | ( ( t2 | t3 ) & any( vx == 1 | vx == 9 ) );\nta = t1 + ( 2 * t2 + 3 * t3 ) .* ~t1;\nnu = sort( ta(:) );\nnu = nu([true;diff(nu)~=0]);\nnk = length( nu );\n\n%\n% Perform the computations\n%\n\nif nk > 1,\n y = cvx( [ 1, nv ], [] );\nend\nfor k = 1 : nk,\n\n if nk == 1,\n xt = x;\n else\n tt = ta == nu( k );\n xt = cvx_subsref( x, ':', tt );\n end\n\n switch nu( k ),\n case 0,\n error( 'Disciplined convex programming error:\\n Invalid computation: geo_mean( {%s} )', cvx_class( xt, true, true ) );\n case 1,\n yt = cvx( geo_mean( cvx_constant( xt ), 1, w ) );\n case 2,\n \tyt = [];\n cvx_begin\n hypograph variable yt(1,nv);\n { cvx_accept_concave(xt), yt } == geo_mean_cone( size(xt), 1, w, 'func' ); %#ok\n cvx_end\n case 3,\n if nx == 1,\n yt = xt;\n elseif isempty( w ),\n yt = exp( sum( log( xt ), 1 ) * ( 1 / nx ) );\n else\n yt = exp( ( w / sum( w ) ) * log( xt ) );\n end\n otherwise,\n error( 'Shouldn''t be here.' );\n end\n\n if nk == 1,\n y = yt;\n else\n y = cvx_subsasgn( y, tt, yt );\n end\n\nend\n\n%\n% Reverse the reshaping and permutation steps\n%\n\ny = reshape( y, sy );\nif ~isempty( perm ),\n y = ipermute( y, perm );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/huber_pos.m", "content": "function cvx_optval = huber_pos( x, M, t ) %#ok\n\n%HUBER Internal cvx version.\n\n%\n% Check arguments\n%\n\nnarginchk(1,3);\nif ~cvx_isconvex( x ),\n error( 'Disciplined convex programming error:\\n HUBER_POS is convex and nondecreasing in X, so X must be convex.', 1 ); %#ok\nend\nif nargin < 2,\n M = 1;\nelseif isa( M, 'cvx' ),\n error( 'Second argument must be numeric.' );\nelseif ~isreal( M ) || any( M( : ) <= 0 ),\n error( 'Second argument must be real and positive.' );\nend\nif nargin < 3,\n t = 1;\nelseif ~isreal( t ),\n error( 'Third argument must be real.' );\nelseif cvx_isconstant( t ) && nnz( cvx_constant( t ) <= 0 ),\n error( 'Third argument must be real and positive.' );\nelseif ~cvx_isconcave( t ),\n error( 'Disciplined convex programming error:\\n HUBER_POS is convex and nonincreasing in T, so T must be concave.', 1 ); %#ok\nend\nsz = cvx_size_check( x, M, t );\nif isempty( sz ),\n error( 'Sizes are incompatible.' );\nend\n\n%\n% Compute result\n%\n\nv = []; w = [];\ncvx_begin separable\n variables v( sz ) w( sz )\n minimize( quad_over_lin( w, t, 0 ) + 2 .* M .* v )\n x <= w + v; %#ok\n w <= M * t; %#ok\n v >= 0; %#ok\ncvx_end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/inv_pos.m", "content": "function y = inv_pos( x )\n\n%INV_POS Internal cvx version.\n\ny = pow_cvx( x, -1, 'pow_p' );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/lambda_max.m", "content": "function cvx_optval = lambda_max( x )\n\n%LAMBDA_MAX Internal cvx version.\n\nnarginchk(1,1);\nif ndims( x ) > 2 || size( x, 1 ) ~= size( x, 2 ), %#ok\n\n error( 'Input must be a square matrix.' );\n\nelseif cvx_isconstant( x ),\n\n cvx_optval = cvx( lambda_max( cvx_constant( x ) ) );\n\nelseif cvx_isaffine( x ),\n\n\tz = [];\n n = size( x, 1 );\n cvx_begin\n epigraph variable z\n z * eye( n ) - x == semidefinite( n, ~isreal( x ) ); %#ok\n cvx_end\n\nelse\n\n error( 'Discipliend convex programming error:\\n LAMBDA_MAX is convex and nonmonotonic, so its input must be affine.' );\n\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/lambda_sum_largest.m", "content": "function cvx_optval = lambda_sum_largest( x, k )\n\n%LAMBDA_SUM_LARGEST Internal cvx version.\n\nnarginchk(2,2);\nn = size( x, 1 );\nif ndims( x ) > 2 || n ~= size( x, 2 ), %#ok\n\n error( 'First input must be a square matrix.' );\n \nelseif ~isnumeric( k ) || numel( k ) ~= 1 || ~isreal( k ),\n \n error( 'Second input must be a constant real scalar.' );\n\nelseif cvx_isconstant( x ),\n\n cvx_optval = cvx( lambda_max( cvx_constant( x ), k ) );\n \nelseif ~cvx_isaffine( x ),\n\n error( 'Discipliend convex programming error:\\n LAMBDA_SUM_LARGEST is convex and nonmonotonic, so its input must be affine.' );\n \nelseif k <= 0,\n \n cvx_optval = 0;\n \nelseif k >= size( x, 1 ),\n \n cvx_optval = trace( x );\n \nelse\n \n S = [];\n cvx_begin\n variable S(n,n) symmetric\n S == semidefinite(n); %#ok\n minimize( k * lambda_max( x - S ) + trace( S ) );\n cvx_end\n\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/log_normcdf.m", "content": "function y = log_normcdf( x )\n\n%LOG_NORMCDF Internal CVX version.\n\nnarginchk(1,1);\nif ~isreal( x ),\n error( 'Argument must be real.' );\nend\n\npersistent a b nb ob\nif isempty( a ),\n a =sqrt( [ 0.018102332171520\n 0.011338501342044\n 0.072727608432177\n 0.184816581789135\n 0.189354610912339\n 0.023660365352785 ] );\n a = sparse(diag(a));\n b = [3 2.5 2 1 -1 -2]';\n nb = length(b);\n ob = ones(nb,1);\nend\n\ncx = cvx_isconstant( x );\nsx = size(x);\nnx = prod(sx);\ny = a * ( b * ones(1,nx) - ob * reshape( x, 1, nx ) );\nif cx,\n y = cvx( sum( cvx_constant( max( y, 0 ) ) .^ 2 ) );\nelse\n y = sum_square_pos( y );\nend\ny = - reshape( y, sx );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/log_sum_exp.m", "content": "function y = log_sum_exp( x, dim )\r\n\r\n%LOG_SUM_EXP CVX internal version.\r\n\r\nnarginchk(1,2);\r\ncvx_expert_check( 'log_sum_exp', x );\r\n\r\nsx = size( x );\r\nif nargin < 2 || isempty( dim ),\r\n dim = cvx_default_dimension( sx );\r\nelseif ~cvx_check_dimension( dim, true ),\r\n error( 'Second argument must be a valid dimension.' );\r\nend\r\n\r\n%\r\n% Quick exits\r\n%\r\n\r\nsx( end + 1 : dim ) = 1;\r\nnx = sx( dim );\r\nsy = sx;\r\nsy( dim ) = 1;\r\nif nx == 0,\r\n sx( dim ) = 1; %#ok\r\n y = -Inf * ones( sy );\r\n return\r\nelseif nx == 1,\r\n y = x;\r\n return;\r\nelseif any( sx == 0 ),\r\n y = zeros( sy );\r\n return\r\nend\r\n\r\n%\r\n% Determine the expression types\r\n%\r\n\r\npersistent remap\r\nif isempty( remap ),\r\n remap_2 = cvx_remap( 'real' );\r\n remap_1 = cvx_remap( 'convex' ) & ~remap_2;\r\n remap = remap_1 + 2 * remap_2;\r\nend\r\nv = reshape( remap( cvx_classify( x ) ), sx );\r\nv = min( v, [], dim );\r\n\r\n%\r\n% Process each type of expression one piece at a time\r\n%\r\n\r\nvu = sort( v(:) );\r\nvu = vu([true;diff(vu)~=0]);\r\nnv = length( vu );\r\nif nv > 1,\r\n y = cvx( sy, [] );\r\n if prod(sx(1:dim+1))>1 && prod(sx(dim+1:end))>1,\r\n perm = [ dim, 1:dim-1, dim+1:length(sx) ];\r\n x = permute( x, perm );\r\n v = permute( v, perm );\r\n y = permute( y, perm );\r\n dim = 1;\r\n end\r\nend\r\nfor k = 1 : nv,\r\n\r\n %\r\n % Select the category of expression to compute\r\n %\r\n\r\n vk = vu( k );\r\n if nv == 1,\r\n xt = x;\r\n sz = sy; %#ok\r\n else\r\n t = v == vk;\r\n xt = cvx_subsref( x, cvx_expand_dim( t, dim, nx ) );\r\n sx = size( xt );\r\n sz = sx;\r\n sz( dim ) = 1; %#ok\r\n end\r\n\r\n %\r\n % Perform the computations\r\n %\r\n\r\n switch vk,\r\n case 0,\r\n % Invalid\r\n error( 'Disciplined convex programming error:\\n Illegal operation: log_sum_exp( {%s} ).', cvx_class( xt ) );\r\n case 1,\r\n % Affine, convex\r\n w = []; z = [];\r\n cvx_begin\r\n variable w( sx )\r\n epigraph variable z( sz )\r\n { cvx_accept_convex( x ) - cvx_expand_dim( z, dim, nx ), 1, w } == exponential( sx ); %#ok\r\n sum( w, dim ) == 1; %#ok\r\n cvx_end\r\n case 2,\r\n % Constant\r\n cvx_optval = cvx( log_sum_exp( cvx_constant( xt ) ) );\r\n otherwise,\r\n error( 'Shouldn''t be here.' );\r\n end\r\n\r\n %\r\n % Store the results\r\n %\r\n\r\n if nv == 1,\r\n y = cvx_optval;\r\n else\r\n y = cvx_subsasgn( y, t, cvx_optval );\r\n end\r\n\r\nend\r\n\r\n% Reshape again, just in case\r\ny = reshape( y, sy );\r\n\r\n% Copyright 2005-2016 CVX Research, Inc. \r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/matrix_frac.m", "content": "function cvx_optval = matrix_frac( x,Y )\n\n%MATRIX_FRAC Internal cvx version.\n\nnarginchk(2,2);\nif ndims( Y ) > 2 || size( Y, 1 ) ~= size( Y, 2 ), %#ok\n\n error( 'Second argument must be a square matrix.' );\n\nelseif ndims( x ) > 2 || size( x, 2 ) > 1, %#ok\n\n error( 'First argument must be a column vector.' );\n\nelseif size( x, 1 ) ~= size( Y, 1 ),\n\n error( 'Size of first argument (vector) must match size of second argument (matrix).' );\n\nelseif cvx_isconstant( x ) && cvx_isconstant( Y ),\n\n cvx_optval = cvx( matrix_frac( cvx_constant( x ), cvx_constant(Y) ) );\n\nelseif cvx_isaffine( x ) && cvx_isaffine( Y ),\n\n n = size( x, 1 );\n z = [];\n cvx_begin\n epigraph variable z\n [Y x; x' z] == semidefinite( n+1 ); %#ok\n cvx_end\n\nelse\n\n error( 'Disciplined convex programming error:\\n MATRIX_FRAC is convex and nonmonotonic, so its input must be affine.' );\n\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/norm_nuc.m", "content": "function cvx_optval = norm_nuc( X ) %#ok\n\n%NORM_NUC Internal cvx version.\n\nnarginchk(1,1);\nif ndims( X ) > 2, %#ok\n error( 'norm_nuc is not defined for N-D arrays.' );\nelseif ~cvx_isaffine( X ),\n error( 'Input must be affine.' );\nend\n\n%\n% Construct problem\n% \n\n[ m, n ] = size( X ); %#ok\nW1 = []; W2 = [];\ncvx_begin sdp\n if isreal(X)\n \tvariable W1(m,m) symmetric\n \tvariable W2(n,n) symmetric\n else\n \tvariable W1(m,m) hermitian\n \tvariable W2(n,n) hermitian\n end\n minimize(0.5*(trace(W1)+trace(W2)));\n [W1,X;X',W2] >= 0; %#ok\ncvx_end\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/norms.m", "content": "function y = norms( x, p, dim )\n\n%NORMS Internal cvx version.\n\n%\n% Size check\n%\n\nnarginchk(1,3);\ntry\n if nargin < 3, dim = []; end\n [ x, sx, sy, zx, zy, nx, nv, perm ] = cvx_reduce_size( x, dim ); %#ok\ncatch exc\n error( exc.message );\nend\n \n%\n% Check second argument\n%\n\nif nargin < 2 || isempty( p ),\n p = 2;\nelseif ~isnumeric( p ) || numel( p ) ~= 1 || ~isreal( p ),\n error( 'Second argument must be a real number.' );\nelseif p < 1 || isnan( p ),\n error( 'Second argument must be between 1 and +Inf, inclusive.' );\nend\n\n%\n% Quick exit for empty matrices\n%\n\nif isempty( x ),\n y = zeros( zy );\n return\nend\n\n%\n% Type check\n%\n\npersistent remap1 remap2\nif isempty( remap2 ),\n remap1 = cvx_remap( 'constant', 'log-convex' );\n remap2 = cvx_remap( 'affine', 'log-convex' );\nend\nxc = reshape( cvx_classify( x ), sx );\nif ~all( remap2( xc( : ) ) ),\n error( 'Disciplined convex programming error:\\n Invalid computation: norms( {%s}, ... )', cvx_class( x, true, true ) );\nend\n\n%\n% Compute norms\n%\n\nif nx == 1,\n\tp = 0;\nend\nswitch p,\n\tcase 0,\n\t\ty = abs( x );\n case 1,\n y = sum( abs(x) );\n case Inf, \n y = max( abs(x) );\n otherwise,\n tt = all( remap1( xc ) );\n if all( tt( : ) ),\n y = sum( abs(x) .^ p ) .^ (1/p);\n elseif any( tt( : ) ),\n y = cvx( [ 1, nv ], [] );\n xt = cvx_subsref( x, ':', tt );\n y = cvx_subsasgn( y, tt, norms( xt, p ) );\n tt = ~tt;\n xt = cvx_subsref( x, ':', tt );\n y = cvx_subsasgn( y, tt, norms( xt, p ) );\n elseif p == 2,\n \ty = [];\n cvx_begin\n epigraph variable y( 1, nv )\n { cvx_accept_convex(x), y } == lorentz( [ nx, nv ], 1, ~isreal( x ) ); %#ok\n cvx_end\n\t\telse\n\t\t\tz = []; y = [];\n cvx_begin\n variable z( nx, nv )\n epigraph variable y( 1, nv )\n if isreal(x), cmode = 'abs'; else cmode = 'cabs'; end\n { cat( 3, z, y( ones(nx,1), : ) ), cvx_accept_convex(x) } ...\n == geo_mean_cone( sw, 3, [1/p,1-1/p], cmode ); %#ok\n sum( z ) == y; %#ok\n cvx_end\n end\nend\n\n%\n% Reverse the reshaping and permutation steps\n%\n\ny = reshape( y, sy );\nif ~isempty( perm ),\n y = ipermute( y, perm );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/pow_abs.m", "content": "function y = pow_abs( x, p )\n\n%POW_ABS Internal cvx version.\n\nnarginchk(2,2);\nif ~cvx_isconstant( p ),\n error( 'Second argument must be constant.' );\nelseif ~isreal( p ),\n error( 'Second argument must be real.' );\nelseif any( cvx_constant( p(:) ) < 1 ),\n error( 'Second argument must be greater than or equal to one.' );\nend\ny = pow_cvx( x, p, 'pow_abs' );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/pow_cvx.m", "content": "function y = pow_cvx( x, p, mode )\n\n%POW_CVX Internal cvx version.\n\n%\n% Expression type matrices\n%\n\npersistent remap_pos remap_p remap_abs remap_pwr remap_uniq\nif isempty( remap_uniq ),\n remap_x1 = cvx_remap( 'real' );\n remap_x1c = cvx_remap( 'complex' );\n remap_x2 = cvx_remap( 'log-valid' ) & ~remap_x1;\n remap_x3 = cvx_remap( 'real-affine' ) & ~remap_x1;\n remap_x3c = cvx_remap( 'complex-affine' ) & ~remap_x1c;\n remap_x4 = cvx_remap( 'concave' ) & ~( remap_x1 | remap_x3 );\n remap_x5 = cvx_remap( 'convex' ) & ~( remap_x1 | remap_x2 | remap_x3 );\n remap_x6 = cvx_remap( 'valid' ) & ~( remap_x1 | remap_x2 | remap_x3 | remap_x4 );\n remap_p = [1;1;1; 1; 1; 1; 1] * remap_x1 + ...\n [2;2;2; 2; 2; 2; 2] * remap_x2 + ...\n [3;5;6; 8;11;11;11] * remap_x3 + ...\n [3;5;6; 8; 0; 0; 0] * remap_x4; \n remap_pos = [0;0;0; 1; 1; 1; 1] * remap_x1 + ...\n [0;0;0; 2; 2; 2; 2] * remap_x2 + ...\n [0;0;0; 9;11;11;11] * remap_x3 + ...\n [0;0;0; 9; 0; 0; 0] * remap_x4 + ...\n [0;0;0; 0;11;11;11] * remap_x5;\n remap_abs = [0;0;0; 1; 1; 1; 1] * ( remap_x1 | remap_x1c ) + ...\n [0;0;0; 2; 2; 2; 2] * remap_x2 + ...\n [0;0;0;10;12;12;12] * remap_x3 + ...\n [0;0;0;10;13;13;13] * remap_x3c;\n remap_pwr = [1;1;1; 1; 1; 1; 1] * remap_x1 + ...\n [2;2;2; 2; 2; 2; 2] * remap_x2 + ...\n [0;4;6; 7;11; 0;12] * remap_x3 + ...\n [0;4;6; 7; 0; 0; 0] * remap_x4 + ...\n [0;0;0; 7; 0; 0; 0] * remap_x6;\n remap_uniq = logical( [0,0,0,1,0,1,0,0,0,0,1,1,1] );\nend\n\n%\n% Argument check\n%\n\nnarginchk(3,3);\np = cvx_constant( p );\nif nnz( isinf( p ) | isnan( p ) ),\n error( 'Second argument must be Inf or NaN.' );\nend\nif ~ischar( mode ) || size( mode, 1 ) ~= 1,\n error( 'Third argument must be a string.' );\nend\nswitch mode,\n case 'power',\n cmode = 'pos';\n remap = remap_pwr;\n case 'pow_p',\n cmode = 'pos';\n remap = remap_p;\n case 'pow_pos',\n cmode = 'hypo';\n remap = remap_pos;\n case 'pow_abs',\n cmode = 'abs';\n remap = remap_abs;\n otherwise\n error( [ 'Invalid power mode: ', mode ] );\nend\n\n%\n% Check sizes\n%\n\nsx = size( x ); xs = all( sx == 1 );\nsp = size( p ); ps = all( sp == 1 );\nif xs,\n sy = sp;\nelseif ps || isequal( sx, sp ),\n sy = sx;\nelse\n error( 'Matrix dimensions must agree.' );\nend\n\n%\n% Determine the expression types\n%\n\nv = 1 + ( p >= 0 ) + ( p > 0 ) + ( p >= 1 ) + ( p > 1 ) .* ( 1 + ( rem( p, 1 ) == 0 ) + ( rem( p, 2 ) == 0 ) );\nv = remap( v(:)' + size(remap,1) * ( cvx_classify( x ) - 1 ) );\nif ~ps,\n t = remap_uniq( v + 1 );\n if any( t ),\n [ pk, pi, pj ] = unique( p( t ) ); %#ok\n vt = v( t );\n v( t ) = vt + ( reshape( pj, size(vt) ) - 1 ) / length( pk );\n end\nend\n \n%\n% Process each type of expression one piece at a times\n%\n\nxt = x;\npt = p;\nvu = sort( v(:) );\nvu = vu([true;diff(vu)~=0]);\nnv = length( vu );\nif nv ~= 1,\n if cvx_isconstant( x ),\n y = zeros( sy );\n else\n y = cvx( sy, [] );\n end\nend\nfor k = 1 : nv,\n \n %\n % Select the category of expression to compute\n %\n \n vk = vu( k );\n if nv ~= 1,\n t = v == vk;\n if ~xs, xt = cvx_subsref( x, t ); end\n if ~ps, pt = cvx_subsref( p, t ); end\n end\n sz = size(xt);\n nd = length(sz)+1;\n sw = sz;\n sw(nd) = 2;\n \n %\n % Perform the computations\n %\n \n vk = floor(vk);\n switch vk,\n case 0,\n % Invalid\n pt = sprintf( '%g,', unique(pt) );\n pt = [ '{', pt(1:end-1), '}' ];\n if isequal( mode, 'power' ),\n error( 'Disciplined convex programming error:\\n Illegal operation: {%s} .^ %s\\n (Consider POW_P, POW_POS, or POW_ABS instead.)', cvx_class( xt, true, true ), pt ); \n else\n error( 'Disciplined convex programming error:\\n Illegal operation: %s( {%s}, %s )', mode, cvx_class( xt, true, true ), pt ); \n end\n case 1,\n % Constant result\n yt = cvx( feval( mode, cvx_constant( xt ), pt ) );\n case 2,\n % Log-convex/affine/concave\n yt = exp( log( xt ) .* pt );\n case 3,\n % power( concave, p < 0 )\n % pow_p( concave, p < 0 )\n yt = [];\n cvx_begin\n epigraph variable yt(sz)\n { cat( nd, cvx_accept_concave(xt), yt ), 1 } == geo_mean_cone( sw, nd, [-pt,1], 'func' ); %#ok\n cvx_end\n case 4,\n % power( valid, 0 )\n yt = ones(sz);\n case 5,\n % pow_p( concave, 0 )\n yt = ones(sz);\n cvx_begin\n xt >= 0; %#ok\n cvx_end\n case 6,\n % pow_p( concave, 0 < p < 1 )\n yt = [];\n cvx_begin\n hypograph variable yt(sz)\n { cat( nd, cvx_accept_concave(xt), ones(sz) ), yt } == geo_mean_cone( sw, nd, [pt,1-pt], 'func' ); %#ok\n cvx_end\n case 7,\n % power( valid, 1 )\n yt = xt;\n case 8,\n % pow_p( concave, 1 )\n yt = xt;\n cvx_begin\n xt >= 0; %#ok\n cvx_end\n case 9,\n % pow_pos( affine, 1 )\n yt = max( xt, 0 );\n case 10,\n % pow_abs( affine, 1 )\n yt = abs( xt );\n case 11,\n % power( affine, p > 1, p noninteger )\n % pow_p( affine, p > 1 )\n % pow_pos( convex, p > 1 )\n yt = [];\n cvx_begin\n epigraph variable yt(sz)\n { cat( nd, yt, ones(sz) ), cvx_accept_convex(xt) } == geo_mean_cone( sw, nd, [1/pt,1-1/pt], cmode ); %#ok\n cvx_end\n case 12,\n % pow_abs( affine, p > 1 )\n % power( affine, p even )\n yt = [];\n cvx_begin\n epigraph variable yt(sz)\n { cat( nd, yt, ones(sz) ), cvx_accept_convex(xt) } == geo_mean_cone( sw, nd, [1/pt,1-1/pt], 'abs' ); %#ok \n cvx_end\n case 13,\n % pow_abs( complex affine, p > 1 )\n yt = [];\n cvx_begin\n epigraph variable yt(sz)\n { cat( nd, yt, ones(sz) ), xt } == geo_mean_cone( sw, nd, [1/pt,1-1/pt], 'cabs' ); %#ok\n cvx_end\n end\n \n %\n % Store the results\n %\n \n if nv ~= 1,\n y = cvx_subsasgn( y, t, yt );\n elseif isequal(sz,sy),\n y = yt;\n else\n y = yt * ones(sy);\n end\n \nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/pow_p.m", "content": "function y = pow_p( x, p )\n\n%POW_P Internal cvx version.\n\nnarginchk(2,2);\ny = pow_cvx( x, p, 'pow_p' );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/pow_pos.m", "content": "function y = pow_pos( x, p )\n\n%POW_POS Internal cvx version.\n\nnarginchk(2,2);\nif ~cvx_isconstant( p ),\n error( 'Second argument must be constant.' );\nelseif ~isreal( p ),\n error( 'Second argument must be real.' );\nend\np = cvx_constant( p );\nif nnz( p < 1 ),\n error( 'Second argument must be greater than or equal to 1.\\n(Use POW_P for exponents less than 1.)', 1 ); %#ok\nend\ny = pow_cvx( x, p, 'pow_pos' );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/prod_inv.m", "content": "function cvx_optval = prod_inv( x, dim, p )\n\n%DET_INV Internal cvx version.\n\nnarginchk(1,3);\nif ~isreal( x ), \n error( 'First argument must be real.' ); \nend\nsx = size( x );\nif nargin < 2 || isempty( dim ),\n dim = cvx_default_dimension( sx );\nelseif ~cvx_check_dimension( dim ),\n error( 'Second argument must be a positive integer.' );\nend\nsx( end + 1 : dim ) = 1;\nif nargin < 2,\n p = 1;\nelseif ~isnumeric( p ) || ~isreal( p ) || numel( p ) ~= 1 || p <= 0,\n error( 'Third argument must be a positive scalar.' );\nend\n\nif cvx_isconstant( x ),\n \n cvx_optval = cvx( prod_inv( cvx_constant( x ), dim, p ) );\n\nelseif sx( dim ) == 1,\n \n cvx_optval = inv_pos( x );\n \nelse\n\n sy = sx;\n sy( dim ) = 1;\n y = [];\n cvx_begin\n epigraph variable y( sy )\n geo_mean( cat( dim, x, y ), dim, [ ones(n,1) ; p ] ) >= 1; %#ok\n cvx_end\n\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/quad_form.m", "content": "function [ cvx_optval, success ] = quad_form( x, Q, v, w )\n\n%QUAD_FORM Internal cvx version.\n\n%\n% Check sizes and types\n%\n\nnarginchk(2,4);\ntol = 16 * eps;\ntolLDL = 4 * eps;\nif nargin < 4,\n w = 0;\n if nargin < 3,\n v = 0;\n end\nend\nsx = size( x );\nif length( sx ) ~= 2 || all( sx ~= 1 ),\n error( 'The first argument must be a vector.' );\nelse\n sx = prod( sx );\nend\nsQ = size( Q );\nif length( sQ ) ~= 2 || sQ( 1 ) ~= sQ( 2 ),\n error( 'The second argument must be a scalar or a square matrix.' );\nelseif all( sQ( 1 ) ~= [ 1, sx ] ),\n error( 'The size of Q is incompatible with the size of x.' );\nend\nsv = size( v );\nif length( sv ) > 2 || all( sv ~= 1 ),\n error( 'The third argument must be a vector.' );\nelseif all( prod( sv ) ~= [ 1, sx ] ), \n error( 'The size of v is incompatible with the size of x.' );\nelse\n sv = prod( sv );\nend\nif numel( w ) ~= 1,\n error( 'The fourth argument must be a real scalar.' );\nend\n\nw = real( w );\nv = vec( v );\nx = vec( x );\nsuccess = true;\nif cvx_isconstant( x ),\n \n %\n % Constant x, affine Q\n %\n\n x = cvx_constant( x );\n cvx_optval = real( x' * Q * x ) + sum( real( v' * x ) ) + w;\n return\n\nelseif ~cvx_isaffine( x ),\n\n error( 'First argument must be affine.' );\n \nelseif ~cvx_isconstant( Q ) || ~cvx_isconstant( v ),\n \n error( 'Either x or (Q,v) must be constant.' );\n \nend\nQ = cvx_constant( Q );\nv = cvx_constant( v );\nif nnz( Q ) == 0,\n \n %\n % Zero Q, affine x\n %\n\n cvx_optval = sum( real( v' * x ) ) + w;\n return\n \nelseif sQ( 1 ) == 1,\n \n %\n % Constant scalar Q, affine x\n %\n \n x = x + 0.5 * ( v / Q );\n w = w - 0.25 * ( v' * v ) / Q;\n cvx_optval = real( Q ) * sum_square_abs( x ) + w;\n return\n \nelse\n\n %\n % Constant matrix Q, affine x\n %\n\n if sv < sx, \n v = v(ones(sx,1),1); \n end\n cvx_optval = w;\n while true,\n \n %\n % Remove zero rows and columns from Q. If a diagonal element of Q is\n % zero but there are elements on that row or column that are not,\n % then we know that neither Q nor -Q is PSD.\n %\n \n Q = 0.5 * ( Q + Q' );\n dQ = diag( Q );\n trQ = sum( dQ );\n if ~all( dQ ),\n nnzQ = nnz( Q );\n tt = dQ ~= 0;\n Q = Q( tt, tt );\n if nnz( Q ) ~= nnzQ,\n success = false;\n break\n end\n dQ = dQ( tt );\n if nnz( v ),\n cvx_optval = cvx_optval + real( v( ~tt, : )' * cvx_subsref( x, ~tt, ':' ) );\n end\n v = v( tt, : );\n x = cvx_subsref( x, tt, ':' );\n sx = length( x );\n end\n \n %\n % Determine the sign of the elements of Q. If they are not all of\n % the same sign, then neither Q nor -Q is PSD. Note that trQ has\n % preserved the sign of our quadratic form, so setting Q=-Q here\n % in the concave case does not cause a problem.\n %\n\n dQ = dQ > 0;\n if ~all( dQ ),\n if any( dQ ),\n success = false;\n else\n Q = -Q;\n end\n end\n \n %\n % We've had to modify this portion of the code because MATLAB has\n % removed support for the CHOLINC function.\n %\n % First, try a Cholesky. If it successfully completes its\n % factorization without fail, we accept it without question. If\n % it terminates early, we perform a numerical test to see if the\n % result still approximates the square root to good precision.\n %\n % If Cholesky fails, then we assume the matrix is either rank\n % deficient or indefinite. For sparse matrices, we perform an LDL\n % factorization, and remove the contributions of any 2x2 blocks,\n % negative 1x1 blocks, and near-zero 1x1 blocks on the diagonal.\n % If there are no such blocks, we accept it without question; if\n % so, we perform the same numerical test. If the test fails, we \n % assume, for sparse matrices, at least, that the matrix is\n % indefinite.\n %\n % If the matrix is dense, our final test is an eigenvalue\n % decomposition, the most expensive but the most accurate.\n %\n\n spQ = nnz(Q) <= 0.1 * sx * sx;\n if spQ,\n Q = sparse( Q );\n [ R, p, prm ] = chol( Q, 'upper', 'vector' );\n if any( diff(prm) ~= 1 ),\n R( :, prm ) = R; %#ok\n end\n else\n Q = full( Q );\n [ R, p ] = chol( Q, 'upper' );\n if p > 1, \n R = [ R , R' \\ Q(1:p-1,p:end) ]; %#ok\n end\n end\n valid = p == 0;\n if ~valid,\n tolQ = tol * norm( Q, 'fro' );\n if p > 1,\n valid = norm( Q - R' * R, 'fro' ) < tolQ;\n end\n end\n if ~valid && spQ,\n [ R, DD, prm ] = ldl( sparse( Q ), 'upper', 'vector' );\n if nnz( R ) > 0.2 * sx * ( sx + 1 ) / 2, spQ = false; end %#ok\n spQ = cvx_use_sparse( R );\n tt = diag(DD,1) == 0;\n tt = [ tt ; true ] & [ true ; tt ] & ( diag(DD) > tolLDL * trQ );\n DD = diag(DD);\n R = bsxfun( @times, sqrt( DD(tt,:) ), R(tt,:) );\n if any( diff(prm) ~= 1 ), R( :, prm ) = R; end\n valid = all( tt ) || norm( Q - R' * R, 'fro' ) < tolQ;\n end\n if ~valid && ~spQ,\n [ V, D ] = eig( full( Q ) );\n if cvx_use_sparse( V ), \n V = sparse( V ); \n end\n D = diag( D );\n if any( D(2:end) < D(1:end-1) ),\n [D,ndxs] = sort(D);\n V = V(:,ndxs);\n end\n valid = D(1) > -tol * D(end);\n if valid,\n nzero = nnz( cumsum(D) < tol * abs(trQ) );\n V = V(:,nzero+1:end);\n D = sqrt(D(nzero+1:end));\n R = diag(sparse(D)) * V';\n end\n end\n if ~valid,\n success = false;\n break;\n end\n \n %\n % Scale so that the mean eigenvalue of (1/alpha)*R'*R is one. \n % Hopefully this will minimize scaling issues.\n %\n \n alpha = trQ / size(R,1);\n cvx_optval = cvx_optval + alpha * sum_square_abs( ( R * x ) / sqrt(alpha) ) + real( v' * x );\n break;\n \n end\n \n if ~success,\n error( 'The second argument must be positive or negative semidefinite.' );\n end\n\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/quad_over_lin.m", "content": "function cvx_optval = quad_over_lin( x, y, dim )\n\n%QUAD_OVER_LIN Internal cvx version.\n\nnarginchk(2,3);\nsx = size( x );\nsy = size( y );\nnx = length( sx );\nny = length( sy );\nnd = max( nx, ny );\nif nargin < 3 || isempty( dim ),\n dim = [ find( sx ~= 1 ), 1 ];\n dim = dim( 1 );\nelseif ~isnumeric( dim ) || dim < 0 || dim ~= floor( dim ),\n error( 'Third argument must be a dimension.' );\nelseif dim == 0,\n dim = nd + 1;\n nd = dim;\nend\n\n%\n% Check sizes\n%\n\nsx = [ sx, ones( 1, nd - nx ) ];\nsy = [ sy, ones( 1, nd - ny ) ];\nsz = sx;\nsz( dim ) = 1;\nif sy( dim ) ~= 1 && any( sx ~= 1 ),\n error( 'Dimensions are not compatible.' );\nend\nif all( sz == sy ) || all( sy == 1 ),\n need_contraction = false;\nelseif all( sz == 1 ),\n sz = sy;\n need_contraction = sx( dim ) ~= 1;\n sx = sz;\n dim = 0;\nelse\n error( 'Dimensions are not compatible.' );\nend\n\n%\n% Check curvature\n%\n\nif ~cvx_isaffine( x ),\n error( 'The first argument must be affine.' );\nelseif ~isreal( y ),\n error( 'The second argument must be real.' );\nelseif ~cvx_isconcave( y ),\n error( 'The second argument must be concave.' );\nend\n\n%\n% Construct the problem. Note that in order to support the case\n% where y is convex, we actually have to introduce a new inequality\n% y2 <= y, where y2 is a new variable. That is because set membership\n% constraints require affine arguments. So this is an obscure case, then,\n% where automatic curvature checking in epigraph functions breaks down.\n%\n\nif any( sz == 0 ),\n cvx_optval = cvx( zeros( sz ) );\nelseif any( sx == 0 ),\n cvx_begin\n y == nonnegative( sz ); %#ok\n cvx_end\nelse\n\tz = [];\n cvx_begin\n epigraph variable z( sz )\n y = cvx_accept_concave( y );\n if need_contraction,\n x = cvx_accept_convex( norms( x, 2, dim ) );\n end\n { x, y, z } == rotated_lorentz( sx, dim, ~isreal( x ) ); %#ok\n cvx_end\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/quad_pos_over_lin.m", "content": "function cvx_optval = quad_pos_over_lin( x, y, varargin ) %#ok\n\n%QUAD_POS_OVER_LIN Internal cvx version.\n\nnarginchk(2,3);\nif ~isreal( x ), \n error( 'First input must be real.' ); \nend\nx2 = [];\ncvx_begin\n variable x2( size(x) )\n minimize quad_over_lin( x2, y, varargin{:} );\n x2 >= x; %#ok\ncvx_end\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/rel_entr.m", "content": "function cvx_optval = rel_entr( x, y )\n\n%REL_ENTR Internal cvx version.\n\ncvx_expert_check( 'rel_entr', x, y );\npersistent remap_x remap_y remap_z\nnarginchk(2,2);\nsx = size( x ); xs = all( sx == 1 );\nsy = size( y ); ys = all( sy == 1 );\nif xs,\n sz = sy; %#ok \nelseif ys,\n sz = sx; %#ok\nelseif ~isequal( sx, sy ),\n error( 'Dimensions are not compatible.' );\nend\n\n% 0 : invalid\n% 1 : negative constant x\n% 2 : zero x\n% 3 : positive constant x\n% 4 : concave x\nif isempty( remap_z ),\n remap_1 = cvx_remap( 'real' );\n remap_2 = cvx_remap( 'real-affine' ) & ~remap_1;\n remap_3 = cvx_remap( 'concave' ) & ~remap_1;\n remap_x = remap_1 + 2 * remap_2;\n remap_y = remap_1 + 2 * remap_3;\n remap_z = ...\n [ 0, 0, 0 ; ...\n 0, 1, 2 ; ...\n 0, 2, 2 ];\nend\nvx = remap_x( cvx_classify( x ) );\nvy = remap_y( cvx_classify( y ) );\nvr = remap_z( vx + 3 * vy + 1 );\n\n%\n% Perform the computations for each expression type separately\n%\n\nvu = sort( vr(:) );\nvu = vu([true;diff(vu)~=0]);\nnv = length( vu );\nsz = size( x );\nxt = x;\nyt = y;\nif nv ~= 1,\n y = cvx( sz, [] );\nend\nfor k = 1 : nv,\n\n %\n % Select the category of expression to compute\n %\n\n vk = vu( k );\n if nv ~= 1,\n t = vr == vk;\n if ~xs, xt = cvx_subsref( x, t ); sz = size( xt ); end\n if ~ys, yt = cvx_subsref( y, t ); sz = size( yt ); end\n end\n\n %\n % Perform the computations\n %\n\n switch vk,\n case 0,\n % Invalid\n error( 'Disciplined convex programming error:\\n Illegal operation: rel_entr( {%s}, {%s} ).', cvx_class( xt, true, true ), cvx_class( yt, true, true ) );\n case 1,\n % Constant\n cvx_optval = cvx( rel_entr( cvx_constant( xt ), cvx_constant( yt ) ) );\n case 2,\n % Real affine\n q = [];\n cvx_begin\n epigraph variable q( sz );\n { -q, xt, yt } == exponential( sz ); %#ok\n cvx_end\n otherwise,\n error( 'Shouldn''t be here.' );\n end\n\n %\n % Store the results\n %\n\n if nv == 1,\n y = cvx_optval;\n else\n y = cvx_subsasgn( y, t, cvx_optval );\n end\n\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/sigma_max.m", "content": "function cvx_optval = sigma_max( x )\n\n%SIGMA_MAX Internal cvx version.\n\nnarginchk(1,1);\nif ndims( x ) > 2, %#ok\n error( 'lambda_max is not defined for N-D arrays.' );\nelseif ~cvx_isaffine( x ),\n error( 'Input must be affine.' );\nend\n\n%\n% Construct problem\n% \n\n[ m, n ] = size( x );\ncvx_optval = lambda_max( [ zeros( m, m ), x ; x', zeros( n, n ) ] );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/square.m", "content": "function y = square( x )\n\n%SQUARE Internal cvx version.\n\n% 0 : all others\n% 1 : constant\n% 2 : real affine\n% 3 : monomial, posynomial\nnarginchk(1,1);\npersistent remap\nif isempty( remap ),\n remap1 = cvx_remap( 'constant' );\n remap2 = cvx_remap( 'affine' ) & ~remap1;\n remap3 = cvx_remap( 'log-valid' ) & ~remap1;\n remap = remap1 + 2 * remap2 + 3 * remap3;\nend\nv = remap( cvx_classify( x ) );\n\n%\n% Perform the computations for each expression type separately\n%\n\nvu = sort( v(:) );\nvu = vu([true;diff(vu)~=0]);\nnv = length( vu );\nif nv ~= 1,\n y = cvx( size( x ), [] );\nend\nfor k = 1 : nv,\n\n %\n % Select the category of expression to compute\n %\n\n vk = vu( k );\n if nv == 1,\n xt = x;\n else\n t = v == vk;\n xt = cvx_subsref( x, t );\n end\n\n %\n % Perform the computations\n %\n\n switch vk,\n case 0,\n % Invalid\n error( 'Disciplined convex programming error:\\n Illegal operation: square( {%s} ).', cvx_class( xt, true, true ) );\n case 1,\n % Constant\n yt = cvx_constant( xt );\n yt = cvx( yt .* yt );\n case 2,\n % Real affine\n yt = quad_over_lin( xt, 1, 0 );\n case 3,\n % Monomial, posynomial\n yt = exp( 2 * log( xt ) );\n otherwise,\n error( 'Shouldn''t be here.' );\n end\n\n %\n % Store the results\n %\n\n if nv == 1,\n y = yt;\n else\n y = cvx_subsasgn( y, t, yt );\n end\n\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/square_abs.m", "content": "function cvx_optval = square_abs( x )\n\n%SQUARE_ABS Internal cvx version.\n\nnarginchk(1,1);\ncvx_optval = pow_abs( x, 2 );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/square_pos.m", "content": "function cvx_optval = square_pos( x )\n\n%SQUARE_POS Internal cvx version.\n\nnarginchk(1,1);\ncvx_optval = pow_pos( x, 2 );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/sum_largest.m", "content": "function cvx_optval = sum_largest( x, k, dim )\n\n%SUM_LARGEST Internal cvx version.\n\nnarginchk(2,3);\nsx = size( x );\nif nargin < 3 || isempty( dim ),\n\tdim = cvx_default_dimension( sx );\nelseif ~cvx_check_dimension( dim ),\n error( 'Second argument must be a dimension.' );\nelseif ~isnumeric( k ) || ~isreal( k ),\n error( 'Third argument must be a real scalar.' );\nelseif ~isreal( x ),\n error( 'First argument must be real.' );\nend\n\n%\n% Quick exit cases\n%\n\nsx( end + 1 : dim ) = 1;\nsy = sx;\nsy( dim ) = 1;\nif k <= 0,\n\n cvx_optval = zeros( sy );\n\nelseif k <= 1,\n\n cvx_optval = k * max( x, [], dim );\n\nelseif k >= sx( dim ),\n\n cvx_optval = sum( x, dim );\n\nelse\n\n\tz = []; xp = []; yp = [];\n cvx_begin\n epigraph variable z( sy )\n variables xp( sx ) yp( sy )\n z == sum( xp, dim ) - k * yp; %#ok\n xp >= cvx_expand_dim( yp, dim, sx(dim) ) + x; %#ok\n xp >= 0; %#ok\n cvx_end\n\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/sum_log.m", "content": "function y = sum_log( x, dim )\n\n%SUM_LOG Internal CVX version.\n\ncvx_expert_check( 'sum_log', x );\nnarginchk(1,2);\nif nargin == 2,\n y = size( x, dim ) * log( geo_mean( x, dim ) );\nelse\n y = length( x ) * log( geo_mean( x ) );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/sum_square.m", "content": "function cvx_optval = sum_square( x, varargin )\n\n%SUM_SQUARE Internal cvx version.\n\nnarginchk(1,2);\nif ~isreal( x ),\n error( 'Disciplined convex programming error:\\n The argument to SUM_SQUARE must be real and affine.', 1 ); %#ok\nend\ncvx_optval = quad_over_lin( x, 1, varargin{:} );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/sum_square_abs.m", "content": "function cvx_optval = sum_square_abs( x, varargin )\n\n%SUM_SQUARE_ABS Internal cvx version.\n\nnarginchk(1,2);\ncvx_optval = quad_over_lin( x, 1, varargin{:} );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/sum_square_pos.m", "content": "function cvx_optval = sum_square_pos( x, varargin ) %#ok\n\n%SUM_SQUARE_POS Internal cvx version.\n\nnarginchk(1,2);\nx2 = [];\ncvx_begin\n variable x2( size( x ) );\n minimize( sum_square( x2, varargin{:} ) );\n x2 >= x; %#ok\ncvx_end\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/trace_inv.m", "content": "function cvx_optval = trace_inv( X ) %#ok\n\n%TRACE_INV Internal cvx version.\n\nnarginchk(1,1);\nif ndims( X ) > 2, %#ok\n error( 'trace_inv is not defined for N-D arrays.' );\nelseif ~cvx_isaffine( X ),\n error( 'Input must be affine.' );\nend\nn = size(X,1);\nif n ~= size( X, 2 ),\n error( 'Matrix must be square.' );\nend\n\n%\n% Construct problem\n% \n\nY = [];\ncvx_begin sdp\n if isreal(X),\n variable Y(n,n) symmetric\n else\n variable Y(n,n) Hermitian\n end\n minimize(trace(Y));\n [Y,eye(n);eye(n),X] >= 0; %#ok\ncvx_end\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/trace_sqrtm.m", "content": "function cvx_optval = trace_sqrtm( X ) %#ok\n\n%TRACE_SQRTM Internal cvx version.\n\nnarginchk(1,1);\nif ndims( X ) > 2, %#ok\n error( 'trace_inv is not defined for N-D arrays.' );\nelseif ~cvx_isaffine( X ),\n error( 'Input must be affine.' );\nend\nn = size(X,1);\nif n ~= size( X, 2 ),\n error( 'Matrix must be square.' );\nend\n\n%\n% Construct problem\n% \n\nY = [];\ncvx_begin sdp\n if isreal(X),\n variable Y(n,n)\n else\n variable Y(n,n) complex\n end\n maximize(real(trace(Y))); \n [eye(n),Y;Y',X] >= 0; %#ok\ncvx_end\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/@cvx/vec.m", "content": "function x = vec( x )\n\n% VEC CVX implementation of vec\n\nx.size_ = [prod(x.size_),1];\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/Contents.m", "content": "% CVX: Additional functions added by CVX.\n%\n% These functions have been provided to expand the variety of constraints\n% and objectives that can be specified in CVX models. But in fact, they \n% can be used with numeric arguments *outside* of CVX as well. The help \n% text for each of these functions contains general information about the\n% computations it performs, as well as specific information about its\n% proper use in CVX models, as dictated by its convexity/concavity and\n% monotonicity properties.\n%\n% Those functions marked with a (*), as well as the exponential and \n% logarithm functions, are supported using a \"successive approximation\"\n% approach: that is, the solver is called multiple times to refine the \n% solution to the required accuracy. Thus models using these functions\n% should be expected to run more slowly than models of comparable size\n% that do not. See the CVX user guide for details.\n%\n% A number of Matlab's built-in functions have been extended to provide\n% CVX support; for example,\n% abs, exp(*), log (*), max, min, norm, prod, sqrt\n% For a full list, type \"help cvx/builtins\".\n%\n% berhu - Reverse Huber penalty function.\n% det_inv - Determinant of the inverse of an SPD matrix.\n% det_root2n - 2nth-root of the determinant of an SPD matrix.\n% det_rootn - nth-root of the determinant of an SPD matrix.\n% entr - Scalar entropy. (*)\n% geo_mean - Geometric mean. (*)\n% huber - Huber penalty function.\n% huber_circ - Circularly symmetric version of the Huber penalty.\n% huber_pos - Monotonic Huber-style function.\n% inv_pos - Reciprocal of a positive quantity.\n% kl_div - Scalar Kullback-Leibler distance. (*)\n% lambda_max - Maximum eigenvalue of a symmetric matrix.\n% lambda_min - Minimum eigenvalue of a symmetric matrix.\n% log_det - Logarithm of the determinant. (*)\n% log_normcdf - Logarithm of the normal CDF. (approximation)\n% log_sum_exp - log(sum(exp(x))). (*)\n% logsumexp_sdp - SDP-based approximation of log(sum(exp(x))).\n% matrix_frac - Matrix fractional function.\n% norm_largest - Sum of the k largest magnitudes of a vector.\n% norm_nuc - Nuclear norm of a matrix.\n% norms - Computation of multiple vector norms.\n% norms_largest - Computation of multiple norm_largest() norms.\n% poly_env - Convex or concave envelope of a polynomial.\n% polyval_trig - Evaluate a trigonometric polynomial.\n% pos - Positive part.\n% pow_p - Nonnegative branches of the power function.\n% pow_pos - Convex/concave branches of the power function.\n% pow_abs - Absolute value raised to a fixed power.\n% quad_form - Quadratic form.\n% quad_over_lin - Sum of squares over linear.\n% quad_pos_over_lin - Sum of squares of positives over linear.\n% rel_entr - Scalar relative entropy. (*)\n% sigma_max - Maximum singular value.\n% square - Square.\n% square_abs - Square of absolute value.\n% square_pos - Square of positive part.\n% sum_largest - Sum of the largest k values of a vector.\n% sum_smallest - Sum of the smallest k elements of a vector.\n% sum_square - Sum of squares.\n% sum_square_abs - sum of squares of absolute values.\n% sum_square_pos - Sum of squares of positive parts.\n% trace_inv - Trace of the inverse of a PSD matrix.\n% trace_sqrtm - Trace of the square root of a PSD matrix.\n% vec - Vectorize.\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/avg_abs_dev.m", "content": "function y = avg_abs_dev( x, dim )\n\n%AVG_ABS_DEV Average absolute deviation (about the mean).\n% For vectors, AVG_ABS_DEV(X) is the average absolute deviation of X\n% about its mean; that is, AVG_ABS_DEV(X)=MEAN(ABS(X-MEAN(X))). For\n% matrices, AVG_ABS_DEV(X) is a row vector containing the average\n% absolute deviation of each column. For N-D arrays, AVG_ABS_DEV(X)\n% is the average absolute deviation of the elements along the first\n% non-singleton dimension of X.\n%\n% AVG_ABS_DEV(X,DIM) performs the computation along the dimension DIM. \n%\n% See also AVG_ABS_DEV_MED.\n%\n% Disciplined convex programming information:\n% AVG_ABS_DEV is convex and nonmontonic in X. \n% Therefore, X must be affine.\n% \n\nsx = size( x );\nif nargin < 2 || isempty( dim ),\n dim = find( sx ~= 1 );\n if isempty( dim ), dim = 1; else dim = dim( 1 ); end\nend\nnd = length( sx );\nif nd >= dim && sx( dim ) > 1,\n scale = 1.0 ./ sx( dim );\n y = sum( abs( x - sum( x, dim ) * scale ), dim ) * scale;\nelseif length( sx ) < dim || sx( dim ) == 1,\n y = zeros( sx );\nelse\n sx( end + 1 : nd ) = 1;\n sx( dim ) = 1;\n y = NaN( sy );\nend\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/avg_abs_dev_med.m", "content": "function y = avg_abs_dev_med( x, dim )\n\n%AVG_ABS_DEV_MED Average absolute deviation about the median.\n% For vectors, AVG_ABS_DEV_MED(X) is the average absolute deviation of X\n% about its median; that is, AVG_ABS_DEV_MED(X)=MEAN(ABS(X-MEDIAN(X))).\n% For matrices, AVG_ABS_DEV_MED(X) is a row vector containing the average\n% absolute deviation of each column. For N-D arrays, AVG_ABS_DEV_ME(X)\n% is the average absolute deviation of the elements along the first\n% non-singleton dimension of X.\n%\n% AVG_ABS_DEV_MED(X,DIM) performs the computation along the dimension DIM. \n%\n% See also AVG_ABS_DEV.\n%\n% Disciplined convex programming information:\n% AVG_ABS_DEV_MED is convex and nonmontonic in X. \n% Therefore, X must be affine.\n% \n\nsx = size( x );\nif nargin < 2 || isempty( dim ),\n dim = find( sx ~= 1 );\n if isempty( dim ), dim = 1; else dim = dim( 1 ); end\nend\nnd = length( sx );\nif nd >= dim && sx( dim ) > 1,\n y = sum( abs( x - median( x, dim ) ), dim ) / sx( dim );\nelseif length( sx ) < dim || sx( dim ) == 1,\n y = zeros( sx );\nelse\n sx( end + 1 : nd ) = 1;\n sx( dim ) = 1;\n y = NaN( sy );\nend\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/berhu.m", "content": "function y = berhu( x, M, t )\n\n%BERHU Reverse Huber penalty function.\n% BERHU(X) computes the reverse Huber penalty function\n%\n% BERHU(X) = ABS(X) if ABS(X)<=1,\n% (ABS(X).^2+1)./2 if ABS(X)>=1.\n%\n% BERHU(X,M) computes the reverse Huber penalty function with halfwidth M,\n% M.*BERHU(X./M). M must be real and positive.\n%\n% BERHU(X,M,T) computes the reverse Huber penalty function with halfwidth M\n% and concomitant scale T: \n%\n% BERHU(X,M,T) = (M.*T).*BERHU(X./(M.*T)) if T>0\n% +Inf if T<=0\n%\n% This form supports the joint estimation of regression coefficients and\n% scaling; c.f. Art B. Owen, \"A robust hybrid of lasso and ridge regression\",\n% techincal report, Department of Statistics, Stanford University, 2006: \n% http://www-stat.stanford.edu/~owen/reports/hhu.pdf\n%\n% For matrices and N-D arrays, the penalty function is applied to each\n% element of X independently. M and T must be compatible with X in the same\n% sense as .*: one must be a scalar, or they must have identical size.\n%\n% Disciplined convex programming information:\n% BERHU is jointly convex in X and T. It is nonomonotonic in X and\n% nonincreasing in T. Therefore, when used in CVX specifications, X\n% must be affine and T must be concave (or affine). T must be real.\n\n%\n% Check arguments\n%\n\nnarginchk(1,3);\nif nargin < 2,\n M = 1;\nelseif ~isreal( M ) || any( M( : ) <= 0 ),\n error( 'Second argument must be real and positive.' );\nend\nif nargin < 3,\n t = 1;\nelseif ~isreal( t ),\n error( 'Third argument must be real.' );\nend\nsz = cvx_size_check( x, M, t );\nif isempty( sz ),\n error( 'Sizes are incompatible.' );\nend\n\n%\n% Compute result\n%\n\ny = abs( x ./ max(t,realmin) );\nz = min( y, M );\ny = t .* ( y + ( y - z ).^2 ./ (2*M) );\nq = t <= 0;\nif nnz( q ),\n if length(t) == 1, \n y = Inf * ones( sz );\n else\n y( q ) = Inf;\n end\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/det_inv.m", "content": "function cvx_optval = det_inv( X, p )\n\n%DET_INV determinant of the inverse of an SPD matrix.\n% For a square matrix X, DET_INV(X) returns 1.0./DET(X) if X is symmetric\n% (real) or Hermitian (complex) and positive defininte, and +Inf otherwise.\n%\n% This function can be used in many convex optimization problems that call\n% for LOG(DET(X)) instead. For example, if the objective function is\n% maximize(logdet(X))\n% then it can be replaced with\n% maximize(-det_inv(X))\n% and the same optimal point will be produced.\n%\n% DET_INV(X,p) computes DET_INV(X)^p. p must be a positive real scalar.\n%\n% Disciplined convex programming information:\n% DET_INV(X) is convex and nonmonotonic in X; therefore, when used in\n% CVX specifications, its argument must be affine.\n\nnarginchk(1,2);\nn = size( X, 1 );\nif ndims( X ) > 2, %#ok\n error( 'N-D arrays are not supported.' );\nelseif size( X, 2 ) ~= n,\n error( 'Matrix must be square.' );\nelseif nargin < 2,\n p = 1;\nelseif ~isnumeric( p ) || ~isreal( p ) || numel( p ) ~= 1 || p <= 0,\n error( 'Second argument must be a positive scalar.' );\nend\n\nif nnz( X - X' ) ~= 0,\n\n cvx_optval = +Inf;\n\nelse\n\n n = size( X, 1 );\n [ R, q ] = chol( X );\n if q == 0,\n cvx_optval = prod(diag(R)).^(-p);\n else\n eigs = eig( X );\n if any( eigs <= 0 ),\n cvx_optval = +Inf;\n else\n cvx_optval = prod(eigs).^(-p);\n end\n end\n\nend\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/det_root2n.m", "content": "function cvx_optval = det_root2n( X )\n\n%DET_ROOT2N 2nth-root of the determinant of an SPD matrix.\n% For a square matrix X, DET_ROOT2N(X) returns\n% POW(DET(X),1/(2*size(X,1))\n% if X is symmetric (real) or Hermitian (complex) and positive\n% semidefinite, and -Inf otherwise.\n%\n% This function has been replaced in significance with DET_ROOTN(X),\n% and is now simply implemented as SQRT(DET_ROOTN(X)). Please see\n% DET_ROOTN for more information on its usefulness.\n%\n% Disciplined convex programming information:\n% DET_ROOT2N is concave and nonmonotonic; therefore, when used in\n% CVX specifications, its argument must be affine.\n\nnarginchk(1,1);\ncvx_optval = sqrt(det_rootn(X));\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/det_rootn.m", "content": "function cvx_optval = det_rootn( X )\n\n%DET_ROOTN nth-root of the determinant of an SPD matrix.\n% For a square matrix X, DET_ROOTN(X) returns\n% POW(DET(X),1/(size(X,1))\n% if X is symmetric (real) or Hermitian (complex) and positive semidefinite,\n% and -Inf otherwise.\n%\n% This function can be used in many convex optimization problems that call for\n% LOG(DET(X)) instead. For example, if the objective function contains nothing\n% but LOG(DET(X)), it can be replaced with DET_ROOTN(X), and the same optimal \n% point will be produced.\n%\n% Disciplined convex programming information:\n% DET_ROOTN is concave and nonmonotonic; therefore, when used in\n% CVX specifications, its argument must be affine.\n\nnarginchk(1,1);\nif ndims( X ) > 2 || size( X, 1 ) ~= size( X, 2 ), %#ok\n error( 'Second argument must be a square matrix.' );\nend\nerr = X - X';\nX = 0.5 * ( X + X' );\nif norm( err, 'fro' ) > 8 * eps * norm( X, 'fro' ),\n cvx_optval = -Inf;\nelse\n [R,p] = chol(X);\n if p > 0,\n cvx_optval = geo_mean(eig(full(X)));\n else\n cvx_optval = geo_mean(diag(R)).^2;\n end\nend\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/entr.m", "content": "function y = entr( x )\n\n%ENTR Scalar entropy.\n% ENTR(X) returns an array of the same size as X with the unnormalized\n% entropy function applied to each element:\n% { -X.*LOG(X) if X > 0,\n% ENTR(X) = { 0 if X == 0,\n% { -Inf otherwise.\n% If X is a vector representing a discrete probability distribution, then\n% SUM(ENTR(X)) returns its entropy.\n%\n% Disciplined convex programming information:\n% ENTR(X) is concave and nonmonotonic in X. Thus when used in CVX\n% expressions, X must be real and affine. Its use will effectively \n% constrain X to be nonnegative: there is no need to add an\n% additional X >= 0 to your model in order to enforce this.\n\nnarginchk(1,1);\ncvx_expert_check( 'entr', x );\ny = -rel_entr( x, 1 );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/geo_mean.m", "content": "function y = geo_mean( x, dim, w )\n\n%GEO_MEAN Geometric mean.\n% Y=GEO_MEAN(X), where X is a vector, computes the geometrix mean of X. If any\n% of the elements of X are negative, then Y=-Inf. Otherwise, it is equivalent\n% to Y=PROD(X).^(1/LENGTH(X)). All elements must be real.\n%\n% For matrices, GEO_MEAN(X) is a row vector containing the geometric means of\n% the columns. For N-D arrays, GEO_MEAN(X) is an array of the geometric means\n% taken along the first non-singleton dimension of X.\n%\n% GEO_MEAN(X,DIM) takes the geometric mean along the dimension DIM of X.\n%\n% GEO_MEAN(X,DIM,W), where W is a vector of nonnegative integers, computes a\n% weighted geometric mean Y = PROD(X.^W)^(1/SUM(W)). This is more efficient\n% than replicating the values of X W times. Note that W must be a vector,\n% even if X is a matrix, and its length must be the same as SIZE(X,DIM).\n%\n% Disciplined convex programming information:\n% GEO_MEAN is concave and nondecreasing; therefore, when used in CVX\n% specifications, its argument must be concave.\n\n%\n% Check arguments\n%\n\nnarginchk(1,3);\nif ~isreal( x ), \n error( 'First argument must be real.' ); \nelseif nargin < 2,\n dim = cvx_default_dimension( size( x ) );\nelseif ~cvx_check_dimension( dim ),\n error( 'Second argument must be a positive integer.' );\nend\nsx = size( x );\nnx = sx( dim );\n\n%\n% Third argument check\n%\n\nif nargin < 3 || isempty( w ),\n w = [];\nelseif numel( w ) ~= length( w ) || ~isnumeric( w ) || ~isreal( w ) || any( w < 0 ) || any( w ~= floor( w ) ),\n error( 'Third argument must be a vector of nonnegative integers.' );\nelseif length( w ) ~= nx,\n error( 'Third argument must be a vector of length %d.', nx );\nelse\n w = reshape( w, 1, nx );\nend\n\nif nx == 0,\n sx( dim ) = 1;\n y = ones( sx );\nelse\n if nx == 1,\n y = x;\n elseif isempty( w ) || ~any( diff( w ) ),\n y = exp( sum( log( max( x, realmin ) ), dim ) * ( 1 / nx ) );\n elseif dim == 1,\n y = exp( w * log( max( x, realmin ) ) * ( 1 / sum( w ) ) );\n else\n pvec = [ dim, 1 : dim - 1, dim + 1 : ndims( x ) ];\n y = ipermute( exp( w * log( max( permute( x, pvec ), realmin ) ) * ( 1 / sum( w ) ) ), pvec );\n end\n xmin = min( x, [], dim );\n y( xmin < 0 ) = -Inf;\n y( xmin == 0 ) = 0;\nend\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/geomean.m", "content": "function y = geomean( varargin )\n\n%GEOMEAN Geometric mean.\n% GEOMEAN(X) = GEO_MEAN(X) = PROD(X).^(1/LENGTH(X)). We have replaced this\n% function with GEO_MEAN to better match our function naming conventions.\n% Please start using it instead.\n\nwarning( 'CVX:Renamed', [ ...\n 'The function \"geomean\" has been renamed \"geo_mean\". Please start\\n', ...\n 'using the new name. The old name will be removed in a future release.' ], 1 );\n\ny = geo_mean( varargin{:} );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/huber.m", "content": "function y = huber( x, varargin )\n\n%HUBER Huber penalty function.\n% HUBER(X) computes the Huber penalty function\n%\n% HUBER(X) = |X|^2 if |X|<=1,\n% 2|X|-1 if |X|>=1.\n%\n% HUBER(X,M) is the Huber penalty function of halfwidth M, M.^2.*HUBER(X./M). \n% M must be real and positive.\n%\n% HUBER(X,M,T) computes the Huber penalty function with halfwidth M and\n% concomitant scale T:\n%\n% HUBER(X,M,T) = T.*HUBER(X./T,M) if T > 0\n% +Inf if T <= 0\n%\n% This form supports the joint estimation of regression coefficients and\n% scaling; c.f. Art B. Owen, \"A robust hybrid of lasso and ridge regression\",\n% techincal report, Department of Statistics, Stanford University, 2006: \n% http://www-stat.stanford.edu/~owen/reports/hhu.pdf\n%\n% For matrices and N-D arrays, the penalty function is applied to each\n% element of X independently. M and T must be compatible with X in the same\n% sense as .*: one must be a scalar, or they must have identical size.\n%\n% Disciplined convex programming information:\n% HUBER is jointly convex in X and T. It is nonomonotonic in X and\n% nonincreasing in T. Therefore, when used in CVX specifications, X\n% must be affine and T must be concave (or affine). T must be real.\n\nif ~cvx_isaffine( x ),\n error( 'Disciplined convex programming error:\\n HUBER is nonmonotonic in X, so X must be affine.', 1 ); %#ok\nend\ny = huber_pos( abs( x ), varargin{:} );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/huber_circ.m", "content": "function y = huber_circ( x, DIM, varargin )\n\n%HUBER_CIRC Huber penalty function with circular symmetry.\n% For a vector X, HUBER_CIRC(X) computes the Huber penalty function\n%\n% HUBER_CIRC(X) = NORM(X,2)^2 if NORM(X,2)<=1,\n% 2*NORM(X,2)-1 if NORM(X,2)>=1.\n%\n% For matrices and N-D arrays, the penalty function is applied to the\n% first dimens\n%\n% HUBER_CIRC(X,[],M) computes the penalty function with halfwidth M,\n% M.^2.*HUBER_CIRC(X./M). M must be real and positive.\n%\n% HUBER_CIRC(X,[],M,T) computes the penalty function with halfwidth M\n% and concomitant scale T:\n%\n% HUBER_CIRC(X,[],M,T) = T.*HUBER_CIRC(X./T,[],M) if T > 0\n% +Inf if T <= 0\n%\n% See the help file for HUBER for information about this usage.\n%\n% If X is a matrix, the penalty function is applied to the columns of the\n% matrix X, and a row vector is returned. If X is an N-D matrix, the \n% penalties are computed along the first non-singleton dimension.\n%\n% HUBER_CIRC(X,DIM), HUBER_CIRC(X,DIM,M), and HUBER_CIRC(X,DIM,M,T) \n% computes the penalty along the dimension DIM.\n%\n% Disciplined convex programming information:\n% HUBER_CIRC is jointly convex in X and T. It is nonomonotonic in X \n% and nonincreasing in T. Therefore, when used in CVX specifications, \n% X must be affine and T must be concave (or affine). T must be real.\n% X, on the other hand, may be real or complex.\n\nif ~cvx_isaffine( x ),\n error( 'Disciplined convex programming error:\\n HUBER_CIRC is nonmonotonic in X, so X must be affine.', 1 ); %#ok\nend\nif nargin < 2, DIM = []; end\ny = huber_pos( norms( x, DIM ), varargin{:} );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/huber_pos.m", "content": "function y = huber_pos( x, M, t )\n\n%HUBER_POS Monotonic huber penalty function.\n% For a vector X, HUBER_POS(X) computes the monotonic Huber-style function\n% \n% 0 if 0>=X\n% HUBER_POS(X) = X^2 if 0<=X<=1\n% 2*X-1 if X>=1\n%\n% HUBER_POS(X,M) is the monotonic Huber-style penalty function of\n% halfwidth M, M.^2.*HUBER_POS(X./M). M must be real and positive.\n%\n% HUBER_POS(X,M,T) computes the monotonic Huber-style penalty function \n% with halfwidth M and concomitant scale T:\n%\n% HUBER_POS(X,M,T) = T.*HUBER_POS(X./T,M) if T > 0\n% +Inf if T <= 0\n%\n% See the help file for HUBER for information about this usage.\n%\n% For matrices and N-D arrays, the penalty function is applied to each\n% element of X independently. M and T must be compatible with X in the same\n% sense as .*: one must be a scalar, or they must have identical size.\n%\n% Disciplined convex programming information:\n% HUBER_POS is jointly convex in X and T. It is nondecreasing in X and\n% nonincreasing in T. Therefore, when used in CVX specifications, X\n% must be convex and T must be concave (or affine). Both must be real.\n\n%\n% Check arguments\n%\n\nnarginchk(1,3);\nif ~isreal( x ),\n error( 'First argument must be real.' );\nend\nif nargin < 2,\n M = 1;\nelseif ~isreal( M ) || any( M( : ) <= 0 ),\n error( 'Second argument must be real and positive.' );\nend\nif nargin < 3,\n t = 1;\nelseif ~isreal( t ),\n error( 'Third argument must be real.' );\nend\nsz = cvx_size_check( x, M, t );\nif isempty( sz ),\n error( 'Sizes are incompatible.' );\nend\n\n%\n% Compute result\n%\n\ny = max( x, 0 );\nz = min( y, M );\ny = t .* z .* ( 2 * y - z );\nq = t <= 0;\nif nnz( q ),\n if length( t ) == 1,\n y = Inf * ones( sy );\n else\n y( q ) = Inf;\n end\nend\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/inv_pos.m", "content": "function y = inv_pos( x )\n\n%INV_POS Reciprocal of a positive quantity.\n% INV_POS(X) returns 1./X if X is positive, and +Inf otherwise.\n% X must be real.\n%\n% For matrices and N-D arrays, the function is applied to each element.\n%\n% Disciplined convex programming information:\n% INV_POS is convex and nonincreasing; therefore, when used in CVX\n% specifications, its argument must be concave (or affine).\n\nnarginchk(1,1);\nif ~isreal( x ),\n error( 'Input must be real.' );\nend\ny = 1.0 ./ max( x, 0 );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/kl_div.m", "content": "function z = kl_div( x, y )\n\n%KL_DIV Scalar relative entropy.\n% KL_DIV(X,Y) returns an array of the same size as X+Y with the Kullback-\n% Leubler divergence function applied to each element:\n% { X.*LOG(X./Y)-X+Y if X > 0 & Y > 0,\n% KL_DIV(X,Y) = { 0 if X == 0 & Y >= 0,\n% { +Inf otherwise.\n% X and Y must either be the same size, or one must be a scalar. If X and\n% Y are vector PDFs, then SUM(KL_DIV(X,Y)) returns their Kullback-Leibler\n% divergence, which in the case of PDFs is equal to SUM(REL_ENTR(X,Y)).\n%\n% Disciplined convex programming information:\n% KL_DIV(X,Y) is convex and nonmonotonic in both X and Y. Thus when\n% used in CVX expressions, X and Y must be real and affine. The use \n% of KL_DIV(X,Y) in an objective or constraint will effectively \n% constrain both X and Y to be nonnegative, hence there is no need to\n% add additional constraints X >= 0 or Y >= 0 to enforce this.\n\nnarginchk(2,2);\ncvx_expert_check( 'kl_div', x, y );\nz = rel_entr( x, y ) - x + y;\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/lambda_max.m", "content": "function z = lambda_max( Y )\n\n% LAMBDA_MAX Maximum eigenvalue of a symmetric matrix.\n% For square matrix X, LAMBDA_MAX(X) is MAX(EIG(X)) if X is Hermitian\n% or symmetric and real; and +Inf otherwise. \n%\n% An error results if X is not a square matrix.\n%\n% Disciplined convex programming information:\n% LAMBDA_MAX is convex and nonmonotonic (at least with respect to\n% elementwise comparison), so its argument must be affine.\n\nnarginchk(1,1);\nif ndims( Y ) > 2 || size( Y, 1 ) ~= size( Y, 2 ), %#ok\n error( 'Input must be a square matrix.' );\nend\nerr = Y - Y';\nY = 0.5 * ( Y + Y' );\nif norm( err, 'fro' ) > 8 * eps * norm( Y, 'fro' ),\n z = Inf;\nelse\n z = max( eig( full( Y ) ) );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/lambda_min.m", "content": "function z = lambda_min( Y )\n\n% LAMBDA_MIN Minimum eigenvalue of a symmetric matrix.\n% For square matrix X, LAMBDA_MIN(X) is MIN(EIG(X)) if X is Hermitian\n% or symmetric and real; and -Inf otherwise.\n%\n% An error results if X is not a square matrix.\n%\n% Disciplined convex programming information:\n% LAMBDA_MIN is concave and nonmonotonic (at least with respect to\n% elementwise comparison), so its argument must be affine.\n\nnarginchk(1,1);\nz = - lambda_max( -Y );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/lambda_sum_largest.m", "content": "function z = lambda_sum_largest( Y, k )\n\n% LAMBDA_SUM_LARGEST Sum of the k largest eigenvalues of a symmetric matrix.\n%\n% For square matrix X, LAMBDA_SUM_LARGEST(X,K) is SUM_LARGEST(EIG(X),k)\n% if X is Hermitian or symmetric and real; and +Inf otherwise.\n%\n% An error results if X is not a square matrix.\n%\n% Disciplined convex programming information:\n% LAMBDA_SUM_LARGEST is convex and nonmonotonic (at least with \n% respect to elementwise comparison), so its argument must be affine.\n\nnarginchk(2,2);\nif ndims( Y ) > 2 || size( Y, 1 ) ~= size( Y, 2 ), %#ok\n error( 'First input must be a square matrix.' );\nelseif ~isnumeric( k ) || numel( k ) ~= 1 || ~isreal( k ),\n error( 'Second input must be a real scalar.' );\nend\nerr = Y - Y';\nY = 0.5 * ( Y + Y' );\nif norm( err, 'fro' ) > 8 * eps * norm( Y, 'fro' ),\n z = Inf;\nelse\n z = sum_largest( eig( full( Y ) ), k );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/lambda_sum_smallest.m", "content": "function z = lambda_sum_smallest( Y, k )\n\n% LAMBDA_SUM_SMALLEST Sum of the k smallest eigenvalues of a symmetric matrix.\n% For square matrix X, LAMBDA_SUM_SMALLEST(X,K) is SUM_SMALLEST(EIG(X),k)\n% if X is Hermitian or symmetric and real; and +Inf otherwise.\n%\n% An error results if X is not a square matrix.\n%\n% Disciplined convex programming information:\n% LAMBDA_SUM_SMALLEST is concave and nonmonotonic (at least with \n% respect to elementwise comparison), so its argument must be affine.\n\nz = - lambda_sum_largest( - Y, k );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/log_det.m", "content": "function cvx_optval = log_det( X )\n\n%LOG_DET Logarithm of the determinant of an SDP matrix.\n% For a square matrix X, LOG_DET(X) returns\n% LOG(DET(X))\n% if X is symmetric (real) or Hermitian (complex) and positive semidefinite,\n% and -Inf otherwise.\n%\n% When used in a CVX model, LOG_DET(X) causes CVX's successive \n% approximation method to be invoked, producing results exact to within\n% the tolerance of the solver. Therefore, whenever possible, the use of\n% DET_ROOTN(X) is to be preferred, because the latter choice can be\n% represented exactly in an SDP. For example, the objective\n% MAXIMIZE(LOG_DET(X))\n% can be (and should be) replaced with\n% MAXIMIZE(DET_ROOTN(X))\n% in fact, LOG_DET(X) is implemented simply as N*LOG(DET_ROOTN(X)).\n%\n% Disciplined convex programming information:\n% LOG_DET is concave and nonmonotonic; therefore, when used in\n% CVX specifications, its argument must be affine.\n\nnarginchk(1,1);\ncvx_expert_check( 'log_det', X );\nif ndims( X ) > 2 || size( X, 1 ) ~= size( X, 2 ), %#ok\n error( 'Argument must be a square matrix.' );\nend\ncvx_optval = size(X,1)*log(det_rootn(X));\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/log_normcdf.m", "content": "function y = log_normcdf( x, approx ) %#ok\n\n%LOG_NORMCDF Logarithm of the cumulative normal distribution.\n% Y = LOG_NORMCDF(X) is the logarithm of the CDF of the normal\n% distribution at the point X.\n%\n% 1 / x\n% LOG_NORMCDF(X) = LOG( ------- | exp(-t^2/2) dt )\n% sqrt(2) / -Inf\n%\n% For numeric X, LOG_NORMCDF(X) is computed using the equivalent \n% expression LOG(0.5*ERFC(-X*SQRT(0.5))). When X is a CVX variable, a \n% a piecewise quadratic *approximation* is employed instead. This\n% approximation gives good results when -4 <= x <= 4, and will be\n% improved in future releases of CVX.\n%\n% For array values of X, the LOG_NORMCDF returns an array of identical\n% size with the calculation applied independently to each element.\n%\n% X must be real.\n%\n% Disciplined convex programming information:\n% LOG_NORMCDF is concave and nondecreasing in X. Therefore, when used\n% in CVX specifications, X must be concave.\n\nnarginchk(1,2);\nif ~isreal( x ),\n error( 'Argument must be real.' );\nend\nif nargin > 1,\n % For debugging purposes only\n y = cvx_constant(log_normcdf(cvx(x)));\nelse\n y = log(0.5*erfc(-x*sqrt(0.5)));\nend\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/log_prod.m", "content": "function cvx_optval = log_prod( X, dim )\n\n%LOG_PROD Logarithm of the product of a vector.\n% For a vector X, LOG_PROD(X) returns\n% LOG(PROD(X))\n% if all of the elements of X are positive, and -Inf otherwise. Note that\n% LOG(PROD(X)) = SUM(LOG(X)),\n% so this is simply a synonym for SUM_LOG(X).\n%\n% For matrices, LOG_PROD(X) is a row vector containing the application of\n% LOG_PROD to each column. For N-D arrays, the LOG_PROD is applied to the\n% first non-singleton dimension of X.\n%\n% LOG_PROD(X,DIM) takes the product along the dimension DIM of X.\n%\n% Disciplined convex programming information:\n% LOG_PROD(X) is concave and nondecreasing in X. Therefore, when used\n% in CVX expressions, X must be concave. X must be real.\n\nnarginchk(1,2);\nif nargin == 1,\n\tcvx_optval = sum_log( X );\nelse\n\tcvx_optval = sum_log( X, dim );\nend\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/log_sum_exp.m", "content": "function y = log_sum_exp( x, dim )\n\n%LOG_SUM_EXP log(sum(exp(x))).\n% LOG_SUM_EXP(X) = LOG(SUM(EXP(X)).\n%\n% When used in a CVX model, LOG_SUM_EXP(X) causes CVX's successive\n% approximation method to be invoked, producing results exact to within\n% the tolerance of the solver. This is in contrast to LOGSUMEXP_SDP,\n% which uses a single SDP-representable global approximation.\n%\n% If X is a matrix, LOGSUMEXP_SDP(X) will perform its computations\n% along each column of X. If X is an N-D array, LOGSUMEXP_SDP(X)\n% will perform its computations along the first dimension of size\n% other than 1. LOGSUMEXP_SDP(X,DIM) will perform its computations\n% along dimension DIM.\n%\n% Disciplined convex programming information:\n% LOG_SUM_EXP(X) is convex and nondecreasing in X; therefore, X\n% must be convex (or affine).\n\nnarginchk(1,2);\nif ~isreal( x ),\n error( 'Argument must be real.' );\nend\ny = exp( x );\nif nargin == 1,\n y = sum( y );\nelse\n y = sum( y, dim );\nend\ny = log( y );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/logsumexp.m", "content": "function y = logsumexp( varargin )\r\n\r\n%LOGSUMEXP log(sum(exp(x))).\r\n% LOGSUMEXP(X) = LOG_SUM_EXP(X) = LOG(SUM(EXP(X)). We have replaced this\r\n% function with LOG_SUM_EXP to better match our function naming\r\n% conventions. Please start using it instead.\r\n\r\nwarning( 'CVX:Renamed', [ ...\r\n 'The function \"logsumexp\" has been renamed \"log_sum_exp\". Please start\\n', ...\r\n 'using the new name. The old name will be removed in a future release.' ], 1 );\r\n\r\ny = log_sum_exp( varargin{:} );\r\n\r\n% Copyright 2005-2016 CVX Research, Inc. \r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/logsumexp_sdp.m", "content": "function cvx_optval = logsumexp_sdp( x, dim, tol )\r\n\r\n%LOGSUMEXP_SDP SDP-based approximation of log(sum(exp(x))).\r\n% LOGSUMEXP_SDP(X) computes an approximation of the function\r\n% LOG(SUM(EXP(X))) using semidefinite programming techniques.\r\n% The approximation is chosen so that, to within the numerical\r\n% tolerance of the SDP solver,\r\n% Y <= LOGSUMEXP_SDP(X) <= Y + TOL\r\n% where Y = LOG(SUM(EXP(X))).\r\n%\r\n% Our specific choice of a one-sided, absolute approximation has\r\n% two important consequences. First of all, the one-sidedness insures\r\n% that constraints that utilize LOGSUMEXP_SDP are conservative; that\r\n% is, they are tighter than if they were to use LOGSUMEXP exactly.\r\n% So if the approximate disciplined convex program is feasible, so\r\n% is the original.\r\n%\r\n% Secondly, for geometric programs, the absolute tolerance TOL\r\n% translates to a *relative* tolerance of EXP(TOL) in a posynomial\r\n% constraint. That is, given a constraint\r\n% P(X) <= M(X)\r\n% where P(X) is posynomial and M(X) is monomial, the approximation\r\n% has the effect of enforcing a constraint\r\n% P(X) <= M(X)/(1+E)\r\n% for some unknown 0 <= E <= TOL, if TOL is sufficiently small.\r\n%\r\n% If X is a matrix, LOGSUMEXP_SDP(X) will perform its computations\r\n% along each column of X. If X is an N-D array, LOGSUMEXP_SDP(X)\r\n% will perform its computations along the first dimension of size\r\n% other than 1. LOGSUMEXP_SDP(X,DIM) will perform its computations\r\n% along dimension DIM.\r\n%\r\n% LOGSUMEXP_SDP(X,[],TOL) and LOGSUMEXP_SDP(X,DIM,TOL) allow you to\r\n% specify a different tolerance level TOL. The function will attempt\r\n% to select a polynomial that guarantees that\r\n% Y <= LOGSUMEXP_SDP(X) <= Y + TOL.\r\n% where Y = LOG(SUM(EXP(X))). Note that a fixed set of polynomials\r\n% have been hard-coded into this function. So if TOL is too small, an\r\n% error will result. In particular, the tightest tolerance currently\r\n% available is approximately TOL = 2.5E-006 * CEIL(LOG2(SIZE(X,DIM))).\r\n%\r\n% Disciplined convex programming information:\r\n% LOGSUMEXP_SDP(X) is convex an nondecreasing in X; therefore, X\r\n% must be convex (or affine).\r\n\r\nif ~isreal( x ),\r\n error( 'Input must be real.' );\r\nend\r\nsx = size( x );\r\n\r\nif nargin < 2 || isempty( dim ),\r\n dim = cvx_default_dimension( sx );\r\nelseif ~cvx_check_dimension( dim, true ),\r\n error( 'Second argument must be a valid dimension.' );\r\nend\r\n\r\nif nargin < 3 || isempty( tol ),\r\n tol = 0.01;\r\nelseif ~isnumeric( tol ) || length( tol ) ~= 1 || ~isreal( tol ) || tol <= 0 || tol >= 1,\r\n error( 'tol must be a number between 0 and 1, exclusuve.' );\r\nend\r\n\r\nif length( sx ) < dim,\r\n sx( end + 1 : dim ) = 1;\r\nend\r\nnx = sx( dim );\r\nif nx == 0,\r\n sx( dim ) = 1;\r\n cvx_optval = -Inf * ones( sx );\r\nelseif any( sx == 0 ),\r\n cvx_optval = zeros( sx );\r\nend\r\n\r\npersistent polynomials tolerances offsets tols_lse2 xmax_lse2 poly_lse2;\r\nif isempty( offsets ),\r\n tolerances = [ ...\r\n +1.097023849927867e-002 ...\r\n +1.721590099806229e-003 ...\r\n +2.812158802287952e-004 ...\r\n +4.429114094399135e-005 ...\r\n +7.148558948619577e-006 ...\r\n +1.231310346831937e-006 ...\r\n ];\r\n offsets = [ ...\r\n +4.587509890238436e+000 ...\r\n +6.416928175755245e+000 ...\r\n +8.229687874643302e+000 ...\r\n +1.008049537132034e+001 ...\r\n +1.191991494339686e+001 ...\r\n +1.369797783724949e+001 ...\r\n ];\r\n polynomials = { ...\r\n [+1.366158644955694e-001,+2.883850897160668e-001,+2.623847409587327e-001,+2.061297910417373e-001,+1.064845137988183e-001], ...\r\n [+7.816587775500264e-002,+1.772675324993043e-001,+1.751223611165395e-001,+1.868180367534688e-001,+2.061693656978195e-001,+1.350536359519012e-001,+4.140319049786734e-002], ...\r\n [+4.488353591809181e-002,+1.104412004313922e-001,+1.079322498484279e-001,+1.211618304290446e-001,+1.915334757023368e-001,+2.021823414978708e-001,+1.393582785497204e-001,+6.607402177632382e-002,+1.643306938125711e-002], ...\r\n [+2.814490873415288e-002,+7.107594785846445e-002,+6.206052968585951e-002,+6.721607718419953e-002,+1.457271383815143e-001,+1.945852689115283e-001,+1.756342044070035e-001,+1.342590824420419e-001,+8.195601028303283e-002,+3.284154259643590e-002,+6.499356237673634e-003], ...\r\n [+1.801637612736961e-002,+4.586559423151913e-002,+3.384999962721969e-002,+3.241317603008043e-002,+1.027247814175989e-001,+1.601733028401698e-001,+1.618047203594099e-001,+1.541310400190613e-001,+1.351534667914612e-001,+9.207809085897611e-002,+4.587132947107905e-002,+1.533534861989494e-002,+2.582945905589078e-003], ...\r\n [+1.120952456372942e-002,+2.878673733676522e-002,+1.745388744605725e-002,+1.257946442836477e-002,+6.862411666662194e-002,+1.212531261391436e-001,+1.280824998847647e-001,+1.379104300046541e-001,+1.513029046523293e-001,+1.356592949614772e-001,+9.740481865550699e-002,+5.653968254890129e-002,+2.486163130624700e-002,+7.270708398065873e-003,+1.061270861357674e-003], ...\r\n };\r\n tols_lse2 = [ ...\r\n +2.604710921123930e-003 ...\r\n +2.023606501605798e-003 ...\r\n +7.186272440111206e-004 ...\r\n +1.650184739680674e-004 ...\r\n +2.711947820394637e-005 ...\r\n +6.626536813461173e-006 ...\r\n ];\r\n xmax_lse2 = [ ...\r\n +3.016052268759351e+000 ...\r\n +3.147392938371973e+000 ...\r\n +3.646024500530143e+000 ...\r\n +4.380570181812147e+000 ...\r\n +5.293529886795310e+000 ...\r\n +5.988203932237162e+000 ...\r\n ];\r\n poly_lse2 = { ...\r\n [+8.159111798406757e-002,-2.088766265150633e-001,+2.184646092892881e-001,+1.371376204482131e+000,+1.556101674388225e+000], ...\r\n [+3.334630057313453e-004,-1.060375441845846e-002,+9.715435406796991e-002,-2.096639262924454e-001,+2.088580308017964e-001,+1.447390559617362e+000,+1.615947818063521e+000], ...\r\n [+6.785143656818839e-003,+2.461201556871129e-002,-3.880975391764840e-002,-8.177792840262915e-002,+1.971962632643551e-001,-1.977691864994194e-001,+1.556732730938031e-001,+1.731373759332839e+000,+1.849459541179112e+000], ...\r\n [+1.750842286021084e-002,+1.111985771776053e-002,-9.551682490920249e-002,+2.838017966662204e-002,+1.383678902923077e-001,-1.739700557712566e-001,+1.544268632772164e-001,-1.573031365076512e-001,+1.194780681395583e-001,+2.135484657435186e+000,+2.202759265472971e+000], ...\r\n [+2.654151273601881e-002,-1.332036618151814e-002,-1.163329680305297e-001,+1.166465460844204e-001,+8.891035020671029e-002,-1.666006712102975e-001,+1.126715728840250e-001,-1.311132963495887e-001,+1.602149050147826e-001,-1.258789281605399e-001,+6.955806786045883e-002,+2.620468791080553e+000,+2.651791472377042e+000], ...\r\n [+4.767691370849323e-002,-6.696121312219248e-002,-1.342731459018708e-001,+2.436059791387181e-001,+4.093723652936038e-002,-2.132048441979625e-001,+6.860071867460910e-002,-3.577798568743423e-002,+1.436202524622697e-001,-1.720098314357508e-001,+1.328392919340422e-001,-8.719393191264979e-002,+4.466662307495772e-002,+2.979073449755230e+000,+2.996611030953293e+000], ...\r\n };\r\nend\r\n\r\n%\r\n% Determine the computation method.\r\n%\r\n\r\nnlevs = ceil(log2(nx));\r\ndectol = - nlevs * log( 1 - 2 * tolerances );\r\nlintol = - log( 1 - nx * tolerances );\r\nls2tol = + nlevs * tols_lse2;\r\ndegs = [ min([find(ls2tol<=tol),Inf]), min([find(dectol<=tol),Inf]), min([find(lintol<=tol),Inf]) ];\r\nif all( isinf( degs ) ),\r\n tmax = min( [ lintol(end), ls2tol(end), dectol(end) ] );\r\n error( 'A polynomial of required accuracy (%g) has not been supplied.\\nConsider raising the tolerance to %g or greater to proceed.', tol, tmax );\r\nend\r\nnnx = nx;\r\nnpairs = 0;\r\nfor k = 1 : nlevs,\r\n npairs = npairs + floor( 0.5 * nnx );\r\n nnx = ceil( 0.5 * nnx );\r\nend\r\ncplx = ( 0.5 .* ( degs + 2 ) .* ( degs + 3 ) + [ 4, 2, 2 ] ) .* [ npairs, 2 * npairs, nx ];\r\n[ cmin, dndx ] = min( cplx ); %#ok\r\nuse_lse2 = dndx == 1;\r\nif use_lse2,\r\n xoff = xmax_lse2(degs(1));\r\n p = poly_lse2{degs(1)};\r\nelse\r\n xoff = offsets(degs(dndx));\r\n p = polynomials{degs(dndx)};\r\n if dndx == 3, npairs = 1; end\r\nend\r\n\r\n%\r\n% Quick exits\r\n%\r\n\r\nif nx == 1,\r\n cvx_optval = x;\r\n return;\r\nelseif any( sx == 0 ),\r\n sx( dim ) = 1;\r\n cvx_optval = -Inf * ones( sx );\r\n return\r\nend\r\n\r\n%\r\n% Permute the matrix, if needed, so the geometric mean can be taken\r\n% along the first dimension.\r\n%\r\n\r\nif dim > 1 && any( sx( 1 : dim - 1 ) > 1 ),\r\n perm = [ dim, 1 : dim - 1, dim + 1 : length( sx ) ];\r\n x = permute( x, perm );\r\n sx = sx( perm );\r\n dim = 1;\r\nelse\r\n perm = [];\r\nend\r\nnv = prod( sx ) / nx;\r\nx = reshape( x, nx, nv );\r\n\r\n%\r\n% Perform the computation.\r\n%\r\n\r\ncvx_begin sdp separable\r\n epigraph variable y( 1, nv )\r\n if npairs > 1,\r\n variable xtemp( npairs - 1, nv );\r\n xq = reshape( [ x ; xtemp ], 2, npairs * nv );\r\n yq = reshape( [ xtemp ; y ], 1, npairs * nv );\r\n else\r\n xq = x;\r\n yq = y;\r\n end\r\n if use_lse2,\r\n xq = cvx_accept_convex( xq );\r\n variables w( 1, npairs * nv ) v( 1, npairs * nv )\r\n abs( [0.5,-0.5]*xq ) <= w + v; %#ok\r\n w <= xoff; %#ok\r\n v >= 0; %#ok\r\n poly_env( p, w / ( 0.5 * xoff ) - 1 ) + v + [0.5,0.5]*xq <= yq; %#ok\r\n else\r\n xy = xq - ones(size(xq,1),1) * yq;\r\n xy = max( xy, - xoff );\r\n xy = cvx_accept_convex( xy );\r\n sum( poly_env( p, xy / ( 0.5 * xoff ) + 1 ), 1 ) <= 1; %#ok\r\n end\r\ncvx_end\r\n\r\n%\r\n% Reverse the reshaping and permutation steps\r\n%\r\n\r\nsx( dim ) = 1;\r\ncvx_optval = reshape( cvx_optval, sx );\r\nif ~isempty( perm ),\r\n cvx_optval = ipermute( cvx_optval, perm );\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc. \r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/matrix_frac.m", "content": "function z = matrix_frac( x,Y )\n\n%MATRIX_FRAC Matrix fractional function.\n% MATRIX_FRAC(x,Y), where Y is a square matrix and x is a vector of the\n% same size, computes x'*(inv(Y)*x) if Y is Hermitian positive definite, and\n% +Inf otherwise.\n%\n% An error results if Y is not a square matrix, or the size of\n% the vector x does not match the size of matrix Y.\n%\n% Disciplined convex programming information:\n% MATRIX_FRAC is convex and nonmonotonic (at least with respect to\n% elementwise comparison), so its argument must be affine.\n\nnarginchk(2,2);\nif ndims( Y ) > 2 || size( Y, 1 ) ~= size( Y, 2 ), %#ok\n error( 'Second argument must be a square matrix.' );\nend\nerr = Y - Y';\nY = 0.5 * ( Y + Y' );\nif norm( err, 'fro' ) > 8 * eps * norm( Y, 'fro' ),\n z = Inf;\nelse\n [R,p] = chol(Y);\n if p > 0,\n [V,D] = eig(full(Y));\n D = diag(D);\n if any( D <= 0 )\n z = Inf;\n else\n z = V' * x;\n z = z' * ( D .\\ z );\n end\n else\n z = R' \\ x;\n z = z' * z;\n end\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/norm_largest.m", "content": "function cvx_optval = norm_largest( x, k )\n\n%NORM_LARGEST Sum of the k largest magnitudes of a vector.\n% NORM_LARGEST( X, k ) computes the 'largest-k' norm; that is, it computes\n% the sum of the magnitudes of the k largest elements in X. X must\n% be a vector, and k must be a real scalar.\n%\n% Disciplined convex programming information:\n% NORM_LARGEST is convex and nonmonotonic of X, though it is monotonic for\n% positive values of X. So when used in CVX expressions, X must be affine,\n% monomial, or posynomial. k must be a real scalar constant.\n\nnarginchk(2,2);\nif ~any( size( x ) ~= 1 ),\n error( 'The first argument must be a vector.' );\nelseif ~isnumeric( k ) || ~isreal( k ) || length( k ) ~= 1,\n error( 'Third argument must be a scalar.' );\nelse\n cvx_optval = sum_largest( abs( x ), k );\nend\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/norm_nuc.m", "content": "function z = norm_nuc( x )\n\n%NORM_NUC Nuclear norm of a matrix.\n% NORM_NUC(X) = SUM(SVD(X)). X must be a 2-D matrix, real or complex.\n%\n% Disciplined convex programming information:\n% NORM_NUC(X) is convex and nonmontonic in X, so X must be affine.\n\nnarginchk(1,1);\nz = sum(svd(x));\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/norms.m", "content": "function cvx_optval = norms( x, p, dim )\n\n%NORMS Computation of multiple vector norms.\n% NORMS( X ) provides a means to compute the norms of multiple vectors\n% packed into a matrix or N-D array. This is useful for performing\n% max-of-norms or sum-of-norms calculations.\n%\n% All of the vector norms, including the false \"-inf\" norm, supported\n% by NORM() have been implemented in the NORMS() command.\n% NORMS(X,P) = sum(abs(X).^P).^(1/P)\n% NORMS(X) = NORMS(X,2).\n% NORMS(X,inf) = max(abs(X)).\n% NORMS(X,-inf) = min(abs(X)).\n% If X is a vector, these computations are completely identical to\n% their NORM equivalents. If X is a matrix, a row vector is returned\n% of the norms of each column of X. If X is an N-D matrix, the norms\n% are computed along the first non-singleton dimension.\n%\n% NORMS( X, [], DIM ) or NORMS( X, 2, DIM ) computes Euclidean norms\n% along the dimension DIM. NORMS( X, P, DIM ) computes its norms\n% along the dimension DIM.\n%\n% Disciplined convex programming information:\n% NORMS is convex, except when P<1, so an error will result if these\n% non-convex \"norms\" are used within CVX expressions. NORMS is\n% nonmonotonic, so its input must be affine.\n\n%\n% Check second argument\n%\n\nnarginchk(1,3);\nif nargin < 2 || isempty( p ),\n p = 2;\nelseif ~isnumeric( p ) || numel( p ) ~= 1 || ~isreal( p ),\n error( 'Second argument must be a real number.' );\nelseif p < 1 || isnan( p ),\n error( 'Second argument must be between 1 and +Inf, inclusive.' );\nend\n \n%\n% Check third argument\n%\n\nsx = size( x );\nif nargin < 3 || isempty( dim ),\n dim = cvx_default_dimension( sx );\nelseif ~cvx_check_dimension( dim, false ),\n error( 'Third argument must be a valid dimension.' );\nelseif isempty( x ) || dim > length( sx ) || sx( dim ) == 1,\n p = 1;\nend\n\n%\n% Compute the norms\n%\n\nswitch p,\n case 1,\n cvx_optval = sum( abs( x ), dim );\n case 2,\n cvx_optval = sqrt( sum( x .* conj( x ), dim ) );\n case Inf,\n cvx_optval = max( abs( x ), [], dim );\n otherwise,\n cvx_optval = sum( abs( x ) .^ p, dim ) .^ ( 1 / p );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/norms_largest.m", "content": "function cvx_optval = norms_largest( x, k, dim )\n\n%NORMS_LARGEST Computation of multiple norm_largest() norms.\n% NORMS_LARGEST( X, K, DIM ) provides a means to compute the largest-k\n% norms of multiple vectors packed into a matrix or N-D vector. This is\n% useful for performing max-of-norms or sum-of-norms calculations.\n%\n% If DIM is omitted, the norms are computed along the first non-singleton\n% dimension. \n%\n% See NORM_LARGEST.\n%\n% Disciplined convex programming information:\n% NORMS_LARGEST is convex and non-monotonic, so its input must be affine.\n\nnarginchk(2,3);\nsx = size( x );\n\n%\n% Check second argument\n%\n\nif ~isnumeric( k ) || ~isreal( k ) || length( k ) ~= 1,\n error( 'Second argument must be a real scalar.' );\nend\n\n%\n% Check third argument\n%\n\nif nargin < 3 || isempty( dim ),\n dim = cvx_default_dimension( sx );\nelseif ~cvx_check_dimension( dim, false ),\n error( 'Third argument must be a valid dimension.' );\nend\n\n%\n% Perform computation\n%\n\ncvx_optval = sum_largest( abs( x ), k, dim );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/poly_env.m", "content": "function y = poly_env( p, x )\n\n%POLY_ENV Evaluate the convex or concave envelope of a polynomial.\n% POLY_ENV( P, X ) uses a semidefinite program to compute the value of the\n% convex or concave envelope of the polynomial represented by the vector\n% P. The format of the vector P is identical to that required by POLYVAL,\n% with two additional restrictions. First, the elements of P must be real\n% and finite. Second, the length of P must 0, 2, or odd (1,3,5,...)\n%\n% If the polynomial described by P is convex or concave, then a call to\n% POLY_ENV( P, X ) produces the same result as POLYVAL( P, X ).\n%\n% POLY_ENV looks at the first nonzero element of P (presumably, but not\n% necessarily, P(1)) to determine if a convex or concave envelope is to\n% be selected. If P(1)>0, then a convex envelope is produced---i.e., the\n% function that is the tightest convex lower bound for POLYVAL(P,X).\n% Otherwise, a concave envelope is produced---the function that is the\n% tightest concave upper bound for POLYVAL(P,X).\n%\n% If the degree N of P is odd---except for the special case N==1---no\n% proper convex/concave envelope exists. Therefore, POLY_ENV returns an\n% error in such cases.\n%\n% If X is an array, the result will be computed elementwise.\n%\n% Disciplined convex programming information:\n% POLY_ENV(P,X) is convex or concave and nonmotonic in X; therefore,\n% in CVX expressions, X must be affine, unless the polynomial \n% described by P has a degree of 0 or 1. P must be constant.\n\n%\n% Check the polynomial\n%\n\nsp = size( p );\nif isempty( p ),\n p = zeros( 1, 0 );\nelseif ~isa( p, 'double' ) || ~isreal( p ) || length( sp ) > 2 || ~any( sp == 1 ),\n error( 'First argument must be a non-empty real vector.' );\nelseif any( isnan( p ) | isinf( p ) ),\n error( 'Inf and NaN not accepted here.' );\nend\nn = prod( sp );\nif n > 2 && rem( n, 2 ) == 0,\n error( 'The length of the vector p must be odd.' );\nend\n\n%\n% Check the second argument\n%\n\nif n > 1 && ( ~cvx_isaffine( x ) || ~isreal( x ) ),\n error( 'The second argument must be real and affine.' );\nend\n\n%\n% Handle the special cases\n%\n\nsx = size( x );\nndxs = find( p );\nif isempty( ndxs ),\n y = zeros( sx );\n return\nelse\n for k = ndxs(:)',\n pt = p( k : end );\n if ~any( isinf( pt ./ pt(1) ) ),\n p = pt;\n break;\n end\n end\nend\nn = length( p );\nswitch n,\n case 0,\n y = zeros(sx);\n return\n case 1,\n y = p(1) * ones(sx);\n return\n case 2,\n y = p(1) * x + p(2);\n return\n case 3,\n % Quadratic\n b2a = p(2) ./ ( 2 * p(1) );\n y = p(1) * ( square( x + b2a ) - b2a * b2a ) + p(3);\n return\n otherwise,\n if all( p(2:end) == 0 ),\n y = p(1) * ( x .^ (n-1) ) + p(end);\n return\n end\nend\n\n%\n% Build and solve the SDP\n%\n\ndegr = n - 1;\ndeg2 = 0.5 * degr + 1;\nnv = prod( sx );\npsign = sign(p(1));\np = psign * reshape( p, 1, n );\ncvx_begin sdp separable\n epigraph variable y(sx);\n variable P(deg2,deg2,sx) hankel;\n P >= 0; %#ok\n 1 == P(1,1,:); %#ok\n x == reshape( P(2,1,:), sx ); %#ok\n y == reshape( p(end:-1:1) * [ reshape( P(1,:,:), deg2, nv ) ; reshape( P(2:end,end,:), deg2-1, nv ) ], sx ); %#ok\ncvx_end\n\ny = cvx_optval * psign;\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/polyenv.m", "content": "function y = polyenv( varargin )\n\n%POLYENV Evaluate the convex or concave envelope of a polynomial.\n% We have replaced this function with POLY_ENV to better match our\n% function naming conventions. Please start using it instead.\n\nwarning( 'CVX:Renamed', [ ...\n 'The function \"polyenv\" has been renamed \"poly_env\". Please start using\\n', ...\n 'the new name. The old name will be removed in a future release.' ], 1 ); \n \ny = poly_env( varargin{:} );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/polyval_trig.m", "content": "function y = polyval_trig( p, x )\n\n%POLYVAL_TRIG Evaluate a trigonometric polynomial.\n% Y = POLYVAL_TRIG(P,X) returns the value of a trigonometric polynomial P\n% evaluated at X. P is a vector of length N+1 whose elements are the\n% coefficients of the polynomial in descending powers.\n%\n% Y = REAL(P(1)*W^N + P(2)*W^(N-1) + ... + P(N)*W + P(N+1))\n% \n% where W = EXP(-SQRT(-1)*X). For real X, this equals\n%\n% Y = REAL(P(1))*COS(W*N)+IMAG(P(1))*SIN(W*N) + ...\n% REAL(P(2))*COS(W*(N-1))+IMAG(P(2))*SIN(W*(N-1)) + ...\n% ... + REAL(P(N))*COS(W) + IMAG(P(N))*SIN(W) + REAL(P(N+1)).\n%\n% Note that IMAG(P(N+1)) is ignored. If X is a matrix or vector, the\n% polynomial is evaluated at all points in X.\n%\n% Disciplined convex programming information:\n% POLYVAL_TRIG is linear in P and nonconvex/nonconcave in X.\n% Therefore, when used in CVX specifications, P must be affine and\n% X must be constant. Certain values of X may allow P to be convex\n% or concave as well, but not so for all values of X.\n\nsp = size( p );\nif isempty( p ),\n p = zeros( 1, 0 );\nelseif length( sp ) > 2 || ~any( sp == 1 ),\n error( 'First argument must be a vector.' );\nend\nn = length( p );\nsx = size(x);\n\nif ~cvx_isconstant( x ),\n error( 'Second argument must be constant.' );\nelse\n x = cvx_constant( x );\nend\n\nnx = numel( x );\nxx = reshape( x, nx, 1 );\n[ ii, jj, vv ] = find( p );\nnv = length( vv );\nvv = reshape( vv, nv, 1 );\nxx = xx * reshape( n - ( ii + jj - 1 ), 1, nv );\nxx = exp( sqrt(-1) * xx );\ny = real( xx ) * real( vv ) + imag( xx ) * imag( vv );\ny = reshape( y, sx );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/pos.m", "content": "function y = pos( x )\n\n% POS Positive part.\n% POS(X) = MAX(X,0). X must be real.\n%\n% Disciplined convex programming information:\n% POS(X) is convex and nondecreasing in X. Thus when used in CVX\n% expressions, X must be convex (or affine).\n\nnarginchk(1,1);\nif ~isreal( x ),\n\n\terror( 'Argument must be real.' );\n\t\nelse\n\n\ty = max( x, 0 );\n\nend\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/pow_abs.m", "content": "function y = pow_abs( x, p )\n\n%POW_POS Power of absolute value.\n% POW_POS(X,P) = ABS(X).^P. \n% P must be real and greater than or equal to one.\n%\n% Disciplined convex programming information:\n% POW_ABS(X,P) is convex and nonmonotonic, so X must be affine.\n% P must be constant, and its elements must be greater than or\n% equal to one. X may be complex.\n\nnarginchk(2,2);\nif ~isnumeric( x ) || ~isnumeric( p ),\n error( 'Arguments must be numeric.' );\nelseif ~isreal( p ),\n error( 'Second argument must be real.' );\nelseif any( p(:) < 1 ),\n error( 'Second argument must be greater than or equal to one.' );\nend\ny = abs(x).^p;\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/pow_p.m", "content": "function y = pow_p( x, p )\n\n%POW_P Positive branch of the power function.\n% POW_P(X,P) computes a convex or concave branch of the power function:\n% P < 0: POW_P(X,P) = X.^P if X > 0, +Inf otherwise\n% 0 <= P < 1: POW_P(X,P) = X.^P if X >= 0, -Inf otherwise\n% 1 <= P : POW_P(X,P) = X.^P if X >= 0, +Inf otherwise\n% Both P and X must be real.\n%\n% Disciplined convex programming information:\n% The geometry of POW_P(X,P) depends on the precise value of P,\n% which must be a real constant:\n% P < 0: convex and nonincreasing; X must be concave.\n% 0 <= P < 1: concave and nondecreasing; X must be concave.\n% 1 <= P : convex and nonmonotonic; X must be affine.\n% In all cases, X must be real.\n\nnarginchk(2,2);\nif ~isnumeric( x ) || ~isreal( x ) || ~isnumeric( p ) || ~isreal( p ),\n error( 'Arguments must be real.' );\nend\ny = x .^ p;\ny( x < 0 & ( p >= 0 & p < 1 ) ) = -Inf;\ny( x < 0 & ( p < 0 | p >= 1 ) ) = +Inf;\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/pow_pos.m", "content": "function y = pow_pos( x, p )\n\n%POW_POS Power of positive part.\n% POW_POS(X,P) = POS(X).^P = MAX(X,0).^P.\n% Both P and X must be real, and P must be greater than or equal to 1.\n%\n% Disciplined convex programming information:\n% POW_POS(X,P) is convex and nondecreasing in X; so when used in CVX\n% expressions, X must be convex. P must be constant, real, and\n% greater than or equal to 1.\n\nnarginchk(2,2);\nif ~isnumeric( x ) || ~isreal( x ) || ~isnumeric( p ) || ~isreal( p ),\n error( 'Arguments must be real.' );\nelseif any( p(:) <= 1 ),\n error( 'Second argument must be greater than or equal to 1.\\nFor other exponents, use POW_P instead.', 1 ); %#ok\nend\ny = max(x,0).^p;\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/prod_inv.m", "content": "function cvx_optval = prod_inv( x, dim, p )\n\n%PROD_INV inverse of the product of a positive vector.\n% For a real vector, matrix, or X, PROD_INV(X) returns 1.0 ./ PROD(X) if\n% the elements of X are all positive, and +Inf otherwise.\n%\n% For matrices, PROD_INV(X) is a row vector containing the inverse\n% product of each column of X. For N-D arrays, PROD_INV(X) is an array of\n% inverse products taken along the first non-singleton dimension of X.\n%\n% PROD_INV(X,DIM) takes inverse products along the dimension DIM of X.\n%\n% PROD_INV(X,DIM,P), where P is a positive real constant, computes\n% PROD_INV(X).^P. This is slightly more efficient than the equivalent\n% POW_POS(PROD_INV(X),P).\n%\n% Disciplined convex programming information:\n% PROD_INV(X) is convex and nonincreasing in X; therefore, when used\n% in CVX specifications, its argument must be concave or affine.\n\nnarginchk(1,3);\nif ~isreal( x ), \n error( 'First argument must be real.' ); \nelseif nargin < 2,\n dim = cvx_default_dimension( size( x ) );\nelseif ~cvx_check_dimension( dim ),\n error( 'Second argument must be a positive integer.' );\nend\nif nargin < 2,\n p = 1;\nelseif ~isnumeric( p ) || ~isreal( p ) || numel( p ) ~= 1 || p <= 0,\n error( 'Third argument must be a positive scalar.' );\nend\ntt = any( x < 0, dim );\ncvx_optval = prod( x, dim ) .^ (-p);\ncvx_optval(tt) = +Inf;\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/quad_form.m", "content": "function y = quad_form( x, Q, v, w )\n\n%QUAD_FORM quadratic form.\n% QUAD_FORM(x,Q) is real(x'*Q*x) = x'*((Q+Q')/2)*x.\n% QUAD_FORM(x,Q,v,w) is real(x'*(Q*x+v)+w).\n%\n% x must be a row or column vector, and Q must either be a scalar or\n% a square matrix with the same number of rows as x. If supplied, v must\n% be a scalar or a vector of the same size as x, and w must be a scalar.\n% \n% NOTE: The use of QUAD_FORM can often be replaced by a call to NORM. For\n% example, if Q is positive definite, then the constraint\n% quad_form(x,Q) <= 1\n% is equivalent to\n% norm(sqrtm(Q)*x) <= 1\n% Generally speaking, the NORM version will be more reliable and more\n% accurate, so we encourage you to make similar conversions whenever\n% possible. We *strongly* discourage the QP-era practice of converting\n% NORM expressions into quadratic forms. \n%\n% Disciplined convex programming information:\n% QUAD_FORM(x,Q,v,w) is neither convex nor concave in x and (Q,v)\n% jointly, so at least one of the two must be constant.\n%\n% If (Q,v) is constant, then QUAD_FORM is convex if Q is positive\n% semidefinite, and concave if Q is negative semidefinite. An error \n% is generated if Q is indefinite (unless x is also constant). \n% QUAD_FORM is nonmonotonic in x, so x must be affine.\n% \n% If x is constant, then QUAD_FORM is affine in Q, v, and w. The\n% signs of x will govern whether the elements of Q, v, and w may\n% be convex, concave, or affine.\n\nnarginchk(2,4);\nsx = size( x );\nif length( sx ) ~= 2 || all( sx ~= 1 ),\n error( 'The first argument must be a vector.' );\nelse\n sx = prod( sx );\nend\nif ndims( Q ) > 2 || size( Q, 1 ) ~= size( Q, 2 ), %#ok\n error( 'The second argument must be a scalar or a square matrix.' );\nelseif all( size( Q, 1 ) ~= [ 1, sx ] ),\n error( 'The size of Q is incompatible with the size of x.' );\nend\nif nargin < 3,\n v = 0;\nelseif ndims( v ) > 2 || all( size( v ) ~= 1 ), %#ok\n error( 'The third argument must be a vector.' );\nelseif all( numel( v ) ~= [ 1, sx ] ),\n error( 'The size of v is incompatible with the size of x.' );\nend\nif nargin < 4,\n w = 0;\nelseif numel( w ) > 1,\n error( 'The fourth argument must be a real scalar.' );\nend\nif sx == 0,\n y = real( w );\nelse\n x = x( : );\n v = v( : );\n y = real( x' * ( Q * x + v ) + w );\nend\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/quad_over_lin.m", "content": "function z = quad_over_lin( x, y, dim )\n\n%QUAD_OVER_LIN Sum of squares over linear.\n% Z=QUAD_OVER_LIN(X,Y), where X is a vector and Y is a scalar, is equal to\n% SUM(ABS(X).^2)./Y if Y is positive, and +Inf otherwise. Y must be real.\n%\n% If X is a matrix, QUAD_OVER_LIN(X,Y) is a row vector containing the values\n% of QUAD_OVER_LIN applied to each column. If X is an N-D array, the operation\n% is applied to the first non-singleton dimension of X.\n%\n% QUAD_OVER_LIN(X,Y,DIM) takes the sum along the dimension DIM of X.\n% A special value of DIM == 0 is accepted here, which is automatically\n% replaced with DIM == NDIMS(X) + 1. This has the effect of eliminating\n% the sum; thus QUAD_OVER_LIN( X, Y, NDIMS(X) + 1 ) = ABS( X ).^2 ./ Y.\n%\n% In all cases, Y must be compatible in the same sense as ./ with the squared\n% sum; that is, Y must be a scalar or the same size as SUM(ABS(X).^2,DIM).\n%\n% Disciplined convex programming information:\n% QUAD_OVER_LIN is convex, nonmontonic in X, and nonincreasing in Y.\n% Thus when used with CVX expressions, X must be convex (or affine)\n% and Y must be concave (or affine).\n\n%\n% Check arguments\n%\n\nnarginchk(2,3);\nif ~isreal( y ),\n error( 'Second argument must be real.' );\nelseif nargin < 3 || isempty( dim ),\n dim = cvx_default_dimension( size( x ) );\nelseif ~cvx_check_dimension( dim, true ),\n error( 'Third argument, if supplied, must be a positive integer.' );\nelseif dim == 0,\n dim = ndims( x ) + 1;\nend\n\n%\n% Perform calculation\n%\n\nz = sum_square_abs( x, dim );\nif length( y ) ~= 1 && ~isequal( size( z ), size( y ) ),\n error( 'Input size mismatch.' );\nend\ntemp = y <= 0;\ninf_fix = any( temp );\nif inf_fix,\n y( temp ) = 1;\nend\nz = z ./ y;\nif inf_fix,\n z( temp ) = +Inf;\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/quad_pos_over_lin.m", "content": "function z = quad_pos_over_lin( x, y, dim )\n\n%QUAD_POS_OVER_LIN Sum of squares of positives over linear.\n% Z=QUAD_POS_OVER_LIN(X,Y), where X is a vector and Y is a scalar, is equal to\n% SUM(MAX(X,0).^2)./Y if Y is positive, and +Inf otherwise. Both X and Y must\n% be real.\n%\n% For matrices, QUAD_POS_OVER_LIN(X,Y) is a row vector containing the \n% application of QUAD_POS_OVER_LIN to each column. For N-D arrays, the\n% operation is applied to the first non-singleton dimension of X.\n%\n% QUAD_POS_OVER_LIN(X,Y,DIM) takes the sum along the dimension DIM of X. \n% A special value of DIM == 0, is accepted here, which is automatically\n% replaced with DIM == NDIMS(X) + 1. This has the effect of eliminating\n% the sum; thus QUAD_POS_OVER_LIN( X, Y, NDIMS(X) + 1 ) = MAX(X,0).^2./Y.\n%\n% In all cases, both X and Y must be real, and Y must either be a scalar \n% or a matrix of the same size as SUM(X,DIM).\n%\n% Disciplined convex programming information:\n% QUAD_POS_OVER_LIN is convex, nondecreasing in X, and nonincreasing \n% in Y. Thus when used with CVX expressions, X must be convex (or \n% affine) and Y must be concave (or affine).\n\n%\n% Check arguments\n%\n\nnarginchk(2,3);\nif ~isreal( x ),\n error( 'First argument must be real.' ); \nelseif ~isreal( y ),\n error( 'Second argument must be real.' ); \nelseif nargin < 3 || isempty( dim ),\n dim = cvx_default_dimension( size( x ) );\nelseif ~cvx_check_dimension( dim ),\n error( 'Third argument, if supplied, must be a positive integer.' );\nend\n\n%\n% Perform calculation\n%\n\nz = quad_over_lin( max( x, 0 ), y, dim );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/rel_entr.m", "content": "function z = rel_entr( x, y )\n\n%REL_ENTR Scalar relative entropy.\n% REL_ENTR(X,Y) returns an array of the same size as X+Y with the \n% relative entropy function applied to each element:\n% { X.*LOG(X./Y) if X > 0 & Y > 0,\n% REL_ENTR(X,Y) = { 0 if X == 0 & Y >= 0,\n% { +Inf otherwise.\n% X and Y must either be the same size, or one must be a scalar. If X and\n% Y are vectors, then SUM(REL_ENTR(X,Y)) returns their relative entropy.\n% If they are PDFs (that is, if X>=0, Y>=0, SUM(X)==1, SUM(Y)==1) then\n% this is equal to their Kullback-Liebler divergence SUM(KL_DIV(X,Y)).\n% -SUM(REL_ENTR(X,1)) returns the entropy of X.\n%\n% Disciplined convex programming information:\n% REL_ENTR(X,Y) is convex in both X and Y, nonmonotonic in X, and\n% nonincreasing in Y. Thus when used in CVX expressions, X must be\n% real and affine and Y must be concave. The use of REL_ENTR(X,Y) in\n% an objective or constraint will effectively constrain both X and Y \n% to be nonnegative, hence there is no need to add additional\n% constraints X >= 0 or Y >= 0 to enforce this.\n\nnarginchk(2,2);\nif ~isreal( x ) || ~isreal( y ),\n error( 'Arguments must be real.' );\nend\nt1 = x < 0 | y <= 0;\nt2 = x == 0 & y >= 0;\nx = max( x, realmin );\ny = max( y, realmin );\nz = x .* log( x ./ y );\nz( t1 ) = +Inf;\nz( t2 ) = 0;\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/sigma_max.m", "content": "function z = sigma_max( x )\n\n%SIGMA_MAX Maximum singular value.\n% SIGMA_MAX(X) returns the maximum singular value of X. X must be a 2-D\n% matrix, real or complex. SIGMA_MAX(X) is synonymous with NORM(X).\n%\n% Disciplined convex programming information:\n% SIGMA_MAX(X) is convex and nonmontonic in X, so X must be affine.\n\nnarginchk(1,1);\nz = norm( x, 2 );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/square_/square.m", "content": "function y = square( x )\n\n%SQUARE Square.\n% SQUARE(X) is an array of the same size as X, whose elements are the\n% squares of the elements of X.\n%\n% Disciplined convex programming information:\n% If X is real, then SQUARE(X) is convex and nonmonotonic in X. If X\n% is complex, then SQUARE(X) is neither convex nor concave. Thus when\n% when use in CVX expressions, X must be real and affine.\n\nnarginchk(1,1);\ny = x .* x;\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/square_abs.m", "content": "function y = square_abs( x )\n\n%SQUARE_ABS Square of absolute value.\n% For real X, SQUARE_ABS(X) produces the same result as SQUARE(X); that\n% is, it squares the elements of X. For complex X, SQUARE_ABS(X) returns\n% a real array whose elements are the squares of the magnitudes of the\n% elements of X; that is, SQUARE_ABS(X) = CONJ(X).*X.\n%\n% Disciplined convex programming information:\n% SQUARE_ABS(X) is convex and nonmonotonic in X. Thus when used in \n% CVX expressions, X must be affine.\n\nnarginchk(1,1);\ny = conj( x ) .* x;\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/square_pos.m", "content": "function y = square_pos( x )\n\n%SQUARE_POS Square of positive part.\n% SQUARE_POS(X) is the square of the postive parts of the elements of X;\n% i.e., SQUARE_POS(X)=MAX(X,0).^2. X must be real.\n%\n% Disciplined convex programming information:\n% SQUARE_POS(X) is convex and nondecreasing in X. Thus when used in\n% CVX expressions, X must be convex (or affine).\n\nnarginchk(1,1);\nif ~isreal( x ), \n error( 'Argument must be real.' ); \nend\n\ny = square( max( x, 0 ) );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/sum_largest.m", "content": "function cvx_optval = sum_largest( x, k, dim )\n\n%SUM_LARGEST Sum of the largest k values of a vector.\n% For a real vector X and an integer k between 1 and length(X) inclusive,\n% y = SUM_LARGEST(X,k) is the sum of the k largest elements of X; e.g.,\n% temp = sort( x )\n% y = sum( temp( 1 : k ) )\n% If k=1, then SUM_LARGEST(X,k) is equivalent to MAX(X); if k=length(X),\n% then SUM_LARGEST(X,k) is equivalent to SUM(X).\n%\n% Both X and k must be real, and k must be a scalar. But k is not, in\n% fact, constrained to be an integer between 1 and length(X); the\n% function is extended continuously and logically to all real k. For\n% example, if k <= 0, then SUM_LARGEST(X,k)=0. If k > length(X), then\n% SUM_LARGEST(X,k)=SUM(X). Non-integer values of k interpolate linearly\n% between their integral neighbors.\n%\n% For matrices, SUM_LARGEST(X,k) is a row vector containing the\n% application of SUM_LARGEST to each column. For N-D arrays, the\n% SUM_LARGEST operation is applied to the first non-singleton dimension\n% of X.\n%\n% SUM_LARGEST(X,k,DIM) performs the operation along dimension DIM of X.\n%\n% Disciplined convex programming information:\n% SUM_LARGEST(X,...) is convex and nondecreasing in X. Thus, when\n% used in CVX expressions, X must be convex (or affine). k and DIM\n% must both be constant.\n\n%\n% Check arguments\n%\n\nnarginchk(2,3);\nif ~isreal( x ),\n error( 'First argument must be real.' );\nelseif ~isnumeric( k ) || ~isreal( k ) || length( k ) ~= 1,\n error( 'Second argument must be a real scalar.' );\nelseif nargin < 3 || isempty( dim ),\n dim = cvx_default_dimension( size( x ) );\nelseif ~cvx_check_dimension( dim, false ),\n error( 'Third argument, if supplied, must be a positive integer.' );\nend\n\n%\n% Determine output size\n%\n\nsx = size( x );\nnd = max( dim, length( sx ) );\nsx = [ sx, ones( 1, dim - nd ) ];\nsy = sx;\nsy( dim ) = 1;\n\n%\n% Compute results\n%\n\nif k <= 0,\n\n cvx_optval = zeros( sy );\n\nelseif k <= 1,\n\n cvx_optval = k * max( x, [], dim );\n\nelseif k >= sx( dim ),\n\n cvx_optval = sum( x, dim );\n\nelse\n\n ck = ceil( k );\n x = sort( x, dim );\n ndxs = cell( 1, nd );\n [ ndxs{:} ] = deal( ':' );\n ndxs{ dim } = size( x, dim ) - ( 0 : ck - 1 );\n x = x( ndxs{ : } );\n if k ~= ck,\n ndxs{ dim } = ck;\n x( ndxs{ : } ) = ( k - floor( k ) ) * x( ndxs{ : } );\n end\n cvx_optval = sum( x, dim );\n\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/sum_log.m", "content": "function y = sum_log( x, dim )\n\n%SUM_LOG Sum of logarithms.\n% For vectors, SUM_LOG(X) is the sum of the logarithms of the elements of\n% the vector; i.e., SUM(LOG(X)). If any of the elements of the vector are\n% nonnegative, then the result is -Inf.\n%\n% For matrices, SUM_LOG(X) is a row vector containing the application of\n% SUM_LOG to each column. For N-D arrays, the SUM_LOG is applied to the\n% first non-singleton dimension of X.\n%\n% SUM_LOG(X,DIM) takes the sum along the dimension DIM of X.\n%\n% SUM_LOG(X) could also be written SUM(LOG(X)). However, this version\n% should be more efficient, because it involves only one logarithm.\n%\n% Disciplined convex programming information:\n% SUM_LOG(X) is concave and nondecreasing in X. Therefore, when used\n% in CVX expressions, X must be concave. X must be real.\n\nnarginchk(1,2);\nif ~isreal( x ),\n error( 'Argument must be real.' );\nelseif nargin == 2,\n y = sum( log( max( x, 0 ) ), dim );\nelse\n y = sum( log( max( x, 0 ) ) );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/sum_smallest.m", "content": "function cvx_optval = sum_smallest( x, varargin )\n\n%SUM_SMALLEST Sum of the smallest k elements of a vector.\n% For a real vector X and an integer k between 1 and length(X) inclusive,\n% y = SUM_SMALLEST(X,k) is the sum of the k smallest elements of X; e.g.,\n% temp = sort( x )\n% y = sum( temp( 1 : k ) )\n% If k=1, then SUM_SMALLEST(X,k) is equivalent to MIN(X); if k=length(X),\n% then SUM_SMALLEST(X,k) is equivalent to SUM(X).\n%\n% Both X and k must be real, and k must be a scalar. But k is not, in\n% fact, constrained to be an integer between 1 and length(X); the\n% function is extended continuously and logically to all real k. For\n% example, if k <= 0, then SUM_SMALLEST(X,k)=0. If k > length(X), then\n% SUM_SMALLEST(X,k)=SUM(X). Non-integer values of k interpolate linearly\n% between their integral neighbors.\n%\n% For matrices, SUM_SMALLEST(X,k) is a row vector containing the\n% application of SUM_SMALLEST to each column. For N-D arrays, the\n% SUM_SMALLEST operation is applied to the first non-singleton dimension\n% of X.\n%\n% SUM_SMALLEST(X,k,DIM) performs the operation along dimension DIM of X.\n%\n% Disciplined convex programming information:\n% SUM_SMALLEST(X,...) is concave and nondecreasing in X. Thus, when\n% used in CVX expressions, X must be concave (or affine). k and DIM\n% must both be constant.\n\nnarginchk(2,3);\ncvx_optval = -sum_largest( -x, varargin{:} );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/sum_square.m", "content": "function y = sum_square( x, dim )\n\n%SUM_SQUARE Sum of squares.\n% For vectors, SUM_SQUARE(X) is the sum of the squares of the elements of\n% the vector; i.e., SUM(X.^2).\n%\n% For matrices, SUM_SQUARE(X) is a row vector containing the application\n% of SUM_SQUARE to each column. For N-D arrays, the SUM_SQUARE operation\n% is applied to the first non-singleton dimension of X.\n%\n% SUM_SQUARE(X,DIM) takes the sum along the dimension DIM of X.\n%\n% Disciplined convex programming information:\n% If X is real, then SUM_SQUARE(X,...) is convex and nonmonotonic in\n% X. If X is complex, then SUM_SQUARE(X,...) is neither convex nor\n% concave. Thus, when used in CVX expressions, X must be affine. DIM\n% must be constant.\n\nnarginchk(1,2);\ny = x .* x;\nif nargin == 2,\n y = sum( y, dim );\nelse\n y = sum( y );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/sum_square_abs.m", "content": "function y = sum_square_abs( x, dim )\n\n%SUM_SQUARE_ABS Sum of the squares of absolute values.\n% For real arrays, SUM_SQUARE_ABS(X) computes the same result as\n% SUM_SQUARE(X). For complex arrays, SUM_SQUARE(X) first computes the\n% magnitudes of the elements of X, so it compute SUM_SQUARE_ABS(X).\n%\n% Similarly, SUM_SQUARE_ABS(X,DIM) implements SUM_SQUARE(ABS(X),DIM).\n%\n% Disciplined convex programming information:\n% SUM_SQUARE_ABS(X,...) is convex and nonmonotonic in X. Thus, when\n% used in CVX expressions, X must be affine. DIM must be constant.\n\nnarginchk(1,2);\ny = conj( x ) .* x;\nif nargin == 2,\n y = sum( y, dim );\nelse\n y = sum( y );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/sum_square_pos.m", "content": "function y = sum_square_pos( x, dim )\n\n%SUM_SQUARE_POS Sum of squares of the positive parts.\n% For vectors, SUM_SQUARE(X) is the sum of the squares of the positive\n% parts of X; i.e., SUM( MAX(X,0)^2 ). X must be real.\n%\n% For matrices, SUM_SQUARE_POS(X) is a row vector containing the\n% application of SUM_SQUARE_POS to each column. For N-D arrays, the\n% SUM_SQUARE_POS operation is applied to the first non-singleton\n% dimension of X.\n%\n% SUM_SQUARE_POS(X,DIM) takes the sum along the dimension DIM of X.\n%\n% Disciplined convex programming information:\n% SUM_SQUARE_POS(X,...) is convex and nondecreasing in X. Thus, when\n% used in CVX expressions, X must be convex (or affine). DIM must\n% always be constant.\n\nnarginchk(1,2);\nif nargin == 2,\n y = sum( square_pos( x ), dim );\nelse\n y = sum( square_pos( x ) );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/sym.m", "content": "function x = sym( x )\n\n% SYM Symmetrize.\n% SYM(X), where X is a matrix, returns the symmetric or Hermitian part\n% of X; that is, SYM(X) = 0.5 * ( X + X' ). If X is an array, SYM(X) \n% symmetrizes each of the submatrices X(:,:,k). X must satisfy \n% size(X,1) = size(X,2).\n%\n% SYM(X) is useful in CVX when constructing LMIs. Sometimes, numerical\n% errors will cause a construct to be slightly non-symmetric, causing \n% CVX to flag it as an error. If you are sure the asymmetry is solely\n% due to this effect, SYM(X) will correct it for you.\n\nsx = size(x);\nif sx(1) ~= sx(2),\n error( 'Argument must be square in its first two dimensions.' );\nelseif sx(1) > 1,\n x = 0.5 * ( x + conj( permute( x, [2,1,3:length(sx)] ) ) );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/trace_inv.m", "content": "function z = trace_inv( Y )\n\n% TRACE_INV Trace of the inverse of a PSD matrix.\n% For square matrix X, TRACE_INV(X) is TRACE(INV(X)) if X is Hermitian\n% or symmetric and positive definite; and +Inf otherwise. \n%\n% An error results if X is not a square matrix.\n%\n% Disciplined convex programming information:\n% TRACE_INV is convex and nonmonotonic (at least with respect to\n% elementwise comparison), so its argument must be affine.\n\nnarginchk(1,1);\nif ndims( Y ) > 2 || size( Y, 1 ) ~= size( Y, 2 ), %#ok\n error( 'Input must be a square matrix.' );\nend\nerr = Y - Y';\nY = 0.5 * ( Y + Y' );\nif norm( err, 'fro' ) > 8 * eps * norm( Y, 'fro' ),\n z = Inf;\nelse\n z = eig( full( Y ) );\n if any( z <= 0 ),\n z = Inf;\n else\n z = sum(1.0./z);\n end\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/trace_sqrtm.m", "content": "function z = trace_sqrtm( Y )\n\n% TRACE_SQRTM Trace of the square root of a PSD matrix.\n% For square matrix X, TRACE_SQRTM(X) is TRACE(SQRTM(X)) if X is Hermitian\n% or symmetric and positive definite; and +Inf otherwise.\n%\n% An error results if X is not a square matrix.\n%\n% Disciplined convex programming information:\n% TRACE_SQRTM is convex and nonmonotonic (at least with respect to\n% elementwise comparison), so its argument must be affine.\n\nnarginchk(1,1);\nif ndims( Y ) > 2 || size( Y, 1 ) ~= size( Y, 2 ), %#ok\n error( 'Input must be a square matrix.' );\nend\nerr = Y - Y';\nY = 0.5 * ( Y + Y' );\nif norm( err, 'fro' ) > 8 * eps * norm( Y, 'fro' ),\n z = Inf;\nelse\n z = eig( full( Y ) );\n if any( z <= 0 ),\n z = Inf;\n else\n z = sum(sqrt(z));\n end\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/functions/vec_/vec.m", "content": "function v = vec( x )\n\n% VEC Vectorize.\n% VEC(X), where X is a vector, matrix, or N-D array, returns a column vector\n% containing all of the elements of X; i.e., VEC(X)=X(:).\n\nv = reshape( x, numel( x ), 1 );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/keywords/Contents.m", "content": "% CVX: Keywords for declaring variables and objectives\n% dual - Declares one or more dual variables.\n% epigraph - Declares an epigraph variable.\n% hypograph - Declares a hypograph variable.\n% maximize - Specifies a concave (or affine) objective to be maximized.\n% minimize - Specifies a convex (or affine) objective to be maximized.\n% subject - Implements the \"subject to\" keyword.\n% variable - Declares a single CVX variable with optional matrix structure.\n% variables - Declares one or more CVX variables.\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/keywords/In.m", "content": "function y = In\ny = cvxin;\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/keywords/binary.m", "content": "function binary( varargin )\n\n%BINARY Declares an binary variable.\n% BINARY VARIABLE x\n% where x is a valid MATLAB variable name, declares a scalar variable for\n% the current CVX problem, and constrains it to the set {0,1}. Put\n% another way, it is equivalent to\n% integer variable x\n% 0 <= x <= 1\n%\n% BINARY VARIABLE x(SZ), where SZ is a size vector, declares an array of\n% size SZ and constrains each element to be binary. Structure modifiers\n% such as \"symmetric\", \"toeplitz\", etc. are also permitted.\n%\n% BINARY VARIABLES x y(SZ) z ... can be used to declare multiple binary \n% variables. Note however that structure modifiers are not permitted in\n% this case.\n%\n% Obviously, binary variables are NOT convex. Problems with binary \n% variables can only be handled by solvers with explicit support for\n% them; in particular, neither of the free solvers SeDuMi nor SDPT3\n% provide binary support.\n%\n% Examples:\n% binary variable x\n% binary variable x(100)\n%\n% See also INTEGER, VARIABLE, VARIABLES.\n\nif nargin < 2,\n error( 'Incorrect syntax for BINARY VARIABLE(S). Type HELP BINARY for details.' );\nelseif ~iscellstr( varargin ),\n error( 'All arguments must be strings.' );\nelseif strcmp( varargin{1}, 'variable' ),\n evalin( 'caller', sprintf( '%s ', 'variable', varargin{2:end}, 'binary' ) );\nelseif strcmp( varargin{1}, 'variables' ),\n for k = 2 : nargin,\n evalin( 'caller', sprintf( '%s ', 'variable', varargin{k}, 'binary' ) );\n end\nelse\n error( 'Incorrect syntax for BINARY VARIABLE(S). Type HELP BINARY for details.' );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/keywords/dual.m", "content": "function varargout = dual( varargin )\n\n%DUAL Declares one or more dual variables.\n%\n% DUAL VARIABLE x\n% where x is a valid MATLAB variable name, declares a dual variable\n% for the current cvx problem. A dual variable with that name is added\n% to the problem and a cvxdual object with that name is created in\n% the current worksapce. An error is generated if a cvx problem is not\n% in the current workspace.\n%\n% Note that a dual variable initially has no size; i.e., SIZE(x) returns\n% [0,0]. This is because the size of a dual variable is determined by the\n% constraint to which it is attached. To attach a dual variable to a\n% constraint, use the colon notation as follows:\n%\n% variable x(n)\n% dual variable z\n% A * x == b : z\n%\n% In this example, the dual variable z is attached to the equality\n% constraint A * x == b. Assuming SIZE(A) = [m,n] and SIZE(B) = [m,1],\n% the size of z will be set at [m,1] by this operation.\n%\n% DUAL VARIABLES x1 x2 ... xk\n% where x1, x2, ..., xk are valid MATLAB variable names, declares\n% multiple dual variables.\n%\n% DUAL VARIABLE x{s1,s2,...,sk}\n% DUAL VARIABLES x1{s1,s2,...,sk} x2{...\n% creates a cell array of dual variables, of dimension [s1,s2,..,sk].\n% This is useful if you want to create a sequence of related constraints,\n% using a FOR loop for example, and assign a separate dual variable to\n% each one; for example:\n%\n% variable x(n)\n% dual variables z{10}\n% for k = 1 : 10,\n% A(:,:,k) * x <= b(:,k) : z{k}\n% end\n%\n% Assuming SIZE(A) = [m,n,10] and SIZE(B) = [m,10], this loop assigns\n% each of the dual variables z{k} to a constraint and sets their sizes\n% to [m,1]. Note that the elements of the dual variable cell array need\n% not end up the same size.\n%\n% See also VARIABLE, VARIABLES.\n\nif nargin < 2,\n error( 'Incorrect syntax for DUAL VARIABLE(S). Type HELP DUAL for details.' );\nelseif nargout && nargout ~= length( varargin ) - 1,\n error( 'Incorrect number of output arguments.' );\nelseif ~iscellstr( varargin ),\n error( 'All arguments must be strings.' );\nend\n\nglobal cvx___\nprob = evalin( 'caller', 'cvx_problem', '[]' );\nif ~isa( prob, 'cvxprob' ),\n error( 'No CVX model exists in this scope.' );\nelseif isempty( cvx___.problems ) || cvx___.problems( end ).self ~= prob,\n error( 'Internal CVX data corruption. Please CLEAR ALL and rebuild your model.' );\nend\n\nif strcmp( varargin{1}, 'variable' ),\n if nargin > 2,\n error( 'Too many input arguments.\\nTrying to declare multiple dual variables? Use the DUAL VARIABLES command instead.', 1 ); %#ok\n end\nelseif ~strcmp( varargin{1}, 'variables' ),\n error( 'Incorrect syntax for DUAL VARIABLE(S). Type HELP DUAL for details.' );\nend\n\nfor k = 2 : nargin,\n arg = varargin{k};\n toks = regexp( arg, '^\\s*([a-zA-Z]\\w*)\\s*({.*})?\\s*$', 'tokens' );\n if isempty( toks ),\n error( 'Invalid dual variable specification: %s', arg );\n end\n tok = toks{1};\n nam = tok{1};\n if length(tok) < 2,\n siz = {};\n else\n siz = tok{2};\n end\n if nam(end) == '_',\n error( 'Invalid dual variable specification: %s\\n Variables ending in underscores are reserved for internal use.', arg );\n end\n if ~isempty( siz ),\n try\n siz = evalin( 'caller', [ '[', siz(2:end-1), ']' ] );\n catch exc\n error( exc.identifier, 'Error attempting to determine size of: %s\\n %s', arg, exc.message );\n end\n [ temp, siz ] = cvx_check_dimlist( siz, true );\n if ~temp,\n error( 'Invalid dual variable specification: %s\\n Dimension list must be a vector of finite nonnegative integers.', arg );\n end\n end\n temp = newdual( prob, nam, siz );\n if nargout,\n varargout{k-1} = temp; %#ok\n end\n assignin( 'caller', nam, temp );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/keywords/epigraph.m", "content": "function epigraph( varargin )\n\n%EPIGRAPH Declares an epigraph variable.\n% EPIGRAPH VARIABLE x\n% where x is a valid MATLAB variable name, declares a scalar\n% variable for the current cvx problem, and specifies it as\n% the objective of a minimization. There is no need to declare\n% a separate MINIMIZE command.\n%\n% This keyword should be used only when attempting to\n% create a new function for the CVX library. Suppose you have a\n% function F(X) whose epigraph {(X,Y)}{F(X)<=Y} can be\n% described as a CVX feasibiliy problem. Then declaring Y\n% as an EPIGRAPH turns the model into one that computes the\n% value of the function itself, minimizing over Y.\n%\n% Other uses of this keyword are NOT supported and can lead\n% to numerical errors.\n%\n% EPIGRAPH VARIABLE x(n1,n2,...,nk)\n% declares a vector, matrix, or array epigraph variable with\n% dimensions n1, n2, ..., nk, each of which must be positive\n% integers.\n%\n% Structure modifiers such as \"symmetric\", \"toeplitz\", etc.\n% are permitted with epigraph variables.\n%\n% Examples:\n% epigraph variable x\n% epigraph variable x(100)\n%\n% See also VARIABLE, HYPOGRAPH.\n\nif nargin < 2,\n error( 'Incorrect syntax for EPIGRAPH VARIABLE. Type HELP EPIGRAPH for details.' );\nelseif ~iscellstr( varargin ),\n error( 'All arguments must be strings.' );\nelseif ~strcmp( varargin{1}, 'variable' ),\n error( 'Incorrect syntax for EPIGRAPH VARIABLE. Type HELP EPIGRAPH for details.' );\nend\nevalin( 'caller', sprintf( '%s ', 'variable', varargin{2:end}, ' epigraph_' ) );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/keywords/expression.m", "content": "function varargout = expression( nm, varargin )\n\n%EXPRESSION Declares a single CVX object for storing subexpressions.\n% EXPRESSION x\n% where x is a valid MATLAB variable nm, declares a scalar expression \n% holder for the current cvx model. Like a variable, an expression holder\n% can be used in constraints and objectives, according to the DCP ruleset.\n% However, unlike a variable, an expression holder is initialized to\n% zero, because the intent is for it to hold intermediate computations.\n%\n% EXPRESSION x(n1,n2,...,nk)\n% declares a vector, matrix, or array expression holder with dimensions\n% n1, n2, ..., nk, each of which must be nonnegative integers. The value\n% of the expression holder is initialized to zero.\n%\n% Examples:\n% variable x y\n% expression z\n% z = 2 * x - y;\n%\n% See also EXPRESSIONS.\n\nglobal cvx___\nprob = evalin( 'caller', 'cvx_problem', '[]' );\nif ~isa( prob, 'cvxprob' ),\n error( 'No CVX model exists in this scope.' );\nelseif isempty( cvx___.problems ) || cvx___.problems( end ).self ~= prob,\n error( 'Internal CVX data corruption. Please CLEAR ALL and rebuild your model.' );\nelseif nargin > 1,\n error( 'Too many input arguments.\\nTrying to declare multiple expression holders? Use the EXPRESSIONS keyword instead.', 1 ); %#ok\nend\n\n%\n% Step 1: separate the name from the parenthetical, verify the name\n%\n\ntoks = regexp( nm, '^\\s*([a-zA-Z]\\w*)\\s*(\\(.*\\))?\\s*$', 'tokens' );\nif isempty( toks ),\n error( 'Invalid variable specification: %s', nm );\nend\ntoks = toks{1};\nx.name = toks{1};\nx.size = toks{2};\nif x.name(end) == '_',\n error( 'Invalid expression specification: %s\\n Names ending in underscores are reserved for internal use.', nm );\nend\n\n%\n% Step 2: Parse the size. In effect, all we do here is surround what is\n% replace the surrounding parentheses with square braces and evaluate. All\n% that matters is the result is a valid size vector. In particular, it\n% need to be a simple comma-delimited list.\n%\n\nif isempty( x.size ),\n\tx.size = [1,1];\nelse\n try\n x.size = evalin( 'caller', [ '[', x.size(2:end-1), '];' ] );\n catch exc\n error( exc.identifier, exc.message );\n end\n [ temp, x.size ] = cvx_check_dimlist( x.size, true );\n if ~temp,\n error( 'Invalid expression specification: %s\\n Dimension list must be a vector of finite nonnegative integers.', nm );\n end\nend\n\n%\n% Step 3. Initialize\n%\n\nv = cvx( x.size, [] );\nif nargout > 0,\n varargout{1} = v;\nelse\n assignin( 'caller', x.name, v );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/keywords/expressions.m", "content": "function expressions( varargin )\n\n%EXPRESSIONS Declares one or more CVX expression holders.\n% EXPRESSIONS x1 x2 x3 ..., where x1, x2, x3, etc. are valid\n% variable names, declares multiple cvx expression holders. It is\n% exactly equivalent to issuing a separate EXPRESSION command\n% for each x1, x2, x3, ...\n% \n% EXPRESSIONS allows the declaration of vector, matrix, and\n% array variables. \n%\n% For more information about expression holders, see the help for \n% EXPRESSION or the CVX user guide.\n%\n% Examples:\n% expressions x y z\n%\n% See also EXPRESSION.\n\nif nargin < 1,\n error( 'Incorrect syntax for EXPRESSIONS. Type HELP EXPRESSIONS for details.' );\nelseif ~iscellstr( varargin ),\n error( 'All arguments must be strings.' );\nend\nfor k = 1 : nargin,\n evalin( 'caller', [ 'expression ', varargin{k} ] );\nend\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/keywords/hypograph.m", "content": "function hypograph( varargin )\r\n\r\n%HYPOGRAPH Declares a hypograph variable.\r\n% HYPOGRAPH VARIABLE x\r\n% where x is a valid MATLAB variable name, declares a scalar\r\n% variable for the current cvx problem, and specifies it as\r\n% the objective of a maximization. There is no need to declare\r\n% a separate MAXIMIZE command.\r\n%\r\n% This keyword should be used only when attempting to\r\n% create a new function for the CVX library. Suppose you have a\r\n% function F(X) whose hypograph {(X,Y)}{F(X)>=Y} can be\r\n% described as a CVX feasibiliy problem. Then declaring Y\r\n% as an EPIGRAPH turns the model into one that computes the\r\n% value of the function itself, maximizing over Y.\r\n%\r\n% Other uses of this keyword are NOT supported and can lead\r\n% to numerical errors.\r\n%\r\n% HYPOGRAPH VARIABLE x(n1,n2,...,nk)\r\n% declares a vector, matrix, or array hypograph variable with\r\n% dimensions n1, n2, ..., nk, each of which must be positive\r\n% integers.\r\n%\r\n% Structure modifiers such as \"symmetric\", \"toeplitz\", etc.\r\n% are permitted with hypograph variables.\r\n%\r\n% Examples:\r\n% hypograph variable x\r\n% hypograph variable x(100)\r\n%\r\n% See also VARIABLE, EPIGRAPH.\r\n\r\nif nargin < 2,\r\n error( 'Incorrect syntax for HYPOGRAPH VARIABLE. Type HELP HYPOGRAPH for details.' );\r\nelseif ~iscellstr( varargin ),\r\n error( 'All arguments must be strings.' );\r\nelseif ~strcmp( varargin{1}, 'variable' ),\r\n error( 'Incorrect syntax for HYPOGRAPH VARIABLE. Type HELP HYPOGRAPH for details.' );\r\nend\r\nevalin( 'caller', sprintf( '%s ', 'variable', varargin{2:end}, ' hypograph_' ) );\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/keywords/integer.m", "content": "function integer( varargin )\n\n%INTEGER Declares an integer variable.\n% INTEGER VARIABLE x\n% where x is a valid MATLAB variable name, declares a scalar variable for\n% the current CVX problem, and constraints it so that it can assume only\n% integral values.\n%\n% INTEGER VARIABLE x(SZ), where SZ is a size vector, declares an array of\n% size SZ and constrains each element to be integral. Structure modifiers\n% such as \"symmetric\", \"toeplitz\", etc. are also permitted.\n%\n% INTEGER VARIABLES x y(SZ) z ... can be used to declare multiple integer \n% variables. Note however that structure modifiers are not permitted in\n% this case.\n%\n% Obviously, integer variables are NOT convex. Problems with integer \n% variables can only be handled by solvers with explicit support for\n% them; in particular, neither of the free solvers SeDuMi nor SDPT3\n% provide integer support.\n%\n% Examples:\n% integer variable x\n% integer variable x(100)\n%\n% See also BINARY, VARIABLE, VARIABLES.\n\nif nargin < 2,\n error( 'Incorrect syntax for INTEGER VARIABLE(S). Type HELP INTEGER for details.' );\nelseif ~iscellstr( varargin ),\n error( 'All arguments must be strings.' );\nelseif strcmp( varargin{1}, 'variable' ),\n evalin( 'caller', sprintf( '%s ', 'variable', varargin{2:end}, ' integer' ) );\nelseif strcmp( varargin{1}, 'variables' ),\n for k = 2 : nargin,\n evalin( 'caller', sprintf( '%s ', 'variable', varargin{k}, ' integer' ) );\n end\nelse \n error( 'Incorrect syntax for INTEGER VARIABLE(S). Type HELP INTEGER for details.' );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/keywords/maximise.m", "content": "function maximise( varargin )\n\n%MAXIMISE Specifiies a concave (or affine) objective to be maximized.\n\nglobal cvx___\nprob = evalin( 'caller', 'cvx_problem', '[]' );\nif ~isa( prob, 'cvxprob' ),\n error( 'No CVX model exists in this scope.' );\nelseif isempty( cvx___.problems ) || cvx___.problems( end ).self ~= prob,\n error( 'Internal CVX data corruption. Please CLEAR ALL and rebuild your model.' );\nelseif nargin < 1,\n error( 'Objective expression missing.' );\nelseif iscellstr( varargin ),\n x = evalin( 'caller', sprintf( '%s ', varargin{:} ) );\nelseif nargin > 1,\n error( 'Too many input arguments.' );\nelse\n x = varargin{1};\nend\ntry\n newobj( prob, 'maximize', x );\ncatch exc\n rethrow( exc )\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/keywords/maximize.m", "content": "function maximize( varargin )\n\n%MAXIMIZE Specifiies a concave (or affine) objective to be maximized.\n\nglobal cvx___\nprob = evalin( 'caller', 'cvx_problem', '[]' );\nif ~isa( prob, 'cvxprob' ),\n error( 'No CVX model exists in this scope.' );\nelseif isempty( cvx___.problems ) || cvx___.problems( end ).self ~= prob,\n error( 'Internal CVX data corruption. Please CLEAR ALL and rebuild your model.' );\nelseif nargin < 1,\n error( 'Objective expression missing.' );\nelseif iscellstr( varargin ),\n x = evalin( 'caller', sprintf( '%s ', varargin{:} ) );\nelseif nargin > 1,\n error( 'Too many input arguments.' );\nelse\n x = varargin{1};\nend\ntry\n newobj( prob, 'maximize', x );\ncatch exc\n rethrow( exc )\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/keywords/minimise.m", "content": "function minimise( varargin )\n\n%MINIMISE Specifiies a convex (or affine) objective to be maximized.\n\nglobal cvx___\nprob = evalin( 'caller', 'cvx_problem', '[]' );\nif ~isa( prob, 'cvxprob' ),\n error( 'No CVX model exists in this scope.' );\nelseif isempty( cvx___.problems ) || cvx___.problems( end ).self ~= prob,\n error( 'Internal CVX data corruption. Please CLEAR ALL and rebuild your model.' );\nelseif nargin < 1,\n error( 'Objective expression missing.' );\nelseif iscellstr( varargin ),\n x = evalin( 'caller', sprintf( '%s ', varargin{:} ) );\nelseif nargin > 1,\n error( 'Too many input arguments.' );\nelse\n x = varargin{1};\nend\ntry\n newobj( prob, 'minimize', x );\ncatch exc\n rethrow( exc )\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/keywords/minimize.m", "content": "function minimize( varargin )\n\n%MINIMIZE Specifiies a convex (or affine) objective to be maximized.\n\nglobal cvx___\nprob = evalin( 'caller', 'cvx_problem', '[]' );\nif ~isa( prob, 'cvxprob' ),\n error( 'No CVX model exists in this scope.' );\nelseif isempty( cvx___.problems ) || cvx___.problems( end ).self ~= prob,\n error( 'Internal CVX data corruption. Please CLEAR ALL and rebuild your model.' );\nelseif nargin < 1,\n error( 'Objective expression missing.' );\nelseif iscellstr( varargin ),\n x = evalin( 'caller', sprintf( '%s ', varargin{:} ) );\nelseif nargin > 1,\n error( 'Too many input arguments.' );\nelse\n x = varargin{1};\nend\ntry\n newobj( prob, 'minimize', x );\ncatch exc\n rethrow( exc )\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/keywords/subject.m", "content": "function subject( to )\n\n%SUBJECT Implements the \"subject to\" keyword.\n% The keyword\n% SUBJECT TO\n% is a \"no-op\"---that is, it has no functional value. It is provided\n% solely to allow CVX models to read more closely to their mathematical\n% counterparts; e.g.\n% MINIMIZE( )\n% SUBJECT TO\n% \n% ...\n% It may be omitted without altering the model in any way.\n\n% We had some consistency checking code here, but given that this is supposed to be \n% no-op, it seems sensible to remove it all.\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/keywords/variable.m", "content": "function varargout = variable( varargin )\n\n%VARIABLE Declares a single CVX variable with optional matrix structure.\n% VARIABLE x\n% where x is a valid MATLAB variable nm, declares a scalar\n% variable for the current cvx problem. A variable with that\n% name is added to the problem, and a cvx object with that\n% name is created in the current workspace. An error is\n% generated if a cvx problem isn't in the current workspace.\n%\n% VARIABLE x(n1,n2,...,nk)\n% declares a vector, matrix, or array variable with dimensions\n% n1, n2, ..., nk, each of which must be positive integers.\n%\n% VARIABLE x(n1,n2,...,nk) mod1 mod2 mod3 ... modp\n% declares a vector, matrix, or array with structure. The\n% modifiers mod1, mod2, ... can each be one of the following:\n% complex symmetric skew-symmetric hermitian\n% skew-hermitian toeplitz hankel upper-hankel\n% lower-triangular upper-triangular tridiagonal\n% diagonal lower-bidiagonal upper-bidiagonal\n% Appropriate combinations of these modifiers can be chosen\n% as well. All except \"complex\" require that the matrix be\n% square. If an N-D (N>2) array is specified, then the matrix\n% structure is applied to each 2-D \"slice\" of the array.\n%\n% Examples:\n% variable x(100,100) symmetric tridiagonal\n% variable z(10,10,10)\n% variable y complex\n%\n% See also VARIABLES, DUAL, DUALS.\n\nglobal cvx___\nprob = evalin( 'caller', 'cvx_problem', '[]' );\nif ~isa( prob, 'cvxprob' ),\n error( 'No CVX model exists in this scope.' );\nelseif isempty( cvx___.problems ),\n error( 'Internal CVX data corruption. Please CLEAR ALL and rebuild your model.' );\nend\npstr = cvx___.problems( end );\nif pstr.self ~= prob,\n error( 'Internal CVX data corruption. Please CLEAR ALL and rebuild your model.' );\nend\n\n%\n% Parse the text\n%\n\nname = cell( 1, nargin );\nargs = cell( 1, nargin );\ntoks = regexp( varargin, '^([a-zA-Z]\\w*)(\\(.*\\))?$', 'tokens' );\nfor k = 1 : nargin,\n tok = toks{k};\n if isempty( tok ),\n if k == 1, type = 'Variable'; else type = 'Structure'; end\n error( sprintf('CVX:Invalid%sSpec',type), 'Invalid %s specification: %s', lower(type), varargin{k} );\n end\n tok = tok{1};\n name{k} = tok{1};\n if length(tok) < 2 || isempty( tok{2} ),\n args{k} = {};\n else\n try\n args{k} = evalin( 'caller', [ '{', tok{2}(2:end-1), '};' ] );\n catch exc\n error( exc.identifier, exc.message );\n end\n end\nend\n\n%\n% Get the variable name and size\n%\n\nxname = name{1};\nif ~isvarname( xname ),\n error( 'CVX:InvalidVariableSpec', 'Invalid variable name: %s', xname );\nelseif xname(end) == '_',\n error( 'CVX:InvalidVariableSpec', 'Invalid variable name: %s\\n Variables ending in underscores are reserved for internal use.', xname );\nelseif isfield( cvx___.reswords, xname ),\n if cvx___.reswords.(xname) == 'S',\n error( 'CVX:InvalidVariableSpec', 'Invalid variable name: %s\\n This is a reserved word in CVX.\\n Trying to declare a structured matrix? Use the VARIABLE keyword instead.', xname );\n else\n error( 'CVX:InvalidVariableSpec', 'Invalid variable name: %s\\n This is a reserved word in CVX.', xname );\n end\nelseif isfield( pstr.variables, xname ),\n error( 'CVX:InvalidVariableSpec', 'Duplicate variable name: %s', xname );\nend\nswitch evalin('caller',['exist(''',xname,''')']),\n case {0,1},\n case 5,\n error( 'CVX:InvalidVariableSpec', 'Variable name \"%s\" is the name of a built-in MATLAB function.\\nPlease choose a different name.', xname );\n case 8,\n error( 'CVX:InvalidVariableSpec', 'Variable name \"%s\" is the name of an existing MATLAB class.\\nPlease choose a different name.', xname );\n otherwise,\n mpath = which( xname );\n if ~isempty( mpath ),\n if strncmp( mpath, matlabroot, length(matlabroot) ),\n error( 'CVX:InvalidVariableSpec', 'Variable name \"%s\" is the name of an existing MATLAB function or directory:\\n %s\\nPlease choose a different name.', xname, mpath );\n elseif strncmp( mpath, cvx___.where, length(cvx___.where) ),\n error( 'CVX:InvalidVariableSpec', 'Variable name \"%s\" matches the name of a CVX function or directory:\\n %s\\nPlease choose a different name.', xname, mpath );\n else\n warning( 'Variable name \"%s\" matches the name of an function or directory:\\n %s\\nThis may cause unintended behavior with CVX models.\\nPlease consider moving this file or choosing a different variable name.', xname, mpath );\n end\n end\nend\ntry\n xsize = [ args{1}{:} ];\ncatch exc\n error( exc.identifier, exc.message );\nend\nif ~isempty( xsize ),\n [ temp, xsize ] = cvx_check_dimlist( xsize, true );\n if ~temp,\n error( 'CVX:InvalidDimensions', 'Invalid dimension list: %s\\n Dimension list must be a vector of finite nonnegative integers.', varargin{1} );\n end\nend\n\n%\n% Parse the structure\n%\n\nisepi = false;\nishypo = false;\nisnneg = false;\nissemi = false;\nitype = '';\nif nargin > 1,\n try\n [ str, itypes ] = cvx_create_structure( varargin, name, args );\n catch exc\n error( exc.identifier, exc.message );\n end\n n_itypes = 0;\n for k = 1 : length( itypes ),\n strs = itypes{k};\n switch strs,\n case 'epigraph_', isepi = true;\n case 'hypograph_', ishypo = true;\n case 'integer', n_itypes = n_itypes + 1; itype = 'i_integer';\n case 'binary', n_itypes = n_itypes + 1; itype = 'i_binary';\n case 'nonnegative', isnneg = true;\n case 'semidefinite', issemi = true;\n end\n end\n if isepi && ishypo,\n error( 'EPIGRAPH and HYPOGRAPH keywords cannot be used simultaneously.' );\n end\n if n_itypes,\n if pstr.gp,\n error( 'Integer variables cannot be used in geometric programs.' );\n elseif isepi || ishypo,\n error( 'Integer variables cannot be used as epigraphs or hypograph variables.' );\n elseif issemi,\n error( 'Integer variables cannot also be declared semidefinite.' );\n elseif n_itypes > 1,\n error( 'At most one integer keyword may be specified.' );\n end\n end\nelse\n str = [];\nend\n\n%\n% Create the variables\n%\n\ntry\n v = newvar( prob, xname, xsize, str, pstr.gp );\ncatch exc\n error( exc.message );\nend\nif isepi || ishypo,\n if pstr.gp, vv = log( v ); else vv = v; end\n if isepi, dir = 'epigraph'; else dir = 'hypograph'; end\n cvx___.problems( end ).objective = vv;\n cvx___.problems( end ).direction = dir;\n cvx___.problems( end ).geometric = pstr.gp;\nend\nif itype,\n [ tx, dummy ] = find( cvx_basis( v ) ); %#ok\n newnonl( prob, itype, tx(:)' );\n cvx___.canslack( tx ) = false;\nend\nif issemi,\n [ dummy, issemi ] = newcnstr( prob, v, 0, '>=', true ); %#ok\n if ~issemi, isnneg = false; end\nend\nif isnneg && ~pstr.gp && ~strcmp( itype, 'i_binary' ),\n newcnstr( prob, v, 0, '>=', false );\nend\nif nargout > 0,\n varargout{1} = v;\nelse\n assignin( 'caller', xname, v );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/keywords/variables.m", "content": "function variables( varargin )\n\n%VARIABLES Declares one or more CVX variables.\n% VARIABLES x1 x2 x3 ..., where x1, x2, x3, etc. are valid\n% variable names, declares multiple cvx variables. It is\n% exactly equivalent to issuing a separate VARIABLE command\n% for each x1, x2, x3, ...\n% \n% VARIABLES allows the declaration of vector, matrix, and\n% array variables. However, unlike VARIABLE, structure modifiers\n% such as \"symmetric\", \"toeplitz\", etc. are NOT permitted. Thus\n% VARIABLES cannot be used with variables with structure.\n%\n% Examples:\n% variables x y z;\n% variables x(100) y z(100,10);\n%\n% See also VARIABLE, DUAL, DUALS.\n\nif nargin < 1,\n error( 'Incorrect syntax for VARIABLES. Type HELP VARIABLES for details.' );\nelseif ~iscellstr( varargin ),\n error( 'All arguments must be strings.' );\nend\nfor k = 1 : nargin,\n\tevalin( 'caller', [ 'variable ', varargin{k} ] );\nend\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cell/cvx_id.m", "content": "function y = cvx_id( x )\r\ny = cellfun( @cvx_id, x );\r\nif isempty( y ),\r\n y = -Inf;\r\nelse\r\n y = max( y( : ) );\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cell/cvx_setdual.m", "content": "function x = cvx_setdual( x, y )\r\nx = cvx_setdual( cvxtuple( x ), y );\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cell/cvx_value.m", "content": "function y = cvx_value( x )\r\nglobal cvx___\r\ny = cellfun( @cvx_value, x, 'UniformOutput', false );\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/bcompress.m", "content": "function [ xR, x, sx ] = bcompress( x, mode, nsrt )\r\nnarginchk(1,3);\r\n\r\nif nargin < 2 || isempty( mode ),\r\n mode = 'full';\r\nelseif ~ischar( mode ) || size( mode, 1 ) ~= 1,\r\n error( 'Second argument must be a string.' );\r\nend\r\n\r\nif nargin < 3 || isempty( nsrt ),\r\n nsrt = 0;\r\nelseif ~cvx_check_dimension( nsrt, true ),\r\n error( 'Third argument must be a nonnegative integer.' );\r\nend\r\n\r\nsx = x.size_;\r\nxb = x.basis_;\r\nif nargout <= 1,\r\n xR = cvx_bcompress( xb, mode, nsrt );\r\nelse\r\n [ xR, xb ] = cvx_bcompress( xb, mode, nsrt );\r\n x = cvx( size( xb, 2 ), xb );\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/buncompress.m", "content": "function x = buncompress( xR, x, sx )\r\nnarginchk(2,3);\r\n\r\nif ~isa( xR, 'double' ) && ~isa( xR, 'sparse' ),\r\n error( 'First argument must be a structure matrix.' );\r\nelseif size( x.basis_, 2 ) ~= size( xR, 1 ),\r\n error( 'Structure matrix incompatible with vector.' );\r\nelseif nargin < 3 || isempty( sx ),\r\n sx = size( xR, 2 );\r\nelseif ~cvx_check_dimlist( sx, false ),\r\n error( 'Third argument must be a size matrix.' );\r\nelseif prod( sx ) ~= isempty( xR ) * prod( x.size_ ) + ~isempty( xR ) * size( xR, 2 ),\r\n error( 'Incompatible size matrix.' );\r\nend\r\n\r\nif isempty( xR ),\r\n x = cvx( sx, x.basis_ );\r\nelse\r\n x = cvx( sx, x.basis_ * xR );\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/cvx.m", "content": "function v = cvx( s, b, d, clean )\n\n%CVX The CVX disciplined convex programming system.\n% CVX is a modeling framework for building, constructing, and solving\n% disciplined convex programs. CVX has online help for many functions and\n% operations, divided into several subsection:\n% cvx/commands - Top-level commands to control CVX\n% cvx/keywords - Keywords for declaring variables and objectives\n% cvx/builtins - Built-in operators and functions supported in CVX models\n% cvx/functions - Additional functions added by CVX\n% cvx/sets - Definitions of common convex sets\n% cvx/structures - Matrix structure definitions\n% CVX also provides an extensive user guide in PDF format, which is found\n% in its top directory. This directory can be found by typing\n% cvx_where\n% at the command prompt.\n\nswitch nargin,\n case 2,\n d = [];\n clean = false;\n case 3,\n clean = true;\n case 1,\n if isa( s, 'cvx' ),\n v = s;\n else\n v = class( struct( 'size_', size( s ), 'basis_', sparse( s(:).' ), 'dual_', '', 'dof_', [], 'slow_', nnz( isinf( s ) | isnan( s ) ) ~= 0 ), 'cvx', cvxobj );\n end\n return\n case 0,\n v = class( struct( 'size_', [ 0, 0 ], 'basis_', sparse( 1, 0 ), 'dual_', '', 'dof_', [], 'slow_', false ), 'cvx', cvxobj );\n return\nend\nslow = false;\nif isempty( b ),\n b = sparse( 1, prod( s ) );\n%elseif issparse( b ) & ~cvx_use_sparse( b ),\n% b = full( b );\nend\nswitch length( s ),\n case 2,\n case 1,\n s( 2 ) = 1;\n case 0,\n s = [ 0, 0 ];\n otherwise,\n while s(end) == 1,\n s(end) = [];\n if length( s ) == 2, \n break; \n end\n end\nend\nif ~all( isfinite( nonzeros( b ) ) ),\n slow = true;\n tt = any( isnan( b ), 1 ) | sum( isinf( b ), 1 ) > isinf( b( 1, : ) );\n b( :, tt ) = 0;\n b( 1, tt ) = NaN;\nend\nif clean,\n b1 = b( 1, : );\n if nnz( b ) == nnz( b1 ),\n v = cvx_reshape( b1, s );\n return\n end\nend\n\nv = class( struct( 'size_', s, 'basis_', b, 'dual_', '', 'dof_', d, 'slow_', slow ), 'cvx', cvxobj );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/cvx_basis.m", "content": "function y = cvx_basis( x )\ny = x.basis_;\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/cvx_classify.m", "content": "function v = cvx_classify( x )\r\n\r\n% Classifications:\r\n% 1 - negative constant\r\n% 2 - zero\r\n% 3 - positive constant\r\n% 4 - complex constant\r\n% 5 - concave\r\n% 6 - real affine\r\n% 7 - convex\r\n% 8 - complex affine\r\n% 9 - log concave\r\n% 10 - log affine\r\n% 11 - log convex monomial\r\n% 12 - log convex posynomial\r\n% 13 - invalid\r\n\r\nglobal cvx___\r\nv = full( cvx_vexity( x ) );\r\nv = reshape( v, 1, prod( x.size_ ) );\r\nif isempty( x ), return; end\r\nb = x.basis_ ~= 0;\r\nq = sum( b, 1 );\r\ns = b( 1, : );\r\n\r\ntt = q == s;\r\nif any( tt ),\r\n if ~isreal( x.basis_ ),\r\n ti = any( imag( x.basis_ ), 1 );\r\n v( tt & ti ) = 4;\r\n tt = tt & ~ti;\r\n end\r\n v( tt ) = sign( x.basis_( 1, tt ) ) + 2;\r\nend\r\n\r\ntt = ~tt & ~isnan( v );\r\nif any( tt ),\r\n temp = v( tt );\r\n temp = temp + 6;\r\n v( tt ) = temp;\r\n if ~isreal( x.basis_ ),\r\n ti = any( imag( x.basis_ ), 1 );\r\n v( tt & ti ) = 8;\r\n end\r\nend\r\n\r\ntt = isnan( v );\r\nv( tt ) = 13;\r\n\r\nif nnz( cvx___.exp_used ),\r\n tt = find( ( v == 13 | v == 7 ) & q == 1 );\r\n if ~isempty( tt ),\r\n [ rx, cx, vx ] = find( x.basis_( :, tt ) );\r\n qq = reshape( cvx___.logarithm( rx ), size( vx ) ) & ( vx > 0 );\r\n v( tt( cx( qq ) ) ) = 10 + cvx___.vexity( cvx___.logarithm( rx( qq ) ) );\r\n end\r\n tt = find( v == 7 & q > 1 );\r\n if ~isempty( tt ),\r\n [ rx, cx, vx ] = find( x.basis_( :, tt ) );\r\n qq = ( ~reshape( cvx___.logarithm( rx ), size( vx ) ) & ( rx > 1 ) ) | vx < 0;\r\n tt( cx( qq ) ) = [];\r\n v( tt ) = 12;\r\n end\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/cvx_constant.m", "content": "function y = cvx_constant( x )\ny = cvx_reshape( x.basis_( 1, : ), x.size_ );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/cvx_getdual.m", "content": "function z = cvx_getdual( x )\nz = x.dual_;\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/cvx_isaffine.m", "content": "function y = cvx_isaffine( x, full )\nnarginchk(1,2);\ny = cvx_vexity( x );\nif nargin < 2,\n y = nnz( y ) == 0;\nelse\n y = cvx_reshape( y == 0, x.size_ );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/cvx_isconcave.m", "content": "function y = cvx_isconcave( x, full )\nnarginchk(1,2);\ny = cvx_vexity( x );\nif nargin < 2,\n y = nnz( y > 0 ) == 0;\nelse\n y = cvx_reshape( y <= 0, x.size_ );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/cvx_isconstant.m", "content": "function y = cvx_isconstant( x, full )\nnarginchk(1,2);\nb = x.basis_;\nif size( b, 1 ) <= 1,\n y = true;\n if nargin == 2 && full,\n y = y( ones( 1, prod( x.size_ ) ) );\n y = reshape( y, x.size_ );\n end\nelseif nargin == 2 && full,\n bz = b ~= 0;\n y = cvx_reshape( sum( bz, 1 ) == bz( 1, : ), x.size_ );\nelse\n y = nnz( b ) == nnz( b( 1, : ) );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/cvx_isconvex.m", "content": "function y = cvx_isconvex( x, full )\nnarginchk(1,2);\ny = cvx_vexity( x );\nif nargin < 2,\n y = nnz( y < 0 ) == 0;\nelse\n y = cvx_reshape( y >= 0, x.size_ );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/cvx_isnonzero.m", "content": "function y = cvx_isnonzero( x, full )\r\nnarginchk(1,2);\r\ny = any( x.basis_, 1 );\r\nif nargin < 2,\r\n y = all( y );\r\nelse\r\n y = cvx_reshape( y, x.size_ );\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/cvx_readlevel.m", "content": "function y = cvx_readlevel( x )\r\n\r\nglobal cvx___\r\ns = size( x.basis_ );\r\n[ r, c ] = find( x.basis_ );\r\ny = max( sparse( r, c, cvx___.readonly( r ), s(1), s(2) ), [], 1 );\r\ny = cvx_reshape( y, x.size_ );\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/cvx_setdual.m", "content": "function x = cvx_setdual( x, y )\nx.dual_ = y;\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/cvx_value.m", "content": "function v = cvx_value( x )\r\nv = value( x );\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/cvx_vexity.m", "content": "function v = cvx_vexity( x )\n\nglobal cvx___\ns = x.size_;\nif any( s == 0 ),\n v = cvx_zeros( s );\n return\nend\np = cvx___.vexity;\nb = x.basis_;\nn = length( p );\nnb = size( b, 1 );\nif nb < n,\n p = p( 1 : nb, 1 );\nelseif n < nb,\n p( nb, 1 ) = 0;\nend\nif ~any( p ),\n v = cvx_zeros( x.size_ );\n if x.slow_,\n v( isnan( x.basis_( 1, : ) ) ) = NaN;\n end\n return\nend\nb = b( p ~= 0, : );\np = nonzeros(p).';\nif cvx___.nan_used,\n b = sparse( b );\nend\nv = full( p * b );\ntt = abs( v ) ~= abs( p ) * abs( b );\nif x.slow_,\n v( tt | isnan( x.basis_( 1, : ) ) ) = NaN;\nelse\n v( tt ) = NaN;\nend\nif ~isreal( x ),\n v( any( imag( x.basis_ ), 1 ) & v ) = NaN;\nend\nv = sign( v );\nv = reshape( v, x.size_ );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/in.m", "content": "function a = in( x, y )\n\nb = newcnstr( evalin( 'caller', 'cvx_problem', '[]' ), x, y, '==' );\nif nargout, a = b; end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/keywords.m", "content": "% CVX: Keywords for declaring variables and objectives\n% dual - Declares one or more dual variables.\n% epigraph - Declares an epigraph variable.\n% hypograph - Declares a hypograph variable.\n% maximize - Specifies a concave (or affine) objective to be maximized.\n% minimize - Specifies a convex (or affine) objective to be maximized.\n% subject - Implements the \"subject to\" keyword.\n% variable - Declares a single CVX variable with optional matrix structure.\n% variables - Declares one or more CVX variables.\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/matlab6.m", "content": "%CVX: Matlab 6 compatability functions.\n% This directory contains definitions for 'true' and 'false'. These\n% functions are used extensively in CVX, and are built in for MATLAB\n% 6.5 and later. For MATLAB 6.1 we supply these surrogates. It is\n% *very* important, however, that this directory NOT be placed in\n% the MATLAB search path for older versions of MATLAB.\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/sets.m", "content": "% CVX: Definitions of common convex sets.\n% complex_lorentz - Complex second-order cone. {(x,y): norm(x)<=y}\n% convex_poly_coeffs - Coefficients of convex degree-n polynomials. {p: p(x) convex}\n% exp_cone - The exponential cone. {(x,y,z): y>=0, y*exp(x/y) <= z }\n% hermitian_semidefinite - Hermitian positive semidefinite matrices. {X: X==X', min(eig(X))>=0}\n% lorentz - Real second-order cones. {(x,y): norm(x)<=y}\n% nonneg_poly_coeffs - Coefficients of nonnegative degree-n polynomials. {p: p(x)>=0 for all x}\n% nonnegative - The nonnegative orthant. {x: x>=0}\n% norm_ball - Norm ball. {x: norm(x,p) <= 1}\n% rotated_complex_lorentz - Rotated complex second-order cone. {(x,y,z): norm(x)^2 <= y*z, y>=0, z>=0 }\n% rotated_lorentz - Rotated real second-order cone. {(x,y,z): norm(x)^2 <= y*z, y>=0, z>=0 }\n% semidefinite - Real symmetric positive semidefinite matrices {X: X==X', min(eig(X))>=0}\n% simplex - The unit simplex. {x: x>=0, sum(x)==1}\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/sparsify.m", "content": "function x = sparsify( x, mode )\r\n\r\nglobal cvx___\r\nnarginchk(2,2);\r\npersistent remap\r\n\r\n%\r\n% Check mode argument\r\n%\r\n\r\nif ~ischar( mode ) || size( mode, 1 ) ~= 1,\r\n error( 'Second arugment must be a string.' );\r\nend\r\nisobj = strcmp( mode, 'objective' );\r\n\r\npr = cvx___.problems( end );\r\ntouch( pr.self, x );\r\nbz = x.basis_ ~= 0;\r\nbs = sum( bz, 1 );\r\nbc = bz( 1, : );\r\ntt = bs > bc + 1;\r\nat = any( tt );\r\nif at,\r\n \r\n %\r\n % Replace posynomials with log-convex monomials --- that is, unless\r\n % we are taking the exponential of one. (Not that I know why we \r\n % would do that!) In that case, we should just use a standard\r\n % linear replacement and leave it at that.\r\n %\r\n \r\n if ~isequal( mode, 'exponential' ),\r\n if isempty( remap ),\r\n remap = cvx_remap( 'posynomial' );\r\n end\r\n t2 = remap( cvx_classify( x ) );\r\n if any( t2 ),\r\n if all( t2 ),\r\n x = exp( log( x ) );\r\n else\r\n x = cvx_subsasgn( x, t2, exp( log( cvx_subsref( x, t2 ) ) ) );\r\n end\r\n bc( t2 ) = 0;\r\n tt = tt & ~t2;\r\n at = any( tt );\r\n end\r\n end\r\n \r\n %\r\n % Replace other multivariable forms with single-variable forms\r\n %\r\n \r\n if at,\r\n abc = any( bc( :, tt ) );\r\n if abc,\r\n xc = cvx_constant( x );\r\n x = x - xc;\r\n end\r\n forms = cvx___.linforms;\r\n repls = cvx___.linrepls;\r\n [ x, forms, repls ] = replcols( x, tt, 'full', forms, repls, isobj );\r\n cvx___.linforms = forms;\r\n cvx___.linrepls = repls;\r\n if abc,\r\n x = x + xc;\r\n end\r\n end\r\n \r\nend\r\n\r\n%\r\n% Arguments: no constraints on coefficients or constant values\r\n% Objectives: all replaced with coefficient > 0, constant terms preserved\r\n% Exponentiation: coefficient == 1, constant terms perserved\r\n% Logarithm: coefficient > 0, constant terms eliminated\r\n%\r\n\r\nswitch mode,\r\n case { 'argument', 'constraint' },\r\n tt = false;\r\n case 'objective',\r\n tt = ~tt | sum( x.basis_, 1 ) < x.basis_( 1, : );\r\n usexc = true;\r\n case 'logarithm',\r\n tt = sum( x.basis_, 1 ) < x.basis_( 1, : );\r\n usexc = false;\r\n case 'exponential';\r\n tt = sum( x.basis_, 1 ) ~= x.basis_( 1, : ) + 1;\r\n usexc = true;\r\n otherwise,\r\n error( [ 'Invalid normalization mode: ', mode ] );\r\nend\r\nif any( tt ),\r\n if usexc,\r\n abc = any( bc );\r\n if abc,\r\n xc = cvx_constant( x );\r\n x = x - xc;\r\n end\r\n else\r\n abc = false;\r\n end\r\n forms = cvx___.uniforms;\r\n repls = cvx___.unirepls;\r\n [ x, forms, repls ] = replcols( x, tt, 'none', forms, repls, isobj );\r\n cvx___.uniforms = forms;\r\n cvx___.unirepls = repls;\r\n if abc,\r\n x = x + xc;\r\n end\r\nend\r\n\r\nfunction [ x, forms, repls ] = replcols( x, tt, mode, forms, repls, isobj )\r\n\r\n%\r\n% Sift through the forms, removing duplicates\r\n%\r\n\r\nglobal cvx___\r\nbN = vec( cvx_subsref( x, tt ) );\r\nnO = length( forms );\r\nnN = length( bN );\r\nif nO ~= 0,\r\n bN = [ forms ; bN ];\r\nend\r\n[ bNR, bN ] = bcompress( bN, mode, nO );\r\nbNR = bNR( :, nO + 1 : end );\r\nnB = length( bN ) - nO;\r\n\r\n%\r\n% Create the replacement variables\r\n%\r\n\r\nif nB ~= 0,\r\n forms = bN;\r\n bN = cvx_subsref( bN, nO + 1 : nO + nB, 1 );\r\n newrepl = newvar( cvx___.problems( end ).self, '', nB );\r\n [ ndxs, temp ] = find( newrepl.basis_ ); %#ok\r\n repls = [ repls ; newrepl ];\r\n bV = cvx_vexity( bN );\r\n cvx___.vexity( ndxs ) = bV;\r\n cvx___.readonly( ndxs ) = vec( cvx_readlevel( bN ) );\r\n if ~isobj,\r\n ss = bV == 0;\r\n if any( ss ),\r\n temp = cvx_basis( bN );\r\n temp = any( temp( :, ss ), 2 );\r\n temp( ndxs( ss ) ) = true;\r\n cvx___.canslack( temp ) = false;\r\n end\r\n end\r\nend\r\n\r\n%\r\n% Re-expand the structure\r\n%\r\n\r\nx = cvx_subsasgn( x, tt, buncompress( bNR, repls, nN ) );\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/svec.m", "content": "function z = svec( x, nrm )\n\nif nargin < 2 || isempty( nrm ) || isequal( nrm, 'fro' ),\n nrm = 2;\nelseif ~isnumeric( nrm ) || length( nrm ) ~= 1 || nrm < 1,\n error( 'Second argument must be a number between 1 and Inf, or ''fro''.' );\nend\n\nif ~isreal( x ) && nrm ~= 2,\n z = vec( x );\n return\nelse\n [ xR, y ] = bcompress( x );\n if isempty( y ),\n z = cvx( 0 );\n else\n z = y .* norms( xR, nrm, 2 );\n end\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/type.m", "content": "function st = type( x, usegeo )\n\ndf = x.dof_;\nif nargin > 1 && usegeo,\n geo = any( df < 0 );\nelse\n geo = false;\nend\ndf = abs( df );\ns = x.size_;\nlen = prod( s );\n\nif len == 1,\n isstruct = 0;\n nzs = len;\n st = 'scalar';\nelse\n isstruct = ~isempty( df ) & ( sum( df ) < ( 2 - isreal( x.basis_ ) ) * len );\n if ~isstruct,\n nzs = nnz( any( x.basis_, 1 ) );\n end\n nd = length( s );\n st = sprintf( '%dx', s );\n st = st( 1 : end - 1 );\n if nd > 2,\n st = [ st, ' array' ];\n elseif any( s == 1 ),\n st = [ st, ' vector' ];\n else\n st = [ st, ' matrix' ];\n end\nend\n\nif isstruct,\n st = sprintf( '%s, %d d.o.f.', st, df );\nelseif nzs < len,\n if nzs > 1,\n st = sprintf( '%s, %d nonzeros', st, nzs );\n elseif nzs == 1,\n st = sprintf( '%s, 1 nonzero', st );\n end\nend\nif geo,\n st = [ st, ', geometric' ];\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvx/value.m", "content": "function v = value( x, data )\nglobal cvx___\nif nargin == 1,\n data = cvx___.x;\nend\nnx = size( data, 1 );\nnb = size( x.basis_, 1 );\nif nx < nb,\n data( end + 1 : nb, : ) = NaN;\nelseif nx > nb,\n data( nb + 1 : end, : ) = [];\nend\nv = cvx_reshape( data.' * x.basis_, x.size_ );\nif any( x.size_ == 1 ), v = full( v ); end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxcnst/cvxcnst.m", "content": "function v = cvxcnst( p, rhs )\nv = class( struct( 'problem', p, 'rhs', rhs ), 'cvxcnst' );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxcnst/disp.m", "content": "function disp( x )\ndisp( 'Constraint accepted' );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxcnst/display.m", "content": "function display( x )\nlong = ~isequal(get(0,'FormatSpacing'),'compact');\nif long, disp( ' ' ); end\ndisp(x);\nif long, disp( ' ' ); end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxcnst/double.m", "content": "function x = double( v ) %#ok\nerror( 'Disciplined convex programming error:\\n Constraints may not appear in if/then statements.', 1 ); %#ok\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxcnst/logical.m", "content": "function x = logical( v ) %#ok\nerror( 'Disciplined convex programming error:\\n Constraints may not appear in if/then statements.', 1 ); %#ok\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxcnst/rhs.m", "content": "function x = rhs( y )\nx = y.rhs;\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxdual/colon.m", "content": "function z = colon( x, y )\nif ~isa( x, 'cvxdual' ),\n z = x; x = y; y = z;\nend\nglobal cvx___\ntry\n dvars = cvx___.problems( x.problem_ ).dvars;\n q = builtin( 'subsref', dvars, x.name_ );\ncatch\n error( 'CVX:Corrupt', 'Internal CVX data corruption. Please CLEAR ALL and rebuild your model.' );\nend\nif q.attached_,\n nm = cvx_subs2str( x.name_ );\n error( 'CVX:DualInUse', 'Dual variable \"%s\" has already been assigned.', nm(2:end) );\nend\nq.attached_ = true;\ndvars = builtin( 'subsasgn', dvars, x.name_, q );\ncvx___.problems( x.problem_ ).dvars = dvars;\ntry\n z = cvx_setdual( y, x.name_ );\ncatch\n error( 'CVX:CannotAttachDual', 'Cannot attach a dual variable to an object of type %s.', class( y ) );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxdual/cvx_basis.m", "content": "function ans = cvx_basis( x, varargin )\nans = cvx_basis( cvxaff( x ), varargin{:} );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxdual/cvx_value.m", "content": "function v = cvx_value( x )\nv = value( x );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxdual/cvxaff.m", "content": "function y = cvxaff( x )\nglobal cvx___\ny = subsref( cvx___.problems( x.problem_ ).duals, x.name_ );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxdual/cvxdual.m", "content": "function y = cvxdual( prob, name )\n\ny = class( struct( 'problem_', prob, 'name_', name, 'attached_', false ), 'cvxdual', cvxobj );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxdual/disp.m", "content": "function disp( x, prefix, iname )\nif nargin < 2, prefix = ''; end\nif nargin < 3, iname = ''; end\nnm = cvx_subs2str( x.name_ );\nnm = nm(2:end);\nif ~isequal( nm, iname ),\n disp( [ prefix, 'cvx dual variable ', nm, ' (', type( x ), ')' ] );\nelse\n disp( [ prefix, 'cvx dual variable (', type( x ), ')' ] );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxdual/display.m", "content": "function display( x )\nnm = inputname(1);\nlong = ~isequal(get(0,'FormatSpacing'),'compact');\nif long, disp( ' ' ); end\ndisp([nm ' =']);\nif long, disp( ' ' ); end\ndisp(x,' ',nm);\nif long, disp( ' ' ); end\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxdual/dof.m", "content": "function y = dof( x )\ny = size( cvx_basis( cvxaff( x ) ), 2 );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxdual/inuse.m", "content": "function y = inuse( x )\ny = ~isempty( x );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxdual/isreal.m", "content": "function y = isreal( x )\ny = isreal( cvxaff( x ) );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxdual/name.m", "content": "function y = name( x )\ny = x.name_;\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxdual/problem.m", "content": "function p = problem( x )\r\np = x.problem_;\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxdual/size.m", "content": "function y = size( x, varargin )\ny = size( cvxaff( x ), varargin{:} );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxdual/subsref.m", "content": "function x = subsref( x, S )\nerror( 'Cannot use subscripting on dual variables.' );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxdual/type.m", "content": "function st = type( x )\n\nx = cvxaff( x );\nif isa( x, 'double' ),\n st = 'unassigned';\n return\nend\nif iscell( x ),\n strs = cell(1,numel(x));\n for k = 1 : numel(x),\n strs{k} = type(x{k});\n end\n strs = sprintf( '%s, ', strs{:} );\n st = strs(1:end-2);\n return\nend\ns = size( x );\nlen = prod( s );\nisr = isreal( x );\nif len == 1,\n if isr,\n st = 'scalar';\n else\n st = 'complex scalar';\n end\nelse\n dof = size( cvx_basis( x ), 2 ) - 1;\n isstruct = dof < ( 2 - isr ) * len;\n st = sprintf( '%dx', s );\n st = st( 1 : end - 1 );\n if ~isr,\n st = [ st, ' complex' ];\n end\n if length( s ) > 2,\n st = [ st, ' array' ];\n elseif any( s == 1 ),\n st = [ st, ' vector' ];\n else\n st = [ st, ' matrix' ];\n end\n if isstruct,\n st = sprintf( '%s (%d d.o.f.)', st, dof );\n end\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxdual/value.m", "content": "function v = value( x )\nglobal cvx___\nv = cvxaff( x );\nswitch class( v ),\n case 'cvx',\n v = value( v, cvx___.y );\n case 'cell',\n for k = 1 : numel( v ),\n v{k} = value( v{k}, cvx___.y );\n end\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxin/cvxin.m", "content": "function v = cvxin\nsuperiorto('cell','struct','cvx','cvxtuple');\nv = class( struct( 'active', false, 'value', [] ), 'cvxin' );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxin/cvxtuple.m", "content": "function v = cvxtuple( varargin )\n\nif nargin == 1,\n v = varargin{1};\n switch class( v ),\n case 'struct',\n if numel( v ) ~= 1,\n error( 'struct arrays not permitted in cvx tuple objects.' );\n end\n case 'cell',\n v = reshape( v, 1, numel( v ) );\n otherwise,\n return\n end\nelse\n v = varargin;\nend\n\nv = class( struct( 'value_', { v } ), 'cvxtuple', cvxobj );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxin/gt.m", "content": "function a = gt( x, y )\n\nif isa(y,'cvxin')||~isa(x,'cvxin')||~x.active,\n error( 'CVX error: improper use of the pseudo-operator.' );\nend\nb = newcnstr( evalin( 'caller', 'cvx_problem', '[]' ), x.value, y, '==' );\nif nargout, a = b; end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxin/lt.m", "content": "function y = lt( x, y )\n\nif isa(x,'cvxin')||~isa(y,'cvxin')||y.active,\n error( 'CVX error: improper use of the pseudo-operator.' );\nend\ny.active = true;\ny.value = x;\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxobj/cvx_id.m", "content": "function y = cvx_id( x )\ny = x.id_;\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxobj/cvxobj.m", "content": "function y = cvxobj()\nglobal cvx___\nif isempty( cvx___ ),\n error( 'Internal cvx data corruption' );\nend\ncvx___.id = cvx___.id + 1;\ny = class( struct( 'id_', cvx___.id ), 'cvxobj' );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxobj/disp.m", "content": "function disp( x, prefix ) %#ok\nif nargin < 2, prefix = ''; end\ndisp( [ prefix, 'cvx base object' ] );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxobj/display.m", "content": "function display( x )\nlong = ~isequal(get(0,'FormatSpacing'),'compact');\nif long, disp( ' ' ); end\ndisp([inputname(1) ' =']);\nif long, disp( ' ' ); end\ndisp(x,' ')\nif long, disp( ' ' ); end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxobj/isempty.m", "content": "function y = isempty( x )\ny = any( size( x ) == 0 );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxobj/isequal.m", "content": "function z = isequal( x, y )\nz = x.id_ == y.id_;\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxobj/length.m", "content": "function n = length( x )\ns = size( x );\nif any( s == 0 ),\n n = 0;\nelse\n n = max( s );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxobj/ndims.m", "content": "function n = ndims( x )\nn = length( size( x ) );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxobj/numel.m", "content": "function n = numel( x, varargin )\nn = prod( size( x ) ); %#ok\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxobj/subsasgn.m", "content": "function x = subsasgn( x, S, y )\r\nerror( 'Subscripted assignment not allowed for these objects.' );\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxobj/subsref.m", "content": "function x = subsref( x, S, cheat )\r\nerror( 'Subscripts not allowed for this object.' );\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxprob/cvx_value.m", "content": "function v = cvx_value( x )\r\nwarning( 'CVX:IllegalUse', ...\r\n 'CVX error: illegal use of a cvx problem object has been detected.\\n Please do not copy or manipulate the value of ''cvx_problem'' in any way.', 1 ); %#ok\r\nv = [];\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxprob/cvxprob.m", "content": "function z = cvxprob( varargin )\n\nglobal cvx___\ncvx_global\ntstart = tic;\nif ~iscellstr( varargin ),\n error( 'Arguments must be strings.' );\nend\n\n%\n% Clear out any old problems left at this depth. These will be here due to\n% an error while constructing a CVX model, or due to the user deciding to\n% start over when constructing a model\n%\n\nst = dbstack;\ndepth = length( st ) - 2;\nif length(st) <= 2,\n name = '';\nelse\n name = st(3).name;\nend\nif ~isempty( cvx___.problems ),\n ndx = find( [ cvx___.problems.depth ] >= depth );\n if ~isempty( ndx ),\n temp = cvx___.problems(ndx(1));\n if temp.depth == depth && ( ~isempty(temp.objective) || ~isempty(temp.variables) || ~isempty(temp.duals) || nnz(temp.t_variable) > 1 );\n warning( 'CVX:Empty', 'A non-empty cvx problem already exists in this scope.\\n It is being overwritten.', 1 ); %#ok\n end\n pop( temp.self, 'reset' );\n end\nend\n\n%\n% Grab the latest defaults to place in the new problem\n%\n\nif ~isempty( cvx___.problems ),\n nprec = cvx___.problems( end ).precision;\n npflag = cvx___.problems( end ).precflag;\n nrprec = cvx___.problems( end ).rat_growth;\n nsolv = cvx___.problems( end ).solver;\n nquiet = cvx___.problems( end ).quiet;\nelse\n nprec = cvx___.precision;\n npflag = cvx___.precflag;\n nrprec = cvx___.rat_growth;\n selected = cvx___.solvers.selected;\n if isfield( cvx___.solvers.list, 'settings' ),\n nsolv = struct( 'index', selected, 'settings', cvx___.solvers.list(selected).settings );\n else\n nsolv = struct( 'index', selected, 'settings', [] );\n end\n nquiet = cvx___.quiet;\nend\n\n%\n% Construct the object\n%\n\nz = class( struct( 'index_', length( cvx___.problems ) + 1 ), 'cvxprob', cvxobj );\ntemp = struct( ...\n 'name', name, ...\n 'complete', true, ...\n 'sdp', false, ...\n 'gp', false, ...\n 'separable', false, ...\n 'locked', false, ...\n 'precision', nprec, ...\n 'precflag', npflag, ...\n 'solver', nsolv, ...\n 'quiet', nquiet, ... \n 'cputime', cputime, ...\n 'tictime', tstart, ...\n 'rat_growth', nrprec, ...\n 't_variable', logical( sparse( length( cvx___.reserved ), 1 ) ), ...\n 'n_equality', length(cvx___.equalities), ...\n 'n_linform', length(cvx___.linforms), ...\n 'n_uniform', length(cvx___.uniforms), ...\n 'variables', [], ...\n 'duals', [], ...\n 'dvars', [], ...\n 'direction', '', ...\n 'geometric', [], ...\n 'objective', [], ...\n 'status', 'unsolved', ...\n 'result', [], ...\n 'bound', [], ...\n 'iters', Inf, ...\n 'tol', Inf, ...\n 'depth', depth, ...\n 'self', z );\ntemp.t_variable( 1 ) = true;\n\n%\n% Process the argument strings\n%\n\nfor k = 1 : nargin,\n mode = varargin{k};\n switch lower( mode ),\n case 'quiet',\n temp.quiet = true;\n case 'set',\n temp.complete = false;\n temp.direction = 'find';\n case 'sdp',\n if temp.gp,\n error( 'The GP and SDP modifiers cannot be used together.' );\n end\n temp.sdp = true;\n case 'gp',\n if temp.sdp,\n error( 'The GP and SDP modifiers cannot be used together.' );\n end\n temp.gp = true;\n if cvx___.expert == 0,\n cvx___.expert = -1;\n end\n case 'separable',\n temp.separable = true;\n otherwise,\n error( 'Invalid CVX problem modifier: %s', mode );\n end\nend\n\n%\n% Add the problem to the stack\n%\n\nif isempty( cvx___.problems ),\n cvx___.problems = temp;\n cvx_setpath(1);\n if cvx___.profile,\n profile resume\n end\nelse\n cvx___.problems( end + 1 ) = temp;\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxprob/disp.m", "content": "function disp( prob, prefix )\n\nif nargin < 2, prefix = ''; end\n\nglobal cvx___\np = cvx___.problems( prob.index_ );\n\nif isempty( p.variables ),\n nvars = 0;\nelse\n nvars = length( fieldnames( p.variables ) );\nend\nif isempty( p.duals ),\n nduls = 0;\nelse\n nduls = length( fieldnames( p.duals ) );\nend\nneqns = ( length( cvx___.equalities ) - p.n_equality ) + ...\n ( length( cvx___.linforms ) - p.n_linform ) + ...\n ( length( cvx___.uniforms ) - p.n_uniform );\nnineqs = nnz( cvx___.needslack( p.n_equality + 1 : end ) ) + ...\n nnz( cvx_vexity( cvx___.linrepls( p.n_linform + 1 : end ) ) ) + ...\n nnz( cvx_vexity( cvx___.unirepls( p.n_uniform + 1 : end ) ) );\nneqns = neqns - nineqs; \nif isempty( p.name ) || strcmp( p.name, 'cvx_' ),\n nm = '';\nelse\n nm = [ p.name, ': ' ];\nend\n\nrsv = cvx___.reserved;\nnt = length( rsv );\nfv = length( p.t_variable );\nqv = fv + 1 : nt;\ntt = p.t_variable;\nni = nnz( tt ) - 1;\nndup = sum( rsv ) - nnz( rsv );\nneqns = neqns + ndup;\nnv = nt - fv + ni + ndup;\ntt( qv ) = true;\ngfound = nnz( cvx___.logarithm( tt ) );\ncfound = false;\nfor k = 1 : length( cvx___.cones ),\n if any( any( tt( cvx___.cones( k ).indices ) ) ),\n cfound = true;\n break;\n end\nend\n\nif all( [ numel( p.objective ), nv, nvars, nduls, neqns, nineqs, cfound, gfound ] == 0 ),\n disp( [ prefix, nm, 'cvx problem object' ] );\nelse\n if ( p.gp ),\n ptype =' geometric ';\n elseif ( p.sdp ),\n ptype = ' semidefinite ';\n else\n ptype = ' ';\n end\n if isempty( p.objective ),\n tp = 'feasibility';\n else\n switch p.direction,\n case 'minimize', tp = 'minimization';\n case 'epigraph', tp = 'epigraph minimization';\n case 'hypograph', tp = 'hypograph maximization';\n case 'maximize', tp = 'maximization';\n end\n if numel( p.objective ) > 1,\n sz = sprintf( '%dx', size( p.objective ) );\n tp = [ sz(1:end-1), '-objective ', tp ];\n end\n end\n disp( [ prefix, nm, 'cvx', ptype, tp, ' problem' ] );\n if nvars > 0,\n disp( [ prefix, 'variables: ' ] );\n [ vnam, vsiz ] = dispvar( p.variables, '' );\n vnam = strvcat( vnam ); %#ok\n vsiz = strvcat( vsiz ); %#ok\n for k = 1 : size( vnam ),\n disp( [ prefix, ' ', vnam( k, : ), ' ', vsiz( k, : ) ] );\n end\n end\n if nduls > 0,\n disp( [ prefix, 'dual variables: ' ] );\n [ vnam, vsiz ] = dispvar( p.duals, '' );\n vnam = strvcat( vnam ); %#ok\n vsiz = strvcat( vsiz ); %#ok\n for k = 1 : size( vnam ),\n disp( [ prefix, ' ', vnam( k, : ), ' ', vsiz( k, : ) ] );\n end\n end\n if neqns > 0 || nineqs > 0,\n disp( [ prefix, 'linear constraints:' ] );\n if neqns > 0,\n if neqns > 1, plural = 'ies'; else plural = 'y'; end\n fprintf( 1, '%s %d equalit%s\\n', prefix, neqns, plural );\n end\n if nineqs > 0,\n if nineqs > 1, plural = 'ies'; else plural = 'y'; end\n fprintf( 1, '%s %d inequalit%s\\n', prefix, nineqs, plural );\n end\n end\n if cfound || gfound,\n disp( [ prefix, 'nonlinearities:' ] );\n if gfound > 0,\n if gfound > 1, plural = 's'; else plural = ''; end\n fprintf( 1, '%s %d exponential pair%s\\n', prefix, gfound, plural );\n end\n if cfound,\n for k = 1 : length( cvx___.cones ),\n ndxs = cvx___.cones( k ).indices;\n ndxs = ndxs( :, any( reshape( tt( ndxs ), size( ndxs ) ), 1 ) );\n if ~isempty( ndxs ),\n if isequal( cvx___.cones( k ).type, 'nonnegative' ),\n ncones = 1;\n csize = numel( ndxs );\n else\n [ csize, ncones ] = size( ndxs );\n end\n if ncones == 1, plural = ''; else plural = 's'; end\n fprintf( 1, '%s %d order-%d %s cone%s\\n', prefix, ncones, csize, cvx___.cones( k ).type, plural );\n end\n end\n end\n end\nend\n\nfunction [ names, sizes ] = dispvar( v, name )\n\nswitch class( v ),\n case 'struct',\n fn = fieldnames( v );\n if ~isempty( name ), name( end + 1 ) = '.'; end\n names = {}; sizes = {};\n for k = 1 : length( fn ),\n [ name2, size2 ] = dispvar( subsref(v,struct('type','.','subs',fn{k})), [ name, fn{k} ] );\n names( end + 1 : end + length( name2 ) ) = name2;\n sizes( end + 1 : end + length( size2 ) ) = size2;\n if k == 1 && ~isempty( name ), name( 1 : end - 1 ) = ' '; end\n end\n case 'cell',\n names = {}; sizes = {};\n for k = 1 : length( v ),\n [ name2, size2 ] = dispvar( v{k}, sprintf( '%s{%d}', name, k ) );\n names( end + 1 : end + length( name2 ) ) = name2;\n sizes( end + 1 : end + length( size2 ) ) = size2;\n if k == 1, name( 1 : end ) = ' '; end\n end\n case 'double',\n names = { name };\n sizes = { '(constant)' };\n otherwise,\n names = { name };\n sizes = { [ '(', type( v, true ), ')' ] };\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxprob/eliminate.m", "content": "function [ dbCA, cones, dir, Q, P, dualized ] = eliminate( prob, destructive, can_dual )\nif nargin < 3, can_dual = nargout >= 6; end\nif nargin < 2, destructive = false; end\n\n% For the problem\n%\n% minimize c' * x + d\n% s.t. y : A * x + b == 0\n% x \\in K\n%\n% The Lagrangian is\n% \n% L(x,y,z) = c' * x + d - y' * ( A x + b ) - z' * x\n%\n% [ - d b' 0 ] [ 1 ]\n% = - [ 1, x' ] * [ - c A' I ] * [ y ]\n% [ z ]\n%\n% This function provides a smaller [ d, b' ; c, A' ] with no more nonzeros\n% that solves an equivalent problem. The original x and y can be recovered\n% from the reduced xx and yy by Q*[1;xx] and P*[1;-yy], respectively.\n\n[ dbCA, cones, dir, Q, P ] = extract( prob, destructive );\ndualized = false;\nif size( dbCA, 1 ) == 1, \n return; \nend\n\n%\n% Negate the objective so that the transformation matrices P and Q are\n% properly formed.\n%\n\ndbCA(:,1) = -dbCA(:,1);\nif ~issparse( dbCA ),\n dbCA = sparse( dbCA );\nend\n\nfor pass = 1 : 2,\n\n if pass == 1 || dualized,\n n_tot = 0;\n nn = size(dbCA,1);\n rsv = sparse( 1, 1, 1, nn, 1 );\n nng = sparse( nn, 1 );\n for k = 1 : length( cones ),\n temp = cones(k).indices;\n n_tot = n_tot + numel(temp);\n temp = sparse( temp, 1, 1, nn, 1 );\n rsv = rsv + temp;\n if isequal( cones(k).type, 'nonnegative' ),\n nng = nng + temp;\n elseif can_dual && strncmp( cones(k).type, 'i_', 2 ),\n can_dual = false;\n end\n end\n rsv = full( rsv );\n nng = full( nng );\n ndxs = ( 1 : nn )';\n nold = nn;\n end\n\n cc = dbCA( :, 1 );\n rcnt = sum( dbCA ~= 0, 2 );\n \n % In the first pass, we don't eliminate columns which have inequality\n % structure to them, so that we can make the best decision as to\n % whether or not to convert the problem to dual standard form. Exempted\n % from this are columns with trivial xi = xj constraints, where xi is free.\n if pass == 1,\n trivs = sum( dbCA(rsv==0,:) ~= 0, 1 ) == 1 & sum( dbCA(rsv~=0,:) ~= 0, 1 ) - ( dbCA( 1, : ) ~= 0 ) == 1;\n ineqs = full(any(dbCA(rsv~=0&rcnt==1,:),1)) & full(~trivs);\n ineqs = +ineqs;\n else % if dualized,\n ineqs = zeros(1,size(dbCA,2));\n end\n ineqs(1) = 1;\n \n while true,\n \n success = false;\n \n %\n % STEP 1: Look for free or nonnegative variables that do not appear\n % in any constraints. Unconstrained variables that also appear in\n % the objective are unbounded, as are nonnegative variables that\n % appear there with the right sign. Otherwise their values might\n % as well be zero. If we have multiple unbounded variables, keep\n % all but one so that the solver can still see this happen.\n %\n % Eliminated for now. Frankly, my suspicion is that this happens\n % very infrequently, and this code seems to have been the source\n % of bugs in the past.\n %\n \n if 0,\n rows = ( rcnt == ( cc ~= 0 ) ) & ( ~rsv | nng );\n nnzr = nnz( rows );\n if nnzr > 0,\n csgn = 1 - 2 * dualized;\n celm = csgn * cc( rows, 1 );\n celm( nng(rows) & celm < 0 ) = 0;\n nnzc = nnz( celm );\n if nnzc > 1 || nnzr > nnzc,\n success = true;\n if nnzc,\n cnrm = norm( celm );\n ndxq = find( rows );\n ndxq = ndxq( celm ~= 0 );\n ndxq = ndxq( 1 );\n Q( :, ndxq ) = Q( :, rows ) * ( celm / cnrm );\n dbCA( ndxq, 1 ) = csgn * cnrm; %#ok\n rows( ndxq ) = 0;\n end\n rowX = ~rows;\n dbCA = dbCA( rowX, : );\n rsv = rsv ( rowX, : );\n nng = nng ( rowX, : );\n ndxs = ndxs( rowX, : );\n Q = Q( :, rowX );\n end\n end\n end\n \n %\n % STEP 2: Look for columns which differ only by a constant factor.\n % These correspond to redundant equality constraints. These occur\n % often enough as as consequence of our tranformation method, and\n % they cause problems in solvers, so we must eliminate them. Of\n % course, if there are more complex linear dependencies in the\n % equality constraints, we can't do anything about that.\n %\n \n [ xR, dbCA ] = cvx_bcompress( dbCA, 'full', 1 );\n if size( xR, 1 ) ~= size( xR, 2 ),\n success = true;\n P = P * cvx_invert_structure( xR );\n ineqs = ( xR * ineqs(:) )' ~= 0;\n ineqs = +ineqs;\n end\n \n while true,\n \n %\n % STEP 3: Look for variables that we can eliminate without\n % increasing fill-in. This means looking for rows or columns\n % with only 1, 2, or (in some cases) 3 nonzeros.\n %\n \n [ rows, cols ] = cvx_eliminate_mex( dbCA, 1, rsv, ineqs );\n if ~any( rows ), break; end\n success = true;\n rows = rows ~= 0;\n cols = cols ~= 0;\n rowX = ~rows;\n colX = ~cols;\n \n %\n % [ x1^T x2^T ] [ C1 A11 A12 ] [ 1 ]\n % [ C2 A21 A22 ] [ y1 ] = 0\n % [ y2 ]\n %\n % [ x1^T x2^T ] = x1^T [ I -A12*A22i ]\n %\n % [ G Y1^T Y2^T ] = [ G Y1^T ] [ I 0 -C2'*A22i' ]\n % [ 0 I -A21'*A22i' ]\n \n %\n A11 = dbCA( rowX, colX );\n A12 = dbCA( rowX, cols );\n A21 = dbCA( rows, colX );\n A22 = dbCA( rows, cols );\n if ( size( A22, 1 ) ~= size( A22, 2 ) || nnz( A22 ) ~= size( A22, 1 ) ),\n error( 'There seems to be an error in the CVX presolver routine.\\nPlease report this to the authors; and if possible, include the\\ncvx model and data that gave you this error.', 1 ); %#ok\n end\n [ ii, jj, vv ] = find( A22 );\n A22i = sparse( jj, ii, 1.0 ./ vv );\n temp = - A22i * A21;\n P = P( :, colX ) + P( :, cols ) * temp;\n temp = - A12 * A22i;\n Q = Q( :, rowX ) + Q( :, rows ) * temp';\n dbCA = A11 + temp * A21;\n rsv = rsv( rowX, : );\n nng = nng( rowX, : );\n ndxs = ndxs( rowX, : );\n ineqs = ineqs( :, colX );\n \n end\n \n if ~success,\n break;\n end\n \n cc = dbCA( :, 1 );\n rcnt = sum( dbCA ~= 0, 2 );\n \n end\n \n if pass == 2 || isempty(cones) || ~can_dual,\n break;\n end\n \n %\n % Check to see if dualization will result in smaller problem\n %\n ineqs(1) = 0; rsv(1) = 0;\n n_save = nnz(cvx_eliminate_mex(dbCA,1,rsv,zeros(size(ineqs))));\n % n_save = nnz(sum(dbCA(:,ineqs~=0)~=0,1)==1+(dbCA(1,ineqs~=0)~=0));\n n_ineq = nnz(any(dbCA(rsv&rcnt==(cc~=0)+1,:)));\n rsv(1) = 1; ineqs(1) = 1; %#ok\n [n1,m1] = size(dbCA);\n m_pri = m1 - n_save - 1;\n n_pri = n1 - n_save - 1;\n m_dua = n1 - n_ineq - 1;\n n_dua = nnz( rsv ) + m1 - n_ineq - 1;\n if ( ( m_pri > n_pri ) || ( m_pri * m_pri * n_pri > m_dua * m_dua * n_dua ) ) && ( m_dua <= n_dua ),\n ndxs = full(sparse(ndxs,1,1:n1));\n PP = cell(2,length(cones));\n n_cur = m1;\n for k = 1 : length(cones),\n temp = cones(k).indices;\n [nn,nv] = size(temp);\n temp = reshape(ndxs(temp),size(temp));\n switch cones(k).type,\n case 'semidefinite',\n nt = 0.5*(sqrt(8*nn+1)-1);\n SS = 'symmetric';\n case 'hermitian-semidefinite',\n nt = sqrt(nn);\n SS = 'hermitian';\n case 'exponential',\n SS = sparse(inv([0,-1,0;-1,0,0;0,0,exp(1)]));\n SS = cvx_replicate_structure(SS,nv);\n otherwise,\n SS = [];\n end\n PP{k} = sparse(1:numel(temp),max(temp,1),temp~=0,numel(temp),n1);\n if ~isempty(SS),\n if ischar(SS),\n SS = cvx_create_structure([nt,nt,nv],SS);\n SS = SS * SS';\n end\n PP{k} = SS * PP{k};\n end\n cones(k).indices = reshape(n_cur+1:n_cur+nn*nv,nn,nv);\n n_cur = cones(k).indices(end);\n end\n dbCA = vertcat(dbCA',PP{:});\n dir = -dir;\n tmp = Q; Q = P; P = tmp;\n nold = size(dbCA,1);\n Q(:,nold) = 0;\n dualized = true;\n end\n \nend\n\n%\n% Return the objective back to normal.\n%\n\nif dualized,\n P = -P;\n P(:,1) = -P(:,1);\nelse\n dbCA(:,1) = -dbCA(:,1);\nend\n\n%\n% Move the cone indices to their new locations\n%\n\nndxs = full( sparse( ndxs, 1, 1 : length( ndxs ), nold, 1 ) );\ntt = zeros(1,length(cones));\nfor k = 1 : length( cones ),\n temp = ndxs(cones(k).indices);\n if all(temp),\n temp = reshape( temp, size(cones(k).indices) );\n else\n temp = nonzeros(temp);\n temp = reshape( temp, 1, length(temp) );\n end\n tt(k) = isempty(temp);\n cones(k).indices = temp;\nend\nif any(tt),\n cones(tt~=0) = [];\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxprob/eq.m", "content": "function z = eq( x, y )\nif ~isa( x, class( y ) )\n error( 'cvxprob objects may only be compared to each other.' );\nelse\n z = cvx_id( x ) == cvx_id( y );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxprob/extract.m", "content": "function [ dbcA, cones, dir, Q, P, ineqs ] = extract( pp, destructive, doineqs )\r\nif nargin < 3 || nargout < 6, doineqs = true; end\r\nif nargin < 2 || nargout < 5, destructive = false; end\r\n\r\nglobal cvx___\r\np = cvx___.problems( pp.index_ );\r\nn = length( cvx___.reserved );\r\n\r\n%\r\n% Objective\r\n%\r\n\r\ndbcA = p.objective;\r\nif isempty(p.objective),\r\n dir = 1;\r\n dbcA = cvx( [ 1, 1 ], [] );\r\nelseif strcmp( p.direction, 'minimize' ) || strcmp( p.direction, 'epigraph' ),\r\n dbcA = sum( vec( dbcA ) );\r\n dir = 1;\r\nelse\r\n dbcA = - sum( vec( dbcA ) );\r\n dir = -1;\r\nend\r\n\r\n%\r\n% Equality constraints\r\n%\r\n\r\nAA = cvx___.equalities;\r\nineqs = cvx___.needslack;\r\nnpre = p.n_equality;\r\nntot = length( AA );\r\nif p.n_equality > 0,\r\n AA = AA( p.n_equality + 1 : end, : );\r\n ineqs = ineqs( p.n_equality + 1 : end, : );\r\n if destructive,\r\n cvx___.equalities( p.n_equality + 1 : end ) = [];\r\n cvx___.needslack( p.n_equality + 1 : end ) = [];\r\n end\r\nelseif destructive,\r\n cvx___.equalities = cvx( [ 0, 1 ], [] );\r\n cvx___.needslack = false( 0, 1 ) ;\r\nend\r\nif ~isempty( AA ),\r\n ineqs = [ false ; ineqs ];\r\n dbcA = [ dbcA ; AA ];\r\n clear AA\r\nend\r\n\r\n%\r\n% Linear forms\r\n%\r\n\r\nif p.n_linform > 0,\r\n A1 = cvx___.linforms( p.n_linform + 1 : end, : );\r\n A2 = cvx___.linrepls( p.n_linform + 1 : end, : );\r\n if destructive,\r\n cvx___.linforms( p.n_linform + 1 : end ) = [];\r\n cvx___.linrepls( p.n_linform + 1 : end ) = [];\r\n end\r\nelse\r\n A1 = cvx___.linforms;\r\n A2 = cvx___.linrepls;\r\n if destructive,\r\n cvx___.linforms = cvx( [ 0, 1 ], [] );\r\n cvx___.linrepls = cvx( [ 0, 1 ], [] );\r\n end\r\nend\r\nif ~isempty( A1 ),\r\n zV = cvx_vexity( A2 ); \r\n zQ = ( zV == 0 ) - zV;\r\n dbcA = [ dbcA ; minus( zQ .* A1, zQ .* A2, true ) ];\r\n ineqs( end + 1 : end + length( A1 ), : ) = zV ~= 0;\r\n clear A1 A2 zV zQ\r\nend\r\n\r\n%\r\n% Univariable forms\r\n%\r\n\r\nif p.n_uniform > 0,\r\n A1 = cvx___.uniforms( p.n_uniform + 1 : end, : );\r\n A2 = cvx___.unirepls( p.n_uniform + 1 : end, : );\r\n if destructive,\r\n cvx___.uniforms( p.n_uniform + 1 : end ) = [];\r\n cvx___.unirepls( p.n_uniform + 1 : end ) = [];\r\n end\r\nelse\r\n A1 = cvx___.uniforms;\r\n A2 = cvx___.unirepls;\r\n if destructive,\r\n cvx___.uniforms = cvx( [ 0, 1 ], [] );\r\n cvx___.unirepls = cvx( [ 0, 1 ], [] );\r\n end\r\nend\r\nif ~isempty( A2 ),\r\n zV = cvx_vexity( A2 );\r\n zQ = ( zV == 0 ) - zV;\r\n dbcA = [ dbcA ; minus( zQ .* A1, zQ .* A2, true ) ];\r\n ineqs( end + 1 : end + length( A1 ), : ) = zV ~= 0;\r\n clear A1 A2 zV zQ\r\nend\r\n\r\n%\r\n% Convert to basis\r\n%\r\n\r\ndbcA = cvx_basis( dbcA );\r\nnA = size( dbcA, 1 );\r\nif nA < n,\r\n dbcA( n, end ) = 0;\r\nelseif n < nA,\r\n dbcA = dbcA( 1 : n, : );\r\nend\r\n\r\n%\r\n% Determine which inequalities need slack variables. Not all of them do,\r\n% because some may contain variables which themselves can absorb any slack,\r\n% and thus can be converted to equations without sacrificing equivalence.\r\n% We are somewhat conservative in our determinations here: the variable\r\n% must appear *only* in this inequality, and has been identified as free\r\n% to grow without further constraint in the direction of slack. For\r\n% example, consider the inequality\r\n% x + y <= z\r\n% where y is an epigraph variable of a convex constraint f(w) <= y. If y\r\n% does not *also* appear in the objective coerced against growth, then we\r\n% are free to replace the inequality with the equation\r\n% x + y == z\r\n% and equivalence is preserved. We attempt to be very conservative here,\r\n% so it is possible that we do not catch all of the cases where\r\n% inequalities may be converted to equations.\r\n%\r\n\r\nif any( ineqs ) && any( cvx___.canslack ),\r\n slacks = find( cvx___.canslack );\r\n sterms = dbcA( slacks, : );\r\n oterms = sterms( :, 1 );\r\n ecount = sum( sterms( :, ~ineqs ) ~= 0, 2 ) - ( oterms ~= 0 );\r\n sterms = sterms( :, ineqs );\r\n icount = sum( sterms ~= 0, 2 );\r\n sterms = sum( sterms, 2 );\r\n sdirec = cvx___.vexity( slacks );\r\n nslack = icount == 1 & ecount == 0 & sterms .* sdirec <= 0 & sterms .* oterms >= 0;\r\n ineqs( any( dbcA( slacks( nslack ), : ), 1 ) ) = false;\r\nend\r\n\r\n%\r\n% Select the cones used\r\n%\r\n\r\nocones = [];\r\nused = full( any( dbcA, 2 ) );\r\nif all( used ),\r\n cones = cvx___.cones;\r\nelse\r\n cones = [];\r\n for k = 1 : length( cvx___.cones ),\r\n cone = cvx___.cones( k );\r\n temp = any( reshape( used( cone.indices ), size( cone.indices ) ), 1 );\r\n if any( temp ),\r\n ncone = cone;\r\n ncone.indices = ncone.indices( :, temp );\r\n if isempty( cones ),\r\n cones = ncone;\r\n else\r\n cones = [ cones, ncone ];\r\n end\r\n end\r\n if destructive && ~all( temp ),\r\n cone.indices( :, temp ) = [];\r\n if isempty( ocones ),\r\n ocones = cone;\r\n else\r\n ocones = [ ocones, cone ];\r\n end\r\n end\r\n end\r\nend\r\nif destructive,\r\n cvx___.cones = ocones;\r\nend\r\n\r\n%\r\n% Add the slack variables\r\n%\r\n\r\nif doineqs,\r\n nsl = nnz( ineqs );\r\n if nsl ~= 0,\r\n dbcA = [ dbcA ; sparse( 1 : nsl, find( ineqs ), -1, nsl, length( ineqs ) ) ];\r\n ncone = struct( 'type', 'nonnegative', 'indices', n+1:n+nsl );\r\n if isempty( cones ),\r\n cones = ncone;\r\n else\r\n tt = find(strcmp({cones.type},'nonnnegative'));\r\n if ~isempty( tt ),\r\n cones(tt(1)).indices = [ cones(tt(1)).indices, ncone.indices ];\r\n else\r\n cones = [ ncone, cones ];\r\n end\r\n end\r\n end\r\n ineqs = [];\r\nelse\r\n ineqs = find(ineqs);\r\nend\r\n\r\n%\r\n% Q and P matrices\r\n%\r\n\r\nused = find( used );\r\nQ = sparse( used, used, 1, n, n + nsl );\r\nP = sparse( [ 1, npre + 2 : ntot + 1 ], 1 : ntot - npre + 1, 1, ntot + 1, size( dbcA, 2 ) );\r\n\r\n%\r\n% Exponential and logarithm indices\r\n%\r\n\r\nif cvx___.exp_used,\r\n esrc = find( cvx___.exponential );\r\n edst = full( cvx___.exponential( esrc ) );\r\n tt = any(dbcA(esrc,:),2) & any(dbcA(edst,:),2);\r\n if any( tt ),\r\n % Determine the indices of the exponentials\r\n esrc = esrc(tt);\r\n edst = edst(tt);\r\n nexp = length(esrc);\r\n lvar = n + nsl + 3 * nexp;\r\n % Create the exponential cones\r\n ncone.type = 'exponential';\r\n ncone.indices = reshape( n+nsl+1:lvar, 3, nexp );\r\n % Expand Q, P, dbCA\r\n Q(end,lvar) = 0;\r\n P(end,lvar) = 0;\r\n dbcA(lvar,end) = 0;\r\n % Add equality consraints to tie the exponential cones to esrc and edst\r\n % and set the exponential perspective variable to 1\r\n ndxc = reshape( 1 : 3 * nexp, 3, nexp );\r\n dbcA = [ dbcA, sparse( ...\r\n [ esrc(:)' ; ones(1,nexp) ; edst(:)' ; ncone.indices ], ...\r\n [ ndxc ; ndxc ], ... \r\n [ ones(3,nexp) ; -ones(3,nexp) ] ) ];\r\n if isempty( cones ),\r\n cones = ncone;\r\n else\r\n tt = find(strcmp({cones.type},'exponential'));\r\n if ~isempty( tt ),\r\n cones(tt(1)).indices = [ cones(tt(1)).indices, ncone.indices ];\r\n else\r\n cones = [ cones, ncone ];\r\n end\r\n end\r\n end\r\nend\r\n\r\n%\r\n% Reserved flags\r\n%\r\n\r\nif destructive,\r\n pop( pp, 'extract' );\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxprob/index.m", "content": "function y = index( x )\r\ny = x.index_;\r\n\r\n% Copyright 2005-2016 CVX Research, Inc. \r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxprob/ne.m", "content": "function z = ne( x, y )\nz = ~eq( x, y );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxprob/newcnstr.m", "content": "function [ outp, sdp_mode ] = newcnstr( prob, x, y, op, sdp_mode )\npersistent map_eq map_le map_ge map_ne\n \n%\n% Check problem\n%\n\nif ~isa( prob, 'cvxprob' ),\n error( 'A cvx problem must be created first.' );\nend\nglobal cvx___\np = prob.index_;\ny_orig = y;\n\n%\n% Check for a dual reference\n%\n\ndx = cvx_getdual( x );\ndy = cvx_getdual( y );\nif isempty( dx ),\n dx = dy;\nelseif ~isempty( dy ),\n error( [ 'Two dual variable references found: \"', dx, '\",\"', dy, '\"' ] );\nend\nif ~isempty( dx ),\n duals = cvx___.problems( p ).duals;\n try\n dual = builtin( 'subsref', duals, dx );\n catch\n nm = cvx_subs2str( dx );\n error( [ 'Dual variable \"', nm(2:end), '\" has not been declared.' ] );\n end\n if ~isempty( dual ),\n nm = cvx_subs2str( dx );\n error( [ 'Dual variable \"', nm(2:end), '\" already in use.' ] );\n end\nend\n\n%\n% Check arguments\n%\n\nif isa( x, 'cvxcnst' ), \n x = rhs( x ); \nend\ncx = isnumeric( x ) | isa( x, 'cvx' );\ncy = isnumeric( y ) | isa( y, 'cvx' );\nif ~cx,\n x = cvx_collapse( x, false, true );\n cx = isnumeric( x ) | isa( x, 'cvx' );\nend\nif ~cy,\n y = cvx_collapse( y, false, true );\n cy = isnumeric( y ) | isa( y, 'cvx' );\nend\nsx = size( x );\nsy = size( y );\nif ~cx || ~cy,\n if cx || cy || op(1) ~= '=',\n error( 'Invalid CVX constraint: {%s} %s {%s}', class( x ), op, class( y ) );\n elseif ~isequal( sx, sy ),\n error( 'The left- and right-hand sides have incompatible sizes.' );\n else\n if ~isempty( dx ),\n duals = cvx___.problems( p ).duals;\n duals = builtin( 'subsasgn', duals, dx, cell(sx) );\n cvx___.problems( p ).duals = duals;\n end\n nx = prod( sx );\n for k = 1 : nx,\n newcnstr( prob, x{k}, y{k}, op );\n end\n if nargout,\n outp = cvxcnst( prob, y_orig );\n end\n return\n end\nend\nxs = all( sx == 1 );\nys = all( sy == 1 );\nif xs,\n sz = sy;\nelseif ys || isequal( sx, sy ),\n sz = sx;\nelse\n error( 'Matrix dimensions must agree.' );\nend\n\n%\n% Check readlevel\n%\n\ntx = cvx_readlevel( x );\nty = cvx_readlevel( y );\ntx = any( tx( : ) > p );\nty = any( ty( : ) > p );\nif tx || ty,\n error( 'Constraints may not involve internal, read-only variables.' );\nend\n\n%\n% Handle the SDP case\n%\n\nif nargin < 5 || ~sdp_mode,\n sdp_mode = op(1) ~= '=' && cvx___.problems( p ).sdp;\nend\nif sdp_mode,\n mx = sx( 1 ) > 1 & sx( 2 ) > 1;\n my = sy( 1 ) > 1 & sy( 2 ) > 1;\n sdp_mode = mx || my;\nend\nif sdp_mode,\n \n if sx( 1 ) ~= sx( 2 ) || sy( 1 ) ~= sy( 2 ),\n error( 'SDP constraint must be square.' );\n elseif xs && cvx_isnonzero( x ),\n error( 'SDP constraint {scalar} %s {matrix} valid only if the scalar is zero.', op );\n elseif ys && cvx_isnonzero( y ),\n error( 'SDP constraint {matrix} %s {scalar} valid only if the scalar is zero.', op );\n elseif ~cvx_isaffine( x ) || ~cvx_isaffine( y ),\n error( 'Both sides of an SDP constraint must be affine.' );\n end\n zq = any( cvx_basis( x ), 1 ) | any( cvx_basis( y ), 1 );\n qn = bsxfun( @plus, (1:sz(1)+1:sz(1)*sz(2))', 0:sz(1)*sz(2):prod(sz)-1 );\n if nnz( zq ) == nnz( zq( qn ) ),\n [ tx, dummy ] = find( cvx_basis( nonnegative( numel(qn) ) ) );\n z = cvx( sz, sparse( tx, qn, 1, tx(end), prod(sz) ) );\n else\n z = semidefinite( sz, ~isreal( x ) || ~isreal( y ) );\n end\n if op(1) == '>',\n z = minus( x, plus( y, z ) );\n else\n z = minus( y, plus( x, z ) );\n end\n op = '==';\n\nelse\n \n sdp_mode = false;\n if isempty( map_ge ),\n temp = cvx_remap( 'constant' );\n temp = ~ ( temp' * temp );\n \n map_ne = cvx_remap;\n\n map_eq2 = cvx_remap( 'log-affine' );\n map_eq2 = ( map_eq2' * map_eq2 ) & temp;\n map_eq3 = cvx_remap( 'affine' );\n map_eq3 = map_eq3' * map_eq3;\n map_eq = 2 * map_eq2 + map_eq3;\n\n % Trivially feasible constraints\n map_ge1 = ( cvx_remap( 'log-concave' )' * cvx_remap( 'nonpositive' ) ) & temp;\n % Trivially infeasible constraints\n map_ge2 = ( cvx_remap( 'nonpositive' )' * cvx_remap( 'log-convex' ) ) & temp;\n % Full geometric constraints\n map_ge3 = ( cvx_remap( 'log-concave' )' * cvx_remap( 'log-convex' ) ) & temp;\n % Linear constraints\n map_ge4 = ( cvx_remap( 'concave' )' * cvx_remap( 'convex' ) ) & ~map_ge3;\n map_ge = map_ge4 + 2 * map_ge3 + 3 * map_ge2 + 4 * map_ge1;\n\n map_le = map_ge';\n end\n switch op(1),\n case '<',\n remap = map_le;\n case '>',\n remap = map_ge;\n case '~',\n remap = map_ne;\n otherwise,\n remap = map_eq;\n end\n vx = cvx_classify( x );\n vy = cvx_classify( y );\n vm = vx + size( remap, 1 ) * ( vy - 1 );\n vr = remap( vm );\n tt = vr( : ) == 0;\n if any( tt ),\n [ vu, vi ] = unique( vm );\n vi = vi( remap( vu ) == 0 );\n strs = {};\n xt = x; yt = y;\n for k = 1 : length( vi ),\n if any( sx ~= 1 ), xt = x(vi(k)); end\n if any( sy ~= 1 ), yt = y(vi(k)); end\n strs{k+1} = sprintf( '\\n Invalid constraint: {%s} %s {%s}', cvx_class( xt, false, true ), op, cvx_class( yt, false, true ) );\n end\n error( [ sprintf( 'Disciplined convex programming error:' ), strs{:} ] );\n end\n tt = vr( : ) == 2;\n if any( tt ),\n if all( tt ),\n x = log( x );\n y = log( y );\n else\n if isscalar( x ), x = x * ones(size(y)); end\n if isscalar( y ), y = y * ones(size(x)); end\n x( tt ) = log( x( tt ) );\n y( tt ) = log( y( tt ) );\n end\n end\n tt = vr( : ) == 3;\n if any( tt ),\n x( tt ) = 0;\n y( tt ) = 1 - 2 * ( op(1) == '<' );\n end\n tt = vr( : ) == 4;\n if any( tt ),\n x( tt ) = 0;\n y( tt ) = 1 - 2 * ( op(1) == '>' );\n end\n if op(1) == '<',\n z = minus( y, x );\n else\n z = minus( x, y );\n end\n \nend\n\n%\n% Eliminate lexical redundancies\n%\n\nif op( 1 ) == '=',\n cmode = 'full';\nelse\n cmode = 'magnitude';\nend\n[ zR, zL ] = bcompress( z, cmode );\nif sdp_mode,\n if isreal( zR ),\n nnq = 0.5 * sz( 1 ) * ( sz( 1 ) + 1 );\n else\n nnq = sz( 1 ) * sz( 1 );\n end\n if size( zR, 1 ) > nnq * prod( sz( 3 : end ) ),\n warning( 'CVX:UnsymmetricLMI', [ ...\n 'This linear matrix inequality appears to be unsymmetric. This is\\n', ...\n 'very likely an error that will produce unexpected results. Please check\\n', ...\n 'the LMI; and, if necessary, re-enter the model.' ], 1 ); \n end\nend\n\n%\n% Add the (in)equalities\n%\n\ntouch( prob, zL, op(1) == '=' );\nmO = length( cvx___.equalities );\nmN = length( zL );\ncvx___.equalities = vertcat( cvx___.equalities, zL );\ncvx___.needslack( end + 1 : end + mN, : ) = op( 1 ) ~= '=';\n\n%\n% Create the dual\n%\n\nif ~isempty( dx ),\n zI = cvx_invert_structure( zR )';\n zI = sparse( mO + 1 : mO + mN, 1 : mN, 1 ) * zI;\n zI = cvx( sz, zI );\n duals = builtin( 'subsasgn', duals, dx, zI );\n cvx___.problems( p ).duals = duals;\nend\n\n%\n% Create the output object\n%\n\nif nargout,\n outp = cvxcnst( prob, y_orig );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxprob/newdual.m", "content": "function z = newdual( prob, name, reps )\nnarginchk(2,3);\n\n%\n% Check problem\n%\n\nif ~isa( prob, 'cvxprob' ),\n error( 'First argument must be a cvxprob object.' );\nend\nglobal cvx___\np = prob.index_;\nvars = cvx___.problems( p ).duals;\n\n%\n% Check name\n%\n\nif isempty( name ),\n error( 'Anonymous dual variables are not allowed.' );\nelseif ischar( name ),\n if ~isempty( name ),\n if size( name, 1 ) ~= 1,\n error( 'Second argument must be a string or a subscript structure array.' );\n elseif ~isvarname( name ),\n error( 'Invalid dual variable name: %s', name );\n elseif isfield( vars, name ),\n error( 'Dual variable name conflict: %s', name );\n elseif isfield( cvx___.problems( p ).variables,name ),\n error( 'Primal/dual variable name conflict: %s', name );\n end\n end\nend\n\n%\n% Check repetition\n%\n\nif nargin < 3,\n reps = [];\nelseif ~isempty( reps ),\n [ temp, reps ] = cvx_check_dimlist( reps, true );\n if ~temp,\n error( 'Third argument must be a dimension list.' );\n end\nend\n\n%\n% Add the variable to the problem\n%\n\nnstr = struct( 'type', '.', 'subs', name );\nif ~isempty( reps ),\n y = cell( reps );\n [ y{:} ] = deal( cvx );\n z = cell( reps );\n q = cell( reps );\n ndxs = cell( 1, length( reps ) - ( reps(end) == 1 ) );\n [ ndxs{:} ] = ind2sub( reps, 1 : prod( reps ) );\n ndxs = vertcat( ndxs{:} );\n nstr(2).type = '{}';\n for k = 1 : prod( reps ),\n nstr(2).subs = sprintf( '%d,', ndxs(:,k) );\n nstr(2).subs = eval( [ '{', nstr(2).subs(1:end-1), '}' ] );\n z{k} = cvxdual( p, nstr );\n end\nelse\n y = [];\n z = cvxdual( p, nstr );\nend\nvars = cvx___.problems( p ).dvars;\nvars = builtin( 'subsasgn', vars, nstr(1), z );\ncvx___.problems( p ).dvars = vars;\nvars = cvx___.problems( p ).duals;\nvars = builtin( 'subsasgn', vars, nstr(1), y );\ncvx___.problems( p ).duals = vars;\ncvx___.x = [];\ncvx___.y = [];\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxprob/newnonl.m", "content": "function newnonl( prob, ncones, arg ) %#ok\r\nnarginchk(2,3);\r\nglobal cvx___\r\ncones = cvx___.cones;\r\nif nargin == 3,\r\n ncones = struct( 'type', ncones, 'indices', arg );\r\nend\r\nfor k = 1 : length( ncones ),\r\n ncone = ncones(k);\r\n if any( cvx___.reserved( ncone.indices( : ) ) ),\r\n error( 'Variables placed in nonlinearities must be free.' );\r\n else\r\n cvx___.reserved( ncone.indices ) = 1;\r\n end\r\n if isequal( ncone.type, 'nonnegative' ),\r\n ncone.indices = ncone.indices(:)';\r\n end\r\n if isempty( cones ),\r\n cones = ncone;\r\n else\r\n match = find( strcmp( { cones.type }, ncone.type ) );\r\n if ~isempty( match ),\r\n nlsiz = size( ncone.indices, 1 );\r\n match = match( cellfun( 'size', { cones(match).indices }, 1 ) == nlsiz );\r\n if isempty( match ),\r\n cones = [ cones, ncone ];\r\n else\r\n match = match(1);\r\n cones(match).indices = [ cones(match).indices, ncone.indices ];\r\n end\r\n else\r\n cones = [ cones, ncone ];\r\n end\r\n end\r\nend\r\ncvx___.cones = cones;\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxprob/newobj.m", "content": "function newobj( prob, dir, x )\nnarginchk(3,3);\n\npersistent remap_min remap_max remap\nif isempty( remap_max ),\n remap_min = cvx_remap( 'convex', 'log-convex' );\n remap_max = cvx_remap( 'concave', 'log-concave' );\n remap = cvx_remap( 'log-valid' ) & ~cvx_remap( 'constant' );\nend\n\n%\n% Check problem\n%\n\nif ~isa( prob, 'cvxprob' ),\n error( 'First argument must be a cvxprob object.' );\nend\nglobal cvx___\np = prob.index_;\nif ~isempty( cvx___.problems( p ).direction ),\n\tif isequal( dir, 'find' ),\n error( 'Objective functions cannot be added to sets.' );\n else\n\t error( 'An objective has already been supplied for this problem.' );\n\tend\nend\n\n%\n% Check direction\n%\n\nif ~ischar( dir ) || size( dir, 1 ) ~= 1,\n error( 'The second argument must be a string.' );\nend\n\n%\n% Check objective expression\n%\n\nif ~isa( x, 'cvx' ) && ~isa( x, 'double' ) && ~isa( x, 'sparse' ),\n error( 'Cannot accept an objective of type ''%s''.', class( x ) );\nelseif ~isreal( x ),\n error( 'Expressions in objective functions must be real.' );\nelseif isempty( x ),\n warning( 'CVX:EmptyObjective', 'Empty objective.' );\nend\ncx = cvx_classify( x );\nswitch dir,\n case 'minimize',\n\t \tvx = remap_min( cx );\n case 'maximize',\n\t \tvx = remap_max( cx );\n otherwise,\n error( 'Invalid objective type: %s', dir );\nend\nif ~all( vx ),\n error( 'Disciplined convex programming error:\\n Cannot %s a(n) %s expression.', dir, cvx_class(x(vx==0),false,true) );\nend\n\n%\n% Store the objective\n%\n\nvx = remap( cx );\nif any( vx ),\n if all( vx ),\n x = log( x );\n else\n x( vx ) = log( x( vx ) );\n end\nend\nif isa( x, 'cvx' ),\n zndx = any( cvx_basis( x ), 2 );\n v = cvx___.problems( p ).t_variable;\n cvx___.problems( p ).t_variable = v | zndx( 1 : size( v, 1 ), : );\nend\ncvx___.problems( p ).objective = x;\ncvx___.problems( p ).direction = dir;\ncvx___.problems( p ).geometric = vx;\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxprob/newtemp.m", "content": "function z = newtemp( prob, siz )\n\n% NEWTEMP Creates a temporary variable.\n\nglobal cvx___\nvstr = cvx___.problems( prob.index_ ).variables;\nif isfield( vstr, 'temp_' ),\n ndx = length( vstr.temp_ );\nelse\n ndx = 0;\nend\nbase = struct( 'type', { '.', '{}' }, 'subs', { 'temp_', { ndx + 1 } } );\nz = newvar( prob, base, siz );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxprob/newvar.m", "content": "function y = newvar( prob, name, siz, str, geo )\nnarginchk(2,5);\n\n%\n% Check problem\n%\n\nif ~isa( prob, 'cvxprob' ),\n error( 'First argument must be a cvxprob object.' );\nend\np = prob.index_;\nglobal cvx___\n\n%\n% Check name\n%\n\nif isempty( name ),\n nstr = [];\nelseif ischar( name ),\n nstr = struct( 'type', '.', 'subs', name );\nelseif ~isstruct( name ),\n error( 'Second argument must be a string or a subscript structure array.' );\nelse\n nstr = name;\n name = cvx_subs2str( name, [ 1, 0, 1 ], 1 );\n name(1) = [];\n if ~isequal( nstr(1).type, '.' ),\n error( 'Invalid subscript structure: first element must be a field reference.' );\n end\nend\n\n%\n% Retrieve an existing variable, and check for conflicts\n%\n\nvars = cvx___.problems( p ).variables;\nif ~isempty( nstr ),\n try\n y = builtin( 'subsref', vars, nstr );\n catch\n y = [];\n end\n if nargin == 2,\n if ~isempty( y ), return; end\n error( [ 'Unknown variable: ', name ] );\n elseif ~isempty( y ),\n error( [ 'Duplicate variable name: ', name ] );\n end\nelseif nargin == 2,\n error( 'Second argument must be a non-empty string or subscript structure array.' );\nelse\n y = []; %#ok\nend\n\n%\n% Check for conflict with dual variable\n%\n\nif ~isempty( nstr ) && isfield( cvx___.problems( p ).duals, nstr(1).subs ),\n error( 'Primal/dual variable name conflict: %s', nstr(1).subs );\nend\n\n%\n% Quick exit for retrieval mode\n%\n\nif nargin == 2,\n y = cvx___.problems( p ).variables;\n try\n y = subsref( y, name );\n return\n catch\n error( [ 'Unknown variable: ', nstr ] );\n end\nend\n\n%\n% Create the variable\n%\n\nif isa( siz, 'cvx' ),\n\n %\n % Out of an existing object\n %\n\n y = newsubst( prob, siz );\n\nelse\n\n %\n % Check size\n %\n\n [ temp, siz ] = cvx_check_dimlist( siz, true );\n if ~temp,\n error( 'Invalid size vector.' );\n end\n\n %\n % Check structure\n %\n\n len = prod( siz );\n if nargin < 4 || isempty( str ),\n dof = len;\n str = [];\n elseif ~isnumeric( str ) || ndims( str ) > 2 || size( str, 2 ) ~= len, %#ok\n error( 'Fourth argument must be a valid structure matrix.' );\n elseif nnz( str ) == 0,\n error( 'Structure matrix cannot be identically zero.' );\n else\n temp = any( str, 2 );\n dof = full( sum( temp ) );\n if dof ~= length( temp ),\n str = str( temp, : );\n end\n end\n\n %\n % Geometric flag\n %\n\n if nargin < 5 || isempty( geo ),\n geo = false;\n elseif ~isnumeric( geo ) && ~islogical( geo ) || length( geo ) ~= 1,\n error( 'Fifth argument must be true or false.' );\n end\n\n %\n % Allocate the raw variable data\n %\n\n geo = any( geo( : ) );\n ndim = length( cvx___.reserved );\n ndim = ndim + 1 : ndim + dof;\n nmel = ( 1 + geo ) * dof;\n cvx___.reserved( end + nmel, 1 ) = 0;\n cvx___.vexity( end + dof, 1 ) = 0;\n cvx___.canslack( end + 1 : end + nmel, 1 ) = true;\n cvx___.readonly( end + 1 : end + nmel, 1 ) = p;\n cvx___.logarithm( end + dof, 1 ) = 0;\n if geo,\n cvx___.vexity( end + 1 : end + dof, 1 ) = 1;\n cvx___.logarithm( end + 1 : end + dof, 1 ) = ndim';\n ndim = ndim(end) + 1 : ndim(end) + dof;\n cvx___.exponential( end + 1 : end + dof, 1 ) = ndim';\n cvx___.exp_used = true;\n end\n cvx___.exponential( end + dof, 1 ) = 0;\n cvx___.x = [];\n cvx___.y = [];\n\n %\n % Create the variable object\n %\n\n if dof == 0,\n str2 = sparse( 1, 0 );\n else\n str2 = sparse( ndim, 1 : dof, 1 );\n if ~isempty( str ),\n str2 = str2 * str;\n end\n end\n y = cvx( siz, str2, dof * ( 1 - 2 * geo ), false );\n\nend\n\n%\n% If the variable is named, save it in the problem structure\n%\n\nif ~isempty( nstr ),\n try\n cvx___.problems( p ).variables = builtin( 'subsasgn', vars, nstr, y );\n catch\n error( [ 'Invalid variable name: ', name ] );\n end\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxprob/pop.m", "content": "function pop( depth, clearmode )\n\n%\n% Determine the index of the problem to be cleaned up\n%\n\nglobal cvx___\nif nargin < 2, \n\tclearmode = 'clear'; \nend\nif isempty( cvx___ ),\n\tcvx_global\n\treturn\nend\np = depth.index_;\nif p > length( cvx___.problems ),\n\treturn\nend\n\n%\n% Determine the indices of the variables, constraints, etc.\n%\n\nif p < 1,\n p = 1;\n pid = -1;\n nf = 0;\n ne = 1;\n nl = 1;\n nu = 1;\nelse\n prob = cvx___.problems( p );\n pid = cvx_id( prob.self );\n nf = length( prob.t_variable ) + 1;\n ne = prob.n_equality + 1;\n nl = prob.n_linform + 1;\n nu = prob.n_uniform + 1;\nend\n\n%\n% Clear the corresponding and equality constraints and variables\n%\n\nif ~isequal( clearmode, 'none' ),\n if nf <= 2,\n cvx___.reserved = 0;\n cvx___.vexity = 0;\n cvx___.canslack = false;\n cvx___.readonly = 0;\n cvx___.cones = struct( 'type', {}, 'indices', {} );\n if ~isequal( clearmode, 'extract' ),\n cvx___.exponential = sparse( 1, 1 );\n cvx___.logarithm = sparse( 1, 1 );\n cvx___.exp_used = false;\n end\n elseif length( cvx___.reserved ) >= nf,\n temp = nf : length( cvx___.reserved );\n cvx___.reserved( temp, : ) = [];\n cvx___.vexity( temp, : ) = [];\n cvx___.canslack( temp, : ) = [];\n cvx___.readonly( temp, : ) = [];\n if ~isempty( cvx___.cones ),\n tt = true( 1, length( cvx___.cones ) );\n for k = 1 : length( cvx___.cones ),\n cvx___.cones( k ).indices( :, any( cvx___.cones( k ).indices >= nf, 1 ) ) = [];\n if isempty( cvx___.cones( k ).indices ), tt( k ) = false; end\n end\n cvx___.cones = cvx___.cones( 1, tt );\n end\n if ~isequal( clearmode, 'extract' ),\n cvx___.exponential( temp, : ) = [];\n cvx___.logarithm( temp, : ) = [];\n cvx___.exp_used = nnz( cvx___.exponential );\n end\n end\n if nf <= 2 || ne <= 1,\n cvx___.equalities = cvx( [ 0, 1 ], [] );\n cvx___.needslack = ( false( 0, 1 ) );\n elseif length( cvx___.equalities ) >= ne,\n cvx___.equalities( ne : end ) = [];\n cvx___.needslack( ne : end ) = [];\n end\n if nf <= 2 || nl <= 1,\n cvx___.linforms = cvx( [ 0, 1 ], [] );\n cvx___.linrepls = cvx( [ 0, 1 ], [] );\n elseif length( cvx___.linforms ) >= nl,\n cvx___.linforms( nl : end ) = [];\n cvx___.linrepls( nl : end ) = [];\n end\n if nf <= 2 || nu <= 1,\n cvx___.uniforms = cvx( [ 0, 1 ], [] );\n cvx___.unirepls = cvx( [ 0, 1 ], [] );\n elseif length( cvx___.uniforms ) >= nu,\n cvx___.uniforms( nu : end ) = [];\n cvx___.unirepls( nu : end ) = [];\n end\n cvx___.nan_used = any( isnan( cvx___.vexity ) );\nend\n\nif ~isequal( clearmode, 'extract' ),\n \n %\n % Clear the workspace\n %\n\n if ~isequal( clearmode, 'reset' ),\n s1 = evalin( 'caller', 'who' );\n s2 = sprintf( '%s, ', s1{~strcmp(s1,'cvx___')} );\n s2 = evalin( 'caller', sprintf( 'cellfun( @cvx_id, { %s } )', s2(1:end-2) ) );\n tt = s2 >= pid;\n s1 = s1( tt );\n s2 = s2( tt );\n if ~isempty( s1 ),\n switch clearmode,\n case 'value',\n tt = s2 == pid;\n if any( tt ),\n evalin( 'caller', sprintf( '%s ', 'clear ', s1{tt} ) );\n s1(tt) = [];\n end\n if ~isempty( s1 ),\n temp = sprintf( '%s, ', s1{:} );\n temp(end-1:end) = [];\n evalin( 'caller', sprintf( '[ %s ] = cvx_values( %s );', temp, temp ) );\n end\n case 'clear',\n evalin( 'caller', sprintf( '%s ', 'clear', s1{:} ) );\n case 'none',\n tt = find( s2 == pid );\n if any( tt ),\n evalin( 'caller', sprintf( '%s ', 'clear', s1{tt} ) );\n end\n end\n end\n evalin( 'caller', 'clear cvx_problem' );\n end\n \n %\n % Clear the problem stack and value vectors\n %\n\n cvx___.problems( p : end ) = [];\n cvx___.x = [];\n cvx___.y = [];\n if p == 1,\n cvx_clearpath( 1 );\n end\n \nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxprob/solve.m", "content": "function solve( prob )\n\nglobal cvx___\np = prob.index_;\npr = cvx___.problems( p );\nquiet = pr.quiet;\nobj = pr.objective;\ngobj = pr.geometric;\nprec = pr.precision;\nsolv = pr.solver;\nndual = ~isempty( pr.duals );\nshim = cvx___.solvers.list( solv.index );\nif isempty(shim.eargs), eargs = {}; else eargs = shim.eargs; end\nnobj = numel( obj );\nif nobj > 1 && ~pr.separable,\n error( 'CVX:NonScalarObjective', 'Your objective function is not a scalar.' );\nend\n[ At, cones, sgn, Q, P, dualized ] = eliminate( prob, true, shim.dualize );\n\nif ndual && any( strncmp( {cones.type}, 'i_', 2 ) ),\n idual_error = true;\n ndual = false;\nelse\n idual_error = false;\nend\n\nc = At( :, 1 );\nAt( :, 1 ) = [];\nd = c( 1, : );\nc( 1, : ) = [];\n[ n1, m ] = size( At );\nif n1 < 1,\n b = zeros( m, 1 );\nelse\n b = - At( 1, : ).';\n At( 1, : ) = [];\nend\nn = n1 - 1;\nfor k = 1 : length( cones ),\n cones(k).indices = cones(k).indices - 1;\nend\n\nzero_c = false ; % nnz( c ) == 0;\nif zero_c,\n c = [ c ; 1 ]; %#ok\n At(end+1,:) = b * sqrt(mean(sum(At.^2))) / norm(b);\n cones(end+1) = struct( 'type', 'nonnegative', 'indices', n+1 );\n n = n + 1;\nend\n\n%\n% Ferret out the degenerate and overdetermined problems\n%\n\nx = NaN * ones(n,1);\ny = NaN * ones(m,1);\noval = NaN;\nbval = NaN;\npval = NaN;\ndval = NaN;\ntprec = Inf;\nestruc = [];\n\niters = 0;\ntt = ( b' ~= 0 ) & ~any( At, 1 );\ninfeas = any( tt );\nif m > n && n > 0,\n \n %\n % Overdetermined problem\n %\n \n if dualized,\n status = 'Underdetermined';\n estr = sprintf( 'Underdetermined inequality constraints detected.\\n CVX cannot solve this problem; but it is likely unbounded.' );\n else\n status = 'Overdetermined';\n estr = sprintf( 'Redundant equality constraints detected.\\n CVX cannot solve this problem; but it is likely infeasible.' );\n end\n if ~quiet,\n disp( estr );\n else\n warning( [ 'CVX:', status ], estr );\n end\n\nelseif n ~= 0 && ~infeas && ( any( b ) || any( c ) ),\n \n %\n % Call solver\n %\n \n if isempty( cones ),\n texp = [];\n else\n texp = find( strcmp( { cones.type }, 'exponential' ) );\n end\n need_iter = ~isempty( texp ) && shim.dualize;\n cvx_setspath;\n if ~quiet,\n disp( ' ' );\n spacer = '-';\n if need_iter,\n disp( 'Successive approximation method to be employed.' );\n else\n sname = shim.name;\n if ~isempty( shim.version ), sname = [ sname, ' ', shim.version ]; end\n fprintf( 'Calling %s: %d variables, %d equality constraints\\n', sname, n, m );\n spacer = spacer(:,ones(1,60));\n end\n if dualized,\n fprintf( ' For improved efficiency, %s is solving the dual problem.\\n', shim.name );\n end\n if need_iter,\n fprintf( ' %s will be called several times to refine the solution.\\n', shim.name );\n fprintf( ' Original size: %d variables, %d equality constraints\\n', n, m );\n spacer = spacer(:,ones(1,65));\n else\n disp( spacer );\n end\n end\n if cvx___.profile, profile off; end\n tstart = tic;\n if need_iter,\n \n %\n % Cone:\n % cl { (x,y,z) | y*exp(x/y) <= z, y > 0 }\n % = cl { (x,y,z) | x <= -y*log(y/z), z > 0 }\n % Approximation: given a shift point x0,\n % { (x,y,z) | y*exp(x0)*pos(1+(x/y-x0)/16)^16 <= z, y > 0 }\n % { (x,y,z) | y+(x-x0*y)/16 <= exp(-x0/16)*geo_mean([z,y],[],[1,15])\n % Transformed cone:\n % 4 semidefinite cones, 1 free, 1 slack\n % [ w1 ][ w4 ] [ w7 ] [ w10 ] w13\n % [ w2 w3 ][ w5 w6 ] [ w8 w9 ] [ w11 w12 ] w14\n % w2 = w4, w5 = w7, w8 = w10\n % w3 = w6, w6 = w9, w9 = w12,\n % exp(-x0/16) * w11 = w3 ( 1 - x0 / 16 ) + w13 / 16 + w14\n % Recovery:\n % x = w13\n % y = w3\n % z = w1\n %\n \n ndxs = cat( 2, cones(texp).indices );\n nc = size(ndxs,2);\n xndxs = ndxs(1,:);\n yndxs = ndxs(2,:);\n zndxs = ndxs(3,:);\n x0 = realmin * ones(nc,1);\n maxw = log(realmax);\n \n epow = 8;\n switch epow,\n case 16,\n QAi = [ 2, 4, 3, 6, 5, 7, 6, 9, 8,10, 9,12,3, 11, 13, 14 ]';\n QAj = [ 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6,7, 7, 7, 7 ]';\n QAv = [+1,-1,+1,-1,+1,-1,+1,-1,+1,-1,+1,-1,1.001,-1.002,1/16, 1 ]';\n QAr = [3,4,2,5,6,7,8,9,10,11,12,13,1,14];\n % ewid = 1.75;\n case 8,\n QAi = [ 2, 4, 3, 6, 5, 7, 6, 9,3, 8, 10, 11 ]';\n QAj = [ 1, 1, 2, 2, 3, 3, 4, 4,5, 5, 5, 5 ]';\n QAv = [+1,-1,+1,-1,+1,-1,+1,-1,1.001,-1.002, 1/8, 1 ]';\n QAr = [3,4,2,5,6,7,8,9,10,1,11];\n % ewid = 1.22;\n case 4,\n QAi = [ 2, 4, 3, 6,3, 5, 7, 8 ]';\n QAj = [ 1, 1, 2, 2,3, 3, 3, 3 ]';\n QAv = [+1,-1,+1,-1,1.001,-1.002, 1/4, 1 ]';\n QAr = [3,4,2,5,6,7,1,8];\n % ewid = 0.84;\n end\n \n nQA = max(QAi);\n mQA = max(QAj);\n nc = size(ndxs,2);\n new_n = n + (nQA-3) * nc; % + 1;\n new_m = m + mQA * nc;\n n_ndxs = [ ndxs ; reshape( n + 1 : new_n, nQA-3, nc ) ];\n n_ndxs = n_ndxs(QAr,:);\n if ~quiet,\n fprintf( ' %d exponentials add %d variables, %d equality constraints\\n', nc, new_n - n, new_m - m );\n disp( spacer );\n end\n\n % Stuff free variables into a lorentz cone to preserve warm start\n % tfree = ones( 1, n );\n % for k = 1 : length(cones),\n % tfree(cones(k).indices) = 0;\n % end\n % tfree(xndxs) = 1;\n % tfree = find(tfree);\n \n % Perform (x,y,z) ==> w transformation on A and C\n c (new_n,end) = 0;\n At(new_n,end) = 0;\n \n % Add new cone constraints\n lQA = length(QAi);\n nc0 = 0:mQA:mQA*(nc-1);\n nc1 = ones(1,nc);\n Anew = sparse( n_ndxs(QAi,:), ...\n QAj(:,nc1) + nc0(ones(lQA,1),:), ...\n QAv(:,nc1), new_n, mQA * nc );\n bnew = zeros( new_m - m, 1 );\n \n endxs = n_ndxs(nQA-3,:) + (mQA-1+nc0) * new_n;\n fndxs = n_ndxs(3,:) + (mQA-1+nc0) * new_n;\n \n ncone.type = 'semidefinite';\n ncone.indices = reshape(n_ndxs(1:nQA-2,:),3,(nQA-2)*nc/3);\n ncone(2).type = 'nonnegative';\n ncone(2).indices = n_ndxs(nQA,:);\n cones(texp) = [];\n cones = [ cones, ncone ];\n \n arow = size(Anew,2) / nc;\n orow = ones(arow,1);\n amult = ones(1,nc);\n epow_i = 1 / epow;\n\n oprec = prec;\n best_x = NaN * ones(n,1);\n best_y = NaN * ones(m,1);\n best_prec = Inf;\n if ~quiet, \n disp( ' Cones | Errors |' );\n disp( 'Mov/Act | Centering Exp cone Poly cone | Status' );\n disp( '--------+---------------------------------+---------' );\n end\n failed = 0;\n attempts = 0;\n last_err = Inf;\n last_cer = Inf;\n last_solved = 0;\n max_eiters = 25;\n for iter = 1 : max_eiters,\n % Insert the current centerpoints into the constraints\n x0e = x0 * epow_i;\n ex0e = exp( -x0e );\n Anew(endxs) = - ex0e; %#ok\n Anew(fndxs) = 1 - x0e; %#ok\n Anew2 = Anew * diag(sparse(vec(amult(orow,:))));\n \n % Solve the approximation\n [ x, status, tprec, iters2, y, z ] = shim.solve( [ At, Anew2 ], [ b ; bnew ], c, cones, true, prec, solv.settings, eargs{:} );\n iters = iters + iters2;\n x_valid = ~any(isnan(x));\n y_valid = ~any(isnan(y));\n \n % The approximate primal cone is a strict subset of the exact\n % primal cone. A point that is feasible for the approximate \n % model is guaranteed to be feasible for the exact model only\n % if x/y == x0. Furthermore, the larger |x/y-x0| is, the weaker\n % the approximation. So, our goal in these iterations is to\n % minimize |x/y - x0|. The hope is that we can reduce this gap\n % to the point that the deviation from exact feasibility is\n % within our desired numerical tolerance.\n % Exact: y .* exp( x ./ y ) <= z\n % Approx: exp(x0) .* y .* max(0,1+(x./y-x0)/p).^p <= z\n if x_valid,\n xxx = x( xndxs, : );\n yyy = max( realmin, x( yndxs, : ) );\n zzz = max( realmin, x( zndxs, : ) );\n nmX = sqrt( xxx .^ 2 + yyy .^ 2 + zzz .^ 2 );\n xxy = xxx ./ yyy - x0;\n zzy = zzz ./ yyy;\n xxz = log( zzy ) - x0;\n xxc = epow * ( max( 0, zzy .^ epow_i .* ex0e ) - 1 );\n tlX = max( 0, xxy - xxc );\n erX = max( 0, xxy - xxz );\n acX = erX ~= 0;\n cxX = xxy + 0.5 * ( xxz - xxy ) .* acX;\n ttt = yyy == realmin;\n if any( ttt ),\n xxy( ttt ) = -2 * ( sign( xxx( ttt ) ) * realmax );\n cxX( ttt ) = max( 1 - epow, min( xxy( ttt ), epow - 1 ) );\n tlX( ttt ) = 0;\n erX( ttt ) = 0;\n end\n end\n \n % The exact dual cone is a strict subset of the approximate\n % dual cone. Therefore any point that is dual feasible in the\n % approximate model is also dual feasible in the exact model.\n % The further x/y is from x0, the farther away such a point\n % will be from the boundary of the exact dual cone.\n % Exact: -u.*exp(v/u-1)<=w\n % Approx: -exp(-x0).*u.*(1-(v./u-1+x0)/(p-1)).^(1-p)<=w\n if y_valid,\n z = z + Anew2 * y(m+1:end);\n uuu = min( -realmin, z( xndxs, : ) );\n vvv = z( yndxs, : );\n www = max( +realmin, z( zndxs, : ) );\n nmY = sqrt( uuu .^ 2 + vvv .^ 2 + www .^ 2 );\n wwu = - www ./ uuu;\n xxu = 1 - vvv ./ uuu - x0;\n xxw = - log( wwu ) - x0;\n xxd = ((exp(x0).*wwu).^(1/(1-epow))-1)*(epow-1);\n tlY = max( 0, xxd - xxu );\n erY = max( 0, xxw - xxu );\n acY = erY ~= 0;\n cxY = xxu + 0.5 * ( xxw - xxu ) .* acY;\n ttt = uuu == -realmin;\n if any( ttt ),\n cxY( ttt ) = max( 1 - epow, min( xxu( ttt ), epow - 1 ) );\n tlY( ttt ) = 0;\n erY( ttt ) = 0;\n end\n end\n \n if x_valid && y_valid,\n cxX = ( nmX .* cxX + nmY .* cxY ) ./ ( nmX + nmY );\n kkt = ( xxx .* uuu + yyy .* vvv + zzz .* www ) ./ ( nmX .* nmY ) < 1e-4;\n kkX = ( nmX > 1e-3 * nmY ) | kkt;\n kkY = ( nmY > 1e-3 * nmX ) | kkt;\n erX = erX .* kkX;\n tlX = tlX .* kkX;\n acX = acX .* kkX;\n acY = acY .* kkY;\n cer = min( epow, max( max( abs( cxX .* acX ) ), max( abs( cxY .* acY ) ) ) );\n elseif x_valid,\n cxX = cxX .* acX;\n tlX = tlX .* acX;\n cer = min( epow, max( max( abs( cxX .* acX ) ) ) );\n elseif y_valid,\n cxX = cxY .* acY;\n tlX = tlY .* acY;\n erX = erY;\n cer = min( epow, max( max( abs( cxY .* acY ) ) ) );\n end\n if x_valid || y_valid,\n err = max( erX );\n tol = max( tlX );\n nmov = nnz( erX > max( prec(2), 1.5 * tlX ) );\n nact = nnz( erX );\n else\n err = 0; tol = 0; cer = 0;\n nmov = 0; nact = 0;\n end\n solved = x_valid * 2 + y_valid;\n found = nmov == 0 && solved;\n \n \n % Check for stagnation\n stagc = ' '; stage = ' ';\n if ~found && last_solved == solved && last_act == nact,\n if cer >= 0.9 * last_cer, stagc = 's'; end\n if err >= 0.9 * last_err, stage = 's'; end\n end\n if ~quiet,\n fprintf( '%3d/%3d | %9.3e%c %9.3e%c %9.3e | %s\\n', nmov, nact, cer, stagc, err, stage, tol, status );\n end\n \n % Solution found or no more iterations\n % In perfect arithmetic, erY should be all zeros---because the\n % approximate dual should be feasible in the original, too. But\n % in imperfect arithmetic, it may not be. So, we're using that\n % error as a threshold to decide when the *primal* point is\n % sufficiently accurate, too.\n if found,\n if tprec(1) < best_prec,\n best_x = x;\n best_y = y;\n best_prec = tprec(1);\n end\n if best_prec <= prec(1) || attempts == 2,\n break;\n end\n attempts = attempts + 1;\n end\n if status(1) == 'F',\n failed = failed + 0.5 * ( 1 + ~x_valid );\n if failed >= 3, break; end\n if ~x_valid,\n prec(3) = prec(3) * 10;\n continue;\n end\n else\n prec(3) = oprec(3);\n failed = 0;\n end\n \n % Stagnation?\n if stagc == 's' || stage == 's',\n if all( amult == 1e5 ), break; end\n amult = min( amult * 10, 1e5 ); \n elseif ~failed,\n boost = ~cxX & erX;\n if any( boost ),\n amult(boost) = min( amult(boost) * 10, 1e5 );\n end\n end\n \n % Shift centerpoint\n last_solved = x_valid * 2 + y_valid;\n last_cer = cer;\n last_err = err;\n last_act = nact;\n if last_solved,\n x0 = max( min( x0 + max( min( epow, cxX ), -epow ), maxw ), -maxw );\n end\n \n end\n if isnan( best_x(1) ), \n status = 'Infeasible';\n elseif isnan( best_y(1) ), \n status = 'Unbounded';\n else\n status = 'Solved';\n end\n if best_prec > prec(3),\n status = 'Failed';\n elseif best_prec > prec(2),\n status = [ 'Inaccurate/', status ];\n end\n x = best_x(1:n,:);\n y = best_y(1:m,:);\n c = c(1:n,:);\n elseif ndual || dualized,\n try\n [ x, status, tprec, iters, y ] = shim.solve( At, b, c, cones, quiet, prec, solv.settings, eargs{:} );\n catch estruc\n status = 'Error';\n end\n else\n try\n [ x, status, tprec, iters ] = shim.solve( At, b, c, cones, quiet, prec, solv.settings, eargs{:} );\n catch estruc\n status = 'Error';\n end\n end\n tfin = tic;\n if isa( cvx___.timers, 'double' ),\n cvx___.timers(4) = cvx___.timers(4) + ( double(tfin) - double(tstart) );\n else\n cvx___.timers(4) = cvx___.timers(4) + ( tfin - tstart );\n end\n if cvx___.profile, \n profile resume; \n end\n if ~cvx___.path.hold, \n cvx_clearspath; \n end\n if zero_c,\n q = x(end); %#ok\n x(end) = [];\n switch status,\n case { 'Solved', 'Inaccurate/Solved' },\n if q > prec(3),\n status = strrep( status, 'Solved', 'Infeasible' );\n oval = sgn * Inf;\n bval = oval;\n y = y / abs( b' * y );\n x(:) = NaN;\n dval = 0;\n else\n oval = 0;\n bval = 0;\n pval = 1;\n dval = 1;\n end\n otherwise,\n if ~isequal( status, 'Error' ), \n status = Failed; \n end\n end\n else\n switch status,\n case { 'Solved', 'Inaccurate/Solved', 'Suboptimal' },\n oval = sgn * ( c' * x + d' );\n if ndual || dualized,\n bval = sgn * ( b' * y + d' );\n elseif length(tprec) > 1,\n bval = sgn * tprec(2) + d';\n else\n bval = sgn * -Inf;\n end\n pval = 1;\n dval = 1;\n case { 'Infeasible', 'Inaccurate/Infeasible' },\n oval = sgn * Inf;\n bval = oval;\n dval = 0;\n case { 'Unbounded', 'Inaccurate/Unbounded' },\n oval = -sgn * Inf;\n bval = oval;\n pval = 0;\n otherwise,\n bval = NaN;\n if ~isnan( x ), pval = 1; end\n if ~isnan( y ), dval = 1; end\n end\n end\n if ~quiet,\n disp( spacer );\n end\n \nelseif infeas,\n \n %\n % Infeasible\n %\n \n if ~quiet,\n disp( 'Trivial infeasibilities detected; solution determined analytically.' );\n end\n status = 'Infeasible';\n tprec = 0;\n b( ~tt ) = 0;\n y = - b / ( b' * b );\n oval = sgn * Inf;\n bval = oval;\n dval = 0;\n \nelse\n \n %\n % The origin is optional\n %\n \n if ~quiet,\n disp( 'Homogeneous problem detected; solution determined analytically.' );\n end\n status = 'Solved';\n tprec = 0;\n x = zeros( n, 1 );\n y = zeros( m, 1 );\n oval = sgn * d;\n bval = oval;\n pval = 1;\n dval = 1;\n \nend\n\nif dualized,\n switch status,\n case 'Infeasible', status = 'Unbounded';\n case 'Unbounded', status = 'Infeasible';\n case 'Inaccurate/Infeasible', status = 'Inaccurate/Unbounded';\n case 'Inaccurate/Unbounded', status = 'Inaccurate/Infeasible';\n end\nend\n\ntrick = false;\nif gobj,\n switch status,\n case 'Unbounded', \n status = 'Solved';\n trick = true;\n case 'Inaccurate/Unbounded', \n status = 'Inaccurate/Solved';\n trick = true;\n end\nend\n\nif ~quiet,\n fprintf( 1, 'Status: %s\\n', status );\nend\n\ncvx___.problems( p ).status = status;\ncvx___.problems( p ).iters = iters;\ncvx___.problems( p ).tol = tprec(1);\n\n%\n% Push the results into the master CVX workspace\n%\n\nx = full( Q * [ pval ; x ] );\ny = full( P * [ dval ; y ] );\nif dualized,\n if trick, y = P(:,1) + realmax * sign(y); end\n cvx___.x = y;\n cvx___.y = x(2:end);\nelse\n if trick, x = Q(:,1) + realmax * sign(x); end\n cvx___.x = x;\n cvx___.y = y(2:end);\nend\nif cvx___.exp_used,\n esrc = find( cvx___.exponential );\n edst = cvx___.exponential( esrc );\n cvx___.x( edst ) = min( 1e300, exp( cvx___.x( esrc ) ) );\nend\n\n%\n% Compute the objective\n%\n\nif ~isempty( obj ),\n if isinf( oval ) || isnan( oval ),\n oval = oval * ones(size(obj));\n else\n oval = cvx_value( obj );\n end\n oval(gobj) = exp(oval(gobj));\n bval(gobj) = exp(bval(gobj));\nend\noval = full(oval);\nbval = full(bval);\ncvx___.problems( p ).result = oval;\ncvx___.problems( p ).bound = bval;\nif ~quiet,\n if length( oval ) == 1,\n fprintf( 'Optimal value (cvx_optval): %+g\\n', oval );\n else\n fprintf( 'Optimal value (cvx_optval): (multiobjective)\\n' );\n end\nend\n\nif isempty( estruc ) && idual_error,\n warning( 'CVX:IntegerDual', ...\n[ 'Dual variables are not supported for problems involving integer variables.\\n', ...\n 'All dual variables were set to the value NaN.' ] );\nend\n\nif ~quiet,\n disp( ' ' );\nend\n\nif ~isempty( estruc ),\n if strncmp( estruc.identifier, 'CVX:', 4 ),\n error( estruc.identifier, estruc.message );\n else\n rethrow( estruc );\n end\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxprob/spy.m", "content": "function spy( prob, reduce )\nif nargin < 2 || ~reduce,\n A = extract( prob );\nelse\n A = eliminate( prob );\nend\nspy( A' );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxprob/subsasgn.m", "content": "function x = subsasgn( x, S, y )\nerror( 'Subscripted assignment not allowed for cvx problem objects.' );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxprob/subsref.m", "content": "function y = subsref( x, S, cheat )\nglobal cvx___\ny = subsref( cvx___.problems( x.index_ ), S );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxprob/touch.m", "content": "function x = touch( p, x, iseq )\r\nglobal cvx___\r\nif nargin < 3, iseq = false; end\r\n\r\nif isa( x, 'cvx' ),\r\n p = p.index_;\r\n b = cvx_basis( x );\r\n y = any( b, 2 );\r\n if iseq,\r\n \tcvx___.canslack( y ) = false;\r\n end\r\n v = cvx___.problems( p ).t_variable;\r\n nv = size( v, 1 );\r\n ny = length( y );\r\n if ny < nv, \r\n y( nv, : ) = 0;\r\n elseif nv < ny, \r\n y = y( 1 : nv, : );\r\n end\r\n cvx___.problems( p ).t_variable = v | y;\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/apply.m", "content": "function y = apply( func, x )\ny = do_apply( func, x.value_ );\n\nfunction y = do_apply( func, x )\nswitch class( x ),\n case 'struct',\n y = cell2struct( do_apply( func, struct2cell( x ) ), fieldnames( x ), 1 );\n case 'cell',\n y = cellfun( func, x, 'UniformOutput', false );\n otherwise,\n y = feval( func, x );\nend\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/cvx_collapse.m", "content": "function x = cvx_collapse( x, keeptemp, tocell )\nx = cvx_collapse( x.value_, keeptemp, tocell );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/cvx_constant.m", "content": "function y = cvx_constant( x )\ny = apply( @cvx_constant, x );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/cvx_getdual.m", "content": "function x = cvx_getdual( x )\nx = x.dual_;\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/cvx_id.m", "content": "function y = cvx_id( x )\ny = apply( @cvx_id, x );\nswitch class( y ),\n case 'struct',\n y = struct2cell( y );\n y = max( [ -Inf, y{:} ] );\n case 'cell',\n y = max( [ -Inf, y{:} ] );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/cvx_isaffine.m", "content": "function y = cvx_isaffine( x )\ny = testall( @cvx_isaffine, x );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/cvx_isconcave.m", "content": "function y = cvx_isconcave( x )\ny = testall( @cvx_isconcave, x );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/cvx_isconstant.m", "content": "function y = cvx_isconstant( x )\ny = testall( @cvx_isconstant, x );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/cvx_isconvex.m", "content": "function y = cvx_isconvex( x )\ny = testall( @cvx_isconvex, x );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/cvx_setdual.m", "content": "function x = setdual( x, y )\nx.dual_ = y;\nx.value_ = do_setdual( x.value_, y );\n\nfunction x = do_setdual( x, y )\nswitch class( x ),\n case 'struct',\n nx = numel( x );\n if nx > 1,\n error( 'Dual variables may not be attached to struct arrays.' );\n end\n f = fieldnames(x);\n y(end+1).type = '{}';\n for k = 1 : length(f),\n y(end).subs = {1,k};\n x.(f{k}) = do_setdual( x.(f{k}), y );\n end\n case 'cell',\n y(end+1).type = '{}';\n y(end+1).subs = cell(1,ndims(x));\n for k = 1 : numel(nx),\n [ y(end).subs{:} ] = { 1, k };\n x{k} = do_setdual( x{k}, y );\n end\n case 'cvx',\n x = setdual( x, y );\n case 'double',\n x = setdual( cvx( x ), y );\nend\n\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/cvx_value.m", "content": "function y = cvx_value( x )\ny = apply( @cvx_value, x );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/cvxtuple.m", "content": "function v = cvxtuple( varargin )\n\nif nargin == 1,\n v = varargin{1};\n switch class( v ),\n case 'struct',\n if numel( v ) ~= 1,\n error( 'struct arrays not permitted in cvx tuple objects.' );\n end\n case 'cell',\n v = reshape( v, 1, numel( v ) );\n otherwise,\n return\n end\nelse\n v = varargin;\nend\n\nv = class( struct( 'value_', { v }, 'dual_', { [] } ), 'cvxtuple', cvxobj );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/disp.m", "content": "function disp( x, prefix )\nif nargin < 2,\n prefix = '';\nend\ndisp( [ prefix, 'cvx tuple object: ' ] );\nprefix = [ prefix, ' ' ];\ndo_disp( x.value_, {}, prefix, prefix, '' );\nif ~isempty( x.dual_ ),\n dn = cvx_subs2str( x.dual_ );\n disp( [ prefix, 'dual variable: ', dn(2:end) ] );\nend\n\nfunction do_disp( x, f, fprefix, prefix, suffix )\nswitch class( x ),\n case 'struct',\n do_disp( struct2cell(x), fieldnames(x), fprefix, prefix, suffix );\n case 'cell',\n fprefix = [ fprefix, '{ ' ];\n prefix = [ prefix, ' ' ];\n nsuffix = '';\n kend = numel( x );\n for k = 1 : kend,\n if k == kend, nsuffix = [ ' }', suffix ]; end\n if ~isempty( f ),\n fprefix = sprintf( '%s%s: ', fprefix, f{k} );\n end\n do_disp( x{k}, {}, fprefix, prefix, nsuffix );\n fprefix = prefix;\n end\n case 'cvx',\n dual = cvx_getdual( x );\n if ~isempty( dual ),\n suffix = sprintf( ' (dual: %s)%s', dual, suffix );\n end\n disp( [ fprefix, cvx_class( x, true, true ), ' ', type( x ), suffix ] );\n case 'double',\n fprintf( 1, '%s%g%s\\n', fprefix, x, suffix );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/eq.m", "content": "function a = eq( x, y )\n\nb = newcnstr( evalin( 'caller', 'cvx_problem', '[]' ), x, y, '==' );\nif nargout, a = b; end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/ge.m", "content": "function a = ge( x, y )\n\nb = newcnstr( evalin( 'caller', 'cvx_problem', '[]' ), x, y, '>=' );\nif nargout, a = b; end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/gt.m", "content": "function a = gt( x, y )\n\nb = newcnstr( evalin( 'caller', 'cvx_problem', '[]' ), x, y, '>' );\nif nargout, a = b; end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/in.m", "content": "function a = in( x, y )\n\nnarginchk(2,2);\nb = newcnstr( evalin( 'caller', 'cvx_problem', '[]' ), x, y, '==' );\nif nargout, a = b; end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/le.m", "content": "function a = le( x, y )\n\nb = newcnstr( evalin( 'caller', 'cvx_problem', '[]' ), x, y, '<=' );\nif nargout, a = b; end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/lt.m", "content": "function a = lt( x, y )\n\nb = newcnstr( evalin( 'caller', 'cvx_problem', '[]' ), x, y, '<' );\nif nargout, a = b; end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/ne.m", "content": "function a = ne( x, y )\n\nb = newcnstr( evalin( 'caller', 'cvx_problem', '[]' ), x, y, '~=' );\nif nargout, a = b; end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/numel.m", "content": "function n = numel( x, varargin )\nn = numel( x.value_, varargin{:} );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/subsasgn.m", "content": "function y = subsasgn( x, varargin ) %#ok\nerror( 'cvx tuple objects are read-only.' );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/subsref.m", "content": "function y = subsref( x, varargin )\ny = cvxtuple( subsref( x.value_, varargin{:} ) );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/@cvxtuple/testall.m", "content": "function y = testall( func, x )\ny = do_test( func, x.value_ );\n\nfunction y = do_test( func, x )\nswitch class( x ),\n case 'struct',\n y = do_test( func, struct2cell( x ) );\n case 'cell',\n y = all( cellfun( func, x ) );\n otherwise,\n y = feval( func, x );\nend\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/Contents.m", "content": "% CVX: Internal functions and scripts.\n% This directory contains code that is meant for internal use by\n% the CVX system itself. Documentation of the functions in this\n% directory is more sparse and not intended for end users.\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_accept_concave.m", "content": "function x = cvx_accept_concave( x )\r\nglobal cvx___\r\nif isa( x, 'cvx' ),\r\n t = cvx_vexity( x ) < 0;\r\n if any( t( : ) ),\r\n prob = cvx___.problems(end).self;\r\n if all( t ),\r\n src = x;\r\n dst = newtemp( prob, size( src ) );\r\n x = dst;\r\n else\r\n src = x( t );\r\n dst = newtemp( prob, size( src ) );\r\n x( t ) = dst;\r\n end\r\n newcnstr( prob, src(:), dst(:), '>=' );\r\n end\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_accept_convex.m", "content": "function x = cvx_accept_convex( x )\r\nglobal cvx___\r\nif isa( x, 'cvx' ),\r\n t = cvx_vexity( x ) > 0;\r\n if any( t( : ) ),\r\n prob = cvx___.problems(end).self;\r\n if all( t ),\r\n src = x;\r\n dst = newtemp( prob, size( src ) );\r\n x = dst;\r\n else\r\n src = x( t );\r\n dst = newtemp( prob, size( src ) );\r\n x( t ) = dst;\r\n end\r\n newcnstr( prob, src(:), dst(:), '<=' );\r\n end\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_basis.m", "content": "function y = cvx_basis( x )\n\nif isempty( x )\n y = sparse( 1, 0 );\nelse\n y = sparse( reshape( x, 1, numel( x ) ) );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_bcompress.m", "content": "function [ xR, x ] = cvx_bcompress( x, mode, num_sorted )\nnarginchk(1,3);\nif nargin < 3 || isempty( num_sorted ),\n num_sorted = 0;\nend\nif nargin < 2 || isempty( mode ),\n mode = 0;\nelse\n switch mode,\n case 'full', mode = 0;\n case 'magnitude', mode = 1;\n case 'none', mode = 2;\n otherwise, error( [ 'Invalid normalization mode: ', mode ] );\n end\nend\n\n%\n% Separate the real and imaginary parts. But while we're at it, we need to\n% make sure we we're at it, \n%\n\n[ m, n ] = size( x ); %#ok\niscplx = ~isreal( x );\nif iscplx,\n x = cvx_c2r( x, 2, 8 * eps );\n n = n * 2;\nend\n\n[ ndxs, scls ] = cvx_bcompress_mex( sparse( x ), mode, num_sorted );\nxR = sparse( ndxs, 1 : n, scls, n, n );\nt2 = any( xR, 2 );\nxR = xR( t2, : );\n\nif nargout > 1 && ~all( t2 ),\n x = x( :, t2 );\nend\n\nif iscplx,\n xR = cvx_r2c( xR, 2 );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_blkdiag.m", "content": "function y = cvx_blkdiag( varargin )\n\n% A reimplemenetation of MATLAB's blkdiag function, which is broken in\n% certain versions of MATLAB.\n\nif nargin == 1,\n y = varargin{1};\nelse\n isYsparse = false;\n for k = 1 : nargin,\n x = varargin{k};\n [ p2(k+1), m2(k+1) ] = size(x); %#ok\n if issparse(x), isYsparse = true; end\n end\n p1 = cumsum(p2);\n m1 = cumsum(m2);\n if isYsparse\n y = sparse( varargin{1} );\n for k = 2 : nargin,\n y = [y sparse(p1(k),m2(k+1)); sparse(p2(k+1),m1(k)) varargin{k}]; %#ok\n end\n else\n y = zeros(p1(end),m1(end));\n for k=1:nargin\n y(p1(k)+1:p1(k+1),m1(k)+1:m1(k+1)) = varargin{k};\n end\n end\nend\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_c2r.m", "content": "function x = cvx_c2r( x, dim, cleanup_eps )\n\n%\n% Determine expansion dimension\n%\n\nsx = size( x );\nif nargin < 2,\n dim = [ find( sx > 1 ), 1 ];\n dim = dim( 1 );\nelseif ~isnumeric( dim ) || dim <= 0 || dim ~= floor( dim ),\n error( 'Second argument must be a dimension.' );\nend\nsx = [ sx, ones( 1, dim - length( sx ) ) ];\nnd = length( sx );\n\n%\n% Perform the sparse case differently\n%\n\nif isnumeric( x ) && issparse( x ) && dim <= 2,\n [ rr, cc, vv ] = find( x );\n vr = real( vv );\n vi = imag( vv );\n if nargin > 2,\n ndxs = find( vr & vi );\n if ~isempty( ndxs ),\n temp = abs( vr(ndxs) ./ vi(ndxs) );\n vr(ndxs(temp<=cleanup_eps)) = 0;\n vi(ndxs(temp>=1.0./cleanup_eps)) = 0;\n end\n end\n if dim == 1,\n rr = 2 * rr; rr = [ rr - 1 ; rr ];\n cc = [ cc ; cc ];\n sx( 1 ) = 2 * sx( 1 );\n else\n cc = 2 * cc; cc = [ cc - 1 ; cc ];\n rr = [ rr ; rr ];\n sx( 2 ) = 2 * sx( 2 );\n end\n x = sparse( rr, cc, [ vr ; vi ], sx( 1 ), sx( 2 ) );\n return\nend\n\n%\n% Permute if necessary\n%\n\nperm = [];\nif any( sx( 1 : dim - 1 ) ~= 1 ),\n perm = [ dim, 1 : dim - 1, dim + 1 : nd ];\n x = permute( x, perm );\n sx = sx( perm );\n dim = 1;\nend\n\n%\n% Perform expansion and possibly cleanup\n%\n\nx = x( : ).';\nsx( dim ) = 2 * sx( dim );\nxr = real( x );\nxi = imag( x );\nif nargin > 2,\n ndxs = find( xr & xi );\n if ~isempty( ndxs ),\n temp = abs( xr(ndxs) ./ xi(ndxs) );\n xr(ndxs(temp<=cleanup_eps)) = 0;\n xi(ndxs(temp>=1.0./cleanup_eps)) = 0;\n end\nend\nx = reshape( [ xr ; xi ], sx );\n\n%\n% Reverse permute if necessary\n%\n\nif ~isempty( perm ),\n x = ipermute( x, perm );\nend\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_check_dimension.m", "content": "function y = cvx_check_dimension( x, zero_ok )\n\n%CVX_CHECK_DIMENSION Verifies that the input is valid dimension.\n% CVX_CHECK_DIMENSION( DIM ) verifies that the quantity DIM is valid for use\n% in commands that call for a dimension; e.g., SUM( X, DIM ). In other words,\n% it verifies that DIM is a positive integer scalar.\n%\n% CVX_CHECK_DIMENSION( DIM, ZERO_OK ) allows DIM to be zero if ZERO_OK is\n% true. If ZERO_OK is false, the default behavior is used.\n\nif isnumeric( x ) && length( x ) == 1 && isreal( x ) && x < Inf && x == floor( x ),\n if nargin < 2, zero_ok = false; end\n y = x > 0 | zero_ok;\nelse\n y = 0;\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_check_dimlist.m", "content": "function [ y, x ] = cvx_check_dimlist( x, emptyok )\n\n% CVX_CHECK_DIMLIST Verifies the input is a valid dimension list.\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n\nif nargin < 2 || emptyok,\n xmin = 0;\nelse\n xmin = 1;\nend\nif isa( x, 'cell' ),\n nel = numel( x );\n xnew = zeros( 1, nel );\n fnan = false;\n y = false;\n for k = 1 : nel,\n if isempty( x{k} ),\n if fnan, return; end\n xnew( k ) = NaN;\n fnan = true;\n elseif isnumeric( x{k} ) && length( x{k} ) == 1,\n xnew( k ) = x{k};\n else\n return;\n end\n end\n x = xnew;\nend\ny = isnumeric( x ) && length( x ) == numel( x ) && isreal( x ) && nnz( isnan( x ) ) <= 1 && ~any( x < xmin ) && nnz( x ~= floor( x ) ) == nnz( isnan( x ) );\nif y && nargout > 1,\n x = [ x( : )', 1, 1 ];\n x = x( 1 : max( [ 2, find( x ~= 1 ) ] ) );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_class.m", "content": "function v = cvx_class( x, needsign, needreal, needzero )\r\nif nargin < 2, needsign = false; end\r\nif nargin < 3, needreal = false; end\r\nif nargin < 4, needzero = needsign; end\r\n\r\n% Classifications:\r\n% 1 - negative constant\r\n% 2 - zero\r\n% 3 - positive constant\r\n% 4 - complex constant\r\n% 5 - concave\r\n% 6 - real affine\r\n% 7 - convex\r\n% 8 - complex affine\r\n% 9 - log concave\r\n% 10 - log affine\r\n% 11 - log convex monomial\r\n% 12 - log convex posynomial\r\n% 13 - invalid\r\n% ---\r\n% 14 - constant\r\n% 15 - affine\r\n% 16 - real constant\r\n\r\nif isempty( x ),\r\n v = 'empty';\r\n return\r\nend\r\npersistent remap_s remap_r remap_z strs\r\nif isempty( strs ),\r\n remap_s = [16,2,16,4,5,6,7,8,9,10,11,12,13,14,15,16];\r\n remap_r = [1,2,3,14,5,15,7,15,9,10,11,12,13,14,15,14];\r\n remap_z = [1,14,3,4,5,6,7,8,9,10,11,12,13,14,15,16];\r\n strs = { 'negative constant', 'zero', 'positive constant', 'complex constant', ...\r\n 'concave', 'real affine', 'convex', 'complex affine', ...\r\n 'log-concave', 'log-affine', 'log-convex', 'log-convex', ...\r\n 'invalid', 'constant', 'affine', 'real constant' };\r\nend\r\nx = cvx_classify( x );\r\nif ~needsign,\r\n x = remap_s( x );\r\nend\r\nif ~needreal,\r\n x = remap_r( x );\r\nend\r\nif ~needzero,\r\n x = remap_z( x );\r\nend\r\nv = sparse( x, 1, 1, 16, 1 ) ~= 0;\r\nif nnz( v ) ~= v( 2 ),\r\n v( 2 ) = false;\r\nend\r\nv = strs( v );\r\nif length( v ) == 1,\r\n v = v{1};\r\nelse\r\n v = sprintf( '%s/', v{:} );\r\n v = [ 'mixed ', v(1:end-1) ];\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_classify.m", "content": "function v = cvx_classify( x )\r\n\r\n% Classifications:\r\n% 1 - negative constant\r\n% 2 - zero\r\n% 3 - positive constant\r\n% 4 - complex constant\r\n% 5 - concave\r\n% 6 - real affine\r\n% 7 - convex\r\n% 8 - complex affine\r\n% 9 - log concave\r\n% 10 - log affine\r\n% 11 - log convex monomial\r\n% 12 - log convex posynomial\r\n% 13 - invalid\r\n\r\nv = full( sign( real( x ) ) ) + 2;\r\nif ~isreal( x ),\r\n\tv( imag( x ) ~= 0 ) = 4;\r\nend\r\nv( ~isfinite( x ) ) = 13;\r\nv = reshape( v, 1, numel( x ) );\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_clearpath.m", "content": "function cvx_clearpath( arg ) %#ok\n\n%CVX_CLEARPATH Clears the cvx path.\n% CVX_CLEARPATH removes the internal cvx directories from Matlab's path. CVX\n% does this automatically when a model is completed (i.e., after CVX_END), in\n% order to reduce potential naming conflicts with other packages. There is no\n% need to call this function during the normal use of CVX.\n\nglobal cvx___\ncvx_global\nif nargin == 0,\n cvx___.path.hold = false;\nend\nif cvx___.path.hold,\n cvx_setspath;\nelse\n cvx_clearspath;\n if ~isempty( cvx___.path.string ),\n path(strrep(path,cvx___.path.string,''));\n end\n cvx___.path.active = false;\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_clearspath.m", "content": "function cvx_clearspath\n\n%CVX_CLEARSPATH Clears the cvx solver path.\n% CVX_CLEARSPATH removes the internal solver directories to the Matlab\n% path. CVX automatically clears the solver path after completion of a\n% model computation, so calling this function should not be necessary.\n% Nevertheless, we provide it for completeness and debugging.\n\nglobal cvx___\nosolv = cvx___.solvers.active;\nif osolv,\n tstr = cvx___.solvers.list(osolv).path;\n if ~isempty( tstr ),\n path(strrep(path,tstr,''));\n end\n cvx___.solvers.active = 0;\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_collapse.m", "content": "function x = cvx_collapse( x, keeptemp, tocell )\nif nargin < 2, keeptemp = false; end\nif nargin < 3, tocell = false; end\n\nwhile true,\n sx = size( x );\n nx = prod( sx );\n switch class( x ),\n case 'cell',\n if nx == 1,\n x = x{1};\n continue;\n end\n x = reshape( x, 1, nx );\n case 'struct',\n fx = fieldnames( x );\n if ~keeptemp,\n ndxs = horzcat( fx{:} );\n ndxs = ndxs( cumsum( cellfun( 'length', fx ) ) ) ~= '_';\n fx = fx( ndxs );\n end\n nfx = length( fx );\n if nfx == 1 && nx == 1,\n x = subsref( x, struct( 'type', '.', 'subs', fx{1} ) );\n continue;\n end\n if tocell,\n if nfx == 1,\n sx = [ 1, sx ]; %#ok\n else\n sx = [ 1, nfx, sx ]; %#ok\n end\n x = struct2cell( x );\n if ~keeptemp,\n x = x( ndxs, : );\n end\n x = reshape( x, sx );\n end\n end\n break;\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_constant.m", "content": "function y = cvx_constant( x )\nnarginchk(1,1);\ny = x;\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_default_dimension.m", "content": "function y = cvx_default_dimension( sx )\n\n%CVX_DEFAULT_DIMENSION Default dimension for SUM, MAX, etc. \n% DIM = CVX_DEFAULT_DIMENSION( SX ), where SX is a size vector, returns the\n% first index DIM such that SX(DIM)>1, if one exists; otherwise, DIM=1. This\n% matches the behavior by functions like SUM, MAX, ANY, ALL, etc. in\n% selecting the dimension over which to operate if DIM is not supplied.\n%\n% For example, suppose size(X) = [1,3,4]; then SUM(X) would sum over dimension\n% 2; and DIM=CVX_DEFAULT_DIMENSION([1,3,4]) returns DIM=2.\n%\n% This is an internal CVX function, and as such no checking is performed to\n% insure that the arguments are valid.\n\ny = find( sx ~= 1 );\nif isempty( y ), \n y = 1; \nelse\n y = y( 1 ); \nend\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_expand_dim.m", "content": "function zx = cvx_expand_dim( z, dim, nx )\r\n\r\n%CVX_EXPAND_DIM Expands an N-D array along a specified dimension.\r\n% CVX_EXPAND_DIM( X, DIM, NX ) stacks NX copies of the matrix X along the\r\n% dimension NX. It is equivalent to CAT( DIM, X, X, ..., X ), where X is\r\n% repeated NX times.\r\n%\r\n% This is an internal CVX function, and as such no checking is performed to\r\n% insure that the arguments are valid.\r\n\r\nzdims = cell( 1, max( ndims(z), dim ) );\r\n[ zdims{:} ] = deal( ':' );\r\nzdims{dim} = ones( 1, nx );\r\nzx = z( zdims{:} );\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_expert_check.m", "content": "function cvx_expert_check( fname, varargin )\n\nglobal cvx___\nif cvx___.expert, return; end\nif ~isempty( varargin ) && ~any(cellfun('isclass',varargin,'cvx')), return; end\n\nurl = [ 'file:///', cvx___.where, cvx___.fs, 'doc', cvx___.fs, 'advanced.html#the-successive-approximation-method' ];\nfprintf( 1, [ 'CVX Warning:\\n', ...\n' Models involving \"%s\" or other functions in the log, exp, and entropy\\n', ...\n' family are solved using an experimental successive approximation method.\\n', ...\n' This method is slower and less reliable than the method CVX employs for\\n', ...\n' other models. Please see the section of the user''s guide entitled\\n', ...\n' The successive approximation method\\n', ...\n' for more details about the approach, and for instructions on how to\\n', ...\n' suppress this warning message in the future.\\n' ], fname, url );\n\ncvx___.expert = true;\n \n% Note that we do *not* call cvx_save_prefs here. We only save the\n% preferences if an explicit setting of \"cvx_expert true\" is made.\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_getdual.m", "content": "function y = cvx_getdual( x )\ny = [];\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_global.m", "content": "function cvx_global\r\n\r\n%CVX_GLOBAL Create CVX's global internal data structure, if needed.\r\n% CVX_GLOBAL creates a hidden structure CVX needs to do its work. It is\r\n% harmless for the user to call it, but it is also useless to do so.\r\n\r\nglobal cvx___ \r\nif isfield( cvx___, 'problems' ),\r\n return\r\nend\r\ntstart = tic;\r\n \r\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r\n% Initialize the global data structure %\r\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r\n\r\ncvx_version(1);\r\n\r\ncommands = { 'cvx_begin', 'cvx_clear', 'cvx_end', 'cvx_expert', ...\r\n 'cvx_pause', 'cvx_power_warning', 'cvx_precision', 'cvx_profile', ...\r\n 'cvx_quiet', 'cvx_save_prefs' };\r\nc_type = cell(1,length(commands));\r\n[ c_type{:} ] = deal('C');\r\nkeywords = { 'in', 'dual', 'epigraph', 'expression', 'expressions', ...\r\n 'hypograph', 'maximize', 'maximise', 'minimize', 'minimise', ...\r\n 'subject', 'variable', 'variables' };\r\nk_type = cell(1,length(keywords)); \r\n[ k_type{:} ] = deal('K');\r\nstructures = { 'banded', 'binary', 'complex', 'diagonal', 'hankel', ...\r\n 'hermitian', 'integer', 'lower_bidiagonal', 'lower_hessenberg', ...\r\n 'lower_triangular', 'nonnegative', 'scaled_identity', ...\r\n 'skew_symmetric', 'semidefinite', 'sparse', 'symmetric', ...\r\n 'toeplitz', 'tridiagonal', 'upper_bidiagonal', 'upper_hankel', ...\r\n 'upper_hessenberg', 'upper_triangular' };\r\ns_type = cell(1,length(structures)); \r\n[ s_type{:} ] = deal('S');\r\nreserved = cell2struct([c_type,k_type,s_type],[commands,keywords,structures],2);\r\n\r\ncvx___.reswords = reserved;\r\ncvx___.problems = [];\r\ncvx___.id = 0;\r\ncvx___.pause = false;\r\ncvx___.quiet = false;\r\ncvx___.profile = false;\r\ncvx___.reserved = 1;\r\ncvx___.logarithm = sparse( 1, 1 );\r\ncvx___.exponential = sparse( 1, 1 );\r\ncvx___.vexity = 0; % sparse( 1, 1 );\r\ncvx___.exp_used = false;\r\ncvx___.nan_used = false;\r\ncvx___.canslack = false;\r\ncvx___.readonly = 0;\r\ncvx___.needslack = false(0,1);\r\ncvx___.cones = struct( 'type', {}, 'indices', {} );\r\ncvx___.x = zeros( 0, 1 );\r\ncvx___.y = zeros( 0, 1 );\r\ntemp = cvx( [0,1], [] );\r\ncvx___.equalities = temp;\r\ncvx___.linforms = temp;\r\ncvx___.linrepls = temp;\r\ncvx___.uniforms = temp;\r\ncvx___.unirepls = temp;\r\ntry\r\n cvx___.timers = zeros(1,4,'uint64');\r\n cvx___.timers(1) = cvx___.timers(1) + tstart;\r\ncatch\r\n cvx___.timers = [double(tstart),0,0,0];\r\nend\r\ncvx___.increment = [];\r\n\r\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r\n% Run each shim to connect/reconnect the solvers %\r\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r\n\r\ncur_d = pwd;\r\nosolvers = cvx___.solvers.list;\r\nsolvers = struct( 'name', {}, 'version', {}, 'location', {}, 'fullpath', {}, 'error', {}, 'warning', {}, 'dualize', {}, 'path', {}, 'check', {}, 'solve', {}, 'settings', {}, 'sname', {}, 'spath', {}, 'params', {}, 'eargs', {} );\r\nnsolv = length(osolvers);\r\nnrej = 0;\r\nfor k = 1 : length(osolvers),\r\n tsolv = osolvers(k);\r\n try\r\n cd(tsolv.spath);\r\n tsolv.warning = '';\r\n tsolv = feval(tsolv.sname,tsolv);\r\n catch errmsg\r\n errmsg = cvx_error( errmsg, 63, false, ' ' );\r\n if isempty( tsolv.name ),\r\n tsolv.name = [ tsolv.spath, tsolv.sname ];\r\n end\r\n tsolv.error = sprintf( 'unexpected error:\\n%s', errmsg );\r\n end\r\n if ~isempty(tsolv.error),\r\n nrej = nrej + 1;\r\n end\r\n try\r\n solvers(k) = tsolv;\r\n catch\r\n for ff = fieldnames(tsolv)',\r\n solvers(k).(ff{1}) = tsolv.(ff{1});\r\n end\r\n end\r\nend\r\nclear osolvers\r\ncvx___.solvers.list = solvers;\r\ncd( cur_d );\r\n\r\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r\n% If any solvers have errors, force the user to re-run cvx_setup. %\r\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r\n\r\nif ~nrej, return; end\r\nreject = {};\r\nreject_lic = {};\r\nreject_java = {};\r\nndefault = 0;\r\nfor k = 1 : nsolv,\r\n if isempty( solvers(k).error ),\r\n if ~ndefault, ndefault = k; end\r\n elseif isequal( solvers(k).error, 'Java support is required.' );\r\n reject_java{end+1} = solvers.name; %#ok\r\n elseif isequal( solvers(k).error, 'A CVX Professional license is required.' ),\r\n reject_lic{end+1} = solvers(k).name; %#ok\r\n else\r\n errmsg = [ solvers(k).name, ': ', solvers(k).error ];\r\n reject{end+1} = cvx_error( errmsg, 67, false, ' ' ); %#ok\r\n end\r\nend\r\nif ~isempty( reject_java ),\r\n reject_java = sprintf( '%s ', reject_java{:} );\r\n warning( 'CVX:SolverErrors', 'The following solvers were disabled due to the disabling of Java: %s', reject_java );\r\nend\r\nif ~isempty( reject_lic ),\r\n reject_lic = sprintf( '%s ', reject_lic{:} );\r\n warning( 'CVX:SolverErrors', 'The following solvers are are disabled due to licensing issues: %s', reject_lic );\r\nend\r\nif ~isempty( reject ),\r\n reject = sprintf( '%s', reject{:} );\r\n warning( 'CVX:SolverErrors', 'The following errors were issued when initializing the solvers:\\n%sPlease check your installation and re-run CVX_SETUP.\\nThese solvers are unavailable for this session.%s', reject );\r\nend\r\nif nrej == length( solvers ),\r\n clear global cvx___\r\n error( 'CVX:SolverErrors', 'All solvers were disabled due to various errors.\\nPlease re-run CVX_SETUP and, if necessary, contact CVX Research for support.' );\r\nelseif ~isempty(solvers(cvx___.solvers.map.default).error),\r\n cvx___.solvers.map.default = ndefault;\r\n cvx___.solvers.selected = ndefault;\r\n warning( 'CVX:SolverErrors', 'The default solver has temporarily been changed to %s.', solvers(ndefault).name );\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_id.m", "content": "function y = cvx_id( x ) %#ok\r\ny = -Inf;\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_ids.m", "content": "function y = cvx_ids( varargin )\r\ny = cellfun( @cvx_id, varargin );\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_isaffine.m", "content": "function y = cvx_isaffine( x, full ) %#ok\nnarginchk(1,2);\nif nargin == 1,\n y = true;\nelse\n y = true( size( x ) );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_isconcave.m", "content": "function y = cvx_isconcave( x, full ) %#ok\nnarginchk(1,2);\nif nargin == 2,\n y = ~imag( x );\nelseif isreal( x ),\n y = true;\nelse\n y = nnz(imag(x)) == 0;\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_isconstant.m", "content": "function y = cvx_isconstant( x, full ) %#ok\nnarginchk(1,2);\nif nargin == 1,\n y = true;\nelse\n y = true( size( x ) );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_isconvex.m", "content": "function y = cvx_isconvex( x, full ) %#ok\nnarginchk(1,2);\nif nargin == 2,\n y = ~imag( x );\nelseif isreal( x ),\n y = true;\nelse\n y = nnz(imag(x)) == 0;\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_isnonzero.m", "content": "function y = cvx_isnonzero( x, full ) %#ok\r\nnarginchk(1,2);\r\nif nargin == 1,\r\n\ty = nnz( x ) ~= 0;\r\nelse\r\n y = x ~= 0;\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_r2c.m", "content": "function x = cvx_r2c( x, dim )\n\n%\n% Quick exit for complex quantities\n%\n\nif ~isreal( x ),\n error( 'Matrix must be real.' );\nend\n\n%\n% Determine expansion dimension\n%\n\nsx = size( x );\nif nargin < 2,\n dim = [ find( sx > 1 ), 1 ];\n dim = dim( 1 );\nelseif ~isnumeric( dim ) || dim <= 0 || dim ~= floor( dim ),\n error( 'Second argument must be a dimension.' );\nend\nnd = length( sx );\nif nd < dim || rem( sx( dim ), 2 ) ~= 0,\n error( 'The size of the array along the key dimension must be even.' );\nend\n\n%\n% Extract the real and imaginary halves\n%\n\n[ ndxs{ 1 : nd } ] = deal( ':' );\nndxs{ dim } = 1 : 2 : sx( dim );\nxr = cvx_subsref( x, ndxs{:} );\nndxs{ dim } = 2 : 2 : sx( dim );\nxi = cvx_subsref( x, ndxs{:} );\n\n%\n% Combine\n%\n\nx = xr + 1i * xi;\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_readlevel.m", "content": "function y = cvx_readlevel( x )\nif ndims( x ) <= 2,\n y = sparse( size( x, 1 ), size( x, 2 ) );\nelse\n y = zeros( size( x ) );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_reduce_size.m", "content": "function [ x, sx, sy, zx, zy, nx, nv, perm ] = cvx_reduce_size( x, dim, do_reduce )\n\n%\n% Reduction dimension\n%\n\nzx = size( x );\nif isempty( dim ),\n dim = find( zx ~= 1, 1, 'first' );\n if isempty( dim ), dim = 1; end\nelseif ~isnumeric( dim ) || numel( dim ) ~= 1 || ~isreal( dim ) || dim <= 0 || isinf(dim) || isnan(dim) || dim ~= floor(dim),\n error( 'Dimension argument must be a positive integer.' );\nend\n\n%\n% Vector size, reduction size, number of vectors\n%\n\nnd = max( dim, length( zx ) );\nzx( end + 1 : nd ) = 1;\nnx = zx( dim );\nzy = zx;\nif nargin < 3 || do_reduce, zy( dim ) = 1; end\nnl = prod( zy( 1 : dim -1 ) );\nnr = prod( zy( dim + 1 : end ) );\nnv = nl * nr;\n\n%\n% Permute if needed\n%\n\nif nl * nx > 1,\n perm = [ dim, 1 : dim - 1, dim + 1 : nd ];\n x = permute( x, perm );\n sx = zx( perm );\n sy = zy( perm );\nelse\n perm = [];\n sx = zx;\n sy = zy;\nend\n\n%\n% Reshape\n%\n\nx = reshape( x, nx, nv );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_remap.m", "content": "function r = cvx_remap( varargin )\r\n\r\n%CVX_REMAP CVX expression type map generator.\r\n% This is an internal function used to help filter CVX expressions by type.\r\n\r\n% Classifications:\r\n% 1 - negative constant\r\n% 2 - zero\r\n% 3 - positive constant\r\n% 4 - complex constant\r\n% 5 - concave\r\n% 6 - real affine\r\n% 7 - convex\r\n% 8 - complex affine\r\n% 9 - log concave\r\n% 10 - log affine\r\n% 11 - log convex monomial\r\n% 12 - log convex posynomial\r\n% 13 - invalid\r\n\r\npersistent remap_big remap_str\r\nif isempty( remap_str ),\r\n remap_str = { ...\r\n 'negative', 'zero', 'positive', 'complex', 'nonnegative', 'nonzero', 'nonpositive', 'real', 'constant', ...\r\n 'non-constant', 'concave', 'affine', 'convex', 'real-affine', 'complex-affine', 'non-affine', ...\r\n 'log-concave', 'log-affine', 'log-convex', 'log-valid', 'monomial', 'posynomial', ...\r\n 'valid', 'invalid' ...\r\n };\r\n remap_big = [ ...\r\n 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0; ... % negative\r\n 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0; ... % zero\r\n 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0; ... % positive\r\n 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0; ... % complex\r\n 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0; ... % nonnegative\r\n 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0; ... % nonzero (real)\r\n 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0; ... % nonpositive\r\n 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0; ... % real\r\n 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0; ... % constant\r\n 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0; ... % non-constant\r\n 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0; ... % concave\r\n 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0; ... % affine\r\n 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0; ... % convex\r\n 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0; ... % real-affine\r\n 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0; ... % complex-affine\r\n 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0; ... % non-affine\r\n 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0; ... % log-concave\r\n 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0; ... % log-affine\r\n 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0; ... % log-convex\r\n 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0; ... % log-valid\r\n 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0; ... % monomial\r\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0; ... % posynomial\r\n 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0; ... % valid\r\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1; ... % invalid\r\n ];\r\n remap_str = remap_str(:);\r\n [ remap_str, ndx ] = sort( remap_str );\r\n remap_big = remap_big( ndx, : );\r\nend\r\n\r\n[ c, ndx ] = sort( [ remap_str ; varargin(:) ] );\r\nd = strcmp(c(1:end-1),c(2:end));\r\nr = +any( remap_big( ndx(d), : ), 1 );\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_reshape.m", "content": "function x = cvx_reshape( x, s, rmap, cperm, cperm2 )\r\nsx = size( x );\r\nif nargin < 5,\r\n cperm2 = [];\r\n if nargin < 4,\r\n cperm = [];\r\n if nargin < 3,\r\n rmap = [];\r\n if nargin < 2,\r\n s = sx;\r\n end\r\n end\r\n end\r\nend\r\nusp = cvx_use_sparse( s, nnz( x ), isreal( x ) );\r\nisp = issparse( x );\r\nif ~usp && isp, \r\n x = full( x ); \r\nend\r\nif ~isequal( s, sx ) || ~isempty( rmap ) || ~isempty( cperm ) || ~isempty( cperm2 ),\r\n if usp && ( numel( x ) > 2147483647 || ~isempty( rmap ) || ~isempty( cperm ) ),\r\n [ ii, jj, x ] = find( x );\r\n if ~isempty( rmap ),\r\n sx( 1 ) = length( rmap );\r\n rmap = find( rmap );\r\n ii = rmap( ii );\r\n end\r\n if ~isempty( cperm ),\r\n temp = 1 : sx( 2 );\r\n temp( cperm ) = temp;\r\n jj = temp( :, jj )';\r\n end\r\n ij = ii + ( jj - 1 ) * sx( 1 ) - 1;\r\n ii = rem( ij, s( 1 ) ) + 1;\r\n jj = floor( ij / s( 1 ) ) + 1;\r\n if ~isempty( cperm2 ),\r\n temp = 1 : s( 2 );\r\n temp( cperm2 ) = temp;\r\n jj = temp( :, jj )';\r\n end\r\n x = sparse( ii, jj, x, s( 1 ), s( 2 ) );\r\n clear ii jj ij\r\n isp = true;\r\n else\r\n if ~isempty( cperm ),\r\n x = x( :, cperm );\r\n end\r\n if ~isempty( rmap ),\r\n x = x( max( 1, cumsum( rmap ) ), : );\r\n x( ~rmap, : ) = 0;\r\n end\r\n x = reshape( x, s );\r\n if ~isempty( cperm2 ),\r\n x = x( :, cperm2 );\r\n end\r\n end\r\nend\r\nif usp && ~isp,\r\n x = sparse( x ); \r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_run_solver.m", "content": "function varargout = cvx_run_solver( sfunc, varargin )\nglobal cvx___\nsettings_arg = varargin{end};\nsettings = varargin{end-1};\ninputs = varargin(1:end-nargout-2);\ndumpfile = '';\ncustom_on = false;\nif isstruct( settings ),\n for f = fieldnames( settings )',\n sval = settings.(f{1});\n if isequal( f{1}, 'dumpfile' ),\n dumpfile = sval;\n else\n custom_on = true;\n inputs{settings_arg}.(f{1}) = sval;\n end\n end\nend\nif custom_on,\n fprintf( 'NOTE: custom settings have been set for this solver.\\n' );\nend\nif ~isempty( dumpfile ),\n if ~ischar( dumpfile ) || size( dumpfile, 1 ) > 1,\n error( 'CVX:Dumpfile', 'Invalid filename for the dumpfile.' );\n elseif length(dumpfile) < 4 || ~strcmpi(dumpfile(end-3:end),'.mat'),\n dumpfile = [ dumpfile, '.mat' ];\n end\n fprintf( 'Saving output to: %s\\n', dumpfile );\n fprintf( '------------------------------------------------------------\\n');\n inp_names = cell(1,length(inputs));\n for k = 1 : length(inp_names),\n inp_names{1,k} = inputname(k+1);\n end\n dstruct = cell2struct( inputs, inp_names, 2 ); %#ok\n save( dumpfile, '-struct', 'dstruct' );\n diaryfile = [ dumpfile, '.txt' ];\n fid = fopen( diaryfile, 'w+' );\n if fid ~= 0,\n fclose( fid );\n diary( diaryfile );\n end\nelseif custom_on,\n fprintf( '------------------------------------------------------------\\n');\nend\nerrmsg = [];\nif cvx___.isoctave,\n fflush(1);\nend\ntry\n [ varargout{1:nargout} ] = sfunc( inputs{:} );\ncatch errmsg\n [ varargout{1:nargout} ] = deal( [] );\nend\nif ~isempty( dumpfile ),\n if fid ~= 0,\n diary( 'off' );\n fid = fopen( diaryfile, 'r' );\n if fid ~= 0,\n output = fread( fid, Inf, '*char' )';\n fclose( fid );\n delete( diaryfile );\n end\n end\n if fid == 0,\n output = '';\n end\n otp_names = varargin(end-nargout-1:end-2);\n dstruct = cell2struct( [ inputs, varargout, output ], [ inp_names, otp_names, 'output' ], 2 ); %#ok\n save( dumpfile, '-struct', 'dstruct' );\nend\nif ~isempty( errmsg ),\n rethrow( errmsg );\nend\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_setdual.m", "content": "function x = cvx_setdual( x, y )\nx = cvx_setdual( cvx( x ), y );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_setpath.m", "content": "function cvx_setpath( arg ) %#ok\n\n%CVX_SETPATH Sets the cvx path.\n% CVX_SETPATH adds the internal cvx directories to Matlab's path so that the\n% CVX system can find the functions that they contain. There is no reason to \n% call this function during normal use of CVX; it is done automatically as\n% needed. However, if you are debugging CVX, calling this function can help to\n% insure that breakpoints stay valid.\n\n% Set the hold flag\nglobal cvx___\ncvx_global\nif ~cvx___.path.active,\n s = warning('off'); %#ok\n path([cvx___.path.string,path]);\n warning(s);\n cvx___.path.active = true;\nend\nif nargin == 0,\n cvx___.path.hold = true;\nend\nif cvx___.path.hold,\n cvx_setspath;\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_setspath.m", "content": "function cvx_setspath\n\n%CVX_SETSPATH Sets the cvx solver path.\n% CVX_SETSPATH adds the internal cvx solver directories to Matlab's path\n% so that the CVX system can find the functions that they contain. There \n% is no reason to call this function during normal use of CVX; it is done\n% automatically as needed. However, if you are debugging CVX, calling\n% this function can help to insure that breakpoints stay valid.\n\nglobal cvx___\nosolv = cvx___.solvers.active;\nif isempty( cvx___.problems ),\n nsolv = cvx___.solvers.selected;\nelse\n nsolv = cvx___.problems(end).solver.index;\nend\nif osolv ~= nsolv,\n opath = [];\n npath = [];\n needupd = false;\n if osolv,\n tstr = cvx___.solvers.list(osolv).path;\n if ~isempty( tstr ),\n opath = path;\n npath = strrep(opath,tstr,'');\n needupd = true;\n end\n cvx___.solvers.active = 0;\n end\n if nsolv,\n tstr = cvx___.solvers.list(nsolv).path;\n if ~isempty( tstr ),\n if isempty(opath), opath = path; end\n if isempty(npath), npath = opath; end\n npath = [ tstr, npath ];\n needupd = true;\n end\n cvx___.solvers.active = nsolv;\n end\n if needupd,\n path(npath);\n end\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_size_check.m", "content": "function sz = cvx_size_check( varargin )\n\n%CVX_SIZE_CHECK Verifies size compatability.\n% SZ = CVX_SIZE_CHECK( ARG1, ..., ARGN ) verifies that the arguments are\n% compatible in size in the same sense as required by the + operator.\n% That is, any arguments that are not scalars must be of the same size.\n% No type checking is performed. The output SZ is the size encountered\n% if the arguments are compatible, or an empty array if they are not.\n% In other words, ISEMPTY(SZ) is true if the arguments are incompatible.\n\nfor k = 1 : nargin,\n sz = size( varargin{k} );\n if any( sz ~= 1 ), \n break; \n end\nend\nfor j = k+1 : nargin,\n sx = size(varargin{k});\n if any( sx ~= 1 ) && any( sx ~= sz ),\n sz = [];\n break\n end\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_subs2str.m", "content": "function y = cvx_subs2str( x, mask, fieldalt )\nif nargin < 2,\n mask = [ 1, 1, 1 ];\nend\nif nargin < 3,\n fieldalt = 0;\nend\nif ~isstruct( x ),\n error( 'First arugment must be a structure.' );\nend\ny = '';\nneedfield = fieldalt ~= 0;\nfor k = 1 : length( x ),\n try\n tp = x(k).type;\n catch %#ok\n error( 'Invalid subscript structure: field \"type\" is missing.' );\n end\n if ~ischar( tp ) || size( tp, 1 ) ~= 1,\n error( 'Invalid subscript entry #%d: field \"type\" must be a string', k );\n end\n try\n sb = x(k).subs;\n catch %#ok\n error( 'Invalid subscript structure: field \"subs\" is missing.' );\n end\n switch tp,\n case '.',\n if ~ischar( sb ) || size( sb, 1 ) ~= 1,\n error( 'Invalid subscript entry #%d: field name must be a string.', k );\n elseif ~isvarname( sb ),\n error( 'Invalid subscript entry #%d: invalid field name: %s', k, sb );\n end\n y = [ y, '.', sb ]; %#ok\n needfield = 0;\n case { '()', '{}' },\n if ~mask( 2 )&& tp(1) == '(',\n error( 'Invalid subscript entry #%d: array subscripts not allowed here.', k );\n elseif ~mask( 3 ) && tp(1) == '{',\n error( 'Invalid subscript entry #%d: cell subscripts not allowed here.', k );\n elseif needfield,\n error( 'Invalid subscript entry #%d: structure field expected here.', k );\n elseif ~iscell( sb ),\n error( 'Invalid subscript entry #%d: field \"subs\" must be a cell array.', k );\n elseif fieldalt,\n needfield = 1;\n end\n for j = 1 : length( sb ),\n if isnumeric( sb{j} ),\n sb{j} = sprintf('%g',sb{j});\n elseif ~ischar( sb{j} ) || size( sb{j}, 1 ) ~= 1,\n error( 'Invalid subscript entry #%d: invalid cell/array subscript', j );\n end\n end\n sb = sprintf( '%s,', sb{:} );\n y = [ y, tp(1), sb(1:end-1), tp(2) ]; %#ok\n otherwise,\n error( 'Invalid subscript entry #%d: invalid subscript tp: %s', k, tp );\n end\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_subsasgn.m", "content": "function y = cvx_subsasgn( y, varargin )\ntemp.type = '()';\ntemp.subs = varargin(1:end-1);\ny = subsasgn( y, temp, varargin{end} );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_subsref.m", "content": "function y = cvx_subsref( x, varargin )\ntemp.type = '()';\ntemp.subs = varargin;\ny = subsref( x, temp );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_subsref_check.m", "content": "function s = cvx_subsref_check( nin, nin_norm, S )\n\nif nin < nin_norm,\n s = 'Not enough input arguments';\nelseif nin == nin_norm,\n if ~isa( S, 'struct' ),\n s = 'Subscript argument to SUBSREF and SUBSASGN must be a structure.';\n else\n Sf = fieldnames( S );\n if length( Sf ) ~= 2,\n s = 'Subscript argument to SUBSREF and SUBSASGN must have two fields.';\n elseif ~isempty( setdiff( { 'type', 'subs' }, Sf ) ),\n s = 'Subscript argument to SUBSREF and SUBSASGN must have two fields whose names are \"type\" and \"subs\".';\n elseif isempty( S ),\n s = 'Subscript argument to SUBSREF and SUBSASGN must not be empty.';\n else\n s = '';\n end\n end\nelse\n s = '';\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_use_sparse.m", "content": "function tf = cvx_use_sparse( sz, nz, isr )\r\n\r\n%CVX_USE_SPARSE Sparse/dense matrix efficiency test.\r\n% CVX_USE_SPARSE(SZ,NZ,ISR) is an internal function used by CVX to determine \r\n% if a matrix of size SZ with NZ nonzeros would require less memory to store \r\n% in sparse form or dense form. The matrix is assumed to be real if ISR=1 or\r\n% ISR is omitted, and complex otherwise.\r\n\r\nif nargin == 1,\r\n ss = size( sz );\r\n if length( ss ) > 2,\r\n tf = false;\r\n return\r\n end\r\n isr = isreal( sz );\r\n if issparse( sz ),\r\n nz = nzmax( sz );\r\n else\r\n nz = nnz( sz );\r\n end\r\n sz = ss;\r\nelseif length( sz ) > 2,\r\n tf = false;\r\n return\r\nelseif nargin < 3,\r\n isr = true;\r\nend\r\nif isr,\r\n tf = 1 + ( 1 - 2 * sz( 1 ) ) * sz( 2 ) + 3 * nz < 0;\r\nelse\r\n tf = 1 + ( 1 - 4 * sz( 1 ) ) * sz( 2 ) + 5 * nz < 0;\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_value.m", "content": "function v = cvx_value( x )\r\nv = x;\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_values.m", "content": "function varargout = cvx_values( varargin )\r\nvarargout = cvx_value( varargin );\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_vexity.m", "content": "function y = cvx_vexity( x )\nsx = size( x );\nif cvx_use_sparse( sx, 0, true )\n y = sparse( sx(1), sx(2) );\nelse\n y = zeros( sx );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/cvx_zeros.m", "content": "function x = cvx_zeros( s )\r\nif cvx_use_sparse( s, 0, 1 ),\r\n x = sparse( s(1), s(2) );\r\nelse\r\n x = zeros( s );\r\nend\r\n\r\n% Copyright 2005-2016 CVX Research, Inc.\r\n% See the file LICENSE.txt for full copyright information.\r\n% The command 'cvx_where' will show where this file is located.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/lib/narginchk_/narginchk.m", "content": "function narginchk(imin, imax)\nnarg = evalin('caller', 'nargin');\nif narg < imin,\n\tme = {'MATLAB:narginchk:notEnoughInputs', 'Not enough input arguments.'};\nelseif narg > imax,\n\tme = {'MATLAB:narginchk:tooManyInputs', 'Too many input arguments.'};\nelse\n\treturn\nend\nthrowAsCaller(MException(me{:}));\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/sets/Contents.m", "content": "% CVX: Definitions of common convex sets.\n% complex_lorentz - Complex second-order cone. {(x,y): norm(x)<=y}\n% convex_poly_coeffs - Coefficients of convex degree-n polynomials. {p: p(x) convex}\n% exp_cone - The exponential cone. {(x,y,z): y>=0, y*exp(x/y) <= z }\n% hermitian_semidefinite - Hermitian positive semidefinite matrices. {X: X==X', min(eig(X))>=0}\n% lorentz - Real second-order cones. {(x,y): norm(x)<=y}\n% nonneg_poly_coeffs - Coefficients of nonnegative degree-n polynomials. {p: p(x)>=0 for all x}\n% nonnegative - The nonnegative orthant. {x: x>=0}\n% norm_ball - Norm ball. {x: norm(x,p) <= 1}\n% rotated_complex_lorentz - Rotated complex second-order cone. {(x,y,z): norm(x)^2 <= y*z, y>=0, z>=0 }\n% rotated_lorentz - Rotated real second-order cone. {(x,y,z): norm(x)^2 <= y*z, y>=0, z>=0 }\n% semidefinite - Real symmetric positive semidefinite matrices {X: X==X', min(eig(X))>=0}\n% simplex - The unit simplex. {x: x>=0, sum(x)==1}\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/sets/complex_lorentz.m", "content": "function cvx_optpnt = complex_lorentz( sx, dim )\n\n%COMPLEX_LORENTZ Complex second-order cone.\n% COMPLEX_LORENTZ(N), where N is a positive integer, creates a column\n% variable of length N and a scalar variable, and constrains them\n% to lie in a second-order cone. That is, given the declaration\n% variable x(n) complex\n% variable y\n% the constraint\n% {x,y} == complex_lorentz(n)\n% is equivalent to\n% norm(x,2) <= y\n% The inequality form is more natural, and preferred in most cases. But\n% in fact, the COMPLEX_LORENTZ set form is used by CVX itself to convert\n% complex NORM()-based constraints to solvable form.\n%\n% COMPLEX_LORENTZ(SX,DIM), where SX is a valid size vector and DIM is a\n% positive integer, creates an array variable of size SX and an array\n% variable of size SY (see below) and applies the second-order cone\n% constraint along dimension DIM. That is, given the declarations\n% sy = sx; sy(min(dim,length(sx)+1))=1;\n% variable x(sx) complex\n% variable y(sy)\n% the constraint\n% {x,y} == complex_lorentz(sx,dim)\n% is equivalent to\n% norms(x,2,dim) <= y\n% Again, the inequality form is preferred, but CVX uses the set form\n% internally. DIM is optional; if it is omitted, the first non-singleton\n% dimension is used.\n%\n% LORENTZ(SX,DIM,CPLX) creates real second-order cones if CPLX is FALSE,\n% and complex second-order cones if CPLX is TRUE. The latter case is\n% equivalent to COMPLEX_LORENTZ(SX,DIM).\n%\n% Disciplined convex programming information:\n% LORENTZ is a cvx set specification. See the user guide for\n% details on how to use sets.\n\nnarginchk(1,2);\nif nargin == 1,\n cvx_optpnt = lorentz( sx, [], true );\nelse\n cvx_optpnt = lorentz( sx, dim, true );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/sets/convex_poly_coeffs.m", "content": "function cvx_optpnt = convex_poly_coeffs( deg, mm ) %#ok\n\n%CONVEX_POLY_COEFFS Coefficients of convex degree-n polynomials. \n% CONVEX_POLY_COEFFS(DEG), where DEG is a nonnegative integer, creates a\n% CVX vector variable of length DEG+1 and treats its values as\n% coefficients of a polynomial (in the same sense as POLYVAL). It then\n% constraints those coefficients to guarantee that the resulting\n% polynomial will be convex; that is, its second derivative will be\n% nonnegative over the entire real line. That is, given the declaration\n% variable p(deg+1)\n% p == convex_poly_coeffs(deg)\n% the value of P that results will satisfy\n% POLYVAL([DEG:-1:2].*[DEG-1:-1:1].*P(1:END-2),X)>=0\n% for any real value of X.\n%\n% CONVEX_POLY_COEFFS(DEG,MM), where MM is a real vector of length 2,\n% constrains convexity only over the interval MM(1) <= X <= MM(2).\n% That is, given a declaration\n% variable p(deg+1)\n% p == nonneg_poly_coeffs(deg,mm)\n% the value of P that results will satisfy\n% POLYVAL([DEG:-1:2].*[DEG-1:-1:1].*P(1:END-2),X)>=0\n% between MM(1) and MM(2), inclusive. It may be negative outside that\n% interval. Note that MM(1) must be less than MM(2) for this constraint\n% to have any effect.\n%\n% Disciplined convex programming information:\n% CONVEX_POLY_COEFFS is a cvx set specification. See the user guide\n% for details on how to use sets.\n\nnarginchk(1,2);\n\n%\n% Check argument\n%\n\nif ~cvx_check_dimension( deg, true ),\n error( 'Argument must be a nonnegative integer.' );\nelseif rem( deg, 2 ) ~= 0 && deg ~= 1,\n error( 'Degree must be 0, 1, or even.' );\nend\n\n% Check range argument\n%\n\nif nargin < 2 || isempty( mm ),\n mm = [ -Inf, +Inf ];\nelse\n if ~isa( mm, 'double' ) || ~isreal( mm ) || ndims( mm ) > 2 || numel( mm ) ~= 2 && size( mm, 2 ) ~= 2, %#ok\n error( 'Second argument must be a range [ xmin xmax ] or a matrix of them.' );\n end\n mm = reshape( mm, 0.5 * numel( mm ), 2 );\n m1 = mm(:,1);\n m2 = mm(:,2);\n if any( ( m1 == m2 ) & isinf( m1 ) ),\n error( 'Intervals [-Inf,-Inf] and [+Inf,+Inf] are not accepted.' );\n end\nend\n\n%\n% Construct set\n%\n\ncvx_begin set\n variable coeffs(deg+1);\n if deg >= 2,\n ((deg:-1:2).*(deg-1:-1:1))'.*coeffs(1:end-2,:) == nonneg_poly_coeffs(deg-2,mm); %#ok\n end\ncvx_end\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/sets/exponential.m", "content": "function cvx_optpnt = exponential( sx )\n\n%EXPONENTIAL Exponential cone.\n% EXPONENTIAL, called with no arguments, creates three scalar variables X,\n% Y, and Z and constraints them to lie in an exponetial cone. That is,\n% given the declaration\n% variables x y z\n% {x,y,z} == exp_cone\n% constraints the variables to satisfy\n% y*exp(x/y) <= z\n% y > 0\n% The inequality form does not obey the disciplined convex programming\n% ruleset, but a function EXP_P has been created to represent this\n% computation; so the set declaration above is equivalent to\n% EXP_P(X,Y) <= Z\n% EXP_CONE(SX), where SX is a size vector, creates three array variables\n% X, Y, and Z, each of size SX, which are constrained elementwise to\n% satisfy EXP_P(X,Y) <= Z. If SX is empty, then SX=[1,1] is assumed.\n\ncvx_expert_check( 'exponential' );\nnarginchk(0,1);\n\n%\n% Check size vector\n%\n\nif nargin == 0 || isempty( sx ),\n sx = [1,1]; %#ok\nelse\n [ temp, sx ] = cvx_check_dimlist( sx, true ); %#ok\n if ~temp,\n error( 'First argument must be a dimension vector.' );\n end\nend\n\n\n%\n% Build the cone\n%\n\ncvx_begin set\n variables x( sx ) y( sx ) z( sx )\n [ tx, dummy ] = find( cvx_basis( x ) ); %#ok\n [ ty, dummy ] = find( cvx_basis( y ) ); %#ok\n [ tz, dummy ] = find( cvx_basis( z ) ); %#ok\n newnonl( cvx_problem, 'exponential', [ tx(:)' ; ty(:)' ; tz(:)' ] );\n cvx___.canslack( tx ) = false;\n cvx___.canslack( ty ) = false;\ncvx_end\n\ncvx_optpnt = cvxtuple( struct( 'x', x, 'y', y, 'z', z ) );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/sets/geo_mean_cone.m", "content": "function [ cvx_optpnt, mode ] = geo_mean_cone( sx, dim, w, mode )\n\n%GEO_MEAN_CONE Cones involving the geometric mean.\n% GEO_MEAN_CONE(N), where N is a positive integer, creates a column vector\n% variable X of length N and a scalar variable Y, and constrains them to\n% satisfy GEO_MEAN(X) >= Y and X >= 0. That is, given the declaration\n% variables x(n) y\n% the constraint\n% {x,y} == geo_mean_cone(n)\n% is equivalent to\n% geo_mean(x) >= y\n% CVX uses the GEO_MEAN_CONE to implement the GEO_MEAN function and a\n% variety of others, including POW_POS, POW_P, POW_ABS, and NORM. For\n% clarity, users should prefer these functions instead of using this cone\n% directly.\n%\n% GEO_MEAN_CONE(SY,DIM), where SY is a valid size vector and DIM is a\n% positive integer, creates an array variable of size SY and and an array\n% variable of size SX (see below) and applies the geometric mean\n% constraint along dimension DIM. That is, given the declarations\n% sy = sx; sy(min(dim,length(sx)+1))=1;\n% variables x(sx) y(sy)\n% the constraint\n% {x,y} == geo_mean_cone(sx,dim)\n% is equivalent to\n% geo_mean(x,dim) >= y\n% Again, the inequality form is preferred, but CVX uses the set form\n% internally. DIM is optional; if it is omitted or empty, the first\n% non-singleton dimension is used.\n%\n% GEO_MEAN_CONE(SX,DIM,W), where W is a vector of nonnegative numbers,\n% replaces the standard geometric mean with a weighted geometric mean\n% geo_mean(x,dim,w) >= y\n% The standard geometric mean is equivalent to W=ones(SX(DIM),1). Due to\n% the way CVX implements weighted geometric means, it rounds the elements\n% of W to the \"nearest\" rationals according to the RAT function.\n%\n% GEO_MEAN_CONE(SX,MODE),\n% GEO_MEAN_CONE(SX,DIM,MODE), or\n% GEO_MEAN_CONE(SX,DIM,W,MODE), where MODE is a string, generates a number\n% of alternative cones:\n% MODE = 'HYPO': geo_mean(x) >= y\n% MODE = 'POS' : geo_mean(x) >= y, y >= 0\n% MODE = 'ABS' : geo_mean(x) >= abs(y) \n% MODE = 'CABS': geo_mean(x) >= abs(y), y complex\n% MODE = 'FUNC': select 'POS' or 'ABS', depending on which one is\n% is cheaper to implement. This is useful when y can be guaranteed\n% to be nonnegative in some other way; say, through an external\n% constraint or a maximizing objective. The mode actually used\n% will be returned as a second output argument.\n% MODE = '' is the same as MODE = 'HYPO'. GEO_MEAN_CONE is insensitive\n% to case; e.g., 'pos' is equivalent to 'POS'.\n%\n% Disciplined convex programming information:\n% GEO_MEAN_CONE is a CVX set specification. See the user guide for\n% details on how to use sets. However, it is strongly recommended\n% that users take advantage of this set by calling the functions that\n% utilize it; i.e., GEO_MEAN, POW_POS, POW_ABS, POW_P, NORM, etc.\n% Doing so will produce models that are simpler to understand.\n\n%\n% Check size vector\n%\n\n[ temp, sx ] = cvx_check_dimlist( sx, true );\nif ~temp,\n error( 'First argument must be a dimension vector.' );\nend\n\n%\n% Check dimension\n%\n\nif nargin < 4,\n mode = '';\nend\nif nargin == 2 && ischar( dim ),\n mode = dim;\n dim = cvx_default_dimension( sx );\nelseif nargin < 2 || isempty( dim ),\n dim = cvx_default_dimension( sx );\nelseif ~cvx_check_dimension( dim, true ),\n error( 'Second argument must be a nonnegative integer.' );\nend\nsy = sx;\nnd = length( sx );\nif dim <= 0 || dim > nd || sx( dim ) == 1,\n nx = 1;\n dim = 0;\nelse\n nx = sx( dim );\n sy( dim ) = 1;\nend\n\n%\n% Check weight vector\n%\n\nif nargin == 3 && ischar( w ),\n mode = w;\n w = [];\nelseif nargin < 3 || isempty( w ),\n w = [];\nelseif numel( w ) ~= length( w ) || ~isnumeric( w ) || ~isreal( w ) || any( w < 0 ),\n error( 'Third argument must be a vector of nonnegative real numbers.' );\nelseif length( w ) ~= nx,\n error( 'Third argument must be a vector of length %d', nx );\nelseif nx ~= 0 && ~any( w ),\n error( 'At least one of the weights must be nonzero.' );\nend\nif ~isempty( w ) && any( w ~= floor( w ) ),\n [ nn, dd ] = rat( w );\n dmax = dd(1);\n for k = 2 : length(dd), dmax = lcm(dmax,dd(k)); end\n w = nn .* ( dmax ./ dd );\nend\n\n%\n% Check mode string\n%\n\nif isempty( mode ),\n mode = 'hypo';\nelseif ~ischar( mode ) || size( mode, 1 ) > 1,\n error( 'Mode must be a string.' );\nelse\n lmode = lower(mode);\n if ~any( strcmp( lmode, { 'hypo', 'pos', 'abs', 'cabs', 'func' } ) ),\n error( [ 'Invalid mode string: ', mode ] );\n end\n mode = lmode;\nend\n\n%\n% Quick exit for empty arrays and degenerate cases\n%\n\nif any( sx == 0 ),\n cvx_begin set\n variables x(sx) y(sy)\n cvx_end\n return\nelseif nx == 1,\n cvx_begin set\n variable x(sx)\n x >= 0; %#ok\n switch mode,\n case { 'hypo', 'func' },\n variable y(sy)\n x >= y; %#ok\n case 'pos',\n variable y(sy)\n x >= y; %#ok\n y >= 0; %#ok\n case 'abs', \n variable y(sy)\n x >= abs( y ); %#ok\n case 'cabs',\n variable y(sy) complex\n x >= abs( y ); %#ok\n end\n cvx_end\n return\nend\n\n%\n% Construct the cone.\n% --- For nx == 2, the geo_mean the following equivalency\n% sqrt( x(1) * x(2) ) >= | y |, x >= 0 <--> [x(1),y;y,x(2)] psd\n% --- For nx == 2^k, we can recursively apply this k times. For example,\n% for nx = 4, we have\n% ( x(1) * x(2) * x(3) * x(4) )^(1/4) >= | y |, x >= 0\n% is equivalent to\n% sqrt( w(1) * w(2) ) >= |y|, w(1),w(2) >= 0\n% sqrt( x(1) * x(2) ) >= | w(1) |, x(1),x(2) >= 0\n% sqrt( x(3) * x(4) ) >= | w(2) |, x(3),x(4) >= 0\n% which can be represented by 3 2x2 LMIs.\n% --- For other values of nx, we note that\n% prod( x )^(1/nx) >= y, x >= 0, y >= 0\n% is equivalent to\n% prod( [ x ; y * ones(ny,1) ] )^(1/(nx+ny)) >= y\n% so by adding extra y's to the left-hand side, we can use the same\n% recursion for lengths that are not powers of two.\n% --- Note that the power-of-two cone allows y to be negative, while the \n% non-power-of-two cone does not. Therefore, for consistency, we have\n% to modify one cone or the other appropriately. For instance, to\n% recover the absolute value behavior in the latter case, we must\n% actually construct the cone\n% prod( x )^(1/nx) >= z >= abs(y), x >= 0, z >= 0\n% --- For integer-weighted geometric means, we must effectively replicate\n% each x(i) w(i) times. However, because sqrt( x(i) * x(i) ) = x(i),\n% we can prune away most of the duplicated values very cheaply. The\n% number of non-trivial appearances of x(i) will be reduced from w(i)\n% to at most ceil(log2(w(i))), or more precisely the number of 1's in \n% a binary expansion of w(i). In fact, the number might be lower than\n% that thanks to savings achieved by grouping terms with common bit\n% patterns in their w(i) values.\n%\n\n%\n% Construct the map\n%\n\nif isempty( w ) || ~any( diff( w ) ),\n wbasic = true;\n wsum = nx;\n w = ones( 1, nx );\nelse\n w = w(:)';\n for k = factor(min(w(w~=0))),\n if all( rem( w, k ) == 0 ), w = w / k; end\n end\n wsum = sum( w );\n wbasic = false;\nend\nworig = w;\nnq = nextpow2(wsum);\nnw = pow2(nq);\nndxs = 1 : nx;\nif nw > wsum,\n ndxs(end+1) = 0;\n w(end+1) = nw - wsum;\nend\n%\n% Look for candidates with common factors that can be\n% extracted to save LMI blocks: e.g.,\n% ( x1^3 x2^2 x2^3 )^(1/8) =\n% = ((sqrt(x1 x3))^(1/6) x2^2)^(1/8)\n%\nn3 = nx;\nmap = [];\nif ~wbasic,\n [ ff, ee ] = log2( w ); %#ok\n ndx1 = find( ff ~= 0.5 & ff ~= 0 );\n while length( ndx1 ) > 1,\n % Build cross matrix\n nv = length( ndx1 );\n ww = w( ndx1 );\n ww = ones( nv, 1 ) * ww;\n [ wi, wj, ww ] = find( bitand( tril(ww,-1)', triu(ww,1) ) );\n [ ff, ee ] = log2( ww ); \n ndx2 = find( ff ~= 0.5 );\n if isempty( ndx2 ), break; end\n % Greedy: select the largest overlap\n ee = ee(ndx2);\n [ wc_t, wnm ] = max( sum(dec2bin(ww(ndx2))-'0',2)+(1-ee/(max(ee)+1)) ); %#ok\n % Construct a 2-element geo_mean\n wi_t = ndx1(wi(ndx2(wnm)));\n wj_t = ndx1(wj(ndx2(wnm)));\n n3 = n3 + 1;\n ndxs = [ ndxs, n3 ]; %#ok\n map = [ map, [ ndxs(wi_t) ; ndxs(wj_t) ; n3 ] ]; %#ok\n % Update the weights\n wt = bitand( w(wi_t), w(wj_t) );\n w(end+1) = 2 * wt; %#ok\n try\n wt = bitcmp( wt, nq );\n w(wi_t) = bitand( w(wi_t), wt );\n w(wj_t) = bitand( w(wj_t), wt );\n catch\n wt = bitcmp( uint64(wt) );\n w(wi_t) = double( bitand( uint64(w(wi_t)), wt ) );\n w(wj_t) = double( bitand( uint64(w(wj_t)), wt ) );\n end\n % Update the count\n ndx1 = [ ndx1, length(ndxs) ]; %#ok\n [ ff, ee ] = log2( w(ndx1) ); %#ok\n ndx1 = ndx1( ff ~= 0.5 & ff ~= 0 );\n end\nend\n\n%\n% Now do standard left-to-right combining\n% x1^3 x2^2 x3^3 = x1 x1 x1 x2 x2 x3 x3 x3\n% = (x1 x1)(x1 x2)(x2 x3)(x3 x3)\n%\nfor k = 1 : nq,\n tt = rem( w, 2 ) ~= 0;\n w = floor( 0.5 * w );\n n12 = ndxs( tt );\n ntt = 0.5 * length( n12 );\n if ntt >= 1,\n n3 = n3(end) + 1 : n3(end) + ntt;\n map = [ map, [ reshape( n12, 2, ntt ) ; n3 ] ]; %#ok\n ndxs = [ ndxs, n3 ]; %#ok\n w = [ w, ones( 1, ntt ) ]; %#ok\n end\nend\nif ~isempty( map ),\n map(map==0) = map(end);\nelse\n map = zeros(3,0);\nend\n\n%\n% Build the cone\n%\n\nnv = prod( sy );\nnm = size(map,2);\nmused = nnz( map == nm + nx ) > 1;\ncvx_begin set\n variable x( nx, nv );\n if isequal( mode, 'cabs' ),\n variable y( 1, nv ) complex;\n else\n variable y( 1, nv );\n end\n variable xw( nm-1, nv );\n cone = [];\n xa = [];\n switch mode,\n case 'func',\n if mused,\n mode = 'pos';\n else\n mode = 'abs';\n end\n case 'hypo',\n variable xa( 1, nv );\n y <= xa; %#ok\n case 'pos',\n if ~mused,\n y >= 0; %#ok\n end\n case 'abs',\n if mused,\n variable xa( 1, nv );\n abs( y ) <= xa; %#ok\n end\n case 'cabs',\n if mused,\n variable xa( 1, nv );\n abs( y ) <= xa; %#ok\n else\n cone = hermitian_semidefinite( [2,2,1,nv] );\n end\n end\n if isempty( xa ),\n xa = y;\n end\n if isempty( cone ),\n cone = semidefinite( [2,2,nm,nv] );\n elseif nm > 1,\n cone = cat( 3, semidefinite( [2,2,nm-1,nv] ), cone );\n end\n xt = [ x ; xw ; xa ]; %#ok\n xt( map(1,:), : ) == reshape( cone(1,1,:,:), [nm,nv] ); %#ok\n xt( map(2,:), : ) == reshape( cone(2,2,:,:), [nm,nv] ); %#ok\n xt( map(3,:), : ) == reshape( cone(2,1,:,:), [nm,nv] ); %#ok\n tt = worig == 0;\n if any( tt ),\n x( tt, : ) >= 0; %#ok\n end\ncvx_end\n\n%\n% Permute and reshape as needed\n%\n\nnleft = prod( sx(1:dim-1) );\nnright = prod( sx(dim+1:end) );\nif nleft > 1,\n x = reshape( x, [ nx, nleft, nright ] );\n y = reshape( y, [ 1, nleft, nright ] );\n x = permute( x, [ 2, 1, 3 ] );\n y = permute( y, [ 2, 1, 3 ] );\nend\nx = reshape( x, sx );\ny = reshape( y, sy );\ncvx_optpnt = cvxtuple( struct( 'x', x, 'y', y ) );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/sets/hermitian_semidefinite.m", "content": "function cvx_optpnt = hermitian_semidefinite( n )\n\n%HERMITIAN_SEMIDEFINITE Complex Hermitian positive semidefinite matrices.\n% HERMITIAN_SEMIDEFINITE(N), where N is an integer, creates a complex \n% Hermitian matrix variable of size [N,N] and constrains it to be \n% positive semidefinite. Therefore, given the declaration\n% variable x(n,n) Hermitian\n% the constraint\n% x == hermitian_semidefinite(n)\n% is equivalent to\n% lambda_min(x) >= 0;\n% In fact, lambda_min is implemented in CVX using HERMITIAN_SEMIDEFINITE\n% for complex matrices.\n%\n% HERMITIAN_SEMIDEFINITE(SX), where SX is a valid size vector, creates\n% an array variable of size SX and constrains each subarray along the \n% leading two dimensions to be positive semidefinite. SX(1) and SX(2)\n% must be equal. Therefore, given the declaration\n% variable x(sx) Hermitian\n% the constraint\n% x == hermitian_semidefinite(sx)\n% is equivalent to\n% for k = 1:prod(sx(3:end)),\n% lambda_min(x(:,:,k)) >= 0;\n% end\n%\n% Disciplined convex programming information:\n% SEMIDEFINITE is a cvx set specification. See the user guide for\n% details on how to use sets.\n\nnarginchk(1,1);\ncvx_optpnt = semidefinite( n, true );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/sets/lorentz.m", "content": "function cvx_optpnt = lorentz( sx, dim, iscplx )\n\n%LORENTZ Real second-order cone.\n% LORENTZ(N), where N is a positive integer, creates a column\n% variable of length N and a scalar variable, and constrains them\n% to lie in a second-order cone. That is, given the declaration\n% variables x(n) y\n% the constraint\n% {x,y} == lorentz(n)\n% is equivalent to\n% norm(x,2) <= y\n% The inequality form is more natural, and preferred in most cases. But\n% in fact, the LORENTZ set form is used by CVX itself to convert NORM()-\n% based constraints to solvable form.\n%\n% LORENTZ(SX,DIM), where SX is a valid size vector and DIM is a positive\n% integer, creates an array variable of size SX and an array\n% variable of size SY (see below) and applies the second-order cone\n% constraint along dimension DIM. That is, given the declarations\n% sy = sx; sy(min(dim,length(sx)+1))=1;\n% variables x(sx) y(sy)\n% the constraint\n% {x,y} == lorentz(sx,dim)\n% is equivalent to\n% norms(x,2,dim) <= y\n% Again, the inequality form is preferred, but CVX uses the set form\n% internally. DIM is optional; if it is omitted, the first non-singleton\n% dimension is used.\n%\n% LORENTZ(SX,DIM,CPLX) creates real second-order cones if CPLX is FALSE,\n% and complex second-order cones if CPLX is TRUE. The latter case is\n% equivalent to COMPLEX_LORENTZ(SX,DIM).\n%\n% Disciplined convex programming information:\n% LORENTZ is a cvx set specification. See the user guide for\n% details on how to use sets.\n\nnarginchk(1,3);\n\n%\n% Check size vector\n%\n\n[ temp, sx ] = cvx_check_dimlist( sx, true );\nif ~temp,\n error( 'First argument must be a dimension vector.' );\nend\n\n%\n% Check dimension\n%\n\nif nargin < 2 || isempty( dim ),\n dim = cvx_default_dimension( sx );\nelseif ~cvx_check_dimension( dim, true ),\n error( 'Second argument must be a dimension (or zero).' );\nend\nsy = sx;\nnd = length( sx );\nif dim <= 0 || dim > nd || sx( dim ) == 1,\n nv = 1;\n dim = 0;\nelse\n nv = sx( dim );\n sy( dim ) = 1;\nend\n\n%\n% Check complex flag\n%\n\nif nargin < 3 || isempty( iscplx ),\n iscplx = false;\nelseif length( iscplx ) ~= 1,\n error( 'Third argument must be a scalar.' );\nelse\n iscplx = logical( iscplx );\nend\n\n%\n% Build the cone\n%\n\nny = prod( sy );\nif nv == 0,\n iscplx = false;\nelseif iscplx,\n nv = nv * 2;\nend\ncvx_begin set\n variables x( nv, ny ) y( 1, ny )\n [ ty, dummy ] = find( cvx_basis( y ) ); %#ok\n if nv > 0,\n [ tx, dummy ] = find( cvx_basis( x ) ); %#ok\n newnonl( cvx_problem, 'lorentz', [ reshape( tx, nv, ny ) ; reshape( ty, 1, ny ) ] );\n cvx___.canslack( tx ) = false;\n else\n newnonl( cvx_problem, 'nonnegative', ty );\n end\ncvx_end\n\n%\n% Permute and reshape as needed\n%\n\nif iscplx,\n x = cvx_r2c( x, 1 );\n nv = nv * 0.5;\nend\nnleft = prod( sx( 1 : dim - 1 ) );\nif nleft > 1,\n x = reshape( x, [ nv, nleft, ny / nleft ] );\n y = reshape( y, [ 1, nleft, ny / nleft ] );\n x = permute( x, [ 2, 1, 3 ] );\n y = permute( y, [ 2, 1, 3 ] );\nend\nx = reshape( x, sx );\ny = reshape( y, sy );\ncvx_optpnt = cvxtuple( struct( 'x', x, 'y', y ) );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/sets/nonneg_poly_coeffs.m", "content": "function coeffs = nonneg_poly_coeffs( deg, trig, mm ) %#ok\n\n%NONNEG_POLY_COEFFS Coefficients of nonnegative degree-n polynomials. \n% NONNEG_POLY_COEFFS(DEG), where DEG is a nonnegative integer, creates a\n% vector variable of length DEG+1 and treats its values as\n% coefficients of a polynomial (in the same sense as POLYVAL). It then\n% constrains those coefficients to guarantee that the resulting\n% polynomial will be nonnegative over the entire real line. That is, \n% given a declaration\n% variable p(deg+1)\n% p == nonneg_poly_coeffs(deg)\n% the value of P that results will satisfy POLYVAL(P,X)>=0 for any real\n% value of X.\n%\n% NONNEG_POLY_COEFFS(DEG,MM), where MM is a real vector of length 2,\n% constrains nonnegativity only over the interval MM(1) <= X <= MM(2).\n% That is, given a declaration\n% variable p(deg+1)\n% p == nonneg_poly_coeffs(deg,mm)\n% the value of P that results will satisfy POLYVAL(P,X)>=0 for any real\n% value of X between MM(1) and MM(2), inclusive. It may be negative\n% outside that interval. Note that MM(1) must be less than MM(2) for\n% this constraint to have any effect.\n%\n% NONNEG_POLY_COEFFS(DEG,'TRIG') and NONNEG_POLY_COEFFS(DEG,MM,'TRIG')\n% create sets of coefficients of nonnegative *trigonometric* polynomials.\n% That is, given the declaration\n% variable p(deg+1)\n% p == nonneg_poly_coeffs(deg,true)\n% the value of P that resutls will satisfy \n% REAL(POLYVAL(P,EXP(-SQRT(-1)*X)))>=0 \n% for any value of X.\n%\n% Disciplined convex programming information:\n% NONNEG_POLY_COEFFS is a cvx set specification. See the user guide\n% for details on how to use sets.\n\nnarginchk(1,3);\n\n \n%\n% Check degree argument\n%\n\nif ~cvx_check_dimension( deg, true ),\n error( 'Argument must be a nonnegative integer.' );\nend\n\n%\n% Check trig argument\n%\n\nswitch nargin,\n case 1,\n mm = [];\n trig = false;\n case 2,\n if isequal( trig, 'trig' ),\n trig = true;\n mm = [];\n else\n mm = trig;\n trig = false;\n end\n case 3,\n if ~isequal( trig, 'trig' ),\n error( 'Second argument must be a range, or ''trig''.' );\n end\n trig = true;\nend\n\n%\n% Check range argument\n%\n \nif isempty( mm ),\n mm = [ -Inf, +Inf ];\nelseif ~isa( mm, 'double' ) || ~isreal( mm ) || numel( mm ) ~= 2,\n error( 'Second argument, if supplied, must be a range [ xmin xmax ].' );\nelseif any( mm(1) == mm(2) & isinf( mm(1) ) ),\n error( 'Intervals [-Inf,-Inf] and [Inf,Inf] are not accepted.' );\nend\n\n%\n% Construct set\n%\n\nif trig,\n \n %\n % Trigonometric\n %\n \n cvx_begin set\n variable coeffs(deg+1) complex;\n if mm(1) == mm(2),\n % Positive at a single point\n polyval_trig( coeffs, mm(1) ) >= 0; %#ok\n elseif mm(2) > mm(1) + 2 * pi,\n % Positive over the entire unit circle\n [ii,jj,vv] = find(hermitian_semidefinite(deg+1));\n coeffs == sparse( deg+1-abs(ii-jj), 1, vv ); %#ok\n elseif mm(2) > mm(1),\n % Positive over a subset of the unit circle\n a = exp( 1i * ( 0.5 * ( mm(2) + mm(1) ) ) );\n b = cos( 0.5 * ( mm(2) - mm(1) ) );\n coeffs1 = nonneg_poly_coeffs(deg,'trig');\n coeffs2 = nonneg_poly_coeffs(deg-1,'trig');\n coeffs == coeffs1 ...\n + [ (0.5*a)*coeffs2 ; 0 ] ...\n + [ 0 ; 0 ; (0.5*conj(a))*coeffs2(1:end-1) ] ...\n + [ zeros(deg-1,1) ; (0.5*a)*conj(coeffs2(end)) ; 0 ] ...\n - [ 0 ; b*coeffs2 ]; %#ok\n end\n cvx_end\n \nelse \n \n %\n % Non-trigonometric\n %\n\n cvx_begin set\n variable coeffs(deg+1);\n if mm(1) == mm(2),\n % Positive at a single point\n polyval( coeffs, mm(1) ) >= 0; %#ok\n elseif mm(1) == -Inf,\n isodd = rem(deg,2);\n deg2 = floor(0.5*deg) + 1;\n [ii,jj,vv] = find(semidefinite(deg2));\n coeffs1 = sparse(ii+jj-1+isodd,1,vv);\n if mm(2) == +Inf,\n % [ -Inf, +Inf ]\n coeffs == coeffs1; %#ok\n else\n % [ -Inf, mm(2) ]\n coeffs2 = nonneg_poly_coeffs(deg-1);\n coeffs == coeffs1 - [ coeffs2 ; 0 ] + [ 0 ; mm(2) * coeffs2 ]; %#ok\n end\n elseif mm(2) == +Inf,\n % [ mm(1), +Inf ]\n coefff1 = nonneg_poly_coeffs(deg); %#ok\n coeffs2 = nonneg_poly_coeffs(deg-1);\n coeffs == coeffs1 + [ coeffs2 ; 0 ] - [ 0 ; mm(1) * coeffs2 ]; %#ok\n elseif mm(1) < mm(2),\n % [ mm(1), mm(2) ]\n coeffs1 = nonneg_poly_coeffs(deg);\n coeffs2 = nonneg_poly_coeffs(deg);\n [ 0 ; coeffs ] == ...\n + [ coeffs1 ; 0 ] - [ 0 ; mm(1) * coeffs1 ] ...\n - [ coeffs2 ; 0 ] + [ 0 ; mm(2) * coeffs2 ]; %#ok\n end\n cvx_end\n\nend\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/sets/nonnegative.m", "content": "function cvx_optpnt = nonnegative( sx ) %#ok\n\n%NONNEGATIVE The nonnegative orthant.\n% NONNEGATIVE(SX), where SX is a valid size vector, creates an array\n% of size SX and constrains each element to be nonnegative. Therefore,\n% given the declaration\n% variable x(sx)\n% the constraint\n% x == nonnegative(sx);\n% is equivalent to\n% x >= 0;\n% Obviously, the inequality form is simpler and is preferred in most\n% circumstances.\n%\n% Disciplined convex programming information:\n% NONNEGATIVE is a cvx set specification. See the user guide for\n% details on how to use sets.\n\nnarginchk(1,1);\n\n[ temp, sx ] = cvx_check_dimlist( sx, true );\nif ~temp,\n error( 'Argument must be a non-empty dimension vector.' );\nend\n \ncvx_begin set\n variables x( sx )\n if all( sx ~= 0 ),\n [ tx, dummy ] = find( cvx_basis( x ) ); %#ok\n newnonl( cvx_problem, 'nonnegative', tx(:) );\n end\ncvx_end\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/sets/norm_ball.m", "content": "function cvx_optpnt = norm_ball( sz, varargin ) %#ok\n\n%NORM_BALL Norm ball.\n% NORM_BALL( sz, ... ) returns a variable of size sz, say 'x', that is\n% constrained to satisfy NORM( x, ... ) <= 1. Any syntactically valid\n% and _convex_ use of the NORM() function has a direct analog in\n% NORM_BALL. The convex requirement specifically excludes, then, all\n% instances of NORM( x, p ) where p < 1.\n%\n% See NORM for more detaills.\n%\n% Disciplined convex programming information:\n% NORM_BALL is a cvx set specification. See the user guide for\n% details on how to use sets.\n\nnarginchk(1,Inf);\n[ temp, sz ] = cvx_check_dimlist( sz, false );\nif ~temp,\n error( 'First argument must be a valid dimension list.' );\nelseif length( sz ) > 2,\n error( 'N-D arrays not supported.' );\nend\n\ncvx_begin set\n variable x( sz )\n norm( x, varargin{:} ) <= 1; %#ok\ncvx_end\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/sets/rotated_complex_lorentz.m", "content": "function cvx_optpnt = rotated_complex_lorentz( sx, dim )\n\n%ROTATED_COMPLEX_LORENTZ Rotated complex second-order cone.\n\n% ROTATED_COMPLEX_LORENTZ is the complex version of ROTATED_LORENTZ.\n% ROTATED_COMPLEX_LORENTZ(N), where N is a positive integer, creates a \n% complex column variable of length N and two real scalar \n% variables, and constrains them to lie in a complex rotated second-order\n% cone. That is, given the declarations\n% variable x(n) complex\n% variables y z\n% the constraint\n% {x,y,z} == rotated_complex_lorentz(n)\n% is equivalent to\n% norm(x,2) <= geo_mean([y,z])\n% except that using ROTATED_COMPLEX_LORENTZ is more efficient.\n%\n% ROTATED_COMPLEX_LORENTZ(SX,DIM), where SX is a valid size vector and\n% DIM is a positive integer, creates a complex array variable of size\n% SX and two real array variables of size SY (see below), and applies the\n% second-order cone constraint along the dimension DIM. That is, given\n% the declarations\n% sy = sx; sy(min(dim,length(sx)+1)) = 1;\n% variable x(sx) complex\n% variables y(sy) z(sz)\n% the constraint\n% {x,y,z} == rotated_complex_lorentz(sx,dim)\n% is equivalent to\n% norms(x,2,dim) <= geo_mean(cat(dim,y,z),dim)\n% except, again, ROTATED_LORENTZ is more efficient. DIM is optional; if\n% it is omitted, the first non-singleton dimension is used.\n%\n% Disciplined convex programming information:\n% ROTATED_COMPLEX_LORENTZ is a cvx set specification. See the user \n% guide for details on how to use sets.\n\nnarginchk(1,2);\nif nargin == 1,\n cvx_optpnt = rotated_lorentz( sx, [], true );\nelse\n cvx_optpnt = rotated_lorentz( sx, dim, true );\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/sets/rotated_lorentz.m", "content": "function cvx_optpnt = rotated_lorentz( sx, dim, iscplx )\n\n%ROTATED_LORENTZ Rotated real second-order cone.\n% ROTATED_LORENTZ(N), where N is a positive integer, creates a column\n% variable of length N and two scalar variables, and constrains them\n% to lie in a rotated second-order cone. That is, given the declaration\n% variables x(n) y z\n% the constraint\n% {x,y,z} == rotated_lorentz(n)\n% is equivalent to\n% norm(x,2) <= geo_mean([y,z])\n% except that using ROTATED_LORENTZ is more efficient.\n%\n% ROTATED_LORENTZ(SX,DIM), where SX is a valid size vector and DIM is a\n% positive integer, creates an array variable of size SX and two \n% array variables of size SY (see below) and applies the second-order cone\n% constraint along dimension DIM. That is, given the declarations\n% sy = sx; sy(min(dim,length(sx)+1))=1;\n% variables x(sx) y(sy) z(sz)\n% the constraint\n% {x,y,z} == rotated_lorentz(sx,dim)\n% is equivalent to\n% norms(x,2,dim) <= geo_mean(cat(dim,y,z),dim)\n% except, again, ROTATED_LORENTZ is more efficient. DIM is optional; if\n% it is omitted, the first non-singleton dimension is used.\n%\n% ROTATED_LORENTZ(SX,DIM,CPLX) creates real second-order cones if CPLX is\n% FALSE, and complex second-order cones if CPLX is TRUE. The latter case\n% is equivalent to COMPLEX_ROTATED_LORENTZ(SX,DIM).\n%\n% Disciplined convex programming information:\n% ROTATED_LORENTZ is a cvx set specification. See the user guide for\n% details on how to use sets.\n\n%\n% Check size vector\n%\n\nnarginchk(1,3);\n[ temp, sx ] = cvx_check_dimlist( sx, true );\nif ~temp,\n error( 'First argument must be a dimension vector.' );\nend\n\n%\n% Check dimension\n%\n\nnd = length( sx );\nif nargin < 2 || isempty( dim ),\n dim = cvx_default_dimension( sx );\nelseif ~cvx_check_dimension( dim, true ),\n error( 'Second argument must be a dimension (or zero).' );\nelseif dim == 0 || dim > nd || sx( dim ) == 1,\n dim = find( sx == 1 );\n if isempty( dim ),\n dim = nd + 1;\n else\n dim = dim( 1 );\n end\nend\nif dim > nd,\n sx( end + 1 : dim ) = 1;\n nd = dim;\nend\n\n%\n% Check complex flag\n%\n\nif nargin < 3 || isempty( iscplx ),\n iscplx = false;\nelseif length( iscplx ) ~= 1,\n error( 'Third argument must be a scalar.' );\nelse\n iscplx = logical( iscplx );\nend\n\n%\n% Build the cvx module\n%\n\nif iscplx,\n sx( dim ) = 2 * sx( dim );\nend\n\nif any( sx == 0 ),\n cvx_optpnt.x = cvx( sx, [] );\n sx( dim ) = 1;\n cvx_optpnt.y = nonnegative( sx );\n cvx_optpnt.z = nonnegative( sx );\nelseif sx( dim ) == 1,\n cone = semidefinite( [ 2, 2, sx ] );\n cvx_optpnt.x = reshape( cone( 2, 1, : ), sx );\n cvx_optpnt.y = reshape( cone( 1, 1, : ), sx );\n cvx_optpnt.z = reshape( cone( 2, 2, : ), sx );\nelse\n sx( dim ) = sx( dim ) + 1;\n cone = lorentz( sx, dim );\n ndxs = cell( 1, nd );\n [ ndxs{:} ] = deal( ':' );\n ndxs{ dim } = 1 : sx( dim ) - 1;\n cvx_optpnt.x = cone.x( ndxs{:} );\n ndxs{ dim } = sx( dim );\n temp = cone.x( ndxs{:} );\n cvx_optpnt.y = cone.y + temp;\n cvx_optpnt.z = cone.y - temp;\nend\n\nif iscplx,\n cvx_optpnt.x = cvx_r2c( cvx_optpnt.x, dim );\nend\n\ncvx_optpnt = cvxtuple( cvx_optpnt );\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/sets/semidefinite.m", "content": "function cvx_optpnt = semidefinite( sz, iscplx ) %#ok\n\n%SEMIDEFINITE Real symmetric positive semidefinite matrices.\n% SEMIDEFINITE(N), where N is an integer, creates a symmetric matrix\n% variable of size [N,N] and constrains it to be positive semidefinite.\n% Therefore, given the declaration\n% variable x(n,n) symmetric\n% the constraint\n% x == semidefinite(n)\n% is equivalent to\n% lambda_min(x) >= 0;\n% In fact, lambda_min is implemented in CVX using SEMIDEFINITE for\n% real matrices.\n%\n% SEMIDEFINITE(SX), where SX is a valid size vector, creates an array\n% variable of size SX and constrains each subarray along the leading two\n% dimensions to be positive semidefinite. SX(1) and SX(2) must be equal.\n% Therefore, given the declaration\n% variable x(sx) symmetric\n% the constraint\n% x == semidefinite(sx)\n% is equivalent to\n% for k = 1:prod(sx(3:end)),\n% lambda_min(x(:,:,k)) >= 0;\n% end\n%\n% SEMIDEFINITE(N,CPLX) and SEMIDEFINITE(SX,CPLX) create real semidefinite\n% sets if CPLX is FALSE, and complex Hermitian semidefinite sets if CPLX\n% is TRUE. The latter case is equivalent to calling the function\n% HERMITIAN_SEMIDEFINITE.\n%\n% Disciplined convex programming information:\n% SEMIDEFINITE is a cvx set specification. See the user guide for\n% details on how to use sets.\n\n%\n% Check size vector\n%\n\nnarginchk(1,2);\nif ~isnumeric( sz ) || isempty( sz ) || any( sz < 0 ) || any( sz ~= floor( sz ) ),\n error( 'First argument must be a nonnegative integer or a valid size vector.' );\nelseif length( sz ) == 1,\n sz = [ sz, sz ];\nelseif sz( 1 ) ~= sz( 2 ),\n error( 'If a size vector is supplied, the first two dimensions must be equal.' );\nend\n\n%\n% Check iscplx flag\n%\n\nif nargin < 2,\n iscplx = false;\nelseif ( ~isnumeric( iscplx ) && ~islogical( iscplx ) ) || length( iscplx ) ~= 1,\n error( 'Second argument must be a numeric or logical scalar.' );\nend\n\n%\n% Construct the cone\n%\n\ncvx_begin set\n if any( sz == 0 ) || sz(1) == 1,\n variable x( sz )\n s = 'nonnegative';\n elseif iscplx,\n variable x( sz ) hermitian\n s = 'hermitian-semidefinite';\n else\n variable x( sz ) symmetric\n s = 'semidefinite';\n end\n if all( sz ),\n tx = find( any( cvx_basis( x ), 2 ) );\n nv = prod( sz( 3 : end ) );\n tx = reshape( tx, numel( tx ) / nv, nv );\n newnonl( cvx_problem, s, tx );\n if sz(1) > 1,\n if iscplx,\n ndxs = cumsum( [ 1, 2*sz(1)-1 : -2 : 3 ] );\n else\n ndxs = cumsum( [ 1, sz(1) : -1 : 2 ] );\n end\n tx( ndxs, : ) = [];\n cvx___.canslack( tx ) = false;\n end\n end\ncvx_end\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/sets/simplex.m", "content": "function cvx_optpnt = simplex( sx, dim ) %#ok\n\n%SIMPLEX The unit simplex.\n% SIMPLEX(N), where N is a positive integer, creates a column vector\n% variable of length N whose elements are constrained to be nonnegative\n% and whose sum is constrained to be one. That is, given the declaration\n% variable x(n)\n% the constraint\n% x == simplex(n)\n% is equivalent to\n% x >= 0;\n% sum(x) == 1;\n%\n% SIMPLEX(SX,DIM), where SX is a valid non-empty size vector, creates a\n% CVX array variable of size SX and DIM is a positive integer, creates\n% a CVX array of size SX and applies the simplex constraint along the\n% dimension DIM. That is, given the declaration\n% variable x(sx)\n% the constraint\n% x == simplex(sx,dim)\n% is equivalent to\n% x >= 0;\n% sum(sx,dim) == 1;\n% If DIM is not supplied, then the first non-singleton dimension of SX\n% will be chosen.\n%\n% Disciplined convex programming information:\n% SIMPLEX is a cvx set specification. See the user guide for\n% details on how to use sets.\n\n%\n% Check size vector\n%\n\nnarginchk(1,2);\n[ temp, sx ] = cvx_check_dimlist( sx, false );\nif ~temp,\n error( 'First argument must be a dimension vector.' );\nend\nnd = length( sx );\n\n%\n% Check dimension\n%\n\nif nargin < 2 || isempty( dim ),\n dim = [ find( sx > 1 ), 1 ];\n dim = dim( 1 );\nelseif ~isnumeric( dim ) || dim < 0 || dim ~= floor( dim ),\n error( 'Second argument must be a dimension.' );\nelseif dim > nd,\n sx( end + 1 : dim ) = 1; %#ok\n nd = dim; %#ok\nend\n\n%\n% Construct set\n%\n\ncvx_begin set\n variables x( sx )\n sum( x, dim ) == 1; %#ok\n x >= 0; %#ok\ncvx_end\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/shims/cvx_glpk.m", "content": "function shim = cvx_glpk( shim )\n\n% CVX_SOLVER_SHIM\tGLPK interface for CVX.\n% This procedure returns a 'shim': a structure containing the necessary\n% information CVX needs to use this solver in its modeling framework.\n\nif ~isempty( shim.solve ),\n return\nend\nif isempty( shim.name ),\n fname = 'glpk.m';\n ps = pathsep;\n shim.name = 'GLPK';\n shim.dualize = true;\n flen = length(fname);\n fpaths = which( fname, '-all' );\n if ~iscell(fpaths),\n fpaths = { fpaths };\n end\n old_dir = pwd;\n oshim = shim;\n shim = [];\n for k = 1 : length(fpaths),\n fpath = fpaths{k};\n if ~exist( fpath, 'file' ) || any( strcmp( fpath, fpaths(1:k-1) ) ),\n continue\n end\n new_dir = fpath(1:end-flen-1);\n cd( new_dir );\n tshim = oshim;\n tshim.fullpath = fpath;\n tshim.version = 'unknown';\n tshim.location = new_dir;\n if isempty( tshim.error ),\n tshim.check = @check;\n tshim.solve = @solve;\n tshim.eargs = {};\n if k ~= 1,\n tshim.path = [ new_dir, ps ];\n end\n end\n shim = [ shim, tshim ]; %#ok\n end\n cd( old_dir );\n if isempty( shim ),\n shim = oshim;\n shim.error = 'Could not find a GLPK installation.';\n end\nelse\n shim.check = @check;\n shim.solve = @solve;\nend\n \nfunction found_bad = check( nonls ) %#ok\nfound_bad = false;\n\nfunction [ x, status, tol, iters, y, z ] = solve( At, b, c, nonls, quiet, prec, settings )\n\nn = length( c );\nm = length( b );\nlb = -Inf(n,1);\nub = +Inf(n,1);\nvtype = 'C';\nvtype = vtype(ones(n,1));\nctype = 'S';\nctype = ctype(ones(m,1));\nrr = zeros(0,1);\ncc = rr; \nvv = rr;\nzinv = rr;\nis_ip = false;\nfor k = 1 : length( nonls ),\n temp = nonls( k ).indices;\n nn = size( temp, 1 );\n nv = size( temp, 2 );\n tt = nonls( k ).type;\n if strncmp( tt, 'i_', 2 ),\n is_ip = true;\n vartype(temp) = 'I';\n if strcmp(tt,'i_binary'),\n lb(temp) = 0;\n ub(temp) = 1;\n end\n elseif nn == 1 || isequal( tt, 'nonnegative' ),\n lb(temp) = 0;\n elseif isequal( tt, 'lorentz' ),\n if nn == 2,\n rr2 = [ temp ; temp ];\n cc2 = reshape( floor( 1 : 0.5 : 2 * nv + 0.5 ), 4, nv );\n vv2 = [1;1;-1;1]; vv = vv(:,ones(1,nv));\n rr = [ rr ; rr(:) ];\n cc = [ cc ; cc(:) ];\n vv = [ vv ; vv(:) ];\n zinv = [ zinv ; temp(:) ];\n else\n error('GLPK does not support nonlinear constraints.' );\n end\n else\n error('GLPK does not support nonlinear constraints.' );\n end\nend\nif ~isempty(rr),\n znorm = [1:n]';\n znorm(zinv) = [];\n rr = [ rr ; znorm ];\n cc = [ cc ; znorm ];\n vv = [ vv ; ones(size(znorm)) ];\n reord = sparse( rr, cc, vv, n, n );\n At = reord' * At;\n c = reord' * c;\nend\nif quiet,\n param.msglev = 0;\nelse\n param.msglev = 2;\nend\nparam.scale = 128;\nparam.tolbnd = prec(1);\nparam.toldj = prec(1);\nparam.tolobj = prec(1);\n[ xx, fmin, errnum, extra ] = cvx_run_solver( @glpk, c, At', b, lb, ub, ctype, vtype, 1, param, 'xx', 'fmin', 'errnum', 'extra', settings, 9 );\ntol = [];\niters = [];\nx = full( xx );\ny = full( extra.lambda );\nz = full( extra.redcosts );\nif ~isempty( rr ),\n x = reord * x;\n z = reord * z;\n z(zinv) = z(zinv) * 0.5;\nend\nstatus = 'Failed';\nswitch errnum,\ncase 0,\n switch extra.status,\n case 2,\n if is_ip,\n status = 'Suboptimal';\n elseif errnumn == 0,\n status = 'Solved';\n else\n status = 'Inaccurate/Solved';\n end \n case {3,4},\n status = 'Infeasible';\n case 5,\n status = 'Solved';\n case 6,\n status = 'Unbounded';\n end\ncase 10,\n status = 'Infeasible';\ncase 11,\n status = 'Unbounded';\ncase {5,17,15,19}\n status = 'Failed';\ncase {6,7,8,9,13,14},\n switch extra.status,\n case {2,5}\n if is_ip,\n status = 'Suboptimal';\n else\n status = 'Inaccurate/Solved';\n end \n case { 3,4 },\n status = 'Inaccurate/Infeasible';\n case 6,\n status = 'Inaccurate/Unbounded';\n end\nend\nif strcmp(status,'Failed'),\n tol = Inf;\nelseif strncmp(status,'Inaccurate/',11),\n tol = prec(3);\nelse\n tol = prec(2);\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/shims/cvx_sdpt3.m", "content": "function shim = cvx_sdpt3( shim )\n\n% CVX_SOLVER_SHIM\tSDPT3 interface for CVX.\n% This procedure returns a 'shim': a structure containing the necessary\n% information CVX needs to use this solver in its modeling framework.\n\nglobal cvx___\nif ~isempty( shim.solve ),\n return\nend\nif isempty( shim.name ),\n fname = 'sdpt3.m';\n ps = cvx___.ps;\n fs = cvx___.fs;\n int_path = [ cvx___.where, fs ];\n int_plen = length( int_path );\n shim.name = 'SDPT3';\n shim.dualize = true;\n flen = length(fname);\n fpaths = { [ int_path, 'sdpt3', fs, fname ] };\n fpaths = [ fpaths ; which( fname, '-all' ) ];\n old_dir = pwd;\n oshim = shim;\n shim = [];\n for k = 1 : length(fpaths),\n fpath = fpaths{k};\n if ~exist( fpath, 'file' ) || any( strcmp( fpath, fpaths(1:k-1) ) ),\n continue\n end\n new_dir = fpath(1:end-flen-1);\n cd( new_dir );\n tshim = oshim;\n tshim.fullpath = fpath;\n tshim.version = 'unknown';\n is_internal = strncmp( new_dir, int_path, int_plen );\n if is_internal,\n tshim.location = [ '{cvx}', new_dir(int_plen:end) ];\n else\n tshim.location = new_dir;\n end\n try\n fid = fopen(fname);\n otp = fread(fid,Inf,'uint8=>char')';\n fclose(fid);\n catch errmsg\n tshim.error = sprintf( 'Unexpected error:\\n%s\\n', errmsg.message );\n end\n if isempty( tshim.error ),\n otp = regexp( otp, 'SDPT3: version \\d+\\.\\d+', 'match' );\n if ~isempty(otp), tshim.version = otp{1}(16:end); end\n if k ~= 2,\n tpath = { new_dir, [ new_dir, fs, 'Solver' ], [ new_dir, fs, 'HSDSolver' ], [ new_dir, fs, 'Solver', fs, 'Mexfun' ] };\n if ~isempty(cvx___.msub) && exist( [ tpath{end}, fs, cvx___.msub ], 'dir' ),\n tpath{end} = [ tpath{end}, fs, cvx___.msub ];\n end\n tpath = sprintf( [ '%s', ps ], tpath{:} ) ;\n tshim.path = tpath;\n end\n tshim.check = @check;\n tshim.solve = @solve;\n tshim.eargs = {};\n end\n shim = [ shim, tshim ]; %#ok\n end\n cd( old_dir );\n if isempty( shim ),\n shim = oshim;\n shim.error = 'Could not find a SDPT3 installation.';\n end\nelse\n shim.check = @check;\n shim.solve = @solve;\n shim.eargs = {};\nend\n\nfunction found_bad = check( nonls ) %#ok\nfound_bad = false;\n\nfunction [ x, status, tol, iters, y, z ] = solve( At, b, c, nonls, quiet, prec, settings )\n[n,m] = size(At);\n\n% SDPT3 cannot handle empty equality constraints or square systems. So\n% add an extra row or column, as needed, to rectify this problem.\n\nmzero = m == 0 | isempty( nonls ) | m == n;\nif mzero, \n n = n + 1;\n c = [ c ; 0 ];\n if m == 0,\n azero = true;\n At = sparse( n, 1, 1 );\n b = 1;\n m = 1;\n elseif m + 1 < n,\n azero = true;\n At(end+1,end+1) = 1;\n b(end+1) = 1;\n m = m + 1;\n else\n At(end+1,end) = 0;\n azero = false;\n end\n nonls(end+1).type = 'nonnegative';\n nonls(end).indices = n;\nelse\n azero = false;\nend\n\ntypes = { nonls.type };\nindices = { nonls.indices };\nfound = false(1,length(types));\nused = false(1,n);\n\nblk = cell( 0, 2 );\nAvec = cell( 0, 1 );\nCvec = cell( 0, 1 );\nxvec = cell( 0, 1 );\ntvec = cell( 0, 1 );\nif nargout > 3,\n need_z = true;\n zvec = cell( 0, 1 );\nelse\n need_z = false;\nend\n\n%\n% Reject integer variables\n%\n\nif any( strncmp( types, 'i_', 2 ) ),\n error( 'SDTP3 does not support integer variables.' );\nend\n\n%\n% Nonnegative variables preserved as-is\n%\n\ntt = find( strcmp( types, 'nonnegative' ) );\nif ~isempty( tt ),\n for k = tt,\n ti = indices{k};\n indices{k} = reshape(ti,1,numel(ti));\n end\n ti = cat( 2, indices{tt} );\n ni = length(ti);\n blk {end+1,1} = 'l';\n blk {end, 2} = ni;\n Avec{end+1,1} = At(ti,:);\n Cvec{end+1,1} = c(ti);\n tvec{end+1,1} = ti;\n xvec{end+1,1} = 1;\n if need_z,\n zvec{end+1,1} = 1;\n end\n found(tt) = true;\n used(ti) = true;\nend\n\n%\n% SDTP3 places the epigraph variable of an SOC { (x,y) | ||x||<=y }\n% at the beginning of the vector; CVX places it at the end. So we must \n% reverse our ordering here.\n%\n\ntt = find( strcmp( types, 'lorentz' ) );\nif ~isempty( tt ),\n blk{end+1,1} = 'q';\n blk{end,2} = zeros(1,0);\n for k = tt,\n ti = indices{k};\n ti = ti([end,1:end-1],:);\n blk{end,2} = [ blk{end,2}, size(ti,1) * ones(1,size(ti,2)) ];\n indices{k} = reshape(ti,1,numel(ti));\n end\n ti = cat( 2, indices{tt} );\n Avec{end+1,1} = At(ti,:);\n Cvec{end+1,1} = c(ti);\n tvec{end+1,1} = ti;\n xvec{end+1,1} = 1;\n if need_z,\n zvec{end+1,1} = 1;\n end\n found(tt) = true;\n used(ti) = true;\nend\n\ntt = find( strcmp( types, 'semidefinite' ) | strcmp( types, 'hermitian-semidefinite' ) );\nif ~isempty( tt ),\n blk{end+1,1} = 's';\n blk{end,2} = {};\n Avec{end+1,1} = {};\n Cvec{end+1,1} = {};\n tvec{end+1,1} = {};\n xvec{end+1,1} = {};\n if need_z,\n zvec{end+1,1} = {};\n end\n nnn = 0;\n for k = tt,\n ti = indices{k};\n [nt,nv] = size(ti);\n if types{k}(1) == 's',\n nn = 0.5*(sqrt(8*nt+1)-1);\n else\n nn = 2*sqrt(nt);\n end\n nnn = nnn + nn*nv;\n end\n for k = tt,\n ti = indices{k};\n [nt,nv] = size(ti);\n if types{k}(1) == 's',\n nn = 0.5 * ( sqrt(8*nt+1) - 1 );\n nt2 = nt;\n n2 = nn;\n else\n nn = sqrt(nt);\n n2 = 2 * nn;\n nt2 = 0.5 * n2 * ( n2 + 1 );\n end\n blk{end,2}{end+1} = n2 * ones(1,nv);\n tvec{end}{end+1} = ti(:);\n \n if types{k}(1) == 's',\n \n %\n % CVX stores symmetric matrix variables in packed lower triangle\n % form; and str_1 is the adjoint of the mapping from packed form to\n % unpacked form. That is, if x is an n(n+1)/2 by 1 vector, then\n % str_1' * x is the n x n symmetric matrix. To preserve inner\n % products we need the inverse operator as well:\n % = = \n %\n\n str_1 = cvx_create_structure( [nn,nn], 'symmetric' );\n \n else\n \n %\n % SDPT3 does not do complex SDP natively. To convert to real SDPs\n % there are two approaches;\n % X >= 0 <==> [ real(X), -imag(X) ; imag(X), real(X) ] >= 0\n % X >= 0 <==> exists [ Y1, Y2^T ; Y2, Y3 ] >= 0 s.t.\n % Y1 + Y3 == real(X), Y2 - Y2^T == imag(X)\n % For primal standard form, this second form is the best choice,\n % and what we end up using here.\n %\n \n str_1 = cvx_create_structure( [nn,nn], 'hermitian' );\n [rr,cr,vr] = find(real(str_1));\n cr = cr + floor((cr-1)/nn)*nn;\n [ri,ci,vi] = find(imag(str_1));\n ci = ci + floor((ci-1)/nn)*nn;\n str_1 = sparse( [rr;ri;ri;rr], [cr;ci+nn;ci+n2*nn;cr+nn*(n2+1)], [vr;vi;-vi;vr], nt, n2^2 );\n \n end\n str_2 = cvx_invert_structure( str_1 );\n \n %\n % SDPT3, on the other hand, stores symmetric matrix variables in\n % packed upper triangle format, with off-diagonal elements scaled \n % by sqrt(2) to preserve inner products. The operator is unitary:\n % = \n %\n \n str_3 = sqrt(0.5) * ones(nt2,1); str_3(cumsum(1:n2)) = 1;\n str_3 = spdiags( str_3, 0, nt2, nt2 ) * cvx_s_symmetric_ut( n2, n2, true );\n Avec{end}{end+1} = reshape( ( str_3 * str_2 ) * reshape( At(ti,:), nt, nv * m ), nt2 * nv, m );\n \n %\n % SDPT3 expects C to be in the form of a symmetric matrix, so we\n % only need to do half the work.\n % == \n %\n \n cc = reshape( str_2 * reshape( c(ti,:), nt, nv ), n2, n2 * nv );\n if nv > 1,\n % For multiple matrices, SDPT3 expects the blocks to be stacked\n % along the diagonal, but our calculation above stacks them into\n % a single row. A simple row offset fixes this.\n [ rr, cc, vv ] = find( cc );\n cc = sparse( rr + floor((cc-1)/n2)*n2, cc, vv, n2 * nv, n2 * nv );\n end\n Cvec{end}{end+1} = cc;\n \n %\n % SDPT3 presents X in symmetric form. We must extract the lower\n % triangle for CVX. No scaling is needed. For multiple blocks we\n % must add row offsets to handle the block diagonal form.\n %\n \n [ rr, cc, vv ] = find( str_2' );\n cc = cc + floor((cc-1)/n2)*(nnn-n2);\n if nv > 1,\n ov = ones(1,nv); sv = 0:nv-1;\n or = ones(length(rr),1);\n rr = rr(:,ov) + or*(sv*nt);\n cc = cc(:,ov) + or*(sv*(n2*(nnn+1)));\n vv = vv(:,ov);\n end\n xvec{end}{end+1} = sparse( cc, rr, vv, n2*nv*(nnn+1), nt*nv );\n if need_z,\n [ rr, cc, vv ] = find( str_1 );\n cc = cc + floor((cc-1)/n2)*(nnn-n2);\n if nv > 1,\n ov = ones(1,nv); sv = 0:nv-1;\n or = ones(length(rr),1);\n rr = rr(:,ov) + or*(sv*nt);\n cc = cc(:,ov) + or*(sv*(n2*(nnn+1)));\n vv = vv(:,ov);\n end\n zvec{end}{end+1} = sparse( cc, rr, vv, n2*nv*(nnn+1), nt*nv );\n end\n used(ti) = true;\n end\n blk{end,2} = horzcat( blk{end,2}{:} );\n Avec{end} = vertcat( Avec{end}{:} );\n Cvec{end} = cvx_blkdiag( Cvec{end}{:} );\n tvec{end} = vertcat( tvec{end}{:} );\n xvec{end} = cvx_blkdiag( xvec{end}{:} );\n xvec{end}(nnn*nnn+1:end,:) = [];\n if need_z,\n zvec{end} = cvx_blkdiag( zvec{end}{:} );\n zvec{end}(nnn*nnn+1:end,:) = [];\n end\n found(tt) = true;\nend\n\nti = find(~found);\nif ~isempty(ti),\n types = unique( types(ti) );\n types = sprintf( ' %s', types{:} );\n error( 'One or more unsupported nonlinearities detected: %s', types );\nend\n\nti = find(~used);\nif ~isempty(ti),\n ni = numel(ti);\n ti = reshape( ti, 1, ni );\n blk {end+1,1} = 'u';\n blk {end, 2} = ni;\n Avec{end+1,1} = At(ti,:);\n Cvec{end+1,1} = c(ti);\n tvec{end+1,1} = ti;\n xvec{end+1,1} = 1;\n if need_z,\n zvec{end+1,1} = 1;\n end\n % found(tt) = true;\n % used(ti) = true;\nend\n\n%\n% Call SDPT3\n%\n\nb = full(b);\nOPTIONS = sqlparameters;\nOPTIONS.gaptol = prec(1);\nOPTIONS.printlevel = 3 * ~quiet;\nwarn_save = warning;\n[ obj, xx, y, zz, info ] = cvx_run_solver( @sqlp, blk, Avec, Cvec, b, OPTIONS, 'obj', 'x', 'y', 'z', 'info', settings, 5 ); %#ok\nwarning( warn_save );\ntol = max( [ info.relgap, info.pinfeas, info.dinfeas ] );\nif ~quiet, disp(' '); end\n\n%\n% Interpret status codes\n%\n\nx_good = true;\ny_good = true;\nswitch info.termcode,\n case 0, \n status = 'Solved';\n tol = min( prec(2), tol );\n case 1,\n status = 'Infeasible';\n x_good = false;\n tol = min( info.dinfeas, prec(2) );\n case 2,\n status = 'Unbounded';\n y_good = false;\n tol = min( info.pinfeas, prec(2) );\n otherwise,\n if isnan(tol),\n tol = Inf;\n status = 'Failed';\n elseif tol > prec(3),\n status = 'Failed';\n elseif tol <= prec(2),\n status = 'Solved';\n info.termcode = 0;\n else\n status = 'Inaccurate/Solved';\n info.termcode = 0;\n end\nend\n\n% Primal point\n\nif x_good,\n x = zeros(1,n);\n for k = 1 : length(xx),\n x(1,tvec{k}) = x(1,tvec{k}) + xx{k}(:)' * xvec{k};\n end\nend\nif x_good && all(isfinite(x)),\n x = full( x )';\nelse\n x = NaN * ones(n,1);\nend\nif mzero,\n x(end) = [];\nend\n\n% Lagrange multipliers\n\nif y_good,\n y = full(y);\nend\nif ~y_good || ~all(isfinite(y)),\n y = NaN * ones(m,1);\nend\nif azero,\n y(end,:) = [];\nend\n\n% Iteration count\n\niters = info.iter;\n\n% Dual cone\n\nif need_z,\n if y_good,\n z = zeros(1,n);\n for k = 1 : length(zz),\n z(1,tvec{k}) = z(1,tvec{k}) + zz{k}(:)' * zvec{k};\n end\n end\n if y_good && all(isfinite(z)),\n z = full( z )';\n else\n z = NaN * ones(n,1);\n end\n if mzero,\n z(end) = [];\n end\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/shims/cvx_sedumi.m", "content": "function shim = cvx_sedumi( shim )\n\n% CVX_SOLVER_SHIM\tSeDuMi interface for CVX.\n% This procedure returns a 'shim': a structure containing the necessary\n% information CVX needs to use this solver in its modeling framework.\n\nglobal cvx___\nif ~isempty( shim.solve ),\n return\nend\nif isempty( shim.name ),\n fname = 'sedumi.m';\n fs = cvx___.fs;\n ps = cvx___.ps;\n int_path = [ cvx___.where, fs ];\n int_plen = length( int_path );\n shim.name = 'SeDuMi';\n shim.dualize = true;\n flen = length(fname);\n fpaths = { [ int_path, 'sedumi', fs, fname ] };\n fpaths = [ fpaths ; which( fname, '-all' ) ];\n old_dir = pwd;\n oshim = shim;\n shim = [];\n for k = 1 : length(fpaths),\n fpath = fpaths{k};\n if ~exist( fpath, 'file' ) || any( strcmp( fpath, fpaths(1:k-1) ) ),\n continue\n end\n new_dir = fpath(1:end-flen-1);\n cd( new_dir );\n tshim = oshim;\n tshim.fullpath = fpath;\n tshim.version = 'unknown';\n is_internal = strncmp( new_dir, int_path, int_plen );\n if is_internal,\n tshim.location = [ '{cvx}', new_dir(int_plen:end) ];\n else\n tshim.location = new_dir;\n end\n try\n fid = fopen(fname);\n otp = fread(fid,Inf,'uint8=>char')';\n fclose(fid);\n catch errmsg\n tshim.error = sprintf( 'Unexpected error:\\n%s\\n', errmsg.message );\n end\n if isempty( tshim.error ),\n otp = regexp( otp, 'SeDuMi \\d\\S+', 'match' );\n if ~isempty(otp), tshim.version = otp{end}(8:end); end\n vnum = str2double( tshim.version );\n tshim.check = @check;\n tshim.solve = @solve;\n tshim.eargs = { vnum >= 1.3 && vnum < 1.32 };\n if k ~= 2,\n tshim.path = [ new_dir, ps ];\n if ~isempty(cvx___.msub) && exist([new_dir,fs,cvx___.msub],'dir'),\n tshim.path = [ new_dir, fs, cvx___.msub, ps, tshim.path ];\n end\n end\n end\n shim = [ shim, tshim ]; %#ok\n end\n cd( old_dir );\n if isempty( shim ),\n shim = oshim;\n shim.error = 'Could not find a SeDuMi installation.';\n end\nelse\n shim.check = @check;\n shim.solve = @solve;\n vnum = str2double( shim.version );\n shim.eargs = { vnum >= 1.3 && vnum < 1.32 };\nend\n \nfunction found_bad = check( nonls ) %#ok\nfound_bad = false;\n\nfunction [ x, status, tol, iters, y, z ] = solve( At, b, c, nonls, quiet, prec, settings, nocplx )\n\nn = length( c );\nm = length( b );\nK = struct( 'f', 0, 'l', 0, 'q', [], 'r', [], 's', [], 'scomplex', [], 'ycomplex', [] );\nreord = struct( 'n', 0, 'r', [], 'c', [], 'v', [] );\nreord = struct( 'f', reord, 'l', reord, 'a', reord, 'q', reord, 'r', reord, 's', reord, 'h', reord );\nreord.f.n = n;\nzinv = [];\nfor k = 1 : length( nonls ),\n temp = nonls( k ).indices;\n nn = size( temp, 1 );\n nv = size( temp, 2 );\n nnv = nn * nv;\n tt = nonls( k ).type;\n reord.f.n = reord.f.n - nnv;\n if strncmp( tt, 'i_', 2 ),\n error( 'SeDuMi does not support integer variables.' );\n elseif nn == 1 || isequal( tt, 'nonnegative' ),\n reord.l.r = [ reord.l.r ; temp(:) ];\n reord.l.c = [ reord.l.c ; reord.l.n + ( 1 : nnv )' ];\n reord.l.v = [ reord.l.v ; ones( nnv, 1 ) ];\n reord.l.n = reord.l.n + nnv;\n elseif isequal( tt, 'lorentz' ),\n if nn == 2,\n rr = [ temp ; temp ];\n cc = reshape( floor( 1 : 0.5 : 2 * nv + 0.5 ), 4, nv );\n vv = [1;1;-1;1]; vv = vv(:,ones(1,nv));\n reord.a.r = [ reord.a.r ; rr(:) ];\n reord.a.c = [ reord.a.c ; cc(:) + reord.a.n ];\n reord.a.v = [ reord.a.v ; vv(:) ];\n reord.a.n = reord.a.n + nnv;\n zinv = [ zinv ; temp(:) ]; %#ok\n else\n temp = temp( [ end, 1 : end - 1 ], : );\n reord.q.r = [ reord.q.r ; temp(:) ];\n reord.q.c = [ reord.q.c ; reord.q.n + ( 1 : nnv )' ];\n reord.q.v = [ reord.q.v ; ones(nnv,1) ];\n reord.q.n = reord.q.n + nnv;\n K.q = [ K.q, nn * ones( 1, nv ) ];\n end\n elseif isequal( tt, 'semidefinite' ),\n if nn == 3,\n temp = temp( [1,3,2], : );\n tempv = [sqrt(2);sqrt(2);1] * ones(1,nv);\n reord.r.r = [ reord.r.r ; temp(:) ];\n reord.r.c = [ reord.r.c ; reord.r.n + ( 1 : nnv )' ];\n reord.r.v = [ reord.r.v ; tempv(:) ];\n reord.r.n = reord.r.n + nnv;\n K.r = [ K.r, 3 * ones( 1, nv ) ];\n temp = temp(1:2,:);\n zinv = [ zinv ; temp(:) ]; %#ok\n else\n nn = 0.5 * ( sqrt( 8 * nn + 1 ) - 1 );\n str = cvx_create_structure( [ nn, nn, nv ], 'symmetric' );\n K.s = [ K.s, nn * ones( 1, nv ) ];\n [ cc, rr, vv ] = find( cvx_invert_structure( str, 'compact' ) );\n rr = temp( rr );\n reord.s.r = [ reord.s.r; rr( : ) ];\n reord.s.c = [ reord.s.c; cc( : ) + reord.s.n ];\n reord.s.v = [ reord.s.v; vv( : ) ];\n reord.s.n = reord.s.n + nn * nn * nv;\n reord.s.z = reord.s.v;\n end\n elseif isequal( tt, 'hermitian-semidefinite' ),\n if nn == 4,\n temp = temp( [1,4,2,3], : );\n tempv = [sqrt(2);sqrt(2);1;1] * ones(1,nv);\n reord.r.r = [ reord.r.r ; temp(:) ];\n reord.r.c = [ reord.r.c ; reord.r.n + ( 1 : nnv )' ];\n reord.r.v = [ reord.r.v ; tempv(:) ];\n reord.r.n = reord.r.n + nnv;\n reord.r.z = reord.r.v;\n K.r = [ K.r, 4 * ones( 1, nv ) ];\n temp = temp(1:2,:);\n zinv = [ zinv ; temp(:) ]; %#ok\n elseif nocplx,\n % SeDuMi's complex SDP support was broken with the 1.3 update. So\n % we must use the following complex-to-real SDP conversion to work\n % around it, at a modest cost of problem size.\n % X >= 0 <==> exists [ Y1, Y2^T ; Y2, Y3 ] >= 0 s.t.\n % Y1 + Y3 == real(X), Y2 - Y2^T == imag(X)\n nsq = nn; nn = sqrt( nn );\n str = cvx_create_structure( [ nn, nn, nv ], 'hermitian' );\n [ cc, rr, vv ] = find( cvx_invert_structure( str, 'compact' ) );\n cc = cc - 1;\n mm = floor( cc / nsq );\n cc = cc - mm * nsq;\n jj = floor( cc / nn );\n ii = cc - jj * nn + 1;\n jj = jj + 1;\n mm = mm + 1;\n vr = real( vv );\n vi = imag( vv );\n ii = [ ii + nn * ~vr ; ii + nn * ~vi ];\n jj = [ jj ; jj + nn ]; %#ok\n vv = sqrt( 0.5 ) * [ vr + vi ; vr - vi ];\n rr = [ rr ; rr ]; %#ok\n mm = [ mm ; mm ]; %#ok\n [ jj, ii ] = deal( min( ii, jj ), max( ii, jj ) );\n cc = ii + ( jj - 1 ) * ( 2 * nn ) + ( mm - 1 ) * ( 4 * nsq );\n K.s = [ K.s, 2 * nn * ones( 1, nv ) ];\n rr = temp( rr );\n reord.s.r = [ reord.s.r; rr( : ) ];\n reord.s.c = [ reord.s.c; cc( : ) + reord.s.n ];\n reord.s.v = [ reord.s.v; vv( : ) ];\n reord.s.n = reord.s.n + 4 * nsq * nv;\n reord.s.z = reord.s.v;\n else\n % SeDuMi's complex SDP support was restored in v1.33.\n K.scomplex = [ K.scomplex, length( K.s ) + ( 1 : nv ) ];\n nn = sqrt( nn );\n str = cvx_create_structure( [ nn, nn, nv ], 'hermitian' );\n K.s = [ K.s, nn * ones( 1, nv ) ];\n stri = cvx_invert_structure( str, 'compact' )';\n [ rr, cc, vv ] = find( stri );\n rr = temp( rr );\n reord.s.r = [ reord.s.r; rr( : ) ];\n reord.s.c = [ reord.s.c; cc( : ) + reord.s.n ];\n reord.s.v = [ reord.s.v; vv( : ) ];\n reord.s.n = reord.s.n + size( stri, 2 );\n reord.s.z = reord.s.v;\n end\n else\n error( 'Unsupported nonlinearity: %s', tt );\n end\nend\nif reord.f.n > 0,\n reord.f.r = ( 1 : n )';\n reord.f.r( [ reord.l.r ; reord.a.r ; reord.q.r ; reord.r.r ; reord.s.r ] ) = [];\n reord.f.c = ( 1 : reord.f.n )';\n reord.f.v = ones(reord.f.n,1);\nend\nn_d = max( m - n - reord.f.n + 1, isempty( At ) );\nif n_d,\n reord.l.n = reord.l.n + n_d;\nend\nK.f = reord.f.n;\nK.l = reord.l.n + reord.a.n;\nn_out = reord.f.n;\nreord.l.c = reord.l.c + n_out; n_out = n_out + reord.l.n;\nreord.a.c = reord.a.c + n_out; n_out = n_out + reord.a.n;\nreord.q.c = reord.q.c + n_out; n_out = n_out + reord.q.n;\nreord.r.c = reord.r.c + n_out; n_out = n_out + reord.r.n;\nreord.s.c = reord.s.c + n_out; n_out = n_out + reord.s.n;\nreord = sparse( ...\n [ reord.f.r ; reord.l.r ; reord.a.r ; reord.q.r ; reord.r.r ; reord.s.r ], ...\n [ reord.f.c ; reord.l.c ; reord.a.c ; reord.q.c ; reord.r.c ; reord.s.c ], ...\n [ reord.f.v ; reord.l.v ; reord.a.v ; reord.q.v ; reord.r.v ; reord.s.v ], ...\n n, n_out );\n\nAt = reord' * At;\nc = reord' * c;\npars.free = K.f > 1 && nnz( K.q );\npars.eps = prec(1);\npars.bigeps = prec(3);\nif quiet,\n pars.fid = 0;\nend\nadd_row = isempty( At );\nif add_row,\n K.f = K.f + 1;\n At = sparse( 1, 1, 1, n_out + 1, 1 );\n b = 1;\n c = [ 0 ; c ];\nend\n[ xx, yy, info ] = cvx_run_solver( @sedumi, At, b, c, K, pars, 'xx', 'yy', 'info', settings, 5 );\nif add_row,\n xx = xx(2:end);\n yy = zeros(0,1);\n At = zeros(n_out,0);\n % b = zeros(0,1);\n c = c(2:end);\nend\nif ~isfield( info, 'r0' ) && info.pinf,\n info.r0 = 0;\n info.iter = 0;\n info.numerr = 0;\nend\ntol = info.r0;\niters = info.iter;\nxx = full( xx );\nyy = full( yy );\nstatus = '';\nif info.pinf ~= 0,\n status = 'Infeasible';\n x = NaN * ones( n, 1 );\n y = yy;\n z = - real( reord * ( At * yy ) );\n if add_row, y = zeros( 0, 1 ); end\nelseif info.dinf ~= 0\n status = 'Unbounded';\n y = NaN * ones( m, 1 );\n z = NaN * ones( n, 1 );\n x = real( reord * xx );\nelse\n x = real( reord * xx );\n y = yy;\n z = real( reord * ( c - At * yy ) );\n if add_row, y = zeros( 0, 1 ); end\nend\nif ~isempty(zinv),\n z(zinv) = z(zinv) * 0.5;\nend\nif info.numerr == 2,\n status = 'Failed';\n if any( K.q == 2 ),\n warning( 'CVX:SeDuMi', cvx_error_format( 'This solver failure may possibly be due to a known bug in the SeDuMi solver. Try switching to SDPT3 by inserting \"cvx_solver sdpt3\" into your model.', ...\n [66,75], false, '' ) );\n end\nelse\n if isempty( status ),\n status = 'Solved';\n end\n if info.numerr == 1 && info.r0 > prec(2),\n status = [ 'Inaccurate/', status ];\n end\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/structures/@cvx/structures.m", "content": "% CVX: Matrix structure definitions and utilities.\n% CVX provides a keyword-based method for definiting matrices\n% with one or more types of structure; e.g.\n% variable X(n,n) symmetric toeplitz tridiagonal;\n% CVX automatically computes an efficient basis for the requested\n% structure. The files in this directory implement those computations.\n%\n% None of these files should be called directly---matrix structure is\n% selected in the VARIABLE declaration; see VARIABLE for more details.\n% Below are the keywords that are available, and the structures they\n% represent. Keywords can be freely combined (see the above example),\n% but of course some combinations are degenerate, yielding only the \n% all-zero matrix; e.g.,\n% variable X(n,n) \n%\n% Structures:\n% banded - (U,L)-banded matrices.\n% complex - Complex variables of all sizes.\n% diagonal - Diagonal matrices.\n% hankel - Hankel matrices.\n% hermitian - Complex Hermitian matrices.\n% lower_bidiagonal - Lower bidiagonal matrices.\n% lower_hessenberg - Lower Hessenberg matrices.\n% lower_triangular - Lower triangular matrices.\n% scaled_identity - Scaled identity: t*eye(n).\n% skew_symmetric - Skew-symmetric matrices.\n% sparse - Matrices with a fixed sparsity pattern.\n% symmetric - Symmetric matrices.\n% toeplitz - Toeplitz matrices.\n% tridiagonal - Tridiagional matrices.\n% upper_bidiagonal - Upper bidiagonal matrices.\n% upper_hankel - Upper Hankel matrices.\n% upper_hessenberg - Upper Hessenberg matrices.\n% upper_triangular - Upper triangular matrices.\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/structures/Contents.m", "content": "% CVX: Matrix structure definitions and utilities.\n% CVX provides a keyword-based method for definiting matrices\n% with one or more types of structure; e.g.\n% variable X(n,n) symmetric toeplitz tridiagonal;\n% CVX automatically computes an efficient basis for the requested\n% structure. The files in this directory implement those computations.\n%\n% None of these files should be called directly---matrix structure is\n% selected in the VARIABLE declaration; see VARIABLE for more details.\n% Below are the keywords that are available, and the structures they\n% represent. Keywords can be freely combined (see the above example),\n% but of course some combinations are degenerate, yielding only the \n% all-zero matrix; e.g.,\n% variable X(n,n) \n%\n% Structures:\n% banded - (U,L)-banded matrices.\n% complex - Complex variables of all sizes.\n% diagonal - Diagonal matrices.\n% hankel - Hankel matrices.\n% hermitian - Complex Hermitian matrices.\n% lower_bidiagonal - Lower bidiagonal matrices.\n% lower_hessenberg - Lower Hessenberg matrices.\n% lower_triangular - Lower triangular matrices.\n% scaled_identity - Scaled identity: t*eye(n).\n% skew_symmetric - Skew-symmetric matrices.\n% sparse - Matrices with a fixed sparsity pattern.\n% symmetric - Symmetric matrices.\n% toeplitz - Toeplitz matrices.\n% tridiagonal - Tridiagional matrices.\n% upper_bidiagonal - Upper bidiagonal matrices.\n% upper_hankel - Upper Hankel matrices.\n% upper_hessenberg - Upper Hessenberg matrices.\n% upper_triangular - Upper triangular matrices.\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/structures/cvx_create_structure.m", "content": "function [ S, itypes ] = cvx_create_structure( varargin )\n\n%CVX_CREATE_STRUCTURE Construct a basis for a structured matrix.\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% Parse the arguments, if needed %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nS = [];\nitypes = {};\nif iscell( varargin{1} ),\n orig = varargin{1};\n name = varargin{2};\n args = varargin{3};\n nargs = numel( orig );\nelse\n nargs = nargin;\n orig = varargin;\n name = orig;\n args = cell( 1, nargs );\n if ischar( varargin{1} ),\n amin = 1;\n else\n args{1} = varargin{1};\n name{1} = '';\n varargin{1} = '';\n amin = 2;\n end\n toks = regexp( varargin, '^([a-zA-Z]\\w*)(\\(.*\\))?$', 'tokens' );\n for k = amin : nargs,\n tok = toks{k};\n if isempty( tok ),\n if k == 1, type = 'Variable'; else type = 'Structure'; end\n error( sprintf('CVX:Invalid%sSpec',type), 'Invalid %s specification: %s', lower(type), varargin{k} );\n end\n tok = tok{1};\n name{k} = tok{1};\n if length(tok) > 1 && ~isempty( tok{2} ),\n try\n args{k} = evalin( 'caller', [ '{', tok{2}(2:end-1), '};' ] );\n catch exc\n error( exc.identifier, exc.message );\n end\n else\n args{k} = {};\n end\n end\nend\nif nargs == 1 && nargout > 0,\n return\nend\nsz = args{1};\nif iscell( sz ),\n sz = [ sz{:} ];\nend\nsz(end+1:2) = 1;\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% Scan the structure strings for symmetry and complex cases. We now handle %\n% these cases specially for improved performance. %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nuplo = '';\ndo_semi = 0;\ndo_skew = false;\ndo_conj = false;\ndo_comp = false;\ndo_symm = false;\nis_toep = false;\nis_hank = false;\nsflags = false(1,nargs);\nbflags = false(1,nargs);\npflags = false(1,nargs);\nswitch length(sz),\n case 0, bands = [1,1];\n case 1, bands = sz * [1,1];\n otherwise, bands = sz(1:2);\nend\nfor k = 2 : nargs,\n amin = 0; amax = 0;\n nm = lower( name{k} );\n if ~isempty(uplo),\n nm = [ uplo, '_', nm ]; %#ok\n name{k} = nm;\n orig{k} = [ uplo, '_', orig{k} ];\n uplo = '';\n end\n switch nm,\n case { 'upper', 'lower', 'skew', },\n uplo = nm;\n continue;\n case 'complex', \n do_comp = true;\n if do_semi, do_conj = true; end\n case 'symmetric',\n sflags(k) = true; do_symm = true;\n case 'symmetric_ut',\n sflags(k) = true;\n pflags(k) = true;\n case 'hermitian', \n sflags(k) = true; do_comp = true; do_symm = true; do_conj = true;\n case { 'skew_symmetric', 'skew-symmetric' },\n sflags(k) = true; do_symm = true; do_skew = true;\n case { 'skew_hermitian', 'skew-hermitian' }\n sflags(k) = true; do_comp = true; do_symm = true; do_conj = true; do_skew = true;\n case {'hankel','upper_hankel'},\n pflags(k) = true;\n sflags(k) = true;\n is_hank = true;\n case 'toeplitz',\n is_toep = true;\n case 'semidefinite',\n do_semi = k; do_symm = true;\n if do_comp, do_conj = true; end\n case 'upper_bidiagonal',\n bflags(k) = true; sflags(k) = true;\n bands = min(bands,[0,1]);\n case 'lower_bidiagonal',\n bflags(k) = true; sflags(k) = true;\n bands = min(bands,[1,0]);\n case 'upper_hessenberg',\n bflags(k) = true; sflags(k) = true;\n bands = min(bands,[1,Inf]);\n case 'lower_hessenberg',\n bflags(k) = true; sflags(k) = true;\n bands = min(bands,[Inf,1]);\n case 'upper_triangular',\n bflags(k) = true; sflags(k) = true;\n bands = min(bands,[0,Inf]);\n case 'lower_triangular',\n bflags(k) = true; sflags(k) = true;\n bands = min(bands,[Inf,0]);\n case 'diagonal',\n bflags(k) = true;\n bands = min(bands,[0,0]);\n case 'tridiagonal',\n bflags(k) = true;\n bands = min(bands,[1,1]);\n case 'scaled_identity',\n bflags(k) = true; is_toep = true;\n bands = min(bands,[0,0]);\n case 'banded',\n amin = 1; amax = 2;\n sflags(k) = length(args{k}) == 2 && ~isequal(args{k}{1},args{k}{2});\n bflags(k) = true;\n lb = args{k}{1};\n switch length(args{k}),\n case 0, error( 'CVX:InvalidStructure', 'Not enough arguments for \"banded()\" structure.' );\n case 1, ub = args{k}{1};\n case 2, ub = args{k}{2};\n otherwise, error( 'Too many arguments for \"banded()\" structure.' );\n end\n if ~isnumeric( lb ) || length( lb ) ~= 1 || lb < 0 || lb ~= floor( lb ),\n error( 'Bandwidth arguments must be nonnegative integers.' );\n elseif ~isnumeric( ub ) || length( ub ) ~= 1 || ub < 0 || ub ~= floor( ub ),\n error( 'Bandwidth arguments must be nonnegative integers.' );\n end\n bands = min(bands,[lb,ub]);\n case { 'binary', 'integer', 'nonnegative', 'epigraph_', 'hypograph_', 'geometric_', 'linear_' },\n itypes{end+1} = nm; %#ok\n otherwise,\n pflags(k) = true;\n if ~exist( [ 'cvx_s_', nm ], 'file' ),\n error( 'CVX:UnknownStructure', 'Undefined matrix structure type: %s\\nTrying to declare multiple variables? Use the VARIABLES keyword instead.', orig{k} );\n end\n end\n if length( args{k} ) < amin,\n error( 'CVX:InvalidStructure', 'Not enough arguments: %s', orig{k} );\n elseif length( args{k} ) > amax,\n error( 'CVX:InvalidStructure', 'Too many arguments: %s', orig{k} );\n end\nend\nif ~isempty(uplo),\n error( 'CVX:InvalidStructure', 'Invalid structure type: %s', orig{end} );\nend \n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% Quick exit for no structure %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nif numel( itypes ) == nargs - 1 && nargout > 0,\n return\nend\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% Verify symmetry consistency %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nif nnz(sflags) > 1 || do_semi && ( do_skew || do_comp && ~do_conj ),\n if do_semi, sflags = sflags | strcmpi( name, 'semidefinite' ); end\n error( 'CVX:InvalidStructure', 'These forms of structure may not be specified simultaneously:\\n %s', sprintf(' %s', orig{sflags} ) );\nelseif is_toep && is_hank,\n error( 'CVX:InvalidStructure', 'These forms of structure may not be specified simultaneously:\\n toeplitz hankel' );\nelseif nnz(bflags) > 1,\n error( 'CVX:InvalidStructure', 'These forms of structure may not be specified simultaneously:\\n %s', sprintf(' %s', orig{bflags} ) );\nelseif do_symm && sz(1) ~= sz(2),\n if do_semi, sflags = sflags | strcmpi( name, 'semidefinite' ); end\n error( 'CVX:InvalidStructure', 'This type of structure requires square matrices:%s', sprintf(' %s', orig{sflags} ) );\nend\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% Construct the basis matrices for the remaining structure elements %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nstrs = {};\nif is_toep || any( bands < sz(1:2) ),\n [ strs{end+1}, do_symm ] = cvx_s_banded( sz(1), sz(2), [ do_symm, is_toep ], bands(1), bands(2) );\n do_symm = do_symm(1);\nend\nfor k = 2 : nargs,\n if pflags(k),\n try\n [ strs{end+1}, do_symm ] = feval( [ 'cvx_s_', lower(name{k}) ], sz( 1 ), sz( 2 ), do_symm, args{k}{:} ); %#ok\n catch exc\n error( exc.identifier, 'Error constructing structure: %s\\n %s', orig{k}, exc.message );\n end\n end\nend\nif do_symm,\n [ strs{end+1}, do_symm ] = cvx_s_symmetric( sz(1), sz(2), do_symm ); %#ok\nend\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% If multiple structures have been requested (e.g., toeplitz and banded), %\n% combine them together by finding bases for their orthogonal complements, %\n% concatenating, and taking the orthogonal complement of that. This should %\n% be used much less frequently than before---if ever---now that we handle %\n% symmetry as a special case for improved performance. %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n \nswitch length( strs ),\n case 0,\n sz(end+1:2) = 1;\n nel = sz( 1 ) * sz( 2 );\n S = sparse( 1 : nel, 1 : nel, 1, nel, nel );\n case 1,\n S = strs{ 1 };\n otherwise,\n for k = 1 : length(strs),\n strs{k} = cvx_orthog_structure( strs{k} ); %#ok\n end\n S = cvx_orthog_structure( vertcat(strs{:}), true );\nend\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% Handle complex, skew-symmetric, and Hermitian structures. %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nif do_comp,\n S = [ S ; +1j * S ];\n S = S([1:end/2;end/2+1:end],:);\nend\nif do_skew || do_conj,\n r = (0:sz(1)-1)'; r = r(:,ones(1,sz(2)));\n c = 0:sz(2)-1; c = c(ones(1,sz(1)),:);\n ut = r < c; dg = r == c;\n if do_skew,\n S(:,ut) = - S(:,ut);\n S(:,dg) = 0;\n end\n if do_conj,\n S(:,ut) = conj(S(:,ut));\n S(:,dg) = real(S(:,dg));\n end\n S = S(any(S,2),:);\nend\nif do_semi,\n itypes{end+1} = 'semidefinite';\nend\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% Report an error of the structure is empty %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nif isempty( S ),\n error( 'CVX:InvalidStructure', 'Incompatible structure modifiers:%s', sprintf( ' %s', args.orig ) );\nend \n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% Replicate structure for N-D arrays %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nif length( sz ) > 2,\n S = cvx_replicate_structure( S, sz( 3 : end ) );\nend\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% Display the structure if called with no output arguments %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nif nargout == 0,\n [ii,jj,vv] = find( S );\n if isempty(sz), sz = [1,1]; end\n Z = reshape( full( sparse( jj, 1, ii .* vv, prod(sz), 1 ) ), sz );\n temp = sprintf( ',%d', sz );\n fprintf( '\\n%s(%s)', name{1}, temp(2:end) );\n for k = 2 : nargs,\n if any( strcmp(orig{k},itypes) )\n fprintf( ' [%s]', orig{k} );\n else\n fprintf( ' %s', orig{k} );\n end\n end\n fprintf( '\\n\\n' );\n fmt = get(0,'format');\n set(0,'format','rational');\n disp( Z );\n set(0,'format',fmt);\n clear S\nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for orig copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/structures/cvx_invert_structure.m", "content": "function xi = cvx_invert_structure( x, compact )\nglobal cvx___\nif nargin < 2, compact = false; end\n\n%CVX_INVERT_STRUCTURE Compute a right-inverse of a structure mapping.\n\nif ~isreal( x ),\n\n x = [ real(x), imag(x) ];\n x = x(:,[1:end/2;end/2+1:end]);\n if nargin < 2, compact = false; end\n xi = cvx_invert_structure( x, compact );\n xi = xi(1:2:end,:) - sqrt(-1) * xi(2:2:end,:);\n \nelseif compact,\n\n if cvx___.isoctave,\n [LL,UU,PP,QQ] = lu(x);\n LL = PP' * LL;\n UU = UU * QQ';\n else \n [LL,UU] = lu(x);\n end\n [jj,ii] = find(UU');\n dd = [true;diff(ii)~=0];\n jj = jj(dd);\n [i2,j2,vv] = find( inv(UU(:,jj)) / LL );\n [vn,vd] = rat(vv);\n xi = sparse(jj(i2),j2,vn./vd,size(x,2),size(x,1));\n \nelse\n \n xi = x'/(x*x');\n [ii,jj,vv] = find(xi);\n [vn,vd] = rat(vv);\n xi = sparse(ii,jj,vn./vd,size(x,2),size(x,1));\n \nend\n\n% Copyright 2005-2016 CVX Research, Inc.\n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/structures/cvx_orthog_structure.m", "content": "function [ xi, R ] = cvx_orthog_structure( xi, clean )\n\n%CVX_ORTHOG_STRUCTURE Constructs an orthogonal structure matrix.\n% CVX_ORTHOG_STRUCTURE(X), where X is an M x N matrix from CVX's\n% matrix structure facility, determines an orthogonal structure: that\n% is, a matrix Z of size (N-rank(X)) x N such that X * Z' = 0. Roughly\n% speaking, this computes Z = NULL(X,'r')'. However, this should not\n% be used for more general null space computations, because it does not\n% employ sufficiently general numerical safeguards.\n\n% Reduce using an LU factorization with full pivoting.\n[LL,xi,pp,qq] = lu(xi,'vector'); %#ok\n[m,n] = size(xi); %#ok\n\nxid = diag(xi);\nrr = nnz(xid);\nif nnz(any(xi,2)) == rr,\n ii = find(xid);\n jj = ii;\nelse \n % Find the locations of the leading element in each row. To do this we first\n % find the first element in each row. Transposing xi insures that the\n % indices are sorted properly to accomplish this.\n [ii,jj] = find(xi);\n [ii,indx] = sort(ii);\n dd = [true;diff(ii)~=0];\n ii = ii(dd);\n jj = jj(indx(dd));\n\n % Sort the rows so that the leftmost nonzero is first. The LU factorization\n % does this already much of the time; but in rank-degenerate cases, further\n % sorting is needed. Use this to select a full-rank triangular submatrix.\n [jj,jndx] = sort(jj);\n dd = [true;diff(jj)~=0];\n ii = ii(jndx(dd));\n jj = jj(dd);\n\n % Left-divide the full-rank submatrix xi(ii,:) by the full-rank triangle.\n % We actually only need to handle the columns not in the triangle.\n rr = length(ii);\nend\nj2 = (1:n)'; j2(jj) = [];\nQ = xi(ii,jj) \\ xi(ii,j2);\n\n% Use the RAT function to round to a nearby rational number. We know that\n% our structure compositions will always have rational results.\n[ iq, jq, vv ] = find( Q );\nif any( Q ~= round(Q) ),\n [ vn, vd ] = rat( vv );\n vv = vn ./ vd;\nend\n\n% This is the reduced row echelon form, returned for debugging purposes only\nif nargout > 1,\n R = sparse( [ (1:rr)' ; iq ], qq([ jj ; j2(jq) ]), [ ones(rr,1) ; vv ], rr, n );\nend\n\n% For a structure [ I Q ], where I is an identity matrix, the orthogonal\n% structure matrix is just [ -Q' I ]. The result of our efforts above is\n% a matrix of the form [ I Q ] with its columns scrambled, so we simply\n% need to scramble the columns of [ Q' I ] in the same way.\n\nxi = sparse( [ (1:n-rr)' ; jq ], qq([ j2 ; jj(iq) ]), [ ones(n-rr,1) ; - vv ], n - rr, n );\n\n% If we want a clean result, we need to re-sort the rows in order of their\n% first column entry.\n\nif nargin == 2 && clean,\n [ii,jj] = find(xi); \n [ii,indx] = sort(ii);\n dd = [true;diff(ii)~=0];\n ii = ii(dd);\n [jj,jndx] = sort(jj(indx(dd))); %#ok\n xi = xi(ii(jndx),:);\nend\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n\n \n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/structures/cvx_replicate_structure.m", "content": "function str = cvx_replicate_structure( str, sz )\n%CVX_REPLICATE_STRUCTURE Apply matrix structure to N-D arrays.\n\nszs = size( str );\nnmat = prod( sz );\nomat = ones( 1, nmat );\n[ r, c, v ] = find( str );\nnelm = length( r );\noelm = ones( 1, nelm );\nr = r( : );\nnvec = ( 0 : nmat - 1 ) * szs( 1 ); \nr = r( :, omat ) + nvec( oelm, : );\nc = c( : );\nc = c( :, omat );\nnvec = ( 0 : nmat - 1 ) * szs( 2 );\nc = c( :, omat ) + nvec( oelm, : );\nv = v( : );\nv = v( :, omat );\nstr = sparse( r, c, v, nmat * szs( 1 ), nmat * szs( 2 ) );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/structures/cvx_s_banded.m", "content": "function [ y, symm ] = cvx_s_banded( m, n, symm, lower, upper )\n\n%CVX_S_BANDED (U,L)-banded matrices.\n\nif nargin < 4,\n error( 'Bandwidth arguments missing.' );\nend\nif ~isnumeric( lower ) || length( lower ) ~= 1 || lower < 0 || lower ~= floor( lower ),\n error( 'Bandwidth arguments must be nonnegative integers.' );\nelseif nargin < 5, \n upper = lower;\nelseif ~isnumeric( upper ) || length( upper ) ~= 1 || upper < 0 || upper ~= floor( upper ),\n error( 'Bandwidth arguments must be nonnegative integers.' );\nend\n\nstflag = length(symm) == 2;\nif stflag,\n toep = symm(2);\n symm = symm(1);\nelse\n toep = false;\nend\n\nif symm,\n lower = min( lower, upper );\n upper = 0;\nend\n\nc = 0 : n - 1;\nc = c( ones( 1, m ), : );\nr = ( 0 : m - 1 )';\nr = r( :, ones( 1, n ) );\ntemp = r - c;\ntemp = temp <= lower & temp >= -upper;\nr = r( temp );\nc = c( temp );\nnu = length( r );\n\nif toep,\n v = r - c;\n v = abs( v ) + max( v ) * ( v < 0 ) + 1;\n nu = max( v );\n toep = false;\nelse\n v = ( 1 : nu )';\nend\n\nif symm,\n tt = r ~= c;\n r = [ r ; c(tt) ];\n c = [ c ; r(tt) ];\n v = [ v ; v(tt) ];\n symm = false;\nend\n\nif stflag,\n symm = [ symm, toep ];\nend\n\ny = sparse( v, r + m * c + 1, 1, nu, m * n );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/structures/cvx_s_hankel.m", "content": "function [ y, symm ] = cvx_s_hankel( m, n, symm )\n\n%CVX_S_HANKEL Hankel matrices.\n\nc = 0 : n - 1;\nc = c( ones( 1, m ), : );\nr = ( 0 : m - 1 )';\nr = r( :, ones( 1, n ) );\nv = abs( r + c ) + 1;\ny = sparse( v, r + m * c + 1, 1, m + n + 1, m * n );\nsymm = false;\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/structures/cvx_s_hermitian.m", "content": "function [ y, symm ] = cvx_s_hermitian( m, n, symm ) %#ok\n\n%CVX_S_HERMITIAN Complex Hermitian matrices. This is no longer used by\n%cvx_create_structure, but it is used by cvx_sdpt3.\n\nif m ~= n,\n error( 'Hermitian structure requires square matrices.' );\nend\n\nnsq = n * n;\nc = 0 : n - 1;\nc = c( ones( 1, 2 * n ), : );\nc = c( : );\nr = 0 : n - 1;\nr = r( [ 1, 1 ], : );\nr = r( : );\nr = r( :, ones( 1, n ) );\nr = r( : );\nv = [ 1 ; 1i ];\nv = v( :, ones( 1, nsq ) );\nv = v( : );\ntemp = r < c;\nv( temp ) = conj( v( temp ) );\ntemp = r == c;\nv( temp ) = real( v( temp ) );\nmn = min( r, c );\nmx = max( r, c );\ny = sparse( 2 * ( mx + mn .* ( n - 0.5 * ( mn + 1 ) ) + 1 ) - ( v == 1 ), r + n * c + 1, v, length( v ), nsq );\ny = y( any( y, 2 ), : );\nsymm = false;\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/structures/cvx_s_sparse.m", "content": "function [ y, symm ] = cvx_s_sparse( m, n, symm, i, j )\n\n%CVX_S_SPARSE Matrices with a fixed sparsity pattern.\n\nif nargin < 5,\n error( 'Sparsity structure missing.' );\nelseif ~isnumeric( i ) || ~isnumeric( j ),\n error( 'Sparsity arguments must be vectors of nonnegative integers.' );\nelseif any( i <= 0 ) || any( j <= 0 ) || any( i ~= floor( i ) ) || any( j ~= floor( j ) ),\n error( 'Sparsity arguments must be vectors nonnegative integers.' );\nelseif numel( i ) ~= 1 && numel( j ) ~= 1 && numel( i ) ~= numel( j ),\n error( 'Sparsity arguments have incompatible size.' );\nelseif any( i > m ) || any( j > n ),\n error( 'One or more indices are out of range.' );\nelseif symm && m ~= n,\n error( 'Symmetric structure requires a square matrix.' );\nend\ni = i(:); \nj = j(:);\nnz = max( numel(i), numel(j) );\nif symm,\n t = max(i,j);\n j = min(i,j);\n i = t;\nend\n[ c, cndxs ] = sort( i + ( j - 1 ) * m );\ntt = [true;c(2:end)~=c(1:end-1)];\nc = c(tt);\nr = 1 : length(c);\nif symm,\n if numel(i) > 1,\n i = i(cndxs(tt));\n end\n if numel(j) > 1,\n j = j(cndxs(tt));\n end\n tt = i ~= j;\n r = [ r , r(tt) ];\n c = [ c ; j(tt) + ( i(tt) - 1 ) * m ];\nend\ny = min( sparse( r, c, 1, nz, m * n ), 1 );\nsymm = false;\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/structures/cvx_s_symmetric.m", "content": "function [ y, symm ] = cvx_s_symmetric( m, n, symm ) %#ok\n%CVX_S_SYMMETRIC Symmetric matrices (lower triangle storage).\nif m ~= n,\n error( 'Symmetric structure requires square matrices.' );\nend\nsymm = false;\nnsq = n * n;\nntr = 0.5 * ( nsq + n );\nc = 0 : n - 1;\nc = c( ones( 1, n ), : );\nr = c';\nmn = min( r, c );\nmx = max( r, c );\ny = mx + mn .* ( n - 0.5 * ( mn + 1 ) ) + 1;\ny = sparse( y( : ), 1 : nsq, 1, ntr, nsq );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/structures/cvx_s_symmetric_ut.m", "content": "function [ y, symm ] = cvx_s_symmetric_ut( m, n, symm )\n%CVX_S_SYMMETRIC_UT Symmetric matrices (upper triangle storage).\nif m ~= n,\n error( 'Symmetric structure requires square matrices.' );\nend\nsymm = false;\nnsq = n * n;\nntr = 0.5 * ( nsq + n );\nc = 0 : n - 1;\nc = c( ones( 1, n ), : );\nr = c';\nmn = min( r, c );\nmx = max( r, c );\ny = mn + 0.5 * mx .* ( mx + 1 ) + 1;\ny = sparse( y( : ), 1 : nsq, 1, ntr, nsq );\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/CVX/structures/cvx_s_upper_hankel.m", "content": "function [ y, symm ] = cvx_s_upper_hankel( m, n, symm )\n\n% CVX_S_UPPER_HANKEL Upper Hankel matrices.\n\nc = 0 : n - 1;\nc = c( ones( 1, m ), : );\nr = ( 0 : m - 1 )';\nr = r( :, ones( 1, n ) );\nv = abs( r + c ) + 1;\ntemp = v <= min( m, n );\ny = sparse( v( temp ), r( temp ) + m * c( temp ) + 1, 1, min( m, n ), m * n );\nsymm = false;\n\n% Copyright 2005-2016 CVX Research, Inc. \n% See the file LICENSE.txt for full copyright information.\n% The command 'cvx_where' will show where this file is located.\n" }, { "path": "src/test/resources/samples/langs/Matlab/Check_plot.m", "content": "x_0=linspace(0,100,101);\r\nvx_0=linspace(0,100,101);\r\nz=zeros(101,101);\r\nfor i=1:101\r\n for j=1:101\r\n z(i,j)=x_0(i)*vx_0(j);\r\n end\r\nend\r\n\r\nfigure\r\npcolor(x_0,vx_0,z)\r\nshading flat" }, { "path": "src/test/resources/samples/langs/Matlab/FTLEH.m", "content": "tic\r\nclear all\r\n%% Choice of the mass parameter\r\nmu=0.1;\r\n\r\n%% Computation of Lagrangian Points\r\n[xl1,yl1,xl2,yl2,xl3,yl3,xl4,yl4,xl5,yl5] = Lagr(mu);\r\n\r\n%% Computation of initial total energy\r\nE_L1=-Omega(xl1,yl1,mu);\r\nE=E_L1+0.03715; % Offset as in figure 2.2 \"LCS in the ER3BP\"\r\n\r\n%% Initial conditions range\r\nx_0_min=-0.8;\r\nx_0_max=-0.2;\r\n\r\nvx_0_min=-2;\r\nvx_0_max=2;\r\n\r\ny_0=0;\r\n\r\n% Elements for grid definition\r\nn=200;\r\n\r\n% Dimensionless integrating time\r\nT=2;\r\n\r\n% Grid initializing\r\n[x_0,vx_0]=ndgrid(linspace(x_0_min,x_0_max,n),linspace(vx_0_min,vx_0_max,n));\r\nvy_0=sqrt(2*E+2*Omega(x_0,y_0,mu)-vx_0.^2);\r\n\r\n% Kinetic energy computation\r\nE_cin=E+Omega(x_0,y_0,mu);\r\n\r\n%% Transforming into Hamiltonian variables\r\npx_0=vx_0-y_0;\r\npy_0=vy_0+x_0;\r\n\r\n% Inizializing\r\nx_T=zeros(n,n);\r\ny_T=zeros(n,n);\r\npx_T=zeros(n,n);\r\npy_T=zeros(n,n);\r\nfiltro=ones(n,n);\r\nE_T=zeros(n,n);\r\na=zeros(n,n); % matrix of numbers of integration steps for each integration\r\nnp=0; % number of integrated points\r\n\r\nfprintf(' con n = %i\\n',n)\r\n\r\n%% Energy tolerance setting\r\nenergy_tol=inf;\r\n\r\n%% Computation of the Jacobian of the system\r\noptions=odeset('Jacobian',@cr3bp_jac);\r\n\r\n%% Parallel integration of equations of motion\r\nparfor i=1:n\r\n\tfor j=1:n\r\n\t\tif E_cin(i,j)>0 && isreal(vy_0(i,j)) % Check for real velocity and positive Kinetic energy\r\n\t\t\t[t,Y]=ode45(@fH,[0 T],[x_0(i,j); y_0; px_0(i,j); py_0(i,j)],options);\r\n % Try to obtain the name of the solver for a following use\r\n% \t\t\tsol=ode45(@f,[0 T],[x_0(i,j); y_0; vx_0(i,j); vy_0(i,j)],options);\r\n% \t\t\tY=sol.y';\r\n% \t\t\tsolver=sol.solver;\r\n\t\t\ta(i,j)=length(Y);\r\n %Saving solutions\r\n\t\t\tx_T(i,j)=Y(a(i,j),1); \r\n\t\t\tpx_T(i,j)=Y(a(i,j),3);\r\n\t\t\ty_T(i,j)=Y(a(i,j),2);\r\n\t\t\tpy_T(i,j)=Y(a(i,j),4);\r\n\t\t\t%Computation of final total energy and difference with\r\n\t\t\t%initial one\r\n\t\t\tE_T(i,j)=EnergyH(x_T(i,j),y_T(i,j),px_T(i,j),py_T(i,j),mu);\r\n\t\t\tdelta_E=abs(E_T(i,j)-E);\r\n\t\t\tif delta_E > energy_tol; %Check of total energy conservation\r\n\t\t\t\tfprintf(' Ouch! Wrong Integration: i,j=(%i,%i)\\n E_T=%.2f \\n delta_E=%.2f\\n\\n',i,j,E_T(i,j),delta_E);\r\n\t\t\t\tfiltro(i,j)=2; %Saving position of the point\r\n end\r\n\t\t\tnp=np+1;\r\n else\r\n\t\t\tfiltro(i,j)=0; % 1=interesting point; 0=non-sense point; 2= bad integration point\t\t\r\n\t\tend\r\n\tend\r\nend\r\n\r\nt_integrazione=toc;\r\nfprintf(' n = %i\\n',n)\r\nfprintf(' energy_tol = %.2f\\n',energy_tol)\r\nfprintf('total\t\\t%i\\n',n^2)\r\nfprintf('nunber\t\\t%i\\n',np)\r\nfprintf('time to integrate\t\\t%.2f s\\n',t_integr)\r\n\r\n%% Back to Lagrangian variables\r\nvx_T=px_T+y_T;\r\nvy_T=py_T-x_T;\r\n%% FTLE Computation\r\nfprintf('adesso calcolo ftle\\n')\r\ntic\r\ndphi=zeros(2,2);\r\nftle=zeros(n-2,n-2);\r\n\r\nfor i=2:n-1\r\n\tfor j=2:n-1\r\n\t\tif filtro(i,j) && ... % Check for interesting point\r\n\t\t\t\tfiltro(i,j-1) && ...\r\n\t\t\t\tfiltro(i,j+1) && ...\r\n\t\t\t\tfiltro(i-1,j) && ...\r\n\t\t\t\tfiltro(i+1,j)\r\n\t\t\t\r\n\t\t\tdphi(1,1)=(x_T(i-1,j)-x_T(i+1,j))/(x_0(i-1,j)-x_0(i+1,j));\r\n\t\t\t\r\n\t\t\tdphi(1,2)=(x_T(i,j-1)-x_T(i,j+1))/(vx_0(i,j-1)-vx_0(i,j+1));\r\n\t\t\t\r\n\t\t\tdphi(2,1)=(vx_T(i-1,j)-vx_T(i+1,j))/(x_0(i-1,j)-x_0(i+1,j));\r\n\t\t\t\r\n\t\t\tdphi(2,2)=(vx_T(i,j-1)-vx_T(i,j+1))/(vx_0(i,j-1)-vx_0(i,j+1));\r\n \r\n\t\t\tif filtro(i,j)==2 % Manual setting to visualize bad integrated points \r\n\t\t\t\tftle(i-1,j-1)=-Inf;\r\n\t\t\telse\r\n\t\t\t\tftle(i-1,j-1)=1/(2*T)*log(max(abs(eig(dphi'*dphi))));\r\n\t\t\tend\r\n\t\tend\r\n\tend\r\nend\r\n\r\n%% Plotting results\r\n% figure\r\n% plot(t,Y)\r\n% figure\r\n% plot(Y(:,1),Y(:,2))\r\n% figure\r\n\r\nxx=linspace(x_0_min,x_0_max,n);\r\nvvx=linspace(vx_0_min,vx_0_max,n);\r\n[x,vx]=ndgrid(xx(2:n-1),vvx(2:n-1));\r\nfigure\r\npcolor(x,vx,ftle)\r\nshading flat\r\n\r\nt_ftle=toc;\r\nfprintf('tempo per integrare \\t%.2f s\\n',t_integrazione)\r\nfprintf('tempo per calcolare ftle \\t%.2f s\\n',t_ftle)\r\n\r\n% save(['var_' num2str(n) '_' num2str(clock(4)])\r\n\r\nnome=['var_xvx_', 'ode00', '_n',num2str(n),'_e',num2str(energy_tol),'_H'];\r\nsave(nome)" }, { "path": "src/test/resources/samples/langs/Matlab/FTLE_reg.m", "content": "tic\nclear all\n%% Elements for grid definition\nn=100;\n\n%% Dimensionless integrating time\nT=2;\n\n%% Choice of the mass parameter\nmu=0.1;\n\n%% Computation of Lagrangian Points\n[xl1,yl1,xl2,yl2,xl3,yl3,xl4,yl4,xl5,yl5] = Lagr(mu);\n\n%% Computation of initial total energy\nE_L1=-Omega(xl1,yl1,mu);\nC_L1=-2*E_L1; % C_L1 = 3.6869532299 from Szebehely\nE=E_L1+0.03715; % Offset as in figure 2.2 \"LCS in the ER3BP\"\n\n%% Initial conditions range\nx_0_min=-0.8;\nx_0_max=-0.2;\n\nvx_0_min=-2;\nvx_0_max=2;\n\ny_0=0;\n\n% Grid initializing\n[x_0,vx_0]=ndgrid(linspace(x_0_min,x_0_max,n),linspace(vx_0_min,vx_0_max,n));\nvy_0=sqrt(2*E+2.*Omega(x_0,y_0,mu)-vx_0.^2);\n% Kinetic energy computation\nE_cin=E+Omega(x_0,y_0,mu);\n\n% Inizializing\nx_T=zeros(n,n);\ny_T=zeros(n,n);\nvx_T=zeros(n,n);\nvy_T=zeros(n,n);\nfiltro=ones(n,n);\nE_T=zeros(n,n);\ndelta_E=zeros(n,n);\na=zeros(n,n); % matrix of numbers of integration steps for each integration\nnp=0; % number of integrated points\n\nfprintf('integro con n = %i\\n',n)\n\n%% Energy tolerance setting\nenergy_tol=0.1;\n\n%% Setting the options for the integrator\nRelTol=1e-12;AbsTol=1e-12; % From Short\n% RelTol=1e-13;AbsTol=1e-22; % From JD James Mireles\n% RelTol=3e-14;AbsTol=1e-16; % HIGH accuracy from Ross\noptions=odeset('AbsTol',AbsTol,'RelTol',RelTol);\n%% Parallel integration of equations of motion\nh=waitbar(0,'','Name','Integration in progress, please wait!');\nS=zeros(n,n);\nr1=zeros(n,n);\nr2=zeros(n,n);\ng=zeros(n,n);\nfor i=1:n\n waitbar(i/n,h,sprintf('Computing i=%i',i));\n\tparfor j=1:n\n r1(i,j)=sqrt((x_0(i,j)+mu).^2+y_0.^2);\n\t\tr2(i,j)=sqrt((x_0(i,j)-1+mu).^2+y_0.^2);\n\t\tg(i,j)=((1-mu)./(r1(i,j).^3)+mu./(r2(i,j).^3));\n\t\tif E_cin(i,j)>0 && isreal(vy_0(i,j)) % Check for real velocity and positive Kinetic energy\n S(i,j)=g(i,j)*T;\n [s,Y]=ode45(@f_reg,[0 S(i,j)],[x_0(i,j); y_0; vx_0(i,j); vy_0(i,j)],options,mu);\n\t\t\ta(i,j)=length(Y);\n% if s(a(i,j)) < 2\n% filtro(i,j)=3;\n% end\n\t\t\t% Saving solutions\n\t\t\tx_T(i,j)=Y(a(i,j),1);\n\t\t\tvx_T(i,j)=Y(a(i,j),3);\n\t\t\ty_T(i,j)=Y(a(i,j),2);\n\t\t\tvy_T(i,j)=Y(a(i,j),4);\n\n\t\t\t% Computation of final total energy and difference with\n\t\t\t% initial one\n\t\t\tE_T(i,j)=Energy(x_T(i,j),y_T(i,j),vx_T(i,j),vy_T(i,j),mu);\n delta_E(i,j)=abs(E_T(i,j)-E);\n if delta_E(i,j) > energy_tol; % Check of total energy conservation\n fprintf(' Ouch! Wrong Integration: i,j=(%i,%i)\\n E_T=%.2f \\n delta_E=%f\\n\\n',i,j,E_T(i,j),delta_E(i,j));\n filtro(i,j)=2; % Saving position of the point\n end\n np=np+1;\n else\n\t\t\tfiltro(i,j)=0; % 1 = interesting point; 0 = non-sense point; 2 = bad integration point\t\t\n\t\tend\n\tend\nend\nclose(h);\nt_integrazione=toc;\n%%\nfiltro_1=filtro;\nfor i=2:n-1\n for j=2:n-1\n if filtro(i,j)==2 || filtro (i,j)==3\n filtro_1(i,j)=2;\n\t\t\tfiltro_1(i+1,j)=2;\n filtro_1(i-1,j)=2;\n filtro_1(i,j+1)=2;\n filtro_1(i,j-1)=2;\n end\n end\nend\n\nfprintf('integato con n = %i\\n',n)\nfprintf('integato con energy_tol = %f\\n',energy_tol)\nfprintf('numero punti totali\t\\t%i\\n',n^2)\nfprintf('numero punti integrati\t\\t%i\\n',np)\nfprintf('tempo per integrare\t\\t%.2f s\\n',t_integrazione)\n\n%% FTLE Computation\nfprintf('adesso calcolo ftle\\n')\ntic\ndphi=zeros(2,2);\nftle=zeros(n-2,n-2);\nftle_norm=zeros(n-2,n-2);\n\nds_x=(x_0_max-x_0_min)/(n-1);\nds_vx=(vx_0_max-vx_0_min)/(n-1);\n\nfor i=2:n-1\n\tfor j=2:n-1\n\t\tif filtro_1(i,j) && ... % Check for interesting point\n\t\t\t\tfiltro_1(i,j-1) && ...\n\t\t\t\tfiltro_1(i,j+1) && ...\n\t\t\t\tfiltro_1(i-1,j) && ...\n\t\t\t\tfiltro_1(i+1,j)\n\t\t\t% La direzione dello spostamento la decide il denominatore\n\t\t\t\n\t\t\t% TODO spiegarsi teoricamente come mai la matrice pu�\n\t\t\t% essere ridotta a 2x2\n\t\t\tdphi(1,1)=(x_T(i+1,j)-x_T(i-1,j))/(2*ds_x); %(x_0(i-1,j)-x_0(i+1,j));\n\t\t\t\n\t\t\tdphi(1,2)=(x_T(i,j+1)-x_T(i,j-1))/(2*ds_vx); %(vx_0(i,j-1)-vx_0(i,j+1));\n\t\n\t\t\tdphi(2,1)=(vx_T(i+1,j)-vx_T(i-1,j))/(2*ds_x); %(x_0(i-1,j)-x_0(i+1,j));\n \n\t\t\tdphi(2,2)=(vx_T(i,j+1)-vx_T(i,j-1))/(2*ds_vx); %(vx_0(i,j-1)-vx_0(i,j+1));\n \n\t\t\tif filtro_1(i,j)==2 % Manual setting to visualize bad integrated points \n\t\t\t\tftle(i-1,j-1)=0;\n\t\t\telse\n\t\t\t\tftle(i-1,j-1)=(1/abs(T))*log(max(sqrt(abs(eig(dphi*dphi')))));\n ftle_norm(i-1,j-1)=(1/abs(T))*log(norm(dphi));\n\t\t\tend\n\t\tend\n\tend\nend\n\n%% Plotting results\n% figure\n% plot(t,Y)\n% figure\n% plot(Y(:,1),Y(:,2))\n% figure\n\nxx=linspace(x_0_min,x_0_max,n);\nvvx=linspace(vx_0_min,vx_0_max,n);\n[x,vx]=ndgrid(xx(2:n-1),vvx(2:n-1));\nfigure\npcolor(x,vx,ftle)\nshading flat\n\nt_ftle=toc;\nfprintf('tempo per integrare \\t%.2f s\\n',t_integrazione)\nfprintf('tempo per calcolare ftle \\t%.2f s\\n',t_ftle)\n\n% ora=fstringf %TODO\n% save(['var_' num2str(n) '_' num2str(clock(4)])\n\nnome=['var_xvx_', 'ode00', '_n',num2str(n)];\nsave(nome)" }, { "path": "src/test/resources/samples/langs/Matlab/Integrate1.m", "content": "function [ x_T, y_T, vx_T, e_T, filter ] = Integrate_FILE( x_0, y_0, vx_0, e_0, T, N, mu, options)\r\n%Integrate\r\n% This function performs Runge-Kutta-Fehlberg integration for given\r\n% initial conditions to compute FILE\r\nnx=length(x_0);\r\nny=length(y_0);\r\nnvx=length(vx_0);\r\nne=length(e_0);\r\nvy_0=zeros(nx,ny,nvx,ne);\r\nx_T=zeros(nx,ny,nvx,ne);\r\ny_T=zeros(nx,ny,nvx,ne);\r\nvx_T=zeros(nx,ny,nvx,ne);\r\nvy_T=zeros(nx,ny,nvx,ne);\r\ne_T=zeros(nx,ny,nvx,ne);\r\n%% Look for phisically meaningful points\r\nfilter=zeros(nx,ny,nvx,ne); %0=meaningless point 1=meaningful point\r\n\r\n%% Integrate only meaningful points\r\nh=waitbar(0,'','Name','Integration in progress, please wait!');\r\nfor i=1:nx\r\n\twaitbar(i/nx,h,sprintf('Computing i=%i',i));\r\n\tfor j=1:ny\r\n\t\tparfor k=1:nvx\r\n\t\t\tfor l=1:ne\r\n\t\t\t\tvy_0(i,j,k,l)=sqrt(2*Potential(x_0(i),y_0(j),mu)+2*e_0(l)-vx_0(k)^2);\r\n\t\t\t\tif isreal(vy_0(i,j,k,l))\r\n\t\t\t\t\tfilter(i,j,k,l)=1;\r\n\t\t\t\t\tci=[x_0(i), y_0(j), vx_0(k), vy_0(i,j,k,l)];\r\n\t\t\t\t\t[t,Y,te,ye,ie]=ode45(@f,[0 T], ci, options, mu);\r\n\t\t\t\t\tx_T(i,j,k,l)=ye(N+1,1);\r\n\t\t\t\t\ty_T(i,j,k,l)=ye(N+1,2);\r\n\t\t\t\t\tvx_T(i,j,k,l)=ye(N+1,3);\r\n\t\t\t\t\tvy_T(i,j,k,l)=ye(N+1,4);\r\n\t\t\t\t\te_T(i,j,k,l)=0.5*(vx_T(i,j,k,l)^2+vy_T(i,j,k,l)^2)-Potential(x_T(i,j,k,l),y_T(i,j,k,l),mu);\r\n\t\t\t\tend\r\n\t\t\tend\r\n\t\tend\r\n\tend\r\nend\r\nclose(h);\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/Integrate2.m", "content": "function [ x_T, y_T, vx_T, e_T, filter, delta_e ] = Integrate_FTLE_Gawlick_ell( x_0, y_0, vx_0, e_0, T, mu, ecc, nu, options)\r\n%Integrate\r\n% This function performs Runge-Kutta-Fehlberg integration for given\r\n% initial conditions to compute FTLE to obtain the image in the Gawlick's\r\n% article \"Lagrangian Coherent Structures in the Elliptic Restricted\r\n% Three-Body Problem\".\r\nnx=length(x_0);\r\nny=length(y_0);\r\nnvx=length(vx_0);\r\nne=length(e_0);\r\nvy_0=zeros(nx,ny,nvx,ne);\r\nx_T=zeros(nx,ny,nvx,ne);\r\ny_T=zeros(nx,ny,nvx,ne);\r\nvx_T=zeros(nx,ny,nvx,ne);\r\nvy_T=zeros(nx,ny,nvx,ne);\r\ne_T=zeros(nx,ny,nvx,ne);\r\ndelta_e=zeros(nx,ny,nvx,ne);\r\n%% Look for phisically meaningful points\r\nfilter=zeros(nx,ny,nvx,ne); %0=meaningless point 1=meaningful point\r\nuseful=ones(nx,ny,nvx,ne);\r\n%% Integrate only useful points\r\nuseful(:,1,:,1)=0;\r\nuseful(:,1,:,3)=0;\r\nuseful(:,3,:,1)=0;\r\nuseful(:,3,:,3)=0;\r\n\r\n%% Integrate only meaningful points\r\nh=waitbar(0,'','Name','Integration in progress, please wait!');\r\nfor i=1:nx\r\n\twaitbar(i/nx,h,sprintf('Computing i=%i',i));\r\n\tfor j=1:ny\r\n\t\tparfor k=1:nvx\r\n\t\t\tfor l=1:ne\r\n\t\t\t\tif useful(i,j,k,l)\r\n\t\t\t\t\tvy_0(i,j,k,l)=-sqrt(2*(Omega(x_0(i),y_0(j),mu)/(1+ecc*cos(nu)))+2*e_0(l)-vx_0(k)^2);\r\n\t\t\t\t\tif isreal(vy_0(i,j,k,l))\r\n\t\t\t\t\t\tfilter(i,j,k,l)=1;\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tci=[x_0(i), y_0(j), vx_0(k), vy_0(i,j,k,l)];\r\n\t\t\t\t\t\t[t,Y]=ode45(@f_ell,[0 T], ci, options, mu, ecc);\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tif abs(t(end)) < abs(T) % Consider also negative time\r\n\t\t\t\t\t\t\tfilter(i,j,k,l)=3\r\n\t\t\t\t\t\tend\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tx_T(i,j,k,l)=Y(end,1);\r\n\t\t\t\t\t\ty_T(i,j,k,l)=Y(end,2);\r\n\t\t\t\t\t\tvx_T(i,j,k,l)=Y(end,3);\r\n\t\t\t\t\t\tvy_T(i,j,k,l)=Y(end,4);\r\n\t\t\t\t\t\te_T(i,j,k,l)=0.5*(vx_T(i,j,k,l)^2+vy_T(i,j,k,l)^2)-Omega(x_T(i,j,k,l),y_T(i,j,k,l),mu);\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t% Compute the goodness of the integration\r\n\t\t\t\t\t\tdelta_e(i,j,k,l)=abs(e_T(i,j,k,l)-e_0(l));\r\n\t\t\t\t\tend\r\n\t\t\t\tend\r\n\t\t\tend\r\n\t\tend\r\n\tend\r\nend\r\nclose(h);" }, { "path": "src/test/resources/samples/langs/Matlab/Lagr.m", "content": "function [xl1,yl1,xl2,yl2,xl3,yl3,xl4,yl4,xl5,yl5] = Lagr(mu)\r\n% [xl1,yl1,xl2,yl2,xl3,yl3,xl4,yl4,xl5,yl5] = Lagr(mu)\r\n% Lagr This function computes the coordinates of the Lagrangian points,\r\n% given the mass parameter\r\nyl1=0;\r\nyl2=0;\r\nyl3=0;\r\nyl4=sqrt(3)/2;\r\nyl5=-sqrt(3)/2;\r\nc1=roots([1 mu-3 3-2*mu -mu 2*mu -mu]);\r\nc2=roots([1 3-mu 3-2*mu -mu -2*mu -mu]);\r\nc3=roots([1 2+mu 1+2*mu mu-1 2*mu-2 mu-1]);\r\nxl1=0;\r\nxl2=0;\r\nfor i=1:5\r\n if isreal(c1(i))\r\n xl1=1-mu-c1(i);\r\n end\r\n if isreal(c2(i))\r\n xl2=1-mu+c2(i);\r\n end\r\n if isreal(c3(i))\r\n xl3=-mu-c3(i);\r\n end\r\nend\r\nxl4=0.5-mu;\r\nxl5=xl4;\r\nend" }, { "path": "src/test/resources/samples/langs/Matlab/Lagrangian_points.m", "content": "% Plot dei Lagrangian points\r\nn=5;\r\nmu=linspace(0,0.5,n);\r\nfor i=1:n\r\n [xl1,yl1,xl2,yl2,xl3,yl3,xl4,yl4,xl5,yl5] = Lagr(mu(i));\r\n figure (1)\r\n hold all\r\n plot(xl1, yl1, 's')\r\n plot(xl2, yl2, 's')\r\n plot(xl3, yl3, 's')\r\n plot(xl4, yl4, 's')\r\n plot(xl5, yl5, 's')\r\n plot(-mu,0,'o')\r\n plot(1-mu,0, 'o')\r\n plot([-mu(i) xl4],[0 yl4])\r\nend" }, { "path": "src/test/resources/samples/langs/Matlab/Poincare.m", "content": "clear\r\n%% Initial Conditions\r\nmu=0.012277471;\r\nT=10;\r\nN=5;\r\nC=3.17;\r\nx_0=0.30910452642073;\r\ny_0=0.07738174525518;\r\nvx_0=-0.72560796964234;\r\nvy_0=sqrt(-C-vx_0^2+2*Potential(x_0,y_0,mu));\r\nk=0;\r\n%% Integration\r\noptions=odeset('AbsTol',1e-22,'RelTol',1e-13,'Events',@cross_y);\r\n[t,y,te,ye,ie]=ode113(@f,[0 T],[x_0; y_0; vx_0; vy_0],options,mu);\r\n\r\nfigure\r\n%plot(ye(:,1),ye(:,3),'rs')\r\nplot(ye(:,1),0,'rs')" }, { "path": "src/test/resources/samples/langs/Matlab/RK4.m", "content": "function x = RK4( fun, tspan, ci, mu )\r\n%RK4 4th-order Runge Kutta integrator\r\n% Detailed explanation goes here\r\nh=1e-5;\r\nt=tspan(1);\r\nT=tspan(length(tspan));\r\ndim=length(ci);\r\n%x=zeros(l,dim);\r\nx(:,1)=ci;\r\ni=1;\r\nwhile t. Returns real(x'*y)\n% For matrices, this is the inner product that induces the Frobenius\n% norm, i.e. = tr(x'*y), and not matrix multiplication.\n\n% Note: this is real(x'*y) and not real(x.'*y)\n\nif isempty( x ) || isempty( y ),\n v = 0;\n return;\nend\n\n% Allow scalar times vector multiplies:\nif isscalar(x) && ~isscalar(y)\n if ~x, \n v = 0; \n return;\n else\n% x = repmat(x,size(y,1),size(y,2) ); % doesn't work if y is a cell\n % The above code fails if y is multi-dimensional. Also, not \n % memory efficient. Switching to this (10/9/2013)\n % (Thanks to Graham Coleman for finding this bug, btw)\n if issparse(y)\n v = real( x * sum(nonzeros(y)) );\n else\n v = real( x * sum(y(:)) );\n end\n return;\n end\nelseif isscalar(y) && ~isscalar(x)\n if ~y\n v = 0;\n return;\n else\n y = repmat(y,size(x,1),size(x,2) );\n if issparse(x)\n v = real( y * sum(nonzeros(x)) );\n else\n v = real( y * sum(x(:)) );\n end\n return;\n \n end\nend\n\nif isreal( x ) || isreal( y ),\n if issparse( x ) || issparse( y ),\n v = sum( nonzeros( real(x) .* real(y) ) );\n else\n % Split this into two cases (first case could be handled by\n % second case, but we're trying to make it very fast since\n % this code is called very often)\n if ndims(x)==2 && ndims(y)==2 && size(x,2) == 1 && size(y,2) == 1 && isreal(x) && isreal(y)\n v = sum( x'*y ); % do we really need 'sum' ?\n else\n % Take real part first (since one of x and y is real anyhow)\n % in order to save some computation:\n v = real(x(:))' * real(y(:));\n end\n end\nelse\n if issparse( x ) || issparse( y ),\n v = sum( nonzeros( real(x) .* real(y) ) ) + ...\n sum( nonzeros( imag(x) .* imag(y) ) );\n else\n % SRB: this is very slow:\n% v = sum( real(x(:))' * real(y(:)) ) + ...\n% sum( imag(x(:))' * imag(y(:)) );\n if ndims(x)==2 && ndims(y)==2 && size(x,2) == 1 && size(y,2) == 1\n v = sum(real( x'*y ) );\n else\n % This is the most generic code.\n v = real( x(:)'*y(:) );\n end\n end\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information." }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@double/tfocs_size.m", "content": "function v = tfocs_size( x )\n\n% SIZE TFOCS-friendly size operator.\n\nv = { @zeros, m, n };\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@double/vec.m", "content": "function v = vec( x )\n\n% VEC\tVectorize.\n\nv = reshape( x, numel(x), 1 );\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n " }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@single/tfocs_dot.m", "content": "function v = tfocs_dot( x, y )\n% TFOCS_DOT Dot product . Returns real(x'*y)\n% For matrices, this is the inner product that induces the Frobenius\n% norm, i.e. = tr(x'*y), and not matrix multiplication.\n\n% Note: this is real(x'*y) and not real(x.'*y)\n\nif isempty( x ) || isempty( y ),\n v = 0;\n return;\nend\n\n% Allow scalar times vector multiplies:\nif isscalar(x) && ~isscalar(y)\n if ~x, \n v = 0; \n return;\n else\n% x = repmat(x,size(y,1),size(y,2) ); % doesn't work if y is a cell\n % The above code fails if y is multi-dimensional. Also, not \n % memory efficient. Switching to this (10/9/2013)\n % (Thanks to Graham Coleman for finding this bug, btw)\n if issparse(y)\n v = real( x * sum(nonzeros(y)) );\n else\n v = real( x * sum(y(:)) );\n end\n return;\n end\nelseif isscalar(y) && ~isscalar(x)\n if ~y\n v = 0;\n return;\n else\n y = repmat(y,size(x,1),size(x,2) );\n if issparse(x)\n v = real( y * sum(nonzeros(x)) );\n else\n v = real( y * sum(x(:)) );\n end\n return;\n \n end\nend\n\nif isreal( x ) || isreal( y ),\n if issparse( x ) || issparse( y ),\n v = sum( nonzeros( real(x) .* real(y) ) );\n else\n % Split this into two cases (first case could be handled by\n % second case, but we're trying to make it very fast since\n % this code is called very often)\n if ndims(x)==2 && ndims(y)==2 && size(x,2) == 1 && size(y,2) == 1 && isreal(x) && isreal(y)\n v = sum( x'*y ); % do we really need 'sum' ?\n else\n % Take real part first (since one of x and y is real anyhow)\n % in order to save some computation:\n v = real(x(:))' * real(y(:));\n end\n end\nelse\n if issparse( x ) || issparse( y ),\n v = sum( nonzeros( real(x) .* real(y) ) ) + ...\n sum( nonzeros( imag(x) .* imag(y) ) );\n else\n % SRB: this is very slow:\n% v = sum( real(x(:))' * real(y(:)) ) + ...\n% sum( imag(x(:))' * imag(y(:)) );\n if ndims(x)==2 && ndims(y)==2 && size(x,2) == 1 && size(y,2) == 1\n v = sum(real( x'*y ) );\n else\n % This is the most generic code.\n v = real( x(:)'*y(:) );\n end\n end\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information." }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@single/tfocs_size.m", "content": "function v = tfocs_size( x )\n\n% SIZE TFOCS-friendly size operator.\n\nv = { @zeros, m, n };\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@single/vec.m", "content": "function v = vec( x )\n\n% VEC\tVectorize.\n\nv = reshape( x, numel(x), 1 );\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n " }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@tfocs_tuple/abs.m", "content": "function x = abs( x )\n\n% ABS Absolute value.\n\nn = numel( x.value_ );\nfor k = 1 : n,\n x.value_{k} = abs( x.value_{k} );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@tfocs_tuple/cell.m", "content": "function v = cell( x )\n\n% CELL Conversion to a cell array.\n\nv = x.value_;\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@tfocs_tuple/disp.m", "content": "function disp( x, prefix, inpname, nohead )\n\n% DISP\tManual display. DISP(x,prefix) adds the string prefix to each\n% line of the display output.\n\nif nargin < 3, inpname = ''; end\nif nargin < 2, prefix = ''; end\nn = numel( x.value_ );\nif nargin < 4,\n fprintf( '%stfocs tuple object:\\n', prefix );\n prefix = [ prefix, ' ' ];\nend\nfor k = 1 : n,\n ss = x.value_{k};\n inpname2 = sprintf( '%s{%d}', inpname, k );\n if isnumeric( ss ),\n cls = class( ss );\n sz = size( ss );\n temp = sprintf( '%dx', sz );\n if all( sz == 1 ),\n fprintf( '%s%s: [%g]\\n', prefix, inpname2, ss );\n elseif isreal(ss),\n fprintf( '%s%s: [%s %s]\\n', prefix, inpname2, temp(1:end-1), cls );\n else\n fprintf( '%s%s: [%s %s complex]\\n', prefix, inpname2, temp(1:end-1), cls );\n end\n elseif isa( ss, 'tfocs_tuple' ),\n fprintf( '%s%s: tfocs tuple object\\n', prefix, inpname2 );\n disp( ss, [ prefix, inpname2 ], '', 1 );\n else\n fprintf( '%s%s: %s\\n', prefix, inpname2, class(ss) );\n end\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@tfocs_tuple/display.m", "content": "function display( x )\n\n% DISPLAY\tAutomatic display.\n\nlong = ~isequal(get(0,'FormatSpacing'),'compact');\nif long, disp( ' ' ); end\ndisp([inputname(1) ' =']);\nif long, disp( ' ' ); end\ndisp(x,' ',inputname(1))\nif long, disp( ' ' ); end\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@tfocs_tuple/get.m", "content": "function y = get( x, ndxs )\nif nargin == 0,\n y = x.value_;\nelseif numel(ndxs) == 1,\n y = x.value_{ndxs};\nelse\n y = x.value_(ndxs);\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@tfocs_tuple/max.m", "content": "function z = max( x, y )\n\n% MAX Maximum, z = max(x,y)\n\nif isa(x,'tfocs_tuple')\n z = x;\n if isa(y,'tfocs_tuple')\n z.value_ = cellfun( @max, x.value_, y.value_, 'UniformOutput', false );\n elseif isscalar(y)\n z.value_ = cellfun( @max, x.value_, {y}, 'UniformOutput', false );\n else \n z.value_ = cellfun( @max, x.value_, {y}, 'UniformOutput', false );\n end\nelse\n z = y;\n if isscalar(x)\n z.value_ = cellfun( @max, {x}, y.value_, 'UniformOutput', false );\n else \n z.value_ = cellfun( @max, {x}, y.value_, 'UniformOutput', false );\n end\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@tfocs_tuple/min.m", "content": "function z = min( x, y )\n\n% MAX Minimum, z = min(x,y)\n\nif isa(x,'tfocs_tuple')\n z = x;\n if isa(y,'tfocs_tuple')\n z.value_ = cellfun( @min, x.value_, y.value_, 'UniformOutput', false );\n elseif isscalar(y)\n z.value_ = cellfun( @min, x.value_, {y}, 'UniformOutput', false );\n else \n z.value_ = cellfun( @min, x.value_, {y}, 'UniformOutput', false );\n end\nelse\n z = y;\n if isscalar(x)\n z.value_ = cellfun( @min, {x}, y.value_, 'UniformOutput', false );\n else \n z.value_ = cellfun( @min, {x}, y.value_, 'UniformOutput', false );\n end\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@tfocs_tuple/minus.m", "content": "function x = minus( x, y )\n\n% MINUS Subtraction.\n\nif isnumeric( x ) && isscalar( x ) && x == 0,\n x = -y;\nelseif ~isnumeric( y ) || numel( y ) ~= 1 || y ~= 0\n\tx.value_ = cellfun( @minus, x.value_, y.value_, 'UniformOutput', false );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@tfocs_tuple/mtimes.m", "content": "function y = mtimes( x, y )\n\n% MTIMES Multiplication. TFOCS_TUPLE objects may only be left-multiplied\n% by real scalars.\n\nfor k = 1 : numel( y.value_ ),\n y.value_{k} = x * y.value_{k};\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@tfocs_tuple/nnz.m", "content": "function ans = nnz( x )\nans = sum( cellfun( @nnz, x.value_ ) );\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@tfocs_tuple/numel.m", "content": "function v = numel( x, varargin )\n\n% NUMEL Number of elements.\n\nv = numel( x.value_, varargin{:} );\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@tfocs_tuple/plus.m", "content": "function x = plus( x, y )\n\n% PLUS Addition.\n\nif isnumeric( x ) && isscalar( x ) && x == 0,\n x = y;\nelseif ~isnumeric( y ) || numel( y ) ~= 1 || y ~= 0\n\tx.value_ = cellfun( @plus, x.value_, y.value_, 'UniformOutput', false );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@tfocs_tuple/power.m", "content": "function x = power( x, y )\n\n% POWER Matrix power, z = x.^y\n\nif isa(y,'tfocs_tuple')\n\tx.value_ = cellfun( @power, x.value_, y.value_, 'UniformOutput', false );\nelseif isscalar(y)\n\tx.value_ = cellfun( @power, x.value_, {y}, 'UniformOutput', false );\nelse \n\tx.value_ = cellfun( @power, x.value_, {y}, 'UniformOutput', false );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@tfocs_tuple/size.m", "content": "function v = size( x )\n\n% SIZE Size.\n\nv = cellfun( @size, x.value_, 'UniformOutput', false );\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@tfocs_tuple/subsref.m", "content": "function varargout = subsref( x, varargin )\n[ varargout{1:nargout} ] = subsref( x.value_, varargin{:} );\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@tfocs_tuple/tfocs_dot.m", "content": "function v = tfocs_dot( x, y )\n\n% TFOCS_DOT Dot products.\n\nif isempty( x ) || isempty( y ),\n\tv = 0;\nelse\n\tv = sum( cellfun( @tfocs_dot, x.value_, y.value_ ) );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@tfocs_tuple/tfocs_normsq.m", "content": "function v = tfocs_normsq( x )\n\n% TFOCS_NORMSQ Squared norm. By default, TFOCS_NORMSQ(X) is equal\n% to TFOCS_NORMSQ(X,X), and this numerical equivalence\n% must be preserved. However, an object may overload\n% TFOCS_NORMSQ to compute its value more efficiently.\n\nv = sum( cellfun( @tfocs_normsq, x.value_ ) );\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@tfocs_tuple/tfocs_size.m", "content": "function v = tfocs_size( x )\n\nv = { @tfocs_tuple, cellfun( @size, x.value_, 'UniformOutput', false ) };\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@tfocs_tuple/tfocs_tuple.m", "content": "function v = tfocs_tuple( w )\n\n% TFOCS_TUPLE The TFOCS tuple object.\n% This object is used to create tuples, which are elements of\n% vector spaces that are Cartesian products of other vector\n% spaces. TFOCS assumes that any element in a tfocs_tuple can\n% perform the following basic operations:\n% --- addition (plus)\n% --- subtraction (minus)\n% --- multiplication by real scalars (times,mtimes)\n% --- dot products (tfocs_dot)\n% --- squared norm (tfocs_normsq, optional)\n% --- size (size; single-argument calls only)\n\nif ~iscell(w) && ~isempty(w)\n error('tfocs_tuple constructor: input must be a cell array');\nend\nv.value_ = reshape( w, 1, numel(w) );\nv = class( v, 'tfocs_tuple' );\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@tfocs_tuple/tfocs_zeros.m", "content": "function x = tfocs_zeros( x )\n\n% ABS Absolute value.\n\nn = numel( x.value_ );\nfor k = 1 : n,\n x.value_{k} = zeros( size(x.value_{k}) );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@tfocs_tuple/times.m", "content": "function v = times( x, y )\n\n% MTIMES Multiplication.\n\nv = mtimes( x, y );\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/@tfocs_tuple/uminus.m", "content": "function x = uminus( x )\n\n% UMINUS Unary minus.\n\nn = numel( x.value_ );\nfor k = 1 : n,\n x.value_{k} = -x.value_{k};\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/Contents.m", "content": "% TFOCS: Templates for First-Order Conic Solvers\n% TFOCS v1.3 \n%10-Oct-2013\n%\n% Main TFOCS program\n% tfocs - Minimize a convex problem using a first-order algorithm.\n% tfocs_SCD - Smoothed conic dual form of TFOCS, for problems with non-trivial linear operators.\n% continuation - Meta-wrapper to run TFOCS_SCD in continuation mode.\n% Miscellaneous functions\n% tfocs_version - Version information.\n% tfocs_where - Returns the location of the TFOCS system.\n% Operator calculus\n% linop_adjoint - Computes the adjoint operator of a TFOCS linear operator\n% linop_compose - Composes two TFOCS linear operators\n% linop_scale - Scaling linear operator.\n% prox_dualize - Define a proximity function by its dual\n% prox_scale - Scaling a proximity/projection function.\n% tfunc_scale - Scaling a function.\n% tfunc_sum - Sum of functions.\n% tfocs_normsq - Squared norm. \n% linop_normest - Estimates the operator norm.\n% Linear operators\n% linop_matrix - Linear operator, assembled from a matrix.\n% linop_dot - Linear operator formed from a dot product.\n% linop_fft - Fast Fourier transform linear operator.\n% linop_TV - 2D Total-Variation (TV) linear operator.\n% linop_TV3D - 3D Total-Variation (TV) linear operator.\n% linop_handles - Linear operator from user-supplied function handles.\n% linop_spot - Linear operator, assembled from a SPOT operator.\n% linop_reshape - Linear operator to perform reshaping of matrices.\n% linop_subsample - Subsampling linear operator.\n% linop_vec - Matrix to vector reshape operator\n% Projection operators (proximity operators for indicator functions)\n% proj_0 - Projection onto the set {0}\n% proj_box - Projection onto box constraints.\n% proj_l1 - Projection onto the scaled 1-norm ball.\n% proj_l2 - Projection onto the scaled 2-norm ball.\n% proj_linf - Projection onto the scaled infinity norm ball.\n% proj_linfl2 - Projection of each row of a matrix onto the scaled 2-norm ball.\n% proj_max - Projection onto the scaled set of vectors with max entry less than 1\n% proj_conic - Projection onto the second order (aka Lorentz) cone\n% proj_l2group - Projection of each group of coordinates onto the 2-norm ball.\n% proj_singleAffine - Projection onto a single affine equality or in-equality constraint.\n% proj_boxAffine - Projection onto a single affine equality along with box constraints.\n% proj_affine - Projection onto a general affine equation, e.g., solutions of linear equations.\n% proj_nuclear - Projection onto the set of matrices with nuclear norm less than or equal to q.\n% proj_psd - Projection onto the positive semidefinite cone.\n% proj_psdUTrace - Projection onto the positive semidefinite cone with fixed trace.\n% proj_Rn - \"Projection\" onto the entire space.\n% proj_Rplus - Projection onto the nonnegative orthant.\n% proj_simplex - Projection onto the simplex.\n% proj_spectral - Projection onto the set of matrices with spectral norm less than or equal to q\n% proj_maxEig - Projection onto the set of symmetric matrices with maximum eigenvalue less than 1\n% Proximity operators of general convex functions\n% prox_0 - The zero proximity function:\n% prox_boxDual - Dual function of box indicator function { l <= x <= u }\n% prox_hinge - Hinge-loss function.\n% prox_hingeDual - Dual function of the Hinge-loss function.\n% prox_l1 - L1 norm.\n% prox_Sl1 - Sorted (aka ordered) L1 norm.\n% prox_l1l2 - L1-L2 block norm: sum of L2 norms of rows.\n% prox_l1linf - L1-LInf block norm: sum of L2 norms of rows.\n% prox_l1pos - L1 norm, restricted to x >= 0\n% prox_l2 - L2 norm.\n% prox_linf - L-infinity norm.\n% prox_max - Maximum function.\n% prox_nuclear - Nuclear norm.\n% prox_spectral - Spectral norm, i.e. max singular value.\n% prox_maxEig - Maximum eigenvalue of a symmetri matrix.\n% prox_trace - Nuclear norm, for positive semidefinite matrices. Equivalent to trace.\n% Smooth functions\n% smooth_constant - Constant function generation.\n% smooth_entropy - The entropy function -sum( x_i log(x_i) )\n% smooth_handles - Smooth function from separate f/g handles.\n% smooth_huber - Huber function generation.\n% smooth_linear - Linear function generation.\n% smooth_logdet - The -log( det( X ) ) function.\n% smooth_logLLogistic - Log-likelihood function of a logistic: sum_i( y_i mu_i - log( 1+exp(mu_i) ) )\n% smooth_logLPoisson - Log-likelihood of a Poisson: sum_i (-lambda_i + x_i * log( lambda_i) )\n% smooth_logsumexp - The function log(sum(exp(x)))\n% smooth_quad - Quadratic function generation.\n% Testing functions\n% test_nonsmooth - Runs diagnostic tests to ensure a non-smooth function conforms to TFOCS conventions\n% test_proxPair - Runs diagnostics on a pair of functions to check if they are Legendre conjugates.\n% test_smooth - Runs diagnostic checks on a TFOCS smooth function object.\n% linop_test - Performs an adjoint test on a linear operator.\n% Premade solvers for specific problems (vector variables)\n% solver_L1RLS - l1-regularized least squares problem, sometimes called the LASSO.\n% solver_LASSO - Minimize residual subject to l1-norm constraints.\n% solver_SLOPE - Sorted L One Penalized Estimation (LASSO using sorted/ordered l1 norm)\n% solver_sBP - Basis pursuit (l1-norm with equality constraints). Uses smoothing.\n% solver_sBPDN - Basis pursuit de-noising. BP with relaxed constraints. Uses smoothing.\n% solver_sBPDN_W - Weighted BPDN problem. Uses smoothing.\n% solver_sBPDN_WW - BPDN with two separate (weighted) l1-norm terms. Uses smoothing.\n% solver_sDantzig - Dantzig selector problem. Uses smoothing.\n% solver_sDantzig_W - Weighted Dantzig selector problem. Uses smoothing.\n% solver_sLP - Generic linear programming in standard form. Uses smoothing.\n% solver_sLP_box - Generic linear programming with box constraints. Uses smoothing.\n% Premade solvers for specific problems (matrix variables)\n% solver_psdComp - Matrix completion for PSD matrices.\n% solver_psdCompConstrainedTrace - Matrix completion with constrained trace, for PSD matrices.\n% solver_TraceLS - Unconstrained form of trace-regularized least-squares problem.\n% solver_sNuclearBP - Nuclear norm basis pursuit problem (i.e. matrix completion). Uses smoothing.\n% solver_sNuclearBPDN - Nuclear norm basis pursuit problem with relaxed constraints. Uses smoothing.\n% solver_sSDP - Generic semi-definite programs (SDP). Uses smoothing.\n% solver_sLMI - Generic linear matrix inequality problems (LMI is the dual of a SDP). Uses smoothing.\n% Algorithm variants\n% tfocs_AT - Auslender and Teboulle's accelerated method.\n% tfocs_GRA - Gradient descent.\n% tfocs_LLM - Lan, Lu and Monteiro's accelerated method.\n% tfocs_N07 - Nesterov's 2007 accelerated method.\n% tfocs_N83 - Nesterov's 1983 accelerated method; also by Beck and Teboulle 2005 (FISTA).\n% tfocs_TS - Tseng's modification of Nesterov's 2007 method.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/continuation.m", "content": "function [ x, odata, optsOut ] = continuation( fcn, mu, x0, z0, opts, contOpts )\n% CONTINUATION Meta-wrapper to run TFOCS_SCD in continuation mode.\n% [...] = CONTINUATION( FCN, MU, X0, Z0, OPTS, CONT_OPTS )\n% is a wrapper to perform continuation on FCN, where\n% FCN is a function that calls tfocs_SCD or a tfocs solver.\n% FCN must accept input arguments MU, X0, Z0, and OPTS,\n% e.g. FCN = @(mu,x0,z0,opts) solver_sBP( A, b, mu, x0, z0, opts )\n%\n% CONT_OPTS are options that affect how continuation is performed.\n% To see the default options, call this script with no inputs.\n%\n% Options for CONT_OPTS:\n% maxIts - max # of continuation iterations\n% accel - use accelerated continuation or not\n% betaTol - every continuation iteration, the tolerance\n% is decreased by 'betaTol'\n% innerTol - every continuation iteration, except the last one,\n% is solved to this tolerance.\n% This option overrides 'betaTol'\n% tol - the outer loop will stop when either\n% 'maxIts' is reached, or when the change\n% from one step to the next is less than 'tol'.\n% If innerTol is not specified, then \"tol\" and \"betaTol\"\n% are used to determine the tolerance of intermediate solves.\n% initialTol - For use with \"tol\". This overrides betaTol, but in turn is\n% overridden by innerTol. If specified, then the first\n% problem is solved to tolerance \"initialTol\" and the final\n% problem is solved to tolerance \"tol\", and all problems\n% in between are solved to logarithmically interpolated values.\n% E.g. if maxits = 3 and initialTol = .1 and tol = .001,\n% then the tolerances are .1, .01, .001.\n% finalTol - For use with \"tol\". If \"finalTol\" is set, then \"tol\"\n% and \"betaTol\" are used to determine the tolerance of\n% intermediate solves, but the last solve is solved\n% to the \"finalTol\" tolerance.\n% innerMaxIts - maximum number of inner iterations during\n% every continuation iteration except the last one.\n% muDecrement - after every iteration, mu <-- mu*muDecrement\n% (default: muDecrement = 1, so mu is constant)\n% verbose - true (default) prints out information, false will\n% not print out any information\n%\n% As of release 1.1, you do not need to call this file directly. Instead,\n% you can specify the continuation option in TFOCS_SCD.m directly.\n% See also TFOCS_SCD.m\n\nif nargin < 6, contOpts = []; end\nkMax = setOpts('maxIts',3);\nACCEL = setOpts('accel',true);\nbetaTol = setOpts('betaTol',2);\ninnerTol= setOpts('innerTol',[] );\nstopTol = setOpts('tol',1e-3);\nfinalTol= setOpts('finalTol',[]);\nverbose = setOpts('verbose',true);\ninnerMaxIts = setOpts('innerMaxIts',[] );\ninitialTol = setOpts('initialTol',[]);\nmuDecrement = setOpts('muDecrement',1);\nfinalRestart = setOpts('finalRestart',[]); % not yet documented. usefulness?\n\nif nargin == 0\n if nargout == 0\n disp('Default options for CONTINUATION are:');\n end\n x = contOpts;\n return;\nend\n\nerror(nargchk(2,6,nargin));\nif nargin < 3, x0 = []; end\nif nargin < 4, z0 = []; end\nif nargin < 5, opts = []; end\n\n% what is the user specified stopping tolerance?\nif ~isfield(opts,'tol')\n % get the default value:\n defaultOpts = tfocs_SCD();\n opts.tol = defaultOpts.tol;\nend\nif isfield(opts,'fid'), fid = opts.fid; else fid = 1; end\n\n\nfinalTol2 = opts.tol;\nif isempty( innerTol ) && ~isempty(initialTol)\n % calculate the value of betaTol that will\n betaTol = exp( log(initialTol/finalTol2)/(kMax-1) );\nend\n% tol = finalTol2*betaTol^(kMax+1); % bug fixed Feb 2011\ntol = finalTol2*betaTol^(kMax);\n\nL0 = Inf; % for first round, use default value of stepsize\nxOld = x0;\nodataCumulative = [];\nodataCumulative.niter= 0;\nextraVerbose = verbose && (isfield(opts,'printEvery') && (opts.printEvery <= 0 ...\n || opts.printEvery == Inf ) );\nfor k = 1:kMax\n if kMax > 1 && verbose\n% fprintf(fid,'--- Continuation step %d of %d ', k, kMax );\n fprintf(fid,'--- Continuation step %d of %d, mu: %.1e', k, kMax, mu );\n if extraVerbose\n fprintf(fid,' ...');\n else\n fprintf('\\n');\n end\n end\n \n optsTemp = opts;\n if ~isempty( innerMaxIts ) && k < kMax\n optsTemp.maxIts = innerMaxIts;\n end\n tol = tol/betaTol;\n if ~isempty( innerTol ) && k < kMax\n optsTemp.tol = innerTol;\n else\n if ~isempty(finalTol) && k == kMax \n optsTemp.tol = finalTol;\n else\n optsTemp.tol = tol;\n end\n end\n if k == kMax && ~isempty( finalRestart )\n optsTemp.restart = finalRestart; \n end\n if isfinite(L0)\n optsTemp.L0 = L0;\n end\n \n % call the solver\n [x, odata, optsOut ] = fcn( mu, x0, z0, optsTemp );\n \n if iscell(x)\n % Thanks to Graham Coleman for catching this case\n if isempty(x0)\n mu2normXX = mu/2*sum(cellfun( @(x) norm(x(:))^2, x ));\n elseif iscell(x0)\n mu2normXX = mu/2*sum(cellfun( @(x) norm(x(:))^2, ...\n cellfun( @minus, x, x0,'uniformoutput',false ) ));\n else\n mu2normXX = mu/2*sum(cellfun( @(x) norm(x(:))^2, ...\n cellfun( @(x) x-x0, x, 'uniformoutput',false ) ));\n end\n else\n if isempty(x0)\n mu2normXX = mu/2*norm(x(:))^2;\n else\n mu2normXX = mu/2*norm(x(:)-x0(:))^2;\n end\n end\n \n % (possibly) decrease mu for next solve\n mu = mu*muDecrement;\n \n % Dec '13, use stepsize estimate\n L0 = 1/odata.stepsize(end);\n \n % update output data\n fields = { 'f', 'normGrad', 'stepsize','theta','counts','err' };\n for ff = fields\n f = ff{1};\n if isfield(odata,f) \n if isfield(odataCumulative,f)\n odata.(f) = [odataCumulative.(f); odata.(f)];\n end\n odataCumulative.(f) = odata.(f);\n end\n \n end\n if isfield(odata,'niter')\n % include the old iterations in the count\n odataCumulative.niter = odata.niter + odataCumulative.niter;\n odata.niter = odataCumulative.niter;\n \n % record at which iterations continuation happened\n if isfield(odataCumulative,'contLocations')\n odataCumulative.contLocations = [odataCumulative.contLocations; odata.niter];\n odata.contLocations = odataCumulative.contLocations;\n else\n odata.contLocations = odata.niter;\n odataCumulative.contLocations = odata.niter;\n end\n end\n \n if kMax > 1 && extraVerbose\n fprintf(fid,'\\b\\b\\b\\b'); % remove the \" ...\" from earlier\n end\n % if the tfocs solver is set to be quiet, but the continuation\n % script still has the \"verbose\" flag, then print out\n % some information\n if extraVerbose && isfield( odata, 'err' ) && ~isempty( odata.err )\n fprintf(fid,', errors: ');\n fprintf(fid,' %8.2e', odata.err(end,:) );\n end\n if verbose\n if extraVerbose\n fprintf(fid,', mu/2||x-x_0||^2: %.1e', mu2normXX );\n else\n fprintf(fid,'Continuation statistics: mu/2||x-x_0||^2: %.1e', mu2normXX );\n end\n \n if kMax > 1 && extraVerbose\n fprintf(fid,' ---');\n end\n fprintf(fid,'\\n');\n end\n \n \n if k == kMax, break; end\n \n % Update the prox center\n \n if ACCEL\n if iscell(x)\n if isempty(xOld) || ~iscell(xOld)\n xOld = cell( size(x) ); \n end\n x0 = cell( size(x) );\n for nCell = 1:length(x)\n if isempty(xOld{nCell}), xOld{nCell} = zeros( size(x{nCell}) ); end\n x0{nCell} = x{nCell} + (k-1)/(k+2)*( x{nCell} - xOld{nCell} );\n end\n \n else\n if isempty(xOld), xOld = zeros(size(x)); end\n x0 = x + (k-1)/(k+2)*( x - xOld );\n end\n else\n x0 = x;\n end\n \n if isa( odata.dual, 'tfocs_tuple')\n z0 = cell( odata.dual );\n else\n z0 = odata.dual;\n end\n \n \n if iscell(x)\n n1=sqrt(sum(cellfun( @(x) norm(x(:))^2, cellfun( @minus, x, xOld,'uniformoutput',false ) )));\n n2=sqrt(sum(cellfun( @(x) norm(x(:))^2, xOld )));\n else\n n1 = norm(x(:)-xOld(:));\n n2 = norm(xOld(:));\n end\n\n if n1/n2 <= stopTol && verbose\n fprintf(fid,'Continuation ending, due to convergence\\n');\n break;\n end\n xOld = x;\n if k == kMax && verbose\n fprintf(fid,'Continuation ending, due to reaching maximum number of outer iterations\\n');\n end\nend\n\n\nfunction out = setOpts(fieldName,default)\n if ~isfield(contOpts,fieldName)\n contOpts.(fieldName) = default;\n end\n out = contOpts.(fieldName);\nend\n\n\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/demos/SIAM_demo.m", "content": "%% RPCA demo using TFOCS\n% This is a demo of Robust PCA (RPCA) using . Since 2009,\n% there has been much interest in this specific RPCA formulation\n% (RPCA can refer to many different formulations; we will state\n% our formulation precisely below), but most solvers\n% assume equality constraints. One great feature of TFOCS\n% is how easy it is to prototype new formulations, so we show\n% here a formulation using inequality constraints.\n% \n% The basic (equality constraint) RPCA formulation is:\n% ( see \n% for references )\n% \n% $$ \\min_{S,L} \\|L\\|_* + \\lambda \\|S\\|_{\\ell_1} \\quad\\textrm{subject to}\\;L+S = X $$\n% \n% The idea is that some object $X$ can be broken into two components $X=L+S$,\n% where $L$ is low-rank and $S$ is sparse. To tease out this separation,\n% RPCA penalizes $\\|L\\|_*$ (the nuclear norm of $L$), which is a proxy for\n% the rank of $L$. We also penalizes $\\|S\\|_{\\ell_1}$ which is just the sum\n% of the absolute value of all the entries of the matrix $S$; this is a proxy\n% for the number of non-zero entries of $S$.\n%\n% The parameter $\\lambda$ is important, as it controls how much weight\n% to put on $S$ relative to $L$. This parameter is not overly sensitive,\n% and we picked the value used in this demo by a few quick rounds of trial-and-error.\n%\n% _Code by Stephen Becker, May 2011_\n\n%% Inequality constraints\n% In this demo, $X$ is a video. In particular, each column of $X$ is the set\n% of $m n$ pixels from a $m \\times n$ pixel frame of the video, reshaped\n% so that it is now a vector instead of a matrix.\n%\n% The particular video we use is not compressed using a video codec, so\n% each frame of the video is stored. This leads to huge files, so to save\n% a bit of space, the value of each pixel is stored as an 8 bit number,\n% which means we can think of it as a value from $0,1,2,\\ldots,255$. Now,\n% we may imagine that there is some \"true\" video where each pixel\n% is a _real_ number between $[0,255]$, and that we see a quantized version of it.\n% It would be nice to apply RPCA to this true version instead of applying \n% it to the quantized version. In particular, it is unlikely that the quantized\n% version can be split nicely into a low-rank and sparse component.\n% To account for this quantization, we will ask that $S+L$ is not exactly equal\n% to $X$, but rather that $S+L$ agrees with $X$ up to the precision\n% of the quantization. The quantization can induce at most an error of .5 in\n% the pixel value (e.g. true value is 5.6, which is rounded to 6.0, so an error of .4;\n% or a true value of 6.4, which is also rounded to 6.0, so also an error of 0.4).\n% A nice way to capture this is via the $\\ell_\\infty$ norm.\n%\n% So, the inequality constrained version of RPCA uses the same objective\n% function, but instead of the constraints $L+S=X$, the constraints are\n%\n% $$ \\|L+S-X\\|_{\\ell_\\infty} \\le 0.5. $$\n\n%% Numerical demo\n% We demonstrate this on a video clip taken from a surveillance\n% camera in a subway station. Not only is there a background\n% and a foreground (i.e. people), but there is an escalator\n% with periodic motion. Conventional background subtraction\n% algorithms would have difficulty with the escalator, but \n% this RPCA formulation easily captures it as part of the low-rank\n% structure.\n% The clip is taken from the data at this website (after\n% a bit of processing to convert it to grayscale):\n% http://perception.i2r.a-star.edu.sg/bk_model/bk_index.html\n\n% Load the data:\ndisp('Please download the escalator_data.m (3.7 MB) file from:')\ndisp(' http://cvxr.com/tfocs/demos/rpca/escalator_data.mat');\nload escalator_data % contains X (data), m and n (height and width)\nX = double(X);\n\n% addpath ~/Dropbox/TFOCS/ % add TFOCS to your path, so change this to suit your computer\n\n\n%%\nnFrames = size(X,2);\n\nlambda = 1e-2;\n\nopts = [];\nopts.stopCrit = 4;\nopts.printEvery = 1;\nopts.tol = 1e-4;\n\nopts.maxIts = 25;\n\nopts.errFcn{1} = @(f,d,p) norm(p{1}+p{2}-X,'fro')/norm(X,'fro');\n\nlargescale = false;\n\nfor inequality_constraints = 0:1\n\n \n if inequality_constraints\n % if we already have equality constraint solution,\n % it would make sense to \"warm-start\":\n% x0 = { LL_0, SS_0 };\n % but it's more fair to start all over:\n x0 = { X, zeros(size(X)) };\n z0 = [];\n else\n x0 = { X, zeros(size(X)) };\n z0 = [];\n end\n \n \n obj = { prox_nuclear(1,largescale), prox_l1(lambda) };\n affine = { 1, 1, -X };\n \n mu = 1e-4;\n if inequality_constraints\n epsilon = 0.5;\n dualProx = prox_l1(epsilon);\n else\n dualProx = proj_Rn;\n end\n \n tic\n % call the TFOCS solver:\n [x,out,optsOut] = tfocs_SCD( obj, affine, dualProx, mu, x0, z0, opts);\n toc\n \n % save the variables\n LL =x{1};\n SS =x{2};\n if ~inequality_constraints\n z0 = out.dual;\n LL_0 = LL;\n SS_0 = SS;\n end\n \nend % end loop over \"inequality_constriants\" variable\n\n%% show all together in movie format\n% If you run this in your own computer, you can see the movie. On the webpage,\n% we have a youtube version of the video.\n% The top row is using equality constraints, and the bottom row\n% is using inequality constraints.\n% The first column of both rows is the same (i.e. it is the original image).\nmat = @(x) reshape( x, m, n );\nfigure();\ncolormap( 'Gray' );\nk = 1;\nfor k = 1:nFrames\n \n imagesc( [mat(X(:,k)), mat(LL_0(:,k)), mat(SS_0(:,k)); ...\n mat(X(:,k)), mat(LL(:,k)), mat(SS(:,k)) ] );\n \n axis off\n axis image\n \n drawnow;\n pause(.05); \n \n if k == round(nFrames/2)\n snapnow; % Take a single still snapshot for publishing the m file to html format\n end\nend\n\n%% Is there a difference between the two versions?\n% Compare the equality constrained version and the inequality\n% constrained version. To do this, we can check whether\n% the \"L\" components are really low rank\n% and whether the \"S\" components are really sparse.\n% Even if the two versions appear visually similar, the variables\n% may behave quite differently with respect to low-rankness\n% and sparsity.\n\nfprintf('\"S\" from equality constrained version has \\t%.1f%% nonzero entries\\n',...\n 100*nnz(SS_0)/numel(SS_0) );\nfprintf('\"S\" from inequality constrained version has \\t%.1f%% nonzero entries\\n',...\n 100*nnz(SS)/numel(SS) );\n\ns = svd(LL); % inequality constraints\ns0 = svd(LL_0); % equality constraints\n\nfprintf('\"L\" from equality constrained version has numerical rank\\t %d (of %d possible)\\n',...\n sum( s0>1e-6), min( m*n, nFrames) );\nfprintf('\"L\" from inequality constrained version has numerical rank\\t %d (of %d possible)\\n',...\n sum( s > 1e-6), min( m*n, nFrames) );\n\nfigure();\nsemilogy( s0 ,'o-') \nhold all;\nsemilogy( s ,'o-')\nlegend('Equality constraints','Inequality constraints');\nxlabel('sorted singular value location');\nylabel('value of singular value');\ntitle('Comparison of RPCA using equality and inequality constraints');\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/demos/callandmap.m", "content": "function varargout = callandmap(fcn, ix, varargin)\n%CALLANDMAP Call a function and rearrange its output arguments\n% varargout = callandmap( fcn, ix, varargin )\n%\n% Suggested here:\n% http://stackoverflow.com/questions/3673392/define-anonymous-function-as-2-of-4-outputs-of-m-file-function\n\ntmp = cell(1,max(ix)); % Capture up to the last argout used\n[tmp{:}] = fcn(varargin{:}); % Call the original function\nvarargout = tmp(ix); % Remap the outputs\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/demos/demo_MatrixCompletion.m", "content": "%% Matrix completion demo\n% This short demo shows how to use TFOCS to perform nuclear norm minimization.\n% Nuclear norm minimization is used for recovering all the entries of \n% a partially observed low-rank matrix.\n\n%% Setup a problem\nrng(234923); % for reproducible results\nN = 16; % the matrix is N x N\nr = 2; % the rank of the matrix\ndf = 2*N*r - r^2; % degrees of freedom of a N x N rank r matrix\nnSamples = 3*df; % number of observed entries\n\n% For this demo, we will use a matrix with integer entries\n% because it will make displaying the matrix easier.\niMax = 5;\nX = randi(iMax,N,r)*randi(iMax,r,N); % Our target matrix\n\n%%\n% Now suppose we only see a few entries of X. Let \"Omega\" be the set\n% of observed entries\nrPerm = randperm(N^2); % use \"randsample\" if you have the stats toolbox\nomega = sort( rPerm(1:nSamples) );\n\n%%\n% Print out the observed matrix in a nice format.\n% The \"NaN\" entries represent unobserved values. The goal\n% of this demo is to find out what those values are!\n\nY = nan(N);\nY(omega) = X(omega);\ndisp('The \"NaN\" entries represent unobserved values');\ndisp(Y)\n\n%% Matrix completion via TFOCS\n% We use nuclear norm relaxation. There are strong theorems that\n% show this relaxation will usually give you the *exact* original low-rank\n% matrix provided that certain conditions hold. However, these\n% conditions are generally not possible to check 'a priori',\n% so I cannot guarantee that this will work. But by choosing\n% enough measurements, it becomes increasingly likely to work.\n\n% Add TFOCS to your path (modify this line appropriately):\naddpath ~/Dropbox/TFOCS/\n\nobservations = X(omega); % the observed entries\nmu = .001; % smoothing parameter\n\n% The solver runs in seconds\ntic\nXk = solver_sNuclearBP( {N,N,omega}, observations, mu );\ntoc\n\n%%\n% To display the recovered matrix, let's round it to the nearest\n% .0001 so that it displays nicely:\ndisp('Recovered matrix (rounding to nearest .0001):')\ndisp( round(Xk*10000)/10000 )\n\n% and for reference, here is the original matrix:\ndisp('Original matrix:')\ndisp( X )\n\n% The relative error (without the rounding) is quite low:\nfprintf('Relative error, no rounding: %.8f%%\\n', norm(X-Xk,'fro')/norm(X,'fro')*100 );\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/demos/demo_SVM.m", "content": "%% Support Vector Machine (SVM) example\n%\n% We have binary data, and the two classes are labeled +1 and -1.\n% The data is d-dimensional, and we have n samples\n% \n% \n% This example show show to solve the standard SVM using the hinge-loss\n% and l2 penalty. Then it shows how it is easy with TFOCS to generalize\n% the SVM problem and use the l1 penalty instead of the l2 penalty,\n% which has the effect of encouraging sparsity.\n% \n% For a more detailed example, see the /examples/largescale/demo_SVM.m\n% code in the TFOCS release.\n\n% Before running this, please add the TFOCS base directory to your path\naddpath ~/Dropbox/TFOCS/\n\n%% Generate a new problem\n\nrandn('state',23432);\nrand('state',3454);\n\nn = 30;\nd = 2; % 2D data is nice because it's easy to visualize\n\nn1 = round(.5*n); % number of -1 (this is data from one \"class\")\nn2 = n - n1; % number of +1 (this is data from the other \"class\")\n\n% Generate data\nmean1 = [-.5,1];\n% mean2 = [.6,.2]; % can be separated\nmean2 = [.1,.5]; % cannot be separated, so a bit more interesting\ns = .25; % standard deviation\nx1 = repmat(mean1,n1,1) + s*randn(n1,2);\nx2 = repmat(mean2,n2,1) + s*randn(n2,2);\n\nX = [x1; x2];\nlabels = [ ones(n1,1); -ones(n2,1) ];\n\n% Plot the data:\nfigure(1); clf;\nhh = {};\nhh{1}=plot(x1(:,1), x1(:,2), 'o' );\nhold all\nhh{2}=plot(x2(:,1), x2(:,2), '*' );\nlegend('Class 1','Class 2');\nxl = get(gca,'xlim');\nyl = get(gca,'ylim');\nlegend([hh{1:2}],'Class 1','Class2');\n%% Introduce the SVM problem formulations\n% The hinge-loss can be defined in Matlab as:\nhinge = @(x) sum(max(0,1-x));\n%%\n% To see what it looks like:\ngrid = linspace(-2,2,30);\nfigure(2); \nplot( grid, max(0,1-grid) )\nylim( [-.5,3] ); set(gcf,'Position',[100,100,350,250] );\n%%\n% Then the standard SVM in primal form is the following:\n%\n% minimize_{m,b} hinge( labels.*( X*m - b ) ) + lambda_A*norm(m,2)\n%\n% where X is the data matrix (dimensions n x d ), m is the slope (dimension d x 1 ),\n% and b is an offset (dimension 1 for our example).\n% \n% To put this in a more amenable format, introduce the variable \"a\"\n% and let a = [m;b], so \"a\" has dimensions (d+1) x 1.\n% Then we can express \"X*m-b\" as \"[X,-ones(n,1)]*a\".\n% For this reason, we introduce the following linear operator:\nlinearF = diag(labels)*[ X, -ones(n,1) ];\n\n%%\n% So now, the problem is:\n%\n% minimize_{a} hinge( linearF*a ) + lambda_A*norm( [ones(d,1); 0] * a )\n%\n% (in the \"norm\" term, we want a 0 term in front of a(d+1) since we \n% do not wish to penalize the norm of the constant offset).\n%\n% A reasonable value of lambda_A is:\nlambda_A = 10;\n\n%% Introduce the sparse SVM formulation\n% The sparse SVM is designed to induce sparsity in the slope variable\n% m by replacing the lambda_A*norm(m,2) term with a lambda_B*norm(m,1)\n% term, since the l1 term drives small coefficients to zero.\n% Here's a reasomable value for lambda_B:\nlambda_B = 4;\n\n%% Solve SVM\nmu = 1e-2; % smoothing parameter\n%%\n% Dualize the hinge loss and the l2 terms:\nprox = { prox_hingeDual(1,1,-1), proj_l2(lambda_A) };\n%%\n% Make the affine operator:\noffset1 = [];\nlinearF2 = diag( [ones(d,1);0] );\noffset2 = [];\naffineF = { linearF, offset1; linearF2, offset2 };\nak = tfocs_SCD([],affineF, prox, mu);\n\n%% \n% Plot\nm = ak(1:2); % slope\nb = ak(3); % intercept\ngrid = linspace(-.5,1,100);\nfigure(1);\nhh{3} = plot( grid, (b-m(1)*grid)/m(2) );\nxlim(xl); ylim(yl);\nlegend([hh{1:3}],'Class 1','Class2','SVM');\n\n%% Solve Sparse SVM\nPROBLEM = 2;\nmu = 1e-2; % smoothing parameter\nopts = [];\nopts.tol = 1e-3;\n%%\n% Dualize the hinge loss to get 'prox_hingeDual'\n% For the hingeDual, scale by -1 since we want polar cone, not dual cone\n% Dualize the l1 term to get the linf term\nprox = { prox_hingeDual(1,1,-1), proj_linf(lambda_B) };\nlinearF2 = diag( [ones(d,1);0] );\nak = tfocs_SCD([],{linearF,[];linearF2,[]}, prox, mu,[],[],opts);\n\n%% \n% Plot\nm = ak(1:2); % slope\nb = ak(3); % intercept\ngrid = linspace(-.5,1,100);\nhh{4} = plot( grid, (b-m(1)*grid)/m(2) );\nxlim(xl); ylim(yl);\nlegend([hh{:}],'Class 1','Class2','SVM','sparse SVM');\n\n%%\n% You can see that the sparse SVM hyperplane is vertical! This is because\n% only the x-component is zero, and only the y-component is non-zero.\n% So it is \"sparse\" (though in this 2D example, \"sparsity\" doesn't mean\n% much). For larger dimensional data, the idea is that identifying\n% a hyperplane that only has a few non-zeros will allow you to identify\n% which dimensions are actually important.\n\n%%\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/demos/demo_alternatingProjections.m", "content": "%% Projection onto the intersection of two sets \n% Our goal is to find a point in the intersection of two convex sets C1 and C2.\n% A similar goal is to find the projection of an arbitrary point onto the \n% intersection (or if the intersection is empty, find the point(s) in C1\n% that are as close as possible to C2). In this demo, the intersection\n% of C1 and C2 is a singleton, so the concepts are the same.\n%\n% We assume that we know how to project on the sets C1 and C2 individually,\n% but not onto C1 intersect C2.\n%\n% The basic algorithm to solve this problem is the alternating projection method,\n% first studied by John von Neumann for the case where C1 and C2 are affine\n% spaces. This algorithm can be extended to arbitrary convex sets, although\n% you may not converge to the *projection* of the original point.\n%\n% This algorithm is very simple: starting at some point y, and with x <-- y,\n% we update\n% x <-- Proj_{C1}( Proj_{C2}( x ) )\n% where Proj_{C1} is the projector onto the set C1.\n%\n% Better methods (which actually give you the projection of y onto the intersection)\n% are based on Dykstra's algorithm (not to be confused with the Dijkstra algorithm\n% described here: http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm ).\n%\n% Dykstra's algorithm also uses only Proj_{C1} and Proj_{C2}, but with a few\n% intermediate steps. For an overview, see the 2011 book by Raydan:\n% http://www.amazon.com/Alternating-Projection-Methods-Fundamentals-Algorithms/dp/1611971934\n%\n% Another overview of both alternating projection and Dykstra are in the book chapter\n% \"Proximal splitting methods in signal processing\" by P. L. Combettes and J.-C. Pesquet, \n% in the book 'Fixed-Point Algorithms for Inverse Problems in Science and Engineering',\n% (ed.: H. H. Bauschke, R. S. Burachik, P. L. Combettes, V. Elser, D. R. Luke, and \n% H. Wolkowicz, Editors), pp. 185-212. Springer, New York, 2011.\n% The chapter can be downloaded at http://www.ann.jussieu.fr/~plc/prox.pdf\n%\n% The purpose of this demo is to show the above two methods, and also\n% how to formulate this with TFOCS. The advantage of solving this with TFOCS\n% is that we can use an accelerated solver (Nesterov-style) and use large\n% step-sizes and line search (whereas Dykstra has no step-size parameter).\n% In the first example, it is especially apparent that TFOCS avoids\n% the slow convergence that both the alternating projection and Dykstra\n% algorithms suffer from. In the second example, the performance\n% of alternating projections and TFOCS are quite similar.\n\n%% Mathematical formulation\n% For a given point y, and two convex sets C1 and C2, we wish to find\n% the closest point x to y, such that x is in both C1 and C2. We write this\n% as:\n%\n% $$ \\textrm{minimize}_{x\\in C_1 \\cap C_2} \\,\\, \\mu/2||x\\textrm{--}y||_2^2 $$\n%\n% The parameter $\\mu > 0$ is arbitrary and does not affect the answer.\n%\n% This fits naturally into the TFOCS formulation since the primal\n% problem is already strongly convex.\n\n\n\n%% Demo with two polygon sets in 2D that intersect at (0,0)\n% Set the dimension to 2\nN = 2; % 2D is best for visualization\n\n%%\n% Define some 2D polygons\n\nmx = 1;\nx1a = [1;.1];\nx1b = [1;.2];\nxx1 = [0,x1a(1),2*mx,x1b(1)];\nyy1 = [0,x1a(2),2*mx,x1b(2)];\n\n\nx2a = [1;.3];\nx2b = [1;.35];\nxx2 = [0,x2a(1),2*mx,x2b(1)];\nyy2 = [0,x2a(2),2*mx,x2b(2)];\n\n%%\n% The solution is at x = (0,0), so our error function is simple\n\nerr = @(x) norm(x);\n%%\n% plot the regions\n\nfigure\nred = [255,153,153]/255;\nblue = [204,204,255]/255;\nfill( xx1, yy1,red); \nhold on\nfill( xx2, yy2,blue); \n\nxlim( [0,mx] ); ylim( [0,.5*mx] ); \naxis equal\ntext(.5,.07,'set C1');\ntext(.5,.22,'set C2');\n\n%%\n% Make some operators that will be used with TFOCS\n\naddpath ~/Dropbox/TFOCS/ % modify this to wherever it is installed on your computer\nop1 = project2DCone(x1a, x1b );\nop2 = project2DCone(x2a, x2b );\n\noffset1 = 0;\noffset2 = 0;\nop1_d = prox_dualize(op1);\nop2_d = prox_dualize(op2);\n\n% and some simpler operators that we will use with alternating projections\n% and with Dykstra\nproj1 = @(x) callandmap( op1, 2, x, 1); % gamma is irrelevant\nproj2 = @(x) callandmap( op2, 2, x, 1 ); % gamma is irrelevant\n\n% for all methods, we need to specify a starting point\n\nx0 = [1; 1/4];\n\n\n%% solve in TFOCS\n% We can pick any mu and should get the same result, although due to \n% some scaling issues in stopping criteria, it does have a small effect.\nmu = 1e-6; \n\nopts = struct('debug',false,'printEvery',20,'maxIts',200);\nopts.errFcn{1} = @(f,d,x) err(x);\nopts.errFcn{2} = @(f,d,x) recordPoints(x);\nrecordPoints(); % zero-out counter. We use this to plot the points later\n\nopts.tol = 1e-15;\n\naffineOperator = {eye(N),offset1;eye(N),offset2};\ndualProx = {op1_d,op2_d};\n% Solve in TFOCS:\n[x,out,optsOut] = tfocs_SCD( [], affineOperator, dualProx , mu, x0, [], opts );\n\n% Record the path:\npath = recordPoints();\npath = [x0,path];\n\nfigure\nsubplot(1,2,1);\nfill( xx1, yy1,red); \nhold on\nfill( xx2, yy2,blue); \nxlim( [0,mx] ); ylim( [0,.5*mx] ); \ntext(.5,.07,'set C1');\ntext(.5,.22,'set C2');\nplot( path(1,:), path(2,:),'ko-','linewidth',2 )\ntitle('Path for TFOCS solving the intersection of 2 polygons');\n\nsubplot(1,2,2);\nsemilogy( out.err(:,1) ,'o-'); xlabel('iterations'); ylabel('error');\ntitle('Error for TFOCS method');\nset(gcf, 'Position', [400 200 800 400]);\n%% solve via alternating projection method\nmaxIts = 500;\nx = x0;\npath = [x0];\nerrHist = [];\nfor k = 1:maxIts\n % basic alternating projection method:\n x = proj1(x);\n path= [path, x];\n x = proj2(x);\n path= [path, x];\n errHist = [ errHist; err(x) ];\n if ~mod(k,50)\n fprintf('Iter %4d, error is %.2e\\n', k, errHist(end) );\n end\nend\nfigure\nsubplot(1,2,1);\nfill( xx1, yy1,red); \nhold on\nfill( xx2, yy2,blue); \nxlim( [0,mx] ); ylim( [0,.5*mx] ); \ntext(.5,.07,'set C1');\ntext(.5,.22,'set C2');\nplot( path(1,:), path(2,:),'ko-','linewidth',1 )\ntitle('Path for alternating projection method solving the intersection of 2 polygons');\n\nsubplot(1,2,2);\nsemilogy( errHist, 'o-' ); xlabel('iterations'); ylabel('error');\nerrHist_1 = errHist;\ntitle('Error for alternating projection method');\nset(gcf, 'Position', [400 200 800 400]);\n%% solve via Dykstra's algorithm\n\nmaxIts = 500;\nx = x0;\n[p,q] = deal( 0*x0 );\np = -.25*[1;1];\npath = [x0];\nerrHist = [];\nfor k = 1:maxIts\n % If x + p is feasible, the y = (x+p), so p=x+p-y = 0.\n y = proj1( x + p );\n p = x + p - y;\n x = proj2( y + q );\n q = y + q - x;\n path = [path,y,x];\n errHist = [ errHist; err(x) ];\n if ~mod(k,50)\n fprintf('Iter %4d, error is %.2e\\n', k, errHist(end) );\n end\nend\nfigure\nsubplot(1,2,1);\nfill( xx1, yy1,red); \nhold on\nfill( xx2, yy2,blue); \nxlim( [0,mx] ); ylim( [0,.5*mx] ); \ntext(.5,.07,'set C1');\ntext(.5,.22,'set C2');\nplot( path(1,:), path(2,:),'ko-' )\ntitle('Path for Dykstra''s algo solving the intersection of 2 polygons');\n\nsubplot(1,2,2);\nsemilogy( errHist, 'o-' ); xlabel('iterations'); ylabel('error');\ntitle('Error for Dykstra''s method');\nset(gcf, 'Position', [400 200 800 400]);\n\n%%\n% With Dykstra's algo (and alternating projections), we get\n% very slow convergence, because of the very low angle between the\n% two sets. Here is a zoom in on the graph of the iterates:\nfigure\nfill( xx1, yy1,red); \nhold on\nfill( xx2, yy2,blue); \nxlim( [0,mx] ); ylim( [0,.5*mx] ); \ntext(.5,.07,'set C1');\ntext(.5,.22,'set C2');\nplot( path(1,:), path(2,:),'ko-' )\ntitle('Path for Dykstra''s algo solving the intersection of 2 polygons (zoom)');\nxlim( [.25,.4] );\nylim( [.058,.1])\n%% Plot all the errors together\nfigure\nsemilogy( out.err(:,1),'-' ,'linewidth',3);\nhold all\nsemilogy( errHist_1,'-','linewidth',3);\nsemilogy( errHist,'--','linewidth',3);\nlegend('TFOCS','Alternating projection','Dykstra');\nxlabel('iteration'); ylabel('error');\n%% Demo with two circles that intersect at (0,0)\ncenter1 = [0;.5];\nradius1 = .5;\ncenter2 = -center1;\nradius2 = radius1;\n\nfigure\nrectangle('Position',[-radius1,0,2*radius1,2*radius1],'Curvature',[1,1],'FaceColor',red)\nrectangle('Position',[-radius1,-2*radius2,2*radius1,2*radius1],'Curvature',[1,1],'FaceColor',blue)\naxis equal\nhold on\ntext(0,.5,'set C1');\ntext(0,-.5,'set C2');\n\n\noffset1 = center1;\noffset2 = center2;\n\nop1_d = prox_l2(radius1);\nop2_d = prox_l2(radius2);\nx0 = [1; .2];\n\n% and some simpler operators that we will use with alternating projections\n% and with Dykstra\nproj1 = @(x) radius1*(x-center1)/norm(x-center1) + center1;\nproj2 = @(x) radius2*(x-center2)/norm(x-center2) + center2;\n%% solve in TFOCS\nopts.maxIts = 300;\naffineOperator = {eye(N),offset1;eye(N),offset2};\ndualProx = {op1_d,op2_d};\n% Solve in TFOCS:\n[x,out,optsOut] = tfocs_SCD( [], affineOperator, dualProx , mu, x0, [], opts );\n\n% Record the path:\npath = recordPoints();\npath = [x0,path];\n% Plot:\nfigure\nsubplot(1,3,1);\nrectangle('Position',[-radius1,0,2*radius1,2*radius1],'Curvature',[1,1],'FaceColor',red)\nrectangle('Position',[-radius1,-2*radius2,2*radius1,2*radius1],'Curvature',[1,1],'FaceColor',blue)\nhold on\ntext(0,.5,'set C1');\ntext(0,-.5,'set C2');\nplot( path(1,:), path(2,:),'ko-','linewidth',2 )\ntitle('Path for TFOCS solving the intersection of 2 circles');\n\nsubplot(1,3,2);\nrectangle('Position',[-radius1,0,2*radius1,2*radius1],'Curvature',[1,1],'FaceColor',red)\nrectangle('Position',[-radius1,-2*radius2,2*radius1,2*radius1],'Curvature',[1,1],'FaceColor',blue)\nhold on\nplot( path(1,:), path(2,:),'ko-','linewidth',2 )\nxlim([0,.15]);\nylim([-.1,.1]);\ntitle('(zoom)');\n\nsubplot(1,3,3);\nsemilogy( out.err,'o-')\ntitle('Error of iterates for TFOCS method');\nset(gcf, 'Position', [400 200 800 400]);\n%% solve via alternating projection method\nmaxIts = 300;\nx = x0;\npath = [x0];\nerrHist = [];\nfor k = 1:maxIts\n % basic alternating projection method:\n x = proj1(x);\n path= [path, x];\n x = proj2(x);\n path= [path, x];\n errHist = [ errHist; err(x) ];\n if ~mod(k,50)\n fprintf('Iter %4d, error is %.2e\\n', k, errHist(end) );\n end\nend\nfigure\nsubplot(1,3,1);\nrectangle('Position',[-radius1,0,2*radius1,2*radius1],'Curvature',[1,1],'FaceColor',red)\nrectangle('Position',[-radius1,-2*radius2,2*radius1,2*radius1],'Curvature',[1,1],'FaceColor',blue)\nhold on\ntext(0,.5,'set C1');\ntext(0,-.5,'set C2');\nplot( path(1,:), path(2,:),'ko-' )\ntitle('Path for alternating projection method solving the intersection of 2 circles');\n\nsubplot(1,3,2);\nrectangle('Position',[-radius1,0,2*radius1,2*radius1],'Curvature',[1,1],'FaceColor',red)\nrectangle('Position',[-radius1,-2*radius2,2*radius1,2*radius1],'Curvature',[1,1],'FaceColor',blue)\nhold on\nplot( path(1,:), path(2,:),'ko-','linewidth',2 )\nxlim([0,.15]);\nylim([-.1,.1]);\ntitle('(zoom)');\n\nsubplot(1,3,3);\nsemilogy( errHist,'o-')\nerrHist_1 = errHist;\ntitle('Error of iterates for alternating projection method');\nset(gcf, 'Position', [400 200 800 400]);\n%% solve via Dykstra's algorithm\n\nmaxIts = 300;\nx = x0;\n[p,q] = deal( 0*x0 );\npath = [x0];\nerrHist = [];\nfor k = 1:maxIts\n % If x + p is feasible, the y = (x+p), so p=x+p-y = 0.\n y = proj1( x + p );\n p = x + p - y;\n x = proj2( y + q );\n q = y + q - x;\n path = [path,y];\n path = [path,x];\n errHist = [ errHist; err(x) ];\n if ~mod(k,50)\n fprintf('Iter %4d, error is %.2e\\n', k, errHist(end) );\n end\nend\nfigure\nsubplot(1,3,1);\nrectangle('Position',[-radius1,0,2*radius1,2*radius1],'Curvature',[1,1],'FaceColor',red)\nrectangle('Position',[-radius1,-2*radius2,2*radius1,2*radius1],'Curvature',[1,1],'FaceColor',blue)\nhold on\ntext(0,.5,'set C1');\ntext(0,-.5,'set C2');\nplot( path(1,:), path(2,:),'ko-' )\ntitle('Path for Dykstra''s algo solving the intersection of 2 circles');\n\nsubplot(1,3,2);\nrectangle('Position',[-radius1,0,2*radius1,2*radius1],'Curvature',[1,1],'FaceColor',red)\nrectangle('Position',[-radius1,-2*radius2,2*radius1,2*radius1],'Curvature',[1,1],'FaceColor',blue)\nhold on\nplot( path(1,:), path(2,:),'ko-','linewidth',2 )\nxlim([0,.15]);\nylim([-.1,.1]);\ntitle('(zoom)');\n\nsubplot(1,3,3);\nsemilogy( errHist,'o-')\ntitle('Error of iterates for Dykstra''s algo');\nset(gcf, 'Position', [400 200 800 400]);\n\n%% Plot all the errors together\nfigure\nsemilogy( out.err(:,1),'-' ,'linewidth',3);\nhold all\nsemilogy( errHist_1,'-','linewidth',3);\nsemilogy( errHist,'--','linewidth',3);\nlegend('TFOCS','Alternating projection','Dykstra');\nxlabel('iteration'); ylabel('error');\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/demos/project2DCone.m", "content": "function op = project2DCone(x1, x2 )\n% OP = project2DCone( y, x1, x2 )\n% represents the 2D point cone defined\n% by the vectors x1 and x2. x1 should be \"left\" of x2,\n% and the cone is defined as the region to the right\n% of x1 and to the left of x2.\n\nerror(nargchk(1,2,nargin));\nif nargin < 2, u = []; end\n%op = @proj_Rplus_impl;\n% bugfix, March 2011:\nop = @(varargin)proj_cone2(x1,x2,varargin{:});\n\nfunction [v,x] = proj_cone2(x1,x2,y,t)\n% \"t\" doesn't matter, since the only values are 0 and Inf\nv = 0;\nif size(y,2) > 1, y = y.'; end\n\n% Assume that \"x1\" is active\nn1 = [x1(2); -x1(1)]; % the normal direction\nt1 = -y'*n1/(n1'*n1);\n\n\n% Now assume \"x2\" is active:\nn2 = [x2(2); -x2(1)];\nt2 = -y'*n2/(n2'*n2);\n\nswitch nargin,\n case 3,\n if nargout == 2,\n error( 'This function is not differentiable.' );\n end\n if ( t1 > 0 ) && ( t2 < 0 )\n v = 0;\n else\n v = Inf;\n end\n case 4,\n if y'*x1 <= 0 && y'*x2 <= 0\n x = 0*y; v = 0;\n return;\n end\n \n p1 = y + t1*n1;\n p2 = y + t2*n2;\n \n % now determine which one is active:\n if p1'*x1 < 0\n % p1 cannot be active\n x = p2;\n elseif p2'*x2 < 0\n % p2 cannot be active\n x = p1;\n elseif ( t1 > 0 ) && ( t2 < 0 )\n % we are feasible!\n x = y;\n else\n % both could be active, so pick the best: \n if norm( p1 - y ) < norm( p2 - y )\n x = p1;\n else\n x = p2;\n end\n end\n\n\n\totherwise,\n\t\terror( 'Wrong number of arguments.' );\nend\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/demos/recordPoints.m", "content": "function er = recordPoints( x )\n\npersistent history\n\nif nargin == 0\n er = history;\n history = [];\n return;\nend\n\nhistory = [history, x ];\ner = 0;\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/largescale/PsiTransposeWFF.m", "content": "function y = PsiTransposeWFF(x,w_type,log_length,min_scale,max_scale,shift_redundancy,freq_redundancy, PLOT)\n% Windowed Fourier Frame Analysis\n% y = PsiTransposeWFF( x, w_type, log_length, min_scale, max_scale,...\n% shift_redundancy, freq_redundancy, plot )\n% w_type is the type of window. Currently, this supports 'isine' (iterate sine)\n% and 'gaussian'. Default: 'isine' (to use default, set this to [] ).\n%\n% Core code written by Peter Stobbe; modifications by Stephen Becker\nif isempty(w_type), w_type = 'isine'; end\nif nargin < 8 || isempty(PLOT), PLOT = false; end\n\n% w is a is a vector of with the window of the largest scale\n% smaller scale windows are just this subsampled\n[w, window_redundancy] = make_window(max_scale,w_type);\n\ny = [];\nc = ((max_scale - min_scale + 1)*window_redundancy*2.^((1:max_scale)'+freq_redundancy+shift_redundancy)).^-.5;\n \n \nfor k = min_scale:max_scale\n M = 2^(log_length-k) +(2^(log_length-k)+1)*(2^shift_redundancy-1);\n z = [myRepMat(x,2^shift_redundancy); zeros(2^k - 2^(k-shift_redundancy),2^shift_redundancy)];\n z = reshape(z,2^k,M);\n z = z.*myRepMat(w(2^(max_scale-k)*(1:2^k)'),M);\n z(2^(k+freq_redundancy),M) = 0;\n z = fft(z);\n z = [z(1,:)*c(k); real(z(2:end/2,:))*c(k-1); ...\n z(end/2+1,:)*c(k); imag(z(end/2+2:end,:))*c(k-1)];\n y = [y; z(:)];\nend\n\nfunction B = myRepMat(A,n)\nB = A(:,ones(n,1));\n\nfunction [w,window_redundancy] = make_window(max_scale,w_type)\n% [w,window_redundancy] = make_window(max_scale,w_type)\n% w_type can be\n% 'isine' for iterated sine\n% 'gaussian' for gaussian\n% 'trapezoid' for trapezoidal shape (not a frame)\n\nx = (1:2^max_scale)'/2^(max_scale-1)-1;\nif isequal(w_type,'isine')\n w = sin(pi/4*(1+cos(pi*x)));\n window_redundancy = 1/2;\nelseif isequal(w_type,'gaussian')\n w = exp(-x.^2*8*log(2));\n window_redundancy = mean(w.^2);\nelseif isequal(w_type,'trapezoid')\n w = min(1,2*(1-abs(x)));\n window_redundancy = mean(w.^2);\nelse\n disp('Error in make_window: unknown window type');\n disp('Options are: isine, gaussian, trapezoid');\nend\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/largescale/PsiWFF.m", "content": "function x = PsiWFF(y,w_type,log_length,min_scale,max_scale,shift_redundancy,freq_redundancy);\n% Windowed Fourier Frame Synthesis\n% x = PsiWFF(y,w_type,log_length,min_scale,max_scale,shift_redundancy,freq_redundancy);\n% w_type is the type of window. Currently, this supports 'isine' (iterate sine)\n% and 'gaussian'. Default: 'isine' (to use default, set this to [] ).\n% written by Peter Stobbe, modified by Stephen Becker\n\nif isempty(w_type), w_type = 'isine'; end\n\n% w is a is a vector of with the window of the largest scale\n% smaller scale windows are just this subsampled\n[w, window_redundancy] = make_window(max_scale,w_type);\n\nx = zeros(2^log_length,1);\nc = ((max_scale - min_scale + 1)*window_redundancy*2.^((1:max_scale)'+freq_redundancy+shift_redundancy)).^-.5;\ncur = 0;\n\n\nfor k = min_scale:max_scale\n M = 2^(log_length-k) +(2^(log_length-k)+1)*(2^shift_redundancy-1);\n N = 2^(k+freq_redundancy);\n z = reshape(y(cur + (1:N*M)),N,M);\n cur = cur + N*M;\n z = [z(1,:)*c(k); z(2:N/2,:)*c(k-1);...\n z(N/2+1,:)*c(k); -1i*z(N/2+2:N,:)*c(k-1)];\n z = real(fft(z));\n z = z(1:2^k,:).*myRepMat(w(2^(max_scale-k)*(1:2^k)),M);\n z = reshape(z,[],2^shift_redundancy);\n x = x + sum(z(1:2^log_length,:),2);\nend\n\n\n%---------------\n\nfunction B = myRepMat(A,n)\nB = A(:,ones(n,1));\n\nfunction [w,window_redundancy] = make_window(max_scale,w_type)\n% [w,window_redundancy] = make_window(max_scale,w_type)\n% w_type can be\n% 'isine' for iterated sine\n% 'gaussian' for gaussian\n% 'trapezoid' for trapezoidal shape (not a frame)\n\nx = (1:2^max_scale)'/2^(max_scale-1)-1;\nif isequal(w_type,'isine')\n w = sin(pi/4*(1+cos(pi*x)));\n window_redundancy = 1/2;\nelseif isequal(w_type,'gaussian')\n w = exp(-x.^2*8*log(2));\n window_redundancy = mean(w.^2);\nelseif isequal(w_type,'trapezoid')\n w = min(1,2*(1-abs(x)));\n window_redundancy = mean(w.^2);\nelse\n disp('Error in make_window: unknown window type');\n disp('Options are: isine, gaussian, trapezoid');\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/largescale/example_quantumTomography.m", "content": "%{\n 5/28/09, 10/28/10\n pauli-matrix tensor measurements\n Stephen Becker, srbecker@caltech.edu\n\n See http://arxiv.org/abs/0909.3304\n\nWe seek to find a low-rank matrix X, because X represents the quantum state\nof d atoms (X has dimensions n x n where n = 2^d, due to quantum entanglement).\nX is Hermitian and positive semi-definite, and furthermore trace(X) = 1.\n\nFrom experiments, we have measurements b_i = < A_i, X > where <,> is the \ntrace inner product. A_i is a Hermitian matrix, and is a tensor product\nof Pauli matrices. The observations are noisy.\n\nTo recover X, we can consider solving several related variants:\n\nnotation:\nx = vec(X), X = mat(x)\n\n\n minimize 1/2||A*x - b ||^2\n subject to\n mat(x) >= 0\n trace(mat(x)) <= 1\n\n(this variant does not require smoothing)\n\nor\n\n minimize trace(mat(x))\n subject to\n mat(x) >= 0\n ||A*x - b || <= eps\n(this variant requires smoothing and/or continuation )\n\n%}\n%% Setup a matrix\nrandn('state',2009);\nrand('state',2009);\n\n% -- Generate the state matrix \"M\" (aka rho)\nn1 = 128; % fast\n% n1 = 256;\n% n1 = 512; % works, but slow\nn2 = n1; r = 2;\nM = ( randn(n1,r) + 1i*randn(n1,r) )*...\n ( randn(r,n2) + 1i*randn(r,n2) )/2;\nM=M*M'; % M is Pos. Semidefinite\nM = M / trace(M); % and has trace 1\n\ndf = r*(n1+n2-r); % The degrees of freedom\noversampling = 5; % Information-theoretic limit corresponds\n % to oversampling = 1\nm = min(5*df,round(.99*n1*n2) ); \n\nfprintf('%d x %d matrix, %d measurements (%.1f%%, or %.1f oversampling)\\n',...\n n1,n2,m,100*m/(n1*n2),m/df );\nfprintf('True rank is %d\\n', r);\nif ~isreal(M), fprintf('Matrix is complex\\n'); end\n\nvec = @(x) x(:);\nmat = @(x) reshape(x,n1,n2);\n\n%% make some pauli matrices, to use for observations\n%{\nUsing the convention:\n PX = [0,1;1,0]; PY = [0,-1i;1i,0]; PZ =[1,0;0,-1]; PI = eye(2);\n X will be labelled \"1\", Y labeled \"2\", Z \"3\" and I \"4\"\n%}\nmyRandint = @(M,N,d) ceil(d*rand(M,N));\n\nPAULI_T = sparse([],[],[],n1*n2,m,m*n1 );\nfprintf('Taking measurements... ');\nfor i=1:m\n fprintf('\\b\\b\\b\\b\\b\\b%5.1f%%', 100*i/m );\n % pick from the X, Y, Z and I uniformly at random\n list = myRandint( log2(n1),1,4 );\n E_i = explicitPauliTensor( list );\n % NOTE: with this definition, E_i is Hermitian,\n % but not positive semidefinite, and not scaled properly.\n \n PAULI_T(:,i) = E_i(:); % access via column is MUCH faster\nend\nfprintf('\\n');\nPAULI = PAULI_T.'; % transpose it, since we were implicitly\nclear PAULI_T % dealing with transpose earlier\n % (since updating the columns of a sparse\n % matrix is much more efficient than updating\n % the rows ) \n \nfprintf('Computing the scaling factor...');\n% scale = 1/normest(PAULI*PAULI',1e-2);\n% scale = 1/my_normest( @(x) PAULI*(PAULI'*x), size(PAULI,1)*[1,1] );\nfprintf(' done.\\n');\n\ndata = PAULI*vec(M);\n% even if measurements are complex, data should still be real\nfprintf('due to roundoff, measurements have %.2e imaginary part\\n',...\n norm(imag(data))/norm(data) );\ndata = real(data);\n\n%% Add some noise\n%{\n Physics of noise:\n in addition to noise from measurement error, we have a dominant\n source of 'noise' which is because the outcome of our\n measurements is really the result of measuring a quantum wave\n function. Experimentalists will repeat the same\n measurement many times, so they can estimate the true state,\n but there is inherent quantum mechanical uncertainty to this.\n Basically, we have a state that is determined by a Bernoulli\n parameter 0 < p < 1, but the measurement returns either 0 or 1,\n so we have to take a lot of measurements to estimate p.\n\n There's also depolarizing noise, which we don't discuss here.\n\n For simplicity in this example, we don't worry about that model,\n and just add in some pseudo-random white noise\n%}\n\nmyAwgn = @(x,snr) x + ...\n 10^( (10*log10(sum(abs(x(:)).^2)/length(x(:))) - snr)/20 )*randn(size(x));\nsnr = 40;\nb = myAwgn( data, snr );\nrms = @(x) norm(x)/sqrt(length(x));\nsnrF = @(sig,noise) 20*log10( rms(sig)/rms(noise) );\nsigma = std( b - data );\nfprintf('SNR of measurements is %.1f dB, and std of noise is %.2f\\n',...\n snrF(data,data-b), sigma );\n%% Solve in TFOCS\n%{\n\nFormulation:\n minimize 1/2||PAULI*x - b ||^2\n subject to\n mat(x) >= 0\n trace(mat(x)) <= 1\n\nNo smoothing is required, but... it's hard to exploit the low-rank\nstructure of the problem\n\nWe do not expect the \"error\" to go to zero, since the data are noisy\nand we don't have the true answer, so we're not really looking\nat \"error\" of the software, but rather modelling error...\n\n%}\nopts = [];\nopts.maxIts = 300;\nopts.printEvery = 25;\nif n1 > 256\n opts.maxIts = 50;\n opts.printEvery = 5;\nend\nopts.errFcn = {@(f,x) norm( vec(x) - vec(M) )/norm(M,'fro')};\n% this may be slow:\n% opts.errFcn{2} = @(f,x) rank(mat(x));\n\ntau = 1; % constraint on trace\nx0 = [];\n\nA = linop_matrix( PAULI, 'C2R' );\n[x,out,optsOut] = tfocs(smooth_quad,{A,-b}, proj_psdUTrace(tau) , x0, opts );\nX = mat(x);\n\nfigure(1);\nsemilogy( out.err(:,1) );\nhold all\n%% Solve in TFOCS\n%{\n\nFormulation:\n minimize trace(mat(x)) + mu/2*||x-x0||^2\n subject to\n mat(x) >= 0\n ||PAULI*x - b || <= eps\n\nWe solve this via a dual method, hence the mu term.\nWe can reduce its effect by using continuation (i.e. updating x0)\n\n%}\nopts = [];\nopts.maxIts = 50;\nopts.printEvery = 25;\nopts.errFcn = {@(f,dual,x) norm( vec(x) - vec(M) )/norm(M,'fro')};\n% this may be slow:\n% opts.errFcn{2} = @(f,dual,x) rank(mat(x));\nopts.stopCrit = 4;\nopts.tol = 1e-8;\ncontOpts = [];\ncontOpts.betaTol = 10;\ncontOpts.maxIts = 5;\n\nepsilon = norm(b-data); % cheating a bit...\nx0 = [];\nz0 = [];\nmu = 5;\n\nlargescale = ( n1*n2 >= 256^2 );\n% obj = prox_nuclear(1,largescale); % works, but unnecessarily general\nobj = prox_trace(1,largescale);\n\nprox = prox_l2(epsilon);\nA = linop_matrix( PAULI, 'C2R' );\nI = [];\nIt = linop_handles({ [n1,n2],[n1*n2,1] }, vec, mat, 'C2C' );\nA = linop_compose( A, It );\n\n[x,out,opts] = tfocs_SCD( obj,{ A, -b; I, 0 }, {prox, proj_psd}, mu, x0, z0, opts, contOpts );\nX = mat(x);\n\nfprintf('Error is %.2e, error after renormalizing is %.2e\\n',...\n opts.errFcn{1}(1,1,X), opts.errFcn{1}(1,1,X/trace(X) ) );\nfprintf('Rank of X is %d\\n', rank(X) );\n\nfigure(1);\nsemilogy( out.err(:,1) );\nhold all\nsemilogy(out.contLocations, out.err(out.contLocations,1), 'o' );\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/largescale/explicitPauliTensor.m", "content": "function u = explicitPauliTensor( list )\n% u = explicitPauliTensor( list )\n% makes the explicit matrix corresponding to the tensor\n% product of Pauli matrices.\n% \"list\" should be an ordered vector, where each entry is\n% either 1, 2, 3 or 4, correspodning to the X, Y, Z and I\n% Pauli matrices, respectively.\n\nif ~isvector(list) || max(list) > 4 || min(list) < 1\n error('Error making Pauli matrices');\nend\n\nPX = [0,1;1,0]; PY = [0,-1i;1i,0]; PZ =[1,0;0,-1]; PI = eye(2);\n\nPAULI{1} = PX;\nPAULI{2} = PY;\nPAULI{3} = PZ;\nPAULI{4} = PI;\n\nu=1;\nfor i = 1:length(list)\n u = kron( u, sparse( PAULI{list(i)} ));\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/largescale/findWeights.m", "content": "function w = findWeights( coeff, p )\n% weights = findWeights( coefficients, p )\n% creates a nice vector of reweighting coefficients\n% for use with re-weighted l1.\n% The regularization parameter is chosen to be the coefficient\n% that accounts for p-percent (0 1\n error('p must be a scalar between [0,1]' );\nend\n\ncoeff = abs(coeff);\ncoeffSort = sort(coeff,'descend');\nc = cumsum( coeffSort.^2 );\nindx = find( c/c(end) > p, 1, 'first' );\nif ~isempty(indx)\n delta = coeffSort( indx );\nelse\n delta = 1e-15;\nend\n\nw = delta./( coeff + delta );\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/largescale/image_denoising_withSPOT.m", "content": "%{\n Tests total-variation problem and l1 analysis\n on a large-scale example\n\n min_x alpha*||x||_TV + beta*||Wx||_1\ns.t.\n || A(x) - b || <= eps\n\nwhere W is a wavelet operator.\n\n\nThis requires:\n\n (1) SPOT www.cs.ubc.ca/labs/scl/spot/\n (2) Wavelab www-stat.stanford.edu/~wavelab/ \nand optionally,\n (3) CurveLab www.curvelet.org/\n\n Also demonstrates how to use SPOT with TFOCS.\n To install SPOT, please visit:\n http://www.cs.ubc.ca/labs/scl/spot/\n\n We use SPOT to call WaveLab and CurveLab,\n which may need to be installed separately.\n Please contact the TFOCS and/or SPOT authors if you need help.\n\n Also, SPOT v1.0 has a typo in its curvelet code:\n after adding SPOT to your path, edit this file\n edit spotbox-1.0p/opCurvelet\n and change all instances of \"fdct_c2v\" and \"fdct_v2c\"\n to \"spot.utils.fdct_c2v\" and \"spot.utils.fdct_v2c\", resp.\n\n%}\n\n% Setting up the various packages (change this for your computer):\naddpath ~/Dropbox/TFOCS/\naddpath ~/Documents/MATLAB/spotbox-1.0p/\naddpath ~/Documents/MATLAB/CurveLab-2.1.2/fdct_wrapping_cpp/mex/\n\nmyAwgn = @(x,snr) x +10^( (10*log10(sum(abs(x(:)).^2)/length(x(:))) - snr)/20 )*...\n randn(size(x));\n%% Load an image and take noisy measurements\n\n\nn1 = 256;\nn2 = 256;\nN = n1*n2;\nx = phantom(n1);\n\n% Signal-to-noise ratio, in dB\nsnr = 5;\n\n\nx_original = x;\nmat = @(x) reshape(x,n1,n2);\n% vec = @(x) x(:);\n\n% Add noise:\nrandn('state',245); rand('state',245);\nx_noisy = myAwgn( x_original, snr);\n\nmaxI = max(vec(x_original)); % max pixel value\nPSNR = @(x) 20*log10(maxI*sqrt(N)/norm(vec(x)-vec(x_original) ) );\n\n% Take measurements\nb = vec(x_noisy);\nb_original = vec(x_original);\nEPS = .8*norm(b-b_original);\n\nfigure(2); imshow( [x_original, x_noisy] ); drawnow;\nM=N;\nfprintf('Denoising problem, %d x %d, signal has SNR %d dB\\n',M, N, round(snr) );\n\nREWEIGHT = false; % whether to do one iteration of reweighting or not\n%% Call the TFOCS solver\n\nmu = 5;\ner = @(x) norm(x(:)-x_original(:))/norm(x_original(:));\nopts = [];\nopts.errFcn = @(f,dual,primal) er(primal);\nopts.maxIts = 100;\nopts.printEvery = 20;\nopts.tol = 1e-4;\nopts.stopcrit = 4;\n\nx0 = x_noisy;\nz0 = []; % we don't have a good guess for the dual\n\n% build operators:\nA = linop_handles([N,N], @(x)x, @(x) x );\nnormA2 = 1;\nW_wavelet = linop_spot( opWavelet(n1,n2,'Daubechies') );\nif exist('fdct_wrapping')\n DO_CURVELETS = true;\n W_curvelet = linop_spot( opCurvelet(n1,n2) );\nelse\n % You either don't have curvelab installed\n % or you need to add it to the matlab path.\n DO_CURVELETS = false;\nend\nW_tv = linop_TV( [n1,n2] );\nnormWavelet = linop_normest( W_wavelet );\nif DO_CURVELETS, normCurvelet = linop_normest( W_curvelet ); end\nnormTV = linop_TV( [n1,n2], [], 'norm' );\n\ncontOpts = [];\ncontOpts.maxIts = 4;\n\n%% -- First, solve just via wavelet --\nclc; disp('WAVELETS');\n[x_wavelets,out_wave] = solver_sBPDN_W( A, W_wavelet, b, EPS, mu, ...\n x0(:), z0, opts, contOpts);\n\nif REWEIGHT\n % do some re-weighting:\n coeff = W_wavelet( x_wavelets, 1 );\n weights = findWeights( coeff, .85 );\n W_weights = linop_handles( [length(weights),length(weights)], @(x)weights.*x,...\n @(y) weights.*y, 'R2R' );\n [x_wavelets,out_wave] = solver_sBPDN_W( A, ...\n linop_compose(W_weights,W_wavelet), ...\n b, EPS, mu, x_wavelets, out_wave.dual, opts, contOpts);\n % and of course, you could keep iterating...\nend\n%% -- Second, solve just via curvelets --\nif DO_CURVELETS\n opts_copy = opts;\n opts_copy.maxIts = 10;\n opts_copy.normA2 = 1;\n opts_copy.normW2 = normCurvelet^2;\n clc; disp('CURVELETS');\n [x_curvelets,out_curve] = solver_sBPDN_W( A, W_curvelet, b, EPS, mu, x0(:), z0, opts_copy);\n \n if REWEIGHT\n % do some re-weighting:\n coeff = W_curvelet( x_curvelets, 1 );\n weights = findWeights( coeff, .85 );\n W_weights = linop_handles( [length(weights),length(weights)], @(x)weights.*x,...\n @(y) weights.*y, 'R2R' );\n % really, we should update the norm of W, since it is changing slightly\n % by adding in the weights, but that is a slow calculation, and the norm\n % doesn't change too much, so we skip that.\n [x_curvelets,out_curve] = solver_sBPDN_W( A, ...\n linop_compose(W_weights,W_curvelet), ...\n b, EPS, mu, x_curvelets, out_curve.dual, opts_copy);\n end\nend\n\n%% -- Third, solve just via TV --\nclc; disp('TV');\nopts_copy = opts;\nopts_copy.normA2 = 1;\nopts_copy.normW2 = normTV^2;\nopts_copy.continuation = false;\n[x_tv,out_tv] = solver_sBPDN_W( A, W_tv, b, EPS, mu, x0(:), z0, opts_copy, contOpts);\n\nif REWEIGHT\n % do some re-weighting:\n coeff = W_tv( x_tv, 1 );\n weights = findWeights( coeff, .95 );\n W_weights = linop_handles( [length(weights),length(weights)], @(x)weights.*x,...\n @(y) weights.*y, 'C2C' );\n % really, we should update the norm of W, since it is changing slightly\n % by adding in the weights, but that is a slow calculation, and the norm\n % doesn't change too much, so we skip that.\n [x_tv,out_tv] = solver_sBPDN_W( A, ...\n linop_compose(W_weights,W_tv), ...\n b, EPS, mu, x_tv, out_tv.dual, opts_copy);\nend\n%% -- Fourth, combine wavelets (or curvelets) and tv --\nalpha = 1; % weight of TV term\nbeta = .05; % weight of wavelet term\nnormW12 = normTV^2;\nif DO_CURVELETS, normW22 = normCurvelet^2; beta = .5;\nelse, normW22 = normWavelet^2; end\n\n% x =solver_sBPDN_WW( A, alpha, W_tv, beta, ...\n% W_wavelet, b, EPS, mu,vec(x0), z0, opts, contOpts);\n\n% this is what solver_sBPDN_WW is doing:\nW1 = W_tv;\nif DO_CURVELETS\n W2 = W_curvelet;\nelse\n W2 = W_wavelet;\nend\nprox = { prox_l2( EPS ), ...\n proj_linf( alpha ),...\n proj_linf( beta ) };\naffine = { A, -b; W1, 0; W2, 0 };\n\n% x = tfocs_SCD( [], affine, prox, mu, x0(:), z0, opts, contOpts );\n% X_wavelets_tv = mat(x);\n%% try with box constraints\n% Constrain the image pixels to be in the range 0 <= x <= 1\nprox = { prox_l2( EPS ), ...\n proj_linf( alpha ),...\n proj_linf( beta ), ...\n proj_Rplus , ...\n proj_Rplus};\n\naffine = { A, -b; W1, 0; W2, 0 ; 1, 0; -speye(n1*n2), maxI*ones(n1*n2,1) };\n\nx_wavelets_tv = tfocs_SCD( [], affine, prox, mu, x0(:), z0, opts, contOpts );\nfprintf('Min and max entry of recovered image are %.1f and %.1f\\n', min(min(x_wavelets_tv)),...\n max(max(x_wavelets_tv)) );\n%% another way to use box constraints\n% Instead of thinking of it as two scaled X >= 0 constraints,\n% we call the special purpose atom\n\nprox = { prox_l2( EPS ), ...\n proj_linf( alpha ),...\n proj_linf( beta ), ...\n prox_boxDual(0,maxI,-1) };\n \naffine = { A, -b; W1, 0; W2, 0 ; 1, 0 };\nopts_copy = opts;\nopts_copy.continuation = false;\nopts_copy.maxIts = 30;\n[x_wavelets_tv,out] = tfocs_SCD( [], affine, prox, mu, x0(:), z0, opts_copy, contOpts );\n\nif REWEIGHT\n % do some re-weighting:\n weights = findWeights( W1(x_wavelets_tv,1), .95 );\n W_weights1 = linop_handles( [length(weights),length(weights)], @(x)weights.*x,...\n @(y) weights.*y, 'C2C' );\n weights = findWeights( W2(x_wavelets_tv,1), .95 );\n W_weights2 = linop_handles( [length(weights),length(weights)], @(x)weights.*x,...\n @(y) weights.*y, 'C2C' );\n\n affine = { A, -b; linop_compose(W_weights1,W1), 0; ...\n linop_compose(W_weights2,W2) , 0 ; -1, 0 }; % Note: we need the \"-1\", not +1\n [x_wavelets_tv,out] = tfocs_SCD( [], affine, prox, mu, x0(:), out.dual, opts_copy, contOpts );\n\nend\nfprintf('Min and max entry of recovered image are %.1f and %.1f\\n', min(min(x_wavelets_tv)),...\n max(max(x_wavelets_tv)) );\n%% Plot everything\nfigure(1); clf;\nsplot = @(n) subplot(2,3,n);\n\nsplot(1);\nimshow(x_original);\ntitle(sprintf('Noiseless image,\\nPSNR %.1f dB', Inf ));\n\nsplot(2);\nimshow(x_noisy);\ntitle(sprintf('Noisy image,\\nPSNR %.1f dB', PSNR(x_noisy) ));\n\nif DO_CURVELETS\n splot(3);\n imshow(mat(x_curvelets));\n title(sprintf('Curvelet regularization,\\nPSNR %.1f dB', PSNR(x_curvelets) ));\nend\n\nsplot(4);\nimshow(mat(x_wavelets));\ntitle(sprintf('Wavelet regularization,\\nPSNR %.1f dB', PSNR(x_wavelets) ));\n\nsplot(5);\nimshow(mat(x_tv));\ntitle(sprintf('TV regularization,\\nPSNR %.1f dB', PSNR(x_tv) ));\n\nsplot(6);\nimshow(mat(x_wavelets_tv));\nif DO_CURVELETS\n title(sprintf('Curvelets + TV, and box constraints,\\nPSNR %.1f dB', PSNR(x_wavelets_tv) ));\nelse\n title(sprintf('Wavelets + TV, and box constraints,\\nPSNR %.1f dB', PSNR(x_wavelets_tv) ));\nend\n\n%% Bonus: movie.\n% This uses the helper file \"plotNow.m\" to show you the image\n% at every iteration. It slows down the algorithm on purpose\n% so that you have time to watch it.\nfigure(2); clf; plotNow();\ntime_delay = 0.1;\nopts.errFcn = {@(f,d,p) er(p), @(f,d,p) plotNow( mat(p), time_delay) };\nx_tv = solver_sBPDN_W( A, W_tv, b, EPS, .1*mu, vec(x0), z0, opts);\ntitle('THAT''S ALL FOLKS');\n%%\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/largescale/plotNow.m", "content": "function out = plotNow( x, pause_t , plotFcn )\n% out = plotNow( x, pause_t )\n% helper function for plotting a movie during\n% the TFOCS iterations.\n% Call this function with no inputs in order\n% to reset it.\n% Call this with a matrix and it will plot it using \"imshow\".\n%\n% The input \"pause_t\" controls how long to pause\n% (this is useful when solving a small problem that would\n% otherwise progress too fast between iterates).\n% \n% out = plotNow( x, pause_t, plotFcn )\n% will plot \"x\" using \"plotFcn\" instead of the default \"imshow\"\n\npersistent counter\nif isempty(counter)\n counter = 0;\nend\nif nargin == 0\n counter = 0;\n return;\nend\ncounter = counter + 1;\n\nif nargin < 3 || isempty(plotFcn), plotFcn = @(x) imshow(x); end\n\nplotFcn(x);\ntitle(sprintf('Iteration %2d',counter));\ndrawnow\n\nif nargin > 1 && ~isempty(pause_t)\n pause(pause_t);\nend\n\nout = 0;\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/largescale/test_SVM.m", "content": "%{\n Support Vector Machine (SVM) example\n\n This is not a largescale test but it's neat, so it's in this directory\n\n We have binary data, and the two classes are labeled +1 and -1\n The data is d-dimensional, and we have n samples\n\n\n This example show show to solve the standard SVM using the hinge-loss\n and l2 penalty. Then it shows how it is easy with TFOCS to generalize\n the SVM problem and use the l1 penalty instead of the l2 penalty,\n which has the effect of encouraging sparsity.\n\n%}\n\n% Before running this, please add the TFOCS base directory to your path\n\n\n% Generate a new problem\n\nrandn('state',23432);\nrand('state',3454);\n\nn = 30;\nd = 2; % 2D data is nice because it's easy to visualize\n\nn1 = round(.5*n); % number of -1 (this is data from one \"class\")\nn2 = n - n1; % number of +1 (this is data from the other \"class\")\n\n% Generate data\nmean1 = [-.5,1];\n% mean2 = [.6,.2]; % can be separated\nmean2 = [.1,.5]; % cannot be separated, so a bit more interesting\ns = .25; % standard deviation\nx1 = repmat(mean1,n1,1) + s*randn(n1,2);\nx2 = repmat(mean2,n2,1) + s*randn(n2,2);\n\nX = [x1; x2];\nlabels = [ ones(n1,1); -ones(n2,1) ];\n\nfigure(1); clf;\nhh = {};\nhh{1}=plot(x1(:,1), x1(:,2), 'o' );\nhold all\nhh{2}=plot(x2(:,1), x2(:,2), '*' );\nlegend('Class 1','Class 2');\nxl = get(gca,'xlim');\nyl = get(gca,'ylim');\n\n%% compute a separating hyperplane with SVM\n% First, we use CVX to get a reference solution\n\nhinge = @(x) sum(max(0,1-x));\nlambda_1 = 10;\nlambda_2 = 4;\n\nif exist( 'cvx_begin','file')\n \n% -- Problem 1: standard SVM in primal form\nPROBLEM = 1;\ncvx_begin\n cvx_quiet true\n cvx_precision best\n variables a(d) b(1)\n minimize hinge( labels.*( X*a - b ) ) + lambda_1*norm(a,2)\ncvx_end\nSLOPE{PROBLEM} = a;\nINTERCEPT{PROBLEM} = b;\n\n% -- Problem 2: \"sparse\" SVM (use l1 norm as penalty)\nPROBLEM = 2;\ncvx_begin\n cvx_quiet true\n cvx_precision best\n variables a(d) b(1)\n minimize hinge( labels.*( X*a - b ) ) + lambda_2*norm(a,1)\ncvx_end\nSLOPE{PROBLEM} = a;\nINTERCEPT{PROBLEM} = b;\n\n% An equivalent way to solve via method 2:\n% X_aug = [diag(labels)*X, -labels ]; % include the \"b\" variable\n% cvx_begin\n% variables a(d+1)\n% minimize hinge( X_aug*a ) + lambda_2*norm(a(1:2),1)\n% cvx_end\n\nelse\n % load the pre-computed reference solutions\n lambda_1 = 10;\n lambda_2 = 4;\n SLOPE = { [ -1.084604434515675; 0.783281331181009]; ...\n [ -2.391008972722243; 0] };\n INTERCEPT = { [0.75708813868169] ; [0.260615633092470] };\nend\n\n%% plot the separating hyper-planes\nfor PROBLEM = 1:length(SLOPE)\n a = SLOPE{PROBLEM}; b = INTERCEPT{PROBLEM};\n \n if abs(a(2)/a(1)) < 1e-10\n % vertical line:\n hh{PROBLEM+2}=line( [1,1]*b/a(1), [-.3,2] );\n else\n grid = linspace(-.5,1,100);\n hh{PROBLEM+2}=plot( grid, (b-a(1)*grid)/a(2) );\n end\nend\nlegend([hh{:}],'Class 1','Class2','SVM','sparse SVM');\nxlim(xl); ylim(yl);\n\n%% Solve Problem 2 in TFOCS\nPROBLEM = 2;\nlinearF = diag(labels)*[ X, -ones(n,1) ];\nobjF = prox_l1(lambda_2*[1,1,0]'); \n% objF = prox_l1(lambda_2);\nprox = prox_hingeDual(1,1,-1); % but use -x since we want polar cone, not dual cone\n\nmu = 1e-2;\nopts = [];\nopts.maxIts = 1500;\nopts.continuation = false;\nopts.stopCrit = 4;\nopts.tol = 1e-12;\nopts.errFcn = @(f,d,x) norm( x - [SLOPE{PROBLEM};INTERCEPT{PROBLEM}] );\nx0 = zeros(d+1,1); % i.e. 3 for 2D SVM\ny0 = zeros(n,1);\n[ak,out,optsOut] = tfocs_SCD( objF,linearF, prox, mu,x0,y0,opts); \n% an alternative way to call it:\n% [ak,out,optsOut] = tfocs_SCD( objF,{linearF,[]}, prox, mu,x0,y0,opts);\n\n%% Solve Problem 2 in TFOCS a different way\n% We dualize the l1 term now\nPROBLEM = 2;\nprox2 = { prox, proj_linf(lambda_2) };\nlinearF2 = diag( [ones(d,1);0] );\nopts.errFcn = @(f,d,x) norm( x - [SLOPE{PROBLEM};INTERCEPT{PROBLEM}] );\n[ak,out,optsOut] = tfocs_SCD([],{linearF,[];linearF2,[]}, prox2, mu,[],[],opts);\n\n\n%% Solve Problem 1 in TFOCS\n% Keep l1 term in primal; this is an \"experimental\" feature\n% since the l1 proximity operator is not exactly in closed form\n% (it relies on a 1D linesearch; this should be very fast, but \n% it could have numerical issues for very high accuract solutions)\nPROBLEM = 1;\nobjF = prox_l2(lambda_1*[1,1,0]'); \nopts.errFcn = @(f,d,x) norm( x - [SLOPE{PROBLEM};INTERCEPT{PROBLEM}] );\n% opts.tol = 1e-16;\nopts.continuation = true;\nmu2 = 10*mu;\n[ak,out,optsOut] = tfocs_SCD( objF,linearF, prox, mu2,[],[],opts); \n\n%% Solve Problem 1 in TFOCS a different way\n% Dualize the l2 term\nPROBLEM = 1;\nprox2 = { prox, proj_l2(lambda_1) };\nlinearF2 = diag( [ones(d,1);0] );\nopts.errFcn = @(f,d,x) norm( x - [SLOPE{PROBLEM};INTERCEPT{PROBLEM}] );\nopts.tol = 1e-15;\nopts.continuation = false;\n[ak,out,optsOut] = tfocs_SCD([],{linearF,[];linearF2,[]}, prox2, mu,[],[],opts);\n\n\n\n\n%%\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/largescale/test_sBPDN_W_largescale.m", "content": "%{\n Tests the \"analysis\" form of basis pursuit de-noising\n\n min_x ||Wx||_1\ns.t.\n || A(x) - b || <= eps\n\nThis version uses a realistic problem\n\nsee also test_sBP.m and test_sBPDN.m and test_sBPDN_W.m\n\nThis example requires PsiTransposeWFF.m and PsiWFF.m (should be included in this directory)\n\n%}\n\n% Before running this, please add the TFOCS base directory to your path\n\n\nHANDEL = load('handel'); % This comes with Matlab\nx_original = HANDEL.y; % It's a clip from Handel's \"Hallelujah\"\nFS = HANDEL.Fs; % The sampling frequency in Hz\n\nPLAY = input('Play the original music clip? (y/n) ','s');\nif strcmpi(PLAY,'y') || strcmpi(PLAY,'yes')\n sound( x_original );\nend\nN = length(x_original);\n% Simplest to use signals of size 2^k for any integer k > 0\n% So, padd the signal with zeros at the end\nk = nextpow2(N);\nk = k-1;\nx_original = [x_original(1:min(N,2^k)); zeros(2^k-N,1) ];\nN_short = N;\nN = 2^k;\n\n% We'll perform denoising. Measurement is the identity.\nM = N;\nAf = @(x) x;\nAt = Af;\nnormA = 1;\nA = linop_handles( [M,N], Af, At );\n% linop_test(A)\n\nmyAwgn = @(x,snr) x + ...\n 10^( (10*log10(sum(abs(x(:)).^2)/length(x(:))) - snr)/20 )*randn(size(x));\n\nsnr = 10; % in dB\nb_exact = Af(x_original);\nx_noisy = myAwgn(x_original,snr);\nb = Af(x_noisy);\n\nPLAY = input('Play the noisy music clip? (y/n) ','s');\nif strcmpi(PLAY,'y') || strcmpi(PLAY,'yes')\n sound( x_noisy );\nend\n\nEPS = norm( b - b_exact );\nfprintf('||b-Ax||/||b|| is %.2f\\n', EPS/norm(b) );\n\n%% SETUP AN ANALYSIS OPERATOR\n% The PsiWFF and PsiTransposeWFF code is a Gabor frame\n% (i.e. a short-time Fourier transform)\n% written by Peter Stobbe\n% \n% PsiWFF is the synthesis operator, and acts on coefficients\n% PsiTransposeWFF is the analysis operator, and acts on signals\ngMax = 0;\n% gMax = -8; % 2.6e-1 er with -8\ngLevels = 1 - gMax;\ntRedundancy = 1;\nfRedundancy = 0;\n\ngWindow = 'isine';\nlogN = log2(N);\npsi = @(y) PsiWFF(y,gWindow,logN,logN-gLevels,logN+gMax,tRedundancy,fRedundancy);\npsiT = @(x) PsiTransposeWFF(x,gWindow,logN,logN-gLevels,logN+gMax,tRedundancy,fRedundancy);\n\nx = x_original;\ny = psiT(x);\nx2 = psi(y);\nd = length(y);\n% The frame is tight, so the psuedo-inverse is just the transpose:\nfprintf('Error in PSI(PSI^* x ) - x is %e; N = %d, d = %d, d/N = %.1f\\n', ...\n norm(x-x2),N,d,d/N);\n\nnormW = 1;\nW = linop_handles([d,N], psiT, psi );\nlinop_test(W)\n%% Call the TFOCS solver\n\nx0 = x_noisy;\nmu = .5*norm(psiT(x0),Inf);\nnorm_x_orig = norm(x_original);\ner_signal = @(x) norm(x-x_original)/norm_x_orig;\n\nopts = [];\nopts.errFcn = @(f,dual,primal) er_signal(primal);\nopts.maxIts = 80;\nopts.tol = 1e-6;\nopts.normA2 = normA^2;\nopts.normW2 = normW^2; % both of these are 1\nopts.printEvery = 20;\nz0 = []; % we don't have a good guess for the dual\ntic;\n\nW_weighted = W;\n% do some reweighting\nfor rw = 1:2\n \n % This is the old method of doing continuation. The current version\n % supports a simpler way to make the solver use continuation;\n % for an example, see \"example_LinearProgram.m\" in the examples/smallscale directory.\n solver = @(mu,x0,z0,opts) solver_sBPDN_W( A, W_weighted, b, EPS, mu, x0, z0, opts );\n contOpts = [];\n contOpts.maxIts = 1;\n [ x, out, optsOut ] = continuation( solver, mu, x0, z0, opts,contOpts );\n \n % update weights\n coeff = psiT(x);\n cSort = sort(abs(coeff),'descend');\n cutoff = cSort( find( cumsum(cSort.^2)/sum(cSort.^2) >= .9, 1 ) );\n weights = 1./( abs(coeff) + cutoff );\n weightsMatrix = spdiags(weights,0,d,d);\n W_weighted = linop_compose( weightsMatrix , W );\n opts.normW2 = []; % let the solver estimate it for us\n \n x0 = x;\n z0 = cell( out.dual );\nend\n\n\ntime_TFOCS = toc;\n\nfprintf('Denoised signal has error %.2e, noisy signal has error %.2e\\n',...\n er_signal(x), er_signal(x_noisy) );\n%%\nPLAY = input('Play the recovered signal music clip? (y/n) ','s');\nif strcmpi(PLAY,'y') || strcmpi(PLAY,'yes')\n sound( x );\nend\nPLAY = input('Play the noisy music clip? (y/n) ','s');\nif strcmpi(PLAY,'y') || strcmpi(PLAY,'yes')\n sound( x_noisy );\nend\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/largescale/test_sTV_Analysis_largescale.m", "content": "%{\n Tests total-variation problem and l1 analysis\n on a large-scale example\n\n min_x alpha*||x||_TV + beta*||Wx||_1\ns.t.\n || A(x) - b || <= eps\n\nwhere W is a wavelet operator.\nThe solvers solve a regularized version\n\nsee also test_sBP.m and test_sBPDN_W.m and test_sTV.m and test_sTV_largescale.m\n\nThis version has no reference solution.\n\nThis code uses continuation\n\nRequires wavelet toolbox and image processing toolbox\n\n%}\n\n% Before running this, please add the TFOCS base directory to your path\n\n\n% Generate a new problem\n\nrandn('state',245);\nrand('state',245);\n\n% image = 'phantom';\nimage = 'bugsbunny';\n\nswitch image\n case 'phantom'\n n = 256;\n n1 = n;\n n2 = n;\n % n2 = n-1; % testing the code with non-square signals\n N = n1*n2;\n n = max(n1,n2);\n x = phantom(n);\n x = x(1:n1,1:n2);\n \n% snr = -5; % SNR in dB\n snr = 5;\n case 'bugsbunny'\n % Image is from wikimedia commons:\n % http://commons.wikimedia.org/wiki/File:Falling_hare_bugs.jpg\n load BugsBunny\n x = bugs;\n [n1,n2] = size(x);\n N = n1*n2;\n \n snr = 15; % SNR in dB\nend\nx_original = x;\n\nmat = @(x) reshape(x,n1,n2);\nvec = @(x) x(:);\n\n% -- Choose what kind of measurements you want:\nmeasurements = 'identity'; % for denoising\n\nswitch measurements\n case 'identity'\n M = N;\n Af = @(x) x;\n At = @(x) x;\nend\n\n% treat X as n1*n2 x 1 vector?\nVECTOR = true;\n% or treat X as n1 x n2 matrix?\n% VECTOR = false;\n\nif VECTOR\n A = linop_handles([M,N], Af, At );\n VEC = vec;\nelse\n Af = @(x) vec(Af(x));\n At = @(x) mat(At(x));\n A = linop_handles({[n1,n2],[M,1]}, Af, At );\n VEC = @(x) x;\nend\n \n \nb_original = Af(vec(x_original));\n\nmyAwgn = @(x,snr) x + ...\n 10^( (10*log10(sum(abs(x(:)).^2)/length(x(:))) - snr)/20 )*randn(size(x));\n\n% Either add white noise:\nx_noisy = myAwgn( x_original, snr );\n% Or add a random mask:\n% x_temp = myAwgn( x_original, 0);\n% index = randperm(N);\n% index = index( 1 : round(.2*N) );\n% x_noisy = x_original;\n% x_noisy(index) = x_temp(index);\n\nb = Af( vec(x_noisy) );\nEPS = .9*norm(b-b_original);\nfigure(2); imshow( [x_original, x_noisy] );\n\n%% Setup a sparsifying dictionary to use for denoising:\n% Choose an extension mode; see \"dwtmode\". This makes things square\ndwtmode('per');\nX = x_original;\nXbp = x_noisy;\nmaxI = 1; % max pixel value\nPSNR = @(x) 20*log10(maxI*sqrt(N)/norm(vec(x)-vec(x_original) ) );\n\n% symmetric 9/7 biothogonal wavelets are what JPEG-2000 uses\nwaveletType = 'bior4.4'; % 9/7 wavelet\nnLevels = min( 1, wmaxlev(size(Xbp),waveletType) );\n[c,s] = wavedec2(Xbp,nLevels,waveletType); % see 'wfilters' for options. Needs wavelet toolbox\nPLOT = true;\nif PLOT\n D = detcoef2( 'h', c, s, 1 );\n D = [D,detcoef2( 'd', c, s, 1 )];\n a = appcoef2( c, s, 'db3', 1);\n D = [D;detcoef2( 'v', c, s, 1 ), a];\n cSort = sort(abs(c),'descend');\n \n % Try wavelet hard thresholding to denoise\n erBest = -Inf;\n for gamma = .81:.01:.999\n ind = [find( cumsum(cSort.^2)/sum(cSort.^2) > gamma ),N];\n cutoff = cSort(ind(1));\n c2 = c;\n c2 = c.*( abs(c)>cutoff);\n X_hat = waverec2(c2,s,waveletType);\n er = PSNR(X_hat);\n% fprintf('Gamma is %.3f, PSNR is %.2f\\n',gamma,er );\n if er > erBest, erBest = er; gammaBest = gamma; end\n end\n% gammaBest = .9;\n ind = [find( cumsum(cSort.^2)/sum(cSort.^2) > gammaBest ),N];\n cutoff = cSort(ind(1));\n c2 = c.*( abs(c)>cutoff);\n X_hat = waverec2(c2,s,waveletType);\n \n figure(2);\n imshow( [X,Xbp,X_hat] );\n title(sprintf('Original\\t\\tNoisy (PSNR %.1f dB)\\tOracle Wavelet Thresholding (PNSR %.1f dB)',...\n PSNR(Xbp), PSNR(X_hat) ) );\nend\n\n% Forward wavelet operator\nWf = @(X) wavedec2(mat(X),nLevels,'bior4.4')';\nW_invF = @(c) vec(waverec2(vec(c),s,'bior4.4') );\npinvW = W_invF;\n\nWt = @(c) vec(waverec2(vec(c),s,'rbio4.4') );\npinvWt = @(X) wavedec2(mat(X),nLevels,'rbio4.4')';\nd = length(c);\nif d ~= N, disp('warning: wavelet transform not square'); end\n\nW_wavelet = linop_handles([N,N], Wf, Wt );\nnormWavelet = linop_test(W_wavelet);\n%%\nmu = 1e-3*norm( linop_TV(x_original) ,Inf);\nx_ref = x_original;\n\n% imshow( [x_original, x_noisy] );\n\nsz = A([],0);\nM = sz{2}(1);\nN = sz{1}(1);\n[n1,n2] = size(x_original);\nnorm_x_ref = norm(x_ref,'fro');\ner_ref = @(x) norm(vec(x)-vec(x_ref))/norm_x_ref;\n\nfprintf('\\tA is %s, %d x %d, signal has SNR %d dB\\n', measurements, M, N, round(snr) );\n\n%% Call the TFOCS solver\ner = er_ref; \nopts = [];\nopts.restart = 1000;\nopts.errFcn = @(f,dual,primal) er(primal);\nopts.maxIts = 100;\nopts.printEvery = 20;\nopts.tol = 1e-4;\nif strcmpi(measurements,'identity')\n x0 = x_noisy;\nelse\n x0 = At(b);\nend\nz0 = []; % we don't have a good guess for the dual\nif VECTOR\n W_tv = linop_TV( [n1,n2] );\nelse\n W_tv = linop_TV( {n1,n2} );\n% z0 = {zeros(M,1), zeros(n1*n2,1) };\nend\nnormTV = linop_TV( [n1,n2], [], 'norm' );\nopts.normW12 = normTV^2;\nopts.normW22 = normWavelet^2;\nopts.normA2 = 1; % \"A\" is the identity\n\n\n% Make sure we didn't do anything bad\n% linop_test( A );\n% linop_test( W );\n\ncontOpts = [];\ncontOpts.maxIts = 4;\ncontOpts.betaTol = 2;\n\n\n% -- First, solve just via wavelet --\ndisp('============ WAVELETS ONLY ===============');\nopts.normW2 = normWavelet^2;\nsolver = @(mu,x0,z0,opts) solver_sBPDN_W( A, W_wavelet, b, EPS, mu, x0, z0, opts);\n[ x, out, optsOut ] = continuation(solver,5*mu,VEC(x0),z0,opts, contOpts);\nX_wavelets = mat(x);\n\n% -- Second, solve just via TV --\ndisp('============ TV ONLY =====================');\nopts.normW2 = normTV^2;\nsolver = @(mu,x0,z0,opts) solver_sBPDN_W( A, W_tv, b, EPS, mu, x0, z0, opts);\n[ x, out, optsOut ] = continuation(solver,5*mu,VEC(x0),z0,opts, contOpts);\nX_tv = mat(x);\n\n% -- Third, combine wavelets and tv --\n% -- Here is what we are solving --\n% minimize alpha*||x||_TV + beta*||W_wavelet(x)||_1\n% subject to ||x-x_noisy|| <= EPS\nalpha = 1;\nbeta = .1;\n\ndisp('============ WAVELETS AND TV =============');\nsolver = @(mu,x0,z0,opts) solver_sBPDN_WW( A, alpha, W_tv, beta, W_wavelet, b, EPS, mu,x0, z0, opts);\n[ x, out, optsOut ] = continuation(solver,5*mu,VEC(x0),z0, opts,contOpts);\nX_wavelets_tv = mat(x);\n\n%%\nfigure(1); clf;\nsplot = @(n) subplot(2,3,n);\n\nsplot(1);\nimshow(x_original);\ntitle(sprintf('Noiseless image, PSNR %.1f dB', Inf ));\n\nsplot(2);\nimshow(x_noisy);\ntitle(sprintf('Noisy image, PSNR %.1f dB', PSNR(x_noisy) ));\n\nsplot(3);\nimshow(X_hat);\ntitle(sprintf('Oracle wavelet thresholding, PSNR %.1f dB', PSNR(X_hat) ));\n\nsplot(4);\nimshow(X_wavelets);\ntitle(sprintf('Wavelet regularization, PSNR %.1f dB', PSNR(X_wavelets) ));\n\nsplot(5);\nimshow(X_tv);\ntitle(sprintf('TV regularization, PSNR %.1f dB', PSNR(X_tv) ));\n\nsplot(6);\nimshow(X_wavelets_tv);\ntitle(sprintf('Wavelet + TV regularization, PSNR %.1f dB', PSNR(X_wavelets_tv) ));\n\n%%\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/largescale/test_sTV_largescale.m", "content": "%{\n Tests total-variation problem on a large-scale example\n\n min_x ||x||_TV\ns.t.\n || A(x) - b || <= eps\n\nThe solvers solve a regularized version\n\nsee also test_sBP.m and test_sBPDN_W.m and test_sTV.m\n\nThis version has no reference solution.\nRequires image processing toolbox\n\n%}\n\n% Before running this, please add the TFOCS base directory to your path\n\n\n% Generate a new problem\n\nrandn('state',245);\nrand('state',245);\n\nn = 256;\nn1 = n; \nn2 = n;\n% n2 = n-1; % testing the code with non-square signals\nN = n1*n2;\nn = max(n1,n2);\nx = phantom(n);\nx = x(1:n1,1:n2);\nx_original = x;\n\nmat = @(x) reshape(x,n1,n2);\nvec = @(x) x(:);\n\n% -- Choose what kind of measurements you want:\nmeasurements = 'identity'; % for denoising\n% measurements = 'partialFourier'; % partial 2D DCT\n\nswitch measurements\n case 'identity'\n M = N;\n Af = @(x) x;\n At = @(x) x;\n case 'partialFourier'\n\n M = round( N / 4 );\n % omega = randsample(N,M);\n omega = randn(N,1);\n [temp,omega] = sort(omega);\n omega = sort( omega(1:M) );\n downsample = @(x) x(omega);\n SS.type = '()'; SS.subs{1} = omega; SS.subs{2} = ':';\n upsample = @(x) subsasgn( zeros(N,size(x,2)),SS,x);\n\n\n % take partial 2D DCT measurements. We have Af(At) = identity (not\n % vice-versa of course). Randomly permuted.\n rp = randperm(N);\n [~,rp_inv] = sort(rp);\n rpF = @(x) x(rp);\n rp_invF = @(x) x(rp_inv);\n \n my_dct2 = @(x) dct(dct(x).').';\n my_idct2= @(x) idct(idct(x).').';\n Af = @(x) downsample(vec( my_dct2( mat(rpF(mat(x) )) ) ) );\n At = @(y) vec( rp_invF( my_idct2( mat( upsample( y ) ) ) ) );\nend\n\n% treat X as n1*n2 x 1 vector?\nVECTOR = true;\n% or treat X as n1 x n2 matrix?\n% VECTOR = false;\n\nif VECTOR\n A = linop_handles([M,N], Af, At );\n VEC = vec;\nelse\n Af = @(x) vec(Af(x));\n At = @(x) mat(At(x));\n A = linop_handles({[n1,n2],[M,1]}, Af, At );\n VEC = @(x) x;\nend\n \nmyAwgn = @(x,snr) x + ...\n 10^( (10*log10(sum(abs(x(:)).^2)/length(x(:))) - snr)/20 )*randn(size(x));\n \nb_original = Af(vec(x_original));\nsnr = 10; % SNR in dB\nx_noisy = myAwgn( x_original, snr );\nb = Af( vec(x_noisy) );\nEPS = norm(b-b_original);\n\nmu = 1e-5*norm( linop_TV(x_original) ,Inf);\nx_ref = x_original;\n\nimshow( [x_original, x_noisy] );\n\nsz = A([],0);\nM = sz{2}(1);\nN = sz{1}(1);\n[n1,n2] = size(x_original);\nnorm_x_ref = norm(x_ref,'fro');\ner_ref = @(x) norm(vec(x)-vec(x_ref))/norm_x_ref;\n\nfprintf('\\tA is %s, %d x %d, signal has SNR %d dB\\n', measurements, M, N, round(snr) );\n\n%% Call the TFOCS solver\ner = er_ref; \nopts = [];\nopts.restart = 1000;\nopts.errFcn = @(f,dual,primal) er(primal);\nopts.maxIts = 250;\nif strcmpi(measurements,'identity')\n x0 = x_ref;\nelse\n x0 = At(b);\nend\nz0 = []; % we don't have a good guess for the dual\nif VECTOR\n W = linop_TV( [n1,n2] );\nelse\n W = linop_TV( {n1,n2} );\nend\nnormW = linop_TV( [n1,n2], [], 'norm' );\nopts.normW2 = normW^2;\n\n% Make sure we didn't do anything bad\n% linop_test( A );\n% linop_test( W );\n\n\ntic;\n% [ x, out, optsOut ] = solver_sBPDN_W( A, W, b, EPS, mu, VEC(x0), z0, opts\n% );\nsolver = @(mu,x0,z0,opts) solver_sBPDN_W( A, W, b, EPS, mu, x0, z0, opts);\n[ x, out, optsOut ] = continuation(solver,5*mu,x0(:),z0,opts);\n\ntime_TFOCS = toc;\nfprintf('Solution has %d nonzeros. Error vs. original solution is %.2e\\n',...\n nnz(x), er(x) );\n\nx = mat(x);\nimshow( [x_original, x_noisy, x] );\nmaxI = 1; % max pixel value\nPSNR = @(x) 20*log10(maxI*sqrt(N)/norm(vec(x)-vec(x_original) ) );\ntitle(sprintf('No denoising, PSNR is %.1f dB; TV denoising, PSNR is %.1f dB',...\n PSNR( x_noisy ), PSNR( x )) );\n%%\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/private/eig_backup.m", "content": "function [V,D] = eig_backup( X )\n% [V,D] = eig_backup(X)\n% computes the eigenvalue decomposition of a symmetric matri\n% using the SVD. This is designed for cases when the main eig()\n% routine doesn't work due to the bug described at \n% http://ask.cvxr.com/t/eig-did-not-converge-in-prox-trace/996/4\n%\n% This uses the SVD, so a bit slower sometimes...\n% July 13 2015\n\n[V,D,W] = svd(X);\n\n\nd = diag(D).' .* sign(real(dot(V,W,1)));\n% and sort it to conform to Matlab's order...\n[d,ind] = sort(d);\nD = diag(d);\nV = V(:,ind);\n\n% Another option, but typically slow...\n% (calls generalized eigenvalue decomp.)/\n% [V,D] = eig(X,eye(size(X)));" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/private/linop_identity.m", "content": "function y = linop_identity( x, mode )\n\n%LINOP_IDENTITY Internal TFOCS routine.\n%\t Implements the identity linear operator.\n\ny = x;\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/private/linop_stack.m", "content": "function [ op, inp_dims, otp_dims ] = linop_stack( linearF, inp_dims, otp_dims, DO_DEBUG )\n\n%LINOP_STACK Stacked linear operators.\n% OP = LINOP_STACK( linearF ), where linearF is a cell vector or cell\n% matrix, returns a function handle for a linear operator that accepts\n% TFOCS_TUPLE objects as input or output, as appropriate, and applies\n% the various linear operators in block matrix fashion.\n%\n% If linearF has more than one row, then the output in its forward mode\n% or its input in adjoint mode is a TFOCS_TUPLE object. If linearF has\n% more than one column, then the output in its adjoint mode or its input\n% in forward mode is a TFOCS_TUPLE object.\n\nif nargin < 4 || isempty(DO_DEBUG), DO_DEBUG = false; end\n\nif ~isa( linearF, 'cell' ),\n error( 'First argument must be a cell array.' );\nend\n[ m, n ] = size( linearF );\nif nargin < 2 || isempty( inp_dims ),\n inp_dims = cell( 1, n );\nend\nif nargin < 3 || isempty( otp_dims ),\n otp_dims = cell( 1, m );\nend\nrescan = zeros(2,0);\ndebugPrintf('----- DEBUG INFO: Size of linear matrix (and offsets) ---- \\n');\n% debugPrintf('---------------------------------------------------------- \\n');\nfor j = 1 : n, debugPrintf('-----------------------------------+'); end\ndebugPrintf('\\n');\n% old_inp_d = {};\nfor i = 1 : m,\n otp_d = otp_dims{i};\n for j = 1 : n,\n inp_d = inp_dims{j};\n lF = linearF{i,j};\n sZ = [];\n if isempty(lF),\n elseif isa( lF, 'function_handle' ),\n sZ = lF([],0);\n elseif ~isnumeric( lF ),\n error( 'Entries should be real matrices or linear operators.' );\n elseif ~isreal(lF), % Why? we now handle A: C --> C\n error( 'Matrix entries must be real.' );\n elseif numel(lF) > 1,\n sZ = size(lF);\n linearF{i,j} = linop_matrix( lF ); % Jan 2012, check this\n elseif lF == 0,\n linearF{i,j} = [];\n else\n if lF == 1,\n% linearF{i,j} = @(x,mode)x;\n linearF{i,j} = @linop_identity;\n else\n linearF{i,j} = @(x,mode)lF*x;\n end\n if ~isempty(otp_d),\n sZ = { otp_d, otp_d };\n elseif ~isempty(inp_d),\n sZ = { inp_d, inp_d };\n else\n rescan(:,end+1) = [i;j];\n end\n end\n if isempty( sZ ),\n printSizes( inp_d , otp_d ); % if DO_DEBUG is true, this will print\n if j < n, debugPrintf(' |'); end\n continue;\n elseif isnumeric( sZ ), % This should never be triggered, unless offset is empty\n % June 2011:\n % If this is the offset term, then we allow for a matrix (rather than vector)\n % offset, as long as the size of the linear portion has been specified:\n if j == n && j > 1\n sZ_old = linearF{i,j-1}([],0);\n if ~isempty( sZ_old) && all( sZ_old{2} == sZ )\n % We may have a matrix\n sZ = { [1,1], sZ };\n % So, re-define linearF{i,j} not to be linop_matrix but rather the constant function\n else\n sZ = { [sZ(2),1], [sZ(1),1] };\n end\n else\n sZ = { [sZ(2),1], [sZ(1),1] };\n end\n end\n if isempty(inp_d),\n inp_d = sZ{1};\n% elseif ~isequal(inp_d,sZ{1}) && ~isempty( sZ{1} ) % adding Oct 12. Jan 2012, is this right? inp_d was already defined....\n% elseif ~isempty( old_inp_d ) && ~isempty( sZ{1} ) && ~isequal( old_inp_d, sZ{1} )\n% if j > 1\n% for jj = 1:(j-1)\n% sZ_old = linearF{i,jj}([],0);\n% if isempty( sZ_old )\n% fprintf( 2, ...\n% 'TFOCS message: About to throw an error: may be because element (%d,%d) of \\n',i,jj);\n% fprintf( 2, ...\n% ' linear operator matrix does not have an explicit size\\n' );\n% end\n% end\n% end\n% error( 'Incompatible dimensions in element (%d,%d) of the linear operator matrix', i, j );\n end\n inp_dims{j} = inp_d;\n% if ~isempty( inp_d ), old_inp_d = inp_d; end\n \n if isempty(otp_d),\n otp_d = sZ{2};\n elseif ~isequal(otp_d,sZ{2}),\n if isequal( fliplr(otp_d), sZ{2} )\n fprintf('\\nThe sizes match if you switch some rows/columns. Double-check your offsets are column vectors\\n\\n');\n end\n error( 'Incompatible dimensions in element (%d,%d) of the linear operator matrix', i, j );\n end\n\n \n printSizes( inp_d, otp_d ); % if DO_DEBUG is true, this will print\n if j < n, debugPrintf(' |'); end\n \n end\n otp_dims{i} = otp_d;\n \n debugPrintf('\\n');\n \nend\ndebugPrintf('---------------------------------------------------------- \\n');\n\n%\n% In some cases, we cannot resolve the dimensions on the first pass:\n% specifically, those entries that represent scalar scaling operations.\n% In those cases, we know that the input and output dimensions must be the\n% same, but we may not have yet determined either in the first pass. So\n% we rescan those entries until all ambiguities are resolved or until no\n% further progress is made.\n%\n\nwhile ~isempty(rescan),\n rescan_o = rescan;\n rescan = zeros(2,0);\n for ij = rescan,\n i = ij(1); j = ij(2);\n lF = linearF{i,j};\n if isnumeric(lF) && numel(lF) == 1,\n if isempty(inp_dims{j}),\n if isempty(otp_dims{i}),\n rescan(:,end+1) = [i;j];\n continue;\n else\n inp_dims{j} = otp_dims{i};\n end\n elseif isempty(otp_dims{i}),\n otp_dims{i} = inp_dims{j};\n elseif ~isequal( inp_dims{i}, otp_dims{j} ),\n error( 'Incompatible dimensions in element (%d,%d) of the linear operator matrix', i, j );\n end\n if DO_DEBUG\n fprintf('Affine term (%d,%d) has size:', i, j );\n printSizes( inp_dims{j}, otp_dims{i} );\n end\n end\n end\n % Prevent infinite loops\n if numel(rescan) == numel(rescan_o),\n break;\n end\nend\ndebugPrintf('---------------------------------------------------------- \\n');\n\nif m == 1 && n == 1,\n op = linearF{1,1};\n inp_dims = inp_dims{1};\n otp_dims = otp_dims{1};\n if isempty(op),\n op = @linop_identity;\n end\nelseif m == 1,\n otp_dims = otp_dims{1};\n op = @(x,mode)linop_stack_row( linearF, n, { inp_dims, otp_dims }, x, mode );\nelseif n == 1,\n inp_dims = inp_dims{1};\n op = @(x,mode)linop_stack_col( linearF, m, { inp_dims, otp_dims }, x, mode );\nelse\n op = @(x,mode)linop_stack_mat( linearF, [m,n], { inp_dims, otp_dims }, x, mode );\nend\n\n\n% ------- Internal subfunctions ------------\n% These functions can see the workspace variables of the main function\nfunction debugPrintf( varargin )\nif DO_DEBUG\n fprintf( varargin{:} );\nend\nend\n\nfunction printSizes( inp_d, otp_d )\nif DO_DEBUG\n % Print size of domain\n if isempty( inp_d )\n fprintf(' ( ? )');\n else\n if length( inp_d ) == 1, inp_d = [inp_d, 1 ]; end\n fprintf(' (');\n for kk = 1:length(inp_d)-1, fprintf('%4d x ', inp_d(kk) ); end\n fprintf('%4d )', inp_d(end) );\n end\n % Print size of range\n fprintf(' --> ');\n if isempty( otp_d )\n fprintf('( ? )');\n else\n if length( otp_d ) == 1, otp_d = [otp_d, 1 ]; end\n fprintf('(');\n for kk = 1:length(otp_d)-1, fprintf('%4d x ', otp_d(kk) ); end\n fprintf('%4d )', otp_d(end) );\n end\nend\nend\n\n\nend % end of main program\n\n% ------- External subfunctions ------------\nfunction y = linop_stack_row( linearF, N, dims, x, mode )\nswitch mode,\n case 0,\n y = dims;\n case 1,\n y = 0;\n x = cell( x );\n for j = 1 : N,\n lF = linearF{j};\n if ~isempty(lF), y = y + lF(x{j},1); end\n end\n case 2,\n y = cell(1,N);\n for j = 1 : N,\n lF = linearF{j};\n if ~isempty(lF), y{j} = lF(x,2); else y{j} = 0*x; end\n end\n y = tfocs_tuple( y );\nend\nend\n\nfunction y = linop_stack_col( linearF, N, dims, x, mode )\nswitch mode,\n case 0,\n y = dims;\n case 1,\n y = cell(1,N);\n for j = 1 : N,\n lF = linearF{j};\n if ~isempty(lF), y{j} = lF(x,1); else y{j} = 0*x; end\n end\n y = tfocs_tuple( y );\n case 2,\n y = 0;\n x = cell( x );\n for j = 1 : N,\n lF = linearF{j};\n if ~isempty(lF), y = y + lF(x{j},2); end\n end\nend\nend\n\nfunction y = linop_stack_mat( linearF, sZ, dims, x, mode )\nswitch mode,\n case 0,\n y = dims;\n case 1,\n x = cell( x );\n y = cell( 1, sZ(1) );\n for i = 1 : sZ(1),\n ans = 0;\n for j = 1 : sZ(2),\n lF = linearF{i,j};\n if ~isempty(lF), ans = ans + lF(x{j},1); end\n end\n y{i} = ans;\n end\n y = tfocs_tuple( y );\n case 2,\n x = cell( x );\n y = cell( 1, sZ(2) );\n for j = 1 : sZ(2),\n ans = 0;\n for i = 1 : sZ(1),\n lF = linearF{i,j};\n if ~isempty(lF), ans = ans + lF(x{i},2); end\n end\n y{j} = ans;\n end\n y = tfocs_tuple( y );\nend\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/private/print_cell_size.m", "content": "function print_cell_size( c , fid, offsetPossible )\n% c should be a cell array\n\nif nargin < 2 || isempty(fid), fid = 1; end\nif nargin < 3 || isempty(offsetPossible), offsetPossible = false; end\n\nif ~iscell(c)\n fprintf(fid,'\\tcomponent 1: ');\n% d = size(c);\n d = c;\n for k = 1:(length(d)-1)\n fprintf(fid,'%4d x ',d(k) );\n end\n fprintf(fid,'%4d\\n', d(k+1) );\n fprintf(fid,' (but input to printCellSize should have been a cell array)\\n');\n return;\nelse\n for j = 1:length(c)\n if j == length(c) && offsetPossible && all(size( c{j} ) == [1,2] ) ...\n && all( c{j} == [1,1] )\n fprintf(fid,'\\tcomponent %2d is fixed (i.e. an offset)\\n', j );\n else\n fprintf(fid,'\\tcomponent %2d: ', j );\n if isempty( c{j} )\n fprintf(fid,'size not yet determined\\n');\n else\n d = c{j};\n if length(d) < 2, d = [d,1]; end % this case shouldn't arise...\n for k = 1:(length(d)-1)\n fprintf(fid,'%4d x ',d(k) );\n end\n fprintf(fid,'%4d\\n', d(k+1) ); % bug, Feb 29 2012: change d(k) to d(k+1)\n end\n end\n end\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information." }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/private/prox_stack.m", "content": "function op = prox_stack( varargin )\n\n% OP = PROJ_STACK( P1, P2, P3, ..., PN )\n% \"Stacks\" N proximity functions P1, P2, P3, ..., PN together, to create\n% a single proximity function that operates on an N-tuple. Returns a\n% function handle ready to be used in \n\nargs = varargin;\nwhile isa( args, 'cell' ) && numel( args ) == 1,\n args = args{1};\nend\nif isempty( args ),\n op = @proj_Rn;\nelseif isa( args, 'function_handle' ),\n op = args;\nelseif ~isa( args, 'cell' ),\n error( 'Expected one or more projector function handles.' );\nelse\n op = @(varargin)proj_stack_impl( args, varargin{:} );\nend\n\nfunction [ v, x ] = proj_stack_impl( proj, y, t )\n\nnp = numel(proj);\nno = nargout > 1;\nni = nargin > 2;\ny = cell( y );\nif no,\n v = zeros( 1, np );\n x = cell( 1, np );\nelse\n v = 0;\nend\nif ni && numel(t) == 1,\n t = t * ones(1,np);\nend\nswitch 2 * no + ni,\ncase 0, % 1 input, 1 output \n for k = 1 : np,\n v = v + proj{k}( y{k} );\n end\ncase 1, % 2 inputs, 1 output\n for k = 1 : np,\n v = v + proj{k}( y{k}, t(k) );\n end\ncase 2, % 1 input, 2 outputs\n for k = 1 : np,\n [ v(k), x{k} ] = proj{k}( y{k} );\n end\ncase 3, % 2 inputs, 2 outputs\n v = zeros( 1, np );\n x = cell( 1, np ); \n for k = 1 : np,\n [ v(k), x{k} ] = proj{k}( y{k}, t(k) );\n end\nend\nif no,\n v = sum( v );\n x = tfocs_tuple( x );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/private/safe_eig.m", "content": "function [V,D] = safe_eig(X)\n% [V,D] = safe_eig(X)\n% calls [V,D] = eig(X) and tests for a common error\n% (http://ask.cvxr.com/t/eig-did-not-converge-in-prox-trace/996/4)\n% and if it finds it, runs a replacement algorithm\ntry\n [V,D] = eig(X);\ncatch ME\n if (strcmpi(ME.identifier,'MATLAB:eig:NoConvergence'))\n [V,D] = eig_backup(X);\n else\n rethrow(ME);\n end\nend" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/private/size_ambig.m", "content": "function ans = size_ambig( sz )\n\nswitch class( sz ),\n case 'double',\n ans = isempty( sz );\n case 'cell',\n if isa( sz{1}, 'function_handle' ),\n ans = false; % it's not ambiguous as long as it's a valid function...\n elseif isempty( sz ),\n ans = true;\n else\n ans = false;\n for k = 1 : numel( sz ),\n if size_ambig( sz{k} ),\n ans = true;\n break;\n end\n end\n end\n otherwise,\n ans = true;\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/private/size_compat.m", "content": "function [ a, sX ] = size_compat( sX, sY )\na = true;\nswitch class( sX ),\n case 'double',\n if isempty( sX ) || all( sX == 0 ),\n sX = sY;\n elseif isempty( sY ) || all( sY == 0 ),\n elseif ~isequal( sX, sY ),\n \n % Feb 29, 2012. Special case:\n % One represents the size a x b x c, where c = 1\n % The other is a x b (since Matlab often automatically squeezes\n % 3D arrays to 2D if the 3rd dimension is a singletone)\n% if (length(sX) >= 3 && length(sX) == length(sY)+1 && sX(end)==1) || ...\n% (length(sY) >= 3 && length(sY) == length(sX)+1 && sY(end)==1)\n % do nothing\n % March 2012, a better fix (also due to Graham Coleman)\n if min( length(sX),length(sY) ) >= 2\n truncA = cutTrailingOnes(sX);\n truncB = cutTrailingOnes(sY);\n a = isequal( truncA, truncB );\n else\n a = false;\n end\n end\n case 'cell',\n if ~isa( sY, 'cell' ) || numel( sX ) ~= numel( sY ) || isa( sX{1}, 'function_handle' ) && ~isequal( sX, sY ),\n a = false;\n elseif isa( sX{1}, 'function_handle' ),\n a = isequal( sX, sY );\n else\n for k = 1 : numel( sX ),\n [ ta, sX{k} ] = size_compat( sX{k}, sY{k} );\n a = a && ta;\n end\n end\n otherwise,\n a = isequal( sX, sY );\nend\nif ~a,\n sX = [];\nend\n\nfunction y = cutTrailingOnes( x )\n%cuts the final ones of a vector, and columnize\n\nlastNotOne = find( x(:)~=1, 1, 'last' );\n\n%do not cut before 2nd position\nlastNotOne = max( 2, lastNotOne );\n\ny = x(1:lastNotOne);\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/private/smooth_stack.m", "content": "function op = smooth_stack( varargin )\n\n% OP = SMOOTH_STACK( S1, S2, S3, ..., SN )\n% \"Stacks\" N smooth functions S1, S2, S3, ..., SN together to create\n% a single smooth function that operates on an N-tuple. Returns a\n% function handle ready to be used in TFOCS.\n\nargs = varargin;\nwhile isa( args, 'cell' ) && numel( args ) == 1,\n args = args{1};\nend\nif isempty( args ),\n op = @smooth_zero;\nelseif isa( args, 'function_handle' ),\n op = args;\nelseif ~isa( args, 'cell' ),\n error( 'Expected one or more smooth function handles.' );\nelse\n op = @(varargin)smooth_stack_impl( args, varargin{:} );\nend\n\nfunction [ f, g ] = smooth_stack_impl( smooth, x )\n\nnp = numel(smooth);\nx = cell( x );\nif nargout > 1,\n f = zeros( 1, np );\n g = cell( 1, np );\n for k = 1 : np,\n [ f(k), g{k} ] = smooth{k}( x{k} );\n end\n f = sum( f );\n g = tfocs_tuple( g );\nelse\n f = 0;\n for k = 1 : np,\n f = f + smooth{k}( x{k} );\n end\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/private/solver_apply.m", "content": "function varargout = solver_apply( ndxs, func, varargin )\nglobal tfocs_count___\n\n%SOLVER_APPLY\tInternal TFOCS routine.\n%\tA wrapper function used to facilitate the counting of function calls, and\n% to standardize the number of output arguments for the algorithms.\n\n[ varargout{1:max(nargout,1)} ] = func( varargin{:} );\ntfocs_count___(ndxs) = tfocs_count___(ndxs) + 1;\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/private/tfocs_backtrack.m", "content": "% TFOCS_BACKTRACK\n% Backtracking helper script.\n\ndo_break = false; % added for compatibility with R2015b\nwhile true\n\n% Quick exit for no backtracking\nif beta >= 1\n do_break = true;\n break; \nend % SRB changing == to >=\n\n% Quick exit if no progress made\nxy = x - y;\nxy_sq = tfocs_normsq( xy );\nif xy_sq == 0, localL = Inf; do_break=true; break; end\n%fprintf('xy_sq/x is %.2e\\n', xy_sq/tfocs_normsq(x) );\nif xy_sq/tfocs_normsq(x) < eps, cntr_Ax=Inf; end % force a reset\n\n% Compute Lipschitz estimate\nif backtrack_simple,\n if isinf( f_x ),\n f_x = apply_smooth( A_x );\n end\n q_x = f_y + tfocs_dot( xy, g_y ) + 0.5 * L * xy_sq;\n localL = L + 2 * max( f_x - q_x, 0 ) / xy_sq;\n backtrack_simple = abs( f_y - f_x ) >= backtrack_tol * max( abs( f_x ), abs( f_y ) );\nelse\n if isempty( g_Ax ),\n [ f_x, g_Ax ] = apply_smooth( A_x );\n end\n localL = 2 * tfocs_dot( A_x - A_y, g_Ax - g_Ay ) / xy_sq;\nend\n\n% Exit if Lipschitz criterion satisfied, or if we hit Lexact\nbacktrack_steps = backtrack_steps + 1;\nif localL <= L || L >= Lexact, do_break=true; break; end\nif ~isinf( localL ), \n L = min( Lexact, localL );\nelseif isinf( localL )\n localL = L;\nend\nL = min( Lexact, max( localL, L / beta ) );\n\nbreak;\nend % end of \"while true\"\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/private/tfocs_cleanup.m", "content": "%SOLVER_CLEANUP TFOCS helper script\n% Performs the final set of operations for our templated solvers: performs\n% final calculations, prints final outputs, cleans up unused data.\n\n% This should be called just after tfocs_iterate, so re-use some of that\n% computation:\n\n% We have two sequences of points, the x and the y sequence\n% Other things being equal, we will use the x sequence as output\n% But in some cases, if we use y, there is less computation to do\n% since we can re-use some older computation. If it is the case that\n% computing y is cheap, then we will still compute x, but now we will\n% compare x and y and take whichever is better (ties going toward x)\n\nif exist('cur_dual','var')\n cur_dual = get_dual( cur_dual );\nend\nif v_is_y && ~output_always_use_x\n % We have some free information about y\n % cur_pri = y\n if data_collection_always_use_x\n % f_vy and dual_y have already been saved\n else\n f_vy = f_v;\n if saddle, dual_y = cur_dual; end\n end\nend\nif ~v_is_x\n if saddle,\n if isempty(g_Ax),\n [ f_x, g_Ax ] = apply_smooth(A_x);\n end\n cur_dual = get_dual( g_Ax );\n elseif isinf(f_x),\n f_x = apply_smooth(A_x);\n end\n if isinf( C_x ),\n C_x = apply_projector( x );\n end\n f_v = maxmin * ( f_x + C_x );\n cur_pri = x;\nend\n% Now, compare x and y if info on y is available, and take whichever is better\nx_or_y_string = 'x';\nif v_is_y && ~output_always_use_x\n if f_vy < f_v\n f_v = f_vy;\n if saddle, cur_dual= dual_y; end\n x = y; % losing information after this point!\n x_or_y_string = 'y';\n end\nend\nif saddle\n if ~exist('cur_dual','var')\n if isempty(g_Ax),\n [ f_x, g_Ax ] = apply_smooth(A_x);\n end\n cur_dual = get_dual( g_Ax );\n end\n out.dual = cur_dual;\n if isa( out.dual, 'tfocs_tuple')\n out.dual = cell( out.dual );\n end\nend\nif fid && printEvery,\n\tfprintf( fid, 'Finished: %s\\n', status );\nend\nout.niter = n_iter;\nout.status = status;\nout.x_or_y = x_or_y_string;\nd.niter = 'Number of iterations';\nif saveHist,\n out.f(n_iter) = f_v;\n out.f(n_iter+1:end) = [];\n out.normGrad(n_iter+1:end) = [];\n out.stepsize(n_iter+1:end) = [];\n out.theta(n_iter+1:end,:) = [];\n if countOps,\n out.counts(n_iter+1:end,:) = [];\n end\n if ~isempty(errFcn),\n out.err(n_iter+1:end,:) = [];\n end\n d.f = 'Objective function history';\n d.normDecr = 'Decrement norm';\n d.stepsize = 'Stepsize';\n d.theta = 'Acceleration parameter history';\n if countOps,\n d.counts = strvcat(...\n 'k x 4 arry, with columns [F,G,A,P] where',...\n 'F: Number of function evaluations of the smooth function',...\n 'G: Number of gradient evaluations of the smooth function',...\n 'A: Number of calls to the linear operator and its transpose',...\n 'N: Number of calls to the nonsmooth function (w/o projection)',...\n 'P: Number of calls to the projection operator' );\n end\n if ~isempty(errFcn)\n d.err = 'Error, determined by evaluating the user-supplied error function';\n end\nend\nout.description = d;\nif countOps,\n clear global tfocs_count___\nend\n \n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/private/tfocs_initialize.m", "content": "%SOLVER_INITIALIZE\tTFOCS helper script\n%\tPerforms the initializations common to all of the first-order solvers\n\n% Process the options structure and string/value pairs. First, we replace the\n% default values with any values specified by the user in the 'opts' structure.\n% We ignore any fields in the 'opts' structure that do not match ours, so that\n% users can re-use the opts structure for other purposes.\n\nodef = struct( ...\n 'maxIts', Inf ,...\n 'maxCounts', Inf ,...\n 'countOps', false ,... % adjusted if maxCounts < Inf\n 'saveHist', true ,...\n 'adjoint', false ,...\n 'saddle', false ,...\n 'tol', 1e-8 ,...\n 'errFcn', {{}} ,...\n 'stopFcn', {{}} ,...\n 'printEvery', 100 ,...\n 'maxmin', 1 ,...\n 'beta', 0.5 ,...\n 'alpha', 0.9 ,... % See below for special CG stuff\n 'L0', 1 ,... % See below \n 'Lexact', Inf ,...\n 'mu', 0 ,...\n 'fid', 1 ,...\n 'stopCrit', 1 ,... % the TFOCS paper used stopCrit = 2\n 'alg', 'AT' ,...\n 'restart', Inf ,...\n 'printStopCrit', false,...\n 'cntr_reset', -50 ,... % how often to explicitly recompute A*x and A*y (set to Inf if you want )\n 'cg_restart', Inf ,... % for CG only\n 'cg_type', 'pr' ,... % for CG only\n 'stopping_criteria_always_use_x', false, ...\n 'data_collection_always_use_x', false, ...\n 'output_always_use_x', false, ...\n 'autoRestart', 'gra', ... % function or gradient\n 'printRestart', true, ...\n 'debug', false ....\n );\n\n% Calling the solver with a no arguments returns the default options structure\nif narginn < 1 || ( narginn ==1 && isstruct( smoothF ) )\n opts = odef;\n % remove the \"CG\" options for now, since they are undocumented\n opts = rmfield(opts,'cg_restart');\n opts = rmfield(opts,'cg_type');\n % if any default options are passed in (e.g. by tfocs_SCD), add those now:\n if ( narginn ==1 && isstruct( smoothF ) )\n for f = fieldnames( smoothF )'\n opts.( f{1} ) = smoothF.( f{1} );\n end\n end\n \n out = [];\n x = opts;\n if nargoutt == 0,\n disp('====== TFOCS default options =======');\n% disp('Format is fieldname: { [default] ''Usage type.\n% Description''}');\n \n % add some helpful description\n desc = [];\n desc.alg = 'Algorithm, e.g. GRA for gradient descent. Values: AT, GRA, LLM, N07, N83, TS';\n desc.maxIts = 'Basic. Maximum number of allowed iterations';\n desc.saveHist = 'Basic. Record history of all iterations';\n desc.restart = 'Basic. Restart parameter. Make negative for \"no-regress\" feature';\n desc.tol = 'Basic. Tolerance for stopping criteria';\n desc.L0 = 'Basic. Initial estimate of Lipschitz constant';\n desc.Lexact = 'Basic. Known bound of Lipschitz constant';\n desc.printEvery = 'Basic. How often to print info to the terminal; set to 0 or Inf to suppress output';\n desc.maxmin = 'Basic. +1 for convex minimization, -1 for concave maximization';\n \n desc.errFcn = 'Medium. User-specified error function. See user guide';\n desc.beta = 'Medium. Backtracking parameter, in (0,1). No line search if >= 1';\n desc.alpha = 'Medium. Line search increase parameter, in (0,1)';\n desc.autoRestart= 'Medium. Set to ''gra'' or ''fun'' to choose behavior when restart<0';\n\n \n desc.maxCounts = 'Advanced. Vector that fine-tunes various types of iteration limits; same form as countOps';\n desc.countOps = 'Advanced. Record number of linear multiplies, etc.; form [fcn, grad, linear, nonsmth, proj]';\n desc.mu = 'Advanced. Strong convexity parameter.';\n desc.fid = 'Advanced. File id, e.g. via fopen. All output is sent to this file';\n desc.stopFcn = 'Advanced. User-supplied stopping criteria. See user guide';\n desc.stopCrit = 'Advanced. Controls which stopping criteria to use; 1,2, 3 or 4.';\n desc.printStopCrit = 'Advanced. Controls whether to display the value used in the stopping criteria';\n desc.printRestart = 'Advanced. Whether to signal when a restart happens';\n desc.cntr_reset = 'Advanced. Controls how often to reset some numerical computations to avoid roundoff';\n desc.debug = 'Advanced. Turns on more useful error messages';\n \n desc.stopping_criteria_always_use_x = 'Advanced. Forces usage of x, never y, in stopping crit.';\n desc.data_collection_always_use_x = 'Advanced. Forces usage of x, nevery y, in recording errors.';\n desc.output_always_use_x = 'Advanced. Forces output of x, never y. Default: uses whichever is better';\n \n desc.adjoint = 'Internal.';\n desc.saddle = 'Internal. Used by TFOCS_SCD';\n \n \n \n disp( opts );\n disp('====== Description of TFOCS options =======');\n disp( desc );\n end\n return % from this script only; the calling function does not return\nend\n\n% [smoothF, affineF, projectorF, x0, opts ] = deal(varargin{:});\n% Check for incorrect types\nF_types = {'function_handle','cell','double','single'};\nassert( ismember(class(smoothF),F_types),'smoothF is of wrong type' );\nassert( ismember(class(affineF),F_types),'affineF is of wrong type' );\nassert( ismember(class(projectorF),F_types),'projectorF 3 is of wrong type' );\nif narginn >= 4\n x0_types = {'cell','double','single','tfocs_tuple'};\n assert( ismember(class(x0),x0_types),'x0 is of wrong type' );\nend\nif narginn >= 5 && ~isempty(opts)\n assert( ismember(class(opts),{'struct'}),'opts is of wrong type' );\nend\n\n% Some parameters defaults depend on whether the user supplies other\n% options. These will be updated later\nL0_default = odef.L0;\nodef.L0 = Inf;\n\nalpha_default = odef.alpha; % typically 0.9\nalpha_default_CG = 1;\nodef.alpha = Inf;\n\n\n\n% Process the options structure, merging it with the default options\n% (merge \"opts\" into \"odef\")\ndef_fields = fieldnames(odef)'; % default options\nif narginn > 4 && ~isempty(opts),\n use_fields = zeros(size(def_fields));\n opt_fields = fieldnames(opts)'; % user-supplied options\n for k = opt_fields,\n k = k{1};\n ndx = find(strcmpi(def_fields,k));\n if ~isempty(ndx)\n if ~isempty(opts.(k)) && ~use_fields(ndx),\n odef.(def_fields{ndx}) = opts.(k);\n end\n use_fields(ndx) = use_fields(ndx) + 1;\n else\n % Warn if the field is not found in our options structure\n warnState = warning('query','backtrace');\n warning off backtrace\n warning('TFOCS:OptionsStructure',' Found extraneous field \"%s\" in options structure', k );\n warning(warnState);\n end\n end\n % Warn if fields appear twice due to capitalization; e.g., maxIts/maxits\n if any(use_fields>1),\n warnState = warning('query','backtrace');\n warning off backtrace\n warning('TFOCS:OptionsStructure',' Some fieldnames of the options structure are identical up to capitalization: unpredictable behavior');\n warning(warnState);\n end\nend\n\n% Remove unnecessary options\nif ~strcmpi( odef.alg, 'cg' )\n odef = rmfield( odef, 'cg_restart' );\n odef = rmfield( odef, 'cg_type' );\n % update our list of fieldnames\n def_fields = fieldnames(odef)';\nend\n\n% If opts.alpha wasn't supplied, use a default value:\nif isinf(odef.alpha)\n if strcmpi( odef.alg, 'cg' )\n odef.alpha = alpha_default_CG;\n else\n odef.alpha = alpha_default;\n end\nend\n\n% If opts.printEvery is Inf, set it to 0\nif isinf(odef.printEvery)\n odef.printEvery = 0;\nend\n\n% The default value of L0 is set to Lexact, if it is supplied\nif isinf(odef.L0),\n if isinf(odef.Lexact),\n if odef.beta >= 1,\n error( 'For a fixed step size, L0 or Lexact must be supplied.' );\n end\n odef.L0 = L0_default;\n else\n odef.L0 = odef.Lexact;\n end\nend\n% If maxCounts is set, set countOps to true\nif any(odef.maxCounts 1,\n error( 'Multidimensional arrays are not permitted.' );\n end\n if numel(affineF) == 1,\n identity_linop = affineF == 1;\n affineF = { linop_scale( affineF ) };\n else\n identity_linop = false;\n affineF = { linop_matrix( affineF ) };\n end\nelseif isa( affineF, 'function_handle' ),\n affineF = { affineF };\nelseif ~isa( affineF, 'cell' ),\n error( 'Invalid affine operator specification.' );\nend\n\n% If adjoint mode is specified, temporarily transpose the affineF cell\n% array so that the rows and columns match the number of smooth functions\n% and projectors, respectively. Then verify size compatibility.\nif adjoint, affineF = affineF'; end\n[ m_aff, n_aff ] = size( affineF );\n% if all( m_aff ~= n_smooth + [0,1] ) || n_proj && all( n_aff ~= n_proj + [0,1] ),\n% error( 'The affine operation matrix has incompatible dimensions.' );\n% May 16, 2011: making error messages more informative\nif all( m_aff ~= n_smooth + [0,1] )\n if fid\n fprintf(fid,'Detected error: inputs are of wrong size\\n');\n fprintf(fid,' Found %d smooth functions, so expect that many primal variables\\n',...\n n_smooth );\n fprintf(fid,' So the affine operator should have %d (or %d if there is an offset) entries\\n',...\n n_smooth, n_smooth+1 );\n fprintf(fid,' but instead found %d affine operators\\n', m_aff );\n fprintf(fid,' Perhaps you need the transpose of the affine operator?\\n');\n end\n error( 'The affine operation matrix has incompatible dimensions.' );\nelseif n_proj && all( n_aff ~= n_proj + [0,1] ),\n if fid\n fprintf(fid,'Detected error: inputs are of wrong size\\n');\n fprintf(fid,' Found %d nonsmooth functions, so expect %d or %d sets of affine operators\\n',...\n n_proj, n_proj, n_proj + 1 );\n fprintf(fid,' but instead found %d affine operators\\n', n_aff );\n end\n error( 'The affine operation matrix has incompatible dimensions.' );\nelseif n_proj == 0,\n n_proj = max( 1, m_aff - 1 );\nend\ninp_dims = cell( 1, n_proj );\notp_dims = cell( 1, n_smooth );\n\n% If an additional affine portion of the objective has been specified,\n% create an additional smooth function to contain it.\nif m_aff == n_smooth + 1,\n offset = true; % note: saddle_ndxs is 1:n_smooth\n otp_dims{end+1} = [1,1];\n smoothF{end+1} = smooth_linear( maxmin );\n n_smooth = n_smooth + 1;\n for k = 1 : n_proj,\n offX = affineF{end,k};\n if isempty(offX),\n affineF{end,k} = 0;\n elseif isa(offX,'function_handle'),\n if adjoint, pos = 'row'; else pos = 'column'; end\n error( 'The elements in the last %s must be constants.', pos );\n elseif isnumeric(offX) && numel(offX) == 1 && offX == 0,\n affineF{end,k} = 0;\n elseif nnz(offX),\n affineF{end,k} = linop_dot( affineF{end,k}, adjoint );\n % add a case if ~nnz(offX)... Jan 2012\n elseif ~nnz(offX)\n affineF{end,k} = 0;\n end\n end\nelse\n offset = false;\nend\n\n% If an affine offset has been specified, integrate those offsets into\n% each smooth function, then remove that portion of the array.\nif n_aff == n_proj + 1,\n for k = 1 : n_smooth,\n offX = affineF{k,end};\n if isempty(offX),\n continue;\n elseif isa(offX,'function_handle'),\n if adjoint, pos = 'column'; else pos = 'row'; end\n error( 'The elements in the last %s must be constant matrices.', pos );\n elseif isnumeric(offX) && numel(offX) == 1 && offX == 0,\n continue;\n else\n otp_dims{k} = size(offX);\n if nnz(offX),\n smoothF{k} = @(x)smoothF{k}( x + offX );\n end\n end\n end\n n_aff = n_aff - 1;\n affineF(:,end) = [];\nend\n\n\n% -- Todo:\n% If opts.debug = true, then before calling linop_stack,\n% we should print a message showing the sizes of everything\n% (this is useful when the linear portion is entered as \"1\" or \"[]\"\n% and we have automatically determined the size ).\n\n% Transpose back, if necessary; then check dimensions\nif adjoint,\n affineF = affineF';\n [ linearF, otp_dims, inp_dims ] = linop_stack( affineF, otp_dims, inp_dims, debug );\n linearF = linop_adjoint( linearF );\nelse\n [ linearF, inp_dims, otp_dims ] = linop_stack( affineF, [], [], debug );\nend\nidentity_linop = isequal( linearF, @linop_identity ); % doesn't always catch identities\nsquare_linop = identity_linop || isequal( inp_dims, otp_dims );\nadj_arr = [0,2,1];\nif countOps,\n apply_linear = @(x,mode)solver_apply( 3, linearF, x, mode );\nelse\n apply_linear = linearF;\nend\n\n%\n% Smooth function, pass 2: integrate scale, counting\n%\n\nsmoothF = smooth_stack( smoothF );\nif maxmin < 0,\n smoothF = tfunc_scale( smoothF, -1 );\nend\nif countOps,\n apply_smooth = @(x)solver_apply( 1:(1+(nargoutt>1)), smoothF, x );\nelse\n apply_smooth = smoothF;\nend\n\n%\n% Projector, pass 2: supply default, stack it up, etc.\n%\n\nif isempty( projectorF ),\n n_proj = 0;\n projectorF = proj_Rn;\nelse\n projectorF = prox_stack( projectorF );\nend\nif countOps,\n apply_projector = @(varargin)solver_apply( 4:(4+(nargoutt>1)), projectorF, varargin{:} );\nelse\n apply_projector = projectorF;\nend\n\n%\n% Initialize the op counts\n%\n\nif countOps,\n global tfocs_count___\n tfocs_count___ = [0,0,0,0,0];\n maxCounts = maxCounts(:)';\nend\n\n%\n% Construct the common initial values\n%\n\nL = L0;\ntheta = Inf;\nf_v_old = Inf;\nx = []; A_x = []; f_x = Inf; C_x = Inf; g_x = []; g_Ax = [];\nrestart_iter = 0;\nwarning_lipschitz = 0;\nbacktrack_simple = true;\nbacktrack_tol = 1e-10;\nbacktrack_steps = 0;\n\n%\n% Try to determine the size of the input, and construct the initial point.\n%\n\n% Attempt 1: From x0 itself\nzero_x0 = true;\nif ~isempty( x0 ),\n if isa( x0, 'tfocs_tuple' )\n x0 = cell(x0);\n end\n if isa( x0, 'cell' ),\n n_x0 = numel( x0 );\n if n_x0 == 1,\n x0 = x0{1};\n else\n x0 = tfocs_tuple( x0 );\n end\n else\n n_x0 = 1;\n end\n if n_proj && n_proj ~= n_x0,\n error( 'Size conflict detected between the projector and x0.' );\n end\n zero_x0 = ~nnz(x0);\n% Attempt 2: From the linear operator dimensions\nelseif ~size_ambig( inp_dims ),\n x0 = tfocs_zeros( inp_dims );\nelseif ~size_ambig( otp_dims ),\n A_x = tfocs_zeros( otp_dims );\n x0 = apply_linear( A_x, 2 );\nend\nif isempty( x0 ),\n error( 'Could not determine the dimensions of the problem. Please supply an explicit value for x0.' );\nend\nx = x0;\nif isinf( C_x ),\n C_x = apply_projector( x );\n if isinf( C_x ),\n zero_x0 = false;\n [ C_x, x ] = apply_projector( x, 1 );\n end\nend\nif isempty( A_x ),\n if identity_linop || zero_x0 && square_linop,\n A_x = x;\n elseif ~zero_x0 || size_ambig( otp_dims ), % Jan 2012: todo: give size_ambig the 'offset' information\n A_x = apply_linear( x, 1 ); % celldisp( size(A_x) )\n else\n A_x = tfocs_zeros( otp_dims );\n end\nend\n\n% New, Jan 2012\nif debug\n if ~adjoint, str1 = 'primal'; str2 = 'dual';\n else, str1 = 'dual'; str2 = 'primal'; \n end\n fprintf(fid,'------- DEBUG INFO -----------\\n');\n offsetPossible = offset && ~adjoint;\n fprintf(fid,'Size of %s variable, via method 1\\n', str1);\n print_cell_size( size(x0), fid, offsetPossible);\n fprintf(fid,'Size of %s variable, via method 2\\n', str1);\n print_cell_size( inp_dims, fid, offsetPossible); \n \n offsetPossible = offset && adjoint;\n fprintf(fid,'Size of %s variable, via method 1\\n', str2);\n print_cell_size( size(A_x), fid, offsetPossible);\n fprintf(fid,'Size of %s variable, via method 2\\n', str2);\n print_cell_size( otp_dims, fid, offsetPossible); \n fprintf(fid,'------------------------------\\n');\nend\n% Added Dec 2012, check for bad sizes that are not integers\nif ~isequal( otp_dims, tfocs_round(otp_dims) )\n error('Output dimensions must be integer valued');\nend\nif ~isequal( inp_dims, tfocs_round(inp_dims) )\n error('Input dimensions must be integer valued');\nend\n\n% Final size check\n[ isOK1, inp_dims ] = size_compat( size(x0), inp_dims );\n[ isOK2, otp_dims ] = size_compat( size(A_x), otp_dims );\nif ~isOK1 || ~isOK2,\n if debug\n if ~isOK1\n fprintf(fid,'Debug message: size of %s variables did not line up\\n',str1);\n end\n if ~isOK2\n fprintf(fid,'Debug message: size of %s variables did not line up\\n',str2);\n end\n end\n error( 'Could not determine the dimensions of the problem. Please supply an explicit value for x0.' );\nend\n[ f_x, g_Ax ] = apply_smooth( A_x );\nif isinf( f_x ),\n error( 'The initial point lies outside of the domain of the smooth function.' );\nend\n% Adding Feb 2011: \nif isa(g_Ax,'tfocs_tuple')\n get_dual = @(g_Ax) get( g_Ax, saddle_ndxs );\nelse\n get_dual = @(g_Ax) g_Ax;\nend\n\n% Theta advancement function\n% if mu > 0 && Lexact > mu \nif mu > 0 && ~isinf(Lexact) && Lexact > mu, % fixed Dec 2011\n if ~strcmp(alg,'N83')\n warnState = warning('query','backtrace');\n warning off backtrace\n warning('TFOCS:OptionsStructure',' Lexact and mu>0 specifications only give guaranteed convergence with N83 algorithm');\n if strcmp(alg,'AT')\n warning('TFOCS:OptionsStructure',' (With AT algorithm, known to give wrong solutions sometimes when mu>0)');\n end\n warning(warnState);\n end\n % Note that we have not yet derived theory to adapt this to\n % a local Lipschitz constant but that it should be possible\n theta_scale = sqrt(mu / Lexact);\n theta_scale = ( 1 - theta_scale ) / ( 1 + theta_scale );\n advance_theta = @(theta_old,L,L_old) min(1,theta_old*theta_scale);\nelse\n advance_theta = @(theta_old,L,L_old) 2/(1+sqrt(1+4*(L/L_old)/theta_old.^2));\nend\n\n% Preallocate the arrays for the output structure\nout.alg = alg; \nout.algorithm = algorithm;\nif ~isempty(errFcn) && ~iscell(errFcn),\n errFcn = { errFcn };\nend\nif ~isempty(stopFcn) && ~iscell(stopFcn),\n stopFcn = { stopFcn };\nend\nerrs = zeros(1,length(errFcn));\nif nargoutt == 1,\n saveHist = false;\nend\nif saveHist,\n [ out.f, out.normGrad, out.stepsize, out.theta ] = deal( zeros(0,1) );\n if countOps,\n out.counts = zeros(0,length(tfocs_count___));\n end\n if ~isempty(errFcn),\n out.err = zeros(0,length(errs));\n end\nend\nif saddle,\n out.dual = [];\nend\nn_iter = 0;\nstatus = '';\n\n% Initialize the iterate values\ny = x; z = x;\nA_y = A_x; A_z = A_x;\nC_y = Inf; C_z = C_x;\nf_y = f_x; f_z = f_x;\ng_y = g_x; g_z = g_x;\ng_Ay = g_Ax; g_Az = g_Ax;\nnorm_x = sqrt( tfocs_normsq( x ) );\n\n% for recomputing linear operators\ncntr_Ay = 0;\ncntr_Ax = 0;\n\n% Special setup for constant step sizes\nif beta >= 1,\n beta = 1;\n\talpha = 1;\nend\n\n% Print the opening text\nif fid && printEvery,\n\tfprintf(fid,'%s\\n',algorithm);\n\tfprintf(fid,'Iter Objective |dx|/|x| step');\n if countOps, fprintf( fid, ' F G A N P' ); end\n if ~isempty(errFcn)\n nBlanks = max( [0, length(errFcn)*9 - 9] );\n fprintf( fid, ' errors%s',repmat(' ',nBlanks,1) ); \n end\n if printStopCrit, fprintf( fid, ' stopping criteria' ); end\n fprintf( fid, '\\n' );\n\tfprintf(fid,'----+----------------------------------' );\n if countOps, fprintf( fid, '+-------------------------------' ); end\n% if ~isempty(errFcn), fprintf( fid, '+-------------------' ); end\n if ~isempty(errFcn)\n fprintf( fid, '+%s', repmat('-',1+length(errFcn)*9,1) );\n end\n \n \n if printStopCrit, fprintf( fid, '+%s', repmat('-',19,1) ); end\n \n \n fprintf(fid,'\\n');\nend\n\n% Initialize some variables\njust_restarted = false;\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/private/tfocs_iterate.m", "content": "%SOLVER_ITERATE TFOCS helper script\n%\tPerforms the iterate processing common to all of the first-order solvers\n%\n% Major inputs: x, x_old, xy , A_x, A_y, g_Ax, g_Ay \n% (does not need g_x or g_y really)\n\n% Test for positive stopping criteria\nn_iter = n_iter + 1;\nnorm_x = sqrt( tfocs_normsq( x ) );\nnorm_dx = sqrt( tfocs_normsq( x - x_old ) );\n% We also handle legacy stopping criteria used in the paper:\nif stopCrit == 2 && beta >= 1\n % xy_sq not already computed\n xy = x - y;\n xy_sq = tfocs_normsq( xy );\nend\nif isnan( f_y ),\n\tstatus = 'NaN found -- aborting';\nelseif (stopCrit == 1) && norm_dx == 0\n if n_iter > 1\n status = 'Step size tolerance reached (||dx||=0)';\n end\nelseif (stopCrit == 1) && norm_dx < tol * max( norm_x, 1 ),\n status = 'Step size tolerance reached';\nelseif (stopCrit == 2) && L*sqrt(xy_sq) < tol,\n status = 'Step size tolerance reached';\nelseif n_iter == maxIts,\n\tstatus = 'Iteration limit reached';\nelseif countOps && any( tfocs_count___ >= maxCounts ),\n\tstatus = 'Function/operator count limit reached';\nelseif backtrack_steps > 0 && xy_sq == 0,\n status = sprintf('Unexpectedly small stepsize after %d backtrack steps',backtrack_steps);\nend\n\n% for stopCrit 3, we need the new and old dual points\nif stopCrit == 3 || stopCrit == 4\n if ~saddle, error('stopCrit = {3,4} requires a saddle point problem'); end\n if exist('cur_dual','var')\n old_dual = cur_dual;\n else\n old_dual = [];\n end\nend\n\n%\n% For stopping criteria or algorithm control, we assume that the user\n% needs the objective function value, but does not wish to do any more\n% computation than necessary. So we will use the function value for y\n% instead of x if that is cheaper to obtain. So here we determine what\n% the additional computational costs will be, and choose the path that\n% minimizes them, favoring x in the case of a tie.\n%\n\nv_is_x = false;\nv_is_y = false;\n% if isempty(status) && ( ~isempty(stopFcn) || restart < 0 || stopCrit == 3 || stopCrit ==4 ),\nif (isempty(status) || ~isempty(findstr(status,'limit')) ) ...\n && ( ~isempty(stopFcn) || restart < 0 || stopCrit == 3 || stopCrit ==4 ),\n need_dual = saddle && (~isempty(stopFcn) || stopCrit == 3 || stopCrit == 4 );\n comp_x = [ isinf(f_x), need_dual*isempty(g_Ax), isinf(C_x) ];\n comp_y = [ isinf(f_y), need_dual*isempty(g_Ay), isinf(C_y) ];\n if sum(comp_x) <= sum(comp_y) || stopping_criteria_always_use_x,\n if comp_x(2), [f_x,g_Ax] = apply_smooth(A_x);\n elseif comp_x(1), f_x = apply_smooth(A_x); end\n if comp_x(3), C_x = apply_projector(x); end\n cur_pri = x; \n if saddle, cur_dual = g_Ax; end\n f_v = maxmin*(f_x+C_x);\n v_is_x = true; % 12/18/2013\n else\n if comp_y(2), [f_y,g_Ay] = apply_smooth(A_y);\n elseif comp_y(1), f_y = apply_smooth(A_y); end\n if comp_y(3), C_y = apply_projector(y); end\n cur_pri = y; \n if saddle, cur_dual = g_Ay; end\n f_v = maxmin*(f_y+C_y);\n v_is_y = true;\n if data_collection_always_use_x\n % save the data, otherwise it is overwritten\n f_vy = f_v;\n if saddle, dual_y = cur_dual; end\n end\n end\n for err_j = 1 : numel(stopFcn),\n if isa(stopFcn{err_j},'function_handle') % added Oct 27 '14; corrected Aug 22 '17\n if saddle,\n stop = stopFcn{err_j}(f_v,cur_pri, get_dual(cur_dual) );\n else\n stop = stopFcn{err_j}(f_v,cur_pri);\n end\n if stop\n if v_is_x, x_or_y_string = 'x'; else x_or_y_string = 'y'; end\n status = sprintf('Reached user''s supplied stopping criteria no. %d using %s variable',err_j,x_or_y_string);\n end\n end\n end\nend\n\n% Now we can apply stopCrit 3 if it has been requested:\nif (stopCrit == 3 || stopCrit == 4 ) \n if ~isempty( old_dual ) && ~isempty( cur_dual )\n d_dual = sqrt(tfocs_normsq( old_dual - cur_dual ));\n if isnumeric( cur_dual ),\n norm_cur = tfocs_normsq( cur_dual );\n norm_old = tfocs_normsq( old_dual );\n else\n norm_cur = 0;\n norm_old = 0;\n for j = 1:max( [1, numel(cur_dual)-1] )\n norm_cur = norm_cur + tfocs_normsq( cur_dual{j} );\n norm_old = norm_old + tfocs_normsq( old_dual{j} );\n end\n end\n norm_cur = sqrt(norm_cur);\n norm_old = sqrt(norm_old);\n else\n d_dual = Inf;\n norm_cur = 0; \n norm_old = 0;\n end\n \n\t% Note: it is common for the duals to be stuck at zero for quite a few\n % iterations at the beginning. In stopCrit = 4 mode, we will not\n % terminate if both the current and old dual are zero.\n \n if stopCrit == 4\n % for \"4\", we look at relative change, not absolute change\n if norm_cur > 10*eps && norm_old > 10*eps\n d_dual = d_dual / norm_cur;\n else\n % The dual vectors are zero, so do not terminate.\n % This is equivalent to defining 0/0 = Inf;\n d_dual = Inf;\n end\n end\n nLargeEnough = (n_iter > 2); % Dec '13\n if restart > 10\n nLargeEnough = (n_iter - restart_iter > 2);\n end\n if d_dual < tol && nLargeEnough\n % Problems when cur_dual is base on x one iteration\n % and y another iteration\n status = 'Step size tolerance reached';\n end\nend\n\n\n\n%\n% Data collection. Since this is used only for algorithm analysis and not\n% for algorithm control, we are free to make additional computations here\n% without adding them to our total algorithm cost. We prefer to track the\n% x sequence in this case, since it is what we will ultimately choose as\n% the solution at the end of the algorithm.\n%\n\nwill_print = fid && printEvery && ...\n ( ~isempty( status ) || ~mod( n_iter, printEvery ) || (printRestart && just_restarted) );\nif saveHist || will_print,\n % Which point to collect data at? Dec '13, by default, collect data\n % at the same point used to find f_v unless data_collection_always_use_x\n % There is also the chance that the f_v wasn't calculated at all\n if ( data_collection_always_use_x && ~v_is_x ) || ( ~v_is_x && ~v_is_y )\n f_x_save = f_x;\n g_Ax_save = g_Ax;\n if ~isempty(errFcn) && saddle,\n if isempty(g_Ax),\n [ f_x, g_Ax ] = smoothF( A_x );\n end\n% out.dual = get_dual( g_Ax );\n cur_dual = g_Ax ;\n end\n if isinf(f_x),\n f_x = smoothF( A_x );\n end\n if isinf( C_x ),\n C_x = projectorF( x );\n end\n f_v = maxmin * ( f_x + C_x );\n cur_pri = x;\n v_is_x = true;\n % Now undo any calculations\n f_x = f_x_save;\n g_Ax = g_Ax_save;\n end\n % (otherwise, f_v was already calculated)\n \n if ~isempty(errFcn) && iscell(errFcn)\n errs = zeros(1,numel(errFcn));\n for err_j = 1 : numel(errFcn),\n if saddle,\n% errs(err_j) = errFcn{err_j}(f_w,x,out.dual);\n % April 14 '14\n %if isempty( get_dual(cur_dual) )\n % March 10 '15\n if isempty(cur_dual) || isempty( get_dual(cur_dual) )\n errs(err_j) = errFcn{err_j}(f_v,cur_pri,0);\n else\n errs(err_j) = errFcn{err_j}(f_v,cur_pri,get_dual(cur_dual));\n end\n else\n errs(err_j) = errFcn{err_j}(f_v,cur_pri);\n end\n end\n \n % Oct 27 '14. If stopFcn is a number, then we stop\n % if errFcn(1) is less than or equal to this number\n if ~isempty(stopFcn)\n for err_j = 1 : numel(stopFcn),\n if isnumeric(stopFcn{err_j})\n stop = errs(1) <= stopFcn{err_j};\n if stop\n status = sprintf(...\n 'Reached user''s supplied stopping criteria of %.2e',stopFcn{err_j});\n end\n end\n end\n end\n \n end\n \nend\n\n\n% Register a warning if the step size suggests a Lipschitz violation\nif isempty(status) && ( beta < 1 && backtrack_simple && localL > Lexact ),\n warning_lipschitz = true;\nend\t\n\n% Print status\nif will_print,\n if warning_lipschitz,\n warning_lipschitz = false;\n bchar = 'L';\n elseif backtrack_simple,\n bchar = ' '; \n else\n bchar = '*'; \n end\n\tfprintf( fid, '%-4d| %+12.5e %8.2e %8.2e%c', ...\n n_iter, f_v, norm_dx / max( norm_x, 1 ), 1 / L, bchar );\n if countOps,\n fprintf( fid, '|' );\n fprintf( fid, ' %5d', tfocs_count___ );\n end\n if ~isempty(errFcn),\n if countOps,\n fprintf( fid, ' ' );\n end\n \tfprintf( fid, '|' );\n fprintf( fid, ' %8.2e', errs );\n end\n \n \n if printStopCrit\n % Display the number used to determine stopping\n\n switch stopCrit\n case 1\n if exist('norm_dx','var') && exist('norm_x','var')\n stopResid = norm_dx/max( norm_x,1);\n else\n stopResid = Inf;\n end\n case 2\n stopResid = L*sqrt(xy_sq);\n case {3,4}\n if exist('d_dual','var')\n stopResid = d_dual;\n end\n case Inf\n % do nothing\n stopResid = 0;\n otherwise\n error('Bad stopCrit value');\n end\n \n if ~isempty(errFcn) || countOps\n fprintf( fid, ' ' );\n end\n fprintf( fid, '|' );\n fprintf( fid, ' %8.2e', stopResid );\n end\n \n if printRestart && just_restarted\n fprintf( fid, ' | restarted');\n end\n \n\tfprintf( fid, '\\n');\nend\n\n% Save history, extending arrays if needed\nif saveHist,\n if length(out.f) < n_iter && isempty(status),\n csize = min(maxIts,length(out.f)+1000);\n out.f(end+1:csize,1) = 0;\n out.theta(end+1:csize,1) = 0;\n out.stepsize(end+1:csize,1) = 0;\n out.normGrad(end+1:csize,1) = 0;\n if countOps,\n out.counts(end+1:csize,:) = 0;\n end\n if ~isempty(errs),\n out.err(end+1:csize,:) = 0;\n end\n end\n out.f(n_iter) = f_v;\n out.theta(n_iter) = theta;\n out.stepsize(n_iter) = 1 / L;\n out.normGrad(n_iter) = norm_dx;\n if countOps,\n out.counts(n_iter,:) = tfocs_count___;\n end\n if ~isempty(errFcn),\n out.err(n_iter,:) = errs;\n end\nend\n\n% Exit if positive stopping criteria met\n% if ~isempty( status ),\n% \tbreak;\n% end\n\n% for R2015b compatibility:\ndo_break = false;\nif ~isempty( status )\n do_break = true;\nelse\n\n% Restart acceleration if necessary\nbacktrack_steps = 0;\n% \"No regress\" feature: test was (maxmin*f_v > f_v_old)\n% This worked for minimization, but not for maximization! Dec 15 2010.\n% Fixed it.\n% two changes: (1) test is now ( maxmin*f_v > maxmin*f_v_old)\n% (2) to reset f_v_old, set to maxmin*Inf, not just +Inf\n% Dec 2013, adding gradient-based restarting (see O'Donoghue and Candes '12)\njust_restarted = false;\ndo_auto_restart = false;\nif restart < 0\n if strfind(lower(autoRestart),'gra')\n do_auto_restart = tfocs_dot(g_Ay, A_x - A_x_old ) > 0;\n elseif any(strfind(lower(autoRestart),'fun')) || any(strfind(lower(autoRestart),'obj'))\n do_auto_restart = maxmin*f_v > maxmin*f_v_old;\n else\n error('bad value for opts.autoRestart. Should be ''gradient'' or ''function''');\n end\nend\nif n_iter - restart_iter == abs(round(restart)) || do_auto_restart\n restart_iter = n_iter;\n backtrack_simple = true;\n\ttheta = Inf;\n y = x; A_y = A_x; f_y = f_x; g_Ay = g_Ax; g_y = g_x; C_y = C_x;\n z = x; A_z = A_x; f_z = f_x; g_Az = g_Ax; g_z = g_x; C_z = C_x;\n f_v_old = maxmin*Inf; % important!\n% continue;\n just_restarted = true;\nelseif restart < 0,\n f_v_old = f_v;\nend\n\nC_y = Inf;\n\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/private/tfocs_prox.m", "content": "function op = tfocs_prox( f, prox_f, VECTOR_SCALAR )\n% OP = TFOCS_PROX( F, PROX_F )\n% combines F and PROX_F into the appropriate TFOCS-compatible object.\n%\n% F is any function (with known proximity operator),\n% and PROX_F is its proximity operator, defined as:\n%\n% PROX_F( Y, t ) = argmin_X F(X) + 1/(2*t)*|| X - Y ||^2\n%\n% To use this, please see the file PROX_L1 as an example\n%\n% The basic layout of a file like PROX_L1 is as follows:\n% ( for the function F(X) = q*||X||_1 )\n%\n% function op = prox_l1(q)\n% op = tfocs_prox( @f, @prox_f )\n%\n% function v = f(x)\n% ... this function calculates the function f ...\n% end\n% function v = prox_f(y,t)\n% ... this function calculates the prox-function to f ...\n% end\n% end\n%\n% Note: in the above template, the \"end\" statements are very important.\n%\n% OP = TFOCS_PROX( F, PROX_F, 'vector')\n% will signal the routine that it is OK to allow \"vector\" stepsizes\n% (this corresponds to solving\n% PROX_F( Y, T ) = argmin_X F(X) + 1/2( X-Y )'*diag(1./T)*( X-Y )\n% where T is a vector of the same size as X ).\n% ... = TFOCS_PROX( F, PROX_F, 'scalar' )\n% will throw an error if a vector stepsize is attempted. This is the default.\n%\n% Also, users may wish to test their smooth function\n% with the script TEST_NONSMOOTH\n%\n% See also prox_l1, test_nonsmooth\n\nif nargin < 3 || isempty(VECTOR_SCALAR)\n VECTOR_SCALAR = 'scalar';\nend\n\nif strcmpi(VECTOR_SCALAR,'scalar')\n% op = @fcn_impl; % comment this out and use octave-compatible version below:\n% op = @(x,t)fcn_impl(f,prox_f,x,t); % this doesn't work: requires 2 inputs always\n op = @(varargin)fcn_impl(f,prox_f,varargin{:});\nelseif strcmpi(VECTOR_SCALAR,'vector')\n% op = @fcn_impl_vector; % comment this out and use octave-compatible version below:\n% op = @(x,t)fcn_impl_vector(f,prox_f,x,t); % this doesn't work: requires 2 inputs always\n op = @(varargin)fcn_impl_vector(f,prox_f,varargin{:});\nelse\n error('bad option for VECTOR_SCALAR parameter');\nend\n\nfunction [ v, x ] = fcn_impl(f,prox_f,x, t )\n if nargin < 3,\n error( 'Not enough arguments.' );\n end\n if nargin == 4,\n if numel(t) ~= 1, error('The stepsize must be a scalar'); end\n x = prox_f(x,t);\n elseif nargout == 2,\n error( 'This function is not differentiable.' );\n end\n v = f(x);\nend\n\nfunction [ v, x ] = fcn_impl_vector(f,prox_f,x, t )\n if nargin < 3,\n error( 'Not enough arguments.' );\n end\n if nargin == 4,\n x = prox_f(x,t);\n elseif nargout == 2,\n error( 'This function is not differentiable.' );\n end\n v = f(x);\nend\n\n% - Octave incompatible version: -\n% function [ v, x ] = fcn_impl(x, t )\n% if nargin < 1,\n% error( 'Not enough arguments.' );\n% end\n% if nargin == 2,\n% if numel(t) ~= 1, error('The stepsize must be a scalar'); end\n% x = prox_f(x,t);\n% elseif nargout == 2,\n% error( 'This function is not differentiable.' );\n% end\n% v = f(x);\n% end\n% \n% function [ v, x ] = fcn_impl_vector(x, t )\n% if nargin < 1,\n% error( 'Not enough arguments.' );\n% end\n% if nargin == 2,\n% x = prox_f(x,t);\n% elseif nargout == 2,\n% error( 'This function is not differentiable.' );\n% end\n% v = f(x);\n% end\n\n\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information." }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/private/tfocs_round.m", "content": "function y = tfocs_round(x)\nif iscell( x ),\n y = cellfun( @tfocs_round, x, 'UniformOutput', false );\nelse\n y = round( x );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/private/tfocs_smooth.m", "content": "function op = tfocs_smooth( fcn )\n% OP = TFOCS_SMOOTH(FCN)\n% is a wrapper designed to facilitate users writing their own\n% smooth functions.\n%\n% To use this, please see the file SMOOTH_HUBER as an example\n%\n% The basic layout of a file like SMOOTH_HUBER is as follows:\n%\n% function op = smooth_huber(mu)\n% op = tfocs_smooth( @huber_impl )\n%\n% function [f,g] = huber_impl(x)\n% ... this function calculates the function, f,\n% and the gradient, g, of x ...\n% end\n% end\n%\n% Note: in the above template, the \"end\" statements are very important.\n%\n%\n% Also, users may wish to test their smooth function\n% with the script TEST_SMOOTH\n%\n% See also smooth_huber, test_smooth, private/tfocs_smooth, smooth_handles\n\n\nop = @fcn_impl;\n\nfunction [ v, g ] = fcn_impl(x, t )\n if nargin == 2,\n error( 'Proximity minimization not supported by this function.' );\n end\n if nargout == 2\n [v,g] = fcn(x);\n else\n v = fcn(x);\n end\nend\n\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information." }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/private/tfocs_zeros.m", "content": "function z = tfocs_zeros( y )\nswitch class( y ),\n case 'double',\n % SRB: this was the old code. This function was intended\n % to be called as tfocs_zeros( size(y) )\n % But, for packSVD, I'd prefer to call it as tfocs_zeros(y)\n % so that we can look at the type of y and pass it off\n % accordingly (see 'packSVD' section below).\n % This would break old code. But, it appears that all\n % calls of this use the { [n1,n2], [m1,m2] } form of sz\n % (as opposed to the [m1,n1] convention), so\n % I don't think this will break anything.\n \n % Old code:\n % \tz = zeros( y );\n\n % New code:\n % Try to catch cases where we thing y = [m,n] is a size:\n% if numel(y) == 2 && isint(y(1)) && isint(y(2))\n % March 2011, fixing this to work with 3D arrays\n % If you want to use 4D arrays, you must modify this in a similar\n % fasion; we don't do that before hand since it makes it more likely\n % that the wrong case is picked.\n if (numel(y) == 2 || numel(y) == 3) && all(isint(y))\n z = zeros( y );\n else\n z = zeros( size(y) );\n end\n\n case 'cell',\n if isa( y{1}, 'function_handle' ),\n z = y{1}( y{2:end} );\n else\n for k = 1 : numel(y),\n y{k} = tfocs_zeros( y{k} );\n end\n z = tfocs_tuple( y );\n end\n case 'packSVD'\n %z = packSVD>tfocs_zeros(y);\n z = packSVD_zeros(y);\n otherwise\n error('TFOCS_ZEROS: cannot handle this type of object');\nend\n\n% do NOT use \"isinteger\" because that tests for the integer data type.\nfunction h = isint(y)\nh = abs( round(y) - y ) < 10*abs(y)*eps;\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n \n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/project_WeightedNorm.m", "content": "%{\n\nIt is very quick and basically closed-form to project onto ||x||_1\n\ne.g. Proj_x0 = argmin_{ ||x||_1 <= 1 } 1/2|| x - x0 ||^2\n\nbut it is hard to project onto the set ||Wx||_1 <= 1, for general W\n(i.e. non-invertible)\n\nHere we show how to solve the weighted projection with an iterative method\n\n%}\n\nN = 100;\nx0 = randn(N,1);\nW = randn(2*N,N);\n%% project x0 onto l1 ball, no weighting (easy: one-step)\ntau = .8*norm(x0,1); % make sure x0 isn't already feasibly\nprojection = proj_l1(tau);\n[value,projX] = projection(x0,1);\nfprintf('tau - ||x||_1 is %.2e\\n', tau - norm(projX,1) );\n\n\n%% project x0 onto l1 ball, with weighting (harder: iterate)\ntau = .92*norm(W*x0,1);\n\nmu = 1; % any value works\ne = abs(eig(W'*W)/mu);\nL = max(e);\nstrngCvxty = min(e); \nopts = [];\nopts.alg = 'AT'; \n% opts.alg = 'N83';\n% opts.alg = 'GRA';\nopts.tol = 1e-12;\nopts.maxits = 500;\n\nopts.L0 = L;\nopts.Lexact = L; \nopts.mu = strngCvxty;\n\n% opts.beta = 1; % prevents backtracking\nopts.printEvery = 5;\n\n% opts.restart = 5;\n\np = prox_linf(tau); % project onto the ||z||_1 <= tau ball\n[projWX,outData,optsOut] = tfocs_SCD( [],W,p, mu, x0, [], opts );\n\nfprintf('tau - ||Wx||_1 is %.2e, and x0 and projected version differ by %.2e\\n', ...\n tau - norm(W*projWX,1), norm(x0-projWX)/norm(x0) );\n\n% Check that we are within allowable bounds\nif abs(tau - norm(W*projWX,1)) < 1e-10\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information." }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_LASSO.m", "content": "%{\n Tests the LASSO ( aka L1 regularized Least Squares) problem\n\n min_x lambda*||x||_1 + .5||A(x)-b||_2^2\n\nsee also test_sBPDN.m\n\n%}\n\n% Before running this, please add the TFOCS base directory to your path\nmyAwgn = @(x,snr) x + ...\n 10^( (10*log10(sum(abs(x(:)).^2)/length(x(:))) - snr)/20 )*randn(size(x));\n%%\n% Try to load the problem from disk\nfileName = fullfile(tfocs_where,...\n 'examples','smallscale','reference_solutions','lasso_problem1_noisy');\nrandn('state',34324);\nrand('state',34324);\nN = 1024;\nM = round(N/2);\nK = round(M/5);\nA = randn(M,N);\n% give A unit-normed columns\nA = bsxfun(@times,A,1./sqrt(sum(A.^2,1)));\nif exist([fileName,'.mat'],'file') \n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\nelse\n \n % Generate a new problem\n x = zeros(N,1);\n T = randsample(N,K);\n x(T) = randn(K,1);\n\n b_original = A*x;\n snr = 30; % SNR in dB\n sigma = 10^( (10*log10( norm(b_original)^2/N) - snr)/20 );\n b = myAwgn(b_original,snr);\n x_original = x;\n \n lambda = 2*sigma*sqrt(2*log(N)); % for when A has unit-normed columns\n x0 = zeros(N,1);\n\n % get reference via CVX\n tic\n cvx_begin\n cvx_precision best\n variable xcvx(N,1)\n minimize lambda*norm(xcvx,1) + sum_square( A*xcvx - b)/2\n cvx_end\n time_IPM = toc;\n x_ref = xcvx;\n obj_ref = lambda*norm(x_ref,1) + sum_square( A*xcvx - b)/2;\n \n save(fileName,'x_ref','b','x_original','lambda',...\n 'sigma','b_original','obj_ref','x0','time_IPM','snr');\n fprintf('Saved data to file %s\\n', fileName);\n \nend\n\nx_ref = x_ref.*( abs(x_ref) > 1e-8 );\n[M,N] = size(A);\nK = nnz(x_original);\nnorm_x_ref = norm(x_ref);\nnorm_x_orig = norm(x_original);\ner_ref = @(x) norm(x-x_ref)/norm_x_ref;\ner_signal = @(x) norm(x-x_original)/norm_x_orig;\nresid = @(x) norm(A*x-b)/norm(b); % change if b is noisy\n\nfprintf('\\tA is %d x %d, original signal has %d nonzeros\\n', M, N, K );\nfprintf('\\tl1-norm solution and original signal differ by %.2e (lambda = %.2e)\\n', ...\n norm(x_ref - x_original)/norm(x_original),lambda );\n\n%% Call the TFOCS solver\ner = er_ref; % error with reference solution (from IPM)\nopts = struct('restart',-Inf,'tol',1e-13,'maxits',1000);\nopts.errFcn = { @(f,primal) er(primal), ...\n @(f,primal) f - obj_ref }; \ntic;\n[ x, out, optsOut ] = solver_L1RLS( A, b, lambda, x0, opts );\ntime_TFOCS = toc;\n\nfprintf('Solution has %d nonzeros. Error vs. IPM solution is %.2e\\n',...\n nnz(x), er(x) );\n\n% Check that we are within allowable bounds\nif out.err(end,1) < 1e-7\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_LMI.m", "content": "%{\n Via smoothing, TFOCS can solve Linear Matrix Inequalities (LMI)\n (these are equivalent to the dual of a SDP in standard form)\n\n min_y \n s.t. A_0 + sum_i=1^M A_i * y(i) >= 0\n\nwhere \">=\" refers to the positive semi-definite cone.\n\"b\" and \"y\" are vectors of length M,\nand A_i (i = 0, 1, ..., M)\nare symmetric or Hermian matrices of size N x N\n(where M <= N^2 )\n\nTFOCS assumes that all the A_i matrices (i=1,...,M; the A_0 matrix is\nhandled separately) are efficiently stored in one big \"A\" matrix\nso that we can compactly replace the sum_i A_i * y(i)\nwith mat( A'*y ), where mat() is a reshaping operator.\nThe code below shows how we do this.\n\n See also test_SDP.m\n\n If we identify A0 with -C, then this is the dual of the SDP in standard form.\n\n%}\n\n% Add TFOCS to your path.\n\nrandn('state',9243); rand('state',23432);\n\nN = 30;\nM = round(N^2/4);\n\nsymmetrize = @(X) (X+X')/2;\nvec = @(X) X(:);\nmat = @(y) reshape(y,N,N);\n\nAcell = cell(M,1);\nfor m = 1:M\n Acell{m} = symmetrize( randn(N) );\nend\n\n% Put \"Acell\" into a matrix:\nA = zeros(M,N^2);\nfor m = 1:M\n A(m,:) = vec( Acell{m} );\nend\nnormA = normest(A,1e-2);\n\nb = randn(M,1);\ny = randn(M,1); \nA0 = mat(A'*y); % want A0 in range of A', otherwise infeasible or unbounded\n\nfileName = fullfile('reference_solutions','LMI');\nif exist([fileName,'.mat'],'file')\n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\nelse\n cvx_begin\n variable y(M)\n minimize( b'*y )\n subject to\n A0 + mat(A'*y) >= 0\n cvx_end\n y_cvx = y;\n save(fullfile(pwd,fileName),'y_cvx');\n fprintf('Saved data to file %s\\n', fileName);\nend\n\n%% solve via TFOCS\nmu = 1e-3;\nopts = [];\nopts.errFcn = @(f,d,y) norm( y - y_cvx)/norm(y_cvx);\n\ny0 = []; z0 = [];\n[yy, out, opts ] = solver_sLMI( A0, A, b, mu, y0, z0, opts );\n\n% Check that we are within allowable bounds\nif out.err(end) < 1e-8\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n\n%% Version with complex variables:\nrandn('state',9243); rand('state',23432);\nN = 30;\nM = round(N^2/4);\nAcell = cell(M,1);\nfor m = 1:M\n Acell{m} = symmetrize( randn(N) + 1i*randn(N) );\nend\nA = zeros(M,N^2);\nfor m = 1:M\n A(m,:) = vec( Acell{m} );\nend\nnormA = normest(A,1e-2);\n\nb = randn(M,1); % this should always be real\ny = randn(M,1); % this should always be real\nA0 = mat(A'*y); % this may be complex\n\nfileName = 'reference_solutions/LMI_complex';\nif exist([fileName,'.mat'],'file')\n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\nelse\n cvx_begin\n variable y(M)\n minimize( b'*y )\n subject to\n A0 + mat(A'*y) == semidefinite(N)\n cvx_end\n y_cvx = y;\n save(fullfile(pwd,fileName),'y_cvx');\n fprintf('Saved data to file %s\\n', fileName);\nend\n\n% and solve via TFOCS:\nmu = 1e-3;\nopts = [];\nopts.errFcn = @(f,d,y) norm( y - y_cvx)/norm(y_cvx);\ny0 = []; z0 = [];\n[yy, out, opts ] = solver_sLMI( A0, A, b, mu, y0, z0, opts );\n\n% Check that we are within allowable bounds\nif out.err(end) < 1e-8\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_LinearProgram.m", "content": "%{\n Via smoothing, TFOCS can solve a Linear Program (LP) in standard form:\n\n(P) min c'x s.t. x >= 0, Ax=b\n\n\n This extends to SDP as well (see test_SDP.m )\n%}\n\n% Add TFOCS to your path.\n\nrandn('state',9243); rand('state',234324');\n\nN = 5000;\nM = round(N/2);\nx = randn(N,1)+10;\nA = sprand(M,N,.01);\nc = randn(N,1);\nb = A*x;\nif issparse(A)\n normA = normest(A);\nelse\n normA = norm(A);\nend\n\nfileName = fullfile('reference_solutions','LP');\nif exist([fileName,'.mat'],'file')\n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\nelse\n cvx_begin\n variable x(N)\n minimize( c'*x )\n subject to\n x >= 0\n A*x == b\n cvx_end\n x_cvx = x;\n save(fullfile(pwd,fileName),'x_cvx');\n fprintf('Saved data to file %s\\n', fileName);\nend\n\n%% solve in TFOCS\n\nopts = [];\nopts.errFcn = {@(f,d,x) norm( x - x_cvx )/norm(x_cvx )}; % optional\n% opts.errFcn{end+1} = @(f,d,x) norm( A*x - b )/norm(b ); % optional\nopts.restart = 2000;\nopts.continuation = true;\nx0 = [];\nz0 = [];\nmu = 1e-2;\nmu = 1e-3;\n\nopts.stopCrit = 4;\nopts.tol = 1e-4;\ncontOpts = []; % options for \"continuation\" settings\n% (to see possible options, type \"continuation()\" )\n% By changing the options, you can get much better results sometimes,\n% but here we use default choices for simplicity.\n% contOpts.accel = false;\n% contOpts.betaTol = 10;\n% contOpts.finalTol = 1e-10;\ncontOpts.maxIts = 10;\ncontOpts.initialTol = 1e-3;\n\nopts.normA = normA; % this will help with scaling\n[x,out,optsOut] = solver_sLP(c,A,b, mu, x0, z0, opts, contOpts);\n% Check that we are within allowable bounds\nif out.err(end) < 7e-2\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n%% plot\nfigure(2);\nsemilogy( out.err(:,1) );\n\n\n%% == TFOCS can also handle LPs with box constraints ==========\nrandn('state',9243); rand('state',234324');\n\nN = 3000;\nM = round(N/2);\nx = randn(N,1)+10;\nA = sprand(M,N,.01);\nc = randn(N,1);\nb = A*x;\n% There is no longer an automatic x >= 0 bound\n% (if you want to impose this, incorporate it into the lower bound)\nl = -2*ones(N,1); % lower bound\nu = 13*ones(N,1); % upper bound\nif issparse(A)\n normA = normest(A);\nelse\n normA = norm(A);\nend\n\nfileName = fullfile('reference_solutions','LP_box');\nif exist([fileName,'.mat'],'file')\n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\nelse\n cvx_begin\n variable x(N)\n cvx_precision best\n minimize( c'*x )\n subject to\n x >= l\n x <= u\n A*x == b\n cvx_end\n x_cvx = x;\n save(fullfile(pwd,fileName),'x_cvx');\n fprintf('Saved data to file %s\\n', fileName);\nend\n\n%% solve box-constrained version in TFOCS\n\nopts = [];\nopts.errFcn = {@(f,d,x) norm( x - x_cvx )/norm(x_cvx )}; % optional\nopts.restart = 2000;\nopts.continuation = true;\nx0 = [];\nz0 = [];\nmu = 1e-2;\n\nopts.stopCrit = 4;\nopts.tol = 1e-5;\ncontOpts = []; % options for \"continuation\" settings\ncontOpts.maxIts = 5;\ncontOpts.muDecrement = .8;\n% contOpts.accel = false;\n\nopts.normA = normA; % this will help with scaling\n[x,out,optsOut] = solver_sLP_box(c,A,b,l,u,mu, x0, z0, opts, contOpts);\n\n% Check that we are within allowable bounds\nif out.err(end) < 2e-2\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n\n%% plot box-constrained version\nfigure(2);\nsemilogy( out.err(:,1) );\n\n%% close figures\nclose all\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_SDP.m", "content": "%{\n Via smoothing, TFOCS can solve a Semi-definite Program (SDP) in standard form:\n\n(P) min s.t. X >= 0, A(X)=b\n\n\n This extends to LP as well (see test_LinearProgram.m )\n We can also solve the dual of SDP, which is LMI. See test_LMI.m\n%}\n\n% Add TFOCS to your path.\n\nrandn('state',9243); rand('state',234324');\n\nN = 80;\nM = round(N^2/2);\nX = randn(N); X = X*X';\nA = sprand(M,N^2,.005); \nC = randn(N); C = C + C';\nvec = @(X) X(:);\nmat = @(y) reshape(y,N,N);\n% Important: we want each row of A to be the vectorized form of the\n% symmetric matrix A_i. Otherwise, the dual problem makes no sense.\n% Here, we'll ensure this symmetry.\n% (BTW, due to how Matlab stores sparse arrays, we only want to make\n% column operations. So we'll operate on A' and then transpose back)\nAt = A';\nfor row = 1:M\n At(:,row) = vec( mat(At(:,row)) + mat(At(:,row))' )/2;\nend\nA = At'; clear At;\n\nb = A*vec(X);\n\nnormA = normest(A);\n\nfileName = fullfile('reference_solutions','SDP');\nif exist([fileName,'.mat'],'file')\n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\nelse\n cvx_begin sdp\n variable X(N,N) symmetric\n minimize trace( C*X )\n subject to\n X >= 0\n A*vec(X) == b\n cvx_end\n X_cvx = X;\n save(fullfile(pwd,fileName),'X_cvx');\n fprintf('Saved data to file %s\\n', fileName);\nend\n\n%% solve in TFOCS\n\nopts = [];\nopts.errFcn = {@(f,d,X) norm( X - X_cvx,'fro')/norm(X_cvx,'fro' )}; % optional\n% opts.errFcn{end+1} = @(f,d,X) norm( A*vec(X) - b )/norm(b); % optional\nopts.restart = 2000;\nopts.continuation = true;\nx0 = [];\nz0 = [];\nmu = 1;\n\nopts.stopCrit = 4;\nopts.tol = 1e-4;\ncontOpts = []; % options for \"continuation\" settings\n% (to see possible options, type \"continuation()\" )\n% By changing the options, you can get much better results sometimes,\n% but here we use default choices for simplicity.\n% contOpts.accel = false;\n% contOpts.betaTol = 10;\n% contOpts.finalTol = 1e-10;\n\nopts.normA = normA; % this will help with scaling\n[x,out,optsOut] = solver_sSDP(C,A,b, mu, x0, z0, opts, contOpts);\n% Check that we are within allowable bounds\nif out.err(end) < 5e-2\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n%% Here's another simple example, using complex valued variables\nrandn('state',9243); rand('state',234324');\n\nN = 20;\nM = round(N^2/1.3);\nX = randn(N) + 1i*randn(N); X = X*X'; % ensure Hermitian and pos. semi-def.\nA = sprandn(M,N^2,.01) + 1i*sprandn(M,N^2,.01);\nC = randn(N)+1i*randn(N); C = C + C'; % ensure Hermitian\nvec = @(X) X(:);\nmat = @(y) reshape(y,N,N);\n% Same as before...\nAt = A';\nfor row = 1:M\n At(:,row) = vec( mat(At(:,row)) + mat(At(:,row))' )/2;\nend\nA = At'; clear At;\n\n% Note: b should be real, but due to round errors it has as small imaginary part\nb = real(A*vec(X));\n\nnormA = linop_normest(A);\nfileName = 'reference_solutions/SDP_complex';\nif exist([fileName,'.mat'],'file')\n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\nelse\n cvx_begin sdp\n variable X(N,N) hermitian % note the change from symmetric to hermitian\n minimize real(trace( C*X )) % this should be real, but there are rounding errors\n subject to\n X >= 0\n real(A*vec(X)) == b\n cvx_end\n X_cvx = X;\n save(fullfile(pwd,fileName),'X_cvx');\n fprintf('Saved data to file %s\\n', fileName);\nend\n\n% and solve with TFOCS\nopts = [];\nopts.errFcn = {@(f,d,X) norm( X - X_cvx,'fro')/norm(X_cvx,'fro' )};\nopts.continuation = true;\nx0 = [];\nz0 = [];\nmu = 1e-3;\n% opts.cmode = 'C2R'; % explicitly tell it that we are complex. not necessary though\nopts.normA = normA; % this will help with scaling\nopts.stopCrit = 4;\nopts.tol = 1e-4;\n[x,out,optsOut] = solver_sSDP(C,A,b, mu, x0, z0, opts, contOpts);\n\n% Check that we are within allowable bounds\nif out.err(end) < 5e-2\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_SLOPE.m", "content": "%{\n Tests the Sorted/Ordered LASSO ( aka Ordered L1 regularized Least Squares) problem\n Also known as SLOPE for Sorted L-One Penalized Estimation\n\n min_x sum(lambda*sort(abs(x),'descend')) + .5||A(x)-b||_2^2\n\n lambda must be a vector in decreasing order, and all strictly positive\n\n Like the test_LASSO.m file, we will use the notation (A,b,x)\n In the paper mentioned below, this corresponds to the notation (X,y,beta)\n\n Reference:\n \"Statistical Estimation and Testing via the Ordered l1 Norm\"\n by M. Bogdan, E. van den Berg, W. Su, and E. J. Candès, 2013\n http://www-stat.stanford.edu/~candes/OrderedL1/\n\nsee also test_sBPDN.m and test_LASSO.m\n\n%}\n\n% Before running this, please add the TFOCS base directory to your path\nmyAwgn = @(x,snr) x + ...\n 10^( (10*log10(sum(abs(x(:)).^2)/length(x(:))) - snr)/20 )*randn(size(x));\n%%\n% Try to load the problem from disk\nfileName = fullfile(tfocs_where,...\n 'examples','smallscale','reference_solutions','ordered_lasso_problem1_noisy');\nrandn('state',34324);\nrand('state',34324);\nN = 1024;\nM = round(N/2);\nK = round(M/5);\nA = randn(M,N);\n% give A unit-normed columns\nA = bsxfun(@times,A,1./sqrt(sum(A.^2,1)));\nif exist([fileName,'.mat'],'file')\n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\nelse\n \n % Generate a new problem\n x = zeros(N,1);\n T = randsample(N,K);\n x(T) = randn(K,1);\n\n b_original = A*x;\n snr = 30; % SNR in dB\n sigma = 10^( (10*log10( norm(b_original)^2/N) - snr)/20 );\n b = myAwgn(b_original,snr);\n x_original = x;\n \n lambda = 2*sigma*sqrt(2*log(N)); % for when A has unit-normed columns\n % Now, we diverge from test_LASSO.m, and make lambda a vector\n% lambda = fliplr( linspace(.5*lambda,2*lambda,N) )';\n lambda = .5*lambda + 1.5*lambda*rand(N,1); lambda = sort(lambda,'descend')\n \n x0 = zeros(N,1);\n\n % We cannot get the solution via CVX easily, so solve using our method\n opts = struct('restart',-Inf,'tol',1e-13,'maxits',1000, 'printEvery',10);\n [ x, out, optsOut ] = solver_SLOPE( A, b, lambda, x0, opts );\n x_ref = x;\n obj_ref = norm(A*x-b)^2/2 + sum(lambda(:).*sort(abs(x),'descend'));\n \n save(fileName,'x_ref','b','x_original','lambda',...\n 'sigma','b_original','obj_ref','x0','time_IPM','snr');\n fprintf('Saved data to file %s\\n', fileName);\n \nend\n\n[M,N] = size(A);\nK = nnz(x_original);\nnorm_x_ref = norm(x_ref) + 1*( norm(x_ref)==0 );\nnorm_x_orig = norm(x_original) + 1*( norm(x_original)==0 );\ner_ref = @(x) norm(x-x_ref)/norm_x_ref;\ner_signal = @(x) norm(x-x_original)/norm_x_orig;\nresid = @(x) norm(A*x-b)/norm(b); % change if b is noisy\n\nfprintf('\\tA is %d x %d, original signal has %d nonzeros\\n', M, N, K );\nfprintf('\\tl1-norm solution and original signal differ by %.2e (mean(lambda) = %.2e)\\n', ...\n norm(x_ref - x_original)/norm(x_original),mean(lambda) );\n\n%% Call the TFOCS solver\ner = er_ref; % error with reference solution (from IPM)\nopts = struct('restart',-Inf,'autoRestart','gradient', ...\n 'tol',1e-13,'maxits',1000, 'printEvery',10);\nopts.errFcn = { @(f,primal) er(primal), ...\n @(f,primal) f - obj_ref }; \ntic;\n[ x, out, optsOut ] = solver_SLOPE( A, b, lambda, x0, opts );\ntime_TFOCS = toc;\n\nfprintf('Solution has %d nonzeros. Error vs. reference solution is %.2e\\n',...\n nnz(x), er(x) );\n\n% Check that we are within allowable bounds\nif out.err(end,1) < 1e-7\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_TraceLS.m", "content": "%{\nTest the trace-constrained least-squares problem with positive\nsemi-definite matrix variables\n\n minimize (1/2)*norm( A * X - b )^2 + lambda * trace( X )\n with the constraint that X is positive semi-definite ( X >= 0 )\n%}\n\n% Try to load the problem from disk\nfileName = fullfile('reference_solutions','traceLS_problem1_noisy');\nif exist([fileName,'.mat'],'file')\n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\nelse\n % Generate a new problem\n\n randn('state',sum('Trace'));\n rand('state',sum('Trace2'));\n \n N = 30; R = 2;\n \n df = R*N;\n oversample = 5;\n Left = randn(M,R);\n Right = Left;\n k = round(oversample*df); \n k = min( k, round(.8*N*N) );\n omega = randperm(N*N);\n omega = sort(omega(1:k)).';\n\n X_original = Left*Right'; % the \"original\" signal -- may not be optimal value\n b_original = X_original(omega); \n EPS = .001; % noise level\n noise = EPS * randn(k,1);\n b = b_original + noise;\n lambda = 1e-2;\n objective = @(X) sum_square( X(omega) - b )/2 + lambda*trace(X);\n obj_original = objective(X_original);\n\n % get reference via CVX\n cvx_begin\n cvx_precision best\n cvx_quiet true\n variable Xcvx(N,N)\n minimize objective(Xcvx)\n subject to\n Xcvx == semidefinite(N)\n cvx_end\n X_reference = Xcvx; % the nuclear norm minimizer\n obj_reference = objective(X_reference);\n fprintf('Difference between convex solution and original signal: %.2e\\n', ...\n norm( Xcvx - X_original, 'fro' ) );\n save(fileName,'X_original','X_reference','omega','b','obj_original',...\n 'Left','EPS','b_original','R','obj_reference','lambda');\n fprintf('Saved data to file %s\\n', fileName);\n \nend\n\n[M,N] = size(X_reference);\nnorm_X_reference = norm(X_reference,'fro');\ner_reference = @(x) norm(x-X_reference,'fro')/norm_X_reference;\nobjective = @(X) norm( X(omega) - b )^2/2 + lambda*trace(X);\n\n[omegaI,omegaJ] = ind2sub([M,N],omega);\nmat = @(x) reshape(x,M,N);\nvec = @(x) x(:);\n \nk = length(omega);\np = k/(M*N);\ndf = R*(M+N-R);\nfprintf('%d x %d rank %d matrix, observe %d = %.1f x df = %.1f%% entries\\n',...\n M,N,R,k,k/df,p*100);\nfprintf(' Trace norm solution and original matrix differ by %.2e\\n',...\n norm(X_reference-X_original,'fro')/norm_X_reference );\n%% Solve. No smoothing is necessary!\nopts = struct('tol',1e-12);\nopts.errFcn = @(f,x) er_reference(x);\nx0 = [];\n% opts.debug = true;\n\n% we need to tell it how to subsample. One method:\nA = linop_subsample( {[N,N],[k,1]}, omega );\n\n% another method: make a matrix with the correct\n% sparsity pattern and let solver_TraceLS do it for us\n% A = sparse( omegaI,omegaJ,ones(k,1),N,N);\n\n[x,out] = solver_TraceLS( A, b, lambda, x0, opts );\nepsilon = norm( x(omega) - b );\nh=figure();\nsemilogy(out.err);\n\n% Check that we are within allowable bounds\nif out.err(end) < 1e-5\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n%% We can solve this via a smoothed nuclear norm formulation\n% But it will be slower!\n% Also, it will not enforce the positive semi-definite constraint,\n% so it is not exactly the same.\n\ntestOptions = {};\nopts = [];\nopts.errFcn = @(f,dual,x) er_reference(x);\nopts.continuation = true;\nopts.stopCrit = 4;\nopts.tol = 1e-6;\n\nmu = .01;\nX0 = 0; \n\n% [ x, out, opts ] = solver_sNuclearBP( {M,N,omega}, b, mu, X0, [], opts ); \n[ x, out, opts ] = solver_sNuclearBPDN( {M,N,omega}, b, epsilon, mu, X0, [], opts ); \n\n%%\nclose(h)\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_all.m", "content": "%{\nRuns all tests in this directory.\n\nRecommended if you want to be sure that TFOCS is working 100% perfectly\non your system.\n\nThe scripts will produce an error message if anything goes wrong.\nSo if you don't seen any error message in red text, then everything\nis working.\n\n%}\nwarning('off','MATLAB:nargchk:deprecated') % narginchk not available prior to R2011b\n\nw = what;\nfileList = w.m;\n% and exclude the current file, otherwise we go into an infinite loop:\nfileList = fileList( ~strcmpi( fileList, 'test_all.m' ) );\ntm_all = tic;\nfor k = 1:length(fileList)\n \n file = fileList{k}; % this has the .m extension, which we need to remove\n eval( file(1:end-2) );\n \nend\nfprintf('\\n\\n\\n-- Success!! --\\n');\n\ntoc( tm_all )\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_blockNorm.m", "content": "%{\n Tests two common block norms\n\n min_X ||X||_{1,p}\ns.t.\n || A(X) - b || <= eps\n\nwhere ||X||_{1,p} is sum_{i=1:m} norm(X(i,:),p)\nand X is a m x n matrix. \"p\" is either 2 or Inf.\nIf n = 1, then for both p = 2 and p = Inf, this reduces\nto the l1 norm.\n\nWe may think of the columns of X as a new signal. The block\nnorm may be useful when we believe that these columns\nare quite similar, e.g. when their supports overlap significantly.\n\nsee also test_sBPDN.m\n\n%}\nmyAwgn = @(x,snr) x + ...\n 10^( (10*log10(sum(abs(x(:)).^2)/length(x(:))) - snr)/20 )*randn(size(x));\n\n% Before running this, please add the TFOCS base directory to your path\n\n% Try to load the problem from disk\nfileName = fullfile('reference_solutions','blocknorm_smoothed_noisy');\nrandn('state',34324);\nrand('state',34324);\n% N = 1024;\nN = 128;\nM = round(N/2);\nK = round(M/5);\nA = randn(M,N);\nd = 10; % number of columns of the signal matrix\nif exist([fileName,'.mat'],'file')\n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\nelse\n \n % Generate a new problem\n % Our signal model is the following:\n % for each column, half of the support (i.e. K/2 entries)\n % is taken from the first 1:K elements, so these will likely\n % have a strong overlap.\n % The second half of the support is taken from the remaining\n % elements, so will have less chance of overlap.\n % (May not be 1/2, but that's the rough idea)\n x = zeros(N,d);\n K2 = round(.6*K);\n for i = 1:d\n T1 = randsample(K,K2);\n T2 = randsample(N-K,K-K2) + K;\n x(T1,i) = randn(K2,1);\n x(T2,i) = randn(K-K2,1);\n end\n\n b_original = A*x;\n snr = 10; % SNR in dB\n b = myAwgn(b_original,snr);\n EPS = norm(b-b_original,'fro');\n x_original = x;\n err = @(X) norm(X-x_original,'fro')/norm(x_original,'fro');\n \n mu = .01*norm(x,Inf);\n x0 = zeros(N,d);\n\n % get reference via CVX\n \n % How would we do if we did the estimation separately?\n Xcvx_separate = zeros(N,d);\n for i = 1:d\n cvx_begin\n cvx_precision best\n cvx_quiet true\n variable xcvx(N,1)\n minimize norm(xcvx,1) + mu/2*sum_square(xcvx-x0(:,i) )\n subject to\n norm(A*xcvx - b(:,i) ) <= EPS/sqrt(d)\n cvx_end\n Xcvx_separate(:,i) = xcvx;\n end\n fprintf('Estimating each column separately, the error is %.2e\\n',...\n err(Xcvx_separate) );\n \n \n % Now, use p = 2\n p = 2;\n dim = 2;\n cvx_begin\n cvx_precision best\n cvx_quiet true\n variable xcvx(N,d)\n minimize sum(norms(xcvx,p,dim)) + mu/2*pow_pos( norm(xcvx-x0,'fro'), 2)\n subject to\n norm(A*xcvx - b,'fro' ) <= EPS\n cvx_end\n Xcvx_p2 = xcvx;\n fprintf('Estimating using the block 1-2 norm, the error is %.2e\\n',...\n err(Xcvx_p2) );\n \n % Now, use p = Inf\n p = Inf;\n dim = 2;\n cvx_begin\n cvx_precision best\n cvx_quiet true\n variable xcvx(N,d)\n minimize sum(norms(xcvx,p,dim)) + mu/2*pow_pos( norm(xcvx-x0,'fro'), 2)\n subject to\n norm(A*xcvx - b,'fro' ) <= EPS\n cvx_end\n Xcvx_pInf = xcvx;\n fprintf('Estimating using the block 1-Inf norm, the error is %.2e\\n',...\n err(Xcvx_pInf) );\n \n \n save(fileName,'Xcvx_separate','Xcvx_p2','Xcvx_pInf','b','x_original','mu',...\n 'EPS','b_original','x0','snr');\n fprintf('Saved data to file %s\\n', fileName);\n \nend\n\nerr = @(X) norm(X-x_original,'fro')/norm(x_original,'fro');\nfprintf('Block norm estimation: the error between cvx solution and orignal signal is...\\n');\nfprintf(' Estimating each column separately, the error is %.2e\\n',...\n err(Xcvx_separate) );\nfprintf(' Estimating using the block 1-2 norm, the error is %.2e\\n',...\n err(Xcvx_p2) );\nfprintf(' Estimating using the block 1-Inf norm, the error is %.2e\\n',...\n err(Xcvx_pInf) );\n\n%% Call the TFOCS solver for each column separately\ndisp('-- Testing TFOCS against the IPM (CVX) solution, each column separately --');\nX_separate = zeros(N,d);\nfor i = 1:d\n er = @(x) norm(x-Xcvx_separate(:,i))/norm(Xcvx_separate(:,i));\n opts = [];\n opts.restart = 500;\n opts.errFcn = @(f,dual,primal) er(primal);\n opts.maxIts = 1000;\n opts.tol = 1e-8;\n opts.printEvery = 500;\n opts.fid = 0;\n opts.restart = 100;\n z0 = []; % we don't have a good guess for the dual\n \n [ x, out, optsOut ] = solver_sBPDN( A, b(:,i), EPS/sqrt(d), mu, x0(:,i), z0, opts );\n \n fprintf('Error vs. IPM solution is %.2e\\n',er(x) );\n X_separate(:,i) = x;\n \n % Check that we are within allowable bounds\n if er(x) > 1e-6\n error('Failed the test');\n end\nend\nfprintf('Overall error vs. IPM solution is %.2e\\n',...\n norm(X_separate-Xcvx_separate,'fro')/norm(Xcvx_separate,'fro') );\n\n%% Call the TFOCS solver for p = 2\ndisp('-- Testing TFOCS against the IPM (CVX) solution, block norm, p = 2 --');\ner = @(x) norm(x-Xcvx_p2,'fro')/norm(Xcvx_p2,'fro');\nopts = [];\nopts.restart = 200;\nopts.errFcn = @(f,dual,primal) er(primal);\nopts.maxIts = 1000;\nopts.tol = 1e-8;\nopts.printEvery = 50;\nopts.fid = 1;\nz0 = []; % we don't have a good guess for the dual\n\nAA = A; % doesn't work \"out-of-the-box\", because it thnkgs\n % the domain of A is N x 1 matrices (it's really N x d).\nAA = linop_matrix(A, 'r2r',d );\n[x,out,opts] = tfocs_SCD( prox_l1l2, { AA, -b }, prox_l2( EPS ), mu, x0, z0, opts );\n\nfprintf('Error vs. IPM solution is %.2e\\n',er(x) );\n\n% Check that we are within allowable bounds\nif er(x) < 5e-6\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n%% Call the TFOCS solver for p = Inf\ndisp('-- Testing TFOCS against the IPM (CVX) solution, block norm, p = Inf --');\ner = @(x) norm(x-Xcvx_pInf,'fro')/norm(Xcvx_pInf,'fro');\nopts = [];\nopts.restart = 200;\nopts.errFcn = @(f,dual,primal) er(primal);\nopts.maxIts = 1000;\nopts.tol = 1e-8;\nopts.printEvery = 50;\nopts.fid = 1;\nz0 = []; % we don't have a good guess for the dual\n\nAA = A; % doesn't work \"out-of-the-box\", because it thnkgs\n % the domain of A is N x 1 matrices (it's really N x d).\nAA = linop_matrix(A, 'r2r',d );\n[x,out,opts] = tfocs_SCD( prox_l1linf(1), { AA, -b }, prox_l2( EPS ), mu, x0, z0, opts );\n\nfprintf('Error vs. IPM solution is %.2e\\n',er(x) );\nif er(x) < 3e-6\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_complicatedUsage.m", "content": "%{\nThis file shows an example of using the full power of TFOCS. If you\nare not familiar with basic usage of TFOCS, please see other demos\nfirst.\n\nWe make an example that uses:\n -several variables (2), and the variables are matrices, not just vectors\n -several constraints (4)\n -affine operators (linear plus offset), and two of the operators\n are matrix --> matrix operators\n -debug mode\n\n\nFor small complicated examples like this, TFOCS is not necessarily\nfaster than software like CVX, since it takes more iterations than an\ninterior point method and there is some overhead in the TFOCS software\nsince the software is meant for flexibility rather than absolute speed.\n\nHowever, if you take any complicated problem and scale the size by a factor\nof 100, then CVX won't be able to handle it at all. TFOCS will do\njust fine (and it might even be less than 100x as slow, since now the overhead\nis not significant).\n\n\nThe problem we will solve:\n\nmin_{X1, X2} smooth1(X1)+smooth2(X2) + sum_{i=1}^4 g_i( A1_i*X1 + A2_i*X2 + B_i )\n\nmeaning that we have 2 variables (X1 and X2), both of which are matrices,\nand each variable has its own smooth function.\nFor non-smooth and/or constraint terms (indexed by \"i\"), we have 4 functions\n( i = 1,2,3,4) g_i, and each has it's own affine operator in X1 and X2.\nSo each of the 4 affine operators has three parts: the portion linear in X1,\nthe portion linear in X2, and the constant offset \"B_i\".\n\nTo be explicit, the smooth functions are linear and quadratic, resp.:\n\nsmooth1(X1) = dot( s1, X1 ) + 3.4 (\"s1\" is a matrix the same size as X1)\nsmooth2(X2) = dot( X2, X2 ) + dot( s2, X2 ) + 4.5 (\"s2\" is a matrix the same size as X2)\n\nand the non-smooth/constraint terms are:\n\ng_1(z) = indicator set of the positive orthant of R^10\ng_2(z) = ||z||_2 (usual Euclidean norm) in R^15\ng_3(z) = ||z||_1 (l1 norm) in R^{10 x 20 }. This views a 10 x 20 matrix as a 200 x 1 vector.\ng_4(z) = indicator set of positive orthant of R^{20 x 22 }, i.e. each element must be >= 0 coordinate-wise\n\nThe affine operators are picked arbitrary, but some of them (#3 and #4) have a range that\nis a set of matrices, rather than a set of vectors, in order to make \nthis more interesting.\n\n%}\n\nfileName = fullfile('reference_solutions','complicatedProblem1');\nrandn('state',29324);\nrand('state',9332);\n% rng(3481); % this only works on new versions of Matlab\n\n% -- Variables --\n% Two sets of variables, X1 (a matrix of size n1 x n2 ) and X2 (matrix of N1 x N2 )\nn1 = 10; n2 = 20;\nN1 = 12; N2 = 18;\nX1 = zeros( n1, n2 );\nX2 = zeros( N1, N2 );\n\n% -- the smooth terms -- \n% Note: the inner product used is the matrix inner product\n% that induces the Frobenius norm.\ns1 = randn(n1,n2);\nsmooth1 = smooth_linear( s1, 3.4 );\ns2 = randn(N1,N2);\nsmooth2 = smooth_quad( 1, s2, 4.5 );\n% and the same thing, but in a format that CVX likes:\nsmoothF = @(X1,X2) vec(X1)'*vec(s1) + 3.4 + vec(X2)'*vec(s2) + 4.5 + ...\n sum_square(vec(X2))/2;\n\n% -- some proximal terms --\n\nnProx = 4;\nprox1 = proj_Rplus;\nprox2 = proj_l2; % primal is norm( , 2)\nprox3 = proj_linf(1); % this can take matrix varaibles...\nprox4 = proj_Rplus; % this can take matrix variables...\n% Sizes of proxes (i.e. sizes of dual variables, i.e. size of range of linear terms)\nd1 = [ 10, 1 ];\nd2 = [ 15, 1 ];\nd3 = [ n1, n2 ];\nd4 = [ 20, 22 ];\n\n\n% -- and linear terms --\n\n% for prox1:\nconst1 = randn(d1);\ntemp1 = randn( prod(d1), n1*n2);\nA1_X1 = linop_compose( linop_matrix(temp1), linop_vec([n1,n2]) );\ntemp2 = randn( prod(d1), N1*N2);\nA1_X2 = linop_compose( linop_matrix(temp2), linop_vec([N1,N2]) );\n\nA1 = @(X1,X2) temp1*vec(X1) + temp2*vec(X2) + const1;\n\n% for prox2: (matrix variable)\nconst2 = randn(d2);\ntemp1 = randn( prod(d2), n1*n2);\nA2_X1 = linop_compose( linop_matrix(temp1), linop_vec([n1,n2]) );\ntemp2 = randn( prod(d2), N1*N2);\nA2_X2 = linop_compose( linop_matrix(temp2), linop_vec([N1,N2]) );\n\nA2 = @(X1,X2) temp1*vec(X1) + temp2*vec(X2) + const2;\n\n% for prox3:\nconst3 = 0;\nA3_X1 = 63.4; % this represents abstract scaling, i.e. any size input\nA3_X2 = 0; % this reprsents the zero linear operator\n\nA3 = @(X1,X2) A3_X1*X1;\n\n% for prox4: (matrix variable)\nconst4 = randn(d4);\ntemp1 = randn( prod(d4), n1*n2);\nA4_X1 = linop_compose( linop_matrix(temp1), linop_vec([n1,n2]) );\nrs = linop_adjoint( linop_vec(d4) );\nA4_X1 = linop_compose( rs, A4_X1 );\nmat1 = @(x) reshape( x, d4(1), d4(2) );\n\ntemp2 = randn( prod(d4), N1*N2);\nA4_X2 = linop_compose( linop_matrix(temp2), linop_vec([N1,N2]) );\nrs = linop_adjoint( linop_vec(d4) );\nA4_X2 = linop_compose( rs, A4_X2 );\n\nA4 = @(X1,X2) mat1( temp1*vec(X1) + temp2*vec(X2) ) + const4;\n\n% -- set the smoothing parameter --\nmu = 1;\n\nif exist([fileName,'.mat'],'file')\n load(fileName); % contains X_CVX\n fprintf('Loaded problem from %s\\n', fileName );\nelse\n % Get reference solution in CVX\n % First, get a solution to the smoothed version:\n cvx_begin\n variables X1(n1,n2) X2(N1,N2)\n % it's important that we use norm(vec(...),1) and not just norm(...,1),\n % otherwise CVX interprets this with the wrong implicit inner product\n minimize( smoothF( X1, X2 ) + ...\n norm( A2(X1,X2), 2 ) + norm( vec(A3(X1,X2)) , 1 ) + ...\n mu*( sum_square(vec(X1)) + sum_square(vec(X2)) )/2 )\n subject to\n A1(X1,X2) >= 0 % constraint is dual of prox1\n A4(X1,X2) >= 0 % constraint is dual of prox2\n cvx_end\n X_CVX_smoothed{1} = X1;\n X_CVX_smoothed{2} = X2;\n \n % Second, get a solution to the unsmoothed version\n cvx_begin\n variables X1(n1,n2) X2(N1,N2)\n minimize( smoothF( X1, X2 ) + ...\n norm( A2(X1,X2), 2 ) + norm( vec(A3(X1,X2)) , 1 ) )\n subject to\n A1(X1,X2) >= 0\n A4(X1,X2) >= 0\n cvx_end\n X_CVX{1} = X1;\n X_CVX{2} = X2;\n \n save(fileName,'X_CVX', 'X_CVX_smoothed');\n fprintf('Saved data to file %s\\n', fileName);\nend\n\n% Verify constraint are satisfied\nfprintf('Is A1(x1,x2) >= 0? The min element is %g\\n', min( A1(X_CVX{1},X_CVX{2} )) )\nfprintf('Is A2(x1,x2) >= 0? The min element is %g\\n', min(min(A4(X_CVX{1},X_CVX{2}))) )\n%% before running TFOCS, scale the problem perhaps?\n% This is one way to see how big the norms are:\n% nrm11 = linop_test( A1_X1 ); % 15.7\n% nrm12 = linop_test( A1_X2 ); % 16.6\n% \n% nrm21 = linop_test( A2_X1 ); % 17.8\n% nrm22 = linop_test( A2_X2 ); % 18.6\n% \n% nrm31 = linop_test( A3_X1 ); % 63.4\n% nrm32 = linop_test( A3_X2 ); % 0\n% \n% nrm41 = linop_test( A4_X1 ); % 35.6\n% nrm42 = linop_test( A4_X2 ); % 34.6\n\n%% now, run TFOCS. First, try it without continuation\n\nx0 = [];\nz0 = [];\nopts = struct('continuation',false,'maxits',1500,'debug',true); % using 'debug' mode to print out useful information\nopts.printEvery = 50;\n\n% Pick a scaling factor \"s\" (optional: set to \"1\" to have no effect)\ns = .5; % helps a little bit\n% (note that if we scale prox3 by \"s\", then we multiply the corresponding\n% affine part by \"s\", rather than divide them by \"s\", since prox3\n% is really for the dual and not the primal).\n\nmu = 1;\nopts.errFcn{1} = @(f,d,p) norm( p{1}-X_CVX_smoothed{1}); % compare to smoothed reference solution\nopts.errFcn{2} = @(f,d,p) norm( p{2}-X_CVX_smoothed{2});\n\n[xAll,outParam,optsOut] = tfocs_SCD( {smooth1,smooth2}, ...\n { A1_X1, A1_X2, const1; A2_X1, A2_X2, const2; ...\n A3_X1*s, A3_X2*s, const3*s; A4_X1, A4_X2, const4 }, ...\n {prox1,prox2,prox_scale(prox3,s),prox4},...\n mu, x0, z0, opts );\n\nmnConstraint1 = min(min( A1(xAll{1},xAll{2} ) ) );\nmnConstraint2 = min(min( A4(xAll{1},xAll{2} ) ) );\nfprintf('First constraint violated by: %g\\n', mnConstraint1);\nfprintf('Second constraint violated by: %g\\n', mnConstraint2 );\n\n% Check that we are within acceptable limits\ner = sqrt(norm( xAll{1} - X_CVX_smoothed{1} )^2 + norm( xAll{2} - X_CVX_smoothed{2} )^2 )/...\n sqrt( norm(X_CVX_smoothed{1})^2 + norm(X_CVX_smoothed{2})^2 ); % should be about .006\n\nif er > 0.04 || mnConstraint1 < -.01 || mnConstraint2 < -.01\n error('Failed the test');\nelse\n disp('This test successfully passed');\nend\n\n%% run TFOCS with continuation\nx0 = [];\nz0 = [];\n% type \"tfocs\" at the command to see possible options\nopts = struct('continuation',true,'maxits',1500);\nopts.printEvery = 50;\nopts.tol = 1e-4;\nopts.stopCrit = 4;\nopts.printStopCrit = true;\n\n% type \"continuation\" at the command to see possible options\ncontOpts = struct( 'maxIts', 8 , 'muDecrement', 0.8 );\n% ask for increased accuracy on the final solve\ncontOpts.finalTol = 1e-5;\n\ns = .5; % helps a little bit\n% (note that if we scale prox3 by \"s\", then we multiply the corresponding\n% affine part by \"s\", rather than divide them by \"s\", since prox3\n% is really for the dual and not the primal).\n\nmu = 10;\nopts.errFcn{1} = @(f,d,p) norm( p{1}-X_CVX{1}); % compare to unsmoothed reference solution\nopts.errFcn{2} = @(f,d,p) norm( p{2}-X_CVX{2});\n\n[xAll,outParam,optsOut] = tfocs_SCD( {smooth1,smooth2}, ...\n { A1_X1, A1_X2, const1; A2_X1, A2_X2, const2; ...\n A3_X1*s, A3_X2*s, const3*s; A4_X1, A4_X2, const4 }, ...\n {prox1,prox2,prox_scale(prox3,s),prox4},...\n mu, x0, z0, opts, contOpts );\n\nmnConstraint1 = min(min( A1(xAll{1},xAll{2} ) ) );\nmnConstraint2 = min(min( A4(xAll{1},xAll{2} ) ) );\nfprintf('First constraint violated by: %g\\n', mnConstraint1);\nfprintf('Second constraint violated by: %g\\n', mnConstraint2 );\n\n% Check that we are within acceptable limits\ner = sqrt(norm( xAll{1} - X_CVX{1} )^2 + norm( xAll{2} - X_CVX{2} )^2 )/...\n sqrt( norm(X_CVX{1})^2 + norm(X_CVX{2})^2 ); % should be about .006\n\nif er > 0.4 || mnConstraint1 < -.01 || mnConstraint2 < -.01\n error('Failed the test');\nelse\n disp('This test successfully passed');\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information." }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_nuclearNorm.m", "content": "%{\n Tests nuclear norm minimization,\n\n min_X ||X||_*\ns.t.\n P(X) == b, or || P(X) - b || <= eps\n\nwhere X is a M x N matrix, and P is an observation operator\n\nThe solvers solve a regularized version, using\n||X||_* + mu/2*||X-X_0||_F^2\nYou can turn on the continuation feature to reduce the effect of nonzero mu\n\n%}\nnuclear_norm = @(x) sum(svd(x,'econ'));\n\n% Try to load the problem from disk\nfileName = fullfile('reference_solutions','nuclearNorm_problem1_noiseless');\nif exist([fileName,'.mat'],'file')\n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\nelse\n \n % Generate a new problem\n\n randn('state',sum('NuclearNorm'));\n rand('state',sum('NuclearNorm2'));\n \n M = 30; N = 30; R = 2;\n\n df = R*(M+N-R);\n oversample = 5;\n Left = randn(M,R);\n Right = randn(N,R);\n k = round(oversample*df); \n k = min( k, round(.8*M*N) );\n omega = randperm(M*N);\n omega = sort(omega(1:k)).';\n\n X_original = Left*Right'; % the \"original\" signal -- may not be optimal value\n b_original = X_original(omega); \n EPS = 0; % noise level\n b = b_original;\n obj_original = nuclear_norm(X_original);\n\n % get reference via CVX\n cvx_begin\n cvx_precision best\n variable Xcvx(M,N)\n minimize norm_nuc(Xcvx)\n subject to\n Xcvx(omega) == b\n cvx_end\n X_reference = Xcvx; % the nuclear norm minimizer\n obj_reference = nuclear_norm(X_reference);\n \n save(fileName,'X_original','X_reference','omega','b','obj_original',...\n 'Left','Right','EPS','b_original','R','obj_reference');\n fprintf('Saved data to file %s\\n', fileName);\n \nend\n\n[M,N] = size(X_reference);\nnorm_X_reference = norm(X_reference,'fro');\ner_reference = @(x) norm(x-X_reference,'fro')/norm_X_reference;\nresid = @(x) norm(x(omega)-b)/norm(b); % change if b is noisy\n\n[omegaI,omegaJ] = ind2sub([M,N],omega);\nmat = @(x) reshape(x,M,N);\nvec = @(x) x(:);\n \nk = length(omega);\np = k/(M*N);\ndf = R*(M+N-R);\nfprintf('%d x %d rank %d matrix, observe %d = %.1f x df = %.1f%% entries\\n',...\n M,N,R,k,k/df,p*100);\nfprintf(' Nuclear norm solution and original matrix differ by %.2e\\n',...\n norm(X_reference-X_original,'fro')/norm_X_reference );\n\n%% set some parameters\n\ntestOptions = {};\nopts = [];\nopts.alg = 'GRA';\nopts.errFcn = @(f,dual,x) norm( x - X_reference,'fro')/norm(X_reference,'fro');\n\nmu = .001;\nX0 = 0; \n\n% The Lipschitz bound is L = 1/mu\n% opts.L0 = 1/mu;\n[ x, out, opts ] = solver_sNuclearBP( {M,N,omega}, b, mu, X0, [], opts ); \n% Check that we are within allowable bounds\nif out.err(end) < 1e-5\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n%% test noisy version (just pretend there's a tiny amount of noise)\ndisp('== Noisy variant ==');\nepsilon = 1e-6; % if there really were noise, this should be an estimate of the std\n[ x, out, opts ] = solver_sNuclearBPDN( {M,N,omega}, b, epsilon, mu, X0, [], opts ); \n% Check that we are within allowable bounds\nif out.err(end) < 1e-5\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_psdCompletion.m", "content": "%{\nTest the trace-constrained least-squares problem with positive\nsemi-definite matrix variables\n\n minimize (1/2)*norm( A * X - b )^2 \n with the constraint that X is positive semi-definite ( X >= 0 )\nand optionally,\n the constraint trace(X) <= lambda\n\n%}\n\n% Try to load the problem from disk\nfileName = fullfile('reference_solutions','traceLS_problem2_noisy');\nif exist([fileName,'.mat'],'file')\n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\nelse\n % Generate a new problem\n randn('state',sum('Trace')+5);\n rand('state',sum('Trace2')+5);\n \n N = 30; R = 2;\n \n df = R*N;\n oversample = 5;\n Left = randn(M,R);\n Right = Left;\n k = round(oversample*df); \n k = min( k, round(.8*N*N) );\n omega = randperm(N*N);\n omega = sort(omega(1:k)).';\n\n X_original = Left*Right'; % the \"original\" signal -- may not be optimal value\n b_original = X_original(omega); \n EPS = .001; % noise level\n noise = EPS * randn(k,1); % this destroys symmetry...\n b = b_original + noise;\n lambda = trace( X_original );\n objective = @(X) sum_square( X(omega) - b )/2;\n obj_original = objective(X_original);\n\n % get references via CVX\n cvx_begin\n cvx_precision best\n cvx_quiet true\n variable Xcvx(N,N)\n minimize objective(Xcvx)\n subject to\n Xcvx == semidefinite(N)\n cvx_end\n X_reference_noTraceConstraint = Xcvx; \n fprintf('Difference between convex solution (no trace constraint) and original signal: %.2e\\n', ...\n norm( Xcvx - X_original, 'fro' ) );\n \n cvx_begin\n cvx_precision best\n cvx_quiet true\n variable Xcvx(N,N)\n minimize objective(Xcvx)\n subject to\n Xcvx == semidefinite(N)\n trace(Xcvx) <= lambda\n cvx_end\n X_reference = Xcvx; % the trace norm minimizer \n obj_reference = objective(X_reference);\n fprintf('Difference between convex solution (with trace constraint) and original signal: %.2e\\n', ...\n norm( Xcvx - X_original, 'fro' ) );\n save(fileName,'X_original','X_reference','X_reference_noTraceConstraint',...\n 'omega','b','obj_original',...\n 'Left','EPS','b_original','R','obj_reference','lambda');\n fprintf('Saved data to file %s\\n', fileName);\n \nend\n\n[M,N] = size(X_reference);\nnorm_X_reference = norm(X_reference,'fro');\ner_reference = @(x) norm(x-X_reference,'fro')/norm_X_reference;\nnorm_X_reference2= norm(X_reference_noTraceConstraint,'fro');\ner_reference2 = @(x) norm(x-X_reference_noTraceConstraint,'fro')/norm_X_reference2;\nobjective = @(X) norm( X(omega) - b )^2/2;\n\n[omegaI,omegaJ] = ind2sub([M,N],omega);\nmat = @(x) reshape(x,M,N);\nvec = @(x) x(:);\n \nk = length(omega);\np = k/(M*N);\ndf = R*(M+N-R);\nfprintf('%d x %d rank %d matrix, observe %d = %.1f x df = %.1f%% entries\\n',...\n M,N,R,k,k/df,p*100);\nfprintf(' Trace norm solution and original matrix differ by %.2e\\n',...\n norm(X_reference-X_original,'fro')/norm_X_reference );\n%% Solve unconstrained version. No smoothing is necessary!\nopts = struct('maxIts',500);\nopts.errFcn{1} = @(f,x) er_reference2(x); % no trace constraint\nopts.errFcn{2} = @(f,x) sum( abs(eig(x)) > 1e-5 ); % numerical rank\n% tell it to use eigs instead of eig\n% opts.largescale = true; % ( but not recommended)\n\n% opts.symmetrize = true; % another option\n\nA = sparse( omegaI,omegaJ,b,N,N);\n[x,out] = solver_psdComp( A, opts );\n% Note: we do not expect to get zero error because there might be more\n% than one optimal solution for this problem (since there are not\n% so many constraints)\n% Check that we have a feasible solution\nfprintf('Objective is %.2e, min eigenvalue is %.2e\\n', objective(x),...\n min(eig(x)) );\n%% Solve trace constrained version. No smoothing necessary!\nopts = struct('maxIts',1500,'tol',1e-9);\nopts.errFcn{1} = @(f,x) er_reference(x); % no trace constraint\nopts.errFcn{2} = @(f,x) trace(x)-lambda;\nopts.errFcn{3} = @(f,x) sum( abs(eig(x)) > 1e-5 ); % numerical rank\n% we can also symmetrize \"omega\", but it makes little difference,\n% and gives slightly differen value than CVX, since CVX symmetrizes\n% differently:\n% opts.symmetrize = true;\nA = sparse( omegaI,omegaJ,b,N,N);\n[x,out] = solver_psdCompConstrainedTrace( A,lambda, opts );\n\nh=figure();\nsemilogy(out.err(:,1));\n\n% Check that we are within allowable bounds\nif out.err(end,1) < 1e-5\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n\n%%\nclose(h)\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_quadratic.m", "content": "%% Tests the solvers on a simple unconstrained quadratic function\n\n%{\n Solve:\n\n minimize_x c'x + x'Dx/2\n\n as an example of using TFOCS without the \"SCD\" interface\n\n%}\n\nrandn( 'state', sum('quadratic test') );\nN = 100;\nc = randn(N,1);\nD = randn(N,N);\nD = D * D' + .5*eye(N);\nx_star = - D \\ c; % the true answer\nx0 = zeros(N,1);\n\n% Here's what you could do...\n% f = @(x) c'*x + x'*D*x/2;\n% grad_f = @(x) c + D*x;\n% smoothF = @(x) wrapper_objective( f, grad_f, x );\n\n% Here's a simpler way:\nsmoothF = smooth_quad(D,c);\n\nx_error = @(x) norm(x-x_star,Inf);\n\nopts = [];\nopts.errFcn = { @(f,x) x_error(x)};\nopts.restart = 100;\n\n[ x, out, optsOut ] = tfocs( smoothF, [], [],x0, opts );\n% Check that we are within allowable bounds\nif out.err(end) < 1e-5\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_quadratic_constrained.m", "content": "function test_quadratic_constrained\n%% Tests the solvers on a simple constrained quadratic function\n%{\n Solve:\n\n minimize_x c'x + x'Dx/2\n subject to ||x||_1 <= 10\n\n as an example of using TFOCS without the \"SCD\" interface\n (since the objective is smooth and we can project, there's \n no need to smooth and solve the dual)\n\n It's also an example of using 2 objective functions\n\n%}\n\n%% Now, add in constraints\n\nrandn( 'state', sum('quadratic test') );\nN = 100;\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% CONSTRUCT THE TEST PROBLEM %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nc = randn(N,1);\nD = randn(N,N);\nD = D * D' + .5*eye(N);\ns = svd(D);\n% x_star = - D \\ c;\n% L = max(s); \n% mu = min(s);\n% if mu < eps, disp('WARNING: may have 0 eigenvalues'); end\n% f_star = 0.5 * c' * x_star;\n% n_star = norm( x_star );\nx0 = zeros(N,1);\n\n% f = @(x) c'*x + x'*D*x/2;\n% grad_f = @(x) c + D*x;\n% smoothF = @(x) wrapper_objective( f, grad_f, x );\n% -- or --\n% smoothF = smooth_quad(D,c);\n% -- or (demonstrating how to use 2 objective functions) --\nf1 = @(x) c'*x;\nf2 = @(x) x'*D*x/2;\ng1 = @(x) c;\ng2 = @(x) D*x;\nsmoothF = { @(x) wrapper_objective(f1,g1,x); @(x) wrapper_objective(f2,g2,x) };\nlinearF = { 1 ; 1 };\n\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% SET UP THE TEST PARAMETERS %\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\nopts = [];\nopts.tol = 1e-16;\nopts.maxits = 3000;\nopts.restart = 100;\n\n%%%%%%%%%%%%%%%%%%%%%\n% ADD IN CONSTRAINT %\n%%%%%%%%%%%%%%%%%%%%%\n% projectorF = proj_simplex(10); % x >=0, sum(x) = 10\nprojectorF = proj_l1(10); % l1 ball, radius 10 (e.g. norm(x,1) <= 10)\n\n\n%%%%%%%%%%%%%%%%%\n% RUN THE TESTS %\n%%%%%%%%%%%%%%%%%\n[ x, out, optsOut ] = tfocs( smoothF, linearF, projectorF,x0, opts );\n% Check that we are within allowable bounds\n\n\n\nfunction [v,gr] = wrapper_objective(f,g,x)\nv = f(x);\nif nargout > 1\n gr = g(x);\nend\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_sBP.m", "content": "%{\n Tests basis pursuit\n\n min_x ||X||_1\ns.t.\n A(X) == b\n\nThe solvers solve a regularized version, using\n||x||_1 + mu/2*||x-x_0||_2^2\n\nThis problem is a linear program, so if mu is sufficiently small,\nthe smoothing has exactly no effect.\n\nAs a reference solution, we use either \"x_ref\" which is the interior-point\nmethod solution, or we use \"x_original\", which is the original signal\nused to generate the measurements b. In general, \"x_original\" is not\nthe solution to the minimization problem; but under certain circumstances,\nsuch as when \"x_original\" is very sparse, it is the solution to the minimization problem.\nThis is the fundamental result from compressed sensing.\nWhen this situation applies, \"x_original\" is the correct solution to machine precision,\nand will be more accurate than even \"x_ref\".\n\n%}\n\n% Before running this, please add the TFOCS base directory to your path\n\n% Try to load the problem from disk\nfileName = fullfile('reference_solutions','basispursuit_problem1_smoothed_noiseless');\nrandn('state',34324);\n\n% We don't want to store \"A\"\nrand('state',34324);\nN = 1024;\nM = round(N/2);\nK = round(M/5);\nA = randn(M,N);\nif exist([fileName,'.mat'],'file')\n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\nelse\n % Generate a new problem\n x = zeros(N,1);\n T = randsample(N,K);\n x(T) = randn(K,1);\n\n b = A*x;\n EPS = 0;\n b_original = b;\n x_original = x;\n \n mu = .01*norm(x,Inf);\n x0 = zeros(N,1);\n % Note: with equality constraints, this is an LP, so for mu small\n % enough (but > 0), we have exact relaxation.\n\n % get reference via CVX\n tic\n cvx_begin\n cvx_precision best\n variable xcvx(N,1)\n minimize norm(xcvx,1) + mu/2*sum_square(xcvx-x0)\n subject to\n A*xcvx == b\n cvx_end\n time_IPM = toc;\n x_ref = xcvx; \n obj_ref = norm(x_ref,1) + mu/2*sum_square(x_ref-x0);\n \n save(fileName,'x_ref','b','x_original','mu',...\n 'EPS','b_original','obj_ref','x0','time_IPM');\n fprintf('Saved data to file %s\\n', fileName);\n \nend\n\n\n[M,N] = size(A);\nK = nnz(x_original);\nnorm_x_ref = norm(x_ref);\nnorm_x_orig = norm(x_original);\ner_ref = @(x) norm(x-x_ref)/norm_x_ref;\ner_signal = @(x) norm(x-x_original)/norm_x_orig;\nresid = @(x) norm(A*x-b)/norm(b); % change if b is noisy\n\nfprintf('\\tA is %d x %d, original signal has %d nonzeros\\n', M, N, K );\nfprintf('\\tl1-norm solution and original signal differ by %.2e (mu = %.2e)\\n', ...\n norm(x_ref - x_original)/norm(x_original),mu );\n\n%% Call the TFOCS solver\n% er = er_ref; % error with reference solution (from IPM)\ner = er_signal; % error from original signal\n% obj_ref = norm(x_ref,1) + mu/2*norm(x_ref-x0)^2;\nobj_ref = norm(x_original,1) + mu/2*norm(x_original-x0)^2;\nopts = [];\nopts.errFcn = { @(f,dual,primal) er(primal), ...\n @(f,dual,primal) obj_ref - f }; \nz0 = []; % we don't have a good guess for the dual\ntic;\n[ x, out, optsOut ] = solver_sBP( A, b, mu, x0, z0, opts );\ntime_TFOCS = toc;\n\nfprintf('--------------------------------------------------------\\n');\nfprintf('Results:\\n-original signal-\\t-IPM solution- -TFOCS solution-\\n');\nfprintf('---------------------+-----------------+----------------\\n');\nfprintf('Number of nonzeros:\\n\\t%d\\t\\t%d\\t\\t%d\\n',...\n nnz(x_original),nnz(x_ref), nnz(x) );\nfprintf('Error vs. original, rel. l2 norm:\\n\\tN/A\\t\\t%.2e\\t%.2e\\n',...\n er_signal(x_ref), er_signal(x) );\ner_signal1 = @(x) norm(x-x_original,Inf);\nfprintf('Error vs. original, lInf norm:\\n\\tN/A\\t\\t%.2e\\t%.2e\\n',...\n er_signal1(x_ref), er_signal1(x) );\nfprintf('Time to solve:\\n\\tN/A\\t\\t%.1fs\\t\\t%.1fs\\n',...\n time_IPM, time_TFOCS );\nfprintf('--------------------------------------------------------\\n');\n\n% Check that we are within allowable bounds\nif out.err(end,1) < 1e-8\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n%% Here is how you can view the error history on a graph\nfigure();\nsemilogy( out.err(:,1) );\nxlabel('iterations'); ylabel('error');\n\n%% Here are some alternative ways to call it\nopts = [];\nopts.maxIts = 500;\n\nA_TFOCS = linop_matrix( A ); % not necessary, but one way to do it\n[ x, out, optsOut ] = solver_sBP( A_TFOCS, b, mu, x0, z0, opts );\n\n% We can also pass in function handles\nAf = @(x) A*x;\nAt = @(y) A'*y;\nA_TFOCS = linop_handles( [M,N], Af, At );\n[ x, out, optsOut ] = solver_sBP( A_TFOCS, b, mu, x0, z0, opts );\n\n%% close plots\nclose all\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_sBPDN.m", "content": "%{\n Tests basis pursuit de-noising\n\n min_x ||x||_1\ns.t.\n || A(x) - b || <= eps\n\nThe solvers solve a regularized version, using\n ||x||_1 + mu/2*||x-x_0||_2^2\n\nsee also test_sBP.m\n\n%}\n\n% Before running this, please add the TFOCS base directory to your path\nmyAwgn = @(x,snr) x + ...\n 10^( (10*log10(sum(abs(x(:)).^2)/length(x(:))) - snr)/20 )*randn(size(x));\n%%\n% Try to load the problem from disk\nfileName = fullfile('reference_solutions','basispursuit_problem1_smoothed_noisy');\nrandn('state',34324);\nrand('state',34324);\nN = 1024;\nM = round(N/2);\nK = round(M/5);\nA = randn(M,N);\nif exist([fileName,'.mat'],'file')\n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\nelse\n \n % Generate a new problem\n x = zeros(N,1);\n T = randsample(N,K);\n x(T) = randn(K,1);\n\n b_original = A*x;\n snr = 30; % SNR in dB\n b = myAwgn(b_original,snr);\n EPS = norm(b-b_original);\n x_original = x;\n \n mu = .01*norm(x,Inf);\n x0 = zeros(N,1);\n\n % get reference via CVX\n tic\n cvx_begin\n cvx_precision best\n variable xcvx(N,1)\n minimize norm(xcvx,1) + mu/2*sum_square(xcvx-x0)\n subject to\n norm(A*xcvx - b ) <= EPS\n cvx_end\n time_IPM = toc;\n x_ref = xcvx;\n obj_ref = norm(x_ref,1) + mu/2*sum_square(x_ref-x0);\n \n save(fileName,'x_ref','b','x_original','mu',...\n 'EPS','b_original','obj_ref','x0','time_IPM','snr');\n fprintf('Saved data to file %s\\n', fileName);\n \nend\n\n\n[M,N] = size(A);\nK = nnz(x_original);\nnorm_x_ref = norm(x_ref);\nnorm_x_orig = norm(x_original);\ner_ref = @(x) norm(x-x_ref)/norm_x_ref;\ner_signal = @(x) norm(x-x_original)/norm_x_orig;\nresid = @(x) norm(A*x-b)/norm(b); % change if b is noisy\n\nfprintf('\\tA is %d x %d, original signal has %d nonzeros\\n', M, N, K );\nfprintf('\\tl1-norm solution and original signal differ by %.2e (mu = %.2e)\\n', ...\n norm(x_ref - x_original)/norm(x_original),mu );\n\n%% Call the TFOCS solver\ner = er_ref; % error with reference solution (from IPM)\nopts = [];\nopts.restart = 500;\nopts.errFcn = { @(f,dual,primal) er(primal), ...\n @(f,dual,primal) obj_ref - f }; \nopts.maxIts = 1000;\nz0 = []; % we don't have a good guess for the dual\ntic;\n[ x, out, optsOut ] = solver_sBPDN( A, b, EPS, mu, x0, z0, opts );\ntime_TFOCS = toc;\n\nfprintf('Solution has %d nonzeros. Error vs. IPM solution is %.2e\\n',...\n nnz(x), er(x) );\n\n% Check that we are within allowable bounds\nif out.err(end,1) < 1e-6\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_sBPDN_W.m", "content": "%{\n Tests the \"analysis\" form of basis pursuit de-noising\n\n min_x ||Wx||_1\ns.t.\n || A(x) - b || <= eps\n\nThe solvers solve a regularized version, using\n ||Wx||_1 + mu/2*||x-x_0||_2^2\n\nsee also test_sBP.m and test_sBPDN.m\n\n%}\n\n% Before running this, please add the TFOCS base directory to your path\nmyAwgn = @(x,snr) x + ...\n 10^( (10*log10(sum(abs(x(:)).^2)/length(x(:))) - snr)/20 )*randn(size(x));\n\n% Try to load the problem from disk\nfileName = fullfile('reference_solutions','basispursuit_W_problem1_smoothed_noisy');\nrandn('state',34324);\nrand('state',34324);\n\nN = 512;\nM = round(N/2);\nK = round(M/5);\n\nA = randn(M,N);\nx = zeros(N,1);\n\n% introduce a sparsifying transform \"W\"\nd = round(4*N); % redundant\nWf = @(x) dct(x,d); % zero-padded DCT\ndownsample = @(x) x(1:N,:);\nWt = @(y) downsample( idct(y) ); % transpose of W\nW = Wf(eye(N)); % make an explicit matrix for CVX\nif exist([fileName,'.mat'],'file')\n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\n \nelse\n \n % Generate a new problem\n\n % the signal x consists of several pure tones at random frequencies\n for k = 1:K\n x = x + randn()*sin( rand()*pi*(1:N) + 2*pi*rand() ).';\n end\n\n\n b_original = A*x;\n snr = 40; % SNR in dB\n b = myAwgn(b_original,snr);\n EPS = norm(b-b_original);\n x_original = x;\n \n mu = .01*norm(Wf(x),Inf);\n x0 = zeros(N,1);\n\n % get reference via CVX\n tic\n cvx_begin\n cvx_precision best\n variable xcvx(N,1)\n minimize norm(W*xcvx,1) + mu/2*sum_square(xcvx-x0)\n subject to\n norm(A*xcvx - b ) <= EPS\n cvx_end\n time_IPM = toc;\n x_ref = xcvx; \n obj_ref = norm(W*x_ref,1) + mu/2*sum_square(x_ref-x0);\n \n save(fileName,'x_ref','b','x_original','mu',...\n 'EPS','b_original','obj_ref','x0','time_IPM','snr','d');\n fprintf('Saved data to file %s\\n', fileName);\n \nend\n\n\n[M,N] = size(A);\nnorm_x_ref = norm(x_ref);\nnorm_x_orig = norm(x_original);\ner_ref = @(x) norm(x-x_ref)/norm_x_ref;\ner_signal = @(x) norm(x-x_original)/norm_x_orig;\nresid = @(x) norm(A*x-b)/norm(b); % change if b is noisy\n\nfprintf('\\tA is %d x %d\\n', M, N );\nfprintf('\\tl1-norm solution and original signal differ by %.2e (mu = %.2e)\\n', ...\n norm(x_ref - x_original)/norm(x_original),mu );\n\n%% Call the TFOCS solver\nobjF = @(x)norm(W*x,1) + mu/2*norm(x-x0).^2;\ninfeasF = @(x)norm(A*x-b) - EPS;\ner = er_ref; % error with reference solution (from IPM)\nopts = [];\nopts.errFcn = { @(f,dual,primal) er(primal), ...\n @(f,dual,primal) obj_ref - f, ...\n @(f,dual,primal) infeasF(primal) }; \nopts.maxIts = 1000;\nopts.tol = 1e-10;\n% opts.normA2 = norm(A*A');\n% opts.normW2 = norm(W'*W);\nz0 = []; % we don't have a good guess for the dual\ntic;\n[ x, out, optsOut ] = solver_sBPDN_W( A, W, b, EPS, mu, x0, z0, opts );\ntime_TFOCS = toc;\nfprintf('x is sub-optimal by %.2e, and infeasible by %.2e\\n',...\n objF(x) - obj_ref, infeasF(x) );\n\nfprintf('Solution has %d nonzeros. Error vs. IPM solution is %.2e\\n',...\n nnz(x), er(x) );\n\n% Check that we are within allowable bounds\nif out.err(end,1) < 1e-4\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n\n\n%% Doing it \"by hand\" (for debugging), just for 200 iterations\nobjF = @(x)norm(W*x,1) + mu/2*norm(x-x0).^2;\ninfeasF = @(x)norm(A*x-b) - EPS;\ner = er_ref; % error with reference solution (from IPM)\n% er = er_signal;\nopts = [];\nopts.errFcn = { @(f,dual,primal) er(primal), ...\n @(f,dual,primal) obj_ref - f, ...\n @(f,dual,primal) infeasF(primal) }; \nopts.maxIts = 200;\nopts.printEvery = 10;\nopts.tol = 1e-10;\nz0 = [];\nproxScale = sqrt(norm(W'*W)/norm(A*A'));\nscale = 1;\nprox = { prox_l2( EPS/scale ), proj_linf(proxScale) };\naffineF = {A/scale,-b/scale;W/proxScale,0};\n[ x, out, optsOut ] = tfocs_SCD( [], affineF, prox, mu, x0, z0, opts );\n\n% Check that we are within allowable bounds\nif out.err(end,1) < 1e-2\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_sBPDN_WW.m", "content": "%{\n Tests the extended \"analysis\" form of basis pursuit de-noising\n\n min_1 alpha*||W_1 x||_1 + beta*|| W_2 x ||_1\ns.t.\n || A(x) - b || <= eps\n\nThe solvers solve a regularized version\n\nsee also test_sBP.m and test_sBPDN.m and test_sBPDN_W.m\n\n%}\n\n% Before running this, please add the TFOCS base directory to your path\nmyAwgn = @(x,snr) x + ...\n 10^( (10*log10(sum(abs(x(:)).^2)/length(x(:))) - snr)/20 )*randn(size(x));\n\n% Try to load the problem from disk\nfileName = fullfile('reference_solutions','basispursuit_WW_problem1_smoothed_noisy');\nrandn('state',34324);\nrand('state',34324);\n\nN = 512;\nM = round(N/2);\nK = round(M/5);\n\nA = randn(M,N);\nx = zeros(N,1);\n\n% introduce a sparsifying transform \"W\"\nd = round(4*N); % redundant\nWf = @(x) dct(x,d); % zero-padded DCT\ndownsample = @(x) x(1:N,:);\nWt = @(y) downsample( idct(y) ); % transpose of W\nW = Wf(eye(N)); % make an explicit matrix for CVX\n\n% and add another transform:\nd2 = round(2*N);\nW2 = randn(d2,N);\nif exist([fileName,'.mat'],'file')\n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\nelse\n \n % Generate a new problem\n\n alpha = 1;\n beta = 2;\n \n % the signal x consists of several pure tones at random frequencies\n for k = 1:K\n x = x + randn()*sin( rand()*pi*(1:N) + 2*pi*rand() ).';\n end\n\n\n b_original = A*x;\n snr = 40; % SNR in dB\n b = myAwgn(b_original,snr);\n EPS = norm(b-b_original);\n x_original = x;\n \n mu = .01*norm(Wf(x),Inf);\n x0 = zeros(N,1);\n\n % get reference via CVX\n tic\n cvx_begin\n cvx_precision high\n variable xcvx(N,1)\n minimize alpha*norm(W*xcvx,1) + beta*norm(W2*xcvx,1) + ...\n mu/2*sum_square(xcvx-x0)\n subject to\n norm(A*xcvx - b ) <= EPS\n cvx_end\n time_IPM = toc;\n x_ref = xcvx; \n objF = @(x)alpha*norm(W*x,1) +beta*norm(W2*x,1)+ mu/2*norm(x-x0).^2;\n obj_ref = objF(x_ref);\n \n save(fileName,'x_ref','b','x_original','mu',...\n 'EPS','b_original','obj_ref','x0','time_IPM','snr',...\n 'd','d2','alpha','beta');\n fprintf('Saved data to file %s\\n', fileName);\n \nend\n\n\n[M,N] = size(A);\nnorm_x_ref = norm(x_ref);\nnorm_x_orig = norm(x_original);\ner_ref = @(x) norm(x-x_ref)/norm_x_ref;\ner_signal = @(x) norm(x-x_original)/norm_x_orig;\nresid = @(x) norm(A*x-b)/norm(b); % change if b is noisy\n\nfprintf('\\tA is %d x %d\\n', M, N );\nfprintf('\\tl1-norm solution and original signal differ by %.2e (mu = %.2e)\\n', ...\n norm(x_ref - x_original)/norm(x_original),mu );\n\n%% Call the TFOCS solver\nobjF = @(x)alpha*norm(W*x,1) +beta*norm(W2*x,1)+ mu/2*norm(x-x0).^2;\ninfeasF = @(x)norm(A*x-b) - EPS;\ner = er_ref; % error with reference solution (from IPM)\nopts = [];\nopts.errFcn = { @(f,dual,primal) er(primal), ...\n @(f,dual,primal) obj_ref - f, ...\n @(f,dual,primal) infeasF(primal) }; \nopts.maxIts = 2000;\nopts.tol = 1e-10;\n% opts.normA2 = norm(A*A');\n% opts.normW2 = norm(W'*W);\nz0 = []; % we don't have a good guess for the dual\ntic;\n[ x, out, optsOut ] = solver_sBPDN_WW( A, alpha,W,beta,W2,b, EPS, mu, x0, z0, opts );\ntime_TFOCS = toc;\nfprintf('x is sub-optimal by %.2e, and infeasible by %.2e\\n',...\n objF(x) - obj_ref, infeasF(x) );\n\nfprintf('Solution has %d nonzeros. Error vs. IPM solution is %.2e\\n',...\n nnz(x), er(x) );\n\n% Check that we are within allowable bounds\nif out.err(end,1) < 1e-3\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_sBPDN_complex.m", "content": "%{\n Tests basis pursuit de-noising\n\n min_x ||x||_1\ns.t.\n || A(x) - b || <= eps\n\nThe solvers solve a regularized version, using\n ||x||_1 + mu/2*||x-x_0||_2^2\n\nThis version allows for complex measurements.\n\nsee also test_sBPDN.m\n\n%}\n\n% Before running this, please add the TFOCS base directory to your path\nmyAwgn = @(x,snr) x + ...\n 10^( (10*log10(sum(abs(x(:)).^2)/length(x(:))) - snr)/20 )*randn(size(x));\n\n% Try to load the problem from disk\nfileName = fullfile('reference_solutions','basispursuit_problem1_smoothed_noisy_complex');\nrandn('state',34324);\nrand('state',34324);\n\nN = 1024;\nM = round(N/2);\nK = round(M/5);\n\nA = fft(eye(N)); % A is complex\nrowsA = sort(randsample(N,M));\nA = A(rowsA,:);\n \nif exist([fileName,'.mat'],'file')\n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\nelse\n \n % Generate a new problem\n \n x = zeros(N,1);\n T = randsample(N,K);\n x(T) = randn(K,1);\n\n b_original = A*x;\n snr = 30; % SNR in dB\n b = myAwgn(b_original,snr);\n EPS = norm(b-b_original);\n x_original = x;\n \n mu = .01*norm(x,Inf);\n x0 = zeros(N,1);\n % Note: with equality constraints, this is an LP, so for mu small\n % enough (but > 0), we have exact relaxation.\n\n % get reference via CVX\n tic\n cvx_begin\n cvx_precision best\n variable xcvx(N,1)\n minimize norm(xcvx,1) + mu/2*sum_square(xcvx-x0)\n subject to\n norm(A*xcvx - b ) <= EPS\n cvx_end\n time_IPM = toc;\n x_ref = xcvx;\n obj_ref = norm(x_ref,1) + mu/2*sum_square(x_ref-x0);\n \n save(fileName,'x_ref','b','x_original','mu',...\n 'EPS','b_original','obj_ref','x0','time_IPM','snr');\n fprintf('Saved data to file %s\\n', fileName);\n \nend\n\n\n[M,N] = size(A);\nK = nnz(x_original);\nnorm_x_ref = norm(x_ref);\nnorm_x_orig = norm(x_original);\ner_ref = @(x) norm(x-x_ref)/norm_x_ref;\ner_signal = @(x) norm(x-x_original)/norm_x_orig;\nresid = @(x) norm(A*x-b)/norm(b); % change if b is noisy\n\nfprintf('\\tA is %d x %d, original signal has %d nonzeros\\n', M, N, K );\nfprintf('\\tl1-norm solution and original signal differ by %.2e (mu = %.2e)\\n', ...\n norm(x_ref - x_original)/norm(x_original),mu );\n\n%% Call the TFOCS solver\ner = er_ref; % error with reference solution (from IPM)\nopts = [];\nopts.errFcn = { @(f,dual,primal) er(primal), ...\n @(f,dual,primal) obj_ref - f }; \nopts.maxIts = 750;\n\n% Option 1:\nmode = 'r2c';\n% mode = 'c2c'; % do NOT use this: it solves a different problem!\nAA = A; bb = b; Ahandles = linop_matrix(AA,mode);\n\n% Option 2:\n% AA = [real(A); imag(A)]; bb = [real(b); imag(b)]; \n% Ahandles = linop_matrix(AA);\n\nz0 = []; % we don't have a good guess for the dual\ntic;\n[ x, out, optsOut ] = solver_sBPDN( Ahandles, bb, EPS, mu, x0, z0, opts );\ntime_TFOCS = toc;\n\nfprintf('Solution has %d nonzeros. Error vs. IPM solution is %.2e\\n',...\n nnz(x), er(x) );\n\nif out.err(end,1) < 1e-3\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_sBPDN_complex_2.m", "content": "%{\n Tests basis pursuit de-noising\n\n min_x ||x||_1\ns.t.\n || A(x) - b || <= eps\n\nThe solvers solve a regularized version, using\n ||x||_1 + mu/2*||x-x_0||_2^2\n\nThis version allows for complex measurements.\n\nUnlike test_sBPDN_complex, we also allow x to be complex.\nFor example, suppose we have a signal f that is the superposition\nof a few tones. Then in the \"synthesis\" formulation, we make the\nchange-of-variables x = F f, where F is the FFT matrix.\nIf \"PHI\" is the measurement matrix, then the linear operator is\nA = Phi*F', where F' = inv(F) is the IFFT.\n\nsee also test_sBPDN.m, test_sBPDN_complex, test_sBPDN_W\n\n%}\n\n% Before running this, please add the TFOCS base directory to your path\nmyAwgn = @(x,snr) x + ...\n 10^( (10*log10(sum(abs(x(:)).^2)/length(x(:))) - snr)/20 )*randn(size(x));\n\n% Try to load the problem from disk\nfileName = fullfile('reference_solutions','basispursuit_problem1_smoothed_noisy_complex_2');\nrandn('state',34324);\nrand('state',34324);\nN = 1024;\nM = round(N/2);\nM = round(M/5);\nPhi = randn(M,N);\nif exist([fileName,'.mat'],'file')\n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\n F = fft(eye(N))/sqrt(N);\n A = Phi * F';\nelse\n \n % Generate a new problem\n \n F = fft(eye(N))/sqrt(N);\n A = Phi * F';\n \n % introduce a sparsifying transform \"W\"\n f = zeros(N,1);\n % the signal x consists of several pure tones at random frequencies\n K = 5; %\n for k = 1:K\n f = f + randn()*sin( rand()*pi*(1:N) + 2*pi*rand() ).';\n end\n x = fft(f)/sqrt(N);\n\n\n b_original = A*x;\n snr = 30; % SNR in dB\n b = myAwgn(b_original,snr);\n EPS = norm(b-b_original);\n x_original = x;\n \n mu = .001*norm(x,Inf);\n x0 = zeros(N,1);\n\n % get reference via CVX\n tic\n cvx_begin\n cvx_precision best\n variable xcvx(N,1) complex\n minimize norm(xcvx,1) + mu/2*sum_square_abs(xcvx-x0)\n subject to\n norm(A*xcvx - b ) <= EPS\n cvx_end\n time_IPM = toc;\n x_ref = xcvx;\n obj_ref = norm(x_ref,1) + mu/2*sum_square_abs(x_ref-x0);\n \n save(fileName,'x_ref','b','x_original','mu',...\n 'EPS','b_original','obj_ref','x0','time_IPM','snr');\n fprintf('Saved data to file %s\\n', fileName);\n \nend\n\n\n[M,N] = size(A);\nnorm_x_ref = norm(x_ref);\nnorm_x_orig = norm(x_original);\ner_ref = @(x) norm(x-x_ref)/norm_x_ref;\ner_signal = @(x) norm(x-x_original)/norm_x_orig;\nresid = @(x) norm(A*x-b)/norm(b); % change if b is noisy\n\nfprintf('\\tA is %d x %d, original signal has %d nonzeros\\n', M, N, nnz(x_original) );\nfprintf('\\tl1-norm solution and original signal differ by %.2e (mu = %.2e)\\n', ...\n norm(x_ref - x_original)/norm(x_original),mu );\n\n%% Call the TFOCS solver\ner = er_ref; % error with reference solution (from IPM)\nopts = [];\nopts.errFcn = { @(f,dual,primal) er(primal), ...\n @(f,dual,primal) obj_ref - f }; \nopts.maxIts = 4500;\nopts.printEvery = 50;\nopts.tol = 1e-8;\n\nmode = 'c2c';\nAA = A; bb = b; Ahandles = linop_matrix(AA,mode);\n\nz0 = []; % we don't have a good guess for the dual\ntic;\n[ x, out, optsOut ] = solver_sBPDN( Ahandles, bb, EPS, mu, x0, z0, opts );\ntime_TFOCS = toc;\n\nfprintf('Solution has %d nonzeros. Error vs. IPM solution is %.2e\\n',...\n nnz(x), er(x) );\n\nif out.err(end,1) < 1e-5\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_sBPDN_nonnegative.m", "content": "%{\n Tests non-negative basis pursuit\n\n min_x ||X||_1\ns.t.\n || A(X) - b|| <= eps and x >= 0\n\nThe solvers solve a regularized version, using\n||x||_1 + mu/2*||x-x_0||_2^2\n\n\nSee also test_sBPDN.m and test_sBP_nonnegative.m\n\n%}\n\n% Before running this, please add the TFOCS base directory to your path\n\n% Try to load the problem from disk\nfileName = fullfile('reference_solutions','basispursuit_problem1_smoothed_noisy_nonnegative');\nrandn('state',25442);\nrand('state',2452);\n\nN = 1024;\nM = round(N/2);\nK = round(M/2);\n\nA = randn(M,N);\nif exist([fileName,'.mat'],'file')\n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\nelse\n \n % Generate a new problem\n\n x = zeros(N,1);\n T = randsample(N,K);\n x(T) = .1+rand(K,1); % x >= 0\n\n b = A*x;\n noise = .1*norm(b)*randn(M,1)/sqrt(M);\n EPS = .9*norm(noise);\n b_original = b + noise;\n x_original = x;\n \n mu = .01*norm(x,Inf);\n x0 = zeros(N,1);\n\n % get reference via CVX\n tic\n cvx_begin\n cvx_precision best\n variable xcvx(N,1)\n minimize norm(xcvx,1) + mu/2*sum_square(xcvx-x0)\n subject to\n norm( A*xcvx - b ) <= EPS\n xcvx >= 0\n cvx_end\n time_IPM = toc;\n x_ref = xcvx; \n obj_ref = norm(x_ref,1) + mu/2*sum_square(x_ref-x0);\n \n % get reference via CVX, this time, without the x >= 0 constraing\n tic\n cvx_begin\n cvx_precision best\n variable xcvx(N,1)\n minimize norm(xcvx,1) + mu/2*sum_square(xcvx-x0)\n subject to\n norm( A*xcvx - b ) <= EPS\n cvx_end\n time_IPM = toc;\n x_pureBP = xcvx;\n obj_ref = norm(x_ref,1) + mu/2*sum_square(x_ref-x0);\n \n save(fileName,'x_ref','b','x_original','mu',...\n 'EPS','b_original','obj_ref','x0','time_IPM','x_pureBP');\n fprintf('Saved data to file %s\\n', fileName);\n \nend\n\n\n[M,N] = size(A);\nK = nnz(x_original);\nnorm_x_ref = norm(x_ref);\nnorm_x_orig = norm(x_original);\nnorm_x_pureBP = norm(x_pureBP);\ner_ref = @(x) norm(x-x_ref)/norm_x_ref; % err w.r.t. CVX\ner_pureBP = @(x) norm(x-x_pureBP)/norm_x_pureBP; % err w.r.t. CVX w.o. nonneg constraint\ner_signal = @(x) norm(x-x_original)/norm_x_orig; % err w.r.t. signal\nresid = @(x) norm(A*x-b)/norm(b); % change if b is noisy\n\nfprintf('\\tA is %d x %d, original signal has %d nonzeros\\n', M, N, K );\nfprintf('\\tl1-norm solution and original signal differ by:\\t\\t\\t\\t%.2e (mu = %.2e)\\n', ...\n norm(x_pureBP - x_original)/norm(x_original),mu );\nfprintf('\\tl1-norm solution, with x >=0 constraint, and original signal differ by:\\t%.2e (mu = %.2e)\\n', ...\n norm(x_ref - x_original)/norm(x_original),mu );\n\ndisp('Note: because of the noise, we do not expect to get zero error');\n\n%% Call the TFOCS solver\ner = er_ref; % error with reference solution (from CVX)\nopts = [];\n% To see all possible options, run \"tfocs()\"\nopts.errFcn = { @(f,dual,primal) er(primal), ...\n @(f,dual,primal) obj_ref - f, ...\n @(f,dual,primal) nnz(primal) }; \nopts.maxIts = 400;\nz0 = []; % we don't have a good guess for the dual\n\nopts.nonneg = true; % tell it to add the x >= 0 constraint\n\ntic;\nx = solver_sBPDN( A, b, EPS, mu, x0, z0, opts );\ntime_TFOCS = toc;\n\nfprintf('for (original signal, IPM solution, TFOCS solution),\\n NNZ:\\n\\t%d\\t\\t%d\\t\\t%d\\n',...\n nnz(x_original),nnz(x_ref), nnz(x) );\nfprintf(' error vs. original, rel. l2 norm:\\n\\t%.2e\\t%.2e\\t%.2e\\n',...\n 0, er_signal(x_ref), er_signal(x) );\ner_signal1 = @(x) norm(x-x_original,Inf);\nfprintf(' error vs. original, lInf norm:\\n\\t%.2e\\t%.2e\\t%.2e\\n',...\n 0, er_signal1(x_ref), er_signal1(x) );\nfprintf(' time to solve:\\n\\tN/A\\t\\t%.1fs\\t\\t%.1fs\\n',...\n time_IPM, time_TFOCS );\n\n% Check that we are within allowable bounds\nif er(x) < .01\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_sBPDN_withContinuation.m", "content": "%{\n Tests basis pursuit de-noising\n\n min_x ||x||_1\ns.t.\n || A(x) - b || <= eps\n\nThe solvers solve a regularized version, using\n ||x||_1 + mu/2*||x-x_0||_2^2\n\nin this file, we will use continuation to eliminate\nthe effect of the \"mu\" term.\n\nsee also test_sBPDN.m\n\n%}\n\n% Before running this, please add the TFOCS base directory to your path\n\n% Try to load the problem from disk\nfileName = fullfile('reference_solutions','basispursuit_problem1_noisy');\nrandn('state',34324);\nrand('state',34324);\nN = 1024;\nM = round(N/2);\nK = round(M/5);\nA = randn(M,N);\nmyAwgn = @(x,snr) x + ...\n 10^( (10*log10(sum(abs(x(:)).^2)/length(x(:))) - snr)/20 )*randn(size(x));\nif exist([fileName,'.mat'],'file')\n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\nelse\n \n % Generate a new problem\n x = zeros(N,1);\n T = randsample(N,K);\n x(T) = randn(K,1);\n\n b_original = A*x;\n snr = 30; % SNR in dB\n b = myAwgn(b_original,snr);\n EPS = norm(b-b_original);\n x_original = x;\n \n mu = .01*norm(x,Inf);\n x0 = zeros(N,1);\n\n % get reference via CVX\n tic\n cvx_begin\n cvx_precision best\n variable xcvx(N,1)\n minimize norm(xcvx,1)\n subject to\n norm(A*xcvx - b ) <= EPS\n cvx_end\n time_IPM = toc;\n x_ref = xcvx;\n obj_ref = norm(x_ref,1);\n \n save(fileName,'x_ref','b','x_original','mu',...\n 'EPS','b_original','obj_ref','x0','time_IPM','snr');\n fprintf('Saved data to file %s\\n', fileName);\n \nend\n\n\n[M,N] = size(A);\nK = nnz(x_original);\nnorm_x_ref = norm(x_ref);\nnorm_x_orig = norm(x_original);\ner_ref = @(x) norm(x-x_ref)/norm_x_ref;\ner_signal = @(x) norm(x-x_original)/norm_x_orig;\nresid = @(x) norm(A*x-b)/norm(b); % change if b is noisy\n\nfprintf('\\tA is %d x %d, original signal has %d nonzeros\\n', M, N, K );\nfprintf('\\tl1-norm solution and original signal differ by %.2e (mu = %.2e)\\n', ...\n norm(x_ref - x_original)/norm(x_original),mu );\n\n%% Call the TFOCS solver\ner = er_ref; % error with reference solution (from IPM)\nopts = [];\nopts.restart = 500;\nopts.errFcn = { @(f,dual,primal) er(primal) };\nopts.maxIts = 1000;\nopts.countOps = true;\n% To see more possible options, run the command \"tfocs\"\n\nz0 = []; % we don't have a good guess for the dual\ntic;\n\n\n% -- with continuation:\nopts.continuation = true;\n\n% when using continuation, a good stopping criteria is this one:\nopts.stopCrit = 4; opts.tol = 1e-6;\nopts.printStopcrit = 1; % this will display the value used in the stopping criteria calculation\n[ x, out, optsOut ] = solver_sBPDN( A, b, EPS, mu, x0, z0, opts);\n\n\n\ntime_TFOCS = toc;\n\nfprintf('Solution has %d nonzeros. Error vs. IPM solution is %.2e\\n',...\n nnz(x), er(x) );\n% Test we are within bounds:\nif out.err(end,1) < 1e-3\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n%% Advanced options for continuation\n% To see all possible options, run \"continuation\" with no inputs:\ncontinuation()\n\ncontinuationOptions = [];\n\n% for example, we can make sure that we only take at most 200\n% iterations (except for the very last outer iteration):\ncontinuationOptions.innerMaxIts = 200;\n\n% and instead of just 3 iterations (the default), let's do 5 iterations:\ncontinuationOptions.maxIts = 5;\n\n% and decrease the tolerance of the outer loop\ncontinuationOptions.tol = 1e-5;\n\nopts.printEvery = Inf; % to suppress output from inner iterations\ncontinuationOptions.verbose = true; % \"true\" by default\n\n% if you want mu to decrease:\ncontinuationOptions.muDecrement = 0.8;\n\n[ x, out, optsOut ] = solver_sBPDN( A, b, EPS, mu, x0, z0, opts, continuationOptions);\n\n% Test we are within bounds:\nif out.err(end,1) < 1e-3\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_sBP_nonnegative.m", "content": "%{\n Tests non-negative basis pursuit\n\n min_x ||X||_1\ns.t.\n A(X) == b and x >= 0\n\nThe solvers solve a regularized version, using\n||x||_1 + mu/2*||x-x_0||_2^2\n\n%}\n\n% Before running this, please add the TFOCS base directory to your path\n\n% Try to load the problem from disk\nfileName = fullfile('reference_solutions','basispursuit_problem1_smoothed_noiseless_nonnegative');\nrandn('state',34324);\nrand('state',34324);\n\nN = 1024;\nM = round(N/2);\nK = round(M/2);\n\nA = randn(M,N);\nif exist([fileName,'.mat'],'file')\n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\nelse\n \n % Generate a new problem\n\n x = zeros(N,1);\n T = randsample(N,K);\n x(T) = .1+rand(K,1);\n\n b = A*x;\n EPS = 0;\n b_original = b;\n x_original = x;\n \n mu = .01*norm(x,Inf);\n x0 = zeros(N,1);\n % Note: with equality constraints, this is an LP, so for mu small\n % enough (but > 0), we have exact relaxation.\n\n % get reference via CVX\n tic\n cvx_begin\n cvx_precision best\n variable xcvx(N,1)\n minimize norm(xcvx,1) + mu/2*sum_square(xcvx-x0)\n subject to\n A*xcvx == b\n xcvx >= 0\n cvx_end\n time_IPM = toc;\n x_ref = xcvx; \n obj_ref = norm(x_ref,1) + mu/2*sum_square(x_ref-x0);\n \n % get reference via CVX, this time, without the x >= 0 constraing\n tic\n cvx_begin\n cvx_precision best\n variable xcvx(N,1)\n minimize norm(xcvx,1) + mu/2*sum_square(xcvx-x0)\n subject to\n A*xcvx == b\n cvx_end\n time_IPM = toc;\n x_pureBP = xcvx;\n obj_ref = norm(x_ref,1) + mu/2*sum_square(x_ref-x0);\n \n save(fileName,'x_ref','b','x_original','mu',...\n 'EPS','b_original','obj_ref','x0','time_IPM','x_pureBP');\n fprintf('Saved data to file %s\\n', fileName);\n \nend\n\n\n[M,N] = size(A);\nK = nnz(x_original);\nnorm_x_ref = norm(x_ref);\nnorm_x_orig = norm(x_original);\nnorm_x_pureBP = norm(x_pureBP);\ner_ref = @(x) norm(x-x_ref)/norm_x_ref;\ner_pureBP = @(x) norm(x-x_pureBP)/norm_x_pureBP;\ner_signal = @(x) norm(x-x_original)/norm_x_orig;\nresid = @(x) norm(A*x-b)/norm(b); % change if b is noisy\n\nfprintf('\\tA is %d x %d, original signal has %d nonzeros\\n', M, N, K );\nfprintf('\\tl1-norm solution and original signal differ by:\\t\\t\\t\\t%.2e (mu = %.2e)\\n', ...\n norm(x_pureBP - x_original)/norm(x_original),mu );\nfprintf('\\tl1-norm solution, with x >=0 constraint, and original signal differ by:\\t%.2e (mu = %.2e)\\n', ...\n norm(x_ref - x_original)/norm(x_original),mu );\n\n%% Call the TFOCS solver\ner = er_ref; % error with reference solution (from IPM)\n% er = er_signal; % error from original signal\n% er = er_pureBP; % the \"pureBP\" solution did not have x>=0\nopts = [];\nopts.errFcn = { @(f,dual,primal) er(primal), ...\n @(f,dual,primal) obj_ref - f, ...\n @(f,dual,primal) nnz(primal) }; \nopts.restart = 1000;\nz0 = []; % we don't have a good guess for the dual\ntic;\n\nprojectionF = {proj_Rn; proj_Rplus };\n\nscaleA = 1/norm(A);\n[x,out,optsOut] = tfocs_SCD( prox_l1, { linop_compose(A,scaleA), -b*scaleA; 1,0 }, projectionF, mu, x0, z0, opts );\n\n\n\ntime_TFOCS = toc;\n\nfprintf('for (original signal, IPM solution, TFOCS solution),\\n NNZ:\\n\\t%d\\t\\t%d\\t\\t%d\\n',...\n nnz(x_original),nnz(x_ref), nnz(x) );\nfprintf(' error vs. original, rel. l2 norm:\\n\\t%.2e\\t%.2e\\t%.2e\\n',...\n 0, er_signal(x_ref), er_signal(x) );\ner_signal1 = @(x) norm(x-x_original,Inf);\nfprintf(' error vs. original, lInf norm:\\n\\t%.2e\\t%.2e\\t%.2e\\n',...\n 0, er_signal1(x_ref), er_signal1(x) );\nfprintf(' time to solve:\\n\\tN/A\\t\\t%.1fs\\t\\t%.1fs\\n',...\n time_IPM, time_TFOCS );\n\n% Test we are within bounds:\nif out.err(end,1) < 1e-6\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n%% As of version 1.0d, the solver_sBP.m file can handle x >= 0 constraints\n% This version will be more efficient, since it calls a special\n% l1 + non-negative operator, rather than splitting it up.\n\nopts.nonneg = true; % tell it to add the x >= 0 constraint\n[x,out,optsOut] = solver_sBP( A, b, mu, x0, z0, opts );\n\n% Test we are within bounds:\nif out.err(end,1) < 1e-5\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_sDantzig.m", "content": "%{\n Tests the Dantzig Selector\n\n min_x ||x||_1\ns.t.\n || D*A'*(A*x - b) || <= delta\n\nThe solvers solve a regularized version, using\n ||x||_1 + mu/2*||x-x_0||_2^2\n\nsee also test_sBPDN.m\n\n%}\n\n% Before running this, please add the TFOCS base directory to your path\nmyAwgn = @(x,snr) x + ...\n 10^( (10*log10(sum(abs(x(:)).^2)/length(x(:))) - snr)/20 )*randn(size(x));\n\n% Try to load the problem from disk\nfileName = fullfile('reference_solutions','dantzig_problem1_smoothed_noisy');\nrandn('state',34324);\nrand('state',34324);\nN = 1024;\nM = round(N/2);\nK = round(M/5);\nA = randn(M,N);\nif exist([fileName,'.mat'],'file')\n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\nelse\n \n % Generate a new problem\n\n normA2 = norm( (A'*A) )^2;\n x = zeros(N,1);\n T = randsample(N,K);\n x(T) = randn(K,1);\n\n\n b_original = A*x;\n snr = 30; % SNR in dB\n b = myAwgn(b_original,snr);\n z = b - b_original;\n sigma = std(z); % estimate of standard deviation\n\n % compute D and delta so that original signal is\n % feasible with probability 1 - alpha\n alpha = 0.1;\n Anorms = sqrt(sum(A.^2))';\n nTrials = min(4*N,400);\n w = randn(M,nTrials);\n supAtz = sort(max( (A'*w) ./Anorms(:,ones(1,nTrials))));\n thresh = supAtz(round(nTrials*(1-alpha))); % empirical\n d = thresh*sigma*Anorms; % a vector, for Dantzig solvers\n if all(d > 1e-10)\n delta = mean(d);\n D = delta./d; % watch out for division by 0\n else\n D = 1;\n delta = 0;\n end\n normA2 = norm( diag(D)*(A'*A) )^2;\n% clear d alpha w thresh nTrials\n\n x_original = x;\n \n mu = .05*norm(x,Inf);\n x0 = zeros(N,1);\n % Note:this is an LP, so for mu small\n % enough (but > 0), we have exact relaxation.\n\n % get reference via CVX\n tic\n cvx_begin\n cvx_precision best\n variable xcvx(N,1)\n minimize norm(xcvx,1) + mu/2*sum_square(xcvx-x0)\n subject to\n norm(D.*(A'*(A*xcvx - b)),Inf ) <= delta\n cvx_end\n time_IPM = toc;\n x_ref = xcvx;\n obj_ref = norm(x_ref,1) + mu/2*sum_square(x_ref-x0);\n \n save(fileName,'x_ref','b','x_original','mu',...\n 'delta','D','b_original','obj_ref','x0','time_IPM','snr');\n fprintf('Saved data to file %s\\n', fileName);\n \nend\n\n\n[M,N] = size(A);\nK = nnz(x_original);\nnorm_x_ref = norm(x_ref);\nnorm_x_orig = norm(x_original);\ner_ref = @(x) norm(x-x_ref)/norm_x_ref;\ner_signal = @(x) norm(x-x_original)/norm_x_orig;\nresid = @(x) norm(A*x-b)/norm(b); % change if b is noisy\n\nfprintf('\\tA is %d x %d, original signal has %d nonzeros\\n', M, N, K );\nfprintf('\\tl1-norm solution and original signal differ by %.2e (mu = %.2e)\\n', ...\n norm(x_ref - x_original)/norm(x_original),mu );\n\n%% Call the TFOCS solver\ner = er_ref; % error with reference solution (from IPM)\nopts = [];\nopts.restart = 500;\nopts.errFcn = { @(f,dual,primal) er(primal), ...\n @(f,dual,primal) obj_ref - f }; \nopts.maxIts = 2000;\nz0 = []; % we don't have a good guess for the dual\ntic;\n[ x, out, optsOut ] = solver_sDantzig( {A,D}, b, delta, mu, x0, z0, opts );\ntime_TFOCS = toc;\n\nfprintf('Solution has %d nonzeros. Error vs. IPM solution is %.2e\\n',...\n nnz(x), er(x) );\n\n% Check that we are within allowable bounds\nif out.err(end,1) < 1e-4\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n%% plot error\nsemilogy( out.err(:,1) )\nhold all\n\n%% Call the solver with W = I\n% This is not usually recommended, since it is not necessary\n% and creates extra dual variables\nopts.restart = 2000;\nW = linop_scale(1); % identity\n[ x, out, optsOut ] = solver_sDantzig_W( {A,D}, W, b, delta, mu, x0, z0, opts );\n% Check that we are within allowable bounds\nif out.err(end,1) < 1e-1\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n\n%% close all figures\nclose all\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_sDantzig_3methods.m", "content": "%{\n Tests the Dantzig Selector\n\n min_x ||x||_1\ns.t.\n || D*A'*(A*x - b) || <= delta\n\nThe solvers solve a regularized version, using\n ||x||_1 + mu/2*||x-x_0||_2^2\n\nsee also test_sDantzig.m\n\nThis demo shows three formulations of the Dantzig selector\nInstead of calling a pre-built solver, we show how to call\ntfocs_SCD directly.\n\n%}\n\n% Before running this, please add the TFOCS base directory to your path\n\n% Try to load the problem from disk\nmu = 0;\nfileName = fullfile('reference_solutions','dantzig_problem1_smoothed_noisy');\nrandn('state',34324);\nrand('state',34324);\nN = 1024;\nM = round(N/2);\nK = round(M/5);\nA = randn(M,N);\nif exist([fileName,'.mat'],'file')\n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\nelse\n disp('Please run test_sDantzig.m to setup the file');\nend\n\n\n[M,N] = size(A);\nK = nnz(x_original);\nnorm_x_ref = norm(x_ref);\nnorm_x_orig = norm(x_original);\ner_ref = @(x) norm(x-x_ref)/norm_x_ref;\ner_signal = @(x) norm(x-x_original)/norm_x_orig;\nresid = @(x) norm(A*x-b)/norm(b); % change if b is noisy\n\nfprintf('\\tA is %d x %d, original signal has %d nonzeros\\n', M, N, K );\nfprintf('\\tl1-norm solution and original signal differ by %.2e (mu = %.2e)\\n', ...\n norm(x_ref - x_original)/norm(x_original),mu );\n\n%% Call the TFOCS solver\ner = er_ref; % error with reference solution (from IPM)\nopts = [];\nopts.restart = 500;\nopts.errFcn = { @(f,dual,primal) er(primal), ...\n @(f,dual,primal) obj_ref - f }; \nopts.maxIts = 1000;\nopts.printEvery = 100;\nz0 = []; % we don't have a good guess for the dual\n\n\n%% Method 1: use the epigraph of the l_infinity norm as the cone\n% Note: this is equivalent to calling:\n% [ x, out, optsOut ] = solver_sDantzig( {A,D}, b, delta, mu, x0, z0, opts );\n\nDAtb = D.*(A'*b);\nDD = @(x) D.*(x);\nobjectiveF = prox_l1;\naffineF = {linop_matrix(diag(D)*(A'*A)), -DAtb };\ndualproxF = prox_l1( delta );\n[ x, out, opts ] = tfocs_SCD( objectiveF, affineF, dualproxF, mu, x0, z0, opts );\nx1 = x;\nout1 = out;\n\nfprintf('Solution has %d nonzeros. Error vs. IPM solution is %.2e\\n',...\n nnz(x), er(x) );\n\n% Check that we are within allowable bounds\nif out.err(end,1) < 1e-3\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n%% Method 2: use the LP formulation\n% Instead of the constraint ||Ax-b||_infty <= delta\n% (where \"A\" is really DA'A),\n% think of it as\n% -(Ax-b) + delta >= 0\n% (Ax-b) + delta >= 0\n\nobjectiveF = prox_l1;\naffineF = {linop_matrix(-diag(D)*(A'*A)), DAtb + delta;...\n linop_matrix( diag(D)*(A'*A)), -DAtb + delta; };\n\ndualproxF = { proj_Rplus; proj_Rplus };\n[ x, out, opts ] = tfocs_SCD( objectiveF, affineF, dualproxF, mu, x0, z0, opts );\nx2 = x;\nout2 = out;\n\n% Check that we are within allowable bounds\nif out.err(end,1) < 1e-3\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n%% Method 3: put objective into constraint\n% This is the trick we do with solver_sDantzig_W, to deal with ||Wx||_1\n% Instead of minimizing ||x||_1, we minimize t,\n% with the constraint that ||x||_1 <= t\n% This version has some scaling considerations -- if we \n% are careful about scaling, the dual problem will be solved much faster.\n\n% Note: we still have to deal with the original constraints. We\n% can use either method 1 or method 2 above. Here, we'll use\n% method 1.\n\n\nobjectiveF = []; % tfocs_SCD recognizes this special objective\nnormA2 = norm( diag(D)*A'*A )^2;\nscale = 1/sqrt(normA2);\naffineF = {linop_matrix(diag(D)*(A'*A)), -DAtb; linop_scale(1/scale), 0 };\ndualproxF = { prox_l1(delta); proj_linf(scale) };\n[ x, out, opts ] = tfocs_SCD( objectiveF, affineF, dualproxF, mu, x0, z0, opts );\nx3 = x;\nout3 = out;\n\n% Check that we are within allowable bounds\nif out.err(end,1) < 1e-2\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n%% plot\nfigure;\nsemilogy( out1.err(:,1) );\nhold all\nsemilogy( out2.err(:,1) );\nsemilogy( out3.err(:,1) );\nlegend('Method 1 (epigraph cone)','Method 2 (LP)','Method 3 (W=I)' );\n\n%% close all plots\nclose all\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information." }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_sTV.m", "content": "%{\n Tests total-variation problem\n\n min_x ||x||_TV\ns.t.\n || A(x) - b || <= eps\n\nThe solvers solve a regularized version\n\nsee also test_sBP.m and test_sBPDN_W.m\n\nrequires the image processing toolbox for this demo\n(but the TFOCS solver does not rely on this toolbox)\n\nSee also the TV examples in examples/largescale\n\n%}\n\n% Before running this, please add the TFOCS base directory to your path\n\nmyAwgn = @(x,snr) x + ...\n 10^( (10*log10(sum(abs(x(:)).^2)/length(x(:))) - snr)/20 )*randn(size(x));\n\n% Try to load the problem from disk\nfileName = fullfile('reference_solutions','tv_problem1_smoothed_noisy');\nrandn('state',245);\nrand('state',245);\nn = 32;\nn1 = n;\nn2 = n-1; % testing the code with non-square signals\nN = n1*n2;\nM = round(N/2);\nA = randn(M,N);\nif exist([fileName,'.mat'],'file')\n load(fileName);\n fprintf('Loaded problem from %s\\n', fileName );\nelse\n \n % Generate a new problem\n\n n = max(n1,n2);\n x = phantom(n); \n x = x(1:n1,1:n2);\n x_original = x;\n \n mat = @(x) reshape(x,n1,n2);\n vec = @(x) x(:);\n \n\n b_original = A*vec(x_original);\n snr = 40; % SNR in dB\n b = myAwgn(b_original,snr);\n EPS = norm(b-b_original);\n \n tv = linop_TV( [n1,n2], [], 'cvx' );\n \n mu = .005*norm( tv(x_original) ,Inf);\n x0 = zeros(n1,n2);\n\n % get reference via CVX\n tic\n cvx_begin\n cvx_precision best\n variable xcvx(n1,n2)\n minimize tv(xcvx) + mu/2*sum_square(vec(xcvx)-vec(x0) )\n subject to\n norm(A*vec(xcvx) - b ) <= EPS\n cvx_end\n time_IPM = toc;\n x_ref = xcvx;\n obj_ref = tv(x_ref) + mu/2*sum_square(vec(x_ref)-vec(x0) );\n \n save(fileName,'x_ref','b','x_original','mu',...\n 'EPS','b_original','obj_ref','x0','time_IPM','snr');\n fprintf('Saved data to file %s\\n', fileName);\n \nend\n\nimshow( [x_original, x_ref] );\n\n[M,N] = size(A);\n[n1,n2] = size(x_original);\nnorm_x_ref = norm(x_ref,'fro');\nnorm_x_orig = norm(x_original,'fro');\ner_ref = @(x) norm(vec(x)-vec(x_ref))/norm_x_ref;\ner_signal = @(x) norm(x-x_original)/norm_x_orig;\nresid = @(x) norm(A*vec(x)-b)/norm(b); % change if b is noisy\n\n\n%% Call the TFOCS solver\ner = er_ref; % error with reference solution (from IPM)\nopts = [];\nopts.restart = 1000;\nopts.errFcn = { @(f,dual,primal) er(primal), ...\n @(f,dual,primal) obj_ref - f }; \nopts.maxIts = 1000;\n\nW = linop_TV( [n1,n2] );\nnormW = linop_TV( [n1,n2], [], 'norm' );\nopts.normW2 = normW^2;\nz0 = []; % we don't have a good guess for the dual\ntic;\n[ x, out, optsOut ] = solver_sBPDN_W( A, W, b, EPS, mu, vec(x0), z0, opts );\ntime_TFOCS = toc;\n\nfprintf('Solution has %d nonzeros. Error vs. IPM solution is %.2e\\n',...\n nnz(x), er(x) );\n\n% Check that we are within allowable bounds\nif out.err(end,1) < 1e-4\n disp('Everything is working');\nelse\n error('Failed the test');\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/examples/smallscale/test_variousSolvers.m", "content": "%{\nSolves a simple quadratic problem\n(with optimal solution known in closed-form)\nwith all the various solvers\n\n\nthe quadratic problem is:\n\nmin_x c'x + x'Px/2, P > 0, hence the optimal solution is x = -inv(Q)*c\n\nOn a simple quadratic example like this, when there is no projection,\nall the solver behave similarly. So this script is more useful for debugging\nto make sure that all solvers are working\n\n%}\n\n%% Make a problem\nN = 100;\nrandn('state',2334);\nP = randn(N); P = P*P' + .1*eye(N); % ensure P is symmetric positive definite\nc = randn(N,1);\n\nx_ref = -P\\c;\n\n%% Solve with TFOCS\nf = smooth_quad( P, c );\naffine = [];\nprojector = [];\nx0 = zeros(N,1);\nopts = [];\nopts.printEvery = 500;\nopts.tol = 1e-8;\nopts.printStopCrit = true;\nopts.restart = 350; % use this since the problem is strongly convex\nopts.errFcn = @(f,x) norm( x-x_ref)/norm(x_ref);\nopts.maxIts = 750;\n\n% The 'N83' and 'AT' methods can take advantage when you know\n% the exact value of the strong convexity parameter\n% (and the Lipschitz constant). In this case, do not\n% use restart. But we won't test this right now, \n% since it is unusual that you have information\n% about the strong convexity constant.\n% opts.restart = Inf;\n% opts.mu = min(eig(P)); % strong convexity parameter. N83 can make use of this\n% opts.Lexact = max(eig(P));\n\nsolverList = { 'GRA', 'AT', 'LLM', 'N07', 'N83', 'TS' };\n% solverList = { 'GRA', 'AT', 'N83', 'TS' };\n% solverList = { 'LLM','N07'}; % these take two steps per iteration\n\nfigure(1); clf;\n\nfor k = 1:length( solverList )\n solver = solverList{k};\n opts.alg = solver;\n fprintf('\\nSolver: %s\\n\\n', solver );\n [x,out,optsOut] = tfocs( f, affine, projector, x0, opts );\n semilogy( out.err );\n hold all\nend\nlegend( solverList );\n\n\n%% close all figures\nclose all\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information." }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/linop_TV.m", "content": "function op = linop_TV( sz, variation, action )\n\n%LINOP_TV 2D Total-Variation (TV) linear operator.\n% OP = LINOP_TV( SZ ) returns a handle to a TFOCS linear operator that\n% implements the total variation linear operator on an M x N grid;\n% that is, to be applied to matrices of size [M,N].\n% By default, it expects to operate on M*N x 1 vectors\n% but if SZ = {M,N}, then expects to operate on M x N matrices\n%\n% N.B. In this form, OP does not calculate the TV norm but rather\n% a vector of size M*N x 1 such that TV(X) = norm( OP(X,1), 1 ).\n%\n% TV = LINOP_TV( X ) returns ||X||_TV if X is bigger than 2 x 2\n%\n% OP = LINOP_TV( SZ, VARIANT ) \n% if VARIANT is 'regular' (default),\n% assumes zeros on the boundary (Dirichlet boundary conditions)\n% if VARIANT is 'circular',\n% assumes circularity, so x(:,N+1) - x(:,N)\n% is calculated by x(:,1) - x(:,N) (and similarly\n% for row differences) [when SZ={M,N}]\n%\n% [...] = LINOP_TV(SZ, VARIATION, ACTION )\n% if ACTION is 'handle', returns a TFOCS function handle (default)\n% if ACTION is 'cvx', returns a function handle suitable for CVX\n% if ACTION is 'matrix', returns the explicit TV matrix\n% (real part corresponds to horizontal differences,\n% imaginary part correspond to vertical differences)\n% if ACTION is 'norm', returns an estimate of the norm\n%\n% TODO: check circular case for non-square domains\n%\n\nerror(nargchk(1,3,nargin));\nif nargin < 2 || isempty(variation), variation = 'regular'; end\nif nargin < 3 || isempty(action), action = 'handle'; end\n\nCALCULATE_TV = false;\nif numel(sz) > 4 \n CALCULATE_TV = true;\n X = sz;\n sz = size(X);\nend\n\nif iscell(sz)\n n1 = sz{1};\n n2 = sz{2};\nelse\n n1 = sz(1);\n n2 = sz(2);\nend\n\n% Setup the Total-Variation operators\nmat = @(x) reshape(x,n1,n2);\n\nif strcmpi(action,'matrix') || strcmpi(action,'cvx')\n switch lower(variation)\n case 'regular'\n e = ones(max(n1,n2),1);\n e2 = e;\n e2(n2:end) = 0;\n J = spdiags([-e2,e], 0:1,n2,n2);\n I = eye(n1);\n Dh = kron(J,I); % horizontal differences, sparse matrix\n % see also blkdiag\n \n e2 = e;\n e2(n1:end) = 0;\n J = spdiags([-e2,e], 0:1,n1,n1);\n I = eye(n2);\n Dv = kron(I,J); % vertical differences, sparse matrix\n case 'circular'\n e = ones(max(n1,n2),1);\n e2 = e;\n% e2(n2:end) = 0;\n J = spdiags([-e2,e], 0:1,n2,n2);\n J(end,1) = 1;\n I = eye(n1);\n Dh = kron(J,I); % horizontal differences, sparse matrix\n % see also blkdiag\n \n e = ones(max(n1,n2),1);\n e2 = e;\n% e2(n1:end) = 0;\n J = spdiags([-e2,e], 0:1,n1,n1);\n J(end,1) = 1;\n I = eye(n2);\n Dv = kron(I,J); % vertical differences, sparse matrix\n end\n if strcmpi(action,'matrix')\n op = Dh + 1i*Dv;\n else\n % \"norms\" is a CVX function, but we can over-load it (see sub-function below)\n op = @(X) sum( norms( [Dh*X(:), Dv*X(:)]', 1 ) );\n end\n return;\nend\n\nswitch lower(variation)\n case 'regular'\n Dh = @(X) vec( [diff(X,1,2), zeros(n1,1)] );\n diff_h = @(X) [zeros(n1,1),X(:,1:end-1)] - [X(:,1:end-1),zeros(n1,1) ];\n Dv = @(X) vec( [diff(X,1,1); zeros(1,n2)] );\n diff_v = @(X) [zeros(1,n2);X(1:end-1,:)] - [X(1:end-1,:);zeros(1,n2) ];\n % sometimes diff_v is much slower than diff_h\n % We can exploit data locality by working with transposes\n diff_v_t = @(Xt) ([zeros(n2,1),Xt(:,1:end-1)] - [Xt(:,1:end-1),zeros(n2,1)])';\n case 'circular'\n % For circular version, 2 x 2 case is special.\n% error('not yet implemented');\n Dh = @(X) vec( [diff(X,1,2), X(:,1) - X(:,end)] );\n % diff_h needs to be checked\n diff_h = @(X) [X(:,end),X(:,1:end-1)] - X;\n % diff_v needs to be checked\n Dv = @(X) vec( [diff(X,1,1); X(1,:) - X(end,:) ] );\n diff_v = @(X) [X(end,:);X(1:end-1,:)] - X;\n diff_v_t = @(Xt) ([Xt(:,end),Xt(:,1:end-1)] - Xt)';\n otherwise\n error('Bad variation parameter');\nend\nif iscell(sz)\n Dh_transpose = @(X) diff_h(mat(X)) ;\n% Dv_transpose = @(X) diff_v(mat(X)) ;\n Dv_transpose = @(X) diff_v_t(mat(X)') ; % faster\nelse\n Dh_transpose = @(X) vec( diff_h(mat(X)) );\n% Dv_transpose = @(X) vec( diff_v(mat(X)) );\n Dv_transpose = @(X) vec( diff_v_t(mat(X)') ); % faster\nend\n\nTV = @(x) ( Dh(mat(x)) + 1i*Dv(mat(x)) ); % real to complex\nTVt = @(z) ( Dh_transpose(real(z)) + Dv_transpose(imag(z)) );\n\nif CALCULATE_TV\n op = norm( TV(X), 1 );\n return;\nend\n\nif strcmpi(action,'norm')\n % to compute max eigenvalue, I use a vector\n % that is very likely to be the max eigenvector:\n % matrix with every entry alternating -1 and 1\n even = @(n) ~( n - 2*round(n/2) ); % returns 1 if even, 0 if odd\n Y = zeros( n1 + even(n1), n2 + even(n2) );\n nn = numel(Y);\n Y(:) = (-1).^(1:nn);\n Y = Y(1:n1,1:n2);\n op = norm( TV(Y) )/norm(Y(:));\n \n % Nearly equivalent to:\n % norm(full( [real(tv); imag(tv)] ) ) \n % where tv is the matrix form\nelse\n if iscell(sz)\n szW = { [n1,n2], [n1*n2,1] };\n else\n szW = sz(1)*sz(2); % n1 * n2\n szW = [szW,szW];\n end\n op = @(x,mode)linop_tv_r2c(szW,TV,TVt,x,mode);\nend\n\nfunction y = linop_tv_r2c( sz, TV, TVt, x, mode )\nswitch mode,\n case 0, y = sz;\n case 1, y = TV( realcheck( x ) );\n case 2, y = realcheck( TVt( x ) );\nend\n\nfunction y = realcheck( y )\nif ~isreal( y ), \n error( 'Unexpected complex value in linear operation.' );\nend\n\n\nfunction y = norms( x, p, dim )\nsx = size(x);\nif nargin < 3, dim = 1; end\nif nargin < 2 || isempty(p), p = 2; end\nif isempty(x) || dim > length(sx) || sx(dim)==1\n p = 1;\nend\nswitch p,\n case 1,\n y = sum( abs( x ), dim );\n case 2,\n y = sqrt( sum( x .* conj( x ), dim ) );\n case Inf,\n y = max( abs( x ), [], dim );\n case {'Inf','inf'}\n y = max( abs( x ), [], dim );\n otherwise,\n y = sum( abs( x ) .^ p, dim ) .^ ( 1 / p );\nend\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/linop_TV3D.m", "content": "function op = linop_TV3D( sz, variation, action )\r\n\r\n%LINOP_TV3D 3D Total-Variation (TV) linear operator.\r\n% OP = LINOP_TV3D( SZ ) returns a handle to a TFOCS linear operator that\r\n% implements the total variation linear operator on an M x N x P grid;\r\n% that is, to be applied to volume stacks of size [M,N,P].\r\n% By default, it expects to operate on M*N*P x 1 vectors\r\n% but if SZ = {M,N,P}, then expects to operate on M x N x P matrices\r\n%\r\n% TV = LINOP_TV3D( X ) returns ||X||_TV if X is bigger than 2 x 2 x 2\r\n%\r\n% OP = LINOP_TV3D( SZ, VARIANT )\r\n% if VARIANT is 'regular' (default),\r\n% ... TODO\r\n% if VARIANT is 'circular',\r\n% ... TODO\r\n%\r\n% [...] = LINOP_TV3D(SZ, VARIATION, ACTION )\r\n% if ACTION is 'handle', returns a TFOCS function handle (default)\r\n% if ACTION is 'cvx', returns a function handle suitable for CVX\r\n% if ACTION is 'matrix', returns the explicit TV matrix\r\n% (real part corresponds to horizontal differences,\r\n% imaginary part correspond to vertical differences)\r\n% if ACTION is 'norm', returns an estimate of the norm\r\n%\r\n% Contributed by Mahdi Hosseini (mahdi.hosseini@mail.utoronto.ca)\r\n% Has not been extensively tested\r\n\r\nerror(nargchk(1,3,nargin));\r\nif nargin < 2 || isempty(variation), variation = 'regular'; end\r\nif nargin < 3 || isempty(action), action = 'handle'; end\r\n\r\nCALCULATE_TV = false;\r\nif numel(sz) > 6\r\n CALCULATE_TV = true;\r\n X = sz;\r\n sz = size(X);\r\nend\r\nnDim = numel(sz);\r\n\r\nif iscell(sz)\r\n n1 = sz{1};\r\n n2 = sz{2};\r\n n3 = sz{3};\r\nelse\r\n n1 = sz(1);\r\n n2 = sz(2);\r\n n3 = sz(3);\r\nend\r\n\r\n% Setup the Total-Variation operators\r\nmat = @(x) reshape(x,n1,n2,n3);\r\n\r\nif strcmpi(action,'matrix') || strcmpi(action,'cvx')\r\n I1 = eye(n1);\r\n I2 = eye(n2);\r\n I3 = eye(n3);\r\n switch lower(variation)\r\n case 'regular'\r\n e = ones(max([n1,n2,n3]),1);\r\n e2 = e;\r\n e2(n2:end) = 0;\r\n J = spdiags([-e2,e], 0:1,n2,n2);\r\n Dh = kron(I3,kron(J,I1)); % horizontal differences, sparse matrix\r\n % see also blkdiag\r\n \r\n e2 = e;\r\n e2(n1:end) = 0;\r\n J = spdiags([-e2,e], 0:1,n1,n1);\r\n Dv = kron(I3,kron(I2,J)); % vertical differences, sparse matrix\r\n \r\n e2 = e;\r\n e2(n3:end) = 0;\r\n J = spdiags([-e2,e], 0:1,n3,n3);\r\n Dd = kron(J,kron(I2,I1)); % Depth differences, sparse matrix\r\n case 'circular'\r\n e = ones(max([n1,n2,n3]),1);\r\n e2 = e;\r\n % e2(n2:end) = 0;\r\n J = spdiags([-e2,e], 0:1,n2,n2);\r\n J(end,1) = 1;\r\n Dh = kron(I3, kron(J,I1)); % horizontal differences, sparse matrix\r\n % see also blkdiag\r\n \r\n e2 = e;\r\n % e2(n1:end) = 0;\r\n J = spdiags([-e2,e], 0:1,n1,n1);\r\n J(end,1) = 1;\r\n Dv = kron(I3, kron(I2,J)); % vertical differences, sparse matrix\r\n \r\n e2 = e;\r\n % e2(n1:end) = 0;\r\n J = spdiags([-e2,e], 0:1,n3,n3);\r\n J(end,1) = 1;\r\n Dd = kron(J, kron(I2,I1)); % vertical differences, sparse matrix\r\n end\r\n if strcmpi(action,'matrix')\r\n op = [Dh;Dv;Dd];\r\n else\r\n % \"norms\" is a CVX function\r\n op = @(X) sum( norms( [Dh*X(:), Dv*X(:), Dd*X(:)]' ) );\r\n end\r\n return;\r\nend\r\n\r\nswitch lower(variation)\r\n case 'regular'\r\n Dh = @(X) vec( [diff(X,1,2), zeros(n1,1,n3)] );\r\n Dv = @(X) vec( [diff(X,1,1); zeros(1,n2,n3)] );\r\n Dd = @(X) [vec(diff(X,1,3)); vec(zeros(n1,n2,1))];\r\n \r\n diff_h = @(X) [zeros(n1,1,n3),X(:,1:end-1,:)] - ...\r\n [X(:,1:end-1,:),zeros(n1,1,n3)];\r\n diff_v = @(X) [zeros(1,n2,n3);X(1:end-1,:,:)] - ...\r\n [X(1:end-1,:,:);zeros(1,n2,n3)];\r\n diff_d = @(X) mat([vec(zeros(n1,n2,1));vec(X(:,:,1:end-1))] - ...\r\n [vec(X(:,:,1:end-1));vec(zeros(n1,n2,1))]);\r\n case 'circular'\r\n % For circular version, 2 x 2 case is special.\r\n % error('not yet implemented');\r\n Dh = @(X) vec( [diff(X,1,2), X(:,1,:) - X(:,end,:)] );\r\n Dv = @(X) vec( [diff(X,1,1); X(1,:,:) - X(end,:,:)] );\r\n Dd = @(X) [vec(diff(X,1,3)); vec(X(:,:,1) - X(:,:,end))];\r\n % diff_h needs to be checked\r\n diff_h = @(X) [X(:,end,:),X(:,1:end-1,:)] - X;\r\n % diff_v needs to be checked\r\n diff_v = @(X) [X(end,:,:);X(1:end-1,:,:)] - X;\r\n % diff_d needs to be checked\r\n diff_d = @(X) mat([vec(X(:,:,end));vec(X(:,:,1:end-1))]) - X;\r\n otherwise\r\n error('Bad variation parameter');\r\nend\r\nif iscell(sz)\r\n Dh_transpose = @(X) diff_h(mat(X)) ;\r\n Dv_transpose = @(X) diff_v(mat(X)) ;\r\n Dd_transpose = @(X) diff_d(mat(X)) ;\r\nelse\r\n Dh_transpose = @(X) vec( diff_h(mat(X)) );\r\n Dv_transpose = @(X) vec( diff_v(mat(X)) );\r\n Dd_transpose = @(X) vec( diff_d(mat(X)) );\r\nend\r\n\r\n%% TV & TVt Definitions\r\nTV = @(x) [Dh(mat(x)); Dv(mat(x)); Dd(mat(x))];\r\n\r\nfirstThird = @(x) x(1: n1*n2*n3);\r\nsecondThird= @(x) x(n1*n2*n3+1: 2*n1*n2*n3);\r\nthirdThird= @(x) x(2*n1*n2*n3+1: 3*n1*n2*n3);\r\nTVt = @(z) ( Dh_transpose(firstThird(z)) +...\r\n Dv_transpose(secondThird(z)) +...\r\n Dd_transpose(thirdThird(z)));\r\n\r\n%%\r\nif CALCULATE_TV\r\n op = norm( TV(X), 1 );\r\n return;\r\nend\r\n\r\nif strcmpi(action,'norm')\r\n % to compute max eigenvalue, I use a vector\r\n % that is very likely to be the max eigenvector:\r\n % matrix with every entry alternating -1 and 1\r\n even = @(n) ~( n - 2*round(n/2) ); % returns 1 if even, 0 if odd\r\n Y = zeros( n1 + even(n1), n2 + even(n2), n3 + even(n3) );\r\n nn = numel(Y);\r\n Y(:) = (-1).^(1:nn);\r\n Y = Y(1:n1,1:n2,1:n3);\r\n op = norm( TV(Y) )/norm(Y(:));\r\n \r\n % Nearly equivalent to:\r\n % norm(full( [real(tv); imag(tv)] ) )\r\n % where tv is the matrix form\r\nelse\r\n if iscell(sz)\r\n szW = { [n1,n2,n3], [n1*n2*n3,1] };\r\n else\r\n szW = prod(sz); % n1 * n2\r\n szW = [nDim*szW, nDim*szW];\r\n end\r\n op = @(x,mode)linop_tv_r2c(szW,TV,TVt,x,mode);\r\nend\r\n\r\nfunction y = linop_tv_r2c( sz, TV, TVt, x, mode )\r\nswitch mode,\r\n case 0, y = sz;\r\n case 1, y = TV( realcheck( x ) );\r\n case 2, y = realcheck( TVt( x ) );\r\nend\r\n\r\nfunction y = realcheck( y )\r\nif ~isreal( y ),\r\n error( 'Unexpected complex value in linear operation.' );\r\nend\r\n\r\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\r\n% Copyright 2013 California Institute of Technology and CVX Research.\r\n% See the file LICENSE for full license information.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/linop_adjoint.m", "content": "function op = linop_adjoint( A )\n%LINOP_ADJOINT Computes the adjoint operator of a TFOCS linear operator\n%op = LINOP_ADJOINT( A )\n% Returns a function handle to a linear operator that is the adjoint of\n% the operator supplied.\n\nop = @(y,mode)linop_adjoint_impl( A, y, mode );\n\nfunction y = linop_adjoint_impl( A, x, mode )\nswitch mode,\n case 0,\n y = A(x,0);\n y([1,2]) = y([2,1]);\n case 1,\n y = A(x,2);\n case 2,\n y = A(x,1);\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/linop_compose.m", "content": "function op = linop_compose( varargin )\n%LINOP_COMPOSE Composes two TFOCS linear operators\n%OP = LINOP_COMPOSE( OP1, OP2, ..., OPN )\n% Constructs a TFOCS-compatible linear operator from the composition of\n% two or more linear operators and/or matrices. That is,\n% OP(x,1) = OP1(OP2(...(OPN(x,1),...,1),1)\n% OP(x,2) = OPN(...(OP2(OP1(x,2),2)...,2)\n% If matrices are supplied, they must be real; to include complex\n% matrices, convert them first to linear operators using LINOP_MATRIX.\n\nif nargin == 0,\n error( 'Not enough input arguments.' );\nend\nsz = { [], [] };\nfor k = 1 : nargin,\n tL = varargin{k};\n if isempty(tL) || ~isa(tL,'function_handle') && ~isnumeric(tL) || ndims(tL) > 2,\n error( 'Arguments must be linear operators, scalars, or matrices.' );\n elseif isnumeric(tL),\n if ~isreal(tL),\n error( 'S or scalar arguments must be real.' );\n elseif numel(tL) == 1,\n tL = linop_scale( tL );\n else\n tL = linop_matrix( tL );\n end\n varargin{k} = tL;\n end\n try\n tsz = tL([],0);\n catch\n error( 'Arguments must be linear operators, scalars, or matrices.' );\n end\n if isempty(tsz) % i.e. output of linop_identity is []\n tsz = { [], [] };\n end\n if isnumeric(tsz),\n tsz = { [tsz(2),1], [tsz(1),1] };\n end\n \n % convert [n1;n2] to [n1,n2] if necessary:\n for kk = 1:2\n %if iscolumn( tsz{kk} )\n %tsz{kk} = tsz{kk}.';\n %end\n tsz{kk} = tsz{kk}(:).';\n end\n \n if ~isempty(sz{1}) && ~isempty(tsz{2}) && ~isequal(tsz{2},sz{1}),\n for kk = 1:min( numel(tsz{2}), numel( sz{1} ) )\n fprintf('Found incompatible sizes: %d ~= %d\\n', tsz{2}(kk), sz{1}(kk) );\n end\n error( 'Incompatible dimensions in linear operator composition.' );\n end\n if ~isempty(tsz{1}),\n sz{1} = tsz{1};\n end\n if isempty(sz{2}),\n sz{2} = tsz{2};\n end\nend\n% Explanation of above code:\n% suppose have three inputs, opA, opB, opC; with sizes szA, szB, szC\n% where opA: szA{1} --> szA{2}\n% so we need szC{2} == szB{1} and szB{2} = szA{1}\n%\n% so sz{2} = szA{2}\n% and sz{1} = szC{1}\n\nif nargin == 1,\n op = varargin{1};\nelse\n op = @(x,mode)linop_compose_impl( varargin, sz, x, mode );\nend\n\nfunction y = linop_compose_impl( ops, sz, y, mode )\nswitch mode,\n case 0,\n y = sz;\n case 1,\n for k = numel(ops) : -1 : 1,\n y = ops{k}( y, 1 );\n end\n case 2,\n for k = 1 : numel(ops),\n y = ops{k}( y, 2 );\n end\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/linop_dot.m", "content": "function op = linop_dot( A, adj )\n%LINOP_DOT Linear operator formed from a dot product.\n% OP = LINOP_DOT( A ) returns a handle to a TFOCS linear operator \n% whose forward operation is OP(X) = TFOCS_DOT( A, X ).\n% OP = LINOP_DOT( A, 1 ) returns the adjoint of that operator.\n\nswitch class( A ),\n case 'double',\n sz = { size(A), [1,1] };\n case 'cell',\n A = tfocs_tuple(A);\n sz = { tfocs_size(A), [1,1] };\n case 'tfocs_tuple',\n sz = { tfocs_size(A), [1,1] };\n otherwise,\n error( 'First input must be a matrix or cell array of matrices.' );\nend\nif nargin == 2 && adj,\n sz = { sz{2}, sz{1} };\n op = @(x,mode)linop_dot_adjoint( sz, A, x, mode ); \nelse\n op = @(x,mode)linop_dot_forward( sz, A, x, mode ); \nend\n\nfunction y = linop_dot_forward( sz, A, x, mode )\nswitch mode,\n case 0, \n y = sz;\n case 1, \n y = tfocs_dot( A, x );\n case 2, \n if ~isreal(x), error( 'Unexpected complex input.' ); end\n y = A * x;\nend\n\nfunction y = linop_dot_adjoint( sz, A, x, mode )\nswitch mode,\n case 0, \n y = sz;\n case 1, \n if ~isreal(x), error( 'Unexpected complex input.' ); end\n y = A * x;\n case 2, \n y = tfocs_dot( A, x );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/linop_explicit.m", "content": "function A = linop_explicit( op )\n%LINOP_EXPLICIT Outputs the explicit matrix representation\n% of a (implicitly defined) linear operator.\n% Useful for checking correctness of code.\n% A = LINOP_EXPLICIT( OP ) \n% returns the matrix A such that A*X = OP(X)\n\n% Introduced June 2016\n\nif nargin == 0,\n error( 'Not enough input arguments.' );\nend\nsz = op([],0);\nif isnumeric(sz),\n sz = { [sz(2),1], [sz(1),1] };\nend\n% convert [n1;n2] to [n1,n2] if necessary:\nfor kk = 1:2\n sz{kk} = sz{kk}(:).';\nend\n% If inputs and outputs are not vectors, then we cannot represent\n% with matrix multiplication\nif sz{1}(2) ~= 1 || sz{2}(2) ~= 1\n error('Cannot represent this operator as matrix since input/output is not a vector');\nend\nm = sz{2}(1);\nn = sz{1}(1);\ne = zeros(n,1);\nA = zeros(m,n);\nfor i = 1:n\n e(i) = 1;\n A(:,i) = op( e, 1 );\n e(i) = 0;\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/linop_fft.m", "content": "function op = linop_fft( N, bigN, cmode, width )\n%LINOP_FFT Fast Fourier transform linear operator.\n% OP = LINOP_FFT( N )\n% returns a function handle that computes the 1D FFT. \n% If given a matrix, it operates on each column separately (i.e. it \n% does NOT automatically switch to a 2D FFT).\n%\n% By default, it assumes the input the FFT is real, and the output\n% is therefore complex and conjugate-symmetric\n%\n% OP = LINOP_FFT( N, M )\n% will zero-pad the input so that it is size M. Currently, the code\n% requires M > N, which is typical in applications.\n% The forward linear operator takes a vector of dimension N and returns a\n% vector of dimension M; the adjoint takes a M-vector and returns a N-vector.\n% By default, M = N.\n%\n% OP = LINOP_FFT( N, M, CMODE )\n% specifies the complex mode of the linear operator. The choices are:\n% 'r2c' (default) : real input and complex (conjugate-symmetric) output\n% 'c2c' : complex input and outpuyt\n% 'r2r' : real input and real output. The real output\n% retains the same number of degrees of freedom because it exploits\n% the redudancy in the conjugate-symmetry of the complex output of the fft.\n%\n% OP = LINOP_FFT( N, M, CMODE, WIDTH )\n% specifies that the domain is the space of N x WIDTH matrices\n% (and the range is M x WIDTH ).\n%\n% new in TFOCS v1.3\n\n% Wed, Jan 4 2011\n\nerror(nargchk(1,4,nargin));\n\n% the naming convention \"bigN\" refers to the fact that we usually\n% will pad the input with zeros to take an oversampled FFT.\n% In this case, \"bigN\" is the size of the zero-padded input,\n% and hence also the size of the output.\nif nargin < 2 || isempty(bigN), bigN = N; end\nif bigN < N, error('cannot yet handle bigN < N, but there is no inherent limitiation'); end\nif nargin < 3 || isempty(cmode), \n cmode = 'r2c';\n warning('TFOCS:FFTdefaultMode','In linop_fft, using default ''r2c'' mode for fft; this will take real-part of input only!');\nend\nif nargin < 4 || isempty(width), width = 1; end\nsz = { [N,width], [bigN,width] };\n\n% allow normalization to make it orthogonal? To do so, divide forward mode by sqrt(bigN)\n\nswitch lower(cmode)\n case 'c2c'\n op = @(x,mode)linop_fft_c2c( sz, N, bigN, x, mode );\n case 'r2c'\n op = @(x,mode)linop_fft_r2c( sz, N, bigN, x, mode );\n case 'r2r'\n n2 = bigN/2;\n even = (n2 == round(n2) ); % find if n is even or odd\n if ~even\n n2 = (bigN+1)/2;\n end\n op = @(x,mode)linop_fft_r2r( sz, N, bigN, n2, even, x, mode );\n otherwise\n error('bad input for cmode: must be \"c2c\", \"r2c\", or \"r2r\"');\nend\n\nfunction y = linop_fft_c2c(sz, N, bigN, x, mode)\nswitch mode,\n case 0, y = sz;\n case 1, y = fft(x,bigN); % input of size N. Norm is bigN\n case 2, \n y = bigN*ifft(x); % do NOT use ifft(x,N) because we want to truncate AFTER the ifft, not before\n y = y(1:N,:);\nend\n\nfunction y = linop_fft_r2c(sz, N, bigN, x, mode)\nswitch mode,\n case 0, y = sz;\n case 1, \n if ~isreal(x), \n x = real(x);\n% x = real(x+conj(x))/2; % another possibility\n end\n y = fft(x,bigN);\n case 2, \n y = bigN*ifft(x,'symmetric');\n y = y(1:N,:);\nend\n\n\nfunction y = linop_fft_r2r(sz, N, bigN, n2, even, x, mode)\nswitch mode,\n case 0, y = sz;\n case 1, \n error(sizeCheck( x, mode, sz ));\n if ~isreal(x), \n x = real(x);\n end\n z = fft(x,bigN); % output is of size bigN\n y = real(z);\n if even\n % y( (n2+2):bigN, : ) = imag( z( 2:n2, : ) ); % convention \"A\" (not orthogonal)\n y( (n2+2):bigN, : ) = -imag( z( n2:-1:2, : ) ); % convention \"B\" (orthogonal)\n y( n2+1, :) = y( n2+1, :)/sqrt(2);\n else\n % y( (n2+1):bigN, : ) = imag( z( 2:n2, : ) ); % convention \"A\"\n y( (n2+1):bigN, : ) = -imag( z( n2:-1:2, : ) );% convention \"B\"\n end\n y = sqrt(2)*y; % the sqrt(2) is so adjoint=inverse\n y(1,:) = y(1,:)/sqrt(2);\n case 2, \n error(sizeCheck( x, mode, sz ));\n assert( isreal(x) );\n y = complex(x); % reserve the memory for y\n n = bigN;\n if even\n % y(2:n2, : ) = x(2:n2, : ) + 1i*x((n2+2):n, : ); % convention \"A\"\n y(2:n2, : ) = ( x(2:n2, : ) - 1i*x(n:-1:(n2+2), : ) )/sqrt(2); % convention \"B\"\n \n % We can skip this (see the \"trick\" mentioned below)\n % y(n:-1:n2+2, : )= conj( y(2:n2,:) );\n else\n % y(2:n2, : ) = x(2:n2, : ) + 1i*x((n2+1):n, : ); % convention \"A\"\n y(2:n2, : ) = ( x(2:n2, : ) - 1i*x(n:-1:(n2+1), : ) )/sqrt(2); % convention \"B\"\n \n % We can skip this (see the \"trick\" mentioned below)\n % y(n:-1:n2+1, : )= conj( y(2:n2, :) );\n end\n % Note: we are using a trick. We have commented out\n % the lines that set y(n2+2:n) (or n2+1:n), because\n % the ifft, when using the 'symmetric' option,\n % will not look at these entries.\n \n y = bigN*ifft(y,'symmetric');\n y = y(1:N,:);\nend\n\nfunction ok = sizeCheck( x, mode, sz )\nszX = size(x);\nszY = sz{mode};\nif numel(szX) == numel(sz{1}) && all( szX == szY )\n ok = [];\nelse\n ok = 'Dimensions mismatch in linop_fft; please check your input size. ';\n if numel(szX) == 2\n if szX(1) == szY(2) && szX(2) == szY(1)\n ok = strcat(ok,' Looks like you have a row vector instead of a column vector');\n end\n end\nend\n\n%{\nThe conjugate-to-real transformation as a matrix.\n(we design this for conjugate-symmetry, but you must make sure\n that it still does the same operations when the input\n is not conjugate-symmetric)\n\nn = 10;\neven = n/2 == round(n/2)\nP = zeros(n);\nP(1,1) = 1; % DC component\nif even, d = n/2 - 1; \nP(d+2,d+2) = 1; % Nyquist component\nelse, d = (n-1)/2; end\n\nI = eye(d)/sqrt(2);\nJ = fliplr(I);\n\nfirst=2:d+1;\nif even, second=d+3:n; else, second=d+2:n; end\n\n% Convention \"A\"\nP(first, first) = I; % upper left block\nP(second,first) = -1i*I; % lower left block\n\nP(first, second) = J; % upper right block\nP(second,second) = 1i*J; % lower right block\n\n% or... this makes P' = inv(P). Convention \"B\"\n\nP(first, first) = I; % upper left block\nP(second,first) = 1i*J; % lower left block. now, J, not I\n\nP(first, second) = J; % upper right block\nP(second,second) = -1i*I; % lower right block. now, I, not J\n%}\n\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license informatio\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/linop_handles.m", "content": "function op = linop_handles( sz, Af, At, cmode )\n%LINOP_HANDLES Linear operator from user-supplied function handles.\n%OP = LINOP_HANDLES( SZ, AF, AT, CMODE )\n% Constructs a TFOCS-compatible linear operator from separate function\n% handles that compute the forward and adjoint operations. The first\n% argument, SZ, gives the size of the linear operator; and the forward\n% and adjoint handles are AF and AT, respectively.\n% \n% If the inputs and outputs are simple vectors, then SZ can take the\n% standard Matlab form [M,N], where N is the input length and M is the\n% output length. If the input or output is a matrix or array, then SZ\n% should take the form { S_in, S_out }, where S_in is the size of the\n% input and S_out is the size of the output.\n%\n% If the input or output space of the operator is complex, then the\n% CMODE string must be supplied, which describes the forward operation:\n% 'R2R': real input and output\n% 'R2C': real input, complex output\n% 'C2R': complex input, real output\n% 'C2C': complex input, complex output\n% If CMODE is not supplied, then 'R2R' is assumed. If the operator\n% detects a complex input or output when it is not expected, then an\n% error results. Therefore, you must make sure that your operators \n% return real values when they are expected to do so.\n\nerror(nargchk(3,4,nargin));\nif numel( sz ) ~= 2,\n error( 'Size must have two elements.' );\nelseif isnumeric( sz ),\n sz = { [sz(2),1], [sz(1),1] };\nelseif ~isa( sz, 'cell' ),\n error( 'Invalid operator size specification.' );\nend\nif ~isa( Af, 'function_handle' ) || ~isa( At, 'function_handle' ),\n error( 'Second and third arguments must be function handles.' );\nend\nif nargin < 4 || isempty( cmode ),\n cmode = 'R2R';\nelseif ~ischar( cmode ) || size( cmode, 1 ) ~= 1,\n error( 'Fourth argument must be a string.' );\nelse\n cmode = upper( cmode );\nend\n\nswitch cmode,\n case 'R2R', op = @(x,mode)linop_handles_r2r( sz, Af, At, x, mode );\n case {'R2C','R2CC'}, op = @(x,mode)linop_handles_r2c( sz, Af, At, x, mode );\n case {'C2R','CC2R'}, op = @(x,mode)linop_handles_c2r( sz, Af, At, x, mode );\n case 'C2C', op = @(x,mode)linop_handles_c2c( sz, Af, At, x, mode );\n otherwise,\n error( 'Invalid complex mode: %s', cmode );\nend\n\nfunction y = linop_handles_r2r(sz, Af, At, x, mode )\nswitch mode,\n case 0, y = sz;\n case 1, y = realcheck( Af( realcheck( x ) ) );\n case 2, y = realcheck( At( realcheck( x ) ) );\nend\n\nfunction y = linop_handles_r2c(sz, Af, At, x, mode )\nswitch mode,\n case 0, y = sz;\n case 1, y = Af( realcheck( x ) );\n case 2, y = realcheck( At( x ) );\nend\n\nfunction y = linop_handles_c2r(sz, Af, At, x, mode )\nswitch mode,\n case 0, y = sz;\n case 1, y = realcheck( Af( x ) );\n case 2, y = At( realcheck( x ) );\nend\n\nfunction y = linop_handles_c2c(sz, Af, At, x, mode )\nswitch mode,\n case 0, y = sz;\n case 1, y = Af( x );\n case 2, y = At( x );\nend\n\nfunction y = realcheck( y )\nif ~isreal( y ), \n error( 'Unexpected complex value in linear operation.' );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/linop_horzcat.m", "content": "function op = linop_horzcat( varargin )\n%LINOP_HORZCAT Combines two or more TFOCS lienar operators\n%OP = LINOP_HORZCAT( OP1, OP2, ..., OPN )\n% Defines the linear operator\n% OP(x,1) = OP1(x1,1) + ... + OPN(xn,1)\n% which has adjoint\n% OP(x,2) = [OP1(x,2);\n% ...\n% OPN(x,2)];\n%\n% See also linop_vertcat.m\n\n% Introduced June 2016\n% Not sure how efficient this implementation is\n\nif nargin == 0,\n error( 'Not enough input arguments.' );\nend\nfor k = 1 : nargin,\n varargin{k} = linop_adjoint( varargin{k} );\nend\nop = linop_adjoint( linop_vertcat( varargin{:} ) );\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/linop_matrix.m", "content": "function op = linop_matrix( A, cmode, width )\n\n%LINOP_MATRIX Linear operator, assembled from a matrix.\n% If A is a real matrix, OP = LINOP_MATRIX( A ) returns a handle to a\n% TFOCS linear operator that uses that matrix to implement its size, \n% forward, and adjoint operations.\n%\n% If A is a complex matrix, OP = LINOP_MATRIX( A, MODE ) returns a\n% handle to a TFOCS linear operator that uses A to implement its size,\n% forward, and linear operator. MODE is a string that tells it how to\n% handle its complex inputs/outputs:\n% 'R2R': real input, real output (real matrices only)\n% 'R2C': real input, complex output\n% 'C2R': complex input, real output\n% 'C2C': complex input, complex output \n% If the operator detects complex input when it is not expecting it, it\n% will issue an error.\n%\n% OP = LINOP_MATRIX( A, MODE, WIDTH )\n% further specifies that A operates on matrices with WIDTH number\n% of columns (and output also has WIDTH columns). Default is 1.\n%\n% Typically, end users do not need to call this routine. You may supply\n% matrices directly to TFOCS, and it will call this as needed.\n\nif ~isnumeric( A ) || ndims( A ) > 2,\n error( 'First input must be a matrix.' );\nend\nif nargin < 3, width = 1; end\nif numel( A ) == 1,\n sz = { [], [] };\nelse\n sz = { [ size(A,2), width ], [ size(A,1), width ] };\nend\nif nargin < 2 || isempty( cmode ),\n if ~isreal( A ),\n error( 'A real/complex mode must be supplied for complex matrices.' );\n end\n cmode = 'R2R';\nelseif ~ischar( cmode ) || size( cmode, 1 ) ~= 1,\n error( 'Complex mode must be a string.' );\nelse\n cmode = upper(cmode);\nend\nswitch cmode,\n case 'R2R',\n if ~isreal( A ),\n error( 'An \"R2R\" operator requires a real matrix.' );\n end\n op = @(x,mode)linop_matrix_r2r( sz, A, x, mode );\n case 'R2C', op = @(x,mode)linop_matrix_r2c( sz, A, x, mode );\n case 'C2R', op = @(x,mode)linop_matrix_c2r( sz, A, x, mode );\n case 'C2C', op = @(x,mode)linop_matrix_c2c( sz, A, x, mode );\n otherwise,\n error( 'Unexpected complex mode string: %s', op );\nend\n\nfunction y = linop_matrix_r2r( sz, A, x, mode )\nswitch mode,\n case 0, y = sz;\n case 1, y = A * realcheck( x );\n case 2, y = A' * realcheck( x );\nend\n\nfunction y = linop_matrix_r2c( sz, A, x, mode )\nswitch mode,\n case 0, y = sz;\n case 1, y = A * realcheck( x );\n case 2, y = real( A' * x );\nend\n\nfunction y = linop_matrix_c2r( sz, A, x, mode )\nswitch mode,\n case 0, y = sz;\n case 1, y = real( A * x );\n case 2, y = A' * realcheck( x );\nend\n\nfunction y = linop_matrix_c2c( sz, A, x, mode )\nswitch mode,\n case 0, y = sz;\n case 1, y = A * x;\n case 2, y = A' * x;\nend\n\nfunction y = realcheck( y )\nif ~isreal( y ), \n error( 'Unexpected complex value in linear operation.' );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/linop_normest.m", "content": "function [ nxe, cnt ] = linop_normest( op, cmode, tol, maxiter )\n\n%LINOP_NORMEST Estimates the operator norm.\n% EST = LINOP_NORMEST( OP ) estimates the induced norm of the operator:\n% || OP || = max_{||x||<=1} ||OP(X)||\n% using a simple power method similar to the MATLAB NORMEST functon.\n%\n% When called with a single argument, LINOP_TEST begins with a real\n% initial vector. To test complex operators, use the two-argument\n% version LINOP_NORMEST( OP, cmode ), where:\n% cmode = 'R2R': real input, real output\n% cmode = 'R2C': real input, complex output\n% cmode = 'C2R': imag input, imag output\n% cmode = 'C2C': complex input, complex output\n%\n% LINOP_NORMEST( OP, CMODE, TOL, MAXITER ) stops the iteration when the\n% relative change in the estimate is less than TOL, or after MAXITER\n% iterations, whichever comes first.\n%\n% [ EST, CNT ] = LINOP_NORMEST( ... returns the estimate and the number\n% of iterations taken, respectively.\n\nif isnumeric( op ),\n op = linop_matrix( op, 'C2C' );\nelseif ~isa( op, 'function_handle' ),\n error( 'Argument must be a function handle or matrix.' );\nend\nx_real = true;\nif nargin >= 2 && ~isempty( cmode ),\n switch upper( cmode ),\n case { 'R2R', 'R2C' }, x_real = true;\n case { 'C2R', 'C2C' }, x_real = false;\n otherwise, error( 'Invalid cmode: %s', cmode );\n end\nend\nif nargin < 3 || isempty( tol ),\n tol = 1e-8;\nend\nif nargin < 4 || isempty( maxiter ),\n maxiter = 50;\nend\nsz = op([],0);\nif iscell( sz ),\n sz = sz{1};\nelseif ~isempty(sz)\n sz = [sz(2),1];\nelse\n % if the input is the identity, it may not have a size associated with it,\n % so current behavior is to try an arbitrary size:\n sz = [50,1];\nend\ncnt = 0;\nnxe = 0;\nwhile true,\n if nxe == 0,\n if x_real,\n xx = randn(sz);\n else\n xx = randn(sz) + 1j*randn(sz);\n end\n nxe = sqrt( tfocs_normsq( xx ) );\n end\n yy = op( xx / max( nxe, realmin ), 1 );\n nye = sqrt( tfocs_normsq( yy ) );\n xx = op( yy / max( nye, realmin ), 2 );\n nxe0 = nxe;\n nxe = sqrt( tfocs_normsq( xx ) );\n if abs( nxe - nxe0 ) < tol * max( nxe0, nxe ),\n break;\n end\n cnt = cnt + 1;\n if cnt >= maxiter,\n break;\n end\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/linop_reshape.m", "content": "function op = linop_reshape( sz_in, sz_out )\r\n\r\n%LINOP_RESHAPE Linear operator to perform reshaping of matrices.\r\n% op = linop_reshape( sz_in, sz_out ) creates a linear operator that\r\n% uses the matlab 'reshape' function to reshape between sz_in and sz_out.\r\n% Both sz_in and sz_out must be vectors with d elements (for dimension d).\r\n% Assumes the number of elements does not change.\r\n%\r\n%\r\n% Contributed by Graham Coleman, graham.coleman@upf.edu\r\n% See also linop_vec\r\nerror( nargchk(nargin,2,2));\r\nif ~isnumeric(sz_in) || ~isnumeric(sz_out)\r\n error('sz_in and sz_out must be arrays');\r\nelseif numel(sz_in) ~= numel(sz_out)\r\n error('sz_in and sz_out must have the same number of elements (usually 2)');\r\nelseif prod( sz_in(:) ) ~= prod( sz_out(:) )\r\n error('The number of elements cannot change from sz_in to sz_out');\r\nend\r\nsz_in = sz_in(:).';\r\nsz_out = sz_out(:).';\r\n \r\nop = @(x,mode) gkcop_reshape_impl( sz_in, sz_out, x, mode );\r\n\r\nfunction y = gkcop_reshape_impl( sz_in, sz_out, x, mode )\r\nswitch mode,\r\n case 0, y = { sz_in, sz_out };\r\n case 1, y = reshape( x, sz_out );\r\n case 2, y = reshape( x, sz_in );\r\nend\r\n\r\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\r\n% Copyright 2013 California Institute of Technology and CVX Research.\r\n% See the file LICENSE for full license information.\r\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/linop_scale.m", "content": "function op = linop_scale( scale, sz )\n\n%LINOP_SCALE Scaling linear operator.\n% OP = LINOP_SCALE( scale ) returns a handle to a TFOCS linear operator \n% whose forward and adjoint operators are OP(X) = scale * X.\n% \"scale\" must be a real scalar\n%\n% OP = LINOP_SCALE( scale, size ) gives the scaling operator\n% an explicit size. \"sz\" can be:\n% - the empty matrix \"[]\" (default), which means the size is not\n% yet defined; the TFOCS software will attempt to automatically\n% determine the size later.\n% - a vector [N1,N2] which implies the domain is the set of N1 x N2 matrices\n% ( it is also possible to use [N1,N2,N3,....], which\n% means the domain is a set of multi-dimensional arrays )\n% - a scalar N, which is equivalent to [N,1], i.e. the set of N x 1 vectors\n% Because this is simple scaling, the range will have the same size\n% as the domain.\n%\n% July 2016, allowing OP(X) = scale .* X as well\n%\n% See also linop_compose\n\nif ~isnumeric( scale ) %&& numel( scale ) ~= 1,\n error( 'Argument must be numeric.' );\nelseif ~isreal( scale ),\n error( 'Argument must be real.' );\nend\nif nargin < 2, sz = []; end\nif isempty(sz)\n szCell = { [], [] };\nelseif isnumeric(sz)\n if numel(sz) <= 1, sz = [sz, 1 ]; end\n % ensure that \"sz\" is a row vector\n sz = sz(:).';\n szCell = { sz, sz };\nelse\n error('bad type for size input');\nend\n\nif all(scale(:) == 1 ),\n op = @linop_identity;\nelse\n op = @(x,mode)linop_scale_impl( szCell, scale, x, mode );\nend\n\nfunction y = linop_scale_impl( sz, scale, y, mode )\nif mode == 0, \n y = sz;\nelse\n y = scale .* y;\nend\n\n% function OK = isSquare( sz )\n% OK = true;\n% for j = 1:length( sz{1} )\n% if sz{1}(j) ~= sz{2}(j)\n% OK = false; break;\n% end\n% end\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/linop_spot.m", "content": "function op = linop_spot( A, cmode )\n\n%LINOP_SPOT Linear operator, assembled from a SPOT operator.\n% If A is a real operator, OP = LINOP_SPOT( A ) returns a handle to a\n% TFOCS linear operator that uses that object to implement its size, \n% forward, and adjoint operations.\n%\n% If A is a complex operator, OP = LINOP_SPOT( A, MODE ) returns a\n% handle to a TFOCS linear operator that uses A to implement its size,\n% forward, and linear operator. MODE is a string that tells it how to\n% handle its complex inputs/outputs:\n% 'R2R': real input, real output (real matrices only)\n% 'R2C': real input, complex output\n% 'C2R': complex input, real output\n% 'C2C': complex input, complex output \n% If the operator detects complex input when it is not expecting it, it\n% will issue an error.\n\nif ~isa( A, 'opSpot' ),\n error( 'First input must be a SPOT operator.' );\nend\nsz = { [ size(A,2), 1 ], [ size(A,1), 1 ] };\nif nargin < 2 || isempty( cmode ),\n if ~isreal( A ),\n error( 'A real/complex mode must be supplied for complex matrices.' );\n end\n cmode = 'R2R';\nelseif ~ischar( cmode ) || size( cmode, 1 ) ~= 1,\n error( 'Complex mode must be a string.' );\nelse\n cmode = upper(cmode);\nend\nswitch cmode,\n case 'R2R',\n if ~isreal( A ),\n error( 'An \"R2R\" operator requires a real matrix.' );\n end\n op = @(x,mode)linop_matrix_r2r( sz, A, x, mode );\n case 'R2C', op = @(x,mode)linop_matrix_r2c( sz, A, x, mode );\n case 'C2R', op = @(x,mode)linop_matrix_c2r( sz, A, x, mode );\n case 'C2C', op = @(x,mode)linop_matrix_c2c( sz, A, x, mode );\n otherwise,\n error( 'Unexpected complex mode string: %s', op );\nend\n\nfunction y = linop_matrix_r2r( sz, A, x, mode )\nswitch mode,\n case 0, y = sz;\n case 1, y = A * realcheck( x );\n case 2, y = A' * realcheck( x );\nend\n\nfunction y = linop_matrix_r2c( sz, A, x, mode )\nswitch mode,\n case 0, y = sz;\n case 1, y = A * realcheck( x );\n case 2, y = real( A' * x );\nend\n\nfunction y = linop_matrix_c2r( sz, A, x, mode )\nswitch mode,\n case 0, y = sz;\n case 1, y = real( A * x );\n case 2, y = A' * realcheck( x );\nend\n\nfunction y = linop_matrix_c2c( sz, A, x, mode )\nswitch mode,\n case 0, y = sz;\n case 1, y = A * x;\n case 2, y = A' * x;\nend\n\nfunction y = realcheck( y )\nif ~isreal( y ), \n error( 'Unexpected complex value in linear operation.' );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/linop_subsample.m", "content": "function op = linop_subsample( sz, omega, SYMMETRIC )\n%LINOP_SUBSAMPLE Subsampling linear operator.\n%OP = LINOP_SUBSAMPLE( SZ, OMEGA )\n% vector and matrix subsampling. Depending on SZ and OMEGA,\n% this can do row-sampling (e.g. a partial FFT)\n% or it can sample specific entries of a matrix (e.g. matrix completion)\n% To specify matrix subsampling, set sz = { [n1,n2], [length(omega),1] }\n% where the input matrix has size n1 x n2\n%\n%OP = LINOP_SUBSAMPLE( OMEGA )\n% works if OMEGA is a sparse matrix, whose nonzero entries\n% specify the entries to sample.\n%\n%OP = LINOP_SUBSAMPLE( ..., SYMMETRIC )\n% If SYMMETRIC is true, then\n% forces the domain to be the space of symmetric matrices\n%\n% Example with FFT:\n% FFT = linop_handles([N,N], @(x)fft(x)/sqrt(N), @(x)sqrt(N)*real(ifft(x)) ,'R2C');\n% and to make a row sub-sampled FFT (M <= N):\n% rows = randperm(M);\n% A = linop_compose( linop_subsample([M,N], rows ), FFT );\n\n\n% Designed to be used with a fft or dct\n% Do we need a separate oversampling version?\n% Also, make linop_DCT and linop_FFT ?\n% The reason we might want this is that for linop_FFT,\n% people will probably use idct as the transpose -- this is not \n% correct, due to scaling\n\n% Help documentation: TBD\n% Constructs a TFOCS-compatible linear operator from separate function\n% handles that compute the forward and adjoint operations. The first\n% argument, SZ, gives the size of the linear operator; and the forward\n% and adjoint handles are AF and AT, respectively.\n% \n% If the inputs and outputs are simple vectors, then SZ can take the\n% standard Matlab form [N,M], where N is the input length and M is the\n% output length. If the input or output is a matrix or array, then SZ\n% should take the form { S_in, S_out }, where S_in is the size of the\n% input and S_out is the size of the output.\n%\n\nerror(nargchk(1,3,nargin));\nif nargin < 3\n SYMMETRIC = false;\nend\nif nargin == 1\n omega = sz;\n sz = { size(omega), [nnz(omega),1] };\nelseif nargin ==2 && issparse(sz)\n SYMMETRIC = omega;\n omega = sz;\n sz = { size(omega), [nnz(omega),1] };\nend\n\nif numel( sz ) ~= 2,\n error( 'Size must have two elements.' );\nelseif isnumeric( sz ),\n sz = { [sz(2),1], [sz(1),1] };\nelseif ~isa( sz, 'cell' ),\n error( 'Invalid operator size specification.' );\nend\n\ndom = sz{1};\nn1 = dom(1); n2 = dom(2);\nran = sz{2};\n\n% There are several possibilities. Let x be a point in the domain\n%{\n x is a vector. Then omega should be a vector.\n We return x(omega), resp.\n\n x is a matrix.\n omega is a vector\n This is ambiguous: does the user want x(omega,:) or x(omega)?\n omega is a matrix with 2 columns, then assume it is [I,J]\n We convert it to linear indices.\n omega is a general matrix, more than 2 columns\n Not sure what the user means; report an error.\n omega is a sparse matrix\n We find it's entries, and use those\n\n%}\n\nif n2 == 1\n % x is a vector, not a matrix. Simple.\n% op = @(x,mode) linop_subsample_vector( sz, omega, x, mode );\n % Allow it to vectorize along rows:\n op = @(x,mode) linop_subsample_row( sz, omega, x, mode );\nelse\n % trickier case.\n if issparse(omega)\n ind = find(omega);\n [I,J] = ind2sub( sz{1}, ind );\n% op = @(x,mode) linop_subsample_matrix( sz, ind, I, J, SYMMETRIC, x, mode );\n elseif isvector(omega)\n ind = omega;\n [I,J] = ind2sub( sz{1}, ind );\n% op = @(x,mode) linop_subsample_matrix( sz, omega, SYMMETRIC,x, mode );\n elseif size(omega,2) == 2\n ind = sub2ind( sz{1}, omega(:,1), omega(:,2) );\n I = omega(:,1);\n J = omega(:,2);\n% op = @(x,mode) linop_subsample_matrix( sz, ind, SYMMETRIC,x, mode );\n else\n error('omega is not an acceptable size; perhaps you meant it to be sparse?');\n end\n % Make sure 'ind' is a column vector\n ind = ind(:);\n op = @(x,mode) linop_subsample_matrix( sz, ind, I, J, SYMMETRIC, x, mode );\n \nend\n\n\nfunction y = linop_subsample_vector(sz, omega, x, mode )\nswitch mode,\n case 0, y = sz;\n case 1, \n if ~isequal( sz{1}, size(x) ), error('input wrong size for vector subsampling'); end\n y = x(omega);\n case 2, \n y = zeros( sz{1} );\n y(omega) = x;\nend\nfunction y = linop_subsample_row(sz, omega, x, mode )\nswitch mode,\n case 0, y = sz;\n case 1, \n if ~isequal( sz{1}(1), size(x,1) ), error('input wrong size for vector subsampling'); end\n y = x(omega,:);\n case 2, \n y = zeros( sz{1} );\n y = zeros( sz{1}(1), size(x,2) );\n y(omega,:) = x;\nend\nfunction y = linop_subsample_matrix(sz, omega, indI, indJ,SYMMETRIC, x, mode )\nswitch mode,\n case 0, y = sz;\n case 1\n S = [];\n S.type = '()';\n S.subs = {omega};\n y = subsref(x,S);\n case 2, \n dom = sz{1}; n1 = dom(1); n2 = dom(2);\n y = sparse( indI, indJ, x, n1, n2 );\n if SYMMETRIC\n % in future, might update this\n % e.g. force omega to only refer to lower part of matrx,\n % and then do the update y = y + tril(y,-1)'\n y = (y+y')/2;\n end\nend\n\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/linop_test.m", "content": "function varargout = linop_test( op, cmode, maxits )\n\n%LINOP_TEST Performs an adjoint test on a linear operator.\n% LINOP_TEST( OP ) attempts to verify that a linear operator OP obeys\n% the inner product test: = for all x, y. OP must be a\n% TFOCS linear operator with hard-coded size information; that is,\n% OP([],0) must return valid size info.\n%\n% When called with a single argument, LINOP_TEST creates real test\n% vectors for X and Y. To test complex operators, use the two-argument\n% version LINOP_TEST( OP, cmode ), where:\n% cmode = 'R2R': real input, real output\n% cmode = 'R2C': real input, complex output\n% cmode = 'R2CC': real input, conjugate-symmetric complex output\n% cmode = 'C2R': complex input, real output\n% cmode = 'CC2R': conjugate-symmetric complex input, real output\n% cmode = 'C2C': complex input, complex output\n%\n% The conjugate-symmetric options follow the symmetry conventions of Matlab's FFT.\n%\n% LINOP_TEST( OP, CMODE, MAXITS ) performs MAXITS iterations of the\n% test loop. MAXITS=25 is the default.\n%\n% myNorm = LINOP_TEST(...) returns an estimate of the myNorm of\n% the linear operator.\n\nerror(nargchk(1,3,nargin));\nif isnumeric( op ),\n if nargin < 2 || isempty( cmode )\n disp('warning: for matrix inputs, this assumes the cmode is ''C2C'' unless you specify otherwise');\n cmode = 'C2C'; \n end\n op = linop_matrix( op, cmode );\nend\ny_conjSymmetric = false;\nx_conjSymmetric = false;\nif nargin < 2 || isempty( cmode ),\n x_real = true;\n y_real = true;\nelse\n switch upper( cmode ),\n case 'R2R', x_real = true; y_real = true;\n case 'R2C', x_real = true; y_real = false;\n case 'R2CC', x_real = true; y_real = false; y_conjSymmetric = true;\n case 'C2R', x_real = false; y_real = true;\n case 'CC2R', x_real = false; y_real = true; x_conjSymmetric = true;\n case 'C2C', x_real = false; y_real = false;\n case 'CC2CC', x_real = false; y_real = false; \n x_conjSymmetric = true;\n y_conjSymmetric = true; % this is probably never going to happen though\n otherwise, error( 'Invalid cmode: %s', cmode );\n end\nend\nif nargin < 3 || isempty(maxits),\n maxits = 25;\nend\nsz = op([],0);\nif ~iscell(sz)\n sz = { [sz(2),1], [sz(1),1] };\nelseif isempty(sz{1})\n disp('warning: could not detect the size; this often happens when using a scalar input, which represents scaling');\n if isempty( sz{2} )\n disp(' Proceeding under the assumption that the domain is 1D');\n sz{1} = [1,1];\n sz{2} = [1,1];\n else\n disp(' Proceeding under the assumption that the domain equals the range');\n sz{1} = sz{2};\n end\nelseif isempty(sz{2})\n disp('warning: could not detect the size; this often happens when using a scalar input, which represents scaling');\n disp(' Proceeding under the assumption that the domain equals the range');\n sz{2} = sz{1};\nend\nnf = 0;\nna = 0; \nerrs = zeros(1,maxits+1);\nnxe = 0; nye = 0;\nfor k = 1 : maxits,\n \n %\n % The adjoint test\n %\n \n if x_real,\n x = randn(sz{1});\n else\n x = randn(sz{1})+1j*randn(sz{1});\n if x_conjSymmetric\n x = make_conj_symmetrix( x );\n end\n end\n \n if y_real,\n y = randn(sz{2});\n else\n y = randn(sz{2})+1j*randn(sz{2});\n if y_conjSymmetric\n y = make_conj_symmetrix( y );\n end\n end\n \n nx = myNorm(x);\n Ax = op(x,1);\n nf = max( nf, myNorm(Ax)/nx );\n Ax_y = tfocs_dot( Ax, y ); \n \n ny = myNorm(y);\n Ay = op(y,2);\n na = max( na, myNorm(Ay) / ny );\n Ay_x = tfocs_dot( x, Ay ); \n \n errs(k) = abs(Ax_y-Ay_x)/(nx*ny);\n \n %\n % The myNorm iteration\n %\n \n if nxe == 0,\n if x_real,\n xx = randn(sz{1});\n else\n xx = randn(sz{1}) + 1j*randn(sz{1});\n if x_conjSymmetric\n xx = make_conj_symmetrix( xx );\n end\n end\n nxe = myNorm(xx);\n end\n yy = op(xx/nxe,1);\n nye = max(realmin,myNorm(yy));\n xx = op(yy/nye,2);\n nxe = myNorm(xx);\n \nend\n\n%\n% Use the estimated singular vectors for a final adjoint est\n%\n\nif nxe > 0,\n Ax_y = tfocs_dot( op(xx,1), yy );\n Ay_x = tfocs_dot( op(yy,2), xx );\n errs(end) = abs(Ax_y-Ay_x) / (nxe*nye);\nend\n\n%\n% Display the output\n% \n\nnmax = max(nye,nxe);\nmyNorm_err = abs(nye-nxe) / nmax;\npeak_err = max(errs) / nmax;\nmean_err = mean(errs) / nmax;\nrc = { 'complex', 'real', 'complex symmetric' };\nfprintf( 'TFOCS linear operator test:\\n' );\nfprintf( ' Input size: [' ); fprintf( ' %d', sz{1} ); fprintf( ' ], %s\\n', rc{x_real+1+2*x_conjSymmetric} );\nfprintf( ' Output size: [' ); fprintf( ' %d', sz{2} ); fprintf( ' ], %s\\n', rc{y_real+1+2*y_conjSymmetric} );\nfprintf( 'After %d iterations:\\n', maxits );\nfprintf( ' myNorm estimates (forward/adjoint/error): %g/%g/%g\\n', nye, nxe, myNorm_err );\nfprintf( ' Gains: forward %g, adjoint %g\\n', nf, na );\nfprintf( ' Inner product error:\\n' );\nfprintf( ' Mean (absolute/relative): %g/%g\\n', mean(errs), mean_err );\nfprintf( ' Peak (absolute/relative): %g/%g\\n', max(errs), peak_err );\nfprintf( ' (inner product errors should 1e-10 or smaller)\\n');\n\ngood = true;\nif myNorm_err/max( nye, nxe ) > 1e-4\n fprintf(' Detected mismatch in forward/adjoint norm estimates. This is potentially a bad sign. Check your implementation\\n');\n good = false;\nend\nif mean_err > 1e-8\n fprintf(' The mean error (relative) is high. This is a bad sign. Check your implementation\\n');\n good = false;\nend\nif good\n fprintf(' Allowing for some roundoff error, there are no obvious errors. This is good.\\n');\nend\n\nif nargout > 0\n varargout{1} = mean([nye,nxe]);\nend\n\n\n% Improvement as suggested by Graham Coleman\n% Allows for 3D arrays.\n% This also changes default behavior of 2D arrays\n% to now use the Frobenius norm instead of spectral norm.\n% This is wise, since it's a much quicker computation.\nfunction y = myNorm(x)\ny = norm( x(:) );\n\nfunction y = make_conj_symmetrix( y )\nny = size( y, 1 );\ny(1,:) = real(y(1,:)); % DC component is 0\nif round(ny/2) == ny/2 % even\n y(ny/2+1,:) = real(y(ny/2+1,:)); % Nyquist component is 0\n y( ny:-1:(ny/2+2) ) = conj( y(2:ny/2) );\nelse % odd\n y( ny:-1:((ny+1)/2+1) ) = conj( y(2:((ny+1)/2)) );\nend\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/linop_vec.m", "content": "function op = linop_vec( sz )\n%LINOP_VEC Matrix to vector reshape operator\n%OP = LINOP_VEC( SZ )\n% Constructs a TFOCS-compatible linear operator that reduces a matrix\n% variable to a vector version using column-major order.\n% This is equivalent to X(:)\n% The transpose operator will reshape a vector into a matrix.\n%\n% The input SZ should of the form [M,N] where [M,N] describe the\n% size of the matrix variable. The ouput vector will be of \n% length M*N. If SZ is a single entry, then M = N is assumed.\n% For advanced usage with multidimensional arrays,\n% use the more general linop_reshape function instead.\n%\n% To do the reverse operation (from vector to matrix),\n% use this function together with linop_adjoint.\n%\n% See also linop_reshape\n\nif numel(sz) > 2, error('must supply a 2-entry vector'); end\nif numel(sz) == 1, sz = [sz(1),sz(1)]; end\n\n% Switch conventions of the size variable:\nsz = { [sz(1),sz(2)], [sz(1)*sz(2),1] };\n \nop = @(x,mode)linop_handles_vec( sz, x, mode );\n\nfunction y = linop_handles_vec(sz, x, mode )\nswitch mode,\n case 0, y = sz;\n case 1, y = x(:);\n case 2, \n MN = sz{1}; M = MN(1); N = MN(2);\n y = reshape( x, M, N );\n \nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/linop_vertcat.m", "content": "function op = linop_vertcat( varargin )\n%LINOP_VERTCAT Combines two or more TFOCS lienar operators\n%OP = LINOP_VERTCAT( OP1, OP2, ..., OPN )\n% Defines the linear operator\n% OP(x,1) = [OP1(x,1);\n% ...\n% OPN(x,1)];\n% which has adjoint\n% OP(x,2) = OP1(x1,2) + ... + OPN(xn,2)\n%\n\n% Introduced June 2016\n\nif nargin == 0,\n error( 'Not enough input arguments.' );\nend\nsz = { [], [] };\nsz_x = [];\nfor k = 1 : nargin,\n tL = varargin{k}; % current linear operator\n if isempty(tL) || ~isa(tL,'function_handle') && ~isnumeric(tL) || ndims(tL) > 2,\n error( 'Arguments must be linear operators, scalars, or matrices.' );\n elseif isnumeric(tL),\n if ~isreal(tL),\n error( 'S or scalar arguments must be real.' );\n elseif numel(tL) == 1,\n tL = linop_scale( tL );\n else\n tL = linop_matrix( tL );\n end\n varargin{k} = tL;\n end\n try\n tsz = tL([],0);\n catch\n error( 'Arguments must be linear operators, scalars, or matrices.' );\n end\n if isempty(tsz) % i.e. output of linop_identity is []\n tsz = { [], [] };\n end\n if isnumeric(tsz),\n tsz = { [tsz(2),1], [tsz(1),1] };\n end\n \n % convert [n1;n2] to [n1,n2] if necessary:\n for kk = 1:2\n %if iscolumn( tsz{kk} )\n %tsz{kk} = tsz{kk}.';\n %end\n tsz{kk} = tsz{kk}(:).';\n end\n \n if isempty(tsz{1}),\n error('For now, each operator must have an explicit output size');\n end\n if isempty(sz{1})\n sz{1} = tsz{1};\n else\n % all operators work on the same dimension input\n if ~isequal( tsz{1}, sz{1} )\n error('All operators must have the same size input');\n end\n end\n if isempty(sz{2}),\n sz{2} = tsz{2};\n sz_x(1) = tsz{2}(1);\n else\n % check that others are compatible with # of columns:\n if numel( sz{2} ) ~= numel( tsz{2} ) || ~isequal( tsz{2}(2:end), sz{2}(2:end) )\n error('All operators must have outputs with equal number of columns');\n end\n sz{2}(1) = sz{2}(1) + tsz{2}(1); % increment first dimension only\n sz_x = [sz_x, tsz{2}(1)];\n end\nend\n% Explanation of above code:\n% suppose have three inputs, opA, opB, opC; with sizes szA, szB, szC\n% where opA: szA{1} --> szA{2}\n% then we need sz_{1} to be the same no matter what!\n% Furthermore, output sizes should have same # of columns\n% (preferably a single column, since least chance for errors)\n\n\n\nif nargin == 1,\n op = varargin{1};\nelse\n op = @(x,mode)linop_horzcat_impl( varargin, sz, sz_x, x, mode );\nend\n\nfunction y = linop_horzcat_impl( ops, sz,sz_x, x, mode )\nswitch mode,\n case 0,\n y = sz;\n case 1,\n y = [];\n for k = 1:numel(ops)\n y = vertcat( y, ops{k}( x, 1 ) );\n end\n case 2,\n % Need to split input up\n cs = cumsum(sz_x);\n y = ops{1}( x(1:cs(1)), 2 );\n for k = 2 : numel(ops),\n y = y + ops{k}( x( (cs(k-1)+1):cs(k) ), 2 );\n end\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/proj_0.m", "content": "function op = proj_0(offset,A,algo,R)\n%PROJ_0 Projection onto the set {0}\n% OP = PROJ_0 returns an implementation of the indicator \n% function for the set including only zero.\n%\n% OP = PROJ_0( c ) returns an implementation of the\n% indicator function of the set {c}\n% If c is a scalar, this is interpreted as c*1\n% where \"1\" is the all ones object of the appropriate size.\n%\n% OP = PROJ_0( c , A) returns an implementation of the\n% indicator function of the set {x : Ax = c}\n% where A is a matrix. Unlike the previous call, c must now\n% be a vector of appropriate size, and x must be a matrix\n% (no support for multi-dimensional arrays).\n% Note:\n% This requires computing the Cholesky decomposition of A\n% which can be expensive. For large dimensions, consider\n% using TFOCS_SCD.m and explicitly passing in the linear\n% operator, which will recast the optimization problem to avoid\n% requiring this function. For small problems, directly\n% calling this function is fine and may lead to faster convergence.\n%\n% If A is diagonal, then we can exploit that, but we don't \n% currently have it implemented. Instead, just rescale c\n% since if A=di\\ag(d) then { x : Ax=c } = { x : x = c./d }\n%\n% \"A\" must be an explicit matrix, not a function handle\n%\n% OP = PROJ_0( c , A, algo)\n% lets the user select between two algorithms (algo=1 or =2)\n% Algo. 1 is a bit faster but more prone to numerical roundoff error\n% which could be significant if A is extremely ill-conditioned\n%\n% OP = PROJ_0( c , A, algo, R)\n% uses the pre-computed value R (if algo==1, R=chol(A*A'),\n% and if algo==2, [~,R] = qr(A',0); ).\n% This usage is useful if you have already computed R and want\n% to save time. For algo==1, you can also set\n% R=alpha to indicate that A*A' = alpha^2*Id\n%\n% Note: for the set { x : ||Ax-b|| <= eps } where eps > 0, see\n% proj_l2.m\n%\n% See also proj_l2.m, prox_0.m, proj_Rn.m and smooth_constant.m,\n% which are the Fenchel conjugates of this function.\n\nif nargin == 0\n op = @proj_0_impl;\nelseif nargin == 1\n op = @(varargin) proj_0_impl_q( offset, varargin{:} );\nelseif nargin >= 2 % added June 14 2014\n if norm(offset)==0\n error('offset term is 0, so solution is always 0. Are you sure this is what you want?');\n end\n \n % We have two different algorithms, same asymptoptic complexity\n % but Algo. 1 is faster in practice though less numerically robust\n % since it forms the matrix A*A' which has larger condition number\n % Algo. 2 is a bit more stable but a bit slower\n if nargin < 3 || isempty(algo), algo = 1; end\n if nargin < 4, R = []; end\n if isa(A,'function_handle')\n if algo ~= 1\n error('If \"A\" is a function handle, must use algo #1');\n end\n %sz = A([],0);\n % Now, build AAt using implicit2explicit\n if isempty(R)\n fprintf('Now computing explicit representation of A*A''. Please wait...');\n t1 = tic;\n AAt_fun = linop_compose( A, linop_adjoint(A) );\n AAt = implicit2explicit(AAt_fun);\n fprintf('... done (%.1f seconds)\\n', toc(t1));\n end\n else\n if size( A, 1 ) ~= size(offset,1)\n error('A must have as many rows as c');\n end\n if algo == 1 && isempty(R)\n AAt = A*A';\n end\n end\n if isempty(R)\n t2 = tic;\n if algo == 1\n fprintf('Now computing Cholesky factorization of A. Please wait...');\n R = chol(AAt);\n clear AAt\n elseif algo==2\n fprintf('Now computing QR decomposition of A^T. Please wait...');\n [~,R] = qr(A',0);\n else\n error('Bad value for \"algo\". Should be 1 or 2');\n end\n fprintf('... done (%.1f seconds)\\n', toc(t2));\n end\n op = @(varargin) proj_0_impl_qA( offset, A, R, algo, varargin{:} );\nend\n\nfunction [ v, x ] = proj_0_impl( x, t )\nv = 0;\nswitch nargin,\n\tcase 1,\n\t\tif nargout == 2,\n\t\t\terror( 'This function is not differentiable.' );\n elseif any( x(:) ),\n v = Inf;\n end\n\tcase 2,\n % \"t\" variable has no effect\n\t\tx = 0*x;\n\totherwise,\n\t\terror( 'Not enough arguments.' );\nend\nfunction [ v, x ] = proj_0_impl_q( c, x, t )\nv = 0;\nswitch nargin,\n\tcase 2,\n\t\tif nargout == 2,\n\t\t\terror( 'This function is not differentiable.' );\n end\n if isscalar(c) \n if any( x(:) - c )\n v = Inf;\n end\n elseif any( x(:) - c(:) ),\n v = Inf;\n end\n\tcase 3,\n % \"t\" variable has no effect\n if isscalar(c) && ~isscalar(x)\n x = c*ones( size(x) );\n else\n x = c;\n end\n\n\totherwise,\n\t\terror( 'Not enough arguments.' );\nend\n\nfunction [ v, x ] = proj_0_impl_qA( b, A, R, algo, x, t )\nv = 0;\nswitch nargin,\n case 5,\n if nargout == 2,\n error( 'This function is not differentiable.' );\n end\n if isa(A,'function_handle')\n if norm( A(x,1) - b )/norm(b) > 1e-10\n v = Inf;\n end\n else\n if norm( A*x - b )/norm(b) > 1e-10\n v = Inf;\n end\n end\n case 6,\n % \"t\" variable has no effect\n if algo==1\n if isnumeric(R)&&isscalar(R)\n AAtinv = @(x) x/(R^2 );\n else\n AAtinv = @(x) R\\( R'\\x );\n end\n if isa(A,'function_handle')\n x = x - A(AAtinv( A(x,1) - b ),2);\n else\n x = x - A'*AAtinv( A*x - b );\n end\n elseif algo==2\n bb = (R')\\b;\n AA = @(x) (R')\\(A*x); % this is now Q'\n AAt= @(x) A'*(R\\x);\n x = x - AAt( AA(x) - bb );\n end\n otherwise,\n error( 'Not enough arguments.' );\nend\n\n\nfunction A = implicit2explicit(Afun)\n%IMPLICIT2EXPLICIT takes linear function A(x) and builts corresponding matrix\n% makes an explicit matrix using the linear function\n% in the function handle \"Afun\", where the domain is R^n\n% and the range is in R^m\n% Usage: implicit2explicit(Afun)\n% where Afun is a TFOCS linear operator\n% \n% i.e., Afun([],0) returns \"sz\", \n% where \"sz\" follows the usual TFOCS size conventions\n% e.g., { [n1,n2], [m1,m2] } for a function \n% from n1 x n2 --> m1 x m2\n% and the shortcut convention \n% sz = [m,n] for the common case when\n% n1 = n and n2 = 1, and m1=m and m2=1\n%\n% Stephen Becker, stephen.beckr@gmail.com, 2009\n% Incorporated into TFOCS June 17 2014\n\nsz = Afun([],0);\n\nif iscell(sz)\n nn = sz{1};\n mm = sz{2};\n n1 = nn(1);\n n2 = nn(2);\n m = prod(mm);\nelse\n m = sz(1);\n n1 = sz(2);\n n2 = 1;\nend\n\nA = zeros(m,n1*n2);\ne = zeros(n1,n2);\nvec = @(x) x(:);\nfor j = 1:(n1*n2)\n e(j) = 1;\n A(:,j) = vec(Afun(e,1)); % call it in forward mode\n e(j) = 0;\nend\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/proj_Rn.m", "content": "function op = proj_Rn\n\n%PROJ_RN \"Projection\" onto the entire space.\n% OP = PROX_RN returns an implementation of the set Rn. Use\n% this function to specify a model with no nonsmooth component. It is\n% identical to both PROX_0 and SMOOTH_CONSTANT( 0 ).\n% The projection onto Rn is just the identity.\n% Dual: proj_0.m\n\nop = smooth_constant( 0 );\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/proj_Rplus.m", "content": "function op = proj_Rplus( scale )\n\n%PROJ_RPLUS Projection onto the nonnegative orthant.\n% OP = PROJ_RPLUS returns an implementation of the indicator \n% function for the nonnegative orthant.\n% OP2 = PROJ_RPLUS( scale ) returns the indicator function\n% of the scaled nonnegative orthant: that is,\n% OP2( x ) = OP( scale * x ).\n% Because the nonnegative orthant is a cone, scaling has no\n% effect if scale > 0. If scale < 0, the result is an \n% indicator function for the nonpositive orthant, which is\n% also the conjugate of the original. If scale == 0, then\n% the result is the zero function.\n% Dual: proj_Rplus(-1)\n%\n% See also proj_psd.m, the matrix-analog of this function\n\nif nargin == 0,\n op = @proj_Rplus_impl;\nelseif ~isa( scale, 'double' ) || numel( scale ) ~= 1 || ~isreal( scale ),\n error( 'The argument must be a real scalar.' );\nelseif scale > 0,\n op = @proj_Rplus_impl;\nelseif scale < 0,\n op = @proj_Rminus_impl;\nelse\n op = proj_Rn;\nend\n\nfunction [ v, x ] = proj_Rplus_impl( x, t )\nv = 0;\nswitch nargin,\n\tcase 1,\n\t\tif nargout == 2,\n\t\t\terror( 'This function is not differentiable.' );\n elseif any( x(:) < 0 ),\n v = Inf;\n end\n\tcase 2,\n\t\tx = max( x, 0 );\n\totherwise,\n\t\terror( 'Not enough arguments.' );\nend\n\nfunction [ v, x ] = proj_Rminus_impl( x, t )\nv = 0;\nswitch nargin,\n\tcase 1,\n\t\tif nargout == 2,\n\t\t\terror( 'This function is not differentiable.' );\n elseif any( x(:) > 0 ),\n v = Inf;\n end\n\tcase 2,\n\t\tx = min( x, 0 );\n\totherwise,\n\t\terror( 'Not enough arguments.' );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/proj_affine.m", "content": "function op = proj_affine( A, b, R )\n%PROJ_AFFINE(A, b) Projection onto the affine set \n% { x : A*x == b }\n%\n% Warning! For large dimensions, this may be costly.\n% In this case, use proj_0 and explicitly seprate\n% out the affine term (this is the motivation behind\n% TFOCS). \n%\n% For efficiency, this function does a single costly\n% Cholesky decomposition when instatiated; subsequent\n% calls are cheap.\n%PROJ_AFFINE(A, b, R)\n% uses the user-provided R for the Cholesky factorization\n% of A*A', i.e., R'*R = A*A' and R is upper triangular.\n%\n% If A is a tight frame, e.g., A*A' = alpha*I for some\n% scalar alpha>0, then the projection is efficient, but it is\n% not automatically recognized. The user should\n% provide R = sqrt(alpha)*eye(m) (where A is m x n)\n% and then the code will be efficient.\n%\n% N.B. If the system of equations is overdetermined,\n% then the set is just a single point.\n%\n% See also proj_boxAffine and proj_singleAffine\n\nerror(nargchk(2,3,nargin));\nif nargin < 3\n if size(A,1) > 1e4\n warning('proj_affine:largeSize','Cholesky decomposition might take a large for such large matrices');\n end\n [R,p] = chol(A*A');\nelse\n p = 0;\n % Assuming that if user provides R, then it is not over-determiend\nend\nif p > 0\n % A*A' is rank deficient, i.e., system is over-determined\n % So, there is just a unique point\n warning('proj_affine:overdetermined','The system is over-determined so the set is a single point');\n xStar = A\\b;\n op = @(varargin) proj_point( xStar, varargin{:} );\nelse\n op = @(varargin) proj_affine_internal( A, R, b, varargin{:} );\nend\n\nfunction [v,x] = proj_point( xStar, y, t )\nv = 0;\nswitch nargin\n case 2\n if nargout == 2\n error('This function is not differentiable.');\n end\n % Check if we are feasible\n if norm( y - xStar ) > 1e-13\n v = Inf;\n end\n case 3\n % The projection is simple:\n x = xStar;\n otherwise\n error( 'Wrong number of arguments.' );\nend\n\nfunction [v,x] = proj_affine_internal( A, R, b, y, t )\nv = 0;\nswitch nargin\n case 4\n if nargout == 2\n error('This function is not differentiable.');\n end\n % Check if we are feasible\n if norm( A*y - b ) > 1e-13\n v = Inf;\n end\n case 5\n x = y + A'*( R\\( R'\\( b - A*y )) );\n otherwise\n error( 'Wrong number of arguments.' );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/proj_box.m", "content": "function op = proj_box(l,u)\n%PROJ_BOX Projection onto box constraints.\n%PROJ_BOX(l,u) Projection onto the box { l <= x <= u }\n% If l or u is the empty matrix [], then the constraint is not\n% enforced (e.g. PROJ_BOX([],1) is the set { x <= 1 },\n% and PROJ_BOX(0) is the set { 0 <= x } )\n% The parameters l and u may also be vectors or matrixes\n% of the same size as x.\n%\n% OP = PROJ_BOX returns an implementation of this projection.\n%\n% Dual function: prox_boxDual.m\n% See also prox_boxDual\n\n% warning: doesn't check to ensure l <= u\n\nerror(nargchk(1,2,nargin));\nif nargin < 2, u = []; end\n%op = @proj_Rplus_impl;\n% bugfix, March 2011:\nop = @(varargin)proj_Rplus_impl(l,u,varargin{:});\n\nfunction [ v, x ] = proj_Rplus_impl( l, u, x, t )\nv = 0;\nswitch nargin,\n\tcase 3,\n\t\tif nargout == 2,\n\t\t\terror( 'This function is not differentiable.' );\n end\n if any( x < l ) || any( x > u )\n v = Inf;\n end\n\tcase 4,\n if ~isempty(l)\n x = max( x, l );\n end\n if ~isempty(u)\n x = min( x, u );\n end\n\totherwise,\n\t\terror( 'Wrong number of arguments.' );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/proj_boxAffine.m", "content": "function op = proj_boxAffine( a, l, u, alpha )\n%PROJ_BOXAFFINE(a,l,u,alpha) Projection onto the box { l <= x <= u } intersected\n% with the constraint a'*x == alpha\n% If l or u is the empty matrix [], then the constraint is not\n% enforced. \"a\" must be included (otherwise, use proj_box.m).\n% The parameters l and u may also be vectors or matrixes\n% of the same size as x.\n% The offset \"alpha\" is optional (default is 0)\n%\n% OP = PROJ_BOXAFFINE returns an implementation of this projection.\n%\n% See also proj_box, proj_affine, proj_singleAffine, prox_boxDual\nerror(nargchk(3,4,nargin));\nif isempty(l), l = -Inf(size(a)); end\nif isempty(u), u = Inf(size(a)); end\nif nargin < 4 || isempty(alpha), alpha = 0; end\n% % Not the most efficient, but least amount of coding work:\n% if isequal(size(l),[1,1]) && numel(a) > 1\n% l = l*ones(size(a));\n% end\n% if isequal(size(u),[1,1]) && numel(a) > 1\n% u = u*ones(size(a));\n% end\nop = @(varargin) proj_box_affine(a,l,u, alpha, varargin{:} );\n\n\nfunction [v,x] = proj_box_affine( a, l, u, alpha, y, t )\nv = 0;\nswitch nargin\n case 5\n if nargout == 2\n error('This function is not differentiable.');\n end\n % Check if we are feasible\n if any( y < l ) || any( y > u ) || abs( tfocs_dot(y,a) ) > 1e-13\n v = Inf;\n end\n case 6\n scalarL = ( numel(l) == 1 );\n scalarU = ( numel(u) == 1 );\n \n n = length(y);\n if numel(y) > n\n % It should work, but no 100% guarantees\n% warning('TFOC:proj_boxAffine','Not extensively tested for matrix inputs; use at your own risk!'); \n n = numel(y);\n end\n projBox = @(x) max( l, min( u, x ) );\n % Turning points for constraints = l (l for lower)\n T1 = (y-l)./a;\n % Turning points for constraints = u (u for upper)\n T2 = (y-u)./a;\n T = sort(union(T1(:),T2(:)));\n lwrBound = 1;\n uprBound = 2*n;\n for i = 1:ceil(log2(2*n))\n indx = round( (lwrBound+uprBound)/2 );\n beta = T(indx);\n \n % Our trial solution\n x = projBox( y - beta*a );\n % Refine beta on the support (ignore constraints): see if it satisifies constraints\n S = find( x > l & x < u );\n S1 = x==l;\n S2 = x==u;\n\n % Given the fixed points, we subtract these off, and resolve the\n % plain affine projection problem on the active set\n % The affine projection solun is always x = y - betaEst*a\n % for some betaEst.\n \n% betaEst = (a(S)'*y(S) + a(S2)'*u(S2) + a(S1)'*l(S1) )/(a(S)'*a(S));\n % Or, so that we can allow u and l to be scalars,\n if scalarL, al = sum(a(S1))*l; else al = a(S1)'*l(S1); end\n if scalarU, au = sum(a(S2))*u; else au = a(S2)'*u(S2); end\n betaEst = (a(S)'*y(S) + au + al - alpha )/(a(S)'*a(S));\n \n \n % Check if bestEst is in the admissible range\n % e.g. if betaEst > beta, is it less than T(indx+1)? and vice-versa\n if betaEst > beta\n if indx == 2*n || betaEst < T(indx+1)\n break;\n else\n lwrBound = indx + 1; % we need to increase beta\n end\n else\n if indx == 1 || betaEst > T(indx-1)\n break;\n else\n uprBound = indx - 1; % we need to decrease beta\n end\n end\n end\n x = projBox( y - betaEst*a );\n S = find( x > l & x < u );\n S1 = x==l;\n S2 = x==u;\n% betaEst = (a(S)'*y(S) + a(S2)'*u(S2) + a(S1)'*l(S1) )/(a(S)'*a(S));\n % Or, so that we can allow u and l to be scalars,\n if scalarL, al = sum(a(S1))*l; else al = a(S1)'*l(S1); end\n if scalarU, au = sum(a(S2))*u; else au = a(S2)'*u(S2); end\n betaEst = (a(S)'*y(S) + au + al -alpha )/(a(S)'*a(S));\n x = projBox( y - betaEst*a );\n otherwise\n error( 'Wrong number of arguments.' );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/proj_conic.m", "content": "function op = proj_conic()\n%PROJ_CONIC\n% Returns an operator implementing projection onto\n% the second order cone, aka (real) Lorentz cone\n% aka ice-cream cone\n% That is,\n% { x : norm( x(1:end-1) , 2) <= x(end) }\n%\n% The cone is often written as\n% { (x,t) : ||x|| <= t }\n% so note that in this implementation, \"t\" is\n% inferred from the final coordinate of x.\n%\n% Contributed by Joself Salmon 2013\n\nop = @proj_conic_impl;\n\nfunction [ v, x ] = proj_conic_impl( x, t )\nv = 0;\n[n,m]=size(x);\nsum_part=sqrt( sum(x(1:n-1).^2) );\nxn=(x(n));\n\nswitch nargin,\n\tcase 1,\n\t\tif nargout == 2\n\t\t\terror( 'This function is not differentiable.' );\n elseif ( (sum_part)>xn ) \n v = Inf; \n end\n\tcase 2,\n\n if ( ((sum_part) -abs(xn))> 0 )\n x=1/2*(1+xn/sum_part)*[x(1:n-1);sum_part];\n \n elseif ( (sum_part)<(xn) )\n x=x; \n elseif ( (sum_part)<(-xn) )\n x=zeros(n,m);\n \n end\n \n\totherwise,\n\t\terror( 'Not enough arguments.' );\nend\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/proj_l1.m", "content": "function op = proj_l1( q, d )\n%PROJ_L1 Projection onto the scaled 1-norm ball.\n% OP = PROJ_L1( Q ) returns an operator implementing the \n% indicator function for the 1-norm ball of radius q,\n% { X | norm( X, 1 ) <= q }. Q is optional; if omitted,\n% Q=1 is assumed. But if Q is supplied, it must be a positive\n% real scalar.\n%\n% OP = PROJ_L1( Q, D ) uses a scaled 1-norm ball of radius q,\n% { X | norm( D.*X, 1 ) <= 1 }. D should be the same size as X\n% and non-negative (some zero entries are OK).\n%\n% Dual: prox_linf.m\n% See also: prox_linf, prox_l1, proj_linf\n\nif nargin == 0,\n\tq = 1;\nelseif ~isnumeric( q ) || ~isreal( q ) || numel( q ) ~= 1 || q <= 0,\n\terror( 'Argument must be positive.' );\nend\nif nargin < 2 || isempty(d) || numel(d)==1\n if nargin>=2 && ~isempty(d)\n % d is a scalar, so norm( d*x ) <= q is same as norm(x)<=q/d\n if d==0\n error('If d==0 in proj_l1, the set is just {0}, so use proj_0');\n elseif d < 0\n error('Require d >= 0');\n end\n q = q/d;\n end\n op = @(varargin)proj_l1_q(q, varargin{:} );\nelse\n if any(d<0)\n error('All entries of d must be non-negative');\n end\n op = @(varargin)proj_l1_q_d(q, d, varargin{:} );\nend\n\nfunction [ v, x ] = proj_l1_q( q, x, t )\nv = 0;\nswitch nargin,\ncase 2,\n\tif nargout == 2,\n\t\terror( 'This function is not differentiable.' );\n\telseif norm( x(:), 1 ) > q,\n\t\tv = Inf;\n\tend\ncase 3,\n s = sort(abs(nonzeros(x)),'descend');\n cs = cumsum(s);\n % ndx = find( cs - (1:numel(s))' .* [ s(2:end) ; 0 ] >= q, 1 );\n ndx = find( cs - (1:numel(s))' .* [ s(2:end) ; 0 ] >= q+2*eps(q), 1 ); % For stability\n if ~isempty( ndx )\n thresh = ( cs(ndx) - q ) / ndx;\n x = x .* ( 1 - thresh ./ max( abs(x), thresh ) ); % May divide very small numbers\n end\notherwise,\n error( 'Not enough arguments.' );\nend\n\n% Allows scaling. Added Feb 21 2014\nfunction [ v, x ] = proj_l1_q_d( q, d, x, t )\nv = 0;\nswitch nargin,\ncase 3,\n\tif nargout == 2,\n\t\terror( 'This function is not differentiable.' );\n\telseif norm( d(:).*x(:), 1 ) > q,\n\t\tv = Inf;\n\tend\ncase 4,\n [lambdas,srt] = sort(abs(nonzeros(x./d)),'descend');\n s = abs(x(:).*d(:)); s = s(srt);\n dd = d(:).^2; dd= dd(srt);\n cs = cumsum(s);\n cd = cumsum(dd);\n ndx = find( cs - lambdas.*cd >= q+2*eps(q), 1, 'first');\n if ~isempty( ndx )\n ndx = ndx - 1;\n lambda = ( cs(ndx) - q )/cd(ndx);\n x = sign(x).*max( 0, abs(x) - lambda*d );\n end\notherwise,\n error( 'Not enough arguments.' );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/proj_l1l2.m", "content": "function op = proj_l1l2( q, rowNorms )\n\n%PROJ_L1L2 L1-L2 block norm: sum of L2 norms of rows.\n% OP = PROJ_L1L2( q ) implements the constraint set\n% {X | sum_{i=1:m} norm(X(i,:),2) <= 1 }\n% where X is a m x n matrix. If n = 1, this is equivalent\n% to PROJ_L1. If m=1, this is equivalent to PROJ_L2\n%\n% Q is optional; if omitted, Q=1 is assumed. But if Q is supplied,\n% then it must be positive and real and a scalar.\n%\n% OP = PROJ_L1L2( q, rowNorms )\n% will either do the sum of the l2-norms of rows if rowNorms=true\n% (the default), or the sum of the l2-norms of columns if\n% rowNorms = false.\n%\n% Known issues: doesn't yet work with complex-valued data.\n% Should be easy to fix, so email developers if this is\n% needed for your problem.\n%\n% Dual: prox_linfl2.m [not yet available]\n% See also prox_l1l2.m, proj_l1.m, proj_l2.m\n\nif nargin == 0 || isempty(q),\n\tq = 1;\n% elseif ~isnumeric( q ) || ~isreal( q ) || numel( q ) ~= 1 || q <= 0,\nelseif ~isnumeric( q ) || ~isreal( q ) || any(q <= 0) ||numel(q)>1,\n\terror( 'Argument must be positive and a scalar.' );\nend\n\nif nargin<2 || isempty(rowNorms)\n rowNorms = true;\nend\n\nif rowNorms\n op = tfocs_prox( @(x)f_rows(q,x), @(x,t)prox_f_rows(q,x,t) );\nelse\n op = tfocs_prox( @(x)f_cols(q,x), @(x,t)prox_f_cols(q,x,t) );\nend\n\nfunction v = f_rows(tau,X)\n nrm = sum( sqrt( sum( X.^2, 2 ) ) );\n if nrm <= tau + 5*eps(tau)\n v = 0;\n else\n v = Inf;\n end\nend\nfunction v = f_cols(tau,X)\n nrm = sum( sqrt( sum( X.^2, 1 ) ) );\n if nrm <= tau + 5*eps(tau)\n v = 0;\n else\n v = Inf;\n end\nend\n\n\n\nfunction X = prox_f_rows(tau,X,t) \n if nargin < 3,\n error( 'Not enough arguments.' );\n end\n \n nrms = sqrt( sum( X.^2, 2 ) );\n % When we include a row of x, corresponding to row y of Y,\n % its contribution is norm(y)-lambda\n % So we have sum_{i=1}^m max(0, norm(y_0)-lambda)\n % So, basically project nrms onto the l1 ball...\n s = sort( nrms, 'descend' );\n cs = cumsum(s);\n \n ndx = find( cs - (1:numel(s))' .* [ s(2:end) ; 0 ] >= tau+2*eps(tau), 1 ); % For stability\n \n if ~isempty( ndx )\n thresh = ( cs(ndx) - tau ) / ndx;\n % x = x .* ( 1 - thresh ./ max( abs(x), thresh ) ); % May divide very small numbers\n \n % Apply to relevant rows\n d = max( 0, 1-thresh./nrms );\n m = size(X,1);\n X = spdiags( d, 0, m, m )*X;\n end\nend\n\nfunction X = prox_f_cols(tau,X,t) \n if nargin < 3,\n error( 'Not enough arguments.' );\n end\n \n nrms = sqrt( sum( X.^2, 1 ) ).';\n % When we include a row of x, corresponding to row y of Y,\n % its contribution is norm(y)-lambda\n % So we have sum_{i=1}^m max(0, norm(y_0)-lambda)\n % So, basically project nrms onto the l1 ball...\n s = sort( nrms, 'descend' );\n cs = cumsum(s);\n \n ndx = find( cs - (1:numel(s))' .* [ s(2:end) ; 0 ] >= tau+2*eps(tau), 1 ); % For stability\n \n if ~isempty( ndx )\n thresh = ( cs(ndx) - tau ) / ndx;\n % x = x .* ( 1 - thresh ./ max( abs(x), thresh ) ); % May divide very small numbers\n \n % Apply to relevant rows\n d = max( 0, 1-thresh./nrms );\n n = size(X,2);\n X = X*spdiags( d, 0, n,n );\n end\nend\n\n\n\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2015 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/proj_l2.m", "content": "function op = proj_l2( q, b, A, opts)\n\n%PROJ_L2 Projection onto the scaled 2-norm ball.\n% OP = PROJ_L2( Q ) returns an operator implementing the \n% indicator function for the 2-norm ball of size q,\n% { X | norm( X, 2 ) <= q }. Q is optional; if omitted,\n% Q=1 is assumed. But if Q is supplied, it must be a positive\n% real scalar.\n% (There is experimental support for the case Q=diag(q) with q_i > 0,\n% which requires a 1-dimensional search. This has not been\n% carefully tested. In this case, the set is\n% { X | norm( X./q, 2 ) <= 1 } )\n%\n% OP = PROJ_L2( Q, b ) represents the shifted set\n% { X | norm( X - b, 2 ) <= q }\n%\n% OP = PROJ_L2( Q, b, A ) represents the shifted-and-scaled set\n% { X | norm( A*X - b, 2 ) <= q }\n% Warning: this requires the SVD of A and a one-dimensional\n% root-finding procedure, so it can be slow for large dimensional\n% problems. You may want to use TFOCS_SCD.m and explicitly declare\n% the linear operator (and offset/shift) which will avoid requiring\n% the SVD (although if you can afford the SVD, calling this function\n% with \"A\" may be faster since it can lead to fewer iterations in\n% the overall optimization algorithm).\n% OP = PROJ_L2( Q, b, A, opts )\n% allows the user to fine-tine the settings of the 1-D search\n% by changing parameters in the structure \"opts\"\n%\n% If q=0, you should use proj_0 instead since it can be more efficient.\n%\n% Dual: prox_l2.m\n% See also: prox_l2.m\n\n% June 16 2014, adding support for offset \"b\" and scaling \"A\"\n\nif nargin == 0,\n\tq = 1;\nelseif ~isnumeric( q ) || ~isreal( q )\n\terror( 'Argument must be a real scalar.' );\nend\nif nargin < 2 || isempty(b)\n b = 0;\nend\nif numel(q) == 1\n if q==0, error('Argument \"q\" must be non-zero: use proj_0.m instead'); end\n if q <= 0, error('Argument \"q\" must be positive'); end\n if nargin >= 3\n % Complicated case. We need SVD(A)\n if nargin < 4, opts = []; end\n disp('Now computing SVD of A. Please wait...');\n [U,S,V] = svd(A,0);\n disp('... done');\n proj_l2_Aq(); % clear dual variable history\n op = @(varargin)proj_l2_Aq( q, b, U,S,V,opts,varargin{:} ); \n else\n op = @(varargin)proj_l2_q( q, b, varargin{:} );\n end\nelse\n if any( abs(q) < 10*eps ), error('Weight \"q\" must be nonzero'); end\n warning('TFOCS:experimental','Using experimental feature of TFOCS');\n if nargin>=3\n error('If q is a vector, cannot also have an arbitrary matrix scaling');\n end\n op = @(varargin)proj_l2_qVec( q, b, varargin{:} );\nend\nend% end of sub-routine\n\n% -- Subfunctions --\nfunction [ v, x ] = proj_l2_q( q, b, x, t )\nv = 0;\nswitch nargin,\n\tcase 3,\n\t\tif nargout == 2,\n\t\t\terror( 'This function is not differentiable.' );\n\t\telseif norm( x(:), 'fro' ) > q, % GKC fix 2013 (for > 2D arrays)\n\t\t\tv = Inf;\n\t\tend\n\tcase 4,\n x = x - b;\n nrm = norm(x(:),'fro'); % fixing, Feb '11, and GKC fix 2013\n if nrm > q\n x = x .* ( q / nrm );\n end\n x = x + b;\n\totherwise,\n\t\terror( 'Not enough arguments.' );\nend\nend% end of sub-routine\n\n% -- experimental version for when q is a vector --\nfunction [ v, x ] = proj_l2_qVec( q, b, x, t )\nv = 0;\nswitch nargin,\n\tcase 3,\n\t\tif nargout == 2,\n\t\t\terror( 'This function is not differentiable.' );\n\t\telseif norm( x./q, 'fro' ) > 1,\n\t\t\tv = Inf;\n\t\tend\n\tcase 4,\n x = x - b;\n nrm = norm(x./q,'fro');\n if nrm > 1\n\n % We know x is of the form x0./( 1 + lambda*D2 )\n % for some lambda > 0, but we don't have an easy\n % way to know what lambda is. So, treat this as\n % a 1D minimization problem to find lambda.\n D = 1./(q);\n D2 = D.^2;\n Dx = D.*x;\n \n% lMax = max( abs(x./D2) )*sqrt(numel(x));\n lMax = 1.2*norm( abs(x./D2),'fro'); % a tighter bound\n fmin_opts = optimset( 'TolX', 1e-12 );\n% MaxFunEvals: 500\n% MaxIter:\n [lOpt,val,exitflag,output] = ...\n fminbnd( @(l) (norm(Dx./(1+l*D2),'fro')-1)^2, 0, lMax,fmin_opts);\n if val > 1e-3, error('Proj_l2 failed to converge'); end\n x = x./( 1 + lOpt*D2 );\n end\n x = x + b;\n \n\totherwise,\n\t\terror( 'Not enough arguments.' );\nend\nend% end of sub-routine\n\nfunction [ v, x ] = proj_l2_Aq( q, b, U,S,V,opts, x, t )\npersistent dualVariable\nif nargin==0, dualVariable = []; return; end\nif isempty(dualVariable), dualVariable = 0; end % should be negative\n\nv = 0;\nswitch nargin,\n\tcase 7,\n\t\tif nargout == 2,\n\t\t\terror( 'This function is not differentiable.' );\n\t\telseif norm( x(:), 'fro' ) > q\n\t\t\tv = Inf;\n\t\tend\n\tcase 8\n opts = struct('lambda0',.999*dualVariable);\n [x,projIter,dualVariable] = fastProjection(U,S,V,x,b,q,opts);\n\totherwise,\n\t\terror( 'Not enough arguments.' );\nend\nend% end of sub-routine\n\n\n%% --------- The routine for the scaled case {x: ||Ax-b||<= q}\n\nfunction [x,k,l] = fastProjection( U, S, V, y, b, epsilon, opts )\n% [x,niter,lambda] = fastProjection(U, S, V, y, b, epsilon, opts )\n%\n% minimizes || x - y ||\n% such that || Ax - b || <= epsilon\n%\n% where USV' = A (i.e the SVD of A)\n%\n% OPTS is a structure with the following (optional) parameters:\n% .lambda0 Initial guess for the Lagrange parameter (should be negative)\n% .disp If true, displays some output. Default: false\n% .tol Tolerance. Default is 1e-8*epsilon\n% .maxit Maximum number of iterations for Newton's method\n%\n% Warning: for speed, does not calculate A(y) to see if x = y is feasible\n%\n% Algorithm: 1-dimensional line-search\n%\n% Written by Stephen Becker, September 2009, srbecker@caltech.edu\n% for NESTA Version 1.1\n% Copied to TFOCS by Stephen Becker, June 2014. stephen.beckr@gmail.com\n\n% -- Parameters for Newton's method --\nif nargin < 7, opts = []; end\nif isfield(opts,'lambda0'), lambda0 = opts.lambda0; else lambda0 = 0; end\nif isfield(opts,'maxit'), MAXIT = opts.maxit; else MAXIT = 70; end\nif isfield(opts,'tol'), TOL = opts.tol; else TOL = 1e-8*epsilon; end\nif isfield(opts,'disp'), DISP = opts.disp; else DISP = false; end\n\nm = size(U,1);\nn = size(V,1);\nmn = min([m,n]);\nif numel(S) > mn^2, S = diag(diag(S)); end % S should be a small square matrix\nr = size(S);\nif size(U,2) > r, U = U(:,1:r); end\nif size(V,2) > r, V = V(:,1:r); end\n\ns = diag(S);\ns2 = s.^2;\n\n% What we want to do:\n% b = b - A*y;\n% bb = U'*b;\n\n% if A doesn't have full row rank, then b may not be in the range, so\n% treat this specially\nif size(U,1) > size(U,2)\n bRange = U*(U'*b);\n bNull = b - bRange;\n epsilon = sqrt( epsilon^2 - norm(bNull)^2 );\nend\nb = U'*b - S*(V'*y); % parenthesis is very important! This is expensive.\n \nb2 = abs(b).^2; % for complex data\nbs2 = b2.*s2;\nepsilon2 = epsilon^2;\n\n% The following routine need to be fast\n% For efficiency (at cost of transparency), we are writing the calculations\n% in a way that minimize number of operations. The functions \"f\"\n% and \"fp\" represent f and its derivative.\n\n% f = @(lambda) sum( b2 .*(1-lambda*s2).^(-2) ) - epsilon^2;\n% fp = @(lambda) 2*sum( bs2 .*(1-lambda*s2).^(-3) );\nl = lambda0; oldff = 0;\none = ones(m,1);\nalpha = 1; % take full Newton steps\nfor k = 1:MAXIT\n % make f(l) and fp(l) as efficient as possible:\n ls = one./(one-l*s2);\n ls2 = ls.^2;\n ls3 = ls2.*ls;\n ff = b2.'*ls2; % should be .', not ', even for complex data\n ff = ff - epsilon2;\n fpl = 2*( bs2.'*ls3 ); % should be .', not ', even for complex data\n% ff = f(l); % this is a little slower\n% fpl = fp(l); % this is a little slower\n d = -ff/fpl;\n if DISP, fprintf('%2d, lambda is %5.2f, f(lambda) is %.2e, f''(lambda) is %.2e\\n',...\n k,l,ff,fpl ); end\n if abs(ff) < TOL, break; end % stopping criteria\n l_old = l;\n if k>2 && ( abs(ff) > 10*abs(oldff+100) )\n l = 0; alpha = 1/2; \n oldff = sum(b2); oldff = oldff - epsilon2;\n if DISP, disp('restarting'); end\n else\n if alpha < 1, alpha = (alpha+1)/2; end\n l = l + alpha*d;\n oldff = ff;\n if l > 0\n l = 0; % shouldn't be positive\n oldff = sum(b2); oldff = oldff - epsilon2;\n end\n end\n if l_old == l && l == 0\n if DISP, disp('Making no progress; x = y is probably feasible'); end\n break;\n end\nend\nif l < 0\n xhat = -l*s.*b./( 1 - l*s2 );\n x = V*xhat + y;\nelse\n % y is already feasible, so no need to project\n l = 0;\n x = y;\nend\n\nend % end of sub-routine\n\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/proj_l2group.m", "content": "function op = proj_l2group( q,group_indices )\n%PROJ_L2GROUP Projection onto the intersection of scaled 2-norm balls.\n% OP = PROJ_L2GROUP( Q, GROUP_INDICES ) returns an operator implementing the \n% indicator function for the intersection of 2-norm ball of size q_k,\n% i.e. intersection_k B_k\n% where B_k = { X | norm( X(indK) ) <= q(k) }\n% and indK is indexed by group_indices. Group_indices keeps track\n% of the last index in each index set.\n% The index sets must be non-overlapping.\n% For example, if K=2, and ind1 = 1:10 and ind2 = 11:20,\n% then group_indices = [10,20].\n% Q must be a vector of length K or a vector of length N.\n%\n% With contributions from Joseph Salmon\n%\n% See also: proj_l2.m\n\nif isempty(q), q = 1; end\n% Make sure q is a column vector\nif size(q,1) == 1 && size(q,2) > 1, q = q.'; end\nq = expand_q(q,group_indices);\nop = @(varargin)proj_l2_q( q,group_indices, varargin{:} );\nend\n\nfunction [ v, x ] = proj_l2_q( q,group_indices, x, t )\nv = 0;\nnrm=group_norm(x,group_indices);\n\nswitch nargin,\n\tcase 3,\n\t\tif nargout == 2,\n\t\t\terror( 'This function is not differentiable.' );\n\t\telseif norm( nrm, 'inf') > q,\n\t\t\tv = Inf;\n\t\tend\n\tcase 4, \n x = x .* min(1,( q ./ nrm ));\n\totherwise,\n\t\terror( 'Not enough arguments.' );\nend\nend\n\n\nfunction y=group_norm(x,group_indices)\n% the groups are indexed by their end point\n K=length(group_indices);\n y=zeros(size(x));\n j=1; % start of the group\n for k=1:K\n end_point=group_indices(k);\n y(j:end_point)=norm(x(j:end_point));\n j=end_point+1;\n end\nend\n\nfunction Q = expand_q(q,group_indices)\n% If we have 2 groups, each of size 10\n% (group_indices = [10,20]), then q should\n% be a vector of size 20. But it's more convenient\n% for the user to pass in a vector of size 2, so this function\n% will convert it...\nn = group_indices(end);\nK = length(group_indices);\nif length(q) < n\n Q = ones(n,1);\n j=1; % start of the group\n for k=1:K\n end_point=group_indices(k);\n Q(j:end_point) = q(k);\n j=end_point+1;\n end\nelse\n Q = q;\nend\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/proj_linf.m", "content": "function op = proj_linf( q )\n\n%PROJ_LINF Projection onto the scaled infinity norm ball.\n% OP = PROJ_LINF( Q ) returns an operator implementing the \n% indicator function for the infinity norm ball of size q,\n% { X | norm( X, Inf ) <= q }. Q is optional; if omitted,\n% Q=1 is assumed. But if Q is supplied, it must be a positive\n% real scalar.\n% Dual: prox_l1.m\n% See also: prox_l1, prox_linf, proj_l1\n\nif nargin == 0,\n\tq = 1;\nelseif ~isnumeric( q ) || ~isreal( q ) || numel( q ) ~= 1 || q <= 0,\n\terror( 'Argument must be positive.' );\nend\nop = @(varargin)proj_linf_q( q, varargin{:} );\n\nfunction [ v, x ] = proj_linf_q( q, x, t )\nv = 0;\nswitch nargin,\n\tcase 2,\n\t\tif nargout == 2,\n\t\t\terror( 'This function is not differentiable.' );\n\t\telseif norm( x(:), Inf ) > q,\n\t\t\tv = Inf;\n\t\tend\n\tcase 3,\t\t\t\n x = x ./ max( 1, abs( x / q ) );\n\totherwise,\n\t\terror( 'Not enough arguments.' );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/proj_linfl2.m", "content": "function op = proj_linfl2( q )\n\n%PROJ_LINFL2 Projection of each row onto the scaled l2 norm ball.\n% OP = PROJ_LINFL2( Q ) returns an operator implementing the \n% indicator function for the set of l2 norm ball of size q,\n% { X | for all rows i, norm( X(i,:),2) <= q }. Q is optional; if omitted,\n% Q=1 is assumed. But if Q is supplied, it must be a positive\n% real scalar.\n% Dual: prox_l1l2.m\n% See also: prox_l1, prox_linf, proj_l1\n\nif nargin == 0,\n\tq = 1;\nelseif ~isnumeric( q ) || ~isreal( q ) || numel( q ) ~= 1 || q <= 0,\n\terror( 'Argument must be positive.' );\nend\n\n% In r2007a and later, we can use bsxfun instead of the spdiags trick\nif exist('OCTAVE_VERSION','builtin')\n vr = '2000';\nelse\n vr=version('-release');\nend\nif str2num(vr(1:4)) >= 2007\n op = @(varargin)proj_linfl2_q_bsxfun( q, varargin{:} );\nelse\n % the default, using spdiags\n op = @(varargin)proj_linfl2_q( q, varargin{:} );\nend\n\nfunction [ v, x ] = proj_linfl2_q( q, x, t )\nv = 0;\nswitch nargin,\n\tcase 2,\n\t\tif nargout == 2,\n\t\t\terror( 'This function is not differentiable.' );\n\t\telseif norm( x(:), Inf ) > q,\n\t\t\tv = Inf;\n\t\tend\n\tcase 3,\t\t\t\n % Compute the norms of the rows\n m = size(x,1);\n nrms = sqrt( sum( abs(x).^2 , 2 ) );\n % Scale the rows using left diagonal multiplication\n x = spdiags( min(1,q./nrms), 0, m, m )*x;\n\totherwise,\n\t\terror( 'Not enough arguments.' );\nend\n\nfunction [ v, x ] = proj_linfl2_q_bsxfun( q, x, t )\nv = 0;\nswitch nargin,\n\tcase 2,\n\t\tif nargout == 2,\n\t\t\terror( 'This function is not differentiable.' );\n\t\telseif norm( x(:), Inf ) > q,\n\t\t\tv = Inf;\n\t\tend\n\tcase 3,\t\t\t\n nrms = sqrt( sum( abs(x).^2 , 2 ) );\n bsxfun( @times, x, min(1,q./nrms) );\n\totherwise,\n\t\terror( 'Not enough arguments.' );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/proj_max.m", "content": "function op = proj_max( q )\n\n%PROJ_max Projection onto the scaled max-function ball.\n% OP = PROJ_MAX( Q ) returns an operator implementing the \n% indicator function for the max-function ball of size q,\n% { X | max( X(:) ) <= q }. Q is optional; if omitted,\n% Q=1 is assumed. But if Q is supplied, it must be a \n% real scalar (negative is OK).\n% Dual: prox_l1pos.m\n% See also: prox_l1pos, prox_linf, proj_l1, proj_linf\n\nif nargin == 0,\n\tq = 1;\nelseif ~isnumeric( q ) || ~isreal( q ) || numel( q ) ~= 1 \n\terror( 'Argument \"q\" must be a real scalar.' );\nend\nop = @(varargin)proj_linf_q( q, varargin{:} );\n\nfunction [ v, x ] = proj_linf_q( q, x, t )\nv = 0;\nswitch nargin,\n\tcase 2,\n\t\tif nargout == 2,\n\t\t\terror( 'This function is not differentiable.' );\n\t\telseif max( x(:) ) > q,\n\t\t\tv = Inf;\n\t\tend\n\tcase 3,\t\t\t\n x = min( x, q );\n\totherwise,\n\t\terror( 'Not enough arguments.' );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/proj_maxEig.m", "content": "function op = proj_maxEig( q, LARGESCALE )\n\n%PROJ_MAXEIG Projection onto the set of matrices with max eigenvalue less than or equal to q\n% OP = PROJ_MAXEIG( q ) returns a function that implements the\n% indicator for matrices with spectral norm less than q.\n% Q is optional; if omitted, Q=1 is assumed. But if Q is supplied, \n% it must be a positive real scalar.\n% This function is similar proj_spectral.m but assumes that\n% the input is real symmetric. For positive semi-definite inputs,\n% this function is equivalent to proj_spectral\n% OP = PROJ_MAXEIG( ..., largescale) will switch to using\n% eigs instead of svd or eig, if largescale==true. This is usually\n% beneficial for large, sparse variables.\n%\n% Dual: prox_trace(q)\n% (if domain is pos. semidefinite matrices, then prox_trace(q)\n% is also the dual, and is more efficient than prox_nuclear(q) ).\n%\n% See also prox_trace, prox_nuclear, proj_spectral, prox_spectral\n\n% Sept 1, 2012\nif nargin < 2 || isempty(LARGESCALE)\n LARGESCALE = false;\nend\n\nif nargin == 0,\n\tq = 1;\nelseif ~isnumeric( q ) || ~isreal( q ) || numel( q ) ~= 1 || q <= 0,\n\terror( 'Argument must be positive.' );\nend\n% vectorFunction = proj_linf( q ); % for proj_spectral.m\nvectorFunction = proj_max( q ); \n\nif LARGESCALE\n % clear the persistent values:\n proj_maxEig_eigs_q();\n op = @(varargin)proj_maxEig_eigs_q( q,vectorFunction, varargin{:} );\nelse\n op = @(varargin)proj_maxEig_eig_q( q,vectorFunction, varargin{:} );\nend\n\n\nfunction [ v, X ] = proj_maxEig_eig_q( q,eproj, X, t )\nSP = issparse(X);\nv = 0;\nif nargin > 3 && t > 0,\n if SP, X = full(X); end % svd, eig, and norm require full matrices\n [V,D] = safe_eig(X); % just in case X is sparse\n [dum,D] = eproj(diag(D),q); % not q*t, since we are just projecting...\n X = V*diag(D)*V';\n if SP, X = sparse(X); end\nelse\n nrm = max(eig(X));\n if nrm > q\n v = Inf;\n end\nend\n\n% --------------- largescale functions: use eigs or svds -----------------------\nfunction [ v, X ] = proj_maxEig_eigs_q( q,eproj, X, t )\npersistent oldRank\npersistent nCalls\npersistent V\nif nargin == 0, oldRank = []; v = nCalls; nCalls = []; V=[]; return; end\nif isempty(nCalls), nCalls = 0; end\nSP = issparse(X);\nv = 0;\nif nargin > 3 && t > 0,\n \n if isempty(oldRank), K = 10;\n else, K = oldRank + 2;\n end\n [M,N] = size(X);\n \n ok = false;\n opts = [];\n opts.tol = 1e-10;\n if isreal(X)\n opts.issym = true;\n SIGMA = 'LA'; % not 'LM' like proj_spectral\n else\n SIGMA = 'LR';\n end\n while ~ok\n K = min( [K,M,N] );\n if K > min(M,N)/2 || K > (min(M,N)-2) || min(M,N) < 20\n [V,D] = safe_eig(full((X+X')/2));\n ok = true;\n else\n [V,D] = eigs( X, K, SIGMA, opts );\n ok = (min(abs(diag(D))) < q) || ( K == min(M,N) );\n end\n if ok, break; end\n K = 2*K;\n if K > 10\n opts.tol = 1e-6;\n end\n if K > 40\n opts.tol = 1e-4;\n end\n if K > 100\n opts.tol = 1e-3;\n end\n end\n oldRank = length(find(diag(D) > q)); % no abs here\n \n [dum,D_proj] = eproj(diag(D),q);\n % we want to keep the singular vectors that we haven't discovered\n % small = X - V*D*V'\n % large = V*D_proj*V'\n % and add together to get X - V*(D-Dproj)*V'\n \n X = X - V*diag(diag(D)-D_proj)*V';\n \n if SP, X = sparse(X); end\nelse\n% if SP\n opts = struct('tol',1e-8);\n if isreal(X)\n opts.issym = true;\n SIGMA = 'LA'; % not 'LM' like proj_spectral\n else\n SIGMA = 'LR';\n end\n K = 1;\n D = eigs( X, K, SIGMA , opts );\n nrm = max(D);\n% else\n% nrm = max(eig(X));\n% end\n if nrm > q\n v = Inf;\n end\nend\n\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/proj_nuclear.m", "content": "function op = proj_nuclear( q, sz )\n\n%PROJ_NUCLEAR Projection onto the set of matrices with nuclear norm less than or equal to q.\n% OP = PROJ_NUCLEAR( q ) returns a function that implements the\n% indicator for matrices with nuclear norm less than q.\n% Q is optional; if omitted, Q=1 is assumed. But if Q is supplied, \n% it must be a positive real scalar.\n% This function is like proj_psdUTrace.m but does not assume\n% that inputs are square Hermitian positive semidefinite matrices.\n%\n% OP = PROJ_NUCLEAR( ..., SZ )\n% where SZ = [n1,n2], will assume the input has been vectorized\n% and thus will reshape it into a matrix of size n1 x n2. TFOCS\n% can handle matrix variables so this form of PROJ_NUCLEAR is not\n% always necessary, but it can be easier to find bugs if using\n% only vector variables.\n%\n% This version uses a dense svd decomposition; future versions\n% of TFOCS will take advantage of low-rank and/or sparse structure.\n% Dual function: prox_spectral.m\n% See also prox_spectral, proj_psdUTrace.m, proj_simplex.m, prox_nuclear.m\n\n% June 26, 2012\n\nif nargin == 0,\n\tq = 1;\nelseif ~isnumeric( q ) || ~isreal( q ) || numel( q ) ~= 1 || q <= 0,\n\terror( 'Argument must be positive.' );\nend\nif nargin < 2, sz = []; end\nq = proj_simplex( q );\nop = @(varargin)proj_nuclear_q( q, sz, varargin{:} );\n\nfunction [ v, X ] = proj_nuclear_q( eproj, sz, X, t )\n\nVECTORIZE = false;\n% Input must be a matrix\n\n% In proj_psdUTrace.m, we allow vector inputs because\n% we can reshape them (since we have square matrices).\n% For nuclear norm, inputs can be rectangular matrices,\n% so we do not know how to correctly reshape a vector in\n% this case.\n\n% if size(X,1) ~= size(X,2)\n% n = sqrt(length(X));\n% X = reshape(X, n, n );\n% VECTORIZE = true;\n% end\n\n% Update, Jan 2014, allowing vector variables, as long\n% as the 'sz' variable has been given\nif ~isempty(sz)\n if size(X,2) > 1\n error('proj_nuclear: when using an explicit size value \"sz\", variable should be a vector');\n end\n X = reshape(X, sz(1), sz(2) );\n VECTORIZE = true;\nelseif size(X,2) == 1\n warning('proj_nuclear: appears variable is a vector not a matrix. Are you sure you want the SVD of a vector?');\nend\n\nv = 0;\nif nargin > 3 && t > 0,\n [U,D,V] = svd(X,'econ');\n [dum,D] = eproj(diag(D),t);\n tt = D > 0;\n X = U(:,tt)*diag(D(tt))*V(:,tt)';\n if VECTORIZE, X = X(:); end\nelseif any(svd(X)<0),\n v = Inf;\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/proj_psd.m", "content": "function op = proj_psd( LARGESCALE, isReal, K )\n\n% PROJ_PSD Projection onto the positive semidefinite cone.\n% OP = PROJ_PSD() returns a function that implements\n% the projection onto the semidefinite cone:\n%\tX = argmin_{min(eig(X))>=0} norm(X-Y,'fro')\n%\n% OP = PROJ_PSD( LARGESCALE )\n% performs the same computation, but in a more efficient\n% manner for the case of sparse (and low-rank) matrices\n%\n% OP = PROJ_PSD( LARGESCALE, isReal )\n% also includes the constraint that X is real-valued if isReal is true.\n%\n% This function is self-dual.\n% See also proj_Rplus.m, the vector analog of this function\n\n% in the future, we might include this nonconvex version:\n% OP = PROJ_PSD( LARGESCALE, isReal, k )\n% only returns at most a rank k matrix\n%\n\nif nargin == 0 || isempty(LARGESCALE), LARGESCALE = false; end\nif nargin < 2 || isempty(isReal), isReal = false; end\nif nargin < 3, K = Inf; end\n\nif ~LARGESCALE\n op = @(varargin)proj_psd_impl(isReal, varargin{:} );\nelse\n proj_psd_largescale(); % reset any counters\n op = @(varargin)proj_psd_largescale( K, isReal, varargin{:} );\nend\n\n\nfunction [ v, X ] = proj_psd_impl( isReal, X, t )\nif nargin > 2 && t > 0,\n\tv = 0;\n X = full(X+X'); % divide by 2 later\n if isReal, X = real(X); end\n [V,D]=safe_eig(X); % we don't yet take advantage of sparsity here\n D = max(0.5*diag(D),0);\n tt = D > 0;\n V = bsxfun(@times,V(:,tt),sqrt(D(tt,:))');\n X = V * V';\nelse\n s = eig(full(X+X'))/2;\n if min(s) < -8*eps*max(s),\n v = Inf;\n else\n \tv = 0;\n \tend\nend\n\n\nfunction [ v, X ] = proj_psd_largescale(Kignore,isReal, X, t )\n% Updated Sept 2012. The restriction to rank K \"Kignore\" has not been done yet\n% (that is nonconvex)\npersistent oldRank\npersistent nCalls\npersistent V\nif nargin == 0, oldRank = []; v = nCalls; nCalls = []; V=[]; return; end\nif isempty(nCalls), nCalls = 0; end\nSP = issparse(X);\n\nif nargin > 3 && t > 0,\n\tv = 0;\n if isempty(oldRank), K = 10;\n else, K = oldRank + 2;\n end\n\n [M,N] = size(X);\n EIG_TOL = 1e-10;\n ok = false;\n opts = [];\n opts.tol = 1e-10;\n if isreal(X)\n opts.issym = true;\n SIGMA = 'LA';\n else\n SIGMA = 'LR'; % largest real part\n end\n X = (X+X')/2;\n if isReal, X = real(X); end\n while ~ok\n K = min( [K,N] );\n if K > N/2 || K > N-2 || N < 20\n [V,D] = safe_eig(full((X+X')/2));\n ok = true;\n else\n [V,D] = eigs( X, K, SIGMA, opts );\n ok = (min(real(diag(D))) < EIG_TOL) || ( K == N );\n end\n if ok, break; end\n% opts.v0 = V(:,1); % starting vector\n K = 2*K;\n% fprintf('Increasing K from %d to %d\\n', K/2,K );\n if K > 10\n opts.tol = 1e-6;\n end\n if K > 40\n opts.tol = 1e-4;\n end\n if K > 100\n opts.tol = 1e-3;\n end\n end\n D = real( diag(D) );\n oldRank = length(find( D > EIG_TOL ));\n\n tt = D > EIG_TOL;\n V = bsxfun(@times,V(:,tt),sqrt(D(tt,:))');\n X = V * V';\n if SP, X = sparse(X); end\nelse\n opts.tol = 1e-10;\n if isreal(X)\n opts.issym = true;\n SIGMA = 'SA';\n else\n SIGMA = 'SR'; % smallest real part\n end\n K = 1; % we only want the smallest\n X = full(X+X'); % divide by 2 later\n if isReal, X = real(X); end\n d = eigs(X, K, SIGMA, opts );\n d = real(d)/2;\n \n if d < -10*eps\n v = Inf;\n else\n \tv = 0;\n end\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/proj_psdUTrace.m", "content": "function op = proj_psdUTrace( q, LARGESCALE, force_real, maxK, Sigma )\n\n%PROJ_PSDUTRACE Projection onto the positive semidefinite cone with fixed trace.\n% OP = PROJ_PSDUTRACE( q ) returns a function that implements the\n% indicator for the cone of positive semidefinite (PSD) matrices with\n% fixed trace: { X | min(eig(X+X'))>=0, trace(0.5*(X+X'))<=q\n% Q is optional; if omitted, Q=1 is assumed. But if Q is supplied, \n% it must be a positive real scalar. \n%\n% OP = PROJ_PSDUTRACE( q, LARGESCALE) will use a Lanczos-based Eigenvalue\n% decomposition if LARGESCALE==true, eitherwise it uses a dense\n% matrix decomposition\n%\n% OP = PROJ_PSDUTRACE( q, LARGESCALE, forceReal ) will also include the \n% constraint that X is a real matrix if forceReal is true.\n%\n% OP = PROJ_PSDUTRACE( q, LARGESCALE, forceReal, maxK ) will only\n% use the Lanczos-solver if it expects fewer than maxK eigenvalues\n%\n% OP = PROJ_PSDUTRACE( q, LARGESCALE, forceReal, maxK, Sigma ) \n% offsets the objective function by trace(Sigma'*X), that is,\n% the overall function is trace(Sigma'*X) s.t. X >= 0, tr(X)==q\n%\n% CALLS = PROJ_PSDUTRACE( 'reset' )\n% resets the internal counter and returns the number of function calls\n%\n% This version uses a dense eigenvalue decomposition; future versions\n% of TFOCS will take advantage of low-rank and/or sparse structure.\n%\n% If the input to the operator is a vector of size n^2 x 1, it will\n% be automatically reshaped to a n x n matrix. In this case,\n% the output will also be of length n^2 x 1 and not n x n.\n%\n% Note: proj_simplex.m (the vector-analog of this function)\n% Duals: the dual function is prox_maxEig, which also requires\n% PSD inputs. The function prox_spectral(q,'sym') is also equivalent\n% to prox_maxEig if given a PSD input.\n% See also prox_maxEig, prox_spectral, proj_simplex, prox_trace\n\n% Feb 15 2013, adding support for eigs calculations\n% Apr 14 2014, adding support for the offset Sigma\n\n\nif nargin == 1 && strcmpi(q,'reset')\n op = prox_trace_impl;\n return;\nend\n\nif nargin == 0,\n\tq = 1;\nelseif ~isnumeric( q ) || ~isreal( q ) || numel( q ) ~= 1 || q <= 0,\n\terror( 'Argument must be positive.' );\nend\nif nargin < 2, LARGESCALE = []; end\nif nargin < 3\n force_real = false;\nend\nif nargin < 4 || isempty(maxK)\n maxK = 100;\nend\nif nargin < 5 \n Sigma = [];\nend\nif ~isempty( LARGESCALE ) && LARGESCALE\n op = @(varargin)proj_psdUTrace_q_eigs( q, maxK, force_real, Sigma, varargin{:} );\nelse\n op = @(varargin)proj_psdUTrace_q( q, force_real, Sigma, varargin{:} );\nend\n\nfunction [ v, X ] = proj_psdUTrace_q_eigs( lambda, maxK, force_real, Sigma, X, t )\npersistent oldRank\npersistent nCalls\npersistent V\nif nargin == 0, oldRank = []; v = nCalls; nCalls = []; V=[]; return; end\nif isempty(nCalls), nCalls = 0; end\nif isempty(maxK), maxK = size(X,1); end\nif isempty(force_real), force_real = false; end\n\nVECTORIZE = false;\nif size(X,1) ~= size(X,2)\n %error('proj_psdUTrace requires a square matrix as input');\n n = sqrt(length(X));\n X = reshape(X, n, n );\n VECTORIZE = true;\nend\nv = 0;\nif ~isempty(Sigma) % added April 14 2014\n X = X - t*Sigma;\nend\nX = full(0.5*(X+X')); % added 'full' Sept 5 2012\nif force_real % added Nov 23 2012\n X = real(X);\nelse\n is_real = isreal(X);\nend\nif nargin > 5 && t > 0\n \n opts = [];\n opts.tol = 1e-10;\n if force_real || is_real\n opts.issym = true; \n SIGMA = 'LA'; % get largest eigenvalues (NOT in magnitude)\n else\n SIGMA = 'LR'; % should be real anyhow (to 1e-10). get largest real part\n end\n if isempty(oldRank), K = 10;\n else, K = oldRank + 2;\n end\n N = size(X,1);\n ok = false;\n ctr = 0;\n FEASIBLE = false;\n while ~ok\n ctr = ctr + 1;\n K = min( K, N );\n if K > N/2 || K > maxK\n [V,D] = safe_eig(X); ok = true;\n D = diag(D);\n break;\n end\n% opts.tol = min(max(opts.tol,1e-10),1e-7);\n\n [V,D] = eigs( X, K,SIGMA, opts );\n D = diag(D);\n delta = ( sum(D) - lambda ) / K;\n ok = min(D) < delta;\n \n if ok, break; end\n \n % Can we do an early return? maybe we are already feasible\n if sum(D) + (N-K-1)*min(D) < lambda\n% disp('Point is feasible! exiting');\n FEASIBLE = true;\n break;\n end\n \n % otherwise, increase K\n \n K = 2*K;\n if K > 10\n opts.tol = 1e-6;\n end\n if K > 40\n opts.tol = 1e-4;\n end\n if K > 100\n opts.tol = 1e-3;\n end\n end\n if FEASIBLE\n oldRank = N;\n else\n smplx = proj_simplex(lambda);\n [dum,D] = smplx(D,1);\n spprt = find(D);\n D = diag(D(spprt));\n V = V(:,spprt);\n X = V*D*V';\n oldRank = length(spprt);\n end\n \n\n nCalls = nCalls + 1;\n if ~isempty(Sigma)\n v = Sigma(:)'*X(:);\n end\n if VECTORIZE, X = X(:); end\nelseif any(eig(X)<0) || trace(X) > lambda\n v = Inf;\nend\n\n\n\nfunction [ v, X ] = proj_psdUTrace_q( lambda, force_real, Sigma, X, t )\npersistent nCalls\nif nargin == 0, v = nCalls; nCalls = []; return; end\nif isempty(nCalls), nCalls = 0; end\n\neproj = proj_simplex( lambda );\n\nVECTORIZE = false;\nif size(X,1) ~= size(X,2)\n %error('proj_psdUTrace requires a square matrix as input');\n n = sqrt(length(X));\n X = reshape(X, n, n );\n VECTORIZE = true;\nend\nv = 0;\nif ~isempty(Sigma) % added April 14 2014\n X = X - t*Sigma;\nend\nX = full(0.5*(X+X')); % added 'full' Sept 5 2012\nif force_real % added Nov 23 2012\n X = real(X);\nend\nif nargin > 4 && t > 0,\n nCalls = nCalls + 1;\n [V,D]=safe_eig(X);\n [dum,D] = eproj(diag(D),t);\n tt = D > 0;\n V = bsxfun(@times,V(:,tt),sqrt(D(tt,:))');\n X = V * V';\n if ~isempty(Sigma)\n v = Sigma(:)'*X(:);\n end\n if VECTORIZE, X = X(:); end\nelseif any(eig(X)<0) || trace(X) > lambda\n v = Inf;\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/proj_simplex.m", "content": "function op = proj_simplex( q, EQ, VECTORIZE )\n\n%PROJ_SIMPLEX\tProjection onto the simplex.\n% OP = PROJ_SIMPLEX( Q ) returns an nonsmooth function that\n% represents the scaled simplex { x | x >= 0, sum(x) == q }.\n% Q is optional; if not supplied, it defaults to 1. If it is\n% supplied, it must be a real positive scalar.\n%\n% OP = PROJ_SIMPLEX( Q, EQ )\n% controls whether the sum() constraint is an inequality or equality\n% EQ = true (default) uses { x | x >= 0, sum(x) == q }.\n% EQ = false uses { x | x >= 0, sum(x) <= q }.\n%\n% OP = PROJ_SIMPLEX( Q, EQ, VECTORIZE)\n% controls how the function behaves if the input X has more than\n% one column. If VECTORIZE=true (default), then we convert X to a \n% long vector. If VECTORIZE=false, then we project each column\n% separately.\n%\n% See also proj_psdUTrace.m (the matrix-analog of this function)\n\nif nargin == 0,\n\tq = 1;\nelseif ~isnumeric( q ) || ~isreal( q ) || numel( q ) ~= 1 || q <= 0,\n\terror( 'Argument must be positive.' );\nend\nif nargin < 2 || isempty(EQ) , EQ = true; end % added 1/9/2016\nif nargin < 3 || isempty(VECTORIZE) , VECTORIZE = true; end % added 1/9/2016\nop = @(varargin)proj_simplex_q( q, EQ, VECTORIZE, varargin{:} );\n\nfunction [ v, x ] = proj_simplex_q( q, EQ, VECTORIZE, x, t )\nv = 0;\n\n% We have two options when input x is a matrix:\n% Does the user want to treat it as x(:), i.e. \"vectorize\" it ?\n% Or does the user want to treat each column separately?\n% Most other functions (e.g. l1, linf) treat it as x(:)\n% so that will be the default. However, we leave it\n% as a hard-coded option so that the user can change it\n% if they want.\n% 2016, changed to a parameter\n% VECTORIZE = true;\n\nif nargin > 4 && t > 0,\n\tif any( x(:) < 0 ) || any( sum( x ) > q ) || ( EQ && norm( sum( x ) - q)>1e-8/norm(q) ) \n if VECTORIZE\n s = sort( x(:), 'descend' );\n else\n s = sort( x, 'descend' );\n end\n if q < eps(s(1))\n error('Input is scaled so large compared to q that accurate computations are difficult');\n % since then cs(1) = s(1) - q is not even guaranteed to be\n % smaller than q !\n end\n if size(x,2) == 1 || VECTORIZE\n cs = ( cumsum(s) - q ) ./ ( 1 : numel(s) )';\n ndx = nnz( s > cs );\n tau = cs(ndx);\n if ~EQ, tau = max( tau, 0 ); end\n x = max( x - tau, 0 );\n else\n % vectorized for several columns\n cs = diag( 1./( 1 : size(s,1) ) )*( cumsum(s) - q );\n ndx = sum( s > cs );\n ndx = sub2ind( size(x), ndx, 1:size(x,2) );\n tau = cs(ndx);\n if ~EQ, tau = max( tau, 0 ); end\n x = max( x - repmat(tau,size(x,1),1), 0 );\n end\n\tend\n% Sept 6 2012, adding factor of 100 in the line below:\nelseif any( x(:) < 0 ) || any( abs( sum(x) / q - 1 ) > sqrt(numel(x)) * 100 *eps )\n v = Inf;\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/proj_singleAffine.m", "content": "function op = proj_singleAffine( a, beta, ineq )\n%PROJ_SINGLEAFFINE(a,beta) Projection onto the affine set { x : a'*x == beta }\n% The parameter a may be a vector or matrix\n% of the same size as x. By default, beta is 0\n%PROJ_SINGLEAFFINE(a,beta,ineq)\n% Projection onto the affine set { x : a'*x >= beta }\n% if ineq == 1, and onto { x : a'*x <= beta } if ineq == -1\n% Setting ineq == 0 (default) uses { x : a'*x == beta }\n%\n% For matrix variables, this interprets a'*x as a(:)'*x(:), e.g.,\n% the standard dot product\n%\n% OP = PROJ_SINGLEAFFINE returns an implementation of this projection.\n%\n% For more than one affine constraint, see proj_affine.m\n%\n% See also proj_boxAffine and proj_affine\n\nerror(nargchk(1,3,nargin));\nif nargin < 2, beta = 0; end\nif isempty(beta), beta = 0; end\nif nargin < 3 || isempty(ineq), ineq = 0; end\nop = @(varargin) proj_affine_internal(a,beta,ineq, varargin{:} );\n\n\nfunction [v,x] = proj_affine_internal( a, beta, ineq, y, t )\nv = 0;\nswitch nargin\n case 4\n if nargout == 2\n error('This function is not differentiable.');\n end\n % Check if we are feasible\n if abs( tfocs_dot(y,a) - beta ) > 1e-13\n v = Inf;\n end\n case 5\n dt = tfocs_dot(a,y);\n if (ineq==0) || ( ineq==1 && dt < beta ) || (ineq==-1 && dt > beta)\n x = y - ( dt - beta )/tfocs_dot(a,a) * a;\n else\n x = y;\n end\n otherwise\n error( 'Wrong number of arguments.' );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/proj_spectral.m", "content": "function op = proj_spectral( q, SYM_FLAG, LARGESCALE )\n\n%PROJ_SPECTRAL Projection onto the set of matrices with spectral norm less than or equal to q\n% OP = PROJ_SPECTRAL( q ) returns a function that implements the\n% indicator for matrices with spectral norm less than q.\n% Q is optional; if omitted, Q=1 is assumed. But if Q is supplied, \n% it must be a positive real scalar.\n% This function is like proj_psdUTrace.m but does not assume\n% that inputs are square Hermitian positive semidefinite matrices.\n% OP = PROJ_SPECTRAL( q, 'sym' ) or OP = PROJ_SPECTRAL( 'eig' )\n% will instruct the code that the matrix is Hermitian and \n% therefore the relations between singular- and eigen-values\n% are well known, and the code will use the more efficient\n% eigenvalue decomposition (instead of the SVD).\n% OP = PROJ_SPECTRAL( ..., largescale) will switch to using\n% svds (or PROPACK, if installed and in the path) or eigs\n% instead of svd or eig, if largescale==true. This is usually\n% beneficial for large, sparse variables.\n%\n% Dual: prox_nuclear(q)\n% (if domain is pos. semidefinite matrices, then prox_trace(q)\n% is also the dual, and is more efficient than prox_nuclear(q) ).\n%\n% See also prox_nuclear, proj_linf, proj_nuclear, prox_spectral, proj_maxEig\n\n% Sept 1, 2012\nif nargin < 3 || isempty(LARGESCALE)\n LARGESCALE = false;\nend\n\nif nargin == 0,\n\tq = 1;\nelseif ~isnumeric( q ) || ~isreal( q ) || numel( q ) ~= 1 || q <= 0,\n\terror( 'Argument must be positive.' );\nend\nvectorFunction = proj_linf( q );\nif nargin >= 2 && ( ...\n ~isempty(strfind(lower(SYM_FLAG),'eig')) || ...\n ~isempty(strfind(lower(SYM_FLAG),'sym')) )\n if LARGESCALE\n % clear the persistent values:\n proj_spectral_eigs_q();\n op = @(varargin)proj_spectral_eigs_q( q,vectorFunction, varargin{:} );\n else\n op = @(varargin)proj_spectral_eig_q( q,vectorFunction, varargin{:} );\n end\nelse\n if LARGESCALE\n % clear the persistent values:\n proj_spectral_svds_q();\n op = @(varargin)proj_spectral_svds_q( q,vectorFunction, varargin{:} );\n else\n op = @(varargin)proj_spectral_svd_q( q,vectorFunction, varargin{:} );\n end\nend\n\nfunction [ v, X ] = proj_spectral_svd_q( q,eproj, X, t )\nsx = size( X );\nSP = issparse(X);\nif length( sx ) > 2,\n X = reshape( X, prod(sx(1:end-1)), sx(end) );\nend\nv = 0;\nif nargin > 3 && t > 0,\n if SP, X = full(X); end % svd, eig, and norm require full matrices\n [U,D,V] = svd( X, 'econ' );\n [dum,D] = eproj(diag(D),q); % not q*t, since we are just projecting...\n X = U*diag(D)*V';\n if SP, X = sparse(X); end\n X = reshape( X, sx );\nelse\n if SP, \n [nrm,cnt] = normest(X,1e-3);\n else\n nrm = norm(X);\n end\n if nrm > q\n v = Inf;\n end\nend\n\nfunction [ v, X ] = proj_spectral_eig_q( q,eproj, X, t )\nSP = issparse(X);\nv = 0;\nif nargin > 3 && t > 0,\n if SP, X = full(X); end % svd, eig, and norm require full matrices\n [V,D] = safe_eig(X); % just in case X is sparse\n [dum,D] = eproj(diag(D),q); % not q*t, since we are just projecting...\n X = V*diag(D)*V';\n if SP, X = sparse(X); end\nelse\n if SP, [nrm,cnt] = normest(X,1e-3);\n else nrm = norm(X); \n end\n if nrm > q\n v = Inf;\n end\nend\n\n% --------------- largescale functions: use eigs or svds -----------------------\nfunction [ v, X ] = proj_spectral_eigs_q( q,eproj, X, t )\npersistent oldRank\npersistent nCalls\npersistent V\nif nargin == 0, oldRank = []; v = nCalls; nCalls = []; V=[]; return; end\nif isempty(nCalls), nCalls = 0; end\nSP = issparse(X);\nv = 0;\nif nargin > 3 && t > 0,\n \n if isempty(oldRank), K = 10;\n else, K = oldRank + 2;\n end\n [M,N] = size(X);\n \n ok = false;\n opts = [];\n opts.tol = 1e-10;\n if isreal(X)\n opts.issym = true;\n end\n while ~ok\n K = min( [K,M,N] );\n [V,D] = eigs( X, K, 'LM', opts );\n ok = (min(abs(diag(D))) < q) || ( K == min(M,N) );\n if ok, break; end\n K = 2*K;\n if K > 10\n opts.tol = 1e-6;\n end\n if K > 40\n opts.tol = 1e-4;\n end\n if K > 100\n opts.tol = 1e-3;\n end\n if K > min(M,N)/2\n [V,D] = safe_eig(full((X+X')/2));\n ok = true;\n end\n end\n oldRank = length(find(abs(diag(D)) > q));\n \n [dum,D_proj] = eproj(diag(D),q);\n % we want to keep the singular vectors that we haven't discovered\n % small = X - V*D*V'\n % large = V*D_proj*V'\n % and add together to get X - V*(D-Dproj)*V'\n \n X = X - V*diag(diag(D)-D_proj)*V';\n \n if SP, X = sparse(X); end\nelse\n if SP, [nrm,cnt] = normest(X,1e-3);\n else nrm = norm(X); \n end\n if nrm > q\n v = Inf;\n end\nend\n\n\nfunction [ v, X ] = proj_spectral_svds_q( q,eproj, X, t )\npersistent oldRank\npersistent nCalls\npersistent V\nif nargin == 0, oldRank = []; v = nCalls; nCalls = []; V=[]; return; end\nif isempty(nCalls), nCalls = 0; end\nSP = issparse(X);\nv = 0;\nif nargin > 3 && t > 0,\n \n if isempty(oldRank), K = 10;\n else, K = oldRank + 2;\n end\n [M,N] = size(X);\n \n ok = false;\n opts = [];\n opts.tol = 1e-10; % the default in svds\n opt = [];\n opt.eta = eps; % makes compute_int slow\n opt.delta = 10*opt.eta;\n while ~ok\n K = min( [K,M,N] );\n if exist('lansvd','file')\n [U,D,V] = lansvd(X,K,'L',opt );\n else\n [U,D,V] = svds(X,K,'L',opts);\n end\n ok = (min(abs(diag(D))) < q) || ( K == min(M,N) );\n if ok, break; end\n K = 2*K;\n if K > 10\n opts.tol = 1e-6;\n end\n if K > 40\n opts.tol = 1e-4;\n end\n if K > 100\n opts.tol = 1e-3;\n end\n if K > min(M,N)/2\n [U,D,V] = svd( full(X), 'econ' );\n ok = true;\n end\n end\n oldRank = length(find(abs(diag(D)) > q));\n \n [dum,D_proj] = eproj(diag(D),q);\n X = X - U*diag(diag(D)-D_proj)*V';\n \n if SP, X = sparse(X); end\nelse\n if SP, [nrm,cnt] = normest(X,1e-3);\n else nrm = norm(X); \n end\n if nrm > q\n v = Inf;\n end\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/prox_0.m", "content": "function op = prox_0\n\n%PROX_0 The zero proximity function:\n% OP = PROX_0 returns an implementation of the function OP(X) = 0. Use\n% this function to specify a model with no nonsmooth component. It is\n% identical to both PROJ_Rn and SMOOTH_CONSTANT( 0 ).\n% Dual: proj_0.m\n\nop = smooth_constant( 0 );\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/prox_Sl1.m", "content": "function op = prox_Sl1( lambda )\n%PROX_SL1 Sorted/Ordered L1 norm.\n% OP = PROX_L1( lambda ) implements the nonsmooth function\n% OP(X) = sum(lambda.*sort(abs(X),'descend'))\n% where lambda is strictly positive and sorted in decreasing order,\n% in which case this function is a norm (and hence convex).\n% If lambda is a scalar, it will be expanded to all elements, but in this\n% case it is equivalent to the (scaled) usual l1 norm.\n% \n% Notice: this function uses mex files. Some pre-compiled binaries\n% for common systems are included; if these do not work for you,\n% then please install yourself. In the mexFiles/ subdirectory,\n% run the file \"makeMex.m\"\n% Reference:\n% http://www-stat.stanford.edu/~candes/OrderedL1/\n% \"Statistical Estimation and Testing via the Ordered L1 Norm\"\n% by M. Bogdan, E. van den Berg, W. Su, and E. J. Candès\n% 2013\n%\n% See also prox_l1.m, makeMex.m\n\nif nargin == 0,\n\tlambda = 1;\nelseif ~isnumeric( lambda ) || ~isreal( lambda ) || any( lambda <= 0 ) \n\terror( 'Argument lambda must have all positive entries.' );\nend\nif ~issorted(flipud(lambda(:)))\n error( 'Argument lambda must be sorted in decreasing order.');\nend\nif numel(lambda)==1\n warning('TFOCS:prox_SL1','When lambda is a scalar, we recommend prox_l1.m instead pf prox_SL1.m');\nend\n\n\n% The mex file is in the child directory mexFiles/\n% Check for its existence. First, add the right paths\naddpath(fullfile(tfocs_where,'mexFiles'));\nif 3 ~= exist('proxAdaptiveL1Mex','file')\n makeMex;\n % check that it worked\n if 3 ~= exist('proxAdaptiveL1Mex','file')\n disp('Compilation of mex files for prox_SL1.m failed; please report this error');\n end\nend\n\nf = @(x) sum( lambda(:) .* sort(abs(x(:)), 'descend') );\nprox_f = @(x,t) proxOrderedL1(x,t.*lambda);\n\nop = tfocs_prox( f, prox_f , 'vector' ); % Allow vector stepsizes\n\n\nend\n\n% -- subroutines --\nfunction x = proxOrderedL1(y,lambda)\n % Normalization\n lambda = lambda(:);\n y = y(:);\n sgn = sign(y);\n [y,idx] = sort(abs(y),'descend');\n \n % Simplify the problem\n k = find(y > lambda,1,'last');\n \n % Compute solution and re-normalize\n n = numel(y);\n x = zeros(n,1);\n \n if (~isempty(k))\n v1 = y(1:k);\n if numel(lambda) > 1\n v2 = lambda(1:k);\n else\n v2 = lambda*ones(k,1); % if lambda is a scalar, implicity make it lambda*ones(size(y))\n end\n v = proxAdaptiveL1Mex(v1,v2);\n x(idx(1:k)) = v;\n end\n \n % Restore signs\n x = sgn .* x;\nend\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/prox_boxDual.m", "content": "function op = prox_boxDual(l,u,scale)\n%PROX_BOXDUAL Dual function of box indicator function { l <= x <= u }\n%PROX_BOXDUAL(l,u) Dual function of box indicator function { l <= x <= u }\n% If l or u is the empty matrix [], then the constraint is not\n% enforced (e.g. PROJ_BOXDUAL([],1) is the set { x <= 1 },\n% and PROJ_BOXDUAL(0) is the set { 0 <= x } )\n% The parameters l and u may also be vectors or matrixes\n% of the same size as x.\n%\n% OP = PROJ_BOXDUAL returns an implementation of this projection.\n%\n% ... = PROJ_BOXDUAL( l, u, -1 )\n% will return an implementation of the projection composed\n% with the operator x --> -x. This is the form that TFOCS\n% expects for the \"conjnegeF\" term.\n%\n% See also proj_box, proj_Rplus\n\n% the dual itself if g(x) = max( u*x, l*x )\n% = { u*x, if x>=0; v*x if x<0 }\n% so the prox of the dual is\n% prox_{t*g}(x) = { x - t*u, (value is u*x), if x >= u*t\n% { x - t*l, (value is l*x), if x <= l*t\n% { 0, (value is 1/t*x^2), otherwise\n\n\nerror(nargchk(1,3,nargin));\nif nargin < 3, scale = 1;\nelse\n if ~isscalar(scale) || ( scale ~= 1 && scale ~= -1 )\n error('\"scale\" must be either +1 or -1');\n end\nend\nif nargin < 2, u = []; end\n% check that l <= u\nif ~isempty(l) && ~isempty(u)\n if ~all( l <= u )\n error('for box constraints, need l <= u ');\n end\nend\nif isempty(l), l = -Inf; end\nif isempty(u), u = Inf; end\n\nop = @(varargin)proj_RplusDual_impl(l,u,scale,varargin{:});\n\nfunction [ v, xOut ] = proj_RplusDual_impl( l, u, scale, x, t )\n if scale ~= 1\n x = scale*x;\n end\nswitch nargin,\n\tcase 4,\n if nargout == 2,\n error( 'This function is not differentiable.' );\n end\n v = sum(sum(max( l.*x, u.*x )));\n\tcase 5,\n xOut = zeros( size(x) );\n if ~isempty(l)\n indx1 = find( x < t*l );\n if isscalar(l)\n xOut( indx1 ) = x( indx1 ) - t*l;\n else\n xOut( indx1 ) = x( indx1 ) - t*l( indx1 );\n end\n end\n if ~isempty(u)\n indx2 = find( x > t*u );\n if isscalar(u)\n xOut( indx2 ) = x( indx2 ) - t*u;\n else\n xOut( indx2 ) = x( indx2 ) - t*u( indx2 );\n end\n end\n % and implicity, if l/t < x < u/t, then xOut is 0\n \n v = sum(sum( max( l.*xOut, u.*xOut ) )); \n \n % Bug fixed 3/23/2016, thanks to Carl Nettelblad for noticing\n if scale ~= 1\n xOut = scale*xOut;\n end\n\totherwise,\n\t\terror( 'Wrong number of arguments.' );\nend\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/prox_diag.m", "content": "function op = prox_diag( funcF, funcG, n )\n\n%PROX_DIAG Shift a proximity/projection function\n% PROX_DIAG = PROX_DIAG( funcF, funcG, n )\n% returns an implementation of the proximity operator\n% defined by F( x(1:n) ) + G( x(n+1:end) )\n%\n% For now, both F and G must accept vector inputs (not matrices)\n% (and this only works for 2 functions; to apply to 3 or more functions,\n% repeatedly apply this function recursively).\n%\n\n% Introduced June 2016\n\nerror(nargchk(3,3,nargin));\nif ~isa( funcF, 'function_handle' ),\n error( 'The first argument must be a function handle.' );\nelseif ~isa( funcG, 'function_handle' ), \n error( 'The second argument must be a function handle.' );\nend\nop = @(varargin)prox_diag_impl( funcF, funcG, n, varargin{:} );\n\n\nfunction [ v, x ] = prox_diag_impl( prox_f, prox_g, n, x, t )\n\n if nargin < 4,\n error( 'Not enough arguments.' );\n end\n if nargin == 5,\n if numel(t) ~= 1\n error('The stepsize must be a scalar'); \n end\n [v1,x(1:n)] = prox_f(x(1:n),t);\n [v2,x(n+1:end)] = prox_g(x(n+1:end),t);\n v = v1 + v2;\n elseif nargout == 2,\n error( 'This function is not differentiable.' );\n end\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2015 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/prox_dualize.m", "content": "function op = prox_dualize( dualProx, NEG )\n%PROX_DUALIZE Define a proximity function by its dual\n% OP = PROX_DUALIZE( dualOp ) returns an operator implementing the \n% dual of the function dualProx. You can verify they are duals\n% via test_proxPair( dualOp, OP ).\n%\n% OP = PROX_DUALIZE( dualOp, 'neg' )\n% OP = PROX_DUALIZE( dualOp, 'negative' )\n% will return the scaled dual of dualOp; that is,\n% dualOp(x) and OP(-x) are duals.\n% The negative is useful because this is the version TFOCS\n% expects for the SCD formulation.\n% For 1-homogenous functions (e.g. norms), this has no effect,\n% since ||x|| = ||-x||.\n%\n% Warning: if you can calculate the dual function explicitly,\n% it is likely more computationally efficient to do so, rather\n% than rely on this code. This code requires some tricks, some\n% of which can sometimes be expensive; also, it will call dualOp\n% so it is at least as slow as dualOp; and it may require high\n% precision from dualOp. This code can break down if dualOp\n% is not numerically stable.\n\nif nargin < 2, NEG = ''; end\nif strcmpi(NEG,'neg') || strcmpi(NEG,'negative')\n op = @(varargin)dualize(dualProx,-1,varargin{:} );\nelse\n op = @(varargin)dualize(dualProx,1,varargin{:} );\nend\n\nfunction [ v, x ] = dualize( dualProx, scale, x, t )\nvec = @(x) x(:);\nmyDot = @(x,y) x(:)'*y(:);\nif scale == -1\n x = -x;\nend\nswitch nargin,\n case 3\n if nargout == 2,\n error( 'This function is not differentiable.' );\n else\n % This case is a bit tricky...\n % If the function is non-differentiable, then standard exact\n % penalty function results tell us that for a sufficiently\n % small stepsize, we can remove the effect of smoothing.\n % In other cases, we don't have an exact value, but we hope this\n % is a reasonable approximation.\n \n% t = 1e-15;\n% [~,x2] = dualProx( x/t, 1/t );\n% v = myDot(x,x2) - dualProx( x2 );\n \n % However, some functions break down when 1/t is huge\n % So we will slowly decrease it\n vOld = Inf;\n t = 1e-5;\n ok = false;\n iter = 0;\n while ~ok && t > eps\n [~,x2] = dualProx( x/t, 1/t );\n v = myDot(x,x2) - dualProx( x2 );\n if abs(v-vOld)/max( 1e-10, abs(v) ) < 1e-4\n % due to exact penalty, we expect that\n % for t < t_cutoff, v=vOld up to machine accuracy\n ok = true;\n else\n t = t/10;\n vOld = v;\n iter = iter + 1;\n %fprintf('%d and v is %.2e\\n', iter, v );\n end\n end\n \n end\n \n case 4\n % This is exact.\n [ignore,x2] = dualProx( x/t, 1/t );\n x1 = x - t*x2; % Moreau's identity, equation (8.1) in the user guide\n v = myDot(x1,x2) - dualProx( x2 );\n \n % If we think it is an indicator function, then round down to zero:\n if abs(v) < 100*eps,\n v = 0;\n end\n x = scale*x1;\n \n otherwise,\n error( 'Not enough arguments.' );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/prox_hinge.m", "content": "function op = prox_hinge( q , r, y)\n\n%PROX_HINGE Hinge-loss function.\n% OP = PROX_HINGE( q , r, y ) implements the nonsmooth function\n% OP(X) = q * sum( max( r - y.*x, 0 ) ).\n% Q is optional; if omitted, Q=1 is assumed. But if Q is supplied,\n% then it must be a positive real scalar.\n% R is also optional; if omitted, R = 1 is assumed. R may be any real number.\n% Y is also optional; if omitted, Y = 1 is assumed. Y may be any scalar\n% or vector of the same size as X\n% Dual: prox_hingeDual.m\n%\n% See also PROX_HINGEDUAL\n\nif nargin < 3\n y = [];\nelseif ~isempty(y) && ( ~isnumeric(y) || ~isreal(y) )\n error( 'Argument 3 must be a real vector');\nend\nif nargin < 2\n\tr = 1;\nelseif ~isnumeric( r ) || ~isreal( r ) %|| numel( r ) ~= 1\n\terror( 'Argument 2 must be real.' );\nend\nif nargin < 1\n\tq = 1;\nelseif ~isnumeric( q ) || ~isreal( q ) || numel( q ) ~= 1 || q <= 0,\n\terror( 'Argument 1 must be positive.' );\nend\n\nif isempty(y) \n op = tfocs_prox( @(x)hinge(x,r,q), @(x,t)prox_hinge(x,t,r,q) );\nelse\n ry = r./y;\n op = tfocs_prox( @(x)hingeY(x,r,q,y), @(x,t)prox_hingeY(x,t,r,q,ry,y) );\nend\n\n\n% -- the actual functions --\n\nfunction v = hingeY(x,r,q,y)\n if ~isscalar(r), assert( numel(r) == numel(x),'r is wrong size' ); end\n if ~isscalar(y), assert( numel(y) == numel(x),'y is wrong size'); end\n v = q*sum( max( r(:) - y(:).*x(:), 0 ) );\nend\nfunction v = hinge(x,r,q)\n if ~isscalar(r), assert( numel(r) == numel(x),'r is wrong size' ); end\n v = q*sum( max( r(:) - x(:), 0 ) );\nend\n\n\n% PROX_F( Y, t ) = argmin_X F(X) + 1/(2*t)*|| X - Y ||^2\nfunction x = prox_hinge(x,t,r,q) \n tq = t * q;\n x = r + (x-r).*( x > r ) + (x + tq - r).*( x + tq < r );\nend\n%{\n in the q = r = t = 1 case, the prox is:\nprox(x) = { x, if x > 1\n 1, if x <= 1, and x > 0\n x + q, if x <= 0\n%}\n\nfunction x = prox_hingeY(x,t,r,q,ry,y) \n tq = t * q;\n x = ry + (x-ry).*( y.*x > r ) + (x + tq*y - ry).*( y.*(x + tq*y) < r );\nend\n\n\nend\n\n% Added Feb, 2011; modified Dec, 2011\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/prox_hingeDual.m", "content": "function op = prox_hingeDual( q , r, y)\n\n%PROX_HINGEDUAL Dual function of the Hinge-loss function.\n% OP = PROX_HINGEDUAL( q , r , y) implements the nonsmooth function\n% that is dual to the Hinge-loss function f, where \n% f(x) = q * sum( max( r - y.*x, 0 ) ).\n% Q is optional; if omitted, Q=1 is assumed. But if Q is supplied,\n% then it must be a positive real scalar.\n% R is also optional; if omitted, R = 1 is assumed. R may be any real scalar.\n%\n% There is a simple form for the dual and its proximity operator.\n% In the case q = r = 1, the dual is:\n% f^*(y) = { +y, if y >= -1 and y <= 0\n% { +Inf, otherwise\n%\n% See also PROX_HINGE\n%\n% Note: if the primal is PROX_HINGE( q, r, y )\n% then TFOCS expects conjnegF to be PROX_HINGEDUAL( q, r, -y)\n% (the -y is because the conjugate should be composed\n% with the function x --> -x )\n\nif nargin < 3\n y = [];\nelseif ~isempty(y) && ( ~isnumeric(y) || ~isreal(y) )\n error( 'Argument 3 must be a real vector');\nend\nif nargin < 2 || isempty(r)\n\tr = 1;\nelseif ~isnumeric( r ) || ~isreal( r ) %|| numel( r ) ~= 1\n\terror( 'Argument must be real.' );\nend\nif nargin < 1 || isempty(q)\n\tq = 1;\nelseif ~isnumeric( q ) || ~isreal( q ) || numel( q ) ~= 1 || q <= 0,\n\terror( 'Argument must be positive.' );\nend\n\nif isempty(y)\n if isscalar(r)\n sumXR = @(x) r*sum(x);\n else\n sumXR = @(x) x'*r;\n end\n op = tfocs_prox( @(x)hingeDual(x,q,sumXR), @(x,t)prox_hingeDual(x,t,r,q) );\nelse\n ry = r./y;\n qy = -q.*abs(y);\n sy = sign(y);\n if isscalar(r) && isscalar( y )\n sumXR = @(x) ry*sum(x);\n else\n sumXR = @(x) x'*ry;\n end\n op = tfocs_prox( @(x)hingeDualY(x,sy,qy,sumXR), @(x,t)prox_hingeDualY(x,t,sy,ry,qy) );\nend\n\n\nfunction v = hingeDual(x,q,sumXR)\n feasible = ( x >= -q & x <= 0 );\n if any( ~feasible )\n v = Inf;\n return;\n end\n% v = sum( x*r );\n v = sumXR( x );\n% v = sum( x*r.*( feasible ) + Inf.*( ~feasible ) ); % 0*Inf leads to NaN. bad!\nend\n\nfunction v = hingeDualY(x,sy,qy,sumXR)\n% feasible = ( sign(y).*x >= -q.*abs(y) & sign(y).*x <= 0 );\n feasible = ( sy.*x >= qy & sy.*x <= 0 ); % using precomputed vectors\n if any( ~feasible )\n v = Inf;\n return;\n end\n% v = sum( x.*ry );\n v = sumXR(x);\nend\n\n\n% PROX_F( Y, t ) = argmin_X F(X) + 1/(2*t)*|| X - Y ||^2\nfunction x = prox_hingeDual(x,t,r,q) \n x = max( min( x - t*r, 0), -q );\nend\nfunction x = prox_hingeDualY(x,t,sy,ry,qy) \n x = sy.*max( min( sy.*(x - t*ry), 0), qy );\nend\n\n\nend\n\n% Added Feb, 2011; support for y added Dec 2011\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/prox_l1.m", "content": "function op = prox_l1( q )\n\n%PROX_L1 L1 norm.\n% OP = PROX_L1( q ) implements the nonsmooth function\n% OP(X) = norm(q.*X,1).\n% Q is optional; if omitted, Q=1 is assumed. But if Q is supplied,\n% then it must be a positive real scalar (or must be same size as X).\n% Dual: proj_linf.m\n\n% Update Feb 2011, allowing q to be a vector\n% Update Mar 2012, allow stepsize to be a vector\n\nif nargin == 0,\n\tq = 1;\nelseif ~isnumeric( q ) || ~isreal( q ) || any( q < 0 ) || all(q==0) %|| numel( q ) ~= 1\n if q==0\n op = prox_0;\n warning('TFOCS:zeroQ','q=0 so returning the proximal operator for the zero function');\n return;\n else\n error( 'Argument must be positive.' );\n end\nend\n\n% The following commented code works fine in Matlab,\n% but doesn't work in Octave due to different conventions on nesting\n% functions. We keep in in the comments since it may be useful\n% as an example of building a prox function\n\n% op = tfocs_prox( @f, @prox_f , 'vector' ); % Allow vector stepsizes\n% function v = f(x)\n% v = norm( q(:).*x(:), 1 );\n% end\n% function x = prox_f(x,t) \n% tq = t .* q; % March 2012, allowing vectorized stepsizes\n% s = 1 - min( tq./abs(x), 1 );\n% x = x .* s;\n% end\n% end % end of main file\n\n% This is Matlab and Octave compatible code\nop = tfocs_prox( @(x)f(q,x), @(x,t)prox_f(q,x,t) , 'vector' );\nend\n\n% These are now subroutines, that are NOT in the same scope\nfunction v = f(qq,x)\n v = norm( qq(:).*x(:), 1 );\nend\n\nfunction x = prox_f(qq,x,t) \n tq = t .* qq; % March 2012, allowing vectorized stepsizes\n s = 1 - min( tq./abs(x), 1 );\n x = x .* s;\nend\n\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/prox_l1_and_sum.m", "content": "function op = prox_l1_and_sum( q, b, nColumns, zeroID, useMatricized )\n\n%PROX_L1_AND_SUM L1 norm with sum(X)=b constraints\n% OP = PROX_L1_AND_SUM( Q ) implements the nonsmooth function\n% OP(X) = norm(Q.*X,1) with constraints \n% Q is optional; if omitted, Q=1 is assumed. But if Q is supplied,\n% then it must be a positive real scalar (or must be same size as X).\n%\n% OP = PROX_L1_AND_SUM( Q, B )\n% includes the constraints that sum(X(:)) == B\n% (Default: B=1)\n%\n% OP = PROX_L1_AND_SUM( Q, B, nColumns )\n% takes the input vector X and reshapes it to have nColumns\n% and applies this prox to every column\n%\n% OP = PROX_L1_AND_SUM( Q, B, nColumns, zeroID )\n% if zeroID == true (it is false by default)\n% then after reshaping X, enforces that X(i,i) = 0\n%\n% OP = PROX_L1_AND_SUM( Q, B, nColumns, zeroID, useMatricized )\n% toggles between two algorithms if nColumns > 1.\n% If useMatricized is true (default), runs a variant algorithm\n% that is a bit faster (output should be the same).\n%\n% Often useful for sparse subpsace clustering (SSC)\n% See, e.g., https://github.com/stephenbeckr/SSC\n\n% Nov 2017, Stephen.Becker@Colorado.edu\n\nif nargin == 0\n q = 1;\nelseif ~isnumeric( q ) || ~isreal( q ) || any( q < 0 ) || all(q==0) || numel( q ) ~= 1\n error( 'Argument must be positive.' );\nend\nif nargin < 2 || isempty(b), b = 1; else, assert( numel(b) == 1 ); end\nif nargin < 3 || isempty( nColumns), nColumns = 1;\nelse assert( numel(nColumns) == 1 && nColumns >= 1 ); end\nif nargin < 4 || isempty( zeroID ), zeroID = false; end\nif nargin < 5 || isempty( useMatricized ), useMatricized = true; end\n\nif zeroID && nColumns == 1\n warning('TFOCS:prox_l1_and_sum:zeroDiag',...\n 'You requested enforcing zero diagonals but did not set nColumns>1 which is probably a mistake');\nend\n\n% This is Matlab and Octave compatible code\nop = tfocs_prox( @(x)f(q,x), @(x,t)prox_f(q,b,nColumns,zeroID,useMatricized,x,t) , 'vector' );\nend\n\n% These are now subroutines, that are NOT in the same scope\nfunction v = f(qq,x)\n v = norm( qq(:).*x(:), 1 );\nend\n\nfunction x = prox_f(qq,b,nColumns,zeroID,useMatricized,x,t) % stepsize is t\n tq = t .* qq; % March 2012, allowing vectorized stepsizes\n \n % 3/15/18, adding:\n if 3~=exist('shrink_mex','file')\n addpath( fullfile( tfocs_where, 'mexFiles' ) );\n end\n if 3==exist('shrink_mex','file') \n shrink = @(x) shrink_mex(x,tq);\n shrink_nu = @(x,nu) shrink_mex(x,tq,nu);\n else\n % this is fast, but requires more memory\n shrink = @(x) sign(x).*max( abs(x) - tq, 0 );\n shrink_nu = @(x,nu) shrink(x-nu);\n end\n \n if zeroID && nColumns > 1\n X = reshape( x, [], nColumns );\n n = size(X,1);\n if nColumns > n\n error('Cannot zero out the diagonal if columns > rows');\n end\n if useMatricized\n Xsmall = zeros( n-1, nColumns );\n for col = 1:nColumns\n ind = [1:col-1,col+1:size(X,1)];\n Xsmall(:,col) = X(ind,col);\n end\n Xsmall = prox_l1sum_matricized( Xsmall, tq, b, shrink_nu );\n for col = 1:nColumns\n X(col,col) = 0;\n ind = [1:col-1,col+1:size(X,1)];\n X(ind,col) = Xsmall(:,col);\n end\n else\n for col = 1:nColumns\n ind = [1:col-1,col+1:size(X,1)];\n x = X(ind,col);\n x = prox_l1sum( x, tq, b, shrink_nu );\n X(col,col) = 0;\n X(ind,col) = x;\n end\n end\n x = X(:);\n else\n if nColumns > 1\n X = reshape( x, [], nColumns );\n \n if useMatricized\n X = prox_l1sum_matricized( X, tq, b, shrink_nu );\n else\n for col = 1:nColumns\n X(:,col) = prox_l1sum( X(:,col), tq, b, shrink_nu );\n end\n end\n x = X(:);\n else\n x = prox_l1sum( x, tq, b, shrink_nu );\n end\n end\nend\n\n\n\n% Main algorithmic part: if x0 is length n, takes O(n log n) time\nfunction x = prox_l1sum( x0, lambda, b, shrink_nu )\n\n brk_pts = sort( [x0-lambda;x0+lambda], 'descend' );\n\n xnu = @(nu) shrink_nu( x0 , nu );\n h = @(x) sum(x) - b; % want to solve h(nu) = 0\n\n % Bisection\n lwrBnd = 0;\n uprBnd = length(brk_pts) + 1;\n iMax = ceil( log2(length(brk_pts)) ) + 1;\n PRINT = false; % set to \"true\" for debugging purposes\n if PRINT\n dispp = @disp;\n printf = @fprintf;\n else\n dispp = @(varargin) 1;\n printf = @(varargin) 1;\n end\n dispp(' ');\n for i = 1:iMax\n if uprBnd - lwrBnd <= 1\n dispp('Bounds are too close; breaking');\n break;\n end\n j = round( (lwrBnd+uprBnd)/2 );\n %printf('j is %d (bounds were [%d,%d])\\n', j, lwrBnd,uprBnd ); %\n if j==lwrBnd\n dispp('j==lwrBnd, so increasing');\n j = j+1;\n elseif j==uprBnd\n dispp('j==uprBnd, so increasing');\n j = j-1;\n end\n \n a = brk_pts(j);\n x = xnu(a); % the prox\n p = h(x);\n \n if p > 0\n uprBnd = j;\n elseif p < 0\n lwrBnd = j;\n end\n if PRINT\n % Don't rely on redefinition of printf,\n % since then we would still calculate find(~x)\n % which is slow\n printf('i=%2d, a = %6.3f, p = %8.3f, zeros ', i, a, p );\n if n < 100, printf('%d ', find(~x) ); end\n printf('\\n');\n end\n end\n \n % Now, determine linear part, which we infer from two points.\n % If lwr/upr bounds are infinite, we take special care\n % e.g., we make a new \"a\" slightly lower/bigger, and use this\n % to extract linear part.\n if lwrBnd == 0\n a2 = brk_pts( uprBnd );\n a1 = a2 - 10; % arbitrary\n aBounds = [a1,a2];\n elseif uprBnd == length(brk_pts) + 1\n a1 = brk_pts( lwrBnd );\n a2 = a1 + 10; % arbitrary\n aBounds = [a1,a2];\n else\n % In general case, we can infer linear part from the two break points\n a1 = brk_pts( lwrBnd );\n a2 = brk_pts( uprBnd );\n aBounds = [a1,a2];\n end\n \n % Now we have the support, find exact value\n x = xnu(( aBounds(1)+aBounds(2))/2 ); % to find the support\n supp = find(x);\n\n sgn = sign(x);\n nu = ( sum(x0(supp) - lambda*sgn(supp) ) - b )/length(supp);\n \n x = xnu( nu );\n\nend\n\n\n% This variant can handle several columns at once,\n% and it takes exactly log2(n) iterations, as it doesn't stop early\n% since different columns might stop at different steps and that's\n% not easy to detect efficiently.\nfunction x = prox_l1sum_matricized( x0, lambda, b, shrink_nu )\n\n brk_pts = sort( [x0-lambda;x0+lambda], 'descend' );\n \n \n xnu = @(nu) shrink_nu( x0 , nu );\n \n h = @(x) sum(x) - b; % want to solve h(nu) = 0\n\n nCols = size( x0, 2 ); % allow matrices\n LDA = size( brk_pts, 1 );\n offsets = (0:nCols-1)*LDA;%i.e., [0, LDA, 2*LDA, ... ];\n \n lwrBnd = zeros(1,nCols);\n uprBnd = (length(brk_pts) + 1)*ones(1,nCols);\n iMax = ceil( log2(length(brk_pts)) ) + 1;\n\n for i = 1:iMax\n\n j = round(mean([lwrBnd;uprBnd]));\n ind = find( j==lwrBnd );\n j( ind ) = j( ind ) + 1;\n ind = find( j==uprBnd );\n j( ind ) = j( ind ) - 1;\n \n a = brk_pts(j+offsets); % need the offsets to correct it here\n x = xnu(a); % the prox\n p = h(x);\n \n ind = find( p > 0 );\n uprBnd(ind) = j(ind);\n ind = find( p < 0 );\n lwrBnd(ind) = j(ind);\n\n end\n\n \n [a1,a2] = deal( zeros(1,nCols) );\n ind = find( lwrBnd == 0 );\n a2(ind) = brk_pts( uprBnd(ind) + offsets(ind) );\n a1(ind) = a2(ind) - 10;\n ind2 = ind;\n \n ind = find( uprBnd == size(brk_pts,1) + 1 );\n a1(ind) = brk_pts( lwrBnd(ind) + offsets(ind) );\n a2(ind) = a1(ind) + 10;\n \n indOther = setdiff( 1:nCols, [ind2,ind] );\n a1(indOther) = brk_pts( lwrBnd(indOther) + offsets(indOther) );\n a2(indOther) = brk_pts( uprBnd(indOther) + offsets(indOther) );\n \n a = mean( [a1;a2] );\n x = xnu( a );\n \n nu = zeros(1,nCols);\n sgn = sign(x);\n for col = 1:nCols\n supp = find( sgn(:,col) );\n nu(col) = ( sum(x0(supp,col) - lambda*sgn(supp,col) ) - b )/length(supp);\n end\n x = xnu( nu );\n\nend\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/prox_l1_deadzone.m", "content": "function op = prox_l1_deadzone( q, epsilon )\n\n%PROX_L1_DEADZONE L1 norm with deadzone [-eps,eps]\n% OP = PROX_L1_DEADZONE( q, eps ) implements the nonsmooth function\n% OP(X) = q*sum_i max(0,x-eps)+max(0,-x-eps) = q*sum_i\n% max(0,|x|-eps)\n% Q is optional; if omitted, Q=1 is assumed. But if Q is supplied,\n% then it must be a positive real scalar (or must be same size as X).\n%\n\n% New March 2 2016\n\nif nargin == 0,\n\tq = 1;\nelseif ~isnumeric( q ) || ~isreal( q ) || any( q < 0 ) || all(q==0) %|| numel( q ) ~= 1\n if q==0\n op = prox_0;\n warning('TFOCS:zeroQ','q=0 so returning the proximal operator for the zero function');\n return;\n else\n error( 'Argument must be positive.' );\n end\nend\n\n% This is Matlab and Octave compatible code\nop = tfocs_prox( @(x)f(q, epsilon,x), @(x,t)prox_f(q, epsilon,x,t) , 'vector' );\nend\n\n% These are now subroutines, that are NOT in the same scope\nfunction v = f(qq,epsilon, x)\n v = sum( qq(:).*max(0,abs(x(:))-epsilon), 1 );\nend\n\nfunction x = prox_f(qq,epsilon, x,t) \n% p = x if |x| tq\n% i.e., if |x|>eps, p = sign(x).*max( |x|-tq, eps )\n tq = t .* qq; \n x = sign(x).*( abs(x).*( abs(x)= epsilon) );\nend\n\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/prox_l1_mat.m", "content": "function op = prox_l1_mat( q, nColumns, zeroID, useMatricized )\n\n%PROX_L1_MAT L1 norm, matricized in a special way\n% OP = PROX_L1_MAT( Q ) implements the nonsmooth function\n% OP(X) = norm(Q.*X,1) with constraints \n% Q is optional; if omitted, Q=1 is assumed. But if Q is supplied,\n% then it must be a positive real scalar (or must be same size as X).\n%\n% OP = PROX_L1_MAT( Q, nColumns )\n% takes the input vector X and reshapes it to have nColumns\n% and applies this prox to every column\n%\n% OP = PROX_L1_MAT( Q, nColumns, zeroID )\n% if zeroID == true (it is false by default)\n% then after reshaping X, enforces that X(i,i) = 0\n%\n% OP = PROX_L1_MAT( Q, nColumns, zeroID, useMatricized )\n% toggles between two algorithms if nColumns > 1.\n% If useMatricized is true (default), runs a variant algorithm\n% that is a bit faster (output should be the same).\n%\n% Often useful for sparse subpsace clustering (SSC)\n% See, e.g., https://github.com/stephenbeckr/SSC\n\n% Mar 2018, Stephen.Becker@Colorado.edu\n\nif nargin == 0\n q = 1;\nelseif ~isnumeric( q ) || ~isreal( q ) || any( q < 0 ) || all(q==0) || numel( q ) ~= 1\n error( 'Argument must be positive.' );\nend\nif nargin < 2 || isempty( nColumns), nColumns = 1;\nelse assert( numel(nColumns) == 1 && nColumns >= 1 ); end\nif nargin < 3 || isempty( zeroID ), zeroID = false; end\nif nargin < 4 || isempty( useMatricized ), useMatricized = true; end\n\nif zeroID && nColumns == 1\n warning('TFOCS:prox_l1_mat:zeroDiag',...\n 'You requested enforcing zero diagonals but did not set nColumns>1 which is probably a mistake');\nend\n\n% This is Matlab and Octave compatible code\nop = tfocs_prox( @(x)f(q,x), @(x,t)prox_f(q,nColumns,zeroID,useMatricized,x,t) , 'vector' );\nend\n\n% These are now subroutines, that are NOT in the same scope\nfunction v = f(qq,x)\n v = norm( qq(:).*x(:), 1 );\nend\n\nfunction x = prox_f(qq,nColumns,zeroID,useMatricized,x,t) % stepsize is t\n tq = t .* qq; % March 2012, allowing vectorized stepsizes\n \n % 3/15/18, adding:\n if 3~=exist('shrink_mex','file')\n addpath( fullfile( tfocs_where, 'mexFiles' ) );\n end\n if 3==exist('shrink_mex','file') \n shrink = @(x) shrink_mex(x,tq);\n else\n % this is fast, but requires more memory\n shrink = @(x) sign(x).*max( abs(x) - tq, 0 );\n end\n \n if zeroID && nColumns > 1\n X = reshape( x, [], nColumns );\n n = size(X,1);\n if nColumns > n\n error('Cannot zero out the diagonal if columns > rows');\n end\n if useMatricized\n Xsmall = zeros( n-1, nColumns );\n for col = 1:nColumns\n ind = [1:col-1,col+1:size(X,1)];\n Xsmall(:,col) = X(ind,col);\n end\n Xsmall = shrink( Xsmall);\n for col = 1:nColumns\n X(col,col) = 0;\n ind = [1:col-1,col+1:size(X,1)];\n X(ind,col) = Xsmall(:,col);\n end\n else\n for col = 1:nColumns\n ind = [1:col-1,col+1:size(X,1)];\n x = X(ind,col);\n x = shrink( x);\n X(col,col) = 0;\n X(ind,col) = x;\n end\n end\n x = X(:);\n else\n if nColumns > 1\n X = reshape( x, [], nColumns );\n \n if useMatricized\n X = shrink( X );\n else\n for col = 1:nColumns\n X(:,col) = shrink( X(:,col));\n end\n end\n x = X(:);\n else\n x = shrink( x );\n end\n end\nend\n\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/prox_l1l2.m", "content": "function op = prox_l1l2( q )\n\n%PROX_L1L2 L1-L2 block norm: sum of L2 norms of rows.\n% OP = PROX_L1L2( q ) implements the nonsmooth function\n% OP(X) = q * sum_{i=1:m} norm(X(i,:),2)\n% where X is a m x n matrix. If n = 1, this is equivalent\n% to PROX_L1\n% Q is optional; if omitted, Q=1 is assumed. But if Q is supplied,\n% then it must be positive and real.\n% If Q is a vector, it must be m x 1, and in this case,\n% the weighted norm OP(X) = sum_{i} Q(i)*norm(X(i,:),2)\n% is calculated.\n%\n% Dual: proj_linfl2.m\n% See also proj_linfl2.m, proj_l1l2.m\n\nif nargin == 0,\n\tq = 1;\n% elseif ~isnumeric( q ) || ~isreal( q ) || numel( q ) ~= 1 || q <= 0,\nelseif ~isnumeric( q ) || ~isreal( q ) || any(q <= 0),\n\terror( 'Argument must be positive.' );\nend\n% In r2007a and later, we can use bsxfun instead of the spdiags trick\nif exist('OCTAVE_VERSION','builtin')\n vr = '2010';\nelse\n vr=version('-release');\nend\nif str2num(vr(1:4)) >= 2007\n op = tfocs_prox( @(x)f(q,x), @(x,t)prox_f_bsxfun(q,x,t) );\nelse\n % the default, using spdiags\n op = tfocs_prox( @(x)f(q,x), @(x,t)prox_f(q,x,t) );\nend\n\nfunction v = f(q,x)\n if numel(q) ~= 1 && size(q,1) ~= size(x,1)\n error('Weight must be a scalar or a column vector');\n end\n v = sum( q.* sqrt(sum(x.^2,2)) );\nend\n\nfunction x = prox_f(q,x,t) \n if nargin < 3,\n error( 'Not enough arguments.' );\n end\n % v = sqrt( tfocs_normsq( x ) );\n v = sqrt( sum(x.^2,2) );\n s = 1 - 1 ./ max( v ./ ( t .* q ), 1 );\n m = length(s);\n x = spdiags(s,0,m,m)*x;\nend\nfunction x = prox_f_bsxfun(q,x,t)\n if nargin < 3,\n error( 'Not enough arguments.' );\n end\n v = sqrt( sum(x.^2,2) );\n s = 1 - 1 ./ max( v ./ ( t .* q ), 1 );\n x = bsxfun( @times, x, s ); % Apr 24 2013. Should be faster\nend\n\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/prox_l1linf.m", "content": "function op = prox_l1linf( q )\n\n%PROX_L1LINF L1-LInf block norm: sum of L-inf norms of rows.\n% OP = PROX_L1LINF( q ) implements the nonsmooth function\n% OP(X) = q * sum_{i=1:m} norm(X(i,:),Inf)\n% where X is a m x n matrix. If n = 1, this is equivalent\n% to PROX_L1\n% Q is optional; if omitted, Q=1 is assumed. But if Q is supplied,\n% then it must be positive and real.\n% If Q is a vector, it must be m x 1, and in this case,\n% the weighted norm OP(X) = sum_{i} Q(i)*norm(X(i,:),Inf)\n% is calculated.\n\nif nargin == 0,\n\tq = 1;\nelseif ~isnumeric( q ) || ~isreal( q ) || any(q <= 0),\n\terror( 'Argument must be positive.' );\nend\nop = tfocs_prox( @(x)f(x,q), @(x,t)prox_f(x,t,q), 'vector' );\nend % end of main function\n\nfunction v = f(x,q)\n if numel(q) ~= 1 && size(q,1) ~= size(x,1)\n error('Weight must be a scalar or a column vector');\n end\n v = sum( q.* max(abs(x),[],2) );\nend\n\nfunction x = prox_f(x,t,q)\n if nargin < 2,\n error( 'Not enough arguments.' );\n end\n \n [n,d] = size(x);\n dim = 2;\n \n % Option 1: explicitly call prox_linf on the rows:\n % slow, but the chief benefit is that it is low memory\n % This would probably be faster if the matrix was transposed before and after\n% for k= 1:n\n% if isscalar(q), qk = q;\n% else, qk = q(k);\n% end \n% x(k,:) = prox_linf_q( qk, x(k,:).', t ).';\n% end\n% return;\n \n\n \n% Option 2: vectorize the call. By far, more efficient than option 1\n\n %s = sort( abs(x), dim, 'descend' );\n %cs = cumsum(s,dim);\n % Since Matlab stores matrices in column-major order, this method is more cache friendly:\n s = sort( abs(x)', q, 'descend' );\n cs = cumsum(s,1)';\n s = s';\n\n s = [s(:,2:end), zeros(n,1)];\n \n\n ndx1 = zeros(n,1);\n ndx2 = zeros(n,1);\n \n if isscalar(q),\n tq = repmat( t*q, n, d );\n else\n tq = repmat( t*q, 1, d );\n end\n %Z = cs - s*diag(1:d);\n % The above may require a lot of memory, so use spdiag or this:\n Z = cs - bsxfun(@times,s,1:d);\n\n Z = ( Z >= tq );\n Z = Z.';\n % now Z is d x n (typically d is large, n is small) \n \n % Not sure how to vectorize the find.\n % One option is to use the [i,j] = find(...) form,\n % but that's also extra work, since we can't just find the \"first\".\n if n > 5\n % avoid the for-loop\n ndx1 = (d+1)-sum(Z)'; % this is the first row with Z > 0\n ndx2 = ndx1;\n ndx2( ndx2 == d+1 ) = Inf;\n ndx1( ndx1 == d+1) = d; % arbitrary, but do this so we don't have a special case later\n else\n % this might be slightly less memory, so keep the code\n for k = 1:n\n % This is why we transposed Z: due to column-major order,\n % find( columnVector ) is faster than find( rowVector )\n ndxk = find( Z(:,k), 1 );\n if ~isempty(ndxk)\n ndx1(k) = ndxk;\n ndx2(k) = ndxk;\n else\n ndx1(k) = 1; % value doesn't matter\n ndx2(k) = Inf;\n end\n end\n end\n indx_cs = sub2ind( [n,d], (1:n)', ndx1 );\n tau = (cs(indx_cs) - tq(:,1))./ndx2;\n tau = repmat( tau, 1, d );\n tau_noZeros = tau;\n tau_noZeros( ~x ) = 1;\n x = x .* ( tau ./ max( abs(x), tau_noZeros ) );\n % Another, but not really better, way is to not do the rempat stuff and do:\n % x = sign(x).*bsxfun( @min, tau, abs(x) );\n \n \nend\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/prox_l1pos.m", "content": "function op = prox_l1pos( q )\n%PROX_L1POS L1 norm, restricted to x >= 0\n% OP = PROX_L1( q ) implements the nonsmooth function\n% OP(X) = norm(q.*X,1) + indicator_{ X >= 0 }\n% Q is optional; if omitted, Q=1 is assumed. But if Q is supplied,\n% then it must be a positive real scalar (or must be same size as X).\n\n% New in v1.0d\n\nif nargin == 0,\n\tq = 1;\nelseif ~isnumeric( q ) || ~isreal( q ) || any( q < 0 ) || all(q==0) %|| numel( q ) ~= 1\n\terror( 'Argument must be positive.' );\nend\n\nop = tfocs_prox( @(x)f(x,q), @(x,t)prox_f(x,t,q), 'vector');\nend\n\nfunction v = f(x,q)\n if any( x(:) < 0 )\n v = Inf;\n elseif isscalar(q)\n v = q*sum( x(:) );\n else\n v = sum( q(:).*x(:) );\n end\nend\n\n% The proximity operator is a simplified version of shrinkage:\nfunction x = prox_f(x,t,q) \n x = max( 0, x - t*q );\nend\n\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/prox_l2.m", "content": "function op = prox_l2( q )\n\n%PROX_L2 L2 norm.\n% OP = PROX_L2( q ) implements the nonsmooth function\n% OP(X) = q * norm(X,'fro').\n% Q is optional; if omitted, Q=1 is assumed. But if Q is supplied,\n% then it must be a positive real scalar.\n% If Q is a vector or matrix of the same size and dimensions as X,\n% then this uses an experimental code to compute the proximity operator\n% of OP(x) = norm( q.*X, 'fro' )\n% In the limit q --> 0, this function acts like prox_0 (aka proj_Rn)\n% Dual: proj_l2.m\n% For the proximity operator of the l2 squared norm (that is, norm(X,'fro')^2)\n% use smooth_quad.m (which can be used in either a smooth gradient-based fashion\n% but also supports proximity usage). Note smooth_quad() is self-dual.\n% See also proj_l2, prox_0, proj_Rn\n\n% Feb '11, allowing for q to be a vector\n% This is complicated, so not for certain\n% A safer method is to use a linear operator to scale the variables\n\nif nargin == 0,\n\tq = 1;\n% elseif ~isnumeric( q ) || ~isreal( q ) || numel( q ) ~= 1 || q <= 0,\nelseif ~isnumeric( q ) || ~isreal( q ) %|| any( q < 0 ) || all(q==0)\n\terror( 'Argument must be positive.' );\nend\nif isscalar(q)\n if any( q <= 0 )\n error('Scaling argument must be positive, real scalar. If q=0, use prox_0 instead');\n end\n op = @(varargin)prox_l2_q( q, varargin{:} );\nelse\n if all(q==0), error('Argument must be nonzero'); end\n warning('TFOCS:experimental','Using experimental feature of TFOCS');\n op = @(varargin)prox_l2_vector( q, varargin{:} );\nend\n\nfunction [ v, x ] = prox_l2_q( q, x, t )\nif nargin < 2,\n\terror( 'Not enough arguments.' );\nend\nv = sqrt( tfocs_normsq( x ) ); \nif nargin == 3,\n\ts = 1 - 1 ./ max( v / ( t * q ), 1 ); \n \n\tx = x * s;\n\tv = v * s; % version A\nelseif nargout == 2,\n\terror( 'This function is not differentiable.' );\nend\nv = q * v; % version A\n\n\n% --------- experimental code -----------------------\nfunction [ v, x ] = prox_l2_vector( q, x, t )\nif nargin < 2,\n\terror( 'Not enough arguments.' );\nend\nv = sqrt( tfocs_normsq( q.*x ) ); % version B\nif nargin == 3,\n%{\n we need to solve for a scalar variable s = ||q.*x|| \n (where x is the unknown solution)\n \n we have a fixed point equation:\n s = f(s) := norm( q.*x_k ) where x_k = x_0/( 1 + t*q/s )\n \n to solve this, we'll use Matlab's \"fzero\" to find the zero\n of the function F(s) = f(s) - s\n \n Clearly, we need s >= 0, since it is ||q.*x||\n \n If q is a scalar, we can solve explicitly: s = q*(norm(x0) - t)\n \n%}\n \n xk = @(s) x./( 1 + t*(q.^2)/s );\n f = @(s) norm( q.*xk(s) );\n% F = @(s) f(s) - s;\n tq2 = t*(q.^2);\n F = @(s) norm( (q.*x)./( 1 + tq2/s ) ) - s;\n [s,sVal] = fzero( F, 1);\n if abs( sVal ) > 1e-4\n error('cannot find a zero'); \n end\n if s <= 0\n x = 0*x;\n else\n x = xk(s);\n end\n v = sqrt( tfocs_normsq( q.*x ) ); % version B\nelseif nargout == 2,\n\terror( 'This function is not differentiable.' );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/prox_linf.m", "content": "function op = prox_linf( q )\n\n%PROX_LINF L-infinity norm.\n% OP = PROX_LINF( q ) implements the nonsmooth function\n% OP(X) = q * norm( X(:), Inf ).\n% Q is optional; if omitted, Q=1 is assumed. But if Q is supplied,\n% then it must be a positive real scalar.\n% Dual: proj_l1.m\n% See also proj_l1\n\nif nargin == 0,\n\tq = 1;\nelseif ~isnumeric( q ) || ~isreal( q ) || numel( q ) ~= 1 || q <= 0,\n\terror( 'Argument must be positive.' );\nend\nop = @(varargin)prox_linf_q( q, varargin{:} );\n\nfunction [ v, x ] = prox_linf_q( q, x, t )\nif nargin < 2,\n error( 'Not enough arguments.' );\nend \ntau = norm( x(:), Inf );\nif nargin == 3,\n s = sort( abs(nonzeros(x)), 'descend' ); % makes one big vector\n \n cs = cumsum(s);\n ndx = find( cs - (1:numel(s))' .* [s(2:end);0] >= t * q, 1 );\n if ~isempty( ndx ),\n tau = ( cs(ndx) - t * q ) / ndx;\n x = x .* ( tau ./ max( abs(x), tau ) );\n else\n x(:) = 0; % adding Oct 21\n tau = 0;\n end\nelseif nargout == 2,\n error( 'This function is not differentiable.' );\nend\nv = q * tau;\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/prox_max.m", "content": "function op = prox_max( q )\n\n%PROX_MAX Entry-wise maximum element.\n% OP = PROX_MAX( q ) implements the nonsmooth function\n% OP(X) = q * max( X(:) ).\n% Q is optional; if omitted, Q=1 is assumed. But if Q is supplied,\n% then it must be a positive real scalar.\n% Dual: proj_simplex.m (at least if X is a vector)\n% See also proj_simplex, prox_linf, prox_linf\n\nif nargin == 0,\n\tq = 1;\nelseif ~isnumeric( q ) || ~isreal( q ) || numel( q ) ~= 1 || q <= 0,\n\terror( 'Argument must be positive.' );\nend\nop = @(varargin)prox_lmax_q( q, varargin{:} );\n\nfunction [ v, x ] = prox_lmax_q( q, x, t )\nif nargin < 2,\n error( 'Not enough arguments.' );\nend \n% We have two options when input x is a matrix:\n% Does the user want to treat it as x(:), \n% Or does the user want to treat each column separately?\n% Most other functions (e.g. l1, linf) treat it as x(:)\n% so that will be the default. However, we leave it\n% as a hard-coded option so that the user can change it\n% if they want.\n% (Note: the dual function, proj_simplex, vectorizes it)\nVECTORIZE = true;\n% right now, we do not have the non-vectorized version implemented.\n\ntau = max( x(:) );\nif nargin == 3,\n s = sort( nonzeros(x), 'descend' );\n% s = sort( x, 'descend' ); % 'nonzeros' does a x(:) operation\n cs = cumsum(s);\n ndx = find( cs - (1:numel(s))' .* [s(2:end);0] >= t * q, 1 );\n if ~isempty( ndx ),\n tau = ( cs(ndx) - t * q ) / ndx;\n x = x .* ( tau ./ max( x, tau ) );\n else\n x(:) = 0; % adding Oct 21\n tau = 0;\n end\nelseif nargout == 2,\n error( 'This function is not differentiable.' );\nend\nv = q * tau;\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/prox_maxEig.m", "content": "function op = prox_maxEig( q )\n%PROX_MAXEIG Maximum eigenvalue of a real symmetric matrix\n% OP = PROX_MAXEIG( q ) implements the nonsmooth function\n% OP(X) = q * max(eig(X)).\n% Q is optional; if omitted, Q=1 is assumed. But if Q is supplied, \n% it must be a real scalar.\n%\n% Note: if X is positive semi-definite, then max(eig(X)) == norm(eig(X),Inf)\n% and hence prox_maxEig(q) is equivalent to prox_spectral(q,'eig')\n%\n% This implementation uses a naive approach that does not exploit any\n% a priori knowledge that X is low rank or sparse. Future\n% implementations of TFOCS will be able to handle low-rank matrices \n% more effectively.\n%\n% Dual: proj_psdUTrace.m\n% See also proj_psdUTrace, prox_max, prox_spectral, proj_nuclear\n\n% Note: it would be possible to use eigs for sparse matrices,\n% but that requires a little bit more work than it did for proj_spectral.\n\nif nargin == 0,\n\tq = 1;\nelseif ~isnumeric( q ) || ~isreal( q ) || numel( q ) ~= 1 %|| q <= 0,\n\terror( 'Argument must be a real scalar.' );\nend\nop = @(varargin)prox_spectral_eig_q( q, varargin{:} );\n\nfunction [ v, X ] = prox_spectral_eig_q( q, X, t )\n% Assumes X is square and symmetric\n% Therefore, all singular values are just absolute values\n% of the eigenvalues.\nif nargin < 2,\n error( 'Not enough arguments.' );\nend\nif size(X,1) ~= size(X,2)\n error('prox_spectral: variable must be a square matrix');\nend\nif norm( X - X', 'fro' ) > 1e-10*norm(X,'fro')\n error('Input must be Hermitian');\nend\nX = (X+X')/2; % Matlab will make it exactly symmetric\n\nif nargin == 3 && t > 0,\n [V,S] = safe_eig(full(X));\n% op = prox_linf(q); % for prox_spectral\n op = prox_max(q);\n s = diag(S);\n [dummy,s] = op(s,t);\n tau = max(s);\n X = V*diag(s)*V';\nelse\n if nargout == 2\n error( 'This function is not differentiable.' );\n end\n tau = max(eig(X));\nend\nv = q * tau; \n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/prox_nuclear.m", "content": "function op = prox_nuclear( q, SVD_STYLE )\n%PROX_NUCLEAR Nuclear norm.\n% OP = PROX_NUCLEAR( q ) implements the nonsmooth function\n% OP(X) = q * sum(svd(X)).\n% Q is optional; if omitted, Q=1 is assumed. But if Q is supplied, \n% it must be a positive real scalar.\n%\n% OP = PROX_NUCLEAR( q, SVD_STYLE )\n% uses a Lanczos-based SVD based on PROPACK\n% if SVD_STYLE == 1 or 'propack',\n%\n% or Matlab's Lanczos-based SVDS is SVD_STYLE == 2 or 'arpack'\n% (calls SVDS, which calls EIGS, which uses ARPACK)\n%\n% or a randomized algorithm based on [1] if SVD_STYLE==3 or \n% 'randomized'\n%\n% otherwise it uses a dense matrix SVD\n%\n% (default: dense matrix SVD if X is dense and less than 300^2\n% elements, otherwise the randomized algorithm)\n%\n% CALLS = PROX_NUCLEAR( 'reset' )\n% resets the internal counter and returns the number of function\n% calls\n%\n% [1] \"Finding Structure with Randomness: Probabilistic Algorithms \n% for Constructing Approximate Matrix Decompositions\"\n% by N. Halko, P. G. Martinsson, and J. A. Tropp. SIAM Review vol 53 2011.\n% http://epubs.siam.org/doi/abs/10.1137/090771806\n%\n% This implementation uses a naive approach that does not exploit any\n% a priori knowledge that X and G are low rank or sparse. Future\n% implementations of TFOCS will be able to handle low-rank matrices \n% more effectively.\n%\n% Dual: proj_spectral.m\n% See also prox_trace.m and proj_spectral.m\n\nif nargin == 1 && strcmpi(q,'reset')\n op = prox_nuclear_impl;\n return;\nend\n\nif nargin == 0\n\tq = 1;\nelseif ~isnumeric( q ) || ~isreal( q ) || numel( q ) ~= 1 || q <= 0\n\terror( 'Argument must be positive.' );\nend\nif nargin < 2, SVD_STYLE = []; end\n\n% clear the persistent values:\nprox_nuclear_impl();\n\nop = @(varargin)prox_nuclear_impl( q, SVD_STYLE, varargin{:} );\n\nend % end of main function\n\nfunction [ v, X ] = prox_nuclear_impl( q, SVD_STYLE, X, t )\npersistent oldRank\npersistent nCalls\npersistent V_save\nif nargin == 0, oldRank = []; v = nCalls; nCalls = []; V_save=[]; return; end\nif isempty(nCalls), nCalls = 0; end\n\nND = (size(X,2) == 1);\n% ND = ~ismatrix(X);\nif ND % X is a vector, not a matrix, so reshape it \n sx = size(X);\n X = reshape( X, prod(sx(1:end-1)), sx(end) );\nend\n\n% Determine which SVD we will use:\n% 0 = dense\n% 1 = PROPACK\n% 2 = ARPACK\n% 3 = Randomized\nif isempty(SVD_STYLE)\n % use a default\n if numel(X) > 300^2 || issparse(X)\n SVD_STYLE = 'randomized';\n else\n SVD_STYLE = 'dense';\n end\nend\nSVD_STYLE = lower(SVD_STYLE);\nswitch SVD_STYLE\n case {1,'propack'}\n if ~exist('lansvd','file')\n warning(...\n 'TFOCS:prox_nuclear',...\n 'Cannot find lansvd.m, required by PROPACK; using default SVD_type');\n SVD_STYLE = 'arpack';\n end\n case {3,'randomized'}\n if ~exist('randomizedSVD','file')\n warning(...\n 'TFOCS:prox_nuclear',...\n 'Cannot find randomizedSVD.m, required by SVD_TYPE; using default SVD_type');\n SVD_STYLE = 'arpack';\n end\nend\n\nopts = struct('tol',1e-10); % 1e-10 is default in svds\n% Define [U,S,V] = svdFcn( X, K, opt )\nswitch SVD_STYLE\n case {1,'propack'}\n % These fields are used by lansvd, otherwise are ignored\n opts.eta = eps; % makes compute_int slow\n %opt.eta = 0; % makes reorth slow\n opts.delta = 10*opts.eta;\n svdFcn = @(X,K,opt) lansvd( X, K, 'L', opt ); % fixed bug, 3/29/15\n case {2,'arpack'}\n svdFcn = @(X,K,opt) svds(X,K,'L',opt);\n case {3,'randomized'}\n nPower = 2; % 2 or 3 is good\n overSample = 20;\n warning('off','randomizedSVD:warmStartLarge');\n svdFcn = @(X,K,opt) randomizedSVD( X, K, K+overSample, nPower, [], struct( 'warmStart', V_save ) );\nend\n\nif nargin > 3 && t > 0\n \n tau = q*t;\n nCalls = nCalls + 1;\n \n if isequal(SVD_STYLE,0) || strcmpi(SVD_STYLE,'dense')\n [U,S,V] = svd( full(X), 'econ' );\n else\n % Guess which singular value will have value near tau:\n [M,N] = size(X);\n if isempty(oldRank), K = 10;\n else K = oldRank + 2;\n end\n \n ok = false;\n\n while ~ok\n K = min( [K,M,N] );\n [U,S,V] = svdFcn(X,K,opts );\n ok = (min(diag(S)) < tau) || ( K == min(M,N) );\n if ok, break; end\n% K = K + 5;\n K = 2*K;\n if K > 10\n opts.tol = 1e-6;\n end\n if K > 40\n opts.tol = 1e-4;\n end\n if K > 100\n opts.tol = 1e-1;\n end\n if K > min(M,N)/2\n [U,S,V] = svd( full(X), 'econ' );\n ok = true;\n end\n end\n oldRank = length(find(diag(S) > tau));\n end\n s = diag(S) - tau;\n tt = s > 0;\n s = s(tt,:);\n\n if isempty(s)\n X = tfocs_zeros(X);\n else\n X = U(:,tt) * bsxfun( @times, s, V(:,tt)' );\n end\n switch SVD_STYLE\n case {3,'randomized'}\n V_save = V;\n end\nelse\n s = svd(full(X)); % could be expensive!\nend\n\nv = q * sum(s);\nif ND\n X = reshape( X, sx ); \nend\n\nend\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/prox_scale.m", "content": "function op = prox_scale( proxF, scale )\n\n%PROX_SCALE Scaling a proximity/projection function.\n% PSCALE = PROX_SCALE( PROXF, s ) is the proximity function formed\n% by multiplying the input by the real value SCALE, then calling the\n% function PROXF. In other words,\n% PSCALE( y ) = PROXF( s * y ).\n% In three-argument form, [v,x]=PSCALE(y,t) finds the minimizer of\n% PROXF( s * x ) + (0.5/t)*||x-y||_2^2\n%\n% Why scale the input, and not the output? When the proximity function\n% is a norm, the two choices are equivalent when SCALE >= 0, since\n% ||s*x|| = abs(s)*||x||. However, for *indicator* functions, scaling\n% the output is useless. Scaling the input grows or shrinks the domain\n% of PSCALE by choosing SCALE<1 or SCALE>1, respectively.\n%\n% Note that when constructing our equivalence we assume a particular\n% form for the proximity minimization. More generally, PROJ_SCALE will\n% preserve equivalence if 0.5*||x-y||^2 is replaced with D(x-y), as\n% long as D() satisfies the following homogeneity property:\n% D(s*z) = s^2*D(z)\n% If this is not the case, you will not be able to use the TFOCS\n% internal scaling with this function.\n\nif ~isa( proxF, 'function_handle' ),\n error( 'The first argument must be a function handle.' );\nelseif ~isa( scale, 'double' ) \n error( 'The second argument must be a nonzero scalar or matrix');\nelseif numel( scale ) == 1 && isreal( scale )\n % (we could handle complex, but need to work this out)\n if scale == 0,\n error( 'The second argument must be a nonzero real scalar.' );\n elseif scale == 1,\n op = proxF;\n else\n op = @(varargin)prox_scale_impl( proxF, scale, varargin{:} );\n end\nelse\n % added Sept 14, allowing matrix scaling with \"scale\" = L\n % First, we verify that LL^* = nu * Identity\n % We do this probabilistically in order to avoid potentially\n % huge matrices:\n [m,n] = size(scale);\n seed = rng;\n xTest = randn(m,5);\n rng(seed); % try not to affect the random seed\n xOut = scale*(scale'*xTest);\n if size(xOut,1) ~= m || size(xOut,2) ~= 5\n % This shouldn't every happen with matrix inputs,\n % but if we later allow functions, then it could happen\n % if the function doesn't actually do what we think.\n error('Something is wrong with the linear operator');\n end\n ref = xOut./xTest;\n nu = mean(ref(:));\n if norm( ref(:) - nu*ones(5*m,1) )/norm( nu*ones(5*m,1) ) > 1e-10\n % If we have LL^* = diag(d), this will be compatible\n % with some proxes, so issue a warning\n if mean( std(ref,[],2) )/norm(ref(:)/5) < 1e-10\n nu = mean(ref,2);\n warning('TFOCS:proxMustBeSeparable',...\n 'Matrix is not a tight frame but SS'' is diagonal, so this works if the prox is separable');\n else\n error('Matrix does not appear to be a tight frame: need S*S'' = nu*I');\n end\n else\n fprintf('Matrix is a tight frame with constant nu = %.2e\\n', nu );\n end\n op = @(varargin)prox_scaleMatrix_impl( proxF, scale, nu, varargin{:} );\nend\n \n \nfunction varargout = prox_scale_impl( proxF, s, y, t )\nno = max(nargout,1);\nif nargin < 4 || t == 0,\n [ varargout{1:no} ] = proxF( s * y );\nelse\n % For three-input mode, we wish to simulate\n % x = argmin_x projectorF(s*x) + (0.5/t)*||x-y||^2\n % Setting z = s * x, we have\n % z = argmin_z projectorF(z) + (0.5/(s^2*t))*||z-s*y||^2\n % Therefore, we have\n % [v,z] = projectorF( s * y, t * s^2 ); x = z / s;\n\t[ varargout{1:no} ] = proxF( s * y, abs(s)^2 * t );\nend\nif no > 1,\n varargout{2} = varargout{2} / s;\nend\n\n\nfunction varargout = prox_scaleMatrix_impl( proxF, L, nu, y, t )\nno = max(nargout,1);\nLy = L*y;\nif nargin < 5 || t == 0,\n [ varargout{1:no} ] = proxF( Ly );\nelse\n % Proposition 11 in Combettes and Pesquet 2007\n %\"A Douglas?Rachford Splitting Approach to Nonsmooth Convex Variational\n % Signal Recovery\"\n % If L*L'=nu I, then if g(x) = f(L*x), \n % prox_g = I + 1/nu L'( prox_{nu f} - I )L\n\t[ varargout{1:no} ] = proxF( Ly, nu * t );\nend\nif no > 1,\n varargout{2} = y + L'*((varargout{2} - Ly)./ nu);\nend\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/prox_shift.m", "content": "function op = prox_shift( funcF, c )\n\n%PROX_SHIFT Shift a proximity/projection function\n% SHIFTED_OP = PROX_SHIFT( OP, c )\n% returns an implementation of the proximity operator\n% defined by f(x) + c'*x\n% where f is the proximity operator associated with OP.\n%\n% See also prox_scale\n\nerror(nargchk(2,2,nargin));\nif ~isa( funcF, 'function_handle' ),\n error( 'The first argument must be a function handle.' );\nelseif ~isnumeric( c ) \n error( 'The second argument must be a numeric vector.' );\nend\nop = @(varargin)shift_func( funcF, c, varargin{:} );\n\n\nfunction [ v, x ] = shift_func( prox_f, c, x, t )\n\n if nargin < 3,\n error( 'Not enough arguments.' );\n end\n if nargin == 4,\n if numel(t) ~= 1\n error('The stepsize must be a scalar'); \n end\n [v,x] = prox_f(x-t*c,t);\n v = v + tfocs_dot(x,c);\n elseif nargout == 2,\n error( 'This function is not differentiable.' );\n end\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2015 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/prox_spectral.m", "content": "function op = prox_spectral( q, SYM_FLAG )\n%PROX_SPECTRAL Spectral norm, i.e. max singular value.\n% OP = PROX_SPECTRAL( q ) implements the nonsmooth function\n% OP(X) = q * max(svd(X)).\n% Q is optional; if omitted, Q=1 is assumed. But if Q is supplied, \n% it must be a positive real scalar.\n%\n% OP = PROX_SPECTRAL( q , 'sym' ) or OP = PROX_SPECTRAL( q, 'eig' )\n% will instruct the code that the matrix is Hermitian and \n% therefore the relations between singular- and eigen-values\n% are well known, and the code will use the more efficient\n% eigenvalue decomposition (instead of the SVD).\n%\n% This implementation uses a naive approach that does not exploit any\n% a priori knowledge that X is low rank or sparse. Future\n% implementations of TFOCS will be able to handle low-rank matrices \n% more effectively.\n%\n% Dual: proj_nuclear.m\n% See also proj_nuclear, prox_linf, prox_maxEig\n\n% Note: it would be possible to use eigs for sparse matrices,\n% but that requires a little bit more work than it did for proj_spectral.\n\n\nif nargin == 0,\n\tq = 1;\nelseif ~isnumeric( q ) || ~isreal( q ) || numel( q ) ~= 1 || q <= 0,\n\terror( 'Argument must be positive.' );\nend\nif nargin >= 2 && ( ...\n ~isempty(strfind(lower(SYM_FLAG),'eig')) || ...\n ~isempty(strfind(lower(SYM_FLAG),'sym')) )\n op = @(varargin)prox_spectral_eig_q( q, varargin{:} );\nelse\n op = @(varargin)prox_spectral_impl( q, varargin{:} );\nend\n\nfunction [ v, X ] = prox_spectral_impl( q, X, t )\nif nargin < 2,\n error( 'Not enough arguments.' );\nend\n\nif nargin == 3 && t > 0,\n [U,S,V] = svd( full(X), 'econ' );\n s = diag(S);\n tau = s(1);\n\n cs = cumsum(s);\n ndx = find( cs - (1:numel(s))' .* [s(2:end);0] >= t * q, 1 );\n if ~isempty( ndx ),\n tau = ( cs(ndx) - t * q ) / ndx;\n s = s .* ( tau ./ max( abs(s), tau ) );\n end\n X = U*diag(s)*V';\nelse\n if nargout == 2\n error( 'This function is not differentiable.' );\n end\n if issparse(X)\n tau = normest(X);\n else\n tau = norm(X);\n end\nend\nv = q * tau; \n\nfunction [ v, X ] = prox_spectral_eig_q( q, X, t )\n% Assumes X is square and symmetric\n% Therefore, all singular values are just absolute values\n% of the eigenvalues.\nif nargin < 2,\n error( 'Not enough arguments.' );\nend\nif size(X,1) ~= size(X,2)\n error('prox_spectral: variable must be a square matrix');\nend\nif norm( X - X', 'fro' ) > 1e-10*norm(X,'fro')\n error('Input must be Hermitian');\nend\nX = (X+X')/2; % Matlab will make it exactly symmetric\n\nif nargin == 3 && t > 0,\n [V,S] = safe_eig(full(X));\n op = prox_linf(q);\n s = diag(S);\n [dummy,s] = op(s,t);\n% tau = max(s); % for SVD, s >= 0 so we can do max. Not so for eig.\n tau = norm(s,Inf);\n X = V*diag(s)*V';\nelse\n if nargout == 2\n error( 'This function is not differentiable.' );\n end\n if issparse(X)\n tau = normest(X);\n else\n tau = norm(X);\n end\nend\nv = q * tau; \n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/prox_trace.m", "content": "function op = prox_trace( q, LARGESCALE, isReal )\n\n%PROX_TRACE Nuclear norm, for positive semidefinite matrices. Equivalent to trace.\n% OP = PROX_TRACE( q ) implements the nonsmooth function\n% OP(X) = q * sum(svd(X)) = q*tr(X) ( X >= 0 assumed )\n% Q is optional; if omitted, Q=1 is assumed. But if Q is supplied, \n% it must be a positive real scalar (the positivity is not necessary mathematically,\n% so if you want q<0, set SIGMA=q*eye(n); see below )\n% This function is a combination of the proximity function of the trace\n% and projection onto the set of symmetric/Hermitian matrices.\n%\n% OP = PROX_TRACE( SIGMA ) represents the function\n% OP(X) = trace( SIGMA * X ), such that X >= 0\n% Here, SIGMA should be a symmetric (or Hermitian) matrix, but need not\n% be positive semidefinite\n%\n% OP = PROX_TRACE( q/SIGMA, LARGESCALE )\n% uses a Lanczos-based Eigenvalue decomposition if LARGESCALE == true,\n% otherwise it uses a dense matrix Eigenvalue decomposition\n%\n% OP = PROX_TRACE( q/SIGMA, LARGESCALE, isReal )\n% also projects onto the set of real matrices if isReal=true.\n%\n% CALLS = PROX_TRACE( 'reset' )\n% resets the internal counter and returns the number of function\n% calls\n%\n% This implementation uses a naive approach that does not exploit any\n% a priori knowledge that X and G may be low rank (plus sparse). Future\n% implementations of TFOCS will be able to handle low-rank matrices \n% more effectively.\n% Dual: proj_spectral(q,'symm')\n% See also proj_spectral, prox_nuclear, proj_psdUTrace\n\n% April 4 2014, adding support for nonscalar q, i.e., q=SIGMA\n\nif nargin == 1 && strcmpi(q,'reset')\n op = prox_trace_impl;\n return;\nend\n\nif nargin == 0,\n\tq = 1;\nelseif ~isnumeric( q ) || ~isreal( q ) %|| numel( q ) ~= 1 || q <= 0,\n\terror( 'Argument must be positive.' );\nelseif numel(q) ==1 && q<= 0\n error('For now, argument must be positive. If you need negative, make q=-eye(n)');\n % April 4, realized that since this is just linear, we do not need to restrict\n % q to be positive.\nelseif numel(q) >1 && norm(q-q','fro')/norm(q,'fro') > 1e-5\n error('When q is a matrix, it must be symmetric/Hermitian');\nend\nif nargin < 2, LARGESCALE = []; end\nif nargin < 3 || isempty(isReal), isReal = false; end\n\n% clear the persistent values:\nprox_trace_impl();\n\nop = @(varargin)prox_trace_impl( q, LARGESCALE, isReal, varargin{:} );\nend\n\nfunction [ v, X ] = prox_trace_impl( q,LARGESCALE, isReal, X, t )\npersistent oldRank\npersistent nCalls\npersistent V\nif nargin == 0, oldRank = []; v = nCalls; nCalls = []; V=[]; return; end\nif isempty(nCalls), nCalls = 0; end\n\nif nargin >= 5 && t > 0,\n \n if ~isempty(LARGESCALE) \n largescale = LARGESCALE;\n else\n largescale = ( numel(X) > 100^2 ) && issparse(X);\n end\n if numel(q)==1\n tau = q*t;\n else\n % q is really a matrix Sigma\n % We can absorb this easily\n X = X - t*q;\n tau = 0;\n end\n nCalls = nCalls + 1;\n \n if ~largescale\n if isReal\n % July 10 2015, adding try-catch statement\n % to deal with bug in eig() sometimes\n [V,D] = safe_eig(real(full((X+X')/2)));\n else\n [V,D] = safe_eig(full((X+X')/2));\n end\n else\n\n % Guess which eigenvalue value will have value near tau:\n [M,N] = size(X);\n X = (X+X')/2;\n if isReal, X = real(X); end\n if isempty(oldRank), K = 10;\n else, K = oldRank + 2;\n end\n \n ok = false;\n opts = [];\n opts.tol = 1e-10; \n if isreal(X)\n opts.issym = true;\n SIGMA = 'LA';\n else\n SIGMA = 'LR';\n end\n % SIMGA = 'LM' (bug) prior to March 18 2012\n while ~ok\n K = min( [K,M,N] );\n \n if K > min(M,N)/2\n [V,D] = safe_eig(full((X+X')/2));\n ok = true;\n break;\n end\n \n [V,D] = eigs( X, K, SIGMA, opts );\n ok = (min(diag(D)) < tau) || ( K == min(M,N) );\n if ok, break; end\n K = 2*K;\n if K > 10\n opts.tol = 1e-6;\n end\n if K > 40\n opts.tol = 1e-4;\n end\n if K > 100\n opts.tol = 1e-3;\n end\n\n end\n oldRank = length(find(diag(D) > tau));\n end\n s = diag(D) - tau;\n tt = s > 0;\n s = s(tt,:);\n \n if isempty(s),\n X = tfocs_zeros(X);\n else\n X = V(:,tt) * bsxfun( @times, s, V(:,tt)' );\n % And force it to be symmetric\n X = (X+X')/2;\n end\n if numel(q)==1\n v = q * sum(s);\n else\n % This is what we compute\n %v = tr( q'*X );\n % but here is a faster way:\n v = q(:)'*X(:);\n end\nelse\n if numel(q)==1\n v = q* trace( X + X' )/2;\n else\n X = (X+X')/2;\n v = q(:)'*X(:);\n end\nend\n\nend\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/randomizedSVD.m", "content": "function [U,S,V] = randomizedSVD( X, r, rEst, nPower, seed, opts )\n% [U,S,V] = randomizedSVD( X, r, rEst, nPower, seed, opts )\n% returns V, S such that X ~ U*S*V' ( a m x n matrix)\n% where S is a r x r matrix\n% rEst >= r is the size of the random multiplies (default: ceil(r+log2(r)) )\n% nPower is number of iterations to do the power method\n% (should be at least 1, which is the default)\n% seed can be the empty matrix; otherwise, it will be used to seed\n% the random number generator (useful if you want reproducible results)\n% opts is a structure containing further options, including:\n% opts.warmStart Set this to a matrix if you have a good estimate\n% of the row-space of the matrix already. By default,\n% a random matrix is used.\n%\n% X can either be a m x n matrix, or it can be a cell array\n% of the form {@(y)X*y, @(y)X'*y, n }\n%\n% Follows the algorithm from [1]\n%\n% [1] \"Finding Structure with Randomness: Probabilistic Algorithms \n% for Constructing Approximate Matrix Decompositions\"\n% by N. Halko, P. G. Martinsson, and J. A. Tropp. SIAM Review vol 53 2011.\n% http://epubs.siam.org/doi/abs/10.1137/090771806\n%\n\n% added to TFOCS in October 2014\n\nif isnumeric( X )\n X_forward = @(y) X*y;\n X_transpose = @(y) X'*y;\n n = size(X,2);\nelseif iscell(X)\n if isa(X{1},'function_handle')\n X_forward = X{1};\n else\n error('X{1} should be a function handle');\n end\n if isa(X{2},'function_handle')\n X_transpose = X{2};\n else\n error('X{2} should be a function handle');\n end\n if size(X) < 3\n error('Please specify X in the form {@(y)X*y, @(y)X''*y, n }' );\n end\n n = X{3};\nelse\n error('Unknown type for X: should be matrix or cell/function handle'); \nend\nfunction out = setOpts( field, default )\n if ~isfield( opts, field )\n out = default;\n else\n out = opts.(field);\n end\nend\n\n% If you want reproducible results for some reason:\nif nargin >= 6 && ~isempty(seed)\n % around 2013 or 14 (not sure exactly)\n % they start changing .setDefaultStream...\n if verLessThan('matlab','8.2')\n RandStream.setDefaultStream(RandStream('mt19937ar', 'seed', seed) );\n else\n RandStream.setGlobalStream(RandStream('mt19937ar', 'seed', seed) );\n end\nend\nif nargin < 3 || isempty( rEst )\n rEst = ceil( r + log2(r) ); % for example...\n rEst = min( rEst, n );\nend\nif nargin < 4 || isempty( nPower )\n nPower = 1;\nend\nif nPower < 1, error('nPower must be >= 1'); end\nif nargin < 6, opts = []; end\n\nwarmStart = setOpts('warmStart',[] );\nif isempty( warmStart )\n Q = randn( n, rEst );\nelse\n Q = warmStart; \n if size(Q,1) ~= n, error('bad height dimension for warmStart'); end\n if size(Q,2) > rEst\n % with Nesterov, we get this a lot, so disable it\n warning('randomizedSVD:warmStartLarge','Warning: warmStart has more columns than rEst');\n% disp('Warning: warmStart has more columns than rEst');\n else\n Q = [Q, randn(n,rEst - size(Q,2) )];\n end\nend\nQ = X_forward(Q);\n% Algo 4.4 in \"Structure in randomness\" paper, but we re-arrange a little\nfor j = 1:(nPower-1)\n [Q,R] = qr(Q,0);\n Q = X_transpose(Q);\n [Q,R] = qr(Q,0);\n Q = X_forward(Q);\nend\n[Q,R] = qr(Q,0);\n \n% We can now approximate:\n% X ~ QQ'X = QV'\n% Form Q'X, e.g. V = X'Q\nV = X_transpose(Q);\n\n[V,R] = qr(V,0);\n[U,S,VV] = svd(R','econ');\nU = Q*U;\nV = V*VV;\n\n% Now, pick out top r. It's already sorted.\nU = U(:,1:r);\nV = V(:,1:r);\nS = S(1:r,1:r);\n\n\nend % end of function\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/smooth_constant.m", "content": "function op = smooth_constant( d )\n\n%SMOOTH_CONSTANT Constant function generation.\n% FUNC = SMOOTH_CONSTANT( D ) returns a function handle that provides\n% a TFOCS-compatible implementation of the constant function F(X) = D.\n% D must be a real scalar. The function can be used in both a smooth\n% and a nonsmooth context.\n\nerror(nargchk(1,1,nargin));\nif ~isa( d, 'double' ) || ~isreal( d ) || numel( d ) ~= 1,\n error( 'Argument must be a real scalar.' );\nend\nop = @(varargin)smooth_constant_impl( d, varargin{:} );\n\nfunction [ v, g ] = smooth_constant_impl( v, x, t )\nswitch nargin,\n case 2,\n if nargin > 1,\n g = 0 * x;\n end\n case 3,\n g = x;\n otherwise,\n error( 'Not enough arguments.' );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/smooth_entropy.m", "content": "function op = smooth_entropy()\n%SMOOTH_ENTROPY The entropy function -sum( x_i log(x_i) )\nop = @smooth_entropy_impl;\n\nfunction [ v, g ] = smooth_entropy_impl( x )\nif any( x < 0 ),\n v = -Inf;\n if nargout > 1,\n g = NaN * ones(size(x));\n end\nelse\n logx = log(max(x,realmin));\n v = - tfocs_dot( x, logx );\n if nargout > 1,\n g = - logx - 1;\n end\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/smooth_handles.m", "content": "function op = smooth_handles( func, grad )\n\n%SMOOTH_HANDLES Smooth function from separate f/g handles.\n% OP = SMOOTH_HANDLES( func, grad ) constructs a TFOCS-compatible\n% smooth function from separate handles for computing the function\n% value and gradient.\n%\n% See also private/tfocs_smooth\n\nop = @(varargin)smooth_handles_impl( func, grad, varargin{:} );\n\nfunction [ f, g ] = smooth_handles_impl( fop, gop, x, t )\nswitch nargin,\n\tcase 3,\n\t\tf = fop( x );\n\t\tif nargout > 1,\n\t\t\tg = gop( x );\n\t\tend\n\tcase 4,\n\t\terror( 'This function does not support proximity minimizaztion.' );\n\tcase { 0, 1, 2 },\n\t\terror( 'Not enough input arguments.' );\nend\t\t\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/smooth_huber.m", "content": "function op = smooth_huber(tau,vector)\n\n%SMOOTH_HUBER Huber function generation.\n% FUNC = SMOOTH_QUAD( TAU ) returns a function handle that implements\n%\n% FUNC(X) = sum_i 0.5 *( x_i.^2 )/tau if |x| <= tau\n% = sum_i |x_i| - tau/2 if |x| > tau\n%\n% All arguments are optional; the default value is tau = 1.\n% The Huber function has continuous gradient and is convex.\n%\n% The function acts component-wise. TAU may be either a scalar\n% or a vector/matrix of the same size as X\n%\n% Does not support nonsmooth usage yet\n%\n% FUNC = SMOOTH_QUAD( TAU, VECTOR )\n% is the default behavior if VECTOR is false or [],\n% and if VECTOR==true, then the output value FUNC\n% is a vector of the same size as X. The default behavior\n% would be recovered by taking the sum of FUNC.\n% Note: the gradient is the same in either case, so make sure\n% this is what you expect.\n%\n% Modified Jan 16 2015, input from Martin Andersen,\n% changed default VECTOR behavior, and also compatible with \n% complex numbers\n\n% Does not yet fully support tfocs_tuples\n\nif nargin == 0,\n tau = 1;\nend\n% op = @(varargin) smooth_huber_impl(tau, varargin{:} ); % old method\n\nif nargin < 2 || isempty(vector), vector = false; end\n\nop = tfocs_smooth( @(x)smooth_huber_impl(vector,x) );\n\n\n% function [ v, g ] = smooth_huber_impl(tau, x, t ) % old method\nfunction [ v, g ] = smooth_huber_impl(vector,x)\n if nargin == 4,\n error( 'Proximity minimization not supported by this function.' );\n end\n if ~isscalar(tau) && ~size(tau) == size(x)\n error('smooth_huber: tau must be a scalar or the same size as the variable');\n end\n if any(tau <= 0)\n error('smooth_huber: tau must be positive')\n end\n smallSet = ( abs(x) <= tau );\n v = smallSet.*( 0.5*(abs(x).^2)./tau ) + (~smallSet).*( abs(x) - tau/2) ;\n if ~vector\n % This is the default behavior: take the sum\n v = sum(v);\n end\n if nargout > 1\n% g = sign(x).*min( 1, abs(x)./tau );\n % make more compatible with complex numbers\n g = x./max( tau, abs(x) );\n end\nend % new method\n\nend % new method\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/smooth_linear.m", "content": "function op = smooth_linear( c, d )\n\n%SMOOTH_LINEAR Linear function generation.\n% FUNC = SMOOTH_LINEAR( C, D ) returns a function handle that provides a\n% TFOCS-compatible implementation of a linear function: if\n% [F,G] = FUNC(X),\n% then F = TFOCS_DOT(C,X)+D and G = C. D is optional; if omitted, then \n% D == 0 is assumed. But if it is supplied, D must be a real scalar.\n% If C == 0, then this function is equivalent to SMOOTH_CONSTANT( D ).\n% This function can be used in both smooth and non-smooth contexts.\n\nerror(nargchk(1,2,nargin));\nif nargin < 2,\n d = 0;\nelseif ~isa( d, 'double' ) || ~isreal( d ) || numel( d ) ~= 1,\n error( 'Second argument must be a real scalar.' );\nend\nif nnz(c),\n op = @(varargin)smooth_linear_impl( c, d, varargin{:} );\nelse\n op = smooth_constant( d );\nend\n\nfunction [ v, g ] = smooth_linear_impl( c, d, x, t )\nswitch nargin,\n case 3,\n g = c;\n case 4,\n x = x - t * c;\n g = x;\n otherwise,\n error( 'Not enough arguments.' );\nend\nv = tfocs_dot( c, x ) + d;\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/smooth_logLLogistic.m", "content": "function op = smooth_logLLogistic(y)\n% SMOOTH_LOGLLOGISTIC Log-likelihood function of a logistic: sum_i( y_i mu_i - log( 1+exp(mu_i) ) )\n% OP = SMOOTH_LOGLLOGISTIC( Y )\n% returns a function that computes the log-likelihood function\n% in a standard logistic regression model with independent entries. There\n% are two classes y_i = 0 and y_i = 1 with \n% \n% prob(y_i = 1) = exp(mu_i)/(1 + exp(mu_i)\n% \n% so that the log-likelihood is given by \n%\n% log-likelihood(mu) = sum_i ( y_i mu_i - log(1+ exp(mu_i)) ) \n%\n% where mu is the parameter of the distribution (this is unknown,\n% so it is the variable), and Y is a vector of observations.\n\nerror(nargchk(1,1,nargin));\nop = tfocs_smooth( @smooth_logLlogistic_impl);\n\nfunction [ v, g ] = smooth_logLlogistic_impl( mu )\n\n if length(mu) == 1, \n mu = mu * ones(size(y));\n elseif size(mu) ~= size(y),\n error('Parameters and data must be of the same size'),\n end\n \n aux = 1 + exp(-abs(mu));\n v = tfocs_dot(y-1,mu.*(mu > 0)) ...\n + tfocs_dot(y,mu.*(mu < 0)) ...\n - tfocs_dot(ones(size(y)), log(aux));\n if nargout > 1,\n g = y - ((mu > 0) + (mu <= 0).*exp(mu))./aux;\n end\nend\n\nend\n \n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/smooth_logLPoisson.m", "content": "function op = smooth_logLPoisson(x)\n% SMOOTH_LOGLPOISSON Log-likelihood of a Poisson: sum_i (-lambda_i + x_i * log( lambda_i) )\n% OP = SMOOTH_LOGLPOISSON( X )\n% returns a function that computes the log-likelihood function\n% of independent Poisson random variables with parameters lambda_i:\n%\n% log-likelihood(lambda) = sum_i ( -lambda_i + x_i * log( lambda_i) )\n%\n% where LAMBDA is the parameter of the distribution (this is unknown,\n% so it is the variable), and X is a vector of observations.\n%\n% Note: the constant term in the log-likelihood is omitted.\n\nerror(nargchk(1,1,nargin));\nop = tfocs_smooth( @smooth_llPoisson_impl );\n\nfunction [ v, g ] = smooth_llPoisson_impl( lambda )\n\n if length(lambda) == 1, \n lambda = lambda * ones(size(x));\n elseif size(lambda) ~= size(x),\n error('Parameters and data must be of the same size'),\n end\n \n if any( lambda < 0 ),\n v = -Inf;\n if nargout > 1,\n g = NaN * ones(size(x));\n end\n else\n loglambda = log(max(lambda,realmin));\n v = - tfocs_dot(lambda, ones(size(x))) + tfocs_dot( x, loglambda);\n if nargout > 1,\n g = -1 + x./lambda;\n end\n end\nend\n\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/smooth_logdet.m", "content": "function op = smooth_logdet(q,C)\n% SMOOTH_LOGDET The -log( det( X ) ) function.\n% (Note the minus sign)\n% FUNC = SMOOTH_LOGDET( q ) returns a function handle that\n% provides a TFOCS-compatible implementation of the funciton\n% -q*log( det( X ) )\n%\n% FUNC = SMOOTH_LOGDET( q, C ) represents\n% -q*log( det( X ) ) + < C, X >, where C is symmetric/Hermitian\n%\n% X must be symmetric/Hermitian and positive definite,\n% and q must be a positive real number (if not provided,\n% the default value is q = 1).\n%\n% N.B. it is the user's responsibility to ensure\n% that X is Hermitian and pos. def., since\n% automatically checking is expensive.\n%\n% This function is differentiable, but the gradient\n% is not Lipschitz on the domain X > 0\n%\n% This function does support proximity operations, and so\n% it may be used as a nonsmooth function.\n% However, the input must be symmetric positive definite\n% (and if C is used, then it must also be > tC )\n\n% SRB: have not yet tested this.\n% SRB: I think we CAN compute the proximity operator to logdet.\n% Will implement this in prox_logdet\nif nargin < 1, q = 1; end\nif nargin < 2, C = []; end\nif ~isreal(q) || q <= 0\n error('First argument must be real and positive');\nend\n\n%op = @smooth_logdet_impl;\nif isempty(C)\n op = @(varargin)smooth_logdet_impl( q, varargin{:} );\nelse\n op = @(varargin)smooth_logdet_impl_C( q, C, varargin{:} );\nend\n\nfunction [ v, g ] = smooth_logdet_impl( q, x, t )\nif size(x,1) ~= size(x,2)\n error('smooth_logdet: input must be a square matrix');\nend\nswitch nargin\n case 2\n % the function is being used in a \"smooth\" fashion\n %v = -log(det(x));\n v = -2*q*sum(log(diag(chol(x)))); % chol() takes half the time as det()\n % and it is easier to avoid overflow errors\n % since we sum the logs.\n % Also, chol() will warn if not pos. def.\n if nargout > 1\n g = -q*inv(x);\n % it would be nice to make g a function handle\n % that calculates g(y) = -x\\y\n end\n\n\n case 3\n % the function is being used in a \"nonsmooth\" fashion\n % i.e. return g = argmin_g -q*log(det(g)) + 1/(2t)||g-x||^2\n x = full(x+x')/2; % March 2015, project it to be symmetric\n [V,D] = safe_eig(x);\n d = diag(D);\n % This is OK: input need not be pos def\n %if any(d<=0),\n %v = Inf;\n %g = nan(size(x));\n %return;\n%% error('log_det requires a positive definite point'); \n %end\n l = ( d + sqrt( d.^2 + 4*t*q ) )/2;\n g = V*diag(l)*V';\n v = -q*sum(log(l));\n otherwise\n error('Wrong number of arguments');\nend\n\n\nfunction [ v, g ] = smooth_logdet_impl_C( q, C, x, t )\nif size(x,1) ~= size(x,2)\n error('smooth_logdet: input must be a square matrix');\nend\nif size(C,1) ~= size(C,2)\n error('smooth_logdet: input must be a square matrix');\nend\nswitch nargin\n case 3\n % the function is being used in a \"smooth\" fashion\n %v = -log(det(x));\n v = -2*q*sum(log(diag(chol(x)))); % chol() takes half the time as det()\n % and it is easier to avoid overflow errors\n % since we sum the logs.\n % Also, chol() will warn if not pos. def.\n v = v + tfocs_dot( C, x );\n if nargout > 1\n g = -q*inv(x) + C;\n % it would be nice to make g a function handle\n % that calculates g(y) = -x\\y\n end\n\n\n case 4\n % the function is being used in a \"nonsmooth\" fashion\n % i.e. return g = argmin_g -q*log(det(g)) + 1/(2t)||g-x||^2\n x = x - t*C; \n x = full(x+x')/2; % March 2015, project it to be symmetric\n [V,D] = safe_eig(x);\n d = diag(D);\n % This is OK: input need not be pos def\n l = ( d + sqrt( d.^2 + 4*t*q ) )/2;\n g = V*diag(l)*V';\n v = -q*sum(log(l));\n v = v + tfocs_dot( C, g );\n otherwise\n error('Wrong number of arguments');\nend\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/smooth_logsumexp.m", "content": "function op = smooth_logsumexp(sigma)\n% SMOOTH_LOGSUMEXP The function log(sum(exp(x)))\n% returns a smooth function to calculate\n% log( sum( exp(x) ) )\n%\n% SMOOTH_LOGSUMEXP( SIGMA ) is a scaled version\n% that calclates sigma*log(sum(exp(x/sigma)), for sigma > 0.\n% As sigma --> 0, this becomes a good approximation\n% of max(x).\n% The Lipschitz constant of the gradient is 1/sigma.\n% By default, sigma = 1.\n%\n% For a fancier version (with offsets),\n% see also smooth_logLLogistic.m\n\nif nargin < 1 || isempty(sigma), sigma = 1; end\nop = @(x)smooth_logsumexp_impl(x,sigma);\n\nfunction [ v, g ] = smooth_logsumexp_impl( x, sigma )\n\n% Even for moderate values of x/sigma, exp(x/sigma)\n% will overflow before we have a chance to take\n% its logarithm. So we subtract off the max value\n% and treat it separately:\n\nc = max(x);\nexpx = exp((x-c)/sigma);\nsum_expx = sum(expx(:));\nv = sigma*log(sum_expx) + c;\n\nif nargout > 1,\n g = expx ./ sum_expx;\n % (the factor of e^{-c} cancels from both the numerator\n % and denominator)\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/smooth_quad.m", "content": "function op = smooth_quad( P, q, r, use_eig )\n\n%SMOOTH_QUAD Quadratic function generation.\n% FUNC = SMOOTH_QUAD( P, q, r ) returns a function handle that implements\n%\n% FUNC(X) = 0.5 * TFOCS_DOT( P * x, x ) + TFOCS_DOT( q, x ) + r.\n%\n% All arguments are optional; the default values are P=I, q=0, r=0. In\n% particular, calling FUNC = SMOOTH_QUAD with no arguments yields\n% \n% FUNC(X) = 0.5 * TFOCS_NORMSQ( X ) = 0.5 * TFOCS_DOT( X, X ).\n%\n% If supplied, P must be a scalar, square matrix, or symmetric linear\n% operator. Furthermore, it must be positive semidefinite (convex) or\n% negative semidefinite (concave). TFOCS does not verify operator \n% symmetry or definiteness; that is your responsibility.\n% If P is a vector, then it assumed this is the diagonal part of P.\n% Note: when P is diagonal, this function can compute a proximity\n% operator. If P is zero, then smooth_linear should be called instead.\n% When P is an explicit matrix, this can also act as a proimity operator\n% but it may be slow, since it must invert (I+tP). True use_eig mode (see below)\n%\n% If P is a scaling matrix, like the identity or a multiple of the identity\n% (say, P*x = 5*x), then specifying the scaling factor is sufficient (in\n% this example, 5). If P is empty, then P=1 is assumed.\n%\n% FUNC = SMOOTH_QUAD( P, q, r, use_eig )\n% will perform a one-time (but expensive) eigenvalue decomposition\n% of P if use_eig=true, which will speed up future iterations. In general,\n% this may be significantly faster, especially if you run \n% an algorithm for many iterations.\n% This mode is only useful when P is a full matrix and when\n% smooth_quad is used as a proximity operator; does not affect\n% it when used as a smooth operator. New in v 1.3.\n%\n% See also smooth_linear.m\n\nif nargin == 0,\n op = @smooth_quad_simple;\n return\nend\nif isa( P, 'function_handle' ),\n sz = P([],0);\n if ~isequal( sz{1}, sz{2} ),\n error( 'P must be square.' );\n end\nelseif ~isnumeric( P ),\n error( 'P must be a scalar, matrix, or linear operator.' );\nelseif isempty(P)\n P = 1;\nelseif ndims( P ) > 2 || (~isvector(P) && size( P, 1 ) ~= size( P, 2 ) ),\n error( 'P must be a square matrix.' );\nend\nif nargin < 2 || isempty( q ),\n q = 0;\nelseif numel(P) > 1 && numel(q) > 1 && length(q) ~= size(P,1),\n error( 'Dimension mismatch between p and q.' );\nend\nif nargin < 3 || isempty( r ),\n r = 0;\nelseif numel(r) > 1 || ~isreal( r ),\n error( 'r must be a real scalar.' );\nend\nif nargin < 4, use_eig = false; end\n\nif isnumeric( P ),\n if isvector( P )\n if any(P) < 0 && any(P) < 0\n error(' P must be convex (minimization) or concave (maximization) but cannot be mixed');\n end\n P = P(:); % make it a column vector\n op = @(varargin)smooth_quad_diag_matrix( P, q, r, varargin{:} );\n else\n P = 0.5 * ( P + P' );\n if use_eig\n [V,DD] = safe_eig(P); dd = diag(DD);\n else\n V = []; dd = [];\n end\n op = @(varargin)smooth_quad_matrix( P, q, r, V, dd, varargin{:} );\n end\nelse\n op = @(varargin)smooth_quad_linop( P, q, r, varargin{:} );\nend\n\nfunction [ v, g ] = smooth_quad_matrix( P, q, r, V, dd, x, t )\nswitch nargin\n case 6,\n if size(x,2)>1 && size(q,1)==1\n % User meant to supply repmat(q,1,size(x,2)) so we do it for\n % them\n g = P * x + repmat(q,1,size(x,2));\n v = 0.5 * tfocs_dot( x, g + repmat(q,1,size(x,2)) ) + r;\n else\n g = P * x + q;\n v = 0.5 * tfocs_dot( x, g + q ) + r;\n end\n case 7,\n n = length(x);\n \n if ~isempty(V) && ~isempty(dd)\n % Use the stored eigenvalue decomposition to improve speed\n x = V*( (V'*(x-t*q))./(t*dd+ones(n,1)) );\n else\n x = (eye(n) + t*P)\\ (x-t*q);\n end\n g = x; % for this case, \"g\" is NOT the gradient\n v = 0.5 * tfocs_dot( P*x + 2*q, x ) + r;\nend\n%if nargin == 5,\n %error( 'Proximity minimization not supported by this function.' );\n%end\n% Note: we don't support proximity minimization, but there is\n% nothing that prevents it theoretically. You would need to know P^-1\n% (and ideally calculate it quickly). \n% In particular, if P is diagonal, then it is easy.\n%g = P * x + q;\n%v = 0.5 * tfocs_dot( x, g + q ) + r;\n\n\n\n% Jan 10, 2011: this function isn't correct for case 5\n% function [ v, g ] = smooth_quad_diag_matrix( p, q, r, x, t )\n% switch nargin\n% case 4,\n% case 5,\n% x = (1./(t*p+1)) .* x;\n% end\n% g = p .* x + q;\n% v = 0.5 * tfocs_dot( x, g + q ) + r;\nfunction [ v, g ] = smooth_quad_diag_matrix( p, q, r, x, t )\nswitch nargin\n case 4,\n g = p .* x + q;\n v = 0.5 * tfocs_dot( x, g + q ) + r;\n case 5,\n x = (1./(t*p+1)) .* (x-t*q);\n g = x; % for this case, \"g\" is NOT the gradient\n v = 0.5 * tfocs_dot( p.*x + 2*q, x ) + r;\nend\n\nfunction [ v, g ] = smooth_quad_linop( P, q, r, x, t )\nif nargin == 5,\n error( 'Proximity minimization not supported by this function.' );\nend\ng = P( x, 1 ) + q;\nv = 0.5 * tfocs_dot( x, g + q ) + r;\n\nfunction [ v, x ] = smooth_quad_simple( x, t )\nswitch nargin,\n case 1,\n case 2,\n x = (1/(t+1)) * x;\nend\nv = 0.5 * tfocs_normsq( x );\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/solver_L1RLS.m", "content": "function [ x, odata, opts ] = solver_L1RLS( A, b, lambda, x0, opts )\n% SOLVER_L1RLS l1-regularized least squares problem, sometimes called the LASSO.\n% [ x, odata, opts ] = solver_L1RLS( A, b, lambda, x0, opts )\n% Solves the l1-regularized least squares problem\n% minimize (1/2)*norm( A * x - b )^2 + lambda * norm( x, 1 )\n% using the Auslender/Teboulle variant with restart. A must be a matrix\n% or a linear operator, b must be a vector, and lambda must be a real\n% positive scalar. The initial point x0 and option structure opts are\n% both optional.\n%\n% Note: this formulation is sometimes referred to as \"The Lasso\"\n%\n% If \"nonneg\" is a field in \"opts\" and opts.nonneg is true,\n% then the constraint x >= 0 is also imposed\n\nerror(nargchk(3,5,nargin));\nif nargin < 4, x0 = []; end\nif nargin < 5, opts = []; end\nif ~isfield( opts, 'restart' ), \n opts.restart = 100; \nend\n\nnonneg = false;\nif isfield(opts,'nonneg')\n nonneg = opts.nonneg;\n opts = rmfield(opts,'nonneg');\nend\nif isfield(opts,'nonNeg')\n nonneg = opts.nonNeg;\n opts = rmfield(opts,'nonNeg');\nend\n\nif nonneg\n prox = prox_l1pos( lambda );\nelse\n prox = prox_l1( lambda );\nend\n\n[x,odata,opts] = tfocs( smooth_quad, { A, -b }, prox, x0, opts );\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/solver_LASSO.m", "content": "function [ x, out, opts ] = solver_LASSO( A, b, tau, x0, opts )\n% SOLVER_LASSO Minimize residual subject to l1-norm constraints.\n% [ x, out, opts ] = solver_LASSO( A, b, tau, x0, opts )\n% Solves the LASSO in the standard Tibshirani formulation,\n% minimize (1/2)*norm(A*x-b)^2\n% s.t. norm(x,1) <= tau\n% A must be a linear operator or matrix, and b must be a vector. The\n% initial point x0 and the options structure opts are optional.\n%\n% Note: many people use \"LASSO\" to refer to the problem:\n% minimize 1/2*norm(A*x-b)^2 + lambda*norm(x,1)\n% In TFOCS, this version is implemented in \"solver_L1RLS\"\n% (which stands for \"L1 regularized Least Squares\" )\n%\n% If \"nonneg\" is a field in \"opts\" and opts.nonneg is true,\n% then the constraint x >= 0 is also imposed\n%\n% See also solver_L1RLS.m, solver_sBPDN.m\n\n% Supply default values\nerror(nargchk(3,5,nargin));\nif nargin < 4, x0 = []; end\nif nargin < 5, opts = []; end\nif ~isfield( opts, 'restart' ), opts.restart = 100; end\n\nnonneg = false;\nif isfield(opts,'nonneg')\n nonneg = opts.nonneg;\n opts = rmfield(opts,'nonneg');\nend\nif isfield(opts,'nonNeg')\n nonneg = opts.nonNeg;\n opts = rmfield(opts,'nonNeg');\nend\n\nif nonneg\n proj = proj_simplex(tau);\nelse\n proj = proj_l1(tau);\nend\n\n% Extract the linear operators\n[x,out,opts] = tfocs( smooth_quad, { A, -b }, proj, x0, opts );\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/solver_SLOPE.m", "content": "function [ x, odata, opts ] = solver_SLOPE( A, b, lambda, x0, opts )\n% SOLVER_SLOPE Sorted l1-regularized least squares problem, \n% [ beta, odata, opts ] = solver_SLOPE( X, y, lambda, beta0, opts )\n% Solves the l1-regularized least squares problem, using the sorted/ordered l1 norm, \n% minimize (1/2)*norm( A * x - b )^2 + norm( lasso.*sort(abs(x),'descend'), 1 )\n% using the Auslender/Teboulle variant with restart. X must be a matrix\n% or a linear operator, y must be a vector, and lambda must be a real\n% positive vector in decreasing order. \n% The initial point beta0 and option structure opts are both optional.\n%\n% SLOPE stands for Sorted L-One Penalized Estimation\n%\n% Reference:\n% \"Statistical Estimation and Testing via the Ordered l1 Norm\"\n% by M. Bogdan, E. van den Berg, W. Su, and E. J. Candès, 2013\n% http://www-stat.stanford.edu/~candes/OrderedL1/\n%\n% See also solver_L1RLS.m, solver_LASSO.m, prox_Sl1.m\n\nerror(nargchk(3,5,nargin));\nif nargin < 4, x0 = []; end\nif nargin < 5, opts = []; end\nif ~isfield( opts, 'restart' ), \n opts.restart = 100; \nend\n\n[x,odata,opts] = tfocs( smooth_quad, { A, -b }, prox_Sl1( lambda ), x0, opts );\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/solver_TraceLS.m", "content": "function [ x, odata, opts ] = solver_TraceLS( A, b, lambda, x0, opts )\n% SOLVER_TRACELS Unconstrained form of trace-regularized least-squares problem.\n% [ x, odata, opts ] = solver_TraceLS( A, b, lambda, x0, opts )\n% Solves the trace-regularized least squares problem\n% minimize (1/2)*norm( A * X - b )^2 + lambda * trace( X )\n% with the constraint that X is positive semi-definite.\n% A must be a matrix or a linear operator, b must be a vector, \n% and lambda must be a real positive scalar. \n% The initial point x0 and option structure opts are\n% both optional.\n%\n% If \"A\" is a sparse matrix, and nnz(Z) = length(b), then it is assumed\n% that the nonzero entries correspond to samples, and then the\n% corresponding sampling operator is used.\n%\n% If opts.largescale = true, then uses an iterative method\n% to compute the eigenvalue decomposition used with prox_trace.\n%\n% See also solver_L1RLS (aka The Lasso)\n\n\n% Added Feb 7, 2011\nerror(nargchk(3,5,nargin));\nif nargin < 4, x0 = []; end\nif nargin < 5, opts = []; end\nif ~isfield( opts, 'restart' ), \n opts.restart = 100; \nend\nif issparse(A) && nnz(A) == length(b)\n A = linop_subsample(A);\nend\nif isfield( opts,'largescale')\n prx = prox_trace( lambda, opts.largescale );\n opts = rmfield(opts,'largescale');\nelse\n prx = prox_trace( lambda );\nend\n% Note: the proximity operator of trace is really a combination\n% of the proximity operator of trace and the indicator\n% set of positive semi-definite matrices.\n% So we do not need to *explicitly* include the positive semi-definite constraint.\n\n[x,odata,opts] = tfocs( smooth_quad, { A, -b }, prx, x0, opts );\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/solver_psdComp.m", "content": "function [ x, out, opts ] = solver_psdComp( Xinc, opts )\n% SOLVER_PSDCOMP Matrix completion for PSD matrices.\n% [ x, out, opts ] = solver_psdComp( Xinc, opts )\n% Solves the PSD matrix completion problem\n% minimize (1/2)*norm(X(ij)-vv).^2\n% s.t. X p.s.d\n% where ij is a vector of indices corresponding to the known elements.\n% The nonzero values of Xinc are assumed to be the known values; that\n% is, all zero values are considered unknowns. In order to specify a\n% known zero value, replace it with a very small value; e.g., 1e-100.\n%\n% Since X must be symmetric, the ij entries should have symmetry. If they\n% are not specified symmetrically, then choose opts.symmetrize = true\n% to force them to become symmetric. This will change the objective\n% function.\n%\n% Set opts.largescale=true to use eigs() instead if eig().\n%\n% See also solver_psdCompConstrainedTrace\n\n% Supply default values\nerror(nargchk(1,2,nargin));\nif nargin < 2, opts = []; end\nif ~isfield( opts, 'restart' ), \n opts.restart = 50; \nend\nif isfield( opts, 'symmetrize' ), \n symmetrize = opts.symmetrize;\n opts = rmfield(opts,'symmetrize');\nelse\n symmetrize = false;\nend\nif isfield( opts, 'largescale' ), \n largescale = opts.largescale;\n opts = rmfield(opts,'largescale');\nelse\n largescale = false;\nend\n[n,m] = size(Xinc);\nif n ~= m, error( 'Input must be square.' ); end\n\nif norm(Xinc-Xinc','fro') > 1e-8*norm(Xinc,'fro') && symmetrize\n Xinc = symmetrizeSparseMatrix(Xinc);\n disp('symmetrizing input');\nend\nlinop = linop_subsample(Xinc);\nvv = full( Xinc( find(Xinc) ) );\n\n[x,out,opts] = tfocs( smooth_quad, { linop, -vv }, proj_psd(largescale), Xinc, opts );\n\n\nfunction X = symmetrizeSparseMatrix( X )\n % Some entries were only specified once, others were\n % double-specified, so we don't know if we should\n % divide by 1 or 2\n ind1 = find( tril(X) );\n ind2 = find( tril(X',-1) );\n X = tril(X) + tril( X', -1);\n ind = intersect(ind1,ind2);\n X(ind) = X(ind)/2;\n X = X + tril(X,-1)';\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/solver_psdCompConstrainedTrace.m", "content": "function [ x, out, opts ] = solver_psdCompConstrainedTrace( Xinc, tr, opts )\n% SOLVER_PSDCOMPCONSTRAINEDTRACE Matrix completion with constrained trace, for PSD matrices.\n% [ x, out, opts ] = solver_psdCompConstrainedTrace( Xinc, tr, opts )\n% Solves the PSD matrix completion problem\n% minimize (1/2)*norm(X(ij)-vv).^2\n% s.t. X p.s.d and trace(X) = tr\n% where ij is a vector of indices corresponding to the known elements.\n% The nonzero values of Xinc are assumed to be the known values; that\n% is, all zero values are considered unknowns. In order to specify a\n% known zero value, replace it with a very small value; e.g., 1e-100.\n%\n% Since X must be symmetric, the ij entries should have symmetry. If they\n% are not specified symmetrically, then choose opts.symmetrize = true\n% to force them to become symmetric. This will change the objective\n% function.\n%\n% See also solver_psdComp\n\n% Supply default values\nerror(nargchk(1,3,nargin));\nif nargin < 3, opts = []; end\nif ~isfield( opts, 'restart' ), \n opts.restart = 50; \nend\nif isfield( opts, 'symmetrize' ), \n symmetrize = opts.symmetrize;\n opts = rmfield(opts,'symmetrize');\nelse\n symmetrize = false;\nend\nif nargin < 2 || isempty(tr)\n tr = 1;\nend\n\n[n,m] = size(Xinc);\nif n ~= m, error( 'Input must be square.' ); end\n% If not symmetric, then make it symmetric\nif norm(Xinc-Xinc','fro') > 1e-8*norm(Xinc,'fro') && symmetrize\n Xinc = symmetrizeSparseMatrix(Xinc);\n disp('symmetrizing input');\nend\n\n% -- This doesn't work so well --\n% Xinc = tril(Xinc);\n% [ii,jj,vv] = find(Xinc);\n% ij = sub2ind( [n,n], ii, jj );\n% linop = @(varargin)samp_op( n, ii, jj, ij, varargin{:} );\n% \n% Xinc = Xinc + tril(Xinc,-1)';\n\n% This is better:\nlinop = linop_subsample(Xinc);\nvv = full( Xinc( find(Xinc) ) );\n\n% Extract the linear operators\n[x,out,opts] = tfocs( smooth_quad, { linop, -vv }, proj_psdUTrace(tr), Xinc, opts );\n\n% we use a special sampling operator to tell it to make it symmetric\nfunction y = samp_op( n, ii, jj, ij, X, mode )\nswitch mode\n case 0,\n y = { [n,n], [length(ii),1] };\n case 1,\n X = (X+X')/2;\n y = full(X(ij)); %otherwise it is a sparse vector \n case 2,\n y = sparse( ii, jj, X, n, n );\n y = y + tril(y,-1)';\nend\n\nfunction X = symmetrizeSparseMatrix( X )\n % Some entries were only specified once, others were\n % double-specified, so we don't know if we should\n % divide by 1 or 2\n ind1 = find( tril(X) );\n ind2 = find( tril(X',-1) );\n X = tril(X) + tril( X', -1);\n ind = intersect(ind1,ind2);\n X(ind) = X(ind)/2;\n X = X + tril(X,-1)';\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/solver_sBP.m", "content": "function varargout = solver_sBP( A, b, mu, x0, z0, opts, varargin )\n% SOLVER_SBP Basis pursuit (l1-norm with equality constraints). Uses smoothing.\n% [ x, out, opts ] = solver_sBP( A, b, mu, x0, z0, opts )\n% Solves the smoothed basis pursuit problem\n% minimize norm(x,1) + 0.5*mu*(x-x0).^2\n% s.t. A * x == b\n% by constructing and solving the composite dual\n% maximize - g_sm(z)\n% where\n% g_sm(z) = sup_x -norm(x,1)-(1/2)*mu*norm(x-x0)\n% A must be a linear operator or matrix, and b must be a vector. The\n% initial point x0 and the options structure opts are optional.\n%\n% If \"nonneg\" is a field in \"opts\" and opts.nonneg is true,\n% then the constraints are A * x == b AND x >= 0\n\n% Supply default values\nerror(nargchk(3,7,nargin));\nif nargin < 4, x0 = []; end\nif nargin < 5, z0 = []; end\nif nargin < 6, opts = []; end\nif ~isfield( opts, 'restart' ), opts.restart = 400; end\n\n\n% -- legacy options from original software --\nif isfield(opts,'lambda0')\n opts = rmfield(opts,'lambda0');\nend\nif isfield(opts,'xPlug')\n opts = rmfield(opts,'xPlug');\nend\nif isfield(opts,'solver')\n svr = opts.solver;\n opts = rmfield(opts,'solver');\n if isfield(opts,'alg') && ~isempty(opts.alg)\n disp('Warning: conflictiong options for the algorithm');\n else\n % if specified as \"solver_AT\", truncate:\n s = strfind( svr, '_' );\n if ~isempty(s), svr = svr(s+1:end); end\n opts.alg = svr;\n end\nend\n\n\nnonneg = false;\nif isfield(opts,'nonneg')\n nonneg = opts.nonneg;\n opts = rmfield(opts,'nonneg');\nend\nif isfield(opts,'nonNeg')\n nonneg = opts.nonNeg;\n opts = rmfield(opts,'nonNeg');\nend\n\nif nonneg \n % -- case: x >= 0 constraints\n prox = prox_l1pos;\nelse\n % -- case: no x >= 0 constraint\n prox = prox_l1;\nend\n[varargout{1:max(nargout,1)}] = ...\n tfocs_SCD( prox, { A, -b }, proj_Rn, mu, x0, z0, opts, varargin{:} );\n \n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/solver_sBPDN.m", "content": "function varargout = solver_sBPDN( A, b, epsilon, mu, x0, z0, opts, varargin )\n% SOLVER_SBPDN Basis pursuit de-noising. BP with relaxed constraints. Uses smoothing.\n% [ x, out, opts ] = solver_sBPDN( A, b, epsilon, mu, x0, z0, opts )\n% Solves the smoothed basis pursuit denoising problem\n% minimize norm(x,1) + 0.5*mu*(x-x0).^2\n% s.t. norm(A*x-b,2) <= epsilon\n% by constructing and solving the composite dual\n% maximize - g_sm(z) - epsilon*norm(z,2)\n% where\n% gsm(z) = sup_x -norm(x,1)-(1/2)*mu*norm(x-x0)\n% A must be a linear operator or matrix, and b must be a vector. The\n% initial point x0 and the options structure opts are optional.\n%\n% If \"nonneg\" is a field in \"opts\" and opts.nonneg is true,\n% then the constraints are norm(A*x-b,2) <= epsilon AND x >= 0\n\n% Supply default values\nerror(nargchk(4,8,nargin));\nif nargin < 5, x0 = []; end\nif nargin < 6, z0 = []; end\nif nargin < 7, opts = []; end\nif ~isfield( opts, 'restart' ), opts.restart = 400; end\n\nif epsilon < 0\n error('TFOCS error: epsilon is negative');\nend\nif ~epsilon\n error('TFOCS error: cannot handle epsilon = 0. Please call solver_sBP instead');\nelseif epsilon < 100*builtin('eps')\n warning('TFOCS:badConstraint',...\n 'TFOCS warning: epsilon is near zero; consider calling solver_sBP instead');\nend\n\n\n% -- legacy options from original software --\nif isfield(opts,'lambda0')\n opts = rmfield(opts,'lambda0');\nend\nif isfield(opts,'xPlug')\n opts = rmfield(opts,'xPlug');\nend\nif isfield(opts,'solver')\n svr = opts.solver;\n opts = rmfield(opts,'solver');\n if isfield(opts,'alg') && ~isempty(opts.alg)\n disp('Warning: conflictiong options for the algorithm');\n else\n % if specified as \"solver_AT\", truncate:\n s = strfind( svr, '_' );\n if ~isempty(s), svr = svr(s+1:end); end\n opts.alg = svr;\n end\nend\n\n\n\n\nnonneg = false;\nif isfield(opts,'nonneg')\n nonneg = opts.nonneg;\n opts = rmfield(opts,'nonneg');\nend\nif isfield(opts,'nonNeg')\n nonneg = opts.nonNeg;\n opts = rmfield(opts,'nonNeg');\nend\n\nif nonneg \n % -- case: x >= 0 constraints\n prox = prox_l1pos;\nelse\n % -- case: no x >= 0 constraint\n prox = prox_l1;\nend\n[varargout{1:max(nargout,1)}] = ...\n tfocs_SCD( prox, { A, -b }, prox_l2( epsilon ), mu, x0, z0, opts, varargin{:} );\n\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/solver_sBPDN_W.m", "content": "function varargout = solver_sBPDN_W( A, W, b, epsilon, mu, x0, z0, opts, varargin )\n% SOLVER_SBPDN_W Weighted BPDN problem. Uses smoothing.\n% [ x, out, opts ] = solver_sBPDN_W( A, W, b, epsilon, mu, x0, z0, opts )\n% Solves the smoothed basis pursuit denoising problem\n% minimize norm(Wx,1) + 0.5*mu*(x-x0).^2\n% s.t. norm(A*x-b,2) <= epsilon\n% by constructing and solving the composite dual.\n% A and W must be a linear operator or matrix, and b must be a vector. The\n% initial point x0 and the options structure opts are optional.\n%\n% If \"nonneg\" is a field in \"opts\" and opts.nonneg is true,\n% then the constraints are norm(A*x-b,2) <= epsilon AND x >= 0\n% If \"box\" is a field in \"opts\" and opts.box = [l,u]\n% then the constraints are norm(A*x-b,2) <= epsilon AND l <= x <= u\n%\n% See also solver_sBPDN\n\n\n% Supply default values\nerror(nargchk(5,9,nargin));\nif nargin < 6, x0 = []; end\nif nargin < 7, z0 = []; end\nif nargin < 8, opts = []; end\nif ~isfield( opts, 'restart' ), opts.restart = 1000; end\n\nif epsilon < 0\n error('TFOCS error: epsilon is negative');\nend\n% we don't have solver_sBP_W, so am building this into this function:\n%if ~epsilon\n %error('TFOCS error: cannot handle epsilon = 0. Please call solver_sBP_W instead');\n%elseif epsilon < 100*builtin('eps')\n %warning('TFOCS:badConstraint',...\n %'TFOCS warning: epsilon is near zero; consider calling solver_sBP instead');\n%end\n\n% Need to estimate the norms of A*A' and W*W' in order to be most efficient\nif isfield( opts, 'noscale' ) && opts.noscale,\n normA2 = 1; normW2 = 1;\nelse\n normA2 = []; normW2 = [];\n if isfield( opts, 'normA2' ),\n normA2 = opts.normA2;\n opts = rmfield( opts, 'normA2' );\n end\n if isfield( opts, 'normW2' ),\n normW2 = opts.normW2;\n opts = rmfield( opts, 'normW2' );\n end\nend\nif isempty( normA2 ),\n normA2 = linop_normest( A ).^2;\nend\nif isempty( normW2 ),\n normW2 = linop_normest( W ).^2;\nend\n\n% if ~isfield(opts,'L0') || isempty(opts.L0)\n% opts.L0 = normA2/mu; % is this right? check\n% end\n\nproxScale = sqrt( normW2 / normA2 );\nif epsilon > 0\n prox = { prox_l2( epsilon ), proj_linf(proxScale) };\nelse\n prox = { proj_Rn, proj_linf(proxScale) };\nend\nW = linop_compose( W, 1 / proxScale );\n\n% Adding Jan 2014\nnonneg = false; box = false;\nif isfield(opts,'nonneg')\n nonneg = opts.nonneg;\n opts = rmfield(opts,'nonneg');\nend\nif isfield(opts,'nonNeg')\n nonneg = opts.nonNeg;\n opts = rmfield(opts,'nonNeg');\nend\nif nonneg \n % -- case: x >= 0 constraints\n proxP = proj_Rplus;\nelse\n % -- case: no x >= 0 constraint\n proxP = [];\nend\nif isfield(opts,'box')\n box = opts.box;\n if length(box)==2\n if nonneg, error('cannot use box constaints and non-neg constraints simultaneously');\n end\n proxP = proj_box(box(1),box(2));\n end\n opts = rmfield(opts,'box');\nend\n\n\n[varargout{1:max(nargout,1)}] = ...\n tfocs_SCD( proxP, { A, -b; W, 0 }, prox, mu, x0, z0, opts, varargin{:} );\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/solver_sBPDN_WW.m", "content": "function varargout = solver_sBPDN_WW( A, alpha, W1, beta, W2, b, epsilon, mu, x0, z0, opts, varargin )\n% SOLVER_SBPDN_WW BPDN with two separate (weighted) l1-norm terms. Uses smoothing.\n% [ x, out, opts ] = solver_sBPDN_WW( A, alpha, W_1, beta, W_2, b, epsilon, mu, x0, z0, opts )\n% Solves the smoothed basis pursuit denoising problem\n% minimize alpha*norm(W_1 x,1) + beta*norm(W_2 x, 1) + 0.5*mu*(x-x0).^2\n% s.t. norm(A*x-b,2) <= epsilon\n% by constructing and solving the composite dual.\n% A, W_1 and W_2 must be a linear operator or matrix, and b must be a vector. The\n% initial points x0, z0 and the options structure opts are optional.\n% See also solver_sBPDN and solver_sBPDN_W\n\n% Supply default values\nerror(nargchk(8,12,nargin));\nif nargin < 9, x0 = []; end\nif nargin < 10, z0 = []; end\nif nargin < 11, opts = []; end\nif ~isfield( opts, 'restart' ), opts.restart = 5000; end\n\nif epsilon < 0\n error('TFOCS error: epsilon is negative');\nend\nif ~epsilon\n error('TFOCS error: cannot handle epsilon = 0. Please call solver_sBP instead');\nelseif epsilon < 100*builtin('eps')\n warning('TFOCS:badConstraint',...\n 'TFOCS warning: epsilon is near zero; consider calling solver_sBP instead');\nend\n\n% Need to estimate the norms of A*A' and W*W' in order to be most efficient\nif isfield( opts, 'noscale' ) && opts.noscale,\n normA2 = 1; normW12 = 1; normW22 = 1;\nelse\n normA2 = []; normW12 = []; normW22 = [];\n if isfield( opts, 'normA2' )\n normA2 = opts.normA2;\n opts = rmfield( opts, 'normA2' );\n end\n if isfield( opts, 'normW12' )\n normW12 = opts.normW12;\n opts = rmfield( opts, 'normW12' );\n end\n if isfield( opts, 'normW22' )\n normW22 = opts.normW22;\n opts = rmfield( opts, 'normW22' );\n end\nend\nif isempty( normA2 ),\n normA2 = linop_normest( A ).^2;\nend\nif isempty( normW12 ),\n normW12 = linop_normest( W1 ).^2;\nend\nif isempty( normW22 ),\n normW22 = linop_normest( W2 ).^2;\nend\nif isempty(alpha), \n alpha = 1; \nend\nif isempty(beta), \n beta = 1; \nend\n\nproxScale1 = sqrt( normW12 / normA2 );\nproxScale2 = sqrt( normW22 / normA2 );\nprox = { prox_l2( epsilon ), ...\n proj_linf( proxScale1 * alpha ),...\n proj_linf( proxScale2 * beta ) };\nW1 = linop_compose( W1, 1 / proxScale1 );\nW2 = linop_compose( W2, 1 / proxScale2 );\n[varargout{1:max(nargout,1)}] = ...\n tfocs_SCD( [], { A, -b; W1, 0; W2, 0 }, prox, mu, x0, z0, opts, varargin{:} );\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/solver_sDantzig.m", "content": "function varargout = solver_sDantzig( A, b, delta, mu, x0, z0, opts, varargin )\n% SOLVER_SDANTZIG Dantzig selector problem. Uses smoothing.\n%[ x, out, opts ] = solver_sDantzig( A, b, delta, mu, x0, z0, opts )\n% Solves the smoothed Dantzig\n% minimize norm(x,1) + (1/2)*mu*norm(x-x0).^2\n% s.t. norm(D.*(A'*(A*x-b)),Inf) <= delta\n% by constructing and solving the composite dual\n% maximize - g_sm(z) - delta*norm(z,1)\n% where\n% gsm(z) = sup_x -norm(x,1)-(1/2)*mu*norm(x-x0)\n% A must be a linear operator, b must be a vector, and delta and mu\n% must be positive scalars. Initial points x0 and z0 are optional.\n% The standard calling sequence assumes that D=I. To supply a scaling,\n% pass the cell array { A, D } instead of A. D must either be a scalar,\n% a vector of weights, or a linear operator.\n\n% Supply default values\nerror(nargchk(4,8,nargin));\nif nargin < 5, x0 = []; end\nif nargin < 6, z0 = []; end\nif nargin < 7, opts = []; end\n\n% -- legacy options from original software --\nif isfield(opts,'lambda0')\n z0 = opts.lambda0;\n opts = rmfield(opts,'lambda0');\nend\nif isfield(opts,'xPlug')\n x0 = opts.xPlug;\n opts = rmfield(opts,'xPlug');\nend\nif isfield(opts,'solver')\n svr = opts.solver;\n opts = rmfield(opts,'solver');\n if isfield(opts,'alg') && ~isempty(opts.alg)\n disp('Warning: conflictiong options for the algorithm');\n else\n % if specified as \"solver_AT\", truncate:\n s = strfind( svr, '_' );\n if ~isempty(s), svr = svr(s+1:end); end\n opts.alg = svr;\n end\nend\n\n% Extract the linear operators\nD = [];\nif isa( A, 'cell' ),\n if length(A) > 1, D = A{2}; end\n A = A{1};\nend\nif isempty(D),\n D = @(x)x;\nelseif isa( D, 'double' ),\n D = @(x)D.*x;\nend\nif isa( A, 'double' ),\n A = linop_matrix(A);\nend\n\n% Call TFOCS\nobjectiveF = prox_l1;\naffineF = { @(y,mode)linear_DS( D, A, y, mode ), -D(A(b,2)) };\ndualproxF = prox_l1( delta );\n[varargout{1:max(nargout,1)}] = ...\n tfocs_SCD( objectiveF, affineF, dualproxF, mu, x0, z0, opts, varargin{:} );\n\n% Implements x -> D*A'*A*x and its adjoint if A is a linop\nfunction y = linear_DS( D, A, y, mode )\nswitch mode,\ncase 0, \n y = A([],0);\n if iscell( y ),\n y = { y{1}, y{1} };\n else\n y = { [y(2),1], [y(2),1] };\n end\ncase 1, y = D(A(A(y,1),2));\ncase 2, y = A(A(D(y),1),2);\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/solver_sDantzig_W.m", "content": "function varargout = solver_sDantzig_W( A,W, b, delta, mu, x0, z0, opts, varargin )\n% SOLVER_SDANTZIG_W Weighted Dantzig selector problem. Uses smoothing.\n%[ x, out, opts ] = solver_sDantzig_W( A,W, b, delta, mu, x0, z0, opts )\n% Solves the smoothed Dantzig\n% minimize norm(W*x,1) + (1/2)*mu*norm(x-x0).^2\n% s.t. norm(D.*(A'*(A*x-b)),Inf) <= delta\n% by constructing and solving the composite dual\n%\n% A and W must be a linear operator, b must be a vector, and delta and mu\n% must be positive scalars. Initial points x0 and z0 are optional.\n% The standard calling sequence assumes that D=I. To supply a scaling,\n% pass the cell array { A, D } instead of A. D must either be a scalar,\n% a vector of weights, or a linear operator.\n%\n% Pass in the options \"normA2\" and \"normW2\" (which are ||A||^2\n% and ||W||^2 respectively) for best efficiency.\n%\n% See also solver_sDantzig\n\n% Supply default values\nerror(nargchk(5,9,nargin));\nif nargin < 6, x0 = []; end\nif nargin < 7, z0 = []; end\nif nargin < 8, opts = []; end\n\nif isfield(opts,'solver')\n svr = opts.solver;\n opts = rmfield(opts,'solver');\n if isfield(opts,'alg') && ~isempty(opts.alg)\n disp('Warning: conflictiong options for the algorithm');\n else\n % if specified as \"solver_AT\", truncate:\n s = strfind( svr, '_' );\n if ~isempty(s), svr = svr(s+1:end); end\n opts.alg = svr;\n end\nend\n\n% Extract the linear operators\nD = [];\nif isa( A, 'cell' ),\n if length(A) > 1, D = A{2}; end\n A = A{1};\nend\nif isempty(D),\n D = @(x)x;\nelseif isa( D, 'double' ),\n D = @(x)D.*x;\nend\nif isa( A, 'double' ),\n % if \"A\" is not too rectangular, it is probably more efficient\n % to compute A'*A once at the beginning and store it.\n mn = min(size(A));\n mx = max(size(A));\n if mn >= .7*mx && mx < 1e5\n AA = @(y,mode)linear_DS_AA( D, A'*A, y, mode );\n A = linop_matrix(A);\n else\n A = linop_matrix(A);\n AA = @(y,mode)linear_DS( D, A, y, mode );\n end\nelse\n AA = @(y,mode)linear_DS( D, A, y, mode );\nend\n\n% Need to estimate the norms of A*A' and W*W' in order to be most efficient\nif isfield( opts, 'noscale' ) && opts.noscale,\n normA2 = 1; normW2 = 1;\nelse\n normA2 = []; normW2 = [];\n if isfield( opts, 'normA2' ),\n normA2 = opts.normA2;\n opts = rmfield( opts, 'normA2' );\n end\n if isfield( opts, 'normW2' ),\n normW2 = opts.normW2;\n opts = rmfield( opts, 'normW2' );\n end\nend\nif isempty( normA2 ),\n normA2 = linop_normest( A ).^2;\nend\nif isempty( normW2 ),\n normW2 = linop_normest( W ).^2;\nend\n\n% Call TFOCS\nproxScale = sqrt( normW2 / normA2 );\nprox = { prox_l1( delta ); proj_linf(proxScale) };\nW = linop_compose( W, 1/proxScale);\naffineF = {AA, -D(A(b,2)); W, 0 };\n[varargout{1:max(nargout,1)}] = ...\n tfocs_SCD( [], affineF, prox, mu, x0, z0, opts, varargin{:} );\n\n\n% Implements x -> D*A'*A*x and its adjoint if A is a linop\nfunction y = linear_DS( D, A, y, mode )\nswitch mode,\ncase 0, \n y = A([],0);\n if iscell( y ),\n y = { y{1}, y{1} };\n else\n y = { [y(2),1], [y(2),1] };\n end\ncase 1, y = D(A(A(y,1),2));\ncase 2, y = A(A(D(y),1),2);\nend\n\nfunction y = linear_DS_AA( D, AA, y, mode )\n% similar to above, but expects AA to be an explicit Hermitian matrix\nswitch mode,\ncase 0, \n y = size(AA);\n if iscell( y ),\n y = { y{1}, y{1} };\n else\n y = { [y(2),1], [y(2),1] };\n end\ncase 1, y = D(AA*y);\ncase 2, y = AA*D(y);\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/solver_sLMI.m", "content": "function varargout = solver_sLMI( A0, A, b, mu, x0, z0, opts, varargin )\n% SOLVER_SLMI Generic linear matrix inequality problems (LMI is the dual of a SDP). Uses smoothing.\n% [ y, out, opts ] = solver_sLMI( A0, A, b, mu, y0, z0, opts )\n% Solves the smoothed Linear-Matrix Inequality (LMI) problem\n%\n% minimize_y b'*y\n% s.t. A0 + sum_i A_i y(i) >= 0\n% \" >= 0 \" indicates that a matrix is positive semi-definite.\n% \n% \"A0\" and must be a symmetric/Hermitian matrix, \"b\" must be a vector, and \n% \"A\" must be a matrix (dense or sparse)\n% with the convention that each row of A stores the vectorized symmetric/Hermitian\n% matrix A_i, so that sum_i A_i y(i) can be written as mat(A'*y)\n% (where mat() reshapes a vector into a square matrix)\n% if \"A\" is a function, then in forward mode it should compute A'*y\n% and in transpose mode it should compute A*X\n%\n% Note: A0 and A_i must be symmetric/Hermitian, but this function\n% does not check for it, so the user must check. If you get\n% unexpected errors, this may be the culprit.\n%\n% For maximum efficiency, the user should specify the spectral norm of A,\n% via opts.normA\n% (e.g. opts.normA = norm(A) or opts.normA = normest(A))\n%\n% By default, this assumes variables are real.\n% To allow y to be complex, either pass in a complex value for y0\n% or make sure A or A0 is complex,\n% or specify opts.cmode = 'R2C'\n% (note: cmode = 'C2C' is not supported)\n%\n% See also solver_sSDP\n\n% Supply default values\nerror(nargchk(4,8,nargin));\nif nargin < 5, x0 = []; end\nif nargin < 6, z0 = []; end\nif nargin < 7, opts = []; end\nif ~isfield( opts, 'restart' ), opts.restart = 1000; end\n\n% Do we automatically re-scale \"A\"?\n% (there are two dual variables, one corresponding to Ax==b\n% and one corresponding to I*x >= 0, and the dual problem\n% is most efficient if norm(I) = norm(A),\n% hence we rescale A <-- A/norm(A) )\nif isfield( opts, 'noscale' ) && opts.noscale\n % The user has forced us not to automatically rescale\n normA = 1;\nelse\n normA = []; \n if isfield( opts, 'normA' ),\n normA = opts.normA;\n opts = rmfield( opts, 'normA' );\n end\nend\nif isempty( normA ),\n normA = linop_normest( A );\nend\nif isfield( opts, 'noscale' )\n opts = rmfield(opts,'noscale');\nend\n\n\nN = size(A0,1); if N ~= size(A0,2), error('\"A0\" must be square and symmetric'); end\nif ~isa(A,'function_handle')\n % We need to tell TFOCS that we'll be using matrix variables\n M = size(A,1); if size(A,2) ~= N^2, error('\"A\" has wrong number of columns'); end\n sz = { [M,1], [N,N] }; % specify dimensions of domain and range of A\n if isfield( opts, 'cmode' )\n cmode = opts.cmode;\n else\n if ~isempty(x0) && ~isreal(x0)\n cmode = 'R2C';\n elseif ~isreal(A) || ~isreal(A0)\n cmode = 'R2C'; % if A is complex, then X must be, in order to get real output\n else\n cmode = 'R2R'; % default assumption\n end\n end\n vec = @(x) x(:);\n mat = @(y) reshape(y,N,N);\n A = linop_handles( sz, @(y) mat(A'*y), @(X)real(A*vec(X)), cmode);\nend\n\n\n\n% Perform the re-scaling:\nA = linop_compose( A, 1 / normA );\nA0 = A0/normA;\n\n\nobj = smooth_linear(b);\n\n[varargout{1:max(nargout,1)}] = ...\n tfocs_SCD( obj, {A,A0}, {proj_psd}, mu, x0, z0, opts, varargin{:} );\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/solver_sLP.m", "content": "function varargout = solver_sLP( c, A, b, mu, x0, z0, opts, varargin )\n% SOLVER_SLP Generic linear programming in standard form. Uses smoothing.\n% [ x, out, opts ] = solver_sLP( c, A, b, mu, x0, z0, opts )\n% Solves the smoothed standard form Linear Program (LP)\n% minimize c'*x + 0.5*mu*||x-x0||_2^2\n% s.t. A * x == b and x >= 0\n% \n% \"c\" and \"b\" must be vectors, and \"A\" must be a matrix (dense or sparse)\n% or a function that computes A*x and A'*y (see help documentation).\n%\n% If the constraint \"x >= 0\" is not needed, then specify this by\n% setting:\n% opts.nonnegativity = false\n%\n% For maximum efficiency, the user should specify the spectral norm of A,\n% via opts.normA\n% (e.g. opts.normA = norm(A) or opts.normA = normest(A))\n%\n% July 13 2015, algorithm updated for x>=0 case. \n% Uses many fewer dual variables now,\n% convergence is faster, and the primal variable is guaranteed\n% to always be non-negative.\n% Also set to use non-linear CG when available\n\n% Supply default values\nerror(nargchk(4,8,nargin));\nif nargin < 5, x0 = []; end\nif nargin < 6, z0 = []; end\nif nargin < 7, opts = []; end\nif ~isfield( opts, 'restart' ), opts.restart = 1000; end\n\n\n% Do we include the x >= 0 constraint?\nNONNEG = true;\nif isfield(opts,'nonnegativity')\n if ~opts.nonnegativity\n NONNEG = false;\n end\n opts = rmfield(opts,'nonnegativity');\nend\n\n\n% Do we automatically re-scale \"A\"?\n% (there are two dual variables, one corresponding to Ax==b\n% and one corresponding to I*x >= 0, and the dual problem\n% is most efficient if norm(I) = norm(A),\n% hence we rescale A <-- A/norm(A) )\nif isfield( opts, 'noscale' ) && opts.noscale\n % The user has forced us not to automatically rescale\n normA = 1;\nelse\n normA = []; \n if isfield( opts, 'normA' ),\n normA = opts.normA;\n opts = rmfield( opts, 'normA' );\n end\nend\nif isempty( normA ),\n normA = linop_normest( A );\nend\nif isfield( opts, 'noscale' )\n opts = rmfield(opts,'noscale');\nend\n\n% Perform the re-scaling:\nif isnumeric(A), A = A/normA; % do it once\nelse\nA = linop_compose( A, 1 / normA );\nend\nb = b/normA;\n\n\nobj = smooth_linear(c);\n\nif exist('tfocs_CG','file') && exist('wp_ls','file') % wp_ls.m is the linesearch code for the nonliner CG\n if ~isfield(opts,'alg') || isempty(opts.alg)\n opts.alg = 'CG';\n disp('Using non-linear conjugate gradients');\n end\nend\n\nif ~NONNEG\n % There is no x >= 0 constraint:\n % Note: [] after {A,-b} is equivalent to proj_Rn\n [varargout{1:max(nargout,1)}] = ...\n tfocs_SCD( obj, { A, -b }, [], mu, x0, z0, opts, varargin{:} );\nelse\n % There is a x >= 0 constraint:\n% [varargout{1:max(nargout,1)}] = ...\n% tfocs_SCD( obj, { 1,0;A,-b}, {proj_Rplus,proj_Rn}, mu, x0, z0, opts, varargin{:} );\n % New, July 13 2015, exploting new prox_shift function. Much better!\n obj = prox_shift(proj_Rplus,c);\n [varargout{1:max(nargout,1)}] = ...\n tfocs_SCD( obj, { A, -b }, [], mu, x0, z0, opts, varargin{:} );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/solver_sLP_box.m", "content": "function varargout = solver_sLP_box( c, A, b, l, u, mu, x0, z0, opts, varargin )\n% SOLVER_SLP_BOX Generic linear programming with box constraints. Uses smoothing.\n% [ x, out, opts ] = solver_sLP_box( c, A, b, l, u, mu, x0, z0, opts )\n% Solves the smoothed standard form Linear Program (LP) with box-constraints\n% minimize c'*x + 0.5*mu*||x-x0||_2^2\n% s.t. A * x == b and l <= x <= b\n% \n% \"c\" and \"b\" must be vectors, and \"A\" must be a matrix (dense or sparse)\n% or a function that computes A*x and A'*y (see help documentation).\n% \"l\" and \"u\" are vectors, or scalars (in which case they are a scalar\n% times the vector of all ones )\n%\n% If only \"l\" (or only \"u\") is needed, set \"u\" (or \"l\") to the empty matrix [].\n%\n% For maximum efficiency, the user should specify the spectral norm of A,\n% via opts.normA\n% (e.g. opts.normA = norm(A) or opts.normA = normest(A))\n%\n% July 13, 2015, algorithmic change to improve the performance.\n% Also set to use non-linear CG when available\n%\n% See also solver_sLP\n\n% Supply default values\nerror(nargchk(6,10,nargin));\nif nargin < 7, x0 = []; end\nif nargin < 8, z0 = []; end\nif nargin < 9, opts = []; end\nif ~isfield( opts, 'restart' ), opts.restart = 1000; end\n\n\n\n% Do we automatically re-scale \"A\"?\n% (there are two dual variables, one corresponding to Ax==b\n% and one corresponding to I*x >= 0, and the dual problem\n% is most efficient if norm(I) = norm(A),\n% hence we rescale A <-- A/norm(A) )\nif isfield( opts, 'noscale' ) && opts.noscale\n % The user has forced us not to automatically rescale\n normA = 1;\nelse\n normA = []; \n if isfield( opts, 'normA' ),\n normA = opts.normA;\n opts = rmfield( opts, 'normA' );\n end\nend\nif isempty( normA ),\n normA = linop_normest( A );\nend\nif isfield( opts, 'noscale' )\n opts = rmfield(opts,'noscale');\nend\n\n% Perform the re-scaling:\nif isnumeric(A), A = A/normA; % do it once\nelse\nA = linop_compose( A, 1 / normA );\nend\nb = b/normA;\n\n\nobj = smooth_linear(c);\n\nif exist('tfocs_CG','file')&& exist('wp_ls','file') % wp_ls.m is the linesearch code for the nonliner CG\n opts.alg = 'CG';\n disp('Using non-linear conjugate gradients');\nend\n\nif isempty(l) && isempty(u)\n % There is no x >= 0 constraint:\n [varargout{1:max(nargout,1)}] = ...\n tfocs_SCD( obj, { A, -b }, [], mu, x0, z0, opts, varargin{:} );\nelse\n % added Juy 13, 2015\n % This has fewer dual variables and should be much better!\n obj = prox_shift( proj_box(l,u), c );\n \n [varargout{1:max(nargout,1)}] = ...\n tfocs_SCD( obj, { A, -b }, [], mu, x0, z0, opts, varargin{:} );\n \n% elseif isempty(u)\n% % There is a x >= l constraint, i.e. x - l >= 0\n% [varargout{1:max(nargout,1)}] = ...\n% tfocs_SCD( obj, { 1,-l;A,-b}, {proj_Rplus,proj_Rn}, mu, x0, z0, opts, varargin{:} );\n% elseif isempty(l)\n% % There is a x <= u constraint, i.e. -x + u >= 0\n% [varargout{1:max(nargout,1)}] = ...\n% tfocs_SCD( obj, {-1, u;A,-b}, {proj_Rplus,proj_Rn}, mu, x0, z0, opts, varargin{:} );\n% else\n% % have both upper and lower box constraints\n% [varargout{1:max(nargout,1)}] = ...\n% tfocs_SCD( obj, {1,-l;-1, u;A,-b}, {proj_Rplus,proj_Rplus,proj_Rn}, mu, x0, z0, opts, varargin{:} );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/solver_sNuclearBP.m", "content": "function varargout = solver_sNuclearBP( omega, b, mu, x0, z0, opts, varargin )\n% SOLVER_SNUCLEARBP Nuclear norm basis pursuit problem (i.e. matrix completion). Uses smoothing.\n% [ x, out, opts ] = solver_sNuclearBP( omega, b, mu, X0, Z0, opts )\n% Solves the smoothed nuclear norm basis pursuit problem\n% minimize norm_nuc(X) + 0.5*mu*norm(X-X0,'fro').^2\n% s.t. A_omega * x == b\n% by constructing and solving the composite dual\n% maximize - g_sm(z)\n% where\n% g_sm(z) = sup_x -norm(x,1)-(1/2)*mu*norm(x-x0)\n% A_omega is the restriction to the set omega, and b must be a vector. The\n% initial point x0 and the options structure opts are optional.\n%\n% The \"omega\" term may be in one of three forms:\n% (1) OMEGA, a sparse matrix. Only the nonzero pattern is important.\n% (2) {n1,n2,omega}, a cell, where [n1,n2] = size(X), and omega\n% is the vector of linear indices of the observed set\n% (3) {n1,n2,omegaI,omegaJ}, a cell. Similar to (2), except the set\n% omega is now specified by subscripts. Specifically,\n% omega = sub2ind( [n1,n2], omegaI, omegaJ) and\n% [omegaI,omegaJ] = ind2sub( [n1,n2], omega )\n%\n% If the options field \"largeScale\" is provided and set to true, then uses\n% a Lanczos-based SVD\n\n% Supply default values\nerror(nargchk(3,7,nargin));\nif nargin < 4, x0 = []; end\nif nargin < 5, z0 = []; end\nif nargin < 6, opts = []; end\nif ~isfield( opts, 'restart' ), \n opts.restart = 50; \nend\n\nif isempty(omega)\n error( 'Sampling operator cannot be empty.' );\nelseif issparse(omega)\n [omegaI,omegaJ] = find(omega);\n [n1,n2] = size(omega);\n omega_lin = sub2ind( [n1,n2], omegaI, omegaJ );\nelseif iscell(omega)\n switch length(omega)\n case 3,\n [ n1, n2, omega_lin ] = deal( omega{:} );\n [omegaI,omegaJ] = ind2sub( [n1,n2], omega_lin );\n case 4\n [ n1, n2, omegaI, omegaJ ] = deal( omega{:} );\n omega_lin = sub2ind( [n1,n2], omegaI, omegaJ );\n otherwise\n error( 'Incorrect format for the sampling operator.' );\n end\nelse\n error( 'Incorrect format for the sampling operator.' );\nend\nnnz = numel(omega_lin);\nomega_lin = omega_lin(:); % make it a column vector\nb = b(:); % make it a column vector\nif ~isequal( size(b), [ nnz, 1 ] ),\n error( 'Incorrect size for the sampled data.' );\nend\n\n% automatically do kicking on the dual variable:\nif isempty(z0)\n z0 = sparse(omegaI,omegaJ,b,n1,n2); \n nY = linop_normest(z0,'R2R',1e-4,300);\n z0 = b/nY;\nend\n\npackSVDflag = isa(x0,'packSVD');\n% Note: packSVD is not supported, so has been removed\nA = @(varargin)linop_nuclear( n1, n2, nnz, omega_lin, omegaI, omegaJ,packSVDflag, varargin{:} );\n\nq=1;\nif isfield(opts,'largeScale') && opts.largeScale\n prox = prox_nuclear(q,true);\nelse\n prox = prox_nuclear(q);\nend\nif isfield(opts,'largeScale'), opts = rmfield(opts,'largeScale'); end\n\n[varargout{1:max(nargout,1)}] = ...\n tfocs_SCD( prox, { A, -b }, proj_Rn, mu, x0, z0, opts, varargin{:} );\n\n%\n% Implements the matrix sampling operator: X -> [X_ij]_{i,j\\in\\omega}\n%\nfunction y = linop_nuclear( n1, n2, nnzs, omega, omegaI, omegaJ, packSVDflag, x, mode )\nswitch mode,\n case 0,\n y = { [n1,n2], [nnzs,1] };\n case 1,\n% y = x(omega);\n S = [];\n S.type = '()';\n S.subs = {omega};\n y = subsref(x,S);\n case 2,\n y = sparse( omegaI, omegaJ, x, n1, n2 );\n if packSVDflag\n y = packSVD(y);\n end\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/solver_sNuclearBPDN.m", "content": "function varargout = solver_sNuclearBPDN( omega, b, epsilon, mu, x0, z0, opts, varargin )\n% SOLVER_SNUCLEARBPDN Nuclear norm basis pursuit problem with relaxed constraints. Uses smoothing.\n% [ x, out, opts ] = solver_sNuclearBPDN( omega, b, epsilon,mu, X0, Z0, opts )\n% Solves the smoothed nuclear norm basis pursuit problem\n% minimize norm_nuc(X) + 0.5*mu*norm(X-X0,'fro').^2\n% s.t. ||A_omega * x - b || <= epsilon\n% by constructing and solving the composite dual\n% maximize - g_sm(z)\n% where\n% g_sm(z) = sup_x -norm(x,1)-(1/2)*mu*norm(x-x0)\n% A_omega is the restriction to the set omega, and b must be a vector. The\n% initial point x0 and the options structure opts are optional.\n%\n% The \"omega\" term may be in one of three forms:\n% (1) OMEGA, a sparse matrix. Only the nonzero pattern is important.\n% (2) {n1,n2,omega}, a cell, where [n1,n2] = size(X), and omega\n% is the vector of linear indices of the observed set\n% (3) {n1,n2,omegaI,omegaJ}, a cell. Similar to (2), except the set\n% omega is now specified by subscripts. Specifically,\n% omega = sub2ind( [n1,n2], omegaI, omegaJ) and\n% [omegaI,omegaJ] = ind2sub( [n1,n2], omega )\n\n% Supply default values\nerror(nargchk(4,8,nargin));\nif nargin < 5, x0 = []; end\nif nargin < 6, z0 = []; end\nif nargin < 7, opts = []; end\nif ~isfield( opts, 'restart' ), \n opts.restart = 50; \nend\n\nif isempty(omega)\n error( 'Sampling operator cannot be empty.' );\nelseif issparse(omega)\n [omegaI,omegaJ] = find(omega);\n [n1,n2] = size(omega);\n omega_lin = sub2ind( [n1,n2], omegaI, omegaJ );\nelseif iscell(omega)\n switch length(omega)\n case 3,\n [ n1, n2, omega_lin ] = deal( omega{:} );\n [omegaI,omegaJ] = ind2sub( [n1,n2], omega_lin );\n case 4\n [ n1, n2, omegaI, omegaJ ] = deal( omega{:} );\n omega_lin = sub2ind( [n1,n2], omegaI, omegaJ );\n otherwise\n error( 'Incorrect format for the sampling operator.' );\n end\nelse\n error( 'Incorrect format for the sampling operator.' );\nend\nnnz = numel(omega_lin);\nif ~isequal( size(b), [ nnz, 1 ] ),\n error( 'Incorrect size for the sampled data.' );\nend\n\n% TODO: see the new linop_subsample.m file\nA = @(varargin)linop_nuclear( n1, n2, nnz, omega_lin, omegaI, omegaJ, varargin{:} );\n[varargout{1:max(nargout,1)}] = ...\n tfocs_SCD( prox_nuclear, { A, -b }, prox_l2(epsilon), mu, x0, z0, opts, varargin{:} );\n\n%\n% Implements the matrix sampling operator: X -> [X_ij]_{i,j\\in\\omega}\n%\nfunction y = linop_nuclear( n1, n2, nnz, omega, omegaI, omegaJ, x, mode )\nswitch mode,\n case 0,\n y = { [n1,n2], [nnz,1] };\n case 1,\n y = x(omega);\n case 2,\n y = sparse( omegaI, omegaJ, x, n1, n2 );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/solver_sSDP.m", "content": "function varargout = solver_sSDP( c, A, b, mu, x0, z0, opts, varargin )\n% SOLVER_SSDP Generic semi-definite programs (SDP). Uses smoothing.\n% [ x, out, opts ] = solver_sSDP( C, A, b, mu, X0, z0, opts )\n% Solves the smoothed standard form Semi-Definite Program (SDP)\n% minimize trace(C'*X) + 0.5*mu*||X-X0||_F^2\n% s.t. A * vec(X) == b and X >= 0\n% where X >= 0 indicates that X is positive semi-definite.\n% \n% \"C\" and must be a matrix, \"b\" must be a vector, and \n% \"A\" must be a matrix (dense or sparse)\n% or a function that computes A*x and A'*y (see help documentation).\n% The operation b = A*vec(X) is equivalent to\n% b_i = trace( A_i'*X ) for i = 1:size(A,1), where A_i is the symmetric\n% matrix formed by reshaping the ith row of A.\n%\n%\n% For maximum efficiency, the user should specify the spectral norm of A,\n% via opts.normA\n% (e.g. opts.normA = norm(A) or opts.normA = normest(A))\n%\n% By default, this assumes variables are real.\n% To allow X to be complex, either pass in a complex value for X0\n% or make sure A is complex,\n% or specify opts.cmode = 'C2R'\n% (note: cmode = 'C2C' is not supported)\n%\n% July 2015, improved model. Fewer dual variables, faster convergence.\n% Also, use non-linear conjugate gradients if available\n%\n% See also solver_sLMI\n\n% Supply default values\nerror(nargchk(4,8,nargin));\nif nargin < 5, x0 = []; end\nif nargin < 6, z0 = []; end\nif nargin < 7, opts = []; end\nif ~isfield( opts, 'restart' ), opts.restart = 1000; end\n\n% Do we automatically re-scale \"A\"?\n% (there are two dual variables, one corresponding to Ax==b\n% and one corresponding to I*x >= 0, and the dual problem\n% is most efficient if norm(I) = norm(A),\n% hence we rescale A <-- A/norm(A) )\nif isfield( opts, 'noscale' ) && opts.noscale\n % The user has forced us not to automatically rescale\n normA = 1;\nelse\n normA = []; \n if isfield( opts, 'normA' ),\n normA = opts.normA;\n opts = rmfield( opts, 'normA' );\n end\nend\nif isempty( normA ),\n normA = linop_normest( A );\nend\nif isfield( opts, 'noscale' )\n opts = rmfield(opts,'noscale');\nend\n\n\nN = size(c,1); if N ~= size(c,2), error('\"C\" must be square and symmetric'); end\nif ~isa(A,'function_handle')\n % We need to tell TFOCS that we'll be using matrix variables\n M = size(A,1); if size(A,2) ~= N^2, error('\"A\" has wrong number of columns'); end\n sz = { [N,N], [M,1] }; % specify dimensions of domain and range of A\n if isfield( opts, 'cmode' )\n cmode = opts.cmode;\n else\n if ~isempty(x0) && ~isreal(x0)\n cmode = 'C2R';\n elseif ~isreal(A) || ~isreal(c) % bug fix, Tue Apr 26, 2011\n cmode = 'C2R'; % if A is complex, then X must be, in order to get real output\n else\n cmode = 'R2R'; % default assumption\n end\n end\n vec = @(x) x(:);\n mat = @(y) reshape(y,N,N);\n A = linop_handles( sz, @(X)real(A*vec(X)), @(y) mat(A'*y),cmode);\nend\n\n\n\n% Perform the re-scaling:\nA = linop_compose( A, 1 / normA );\nb = b/normA;\n\nif exist('tfocs_CG','file') && exist('wp_ls','file') % wp_ls.m is the linesearch code for the nonliner CG\n opts.alg = 'CG';\n disp('Using non-linear conjugate gradients');\nend\n\n% obj = smooth_linear(c);\n% [varargout{1:max(nargout,1)}] = ...\n% tfocs_SCD( obj, { 1,0;A,-b}, {proj_psd,proj_Rn}, mu, x0, z0, opts, varargin{:} );\n% ind = 2;\n\n% July 13 2015, better model (fewer dual variables)\nobj = prox_shift( proj_psd, c );\n[varargout{1:max(nargout,1)}] = ...\n tfocs_SCD( obj, {A,-b}, [], mu, x0, z0, opts, varargin{:} );\nind = 1;\n\n% and undo the scaling by normA:\nif nargout >= 2 && isfield( varargout{1},'dual' ) && normA ~= 1\n if isa( varargout{2}.dual,'tfocs_tuple')\n varargout{2}.dual = tfocs_tuple( {varargout{2}.dual{1}, varargout{2}.dual{2}/normA });\n else\n varargout{2}.dual{ind} = varargout{2}.dual{ind}/normA;\n end\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/test_Lipschitz.m", "content": "function L = test_Lipschitz( f, N , nRep, Ltest, lb, ub, scale)\n% TEST_LIPSCHITZ Checks that the TFOCS smooth function object \"f\"\n% has a Lipschitz continuous gradient.\n% L = TEST_LIPSCHITZ( f, N )\n% outputs an estimated Lipschitz constant\n% L = TEST_LIPSCHITZ( f, N, nRep )\n% outputs an estimated Lipschitz constant based on nRep points\n%\n% L = TEST_LIPSCHITZ( f, N, nRep, L_guess )\n% tests is the Lipschitz constant is certainly larger than L_guess\n%\n% ... = TEST_LIPSCHITZ( ..., lb, ub, scale )\n% controls how input points are sampled. They are sampled\n% as scale*randn(), and then thresholded to be bigger (element-wise)\n% than the lowerbound \"lb\", and less than the upperbound \"ub\"\n% (leave lb and/or ub at the empty matrix [] to set them\n% to -Inf and +Inf, resp.)\n%\n% Stephen Becker, 4/3/2017\n\nif numel(N) == 1\n N(2) = 1;\nend\nif nargin < 3 || isempty( nRep )\n nRep = 10;\nend\nif nargin < 4 || isempty(Ltest)\n Ltest = Inf;\nend\nif nargin < 5 || isempty(lb), lb = -Inf; end\nif nargin < 6 || isempty(ub), ub = Inf; end\nif nargin < 7 || isempty(scale), scale = 10; end\n\n% Generate a lot of points\nX = cell( nRep, 1 );\nF = zeros( nRep, 1 );\ngra = cell( nRep, 1 );\nfor rep = 1:nRep\n x = max( min(scale*randn(N),ub), lb );\n X{rep} = x;\n [F(rep),gra{rep}] = f( x );\n \nend\n \nif nRep <= 20\n % find all pairs\n list = nchoosek( 1:nRep, 2 );\nelse\n % there are a lot, so just pick some of them\n list = zeros( 400, 2 );\n for i = 1:size(list,1)\n list(i,:) = randsample( nRep, 2 )';\n end\nend\n\nL = 0;\nfor k = 1:size(list,2)\n i = list(k,1);\n j = list(k,2);\n \n xg = dot( X{i} - X{j}, gra{i} - gra{j} );\n dg = norm( gra{i} - gra{j} );\n dx = norm( X{i} - X{j} );\n \n % need || gradient_i - gradient_j || <= L * || x_i - x_j ||\n L = max( L, dg/dx );\n if L > Ltest, fprintf(2,'Found L > Ltest from criteria 1\\n'); return; end\n \n % need dot( gradient_i - gradient_j, x_i - x_j ) <= L || x_i - x_j ||^2\n L = max( L,xg/(dx^2) );\n if L > Ltest, fprintf(2,'Found L > Ltest from criteria 2\\n'); return; end\n \n % need ||gradient_i - gradient_j||^2 <= L*dot( gradient_i - gradient_j, x_i - x_j )\n L = max( L, dg^2/xg );\n if L > Ltest, fprintf(2,'Found L > Ltest from criteria 3\\n'); return; end\n \n % need f(i) <= f(j) + dot( gradient_j, x_i-x_j) + L/2||x_i-x_j||^2\n L = max( L, ( F(i)-F(j) - dot( gra{j}, X{i} - X{j} ) )/( dx^2/2 ) );\n if L > Ltest, fprintf(2,'Found L > Ltest from criteria 4\\n'); return; end\nend\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2017 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/test_nonsmooth.m", "content": "function varargout = test_nonsmooth( f, N, DOM )\n% TEST_NONSMOOTH Runs diagnostic tests to ensure a non-smooth function conforms to TFOCS conventions\n% TEST_NONSMOOTH( F )\n% tests whether the function handle F works as a tfocs non-nonsmooth\n% function object.\n%\n% Requirements: \n% f = F(X) must return the value of the function at X.\n% p = F(X,t) must return the proximity operator of F at X,\n% i.e. p = argmin_y F(y) + 1/(2*t)||y-x||^2\n%\n% For an example, see PROX_L1.M\n% \n% TEST_NONSMOOTH( F, N )\n% specifies the size of the domain space. If N is a scalar,\n% then the domain space is the set of N x 1 vectors.\n% If N is a matrix of the form [n1, n2], the the domain\n% space is the set of n1 x n2 matrices.\n%\n% TEST_NONSMOOTH( ..., DOM )\n% specifies the domain of F. DOM can be of the form [a,b]\n% which signifies the 1D set (a,b).\n%\n% OK = TEST_NONSMOTH(...)\n% returns \"true\" if all tests are passed, and \"false\" otherwise.\n%\n% Example:\n% test_nonsmooth( prox_l1 )\n%\n% See also private/tfocs_prox, prox_l1\n\nOK = false;\nPLOT = true;\n\nerror(nargchk(1,3,nargin));\n\nif ~isa(f,'function_handle')\n fail('TFOCS nonsmooth function must be a FUNCTION HANDLE');\n return; \nend\nfprintf('== Testing the nonnonsmooth function %s ==\\n', func2str(f) );\n\nif nargin < 2 || isempty(N), N = 10; end\nif nargin < 3 || isempty(DOM), DOM = [-1,1]; end\n\na = DOM(1); b = DOM(2);\n\nx = (a+b)/2;\nfprintf('Testing scalar inputs... \\n');\ntry \n vi = f(x);\ncatch\n fail('TFOCS nonsmooth function failed to return a function value');\n return;\nend\nif isinf(vi)\n fail('TFOCS nonsmooth function tester: default domain is invalid. Please specify valid domain');\n return;\nend\nfprintf('\\t\\t\\t\\t...passed. \\n');\n\n% Now, also ask for the prox\nfprintf('Testing proximity operator output... \\n');\nt = 1;\ntry \n [vi,gi] = f(x,t);\ncatch\n fail('TFOCS nonsmooth function failed to compute a valid proximity operator');\n return;\nend\nfprintf('\\t\\t\\t\\t...passed. \\n');\n\n\n% find a reasonable value of t:\nx = a + .9*(b-a);\n[vi,gi] = f(x,t);\ncntr = 0;\n% This is only good for proximity functions: for projections,\n% the value of \"t\" has no effect:\nif strfind( func2str(f), 'proj' )\n disp('Looks like this is a projection: this test may not work correctly.');\nelse\n disp('Looks like this is a proximity operator');\n while norm(gi - x )/norm(x) > .8 && cntr < 20\n t = t/2;\n cntr = cntr + 1;\n [vi,gi] = f(x,t);\n end\nend\n% for t = 0, we have gi = x\n% for t = Inf, gi is independent of x (i.e. gi = argmin_x f(x),\n% which, for f(x) = ||x||, is gi = 0 ).\n\n\n\n% Now, try a vector\nif isscalar(N)\n x = repmat(x,N,1);\nelse\n x = repmat(x,N(1),N(2));\n % if a > 0, assume we want a PSD matrix:\n if a >= 0\n x = ones(N(1),N(2)) + eye(N(1),N(2) );\n end\nend\nfprintf('Testing vector inputs... \\n');\ntry \n vi = f(x);\ncatch\n fail('TFOCS nonsmooth function failed to compute f when supplied a vector input');\n return;\nend\ntry \n [vi,gi] = f(x,t);\ncatch\n fail('TFOCS nonsmooth function failed to compute prox_f when supplied a vector input');\n return;\nend\nif ~isscalar(vi)\n fail('TFOCS nonsmooth function value must be a scalar');\n return;\nend\nif ~all( size(gi) == size(x) )\n fail('TFOCS nonsmooth proximity function value must be same size as input');\n return;\nend\nfprintf('\\t\\t\\t\\t...passed. \\n');\n\n% gi = prox_{f,t}(x)\n% let's verify that gi is actually a minimizer, by\n% plotting the values for a few nearby points\ns = min(t,.9*x(1,1) );\nx = x + .1/norm(x,Inf)*randn(size(x));\n[vi,gi] = f(x,s);\nobjective = @(y) f(y) + 1/(2*s)*norm(y-x,'fro')^2;\nfprintf('Verifying the validity of the proximity calculation...\\n');\nobjGi = objective(gi);\nfprintf('\\tprox(x) has objective value: %.3e\\n', objGi );\nsc = 1/norm(gi,'inf');\nOK_objective = true;\nfor t = 1:20\n randPt = gi + .01*sc*randn(size(gi));\n obj = objective(randPt);\n fprintf('\\tRandom pt #%2d has larger objective value by %7.2e', t,obj-objGi);\n if obj < objGi\n fprintf(' -- SMALLER!! This shouldn''t happen');\n OK_objective = false;\n end\n fprintf('\\n');\nend\nif ~OK_objective\n fail('TFOCS nonsmooth: incorrect calculation of proximity function');\n return;\nend\nfprintf('\\t\\t\\t\\t...passed. \\n');\n\n\n% 1D example. Does not require function to be vectorized\nn = 200; % number of grid points\nh = (b-a)/n;\ngrid = (a+h/2):h:(b-h/2);\n% include \"0\" so things look nice and pointy:\nif a < 0 && b > 0\n grid = unique( [grid,0] );\nend\n% if isscalar(N)\n% grid = repmat( grid, N, 1 );\n% % grid( 2:end, : ) = 0.5*grid( 2:end, : );\n% grid( 2:end, : ) = 0;\n% end\n\nn = size(grid,2);\nv = zeros(1,n);\ng = zeros(1,n);\nfor i = 1:length(grid)\n v(i) = f(grid(1,i) );\n [vi,gi] = f(grid(:,i), t );\n g(i) = gi(1);\nend\ngrid = grid(1,:);\nif PLOT\n figure;\n clf;\n plot(grid,v,'-','linewidth',2);\n hold all\n plot(grid,g,'-','linewidth',2);\n Y = get(gca,'ylim');\n Y(2) = 1.1*Y(2);\n set(gca,'ylim',Y);\n \n legend('function','proximity operator');\n% title(func2str(f),'interpreter','none');\n title(sprintf('function, and proximity operator, with parameter t = %.3f',t))\n line([a,b], 0*[1,1],'color','k' )\n if a < 0 && b > 0\n line( 0*[1,1], get(gca,'ylim'),'color','k' );\n end\n % show the y = x line\n line( [a,b], [a,b], 'linestyle','--','color','k');\n \nend\n\nOK = true;\n\n\ndisp('Test passed succesfully.');\nif nargout > 0\n varargout{1} = OK;\nend\n\n\n\nfunction fail(str)\n disp('Test failed. Reason:');\n disp(str);\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/test_proxPair.m", "content": "function varargout = test_proxPair( f, g, N, nTrials, force_gama,tol,break_on_bad,negScale )\n% TEST_PROXPAIR Runs diagnostics on a pair of functions to check if they are Legendre conjugates.\n% maxEr = test_proxPair( f, g )\n% will run tests to determine if f and g are really\n% Legendre-Fenchel conjugates.\n% f and g should be in TFOCS form (see examples below)\n% which means they not only compute a function value f(x)\n% but that they can also return the proximity operator. \n% The test points are assumed to be scalars by default (N=1)\n%\n% ... = test_proxPair( f, g, N )\n% Same test, but now the test points will be vectors of length N\n% ... = test_proxPair( f, g, x0 )\n% Test points will have the same size as x0. If x0 is a square matrix\n% other than the zero or identity matrix, the domain will be the set of symmetric\n% matrices if x0 is symmetric. If x0 is positive semidefinite, domain is taken\n% to be the set of positive semidefinite matrices.\n% ... = test_proxPair( f, g, [N or x0], nTrials )\n% will run \"nTrials\" (default: 10)\n% ... = test_proxPair( f, g, [N or x0], nTrials, t )\n% will use the proximity operator:\n% prox_f(v) = argmin f(x) + 1/(2t) *||x-v||^2\n% \n% If the function works for t = 1 but not for other t,\n% this helps you track down the bug (perhaps there is a t vs 1/t confusion\n% somewhere...)\n% \n% (default: t>0 is chosen randomly on every trial )\n%\n% ... = test_proxPair( f, g, [N or x0], nTrials, t, tol )\n% sets the tolerance level for considering an inequality to be violated\n% (default is 1e-8)\n% [x_bad, gamma_bad] = test_proxPair( ..., 'break' )\n% will return the offending point in the case that one of the the inequalities\n% has been violated. If no inequalities are violated, then the empty\n% matrices are returned.\n% \n% Note: TFOCS uses the dual function composed with the negative identity operator,\n% so you may wish to use prox_scale( g,-1) instead of just g.\n% ... = test_proxPair( f, g, [N or x0], nTrials, t, tol, break, negScale )\n% will automatically change g to prox_scale(g,-1) if negScale=true \n% (default: false)\n% \n% Examples of valid pairs (f,g) (where q is any positive scalar, r is any scalar):\n% \n% f = prox_l1(q); and g = proj_linf(q);\n% f = proj_l1(q); and g = prox_linf(q);\n% f = proj_l2(q); and g = prox_l2(q);\n% f = prox_hinge(q,r); and g = prox_hingeDual(q,r);\n% f = proj_Rn; and g = proj_0;\n% f = proj_Rplus; and g = proj_Rplus(-1); \n% f = proj_nuclear; and g = prox_spectral;\n% f = prox_nuclear; and g = proj_spectral;\n% f = prox_trace; and g = proj_spectral(1,'symm') for X >= 0\n% f = proj_psdUTrace;and g = prox_spectral(1,'symm') fr X >= 0\n% \n% Recall the definition of the conjugate function:\n% g(y) = f^*(y) = sup_x - f(x)\n% f(x) = sup_y - f^*(y)\n% We use Moreau's Decomposition to generate identities. See Combettes and Wajs '05,\n% lemma 2.10, http://www.ann.jussieu.fr/~plc/mms1.pdf\n% Moreau's decomposition is:\n% for all x, x = prox_( gamma*f )( x ) + gamma*prox_( g/gamma )( x/gamma )\n% \n% and TFOCS uses (since t > 0)\n% prox(f)(t)(x) := argmin f(v) + 1/(2t)||v-x||^2\n% = argmin t*f(v) + 1/2 *||v-x||^2 [ N.B. This is NOT 1/t*argmin... ]\n% = prox_( t*f )( x )\n% \n% so the identity in terms of TFOCS prox is:\n% x = prox(f)(gamma)(x) + gamma*prox(g)(1/gamma)(x/gamma) ( ID 1 )\n% = xf + xg\n% \n% We also have the identity:\n% f(xf) + g(xg/gamma) = / gamma ( ID 2 )\n% where xf and xg defined above.\n% [ f(xf) + g(xg/gamma) >= /gamma ] is the Fenchel-Young inequality.\n% \n% The final identity is:\n% ||x||^2/2 = gamma[ f^(gamma)(x) + g^(1/gamma)(x/gamma) ] ( ID 3 )\n% where\n% f^t(x) = min f(v) + 1/(2t)||v-x||^2\n% \n% These three identities are the three columns of errors output by this test function.\n% See also prox_dualize.m \n\n\nerror(nargchk(2,8,nargin));\nif nargin < 3 || isempty(N), N = 1; end\nif ~isscalar(N)\n x0 = N;\n % Check: if x0 is a symmetric matrix, then we assume domain\n % is set of symmetric matrices. If it is also positive semidefinite,\n % we assume domain is set of symmetric positive semidefinite matrices\n % (but if x0 is all zeros or the identity, then do not make any assumptions)\n [m,n] = size(x0);\n if m == n && norm( x0-x0', 'fro' ) < 1e-10 && ...\n norm( x0-eye(n),'fro') > 1e-10 && norm(x0,'fro') > 1e-10\n % it is symmetric\n if min(eig(x0)) >= -1e-14\n fprintf('Assuming domain is set of positive semidefinite matrcies\\n');\n symm = @(X) X*X';\n else\n fprintf('Assuming domain is set of Hermitian matrices\\n');\n symm = @(X) (X+X')/2;\n end\n else\n symm = @(x) x; % do not symmetrize\n end\n if issparse(x0)\n fprintf('Assuming domain is set of sparse matrices\\n');\n newX = @() 100*symm(sprandn( m,n,.01 ));\n else\n newX = @() 100*symm(randn( size(N) ));\n end\n fprintf('Using a domain of size %d x %d\\n', m, n );\nelse\n fprintf('Using a domain of size %d x %d\\n', N, 1 );\n newX = @() 100*randn( N, 1 );\nend\n\nif nargin < 4 || isempty(nTrials), nTrials = 10; end\nif nargin < 5 || isempty(force_gama), force_gama = false; end\n% Note: \"gamma\" mispelled on purpose, since Matlab's \"gamma\" function\n% creates problems when variables are named \"gamma\"\nif nargin < 6 || isempty(tol), tol = 1e-8; end\nif nargin < 7, break_on_bad=[];end\nif strfind( lower(break_on_bad), 'break')\n break_on_bad = true;\nelse\n break_on_bad = false;\nend\nif nargin < 8 || isempty(negScale), negScale = false; end\n\n% 3/23/2016. TFOCS actually requires dual composed with -I\n% which has no effect for norms.\n% Use this composition function, or prox_scale(g,-1).\nif negScale\n g = @(varargin) composeWithNegative(g,varargin{:});\nend\n\nfprintf('\\n');\nmaxEr = 0;\nFenchelYoungViolation = false;\nvec = @(x) x(:);\nmyDot = @(x,y) x(:)'*y(:);\nfor k = 1:nTrials\n if force_gama\n gama = double(force_gama);\n else\n gama = rand(1);\n end\n x = newX();\n [vf,xf] = f(x,gama);\n [vg,xg] = g(x/gama,1/gama);\n if numel(vf) > 1, error('The \"f\" objective function must be scalar valued'); end\n if numel(vg) > 1, error('The \"g\" objective function must be scalar valued'); end\n if isinf(vf) || isinf(vg) || isnan(vf) || isnan(vg)\n error('Found either Inf or Nan values');\n % it is OK for f(x) to be Inf (i.e. for an indicator function)\n % but not for f(x,t) to be Inf, since this is a projection\n % or proximity operator\n end\n \n xg = xg*gama;\n \n er = (xf+xg) - x;\n \n % Test the scalar identity:\n % er1 = f( xf ) + g( xg/gama ) - xf'*xg/gama; % this can be inaccurate due to finite precision\n er2 = vf + vg - myDot(xf,xg)/gama; % should be same as er2\n % Sept 3 2012, when vf is very large, we lose precision. Need to make\n % this have *relative* precision\n er2 = abs(er2/max( [abs(vf),abs(vg),1e-3] ));\n \n % And the other scalar identity:\n % ||x||^2/2 = gama( f^(gama)(x) + g^(1/gama)(x/gama) )\n rhs = ( vf + 1/(2*gama)*norm(vec(xf-x))^2 ) + (vg + gama/2*norm(vec(xg/gama-x/gama))^2 );\n lhs = norm(vec(x) )^2/2/gama;\n er3 = abs(rhs-lhs)/abs(lhs);\n \n \n % Another test: does the Fenchel-Young inequality hold? (this test is unlikely to find violations)\n % for all x, y, f(x) + g(y) >= x'*y\n y = newX();\n vf = f(x);\n vg = g(y);\n if vf + vg < x'*y\n FenchelYoungViolation = true;\n end\n \n % when both f and g are projections, xf and xg should be orthogonal\n fprintf('Random trial #%2d, errors are:\\t%.1e,\\t%.1e,\\t%.1e; stepsize used was %.2e\\n', ...\n k, norm(er), er2, er3, gama );\n maxEr = max([norm(er),er2,er3,maxEr] );\n \n if break_on_bad && maxEr > tol\n varargout{1} = x;\n varargout{2} = gama;\n disp('Found a bad pair: terminating early');\n return;\n end\nend\n\n\nfprintf('Worst error was %.2e\\n', maxEr );\nif maxEr > tol\n disp('This is a BAD sign -- the functions are either not correctly implemented or there is a lot of roundoff error');\n disp(' Try running this again forcing t=1\" to help find the source of error (see help file)');\nelse\n disp('This is a GOOD sign -- the functions are likely implemented correctly');\nend\nif FenchelYoungViolation\n disp('Found violation of Fenchel-Young inequality; this is BAD');\nend\nif break_on_bad\n varargout{1} = [];\n if nargout > 1, varargout{2} = []; end\nelse\n varargout{1} = maxEr;\nend\n\nend\n\n% March 2016:\nfunction varargout = composeWithNegative( g, varargin )\n% redefine h(x) = g(-x)\n% so prox_h(x) = -prox_g(-x)\nvarargin{1} = -varargin{1};\nif nargin == 2\n varargout{1} = g( varargin{:} );\nelse\n [varargout{1},varargout{2}] = g( varargin{:} );\n varargout{2} = -varargout{2};\nend\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/test_smooth.m", "content": "function varargout = test_smooth( f, N, DOM )\n% TEST_SMOOTH Runs diagnostic checks on a TFOCS smooth function object.\n% TEST_SMOOTH( F )\n% tests whether the function handle F works as a TFOCS smooth\n% function object.\n%\n% Requirements: f = F(X) must return the value of the function at X.\n% [f,g] = F(X) must return the value, f, and the gradient, g.\n%\n% For an example, see SMOOTH_QUAD.M\n% \n% TEST_SMOOTH( F, N )\n% specifies the size of the domain space. If N is a scalar,\n% then the domain space is the set of N x 1 vectors.\n% If N is a matrix of the form [n1, n2], the the domain\n% space is the set of n1 x n2 matrices.\n%\n% TEST_SMOOTH( ..., DOM )\n% specifies the domain of F. DOM can be of the form [a,b]\n% which signifies the 1D set (a,b).\n%\n% OK = TEST_SMOOTH(...)\n% returns \"true\" if all tests are passed, and \"false\" otherwise.\n%\n% See also private/tfocs_smooth, smooth_huber\n\n\nOK = false;\nPLOT = true;\n\nerror(nargchk(1,3,nargin));\n\nif ~isa(f,'function_handle')\n fail('TFOCS smooth function must be a FUNCTION HANDLE');\n return; \nend\nfprintf('== Testing the smooth function %s ==\\n', func2str(f) );\n\nFORCE_N = false; % always require a vector input\nif nargin < 2 || isempty(N), N = 10;\nelse FORCE_N = true; \nend\nif nargin < 3 || isempty(DOM), DOM = [-1,1]; end\n\na = DOM(1); b = DOM(2);\n\nx = (a+b)/2;\nfprintf('Testing scalar inputs... \\n');\ntry \n vi = f(x);\ncatch\n fail('TFOCS smooth function failed to return a function value');\n return;\nend\nif isinf(vi)\n fail('TFOCS smooth function tester: default domain is invalid. Please specify valid domain');\n return;\nend\nfprintf('\\t\\t\\t\\t...passed. \\n');\n\n% Now, also ask for the gradient\nfprintf('Testing gradient output... \\n');\ntry \n [vi,gi] = f(x);\ncatch\n fail('TFOCS smooth function failed to return a derivative value');\n return;\nend\nfprintf('\\t\\t\\t\\t...passed. \\n');\n\n% Now, try a vector\nif isscalar(N)\n x = repmat(x,N,1);\nelse\n x = repmat(x,N(1),N(2));\n % if a > 0, assume we want a PSD matrix:\n if a >= 0\n x = ones(N(1),N(2)) + eye(N(1),N(2) );\n end\nend\nfprintf('Testing vector inputs... \\n');\ntry \n [vi,gi] = f(x);\ncatch\n fail('TFOCS smooth function failed when supplied a vector input');\n return;\nend\nfprintf('\\t\\t\\t\\t...passed. \\n');\n\n\n\n% 1D example. Does not require function to be vectorized\nn = 100; % number of grid points\nh = (b-a)/n;\ngrid = (a+h/2):h:(b-h/2);\n\nv = zeros(size(grid));\ng = zeros(size(grid));\nfirst = @(x) x(1);\nfor i = 1:length(grid)\n v(i) = f(grid(i));\n if isinf(v(i))\n g(i) = v(i);\n else\n [v(i),gi] = f(grid(i));\n g(i) = first(gi);\n end\nend\n\nif PLOT\n figure;\n clf;\n plot(grid,v,'.-');\n hold all\n plot(grid,g,'.-');\n legend('function','derivative');\n% title(func2str(f),'interpreter','none');\n line([a,b], 0*[1,1],'color','k' )\n if a < 0 && b > 0\n line( 0*[1,1], get(gca,'ylim'),'color','k' );\n end\nend\n\nOK = true;\n\nif nargout > 0\n varargout{1} = OK;\nend\n\ndisp('Test passed succesfully.');\n\n\n\n\nfunction fail(str)\n disp('Test failed. Reason:');\n disp(str);\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/tfocs.m", "content": "function varargout = tfocs( smoothF, affineF, projectorF, x0, opts )\n% TFOCS Minimize a convex problem using a first-order algorithm.\n% [ x, out, opts ] = tfocs( smoothF, affineF, projectorF, x0, opts )\n% Minimizes or maximizes a smooth or composite function using one of\n% the TFOCS first-order algorithms. The nominal standard form that\n% TFOCS handles is this:\n% minimize smoothF(affineF(x))+projectorF(x)\n% The affineF and projectorF functions are optional; specifically, they\n% may be omitted by suppling an empty array [] in their place. Thus\n% TFOCS supports standard forms such as\n% minimize smoothF(affineF(x))\n% minimize smoothF(x) + projectorF(x)\n% minimize smoothF(x)\n% A variety of more advanced standard forms are supported, but only\n% this simple form is discussed here. See the TFOCS user guide for\n% more information on these advanced forms; see also TFOCS_SCD.\n%\n% FUNCTIONS:\n% smoothF is expected to operate as follows:\n% [ fx, gx ] = smoothF( x )\n% fx: the value of the smooth function at x\n% gx: the gradient of the smooth function at x\n% TFOCS only asks for the gradient if it needs it, so if they are\n% significantly more expensive to compute, you should optimize\n% your function for the 'nargout==1' case.\n%\n% affineF may take one of many forms:\n% [] (empty): represents affineF(x) = x.\n% A, where A is a matrix: represents affineF(x) = A*x.\n% A, where A is a linear operator function obeying SPARCO conventions:\n% y = A(x,0) or y = A([],0) returns the size of A.\n% y = A(x,1) returns the forward operation applied to x.\n% y = A(x,2) returns the adjoint operation applied to x.\n% { A, b }, where A is either a matrix or linear operator and b\n% is a matrix, adds the offset b to the forward operation.\n% As mentioned above, affineF is optional. However, if the computational\n% cost of evaluating your objective is dominated by an affine operation,\n% it is worthwhile to provide it separately, as TFOCS orders its\n% calculations to reduce the number of times it will be called.\n%\n% projectorF is the most complex, and has two modes of operation.\n% Cx = projectorF( x )\n% Returns the value of the prox function at x. Note that no\n% projection is taking place, so in many cases this should be\n% a relatively simple calculation.\n% [ Cz, z ] = projectorF( x, t )\n% Computes the minimizer \n% z = argmin_z projectorF(z) + 1/(2*t)*\\|x-y\\|^2\n% The norm is Euclidean: \\|z\\| = ^{1/2}.\n%\n% OTHER INPUTS:\n% x0: a feasible initial point\n% opts: a structure containing further options. Please consult the TFOCS\n% user guide for full details, but key entries include:\n% opts.alg the algorithm to use; e.g., 'AT', 'LLM', etc.\n% opts.maxIts max number of iterations\n% opts.maxCounts max number of counts\n% opts.tol tolerance for convergence: relative step length\n% opts.printEvery displays output every 'printEvery' iteration\n% opts.maxmin +1 to minimize (default), -1 to maximize\n% Calling the function with no arguments displays the default values of\n% opts, and returns that default structure in the third output.\n%\n% OUTPUTS\n% x optimal point, up to the tolerance\n% out contains extra information collected during the run\n% opts structure containing the options used\n\n% Nov 17 2016, hack for Matlab R2016b not allowing nargin/nargout in\n% tfocs_initialize:\nnarginn = nargin; nargoutt = nargout;\n\n% User has requested viewing the default values of \"opts\"\nif nargin == 0 || ( nargin==1 && isstruct(smoothF) )\n if nargout == 0\n tfocs_initialize;\n else\n% opts = tfocs_AT();\n tfocs_initialize;\n opts.alg = 'AT';\n varargout{1} = opts;\n end\n return\nelseif nargin == 1 && ischar(smoothF) && ...\n (strcmpi(smoothF,'v') || strcmpi(smoothF,'version') ...\n || strcmpi(smoothF,'-v') || strcmpi(smoothF,'-version') )\n % Display version information\n% type version.txt \n disp('TFOCS v1.3, October 2013');\n return\nend\n\n\nerror(nargchk(1,5,nargin));\nif nargin < 2, affineF = []; end\nif nargin < 3, projectorF = []; end\nif nargin < 4, x0 = []; end\nif nargin < 5, opts = []; end\nif ~isfield( opts, 'alg' ), \n alg = 'AT';\nelse\n alg = upper( opts.alg );\nend\n\nif isnumeric(affineF) && ~isempty(affineF)\n affineF = {affineF};\nend\n\n[ varargout{1:max(nargout,1)} ] = feval( [ 'tfocs_', alg ], smoothF, affineF, projectorF, x0, opts );\nif nargout > 2,\n varargout{3}.alg = alg;\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/tfocs_AT.m", "content": "function [ x, out, opts ] = tfocs_AT( smoothF, affineF, projectorF, x0, opts )\n% TFOCS_AT Auslender and Teboulle's accelerated method.\n% [ x, out, opts ] = tfocs_AT( smoothF, affineF, nonsmoothF, x0, opts )\n% Implements Auslender & Teboulle's method.\n% A variety of calling sequences are supported; type \n% help tfocs_help\n% for a full explanation.\n\n% Nov 17 2016, hack for Matlab R2016b not allowing nargin/nargout in\n% tfocs_initialize:\nnarginn = nargin; nargoutt = nargout;\n\n% Initialization\nalg = 'AT';\nalgorithm = 'Auslender & Teboulle''s single-projection method';\nalpha = 0; beta = 0; mu = 0; L = 0;% Do not remove: necessary because of a MATLAB quirk\ntfocs_initialize\nif nargin == 0,\treturn; end\n\nwhile true,\n \n x_old = x;\n A_x_old = A_x;\n z_old = z;\n A_z_old = A_z;\n \n % The backtracking loop\n L_old = L;\n \tL = L * alpha;\n theta_old = theta;\n while true,\n \n % Acceleration\n theta = advance_theta( theta_old, L, L_old );\n\n\t\t% Next iterate\n if theta < 1,\n y = ( 1 - theta ) * x_old + theta * z_old;\n if cntr_Ay >= cntr_reset % change from > to >=, 4/24/14\n % every so often, we compute this explicitly,\n % to avoid roundoff errors that might accumulate\n A_y = apply_linear( y, 1 );\n cntr_Ay = 0;\n else\n % the efficient way\n cntr_Ay = cntr_Ay + 1;\n A_y = ( 1 - theta ) * A_x_old + theta * A_z_old;\n end\n f_y = Inf; g_Ay = []; g_y = [];\n end\n \n % Compute the function value if it is not already\n if isempty( g_y ),\n if isempty( g_Ay ), [ f_y, g_Ay ] = apply_smooth( A_y ); end\n g_y = apply_linear( g_Ay, 2 );\n end\n \n % Scaled gradient\n step = 1 / ( theta * L );\n [ C_z, z ] = apply_projector( z_old - step * g_y, step );\n A_z = apply_linear( z, 1 );\n \n % New iterate\n if theta == 1,\n x = z; \n A_x = A_z;\n C_x = C_z;\n else\n x = ( 1 - theta ) * x_old + theta * z;\n if cntr_Ax >= cntr_reset % see above comments for cntr_Ay\n cntr_Ax = 0;\n A_x = apply_linear( x, 1 );\n else\n cntr_Ax = cntr_Ax + 1;\n A_x = ( 1 - theta ) * A_x_old + theta * A_z;\n end\n C_x = Inf;\n end\n f_x = Inf; g_Ax = []; g_x = [];\n \n % Perform backtracking tests\n tfocs_backtrack\n if do_break, break; end % new, for R2015b compatibility\n \n end\n \n % Collect data, evaluate stopping criteria, and print status\n tfocs_iterate\n if do_break, break; end\n \nend\n\n% Final processing\ntfocs_cleanup\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/tfocs_GRA.m", "content": "function [ x, out, opts ] = tfocs_GRA( smoothF, affineF, projectorF, x0, opts )\n%TFOCS_GRA Gradient descent.\n% [ x, out, opts ] = tfocs_GRA( smoothF, affineF, nonsmoothF, x0, opts )\n% Implements a standard gradient method. A variety of calling sequences\n% are supported; type 'help tfocs_help' for a full explanation.\n\n% Nov 17 2016, hack for Matlab R2016b not allowing nargin/nargout in\n% tfocs_initialize:\nnarginn = nargin; nargoutt = nargout;\n\n% Initialization\nalg = 'GRA';\nalgorithm = 'Proximal gradient descent';\nalpha = 0; beta = 0; mu = 0; L = 0; % Do not remove: necessary because of a MATLAB quirk\ntfocs_initialize\nif nargin==0, return; end\n\n% Unlike the other algorithms, GRA does not use the theta parameter, so it\n% is not subject to restart, and we need not embed the initialization code\n% inside the loop.\n\nwhile true,\n \n\ty = x; \n A_y = A_x;\n\tf_y = f_x;\n x_old = x;\n \n\tg_Ay = g_Ax;\n\tg_y = apply_linear( g_Ay, 2 );\n L = L * alpha;\n \n while true,\n \n % Standard gradient\n [ C_x, x ] = apply_projector( y - (1/L) * g_y, 1/L );\n A_x = apply_linear( x, 1 );\n \t\t[ f_x, g_Ax ] = apply_smooth( A_x );\n \n % Backtracking\n tfocs_backtrack\n if do_break, break; end % new, for R2015b compatibility\n \n end\n \n % Collect data, evaluate stopping criteria, and print status\n tfocs_iterate\n if do_break, break; end % new, for R2015b compatibility\n \nend\n\n% Final processing\ntfocs_cleanup\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/tfocs_LLM.m", "content": "function [ x, out, opts ] = tfocs_LLM( smoothF, affineF, projectorF, x0, opts )\n% TFOCS_LLM Lan, Lu and Monteiro's accelerated method.\n% [ x, out, opts ] = tfocs_LLM( smoothF, affineF, nonsmoothF, x0, opts )\n% Implements Lan, Lu & Monteiro's method.\n% A variety of calling sequences are supported; type \n% help tfocs_help\n% for a full explanation.\n\n% Nov 17 2016, hack for Matlab R2016b not allowing nargin/nargout in\n% tfocs_initialize:\nnarginn = nargin; nargoutt = nargout;\n\n% Initialization\nalg = 'LLM';\nalgorithm = 'Lan/Lu/Monteiro''s two-projection method';\nalpha = 0; beta = 0; mu =0; L = 0; % Do not remove: necessary due to MATLAB quirk\ntfocs_initialize\nif nargin == 0, return; end\n\n\nwhile true,\n \n x_old = x;\n A_x_old = A_x;\n z_old = z;\n A_z_old = A_z;\n \n % The backtracking loop\n L_old = L;\n \tL = L * alpha;\n theta_old = theta;\n while true,\n \n % Acceleration\n theta = advance_theta( theta_old, L, L_old );\n \n % Next iterate\n if theta < 1,\n y = ( 1 - theta ) * x_old + theta * z_old;\n A_y = ( 1 - theta ) * A_x_old + theta * A_z_old;\n f_y = Inf; g_Ay = []; g_y = [];\n end\n \n % Compute the latest function values\n if isempty( g_y ),\n if isempty( g_Ay ), [ f_y, g_Ay ] = apply_smooth( A_y ); end\n g_y = apply_linear( g_Ay, 2 );\n end\n \n % Standard gradient\n [ C_x, x ] = apply_projector( y - (1/L) * g_y, 1/L );\n A_x = apply_linear( x, 1 );\n f_x = Inf; g_Ax = []; g_Ax = [];\n \n % Backtracking test\n tfocs_backtrack\n if do_break, break; end % new, for R2015b compatibility\n \n end\n \n % Collect data, evaluate stopping criteria, and print status\n tfocs_iterate\n if do_break, break; end % new, for R2015b compatibility\n\t\n\t% Scaled gradient. This step must be skipped if restart occurs\n if theta == 1 || isinf(theta)\n z = x;\n C_z = C_x;\n A_z = A_x;\n else\n \tstep = 1 / ( theta * L );\n [ C_z, z ] = apply_projector( z - step * g_y, step );\n A_z = apply_linear( z, 1 );\n end\n \nend\n\n% Final processing\ntfocs_cleanup\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/tfocs_N07.m", "content": "function [ x, out, opts ] = tfocs_N07( smoothF, affineF, projectorF, x0, opts )\n% TFOCS_N07 Nesterov's 2007 accelerated method.\n% [ x, out, opts ] = tfocs_N07( smoothF, affineF, projectorF, x0, opts )\n% Implements Nesterov's 2007 two-projection method.\n% A variety of calling sequences are supported; type \n% help tfocs_help\n% for a full explanation.\n\n% Nov 17 2016, hack for Matlab R2016b not allowing nargin/nargout in\n% tfocs_initialize:\nnarginn = nargin; nargoutt = nargout;\n\n% Initialization\nalg = 'N07';\nalgorithm = 'Nesterov''s 2007 two-projection method';\nalpha = 0; beta = 0; mu = 0; L = 0; % Necessary due to MATLAB quirk\ntfocs_initialize\nif nargin == 0,return; end\n\nwhile true,\n \n % Initialize the centerpoint and accumulated gradient. We do this here,\n x_old = x;\n A_x_old = A_x;\n z_old = z;\n A_z_old = A_z;\n \n % The backtracking loop\n L_old = L;\n \tL = L * alpha;\n theta_old = theta;\n while true,\n \n % Acceleration\n theta = advance_theta( theta_old, L, L_old );\n \n % Next iterate\n if theta < 1,\n y = ( 1 - theta ) * x_old + theta * z_old;\n A_y = ( 1 - theta ) * A_x_old + theta * A_z_old;\n f_y = Inf; g_Ay = []; g_y = [];\n end\n \n % Compute function values\n if isempty( g_y ),\n if isempty( g_Ay ), \n [ f_y, g_Ay ] = apply_smooth( A_y ); \n end\n g_y = apply_linear( g_Ay, 2 );\n end\n\n % Standard gradient\n [ C_x, x ] = apply_projector( y - (1/L) * g_y, 1/L );\n A_x = apply_linear( x, 1 );\n f_x = Inf; g_Ax = []; g_x = [];\n \n % Backtracking test\n tfocs_backtrack\n if do_break, break; end % new, for R2015b compatibility\n end\n \n % Collect data, evaluate stopping criteria, and print status\n tfocs_iterate\n if do_break, break; end % new, for R2015b compatibility\n\t\n\t% Accumulated gradient. This step must be skipped if restart occurs\n if theta == 1 || isinf(theta)\n g_accum = g_y;\n x_cent = x_old;\n z = x;\n C_z = C_x;\n A_z = A_x;\n else\n g_accum = ( 1 - theta ) * g_accum + theta * g_y;\n step = 1 / ( theta^2 * L );\n [ C_z, z ] = apply_projector( x_cent - step * g_accum, step );\n A_z = apply_linear( z, 1 );\n end\n \nend\n\n% Final processing\ntfocs_cleanup\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/tfocs_N83.m", "content": "function [ x, out, opts ] = tfocs_N83( smoothF, affineF, projectorF, x0, opts )\n% TFOCS_N83 Nesterov's 1983 accelerated method; also by Beck and Teboulle 2005 (FISTA).\n% [ x, out, opts ] = tfocs_N83( smoothF, affineF, nonsmoothF, x0, opts )\n% Implements Nesterov's 1983 method.\n% A variety of calling sequences are supported; type \n% help tfocs_help\n% for a full explanation.\n\n% Nov 17 2016, hack for Matlab R2016b not allowing nargin/nargout in\n% tfocs_initialize:\nnarginn = nargin; nargoutt = nargout;\n\n% Initialization\nalg = 'N83';\nalgorithm = 'Nesterov''s 1983 single-projection method';\nalpha = 0; beta = 0; mu = 0; L = 0; % Do not remove: necessary because of a MATLAB quirk\ntfocs_initialize\nif nargin == 0, return; end\n\nwhile true,\n \n x_old = x;\n A_x_old = A_x;\n z_old = z;\n A_z_old = A_z;\n \n % The backtracking loop\n L_old = L;\n \tL = L * alpha;\n theta_old = theta;\n while true,\n \n % Acceleration\n theta = advance_theta( theta_old, L, L_old );\n \n % Next iterate\n if theta < 1,\n y = ( 1 - theta ) * x_old + theta * z_old;\n A_y = ( 1 - theta ) * A_x_old + theta * A_z_old;\n f_y = Inf; g_Ay = []; g_y = [];\n end\n\n % Compute function values\n if isempty( g_y ),\n if isempty( g_Ay ), \n [ f_y, g_Ay ] = apply_smooth( A_y ); \n end\n g_y = apply_linear( g_Ay, 2 );\n end\n \n % Standard gradient\n [ C_x, x ] = apply_projector( y - (1/L) * g_y, 1/L );\n A_x = apply_linear( x, 1 );\n f_x = Inf; g_Ax = []; g_x = [];\n \n % Backtracking test\n tfocs_backtrack\n if do_break, break; end % new, for R2015b compatibility\n \n end\n \n % Collect data, evaluate stopping criteria, and print status\n tfocs_iterate\n if do_break, break; end % new, for R2015b compatibility\n\n % Reversed z update. This step is skipped if restart occurs\n if theta == 1,\n z = x;\n A_z = A_x;\n C_z = C_x;\n else\n z = (1/theta) * x + ( 1 - 1/theta ) * x_old;\n A_z = (1/theta) * A_x + ( 1 - 1/theta ) * A_x_old;\n C_z = Inf;\n end\n \nend\n\n% Final processing\ntfocs_cleanup\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/tfocs_SCD.m", "content": "function [ x, odata, opts ] = tfocs_SCD( objectiveF, affineF, dualproxF, mu, x0, z0, opts, contOpts )\n% TFOCS_SCD Smoothed conic dual form of TFOCS, for problems with non-trivial linear operators.\n% [ x, out, opts ] = tfocs_SCD( objectiveF, affineF, dualproxF, mu, x0, z0, opts )\n% Solves a conic problem using the smoothed conic dual approach. The goal\n% is to solve a problem in the following conic form:\n% minimize objectiveF(x)+0.5*mu(x-x0).^2\n% s.t. affineF(x) \\in \\cK\n% The user is responsible for constructing the dual proximity function\n% so that the dual can be described by the saddle point problem\n% maximize_z inf_x [ objectiveF(x)+0.5*mu(x-x0).^2- ] -dualproxF(z)\n% If mu = Inf, the method ignores the objective function and solves\n% minimize 0.5*(x-x0).^2\n% s.t. affineF(x) \\in \\cK\n%\n% dualProxF is also known as conjnegF\n% It is the Fenchel-Legendre dual up to a -1 scaling of the argument\n%\n% For general usage instructions, see tfocs.m and the user guide.\n% In general, setting a variable to [] will set it to its default value.\n%\n% If opts.continuation is true, then\n% [ x, out, opts ] = tfocs_SCD( objectiveF, affineF, dualproxF, mu, x0, z0, opts )\n% or\n% [ x, out, opts ] = tfocs_SCD( objectiveF, affineF, dualproxF, mu, x0, z0, opts, continuationOptions )\n% will update x0 as to eliminate the influence of the mu(x-x0).^2 term\n% Parameters for the continuation scheme are optionally specified\n% in the \"continuationOpts\" variable.\n% Note: if the \"continuationOpts\" variable is given, then the solver\n% enters continuation mode automatically, unless opts.continuation\n% is explicitly set to false.\n% To see options available for continuation, type \"continuation()\"\n%\n% See also tfocs\n\nif nargin == 0\n % pass in the SCD specific options:\n opSCD = [];\n opSCD.continuation = false;\n opSCD.adjoint = true;\n opSCD.saddle = true;\n opSCD.maxmin = -1;\n if nargout > 0, x = tfocs(opSCD);\n % and set the continuation options (right now, continuation is off by default)\n x.continuation = false;\n x = rmfield(x,'adjoint'); % x.adjoint = true;\n x.saddle = true;\n x.maxmin = -1;\n else\n tfocs(opSCD);\n disp('Warning: we strongly recommend setting opts.continuation=true; see the user guide');\n disp('Type ''help continuation'' for details');\n end\n return;\nend\n\nerror(nargchk(4,8,nargin));\nif nargin < 5, x0 = []; end\nif nargin < 6, z0 = []; end\nif nargin < 7, opts = []; end\n\n% look for continuation options\nDO_CONTINUATION = false;\nif nargin >= 8\n DO_CONTINUATION = true; \nelse\n contOpts = [];\nend\nif isfield( opts, 'continuation' )\n if opts.continuation\n DO_CONTINUATION = true;\n else\n DO_CONTINUATION = false;\n end\n opts = rmfield(opts,'continuation');\nend\n\n% Handle special cases of zero objective or infinite mu\nif isinf( mu ),\n mu = 1;\n objectiveF = prox_0;\nelseif isempty( objectiveF ),\n objectiveF = prox_0;\nelseif iscell( objectiveF ) % allow the case of {[],[],...,[]}\n for k = 1:length(objectiveF)\n if isempty( objectiveF{k} ) || isequal( objectiveF{k}, 0 ),\n objectiveF{k} = prox_0;\n elseif isnumeric( objectiveF{k} ),\n objectiveF{k} = smooth_linear( objectiveF{k} );\n end\n end\nend\n\n% The affine quantities will be used in adjoint orientation\nif isfield( opts, 'adjoint' ),\n opts.adjoint = ~opts.adjoint;\nelse\n opts.adjoint = true;\nend\nopts.saddle = true;\nopts.maxmin = -1;\nif isempty( x0 ), x0 = 0; end\nsmoothF = create_smoothF( objectiveF, mu, x0 );\n\nif isempty(dualproxF)\n dualproxF = proj_Rn;\nelseif iscell(dualproxF)\n for k = 1:length(dualproxF)\n dp = dualproxF{k};\n if isempty( dp ) || isnumeric( dp ) && numel( dp ) == 1 && dp == 0,\n dualproxF{k} = proj_Rn;\n end\n end\nend\n% When tfocs.m finds an error with z0, it says it has an error with \"x0\",\n% which is confusing for tfocs_SCD users, since their \"x0\" has a different meaning.\n% try % this is annoying for debugging\n if DO_CONTINUATION\n continuation_solver=@(mu,x0,z0,opts)solver(objectiveF,affineF,dualproxF, mu,x0,z0,opts);\n [ x, odata, opts ] = continuation( continuation_solver, mu, x0, z0, opts,contOpts );\n else\n [ z, odata, opts ] = tfocs( smoothF, affineF, dualproxF, z0, opts );\n end\n% catch err\n% if strfind( err.message, 'x0' )\n% fprintf(2,'Error involves z0 (which is referred to as x0 below)\\n');\n% end\n% rethrow(err);\n% end\nopts.adjoint = ~opts.adjoint;\nopts = rmfield( opts, { 'saddle', 'maxmin' } );\nif DO_CONTINUATION\n opts.continuation = true;\nelse\n x = odata.dual;\n odata.dual = z;\nend\n\n\n\n% ----------------------- Subfunctions ----------------------------------------\n\nfunction [ prox, x ] = smooth_dual( objectiveF, mu_i, x0, ATz )\n% Adding 0 to ATz will destroy the sparsity\nif (isscalar(x0) && x0 == 0) || numel(x0) == 0 || nnz(x0) == 0\n [ v, x ] = objectiveF( mu_i * ATz, mu_i );\nelse\n [ v, x ] = objectiveF( x0 + mu_i * ATz, mu_i );\nend\nprox = tfocs_dot( ATz, x ) - v - (0.5/mu_i) * tfocs_normsq( x - x0 );\nprox = -prox;\nx = -x;\n\nfunction [ prox, x ] = smooth_dual_vectorMu( objectiveF, mu_i, x0, ATz )\n% Adding 0 to ATz will destroy the sparsity\nif (isscalar(x0) && x0 == 0) || numel(x0) == 0 || nnz(x0) == 0\n [ v, x ] = objectiveF( mu_i .* ATz, mu_i );\nelse\n [ v, x ] = objectiveF( x0 + mu_i .* ATz, mu_i ); % Causes a scaling...\nend\nprox = tfocs_dot( ATz, x ) - v - 0.5*tfocs_normsq( x - x0, 1./mu_i );\nprox = -prox;\nx = -x;\n\n\nfunction smoothF = create_smoothF( objectiveF, mu, x0 )\nif iscell(objectiveF)\n for k = 1 : length(objectiveF)\n if iscell(x0)\n if length(mu)>1\n smoothF{k} = @(varargin)smooth_dual_vectorMu( objectiveF{k}, 1./mu, x0{k}, varargin{:} );\n else\n smoothF{k} = @(varargin)smooth_dual( objectiveF{k}, 1./mu, x0{k}, varargin{:} );\n end\n else\n if length(mu)>1\n smoothF{k} = @(varargin)smooth_dual_vectorMu( objectiveF{k}, 1./mu, x0, varargin{:} );\n else\n smoothF{k} = @(varargin)smooth_dual( objectiveF{k}, 1./mu, x0, varargin{:} );\n end\n end\n end\nelse\n if length(mu)>1\n smoothF = @(varargin)smooth_dual_vectorMu( objectiveF, 1./mu, x0, varargin{:} );\n else\n smoothF = @(varargin)smooth_dual( objectiveF, 1./mu, x0, varargin{:} );\n end\nend\n\n% For use with continuation:\nfunction [varargout] = solver(objectiveF,affineF,dualproxF, mu,x0,z0,opts)\nsmoothF = create_smoothF( objectiveF, mu, x0 );\n[varargout{1:max(nargout,2)}] = tfocs( smoothF, affineF, dualproxF, z0, opts );\n% The varargout should be [x, odata, opts ]\n% Since we're using the dual, need to switch\ndualVar = varargout{1};\nodata = varargout{2};\nvarargout{1} = odata.dual;\nodata.dual = dualVar;\nvarargout{2} = odata;\n\n\n\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/tfocs_TS.m", "content": "function [ x, out, opts ] = tfocs_TS( smoothF, affineF, projectorF, x0, opts )\n% TFOCS_TS Tseng's modification of Nesterov's 2007 method.\n% [ x, out, opts ] = tfocs_TS( smoothF, affineF, projectorF, x0, opts )\n% Implements Tseng's modification of the Nesterov 2007 method.\n% A variety of calling sequences are supported; type \n% help tfocs_help\n% for a full explanation.\n\n% Nov 17 2016, hack for Matlab R2016b not allowing nargin/nargout in\n% tfocs_initialize:\nnarginn = nargin; nargoutt = nargout;\n\n% Initialization\nalg = 'TS';\nalgorithm = 'Tseng''s single-projection modification of Nesterov''s 2007 method';\nalpha = 0; beta = 0; mu = 0; L = 0; % Necessary due to MATLAB quirk\ntfocs_initialize\nif nargin == 0, return; end\n\nwhile true,\n\n x_old = x;\n A_x_old = A_x;\n z_old = z;\n A_z_old = A_z;\n \n % The backtracking loop\n L_old = L;\n \tL = L * alpha;\n theta_old = theta;\n while true,\n \n \t% Acceleration\n theta = 2 ./ ( 1 + sqrt( 1 + 4 * L / L_old / theta_old^2 ) );\n \n % Next iterate\n if theta < 1,\n y = ( 1 - theta ) * x_old + theta * z_old;\n A_y = ( 1 - theta ) * A_x_old + theta * A_z_old;\n f_y = Inf; g_Ay = []; g_y = []; C_y = Inf;\n end\n\n % Compute function values\n if isempty( g_y ),\n if isempty( g_Ay ), [ f_y, g_Ay ] = apply_smooth( A_y ); end\n g_y = apply_linear( g_Ay, 2 );\n end\n\n % Accumulated gradient\n if theta == 1,\n x_cent = x_old;\n g_a = g_y;\n else\n g_a = ( 1 - theta ) * g_a_old + theta * g_y;\n end\n step = 1 / ( theta^2 * L );\n [ C_z, z ] = apply_projector( x_cent - step * g_a, step );\n A_z = apply_linear( z, 1 );\n \n % New iterate\n if theta == 1,\n x = z; \n A_x = A_z;\n C_x = C_z;\n else\n x = ( 1 - theta ) * x_old + theta * z;\n A_x = ( 1 - theta ) * A_x_old + theta * A_z;\n C_x = Inf;\n end\n f_x = Inf; g_Ax = []; g_x = [];\n \n % Bactracking test\n tfocs_backtrack\n if do_break, break; end % new, for R2015b compatibility\n \n end\n \n % Collect data, evaluate stopping criteria, and print status\n tfocs_iterate\n if do_break, break; end % new, for R2015b compatibility\n \n g_a_old = g_a;\n \nend\n\n% Final processing\ntfocs_cleanup\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/tfocs_normsq.m", "content": "function v = tfocs_normsq( x, scaling )\n\n% TFOCS_NORMSQ Squared norm. \n% By default, TFOCS_NORMSQ(X) = TFOCS_DOT(X,X). However, certain\n% objects may have more efficient ways of computing this value.\n% If so, TFOCS_NORMSQ should be overloaded to take advantage of\n% this. However, the numerical equivalence to TFOCS_DOT(X,X) must\n% be preserved.\n%\n% TFOCS_NORMSQ( X, D ) = TFOCS_DOT( X, D.*X ) is a scaled norm\n\nif nargin < 2 || isempty(scaling)\n v = tfocs_dot( x, x );\nelseif numel(scaling) == 1\n v = scaling*tfocs_dot( x, x );\nelse\n v = tfocs_dot( x, scaling.*x );\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/tfocs_version.m", "content": "function tfocs_ver2 = tfocs_version\n\n%TFOCS_VERSION Version information.\n% Prints information about the version of TFOCS being used, and the\n% system on which it is running. When submitting a bug report, please\n% run this function and include its output in your report.\n\ntfocs_ver = '1.4';\nif nargout == 0,\n fprintf( 'TFOCS v%s\\n', tfocs_ver );\n verd = ver('MATLAB');\n fprintf( 'MATLAB version %s %s on %s\\n', verd.Version, verd.Release, computer );\nelse\n tfocs_ver2 = tfocs_ver;\nend\n\n% TFOCS v1.4 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2015 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/tfocs_where.m", "content": "function s = tfocs_where\n\n%TFOCS_WHERE Returns the location of the TFOCS system.\n% TFOCS_WHERE returns a string containing the base directory of the \n% TFOCS solvers. Within that directory are some useful\n% subdirectories and files:\n% experiments/ sample TFOCS models\n% COPYING.txt copyright information\n% The proper operation of this function assumes that it has not been\n% moved from its default position within the TFOCS distribution.\n\ns = mfilename('fullpath');\ntemp = strfind( s, filesep );\ns( temp(end) + 1 : end ) = [];\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/tfunc_scale.m", "content": "function op = tfunc_scale( funcF, s, A, b )\n\n%TFUNC_SCALE Scaling a function.\n% SSCALE = TFUNC_SCALE( FUNC, s, A, b ) is the function\n% SSCALE( y ) = s * FUNC( A * y + b ).\n% s must be a real scalar; A can be a scalar, a matrix, or a linear\n% operator; and offset must be a vector of compatible size. The third\n% and fourth arguments are optional; A=I, b=0 are the defaults. If A\n% is a matrix or a linear operator, then the resulting function cannot\n% perform proximity minimizations.\n%\n% See also prox_scale\n\nerror(nargchk(2,4,nargin));\nif ~isa( funcF, 'function_handle' ),\n error( 'The first argument must be a function handle.' );\nelseif ~isnumeric( s ) || ~isreal( s ) || numel( s ) ~= 1,\n error( 'The second argument must be a real scalar.' );\nend\nif nargin < 3,\n A = 1;\nelseif ~isnumeric( A ) && ~isa( A, 'function_handle' ),\n error( 'The third argument must be a scalar, matrix, or linear operator.' );\nend\nif nargin < 4 || isempty( b ),\n b = 0;\nelseif ~isnumeric( b ),\n error( 'The fourth argument must be a vector or matrix.' );\nend\n\n% Determine the best handle for the job\nif s == 0,\n op = smooth_constant( 0 );\nelseif ~isnumeric( A ), \n op = @(varargin)tfunc_scale_linop( funcF, s, A, b, varargin{:} );\nelseif ~nnz(b) || numel( A ) ~= 1,\n op = @(varargin)tfunc_scale_matrix( funcF, s, A, b, varargin{:} );\nelseif s ~= 1 || A ~= 1,\n op = @(varargin)tfunc_scale_scalar( funcF, s, A, b, varargin{:} );\nelse\n op = funcF;\nend\n\nfunction [ v, g ] = tfunc_scale_scalar( funcF, s, a, b, x, t )\nswitch nargin,\n case 5,\n if nargout == 1,\n v = funcF( a * x + b );\n else\n [ v, g ] = funcF( a * x + b );\n g = ( s * A ) * g;\n end\n case 6,\n [ v, g ] = funcF( a * x + b, s * a * t );\n g = ( g - b ) / a;\n otherwise,\n error( 'Not enough arguments.' );\nend\nv = s * v;\n\nfunction [ v, g ] = tfunc_scale_matrix( funcF, s, A, b, x, t )\nswitch nargin,\n case 5,\n if nargout == 1,\n v = funcF( A * x + b );\n else\n [ v, g ] = funcF( A * x + b );\n g = s * ( A' * g );\n end\n case 6,\n error( 'This function cannot perform proximity minimization.' );\n otherwise,\n error( 'Not enough arguments.' );\nend\nv = s * v;\n\nfunction [ v, g ] = tfunc_scale_linop( funcF, s, A, b, x, t )\nswitch nargin,\n case 5,\n if nargout == 1,\n v = funcF( A( x, 1 ) + b );\n else\n [ v, g ] = funcF( A( x, 1 ) + b );\n g = s * A( g, 2 );\n end\n case 6,\n error( 'This function cannot perform proximity minimization.' );\n otherwise,\n error( 'Not enough arguments.' );\nend\nv = s * v;\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/TFOCS/tfunc_sum.m", "content": "function op = tfunc_sum( varargin )\n\n%TFUNC_SUM Sum of functions.\n% OP = TFUNC_SUM( F1, F2, ..., FN ) implements\n% OP( x ) = F1( x ) + F2( x ) + ... + FN( x ).\n% Each entry must be a real scalar or a function handle. You are\n% responsible for ensuring that the sum is convex or concave, as\n% appropriate; TFOCS cannot verify this.\n\nfor k = 1 : nargin,\n arg = varargin{k};\n if ~isa( arg, 'function_handle' ) && ( ~isnumeric( arg ) || numel( arg ) ~= 1 || ~isreal( arg ) ),\n error( 'Arguments must be function handles or real scalars.' );\n elseif isnumeric( arg ),\n varargin{k} = smooth_constant( arg );\n end\nend\nswitch nargin,\n case 0,\n op = smooth_constant( 0 );\n case 1,\n op = varargin{1};\n otherwise,\n op = @(x)tfunc_sum_impl( varargin, x );\nend\n\nfunction [ v, g ] = tfunc_sum_impl( args, x, t )\nif nargin > 2,\n error( 'This function does not support proximity minimization.' );\nelseif nargout == 1,\n v = args{1}( x );\n for k = 2 : numel(args),\n v = v + args{k}( x );\n end\nelse\n [ v, g ] = args{1}( x );\n for k = 2 : numel(args),\n [ nv, ng ] = args{k}( x );\n v = v + nv;\n g = g + ng;\n end\nend\n\n% TFOCS v1.3 by Stephen Becker, Emmanuel Candes, and Michael Grant.\n% Copyright 2013 California Institute of Technology and CVX Research.\n% See the file LICENSE for full license information.\n" }, { "path": "src/test/resources/samples/langs/Matlab/Traj.m", "content": "clear all\r\n%mu=0.012151; %Earth-Moon\r\nmu=0.012277471 %Earth-Moon\r\n[xl1,yl1,xl2,yl2,xl3,yl3,xl4,yl4,xl5,yl5] = Lagr(mu);\r\nC=3.17;\r\n%C=2*Potential(xl1,yl1,mu);\r\nx_0=1;\r\ny_0=0;\r\nvx_0=0;\r\nvy_0=sqrt(-C-vx_0^2+2*Potential(x_0,y_0,mu));\r\n%vy_0=0;\r\nT=2;\r\nC_star=2*Potential(x_0,y_0,mu)-(vx_0^2+vy_0^2)\r\n%C=-(vx_0^2+vy_0^2)+2*Omega(x_0,y_0,mu);\r\nE=-C/2;\r\n\r\noptions=odeset('AbsTol',1e-22,'RelTol',1e-13); \r\n\r\n%Integrate first orbit\r\n[t0,Y0]=ode113(@f,[0 T],[x_0; y_0; vx_0; vy_0],options,mu);\r\nx0=Y0(:,1);\r\ny0=Y0(:,2);\r\nvx0=Y0(:,3);\r\nvy0=Y0(:,4);\r\nl0=length(Y0);\r\n\r\n% Precisionfirst orbit\r\ndelta_E0=abs(Energy(x0,y0,vx0,vy0,mu)-E);\r\n\r\n% figure\r\n% plot(delta_E0)\r\n\r\n%Hill's region\r\npoints=500;\r\nbb=3; % Bounding box\r\nx=linspace(-bb,bb,points);\r\ny=linspace(-bb,bb,points);\r\n[x,y]=meshgrid(x,y);\r\nz=(Potential(x,y,mu));\r\n% figure\r\n% surfc(x,y,z,'Edgecolor','none')\r\n\r\n%Plot orbit\r\n%figure\r\nhold on\r\ncontour(x,y,z,[C/2,C/2])\r\nplot(x0,y0)\r\ntext(-2,-2,sprintf('C=%.2f',C))\r\n%plotto actractors\r\nplot(-mu,0,'ok')\r\nplot(1-mu,0,'ok')\r\n% Plot points\r\nplot(x0(1),y0(1),'sg')\r\nplot(x0(l0),y0(l0),'sr')" }, { "path": "src/test/resources/samples/langs/Matlab/adapting_structural_model.m", "content": "function [dx, y] = adapting_structural_model(t, x, u, varargin)\n%\n% Returns the time derivatives of the states and the output of the\n% structural control model with an adapting controller.\n%\n% Parameters\n% ----------\n% t : double\n% The current time.\n% x : double, size(8, 1)\n% The current state.\n% u : double, size(1, 1)\n% The current input.\n% varargin : cell array\n% m1, m2, m3, m4, b1, b2, b3, b4 : double\n% The slope of the four gains and the offset of the four gains.\n% aux : cell array containing a single structure\n% The structure contains:\n% pars : double, size(1,9)\n% The controller parameters.\n% timeDelay : logical\n% If true a 1st order Pade approximation of the human's time delay\n% is included.\n% plantFirst : integer\n% The number of the first plant.\n% plantSecond : integer\n% The number of the second plant.\n% m : double, size(2, 1)\n% The slope of the transfer function adaption function.\n% b : double, size(2, 1)\n% The offset of the transfer function adaption function.\n%\n% Returns\n% -------\n% dx : double, size(8, 1)\n% The derivatives of the states.\n% y : double, size(1, 1)\n% The output, theta.\n\n% MATLAB SUCKS! This is unbelievable. On the first iteration varargin is 1x2\n% and after that it is 1x9.\n%size(varargin, 2)\n\n% Unpack varargin.\naux = varargin{end}{1};\nm = zeros(4, 1);\nb = zeros(4, 1);\nfor i=1:4\n if size(varargin, 2) == 2\n m(i) = varargin{1}(i);\n b(i) = varargin{1}(i + 4);\n elseif size(varargin, 2) == 9\n m(i) = varargin{i};\n b(i) = varargin{i + 4};\n else\n display('Matlab is stupid.')\n end\nend\n\n% First compute the gains at this time.\naux.pars(1:4) = m .* t + b;\n% Compute the controller.\nYp = human(aux.pars, aux.timeDelay);\n% Compute the plant and this time.\nc1 = aux.m(1) * t + aux.b(1) + 1e-10;\nc2 = aux.m(2) * t + aux.b(2) + 1e-10;\nYc = parallel(c1 * plant(aux.plantFirst), c2 * plant(aux.plantSecond));\n% Compute the closed loop system.\nYs = feedback(Yp * Yc, 1);\n% Convert to state space.\n[A, B, C, D] = tf2ss(Ys.num{1}, Ys.den{1});\n% Compute the derivatives of the states and the outputs.\ndx = A * x + B * u;\ny = C * x + D * u;\n" }, { "path": "src/test/resources/samples/langs/Matlab/average.m", "content": "function y = average(x)\n% AVERAGE Mean of vector elements.\n% AVERAGE(X), where X is a vector, is the mean of vector\n% elements. Nonvector input results in an error.\n[m,n] = size(x);\nif (~((m == 1) | (n == 1)) | (m == 1 & n == 1))\n error('Input must be a vector')\nend\ny = sum(x)/length(x);\n" }, { "path": "src/test/resources/samples/langs/Matlab/bicycle_state_space.m", "content": "function bicycle = bicycle_state_space(bicycle, speed, varargin)\n% function bicycle = bicycle_state_space(bicycle, speed, varargin)\n%\n% Returns the state space system of the Whipple model linearized about the\n% nominal configuration and the supplied speed.\n%\n% Parameters\n% ----------\n% bicycle : char\n% The name of a bicycle in the parameters directory.\n% speed : double\n% The forward speed at which to linearize the model about.\n% varargin : char/cell array pairs, optional\n% Specify a subset of states, inputs or outputs by setting one of the\n% following: `states`, `inputs`, `outputs` as a cell array of\n% chars which include the subset variable names. Beaware that not all\n% state, input and output combinations are necessarily possible.\n% Valid state names: 'xP', 'yP', 'psi', 'phi', 'thetaB', 'thetaR', 'delta',\n% 'thetaF', 'phiDot', 'thetaRDot', 'deltaDot'\n% Valid input names: 'tPhi', 'tDelta', 'fB'\n% Valid output names: 'xP', 'yP', 'psi', 'phi', 'thetaB', 'thetaR', 'delta',\n% 'thetaF', 'xPDot', 'yPDot', 'psiDot', 'phiDot', 'thetaBDot',\n% 'thetaRDot', 'deltaDot', 'thetaFDot', 'xQ', 'yQ'\n%\n% Returns\n% -------\n% bicycle : ss\n% The state space model of the bicycle.\n%\n% Notes\n% -----\n% The variable names are defined as in Meijaard2007.\n%\n% Examples\n% --------\n% bicycle = bicycle_state_space('Benchmark', 5.0, ...\n% 'states', {'phi', 'phiDot', 'delta', 'deltaDot'}, ...\n% 'inputs', {'tDelta'}, ...\n% 'outputs', {'delta', 'phi'})\n\n% get the directory which this m-file is in\nS = dbstack('-completenames');\n[CURRENT_DIRECTORY, ~, ~] = fileparts(S(1).file);\n\n% load the paramaters\npar = par_text_to_struct([CURRENT_DIRECTORY filesep 'parameters' ...\n filesep bicycle 'Par.txt']);\n\n% generate the state space matrices\n[A, B, C, D] = whipple_pull_force_abcd(par, speed);\n\n% name the states, outputs and inputs\nstates = {'xP',\n 'yP',\n 'psi',\n 'phi',\n 'thetaB',\n 'thetaR',\n 'delta',\n 'thetaF',\n 'phiDot',\n 'thetaRDot',\n 'deltaDot'};\n\noutputs = {'xP',\n 'yP',\n 'psi',\n 'phi',\n 'thetaB',\n 'thetaR',\n 'delta',\n 'thetaF',\n 'xPDot',\n 'yPDot',\n 'psiDot',\n 'phiDot',\n 'thetaBDot',\n 'thetaRDot',\n 'deltaDot',\n 'thetaFDot',\n 'xQ',\n 'yQ'};\n\ninputs = {'tPhi',\n 'tDelta',\n 'fB'};\n\ndefaultSettings.states = states;\ndefaultSettings.inputs = inputs;\ndefaultSettings.outputs = outputs;\n% load in user supplied settings\nif size(varargin, 2) >= 1\n userSettings = varargin_to_structure(varargin);\nelse\n userSettings = struct();\nend\n% combine the defaults with the user settings\nsettings = overwrite_settings(defaultSettings, userSettings);\n\n% Will the system have the bare minimum states?\nminStates = {'phi', 'delta', 'phiDot', 'deltaDot'};\nif sum(ismember(settings.states, minStates)) < 4\n error(['You have not specified the minimum set of states. Please ' ...\n 'include at least phi, delta, phiDot, and deltaDot'])\nend\n\n% Have state derivatives been specified that can't be computed with the\n% specified states?\nkeepStates = find(ismember(states, settings.states));\nremoveStates = find(~ismember(states, settings.states));\nfor row = keepStates'\n for col = removeStates'\n if abs(A(row, col)) > 1e-10\n s = sprintf(['It is not possible to compute the derivative ' ...\n 'of state %s because it depends on state %s'], ...\n states{row}, states{col});\n error(s)\n end\n end\nend\n\nremoveInputs = find(~ismember(inputs, settings.inputs));\n\n% Have outputs been specified that can't be computed with the specified\n% states and inputs?\nkeepOutputs = find(ismember(outputs, settings.outputs));\nfor row = keepOutputs'\n for col = removeStates'\n if abs(C(row, col)) > 1e-10\n s = sprintf(['It is not possible to keep output %s because ' ...\n 'it depends on state %s'], outputs{row}, ...\n states{col});\n error(s)\n end\n end\n for col = removeInputs'\n if abs(D(row, col)) > 1e-10\n s = sprintf(['It is not possible to keep output %s because ' ...\n 'it depends on input %s'], outputs{row}, ...\n inputs{col});\n error(s)\n end\n end\nend\n\nremoveOutputs = find(~ismember(outputs, settings.outputs));\n\nA(removeStates, :) = [];\nA(:, removeStates) = [];\n\nB(removeStates, :) = [];\nB(:, removeInputs) = [];\n\nC(removeOutputs, :) = [];\nC(:, removeStates) = [];\n\nD(removeOutputs, :) = [];\nD(:, removeInputs) = [];\n\nstates(removeStates) = [];\ninputs(removeInputs) = [];\noutputs(removeOutputs) = [];\n\n% build the ss structure\nbicycle = ss(A, B, C, D, ...\n 'StateName', states, ...\n 'OutputName', outputs, ...\n 'InputName', inputs);\n" }, { "path": "src/test/resources/samples/langs/Matlab/convert_variable.m", "content": "function [name, order] = convert_variable(variable, output)\n% Returns the name and order of the given variable in the output type.\n%\n% Parameters\n% ----------\n% variable : string\n% A variable name.\n% output : string.\n% Either `moore`, `meijaard`, `data`.\n%\n% Returns\n% -------\n% name : string\n% The variable name in the given output type.\n% order : double\n% The order of the variable in the list.\n\n[coordinates, speeds, inputs] = get_variables();\n\ncolumns = {'data', 'meijaard', 'moore'};\n\nif find(ismember(coordinates, variable))\n\n [order, ~] = find(ismember(coordinates, variable));\n name = coordinates{order, find(ismember(columns, output))};\n\nelseif find(ismember(speeds, variable))\n\n [order, ~] = find(ismember(speeds, variable));\n name = speeds{order, find(ismember(columns, output))};\n\nelseif find(ismember(inputs, variable))\n\n [order, ~] = find(ismember(inputs, variable));\n name = inputs{order, find(ismember(columns, output))};\n\nelse\n error('Beep: Done typed yo variable name wrong')\nend\n\nfunction [coordinates, speeds, inputs] = get_variables()\n\ncoordinates = {'LongitudinalRearContact', 'xP', 'q1';\n 'LateralRearContact', 'yP','q2';\n 'YawAngle', 'psi','q3';\n 'RollAngle', 'phi','q4';\n 'PitchAngle', 'thetaB','q5';\n 'RearWheelAngle', 'thetaR','q6';\n 'SteerAngle', 'delta','q7';\n 'FrontWheelAngle', 'thetaF','q8';\n 'LongitudinalFrontContact', 'xQ','q9';\n 'LateralFrontContact', 'yQ', 'q10'};\n\nspeeds = {'LongitudinalRearContactRate', 'xPDot', 'u1';\n 'LateralRearContactRate', 'yPDot', 'u2';\n 'YawRate', 'psiDot', 'u3';\n 'RollRate', 'phiDot', 'u4';\n 'PitchRate', 'thetaDot', 'u5';\n 'RearWheelRate', 'thetaRDot', 'u6';\n 'SteerRate', 'deltaDot', 'u7';\n 'FrontWheelRate', 'thetaFDot','u8';\n 'LongitudinalFrontContactRate', 'xQDot', 'u9';\n 'LateralFrontContactRate', 'yQDot', 'u10'};\n\ninputs = {'RollTorque', 'tPhi', 'T4';\n 'RearWheelTorque', 'tThetaR', 'T6';\n 'SteerTorque', 'tDelta', 'T7';\n 'PullForce', 'fB', 'F'};\n" }, { "path": "src/test/resources/samples/langs/Matlab/create_ieee_paper_plots.m", "content": "function create_ieee_paper_plots(data, rollData)\n% Creates all of the figures for the IEEE paper.\n%\n% Parameters\n% ----------\n% data : structure\n% A structure contating the data from generate_data.m for all of the bicycles\n% and speeds for the IEEE paper.\n% rollData : structure\n% The data for a single bicycle at a single speed with roll torque as the\n% input.\n\nglobal goldenRatio\n% used for figure width to height ratio\ngoldenRatio = (1 + sqrt(5)) / 2;\n\n% create a plot directory if one doesn't already exist\nif exist('plots/', 'dir') ~= 7\n mkdir('plots/')\nend\n\n% Define some linestyles and colors for each of the six bicycles\nlinestyles = {'-', '-', '-.', ...\n '--', '-.', '--'};\ncolors = {'k', ...\n [0.5, 0.5, 0.5], ...\n [0.5, 0.5, 0.5], ...\n 'k', ...\n 'k', ...\n [0.5, 0.5, 0.5]};\n\nloop_shape_example(data.Benchmark.Medium, 'Steer')\nloop_shape_example(rollData, 'Roll')\nplot_io_roll(rollData, 'Distance')\nplot_io_roll(rollData, 'Time')\nopen_loop_all_bikes(data, linestyles, colors)\nhandling_all_bikes(data, rollData, linestyles, colors)\npath_plots(data, linestyles, colors)\nvar = {'delta', 'phi', 'psi', 'Tdelta'};\nio = {'output', 'output', 'output', 'input'};\ntyp = {'Distance', 'Time'};\nfor i = 1:length(var)\n for j = 1:length(typ)\n plot_io(var{i}, io{i}, typ{j}, data, linestyles, colors)\n end\nend\nphase_portraits(data.Benchmark.Medium)\neigenvalues(data, linestyles, colors)\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nfunction loop_shape_example(bikeData, input)\n% Creates the example loop shaping for the bicycle at medium speed.\n%\n% Parameters\n% ----------\n% bikeData : structure\n% Contains data for a single bicycle at a single speed.\n% input : string\n% 'Steer' or 'Roll' depending on what input was used to control the bicycle.\n\nglobal goldenRatio\n\n% closed loop bode plots\nfigure()\nfigWidth = 5.0;\nfigHeight = figWidth / goldenRatio;\nset(gcf, ...\n 'Color', [1, 1, 1], ...\n 'PaperOrientation', 'portrait', ...\n 'PaperUnits', 'inches', ...\n 'PaperPositionMode', 'manual', ...\n 'OuterPosition', [424, 305 - 50, 518, 465], ...\n 'PaperPosition', [0, 0, figWidth, figHeight], ...\n 'PaperSize', [figWidth, figHeight])\n\nfreq = {0.1, 20.0};\n\nhold all\n\nclosedLoops = bikeData.closedLoops;\n\n% make sure all bode plots display 'rad/s' instead of 'rad/sec'\nbops = bodeoptions;\nbops.FreqUnits = 'rad/s';\n\nif strcmp(input, 'Steer')\n linestyles = {'', '', '-.', '-.', '-', '-.', '-.', '-'};\n gray = [0.6, 0.6, 0.6];\n colors = {'k', 'k', 'k', gray, 'k', 'k', gray, 'k'};\n % the closed delta loop\n deltaNum = closedLoops.Delta.num;\n deltaDen = closedLoops.Delta.den;\n bodeplot(tf(deltaNum, deltaDen), freq, bops);\n % a typical neuromuscular model\n neuroNum = 2722.5;\n neuroDen = [1, 13.96, 311.85, 2722.5];\n bodeplot(tf(neuroNum, neuroDen), freq, bops);\n whichLines = 5:-1:3;\nelseif strcmp(input, 'Roll')\n linestyles = {'', '', '-', '-'};\n colors = {'k', 'k', 'k', 'k'};\n whichLines = 4:-1:2;\nelse\n error('Bad input, use Steer or Roll')\nend\n\n% the closed phi dot loop\nphiDotNum = closedLoops.PhiDot.num;\nphiDotDen = closedLoops.PhiDot.den;\nclosedBode = bodeplot(tf(phiDotNum, phiDotDen), freq, bops);\n\nhold off\n\n% clean it up\nopts = getoptions(closedBode);\nif strcmp(input, 'Steer')\n opts.YLim = {[-45, 20], [-360, 90]};\nelse\n opts.YLim = {[-30, 10], [-180, 90]};\nend\nopts.PhaseMatching = 'on';\nopts.PhaseMatchingValue = 0;\nopts.Title.String = '';\nsetoptions(closedBode, opts)\n\n% find all the lines in the current figure\nlines = findobj(gcf, 'type', 'line');\nfor i = 3:length(lines)\n set(lines(i), 'LineStyle', linestyles{i}, ...\n 'Color', colors{i}, ...\n 'LineWidth', 2.0)\nend\n\n% there seems to be a bug such that the xlabel is too low, this is a hack to\n% get it to work\nraise = 0.05;\nplotAxes = findobj(gcf, 'type', 'axes');\nset(plotAxes, 'XColor', 'k', 'YColor', 'k')\ncurPos1 = get(plotAxes(1), 'Position');\ncurPos2 = get(plotAxes(2), 'Position');\nset(plotAxes(1), 'Position', curPos1 + [0, raise, 0, 0])\nset(plotAxes(2), 'Position', curPos2 + [0, raise, 0, 0])\nxLab = get(plotAxes(1), 'Xlabel');\nset(xLab, 'Units', 'normalized')\nset(xLab, 'Position', get(xLab, 'Position') + [0, raise + 0.05, 0])\n\n% make the tick labels smaller\nset(plotAxes, 'Fontsize', 8)\nif strcmp(input, 'Steer')\n legWords = {'$\\delta$ Loop',\n 'Neuromuscular model from [27]',\n '$\\dot{\\phi}$ Loop'};\nelseif strcmp(input, 'Roll')\n legWords = {'$\\dot{\\phi}$ Loop'};\nend\ncloseLeg = legend(lines(whichLines), ...\n legWords, ...\n 'Location', 'Southwest', ...\n 'Interpreter', 'Latex', ...\n 'Fontsize', 8);\n\n% add the annotation showing a 10 dB peak\nif strcmp(input, 'Steer')\n axes(plotAxes(2))\n db1 = text(2.7, 5.0, '~10dB');\n db2 = text(2.5, -10.0, '~10dB');\n set([db1, db2], 'Fontsize', 8)\n dArrow1 = annotation('doublearrow', ...\n [0.7, 0.7], ...\n [0.755 + raise, 0.818 + raise]);\n annotation('line', [0.69, 0.87], [0.818 + raise, 0.818 + raise])\n dArrow2 = annotation('doublearrow', ...\n [0.685, 0.685], ...\n [0.665 + raise, 0.725 + raise]);\n annotation('line', [0.675, 0.87], [0.725 + raise, 0.725 + raise])\n set([dArrow1, dArrow2], 'Head1width', 3, 'Head1length', 3, ...\n 'Head2width', 3, 'Head2length', 3)\nelse\n axes(plotAxes(2))\n db1 = text(0.67, -3.7, '~10dB');\n set(db1, 'Fontsize', 8)\n dArrow = annotation('doublearrow', ...\n [0.5, 0.5], ...\n [0.697 + raise, 0.795 + raise]);\n set(dArrow, 'Head1width', 3, 'Head1length', 3, ...\n 'Head2width', 3, 'Head2length', 3)\n annotation('line', [0.49, 0.75], [0.795 + raise, 0.795 + raise])\nend\n\nfilename = ['benchmark' input 'Closed'];\npathToFile = ['plots' filesep filename];\nprint(gcf, '-deps2c', '-loose', [pathToFile '.eps'])\nfix_ps_linestyle([pathToFile '.eps'])\n\n% open loop plots\nfigure()\nset(gcf, ...\n 'Color', [1, 1, 1], ...\n 'PaperOrientation', 'portrait', ...\n 'PaperUnits', 'inches', ...\n 'PaperPositionMode', 'manual', ...\n 'PaperPosition', [0, 0, figWidth, figHeight], ...\n 'PaperSize', [figWidth, figHeight])\n\nopenLoops = bikeData.openLoops;\n\nhold all\n\nnum = openLoops.Phi.num;\nden = openLoops.Phi.den;\nbodeplot(tf(num, den), freq, bops);\n\nnum = openLoops.Psi.num;\nden = openLoops.Psi.den;\nbodeplot(tf(num, den), freq, bops);\n\nnum = openLoops.Y.num;\nden = openLoops.Y.den;\nopenBode = bodeplot(tf(num, den), freq, bops);\n\nhold off\n\n% clean it up\nopts = getoptions(openBode);\nopts.Title.String = '';\nopts.YLim = {[-80, 20], [-540, -60]};\nopts.PhaseMatching = 'on';\nopts.PhaseMatchingValue = 0;\nsetoptions(openBode, opts)\n\n% find all the lines in the current figure\nlines = findobj(gcf, 'type', 'line');\nlinestyles = {'', '', '-.', '-', '--', '-.', '-', '--'};\nfor i = 3:length(lines)\n set(lines(i), 'LineStyle', linestyles{i}, ...\n 'Color', 'k', ...\n 'LineWidth', 2.0)\nend\n\n\nplotAxes = findobj(gcf, 'type', 'axes');\nset(plotAxes, 'Fontsize', 8, 'XColor', 'k', 'YColor', 'k')\ncloseLeg = legend(lines(8:-1:6), ...\n {'$\\phi$ Loop', '$\\psi$ Loop','$y$ Loop'}, ...\n 'Location', 'Southwest', ...\n 'Interpreter', 'Latex');\n\n% add zero crossing lines\n%axes(plotAxes(1))\n%line([0.1, 20], [-180, -180], 'Color', 'k')\naxes(plotAxes(2))\nline([0.1, 20], [0, 0], 'Color', 'k')\n\n% add some lines and labels for the cross over frequencies\nif strcmp(input, 'Steer')\n wc = 2;\n wShift = [0.42, 0.35, 0.175];\nelse strcmp(input, 'Roll')\n wc = 1.5;\n wShift = [0.31, 0.26, 0.1325];\nend\naxes(plotAxes(2))\nhold on\ngray = [0.5, 0.5, 0.5];\n\nline([wc, wc], [-40, 0], 'Color', gray)\ntext(wc - wShift(1), -43, ['$\\omega_c=' num2str(wc) '$'], ...\n 'Interpreter', 'Latex', 'Fontsize', 8)\n\nline([wc / 2, wc / 2], [-30, 0], 'Color', gray)\ntext(wc / 2 - wShift(2), -33, ['$\\omega_c/2=' num2str(wc / 2) '$'], ...\n 'Interpreter', 'Latex', 'Fontsize', 8)\n\nline([wc / 4, wc / 4], [-20, 0], 'Color', gray)\ntext(wc / 4 - wShift(3), -23, ['$\\omega_c/4=' num2str(wc / 4) '$'], ...\n 'Interpreter', 'Latex', 'Fontsize', 8)\n\nhold off\n\ncurPos1 = get(plotAxes(1), 'Position');\ncurPos2 = get(plotAxes(2), 'Position');\nset(plotAxes(1), 'Position', curPos1 + [0, raise, 0, 0])\nset(plotAxes(2), 'Position', curPos2 + [0, raise, 0, 0])\nxLab = get(plotAxes(1), 'Xlabel');\nset(xLab, 'Units', 'normalized')\nset(xLab, 'Position', get(xLab, 'Position') + [0, raise + 0.05, 0])\n\nfilename = ['benchmark' input 'Open.eps'];\npathToFile = ['plots' filesep filename];\nprint(gcf, '-deps2c', '-loose', pathToFile)\nfix_ps_linestyle(pathToFile)\n\n% handling qualities plot\nnum = bikeData.handlingMetric.num;\nden = bikeData.handlingMetric.den;\nw = linspace(0.01, 20, 200);\n[mag, phase, freq] = bode(tf(num, den), w);\nfigure()\nset(gcf, ...\n 'Color', [1, 1, 1], ...\n 'PaperOrientation', 'portrait', ...\n 'PaperUnits', 'inches', ...\n 'PaperPositionMode', 'manual', ...\n 'PaperPosition', [0, 0, figWidth, figHeight], ...\n 'PaperSize', [figWidth, figHeight])\n\nhold on\n\nmetricLine = plot(freq, mag(:)', 'k-', 'Linewidth', 2.0);\nlevel1 = line([0, 20], [5, 5]);\nlevel2 = line([0, 20], [8, 8]);\nset(level1, 'Color', 'k', 'Linestyle', '--', 'Linewidth', 2.0)\nset(level2, 'Color', 'k', 'Linestyle', '--', 'Linewidth', 2.0)\n\nylim([0, 10]);\n\nylabel('Handling Quality Metric')\nxlabel('Frequency (rad/s)')\ntext(3, 3, 'Level 1')\ntext(3, 6.5, 'Level 2')\ntext(3, 9, 'Level 3')\nbox on\n\nfilename = ['benchmark' input 'Handling.eps'];\npathToFile = ['plots' filesep filename];\nprint(gcf, '-deps2', '-loose', pathToFile)\nfix_ps_linestyle(pathToFile)\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nfunction open_loop_all_bikes(data, linestyles, colors)\n% Creates open loop Bode plots of all the bikes.\n\nglobal goldenRatio\n\nbikes = fieldnames(data);\n\nfigure()\nfigWidth = 5.0;\nfigHeight = figWidth / goldenRatio;\nset(gcf, ...\n 'Color', [1, 1, 1], ...\n 'PaperOrientation', 'portrait', ...\n 'PaperUnits', 'inches', ...\n 'PaperPositionMode', 'manual', ...\n 'PaperPosition', [0, 0, figWidth, figHeight], ...\n 'PaperSize', [figWidth, figHeight])\n\nfreq = {0.1, 20.0};\n\n% make sure all bode plots display 'rad/s' instead of 'rad/sec'\nbops = bodeoptions;\nbops.FreqUnits = 'rad/s';\n\nhold all\nfor i = 2:length(bikes)\n num = data.(bikes{i}).Medium.openLoops.Phi.num;\n den = data.(bikes{i}).Medium.openLoops.Phi.den;\n openBode = bodeplot(tf(num, den), freq, bops);\nend\nhold off\n\n% clean it up\nopts = getoptions(openBode);\n%opts.Title.String = '$\\phi$ Open Loop Bode Diagrams at 5 m/s';\nopts.Title.String = '';\n%opts.Title.Interpreter = 'Latex';\nopts.YLim = {[-30, 10], [-540, -90]};\nopts.PhaseMatching = 'on';\nopts.PhaseMatchingValue = 0;\nsetoptions(openBode, opts)\n\n% find all the lines in the current figure\nplotAxes = findobj(gcf, 'type', 'axes');\nmagLines = findobj(plotAxes(2), 'type', 'line');\nphaseLines = findobj(plotAxes(1), 'type', 'line');\n\nfor i = 2:length(magLines)\n set(magLines(i), ...\n 'LineStyle', linestyles{i - 1}, ...\n 'Color', colors{i - 1}, ...\n 'LineWidth', 1.0)\n set(phaseLines(i), ...\n 'LineStyle', linestyles{i - 1}, ...\n 'Color', colors{i - 1}, ...\n 'LineWidth', 1.0)\nend\n\ncloseLeg = legend(magLines(2:7), ...\n {'1', '2', '3', '4', '5', '6'}, ...\n 'Location', 'Southwest', ...\n 'Fontsize', 8);\n\nset(plotAxes, 'YColor', 'k', 'XColor', 'k', 'Fontsize', 8)\n\n% add a zero lines\naxes(plotAxes(1))\nline([0.1, 20], [-180, -180], 'Color', 'k')\naxes(plotAxes(2))\nline([0.1, 20], [0, 0], 'Color', 'k')\n\n% raise the axes cause the xlabel is cut off\nraise = 0.05;\ncurPos1 = get(plotAxes(1), 'Position');\ncurPos2 = get(plotAxes(2), 'Position');\nset(plotAxes(1), 'Position', curPos1 + [0, raise, 0, 0])\nset(plotAxes(2), 'Position', curPos2 + [0, raise, 0, 0])\nxLab = get(plotAxes(1), 'Xlabel');\nset(xLab, 'Units', 'normalized')\nset(xLab, 'Position', get(xLab, 'Position') + [0, raise + 0.05, 0])\n\nfilename = 'openBode.eps';\npathToFile = ['plots' filesep filename];\nprint(pathToFile, '-deps2c', '-loose')\nfix_ps_linestyle(pathToFile)\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nfunction handling_all_bikes(data, rollData, linestyles, colors)\n% Creates handling quality metric for all bikes.\n%\n% Parameters\n% ----------\n% data : structure\n% Contains data for all bikes a the three speeds for steer input.\n% rollData : structure\n% Contains the data for the benchmark bike with roll input at medium speed.\n% linestyles : cell array\n% Linestyle strings, one for each of the six bikes.\n% colors : cell array\n% Colorspecs for each of the six bikes.\n\nglobal goldenRatio\n\nbikes = fieldnames(data);\nfigure()\nfigWidth = 5.0;\nfigHeight = figWidth / goldenRatio;\nset(gcf, ...\n 'Color', [1, 1, 1], ...\n 'PaperOrientation', 'portrait', ...\n 'PaperUnits', 'inches', ...\n 'PaperPositionMode', 'manual', ...\n 'PaperPosition', [0, 0, figWidth, figHeight], ...\n 'PaperSize', [figWidth, figHeight])\n\nw = linspace(0.01, 20, 200);\nspeedNames = fieldnames(data.Browser);\nfillColors = {[0.82, 0.82, 0.82]\n [0.68, 0.68, 0.68]\n [0.95, 0.95, 0.95]};\nhold all\n\n% plot the background area for each family of curves\nfor j = 1:length(speedNames)\n % get the max values for the set of curves\n magnitudes = zeros(length(w), length(bikes) - 1);\n for i = 2:length(bikes)\n num = data.(bikes{i}).(speedNames{j}).handlingMetric.num;\n den = data.(bikes{i}).(speedNames{j}).handlingMetric.den;\n [mag, phase, freq] = bode(tf(num, den), w);\n magnitudes(:, i - 1) = mag(:)';\n end\n maxMag = max(magnitudes, [], 2);\n % fill the area under the curve\n area(freq, maxMag, ...\n 'Facecolor', fillColors{j}, ...\n 'Edgecolor', 'none')\nend\n\n% this makes sure that the edges of the fill area don't cover the axes\nset(gca, 'Layer', 'top')\n\n% plot the actual curves\nfor j = 1:length(speedNames)\n metricLines = zeros(length(bikes) - 1, 1);\n for i = 2:length(bikes)\n num = data.(bikes{i}).(speedNames{j}).handlingMetric.num;\n den = data.(bikes{i}).(speedNames{j}).handlingMetric.den;\n [mag, phase, freq] = bode(tf(num, den), w);\n metricLines(i - 1) = plot(freq, mag(:)', ...\n 'Color', colors{i - 1}, ...\n 'Linestyle', linestyles{i - 1}, ...\n 'Linewidth', 2.0);\n end\nend\n\n% add the roll input bike\nnum = rollData.handlingMetric.num;\nden = rollData.handlingMetric.den;\n[mag, phase, freq] = bode(tf(num, den), w);\nrollLine = plot(freq, mag(:)', 'k', 'Linewidth', 2.0, 'Linestyle', ':');\n\nhold off\n\n% move the roll input line down so it shows on the legend\nchil = get(gca, 'Children');\nlegLines = [chil(end:-1:14)', rollLine];\nlegend(legLines, [{'2.5 m/s', '5.0 m/s', '7.5 m/s'}, ...\n {'1', '2', '3', '4', '5', '6', 'Hands-free @ 5 m/s'}], ...\n 'Fontsize', 8)\n\nylim([0, 20]);\nlevel1 = line([0, 20], [5, 5]);\nlevel2 = line([0, 20], [8, 8]);\nset(level1, 'Color', 'k', 'Linestyle', '--', 'Linewidth', 1.0)\nset(level2, 'Color', 'k', 'Linestyle', '--', 'Linewidth', 1.0)\nylabel('Handling Quality Metric')\nxlabel('Frequency (rad/s)')\ntext(3.1, 4.3, 'Level 1')\ntext(1.9, 6.5, 'Level 2')\ntext(3, 15, 'Level 3')\nbox on\n\nset(gca, 'YColor', 'k')\n\nfilename = 'handling.eps';\npathToFile = ['plots' filesep filename];\nprint(pathToFile, '-deps2c', '-loose')\nfix_ps_linestyle(pathToFile)\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nfunction path_plots(data, linestyles, colors)\n% Creates a plot of the path tracking for all bikes at all speeds.\n\nglobal goldenRatio\n\nbikes = fieldnames(data);\nspeedNames = fieldnames(data.Browser);\n\nfigure()\nfigWidth = 5.0;\nfigHeight = figWidth / goldenRatio;\nset(gcf, ...\n 'Color', [1, 1, 1], ...\n 'PaperOrientation', 'portrait', ...\n 'PaperUnits', 'inches', ...\n 'PaperPositionMode', 'manual', ...\n 'PaperPosition', [0, 0, figWidth, figHeight], ...\n 'PaperSize', [figWidth, figHeight])\n\nhold all\n\n% shifts the paths by this many meters\nshift = [0, 15, 35];\nfor j = 1:length(speedNames)\n time = data.(bikes{2}).(speedNames{j}).time;\n path = data.(bikes{2}).(speedNames{j}).path;\n speed = data.(bikes{2}).(speedNames{j}).speed;\n plot(time * speed + shift(j), -path * j, 'k-')\n for i = 2:length(bikes)\n x = data.(bikes{i}).(speedNames{j}).outputs(:, 17);\n x = x + shift(j);\n y = data.(bikes{i}).(speedNames{j}).outputs(:, 18);\n plot(x, -y * j, ...\n 'Linestyle', linestyles{i - 1}, ...\n 'Color', colors{i - 1}, ...\n 'Linewidth', 0.75)\n end\n [minPath, minPathI] = min(-path * j);\n dis = time * speed + shift(j);\n lab = sprintf('%1.1f m/s', speed);\n text(dis(minPathI) - 15, minPath - 0.4, lab)\nend\n\nhold off\n\n% change the y tick labels to positive and to reflect the 2 meter width\nset(gca, 'YTick', [-7, -6, -4, -2, 0, 1])\nset(gca, 'YTickLabel', {'', '2', '2', '2', '0', ''})\n\nxlim([30 200])\nbox on\nlegend(['Path', {'1', '2', '3', '4', '5', '6'}], ...\n 'Fontsize', 8, 'Location', 'Southeast')\nxlabel('Distance (m)')\nylabel('Lateral Deviation (m)')\nfilename = 'paths.eps';\npathToFile = ['plots' filesep filename];\nprint(pathToFile, '-deps2c', '-loose')\nfix_ps_linestyle(pathToFile)\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nfunction plot_io(variable, io, xAxis, data, linestyles, colors)\n% Creates a plot of the time histories of a particular output or input variable\n% for three different speeds with either time or distance on the x axis.\n%\n% Parameters\n% ----------\n% variable : string\n% The name of the variable you'd like to plot.\n% io : string\n% 'input' for input and 'output' for output.\n% data : structure\n% Data for a set of bicycles, the first being the benchmark bicycle.\n% xAxis : string\n% 'Distance' or 'Time' on the x axis.\n% linestyles : cell array\n% An array of linestyle types, one for each bicycle.\n% colors : cell array\n% An array of colors, one for each bicycle.\n\nglobal goldenRatio\n\nif strcmp(io, 'input')\n names = {'Tphi',\n 'Tdelta',\n 'F'};\n prettyNames = {'$T_\\phi$',\n '$T_\\delta$',\n '$F$'};\n units = {'(N-m)',\n '(N-m)',\n '(N)'};\nelseif strcmp(io, 'output')\n names = {'xP',\n 'yP',\n 'psi',\n 'phi',\n 'thetaP',\n 'thetaR',\n 'delta',\n 'thetaF',\n 'xPDot',\n 'ypDot',\n 'psiDot',\n 'phiDot',\n 'thetaPDot',\n 'thetaRDot',\n 'deltaDot',\n 'thetaFDot',\n 'xQ',\n 'yQ'};\n prettyNames = {'$x_P$',\n '$y_P$',\n '$\\psi$',\n '$\\phi$',\n '$\\theta_P$',\n '$\\theta_R$',\n '$\\delta$',\n '$\\theta_F$',\n '$\\dot{x}_P$',\n '$\\dot{y}_P$',\n '$\\dot{\\psi}$',\n '$\\dot{\\phi}$',\n '$\\dot{\\theta}_P$',\n '$\\dot{\\theta}_R$',\n '$\\dot{\\delta}$',\n '$\\dot{\\theta}_F$',\n '$x_Q$',\n '$y_Q$'};\n units = {'(m)',\n '(m)',\n '(rad)',\n '(rad)',\n '(rad)',\n '(rad)',\n '(rad)',\n '(rad)',\n '(m/s)',\n '(m/s)',\n '(rad/s)',\n '(rad/s)',\n '(rad/s)',\n '(rad/s)',\n '(rad/s)',\n '(rad/s)',\n '(m)',\n '(m)'};\nelse\n error('Please choose i or o')\nend\n\nindex = find(ismember(names, variable) == 1);\n\nbikes = fieldnames(data);\nspeedNames = fieldnames(data.Browser);\n\nfigure()\nfigWidth = 5.0;\nfigHeight = figWidth / goldenRatio;\nset(gcf, ...\n 'Color', [1, 1, 1], ...\n 'PaperOrientation', 'portrait', ...\n 'PaperUnits', 'inches', ...\n 'PaperPositionMode', 'manual', ...\n 'PaperPosition', [0, 0, figWidth, figHeight], ...\n 'PaperSize', [figWidth, figHeight])\n\n% find the maximum value of the variable\nmaxValue = 0;\nfor i = 2:length(bikes)\n for j = 1:length(speedNames)\n oneSpeed = data.(bikes{i}).(speedNames{j});\n history = oneSpeed.([io 's'])(:, index);\n if max(history) > maxValue\n maxValue = max(history);\n end\n end\nend\n\nm = round(maxValue * 100) / 100;\npad = 0.15 * m;\nyShift = [0, 2 * (m + pad), 4 * (m + pad)];\n\n% shifts the paths by this many meters along the x axis\nxShift = [0, 15, 35];\nhold all\nfor j = 1:length(speedNames)\n for i = 2:length(bikes)\n oneSpeed = data.(bikes{i}).(speedNames{j});\n time = oneSpeed.time;\n speed = oneSpeed.speed;\n distance = time * speed + xShift(j);\n % time history of the value\n history = oneSpeed.([io 's'])(:, index) + yShift(j);\n if strcmp(xAxis, 'Distance')\n xData = distance;\n textX = 165;\n elseif strcmp(xAxis, 'Time')\n xData = time;\n textX = 2;\n else\n error('Choose Time or Distance, no other')\n end\n plot(xData, history, ...\n 'Linestyle', linestyles{i - 1}, ...\n 'Color', colors{i - 1}, ...\n 'Linewidth', 0.75)\n end\n % add labels for the speeds\n text(textX, yShift(j) + 4 * pad, [num2str(speed) ' m/s'])\nend\n\nylim([-m - pad, yShift(3) + m + pad])\nset(gca, 'YTick', ...\n [-m, yShift(1), m, ...\n yShift(2) - m, yShift(2), yShift(2) + m, ...\n yShift(3) - m, yShift(3), yShift(3) + m])\nticks = {num2str(-m), '0', num2str(m)};\nset(gca, 'YTickLabel', [ticks, ticks ticks])\n\nif strcmp(xAxis, 'Distance')\n xlabel('Distance (m)')\n xLimits = [35, 190];\n xlim(xLimits)\n loc = 'Northwest';\nelse\n xlabel('Time (s)')\n xLimits = [0, 50];\n xlim(xLimits)\n loc = 'Northeast';\nend\nl1 = line(xLimits, [yShift(1) + m + pad, yShift(1) + m + pad]);\nl2 = line(xLimits, [yShift(2) + m + pad, yShift(2) + m + pad]);\nset([l1, l2], 'Color', 'k')\nhold off\nset(gca, 'Fontsize', 8)\nfirst = [prettyNames{index} ' ' units{index}];\nylabel(first, 'Interpreter', 'Latex')\nbox on\nlegend({'1', '2', '3', '4', '5', '6'}, 'Fontsize', 8, 'Location', loc)\n\n% if it is the steer angle plot for distance, add a magnifier for the\n% countersteer\nif strcmp(variable, 'delta') && strcmp(xAxis, 'Distance')\n % Specify the position and the size of the rectangle\n x_r = 37; y_r = 0; w_r = 4; h_r = 0.01;\n rectangle('Position', [x_r-w_r/2, y_r-h_r/2, w_r, h_r], ...\n 'EdgeColor', 'k');\n % Specify the position and the size of the 2. axis\n x_a = 0.2; y_a = 0.29; w_a = 0.15; h_a = w_a * h_r / w_r * 20 / 0.05;\n ax = axes('Units', 'Normalized', ...\n 'Position', [x_a, y_a, w_a, h_a], ...\n 'XTick', [], ...\n 'YTick', [], ...\n 'Box', 'on', ...\n 'LineWidth', 0.5, ...\n 'Color', 'w');\n hold on\n j = 1;\n for i = 2:length(bikes)\n oneSpeed = data.(bikes{i}).(speedNames{j});\n time = oneSpeed.time;\n speed = oneSpeed.speed;\n distance = time * speed + xShift(j);\n % time history of the value\n history = oneSpeed.([io 's'])(:, index) + yShift(j);\n plot(distance, history, ...\n 'Linestyle', linestyles{i - 1}, ...\n 'Color', colors{i - 1}, ...\n 'Linewidth', 0.75)\n end\n hold off\n axis([x_r-w_r/2, x_r+w_r/2, y_r-h_r/2, y_r+h_r/2]);\n text(35.3, -0.003, 'Countersteer', 'Fontsize', 8)\n % bottom left\n annotation('line', [x_a, 0.129], [y_a, 0.235])\n % top left\n annotation('line', [x_a, 0.132], [y_a + h_a, 0.26])\n % bottom right\n annotation('line', [x_a + w_a, 0.15], [y_a, 0.235])\n % top right\n annotation('line', [x_a, 0.15], [y_a + 0.02, 0.26])\nend\n\n% save the file\nfilename = [variable xAxis '.eps'];\nprint(['plots' filesep filename], '-deps2c', '-loose')\nfix_ps_linestyle(['plots' filesep filename])\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nfunction plot_io_roll(rollData, xAxis)\n\nglobal goldenRatio\n\n% closed loop bode plots\nfigure()\nfigWidth = 5.0;\nfigHeight = figWidth / goldenRatio;\nset(gcf, ...\n 'Color', [1, 1, 1], ...\n 'PaperOrientation', 'portrait', ...\n 'PaperUnits', 'inches', ...\n 'PaperPositionMode', 'manual', ...\n 'PaperPosition', [0, 0, figWidth, figHeight], ...\n 'PaperSize', [figWidth, figHeight])\n\nspeed = rollData.speed;\ntime = rollData.time;\npath = rollData.path;\nfrontWheel = rollData.outputs(:, 18);\nrollAngle = rollData.outputs(:, 4);\nsteerAngle = rollData.outputs(:, 7);\nrollTorque = rollData.inputs(:, 1);\n\n% plot the path\nsubplot(2, 1, 1)\nhold all\nif strcmp(xAxis, 'Distance')\n plot(speed * time, -path, 'k-', 'Linewidth', 1.0)\n plot(speed * time, -frontWheel, 'k:', 'Linewidth', 1.0)\n xlabel('Distance (m)')\n xlim([30, 150])\nelseif strcmp(xAxis, 'Time')\n plot(time, -path, 'k-', 'Linewidth', 1.0)\n plot(time, -frontWheel, 'k:', 'Linewidth', 1.0)\n xlabel('Time (s)')\n xlim([30 / speed, 150 / speed])\nelse\n error('Bad xAxis, choose Distance or Time')\nend\nhold off\nbox on\nylabel('Lateral Deviation (m)')\nylim([-2.2, 0.2])\nset(gca, 'YTickLabel', {'2', '1', '0'})\nlegend({'Path'}, ...\n 'Interpreter', 'Latex', ...\n 'Fontsize', 8, ...\n 'Location', 'Southeast')\n\nsubplot(2, 1, 2)\nhold all\nif strcmp(xAxis, 'Distance')\n plot(speed * time, rollAngle, 'k-', 'Linewidth', 1.0)\n [ax, h1, h2] = plotyy(speed * time, steerAngle, speed * time, rollTorque);\n xlabel('Distance (m)')\n xlim(ax(1), [30, 150])\n xlim(ax(2), [30, 150])\nelseif strcmp(xAxis, 'Time')\n plot(time, rollAngle, 'k-', 'Linewidth', 1.0)\n [ax, h1, h2] = plotyy(time, steerAngle, time, rollTorque);\n xlabel('Time (s)')\n xlim(ax(1), [30 / speed, 150 / speed])\n xlim(ax(2), [30 / speed, 150 / speed])\nelse\n error('Bad xAxis, choose Distance or Time')\nend\nhold off\nbox on\n\nset(get(ax(1), 'Ylabel'), ...\n 'String', 'Angle (rad)', ...\n 'Color', 'k')\nset(get(ax(2), 'Ylabel'), ...\n 'String', 'Torque (N-m)', ...\n 'Color', 'k')\nset(ax, 'YColor', 'k', 'Fontsize', 8)\nset(h1, 'Linestyle', '--', 'Color', 'k', 'Linewidth', 1.0)\nset(h2, 'Linestyle', '-.', 'Color', 'k', 'Linewidth', 1.0)\nlegend({'$\\phi$', '$\\delta$', '$T_\\phi$'}, ...\n 'Interpreter', 'Latex', ...\n 'Fontsize', 8, ...\n 'Location', 'Northeast')\n\nif strcmp(xAxis, 'Distance')\n axes(ax(2))\n % magnifier rectangle\n x_r = 38; y_r = 0; w_r = 10; h_r = 0.3;\n rectangle('Position', [x_r-w_r/2, y_r-h_r/2, w_r, h_r], ...\n 'EdgeColor', 'k');\n % magnify it\n x_a = 0.14; y_a = 0.432; w_a = 0.28; h_a = 0.12;\n inset = axes('Units', 'Normalized', ...\n 'Position', [x_a, y_a, w_a, h_a], ...\n 'Box', 'on', ...\n 'LineWidth', 0.5, ...\n 'Color', [0.8, 0.8, 0.8]);\n hold on\n plot(inset, time, rollAngle, 'k-', 'Linewidth', 1.0)\n [ax, h1, h2] = plotyy(inset, time, steerAngle, time, rollTorque);\n set(ax, 'XTick', [], ...\n 'YTick', [], ...\n 'YColor', 'k')\n set(h1, 'Linestyle', '--', 'Color', 'k', 'Linewidth', 1.0)\n set(h2, 'Linestyle', '-.', 'Color', 'k', 'Linewidth', 1.0)\n axis(ax(1), [7, 8.5, -0.0025, 0.0025])\n axis(ax(2), [7, 8.5, -0.0025 / 0.02, 0.0025 / 0.02])\n\n % draw some lines connecting the corners\n annotation('line', [x_a, 0.149], [y_a, 0.287])\n annotation('line', [x_a + w_a, 0.213], [y_a, 0.287])\n annotation('textbox', [0.26, 0.47, 0.1, 0.02], ...\n 'String', 'Countersteer', ...\n 'Fontsize', 8, ...\n 'Edgecolor', 'none')\nend\n\nfilename = ['roll' xAxis '.eps'];\nprint(gcf, ['plots' filesep filename], '-deps2c', '-loose')\nfix_ps_linestyle(['plots' filesep filename])\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nfunction phase_portraits(bikeData)\n% Creates four phase portrait plots to demonstrate the effects on the phase\n% portraits when adjusting the gains.\n\nglobal goldenRatio\n\nfigure()\nfigWidth = 6.0;\nfigHeight = figWidth / goldenRatio;\nset(gcf, ...\n 'Color', [1, 1, 1], ...\n 'PaperOrientation', 'portrait', ...\n 'PaperUnits', 'inches', ...\n 'PaperPositionMode', 'manual', ...\n 'OuterPosition', [424, 305 - 50, 518, 465], ...\n 'PaperPosition', [0, 0, figWidth, figHeight], ...\n 'PaperSize', [figWidth, figHeight])\n\n% this is the gain multiplier for the non-nominal plot\ngainChanges = [1.2, 1, 1, 1, 1;\n 1, 1.2, 1, 1, 1;\n 1, 1, 1.2, 1, 1;\n 1, 1, 1.2, 0.8, 0.8];\n\nloopNames = {'kDelta', 'kPhiDot', 'kPhi', 'kPhi'};\n% the x and y indices for each plot\nxy = [7, 15;\n 4, 12;\n 4, 12;\n 4, 12];\n% where to get the x and y data from\nxySource = {'outputs', 'outputsDot', 'outputs', 'outputs'};\n\n% axis labels\nxlabels = {'(a) $\\delta$ (rad)',\n '(b) $\\dot{\\phi}$ (rad/s)',\n '(c) $\\phi$ (rad)',\n '(d) $\\phi$ (rad)'};\nylabels = {'$\\dot{\\delta}$ (rad/s)',\n '$\\ddot{\\phi}$ (rad/s$^2$)',\n '$\\dot{\\phi}$ (rad/s)',\n '$\\dot{\\phi}$ (rad/s)'};\n\n% legend starts\nlegends = {'$k_\\delta$ = ',\n '$k_{\\dot{\\phi}}$ = ',\n '$k_\\phi$ = ',\n '$k_\\phi$ = '};\n% how many decimals to show for each legend\nfloatSpec = {'%1.1f', '%1.3f', '%1.1f', '%1.1f'};\n\nfor i = 1:length(loopNames)\n\n display(sprintf('Calculating phase portrait %d', i))\n\n % adjust the gains and get the data\n twentyPercent = generate_data('Benchmark', 5.0, ...\n 'gainMuls', gainChanges(i, :));\n subplot(2, 2, i)\n hold on\n\n if i == 4\n display('Phase portrait 4 comparison data.')\n nominalData = generate_data('Benchmark', 5.0, ...\n 'gainMuls', [1, 1, 1, 0.8, 0.8]);\n x = nominalData.(xySource{i})(:, xy(i, 1));\n y = nominalData.(xySource{i})(:, xy(i, 2));\n else\n x = bikeData.(xySource{i})(:, xy(i, 1));\n y = bikeData.(xySource{i})(:, xy(i, 2));\n end\n plot(x, y, 'k-', 'Linewidth', 1.0)\n\n x = twentyPercent.(xySource{i})(:, xy(i, 1));\n y = twentyPercent.(xySource{i})(:, xy(i, 2));\n plot(x, y, 'k--', 'Linewidth', 1.0)\n\n hold off\n\n box on\n axis equal\n xlabel(xlabels{i}, 'Interpreter', 'Latex', 'Fontsize', 8)\n ylabel(ylabels{i}, 'Interpreter', 'Latex', 'Fontsize', 8)\n\n % make the legend\n leg1 = sprintf(floatSpec{i}, bikeData.modelPar.(loopNames{i}));\n leg2 = sprintf(floatSpec{i}, twentyPercent.modelPar.(loopNames{i}));\n legend({[legends{i} leg1], [legends{i} leg2]} , ...\n 'Interpreter', 'Latex', ...\n 'Fontsize', 6)\nend\n\nplotAxes = findobj(gcf, 'Type', 'Axes');\nset(plotAxes, 'Fontsize', 8)\n\n% save the plot\nfilename = 'phasePortraits.eps';\nprint(gcf, ['plots' filesep filename], '-deps2c', '-loose')\nfix_ps_linestyle(['plots' filesep filename])\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nfunction eigenvalues(data, linestyles, colors)\n\nglobal goldenRatio\n\nfigure()\nfigWidth = 5.0;\nfigHeight = figWidth / goldenRatio;\nset(gcf, ...\n 'Color', [1, 1, 1], ...\n 'PaperOrientation', 'portrait', ...\n 'PaperUnits', 'inches', ...\n 'PaperPositionMode', 'manual', ...\n 'PaperPosition', [0, 0, figWidth, figHeight], ...\n 'PaperSize', [figWidth, figHeight])\n\nbikes = fieldnames(data);\nbikes(1) = [];\nspeeds = 0:0.1:10;\neVals = zeros(length(bikes), length(speeds), 11);\nfor i = 1:length(bikes)\n % load the bicycle parameters\n pathToParFile = ['parameters' filesep bikes{i} 'Par.txt'];\n par = par_text_to_struct(pathToParFile);\n str = 'Calculating eigenvalues for the %s bicycle and rider.';\n display(sprintf(str, bikes{i}))\n for j = 1:length(speeds)\n % calculate the A, B, C, and D matrices of the bicycle model\n [A, B, C, D] = whipple_pull_force_abcd(par, speeds(j));\n eigenValues = eig(A);\n eVals(i, j, :) = real(eig(A));\n end\nend\n\n% reduce to the maximum values\nzeroIndices = find(abs(eVals) <= 0.000001);\neVals(zeroIndices) = -100 * ones(size(zeroIndices));\nmaxEvals = max(eVals, [], 3);\n\nlines = plot(speeds, maxEvals);\n\nfor i = 1:length(lines)\n set(lines(i), ...\n 'Linestyle', linestyles{i}, ...\n 'Color', colors{i}, ...\n 'Linewidth', 1)\nend\n\nlegend({'1', '2', '3', '4', '5', '6'})\nxlabel('Speed (m/s)')\nylabel('Maximum real part of the eigenvalue (1/s)')\n\n% set the tick marks differently\n%set(gca, 'XTick', 0:0.5:10)\n%set(gca, 'XTickLabel', {'0', '', '1', '', ...\n %'2', '2.5', '3', '', ...\n %'4', '', '5.0', '', ...\n %'6', '', '7', '7.5', ...\n %'8', '', '9', '', '10'})\n%\n% add some lines and labels for the speeds we looked at\nhold on\nmaxLine = max(maxEvals, [], 1);\nminLine = min(maxEvals, [], 1);\nlines = zeros(4, 1);\nspeedInd = find(speeds == 2.5);\nlines(1) = line([2.5, 2.5], ...\n [minLine(speedInd) - 0.4, maxLine(speedInd) + 0.4]);\ntext(2, maxLine(speedInd) + 0.7, '2.5 m/s')\nspeedInd = find(speeds == 5.0);\nlines(2) = line([5.0, 5.0], ...\n [minLine(speedInd) - 0.4, maxLine(speedInd) + 0.4]);\ntext(4.5, maxLine(speedInd) + 0.7, '5.0 m/s')\nspeedInd = find(speeds == 7.5);\nlines(3) = line([7.5, 7.5], ...\n [minLine(speedInd) - 0.4, maxLine(speedInd) + 0.4]);\ntext(7, maxLine(speedInd) + 0.7, '7.5 m/s')\n\nlines(4) = line([0, 10], [0, 0]);\nhold off\n\nset(lines, 'Color', 'k', 'Linewidth', 2)\n\n% save the plot\nfilename = 'eigenvalues.eps';\nprint(gcf, ['plots' filesep filename], '-deps2c', '-loose')\nfix_ps_linestyle(['plots' filesep filename])\n" }, { "path": "src/test/resources/samples/langs/Matlab/cross_validation.m", "content": "function [ error ] = cross_validation(x,y,hyper_parameter)\n \n num_data = size(x,1);\n\n K = 10;\n indices = crossvalind('Kfold', num_data, K);\n\n errors = zeros(K,1);\n for i = 1:K\n % get indices\n test_idx = (indices == i);\n train_idx = ~test_idx;\n\n % get training data\n x_train = x(train_idx,:);\n y_train = y(train_idx,:);\n\n % train\n w = train(x_train, y_train, hyper_parameter);\n\n % get test data\n x_test = x(test_idx,:);\n y_test = y(test_idx,:);\n \n % calculate error\n errors(i) = calc_cost(x_test, y_test, w, hyper_parameter); %calc_error\n %errors(i) = calc_error(x_test, y_test, w);\n end\n \n error = mean(errors);\nend\n" }, { "path": "src/test/resources/samples/langs/Matlab/distance.m", "content": "function [ value,isterminal,direction ] = distance( t,y,mu )\n% DISTANCE compute the distance from the attactors\n% [ value,terminal,direction ] = distance( t,y )\n\nd=1e-2; % FIXME\n\n% TODO mettere if se tolleranza D-d value=0\nD=sqrt((y(1)+mu).^2+y(2).^2); % distance from the largest primary\n\nvalue=d-D;\nisterminal=1;\ndirection=0;\nend" }, { "path": "src/test/resources/samples/langs/Matlab/double_gyre.m", "content": "clear all\ntic\n% initialize integration time T, f(x,t), discretization size n ----------------\nT = 8;\nx_min=0;\nx_max=2;\ny_min=0;\ny_max=1;\nn=50; % how many points per one measure unit (both in x and in y)\nds=1/(n-1);\nx_res=(x_max-x_min)*n;\ny_res=(y_max-y_min)*n;\ngrid_x=linspace(x_min,x_max,x_res);\ngrid_y=linspace(y_min,y_max,y_res);\n\nadvected_x=zeros(x_res,y_res);\nadvected_y=zeros(x_res,y_res);\n% integrate all initial points for t in [0,T] --------------------------------\nparfor i = 1:x_res\n\tfor j = 1:y_res\n\t\t[t,X] = ode45(@dg,[0,T],[grid_x(i),grid_y(j)]);\n\t\t% store advected positions as they would appear in (x,y) coords ------\n\t\tadvected_x(i,j) = X(length(X(:,1)),1);\n\t\tadvected_y(i,j) = X(length(X(:,2)),2);\n\tend\nend\n%% Compute FTLE\nsigma=zeros(x_res,y_res);\n% at each point in interior of grid, store FTLE ------------------------------\nfor i = 2:x_res-1\n\tfor j = 2:y_res-1\n\t\t% compute Jacobian phi -----------------------------------------------\n\t\tphi(1,1) = (advected_x(i+1,j)-advected_x(i-1,j))/(2*ds);\n\t\tphi(1,2) = (advected_x(i,j-1)-advected_x(i,j+1))/(2*ds);\n\t\tphi(2,1) = (advected_y(i+1,j)-advected_y(i-1,j))/(2*ds);\n\t\tphi(2,2) = (advected_y(i,j-1)-advected_y(i,j+1))/(2*ds);\n\t\t% find max eigenvalue of phi'*phi ------------------------------------\n\t\tlambda_max = max(abs(eig(phi'*phi)));\n\t\t% store FTLE ---------------------------------------------------------\n\t\tsigma(i,j) = log(lambda_max)/abs(2*T);\n\tend\nend\ntoc\n%% plot FTLE field ------------------------------------------------------------\nfigure\ncontourf(grid_x,grid_y,sigma');\ncolorbar('location','EastOutside');\naxis equal\nshading flat\n" }, { "path": "src/test/resources/samples/langs/Matlab/example.m", "content": "clear all\ntic\n% initialize integration time T, f(x,t), discretization size n ----------------\nT = 20;\nf_x_t = inline('[v(2);-sin(v(1))]','t','v');\ngrid_min = -3.4;\ngrid_max = 3.4;\ngrid_width = grid_max-grid_min;\nn = 35;\ngrid_spacing = grid_min:(grid_width/(n-1)):grid_max;\nadvected_x=zeros(n,n);\nadvected_y=zeros(n,n);\n% integrate all initial points for t in [0,T] --------------------------------\nfor i = 1:n\n\tfor j = 1:n\n\t\t[t,x] = ode45(f_x_t,[0,T],[grid_spacing(i),grid_spacing(j)]);\n\t\t% store advected positions as they would appear in (x,y) coords ------\n\t\tadvected_x(n-j+1,i) = x(length(x(:,1)),1);\n\t\tadvected_y(n-j+1,i) = x(length(x(:,2)),2);\n\tend\nend\nsigma=zeros(n,n);\n% at each point in interior of grid, store FTLE ------------------------------\nfor i = 2:n-1\n\tfor j = 2:n-1\n\t\t% compute Jacobian phi -----------------------------------------------\n\t\tphi(1,1) = (advected_x(i,j+1)-advected_x(i,j-1))/(2*grid_width/(n-1));\n\t\tphi(1,2) = (advected_x(i-1,j)-advected_x(i+1,j))/(2*grid_width/(n-1));\n\t\tphi(2,1) = (advected_y(i,j+1)-advected_y(i,j-1))/(2*grid_width/(n-1));\n\t\tphi(2,2) = (advected_y(i-1,j)-advected_y(i+1,j))/(2*grid_width/(n-1));\n\t\t% find max eigenvalue of phi'*phi ------------------------------------\n\t\tlambda_max = max(abs(eig(phi'*phi)));\n\t\t% store FTLE ---------------------------------------------------------\n\t\tsigma(i,j) = log(lambda_max)/abs(T);\n\tend\nend\ntoc\n%% plot FTLE field ------------------------------------------------------------\nfigure\ncontourf(grid_spacing,grid_spacing,sigma);\ncolorbar('location','EastOutside');" }, { "path": "src/test/resources/samples/langs/Matlab/fit_adapt.m", "content": "data = load_data('jason_adapt.mat');\n\nt0 = 0;\nt1 = 30;\nt2 = 60;\nt3 = 90;\n\ndataPlantOne = data(1:t1 / data.Ts);\ndataAdapting = data(t1 / data.Ts:t2 / data.Ts);\ndataPlantTwo = data(t2 / data.Ts:end);\n\n% k1, k2, k3, k4, tau, zetanm, wnm, zetafs, wfs\n\n% ron's guess\nguessPlantOne = [4.85, 1.79, 20, 20, 0.2, 0.707, 10, 0.707, 65];\n% best solution from ron's guess\n%guessPlantOne = [4.1129, 2.1327, 52.3747, 48.6997, 0.2, 0.707, 10, 0.707, 65];\nresultPlantOne = find_structural_gains(dataPlantOne, guessPlantOne, 1);\n[yh, fit, x0] = compare(dataPlantOne, resultPlantOne.fit);\ndisplay(sprintf('The self validation VAF is %f.', fit(1, 1, 1)))\n\n% ron's guess\nguessPlantTwo = [3.36, 9.49, 20, 0, 0.2, 0.707, 10, 0.707, 65];\n% best solution from ron's guess\n%guessPlantTwo = [2.6686, 7.0431, 14.4623, 3.1532, 0.2, 0.707, 10, 0.707, 65];\nresultPlantTwo = find_structural_gains(dataPlantTwo, guessPlantTwo, 5);\n[yh, fit, x0] = compare(dataPlantTwo, resultPlantTwo.fit);\ndisplay(sprintf('The self validation VAF is %f.', fit(1, 1, 1)))\n\n% compute the slope and offset for each gain for initial guesses\nkP1 = resultPlantOne.fit.par(1:4);\nkP2 = resultPlantTwo.fit.par(1:4);\ngainSlopeOffset = [t1 * eye(4), eye(4); t2 * eye(4), eye(4)] \\ [kP1; kP2];\n\naux.pars = guessPlantOne; % this only uses tau through wfs\naux.timeDelay = true;\naux.plantFirst = 1; % 1 / s\naux.plantSecond = 5; % 5 / (s + 10)\n% compute the slope and offset of the plant for t1 < t < t2\nplantOneSlopeOffset = [t1, 1; t2, 1] \\ [1; 0];\nplantTwoSlopeOffset = [t1, 1; t2, 1] \\ [0; 1];\naux.m = [plantOneSlopeOffset(1); plantTwoSlopeOffset(1)];\naux.b = [plantOneSlopeOffset(2); plantTwoSlopeOffset(2)];\n\n%[dx, y] = adapting_structural_model(45, ones(8, 1), 10, gainSlopeOffset, {aux});\n\n% NOTE: 'FileArgument' has to be a cell array, the is why aux is in\n% brackets. Also, if you pass the parameters in as a vector here, as I have,\n% they get mapped to a structure and your ode file/function must accept each\n% parameter as individual arguments.\nmod = idnlgrey('adapting_structural_model', [1, 1, 8], gainSlopeOffset, ...\n zeros(8, 1), 0, 'FileArgument', {aux}, 'InputName', 'thetac', ...\n 'OutputName', 'theta');\n\nfit = pem(dataAdapting, mod);\n\ncompare(dataAdapting, fit);\n" }, { "path": "src/test/resources/samples/langs/Matlab/fit_adapt_linear.m", "content": "% This file identifies a series of models for a time varying plant.\n\n% k1, k2, k3, k4, tau, zetanm, wnm, zetafs, wfs\n\n%data = load_data('jason_adapt.mat');\n%filename = 'adapt';\n%guess.plantOne = [4.85, 1.79, 20, 20, 0.2, 0.707, 10, 0.707, 65];\n%guess.plantTwo = [3.36, 9.49, 20, 0, 0.2, 0.707, 10, 0.707, 65];\n%plantNum.plantOne = 1;\n%plantNum.plantTwo = 5;\n\ndata = load_data('adapt_hard.mat');\nfilename = 'hard-adapt';\nguess.plantOne = [1.23, 0.354, 0.2, 20.0, 0.2, 0.707, 10, 0.707, 65];\nguess.plantTwo = [4.85, 1.79, 20, 20, 0.2, 0.707, 10, 0.707, 65];\nplantNum.plantOne = 6;\nplantNum.plantTwo = 1;\n\nt = [0, 30, 40, 50, 60, 90];\n\nsections = {'plantOne', 'adaptOne', 'adaptTwo', 'adaptThree', 'plantTwo'};\nfor i = 1:length(sections)\n secData.(sections{i}) = data(t(i) / data.Ts + 1:t(i + 1) / data.Ts);\nend\n\n% compute the slope and offset for each gain for initial guesses\nkP1 = guess.plantOne(1:4)';\nkP2 = guess.plantTwo(1:4)';\ngainSlopeOffset = [t(2) * eye(4), eye(4); t(5) * eye(4), eye(4)] \\ [kP1; kP2];\nm = gainSlopeOffset(1:4);\nb = gainSlopeOffset(5:8);\n\nfor i = 1:length(sections)\n\n if strcmp(sections{i}, sections{1}) || strcmp(sections{i}, sections{end})\n display('boo')\n else\n if i > 1\n % use the best fit gains from the previous section\n guess.(sections{i}) = result.(sections{i - 1}).fit.par;\n else\n currentGuess = m .* (t(i) + t(i + 1)) / 2 + b;\n guess.(sections{i}) = [currentGuess', guess.plantOne(5:end)];\n end\n percent = ((t(i) + t(i + 1)) / 2 - t(2)) / (t(5) - t(2));\n plantNum.(sections{i}) = {plantNum.plantOne, plantNum.plantTwo, percent};\n end\n\n result.(sections{i}) = find_structural_gains(secData.(sections{i}), ...\n guess.(sections{i}), plantNum.(sections{i}), 'warning', false, ...\n 'randomGuess', true);\n\n [yh, vaf, x0] = compare(secData.(sections{i}), result.(sections{i}).fit);\n result.(sections{i}).vaf = vaf(1, 1, 1);\n display(sprintf('The self validation VAF is %f.', vaf(1, 1, 1)))\n\n p = plantNum.(sections{i});\n if size(plantNum.(sections{i}), 2) > 1\n result.(sections{i}).plant = plant(p{:});\n else\n result.(sections{i}).plant = plant(p);\n end\nend\n\nsave(['data/' filename '-results.mat'], 'sections', 'guess', 'plantNum', 'result')\n\nfor i = 1:length(sections)\n result.(sections{i}).fig = figure;\n compare(secData.(sections{i}), result.(sections{i}).fit);\n saveas(result.(sections{i}).fig, ['plots/' filename '-' sections{i} '.png'])\n [yh, fit, x0] = compare(secData.(sections{i}), result.(sections{i}).fit);\n display('-----------------')\n display('The task plant is:')\n display(result.(sections{i}).plant)\n display(sprintf('The order of the closed loop system is %u.', ...\n size(result.(sections{i}).mod.A, 1)))\n display(sprintf('The gain guesses: k1=%f, k2=%f, k3=%f, k4=%f', ...\n result.(sections{i}).mod.par(1:4)))\n display(sprintf('The identified gains: k1=%f+\\\\-%f, k2=%f+\\\\-%f, k3=%f+\\\\-%f, k4=%f+\\\\-%f', ...\n result.(sections{i}).fit.par(1), result.(sections{i}).uncert(1), ...\n result.(sections{i}).fit.par(2), result.(sections{i}).uncert(2), ...\n result.(sections{i}).fit.par(3), result.(sections{i}).uncert(3), ...\n result.(sections{i}).fit.par(4), result.(sections{i}).uncert(4)))\n display(sprintf('The self validation VAF is %f.', ...\n result.(sections{i}).vaf))\nend\n" }, { "path": "src/test/resources/samples/langs/Matlab/gpu_RKF45_FILE.m", "content": "tic\r\nclear\r\n%% Range definition\r\nn=200;\r\n\r\nmu=0.1;\r\n[xl1,yl1,xl2,yl2,xl3,yl3,xl4,yl4,xl5,yl5]=Lagr(mu);\r\nC_L1=2*Omega(xl1,yl1,mu);\r\nE_0=-C_L1/2+0.03715;\r\nY_0=0;\r\n\r\nnx=n;\r\nx_0_min=-0.8;\r\nx_0_max=-0.15;\r\nx_0=linspace(x_0_min, x_0_max, nx);\r\ndx=(x_0_max-x_0_min)/(nx-1);\r\n\r\nnvx=n;\r\nvx_0_min=-2;\r\nvx_0_max=2;\r\nvx_0=linspace(vx_0_min, vx_0_max, nvx);\r\ndvx=(vx_0_max-vx_0_min)/(nvx-1);\r\n\r\nny=3;\r\ndy=(dx+dvx)/2;\r\ny_0=[Y_0-dy Y_0 Y_0+dy];\r\n\r\n\r\n\r\nne=3;\r\nde=dy;\r\ne_0=[E_0-de E_0 E_0+de];\r\n\r\n%% Definition of arrays of initial conditions\r\n\r\n%In this approach, only useful pints are stored and integrated\r\n\r\nm=1;\r\n% x=zeros(1,nx*ny*nvx*ne);\r\n% y=zeros(1,nx*ny*nvx*ne);\r\n% vx=zeros(1,nx*ny*nvx*ne);\r\n% e=zeros(1,nx*ny*nvx*ne);\r\n% vy=zeros(1,nx*ny*nvx*ne);\r\nfilter=zeros(nx,3,nvx,3);\r\n\r\nfor i=1:nx\r\n\tfor j=1:ny\r\n\t\tfor k=1:nvx\r\n\t\t\tfor l=1:ne\r\n\t\t\t\tv_y=-sqrt(2*Omega(x_0(i),y_0(j),mu)+2*e_0(l)-vx_0(k)^2);\r\n\t\t\t\tif ~((j~=2) && (l~=2)) && isreal(v_y)\r\n\t\t\t\t\tx(m)=x_0(i);\r\n\t\t\t\t\ty(m)=y_0(j);\r\n\t\t\t\t\tvx(m)=vx_0(k);\r\n\t\t\t\t\te(m)=e_0(l);\r\n\t\t\t\t\tvy(m)=v_y;\r\n\t\t\t\t\tfilter(i,j,k,l)=1;\r\n\t\t\t\t\tm=m+1;\r\n\t\t\t\tend\r\n\t\t\tend\r\n\t\tend\r\n\tend\r\nend\r\n\r\n%% Selection of useful points\r\n\r\n%% Data transfer to GPU\r\nx_gpu=gpuArray(x);\r\ny_gpu=gpuArray(y);\r\nvx_gpu=gpuArray(vx);\r\nvy_gpu=gpuArray(vy);\r\n\r\n%% Integration on GPU\r\nN=1;\r\nt0=0;\r\n\r\n[x_f,y_f,vx_f,vy_f]=arrayfun(@RKF45_FILE_gpu,t0,N,x_gpu,y_gpu,vx_gpu,vy_gpu,mu);\r\n\r\n%% Data back to CPU and GPU memory cleaning\r\nclear x_gpu y_gpu vx_gpu vy_gpu\r\nx_T=gather(x_f);\r\nclear x_f\r\ny_T=gather(y_f);\r\nclear y_f\r\nvx_T=gather(vx_f);\r\nclear vx_f\r\nvy_T=gather(vy_f);\r\nclear vy_f\r\n\r\n%% Construction of matrix for FTLE computation\r\n\r\nX_T=zeros(nx,ny,nvx,ne);\r\nY_T=zeros(nx,ny,nvx,ne);\r\nVX_T=zeros(nx,ny,nvx,ne);\r\nVY_T=zeros(nx,ny,nvx,ne);\r\nE_T=zeros(nx,ny,nvx,ne);\r\nm=1;\r\nfor i=1:nx\r\n for j=1:ny\r\n for k=1:nvx\r\n for l=1:ne\r\n if filter(i,j,k,l)==1\r\n X_T(i,j,k,l)=x_T(m);\r\n Y_T(i,j,k,l)=y_T(m);\r\n VX_T(i,j,k,l)=vx_T(m);\r\n VY_T(i,j,k,l)=vy_T(m);\r\n E_T(i,j,k,l)=0.5*(VX_T(i,j,k,l)^2+VY_T(i,j,k,l)^2)-Omega(X_T(i,j,k,l),Y_T(i,j,k,l),mu);\r\n m=m+1;\r\n end\r\n end\r\n end\r\n end\r\nend\r\n\r\n%% Compute filter for FTLE\r\nfilter_ftle=filter;\r\nfor i=2:(nx-1)\r\n\tfor j=2:(ny-1)\r\n\t\tfor k=2:(nvx-1)\r\n\t\t\tfor l=2:(ne-1)\r\n\t\t\t\tif filter(i,j,k,l)==0 || filter (i,j,k,l)==3\r\n\t\t\t\t\tfilter_ftle(i,j,k,l)=0;\r\n\t\t\t\t\t\r\n\t\t\t\t\tfilter_ftle(i+1,j,k,l)=0;\r\n\t\t\t\t\tfilter_ftle(i-1,j,k,l)=0;\r\n\t\t\t\t\t\r\n\t\t\t\t\tfilter_ftle(i,j+1,k,l)=0;\r\n\t\t\t\t\tfilter_ftle(i,j-1,k,l)=0;\r\n\t\t\t\t\t\r\n\t\t\t\t\tfilter_ftle(i,j,k+1,l)=0;\r\n\t\t\t\t\tfilter_ftle(i,j,k-1,l)=0;\r\n\t\t\t\t\t\r\n\t\t\t\t\tfilter_ftle(i,j,k,l+1)=0;\r\n\t\t\t\t\tfilter_ftle(i,j,k,l-1)=0;\r\n\t\t\t\tend\r\n\t\t\tend\r\n\t\t\t\r\n\t\tend\r\n\tend\r\nend\r\n%% FTLE computation\r\n\r\n[ftle, dphi]=Compute_FILE_gpu( X_T, Y_T, VX_T, E_T, dx, dy, dvx, de, N, filter_ftle);\r\n\r\n%% Plot results\r\nfigure\r\nFTLE=squeeze(ftle(:,2,:,2));\r\nFTLE(1,:)=[];\r\n% FTLE(2,:)=[];\r\nFTLE(:,1)=[];\r\n% FTLE(:,2)=[];\r\nx_0(1)=[];\r\nvx_0(1)=[];\r\npcolor(x_0, vx_0, FTLE')\r\nshading flat\r\ntoc" }, { "path": "src/test/resources/samples/langs/Matlab/ieee.m", "content": "% This script loads in the data used for the IEEE paper and creates the plots.\nclc; close all;\n\nbikes = {'Benchmark', 'Browserins', 'Browser', 'Pista', ...\n 'Fisher', 'Yellow', 'Yellowrev'};\n\ndata = load_bikes(bikes, 'Steer');\n\nrollData = generate_data('Benchmark', 5.0, ...\n 'input', 'Roll', ...\n 'gains', [1, 55, 3.76, 0.413, 0.076]);\n\ncreate_ieee_paper_plots(data, rollData)\n" }, { "path": "src/test/resources/samples/langs/Matlab/lane_change.m", "content": "function [x, y, t] = lane_change(start, width, slope, pathLength, speed, num, ...\n type, varargin)\n% Generates the time and coordinates for either a single or double lane change\n% manuever at a particular speed.\n%\n% Parameters\n% ----------\n% start : float\n% The starting point along the x axis in meters.\n% width : float\n% The width of the lane deviation.\n% slope : float\n% The slope of the lane change.\n% pathLength : float\n% The length of path.\n% speed : float\n% Speed of travel.\n% num : integer\n% Number of time steps.\n% type : string\n% Either 'single' or 'double'. A double lane change return to x = 0.\n% laneLength : float, optional\n% Length of the lane for a double lane change.\n%\n% Returns\n% -------\n% x : matrix, (num, 1)\n% The longitudinal path.\n% y : matrix, (num, 1)\n% The lateral path.\n% t : matrix, (num, 1)\n% Time.\n\nx = 0:pathLength / num:pathLength;\nx = x';\nt = x / speed;\n\ny = zeros(length(x), 1);\nendOfSlope = width / slope + start;\nslopeInd = find((x > start) & (x <= endOfSlope));\ny(slopeInd) = slope * (x(slopeInd) - start);\nif strcmp(type, 'single')\n theRest = slopeInd(end) + 1:length(y);\n y(theRest) = width * ones(length(theRest), 1);\nelseif strcmp(type, 'double');\n if length(varargin) < 1\n error('Double lane change needs length of lane.')\n else\n laneLength = varargin{1};\n startOfSlope = start + laneLength - width / slope;\n lane = find((x > endOfSlope) & (x <= startOfSlope));\n y(lane) = width * ones(length(lane), 1);\n downSlope = find((x > startOfSlope) & (x <= start + laneLength));\n y(downSlope) = slope * (start + laneLength - x(downSlope));\n end\nend\n" }, { "path": "src/test/resources/samples/langs/Matlab/load_bikes.m", "content": "function data = load_bikes(bikes, input)\n% function data = load_bikes(bikes, input)\n% Returns the data for a set of bicycles at three speeds.\n%\n% Parameters\n% ----------\n% bikes : cell array\n% A cell array that lists the bicyle short names.\n% input : string\n% 'Steer' or 'Roll'\n%\n% Returns\n% -------\n% data : structure\n% A structure containg a node for each bicycle and each speed.\n\nspeeds = [2.5, 5.0, 7.5];\nspeedNames = {'Slow', 'Medium', 'Fast'};\n\n% these are the gains that were selected manually by Ron Hess, taken from\n% the paper\ngains.Benchmark.Slow = [22.0, -0.090, 23.3, 0.058, 0.195]; % place holder\ngains.Browserins.Slow = [22.0, -0.090, 23.3, 0.058, 0.195];\ngains.Browser.Slow = [20.5, -0.086, 24.1, 0.053, 0.199];\n% the gains in the paper give an unstable bike, the uncommented one were the ones from his\n% simulink model\ngains.Pista.Slow = [22.3000,-0.1300,15.6410,0.0645,0.1990]; %[22.3, -0.130, 15.6, 0.662, 0.198];\ngains.Fisher.Slow = [23.0, -0.120, 17.7, 0.065, 0.198];\ngains.Yellow.Slow = [18.0, -0.110, 20.2, 0.062, 0.200];\ngains.Yellowrev.Slow = [48.0, -0.070, 27.9, 0.063, 0.191];\n\ngains.Benchmark.Medium = [ 46.5, -0.052, 12.8, 0.177, 0.097];\ngains.Browserins.Medium = [ 48.0, -0.080, 9.03, 0.161, 0.097];\ngains.Browser.Medium = [ 43.0, -0.087, 8.50, 0.173, 0.100];\ngains.Pista.Medium = [ 49.0, -0.080, 8.06, 0.170, 0.101];\ngains.Fisher.Medium = [ 50.5, -0.084, 8.26, 0.168, 0.100];\ngains.Yellow.Medium = [ 39.0, -0.085, 8.61, 0.160, 0.101];\ngains.Yellowrev.Medium = [105.0, -0.070, 8.90, 0.165, 0.100];\n\ngains.Benchmark.Fast = [ 74.0, -0.063, 6.31, 0.332, 0.065]; % place holder\ngains.Browserins.Fast = [ 74.0, -0.063, 6.31, 0.332, 0.065];\ngains.Browser.Fast = [ 68.0, -0.060, 6.74, 0.330, 0.065];\ngains.Pista.Fast = [ 80.0, -0.058, 5.82, 0.321, 0.066];\ngains.Fisher.Fast = [ 82.0, -0.062, 5.83, 0.315, 0.065];\ngains.Yellow.Fast = [ 61.0, -0.063, 6.34, 0.345, 0.065];\ngains.Yellowrev.Fast = [170.0, -0.050, 6.45, 0.300, 0.066];\n\n% load the data for all speeds for all the bikes\nfor i = 1:length(bikes)\n for j = 1:length(speeds)\n data.(bikes{i}).(speedNames{j}) = ...\n generate_data(bikes{i}, speeds(j), 'input', input, ...\n 'gains', gains.(bikes{i}).(speedNames{j}));\n end\nend\n" }, { "path": "src/test/resources/samples/langs/Matlab/load_data.m", "content": "function data = load_data(filename, varargin)\n% function data = load_data(filename, varargin)\n%\n% Returns an iddata object with the input thetac and output theta for the\n% given file.\n%\n% Parameters\n% ----------\n% filename : char\n% Filename for the data file.\n% varargin : char value pairs, optional\n% sampleTime : double, default=0.0005\n% detread : boolean, default=true\n% directory : char, default='data'\n\nparser = inputParser;\nparser.addRequired('filename');\nparser.addParamValue('sampleTime', 0.0005);\nparser.addParamValue('detrend', true);\nparser.addParamValue('directory', 'data');\nparser.parse(filename, varargin{:});\nargs = parser.Results;\n\nraw = load([args.directory filesep filename]);\n\ndata = iddata(raw.theta, raw.theta_c, args.sampleTime, ...\n 'InterSample', 'foh', ...\n 'InputName', {'thetac'}, ...\n 'OutputName', {'theta'});\n\nif args.detrend\n data = detrend(data);\nend\n" }, { "path": "src/test/resources/samples/langs/Matlab/make_filter.m", "content": "function [filtfcn, statefcn] = makeFilter(b, a)\n% FILTFCN = MAKEFILTER(B, A) creates an IIR filtering\n% function and returns it in the form of a function handle,\n% FILTFCN. Each time you call FILTFCN with a new filter \n% input value, it computes the corresponding new filter \n% output value, updating its internal state vector at the\n% same time.\n%\n% [FILTFCN, STATEFCN] = MAKEFILTER(B, A) also returns a \n% function (in the form of a function handle, STATEFCN) \n% that can return the filter's internal state. The internal\n% state vector is in the form of a transposed direct form \n% II delay line.\n\n% Initialize state vector. To keep this example a bit \n% simpler, assume that a and b have the same length. \n% Also assume that a(1) is 1.\n\nv = zeros(size(a));\n\nfiltfcn = @iirFilter;\nstatefcn = @getState;\n\n function yn = iirFilter(xn)\n % Update the state vector\n v(1) = v(2) + b(1) * xn;\n v(2:end-1) = v(3:end) + b(2:end-1) * xn - ...\n a(2:end-1) * v(1);\n v(end) = b(end) * xn - a(end) * v(1);\n \n % Output is the first element of the state vector.\n yn = v(1);\n end\n\n function vOut = getState\n vOut = v;\n end\nend\n" }, { "path": "src/test/resources/samples/langs/Matlab/matlab_class.m", "content": "classdef matlab_class\n properties\n R;\n G;\n B;\n end\n methods\n function obj = matlab_class(r,g,b)\n obj.R = r;\n obj.G = g;\n obj.B = b;\n end\n function disp(obj)\n disp(['Red: ' num2str(obj.R) ...\n ', Green: ' num2str(obj.G) ...\n ', Blue: ' num2str(obj.B)]);\n end\n end\n enumeration\n red (1,0,0)\n green (0,1,0)\n blue (0,0,1)\n cyan (0,1,1)\n magenta (1,0,1)\n yellow (1,1,0)\n black (0,0,0)\n white (1,1,1)\n end\nend" }, { "path": "src/test/resources/samples/langs/Matlab/matlab_function.m", "content": "function ret = matlab_function(A,B)\n% Simple function adding two values and displaying the return value\n\nret = A+B;\n% Display the return value\ndisp('Return value in function');\ndisp(ret);\n\n\n" }, { "path": "src/test/resources/samples/langs/Matlab/matlab_script.m", "content": "% Matlab example script\n\n%Call matlab_function function which resides in the same directory\n\nvalue1 = 5 % semicolon at end of line is not mandatory, only suppresses output to command line.\nvalue2 = 3\n\n% Calculate sum of value1 and value2\nresult = matlab_function(value1,value2);\n\ndisp('called from script')\ndisp(result);\n" }, { "path": "src/test/resources/samples/langs/Matlab/matlab_script2.m", "content": " % Matlab example script 2\n % Comments precended with arbitrary whitespace (spaces or tabs)\n\n %Call matlab_function function which resides in the same directory\n\nvalue1 = 5 % semicolon at end of line is not mandatory, only suppresses output to command line.\nvalue2 = 3\n\n % Calculate sum of value1 and value2\nresult = matlab_function(value1,value2);\n\ndisp('called from script')\ndisp(result);" }, { "path": "src/test/resources/samples/langs/Matlab/normalize.m", "content": "function [ d, d_mean, d_std ] = normalize( d )\n d_mean = mean(d);\n d = d - repmat(d_mean, size(d,1), 1);\n d_std = std(d);\n d = d./ repmat(d_std, size(d,1), 1);\nend\n" }, { "path": "src/test/resources/samples/langs/Matlab/overwrite_settings.m", "content": "function settings = overwrite_settings(defaultSettings, overrideSettings)\n% function settings = overwrite_settings(defaultSettings, overrideSettings)\n% Returns the settings based on a combination of the defaults and the override settings.\n%\n% Parameters\n% ----------\n% defaultSettings : structure\n% A structure with all of the default settings.\n% overrideSettings : structure\n% Contains any settings that should override the defaults.\n%\n% Returns\n% -------\n% settings : structure\n% A stucture containing the overrideSettings and any defaults that weren't\n% supplied in the overrideSettings.\n\n% add the default options if not specified by the user\noverrideNames = fieldnames(overrideSettings);\ndefaultNames = fieldnames(defaultSettings);\nnotGiven = setxor(overrideNames, defaultNames);\nsettings = overrideSettings;\nif length(notGiven) > 0\n for i = 1:length(notGiven)\n settings.(notGiven{i}) = defaultSettings.(notGiven{i});\n end\nend\n" }, { "path": "src/test/resources/samples/langs/Matlab/par_text_to_struct.m", "content": "function par = par_text_to_struct(pathToFile)\n% function par = par_text_to_struct(pathToFile)\n% Returns a structure of the parameters that were stored in a csv text file.\n%\n% Parameters\n% ----------\n% pathToFile : string\n% Path to a text file containing the benchmark parameters for a single\n% bicycle. The parameters should be on seperate lines and take this form:\n%\n% c = 0.08+/-0.01\n% lam = 0.31\n%\n% Returns\n% -------\n% par : structure\n% A structure containing the bicycle parameters.\n\nfid = fopen(pathToFile);\ndata = textscan(fid, '%s %s', 'delimiter', '=');\nfclose(fid);\nnames = strtrim(data{1});\nvals = strtrim(regexp(data{2}, '+/-', 'split'));\nfor i = 1:length(names)\n v = vals{i};\n par.(names{i}) = str2num(v{1});\nend\n" }, { "path": "src/test/resources/samples/langs/Matlab/plant.m", "content": "function Yc = plant(varargin)\n% function Yc = plant(varargin)\n%\n% Returns the system plant given a number.\n%\n% Parameters\n% ----------\n% varargin : variable\n% Either supply a single argument {num} or three arguments {num1, num2,\n% ratio}. If a single argument is supplied, then one of the six transfer\n% functions will be chosen from the list. If three arguments are chosen, a\n% parallel sum of the two plants will be returned.\n%\n% Option 1\n% --------\n% num : integer, {1, 2, 3, 4, 5, 6}\n% A number between 1 and 6 corresponding to the five plants.\n% Option 2\n% --------\n% num1 : integer, {1, 2, 3, 4, 5, 6}\n% A number between 1 and 6 corresponding to the five plants.\n% num2 : integer, {1, 2, 3, 4, 5, 6}\n% A number between 1 and 6 corresponding to the five plants.\n% percent : double\n% The percentage multiplier of the first plant. Should be between 0\n% and 1. The percentage multiplier of the second plant will be 1 -\n% percent.\n%\n% Returns\n% -------\n% Either a single plant or a parallel sum of scaled plants.\n%\n% Option 1\n% --------\n% Yc : transfer function\n% 1 : 1 / s\n% 2 : 1 / s(s + 1)\n% 3 : 1 / s(s + 0.2)\n% 4 : 10 / (s + 10)\n% 5 : 5 / (s + 10)\n% 6 : 10 / (s^2 +.2 * s)\n%\n% Option 2\n% --------\n% Yc : transfer function\n% Yc = percent * Yc1 + (1 - percent) * Yc2, where Yc1 and Yc2 are plants\n% from the list shown in Option 1.\n\nif size(varargin, 2) > 1\n if 0 <= varargin{3} & varargin{3} <= 1\n Yc = parallel(varargin{3} * choose_plant(varargin{1}), ...\n (1 - varargin{3}) * choose_plant(varargin{2}));\n else\n error('Ratio must be between 0 and 1.')\n end\nelse\n Yc = choose_plant(varargin{1});\nend\n\nfunction p = choose_plant(num)\nif num == 1;\n p = tf(1.0, [1.0, 0.0]);\nelseif num == 2;\n p = tf(1.0, [1.0, 1.0, 0.0]);\nelseif num == 3;\n p = tf(1.0, [1.0, 0.2, 0.0]);\nelseif num == 4;\n p = tf(10.0, [1.0, 10.0]);\nelseif num == 5;\n p = tf(5.0, [1.0, 10.0]);\nelseif num == 6;\n p = tf(10.0, [1.0, 0.2, 0.0]);\nelse\n display('Invalid plant number.')\nend\n" }, { "path": "src/test/resources/samples/langs/Matlab/test_rk_par.m", "content": "clear\nmu=0.1;\nx_0=linspace(-0.8, -0.15, 2)\ny_0=zeros(1,2)\nvx_0=linspace(-2, 2, 2)\nvy_0=zeros(1,2)\nci=[1-mu-0.05 0 0.005 0.5290]\nt0=[0;0]\nT=[2;2]\ntspan=2\narg1={@f;@f}\n%tspan={[0 2],[0 2]};\narg=[mu;mu]\n[X]=arrayfun(RK4_par,t0,T,x_0',y_0',vx_0',vy_0',arg)\n% [X]=arrayfun(@f,[0;1],[ci;ci],[mu;mu]);\n%Y=RK4(@f,tspan,ci,mu);\n% figure\n% plot(Y(:,1),Y(:,2))\n% Y(end,1)" }, { "path": "src/test/resources/samples/langs/Matlab/test_system_state_space.m", "content": "gains = [76.3808, -0.0516, 7.2456, 0.2632, 0.0708];\nwnm = 30;\nzetanm = 0.707;\n\ndata = generate_data('Rigid', 7.0, 'gains', gains, 'neuroFreq', wnm, ...\n 'loopTransfer', 0, 'handlingQuality', 0, 'simulate', 0);\n\nbicycle = ss(data.modelPar.A, data.modelPar.B, data.modelPar.C, ...\n data.modelPar.D);\n\nbicycle.StateName = {'xP', 'yP', 'psi', 'phi', 'thetaB', 'thetaR', 'delta', ...\n 'thetaF', 'phiDot', 'thetaRDot', 'deltaDot'};\nbicycle.OutputName = {'xP', 'yP', 'psi', 'phi', 'thetaB', 'thetaR', 'delta', ...\n 'thetaF', 'xPDot', 'yPDot', 'psiDot', 'phiDot', ...\n 'thetaBDot', 'thetaRDot', 'deltaDot', 'thetaFDot', 'xQ', 'yQ'};\nbicycle.InputName = {'tPhi', 'tDelta', 'fB'};\n\ninputs = {'fB'};\noutputs = [bicycle.OutputName; 'tDelta'];\n\nanalytic = system_state_space('lateral', bicycle, gains, [wnm, zetanm], inputs, outputs);\n\nnumeric = ss(data.system.A, data.system.B, data.system.C, data.system.D);\n%numeric.StateName = data.bicycle.states;\n%numeric.InputName = data.bicycle.inputs;\n%numeric.OutputName = data.bicycle.outputs;\n\nfigure()\npzplot(analytic, numeric)\n\n% plot the transfer function roll-rate/lateral force for both\nfigure()\nhold all\n% plot my analytic model\n[num, den] = ss2tf(analytic.A, analytic.B, analytic.C, analytic.D, 1);\nmine = tf(num(find(strcmp('phiDot', outputs)), :), den);\nbode(tf(num(find(strcmp('phiDot', outputs)), :), den))\n% plot the data from the simulink model\nbode(tf(data.forceTF.PhiDot.num, data.forceTF.PhiDot.den))\n[num, den] = ss2tf(numeric.A, numeric.B, numeric.C, numeric.D, 1);\nbode(tf(num(12, :), den))\n\ndisplay('Analytic Eigenvalues')\neig(analytic.A)\ndisplay('Numeric Eigenvalues')\neig(numeric.A)\n\n% Now see if the heading tracking works.\ngains = [76.3808, -0.0516, 7.2456, 0.2632];\nwnm = 30;\nzetanm = 0.707;\n\npar = par_text_to_struct('parameters/RigidPar.txt');\n[A, B, C, D] = whipple_pull_force_ABCD(par, 7.0);\nbicycle = ss(A([3, 4, 7, 9, 11], [3, 4, 7, 9, 11]), ...\n B([3. 4, 7, 9, 11], [2, 3]), eye(5), 0);\nbicycle.StateName = {'psi', 'phi', 'delta', 'phiDot', 'deltaDot'};\nbicycle.OutputName = {'psi', 'phi', 'delta', 'phiDot', 'deltaDot'};\nbicycle.InputName = {'tDelta', 'fB'};\n\ninputs = {'fB'};\noutputs = [bicycle.OutputName; 'tDelta'];\n\nanalytic = system_state_space('heading', bicycle, gains, [wnm, zetanm], inputs, outputs);\n% the following two should be the same\nanalytic.A(end, :)\nbottomRow = [-wnm^2 * prod(gains), -wnm^2 * prod(gains(1:3)), ...\n -wnm^2 * gains(1), -wnm^2 * prod(gains(1:2)), 0, -wnm^2, ...\n -2 * wnm * zetanm]\n" }, { "path": "src/test/resources/samples/langs/Matlab/varargin_to_structure.m", "content": "function options = varargin_to_structure(arguments)\n% function options = varargin_to_structure(arguments)\n% Returns a structure from a cell array of pairs.\n%\n% Parameters\n% ----------\n% arguments : cell array (1, n)\n% A cell array where n is an even number greater than or equal to 2. The odd\n% cells must be a character string and the even cells can be any data type.\n%\n% Returns\n% -------\n% options : structure\n% The fields of the structure correspond to the odd cells in the array and\n% the value for that field corresponds to the even cells.\n%\n% This is useful for functions that have varargin as an input where the\n% variable inputs are keyword pairs.\n\n% make sure there are enough arguments\nif length(arguments) <= 1\n error('Please supply 2 or more arguments')\nend\n\n% make sure they provided and even number of inputs\nif mod(length(arguments), 2) ~= 0\n error('There must be an even numbers of arguments')\nend\n\n% store the values in the structure\nfor i = 1:2:length(arguments)\n % make sure they have character strings as all the odd cells\n if ~ischar(arguments{i})\n error('The odd arguments must be character strings.')\n end\n options.(arguments{i}) = arguments{i + 1};\nend\n" }, { "path": "src/test/resources/samples/langs/Matlab/write_gains.m", "content": "function write_gains(pathToFile, speeds, gains)\n% function write_gains(pathToFile, speeds, gains)\n%\n% Adds the provided gains to the file.\n%\n% Parameters\n% ----------\n% pathToFile : string\n% The path to a gain file.\n% speeds : matrix(n, 1)\n% gains : matrix (n, 5)\n% A matrix of gains where each row corresponds to a speed and the columns\n% correspond to the loops starting at the innermost loop.\n\ncontents = importdata(pathToFile);\n\nspeedsInFile = contents.data(:, 1);\ngainsInFile = contents.data(:, 2:end);\n\n% remove any speeds that are very close to the speeds provided\nsameSpeedIndices = [];\nfor i = 1:length(speedsInFile)\n for j = 1:length(speeds)\n if abs(speedsInFile(i) - speeds(j)) < 1e-3\n sameSpeedIndices = [sameSpeedIndices i];\n end\n end\nend\nspeedsInFile(sameSpeedIndices) = [];\ngainsInFile(sameSpeedIndices, :) = [];\n\n% concatenate data\nallGains = [gainsInFile; gains];\nallSpeeds = [speedsInFile; speeds];\n\n% sort the data\n[allSpeeds, order] = sort(allSpeeds);\nallGains = allGains(order, :);\n\n% recombine\nall = [allSpeeds, allGains];\n\n% rewrite the file\nfid = fopen(pathToFile, 'w');\nh = contents.colheaders;\nfprintf(fid, '%s,%s,%s,%s,%s,%s\\n', h{1}, h{2}, h{3}, h{4}, h{5}, h{6});\nfprintf(fid, '%1.3f,%1.4f,%1.4f,%1.4f,%1.4f,%1.4f\\n', all');\nfclose(fid);\n" }, { "path": "src/test/resources/samples/langs/Maven POM/filenames/pom.xml", "content": "\n\n\t4.0.0\n\trenpengben\n\tspring4mvc-jpa\n\twar\n\t0.0.1-SNAPSHOT\n\tspring4mvc-jpa Maven Webapp\n\n\thttps://renpengben.github.io\n\n\tspring4mvc-jpa\n\n\t\n\t\tUTF-8\n\t\t1.7\n\t\t4.11\n\t\t1.7.7\n\t\t1.2.17\n\n\t\t4.0.5.RELEASE\n\t\t1.6.0.RELEASE\n\t\t2.1_3\n\n\t\t5.1.31\n\t\t4.3.5.Final\n\t\t5.1.1.Final\n\t\t1.0.6\n\n\t\n\n\n\t\n\n\t\t\n\t\t\tjunit\n\t\t\tjunit\n\t\t\t${junit.version}\n\t\t\ttest\n\t\t\n\n\t\t\n\t\t\torg.slf4j\n\t\t\tslf4j-api\n\t\t\t${slf4j.version}\n\t\t\n\t\t\n\t\t\torg.slf4j\n\t\t\tslf4j-log4j12\n\t\t\t${slf4j.version}\n\t\t\n\t\t\n\t\t\tlog4j\n\t\t\tlog4j\n\t\t\t${log4j.version}\n\t\t\n\n\n\t\t\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-core\n\t\t\t${spring.version}\n\t\t\t\n\t\t\t\t\n\t\t\t\t\tcommons-logging\n\t\t\t\t\tcommons-logging\n\t\t\t\t\n\t\t\t\n\t\t\n\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-beans\n\t\t\t${spring.version}\n\t\t\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-context\n\t\t\t${spring.version}\n\t\t\n\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-aop\n\t\t\t${spring.version}\n\t\t\n\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-expression\n\t\t\t${spring.version}\n\t\t\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-tx\n\t\t\t${spring.version}\n\t\t\n\n\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-aspects\n\t\t\t${spring.version}\n\t\t\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-context-support\n\t\t\t${spring.version}\n\t\t\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-jdbc\n\t\t\t${spring.version}\n\t\t\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-orm\n\t\t\t${spring.version}\n\t\t\n\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-web\n\t\t\t${spring.version}\n\t\t\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-webmvc\n\t\t\t${spring.version}\n\t\t\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-test\n\t\t\t${spring.version}\n\t\t\ttest\n\t\t\n\n\t\t\n\t\t\torg.springframework.data\n\t\t\tspring-data-jpa\n\t\t\t${spring.data.jpa.version}\n\t\t\t\n\t\t\t\t\n\t\t\t\t\tjunit-dep\n\t\t\t\t\tjunit\n\t\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\tcglib\n\t\t\tcglib-nodep\n\t\t\t${cglib.version}\n\t\t\n\n\n\n\t\t\n\n\t\t\n\t\t\torg.hibernate\n\t\t\thibernate-core\n\t\t\t${hibernate.version}\n\t\t\n\t\t\n\t\t\torg.hibernate\n\t\t\thibernate-entitymanager\n\t\t\t${hibernate.version}\n\t\t\n\t\t\n\t\t\torg.hibernate\n\t\t\thibernate-validator\n\t\t\t${hibernate-validator.version}\n\t\t\tcompile\n\n\t\t\n\n\n\t\t\n\t\t\tmysql\n\t\t\tmysql-connector-java\n\t\t\t${mysql.version}\n\t\t\truntime\n\t\t\n\t\t\n\t\t\tcom.alibaba\n\t\t\tdruid\n\t\t\t${druid-version}\n\t\t\n\n\n\t\n\t\n\t\t\n\t\t\t\n\t\t\t\torg.apache.maven.plugins\n\t\t\t\tmaven-compiler-plugin\n\t\t\t\t2.0.2\n\t\t\t\t\n\t\t\t\t\t1.7\n\t\t\t\t\t1.7\n\t\t\t\t\n\t\t\t\n\t\t\n\t\n\n" }, { "path": "src/test/resources/samples/langs/Max/Hello.maxhelp", "content": "{\n\t\"patcher\" : \t{\n\t\t\"fileversion\" : 1,\n\t\t\"appversion\" : \t\t{\n\t\t\t\"major\" : 5,\n\t\t\t\"minor\" : 1,\n\t\t\t\"revision\" : 9\n\t\t}\n,\n\t\t\"rect\" : [ 198.0, 92.0, 365.0, 407.0 ],\n\t\t\"bglocked\" : 0,\n\t\t\"defrect\" : [ 198.0, 92.0, 365.0, 407.0 ],\n\t\t\"openrect\" : [ 0.0, 0.0, 0.0, 0.0 ],\n\t\t\"openinpresentation\" : 0,\n\t\t\"default_fontsize\" : 14.0,\n\t\t\"default_fontface\" : 0,\n\t\t\"default_fontname\" : \"Arial\",\n\t\t\"gridonopen\" : 0,\n\t\t\"gridsize\" : [ 20.0, 20.0 ],\n\t\t\"gridsnaponopen\" : 0,\n\t\t\"toolbarvisible\" : 1,\n\t\t\"boxanimatetime\" : 200,\n\t\t\"imprint\" : 0,\n\t\t\"enablehscroll\" : 1,\n\t\t\"enablevscroll\" : 1,\n\t\t\"devicewidth\" : 0.0,\n\t\t\"boxes\" : [ \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"button\",\n\t\t\t\t\t\"patching_rect\" : [ 260.0, 260.0, 20.0, 20.0 ],\n\t\t\t\t\t\"numinlets\" : 1,\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"bang\" ],\n\t\t\t\t\t\"id\" : \"obj-22\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"button\",\n\t\t\t\t\t\"patching_rect\" : [ 240.0, 260.0, 20.0, 20.0 ],\n\t\t\t\t\t\"numinlets\" : 1,\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"bang\" ],\n\t\t\t\t\t\"id\" : \"obj-20\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"button\",\n\t\t\t\t\t\"patching_rect\" : [ 220.0, 260.0, 20.0, 20.0 ],\n\t\t\t\t\t\"numinlets\" : 1,\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"bang\" ],\n\t\t\t\t\t\"id\" : \"obj-18\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"button\",\n\t\t\t\t\t\"patching_rect\" : [ 200.0, 260.0, 20.0, 20.0 ],\n\t\t\t\t\t\"numinlets\" : 1,\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"bang\" ],\n\t\t\t\t\t\"id\" : \"obj-16\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"newobj\",\n\t\t\t\t\t\"text\" : \"route 0 1 2 3\",\n\t\t\t\t\t\"patching_rect\" : [ 200.0, 220.0, 99.0, 23.0 ],\n\t\t\t\t\t\"numinlets\" : 1,\n\t\t\t\t\t\"fontname\" : \"Arial\",\n\t\t\t\t\t\"numoutlets\" : 5,\n\t\t\t\t\t\"outlettype\" : [ \"\", \"\", \"\", \"\", \"\" ],\n\t\t\t\t\t\"fontsize\" : 14.0,\n\t\t\t\t\t\"id\" : \"obj-14\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"newobj\",\n\t\t\t\t\t\"text\" : \"r jojo\",\n\t\t\t\t\t\"patching_rect\" : [ 200.0, 180.0, 41.0, 23.0 ],\n\t\t\t\t\t\"numinlets\" : 0,\n\t\t\t\t\t\"fontname\" : \"Arial\",\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"\" ],\n\t\t\t\t\t\"fontsize\" : 14.0,\n\t\t\t\t\t\"color\" : [ 0.827451, 0.737255, 0.835294, 1.0 ],\n\t\t\t\t\t\"id\" : \"obj-13\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"newobj\",\n\t\t\t\t\t\"text\" : \"s jojo\",\n\t\t\t\t\t\"patching_rect\" : [ 20.0, 340.0, 43.0, 23.0 ],\n\t\t\t\t\t\"numinlets\" : 1,\n\t\t\t\t\t\"fontname\" : \"Arial\",\n\t\t\t\t\t\"numoutlets\" : 0,\n\t\t\t\t\t\"fontsize\" : 14.0,\n\t\t\t\t\t\"color\" : [ 0.827451, 0.737255, 0.835294, 1.0 ],\n\t\t\t\t\t\"id\" : \"obj-12\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"newobj\",\n\t\t\t\t\t\"text\" : \"append toto\",\n\t\t\t\t\t\"patching_rect\" : [ 20.0, 300.0, 84.0, 23.0 ],\n\t\t\t\t\t\"numinlets\" : 1,\n\t\t\t\t\t\"fontname\" : \"Arial\",\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"\" ],\n\t\t\t\t\t\"fontsize\" : 14.0,\n\t\t\t\t\t\"id\" : \"obj-11\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"newobj\",\n\t\t\t\t\t\"text\" : \"% 4\",\n\t\t\t\t\t\"patching_rect\" : [ 20.0, 260.0, 35.0, 23.0 ],\n\t\t\t\t\t\"numinlets\" : 2,\n\t\t\t\t\t\"fontname\" : \"Arial\",\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"int\" ],\n\t\t\t\t\t\"fontsize\" : 14.0,\n\t\t\t\t\t\"id\" : \"obj-10\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"newobj\",\n\t\t\t\t\t\"text\" : \"counter\",\n\t\t\t\t\t\"patching_rect\" : [ 20.0, 220.0, 73.0, 23.0 ],\n\t\t\t\t\t\"numinlets\" : 5,\n\t\t\t\t\t\"fontname\" : \"Arial\",\n\t\t\t\t\t\"numoutlets\" : 4,\n\t\t\t\t\t\"outlettype\" : [ \"int\", \"\", \"\", \"int\" ],\n\t\t\t\t\t\"fontsize\" : 14.0,\n\t\t\t\t\t\"id\" : \"obj-9\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"newobj\",\n\t\t\t\t\t\"text\" : \"metro 250\",\n\t\t\t\t\t\"patching_rect\" : [ 20.0, 180.0, 74.0, 23.0 ],\n\t\t\t\t\t\"numinlets\" : 2,\n\t\t\t\t\t\"fontname\" : \"Arial\",\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"bang\" ],\n\t\t\t\t\t\"fontsize\" : 14.0,\n\t\t\t\t\t\"id\" : \"obj-8\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"toggle\",\n\t\t\t\t\t\"patching_rect\" : [ 20.0, 140.0, 20.0, 20.0 ],\n\t\t\t\t\t\"numinlets\" : 1,\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"int\" ],\n\t\t\t\t\t\"id\" : \"obj-7\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"newobj\",\n\t\t\t\t\t\"text\" : \"t 0\",\n\t\t\t\t\t\"patching_rect\" : [ 140.0, 80.0, 26.0, 23.0 ],\n\t\t\t\t\t\"numinlets\" : 1,\n\t\t\t\t\t\"fontname\" : \"Arial\",\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"int\" ],\n\t\t\t\t\t\"fontsize\" : 14.0,\n\t\t\t\t\t\"id\" : \"obj-5\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"newobj\",\n\t\t\t\t\t\"text\" : \"t 1\",\n\t\t\t\t\t\"patching_rect\" : [ 20.0, 80.0, 26.0, 23.0 ],\n\t\t\t\t\t\"numinlets\" : 1,\n\t\t\t\t\t\"fontname\" : \"Arial\",\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"int\" ],\n\t\t\t\t\t\"fontsize\" : 14.0,\n\t\t\t\t\t\"id\" : \"obj-4\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"message\",\n\t\t\t\t\t\"text\" : \"Goodbye World !\",\n\t\t\t\t\t\"patching_rect\" : [ 140.0, 40.0, 115.0, 21.0 ],\n\t\t\t\t\t\"numinlets\" : 2,\n\t\t\t\t\t\"fontname\" : \"Arial\",\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"\" ],\n\t\t\t\t\t\"fontsize\" : 14.0,\n\t\t\t\t\t\"id\" : \"obj-3\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"message\",\n\t\t\t\t\t\"text\" : \"Hello World !\",\n\t\t\t\t\t\"patching_rect\" : [ 20.0, 40.0, 90.0, 21.0 ],\n\t\t\t\t\t\"numinlets\" : 2,\n\t\t\t\t\t\"fontname\" : \"Arial\",\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"\" ],\n\t\t\t\t\t\"fontsize\" : 14.0,\n\t\t\t\t\t\"id\" : \"obj-2\"\n\t\t\t\t}\n\n\t\t\t}\n ],\n\t\t\"lines\" : [ \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-2\", 0 ],\n\t\t\t\t\t\"destination\" : [ \"obj-4\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-3\", 0 ],\n\t\t\t\t\t\"destination\" : [ \"obj-5\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-4\", 0 ],\n\t\t\t\t\t\"destination\" : [ \"obj-7\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-5\", 0 ],\n\t\t\t\t\t\"destination\" : [ \"obj-7\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ 149.5, 121.0, 29.5, 121.0 ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-7\", 0 ],\n\t\t\t\t\t\"destination\" : [ \"obj-8\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-8\", 0 ],\n\t\t\t\t\t\"destination\" : [ \"obj-9\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-9\", 0 ],\n\t\t\t\t\t\"destination\" : [ \"obj-10\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-10\", 0 ],\n\t\t\t\t\t\"destination\" : [ \"obj-11\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-11\", 0 ],\n\t\t\t\t\t\"destination\" : [ \"obj-12\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-13\", 0 ],\n\t\t\t\t\t\"destination\" : [ \"obj-14\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-14\", 0 ],\n\t\t\t\t\t\"destination\" : [ \"obj-16\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-14\", 1 ],\n\t\t\t\t\t\"destination\" : [ \"obj-18\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-14\", 2 ],\n\t\t\t\t\t\"destination\" : [ \"obj-20\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-14\", 3 ],\n\t\t\t\t\t\"destination\" : [ \"obj-22\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n ]\n\t}\n\n}\n" }, { "path": "src/test/resources/samples/langs/Max/Hello.maxpat", "content": "{\n\t\"patcher\" : \t{\n\t\t\"fileversion\" : 1,\n\t\t\"appversion\" : \t\t{\n\t\t\t\"major\" : 5,\n\t\t\t\"minor\" : 1,\n\t\t\t\"revision\" : 9\n\t\t}\n,\n\t\t\"rect\" : [ 198.0, 92.0, 365.0, 407.0 ],\n\t\t\"bglocked\" : 0,\n\t\t\"defrect\" : [ 198.0, 92.0, 365.0, 407.0 ],\n\t\t\"openrect\" : [ 0.0, 0.0, 0.0, 0.0 ],\n\t\t\"openinpresentation\" : 0,\n\t\t\"default_fontsize\" : 14.0,\n\t\t\"default_fontface\" : 0,\n\t\t\"default_fontname\" : \"Arial\",\n\t\t\"gridonopen\" : 0,\n\t\t\"gridsize\" : [ 20.0, 20.0 ],\n\t\t\"gridsnaponopen\" : 0,\n\t\t\"toolbarvisible\" : 1,\n\t\t\"boxanimatetime\" : 200,\n\t\t\"imprint\" : 0,\n\t\t\"enablehscroll\" : 1,\n\t\t\"enablevscroll\" : 1,\n\t\t\"devicewidth\" : 0.0,\n\t\t\"boxes\" : [ \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"button\",\n\t\t\t\t\t\"patching_rect\" : [ 260.0, 260.0, 20.0, 20.0 ],\n\t\t\t\t\t\"numinlets\" : 1,\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"bang\" ],\n\t\t\t\t\t\"id\" : \"obj-22\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"button\",\n\t\t\t\t\t\"patching_rect\" : [ 240.0, 260.0, 20.0, 20.0 ],\n\t\t\t\t\t\"numinlets\" : 1,\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"bang\" ],\n\t\t\t\t\t\"id\" : \"obj-20\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"button\",\n\t\t\t\t\t\"patching_rect\" : [ 220.0, 260.0, 20.0, 20.0 ],\n\t\t\t\t\t\"numinlets\" : 1,\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"bang\" ],\n\t\t\t\t\t\"id\" : \"obj-18\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"button\",\n\t\t\t\t\t\"patching_rect\" : [ 200.0, 260.0, 20.0, 20.0 ],\n\t\t\t\t\t\"numinlets\" : 1,\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"bang\" ],\n\t\t\t\t\t\"id\" : \"obj-16\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"newobj\",\n\t\t\t\t\t\"text\" : \"route 0 1 2 3\",\n\t\t\t\t\t\"patching_rect\" : [ 200.0, 220.0, 99.0, 23.0 ],\n\t\t\t\t\t\"numinlets\" : 1,\n\t\t\t\t\t\"fontname\" : \"Arial\",\n\t\t\t\t\t\"numoutlets\" : 5,\n\t\t\t\t\t\"outlettype\" : [ \"\", \"\", \"\", \"\", \"\" ],\n\t\t\t\t\t\"fontsize\" : 14.0,\n\t\t\t\t\t\"id\" : \"obj-14\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"newobj\",\n\t\t\t\t\t\"text\" : \"r jojo\",\n\t\t\t\t\t\"patching_rect\" : [ 200.0, 180.0, 41.0, 23.0 ],\n\t\t\t\t\t\"numinlets\" : 0,\n\t\t\t\t\t\"fontname\" : \"Arial\",\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"\" ],\n\t\t\t\t\t\"fontsize\" : 14.0,\n\t\t\t\t\t\"color\" : [ 0.827451, 0.737255, 0.835294, 1.0 ],\n\t\t\t\t\t\"id\" : \"obj-13\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"newobj\",\n\t\t\t\t\t\"text\" : \"s jojo\",\n\t\t\t\t\t\"patching_rect\" : [ 20.0, 340.0, 43.0, 23.0 ],\n\t\t\t\t\t\"numinlets\" : 1,\n\t\t\t\t\t\"fontname\" : \"Arial\",\n\t\t\t\t\t\"numoutlets\" : 0,\n\t\t\t\t\t\"fontsize\" : 14.0,\n\t\t\t\t\t\"color\" : [ 0.827451, 0.737255, 0.835294, 1.0 ],\n\t\t\t\t\t\"id\" : \"obj-12\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"newobj\",\n\t\t\t\t\t\"text\" : \"append toto\",\n\t\t\t\t\t\"patching_rect\" : [ 20.0, 300.0, 84.0, 23.0 ],\n\t\t\t\t\t\"numinlets\" : 1,\n\t\t\t\t\t\"fontname\" : \"Arial\",\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"\" ],\n\t\t\t\t\t\"fontsize\" : 14.0,\n\t\t\t\t\t\"id\" : \"obj-11\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"newobj\",\n\t\t\t\t\t\"text\" : \"% 4\",\n\t\t\t\t\t\"patching_rect\" : [ 20.0, 260.0, 35.0, 23.0 ],\n\t\t\t\t\t\"numinlets\" : 2,\n\t\t\t\t\t\"fontname\" : \"Arial\",\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"int\" ],\n\t\t\t\t\t\"fontsize\" : 14.0,\n\t\t\t\t\t\"id\" : \"obj-10\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"newobj\",\n\t\t\t\t\t\"text\" : \"counter\",\n\t\t\t\t\t\"patching_rect\" : [ 20.0, 220.0, 73.0, 23.0 ],\n\t\t\t\t\t\"numinlets\" : 5,\n\t\t\t\t\t\"fontname\" : \"Arial\",\n\t\t\t\t\t\"numoutlets\" : 4,\n\t\t\t\t\t\"outlettype\" : [ \"int\", \"\", \"\", \"int\" ],\n\t\t\t\t\t\"fontsize\" : 14.0,\n\t\t\t\t\t\"id\" : \"obj-9\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"newobj\",\n\t\t\t\t\t\"text\" : \"metro 250\",\n\t\t\t\t\t\"patching_rect\" : [ 20.0, 180.0, 74.0, 23.0 ],\n\t\t\t\t\t\"numinlets\" : 2,\n\t\t\t\t\t\"fontname\" : \"Arial\",\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"bang\" ],\n\t\t\t\t\t\"fontsize\" : 14.0,\n\t\t\t\t\t\"id\" : \"obj-8\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"toggle\",\n\t\t\t\t\t\"patching_rect\" : [ 20.0, 140.0, 20.0, 20.0 ],\n\t\t\t\t\t\"numinlets\" : 1,\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"int\" ],\n\t\t\t\t\t\"id\" : \"obj-7\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"newobj\",\n\t\t\t\t\t\"text\" : \"t 0\",\n\t\t\t\t\t\"patching_rect\" : [ 140.0, 80.0, 26.0, 23.0 ],\n\t\t\t\t\t\"numinlets\" : 1,\n\t\t\t\t\t\"fontname\" : \"Arial\",\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"int\" ],\n\t\t\t\t\t\"fontsize\" : 14.0,\n\t\t\t\t\t\"id\" : \"obj-5\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"newobj\",\n\t\t\t\t\t\"text\" : \"t 1\",\n\t\t\t\t\t\"patching_rect\" : [ 20.0, 80.0, 26.0, 23.0 ],\n\t\t\t\t\t\"numinlets\" : 1,\n\t\t\t\t\t\"fontname\" : \"Arial\",\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"int\" ],\n\t\t\t\t\t\"fontsize\" : 14.0,\n\t\t\t\t\t\"id\" : \"obj-4\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"message\",\n\t\t\t\t\t\"text\" : \"Goodbye World !\",\n\t\t\t\t\t\"patching_rect\" : [ 140.0, 40.0, 115.0, 21.0 ],\n\t\t\t\t\t\"numinlets\" : 2,\n\t\t\t\t\t\"fontname\" : \"Arial\",\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"\" ],\n\t\t\t\t\t\"fontsize\" : 14.0,\n\t\t\t\t\t\"presentation_rect\" : [ 137.0, 42.0, 0.0, 0.0 ],\n\t\t\t\t\t\"id\" : \"obj-3\"\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"box\" : \t\t\t\t{\n\t\t\t\t\t\"maxclass\" : \"message\",\n\t\t\t\t\t\"text\" : \"Hello World !\",\n\t\t\t\t\t\"patching_rect\" : [ 20.0, 40.0, 90.0, 21.0 ],\n\t\t\t\t\t\"numinlets\" : 2,\n\t\t\t\t\t\"fontname\" : \"Arial\",\n\t\t\t\t\t\"numoutlets\" : 1,\n\t\t\t\t\t\"outlettype\" : [ \"\" ],\n\t\t\t\t\t\"fontsize\" : 14.0,\n\t\t\t\t\t\"id\" : \"obj-2\"\n\t\t\t\t}\n\n\t\t\t}\n ],\n\t\t\"lines\" : [ \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-14\", 3 ],\n\t\t\t\t\t\"destination\" : [ \"obj-22\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-14\", 2 ],\n\t\t\t\t\t\"destination\" : [ \"obj-20\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-14\", 1 ],\n\t\t\t\t\t\"destination\" : [ \"obj-18\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-14\", 0 ],\n\t\t\t\t\t\"destination\" : [ \"obj-16\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-13\", 0 ],\n\t\t\t\t\t\"destination\" : [ \"obj-14\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-11\", 0 ],\n\t\t\t\t\t\"destination\" : [ \"obj-12\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-10\", 0 ],\n\t\t\t\t\t\"destination\" : [ \"obj-11\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-9\", 0 ],\n\t\t\t\t\t\"destination\" : [ \"obj-10\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-8\", 0 ],\n\t\t\t\t\t\"destination\" : [ \"obj-9\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-7\", 0 ],\n\t\t\t\t\t\"destination\" : [ \"obj-8\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-5\", 0 ],\n\t\t\t\t\t\"destination\" : [ \"obj-7\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ 149.5, 121.0, 29.5, 121.0 ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-4\", 0 ],\n\t\t\t\t\t\"destination\" : [ \"obj-7\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-3\", 0 ],\n\t\t\t\t\t\"destination\" : [ \"obj-5\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n, \t\t\t{\n\t\t\t\t\"patchline\" : \t\t\t\t{\n\t\t\t\t\t\"source\" : [ \"obj-2\", 0 ],\n\t\t\t\t\t\"destination\" : [ \"obj-4\", 0 ],\n\t\t\t\t\t\"hidden\" : 0,\n\t\t\t\t\t\"midpoints\" : [ ]\n\t\t\t\t}\n\n\t\t\t}\n ]\n\t}\n\n}\n" }, { "path": "src/test/resources/samples/langs/Max/Hello.mxt", "content": "max v2;\r#N vpatcher 109 76 569 534;\r#P toggle 31 168 21 0;\r#P button 360 299 15 0;\r#P button 322 299 15 0;\r#P button 284 299 15 0;\r#P button 246 299 15 0;\r#P window setfont Verdana 12.;\r#P window linecount 1;\r#P newex 246 168 43 472055820 r jojo;\r#B color 5;\r#P newex 31 386 45 472055820 s jojo;\r#B color 5;\r#P newex 246 254 162 472055820 route 0 1 2 3;\r#P newex 31 338 88 472055820 append toto;\r#P newex 31 296 35 472055820 % 4;\r#N counter;\r#X flags 0 0;\r#P newobj 31 251 75 472055820 counter;\r#P newex 31 209 75 472055820 metro 250;\r#P newex 164 96 32 472055820 t 0;\r#P message 164 55 136 472055820 Goodbye World !;\r#P newex 31 96 32 472055820 t 1;\r#P message 31 55 113 472055820 Hello World !;\r#P connect 0 0 1 0;\r#P fasten 3 0 15 0 169 146 36 146;\r#P connect 1 0 15 0;\r#P connect 15 0 4 0;\r#P connect 4 0 5 0;\r#P connect 5 0 6 0;\r#P connect 6 0 7 0;\r#P connect 7 0 9 0;\r#P connect 2 0 3 0;\r#P connect 10 0 8 0;\r#P connect 8 0 11 0;\r#P connect 8 1 12 0;\r#P connect 8 2 13 0;\r#P connect 8 3 14 0;\r#P pop;\r" }, { "path": "src/test/resources/samples/langs/MediaWiki/README.wiki", "content": "= Name =\n\n'''nginx_tcp_proxy_module''' - support TCP proxy with Nginx\n\n= Installation =\n\nDownload the latest stable version of the release tarball of this module from [http://github.com/yaoweibin/nginx_tcp_proxy_module github]\n\nGrab the nginx source code from [http://nginx.org/ nginx.org], for example, the version 1.2.1 (see nginx compatibility), and then build the source with this module:\n\n\n $ wget 'http://nginx.org/download/nginx-1.2.1.tar.gz'\n $ tar -xzvf nginx-1.2.1.tar.gz\n $ cd nginx-1.2.1/\n $ patch -p1 < /path/to/nginx_tcp_proxy_module/tcp.patch\n\n $ ./configure --add-module=/path/to/nginx_tcp_proxy_module\n\n $ make\n $ make install\n\n \n\n= Synopsis =\n\n\nhttp {\n\n server {\n listen 80;\n\n location /status {\n tcp_check_status;\n }\n }\n}\n\n\n\n\n#You can also include tcp_proxy.conf file individually\n\n#include /path/to/tcp_proxy.conf;\n\ntcp {\n\n upstream cluster {\n # simple round-robin\n server 192.168.0.1:80;\n server 192.168.0.2:80;\n\n check interval=3000 rise=2 fall=5 timeout=1000;\n\n #check interval=3000 rise=2 fall=5 timeout=1000 type=ssl_hello;\n\n #check interval=3000 rise=2 fall=5 timeout=1000 type=http;\n #check_http_send \"GET / HTTP/1.0\\r\\n\\r\\n\";\n #check_http_expect_alive http_2xx http_3xx;\n }\n\n server {\n listen 8888;\n\n proxy_pass cluster;\n }\n}\n\n\n= Description =\n\nThis module actually include many modules: ngx_tcp_module, ngx_tcp_core_module, ngx_tcp_upstream_module, ngx_tcp_proxy_module, ngx_tcp_websocket_module, ngx_tcp_ssl_module, ngx_tcp_upstream_ip_hash_module. All these modules work together to support TCP proxy with Nginx. I also added other features: ip_hash, upstream server health check, status monitor.\n\nThe motivation of writing these modules is Nginx's high performance and robustness. At first, I developed this module just for general TCP proxy. And now, this module is frequently used in websocket reverse proxying. \n\nNote, You can't use the same listening port with HTTP modules. \n\n= Directives =\n\n== ngx_tcp_moodule ==\n\n=== tcp ===\n\n'''syntax:''' ''tcp {...}''\n\n'''default:''' ''none''\n\n'''context:''' ''main''\n\n'''description:''' All the tcp related directives are contained in the tcp block.\n\n\n'''ngx_tcp_core_moodule'''\n\n=== server ===\n\n'''syntax:''' ''server {...}''\n\n'''default:''' ''none''\n\n'''context:''' ''tcp''\n\n'''description:''' All the specific server directives are contained in the server block.\n\n=== listen ===\n\n'''syntax:''' ''listen address:port [ bind | ssl | default]''\n\n'''default:''' ''none''\n\n'''context:''' ''server''\n\n'''description:''' The same as [http://wiki.nginx.org/NginxMailCoreModule#listen listen]. The parameter of default means the default server if you have several server blocks with the same port.\n\n=== access_log ===\n\n'''syntax:''' ''access_log path [buffer=size] | off'' \n\n'''default:''' ''access_log logs/tcp_access.log''\n\n'''context:''' ''tcp, server''\n\n'''description:''' Set the access.log. Each record's format is like this:\n\n
    \n\nlog_time worker_process_pid client_ip host_ip accept_time upstream_ip bytes_read bytes_write\n\n2011/08/02 06:19:07 [5972] 127.0.0.1 0.0.0.0:1982 2011/08/02 06:18:19 172.19.0.129:80 80 236305\n\n
    \n\n* ''log_time'': The current time when writing this log. The log action is called when the proxy session is closed.\n* ''worker_process_pid'': the pid of worker process\n* ''client_ip'': the client ip\n* ''host_ip'': the server ip and port\n* ''accept_time'': the time when the server accepts client's connection\n* ''upstream_ip'': the upstream server's ip\n* ''bytes_read'': the bytes read from client\n* ''bytes_write'': the bytes written to client\n\n=== allow ===\n\n'''syntax:''' ''allow [ address | CIDR | all ]'' \n\n'''default:''' ''none''\n\n'''context:''' ''server''\n\n'''description:''' Directive grants access for the network or addresses indicated.\n\n=== deny ===\n\n'''syntax:''' ''deny [ address | CIDR | all ]''\n\n'''default:''' ''none''\n\n'''context:''' ''server''\n\n'''description:''' Directive grants access for the network or addresses indicated.\n\n=== so_keepalive ===\n\n'''syntax:''' ''so_keepalive on|off''\n\n'''default:''' ''off''\n\n'''context:''' ''main, server''\n\n'''description:''' The same as [http://wiki.nginx.org/NginxMailCoreModule#so_keepalive so_keepalive].\n\n=== tcp_nodelay ===\n\n'''syntax:''' ''tcp_nodelay on|off''\n\n'''default:''' ''on''\n\n'''context:''' ''main, server''\n\n'''description:''' The same as [http://wiki.nginx.org/NginxHttpCoreModule#tcp_nodelay tcp_nodelay].\n\n=== timeout ===\n\n'''syntax:''' ''timeout milliseconds''\n\n'''default:''' ''60000''\n\n'''context:''' ''main, server''\n\n'''description:''' set the timeout value with clients.\n\n=== server_name ===\n\n'''syntax:''' ''server_name name''\n\n'''default:''' ''The name of the host, obtained through gethostname()''\n\n'''context:''' ''tcp, server''\n\n'''description:''' The same as [http://wiki.nginx.org/NginxMailCoreModule#server_name server_name]. You can specify several server name in different server block with the same port. They can be used in websocket module.\n\n=== resolver ===\n\n'''syntax:''' ''resolver address''\n\n'''default:''' ''none''\n\n'''context:''' ''tcp, server''\n\n'''description:''' DNS server\n\n=== resolver_timeout ===\n\n'''syntax:''' ''resolver_timeout time''\n\n'''default:''' ''30s''\n\n'''context:''' ''tcp, server''\n\n'''description:''' Resolver timeout in seconds.\n\n\n== ngx_tcp_upstream_module ==\n\n=== upstream ===\n\n'''syntax:''' ''upstream {...}''\n\n'''default:''' ''none''\n\n'''context:''' ''tcp''\n\n'''description:''' All the upstream directives are contained in this block. The upstream server will be dispatched with round robin by default. \n\n=== server ===\n\n'''syntax:''' ''server name [parameters]''\n\n'''default:''' ''none''\n\n'''context:''' ''upstream''\n\n'''description:''' Most of the parameters are the same as [http://wiki.nginx.org/NginxHttpUpstreamModule#server server]. Default port is 80. \n\n=== check ===\n\n'''syntax:''' ''check interval=milliseconds [fall=count] [rise=count] [timeout=milliseconds] [type=tcp|ssl_hello|smtp|mysql|pop3|imap]''\n\n'''default:''' ''none, if parameters omitted, default parameters are interval=30000 fall=5 rise=2 timeout=1000''\n\n'''context:''' ''upstream''\n\n'''description:''' Add the health check for the upstream servers. At present, the check method is a simple tcp connect.\n\nThe parameters' meanings are:\n\n* ''interval'': the check request's interval time.\n* ''fall''(fall_count): After fall_count check failures, the server is marked down. \n* ''rise''(rise_count): After rise_count check success, the server is marked up. \n* ''timeout'': the check request's timeout.\n* ''type'': the check protocol type:\n# ''tcp'' is a simple tcp socket connect and peek one byte. \n# ''ssl_hello'' sends a client ssl hello packet and receives the server ssl hello packet.\n# ''http'' sends a http request packet, receives and parses the http response to diagnose if the upstream server is alive. \n# ''smtp'' sends a smtp request packet, receives and parses the smtp response to diagnose if the upstream server is alive. The response begins with '2' should be an OK response. \n# ''mysql'' connects to the mysql server, receives the greeting response to diagnose if the upstream server is alive. \n# ''pop3'' receives and parses the pop3 response to diagnose if the upstream server is alive. The response begins with '+' should be an OK response.\n# ''imap'' connects to the imap server, receives the greeting response to diagnose if the upstream server is alive. \n\n=== check_http_send ===\n\n'''syntax:''' ''check_http_send http_packet''\n\n'''default:''' ''\"GET / HTTP/1.0\\r\\n\\r\\n\"''\n\n'''context:''' ''upstream''\n\n'''description:''' If you set the check type is http, then the check function will sends this http packet to check the upstream server.\n\n=== check_http_expect_alive ===\n\n'''syntax:''' ''check_http_expect_alive [ http_2xx | http_3xx | http_4xx | http_5xx ]''\n\n'''default:''' ''http_2xx | http_3xx''\n\n'''context:''' ''upstream''\n\n'''description:''' These status codes indicate the upstream server's http response is OK, the backend is alive.\n\n=== check_smtp_send ===\n\n'''syntax:''' ''check_smtp_send smtp_packet''\n\n'''default:''' ''\"HELO smtp.localdomain\\r\\n\"''\n\n'''context:''' ''upstream''\n\n'''description:''' If you set the check type is smtp, then the check function will sends this smtp packet to check the upstream server.\n\n=== check_smtp_expect_alive ===\n\n'''syntax:''' ''check_smtp_expect_alive [smtp_2xx | smtp_3xx | smtp_4xx | smtp_5xx]''\n\n'''default:''' ''smtp_2xx''\n\n'''context:''' ''upstream''\n\n'''description:''' These status codes indicate the upstream server's smtp response is OK, the backend is alive.\n\n=== check_shm_size ===\n\n'''syntax:''' ''check_shm_size size''\n\n'''default:''' ''(number_of_checked_upstream_blocks + 1) * pagesize''\n\n'''context:''' ''tcp''\n\n'''description:''' If you store hundreds of servers in one upstream block, the shared memory for health check may be not enough, you can enlarged it by this directive.\n\n=== tcp_check_status ===\n\n'''syntax:''' ''tcp_check_status''\n\n'''default:''' ''none''\n\n'''context:''' ''location''\n\n'''description:''' Display the health checking servers' status by HTTP. This directive is set in the http block.\n\nThe table field meanings are:\n\n* ''Index'': The server index in the check table \n* ''Name'' : The upstream server name\n* ''Status'': The marked status of the server.\n* ''Busyness'': The number of connections which are connecting to the server.\n* ''Rise counts'': Count the successful checking\n* ''Fall counts'': Count the unsuccessful checking\n* ''Access counts'': Count the times accessing to this server\n* ''Check type'': The type of the check packet\n\n\n'''ngx_tcp_upstream_busyness_module'''\n\n=== busyness ===\n\n'''syntax:''' ''busyness''\n\n'''default:''' ''none''\n\n'''context:''' ''upstream''\n\n'''description:''' the upstream server will be dispatched by backend servers' busyness.\n\n\n'''ngx_tcp_upstream_ip_hash_module'''\n\n=== ip_hash ===\n\n'''syntax:''' ''ip_hash''\n\n'''default:''' ''none''\n\n'''context:''' ''upstream''\n\n'''description:''' the upstream server will be dispatched by ip_hash.\n\n\n== ngx_tcp_proxy_module ==\n\n=== proxy_pass ===\n\n'''syntax:''' ''proxy_pass host:port''\n\n'''default:''' ''none''\n\n'''context:''' ''server''\n\n'''description:''' proxy the request to the backend server. Default port is 80.\n\n=== proxy_buffer ===\n\n'''syntax:''' ''proxy_buffer size''\n\n'''default:''' ''4k''\n\n'''context:''' ''tcp, server''\n\n'''description:''' set the size of proxy buffer.\n\n=== proxy_connect_timeout ===\n\n'''syntax:''' ''proxy_connect_timeout miliseconds''\n\n'''default:''' ''60000''\n\n'''context:''' ''tcp, server''\n\n'''description:''' set the timeout value of connection to backends.\n\n=== proxy_read_timeout ===\n\n'''syntax:''' ''proxy_read_timeout miliseconds''\n\n'''default:''' ''60000''\n\n'''context:''' ''tcp, server''\n\n'''description:''' set the timeout value of reading from backends.\n\n=== proxy_send_timeout ===\n\n'''syntax:''' ''proxy_send_timeout miliseconds''\n\n'''default:''' ''60000''\n\n'''context:''' ''tcp, server''\n\n'''description:''' set the timeout value of sending to backends.\n\n\n== ngx_tcp_websocket_module ==\n\n=== websocket_pass ===\n\n'''syntax:''' ''websocket_pass [path] host:port''\n\n'''default:''' ''none''\n\n'''context:''' ''server''\n\n'''description:''' proxy the websocket request to the backend server. Default port is 80. You can specify several different paths in the same server block.\n\n=== websocket_buffer ===\n\n'''syntax:''' ''websocket_buffer size''\n\n'''default:''' ''4k''\n\n'''context:''' ''tcp, server''\n\n'''description:''' set the size of proxy buffer.\n\n=== websocket_connect_timeout ===\n\n'''syntax:''' ''websocket_connect_timeout miliseconds''\n\n'''default:''' ''60000''\n\n'''context:''' ''tcp, server''\n\n'''description:''' set the timeout value of connection to backends.\n\n=== websocket_read_timeout ===\n\n'''syntax:''' ''websocket_read_timeout miliseconds''\n\n'''default:''' ''60000''\n\n'''context:''' ''tcp, server''\n\n'''description:''' set the timeout value of reading from backends. Your timeout will be the minimum of this and the *timeout* parameter, so if you want a long timeout for your websockets, make sure to set both paramaters.\n\n=== websocket_send_timeout ===\n\n'''syntax:''' ''websocket_send_timeout miliseconds''\n\n'''default:''' ''60000''\n\n'''context:''' ''tcp, server''\n\n'''description:''' set the timeout value of sending to backends.\n\n\n== ngx_tcp_ssl_module ==\n\nThe default config file includes this ngx_tcp_ssl_module. If you want to just compile nginx without ngx_tcp_ssl_module, copy the ngx_tcp_proxy_module/config_without_ssl to ngx_tcp_proxy_module/config, reconfigrure and compile nginx.\n\n=== ssl ===\n\n'''syntax:''' ''ssl [on|off] ''\n\n'''default:''' ''ssl off''\n\n'''context:''' ''tcp, server''\n\nEnables SSL for a server.\n\n=== ssl_certificate ===\n\n'''syntax:''' ''ssl_certificate file''\n\n'''default:''' ''ssl_certificate cert.pem''\n\n'''context:''' ''tcp, server''\n\nThis directive specifies the file containing the certificate, in PEM format. This file can contain also other certificates and the server private key.\n\n=== ssl_certificate_key ===\n\n'''syntax:''' ''ssl_certificate_key file''\n\n'''default:''' ''ssl_certificate_key cert.pem''\n\n'''context:''' ''tcp, server''\n\nThis directive specifies the file containing the private key, in PEM format.\n\n=== ssl_client_certificate ===\n\n'''syntax:''' ''ssl_client_certificate file''\n\n'''default:''' ''none''\n\n'''context:''' ''tcp, server''\n\nThis directive specifies the file containing the CA (root) certificate, in PEM format, that is used for validating client certificates.\n\n=== ssl_dhparam ===\n\n'''syntax:''' ''ssl_dhparam file''\n\n'''default:''' ''none''\n\n'''context:''' ''tcp, server''\n\nThis directive specifies a file containing Diffie-Hellman key agreement protocol cryptographic parameters, in PEM format, utilized for exchanging session keys between server and client.\n\n=== ssl_ciphers ===\n\n'''syntax:''' ''ssl_ciphers openssl_cipherlist_spec''\n\n'''default:''' ''ssl_ciphers HIGH:!aNULL:!MD5''\n\n'''context:''' ''tcp, server''\n\nThis directive describes the list of cipher suites the server supports for establishing a secure connection. Cipher suites are specified in the [http://openssl.org/docs/apps/ciphers.html OpenSSL] cipherlist format, for example:\n\n\nssl_ciphers ALL:!ADH:!EXPORT56:RC4+RSA:+HIGH:+MEDIUM:+LOW:+SSLv2:+EXP;\n\n\nThe complete cipherlist supported by the currently installed version of OpenSSL in your platform can be obtained by issuing the command:\n
    \nopenssl ciphers\n
    \n\n=== ssl_crl ===\n\n'''syntax:''' ''ssl_crl file''\n\n'''default:''' ''none''\n\n'''context:''' ''tcp, server''\n\nThis directive specifies the filename of a Certificate Revocation List, in PEM format, which is used to check the revocation status of certificates.\n\n=== ssl_prefer_server_ciphers ===\n\n'''syntax:''' ''ssl_prefer_server_ciphers [on|off] ''\n\n'''default:''' ''ssl_prefer_server_ciphers off''\n\n'''context:''' ''tcp, server''\n\nThe server requires that the cipher suite list for protocols SSLv3 and TLSv1 are to be preferred over the client supported cipher suite list.\n\n=== ssl_protocols ===\n\n'''syntax:''' ''ssl_protocols [SSLv2] [SSLv3] [TLSv1] [TLSv1.1] [TLSv1.2]''\n\n'''default:''' ''ssl_protocols SSLv3 TLSv1 TLSv1.1 TLSv1.2''\n\n'''context:''' ''tcp, server''\n\nThis directive enables the protocol versions specified.\n\n=== ssl_verify_client ===\n\n'''syntax:''' ''ssl_verify_client on|off|optional''\n\n'''default:''' ''ssl_verify_client off''\n\n'''context:''' ''tcp, server''\n\nThis directive enables the verification of the client identity. Parameter 'optional' checks the client identity using its certificate in case it was made available to the server.\n\n=== ssl_verify_depth ===\n\n'''syntax:''' ''ssl_verify_depth number''\n\n'''default:''' ''ssl_verify_depth 1''\n\n'''context:''' ''tcp, server''\n\nThis directive sets how deep the server should go in the client provided certificate chain in order to verify the client identity.\n\n=== ssl_session_cache ===\n\n'''syntax:''' ''ssl_session_cache off|none|builtin:size and/or shared:name:size''\n\n'''default:''' ''ssl_session_cache off''\n\n'''context:''' ''tcp, server''\n\nThe directive sets the types and sizes of caches to store the SSL sessions.\n\nThe cache types are:\n\n* off -- Hard off: nginx says explicitly to a client that sessions can not reused.\n* none -- Soft off: nginx says to a client that session can be resued, but nginx actually never reuses them. This is workaround for some mail clients as ssl_session_cache may be used in mail proxy as well as in HTTP server.\n* builtin -- the OpenSSL builtin cache, is used inside one worker process only. The cache size is assigned in the number of the sessions. Note: there appears to be a memory fragmentation issue using this method, please take that into consideration when using this. See \"References\" below.\n* shared -- the cache is shared between all worker processes. The size of the cache is assigned in bytes: 1 MB cache can contain roughly 4000 sessions. Each shared cache must be given an arbitrary name. A shared cache with a given name can be used in several virtual hosts.\nIt's possible to use both types of cache — builtin and shared — simultaneously, for example:\n\n\nssl_session_cache builtin:1000 shared:SSL:10m;\n\n\nBear in mind however, that using only shared cache, i.e., without builtin, should be more effective.\n\n=== ssl_session_timeout ===\n\n'''syntax:''' ''ssl_session_timeout time''\n\n'''default:''' ''ssl_session_timeout 5m''\n\n'''context:''' ''tcp, server''\n\nThis directive defines the maximum time during which the client can re-use the previously negotiated cryptographic parameters of the secure session that is stored in the SSL cache.\n\n= Compatibility =\n\n* My test bed is 0.7.65+\n\n= Notes =\n\nThe http_response_parse.rl and smtp_response_parse.rl are [http://www.complang.org/ragel/ ragel] scripts , you can edit the script and compile it like this:\n\n\n $ ragel -G2 http_response_parse.rl\n $ ragel -G2 smtp_response_parse.rl\n\n\n= TODO =\n\n* refact this module, make it more extendable for adding third-party modules\n* manipulate header like http module's proxy_set_header\n* built-in variable support\n* custom log format\n* syslog support\n* FTP/IRC proxying\n\n= Known Issues =\n\n* This module can't use the same listening port with the HTTP module.\n\n= Changelogs =\n\n== v0.2.0 ==\n\n* add ssl proxy module\n* add websocket proxy module\n* add upstream busyness module\n* add tcp access log module\n\n== v0.19 ==\n\n* add many check methods\n\n== v0.1 ==\n\n* first release\n\n= Authors =\n\nWeibin Yao(姚伟斌) ''yaoweibin at gmail dot com''\n\n= Copyright & License =\n\nThis README template copy from [http://github.com/agentzh agentzh].\n\nI borrowed a lot of code from upstream and mail module from the nginx 0.7.* core. This part of code is copyrighted by Igor Sysoev. And the health check part is borrowed the design of Jack Lindamood's healthcheck module [http://github.com/cep21/healthcheck_nginx_upstreams healthcheck_nginx_upstreams];\n\nThis module is licensed under the BSD license.\n\nCopyright (C) 2013 by Weibin Yao .\n\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:\n\n* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n" }, { "path": "src/test/resources/samples/langs/MediaWiki/mediawiki.mediawiki", "content": "\n= Overview =\n\nThe GDB Tracepoint Analysis feature is an extension to the Tracing and Monitoring Framework that allows the visualization and analysis of C/C++ tracepoint data collected by GDB and stored to a log file.\n\n= Getting Started =\n\nThe feature can be installed from the Eclipse update site by selecting '''Linux Tools''' > '''GDB Tracepoint Analysis'''.\n\nThe feature requires GDB version 7.2 or later to be installed on the local host. The executable program 'gdb' must be found in the path.\n\n= GDB Trace Perspective =\n\nTo open the perspective, select '''Window''' > '''Open Perspective''' > '''Other...''' > '''GDB Trace'''.\n\nThe perspective includes the following views by default:\n\n* '''Project Explorer''': This view shows the projects in the workspace and is used to create and manage Tracing projects.\n* '''Debug''': This view shows the running C/C++ Postmortem Debugger instances and displays the thread and stack trace associated with a tracepoint.\n* '''Trace Control''': This view shows the status of the debugger and allows navigation of trace records.\n* '''Console''': This view displays console output of the C/C++ Postmortem Debugger.\n\nThe editor area contains the '''Events''' and '''C/C++''' editors when a GDB Trace is opened.\n\n[[Image:images/GDBTracePerspective.png]]\n\n= Collecting Tracepoint Data =\n\nCollecting the C/C++ tracepoint data is outside the scope of this feature. It can be done from the GDB command line or by using the CDT debug component within Eclipse. See the CDT FAQ entry in the [[#References | References]] section.\n\n= Importing Tracepoint Data =\n\nSome information in this section is redundant with the LTTng User Guide. For further details, see the LTTng User Guide entry in the [[#References | References]] section.\n\n== Creating a Tracing Project ==\n\nIn the '''Project Explorer''' view, right-click and select '''New''' > '''Project...''' from the context menu. In the '''New Project''' dialog, select '''Tracing''' > '''Tracing Project''', click '''Next''', name your project and click '''Finish'''.\n\n== Importing a GDB Trace ==\n\nIn your tracing project, right-click on the '''Traces''' folder and select '''Import...'''. Browse to, or enter, a source directory. Select the trace file in the tree. Optionally set the trace type to '''GDB : GDB Trace'''. Click '''Finish'''.\n\nAlternatively, the trace can be drag & dropped to the '''Traces''' folder from any external file manager.\n\n== Selecting the GDB Trace Type ==\n\nRight-click the imported trace in the '''Traces''' folder and choose '''Select Trace Type...''' > '''GDB''' > '''GDB Trace''' from the context menu. This step can be omitted if the trace type was selected at import.\n\nThe trace will be updated with the GDB icon [[Image:images/gdb_icon16.png]].\n\n== Selecting the Trace Executable ==\n\nThe executable file that created the tracepoint data must be identified so that the C/C++ Postmortem Debugger can be launched properly.\n\nRight-click the GDB trace in the '''Traces''' folder and choose '''Select Trace Executable...''' from the context menu. Browse to, or enter, the path of the executable file and press '''OK'''.\n\nThe selected file must be recognized by GDB as an executable.\n\n= Visualizing Tracepoint Data =\n\n== Opening a GDB Trace ==\n\nIn the '''Traces''' folder, double-click the GDB trace or right-click it and select '''Open''' from the context menu.\n\nThe tracepoint data will be opened in an Events editor, and a C/C++ Postmortem Debugger instance will be launched.\n\nIf available in the workspace, the source code corresponding to the first trace record will also be opened in a C/C++ editor.\n\nAt this point it is recommended to relocate the Events editor outside of the default editor area, so that it is not hidden by the C/C++ editor.\n\n== Viewing Trace Data ==\n\nIn the Events editor, a table is shown with one row for each trace record. The '''Trace Frame''' column shows the sequential trace record number. The '''Tracepoint''' column shows the number assigned by GDB at collection time for this tracepoint. The '''File''' column shows the file name, line number and method where the tracepoint was set. The '''Content''' column shows the data collected at run-time by the tracepoint.\n\nSearching and filtering can be done on any column by entering a regular expression in the column header.\n\n== Navigating the GDB Trace ==\n\nTrace records can be selected in the Events editor using the keyboard or mouse. The C/C++ Postmortem Debugger in the '''Debug''' view will be updated to show the stack trace of the current trace record.\n\nThe trace can also be navigated from the '''Trace Control''' view by clicking the '''Next Trace Record''' or '''Previous Trace Record''' buttons. The Events editor and '''Debug''' views will be updated.\n\n= References =\n\n* [http://wiki.eclipse.org/index.php/Linux_Tools_Project/LTTng2/User_Guide LTTng User Guide]\n* [http://wiki.eclipse.org/CDT/User/FAQ#How_can_I_trace_my_application_using_C.2FC.2B.2B_Tracepoints.3F CDT FAQ - How can I trace my application using C/C++ Tracepoints?]\n\n= Updating This Document =\n\nThis document is maintained in a collaborative wiki. If you wish to update or modify this document please visit [http://wiki.eclipse.org/index.php/Linux_Tools_Project/GDB_Tracepoint_Analysis/User_Guide http://wiki.eclipse.org/Linux_Tools_Project/GDB_Tracepoint_Analysis/User_Guide]\n" }, { "path": "src/test/resources/samples/langs/Mercury/code_info.m", "content": "%---------------------------------------------------------------------------%\n% vim: ft=mercury ts=4 sw=4 et\n%---------------------------------------------------------------------------%\n% Copyright (C) 1994-2012 The University of Melbourne.\n% This file may only be copied under the terms of the GNU General\n% Public License - see the file COPYING in the Mercury distribution.\n%---------------------------------------------------------------------------%\n%\n% File: code_info.m.\n% Main authors: conway, zs.\n%\n% This file defines the code_info type and various operations on it.\n% The code_info structure is the 'state' of the code generator.\n%\n% This file is organized into ten submodules:\n%\n% - the code_info structure and its access predicates\n% - simple wrappers around access predicates\n% - handling branched control structures\n% - handling failure continuations\n% - handling liveness issues\n% - saving and restoring heap pointers, trail tickets etc\n% - interfacing to var_locn\n% - managing the info required by garbage collection and value numbering\n% - managing stack slots\n% - support for debugging the code generator itself.\n%\n%---------------------------------------------------------------------------%\n\n:- module ll_backend.code_info.\n:- interface.\n\n:- import_module check_hlds.type_util.\n:- import_module hlds.code_model.\n:- import_module hlds.hlds_data.\n:- import_module hlds.hlds_goal.\n:- import_module hlds.hlds_llds.\n:- import_module hlds.hlds_module.\n:- import_module hlds.hlds_pred.\n:- import_module hlds.instmap.\n:- import_module libs.globals.\n:- import_module ll_backend.continuation_info.\n:- import_module ll_backend.global_data.\n:- import_module ll_backend.layout.\n:- import_module ll_backend.llds.\n:- import_module ll_backend.trace_gen.\n:- import_module mdbcomp.prim_data.\n:- import_module mdbcomp.goal_path.\n:- import_module parse_tree.prog_data.\n:- import_module parse_tree.set_of_var.\n\n:- import_module assoc_list.\n:- import_module bool.\n:- import_module counter.\n:- import_module io.\n:- import_module list.\n:- import_module map.\n:- import_module maybe.\n:- import_module set.\n:- import_module set_tree234.\n:- import_module term.\n\n%----------------------------------------------------------------------------%\n%----------------------------------------------------------------------------%\n\n:- implementation.\n\n:- import_module backend_libs.builtin_ops.\n:- import_module backend_libs.proc_label.\n:- import_module hlds.arg_info.\n:- import_module hlds.hlds_desc.\n:- import_module hlds.hlds_rtti.\n:- import_module libs.options.\n:- import_module libs.trace_params.\n:- import_module ll_backend.code_util.\n:- import_module ll_backend.opt_debug.\n:- import_module ll_backend.var_locn.\n:- import_module parse_tree.builtin_lib_types.\n:- import_module parse_tree.prog_type.\n:- import_module parse_tree.mercury_to_mercury.\n\n:- import_module cord.\n:- import_module int.\n:- import_module pair.\n:- import_module require.\n:- import_module set.\n:- import_module stack.\n:- import_module string.\n:- import_module varset.\n\n%---------------------------------------------------------------------------%\n\n % Submodule for the code_info type and its access predicates.\n %\n % This submodule has the following components:\n %\n % declarations for exported access predicates\n % declarations for non-exported access predicates\n % the definition of the type and the init predicate\n % the definition of the get access predicates\n % the definition of the set access predicates\n %\n % Please keep the order of mention of the various fields\n % consistent in each of these five components.\n\n:- interface.\n\n:- type code_info.\n\n % Create a new code_info structure. Also return the\n % outermost resumption point, and info about the non-fixed\n % stack slots used for tracing purposes.\n %\n:- pred code_info_init(bool::in, globals::in, pred_id::in, proc_id::in,\n pred_info::in, proc_info::in, abs_follow_vars::in, module_info::in,\n static_cell_info::in, const_struct_map::in, resume_point_info::out,\n trace_slot_info::out, maybe(containing_goal_map)::in,\n list(string)::in, int::in, code_info::out) is det.\n\n % Get the globals table.\n %\n:- pred get_globals(code_info::in, globals::out) is det.\n\n % Get the exprn_opts.\n %\n:- pred get_exprn_opts(code_info::in, exprn_opts::out) is det.\n\n % Get the HLDS of the entire module.\n %\n:- pred get_module_info(code_info::in, module_info::out) is det.\n\n % Get the id of the predicate we are generating code for.\n %\n:- pred get_pred_id(code_info::in, pred_id::out) is det.\n\n % Get the id of the procedure we are generating code for.\n %\n:- pred get_proc_id(code_info::in, proc_id::out) is det.\n\n % Get the HLDS of the predicate containing the procedure\n % we are generating code for.\n %\n:- pred get_pred_info(code_info::in, pred_info::out) is det.\n\n % Get the HLDS of the procedure we are generating code for.\n %\n:- pred get_proc_info(code_info::in, proc_info::out) is det.\n\n % Get the variables for the current procedure.\n %\n:- pred get_varset(code_info::in, prog_varset::out) is det.\n\n:- func get_var_types(code_info) = vartypes.\n\n:- pred get_maybe_trace_info(code_info::in, maybe(trace_info)::out) is det.\n\n:- pred get_emit_trail_ops(code_info::in, add_trail_ops::out) is det.\n\n:- pred get_emit_region_ops(code_info::in, add_region_ops::out) is det.\n\n % Get the set of currently forward-live variables.\n %\n:- pred get_forward_live_vars(code_info::in, set_of_progvar::out) is det.\n\n % Set the set of currently forward-live variables.\n %\n:- pred set_forward_live_vars(set_of_progvar::in,\n code_info::in, code_info::out) is det.\n\n % Get the table mapping variables to the current\n % instantiation states.\n %\n:- pred get_instmap(code_info::in, instmap::out) is det.\n\n % Set the table mapping variables to the current\n % instantiation states.\n %\n:- pred set_instmap(instmap::in, code_info::in, code_info::out) is det.\n\n % Get the current nesting depth for parallel conjunctions.\n %\n:- pred get_par_conj_depth(code_info::in, int::out) is det.\n\n % Set the current nesting depth for parallel conjunctions.\n %\n:- pred set_par_conj_depth(int::in, code_info::in, code_info::out) is det.\n\n % The number of the last local label allocated.\n %\n:- pred get_label_counter(code_info::in, counter::out) is det.\n\n % Get the flag that indicates whether succip is used or not.\n %\n:- pred get_succip_used(code_info::in, bool::out) is det.\n\n % Get the label layout information created by tracing\n % during code generation.\n %\n:- pred get_layout_info(code_info::in, proc_label_layout_info::out) is det.\n\n:- pred get_proc_trace_events(code_info::in, bool::out) is det.\n\n:- pred set_proc_trace_events(bool::in, code_info::in, code_info::out) is det.\n\n % Get the global static data structures that have\n % been created during code generation for closure layouts.\n %\n:- pred get_closure_layouts(code_info::in, list(closure_proc_id_data)::out)\n is det.\n\n:- pred get_max_reg_in_use_at_trace(code_info::in, int::out, int::out) is det.\n\n:- pred set_max_reg_in_use_at_trace(int::in, int::in,\n code_info::in, code_info::out) is det.\n\n % Get the flag which is true iff the procedure has so far\n % emitted code that creates a temporary nondet stack frame.\n %\n:- pred get_created_temp_frame(code_info::in, bool::out) is det.\n\n:- pred get_static_cell_info(code_info::in, static_cell_info::out) is det.\n\n:- pred set_static_cell_info(static_cell_info::in,\n code_info::in, code_info::out) is det.\n\n:- pred get_alloc_sites(code_info::in, set_tree234(alloc_site_info)::out)\n is det.\n\n:- pred set_alloc_sites(set_tree234(alloc_site_info)::in,\n code_info::in, code_info::out) is det.\n\n:- pred get_used_env_vars(code_info::in, set(string)::out) is det.\n\n:- pred set_used_env_vars(set(string)::in, code_info::in, code_info::out)\n is det.\n\n:- pred get_opt_trail_ops(code_info::in, bool::out) is det.\n\n:- pred get_opt_region_ops(code_info::in, bool::out) is det.\n\n:- pred get_auto_comments(code_info::in, bool::out) is det.\n\n:- pred get_lcmc_null(code_info::in, bool::out) is det.\n\n:- pred get_containing_goal_map(code_info::in, maybe(containing_goal_map)::out)\n is det.\n\n:- pred get_containing_goal_map_det(code_info::in, containing_goal_map::out)\n is det.\n\n:- pred get_const_struct_map(code_info::in, const_struct_map::out) is det.\n\n:- pred add_out_of_line_code(llds_code::in, code_info::in, code_info::out)\n is det.\n\n:- pred get_out_of_line_code(code_info::in, llds_code::out) is det.\n\n%---------------------------------------------------------------------------%\n\n:- implementation.\n\n:- pred get_var_slot_count(code_info::in, int::out) is det.\n\n:- pred set_maybe_trace_info(maybe(trace_info)::in,\n code_info::in, code_info::out) is det.\n\n:- pred get_opt_no_return_calls(code_info::in, bool::out) is det.\n\n:- pred get_zombies(code_info::in, set_of_progvar::out) is det.\n\n:- pred set_zombies(set_of_progvar::in, code_info::in, code_info::out) is det.\n\n:- pred get_var_locn_info(code_info::in, var_locn_info::out) is det.\n\n:- pred set_var_locn_info(var_locn_info::in,\n code_info::in, code_info::out) is det.\n\n:- pred get_temps_in_use(code_info::in, set(lval)::out) is det.\n\n:- pred set_temps_in_use(set(lval)::in, code_info::in, code_info::out) is det.\n\n:- pred get_fail_info(code_info::in, fail_info::out) is det.\n\n:- pred set_fail_info(fail_info::in, code_info::in, code_info::out) is det.\n\n:- pred set_label_counter(counter::in, code_info::in, code_info::out) is det.\n\n:- pred set_succip_used(bool::in, code_info::in, code_info::out) is det.\n\n:- pred set_layout_info(proc_label_layout_info::in,\n code_info::in, code_info::out) is det.\n\n:- pred get_max_temp_slot_count(code_info::in, int::out) is det.\n\n:- pred set_max_temp_slot_count(int::in, code_info::in, code_info::out) is det.\n\n:- pred get_temp_content_map(code_info::in,\n map(lval, slot_contents)::out) is det.\n\n:- pred set_temp_content_map(map(lval, slot_contents)::in,\n code_info::in, code_info::out) is det.\n\n:- pred get_persistent_temps(code_info::in, set(lval)::out) is det.\n\n:- pred set_persistent_temps(set(lval)::in,\n code_info::in, code_info::out) is det.\n\n:- pred set_closure_layouts(list(closure_proc_id_data)::in,\n code_info::in, code_info::out) is det.\n\n:- pred get_closure_seq_counter(code_info::in, counter::out) is det.\n\n:- pred set_closure_seq_counter(counter::in,\n code_info::in, code_info::out) is det.\n\n:- pred set_created_temp_frame(bool::in, code_info::in, code_info::out) is det.\n\n%---------------------------------------------------------------------------%\n\n % The code_info structure has three groups of fields.\n %\n % Some fields are static; they are set when the code_info structure\n % is initialized, and never changed afterwards.\n %\n % Some fields record information about the state of the code generator\n % at a particular location in the HLDS code of the current procedure.\n % At the start of the branched control structure, the code generator\n % remembers the values of these fields, and starts generating code\n % for each branch from the same location-dependent state.\n %\n % Some fields record persistent information that does not depend\n % on a code location. Updates to these fields must remain effective\n % even when the code generator resets its location-dependent state.\n\n:- type code_info\n ---> code_info(\n code_info_static :: code_info_static,\n code_info_loc_dep :: code_info_loc_dep,\n code_info_persistent :: code_info_persistent\n ).\n\n:- type code_info_static\n ---> code_info_static(\n % For the code generation options.\n cis_globals :: globals,\n cis_exprn_opts :: exprn_opts,\n\n % The module_info structure - you just never know\n % when you might need it.\n cis_module_info :: module_info,\n\n % The id of the current predicate.\n cis_pred_id :: pred_id,\n\n % The id of the current procedure.\n cis_proc_id :: proc_id,\n\n % The pred_info for the predicate containing this procedure.\n cis_pred_info :: pred_info,\n\n % The proc_info for this procedure.\n cis_proc_info :: proc_info,\n\n % The proc_label for this procedure.\n cis_proc_label :: proc_label,\n\n % The variables in this procedure.\n cis_varset :: prog_varset,\n\n % The number of stack slots allocated. for storing variables.\n % (Some extra stack slots are used for saving and restoring\n % registers.)\n cis_var_slot_count :: int,\n\n % Information about which stack slots the call sequence number\n % and depth are stored in, provided tracing is switched on.\n cis_maybe_trace_info :: maybe(trace_info),\n\n % Should we optimize calls that cannot return?\n cis_opt_no_resume_calls :: bool,\n\n % Should we emit trail operations?\n cis_emit_trail_ops :: add_trail_ops,\n\n % Should we try to avoid generating trail operations?\n cis_opt_trail_ops :: bool,\n\n % Should we emit region operations?\n cis_emit_region_ops :: add_region_ops,\n\n % Should we try to avoid generating region operations?\n cis_opt_region_ops :: bool,\n\n % The setting of --auto-comments.\n cis_auto_comments :: bool,\n\n % The setting of --optimize-constructor-last-call-null.\n cis_lcmc_null :: bool,\n\n cis_containing_goal_map :: maybe(containing_goal_map),\n\n % Maps the number of an entry in the module's const_struct_db\n % to its rval.\n cis_const_struct_map :: const_struct_map\n ).\n\n:- type code_info_loc_dep\n ---> code_info_loc_dep(\n % Variables that are forward live after this goal.\n cild_forward_live_vars :: set_of_progvar,\n\n % Current insts of the live variables.\n cild_instmap :: instmap,\n\n % Zombie variables; variables that are not forward live\n % but which are protected by an enclosing resume point.\n cild_zombies :: set_of_progvar,\n\n % A map storing the information about the status of each known\n % variable. (Known vars = forward live vars + zombies.)\n cild_var_locn_info :: var_locn_info,\n\n % The set of temporary locations currently in use. These lvals\n % must be all be keys in the map of temporary locations ever\n % used, which is one of the persistent fields below. Any keys\n % in that map which are not in this set are free for reuse.\n cild_temps_in_use :: set(lval),\n\n % Information about how to manage failures.\n cild_fail_info :: fail_info,\n\n % How deep in a nested parallel conjunction we are.\n % This is zero at the beginning of a procedure and\n % is incremented as we enter parallel conjunctions.\n cild_par_conj_depth :: int\n ).\n\n:- type code_info_persistent\n ---> code_info_persistent(\n % Counter for the local labels used by this procedure.\n cip_label_num_src :: counter,\n\n % do we need to store succip?\n cip_store_succip :: bool,\n\n % Information on which values are live and where at which\n % labels, for tracing and/or accurate gc.\n cip_label_info :: proc_label_layout_info,\n\n % Did the procedure have any trace events?\n cip_proc_trace_events :: bool,\n\n % The maximum number of extra temporary stackslots that\n % have been used during the procedure.\n cip_stackslot_max :: int,\n\n % The temporary locations that have ever been used on the\n % stack, and what they contain. Once we have used a stack slot\n % to store e.g. a ticket, we never reuse that slot to hold\n % something else, e.g. a saved hp. This policy prevents us\n % from making such conflicting choices in parallel branches,\n % which would make it impossible to describe to gc what the\n % slot contains after the end of the branched control\n % structure.\n cip_temp_contents :: map(lval, slot_contents),\n\n % Stack slot locations that should not be released even when\n % the code generator resets its location-dependent state.\n cip_persistent_temps :: set(lval),\n\n cip_closure_layout_seq :: counter,\n\n % Closure layout structures generated by this procedure.\n cip_closure_layouts :: list(closure_proc_id_data),\n\n % At each call to MR_trace, we compute the highest rN and fN\n % registers that contain useful values. These slot contain the\n % maximum of these highest values. Therefore at all calls to\n % MR_trace in the procedure, we need only save the registers\n % whose numbers are equal to or smaller than this field.\n % This slot contains -1 if tracing is not enabled.\n cip_max_reg_r_used :: int,\n cip_max_reg_f_used :: int,\n\n % True iff the procedure has created one or more temporary\n % nondet frames.\n cip_created_temp_frame :: bool,\n\n cip_static_cell_info :: static_cell_info,\n\n cip_alloc_sites :: set_tree234(alloc_site_info),\n\n cip_used_env_vars :: set(string),\n\n % A counter and table for allocating and maintaining slots\n % where string IDs will be placed at runtime for threadscope\n % profiling. The actual string IDs are allocated at runtime\n % and their IDs are placed in an array slot which can be\n % referred to statically.\n cip_ts_string_table_size :: int,\n cip_ts_rev_string_table :: list(string),\n\n % Code that is part of this procedure, but that can be placed\n % after the procedure without a cache penalty. For example,\n % code that is spawned off by loop control is placed here.\n cip_out_of_line_code :: llds_code\n ).\n\n%---------------------------------------------------------------------------%\n\ncode_info_init(SaveSuccip, Globals, PredId, ProcId, PredInfo, ProcInfo,\n FollowVars, ModuleInfo, StaticCellInfo, ConstStructMap, ResumePoint,\n TraceSlotInfo, MaybeContainingGoalMap,\n TSRevStringTable, TSStringTableSize, CodeInfo) :-\n ProcLabel = make_proc_label(ModuleInfo, PredId, ProcId),\n proc_info_get_initial_instmap(ProcInfo, ModuleInfo, InstMap),\n proc_info_get_liveness_info(ProcInfo, Liveness),\n CodeModel = proc_info_interface_code_model(ProcInfo),\n build_input_arg_list(ProcInfo, ArgList),\n proc_info_get_varset(ProcInfo, VarSet),\n proc_info_get_vartypes(ProcInfo, VarTypes),\n proc_info_get_stack_slots(ProcInfo, StackSlots),\n ExprnOpts = init_exprn_opts(Globals),\n globals.lookup_bool_option(Globals, use_float_registers, UseFloatRegs),\n (\n UseFloatRegs = yes,\n FloatRegType = reg_f\n ;\n UseFloatRegs = no,\n FloatRegType = reg_r\n ),\n globals.get_trace_level(Globals, TraceLevel),\n (\n eff_trace_level_is_none(ModuleInfo, PredInfo, ProcInfo, TraceLevel)\n = no\n ->\n trace_fail_vars(ModuleInfo, ProcInfo, FailVars),\n MaybeFailVars = yes(FailVars),\n set_of_var.union(Liveness, FailVars, EffLiveness)\n ;\n MaybeFailVars = no,\n EffLiveness = Liveness\n ),\n init_var_locn_state(ArgList, EffLiveness, VarSet, VarTypes, FloatRegType,\n StackSlots, FollowVars, VarLocnInfo),\n stack.init(ResumePoints),\n globals.lookup_bool_option(Globals, allow_hijacks, AllowHijack),\n (\n AllowHijack = yes,\n Hijack = allowed\n ;\n AllowHijack = no,\n Hijack = not_allowed\n ),\n DummyFailInfo = fail_info(ResumePoints, resume_point_unknown,\n may_be_different, not_inside_non_condition, Hijack),\n map.init(TempContentMap),\n set.init(PersistentTemps),\n set.init(TempsInUse),\n Zombies = set_of_var.init,\n map.init(LayoutMap),\n max_var_slot(StackSlots, VarSlotMax),\n trace_reserved_slots(ModuleInfo, PredInfo, ProcInfo, Globals,\n FixedSlots, _),\n int.max(VarSlotMax, FixedSlots, SlotMax),\n globals.lookup_bool_option(Globals, opt_no_return_calls,\n OptNoReturnCalls),\n globals.lookup_bool_option(Globals, use_trail, UseTrail),\n globals.lookup_bool_option(Globals, disable_trail_ops, DisableTrailOps),\n (\n UseTrail = yes,\n DisableTrailOps = no\n ->\n EmitTrailOps = add_trail_ops\n ;\n EmitTrailOps = do_not_add_trail_ops\n ),\n globals.lookup_bool_option(Globals, optimize_trail_usage, OptTrailOps),\n globals.lookup_bool_option(Globals, optimize_region_ops, OptRegionOps),\n globals.lookup_bool_option(Globals, region_analysis, UseRegions),\n (\n UseRegions = yes,\n EmitRegionOps = add_region_ops\n ;\n UseRegions = no,\n EmitRegionOps = do_not_add_region_ops\n ),\n globals.lookup_bool_option(Globals, auto_comments, AutoComments),\n globals.lookup_bool_option(Globals, optimize_constructor_last_call_null,\n LCMCNull),\n CodeInfo0 = code_info(\n code_info_static(\n Globals,\n ExprnOpts,\n ModuleInfo,\n PredId,\n ProcId,\n PredInfo,\n ProcInfo,\n ProcLabel,\n VarSet,\n SlotMax,\n no,\n OptNoReturnCalls,\n EmitTrailOps,\n OptTrailOps,\n EmitRegionOps,\n OptRegionOps,\n AutoComments,\n LCMCNull,\n MaybeContainingGoalMap,\n ConstStructMap\n ),\n code_info_loc_dep(\n Liveness,\n InstMap,\n Zombies,\n VarLocnInfo,\n TempsInUse,\n DummyFailInfo, % init_fail_info will override this dummy value\n 0 % nested parallel conjunction depth\n ),\n code_info_persistent(\n counter.init(1),\n SaveSuccip,\n LayoutMap,\n no,\n 0,\n TempContentMap,\n PersistentTemps,\n counter.init(1),\n [],\n -1,\n -1,\n no,\n StaticCellInfo,\n set_tree234.init,\n set.init,\n TSStringTableSize,\n TSRevStringTable,\n cord.empty\n )\n ),\n init_maybe_trace_info(TraceLevel, Globals, ModuleInfo,\n PredInfo, ProcInfo, TraceSlotInfo, CodeInfo0, CodeInfo1),\n init_fail_info(CodeModel, MaybeFailVars, ResumePoint,\n CodeInfo1, CodeInfo).\n\n:- func init_exprn_opts(globals) = exprn_opts.\n\ninit_exprn_opts(Globals) = ExprnOpts :-\n globals.lookup_bool_option(Globals, gcc_non_local_gotos, OptNLG),\n (\n OptNLG = yes,\n NLG = have_non_local_gotos\n ;\n OptNLG = no,\n NLG = do_not_have_non_local_gotos\n ),\n globals.lookup_bool_option(Globals, asm_labels, OptASM),\n (\n OptASM = yes,\n ASM = have_asm_labels\n ;\n OptASM = no,\n ASM = do_not_have_asm_labels\n ),\n globals.lookup_bool_option(Globals, static_ground_cells, OptSGCell),\n (\n OptSGCell = yes,\n SGCell = have_static_ground_cells\n ;\n OptSGCell = no,\n SGCell = do_not_have_static_ground_cells\n ),\n globals.lookup_bool_option(Globals, unboxed_float, OptUBF),\n (\n OptUBF = yes,\n UBF = have_unboxed_floats\n ;\n OptUBF = no,\n UBF = do_not_have_unboxed_floats\n ),\n globals.lookup_bool_option(Globals, use_float_registers, OptFloatRegs),\n (\n OptFloatRegs = yes,\n UseFloatRegs = use_float_registers\n ;\n OptFloatRegs = no,\n UseFloatRegs = do_not_use_float_registers\n ),\n globals.lookup_bool_option(Globals, static_ground_floats, OptSGFloat),\n (\n OptSGFloat = yes,\n SGFloat = have_static_ground_floats\n ;\n OptSGFloat = no,\n SGFloat = do_not_have_static_ground_floats\n ),\n globals.lookup_bool_option(Globals, static_code_addresses,\n OptStaticCodeAddr),\n (\n OptStaticCodeAddr = yes,\n StaticCodeAddrs = have_static_code_addresses\n ;\n OptStaticCodeAddr = no,\n StaticCodeAddrs = do_not_have_static_code_addresses\n ),\n ExprnOpts = exprn_opts(NLG, ASM, UBF, UseFloatRegs, SGCell, SGFloat,\n StaticCodeAddrs).\n\n:- pred init_maybe_trace_info(trace_level::in, globals::in,\n module_info::in, pred_info::in, proc_info::in, trace_slot_info::out,\n code_info::in, code_info::out) is det.\n\ninit_maybe_trace_info(TraceLevel, Globals, ModuleInfo, PredInfo,\n ProcInfo, TraceSlotInfo, !CI) :-\n (\n eff_trace_level_is_none(ModuleInfo, PredInfo, ProcInfo, TraceLevel)\n = no\n ->\n proc_info_get_has_tail_call_events(ProcInfo, HasTailCallEvents),\n (\n HasTailCallEvents = tail_call_events,\n get_next_label(TailRecLabel, !CI),\n MaybeTailRecLabel = yes(TailRecLabel)\n ;\n HasTailCallEvents = no_tail_call_events,\n MaybeTailRecLabel = no\n ),\n trace_setup(ModuleInfo, PredInfo, ProcInfo, Globals, MaybeTailRecLabel,\n TraceSlotInfo, TraceInfo, !CI),\n set_maybe_trace_info(yes(TraceInfo), !CI)\n ;\n TraceSlotInfo = trace_slot_info(no, no, no, no, no, no)\n ).\n\n%---------------------------------------------------------------------------%\n\nget_globals(CI, CI ^ code_info_static ^ cis_globals).\nget_module_info(CI, CI ^ code_info_static ^ cis_module_info).\nget_exprn_opts(CI, CI ^ code_info_static ^ cis_exprn_opts).\nget_pred_id(CI, CI ^ code_info_static ^ cis_pred_id).\nget_proc_id(CI, CI ^ code_info_static ^ cis_proc_id).\nget_pred_info(CI, CI ^ code_info_static ^ cis_pred_info).\nget_proc_info(CI, CI ^ code_info_static ^ cis_proc_info).\nget_varset(CI, CI ^ code_info_static ^ cis_varset).\nget_var_slot_count(CI, CI ^ code_info_static ^ cis_var_slot_count).\nget_maybe_trace_info(CI, CI ^ code_info_static ^ cis_maybe_trace_info).\nget_opt_no_return_calls(CI, CI ^ code_info_static ^ cis_opt_no_resume_calls).\nget_emit_trail_ops(CI, CI ^ code_info_static ^ cis_emit_trail_ops).\nget_opt_trail_ops(CI, CI ^ code_info_static ^ cis_opt_trail_ops).\nget_emit_region_ops(CI, CI ^ code_info_static ^ cis_emit_region_ops).\nget_opt_region_ops(CI, CI ^ code_info_static ^ cis_opt_region_ops).\nget_auto_comments(CI, CI ^ code_info_static ^ cis_auto_comments).\nget_lcmc_null(CI, CI ^ code_info_static ^ cis_lcmc_null).\nget_containing_goal_map(CI, CI ^ code_info_static ^ cis_containing_goal_map).\nget_const_struct_map(CI, CI ^ code_info_static ^ cis_const_struct_map).\nget_forward_live_vars(CI, CI ^ code_info_loc_dep ^ cild_forward_live_vars).\nget_instmap(CI, CI ^ code_info_loc_dep ^ cild_instmap).\nget_zombies(CI, CI ^ code_info_loc_dep ^ cild_zombies).\nget_var_locn_info(CI, CI ^ code_info_loc_dep ^ cild_var_locn_info).\nget_temps_in_use(CI, CI ^ code_info_loc_dep ^ cild_temps_in_use).\nget_fail_info(CI, CI ^ code_info_loc_dep ^ cild_fail_info).\nget_par_conj_depth(CI, CI ^ code_info_loc_dep ^ cild_par_conj_depth).\nget_label_counter(CI, CI ^ code_info_persistent ^ cip_label_num_src).\nget_succip_used(CI, CI ^ code_info_persistent ^ cip_store_succip).\nget_layout_info(CI, CI ^ code_info_persistent ^ cip_label_info).\nget_proc_trace_events(CI, CI ^ code_info_persistent ^ cip_proc_trace_events).\nget_max_temp_slot_count(CI, CI ^ code_info_persistent ^ cip_stackslot_max).\nget_temp_content_map(CI, CI ^ code_info_persistent ^ cip_temp_contents).\nget_persistent_temps(CI, CI ^ code_info_persistent ^ cip_persistent_temps).\nget_closure_seq_counter(CI,\n CI ^ code_info_persistent ^ cip_closure_layout_seq).\nget_closure_layouts(CI, CI ^ code_info_persistent ^ cip_closure_layouts).\nget_max_reg_in_use_at_trace(CI, MaxRegR, MaxRegF) :-\n MaxRegR = CI ^ code_info_persistent ^ cip_max_reg_r_used,\n MaxRegF = CI ^ code_info_persistent ^ cip_max_reg_f_used.\nget_created_temp_frame(CI, CI ^ code_info_persistent ^ cip_created_temp_frame).\nget_static_cell_info(CI, CI ^ code_info_persistent ^ cip_static_cell_info).\nget_alloc_sites(CI, CI ^ code_info_persistent ^ cip_alloc_sites).\nget_used_env_vars(CI, CI ^ code_info_persistent ^ cip_used_env_vars).\n\n%---------------------------------------------------------------------------%\n\nset_maybe_trace_info(TI, CI,\n CI ^ code_info_static ^ cis_maybe_trace_info := TI).\nset_forward_live_vars(LV, CI,\n CI ^ code_info_loc_dep ^ cild_forward_live_vars := LV).\nset_instmap(IM, CI, CI ^ code_info_loc_dep ^ cild_instmap := IM).\nset_zombies(Zs, CI, CI ^ code_info_loc_dep ^ cild_zombies := Zs).\nset_var_locn_info(EI, CI, CI ^ code_info_loc_dep ^ cild_var_locn_info := EI).\nset_temps_in_use(TI, CI, CI ^ code_info_loc_dep ^ cild_temps_in_use := TI).\nset_fail_info(FI, CI, CI ^ code_info_loc_dep ^ cild_fail_info := FI).\nset_par_conj_depth(N, CI, CI ^ code_info_loc_dep ^ cild_par_conj_depth := N).\nset_label_counter(LC, CI, CI ^ code_info_persistent ^ cip_label_num_src := LC).\nset_succip_used(SU, CI, CI ^ code_info_persistent ^ cip_store_succip := SU).\nset_layout_info(LI, CI, CI ^ code_info_persistent ^ cip_label_info := LI).\nset_proc_trace_events(PTE, CI,\n CI ^ code_info_persistent ^ cip_proc_trace_events := PTE).\nset_max_temp_slot_count(TM, CI,\n CI ^ code_info_persistent ^ cip_stackslot_max := TM).\nset_temp_content_map(CM, CI,\n CI ^ code_info_persistent ^ cip_temp_contents := CM).\nset_persistent_temps(PT, CI,\n CI ^ code_info_persistent ^ cip_persistent_temps := PT).\nset_closure_seq_counter(CLS, CI,\n CI ^ code_info_persistent ^ cip_closure_layout_seq := CLS).\nset_closure_layouts(CG, CI,\n CI ^ code_info_persistent ^ cip_closure_layouts := CG).\nset_max_reg_in_use_at_trace(MR, MF, !CI) :-\n !CI ^ code_info_persistent ^ cip_max_reg_r_used := MR,\n !CI ^ code_info_persistent ^ cip_max_reg_f_used := MF.\nset_created_temp_frame(MR, CI,\n CI ^ code_info_persistent ^ cip_created_temp_frame := MR).\nset_static_cell_info(SCI, CI,\n CI ^ code_info_persistent ^ cip_static_cell_info := SCI).\nset_alloc_sites(ASI, CI,\n CI ^ code_info_persistent ^ cip_alloc_sites := ASI).\nset_used_env_vars(UEV, CI,\n CI ^ code_info_persistent ^ cip_used_env_vars := UEV).\n\nget_containing_goal_map_det(CI, ContainingGoalMap) :-\n get_containing_goal_map(CI, MaybeContainingGoalMap),\n (\n MaybeContainingGoalMap = yes(ContainingGoalMap)\n ;\n MaybeContainingGoalMap = no,\n unexpected($module, $pred, \"no map\")\n ).\n\nadd_out_of_line_code(NewCode, !CI) :-\n Code0 = !.CI ^ code_info_persistent ^ cip_out_of_line_code,\n Code = Code0 ++ NewCode,\n !CI ^ code_info_persistent ^ cip_out_of_line_code := Code.\n\nget_out_of_line_code(CI, CI ^ code_info_persistent ^ cip_out_of_line_code).\n\n%---------------------------------------------------------------------------%\n%---------------------------------------------------------------------------%\n\n % Submodule for simple wrappers around access predicates.\n\n:- interface.\n\n % Get the hlds mapping from variables to stack slots\n %\n:- pred get_stack_slots(code_info::in, stack_slots::out) is det.\n\n % Get the table that contains advice about where\n % variables should be put.\n %\n:- pred get_follow_var_map(code_info::in, abs_follow_vars_map::out) is det.\n\n % Get the integer that gives the number of the next\n % non-reserved register.\n %\n:- pred get_next_non_reserved(code_info::in, reg_type::in, int::out) is det.\n\n % Set the table that contains advice about where\n % variables should be put.\n:- pred set_follow_vars(abs_follow_vars::in,\n code_info::in, code_info::out) is det.\n\n % pre_goal_update(GoalInfo, HasSubGoal, OldCodeInfo, NewCodeInfo)\n % updates OldCodeInfo to produce NewCodeInfo with the changes\n % specified by GoalInfo.\n %\n:- pred pre_goal_update(hlds_goal_info::in, has_subgoals::in,\n code_info::in, code_info::out) is det.\n\n % post_goal_update(GoalInfo, OldCodeInfo, NewCodeInfo)\n % updates OldCodeInfo to produce NewCodeInfo with the changes described\n % by GoalInfo.\n %\n:- pred post_goal_update(hlds_goal_info::in,\n code_info::in, code_info::out) is det.\n\n % Find out whether the body of the current procedure should use\n % typeinfo liveness.\n %\n:- func body_typeinfo_liveness(code_info) = bool.\n\n % Find out the type of the given variable.\n %\n:- func variable_type(code_info, prog_var) = mer_type.\n\n:- func variable_is_of_dummy_type(code_info, prog_var) = is_dummy_type.\n\n % Compute the principal type constructor of the given type, and return the\n % definition of this type constructor, if it has one (some type\n % constructors are built in, and some are hidden behind abstraction\n % barriers).\n %\n:- pred search_type_defn(code_info::in, mer_type::in, hlds_type_defn::out) is\n semidet.\n\n % Compute the principal type constructor of the given type, and return the\n % definition of this type constructor. Abort if it doesn't have a\n % definition (e.g. because it is a builtin).\n %\n:- func lookup_type_defn(code_info, mer_type) = hlds_type_defn.\n\n:- func lookup_cheaper_tag_test(code_info, mer_type) = maybe_cheaper_tag_test.\n\n:- func filter_region_vars(code_info, set_of_progvar) = set_of_progvar.\n\n % Get the code model of the current procedure.\n %\n:- func get_proc_model(code_info) = code_model.\n\n % Get the list of the head variables of the current procedure.\n %\n:- func get_headvars(code_info) = list(prog_var).\n\n % Get the call argument information for the current procedure\n %\n:- func get_arginfo(code_info) = list(arg_info).\n\n % Get the call argument info for a given mode of a given predicate\n %\n:- func get_pred_proc_arginfo(code_info, pred_id, proc_id) = list(arg_info).\n\n % Get the set of variables currently needed by the resume\n % points of enclosing goals.\n %\n:- func current_resume_point_vars(code_info) = set_of_progvar.\n\n:- func variable_name(code_info, prog_var) = string.\n\n % Create a code address which holds the address of the specified\n % procedure.\n % The fourth argument should be `no' if the the caller wants the\n % returned address to be valid from everywhere in the program.\n % If being valid from within the current procedure is enough,\n % this argument should be `yes' wrapped around the value of the\n % --procs-per-c-function option and the current procedure id.\n % Using an address that is only valid from within the current\n % procedure may make jumps more efficient.\n %\n % If the procs_per_c_function option tells us to put more than one\n % procedure into each C function, but not all procedures in the module\n % are in one function, then we would like to be able to use the\n % fast form of reference to a procedure for references not only from\n % within the same procedure but also from other procedures within\n % the same C function. However, at the time of code generation,\n % we do not yet know which procedures will be put into the same\n % C functions, and so we cannot do this.\n %\n:- func make_proc_entry_label(code_info, module_info, pred_id, proc_id, bool)\n = code_addr.\n\n % Generate the next local label in sequence.\n %\n:- pred get_next_label(label::out, code_info::in, code_info::out)\n is det.\n\n % Note that the succip slot is used, and thus cannot be optimized away.\n %\n:- pred succip_is_used(code_info::in, code_info::out) is det.\n\n:- pred add_trace_layout_for_label(label::in, term.context::in, trace_port::in,\n bool::in, forward_goal_path::in, maybe(user_event_info)::in,\n layout_label_info::in, code_info::in, code_info::out) is det.\n\n:- pred get_cur_proc_label(code_info::in, proc_label::out) is det.\n\n:- pred get_next_closure_seq_no(int::out,\n code_info::in, code_info::out) is det.\n\n:- pred add_closure_layout(closure_proc_id_data::in,\n code_info::in, code_info::out) is det.\n\n:- pred add_threadscope_string(string::in, int::out,\n code_info::in, code_info::out) is det.\n\n:- pred get_threadscope_rev_string_table(code_info::in,\n list(string)::out, int::out) is det.\n\n:- pred add_scalar_static_cell(list(typed_rval)::in,\n data_id::out, code_info::in, code_info::out) is det.\n\n:- pred add_scalar_static_cell_natural_types(list(rval)::in,\n data_id::out, code_info::in, code_info::out) is det.\n\n:- pred add_vector_static_cell(list(llds_type)::in, list(list(rval))::in,\n data_id::out, code_info::in, code_info::out) is det.\n\n:- pred add_alloc_site_info(prog_context::in, string::in, int::in,\n alloc_site_id::out, code_info::in, code_info::out) is det.\n\n%---------------------------------------------------------------------------%\n\n:- implementation.\n\n:- pred add_resume_layout_for_label(label::in,\n layout_label_info::in, code_info::in, code_info::out) is det.\n\nget_stack_slots(CI, StackSlots) :-\n get_var_locn_info(CI, VarLocnInfo),\n var_locn_get_stack_slots(VarLocnInfo, StackSlots).\n\nget_follow_var_map(CI, FollowVarMap) :-\n get_var_locn_info(CI, VarLocnInfo),\n var_locn_get_follow_var_map(VarLocnInfo, FollowVarMap).\n\nget_next_non_reserved(CI, RegType, NextNonReserved) :-\n get_var_locn_info(CI, VarLocnInfo),\n var_locn_get_next_non_reserved(VarLocnInfo, RegType, NextNonReserved).\n\nset_follow_vars(FollowVars, !CI) :-\n get_var_locn_info(!.CI, VarLocnInfo0),\n var_locn_set_follow_vars(FollowVars, VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\n%-----------------------------------------------------------------------------%\n\npre_goal_update(GoalInfo, HasSubGoals, !CI) :-\n % The liveness pass puts resume_point annotations on some kinds\n % of goals. The parts of the code generator that handle those kinds\n % of goals should handle the resume point annotation as well;\n % when they do, they remove the annotation. The following code\n % is a sanity check to make sure that this has in fact been done.\n goal_info_get_resume_point(GoalInfo, ResumePoint),\n (\n ResumePoint = no_resume_point\n ;\n ResumePoint = resume_point(_, _),\n unexpected($module, $pred, \"pre_goal_update with resume point\")\n ),\n goal_info_get_follow_vars(GoalInfo, MaybeFollowVars),\n (\n MaybeFollowVars = yes(FollowVars),\n set_follow_vars(FollowVars, !CI)\n ;\n MaybeFollowVars = no\n ),\n % NOTE: we must be careful to apply deaths before births\n goal_info_get_pre_deaths(GoalInfo, PreDeaths),\n rem_forward_live_vars(PreDeaths, !CI),\n maybe_make_vars_forward_dead(PreDeaths, no, !CI),\n goal_info_get_pre_births(GoalInfo, PreBirths),\n add_forward_live_vars(PreBirths, !CI),\n (\n HasSubGoals = does_not_have_subgoals,\n goal_info_get_post_deaths(GoalInfo, PostDeaths),\n rem_forward_live_vars(PostDeaths, !CI)\n ;\n HasSubGoals = has_subgoals\n ).\n\npost_goal_update(GoalInfo, !CI) :-\n % note: we must be careful to apply deaths before births\n goal_info_get_post_deaths(GoalInfo, PostDeaths),\n rem_forward_live_vars(PostDeaths, !CI),\n maybe_make_vars_forward_dead(PostDeaths, no, !CI),\n goal_info_get_post_births(GoalInfo, PostBirths),\n add_forward_live_vars(PostBirths, !CI),\n make_vars_forward_live(PostBirths, !CI),\n InstMapDelta = goal_info_get_instmap_delta(GoalInfo),\n get_instmap(!.CI, InstMap0),\n instmap.apply_instmap_delta(InstMap0, InstMapDelta, InstMap),\n set_instmap(InstMap, !CI).\n\n%---------------------------------------------------------------------------%\n\nbody_typeinfo_liveness(CI) = TypeInfoLiveness :-\n get_module_info(CI, ModuleInfo),\n get_pred_id(CI, PredId),\n module_info_pred_info(ModuleInfo, PredId, PredInfo),\n get_globals(CI, Globals),\n body_should_use_typeinfo_liveness(PredInfo, Globals, TypeInfoLiveness).\n\nget_var_types(CI) = VarTypes :-\n get_proc_info(CI, ProcInfo),\n proc_info_get_vartypes(ProcInfo, VarTypes).\n\nvariable_type(CI, Var) = Type :-\n lookup_var_type(get_var_types(CI), Var, Type).\n\nvariable_is_of_dummy_type(CI, Var) = IsDummy :-\n VarType = variable_type(CI, Var),\n get_module_info(CI, ModuleInfo),\n IsDummy = check_dummy_type(ModuleInfo, VarType).\n\nsearch_type_defn(CI, Type, TypeDefn) :-\n get_module_info(CI, ModuleInfo),\n type_to_ctor_det(Type, TypeCtor),\n module_info_get_type_table(ModuleInfo, TypeTable),\n search_type_ctor_defn(TypeTable, TypeCtor, TypeDefn).\n\nlookup_type_defn(CI, Type) = TypeDefn :-\n ( search_type_defn(CI, Type, TypeDefnPrime) ->\n TypeDefn = TypeDefnPrime\n ;\n unexpected($module, $pred, \"type ctor has no definition\")\n ).\n\nlookup_cheaper_tag_test(CI, Type) = CheaperTagTest :-\n (\n search_type_defn(CI, Type, TypeDefn),\n get_type_defn_body(TypeDefn, TypeBody),\n TypeBody = hlds_du_type(_, _, CheaperTagTestPrime, _, _, _, _, _, _)\n ->\n CheaperTagTest = CheaperTagTestPrime\n ;\n CheaperTagTest = no_cheaper_tag_test\n ).\n\nfilter_region_vars(CI, ForwardLiveVarsBeforeGoal) = RegionVars :-\n VarTypes = code_info.get_var_types(CI),\n RegionVars = set_of_var.filter(is_region_var(VarTypes),\n ForwardLiveVarsBeforeGoal).\n\n%---------------------------------------------------------------------------%\n\nget_proc_model(CI) = CodeModel :-\n get_proc_info(CI, ProcInfo),\n CodeModel = proc_info_interface_code_model(ProcInfo).\n\nget_headvars(CI) = HeadVars :-\n get_module_info(CI, ModuleInfo),\n get_pred_id(CI, PredId),\n get_proc_id(CI, ProcId),\n module_info_pred_proc_info(ModuleInfo, PredId, ProcId, _, ProcInfo),\n proc_info_get_headvars(ProcInfo, HeadVars).\n\nget_arginfo(CI) = ArgInfo :-\n get_pred_id(CI, PredId),\n get_proc_id(CI, ProcId),\n ArgInfo = get_pred_proc_arginfo(CI, PredId, ProcId).\n\nget_pred_proc_arginfo(CI, PredId, ProcId) = ArgInfo :-\n get_module_info(CI, ModuleInfo),\n module_info_pred_proc_info(ModuleInfo, PredId, ProcId, _, ProcInfo),\n proc_info_arg_info(ProcInfo, ArgInfo).\n\ncurrent_resume_point_vars(CI) = ResumeVars :-\n get_fail_info(CI, FailInfo),\n FailInfo = fail_info(ResumePointStack, _, _, _, _),\n stack.det_top(ResumePointStack, ResumePointInfo),\n pick_first_resume_point(ResumePointInfo, ResumeMap, _),\n map.keys(ResumeMap, ResumeMapVarList),\n ResumeVars = set_of_var.list_to_set(ResumeMapVarList).\n\nvariable_name(CI, Var) = Name :-\n get_varset(CI, Varset),\n varset.lookup_name(Varset, Var, Name).\n\n%---------------------------------------------------------------------------%\n\nmake_proc_entry_label(CI, ModuleInfo, PredId, ProcId, Immed0) = CodeAddr :-\n (\n Immed0 = no,\n Immed = no\n ;\n Immed0 = yes,\n get_globals(CI, Globals),\n globals.lookup_int_option(Globals, procs_per_c_function, ProcsPerFunc),\n get_pred_id(CI, CurPredId),\n get_proc_id(CI, CurProcId),\n Immed = yes(ProcsPerFunc - proc(CurPredId, CurProcId))\n ),\n CodeAddr = make_entry_label(ModuleInfo, PredId, ProcId, Immed).\n\nget_next_label(Label, !CI) :-\n get_cur_proc_label(!.CI, ProcLabel),\n get_label_counter(!.CI, C0),\n counter.allocate(N, C0, C),\n set_label_counter(C, !CI),\n Label = internal_label(N, ProcLabel).\n\nsuccip_is_used(!CI) :-\n set_succip_used(yes, !CI).\n\nadd_trace_layout_for_label(Label, Context, Port, IsHidden, GoalPath,\n MaybeSolverEventInfo, Layout, !CI) :-\n get_layout_info(!.CI, Internals0),\n Exec = yes(trace_port_layout_info(Context, Port, IsHidden, GoalPath,\n MaybeSolverEventInfo, Layout)),\n (\n Label = internal_label(LabelNum, _)\n ;\n Label = entry_label(_, _),\n unexpected($module, $pred, \"entry\")\n ),\n ( map.search(Internals0, LabelNum, Internal0) ->\n Internal0 = internal_layout_info(Exec0, Resume, Return),\n (\n Exec0 = no\n ;\n Exec0 = yes(_),\n unexpected($module, $pred, \"already known label\")\n ),\n Internal = internal_layout_info(Exec, Resume, Return),\n map.det_update(LabelNum, Internal, Internals0, Internals)\n ;\n Internal = internal_layout_info(Exec, no, no),\n map.det_insert(LabelNum, Internal, Internals0, Internals)\n ),\n set_layout_info(Internals, !CI).\n\nadd_resume_layout_for_label(Label, LayoutInfo, !CI) :-\n get_layout_info(!.CI, Internals0),\n Resume = yes(LayoutInfo),\n (\n Label = internal_label(LabelNum, _)\n ;\n Label = entry_label(_, _),\n unexpected($module, $pred, \"entry\")\n ),\n ( map.search(Internals0, LabelNum, Internal0) ->\n Internal0 = internal_layout_info(Exec, Resume0, Return),\n (\n Resume0 = no\n ;\n Resume0 = yes(_),\n unexpected($module, $pred, \"already known label\")\n ),\n Internal = internal_layout_info(Exec, Resume, Return),\n map.det_update(LabelNum, Internal, Internals0, Internals)\n ;\n Internal = internal_layout_info(no, Resume, no),\n map.det_insert(LabelNum, Internal, Internals0, Internals)\n ),\n set_layout_info(Internals, !CI).\n\n:- pred get_active_temps_data(code_info::in,\n assoc_list(lval, slot_contents)::out) is det.\n\nget_active_temps_data(CI, Temps) :-\n get_temps_in_use(CI, TempsInUse),\n get_temp_content_map(CI, TempContentMap),\n map.select(TempContentMap, TempsInUse, TempsInUseContentMap),\n map.to_assoc_list(TempsInUseContentMap, Temps).\n\nget_cur_proc_label(CI, ProcLabel) :-\n ProcLabel = CI ^ code_info_static ^ cis_proc_label.\n\nget_next_closure_seq_no(SeqNo, !CI) :-\n get_closure_seq_counter(!.CI, C0),\n counter.allocate(SeqNo, C0, C),\n set_closure_seq_counter(C, !CI).\n\nadd_closure_layout(ClosureLayout, !CI) :-\n get_closure_layouts(!.CI, ClosureLayouts),\n set_closure_layouts([ClosureLayout | ClosureLayouts], !CI).\n\nadd_threadscope_string(String, SlotNum, !CI) :-\n Size0 = !.CI ^ code_info_persistent ^ cip_ts_string_table_size,\n RevTable0 = !.CI ^ code_info_persistent ^ cip_ts_rev_string_table,\n SlotNum = Size0,\n Size = Size0 + 1,\n RevTable = [String | RevTable0],\n !CI ^ code_info_persistent ^ cip_ts_string_table_size := Size,\n !CI ^ code_info_persistent ^ cip_ts_rev_string_table := RevTable.\n\nget_threadscope_rev_string_table(CI, RevTable, TableSize) :-\n RevTable = CI ^ code_info_persistent ^ cip_ts_rev_string_table,\n TableSize = CI ^ code_info_persistent ^ cip_ts_string_table_size.\n\nadd_scalar_static_cell(RvalsTypes, DataAddr, !CI) :-\n get_static_cell_info(!.CI, StaticCellInfo0),\n global_data.add_scalar_static_cell(RvalsTypes, DataAddr,\n StaticCellInfo0, StaticCellInfo),\n set_static_cell_info(StaticCellInfo, !CI).\n\nadd_scalar_static_cell_natural_types(Rvals, DataAddr, !CI) :-\n get_static_cell_info(!.CI, StaticCellInfo0),\n global_data.add_scalar_static_cell_natural_types(Rvals, DataAddr,\n StaticCellInfo0, StaticCellInfo),\n set_static_cell_info(StaticCellInfo, !CI).\n\nadd_vector_static_cell(Types, Vector, DataAddr, !CI) :-\n get_static_cell_info(!.CI, StaticCellInfo0),\n global_data.add_vector_static_cell(Types, Vector, DataAddr,\n StaticCellInfo0, StaticCellInfo),\n set_static_cell_info(StaticCellInfo, !CI).\n\nadd_alloc_site_info(Context, Type, Size, AllocId, !CI) :-\n get_cur_proc_label(!.CI, ProcLabel),\n AllocSite = alloc_site_info(ProcLabel, Context, Type, Size),\n AllocId = alloc_site_id(AllocSite),\n get_alloc_sites(!.CI, AllocSites0),\n set_tree234.insert(AllocSite, AllocSites0, AllocSites),\n set_alloc_sites(AllocSites, !CI).\n\n%---------------------------------------------------------------------------%\n%---------------------------------------------------------------------------%\n\n % Submodule for handling branched control structures.\n\n:- interface.\n\n:- type position_info.\n:- type branch_end_info.\n\n:- type branch_end == maybe(branch_end_info).\n\n:- pred remember_position(code_info::in, position_info::out) is det.\n\n:- pred reset_to_position(position_info::in,\n code_info::in, code_info::out) is det.\n\n:- pred reset_resume_known(position_info::in,\n code_info::in, code_info::out) is det.\n\n:- pred generate_branch_end(abs_store_map::in, branch_end::in, branch_end::out,\n llds_code::out, code_info::in, code_info::out) is det.\n\n:- pred after_all_branches(abs_store_map::in, branch_end::in,\n code_info::in, code_info::out) is det.\n\n:- pred save_hp_in_branch(llds_code::out, lval::out,\n position_info::in, position_info::out, code_info::in, code_info::out)\n is det.\n\n:- implementation.\n\n:- type position_info\n ---> position_info(\n % The location-dependent part of the code_info\n % at a given position.\n code_info_loc_dep\n ).\n\n:- type branch_end_info\n ---> branch_end_info(\n % The code_info at the end of a branch.\n code_info\n ).\n\n:- func pos_get_fail_info(position_info) = fail_info.\n\npos_get_fail_info(position_info(LocDep)) = LocDep ^ cild_fail_info.\n\nremember_position(CI, position_info(CI ^ code_info_loc_dep)).\n\nreset_to_position(position_info(LocDep), CurCI, NextCI) :-\n CurCI = code_info(Static, _, Persistent),\n NextCI0 = code_info(Static, LocDep, Persistent),\n\n get_persistent_temps(NextCI0, PersistentTemps),\n get_temps_in_use(NextCI0, TempsInUse0),\n set.union(PersistentTemps, TempsInUse0, TempsInUse),\n set_temps_in_use(TempsInUse, NextCI0, NextCI).\n\nreset_resume_known(BranchStart, !CI) :-\n BranchStartFailInfo = pos_get_fail_info(BranchStart),\n BranchStartFailInfo = fail_info(_, BSResumeKnown, _, _, _),\n get_fail_info(!.CI, CurFailInfo),\n CurFailInfo = fail_info(CurFailStack, _, CurCurfMaxfr, CurCondEnv,\n CurHijack),\n NewFailInfo = fail_info(CurFailStack, BSResumeKnown, CurCurfMaxfr,\n CurCondEnv, CurHijack),\n set_fail_info(NewFailInfo, !CI).\n\ngenerate_branch_end(StoreMap, MaybeEnd0, MaybeEnd, Code, !CI) :-\n % The code generator generates better code if it knows in advance where\n % each variable should go. We don't need to reset the follow_vars\n % afterwards, since every goal following a branched control structure\n % must in any case be annotated with its own follow_var set.\n map.to_assoc_list(StoreMap, AbsVarLocs),\n assoc_list.values(AbsVarLocs, AbsLocs),\n code_util.max_mentioned_abs_regs(AbsLocs, MaxRegR, MaxRegF),\n set_follow_vars(abs_follow_vars(StoreMap, MaxRegR + 1, MaxRegF + 1), !CI),\n get_instmap(!.CI, InstMap),\n ( instmap_is_reachable(InstMap) ->\n VarLocs = assoc_list.map_values_only(abs_locn_to_lval, AbsVarLocs),\n place_vars(VarLocs, Code, !CI)\n ;\n % With --opt-no-return-call, the variables that we would have\n % saved across a call that cannot return have had the last\n % of their code generation state destroyed, so calling\n % place_vars would cause a code generator abort. However,\n % pretending that all the variables are where the store map\n % says they should be is perfectly fine, since we can never\n % reach the end of *this* branch anyway.\n remake_with_store_map(StoreMap, !CI),\n Code = empty\n ),\n EndCodeInfo1 = !.CI,\n (\n MaybeEnd0 = no,\n MaybeEnd = yes(branch_end_info(EndCodeInfo1))\n ;\n MaybeEnd0 = yes(branch_end_info(EndCodeInfo0)),\n\n % Make sure the left context we leave the branched structure with\n % is valid for all branches.\n get_fail_info(EndCodeInfo0, FailInfo0),\n get_fail_info(EndCodeInfo1, FailInfo1),\n FailInfo0 = fail_info(_, ResumeKnown0, CurfrMaxfr0, CondEnv0, Hijack0),\n FailInfo1 = fail_info(R, ResumeKnown1, CurfrMaxfr1, CondEnv1, Hijack1),\n (\n ResumeKnown0 = resume_point_known(Redoip0),\n ResumeKnown1 = resume_point_known(Redoip1)\n ->\n ResumeKnown = resume_point_known(Redoip0),\n expect(unify(Redoip0, Redoip1), $module, $pred, \"redoip mismatch\")\n ;\n ResumeKnown = resume_point_unknown\n ),\n (\n CurfrMaxfr0 = must_be_equal,\n CurfrMaxfr1 = must_be_equal\n ->\n CurfrMaxfr = must_be_equal\n ;\n CurfrMaxfr = may_be_different\n ),\n (\n Hijack0 = allowed,\n Hijack1 = allowed\n ->\n Hijack = allowed\n ;\n Hijack = not_allowed\n ),\n expect(unify(CondEnv0, CondEnv1), $module, $pred,\n \"some but not all branches inside a non condition\"),\n FailInfo = fail_info(R, ResumeKnown, CurfrMaxfr, CondEnv0, Hijack),\n set_fail_info(FailInfo, EndCodeInfo1, EndCodeInfoA),\n\n % Make sure the \"temps in use\" set at the end of the branched control\n % structure includes every slot in use at the end of any branch.\n get_temps_in_use(EndCodeInfo0, TempsInUse0),\n get_temps_in_use(EndCodeInfo1, TempsInUse1),\n set.union(TempsInUse0, TempsInUse1, TempsInUse),\n set_temps_in_use(TempsInUse, EndCodeInfoA, EndCodeInfo),\n\n MaybeEnd = yes(branch_end_info(EndCodeInfo))\n ).\n\nafter_all_branches(StoreMap, MaybeEnd, !CI) :-\n (\n MaybeEnd = yes(BranchEnd),\n BranchEnd = branch_end_info(BranchEndCodeInfo),\n BranchEndLocDep = BranchEndCodeInfo ^ code_info_loc_dep,\n reset_to_position(position_info(BranchEndLocDep), !CI),\n remake_with_store_map(StoreMap, !CI)\n ;\n MaybeEnd = no,\n unexpected($module, $pred, \"no branches in branched control structure\")\n ).\n\n % remake_with_store_map throws away the var_info data structure, forgetting\n % the current locations of all variables, and rebuilds it from scratch\n % based on the given store map. The new var_info will know about only\n % the variables present in the store map, and will believe they are\n % where the store map says they are.\n %\n:- pred remake_with_store_map(abs_store_map::in,\n code_info::in, code_info::out) is det.\n\nremake_with_store_map(StoreMap, !CI) :-\n map.to_assoc_list(StoreMap, VarLocns),\n VarLvals = assoc_list.map_values_only(abs_locn_to_lval, VarLocns),\n get_var_locn_info(!.CI, VarLocnInfo0),\n reinit_var_locn_state(VarLvals, VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\nsave_hp_in_branch(Code, Slot, Pos0, Pos, CI0, CI) :-\n CI0 = code_info(CIStatic0, CILocDep0, CIPersistent0),\n Pos0 = position_info(LocDep0),\n CI1 = code_info(CIStatic0, LocDep0, CIPersistent0),\n save_hp(Code, Slot, CI1, CI2),\n CI2 = code_info(CIStatic, LocDep, CIPersistent),\n Pos = position_info(LocDep),\n % Reset the location dependent part to the original.\n CI = code_info(CIStatic, CILocDep0, CIPersistent).\n\n%---------------------------------------------------------------------------%\n%---------------------------------------------------------------------------%\n\n % Submodule for the handling of failure continuations.\n\n % The principles underlying this submodule of code_info.m are\n % documented in the file compiler/notes/failure.html, which also\n % defines terms such as \"quarter hijack\"). Some parts of the submodule\n % also require knowledge of compiler/notes/allocation.html.\n\n:- interface.\n\n:- type resume_map.\n\n:- type resume_point_info.\n\n % `prepare_for_disj_hijack' should be called before entering\n % a disjunction. It saves the values of any nondet stack slots\n % the disjunction may hijack, and if necessary, sets the redofr\n % slot of the top frame to point to this frame. The code at the\n % start of the individual disjuncts will override the redoip slot.\n %\n % `undo_disj_hijack' should be called before entering the last disjunct\n % of a disjunction. It undoes the effects of `prepare_for_disj_hijack'.\n %\n:- type disj_hijack_info.\n\n:- pred prepare_for_disj_hijack(code_model::in,\n disj_hijack_info::out, llds_code::out,\n code_info::in, code_info::out) is det.\n\n:- pred undo_disj_hijack(disj_hijack_info::in,\n llds_code::out, code_info::in, code_info::out) is det.\n\n % `prepare_for_ite_hijack' should be called before entering\n % an if-then-else. It saves the values of any nondet stack slots\n % the if-then-else may hijack, and if necessary, sets the redofr\n % slot of the top frame to point to this frame. Our caller\n % will then override the redoip slot to point to the start of\n % the else part before generating the code of the condition.\n % The maybe(lval) argument, if set to `yes', specifies the slot\n % holding the success record to use in deciding whether to execute\n % a region_ite_nondet_cond_fail operation at the start of the else branch.\n %\n % `ite_enter_then', which should be called after generating code for\n % the condition, sets up the failure state of the code generator\n % for generating the then-part, and returns the code sequences\n % to be used at the starts of the then-part and the else-part\n % to undo the effects of any hijacking.\n %\n:- type ite_hijack_info.\n\n:- pred prepare_for_ite_hijack(code_model::in,\n maybe(embedded_stack_frame_id)::in, ite_hijack_info::out, llds_code::out,\n code_info::in, code_info::out) is det.\n\n:- pred ite_enter_then(ite_hijack_info::in, resume_point_info::in,\n llds_code::out, llds_code::out, code_info::in, code_info::out) is det.\n\n % `enter_simple_neg' and `leave_simple_neg' should be called before\n % and after generating the code for a negated unification, in\n % situations where failure is a direct branch. We handle this case\n % specially, because it occurs frequently and should not require\n % a flushing of the expression cache, whereas the general way of\n % handling negations does require a flush. These two predicates\n % handle all aspects of the negation except for the unification itself.\n %\n:- type simple_neg_info.\n\n:- pred enter_simple_neg(list(prog_var)::in, hlds_goal_info::in,\n simple_neg_info::out, code_info::in, code_info::out) is det.\n\n:- pred leave_simple_neg(hlds_goal_info::in, simple_neg_info::in,\n code_info::in, code_info::out) is det.\n\n % `prepare_for_det_commit' and `generate_det_commit' should be\n % called before and after generating the code for the multi goal\n % being cut across. If the goal succeeds, the commit will cut away\n % any choice points generated in the goal.\n %\n % The set_of_progvar should be the set of variables live before\n % the scope goal.\n %\n:- type det_commit_info.\n\n:- pred prepare_for_det_commit(add_trail_ops::in, add_region_ops::in,\n set_of_progvar::in, hlds_goal_info::in, det_commit_info::out,\n llds_code::out, code_info::in, code_info::out) is det.\n\n:- pred generate_det_commit(det_commit_info::in,\n llds_code::out, code_info::in, code_info::out) is det.\n\n % `prepare_for_semi_commit' and `generate_semi_commit' should be\n % called before and after generating the code for the nondet goal\n % being cut across. If the goal succeeds, the commit will cut\n % any choice points generated in the goal.\n %\n % The set_of_progvar should be the set of variables live before\n % the scope goal.\n %\n:- type semi_commit_info.\n\n:- pred prepare_for_semi_commit(add_trail_ops::in, add_region_ops::in,\n set_of_progvar::in, hlds_goal_info::in, semi_commit_info::out,\n llds_code::out, code_info::in, code_info::out) is det.\n\n:- pred generate_semi_commit(semi_commit_info::in,\n llds_code::out, code_info::in, code_info::out) is det.\n\n % Put the given resume point into effect, by pushing it on to\n % the resume point stack, and if necessary generating code to\n % override the redoip of the top nondet stack frame.\n %\n:- pred effect_resume_point(resume_point_info::in, code_model::in,\n llds_code::out, code_info::in, code_info::out) is det.\n\n:- pred pop_resume_point(code_info::in, code_info::out) is det.\n\n % Return the details of the resume point currently on top of the\n % failure continuation stack.\n %\n:- pred top_resume_point(code_info::in, resume_point_info::out) is det.\n\n % Call this predicate to say \"we have just left a disjunction;\n % we don't know what address the following code will need to\n % backtrack to\".\n %\n:- pred set_resume_point_to_unknown(code_info::in, code_info::out) is det.\n\n % Call this predicate to say \"we have just returned from a model_non\n % call; we don't know what address the following code will need to\n % backtrack to, and there may now be nondet frames on top of ours\n % that do not have their redofr slots pointing to our frame\".\n %\n:- pred set_resume_point_and_frame_to_unknown(code_info::in, code_info::out)\n is det.\n\n % Generate code for executing a failure that is appropriate for the\n % current failure environment.\n %\n:- pred generate_failure(llds_code::out, code_info::in, code_info::out) is det.\n\n % Generate code that checks if the given rval is false, and if yes,\n % executes a failure that is appropriate for the current failure\n % environment.\n %\n:- pred fail_if_rval_is_false(rval::in, llds_code::out,\n code_info::in, code_info::out) is det.\n\n % Checks whether the appropriate code for failure in the current\n % failure environment is a direct branch.\n %\n:- pred failure_is_direct_branch(code_info::in, code_addr::out) is semidet.\n\n % Checks under what circumstances the current failure environment\n % would allow a model_non call at this point to be turned into a\n % tail call, provided of course that the return from the call is\n % followed immediately by succeed().\n %\n:- pred may_use_nondet_tailcall(code_info::in, nondet_tail_call::out) is det.\n\n % Materialize the given variables into registers or stack slots.\n %\n:- pred produce_vars(list(prog_var)::in, resume_map::out, llds_code::out,\n code_info::in, code_info::out) is det.\n\n % Put the variables needed in enclosing failure continuations\n % into their stack slots.\n %\n:- pred flush_resume_vars_to_stack(llds_code::out,\n code_info::in, code_info::out) is det.\n\n % Set up the resume_point_info structure.\n % The ResumeVars passed as the first arguments should be a sorted list\n % without duplicates.\n %\n:- pred make_resume_point(list(prog_var)::in, resume_locs::in, resume_map::in,\n resume_point_info::out, code_info::in, code_info::out) is det.\n\n % Generate the code for a resume point.\n %\n:- pred generate_resume_point(resume_point_info::in, llds_code::out,\n code_info::in, code_info::out) is det.\n\n % List the variables that need to be preserved for the given resume point.\n %\n:- pred resume_point_vars(resume_point_info::in, list(prog_var)::out) is det.\n\n % See whether the given resume point includes a code address that presumes\n % all the resume point variables to be in their stack slots. If yes,\n % return that code address; otherwise, abort the compiler.\n %\n:- pred resume_point_stack_addr(resume_point_info::in, code_addr::out) is det.\n\n%---------------------------------------------------------------------------%\n\n:- implementation.\n\n % The part of the code generator state that says how to handle\n % failures; also called the failure continuation stack.\n\n:- type fail_info\n ---> fail_info(\n stack(resume_point_info),\n resume_point_known,\n curfr_vs_maxfr,\n condition_env,\n hijack_allowed\n ).\n\n % A resumption point has one or two labels associated with it.\n % Backtracking can arrive at either label. The code following\n % each label will assume that the variables needed at the resumption\n % point are in the locations given by the resume_map associated with\n % the given label and nowhere else. Any code that can cause\n % backtracking to a label must make sure that those variables are\n % in the positions expected by the label.\n %\n % The only time when a code_addr in a resume_point info is not a label\n % is when the code_addr is do_redo or do_fail, which indicate that\n % the resumption point is either unknown or not in (this invocation of)\n % this procedure.\n %\n:- type resume_point_info\n ---> orig_only(resume_map, code_addr)\n ; stack_only(resume_map, code_addr)\n ; orig_and_stack(resume_map, code_addr, resume_map, code_addr)\n ; stack_and_orig(resume_map, code_addr, resume_map, code_addr).\n\n % A resume map maps the variables that will be needed at a resumption\n % point to the locations in which they will be.\n %\n:- type resume_map == map(prog_var, set(lval)).\n\n:- type redoip_update\n ---> has_been_done\n ; wont_be_done.\n\n:- type resume_point_known\n ---> resume_point_known(redoip_update)\n ; resume_point_unknown.\n\n:- type curfr_vs_maxfr\n ---> must_be_equal\n ; may_be_different.\n\n:- type condition_env\n ---> inside_non_condition\n ; not_inside_non_condition.\n\n:- type hijack_allowed\n ---> allowed\n ; not_allowed.\n\n%---------------------------------------------------------------------------%\n\n:- type disj_hijack_info\n ---> disj_no_hijack\n ; disj_temp_frame\n ; disj_quarter_hijack\n ; disj_half_hijack(\n % The stack slot in which we saved the value\n % of the hijacked redoip.\n lval\n )\n ; disj_full_hijack(\n % The stack slot in which we saved the value\n % of the hijacked redoip.\n lval,\n\n % The stack slot in which we saved the value\n % of the hijacked redofr.\n lval\n ).\n\nprepare_for_disj_hijack(CodeModel, HijackInfo, Code, !CI) :-\n get_fail_info(!.CI, FailInfo),\n FailInfo = fail_info(ResumePoints, ResumeKnown, CurfrMaxfr, CondEnv,\n Allow),\n (\n ( CodeModel = model_det\n ; CodeModel = model_semi\n ),\n HijackInfo = disj_no_hijack,\n Code = singleton(\n llds_instr(comment(\"disj no hijack\"), \"\")\n )\n ;\n CodeModel = model_non,\n (\n CondEnv = inside_non_condition,\n HijackInfo = disj_temp_frame,\n create_temp_frame(do_fail, \"prepare for disjunction\", Code, !CI)\n ;\n CondEnv = not_inside_non_condition,\n (\n Allow = not_allowed,\n (\n CurfrMaxfr = must_be_equal,\n ResumeKnown = resume_point_known(has_been_done),\n stack.pop(TopResumePoint, ResumePoints, RestResumePoints),\n stack.is_empty(RestResumePoints),\n TopResumePoint = stack_only(_, do_fail)\n ->\n HijackInfo = disj_quarter_hijack,\n Code = singleton(\n llds_instr(comment(\"disj quarter hijack of do_fail\"),\n \"\")\n )\n ;\n HijackInfo = disj_temp_frame,\n create_temp_frame(do_fail, \"prepare for disjunction\", Code,\n !CI)\n )\n ;\n Allow = allowed,\n (\n CurfrMaxfr = must_be_equal,\n (\n ResumeKnown = resume_point_known(has_been_done),\n HijackInfo = disj_quarter_hijack,\n Code = singleton(\n llds_instr(comment(\"disj quarter hijack\"), \"\")\n )\n ;\n ( ResumeKnown = resume_point_known(wont_be_done)\n ; ResumeKnown = resume_point_unknown\n ),\n acquire_temp_slot(slot_lval(redoip_slot(lval(curfr))),\n non_persistent_temp_slot, RedoipSlot, !CI),\n HijackInfo = disj_half_hijack(RedoipSlot),\n Code = singleton(\n llds_instr(assign(RedoipSlot,\n lval(redoip_slot(lval(curfr)))),\n \"prepare for half disj hijack\")\n )\n )\n ;\n CurfrMaxfr = may_be_different,\n acquire_temp_slot(slot_lval(redoip_slot(lval(maxfr))),\n non_persistent_temp_slot, RedoipSlot, !CI),\n acquire_temp_slot(slot_lval(redofr_slot(lval(maxfr))),\n non_persistent_temp_slot, RedofrSlot, !CI),\n HijackInfo = disj_full_hijack(RedoipSlot, RedofrSlot),\n Code = from_list([\n llds_instr(\n assign(RedoipSlot, lval(redoip_slot(lval(maxfr)))),\n \"prepare for full disj hijack\"),\n llds_instr(\n assign(RedofrSlot, lval(redofr_slot(lval(maxfr)))),\n \"prepare for full disj hijack\"),\n llds_instr(\n assign(redofr_slot(lval(maxfr)), lval(curfr)),\n \"prepare for full disj hijack\")\n ])\n )\n )\n )\n ).\n\nundo_disj_hijack(HijackInfo, Code, !CI) :-\n get_fail_info(!.CI, FailInfo0),\n FailInfo0 = fail_info(ResumePoints, ResumeKnown, CurfrMaxfr, CondEnv,\n Allow),\n (\n HijackInfo = disj_no_hijack,\n Code = empty\n ;\n HijackInfo = disj_temp_frame,\n Code = singleton(\n llds_instr(assign(maxfr, lval(prevfr_slot(lval(maxfr)))),\n \"restore maxfr for temp frame disj\")\n )\n ;\n HijackInfo = disj_quarter_hijack,\n expect(unify(CurfrMaxfr, must_be_equal), $module, $pred,\n \"maxfr may differ from curfr in disj_quarter_hijack\"),\n stack.det_top(ResumePoints, ResumePoint),\n pick_stack_resume_point(ResumePoint, _, StackLabel),\n LabelConst = const(llconst_code_addr(StackLabel)),\n % peephole.m looks for the \"curfr==maxfr\" pattern in the comment.\n Code = singleton(\n llds_instr(assign(redoip_slot(lval(curfr)), LabelConst),\n \"restore redoip for quarter disj hijack (curfr==maxfr)\")\n )\n ;\n HijackInfo = disj_half_hijack(RedoipSlot),\n expect(unify(ResumeKnown, resume_point_unknown), $module, $pred,\n \"resume point known in disj_half_hijack\"),\n expect(unify(CurfrMaxfr, must_be_equal), $module, $pred,\n \"maxfr may differ from curfr in disj_half_hijack\"),\n % peephole.m looks for the \"curfr==maxfr\" pattern in the comment.\n Code = singleton(\n llds_instr(assign(redoip_slot(lval(curfr)), lval(RedoipSlot)),\n \"restore redoip for half disj hijack (curfr==maxfr)\")\n )\n ;\n HijackInfo = disj_full_hijack(RedoipSlot, RedofrSlot),\n expect(unify(CurfrMaxfr, may_be_different), $module, $pred,\n \"maxfr same as curfr in disj_full_hijack\"),\n Code = from_list([\n llds_instr(assign(redoip_slot(lval(maxfr)), lval(RedoipSlot)),\n \"restore redoip for full disj hijack\"),\n llds_instr(assign(redofr_slot(lval(maxfr)), lval(RedofrSlot)),\n \"restore redofr for full disj hijack\")\n ])\n ),\n (\n % HijackInfo \\= disj_no_hijack if and only if the disjunction\n % is model_non.\n HijackInfo \\= disj_no_hijack,\n CondEnv = inside_non_condition\n ->\n FailInfo = fail_info(ResumePoints, resume_point_unknown, CurfrMaxfr,\n CondEnv, Allow),\n set_fail_info(FailInfo, !CI)\n ;\n true\n ).\n\n%---------------------------------------------------------------------------%\n\n % For model_non if-then-elses, we need to clean up the embedded stack frame\n % we create for the if-then-else when the condition fails after succeeding.\n % For such if-then-elses, we record the id of the embedded frame we need to\n % clean up, and the id of the slot that is initialized to false, and set to\n % true each time the condition succeeds.\n:- type ite_region_info\n ---> ite_region_info(\n embedded_stack_frame_id,\n lval\n ).\n\n:- type ite_hijack_info\n ---> ite_info(\n resume_point_known,\n condition_env,\n ite_hijack_type,\n maybe(ite_region_info)\n ).\n\n:- type ite_hijack_type\n ---> ite_no_hijack\n ; ite_temp_frame(\n % The stack slot in which we saved the value of maxfr.\n lval\n )\n ; ite_quarter_hijack\n ; ite_half_hijack(\n % The stack slot in which we saved the value\n % of the hijacked redoip.\n lval\n )\n ; ite_full_hijack(\n % The stack slot in which we saved the value\n % of the hijacked redoip.\n lval,\n\n % The stack slot in which we saved the value\n % of the hijacked redofr.\n lval,\n\n % The stack slot in which we saved the value of maxfr.\n lval\n ).\n\nprepare_for_ite_hijack(CondCodeModel, MaybeEmbeddedFrameId, HijackInfo, Code,\n !CI) :-\n get_fail_info(!.CI, FailInfo),\n FailInfo = fail_info(_, ResumeKnown, CurfrMaxfr, CondEnv, Allow),\n (\n % It is possible for a negated goal (which is the \"Condition\" of the\n % equivalent if-then-else) to be det, if it is also impure.\n ( CondCodeModel = model_det\n ; CondCodeModel = model_semi\n ),\n expect(unify(MaybeEmbeddedFrameId, no), $module, $pred,\n \"MaybeEmbeddedFrameId in model_semi\"),\n HijackType = ite_no_hijack,\n Code = singleton(\n llds_instr(comment(\"ite no hijack\"), \"\")\n ),\n MaybeRegionInfo = no\n ;\n CondCodeModel = model_non,\n (\n ( Allow = not_allowed\n ; CondEnv = inside_non_condition\n ; MaybeEmbeddedFrameId = yes(_)\n )\n ->\n acquire_temp_slot(slot_lval(maxfr), non_persistent_temp_slot,\n MaxfrSlot, !CI),\n HijackType = ite_temp_frame(MaxfrSlot),\n create_temp_frame(do_fail, \"prepare for ite\", TempFrameCode, !CI),\n MaxfrCode = singleton(\n llds_instr(assign(MaxfrSlot, lval(maxfr)), \"prepare for ite\")\n ),\n (\n MaybeEmbeddedFrameId = yes(EmbeddedFrameId),\n % Note that this slot is intentionally not released anywhere.\n acquire_temp_slot(slot_success_record, persistent_temp_slot,\n SuccessRecordSlot, !CI),\n InitSuccessCode = singleton(\n llds_instr(\n assign(SuccessRecordSlot, const(llconst_false)),\n \"record no success of the condition yes\")\n ),\n MaybeRegionInfo =\n yes(ite_region_info(EmbeddedFrameId, SuccessRecordSlot))\n ;\n MaybeEmbeddedFrameId = no,\n InitSuccessCode = empty,\n MaybeRegionInfo = no\n ),\n Code = TempFrameCode ++ MaxfrCode ++ InitSuccessCode\n ;\n (\n CurfrMaxfr = must_be_equal,\n (\n ResumeKnown = resume_point_known(_),\n HijackType = ite_quarter_hijack,\n Code = singleton(\n llds_instr(comment(\"ite quarter hijack\"), \"\")\n )\n ;\n ResumeKnown = resume_point_unknown,\n acquire_temp_slot(slot_lval(redoip_slot(lval(curfr))),\n non_persistent_temp_slot, RedoipSlot, !CI),\n HijackType = ite_half_hijack(RedoipSlot),\n Code = singleton(\n llds_instr(\n assign(RedoipSlot, lval(redoip_slot(lval(curfr)))),\n \"prepare for half ite hijack\")\n )\n )\n ;\n CurfrMaxfr = may_be_different,\n acquire_temp_slot(slot_lval(redoip_slot(lval(maxfr))),\n non_persistent_temp_slot, RedoipSlot, !CI),\n acquire_temp_slot(slot_lval(redofr_slot(lval(maxfr))),\n non_persistent_temp_slot, RedofrSlot, !CI),\n acquire_temp_slot(slot_lval(maxfr),\n non_persistent_temp_slot, MaxfrSlot, !CI),\n HijackType = ite_full_hijack(RedoipSlot, RedofrSlot,\n MaxfrSlot),\n Code = from_list([\n llds_instr(\n assign(MaxfrSlot, lval(maxfr)),\n \"prepare for full ite hijack\"),\n llds_instr(\n assign(RedoipSlot, lval(redoip_slot(lval(maxfr)))),\n \"prepare for full ite hijack\"),\n llds_instr(\n assign(RedofrSlot, lval(redofr_slot(lval(maxfr)))),\n \"prepare for full ite hijack\"),\n llds_instr(\n assign(redofr_slot(lval(maxfr)), lval(curfr)),\n \"prepare for full ite hijack\")\n ])\n ),\n MaybeRegionInfo = no\n ),\n inside_non_condition(!CI)\n ),\n HijackInfo = ite_info(ResumeKnown, CondEnv, HijackType, MaybeRegionInfo).\n\nite_enter_then(HijackInfo, ITEResumePoint, ThenCode, ElseCode, !CI) :-\n get_fail_info(!.CI, FailInfo0),\n FailInfo0 = fail_info(ResumePoints0, ResumeKnown0, CurfrMaxfr, _, Allow),\n stack.det_pop(_, ResumePoints0, ResumePoints),\n HijackInfo = ite_info(HijackResumeKnown, OldCondEnv, HijackType,\n MaybeRegionInfo),\n (\n HijackType = ite_no_hijack,\n expect(unify(MaybeRegionInfo, no), $module, $pred,\n \"MaybeRegionInfo ite_no_hijack\"),\n ThenCode = empty,\n ElseCode = empty\n ;\n HijackType = ite_temp_frame(MaxfrSlot),\n (\n MaybeRegionInfo = no,\n ThenCode = singleton(\n % We can't remove the frame, it may not be on top.\n llds_instr(assign(redoip_slot(lval(MaxfrSlot)),\n const(llconst_code_addr(do_fail))),\n \"soft cut for temp frame ite\")\n ),\n ElseCode = singleton(\n % XXX search for assignments to maxfr\n llds_instr(assign(maxfr, lval(prevfr_slot(lval(MaxfrSlot)))),\n \"restore maxfr for temp frame ite\")\n )\n ;\n MaybeRegionInfo = yes(RegionInfo),\n RegionInfo = ite_region_info(EmbeddedStackFrameId,\n SuccessRecordSlot),\n % XXX replace do_fail with ref to ResumePoint stack label\n resume_point_stack_addr(ITEResumePoint, ITEStackResumeCodeAddr),\n ThenCode = from_list([\n llds_instr(assign(SuccessRecordSlot, const(llconst_true)),\n \"record success of the condition\"),\n llds_instr(assign(redoip_slot(lval(MaxfrSlot)),\n const(llconst_code_addr(ITEStackResumeCodeAddr))),\n \"redirect to cut for temp frame ite\")\n ]),\n get_next_label(AfterRegionOp, !CI),\n ElseCode = from_list([\n llds_instr(assign(maxfr, lval(prevfr_slot(lval(MaxfrSlot)))),\n \"restore maxfr for temp frame ite\"),\n llds_instr(if_val(unop(logical_not, lval(SuccessRecordSlot)),\n code_label(AfterRegionOp)),\n \"jump around if the condition never succeeded\"),\n llds_instr(use_and_maybe_pop_region_frame(\n region_ite_nondet_cond_fail, EmbeddedStackFrameId),\n \"cleanup after the post-success failure of the condition\"),\n llds_instr(goto(do_fail),\n \"the condition succeeded, so don't execute else branch\"),\n llds_instr(label(AfterRegionOp),\n \"after region op\")\n ])\n )\n ;\n HijackType = ite_quarter_hijack,\n expect(unify(MaybeRegionInfo, no), $module, $pred,\n \"MaybeRegionInfo ite_quarter_hijack\"),\n stack.det_top(ResumePoints, ResumePoint),\n ( maybe_pick_stack_resume_point(ResumePoint, _, StackLabel) ->\n LabelConst = const(llconst_code_addr(StackLabel)),\n ThenCode = singleton(\n llds_instr(assign(redoip_slot(lval(curfr)), LabelConst),\n \"restore redoip for quarter ite hijack\")\n )\n ;\n % This can happen only if ResumePoint is unreachable from here.\n ThenCode = empty\n ),\n ElseCode = ThenCode\n ;\n HijackType = ite_half_hijack(RedoipSlot),\n expect(unify(MaybeRegionInfo, no), $module, $pred,\n \"MaybeRegionInfo ite_half_hijack\"),\n ThenCode = singleton(\n llds_instr(assign(redoip_slot(lval(curfr)), lval(RedoipSlot)),\n \"restore redoip for half ite hijack\")\n ),\n ElseCode = ThenCode\n ;\n HijackType = ite_full_hijack(RedoipSlot, RedofrSlot, MaxfrSlot),\n expect(unify(MaybeRegionInfo, no), $module, $pred,\n \"MaybeRegionInfo ite_full_hijack\"),\n ThenCode = from_list([\n llds_instr(assign(redoip_slot(lval(MaxfrSlot)), lval(RedoipSlot)),\n \"restore redoip for full ite hijack\"),\n llds_instr(assign(redofr_slot(lval(MaxfrSlot)), lval(RedofrSlot)),\n \"restore redofr for full ite hijack\")\n ]),\n ElseCode = from_list([\n llds_instr(assign(redoip_slot(lval(maxfr)), lval(RedoipSlot)),\n \"restore redoip for full ite hijack\"),\n llds_instr(assign(redofr_slot(lval(maxfr)), lval(RedofrSlot)),\n \"restore redofr for full ite hijack\")\n ])\n ),\n (\n ResumeKnown0 = resume_point_unknown,\n ResumeKnown = resume_point_unknown\n ;\n ResumeKnown0 = resume_point_known(_),\n ResumeKnown = HijackResumeKnown\n ),\n FailInfo = fail_info(ResumePoints, ResumeKnown, CurfrMaxfr, OldCondEnv,\n Allow),\n set_fail_info(FailInfo, !CI).\n\n%---------------------------------------------------------------------------%\n\n:- type simple_neg_info == fail_info.\n\nenter_simple_neg(ResumeVars, GoalInfo, FailInfo0, !CI) :-\n get_fail_info(!.CI, FailInfo0),\n % The only reason why we push a resume point at all is to protect\n % the variables in ResumeVars from becoming unknown; by including them\n % in the domain of the resume point, we guarantee that they will become\n % zombies instead of unknown if they die in the pre- or post-goal updates.\n % Therefore the only part of ResumePoint that matters is the set of\n % variables in the resume map; the other parts of ResumePoint\n % (the locations, the code address) will not be referenced.\n map.init(ResumeMap0),\n make_fake_resume_map(ResumeVars, ResumeMap0, ResumeMap),\n ResumePoint = orig_only(ResumeMap, do_redo),\n effect_resume_point(ResumePoint, model_semi, Code, !CI),\n expect(is_empty(Code), $module, $pred, \"nonempty code for simple neg\"),\n pre_goal_update(GoalInfo, does_not_have_subgoals, !CI).\n\nleave_simple_neg(GoalInfo, FailInfo, !CI) :-\n post_goal_update(GoalInfo, !CI),\n set_fail_info(FailInfo, !CI).\n\n:- pred make_fake_resume_map(list(prog_var)::in,\n map(prog_var, set(lval))::in, map(prog_var, set(lval))::out) is det.\n\nmake_fake_resume_map([], !ResumeMap).\nmake_fake_resume_map([Var | Vars], !ResumeMap) :-\n % A visibly fake location.\n Locns = set.make_singleton_set(reg(reg_r, -1)),\n map.det_insert(Var, Locns, !ResumeMap),\n make_fake_resume_map(Vars, !ResumeMap).\n\n%---------------------------------------------------------------------------%\n\n:- type det_commit_info\n ---> det_commit_info(\n % Location of saved maxfr.\n maybe(lval),\n\n % Location of saved ticket % counter and trail pointer.\n maybe(pair(lval)),\n\n maybe(region_commit_stack_frame)\n ).\n\n:- type region_commit_stack_frame\n ---> region_commit_stack_frame(\n % The id of the region commit stack frame, which is emdedded\n % in the current procedure's stack frame, and whose layout is:\n\n % saved region_commit_stack_pointer\n % saved region sequence number\n % number of live nonprotected regions\n % space reserved for the ids of live nonprotected regions\n\n embedded_stack_frame_id,\n\n % The list of temporary slots that constitute\n % this embedded stack frame.\n list(lval)\n ).\n\nprepare_for_det_commit(AddTrailOps, AddRegionOps, ForwardLiveVarsBeforeGoal,\n CommitGoalInfo, DetCommitInfo, Code, !CI) :-\n get_fail_info(!.CI, FailInfo0),\n FailInfo0 = fail_info(_, _, CurfrMaxfr, _, _),\n (\n CurfrMaxfr = may_be_different,\n acquire_temp_slot(slot_lval(maxfr), non_persistent_temp_slot,\n MaxfrSlot, !CI),\n SaveMaxfrCode = singleton(\n llds_instr(save_maxfr(MaxfrSlot), \"save the value of maxfr\")\n ),\n MaybeMaxfrSlot = yes(MaxfrSlot)\n ;\n CurfrMaxfr = must_be_equal,\n SaveMaxfrCode = empty,\n MaybeMaxfrSlot = no\n ),\n maybe_save_trail_info(AddTrailOps, MaybeTrailSlots, SaveTrailCode, !CI),\n maybe_save_region_commit_frame(AddRegionOps, ForwardLiveVarsBeforeGoal,\n CommitGoalInfo, MaybeRegionCommitFrameInfo, SaveRegionCommitFrameCode,\n !CI),\n DetCommitInfo = det_commit_info(MaybeMaxfrSlot, MaybeTrailSlots,\n MaybeRegionCommitFrameInfo),\n Code = SaveMaxfrCode ++ SaveTrailCode ++ SaveRegionCommitFrameCode.\n\ngenerate_det_commit(DetCommitInfo, Code, !CI) :-\n DetCommitInfo = det_commit_info(MaybeMaxfrSlot, MaybeTrailSlots,\n MaybeRegionCommitFrameInfo),\n (\n MaybeMaxfrSlot = yes(MaxfrSlot),\n RestoreMaxfrCode = singleton(\n llds_instr(restore_maxfr(MaxfrSlot),\n \"restore the value of maxfr - perform commit\")\n ),\n release_temp_slot(MaxfrSlot, non_persistent_temp_slot, !CI)\n ;\n MaybeMaxfrSlot = no,\n RestoreMaxfrCode = singleton(\n llds_instr(assign(maxfr, lval(curfr)),\n \"restore the value of maxfr - perform commit\")\n )\n ),\n maybe_restore_trail_info(MaybeTrailSlots, CommitTrailCode, _, !CI),\n maybe_restore_region_commit_frame(MaybeRegionCommitFrameInfo,\n SuccessRegionCode, _FailureRegionCode, !CI),\n Code = RestoreMaxfrCode ++ CommitTrailCode ++ SuccessRegionCode.\n\n%---------------------------------------------------------------------------%\n\n:- type semi_commit_info\n ---> semi_commit_info(\n % Fail_info on entry.\n fail_info,\n\n resume_point_info,\n commit_hijack_info,\n\n % Location of saved ticket counter and trail pointer.\n maybe(pair(lval)),\n\n maybe(region_commit_stack_frame)\n ).\n\n:- type commit_hijack_info\n ---> commit_temp_frame(\n % The stack slot in which we saved the old value of maxfr.\n lval,\n\n % Do we bracket the goal with MR_commit_mark and MR_commit_cut?\n bool\n )\n ; commit_quarter_hijack\n ; commit_half_hijack(\n % The stack slot in which we saved the value\n % of the hijacked redoip.\n lval\n )\n ; commit_full_hijack(\n % The stack slot in which we saved the value\n % of the hijacked redoip.\n lval,\n\n % The stack slot in which we saved the value\n % of the hijacked redofr.\n lval,\n\n % The stack slot in which we saved the value of maxfr.\n lval\n ).\n\nprepare_for_semi_commit(AddTrailOps, AddRegionOps, ForwardLiveVarsBeforeGoal,\n CommitGoalInfo, SemiCommitInfo, Code, !CI) :-\n get_fail_info(!.CI, FailInfo0),\n FailInfo0 = fail_info(ResumePoints0, ResumeKnown, CurfrMaxfr, CondEnv,\n Allow),\n stack.det_top(ResumePoints0, TopResumePoint),\n clone_resume_point(TopResumePoint, NewResumePoint, !CI),\n stack.push(NewResumePoint, ResumePoints0, ResumePoints),\n FailInfo = fail_info(ResumePoints, resume_point_known(has_been_done),\n CurfrMaxfr, CondEnv, Allow),\n set_fail_info(FailInfo, !CI),\n\n pick_stack_resume_point(NewResumePoint, _, StackLabel),\n StackLabelConst = const(llconst_code_addr(StackLabel)),\n (\n ( Allow = not_allowed ; CondEnv = inside_non_condition )\n ->\n acquire_temp_slot(slot_lval(maxfr), non_persistent_temp_slot,\n MaxfrSlot, !CI),\n MaxfrCode = singleton(\n llds_instr(save_maxfr(MaxfrSlot),\n \"prepare for temp frame commit\")\n ),\n create_temp_frame(StackLabel,\n \"prepare for temp frame commit\", TempFrameCode, !CI),\n get_globals(!.CI, Globals),\n globals.lookup_bool_option(Globals, use_minimal_model_stack_copy_cut,\n UseMinimalModelStackCopyCut),\n HijackInfo = commit_temp_frame(MaxfrSlot, UseMinimalModelStackCopyCut),\n (\n UseMinimalModelStackCopyCut = yes,\n % If the code we are committing across starts but does not complete\n % the evaluation of a tabled subgoal, the cut will remove the\n % generator's choice point, so that the evaluation of the subgoal\n % will never be completed. We handle such \"dangling\" generators\n % by removing them from the subgoal trie of the tabled procedure.\n % This requires knowing what tabled subgoals are started inside\n % commits, which is why we wrap the goal being committed across\n % inside MR_commit_{mark,cut}.\n Components = [\n foreign_proc_raw_code(cannot_branch_away,\n proc_affects_liveness, live_lvals_info(set.init),\n \"\\t\\tMR_save_transient_registers();\\n\"),\n foreign_proc_raw_code(cannot_branch_away,\n proc_does_not_affect_liveness, live_lvals_info(set.init),\n \"\\t\\tMR_commit_mark();\\n\"),\n foreign_proc_raw_code(cannot_branch_away,\n proc_affects_liveness, live_lvals_info(set.init),\n \"\\t\\tMR_restore_transient_registers();\\n\")\n ],\n MD = proc_may_duplicate,\n MarkCode = singleton(\n llds_instr(foreign_proc_code([], Components,\n proc_will_not_call_mercury, no, no, no, no, no, no, MD),\n \"\")\n )\n ;\n UseMinimalModelStackCopyCut = no,\n MarkCode = empty\n ),\n HijackCode = MaxfrCode ++ TempFrameCode ++ MarkCode\n ;\n (\n CurfrMaxfr = must_be_equal,\n (\n ResumeKnown = resume_point_known(has_been_done),\n HijackInfo = commit_quarter_hijack,\n HijackCode = singleton(\n llds_instr(assign(redoip_slot(lval(curfr)),\n StackLabelConst),\n \"hijack the redofr slot\")\n )\n ;\n ( ResumeKnown = resume_point_known(wont_be_done)\n ; ResumeKnown = resume_point_unknown\n ),\n acquire_temp_slot(slot_lval(redoip_slot(lval(curfr))),\n non_persistent_temp_slot, RedoipSlot, !CI),\n HijackInfo = commit_half_hijack(RedoipSlot),\n HijackCode = from_list([\n llds_instr(assign(RedoipSlot,\n lval(redoip_slot(lval(curfr)))),\n \"prepare for half commit hijack\"),\n llds_instr(assign(redoip_slot(lval(curfr)),\n StackLabelConst),\n \"hijack the redofr slot\")\n ])\n )\n ;\n CurfrMaxfr = may_be_different,\n acquire_temp_slot(slot_lval(redoip_slot(lval(maxfr))),\n non_persistent_temp_slot, RedoipSlot, !CI),\n acquire_temp_slot(slot_lval(redofr_slot(lval(maxfr))),\n non_persistent_temp_slot, RedofrSlot, !CI),\n acquire_temp_slot(slot_lval(maxfr),\n non_persistent_temp_slot, MaxfrSlot, !CI),\n HijackInfo = commit_full_hijack(RedoipSlot, RedofrSlot, MaxfrSlot),\n HijackCode = from_list([\n llds_instr(assign(RedoipSlot, lval(redoip_slot(lval(maxfr)))),\n \"prepare for full commit hijack\"),\n llds_instr(assign(RedofrSlot, lval(redofr_slot(lval(maxfr)))),\n \"prepare for full commit hijack\"),\n llds_instr(save_maxfr(MaxfrSlot),\n \"prepare for full commit hijack\"),\n llds_instr(assign(redofr_slot(lval(maxfr)), lval(curfr)),\n \"hijack the redofr slot\"),\n llds_instr(assign(redoip_slot(lval(maxfr)), StackLabelConst),\n \"hijack the redoip slot\")\n ])\n )\n ),\n maybe_save_trail_info(AddTrailOps, MaybeTrailSlots, SaveTrailCode, !CI),\n maybe_save_region_commit_frame(AddRegionOps, ForwardLiveVarsBeforeGoal,\n CommitGoalInfo, MaybeRegionCommitFrameInfo, SaveRegionCommitFrameCode,\n !CI),\n SemiCommitInfo = semi_commit_info(FailInfo0, NewResumePoint,\n HijackInfo, MaybeTrailSlots, MaybeRegionCommitFrameInfo),\n Code = HijackCode ++ SaveTrailCode ++ SaveRegionCommitFrameCode.\n\ngenerate_semi_commit(SemiCommitInfo, Code, !CI) :-\n SemiCommitInfo = semi_commit_info(FailInfo, ResumePoint,\n HijackInfo, MaybeTrailSlots, MaybeRegionCommitFrameInfo),\n\n set_fail_info(FailInfo, !CI),\n % XXX Should release the temp slots in each arm of the switch.\n (\n HijackInfo = commit_temp_frame(MaxfrSlot, UseMinimalModel),\n MaxfrCode = singleton(\n llds_instr(restore_maxfr(MaxfrSlot),\n \"restore maxfr for temp frame hijack\")\n ),\n (\n UseMinimalModel = yes,\n % See the comment in prepare_for_semi_commit above.\n Components = [\n foreign_proc_raw_code(cannot_branch_away,\n proc_does_not_affect_liveness, live_lvals_info(set.init),\n \"\\t\\tMR_commit_cut();\\n\")\n ],\n MD = proc_may_duplicate,\n CutCode = singleton(\n llds_instr(foreign_proc_code([], Components,\n proc_will_not_call_mercury, no, no, no, no, no, no, MD),\n \"commit for temp frame hijack\")\n )\n ;\n UseMinimalModel = no,\n CutCode = empty\n ),\n SuccessUndoCode = MaxfrCode ++ CutCode,\n FailureUndoCode = MaxfrCode ++ CutCode\n ;\n HijackInfo = commit_quarter_hijack,\n FailInfo = fail_info(ResumePoints, _, _, _, _),\n stack.det_top(ResumePoints, TopResumePoint),\n pick_stack_resume_point(TopResumePoint, _, StackLabel),\n StackLabelConst = const(llconst_code_addr(StackLabel)),\n SuccessUndoCode = from_list([\n llds_instr(assign(maxfr, lval(curfr)),\n \"restore maxfr for quarter commit hijack\"),\n llds_instr(assign(redoip_slot(lval(maxfr)), StackLabelConst),\n \"restore redoip for quarter commit hijack\")\n ]),\n FailureUndoCode = singleton(\n llds_instr(assign(redoip_slot(lval(maxfr)), StackLabelConst),\n \"restore redoip for quarter commit hijack\")\n )\n ;\n HijackInfo = commit_half_hijack(RedoipSlot),\n SuccessUndoCode = from_list([\n llds_instr(assign(maxfr, lval(curfr)),\n \"restore maxfr for half commit hijack\"),\n llds_instr(assign(redoip_slot(lval(maxfr)), lval(RedoipSlot)),\n \"restore redoip for half commit hijack\")\n ]),\n FailureUndoCode = singleton(\n llds_instr(assign(redoip_slot(lval(maxfr)), lval(RedoipSlot)),\n \"restore redoip for half commit hijack\")\n )\n ;\n HijackInfo = commit_full_hijack(RedoipSlot, RedofrSlot, MaxfrSlot),\n SuccessUndoCode = from_list([\n llds_instr(restore_maxfr(MaxfrSlot),\n \"restore maxfr for full commit hijack\"),\n llds_instr(assign(redoip_slot(lval(maxfr)), lval(RedoipSlot)),\n \"restore redoip for full commit hijack\"),\n llds_instr(assign(redofr_slot(lval(maxfr)), lval(RedofrSlot)),\n \"restore redofr for full commit hijack\")\n ]),\n FailureUndoCode = from_list([\n llds_instr(assign(redoip_slot(lval(maxfr)), lval(RedoipSlot)),\n \"restore redoip for full commit hijack\"),\n llds_instr(assign(redofr_slot(lval(maxfr)), lval(RedofrSlot)),\n \"restore redofr for full commit hijack\")\n ])\n ),\n\n remember_position(!.CI, AfterCommit),\n generate_resume_point(ResumePoint, ResumePointCode, !CI),\n generate_failure(FailCode, !CI),\n reset_to_position(AfterCommit, !CI),\n\n maybe_restore_trail_info(MaybeTrailSlots, CommitTrailCode,\n RestoreTrailCode, !CI),\n maybe_restore_region_commit_frame(MaybeRegionCommitFrameInfo,\n SuccessRegionCode, FailureRegionCode, !CI),\n\n get_next_label(SuccLabel, !CI),\n GotoSuccLabel = singleton(\n llds_instr(goto(code_label(SuccLabel)), \"Jump to success continuation\")\n ),\n SuccLabelCode = singleton(\n llds_instr(label(SuccLabel), \"Success continuation\")\n ),\n SuccessCode = SuccessUndoCode ++ CommitTrailCode ++ SuccessRegionCode,\n FailureCode = ResumePointCode ++ FailureUndoCode ++ RestoreTrailCode ++\n FailureRegionCode ++ FailCode,\n Code = SuccessCode ++ GotoSuccLabel ++ FailureCode ++ SuccLabelCode.\n\n%---------------------------------------------------------------------------%\n\n:- pred maybe_save_region_commit_frame(add_region_ops::in, set_of_progvar::in,\n hlds_goal_info::in, maybe(region_commit_stack_frame)::out, llds_code::out,\n code_info::in, code_info::out) is det.\n\nmaybe_save_region_commit_frame(AddRegionOps, _ForwardLiveVarsBeforeGoal,\n CommitGoalInfo, MaybeRegionCommitFrameInfo, Code, !CI) :-\n (\n AddRegionOps = do_not_add_region_ops,\n MaybeRegionCommitFrameInfo = no,\n Code = empty\n ;\n AddRegionOps = add_region_ops,\n MaybeRbmmInfo = goal_info_get_maybe_rbmm(CommitGoalInfo),\n (\n MaybeRbmmInfo = no,\n MaybeRegionCommitFrameInfo = no,\n Code = empty\n ;\n MaybeRbmmInfo = yes(RbmmInfo),\n RbmmInfo = rbmm_goal_info(_, CommitRemovedRegionVars, _, _, _),\n\n RemovedRegionVarList = set.to_sorted_list(CommitRemovedRegionVars),\n\n NumRemovedRegionVars = list.length(RemovedRegionVarList),\n\n code_info.get_globals(!.CI, Globals),\n globals.lookup_int_option(Globals, size_region_commit_fixed,\n FixedSize),\n globals.lookup_int_option(Globals, size_region_commit_entry,\n EntrySize),\n FrameSize = FixedSize + EntrySize * NumRemovedRegionVars,\n Items = list.duplicate(FrameSize, slot_region_commit),\n acquire_several_temp_slots(Items, non_persistent_temp_slot,\n StackVars, MainStackId, FirstSlotNum, LastSlotNum, !CI),\n EmbeddedStackFrame = embedded_stack_frame_id(MainStackId,\n FirstSlotNum, LastSlotNum),\n FirstSavedRegionAddr = first_nonfixed_embedded_slot_addr(\n EmbeddedStackFrame, FixedSize),\n acquire_reg(reg_r, NumRegLval, !CI),\n acquire_reg(reg_r, AddrRegLval, !CI),\n PushInitCode = from_list([\n llds_instr(\n push_region_frame(region_stack_commit, EmbeddedStackFrame),\n \"Save stack pointer of embedded region commit stack\"),\n llds_instr(\n assign(NumRegLval, const(llconst_int(0))),\n \"Initialize number of unprotected live regions\"),\n llds_instr(\n assign(AddrRegLval, FirstSavedRegionAddr),\n \"Initialize pointer to the next unprotected live\" ++\n \" region slot\")\n ]),\n save_unprotected_live_regions(NumRegLval, AddrRegLval,\n EmbeddedStackFrame, RemovedRegionVarList, FillCode, !CI),\n SetCode = singleton(\n llds_instr(\n region_set_fixed_slot(region_set_commit_num_entries,\n EmbeddedStackFrame, lval(NumRegLval)),\n \"Store the number of unprotected live regions\")\n ),\n release_reg(NumRegLval, !CI),\n release_reg(AddrRegLval, !CI),\n\n RegionCommitFrameInfo =\n region_commit_stack_frame(EmbeddedStackFrame, StackVars),\n MaybeRegionCommitFrameInfo = yes(RegionCommitFrameInfo),\n\n Code = PushInitCode ++ FillCode ++ SetCode\n )\n ).\n\n:- pred save_unprotected_live_regions(lval::in, lval::in,\n embedded_stack_frame_id::in, list(prog_var)::in, llds_code::out,\n code_info::in, code_info::out) is det.\n\nsave_unprotected_live_regions(_, _, _, [], empty, !CI).\nsave_unprotected_live_regions(NumLval, AddrLval, EmbeddedStackFrame,\n [RegionVar | RegionVars], Code ++ Codes, !CI) :-\n produce_variable(RegionVar, ProduceVarCode, RegionVarRval, !CI),\n SaveCode = singleton(\n llds_instr(\n region_fill_frame(region_fill_commit, EmbeddedStackFrame,\n RegionVarRval, NumLval, AddrLval),\n \"Save the region in the commit stack frame if it is unprotected\")\n ),\n Code = ProduceVarCode ++ SaveCode,\n save_unprotected_live_regions(NumLval, AddrLval, EmbeddedStackFrame,\n RegionVars, Codes, !CI).\n\n:- pred maybe_restore_region_commit_frame(maybe(region_commit_stack_frame)::in,\n llds_code::out, llds_code::out, code_info::in, code_info::out) is det.\n\nmaybe_restore_region_commit_frame(MaybeRegionCommitFrameInfo,\n SuccessCode, FailureCode, !CI) :-\n (\n MaybeRegionCommitFrameInfo = no,\n SuccessCode = empty,\n FailureCode = empty\n ;\n MaybeRegionCommitFrameInfo = yes(RegionCommitFrameInfo),\n RegionCommitFrameInfo = region_commit_stack_frame(EmbeddedStackFrame,\n StackVars),\n SuccessCode = singleton(\n llds_instr(\n use_and_maybe_pop_region_frame(region_commit_success,\n EmbeddedStackFrame),\n \"Destroy removed regions protected by cut away disjunctions\")\n ),\n FailureCode = singleton(\n llds_instr(\n use_and_maybe_pop_region_frame(region_commit_failure,\n EmbeddedStackFrame),\n \"Undo the creation of the commit frame\")\n ),\n release_several_temp_slots(StackVars, non_persistent_temp_slot, !CI)\n ).\n\n%---------------------------------------------------------------------------%\n\n:- pred inside_non_condition(code_info::in, code_info::out) is det.\n\ninside_non_condition(!CI) :-\n get_fail_info(!.CI, FailInfo0),\n FailInfo0 = fail_info(ResumePoints, ResumeKnown, CurfrMaxfr, _, Allow),\n FailInfo = fail_info(ResumePoints, ResumeKnown, CurfrMaxfr,\n inside_non_condition, Allow),\n set_fail_info(FailInfo, !CI).\n\n:- pred create_temp_frame(code_addr::in, string::in, llds_code::out,\n code_info::in, code_info::out) is det.\n\ncreate_temp_frame(Redoip, Comment, Code, !CI) :-\n ( get_proc_model(!.CI) = model_non ->\n Kind = nondet_stack_proc\n ;\n Kind = det_stack_proc\n ),\n Code = singleton(\n llds_instr(mkframe(temp_frame(Kind), yes(Redoip)), Comment)\n ),\n set_created_temp_frame(yes, !CI),\n get_fail_info(!.CI, FailInfo0),\n FailInfo0 = fail_info(ResumePoints, ResumeKnown, _, CondEnv, Allow),\n FailInfo = fail_info(ResumePoints, ResumeKnown, may_be_different,\n CondEnv, Allow),\n set_fail_info(FailInfo, !CI).\n\n%---------------------------------------------------------------------------%\n\neffect_resume_point(ResumePoint, CodeModel, Code, !CI) :-\n get_fail_info(!.CI, FailInfo0),\n FailInfo0 = fail_info(ResumePoints0, _ResumeKnown, CurfrMaxfr,\n CondEnv, Allow),\n ( stack.top(ResumePoints0, OldResumePoint) ->\n pick_first_resume_point(OldResumePoint, OldMap, _),\n pick_first_resume_point(ResumePoint, NewMap, _),\n map.keys(OldMap, OldKeys),\n map.keys(NewMap, NewKeys),\n set.list_to_set(OldKeys, OldKeySet),\n set.list_to_set(NewKeys, NewKeySet),\n expect(set.subset(OldKeySet, NewKeySet), $module, $pred,\n \"non-nested resume point variable sets\")\n ;\n true\n ),\n stack.push(ResumePoint, ResumePoints0, ResumePoints),\n (\n CodeModel = model_non,\n pick_stack_resume_point(ResumePoint, _, StackLabel),\n LabelConst = const(llconst_code_addr(StackLabel)),\n Code = singleton(\n llds_instr(assign(redoip_slot(lval(maxfr)), LabelConst),\n \"hijack redoip to effect resume point\")\n ),\n RedoipUpdate = has_been_done\n ;\n ( CodeModel = model_det\n ; CodeModel = model_semi\n ),\n Code = empty,\n RedoipUpdate = wont_be_done\n ),\n FailInfo = fail_info(ResumePoints, resume_point_known(RedoipUpdate),\n CurfrMaxfr, CondEnv, Allow),\n set_fail_info(FailInfo, !CI).\n\npop_resume_point(!CI) :-\n get_fail_info(!.CI, FailInfo0),\n FailInfo0 = fail_info(ResumePoints0, ResumeKnown, CurfrMaxfr,\n CondEnv, Allow),\n stack.det_pop(_, ResumePoints0, ResumePoints),\n FailInfo = fail_info(ResumePoints, ResumeKnown, CurfrMaxfr,\n CondEnv, Allow),\n set_fail_info(FailInfo, !CI).\n\n%---------------------------------------------------------------------------%\n\ntop_resume_point(CI, ResumePoint) :-\n get_fail_info(CI, FailInfo),\n FailInfo = fail_info(ResumePoints, _, _, _, _),\n stack.det_top(ResumePoints, ResumePoint).\n\nset_resume_point_to_unknown(!CI) :-\n get_fail_info(!.CI, FailInfo0),\n FailInfo0 = fail_info(ResumePoints, _, CurfrMaxfr, CondEnv, Allow),\n FailInfo = fail_info(ResumePoints, resume_point_unknown,\n CurfrMaxfr, CondEnv, Allow),\n set_fail_info(FailInfo, !CI).\n\nset_resume_point_and_frame_to_unknown(!CI) :-\n get_fail_info(!.CI, FailInfo0),\n FailInfo0 = fail_info(ResumePoints, _, _, CondEnv, Allow),\n FailInfo = fail_info(ResumePoints, resume_point_unknown, may_be_different,\n CondEnv, Allow),\n set_fail_info(FailInfo, !CI).\n\n%---------------------------------------------------------------------------%\n\ngenerate_failure(Code, !CI) :-\n get_fail_info(!.CI, FailInfo),\n FailInfo = fail_info(ResumePoints, ResumeKnown, _, _, _),\n (\n ResumeKnown = resume_point_known(_),\n stack.det_top(ResumePoints, TopResumePoint),\n ( pick_matching_resume_addr(!.CI, TopResumePoint, FailureAddress0) ->\n FailureAddress = FailureAddress0,\n PlaceCode = empty\n ;\n pick_first_resume_point(TopResumePoint, Map, FailureAddress),\n map.to_assoc_list(Map, AssocList),\n remember_position(!.CI, CurPos),\n pick_and_place_vars(AssocList, _, PlaceCode, !CI),\n reset_to_position(CurPos, !CI)\n ),\n BranchCode = singleton(llds_instr(goto(FailureAddress), \"fail\")),\n Code = PlaceCode ++ BranchCode\n ;\n ResumeKnown = resume_point_unknown,\n Code = singleton(llds_instr(goto(do_redo), \"fail\"))\n ).\n\nfail_if_rval_is_false(Rval0, Code, !CI) :-\n get_fail_info(!.CI, FailInfo),\n FailInfo = fail_info(ResumePoints, ResumeKnown, _, _, _),\n (\n ResumeKnown = resume_point_known(_),\n stack.det_top(ResumePoints, TopResumePoint),\n ( pick_matching_resume_addr(!.CI, TopResumePoint, FailureAddress0) ->\n % We branch away if the test *fails*\n code_util.neg_rval(Rval0, Rval),\n Code = singleton(\n llds_instr(if_val(Rval, FailureAddress0), \"Test for failure\")\n )\n ;\n pick_first_resume_point(TopResumePoint, Map, FailureAddress),\n map.to_assoc_list(Map, AssocList),\n get_next_label(SuccessLabel, !CI),\n remember_position(!.CI, CurPos),\n pick_and_place_vars(AssocList, _, PlaceCode, !CI),\n reset_to_position(CurPos, !CI),\n SuccessAddress = code_label(SuccessLabel),\n % We branch away if the test *fails*, therefore if the test\n % succeeds, we branch around the code that moves variables to\n % their failure locations and branches away to the failure\n % continuation.\n TestCode = singleton(\n llds_instr(if_val(Rval0, SuccessAddress), \"Test for failure\")\n ),\n TailCode = from_list([\n llds_instr(goto(FailureAddress), \"Goto failure\"),\n llds_instr(label(SuccessLabel), \"Success continuation\")\n ]),\n Code = TestCode ++ PlaceCode ++ TailCode\n )\n ;\n ResumeKnown = resume_point_unknown,\n % We branch away if the test *fails*\n code_util.neg_rval(Rval0, Rval),\n Code = singleton(\n llds_instr(if_val(Rval, do_redo), \"Test for failure\")\n )\n ).\n\n%---------------------------------------------------------------------------%\n\nfailure_is_direct_branch(CI, CodeAddr) :-\n get_fail_info(CI, FailInfo),\n FailInfo = fail_info(ResumePoints, resume_point_known(_), _, _, _),\n stack.top(ResumePoints, TopResumePoint),\n pick_matching_resume_addr(CI, TopResumePoint, CodeAddr).\n\nmay_use_nondet_tailcall(CI, TailCallStatus) :-\n get_fail_info(CI, FailInfo),\n FailInfo = fail_info(ResumePoints0, ResumeKnown, _, _, _),\n (\n stack.pop(ResumePoint1, ResumePoints0, ResumePoints1),\n stack.is_empty(ResumePoints1),\n ResumePoint1 = stack_only(_, do_fail)\n ->\n (\n ResumeKnown = resume_point_known(_),\n TailCallStatus = unchecked_tail_call\n ;\n ResumeKnown = resume_point_unknown,\n TailCallStatus = checked_tail_call\n )\n ;\n TailCallStatus = no_tail_call\n ).\n\n%---------------------------------------------------------------------------%\n\n % See whether the current locations of variables match the locations\n % associated with any of the options in the given failure map.\n % If yes, return the code_addr of that option.\n %\n:- pred pick_matching_resume_addr(code_info::in,\n resume_point_info::in, code_addr::out) is semidet.\n\npick_matching_resume_addr(CI, ResumeMaps, Addr) :-\n variable_locations(CI, CurLocs),\n (\n ResumeMaps = orig_only(Map1, Addr1),\n ( match_resume_loc(Map1, CurLocs) ->\n Addr = Addr1\n ;\n fail\n )\n ;\n ResumeMaps = stack_only(Map1, Addr1),\n ( match_resume_loc(Map1, CurLocs) ->\n Addr = Addr1\n ;\n fail\n )\n ;\n ResumeMaps = orig_and_stack(Map1, Addr1, Map2, Addr2),\n ( match_resume_loc(Map1, CurLocs) ->\n Addr = Addr1\n ; match_resume_loc(Map2, CurLocs) ->\n Addr = Addr2\n ;\n fail\n )\n ;\n ResumeMaps = stack_and_orig(Map1, Addr1, Map2, Addr2),\n ( match_resume_loc(Map1, CurLocs) ->\n Addr = Addr1\n ; match_resume_loc(Map2, CurLocs) ->\n Addr = Addr2\n ;\n fail\n )\n ).\n\n:- pred match_resume_loc(resume_map::in, resume_map::in) is semidet.\n\nmatch_resume_loc(Map, Locations0) :-\n map.keys(Map, KeyList),\n set.list_to_set(KeyList, Keys),\n map.select(Locations0, Keys, Locations),\n map.to_assoc_list(Locations, List),\n all_vars_match_resume_map(Map, List).\n\n:- pred all_vars_match_resume_map(resume_map::in,\n assoc_list(prog_var, set(lval))::in) is semidet.\n\nall_vars_match_resume_map(_Map, []).\nall_vars_match_resume_map(Map, [Var - Actual | VarsActuals]) :-\n map.search(Map, Var, Lvals),\n set.subset(Lvals, Actual),\n all_vars_match_resume_map(Map, VarsActuals).\n\n:- pred pick_first_resume_point(resume_point_info::in,\n resume_map::out, code_addr::out) is det.\n\npick_first_resume_point(orig_only(Map, Addr), Map, Addr).\npick_first_resume_point(stack_only(Map, Addr), Map, Addr).\npick_first_resume_point(orig_and_stack(Map, Addr, _, _), Map, Addr).\npick_first_resume_point(stack_and_orig(Map, Addr, _, _), Map, Addr).\n\n:- pred pick_stack_resume_point(resume_point_info::in,\n resume_map::out, code_addr::out) is det.\n\npick_stack_resume_point(ResumePoint, Map, Addr) :-\n ( maybe_pick_stack_resume_point(ResumePoint, Map1, Addr1) ->\n Map = Map1,\n Addr = Addr1\n ;\n unexpected($module, $pred, \"no stack resume point\")\n ).\n\n:- pred maybe_pick_stack_resume_point(resume_point_info::in,\n resume_map::out, code_addr::out) is semidet.\n\nmaybe_pick_stack_resume_point(stack_only(Map, Addr), Map, Addr).\nmaybe_pick_stack_resume_point(orig_and_stack(_, _, Map, Addr),\n Map, Addr).\nmaybe_pick_stack_resume_point(stack_and_orig(Map, Addr, _, _),\n Map, Addr).\n\n%---------------------------------------------------------------------------%\n\nproduce_vars([], Map, empty, !CI) :-\n map.init(Map).\nproduce_vars([Var | Vars], Map, Code, !CI) :-\n produce_vars(Vars, Map0, CodeVars, !CI),\n produce_variable_in_reg_or_stack(Var, CodeVar, Lval, !CI),\n Lvals = set.make_singleton_set(Lval),\n map.set(Var, Lvals, Map0, Map),\n Code = CodeVars ++ CodeVar.\n\nflush_resume_vars_to_stack(Code, !CI) :-\n compute_resume_var_stack_locs(!.CI, VarLocs),\n place_vars(VarLocs, Code, !CI).\n\n:- pred compute_resume_var_stack_locs(code_info::in,\n assoc_list(prog_var, lval)::out) is det.\n\ncompute_resume_var_stack_locs(CI, VarLocs) :-\n get_fail_info(CI, FailInfo),\n FailInfo = fail_info(ResumePointStack, _, _, _, _),\n stack.det_top(ResumePointStack, ResumePoint),\n pick_stack_resume_point(ResumePoint, StackMap, _),\n map.to_assoc_list(StackMap, VarLocSets),\n pick_var_places(VarLocSets, VarLocs).\n\n%---------------------------------------------------------------------------%\n\n:- pred init_fail_info(code_model::in, maybe(set_of_progvar)::in,\n resume_point_info::out, code_info::in, code_info::out) is det.\n\ninit_fail_info(CodeModel, MaybeFailVars, ResumePoint, !CI) :-\n (\n CodeModel = model_det,\n get_next_label(ResumeLabel, !CI),\n ResumeAddress = code_label(ResumeLabel),\n ResumeKnown = resume_point_unknown,\n CurfrMaxfr = may_be_different\n ;\n CodeModel = model_semi,\n % The resume point for this label will be part of the procedure epilog.\n get_next_label(ResumeLabel, !CI),\n ResumeAddress = code_label(ResumeLabel),\n ResumeKnown = resume_point_known(wont_be_done),\n CurfrMaxfr = may_be_different\n ;\n CodeModel = model_non,\n (\n MaybeFailVars = yes(_),\n get_next_label(ResumeLabel, !CI),\n ResumeAddress = code_label(ResumeLabel)\n ;\n MaybeFailVars = no,\n ResumeAddress = do_fail\n ),\n ResumeKnown = resume_point_known(has_been_done),\n CurfrMaxfr = must_be_equal\n ),\n (\n MaybeFailVars = yes(FailVars),\n get_stack_slots(!.CI, StackSlots),\n map.select_sorted_list(StackSlots, set_of_var.to_sorted_list(FailVars),\n AbsStackMap),\n map.to_assoc_list(AbsStackMap, AbsStackList),\n StackList0 = assoc_list.map_values_only(stack_slot_to_lval,\n AbsStackList),\n make_singleton_sets(StackList0, StackList),\n map.from_sorted_assoc_list(StackList, StackMap)\n ;\n MaybeFailVars = no,\n map.init(StackMap)\n ),\n ResumePoint = stack_only(StackMap, ResumeAddress),\n stack.init(ResumeStack0),\n stack.push(ResumePoint, ResumeStack0, ResumeStack),\n get_fail_info(!.CI, FailInfo0),\n FailInfo0 = fail_info(_, _, _, _, Allow),\n FailInfo = fail_info(ResumeStack, ResumeKnown, CurfrMaxfr,\n not_inside_non_condition, Allow),\n set_fail_info(FailInfo, !CI).\n\n%---------------------------------------------------------------------------%\n\nmake_resume_point(ResumeVars, ResumeLocs, FullMap, ResumePoint, !CI) :-\n get_stack_slots(!.CI, StackSlots),\n map.select_sorted_list(FullMap, ResumeVars, OrigMap),\n (\n ResumeLocs = resume_locs_orig_only,\n get_next_label(OrigLabel, !CI),\n OrigAddr = code_label(OrigLabel),\n ResumePoint = orig_only(OrigMap, OrigAddr),\n trace [compiletime(flag(\"codegen_goal\")), io(!IO)] (\n ( should_trace_code_gen(!.CI) ->\n code_info.get_varset(!.CI, VarSet),\n io.write_string(\"orig_only\\n\", !IO),\n output_resume_map(VarSet, OrigMap, !IO),\n io.flush_output(!IO)\n ;\n true\n )\n )\n ;\n ResumeLocs = resume_locs_stack_only,\n make_stack_resume_map(ResumeVars, StackSlots, StackMap),\n get_next_label(StackLabel, !CI),\n StackAddr = code_label(StackLabel),\n ResumePoint = stack_only(StackMap, StackAddr),\n trace [compiletime(flag(\"codegen_goal\")), io(!IO)] (\n ( should_trace_code_gen(!.CI) ->\n code_info.get_varset(!.CI, VarSet),\n io.write_string(\"stack_only\\n\", !IO),\n output_resume_map(VarSet, StackMap, !IO),\n io.flush_output(!IO)\n ;\n true\n )\n )\n ;\n ResumeLocs = resume_locs_orig_and_stack,\n make_stack_resume_map(ResumeVars, StackSlots, StackMap),\n get_next_label(OrigLabel, !CI),\n OrigAddr = code_label(OrigLabel),\n get_next_label(StackLabel, !CI),\n StackAddr = code_label(StackLabel),\n ResumePoint = orig_and_stack(OrigMap, OrigAddr, StackMap, StackAddr),\n trace [compiletime(flag(\"codegen_goal\")), io(!IO)] (\n ( should_trace_code_gen(!.CI) ->\n code_info.get_varset(!.CI, VarSet),\n io.write_string(\"stack_and_orig\\n\", !IO),\n io.write_string(\"orig:\\n\", !IO),\n output_resume_map(VarSet, OrigMap, !IO),\n io.write_string(\"stack:\\n\", !IO),\n output_resume_map(VarSet, StackMap, !IO),\n io.flush_output(!IO)\n ;\n true\n )\n )\n ;\n ResumeLocs = resume_locs_stack_and_orig,\n make_stack_resume_map(ResumeVars, StackSlots, StackMap),\n get_next_label(StackLabel, !CI),\n StackAddr = code_label(StackLabel),\n get_next_label(OrigLabel, !CI),\n OrigAddr = code_label(OrigLabel),\n ResumePoint = stack_and_orig(StackMap, StackAddr, OrigMap, OrigAddr),\n trace [compiletime(flag(\"codegen_goal\")), io(!IO)] (\n ( should_trace_code_gen(!.CI) ->\n code_info.get_varset(!.CI, VarSet),\n io.write_string(\"stack_and_orig\\n\", !IO),\n io.write_string(\"stack:\\n\", !IO),\n output_resume_map(VarSet, StackMap, !IO),\n io.write_string(\"orig:\\n\", !IO),\n output_resume_map(VarSet, OrigMap, !IO),\n io.flush_output(!IO)\n ;\n true\n )\n )\n ).\n\n:- pred make_stack_resume_map(list(prog_var)::in, stack_slots::in,\n map(prog_var, set(lval))::out) is det.\n\nmake_stack_resume_map(ResumeVars, StackSlots, StackMap) :-\n map.select_sorted_list(StackSlots, ResumeVars, StackMap0),\n map.to_assoc_list(StackMap0, AbsStackList),\n StackList0 = assoc_list.map_values_only(stack_slot_to_lval, AbsStackList),\n make_singleton_sets(StackList0, StackList),\n map.from_sorted_assoc_list(StackList, StackMap).\n\n:- pred make_singleton_sets(assoc_list(prog_var, lval)::in,\n assoc_list(prog_var, set(lval))::out) is det.\n\nmake_singleton_sets([], []).\nmake_singleton_sets([Var - Lval | Tail], [Var - Lvals | SetTail]) :-\n Lvals = set.make_singleton_set(Lval),\n make_singleton_sets(Tail, SetTail).\n\n%---------------------------------------------------------------------------%\n\n % The code we generate for a resumption point looks like this:\n %\n % label(StackLabel)\n % \n % \n % label(OrigLabel)\n % \n %\n % Failures at different points may cause control to arrive at\n % the resumption point via either label, which is why the last\n % line is necessary.\n %\n % The idea is that failures from other procedures will go to\n % StackLabel, and that failures from this procedure while\n % everything is in its original place will go to OrigLabel.\n % Failures from this procedure where not everything is in its\n % original place can go to either, after moving the resume variables\n % to the places where the label expects them.\n %\n % The above layout (stack, then orig) is the most common. However,\n % liveness.m may decide that one or other of the two labels will\n % never be referred to (e.g. because there are no calls inside\n % the range of effect of the resumption point or because a call\n % follows immediately after the establishment of the resumption\n % point), or that it would be more efficient to put the two labels\n % in the other order (e.g. because the code after the resumption point\n % needs most of the variables in their stack slots).\n\ngenerate_resume_point(ResumePoint, Code, !CI) :-\n (\n ResumePoint = orig_only(Map1, Addr1),\n extract_label_from_code_addr(Addr1, Label1),\n Code = singleton(\n llds_instr(label(Label1), \"orig only failure continuation\")\n ),\n set_var_locations(Map1, !CI)\n ;\n ResumePoint = stack_only(Map1, Addr1),\n extract_label_from_code_addr(Addr1, Label1),\n Code = singleton(\n llds_instr(label(Label1), \"stack only failure continuation\")\n ),\n set_var_locations(Map1, !CI),\n generate_resume_layout(Label1, Map1, !CI)\n ;\n ResumePoint = stack_and_orig(Map1, Addr1, Map2, Addr2),\n extract_label_from_code_addr(Addr1, Label1),\n extract_label_from_code_addr(Addr2, Label2),\n Label1Code = singleton(\n llds_instr(label(Label1), \"stack failure continuation before orig\")\n ),\n set_var_locations(Map1, !CI),\n generate_resume_layout(Label1, Map1, !CI),\n map.to_assoc_list(Map2, AssocList2),\n place_resume_vars(AssocList2, PlaceCode, !CI),\n Label2Code = singleton(\n llds_instr(label(Label2), \"orig failure continuation after stack\")\n ),\n set_var_locations(Map2, !CI),\n Code = Label1Code ++ PlaceCode ++ Label2Code\n ;\n ResumePoint = orig_and_stack(Map1, Addr1, Map2, Addr2),\n extract_label_from_code_addr(Addr1, Label1),\n extract_label_from_code_addr(Addr2, Label2),\n Label1Code = singleton(\n llds_instr(label(Label1), \"orig failure continuation before stack\")\n ),\n set_var_locations(Map1, !CI),\n map.to_assoc_list(Map2, AssocList2),\n place_resume_vars(AssocList2, PlaceCode, !CI),\n Label2Code = singleton(\n llds_instr(label(Label2), \"stack failure continuation after orig\")\n ),\n set_var_locations(Map2, !CI),\n generate_resume_layout(Label2, Map2, !CI),\n Code = Label1Code ++ PlaceCode ++ Label2Code\n ).\n\n:- pred extract_label_from_code_addr(code_addr::in, label::out) is det.\n\nextract_label_from_code_addr(CodeAddr, Label) :-\n ( CodeAddr = code_label(Label0) ->\n Label = Label0\n ;\n unexpected($module, $pred, \"non-label\")\n ).\n\n:- pred place_resume_vars(assoc_list(prog_var, set(lval))::in,\n llds_code::out, code_info::in, code_info::out) is det.\n\nplace_resume_vars([], empty, !CI).\nplace_resume_vars([Var - TargetSet | Rest], Code, !CI) :-\n set.to_sorted_list(TargetSet, Targets),\n place_resume_var(Var, Targets, FirstCode, !CI),\n place_resume_vars(Rest, RestCode, !CI),\n Code = FirstCode ++ RestCode.\n\n:- pred place_resume_var(prog_var::in, list(lval)::in,\n llds_code::out, code_info::in, code_info::out) is det.\n\nplace_resume_var(_Var, [], empty, !CI).\nplace_resume_var(Var, [Target | Targets], Code, !CI) :-\n place_var(Var, Target, FirstCode, !CI),\n place_resume_var(Var, Targets, RestCode, !CI),\n Code = FirstCode ++ RestCode.\n\n % Reset the code generator's database of what is where.\n % Remember that the variables in the map are available in their\n % associated rvals; forget about all other variables.\n %\n:- pred set_var_locations(resume_map::in,\n code_info::in, code_info::out) is det.\n\nset_var_locations(Map, !CI) :-\n map.to_assoc_list(Map, LvalList0),\n flatten_varlval_list(LvalList0, LvalList),\n get_var_locn_info(!.CI, VarLocnInfo0),\n reinit_var_locn_state(LvalList, VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\n:- pred flatten_varlval_list(assoc_list(prog_var, set(lval))::in,\n assoc_list(prog_var, lval)::out) is det.\n\nflatten_varlval_list([], []).\nflatten_varlval_list([V - Rvals | Rest0], All) :-\n flatten_varlval_list(Rest0, Rest),\n set.to_sorted_list(Rvals, RvalList),\n flatten_varlval_list_2(RvalList, V, Rest1),\n list.append(Rest1, Rest, All).\n\n:- pred flatten_varlval_list_2(list(lval)::in, prog_var::in,\n assoc_list(prog_var, lval)::out) is det.\n\nflatten_varlval_list_2([], _V, []).\nflatten_varlval_list_2([R | Rs], V, [V - R | Rest]) :-\n flatten_varlval_list_2(Rs, V, Rest).\n\nresume_point_vars(ResumePoint, Vars) :-\n pick_first_resume_point(ResumePoint, ResumeMap, _),\n map.keys(ResumeMap, Vars).\n\nresume_point_stack_addr(ResumePoint, StackAddr) :-\n pick_stack_resume_point(ResumePoint, _, StackAddr).\n\n%---------------------------------------------------------------------------%\n\n:- pred maybe_save_trail_info(add_trail_ops::in, maybe(pair(lval))::out,\n llds_code::out, code_info::in, code_info::out) is det.\n\nmaybe_save_trail_info(AddTrailOps, MaybeTrailSlots, SaveTrailCode, !CI) :-\n (\n AddTrailOps = add_trail_ops,\n acquire_temp_slot(slot_ticket_counter, non_persistent_temp_slot,\n CounterSlot, !CI),\n acquire_temp_slot(slot_ticket, non_persistent_temp_slot,\n TrailPtrSlot, !CI),\n MaybeTrailSlots = yes(CounterSlot - TrailPtrSlot),\n SaveTrailCode = from_list([\n llds_instr(mark_ticket_stack(CounterSlot),\n \"save the ticket counter\"),\n llds_instr(store_ticket(TrailPtrSlot),\n \"save the trail pointer\")\n ])\n ;\n AddTrailOps = do_not_add_trail_ops,\n MaybeTrailSlots = no,\n SaveTrailCode = empty\n ).\n\n:- pred maybe_restore_trail_info(maybe(pair(lval))::in,\n llds_code::out, llds_code::out, code_info::in, code_info::out) is det.\n\nmaybe_restore_trail_info(MaybeTrailSlots, CommitCode, RestoreCode, !CI) :-\n (\n MaybeTrailSlots = no,\n CommitCode = empty,\n RestoreCode = empty\n ;\n MaybeTrailSlots = yes(CounterSlot - TrailPtrSlot),\n CommitCode = from_list([\n llds_instr(reset_ticket(lval(TrailPtrSlot), reset_reason_commit),\n \"discard trail entries and restore trail ptr\"),\n llds_instr(prune_tickets_to(lval(CounterSlot)),\n \"restore ticket counter (but not high water mark)\")\n ]),\n RestoreCode = from_list([\n llds_instr(reset_ticket(lval(TrailPtrSlot), reset_reason_undo),\n \"apply trail entries and restore trail ptr\"),\n llds_instr(discard_ticket,\n \"restore ticket counter and high water mark\")\n ]),\n release_temp_slot(CounterSlot, non_persistent_temp_slot, !CI),\n release_temp_slot(TrailPtrSlot, non_persistent_temp_slot, !CI)\n ).\n\n%---------------------------------------------------------------------------%\n\n:- pred clone_resume_point(resume_point_info::in,\n resume_point_info::out, code_info::in, code_info::out) is det.\n\nclone_resume_point(ResumePoint0, ResumePoint, !CI) :-\n (\n ResumePoint0 = orig_only(_, _),\n unexpected($module, $pred, \"cloning orig_only resume point\")\n ;\n ResumePoint0 = stack_only(Map1, _),\n get_next_label(Label1, !CI),\n Addr1 = code_label(Label1),\n ResumePoint = stack_only(Map1, Addr1)\n ;\n ResumePoint0 = stack_and_orig(Map1, _, Map2, _),\n get_next_label(Label1, !CI),\n Addr1 = code_label(Label1),\n get_next_label(Label2, !CI),\n Addr2 = code_label(Label2),\n ResumePoint = stack_and_orig(Map1, Addr1, Map2, Addr2)\n ;\n ResumePoint0 = orig_and_stack(Map1, _, Map2, _),\n get_next_label(Label2, !CI),\n Addr2 = code_label(Label2),\n get_next_label(Label1, !CI),\n Addr1 = code_label(Label1),\n ResumePoint = stack_and_orig(Map2, Addr2, Map1, Addr1)\n ).\n\n%---------------------------------------------------------------------------%\n%---------------------------------------------------------------------------%\n\n % Submodule to deal with liveness issues.\n\n % The principles underlying this submodule of code_info.m are\n % documented in the file compiler/notes/allocation.html.\n\n:- interface.\n\n:- pred add_forward_live_vars(set_of_progvar::in,\n code_info::in, code_info::out) is det.\n\n:- pred get_known_variables(code_info::in, list(prog_var)::out) is det.\n\n:- pred variable_is_forward_live(code_info::in, prog_var::in) is semidet.\n\n:- pred make_vars_forward_dead(set_of_progvar::in,\n code_info::in, code_info::out) is det.\n\n:- pred maybe_make_vars_forward_dead(set_of_progvar::in, bool::in,\n code_info::in, code_info::out) is det.\n\n:- pred pickup_zombies(set_of_progvar::out,\n code_info::in, code_info::out) is det.\n\n%---------------------------------------------------------------------------%\n\n:- implementation.\n\n:- pred rem_forward_live_vars(set_of_progvar::in,\n code_info::in, code_info::out) is det.\n\n % Make these variables appear magically live.\n % We don't care where they are put.\n %\n:- pred make_vars_forward_live(set_of_progvar::in,\n code_info::in, code_info::out) is det.\n\nget_known_variables(CI, VarList) :-\n get_forward_live_vars(CI, ForwardLiveVars),\n ResumeVars = current_resume_point_vars(CI),\n set_of_var.union(ForwardLiveVars, ResumeVars, Vars),\n VarList = set_of_var.to_sorted_list(Vars).\n\nvariable_is_forward_live(CI, Var) :-\n get_forward_live_vars(CI, Liveness),\n set_of_var.member(Liveness, Var).\n\nadd_forward_live_vars(Births, !CI) :-\n get_forward_live_vars(!.CI, Liveness0),\n set_of_var.union(Liveness0, Births, Liveness),\n set_forward_live_vars(Liveness, !CI).\n\nrem_forward_live_vars(Deaths, !CI) :-\n get_forward_live_vars(!.CI, Liveness0),\n set_of_var.difference(Liveness0, Deaths, Liveness),\n set_forward_live_vars(Liveness, !CI).\n\nmake_vars_forward_live(Vars, !CI) :-\n get_stack_slots(!.CI, StackSlots),\n get_var_locn_info(!.CI, VarLocnInfo0),\n VarList = set_of_var.to_sorted_list(Vars),\n make_vars_forward_live_2(VarList, StackSlots, 1,\n VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\n:- pred make_vars_forward_live_2(list(prog_var)::in,\n stack_slots::in, int::in, var_locn_info::in, var_locn_info::out)\n is det.\n\nmake_vars_forward_live_2([], _, _, !VarLocnInfo).\nmake_vars_forward_live_2([Var | Vars], StackSlots, N0, !VarLocnInfo) :-\n ( map.search(StackSlots, Var, Slot) ->\n Lval = stack_slot_to_lval(Slot),\n N1 = N0\n ;\n % reg_r is fine since we don't care where the variables are put.\n RegType = reg_r,\n find_unused_reg(!.VarLocnInfo, RegType, N0, N1),\n Lval = reg(RegType, N1)\n ),\n var_locn_set_magic_var_location(Var, Lval, !VarLocnInfo),\n make_vars_forward_live_2(Vars, StackSlots, N1, !VarLocnInfo).\n\n:- pred find_unused_reg(var_locn_info::in, reg_type::in, int::in, int::out)\n is det.\n\nfind_unused_reg(VLI, RegType, N0, N) :-\n ( var_locn_lval_in_use(VLI, reg(RegType, N0)) ->\n find_unused_reg(VLI, RegType, N0 + 1, N)\n ;\n N = N0\n ).\n\nmake_vars_forward_dead(Vars, !CI) :-\n maybe_make_vars_forward_dead(Vars, yes, !CI).\n\nmaybe_make_vars_forward_dead(Vars0, FirstTime, !CI) :-\n ResumeVars = current_resume_point_vars(!.CI),\n set_of_var.intersect(Vars0, ResumeVars, FlushVars),\n get_zombies(!.CI, Zombies0),\n set_of_var.union(Zombies0, FlushVars, Zombies),\n set_zombies(Zombies, !CI),\n set_of_var.difference(Vars0, Zombies, Vars),\n VarList = set_of_var.to_sorted_list(Vars),\n get_var_locn_info(!.CI, VarLocnInfo0),\n maybe_make_vars_forward_dead_2(VarList, FirstTime,\n VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\n:- pred maybe_make_vars_forward_dead_2(list(prog_var)::in, bool::in,\n var_locn_info::in, var_locn_info::out) is det.\n\nmaybe_make_vars_forward_dead_2([], _, !VLI).\nmaybe_make_vars_forward_dead_2([Var | Vars], FirstTime, !VLI) :-\n var_locn_var_becomes_dead(Var, FirstTime, !VLI),\n maybe_make_vars_forward_dead_2(Vars, FirstTime, !VLI).\n\npickup_zombies(Zombies, !CI) :-\n get_zombies(!.CI, Zombies),\n set_zombies(set_of_var.init, !CI).\n\n%---------------------------------------------------------------------------%\n%---------------------------------------------------------------------------%\n\n % Submodule for handling the saving and restoration\n % of trail tickets, heap pointers, stack pointers etc.\n\n:- interface.\n\n:- pred save_hp(llds_code::out, lval::out,\n code_info::in, code_info::out) is det.\n\n:- pred restore_hp(lval::in, llds_code::out) is det.\n\n:- pred release_hp(lval::in, code_info::in, code_info::out) is det.\n\n:- pred restore_and_release_hp(lval::in, llds_code::out,\n code_info::in, code_info::out) is det.\n\n:- pred maybe_save_hp(bool::in, llds_code::out, maybe(lval)::out,\n code_info::in, code_info::out) is det.\n\n:- pred maybe_restore_hp(maybe(lval)::in, llds_code::out) is det.\n\n:- pred maybe_release_hp(maybe(lval)::in,\n code_info::in, code_info::out) is det.\n\n:- pred maybe_restore_and_release_hp(maybe(lval)::in,\n llds_code::out, code_info::in, code_info::out) is det.\n\n:- pred save_ticket(llds_code::out, lval::out,\n code_info::in, code_info::out) is det.\n\n:- pred reset_ticket(lval::in, reset_trail_reason::in, llds_code::out) is det.\n\n:- pred release_ticket(lval::in, code_info::in, code_info::out) is det.\n\n:- pred reset_and_prune_ticket(lval::in, reset_trail_reason::in,\n llds_code::out) is det.\n\n:- pred reset_prune_and_release_ticket(lval::in, reset_trail_reason::in,\n llds_code::out, code_info::in, code_info::out) is det.\n\n:- pred reset_and_discard_ticket(lval::in, reset_trail_reason::in,\n llds_code::out) is det.\n\n:- pred reset_discard_and_release_ticket(lval::in, reset_trail_reason::in,\n llds_code::out, code_info::in, code_info::out) is det.\n\n:- pred discard_and_release_ticket(lval::in, llds_code::out,\n code_info::in, code_info::out) is det.\n\n:- pred maybe_save_ticket(add_trail_ops::in, llds_code::out,\n maybe(lval)::out, code_info::in, code_info::out) is det.\n\n:- pred maybe_reset_ticket(maybe(lval)::in, reset_trail_reason::in,\n llds_code::out) is det.\n\n:- pred maybe_release_ticket(maybe(lval)::in,\n code_info::in, code_info::out) is det.\n\n:- pred maybe_reset_and_prune_ticket(maybe(lval)::in,\n reset_trail_reason::in, llds_code::out) is det.\n\n:- pred maybe_reset_prune_and_release_ticket(maybe(lval)::in,\n reset_trail_reason::in, llds_code::out, code_info::in, code_info::out)\n is det.\n\n:- pred maybe_reset_and_discard_ticket(maybe(lval)::in,\n reset_trail_reason::in, llds_code::out) is det.\n\n:- pred maybe_reset_discard_and_release_ticket(maybe(lval)::in,\n reset_trail_reason::in, llds_code::out, code_info::in, code_info::out)\n is det.\n\n:- pred maybe_discard_and_release_ticket(maybe(lval)::in, llds_code::out,\n code_info::in, code_info::out) is det.\n\n % Should we add trail ops to the code we generate for the goal with the\n % given goal_info. This will be 'no' unless we are in a trailing grade.\n %\n:- func should_add_trail_ops(code_info, hlds_goal_info) = add_trail_ops.\n\n % Should we add region ops to the code we generate for the goal with the\n % given goal_info. This will be 'no' unless we are in a rbmm grade.\n %\n:- func should_add_region_ops(code_info, hlds_goal_info) = add_region_ops.\n\n%---------------------------------------------------------------------------%\n\n:- implementation.\n\nsave_hp(Code, HpSlot, !CI) :-\n acquire_temp_slot(slot_lval(hp), non_persistent_temp_slot, HpSlot, !CI),\n Code = singleton(\n llds_instr(mark_hp(HpSlot), \"Save heap pointer\")\n ).\n\nrestore_hp(HpSlot, Code) :-\n Code = singleton(\n llds_instr(restore_hp(lval(HpSlot)), \"Restore heap pointer\")\n ).\n\nrelease_hp(HpSlot, !CI) :-\n release_temp_slot(HpSlot, non_persistent_temp_slot, !CI).\n\nrestore_and_release_hp(HpSlot, Code, !CI) :-\n restore_hp(HpSlot, Code),\n release_hp(HpSlot, !CI).\n\n%---------------------------------------------------------------------------%\n\nmaybe_save_hp(Maybe, Code, MaybeHpSlot, !CI) :-\n (\n Maybe = yes,\n save_hp(Code, HpSlot, !CI),\n MaybeHpSlot = yes(HpSlot)\n ;\n Maybe = no,\n Code = empty,\n MaybeHpSlot = no\n ).\n\nmaybe_restore_hp(MaybeHpSlot, Code) :-\n (\n MaybeHpSlot = yes(HpSlot),\n restore_hp(HpSlot, Code)\n ;\n MaybeHpSlot = no,\n Code = empty\n ).\n\nmaybe_release_hp(MaybeHpSlot, !CI) :-\n (\n MaybeHpSlot = yes(HpSlot),\n release_hp(HpSlot, !CI)\n ;\n MaybeHpSlot = no\n ).\n\nmaybe_restore_and_release_hp(MaybeHpSlot, Code, !CI) :-\n (\n MaybeHpSlot = yes(HpSlot),\n restore_and_release_hp(HpSlot, Code, !CI)\n ;\n MaybeHpSlot = no,\n Code = empty\n ).\n\n%---------------------------------------------------------------------------%\n\nsave_ticket(Code, TicketSlot, !CI) :-\n acquire_temp_slot(slot_ticket, non_persistent_temp_slot, TicketSlot, !CI),\n Code = singleton(\n llds_instr(store_ticket(TicketSlot), \"Save trail state\")\n ).\n\nreset_ticket(TicketSlot, Reason, Code) :-\n Code = singleton(\n llds_instr(reset_ticket(lval(TicketSlot), Reason), \"Reset trail\")\n ).\n\nrelease_ticket(TicketSlot, !CI) :-\n release_temp_slot(TicketSlot, non_persistent_temp_slot, !CI).\n\nreset_and_prune_ticket(TicketSlot, Reason, Code) :-\n Code = from_list([\n llds_instr(reset_ticket(lval(TicketSlot), Reason), \"Restore trail\"),\n llds_instr(prune_ticket, \"Prune ticket stack\")\n ]).\n\nreset_prune_and_release_ticket(TicketSlot, Reason, Code, !CI) :-\n Code = from_list([\n llds_instr(reset_ticket(lval(TicketSlot), Reason), \"Release trail\"),\n llds_instr(prune_ticket, \"Prune ticket stack\")\n ]),\n release_temp_slot(TicketSlot, non_persistent_temp_slot, !CI).\n\nreset_and_discard_ticket(TicketSlot, Reason, Code) :-\n Code = from_list([\n llds_instr(reset_ticket(lval(TicketSlot), Reason), \"Restore trail\"),\n llds_instr(discard_ticket, \"Pop ticket stack\")\n ]).\n\nreset_discard_and_release_ticket(TicketSlot, Reason, Code, !CI) :-\n Code = from_list([\n llds_instr(reset_ticket(lval(TicketSlot), Reason), \"Release trail\"),\n llds_instr(discard_ticket, \"Pop ticket stack\")\n ]),\n release_temp_slot(TicketSlot, non_persistent_temp_slot, !CI).\n\ndiscard_and_release_ticket(TicketSlot, Code, !CI) :-\n Code = singleton(\n llds_instr(discard_ticket, \"Pop ticket stack\")\n ),\n release_temp_slot(TicketSlot, non_persistent_temp_slot, !CI).\n\n%---------------------------------------------------------------------------%\n\nmaybe_save_ticket(AddTrailOps, Code, MaybeTicketSlot, !CI) :-\n (\n AddTrailOps = add_trail_ops,\n save_ticket(Code, TicketSlot, !CI),\n MaybeTicketSlot = yes(TicketSlot)\n ;\n AddTrailOps = do_not_add_trail_ops,\n Code = empty,\n MaybeTicketSlot = no\n ).\n\nmaybe_reset_ticket(MaybeTicketSlot, Reason, Code) :-\n (\n MaybeTicketSlot = yes(TicketSlot),\n reset_ticket(TicketSlot, Reason, Code)\n ;\n MaybeTicketSlot = no,\n Code = empty\n ).\n\nmaybe_release_ticket(MaybeTicketSlot, !CI) :-\n (\n MaybeTicketSlot = yes(TicketSlot),\n release_ticket(TicketSlot, !CI)\n ;\n MaybeTicketSlot = no\n ).\n\nmaybe_reset_and_prune_ticket(MaybeTicketSlot, Reason, Code) :-\n (\n MaybeTicketSlot = yes(TicketSlot),\n reset_and_prune_ticket(TicketSlot, Reason, Code)\n ;\n MaybeTicketSlot = no,\n Code = empty\n ).\n\nmaybe_reset_prune_and_release_ticket(MaybeTicketSlot, Reason,\n Code, !CI) :-\n (\n MaybeTicketSlot = yes(TicketSlot),\n reset_prune_and_release_ticket(TicketSlot, Reason,\n Code, !CI)\n ;\n MaybeTicketSlot = no,\n Code = empty\n ).\n\nmaybe_reset_and_discard_ticket(MaybeTicketSlot, Reason, Code) :-\n (\n MaybeTicketSlot = yes(TicketSlot),\n reset_and_discard_ticket(TicketSlot, Reason, Code)\n ;\n MaybeTicketSlot = no,\n Code = empty\n ).\n\nmaybe_reset_discard_and_release_ticket(MaybeTicketSlot, Reason,\n Code, !CI) :-\n (\n MaybeTicketSlot = yes(TicketSlot),\n reset_discard_and_release_ticket(TicketSlot, Reason,\n Code, !CI)\n ;\n MaybeTicketSlot = no,\n Code = empty\n ).\n\nmaybe_discard_and_release_ticket(MaybeTicketSlot, Code, !CI) :-\n (\n MaybeTicketSlot = yes(TicketSlot),\n discard_and_release_ticket(TicketSlot, Code, !CI)\n ;\n MaybeTicketSlot = no,\n Code = empty\n ).\n\n % XXX We will eventually need to make use of GoalInfo here.\n %\nshould_add_trail_ops(CodeInfo, _GoalInfo) = AddTrailOps :-\n get_emit_trail_ops(CodeInfo, AddTrailOps).\n\n % XXX We will eventually need to make use of GoalInfo here.\n %\nshould_add_region_ops(CodeInfo, _GoalInfo) = AddRegionOps :-\n get_emit_region_ops(CodeInfo, AddRegionOps).\n\n%---------------------------------------------------------------------------%\n%---------------------------------------------------------------------------%\n\n % Submodule to deal with var_locn.\n\n % Most of these procedures just forward to the var_locn module.\n % See var_locn for documentation.\n\n:- interface.\n\n:- pred variable_locations(code_info::in,\n map(prog_var, set(lval))::out) is det.\n\n:- pred set_var_location(prog_var::in, lval::in,\n code_info::in, code_info::out) is det.\n\n:- pred assign_var_to_var(prog_var::in, prog_var::in,\n code_info::in, code_info::out) is det.\n\n:- pred assign_lval_to_var(prog_var::in, lval::in, llds_code::out,\n code_info::in, code_info::out) is det.\n\n:- pred assign_const_to_var(prog_var::in, rval::in,\n code_info::in, code_info::out) is det.\n\n:- pred assign_expr_to_var(prog_var::in, rval::in, llds_code::out,\n code_info::in, code_info::out) is det.\n\n:- pred reassign_mkword_hole_var(prog_var::in, tag::in, rval::in,\n llds_code::out, code_info::in, code_info::out) is det.\n\n:- pred assign_field_lval_expr_to_var(prog_var::in, list(lval)::in, rval::in,\n llds_code::out, code_info::in, code_info::out) is det.\n\n % assign_cell_to_var(Var, ReserveWordAtStart, Ptag, MaybeRvals,\n % AllFilled, MaybeSize, FieldAddrs, TypeMsg, MayUseAtomic, Where,\n % Code, !CI).\n %\n:- pred assign_cell_to_var(prog_var::in, bool::in, tag::in,\n list(cell_arg)::in, how_to_construct::in, maybe(term_size_value)::in,\n maybe(alloc_site_id)::in, may_use_atomic_alloc::in,\n llds_code::out, code_info::in, code_info::out) is det.\n\n:- pred save_reused_cell_fields(prog_var::in, lval::in, llds_code::out,\n list(lval)::out, code_info::in, code_info::out) is det.\n\n:- pred place_var(prog_var::in, lval::in, llds_code::out,\n code_info::in, code_info::out) is det.\n\n:- pred produce_variable(prog_var::in, llds_code::out, rval::out,\n code_info::in, code_info::out) is det.\n\n:- pred produce_variable_in_reg(prog_var::in, llds_code::out,\n lval::out, code_info::in, code_info::out) is det.\n\n:- pred produce_variable_in_reg_or_stack(prog_var::in,\n llds_code::out, lval::out, code_info::in, code_info::out) is det.\n\n:- pred materialize_vars_in_lval(lval::in, lval::out,\n llds_code::out, code_info::in, code_info::out) is det.\n\n:- pred acquire_reg_for_var(prog_var::in, reg_type::in, lval::out,\n code_info::in, code_info::out) is det.\n\n:- pred acquire_reg_not_in_storemap(abs_store_map::in, reg_type::in, lval::out,\n code_info::in, code_info::out) is det.\n\n:- pred acquire_reg(reg_type::in, lval::out,\n code_info::in, code_info::out) is det.\n\n:- pred release_reg(lval::in, code_info::in, code_info::out) is det.\n\n:- pred reserve_r1(llds_code::out, code_info::in, code_info::out) is det.\n\n:- pred clear_r1(llds_code::out, code_info::in, code_info::out) is det.\n\n:- type call_direction\n ---> caller\n ; callee.\n\n % Move variables to where they need to be at the time of the call:\n %\n % - The variables that need to be saved across the call (either because\n % they are forward live after the call or because they are protected\n % by an enclosing resumption point) will be saved on the stack.\n % Note that if the call cannot succeed and the trace level is none,\n % then no variables need to be saved across the call. (If the call\n % cannot succeed but the trace level is not none, then we still\n % save the usual variables on the stack to make them available\n % for up-level printing in the debugger.)\n %\n % - The input arguments will be moved to their registers.\n %\n:- pred setup_call(hlds_goal_info::in, assoc_list(prog_var, arg_info)::in,\n set(lval)::out, llds_code::out, code_info::in, code_info::out) is det.\n\n % Move the output arguments of the current procedure to where\n % they need to be at return.\n %\n:- pred setup_return(assoc_list(prog_var, arg_info)::in,\n set(lval)::out, llds_code::out, code_info::in, code_info::out) is det.\n\n:- pred lock_regs(int::in, int::in, assoc_list(prog_var, lval)::in,\n code_info::in, code_info::out) is det.\n\n:- pred unlock_regs(code_info::in, code_info::out) is det.\n\n % Record the fact that all the registers have been clobbered (as by a\n % call). If the bool argument is true, then the call cannot return, and\n % thus it is OK for this action to delete the last record of the state\n % of a variable.\n %\n:- pred clear_all_registers(bool::in, code_info::in, code_info::out) is det.\n\n:- pred clobber_regs(list(lval)::in, code_info::in, code_info::out) is det.\n\n:- pred save_variables(set_of_progvar::in, set(lval)::out, llds_code::out,\n code_info::in, code_info::out) is det.\n\n:- pred save_variables_on_stack(list(prog_var)::in, llds_code::out,\n code_info::in, code_info::out) is det.\n\n:- pred max_reg_in_use(code_info::in, int::out, int::out) is det.\n\n:- pred magically_put_var_in_unused_reg(prog_var::in,\n code_info::in, code_info::out) is det.\n\n%---------------------------------------------------------------------------%\n\n:- implementation.\n\nvariable_locations(CI, Lvals) :-\n get_var_locn_info(CI, VarLocnInfo),\n var_locn_get_var_locations(VarLocnInfo, Lvals).\n\n:- func rval_map_to_lval_map(prog_var, set(rval)) = set(lval).\n\nrval_map_to_lval_map(_Var, Rvals) =\n set.filter_map(rval_is_lval, Rvals).\n\n:- func rval_is_lval(rval) = lval is semidet.\n\nrval_is_lval(lval(Lval)) = Lval.\n\nset_var_location(Var, Lval, !CI) :-\n get_var_locn_info(!.CI, VarLocnInfo0),\n var_locn_check_and_set_magic_var_location(Var, Lval,\n VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\nassign_var_to_var(Var, AssignedVar, !CI) :-\n get_var_locn_info(!.CI, VarLocnInfo0),\n var_locn_assign_var_to_var(Var, AssignedVar, VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\nassign_lval_to_var(Var, Lval, Code, !CI) :-\n get_var_locn_info(!.CI, VarLocnInfo0),\n get_static_cell_info(!.CI, StaticCellInfo),\n get_module_info(!.CI, ModuleInfo),\n var_locn_assign_lval_to_var(ModuleInfo, Var, Lval,\n StaticCellInfo, Code, VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\nassign_const_to_var(Var, ConstRval, !CI) :-\n get_var_locn_info(!.CI, VarLocnInfo0),\n get_exprn_opts(!.CI, ExprnOpts),\n var_locn_assign_const_to_var(ExprnOpts, Var, ConstRval,\n VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\nassign_expr_to_var(Var, Rval, Code, !CI) :-\n get_var_locn_info(!.CI, VarLocnInfo0),\n Lvals = lvals_in_rval(Rval),\n (\n Lvals = [],\n var_locn_assign_expr_to_var(Var, Rval, Code,\n VarLocnInfo0, VarLocnInfo)\n ;\n Lvals = [_ | _],\n unexpected($module, $pred, \"non-var lvals\")\n ),\n set_var_locn_info(VarLocnInfo, !CI).\n\nreassign_mkword_hole_var(Var, Ptag, Rval, Code, !CI) :-\n get_var_locn_info(!.CI, VarLocnInfo0),\n Lvals = lvals_in_rval(Rval),\n (\n Lvals = [],\n var_locn_reassign_mkword_hole_var(Var, Ptag, Rval, Code,\n VarLocnInfo0, VarLocnInfo)\n ;\n Lvals = [_ | _],\n unexpected($module, $pred, \"non-var lvals\")\n ),\n set_var_locn_info(VarLocnInfo, !CI).\n\nassign_field_lval_expr_to_var(Var, FieldLvals, Rval, Code, !CI) :-\n (\n FieldLvals = [field(MaybeTag, var(BaseVar), _) | RestFieldLvals],\n list.all_true(is_var_field(MaybeTag, BaseVar), RestFieldLvals)\n ->\n (\n Lvals = lvals_in_rval(Rval),\n all [Lval] (\n list.member(Lval, Lvals)\n =>\n list.member(Lval, FieldLvals)\n )\n ->\n get_var_locn_info(!.CI, VarLocnInfo0),\n var_locn_assign_field_lval_expr_to_var(Var, BaseVar, Rval, Code,\n VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI)\n ;\n unexpected($module, $pred, \"rval contains unexpected lval\")\n )\n ;\n unexpected($module, $pred,\n \"FieldLvals not all fields of the same base variable\")\n ).\n\n:- pred is_var_field(maybe(tag)::in, prog_var::in, lval::in) is semidet.\n\nis_var_field(MaybeTag, Var, field(MaybeTag, var(Var), _)).\n\nassign_cell_to_var(Var, ReserveWordAtStart, Ptag, CellArgs, HowToConstruct,\n MaybeSize, MaybeAllocId, MayUseAtomic, Code, !CI) :-\n get_next_label(Label, !CI),\n get_var_locn_info(!.CI, VarLocnInfo0),\n get_static_cell_info(!.CI, StaticCellInfo0),\n get_module_info(!.CI, ModuleInfo),\n get_exprn_opts(!.CI, ExprnOpts),\n var_locn_assign_cell_to_var(ModuleInfo, ExprnOpts, Var, ReserveWordAtStart,\n Ptag, CellArgs, HowToConstruct, MaybeSize, MaybeAllocId, MayUseAtomic,\n Label, Code, StaticCellInfo0, StaticCellInfo,\n VarLocnInfo0, VarLocnInfo),\n set_static_cell_info(StaticCellInfo, !CI),\n set_var_locn_info(VarLocnInfo, !CI).\n\nsave_reused_cell_fields(Var, Lval, Code, Regs, !CI) :-\n get_var_locn_info(!.CI, VarLocnInfo0),\n get_module_info(!.CI, ModuleInfo),\n var_locn_save_cell_fields(ModuleInfo, Var, Lval, Code, Regs,\n VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\nplace_var(Var, Lval, Code, !CI) :-\n get_var_locn_info(!.CI, VarLocnInfo0),\n get_module_info(!.CI, ModuleInfo),\n var_locn_place_var(ModuleInfo, Var, Lval, Code,\n VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\n:- pred pick_and_place_vars(assoc_list(prog_var, set(lval))::in,\n set(lval)::out, llds_code::out, code_info::in, code_info::out) is det.\n\npick_and_place_vars(VarLocSets, LiveLocs, Code, !CI) :-\n pick_var_places(VarLocSets, VarLocs),\n assoc_list.values(VarLocs, Locs),\n set.list_to_set(Locs, LiveLocs),\n place_vars(VarLocs, Code, !CI).\n\n:- pred pick_var_places(assoc_list(prog_var, set(lval))::in,\n assoc_list(prog_var, lval)::out) is det.\n\npick_var_places([], []).\npick_var_places([Var - LvalSet | VarLvalSets], VarLvals) :-\n pick_var_places(VarLvalSets, VarLvals0),\n (\n set.to_sorted_list(LvalSet, LvalList),\n LvalList = [Lval | _]\n ->\n VarLvals = [Var - Lval | VarLvals0]\n ;\n VarLvals = VarLvals0\n ).\n\n:- pred place_vars(assoc_list(prog_var, lval)::in,\n llds_code::out, code_info::in, code_info::out) is det.\n\nplace_vars(VarLocs, Code, !CI) :-\n get_var_locn_info(!.CI, VarLocnInfo0),\n get_module_info(!.CI, ModuleInfo),\n var_locn_place_vars(ModuleInfo, VarLocs, Code, VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\nproduce_variable(Var, Code, Rval, !CI) :-\n get_var_locn_info(!.CI, VarLocnInfo0),\n get_module_info(!.CI, ModuleInfo),\n var_locn_produce_var(ModuleInfo, Var, Rval, Code,\n VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\nproduce_variable_in_reg(Var, Code, Lval, !CI) :-\n get_var_locn_info(!.CI, VarLocnInfo0),\n get_module_info(!.CI, ModuleInfo),\n var_locn_produce_var_in_reg(ModuleInfo, Var, Lval, Code,\n VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\nproduce_variable_in_reg_or_stack(Var, Code, Lval, !CI) :-\n get_var_locn_info(!.CI, VarLocnInfo0),\n get_module_info(!.CI, ModuleInfo),\n var_locn_produce_var_in_reg_or_stack(ModuleInfo, Var, Lval, Code,\n VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\nmaterialize_vars_in_lval(Lval0, Lval, Code, !CI) :-\n get_var_locn_info(!.CI, VarLocnInfo0),\n get_module_info(!.CI, ModuleInfo),\n var_locn_materialize_vars_in_lval(ModuleInfo, Lval0, Lval, Code,\n VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\nacquire_reg_for_var(Var, RegType, Lval, !CI) :-\n get_follow_var_map(!.CI, FollowVarsMap),\n get_next_non_reserved(!.CI, RegType, NextNonReserved),\n get_var_locn_info(!.CI, VarLocnInfo0),\n (\n map.search(FollowVarsMap, Var, PrefLocn),\n PrefLocn = abs_reg(RegType, PrefRegNum),\n PrefRegNum >= 1\n ->\n var_locn_acquire_reg_prefer_given(RegType, PrefRegNum, Lval,\n VarLocnInfo0, VarLocnInfo)\n ;\n % XXX We should only get a register if the map.search succeeded;\n % otherwise we should put the var in its stack slot.\n var_locn_acquire_reg_start_at_given(RegType, NextNonReserved, Lval,\n VarLocnInfo0, VarLocnInfo)\n ),\n set_var_locn_info(VarLocnInfo, !CI).\n\nacquire_reg_not_in_storemap(StoreMap, RegType, Lval, !CI) :-\n map.foldl2(record_highest_used_reg, StoreMap, 0, HighestUsedRegR,\n 0, HighestUsedRegF),\n get_var_locn_info(!.CI, VarLocnInfo0),\n (\n RegType = reg_r,\n NextRegNum = HighestUsedRegR + 1\n ;\n RegType = reg_f,\n NextRegNum = HighestUsedRegF + 1\n ),\n var_locn_acquire_reg_start_at_given(RegType, NextRegNum, Lval,\n VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\n:- pred record_highest_used_reg(prog_var::in, abs_locn::in, int::in, int::out,\n int::in, int::out) is det.\n\nrecord_highest_used_reg(_, AbsLocn, !HighestUsedRegR, !HighestUsedRegF) :-\n (\n AbsLocn = any_reg\n ;\n AbsLocn = abs_reg(reg_r, N),\n int.max(N, !HighestUsedRegR)\n ;\n AbsLocn = abs_reg(reg_f, N),\n int.max(N, !HighestUsedRegF)\n ;\n AbsLocn = abs_stackvar(_, _)\n ;\n AbsLocn = abs_parent_stackvar(_, _)\n ;\n AbsLocn = abs_framevar(_, _)\n ).\n\nacquire_reg(Type, Lval, !CI) :-\n get_var_locn_info(!.CI, VarLocnInfo0),\n var_locn_acquire_reg(Type, Lval, VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\nrelease_reg(Lval, !CI) :-\n get_var_locn_info(!.CI, VarLocnInfo0),\n var_locn_release_reg(Lval, VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\nreserve_r1(Code, !CI) :-\n get_var_locn_info(!.CI, VarLocnInfo0),\n get_module_info(!.CI, ModuleInfo),\n var_locn_clear_r1(ModuleInfo, Code, VarLocnInfo0, VarLocnInfo1),\n var_locn_acquire_reg_require_given(reg(reg_r, 1),\n VarLocnInfo1, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\nclear_r1(empty, !CI) :-\n get_var_locn_info(!.CI, VarLocnInfo0),\n var_locn_release_reg(reg(reg_r, 1), VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\n%---------------------------------------------------------------------------%\n\nsetup_return(VarArgInfos, OutLocs, Code, !CI) :-\n setup_call_args(VarArgInfos, callee, OutLocs, Code, !CI).\n\nsetup_call(GoalInfo, ArgInfos, LiveLocs, Code, !CI) :-\n partition_args(ArgInfos, InArgInfos, OutArgInfos, _UnusedArgInfos),\n assoc_list.keys(OutArgInfos, OutVars),\n set.list_to_set(OutVars, OutVarSet),\n Detism = goal_info_get_determinism(GoalInfo),\n get_opt_no_return_calls(!.CI, OptNoReturnCalls),\n get_module_info(!.CI, ModuleInfo),\n VarTypes = get_var_types(!.CI),\n (\n Detism = detism_erroneous,\n OptNoReturnCalls = yes\n ->\n RealStackVarLocs = [],\n DummyStackVarLocs = []\n ;\n compute_forward_live_var_saves(!.CI, set_to_bitset(OutVarSet),\n ForwardVarLocs),\n CodeModel = goal_info_get_code_model(GoalInfo),\n (\n CodeModel = model_non,\n % Save variables protected by the nearest resumption point on the\n % stack.\n % XXX This should be unnecessary; with the current setup, the code\n % that established the resume point should have saved those\n % variables on the stack already. However, later we should arrange\n % things so that this saving of the resume vars on the stack\n % is delayed until the first call after the setup of the\n % resume point.\n compute_resume_var_stack_locs(!.CI, ResumeVarLocs),\n list.append(ResumeVarLocs, ForwardVarLocs, StackVarLocs)\n ;\n ( CodeModel = model_det\n ; CodeModel = model_semi\n ),\n StackVarLocs = ForwardVarLocs\n ),\n list.filter(valid_stack_slot(ModuleInfo, VarTypes), StackVarLocs,\n RealStackVarLocs, DummyStackVarLocs)\n ),\n get_var_locn_info(!.CI, VarLocnInfo0),\n list.filter(key_var_is_of_non_dummy_type(ModuleInfo, VarTypes),\n InArgInfos, RealInArgInfos),\n var_arg_info_to_lval(RealInArgInfos, RealInArgLocs),\n AllRealLocs = RealStackVarLocs ++ RealInArgLocs,\n AllLocs = DummyStackVarLocs ++ AllRealLocs,\n var_locn_place_vars(ModuleInfo, AllLocs, Code, VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI),\n assoc_list.values(AllRealLocs, LiveLocList),\n set.list_to_set(LiveLocList, LiveLocs).\n\n:- pred key_var_is_of_non_dummy_type(module_info::in, vartypes::in,\n pair(prog_var, arg_info)::in) is semidet.\n\nkey_var_is_of_non_dummy_type(ModuleInfo, VarTypes, Var - _ArgInfo) :-\n var_is_of_non_dummy_type(ModuleInfo, VarTypes, Var).\n\n:- pred valid_stack_slot(module_info::in, vartypes::in,\n pair(prog_var, lval)::in) is semidet.\n\nvalid_stack_slot(ModuleInfo, VarTypes, Var - Lval) :-\n lookup_var_type(VarTypes, Var, Type),\n check_dummy_type(ModuleInfo, Type) = is_not_dummy_type,\n (\n ( Lval = stackvar(N)\n ; Lval = parent_stackvar(N)\n ; Lval = framevar(N)\n ),\n N < 0\n ->\n unexpected($module, $pred, \"nondummy var in dummy stack slot\")\n ;\n true\n ).\n\n:- pred setup_call_args(assoc_list(prog_var, arg_info)::in,\n call_direction::in, set(lval)::out, llds_code::out,\n code_info::in, code_info::out) is det.\n\nsetup_call_args(AllArgsInfos, Direction, LiveLocs, Code, !CI) :-\n list.filter(call_arg_in_selected_dir(Direction), AllArgsInfos, ArgsInfos),\n var_arg_info_to_lval(ArgsInfos, ArgsLocns),\n get_module_info(!.CI, ModuleInfo),\n get_var_locn_info(!.CI, VarLocnInfo0),\n var_locn_place_vars(ModuleInfo, ArgsLocns, Code,\n VarLocnInfo0, VarLocnInfo1),\n set_var_locn_info(VarLocnInfo1, !CI),\n assoc_list.values(ArgsLocns, LiveLocList),\n set.list_to_set(LiveLocList, LiveLocs),\n assoc_list.keys(ArgsLocns, ArgVars),\n which_variables_are_forward_live(!.CI, ArgVars, set_of_var.init, DeadVars),\n make_vars_forward_dead(DeadVars, !CI).\n\n:- pred var_arg_info_to_lval(assoc_list(prog_var, arg_info)::in,\n assoc_list(prog_var, lval)::out) is det.\n\nvar_arg_info_to_lval([], []).\nvar_arg_info_to_lval([Var - ArgInfo | RestInfos], [Var - Lval | RestLvals]) :-\n ArgInfo = arg_info(Loc, _Mode),\n code_util.arg_loc_to_register(Loc, Lval),\n var_arg_info_to_lval(RestInfos, RestLvals).\n\n:- pred which_variables_are_forward_live(code_info::in,\n list(prog_var)::in, set_of_progvar::in, set_of_progvar::out) is det.\n\nwhich_variables_are_forward_live(_, [], !DeadVars).\nwhich_variables_are_forward_live(CI, [Var | Vars], !DeadVars) :-\n ( variable_is_forward_live(CI, Var) ->\n true\n ;\n set_of_var.insert(Var, !DeadVars)\n ),\n which_variables_are_forward_live(CI, Vars, !DeadVars).\n\n:- pred call_arg_in_selected_dir(call_direction::in,\n pair(prog_var, arg_info)::in) is semidet.\n\ncall_arg_in_selected_dir(Direction, _ - arg_info(_, Mode)) :-\n (\n Mode = top_in,\n Direction = caller\n ;\n Mode = top_out,\n Direction = callee\n ).\n\nlock_regs(R, F, Exceptions, !CI) :-\n get_var_locn_info(!.CI, VarLocnInfo0),\n var_locn_lock_regs(R, F, Exceptions, VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\nunlock_regs(!CI) :-\n get_var_locn_info(!.CI, VarLocnInfo0),\n var_locn_unlock_regs(VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\nclear_all_registers(OkToDeleteAny, !CI) :-\n get_var_locn_info(!.CI, VarLocnInfo0),\n var_locn_clobber_all_regs(OkToDeleteAny, VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\nclobber_regs(Regs, !CI) :-\n get_var_locn_info(!.CI, VarLocnInfo0),\n var_locn_clobber_regs(Regs, VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\nsave_variables(OutArgs, SavedLocs, Code, !CI) :-\n compute_forward_live_var_saves(!.CI, OutArgs, VarLocs),\n assoc_list.values(VarLocs, SavedLocList),\n set.list_to_set(SavedLocList, SavedLocs),\n place_vars(VarLocs, Code, !CI).\n\nsave_variables_on_stack(Vars, Code, !CI) :-\n list.map(associate_stack_slot(!.CI), Vars, VarLocs),\n place_vars(VarLocs, Code, !CI).\n\n:- pred compute_forward_live_var_saves(code_info::in,\n set_of_progvar::in, assoc_list(prog_var, lval)::out) is det.\n\ncompute_forward_live_var_saves(CI, OutArgs, VarLocs) :-\n get_known_variables(CI, Variables0),\n Vars0 = set_of_var.list_to_set(Variables0),\n TypeInfoLiveness = body_typeinfo_liveness(CI),\n get_proc_info(CI, ProcInfo),\n proc_info_get_vartypes(ProcInfo, VarTypes),\n proc_info_get_rtti_varmaps(ProcInfo, RttiVarMaps),\n maybe_complete_with_typeinfo_vars(Vars0, TypeInfoLiveness, VarTypes,\n RttiVarMaps, Vars1),\n set_of_var.difference(Vars1, OutArgs, Vars),\n Variables = set_of_var.to_sorted_list(Vars),\n list.map(associate_stack_slot(CI), Variables, VarLocs).\n\n:- pred associate_stack_slot(code_info::in, prog_var::in,\n pair(prog_var, lval)::out) is det.\n\nassociate_stack_slot(CI, Var, Var - Slot) :-\n get_variable_slot(CI, Var, Slot).\n\nmax_reg_in_use(CI, MaxR, MaxF) :-\n get_var_locn_info(CI, VarLocnInfo),\n var_locn_max_reg_in_use(VarLocnInfo, MaxR, MaxF).\n\nmagically_put_var_in_unused_reg(Var, !CI) :-\n get_var_locn_info(!.CI, VarLocnInfo0),\n make_vars_forward_live_2([Var], map.init, 1, VarLocnInfo0, VarLocnInfo),\n set_var_locn_info(VarLocnInfo, !CI).\n\n%---------------------------------------------------------------------------%\n%---------------------------------------------------------------------------%\n\n % Submodule for dealing with the recording of variable liveness\n % information around calls.\n %\n % Value numbering needs to know what locations are live before calls;\n % the garbage collector and the debugger need to know what locations\n % are live containing what types of values after calls.\n\n:- interface.\n\n:- pred generate_call_vn_livevals(code_info::in, list(arg_loc)::in,\n set_of_progvar::in, set(lval)::out) is det.\n\n:- pred generate_return_live_lvalues(code_info::in,\n assoc_list(prog_var, arg_loc)::in, instmap::in, bool::in,\n list(liveinfo)::out) is det.\n\n%---------------------------------------------------------------------------%\n\n:- implementation.\n\ngenerate_call_vn_livevals(CI, InputArgLocs, OutputArgs, LiveVals) :-\n generate_call_stack_vn_livevals(CI, OutputArgs, StackLiveVals),\n generate_input_var_vn(InputArgLocs, StackLiveVals, LiveVals).\n\n:- pred generate_call_stack_vn_livevals(code_info::in,\n set_of_progvar::in, set(lval)::out) is det.\n\ngenerate_call_stack_vn_livevals(CI, OutputArgs, LiveVals) :-\n get_known_variables(CI, KnownVarList0),\n get_module_info(CI, ModuleInfo),\n VarTypes = get_var_types(CI),\n list.filter(var_is_of_non_dummy_type(ModuleInfo, VarTypes),\n KnownVarList0, KnownVarList),\n set_of_var.list_to_set(KnownVarList, KnownVars),\n set_of_var.difference(KnownVars, OutputArgs, LiveVars),\n set_of_var.to_sorted_list(LiveVars, LiveVarList),\n generate_stack_var_vn(CI, LiveVarList, set.init, LiveVals1),\n get_active_temps_data(CI, Temps),\n generate_call_temp_vn(Temps, LiveVals1, LiveVals).\n\n:- pred generate_stack_var_vn(code_info::in, list(prog_var)::in,\n set(lval)::in, set(lval)::out) is det.\n\ngenerate_stack_var_vn(_, [], !Vals).\ngenerate_stack_var_vn(CI, [V | Vs], !Vals) :-\n get_variable_slot(CI, V, Lval),\n set.insert(Lval, !Vals),\n generate_stack_var_vn(CI, Vs, !Vals).\n\n:- pred generate_call_temp_vn(assoc_list(lval, slot_contents)::in,\n set(lval)::in, set(lval)::out) is det.\n\ngenerate_call_temp_vn([], !Vals).\ngenerate_call_temp_vn([Lval - _ | Temps], !Vals) :-\n set.insert(Lval, !Vals),\n generate_call_temp_vn(Temps, !Vals).\n\n:- pred generate_input_var_vn(list(arg_loc)::in,\n set(lval)::in, set(lval)::out) is det.\n\ngenerate_input_var_vn([], !Vals).\ngenerate_input_var_vn([InputArgLoc | InputArgLocs], !Vals) :-\n code_util.arg_loc_to_register(InputArgLoc, Lval),\n set.insert(Lval, !Vals),\n generate_input_var_vn(InputArgLocs, !Vals).\n\n%---------------------------------------------------------------------------%\n\ngenerate_return_live_lvalues(CI, OutputArgLocs, ReturnInstMap,\n OkToDeleteAny, LiveLvalues) :-\n variable_locations(CI, VarLocs),\n get_known_variables(CI, Vars0),\n get_module_info(CI, ModuleInfo),\n VarTypes = get_var_types(CI),\n list.filter(var_is_of_non_dummy_type(ModuleInfo, VarTypes), Vars0, Vars),\n get_active_temps_data(CI, Temps),\n get_proc_info(CI, ProcInfo),\n get_globals(CI, Globals),\n continuation_info.generate_return_live_lvalues(OutputArgLocs,\n ReturnInstMap, Vars, VarLocs, Temps, ProcInfo, ModuleInfo,\n Globals, OkToDeleteAny, LiveLvalues).\n\n:- pred generate_resume_layout(label::in, resume_map::in,\n code_info::in, code_info::out) is det.\n\ngenerate_resume_layout(Label, ResumeMap, !CI) :-\n get_globals(!.CI, Globals),\n globals.lookup_bool_option(Globals, agc_stack_layout, AgcStackLayout),\n (\n AgcStackLayout = yes,\n get_active_temps_data(!.CI, Temps),\n get_instmap(!.CI, InstMap),\n get_proc_info(!.CI, ProcInfo),\n get_module_info(!.CI, ModuleInfo),\n continuation_info.generate_resume_layout(ResumeMap, Temps, InstMap,\n ProcInfo, ModuleInfo, Layout),\n add_resume_layout_for_label(Label, Layout, !CI)\n ;\n AgcStackLayout = no\n ).\n\n%---------------------------------------------------------------------------%\n%---------------------------------------------------------------------------%\n\n % Submodule for managing stack slots.\n\n % Det stack frames are organized as follows.\n %\n % ... unused ...\n % sp ---> \n % \n % ... local vars ...\n % \n % \n % ... temporaries ...\n % \n % \n %\n % The stack pointer points to the first free location at the\n % top of the stack.\n %\n % `succip_is_used' determines whether we need a slot to\n % hold the succip.\n %\n % Nondet stack frames also have the local variables above the\n % temporaries, but contain several fixed slots on top, and the\n % saved succip is stored in one of these.\n %\n % For both kinds of stack frames, the slots holding variables\n % are allocated during the live_vars pass, while the slots holding\n % temporaries are acquired (and if possible, released) on demand\n % during code generation.\n\n:- interface.\n\n % Returns the total stackslot count, but not including space for\n % succip. This total can change in the future if this call is\n % followed by further allocations of temp slots.\n %\n:- pred get_total_stackslot_count(code_info::in, int::out) is det.\n\n % If a stack slot is persistent, then the stack slot is not implicitly\n % released when the code generator resets its location-dependent state,\n % usually when entering the next arm of a disjunction, switch, etc.\n\n:- type temp_slot_persistence\n ---> persistent_temp_slot\n ; non_persistent_temp_slot.\n\n % Acquire a stack slot for storing a temporary. The slot_contents\n % description is for accurate gc.\n %\n:- pred acquire_temp_slot(slot_contents::in, temp_slot_persistence::in,\n lval::out, code_info::in, code_info::out) is det.\n\n % Release a stack slot acquired earlier for a temporary value.\n % The persistence argument should match the acquire operation.\n %\n:- pred release_temp_slot(lval::in, temp_slot_persistence::in,\n code_info::in, code_info::out) is det.\n\n % acquire_several_temp_slots(Items, Persistence, StackVars,\n % StackId, N, M, !Info):\n %\n % Perform an acquire_temp_slot operation for each element of the\n % input list, all with the same persistence.\n %\n % The slots will be the ones from stack_slot_num_to_lval(StackId, N)\n % consecutively to stack_slot_num_to_lval(StackId, M), with N < M.\n % These will also be returned as StackVars.\n %\n:- pred acquire_several_temp_slots(list(slot_contents)::in,\n temp_slot_persistence::in, list(lval)::out,\n main_stack::out, int::out, int::out, code_info::in, code_info::out) is det.\n\n % Release the stack slots acquired by an earlier acquire_several_temp_slots\n % operation. The persistence argument should match the acquire operation.\n %\n:- pred release_several_temp_slots(list(lval)::in, temp_slot_persistence::in,\n code_info::in, code_info::out) is det.\n\n % Return the lval of the stack slot in which the given variable is stored.\n % Aborts if the variable does not have a stack slot an assigned to it.\n %\n:- pred get_variable_slot(code_info::in, prog_var::in, lval::out) is det.\n\n%---------------------------------------------------------------------------%\n%---------------------------------------------------------------------------%\n\n:- implementation.\n\nacquire_temp_slot(Item, Persistence, StackVar, !CI) :-\n get_temp_content_map(!.CI, TempContentMap0),\n map.to_assoc_list(TempContentMap0, TempContentList),\n get_temps_in_use(!.CI, TempsInUse0),\n (\n find_unused_slot_for_item(TempContentList, Item, TempsInUse0,\n ChosenStackVar, _)\n ->\n StackVar = ChosenStackVar\n ;\n new_temp_slot(Item, StackVar, !CI)\n ),\n set.insert(StackVar, TempsInUse0, TempsInUse),\n set_temps_in_use(TempsInUse, !CI),\n (\n Persistence = persistent_temp_slot,\n get_persistent_temps(!.CI, PersistentTemps0),\n set.insert(StackVar, PersistentTemps0, PersistentTemps),\n set_persistent_temps(PersistentTemps, !CI)\n ;\n Persistence = non_persistent_temp_slot\n ).\n\nacquire_several_temp_slots([], _, _, _, _, _, !CI) :-\n % We could return an empty list of stack vars for StackVars, but there is\n % nothing meaningful we can return for the other outputs.\n unexpected($module, $pred, \"[]\").\nacquire_several_temp_slots([HeadItem | TailItems], Persistence, StackVars,\n StackId, FirstSlotNum, LastSlotNum, !CI) :-\n get_temp_content_map(!.CI, TempContentMap0),\n map.to_assoc_list(TempContentMap0, TempContentList),\n get_temps_in_use(!.CI, TempsInUse0),\n (\n find_unused_slots_for_items(TempContentList, HeadItem, TailItems,\n TempsInUse0, StackVarsPrime,\n StackIdPrime, FirstSlotNumPrime, LastSlotNumPrime)\n ->\n StackVars = StackVarsPrime,\n StackId = StackIdPrime,\n FirstSlotNum = FirstSlotNumPrime,\n LastSlotNum = LastSlotNumPrime\n ;\n new_temp_slots([HeadItem | TailItems], StackVars,\n StackId, FirstSlotNum, LastSlotNum, !CI)\n ),\n set.insert_list(StackVars, TempsInUse0, TempsInUse),\n set_temps_in_use(TempsInUse, !CI),\n (\n Persistence = persistent_temp_slot,\n get_persistent_temps(!.CI, PersistentTemps0),\n set.insert_list(StackVars, PersistentTemps0, PersistentTemps),\n set_persistent_temps(PersistentTemps, !CI)\n ;\n Persistence = non_persistent_temp_slot\n ).\n\n:- pred new_temp_slot(slot_contents::in, lval::out,\n code_info::in, code_info::out) is det.\n\nnew_temp_slot(Item, StackVar, !CI) :-\n get_var_slot_count(!.CI, VarSlotCount),\n get_max_temp_slot_count(!.CI, TempSlotCount0),\n TempSlotCount = TempSlotCount0 + 1,\n SlotNum = VarSlotCount + TempSlotCount,\n CodeModel = get_proc_model(!.CI),\n StackId = code_model_to_main_stack(CodeModel),\n StackVar = stack_slot_num_to_lval(StackId, SlotNum),\n set_max_temp_slot_count(TempSlotCount, !CI),\n\n get_temp_content_map(!.CI, TempContentMap0),\n map.det_insert(StackVar, Item, TempContentMap0, TempContentMap),\n set_temp_content_map(TempContentMap, !CI).\n\n:- pred new_temp_slots(list(slot_contents)::in, list(lval)::out,\n main_stack::out, int::out, int::out, code_info::in, code_info::out) is det.\n\nnew_temp_slots(Items, StackVars, StackId, FirstSlotNum, LastSlotNum, !CI) :-\n get_var_slot_count(!.CI, VarSlotCount),\n get_max_temp_slot_count(!.CI, TempSlotCount0),\n FirstSlotNum = VarSlotCount + TempSlotCount0 + 1,\n CodeModel = get_proc_model(!.CI),\n StackId = code_model_to_main_stack(CodeModel),\n get_temp_content_map(!.CI, TempContentMap0),\n record_new_temp_slots(Items, StackId, FirstSlotNum, FirstUnusedSlotNum,\n TempSlotCount0, TempSlotCount, TempContentMap0, TempContentMap,\n StackVars),\n LastSlotNum = FirstUnusedSlotNum - 1,\n set_max_temp_slot_count(TempSlotCount, !CI),\n set_temp_content_map(TempContentMap, !CI).\n\n:- pred record_new_temp_slots(list(slot_contents)::in,\n main_stack::in, int::in, int::out, int::in, int::out,\n map(lval, slot_contents)::in, map(lval, slot_contents)::out,\n list(lval)::out) is det.\n\nrecord_new_temp_slots([], _, !CurSlotNum, !TempSlotCount, !TempContentMap, []).\nrecord_new_temp_slots([Item | Items], StackId, !CurSlotNum,\n !TempSlotCount, !TempContentMap, [StackVar | StackVars]) :-\n StackVar = stack_slot_num_to_lval(StackId, !.CurSlotNum),\n map.det_insert(StackVar, Item, !TempContentMap),\n !:CurSlotNum = !.CurSlotNum + 1,\n !:TempSlotCount = !.TempSlotCount + 1,\n record_new_temp_slots(Items, StackId, !CurSlotNum,\n !TempSlotCount, !TempContentMap, StackVars).\n\n:- pred find_unused_slot_for_item(assoc_list(lval, slot_contents)::in,\n slot_contents::in, set(lval)::in, lval::out,\n assoc_list(lval, slot_contents)::out) is semidet.\n\nfind_unused_slot_for_item([Head | Tail], Item, TempsInUse,\n ChosenStackVar, Remainder) :-\n Head = HeadStackVar - HeadSlotType,\n (\n HeadSlotType = Item,\n \\+ set.member(HeadStackVar, TempsInUse)\n ->\n ChosenStackVar = HeadStackVar,\n Remainder = Tail\n ;\n find_unused_slot_for_item(Tail, Item, TempsInUse,\n ChosenStackVar, Remainder)\n ).\n\n:- pred find_unused_slots_for_items(assoc_list(lval, slot_contents)::in,\n slot_contents::in, list(slot_contents)::in, set(lval)::in, list(lval)::out,\n main_stack::out, int::out, int::out) is semidet.\n\nfind_unused_slots_for_items([Head | Tail], HeadItem, TailItems, TempsInUse,\n ChosenStackVars, StackId, FirstSlotNum, LastSlotNum) :-\n (\n find_unused_slot_for_item([Head | Tail], HeadItem, TempsInUse,\n ChosenHeadStackVar, Remainder),\n ( ChosenHeadStackVar = stackvar(N) ->\n StackId0 = det_stack,\n FirstSlotNum0 = N\n ; ChosenHeadStackVar = framevar(N) ->\n StackId0 = nondet_stack,\n FirstSlotNum0 = N\n ;\n unexpected($module, $pred, \"not stackvar or framevar\")\n ),\n StackId1 = StackId0,\n FirstSlotNum1 = FirstSlotNum0,\n find_next_slots_for_items(Remainder, TailItems, TempsInUse,\n ChosenTailStackVars, StackId1, FirstSlotNum1, LastSlotNum1)\n ->\n ChosenStackVars = [ChosenHeadStackVar | ChosenTailStackVars],\n StackId = StackId1,\n FirstSlotNum = FirstSlotNum1,\n LastSlotNum = LastSlotNum1\n ;\n find_unused_slots_for_items(Tail, HeadItem, TailItems, TempsInUse,\n ChosenStackVars, StackId, FirstSlotNum, LastSlotNum)\n ).\n\n:- pred find_next_slots_for_items(assoc_list(lval, slot_contents)::in,\n list(slot_contents)::in, set(lval)::in, list(lval)::out,\n main_stack::in, int::in, int::out) is semidet.\n\nfind_next_slots_for_items([], [], _, [], _, !SlotNum).\nfind_next_slots_for_items([Head | Tail], [HeadItem | TailItems], TempsInUse,\n [HeadStackVar | TailStackVars], StackId, !SlotNum) :-\n Head = HeadStackVar - HeadSlotType,\n !:SlotNum = !.SlotNum + 1,\n HeadStackVar = stack_slot_num_to_lval(StackId, !.SlotNum),\n HeadSlotType = HeadItem,\n \\+ set.member(HeadStackVar, TempsInUse),\n find_next_slots_for_items(Tail, TailItems, TempsInUse,\n TailStackVars, StackId, !SlotNum).\n\nrelease_temp_slot(StackVar, Persistence, !CI) :-\n get_temps_in_use(!.CI, TempsInUse0),\n set.delete(StackVar, TempsInUse0, TempsInUse),\n set_temps_in_use(TempsInUse, !CI),\n\n get_persistent_temps(!.CI, PersistentTemps0),\n set.is_member(StackVar, PersistentTemps0, IsInPersistentTemps0),\n (\n Persistence = persistent_temp_slot,\n expect(unify(IsInPersistentTemps0, yes),\n $module, $pred, \"released stack slot should be persistent\"),\n set.delete(StackVar, PersistentTemps0, PersistentTemps),\n set_persistent_temps(PersistentTemps, !CI)\n ;\n Persistence = non_persistent_temp_slot,\n expect(unify(IsInPersistentTemps0, no),\n $module, $pred, \"released stack slot should not be persistent\")\n ).\n\nrelease_several_temp_slots([], _Persistence, !CI).\nrelease_several_temp_slots([StackVar | StackVars], Persistence, !CI) :-\n release_temp_slot(StackVar, Persistence, !CI),\n release_several_temp_slots(StackVars, Persistence, !CI).\n\n%---------------------------------------------------------------------------%\n\nget_variable_slot(CI, Var, Slot) :-\n get_stack_slots(CI, StackSlots),\n ( map.search(StackSlots, Var, SlotLocn) ->\n Slot = stack_slot_to_lval(SlotLocn)\n ;\n Name = variable_name(CI, Var),\n term.var_to_int(Var, Num),\n string.int_to_string(Num, NumStr),\n Str = \"variable `\" ++ Name ++ \"' \" ++ \"(\" ++ NumStr ++ \") not found\",\n unexpected($module, $pred, Str)\n ).\n\nget_total_stackslot_count(CI, NumSlots) :-\n get_var_slot_count(CI, SlotsForVars),\n get_max_temp_slot_count(CI, SlotsForTemps),\n NumSlots = SlotsForVars + SlotsForTemps.\n\n:- pred max_var_slot(stack_slots::in, int::out) is det.\n\nmax_var_slot(StackSlots, SlotCount) :-\n map.values(StackSlots, StackSlotList),\n max_var_slot_2(StackSlotList, 0, SlotCount).\n\n:- pred max_var_slot_2(list(stack_slot)::in, int::in, int::out) is det.\n\nmax_var_slot_2([], !Max).\nmax_var_slot_2([L | Ls], !Max) :-\n (\n L = det_slot(N, Width)\n ;\n L = parent_det_slot(N, Width)\n ;\n L = nondet_slot(N, Width)\n ),\n (\n Width = single_width,\n int.max(N, !Max)\n ;\n Width = double_width,\n int.max(N + 1, !Max)\n ),\n max_var_slot_2(Ls, !Max).\n\n%---------------------------------------------------------------------------%\n\n % Submodule for debugging the code generator itself.\n\n:- interface.\n\n % Should we trace the operation of the code generator.\n %\n:- pred should_trace_code_gen(code_info::in) is semidet.\n\n:- type code_info_component\n ---> cic_forward_live_vars\n ; cic_zombies\n ; cic_temps_in_use\n ; cic_par_conj_depth.\n\n % Print the selected parts of the code_info.\n %\n % If you need to print a part that is not currently selectable, make it\n % selectable.\n %\n:- pred output_code_info(list(code_info_component)::in, code_info::in,\n io::di, io::uo) is det.\n\n:- implementation.\n\nshould_trace_code_gen(CI) :-\n code_info.get_pred_id(CI, PredId),\n pred_id_to_int(PredId, PredIdInt),\n code_info.get_module_info(CI, ModuleInfo),\n module_info_get_globals(ModuleInfo, Globals),\n globals.lookup_int_option(Globals, debug_code_gen_pred_id, DebugPredIdInt),\n PredIdInt = DebugPredIdInt.\n\noutput_code_info(Components, CI, !IO) :-\n CI = code_info(Static, LocDep, _Persistent),\n VarSet = Static ^ cis_varset,\n LocDep = code_info_loc_dep(ForwardLiveVars, _InstMap, Zombies,\n _VarLocnInfo, TempsInUse, _FailInfo, ParConjDepth),\n ( list.member(cic_forward_live_vars, Components) ->\n io.write_string(\"forward live vars: \", !IO),\n mercury_output_vars(VarSet, yes,\n set_of_var.to_sorted_list(ForwardLiveVars), !IO),\n io.nl(!IO)\n ;\n true\n ),\n ( list.member(cic_zombies, Components) ->\n io.write_string(\"zombies: \", !IO),\n mercury_output_vars(VarSet, yes,\n set_of_var.to_sorted_list(Zombies), !IO),\n io.nl(!IO)\n ;\n true\n ),\n ( list.member(cic_temps_in_use, Components) ->\n io.write_string(\"temps_in_use: \", !IO),\n io.write_string(dump_lvals(no, set.to_sorted_list(TempsInUse)), !IO),\n io.nl(!IO)\n ;\n true\n ),\n ( list.member(cic_par_conj_depth, Components) ->\n io.format(\"par_conj_depth: %d\\n\", [i(ParConjDepth)], !IO)\n ;\n true\n ).\n\n:- pred output_resume_map(prog_varset::in, map(prog_var, set(lval))::in,\n io::di, io::uo) is det.\n\noutput_resume_map(VarSet, ResumeMap, !IO) :-\n map.to_assoc_list(ResumeMap, ResumeAssocList),\n list.foldl(output_resume_map_element(VarSet), ResumeAssocList, !IO).\n\n:- pred output_resume_map_element(prog_varset::in,\n pair(prog_var, set(lval))::in, io::di, io::uo) is det.\n\noutput_resume_map_element(VarSet, Var - LvalSet, !IO) :-\n io.write_string(describe_var(VarSet, Var), !IO),\n io.write_string(\": \", !IO),\n Lvals = set.to_sorted_list(LvalSet),\n LvalDescs = list.map(dump_lval(no), Lvals),\n SpaceLvalDescs = list.map(string.append(\" \"), LvalDescs),\n io.write_string(string.append_list(SpaceLvalDescs), !IO),\n io.nl(!IO).\n\n%---------------------------------------------------------------------------%\n:- end_module ll_backend.code_info.\n%---------------------------------------------------------------------------%\n" }, { "path": "src/test/resources/samples/langs/Mercury/expr.moo", "content": ":- module expr.\n\n:- interface.\n\n:- import_module char, int, list.\n\n:- type token\n\t--->\t('+')\n\t;\t('-')\n\t;\t('*')\n\t;\t('/')\n\t;\tnum(int)\n\t;\t('(')\n\t;\t(')')\n\t;\teof\n\t.\n\n:- parse(exprn/1, token, eof, xx, in, out).\n\n:- pred scan(list(char), list(token)).\n:- mode scan(in, out) is det.\n\n:- implementation.\n\n:- import_module string, require.\n\n:- rule exprn(int).\nexprn(Num)\t--->\texprn(A), [+], term(B), { Num = A + B }.\nexprn(Num)\t--->\texprn(A), [-], term(B), { Num = A - B }.\nexprn(Num)\t--->\tterm(Num).\n\n:- rule term(int).\nterm(Num)\t--->\tterm(A), [*], factor(B), { Num = A * B }.\nterm(Num)\t--->\tterm(A), [/], factor(B), { Num = A // B }.\nterm(Num)\t--->\tfactor(Num).\n\n:- rule factor(int).\nfactor(Num)\t--->\t['('], exprn(Num), [')'].\nfactor(Num)\t--->\t[num(Num)].\n\nscan(Chars, Toks) :-\n\tscan(Chars, [], Toks0),\n\tlist__reverse(Toks0, Toks).\n\n:- pred scan(list(char), list(token), list(token)).\n:- mode scan(in, in, out) is det.\n\nscan([], Toks, [eof|Toks]).\nscan([C|Cs], Toks0, Toks) :-\n\t( char__is_whitespace(C) ->\n\t\tscan(Cs, Toks0, Toks)\n\t; char__is_digit(C) ->\n\t\ttakewhile(char__is_digit, [C|Cs], Digits, Rest),\n\t\tstring__from_char_list(Digits, NumStr),\n\t\tNum = string__det_to_int(NumStr),\n\t\tscan(Rest, [num(Num)|Toks0], Toks)\n\t; C = ('+') ->\n\t\tscan(Cs, ['+'|Toks0], Toks)\n\t; C = ('-') ->\n\t\tscan(Cs, ['-'|Toks0], Toks)\n\t; C = ('*') ->\n\t\tscan(Cs, ['*'|Toks0], Toks)\n\t; C = ('/') ->\n\t\tscan(Cs, ['/'|Toks0], Toks)\n\t; C = ('(') ->\n\t\tscan(Cs, ['('|Toks0], Toks)\n\t; C = (')') ->\n\t\tscan(Cs, [')'|Toks0], Toks)\n\t;\n\t\terror(\"expr: syntax error in input\")\n\t).\n\n" }, { "path": "src/test/resources/samples/langs/Mercury/hello.m", "content": "% \"Hello World\" in Mercury.\n\n% This source file is hereby placed in the public domain. -fjh (the author).\n\n:- module hello.\n:- interface.\n:- import_module io.\n\n:- pred main(io::di, io::uo) is det.\n\n:- implementation.\n\nmain(!IO) :-\n\tio.write_string(\"Hello, world\\n\", !IO).\n" }, { "path": "src/test/resources/samples/langs/Mercury/options.m", "content": "%-----------------------------------------------------------------------------%\n% vim: ft=mercury ts=4 sw=4 et\n%-----------------------------------------------------------------------------%\n% Copyright (C) 1994-2012 The University of Melbourne.\n% This file may only be copied under the terms of the GNU General\n% Public License - see the file COPYING in the Mercury distribution.\n%-----------------------------------------------------------------------------%\n%\n% File: options.m.\n% Main author: fjh.\n%\n% This defines the stuff necessary so that getopt_io.m can parse the\n% command-line options.\n%\n% IMPORTANT NOTE: any changes to the options should be reflected in both the\n% help message produced below, and in the Mercury User's Guide\n% (../doc/user_guide.texi).\n%\n%-----------------------------------------------------------------------------%\n\n:- module libs.options.\n:- interface.\n\n:- import_module char.\n:- import_module getopt_io.\n:- import_module io.\n:- import_module set.\n\n%-----------------------------------------------------------------------------%\n\n:- pred short_option(char::in, option::out) is semidet.\n:- pred long_option(string::in, option::out) is semidet.\n:- pred option_defaults(option::out, option_data::out) is nondet.\n\n % special_handler(Option, ValueForThatOption, OptionTableIn,\n % MaybeOptionTableOut):\n %\n % This predicate is invoked whenever getopt finds an option\n % (long or short) designated as special, with special_data holding\n % the argument of the option (if any). The predicate can change the\n % option table in arbitrary ways in the course of handling the option,\n % or it can return an error message.\n % The canonical examples of special options are -O options in\n % compilers, which set many other options at once.\n % The MaybeOptionTableOut may either be ok(OptionTableOut), or it may\n % be error(ErrorString).\n %\n:- pred special_handler(option::in, special_data::in, option_table::in,\n maybe_option_table::out) is semidet.\n\n % Return the set of options which are inconsequential as far as the\n % `--track-flags' option is concerned. That is, adding or removing such\n % an option to a module should not force the module to be recompiled.\n %\n:- pred inconsequential_options(set(option)::out) is det.\n\n:- pred options_help(io::di, io::uo) is det.\n\n:- type option_table == option_table(option).\n:- type maybe_option_table == maybe_option_table(option).\n\n % Add a directory to search for Mercury libraries. This\n % adds `--search-directory', `--c-include-directory',\n % `--erlang-include-directory',\n % `--library-directory' and `--init-file-directory' options.\n %\n:- func option_table_add_mercury_library_directory(option_table, string)\n = option_table.\n\n % Add a directory using all of the\n % `--search-directory', `--intermod-directory',\n % `--library-directory', `--init-file-directory' and\n % `--c-include-directory', `--erlang-include-directory'\n % options.\n %\n:- func option_table_add_search_library_files_directory(option_table,\n string) = option_table.\n\n % Quote an argument to a shell command.\n %\n:- func quote_arg(string) = string.\n\n % NOTE: ALL OPTIONS SHOULD BE DOCUMENTED!\n %\n % Officially supported options should be documented both in the\n % help message output by options_help/2, and also in the\n % \"invocation\" chapter of doc/user_guide.texi.\n %\n % Options which are not officially supported (e.g. those used\n % internally by the Mercury implementation, those which are not\n % sufficiently useful to be worth mentioning in the User Guide,\n % or options for experimental features that are not yet stable\n % enough to be officially supported should still be documented.\n % The documentation can go either next to the option definition\n % here, or as commented-out code in the appropriate subroutine\n % of options_help/2.\n:- type option\n\n % Warning options\n ---> inhibit_warnings\n ; inhibit_accumulator_warnings\n ; halt_at_warn\n ; halt_at_syntax_errors\n ; halt_at_auto_parallel_failure\n ; warn_singleton_vars\n ; warn_overlapping_scopes\n ; warn_det_decls_too_lax\n ; warn_inferred_erroneous\n ; warn_nothing_exported\n ; warn_unused_args\n ; warn_interface_imports\n ; warn_missing_opt_files\n ; warn_missing_trans_opt_files\n ; warn_missing_trans_opt_deps\n ; warn_non_contiguous_clauses\n ; warn_non_contiguous_foreign_procs\n ; warn_non_stratification\n ; warn_unification_cannot_succeed\n ; warn_simple_code\n ; warn_duplicate_calls\n ; warn_missing_module_name\n ; warn_wrong_module_name\n ; warn_smart_recompilation\n ; warn_undefined_options_variables\n ; warn_non_tail_recursion\n ; warn_target_code\n ; warn_up_to_date\n ; warn_stubs\n ; warn_dead_procs\n ; warn_table_with_inline\n ; warn_non_term_special_preds\n ; warn_known_bad_format_calls\n ; warn_unknown_format_calls\n ; warn_obsolete\n ; warn_insts_without_matching_type\n ; warn_unused_imports\n ; inform_ite_instead_of_switch\n ; warn_unresolved_polymorphism\n ; warn_suspicious_foreign_procs\n ; warn_state_var_shadowing\n ; inform_inferred\n ; inform_inferred_types\n ; inform_inferred_modes\n\n % Verbosity options\n ; verbose\n ; very_verbose\n ; verbose_errors\n ; verbose_recompilation\n ; find_all_recompilation_reasons\n ; verbose_make\n ; verbose_commands\n ; output_compile_error_lines\n ; report_cmd_line_args\n ; report_cmd_line_args_in_doterr\n ; statistics\n ; detailed_statistics\n ; proc_size_statistics\n ; debug_types\n ; debug_modes\n ; debug_modes_statistics\n ; debug_modes_minimal\n ; debug_modes_verbose\n ; debug_modes_pred_id\n ; debug_dep_par_conj\n ; debug_det\n ; debug_code_gen_pred_id\n ; debug_opt\n ; debug_term % term = constraint termination analysis\n ; debug_opt_pred_id\n ; debug_opt_pred_name\n ; debug_pd % pd = partial deduction/deforestation\n ; debug_il_asm % il_asm = IL generation via asm\n ; debug_liveness\n ; debug_stack_opt\n ; debug_make\n ; debug_closure\n ; debug_trail_usage\n ; debug_mode_constraints\n ; debug_intermodule_analysis\n ; debug_mm_tabling_analysis\n ; debug_indirect_reuse\n ; debug_type_rep\n\n % Output options\n ; make_short_interface\n ; make_interface\n ; make_private_interface\n ; make_optimization_interface\n ; make_transitive_opt_interface\n ; make_analysis_registry\n ; make_xml_documentation\n ; generate_source_file_mapping\n ; generate_dependency_file\n ; generate_dependencies\n ; generate_module_order\n ; generate_standalone_interface\n ; convert_to_mercury\n ; typecheck_only\n ; errorcheck_only\n ; target_code_only\n ; compile_only\n ; compile_to_shared_lib\n ; output_grade_string\n ; output_link_command\n ; output_shared_lib_link_command\n ; output_libgrades\n ; output_cc\n ; output_c_compiler_type\n ; output_csharp_compiler_type\n ; output_cflags\n ; output_library_link_flags\n ; output_grade_defines\n ; output_c_include_directory_flags\n\n % Auxiliary output options\n ; smart_recompilation\n % Even if this option is set to `yes', smart recompilation may\n % have been disabled with io_set_disable_smart_recompilation.\n % Before using the value of this option, call\n % io_get_disable_smart_recompilation to see whether this\n % has been done.\n\n ; generate_item_version_numbers\n % This option is used to control output of version numbers\n % in interface files. It is implied by --smart-recompilation,\n % and cannot be set explicitly by the user.\n\n % Even if this option is set to `yes', version numbers may have\n % been disabled with io_set_disable_generate_item_version_numbers.\n % Before using the value of this option, call\n % io_get_disable_generate_item_version_numbers to see whether this\n % has been done.\n\n ; generate_mmc_make_module_dependencies\n ; assume_gmake\n ; trace_level\n ; trace_optimized\n ; trace_prof\n ; trace_table_io\n ; trace_table_io_only_retry\n ; trace_table_io_states\n ; trace_table_io_require\n ; trace_table_io_all\n ; trace_goal_flags\n ; prof_optimized\n ; exec_trace_tail_rec\n ; suppress_trace\n ; force_disable_tracing\n % Force no tracing, even in .debug grades. This is used to turn off\n % tracing in the browser directory while still allowing the browser\n % library to be linked in with an executable compiled in a .debug\n % grade.\n ; delay_death\n ; delay_death_max_vars\n\n ; stack_trace_higher_order\n ; force_disable_ssdebug\n ; generate_bytecode\n ; line_numbers\n ; auto_comments\n ; frameopt_comments\n ; max_error_line_width\n ; show_dependency_graph\n ; imports_graph\n ; dump_trace_counts\n ; dump_hlds\n ; dump_hlds_pred_id\n ; dump_hlds_pred_name\n ; dump_hlds_alias\n ; dump_hlds_options\n ; dump_hlds_inst_limit\n ; dump_hlds_file_suffix\n ; dump_same_hlds\n ; dump_mlds\n ; verbose_dump_mlds\n ; mode_constraints\n ; simple_mode_constraints\n ; prop_mode_constraints\n ; benchmark_modes\n ; benchmark_modes_repeat\n ; sign_assembly\n ; separate_assemblies\n\n % Language semantics options\n ; reorder_conj\n ; reorder_disj\n ; fully_strict\n ; strict_sequential\n ; allow_stubs\n ; infer_types\n ; infer_modes\n ; infer_det\n ; infer_all\n ; type_inference_iteration_limit\n ; mode_inference_iteration_limit\n ; event_set_file_name\n\n % Compilation Model options\n ; grade\n\n % Target selection options\n ; target\n ; il % target il\n ; il_only % target il + target_code_only\n ; compile_to_c % target c + target_code_only\n ; java % target java\n ; java_only % target java + target_code_only\n ; csharp % target csharp\n ; csharp_only % target csharp + target_code_only\n % XXX The following options need to be documented.\n ; x86_64 % target x86_64\n ; x86_64_only % target x86_64 + target_code_only\n ; erlang % target erlang\n ; erlang_only % target erlang + target_code_only\n\n % Compilation model options for optional features:\n\n % (a) Debugging\n % For documentation of the exec_trace and decl_debug options, see the\n % documentation for MR_EXEC_TRACE and MR_DECL_DEBUG in\n % runtime/mercury_conf_param.h.\n ; exec_trace\n ; decl_debug\n\n % (b) Profiling\n ; profiling % profile_time + profile_calls\n ; time_profiling % profile_time + profile_calls\n ; memory_profiling % profile_mem + profile_calls\n ; deep_profiling % profile_deep\n ; profile_calls\n ; profile_time\n ; profile_memory\n ; profile_deep\n ; use_activation_counts\n % Use_activation_counts is used to determine which mechanism for\n % cycle detection should be used for deep profiling. Actually,\n % we only want to use the `yes' value, but we keep support for\n % the `no' value for benchmarks for the paper.\n\n ; pre_prof_transforms_simplify\n % Run the simplification pass at before profiling (stage 215) this\n % is implied by some of the profiling settings. Specifying this\n % option causes this simplification pass to run even when profiling\n % is not enabled.\n\n ; pre_implicit_parallelism_simplify\n % Run the simplification pass before the implicit parallelism pass\n % to ensure that the HLDS more closely matches the feedback data.\n\n % Perform coverage profiling, this affects only deep profiling\n % grades.\n ; coverage_profiling\n ; coverage_profiling_via_calls\n ; coverage_profiling_static\n\n % What types of coverage points to instrument the code with.\n ; profile_deep_coverage_after_goal\n ; profile_deep_coverage_branch_ite\n ; profile_deep_coverage_branch_switch\n ; profile_deep_coverage_branch_disj\n\n % Tunables for the coverage profiling pass.\n % XXX: Currently both these options are unsupported.\n ; profile_deep_coverage_use_portcounts\n ; profile_deep_coverage_use_trivial\n\n % Turn on flags relevant for profiler directed feedback analysis.\n % Currently the only feedback analysis is automatic parallelism.\n ; profile_for_feedback\n\n ; use_zeroing_for_ho_cycles\n ; use_lots_of_ho_specialization\n\n % We should always handle tail recursion specially in deep\n % profiling; the option is only for benchmarks for the paper,\n % except that this is currently broken, and not supported with\n % coverage profiling.\n ; deep_profile_tail_recursion\n ; record_term_sizes_as_words\n ; record_term_sizes_as_cells\n ; experimental_complexity\n\n % (c) Miscellaneous\n ; gc\n ; parallel\n ; threadscope\n ; use_trail\n ; trail_segments\n ; use_minimal_model_stack_copy\n ; use_minimal_model_own_stacks\n ; minimal_model_debug\n ; single_prec_float\n ; type_layout\n ; maybe_thread_safe_opt\n ; extend_stacks_when_needed\n ; stack_segments\n ; use_regions\n ; use_alloc_regions\n ; use_regions_debug\n ; use_regions_profiling\n ; source_to_source_debug\n ; ssdb_trace_level\n ; link_ssdb_libs\n\n % Data representation compilation model options\n ; tags\n ; num_tag_bits\n ; num_reserved_addresses\n ; num_reserved_objects\n ; bits_per_word\n ; bytes_per_word\n % The undocumented conf_low_tag_bits option is used by the `mmc'\n % script to pass the default value for num_tag_bits assuming\n % --tags low. The reason that `mmc' doesn't just pass a default\n % value for --num-tag-bits is that we want to be able to give an\n % error message if the user specifies `--tags high' and doesn't\n % specify `--num-tag-bits'.\n\n ; conf_low_tag_bits\n ; unboxed_float\n ; unboxed_enums\n ; unboxed_no_tag_types\n ; sync_term_size % in words\n\n % LLDS back-end compilation model options\n ; gcc_non_local_gotos\n ; gcc_global_registers\n ; asm_labels\n ; pic_reg\n ; use_float_registers\n\n % MLDS back-end compilation model options\n ; highlevel_code\n ; highlevel_data\n ; gcc_nested_functions\n ; det_copy_out\n ; nondet_copy_out\n ; put_commit_in_own_func\n ; put_nondet_env_on_heap\n\n % IL back-end compilation model options\n ; verifiable_code\n ; il_refany_fields\n ; il_funcptr_types\n ; il_byref_tailcalls\n % Currently this is not really a compilation model option, i.e.\n % it doesn't affect the ABI. In future it might become one, though\n % -- we should return multiple values in value types, rather than\n % using byrefs. Also it's nicer to keep it with the other IL\n % back-end options here.\n\n % Options for internal use only (the values of these options are implied\n % by the settings of other options)\n\n ; backend_foreign_languages\n % The foreign programming languages that this backend can\n % interface to.\n\n ; stack_trace\n % Stack layout information required to do a stack trace.\n\n ; basic_stack_layout\n % Stack layout information required to do accurate GC.\n\n ; agc_stack_layout\n % Stack layout information required to do procedure identification.\n\n ; procid_stack_layout\n % Stack layout information required to do execution tracing.\n\n ; trace_stack_layout\n\n ; body_typeinfo_liveness\n % Use an alternate calculation of liveness where the typeinfo\n % for a type variable must live at any point in the body of the\n % procedure at which a live variable's type includes that type\n % variable.\n %\n % Although this option governs whether the body of a procedure\n % uses this liveness calculation, it is not the only consideration\n % we have to take into account when deciding on the interface\n % of any procedure whose address may be taken. We must include\n % typeinfos describing the types of all arguments in the interface\n % of a procedure if either this option is set *or* the procedure's\n % address may be taken, otherwise, the layout structure we include\n % in closures using that procedure may not have all the information\n % required to reconstruct the types of all the values inside the\n % closure.\n %\n % The only place in the compiler that should look at this option\n % is the predicate body_should_use_typeinfo_liveness in\n % hlds_pred.m; everything else, including the predicates deciding\n % interface typeinfo liveness, should go through there.\n\n ; can_compare_constants_as_ints\n % Should be set to yes if the target back end guarantees that\n % comparing two values for equality, at least one of which is a\n % constant, can be done by casting them both to integers and\n % comparing the integers for equality.\n\n ; pretest_equality_cast_pointers\n % Should be set to yes if the test of whether two input arguments\n % are object identical should be done by casting the arguments to a\n % generic pointer type. Otherwise they will be cast to integers.\n\n ; can_compare_compound_values\n % Should be set to yes if the target back end supports comparison\n % of non-atomic values with builtin operators.\n\n ; lexically_order_constructors\n % Should be set to yes if we need to order functors\n % lexically when generating comparison predicates,\n % e.g. to match the natural order that functors will be compared\n % on the backend.\n\n ; mutable_always_boxed\n\n ; delay_partial_instantiations\n\n % Options for internal use only (setting these options to non-default\n % values can result in programs that do not link, or programs that dump\n % core)\n ; allow_defn_of_builtins\n % Do not generate errors for definitions of builtin predicates.\n % When a new builtin is introduced, the installed compiler won't\n % know about it, and thus when it sees its declaration, it wants a\n % definition, but when the modified compiler is bootstrapped,\n % it would normally generate an error when it sees that very same\n % definition in the library (usually in builtin.m or\n % private_builtin.m). When this option is set, it allows such\n % definitions. Once the modified compiler is installed on all\n % relevant machines, the option can be turned off again.\n\n ; special_preds\n % Generate unify and compare preds. For measurement only.\n % Code generated with this set to `no' is unlikely to actually\n % work.\n\n ; type_ctor_info\n % Generate type_ctor_info structures. For measurement only --\n % if you turn this off, then you're unlikely to be able to link.\n\n ; type_ctor_layout\n % Generate type_ctor_layout structures. For measurement only --\n % if you turn this off, then you're unlikely to be able to link.\n\n ; type_ctor_functors\n % Generate type_ctor_functors structures. For measurement only --\n % if you turn this off, then you're unlikely to be able to link.\n\n ; new_type_class_rtti\n % XXX temporary option: enables the generation of new style static\n % data structures for runtime information about type classes.\n % These are not yet used. When we add code to generate the matching\n % dynamic data structures and switch over to use them, we won't\n % need this option anymore.\n\n ; rtti_line_numbers\n % Generate line number information in the RTTI when debugging is\n % enabled. For measurement only -- if you turn this off, then the\n % debugger may dereference garbage pointers.\n\n ; disable_minimal_model_stack_copy_pneg\n ; disable_minimal_model_stack_copy_cut\n ; use_minimal_model_stack_copy_pneg\n ; use_minimal_model_stack_copy_cut\n % These four are used to analyze the performance effects\n % of minimal model tabling.\n\n ; disable_trail_ops\n % This is used to analyze the performance effects of trailing.\n\n ; size_region_ite_fixed\n ; size_region_disj_fixed\n ; size_region_semi_disj_fixed\n ; size_region_commit_fixed\n\n ; size_region_ite_protect\n ; size_region_ite_snapshot\n ; size_region_semi_disj_protect\n ; size_region_disj_snapshot\n ; size_region_commit_entry\n\n ; solver_type_auto_init\n % Insert calls to solver type initialisation predicates when\n % the inst of solver type variables changes from free to any.\n\n ; allow_multi_arm_switches\n\n ; type_check_constraints\n\n ; allow_argument_packing\n\n % Code generation options\n ; low_level_debug\n ; table_debug\n ; trad_passes\n ; parallel_liveness\n ; parallel_code_gen\n ; polymorphism\n ; reclaim_heap_on_failure\n ; reclaim_heap_on_semidet_failure\n ; reclaim_heap_on_nondet_failure\n ; have_delay_slot\n ; num_real_r_regs\n ; num_real_f_regs\n ; num_real_r_temps\n ; num_real_f_temps\n ; max_jump_table_size\n ; max_specialized_do_call_closure\n ; max_specialized_do_call_class_method\n ; compare_specialization\n ; should_pretest_equality\n ; fact_table_max_array_size\n % Maximum number of elements in a single fact table data array.\n\n ; fact_table_hash_percent_full\n % How full the fact table hash tables should be allowed to get,\n % given as an integer percentage.\n\n ; gcc_local_labels\n ; prefer_switch\n ; opt_no_return_calls\n\n % Optimization Options\n ; opt_level\n ; opt_level_number\n ; opt_space % Default is to optimize time.\n ; intermodule_optimization\n ; read_opt_files_transitively\n ; use_opt_files\n ; use_trans_opt_files\n ; transitive_optimization\n ; intermodule_analysis\n ; analysis_repeat\n ; analysis_file_cache\n\n % - HLDS\n ; allow_inlining\n ; inlining\n ; inline_simple\n ; inline_builtins\n ; inline_single_use\n ; inline_call_cost\n ; inline_compound_threshold\n ; inline_simple_threshold\n ; inline_vars_threshold\n ; intermod_inline_simple_threshold\n ; from_ground_term_threshold\n ; enable_const_struct\n ; common_struct\n ; common_struct_preds\n ; common_goal\n ; constraint_propagation\n ; local_constraint_propagation\n ; optimize_unused_args\n ; intermod_unused_args\n ; optimize_higher_order\n ; higher_order_size_limit\n ; higher_order_arg_limit\n ; unneeded_code\n ; unneeded_code_copy_limit\n ; unneeded_code_debug\n ; unneeded_code_debug_pred_name\n ; type_specialization\n ; user_guided_type_specialization\n ; introduce_accumulators\n ; optimize_constructor_last_call_accumulator\n ; optimize_constructor_last_call_null\n ; optimize_constructor_last_call\n ; optimize_duplicate_calls\n ; constant_propagation\n ; excess_assign\n ; optimize_format_calls\n ; optimize_saved_vars_const\n ; optimize_saved_vars_cell\n ; optimize_saved_vars_cell_loop\n ; optimize_saved_vars_cell_full_path\n ; optimize_saved_vars_cell_on_stack\n ; optimize_saved_vars_cell_candidate_headvars\n ; optimize_saved_vars_cell_cv_store_cost\n ; optimize_saved_vars_cell_cv_load_cost\n ; optimize_saved_vars_cell_fv_store_cost\n ; optimize_saved_vars_cell_fv_load_cost\n ; optimize_saved_vars_cell_op_ratio\n ; optimize_saved_vars_cell_node_ratio\n ; optimize_saved_vars_cell_all_path_node_ratio\n ; optimize_saved_vars_cell_include_all_candidates\n ; optimize_saved_vars\n ; loop_invariants\n ; delay_construct\n ; follow_code\n ; optimize_dead_procs\n ; deforestation\n ; deforestation_depth_limit\n ; deforestation_cost_factor\n ; deforestation_vars_threshold\n ; deforestation_size_threshold\n ; analyse_trail_usage\n ; optimize_trail_usage\n ; optimize_region_ops\n ; analyse_mm_tabling\n ; untuple\n ; tuple\n ; tuple_trace_counts_file\n ; tuple_costs_ratio\n ; tuple_min_args\n ; inline_par_builtins\n ; always_specialize_in_dep_par_conjs\n ; allow_some_paths_only_waits\n ; region_analysis\n\n % Stuff for the CTGC system (structure sharing / structure reuse).\n ; structure_sharing_analysis\n ; structure_sharing_widening\n ; structure_reuse_analysis\n ; structure_reuse_constraint\n ; structure_reuse_constraint_arg\n ; structure_reuse_max_conditions\n ; structure_reuse_repeat\n ; structure_reuse_free_cells\n\n % Stuff for the old termination analyser.\n ; termination\n ; termination_check\n ; verbose_check_termination\n ; termination_single_args\n ; termination_norm\n ; termination_error_limit\n ; termination_path_limit\n\n % Stuff for the new termination analyser.\n ; termination2\n ; check_termination2\n ; verbose_check_termination2\n ; termination2_norm\n ; widening_limit\n ; arg_size_analysis_only\n ; propagate_failure_constrs\n ; term2_maximum_matrix_size\n ; analyse_exceptions\n ; analyse_closures\n\n % - HLDS->LLDS\n ; smart_indexing\n ; dense_switch_req_density\n ; lookup_switch_req_density\n ; dense_switch_size\n ; lookup_switch_size\n ; string_hash_switch_size\n ; string_binary_switch_size\n ; tag_switch_size\n ; try_switch_size\n ; binary_switch_size\n ; switch_single_rec_base_first\n ; switch_multi_rec_base_first\n\n ; static_ground_cells\n ; static_ground_floats\n ; static_code_addresses\n\n ; use_atomic_cells\n ; middle_rec\n ; simple_neg\n ; allow_hijacks\n\n % - MLDS\n ; optimize_tailcalls\n ; optimize_initializations\n ; eliminate_local_vars\n ; generate_trail_ops_inline\n\n % - LLDS\n ; common_data\n ; common_layout_data\n ; optimize % Also used for MLDS->MLDS optimizations.\n ; optimize_peep\n ; optimize_peep_mkword\n ; optimize_jumps\n ; optimize_fulljumps\n ; pessimize_tailcalls\n ; checked_nondet_tailcalls\n ; use_local_vars\n ; local_var_access_threshold\n ; standardize_labels\n ; optimize_labels\n ; optimize_dups\n ; optimize_proc_dups\n ; optimize_frames\n ; optimize_delay_slot\n ; optimize_reassign\n ; optimize_repeat\n ; layout_compression_limit\n\n % - C\n ; use_macro_for_redo_fail\n ; emit_c_loops\n ; procs_per_c_function\n ; everything_in_one_c_function\n ; local_thread_engine_base\n\n % - IL\n % (none yet)\n\n % - Erlang\n ; erlang_switch_on_strings_as_atoms\n\n % Target code compilation options\n ; target_debug\n\n % C\n ; cc\n ; cflags\n ; quoted_cflag\n ; c_include_directory\n ; c_optimize\n ; ansi_c\n ; inline_alloc\n\n % Flags for specific C compilers.\n ; gcc_flags\n ; quoted_gcc_flag\n ; clang_flags\n ; quoted_clang_flag\n ; msvc_flags\n ; quoted_msvc_flag\n\n % Auto-configured C compilation options.\n ; cflags_for_warnings\n ; cflags_for_optimization\n ; cflags_for_ansi\n ; cflags_for_regs\n ; cflags_for_gotos\n ; cflags_for_threads\n ; cflags_for_debug\n ; cflags_for_pic\n ; c_flag_to_name_object_file\n ; object_file_extension\n ; pic_object_file_extension\n ; link_with_pic_object_file_extension\n ; c_compiler_type\n ; csharp_compiler_type\n\n % Java\n ; java_compiler\n ; java_interpreter\n ; java_flags\n ; quoted_java_flag\n ; java_classpath\n ; java_object_file_extension\n\n % IL\n ; il_assembler\n ; ilasm_flags\n ; quoted_ilasm_flag\n ; dotnet_library_version\n ; support_ms_clr\n ; support_rotor_clr\n\n % C#\n ; csharp_compiler\n ; csharp_flags\n ; quoted_csharp_flag\n ; cli_interpreter\n\n % Erlang\n ; erlang_compiler\n ; erlang_interpreter\n ; erlang_flags\n ; quoted_erlang_flag\n ; erlang_include_directory\n ; erlang_object_file_extension\n ; erlang_native_code\n ; erlang_inhibit_trivial_warnings\n\n % Link options\n ; output_file_name\n ; ld_flags\n ; quoted_ld_flag\n ; ld_libflags\n ; quoted_ld_libflag\n ; link_library_directories\n ; runtime_link_library_directories\n ; link_libraries\n ; link_objects\n ; mercury_library_directories\n ; mercury_library_directory_special\n ; search_library_files_directories\n ; search_library_files_directory_special\n ; mercury_libraries\n ; mercury_library_special\n ; mercury_standard_library_directory\n ; mercury_standard_library_directory_special\n ; init_file_directories\n ; init_files\n ; trace_init_files\n ; linkage\n ; linkage_special\n ; mercury_linkage\n ; mercury_linkage_special\n ; strip\n ; demangle\n ; main\n ; allow_undefined\n ; use_readline\n ; runtime_flags\n ; extra_initialization_functions\n ; frameworks\n ; framework_directories\n\n % Auto-configured options.\n ; shared_library_extension\n ; library_extension\n ; executable_file_extension\n ; link_executable_command\n ; link_shared_lib_command\n ; create_archive_command\n ; create_archive_command_output_flag\n ; create_archive_command_flags\n ; ranlib_command\n ; ranlib_flags\n ; mkinit_command\n ; mkinit_erl_command\n ; demangle_command\n ; filtercc_command\n ; trace_libs\n ; thread_libs\n ; hwloc_libs\n ; hwloc_static_libs\n ; shared_libs\n ; math_lib\n ; readline_libs\n ; linker_opt_separator\n ; linker_thread_flags\n ; shlib_linker_thread_flags\n ; linker_static_flags\n ; linker_strip_flag\n ; linker_link_lib_flag\n ; linker_link_lib_suffix\n ; shlib_linker_link_lib_flag\n ; shlib_linker_link_lib_suffix\n ; linker_debug_flags\n ; shlib_linker_debug_flags\n ; linker_trace_flags\n ; shlib_linker_trace_flags\n ; linker_path_flag\n ; linker_rpath_flag\n ; linker_rpath_separator\n ; shlib_linker_rpath_flag\n ; shlib_linker_rpath_separator\n ; linker_allow_undefined_flag\n ; linker_error_undefined_flag\n ; shlib_linker_use_install_name\n ; shlib_linker_install_name_flag\n ; shlib_linker_install_name_path\n ; java_archive_command\n\n % Build system options\n ; make\n ; keep_going\n ; rebuild\n ; jobs\n ; track_flags\n ; invoked_by_mmc_make\n ; extra_init_command\n ; pre_link_command\n ; install_prefix\n ; use_symlinks\n ; mercury_configuration_directory\n ; mercury_configuration_directory_special\n ; install_command\n ; install_command_dir_option\n ; libgrades\n ; libgrades_include_components\n ; libgrades_exclude_components\n ; lib_linkages\n ; flags_file\n ; options_files\n ; config_file\n ; options_search_directories\n ; use_subdirs\n ; use_grade_subdirs\n ; search_directories\n ; intermod_directories\n ; use_search_directories_for_intermod\n ; libgrade_install_check\n ; order_make_by_timestamp\n ; show_make_times\n ; extra_library_header\n ; restricted_command_line\n ; env_type\n ; host_env_type\n ; target_env_type\n\n % Miscellaneous Options\n ; filenames_from_stdin\n ; typecheck_ambiguity_warn_limit\n ; typecheck_ambiguity_error_limit\n ; help\n ; version\n ; fullarch\n ; cross_compiling\n ; local_module_id\n ; analysis_file_cache_dir\n ; compiler_sufficiently_recent\n % This option is used to test that the compiler is sufficiently\n % recent when no other test can easily be constructed in\n % configure.in.\n\n ; experiment\n % This option is provided for use by implementors who want to\n % compare a new way of doing something with the old way. The idea\n % is that the code that switches between the two ways should\n % consult this option and make its decision accordingly.\n %\n % The intention is that all use of this option is within developer\n % workspaces; no code using this option should be committed.\n %\n % Of course, a developer could always create a purpose-specific\n % option to control their code, but adding an option requires\n % recompiling most of the modules in the compiler. Having this\n % option permanently here should reduce the need for that.\n\n ; ignore_par_conjunctions\n ; control_granularity\n ; distance_granularity\n ; implicit_parallelism\n ; feedback_file\n ; par_loop_control\n ; par_loop_control_preserve_tail_recursion.\n\n%----------------------------------------------------------------------------%\n%----------------------------------------------------------------------------%\n\n:- implementation.\n\n:- import_module libs.handle_options.\n\n:- import_module assoc_list.\n:- import_module bool.\n:- import_module dir.\n:- import_module int.\n:- import_module list.\n:- import_module map.\n:- import_module maybe.\n:- import_module pair.\n:- import_module require.\n:- import_module string.\n\n%----------------------------------------------------------------------------%\n\n:- type option_category\n ---> warning_option\n ; verbosity_option\n ; output_option\n ; aux_output_option\n ; language_semantics_option\n ; compilation_model_option\n ; internal_use_option\n ; code_gen_option\n ; special_optimization_option\n ; optimization_option\n ; target_code_compilation_option\n ; link_option\n ; build_system_option\n ; miscellaneous_option.\n\noption_defaults(Option, Default) :-\n option_defaults_2(_Category, OptionsList),\n list.member(Option - Default, OptionsList).\n\n:- pred option_defaults_2(option_category, list(pair(option, option_data))).\n:- mode option_defaults_2(in, out) is det.\n:- mode option_defaults_2(out, out) is multi.\n\noption_defaults_2(warning_option, [\n % Warning Options\n inhibit_warnings - bool_special,\n inhibit_accumulator_warnings - bool(no),\n halt_at_warn - bool(no),\n halt_at_syntax_errors - bool(no),\n halt_at_auto_parallel_failure - bool(no),\n\n % IMPORTANT NOTE:\n % if you add any new warning options, or if you change the default\n % for an existing warning option to `yes', then you will need to modify\n % the handling of inhibit_warnings.\n\n warn_singleton_vars - bool(yes),\n warn_overlapping_scopes - bool(yes),\n warn_det_decls_too_lax - bool(yes),\n warn_inferred_erroneous - bool(yes),\n warn_nothing_exported - bool(yes),\n warn_unused_args - bool(no),\n warn_interface_imports - bool(yes),\n warn_non_contiguous_clauses - bool(no), % XXX should be yes\n warn_non_contiguous_foreign_procs - bool(no),\n warn_non_stratification - bool(no),\n warn_missing_opt_files - bool(yes),\n warn_missing_trans_opt_files - bool(no),\n warn_missing_trans_opt_deps - bool(yes),\n warn_unification_cannot_succeed - bool(yes),\n warn_simple_code - bool(yes),\n warn_duplicate_calls - bool(no),\n warn_missing_module_name - bool(yes),\n warn_wrong_module_name - bool(yes),\n warn_smart_recompilation - bool(yes),\n warn_undefined_options_variables - bool(yes),\n warn_non_tail_recursion - bool(no),\n warn_target_code - bool(yes),\n warn_up_to_date - bool(yes),\n warn_stubs - bool(yes),\n warn_dead_procs - bool(no),\n warn_table_with_inline - bool(yes),\n warn_non_term_special_preds - bool(yes),\n warn_known_bad_format_calls - bool(yes),\n warn_unknown_format_calls - bool(no),\n warn_obsolete - bool(yes),\n warn_insts_without_matching_type - bool(yes),\n % XXX disabled by default until someone\n % removes all the unused imports from\n % the compiler itself which is compiled\n % with --halt-at-warn by default.\n warn_unused_imports - bool(no),\n inform_ite_instead_of_switch - bool(no),\n warn_unresolved_polymorphism - bool(yes),\n warn_suspicious_foreign_procs - bool(no),\n warn_state_var_shadowing - bool(yes),\n inform_inferred - bool_special,\n inform_inferred_types - bool(yes),\n inform_inferred_modes - bool(yes)\n]).\noption_defaults_2(verbosity_option, [\n % Verbosity Options\n verbose - bool(no),\n very_verbose - bool(no),\n verbose_errors - bool(no),\n verbose_recompilation - bool(no),\n find_all_recompilation_reasons - bool(no),\n verbose_make - bool(yes),\n verbose_commands - bool(no),\n output_compile_error_lines - int(15),\n report_cmd_line_args - bool(no),\n report_cmd_line_args_in_doterr - bool(no),\n statistics - bool(no),\n detailed_statistics - bool(no),\n proc_size_statistics - string(\"\"),\n debug_types - bool(no),\n debug_modes - bool(no),\n debug_modes_statistics - bool(no),\n debug_modes_minimal - bool(no),\n debug_modes_verbose - bool(no),\n debug_modes_pred_id - int(-1),\n debug_dep_par_conj - accumulating([]),\n debug_det - bool(no),\n debug_code_gen_pred_id - int(-1),\n debug_term - bool(no),\n debug_opt - bool(no),\n debug_opt_pred_id - accumulating([]),\n debug_opt_pred_name - accumulating([]),\n debug_pd - bool(no),\n debug_il_asm - bool(no),\n debug_liveness - int(-1),\n debug_stack_opt - int(-1),\n debug_make - bool(no),\n debug_closure - bool(no),\n debug_trail_usage - bool(no),\n debug_mode_constraints - bool(no),\n debug_intermodule_analysis - bool(no),\n debug_mm_tabling_analysis - bool(no),\n debug_indirect_reuse - bool(no),\n debug_type_rep - bool(no)\n]).\noption_defaults_2(output_option, [\n % Output Options (mutually exclusive)\n generate_source_file_mapping - bool(no),\n generate_dependency_file - bool(no),\n generate_dependencies - bool(no),\n generate_module_order - bool(no),\n generate_standalone_interface - maybe_string(no),\n make_short_interface - bool(no),\n make_interface - bool(no),\n make_private_interface - bool(no),\n make_optimization_interface - bool(no),\n make_transitive_opt_interface - bool(no),\n make_analysis_registry - bool(no),\n make_xml_documentation - bool(no),\n convert_to_mercury - bool(no),\n typecheck_only - bool(no),\n errorcheck_only - bool(no),\n target_code_only - bool(no),\n compile_only - bool(no),\n compile_to_shared_lib - bool(no),\n output_grade_string - bool(no),\n output_link_command - bool(no),\n output_shared_lib_link_command - bool(no),\n output_libgrades - bool(no),\n output_cc - bool(no),\n output_c_compiler_type - bool(no),\n output_csharp_compiler_type - bool(no),\n output_cflags - bool(no),\n output_library_link_flags - bool(no),\n output_grade_defines - bool(no),\n output_c_include_directory_flags - bool(no)\n]).\noption_defaults_2(aux_output_option, [\n % Auxiliary Output Options\n smart_recompilation - bool(no),\n generate_item_version_numbers - bool(no),\n generate_mmc_make_module_dependencies - bool(no),\n assume_gmake - bool(yes),\n trace_level - string(\"default\"),\n trace_optimized - bool(no),\n trace_prof - bool(no),\n trace_table_io - bool(no),\n trace_table_io_only_retry - bool(no),\n trace_table_io_states - bool(no),\n trace_table_io_require - bool(no),\n trace_table_io_all - bool(no),\n trace_goal_flags - accumulating([]),\n prof_optimized - bool(no),\n exec_trace_tail_rec - bool(no),\n suppress_trace - string(\"\"),\n force_disable_tracing - bool(no),\n delay_death - bool(yes),\n delay_death_max_vars - int(1000),\n stack_trace_higher_order - bool(no),\n force_disable_ssdebug - bool(no),\n generate_bytecode - bool(no),\n line_numbers - bool(yes),\n auto_comments - bool(no),\n frameopt_comments - bool(no),\n max_error_line_width - int(79),\n show_dependency_graph - bool(no),\n imports_graph - bool(no),\n dump_trace_counts - accumulating([]),\n dump_hlds - accumulating([]),\n dump_hlds_pred_id - accumulating([]),\n dump_hlds_pred_name - accumulating([]),\n dump_hlds_alias - string(\"\"),\n dump_hlds_options - string(\"\"),\n dump_hlds_inst_limit - int(100),\n dump_hlds_file_suffix - string(\"\"),\n dump_same_hlds - bool(no),\n dump_mlds - accumulating([]),\n verbose_dump_mlds - accumulating([]),\n mode_constraints - bool(no),\n simple_mode_constraints - bool(no),\n prop_mode_constraints - bool(no),\n benchmark_modes - bool(no),\n benchmark_modes_repeat - int(1),\n sign_assembly - bool(no),\n % XXX should default to no but currently broken\n separate_assemblies - bool(yes)\n]).\noption_defaults_2(language_semantics_option, [\n strict_sequential - special,\n reorder_conj - bool(yes),\n reorder_disj - bool(yes),\n fully_strict - bool(yes),\n allow_stubs - bool(no),\n infer_types - bool(no),\n infer_modes - bool(no),\n infer_det - bool(yes),\n infer_all - bool_special,\n type_inference_iteration_limit - int(60),\n mode_inference_iteration_limit - int(30),\n event_set_file_name - string(\"\")\n]).\noption_defaults_2(compilation_model_option, [\n % Compilation model options (ones that affect binary compatibility).\n grade - string_special,\n % The `mmc' script will pass the default grade determined\n % at configuration time.\n\n % Target selection compilation model options\n target - string(\"c\"),\n il - special,\n il_only - special,\n compile_to_c - special,\n csharp - special,\n csharp_only - special,\n java - special,\n java_only - special,\n x86_64 - special,\n x86_64_only - special,\n erlang - special,\n erlang_only - special,\n\n % Optional feature compilation model options:\n % (a) Debuggging\n exec_trace - bool(no),\n decl_debug - bool(no),\n % (b) Profiling\n profiling - bool_special,\n time_profiling - special,\n memory_profiling - special,\n deep_profiling - special,\n profile_calls - bool(no),\n profile_time - bool(no),\n profile_memory - bool(no),\n profile_deep - bool(no),\n use_activation_counts - bool(no),\n pre_prof_transforms_simplify - bool(no),\n pre_implicit_parallelism_simplify - bool(no),\n coverage_profiling - bool(yes),\n coverage_profiling_via_calls - bool(no),\n coverage_profiling_static - bool(no),\n profile_deep_coverage_after_goal - bool(yes),\n profile_deep_coverage_branch_ite - bool(yes),\n profile_deep_coverage_branch_switch - bool(yes),\n profile_deep_coverage_branch_disj - bool(yes),\n profile_deep_coverage_use_portcounts - bool(no),\n profile_deep_coverage_use_trivial - bool(no),\n profile_for_feedback - bool(no),\n use_zeroing_for_ho_cycles - bool(yes),\n use_lots_of_ho_specialization - bool(no),\n deep_profile_tail_recursion - bool(no),\n record_term_sizes_as_words - bool(no),\n record_term_sizes_as_cells - bool(no),\n experimental_complexity - string(\"\"),\n % (c) Miscellaneous optional features\n gc - string(\"boehm\"),\n parallel - bool(no),\n threadscope - bool(no),\n use_trail - bool(no),\n trail_segments - bool(no),\n maybe_thread_safe_opt - string(\"no\"),\n extend_stacks_when_needed - bool(no),\n stack_segments - bool(no),\n use_regions - bool(no),\n use_alloc_regions - bool(yes),\n use_regions_debug - bool(no),\n use_regions_profiling - bool(no),\n use_minimal_model_stack_copy - bool(no),\n use_minimal_model_own_stacks - bool(no),\n minimal_model_debug - bool(no),\n single_prec_float - bool(no),\n type_layout - bool(yes),\n source_to_source_debug - bool(no),\n ssdb_trace_level - string(\"default\"),\n link_ssdb_libs - bool(no),\n\n % Data representation compilation model options\n pic_reg - bool(no),\n tags - string(\"low\"),\n num_tag_bits - int(-1),\n % -1 is a special value which means\n % use the value of conf_low_tag_bits\n % instead\n num_reserved_addresses - int(0),\n num_reserved_objects - int(0),\n bits_per_word - int(32),\n % A good default for the current\n % generation of architectures.\n bytes_per_word - int(4),\n % A good default for the current\n % generation of architectures.\n conf_low_tag_bits - int(2),\n % The `mmc' script will override the\n % above default with a value determined\n % at configuration time.\n sync_term_size - int(8),\n % 8 is the size on linux (at the time\n % of writing) - will usually be\n % overridden by a value from configure.\n unboxed_float - bool(no),\n unboxed_enums - bool(yes),\n unboxed_no_tag_types - bool(yes),\n\n % LLDS back-end compilation model options\n gcc_non_local_gotos - bool(yes),\n gcc_global_registers - bool(yes),\n asm_labels - bool(yes),\n use_float_registers - bool(yes),\n\n % MLDS back-end compilation model options\n highlevel_code - bool(no),\n highlevel_data - bool(no),\n gcc_nested_functions - bool(no),\n det_copy_out - bool(no),\n nondet_copy_out - bool(no),\n put_commit_in_own_func - bool(no),\n put_nondet_env_on_heap - bool(no),\n\n % IL back-end compilation model options\n verifiable_code - bool(no),\n il_funcptr_types - bool(no),\n il_refany_fields - bool(no),\n il_byref_tailcalls - bool(no)\n]).\noption_defaults_2(internal_use_option, [\n % Options for internal use only\n backend_foreign_languages - accumulating([]),\n % The backend_foreign_languages option\n % depends on the target and is set in\n % handle_options.\n stack_trace - bool(no),\n basic_stack_layout - bool(no),\n agc_stack_layout - bool(no),\n procid_stack_layout - bool(no),\n trace_stack_layout - bool(no),\n body_typeinfo_liveness - bool(no),\n can_compare_constants_as_ints - bool(no),\n pretest_equality_cast_pointers - bool(no),\n can_compare_compound_values - bool(no),\n lexically_order_constructors - bool(no),\n mutable_always_boxed - bool(yes),\n delay_partial_instantiations - bool(no),\n allow_defn_of_builtins - bool(no),\n special_preds - bool(yes),\n type_ctor_info - bool(yes),\n type_ctor_layout - bool(yes),\n type_ctor_functors - bool(yes),\n rtti_line_numbers - bool(yes),\n new_type_class_rtti - bool(no),\n disable_minimal_model_stack_copy_pneg - bool(no),\n disable_minimal_model_stack_copy_cut - bool(no),\n use_minimal_model_stack_copy_pneg - bool(no),\n use_minimal_model_stack_copy_cut - bool(no),\n disable_trail_ops - bool(no),\n % The size_* values below *must* be consistent with the corresponding\n % values or data structures in mercury_region.h.\n size_region_ite_fixed - int(4),\n size_region_disj_fixed - int(4),\n size_region_commit_fixed - int(5),\n size_region_ite_protect - int(1),\n size_region_ite_snapshot - int(3),\n size_region_semi_disj_protect - int(1),\n size_region_disj_snapshot - int(3),\n size_region_commit_entry - int(1),\n solver_type_auto_init - bool(no),\n allow_multi_arm_switches - bool(yes),\n type_check_constraints - bool(no),\n allow_argument_packing - bool(yes)\n]).\noption_defaults_2(code_gen_option, [\n % Code Generation Options\n low_level_debug - bool(no),\n table_debug - bool(no),\n trad_passes - bool(yes),\n parallel_liveness - bool(no),\n parallel_code_gen - bool(no),\n polymorphism - bool(yes),\n reclaim_heap_on_failure - bool_special,\n reclaim_heap_on_semidet_failure - bool(yes),\n reclaim_heap_on_nondet_failure - bool(yes),\n have_delay_slot - bool(no),\n % The `mmc' script may override the\n % above default if configure says\n % the machine has branch delay slots.\n num_real_r_regs - int(5),\n num_real_f_regs - int(0),\n num_real_r_temps - int(5),\n num_real_f_temps - int(0),\n % The `mmc' script will override the\n % above defaults with values determined\n % at configuration time.\n max_jump_table_size - int(0),\n % 0 indicates any size.\n max_specialized_do_call_closure - int(5),\n % mercury.do_call_closure_N\n % exists for N <= option_value;\n % set to -1 to disable.\n % Should be less than or equal to\n % max_spec_explicit_arg\n % in tools/make_spec_ho_call.\n max_specialized_do_call_class_method - int(6),\n % mercury.do_call_class_method_N\n % exists for N <= option_value;\n % set to -1 to disable.\n % Should be less than or equal to\n % max_spec_explicit_arg\n % in tools/make_spec_method_call.\n compare_specialization - int(-1),\n % -1 asks handle_options.m to give\n % the value, which may be grade\n % dependent.\n should_pretest_equality - bool(yes),\n fact_table_max_array_size - int(1024),\n fact_table_hash_percent_full - int(90),\n gcc_local_labels - bool(no),\n prefer_switch - bool(yes),\n opt_no_return_calls - bool(yes)\n]).\noption_defaults_2(special_optimization_option, [\n % Special optimization options.\n % These ones are not affected by `-O'.\n opt_level - int_special,\n opt_level_number - int(-2),\n opt_space - special,\n intermodule_optimization - bool(no),\n read_opt_files_transitively - bool(yes),\n use_opt_files - bool(no),\n use_trans_opt_files - bool(no),\n transitive_optimization - bool(no),\n intermodule_analysis - bool(no),\n analysis_repeat - int(0),\n analysis_file_cache - bool(no),\n termination_check - bool(no),\n verbose_check_termination - bool(no),\n structure_sharing_analysis - bool(no),\n structure_sharing_widening - int(0),\n structure_reuse_analysis - bool(no),\n structure_reuse_constraint - string(\"within_n_cells_difference\"),\n structure_reuse_constraint_arg - int(0),\n structure_reuse_max_conditions - int(10),\n structure_reuse_repeat - int(0),\n structure_reuse_free_cells - bool(no),\n termination - bool(no),\n termination_single_args - int(0),\n termination_norm - string(\"total\"),\n termination_error_limit - int(3),\n termination_path_limit - int(256),\n termination2 - bool(no),\n termination2_norm - string(\"total\"),\n check_termination2 - bool(no),\n verbose_check_termination2 - bool(no),\n widening_limit - int(4),\n arg_size_analysis_only - bool(no),\n propagate_failure_constrs - bool(yes),\n % XXX This is just a guess - I'm not sure what sensible\n % value for this is.\n term2_maximum_matrix_size - int(70),\n analyse_exceptions - bool(no),\n analyse_closures - bool(no),\n analyse_trail_usage - bool(no),\n optimize_trail_usage - bool(no),\n optimize_region_ops - bool(no),\n analyse_mm_tabling - bool(no)\n]).\noption_defaults_2(optimization_option, [\n % Optimization options\n %\n % IMPORTANT: the default here should be all optimizations OFF.\n % Optimizations should be enabled by the appropriate\n % optimization level in the opt_level table.\n\n % HLDS\n allow_inlining - bool(yes),\n inlining - bool_special,\n inline_simple - bool(no),\n inline_builtins - bool(yes),\n inline_single_use - bool(no),\n inline_call_cost - int(0),\n inline_compound_threshold - int(0),\n inline_simple_threshold - int(5),\n % Has no effect until\n % --inline-simple is enabled.\n inline_vars_threshold - int(100),\n intermod_inline_simple_threshold - int(5),\n % Has no effect until\n % --intermodule-optimization.\n from_ground_term_threshold - int(5),\n enable_const_struct - bool(yes),\n common_struct - bool(no),\n common_struct_preds - string(\"\"),\n common_goal - bool(yes),\n % common_goal is not really an\n % optimization, since it affects\n % the semantics.\n\n constraint_propagation - bool(no),\n local_constraint_propagation - bool(no),\n optimize_duplicate_calls - bool(no),\n constant_propagation - bool(no),\n excess_assign - bool(no),\n optimize_format_calls - bool(yes),\n loop_invariants - bool(no),\n optimize_saved_vars_const - bool(no),\n optimize_saved_vars_cell - bool(no),\n optimize_saved_vars_cell_loop - bool(yes),\n optimize_saved_vars_cell_full_path - bool(yes),\n optimize_saved_vars_cell_on_stack - bool(yes),\n optimize_saved_vars_cell_candidate_headvars - bool(yes),\n optimize_saved_vars_cell_cv_store_cost - int(3),\n optimize_saved_vars_cell_cv_load_cost - int(1),\n optimize_saved_vars_cell_fv_store_cost - int(1),\n optimize_saved_vars_cell_fv_load_cost - int(1),\n optimize_saved_vars_cell_op_ratio - int(100),\n optimize_saved_vars_cell_node_ratio - int(100),\n optimize_saved_vars_cell_all_path_node_ratio - int(100),\n optimize_saved_vars_cell_include_all_candidates - bool(yes),\n optimize_saved_vars - bool_special,\n delay_construct - bool(no),\n follow_code - bool(no),\n optimize_unused_args - bool(no),\n intermod_unused_args - bool(no),\n optimize_higher_order - bool(no),\n higher_order_size_limit - int(20),\n higher_order_arg_limit - int(10),\n unneeded_code - bool(no),\n unneeded_code_copy_limit - int(10),\n unneeded_code_debug - bool(no),\n unneeded_code_debug_pred_name - accumulating([]),\n type_specialization - bool(no),\n user_guided_type_specialization - bool(no),\n introduce_accumulators - bool(no),\n optimize_constructor_last_call_accumulator - bool(no),\n optimize_constructor_last_call_null - bool(no),\n optimize_constructor_last_call - bool(no),\n optimize_dead_procs - bool(no),\n deforestation - bool(no),\n deforestation_depth_limit - int(4),\n deforestation_cost_factor - int(1000),\n deforestation_vars_threshold - int(200),\n deforestation_size_threshold - int(15),\n untuple - bool(no),\n tuple - bool(no),\n tuple_trace_counts_file - string(\"\"),\n tuple_costs_ratio - int(100),\n tuple_min_args - int(4),\n inline_par_builtins - bool(no),\n always_specialize_in_dep_par_conjs - bool(no),\n allow_some_paths_only_waits - bool(yes),\n region_analysis - bool(no),\n\n % HLDS -> LLDS\n smart_indexing - bool(no),\n dense_switch_req_density - int(25),\n % Minimum density before using\n % a dense switch.\n lookup_switch_req_density - int(25),\n % Minimum density before using\n % a lookup switch.\n dense_switch_size - int(4),\n lookup_switch_size - int(4),\n string_hash_switch_size - int(8),\n string_binary_switch_size - int(4),\n tag_switch_size - int(3),\n try_switch_size - int(3),\n binary_switch_size - int(4),\n switch_single_rec_base_first - bool(no),\n switch_multi_rec_base_first - bool(yes),\n static_ground_cells - bool(no),\n static_ground_floats - bool(no),\n static_code_addresses - bool(no),\n use_atomic_cells - bool(no),\n middle_rec - bool(no),\n simple_neg - bool(no),\n allow_hijacks - bool(yes),\n\n % MLDS\n optimize_tailcalls - bool(no),\n optimize_initializations - bool(no),\n eliminate_local_vars - bool(no),\n generate_trail_ops_inline - bool(yes),\n\n % LLDS\n common_data - bool(no),\n common_layout_data - bool(yes),\n optimize - bool(no),\n optimize_peep - bool(no),\n optimize_peep_mkword - bool(no),\n optimize_jumps - bool(no),\n optimize_fulljumps - bool(no),\n pessimize_tailcalls - bool(no),\n checked_nondet_tailcalls - bool(no),\n use_local_vars - bool(no),\n local_var_access_threshold - int(2),\n standardize_labels - bool(no),\n optimize_labels - bool(no),\n optimize_dups - bool(no),\n optimize_proc_dups - bool(no),\n optimize_frames - bool(no),\n optimize_delay_slot - bool(no),\n optimize_reassign - bool(no),\n optimize_repeat - int(0),\n layout_compression_limit - int(4000),\n\n % LLDS -> C\n use_macro_for_redo_fail - bool(no),\n emit_c_loops - bool(no),\n procs_per_c_function - int(1),\n everything_in_one_c_function - special,\n local_thread_engine_base - bool(yes),\n\n % Erlang\n erlang_switch_on_strings_as_atoms - bool(no)\n]).\noption_defaults_2(target_code_compilation_option, [\n % Target code compilation options\n target_debug - bool(no),\n\n % C\n cc - string(\"gcc\"),\n % The `mmc' script will override the\n % default with a value determined at\n % configuration time.\n c_include_directory - accumulating([]),\n % The `mmc' script will override the\n % default with a value determined at\n % configuration time.\n c_optimize - bool(no),\n ansi_c - bool(yes),\n inline_alloc - bool(no),\n cflags - accumulating([]),\n quoted_cflag - string_special,\n\n gcc_flags - accumulating([]),\n quoted_gcc_flag - string_special,\n clang_flags - accumulating([]),\n quoted_clang_flag - string_special,\n msvc_flags - accumulating([]),\n quoted_msvc_flag - string_special,\n\n cflags_for_warnings - string(\"\"),\n % The `mmc' script will override the\n % default with values determined at\n % configuration time.\n cflags_for_optimization - string(\"-O\"),\n cflags_for_ansi - string(\"\"),\n cflags_for_regs - string(\"\"),\n cflags_for_gotos - string(\"\"),\n cflags_for_threads - string(\"\"),\n cflags_for_debug - string(\"-g\"),\n cflags_for_pic - string(\"\"),\n c_flag_to_name_object_file - string(\"-o \"),\n object_file_extension - string(\".o\"),\n pic_object_file_extension - string(\".o\"),\n link_with_pic_object_file_extension - string(\".o\"),\n c_compiler_type - string(\"gcc\"),\n csharp_compiler_type - string(\"mono\"),\n % The `mmc' script will override the\n % default with a value determined at\n % configuration time for the above\n % two options\n % Java\n java_compiler - string(\"javac\"),\n java_interpreter - string(\"java\"),\n java_flags - accumulating([]),\n quoted_java_flag - string_special,\n java_classpath - accumulating([]),\n java_object_file_extension - string(\".class\"),\n\n % IL\n il_assembler - string(\"ilasm\"),\n ilasm_flags - accumulating([]),\n quoted_ilasm_flag - string_special,\n dotnet_library_version - string(\"1.0.3300.0\"),\n % We default to the version of the\n % library that came with Beta2.\n support_ms_clr - bool(yes),\n support_rotor_clr - bool(no),\n\n % C#\n csharp_compiler - string(\"csc\"),\n csharp_flags - accumulating([]),\n quoted_csharp_flag - string_special,\n cli_interpreter - string(\"\"),\n\n % Erlang\n erlang_compiler - string(\"erlc\"),\n erlang_interpreter - string(\"erl\"),\n erlang_flags - accumulating([]),\n quoted_erlang_flag - string_special,\n erlang_include_directory - accumulating([]),\n erlang_object_file_extension - string(\".beam\"),\n erlang_native_code - bool(no),\n erlang_inhibit_trivial_warnings - bool(yes)\n]).\noption_defaults_2(link_option, [\n % Link Options\n output_file_name - string(\"\"),\n % If the output_file_name is an empty\n % string, we use the name of the first\n % module on the command line.\n ld_flags - accumulating([]),\n quoted_ld_flag - string_special,\n ld_libflags - accumulating([]),\n quoted_ld_libflag - string_special,\n link_library_directories - accumulating([]),\n runtime_link_library_directories - accumulating([]),\n link_libraries - accumulating([]),\n link_objects - accumulating([]),\n mercury_library_directory_special - string_special,\n mercury_library_directories - accumulating([]),\n search_library_files_directory_special - string_special,\n search_library_files_directories - accumulating([]),\n mercury_library_special - string_special,\n mercury_libraries - accumulating([]),\n mercury_standard_library_directory - maybe_string(no),\n % The Mercury.config file will set the\n % default standard library directory.\n mercury_standard_library_directory_special - maybe_string_special,\n init_file_directories - accumulating([]),\n init_files - accumulating([]),\n trace_init_files - accumulating([]),\n linkage - string(\"shared\"),\n linkage_special - string_special,\n mercury_linkage - string(\"shared\"),\n mercury_linkage_special - string_special,\n demangle - bool(yes),\n strip - bool(yes),\n main - bool(yes),\n allow_undefined - bool(yes),\n use_readline - bool(yes),\n runtime_flags - accumulating([]),\n extra_initialization_functions - bool(no),\n frameworks - accumulating([]),\n framework_directories - accumulating([]),\n\n shared_library_extension - string(\".so\"),\n % The `mmc' script will override the\n % default with a value determined at\n % configuration time.\n library_extension - string(\".a\"),\n executable_file_extension - string(\"\"),\n link_executable_command - string(\"gcc\"),\n link_shared_lib_command - string(\"gcc -shared\"),\n create_archive_command - string(\"ar\"),\n create_archive_command_output_flag - string(\"\"),\n create_archive_command_flags - accumulating([]), % \"cr\"\n ranlib_command - string(\"\"),\n ranlib_flags - string(\"\"),\n mkinit_command - string(\"mkinit\"),\n mkinit_erl_command - string(\"mkinit_erl\"),\n demangle_command - string(\"mdemangle\"),\n filtercc_command - string(\"mfiltercc\"),\n trace_libs - string(\"\"),\n thread_libs - string(\"\"),\n hwloc_libs - string(\"\"),\n hwloc_static_libs - string(\"\"),\n shared_libs - string(\"\"),\n math_lib - string(\"\"),\n readline_libs - string(\"\"),\n linker_opt_separator - string(\"\"),\n linker_debug_flags - string(\"-g\"),\n shlib_linker_debug_flags - string(\"-g\"),\n linker_trace_flags - string(\"-g\"),\n shlib_linker_trace_flags - string(\"-g\"),\n linker_thread_flags - string(\"\"),\n shlib_linker_thread_flags - string(\"\"),\n linker_static_flags - string(\"-static\"),\n linker_strip_flag - string(\"-s\"),\n linker_link_lib_flag - string(\"-l\"),\n linker_link_lib_suffix - string(\"\"),\n shlib_linker_link_lib_flag - string(\"-l\"),\n shlib_linker_link_lib_suffix - string(\"\"),\n linker_path_flag - string(\"-L\"),\n linker_rpath_flag - string(\"-Wl,-rpath\"),\n linker_rpath_separator - string(\" -Wl,-rpath\"),\n shlib_linker_rpath_flag - string(\"-Wl,-rpath\"),\n shlib_linker_rpath_separator - string(\" -Wl,-rpath\"),\n linker_allow_undefined_flag - string(\"\"),\n linker_error_undefined_flag - string(\"-Wl,-no-undefined\"),\n shlib_linker_use_install_name - bool(no),\n shlib_linker_install_name_flag - string(\"-install_name \"),\n shlib_linker_install_name_path - string(\"\"),\n java_archive_command - string(\"jar\")\n]).\noption_defaults_2(build_system_option, [\n % Build System Options\n make - bool(no),\n keep_going - bool(no),\n rebuild - bool(no),\n jobs - int(1),\n track_flags - bool(no),\n invoked_by_mmc_make - bool(no),\n pre_link_command - maybe_string(no),\n extra_init_command - maybe_string(no),\n install_prefix - string(\"/usr/local/\"),\n use_symlinks - bool(yes),\n\n % If `--mercury-stdlib-dir' is set, `--mercury-config-dir'\n % must also be set. This invariant is maintained by the\n % `special' variants of the options.\n mercury_configuration_directory_special - string_special,\n mercury_configuration_directory - maybe_string(no),\n install_command - string(\"cp\"),\n install_command_dir_option - string(\"-r\"),\n libgrades - accumulating([]),\n libgrades_include_components - accumulating([]),\n libgrades_exclude_components - accumulating([]),\n lib_linkages - accumulating([]),\n flags_file - file_special,\n options_files - accumulating([\"Mercury.options\"]),\n\n config_file - maybe_string(yes(\"\")),\n % yes(\"\") means unset.\n options_search_directories - accumulating([\".\"]),\n use_subdirs - bool(no),\n use_grade_subdirs - bool(no),\n search_directories - accumulating([\".\"]),\n intermod_directories - accumulating([]),\n use_search_directories_for_intermod - bool(yes),\n libgrade_install_check - bool(yes),\n order_make_by_timestamp - bool(no),\n show_make_times - bool(no),\n extra_library_header - accumulating([]),\n restricted_command_line - bool(no),\n env_type - string_special,\n host_env_type - string(\"posix\"),\n target_env_type - string(\"posix\")\n]).\noption_defaults_2(miscellaneous_option, [\n % Miscellaneous Options\n filenames_from_stdin - bool(no),\n typecheck_ambiguity_warn_limit - int(50),\n typecheck_ambiguity_error_limit - int(3000),\n help - bool(no),\n version - bool(no),\n fullarch - string(\"\"),\n cross_compiling - bool(no),\n local_module_id - accumulating([]),\n analysis_file_cache_dir - string(\"\"),\n compiler_sufficiently_recent - bool(no),\n experiment - string(\"\"),\n ignore_par_conjunctions - bool(no),\n control_granularity - bool(no),\n distance_granularity - int(0),\n implicit_parallelism - bool(no),\n feedback_file - string(\"\"),\n par_loop_control - bool(no),\n par_loop_control_preserve_tail_recursion - bool(no)\n]).\n\n % please keep this in alphabetic order\nshort_option('c', compile_only).\nshort_option('C', target_code_only).\nshort_option('d', dump_hlds).\nshort_option('D', dump_hlds_alias).\nshort_option('e', errorcheck_only).\nshort_option('E', verbose_errors).\nshort_option('f', generate_source_file_mapping).\nshort_option('F', framework_directories).\nshort_option('h', help).\nshort_option('H', highlevel_code).\nshort_option('i', make_interface).\nshort_option('j', jobs).\nshort_option('I', search_directories).\nshort_option('k', keep_going).\nshort_option('l', link_libraries).\nshort_option('L', link_library_directories).\nshort_option('m', make).\nshort_option('M', generate_dependencies).\nshort_option('n', line_numbers).\nshort_option('N', debug_modes).\nshort_option('o', output_file_name).\nshort_option('O', opt_level).\nshort_option('p', profiling).\nshort_option('P', convert_to_mercury).\nshort_option('r', rebuild).\nshort_option('R', runtime_link_library_directories).\nshort_option('s', grade).\nshort_option('S', statistics).\nshort_option('T', debug_types).\nshort_option('t', typecheck_only).\nshort_option('v', verbose).\nshort_option('V', very_verbose).\nshort_option('w', inhibit_warnings).\nshort_option('x', make_xml_documentation).\nshort_option('?', help).\n\n% warning options\nlong_option(\"inhibit-warnings\", inhibit_warnings).\nlong_option(\"inhibit-accumulator-warnings\", inhibit_accumulator_warnings).\nlong_option(\"halt-at-warn\", halt_at_warn).\nlong_option(\"halt-at-syntax-errors\", halt_at_syntax_errors).\nlong_option(\"halt-at-auto-parallel-failure\", halt_at_auto_parallel_failure).\nlong_option(\"warn-singleton-variables\", warn_singleton_vars).\nlong_option(\"warn-overlapping-scopes\", warn_overlapping_scopes).\nlong_option(\"warn-det-decls-too-lax\", warn_det_decls_too_lax).\nlong_option(\"warn-inferred-erroneous\", warn_inferred_erroneous).\nlong_option(\"warn-nothing-exported\", warn_nothing_exported).\nlong_option(\"warn-unused-args\", warn_unused_args).\nlong_option(\"warn-interface-imports\", warn_interface_imports).\nlong_option(\"warn-non-contiguous-clauses\", warn_non_contiguous_clauses).\nlong_option(\"warn-non-contiguous-foreign-procs\",\n warn_non_contiguous_foreign_procs).\nlong_option(\"warn-non-stratification\", warn_non_stratification).\nlong_option(\"warn-missing-opt-files\", warn_missing_opt_files).\nlong_option(\"warn-missing-trans-opt-files\", warn_missing_trans_opt_files).\nlong_option(\"warn-missing-trans-opt-deps\", warn_missing_trans_opt_deps).\nlong_option(\"warn-unification-cannot-succeed\",\n warn_unification_cannot_succeed).\nlong_option(\"warn-simple-code\", warn_simple_code).\nlong_option(\"warn-duplicate-calls\", warn_duplicate_calls).\nlong_option(\"warn-missing-module-name\", warn_missing_module_name).\nlong_option(\"warn-wrong-module-name\", warn_wrong_module_name).\nlong_option(\"warn-smart-recompilation\", warn_smart_recompilation).\nlong_option(\"warn-undefined-options-variables\",\n warn_undefined_options_variables).\nlong_option(\"warn-non-tail-recursion\", warn_non_tail_recursion).\nlong_option(\"warn-target-code\", warn_target_code).\nlong_option(\"warn-up-to-date\", warn_up_to_date).\nlong_option(\"warn-stubs\", warn_stubs).\nlong_option(\"warn-dead-procs\", warn_dead_procs).\nlong_option(\"warn-table-with-inline\", warn_table_with_inline).\nlong_option(\"warn-non-term-special-preds\", warn_non_term_special_preds).\nlong_option(\"warn-known-bad-format-calls\", warn_known_bad_format_calls).\nlong_option(\"warn-unknown-format-calls\", warn_unknown_format_calls).\nlong_option(\"warn-obsolete\", warn_obsolete).\nlong_option(\"warn-insts-without-matching-type\",\n warn_insts_without_matching_type).\nlong_option(\"warn-unused-imports\", warn_unused_imports).\nlong_option(\"inform-ite-instead-of-switch\", inform_ite_instead_of_switch).\nlong_option(\"warn-unresolved-polymorphism\", warn_unresolved_polymorphism).\nlong_option(\"warn-suspicious-foreign-procs\", warn_suspicious_foreign_procs).\nlong_option(\"warn-state-var-shadowing\", warn_state_var_shadowing).\nlong_option(\"inform-inferred\", inform_inferred).\nlong_option(\"inform-inferred-types\", inform_inferred_types).\nlong_option(\"inform-inferred-modes\", inform_inferred_modes).\n\n% verbosity options\nlong_option(\"verbose\", verbose).\nlong_option(\"very-verbose\", very_verbose).\nlong_option(\"verbose-error-messages\", verbose_errors).\nlong_option(\"verbose-recompilation\", verbose_recompilation).\nlong_option(\"find-all-recompilation-reasons\",\n find_all_recompilation_reasons).\nlong_option(\"verbose-make\", verbose_make).\nlong_option(\"verbose-commands\", verbose_commands).\nlong_option(\"output-compile-error-lines\", output_compile_error_lines).\nlong_option(\"report-cmd-line-args\", report_cmd_line_args).\nlong_option(\"report-cmd-line-args-in-doterr\",\n report_cmd_line_args_in_doterr).\nlong_option(\"statistics\", statistics).\nlong_option(\"detailed-statistics\", detailed_statistics).\nlong_option(\"proc-size-statistics\", proc_size_statistics).\nlong_option(\"debug-types\", debug_types).\nlong_option(\"debug-modes\", debug_modes).\nlong_option(\"debug-modes-statistics\", debug_modes_statistics).\nlong_option(\"debug-modes-minimal\", debug_modes_minimal).\nlong_option(\"debug-modes-verbose\", debug_modes_verbose).\nlong_option(\"debug-modes-pred-id\", debug_modes_pred_id).\nlong_option(\"debug-dep-par-conj\", debug_dep_par_conj).\nlong_option(\"debug-determinism\", debug_det).\nlong_option(\"debug-det\", debug_det).\nlong_option(\"debug-code-gen-pred-id\", debug_code_gen_pred_id).\nlong_option(\"debug-termination\", debug_term).\nlong_option(\"debug-term\", debug_term).\nlong_option(\"debug-opt\", debug_opt).\nlong_option(\"debug-opt-pred-id\", debug_opt_pred_id).\nlong_option(\"debug-opt-pred-name\", debug_opt_pred_name).\nlong_option(\"debug-pd\", debug_pd).\n % debug-il-asm does very low-level printf style debugging of\n % IL assembler. Each instruction is written on stdout before it\n % is executed. It is a temporary measure until the IL debugging\n % system built into .NET improves.\nlong_option(\"debug-il-asm\", debug_il_asm).\nlong_option(\"debug-liveness\", debug_liveness).\nlong_option(\"debug-stack-opt\", debug_stack_opt).\nlong_option(\"debug-make\", debug_make).\nlong_option(\"debug-closure\", debug_closure).\nlong_option(\"debug-trail-usage\", debug_trail_usage).\nlong_option(\"debug-mode-constraints\", debug_mode_constraints).\nlong_option(\"debug-intermodule-analysis\", debug_intermodule_analysis).\nlong_option(\"debug-mm-tabling-analysis\", debug_mm_tabling_analysis).\nlong_option(\"debug-indirect-reuse\", debug_indirect_reuse).\nlong_option(\"debug-type-rep\", debug_type_rep).\n\n% output options (mutually exclusive)\nlong_option(\"generate-source-file-mapping\", generate_source_file_mapping).\nlong_option(\"generate-dependency-file\", generate_dependency_file).\nlong_option(\"generate-dependencies\", generate_dependencies).\nlong_option(\"generate-module-order\", generate_module_order).\nlong_option(\"generate-standalone-interface\", generate_standalone_interface).\nlong_option(\"make-short-interface\", make_short_interface).\nlong_option(\"make-short-int\", make_short_interface).\nlong_option(\"make-interface\", make_interface).\nlong_option(\"make-int\", make_interface).\nlong_option(\"make-private-interface\", make_private_interface).\nlong_option(\"make-priv-int\", make_private_interface).\nlong_option(\"make-optimization-interface\", make_optimization_interface).\nlong_option(\"make-optimisation-interface\", make_optimization_interface).\nlong_option(\"make-opt-int\", make_optimization_interface).\nlong_option(\"make-transitive-optimization-interface\",\n make_transitive_opt_interface).\nlong_option(\"make-transitive-optimisation-interface\",\n make_transitive_opt_interface).\nlong_option(\"make-trans-opt\", make_transitive_opt_interface).\nlong_option(\"make-analysis-registry\", make_analysis_registry).\nlong_option(\"make-xml-doc\", make_xml_documentation).\nlong_option(\"make-xml-documentation\", make_xml_documentation).\nlong_option(\"convert-to-mercury\", convert_to_mercury).\nlong_option(\"convert-to-Mercury\", convert_to_mercury).\nlong_option(\"pretty-print\", convert_to_mercury).\nlong_option(\"typecheck-only\", typecheck_only).\nlong_option(\"errorcheck-only\", errorcheck_only).\nlong_option(\"target-code-only\", target_code_only).\nlong_option(\"compile-only\", compile_only).\nlong_option(\"compile-to-shared-lib\", compile_to_shared_lib).\nlong_option(\"output-grade-string\", output_grade_string).\nlong_option(\"output-link-command\", output_link_command).\nlong_option(\"output-shared-lib-link-command\", output_shared_lib_link_command).\nlong_option(\"output-libgrades\", output_libgrades).\nlong_option(\"output-cc\", output_cc).\nlong_option(\"output-cc-type\", output_c_compiler_type).\nlong_option(\"output-c-compiler-type\", output_c_compiler_type).\nlong_option(\"output-csharp-compiler-type\", output_csharp_compiler_type).\nlong_option(\"output-cflags\", output_cflags).\nlong_option(\"output-library-link-flags\", output_library_link_flags).\nlong_option(\"output-grade-defines\", output_grade_defines).\nlong_option(\"output-c-include-directory-flags\",\n output_c_include_directory_flags).\nlong_option(\"output-c-include-dir-flags\",\n output_c_include_directory_flags).\n\n% aux output options\nlong_option(\"smart-recompilation\", smart_recompilation).\nlong_option(\"assume-gmake\", assume_gmake).\nlong_option(\"generate-mmc-make-module-dependencies\",\n generate_mmc_make_module_dependencies).\nlong_option(\"generate-mmc-deps\", generate_mmc_make_module_dependencies).\nlong_option(\"ssdb-trace\", ssdb_trace_level).\nlong_option(\"link-ssdb-libs\", link_ssdb_libs).\nlong_option(\"link-ssdebug-libs\", link_ssdb_libs).\nlong_option(\"trace\", trace_level).\nlong_option(\"trace-optimised\", trace_optimized).\nlong_option(\"trace-optimized\", trace_optimized).\nlong_option(\"trace-prof\", trace_prof).\nlong_option(\"trace-table-io\", trace_table_io).\nlong_option(\"trace-table-io-only-retry\", trace_table_io_only_retry).\nlong_option(\"trace-table-io-states\", trace_table_io_states).\nlong_option(\"trace-table-io-require\", trace_table_io_require).\nlong_option(\"trace-table-io-all\", trace_table_io_all).\nlong_option(\"trace-flag\", trace_goal_flags).\nlong_option(\"profile-optimised\", prof_optimized).\nlong_option(\"profile-optimized\", prof_optimized).\nlong_option(\"exec-trace-tail-rec\", exec_trace_tail_rec).\nlong_option(\"suppress-trace\", suppress_trace).\nlong_option(\"force-disable-tracing\", force_disable_tracing).\nlong_option(\"delay-death\", delay_death).\nlong_option(\"delay-death-max-vars\", delay_death_max_vars).\nlong_option(\"stack-trace-higher-order\", stack_trace_higher_order).\nlong_option(\"force-disable-ssdebug\", force_disable_ssdebug).\nlong_option(\"generate-bytecode\", generate_bytecode).\nlong_option(\"line-numbers\", line_numbers).\nlong_option(\"auto-comments\", auto_comments).\nlong_option(\"frameopt-comments\", frameopt_comments).\nlong_option(\"max-error-line-width\", max_error_line_width).\nlong_option(\"show-dependency-graph\", show_dependency_graph).\nlong_option(\"imports-graph\", imports_graph).\nlong_option(\"dump-trace-counts\", dump_trace_counts).\nlong_option(\"dump-hlds\", dump_hlds).\nlong_option(\"hlds-dump\", dump_hlds).\nlong_option(\"dump-hlds-pred-id\", dump_hlds_pred_id).\nlong_option(\"dump-hlds-pred-name\", dump_hlds_pred_name).\nlong_option(\"dump-hlds-alias\", dump_hlds_alias).\nlong_option(\"dump-hlds-options\", dump_hlds_options).\nlong_option(\"dump-hlds-inst-limit\", dump_hlds_inst_limit).\nlong_option(\"dump-hlds-file-suffix\", dump_hlds_file_suffix).\nlong_option(\"dump-same-hlds\", dump_same_hlds).\nlong_option(\"dump-mlds\", dump_mlds).\nlong_option(\"mlds-dump\", dump_mlds).\nlong_option(\"verbose-dump-mlds\", verbose_dump_mlds).\nlong_option(\"verbose-mlds-dump\", verbose_dump_mlds).\nlong_option(\"sign-assembly\", sign_assembly).\nlong_option(\"separate-assemblies\", separate_assemblies).\nlong_option(\"mode-constraints\", mode_constraints).\nlong_option(\"simple-mode-constraints\", simple_mode_constraints).\nlong_option(\"prop-mode-constraints\", prop_mode_constraints).\nlong_option(\"propagate-mode-constraints\", prop_mode_constraints).\nlong_option(\"benchmark-modes\", benchmark_modes).\nlong_option(\"benchmark-modes-repeat\", benchmark_modes_repeat).\n\n% language semantics options\nlong_option(\"reorder-conj\", reorder_conj).\nlong_option(\"reorder-disj\", reorder_disj).\nlong_option(\"fully-strict\", fully_strict).\nlong_option(\"strict-sequential\", strict_sequential).\nlong_option(\"allow-stubs\", allow_stubs).\nlong_option(\"infer-all\", infer_all).\nlong_option(\"infer-types\", infer_types).\nlong_option(\"infer-modes\", infer_modes).\nlong_option(\"infer-determinism\", infer_det).\nlong_option(\"infer-det\", infer_det).\nlong_option(\"type-inference-iteration-limit\", type_inference_iteration_limit).\nlong_option(\"mode-inference-iteration-limit\", mode_inference_iteration_limit).\nlong_option(\"event-set-file-name\", event_set_file_name).\n\n% compilation model options\nlong_option(\"grade\", grade).\n% target selection options\nlong_option(\"target\", target).\nlong_option(\"il\", il).\nlong_option(\"il-only\", il_only).\nlong_option(\"IL-only\", il_only).\nlong_option(\"compile-to-c\", compile_to_c).\nlong_option(\"compile-to-C\", compile_to_c).\nlong_option(\"java\", java).\nlong_option(\"Java\", java).\nlong_option(\"java-only\", java_only).\nlong_option(\"Java-only\", java_only).\nlong_option(\"csharp\", csharp).\nlong_option(\"C#\", csharp).\nlong_option(\"csharp-only\", csharp_only).\nlong_option(\"C#-only\", csharp_only).\nlong_option(\"x86_64\", x86_64).\nlong_option(\"x86-64\", x86_64).\nlong_option(\"x86_64-only\", x86_64_only).\nlong_option(\"x86-64-only\", x86_64_only).\nlong_option(\"erlang\", erlang).\nlong_option(\"Erlang\", erlang).\nlong_option(\"erlang-only\", erlang_only).\nlong_option(\"Erlang-only\", erlang_only).\n% Optional features compilation model options:\n% (a) debugging\nlong_option(\"debug\", exec_trace).\nlong_option(\"decl-debug\", decl_debug).\nlong_option(\"ssdb\", source_to_source_debug).\nlong_option(\"ss-debug\", source_to_source_debug).\nlong_option(\"source-to-source-debug\", source_to_source_debug).\n % (b) profiling\nlong_option(\"profiling\", profiling).\nlong_option(\"time-profiling\", time_profiling).\nlong_option(\"memory-profiling\", memory_profiling).\nlong_option(\"deep-profiling\", deep_profiling).\nlong_option(\"profile-calls\", profile_calls).\nlong_option(\"profile-time\", profile_time).\nlong_option(\"profile-memory\", profile_memory).\nlong_option(\"profile-deep\", profile_deep).\nlong_option(\"use-activation-counts\", use_activation_counts).\nlong_option(\"pre-prof-transforms-simplify\", pre_prof_transforms_simplify).\nlong_option(\"pre-implicit-parallelism-simplify\",\n pre_implicit_parallelism_simplify).\nlong_option(\"coverage-profiling\",\n coverage_profiling).\nlong_option(\"coverage-profiling-via-calls\",\n coverage_profiling_via_calls).\nlong_option(\"coverage-profiling-static\",\n coverage_profiling_static).\nlong_option(\"profile-deep-coverage-after-goal\",\n profile_deep_coverage_after_goal).\nlong_option(\"profile-deep-coverage-branch-ite\",\n profile_deep_coverage_branch_ite).\nlong_option(\"profile-deep-coverage-branch-switch\",\n profile_deep_coverage_branch_switch).\nlong_option(\"profile-deep-coverage-branch-disj\",\n profile_deep_coverage_branch_disj).\nlong_option(\"profile-deep-coverage-use-portcounts\",\n profile_deep_coverage_use_portcounts).\nlong_option(\"profile-deep-coverage-use-trivial\",\n profile_deep_coverage_use_trivial).\nlong_option(\"profile-for-implicit-parallelism\",\n profile_for_feedback).\nlong_option(\"profile-for-feedback\",\n profile_for_feedback).\nlong_option(\"use-zeroing-for-ho-cycles\",\n use_zeroing_for_ho_cycles).\nlong_option(\"use-lots-of-ho-specialization\",\n use_lots_of_ho_specialization).\nlong_option(\"deep-profile-tail-recursion\",\n deep_profile_tail_recursion).\nlong_option(\"record-term-sizes-as-words\", record_term_sizes_as_words).\nlong_option(\"record-term-sizes-as-cells\", record_term_sizes_as_cells).\nlong_option(\"experimental-complexity\", experimental_complexity).\nlong_option(\"region-analysis\", region_analysis).\n% (c) miscellaneous optional features\nlong_option(\"gc\", gc).\nlong_option(\"garbage-collection\", gc).\nlong_option(\"parallel\", parallel).\nlong_option(\"use-trail\", use_trail).\nlong_option(\"trail-segments\", trail_segments).\nlong_option(\"type-layout\", type_layout).\nlong_option(\"maybe-thread-safe\", maybe_thread_safe_opt).\nlong_option(\"extend-stacks-when-needed\", extend_stacks_when_needed).\nlong_option(\"stack-segments\", stack_segments).\nlong_option(\"use-regions\", use_regions).\nlong_option(\"use-alloc-regions\", use_alloc_regions).\nlong_option(\"use-regions-debug\", use_regions_debug).\nlong_option(\"use-regions-profiling\",use_regions_profiling).\n% Data representation options\nlong_option(\"use-minimal-model-stack-copy\", use_minimal_model_stack_copy).\nlong_option(\"use-minimal-model-own-stacks\", use_minimal_model_own_stacks).\nlong_option(\"minimal-model-debug\", minimal_model_debug).\nlong_option(\"single-prec-float\", single_prec_float).\nlong_option(\"single-precision-float\", single_prec_float).\nlong_option(\"pic-reg\", pic_reg).\nlong_option(\"tags\", tags).\nlong_option(\"num-tag-bits\", num_tag_bits).\nlong_option(\"num-reserved-addresses\", num_reserved_addresses).\nlong_option(\"num-reserved-objects\", num_reserved_objects).\nlong_option(\"bits-per-word\", bits_per_word).\nlong_option(\"bytes-per-word\", bytes_per_word).\nlong_option(\"conf-low-tag-bits\", conf_low_tag_bits).\nlong_option(\"sync-term-size\", sync_term_size).\nlong_option(\"unboxed-float\", unboxed_float).\nlong_option(\"unboxed-enums\", unboxed_enums).\nlong_option(\"unboxed-no-tag-types\", unboxed_no_tag_types).\nlong_option(\"highlevel-data\", highlevel_data).\nlong_option(\"high-level-data\", highlevel_data).\n% LLDS back-end compilation model options\nlong_option(\"gcc-non-local-gotos\", gcc_non_local_gotos).\nlong_option(\"gcc-global-registers\", gcc_global_registers).\nlong_option(\"asm-labels\", asm_labels).\nlong_option(\"use-float-registers\", use_float_registers).\n% MLDS back-end compilation model options\nlong_option(\"highlevel-code\", highlevel_code).\nlong_option(\"high-level-code\", highlevel_code).\nlong_option(\"highlevel-C\", highlevel_code).\nlong_option(\"highlevel-c\", highlevel_code).\nlong_option(\"high-level-C\", highlevel_code).\nlong_option(\"high-level-c\", highlevel_code).\nlong_option(\"gcc-nested-functions\", gcc_nested_functions).\nlong_option(\"det-copy-out\", det_copy_out).\nlong_option(\"nondet-copy-out\", nondet_copy_out).\nlong_option(\"put-commit-in-own-func\", put_commit_in_own_func).\nlong_option(\"put-nondet-env-on-heap\", put_nondet_env_on_heap).\n% IL back-end compilation model options\nlong_option(\"verifiable-code\", verifiable_code).\nlong_option(\"verifiable\", verifiable_code).\nlong_option(\"il-funcptr-types\", il_funcptr_types).\nlong_option(\"IL-funcptr-types\", il_funcptr_types).\nlong_option(\"il-refany-fields\", il_refany_fields).\nlong_option(\"IL-refany-fields\", il_refany_fields).\nlong_option(\"il-byref-tailcalls\", il_byref_tailcalls).\nlong_option(\"IL-byref-tailcalls\", il_byref_tailcalls).\n\n% internal use options\nlong_option(\"backend-foreign-languages\", backend_foreign_languages).\nlong_option(\"agc-stack-layout\", agc_stack_layout).\nlong_option(\"basic-stack-layout\", basic_stack_layout).\nlong_option(\"procid-stack-layout\", procid_stack_layout).\nlong_option(\"trace-stack-layout\", trace_stack_layout).\nlong_option(\"body-typeinfo-liveness\", body_typeinfo_liveness).\nlong_option(\"can-compare-constants-as-ints\", can_compare_constants_as_ints).\nlong_option(\"pretest-equality-cast-pointers\", pretest_equality_cast_pointers).\nlong_option(\"can-compare-compound-values\", can_compare_compound_values).\nlong_option(\"lexically-order-constructors\",\n lexically_order_constructors).\nlong_option(\"mutable-always-boxed\", mutable_always_boxed).\nlong_option(\"delay-partial-instantiations\", delay_partial_instantiations).\nlong_option(\"allow-defn-of-builtins\", allow_defn_of_builtins).\nlong_option(\"special-preds\", special_preds).\nlong_option(\"type-ctor-info\", type_ctor_info).\nlong_option(\"type-ctor-layout\", type_ctor_layout).\nlong_option(\"type-ctor-functors\", type_ctor_functors).\nlong_option(\"new-type-class-rtti\", new_type_class_rtti).\nlong_option(\"rtti-line-numbers\", rtti_line_numbers).\nlong_option(\"disable-mm-pneg\", disable_minimal_model_stack_copy_pneg).\nlong_option(\"disable-mm-cut\", disable_minimal_model_stack_copy_cut).\nlong_option(\"disable-trail-ops\", disable_trail_ops).\nlong_option(\"size-region-ite-fixed\", size_region_ite_fixed).\nlong_option(\"size-region-disj-fixed\", size_region_disj_fixed).\nlong_option(\"size-region-commit-fixed\", size_region_commit_fixed).\nlong_option(\"size-region-ite-protect\", size_region_ite_protect).\nlong_option(\"size-region-ite-snapshot\", size_region_ite_snapshot).\nlong_option(\"size-region-semi-disj-protect\", size_region_semi_disj_protect).\nlong_option(\"size-region-disj-snapshot\", size_region_disj_snapshot).\nlong_option(\"size-region-commit-entry\", size_region_commit_entry).\nlong_option(\"solver-type-auto-init\", solver_type_auto_init).\nlong_option(\"allow-multi-arm-switches\", allow_multi_arm_switches).\nlong_option(\"type-check-constraints\", type_check_constraints).\nlong_option(\"allow-argument-packing\", allow_argument_packing).\n\n% code generation options\nlong_option(\"low-level-debug\", low_level_debug).\nlong_option(\"table-debug\", table_debug).\nlong_option(\"polymorphism\", polymorphism).\nlong_option(\"trad-passes\", trad_passes).\nlong_option(\"parallel-liveness\", parallel_liveness).\nlong_option(\"parallel-code-gen\", parallel_code_gen).\nlong_option(\"reclaim-heap-on-failure\", reclaim_heap_on_failure).\nlong_option(\"reclaim-heap-on-semidet-failure\",\n reclaim_heap_on_semidet_failure).\nlong_option(\"reclaim-heap-on-nondet-failure\",\n reclaim_heap_on_nondet_failure).\nlong_option(\"branch-delay-slot\", have_delay_slot).\nlong_option(\"have-delay-slot\", have_delay_slot).\nlong_option(\"num-real-r-regs\", num_real_r_regs).\nlong_option(\"num-real-f-regs\", num_real_f_regs).\nlong_option(\"num-real-r-temps\", num_real_r_temps).\nlong_option(\"num-real-f-temps\", num_real_f_temps).\nlong_option(\"num-real-temps\", num_real_r_temps). % obsolete\nlong_option(\"max-jump-table-size\", max_jump_table_size).\n% long_option(\"max-spec-do-call-closure\",\n% max_specialized_do_call_closure).\n% long_option(\"max-spec-do-call-class-method\",\n% max_specialized_do_call_class_method).\nlong_option(\"compare-specialization\", compare_specialization).\nlong_option(\"should-pretest-equality\", should_pretest_equality).\nlong_option(\"fact-table-max-array-size\",fact_table_max_array_size).\nlong_option(\"fact-table-hash-percent-full\",\n fact_table_hash_percent_full).\nlong_option(\"gcc-local-labels\", gcc_local_labels).\nlong_option(\"prefer-switch\", prefer_switch).\nlong_option(\"opt-no-return-calls\", opt_no_return_calls).\n\n% optimization options\n\nlong_option(\"opt-level\", opt_level).\nlong_option(\"optimization-level\", opt_level).\nlong_option(\"optimisation-level\", opt_level).\nlong_option(\"opt-space\", opt_space).\nlong_option(\"optimize-space\", opt_space).\nlong_option(\"optimise-space\", opt_space).\nlong_option(\"intermod-opt\", intermodule_optimization).\nlong_option(\"intermodule-optimization\", intermodule_optimization).\nlong_option(\"intermodule-optimisation\", intermodule_optimization).\nlong_option(\"read-opt-files-transitively\", read_opt_files_transitively).\nlong_option(\"use-opt-files\", use_opt_files).\nlong_option(\"use-trans-opt-files\", use_trans_opt_files).\nlong_option(\"transitive-intermodule-optimization\",\n transitive_optimization).\nlong_option(\"transitive-intermodule-optimisation\",\n transitive_optimization).\nlong_option(\"trans-intermod-opt\", transitive_optimization).\nlong_option(\"intermodule-analysis\", intermodule_analysis).\nlong_option(\"analysis-repeat\", analysis_repeat).\nlong_option(\"analysis-file-cache\", analysis_file_cache).\n\n% HLDS->HLDS optimizations\nlong_option(\"inlining\", inlining).\nlong_option(\"inline-simple\", inline_simple).\nlong_option(\"inline-builtins\", inline_builtins).\nlong_option(\"inline-single-use\", inline_single_use).\nlong_option(\"inline-call-cost\", inline_call_cost).\nlong_option(\"inline-compound-threshold\", inline_compound_threshold).\nlong_option(\"inline-simple-threshold\", inline_simple_threshold).\nlong_option(\"intermod-inline-simple-threshold\",\n intermod_inline_simple_threshold).\nlong_option(\"from-ground-term-threshold\",\n from_ground_term_threshold).\nlong_option(\"inline-vars-threshold\", inline_vars_threshold).\nlong_option(\"const-struct\", enable_const_struct).\nlong_option(\"common-struct\", common_struct).\nlong_option(\"common-struct-preds\", common_struct_preds).\nlong_option(\"common-goal\", common_goal).\nlong_option(\"excess-assign\", excess_assign).\nlong_option(\"optimize-format-calls\", optimize_format_calls).\nlong_option(\"optimize-duplicate-calls\", optimize_duplicate_calls).\nlong_option(\"optimise-duplicate-calls\", optimize_duplicate_calls).\nlong_option(\"optimise-constant-propagation\", constant_propagation).\nlong_option(\"optimize-constant-propagation\", constant_propagation).\nlong_option(\"optimize-saved-vars\", optimize_saved_vars).\nlong_option(\"optimise-saved-vars\", optimize_saved_vars).\nlong_option(\"loop-invariants\", loop_invariants).\nlong_option(\"optimize-saved-vars-const\", optimize_saved_vars_const).\nlong_option(\"optimise-saved-vars-const\", optimize_saved_vars_const).\nlong_option(\"optimize-saved-vars-cell\", optimize_saved_vars_cell).\nlong_option(\"optimise-saved-vars-cell\", optimize_saved_vars_cell).\nlong_option(\"osv-loop\", optimize_saved_vars_cell_loop).\nlong_option(\"osv-full-path\", optimize_saved_vars_cell_full_path).\nlong_option(\"osv-on-stack\", optimize_saved_vars_cell_on_stack).\nlong_option(\"osv-cand-head\",\n optimize_saved_vars_cell_candidate_headvars).\n% The next four options are used by tupling.m as well; changes to them\n% may require changes there as well.\nlong_option(\"osv-cvstore-cost\", optimize_saved_vars_cell_cv_store_cost).\nlong_option(\"osv-cvload-cost\", optimize_saved_vars_cell_cv_load_cost).\nlong_option(\"osv-fvstore-cost\", optimize_saved_vars_cell_fv_store_cost).\nlong_option(\"osv-fvload-cost\", optimize_saved_vars_cell_fv_load_cost).\nlong_option(\"osv-op-ratio\", optimize_saved_vars_cell_op_ratio).\nlong_option(\"osv-node-ratio\", optimize_saved_vars_cell_node_ratio).\nlong_option(\"osv-allpath-node-ratio\",\n optimize_saved_vars_cell_all_path_node_ratio).\nlong_option(\"osv-all-cand\",\n optimize_saved_vars_cell_include_all_candidates).\nlong_option(\"delay-construct\", delay_construct).\nlong_option(\"delay-constructs\", delay_construct).\nlong_option(\"follow-code\", follow_code).\nlong_option(\"constraint-propagation\", constraint_propagation).\nlong_option(\"local-constraint-propagation\", local_constraint_propagation).\nlong_option(\"optimize-unused-args\", optimize_unused_args).\nlong_option(\"optimise-unused-args\", optimize_unused_args).\nlong_option(\"intermod-unused-args\", intermod_unused_args).\nlong_option(\"optimize-higher-order\", optimize_higher_order).\nlong_option(\"optimise-higher-order\", optimize_higher_order).\nlong_option(\"higher-order-size-limit\", higher_order_size_limit).\nlong_option(\"higher-order-arg-limit\", higher_order_arg_limit).\nlong_option(\"unneeded-code\", unneeded_code).\nlong_option(\"unneeded-code-copy-limit\", unneeded_code_copy_limit).\nlong_option(\"unneeded-code-debug\", unneeded_code_debug).\nlong_option(\"unneeded-code-debug-pred-name\", unneeded_code_debug_pred_name).\nlong_option(\"type-specialization\", type_specialization).\nlong_option(\"type-specialisation\", type_specialization).\nlong_option(\"user-guided-type-specialization\",\n user_guided_type_specialization).\nlong_option(\"user-guided-type-specialisation\",\n user_guided_type_specialization).\n% This option is for use in configure.in to test for some bug-fixes for\n% type-specialization which are needed to compile the library. It's not\n% documented, and should eventually be removed.\nlong_option(\"fixed-user-guided-type-specialization\",\n user_guided_type_specialization).\nlong_option(\"introduce-accumulators\", introduce_accumulators).\nlong_option(\"optimise-constructor-last-call-accumulator\",\n optimize_constructor_last_call_accumulator).\nlong_option(\"optimize-constructor-last-call-accumulator\",\n optimize_constructor_last_call_accumulator).\nlong_option(\"optimise-constructor-last-call-null\",\n optimize_constructor_last_call_null).\nlong_option(\"optimize-constructor-last-call-null\",\n optimize_constructor_last_call_null).\nlong_option(\"optimise-constructor-last-call\",\n optimize_constructor_last_call).\nlong_option(\"optimize-constructor-last-call\",\n optimize_constructor_last_call).\nlong_option(\"optimize-dead-procs\", optimize_dead_procs).\nlong_option(\"optimise-dead-procs\", optimize_dead_procs).\nlong_option(\"deforestation\", deforestation).\nlong_option(\"deforestation-depth-limit\", deforestation_depth_limit).\nlong_option(\"deforestation-cost-factor\", deforestation_cost_factor).\nlong_option(\"deforestation-vars-threshold\", deforestation_vars_threshold).\nlong_option(\"deforestation-size-threshold\", deforestation_size_threshold).\nlong_option(\"enable-termination\", termination).\nlong_option(\"enable-term\", termination).\nlong_option(\"check-termination\", termination_check).\nlong_option(\"check-term\", termination_check).\nlong_option(\"chk-term\", termination_check).\nlong_option(\"verbose-check-termination\",verbose_check_termination).\nlong_option(\"verb-check-term\", verbose_check_termination).\nlong_option(\"verb-chk-term\", verbose_check_termination).\nlong_option(\"termination-single-argument-analysis\",\n termination_single_args).\nlong_option(\"term-single-arg\", termination_single_args).\nlong_option(\"termination-norm\", termination_norm).\nlong_option(\"term-norm\", termination_norm).\nlong_option(\"termination-error-limit\", termination_error_limit).\nlong_option(\"term-err-limit\", termination_error_limit).\nlong_option(\"termination-path-limit\", termination_path_limit).\nlong_option(\"term-path-limit\", termination_path_limit).\nlong_option(\"enable-termination2\", termination2).\nlong_option(\"enable-term2\", termination2).\nlong_option(\"check-termination2\", check_termination2).\nlong_option(\"check-term2\", check_termination2).\nlong_option(\"chk-term2\", check_termination2).\nlong_option(\"verbose-check-termination2\",verbose_check_termination2).\nlong_option(\"verb-check-term2\", verbose_check_termination2).\nlong_option(\"verb-chk-term2\", verbose_check_termination2).\nlong_option(\"termination2-widening-limit\", widening_limit).\nlong_option(\"term2-widening-limit\", widening_limit).\nlong_option(\"arg-size-analysis-only\", arg_size_analysis_only).\nlong_option(\"termination2-propagate-failure-constraints\",\n propagate_failure_constrs).\nlong_option(\"term2-propagate-failure-constraints\",\n propagate_failure_constrs).\nlong_option(\"term2-propagate-failure-constrs\", propagate_failure_constrs).\nlong_option(\"termination2-norm\", termination2_norm).\nlong_option(\"term2-norm\", termination2_norm).\nlong_option(\"termination2-maximum-matrix-size\", term2_maximum_matrix_size).\nlong_option(\"term2-max-matrix-size\", term2_maximum_matrix_size).\nlong_option(\"analyse-exceptions\", analyse_exceptions).\nlong_option(\"analyse-closures\", analyse_closures).\nlong_option(\"analyse-local-closures\", analyse_closures).\nlong_option(\"analyse-trail-usage\", analyse_trail_usage).\nlong_option(\"optimize-trail-usage\", optimize_trail_usage).\nlong_option(\"optimize-region-ops\", optimize_region_ops).\nlong_option(\"analyse-mm-tabling\", analyse_mm_tabling).\nlong_option(\"untuple\", untuple).\nlong_option(\"tuple\", tuple).\nlong_option(\"tuple-trace-counts-file\", tuple_trace_counts_file).\nlong_option(\"tuple-costs-ratio\", tuple_costs_ratio).\nlong_option(\"tuple-min-args\", tuple_min_args).\nlong_option(\"inline-par-builtins\", inline_par_builtins).\nlong_option(\"always-specialize-in-dep-par-conjs\",\n always_specialize_in_dep_par_conjs).\nlong_option(\"allow-some-paths-only-waits\",\n allow_some_paths_only_waits).\n\n% CTGC related options.\nlong_option(\"structure-sharing\", structure_sharing_analysis).\nlong_option(\"structure-sharing-widening\", structure_sharing_widening).\nlong_option(\"structure-reuse\", structure_reuse_analysis).\nlong_option(\"ctgc\", structure_reuse_analysis).\nlong_option(\"structure-reuse-constraint\", structure_reuse_constraint).\nlong_option(\"ctgc-constraint\", structure_reuse_constraint).\nlong_option(\"structure-reuse-constraint-arg\", structure_reuse_constraint_arg).\nlong_option(\"ctgc-constraint-arg\", structure_reuse_constraint_arg).\nlong_option(\"structure-reuse-max-conditions\", structure_reuse_max_conditions).\nlong_option(\"structure-reuse-repeat\", structure_reuse_repeat).\nlong_option(\"structure-reuse-free-cells\", structure_reuse_free_cells).\n\n% HLDS->LLDS optimizations\nlong_option(\"smart-indexing\", smart_indexing).\nlong_option(\"dense-switch-req-density\", dense_switch_req_density).\nlong_option(\"lookup-switch-req-density\",lookup_switch_req_density).\nlong_option(\"dense-switch-size\", dense_switch_size).\nlong_option(\"lookup-switch-size\", lookup_switch_size).\nlong_option(\"string-switch-size\", string_hash_switch_size).\nlong_option(\"string-hash-switch-size\", string_hash_switch_size).\nlong_option(\"string-binary-switch-size\", string_binary_switch_size).\nlong_option(\"tag-switch-size\", tag_switch_size).\nlong_option(\"try-switch-size\", try_switch_size).\nlong_option(\"binary-switch-size\", binary_switch_size).\nlong_option(\"switch-single-rec-base-first\", switch_single_rec_base_first).\nlong_option(\"switch-multi-rec-base-first\", switch_multi_rec_base_first).\nlong_option(\"static-ground-terms\", static_ground_cells).\n% static_ground_floats should be set only in handle_options.m.\n% long_option(\"static-ground-floats\", static_ground_floats).\n% static_code_addresses should be set only in handle_options.m.\n% long_option(\"static-code-addresses\", static_code_addresses).\nlong_option(\"use-atomic-cells\", use_atomic_cells).\nlong_option(\"middle-rec\", middle_rec).\nlong_option(\"simple-neg\", simple_neg).\nlong_option(\"allow-hijacks\", allow_hijacks).\n\n% MLDS optimizations\n% Option `optimize' is used for both MLDS and LLDS optimizations, but since\n% you can't use both at the same time it doesn't really matter.\nlong_option(\"mlds-optimize\", optimize).\nlong_option(\"mlds-optimise\", optimize).\nlong_option(\"mlds-peephole\", optimize_peep).\nlong_option(\"optimize-tailcalls\", optimize_tailcalls).\nlong_option(\"optimise-tailcalls\", optimize_tailcalls).\nlong_option(\"optimize-initializations\", optimize_initializations).\nlong_option(\"optimise-initializations\", optimize_initializations).\nlong_option(\"eliminate-local-vars\", eliminate_local_vars).\nlong_option(\"generate-trail-ops-inline\", generate_trail_ops_inline).\n\n% LLDS optimizations\nlong_option(\"common-data\", common_data).\nlong_option(\"common-layout-data\", common_layout_data).\nlong_option(\"llds-optimize\", optimize).\nlong_option(\"llds-optimise\", optimize).\nlong_option(\"optimize-peep\", optimize_peep).\nlong_option(\"optimise-peep\", optimize_peep).\nlong_option(\"optimize-peep-mkword\", optimize_peep_mkword).\nlong_option(\"optimise-peep-mkword\", optimize_peep_mkword).\nlong_option(\"optimize-jumps\", optimize_jumps).\nlong_option(\"optimise-jumps\", optimize_jumps).\nlong_option(\"optimize-fulljumps\", optimize_fulljumps).\nlong_option(\"optimise-fulljumps\", optimize_fulljumps).\nlong_option(\"pessimize-tailcalls\", pessimize_tailcalls).\nlong_option(\"checked-nondet-tailcalls\", checked_nondet_tailcalls).\nlong_option(\"use-local-vars\", use_local_vars).\nlong_option(\"local-var-access-threshold\", local_var_access_threshold).\nlong_option(\"standardise-labels\", standardize_labels).\nlong_option(\"standardize-labels\", standardize_labels).\nlong_option(\"optimize-labels\", optimize_labels).\nlong_option(\"optimise-labels\", optimize_labels).\nlong_option(\"optimize-dups\", optimize_dups).\nlong_option(\"optimise-dups\", optimize_dups).\nlong_option(\"optimize-proc-dups\", optimize_proc_dups).\nlong_option(\"optimise-proc-dups\", optimize_proc_dups).\n%%% long_option(\"optimize-copyprop\", optimize_copyprop).\n%%% long_option(\"optimise-copyprop\", optimize_copyprop).\nlong_option(\"optimize-frames\", optimize_frames).\nlong_option(\"optimise-frames\", optimize_frames).\nlong_option(\"optimize-delay-slot\", optimize_delay_slot).\nlong_option(\"optimise-delay-slot\", optimize_delay_slot).\nlong_option(\"optimize-reassign\", optimize_reassign).\nlong_option(\"optimise-reassign\", optimize_reassign).\nlong_option(\"optimize-repeat\", optimize_repeat).\nlong_option(\"optimise-repeat\", optimize_repeat).\nlong_option(\"layout-compression-limit\", layout_compression_limit).\n\n% LLDS->C optimizations\nlong_option(\"use-macro-for-redo-fail\", use_macro_for_redo_fail).\nlong_option(\"emit-c-loops\", emit_c_loops).\nlong_option(\"procs-per-c-function\", procs_per_c_function).\nlong_option(\"procs-per-C-function\", procs_per_c_function).\nlong_option(\"everything-in-one-c-function\", everything_in_one_c_function).\nlong_option(\"everything-in-one-C-function\", everything_in_one_c_function).\nlong_option(\"inline-alloc\", inline_alloc).\nlong_option(\"local-thread-engine-base\", local_thread_engine_base).\n\n% Erlang\nlong_option(\"erlang-switch-on-strings-as-atoms\",\n erlang_switch_on_strings_as_atoms).\n\n% Target code compilation options\nlong_option(\"target-debug\", target_debug).\n\nlong_option(\"cc\", cc).\nlong_option(\"c-optimise\", c_optimize).\nlong_option(\"c-optimize\", c_optimize).\n% XXX we should consider the relationship between c_debug and target_debug\n% more carefully. Perhaps target_debug could imply C debug if the target is C.\n% However for the moment they are just synonyms.\nlong_option(\"c-debug\", target_debug).\nlong_option(\"c-include-directory\", c_include_directory).\nlong_option(\"c-include-dir\", c_include_directory).\nlong_option(\"ansi-c\", ansi_c).\nlong_option(\"cflags\", cflags).\nlong_option(\"cflag\", quoted_cflag).\n\nlong_option(\"gcc-flags\", gcc_flags).\nlong_option(\"gcc-flag\", quoted_gcc_flag).\nlong_option(\"clang-flags\", clang_flags).\nlong_option(\"clang-flag\", quoted_clang_flag).\nlong_option(\"msvc-flags\", msvc_flags).\nlong_option(\"msvc-flag\", quoted_msvc_flag).\n\nlong_option(\"cflags-for-warnings\", cflags_for_warnings).\nlong_option(\"cflags-for-optimization\", cflags_for_optimization).\nlong_option(\"cflags-for-ansi\", cflags_for_ansi).\nlong_option(\"cflags-for-regs\", cflags_for_regs).\nlong_option(\"cflags-for-gotos\", cflags_for_gotos).\nlong_option(\"cflags-for-threads\", cflags_for_threads).\nlong_option(\"cflags-for-debug\", cflags_for_debug).\nlong_option(\"cflags-for-pic\", cflags_for_pic).\nlong_option(\"c-flag-to-name-object-file\", c_flag_to_name_object_file).\nlong_option(\"object-file-extension\", object_file_extension).\nlong_option(\"pic-object-file-extension\", pic_object_file_extension).\nlong_option(\"link-with-pic-object-file-extension\",\n link_with_pic_object_file_extension).\nlong_option(\"c-compiler-type\", c_compiler_type).\nlong_option(\"csharp-compiler-type\", csharp_compiler_type).\n\n\nlong_option(\"java-compiler\", java_compiler).\nlong_option(\"javac\", java_compiler).\nlong_option(\"java-interpreter\", java_interpreter).\nlong_option(\"java-flags\", java_flags).\nlong_option(\"java-flag\", quoted_java_flag).\n% XXX we should consider the relationship between java_debug and target_debug\n% more carefully. Perhaps target_debug could imply Java debug if the target\n% is Java. However for the moment they are just synonyms.\nlong_option(\"java-debug\", target_debug).\nlong_option(\"java-classpath\", java_classpath).\nlong_option(\"java-object-file-extension\", java_object_file_extension).\n\nlong_option(\"il-assembler\", il_assembler).\nlong_option(\"ilasm-flags\", ilasm_flags).\nlong_option(\"ilasm-flag\", quoted_ilasm_flag).\nlong_option(\"dotnet-library-version\", dotnet_library_version).\nlong_option(\"support-ms-clr\", support_ms_clr).\nlong_option(\"support-rotor-clr\", support_rotor_clr).\n\nlong_option(\"csharp-compiler\", csharp_compiler).\nlong_option(\"csharp-flags\", csharp_flags).\nlong_option(\"csharp-flag\", quoted_csharp_flag).\nlong_option(\"cli-interpreter\", cli_interpreter).\n\nlong_option(\"erlang-compiler\", erlang_compiler).\nlong_option(\"erlang-interpreter\", erlang_interpreter).\nlong_option(\"erlang-flags\", erlang_flags).\nlong_option(\"erlang-flag\", quoted_erlang_flag).\nlong_option(\"erlang-include-directory\", erlang_include_directory).\nlong_option(\"erlang-include-dir\", erlang_include_directory).\nlong_option(\"erlang-object-file-extension\", erlang_object_file_extension).\nlong_option(\"erlang-native-code\", erlang_native_code).\nlong_option(\"erlang-inhibit-trivial-warnings\",\n erlang_inhibit_trivial_warnings).\n\n% link options\nlong_option(\"output-file\", output_file_name).\nlong_option(\"ld-flags\", ld_flags).\nlong_option(\"ld-flag\", quoted_ld_flag).\nlong_option(\"ld-libflags\", ld_libflags).\nlong_option(\"ld-libflag\", quoted_ld_libflag).\nlong_option(\"library-directory\", link_library_directories).\nlong_option(\"runtime-library-directory\", runtime_link_library_directories).\nlong_option(\"library\", link_libraries).\nlong_option(\"link-object\", link_objects).\nlong_option(\"mercury-library\", mercury_library_special).\nlong_option(\"ml\", mercury_library_special).\nlong_option(\"mercury-library-directory\", mercury_library_directory_special).\nlong_option(\"mld\", mercury_library_directory_special).\nlong_option(\"search-library-files-directory\",\n search_library_files_directory_special).\nlong_option(\"search-lib-files-dir\",\n search_library_files_directory_special).\nlong_option(\"mercury-standard-library-directory\",\n mercury_standard_library_directory_special).\nlong_option(\"mercury-stdlib-dir\",\n mercury_standard_library_directory_special).\nlong_option(\"init-file-directory\", init_file_directories).\nlong_option(\"init-file\", init_files).\nlong_option(\"trace-init-file\", trace_init_files).\nlong_option(\"linkage\", linkage_special).\nlong_option(\"mercury-linkage\", mercury_linkage_special).\nlong_option(\"demangle\", demangle).\nlong_option(\"strip\", strip).\nlong_option(\"main\", main).\nlong_option(\"allow-undefined\", allow_undefined).\nlong_option(\"use-readline\", use_readline).\nlong_option(\"runtime-flags\", runtime_flags).\nlong_option(\"extra-initialization-functions\",\n extra_initialization_functions).\nlong_option(\"extra-inits\", extra_initialization_functions).\nlong_option(\"framework\", frameworks).\nlong_option(\"framework-directory\", framework_directories).\n\nlong_option(\"shared-library-extension\", shared_library_extension).\nlong_option(\"library-extension\", library_extension).\nlong_option(\"executable-file-extension\", executable_file_extension).\nlong_option(\"create-archive-command\", create_archive_command).\nlong_option(\"create-archive-command-output-flag\",\n create_archive_command_output_flag).\nlong_option(\"create-archive-command-flags\", create_archive_command_flags).\nlong_option(\"link-executable-command\", link_executable_command).\nlong_option(\"link-shared-lib-command\", link_shared_lib_command).\nlong_option(\"ranlib-command\", ranlib_command).\nlong_option(\"ranlib-flags\", ranlib_flags).\nlong_option(\"mkinit-command\", mkinit_command).\nlong_option(\"mkinit-erl-command\", mkinit_erl_command).\nlong_option(\"demangle-command\", demangle_command).\nlong_option(\"filtercc-command\", filtercc_command).\nlong_option(\"trace-libs\", trace_libs).\nlong_option(\"thread-libs\", thread_libs).\nlong_option(\"hwloc-libs\", hwloc_libs).\nlong_option(\"hwloc-static-libs\", hwloc_static_libs).\nlong_option(\"shared-libs\", shared_libs).\nlong_option(\"math-lib\", math_lib).\nlong_option(\"readline-libs\", readline_libs).\nlong_option(\"linker-opt-separator\", linker_opt_separator).\nlong_option(\"linker-debug-flags\", linker_debug_flags).\nlong_option(\"shlib-linker-debug-flags\", shlib_linker_debug_flags).\nlong_option(\"linker-trace-flags\", linker_trace_flags).\nlong_option(\"shlib-linker-trace-flags\", shlib_linker_trace_flags).\nlong_option(\"linker-thread-flags\", linker_thread_flags).\nlong_option(\"shlib-linker-thread-flags\", shlib_linker_thread_flags).\nlong_option(\"linker-static-flags\", linker_static_flags).\nlong_option(\"linker-strip-flag\", linker_strip_flag).\nlong_option(\"linker-link-lib-flag\", linker_link_lib_flag).\nlong_option(\"linker-link-lib-suffix\", linker_link_lib_suffix).\nlong_option(\"shlib-linker-link-lib-flag\", shlib_linker_link_lib_flag).\nlong_option(\"shlib-linker-link-lib-suffix\", shlib_linker_link_lib_suffix).\nlong_option(\"linker-path-flag\", linker_path_flag).\nlong_option(\"linker-rpath-flag\", linker_rpath_flag).\nlong_option(\"linker-rpath-separator\", linker_rpath_separator).\nlong_option(\"shlib-linker-rpath-flag\", shlib_linker_rpath_flag).\nlong_option(\"shlib-linker-rpath-separator\", shlib_linker_rpath_separator).\nlong_option(\"linker-allow-undefined-flag\", linker_allow_undefined_flag).\nlong_option(\"linker-error-undefined-flag\", linker_error_undefined_flag).\nlong_option(\"shlib-linker-use-install-name\", shlib_linker_use_install_name).\nlong_option(\"shlib-linker-install-name-flag\", shlib_linker_install_name_flag).\nlong_option(\"shlib-linker-install-name-path\", shlib_linker_install_name_path).\nlong_option(\"java-archive-command\", java_archive_command).\n\n% build system options\nlong_option(\"make\", make).\nlong_option(\"keep-going\", keep_going).\nlong_option(\"rebuild\", rebuild).\nlong_option(\"jobs\", jobs).\nlong_option(\"track-flags\", track_flags).\nlong_option(\"track-options\", track_flags).\nlong_option(\"invoked-by-mmc-make\", invoked_by_mmc_make).\nlong_option(\"pre-link-command\", pre_link_command).\nlong_option(\"extra-init-command\", extra_init_command).\nlong_option(\"mercury-configuration-directory\",\n mercury_configuration_directory_special).\nlong_option(\"mercury-config-dir\",\n mercury_configuration_directory_special).\nlong_option(\"install-prefix\", install_prefix).\nlong_option(\"install-command\", install_command).\nlong_option(\"install-command-dir-option\", install_command_dir_option).\nlong_option(\"use-symlinks\", use_symlinks).\nlong_option(\"library-grade\", libgrades).\nlong_option(\"libgrade\", libgrades).\nlong_option(\"libgrades-include-component\", libgrades_include_components).\nlong_option(\"libgrades-include\", libgrades_include_components).\nlong_option(\"libgrades-exclude-component\", libgrades_exclude_components).\nlong_option(\"libgrades-exclude\", libgrades_exclude_components).\nlong_option(\"library-linkage\", lib_linkages).\nlong_option(\"lib-linkage\", lib_linkages).\nlong_option(\"flags\", flags_file).\nlong_option(\"flags-file\", flags_file).\nlong_option(\"options-file\", options_files).\nlong_option(\"config-file\", config_file).\nlong_option(\"options-search-directory\", options_search_directories).\nlong_option(\"use-subdirs\", use_subdirs).\nlong_option(\"use-grade-subdirs\", use_grade_subdirs).\nlong_option(\"search-directory\", search_directories).\nlong_option(\"intermod-directory\", intermod_directories).\nlong_option(\"use-search-directories-for-intermod\",\n use_search_directories_for_intermod).\nlong_option(\"libgrade-install-check\", libgrade_install_check).\nlong_option(\"order-make-by-timestamp\", order_make_by_timestamp).\nlong_option(\"show-make-times\", show_make_times).\nlong_option(\"extra-lib-header\", extra_library_header).\nlong_option(\"extra-library-header\", extra_library_header).\nlong_option(\"restricted-command-line\", restricted_command_line).\nlong_option(\"env-type\", env_type).\nlong_option(\"host-env-type\", host_env_type).\nlong_option(\"target-env-type\", target_env_type).\n\n% misc options\nlong_option(\"typecheck-ambiguity-warn-limit\",\n typecheck_ambiguity_warn_limit).\nlong_option(\"typecheck-ambiguity-error-limit\",\n typecheck_ambiguity_error_limit).\nlong_option(\"help\", help).\nlong_option(\"version\", version).\nlong_option(\"filenames-from-stdin\", filenames_from_stdin).\nlong_option(\"fullarch\", fullarch).\nlong_option(\"cross-compiling\", cross_compiling).\nlong_option(\"local-module-id\", local_module_id).\nlong_option(\"analysis-file-cache-dir\", analysis_file_cache_dir).\nlong_option(\"bug-intermod-2002-06-13\", compiler_sufficiently_recent).\nlong_option(\"bug-intermod-2006-09-28\", compiler_sufficiently_recent).\nlong_option(\"bug-foreign_import-2002-08-06\", compiler_sufficiently_recent).\nlong_option(\"install-opt-files-2002-08-30\", compiler_sufficiently_recent).\nlong_option(\"read-config-file-2003-03-01\", compiler_sufficiently_recent).\n% XXX this option won't be recognised because of the \"no-\" prefix,\n% but \"no-no-\" will be recognised.\nlong_option(\"no-noncompact-ho-call-2004-01-15\", compiler_sufficiently_recent).\nlong_option(\"trace-io-builtins-2006-08-14\", compiler_sufficiently_recent).\nlong_option(\"compound-compare-builtins-2007-07-09\",\n compiler_sufficiently_recent).\n% XXX this option won't be recognised because of the \"no-\" prefix,\n% but \"no-no-\" will be recognised.\nlong_option(\"no-det-warning-compound-compare-2007-07-17\",\n compiler_sufficiently_recent).\nlong_option(\"foreign-enum-switch-fix\",\n compiler_sufficiently_recent).\nlong_option(\"failing-disjunct-in-switch-dup-fix\",\n compiler_sufficiently_recent).\nlong_option(\"store-at-ref-impure-2008-09-11\",\n compiler_sufficiently_recent).\nlong_option(\"java-export-ref-out\", compiler_sufficiently_recent).\nlong_option(\"java-generics-2010-04-13\",\n compiler_sufficiently_recent).\nlong_option(\"experiment\", experiment).\nlong_option(\"ignore-par-conjunctions\",\n ignore_par_conjunctions).\nlong_option(\"control-granularity\", control_granularity).\nlong_option(\"distance-granularity\", distance_granularity).\nlong_option(\"implicit-parallelism\", implicit_parallelism).\nlong_option(\"feedback-file\", feedback_file).\nlong_option(\"par-loop-control\", par_loop_control).\nlong_option(\"par-loop-control-preserve-tail-recursion\",\n par_loop_control_preserve_tail_recursion).\n\n%-----------------------------------------------------------------------------%\n\nspecial_handler(grade, string(Grade), OptionTable0, Result) :-\n ( convert_grade_option(Grade, OptionTable0, OptionTable) ->\n Result = ok(OptionTable)\n ;\n Result = error(\"invalid grade `\" ++ Grade ++ \"'\")\n ).\nspecial_handler(il, none, !.OptionTable, ok(!:OptionTable)) :-\n map.set(target, string(\"il\"), !OptionTable).\nspecial_handler(il_only, none, !.OptionTable, ok(!:OptionTable)) :-\n map.set(target, string(\"il\"), !OptionTable),\n map.set(target_code_only, bool(yes), !OptionTable).\nspecial_handler(compile_to_c, none, !.OptionTable, ok(!:OptionTable)) :-\n map.set(target, string(\"c\"), !OptionTable),\n map.set(target_code_only, bool(yes), !OptionTable).\nspecial_handler(java, none, !.OptionTable, ok(!:OptionTable)) :-\n map.set(target, string(\"java\"), !OptionTable).\nspecial_handler(java_only, none, !.OptionTable, ok(!:OptionTable)) :-\n map.set(target, string(\"java\"), !OptionTable),\n map.set(target_code_only, bool(yes), !OptionTable).\nspecial_handler(csharp, none, !.OptionTable, ok(!:OptionTable)) :-\n map.set(target, string(\"csharp\"), !OptionTable).\nspecial_handler(csharp_only, none, !.OptionTable, ok(!:OptionTable)) :-\n map.set(target, string(\"csharp\"), !OptionTable),\n map.set(target_code_only, bool(yes), !OptionTable).\nspecial_handler(x86_64, none, !.OptionTable, ok(!:OptionTable)) :-\n map.set(target, string(\"x86_64\"), !OptionTable).\nspecial_handler(x86_64_only, none, !.OptionTable, ok(!:OptionTable)) :-\n map.set(target, string(\"x86_64\"), !OptionTable),\n map.set(target_code_only, bool(yes), !OptionTable).\nspecial_handler(erlang, none, !.OptionTable, ok(!:OptionTable)) :-\n map.set(target, string(\"erlang\"), !OptionTable).\nspecial_handler(erlang_only, none, !.OptionTable, ok(!:OptionTable)) :-\n map.set(target, string(\"erlang\"), !OptionTable),\n map.set(target_code_only, bool(yes), !OptionTable).\nspecial_handler(profiling, bool(Value), !.OptionTable, ok(!:OptionTable)) :-\n map.set(profile_time, bool(Value), !OptionTable),\n map.set(profile_calls, bool(Value), !OptionTable),\n map.set(profile_memory, bool(no), !OptionTable),\n map.set(profile_deep, bool(no), !OptionTable).\nspecial_handler(time_profiling, none, !.OptionTable, ok(!:OptionTable)) :-\n map.set(profile_time, bool(yes), !OptionTable),\n map.set(profile_calls, bool(yes), !OptionTable),\n map.set(profile_memory, bool(no), !OptionTable),\n map.set(profile_deep, bool(no), !OptionTable).\nspecial_handler(memory_profiling, none, !.OptionTable, ok(!:OptionTable)) :-\n map.set(profile_time, bool(no), !OptionTable),\n map.set(profile_calls, bool(yes), !OptionTable),\n map.set(profile_memory, bool(yes), !OptionTable),\n map.set(profile_deep, bool(no), !OptionTable).\nspecial_handler(deep_profiling, none, !.OptionTable, ok(!:OptionTable)) :-\n map.set(profile_time, bool(no), !OptionTable),\n map.set(profile_calls, bool(no), !OptionTable),\n map.set(profile_memory, bool(no), !OptionTable),\n map.set(profile_deep, bool(yes), !OptionTable).\nspecial_handler(inlining, bool(Value), !.OptionTable, ok(!:OptionTable)) :-\n map.set(inline_simple, bool(Value), !OptionTable),\n map.set(inline_builtins, bool(Value), !OptionTable),\n map.set(inline_single_use, bool(Value), !OptionTable),\n (\n Value = yes,\n map.set(inline_compound_threshold, int(10), !OptionTable)\n ;\n Value = no,\n map.set(inline_compound_threshold, int(0), !OptionTable)\n ).\nspecial_handler(everything_in_one_c_function, none, !.OptionTable,\n ok(!:OptionTable)) :-\n map.set(procs_per_c_function, int(0), !OptionTable).\nspecial_handler(reclaim_heap_on_failure, bool(Value), !.OptionTable,\n ok(!:OptionTable)) :-\n map.set(reclaim_heap_on_semidet_failure, bool(Value), !OptionTable),\n map.set(reclaim_heap_on_nondet_failure, bool(Value), !OptionTable).\nspecial_handler(strict_sequential, none, !.OptionTable, ok(!:OptionTable)) :-\n override_options([\n reorder_conj - bool(no),\n reorder_disj - bool(no),\n fully_strict - bool(yes)\n ], !OptionTable).\nspecial_handler(inhibit_warnings, bool(Inhibit), !.OptionTable,\n ok(!:OptionTable)) :-\n bool.not(Inhibit, Enable),\n override_options([\n inhibit_accumulator_warnings - bool(Inhibit),\n warn_singleton_vars - bool(Enable),\n warn_overlapping_scopes - bool(Enable),\n warn_det_decls_too_lax - bool(Enable),\n warn_inferred_erroneous - bool(Enable),\n warn_nothing_exported - bool(Enable),\n warn_interface_imports - bool(Enable),\n warn_missing_opt_files - bool(Enable),\n warn_missing_trans_opt_files - bool(Enable),\n warn_missing_trans_opt_deps - bool(Enable),\n warn_unification_cannot_succeed - bool(Enable),\n warn_simple_code - bool(Enable),\n warn_missing_module_name - bool(Enable),\n warn_wrong_module_name - bool(Enable),\n warn_smart_recompilation - bool(Enable),\n warn_undefined_options_variables - bool(Enable),\n warn_target_code - bool(Enable),\n warn_up_to_date - bool(Enable),\n warn_stubs - bool(Enable),\n warn_dead_procs - bool(Enable),\n warn_table_with_inline - bool(Enable),\n warn_non_term_special_preds - bool(Enable),\n warn_insts_without_matching_type - bool(Enable)\n ], !OptionTable).\nspecial_handler(infer_all, bool(Infer), !.OptionTable, ok(!:OptionTable)) :-\n override_options([\n infer_types - bool(Infer),\n infer_modes - bool(Infer),\n infer_det - bool(Infer)\n ], !OptionTable).\nspecial_handler(opt_space, none, !.OptionTable, ok(!:OptionTable)) :-\n opt_space(OptionSettingsList),\n override_options(OptionSettingsList, !OptionTable).\nspecial_handler(opt_level, int(N0), !.OptionTable, ok(!:OptionTable)) :-\n ( N0 > 6 ->\n N = 6\n ; N0 < -1 ->\n N = -1\n ;\n N = N0\n ),\n map.set(opt_level_number, int(N), !OptionTable),\n set_opt_level(N, !OptionTable).\nspecial_handler(optimize_saved_vars, bool(Optimize),\n !.OptionTable, ok(!:OptionTable)) :-\n map.set(optimize_saved_vars_const, bool(Optimize), !OptionTable),\n map.set(optimize_saved_vars_cell, bool(Optimize), !OptionTable).\nspecial_handler(mercury_library_directory_special, string(Dir),\n !.OptionTable, ok(!:OptionTable)) :-\n !:OptionTable = option_table_add_mercury_library_directory(\n !.OptionTable, Dir).\nspecial_handler(search_library_files_directory_special, string(Dir),\n OptionTable0, ok(OptionTable)) :-\n OptionTable = option_table_add_search_library_files_directory(\n OptionTable0, Dir).\nspecial_handler(mercury_library_special, string(Lib),\n OptionTable0, ok(OptionTable)) :-\n OptionTable =\n list.foldl(append_to_accumulating_option, [\n link_libraries - Lib,\n mercury_libraries - Lib,\n init_files - (Lib ++ \".init\")\n ], OptionTable0).\nspecial_handler(mercury_standard_library_directory_special,\n maybe_string(MaybeStdLibDir), OptionTable0, ok(OptionTable)) :-\n OptionTable =\n map.set(map.set(OptionTable0,\n mercury_standard_library_directory, maybe_string(MaybeStdLibDir)),\n mercury_configuration_directory, maybe_string(MaybeStdLibDir)).\nspecial_handler(mercury_configuration_directory_special,\n string(ConfDir), OptionTable0, ok(OptionTable)) :-\n OptionTable = map.set(OptionTable0, mercury_configuration_directory,\n maybe_string(yes(ConfDir))).\nspecial_handler(quoted_cflag, string(Flag),\n OptionTable0, ok(OptionTable)) :-\n handle_quoted_flag(cflags, Flag, OptionTable0, OptionTable).\nspecial_handler(quoted_gcc_flag, string(Flag),\n OptionTable0, ok(OptionTable)) :-\n handle_quoted_flag(gcc_flags, Flag, OptionTable0, OptionTable).\nspecial_handler(quoted_clang_flag, string(Flag),\n OptionTable0, ok(OptionTable)) :-\n handle_quoted_flag(clang_flags, Flag, OptionTable0, OptionTable).\nspecial_handler(quoted_msvc_flag, string(Flag),\n OptionTable0, ok(OptionTable)) :-\n handle_quoted_flag(msvc_flags, Flag, OptionTable0, OptionTable).\nspecial_handler(quoted_java_flag, string(Flag),\n OptionTable0, ok(OptionTable)) :-\n handle_quoted_flag(java_flags, Flag, OptionTable0, OptionTable).\nspecial_handler(quoted_ilasm_flag, string(Flag),\n OptionTable0, ok(OptionTable)) :-\n handle_quoted_flag(ilasm_flags, Flag, OptionTable0, OptionTable).\nspecial_handler(quoted_csharp_flag, string(Flag),\n OptionTable0, ok(OptionTable)) :-\n handle_quoted_flag(csharp_flags, Flag, OptionTable0, OptionTable).\nspecial_handler(quoted_erlang_flag, string(Flag),\n OptionTable0, ok(OptionTable)) :-\n handle_quoted_flag(erlang_flags, Flag, OptionTable0, OptionTable).\nspecial_handler(quoted_ld_flag, string(Flag),\n OptionTable0, ok(OptionTable)) :-\n handle_quoted_flag(ld_flags, Flag, OptionTable0, OptionTable).\nspecial_handler(quoted_ld_libflag, string(Flag),\n OptionTable0, ok(OptionTable)) :-\n handle_quoted_flag(ld_libflags, Flag, OptionTable0, OptionTable).\nspecial_handler(linkage_special, string(Flag), OptionTable0, Result) :-\n ( ( Flag = \"shared\" ; Flag = \"static\" ) ->\n Result = ok(\n (OptionTable0 ^ elem(mercury_linkage) := string(Flag))\n ^ elem(linkage) := string(Flag))\n ;\n Result = error(\"argument of `--linkage' should be either \" ++\n \"\"\"shared\"\" or \"\"static\"\".\")\n ).\nspecial_handler(mercury_linkage_special, string(Flag),\n OptionTable0, Result) :-\n ( ( Flag = \"shared\" ; Flag = \"static\" ) ->\n Result = ok(OptionTable0 ^ elem(mercury_linkage) := string(Flag))\n ;\n Result = error(\"argument of `--mercury-linkage' should be either \" ++\n \"\"\"shared\"\" or \"\"static\"\".\")\n ).\n\nspecial_handler(env_type, string(EnvTypeStr), OptionTable0, ok(OptionTable)) :-\n OptionTable =\n map.set(map.set(OptionTable0,\n host_env_type, string(EnvTypeStr)),\n target_env_type, string(EnvTypeStr)).\n\nspecial_handler(inform_inferred, bool(Inform), !.OptionTable,\n ok(!:OptionTable)) :-\n override_options([\n inform_inferred_types - bool(Inform),\n inform_inferred_modes - bool(Inform)\n ], !OptionTable).\n\n%-----------------------------------------------------------------------------%\n\noption_table_add_mercury_library_directory(OptionTable0, Dir) =\n % The init_file_directories and link_library_directories for Mercury\n % libraries are grade dependent, so they need to be handled in\n % handle_options.m after we know the grade.\n list.foldl(append_to_accumulating_option, [\n search_directories - dir.make_path_name(Dir, \"ints\"),\n c_include_directory - dir.make_path_name(Dir, \"inc\"),\n erlang_include_directory - dir.make_path_name(Dir, \"inc\"),\n mercury_library_directories - Dir\n ], OptionTable0).\n\noption_table_add_search_library_files_directory(OptionTable0, Dir) =\n % Grade dependent directories need to be handled in handle_options.m\n % after we know the grade.\n list.foldl(append_to_accumulating_option, [\n search_directories - Dir,\n c_include_directory - Dir,\n erlang_include_directory - Dir,\n search_library_files_directories - Dir\n ], OptionTable0).\n\n:- func append_to_accumulating_option(pair(option, string),\n option_table) = option_table.\n\nappend_to_accumulating_option(Option - Value, OptionTable0) =\n OptionTable0 ^ elem(Option) :=\n accumulating(\n getopt_io.lookup_accumulating_option(OptionTable0, Option)\n ++ [Value]).\n\n:- pred set_opt_level(int::in, option_table::in, option_table::out) is det.\n\nset_opt_level(N, !OptionTable) :-\n % First reset all optimizations to their default\n % (the default should be all optimizations off).\n option_defaults_2(optimization_option, OptimizationDefaults),\n override_options(OptimizationDefaults, !OptionTable),\n\n % Next enable the optimization levels from 0 up to N.\n enable_opt_levels(0, N, !OptionTable).\n\n:- pred enable_opt_levels(int::in, int::in,\n option_table::in, option_table::out) is det.\n\nenable_opt_levels(N0, N, !OptionTable) :-\n ( N0 > N ->\n true\n ; opt_level(N0, !.OptionTable, OptionSettingsList) ->\n override_options(OptionSettingsList, !OptionTable),\n N1 = N0 + 1,\n enable_opt_levels(N1, N, !OptionTable)\n ;\n unexpected($module, $pred, \"unknown optimization level\")\n ).\n\n:- pred override_options(list(pair(option, option_data))::in,\n option_table::in, option_table::out) is det.\n\noverride_options([], !OptionTable).\noverride_options([Option - Value | Settings], !OptionTable) :-\n map.set(Option, Value, !OptionTable),\n override_options(Settings, !OptionTable).\n\n%-----------------------------------------------------------------------------%\n\n:- pred opt_space(list(pair(option, option_data))::out) is det.\n\nopt_space([\n unneeded_code_copy_limit - int(1),\n optimize_dead_procs - bool(yes),\n optimize_labels - bool(yes),\n optimize_dups - bool(yes),\n optimize_proc_dups - bool(yes),\n optimize_fulljumps - bool(no),\n optimize_reassign - bool(yes),\n inline_alloc - bool(no),\n use_macro_for_redo_fail - bool(no),\n loop_invariants - bool(no)\n]).\n\n%-----------------------------------------------------------------------------%\n\n:- pred opt_level(int::in, option_table::in,\n list(pair(option, option_data))::out) is semidet.\n\n% Optimization level -1:\n% Generate totally unoptimized code; turns off ALL optimizations that\n% can be turned off, including HLDS->HLDS, HLDS->LLDS, LLDS->LLDS, LLDS->C,\n% and C->object optimizations.\n% (However, there are some optimizations that can't be disabled.)\n\n% Optimization level 0: aim to minimize overall compilation time.\n% XXX I just guessed. We should run lots of experiments.\n\nopt_level(0, _, [\n common_data - bool(yes),\n optimize - bool(yes),\n optimize_repeat - int(1),\n optimize_peep - bool(yes),\n optimize_peep_mkword - bool(yes),\n static_ground_cells - bool(yes),\n smart_indexing - bool(yes),\n optimize_jumps - bool(yes),\n optimize_labels - bool(yes),\n optimize_dead_procs - bool(yes),\n excess_assign - bool(yes) % ???\n]).\n\n% Optimization level 1: apply optimizations which are cheap and\n% have a good payoff while still keeping compilation time small.\n\nopt_level(1, OptionTable, [\n use_local_vars - bool(yes),\n c_optimize - bool(yes), % XXX we want `gcc -O1'\n optimize_frames - bool(yes),\n optimize_delay_slot - bool(DelaySlot),\n middle_rec - bool(yes),\n emit_c_loops - bool(yes),\n optimize_tailcalls - bool(yes)\n % dups?\n]) :-\n getopt_io.lookup_bool_option(OptionTable, have_delay_slot, DelaySlot).\n\n% Optimization level 2: apply optimizations which have a good\n% payoff relative to their cost; but include optimizations\n% which are more costly than with -O1.\n\nopt_level(2, _, [\n optimize_fulljumps - bool(yes),\n optimize_repeat - int(3),\n optimize_dups - bool(yes),\n follow_code - bool(yes),\n inline_simple - bool(yes),\n inline_single_use - bool(yes),\n inline_compound_threshold - int(10),\n common_struct - bool(yes),\n user_guided_type_specialization - bool(yes),\n % XXX While inst `array' is defined as `ground', we can't optimize\n % duplicate calls (we might combine calls to `array.init').\n % optimize_duplicate_calls - bool(yes),\n simple_neg - bool(yes),\n\n optimize_initializations - bool(yes)\n]).\n\n% Optimization level 3: apply optimizations which usually have a good\n% payoff even if they increase compilation time quite a bit.\n\nopt_level(3, _, [\n optimize_saved_vars_const - bool(yes),\n optimize_unused_args - bool(yes),\n optimize_higher_order - bool(yes),\n deforestation - bool(yes),\n local_constraint_propagation - bool(yes),\n constant_propagation - bool(yes),\n optimize_reassign - bool(yes),\n % Disabled until a bug in extras/trailed_update/var.m is resolved.\n % introduce_accumulators - bool(yes),\n optimize_repeat - int(4)\n]).\n\n% Optimization level 4: apply optimizations which may have some\n% payoff even if they increase compilation time quite a bit.\n\n% Currently this enables the use of local variables\n% and increases the inlining thresholds.\n\nopt_level(4, _, [\n inline_simple_threshold - int(8),\n inline_compound_threshold - int(20),\n higher_order_size_limit - int(30)\n]).\n\n% Optimization level 5: apply optimizations which may have some\n% payoff even if they increase compilation time a lot.\n\n% Currently this enables the search for construction unifications that can be\n% delayed past failing computations, allows more passes of the low-level\n% optimizations, and increases the inlining thresholds still further.\n% We also enable eliminate_local_vars only at this level,\n% because that pass is implemented pretty inefficiently.\n\nopt_level(5, _, [\n optimize_repeat - int(5),\n delay_construct - bool(yes),\n inline_compound_threshold - int(100),\n higher_order_size_limit - int(40),\n eliminate_local_vars - bool(yes),\n loop_invariants - bool(yes)\n]).\n\n% Optimization level 6: apply optimizations which may have any payoff even if\n% they increase compilation time to completely unreasonable levels.\n\n% Currently this sets `everything_in_one_c_function', which causes the compiler\n% to put everything in the one C function and treat calls to predicates in the\n% same module as local. We also enable inlining of GC_malloc(), redo(), and\n% fail().\n\nopt_level(6, _, [\n procs_per_c_function - int(0), % everything in one C function\n inline_alloc - bool(yes),\n use_macro_for_redo_fail - bool(yes)\n]).\n\n% The following optimization options are not enabled at any level:\n%\n% checked_nondet_tailcalls:\n% This is deliberate, because the transformation\n% might make code run slower.\n%\n% constraint_propagation:\n% I think this is deliberate, because the transformation\n% might make code run slower?\n%\n% unneeded_code:\n% Because it can cause slowdowns at high optimization levels;\n% cause unknown\n% type_specialization:\n% XXX why not?\n%\n% introduce_accumulators:\n% XXX Disabled until a bug in extras/trailed_update/var.m\n% is resolved.\n%\n% optimize_constructor_last_call:\n% Not a speedup in general.\n\n%-----------------------------------------------------------------------------%\n\n:- pred handle_quoted_flag(option::in, string::in,\n option_table::in, option_table::out) is det.\n\nhandle_quoted_flag(Option, Flag, Table,\n append_to_accumulating_option(Option - quote_arg(Flag), Table)).\n\nquote_arg(Arg0) = Arg :-\n % XXX Instead of using dir.use_windows_paths, this should really\n % test whether we are using a Unix or Windows shell.\n ( dir.use_windows_paths ->\n ( ( string_contains_whitespace(Arg0) ; Arg0 = \"\" ) ->\n Arg = \"\"\"\" ++ Arg0 ++ \"\"\"\"\n ;\n Arg = Arg0\n )\n ;\n ArgList = quote_arg_unix(string.to_char_list(Arg0)),\n (\n ArgList = [],\n Arg = \"\"\"\"\"\"\n ;\n ArgList = [_ | _],\n (\n list.member(Char, ArgList),\n \\+\n ( char.is_alnum_or_underscore(Char)\n ; Char = ('-')\n ; Char = ('/')\n ; Char = ('.')\n ; Char = (',')\n ; Char = (':')\n )\n ->\n Arg = \"\"\"\" ++ string.from_char_list(ArgList) ++ \"\"\"\"\n ;\n Arg = string.from_char_list(ArgList)\n )\n )\n ).\n\n:- pred string_contains_whitespace(string::in) is semidet.\n\nstring_contains_whitespace(Str) :-\n Chars = string.to_char_list(Str),\n some [Char] (\n list.member(Char, Chars),\n char.is_whitespace(Char)\n ).\n\n:- func quote_arg_unix(list(char)) = list(char).\n\nquote_arg_unix([]) = [].\nquote_arg_unix([Char | Chars0]) = Chars :-\n Chars1 = quote_arg_unix(Chars0),\n ( quote_char_unix(Char) ->\n Chars = [('\\\\'), Char | Chars1]\n ;\n Chars = [Char | Chars1]\n ).\n\n:- pred quote_char_unix(char::in) is semidet.\n\nquote_char_unix('\\\\').\nquote_char_unix('\"').\nquote_char_unix('`').\nquote_char_unix('$').\n\n%-----------------------------------------------------------------------------%\n\ninconsequential_options(InconsequentialOptions) :-\n option_defaults_2(warning_option, WarningOptions),\n option_defaults_2(verbosity_option, VerbosityOptions),\n option_defaults_2(internal_use_option, InternalUseOptions),\n option_defaults_2(build_system_option, BuildSystemOptions),\n assoc_list.keys(WarningOptions, WarningKeys),\n assoc_list.keys(VerbosityOptions, VerbosityKeys),\n assoc_list.keys(InternalUseOptions, InternalUseKeys),\n assoc_list.keys(BuildSystemOptions, BuildSystemKeys),\n Keys = WarningKeys ++ VerbosityKeys ++ InternalUseKeys ++ BuildSystemKeys,\n InconsequentialOptions = set.from_list(Keys).\n\n%-----------------------------------------------------------------------------%\n\noptions_help -->\n io.write_string(\"\\t-?, -h, --help\\n\"),\n io.write_string(\"\\t\\tPrint this usage message.\\n\"),\n options_help_warning,\n options_help_verbosity,\n options_help_output,\n options_help_aux_output,\n options_help_semantics,\n options_help_termination,\n options_help_ctgc,\n options_help_compilation_model,\n options_help_code_generation,\n options_help_optimization,\n options_help_hlds_hlds_optimization,\n options_help_hlds_llds_optimization,\n options_help_llds_llds_optimization,\n options_help_mlds_mlds_optimization,\n options_help_hlds_elds_optimization,\n options_help_output_optimization,\n options_help_target_code_compilation,\n options_help_link,\n options_help_build_system,\n options_help_misc.\n\n:- pred options_help_warning(io::di, io::uo) is det.\n\noptions_help_warning -->\n io.write_string(\"\\nWarning Options:\\n\"),\n write_tabbed_lines([\n \"-w, --inhibit-warnings\",\n \"\\tDisable all warning messages.\",\n \"--halt-at-warn\",\n \"\\tThis option causes the compiler to treat all \",\n \"\\twarnings as if they were errors. This means that\",\n \"\\tif any warning is issued, the compiler will not\",\n \"\\tgenerate code --- instead, it will return a\",\n \"\\tnon-zero exit status.\",\n \"--halt-at-syntax-errors\",\n \"\\tThis option causes the compiler to halt immediately\",\n \"\\tafter syntax checking and not do any semantic checking\",\n \"\\tif it finds any syntax errors in the program.\",\n% \"--halt-at-auto-parallel-failure\",\n% \"\\tThis option causes the compiler to halt if it cannot perform\",\n% \"\\tan auto-parallelization requested by a feedback file.\",\n \"--inhibit-accumulator-warnings\",\n \"\\tDon't warn about argument order rearrangement caused\",\n \"\\tby --introduce-accumulators.\",\n \"--no-warn-singleton-variables\",\n \"\\tDon't warn about variables which only occur once.\",\n \"--no-warn-overlapping-scopes\",\n \"\\tDon't warn about variables which occur in overlapping scopes.\",\n \"--no-warn-det-decls-too-lax\",\n \"\\tDon't warn about determinism declarations\",\n \"\\twhich could have been stricter.\",\n \"--no-warn-inferred-erroneous\",\n \"\\tDon't warn about procedures whose determinism is inferred\",\n \"\\terroneous but whose determinism declarations are laxer.\",\n \"--no-warn-insts-without-matching-type\",\n \"\\tDon't warn about insts that are not consistent with any\",\n \"\\tof the types in scope.\",\n % XXX disabled until compiler unused_imports,\n % don't forget to update the user_guide.texi\n % \"--no-warn-unused-imports\",\n % \"\\tDon't warn about modules that are imported but not used.\",\n \"--warn-unused-imports\",\n \"\\tWarn about modules that are imported but not used.\",\n \"--no-warn-nothing-exported\",\n \"\\tDon't warn about modules which export nothing.\",\n \"--warn-unused-args\",\n \"\\tWarn about predicate arguments which are not used.\",\n \"--warn-interface-imports\",\n \"\\tWarn about modules imported in the interface, but\",\n \"\\twhich are not used in the interface.\",\n \"--no-warn-missing-opt-files\",\n \"\\tDisable warnings about `.opt' files which cannot be opened.\",\n \"--warn-missing-trans-opt-files\",\n \"\\tEnable warnings about `.trans_opt' files which cannot\",\n \"\\tbe opened.\",\n \"--no-warn-missing-trans-opt-deps\",\n \"\\tDisable warnings produced when the information required\",\n \"\\tto allow `.trans_opt' files to be read when creating other\",\n \"\\t`.trans_opt' files has been lost. The information can be\",\n \"\\trecreated by running `mmake .depend'\",\n \"--no-warn-non-contiguous-clauses\",\n \"\\tDo not generate a warning if the clauses of a predicate or function\",\n \"\\tare not contiguous.\",\n \"--warn-non-contiguous-foreign-procs\",\n \"\\tGenerate a warning if the clauses and foreign_procs of a predicate\",\n \"\\tor function are not contiguous.\",\n \"--warn-non-stratification\",\n \"\\tWarn about possible non-stratification of the predicates and/or\",\n \"\\tfunctions in the module.\",\n \"\\tNon-stratification occurs when a predicate or function can call\",\n \"\\titself negatively through some path along its call graph.\",\n \"--no-warn-unification-cannot-succeed\",\n \"\\tDisable warnings about unifications which cannot succeed.\",\n \"--no-warn-simple-code\",\n \"\\tDisable warnings about constructs which are so\",\n \"\\tsimple that they are likely to be programming errors.\",\n \"--warn-duplicate-calls\",\n \"\\tWarn about multiple calls to a predicate with the\",\n \"\\tsame input arguments.\",\n \"--no-warn-missing-module-name\",\n \"\\tDisable warnings for modules that do no start with\",\n \"\\ta `:- module' declaration.\",\n \"--no-warn-wrong-module-name\",\n \"\\tDisable warnings for modules whose `:- module'\",\n \"\\tdeclaration does not match the module's file name.\",\n \"--no-warn-smart-recompilation\",\n \"\\tDisable warnings from the smart recompilation system.\",\n \"--no-warn-undefined-options-variables\",\n \"\\tDo not warn about references to undefined variables in\",\n \"\\toptions files with `--make'.\",\n \"--warn-non-tail-recursion\",\n \"\\tWarn about any directly recursive calls that are not tail calls.\",\n \"--no-warn-up-to-date\",\n \"\\tDon't warn if targets specified on the command line\",\n \"\\twith `--make' are already up to date.\",\n \"--no-warn-stubs\",\n \"\\tDisable warnings about procedures for which there are no\",\n \"\\tclauses. Note that this option only has any effect if\",\n \"\\tthe `--allow-stubs' option (described in the \"\"Language\",\n \"\\tSemantics Options\"\" section below) is enabled.\",\n \"--warn-dead-procs\",\n \"\\tWarn about procedures which are never called.\",\n \"--no-warn-target-code\",\n \"\\tDisable warnings from the compiler used to process the\",\n \"\\ttarget code (e.g. gcc).\",\n \"--no-warn-table-with-inline\",\n \"\\tDisable warnings about tabled procedures that also have\",\n \"\\ta `pragma inline' declaration.\",\n \"--no-warn-non-term-special-preds\",\n \"\\tDo not warn about types that have user-defined equality or\",\n \"\\tcomparison predicates that cannot be proved to terminate.\",\n \"\\tThis option is only enabled when termination analysis is enabled.\",\n \"\\t(See the \"\"Termination Analysis Options\"\" section below).\",\n \"--no-warn-known-bad-format-calls\",\n \"\\tDo not warn about calls to string.format or io.format that\",\n \"\\tthe compiler knows for sure contain mismatches between the\",\n \"\\tformat string and the supplied values.\",\n \"--warn-unknown-format-calls\",\n \"\\tWarn about calls to string.format or io.format for which\",\n \"\\tthe compiler cannot tell whether there are any mismatches\",\n \"\\tbetween the format string and the supplied values.\",\n \"--no-warn-obsolete\",\n \"\\tDo not warn about calls to predicates or functions that have\",\n \"\\tbeen marked as obsolete.\",\n \"--inform-ite-instead-of-switch\",\n \"\\tGenerate informational messages for if-then-elses that could be\",\n \"\\treplaced by switches.\",\n \"--no-warn-unresolved-polymorphism\",\n \"\\tDo not warn about unresolved polymorphism.\",\n \"--warn-suspicious-foreign-procs\",\n \"\\tWarn about possible errors in the bodies of foreign\",\n \"\\tprocedures.\",\n \"--no-warn-state-var-shadowing\",\n \"\\tDo not warn about one state variable shadowing another.\",\n \"--no-inform-inferred\",\n \"\\tDo not generate messages about inferred types or modes.\",\n \"--no-inform-inferred-types\",\n \"\\tDo not generate messages about inferred types.\",\n \"--no-inform-inferred-modes\",\n \"\\tDo not generate messages about inferred modes.\"\n ]).\n\n:- pred options_help_verbosity(io::di, io::uo) is det.\n\noptions_help_verbosity -->\n io.write_string(\"\\nVerbosity Options:\\n\"),\n write_tabbed_lines([\n \"-v, --verbose\",\n \"\\tOutput progress messages at each stage in the compilation.\",\n \"-V, --very-verbose\",\n \"\\tOutput very verbose progress messages.\",\n \"-E, --verbose-error-messages\",\n \"\\tExplain error messages. Asks the compiler to give you a more\",\n \"\\tdetailed explanation of any errors it finds in your program.\",\n \"--no-verbose-make\",\n \"\\tDisable messages about the progress of builds using\",\n \"\\tthe `--make' option.\",\n \"--verbose-commands\",\n \"\\tOutput each external command before it is run.\",\n \"\\tNote that some commands will only be printed with `--verbose'.\",\n \"--verbose-recompilation\",\n \"\\tWhen using `--smart-recompilation', output messages\",\n \"\\texplaining why a module needs to be recompiled.\",\n \"--find-all-recompilation-reasons\",\n \"\\tFind all the reasons why a module needs to be recompiled,\",\n \"\\tnot just the first. Implies `--verbose-recompilation'.\",\n \"--output-compile-error-lines \",\n \"\\tWith `--make', output the first lines of the `.err'\",\n \"\\tfile after compiling a module (default: 15).\",\n \"--report-cmd-line-args-doterr\",\n \"\\tReport the command line arguments.\",\n \"--report-cmd-line-args-in-doterr\",\n \"\\tReport the command line arguments for compilations whose output\",\n \"\\tmmake normally redirects to a .err file.\",\n \"-S, --statistics\",\n \"\\tOutput messages about the compiler's time/space usage.\",\n \"\\tAt the moment this option implies `--no-trad-passes', so you get\",\n \"\\tinformation at the boundaries between phases of the compiler.\",\n% The only sensible way to use --detailed-statistics, based on --very-verbose,\n% is implemented automatically in handle_options, so users shouldn't need to be\n% aware of it.\n% \"--detailed-statistics\",\n% \"\\tOutput more detailed messages about the compiler's\",\n% \"\\ttime/space usage.\",\n \"--proc-size-statistics \",\n \"\\tAppend information about the size of each procedure in the module\",\n \"\\tin terms of goals and variables to the end of the named file.\",\n% --debug-types works only if the compiler was compiled with\n% \"--trace-flag type_checkpoint\".\n% \"-T, --debug-types\",\n% \"\\tOutput detailed debugging traces of the type checking.\",\n \"-N, --debug-modes\",\n \"\\tOutput debugging traces of the mode checking.\",\n \"--debug-modes-statistics\",\n \"\\tOutput statistics after each step of mode checking.\",\n \"--debug-modes-minimal\",\n \"\\tOutput only minimal debugging traces of the mode checking.\",\n \"--debug-modes-verbose\",\n \"\\tOutput detailed debugging traces of the mode checking.\",\n \"--debug-modes-pred-id \",\n \"\\tWith --debug-modes, restrict the debugging traces to the\",\n \"\\tmode checking of the predicate or function with the specified\",\n \"\\tpred id.\",\n% --debug-dep-par-conj is a developer only option,\n% and it is effective only if the compiler was compiled with the right\n% trace flags.\n% \"--debug-dep-par-conj \",\n% \"\\tOutput detailed debugging traces during the dependent\",\n% \"\\tAND-parallelism transformation of the predicate with the\",\n% \"\\tpredicate id.\",\n \"--debug-det, --debug-determinism\",\n \"\\tOutput detailed debugging traces of determinism analysis.\",\n% --debug-code-gen-pred-id is a developer only option,\n% and it is effective only if the compiler was compiled with the right\n% trace flags.\n% \"--debug-code-gen-pred-id \",\n% \"\\tOutput detailed debugging traces of code generation for the\",\n% \"\\tpredicate or function with the given pred id.\",\n% The new termination analyser is currently a work-in-progress.\n%\n %\"--debug-term, --debug-termination\",\n %\"\\tOutput detailed debugging traces of the termination2 analysis.\",\n \"--debug-opt\",\n \"\\tOutput detailed debugging traces of the optimization process.\",\n \"--debug-opt-pred-id \",\n \"\\tOutput detailed debugging traces of the optimization process\",\n \"\\tonly for the predicate/function with the specified pred id.\",\n \"--debug-opt-pred-name \",\n \"\\tOutput detailed debugging traces of the optimization process\",\n \"\\tonly for the predicate/function with the specified name.\",\n \"--debug-pd\",\n \"\\tOutput detailed debugging traces of the partial\",\n \"\\tdeduction and deforestation process.\",\n \"--debug-liveness \",\n \"\\tOutput detailed debugging traces of the liveness analysis\",\n \"\\tof the predicate with the given predicate id.\",\n \"--debug-make\",\n \"\\tOutput detailed debugging traces of the `--make' option.\",\n% This can be uncommented when the '--analyse-closures' option is uncommented.\n% (See below.)\n% \"--debug-closure\",\n% \"\\tOutput detailed debugging traces of the closure analysis.\"\n \"--debug-trail-usage\",\n \"\\tOutput detailed debugging traces of the `--analyse-trail-usage'\",\n \"\\toption.\",\n \"--debug-intermodule-analysis\",\n \"\\tOutput detailed debugging traces of the `--intermodule-analysis'\",\n \"\\toption.\",\n \"--debug-indirect-reuse\",\n \"\\tOutput detailed debugging traces of the indirect reuse pass of\",\n \"\\t`--structure-reuse' option.\",\n \"--debug-type-rep\",\n \"\\tOutput debugging traces of type representation choices.\"\n% The mode constraints code is still experimental so this option is\n% currently commented out.\n% \"--debug-mode-constraints\",\n% \"\\tOutput detailed debugging traces of the `--prop-mode-constraints'\",\n% \"\\toption.\"\n ]).\n\n:- pred options_help_output(io::di, io::uo) is det.\n\noptions_help_output -->\n io.write_string(\"\\nOutput Options:\\n\"),\n write_tabbed_lines([\n \"These options are mutually exclusive.\",\n \"Only the first one specified will apply.\",\n \"If none of these options are specified, the default action\",\n \"is to link the named modules to produce an executable.\\n\",\n \"-f, --generate-source-file-mapping\",\n \"\\tOutput the module name to file name mapping for the list\",\n \"\\tof source files given as non-option arguments to mmc\",\n \"\\tto `Mercury.modules'. This must be done before\",\n \"\\t`mmc --generate-dependencies' if there are any modules\",\n \"\\tfor which the file name does not match the module name.\",\n \"\\tIf there are no such modules the mapping need not be\",\n \"\\tgenerated.\",\n \"-M, --generate-dependencies\",\n \"\\tOutput `Make'-style dependencies for the module\",\n \"\\tand all of its dependencies to `.dep'.\",\n \"--generate-dependency-file\",\n \"\\tOutput `Make'-style dependencies for the module\",\n \"\\tto `.d'.\",\n \"--generate-module-order\",\n \"\\tOutput the strongly connected components of the module\",\n \"\\tdependency graph in top-down order to `.order'.\",\n \"\\tImplies --generate-dependencies.\",\n \"--generate-standalone-interface \",\n \"\\tOutput a stand-alone interface.\",\n \"\\t is used as the basename of any files generated for\",\n \"\\tthe stand-alone interface. (See the Stand-alone Interface\",\n \"\\tchapter of the Mercury User's Guide for further details.)\",\n \"-i, --make-int, --make-interface\",\n \"\\tWrite the module interface to `.int',\",\n \"\\tand write the short interface to `.int2'\",\n \"\\tThis option should only be used by mmake.\",\n \"--make-priv-int, --make-private-interface\",\n \"\\tWrite the private interface to `.int0'.\",\n \"\\tThis option should only be used by mmake.\",\n \"--make-short-int, --make-short-interface\",\n \"\\tWrite the unqualified short interface to `.int3'.\",\n \"\\tThis option should only be used by mmake.\",\n \"--make-opt-int, --make-optimization-interface\",\n \"\\tWrite inter-module optimization information to\",\n \"\\t`.opt'.\",\n \"\\tThis option should only be used by mmake.\",\n \"--make-trans-opt\",\n \"--make-transitive-optimization-interface\",\n \"\\tOutput transitive optimization information\",\n \"\\tinto the `.trans_opt' file.\",\n \"\\tThis option should only be used by mmake.\",\n \"-x,--make-xml-doc,--make-xml-documentation\",\n \"\\tOutput XML documentation of the module\",\n \"\\tinto the `.xml' file.\",\n \"\\tThis option should only be used by mmake.\",\n \"-P, --convert-to-mercury\",\n \"\\tConvert to Mercury. Output to file `.ugly'\",\n \"\\tThis option acts as a Mercury ugly-printer.\",\n \"-t, --typecheck-only\",\n \"\\tJust check that the code is syntactically correct and\",\n \"\\ttype-correct. Don't check modes or determinism,\",\n \"\\tand don't generate any code.\",\n \"-e, --errorcheck-only\",\n \"\\tCheck the module for errors, but do not generate any code.\",\n \"-C, --target-code-only\",\n \"\\tGenerate target code (i.e. C code in `.c',\",\n \"\\tIL code in `.il', or Java code in\",\n \"\\t`.java'), but not object code.\",\n \"-c, --compile-only\",\n \"\\tGenerate C code in `.c' and object code in `.o'\",\n \"\\tbut do not attempt to link the named modules.\",\n % --compile-to-shared-lib is intended only for use\n % by the debugger's interactive query facility,\n % so it isn't documented.\n \"--output-grade-string\",\n \"\\tCompute the grade of the library to link with based on\",\n \"\\tthe command line options, and print it to the standard\",\n \"\\toutput.\",\n \"--output-link-command\",\n \"\\tPrint the command used to link executables to the\",\n \"\\tstandard output.\",\n \"--output-shared-lib-link-command\",\n \"\\tPrint the command used to link shared libraries to the\",\n \"\\tstandard output.\",\n \"--output-libgrades\",\n \"\\tPrint the list of compilation grades in which a library\",\n \"\\tto be installed should be built to the standard output.\",\n \"--output-cc\",\n \"\\tPrint the command used to invoke the C compiler to the\",\n \"\\tstandard output.\",\n \"--output-cc-type, --output-c-compiler-type\",\n \"\\tPrint the C compiler type to the standard output.\",\n \"--output-cflags\",\n \"\\tPrint the flags with which the C compiler will be invoked\",\n \"\\tto the standard output.\",\n \"--output-csharp-compiler-type\",\n \"\\tPrint the C# compiler type to the standard output.\",\n \"--output-library-link-flags\",\n \"\\tPrint the flags that are passed to linker in order to link\",\n \"\\tagainst the current set of libraries. This includes the\",\n \"\\tstandard library as well as any other libraries specified\",\n \"\\tvia the --ml option. The flags are printed to the standard\",\n \"\\toutput.\",\n \"--output-grade-defines\",\n \"\\tPrint the flags that are passed to the C compiler to define the\",\n \"\\tmacros used to specify the compilation grade.\",\n \"\\tThe flags are printed to the standard output.\",\n \"--output-c-include-dir-flags, --output-c-include-directory-flags\", \n \"\\tPrint the flags that are passed to the C compiler to specify\",\n \"\\twhich directories to search for C header files.\",\n \"\\tThis includes the C header files from the standard library.\",\n \"\\tThe flags are printed to the standard output.\"\n ]).\n \n:- pred options_help_aux_output(io::di, io::uo) is det.\n\noptions_help_aux_output -->\n io.write_string(\"\\nAuxiliary Output Options:\\n\"),\n write_tabbed_lines([\n \"--smart-recompilation\",\n \"\\tWhen compiling, write program dependency information\",\n \"\\tto be used to avoid unnecessary recompilations if an\",\n \"\\timported module's interface changes in a way which does\",\n \"\\tnot invalidate the compiled code. `--smart-recompilation'\",\n \"\\tdoes not yet work with `--intermodule-optimization'.\",\n \"--no-assume-gmake\",\n \"\\tWhen generating `.dep' files, generate Makefile\",\n \"\\tfragments that use only the features of standard make;\",\n \"\\tdo not assume the availability of GNU Make extensions.\",\n \"\\tWhen generating `.dep' files, generate dependencies\",\n \"\\tfor use by `mmc --make' in addition to the dependencies\",\n \"\\tused by mmake.\",\n \"--generate-mmc-deps\",\n \"--generate-mmc-make-module-dependencies\",\n \"\\tGenerate dependencies for use by `mmc --make' even\",\n \"\\twhen using Mmake. This is recommended when building a\",\n \"\\tlibrary for installation.\",\n\n% XXX The source-to-source debugging transform is not ready for public\n% consumption.\n %\"--link-ssdebug-libs\",\n %\"--link-ssdb-libs\",\n %\"\\tLink the source to source debugging libraries into the\",\n %\"\\tthe executable.\",\n %\"--ss-trace {none, shallow, deep}\",\n %\"\\tThe trace level to use for source to source debugging of\",\n %\"\\tthe given module.\",\n\n% \"--trace decl\" is not documented, because it is for backwards\n% compatibility only. It is now equivalent to `--trace rep'.\n% \"--trace {minimum, shallow, deep, decl, rep, default}\",\n \"--trace {minimum, shallow, deep, rep, default}\",\n \"\\tGenerate code that includes the specified level\",\n \"\\tof execution tracing.\",\n \"\\tSee the Debugging chapter of the Mercury User's Guide\",\n \"\\tfor details.\",\n \"--exec-trace-tail-rec\",\n \"\\tGenerate TAIL events for self-tail-recursive calls instead of\",\n \"\\tEXIT events. This allows these recursive calls to reuse\",\n \"\\ttheir parent call's stack frame, but it also means that\",\n \"\\tthe debugger won't have access to the contents of the reused\",\n \"\\tstack frames\",\n% \"--suppress-trace ,\",\n% \"\\tSuppress the named aspects of the execution tracing system.\",\n% This is a developer-only option:\n% \"--force-disable-trace\",\n% \"\\tForce tracing to be set to trace level none.\",\n% \"\\tThis overrides all other tracing/grade options.\",\n% \"\\tIts main use is to turn off tracing in the browser\",\n% \"\\tdirectory, even for .debug and .decldebug grades.\",\n \"--trace-optimized\",\n \"\\tDo not disable optimizations that can change the trace.\",\n% \"--trace-prof\" is not documented because if is only intended for developers\n% of the deep profiler.\n% \"--trace-prof\"\",\n% \"\\tEnable tracing of deep profiling service predicates.\",\n% I/O tabling is deliberately not documented. It is mean to be switched on,\n% with consistent parameters, in debugging grades, and to be consistently\n% switched off in non-debugging grades. Inconsistent use of the options\n% governing I/O tabling can yield core dumps from the debugger, so these\n% options are for implementors only.\n% \"--trace-table-io\",\n% \"\\tEnable the tabling of I/O actions, to allow the debugger\",\n% \"\\tto execute retry commands across I/O actions.\",\n% \"--trace-table-io-only-retry\",\n% \"\\tSet up I/O tabling to support only retries across I/O\",\n% \"\\tactions, not the printing of actions or declarative\",\n% \"\\tdebugging. This reduces the size of the I/O action table.\",\n% \"--trace-table-io-states\",\n% \"\\tWhen tabling I/O actions, table the io.state arguments\",\n% \"\\ttogether with the others. This should be required iff\",\n% \"\\tvalues of type io.state actually contain information.\",\n% \"--trace-table-io-require\",\n% \"\\tRequire the tabling of I/O actions, i.e. generate an error\",\n% \"\\tif an I/O primitive does not have the tabled_for_io\",\n% \"\\tannotation.\",\n% \"--trace-table-io-all\",\n% \"\\tTable all I/O actions even in the absence of annotations.\",\n% \"\\tIf a primitive has no annotation specifying the type of\",\n% \"\\ttabling required, deduce it from the values of the other\",\n% \"\\tannotations.\",\n \"--trace-flag \",\n \"\\tEnable the trace goals that depend on the trace flag.\",\n \"--profile-optimized\",\n \"\\tDo not disable optimizations that can distort deep profiles.\",\n \"--no-delay-death\",\n \"\\tWhen the trace level is `deep', the compiler normally\",\n \"\\tpreserves the values of variables as long as possible, even\",\n \"\\tbeyond the point of their last use, in order to make them\",\n \"\\taccessible from as many debugger events as possible.\",\n \"\\tHowever, it will not do this if this option is given.\",\n \"--delay-death-max-vars \",\n \"\\tDelay the deaths of variables only when the number of variables\",\n \"\\tin the procedure is no more than N. The default value is 1000.\",\n \"--stack-trace-higher-order\",\n \"\\tEnable stack traces through predicates and functions with\",\n \"\\thigher-order arguments, even if stack tracing is not\",\n \"\\tsupported in general.\",\n% This is a developer-only option:\n% \"--force-disable-ssdebug\",\n% \"\\tDisable ssdebug transformation even in ssdebug grades.\",\n% \"--tabling-via-extra-args\",\n% \"\\tGenerate output via extra_args in foreign_procs.\",\n% \"--allow-table-reset\",\n% \"\\tGenerate C code for resetting tabling data structures.\",\n \"--generate-bytecode\",\n \"\\tOutput a bytecode form of the module for use\",\n \"\\tby an experimental debugger.\",\n \"-n-, --no-line-numbers\",\n \"\\tDo not put source line numbers in the generated code.\",\n \"\\tThe generated code may be in C (the usual case),\",\n \"\\tor in Mercury (with the option --convert-to-mercury).\",\n \"--auto-comments\",\n \"\\tOutput comments in the `.c' file.\",\n% This option is for developers only. Since it can include one C comment inside\n% another, the resulting code is not guaranteed to be valid C.\n% \"--frameopt-comments\",\n% \"\\tGet frameopt.m to generate comments describing its operation.\",\n \"\\t(The code may be easier to understand if you also\",\n \"\\tuse the `--no-llds-optimize' option.)\",\n \"--max-error-line-width \",\n \"\\tSet the maximum width of an error message line to characters\",\n \"\\t(unless a long single word forces the line over this limit).\",\n \"--show-dependency-graph\",\n \"\\tWrite out the dependency graph to `.dependency_graph'.\",\n \"--imports-graph\",\n \"\\tWrite out the imports graph to `.imports_graph'.\",\n \"\\tThe imports graph contains the directed graph module A\",\n \"\\timports module B.\",\n \"\\tThe resulting file can be processed by the graphviz tools.\",\n% This option is for developers only.\n% \"--dump-trace-counts \",\n% \"\\tIf the compiler was compiled with debugging enabled and is being\",\n% \"\\trun with trace counting enabled, write out the trace counts file\",\n% \"\\tafter the specified stage to `.trace_counts.-'.\",\n% \"\\tStage numbers range from 1-599.\",\n% \"\\tMultiple dump options accumulate.\",\n \"-d , --dump-hlds \",\n \"\\tDump the HLDS (high level intermediate representation) after\",\n \"\\tthe specified stage to `.hlds_dump.-'.\",\n \"\\tStage numbers range from 1-599.\",\n \"\\tMultiple dump options accumulate.\",\n \"--dump-hlds-pred-id \",\n \"\\tDump the HLDS only of the predicate/function with the given\",\n \"\\tpred id.\",\n \"--dump-hlds-pred-name \",\n \"\\tDump the HLDS only of the predicate/function with the given\",\n \"\\tname.\",\n% This option is for developers only.\n% \"-D, --dump-hlds-alias \",\n% \"\\tWith `--dump-hlds', include extra detail in the dump.\",\n% \"\\tEach dump alias is shorthand for a set of option letters.\",\n% \"\\tThe list of aliases is in handle_options.m\",\n \"--dump-hlds-options \",\n \"\\tWith `--dump-hlds', include extra detail in the dump.\",\n \"\\tEach type of detail is included in the dump if its\",\n \"\\tcorresponding letter occurs in the option argument\",\n \"\\t(see the Mercury User's Guide for details).\",\n \"--dump-hlds-inst-limit \",\n \"\\tDump at most N insts in each inst table.\",\n \"--dump-hlds-file-suffix \",\n \"\\tAppend the given suffix to the names of the files created by\",\n \"\\tthe `--dump-hlds' option.\",\n \"--dump-same-hlds\",\n \"\\tCreate a file for a HLDS stage even if the file notes only that\",\n \"\\tthis stage is identical to the previously dumped HLDS stage.\",\n \"--dump-mlds \",\n \"\\tDump the MLDS (medium level intermediate representation)\",\n \"\\tafter the specified stage, as C code,\",\n \"\\tto`.c_dump.-',\",\n \"\\tand `.h_dump.-'.\",\n \"\\tStage numbers range from 1-99.\",\n \"\\tMultiple dump options accumulate.\",\n \"--verbose-dump-mlds \",\n \"\\tDump the internal compiler representation of the MLDS, after\",\n \"\\tthe specified stage, to `.mlds_dump.-'.\"\n% The mode constraints code is still experimental so these options are\n% currently commented out.\n% \"--mode-constraints\"\n% \"\\tRun constraint based mode analysis. The default is to\",\n% \"\\tuse the robdd solution using the full (subtyping)\",\n% \"\\tconstraints and dump results.\",\n% \"--simple-mode-constraints\",\n% \"\\tUse only the simplified constraint system when running\",\n% \"\\tthe robdd solver constraints based mode analysis.\",\n% \"--prop-mode-constraints\",\n% \"\\tUse the new propagation solver for constraints based\",\n% \"\\tmode analysis.\",\n% IL options are commented out to reduce confusion.\n% \"--sign-assembly\",\n% \"\\tSign the current assembly with the Mercury strong name.\",\n% \"\\tTo use assemblies created with this command all the Mercury\",\n% \"\\tmodules must be compiled with this option enabled.\",\n% \"\\tThis option is specific to the IL backend, and is likely\",\n% \"\\tto be deprecated at a later date.\"\n\n /* XXX currently broken.\n \"--separate-assemblies\",\n \"\\tPlace sub-modules in separate assemblies.\",\n \"\\tThis option is specific to the IL backend.\"\n */\n ]).\n\n:- pred options_help_semantics(io::di, io::uo) is det.\n\noptions_help_semantics -->\n io.write_string(\"\\nLanguage semantics options:\\n\"),\n io.write_string(\"(See the Mercury language reference manual for detailed explanations.)\\n\"),\n write_tabbed_lines([\n \"--no-reorder-conj\",\n \"\\tExecute conjunctions left-to-right except where the modes imply\",\n \"\\tthat reordering is unavoidable.\",\n \"--no-reorder-disj\",\n \"\\tExecute disjunctions strictly left-to-right.\",\n \"--no-fully-strict\",\n \"\\tAllow infinite loops or goals with determinism erroneous to be\",\n \"\\toptimised away.\",\n \"--allow-stubs\",\n \"\\tAllow procedures to have no clauses. Any calls to\",\n \"\\tsuch procedures will raise an exception at run-time.\",\n \"\\tThis option is sometimes useful during program development.\",\n \"\\t(See also the documentation for the `--warn-stubs' option\",\n \"\\tin the \"\"Warning Options\"\" section.)\",\n \"--infer-all\",\n \"\\tAbbreviation for `--infer-types --infer-modes --infer-det'.\",\n \"--infer-types\",\n \"\\tIf there is no type declaration for a predicate or function,\",\n \"\\ttry to infer the type, rather than just reporting an error.\",\n \"--infer-modes\",\n \"\\tIf there is no mode declaration for a predicate,\",\n \"\\ttry to infer the modes, rather than just reporting an error.\",\n\n \"--no-infer-det, --no-infer-determinism\",\n \"\\tIf there is no determinism declaration for a procedure,\",\n \"\\tdon't try to infer the determinism, just report an error.\",\n \"--type-inference-iteration-limit \",\n \"\\tPerform at most passes of type inference (default: 60).\",\n \"--mode-inference-iteration-limit \",\n \"\\tPerform at most passes of mode inference (default: 30).\",\n \"--event-set-file-name \",\n \"\\tGet the specification of user-defined events from .\"\n ]).\n\n\n:- pred options_help_ctgc(io::di, io::uo) is det.\n\noptions_help_ctgc -->\n io.write_string(\"\\nCompile Time Garbage Collection Options:\\n\"),\n write_tabbed_lines([\n \"--structure-sharing\",\n \"\\tPerform structure sharing analysis.\",\n \"--structure-sharing-widening \",\n \"\\tPerform widening when the set of structure sharing pairs becomes\",\n \"\\tlarger than . When n=0, widening is not enabled.\",\n \"\\t(default: 0).\",\n \"--structure-reuse, --ctgc\",\n \"\\tPerform structure reuse analysis (Compile Time Garbage \",\n \"\\tCollection).\",\n \"--structure-reuse-constraint {same_cons_id, \",\n \"\\twithin_n_cells_difference}, --ctgc-constraint {same_cons_id,\",\n \"\\twithin_n_cells_difference}\",\n \"\\tConstraint on the way we allow structure reuse. `same_cons_id'\",\n \"\\tspecifies that reuse is only allowed between terms of the same\",\n \"\\ttype and constructor. `within_n_cells_difference' states that\",\n \"\\treuse is allowed as long as the arities between the reused term\",\n \"\\tand new term does not exceed a certain threshold. The threshold \",\n \"\\tneeds to be set using `--structure-reuse-constraint-arg'.\",\n \"\\t(default: within_n_cells_difference, with threshold 0)\",\n \"--structure-reuse-constraint-arg, --ctgc-constraint-arg\",\n \"\\tSpecify the maximum difference in arities between the terms that\",\n \"\\tcan be reused, and the terms that reuse these terms.\",\n \"\\t(default: 0)\"\n\n% This option is for developers only.\n% \"--structure-reuse-max-conditions\",\n% \"\\tSoft limit on the number of reuse conditions to accumulate\",\n% \"\\tfor a procedure. (default: 10)\"\n\n% This option is likely to break many optimisations which haven't been updated.\n% \"--structure-reuse-free-cells\",\n% \"\\tImmediately free cells which are known to be dead but which\",\n% \"\\tcannot be reused.\"\n ]).\n\n:- pred options_help_termination(io::di, io::uo) is det.\n\noptions_help_termination -->\n io.write_string(\"\\nTermination Analysis Options:\\n\"),\n write_tabbed_lines([\n \"--enable-term, --enable-termination\",\n \"\\tAnalyse each predicate to discover if it terminates.\",\n \"--chk-term, --check-term, --check-termination\",\n \"\\tEnable termination analysis, and emit warnings for some\",\n \"\\tpredicates or functions that cannot be proved to terminate.\",\n \"\\tIn many cases where the compiler is unable to prove termination\",\n \"\\tthe problem is either a lack of information about the\",\n \"\\ttermination properties of other predicates, or because language\",\n \"\\tconstructs (such as higher order calls) were used which could\",\n \"\\tnot be analysed. In these cases the compiler does not emit a\",\n \"\\twarning of non-termination, as it is likely to be spurious.\",\n \"--verb-chk-term, --verb-check-term, --verbose-check-termination\",\n \"\\tEnable termination analysis, and emit warnings for all\",\n \"\\tpredicates or functions that cannot be proved to terminate.\",\n \"--term-single-arg , --termination-single-argument-analysis \",\n \"\\tWhen performing termination analysis, try analyzing\",\n \"\\trecursion on single arguments in strongly connected\",\n \"\\tcomponents of the call graph that have up to procedures.\",\n \"\\tSetting this limit to zero disables single argument analysis.\",\n \"--termination-norm {simple, total, num-data-elems}\",\n \"\\tThe norm defines how termination analysis measures the size\",\n \"\\tof a memory cell. The `simple' norm says that size is always\",\n \"\\tone. The `total' norm says that it is the number of words\",\n \"\\tin the cell. The `num-data-elems' norm says that it is the\",\n \"\\tnumber of words in the cell that contain something other\",\n \"\\tthan pointers to cells of the same type.\",\n \"--term-err-limit , --termination-error-limit \",\n \"\\tPrint at most reasons for any single termination error\",\n \"\\t(default: 3).\",\n \"--term-path-limit , --termination-path-limit \",\n \"\\tPerform termination analysis only on predicates\",\n \"\\twith at most paths (default: 256).\"\n\n% The following options are used to control the new termination analyser.\n% They are currently disabled because that is still a work-in-progress.\n%\n% \"--enable-term2, --enable-termination2\",\n% \"\\tAnalyse each predicate to discover if it terminates. \",\n% \"\\tThis uses an alternative termination analysis based\",\n% \"\\ton convex constraints.\",\n% \"--chk-term2, --check-termination2\",\n% \"\\tEnable the alternative termination analysis, and emit warnings for\",\n% \"\\tsome predicates or functions that cannot be proved to terminate. In\",\n% \"\\tmany cases where the compiler is unable to prove termination\",\n% \"\\tthe problem is either a lack of information about the\",\n% \"\\ttermination properties of other predicates, or because language\",\n% \"\\tconstructs (such as higher order calls) were used which could\",\n% \"\\tnot be analysed. In these cases the compiler does not emit a\",\n% \"\\twarning of non-termination, as it is likely to be spurious.\",\n% \"--verb-chk-term2, --verb-check-term2, --verbose-check-termination2\",\n% \"--termination2-norm {simple, total, num-data-elems}\",\n% \"\\tTell the alternative termination analyser which norm to use.\",\n% \"\\tSee the description of the `--termination-norm' option for a\",\n% \"\\tdescription of the different types of norm available.\"\n% \"--term2-widening-limit , --termination2-widening-limit \",\n% \"\\tSet the threshold for the number of iterations after which the\",\n% \"\\targument size analyser invokes widening.\",\n% \"--term2-propagate-failure-constrs, --termination2-propagate-failure-constraints\",\n% \"\\tMake the argument analyser infer information about the sizes of any\"\n% \"\\tinputs to a goal in contexts where that goal fails.\"\n% \"--term2-max-matrix-size , --termination2-maximum-matrix-size \",\n% \"\\tLimit the sizes of constraints systems in the analyser to \",\n% \"\\tconstraints. Use approximations of some constraint operations,\",\n% \"\\tsuch as projection, if this threshold is exceeded. This will\",\n% \"\\tspeed up the analysis at the cost of reduced precision.\",\n\n% This option is for developers only.\n% It is useful for benchmarking the argument size analysis.\n% \"--term2-argument-size-analysis-only, --term2-arg-size-analysis-only\",\n% \"\\tPerform argument size analysis on each SCC but do not\",\n% \"\\tattempt to infer termination,\"\n ]).\n\n:- pred options_help_compilation_model(io::di, io::uo) is det.\n\noptions_help_compilation_model -->\n io.write_string(\"\\nCompilation model options:\\n\"),\n write_tabbed_lines([\n \"The following compilation options affect the generated\",\n \"code in such a way that the entire program must be\",\n \"compiled with the same setting of these options,\",\n \"and it must be linked to a version of the Mercury\",\n \"library which has been compiled with the same setting.\",\n \"\",\n \"-s , --grade \",\n \"\\tSelect the compilation model. The should be one of\",\n \"\\tthe base grades `none', `reg', `jump', `asm_jump', `fast', \",\n \"\\t`asm_fast', `hl', `hlc', `il', or `java',\",\n% The hl, hl_nest, and hlc_nest are not yet documented, because\n% the --high-level-data option is not yet supported for C,\n% and the --gcc-nested-functions option is not yet documented.\n% The ilc grade is not documented because it is not useful;\n% it has been superceded by the il grade.\n \"\\tor one of those with one or more of the grade modifiers\",\n \"\\t`.gc', `.mps', `.prof', `.memprof', `.profdeep', `.tr',\",\n \"\\t`.spf', `.stseg', `.debug', `.par' and/or `.pic_reg' appended.\",\n \"\\tDepending on your particular installation, only a subset\",\n \"\\tof these possible grades will have been installed.\",\n \"\\tAttempting to use a grade which has not been installed\",\n \"\\twill result in an error at link time.\"\n ]),\n\n io.write_string(\"\\n Target selection compilation model options:\\n\"),\n write_tabbed_lines([\n \"--target c\\t\\t\\t(grades: none, reg, jump, fast,\",\n \"\\t\\t\\t\\t\\tasm_jump, asm_fast, hl, hlc)\",\n \"--target il\\t\\t\\t(grades: il)\",\n \"--target csharp\\t\\t\\t(grades: csharp)\",\n \"--target java\\t\\t\\t(grades: java)\",\n \"--target erlang\\t\\t\\t(grades: erlang)\",\n \"\\tSpecify the target language: C, IL, C#, Java or Erlang.\",\n \"\\tThe default is C. \"\"IL\"\" (also known as \"\"CIL\"\" or \"\"MSIL\"\")\",\n \"\\tis the Intermediate Language for the .NET Common Language\",\n \"\\tRuntime.\",\n \"\\tTargets other than C imply `--high-level-code' (see below).\",\n\n% IL options are commented out to reduce confusion.\n% \"--il\",\n% \"\\tAn abbreviation for `--target il'.\",\n% \"--il-only\",\n% \"\\tAn abbreviation for `--target il --target-code-only'.\",\n% \"\\tGenerate IL code in `.il', but do not generate\",\n% \"\\tobject code.\",\n%\n% \"--dotnet-library-version \",\n% \"\\tThe version number for the mscorlib assembly distributed\",\n% \"\\twith the Microsoft .NET SDK.\",\n%\n% \"--no-support-ms-clr\",\n% \"\\tDon't use MS CLR specific workarounds in the generated code.\",\n%\n% \"--support-rotor-clr\",\n% \"\\tUse specific workarounds for the ROTOR CLR in the generated\",\n% \"\\tcode.\",\n\n \"--csharp\",\n \"\\tAn abbreviation for `--target csharp'.\",\n \"--csharp-only\",\n \"\\tAn abbreviation for `--target csharp --target-code-only'.\",\n \"\\tGenerate C# code in `.cs', but do not generate\",\n \"\\tobject code.\",\n\n \"--java\",\n \"\\tAn abbreviation for `--target java'.\",\n \"--java-only\",\n \"\\tAn abbreviation for `--target java --target-code-only'.\",\n \"\\tGenerate Java code in `.java', but do not generate\",\n \"\\tobject code.\",\n\n \"--erlang\",\n \"\\tAn abbreviation for `--target erlang'.\",\n \"--erlang-only\",\n \"\\tAn abbreviation for `--target erlang --target-code-only'.\",\n \"\\tGenerate Erlang code in `.erl', but do not generate\",\n \"\\tobject code.\",\n\n \"--compile-to-c\",\n \"\\tAn abbreviation for `--target c --target-code-only'.\",\n \"\\tGenerate C code in `.c', but do not generate object\",\n \"\\tcode.\"\n ]),\n\n io.write_string(\"\\n Optional feature compilation model options:\\n\"),\n io.write_string(\" Debugging\\n\"),\n write_tabbed_lines([\n \"--debug\\t\\t\\t\\t(grade modifier: `.debug')\",\n \"\\tEnable Mercury-level debugging.\",\n \"\\tSee the Debugging chapter of the Mercury User's Guide\",\n \"\\tfor details.\",\n \"\\tThis option is not yet supported for the `--high-level-code'\",\n \"\\tback-ends.\",\n \"--decl-debug\\t\\t\\t\\t(grade modifier: `.decldebug')\",\n \"\\tEnable full support for declarative debugging.\",\n \"\\tThis allows subterm dependency tracking in the declarative\",\n \"\\tdebugger.\",\n \"\\tSee the Debugging chapter of the Mercury User's Guide\",\n \"\\tfor details.\",\n \"\\tThis option is not yet supported for the `--high-level-code'\",\n \"\\tback-ends.\"\n% XXX The source-to-source debugging transform is not ready for public\n% consumption.\n% \"--ss-debug\\t\\t\\t\\t(grade modifier: `.ssdebug')\",\n% \"\\tEnable the source-to-source debugging transform.\"\n ]),\n io.write_string(\" Profiling\\n\"),\n write_tabbed_lines([\n \"-p, --profiling, --time-profiling\",\n \"\\t\\t\\t\\t(grade modifier: `.prof')\",\n \"\\tEnable time and call profiling. Insert profiling hooks in the\",\n \"\\tgenerated code, and also output some profiling\",\n \"\\tinformation (the static call graph) to the file\",\n \"\\t`.prof'.\",\n \"\\tThis option is not supported for the IL, C# or Java back-ends.\",\n \"--memory-profiling\\t\\t(grade modifier: `.memprof')\",\n \"\\tEnable memory and call profiling.\",\n \"\\tThis option is not supported for the IL, C# or Java back-ends.\",\n \"--deep-profiling\\t\\t(grade modifier: `.profdeep')\",\n \"\\tEnable deep profiling.\",\n \"\\tThis option is not supported for the high-level C, IL, C#\",\n \"\\tor Java back-ends.\",\n\n% This option is not documented, it is intended for use by developers only.\n%\n% \"--pre-prof-transforms-simplify\",\n% \"\\tForce the pre-profiling simplification pass that is usually\",\n% \"\\tenabled when building a profiling version of a program. This\",\n% \"\\tallows a developer to enable this pass when using a\",\n% \"\\tnon-profiling build. It can be used to test that generated code\",\n% \"\\tintroduced in earlier passes is well-formed before it is\",\n% \"\\tpotentially removed by the dead procedure elimination pass later\",\n% \"\\ton.\",\n%\n\n% XXX The following options are not documented,\n% because they are currently not useful.\n% The idea was for you to be able to use --profile-calls\n% and --profile-time separately, but that doesn't work\n% because compiling with --profile-time instead of\n% --profile-calls results in different code addresses,\n% so you can't combine the data from versions of\n% your program compiled with different options.\n%\n% \"--profile-calls\\t\\t(grade modifier: `.profcalls')\",\n% \"\\tSimilar to `--profiling', except that only gathers\",\n% \"\\tcall counts, not timing information.\",\n% \"\\tUseful on systems where time profiling is not supported,\",\n% \"\\tbut not as useful as `--memory-profiling'.\",\n% \"--profile-time\\t\\t(grade modifier: `.proftime')\",\n% \"\\tSimilar to `--profiling', except that it only gathers\",\n% \"\\ttiming information, not call counts.\",\n% \"--profile-memory\\t\\t(grade modifier: `.profmem')\",\n% \"\\tSimilar to `--memory-profiling', except that it only\",\n% \"\\tgathers memory usage information, not call counts.\",\n\n \"--no-coverage-profiling\",\n \"\\tDisable coverage profiling.\",\n% The following options are for implementors only (intended for experiments).\n% \"--coverage-profiling-via-calls\",\n% \"\\tUse calls to implement coverage points, not inline foreign code.\",\n\n% \"--coverage-profiling-static\",\n% \"\\tDisable dynamic coverage profiling, this uses less memory and may \",\n% \"\\tbe faster.\",\n\n% \"Switches to effect coverage profiling (part of deep profiling). \",\n% \"they enable different types of coverage points.\",\n\n% \"--no-profile-deep-coverage-after-goal\",\n% \"\\tDisable coverage points after goals.\",\n% \"--no-profile-deep-coverage-branch-ite\",\n% \"\\tDisable coverage points at the beginning of then and else\",\n% \"\\tbranches.\",\n% \"--no-profile-deep-coverage-branch-switch\",\n% \"\\tDisable coverage points at the beginning of switch branches.\",\n% \"--no-profile-deep-coverage-branch-disj\",\n% \"\\tDisable coverage points at the beginning of disjunction branches.\",\n\n% I beleive these options are broken - pbone.\n% \"Switches to tune the coverage profiling pass, useful for \",\n% \"debugging.\",\n%\n% \"--no-profile-deep-coverage-use-portcounts\",\n% \"\\tTurn off usage of port counts in the deep profiler to provide\",\n% \"\\tsome coverage information.\",\n% \"--no-profile-deep-coverage-use-trivial\",\n% \"\\tTurn off usage of trivial goal information\",\n\n \"--profile-for-feedback\",\n \"\\tSelect deep profiling options suitable for profiler directed\",\n \"\\timplicit parallelism.\",\n \"\\t--profile-for-implicit-parallelism is a deprecated synonym for\",\n \"\\tthis option\",\n\n \"--record-term-sizes-as-words\\t\\t(grade modifier: `.tsw')\",\n \"\\tAugment each heap cells with its size in words.\",\n \"--record-term-sizes-as-cells\\t\\t(grade modifier: `.tsc')\",\n \"\\tAugment each heap cells with its size in cells.\",\n\n \"--experimental-complexity=\\t\\t\",\n \"\\tEnable experimental complexity analysis for the predicates\",\n \"\\tlisted in the given file.\",\n \"\\tThis option is supported for the C back-end, with\",\n \"\\t--no-highlevel-code.\",\n\n \"--threadscope\\t\\t(grade modifier: `.threadscope')\",\n \"\\tEnable support for profiling parallel execution.\",\n \"\\tThis option is supported by the low-level C back-end parallel\",\n \"\\tgrades on some processors, See README.ThreadScope for details.\"\n ]),\n\n io.write_string(\" Miscellaneous optional features\\n\"),\n write_tabbed_lines([\n \"--gc {none, boehm, hgc, mps, accurate, automatic}\",\n \"--garbage-collection {none, boehm, hgc, mps, accurate, automatic}\",\n \"\\t\\t\\t\\t(`java', `csharp', `il' and `erlang'\",\n \"\\t\\t\\t\\t\\tgrades use `--gc automatic',\",\n \"\\t\\t\\t\\t`.gc' grades use `--gc boehm',\",\n \"\\t\\t\\t\\t`.hgc' grades use `--gc hgc',\",\n \"\\t\\t\\t\\t`.mps' grades use `--gc mps',\",\n \"\\t\\t\\t\\tother grades use `--gc none'.)\",\n \"\\tSpecify which method of garbage collection to use\",\n \"\\t(default: boehm).\",\n \"\\t`boehm' is Hans Boehm et al's conservative collector.\",\n \"\\t`hgc' is our own conservative collector;\",\n \"\\t`accurate' is our own type-accurate copying GC;\",\n \"\\tit requires `--high-level-code'.\",\n \"\\t`mps' is a different conservative collector, based on\",\n \"\\tRavenbrook Limited's MPS (Memory Pool System) kit.\",\n \"\\t`automatic' means the target language provides it.\",\n \"\\tThis is the case for the IL, C#, Java and Erlang back-ends,\",\n \"\\twhich always use the garbage collector of the underlying\",\n \"\\timplementation.\",\n \"--use-trail\\t\\t\\t(grade modifier: `.tr')\",\n \"\\tEnable use of a trail.\",\n \"\\tThis is necessary for interfacing with constraint solvers,\",\n \"\\tor for backtrackable destructive update.\",\n \"\\tThis option is not yet supported for the IL, C# or Java back-ends.\",\n \"--trail-segments\\t\\t\\t(grade modifier: `.trseg')\",\n \"\\tAs above, but use a dynamically sized trail that is composed\",\n \"\\tof small segments. This can help to avoid trail exhaustion\",\n \"\\tat the cost of increased execution time.\",\n \"--parallel\\t\\t(grade modifier: `.par')\",\n \"\\tEnable parallel execution support for the low-level C grades.\",\n \"\\tEnable concurrency (via pthreads) for the high-level C grades.\",\n \"--maybe-thread-safe {yes, no}\",\n \"\\tSpecify how to treat the `maybe_thread_safe' foreign code\",\n \"\\tattribute. `yes' means that a foreign procedure with the\",\n \"\\t`maybe_thread_safe' option is treated as though it has a\",\n \"\\t`thread_safe' attribute. `no' means that the foreign\",\n \"\\tprocedure is treated as though it has a `not_thread_safe'\",\n \"\\tattribute. The default is no.\",\n \"--single-prec-float\\t\\t(grade modifier: `.spf')\",\n \"\\tUse single precision floats so that, on 32-bit machines,\",\n \"\\tfloating point values don't need to be boxed. Double\",\n \"\\tprecision floats are used by default.\"\n % This is commented out as this feature is still experimental.\n %\"--extend-stacks-when-needed\",\n %\"\\tSpecify that code that increments a stack pointer must\",\n %\"\\textend the stack when this is needed.\",\n % RBMM is undocumented since it is still experimental.\n % should also document rbmmd rbmmp rbmmdp\n %\"--use-regions\\t\\t(grade modifier: `.rbmm')\",\n %\"\\tEnable support for region-based memory managment.\"\n %\"--use-alloc-regions\",\n %\"\\tCompute and use the exact set of regions\",\n %\"\\t that may be allocated into by a call.\"\n ]),\n\n io.write_string(\"\\n LLDS back-end compilation model options:\\n\"),\n write_tabbed_lines([\n\n \"--gcc-global-registers\\t\\t(grades: reg, fast, asm_fast)\",\n \"--no-gcc-global-registers\\t(grades: none, jump, asm_jump)\",\n \"\\tSpecify whether or not to use GNU C's\",\n \"\\tglobal register variables extension.\",\n \"\\tThis option is ignored if the `--high-level-code' option is\",\n \"\\tenabled.\",\n \"--gcc-non-local-gotos\\t\\t(grades: jump, fast, asm_jump, asm_fast)\",\n \"--no-gcc-non-local-gotos\\t(grades: none, reg)\",\n \"\\tSpecify whether or not to use GNU C's\",\n \"\\t\"\"labels as values\"\" extension.\",\n \"\\tThis option is ignored if the `--high-level-code' option is\",\n \"\\tenabled.\",\n \"--asm-labels\\t\\t\\t(grades: asm_jump, asm_fast)\",\n \"--no-asm-labels\\t\\t\\t(grades: none, reg, jump, fast)\",\n \"\\tSpecify whether or not to use GNU C's\",\n \"\\tasm extensions for inline assembler labels.\",\n \"\\tThis option is ignored if the `--high-level-code' option is\",\n \"\\tenabled.\",\n \"--pic-reg\\t\\t\\t(grade modifier: `.pic_reg')\",\n \"[For Unix with intel x86 architecture only]\",\n \"\\tSelect a register usage convention that is compatible,\",\n \"\\twith position-independent code (gcc's `-fpic' option).\",\n \"\\tThis is necessary when using shared libraries on Intel x86\",\n \"\\tsystems running Unix. On other systems it has no effect.\",\n \"--stack-segments\\t\\t(grade modifier: `.stseg')\",\n \"\\tSpecify whether to use dynamically sized stacks that are\",\n \"\\tcomposed of small segments. This can help to avoid stack\",\n \"\\texhaustion at the cost of increased execution time.\",\n \"\\tThis option is ignored if the `--high-level-code' option is\",\n \"\\tenabled.\"\n % This is a developer only option.\n% \"--use-float-registers\",\n% \"(This option is not for general use.)\",\n% \"\\tUse float registers for argument passing.\"\n ]),\n\n io.write_string(\"\\n MLDS back-end compilation model options:\\n\"),\n write_tabbed_lines([\n% These grades (hl_nest, and hlc_nest) are not yet documented,\n% because the --gcc-nested-functions option is not yet documented.\n% \"-H, --high-level-code\\t\\t\\t(grades: hl_nest, hlc_nest)\",\n% The ilc grade is not documented because it is not useful;\n% it has been superceded by the il grade.\n \"-H, --high-level-code\\t\\t\\t(grades: hl, hlc, il, csharp, java)\",\n \"\\tUse an alternative back-end that generates high-level code\",\n \"\\trather than the very low-level code that is generated by our\",\n \"\\toriginal back-end.\",\n% The hl_nest grade is not yet documented,\n% because the --gcc-nested-functions option is not yet documented.\n% because it is not yet supported\n% \"--high-level-data\\t\\t\\t(grades: hl, hl_nest, il, csharp, java)\",\n \"--high-level-data\\t\\t\\t(grades: hl, il, csharp, java)\",\n \"\\tUse an alternative higher-level data representation.\",\n% \"--high-level\\t\\t\\t(grades: hl, hl_nest, il, csharp, java)\",\n \"--high-level\\t\\t\\t(grades: hl, il, csharp, java)\",\n \"\\tAn abbreviation for `--high-level-code --high-level-data'.\"\n% The --gcc-nested-functions option is not yet documented,\n% because it doesn't pass our test suite, and it is\n% probably not very useful.\n% \"--gcc-nested-functions\\t\\t(grades: hl_nest, hlc_nest)\",\n% \"\\tSpecify whether or not to use GNU C's nested functions extension.\",\n% \"\\tThis option is ignored if the `--high-level-code' option is not enabled.\",\n% The --det-copy-out option is not yet documented,\n% because it is not yet tested much and probably not very useful,\n% except for Java, where it is the default.\n% \"--det-copy-out\",\n% \"\\tSpecify whether to handle output arguments for det/semidet\",\n% \"\\tprocedures using return-by-value rather than pass-by-reference.\",\n% \"\\tThis option is ignored if the `--high-level-code' option is not enabled.\",\n% The --nondet-copy-out option is not yet documented,\n% because it is probably not very useful except for IL and Java,\n% where it is the default.\n% \"--nondet-copy-out\\t\\t(grades: il, ilc)\",\n% \"\\tSpecify whether to handle output arguments for nondet\",\n% \"\\tprocedures using pass-by-value rather than pass-by-reference.\",\n% \"\\tThis option is ignored if the `--high-level-code' option is not enabled.\",\n% The --put-commit-in-own-func option is not documented because\n% it is enabled automatically (by handle_options) in the situations\n% where it is needed; the user should never need to set it.\n% \"--put-commit-in-own-func\",\n% \"\\tPut each commit in its own C function.\",\n% \"\\tThis option only affects the MLDS back-ends.\",\n% \"\\tIt is needed for the high-level C back-end,\",\n% \"\\twhere commits are implemented via setjmp()/longjmp(),\",\n% \"\\tsince longjmp() may clobber any non-volatile local vars\",\n% \"\\tin the function that called setjmp().\",\n% The --put-nondet-env-on-heap option is not documented because\n% it is enabled automatically (by handle_options) in the situations\n% where it is needed; the user should never need to set it.\n% \"--put-nondet-env-on-heap\",\n% \"\\tAllocate the environment structures used for\",\n% \"\\tnondeterministic Mercury procedures on the heap,\",\n% \"\\trather than on the stack.\"\n% ]),\n% io.write_string(\"\\n IL back-end compilation model options:\\n\"),\n% write_tabbed_lines([\n%\n% The --verifiable-code option is not yet documented because it is not yet fully\n% implemented.\n% \"--verifiable, --verifiable-code\\t\\t\\t\",\n% \"\\tEnsure that the generated IL code is verifiable.\",\n%\n% The --il-refany-fields option is not documented because currently there\n% are no IL implementations for which it is useful.\n% \"--il-refany-fields\",\n% \"\\tGenerate IL code that assumes that the CLI implementation\",\n% \"\\tsupports value types with fields of type `refany'.\",\n% \"\\tUsing this option could in theory allow more efficient\",\n% \"\\tverifiable IL code for nondeterministic Mercury procedures,\",\n% \"\\tif the CLI implementation supported it.\"\n% \"\\tHowever, the current Microsoft CLR does not support it.\"\n%\n% The --il-byref-tailcalls option is not documented because currently there\n% are no IL implementations for which it is useful.\n% \"--il-byref-tailcalls\",\n% \"\\tGenerate IL code that assumes that the CLI verifier\",\n% \"\\tsupports tail calls with byref arguments.\"\n%\n% The --il-funcptr-types option is not documented because it is not yet\n% implemented.\n% \"--il-funcptr-types\",\n% \"\\tGenerate IL code that assumes that the IL assembler\",\n% \"\\tsupports function pointer types.\"\n% \"\\tThe ECMA CLI specification allows function pointer types,\"\n% \"\\tbut some CLR implementations, e.g. the old Beta 2 version of\"\n% \"\\tthe Microsoft CLR implementation, do not support them.\"\n ]),\n\n io.write_string(\"\\n Developer compilation model options:\\n\"),\n io.write_string(\"\\n Data representation\\n\"),\n write_tabbed_lines([\n \"--tags {none, low, high} (This option is not for general use.)\",\n \"\\tSpecify whether to use the low bits or the high bits of \",\n \"\\teach word as tag bits (default: low).\",\n % \"\\t\\t`--tags none' implies `--num-tag-bits 0'.\",\n \"--num-tag-bits (This option is not for general use.)\",\n \"\\tUse tag bits.\",\n \"--num-reserved-addresses (This option is not for general use.)\",\n \"\\tTreat the integer values from 0 up to - 1 as reserved\",\n \"\\taddresses that can be used to represent nullary constructors\",\n \"\\t(constants) of discriminated union types.\",\n \"--num-reserved-objects (This option is not for general use.)\",\n \"\\tAllocate up to global objects per type,\",\n \"\\tfor representing nullary constructors\",\n \"\\t(constants) of discriminated union types.\"\n\n % The --conf-low-tag-bits option is reserved for use\n % by the `mmc' script; it is deliberately not documented.\n\n % The --bits-per-word option is intended for use\n % by the `mmc' script; it is deliberately not documented.\n\n % The --bytes-per-word option is intended for use\n % by the `mmc' script; it is deliberately not documented.\n\n % This is a developer only option.\n% \"--unboxed-float\",\n% \"(This option is not for general use.)\",\n% \"\\tDon't box floating point numbers.\",\n% \"\\tThis assumes that a Mercury float will fit in a word.\",\n% \"\\tThe C code needs to be compiled with `-UBOXED_FLOAT'.\",\n% \"\\tIt may also need to be compiled with\",\n% \"\\t`-DUSE_SINGLE_PREC_FLOAT', if double precision\",\n% \"\\tfloats don't fit into a word.\"\n\n % This is a developer only option.\n% \"--no-unboxed-enums\",\n% \"(This option is not for general use.)\",\n% \"\\tBox enumerations. This option is disabled by default.\",\n\n % This is a developer only option.\n% \"--no-unboxed-no-tag-types\",\n% \"(This option is not for general use.)\",\n% \"\\tBox no-tag types. This option is disabled by default.\"\n\n ]),\n io.write_string(\"\\n Developer optional features\\n\"),\n write_tabbed_lines([\n \"--use-minimal-model-stack-copy\",\n \"(This option is not for general use.)\",\n \"\\tEnable the use of the standard form of minimal model tabling.\",\n\n \"--use-minimal-model-own-stacks\",\n \"(This option is not for general use.)\",\n \"\\tEnable the use of an experimental form of minimal model tabling.\",\n\n \"--minimal-model-debug\",\n \"(This option is not for general use.)\",\n \"\\tEnables extra data structures that assist in debugging\",\n \"\\tminimal model tabling.\",\n\n \"--no-type-layout\",\n \"(This option is not for general use.)\",\n \"\\tDon't output type_ctor_layout structures or references\",\n \"\\tto them. (The C code also needs to be compiled with\",\n \"\\t`-DNO_TYPE_LAYOUT').\"\n\n % This is a developer only option.\n% \"--basic-stack-layout\",\n% \"(This option is not for general use.)\",\n% \"\\tGenerate the simple stack_layout structures required\",\n% \"\\tfor stack traces.\",\n\n % This is a developer only option.\n% \"--agc-stack-layout\",\n% \"(This option is not for general use.)\",\n% \"\\tGenerate the stack_layout structures required for\",\n% \"\\taccurate garbage collection.\",\n\n % This is a developer only option.\n% \"--procid-stack-layout\",\n% \"(This option is not for general use.)\",\n% \"\\tGenerate the stack_layout structures required for\",\n% \"\\tlooking up procedure identification information.\",\n\n % This is a developer only option.\n% \"--trace-stack-layout\",\n% \"(This option is not for general use.)\",\n% \"\\tGenerate the stack_layout structures required for\",\n% \"\\texecution tracing.\",\n\n % This is a developer only option.\n% \"--body-typeinfo-liveness\",\n% \"(This option is not for general use.)\",\n% For documentation, see the comment in the type declaration.\n\n % This is a developer only option.\n% \"--can-compare-constants-as-ints\",\n% \"(This option is not for general use.)\",\n% For documentation, see the comment in the type declaration.\n\n % This is a developer only option.\n% \"--pretest-equality-cast-pointers\",\n% \"(This option is not for general use.)\",\n% For documentation, see the comment in the type declaration.\n\n % This is a developer only option.\n% \"--can-compare-compound-values\"\n% \"(This option is not for general use.)\",\n% For documentation, see the comment in the type declaration.\n\n % This is a developer only option.\n% \"--lexically-order-constructors\"\n% \"(This option is not for general use.)\",\n% For documentation, see the comment in the type declaration.\n\n % This is a developer only option.\n% \"--mutable-always-boxed\",\n% \"(This option is not for general use.)\",\n% For documentation, see the comment in the type declaration.\n\n % This is a developer only option.\n% \"--delay-partial-instantiations\",\n% \"(This option is not for general use.)\",\n% For documentation, see delay_partial_inst.m\n\n % This is a developer only option.\n% \"--allow-defn-of-builtins\",\n% \"(This option is not for general use.)\",\n% For documentation, see the comment in the type declaration.\n\n % This is a developer only option.\n% \"--special-preds\",\n% \"(This option is not for general use.)\",\n% For documentation, see the comment in the type declaration.\n\n % All these are developer only options.\n% \"(These options are not for general use.)\",\n% For documentation, see runtime/mercury_region.h.\n% \"--size-region-ite-fixed\"\n% \"--size-region-disj-fixed\"\n% \"--size-region-commit-fixed\"\n% \"--size-region-ite-protect\"\n% \"--size-region-ite-snapshot\"\n% \"--size-region-disj-protect\"\n% \"--size-region-disj-snapshot\"\n% \"--size-region-commit-entry\"\n\n % This is a developer only option.\n% \"--solver-type-auto-init\",\n% \"(This option is not for general use.)\",\n% Allow automatic initialisation of solver types.\n\n % This is a developer only option.\n% \"--allow-multi-arm-switches\",\n% \"(This option is not for general use.)\",\n% Allow the compiler to generate switches in which one arm handles\n% more than one cons_id.\n\n % This is a developer only option.\n% \"--type-check-constraints\",\n% \"(This option is not for general use.)\",\n% Use the constraint based type checker instead of the old one.\n\n % This is a developer only option.\n% \"--allow-argument-packing\",\n% \"(This option is not for general use.)\",\n% Allow the compiler to pack multiple constructor arguments into\n% a single field.\n ]).\n\n:- pred options_help_code_generation(io::di, io::uo) is det.\n\noptions_help_code_generation -->\n io.write_string(\"\\nCode generation options:\\n\"),\n write_tabbed_lines([\n% \"--low-level-debug\",\n% \"\\tEnables various low-level debugging stuff, that was in\",\n% \"\\tthe distant past used to debug the low-level code generation.\",\n% \"\\tYou don't want to use this option unless you are hacking\",\n% \"\\tthe Mercury compiler itself (and probably not even then).\",\n% \"\\tCauses the generated code to become VERY big and VERY\",\n% \"\\tinefficient. Slows down compilation a LOT.\",\n\n% \"--table-debug\",\n% \"\\tEnables the generation of code that helps to debug tabling\",\n% \"\\tprimitives.\",\n\n \"--no-trad-passes\",\n \"\\tThe default `--trad-passes' completely processes each predicate\",\n \"\\tbefore going on to the next predicate.\",\n \"\\tThis option tells the compiler\",\n \"\\tto complete each phase of code generation on all predicates\",\n \"\\tbefore going on the next phase on all predicates.\",\n % \"--parallel-liveness\",\n % \"Use multiple threads when computing liveness.\",\n % \"At the moment this option implies `--no-trad-passes',\",\n % \"and requires the compiler to be built in a\",\n % \"low-level parallel grade and running with multiple engines.\",\n % \"--parallel-code-gen\",\n % \"Use multiple threads when generating code.\",\n % \"At the moment this option implies `--no-trad-passes',\",\n % \"and requires the compiler to be built in a\",\n % \"low-level parallel grade and running with multiple engines.\",\n % \"\\t--no-polymorphism\",\n % \"\\t\\tDon't handle polymorphic types.\",\n % \"\\t\\t(Generates slightly more efficient code, but stops\",\n % \"\\t\\tpolymorphism from working except in special cases.)\",\n \"--no-reclaim-heap-on-nondet-failure\",\n \"\\tDon't reclaim heap on backtracking in nondet code.\",\n \"--no-reclaim-heap-on-semidet-failure\",\n \"\\tDon't reclaim heap on backtracking in semidet code.\",\n \"--no-reclaim-heap-on-failure\",\n \"\\tCombines the effect of the two options above.\",\n\n \"--max-jump-table-size=\",\n \"\\tThe maximum number of entries a jump table can have.\",\n \"\\tThe special value 0 indicates the table size is unlimited.\",\n \"\\tThis option can be useful to avoid exceeding fixed limits\",\n \"\\timposed by some C compilers.\",\n\n % This is a developer only option.\n% \"--compare-specialization=\",\n% \"\\tGenerate quadratic instead of linear compare predicates for\",\n% \"\\ttypes with up to n function symbols. Higher values of n lead to\",\n% \"\\tfaster but also bigger compare predicates.\",\n\n % This is a developer only option.\n% \"--no-should-pretest-equality\",\n% \"\\tIf specified, do not add a test for the two values being equal\",\n% \"\\tas words to the starts of potentially expensive unify and compare\",\n% \"\\tpredicates.\"\n\n \"--fact-table-max-array-size \",\n \"\\tSpecify the maximum number of elements in a single\",\n \"\\t`:- pragma fact_table' data array (default: 1024).\",\n \"--fact-table-hash-percent-full \",\n \"\\tSpecify how full the `:- pragma fact_table' hash tables\",\n \"\\tshould be allowed to get. Given as an integer percentage\",\n \"\\t(valid range: 1 to 100, default: 90).\"\n\n% This option is not yet documented because the `--gcc-nested-functions' option\n% is not documented.\n% \"--gcc-local-labels\",\n% \"\\tThis option has no effect unless both the `--high-level-code' option\",\n% \"\\tand the `--gcc-nested-functions' options are enabled.\",\n% \"\\tIf this option is enabled, the Mercury compiler will generate\",\n% \"\\tC code that uses GNU C's local labels extension to allow\",\n% \"\\tGNU C nested functions to exit into their containing function\",\n% \"\\tvia a `goto'.\",\n% \"\\tIf this option is not enabled, the default behaviour is to\",\n% \"\\tuse the standard ANSI/ISO C setjmp() and longjmp() functions.\"\n\n% This option is not yet documented because it is not yet useful -- currently\n% we don't take advantage of GNU C's computed gotos extension.\n% \"--no-prefer-switch\",\n% \"\\tGenerate code using computed gotos rather than switches.\",\n% \"\\tThis makes the generated code less readable, but potentially\",\n% \"\\tslightly more efficient.\",\n% \"\\tThis option has no effect unless the `--high-level-code' option\",\n% \"\\tis enabled. It also has no effect if the `--target' option is\",\n% \"\\tset to `il'.\",\n% This optimization is for implementors only. Turning this option on provides\n% the fairest possible test of --optimize-saved-vars-cell.\n% \"--no-opt-no-return-calls\",\n% \"\\tDo not optimize the stack usage of calls that cannot return.\",\n\n ]),\n\n io.write_string(\"\\n Code generation target options:\\n\"),\n write_tabbed_lines([\n \"--branch-delay-slot \\t(This option is not for general use.)\",\n \"\\tAssume that branch instructions have a delay slot.\",\n \"--num-real-r-regs \\t(This option is not for general use.)\",\n \"\\tAssume registers r1 up to r are real general purpose\",\n \"\\tregisters.\",\n \"--num-real-f-regs \\t(This option is not for general use.)\",\n \"\\tAssume registers f1 up to f are real floating point\",\n \"\\tregisters.\",\n \"--num-real-r-temps \\t(This option is not for general use.)\",\n \"\\tAssume that non-float temporaries will fit into\",\n \"\\treal machine registers.\",\n \"--num-real-f-temps \\t(This option is not for general use.)\",\n \"\\tAssume that float temporaries will fit into\",\n \"\\treal machine registers.\"\n ]).\n\n:- pred options_help_optimization(io::di, io::uo) is det.\n\noptions_help_optimization -->\n io.write_string(\"\\nOptimization Options:\\n\"),\n write_tabbed_lines([\n \"-O , --opt-level , --optimization-level \",\n \"\\tSet optimization level to .\",\n \"\\tOptimization level -1 means no optimization\",\n \"\\twhile optimization level 6 means full optimization.\",\n % \"\\t\\tFor a full description of each optimization level,\",\n % \"\\t\\tsee the Mercury User's Guide.\",\n \"--opt-space, --optimize-space\",\n \"\\tTurn on optimizations that reduce code size\",\n \"\\tand turn off optimizations that significantly\",\n \"\\tincrease code size.\",\n \"--intermod-opt\",\n \"--intermodule-optimization\",\n \"\\tPerform inlining and higher-order specialization of\",\n \"\\tthe code for predicates imported from other modules.\",\n \"\\tThis option must be set throughout the compilation process.\",\n \"--trans-intermod-opt\",\n \"--transitive-intermodule-optimization\",\n \"\\tImport the transitive intermodule optimization data.\",\n \"\\tThis data is imported from `.trans_opt' files.\",\n \"\\tNote that `--transitive-intermodule-optimization' does not\",\n \"\\twork with `mmc --make'.\",\n \"--no-read-opt-files-transitively\",\n \"\\tOnly read the inter-module optimization information\",\n \"\\tfor directly imported modules, not the transitive\",\n \"\\tclosure of the imports.\",\n \"--use-opt-files\",\n \"\\tPerform inter-module optimization using any\",\n \"\\t`.opt' files which are already built,\",\n \"\\te.g. those for the standard library, but do\",\n \"\\tnot build any others.\",\n \"--use-trans-opt-files\",\n \"\\tPerform inter-module optimization using any\",\n \"\\t`.trans_opt' files which are already built,\",\n \"\\te.g. those for the standard library, but do\",\n \"\\tnot build any others.\",\n \"--intermodule-analysis\",\n \"\\tPerform analyses such as termination analysis and\",\n \"\\tunused argument elimination across module boundaries.\",\n \"\\tThis option is not yet fully implemented.\",\n \"--analysis-repeat \",\n \"\\tThe maximum number of times to repeat analyses of\",\n \"\\tsuboptimal modules with `--intermodule-analysis'\",\n \"\\t(default: 0).\"\n % This is commented out as this feature is still experimental.\n% \"--analysis-file-cache\",\n% \"\\tEnable caching of parsed analysis files. This may\",\n% \"\\timprove compile times with `--intermodule-analysis'.\"\n ]).\n\n:- pred options_help_hlds_hlds_optimization(io::di, io::uo) is det.\n\noptions_help_hlds_hlds_optimization -->\n io.write_string(\"\\n High-level (HLDS -> HLDS) optimizations:\\n\"),\n write_tabbed_lines([\n \"--no-inlining\",\n \"\\tDisable all forms of inlining.\",\n \"--no-inline-simple\",\n \"\\tDisable the inlining of simple procedures.\",\n \"--no-inline-builtins\",\n \"\\tGenerate builtins (e.g. arithmetic operators) as calls to\",\n \"\\tout of line procedures. This is done by default when,\",\n \"\\tdebugging, as without this option the execution of\",\n \"\\tbuiltins is not traced.\",\n \"--no-inline-single-use\",\n \"\\tDisable the inlining of procedures called only once.\",\n \"--inline-call-cost \",\n \"\\tAssume that the cost of a call is the given parameter.\",\n \"\\tUsed only in conjunction with --inline-compound-threshold.\",\n \"\\tmultiplied by the number of times it is called,\",\n \"--inline-compound-threshold \",\n \"\\tInline a procedure if its size (measured roughly\",\n \"\\tin terms of the number of connectives in its internal form)\",\n \"\\tless the assumed call cost, multiplied by the number of times\",\n \"\\tit is called is below the given threshold.\",\n \"--inline-simple-threshold \",\n \"\\tInline a procedure if its size is less than the\",\n \"\\tgiven threshold.\",\n \"--intermod-inline-simple-threshold\",\n \"\\tSimilar to `--inline-simple-threshold', except used to\",\n \"\\tdetermine which predicates should be included in\",\n \"\\t`.opt' files. Note that changing this between writing\",\n \"\\tthe `.opt' file and compiling to C may cause link errors,\",\n \"\\tand too high a value may result in reduced performance.\",\n \"--inline-vars-threshold \",\n \"\\tDon't inline a call if it would result in a procedure\",\n \"\\tcontaining more than variables. Procedures\",\n \"\\tcontaining large numbers of variables can cause\",\n \"\\tslow compilation.\",\n% \"--from-ground-term-threshold \",\n% \"\\tWrap a from_ground_term scope around the expanded,\",\n% \"\\tsuperhomogeneous form of a ground term that involves at least.\",\n% \"\\tthe given number of function symbols.\",\n \"--no-const-struct\",\n \"\\tDisable the gathering of constant structures in a separate table.\",\n \"--no-common-struct\",\n \"\\tDisable optimization of common term structures.\",\n% \"--common-struct-preds \",\n% \"\\tLimit common struct optimization to the preds with the given ids.\",\n\n% Common goal optimization should not be turned off, since it can\n% break programs that would otherwise compile properly (e.g.,\n% benchmarks/icfp2000). This is kept as a developer-only option.\n%\n% \"--no-common-goal\",\n% \"\\tDisable optimization of common goals.\",\n% \"\\tAt the moment this optimization\",\n% \"\\tdetects only common deconstruction unifications.\",\n% \"\\tDisabling this optimization reduces the class of predicates\",\n% \"\\tthat the compiler considers to be deterministic.\",\n\n \"--constraint-propagation\",\n \"\\tEnable the constraint propagation transformation,\",\n \"\\twhich attempts to transform the code so that goals\",\n \"\\twhich can fail are executed as early as possible.\",\n \"--local-constraint-propagation\",\n \"\\tEnable the constraint propagation transformation,\",\n \"\\tbut only rearrange goals within each procedure.\",\n \"\\tSpecialized versions of procedures will not be created.\",\n \"--prev-code\",\n \"\\tMigrate into the start of branched goals.\",\n \"--no-follow-code\",\n \"\\tDon't migrate into the end of branched goals.\",\n \"--excess-assign\",\n \"\\tRemove excess assignment unifications.\",\n \"--no-optimize-format-calls\",\n \"\\tDo not attempt to interpret the format string in calls to\",\n \"\\tstring.format and related predicates at compile time;\",\n \"\\talways leave this to be done at runtime.\",\n \"--optimize-duplicate-calls\",\n \"\\tOptimize away multiple calls to a predicate\",\n \"\\twith the same input arguments.\",\n \"--loop-invariants\",\n \"\\tHoist loop invariants out of loops.\",\n \"--delay-constructs\",\n \"\\tReorder goals to move construction unifications after\",\n \"\\tprimitive goals that can fail.\",\n % \"--optimize-saved-vars-const\",\n % \"\\tMinimize the number of variables saved across calls by\",\n % \"\\tintroducing duplicate copies of variables bound to\",\n % \"\\tconstants in each interval between flushes where they\",\n % \"\\tare needed.\",\n % \"--optimize-saved-vars-cell\",\n % \"\\tMinimize the number of variables saved across calls by\",\n % \"\\ttrying to use saved variables pointing to cells to reach\",\n % \"\\tthe variables stored in those cells.\",\n \"--optimize-saved-vars\",\n \"\\tMinimize the number of variables saved across calls.\",\n \"--optimize-unused-args\",\n \"\\tRemove unused predicate arguments.\",\n \"\\tThis will cause the compiler to generate more\",\n \"\\tefficient code for many polymorphic predicates.\",\n \"--intermod-unused-args\",\n \"\\tPerform unused argument removal across module boundaries.\",\n \"\\tThis option implies `--optimize-unused-args' and\",\n \"\\t`--intermodule-optimization'.\",\n\n \"--optimize-higher-order\",\n \"\\tEnable specialization of higher-order predicates.\",\n \"--type-specialization\",\n \"\\tEnable specialization of polymorphic predicates where the\",\n \"\\tpolymorphic types are known.\",\n \"--user-guided-type-specialization\",\n \"\\tEnable specialization of polymorphic predicates for which\",\n \"\\tthere are `:- pragma type_spec' declarations.\",\n \"--higher-order-size-limit\",\n \"\\tSet the maximum goal size of specialized versions created by\",\n \"\\t`--optimize-higher-order' and `--type-specialization'.\",\n \"\\tGoal size is measured as the number of calls, unifications\",\n \"\\tand branched goals.\",\n \"--higher-order-arg-limit\",\n \"\\tSet the maximum size of higher-order arguments to\",\n \"\\tbe specialized by `--optimize-higher-order' and\",\n \"\\t`--type-specialization'.\",\n \"--unneeded-code\",\n \"\\tRemove goals from computation paths where their outputs are\",\n \"\\tnot needed, provided the semantics options allow the deletion\",\n \"\\tor movement of the goal.\",\n \"--unneeded-code-copy-limit\",\n \"\\tGives the maximum number of places to which a goal may be copied\",\n \"\\twhen removing it from computation paths on which its outputs are\",\n \"\\tnot needed. A value of zero forbids goal movement and allows\",\n \"\\tonly goal deletion; a value of one prevents any increase in the\",\n \"\\tsize of the code.\",\n% \"--unneeded-code-debug\",\n% \"\\tPrint progress messages during the unneeded code elimination\",\n% \"\\tpasses.\",\n% \"--unneeded-code-debug-pred-name \",\n% \"\\tPrint the definition of at the start of each pass\",\n% \"\\tof the unneeded code elimination algorithm.\",\n \"--introduce-accumulators\",\n \"\\tAttempt to introduce accumulating variables into\",\n \"\\tprocedures, so as to make them tail recursive.\",\n% \"--optimize-constructor-last-call-accumulator\",\n% \"\\tEnable the optimization via accumulators of \"\"last\"\" calls\",\n% \"\\tthat are followed by constructor application.\",\n% \"--optimize-constructor-last-call-null\",\n% \"\\tWhen --optimize-constructor-last-call is enabled, put NULL in\"\n% \"\\tuninitialized fields (to prevent the garbage collector from\",\n% \"\\tlooking at and following a random bit pattern).\",\n \"--optimize-constructor-last-call\",\n \"\\tEnable the optimization of \"\"last\"\" calls that are followed by\",\n \"\\tconstructor application.\",\n \"--deforestation\",\n \"\\tEnable deforestation. Deforestation is a program\",\n \"\\ttransformation whose aim is to avoid the construction of\",\n \"\\tintermediate data structures and to avoid repeated traversals\",\n \"\\tover data structures within a conjunction.\",\n \"--deforestation-depth-limit \",\n \"\\tSpecify a depth limit to prevent infinite loops in the\",\n \"\\tdeforestation algorithm.\",\n \"\\tA value of -1 specifies no depth limit. The default is 4.\",\n \"--deforestation-vars-threshold \",\n \"\\tSpecify a rough limit on the number of variables\",\n \"\\tin a procedure created by deforestation.\",\n \"\\tA value of -1 specifies no limit. The default is 200.\",\n \"--deforestation-size-threshold \",\n \"\\tSpecify a rough limit on the size of a goal\",\n \"\\tto be optimized by deforestation.\",\n \"\\tA value of -1 specifies no limit. The default is 15.\",\n \"--analyse-exceptions\",\n \"\\tEnable exception analysis. Identify those\",\n \"\\tprocedures that will not throw an exception.\",\n \"\\tSome optimizations can make use of this information.\",\n% XXX The options controlling closure analysis are currently\n% commented out because it isn't useful. It can be uncommented when\n% we actually have something that uses it.\n% \"--analyse-closures\",\n% \"\\tEnable closure analysis. Try to identify the possible\",\n% \"\\tvalues that higher-order valued variables can take.\",\n% \"\\tSome optimizations can make use of this information.\",\n \"--analyse-trail-usage\",\n \"\\tEnable trail usage analysis. Identify those\",\n \"\\tprocedures that will not modify the trail.\",\n \"\\tThis information is used to reduce the overhead\",\n \"\\tof trailing.\",\n% `--no-optimize-trail-usage' is a developer-only option.\n% It is intended for the benchmarking of trail usage optimization.\n% Otherwise, it should not be turned off as doing so interferes with\n% the results of the trail usage analysis.\n % \"--no-optimize-trail-usage\",\n % \"\\tDo not try and restrict trailing to those parts\",\n % \"\\tof the program that actually use it.\",\n% `--no-optimize-region-ops' is a developer-only option.\n% It is intended for the benchmarking of region ops optimization.\n % \"--no-optimize-region-ops\",\n % \"\\tDo not try and restrict region operations to those parts\",\n % \"\\tof the program that actually use it.\",\n \"--analyse-mm-tabling\",\n \"\\tIdentify those goals that do not call procedures\",\n \"\\tthat are evaluated using minimal model tabling.\",\n \"\\tThis information is used to reduce the overhead\",\n \"\\tof minimal model tabling.\"\n % \"--untuple\",\n % \"\\tExpand out procedure arguments when the argument type\",\n % \"\\tis a tuple or a type with exactly one functor.\",\n % \"\\tNote: this is almost always a pessimization.\",\n % \"--tuple\",\n % \"\\tTry to find opportunities for procedures to pass some\",\n % \"\\targuments to each other as a tuple rather than as\",\n % \"\\tindividual arguments.\",\n % \"\\tNote: so far this has mostly a detrimental effect.\",\n % \"--tuple-trace-counts-file\",\n % \"\\tSupply a trace counts summary file for the tupling\",\n % \"\\ttransformation. The summary should be made from a sample\",\n % \"\\trun of the program you are compiling, compiled without\",\n % \"\\toptimizations.\",\n % \"--tuple-costs-ratio\",\n % \"\\tA value of 110 for this parameter means the tupling\",\n % \"\\ttransformation will transform a procedure if it thinks\",\n % \"\\tthat procedure would be 10% worse, on average, than\",\n % \"\\twhatever transformed version of the procedure it has in\",\n % \"\\tmind. The default is 100.\",\n % \"--tuple-min-args\",\n % \"\\tThe minimum number of input arguments that the tupling\",\n % \"\\ttransformation will consider passing together as a\",\n % \"\\ttuple. This is mostly to speed up the compilation\",\n % \"\\tprocess by not pursuing (presumably) unfruitful searches.\",\n% This is for measurements by implementors only.\n% \"--no-inline-par-builtins\",\n% \"\\tGenerate calls to the predicates of par_builtin.m, instead of\",\n% \"\\tbodily including their definitions as C code.\",\n% Actually, this is the default for now.\n% This is for measurements by implementors only.\n% \"--always-specialize-in-dep-par-conjs\",\n% \"\\tWhen the transformation for handling dependent parallel conjunctions\",\n% \"\\tadds waits and/or signals around a call, create a specialized\",\n% \"\\tversion of the called procedure, even if this is not profitable.\",\n% '--region-analysis' is not documented because it is still experimental.\n% \"--region-analysis\",\n% \"\\tEnable the analysis for region-based memory management.\"\n ]).\n\n:- pred options_help_hlds_llds_optimization(io::di, io::uo) is det.\n\noptions_help_hlds_llds_optimization -->\n io.write_string(\"\\n Medium-level (HLDS -> LLDS) optimizations:\\n\"),\n write_tabbed_lines([\n \"--no-smart-indexing\",\n \"\\tGenerate switches as a simple if-then-else chains;\",\n \"\\tdisable string hashing and integer table-lookup indexing.\",\n \"--dense-switch-req-density \",\n \"\\tThe jump table generated for an atomic switch\",\n \"\\tmust have at least this percentage of full slots (default: 25).\",\n \"--lookup-switch-req-density \",\n \"\\tThe jump table generated for an atomic switch\",\n \"\\tin which all the outputs are constant terms\",\n \"\\tmust have at least this percentage of full slots (default: 25).\",\n \"--dense-switch-size \",\n \"\\tThe jump table generated for an atomic switch\",\n \"\\tmust have at least this many entries (default: 4).\",\n \"--lookup-switch-size \",\n \"\\tThe lookup table generated for an atomic switch\",\n \"\\tmust have at least this many entries (default: 4).\",\n \"--string-hash-switch-size \",\n \"\\tThe hash table generated for a string switch\",\n \"\\tmust have at least this many entries (default: 8).\",\n \"--string-binary-switch-size \",\n \"\\tThe binary search table generated for a string switch\",\n \"\\tmust have at least this many entries (default: 4).\",\n \"--tag-switch-size \",\n \"\\tThe number of alternatives in a tag switch\",\n \"\\tmust be at least this number (default: 3).\",\n \"--try-switch-size \",\n \"\\tThe number of alternatives in a try/retry chain switch\",\n \"\\tmust be at least this number (default: 3).\",\n \"--binary-switch-size \",\n \"\\tThe number of alternatives in a binary search switch\",\n \"\\tmust be at least this number (default: 4).\",\n% These options are only for performance tests.\n% \"--switch-single-rec-base-first\",\n% \"\\tIn a switch with two arms, one a base case and one with a single\",\n% \"\\trecursive call, put the base case first.\n% \"--switch-multi-rec-base-first\",\n% \"\\tIn a switch with two arms, one a base case and one with multiple\",\n% \"\\trecursive calls, put the base case first.\n \"--no-static-ground-terms\",\n \"\\tDisable the optimization of constructing constant ground terms\",\n \"\\tat compile time and storing them as static constants.\",\n \"\\tNote that auxiliary data structures created by the compiler\",\n \"\\tfor purposes such as debugging will still be created as\",\n \"\\tstatic constants.\",\n \"--no-use-atomic-cells\",\n \"\\tDon't use the atomic variants of the Boehm gc allocator calls,\",\n \"\\teven when this would otherwise be possible.\",\n \"--no-middle-rec\",\n \"\\tDisable the middle recursion optimization.\",\n \"--no-simple-neg\",\n \"\\tDon't generate simplified code for simple negations.\"\n% \"--no-allow-hijacks\",\n% \"\\tDo not generate code in which a procedure hijacks\",\n% \"\\ta nondet stack frame that possibly belongs to\",\n% \"\\tanother procedure invocation\".\n ]).\n\n:- pred options_help_llds_llds_optimization(io::di, io::uo) is det.\n\noptions_help_llds_llds_optimization -->\n io.write_string(\"\\n Low-level (LLDS -> LLDS) optimizations:\\n\"),\n write_tabbed_lines([\n \"--no-common-data\",\n \"\\tDisable optimization of common data structures.\",\n \"--no-common-layout-data\",\n \"\\tDisable optimization of common subsequences in layout structures.\",\n \"--no-llds-optimize\",\n \"\\tDisable the low-level optimization passes.\",\n \"--optimize-dead-procs\",\n \"\\tEnable dead predicate elimination.\",\n \"--no-optimize-peep\",\n \"\\tDisable local peephole optimizations.\",\n% This is useful for developers only, to test whether a gcc bug has been fixed.\n% \"--no-optimize-peep-mkword\",\n% \"\\tDisable peephole optimizations of words created by mkword.\",\n \"--no-optimize-jumps\",\n \"\\tDisable elimination of jumps to jumps.\",\n \"--no-optimize-fulljumps\",\n \"\\tDisable elimination of jumps to ordinary code.\",\n \"--pessimize-tailcalls\",\n \"\\tDisable the optimization of tailcalls.\",\n \"--checked-nondet-tailcalls\",\n \"\\tConvert nondet calls into tail calls whenever possible, even\",\n \"\\twhen this requires a runtime check. This option tries to\",\n \"\\tminimize stack consumption, possibly at the expense of speed.\",\n \"--no-use-local-vars\",\n \"\\tDisable the transformation to use local variables in C code\",\n \"\\tblocks wherever possible.\",\n% This is useful for developers only.\n% \"--standardize-labels\",\n% \"\\tStandardize internal labels in the generated code.\",\n \"--no-optimize-labels\",\n \"\\tDisable elimination of dead labels and code.\",\n \"--optimize-dups\",\n \"\\tEnable elimination of duplicate code within procedures.\",\n \"--optimize-proc-dups\",\n \"\\tEnable elimination of duplicate procedures.\",\n%%% \"--optimize-copyprop\",\n%%% \"\\tEnable the copy propagation optimization.\",\n \"--no-optimize-frames\",\n \"\\tDisable stack frame optimizations.\",\n \"--no-optimize-delay-slot\",\n \"\\tDisable branch delay slot optimizations.\",\n \"--optimize-reassign\",\n \"\\tOptimize away assignments to locations that already hold\",\n \"\\tthe assigned value.\",\n \"--optimize-repeat \",\n \"\\tIterate most optimizations at most times (default: 3).\",\n \"--layout-compression-limit \",\n \"\\tAttempt to compress the layout structures used by the debugger\",\n \"\\tonly as long as the arrays involved have at most elements\",\n \"\\t(default: 4000).\"\n ]).\n\n:- pred options_help_mlds_mlds_optimization(io::di, io::uo) is det.\n\noptions_help_mlds_mlds_optimization -->\n io.write_string(\"\\n MLDS -> MLDS optimizations:\\n\"),\n write_tabbed_lines([\n \"--no-mlds-optimize\",\n \"\\tDisable the MLDS->MLDS optimization passes.\",\n \"--no-mlds-peephole\",\n \"\\tDo not perform peephole optimization of the MLDS.\",\n \"--no-optimize-tailcalls\",\n \"\\tTreat tailcalls as ordinary calls, rather than optimizing\",\n \"\\tby turning self-tailcalls into loops.\",\n \"--no-optimize-initializations\",\n \"\\tLeave initializations of local variables as\",\n \"\\tassignment statements, rather than converting such\",\n \"\\tassignment statements into initializers.\",\n \"--eliminate-local-vars\",\n \"\\tEliminate local variables with known values, where possible,\",\n \"\\tby replacing occurrences of such variables with their values.\",\n \"--no-generate-trail-ops-inline\",\n \"\\tDo not generate trailing operations inline,\",\n \"\\tbut instead insert calls to the versions of these operations\",\n \"\\tin the standard library.\"\n]).\n\n:- pred options_help_hlds_elds_optimization(io::di, io::uo) is det.\n\noptions_help_hlds_elds_optimization -->\n io.write_string(\"\\n HLDS -> ELDS optimizations:\\n\"),\n write_tabbed_lines([\n \"--erlang-switch-on-strings-as-atoms\",\n \"\\tEnable a workaround for slow HiPE compilation of large string\",\n \"\\tswitches by converting the string to an atom at runtime and\",\n \"\\tswitching on atoms. Do not enable if the string switched on\",\n \"\\tcould be longer than 255 characters at runtime.\"\n ]).\n\n:- pred options_help_output_optimization(io::di, io::uo) is det.\n\noptions_help_output_optimization -->\n io.write_string(\"\\n Output-level (LLDS -> C) optimizations:\\n\"),\n write_tabbed_lines([\n \"--use-macro-for-redo-fail\",\n \"\\tEmit the fail or redo macro instead of a branch\",\n \"\\tto the fail or redo code in the runtime system.\",\n \"\\tThis produces slightly bigger but slightly faster code.\",\n \"--no-emit-c-loops\",\n \"\\tUse only gotos, don't emit C loop constructs.\",\n \"--procs-per-c-function \",\n \"\\tPut the code for up to Mercury\",\n \"\\tprocedures in a single C function. The default\",\n \"\\tvalue of is one. Increasing can produce\",\n \"\\tslightly more efficient code, but makes compilation slower.\",\n \"--everything-in-one-c-function\",\n \"\\tThis option has the effect of putting the code for all\",\n \"\\tthe Mercury procedures in a single C function,\",\n \"\\twhich produces the most efficient code but tends to\",\n \"\\tseverely stress the C compiler on large modules.\",\n \"--no-local-thread-engine-base\",\n \"\\tDon't copy the thread-local Mercury engine base address\",\n \"\\tinto local variables. This option only affects low-level\",\n \"\\tparallel grades not using the global register variables\",\n \"\\textension.\"\n ]).\n\n:- pred options_help_target_code_compilation(io::di, io::uo) is det.\n\noptions_help_target_code_compilation -->\n io.write_string(\"\\n Target code compilation:\\n\"),\n write_tabbed_lines([\n \"\\tNote that if you are using Mmake, you need to pass these\",\n \"\\toptions to the target code compiler (e.g. `mgnuc')\",\n \"\\trather than to `mmc'.\",\n\n \"--target-debug\",\n \"\\tEnable debugging of the generated target code.\",\n \"\\tIf the target language is C, this has the same effect as\",\n \"\\t`--c-debug' (see below).\",\n \"\\tIf the target language is IL or C#, this causes the compiler to\",\n \"\\tpass `/debug' to the IL assembler or C# compiler.)\",\n\n \"--cc \",\n \"\\tSpecify which C compiler to use.\",\n\n \"--no-c-optimize\",\n \"\\tDon't enable the C compiler's optimizations.\",\n\n \"--no-ansi-c\",\n \"\\tDon't specify to the C compiler that the ANSI dialect\",\n \"\\tof C should be used. Use the full contents of system\",\n \"\\theaders, rather than the ANSI subset.\",\n\n \"--c-debug\",\n \"\\tEnable debugging of the generated C code.\",\n \"\\t(This has the same effect as `--cflags \"\"-g\"\"'\",\n \"\\tand disables stripping of the executable.)\",\n\n \"--c-include-directory , --c-include-dir \",\n \"\\tAppend to the list of directories to be searched for\",\n \"\\tC header files. Note that if you want to override\",\n \"\\tthis list, rather than append to it, then you can set the\",\n \"\\t`MERCURY_MC_ALL_C_INCL_DIRS' environment variable to a\",\n \"\\tsequence of `--c-include-directory' options.\",\n\n \"--inline-alloc\",\n \"\\tInline calls to GC_malloc().\",\n \"\\tThis can improve performance a fair bit,\",\n \"\\tbut may significantly increase code size.\",\n \"\\tThis option has no effect if `--gc boehm'\",\n \"\\tis not set or if the C compiler is not GNU C.\",\n\n \"--cflags , --cflag
    \n Download\n